[
  {
    "path": ".cardboardlint.yml",
    "content": "linters:\n- pylint:\n    filefilter: ['+ *.py', '+ bin/*.py']\n"
  },
  {
    "path": ".compute",
    "content": "#!/bin/bash\n\nset -xe\n\napt-get install -y python3-venv libopus0\n\npython3 -m venv /tmp/venv\nsource /tmp/venv/bin/activate\n\npip install -U setuptools wheel pip\npip install .\npip uninstall -y tensorflow\npip install tensorflow-gpu==1.14\n\nmkdir -p ../keep/summaries\n\ndata=\"${SHARED_DIR}/data\"\nfis=\"${data}/LDC/fisher\"\nswb=\"${data}/LDC/LDC97S62/swb\"\nlbs=\"${data}/OpenSLR/LibriSpeech/librivox\"\ncv=\"${data}/mozilla/CommonVoice/en_1087h_2019-06-12/clips\"\nnpr=\"${data}/NPR/WAMU/sets/v0.3\"\n\npython -u DeepSpeech.py \\\n  --train_files \"${npr}/best-train.sdb\",\"${npr}/good-train.sdb\",\"${cv}/train.sdb\",\"${fis}-train.sdb\",\"${swb}-train.sdb\",\"${lbs}-train-clean-100.sdb\",\"${lbs}-train-clean-360.sdb\",\"${lbs}-train-other-500.sdb\" \\\n  --dev_files \"${lbs}-dev-clean.sdb\" \\\n  --test_files \"${lbs}-test-clean.sdb\" \\\n  --train_batch_size 24 \\\n  --dev_batch_size 48 \\\n  --test_batch_size 48 \\\n  --train_cudnn \\\n  --n_hidden 2048 \\\n  --learning_rate 0.0001 \\\n  --dropout_rate 0.40 \\\n  --epochs 150 \\\n  --noearly_stop \\\n  --feature_cache \"../tmp/feature.cache\" \\\n  --checkpoint_dir \"../keep\" \\\n  --summary_dir \"../keep/summaries\"\n"
  },
  {
    "path": ".gitattributes",
    "content": "data/lm/kenlm.scorer filter=lfs diff=lfs merge=lfs -text\n.github/actions/check_artifact_exists/dist/index.js binary"
  },
  {
    "path": ".github/actions/build-tensorflow/action.yml",
    "content": "name: \"Build TensorFlow\"\ndescription: \"Build TensorFlow Build\"\ninputs:\n  flavor:\n    description: \"Build flavor\"\n    required: true\nruns:\n  using: \"composite\"\n  steps:\n    - run: ./ci_scripts/tf-build.sh ${{ inputs.flavor }}\n      shell: bash\n"
  },
  {
    "path": ".github/actions/check_artifact_exists/README.md",
    "content": "Building and using a TensorFlow cache:\n======================================\n\nThe present action will check the existence of an artifact in the list of the\nrepo artifacts. Since we don't want always to download the artifact, we can't\nrely on the official download-artifact action.\n\nRationale:\n----------\n\nBecause of the amount of code required to build TensorFlow, the library build\nis split into two main parts to make it much faster to run PRs:\n - a TensorFlow prebuild cache\n - actual code of the library\n\nThe TensorFlow prebuild cache exists because building tensorflow (even just the\n`libtensorflow_cpp.so`) is a huge amount of code and it will take several hours\neven on decent systems. So we perform a cache build of it, because the\ntensorflow version does not change that often.\n\nHowever, each PR might have changes to the actual library code, so we rebuild\nthis everytime.\n\nThe `tensorflow_opt-macOS` job checks whether such build cache exists alrady.\nThose cache are stored as artifacts because [GitHub Actions\ncache](https://docs.github.com/en/actions/guides/caching-dependencies-to-speed-up-workflows)\nhas size limitations.\n\nThe `build-tensorflow-macOS` job has a dependency against the cache check to\nknow whether it needs to run an actual build or not.\n\nHacking:\n--------\n\nFor hacking into the action, please follow the [GitHub JavaScript\nActions](https://docs.github.com/en/actions/creating-actions/creating-a-javascript-action#commit-tag-and-push-your-action-to-github)\nand specifically the usage of `ncc`.\n\n```\n$ npm install\n$ npx ncc build main.js --license licenses.txt\n$ git add dist/\n```\n"
  },
  {
    "path": ".github/actions/check_artifact_exists/action.yml",
    "content": "name: \"check/download artifacts\"\ndescription: \"Check and download that an artifact exists\"\ninputs:\n  name:\n    description: \"Artifact name\"\n    required: true\n  github_token:\n    description: \"GitHub token\"\n    required: false\n    default: ${{ github.token }}\n  download:\n    description: \"Should we download?\"\n    required: false\n    default: false\n  path:\n    description: \"Where to unpack the artifact\"\n    required: false\n    default: \"./\"\n  repo:\n    description: \"Repository name with owner (like actions/checkout)\"\n    required: false\n    default: ${{ github.repository }}\noutputs:\n  status:\n    description: \"Status string of the artifact: 'missing' or 'found'\"\nruns:\n  using: \"node12\"\n  main: \"dist/index.js\"\n"
  },
  {
    "path": ".github/actions/check_artifact_exists/dist/index.js",
    "content": "module.exports =\n/******/ (() => { // webpackBootstrap\n/******/ \tvar __webpack_modules__ = ({\n\n/***/ 5496:\n/***/ ((__unused_webpack_module, __unused_webpack_exports, __nccwpck_require__) => {\n\nconst core = __nccwpck_require__(2186);\nconst github = __nccwpck_require__(5438);\nconst AdmZip = __nccwpck_require__(6761);\nconst filesize = __nccwpck_require__(5060);\nconst pathname = __nccwpck_require__(5622);\nconst fs = __nccwpck_require__(5747);\nconst { throttling } = __nccwpck_require__(9968);\nconst { GitHub } = __nccwpck_require__(3030);\n\nasync function getGoodArtifacts(client, owner, repo, name) {\n    const goodRepoArtifacts = await client.paginate(\n        \"GET /repos/{owner}/{repo}/actions/artifacts\",\n        {\n            owner: owner,\n            repo: repo,\n            per_page: 100,\n        },\n        (repoArtifacts, done) => {\n            // console.log(\" ==> repoArtifacts\", repoArtifacts);\n            const goodArtifacts = repoArtifacts.data.filter((a) => {\n                // console.log(\"==> Artifact check\", a);\n                return a.name == name\n            });\n            if (goodArtifacts.length > 0) {\n                done();\n            }\n            return goodArtifacts;\n        }\n    );\n\n    console.log(\"==> maybe goodRepoArtifacts:\", goodRepoArtifacts);\n    return goodRepoArtifacts;\n}\n\nasync function main() {\n    const token = core.getInput(\"github_token\", { required: true });\n    const [owner, repo] = core.getInput(\"repo\", { required: true }).split(\"/\");\n    const path = core.getInput(\"path\", { required: true });\n    const name = core.getInput(\"name\");\n    const download = core.getInput(\"download\");\n    const OctokitWithThrottling = GitHub.plugin(throttling);\n    const client = new OctokitWithThrottling({\n        auth: token,\n        throttle: {\n            onRateLimit: (retryAfter, options) => {\n                console.log(\n                    `Request quota exhausted for request ${options.method} ${options.url}`\n                );\n\n                // Retry twice after hitting a rate limit error, then give up\n                if (options.request.retryCount <= 2) {\n                    console.log(`Retrying after ${retryAfter} seconds!`);\n                    return true;\n                }\n            },\n            onAbuseLimit: (retryAfter, options) => {\n                // does not retry, only logs a warning\n                console.log(\n                    `Abuse detected for request ${options.method} ${options.url}`\n                );\n            },\n        },\n    });\n    console.log(\"==> Repo:\", owner + \"/\" + repo);\n\n    const goodArtifacts = await getGoodArtifacts(client, owner, repo, name);\n    console.log(\"==> goodArtifacts:\", goodArtifacts);\n\n    let artifactStatus = \"\";\n        if (goodArtifacts.length === 0) {\n        artifactStatus = \"missing\";\n    } else {\n        artifactStatus = \"found\";\n    }\n\n    console.log(\"==> Artifact\", name, artifactStatus);\n    console.log(\"==> download\", download);\n\n    core.setOutput(\"status\", artifactStatus);\n\n    if (artifactStatus === \"found\" && download == \"true\") {\n        console.log(\"==> # artifacts:\", goodArtifacts.length);\n\n        let artifact = goodArtifacts[0];\n\n        console.log(\"==> Artifact:\", artifact.id)\n\n        const size = filesize(artifact.size_in_bytes, { base: 10 })\n\n        console.log(\"==> Downloading:\", artifact.name + \".zip\", `(${size})`)\n\n        const zip = await client.actions.downloadArtifact({\n            owner: owner,\n            repo: repo,\n            artifact_id: artifact.id,\n            archive_format: \"zip\",\n        })\n\n        const dir = name ? path : pathname.join(path, artifact.name)\n\n        fs.mkdirSync(dir, { recursive: true })\n\n        const adm = new AdmZip(Buffer.from(zip.data))\n\n        adm.getEntries().forEach((entry) => {\n            const action = entry.isDirectory ? \"creating\" : \"inflating\"\n            const filepath = pathname.join(dir, entry.entryName)\n            console.log(`  ${action}: ${filepath}`)\n        })\n\n        adm.extractAllTo(dir, true)\n    }\n\n    if (artifactStatus === \"missing\" && download == \"true\") {\n        core.setFailed(\"Required\", name, \"that is missing\");\n    }\n\n    return;\n}\n\n// We have to manually wrap the main function with a try-catch here because\n// GitHub will ignore uncatched exceptions and continue running the workflow,\n// leading to harder to diagnose errors downstream from this action.\ntry {\n    main();\n} catch (error) {\n    core.setFailed(error.message);\n}\n\n\n/***/ }),\n\n/***/ 7351:\n/***/ (function(__unused_webpack_module, exports, __nccwpck_require__) {\n\n\"use strict\";\n\nvar __importStar = (this && this.__importStar) || function (mod) {\n    if (mod && mod.__esModule) return mod;\n    var result = {};\n    if (mod != null) for (var k in mod) if (Object.hasOwnProperty.call(mod, k)) result[k] = mod[k];\n    result[\"default\"] = mod;\n    return result;\n};\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nconst os = __importStar(__nccwpck_require__(2087));\nconst utils_1 = __nccwpck_require__(5278);\n/**\n * Commands\n *\n * Command Format:\n *   ::name key=value,key=value::message\n *\n * Examples:\n *   ::warning::This is the message\n *   ::set-env name=MY_VAR::some value\n */\nfunction issueCommand(command, properties, message) {\n    const cmd = new Command(command, properties, message);\n    process.stdout.write(cmd.toString() + os.EOL);\n}\nexports.issueCommand = issueCommand;\nfunction issue(name, message = '') {\n    issueCommand(name, {}, message);\n}\nexports.issue = issue;\nconst CMD_STRING = '::';\nclass Command {\n    constructor(command, properties, message) {\n        if (!command) {\n            command = 'missing.command';\n        }\n        this.command = command;\n        this.properties = properties;\n        this.message = message;\n    }\n    toString() {\n        let cmdStr = CMD_STRING + this.command;\n        if (this.properties && Object.keys(this.properties).length > 0) {\n            cmdStr += ' ';\n            let first = true;\n            for (const key in this.properties) {\n                if (this.properties.hasOwnProperty(key)) {\n                    const val = this.properties[key];\n                    if (val) {\n                        if (first) {\n                            first = false;\n                        }\n                        else {\n                            cmdStr += ',';\n                        }\n                        cmdStr += `${key}=${escapeProperty(val)}`;\n                    }\n                }\n            }\n        }\n        cmdStr += `${CMD_STRING}${escapeData(this.message)}`;\n        return cmdStr;\n    }\n}\nfunction escapeData(s) {\n    return utils_1.toCommandValue(s)\n        .replace(/%/g, '%25')\n        .replace(/\\r/g, '%0D')\n        .replace(/\\n/g, '%0A');\n}\nfunction escapeProperty(s) {\n    return utils_1.toCommandValue(s)\n        .replace(/%/g, '%25')\n        .replace(/\\r/g, '%0D')\n        .replace(/\\n/g, '%0A')\n        .replace(/:/g, '%3A')\n        .replace(/,/g, '%2C');\n}\n//# sourceMappingURL=command.js.map\n\n/***/ }),\n\n/***/ 2186:\n/***/ (function(__unused_webpack_module, exports, __nccwpck_require__) {\n\n\"use strict\";\n\nvar __awaiter = (this && this.__awaiter) || function (thisArg, _arguments, P, generator) {\n    function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }\n    return new (P || (P = Promise))(function (resolve, reject) {\n        function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }\n        function rejected(value) { try { step(generator[\"throw\"](value)); } catch (e) { reject(e); } }\n        function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }\n        step((generator = generator.apply(thisArg, _arguments || [])).next());\n    });\n};\nvar __importStar = (this && this.__importStar) || function (mod) {\n    if (mod && mod.__esModule) return mod;\n    var result = {};\n    if (mod != null) for (var k in mod) if (Object.hasOwnProperty.call(mod, k)) result[k] = mod[k];\n    result[\"default\"] = mod;\n    return result;\n};\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nconst command_1 = __nccwpck_require__(7351);\nconst file_command_1 = __nccwpck_require__(717);\nconst utils_1 = __nccwpck_require__(5278);\nconst os = __importStar(__nccwpck_require__(2087));\nconst path = __importStar(__nccwpck_require__(5622));\n/**\n * The code to exit an action\n */\nvar ExitCode;\n(function (ExitCode) {\n    /**\n     * A code indicating that the action was successful\n     */\n    ExitCode[ExitCode[\"Success\"] = 0] = \"Success\";\n    /**\n     * A code indicating that the action was a failure\n     */\n    ExitCode[ExitCode[\"Failure\"] = 1] = \"Failure\";\n})(ExitCode = exports.ExitCode || (exports.ExitCode = {}));\n//-----------------------------------------------------------------------\n// Variables\n//-----------------------------------------------------------------------\n/**\n * Sets env variable for this action and future actions in the job\n * @param name the name of the variable to set\n * @param val the value of the variable. Non-string values will be converted to a string via JSON.stringify\n */\n// eslint-disable-next-line @typescript-eslint/no-explicit-any\nfunction exportVariable(name, val) {\n    const convertedVal = utils_1.toCommandValue(val);\n    process.env[name] = convertedVal;\n    const filePath = process.env['GITHUB_ENV'] || '';\n    if (filePath) {\n        const delimiter = '_GitHubActionsFileCommandDelimeter_';\n        const commandValue = `${name}<<${delimiter}${os.EOL}${convertedVal}${os.EOL}${delimiter}`;\n        file_command_1.issueCommand('ENV', commandValue);\n    }\n    else {\n        command_1.issueCommand('set-env', { name }, convertedVal);\n    }\n}\nexports.exportVariable = exportVariable;\n/**\n * Registers a secret which will get masked from logs\n * @param secret value of the secret\n */\nfunction setSecret(secret) {\n    command_1.issueCommand('add-mask', {}, secret);\n}\nexports.setSecret = setSecret;\n/**\n * Prepends inputPath to the PATH (for this action and future actions)\n * @param inputPath\n */\nfunction addPath(inputPath) {\n    const filePath = process.env['GITHUB_PATH'] || '';\n    if (filePath) {\n        file_command_1.issueCommand('PATH', inputPath);\n    }\n    else {\n        command_1.issueCommand('add-path', {}, inputPath);\n    }\n    process.env['PATH'] = `${inputPath}${path.delimiter}${process.env['PATH']}`;\n}\nexports.addPath = addPath;\n/**\n * Gets the value of an input.  The value is also trimmed.\n *\n * @param     name     name of the input to get\n * @param     options  optional. See InputOptions.\n * @returns   string\n */\nfunction getInput(name, options) {\n    const val = process.env[`INPUT_${name.replace(/ /g, '_').toUpperCase()}`] || '';\n    if (options && options.required && !val) {\n        throw new Error(`Input required and not supplied: ${name}`);\n    }\n    return val.trim();\n}\nexports.getInput = getInput;\n/**\n * Sets the value of an output.\n *\n * @param     name     name of the output to set\n * @param     value    value to store. Non-string values will be converted to a string via JSON.stringify\n */\n// eslint-disable-next-line @typescript-eslint/no-explicit-any\nfunction setOutput(name, value) {\n    command_1.issueCommand('set-output', { name }, value);\n}\nexports.setOutput = setOutput;\n/**\n * Enables or disables the echoing of commands into stdout for the rest of the step.\n * Echoing is disabled by default if ACTIONS_STEP_DEBUG is not set.\n *\n */\nfunction setCommandEcho(enabled) {\n    command_1.issue('echo', enabled ? 'on' : 'off');\n}\nexports.setCommandEcho = setCommandEcho;\n//-----------------------------------------------------------------------\n// Results\n//-----------------------------------------------------------------------\n/**\n * Sets the action status to failed.\n * When the action exits it will be with an exit code of 1\n * @param message add error issue message\n */\nfunction setFailed(message) {\n    process.exitCode = ExitCode.Failure;\n    error(message);\n}\nexports.setFailed = setFailed;\n//-----------------------------------------------------------------------\n// Logging Commands\n//-----------------------------------------------------------------------\n/**\n * Gets whether Actions Step Debug is on or not\n */\nfunction isDebug() {\n    return process.env['RUNNER_DEBUG'] === '1';\n}\nexports.isDebug = isDebug;\n/**\n * Writes debug message to user log\n * @param message debug message\n */\nfunction debug(message) {\n    command_1.issueCommand('debug', {}, message);\n}\nexports.debug = debug;\n/**\n * Adds an error issue\n * @param message error issue message. Errors will be converted to string via toString()\n */\nfunction error(message) {\n    command_1.issue('error', message instanceof Error ? message.toString() : message);\n}\nexports.error = error;\n/**\n * Adds an warning issue\n * @param message warning issue message. Errors will be converted to string via toString()\n */\nfunction warning(message) {\n    command_1.issue('warning', message instanceof Error ? message.toString() : message);\n}\nexports.warning = warning;\n/**\n * Writes info to log with console.log.\n * @param message info message\n */\nfunction info(message) {\n    process.stdout.write(message + os.EOL);\n}\nexports.info = info;\n/**\n * Begin an output group.\n *\n * Output until the next `groupEnd` will be foldable in this group\n *\n * @param name The name of the output group\n */\nfunction startGroup(name) {\n    command_1.issue('group', name);\n}\nexports.startGroup = startGroup;\n/**\n * End an output group.\n */\nfunction endGroup() {\n    command_1.issue('endgroup');\n}\nexports.endGroup = endGroup;\n/**\n * Wrap an asynchronous function call in a group.\n *\n * Returns the same type as the function itself.\n *\n * @param name The name of the group\n * @param fn The function to wrap in the group\n */\nfunction group(name, fn) {\n    return __awaiter(this, void 0, void 0, function* () {\n        startGroup(name);\n        let result;\n        try {\n            result = yield fn();\n        }\n        finally {\n            endGroup();\n        }\n        return result;\n    });\n}\nexports.group = group;\n//-----------------------------------------------------------------------\n// Wrapper action state\n//-----------------------------------------------------------------------\n/**\n * Saves state for current action, the state can only be retrieved by this action's post job execution.\n *\n * @param     name     name of the state to store\n * @param     value    value to store. Non-string values will be converted to a string via JSON.stringify\n */\n// eslint-disable-next-line @typescript-eslint/no-explicit-any\nfunction saveState(name, value) {\n    command_1.issueCommand('save-state', { name }, value);\n}\nexports.saveState = saveState;\n/**\n * Gets the value of an state set by this action's main execution.\n *\n * @param     name     name of the state to get\n * @returns   string\n */\nfunction getState(name) {\n    return process.env[`STATE_${name}`] || '';\n}\nexports.getState = getState;\n//# sourceMappingURL=core.js.map\n\n/***/ }),\n\n/***/ 717:\n/***/ (function(__unused_webpack_module, exports, __nccwpck_require__) {\n\n\"use strict\";\n\n// For internal use, subject to change.\nvar __importStar = (this && this.__importStar) || function (mod) {\n    if (mod && mod.__esModule) return mod;\n    var result = {};\n    if (mod != null) for (var k in mod) if (Object.hasOwnProperty.call(mod, k)) result[k] = mod[k];\n    result[\"default\"] = mod;\n    return result;\n};\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\n// We use any as a valid input type\n/* eslint-disable @typescript-eslint/no-explicit-any */\nconst fs = __importStar(__nccwpck_require__(5747));\nconst os = __importStar(__nccwpck_require__(2087));\nconst utils_1 = __nccwpck_require__(5278);\nfunction issueCommand(command, message) {\n    const filePath = process.env[`GITHUB_${command}`];\n    if (!filePath) {\n        throw new Error(`Unable to find environment variable for file command ${command}`);\n    }\n    if (!fs.existsSync(filePath)) {\n        throw new Error(`Missing file at path: ${filePath}`);\n    }\n    fs.appendFileSync(filePath, `${utils_1.toCommandValue(message)}${os.EOL}`, {\n        encoding: 'utf8'\n    });\n}\nexports.issueCommand = issueCommand;\n//# sourceMappingURL=file-command.js.map\n\n/***/ }),\n\n/***/ 5278:\n/***/ ((__unused_webpack_module, exports) => {\n\n\"use strict\";\n\n// We use any as a valid input type\n/* eslint-disable @typescript-eslint/no-explicit-any */\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\n/**\n * Sanitizes an input into a string so it can be passed into issueCommand safely\n * @param input input to sanitize into a string\n */\nfunction toCommandValue(input) {\n    if (input === null || input === undefined) {\n        return '';\n    }\n    else if (typeof input === 'string' || input instanceof String) {\n        return input;\n    }\n    return JSON.stringify(input);\n}\nexports.toCommandValue = toCommandValue;\n//# sourceMappingURL=utils.js.map\n\n/***/ }),\n\n/***/ 4087:\n/***/ ((__unused_webpack_module, exports, __nccwpck_require__) => {\n\n\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.Context = void 0;\nconst fs_1 = __nccwpck_require__(5747);\nconst os_1 = __nccwpck_require__(2087);\nclass Context {\n    /**\n     * Hydrate the context from the environment\n     */\n    constructor() {\n        this.payload = {};\n        if (process.env.GITHUB_EVENT_PATH) {\n            if (fs_1.existsSync(process.env.GITHUB_EVENT_PATH)) {\n                this.payload = JSON.parse(fs_1.readFileSync(process.env.GITHUB_EVENT_PATH, { encoding: 'utf8' }));\n            }\n            else {\n                const path = process.env.GITHUB_EVENT_PATH;\n                process.stdout.write(`GITHUB_EVENT_PATH ${path} does not exist${os_1.EOL}`);\n            }\n        }\n        this.eventName = process.env.GITHUB_EVENT_NAME;\n        this.sha = process.env.GITHUB_SHA;\n        this.ref = process.env.GITHUB_REF;\n        this.workflow = process.env.GITHUB_WORKFLOW;\n        this.action = process.env.GITHUB_ACTION;\n        this.actor = process.env.GITHUB_ACTOR;\n        this.job = process.env.GITHUB_JOB;\n        this.runNumber = parseInt(process.env.GITHUB_RUN_NUMBER, 10);\n        this.runId = parseInt(process.env.GITHUB_RUN_ID, 10);\n    }\n    get issue() {\n        const payload = this.payload;\n        return Object.assign(Object.assign({}, this.repo), { number: (payload.issue || payload.pull_request || payload).number });\n    }\n    get repo() {\n        if (process.env.GITHUB_REPOSITORY) {\n            const [owner, repo] = process.env.GITHUB_REPOSITORY.split('/');\n            return { owner, repo };\n        }\n        if (this.payload.repository) {\n            return {\n                owner: this.payload.repository.owner.login,\n                repo: this.payload.repository.name\n            };\n        }\n        throw new Error(\"context.repo requires a GITHUB_REPOSITORY environment variable like 'owner/repo'\");\n    }\n}\nexports.Context = Context;\n//# sourceMappingURL=context.js.map\n\n/***/ }),\n\n/***/ 5438:\n/***/ (function(__unused_webpack_module, exports, __nccwpck_require__) {\n\n\"use strict\";\n\nvar __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    Object.defineProperty(o, k2, { enumerable: true, get: function() { return m[k]; } });\n}) : (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    o[k2] = m[k];\n}));\nvar __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {\n    Object.defineProperty(o, \"default\", { enumerable: true, value: v });\n}) : function(o, v) {\n    o[\"default\"] = v;\n});\nvar __importStar = (this && this.__importStar) || function (mod) {\n    if (mod && mod.__esModule) return mod;\n    var result = {};\n    if (mod != null) for (var k in mod) if (Object.hasOwnProperty.call(mod, k)) __createBinding(result, mod, k);\n    __setModuleDefault(result, mod);\n    return result;\n};\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.getOctokit = exports.context = void 0;\nconst Context = __importStar(__nccwpck_require__(4087));\nconst utils_1 = __nccwpck_require__(3030);\nexports.context = new Context.Context();\n/**\n * Returns a hydrated octokit ready to use for GitHub Actions\n *\n * @param     token    the repo PAT or GITHUB_TOKEN\n * @param     options  other options to set\n */\nfunction getOctokit(token, options) {\n    return new utils_1.GitHub(utils_1.getOctokitOptions(token, options));\n}\nexports.getOctokit = getOctokit;\n//# sourceMappingURL=github.js.map\n\n/***/ }),\n\n/***/ 7914:\n/***/ (function(__unused_webpack_module, exports, __nccwpck_require__) {\n\n\"use strict\";\n\nvar __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    Object.defineProperty(o, k2, { enumerable: true, get: function() { return m[k]; } });\n}) : (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    o[k2] = m[k];\n}));\nvar __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {\n    Object.defineProperty(o, \"default\", { enumerable: true, value: v });\n}) : function(o, v) {\n    o[\"default\"] = v;\n});\nvar __importStar = (this && this.__importStar) || function (mod) {\n    if (mod && mod.__esModule) return mod;\n    var result = {};\n    if (mod != null) for (var k in mod) if (Object.hasOwnProperty.call(mod, k)) __createBinding(result, mod, k);\n    __setModuleDefault(result, mod);\n    return result;\n};\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.getApiBaseUrl = exports.getProxyAgent = exports.getAuthString = void 0;\nconst httpClient = __importStar(__nccwpck_require__(9925));\nfunction getAuthString(token, options) {\n    if (!token && !options.auth) {\n        throw new Error('Parameter token or opts.auth is required');\n    }\n    else if (token && options.auth) {\n        throw new Error('Parameters token and opts.auth may not both be specified');\n    }\n    return typeof options.auth === 'string' ? options.auth : `token ${token}`;\n}\nexports.getAuthString = getAuthString;\nfunction getProxyAgent(destinationUrl) {\n    const hc = new httpClient.HttpClient();\n    return hc.getAgent(destinationUrl);\n}\nexports.getProxyAgent = getProxyAgent;\nfunction getApiBaseUrl() {\n    return process.env['GITHUB_API_URL'] || 'https://api.github.com';\n}\nexports.getApiBaseUrl = getApiBaseUrl;\n//# sourceMappingURL=utils.js.map\n\n/***/ }),\n\n/***/ 3030:\n/***/ (function(__unused_webpack_module, exports, __nccwpck_require__) {\n\n\"use strict\";\n\nvar __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    Object.defineProperty(o, k2, { enumerable: true, get: function() { return m[k]; } });\n}) : (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    o[k2] = m[k];\n}));\nvar __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {\n    Object.defineProperty(o, \"default\", { enumerable: true, value: v });\n}) : function(o, v) {\n    o[\"default\"] = v;\n});\nvar __importStar = (this && this.__importStar) || function (mod) {\n    if (mod && mod.__esModule) return mod;\n    var result = {};\n    if (mod != null) for (var k in mod) if (Object.hasOwnProperty.call(mod, k)) __createBinding(result, mod, k);\n    __setModuleDefault(result, mod);\n    return result;\n};\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.getOctokitOptions = exports.GitHub = exports.context = void 0;\nconst Context = __importStar(__nccwpck_require__(4087));\nconst Utils = __importStar(__nccwpck_require__(7914));\n// octokit + plugins\nconst core_1 = __nccwpck_require__(6762);\nconst plugin_rest_endpoint_methods_1 = __nccwpck_require__(3044);\nconst plugin_paginate_rest_1 = __nccwpck_require__(4193);\nexports.context = new Context.Context();\nconst baseUrl = Utils.getApiBaseUrl();\nconst defaults = {\n    baseUrl,\n    request: {\n        agent: Utils.getProxyAgent(baseUrl)\n    }\n};\nexports.GitHub = core_1.Octokit.plugin(plugin_rest_endpoint_methods_1.restEndpointMethods, plugin_paginate_rest_1.paginateRest).defaults(defaults);\n/**\n * Convience function to correctly format Octokit Options to pass into the constructor.\n *\n * @param     token    the repo PAT or GITHUB_TOKEN\n * @param     options  other options to set\n */\nfunction getOctokitOptions(token, options) {\n    const opts = Object.assign({}, options || {}); // Shallow clone - don't mutate the object provided by the caller\n    // Auth\n    const auth = Utils.getAuthString(token, opts);\n    if (auth) {\n        opts.auth = auth;\n    }\n    return opts;\n}\nexports.getOctokitOptions = getOctokitOptions;\n//# sourceMappingURL=utils.js.map\n\n/***/ }),\n\n/***/ 9925:\n/***/ ((__unused_webpack_module, exports, __nccwpck_require__) => {\n\n\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nconst http = __nccwpck_require__(8605);\nconst https = __nccwpck_require__(7211);\nconst pm = __nccwpck_require__(6443);\nlet tunnel;\nvar HttpCodes;\n(function (HttpCodes) {\n    HttpCodes[HttpCodes[\"OK\"] = 200] = \"OK\";\n    HttpCodes[HttpCodes[\"MultipleChoices\"] = 300] = \"MultipleChoices\";\n    HttpCodes[HttpCodes[\"MovedPermanently\"] = 301] = \"MovedPermanently\";\n    HttpCodes[HttpCodes[\"ResourceMoved\"] = 302] = \"ResourceMoved\";\n    HttpCodes[HttpCodes[\"SeeOther\"] = 303] = \"SeeOther\";\n    HttpCodes[HttpCodes[\"NotModified\"] = 304] = \"NotModified\";\n    HttpCodes[HttpCodes[\"UseProxy\"] = 305] = \"UseProxy\";\n    HttpCodes[HttpCodes[\"SwitchProxy\"] = 306] = \"SwitchProxy\";\n    HttpCodes[HttpCodes[\"TemporaryRedirect\"] = 307] = \"TemporaryRedirect\";\n    HttpCodes[HttpCodes[\"PermanentRedirect\"] = 308] = \"PermanentRedirect\";\n    HttpCodes[HttpCodes[\"BadRequest\"] = 400] = \"BadRequest\";\n    HttpCodes[HttpCodes[\"Unauthorized\"] = 401] = \"Unauthorized\";\n    HttpCodes[HttpCodes[\"PaymentRequired\"] = 402] = \"PaymentRequired\";\n    HttpCodes[HttpCodes[\"Forbidden\"] = 403] = \"Forbidden\";\n    HttpCodes[HttpCodes[\"NotFound\"] = 404] = \"NotFound\";\n    HttpCodes[HttpCodes[\"MethodNotAllowed\"] = 405] = \"MethodNotAllowed\";\n    HttpCodes[HttpCodes[\"NotAcceptable\"] = 406] = \"NotAcceptable\";\n    HttpCodes[HttpCodes[\"ProxyAuthenticationRequired\"] = 407] = \"ProxyAuthenticationRequired\";\n    HttpCodes[HttpCodes[\"RequestTimeout\"] = 408] = \"RequestTimeout\";\n    HttpCodes[HttpCodes[\"Conflict\"] = 409] = \"Conflict\";\n    HttpCodes[HttpCodes[\"Gone\"] = 410] = \"Gone\";\n    HttpCodes[HttpCodes[\"TooManyRequests\"] = 429] = \"TooManyRequests\";\n    HttpCodes[HttpCodes[\"InternalServerError\"] = 500] = \"InternalServerError\";\n    HttpCodes[HttpCodes[\"NotImplemented\"] = 501] = \"NotImplemented\";\n    HttpCodes[HttpCodes[\"BadGateway\"] = 502] = \"BadGateway\";\n    HttpCodes[HttpCodes[\"ServiceUnavailable\"] = 503] = \"ServiceUnavailable\";\n    HttpCodes[HttpCodes[\"GatewayTimeout\"] = 504] = \"GatewayTimeout\";\n})(HttpCodes = exports.HttpCodes || (exports.HttpCodes = {}));\nvar Headers;\n(function (Headers) {\n    Headers[\"Accept\"] = \"accept\";\n    Headers[\"ContentType\"] = \"content-type\";\n})(Headers = exports.Headers || (exports.Headers = {}));\nvar MediaTypes;\n(function (MediaTypes) {\n    MediaTypes[\"ApplicationJson\"] = \"application/json\";\n})(MediaTypes = exports.MediaTypes || (exports.MediaTypes = {}));\n/**\n * Returns the proxy URL, depending upon the supplied url and proxy environment variables.\n * @param serverUrl  The server URL where the request will be sent. For example, https://api.github.com\n */\nfunction getProxyUrl(serverUrl) {\n    let proxyUrl = pm.getProxyUrl(new URL(serverUrl));\n    return proxyUrl ? proxyUrl.href : '';\n}\nexports.getProxyUrl = getProxyUrl;\nconst HttpRedirectCodes = [\n    HttpCodes.MovedPermanently,\n    HttpCodes.ResourceMoved,\n    HttpCodes.SeeOther,\n    HttpCodes.TemporaryRedirect,\n    HttpCodes.PermanentRedirect\n];\nconst HttpResponseRetryCodes = [\n    HttpCodes.BadGateway,\n    HttpCodes.ServiceUnavailable,\n    HttpCodes.GatewayTimeout\n];\nconst RetryableHttpVerbs = ['OPTIONS', 'GET', 'DELETE', 'HEAD'];\nconst ExponentialBackoffCeiling = 10;\nconst ExponentialBackoffTimeSlice = 5;\nclass HttpClientError extends Error {\n    constructor(message, statusCode) {\n        super(message);\n        this.name = 'HttpClientError';\n        this.statusCode = statusCode;\n        Object.setPrototypeOf(this, HttpClientError.prototype);\n    }\n}\nexports.HttpClientError = HttpClientError;\nclass HttpClientResponse {\n    constructor(message) {\n        this.message = message;\n    }\n    readBody() {\n        return new Promise(async (resolve, reject) => {\n            let output = Buffer.alloc(0);\n            this.message.on('data', (chunk) => {\n                output = Buffer.concat([output, chunk]);\n            });\n            this.message.on('end', () => {\n                resolve(output.toString());\n            });\n        });\n    }\n}\nexports.HttpClientResponse = HttpClientResponse;\nfunction isHttps(requestUrl) {\n    let parsedUrl = new URL(requestUrl);\n    return parsedUrl.protocol === 'https:';\n}\nexports.isHttps = isHttps;\nclass HttpClient {\n    constructor(userAgent, handlers, requestOptions) {\n        this._ignoreSslError = false;\n        this._allowRedirects = true;\n        this._allowRedirectDowngrade = false;\n        this._maxRedirects = 50;\n        this._allowRetries = false;\n        this._maxRetries = 1;\n        this._keepAlive = false;\n        this._disposed = false;\n        this.userAgent = userAgent;\n        this.handlers = handlers || [];\n        this.requestOptions = requestOptions;\n        if (requestOptions) {\n            if (requestOptions.ignoreSslError != null) {\n                this._ignoreSslError = requestOptions.ignoreSslError;\n            }\n            this._socketTimeout = requestOptions.socketTimeout;\n            if (requestOptions.allowRedirects != null) {\n                this._allowRedirects = requestOptions.allowRedirects;\n            }\n            if (requestOptions.allowRedirectDowngrade != null) {\n                this._allowRedirectDowngrade = requestOptions.allowRedirectDowngrade;\n            }\n            if (requestOptions.maxRedirects != null) {\n                this._maxRedirects = Math.max(requestOptions.maxRedirects, 0);\n            }\n            if (requestOptions.keepAlive != null) {\n                this._keepAlive = requestOptions.keepAlive;\n            }\n            if (requestOptions.allowRetries != null) {\n                this._allowRetries = requestOptions.allowRetries;\n            }\n            if (requestOptions.maxRetries != null) {\n                this._maxRetries = requestOptions.maxRetries;\n            }\n        }\n    }\n    options(requestUrl, additionalHeaders) {\n        return this.request('OPTIONS', requestUrl, null, additionalHeaders || {});\n    }\n    get(requestUrl, additionalHeaders) {\n        return this.request('GET', requestUrl, null, additionalHeaders || {});\n    }\n    del(requestUrl, additionalHeaders) {\n        return this.request('DELETE', requestUrl, null, additionalHeaders || {});\n    }\n    post(requestUrl, data, additionalHeaders) {\n        return this.request('POST', requestUrl, data, additionalHeaders || {});\n    }\n    patch(requestUrl, data, additionalHeaders) {\n        return this.request('PATCH', requestUrl, data, additionalHeaders || {});\n    }\n    put(requestUrl, data, additionalHeaders) {\n        return this.request('PUT', requestUrl, data, additionalHeaders || {});\n    }\n    head(requestUrl, additionalHeaders) {\n        return this.request('HEAD', requestUrl, null, additionalHeaders || {});\n    }\n    sendStream(verb, requestUrl, stream, additionalHeaders) {\n        return this.request(verb, requestUrl, stream, additionalHeaders);\n    }\n    /**\n     * Gets a typed object from an endpoint\n     * Be aware that not found returns a null.  Other errors (4xx, 5xx) reject the promise\n     */\n    async getJson(requestUrl, additionalHeaders = {}) {\n        additionalHeaders[Headers.Accept] = this._getExistingOrDefaultHeader(additionalHeaders, Headers.Accept, MediaTypes.ApplicationJson);\n        let res = await this.get(requestUrl, additionalHeaders);\n        return this._processResponse(res, this.requestOptions);\n    }\n    async postJson(requestUrl, obj, additionalHeaders = {}) {\n        let data = JSON.stringify(obj, null, 2);\n        additionalHeaders[Headers.Accept] = this._getExistingOrDefaultHeader(additionalHeaders, Headers.Accept, MediaTypes.ApplicationJson);\n        additionalHeaders[Headers.ContentType] = this._getExistingOrDefaultHeader(additionalHeaders, Headers.ContentType, MediaTypes.ApplicationJson);\n        let res = await this.post(requestUrl, data, additionalHeaders);\n        return this._processResponse(res, this.requestOptions);\n    }\n    async putJson(requestUrl, obj, additionalHeaders = {}) {\n        let data = JSON.stringify(obj, null, 2);\n        additionalHeaders[Headers.Accept] = this._getExistingOrDefaultHeader(additionalHeaders, Headers.Accept, MediaTypes.ApplicationJson);\n        additionalHeaders[Headers.ContentType] = this._getExistingOrDefaultHeader(additionalHeaders, Headers.ContentType, MediaTypes.ApplicationJson);\n        let res = await this.put(requestUrl, data, additionalHeaders);\n        return this._processResponse(res, this.requestOptions);\n    }\n    async patchJson(requestUrl, obj, additionalHeaders = {}) {\n        let data = JSON.stringify(obj, null, 2);\n        additionalHeaders[Headers.Accept] = this._getExistingOrDefaultHeader(additionalHeaders, Headers.Accept, MediaTypes.ApplicationJson);\n        additionalHeaders[Headers.ContentType] = this._getExistingOrDefaultHeader(additionalHeaders, Headers.ContentType, MediaTypes.ApplicationJson);\n        let res = await this.patch(requestUrl, data, additionalHeaders);\n        return this._processResponse(res, this.requestOptions);\n    }\n    /**\n     * Makes a raw http request.\n     * All other methods such as get, post, patch, and request ultimately call this.\n     * Prefer get, del, post and patch\n     */\n    async request(verb, requestUrl, data, headers) {\n        if (this._disposed) {\n            throw new Error('Client has already been disposed.');\n        }\n        let parsedUrl = new URL(requestUrl);\n        let info = this._prepareRequest(verb, parsedUrl, headers);\n        // Only perform retries on reads since writes may not be idempotent.\n        let maxTries = this._allowRetries && RetryableHttpVerbs.indexOf(verb) != -1\n            ? this._maxRetries + 1\n            : 1;\n        let numTries = 0;\n        let response;\n        while (numTries < maxTries) {\n            response = await this.requestRaw(info, data);\n            // Check if it's an authentication challenge\n            if (response &&\n                response.message &&\n                response.message.statusCode === HttpCodes.Unauthorized) {\n                let authenticationHandler;\n                for (let i = 0; i < this.handlers.length; i++) {\n                    if (this.handlers[i].canHandleAuthentication(response)) {\n                        authenticationHandler = this.handlers[i];\n                        break;\n                    }\n                }\n                if (authenticationHandler) {\n                    return authenticationHandler.handleAuthentication(this, info, data);\n                }\n                else {\n                    // We have received an unauthorized response but have no handlers to handle it.\n                    // Let the response return to the caller.\n                    return response;\n                }\n            }\n            let redirectsRemaining = this._maxRedirects;\n            while (HttpRedirectCodes.indexOf(response.message.statusCode) != -1 &&\n                this._allowRedirects &&\n                redirectsRemaining > 0) {\n                const redirectUrl = response.message.headers['location'];\n                if (!redirectUrl) {\n                    // if there's no location to redirect to, we won't\n                    break;\n                }\n                let parsedRedirectUrl = new URL(redirectUrl);\n                if (parsedUrl.protocol == 'https:' &&\n                    parsedUrl.protocol != parsedRedirectUrl.protocol &&\n                    !this._allowRedirectDowngrade) {\n                    throw new Error('Redirect from HTTPS to HTTP protocol. This downgrade is not allowed for security reasons. If you want to allow this behavior, set the allowRedirectDowngrade option to true.');\n                }\n                // we need to finish reading the response before reassigning response\n                // which will leak the open socket.\n                await response.readBody();\n                // strip authorization header if redirected to a different hostname\n                if (parsedRedirectUrl.hostname !== parsedUrl.hostname) {\n                    for (let header in headers) {\n                        // header names are case insensitive\n                        if (header.toLowerCase() === 'authorization') {\n                            delete headers[header];\n                        }\n                    }\n                }\n                // let's make the request with the new redirectUrl\n                info = this._prepareRequest(verb, parsedRedirectUrl, headers);\n                response = await this.requestRaw(info, data);\n                redirectsRemaining--;\n            }\n            if (HttpResponseRetryCodes.indexOf(response.message.statusCode) == -1) {\n                // If not a retry code, return immediately instead of retrying\n                return response;\n            }\n            numTries += 1;\n            if (numTries < maxTries) {\n                await response.readBody();\n                await this._performExponentialBackoff(numTries);\n            }\n        }\n        return response;\n    }\n    /**\n     * Needs to be called if keepAlive is set to true in request options.\n     */\n    dispose() {\n        if (this._agent) {\n            this._agent.destroy();\n        }\n        this._disposed = true;\n    }\n    /**\n     * Raw request.\n     * @param info\n     * @param data\n     */\n    requestRaw(info, data) {\n        return new Promise((resolve, reject) => {\n            let callbackForResult = function (err, res) {\n                if (err) {\n                    reject(err);\n                }\n                resolve(res);\n            };\n            this.requestRawWithCallback(info, data, callbackForResult);\n        });\n    }\n    /**\n     * Raw request with callback.\n     * @param info\n     * @param data\n     * @param onResult\n     */\n    requestRawWithCallback(info, data, onResult) {\n        let socket;\n        if (typeof data === 'string') {\n            info.options.headers['Content-Length'] = Buffer.byteLength(data, 'utf8');\n        }\n        let callbackCalled = false;\n        let handleResult = (err, res) => {\n            if (!callbackCalled) {\n                callbackCalled = true;\n                onResult(err, res);\n            }\n        };\n        let req = info.httpModule.request(info.options, (msg) => {\n            let res = new HttpClientResponse(msg);\n            handleResult(null, res);\n        });\n        req.on('socket', sock => {\n            socket = sock;\n        });\n        // If we ever get disconnected, we want the socket to timeout eventually\n        req.setTimeout(this._socketTimeout || 3 * 60000, () => {\n            if (socket) {\n                socket.end();\n            }\n            handleResult(new Error('Request timeout: ' + info.options.path), null);\n        });\n        req.on('error', function (err) {\n            // err has statusCode property\n            // res should have headers\n            handleResult(err, null);\n        });\n        if (data && typeof data === 'string') {\n            req.write(data, 'utf8');\n        }\n        if (data && typeof data !== 'string') {\n            data.on('close', function () {\n                req.end();\n            });\n            data.pipe(req);\n        }\n        else {\n            req.end();\n        }\n    }\n    /**\n     * Gets an http agent. This function is useful when you need an http agent that handles\n     * routing through a proxy server - depending upon the url and proxy environment variables.\n     * @param serverUrl  The server URL where the request will be sent. For example, https://api.github.com\n     */\n    getAgent(serverUrl) {\n        let parsedUrl = new URL(serverUrl);\n        return this._getAgent(parsedUrl);\n    }\n    _prepareRequest(method, requestUrl, headers) {\n        const info = {};\n        info.parsedUrl = requestUrl;\n        const usingSsl = info.parsedUrl.protocol === 'https:';\n        info.httpModule = usingSsl ? https : http;\n        const defaultPort = usingSsl ? 443 : 80;\n        info.options = {};\n        info.options.host = info.parsedUrl.hostname;\n        info.options.port = info.parsedUrl.port\n            ? parseInt(info.parsedUrl.port)\n            : defaultPort;\n        info.options.path =\n            (info.parsedUrl.pathname || '') + (info.parsedUrl.search || '');\n        info.options.method = method;\n        info.options.headers = this._mergeHeaders(headers);\n        if (this.userAgent != null) {\n            info.options.headers['user-agent'] = this.userAgent;\n        }\n        info.options.agent = this._getAgent(info.parsedUrl);\n        // gives handlers an opportunity to participate\n        if (this.handlers) {\n            this.handlers.forEach(handler => {\n                handler.prepareRequest(info.options);\n            });\n        }\n        return info;\n    }\n    _mergeHeaders(headers) {\n        const lowercaseKeys = obj => Object.keys(obj).reduce((c, k) => ((c[k.toLowerCase()] = obj[k]), c), {});\n        if (this.requestOptions && this.requestOptions.headers) {\n            return Object.assign({}, lowercaseKeys(this.requestOptions.headers), lowercaseKeys(headers));\n        }\n        return lowercaseKeys(headers || {});\n    }\n    _getExistingOrDefaultHeader(additionalHeaders, header, _default) {\n        const lowercaseKeys = obj => Object.keys(obj).reduce((c, k) => ((c[k.toLowerCase()] = obj[k]), c), {});\n        let clientHeader;\n        if (this.requestOptions && this.requestOptions.headers) {\n            clientHeader = lowercaseKeys(this.requestOptions.headers)[header];\n        }\n        return additionalHeaders[header] || clientHeader || _default;\n    }\n    _getAgent(parsedUrl) {\n        let agent;\n        let proxyUrl = pm.getProxyUrl(parsedUrl);\n        let useProxy = proxyUrl && proxyUrl.hostname;\n        if (this._keepAlive && useProxy) {\n            agent = this._proxyAgent;\n        }\n        if (this._keepAlive && !useProxy) {\n            agent = this._agent;\n        }\n        // if agent is already assigned use that agent.\n        if (!!agent) {\n            return agent;\n        }\n        const usingSsl = parsedUrl.protocol === 'https:';\n        let maxSockets = 100;\n        if (!!this.requestOptions) {\n            maxSockets = this.requestOptions.maxSockets || http.globalAgent.maxSockets;\n        }\n        if (useProxy) {\n            // If using proxy, need tunnel\n            if (!tunnel) {\n                tunnel = __nccwpck_require__(4294);\n            }\n            const agentOptions = {\n                maxSockets: maxSockets,\n                keepAlive: this._keepAlive,\n                proxy: {\n                    ...((proxyUrl.username || proxyUrl.password) && {\n                        proxyAuth: `${proxyUrl.username}:${proxyUrl.password}`\n                    }),\n                    host: proxyUrl.hostname,\n                    port: proxyUrl.port\n                }\n            };\n            let tunnelAgent;\n            const overHttps = proxyUrl.protocol === 'https:';\n            if (usingSsl) {\n                tunnelAgent = overHttps ? tunnel.httpsOverHttps : tunnel.httpsOverHttp;\n            }\n            else {\n                tunnelAgent = overHttps ? tunnel.httpOverHttps : tunnel.httpOverHttp;\n            }\n            agent = tunnelAgent(agentOptions);\n            this._proxyAgent = agent;\n        }\n        // if reusing agent across request and tunneling agent isn't assigned create a new agent\n        if (this._keepAlive && !agent) {\n            const options = { keepAlive: this._keepAlive, maxSockets: maxSockets };\n            agent = usingSsl ? new https.Agent(options) : new http.Agent(options);\n            this._agent = agent;\n        }\n        // if not using private agent and tunnel agent isn't setup then use global agent\n        if (!agent) {\n            agent = usingSsl ? https.globalAgent : http.globalAgent;\n        }\n        if (usingSsl && this._ignoreSslError) {\n            // we don't want to set NODE_TLS_REJECT_UNAUTHORIZED=0 since that will affect request for entire process\n            // http.RequestOptions doesn't expose a way to modify RequestOptions.agent.options\n            // we have to cast it to any and change it directly\n            agent.options = Object.assign(agent.options || {}, {\n                rejectUnauthorized: false\n            });\n        }\n        return agent;\n    }\n    _performExponentialBackoff(retryNumber) {\n        retryNumber = Math.min(ExponentialBackoffCeiling, retryNumber);\n        const ms = ExponentialBackoffTimeSlice * Math.pow(2, retryNumber);\n        return new Promise(resolve => setTimeout(() => resolve(), ms));\n    }\n    static dateTimeDeserializer(key, value) {\n        if (typeof value === 'string') {\n            let a = new Date(value);\n            if (!isNaN(a.valueOf())) {\n                return a;\n            }\n        }\n        return value;\n    }\n    async _processResponse(res, options) {\n        return new Promise(async (resolve, reject) => {\n            const statusCode = res.message.statusCode;\n            const response = {\n                statusCode: statusCode,\n                result: null,\n                headers: {}\n            };\n            // not found leads to null obj returned\n            if (statusCode == HttpCodes.NotFound) {\n                resolve(response);\n            }\n            let obj;\n            let contents;\n            // get the result from the body\n            try {\n                contents = await res.readBody();\n                if (contents && contents.length > 0) {\n                    if (options && options.deserializeDates) {\n                        obj = JSON.parse(contents, HttpClient.dateTimeDeserializer);\n                    }\n                    else {\n                        obj = JSON.parse(contents);\n                    }\n                    response.result = obj;\n                }\n                response.headers = res.message.headers;\n            }\n            catch (err) {\n                // Invalid resource (contents not json);  leaving result obj null\n            }\n            // note that 3xx redirects are handled by the http layer.\n            if (statusCode > 299) {\n                let msg;\n                // if exception/error in body, attempt to get better error\n                if (obj && obj.message) {\n                    msg = obj.message;\n                }\n                else if (contents && contents.length > 0) {\n                    // it may be the case that the exception is in the body message as string\n                    msg = contents;\n                }\n                else {\n                    msg = 'Failed request: (' + statusCode + ')';\n                }\n                let err = new HttpClientError(msg, statusCode);\n                err.result = response.result;\n                reject(err);\n            }\n            else {\n                resolve(response);\n            }\n        });\n    }\n}\nexports.HttpClient = HttpClient;\n\n\n/***/ }),\n\n/***/ 6443:\n/***/ ((__unused_webpack_module, exports) => {\n\n\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nfunction getProxyUrl(reqUrl) {\n    let usingSsl = reqUrl.protocol === 'https:';\n    let proxyUrl;\n    if (checkBypass(reqUrl)) {\n        return proxyUrl;\n    }\n    let proxyVar;\n    if (usingSsl) {\n        proxyVar = process.env['https_proxy'] || process.env['HTTPS_PROXY'];\n    }\n    else {\n        proxyVar = process.env['http_proxy'] || process.env['HTTP_PROXY'];\n    }\n    if (proxyVar) {\n        proxyUrl = new URL(proxyVar);\n    }\n    return proxyUrl;\n}\nexports.getProxyUrl = getProxyUrl;\nfunction checkBypass(reqUrl) {\n    if (!reqUrl.hostname) {\n        return false;\n    }\n    let noProxy = process.env['no_proxy'] || process.env['NO_PROXY'] || '';\n    if (!noProxy) {\n        return false;\n    }\n    // Determine the request port\n    let reqPort;\n    if (reqUrl.port) {\n        reqPort = Number(reqUrl.port);\n    }\n    else if (reqUrl.protocol === 'http:') {\n        reqPort = 80;\n    }\n    else if (reqUrl.protocol === 'https:') {\n        reqPort = 443;\n    }\n    // Format the request hostname and hostname with port\n    let upperReqHosts = [reqUrl.hostname.toUpperCase()];\n    if (typeof reqPort === 'number') {\n        upperReqHosts.push(`${upperReqHosts[0]}:${reqPort}`);\n    }\n    // Compare request host against noproxy\n    for (let upperNoProxyItem of noProxy\n        .split(',')\n        .map(x => x.trim().toUpperCase())\n        .filter(x => x)) {\n        if (upperReqHosts.some(x => x === upperNoProxyItem)) {\n            return true;\n        }\n    }\n    return false;\n}\nexports.checkBypass = checkBypass;\n\n\n/***/ }),\n\n/***/ 334:\n/***/ ((__unused_webpack_module, exports) => {\n\n\"use strict\";\n\n\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\n\nasync function auth(token) {\n  const tokenType = token.split(/\\./).length === 3 ? \"app\" : /^v\\d+\\./.test(token) ? \"installation\" : \"oauth\";\n  return {\n    type: \"token\",\n    token: token,\n    tokenType\n  };\n}\n\n/**\n * Prefix token for usage in the Authorization header\n *\n * @param token OAuth token or JSON Web Token\n */\nfunction withAuthorizationPrefix(token) {\n  if (token.split(/\\./).length === 3) {\n    return `bearer ${token}`;\n  }\n\n  return `token ${token}`;\n}\n\nasync function hook(token, request, route, parameters) {\n  const endpoint = request.endpoint.merge(route, parameters);\n  endpoint.headers.authorization = withAuthorizationPrefix(token);\n  return request(endpoint);\n}\n\nconst createTokenAuth = function createTokenAuth(token) {\n  if (!token) {\n    throw new Error(\"[@octokit/auth-token] No token passed to createTokenAuth\");\n  }\n\n  if (typeof token !== \"string\") {\n    throw new Error(\"[@octokit/auth-token] Token passed to createTokenAuth is not a string\");\n  }\n\n  token = token.replace(/^(token|bearer) +/i, \"\");\n  return Object.assign(auth.bind(null, token), {\n    hook: hook.bind(null, token)\n  });\n};\n\nexports.createTokenAuth = createTokenAuth;\n//# sourceMappingURL=index.js.map\n\n\n/***/ }),\n\n/***/ 6762:\n/***/ ((__unused_webpack_module, exports, __nccwpck_require__) => {\n\n\"use strict\";\n\n\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\n\nvar universalUserAgent = __nccwpck_require__(5030);\nvar beforeAfterHook = __nccwpck_require__(3682);\nvar request = __nccwpck_require__(6234);\nvar graphql = __nccwpck_require__(8467);\nvar authToken = __nccwpck_require__(334);\n\nfunction _objectWithoutPropertiesLoose(source, excluded) {\n  if (source == null) return {};\n  var target = {};\n  var sourceKeys = Object.keys(source);\n  var key, i;\n\n  for (i = 0; i < sourceKeys.length; i++) {\n    key = sourceKeys[i];\n    if (excluded.indexOf(key) >= 0) continue;\n    target[key] = source[key];\n  }\n\n  return target;\n}\n\nfunction _objectWithoutProperties(source, excluded) {\n  if (source == null) return {};\n\n  var target = _objectWithoutPropertiesLoose(source, excluded);\n\n  var key, i;\n\n  if (Object.getOwnPropertySymbols) {\n    var sourceSymbolKeys = Object.getOwnPropertySymbols(source);\n\n    for (i = 0; i < sourceSymbolKeys.length; i++) {\n      key = sourceSymbolKeys[i];\n      if (excluded.indexOf(key) >= 0) continue;\n      if (!Object.prototype.propertyIsEnumerable.call(source, key)) continue;\n      target[key] = source[key];\n    }\n  }\n\n  return target;\n}\n\nconst VERSION = \"3.4.0\";\n\nclass Octokit {\n  constructor(options = {}) {\n    const hook = new beforeAfterHook.Collection();\n    const requestDefaults = {\n      baseUrl: request.request.endpoint.DEFAULTS.baseUrl,\n      headers: {},\n      request: Object.assign({}, options.request, {\n        // @ts-ignore internal usage only, no need to type\n        hook: hook.bind(null, \"request\")\n      }),\n      mediaType: {\n        previews: [],\n        format: \"\"\n      }\n    }; // prepend default user agent with `options.userAgent` if set\n\n    requestDefaults.headers[\"user-agent\"] = [options.userAgent, `octokit-core.js/${VERSION} ${universalUserAgent.getUserAgent()}`].filter(Boolean).join(\" \");\n\n    if (options.baseUrl) {\n      requestDefaults.baseUrl = options.baseUrl;\n    }\n\n    if (options.previews) {\n      requestDefaults.mediaType.previews = options.previews;\n    }\n\n    if (options.timeZone) {\n      requestDefaults.headers[\"time-zone\"] = options.timeZone;\n    }\n\n    this.request = request.request.defaults(requestDefaults);\n    this.graphql = graphql.withCustomRequest(this.request).defaults(requestDefaults);\n    this.log = Object.assign({\n      debug: () => {},\n      info: () => {},\n      warn: console.warn.bind(console),\n      error: console.error.bind(console)\n    }, options.log);\n    this.hook = hook; // (1) If neither `options.authStrategy` nor `options.auth` are set, the `octokit` instance\n    //     is unauthenticated. The `this.auth()` method is a no-op and no request hook is registered.\n    // (2) If only `options.auth` is set, use the default token authentication strategy.\n    // (3) If `options.authStrategy` is set then use it and pass in `options.auth`. Always pass own request as many strategies accept a custom request instance.\n    // TODO: type `options.auth` based on `options.authStrategy`.\n\n    if (!options.authStrategy) {\n      if (!options.auth) {\n        // (1)\n        this.auth = async () => ({\n          type: \"unauthenticated\"\n        });\n      } else {\n        // (2)\n        const auth = authToken.createTokenAuth(options.auth); // @ts-ignore  ¯\\_(ツ)_/¯\n\n        hook.wrap(\"request\", auth.hook);\n        this.auth = auth;\n      }\n    } else {\n      const {\n        authStrategy\n      } = options,\n            otherOptions = _objectWithoutProperties(options, [\"authStrategy\"]);\n\n      const auth = authStrategy(Object.assign({\n        request: this.request,\n        log: this.log,\n        // we pass the current octokit instance as well as its constructor options\n        // to allow for authentication strategies that return a new octokit instance\n        // that shares the same internal state as the current one. The original\n        // requirement for this was the \"event-octokit\" authentication strategy\n        // of https://github.com/probot/octokit-auth-probot.\n        octokit: this,\n        octokitOptions: otherOptions\n      }, options.auth)); // @ts-ignore  ¯\\_(ツ)_/¯\n\n      hook.wrap(\"request\", auth.hook);\n      this.auth = auth;\n    } // apply plugins\n    // https://stackoverflow.com/a/16345172\n\n\n    const classConstructor = this.constructor;\n    classConstructor.plugins.forEach(plugin => {\n      Object.assign(this, plugin(this, options));\n    });\n  }\n\n  static defaults(defaults) {\n    const OctokitWithDefaults = class extends this {\n      constructor(...args) {\n        const options = args[0] || {};\n\n        if (typeof defaults === \"function\") {\n          super(defaults(options));\n          return;\n        }\n\n        super(Object.assign({}, defaults, options, options.userAgent && defaults.userAgent ? {\n          userAgent: `${options.userAgent} ${defaults.userAgent}`\n        } : null));\n      }\n\n    };\n    return OctokitWithDefaults;\n  }\n  /**\n   * Attach a plugin (or many) to your Octokit instance.\n   *\n   * @example\n   * const API = Octokit.plugin(plugin1, plugin2, plugin3, ...)\n   */\n\n\n  static plugin(...newPlugins) {\n    var _a;\n\n    const currentPlugins = this.plugins;\n    const NewOctokit = (_a = class extends this {}, _a.plugins = currentPlugins.concat(newPlugins.filter(plugin => !currentPlugins.includes(plugin))), _a);\n    return NewOctokit;\n  }\n\n}\nOctokit.VERSION = VERSION;\nOctokit.plugins = [];\n\nexports.Octokit = Octokit;\n//# sourceMappingURL=index.js.map\n\n\n/***/ }),\n\n/***/ 9440:\n/***/ ((__unused_webpack_module, exports, __nccwpck_require__) => {\n\n\"use strict\";\n\n\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\n\nvar isPlainObject = __nccwpck_require__(3287);\nvar universalUserAgent = __nccwpck_require__(5030);\n\nfunction lowercaseKeys(object) {\n  if (!object) {\n    return {};\n  }\n\n  return Object.keys(object).reduce((newObj, key) => {\n    newObj[key.toLowerCase()] = object[key];\n    return newObj;\n  }, {});\n}\n\nfunction mergeDeep(defaults, options) {\n  const result = Object.assign({}, defaults);\n  Object.keys(options).forEach(key => {\n    if (isPlainObject.isPlainObject(options[key])) {\n      if (!(key in defaults)) Object.assign(result, {\n        [key]: options[key]\n      });else result[key] = mergeDeep(defaults[key], options[key]);\n    } else {\n      Object.assign(result, {\n        [key]: options[key]\n      });\n    }\n  });\n  return result;\n}\n\nfunction removeUndefinedProperties(obj) {\n  for (const key in obj) {\n    if (obj[key] === undefined) {\n      delete obj[key];\n    }\n  }\n\n  return obj;\n}\n\nfunction merge(defaults, route, options) {\n  if (typeof route === \"string\") {\n    let [method, url] = route.split(\" \");\n    options = Object.assign(url ? {\n      method,\n      url\n    } : {\n      url: method\n    }, options);\n  } else {\n    options = Object.assign({}, route);\n  } // lowercase header names before merging with defaults to avoid duplicates\n\n\n  options.headers = lowercaseKeys(options.headers); // remove properties with undefined values before merging\n\n  removeUndefinedProperties(options);\n  removeUndefinedProperties(options.headers);\n  const mergedOptions = mergeDeep(defaults || {}, options); // mediaType.previews arrays are merged, instead of overwritten\n\n  if (defaults && defaults.mediaType.previews.length) {\n    mergedOptions.mediaType.previews = defaults.mediaType.previews.filter(preview => !mergedOptions.mediaType.previews.includes(preview)).concat(mergedOptions.mediaType.previews);\n  }\n\n  mergedOptions.mediaType.previews = mergedOptions.mediaType.previews.map(preview => preview.replace(/-preview/, \"\"));\n  return mergedOptions;\n}\n\nfunction addQueryParameters(url, parameters) {\n  const separator = /\\?/.test(url) ? \"&\" : \"?\";\n  const names = Object.keys(parameters);\n\n  if (names.length === 0) {\n    return url;\n  }\n\n  return url + separator + names.map(name => {\n    if (name === \"q\") {\n      return \"q=\" + parameters.q.split(\"+\").map(encodeURIComponent).join(\"+\");\n    }\n\n    return `${name}=${encodeURIComponent(parameters[name])}`;\n  }).join(\"&\");\n}\n\nconst urlVariableRegex = /\\{[^}]+\\}/g;\n\nfunction removeNonChars(variableName) {\n  return variableName.replace(/^\\W+|\\W+$/g, \"\").split(/,/);\n}\n\nfunction extractUrlVariableNames(url) {\n  const matches = url.match(urlVariableRegex);\n\n  if (!matches) {\n    return [];\n  }\n\n  return matches.map(removeNonChars).reduce((a, b) => a.concat(b), []);\n}\n\nfunction omit(object, keysToOmit) {\n  return Object.keys(object).filter(option => !keysToOmit.includes(option)).reduce((obj, key) => {\n    obj[key] = object[key];\n    return obj;\n  }, {});\n}\n\n// Based on https://github.com/bramstein/url-template, licensed under BSD\n// TODO: create separate package.\n//\n// Copyright (c) 2012-2014, Bram Stein\n// All rights reserved.\n// Redistribution and use in source and binary forms, with or without\n// modification, are permitted provided that the following conditions\n// are met:\n//  1. Redistributions of source code must retain the above copyright\n//     notice, this list of conditions and the following disclaimer.\n//  2. Redistributions in binary form must reproduce the above copyright\n//     notice, this list of conditions and the following disclaimer in the\n//     documentation and/or other materials provided with the distribution.\n//  3. The name of the author may not be used to endorse or promote products\n//     derived from this software without specific prior written permission.\n// THIS SOFTWARE IS PROVIDED BY THE AUTHOR \"AS IS\" AND ANY EXPRESS OR IMPLIED\n// WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF\n// MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO\n// EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT,\n// INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,\n// BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY\n// OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING\n// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,\n// EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\n/* istanbul ignore file */\nfunction encodeReserved(str) {\n  return str.split(/(%[0-9A-Fa-f]{2})/g).map(function (part) {\n    if (!/%[0-9A-Fa-f]/.test(part)) {\n      part = encodeURI(part).replace(/%5B/g, \"[\").replace(/%5D/g, \"]\");\n    }\n\n    return part;\n  }).join(\"\");\n}\n\nfunction encodeUnreserved(str) {\n  return encodeURIComponent(str).replace(/[!'()*]/g, function (c) {\n    return \"%\" + c.charCodeAt(0).toString(16).toUpperCase();\n  });\n}\n\nfunction encodeValue(operator, value, key) {\n  value = operator === \"+\" || operator === \"#\" ? encodeReserved(value) : encodeUnreserved(value);\n\n  if (key) {\n    return encodeUnreserved(key) + \"=\" + value;\n  } else {\n    return value;\n  }\n}\n\nfunction isDefined(value) {\n  return value !== undefined && value !== null;\n}\n\nfunction isKeyOperator(operator) {\n  return operator === \";\" || operator === \"&\" || operator === \"?\";\n}\n\nfunction getValues(context, operator, key, modifier) {\n  var value = context[key],\n      result = [];\n\n  if (isDefined(value) && value !== \"\") {\n    if (typeof value === \"string\" || typeof value === \"number\" || typeof value === \"boolean\") {\n      value = value.toString();\n\n      if (modifier && modifier !== \"*\") {\n        value = value.substring(0, parseInt(modifier, 10));\n      }\n\n      result.push(encodeValue(operator, value, isKeyOperator(operator) ? key : \"\"));\n    } else {\n      if (modifier === \"*\") {\n        if (Array.isArray(value)) {\n          value.filter(isDefined).forEach(function (value) {\n            result.push(encodeValue(operator, value, isKeyOperator(operator) ? key : \"\"));\n          });\n        } else {\n          Object.keys(value).forEach(function (k) {\n            if (isDefined(value[k])) {\n              result.push(encodeValue(operator, value[k], k));\n            }\n          });\n        }\n      } else {\n        const tmp = [];\n\n        if (Array.isArray(value)) {\n          value.filter(isDefined).forEach(function (value) {\n            tmp.push(encodeValue(operator, value));\n          });\n        } else {\n          Object.keys(value).forEach(function (k) {\n            if (isDefined(value[k])) {\n              tmp.push(encodeUnreserved(k));\n              tmp.push(encodeValue(operator, value[k].toString()));\n            }\n          });\n        }\n\n        if (isKeyOperator(operator)) {\n          result.push(encodeUnreserved(key) + \"=\" + tmp.join(\",\"));\n        } else if (tmp.length !== 0) {\n          result.push(tmp.join(\",\"));\n        }\n      }\n    }\n  } else {\n    if (operator === \";\") {\n      if (isDefined(value)) {\n        result.push(encodeUnreserved(key));\n      }\n    } else if (value === \"\" && (operator === \"&\" || operator === \"?\")) {\n      result.push(encodeUnreserved(key) + \"=\");\n    } else if (value === \"\") {\n      result.push(\"\");\n    }\n  }\n\n  return result;\n}\n\nfunction parseUrl(template) {\n  return {\n    expand: expand.bind(null, template)\n  };\n}\n\nfunction expand(template, context) {\n  var operators = [\"+\", \"#\", \".\", \"/\", \";\", \"?\", \"&\"];\n  return template.replace(/\\{([^\\{\\}]+)\\}|([^\\{\\}]+)/g, function (_, expression, literal) {\n    if (expression) {\n      let operator = \"\";\n      const values = [];\n\n      if (operators.indexOf(expression.charAt(0)) !== -1) {\n        operator = expression.charAt(0);\n        expression = expression.substr(1);\n      }\n\n      expression.split(/,/g).forEach(function (variable) {\n        var tmp = /([^:\\*]*)(?::(\\d+)|(\\*))?/.exec(variable);\n        values.push(getValues(context, operator, tmp[1], tmp[2] || tmp[3]));\n      });\n\n      if (operator && operator !== \"+\") {\n        var separator = \",\";\n\n        if (operator === \"?\") {\n          separator = \"&\";\n        } else if (operator !== \"#\") {\n          separator = operator;\n        }\n\n        return (values.length !== 0 ? operator : \"\") + values.join(separator);\n      } else {\n        return values.join(\",\");\n      }\n    } else {\n      return encodeReserved(literal);\n    }\n  });\n}\n\nfunction parse(options) {\n  // https://fetch.spec.whatwg.org/#methods\n  let method = options.method.toUpperCase(); // replace :varname with {varname} to make it RFC 6570 compatible\n\n  let url = (options.url || \"/\").replace(/:([a-z]\\w+)/g, \"{$1}\");\n  let headers = Object.assign({}, options.headers);\n  let body;\n  let parameters = omit(options, [\"method\", \"baseUrl\", \"url\", \"headers\", \"request\", \"mediaType\"]); // extract variable names from URL to calculate remaining variables later\n\n  const urlVariableNames = extractUrlVariableNames(url);\n  url = parseUrl(url).expand(parameters);\n\n  if (!/^http/.test(url)) {\n    url = options.baseUrl + url;\n  }\n\n  const omittedParameters = Object.keys(options).filter(option => urlVariableNames.includes(option)).concat(\"baseUrl\");\n  const remainingParameters = omit(parameters, omittedParameters);\n  const isBinaryRequest = /application\\/octet-stream/i.test(headers.accept);\n\n  if (!isBinaryRequest) {\n    if (options.mediaType.format) {\n      // e.g. application/vnd.github.v3+json => application/vnd.github.v3.raw\n      headers.accept = headers.accept.split(/,/).map(preview => preview.replace(/application\\/vnd(\\.\\w+)(\\.v3)?(\\.\\w+)?(\\+json)?$/, `application/vnd$1$2.${options.mediaType.format}`)).join(\",\");\n    }\n\n    if (options.mediaType.previews.length) {\n      const previewsFromAcceptHeader = headers.accept.match(/[\\w-]+(?=-preview)/g) || [];\n      headers.accept = previewsFromAcceptHeader.concat(options.mediaType.previews).map(preview => {\n        const format = options.mediaType.format ? `.${options.mediaType.format}` : \"+json\";\n        return `application/vnd.github.${preview}-preview${format}`;\n      }).join(\",\");\n    }\n  } // for GET/HEAD requests, set URL query parameters from remaining parameters\n  // for PATCH/POST/PUT/DELETE requests, set request body from remaining parameters\n\n\n  if ([\"GET\", \"HEAD\"].includes(method)) {\n    url = addQueryParameters(url, remainingParameters);\n  } else {\n    if (\"data\" in remainingParameters) {\n      body = remainingParameters.data;\n    } else {\n      if (Object.keys(remainingParameters).length) {\n        body = remainingParameters;\n      } else {\n        headers[\"content-length\"] = 0;\n      }\n    }\n  } // default content-type for JSON if body is set\n\n\n  if (!headers[\"content-type\"] && typeof body !== \"undefined\") {\n    headers[\"content-type\"] = \"application/json; charset=utf-8\";\n  } // GitHub expects 'content-length: 0' header for PUT/PATCH requests without body.\n  // fetch does not allow to set `content-length` header, but we can set body to an empty string\n\n\n  if ([\"PATCH\", \"PUT\"].includes(method) && typeof body === \"undefined\") {\n    body = \"\";\n  } // Only return body/request keys if present\n\n\n  return Object.assign({\n    method,\n    url,\n    headers\n  }, typeof body !== \"undefined\" ? {\n    body\n  } : null, options.request ? {\n    request: options.request\n  } : null);\n}\n\nfunction endpointWithDefaults(defaults, route, options) {\n  return parse(merge(defaults, route, options));\n}\n\nfunction withDefaults(oldDefaults, newDefaults) {\n  const DEFAULTS = merge(oldDefaults, newDefaults);\n  const endpoint = endpointWithDefaults.bind(null, DEFAULTS);\n  return Object.assign(endpoint, {\n    DEFAULTS,\n    defaults: withDefaults.bind(null, DEFAULTS),\n    merge: merge.bind(null, DEFAULTS),\n    parse\n  });\n}\n\nconst VERSION = \"6.0.11\";\n\nconst userAgent = `octokit-endpoint.js/${VERSION} ${universalUserAgent.getUserAgent()}`; // DEFAULTS has all properties set that EndpointOptions has, except url.\n// So we use RequestParameters and add method as additional required property.\n\nconst DEFAULTS = {\n  method: \"GET\",\n  baseUrl: \"https://api.github.com\",\n  headers: {\n    accept: \"application/vnd.github.v3+json\",\n    \"user-agent\": userAgent\n  },\n  mediaType: {\n    format: \"\",\n    previews: []\n  }\n};\n\nconst endpoint = withDefaults(null, DEFAULTS);\n\nexports.endpoint = endpoint;\n//# sourceMappingURL=index.js.map\n\n\n/***/ }),\n\n/***/ 8467:\n/***/ ((__unused_webpack_module, exports, __nccwpck_require__) => {\n\n\"use strict\";\n\n\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\n\nvar request = __nccwpck_require__(6234);\nvar universalUserAgent = __nccwpck_require__(5030);\n\nconst VERSION = \"4.6.1\";\n\nclass GraphqlError extends Error {\n  constructor(request, response) {\n    const message = response.data.errors[0].message;\n    super(message);\n    Object.assign(this, response.data);\n    Object.assign(this, {\n      headers: response.headers\n    });\n    this.name = \"GraphqlError\";\n    this.request = request; // Maintains proper stack trace (only available on V8)\n\n    /* istanbul ignore next */\n\n    if (Error.captureStackTrace) {\n      Error.captureStackTrace(this, this.constructor);\n    }\n  }\n\n}\n\nconst NON_VARIABLE_OPTIONS = [\"method\", \"baseUrl\", \"url\", \"headers\", \"request\", \"query\", \"mediaType\"];\nconst FORBIDDEN_VARIABLE_OPTIONS = [\"query\", \"method\", \"url\"];\nconst GHES_V3_SUFFIX_REGEX = /\\/api\\/v3\\/?$/;\nfunction graphql(request, query, options) {\n  if (options) {\n    if (typeof query === \"string\" && \"query\" in options) {\n      return Promise.reject(new Error(`[@octokit/graphql] \"query\" cannot be used as variable name`));\n    }\n\n    for (const key in options) {\n      if (!FORBIDDEN_VARIABLE_OPTIONS.includes(key)) continue;\n      return Promise.reject(new Error(`[@octokit/graphql] \"${key}\" cannot be used as variable name`));\n    }\n  }\n\n  const parsedOptions = typeof query === \"string\" ? Object.assign({\n    query\n  }, options) : query;\n  const requestOptions = Object.keys(parsedOptions).reduce((result, key) => {\n    if (NON_VARIABLE_OPTIONS.includes(key)) {\n      result[key] = parsedOptions[key];\n      return result;\n    }\n\n    if (!result.variables) {\n      result.variables = {};\n    }\n\n    result.variables[key] = parsedOptions[key];\n    return result;\n  }, {}); // workaround for GitHub Enterprise baseUrl set with /api/v3 suffix\n  // https://github.com/octokit/auth-app.js/issues/111#issuecomment-657610451\n\n  const baseUrl = parsedOptions.baseUrl || request.endpoint.DEFAULTS.baseUrl;\n\n  if (GHES_V3_SUFFIX_REGEX.test(baseUrl)) {\n    requestOptions.url = baseUrl.replace(GHES_V3_SUFFIX_REGEX, \"/api/graphql\");\n  }\n\n  return request(requestOptions).then(response => {\n    if (response.data.errors) {\n      const headers = {};\n\n      for (const key of Object.keys(response.headers)) {\n        headers[key] = response.headers[key];\n      }\n\n      throw new GraphqlError(requestOptions, {\n        headers,\n        data: response.data\n      });\n    }\n\n    return response.data.data;\n  });\n}\n\nfunction withDefaults(request$1, newDefaults) {\n  const newRequest = request$1.defaults(newDefaults);\n\n  const newApi = (query, options) => {\n    return graphql(newRequest, query, options);\n  };\n\n  return Object.assign(newApi, {\n    defaults: withDefaults.bind(null, newRequest),\n    endpoint: request.request.endpoint\n  });\n}\n\nconst graphql$1 = withDefaults(request.request, {\n  headers: {\n    \"user-agent\": `octokit-graphql.js/${VERSION} ${universalUserAgent.getUserAgent()}`\n  },\n  method: \"POST\",\n  url: \"/graphql\"\n});\nfunction withCustomRequest(customRequest) {\n  return withDefaults(customRequest, {\n    method: \"POST\",\n    url: \"/graphql\"\n  });\n}\n\nexports.graphql = graphql$1;\nexports.withCustomRequest = withCustomRequest;\n//# sourceMappingURL=index.js.map\n\n\n/***/ }),\n\n/***/ 4193:\n/***/ ((__unused_webpack_module, exports) => {\n\n\"use strict\";\n\n\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\n\nconst VERSION = \"2.13.3\";\n\n/**\n * Some “list” response that can be paginated have a different response structure\n *\n * They have a `total_count` key in the response (search also has `incomplete_results`,\n * /installation/repositories also has `repository_selection`), as well as a key with\n * the list of the items which name varies from endpoint to endpoint.\n *\n * Octokit normalizes these responses so that paginated results are always returned following\n * the same structure. One challenge is that if the list response has only one page, no Link\n * header is provided, so this header alone is not sufficient to check wether a response is\n * paginated or not.\n *\n * We check if a \"total_count\" key is present in the response data, but also make sure that\n * a \"url\" property is not, as the \"Get the combined status for a specific ref\" endpoint would\n * otherwise match: https://developer.github.com/v3/repos/statuses/#get-the-combined-status-for-a-specific-ref\n */\nfunction normalizePaginatedListResponse(response) {\n  const responseNeedsNormalization = \"total_count\" in response.data && !(\"url\" in response.data);\n  if (!responseNeedsNormalization) return response; // keep the additional properties intact as there is currently no other way\n  // to retrieve the same information.\n\n  const incompleteResults = response.data.incomplete_results;\n  const repositorySelection = response.data.repository_selection;\n  const totalCount = response.data.total_count;\n  delete response.data.incomplete_results;\n  delete response.data.repository_selection;\n  delete response.data.total_count;\n  const namespaceKey = Object.keys(response.data)[0];\n  const data = response.data[namespaceKey];\n  response.data = data;\n\n  if (typeof incompleteResults !== \"undefined\") {\n    response.data.incomplete_results = incompleteResults;\n  }\n\n  if (typeof repositorySelection !== \"undefined\") {\n    response.data.repository_selection = repositorySelection;\n  }\n\n  response.data.total_count = totalCount;\n  return response;\n}\n\nfunction iterator(octokit, route, parameters) {\n  const options = typeof route === \"function\" ? route.endpoint(parameters) : octokit.request.endpoint(route, parameters);\n  const requestMethod = typeof route === \"function\" ? route : octokit.request;\n  const method = options.method;\n  const headers = options.headers;\n  let url = options.url;\n  return {\n    [Symbol.asyncIterator]: () => ({\n      async next() {\n        if (!url) return {\n          done: true\n        };\n        const response = await requestMethod({\n          method,\n          url,\n          headers\n        });\n        const normalizedResponse = normalizePaginatedListResponse(response); // `response.headers.link` format:\n        // '<https://api.github.com/users/aseemk/followers?page=2>; rel=\"next\", <https://api.github.com/users/aseemk/followers?page=2>; rel=\"last\"'\n        // sets `url` to undefined if \"next\" URL is not present or `link` header is not set\n\n        url = ((normalizedResponse.headers.link || \"\").match(/<([^>]+)>;\\s*rel=\"next\"/) || [])[1];\n        return {\n          value: normalizedResponse\n        };\n      }\n\n    })\n  };\n}\n\nfunction paginate(octokit, route, parameters, mapFn) {\n  if (typeof parameters === \"function\") {\n    mapFn = parameters;\n    parameters = undefined;\n  }\n\n  return gather(octokit, [], iterator(octokit, route, parameters)[Symbol.asyncIterator](), mapFn);\n}\n\nfunction gather(octokit, results, iterator, mapFn) {\n  return iterator.next().then(result => {\n    if (result.done) {\n      return results;\n    }\n\n    let earlyExit = false;\n\n    function done() {\n      earlyExit = true;\n    }\n\n    results = results.concat(mapFn ? mapFn(result.value, done) : result.value.data);\n\n    if (earlyExit) {\n      return results;\n    }\n\n    return gather(octokit, results, iterator, mapFn);\n  });\n}\n\nconst composePaginateRest = Object.assign(paginate, {\n  iterator\n});\n\nconst paginatingEndpoints = [\"GET /app/installations\", \"GET /applications/grants\", \"GET /authorizations\", \"GET /enterprises/{enterprise}/actions/permissions/organizations\", \"GET /enterprises/{enterprise}/actions/runner-groups\", \"GET /enterprises/{enterprise}/actions/runner-groups/{runner_group_id}/organizations\", \"GET /enterprises/{enterprise}/actions/runner-groups/{runner_group_id}/runners\", \"GET /enterprises/{enterprise}/actions/runners\", \"GET /enterprises/{enterprise}/actions/runners/downloads\", \"GET /events\", \"GET /gists\", \"GET /gists/public\", \"GET /gists/starred\", \"GET /gists/{gist_id}/comments\", \"GET /gists/{gist_id}/commits\", \"GET /gists/{gist_id}/forks\", \"GET /installation/repositories\", \"GET /issues\", \"GET /marketplace_listing/plans\", \"GET /marketplace_listing/plans/{plan_id}/accounts\", \"GET /marketplace_listing/stubbed/plans\", \"GET /marketplace_listing/stubbed/plans/{plan_id}/accounts\", \"GET /networks/{owner}/{repo}/events\", \"GET /notifications\", \"GET /organizations\", \"GET /orgs/{org}/actions/permissions/repositories\", \"GET /orgs/{org}/actions/runner-groups\", \"GET /orgs/{org}/actions/runner-groups/{runner_group_id}/repositories\", \"GET /orgs/{org}/actions/runner-groups/{runner_group_id}/runners\", \"GET /orgs/{org}/actions/runners\", \"GET /orgs/{org}/actions/runners/downloads\", \"GET /orgs/{org}/actions/secrets\", \"GET /orgs/{org}/actions/secrets/{secret_name}/repositories\", \"GET /orgs/{org}/blocks\", \"GET /orgs/{org}/credential-authorizations\", \"GET /orgs/{org}/events\", \"GET /orgs/{org}/failed_invitations\", \"GET /orgs/{org}/hooks\", \"GET /orgs/{org}/installations\", \"GET /orgs/{org}/invitations\", \"GET /orgs/{org}/invitations/{invitation_id}/teams\", \"GET /orgs/{org}/issues\", \"GET /orgs/{org}/members\", \"GET /orgs/{org}/migrations\", \"GET /orgs/{org}/migrations/{migration_id}/repositories\", \"GET /orgs/{org}/outside_collaborators\", \"GET /orgs/{org}/projects\", \"GET /orgs/{org}/public_members\", \"GET /orgs/{org}/repos\", \"GET /orgs/{org}/team-sync/groups\", \"GET /orgs/{org}/teams\", \"GET /orgs/{org}/teams/{team_slug}/discussions\", \"GET /orgs/{org}/teams/{team_slug}/discussions/{discussion_number}/comments\", \"GET /orgs/{org}/teams/{team_slug}/discussions/{discussion_number}/comments/{comment_number}/reactions\", \"GET /orgs/{org}/teams/{team_slug}/discussions/{discussion_number}/reactions\", \"GET /orgs/{org}/teams/{team_slug}/invitations\", \"GET /orgs/{org}/teams/{team_slug}/members\", \"GET /orgs/{org}/teams/{team_slug}/projects\", \"GET /orgs/{org}/teams/{team_slug}/repos\", \"GET /orgs/{org}/teams/{team_slug}/team-sync/group-mappings\", \"GET /orgs/{org}/teams/{team_slug}/teams\", \"GET /projects/columns/{column_id}/cards\", \"GET /projects/{project_id}/collaborators\", \"GET /projects/{project_id}/columns\", \"GET /repos/{owner}/{repo}/actions/artifacts\", \"GET /repos/{owner}/{repo}/actions/runners\", \"GET /repos/{owner}/{repo}/actions/runners/downloads\", \"GET /repos/{owner}/{repo}/actions/runs\", \"GET /repos/{owner}/{repo}/actions/runs/{run_id}/artifacts\", \"GET /repos/{owner}/{repo}/actions/runs/{run_id}/jobs\", \"GET /repos/{owner}/{repo}/actions/secrets\", \"GET /repos/{owner}/{repo}/actions/workflows\", \"GET /repos/{owner}/{repo}/actions/workflows/{workflow_id}/runs\", \"GET /repos/{owner}/{repo}/assignees\", \"GET /repos/{owner}/{repo}/branches\", \"GET /repos/{owner}/{repo}/check-runs/{check_run_id}/annotations\", \"GET /repos/{owner}/{repo}/check-suites/{check_suite_id}/check-runs\", \"GET /repos/{owner}/{repo}/code-scanning/alerts\", \"GET /repos/{owner}/{repo}/code-scanning/alerts/{alert_number}/instances\", \"GET /repos/{owner}/{repo}/code-scanning/analyses\", \"GET /repos/{owner}/{repo}/collaborators\", \"GET /repos/{owner}/{repo}/comments\", \"GET /repos/{owner}/{repo}/comments/{comment_id}/reactions\", \"GET /repos/{owner}/{repo}/commits\", \"GET /repos/{owner}/{repo}/commits/{commit_sha}/branches-where-head\", \"GET /repos/{owner}/{repo}/commits/{commit_sha}/comments\", \"GET /repos/{owner}/{repo}/commits/{commit_sha}/pulls\", \"GET /repos/{owner}/{repo}/commits/{ref}/check-runs\", \"GET /repos/{owner}/{repo}/commits/{ref}/check-suites\", \"GET /repos/{owner}/{repo}/commits/{ref}/statuses\", \"GET /repos/{owner}/{repo}/contributors\", \"GET /repos/{owner}/{repo}/deployments\", \"GET /repos/{owner}/{repo}/deployments/{deployment_id}/statuses\", \"GET /repos/{owner}/{repo}/events\", \"GET /repos/{owner}/{repo}/forks\", \"GET /repos/{owner}/{repo}/git/matching-refs/{ref}\", \"GET /repos/{owner}/{repo}/hooks\", \"GET /repos/{owner}/{repo}/invitations\", \"GET /repos/{owner}/{repo}/issues\", \"GET /repos/{owner}/{repo}/issues/comments\", \"GET /repos/{owner}/{repo}/issues/comments/{comment_id}/reactions\", \"GET /repos/{owner}/{repo}/issues/events\", \"GET /repos/{owner}/{repo}/issues/{issue_number}/comments\", \"GET /repos/{owner}/{repo}/issues/{issue_number}/events\", \"GET /repos/{owner}/{repo}/issues/{issue_number}/labels\", \"GET /repos/{owner}/{repo}/issues/{issue_number}/reactions\", \"GET /repos/{owner}/{repo}/issues/{issue_number}/timeline\", \"GET /repos/{owner}/{repo}/keys\", \"GET /repos/{owner}/{repo}/labels\", \"GET /repos/{owner}/{repo}/milestones\", \"GET /repos/{owner}/{repo}/milestones/{milestone_number}/labels\", \"GET /repos/{owner}/{repo}/notifications\", \"GET /repos/{owner}/{repo}/pages/builds\", \"GET /repos/{owner}/{repo}/projects\", \"GET /repos/{owner}/{repo}/pulls\", \"GET /repos/{owner}/{repo}/pulls/comments\", \"GET /repos/{owner}/{repo}/pulls/comments/{comment_id}/reactions\", \"GET /repos/{owner}/{repo}/pulls/{pull_number}/comments\", \"GET /repos/{owner}/{repo}/pulls/{pull_number}/commits\", \"GET /repos/{owner}/{repo}/pulls/{pull_number}/files\", \"GET /repos/{owner}/{repo}/pulls/{pull_number}/requested_reviewers\", \"GET /repos/{owner}/{repo}/pulls/{pull_number}/reviews\", \"GET /repos/{owner}/{repo}/pulls/{pull_number}/reviews/{review_id}/comments\", \"GET /repos/{owner}/{repo}/releases\", \"GET /repos/{owner}/{repo}/releases/{release_id}/assets\", \"GET /repos/{owner}/{repo}/secret-scanning/alerts\", \"GET /repos/{owner}/{repo}/stargazers\", \"GET /repos/{owner}/{repo}/subscribers\", \"GET /repos/{owner}/{repo}/tags\", \"GET /repos/{owner}/{repo}/teams\", \"GET /repositories\", \"GET /repositories/{repository_id}/environments/{environment_name}/secrets\", \"GET /scim/v2/enterprises/{enterprise}/Groups\", \"GET /scim/v2/enterprises/{enterprise}/Users\", \"GET /scim/v2/organizations/{org}/Users\", \"GET /search/code\", \"GET /search/commits\", \"GET /search/issues\", \"GET /search/labels\", \"GET /search/repositories\", \"GET /search/topics\", \"GET /search/users\", \"GET /teams/{team_id}/discussions\", \"GET /teams/{team_id}/discussions/{discussion_number}/comments\", \"GET /teams/{team_id}/discussions/{discussion_number}/comments/{comment_number}/reactions\", \"GET /teams/{team_id}/discussions/{discussion_number}/reactions\", \"GET /teams/{team_id}/invitations\", \"GET /teams/{team_id}/members\", \"GET /teams/{team_id}/projects\", \"GET /teams/{team_id}/repos\", \"GET /teams/{team_id}/team-sync/group-mappings\", \"GET /teams/{team_id}/teams\", \"GET /user/blocks\", \"GET /user/emails\", \"GET /user/followers\", \"GET /user/following\", \"GET /user/gpg_keys\", \"GET /user/installations\", \"GET /user/installations/{installation_id}/repositories\", \"GET /user/issues\", \"GET /user/keys\", \"GET /user/marketplace_purchases\", \"GET /user/marketplace_purchases/stubbed\", \"GET /user/memberships/orgs\", \"GET /user/migrations\", \"GET /user/migrations/{migration_id}/repositories\", \"GET /user/orgs\", \"GET /user/public_emails\", \"GET /user/repos\", \"GET /user/repository_invitations\", \"GET /user/starred\", \"GET /user/subscriptions\", \"GET /user/teams\", \"GET /users\", \"GET /users/{username}/events\", \"GET /users/{username}/events/orgs/{org}\", \"GET /users/{username}/events/public\", \"GET /users/{username}/followers\", \"GET /users/{username}/following\", \"GET /users/{username}/gists\", \"GET /users/{username}/gpg_keys\", \"GET /users/{username}/keys\", \"GET /users/{username}/orgs\", \"GET /users/{username}/projects\", \"GET /users/{username}/received_events\", \"GET /users/{username}/received_events/public\", \"GET /users/{username}/repos\", \"GET /users/{username}/starred\", \"GET /users/{username}/subscriptions\"];\n\nfunction isPaginatingEndpoint(arg) {\n  if (typeof arg === \"string\") {\n    return paginatingEndpoints.includes(arg);\n  } else {\n    return false;\n  }\n}\n\n/**\n * @param octokit Octokit instance\n * @param options Options passed to Octokit constructor\n */\n\nfunction paginateRest(octokit) {\n  return {\n    paginate: Object.assign(paginate.bind(null, octokit), {\n      iterator: iterator.bind(null, octokit)\n    })\n  };\n}\npaginateRest.VERSION = VERSION;\n\nexports.composePaginateRest = composePaginateRest;\nexports.isPaginatingEndpoint = isPaginatingEndpoint;\nexports.paginateRest = paginateRest;\nexports.paginatingEndpoints = paginatingEndpoints;\n//# sourceMappingURL=index.js.map\n\n\n/***/ }),\n\n/***/ 3044:\n/***/ ((__unused_webpack_module, exports) => {\n\n\"use strict\";\n\n\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\n\nfunction _defineProperty(obj, key, value) {\n  if (key in obj) {\n    Object.defineProperty(obj, key, {\n      value: value,\n      enumerable: true,\n      configurable: true,\n      writable: true\n    });\n  } else {\n    obj[key] = value;\n  }\n\n  return obj;\n}\n\nfunction ownKeys(object, enumerableOnly) {\n  var keys = Object.keys(object);\n\n  if (Object.getOwnPropertySymbols) {\n    var symbols = Object.getOwnPropertySymbols(object);\n    if (enumerableOnly) symbols = symbols.filter(function (sym) {\n      return Object.getOwnPropertyDescriptor(object, sym).enumerable;\n    });\n    keys.push.apply(keys, symbols);\n  }\n\n  return keys;\n}\n\nfunction _objectSpread2(target) {\n  for (var i = 1; i < arguments.length; i++) {\n    var source = arguments[i] != null ? arguments[i] : {};\n\n    if (i % 2) {\n      ownKeys(Object(source), true).forEach(function (key) {\n        _defineProperty(target, key, source[key]);\n      });\n    } else if (Object.getOwnPropertyDescriptors) {\n      Object.defineProperties(target, Object.getOwnPropertyDescriptors(source));\n    } else {\n      ownKeys(Object(source)).forEach(function (key) {\n        Object.defineProperty(target, key, Object.getOwnPropertyDescriptor(source, key));\n      });\n    }\n  }\n\n  return target;\n}\n\nconst Endpoints = {\n  actions: {\n    addSelectedRepoToOrgSecret: [\"PUT /orgs/{org}/actions/secrets/{secret_name}/repositories/{repository_id}\"],\n    cancelWorkflowRun: [\"POST /repos/{owner}/{repo}/actions/runs/{run_id}/cancel\"],\n    createOrUpdateEnvironmentSecret: [\"PUT /repositories/{repository_id}/environments/{environment_name}/secrets/{secret_name}\"],\n    createOrUpdateOrgSecret: [\"PUT /orgs/{org}/actions/secrets/{secret_name}\"],\n    createOrUpdateRepoSecret: [\"PUT /repos/{owner}/{repo}/actions/secrets/{secret_name}\"],\n    createRegistrationTokenForOrg: [\"POST /orgs/{org}/actions/runners/registration-token\"],\n    createRegistrationTokenForRepo: [\"POST /repos/{owner}/{repo}/actions/runners/registration-token\"],\n    createRemoveTokenForOrg: [\"POST /orgs/{org}/actions/runners/remove-token\"],\n    createRemoveTokenForRepo: [\"POST /repos/{owner}/{repo}/actions/runners/remove-token\"],\n    createWorkflowDispatch: [\"POST /repos/{owner}/{repo}/actions/workflows/{workflow_id}/dispatches\"],\n    deleteArtifact: [\"DELETE /repos/{owner}/{repo}/actions/artifacts/{artifact_id}\"],\n    deleteEnvironmentSecret: [\"DELETE /repositories/{repository_id}/environments/{environment_name}/secrets/{secret_name}\"],\n    deleteOrgSecret: [\"DELETE /orgs/{org}/actions/secrets/{secret_name}\"],\n    deleteRepoSecret: [\"DELETE /repos/{owner}/{repo}/actions/secrets/{secret_name}\"],\n    deleteSelfHostedRunnerFromOrg: [\"DELETE /orgs/{org}/actions/runners/{runner_id}\"],\n    deleteSelfHostedRunnerFromRepo: [\"DELETE /repos/{owner}/{repo}/actions/runners/{runner_id}\"],\n    deleteWorkflowRun: [\"DELETE /repos/{owner}/{repo}/actions/runs/{run_id}\"],\n    deleteWorkflowRunLogs: [\"DELETE /repos/{owner}/{repo}/actions/runs/{run_id}/logs\"],\n    disableSelectedRepositoryGithubActionsOrganization: [\"DELETE /orgs/{org}/actions/permissions/repositories/{repository_id}\"],\n    disableWorkflow: [\"PUT /repos/{owner}/{repo}/actions/workflows/{workflow_id}/disable\"],\n    downloadArtifact: [\"GET /repos/{owner}/{repo}/actions/artifacts/{artifact_id}/{archive_format}\"],\n    downloadJobLogsForWorkflowRun: [\"GET /repos/{owner}/{repo}/actions/jobs/{job_id}/logs\"],\n    downloadWorkflowRunLogs: [\"GET /repos/{owner}/{repo}/actions/runs/{run_id}/logs\"],\n    enableSelectedRepositoryGithubActionsOrganization: [\"PUT /orgs/{org}/actions/permissions/repositories/{repository_id}\"],\n    enableWorkflow: [\"PUT /repos/{owner}/{repo}/actions/workflows/{workflow_id}/enable\"],\n    getAllowedActionsOrganization: [\"GET /orgs/{org}/actions/permissions/selected-actions\"],\n    getAllowedActionsRepository: [\"GET /repos/{owner}/{repo}/actions/permissions/selected-actions\"],\n    getArtifact: [\"GET /repos/{owner}/{repo}/actions/artifacts/{artifact_id}\"],\n    getEnvironmentPublicKey: [\"GET /repositories/{repository_id}/environments/{environment_name}/secrets/public-key\"],\n    getEnvironmentSecret: [\"GET /repositories/{repository_id}/environments/{environment_name}/secrets/{secret_name}\"],\n    getGithubActionsPermissionsOrganization: [\"GET /orgs/{org}/actions/permissions\"],\n    getGithubActionsPermissionsRepository: [\"GET /repos/{owner}/{repo}/actions/permissions\"],\n    getJobForWorkflowRun: [\"GET /repos/{owner}/{repo}/actions/jobs/{job_id}\"],\n    getOrgPublicKey: [\"GET /orgs/{org}/actions/secrets/public-key\"],\n    getOrgSecret: [\"GET /orgs/{org}/actions/secrets/{secret_name}\"],\n    getPendingDeploymentsForRun: [\"GET /repos/{owner}/{repo}/actions/runs/{run_id}/pending_deployments\"],\n    getRepoPermissions: [\"GET /repos/{owner}/{repo}/actions/permissions\", {}, {\n      renamed: [\"actions\", \"getGithubActionsPermissionsRepository\"]\n    }],\n    getRepoPublicKey: [\"GET /repos/{owner}/{repo}/actions/secrets/public-key\"],\n    getRepoSecret: [\"GET /repos/{owner}/{repo}/actions/secrets/{secret_name}\"],\n    getReviewsForRun: [\"GET /repos/{owner}/{repo}/actions/runs/{run_id}/approvals\"],\n    getSelfHostedRunnerForOrg: [\"GET /orgs/{org}/actions/runners/{runner_id}\"],\n    getSelfHostedRunnerForRepo: [\"GET /repos/{owner}/{repo}/actions/runners/{runner_id}\"],\n    getWorkflow: [\"GET /repos/{owner}/{repo}/actions/workflows/{workflow_id}\"],\n    getWorkflowRun: [\"GET /repos/{owner}/{repo}/actions/runs/{run_id}\"],\n    getWorkflowRunUsage: [\"GET /repos/{owner}/{repo}/actions/runs/{run_id}/timing\"],\n    getWorkflowUsage: [\"GET /repos/{owner}/{repo}/actions/workflows/{workflow_id}/timing\"],\n    listArtifactsForRepo: [\"GET /repos/{owner}/{repo}/actions/artifacts\"],\n    listEnvironmentSecrets: [\"GET /repositories/{repository_id}/environments/{environment_name}/secrets\"],\n    listJobsForWorkflowRun: [\"GET /repos/{owner}/{repo}/actions/runs/{run_id}/jobs\"],\n    listOrgSecrets: [\"GET /orgs/{org}/actions/secrets\"],\n    listRepoSecrets: [\"GET /repos/{owner}/{repo}/actions/secrets\"],\n    listRepoWorkflows: [\"GET /repos/{owner}/{repo}/actions/workflows\"],\n    listRunnerApplicationsForOrg: [\"GET /orgs/{org}/actions/runners/downloads\"],\n    listRunnerApplicationsForRepo: [\"GET /repos/{owner}/{repo}/actions/runners/downloads\"],\n    listSelectedReposForOrgSecret: [\"GET /orgs/{org}/actions/secrets/{secret_name}/repositories\"],\n    listSelectedRepositoriesEnabledGithubActionsOrganization: [\"GET /orgs/{org}/actions/permissions/repositories\"],\n    listSelfHostedRunnersForOrg: [\"GET /orgs/{org}/actions/runners\"],\n    listSelfHostedRunnersForRepo: [\"GET /repos/{owner}/{repo}/actions/runners\"],\n    listWorkflowRunArtifacts: [\"GET /repos/{owner}/{repo}/actions/runs/{run_id}/artifacts\"],\n    listWorkflowRuns: [\"GET /repos/{owner}/{repo}/actions/workflows/{workflow_id}/runs\"],\n    listWorkflowRunsForRepo: [\"GET /repos/{owner}/{repo}/actions/runs\"],\n    reRunWorkflow: [\"POST /repos/{owner}/{repo}/actions/runs/{run_id}/rerun\"],\n    removeSelectedRepoFromOrgSecret: [\"DELETE /orgs/{org}/actions/secrets/{secret_name}/repositories/{repository_id}\"],\n    reviewPendingDeploymentsForRun: [\"POST /repos/{owner}/{repo}/actions/runs/{run_id}/pending_deployments\"],\n    setAllowedActionsOrganization: [\"PUT /orgs/{org}/actions/permissions/selected-actions\"],\n    setAllowedActionsRepository: [\"PUT /repos/{owner}/{repo}/actions/permissions/selected-actions\"],\n    setGithubActionsPermissionsOrganization: [\"PUT /orgs/{org}/actions/permissions\"],\n    setGithubActionsPermissionsRepository: [\"PUT /repos/{owner}/{repo}/actions/permissions\"],\n    setSelectedReposForOrgSecret: [\"PUT /orgs/{org}/actions/secrets/{secret_name}/repositories\"],\n    setSelectedRepositoriesEnabledGithubActionsOrganization: [\"PUT /orgs/{org}/actions/permissions/repositories\"]\n  },\n  activity: {\n    checkRepoIsStarredByAuthenticatedUser: [\"GET /user/starred/{owner}/{repo}\"],\n    deleteRepoSubscription: [\"DELETE /repos/{owner}/{repo}/subscription\"],\n    deleteThreadSubscription: [\"DELETE /notifications/threads/{thread_id}/subscription\"],\n    getFeeds: [\"GET /feeds\"],\n    getRepoSubscription: [\"GET /repos/{owner}/{repo}/subscription\"],\n    getThread: [\"GET /notifications/threads/{thread_id}\"],\n    getThreadSubscriptionForAuthenticatedUser: [\"GET /notifications/threads/{thread_id}/subscription\"],\n    listEventsForAuthenticatedUser: [\"GET /users/{username}/events\"],\n    listNotificationsForAuthenticatedUser: [\"GET /notifications\"],\n    listOrgEventsForAuthenticatedUser: [\"GET /users/{username}/events/orgs/{org}\"],\n    listPublicEvents: [\"GET /events\"],\n    listPublicEventsForRepoNetwork: [\"GET /networks/{owner}/{repo}/events\"],\n    listPublicEventsForUser: [\"GET /users/{username}/events/public\"],\n    listPublicOrgEvents: [\"GET /orgs/{org}/events\"],\n    listReceivedEventsForUser: [\"GET /users/{username}/received_events\"],\n    listReceivedPublicEventsForUser: [\"GET /users/{username}/received_events/public\"],\n    listRepoEvents: [\"GET /repos/{owner}/{repo}/events\"],\n    listRepoNotificationsForAuthenticatedUser: [\"GET /repos/{owner}/{repo}/notifications\"],\n    listReposStarredByAuthenticatedUser: [\"GET /user/starred\"],\n    listReposStarredByUser: [\"GET /users/{username}/starred\"],\n    listReposWatchedByUser: [\"GET /users/{username}/subscriptions\"],\n    listStargazersForRepo: [\"GET /repos/{owner}/{repo}/stargazers\"],\n    listWatchedReposForAuthenticatedUser: [\"GET /user/subscriptions\"],\n    listWatchersForRepo: [\"GET /repos/{owner}/{repo}/subscribers\"],\n    markNotificationsAsRead: [\"PUT /notifications\"],\n    markRepoNotificationsAsRead: [\"PUT /repos/{owner}/{repo}/notifications\"],\n    markThreadAsRead: [\"PATCH /notifications/threads/{thread_id}\"],\n    setRepoSubscription: [\"PUT /repos/{owner}/{repo}/subscription\"],\n    setThreadSubscription: [\"PUT /notifications/threads/{thread_id}/subscription\"],\n    starRepoForAuthenticatedUser: [\"PUT /user/starred/{owner}/{repo}\"],\n    unstarRepoForAuthenticatedUser: [\"DELETE /user/starred/{owner}/{repo}\"]\n  },\n  apps: {\n    addRepoToInstallation: [\"PUT /user/installations/{installation_id}/repositories/{repository_id}\"],\n    checkToken: [\"POST /applications/{client_id}/token\"],\n    createContentAttachment: [\"POST /content_references/{content_reference_id}/attachments\", {\n      mediaType: {\n        previews: [\"corsair\"]\n      }\n    }],\n    createFromManifest: [\"POST /app-manifests/{code}/conversions\"],\n    createInstallationAccessToken: [\"POST /app/installations/{installation_id}/access_tokens\"],\n    deleteAuthorization: [\"DELETE /applications/{client_id}/grant\"],\n    deleteInstallation: [\"DELETE /app/installations/{installation_id}\"],\n    deleteToken: [\"DELETE /applications/{client_id}/token\"],\n    getAuthenticated: [\"GET /app\"],\n    getBySlug: [\"GET /apps/{app_slug}\"],\n    getInstallation: [\"GET /app/installations/{installation_id}\"],\n    getOrgInstallation: [\"GET /orgs/{org}/installation\"],\n    getRepoInstallation: [\"GET /repos/{owner}/{repo}/installation\"],\n    getSubscriptionPlanForAccount: [\"GET /marketplace_listing/accounts/{account_id}\"],\n    getSubscriptionPlanForAccountStubbed: [\"GET /marketplace_listing/stubbed/accounts/{account_id}\"],\n    getUserInstallation: [\"GET /users/{username}/installation\"],\n    getWebhookConfigForApp: [\"GET /app/hook/config\"],\n    listAccountsForPlan: [\"GET /marketplace_listing/plans/{plan_id}/accounts\"],\n    listAccountsForPlanStubbed: [\"GET /marketplace_listing/stubbed/plans/{plan_id}/accounts\"],\n    listInstallationReposForAuthenticatedUser: [\"GET /user/installations/{installation_id}/repositories\"],\n    listInstallations: [\"GET /app/installations\"],\n    listInstallationsForAuthenticatedUser: [\"GET /user/installations\"],\n    listPlans: [\"GET /marketplace_listing/plans\"],\n    listPlansStubbed: [\"GET /marketplace_listing/stubbed/plans\"],\n    listReposAccessibleToInstallation: [\"GET /installation/repositories\"],\n    listSubscriptionsForAuthenticatedUser: [\"GET /user/marketplace_purchases\"],\n    listSubscriptionsForAuthenticatedUserStubbed: [\"GET /user/marketplace_purchases/stubbed\"],\n    removeRepoFromInstallation: [\"DELETE /user/installations/{installation_id}/repositories/{repository_id}\"],\n    resetToken: [\"PATCH /applications/{client_id}/token\"],\n    revokeInstallationAccessToken: [\"DELETE /installation/token\"],\n    scopeToken: [\"POST /applications/{client_id}/token/scoped\"],\n    suspendInstallation: [\"PUT /app/installations/{installation_id}/suspended\"],\n    unsuspendInstallation: [\"DELETE /app/installations/{installation_id}/suspended\"],\n    updateWebhookConfigForApp: [\"PATCH /app/hook/config\"]\n  },\n  billing: {\n    getGithubActionsBillingOrg: [\"GET /orgs/{org}/settings/billing/actions\"],\n    getGithubActionsBillingUser: [\"GET /users/{username}/settings/billing/actions\"],\n    getGithubPackagesBillingOrg: [\"GET /orgs/{org}/settings/billing/packages\"],\n    getGithubPackagesBillingUser: [\"GET /users/{username}/settings/billing/packages\"],\n    getSharedStorageBillingOrg: [\"GET /orgs/{org}/settings/billing/shared-storage\"],\n    getSharedStorageBillingUser: [\"GET /users/{username}/settings/billing/shared-storage\"]\n  },\n  checks: {\n    create: [\"POST /repos/{owner}/{repo}/check-runs\"],\n    createSuite: [\"POST /repos/{owner}/{repo}/check-suites\"],\n    get: [\"GET /repos/{owner}/{repo}/check-runs/{check_run_id}\"],\n    getSuite: [\"GET /repos/{owner}/{repo}/check-suites/{check_suite_id}\"],\n    listAnnotations: [\"GET /repos/{owner}/{repo}/check-runs/{check_run_id}/annotations\"],\n    listForRef: [\"GET /repos/{owner}/{repo}/commits/{ref}/check-runs\"],\n    listForSuite: [\"GET /repos/{owner}/{repo}/check-suites/{check_suite_id}/check-runs\"],\n    listSuitesForRef: [\"GET /repos/{owner}/{repo}/commits/{ref}/check-suites\"],\n    rerequestSuite: [\"POST /repos/{owner}/{repo}/check-suites/{check_suite_id}/rerequest\"],\n    setSuitesPreferences: [\"PATCH /repos/{owner}/{repo}/check-suites/preferences\"],\n    update: [\"PATCH /repos/{owner}/{repo}/check-runs/{check_run_id}\"]\n  },\n  codeScanning: {\n    deleteAnalysis: [\"DELETE /repos/{owner}/{repo}/code-scanning/analyses/{analysis_id}{?confirm_delete}\"],\n    getAlert: [\"GET /repos/{owner}/{repo}/code-scanning/alerts/{alert_number}\", {}, {\n      renamedParameters: {\n        alert_id: \"alert_number\"\n      }\n    }],\n    getAnalysis: [\"GET /repos/{owner}/{repo}/code-scanning/analyses/{analysis_id}\"],\n    getSarif: [\"GET /repos/{owner}/{repo}/code-scanning/sarifs/{sarif_id}\"],\n    listAlertsForRepo: [\"GET /repos/{owner}/{repo}/code-scanning/alerts\"],\n    listAlertsInstances: [\"GET /repos/{owner}/{repo}/code-scanning/alerts/{alert_number}/instances\"],\n    listRecentAnalyses: [\"GET /repos/{owner}/{repo}/code-scanning/analyses\"],\n    updateAlert: [\"PATCH /repos/{owner}/{repo}/code-scanning/alerts/{alert_number}\"],\n    uploadSarif: [\"POST /repos/{owner}/{repo}/code-scanning/sarifs\"]\n  },\n  codesOfConduct: {\n    getAllCodesOfConduct: [\"GET /codes_of_conduct\", {\n      mediaType: {\n        previews: [\"scarlet-witch\"]\n      }\n    }],\n    getConductCode: [\"GET /codes_of_conduct/{key}\", {\n      mediaType: {\n        previews: [\"scarlet-witch\"]\n      }\n    }],\n    getForRepo: [\"GET /repos/{owner}/{repo}/community/code_of_conduct\", {\n      mediaType: {\n        previews: [\"scarlet-witch\"]\n      }\n    }]\n  },\n  emojis: {\n    get: [\"GET /emojis\"]\n  },\n  enterpriseAdmin: {\n    disableSelectedOrganizationGithubActionsEnterprise: [\"DELETE /enterprises/{enterprise}/actions/permissions/organizations/{org_id}\"],\n    enableSelectedOrganizationGithubActionsEnterprise: [\"PUT /enterprises/{enterprise}/actions/permissions/organizations/{org_id}\"],\n    getAllowedActionsEnterprise: [\"GET /enterprises/{enterprise}/actions/permissions/selected-actions\"],\n    getGithubActionsPermissionsEnterprise: [\"GET /enterprises/{enterprise}/actions/permissions\"],\n    listSelectedOrganizationsEnabledGithubActionsEnterprise: [\"GET /enterprises/{enterprise}/actions/permissions/organizations\"],\n    setAllowedActionsEnterprise: [\"PUT /enterprises/{enterprise}/actions/permissions/selected-actions\"],\n    setGithubActionsPermissionsEnterprise: [\"PUT /enterprises/{enterprise}/actions/permissions\"],\n    setSelectedOrganizationsEnabledGithubActionsEnterprise: [\"PUT /enterprises/{enterprise}/actions/permissions/organizations\"]\n  },\n  gists: {\n    checkIsStarred: [\"GET /gists/{gist_id}/star\"],\n    create: [\"POST /gists\"],\n    createComment: [\"POST /gists/{gist_id}/comments\"],\n    delete: [\"DELETE /gists/{gist_id}\"],\n    deleteComment: [\"DELETE /gists/{gist_id}/comments/{comment_id}\"],\n    fork: [\"POST /gists/{gist_id}/forks\"],\n    get: [\"GET /gists/{gist_id}\"],\n    getComment: [\"GET /gists/{gist_id}/comments/{comment_id}\"],\n    getRevision: [\"GET /gists/{gist_id}/{sha}\"],\n    list: [\"GET /gists\"],\n    listComments: [\"GET /gists/{gist_id}/comments\"],\n    listCommits: [\"GET /gists/{gist_id}/commits\"],\n    listForUser: [\"GET /users/{username}/gists\"],\n    listForks: [\"GET /gists/{gist_id}/forks\"],\n    listPublic: [\"GET /gists/public\"],\n    listStarred: [\"GET /gists/starred\"],\n    star: [\"PUT /gists/{gist_id}/star\"],\n    unstar: [\"DELETE /gists/{gist_id}/star\"],\n    update: [\"PATCH /gists/{gist_id}\"],\n    updateComment: [\"PATCH /gists/{gist_id}/comments/{comment_id}\"]\n  },\n  git: {\n    createBlob: [\"POST /repos/{owner}/{repo}/git/blobs\"],\n    createCommit: [\"POST /repos/{owner}/{repo}/git/commits\"],\n    createRef: [\"POST /repos/{owner}/{repo}/git/refs\"],\n    createTag: [\"POST /repos/{owner}/{repo}/git/tags\"],\n    createTree: [\"POST /repos/{owner}/{repo}/git/trees\"],\n    deleteRef: [\"DELETE /repos/{owner}/{repo}/git/refs/{ref}\"],\n    getBlob: [\"GET /repos/{owner}/{repo}/git/blobs/{file_sha}\"],\n    getCommit: [\"GET /repos/{owner}/{repo}/git/commits/{commit_sha}\"],\n    getRef: [\"GET /repos/{owner}/{repo}/git/ref/{ref}\"],\n    getTag: [\"GET /repos/{owner}/{repo}/git/tags/{tag_sha}\"],\n    getTree: [\"GET /repos/{owner}/{repo}/git/trees/{tree_sha}\"],\n    listMatchingRefs: [\"GET /repos/{owner}/{repo}/git/matching-refs/{ref}\"],\n    updateRef: [\"PATCH /repos/{owner}/{repo}/git/refs/{ref}\"]\n  },\n  gitignore: {\n    getAllTemplates: [\"GET /gitignore/templates\"],\n    getTemplate: [\"GET /gitignore/templates/{name}\"]\n  },\n  interactions: {\n    getRestrictionsForAuthenticatedUser: [\"GET /user/interaction-limits\"],\n    getRestrictionsForOrg: [\"GET /orgs/{org}/interaction-limits\"],\n    getRestrictionsForRepo: [\"GET /repos/{owner}/{repo}/interaction-limits\"],\n    getRestrictionsForYourPublicRepos: [\"GET /user/interaction-limits\", {}, {\n      renamed: [\"interactions\", \"getRestrictionsForAuthenticatedUser\"]\n    }],\n    removeRestrictionsForAuthenticatedUser: [\"DELETE /user/interaction-limits\"],\n    removeRestrictionsForOrg: [\"DELETE /orgs/{org}/interaction-limits\"],\n    removeRestrictionsForRepo: [\"DELETE /repos/{owner}/{repo}/interaction-limits\"],\n    removeRestrictionsForYourPublicRepos: [\"DELETE /user/interaction-limits\", {}, {\n      renamed: [\"interactions\", \"removeRestrictionsForAuthenticatedUser\"]\n    }],\n    setRestrictionsForAuthenticatedUser: [\"PUT /user/interaction-limits\"],\n    setRestrictionsForOrg: [\"PUT /orgs/{org}/interaction-limits\"],\n    setRestrictionsForRepo: [\"PUT /repos/{owner}/{repo}/interaction-limits\"],\n    setRestrictionsForYourPublicRepos: [\"PUT /user/interaction-limits\", {}, {\n      renamed: [\"interactions\", \"setRestrictionsForAuthenticatedUser\"]\n    }]\n  },\n  issues: {\n    addAssignees: [\"POST /repos/{owner}/{repo}/issues/{issue_number}/assignees\"],\n    addLabels: [\"POST /repos/{owner}/{repo}/issues/{issue_number}/labels\"],\n    checkUserCanBeAssigned: [\"GET /repos/{owner}/{repo}/assignees/{assignee}\"],\n    create: [\"POST /repos/{owner}/{repo}/issues\"],\n    createComment: [\"POST /repos/{owner}/{repo}/issues/{issue_number}/comments\"],\n    createLabel: [\"POST /repos/{owner}/{repo}/labels\"],\n    createMilestone: [\"POST /repos/{owner}/{repo}/milestones\"],\n    deleteComment: [\"DELETE /repos/{owner}/{repo}/issues/comments/{comment_id}\"],\n    deleteLabel: [\"DELETE /repos/{owner}/{repo}/labels/{name}\"],\n    deleteMilestone: [\"DELETE /repos/{owner}/{repo}/milestones/{milestone_number}\"],\n    get: [\"GET /repos/{owner}/{repo}/issues/{issue_number}\"],\n    getComment: [\"GET /repos/{owner}/{repo}/issues/comments/{comment_id}\"],\n    getEvent: [\"GET /repos/{owner}/{repo}/issues/events/{event_id}\"],\n    getLabel: [\"GET /repos/{owner}/{repo}/labels/{name}\"],\n    getMilestone: [\"GET /repos/{owner}/{repo}/milestones/{milestone_number}\"],\n    list: [\"GET /issues\"],\n    listAssignees: [\"GET /repos/{owner}/{repo}/assignees\"],\n    listComments: [\"GET /repos/{owner}/{repo}/issues/{issue_number}/comments\"],\n    listCommentsForRepo: [\"GET /repos/{owner}/{repo}/issues/comments\"],\n    listEvents: [\"GET /repos/{owner}/{repo}/issues/{issue_number}/events\"],\n    listEventsForRepo: [\"GET /repos/{owner}/{repo}/issues/events\"],\n    listEventsForTimeline: [\"GET /repos/{owner}/{repo}/issues/{issue_number}/timeline\", {\n      mediaType: {\n        previews: [\"mockingbird\"]\n      }\n    }],\n    listForAuthenticatedUser: [\"GET /user/issues\"],\n    listForOrg: [\"GET /orgs/{org}/issues\"],\n    listForRepo: [\"GET /repos/{owner}/{repo}/issues\"],\n    listLabelsForMilestone: [\"GET /repos/{owner}/{repo}/milestones/{milestone_number}/labels\"],\n    listLabelsForRepo: [\"GET /repos/{owner}/{repo}/labels\"],\n    listLabelsOnIssue: [\"GET /repos/{owner}/{repo}/issues/{issue_number}/labels\"],\n    listMilestones: [\"GET /repos/{owner}/{repo}/milestones\"],\n    lock: [\"PUT /repos/{owner}/{repo}/issues/{issue_number}/lock\"],\n    removeAllLabels: [\"DELETE /repos/{owner}/{repo}/issues/{issue_number}/labels\"],\n    removeAssignees: [\"DELETE /repos/{owner}/{repo}/issues/{issue_number}/assignees\"],\n    removeLabel: [\"DELETE /repos/{owner}/{repo}/issues/{issue_number}/labels/{name}\"],\n    setLabels: [\"PUT /repos/{owner}/{repo}/issues/{issue_number}/labels\"],\n    unlock: [\"DELETE /repos/{owner}/{repo}/issues/{issue_number}/lock\"],\n    update: [\"PATCH /repos/{owner}/{repo}/issues/{issue_number}\"],\n    updateComment: [\"PATCH /repos/{owner}/{repo}/issues/comments/{comment_id}\"],\n    updateLabel: [\"PATCH /repos/{owner}/{repo}/labels/{name}\"],\n    updateMilestone: [\"PATCH /repos/{owner}/{repo}/milestones/{milestone_number}\"]\n  },\n  licenses: {\n    get: [\"GET /licenses/{license}\"],\n    getAllCommonlyUsed: [\"GET /licenses\"],\n    getForRepo: [\"GET /repos/{owner}/{repo}/license\"]\n  },\n  markdown: {\n    render: [\"POST /markdown\"],\n    renderRaw: [\"POST /markdown/raw\", {\n      headers: {\n        \"content-type\": \"text/plain; charset=utf-8\"\n      }\n    }]\n  },\n  meta: {\n    get: [\"GET /meta\"],\n    getOctocat: [\"GET /octocat\"],\n    getZen: [\"GET /zen\"],\n    root: [\"GET /\"]\n  },\n  migrations: {\n    cancelImport: [\"DELETE /repos/{owner}/{repo}/import\"],\n    deleteArchiveForAuthenticatedUser: [\"DELETE /user/migrations/{migration_id}/archive\", {\n      mediaType: {\n        previews: [\"wyandotte\"]\n      }\n    }],\n    deleteArchiveForOrg: [\"DELETE /orgs/{org}/migrations/{migration_id}/archive\", {\n      mediaType: {\n        previews: [\"wyandotte\"]\n      }\n    }],\n    downloadArchiveForOrg: [\"GET /orgs/{org}/migrations/{migration_id}/archive\", {\n      mediaType: {\n        previews: [\"wyandotte\"]\n      }\n    }],\n    getArchiveForAuthenticatedUser: [\"GET /user/migrations/{migration_id}/archive\", {\n      mediaType: {\n        previews: [\"wyandotte\"]\n      }\n    }],\n    getCommitAuthors: [\"GET /repos/{owner}/{repo}/import/authors\"],\n    getImportStatus: [\"GET /repos/{owner}/{repo}/import\"],\n    getLargeFiles: [\"GET /repos/{owner}/{repo}/import/large_files\"],\n    getStatusForAuthenticatedUser: [\"GET /user/migrations/{migration_id}\", {\n      mediaType: {\n        previews: [\"wyandotte\"]\n      }\n    }],\n    getStatusForOrg: [\"GET /orgs/{org}/migrations/{migration_id}\", {\n      mediaType: {\n        previews: [\"wyandotte\"]\n      }\n    }],\n    listForAuthenticatedUser: [\"GET /user/migrations\", {\n      mediaType: {\n        previews: [\"wyandotte\"]\n      }\n    }],\n    listForOrg: [\"GET /orgs/{org}/migrations\", {\n      mediaType: {\n        previews: [\"wyandotte\"]\n      }\n    }],\n    listReposForOrg: [\"GET /orgs/{org}/migrations/{migration_id}/repositories\", {\n      mediaType: {\n        previews: [\"wyandotte\"]\n      }\n    }],\n    listReposForUser: [\"GET /user/migrations/{migration_id}/repositories\", {\n      mediaType: {\n        previews: [\"wyandotte\"]\n      }\n    }],\n    mapCommitAuthor: [\"PATCH /repos/{owner}/{repo}/import/authors/{author_id}\"],\n    setLfsPreference: [\"PATCH /repos/{owner}/{repo}/import/lfs\"],\n    startForAuthenticatedUser: [\"POST /user/migrations\"],\n    startForOrg: [\"POST /orgs/{org}/migrations\"],\n    startImport: [\"PUT /repos/{owner}/{repo}/import\"],\n    unlockRepoForAuthenticatedUser: [\"DELETE /user/migrations/{migration_id}/repos/{repo_name}/lock\", {\n      mediaType: {\n        previews: [\"wyandotte\"]\n      }\n    }],\n    unlockRepoForOrg: [\"DELETE /orgs/{org}/migrations/{migration_id}/repos/{repo_name}/lock\", {\n      mediaType: {\n        previews: [\"wyandotte\"]\n      }\n    }],\n    updateImport: [\"PATCH /repos/{owner}/{repo}/import\"]\n  },\n  orgs: {\n    blockUser: [\"PUT /orgs/{org}/blocks/{username}\"],\n    cancelInvitation: [\"DELETE /orgs/{org}/invitations/{invitation_id}\"],\n    checkBlockedUser: [\"GET /orgs/{org}/blocks/{username}\"],\n    checkMembershipForUser: [\"GET /orgs/{org}/members/{username}\"],\n    checkPublicMembershipForUser: [\"GET /orgs/{org}/public_members/{username}\"],\n    convertMemberToOutsideCollaborator: [\"PUT /orgs/{org}/outside_collaborators/{username}\"],\n    createInvitation: [\"POST /orgs/{org}/invitations\"],\n    createWebhook: [\"POST /orgs/{org}/hooks\"],\n    deleteWebhook: [\"DELETE /orgs/{org}/hooks/{hook_id}\"],\n    get: [\"GET /orgs/{org}\"],\n    getMembershipForAuthenticatedUser: [\"GET /user/memberships/orgs/{org}\"],\n    getMembershipForUser: [\"GET /orgs/{org}/memberships/{username}\"],\n    getWebhook: [\"GET /orgs/{org}/hooks/{hook_id}\"],\n    getWebhookConfigForOrg: [\"GET /orgs/{org}/hooks/{hook_id}/config\"],\n    list: [\"GET /organizations\"],\n    listAppInstallations: [\"GET /orgs/{org}/installations\"],\n    listBlockedUsers: [\"GET /orgs/{org}/blocks\"],\n    listFailedInvitations: [\"GET /orgs/{org}/failed_invitations\"],\n    listForAuthenticatedUser: [\"GET /user/orgs\"],\n    listForUser: [\"GET /users/{username}/orgs\"],\n    listInvitationTeams: [\"GET /orgs/{org}/invitations/{invitation_id}/teams\"],\n    listMembers: [\"GET /orgs/{org}/members\"],\n    listMembershipsForAuthenticatedUser: [\"GET /user/memberships/orgs\"],\n    listOutsideCollaborators: [\"GET /orgs/{org}/outside_collaborators\"],\n    listPendingInvitations: [\"GET /orgs/{org}/invitations\"],\n    listPublicMembers: [\"GET /orgs/{org}/public_members\"],\n    listWebhooks: [\"GET /orgs/{org}/hooks\"],\n    pingWebhook: [\"POST /orgs/{org}/hooks/{hook_id}/pings\"],\n    removeMember: [\"DELETE /orgs/{org}/members/{username}\"],\n    removeMembershipForUser: [\"DELETE /orgs/{org}/memberships/{username}\"],\n    removeOutsideCollaborator: [\"DELETE /orgs/{org}/outside_collaborators/{username}\"],\n    removePublicMembershipForAuthenticatedUser: [\"DELETE /orgs/{org}/public_members/{username}\"],\n    setMembershipForUser: [\"PUT /orgs/{org}/memberships/{username}\"],\n    setPublicMembershipForAuthenticatedUser: [\"PUT /orgs/{org}/public_members/{username}\"],\n    unblockUser: [\"DELETE /orgs/{org}/blocks/{username}\"],\n    update: [\"PATCH /orgs/{org}\"],\n    updateMembershipForAuthenticatedUser: [\"PATCH /user/memberships/orgs/{org}\"],\n    updateWebhook: [\"PATCH /orgs/{org}/hooks/{hook_id}\"],\n    updateWebhookConfigForOrg: [\"PATCH /orgs/{org}/hooks/{hook_id}/config\"]\n  },\n  packages: {\n    deletePackageForAuthenticatedUser: [\"DELETE /user/packages/{package_type}/{package_name}\"],\n    deletePackageForOrg: [\"DELETE /orgs/{org}/packages/{package_type}/{package_name}\"],\n    deletePackageVersionForAuthenticatedUser: [\"DELETE /user/packages/{package_type}/{package_name}/versions/{package_version_id}\"],\n    deletePackageVersionForOrg: [\"DELETE /orgs/{org}/packages/{package_type}/{package_name}/versions/{package_version_id}\"],\n    getAllPackageVersionsForAPackageOwnedByAnOrg: [\"GET /orgs/{org}/packages/{package_type}/{package_name}/versions\", {}, {\n      renamed: [\"packages\", \"getAllPackageVersionsForPackageOwnedByOrg\"]\n    }],\n    getAllPackageVersionsForAPackageOwnedByTheAuthenticatedUser: [\"GET /user/packages/{package_type}/{package_name}/versions\", {}, {\n      renamed: [\"packages\", \"getAllPackageVersionsForPackageOwnedByAuthenticatedUser\"]\n    }],\n    getAllPackageVersionsForPackageOwnedByAuthenticatedUser: [\"GET /user/packages/{package_type}/{package_name}/versions\"],\n    getAllPackageVersionsForPackageOwnedByOrg: [\"GET /orgs/{org}/packages/{package_type}/{package_name}/versions\"],\n    getAllPackageVersionsForPackageOwnedByUser: [\"GET /users/{username}/packages/{package_type}/{package_name}/versions\"],\n    getPackageForAuthenticatedUser: [\"GET /user/packages/{package_type}/{package_name}\"],\n    getPackageForOrganization: [\"GET /orgs/{org}/packages/{package_type}/{package_name}\"],\n    getPackageForUser: [\"GET /users/{username}/packages/{package_type}/{package_name}\"],\n    getPackageVersionForAuthenticatedUser: [\"GET /user/packages/{package_type}/{package_name}/versions/{package_version_id}\"],\n    getPackageVersionForOrganization: [\"GET /orgs/{org}/packages/{package_type}/{package_name}/versions/{package_version_id}\"],\n    getPackageVersionForUser: [\"GET /users/{username}/packages/{package_type}/{package_name}/versions/{package_version_id}\"],\n    restorePackageForAuthenticatedUser: [\"POST /user/packages/{package_type}/{package_name}/restore{?token}\"],\n    restorePackageForOrg: [\"POST /orgs/{org}/packages/{package_type}/{package_name}/restore{?token}\"],\n    restorePackageVersionForAuthenticatedUser: [\"POST /user/packages/{package_type}/{package_name}/versions/{package_version_id}/restore\"],\n    restorePackageVersionForOrg: [\"POST /orgs/{org}/packages/{package_type}/{package_name}/versions/{package_version_id}/restore\"]\n  },\n  projects: {\n    addCollaborator: [\"PUT /projects/{project_id}/collaborators/{username}\", {\n      mediaType: {\n        previews: [\"inertia\"]\n      }\n    }],\n    createCard: [\"POST /projects/columns/{column_id}/cards\", {\n      mediaType: {\n        previews: [\"inertia\"]\n      }\n    }],\n    createColumn: [\"POST /projects/{project_id}/columns\", {\n      mediaType: {\n        previews: [\"inertia\"]\n      }\n    }],\n    createForAuthenticatedUser: [\"POST /user/projects\", {\n      mediaType: {\n        previews: [\"inertia\"]\n      }\n    }],\n    createForOrg: [\"POST /orgs/{org}/projects\", {\n      mediaType: {\n        previews: [\"inertia\"]\n      }\n    }],\n    createForRepo: [\"POST /repos/{owner}/{repo}/projects\", {\n      mediaType: {\n        previews: [\"inertia\"]\n      }\n    }],\n    delete: [\"DELETE /projects/{project_id}\", {\n      mediaType: {\n        previews: [\"inertia\"]\n      }\n    }],\n    deleteCard: [\"DELETE /projects/columns/cards/{card_id}\", {\n      mediaType: {\n        previews: [\"inertia\"]\n      }\n    }],\n    deleteColumn: [\"DELETE /projects/columns/{column_id}\", {\n      mediaType: {\n        previews: [\"inertia\"]\n      }\n    }],\n    get: [\"GET /projects/{project_id}\", {\n      mediaType: {\n        previews: [\"inertia\"]\n      }\n    }],\n    getCard: [\"GET /projects/columns/cards/{card_id}\", {\n      mediaType: {\n        previews: [\"inertia\"]\n      }\n    }],\n    getColumn: [\"GET /projects/columns/{column_id}\", {\n      mediaType: {\n        previews: [\"inertia\"]\n      }\n    }],\n    getPermissionForUser: [\"GET /projects/{project_id}/collaborators/{username}/permission\", {\n      mediaType: {\n        previews: [\"inertia\"]\n      }\n    }],\n    listCards: [\"GET /projects/columns/{column_id}/cards\", {\n      mediaType: {\n        previews: [\"inertia\"]\n      }\n    }],\n    listCollaborators: [\"GET /projects/{project_id}/collaborators\", {\n      mediaType: {\n        previews: [\"inertia\"]\n      }\n    }],\n    listColumns: [\"GET /projects/{project_id}/columns\", {\n      mediaType: {\n        previews: [\"inertia\"]\n      }\n    }],\n    listForOrg: [\"GET /orgs/{org}/projects\", {\n      mediaType: {\n        previews: [\"inertia\"]\n      }\n    }],\n    listForRepo: [\"GET /repos/{owner}/{repo}/projects\", {\n      mediaType: {\n        previews: [\"inertia\"]\n      }\n    }],\n    listForUser: [\"GET /users/{username}/projects\", {\n      mediaType: {\n        previews: [\"inertia\"]\n      }\n    }],\n    moveCard: [\"POST /projects/columns/cards/{card_id}/moves\", {\n      mediaType: {\n        previews: [\"inertia\"]\n      }\n    }],\n    moveColumn: [\"POST /projects/columns/{column_id}/moves\", {\n      mediaType: {\n        previews: [\"inertia\"]\n      }\n    }],\n    removeCollaborator: [\"DELETE /projects/{project_id}/collaborators/{username}\", {\n      mediaType: {\n        previews: [\"inertia\"]\n      }\n    }],\n    update: [\"PATCH /projects/{project_id}\", {\n      mediaType: {\n        previews: [\"inertia\"]\n      }\n    }],\n    updateCard: [\"PATCH /projects/columns/cards/{card_id}\", {\n      mediaType: {\n        previews: [\"inertia\"]\n      }\n    }],\n    updateColumn: [\"PATCH /projects/columns/{column_id}\", {\n      mediaType: {\n        previews: [\"inertia\"]\n      }\n    }]\n  },\n  pulls: {\n    checkIfMerged: [\"GET /repos/{owner}/{repo}/pulls/{pull_number}/merge\"],\n    create: [\"POST /repos/{owner}/{repo}/pulls\"],\n    createReplyForReviewComment: [\"POST /repos/{owner}/{repo}/pulls/{pull_number}/comments/{comment_id}/replies\"],\n    createReview: [\"POST /repos/{owner}/{repo}/pulls/{pull_number}/reviews\"],\n    createReviewComment: [\"POST /repos/{owner}/{repo}/pulls/{pull_number}/comments\"],\n    deletePendingReview: [\"DELETE /repos/{owner}/{repo}/pulls/{pull_number}/reviews/{review_id}\"],\n    deleteReviewComment: [\"DELETE /repos/{owner}/{repo}/pulls/comments/{comment_id}\"],\n    dismissReview: [\"PUT /repos/{owner}/{repo}/pulls/{pull_number}/reviews/{review_id}/dismissals\"],\n    get: [\"GET /repos/{owner}/{repo}/pulls/{pull_number}\"],\n    getReview: [\"GET /repos/{owner}/{repo}/pulls/{pull_number}/reviews/{review_id}\"],\n    getReviewComment: [\"GET /repos/{owner}/{repo}/pulls/comments/{comment_id}\"],\n    list: [\"GET /repos/{owner}/{repo}/pulls\"],\n    listCommentsForReview: [\"GET /repos/{owner}/{repo}/pulls/{pull_number}/reviews/{review_id}/comments\"],\n    listCommits: [\"GET /repos/{owner}/{repo}/pulls/{pull_number}/commits\"],\n    listFiles: [\"GET /repos/{owner}/{repo}/pulls/{pull_number}/files\"],\n    listRequestedReviewers: [\"GET /repos/{owner}/{repo}/pulls/{pull_number}/requested_reviewers\"],\n    listReviewComments: [\"GET /repos/{owner}/{repo}/pulls/{pull_number}/comments\"],\n    listReviewCommentsForRepo: [\"GET /repos/{owner}/{repo}/pulls/comments\"],\n    listReviews: [\"GET /repos/{owner}/{repo}/pulls/{pull_number}/reviews\"],\n    merge: [\"PUT /repos/{owner}/{repo}/pulls/{pull_number}/merge\"],\n    removeRequestedReviewers: [\"DELETE /repos/{owner}/{repo}/pulls/{pull_number}/requested_reviewers\"],\n    requestReviewers: [\"POST /repos/{owner}/{repo}/pulls/{pull_number}/requested_reviewers\"],\n    submitReview: [\"POST /repos/{owner}/{repo}/pulls/{pull_number}/reviews/{review_id}/events\"],\n    update: [\"PATCH /repos/{owner}/{repo}/pulls/{pull_number}\"],\n    updateBranch: [\"PUT /repos/{owner}/{repo}/pulls/{pull_number}/update-branch\", {\n      mediaType: {\n        previews: [\"lydian\"]\n      }\n    }],\n    updateReview: [\"PUT /repos/{owner}/{repo}/pulls/{pull_number}/reviews/{review_id}\"],\n    updateReviewComment: [\"PATCH /repos/{owner}/{repo}/pulls/comments/{comment_id}\"]\n  },\n  rateLimit: {\n    get: [\"GET /rate_limit\"]\n  },\n  reactions: {\n    createForCommitComment: [\"POST /repos/{owner}/{repo}/comments/{comment_id}/reactions\", {\n      mediaType: {\n        previews: [\"squirrel-girl\"]\n      }\n    }],\n    createForIssue: [\"POST /repos/{owner}/{repo}/issues/{issue_number}/reactions\", {\n      mediaType: {\n        previews: [\"squirrel-girl\"]\n      }\n    }],\n    createForIssueComment: [\"POST /repos/{owner}/{repo}/issues/comments/{comment_id}/reactions\", {\n      mediaType: {\n        previews: [\"squirrel-girl\"]\n      }\n    }],\n    createForPullRequestReviewComment: [\"POST /repos/{owner}/{repo}/pulls/comments/{comment_id}/reactions\", {\n      mediaType: {\n        previews: [\"squirrel-girl\"]\n      }\n    }],\n    createForTeamDiscussionCommentInOrg: [\"POST /orgs/{org}/teams/{team_slug}/discussions/{discussion_number}/comments/{comment_number}/reactions\", {\n      mediaType: {\n        previews: [\"squirrel-girl\"]\n      }\n    }],\n    createForTeamDiscussionInOrg: [\"POST /orgs/{org}/teams/{team_slug}/discussions/{discussion_number}/reactions\", {\n      mediaType: {\n        previews: [\"squirrel-girl\"]\n      }\n    }],\n    deleteForCommitComment: [\"DELETE /repos/{owner}/{repo}/comments/{comment_id}/reactions/{reaction_id}\", {\n      mediaType: {\n        previews: [\"squirrel-girl\"]\n      }\n    }],\n    deleteForIssue: [\"DELETE /repos/{owner}/{repo}/issues/{issue_number}/reactions/{reaction_id}\", {\n      mediaType: {\n        previews: [\"squirrel-girl\"]\n      }\n    }],\n    deleteForIssueComment: [\"DELETE /repos/{owner}/{repo}/issues/comments/{comment_id}/reactions/{reaction_id}\", {\n      mediaType: {\n        previews: [\"squirrel-girl\"]\n      }\n    }],\n    deleteForPullRequestComment: [\"DELETE /repos/{owner}/{repo}/pulls/comments/{comment_id}/reactions/{reaction_id}\", {\n      mediaType: {\n        previews: [\"squirrel-girl\"]\n      }\n    }],\n    deleteForTeamDiscussion: [\"DELETE /orgs/{org}/teams/{team_slug}/discussions/{discussion_number}/reactions/{reaction_id}\", {\n      mediaType: {\n        previews: [\"squirrel-girl\"]\n      }\n    }],\n    deleteForTeamDiscussionComment: [\"DELETE /orgs/{org}/teams/{team_slug}/discussions/{discussion_number}/comments/{comment_number}/reactions/{reaction_id}\", {\n      mediaType: {\n        previews: [\"squirrel-girl\"]\n      }\n    }],\n    deleteLegacy: [\"DELETE /reactions/{reaction_id}\", {\n      mediaType: {\n        previews: [\"squirrel-girl\"]\n      }\n    }, {\n      deprecated: \"octokit.reactions.deleteLegacy() is deprecated, see https://docs.github.com/rest/reference/reactions/#delete-a-reaction-legacy\"\n    }],\n    listForCommitComment: [\"GET /repos/{owner}/{repo}/comments/{comment_id}/reactions\", {\n      mediaType: {\n        previews: [\"squirrel-girl\"]\n      }\n    }],\n    listForIssue: [\"GET /repos/{owner}/{repo}/issues/{issue_number}/reactions\", {\n      mediaType: {\n        previews: [\"squirrel-girl\"]\n      }\n    }],\n    listForIssueComment: [\"GET /repos/{owner}/{repo}/issues/comments/{comment_id}/reactions\", {\n      mediaType: {\n        previews: [\"squirrel-girl\"]\n      }\n    }],\n    listForPullRequestReviewComment: [\"GET /repos/{owner}/{repo}/pulls/comments/{comment_id}/reactions\", {\n      mediaType: {\n        previews: [\"squirrel-girl\"]\n      }\n    }],\n    listForTeamDiscussionCommentInOrg: [\"GET /orgs/{org}/teams/{team_slug}/discussions/{discussion_number}/comments/{comment_number}/reactions\", {\n      mediaType: {\n        previews: [\"squirrel-girl\"]\n      }\n    }],\n    listForTeamDiscussionInOrg: [\"GET /orgs/{org}/teams/{team_slug}/discussions/{discussion_number}/reactions\", {\n      mediaType: {\n        previews: [\"squirrel-girl\"]\n      }\n    }]\n  },\n  repos: {\n    acceptInvitation: [\"PATCH /user/repository_invitations/{invitation_id}\"],\n    addAppAccessRestrictions: [\"POST /repos/{owner}/{repo}/branches/{branch}/protection/restrictions/apps\", {}, {\n      mapToData: \"apps\"\n    }],\n    addCollaborator: [\"PUT /repos/{owner}/{repo}/collaborators/{username}\"],\n    addStatusCheckContexts: [\"POST /repos/{owner}/{repo}/branches/{branch}/protection/required_status_checks/contexts\", {}, {\n      mapToData: \"contexts\"\n    }],\n    addTeamAccessRestrictions: [\"POST /repos/{owner}/{repo}/branches/{branch}/protection/restrictions/teams\", {}, {\n      mapToData: \"teams\"\n    }],\n    addUserAccessRestrictions: [\"POST /repos/{owner}/{repo}/branches/{branch}/protection/restrictions/users\", {}, {\n      mapToData: \"users\"\n    }],\n    checkCollaborator: [\"GET /repos/{owner}/{repo}/collaborators/{username}\"],\n    checkVulnerabilityAlerts: [\"GET /repos/{owner}/{repo}/vulnerability-alerts\", {\n      mediaType: {\n        previews: [\"dorian\"]\n      }\n    }],\n    compareCommits: [\"GET /repos/{owner}/{repo}/compare/{base}...{head}\"],\n    createCommitComment: [\"POST /repos/{owner}/{repo}/commits/{commit_sha}/comments\"],\n    createCommitSignatureProtection: [\"POST /repos/{owner}/{repo}/branches/{branch}/protection/required_signatures\", {\n      mediaType: {\n        previews: [\"zzzax\"]\n      }\n    }],\n    createCommitStatus: [\"POST /repos/{owner}/{repo}/statuses/{sha}\"],\n    createDeployKey: [\"POST /repos/{owner}/{repo}/keys\"],\n    createDeployment: [\"POST /repos/{owner}/{repo}/deployments\"],\n    createDeploymentStatus: [\"POST /repos/{owner}/{repo}/deployments/{deployment_id}/statuses\"],\n    createDispatchEvent: [\"POST /repos/{owner}/{repo}/dispatches\"],\n    createForAuthenticatedUser: [\"POST /user/repos\"],\n    createFork: [\"POST /repos/{owner}/{repo}/forks{?org,organization}\"],\n    createInOrg: [\"POST /orgs/{org}/repos\"],\n    createOrUpdateEnvironment: [\"PUT /repos/{owner}/{repo}/environments/{environment_name}\"],\n    createOrUpdateFileContents: [\"PUT /repos/{owner}/{repo}/contents/{path}\"],\n    createPagesSite: [\"POST /repos/{owner}/{repo}/pages\", {\n      mediaType: {\n        previews: [\"switcheroo\"]\n      }\n    }],\n    createRelease: [\"POST /repos/{owner}/{repo}/releases\"],\n    createUsingTemplate: [\"POST /repos/{template_owner}/{template_repo}/generate\", {\n      mediaType: {\n        previews: [\"baptiste\"]\n      }\n    }],\n    createWebhook: [\"POST /repos/{owner}/{repo}/hooks\"],\n    declineInvitation: [\"DELETE /user/repository_invitations/{invitation_id}\"],\n    delete: [\"DELETE /repos/{owner}/{repo}\"],\n    deleteAccessRestrictions: [\"DELETE /repos/{owner}/{repo}/branches/{branch}/protection/restrictions\"],\n    deleteAdminBranchProtection: [\"DELETE /repos/{owner}/{repo}/branches/{branch}/protection/enforce_admins\"],\n    deleteAnEnvironment: [\"DELETE /repos/{owner}/{repo}/environments/{environment_name}\"],\n    deleteBranchProtection: [\"DELETE /repos/{owner}/{repo}/branches/{branch}/protection\"],\n    deleteCommitComment: [\"DELETE /repos/{owner}/{repo}/comments/{comment_id}\"],\n    deleteCommitSignatureProtection: [\"DELETE /repos/{owner}/{repo}/branches/{branch}/protection/required_signatures\", {\n      mediaType: {\n        previews: [\"zzzax\"]\n      }\n    }],\n    deleteDeployKey: [\"DELETE /repos/{owner}/{repo}/keys/{key_id}\"],\n    deleteDeployment: [\"DELETE /repos/{owner}/{repo}/deployments/{deployment_id}\"],\n    deleteFile: [\"DELETE /repos/{owner}/{repo}/contents/{path}\"],\n    deleteInvitation: [\"DELETE /repos/{owner}/{repo}/invitations/{invitation_id}\"],\n    deletePagesSite: [\"DELETE /repos/{owner}/{repo}/pages\", {\n      mediaType: {\n        previews: [\"switcheroo\"]\n      }\n    }],\n    deletePullRequestReviewProtection: [\"DELETE /repos/{owner}/{repo}/branches/{branch}/protection/required_pull_request_reviews\"],\n    deleteRelease: [\"DELETE /repos/{owner}/{repo}/releases/{release_id}\"],\n    deleteReleaseAsset: [\"DELETE /repos/{owner}/{repo}/releases/assets/{asset_id}\"],\n    deleteWebhook: [\"DELETE /repos/{owner}/{repo}/hooks/{hook_id}\"],\n    disableAutomatedSecurityFixes: [\"DELETE /repos/{owner}/{repo}/automated-security-fixes\", {\n      mediaType: {\n        previews: [\"london\"]\n      }\n    }],\n    disableVulnerabilityAlerts: [\"DELETE /repos/{owner}/{repo}/vulnerability-alerts\", {\n      mediaType: {\n        previews: [\"dorian\"]\n      }\n    }],\n    downloadArchive: [\"GET /repos/{owner}/{repo}/zipball/{ref}\", {}, {\n      renamed: [\"repos\", \"downloadZipballArchive\"]\n    }],\n    downloadTarballArchive: [\"GET /repos/{owner}/{repo}/tarball/{ref}\"],\n    downloadZipballArchive: [\"GET /repos/{owner}/{repo}/zipball/{ref}\"],\n    enableAutomatedSecurityFixes: [\"PUT /repos/{owner}/{repo}/automated-security-fixes\", {\n      mediaType: {\n        previews: [\"london\"]\n      }\n    }],\n    enableVulnerabilityAlerts: [\"PUT /repos/{owner}/{repo}/vulnerability-alerts\", {\n      mediaType: {\n        previews: [\"dorian\"]\n      }\n    }],\n    get: [\"GET /repos/{owner}/{repo}\"],\n    getAccessRestrictions: [\"GET /repos/{owner}/{repo}/branches/{branch}/protection/restrictions\"],\n    getAdminBranchProtection: [\"GET /repos/{owner}/{repo}/branches/{branch}/protection/enforce_admins\"],\n    getAllEnvironments: [\"GET /repos/{owner}/{repo}/environments\"],\n    getAllStatusCheckContexts: [\"GET /repos/{owner}/{repo}/branches/{branch}/protection/required_status_checks/contexts\"],\n    getAllTopics: [\"GET /repos/{owner}/{repo}/topics\", {\n      mediaType: {\n        previews: [\"mercy\"]\n      }\n    }],\n    getAppsWithAccessToProtectedBranch: [\"GET /repos/{owner}/{repo}/branches/{branch}/protection/restrictions/apps\"],\n    getBranch: [\"GET /repos/{owner}/{repo}/branches/{branch}\"],\n    getBranchProtection: [\"GET /repos/{owner}/{repo}/branches/{branch}/protection\"],\n    getClones: [\"GET /repos/{owner}/{repo}/traffic/clones\"],\n    getCodeFrequencyStats: [\"GET /repos/{owner}/{repo}/stats/code_frequency\"],\n    getCollaboratorPermissionLevel: [\"GET /repos/{owner}/{repo}/collaborators/{username}/permission\"],\n    getCombinedStatusForRef: [\"GET /repos/{owner}/{repo}/commits/{ref}/status\"],\n    getCommit: [\"GET /repos/{owner}/{repo}/commits/{ref}\"],\n    getCommitActivityStats: [\"GET /repos/{owner}/{repo}/stats/commit_activity\"],\n    getCommitComment: [\"GET /repos/{owner}/{repo}/comments/{comment_id}\"],\n    getCommitSignatureProtection: [\"GET /repos/{owner}/{repo}/branches/{branch}/protection/required_signatures\", {\n      mediaType: {\n        previews: [\"zzzax\"]\n      }\n    }],\n    getCommunityProfileMetrics: [\"GET /repos/{owner}/{repo}/community/profile\"],\n    getContent: [\"GET /repos/{owner}/{repo}/contents/{path}\"],\n    getContributorsStats: [\"GET /repos/{owner}/{repo}/stats/contributors\"],\n    getDeployKey: [\"GET /repos/{owner}/{repo}/keys/{key_id}\"],\n    getDeployment: [\"GET /repos/{owner}/{repo}/deployments/{deployment_id}\"],\n    getDeploymentStatus: [\"GET /repos/{owner}/{repo}/deployments/{deployment_id}/statuses/{status_id}\"],\n    getEnvironment: [\"GET /repos/{owner}/{repo}/environments/{environment_name}\"],\n    getLatestPagesBuild: [\"GET /repos/{owner}/{repo}/pages/builds/latest\"],\n    getLatestRelease: [\"GET /repos/{owner}/{repo}/releases/latest\"],\n    getPages: [\"GET /repos/{owner}/{repo}/pages\"],\n    getPagesBuild: [\"GET /repos/{owner}/{repo}/pages/builds/{build_id}\"],\n    getParticipationStats: [\"GET /repos/{owner}/{repo}/stats/participation\"],\n    getPullRequestReviewProtection: [\"GET /repos/{owner}/{repo}/branches/{branch}/protection/required_pull_request_reviews\"],\n    getPunchCardStats: [\"GET /repos/{owner}/{repo}/stats/punch_card\"],\n    getReadme: [\"GET /repos/{owner}/{repo}/readme\"],\n    getReadmeInDirectory: [\"GET /repos/{owner}/{repo}/readme/{dir}\"],\n    getRelease: [\"GET /repos/{owner}/{repo}/releases/{release_id}\"],\n    getReleaseAsset: [\"GET /repos/{owner}/{repo}/releases/assets/{asset_id}\"],\n    getReleaseByTag: [\"GET /repos/{owner}/{repo}/releases/tags/{tag}\"],\n    getStatusChecksProtection: [\"GET /repos/{owner}/{repo}/branches/{branch}/protection/required_status_checks\"],\n    getTeamsWithAccessToProtectedBranch: [\"GET /repos/{owner}/{repo}/branches/{branch}/protection/restrictions/teams\"],\n    getTopPaths: [\"GET /repos/{owner}/{repo}/traffic/popular/paths\"],\n    getTopReferrers: [\"GET /repos/{owner}/{repo}/traffic/popular/referrers\"],\n    getUsersWithAccessToProtectedBranch: [\"GET /repos/{owner}/{repo}/branches/{branch}/protection/restrictions/users\"],\n    getViews: [\"GET /repos/{owner}/{repo}/traffic/views\"],\n    getWebhook: [\"GET /repos/{owner}/{repo}/hooks/{hook_id}\"],\n    getWebhookConfigForRepo: [\"GET /repos/{owner}/{repo}/hooks/{hook_id}/config\"],\n    listBranches: [\"GET /repos/{owner}/{repo}/branches\"],\n    listBranchesForHeadCommit: [\"GET /repos/{owner}/{repo}/commits/{commit_sha}/branches-where-head\", {\n      mediaType: {\n        previews: [\"groot\"]\n      }\n    }],\n    listCollaborators: [\"GET /repos/{owner}/{repo}/collaborators\"],\n    listCommentsForCommit: [\"GET /repos/{owner}/{repo}/commits/{commit_sha}/comments\"],\n    listCommitCommentsForRepo: [\"GET /repos/{owner}/{repo}/comments\"],\n    listCommitStatusesForRef: [\"GET /repos/{owner}/{repo}/commits/{ref}/statuses\"],\n    listCommits: [\"GET /repos/{owner}/{repo}/commits\"],\n    listContributors: [\"GET /repos/{owner}/{repo}/contributors\"],\n    listDeployKeys: [\"GET /repos/{owner}/{repo}/keys\"],\n    listDeploymentStatuses: [\"GET /repos/{owner}/{repo}/deployments/{deployment_id}/statuses\"],\n    listDeployments: [\"GET /repos/{owner}/{repo}/deployments\"],\n    listForAuthenticatedUser: [\"GET /user/repos\"],\n    listForOrg: [\"GET /orgs/{org}/repos\"],\n    listForUser: [\"GET /users/{username}/repos\"],\n    listForks: [\"GET /repos/{owner}/{repo}/forks\"],\n    listInvitations: [\"GET /repos/{owner}/{repo}/invitations\"],\n    listInvitationsForAuthenticatedUser: [\"GET /user/repository_invitations\"],\n    listLanguages: [\"GET /repos/{owner}/{repo}/languages\"],\n    listPagesBuilds: [\"GET /repos/{owner}/{repo}/pages/builds\"],\n    listPublic: [\"GET /repositories\"],\n    listPullRequestsAssociatedWithCommit: [\"GET /repos/{owner}/{repo}/commits/{commit_sha}/pulls\", {\n      mediaType: {\n        previews: [\"groot\"]\n      }\n    }],\n    listReleaseAssets: [\"GET /repos/{owner}/{repo}/releases/{release_id}/assets\"],\n    listReleases: [\"GET /repos/{owner}/{repo}/releases\"],\n    listTags: [\"GET /repos/{owner}/{repo}/tags\"],\n    listTeams: [\"GET /repos/{owner}/{repo}/teams\"],\n    listWebhooks: [\"GET /repos/{owner}/{repo}/hooks\"],\n    merge: [\"POST /repos/{owner}/{repo}/merges\"],\n    pingWebhook: [\"POST /repos/{owner}/{repo}/hooks/{hook_id}/pings\"],\n    removeAppAccessRestrictions: [\"DELETE /repos/{owner}/{repo}/branches/{branch}/protection/restrictions/apps\", {}, {\n      mapToData: \"apps\"\n    }],\n    removeCollaborator: [\"DELETE /repos/{owner}/{repo}/collaborators/{username}\"],\n    removeStatusCheckContexts: [\"DELETE /repos/{owner}/{repo}/branches/{branch}/protection/required_status_checks/contexts\", {}, {\n      mapToData: \"contexts\"\n    }],\n    removeStatusCheckProtection: [\"DELETE /repos/{owner}/{repo}/branches/{branch}/protection/required_status_checks\"],\n    removeTeamAccessRestrictions: [\"DELETE /repos/{owner}/{repo}/branches/{branch}/protection/restrictions/teams\", {}, {\n      mapToData: \"teams\"\n    }],\n    removeUserAccessRestrictions: [\"DELETE /repos/{owner}/{repo}/branches/{branch}/protection/restrictions/users\", {}, {\n      mapToData: \"users\"\n    }],\n    renameBranch: [\"POST /repos/{owner}/{repo}/branches/{branch}/rename\"],\n    replaceAllTopics: [\"PUT /repos/{owner}/{repo}/topics\", {\n      mediaType: {\n        previews: [\"mercy\"]\n      }\n    }],\n    requestPagesBuild: [\"POST /repos/{owner}/{repo}/pages/builds\"],\n    setAdminBranchProtection: [\"POST /repos/{owner}/{repo}/branches/{branch}/protection/enforce_admins\"],\n    setAppAccessRestrictions: [\"PUT /repos/{owner}/{repo}/branches/{branch}/protection/restrictions/apps\", {}, {\n      mapToData: \"apps\"\n    }],\n    setStatusCheckContexts: [\"PUT /repos/{owner}/{repo}/branches/{branch}/protection/required_status_checks/contexts\", {}, {\n      mapToData: \"contexts\"\n    }],\n    setTeamAccessRestrictions: [\"PUT /repos/{owner}/{repo}/branches/{branch}/protection/restrictions/teams\", {}, {\n      mapToData: \"teams\"\n    }],\n    setUserAccessRestrictions: [\"PUT /repos/{owner}/{repo}/branches/{branch}/protection/restrictions/users\", {}, {\n      mapToData: \"users\"\n    }],\n    testPushWebhook: [\"POST /repos/{owner}/{repo}/hooks/{hook_id}/tests\"],\n    transfer: [\"POST /repos/{owner}/{repo}/transfer\"],\n    update: [\"PATCH /repos/{owner}/{repo}\"],\n    updateBranchProtection: [\"PUT /repos/{owner}/{repo}/branches/{branch}/protection\"],\n    updateCommitComment: [\"PATCH /repos/{owner}/{repo}/comments/{comment_id}\"],\n    updateInformationAboutPagesSite: [\"PUT /repos/{owner}/{repo}/pages\"],\n    updateInvitation: [\"PATCH /repos/{owner}/{repo}/invitations/{invitation_id}\"],\n    updatePullRequestReviewProtection: [\"PATCH /repos/{owner}/{repo}/branches/{branch}/protection/required_pull_request_reviews\"],\n    updateRelease: [\"PATCH /repos/{owner}/{repo}/releases/{release_id}\"],\n    updateReleaseAsset: [\"PATCH /repos/{owner}/{repo}/releases/assets/{asset_id}\"],\n    updateStatusCheckPotection: [\"PATCH /repos/{owner}/{repo}/branches/{branch}/protection/required_status_checks\", {}, {\n      renamed: [\"repos\", \"updateStatusCheckProtection\"]\n    }],\n    updateStatusCheckProtection: [\"PATCH /repos/{owner}/{repo}/branches/{branch}/protection/required_status_checks\"],\n    updateWebhook: [\"PATCH /repos/{owner}/{repo}/hooks/{hook_id}\"],\n    updateWebhookConfigForRepo: [\"PATCH /repos/{owner}/{repo}/hooks/{hook_id}/config\"],\n    uploadReleaseAsset: [\"POST /repos/{owner}/{repo}/releases/{release_id}/assets{?name,label}\", {\n      baseUrl: \"https://uploads.github.com\"\n    }]\n  },\n  search: {\n    code: [\"GET /search/code\"],\n    commits: [\"GET /search/commits\", {\n      mediaType: {\n        previews: [\"cloak\"]\n      }\n    }],\n    issuesAndPullRequests: [\"GET /search/issues\"],\n    labels: [\"GET /search/labels\"],\n    repos: [\"GET /search/repositories\"],\n    topics: [\"GET /search/topics\", {\n      mediaType: {\n        previews: [\"mercy\"]\n      }\n    }],\n    users: [\"GET /search/users\"]\n  },\n  secretScanning: {\n    getAlert: [\"GET /repos/{owner}/{repo}/secret-scanning/alerts/{alert_number}\"],\n    listAlertsForRepo: [\"GET /repos/{owner}/{repo}/secret-scanning/alerts\"],\n    updateAlert: [\"PATCH /repos/{owner}/{repo}/secret-scanning/alerts/{alert_number}\"]\n  },\n  teams: {\n    addOrUpdateMembershipForUserInOrg: [\"PUT /orgs/{org}/teams/{team_slug}/memberships/{username}\"],\n    addOrUpdateProjectPermissionsInOrg: [\"PUT /orgs/{org}/teams/{team_slug}/projects/{project_id}\", {\n      mediaType: {\n        previews: [\"inertia\"]\n      }\n    }],\n    addOrUpdateRepoPermissionsInOrg: [\"PUT /orgs/{org}/teams/{team_slug}/repos/{owner}/{repo}\"],\n    checkPermissionsForProjectInOrg: [\"GET /orgs/{org}/teams/{team_slug}/projects/{project_id}\", {\n      mediaType: {\n        previews: [\"inertia\"]\n      }\n    }],\n    checkPermissionsForRepoInOrg: [\"GET /orgs/{org}/teams/{team_slug}/repos/{owner}/{repo}\"],\n    create: [\"POST /orgs/{org}/teams\"],\n    createDiscussionCommentInOrg: [\"POST /orgs/{org}/teams/{team_slug}/discussions/{discussion_number}/comments\"],\n    createDiscussionInOrg: [\"POST /orgs/{org}/teams/{team_slug}/discussions\"],\n    deleteDiscussionCommentInOrg: [\"DELETE /orgs/{org}/teams/{team_slug}/discussions/{discussion_number}/comments/{comment_number}\"],\n    deleteDiscussionInOrg: [\"DELETE /orgs/{org}/teams/{team_slug}/discussions/{discussion_number}\"],\n    deleteInOrg: [\"DELETE /orgs/{org}/teams/{team_slug}\"],\n    getByName: [\"GET /orgs/{org}/teams/{team_slug}\"],\n    getDiscussionCommentInOrg: [\"GET /orgs/{org}/teams/{team_slug}/discussions/{discussion_number}/comments/{comment_number}\"],\n    getDiscussionInOrg: [\"GET /orgs/{org}/teams/{team_slug}/discussions/{discussion_number}\"],\n    getMembershipForUserInOrg: [\"GET /orgs/{org}/teams/{team_slug}/memberships/{username}\"],\n    list: [\"GET /orgs/{org}/teams\"],\n    listChildInOrg: [\"GET /orgs/{org}/teams/{team_slug}/teams\"],\n    listDiscussionCommentsInOrg: [\"GET /orgs/{org}/teams/{team_slug}/discussions/{discussion_number}/comments\"],\n    listDiscussionsInOrg: [\"GET /orgs/{org}/teams/{team_slug}/discussions\"],\n    listForAuthenticatedUser: [\"GET /user/teams\"],\n    listMembersInOrg: [\"GET /orgs/{org}/teams/{team_slug}/members\"],\n    listPendingInvitationsInOrg: [\"GET /orgs/{org}/teams/{team_slug}/invitations\"],\n    listProjectsInOrg: [\"GET /orgs/{org}/teams/{team_slug}/projects\", {\n      mediaType: {\n        previews: [\"inertia\"]\n      }\n    }],\n    listReposInOrg: [\"GET /orgs/{org}/teams/{team_slug}/repos\"],\n    removeMembershipForUserInOrg: [\"DELETE /orgs/{org}/teams/{team_slug}/memberships/{username}\"],\n    removeProjectInOrg: [\"DELETE /orgs/{org}/teams/{team_slug}/projects/{project_id}\"],\n    removeRepoInOrg: [\"DELETE /orgs/{org}/teams/{team_slug}/repos/{owner}/{repo}\"],\n    updateDiscussionCommentInOrg: [\"PATCH /orgs/{org}/teams/{team_slug}/discussions/{discussion_number}/comments/{comment_number}\"],\n    updateDiscussionInOrg: [\"PATCH /orgs/{org}/teams/{team_slug}/discussions/{discussion_number}\"],\n    updateInOrg: [\"PATCH /orgs/{org}/teams/{team_slug}\"]\n  },\n  users: {\n    addEmailForAuthenticated: [\"POST /user/emails\"],\n    block: [\"PUT /user/blocks/{username}\"],\n    checkBlocked: [\"GET /user/blocks/{username}\"],\n    checkFollowingForUser: [\"GET /users/{username}/following/{target_user}\"],\n    checkPersonIsFollowedByAuthenticated: [\"GET /user/following/{username}\"],\n    createGpgKeyForAuthenticated: [\"POST /user/gpg_keys\"],\n    createPublicSshKeyForAuthenticated: [\"POST /user/keys\"],\n    deleteEmailForAuthenticated: [\"DELETE /user/emails\"],\n    deleteGpgKeyForAuthenticated: [\"DELETE /user/gpg_keys/{gpg_key_id}\"],\n    deletePublicSshKeyForAuthenticated: [\"DELETE /user/keys/{key_id}\"],\n    follow: [\"PUT /user/following/{username}\"],\n    getAuthenticated: [\"GET /user\"],\n    getByUsername: [\"GET /users/{username}\"],\n    getContextForUser: [\"GET /users/{username}/hovercard\"],\n    getGpgKeyForAuthenticated: [\"GET /user/gpg_keys/{gpg_key_id}\"],\n    getPublicSshKeyForAuthenticated: [\"GET /user/keys/{key_id}\"],\n    list: [\"GET /users\"],\n    listBlockedByAuthenticated: [\"GET /user/blocks\"],\n    listEmailsForAuthenticated: [\"GET /user/emails\"],\n    listFollowedByAuthenticated: [\"GET /user/following\"],\n    listFollowersForAuthenticatedUser: [\"GET /user/followers\"],\n    listFollowersForUser: [\"GET /users/{username}/followers\"],\n    listFollowingForUser: [\"GET /users/{username}/following\"],\n    listGpgKeysForAuthenticated: [\"GET /user/gpg_keys\"],\n    listGpgKeysForUser: [\"GET /users/{username}/gpg_keys\"],\n    listPublicEmailsForAuthenticated: [\"GET /user/public_emails\"],\n    listPublicKeysForUser: [\"GET /users/{username}/keys\"],\n    listPublicSshKeysForAuthenticated: [\"GET /user/keys\"],\n    setPrimaryEmailVisibilityForAuthenticated: [\"PATCH /user/email/visibility\"],\n    unblock: [\"DELETE /user/blocks/{username}\"],\n    unfollow: [\"DELETE /user/following/{username}\"],\n    updateAuthenticated: [\"PATCH /user\"]\n  }\n};\n\nconst VERSION = \"4.15.0\";\n\nfunction endpointsToMethods(octokit, endpointsMap) {\n  const newMethods = {};\n\n  for (const [scope, endpoints] of Object.entries(endpointsMap)) {\n    for (const [methodName, endpoint] of Object.entries(endpoints)) {\n      const [route, defaults, decorations] = endpoint;\n      const [method, url] = route.split(/ /);\n      const endpointDefaults = Object.assign({\n        method,\n        url\n      }, defaults);\n\n      if (!newMethods[scope]) {\n        newMethods[scope] = {};\n      }\n\n      const scopeMethods = newMethods[scope];\n\n      if (decorations) {\n        scopeMethods[methodName] = decorate(octokit, scope, methodName, endpointDefaults, decorations);\n        continue;\n      }\n\n      scopeMethods[methodName] = octokit.request.defaults(endpointDefaults);\n    }\n  }\n\n  return newMethods;\n}\n\nfunction decorate(octokit, scope, methodName, defaults, decorations) {\n  const requestWithDefaults = octokit.request.defaults(defaults);\n  /* istanbul ignore next */\n\n  function withDecorations(...args) {\n    // @ts-ignore https://github.com/microsoft/TypeScript/issues/25488\n    let options = requestWithDefaults.endpoint.merge(...args); // There are currently no other decorations than `.mapToData`\n\n    if (decorations.mapToData) {\n      options = Object.assign({}, options, {\n        data: options[decorations.mapToData],\n        [decorations.mapToData]: undefined\n      });\n      return requestWithDefaults(options);\n    }\n\n    if (decorations.renamed) {\n      const [newScope, newMethodName] = decorations.renamed;\n      octokit.log.warn(`octokit.${scope}.${methodName}() has been renamed to octokit.${newScope}.${newMethodName}()`);\n    }\n\n    if (decorations.deprecated) {\n      octokit.log.warn(decorations.deprecated);\n    }\n\n    if (decorations.renamedParameters) {\n      // @ts-ignore https://github.com/microsoft/TypeScript/issues/25488\n      const options = requestWithDefaults.endpoint.merge(...args);\n\n      for (const [name, alias] of Object.entries(decorations.renamedParameters)) {\n        if (name in options) {\n          octokit.log.warn(`\"${name}\" parameter is deprecated for \"octokit.${scope}.${methodName}()\". Use \"${alias}\" instead`);\n\n          if (!(alias in options)) {\n            options[alias] = options[name];\n          }\n\n          delete options[name];\n        }\n      }\n\n      return requestWithDefaults(options);\n    } // @ts-ignore https://github.com/microsoft/TypeScript/issues/25488\n\n\n    return requestWithDefaults(...args);\n  }\n\n  return Object.assign(withDecorations, requestWithDefaults);\n}\n\nfunction restEndpointMethods(octokit) {\n  const api = endpointsToMethods(octokit, Endpoints);\n  return _objectSpread2(_objectSpread2({}, api), {}, {\n    rest: api\n  });\n}\nrestEndpointMethods.VERSION = VERSION;\n\nexports.restEndpointMethods = restEndpointMethods;\n//# sourceMappingURL=index.js.map\n\n\n/***/ }),\n\n/***/ 9968:\n/***/ ((__unused_webpack_module, exports, __nccwpck_require__) => {\n\n\"use strict\";\n\n\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\n\nfunction _interopDefault (ex) { return (ex && (typeof ex === 'object') && 'default' in ex) ? ex['default'] : ex; }\n\nvar BottleneckLight = _interopDefault(__nccwpck_require__(1174));\n\nfunction _defineProperty(obj, key, value) {\n  if (key in obj) {\n    Object.defineProperty(obj, key, {\n      value: value,\n      enumerable: true,\n      configurable: true,\n      writable: true\n    });\n  } else {\n    obj[key] = value;\n  }\n\n  return obj;\n}\n\nfunction ownKeys(object, enumerableOnly) {\n  var keys = Object.keys(object);\n\n  if (Object.getOwnPropertySymbols) {\n    var symbols = Object.getOwnPropertySymbols(object);\n    if (enumerableOnly) symbols = symbols.filter(function (sym) {\n      return Object.getOwnPropertyDescriptor(object, sym).enumerable;\n    });\n    keys.push.apply(keys, symbols);\n  }\n\n  return keys;\n}\n\nfunction _objectSpread2(target) {\n  for (var i = 1; i < arguments.length; i++) {\n    var source = arguments[i] != null ? arguments[i] : {};\n\n    if (i % 2) {\n      ownKeys(Object(source), true).forEach(function (key) {\n        _defineProperty(target, key, source[key]);\n      });\n    } else if (Object.getOwnPropertyDescriptors) {\n      Object.defineProperties(target, Object.getOwnPropertyDescriptors(source));\n    } else {\n      ownKeys(Object(source)).forEach(function (key) {\n        Object.defineProperty(target, key, Object.getOwnPropertyDescriptor(source, key));\n      });\n    }\n  }\n\n  return target;\n}\n\nconst VERSION = \"3.4.1\";\n\nconst noop = () => Promise.resolve(); // @ts-ignore\n\n\nfunction wrapRequest(state, request, options) {\n  return state.retryLimiter.schedule(doRequest, state, request, options);\n} // @ts-ignore\n\nasync function doRequest(state, request, options) {\n  const isWrite = options.method !== \"GET\" && options.method !== \"HEAD\";\n  const isSearch = options.method === \"GET\" && options.url.startsWith(\"/search/\");\n  const isGraphQL = options.url.startsWith(\"/graphql\");\n  const retryCount = ~~options.request.retryCount;\n  const jobOptions = retryCount > 0 ? {\n    priority: 0,\n    weight: 0\n  } : {};\n\n  if (state.clustering) {\n    // Remove a job from Redis if it has not completed or failed within 60s\n    // Examples: Node process terminated, client disconnected, etc.\n    // @ts-ignore\n    jobOptions.expiration = 1000 * 60;\n  } // Guarantee at least 1000ms between writes\n  // GraphQL can also trigger writes\n\n\n  if (isWrite || isGraphQL) {\n    await state.write.key(state.id).schedule(jobOptions, noop);\n  } // Guarantee at least 3000ms between requests that trigger notifications\n\n\n  if (isWrite && state.triggersNotification(options.url)) {\n    await state.notifications.key(state.id).schedule(jobOptions, noop);\n  } // Guarantee at least 2000ms between search requests\n\n\n  if (isSearch) {\n    await state.search.key(state.id).schedule(jobOptions, noop);\n  }\n\n  const req = state.global.key(state.id).schedule(jobOptions, request, options);\n\n  if (isGraphQL) {\n    const res = await req;\n\n    if (res.data.errors != null && // @ts-ignore\n    res.data.errors.some(error => error.type === \"RATE_LIMITED\")) {\n      const error = Object.assign(new Error(\"GraphQL Rate Limit Exceeded\"), {\n        headers: res.headers,\n        data: res.data\n      });\n      throw error;\n    }\n  }\n\n  return req;\n}\n\nvar triggersNotificationPaths = [\"/orgs/{org}/invitations\", \"/orgs/{org}/invitations/{invitation_id}\", \"/orgs/{org}/teams/{team_slug}/discussions\", \"/orgs/{org}/teams/{team_slug}/discussions/{discussion_number}/comments\", \"/repos/{owner}/{repo}/collaborators/{username}\", \"/repos/{owner}/{repo}/commits/{commit_sha}/comments\", \"/repos/{owner}/{repo}/issues\", \"/repos/{owner}/{repo}/issues/{issue_number}/comments\", \"/repos/{owner}/{repo}/pulls\", \"/repos/{owner}/{repo}/pulls/{pull_number}/comments\", \"/repos/{owner}/{repo}/pulls/{pull_number}/comments/{comment_id}/replies\", \"/repos/{owner}/{repo}/pulls/{pull_number}/merge\", \"/repos/{owner}/{repo}/pulls/{pull_number}/requested_reviewers\", \"/repos/{owner}/{repo}/pulls/{pull_number}/reviews\", \"/repos/{owner}/{repo}/releases\", \"/teams/{team_id}/discussions\", \"/teams/{team_id}/discussions/{discussion_number}/comments\"];\n\n// @ts-ignore\nfunction routeMatcher(paths) {\n  // EXAMPLE. For the following paths:\n\n  /* [\n      \"/orgs/{org}/invitations\",\n      \"/repos/{owner}/{repo}/collaborators/{username}\"\n  ] */\n  // @ts-ignore\n  const regexes = paths.map(path => path.split(\"/\") // @ts-ignore\n  .map(c => c.startsWith(\"{\") ? \"(?:.+?)\" : c).join(\"/\")); // 'regexes' would contain:\n\n  /* [\n      '/orgs/(?:.+?)/invitations',\n      '/repos/(?:.+?)/(?:.+?)/collaborators/(?:.+?)'\n  ] */\n  // @ts-ignore\n\n  const regex = `^(?:${regexes.map(r => `(?:${r})`).join(\"|\")})[^/]*$`; // 'regex' would contain:\n\n  /*\n    ^(?:(?:\\/orgs\\/(?:.+?)\\/invitations)|(?:\\/repos\\/(?:.+?)\\/(?:.+?)\\/collaborators\\/(?:.+?)))[^\\/]*$\n       It may look scary, but paste it into https://www.debuggex.com/\n    and it will make a lot more sense!\n  */\n\n  return new RegExp(regex, \"i\");\n}\n\nconst regex = routeMatcher(triggersNotificationPaths);\nconst triggersNotification = regex.test.bind(regex);\nconst groups = {}; // @ts-ignore\n\nconst createGroups = function (Bottleneck, common) {\n  // @ts-ignore\n  groups.global = new Bottleneck.Group(_objectSpread2({\n    id: \"octokit-global\",\n    maxConcurrent: 10\n  }, common)); // @ts-ignore\n\n  groups.search = new Bottleneck.Group(_objectSpread2({\n    id: \"octokit-search\",\n    maxConcurrent: 1,\n    minTime: 2000\n  }, common)); // @ts-ignore\n\n  groups.write = new Bottleneck.Group(_objectSpread2({\n    id: \"octokit-write\",\n    maxConcurrent: 1,\n    minTime: 1000\n  }, common)); // @ts-ignore\n\n  groups.notifications = new Bottleneck.Group(_objectSpread2({\n    id: \"octokit-notifications\",\n    maxConcurrent: 1,\n    minTime: 3000\n  }, common));\n};\n\nfunction throttling(octokit, octokitOptions = {}) {\n  const {\n    enabled = true,\n    Bottleneck = BottleneckLight,\n    id = \"no-id\",\n    timeout = 1000 * 60 * 2,\n    // Redis TTL: 2 minutes\n    connection\n  } = octokitOptions.throttle || {};\n\n  if (!enabled) {\n    return;\n  }\n\n  const common = {\n    connection,\n    timeout\n  }; // @ts-ignore\n\n  if (groups.global == null) {\n    createGroups(Bottleneck, common);\n  }\n\n  const state = Object.assign(_objectSpread2({\n    clustering: connection != null,\n    triggersNotification,\n    minimumAbuseRetryAfter: 5,\n    retryAfterBaseValue: 1000,\n    retryLimiter: new Bottleneck(),\n    id\n  }, groups), // @ts-ignore\n  octokitOptions.throttle);\n\n  if (typeof state.onAbuseLimit !== \"function\" || typeof state.onRateLimit !== \"function\") {\n    throw new Error(`octokit/plugin-throttling error:\n        You must pass the onAbuseLimit and onRateLimit error handlers.\n        See https://github.com/octokit/rest.js#throttling\n\n        const octokit = new Octokit({\n          throttle: {\n            onAbuseLimit: (retryAfter, options) => {/* ... */},\n            onRateLimit: (retryAfter, options) => {/* ... */}\n          }\n        })\n    `);\n  }\n\n  const events = {};\n  const emitter = new Bottleneck.Events(events); // @ts-ignore\n\n  events.on(\"abuse-limit\", state.onAbuseLimit); // @ts-ignore\n\n  events.on(\"rate-limit\", state.onRateLimit); // @ts-ignore\n\n  events.on(\"error\", e => console.warn(\"Error in throttling-plugin limit handler\", e)); // @ts-ignore\n\n  state.retryLimiter.on(\"failed\", async function (error, info) {\n    const options = info.args[info.args.length - 1];\n    const shouldRetryGraphQL = options.url.startsWith(\"/graphql\") && error.status !== 401;\n\n    if (!(shouldRetryGraphQL || error.status === 403)) {\n      return;\n    }\n\n    const retryCount = ~~options.request.retryCount;\n    options.request.retryCount = retryCount;\n    const {\n      wantRetry,\n      retryAfter\n    } = await async function () {\n      if (/\\babuse\\b/i.test(error.message)) {\n        // The user has hit the abuse rate limit. (REST and GraphQL)\n        // https://docs.github.com/en/rest/overview/resources-in-the-rest-api#abuse-rate-limits\n        // The Retry-After header can sometimes be blank when hitting an abuse limit,\n        // but is always present after 2-3s, so make sure to set `retryAfter` to at least 5s by default.\n        const retryAfter = Math.max(~~error.headers[\"retry-after\"], state.minimumAbuseRetryAfter);\n        const wantRetry = await emitter.trigger(\"abuse-limit\", retryAfter, options, octokit);\n        return {\n          wantRetry,\n          retryAfter\n        };\n      }\n\n      if (error.headers != null && error.headers[\"x-ratelimit-remaining\"] === \"0\") {\n        // The user has used all their allowed calls for the current time period (REST and GraphQL)\n        // https://docs.github.com/en/rest/reference/rate-limit (REST)\n        // https://docs.github.com/en/graphql/overview/resource-limitations#rate-limit (GraphQL)\n        const rateLimitReset = new Date(~~error.headers[\"x-ratelimit-reset\"] * 1000).getTime();\n        const retryAfter = Math.max(Math.ceil((rateLimitReset - Date.now()) / 1000), 0);\n        const wantRetry = await emitter.trigger(\"rate-limit\", retryAfter, options, octokit);\n        return {\n          wantRetry,\n          retryAfter\n        };\n      }\n\n      return {};\n    }();\n\n    if (wantRetry) {\n      options.request.retryCount++; // @ts-ignore\n\n      return retryAfter * state.retryAfterBaseValue;\n    }\n  });\n  octokit.hook.wrap(\"request\", wrapRequest.bind(null, state));\n}\nthrottling.VERSION = VERSION;\nthrottling.triggersNotification = triggersNotification;\n\nexports.throttling = throttling;\n//# sourceMappingURL=index.js.map\n\n\n/***/ }),\n\n/***/ 537:\n/***/ ((__unused_webpack_module, exports, __nccwpck_require__) => {\n\n\"use strict\";\n\n\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\n\nfunction _interopDefault (ex) { return (ex && (typeof ex === 'object') && 'default' in ex) ? ex['default'] : ex; }\n\nvar deprecation = __nccwpck_require__(8932);\nvar once = _interopDefault(__nccwpck_require__(1223));\n\nconst logOnce = once(deprecation => console.warn(deprecation));\n/**\n * Error with extra properties to help with debugging\n */\n\nclass RequestError extends Error {\n  constructor(message, statusCode, options) {\n    super(message); // Maintains proper stack trace (only available on V8)\n\n    /* istanbul ignore next */\n\n    if (Error.captureStackTrace) {\n      Error.captureStackTrace(this, this.constructor);\n    }\n\n    this.name = \"HttpError\";\n    this.status = statusCode;\n    Object.defineProperty(this, \"code\", {\n      get() {\n        logOnce(new deprecation.Deprecation(\"[@octokit/request-error] `error.code` is deprecated, use `error.status`.\"));\n        return statusCode;\n      }\n\n    });\n    this.headers = options.headers || {}; // redact request credentials without mutating original request options\n\n    const requestCopy = Object.assign({}, options.request);\n\n    if (options.request.headers.authorization) {\n      requestCopy.headers = Object.assign({}, options.request.headers, {\n        authorization: options.request.headers.authorization.replace(/ .*$/, \" [REDACTED]\")\n      });\n    }\n\n    requestCopy.url = requestCopy.url // client_id & client_secret can be passed as URL query parameters to increase rate limit\n    // see https://developer.github.com/v3/#increasing-the-unauthenticated-rate-limit-for-oauth-applications\n    .replace(/\\bclient_secret=\\w+/g, \"client_secret=[REDACTED]\") // OAuth tokens can be passed as URL query parameters, although it is not recommended\n    // see https://developer.github.com/v3/#oauth2-token-sent-in-a-header\n    .replace(/\\baccess_token=\\w+/g, \"access_token=[REDACTED]\");\n    this.request = requestCopy;\n  }\n\n}\n\nexports.RequestError = RequestError;\n//# sourceMappingURL=index.js.map\n\n\n/***/ }),\n\n/***/ 6234:\n/***/ ((__unused_webpack_module, exports, __nccwpck_require__) => {\n\n\"use strict\";\n\n\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\n\nfunction _interopDefault (ex) { return (ex && (typeof ex === 'object') && 'default' in ex) ? ex['default'] : ex; }\n\nvar endpoint = __nccwpck_require__(9440);\nvar universalUserAgent = __nccwpck_require__(5030);\nvar isPlainObject = __nccwpck_require__(3287);\nvar nodeFetch = _interopDefault(__nccwpck_require__(467));\nvar requestError = __nccwpck_require__(537);\n\nconst VERSION = \"5.4.15\";\n\nfunction getBufferResponse(response) {\n  return response.arrayBuffer();\n}\n\nfunction fetchWrapper(requestOptions) {\n  if (isPlainObject.isPlainObject(requestOptions.body) || Array.isArray(requestOptions.body)) {\n    requestOptions.body = JSON.stringify(requestOptions.body);\n  }\n\n  let headers = {};\n  let status;\n  let url;\n  const fetch = requestOptions.request && requestOptions.request.fetch || nodeFetch;\n  return fetch(requestOptions.url, Object.assign({\n    method: requestOptions.method,\n    body: requestOptions.body,\n    headers: requestOptions.headers,\n    redirect: requestOptions.redirect\n  }, // `requestOptions.request.agent` type is incompatible\n  // see https://github.com/octokit/types.ts/pull/264\n  requestOptions.request)).then(response => {\n    url = response.url;\n    status = response.status;\n\n    for (const keyAndValue of response.headers) {\n      headers[keyAndValue[0]] = keyAndValue[1];\n    }\n\n    if (status === 204 || status === 205) {\n      return;\n    } // GitHub API returns 200 for HEAD requests\n\n\n    if (requestOptions.method === \"HEAD\") {\n      if (status < 400) {\n        return;\n      }\n\n      throw new requestError.RequestError(response.statusText, status, {\n        headers,\n        request: requestOptions\n      });\n    }\n\n    if (status === 304) {\n      throw new requestError.RequestError(\"Not modified\", status, {\n        headers,\n        request: requestOptions\n      });\n    }\n\n    if (status >= 400) {\n      return response.text().then(message => {\n        const error = new requestError.RequestError(message, status, {\n          headers,\n          request: requestOptions\n        });\n\n        try {\n          let responseBody = JSON.parse(error.message);\n          Object.assign(error, responseBody);\n          let errors = responseBody.errors; // Assumption `errors` would always be in Array format\n\n          error.message = error.message + \": \" + errors.map(JSON.stringify).join(\", \");\n        } catch (e) {// ignore, see octokit/rest.js#684\n        }\n\n        throw error;\n      });\n    }\n\n    const contentType = response.headers.get(\"content-type\");\n\n    if (/application\\/json/.test(contentType)) {\n      return response.json();\n    }\n\n    if (!contentType || /^text\\/|charset=utf-8$/.test(contentType)) {\n      return response.text();\n    }\n\n    return getBufferResponse(response);\n  }).then(data => {\n    return {\n      status,\n      url,\n      headers,\n      data\n    };\n  }).catch(error => {\n    if (error instanceof requestError.RequestError) {\n      throw error;\n    }\n\n    throw new requestError.RequestError(error.message, 500, {\n      headers,\n      request: requestOptions\n    });\n  });\n}\n\nfunction withDefaults(oldEndpoint, newDefaults) {\n  const endpoint = oldEndpoint.defaults(newDefaults);\n\n  const newApi = function (route, parameters) {\n    const endpointOptions = endpoint.merge(route, parameters);\n\n    if (!endpointOptions.request || !endpointOptions.request.hook) {\n      return fetchWrapper(endpoint.parse(endpointOptions));\n    }\n\n    const request = (route, parameters) => {\n      return fetchWrapper(endpoint.parse(endpoint.merge(route, parameters)));\n    };\n\n    Object.assign(request, {\n      endpoint,\n      defaults: withDefaults.bind(null, endpoint)\n    });\n    return endpointOptions.request.hook(request, endpointOptions);\n  };\n\n  return Object.assign(newApi, {\n    endpoint,\n    defaults: withDefaults.bind(null, endpoint)\n  });\n}\n\nconst request = withDefaults(endpoint.endpoint, {\n  headers: {\n    \"user-agent\": `octokit-request.js/${VERSION} ${universalUserAgent.getUserAgent()}`\n  }\n});\n\nexports.request = request;\n//# sourceMappingURL=index.js.map\n\n\n/***/ }),\n\n/***/ 6761:\n/***/ ((module, __unused_webpack_exports, __nccwpck_require__) => {\n\nconst Utils = __nccwpck_require__(5182);\r\nconst pth = __nccwpck_require__(5622);\r\nconst ZipEntry = __nccwpck_require__(4057);\r\nconst ZipFile = __nccwpck_require__(7744);\r\n\r\nconst fs = Utils.FileSystem.require();\r\nfs.existsSync = fs.existsSync || pth.existsSync;\r\n\r\nconst defaultOptions = {\r\n    // read entries during load (initial loading may be slower)\r\n    readEntries: false,\r\n    // default method is none\r\n    method: Utils.Constants.NONE\r\n}\r\n\r\nfunction canonical(p) {\r\n    // trick normalize think path is absolute\r\n    var safeSuffix = pth.posix.normalize(\"/\" + p.split(\"\\\\\").join(\"/\"));\r\n    return pth.join(\".\", safeSuffix);\r\n}\r\n\r\nmodule.exports = function (/**String*/input, /** object */options) {\r\n    let inBuffer = null;\r\n\r\n    // create object based default options, allowing them to be overwritten\r\n    const opts = Object.assign(Object.create( null ), defaultOptions);\r\n\r\n    // test input variable\r\n    if (input && \"object\" === typeof input){\r\n        // if value is not buffer we accept it to be object with options\r\n        if (!(input instanceof Uint8Array)){\r\n            Object.assign(opts, input);\r\n            input = opts.input ? opts.input : undefined;\r\n            if (opts.input) delete opts.input;\r\n        }\r\n\r\n        // if input is buffer\r\n        if (input instanceof Uint8Array){\r\n            inBuffer = input;\r\n            opts.method = Utils.Constants.BUFFER;\r\n            input = undefined;\r\n        }\r\n    }\r\n\r\n    // assign options\r\n    Object.assign(opts, options);\r\n\r\n    // if input is file name we retrieve its content\r\n    if (input && \"string\" === typeof input) {\r\n        // load zip file\r\n        if (fs.existsSync(input)) {\r\n            opts.method = Utils.Constants.FILE;\r\n            opts.filename = input;\r\n            inBuffer = fs.readFileSync(input);\r\n        } else {\r\n            throw new Error(Utils.Errors.INVALID_FILENAME);\r\n        }\r\n    }\r\n\r\n    // create variable\r\n    const _zip = new ZipFile(inBuffer, opts);\r\n\r\n    function sanitize(prefix, name) {\r\n        prefix = pth.resolve(pth.normalize(prefix));\r\n        var parts = name.split('/');\r\n        for (var i = 0, l = parts.length; i < l; i++) {\r\n            var path = pth.normalize(pth.join(prefix, parts.slice(i, l).join(pth.sep)));\r\n            if (path.indexOf(prefix) === 0) {\r\n                return path;\r\n            }\r\n        }\r\n        return pth.normalize(pth.join(prefix, pth.basename(name)));\r\n    }\r\n\r\n\tfunction getEntry(/**Object*/entry) {\r\n\t\tif (entry && _zip) {\r\n\t\t\tvar item;\r\n\t\t\t// If entry was given as a file name\r\n\t\t\tif (typeof entry === \"string\")\r\n\t\t\t\titem = _zip.getEntry(entry);\r\n\t\t\t// if entry was given as a ZipEntry object\r\n\t\t\tif (typeof entry === \"object\" && typeof entry.entryName !== \"undefined\" && typeof entry.header !== \"undefined\")\r\n\t\t\t\titem = _zip.getEntry(entry.entryName);\r\n\r\n\t\t\tif (item) {\r\n\t\t\t\treturn item;\r\n\t\t\t}\r\n\t\t}\r\n\t\treturn null;\r\n\t}\r\n\r\n    function fixPath(zipPath){\r\n        const { join, normalize, sep } = pth.posix;\r\n        // convert windows file separators and normalize\r\n        return join(\".\", normalize(sep + zipPath.split(\"\\\\\").join(sep) + sep));\r\n    }\r\n\r\n\treturn {\r\n\t\t/**\r\n\t\t * Extracts the given entry from the archive and returns the content as a Buffer object\r\n\t\t * @param entry ZipEntry object or String with the full path of the entry\r\n\t\t *\r\n\t\t * @return Buffer or Null in case of error\r\n\t\t */\r\n\t\treadFile: function (/**Object*/entry, /*String, Buffer*/pass) {\r\n\t\t\tvar item = getEntry(entry);\r\n\t\t\treturn item && item.getData(pass) || null;\r\n\t\t},\r\n\r\n\t\t/**\r\n\t\t * Asynchronous readFile\r\n\t\t * @param entry ZipEntry object or String with the full path of the entry\r\n\t\t * @param callback\r\n\t\t *\r\n\t\t * @return Buffer or Null in case of error\r\n\t\t */\r\n\t\treadFileAsync: function (/**Object*/entry, /**Function*/callback) {\r\n\t\t\tvar item = getEntry(entry);\r\n\t\t\tif (item) {\r\n\t\t\t\titem.getDataAsync(callback);\r\n\t\t\t} else {\r\n\t\t\t\tcallback(null, \"getEntry failed for:\" + entry)\r\n\t\t\t}\r\n\t\t},\r\n\r\n\t\t/**\r\n\t\t * Extracts the given entry from the archive and returns the content as plain text in the given encoding\r\n\t\t * @param entry ZipEntry object or String with the full path of the entry\r\n\t\t * @param encoding Optional. If no encoding is specified utf8 is used\r\n\t\t *\r\n\t\t * @return String\r\n\t\t */\r\n\t\treadAsText: function (/**Object*/entry, /**String=*/encoding) {\r\n\t\t\tvar item = getEntry(entry);\r\n\t\t\tif (item) {\r\n\t\t\t\tvar data = item.getData();\r\n\t\t\t\tif (data && data.length) {\r\n\t\t\t\t\treturn data.toString(encoding || \"utf8\");\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\treturn \"\";\r\n\t\t},\r\n\r\n\t\t/**\r\n\t\t * Asynchronous readAsText\r\n\t\t * @param entry ZipEntry object or String with the full path of the entry\r\n\t\t * @param callback\r\n\t\t * @param encoding Optional. If no encoding is specified utf8 is used\r\n\t\t *\r\n\t\t * @return String\r\n\t\t */\r\n\t\treadAsTextAsync: function (/**Object*/entry, /**Function*/callback, /**String=*/encoding) {\r\n\t\t\tvar item = getEntry(entry);\r\n\t\t\tif (item) {\r\n\t\t\t\titem.getDataAsync(function (data, err) {\r\n\t\t\t\t\tif (err) {\r\n\t\t\t\t\t\tcallback(data, err);\r\n\t\t\t\t\t\treturn;\r\n\t\t\t\t\t}\r\n\r\n\t\t\t\t\tif (data && data.length) {\r\n\t\t\t\t\t\tcallback(data.toString(encoding || \"utf8\"));\r\n\t\t\t\t\t} else {\r\n\t\t\t\t\t\tcallback(\"\");\r\n\t\t\t\t\t}\r\n\t\t\t\t})\r\n\t\t\t} else {\r\n\t\t\t\tcallback(\"\");\r\n\t\t\t}\r\n\t\t},\r\n\r\n\t\t/**\r\n\t\t * Remove the entry from the file or the entry and all it's nested directories and files if the given entry is a directory\r\n\t\t *\r\n\t\t * @param entry\r\n\t\t */\r\n\t\tdeleteFile: function (/**Object*/entry) { // @TODO: test deleteFile\r\n\t\t\tvar item = getEntry(entry);\r\n\t\t\tif (item) {\r\n\t\t\t\t_zip.deleteEntry(item.entryName);\r\n\t\t\t}\r\n\t\t},\r\n\r\n\t\t/**\r\n\t\t * Adds a comment to the zip. The zip must be rewritten after adding the comment.\r\n\t\t *\r\n\t\t * @param comment\r\n\t\t */\r\n\t\taddZipComment: function (/**String*/comment) { // @TODO: test addZipComment\r\n\t\t\t_zip.comment = comment;\r\n\t\t},\r\n\r\n\t\t/**\r\n\t\t * Returns the zip comment\r\n\t\t *\r\n\t\t * @return String\r\n\t\t */\r\n\t\tgetZipComment: function () {\r\n\t\t\treturn _zip.comment || '';\r\n\t\t},\r\n\r\n\t\t/**\r\n\t\t * Adds a comment to a specified zipEntry. The zip must be rewritten after adding the comment\r\n\t\t * The comment cannot exceed 65535 characters in length\r\n\t\t *\r\n\t\t * @param entry\r\n\t\t * @param comment\r\n\t\t */\r\n\t\taddZipEntryComment: function (/**Object*/entry, /**String*/comment) {\r\n\t\t\tvar item = getEntry(entry);\r\n\t\t\tif (item) {\r\n\t\t\t\titem.comment = comment;\r\n\t\t\t}\r\n\t\t},\r\n\r\n\t\t/**\r\n\t\t * Returns the comment of the specified entry\r\n\t\t *\r\n\t\t * @param entry\r\n\t\t * @return String\r\n\t\t */\r\n\t\tgetZipEntryComment: function (/**Object*/entry) {\r\n\t\t\tvar item = getEntry(entry);\r\n\t\t\tif (item) {\r\n\t\t\t\treturn item.comment || '';\r\n\t\t\t}\r\n\t\t\treturn ''\r\n\t\t},\r\n\r\n\t\t/**\r\n\t\t * Updates the content of an existing entry inside the archive. The zip must be rewritten after updating the content\r\n\t\t *\r\n\t\t * @param entry\r\n\t\t * @param content\r\n\t\t */\r\n\t\tupdateFile: function (/**Object*/entry, /**Buffer*/content) {\r\n\t\t\tvar item = getEntry(entry);\r\n\t\t\tif (item) {\r\n\t\t\t\titem.setData(content);\r\n\t\t\t}\r\n\t\t},\r\n\r\n\t\t/**\r\n\t\t * Adds a file from the disk to the archive\r\n\t\t *\r\n\t\t * @param localPath File to add to zip\r\n\t\t * @param zipPath Optional path inside the zip\r\n\t\t * @param zipName Optional name for the file\r\n\t\t */\r\n\t\taddLocalFile: function (/**String*/localPath, /**String=*/zipPath, /**String=*/zipName, /**String*/comment) {\r\n\t\t\tif (fs.existsSync(localPath)) {\r\n\t\t\t\t// fix ZipPath\r\n\t\t\t\tzipPath = (zipPath) ? fixPath(zipPath) : \"\";\r\n\r\n\t\t\t\t// p - local file name\r\n\t\t\t\tvar p = localPath.split(\"\\\\\").join(\"/\").split(\"/\").pop();\r\n\r\n\t\t\t\t// add file name into zippath\r\n\t\t\t\tzipPath += (zipName) ? zipName : p;\r\n\r\n\t\t\t\t// read file attributes\r\n\t\t\t\tconst _attr = fs.statSync(localPath);\r\n\r\n\t\t\t\t// add file into zip file\r\n\t\t\t\tthis.addFile(zipPath, fs.readFileSync(localPath), comment, _attr)\r\n\t\t\t} else {\r\n\t\t\t\tthrow new Error(Utils.Errors.FILE_NOT_FOUND.replace(\"%s\", localPath));\r\n\t\t\t}\r\n\t\t},\r\n\r\n\t\t/**\r\n\t\t * Adds a local directory and all its nested files and directories to the archive\r\n\t\t *\r\n\t\t * @param localPath\r\n\t\t * @param zipPath optional path inside zip\r\n\t\t * @param filter optional RegExp or Function if files match will\r\n\t\t *               be included.\r\n\t\t */\r\n        addLocalFolder: function (/**String*/localPath, /**String=*/zipPath, /**=RegExp|Function*/filter) {\r\n            // Prepare filter\r\n            if (filter instanceof RegExp) {                 // if filter is RegExp wrap it\r\n                filter = (function (rx){\r\n                    return function (filename) {\r\n                        return rx.test(filename);\r\n                    }\r\n                })(filter);\r\n            } else if ('function' !== typeof filter) {       // if filter is not function we will replace it\r\n                filter = function () {\r\n                    return true;\r\n                };\r\n            }\r\n\r\n            // fix ZipPath\r\n            zipPath = (zipPath) ? fixPath(zipPath) : \"\";\r\n\r\n            // normalize the path first\r\n            localPath = pth.normalize(localPath);\r\n\r\n            if (fs.existsSync(localPath)) {\r\n\r\n                var items = Utils.findFiles(localPath),\r\n                    self = this;\r\n\r\n                if (items.length) {\r\n                    items.forEach(function (filepath) {\r\n                        var p = pth.relative(localPath, filepath).split(\"\\\\\").join(\"/\"); //windows fix\r\n                        if (filter(p)) {\r\n                            var stats = fs.statSync(filepath);\r\n                            if (stats.isFile()) {\r\n                                self.addFile(zipPath + p, fs.readFileSync(filepath), \"\", stats);\r\n                            } else {\r\n                                self.addFile(zipPath + p + '/', Buffer.alloc(0), \"\", stats);\r\n                            }\r\n                        }\r\n                    });\r\n                }\r\n            } else {\r\n                throw new Error(Utils.Errors.FILE_NOT_FOUND.replace(\"%s\", localPath));\r\n            }\r\n        },\r\n\r\n\t\t/**\r\n\t\t * Asynchronous addLocalFile\r\n\t\t * @param localPath\r\n\t\t * @param callback\r\n\t\t * @param zipPath optional path inside zip\r\n\t\t * @param filter optional RegExp or Function if files match will\r\n\t\t *               be included.\r\n\t\t */\r\n        addLocalFolderAsync: function (/*String*/localPath, /*Function*/callback, /*String*/zipPath, /*RegExp|Function*/filter) {\r\n            if (filter instanceof RegExp) {\r\n                filter = (function (rx) {\r\n                    return function (filename) {\r\n                        return rx.test(filename);\r\n                    };\r\n                })(filter);\r\n            } else if (\"function\" !== typeof filter) {\r\n                filter = function () {\r\n                    return true;\r\n                };\r\n            }\r\n\r\n            // fix ZipPath\r\n            zipPath = zipPath ? fixPath(zipPath) : \"\";\r\n\r\n            // normalize the path first\r\n            localPath = pth.normalize(localPath);\r\n\r\n            var self = this;\r\n            fs.open(localPath, 'r', function (err) {\r\n                if (err && err.code === 'ENOENT') {\r\n                    callback(undefined, Utils.Errors.FILE_NOT_FOUND.replace(\"%s\", localPath));\r\n                } else if (err) {\r\n                    callback(undefined, err);\r\n                } else {\r\n                    var items = Utils.findFiles(localPath);\r\n                    var i = -1;\r\n\r\n                    var next = function () {\r\n                        i += 1;\r\n                        if (i < items.length) {\r\n                            var filepath = items[i];\r\n                            var p = pth.relative(localPath, filepath).split(\"\\\\\").join(\"/\"); //windows fix\r\n                            p = p.normalize('NFD').replace(/[\\u0300-\\u036f]/g, '').replace(/[^\\x20-\\x7E]/g, '') // accent fix\r\n                            if (filter(p)) {\r\n                                fs.stat(filepath, function (er0, stats) {\r\n                                    if (er0) callback(undefined, er0);\r\n                                    if (stats.isFile()) {\r\n                                        fs.readFile(filepath, function (er1, data) {\r\n                                            if (er1) {\r\n                                                callback(undefined, er1);\r\n                                            } else {\r\n                                                self.addFile(zipPath + p, data, \"\", stats);\r\n                                                next();\r\n                                            }\r\n                                        });\r\n                                    } else {\r\n                                        self.addFile(zipPath + p + \"/\", Buffer.alloc(0), \"\", stats);\r\n                                        next();\r\n                                    }\r\n                                });\r\n                            } else {\r\n                                next();\r\n                            }\r\n\r\n                        } else {\r\n                            callback(true, undefined);\r\n                        }\r\n                    }\r\n\r\n                    next();\r\n                }\r\n            });\r\n        },\r\n\r\n        addLocalFolderPromise: function (/*String*/ localPath, /* object */ options) {\r\n            return new Promise((resolve, reject) => {\r\n                const { filter, zipPath } = Object.assign({}, options);\r\n                this.addLocalFolderAsync(localPath,\r\n                    (done, err) => {\r\n                        if (err) reject(err);\r\n                        if (done) resolve(this);\r\n                    }, zipPath, filter\r\n                );\r\n            });\r\n        },\r\n\r\n        /**\r\n         * Allows you to create a entry (file or directory) in the zip file.\r\n         * If you want to create a directory the entryName must end in / and a null buffer should be provided.\r\n         * Comment and attributes are optional\r\n         *\r\n         * @param {string} entryName\r\n         * @param {Buffer | string} content - file content as buffer or utf8 coded string\r\n         * @param {string} comment - file comment\r\n         * @param {number | object} attr - number as unix file permissions, object as filesystem Stats object\r\n         */\r\n        addFile: function (/**String*/ entryName, /**Buffer*/ content, /**String*/ comment, /**Number*/ attr) {\r\n            let entry = getEntry(entryName);\r\n            const update = entry != null;\r\n\r\n            // prepare new entry\r\n            if (!update){\r\n                entry = new ZipEntry();\r\n                entry.entryName = entryName;\r\n            }\r\n            entry.comment = comment || \"\";\r\n\r\n            const isStat = ('object' === typeof attr) && (attr instanceof fs.Stats);\r\n\r\n            // last modification time from file stats\r\n            if (isStat){\r\n                entry.header.time = attr.mtime;\r\n            }\r\n\r\n            // Set file attribute\r\n            var fileattr = (entry.isDirectory) ? 0x10 : 0;  // (MS-DOS directory flag)\r\n\r\n            // extended attributes field for Unix\r\n            if('win32' !== process.platform){\r\n                // set file type either S_IFDIR / S_IFREG\r\n                let unix = (entry.isDirectory) ? 0x4000 : 0x8000;\r\n\r\n                if (isStat) {                                       // File attributes from file stats\r\n                    unix |= (0xfff & attr.mode);\r\n                }else if ('number' === typeof attr){                // attr from given attr values\r\n                    unix |= (0xfff & attr);\r\n                }else{                                              // Default values:\r\n                    unix |= (entry.isDirectory) ? 0o755 : 0o644;    // permissions (drwxr-xr-x) or (-r-wr--r--)\r\n                }\r\n\r\n                fileattr = (fileattr | (unix << 16)) >>> 0;         // add attributes\r\n            }\r\n\r\n            entry.attr = fileattr;\r\n\r\n            entry.setData(content);\r\n            if (!update) _zip.setEntry(entry);\r\n        },\r\n\r\n\t\t/**\r\n\t\t * Returns an array of ZipEntry objects representing the files and folders inside the archive\r\n\t\t *\r\n\t\t * @return Array\r\n\t\t */\r\n\t\tgetEntries: function () {\r\n\t\t\tif (_zip) {\r\n\t\t\t\treturn _zip.entries;\r\n\t\t\t} else {\r\n\t\t\t\treturn [];\r\n\t\t\t}\r\n\t\t},\r\n\r\n\t\t/**\r\n\t\t * Returns a ZipEntry object representing the file or folder specified by ``name``.\r\n\t\t *\r\n\t\t * @param name\r\n\t\t * @return ZipEntry\r\n\t\t */\r\n\t\tgetEntry: function (/**String*/name) {\r\n\t\t\treturn getEntry(name);\r\n\t\t},\r\n\r\n\t\tgetEntryCount: function() {\r\n\t\t\treturn _zip.getEntryCount();\r\n\t\t},\r\n\r\n\t\tforEach: function(callback) {\r\n\t\t\treturn _zip.forEach(callback);\r\n\t\t},\r\n\r\n\t\t/**\r\n\t\t * Extracts the given entry to the given targetPath\r\n\t\t * If the entry is a directory inside the archive, the entire directory and it's subdirectories will be extracted\r\n\t\t *\r\n\t\t * @param entry ZipEntry object or String with the full path of the entry\r\n\t\t * @param targetPath Target folder where to write the file\r\n\t\t * @param maintainEntryPath If maintainEntryPath is true and the entry is inside a folder, the entry folder\r\n\t\t *                          will be created in targetPath as well. Default is TRUE\r\n\t\t * @param overwrite If the file already exists at the target path, the file will be overwriten if this is true.\r\n\t\t *                  Default is FALSE\r\n         * @param outFileName String If set will override the filename of the extracted file (Only works if the entry is a file)\r\n\t\t *\r\n\t\t * @return Boolean\r\n\t\t */\r\n\t\textractEntryTo: function (/**Object*/entry, /**String*/targetPath, /**Boolean*/maintainEntryPath, /**Boolean*/overwrite, /**String**/outFileName) {\r\n\t\t\toverwrite = overwrite || false;\r\n\t\t\tmaintainEntryPath = typeof maintainEntryPath === \"undefined\" ? true : maintainEntryPath;\r\n\r\n\t\t\tvar item = getEntry(entry);\r\n\t\t\tif (!item) {\r\n\t\t\t\tthrow new Error(Utils.Errors.NO_ENTRY);\r\n\t\t\t}\r\n\r\n\t\t\tvar entryName = canonical(item.entryName);\r\n\r\n\t\t\tvar target = sanitize(targetPath,outFileName && !item.isDirectory ? outFileName : (maintainEntryPath ? entryName : pth.basename(entryName)));\r\n\r\n\t\t\tif (item.isDirectory) {\r\n\t\t\t\ttarget = pth.resolve(target, \"..\");\r\n\t\t\t\tvar children = _zip.getEntryChildren(item);\r\n\t\t\t\tchildren.forEach(function (child) {\r\n\t\t\t\t\tif (child.isDirectory) return;\r\n\t\t\t\t\tvar content = child.getData();\r\n\t\t\t\t\tif (!content) {\r\n\t\t\t\t\t\tthrow new Error(Utils.Errors.CANT_EXTRACT_FILE);\r\n\t\t\t\t\t}\r\n\t\t\t\t\tvar name = canonical(child.entryName)\r\n\t\t\t\t\tvar childName = sanitize(targetPath, maintainEntryPath ? name : pth.basename(name));\r\n\t\t\t\t\t// The reverse operation for attr depend on method addFile()\r\n\t\t\t\t\tvar fileAttr = child.attr ? (((child.attr >>> 0) | 0) >> 16) & 0xfff : 0;\r\n\t\t\t\t\tUtils.writeFileTo(childName, content, overwrite, fileAttr);\r\n\t\t\t\t});\r\n\t\t\t\treturn true;\r\n\t\t\t}\r\n\r\n\t\t\tvar content = item.getData();\r\n\t\t\tif (!content) throw new Error(Utils.Errors.CANT_EXTRACT_FILE);\r\n\r\n\t\t\tif (fs.existsSync(target) && !overwrite) {\r\n\t\t\t\tthrow new Error(Utils.Errors.CANT_OVERRIDE);\r\n\t\t\t}\r\n\t\t\t// The reverse operation for attr depend on method addFile()\r\n\t\t\tvar fileAttr = item.attr ? (((item.attr >>> 0) | 0) >> 16) & 0xfff : 0;\r\n\t\t\tUtils.writeFileTo(target, content, overwrite, fileAttr);\r\n\r\n\t\t\treturn true;\r\n\t\t},\r\n\r\n\t\t/**\r\n\t\t * Test the archive\r\n\t\t *\r\n\t\t */\r\n\t\ttest: function (pass) {\r\n\t\t\tif (!_zip) {\r\n\t\t\t\treturn false;\r\n\t\t\t}\r\n\r\n\t\t\tfor (var entry in _zip.entries) {\r\n\t\t\t\ttry {\r\n\t\t\t\t\tif (entry.isDirectory) {\r\n\t\t\t\t\t\tcontinue;\r\n\t\t\t\t\t}\r\n\t\t\t\t\tvar content = _zip.entries[entry].getData(pass);\r\n\t\t\t\t\tif (!content) {\r\n\t\t\t\t\t\treturn false;\r\n\t\t\t\t\t}\r\n\t\t\t\t} catch (err) {\r\n\t\t\t\t\treturn false;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\treturn true;\r\n\t\t},\r\n\r\n\t\t/**\r\n\t\t * Extracts the entire archive to the given location\r\n\t\t *\r\n\t\t * @param targetPath Target location\r\n\t\t * @param overwrite If the file already exists at the target path, the file will be overwriten if this is true.\r\n\t\t *                  Default is FALSE\r\n\t\t */\r\n\t\textractAllTo: function (/**String*/targetPath, /**Boolean*/overwrite, /*String, Buffer*/pass) {\r\n\t\t\toverwrite = overwrite || false;\r\n\t\t\tif (!_zip) {\r\n\t\t\t\tthrow new Error(Utils.Errors.NO_ZIP);\r\n\t\t\t}\r\n\t\t\t_zip.entries.forEach(function (entry) {\r\n\t\t\t\tvar entryName = sanitize(targetPath, canonical(entry.entryName.toString()));\r\n\t\t\t\tif (entry.isDirectory) {\r\n\t\t\t\t\tUtils.makeDir(entryName);\r\n\t\t\t\t\treturn;\r\n\t\t\t\t}\r\n\t\t\t\tvar content = entry.getData(pass);\r\n\t\t\t\tif (!content) {\r\n\t\t\t\t\tthrow new Error(Utils.Errors.CANT_EXTRACT_FILE);\r\n\t\t\t\t}\r\n\t\t\t\t// The reverse operation for attr depend on method addFile()\r\n\t\t\t\tvar fileAttr = entry.attr ? (((entry.attr >>> 0) | 0) >> 16) & 0xfff : 0;\r\n\t\t\t\tUtils.writeFileTo(entryName, content, overwrite, fileAttr);\r\n\t\t\t\ttry {\r\n\t\t\t\t\tfs.utimesSync(entryName, entry.header.time, entry.header.time)\r\n\t\t\t\t} catch (err) {\r\n\t\t\t\t\tthrow new Error(Utils.Errors.CANT_EXTRACT_FILE);\r\n\t\t\t\t}\r\n\t\t\t})\r\n\t\t},\r\n\r\n\t\t/**\r\n\t\t * Asynchronous extractAllTo\r\n\t\t *\r\n\t\t * @param targetPath Target location\r\n\t\t * @param overwrite If the file already exists at the target path, the file will be overwriten if this is true.\r\n\t\t *                  Default is FALSE\r\n\t\t * @param callback\r\n\t\t */\r\n\t\textractAllToAsync: function (/**String*/targetPath, /**Boolean*/overwrite, /**Function*/callback) {\r\n\t\t\tif (!callback) {\r\n\t\t\t\tcallback = function() {}\r\n\t\t\t}\r\n\t\t\toverwrite = overwrite || false;\r\n\t\t\tif (!_zip) {\r\n\t\t\t\tcallback(new Error(Utils.Errors.NO_ZIP));\r\n\t\t\t\treturn;\r\n\t\t\t}\r\n\r\n\t\t\tvar entries = _zip.entries;\r\n\t\t\tvar i = entries.length;\r\n\t\t\tentries.forEach(function (entry) {\r\n\t\t\t\tif (i <= 0) return; // Had an error already\r\n\r\n\t\t\t\tvar entryName = pth.normalize(canonical(entry.entryName.toString()));\r\n\r\n\t\t\t\tif (entry.isDirectory) {\r\n\t\t\t\t\tUtils.makeDir(sanitize(targetPath, entryName));\r\n\t\t\t\t\tif (--i === 0)\r\n\t\t\t\t\t\tcallback(undefined);\r\n\t\t\t\t\treturn;\r\n\t\t\t\t}\r\n\t\t\t\tentry.getDataAsync(function (content, err) {\r\n\t\t\t\t\tif (i <= 0) return;\r\n\t\t\t\t\tif (err) {\r\n\t\t\t\t\t\tcallback(new Error(err));\r\n\t\t\t\t\t\treturn;\r\n\t\t\t\t\t}\r\n\t\t\t\t\tif (!content) {\r\n\t\t\t\t\t\ti = 0;\r\n\t\t\t\t\t\tcallback(new Error(Utils.Errors.CANT_EXTRACT_FILE));\r\n\t\t\t\t\t\treturn;\r\n\t\t\t\t\t}\r\n\r\n\t\t\t\t\t// The reverse operation for attr depend on method addFile()\r\n\t\t\t\t\tvar fileAttr = entry.attr ? (((entry.attr >>> 0) | 0) >> 16) & 0xfff : 0;\r\n\t\t\t\t\tUtils.writeFileToAsync(sanitize(targetPath, entryName), content, overwrite, fileAttr, function (succ) {\r\n\t\t\t\t\t\ttry {\r\n\t\t\t\t\t\t\tfs.utimesSync(pth.resolve(targetPath, entryName), entry.header.time, entry.header.time);\r\n\t\t\t\t\t\t} catch (err) {\r\n\t\t\t\t\t\t\tcallback(new Error('Unable to set utimes'));\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t\tif (i <= 0) return;\r\n\t\t\t\t\t\tif (!succ) {\r\n\t\t\t\t\t\t\ti = 0;\r\n\t\t\t\t\t\t\tcallback(new Error('Unable to write'));\r\n\t\t\t\t\t\t\treturn;\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t\tif (--i === 0)\r\n\t\t\t\t\t\t\tcallback(undefined);\r\n\t\t\t\t\t});\r\n\t\t\t\t});\r\n\t\t\t})\r\n\t\t},\r\n\r\n\t\t/**\r\n\t\t * Writes the newly created zip file to disk at the specified location or if a zip was opened and no ``targetFileName`` is provided, it will overwrite the opened zip\r\n\t\t *\r\n\t\t * @param targetFileName\r\n\t\t * @param callback\r\n\t\t */\r\n\t\twriteZip: function (/**String*/targetFileName, /**Function*/callback) {\r\n\t\t\tif (arguments.length === 1) {\r\n\t\t\t\tif (typeof targetFileName === \"function\") {\r\n\t\t\t\t\tcallback = targetFileName;\r\n\t\t\t\t\ttargetFileName = \"\";\r\n\t\t\t\t}\r\n\t\t\t}\r\n\r\n\t\t\tif (!targetFileName && opts.filename) {\r\n\t\t\t\ttargetFileName = opts.filename;\r\n\t\t\t}\r\n\t\t\tif (!targetFileName) return;\r\n\r\n\t\t\tvar zipData = _zip.compressToBuffer();\r\n\t\t\tif (zipData) {\r\n\t\t\t\tvar ok = Utils.writeFileTo(targetFileName, zipData, true);\r\n\t\t\t\tif (typeof callback === 'function') callback(!ok ? new Error(\"failed\") : null, \"\");\r\n\t\t\t}\r\n\t\t},\r\n\r\n        writeZipPromise: function (/**String*/ targetFileName, /* object */ options) {\r\n            const { overwrite, perm } = Object.assign({ overwrite: true }, options);\r\n\r\n            return new Promise((resolve, reject) => {\r\n                // find file name\r\n                if (!targetFileName && opts.filename) targetFileName = opts.filename;\r\n                if (!targetFileName) reject(\"ADM-ZIP: ZIP File Name Missing\");\r\n\r\n                this.toBufferPromise().then((zipData) => {\r\n                    const ret = (done) => (done ? resolve(done) : reject(\"ADM-ZIP: Wasn't able to write zip file\"));\r\n                    Utils.writeFileToAsync(targetFileName, zipData, overwrite, perm, ret);\r\n                }, reject);\r\n            });\r\n        },\r\n\r\n        toBufferPromise: function () {\r\n            return new Promise((resolve, reject) => {\r\n                _zip.toAsyncBuffer(resolve, reject);\r\n            });\r\n        },\r\n\r\n\t\t/**\r\n\t\t * Returns the content of the entire zip file as a Buffer object\r\n\t\t *\r\n\t\t * @return Buffer\r\n\t\t */\r\n\t\ttoBuffer: function (/**Function=*/onSuccess, /**Function=*/onFail, /**Function=*/onItemStart, /**Function=*/onItemEnd) {\r\n\t\t\tthis.valueOf = 2;\r\n\t\t\tif (typeof onSuccess === \"function\") {\r\n\t\t\t\t_zip.toAsyncBuffer(onSuccess, onFail, onItemStart, onItemEnd);\r\n\t\t\t\treturn null;\r\n\t\t\t}\r\n\t\t\treturn _zip.compressToBuffer()\r\n\t\t}\r\n\t}\r\n};\r\n\n\n/***/ }),\n\n/***/ 9032:\n/***/ ((module, __unused_webpack_exports, __nccwpck_require__) => {\n\nvar Utils = __nccwpck_require__(5182),\r\n    Constants = Utils.Constants;\r\n\r\n/* The central directory file header */\r\nmodule.exports = function () {\r\n    var _verMade = 0x14,\r\n        _version = 0x0A,\r\n        _flags = 0,\r\n        _method = 0,\r\n        _time = 0,\r\n        _crc = 0,\r\n        _compressedSize = 0,\r\n        _size = 0,\r\n        _fnameLen = 0,\r\n        _extraLen = 0,\r\n\r\n        _comLen = 0,\r\n        _diskStart = 0,\r\n        _inattr = 0,\r\n        _attr = 0,\r\n        _offset = 0;\r\n\r\n    switch(process.platform){\r\n        case 'win32':\r\n            _verMade |= 0x0A00;\r\n        default:\r\n            _verMade |= 0x0300;\r\n    }\r\n\r\n    var _dataHeader = {};\r\n\r\n    function setTime(val) {\r\n        val = new Date(val);\r\n        _time = (val.getFullYear() - 1980 & 0x7f) << 25  // b09-16 years from 1980\r\n            | (val.getMonth() + 1) << 21                 // b05-08 month\r\n            | val.getDate() << 16                        // b00-04 hour\r\n\r\n            // 2 bytes time\r\n            | val.getHours() << 11    // b11-15 hour\r\n            | val.getMinutes() << 5   // b05-10 minute\r\n            | val.getSeconds() >> 1;  // b00-04 seconds divided by 2\r\n    }\r\n\r\n    setTime(+new Date());\r\n\r\n    return {\r\n        get made () { return _verMade; },\r\n        set made (val) { _verMade = val; },\r\n\r\n        get version () { return _version; },\r\n        set version (val) { _version = val },\r\n\r\n        get flags () { return _flags },\r\n        set flags (val) { _flags = val; },\r\n\r\n        get method () { return _method; },\r\n        set method (val) {\r\n            switch (val){\r\n                case Constants.STORED:\r\n                    this.version = 10;\r\n                case Constants.DEFLATED:\r\n                default:\r\n                    this.version = 20;\r\n            }\r\n            _method = val;\r\n            },\r\n\r\n        get time () { return new Date(\r\n            ((_time >> 25) & 0x7f) + 1980,\r\n            ((_time >> 21) & 0x0f) - 1,\r\n            (_time >> 16) & 0x1f,\r\n            (_time >> 11) & 0x1f,\r\n            (_time >> 5) & 0x3f,\r\n            (_time & 0x1f) << 1\r\n        );\r\n        },\r\n        set time (val) {\r\n            setTime(val);\r\n        },\r\n\r\n        get crc () { return _crc; },\r\n        set crc (val) { _crc = val; },\r\n\r\n        get compressedSize () { return _compressedSize; },\r\n        set compressedSize (val) { _compressedSize = val; },\r\n\r\n        get size () { return _size; },\r\n        set size (val) { _size = val; },\r\n\r\n        get fileNameLength () { return _fnameLen; },\r\n        set fileNameLength (val) { _fnameLen = val; },\r\n\r\n        get extraLength () { return _extraLen },\r\n        set extraLength (val) { _extraLen = val; },\r\n\r\n        get commentLength () { return _comLen },\r\n        set commentLength (val) { _comLen = val },\r\n\r\n        get diskNumStart () { return _diskStart },\r\n        set diskNumStart (val) { _diskStart = val },\r\n\r\n        get inAttr () { return _inattr },\r\n        set inAttr (val) { _inattr = val },\r\n\r\n        get attr () { return _attr },\r\n        set attr (val) { _attr = val },\r\n\r\n        get offset () { return _offset },\r\n        set offset (val) { _offset = val },\r\n\r\n        get encripted () { return (_flags & 1) === 1 },\r\n\r\n        get entryHeaderSize () {\r\n            return Constants.CENHDR + _fnameLen + _extraLen + _comLen;\r\n        },\r\n\r\n        get realDataOffset () {\r\n            return _offset + Constants.LOCHDR + _dataHeader.fnameLen + _dataHeader.extraLen;\r\n        },\r\n\r\n        get dataHeader () {\r\n            return _dataHeader;\r\n        },\r\n\r\n        loadDataHeaderFromBinary : function(/*Buffer*/input) {\r\n            var data = input.slice(_offset, _offset + Constants.LOCHDR);\r\n            // 30 bytes and should start with \"PK\\003\\004\"\r\n            if (data.readUInt32LE(0) !== Constants.LOCSIG) {\r\n                throw new Error(Utils.Errors.INVALID_LOC);\r\n            }\r\n            _dataHeader = {\r\n                // version needed to extract\r\n                version : data.readUInt16LE(Constants.LOCVER),\r\n                // general purpose bit flag\r\n                flags : data.readUInt16LE(Constants.LOCFLG),\r\n                // compression method\r\n                method : data.readUInt16LE(Constants.LOCHOW),\r\n                // modification time (2 bytes time, 2 bytes date)\r\n                time : data.readUInt32LE(Constants.LOCTIM),\r\n                // uncompressed file crc-32 value\r\n                crc : data.readUInt32LE(Constants.LOCCRC),\r\n                // compressed size\r\n                compressedSize : data.readUInt32LE(Constants.LOCSIZ),\r\n                // uncompressed size\r\n                size : data.readUInt32LE(Constants.LOCLEN),\r\n                // filename length\r\n                fnameLen : data.readUInt16LE(Constants.LOCNAM),\r\n                // extra field length\r\n                extraLen : data.readUInt16LE(Constants.LOCEXT)\r\n            }\r\n        },\r\n\r\n        loadFromBinary : function(/*Buffer*/data) {\r\n            // data should be 46 bytes and start with \"PK 01 02\"\r\n            if (data.length !== Constants.CENHDR || data.readUInt32LE(0) !== Constants.CENSIG) {\r\n                throw new Error(Utils.Errors.INVALID_CEN);\r\n            }\r\n            // version made by\r\n            _verMade = data.readUInt16LE(Constants.CENVEM);\r\n            // version needed to extract\r\n            _version = data.readUInt16LE(Constants.CENVER);\r\n            // encrypt, decrypt flags\r\n            _flags = data.readUInt16LE(Constants.CENFLG);\r\n            // compression method\r\n            _method = data.readUInt16LE(Constants.CENHOW);\r\n            // modification time (2 bytes time, 2 bytes date)\r\n            _time = data.readUInt32LE(Constants.CENTIM);\r\n            // uncompressed file crc-32 value\r\n            _crc = data.readUInt32LE(Constants.CENCRC);\r\n            // compressed size\r\n            _compressedSize = data.readUInt32LE(Constants.CENSIZ);\r\n            // uncompressed size\r\n            _size = data.readUInt32LE(Constants.CENLEN);\r\n            // filename length\r\n            _fnameLen = data.readUInt16LE(Constants.CENNAM);\r\n            // extra field length\r\n            _extraLen = data.readUInt16LE(Constants.CENEXT);\r\n            // file comment length\r\n            _comLen = data.readUInt16LE(Constants.CENCOM);\r\n            // volume number start\r\n            _diskStart = data.readUInt16LE(Constants.CENDSK);\r\n            // internal file attributes\r\n            _inattr = data.readUInt16LE(Constants.CENATT);\r\n            // external file attributes\r\n            _attr = data.readUInt32LE(Constants.CENATX);\r\n            // LOC header offset\r\n            _offset = data.readUInt32LE(Constants.CENOFF);\r\n        },\r\n\r\n        dataHeaderToBinary : function() {\r\n            // LOC header size (30 bytes)\r\n            var data = Buffer.alloc(Constants.LOCHDR);\r\n            // \"PK\\003\\004\"\r\n            data.writeUInt32LE(Constants.LOCSIG, 0);\r\n            // version needed to extract\r\n            data.writeUInt16LE(_version, Constants.LOCVER);\r\n            // general purpose bit flag\r\n            data.writeUInt16LE(_flags, Constants.LOCFLG);\r\n            // compression method\r\n            data.writeUInt16LE(_method, Constants.LOCHOW);\r\n            // modification time (2 bytes time, 2 bytes date)\r\n            data.writeUInt32LE(_time, Constants.LOCTIM);\r\n            // uncompressed file crc-32 value\r\n            data.writeUInt32LE(_crc, Constants.LOCCRC);\r\n            // compressed size\r\n            data.writeUInt32LE(_compressedSize, Constants.LOCSIZ);\r\n            // uncompressed size\r\n            data.writeUInt32LE(_size, Constants.LOCLEN);\r\n            // filename length\r\n            data.writeUInt16LE(_fnameLen, Constants.LOCNAM);\r\n            // extra field length\r\n            data.writeUInt16LE(_extraLen, Constants.LOCEXT);\r\n            return data;\r\n        },\r\n\r\n        entryHeaderToBinary : function() {\r\n            // CEN header size (46 bytes)\r\n            var data = Buffer.alloc(Constants.CENHDR + _fnameLen + _extraLen + _comLen);\r\n            // \"PK\\001\\002\"\r\n            data.writeUInt32LE(Constants.CENSIG, 0);\r\n            // version made by\r\n            data.writeUInt16LE(_verMade, Constants.CENVEM);\r\n            // version needed to extract\r\n            data.writeUInt16LE(_version, Constants.CENVER);\r\n            // encrypt, decrypt flags\r\n            data.writeUInt16LE(_flags, Constants.CENFLG);\r\n            // compression method\r\n            data.writeUInt16LE(_method, Constants.CENHOW);\r\n            // modification time (2 bytes time, 2 bytes date)\r\n            data.writeUInt32LE(_time, Constants.CENTIM);\r\n            // uncompressed file crc-32 value\r\n            data.writeUInt32LE(_crc, Constants.CENCRC);\r\n            // compressed size\r\n            data.writeUInt32LE(_compressedSize, Constants.CENSIZ);\r\n            // uncompressed size\r\n            data.writeUInt32LE(_size, Constants.CENLEN);\r\n            // filename length\r\n            data.writeUInt16LE(_fnameLen, Constants.CENNAM);\r\n            // extra field length\r\n            data.writeUInt16LE(_extraLen, Constants.CENEXT);\r\n            // file comment length\r\n            data.writeUInt16LE(_comLen, Constants.CENCOM);\r\n            // volume number start\r\n            data.writeUInt16LE(_diskStart, Constants.CENDSK);\r\n            // internal file attributes\r\n            data.writeUInt16LE(_inattr, Constants.CENATT);\r\n            // external file attributes\r\n            data.writeUInt32LE(_attr, Constants.CENATX);\r\n            // LOC header offset\r\n            data.writeUInt32LE(_offset, Constants.CENOFF);\r\n            // fill all with\r\n            data.fill(0x00, Constants.CENHDR);\r\n            return data;\r\n        },\r\n\r\n        toString : function() {\r\n            return '{\\n' +\r\n                '\\t\"made\" : ' + _verMade + \",\\n\" +\r\n                '\\t\"version\" : ' + _version + \",\\n\" +\r\n                '\\t\"flags\" : ' + _flags + \",\\n\" +\r\n                '\\t\"method\" : ' + Utils.methodToString(_method) + \",\\n\" +\r\n                '\\t\"time\" : ' + this.time + \",\\n\" +\r\n                '\\t\"crc\" : 0x' + _crc.toString(16).toUpperCase() + \",\\n\" +\r\n                '\\t\"compressedSize\" : ' + _compressedSize + \" bytes,\\n\" +\r\n                '\\t\"size\" : ' + _size + \" bytes,\\n\" +\r\n                '\\t\"fileNameLength\" : ' + _fnameLen + \",\\n\" +\r\n                '\\t\"extraLength\" : ' + _extraLen + \" bytes,\\n\" +\r\n                '\\t\"commentLength\" : ' + _comLen + \" bytes,\\n\" +\r\n                '\\t\"diskNumStart\" : ' + _diskStart + \",\\n\" +\r\n                '\\t\"inAttr\" : ' + _inattr + \",\\n\" +\r\n                '\\t\"attr\" : ' + _attr + \",\\n\" +\r\n                '\\t\"offset\" : ' + _offset + \",\\n\" +\r\n                '\\t\"entryHeaderSize\" : ' + (Constants.CENHDR + _fnameLen + _extraLen + _comLen) + \" bytes\\n\" +\r\n                '}';\r\n        }\r\n    }\r\n};\r\n\n\n/***/ }),\n\n/***/ 4958:\n/***/ ((__unused_webpack_module, exports, __nccwpck_require__) => {\n\nexports.EntryHeader = __nccwpck_require__(9032);\r\nexports.MainHeader = __nccwpck_require__(4408);\r\n\n\n/***/ }),\n\n/***/ 4408:\n/***/ ((module, __unused_webpack_exports, __nccwpck_require__) => {\n\nvar Utils = __nccwpck_require__(5182),\r\n    Constants = Utils.Constants;\r\n\r\n/* The entries in the end of central directory */\r\nmodule.exports = function () {\r\n    var _volumeEntries = 0,\r\n        _totalEntries = 0,\r\n        _size = 0,\r\n        _offset = 0,\r\n        _commentLength = 0;\r\n\r\n    return {\r\n        get diskEntries () { return _volumeEntries },\r\n        set diskEntries (/*Number*/val) { _volumeEntries = _totalEntries = val; },\r\n\r\n        get totalEntries () { return _totalEntries },\r\n        set totalEntries (/*Number*/val) { _totalEntries = _volumeEntries = val; },\r\n\r\n        get size () { return _size },\r\n        set size (/*Number*/val) { _size = val; },\r\n\r\n        get offset () { return _offset },\r\n        set offset (/*Number*/val) { _offset = val; },\r\n\r\n        get commentLength () { return _commentLength },\r\n        set commentLength (/*Number*/val) { _commentLength = val; },\r\n\r\n        get mainHeaderSize () {\r\n            return Constants.ENDHDR + _commentLength;\r\n        },\r\n\r\n        loadFromBinary : function(/*Buffer*/data) {\r\n            // data should be 22 bytes and start with \"PK 05 06\"\r\n            // or be 56+ bytes and start with \"PK 06 06\" for Zip64\r\n            if ((data.length !== Constants.ENDHDR || data.readUInt32LE(0) !== Constants.ENDSIG) &&\r\n                (data.length < Constants.ZIP64HDR || data.readUInt32LE(0) !== Constants.ZIP64SIG)) {\r\n\r\n                throw new Error(Utils.Errors.INVALID_END);\r\n            }\r\n\r\n            if (data.readUInt32LE(0) === Constants.ENDSIG) {\r\n                // number of entries on this volume\r\n                _volumeEntries = data.readUInt16LE(Constants.ENDSUB);\r\n                // total number of entries\r\n                _totalEntries = data.readUInt16LE(Constants.ENDTOT);\r\n                // central directory size in bytes\r\n                _size = data.readUInt32LE(Constants.ENDSIZ);\r\n                // offset of first CEN header\r\n                _offset = data.readUInt32LE(Constants.ENDOFF);\r\n                // zip file comment length\r\n                _commentLength = data.readUInt16LE(Constants.ENDCOM);\r\n            } else {\r\n                // number of entries on this volume\r\n                _volumeEntries = Utils.readBigUInt64LE(data, Constants.ZIP64SUB);\r\n                // total number of entries\r\n                _totalEntries = Utils.readBigUInt64LE(data, Constants.ZIP64TOT);\r\n                // central directory size in bytes\r\n                _size = Utils.readBigUInt64LE(data, Constants.ZIP64SIZ);\r\n                // offset of first CEN header\r\n                _offset = Utils.readBigUInt64LE(data, Constants.ZIP64OFF);\r\n\r\n                _commentLength = 0;\r\n            }\r\n\r\n        },\r\n\r\n        toBinary : function() {\r\n           var b = Buffer.alloc(Constants.ENDHDR + _commentLength);\r\n            // \"PK 05 06\" signature\r\n            b.writeUInt32LE(Constants.ENDSIG, 0);\r\n            b.writeUInt32LE(0, 4);\r\n            // number of entries on this volume\r\n            b.writeUInt16LE(_volumeEntries, Constants.ENDSUB);\r\n            // total number of entries\r\n            b.writeUInt16LE(_totalEntries, Constants.ENDTOT);\r\n            // central directory size in bytes\r\n            b.writeUInt32LE(_size, Constants.ENDSIZ);\r\n            // offset of first CEN header\r\n            b.writeUInt32LE(_offset, Constants.ENDOFF);\r\n            // zip file comment length\r\n            b.writeUInt16LE(_commentLength, Constants.ENDCOM);\r\n            // fill comment memory with spaces so no garbage is left there\r\n            b.fill(\" \", Constants.ENDHDR);\r\n\r\n            return b;\r\n        },\r\n\r\n        toString : function() {\r\n            return '{\\n' +\r\n                '\\t\"diskEntries\" : ' + _volumeEntries + \",\\n\" +\r\n                '\\t\"totalEntries\" : ' + _totalEntries + \",\\n\" +\r\n                '\\t\"size\" : ' + _size + \" bytes,\\n\" +\r\n                '\\t\"offset\" : 0x' + _offset.toString(16).toUpperCase() + \",\\n\" +\r\n                '\\t\"commentLength\" : 0x' + _commentLength + \"\\n\" +\r\n            '}';\r\n        }\r\n    }\r\n};\n\n/***/ }),\n\n/***/ 7686:\n/***/ ((module, __unused_webpack_exports, __nccwpck_require__) => {\n\nmodule.exports = function (/*Buffer*/inbuf) {\r\n\r\n  var zlib = __nccwpck_require__(8761);\r\n  \r\n  var opts = {chunkSize: (parseInt(inbuf.length / 1024) + 1) * 1024};\r\n  \r\n  return {\r\n    deflate: function () {\r\n      return zlib.deflateRawSync(inbuf, opts);\r\n    },\r\n\r\n    deflateAsync: function (/*Function*/callback) {\r\n      var tmp = zlib.createDeflateRaw(opts), parts = [], total = 0;\r\n      tmp.on('data', function (data) {\r\n        parts.push(data);\r\n        total += data.length;\r\n      });\r\n      tmp.on('end', function () {\r\n        var buf = Buffer.alloc(total), written = 0;\r\n        buf.fill(0);\r\n        for (var i = 0; i < parts.length; i++) {\r\n          var part = parts[i];\r\n          part.copy(buf, written);\r\n          written += part.length;\r\n        }\r\n        callback && callback(buf);\r\n      });\r\n      tmp.end(inbuf);\r\n    }\r\n  }\r\n};\r\n\n\n/***/ }),\n\n/***/ 3928:\n/***/ ((__unused_webpack_module, exports, __nccwpck_require__) => {\n\nexports.Deflater = __nccwpck_require__(7686);\r\nexports.Inflater = __nccwpck_require__(2153);\r\nexports.ZipCrypto = __nccwpck_require__(3228);\n\n/***/ }),\n\n/***/ 2153:\n/***/ ((module, __unused_webpack_exports, __nccwpck_require__) => {\n\nmodule.exports = function (/*Buffer*/inbuf) {\r\n\r\n  var zlib = __nccwpck_require__(8761);\r\n\r\n  return {\r\n    inflate: function () {\r\n      return zlib.inflateRawSync(inbuf);\r\n    },\r\n\r\n    inflateAsync: function (/*Function*/callback) {\r\n      var tmp = zlib.createInflateRaw(), parts = [], total = 0;\r\n      tmp.on('data', function (data) {\r\n        parts.push(data);\r\n        total += data.length;\r\n      });\r\n      tmp.on('end', function () {\r\n        var buf = Buffer.alloc(total), written = 0;\r\n        buf.fill(0);\r\n        for (var i = 0; i < parts.length; i++) {\r\n          var part = parts[i];\r\n          part.copy(buf, written);\r\n          written += part.length;\r\n        }\r\n        callback && callback(buf);\r\n      });\r\n      tmp.end(inbuf);\r\n    }\r\n  }\r\n};\r\n\n\n/***/ }),\n\n/***/ 3228:\n/***/ ((module, __unused_webpack_exports, __nccwpck_require__) => {\n\n// node crypt, we use it for generate salt\r\nconst { randomFillSync } = __nccwpck_require__(6417);\r\n\r\n\"use strict\";\r\n\r\n// generate CRC32 lookup table\r\nconst crctable = new Uint32Array(256).map((t, crc) => {\r\n    for (let j = 0; j < 8; j++) {\r\n        if (0 !== (crc & 1)) {\r\n            crc = (crc >>> 1) ^ 0xedb88320;\r\n        } else {\r\n            crc >>>= 1;\r\n        }\r\n    }\r\n    return crc >>> 0;\r\n});\r\n\r\n// C-style uInt32 Multiply (discards higher bits, when JS multiply discards lower bits)\r\nconst uMul = (a, b) => Math.imul(a, b) >>> 0;\r\n\r\n// crc32 byte single update (actually same function is part of utils.crc32 function :) )\r\nconst crc32update = (pCrc32, bval) => {\r\n    return crctable[(pCrc32 ^ bval) & 0xff] ^ (pCrc32 >>> 8);\r\n};\r\n\r\n// function for generating salt for encrytion header\r\nconst genSalt = () => {\r\n    if (\"function\" === typeof randomFillSync) {\r\n        return randomFillSync(Buffer.alloc(12));\r\n    } else {\r\n        // fallback if function is not defined\r\n        return genSalt.node();\r\n    }\r\n};\r\n\r\n// salt generation with node random function (mainly as fallback)\r\ngenSalt.node = () => {\r\n    const salt = Buffer.alloc(12);\r\n    const len = salt.length;\r\n    for (let i = 0; i < len; i++) salt[i] = (Math.random() * 256) & 0xff;\r\n    return salt;\r\n};\r\n\r\n// general config\r\nconst config = {\r\n    genSalt\r\n};\r\n\r\n// Class Initkeys handles same basic ops with keys\r\nfunction Initkeys(pw) {\r\n    const pass = Buffer.isBuffer(pw) ? pw : Buffer.from(pw);\r\n    this.keys = new Uint32Array([0x12345678, 0x23456789, 0x34567890]);\r\n    for (let i = 0; i < pass.length; i++) {\r\n        this.updateKeys(pass[i]);\r\n    }\r\n}\r\n\r\nInitkeys.prototype.updateKeys = function (byteValue) {\r\n    const keys = this.keys;\r\n    keys[0] = crc32update(keys[0], byteValue);\r\n    keys[1] += keys[0] & 0xff;\r\n    keys[1] = uMul(keys[1], 134775813) + 1;\r\n    keys[2] = crc32update(keys[2], keys[1] >>> 24);\r\n    return byteValue;\r\n};\r\n\r\nInitkeys.prototype.next = function () {\r\n    const k = (this.keys[2] | 2) >>> 0; // key\r\n    return (uMul(k, k ^ 1) >> 8) & 0xff; // decode\r\n};\r\n\r\nfunction make_decrypter(/*Buffer*/ pwd) {\r\n    // 1. Stage initialize key\r\n    const keys = new Initkeys(pwd);\r\n\r\n    // return decrypter function\r\n    return function (/*Buffer*/ data) {\r\n        // result - we create new Buffer for results\r\n        const result = Buffer.alloc(data.length);\r\n        let pos = 0;\r\n        // process input data\r\n        for (let c of data) {\r\n            //c ^= keys.next();\r\n            //result[pos++] = c; // decode & Save Value\r\n            result[pos++] = keys.updateKeys(c ^ keys.next()); // update keys with decoded byte\r\n        }\r\n        return result;\r\n    };\r\n}\r\n\r\nfunction make_encrypter(/*Buffer*/ pwd) {\r\n    // 1. Stage initialize key\r\n    const keys = new Initkeys(pwd);\r\n\r\n    // return encrypting function, result and pos is here so we dont have to merge buffers later\r\n    return function (/*Buffer*/ data, /*Buffer*/ result, /* Number */ pos = 0) {\r\n        // result - we create new Buffer for results\r\n        if (!result) result = Buffer.alloc(data.length);\r\n        // process input data\r\n        for (let c of data) {\r\n            const k = keys.next(); // save key byte\r\n            result[pos++] = c ^ k; // save val\r\n            keys.updateKeys(c); // update keys with decoded byte\r\n        }\r\n        return result;\r\n    };\r\n}\r\n\r\nfunction decrypt(/*Buffer*/ data, /*Object*/ header, /*String, Buffer*/ pwd) {\r\n    if (!data || !Buffer.isBuffer(data) || data.length < 12) {\r\n        return Buffer.alloc(0);\r\n    }\r\n\r\n    // 1. We Initialize and generate decrypting function\r\n    const decrypter = make_decrypter(pwd);\r\n\r\n    // 2. decrypt salt what is always 12 bytes and is a part of file content\r\n    const salt = decrypter(data.slice(0, 12));\r\n\r\n    // 3. does password meet expectations\r\n    if (salt[11] !== header.crc >>> 24) {\r\n        throw \"ADM-ZIP: Wrong Password\";\r\n    }\r\n\r\n    // 4. decode content\r\n    return decrypter(data.slice(12));\r\n}\r\n\r\n// lets add way to populate salt, NOT RECOMMENDED for production but maybe useful for testing general functionality\r\nfunction _salter(data) {\r\n    if (Buffer.isBuffer(data) && data.length >= 12) {\r\n        // be aware - currently salting buffer data is modified\r\n        config.genSalt = function () {\r\n            return data.slice(0, 12);\r\n        };\r\n    } else if (data === \"node\") {\r\n        // test salt generation with node random function\r\n        config.genSalt = genSalt.node;\r\n    } else {\r\n        // if value is not acceptable config gets reset.\r\n        config.genSalt = genSalt;\r\n    }\r\n}\r\n\r\nfunction encrypt(/*Buffer*/ data, /*Object*/ header, /*String, Buffer*/ pwd, /*Boolean*/ oldlike = false) {\r\n    // 1. test data if data is not Buffer we make buffer from it\r\n    if (data == null) data = Buffer.alloc(0);\r\n    // if data is not buffer be make buffer from it\r\n    if (!Buffer.isBuffer(data)) data = Buffer.from(data.toString());\r\n\r\n    // 2. We Initialize and generate encrypting function\r\n    const encrypter = make_encrypter(pwd);\r\n\r\n    // 3. generate salt (12-bytes of random data)\r\n    const salt = config.genSalt();\r\n    salt[11] = (header.crc >>> 24) & 0xff;\r\n\r\n    // old implementations (before PKZip 2.04g) used two byte check\r\n    if (oldlike) salt[10] = (header.crc >>> 16) & 0xff;\r\n\r\n    // 4. create output\r\n    const result = Buffer.alloc(data.length + 12);\r\n    encrypter(salt, result);\r\n\r\n    // finally encode content\r\n    return encrypter(data, result, 12);\r\n}\r\n\r\nmodule.exports = { decrypt, encrypt, _salter };\r\n\n\n/***/ }),\n\n/***/ 4522:\n/***/ ((module) => {\n\nmodule.exports = {\r\n    /* The local file header */\r\n    LOCHDR           : 30, // LOC header size\r\n    LOCSIG           : 0x04034b50, // \"PK\\003\\004\"\r\n    LOCVER           : 4,\t// version needed to extract\r\n    LOCFLG           : 6, // general purpose bit flag\r\n    LOCHOW           : 8, // compression method\r\n    LOCTIM           : 10, // modification time (2 bytes time, 2 bytes date)\r\n    LOCCRC           : 14, // uncompressed file crc-32 value\r\n    LOCSIZ           : 18, // compressed size\r\n    LOCLEN           : 22, // uncompressed size\r\n    LOCNAM           : 26, // filename length\r\n    LOCEXT           : 28, // extra field length\r\n\r\n    /* The Data descriptor */\r\n    EXTSIG           : 0x08074b50, // \"PK\\007\\008\"\r\n    EXTHDR           : 16, // EXT header size\r\n    EXTCRC           : 4, // uncompressed file crc-32 value\r\n    EXTSIZ           : 8, // compressed size\r\n    EXTLEN           : 12, // uncompressed size\r\n\r\n    /* The central directory file header */\r\n    CENHDR           : 46, // CEN header size\r\n    CENSIG           : 0x02014b50, // \"PK\\001\\002\"\r\n    CENVEM           : 4, // version made by\r\n    CENVER           : 6, // version needed to extract\r\n    CENFLG           : 8, // encrypt, decrypt flags\r\n    CENHOW           : 10, // compression method\r\n    CENTIM           : 12, // modification time (2 bytes time, 2 bytes date)\r\n    CENCRC           : 16, // uncompressed file crc-32 value\r\n    CENSIZ           : 20, // compressed size\r\n    CENLEN           : 24, // uncompressed size\r\n    CENNAM           : 28, // filename length\r\n    CENEXT           : 30, // extra field length\r\n    CENCOM           : 32, // file comment length\r\n    CENDSK           : 34, // volume number start\r\n    CENATT           : 36, // internal file attributes\r\n    CENATX           : 38, // external file attributes (host system dependent)\r\n    CENOFF           : 42, // LOC header offset\r\n\r\n    /* The entries in the end of central directory */\r\n    ENDHDR           : 22, // END header size\r\n    ENDSIG           : 0x06054b50, // \"PK\\005\\006\"\r\n    ENDSUB           : 8, // number of entries on this disk\r\n    ENDTOT           : 10, // total number of entries\r\n    ENDSIZ           : 12, // central directory size in bytes\r\n    ENDOFF           : 16, // offset of first CEN header\r\n    ENDCOM           : 20, // zip file comment length\r\n\r\n    END64HDR         : 20, // zip64 END header size\r\n    END64SIG         : 0x07064b50, // zip64 Locator signature, \"PK\\006\\007\"\r\n    END64START       : 4, // number of the disk with the start of the zip64\r\n    END64OFF         : 8, // relative offset of the zip64 end of central directory\r\n    END64NUMDISKS    : 16, // total number of disks\r\n\r\n    ZIP64SIG         : 0x06064b50, // zip64 signature, \"PK\\006\\006\"\r\n    ZIP64HDR         : 56, // zip64 record minimum size\r\n    ZIP64LEAD        : 12, // leading bytes at the start of the record, not counted by the value stored in ZIP64SIZE\r\n    ZIP64SIZE        : 4, // zip64 size of the central directory record\r\n    ZIP64VEM         : 12, // zip64 version made by\r\n    ZIP64VER         : 14, // zip64 version needed to extract\r\n    ZIP64DSK         : 16, // zip64 number of this disk\r\n    ZIP64DSKDIR      : 20, // number of the disk with the start of the record directory\r\n    ZIP64SUB         : 24, // number of entries on this disk\r\n    ZIP64TOT         : 32, // total number of entries\r\n    ZIP64SIZB        : 40, // zip64 central directory size in bytes\r\n    ZIP64OFF         : 48, // offset of start of central directory with respect to the starting disk number\r\n    ZIP64EXTRA       : 56, // extensible data sector\r\n\r\n    /* Compression methods */\r\n    STORED           : 0, // no compression\r\n    SHRUNK           : 1, // shrunk\r\n    REDUCED1         : 2, // reduced with compression factor 1\r\n    REDUCED2         : 3, // reduced with compression factor 2\r\n    REDUCED3         : 4, // reduced with compression factor 3\r\n    REDUCED4         : 5, // reduced with compression factor 4\r\n    IMPLODED         : 6, // imploded\r\n    // 7 reserved\r\n    DEFLATED         : 8, // deflated\r\n    ENHANCED_DEFLATED: 9, // enhanced deflated\r\n    PKWARE           : 10,// PKWare DCL imploded\r\n    // 11 reserved\r\n    BZIP2            : 12, //  compressed using BZIP2\r\n    // 13 reserved\r\n    LZMA             : 14, // LZMA\r\n    // 15-17 reserved\r\n    IBM_TERSE        : 18, // compressed using IBM TERSE\r\n    IBM_LZ77         : 19, //IBM LZ77 z\r\n\r\n    /* General purpose bit flag */\r\n    FLG_ENC          : 0,  // encripted file\r\n    FLG_COMP1        : 1,  // compression option\r\n    FLG_COMP2        : 2,  // compression option\r\n    FLG_DESC         : 4,  // data descriptor\r\n    FLG_ENH          : 8,  // enhanced deflation\r\n    FLG_STR          : 16, // strong encryption\r\n    FLG_LNG          : 1024, // language encoding\r\n    FLG_MSK          : 4096, // mask header values\r\n\r\n    /* Load type */\r\n    FILE             : 2,\r\n    BUFFER           : 1,\r\n    NONE             : 0,\r\n\r\n    /* 4.5 Extensible data fields */\r\n    EF_ID            : 0,\r\n    EF_SIZE          : 2,\r\n\r\n    /* Header IDs */\r\n    ID_ZIP64         : 0x0001,\r\n    ID_AVINFO        : 0x0007,\r\n    ID_PFS           : 0x0008,\r\n    ID_OS2           : 0x0009,\r\n    ID_NTFS          : 0x000a,\r\n    ID_OPENVMS       : 0x000c,\r\n    ID_UNIX          : 0x000d,\r\n    ID_FORK          : 0x000e,\r\n    ID_PATCH         : 0x000f,\r\n    ID_X509_PKCS7    : 0x0014,\r\n    ID_X509_CERTID_F : 0x0015,\r\n    ID_X509_CERTID_C : 0x0016,\r\n    ID_STRONGENC     : 0x0017,\r\n    ID_RECORD_MGT    : 0x0018,\r\n    ID_X509_PKCS7_RL : 0x0019,\r\n    ID_IBM1          : 0x0065,\r\n    ID_IBM2          : 0x0066,\r\n    ID_POSZIP        : 0x4690,\r\n\r\n    EF_ZIP64_OR_32   : 0xffffffff,\r\n    EF_ZIP64_OR_16   : 0xffff,\r\n    EF_ZIP64_SUNCOMP : 0,\r\n    EF_ZIP64_SCOMP   : 8,\r\n    EF_ZIP64_RHO     : 16,\r\n    EF_ZIP64_DSN     : 24\r\n};\r\n\n\n/***/ }),\n\n/***/ 1255:\n/***/ ((module) => {\n\nmodule.exports = {\r\n    /* Header error messages */\r\n    \"INVALID_LOC\" : \"Invalid LOC header (bad signature)\",\r\n    \"INVALID_CEN\" : \"Invalid CEN header (bad signature)\",\r\n    \"INVALID_END\" : \"Invalid END header (bad signature)\",\r\n\r\n    /* ZipEntry error messages*/\r\n    \"NO_DATA\" : \"Nothing to decompress\",\r\n    \"BAD_CRC\" : \"CRC32 checksum failed\",\r\n    \"FILE_IN_THE_WAY\" : \"There is a file in the way: %s\",\r\n    \"UNKNOWN_METHOD\" : \"Invalid/unsupported compression method\",\r\n\r\n    /* Inflater error messages */\r\n    \"AVAIL_DATA\" : \"inflate::Available inflate data did not terminate\",\r\n    \"INVALID_DISTANCE\" : \"inflate::Invalid literal/length or distance code in fixed or dynamic block\",\r\n    \"TO_MANY_CODES\" : \"inflate::Dynamic block code description: too many length or distance codes\",\r\n    \"INVALID_REPEAT_LEN\" : \"inflate::Dynamic block code description: repeat more than specified lengths\",\r\n    \"INVALID_REPEAT_FIRST\" : \"inflate::Dynamic block code description: repeat lengths with no first length\",\r\n    \"INCOMPLETE_CODES\" : \"inflate::Dynamic block code description: code lengths codes incomplete\",\r\n    \"INVALID_DYN_DISTANCE\": \"inflate::Dynamic block code description: invalid distance code lengths\",\r\n    \"INVALID_CODES_LEN\": \"inflate::Dynamic block code description: invalid literal/length code lengths\",\r\n    \"INVALID_STORE_BLOCK\" : \"inflate::Stored block length did not match one's complement\",\r\n    \"INVALID_BLOCK_TYPE\" : \"inflate::Invalid block type (type == 3)\",\r\n\r\n    /* ADM-ZIP error messages */\r\n    \"CANT_EXTRACT_FILE\" : \"Could not extract the file\",\r\n    \"CANT_OVERRIDE\" : \"Target file already exists\",\r\n    \"NO_ZIP\" : \"No zip file was loaded\",\r\n    \"NO_ENTRY\" : \"Entry doesn't exist\",\r\n    \"DIRECTORY_CONTENT_ERROR\" : \"A directory cannot have content\",\r\n    \"FILE_NOT_FOUND\" : \"File not found: %s\",\r\n    \"NOT_IMPLEMENTED\" : \"Not implemented\",\r\n    \"INVALID_FILENAME\" : \"Invalid filename\",\r\n    \"INVALID_FORMAT\" : \"Invalid or unsupported zip format. No END header found\"\r\n};\n\n/***/ }),\n\n/***/ 8321:\n/***/ ((module, __unused_webpack_exports, __nccwpck_require__) => {\n\nvar fs = __nccwpck_require__(2895).require(),\r\n    pth = __nccwpck_require__(5622);\r\n\t\r\nfs.existsSync = fs.existsSync || pth.existsSync;\r\n\r\nmodule.exports = function(/*String*/path) {\r\n\r\n    var _path = path || \"\",\r\n        _permissions = 0,\r\n        _obj = newAttr(),\r\n        _stat = null;\r\n\r\n    function newAttr() {\r\n        return {\r\n            directory : false,\r\n            readonly : false,\r\n            hidden : false,\r\n            executable : false,\r\n            mtime : 0,\r\n            atime : 0\r\n        }\r\n    }\r\n\r\n    if (_path && fs.existsSync(_path)) {\r\n        _stat = fs.statSync(_path);\r\n        _obj.directory = _stat.isDirectory();\r\n        _obj.mtime = _stat.mtime;\r\n        _obj.atime = _stat.atime;\r\n        _obj.executable = (0o111 & _stat.mode) != 0;    // file is executable who ever har right not just owner\r\n        _obj.readonly   = (0o200 & _stat.mode) == 0;    // readonly if owner has no write right\r\n        _obj.hidden = pth.basename(_path)[0] === \".\";\r\n    } else {\r\n        console.warn(\"Invalid path: \" + _path)\r\n    }\r\n\r\n    return {\r\n\r\n        get directory () {\r\n            return _obj.directory;\r\n        },\r\n\r\n        get readOnly () {\r\n            return _obj.readonly;\r\n        },\r\n\r\n        get hidden () {\r\n            return _obj.hidden;\r\n        },\r\n\r\n        get mtime () {\r\n            return _obj.mtime;\r\n        },\r\n\r\n        get atime () {\r\n           return _obj.atime;\r\n        },\r\n\r\n\r\n        get executable () {\r\n            return _obj.executable;\r\n        },\r\n\r\n        decodeAttributes : function(val) {\r\n\r\n        },\r\n\r\n        encodeAttributes : function (val) {\r\n\r\n        },\r\n\r\n        toString : function() {\r\n           return '{\\n' +\r\n               '\\t\"path\" : \"' + _path + \",\\n\" +\r\n               '\\t\"isDirectory\" : ' + _obj.directory + \",\\n\" +\r\n               '\\t\"isReadOnly\" : ' + _obj.readonly + \",\\n\" +\r\n               '\\t\"isHidden\" : ' + _obj.hidden + \",\\n\" +\r\n               '\\t\"isExecutable\" : ' + _obj.executable + \",\\n\" +\r\n               '\\t\"mTime\" : ' + _obj.mtime + \"\\n\" +\r\n               '\\t\"aTime\" : ' + _obj.atime + \"\\n\" +\r\n           '}';\r\n        }\r\n    }\r\n\r\n};\r\n\n\n/***/ }),\n\n/***/ 2895:\n/***/ ((__unused_webpack_module, exports, __nccwpck_require__) => {\n\nexports.require = function() {\r\n  var fs = __nccwpck_require__(5747);\r\n  if (process && process.versions && process.versions['electron']) {\r\n\t  try {\r\n\t    originalFs = __nccwpck_require__(2941);\r\n\t    if (Object.keys(originalFs).length > 0) {\r\n\t      fs = originalFs;\r\n      }\r\n\t  } catch (e) {}\r\n  }\r\n  return fs\r\n};\r\n\n\n/***/ }),\n\n/***/ 5182:\n/***/ ((module, __unused_webpack_exports, __nccwpck_require__) => {\n\nmodule.exports = __nccwpck_require__(1291);\r\nmodule.exports.FileSystem = __nccwpck_require__(2895);\r\nmodule.exports.Constants = __nccwpck_require__(4522);\r\nmodule.exports.Errors = __nccwpck_require__(1255);\r\nmodule.exports.FileAttr = __nccwpck_require__(8321);\n\n/***/ }),\n\n/***/ 1291:\n/***/ ((module, __unused_webpack_exports, __nccwpck_require__) => {\n\nvar fs = __nccwpck_require__(2895).require(),\r\n    pth = __nccwpck_require__(5622);\r\n\r\nfs.existsSync = fs.existsSync || pth.existsSync;\r\n\r\nmodule.exports = (function() {\r\n\r\n    var crcTable = [],\r\n        Constants = __nccwpck_require__(4522),\r\n        Errors = __nccwpck_require__(1255),\r\n\r\n        PATH_SEPARATOR = pth.sep;\r\n\r\n\r\n    function mkdirSync(/*String*/path) {\r\n        var resolvedPath = path.split(PATH_SEPARATOR)[0];\r\n        path.split(PATH_SEPARATOR).forEach(function(name) {\r\n            if (!name || name.substr(-1,1) === \":\") return;\r\n            resolvedPath += PATH_SEPARATOR + name;\r\n            var stat;\r\n            try {\r\n                stat = fs.statSync(resolvedPath);\r\n            } catch (e) {\r\n                fs.mkdirSync(resolvedPath);\r\n            }\r\n            if (stat && stat.isFile())\r\n                throw Errors.FILE_IN_THE_WAY.replace(\"%s\", resolvedPath);\r\n        });\r\n    }\r\n\r\n    function findSync(/*String*/dir, /*RegExp*/pattern, /*Boolean*/recoursive) {\r\n        if (typeof pattern === 'boolean') {\r\n            recoursive = pattern;\r\n            pattern = undefined;\r\n        }\r\n        var files = [];\r\n        fs.readdirSync(dir).forEach(function(file) {\r\n            var path = pth.join(dir, file);\r\n\r\n            if (fs.statSync(path).isDirectory() && recoursive)\r\n                files = files.concat(findSync(path, pattern, recoursive));\r\n\r\n            if (!pattern || pattern.test(path)) {\r\n                files.push(pth.normalize(path) + (fs.statSync(path).isDirectory() ? PATH_SEPARATOR : \"\"));\r\n            }\r\n\r\n        });\r\n        return files;\r\n    }\r\n\r\n    function readBigUInt64LE(/*Buffer*/buffer, /*int*/index) {\r\n        var slice = Buffer.from(buffer.slice(index, index + 8));\r\n        slice.swap64();\r\n\r\n        return parseInt(`0x${ slice.toString('hex') }`);\r\n    }\r\n\r\n    return {\r\n        makeDir : function(/*String*/path) {\r\n            mkdirSync(path);\r\n        },\r\n\r\n        crc32 : function(buf) {\r\n            if (typeof buf === 'string') {\r\n                buf = Buffer.from(buf);\r\n            }\r\n            var b = Buffer.alloc(4);\r\n            if (!crcTable.length) {\r\n                for (var n = 0; n < 256; n++) {\r\n                    var c = n;\r\n                    for (var k = 8; --k >= 0;)  //\r\n                        if ((c & 1) !== 0)  { c = 0xedb88320 ^ (c >>> 1); } else { c = c >>> 1; }\r\n                    if (c < 0) {\r\n                        b.writeInt32LE(c, 0);\r\n                        c = b.readUInt32LE(0);\r\n                    }\r\n                    crcTable[n] = c;\r\n                }\r\n            }\r\n            var crc = 0, off = 0, len = buf.length, c1 = ~crc;\r\n            while(--len >= 0) c1 = crcTable[(c1 ^ buf[off++]) & 0xff] ^ (c1 >>> 8);\r\n            crc = ~c1;\r\n            b.writeInt32LE(crc & 0xffffffff, 0);\r\n            return b.readUInt32LE(0);\r\n        },\r\n\r\n        methodToString : function(/*Number*/method) {\r\n            switch (method) {\r\n                case Constants.STORED:\r\n                    return 'STORED (' + method + ')';\r\n                case Constants.DEFLATED:\r\n                    return 'DEFLATED (' + method + ')';\r\n                default:\r\n                    return 'UNSUPPORTED (' + method + ')';\r\n            }\r\n\r\n        },\r\n\r\n        writeFileTo : function(/*String*/path, /*Buffer*/content, /*Boolean*/overwrite, /*Number*/attr) {\r\n            if (fs.existsSync(path)) {\r\n                if (!overwrite)\r\n                    return false; // cannot overwrite\r\n\r\n                var stat = fs.statSync(path);\r\n                if (stat.isDirectory()) {\r\n                    return false;\r\n                }\r\n            }\r\n            var folder = pth.dirname(path);\r\n            if (!fs.existsSync(folder)) {\r\n                mkdirSync(folder);\r\n            }\r\n\r\n            var fd;\r\n            try {\r\n                fd = fs.openSync(path, 'w', 438); // 0666\r\n            } catch(e) {\r\n                fs.chmodSync(path, 438);\r\n                fd = fs.openSync(path, 'w', 438);\r\n            }\r\n            if (fd) {\r\n                try {\r\n                    fs.writeSync(fd, content, 0, content.length, 0);\r\n                }\r\n                catch (e){\r\n                    throw e;\r\n                }\r\n                finally {\r\n                    fs.closeSync(fd);\r\n                }\r\n            }\r\n            fs.chmodSync(path, attr || 438);\r\n            return true;\r\n        },\r\n\r\n        writeFileToAsync : function(/*String*/path, /*Buffer*/content, /*Boolean*/overwrite, /*Number*/attr, /*Function*/callback) {\r\n            if(typeof attr === 'function') {\r\n                callback = attr;\r\n                attr = undefined;\r\n            }\r\n\r\n            fs.exists(path, function(exists) {\r\n                if(exists && !overwrite)\r\n                    return callback(false);\r\n\r\n                fs.stat(path, function(err, stat) {\r\n                    if(exists &&stat.isDirectory()) {\r\n                        return callback(false);\r\n                    }\r\n\r\n                    var folder = pth.dirname(path);\r\n                    fs.exists(folder, function(exists) {\r\n                        if(!exists)\r\n                            mkdirSync(folder);\r\n\r\n                        fs.open(path, 'w', 438, function(err, fd) {\r\n                            if(err) {\r\n                                fs.chmod(path, 438, function() {\r\n                                    fs.open(path, 'w', 438, function(err, fd) {\r\n                                        fs.write(fd, content, 0, content.length, 0, function() {\r\n                                            fs.close(fd, function() {\r\n                                                fs.chmod(path, attr || 438, function() {\r\n                                                    callback(true);\r\n                                                })\r\n                                            });\r\n                                        });\r\n                                    });\r\n                                })\r\n                            } else {\r\n                                if(fd) {\r\n                                    fs.write(fd, content, 0, content.length, 0, function() {\r\n                                        fs.close(fd, function() {\r\n                                            fs.chmod(path, attr || 438, function() {\r\n                                                callback(true);\r\n                                            })\r\n                                        });\r\n                                    });\r\n                                } else {\r\n                                    fs.chmod(path, attr || 438, function() {\r\n                                        callback(true);\r\n                                    })\r\n                                }\r\n                            }\r\n                        });\r\n                    })\r\n                })\r\n            })\r\n        },\r\n\r\n        findFiles : function(/*String*/path) {\r\n            return findSync(path, true);\r\n        },\r\n\r\n        getAttributes : function(/*String*/path) {\r\n\r\n        },\r\n\r\n        setAttributes : function(/*String*/path) {\r\n\r\n        },\r\n\r\n        toBuffer : function(input) {\r\n            if (Buffer.isBuffer(input)) {\r\n                return input;\r\n            } else {\r\n                if (input.length === 0) {\r\n                    return Buffer.alloc(0)\r\n                }\r\n                return Buffer.from(input, 'utf8');\r\n            }\r\n        },\r\n\r\n        readBigUInt64LE,\r\n\r\n        Constants : Constants,\r\n        Errors : Errors\r\n    }\r\n})();\r\n\n\n/***/ }),\n\n/***/ 4057:\n/***/ ((module, __unused_webpack_exports, __nccwpck_require__) => {\n\nvar Utils = __nccwpck_require__(5182),\r\n    Headers = __nccwpck_require__(4958),\r\n    Constants = Utils.Constants,\r\n    Methods = __nccwpck_require__(3928);\r\n\r\nmodule.exports = function (/*Buffer*/input) {\r\n    var _entryHeader = new Headers.EntryHeader(),\r\n        _entryName = Buffer.alloc(0),\r\n        _comment = Buffer.alloc(0),\r\n        _isDirectory = false,\r\n        uncompressedData = null,\r\n        _extra = Buffer.alloc(0);\r\n\r\n    function getCompressedDataFromZip() {\r\n        if (!input || !Buffer.isBuffer(input)) {\r\n            return Buffer.alloc(0);\r\n        }\r\n        _entryHeader.loadDataHeaderFromBinary(input);\r\n        return input.slice(_entryHeader.realDataOffset, _entryHeader.realDataOffset + _entryHeader.compressedSize)\r\n    }\r\n\r\n    function crc32OK(data) {\r\n        // if bit 3 (0x08) of the general-purpose flags field is set, then the CRC-32 and file sizes are not known when the header is written\r\n        if ((_entryHeader.flags & 0x8) !== 0x8) {\r\n           if (Utils.crc32(data) !== _entryHeader.dataHeader.crc) {\r\n               return false;\r\n           }\r\n        } else {\r\n            // @TODO: load and check data descriptor header\r\n            // The fields in the local header are filled with zero, and the CRC-32 and size are appended in a 12-byte structure\r\n            // (optionally preceded by a 4-byte signature) immediately after the compressed data:\r\n        }\r\n        return true;\r\n    }\r\n\r\n    function decompress(/*Boolean*/async, /*Function*/callback, /*String, Buffer*/pass) {\r\n        if(typeof callback === 'undefined' && typeof async === 'string') {\r\n            pass=async;\r\n            async=void 0;\r\n        }\r\n        if (_isDirectory) {\r\n            if (async && callback) {\r\n                callback(Buffer.alloc(0), Utils.Errors.DIRECTORY_CONTENT_ERROR); //si added error.\r\n            }\r\n            return Buffer.alloc(0);\r\n        }\r\n\r\n        var compressedData = getCompressedDataFromZip();\r\n\r\n        if (compressedData.length === 0) {\r\n            // File is empty, nothing to decompress.\r\n            if (async && callback) callback(compressedData);\r\n            return compressedData;\r\n        }\r\n\r\n        if (_entryHeader.encripted){\r\n            if ('string' !== typeof pass && !Buffer.isBuffer(pass)){\r\n                throw new Error('ADM-ZIP: Incompatible password parameter');\r\n            }\r\n            compressedData = Methods.ZipCrypto.decrypt(compressedData, _entryHeader, pass);\r\n        }\r\n\r\n        var data = Buffer.alloc(_entryHeader.size);\r\n\r\n        switch (_entryHeader.method) {\r\n            case Utils.Constants.STORED:\r\n                compressedData.copy(data);\r\n                if (!crc32OK(data)) {\r\n                    if (async && callback) callback(data, Utils.Errors.BAD_CRC);//si added error\r\n                    throw new Error(Utils.Errors.BAD_CRC);\r\n                } else {//si added otherwise did not seem to return data.\r\n                    if (async && callback) callback(data);\r\n                    return data;\r\n                }\r\n            case Utils.Constants.DEFLATED:\r\n                var inflater = new Methods.Inflater(compressedData);\r\n                if (!async) {\r\n                    var result = inflater.inflate(data);\r\n                    result.copy(data, 0);\r\n                    if (!crc32OK(data)) {\r\n                        throw new Error(Utils.Errors.BAD_CRC + \" \" + _entryName.toString());\r\n                    }\r\n                    return data;\r\n                } else {\r\n                    inflater.inflateAsync(function(result) {\r\n                        result.copy(data, 0);\r\n                        if (!crc32OK(data)) {\r\n                            if (callback) callback(data, Utils.Errors.BAD_CRC); //si added error\r\n                        } else { //si added otherwise did not seem to return data.\r\n                            if (callback) callback(data);\r\n                        }\r\n                    });\r\n                }\r\n                break;\r\n            default:\r\n                if (async && callback) callback(Buffer.alloc(0), Utils.Errors.UNKNOWN_METHOD);\r\n                throw new Error(Utils.Errors.UNKNOWN_METHOD);\r\n        }\r\n    }\r\n\r\n    function compress(/*Boolean*/async, /*Function*/callback) {\r\n        if ((!uncompressedData || !uncompressedData.length) && Buffer.isBuffer(input)) {\r\n            // no data set or the data wasn't changed to require recompression\r\n            if (async && callback) callback(getCompressedDataFromZip());\r\n            return getCompressedDataFromZip();\r\n        }\r\n\r\n        if (uncompressedData.length && !_isDirectory) {\r\n            var compressedData;\r\n            // Local file header\r\n            switch (_entryHeader.method) {\r\n                case Utils.Constants.STORED:\r\n                    _entryHeader.compressedSize = _entryHeader.size;\r\n\r\n                    compressedData = Buffer.alloc(uncompressedData.length);\r\n                    uncompressedData.copy(compressedData);\r\n\r\n                    if (async && callback) callback(compressedData);\r\n                    return compressedData;\r\n                default:\r\n                case Utils.Constants.DEFLATED:\r\n\r\n                    var deflater = new Methods.Deflater(uncompressedData);\r\n                    if (!async) {\r\n                        var deflated = deflater.deflate();\r\n                        _entryHeader.compressedSize = deflated.length;\r\n                        return deflated;\r\n                    } else {\r\n                        deflater.deflateAsync(function(data) {\r\n                            compressedData = Buffer.alloc(data.length);\r\n                            _entryHeader.compressedSize = data.length;\r\n                            data.copy(compressedData);\r\n                            callback && callback(compressedData);\r\n                        });\r\n                    }\r\n                    deflater = null;\r\n                    break;\r\n            }\r\n        } else {\r\n            if (async && callback) {\r\n                callback(Buffer.alloc(0));\r\n            } else {\r\n                return Buffer.alloc(0);\r\n            }\r\n        }\r\n    }\r\n\r\n    function readUInt64LE(buffer, offset) {\r\n        return (buffer.readUInt32LE(offset + 4) << 4) + buffer.readUInt32LE(offset);\r\n    }\r\n\r\n    function parseExtra(data) {\r\n        var offset = 0;\r\n        var signature, size, part;\r\n        while(offset<data.length) {\r\n            signature = data.readUInt16LE(offset);\r\n            offset += 2;\r\n            size = data.readUInt16LE(offset);\r\n            offset += 2;\r\n            part = data.slice(offset, offset+size);\r\n            offset += size;\r\n            if(Constants.ID_ZIP64 === signature) {\r\n                parseZip64ExtendedInformation(part);\r\n            }\r\n        }\r\n    }\r\n\r\n    //Override header field values with values from the ZIP64 extra field\r\n    function parseZip64ExtendedInformation(data) {\r\n        var size, compressedSize, offset, diskNumStart;\r\n\r\n        if(data.length >= Constants.EF_ZIP64_SCOMP) {\r\n            size = readUInt64LE(data, Constants.EF_ZIP64_SUNCOMP);\r\n            if(_entryHeader.size === Constants.EF_ZIP64_OR_32) {\r\n                _entryHeader.size = size;\r\n            }\r\n        }\r\n        if(data.length >= Constants.EF_ZIP64_RHO) {\r\n            compressedSize = readUInt64LE(data, Constants.EF_ZIP64_SCOMP);\r\n            if(_entryHeader.compressedSize === Constants.EF_ZIP64_OR_32) {\r\n                _entryHeader.compressedSize = compressedSize;\r\n            }\r\n        }\r\n        if(data.length >= Constants.EF_ZIP64_DSN) {\r\n            offset = readUInt64LE(data, Constants.EF_ZIP64_RHO);\r\n            if(_entryHeader.offset === Constants.EF_ZIP64_OR_32) {\r\n                _entryHeader.offset = offset;\r\n            }\r\n        }\r\n        if(data.length >= Constants.EF_ZIP64_DSN+4) {\r\n            diskNumStart = data.readUInt32LE(Constants.EF_ZIP64_DSN);\r\n            if(_entryHeader.diskNumStart === Constants.EF_ZIP64_OR_16) {\r\n                _entryHeader.diskNumStart = diskNumStart;\r\n            }\r\n        }\r\n    }\r\n\r\n\r\n    return {\r\n        get entryName () { return _entryName.toString(); },\r\n        get rawEntryName() { return _entryName; },\r\n        set entryName (val) {\r\n            _entryName = Utils.toBuffer(val);\r\n            var lastChar = _entryName[_entryName.length - 1];\r\n            _isDirectory = (lastChar === 47) || (lastChar === 92);\r\n            _entryHeader.fileNameLength = _entryName.length;\r\n        },\r\n\r\n        get extra () { return _extra; },\r\n        set extra (val) {\r\n            _extra = val;\r\n            _entryHeader.extraLength = val.length;\r\n            parseExtra(val);\r\n        },\r\n\r\n        get comment () { return _comment.toString(); },\r\n        set comment (val) {\r\n            _comment = Utils.toBuffer(val);\r\n            _entryHeader.commentLength = _comment.length;\r\n        },\r\n\r\n        get name () { var n = _entryName.toString(); return _isDirectory ? n.substr(n.length - 1).split(\"/\").pop() : n.split(\"/\").pop(); },\r\n        get isDirectory () { return _isDirectory },\r\n\r\n        getCompressedData : function() {\r\n            return compress(false, null)\r\n        },\r\n\r\n        getCompressedDataAsync : function(/*Function*/callback) {\r\n            compress(true, callback)\r\n        },\r\n\r\n        setData : function(value) {\r\n            uncompressedData = Utils.toBuffer(value);\r\n            if (!_isDirectory && uncompressedData.length) {\r\n                _entryHeader.size = uncompressedData.length;\r\n                _entryHeader.method = Utils.Constants.DEFLATED;\r\n                _entryHeader.crc = Utils.crc32(value);\r\n                _entryHeader.changed = true;\r\n            } else { // folders and blank files should be stored\r\n                _entryHeader.method = Utils.Constants.STORED;\r\n            }\r\n        },\r\n\r\n        getData : function(pass) {\r\n            if (_entryHeader.changed) {\r\n                return uncompressedData;\r\n            } else {\r\n                return decompress(false, null, pass);\r\n            }\r\n        },\r\n\r\n        getDataAsync : function(/*Function*/callback, pass) {\r\n            if (_entryHeader.changed) {\r\n                callback(uncompressedData);\r\n            } else {\r\n                decompress(true, callback, pass);\r\n            }\r\n        },\r\n\r\n        set attr(attr) { _entryHeader.attr = attr; },\r\n        get attr() { return _entryHeader.attr; },\r\n\r\n        set header(/*Buffer*/data) {\r\n            _entryHeader.loadFromBinary(data);\r\n        },\r\n\r\n        get header() {\r\n            return _entryHeader;\r\n        },\r\n\r\n        packHeader : function() {\r\n            // 1. create header (buffer)\r\n            var header = _entryHeader.entryHeaderToBinary();\r\n            var addpos = Utils.Constants.CENHDR;\r\n            // 2. add file name\r\n            _entryName.copy(header, addpos);\r\n            addpos += _entryName.length;\r\n            // 3. add extra data\r\n            if (_entryHeader.extraLength) {\r\n                _extra.copy(header, addpos);\r\n                addpos += _entryHeader.extraLength;\r\n            }\r\n            // 4. add file comment\r\n            if (_entryHeader.commentLength) {\r\n                _comment.copy(header, addpos);\r\n            }\r\n            return header;\r\n        },\r\n\r\n        toString : function() {\r\n            return '{\\n' +\r\n                '\\t\"entryName\" : \"' + _entryName.toString() + \"\\\",\\n\" +\r\n                '\\t\"name\" : \"' + (_isDirectory ? _entryName.toString().replace(/\\/$/, '').split(\"/\").pop() : _entryName.toString().split(\"/\").pop()) + \"\\\",\\n\" +\r\n                '\\t\"comment\" : \"' + _comment.toString() + \"\\\",\\n\" +\r\n                '\\t\"isDirectory\" : ' + _isDirectory + \",\\n\" +\r\n                '\\t\"header\" : ' + _entryHeader.toString().replace(/\\t/mg, \"\\t\\t\").replace(/}/mg, \"\\t}\")  + \",\\n\" +\r\n                '\\t\"compressedData\" : <' + (input && input.length  + \" bytes buffer\" || \"null\") + \">\\n\" +\r\n                '\\t\"data\" : <' + (uncompressedData && uncompressedData.length  + \" bytes buffer\" || \"null\") + \">\\n\" +\r\n                '}';\r\n        }\r\n    }\r\n};\r\n\n\n/***/ }),\n\n/***/ 7744:\n/***/ ((module, __unused_webpack_exports, __nccwpck_require__) => {\n\nconst ZipEntry = __nccwpck_require__(4057);\r\nconst Headers = __nccwpck_require__(4958);\r\nconst Utils = __nccwpck_require__(5182);\r\n\r\nmodule.exports = function (/*Buffer|null*/inBuffer, /** object */options) {\r\n    var entryList = [],\r\n        entryTable = {},\r\n        _comment = Buffer.alloc(0),\r\n        mainHeader = new Headers.MainHeader(),\r\n        loadedEntries = false;\r\n\r\n    // assign options\r\n    const opts = Object.assign(Object.create(null), options);\r\n\r\n    if (inBuffer){\r\n        // is a memory buffer\r\n        readMainHeader(opts.readEntries);\r\n    } else {\r\n        // none. is a new file\r\n        loadedEntries = true;\r\n    }\r\n\r\n\tfunction iterateEntries(callback) {\r\n\t\tconst totalEntries = mainHeader.diskEntries; // total number of entries\r\n\t\tlet index = mainHeader.offset; // offset of first CEN header\r\n\r\n\t\tfor (let i = 0; i < totalEntries; i++) {\r\n\t\t\tlet tmp = index;\r\n\t\t\tconst entry = new ZipEntry(inBuffer);\r\n\r\n\t\t\tentry.header = inBuffer.slice(tmp, tmp += Utils.Constants.CENHDR);\r\n\t\t\tentry.entryName = inBuffer.slice(tmp, tmp += entry.header.fileNameLength);\r\n\r\n\t\t\tindex += entry.header.entryHeaderSize;\r\n\r\n\t\t\tcallback(entry);\r\n\t\t}\r\n\t}\r\n\r\n\tfunction readEntries() {\r\n\t\tloadedEntries = true;\r\n\t\tentryTable = {};\r\n\t\tentryList = new Array(mainHeader.diskEntries);  // total number of entries\r\n\t\tvar index = mainHeader.offset;  // offset of first CEN header\r\n\t\tfor (var i = 0; i < entryList.length; i++) {\r\n\r\n\t\t\tvar tmp = index,\r\n\t\t\t\tentry = new ZipEntry(inBuffer);\r\n\t\t\tentry.header = inBuffer.slice(tmp, tmp += Utils.Constants.CENHDR);\r\n\r\n\t\t\tentry.entryName = inBuffer.slice(tmp, tmp += entry.header.fileNameLength);\r\n\r\n\t\t\tif (entry.header.extraLength) {\r\n\t\t\t\tentry.extra = inBuffer.slice(tmp, tmp += entry.header.extraLength);\r\n\t\t\t}\r\n\r\n\t\t\tif (entry.header.commentLength)\r\n\t\t\t\tentry.comment = inBuffer.slice(tmp, tmp + entry.header.commentLength);\r\n\r\n\t\t\tindex += entry.header.entryHeaderSize;\r\n\r\n\t\t\tentryList[i] = entry;\r\n\t\t\tentryTable[entry.entryName] = entry;\r\n\t\t}\r\n\t}\r\n\r\n    function readMainHeader(/*Boolean*/ readNow) {\r\n\t\tvar i = inBuffer.length - Utils.Constants.ENDHDR, // END header size\r\n\t\t\tmax = Math.max(0, i - 0xFFFF), // 0xFFFF is the max zip file comment length\r\n\t\t\tn = max,\r\n\t\t\tendStart = inBuffer.length,\r\n\t\t\tendOffset = -1, // Start offset of the END header\r\n\t\t\tcommentEnd = 0;\r\n\r\n\t\tfor (i; i >= n; i--) {\r\n\t\t\tif (inBuffer[i] !== 0x50) continue; // quick check that the byte is 'P'\r\n\t\t\tif (inBuffer.readUInt32LE(i) === Utils.Constants.ENDSIG) { // \"PK\\005\\006\"\r\n\t\t\t\tendOffset = i;\r\n\t\t\t\tcommentEnd = i;\r\n\t\t\t\tendStart = i + Utils.Constants.ENDHDR;\r\n\t\t\t\t// We already found a regular signature, let's look just a bit further to check if there's any zip64 signature\r\n\t\t\t\tn = i - Utils.Constants.END64HDR;\r\n\t\t\t\tcontinue;\r\n\t\t\t}\r\n\r\n\t\t\tif (inBuffer.readUInt32LE(i) === Utils.Constants.END64SIG) {\r\n\t\t\t\t// Found a zip64 signature, let's continue reading the whole zip64 record\r\n\t\t\t\tn = max;\r\n\t\t\t\tcontinue;\r\n\t\t\t}\r\n\r\n\t\t\tif (inBuffer.readUInt32LE(i) == Utils.Constants.ZIP64SIG) {\r\n\t\t\t\t// Found the zip64 record, let's determine it's size\r\n\t\t\t\tendOffset = i;\r\n\t\t\t\tendStart = i + Utils.readBigUInt64LE(inBuffer, i + Utils.Constants.ZIP64SIZE) + Utils.Constants.ZIP64LEAD;\r\n\t\t\t\tbreak;\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\tif (!~endOffset)\r\n\t\t\tthrow new Error(Utils.Errors.INVALID_FORMAT);\r\n\r\n\t\tmainHeader.loadFromBinary(inBuffer.slice(endOffset, endStart));\r\n\t\tif (mainHeader.commentLength) {\r\n\t\t\t_comment = inBuffer.slice(commentEnd + Utils.Constants.ENDHDR);\r\n\t\t}\r\n        if (readNow) readEntries();\r\n    }\r\n\r\n\treturn {\r\n\t\t/**\r\n\t\t * Returns an array of ZipEntry objects existent in the current opened archive\r\n\t\t * @return Array\r\n\t\t */\r\n\t\tget entries() {\r\n\t\t\tif (!loadedEntries) {\r\n\t\t\t\treadEntries();\r\n\t\t\t}\r\n\t\t\treturn entryList;\r\n\t\t},\r\n\r\n\t\t/**\r\n\t\t * Archive comment\r\n\t\t * @return {String}\r\n\t\t */\r\n\t\tget comment() {\r\n\t\t\treturn _comment.toString();\r\n\t\t},\r\n\t\tset comment(val) {\r\n\t\t\t_comment = Utils.toBuffer(val);\r\n\t\t\tmainHeader.commentLength = _comment.length;\r\n\t\t},\r\n\r\n\t\tgetEntryCount: function() {\r\n\t\t\tif (!loadedEntries) {\r\n\t\t\t\treturn mainHeader.diskEntries;\r\n\t\t\t}\r\n\r\n\t\t\treturn entryList.length;\r\n\t\t},\r\n\r\n\t\tforEach: function(callback) {\r\n\t\t\tif (!loadedEntries) {\r\n\t\t\t\titerateEntries(callback);\r\n\t\t\t\treturn;\r\n\t\t\t}\r\n\r\n\t\t\tentryList.forEach(callback);\r\n\t\t},\r\n\r\n\t\t/**\r\n\t\t * Returns a reference to the entry with the given name or null if entry is inexistent\r\n\t\t *\r\n\t\t * @param entryName\r\n\t\t * @return ZipEntry\r\n\t\t */\r\n\t\tgetEntry: function (/*String*/entryName) {\r\n\t\t\tif (!loadedEntries) {\r\n\t\t\t\treadEntries();\r\n\t\t\t}\r\n\t\t\treturn entryTable[entryName] || null;\r\n\t\t},\r\n\r\n\t\t/**\r\n\t\t * Adds the given entry to the entry list\r\n\t\t *\r\n\t\t * @param entry\r\n\t\t */\r\n\t\tsetEntry: function (/*ZipEntry*/entry) {\r\n\t\t\tif (!loadedEntries) {\r\n\t\t\t\treadEntries();\r\n\t\t\t}\r\n\t\t\tentryList.push(entry);\r\n\t\t\tentryTable[entry.entryName] = entry;\r\n\t\t\tmainHeader.totalEntries = entryList.length;\r\n\t\t},\r\n\r\n\t\t/**\r\n\t\t * Removes the entry with the given name from the entry list.\r\n\t\t *\r\n\t\t * If the entry is a directory, then all nested files and directories will be removed\r\n\t\t * @param entryName\r\n\t\t */\r\n\t\tdeleteEntry: function (/*String*/entryName) {\r\n\t\t\tif (!loadedEntries) {\r\n\t\t\t\treadEntries();\r\n\t\t\t}\r\n\t\t\tvar entry = entryTable[entryName];\r\n\t\t\tif (entry && entry.isDirectory) {\r\n\t\t\t\tvar _self = this;\r\n\t\t\t\tthis.getEntryChildren(entry).forEach(function (child) {\r\n\t\t\t\t\tif (child.entryName !== entryName) {\r\n\t\t\t\t\t\t_self.deleteEntry(child.entryName)\r\n\t\t\t\t\t}\r\n\t\t\t\t})\r\n\t\t\t}\r\n\t\t\tentryList.splice(entryList.indexOf(entry), 1);\r\n\t\t\tdelete(entryTable[entryName]);\r\n\t\t\tmainHeader.totalEntries = entryList.length;\r\n\t\t},\r\n\r\n\t\t/**\r\n\t\t *  Iterates and returns all nested files and directories of the given entry\r\n\t\t *\r\n\t\t * @param entry\r\n\t\t * @return Array\r\n\t\t */\r\n\t\tgetEntryChildren: function (/*ZipEntry*/entry) {\r\n\t\t\tif (!loadedEntries) {\r\n\t\t\t\treadEntries();\r\n\t\t\t}\r\n\t\t\tif (entry.isDirectory) {\r\n\t\t\t\tvar list = [],\r\n\t\t\t\t\tname = entry.entryName,\r\n\t\t\t\t\tlen = name.length;\r\n\r\n\t\t\t\tentryList.forEach(function (zipEntry) {\r\n\t\t\t\t\tif (zipEntry.entryName.substr(0, len) === name) {\r\n\t\t\t\t\t\tlist.push(zipEntry);\r\n\t\t\t\t\t}\r\n\t\t\t\t});\r\n\t\t\t\treturn list;\r\n\t\t\t}\r\n\t\t\treturn []\r\n\t\t},\r\n\r\n\t\t/**\r\n\t\t * Returns the zip file\r\n\t\t *\r\n\t\t * @return Buffer\r\n\t\t */\r\n\t\tcompressToBuffer: function () {\r\n\t\t\tif (!loadedEntries) {\r\n\t\t\t\treadEntries();\r\n\t\t\t}\r\n\t\t\tif (entryList.length > 1) {\r\n\t\t\t\tentryList.sort(function (a, b) {\r\n\t\t\t\t\tvar nameA = a.entryName.toLowerCase();\r\n\t\t\t\t\tvar nameB = b.entryName.toLowerCase();\r\n\t\t\t\t\tif (nameA < nameB) {\r\n\t\t\t\t\t\treturn -1\r\n\t\t\t\t\t}\r\n\t\t\t\t\tif (nameA > nameB) {\r\n\t\t\t\t\t\treturn 1\r\n\t\t\t\t\t}\r\n\t\t\t\t\treturn 0;\r\n\t\t\t\t});\r\n\t\t\t}\r\n\r\n\t\t\tvar totalSize = 0,\r\n\t\t\t\tdataBlock = [],\r\n\t\t\t\tentryHeaders = [],\r\n\t\t\t\tdindex = 0;\r\n\r\n\t\t\tmainHeader.size = 0;\r\n\t\t\tmainHeader.offset = 0;\r\n\r\n\t\t\tentryList.forEach(function (entry) {\r\n\t\t\t\t// compress data and set local and entry header accordingly. Reason why is called first\r\n\t\t\t\tvar compressedData = entry.getCompressedData();\r\n\t\t\t\t// data header\r\n\t\t\t\tentry.header.offset = dindex;\r\n\t\t\t\tvar dataHeader = entry.header.dataHeaderToBinary();\r\n\t\t\t\tvar entryNameLen = entry.rawEntryName.length;\r\n\t\t\t\tvar extra = entry.extra.toString();\r\n\t\t\t\tvar postHeader = Buffer.alloc(entryNameLen + extra.length);\r\n\t\t\t\tentry.rawEntryName.copy(postHeader, 0);\r\n\t\t\t\tpostHeader.fill(extra, entryNameLen);\r\n\r\n\t\t\t\tvar dataLength = dataHeader.length + postHeader.length + compressedData.length;\r\n\r\n\t\t\t\tdindex += dataLength;\r\n\r\n\t\t\t\tdataBlock.push(dataHeader);\r\n\t\t\t\tdataBlock.push(postHeader);\r\n\t\t\t\tdataBlock.push(compressedData);\r\n\r\n\t\t\t\tvar entryHeader = entry.packHeader();\r\n\t\t\t\tentryHeaders.push(entryHeader);\r\n\t\t\t\tmainHeader.size += entryHeader.length;\r\n\t\t\t\ttotalSize += (dataLength + entryHeader.length);\r\n\t\t\t});\r\n\r\n\t\t\ttotalSize += mainHeader.mainHeaderSize; // also includes zip file comment length\r\n\t\t\t// point to end of data and beginning of central directory first record\r\n\t\t\tmainHeader.offset = dindex;\r\n\r\n\t\t\tdindex = 0;\r\n\t\t\tvar outBuffer = Buffer.alloc(totalSize);\r\n\t\t\tdataBlock.forEach(function (content) {\r\n\t\t\t\tcontent.copy(outBuffer, dindex); // write data blocks\r\n\t\t\t\tdindex += content.length;\r\n\t\t\t});\r\n\t\t\tentryHeaders.forEach(function (content) {\r\n\t\t\t\tcontent.copy(outBuffer, dindex); // write central directory entries\r\n\t\t\t\tdindex += content.length;\r\n\t\t\t});\r\n\r\n\t\t\tvar mh = mainHeader.toBinary();\r\n\t\t\tif (_comment) {\r\n\t\t\t\tBuffer.from(_comment).copy(mh, Utils.Constants.ENDHDR); // add zip file comment\r\n\t\t\t}\r\n\r\n\t\t\tmh.copy(outBuffer, dindex); // write main header\r\n\r\n\t\t\treturn outBuffer;\r\n\t\t},\r\n\r\n\t\ttoAsyncBuffer: function (/*Function*/onSuccess, /*Function*/onFail, /*Function*/onItemStart, /*Function*/onItemEnd) {\r\n\t\t\tif (!loadedEntries) {\r\n\t\t\t\treadEntries();\r\n\t\t\t}\r\n\t\t\tif (entryList.length > 1) {\r\n\t\t\t\tentryList.sort(function (a, b) {\r\n\t\t\t\t\tvar nameA = a.entryName.toLowerCase();\r\n\t\t\t\t\tvar nameB = b.entryName.toLowerCase();\r\n\t\t\t\t\tif (nameA > nameB) {\r\n\t\t\t\t\t\treturn -1\r\n\t\t\t\t\t}\r\n\t\t\t\t\tif (nameA < nameB) {\r\n\t\t\t\t\t\treturn 1\r\n\t\t\t\t\t}\r\n\t\t\t\t\treturn 0;\r\n\t\t\t\t});\r\n\t\t\t}\r\n\r\n\t\t\tvar totalSize = 0,\r\n\t\t\t\tdataBlock = [],\r\n\t\t\t\tentryHeaders = [],\r\n\t\t\t\tdindex = 0;\r\n\r\n\t\t\tmainHeader.size = 0;\r\n\t\t\tmainHeader.offset = 0;\r\n\r\n\t\t\tvar compress = function (entryList) {\r\n\t\t\t\tvar self = arguments.callee;\r\n\t\t\t\tif (entryList.length) {\r\n\t\t\t\t\tvar entry = entryList.pop();\r\n\t\t\t\t\tvar name = entry.entryName + entry.extra.toString();\r\n\t\t\t\t\tif (onItemStart) onItemStart(name);\r\n\t\t\t\t\tentry.getCompressedDataAsync(function (compressedData) {\r\n\t\t\t\t\t\tif (onItemEnd) onItemEnd(name);\r\n\r\n\t\t\t\t\t\tentry.header.offset = dindex;\r\n\t\t\t\t\t\t// data header\r\n\t\t\t\t\t\tvar dataHeader = entry.header.dataHeaderToBinary();\r\n\t\t\t\t\t\tvar postHeader;\r\n\t\t\t\t\t\ttry {\r\n\t\t\t\t\t\t\tpostHeader = Buffer.alloc(name.length, name);  // using alloc will work on node  5.x+\r\n\t\t\t\t\t\t} catch(e){\r\n\t\t\t\t\t\t\tpostHeader = new Buffer(name); // use deprecated method if alloc fails...\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t\tvar dataLength = dataHeader.length + postHeader.length + compressedData.length;\r\n\r\n\t\t\t\t\t\tdindex += dataLength;\r\n\r\n\t\t\t\t\t\tdataBlock.push(dataHeader);\r\n\t\t\t\t\t\tdataBlock.push(postHeader);\r\n\t\t\t\t\t\tdataBlock.push(compressedData);\r\n\r\n\t\t\t\t\t\tvar entryHeader = entry.packHeader();\r\n\t\t\t\t\t\tentryHeaders.push(entryHeader);\r\n\t\t\t\t\t\tmainHeader.size += entryHeader.length;\r\n\t\t\t\t\t\ttotalSize += (dataLength + entryHeader.length);\r\n\r\n\t\t\t\t\t\tif (entryList.length) {\r\n\t\t\t\t\t\t\tself(entryList);\r\n\t\t\t\t\t\t} else {\r\n\r\n\r\n\t\t\t\t\t\t\ttotalSize += mainHeader.mainHeaderSize; // also includes zip file comment length\r\n\t\t\t\t\t\t\t// point to end of data and beginning of central directory first record\r\n\t\t\t\t\t\t\tmainHeader.offset = dindex;\r\n\r\n\t\t\t\t\t\t\tdindex = 0;\r\n\t\t\t\t\t\t\tvar outBuffer = Buffer.alloc(totalSize);\r\n\t\t\t\t\t\t\tdataBlock.forEach(function (content) {\r\n\t\t\t\t\t\t\t\tcontent.copy(outBuffer, dindex); // write data blocks\r\n\t\t\t\t\t\t\t\tdindex += content.length;\r\n\t\t\t\t\t\t\t});\r\n\t\t\t\t\t\t\tentryHeaders.forEach(function (content) {\r\n\t\t\t\t\t\t\t\tcontent.copy(outBuffer, dindex); // write central directory entries\r\n\t\t\t\t\t\t\t\tdindex += content.length;\r\n\t\t\t\t\t\t\t});\r\n\r\n\t\t\t\t\t\t\tvar mh = mainHeader.toBinary();\r\n\t\t\t\t\t\t\tif (_comment) {\r\n\t\t\t\t\t\t\t\t_comment.copy(mh, Utils.Constants.ENDHDR); // add zip file comment\r\n\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\tmh.copy(outBuffer, dindex); // write main header\r\n\r\n\t\t\t\t\t\t\tonSuccess(outBuffer);\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t});\r\n\t\t\t\t}\r\n\t\t\t};\r\n\r\n\t\t\tcompress(entryList);\r\n\t\t}\r\n\t}\r\n};\r\n\n\n/***/ }),\n\n/***/ 3682:\n/***/ ((module, __unused_webpack_exports, __nccwpck_require__) => {\n\nvar register = __nccwpck_require__(4670)\nvar addHook = __nccwpck_require__(5549)\nvar removeHook = __nccwpck_require__(6819)\n\n// bind with array of arguments: https://stackoverflow.com/a/21792913\nvar bind = Function.bind\nvar bindable = bind.bind(bind)\n\nfunction bindApi (hook, state, name) {\n  var removeHookRef = bindable(removeHook, null).apply(null, name ? [state, name] : [state])\n  hook.api = { remove: removeHookRef }\n  hook.remove = removeHookRef\n\n  ;['before', 'error', 'after', 'wrap'].forEach(function (kind) {\n    var args = name ? [state, kind, name] : [state, kind]\n    hook[kind] = hook.api[kind] = bindable(addHook, null).apply(null, args)\n  })\n}\n\nfunction HookSingular () {\n  var singularHookName = 'h'\n  var singularHookState = {\n    registry: {}\n  }\n  var singularHook = register.bind(null, singularHookState, singularHookName)\n  bindApi(singularHook, singularHookState, singularHookName)\n  return singularHook\n}\n\nfunction HookCollection () {\n  var state = {\n    registry: {}\n  }\n\n  var hook = register.bind(null, state)\n  bindApi(hook, state)\n\n  return hook\n}\n\nvar collectionHookDeprecationMessageDisplayed = false\nfunction Hook () {\n  if (!collectionHookDeprecationMessageDisplayed) {\n    console.warn('[before-after-hook]: \"Hook()\" repurposing warning, use \"Hook.Collection()\". Read more: https://git.io/upgrade-before-after-hook-to-1.4')\n    collectionHookDeprecationMessageDisplayed = true\n  }\n  return HookCollection()\n}\n\nHook.Singular = HookSingular.bind()\nHook.Collection = HookCollection.bind()\n\nmodule.exports = Hook\n// expose constructors as a named property for TypeScript\nmodule.exports.Hook = Hook\nmodule.exports.Singular = Hook.Singular\nmodule.exports.Collection = Hook.Collection\n\n\n/***/ }),\n\n/***/ 5549:\n/***/ ((module) => {\n\nmodule.exports = addHook;\n\nfunction addHook(state, kind, name, hook) {\n  var orig = hook;\n  if (!state.registry[name]) {\n    state.registry[name] = [];\n  }\n\n  if (kind === \"before\") {\n    hook = function (method, options) {\n      return Promise.resolve()\n        .then(orig.bind(null, options))\n        .then(method.bind(null, options));\n    };\n  }\n\n  if (kind === \"after\") {\n    hook = function (method, options) {\n      var result;\n      return Promise.resolve()\n        .then(method.bind(null, options))\n        .then(function (result_) {\n          result = result_;\n          return orig(result, options);\n        })\n        .then(function () {\n          return result;\n        });\n    };\n  }\n\n  if (kind === \"error\") {\n    hook = function (method, options) {\n      return Promise.resolve()\n        .then(method.bind(null, options))\n        .catch(function (error) {\n          return orig(error, options);\n        });\n    };\n  }\n\n  state.registry[name].push({\n    hook: hook,\n    orig: orig,\n  });\n}\n\n\n/***/ }),\n\n/***/ 4670:\n/***/ ((module) => {\n\nmodule.exports = register;\n\nfunction register(state, name, method, options) {\n  if (typeof method !== \"function\") {\n    throw new Error(\"method for before hook must be a function\");\n  }\n\n  if (!options) {\n    options = {};\n  }\n\n  if (Array.isArray(name)) {\n    return name.reverse().reduce(function (callback, name) {\n      return register.bind(null, state, name, callback, options);\n    }, method)();\n  }\n\n  return Promise.resolve().then(function () {\n    if (!state.registry[name]) {\n      return method(options);\n    }\n\n    return state.registry[name].reduce(function (method, registered) {\n      return registered.hook.bind(null, method, options);\n    }, method)();\n  });\n}\n\n\n/***/ }),\n\n/***/ 6819:\n/***/ ((module) => {\n\nmodule.exports = removeHook;\n\nfunction removeHook(state, name, method) {\n  if (!state.registry[name]) {\n    return;\n  }\n\n  var index = state.registry[name]\n    .map(function (registered) {\n      return registered.orig;\n    })\n    .indexOf(method);\n\n  if (index === -1) {\n    return;\n  }\n\n  state.registry[name].splice(index, 1);\n}\n\n\n/***/ }),\n\n/***/ 1174:\n/***/ (function(module) {\n\n/**\n  * This file contains the Bottleneck library (MIT), compiled to ES2017, and without Clustering support.\n  * https://github.com/SGrondin/bottleneck\n  */\n(function (global, factory) {\n\t true ? module.exports = factory() :\n\t0;\n}(this, (function () { 'use strict';\n\n\tvar commonjsGlobal = typeof globalThis !== 'undefined' ? globalThis : typeof window !== 'undefined' ? window : typeof global !== 'undefined' ? global : typeof self !== 'undefined' ? self : {};\n\n\tfunction getCjsExportFromNamespace (n) {\n\t\treturn n && n['default'] || n;\n\t}\n\n\tvar load = function(received, defaults, onto = {}) {\n\t  var k, ref, v;\n\t  for (k in defaults) {\n\t    v = defaults[k];\n\t    onto[k] = (ref = received[k]) != null ? ref : v;\n\t  }\n\t  return onto;\n\t};\n\n\tvar overwrite = function(received, defaults, onto = {}) {\n\t  var k, v;\n\t  for (k in received) {\n\t    v = received[k];\n\t    if (defaults[k] !== void 0) {\n\t      onto[k] = v;\n\t    }\n\t  }\n\t  return onto;\n\t};\n\n\tvar parser = {\n\t\tload: load,\n\t\toverwrite: overwrite\n\t};\n\n\tvar DLList;\n\n\tDLList = class DLList {\n\t  constructor(incr, decr) {\n\t    this.incr = incr;\n\t    this.decr = decr;\n\t    this._first = null;\n\t    this._last = null;\n\t    this.length = 0;\n\t  }\n\n\t  push(value) {\n\t    var node;\n\t    this.length++;\n\t    if (typeof this.incr === \"function\") {\n\t      this.incr();\n\t    }\n\t    node = {\n\t      value,\n\t      prev: this._last,\n\t      next: null\n\t    };\n\t    if (this._last != null) {\n\t      this._last.next = node;\n\t      this._last = node;\n\t    } else {\n\t      this._first = this._last = node;\n\t    }\n\t    return void 0;\n\t  }\n\n\t  shift() {\n\t    var value;\n\t    if (this._first == null) {\n\t      return;\n\t    } else {\n\t      this.length--;\n\t      if (typeof this.decr === \"function\") {\n\t        this.decr();\n\t      }\n\t    }\n\t    value = this._first.value;\n\t    if ((this._first = this._first.next) != null) {\n\t      this._first.prev = null;\n\t    } else {\n\t      this._last = null;\n\t    }\n\t    return value;\n\t  }\n\n\t  first() {\n\t    if (this._first != null) {\n\t      return this._first.value;\n\t    }\n\t  }\n\n\t  getArray() {\n\t    var node, ref, results;\n\t    node = this._first;\n\t    results = [];\n\t    while (node != null) {\n\t      results.push((ref = node, node = node.next, ref.value));\n\t    }\n\t    return results;\n\t  }\n\n\t  forEachShift(cb) {\n\t    var node;\n\t    node = this.shift();\n\t    while (node != null) {\n\t      (cb(node), node = this.shift());\n\t    }\n\t    return void 0;\n\t  }\n\n\t  debug() {\n\t    var node, ref, ref1, ref2, results;\n\t    node = this._first;\n\t    results = [];\n\t    while (node != null) {\n\t      results.push((ref = node, node = node.next, {\n\t        value: ref.value,\n\t        prev: (ref1 = ref.prev) != null ? ref1.value : void 0,\n\t        next: (ref2 = ref.next) != null ? ref2.value : void 0\n\t      }));\n\t    }\n\t    return results;\n\t  }\n\n\t};\n\n\tvar DLList_1 = DLList;\n\n\tvar Events;\n\n\tEvents = class Events {\n\t  constructor(instance) {\n\t    this.instance = instance;\n\t    this._events = {};\n\t    if ((this.instance.on != null) || (this.instance.once != null) || (this.instance.removeAllListeners != null)) {\n\t      throw new Error(\"An Emitter already exists for this object\");\n\t    }\n\t    this.instance.on = (name, cb) => {\n\t      return this._addListener(name, \"many\", cb);\n\t    };\n\t    this.instance.once = (name, cb) => {\n\t      return this._addListener(name, \"once\", cb);\n\t    };\n\t    this.instance.removeAllListeners = (name = null) => {\n\t      if (name != null) {\n\t        return delete this._events[name];\n\t      } else {\n\t        return this._events = {};\n\t      }\n\t    };\n\t  }\n\n\t  _addListener(name, status, cb) {\n\t    var base;\n\t    if ((base = this._events)[name] == null) {\n\t      base[name] = [];\n\t    }\n\t    this._events[name].push({cb, status});\n\t    return this.instance;\n\t  }\n\n\t  listenerCount(name) {\n\t    if (this._events[name] != null) {\n\t      return this._events[name].length;\n\t    } else {\n\t      return 0;\n\t    }\n\t  }\n\n\t  async trigger(name, ...args) {\n\t    var e, promises;\n\t    try {\n\t      if (name !== \"debug\") {\n\t        this.trigger(\"debug\", `Event triggered: ${name}`, args);\n\t      }\n\t      if (this._events[name] == null) {\n\t        return;\n\t      }\n\t      this._events[name] = this._events[name].filter(function(listener) {\n\t        return listener.status !== \"none\";\n\t      });\n\t      promises = this._events[name].map(async(listener) => {\n\t        var e, returned;\n\t        if (listener.status === \"none\") {\n\t          return;\n\t        }\n\t        if (listener.status === \"once\") {\n\t          listener.status = \"none\";\n\t        }\n\t        try {\n\t          returned = typeof listener.cb === \"function\" ? listener.cb(...args) : void 0;\n\t          if (typeof (returned != null ? returned.then : void 0) === \"function\") {\n\t            return (await returned);\n\t          } else {\n\t            return returned;\n\t          }\n\t        } catch (error) {\n\t          e = error;\n\t          {\n\t            this.trigger(\"error\", e);\n\t          }\n\t          return null;\n\t        }\n\t      });\n\t      return ((await Promise.all(promises))).find(function(x) {\n\t        return x != null;\n\t      });\n\t    } catch (error) {\n\t      e = error;\n\t      {\n\t        this.trigger(\"error\", e);\n\t      }\n\t      return null;\n\t    }\n\t  }\n\n\t};\n\n\tvar Events_1 = Events;\n\n\tvar DLList$1, Events$1, Queues;\n\n\tDLList$1 = DLList_1;\n\n\tEvents$1 = Events_1;\n\n\tQueues = class Queues {\n\t  constructor(num_priorities) {\n\t    var i;\n\t    this.Events = new Events$1(this);\n\t    this._length = 0;\n\t    this._lists = (function() {\n\t      var j, ref, results;\n\t      results = [];\n\t      for (i = j = 1, ref = num_priorities; (1 <= ref ? j <= ref : j >= ref); i = 1 <= ref ? ++j : --j) {\n\t        results.push(new DLList$1((() => {\n\t          return this.incr();\n\t        }), (() => {\n\t          return this.decr();\n\t        })));\n\t      }\n\t      return results;\n\t    }).call(this);\n\t  }\n\n\t  incr() {\n\t    if (this._length++ === 0) {\n\t      return this.Events.trigger(\"leftzero\");\n\t    }\n\t  }\n\n\t  decr() {\n\t    if (--this._length === 0) {\n\t      return this.Events.trigger(\"zero\");\n\t    }\n\t  }\n\n\t  push(job) {\n\t    return this._lists[job.options.priority].push(job);\n\t  }\n\n\t  queued(priority) {\n\t    if (priority != null) {\n\t      return this._lists[priority].length;\n\t    } else {\n\t      return this._length;\n\t    }\n\t  }\n\n\t  shiftAll(fn) {\n\t    return this._lists.forEach(function(list) {\n\t      return list.forEachShift(fn);\n\t    });\n\t  }\n\n\t  getFirst(arr = this._lists) {\n\t    var j, len, list;\n\t    for (j = 0, len = arr.length; j < len; j++) {\n\t      list = arr[j];\n\t      if (list.length > 0) {\n\t        return list;\n\t      }\n\t    }\n\t    return [];\n\t  }\n\n\t  shiftLastFrom(priority) {\n\t    return this.getFirst(this._lists.slice(priority).reverse()).shift();\n\t  }\n\n\t};\n\n\tvar Queues_1 = Queues;\n\n\tvar BottleneckError;\n\n\tBottleneckError = class BottleneckError extends Error {};\n\n\tvar BottleneckError_1 = BottleneckError;\n\n\tvar BottleneckError$1, DEFAULT_PRIORITY, Job, NUM_PRIORITIES, parser$1;\n\n\tNUM_PRIORITIES = 10;\n\n\tDEFAULT_PRIORITY = 5;\n\n\tparser$1 = parser;\n\n\tBottleneckError$1 = BottleneckError_1;\n\n\tJob = class Job {\n\t  constructor(task, args, options, jobDefaults, rejectOnDrop, Events, _states, Promise) {\n\t    this.task = task;\n\t    this.args = args;\n\t    this.rejectOnDrop = rejectOnDrop;\n\t    this.Events = Events;\n\t    this._states = _states;\n\t    this.Promise = Promise;\n\t    this.options = parser$1.load(options, jobDefaults);\n\t    this.options.priority = this._sanitizePriority(this.options.priority);\n\t    if (this.options.id === jobDefaults.id) {\n\t      this.options.id = `${this.options.id}-${this._randomIndex()}`;\n\t    }\n\t    this.promise = new this.Promise((_resolve, _reject) => {\n\t      this._resolve = _resolve;\n\t      this._reject = _reject;\n\t    });\n\t    this.retryCount = 0;\n\t  }\n\n\t  _sanitizePriority(priority) {\n\t    var sProperty;\n\t    sProperty = ~~priority !== priority ? DEFAULT_PRIORITY : priority;\n\t    if (sProperty < 0) {\n\t      return 0;\n\t    } else if (sProperty > NUM_PRIORITIES - 1) {\n\t      return NUM_PRIORITIES - 1;\n\t    } else {\n\t      return sProperty;\n\t    }\n\t  }\n\n\t  _randomIndex() {\n\t    return Math.random().toString(36).slice(2);\n\t  }\n\n\t  doDrop({error, message = \"This job has been dropped by Bottleneck\"} = {}) {\n\t    if (this._states.remove(this.options.id)) {\n\t      if (this.rejectOnDrop) {\n\t        this._reject(error != null ? error : new BottleneckError$1(message));\n\t      }\n\t      this.Events.trigger(\"dropped\", {args: this.args, options: this.options, task: this.task, promise: this.promise});\n\t      return true;\n\t    } else {\n\t      return false;\n\t    }\n\t  }\n\n\t  _assertStatus(expected) {\n\t    var status;\n\t    status = this._states.jobStatus(this.options.id);\n\t    if (!(status === expected || (expected === \"DONE\" && status === null))) {\n\t      throw new BottleneckError$1(`Invalid job status ${status}, expected ${expected}. Please open an issue at https://github.com/SGrondin/bottleneck/issues`);\n\t    }\n\t  }\n\n\t  doReceive() {\n\t    this._states.start(this.options.id);\n\t    return this.Events.trigger(\"received\", {args: this.args, options: this.options});\n\t  }\n\n\t  doQueue(reachedHWM, blocked) {\n\t    this._assertStatus(\"RECEIVED\");\n\t    this._states.next(this.options.id);\n\t    return this.Events.trigger(\"queued\", {args: this.args, options: this.options, reachedHWM, blocked});\n\t  }\n\n\t  doRun() {\n\t    if (this.retryCount === 0) {\n\t      this._assertStatus(\"QUEUED\");\n\t      this._states.next(this.options.id);\n\t    } else {\n\t      this._assertStatus(\"EXECUTING\");\n\t    }\n\t    return this.Events.trigger(\"scheduled\", {args: this.args, options: this.options});\n\t  }\n\n\t  async doExecute(chained, clearGlobalState, run, free) {\n\t    var error, eventInfo, passed;\n\t    if (this.retryCount === 0) {\n\t      this._assertStatus(\"RUNNING\");\n\t      this._states.next(this.options.id);\n\t    } else {\n\t      this._assertStatus(\"EXECUTING\");\n\t    }\n\t    eventInfo = {args: this.args, options: this.options, retryCount: this.retryCount};\n\t    this.Events.trigger(\"executing\", eventInfo);\n\t    try {\n\t      passed = (await (chained != null ? chained.schedule(this.options, this.task, ...this.args) : this.task(...this.args)));\n\t      if (clearGlobalState()) {\n\t        this.doDone(eventInfo);\n\t        await free(this.options, eventInfo);\n\t        this._assertStatus(\"DONE\");\n\t        return this._resolve(passed);\n\t      }\n\t    } catch (error1) {\n\t      error = error1;\n\t      return this._onFailure(error, eventInfo, clearGlobalState, run, free);\n\t    }\n\t  }\n\n\t  doExpire(clearGlobalState, run, free) {\n\t    var error, eventInfo;\n\t    if (this._states.jobStatus(this.options.id === \"RUNNING\")) {\n\t      this._states.next(this.options.id);\n\t    }\n\t    this._assertStatus(\"EXECUTING\");\n\t    eventInfo = {args: this.args, options: this.options, retryCount: this.retryCount};\n\t    error = new BottleneckError$1(`This job timed out after ${this.options.expiration} ms.`);\n\t    return this._onFailure(error, eventInfo, clearGlobalState, run, free);\n\t  }\n\n\t  async _onFailure(error, eventInfo, clearGlobalState, run, free) {\n\t    var retry, retryAfter;\n\t    if (clearGlobalState()) {\n\t      retry = (await this.Events.trigger(\"failed\", error, eventInfo));\n\t      if (retry != null) {\n\t        retryAfter = ~~retry;\n\t        this.Events.trigger(\"retry\", `Retrying ${this.options.id} after ${retryAfter} ms`, eventInfo);\n\t        this.retryCount++;\n\t        return run(retryAfter);\n\t      } else {\n\t        this.doDone(eventInfo);\n\t        await free(this.options, eventInfo);\n\t        this._assertStatus(\"DONE\");\n\t        return this._reject(error);\n\t      }\n\t    }\n\t  }\n\n\t  doDone(eventInfo) {\n\t    this._assertStatus(\"EXECUTING\");\n\t    this._states.next(this.options.id);\n\t    return this.Events.trigger(\"done\", eventInfo);\n\t  }\n\n\t};\n\n\tvar Job_1 = Job;\n\n\tvar BottleneckError$2, LocalDatastore, parser$2;\n\n\tparser$2 = parser;\n\n\tBottleneckError$2 = BottleneckError_1;\n\n\tLocalDatastore = class LocalDatastore {\n\t  constructor(instance, storeOptions, storeInstanceOptions) {\n\t    this.instance = instance;\n\t    this.storeOptions = storeOptions;\n\t    this.clientId = this.instance._randomIndex();\n\t    parser$2.load(storeInstanceOptions, storeInstanceOptions, this);\n\t    this._nextRequest = this._lastReservoirRefresh = this._lastReservoirIncrease = Date.now();\n\t    this._running = 0;\n\t    this._done = 0;\n\t    this._unblockTime = 0;\n\t    this.ready = this.Promise.resolve();\n\t    this.clients = {};\n\t    this._startHeartbeat();\n\t  }\n\n\t  _startHeartbeat() {\n\t    var base;\n\t    if ((this.heartbeat == null) && (((this.storeOptions.reservoirRefreshInterval != null) && (this.storeOptions.reservoirRefreshAmount != null)) || ((this.storeOptions.reservoirIncreaseInterval != null) && (this.storeOptions.reservoirIncreaseAmount != null)))) {\n\t      return typeof (base = (this.heartbeat = setInterval(() => {\n\t        var amount, incr, maximum, now, reservoir;\n\t        now = Date.now();\n\t        if ((this.storeOptions.reservoirRefreshInterval != null) && now >= this._lastReservoirRefresh + this.storeOptions.reservoirRefreshInterval) {\n\t          this._lastReservoirRefresh = now;\n\t          this.storeOptions.reservoir = this.storeOptions.reservoirRefreshAmount;\n\t          this.instance._drainAll(this.computeCapacity());\n\t        }\n\t        if ((this.storeOptions.reservoirIncreaseInterval != null) && now >= this._lastReservoirIncrease + this.storeOptions.reservoirIncreaseInterval) {\n\t          ({\n\t            reservoirIncreaseAmount: amount,\n\t            reservoirIncreaseMaximum: maximum,\n\t            reservoir\n\t          } = this.storeOptions);\n\t          this._lastReservoirIncrease = now;\n\t          incr = maximum != null ? Math.min(amount, maximum - reservoir) : amount;\n\t          if (incr > 0) {\n\t            this.storeOptions.reservoir += incr;\n\t            return this.instance._drainAll(this.computeCapacity());\n\t          }\n\t        }\n\t      }, this.heartbeatInterval))).unref === \"function\" ? base.unref() : void 0;\n\t    } else {\n\t      return clearInterval(this.heartbeat);\n\t    }\n\t  }\n\n\t  async __publish__(message) {\n\t    await this.yieldLoop();\n\t    return this.instance.Events.trigger(\"message\", message.toString());\n\t  }\n\n\t  async __disconnect__(flush) {\n\t    await this.yieldLoop();\n\t    clearInterval(this.heartbeat);\n\t    return this.Promise.resolve();\n\t  }\n\n\t  yieldLoop(t = 0) {\n\t    return new this.Promise(function(resolve, reject) {\n\t      return setTimeout(resolve, t);\n\t    });\n\t  }\n\n\t  computePenalty() {\n\t    var ref;\n\t    return (ref = this.storeOptions.penalty) != null ? ref : (15 * this.storeOptions.minTime) || 5000;\n\t  }\n\n\t  async __updateSettings__(options) {\n\t    await this.yieldLoop();\n\t    parser$2.overwrite(options, options, this.storeOptions);\n\t    this._startHeartbeat();\n\t    this.instance._drainAll(this.computeCapacity());\n\t    return true;\n\t  }\n\n\t  async __running__() {\n\t    await this.yieldLoop();\n\t    return this._running;\n\t  }\n\n\t  async __queued__() {\n\t    await this.yieldLoop();\n\t    return this.instance.queued();\n\t  }\n\n\t  async __done__() {\n\t    await this.yieldLoop();\n\t    return this._done;\n\t  }\n\n\t  async __groupCheck__(time) {\n\t    await this.yieldLoop();\n\t    return (this._nextRequest + this.timeout) < time;\n\t  }\n\n\t  computeCapacity() {\n\t    var maxConcurrent, reservoir;\n\t    ({maxConcurrent, reservoir} = this.storeOptions);\n\t    if ((maxConcurrent != null) && (reservoir != null)) {\n\t      return Math.min(maxConcurrent - this._running, reservoir);\n\t    } else if (maxConcurrent != null) {\n\t      return maxConcurrent - this._running;\n\t    } else if (reservoir != null) {\n\t      return reservoir;\n\t    } else {\n\t      return null;\n\t    }\n\t  }\n\n\t  conditionsCheck(weight) {\n\t    var capacity;\n\t    capacity = this.computeCapacity();\n\t    return (capacity == null) || weight <= capacity;\n\t  }\n\n\t  async __incrementReservoir__(incr) {\n\t    var reservoir;\n\t    await this.yieldLoop();\n\t    reservoir = this.storeOptions.reservoir += incr;\n\t    this.instance._drainAll(this.computeCapacity());\n\t    return reservoir;\n\t  }\n\n\t  async __currentReservoir__() {\n\t    await this.yieldLoop();\n\t    return this.storeOptions.reservoir;\n\t  }\n\n\t  isBlocked(now) {\n\t    return this._unblockTime >= now;\n\t  }\n\n\t  check(weight, now) {\n\t    return this.conditionsCheck(weight) && (this._nextRequest - now) <= 0;\n\t  }\n\n\t  async __check__(weight) {\n\t    var now;\n\t    await this.yieldLoop();\n\t    now = Date.now();\n\t    return this.check(weight, now);\n\t  }\n\n\t  async __register__(index, weight, expiration) {\n\t    var now, wait;\n\t    await this.yieldLoop();\n\t    now = Date.now();\n\t    if (this.conditionsCheck(weight)) {\n\t      this._running += weight;\n\t      if (this.storeOptions.reservoir != null) {\n\t        this.storeOptions.reservoir -= weight;\n\t      }\n\t      wait = Math.max(this._nextRequest - now, 0);\n\t      this._nextRequest = now + wait + this.storeOptions.minTime;\n\t      return {\n\t        success: true,\n\t        wait,\n\t        reservoir: this.storeOptions.reservoir\n\t      };\n\t    } else {\n\t      return {\n\t        success: false\n\t      };\n\t    }\n\t  }\n\n\t  strategyIsBlock() {\n\t    return this.storeOptions.strategy === 3;\n\t  }\n\n\t  async __submit__(queueLength, weight) {\n\t    var blocked, now, reachedHWM;\n\t    await this.yieldLoop();\n\t    if ((this.storeOptions.maxConcurrent != null) && weight > this.storeOptions.maxConcurrent) {\n\t      throw new BottleneckError$2(`Impossible to add a job having a weight of ${weight} to a limiter having a maxConcurrent setting of ${this.storeOptions.maxConcurrent}`);\n\t    }\n\t    now = Date.now();\n\t    reachedHWM = (this.storeOptions.highWater != null) && queueLength === this.storeOptions.highWater && !this.check(weight, now);\n\t    blocked = this.strategyIsBlock() && (reachedHWM || this.isBlocked(now));\n\t    if (blocked) {\n\t      this._unblockTime = now + this.computePenalty();\n\t      this._nextRequest = this._unblockTime + this.storeOptions.minTime;\n\t      this.instance._dropAllQueued();\n\t    }\n\t    return {\n\t      reachedHWM,\n\t      blocked,\n\t      strategy: this.storeOptions.strategy\n\t    };\n\t  }\n\n\t  async __free__(index, weight) {\n\t    await this.yieldLoop();\n\t    this._running -= weight;\n\t    this._done += weight;\n\t    this.instance._drainAll(this.computeCapacity());\n\t    return {\n\t      running: this._running\n\t    };\n\t  }\n\n\t};\n\n\tvar LocalDatastore_1 = LocalDatastore;\n\n\tvar BottleneckError$3, States;\n\n\tBottleneckError$3 = BottleneckError_1;\n\n\tStates = class States {\n\t  constructor(status1) {\n\t    this.status = status1;\n\t    this._jobs = {};\n\t    this.counts = this.status.map(function() {\n\t      return 0;\n\t    });\n\t  }\n\n\t  next(id) {\n\t    var current, next;\n\t    current = this._jobs[id];\n\t    next = current + 1;\n\t    if ((current != null) && next < this.status.length) {\n\t      this.counts[current]--;\n\t      this.counts[next]++;\n\t      return this._jobs[id]++;\n\t    } else if (current != null) {\n\t      this.counts[current]--;\n\t      return delete this._jobs[id];\n\t    }\n\t  }\n\n\t  start(id) {\n\t    var initial;\n\t    initial = 0;\n\t    this._jobs[id] = initial;\n\t    return this.counts[initial]++;\n\t  }\n\n\t  remove(id) {\n\t    var current;\n\t    current = this._jobs[id];\n\t    if (current != null) {\n\t      this.counts[current]--;\n\t      delete this._jobs[id];\n\t    }\n\t    return current != null;\n\t  }\n\n\t  jobStatus(id) {\n\t    var ref;\n\t    return (ref = this.status[this._jobs[id]]) != null ? ref : null;\n\t  }\n\n\t  statusJobs(status) {\n\t    var k, pos, ref, results, v;\n\t    if (status != null) {\n\t      pos = this.status.indexOf(status);\n\t      if (pos < 0) {\n\t        throw new BottleneckError$3(`status must be one of ${this.status.join(', ')}`);\n\t      }\n\t      ref = this._jobs;\n\t      results = [];\n\t      for (k in ref) {\n\t        v = ref[k];\n\t        if (v === pos) {\n\t          results.push(k);\n\t        }\n\t      }\n\t      return results;\n\t    } else {\n\t      return Object.keys(this._jobs);\n\t    }\n\t  }\n\n\t  statusCounts() {\n\t    return this.counts.reduce(((acc, v, i) => {\n\t      acc[this.status[i]] = v;\n\t      return acc;\n\t    }), {});\n\t  }\n\n\t};\n\n\tvar States_1 = States;\n\n\tvar DLList$2, Sync;\n\n\tDLList$2 = DLList_1;\n\n\tSync = class Sync {\n\t  constructor(name, Promise) {\n\t    this.schedule = this.schedule.bind(this);\n\t    this.name = name;\n\t    this.Promise = Promise;\n\t    this._running = 0;\n\t    this._queue = new DLList$2();\n\t  }\n\n\t  isEmpty() {\n\t    return this._queue.length === 0;\n\t  }\n\n\t  async _tryToRun() {\n\t    var args, cb, error, reject, resolve, returned, task;\n\t    if ((this._running < 1) && this._queue.length > 0) {\n\t      this._running++;\n\t      ({task, args, resolve, reject} = this._queue.shift());\n\t      cb = (await (async function() {\n\t        try {\n\t          returned = (await task(...args));\n\t          return function() {\n\t            return resolve(returned);\n\t          };\n\t        } catch (error1) {\n\t          error = error1;\n\t          return function() {\n\t            return reject(error);\n\t          };\n\t        }\n\t      })());\n\t      this._running--;\n\t      this._tryToRun();\n\t      return cb();\n\t    }\n\t  }\n\n\t  schedule(task, ...args) {\n\t    var promise, reject, resolve;\n\t    resolve = reject = null;\n\t    promise = new this.Promise(function(_resolve, _reject) {\n\t      resolve = _resolve;\n\t      return reject = _reject;\n\t    });\n\t    this._queue.push({task, args, resolve, reject});\n\t    this._tryToRun();\n\t    return promise;\n\t  }\n\n\t};\n\n\tvar Sync_1 = Sync;\n\n\tvar version = \"2.19.5\";\n\tvar version$1 = {\n\t\tversion: version\n\t};\n\n\tvar version$2 = /*#__PURE__*/Object.freeze({\n\t\tversion: version,\n\t\tdefault: version$1\n\t});\n\n\tvar require$$2 = () => console.log('You must import the full version of Bottleneck in order to use this feature.');\n\n\tvar require$$3 = () => console.log('You must import the full version of Bottleneck in order to use this feature.');\n\n\tvar require$$4 = () => console.log('You must import the full version of Bottleneck in order to use this feature.');\n\n\tvar Events$2, Group, IORedisConnection$1, RedisConnection$1, Scripts$1, parser$3;\n\n\tparser$3 = parser;\n\n\tEvents$2 = Events_1;\n\n\tRedisConnection$1 = require$$2;\n\n\tIORedisConnection$1 = require$$3;\n\n\tScripts$1 = require$$4;\n\n\tGroup = (function() {\n\t  class Group {\n\t    constructor(limiterOptions = {}) {\n\t      this.deleteKey = this.deleteKey.bind(this);\n\t      this.limiterOptions = limiterOptions;\n\t      parser$3.load(this.limiterOptions, this.defaults, this);\n\t      this.Events = new Events$2(this);\n\t      this.instances = {};\n\t      this.Bottleneck = Bottleneck_1;\n\t      this._startAutoCleanup();\n\t      this.sharedConnection = this.connection != null;\n\t      if (this.connection == null) {\n\t        if (this.limiterOptions.datastore === \"redis\") {\n\t          this.connection = new RedisConnection$1(Object.assign({}, this.limiterOptions, {Events: this.Events}));\n\t        } else if (this.limiterOptions.datastore === \"ioredis\") {\n\t          this.connection = new IORedisConnection$1(Object.assign({}, this.limiterOptions, {Events: this.Events}));\n\t        }\n\t      }\n\t    }\n\n\t    key(key = \"\") {\n\t      var ref;\n\t      return (ref = this.instances[key]) != null ? ref : (() => {\n\t        var limiter;\n\t        limiter = this.instances[key] = new this.Bottleneck(Object.assign(this.limiterOptions, {\n\t          id: `${this.id}-${key}`,\n\t          timeout: this.timeout,\n\t          connection: this.connection\n\t        }));\n\t        this.Events.trigger(\"created\", limiter, key);\n\t        return limiter;\n\t      })();\n\t    }\n\n\t    async deleteKey(key = \"\") {\n\t      var deleted, instance;\n\t      instance = this.instances[key];\n\t      if (this.connection) {\n\t        deleted = (await this.connection.__runCommand__(['del', ...Scripts$1.allKeys(`${this.id}-${key}`)]));\n\t      }\n\t      if (instance != null) {\n\t        delete this.instances[key];\n\t        await instance.disconnect();\n\t      }\n\t      return (instance != null) || deleted > 0;\n\t    }\n\n\t    limiters() {\n\t      var k, ref, results, v;\n\t      ref = this.instances;\n\t      results = [];\n\t      for (k in ref) {\n\t        v = ref[k];\n\t        results.push({\n\t          key: k,\n\t          limiter: v\n\t        });\n\t      }\n\t      return results;\n\t    }\n\n\t    keys() {\n\t      return Object.keys(this.instances);\n\t    }\n\n\t    async clusterKeys() {\n\t      var cursor, end, found, i, k, keys, len, next, start;\n\t      if (this.connection == null) {\n\t        return this.Promise.resolve(this.keys());\n\t      }\n\t      keys = [];\n\t      cursor = null;\n\t      start = `b_${this.id}-`.length;\n\t      end = \"_settings\".length;\n\t      while (cursor !== 0) {\n\t        [next, found] = (await this.connection.__runCommand__([\"scan\", cursor != null ? cursor : 0, \"match\", `b_${this.id}-*_settings`, \"count\", 10000]));\n\t        cursor = ~~next;\n\t        for (i = 0, len = found.length; i < len; i++) {\n\t          k = found[i];\n\t          keys.push(k.slice(start, -end));\n\t        }\n\t      }\n\t      return keys;\n\t    }\n\n\t    _startAutoCleanup() {\n\t      var base;\n\t      clearInterval(this.interval);\n\t      return typeof (base = (this.interval = setInterval(async() => {\n\t        var e, k, ref, results, time, v;\n\t        time = Date.now();\n\t        ref = this.instances;\n\t        results = [];\n\t        for (k in ref) {\n\t          v = ref[k];\n\t          try {\n\t            if ((await v._store.__groupCheck__(time))) {\n\t              results.push(this.deleteKey(k));\n\t            } else {\n\t              results.push(void 0);\n\t            }\n\t          } catch (error) {\n\t            e = error;\n\t            results.push(v.Events.trigger(\"error\", e));\n\t          }\n\t        }\n\t        return results;\n\t      }, this.timeout / 2))).unref === \"function\" ? base.unref() : void 0;\n\t    }\n\n\t    updateSettings(options = {}) {\n\t      parser$3.overwrite(options, this.defaults, this);\n\t      parser$3.overwrite(options, options, this.limiterOptions);\n\t      if (options.timeout != null) {\n\t        return this._startAutoCleanup();\n\t      }\n\t    }\n\n\t    disconnect(flush = true) {\n\t      var ref;\n\t      if (!this.sharedConnection) {\n\t        return (ref = this.connection) != null ? ref.disconnect(flush) : void 0;\n\t      }\n\t    }\n\n\t  }\n\t  Group.prototype.defaults = {\n\t    timeout: 1000 * 60 * 5,\n\t    connection: null,\n\t    Promise: Promise,\n\t    id: \"group-key\"\n\t  };\n\n\t  return Group;\n\n\t}).call(commonjsGlobal);\n\n\tvar Group_1 = Group;\n\n\tvar Batcher, Events$3, parser$4;\n\n\tparser$4 = parser;\n\n\tEvents$3 = Events_1;\n\n\tBatcher = (function() {\n\t  class Batcher {\n\t    constructor(options = {}) {\n\t      this.options = options;\n\t      parser$4.load(this.options, this.defaults, this);\n\t      this.Events = new Events$3(this);\n\t      this._arr = [];\n\t      this._resetPromise();\n\t      this._lastFlush = Date.now();\n\t    }\n\n\t    _resetPromise() {\n\t      return this._promise = new this.Promise((res, rej) => {\n\t        return this._resolve = res;\n\t      });\n\t    }\n\n\t    _flush() {\n\t      clearTimeout(this._timeout);\n\t      this._lastFlush = Date.now();\n\t      this._resolve();\n\t      this.Events.trigger(\"batch\", this._arr);\n\t      this._arr = [];\n\t      return this._resetPromise();\n\t    }\n\n\t    add(data) {\n\t      var ret;\n\t      this._arr.push(data);\n\t      ret = this._promise;\n\t      if (this._arr.length === this.maxSize) {\n\t        this._flush();\n\t      } else if ((this.maxTime != null) && this._arr.length === 1) {\n\t        this._timeout = setTimeout(() => {\n\t          return this._flush();\n\t        }, this.maxTime);\n\t      }\n\t      return ret;\n\t    }\n\n\t  }\n\t  Batcher.prototype.defaults = {\n\t    maxTime: null,\n\t    maxSize: null,\n\t    Promise: Promise\n\t  };\n\n\t  return Batcher;\n\n\t}).call(commonjsGlobal);\n\n\tvar Batcher_1 = Batcher;\n\n\tvar require$$4$1 = () => console.log('You must import the full version of Bottleneck in order to use this feature.');\n\n\tvar require$$8 = getCjsExportFromNamespace(version$2);\n\n\tvar Bottleneck, DEFAULT_PRIORITY$1, Events$4, Job$1, LocalDatastore$1, NUM_PRIORITIES$1, Queues$1, RedisDatastore$1, States$1, Sync$1, parser$5,\n\t  splice = [].splice;\n\n\tNUM_PRIORITIES$1 = 10;\n\n\tDEFAULT_PRIORITY$1 = 5;\n\n\tparser$5 = parser;\n\n\tQueues$1 = Queues_1;\n\n\tJob$1 = Job_1;\n\n\tLocalDatastore$1 = LocalDatastore_1;\n\n\tRedisDatastore$1 = require$$4$1;\n\n\tEvents$4 = Events_1;\n\n\tStates$1 = States_1;\n\n\tSync$1 = Sync_1;\n\n\tBottleneck = (function() {\n\t  class Bottleneck {\n\t    constructor(options = {}, ...invalid) {\n\t      var storeInstanceOptions, storeOptions;\n\t      this._addToQueue = this._addToQueue.bind(this);\n\t      this._validateOptions(options, invalid);\n\t      parser$5.load(options, this.instanceDefaults, this);\n\t      this._queues = new Queues$1(NUM_PRIORITIES$1);\n\t      this._scheduled = {};\n\t      this._states = new States$1([\"RECEIVED\", \"QUEUED\", \"RUNNING\", \"EXECUTING\"].concat(this.trackDoneStatus ? [\"DONE\"] : []));\n\t      this._limiter = null;\n\t      this.Events = new Events$4(this);\n\t      this._submitLock = new Sync$1(\"submit\", this.Promise);\n\t      this._registerLock = new Sync$1(\"register\", this.Promise);\n\t      storeOptions = parser$5.load(options, this.storeDefaults, {});\n\t      this._store = (function() {\n\t        if (this.datastore === \"redis\" || this.datastore === \"ioredis\" || (this.connection != null)) {\n\t          storeInstanceOptions = parser$5.load(options, this.redisStoreDefaults, {});\n\t          return new RedisDatastore$1(this, storeOptions, storeInstanceOptions);\n\t        } else if (this.datastore === \"local\") {\n\t          storeInstanceOptions = parser$5.load(options, this.localStoreDefaults, {});\n\t          return new LocalDatastore$1(this, storeOptions, storeInstanceOptions);\n\t        } else {\n\t          throw new Bottleneck.prototype.BottleneckError(`Invalid datastore type: ${this.datastore}`);\n\t        }\n\t      }).call(this);\n\t      this._queues.on(\"leftzero\", () => {\n\t        var ref;\n\t        return (ref = this._store.heartbeat) != null ? typeof ref.ref === \"function\" ? ref.ref() : void 0 : void 0;\n\t      });\n\t      this._queues.on(\"zero\", () => {\n\t        var ref;\n\t        return (ref = this._store.heartbeat) != null ? typeof ref.unref === \"function\" ? ref.unref() : void 0 : void 0;\n\t      });\n\t    }\n\n\t    _validateOptions(options, invalid) {\n\t      if (!((options != null) && typeof options === \"object\" && invalid.length === 0)) {\n\t        throw new Bottleneck.prototype.BottleneckError(\"Bottleneck v2 takes a single object argument. Refer to https://github.com/SGrondin/bottleneck#upgrading-to-v2 if you're upgrading from Bottleneck v1.\");\n\t      }\n\t    }\n\n\t    ready() {\n\t      return this._store.ready;\n\t    }\n\n\t    clients() {\n\t      return this._store.clients;\n\t    }\n\n\t    channel() {\n\t      return `b_${this.id}`;\n\t    }\n\n\t    channel_client() {\n\t      return `b_${this.id}_${this._store.clientId}`;\n\t    }\n\n\t    publish(message) {\n\t      return this._store.__publish__(message);\n\t    }\n\n\t    disconnect(flush = true) {\n\t      return this._store.__disconnect__(flush);\n\t    }\n\n\t    chain(_limiter) {\n\t      this._limiter = _limiter;\n\t      return this;\n\t    }\n\n\t    queued(priority) {\n\t      return this._queues.queued(priority);\n\t    }\n\n\t    clusterQueued() {\n\t      return this._store.__queued__();\n\t    }\n\n\t    empty() {\n\t      return this.queued() === 0 && this._submitLock.isEmpty();\n\t    }\n\n\t    running() {\n\t      return this._store.__running__();\n\t    }\n\n\t    done() {\n\t      return this._store.__done__();\n\t    }\n\n\t    jobStatus(id) {\n\t      return this._states.jobStatus(id);\n\t    }\n\n\t    jobs(status) {\n\t      return this._states.statusJobs(status);\n\t    }\n\n\t    counts() {\n\t      return this._states.statusCounts();\n\t    }\n\n\t    _randomIndex() {\n\t      return Math.random().toString(36).slice(2);\n\t    }\n\n\t    check(weight = 1) {\n\t      return this._store.__check__(weight);\n\t    }\n\n\t    _clearGlobalState(index) {\n\t      if (this._scheduled[index] != null) {\n\t        clearTimeout(this._scheduled[index].expiration);\n\t        delete this._scheduled[index];\n\t        return true;\n\t      } else {\n\t        return false;\n\t      }\n\t    }\n\n\t    async _free(index, job, options, eventInfo) {\n\t      var e, running;\n\t      try {\n\t        ({running} = (await this._store.__free__(index, options.weight)));\n\t        this.Events.trigger(\"debug\", `Freed ${options.id}`, eventInfo);\n\t        if (running === 0 && this.empty()) {\n\t          return this.Events.trigger(\"idle\");\n\t        }\n\t      } catch (error1) {\n\t        e = error1;\n\t        return this.Events.trigger(\"error\", e);\n\t      }\n\t    }\n\n\t    _run(index, job, wait) {\n\t      var clearGlobalState, free, run;\n\t      job.doRun();\n\t      clearGlobalState = this._clearGlobalState.bind(this, index);\n\t      run = this._run.bind(this, index, job);\n\t      free = this._free.bind(this, index, job);\n\t      return this._scheduled[index] = {\n\t        timeout: setTimeout(() => {\n\t          return job.doExecute(this._limiter, clearGlobalState, run, free);\n\t        }, wait),\n\t        expiration: job.options.expiration != null ? setTimeout(function() {\n\t          return job.doExpire(clearGlobalState, run, free);\n\t        }, wait + job.options.expiration) : void 0,\n\t        job: job\n\t      };\n\t    }\n\n\t    _drainOne(capacity) {\n\t      return this._registerLock.schedule(() => {\n\t        var args, index, next, options, queue;\n\t        if (this.queued() === 0) {\n\t          return this.Promise.resolve(null);\n\t        }\n\t        queue = this._queues.getFirst();\n\t        ({options, args} = next = queue.first());\n\t        if ((capacity != null) && options.weight > capacity) {\n\t          return this.Promise.resolve(null);\n\t        }\n\t        this.Events.trigger(\"debug\", `Draining ${options.id}`, {args, options});\n\t        index = this._randomIndex();\n\t        return this._store.__register__(index, options.weight, options.expiration).then(({success, wait, reservoir}) => {\n\t          var empty;\n\t          this.Events.trigger(\"debug\", `Drained ${options.id}`, {success, args, options});\n\t          if (success) {\n\t            queue.shift();\n\t            empty = this.empty();\n\t            if (empty) {\n\t              this.Events.trigger(\"empty\");\n\t            }\n\t            if (reservoir === 0) {\n\t              this.Events.trigger(\"depleted\", empty);\n\t            }\n\t            this._run(index, next, wait);\n\t            return this.Promise.resolve(options.weight);\n\t          } else {\n\t            return this.Promise.resolve(null);\n\t          }\n\t        });\n\t      });\n\t    }\n\n\t    _drainAll(capacity, total = 0) {\n\t      return this._drainOne(capacity).then((drained) => {\n\t        var newCapacity;\n\t        if (drained != null) {\n\t          newCapacity = capacity != null ? capacity - drained : capacity;\n\t          return this._drainAll(newCapacity, total + drained);\n\t        } else {\n\t          return this.Promise.resolve(total);\n\t        }\n\t      }).catch((e) => {\n\t        return this.Events.trigger(\"error\", e);\n\t      });\n\t    }\n\n\t    _dropAllQueued(message) {\n\t      return this._queues.shiftAll(function(job) {\n\t        return job.doDrop({message});\n\t      });\n\t    }\n\n\t    stop(options = {}) {\n\t      var done, waitForExecuting;\n\t      options = parser$5.load(options, this.stopDefaults);\n\t      waitForExecuting = (at) => {\n\t        var finished;\n\t        finished = () => {\n\t          var counts;\n\t          counts = this._states.counts;\n\t          return (counts[0] + counts[1] + counts[2] + counts[3]) === at;\n\t        };\n\t        return new this.Promise((resolve, reject) => {\n\t          if (finished()) {\n\t            return resolve();\n\t          } else {\n\t            return this.on(\"done\", () => {\n\t              if (finished()) {\n\t                this.removeAllListeners(\"done\");\n\t                return resolve();\n\t              }\n\t            });\n\t          }\n\t        });\n\t      };\n\t      done = options.dropWaitingJobs ? (this._run = function(index, next) {\n\t        return next.doDrop({\n\t          message: options.dropErrorMessage\n\t        });\n\t      }, this._drainOne = () => {\n\t        return this.Promise.resolve(null);\n\t      }, this._registerLock.schedule(() => {\n\t        return this._submitLock.schedule(() => {\n\t          var k, ref, v;\n\t          ref = this._scheduled;\n\t          for (k in ref) {\n\t            v = ref[k];\n\t            if (this.jobStatus(v.job.options.id) === \"RUNNING\") {\n\t              clearTimeout(v.timeout);\n\t              clearTimeout(v.expiration);\n\t              v.job.doDrop({\n\t                message: options.dropErrorMessage\n\t              });\n\t            }\n\t          }\n\t          this._dropAllQueued(options.dropErrorMessage);\n\t          return waitForExecuting(0);\n\t        });\n\t      })) : this.schedule({\n\t        priority: NUM_PRIORITIES$1 - 1,\n\t        weight: 0\n\t      }, () => {\n\t        return waitForExecuting(1);\n\t      });\n\t      this._receive = function(job) {\n\t        return job._reject(new Bottleneck.prototype.BottleneckError(options.enqueueErrorMessage));\n\t      };\n\t      this.stop = () => {\n\t        return this.Promise.reject(new Bottleneck.prototype.BottleneckError(\"stop() has already been called\"));\n\t      };\n\t      return done;\n\t    }\n\n\t    async _addToQueue(job) {\n\t      var args, blocked, error, options, reachedHWM, shifted, strategy;\n\t      ({args, options} = job);\n\t      try {\n\t        ({reachedHWM, blocked, strategy} = (await this._store.__submit__(this.queued(), options.weight)));\n\t      } catch (error1) {\n\t        error = error1;\n\t        this.Events.trigger(\"debug\", `Could not queue ${options.id}`, {args, options, error});\n\t        job.doDrop({error});\n\t        return false;\n\t      }\n\t      if (blocked) {\n\t        job.doDrop();\n\t        return true;\n\t      } else if (reachedHWM) {\n\t        shifted = strategy === Bottleneck.prototype.strategy.LEAK ? this._queues.shiftLastFrom(options.priority) : strategy === Bottleneck.prototype.strategy.OVERFLOW_PRIORITY ? this._queues.shiftLastFrom(options.priority + 1) : strategy === Bottleneck.prototype.strategy.OVERFLOW ? job : void 0;\n\t        if (shifted != null) {\n\t          shifted.doDrop();\n\t        }\n\t        if ((shifted == null) || strategy === Bottleneck.prototype.strategy.OVERFLOW) {\n\t          if (shifted == null) {\n\t            job.doDrop();\n\t          }\n\t          return reachedHWM;\n\t        }\n\t      }\n\t      job.doQueue(reachedHWM, blocked);\n\t      this._queues.push(job);\n\t      await this._drainAll();\n\t      return reachedHWM;\n\t    }\n\n\t    _receive(job) {\n\t      if (this._states.jobStatus(job.options.id) != null) {\n\t        job._reject(new Bottleneck.prototype.BottleneckError(`A job with the same id already exists (id=${job.options.id})`));\n\t        return false;\n\t      } else {\n\t        job.doReceive();\n\t        return this._submitLock.schedule(this._addToQueue, job);\n\t      }\n\t    }\n\n\t    submit(...args) {\n\t      var cb, fn, job, options, ref, ref1, task;\n\t      if (typeof args[0] === \"function\") {\n\t        ref = args, [fn, ...args] = ref, [cb] = splice.call(args, -1);\n\t        options = parser$5.load({}, this.jobDefaults);\n\t      } else {\n\t        ref1 = args, [options, fn, ...args] = ref1, [cb] = splice.call(args, -1);\n\t        options = parser$5.load(options, this.jobDefaults);\n\t      }\n\t      task = (...args) => {\n\t        return new this.Promise(function(resolve, reject) {\n\t          return fn(...args, function(...args) {\n\t            return (args[0] != null ? reject : resolve)(args);\n\t          });\n\t        });\n\t      };\n\t      job = new Job$1(task, args, options, this.jobDefaults, this.rejectOnDrop, this.Events, this._states, this.Promise);\n\t      job.promise.then(function(args) {\n\t        return typeof cb === \"function\" ? cb(...args) : void 0;\n\t      }).catch(function(args) {\n\t        if (Array.isArray(args)) {\n\t          return typeof cb === \"function\" ? cb(...args) : void 0;\n\t        } else {\n\t          return typeof cb === \"function\" ? cb(args) : void 0;\n\t        }\n\t      });\n\t      return this._receive(job);\n\t    }\n\n\t    schedule(...args) {\n\t      var job, options, task;\n\t      if (typeof args[0] === \"function\") {\n\t        [task, ...args] = args;\n\t        options = {};\n\t      } else {\n\t        [options, task, ...args] = args;\n\t      }\n\t      job = new Job$1(task, args, options, this.jobDefaults, this.rejectOnDrop, this.Events, this._states, this.Promise);\n\t      this._receive(job);\n\t      return job.promise;\n\t    }\n\n\t    wrap(fn) {\n\t      var schedule, wrapped;\n\t      schedule = this.schedule.bind(this);\n\t      wrapped = function(...args) {\n\t        return schedule(fn.bind(this), ...args);\n\t      };\n\t      wrapped.withOptions = function(options, ...args) {\n\t        return schedule(options, fn, ...args);\n\t      };\n\t      return wrapped;\n\t    }\n\n\t    async updateSettings(options = {}) {\n\t      await this._store.__updateSettings__(parser$5.overwrite(options, this.storeDefaults));\n\t      parser$5.overwrite(options, this.instanceDefaults, this);\n\t      return this;\n\t    }\n\n\t    currentReservoir() {\n\t      return this._store.__currentReservoir__();\n\t    }\n\n\t    incrementReservoir(incr = 0) {\n\t      return this._store.__incrementReservoir__(incr);\n\t    }\n\n\t  }\n\t  Bottleneck.default = Bottleneck;\n\n\t  Bottleneck.Events = Events$4;\n\n\t  Bottleneck.version = Bottleneck.prototype.version = require$$8.version;\n\n\t  Bottleneck.strategy = Bottleneck.prototype.strategy = {\n\t    LEAK: 1,\n\t    OVERFLOW: 2,\n\t    OVERFLOW_PRIORITY: 4,\n\t    BLOCK: 3\n\t  };\n\n\t  Bottleneck.BottleneckError = Bottleneck.prototype.BottleneckError = BottleneckError_1;\n\n\t  Bottleneck.Group = Bottleneck.prototype.Group = Group_1;\n\n\t  Bottleneck.RedisConnection = Bottleneck.prototype.RedisConnection = require$$2;\n\n\t  Bottleneck.IORedisConnection = Bottleneck.prototype.IORedisConnection = require$$3;\n\n\t  Bottleneck.Batcher = Bottleneck.prototype.Batcher = Batcher_1;\n\n\t  Bottleneck.prototype.jobDefaults = {\n\t    priority: DEFAULT_PRIORITY$1,\n\t    weight: 1,\n\t    expiration: null,\n\t    id: \"<no-id>\"\n\t  };\n\n\t  Bottleneck.prototype.storeDefaults = {\n\t    maxConcurrent: null,\n\t    minTime: 0,\n\t    highWater: null,\n\t    strategy: Bottleneck.prototype.strategy.LEAK,\n\t    penalty: null,\n\t    reservoir: null,\n\t    reservoirRefreshInterval: null,\n\t    reservoirRefreshAmount: null,\n\t    reservoirIncreaseInterval: null,\n\t    reservoirIncreaseAmount: null,\n\t    reservoirIncreaseMaximum: null\n\t  };\n\n\t  Bottleneck.prototype.localStoreDefaults = {\n\t    Promise: Promise,\n\t    timeout: null,\n\t    heartbeatInterval: 250\n\t  };\n\n\t  Bottleneck.prototype.redisStoreDefaults = {\n\t    Promise: Promise,\n\t    timeout: null,\n\t    heartbeatInterval: 5000,\n\t    clientTimeout: 10000,\n\t    Redis: null,\n\t    clientOptions: {},\n\t    clusterNodes: null,\n\t    clearDatastore: false,\n\t    connection: null\n\t  };\n\n\t  Bottleneck.prototype.instanceDefaults = {\n\t    datastore: \"local\",\n\t    connection: null,\n\t    id: \"<no-id>\",\n\t    rejectOnDrop: true,\n\t    trackDoneStatus: false,\n\t    Promise: Promise\n\t  };\n\n\t  Bottleneck.prototype.stopDefaults = {\n\t    enqueueErrorMessage: \"This limiter has been stopped and cannot accept new jobs.\",\n\t    dropWaitingJobs: true,\n\t    dropErrorMessage: \"This limiter has been stopped.\"\n\t  };\n\n\t  return Bottleneck;\n\n\t}).call(commonjsGlobal);\n\n\tvar Bottleneck_1 = Bottleneck;\n\n\tvar lib = Bottleneck_1;\n\n\treturn lib;\n\n})));\n\n\n/***/ }),\n\n/***/ 8932:\n/***/ ((__unused_webpack_module, exports) => {\n\n\"use strict\";\n\n\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\n\nclass Deprecation extends Error {\n  constructor(message) {\n    super(message); // Maintains proper stack trace (only available on V8)\n\n    /* istanbul ignore next */\n\n    if (Error.captureStackTrace) {\n      Error.captureStackTrace(this, this.constructor);\n    }\n\n    this.name = 'Deprecation';\n  }\n\n}\n\nexports.Deprecation = Deprecation;\n\n\n/***/ }),\n\n/***/ 5060:\n/***/ ((module) => {\n\n\"use strict\";\n\r\n\r\n/**\r\n * filesize\r\n *\r\n * @copyright 2020 Jason Mulligan <jason.mulligan@avoidwork.com>\r\n * @license BSD-3-Clause\r\n * @version 6.1.0\r\n */\r\n(function (global) {\r\n  var b = /^(b|B)$/,\r\n      symbol = {\r\n    iec: {\r\n      bits: [\"b\", \"Kib\", \"Mib\", \"Gib\", \"Tib\", \"Pib\", \"Eib\", \"Zib\", \"Yib\"],\r\n      bytes: [\"B\", \"KiB\", \"MiB\", \"GiB\", \"TiB\", \"PiB\", \"EiB\", \"ZiB\", \"YiB\"]\r\n    },\r\n    jedec: {\r\n      bits: [\"b\", \"Kb\", \"Mb\", \"Gb\", \"Tb\", \"Pb\", \"Eb\", \"Zb\", \"Yb\"],\r\n      bytes: [\"B\", \"KB\", \"MB\", \"GB\", \"TB\", \"PB\", \"EB\", \"ZB\", \"YB\"]\r\n    }\r\n  },\r\n      fullform = {\r\n    iec: [\"\", \"kibi\", \"mebi\", \"gibi\", \"tebi\", \"pebi\", \"exbi\", \"zebi\", \"yobi\"],\r\n    jedec: [\"\", \"kilo\", \"mega\", \"giga\", \"tera\", \"peta\", \"exa\", \"zetta\", \"yotta\"]\r\n  };\r\n  /**\r\n   * filesize\r\n   *\r\n   * @method filesize\r\n   * @param  {Mixed}   arg        String, Int or Float to transform\r\n   * @param  {Object}  descriptor [Optional] Flags\r\n   * @return {String}             Readable file size String\r\n   */\r\n\r\n  function filesize(arg) {\r\n    var descriptor = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};\r\n    var result = [],\r\n        val = 0,\r\n        e = void 0,\r\n        base = void 0,\r\n        bits = void 0,\r\n        ceil = void 0,\r\n        full = void 0,\r\n        fullforms = void 0,\r\n        locale = void 0,\r\n        localeOptions = void 0,\r\n        neg = void 0,\r\n        num = void 0,\r\n        output = void 0,\r\n        round = void 0,\r\n        unix = void 0,\r\n        separator = void 0,\r\n        spacer = void 0,\r\n        standard = void 0,\r\n        symbols = void 0;\r\n\r\n    if (isNaN(arg)) {\r\n      throw new TypeError(\"Invalid number\");\r\n    }\r\n\r\n    bits = descriptor.bits === true;\r\n    unix = descriptor.unix === true;\r\n    base = descriptor.base || 2;\r\n    round = descriptor.round !== void 0 ? descriptor.round : unix ? 1 : 2;\r\n    locale = descriptor.locale !== void 0 ? descriptor.locale : \"\";\r\n    localeOptions = descriptor.localeOptions || {};\r\n    separator = descriptor.separator !== void 0 ? descriptor.separator : \"\";\r\n    spacer = descriptor.spacer !== void 0 ? descriptor.spacer : unix ? \"\" : \" \";\r\n    symbols = descriptor.symbols || {};\r\n    standard = base === 2 ? descriptor.standard || \"jedec\" : \"jedec\";\r\n    output = descriptor.output || \"string\";\r\n    full = descriptor.fullform === true;\r\n    fullforms = descriptor.fullforms instanceof Array ? descriptor.fullforms : [];\r\n    e = descriptor.exponent !== void 0 ? descriptor.exponent : -1;\r\n    num = Number(arg);\r\n    neg = num < 0;\r\n    ceil = base > 2 ? 1000 : 1024; // Flipping a negative number to determine the size\r\n\r\n    if (neg) {\r\n      num = -num;\r\n    } // Determining the exponent\r\n\r\n\r\n    if (e === -1 || isNaN(e)) {\r\n      e = Math.floor(Math.log(num) / Math.log(ceil));\r\n\r\n      if (e < 0) {\r\n        e = 0;\r\n      }\r\n    } // Exceeding supported length, time to reduce & multiply\r\n\r\n\r\n    if (e > 8) {\r\n      e = 8;\r\n    }\r\n\r\n    if (output === \"exponent\") {\r\n      return e;\r\n    } // Zero is now a special case because bytes divide by 1\r\n\r\n\r\n    if (num === 0) {\r\n      result[0] = 0;\r\n      result[1] = unix ? \"\" : symbol[standard][bits ? \"bits\" : \"bytes\"][e];\r\n    } else {\r\n      val = num / (base === 2 ? Math.pow(2, e * 10) : Math.pow(1000, e));\r\n\r\n      if (bits) {\r\n        val = val * 8;\r\n\r\n        if (val >= ceil && e < 8) {\r\n          val = val / ceil;\r\n          e++;\r\n        }\r\n      }\r\n\r\n      result[0] = Number(val.toFixed(e > 0 ? round : 0));\r\n\r\n      if (result[0] === ceil && e < 8 && descriptor.exponent === void 0) {\r\n        result[0] = 1;\r\n        e++;\r\n      }\r\n\r\n      result[1] = base === 10 && e === 1 ? bits ? \"kb\" : \"kB\" : symbol[standard][bits ? \"bits\" : \"bytes\"][e];\r\n\r\n      if (unix) {\r\n        result[1] = standard === \"jedec\" ? result[1].charAt(0) : e > 0 ? result[1].replace(/B$/, \"\") : result[1];\r\n\r\n        if (b.test(result[1])) {\r\n          result[0] = Math.floor(result[0]);\r\n          result[1] = \"\";\r\n        }\r\n      }\r\n    } // Decorating a 'diff'\r\n\r\n\r\n    if (neg) {\r\n      result[0] = -result[0];\r\n    } // Applying custom symbol\r\n\r\n\r\n    result[1] = symbols[result[1]] || result[1];\r\n\r\n    if (locale === true) {\r\n      result[0] = result[0].toLocaleString();\r\n    } else if (locale.length > 0) {\r\n      result[0] = result[0].toLocaleString(locale, localeOptions);\r\n    } else if (separator.length > 0) {\r\n      result[0] = result[0].toString().replace(\".\", separator);\r\n    } // Returning Array, Object, or String (default)\r\n\r\n\r\n    if (output === \"array\") {\r\n      return result;\r\n    }\r\n\r\n    if (full) {\r\n      result[1] = fullforms[e] ? fullforms[e] : fullform[standard][e] + (bits ? \"bit\" : \"byte\") + (result[0] === 1 ? \"\" : \"s\");\r\n    }\r\n\r\n    if (output === \"object\") {\r\n      return {\r\n        value: result[0],\r\n        symbol: result[1],\r\n        exponent: e\r\n      };\r\n    }\r\n\r\n    return result.join(spacer);\r\n  } // Partial application for functional programming\r\n\r\n\r\n  filesize.partial = function (opt) {\r\n    return function (arg) {\r\n      return filesize(arg, opt);\r\n    };\r\n  }; // CommonJS, AMD, script tag\r\n\r\n\r\n  if (true) {\r\n    module.exports = filesize;\r\n  } else {}\r\n})(typeof window !== \"undefined\" ? window : global);\r\n\n\n/***/ }),\n\n/***/ 3287:\n/***/ ((__unused_webpack_module, exports) => {\n\n\"use strict\";\n\n\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\n\n/*!\n * is-plain-object <https://github.com/jonschlinkert/is-plain-object>\n *\n * Copyright (c) 2014-2017, Jon Schlinkert.\n * Released under the MIT License.\n */\n\nfunction isObject(o) {\n  return Object.prototype.toString.call(o) === '[object Object]';\n}\n\nfunction isPlainObject(o) {\n  var ctor,prot;\n\n  if (isObject(o) === false) return false;\n\n  // If has modified constructor\n  ctor = o.constructor;\n  if (ctor === undefined) return true;\n\n  // If has modified prototype\n  prot = ctor.prototype;\n  if (isObject(prot) === false) return false;\n\n  // If constructor does not have an Object-specific method\n  if (prot.hasOwnProperty('isPrototypeOf') === false) {\n    return false;\n  }\n\n  // Most likely a plain Object\n  return true;\n}\n\nexports.isPlainObject = isPlainObject;\n\n\n/***/ }),\n\n/***/ 467:\n/***/ ((module, exports, __nccwpck_require__) => {\n\n\"use strict\";\n\n\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\n\nfunction _interopDefault (ex) { return (ex && (typeof ex === 'object') && 'default' in ex) ? ex['default'] : ex; }\n\nvar Stream = _interopDefault(__nccwpck_require__(2413));\nvar http = _interopDefault(__nccwpck_require__(8605));\nvar Url = _interopDefault(__nccwpck_require__(8835));\nvar https = _interopDefault(__nccwpck_require__(7211));\nvar zlib = _interopDefault(__nccwpck_require__(8761));\n\n// Based on https://github.com/tmpvar/jsdom/blob/aa85b2abf07766ff7bf5c1f6daafb3726f2f2db5/lib/jsdom/living/blob.js\n\n// fix for \"Readable\" isn't a named export issue\nconst Readable = Stream.Readable;\n\nconst BUFFER = Symbol('buffer');\nconst TYPE = Symbol('type');\n\nclass Blob {\n\tconstructor() {\n\t\tthis[TYPE] = '';\n\n\t\tconst blobParts = arguments[0];\n\t\tconst options = arguments[1];\n\n\t\tconst buffers = [];\n\t\tlet size = 0;\n\n\t\tif (blobParts) {\n\t\t\tconst a = blobParts;\n\t\t\tconst length = Number(a.length);\n\t\t\tfor (let i = 0; i < length; i++) {\n\t\t\t\tconst element = a[i];\n\t\t\t\tlet buffer;\n\t\t\t\tif (element instanceof Buffer) {\n\t\t\t\t\tbuffer = element;\n\t\t\t\t} else if (ArrayBuffer.isView(element)) {\n\t\t\t\t\tbuffer = Buffer.from(element.buffer, element.byteOffset, element.byteLength);\n\t\t\t\t} else if (element instanceof ArrayBuffer) {\n\t\t\t\t\tbuffer = Buffer.from(element);\n\t\t\t\t} else if (element instanceof Blob) {\n\t\t\t\t\tbuffer = element[BUFFER];\n\t\t\t\t} else {\n\t\t\t\t\tbuffer = Buffer.from(typeof element === 'string' ? element : String(element));\n\t\t\t\t}\n\t\t\t\tsize += buffer.length;\n\t\t\t\tbuffers.push(buffer);\n\t\t\t}\n\t\t}\n\n\t\tthis[BUFFER] = Buffer.concat(buffers);\n\n\t\tlet type = options && options.type !== undefined && String(options.type).toLowerCase();\n\t\tif (type && !/[^\\u0020-\\u007E]/.test(type)) {\n\t\t\tthis[TYPE] = type;\n\t\t}\n\t}\n\tget size() {\n\t\treturn this[BUFFER].length;\n\t}\n\tget type() {\n\t\treturn this[TYPE];\n\t}\n\ttext() {\n\t\treturn Promise.resolve(this[BUFFER].toString());\n\t}\n\tarrayBuffer() {\n\t\tconst buf = this[BUFFER];\n\t\tconst ab = buf.buffer.slice(buf.byteOffset, buf.byteOffset + buf.byteLength);\n\t\treturn Promise.resolve(ab);\n\t}\n\tstream() {\n\t\tconst readable = new Readable();\n\t\treadable._read = function () {};\n\t\treadable.push(this[BUFFER]);\n\t\treadable.push(null);\n\t\treturn readable;\n\t}\n\ttoString() {\n\t\treturn '[object Blob]';\n\t}\n\tslice() {\n\t\tconst size = this.size;\n\n\t\tconst start = arguments[0];\n\t\tconst end = arguments[1];\n\t\tlet relativeStart, relativeEnd;\n\t\tif (start === undefined) {\n\t\t\trelativeStart = 0;\n\t\t} else if (start < 0) {\n\t\t\trelativeStart = Math.max(size + start, 0);\n\t\t} else {\n\t\t\trelativeStart = Math.min(start, size);\n\t\t}\n\t\tif (end === undefined) {\n\t\t\trelativeEnd = size;\n\t\t} else if (end < 0) {\n\t\t\trelativeEnd = Math.max(size + end, 0);\n\t\t} else {\n\t\t\trelativeEnd = Math.min(end, size);\n\t\t}\n\t\tconst span = Math.max(relativeEnd - relativeStart, 0);\n\n\t\tconst buffer = this[BUFFER];\n\t\tconst slicedBuffer = buffer.slice(relativeStart, relativeStart + span);\n\t\tconst blob = new Blob([], { type: arguments[2] });\n\t\tblob[BUFFER] = slicedBuffer;\n\t\treturn blob;\n\t}\n}\n\nObject.defineProperties(Blob.prototype, {\n\tsize: { enumerable: true },\n\ttype: { enumerable: true },\n\tslice: { enumerable: true }\n});\n\nObject.defineProperty(Blob.prototype, Symbol.toStringTag, {\n\tvalue: 'Blob',\n\twritable: false,\n\tenumerable: false,\n\tconfigurable: true\n});\n\n/**\n * fetch-error.js\n *\n * FetchError interface for operational errors\n */\n\n/**\n * Create FetchError instance\n *\n * @param   String      message      Error message for human\n * @param   String      type         Error type for machine\n * @param   String      systemError  For Node.js system error\n * @return  FetchError\n */\nfunction FetchError(message, type, systemError) {\n  Error.call(this, message);\n\n  this.message = message;\n  this.type = type;\n\n  // when err.type is `system`, err.code contains system error code\n  if (systemError) {\n    this.code = this.errno = systemError.code;\n  }\n\n  // hide custom error implementation details from end-users\n  Error.captureStackTrace(this, this.constructor);\n}\n\nFetchError.prototype = Object.create(Error.prototype);\nFetchError.prototype.constructor = FetchError;\nFetchError.prototype.name = 'FetchError';\n\nlet convert;\ntry {\n\tconvert = __nccwpck_require__(2877).convert;\n} catch (e) {}\n\nconst INTERNALS = Symbol('Body internals');\n\n// fix an issue where \"PassThrough\" isn't a named export for node <10\nconst PassThrough = Stream.PassThrough;\n\n/**\n * Body mixin\n *\n * Ref: https://fetch.spec.whatwg.org/#body\n *\n * @param   Stream  body  Readable stream\n * @param   Object  opts  Response options\n * @return  Void\n */\nfunction Body(body) {\n\tvar _this = this;\n\n\tvar _ref = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {},\n\t    _ref$size = _ref.size;\n\n\tlet size = _ref$size === undefined ? 0 : _ref$size;\n\tvar _ref$timeout = _ref.timeout;\n\tlet timeout = _ref$timeout === undefined ? 0 : _ref$timeout;\n\n\tif (body == null) {\n\t\t// body is undefined or null\n\t\tbody = null;\n\t} else if (isURLSearchParams(body)) {\n\t\t// body is a URLSearchParams\n\t\tbody = Buffer.from(body.toString());\n\t} else if (isBlob(body)) ; else if (Buffer.isBuffer(body)) ; else if (Object.prototype.toString.call(body) === '[object ArrayBuffer]') {\n\t\t// body is ArrayBuffer\n\t\tbody = Buffer.from(body);\n\t} else if (ArrayBuffer.isView(body)) {\n\t\t// body is ArrayBufferView\n\t\tbody = Buffer.from(body.buffer, body.byteOffset, body.byteLength);\n\t} else if (body instanceof Stream) ; else {\n\t\t// none of the above\n\t\t// coerce to string then buffer\n\t\tbody = Buffer.from(String(body));\n\t}\n\tthis[INTERNALS] = {\n\t\tbody,\n\t\tdisturbed: false,\n\t\terror: null\n\t};\n\tthis.size = size;\n\tthis.timeout = timeout;\n\n\tif (body instanceof Stream) {\n\t\tbody.on('error', function (err) {\n\t\t\tconst error = err.name === 'AbortError' ? err : new FetchError(`Invalid response body while trying to fetch ${_this.url}: ${err.message}`, 'system', err);\n\t\t\t_this[INTERNALS].error = error;\n\t\t});\n\t}\n}\n\nBody.prototype = {\n\tget body() {\n\t\treturn this[INTERNALS].body;\n\t},\n\n\tget bodyUsed() {\n\t\treturn this[INTERNALS].disturbed;\n\t},\n\n\t/**\n  * Decode response as ArrayBuffer\n  *\n  * @return  Promise\n  */\n\tarrayBuffer() {\n\t\treturn consumeBody.call(this).then(function (buf) {\n\t\t\treturn buf.buffer.slice(buf.byteOffset, buf.byteOffset + buf.byteLength);\n\t\t});\n\t},\n\n\t/**\n  * Return raw response as Blob\n  *\n  * @return Promise\n  */\n\tblob() {\n\t\tlet ct = this.headers && this.headers.get('content-type') || '';\n\t\treturn consumeBody.call(this).then(function (buf) {\n\t\t\treturn Object.assign(\n\t\t\t// Prevent copying\n\t\t\tnew Blob([], {\n\t\t\t\ttype: ct.toLowerCase()\n\t\t\t}), {\n\t\t\t\t[BUFFER]: buf\n\t\t\t});\n\t\t});\n\t},\n\n\t/**\n  * Decode response as json\n  *\n  * @return  Promise\n  */\n\tjson() {\n\t\tvar _this2 = this;\n\n\t\treturn consumeBody.call(this).then(function (buffer) {\n\t\t\ttry {\n\t\t\t\treturn JSON.parse(buffer.toString());\n\t\t\t} catch (err) {\n\t\t\t\treturn Body.Promise.reject(new FetchError(`invalid json response body at ${_this2.url} reason: ${err.message}`, 'invalid-json'));\n\t\t\t}\n\t\t});\n\t},\n\n\t/**\n  * Decode response as text\n  *\n  * @return  Promise\n  */\n\ttext() {\n\t\treturn consumeBody.call(this).then(function (buffer) {\n\t\t\treturn buffer.toString();\n\t\t});\n\t},\n\n\t/**\n  * Decode response as buffer (non-spec api)\n  *\n  * @return  Promise\n  */\n\tbuffer() {\n\t\treturn consumeBody.call(this);\n\t},\n\n\t/**\n  * Decode response as text, while automatically detecting the encoding and\n  * trying to decode to UTF-8 (non-spec api)\n  *\n  * @return  Promise\n  */\n\ttextConverted() {\n\t\tvar _this3 = this;\n\n\t\treturn consumeBody.call(this).then(function (buffer) {\n\t\t\treturn convertBody(buffer, _this3.headers);\n\t\t});\n\t}\n};\n\n// In browsers, all properties are enumerable.\nObject.defineProperties(Body.prototype, {\n\tbody: { enumerable: true },\n\tbodyUsed: { enumerable: true },\n\tarrayBuffer: { enumerable: true },\n\tblob: { enumerable: true },\n\tjson: { enumerable: true },\n\ttext: { enumerable: true }\n});\n\nBody.mixIn = function (proto) {\n\tfor (const name of Object.getOwnPropertyNames(Body.prototype)) {\n\t\t// istanbul ignore else: future proof\n\t\tif (!(name in proto)) {\n\t\t\tconst desc = Object.getOwnPropertyDescriptor(Body.prototype, name);\n\t\t\tObject.defineProperty(proto, name, desc);\n\t\t}\n\t}\n};\n\n/**\n * Consume and convert an entire Body to a Buffer.\n *\n * Ref: https://fetch.spec.whatwg.org/#concept-body-consume-body\n *\n * @return  Promise\n */\nfunction consumeBody() {\n\tvar _this4 = this;\n\n\tif (this[INTERNALS].disturbed) {\n\t\treturn Body.Promise.reject(new TypeError(`body used already for: ${this.url}`));\n\t}\n\n\tthis[INTERNALS].disturbed = true;\n\n\tif (this[INTERNALS].error) {\n\t\treturn Body.Promise.reject(this[INTERNALS].error);\n\t}\n\n\tlet body = this.body;\n\n\t// body is null\n\tif (body === null) {\n\t\treturn Body.Promise.resolve(Buffer.alloc(0));\n\t}\n\n\t// body is blob\n\tif (isBlob(body)) {\n\t\tbody = body.stream();\n\t}\n\n\t// body is buffer\n\tif (Buffer.isBuffer(body)) {\n\t\treturn Body.Promise.resolve(body);\n\t}\n\n\t// istanbul ignore if: should never happen\n\tif (!(body instanceof Stream)) {\n\t\treturn Body.Promise.resolve(Buffer.alloc(0));\n\t}\n\n\t// body is stream\n\t// get ready to actually consume the body\n\tlet accum = [];\n\tlet accumBytes = 0;\n\tlet abort = false;\n\n\treturn new Body.Promise(function (resolve, reject) {\n\t\tlet resTimeout;\n\n\t\t// allow timeout on slow response body\n\t\tif (_this4.timeout) {\n\t\t\tresTimeout = setTimeout(function () {\n\t\t\t\tabort = true;\n\t\t\t\treject(new FetchError(`Response timeout while trying to fetch ${_this4.url} (over ${_this4.timeout}ms)`, 'body-timeout'));\n\t\t\t}, _this4.timeout);\n\t\t}\n\n\t\t// handle stream errors\n\t\tbody.on('error', function (err) {\n\t\t\tif (err.name === 'AbortError') {\n\t\t\t\t// if the request was aborted, reject with this Error\n\t\t\t\tabort = true;\n\t\t\t\treject(err);\n\t\t\t} else {\n\t\t\t\t// other errors, such as incorrect content-encoding\n\t\t\t\treject(new FetchError(`Invalid response body while trying to fetch ${_this4.url}: ${err.message}`, 'system', err));\n\t\t\t}\n\t\t});\n\n\t\tbody.on('data', function (chunk) {\n\t\t\tif (abort || chunk === null) {\n\t\t\t\treturn;\n\t\t\t}\n\n\t\t\tif (_this4.size && accumBytes + chunk.length > _this4.size) {\n\t\t\t\tabort = true;\n\t\t\t\treject(new FetchError(`content size at ${_this4.url} over limit: ${_this4.size}`, 'max-size'));\n\t\t\t\treturn;\n\t\t\t}\n\n\t\t\taccumBytes += chunk.length;\n\t\t\taccum.push(chunk);\n\t\t});\n\n\t\tbody.on('end', function () {\n\t\t\tif (abort) {\n\t\t\t\treturn;\n\t\t\t}\n\n\t\t\tclearTimeout(resTimeout);\n\n\t\t\ttry {\n\t\t\t\tresolve(Buffer.concat(accum, accumBytes));\n\t\t\t} catch (err) {\n\t\t\t\t// handle streams that have accumulated too much data (issue #414)\n\t\t\t\treject(new FetchError(`Could not create Buffer from response body for ${_this4.url}: ${err.message}`, 'system', err));\n\t\t\t}\n\t\t});\n\t});\n}\n\n/**\n * Detect buffer encoding and convert to target encoding\n * ref: http://www.w3.org/TR/2011/WD-html5-20110113/parsing.html#determining-the-character-encoding\n *\n * @param   Buffer  buffer    Incoming buffer\n * @param   String  encoding  Target encoding\n * @return  String\n */\nfunction convertBody(buffer, headers) {\n\tif (typeof convert !== 'function') {\n\t\tthrow new Error('The package `encoding` must be installed to use the textConverted() function');\n\t}\n\n\tconst ct = headers.get('content-type');\n\tlet charset = 'utf-8';\n\tlet res, str;\n\n\t// header\n\tif (ct) {\n\t\tres = /charset=([^;]*)/i.exec(ct);\n\t}\n\n\t// no charset in content type, peek at response body for at most 1024 bytes\n\tstr = buffer.slice(0, 1024).toString();\n\n\t// html5\n\tif (!res && str) {\n\t\tres = /<meta.+?charset=(['\"])(.+?)\\1/i.exec(str);\n\t}\n\n\t// html4\n\tif (!res && str) {\n\t\tres = /<meta[\\s]+?http-equiv=(['\"])content-type\\1[\\s]+?content=(['\"])(.+?)\\2/i.exec(str);\n\t\tif (!res) {\n\t\t\tres = /<meta[\\s]+?content=(['\"])(.+?)\\1[\\s]+?http-equiv=(['\"])content-type\\3/i.exec(str);\n\t\t\tif (res) {\n\t\t\t\tres.pop(); // drop last quote\n\t\t\t}\n\t\t}\n\n\t\tif (res) {\n\t\t\tres = /charset=(.*)/i.exec(res.pop());\n\t\t}\n\t}\n\n\t// xml\n\tif (!res && str) {\n\t\tres = /<\\?xml.+?encoding=(['\"])(.+?)\\1/i.exec(str);\n\t}\n\n\t// found charset\n\tif (res) {\n\t\tcharset = res.pop();\n\n\t\t// prevent decode issues when sites use incorrect encoding\n\t\t// ref: https://hsivonen.fi/encoding-menu/\n\t\tif (charset === 'gb2312' || charset === 'gbk') {\n\t\t\tcharset = 'gb18030';\n\t\t}\n\t}\n\n\t// turn raw buffers into a single utf-8 buffer\n\treturn convert(buffer, 'UTF-8', charset).toString();\n}\n\n/**\n * Detect a URLSearchParams object\n * ref: https://github.com/bitinn/node-fetch/issues/296#issuecomment-307598143\n *\n * @param   Object  obj     Object to detect by type or brand\n * @return  String\n */\nfunction isURLSearchParams(obj) {\n\t// Duck-typing as a necessary condition.\n\tif (typeof obj !== 'object' || typeof obj.append !== 'function' || typeof obj.delete !== 'function' || typeof obj.get !== 'function' || typeof obj.getAll !== 'function' || typeof obj.has !== 'function' || typeof obj.set !== 'function') {\n\t\treturn false;\n\t}\n\n\t// Brand-checking and more duck-typing as optional condition.\n\treturn obj.constructor.name === 'URLSearchParams' || Object.prototype.toString.call(obj) === '[object URLSearchParams]' || typeof obj.sort === 'function';\n}\n\n/**\n * Check if `obj` is a W3C `Blob` object (which `File` inherits from)\n * @param  {*} obj\n * @return {boolean}\n */\nfunction isBlob(obj) {\n\treturn typeof obj === 'object' && typeof obj.arrayBuffer === 'function' && typeof obj.type === 'string' && typeof obj.stream === 'function' && typeof obj.constructor === 'function' && typeof obj.constructor.name === 'string' && /^(Blob|File)$/.test(obj.constructor.name) && /^(Blob|File)$/.test(obj[Symbol.toStringTag]);\n}\n\n/**\n * Clone body given Res/Req instance\n *\n * @param   Mixed  instance  Response or Request instance\n * @return  Mixed\n */\nfunction clone(instance) {\n\tlet p1, p2;\n\tlet body = instance.body;\n\n\t// don't allow cloning a used body\n\tif (instance.bodyUsed) {\n\t\tthrow new Error('cannot clone body after it is used');\n\t}\n\n\t// check that body is a stream and not form-data object\n\t// note: we can't clone the form-data object without having it as a dependency\n\tif (body instanceof Stream && typeof body.getBoundary !== 'function') {\n\t\t// tee instance body\n\t\tp1 = new PassThrough();\n\t\tp2 = new PassThrough();\n\t\tbody.pipe(p1);\n\t\tbody.pipe(p2);\n\t\t// set instance body to teed body and return the other teed body\n\t\tinstance[INTERNALS].body = p1;\n\t\tbody = p2;\n\t}\n\n\treturn body;\n}\n\n/**\n * Performs the operation \"extract a `Content-Type` value from |object|\" as\n * specified in the specification:\n * https://fetch.spec.whatwg.org/#concept-bodyinit-extract\n *\n * This function assumes that instance.body is present.\n *\n * @param   Mixed  instance  Any options.body input\n */\nfunction extractContentType(body) {\n\tif (body === null) {\n\t\t// body is null\n\t\treturn null;\n\t} else if (typeof body === 'string') {\n\t\t// body is string\n\t\treturn 'text/plain;charset=UTF-8';\n\t} else if (isURLSearchParams(body)) {\n\t\t// body is a URLSearchParams\n\t\treturn 'application/x-www-form-urlencoded;charset=UTF-8';\n\t} else if (isBlob(body)) {\n\t\t// body is blob\n\t\treturn body.type || null;\n\t} else if (Buffer.isBuffer(body)) {\n\t\t// body is buffer\n\t\treturn null;\n\t} else if (Object.prototype.toString.call(body) === '[object ArrayBuffer]') {\n\t\t// body is ArrayBuffer\n\t\treturn null;\n\t} else if (ArrayBuffer.isView(body)) {\n\t\t// body is ArrayBufferView\n\t\treturn null;\n\t} else if (typeof body.getBoundary === 'function') {\n\t\t// detect form data input from form-data module\n\t\treturn `multipart/form-data;boundary=${body.getBoundary()}`;\n\t} else if (body instanceof Stream) {\n\t\t// body is stream\n\t\t// can't really do much about this\n\t\treturn null;\n\t} else {\n\t\t// Body constructor defaults other things to string\n\t\treturn 'text/plain;charset=UTF-8';\n\t}\n}\n\n/**\n * The Fetch Standard treats this as if \"total bytes\" is a property on the body.\n * For us, we have to explicitly get it with a function.\n *\n * ref: https://fetch.spec.whatwg.org/#concept-body-total-bytes\n *\n * @param   Body    instance   Instance of Body\n * @return  Number?            Number of bytes, or null if not possible\n */\nfunction getTotalBytes(instance) {\n\tconst body = instance.body;\n\n\n\tif (body === null) {\n\t\t// body is null\n\t\treturn 0;\n\t} else if (isBlob(body)) {\n\t\treturn body.size;\n\t} else if (Buffer.isBuffer(body)) {\n\t\t// body is buffer\n\t\treturn body.length;\n\t} else if (body && typeof body.getLengthSync === 'function') {\n\t\t// detect form data input from form-data module\n\t\tif (body._lengthRetrievers && body._lengthRetrievers.length == 0 || // 1.x\n\t\tbody.hasKnownLength && body.hasKnownLength()) {\n\t\t\t// 2.x\n\t\t\treturn body.getLengthSync();\n\t\t}\n\t\treturn null;\n\t} else {\n\t\t// body is stream\n\t\treturn null;\n\t}\n}\n\n/**\n * Write a Body to a Node.js WritableStream (e.g. http.Request) object.\n *\n * @param   Body    instance   Instance of Body\n * @return  Void\n */\nfunction writeToStream(dest, instance) {\n\tconst body = instance.body;\n\n\n\tif (body === null) {\n\t\t// body is null\n\t\tdest.end();\n\t} else if (isBlob(body)) {\n\t\tbody.stream().pipe(dest);\n\t} else if (Buffer.isBuffer(body)) {\n\t\t// body is buffer\n\t\tdest.write(body);\n\t\tdest.end();\n\t} else {\n\t\t// body is stream\n\t\tbody.pipe(dest);\n\t}\n}\n\n// expose Promise\nBody.Promise = global.Promise;\n\n/**\n * headers.js\n *\n * Headers class offers convenient helpers\n */\n\nconst invalidTokenRegex = /[^\\^_`a-zA-Z\\-0-9!#$%&'*+.|~]/;\nconst invalidHeaderCharRegex = /[^\\t\\x20-\\x7e\\x80-\\xff]/;\n\nfunction validateName(name) {\n\tname = `${name}`;\n\tif (invalidTokenRegex.test(name) || name === '') {\n\t\tthrow new TypeError(`${name} is not a legal HTTP header name`);\n\t}\n}\n\nfunction validateValue(value) {\n\tvalue = `${value}`;\n\tif (invalidHeaderCharRegex.test(value)) {\n\t\tthrow new TypeError(`${value} is not a legal HTTP header value`);\n\t}\n}\n\n/**\n * Find the key in the map object given a header name.\n *\n * Returns undefined if not found.\n *\n * @param   String  name  Header name\n * @return  String|Undefined\n */\nfunction find(map, name) {\n\tname = name.toLowerCase();\n\tfor (const key in map) {\n\t\tif (key.toLowerCase() === name) {\n\t\t\treturn key;\n\t\t}\n\t}\n\treturn undefined;\n}\n\nconst MAP = Symbol('map');\nclass Headers {\n\t/**\n  * Headers class\n  *\n  * @param   Object  headers  Response headers\n  * @return  Void\n  */\n\tconstructor() {\n\t\tlet init = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : undefined;\n\n\t\tthis[MAP] = Object.create(null);\n\n\t\tif (init instanceof Headers) {\n\t\t\tconst rawHeaders = init.raw();\n\t\t\tconst headerNames = Object.keys(rawHeaders);\n\n\t\t\tfor (const headerName of headerNames) {\n\t\t\t\tfor (const value of rawHeaders[headerName]) {\n\t\t\t\t\tthis.append(headerName, value);\n\t\t\t\t}\n\t\t\t}\n\n\t\t\treturn;\n\t\t}\n\n\t\t// We don't worry about converting prop to ByteString here as append()\n\t\t// will handle it.\n\t\tif (init == null) ; else if (typeof init === 'object') {\n\t\t\tconst method = init[Symbol.iterator];\n\t\t\tif (method != null) {\n\t\t\t\tif (typeof method !== 'function') {\n\t\t\t\t\tthrow new TypeError('Header pairs must be iterable');\n\t\t\t\t}\n\n\t\t\t\t// sequence<sequence<ByteString>>\n\t\t\t\t// Note: per spec we have to first exhaust the lists then process them\n\t\t\t\tconst pairs = [];\n\t\t\t\tfor (const pair of init) {\n\t\t\t\t\tif (typeof pair !== 'object' || typeof pair[Symbol.iterator] !== 'function') {\n\t\t\t\t\t\tthrow new TypeError('Each header pair must be iterable');\n\t\t\t\t\t}\n\t\t\t\t\tpairs.push(Array.from(pair));\n\t\t\t\t}\n\n\t\t\t\tfor (const pair of pairs) {\n\t\t\t\t\tif (pair.length !== 2) {\n\t\t\t\t\t\tthrow new TypeError('Each header pair must be a name/value tuple');\n\t\t\t\t\t}\n\t\t\t\t\tthis.append(pair[0], pair[1]);\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\t// record<ByteString, ByteString>\n\t\t\t\tfor (const key of Object.keys(init)) {\n\t\t\t\t\tconst value = init[key];\n\t\t\t\t\tthis.append(key, value);\n\t\t\t\t}\n\t\t\t}\n\t\t} else {\n\t\t\tthrow new TypeError('Provided initializer must be an object');\n\t\t}\n\t}\n\n\t/**\n  * Return combined header value given name\n  *\n  * @param   String  name  Header name\n  * @return  Mixed\n  */\n\tget(name) {\n\t\tname = `${name}`;\n\t\tvalidateName(name);\n\t\tconst key = find(this[MAP], name);\n\t\tif (key === undefined) {\n\t\t\treturn null;\n\t\t}\n\n\t\treturn this[MAP][key].join(', ');\n\t}\n\n\t/**\n  * Iterate over all headers\n  *\n  * @param   Function  callback  Executed for each item with parameters (value, name, thisArg)\n  * @param   Boolean   thisArg   `this` context for callback function\n  * @return  Void\n  */\n\tforEach(callback) {\n\t\tlet thisArg = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : undefined;\n\n\t\tlet pairs = getHeaders(this);\n\t\tlet i = 0;\n\t\twhile (i < pairs.length) {\n\t\t\tvar _pairs$i = pairs[i];\n\t\t\tconst name = _pairs$i[0],\n\t\t\t      value = _pairs$i[1];\n\n\t\t\tcallback.call(thisArg, value, name, this);\n\t\t\tpairs = getHeaders(this);\n\t\t\ti++;\n\t\t}\n\t}\n\n\t/**\n  * Overwrite header values given name\n  *\n  * @param   String  name   Header name\n  * @param   String  value  Header value\n  * @return  Void\n  */\n\tset(name, value) {\n\t\tname = `${name}`;\n\t\tvalue = `${value}`;\n\t\tvalidateName(name);\n\t\tvalidateValue(value);\n\t\tconst key = find(this[MAP], name);\n\t\tthis[MAP][key !== undefined ? key : name] = [value];\n\t}\n\n\t/**\n  * Append a value onto existing header\n  *\n  * @param   String  name   Header name\n  * @param   String  value  Header value\n  * @return  Void\n  */\n\tappend(name, value) {\n\t\tname = `${name}`;\n\t\tvalue = `${value}`;\n\t\tvalidateName(name);\n\t\tvalidateValue(value);\n\t\tconst key = find(this[MAP], name);\n\t\tif (key !== undefined) {\n\t\t\tthis[MAP][key].push(value);\n\t\t} else {\n\t\t\tthis[MAP][name] = [value];\n\t\t}\n\t}\n\n\t/**\n  * Check for header name existence\n  *\n  * @param   String   name  Header name\n  * @return  Boolean\n  */\n\thas(name) {\n\t\tname = `${name}`;\n\t\tvalidateName(name);\n\t\treturn find(this[MAP], name) !== undefined;\n\t}\n\n\t/**\n  * Delete all header values given name\n  *\n  * @param   String  name  Header name\n  * @return  Void\n  */\n\tdelete(name) {\n\t\tname = `${name}`;\n\t\tvalidateName(name);\n\t\tconst key = find(this[MAP], name);\n\t\tif (key !== undefined) {\n\t\t\tdelete this[MAP][key];\n\t\t}\n\t}\n\n\t/**\n  * Return raw headers (non-spec api)\n  *\n  * @return  Object\n  */\n\traw() {\n\t\treturn this[MAP];\n\t}\n\n\t/**\n  * Get an iterator on keys.\n  *\n  * @return  Iterator\n  */\n\tkeys() {\n\t\treturn createHeadersIterator(this, 'key');\n\t}\n\n\t/**\n  * Get an iterator on values.\n  *\n  * @return  Iterator\n  */\n\tvalues() {\n\t\treturn createHeadersIterator(this, 'value');\n\t}\n\n\t/**\n  * Get an iterator on entries.\n  *\n  * This is the default iterator of the Headers object.\n  *\n  * @return  Iterator\n  */\n\t[Symbol.iterator]() {\n\t\treturn createHeadersIterator(this, 'key+value');\n\t}\n}\nHeaders.prototype.entries = Headers.prototype[Symbol.iterator];\n\nObject.defineProperty(Headers.prototype, Symbol.toStringTag, {\n\tvalue: 'Headers',\n\twritable: false,\n\tenumerable: false,\n\tconfigurable: true\n});\n\nObject.defineProperties(Headers.prototype, {\n\tget: { enumerable: true },\n\tforEach: { enumerable: true },\n\tset: { enumerable: true },\n\tappend: { enumerable: true },\n\thas: { enumerable: true },\n\tdelete: { enumerable: true },\n\tkeys: { enumerable: true },\n\tvalues: { enumerable: true },\n\tentries: { enumerable: true }\n});\n\nfunction getHeaders(headers) {\n\tlet kind = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 'key+value';\n\n\tconst keys = Object.keys(headers[MAP]).sort();\n\treturn keys.map(kind === 'key' ? function (k) {\n\t\treturn k.toLowerCase();\n\t} : kind === 'value' ? function (k) {\n\t\treturn headers[MAP][k].join(', ');\n\t} : function (k) {\n\t\treturn [k.toLowerCase(), headers[MAP][k].join(', ')];\n\t});\n}\n\nconst INTERNAL = Symbol('internal');\n\nfunction createHeadersIterator(target, kind) {\n\tconst iterator = Object.create(HeadersIteratorPrototype);\n\titerator[INTERNAL] = {\n\t\ttarget,\n\t\tkind,\n\t\tindex: 0\n\t};\n\treturn iterator;\n}\n\nconst HeadersIteratorPrototype = Object.setPrototypeOf({\n\tnext() {\n\t\t// istanbul ignore if\n\t\tif (!this || Object.getPrototypeOf(this) !== HeadersIteratorPrototype) {\n\t\t\tthrow new TypeError('Value of `this` is not a HeadersIterator');\n\t\t}\n\n\t\tvar _INTERNAL = this[INTERNAL];\n\t\tconst target = _INTERNAL.target,\n\t\t      kind = _INTERNAL.kind,\n\t\t      index = _INTERNAL.index;\n\n\t\tconst values = getHeaders(target, kind);\n\t\tconst len = values.length;\n\t\tif (index >= len) {\n\t\t\treturn {\n\t\t\t\tvalue: undefined,\n\t\t\t\tdone: true\n\t\t\t};\n\t\t}\n\n\t\tthis[INTERNAL].index = index + 1;\n\n\t\treturn {\n\t\t\tvalue: values[index],\n\t\t\tdone: false\n\t\t};\n\t}\n}, Object.getPrototypeOf(Object.getPrototypeOf([][Symbol.iterator]())));\n\nObject.defineProperty(HeadersIteratorPrototype, Symbol.toStringTag, {\n\tvalue: 'HeadersIterator',\n\twritable: false,\n\tenumerable: false,\n\tconfigurable: true\n});\n\n/**\n * Export the Headers object in a form that Node.js can consume.\n *\n * @param   Headers  headers\n * @return  Object\n */\nfunction exportNodeCompatibleHeaders(headers) {\n\tconst obj = Object.assign({ __proto__: null }, headers[MAP]);\n\n\t// http.request() only supports string as Host header. This hack makes\n\t// specifying custom Host header possible.\n\tconst hostHeaderKey = find(headers[MAP], 'Host');\n\tif (hostHeaderKey !== undefined) {\n\t\tobj[hostHeaderKey] = obj[hostHeaderKey][0];\n\t}\n\n\treturn obj;\n}\n\n/**\n * Create a Headers object from an object of headers, ignoring those that do\n * not conform to HTTP grammar productions.\n *\n * @param   Object  obj  Object of headers\n * @return  Headers\n */\nfunction createHeadersLenient(obj) {\n\tconst headers = new Headers();\n\tfor (const name of Object.keys(obj)) {\n\t\tif (invalidTokenRegex.test(name)) {\n\t\t\tcontinue;\n\t\t}\n\t\tif (Array.isArray(obj[name])) {\n\t\t\tfor (const val of obj[name]) {\n\t\t\t\tif (invalidHeaderCharRegex.test(val)) {\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tif (headers[MAP][name] === undefined) {\n\t\t\t\t\theaders[MAP][name] = [val];\n\t\t\t\t} else {\n\t\t\t\t\theaders[MAP][name].push(val);\n\t\t\t\t}\n\t\t\t}\n\t\t} else if (!invalidHeaderCharRegex.test(obj[name])) {\n\t\t\theaders[MAP][name] = [obj[name]];\n\t\t}\n\t}\n\treturn headers;\n}\n\nconst INTERNALS$1 = Symbol('Response internals');\n\n// fix an issue where \"STATUS_CODES\" aren't a named export for node <10\nconst STATUS_CODES = http.STATUS_CODES;\n\n/**\n * Response class\n *\n * @param   Stream  body  Readable stream\n * @param   Object  opts  Response options\n * @return  Void\n */\nclass Response {\n\tconstructor() {\n\t\tlet body = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : null;\n\t\tlet opts = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};\n\n\t\tBody.call(this, body, opts);\n\n\t\tconst status = opts.status || 200;\n\t\tconst headers = new Headers(opts.headers);\n\n\t\tif (body != null && !headers.has('Content-Type')) {\n\t\t\tconst contentType = extractContentType(body);\n\t\t\tif (contentType) {\n\t\t\t\theaders.append('Content-Type', contentType);\n\t\t\t}\n\t\t}\n\n\t\tthis[INTERNALS$1] = {\n\t\t\turl: opts.url,\n\t\t\tstatus,\n\t\t\tstatusText: opts.statusText || STATUS_CODES[status],\n\t\t\theaders,\n\t\t\tcounter: opts.counter\n\t\t};\n\t}\n\n\tget url() {\n\t\treturn this[INTERNALS$1].url || '';\n\t}\n\n\tget status() {\n\t\treturn this[INTERNALS$1].status;\n\t}\n\n\t/**\n  * Convenience property representing if the request ended normally\n  */\n\tget ok() {\n\t\treturn this[INTERNALS$1].status >= 200 && this[INTERNALS$1].status < 300;\n\t}\n\n\tget redirected() {\n\t\treturn this[INTERNALS$1].counter > 0;\n\t}\n\n\tget statusText() {\n\t\treturn this[INTERNALS$1].statusText;\n\t}\n\n\tget headers() {\n\t\treturn this[INTERNALS$1].headers;\n\t}\n\n\t/**\n  * Clone this response\n  *\n  * @return  Response\n  */\n\tclone() {\n\t\treturn new Response(clone(this), {\n\t\t\turl: this.url,\n\t\t\tstatus: this.status,\n\t\t\tstatusText: this.statusText,\n\t\t\theaders: this.headers,\n\t\t\tok: this.ok,\n\t\t\tredirected: this.redirected\n\t\t});\n\t}\n}\n\nBody.mixIn(Response.prototype);\n\nObject.defineProperties(Response.prototype, {\n\turl: { enumerable: true },\n\tstatus: { enumerable: true },\n\tok: { enumerable: true },\n\tredirected: { enumerable: true },\n\tstatusText: { enumerable: true },\n\theaders: { enumerable: true },\n\tclone: { enumerable: true }\n});\n\nObject.defineProperty(Response.prototype, Symbol.toStringTag, {\n\tvalue: 'Response',\n\twritable: false,\n\tenumerable: false,\n\tconfigurable: true\n});\n\nconst INTERNALS$2 = Symbol('Request internals');\n\n// fix an issue where \"format\", \"parse\" aren't a named export for node <10\nconst parse_url = Url.parse;\nconst format_url = Url.format;\n\nconst streamDestructionSupported = 'destroy' in Stream.Readable.prototype;\n\n/**\n * Check if a value is an instance of Request.\n *\n * @param   Mixed   input\n * @return  Boolean\n */\nfunction isRequest(input) {\n\treturn typeof input === 'object' && typeof input[INTERNALS$2] === 'object';\n}\n\nfunction isAbortSignal(signal) {\n\tconst proto = signal && typeof signal === 'object' && Object.getPrototypeOf(signal);\n\treturn !!(proto && proto.constructor.name === 'AbortSignal');\n}\n\n/**\n * Request class\n *\n * @param   Mixed   input  Url or Request instance\n * @param   Object  init   Custom options\n * @return  Void\n */\nclass Request {\n\tconstructor(input) {\n\t\tlet init = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};\n\n\t\tlet parsedURL;\n\n\t\t// normalize input\n\t\tif (!isRequest(input)) {\n\t\t\tif (input && input.href) {\n\t\t\t\t// in order to support Node.js' Url objects; though WHATWG's URL objects\n\t\t\t\t// will fall into this branch also (since their `toString()` will return\n\t\t\t\t// `href` property anyway)\n\t\t\t\tparsedURL = parse_url(input.href);\n\t\t\t} else {\n\t\t\t\t// coerce input to a string before attempting to parse\n\t\t\t\tparsedURL = parse_url(`${input}`);\n\t\t\t}\n\t\t\tinput = {};\n\t\t} else {\n\t\t\tparsedURL = parse_url(input.url);\n\t\t}\n\n\t\tlet method = init.method || input.method || 'GET';\n\t\tmethod = method.toUpperCase();\n\n\t\tif ((init.body != null || isRequest(input) && input.body !== null) && (method === 'GET' || method === 'HEAD')) {\n\t\t\tthrow new TypeError('Request with GET/HEAD method cannot have body');\n\t\t}\n\n\t\tlet inputBody = init.body != null ? init.body : isRequest(input) && input.body !== null ? clone(input) : null;\n\n\t\tBody.call(this, inputBody, {\n\t\t\ttimeout: init.timeout || input.timeout || 0,\n\t\t\tsize: init.size || input.size || 0\n\t\t});\n\n\t\tconst headers = new Headers(init.headers || input.headers || {});\n\n\t\tif (inputBody != null && !headers.has('Content-Type')) {\n\t\t\tconst contentType = extractContentType(inputBody);\n\t\t\tif (contentType) {\n\t\t\t\theaders.append('Content-Type', contentType);\n\t\t\t}\n\t\t}\n\n\t\tlet signal = isRequest(input) ? input.signal : null;\n\t\tif ('signal' in init) signal = init.signal;\n\n\t\tif (signal != null && !isAbortSignal(signal)) {\n\t\t\tthrow new TypeError('Expected signal to be an instanceof AbortSignal');\n\t\t}\n\n\t\tthis[INTERNALS$2] = {\n\t\t\tmethod,\n\t\t\tredirect: init.redirect || input.redirect || 'follow',\n\t\t\theaders,\n\t\t\tparsedURL,\n\t\t\tsignal\n\t\t};\n\n\t\t// node-fetch-only options\n\t\tthis.follow = init.follow !== undefined ? init.follow : input.follow !== undefined ? input.follow : 20;\n\t\tthis.compress = init.compress !== undefined ? init.compress : input.compress !== undefined ? input.compress : true;\n\t\tthis.counter = init.counter || input.counter || 0;\n\t\tthis.agent = init.agent || input.agent;\n\t}\n\n\tget method() {\n\t\treturn this[INTERNALS$2].method;\n\t}\n\n\tget url() {\n\t\treturn format_url(this[INTERNALS$2].parsedURL);\n\t}\n\n\tget headers() {\n\t\treturn this[INTERNALS$2].headers;\n\t}\n\n\tget redirect() {\n\t\treturn this[INTERNALS$2].redirect;\n\t}\n\n\tget signal() {\n\t\treturn this[INTERNALS$2].signal;\n\t}\n\n\t/**\n  * Clone this request\n  *\n  * @return  Request\n  */\n\tclone() {\n\t\treturn new Request(this);\n\t}\n}\n\nBody.mixIn(Request.prototype);\n\nObject.defineProperty(Request.prototype, Symbol.toStringTag, {\n\tvalue: 'Request',\n\twritable: false,\n\tenumerable: false,\n\tconfigurable: true\n});\n\nObject.defineProperties(Request.prototype, {\n\tmethod: { enumerable: true },\n\turl: { enumerable: true },\n\theaders: { enumerable: true },\n\tredirect: { enumerable: true },\n\tclone: { enumerable: true },\n\tsignal: { enumerable: true }\n});\n\n/**\n * Convert a Request to Node.js http request options.\n *\n * @param   Request  A Request instance\n * @return  Object   The options object to be passed to http.request\n */\nfunction getNodeRequestOptions(request) {\n\tconst parsedURL = request[INTERNALS$2].parsedURL;\n\tconst headers = new Headers(request[INTERNALS$2].headers);\n\n\t// fetch step 1.3\n\tif (!headers.has('Accept')) {\n\t\theaders.set('Accept', '*/*');\n\t}\n\n\t// Basic fetch\n\tif (!parsedURL.protocol || !parsedURL.hostname) {\n\t\tthrow new TypeError('Only absolute URLs are supported');\n\t}\n\n\tif (!/^https?:$/.test(parsedURL.protocol)) {\n\t\tthrow new TypeError('Only HTTP(S) protocols are supported');\n\t}\n\n\tif (request.signal && request.body instanceof Stream.Readable && !streamDestructionSupported) {\n\t\tthrow new Error('Cancellation of streamed requests with AbortSignal is not supported in node < 8');\n\t}\n\n\t// HTTP-network-or-cache fetch steps 2.4-2.7\n\tlet contentLengthValue = null;\n\tif (request.body == null && /^(POST|PUT)$/i.test(request.method)) {\n\t\tcontentLengthValue = '0';\n\t}\n\tif (request.body != null) {\n\t\tconst totalBytes = getTotalBytes(request);\n\t\tif (typeof totalBytes === 'number') {\n\t\t\tcontentLengthValue = String(totalBytes);\n\t\t}\n\t}\n\tif (contentLengthValue) {\n\t\theaders.set('Content-Length', contentLengthValue);\n\t}\n\n\t// HTTP-network-or-cache fetch step 2.11\n\tif (!headers.has('User-Agent')) {\n\t\theaders.set('User-Agent', 'node-fetch/1.0 (+https://github.com/bitinn/node-fetch)');\n\t}\n\n\t// HTTP-network-or-cache fetch step 2.15\n\tif (request.compress && !headers.has('Accept-Encoding')) {\n\t\theaders.set('Accept-Encoding', 'gzip,deflate');\n\t}\n\n\tlet agent = request.agent;\n\tif (typeof agent === 'function') {\n\t\tagent = agent(parsedURL);\n\t}\n\n\tif (!headers.has('Connection') && !agent) {\n\t\theaders.set('Connection', 'close');\n\t}\n\n\t// HTTP-network fetch step 4.2\n\t// chunked encoding is handled by Node.js\n\n\treturn Object.assign({}, parsedURL, {\n\t\tmethod: request.method,\n\t\theaders: exportNodeCompatibleHeaders(headers),\n\t\tagent\n\t});\n}\n\n/**\n * abort-error.js\n *\n * AbortError interface for cancelled requests\n */\n\n/**\n * Create AbortError instance\n *\n * @param   String      message      Error message for human\n * @return  AbortError\n */\nfunction AbortError(message) {\n  Error.call(this, message);\n\n  this.type = 'aborted';\n  this.message = message;\n\n  // hide custom error implementation details from end-users\n  Error.captureStackTrace(this, this.constructor);\n}\n\nAbortError.prototype = Object.create(Error.prototype);\nAbortError.prototype.constructor = AbortError;\nAbortError.prototype.name = 'AbortError';\n\n// fix an issue where \"PassThrough\", \"resolve\" aren't a named export for node <10\nconst PassThrough$1 = Stream.PassThrough;\nconst resolve_url = Url.resolve;\n\n/**\n * Fetch function\n *\n * @param   Mixed    url   Absolute url or Request instance\n * @param   Object   opts  Fetch options\n * @return  Promise\n */\nfunction fetch(url, opts) {\n\n\t// allow custom promise\n\tif (!fetch.Promise) {\n\t\tthrow new Error('native promise missing, set fetch.Promise to your favorite alternative');\n\t}\n\n\tBody.Promise = fetch.Promise;\n\n\t// wrap http.request into fetch\n\treturn new fetch.Promise(function (resolve, reject) {\n\t\t// build request object\n\t\tconst request = new Request(url, opts);\n\t\tconst options = getNodeRequestOptions(request);\n\n\t\tconst send = (options.protocol === 'https:' ? https : http).request;\n\t\tconst signal = request.signal;\n\n\t\tlet response = null;\n\n\t\tconst abort = function abort() {\n\t\t\tlet error = new AbortError('The user aborted a request.');\n\t\t\treject(error);\n\t\t\tif (request.body && request.body instanceof Stream.Readable) {\n\t\t\t\trequest.body.destroy(error);\n\t\t\t}\n\t\t\tif (!response || !response.body) return;\n\t\t\tresponse.body.emit('error', error);\n\t\t};\n\n\t\tif (signal && signal.aborted) {\n\t\t\tabort();\n\t\t\treturn;\n\t\t}\n\n\t\tconst abortAndFinalize = function abortAndFinalize() {\n\t\t\tabort();\n\t\t\tfinalize();\n\t\t};\n\n\t\t// send request\n\t\tconst req = send(options);\n\t\tlet reqTimeout;\n\n\t\tif (signal) {\n\t\t\tsignal.addEventListener('abort', abortAndFinalize);\n\t\t}\n\n\t\tfunction finalize() {\n\t\t\treq.abort();\n\t\t\tif (signal) signal.removeEventListener('abort', abortAndFinalize);\n\t\t\tclearTimeout(reqTimeout);\n\t\t}\n\n\t\tif (request.timeout) {\n\t\t\treq.once('socket', function (socket) {\n\t\t\t\treqTimeout = setTimeout(function () {\n\t\t\t\t\treject(new FetchError(`network timeout at: ${request.url}`, 'request-timeout'));\n\t\t\t\t\tfinalize();\n\t\t\t\t}, request.timeout);\n\t\t\t});\n\t\t}\n\n\t\treq.on('error', function (err) {\n\t\t\treject(new FetchError(`request to ${request.url} failed, reason: ${err.message}`, 'system', err));\n\t\t\tfinalize();\n\t\t});\n\n\t\treq.on('response', function (res) {\n\t\t\tclearTimeout(reqTimeout);\n\n\t\t\tconst headers = createHeadersLenient(res.headers);\n\n\t\t\t// HTTP fetch step 5\n\t\t\tif (fetch.isRedirect(res.statusCode)) {\n\t\t\t\t// HTTP fetch step 5.2\n\t\t\t\tconst location = headers.get('Location');\n\n\t\t\t\t// HTTP fetch step 5.3\n\t\t\t\tconst locationURL = location === null ? null : resolve_url(request.url, location);\n\n\t\t\t\t// HTTP fetch step 5.5\n\t\t\t\tswitch (request.redirect) {\n\t\t\t\t\tcase 'error':\n\t\t\t\t\t\treject(new FetchError(`uri requested responds with a redirect, redirect mode is set to error: ${request.url}`, 'no-redirect'));\n\t\t\t\t\t\tfinalize();\n\t\t\t\t\t\treturn;\n\t\t\t\t\tcase 'manual':\n\t\t\t\t\t\t// node-fetch-specific step: make manual redirect a bit easier to use by setting the Location header value to the resolved URL.\n\t\t\t\t\t\tif (locationURL !== null) {\n\t\t\t\t\t\t\t// handle corrupted header\n\t\t\t\t\t\t\ttry {\n\t\t\t\t\t\t\t\theaders.set('Location', locationURL);\n\t\t\t\t\t\t\t} catch (err) {\n\t\t\t\t\t\t\t\t// istanbul ignore next: nodejs server prevent invalid response headers, we can't test this through normal request\n\t\t\t\t\t\t\t\treject(err);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase 'follow':\n\t\t\t\t\t\t// HTTP-redirect fetch step 2\n\t\t\t\t\t\tif (locationURL === null) {\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\t// HTTP-redirect fetch step 5\n\t\t\t\t\t\tif (request.counter >= request.follow) {\n\t\t\t\t\t\t\treject(new FetchError(`maximum redirect reached at: ${request.url}`, 'max-redirect'));\n\t\t\t\t\t\t\tfinalize();\n\t\t\t\t\t\t\treturn;\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\t// HTTP-redirect fetch step 6 (counter increment)\n\t\t\t\t\t\t// Create a new Request object.\n\t\t\t\t\t\tconst requestOpts = {\n\t\t\t\t\t\t\theaders: new Headers(request.headers),\n\t\t\t\t\t\t\tfollow: request.follow,\n\t\t\t\t\t\t\tcounter: request.counter + 1,\n\t\t\t\t\t\t\tagent: request.agent,\n\t\t\t\t\t\t\tcompress: request.compress,\n\t\t\t\t\t\t\tmethod: request.method,\n\t\t\t\t\t\t\tbody: request.body,\n\t\t\t\t\t\t\tsignal: request.signal,\n\t\t\t\t\t\t\ttimeout: request.timeout,\n\t\t\t\t\t\t\tsize: request.size\n\t\t\t\t\t\t};\n\n\t\t\t\t\t\t// HTTP-redirect fetch step 9\n\t\t\t\t\t\tif (res.statusCode !== 303 && request.body && getTotalBytes(request) === null) {\n\t\t\t\t\t\t\treject(new FetchError('Cannot follow redirect with body being a readable stream', 'unsupported-redirect'));\n\t\t\t\t\t\t\tfinalize();\n\t\t\t\t\t\t\treturn;\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\t// HTTP-redirect fetch step 11\n\t\t\t\t\t\tif (res.statusCode === 303 || (res.statusCode === 301 || res.statusCode === 302) && request.method === 'POST') {\n\t\t\t\t\t\t\trequestOpts.method = 'GET';\n\t\t\t\t\t\t\trequestOpts.body = undefined;\n\t\t\t\t\t\t\trequestOpts.headers.delete('content-length');\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\t// HTTP-redirect fetch step 15\n\t\t\t\t\t\tresolve(fetch(new Request(locationURL, requestOpts)));\n\t\t\t\t\t\tfinalize();\n\t\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t// prepare response\n\t\t\tres.once('end', function () {\n\t\t\t\tif (signal) signal.removeEventListener('abort', abortAndFinalize);\n\t\t\t});\n\t\t\tlet body = res.pipe(new PassThrough$1());\n\n\t\t\tconst response_options = {\n\t\t\t\turl: request.url,\n\t\t\t\tstatus: res.statusCode,\n\t\t\t\tstatusText: res.statusMessage,\n\t\t\t\theaders: headers,\n\t\t\t\tsize: request.size,\n\t\t\t\ttimeout: request.timeout,\n\t\t\t\tcounter: request.counter\n\t\t\t};\n\n\t\t\t// HTTP-network fetch step 12.1.1.3\n\t\t\tconst codings = headers.get('Content-Encoding');\n\n\t\t\t// HTTP-network fetch step 12.1.1.4: handle content codings\n\n\t\t\t// in following scenarios we ignore compression support\n\t\t\t// 1. compression support is disabled\n\t\t\t// 2. HEAD request\n\t\t\t// 3. no Content-Encoding header\n\t\t\t// 4. no content response (204)\n\t\t\t// 5. content not modified response (304)\n\t\t\tif (!request.compress || request.method === 'HEAD' || codings === null || res.statusCode === 204 || res.statusCode === 304) {\n\t\t\t\tresponse = new Response(body, response_options);\n\t\t\t\tresolve(response);\n\t\t\t\treturn;\n\t\t\t}\n\n\t\t\t// For Node v6+\n\t\t\t// Be less strict when decoding compressed responses, since sometimes\n\t\t\t// servers send slightly invalid responses that are still accepted\n\t\t\t// by common browsers.\n\t\t\t// Always using Z_SYNC_FLUSH is what cURL does.\n\t\t\tconst zlibOptions = {\n\t\t\t\tflush: zlib.Z_SYNC_FLUSH,\n\t\t\t\tfinishFlush: zlib.Z_SYNC_FLUSH\n\t\t\t};\n\n\t\t\t// for gzip\n\t\t\tif (codings == 'gzip' || codings == 'x-gzip') {\n\t\t\t\tbody = body.pipe(zlib.createGunzip(zlibOptions));\n\t\t\t\tresponse = new Response(body, response_options);\n\t\t\t\tresolve(response);\n\t\t\t\treturn;\n\t\t\t}\n\n\t\t\t// for deflate\n\t\t\tif (codings == 'deflate' || codings == 'x-deflate') {\n\t\t\t\t// handle the infamous raw deflate response from old servers\n\t\t\t\t// a hack for old IIS and Apache servers\n\t\t\t\tconst raw = res.pipe(new PassThrough$1());\n\t\t\t\traw.once('data', function (chunk) {\n\t\t\t\t\t// see http://stackoverflow.com/questions/37519828\n\t\t\t\t\tif ((chunk[0] & 0x0F) === 0x08) {\n\t\t\t\t\t\tbody = body.pipe(zlib.createInflate());\n\t\t\t\t\t} else {\n\t\t\t\t\t\tbody = body.pipe(zlib.createInflateRaw());\n\t\t\t\t\t}\n\t\t\t\t\tresponse = new Response(body, response_options);\n\t\t\t\t\tresolve(response);\n\t\t\t\t});\n\t\t\t\treturn;\n\t\t\t}\n\n\t\t\t// for br\n\t\t\tif (codings == 'br' && typeof zlib.createBrotliDecompress === 'function') {\n\t\t\t\tbody = body.pipe(zlib.createBrotliDecompress());\n\t\t\t\tresponse = new Response(body, response_options);\n\t\t\t\tresolve(response);\n\t\t\t\treturn;\n\t\t\t}\n\n\t\t\t// otherwise, use response as-is\n\t\t\tresponse = new Response(body, response_options);\n\t\t\tresolve(response);\n\t\t});\n\n\t\twriteToStream(req, request);\n\t});\n}\n/**\n * Redirect code matching\n *\n * @param   Number   code  Status code\n * @return  Boolean\n */\nfetch.isRedirect = function (code) {\n\treturn code === 301 || code === 302 || code === 303 || code === 307 || code === 308;\n};\n\n// expose Promise\nfetch.Promise = global.Promise;\n\nmodule.exports = exports = fetch;\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.default = exports;\nexports.Headers = Headers;\nexports.Request = Request;\nexports.Response = Response;\nexports.FetchError = FetchError;\n\n\n/***/ }),\n\n/***/ 1223:\n/***/ ((module, __unused_webpack_exports, __nccwpck_require__) => {\n\nvar wrappy = __nccwpck_require__(2940)\nmodule.exports = wrappy(once)\nmodule.exports.strict = wrappy(onceStrict)\n\nonce.proto = once(function () {\n  Object.defineProperty(Function.prototype, 'once', {\n    value: function () {\n      return once(this)\n    },\n    configurable: true\n  })\n\n  Object.defineProperty(Function.prototype, 'onceStrict', {\n    value: function () {\n      return onceStrict(this)\n    },\n    configurable: true\n  })\n})\n\nfunction once (fn) {\n  var f = function () {\n    if (f.called) return f.value\n    f.called = true\n    return f.value = fn.apply(this, arguments)\n  }\n  f.called = false\n  return f\n}\n\nfunction onceStrict (fn) {\n  var f = function () {\n    if (f.called)\n      throw new Error(f.onceError)\n    f.called = true\n    return f.value = fn.apply(this, arguments)\n  }\n  var name = fn.name || 'Function wrapped with `once`'\n  f.onceError = name + \" shouldn't be called more than once\"\n  f.called = false\n  return f\n}\n\n\n/***/ }),\n\n/***/ 4294:\n/***/ ((module, __unused_webpack_exports, __nccwpck_require__) => {\n\nmodule.exports = __nccwpck_require__(4219);\n\n\n/***/ }),\n\n/***/ 4219:\n/***/ ((__unused_webpack_module, exports, __nccwpck_require__) => {\n\n\"use strict\";\n\n\nvar net = __nccwpck_require__(1631);\nvar tls = __nccwpck_require__(4016);\nvar http = __nccwpck_require__(8605);\nvar https = __nccwpck_require__(7211);\nvar events = __nccwpck_require__(8614);\nvar assert = __nccwpck_require__(2357);\nvar util = __nccwpck_require__(1669);\n\n\nexports.httpOverHttp = httpOverHttp;\nexports.httpsOverHttp = httpsOverHttp;\nexports.httpOverHttps = httpOverHttps;\nexports.httpsOverHttps = httpsOverHttps;\n\n\nfunction httpOverHttp(options) {\n  var agent = new TunnelingAgent(options);\n  agent.request = http.request;\n  return agent;\n}\n\nfunction httpsOverHttp(options) {\n  var agent = new TunnelingAgent(options);\n  agent.request = http.request;\n  agent.createSocket = createSecureSocket;\n  agent.defaultPort = 443;\n  return agent;\n}\n\nfunction httpOverHttps(options) {\n  var agent = new TunnelingAgent(options);\n  agent.request = https.request;\n  return agent;\n}\n\nfunction httpsOverHttps(options) {\n  var agent = new TunnelingAgent(options);\n  agent.request = https.request;\n  agent.createSocket = createSecureSocket;\n  agent.defaultPort = 443;\n  return agent;\n}\n\n\nfunction TunnelingAgent(options) {\n  var self = this;\n  self.options = options || {};\n  self.proxyOptions = self.options.proxy || {};\n  self.maxSockets = self.options.maxSockets || http.Agent.defaultMaxSockets;\n  self.requests = [];\n  self.sockets = [];\n\n  self.on('free', function onFree(socket, host, port, localAddress) {\n    var options = toOptions(host, port, localAddress);\n    for (var i = 0, len = self.requests.length; i < len; ++i) {\n      var pending = self.requests[i];\n      if (pending.host === options.host && pending.port === options.port) {\n        // Detect the request to connect same origin server,\n        // reuse the connection.\n        self.requests.splice(i, 1);\n        pending.request.onSocket(socket);\n        return;\n      }\n    }\n    socket.destroy();\n    self.removeSocket(socket);\n  });\n}\nutil.inherits(TunnelingAgent, events.EventEmitter);\n\nTunnelingAgent.prototype.addRequest = function addRequest(req, host, port, localAddress) {\n  var self = this;\n  var options = mergeOptions({request: req}, self.options, toOptions(host, port, localAddress));\n\n  if (self.sockets.length >= this.maxSockets) {\n    // We are over limit so we'll add it to the queue.\n    self.requests.push(options);\n    return;\n  }\n\n  // If we are under maxSockets create a new one.\n  self.createSocket(options, function(socket) {\n    socket.on('free', onFree);\n    socket.on('close', onCloseOrRemove);\n    socket.on('agentRemove', onCloseOrRemove);\n    req.onSocket(socket);\n\n    function onFree() {\n      self.emit('free', socket, options);\n    }\n\n    function onCloseOrRemove(err) {\n      self.removeSocket(socket);\n      socket.removeListener('free', onFree);\n      socket.removeListener('close', onCloseOrRemove);\n      socket.removeListener('agentRemove', onCloseOrRemove);\n    }\n  });\n};\n\nTunnelingAgent.prototype.createSocket = function createSocket(options, cb) {\n  var self = this;\n  var placeholder = {};\n  self.sockets.push(placeholder);\n\n  var connectOptions = mergeOptions({}, self.proxyOptions, {\n    method: 'CONNECT',\n    path: options.host + ':' + options.port,\n    agent: false,\n    headers: {\n      host: options.host + ':' + options.port\n    }\n  });\n  if (options.localAddress) {\n    connectOptions.localAddress = options.localAddress;\n  }\n  if (connectOptions.proxyAuth) {\n    connectOptions.headers = connectOptions.headers || {};\n    connectOptions.headers['Proxy-Authorization'] = 'Basic ' +\n        new Buffer(connectOptions.proxyAuth).toString('base64');\n  }\n\n  debug('making CONNECT request');\n  var connectReq = self.request(connectOptions);\n  connectReq.useChunkedEncodingByDefault = false; // for v0.6\n  connectReq.once('response', onResponse); // for v0.6\n  connectReq.once('upgrade', onUpgrade);   // for v0.6\n  connectReq.once('connect', onConnect);   // for v0.7 or later\n  connectReq.once('error', onError);\n  connectReq.end();\n\n  function onResponse(res) {\n    // Very hacky. This is necessary to avoid http-parser leaks.\n    res.upgrade = true;\n  }\n\n  function onUpgrade(res, socket, head) {\n    // Hacky.\n    process.nextTick(function() {\n      onConnect(res, socket, head);\n    });\n  }\n\n  function onConnect(res, socket, head) {\n    connectReq.removeAllListeners();\n    socket.removeAllListeners();\n\n    if (res.statusCode !== 200) {\n      debug('tunneling socket could not be established, statusCode=%d',\n        res.statusCode);\n      socket.destroy();\n      var error = new Error('tunneling socket could not be established, ' +\n        'statusCode=' + res.statusCode);\n      error.code = 'ECONNRESET';\n      options.request.emit('error', error);\n      self.removeSocket(placeholder);\n      return;\n    }\n    if (head.length > 0) {\n      debug('got illegal response body from proxy');\n      socket.destroy();\n      var error = new Error('got illegal response body from proxy');\n      error.code = 'ECONNRESET';\n      options.request.emit('error', error);\n      self.removeSocket(placeholder);\n      return;\n    }\n    debug('tunneling connection has established');\n    self.sockets[self.sockets.indexOf(placeholder)] = socket;\n    return cb(socket);\n  }\n\n  function onError(cause) {\n    connectReq.removeAllListeners();\n\n    debug('tunneling socket could not be established, cause=%s\\n',\n          cause.message, cause.stack);\n    var error = new Error('tunneling socket could not be established, ' +\n                          'cause=' + cause.message);\n    error.code = 'ECONNRESET';\n    options.request.emit('error', error);\n    self.removeSocket(placeholder);\n  }\n};\n\nTunnelingAgent.prototype.removeSocket = function removeSocket(socket) {\n  var pos = this.sockets.indexOf(socket)\n  if (pos === -1) {\n    return;\n  }\n  this.sockets.splice(pos, 1);\n\n  var pending = this.requests.shift();\n  if (pending) {\n    // If we have pending requests and a socket gets closed a new one\n    // needs to be created to take over in the pool for the one that closed.\n    this.createSocket(pending, function(socket) {\n      pending.request.onSocket(socket);\n    });\n  }\n};\n\nfunction createSecureSocket(options, cb) {\n  var self = this;\n  TunnelingAgent.prototype.createSocket.call(self, options, function(socket) {\n    var hostHeader = options.request.getHeader('host');\n    var tlsOptions = mergeOptions({}, self.options, {\n      socket: socket,\n      servername: hostHeader ? hostHeader.replace(/:.*$/, '') : options.host\n    });\n\n    // 0 is dummy port for v0.6\n    var secureSocket = tls.connect(0, tlsOptions);\n    self.sockets[self.sockets.indexOf(socket)] = secureSocket;\n    cb(secureSocket);\n  });\n}\n\n\nfunction toOptions(host, port, localAddress) {\n  if (typeof host === 'string') { // since v0.10\n    return {\n      host: host,\n      port: port,\n      localAddress: localAddress\n    };\n  }\n  return host; // for v0.11 or later\n}\n\nfunction mergeOptions(target) {\n  for (var i = 1, len = arguments.length; i < len; ++i) {\n    var overrides = arguments[i];\n    if (typeof overrides === 'object') {\n      var keys = Object.keys(overrides);\n      for (var j = 0, keyLen = keys.length; j < keyLen; ++j) {\n        var k = keys[j];\n        if (overrides[k] !== undefined) {\n          target[k] = overrides[k];\n        }\n      }\n    }\n  }\n  return target;\n}\n\n\nvar debug;\nif (process.env.NODE_DEBUG && /\\btunnel\\b/.test(process.env.NODE_DEBUG)) {\n  debug = function() {\n    var args = Array.prototype.slice.call(arguments);\n    if (typeof args[0] === 'string') {\n      args[0] = 'TUNNEL: ' + args[0];\n    } else {\n      args.unshift('TUNNEL:');\n    }\n    console.error.apply(console, args);\n  }\n} else {\n  debug = function() {};\n}\nexports.debug = debug; // for test\n\n\n/***/ }),\n\n/***/ 5030:\n/***/ ((__unused_webpack_module, exports) => {\n\n\"use strict\";\n\n\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\n\nfunction getUserAgent() {\n  if (typeof navigator === \"object\" && \"userAgent\" in navigator) {\n    return navigator.userAgent;\n  }\n\n  if (typeof process === \"object\" && \"version\" in process) {\n    return `Node.js/${process.version.substr(1)} (${process.platform}; ${process.arch})`;\n  }\n\n  return \"<environment undetectable>\";\n}\n\nexports.getUserAgent = getUserAgent;\n//# sourceMappingURL=index.js.map\n\n\n/***/ }),\n\n/***/ 2940:\n/***/ ((module) => {\n\n// Returns a wrapper function that returns a wrapped callback\n// The wrapper function should do some stuff, and return a\n// presumably different callback function.\n// This makes sure that own properties are retained, so that\n// decorations and such are not lost along the way.\nmodule.exports = wrappy\nfunction wrappy (fn, cb) {\n  if (fn && cb) return wrappy(fn)(cb)\n\n  if (typeof fn !== 'function')\n    throw new TypeError('need wrapper function')\n\n  Object.keys(fn).forEach(function (k) {\n    wrapper[k] = fn[k]\n  })\n\n  return wrapper\n\n  function wrapper() {\n    var args = new Array(arguments.length)\n    for (var i = 0; i < args.length; i++) {\n      args[i] = arguments[i]\n    }\n    var ret = fn.apply(this, args)\n    var cb = args[args.length-1]\n    if (typeof ret === 'function' && ret !== cb) {\n      Object.keys(cb).forEach(function (k) {\n        ret[k] = cb[k]\n      })\n    }\n    return ret\n  }\n}\n\n\n/***/ }),\n\n/***/ 2877:\n/***/ ((module) => {\n\nmodule.exports = eval(\"require\")(\"encoding\");\n\n\n/***/ }),\n\n/***/ 2941:\n/***/ ((module) => {\n\nmodule.exports = eval(\"require\")(\"original-fs\");\n\n\n/***/ }),\n\n/***/ 2357:\n/***/ ((module) => {\n\n\"use strict\";\nmodule.exports = require(\"assert\");;\n\n/***/ }),\n\n/***/ 6417:\n/***/ ((module) => {\n\n\"use strict\";\nmodule.exports = require(\"crypto\");;\n\n/***/ }),\n\n/***/ 8614:\n/***/ ((module) => {\n\n\"use strict\";\nmodule.exports = require(\"events\");;\n\n/***/ }),\n\n/***/ 5747:\n/***/ ((module) => {\n\n\"use strict\";\nmodule.exports = require(\"fs\");;\n\n/***/ }),\n\n/***/ 8605:\n/***/ ((module) => {\n\n\"use strict\";\nmodule.exports = require(\"http\");;\n\n/***/ }),\n\n/***/ 7211:\n/***/ ((module) => {\n\n\"use strict\";\nmodule.exports = require(\"https\");;\n\n/***/ }),\n\n/***/ 1631:\n/***/ ((module) => {\n\n\"use strict\";\nmodule.exports = require(\"net\");;\n\n/***/ }),\n\n/***/ 2087:\n/***/ ((module) => {\n\n\"use strict\";\nmodule.exports = require(\"os\");;\n\n/***/ }),\n\n/***/ 5622:\n/***/ ((module) => {\n\n\"use strict\";\nmodule.exports = require(\"path\");;\n\n/***/ }),\n\n/***/ 2413:\n/***/ ((module) => {\n\n\"use strict\";\nmodule.exports = require(\"stream\");;\n\n/***/ }),\n\n/***/ 4016:\n/***/ ((module) => {\n\n\"use strict\";\nmodule.exports = require(\"tls\");;\n\n/***/ }),\n\n/***/ 8835:\n/***/ ((module) => {\n\n\"use strict\";\nmodule.exports = require(\"url\");;\n\n/***/ }),\n\n/***/ 1669:\n/***/ ((module) => {\n\n\"use strict\";\nmodule.exports = require(\"util\");;\n\n/***/ }),\n\n/***/ 8761:\n/***/ ((module) => {\n\n\"use strict\";\nmodule.exports = require(\"zlib\");;\n\n/***/ })\n\n/******/ \t});\n/************************************************************************/\n/******/ \t// The module cache\n/******/ \tvar __webpack_module_cache__ = {};\n/******/ \t\n/******/ \t// The require function\n/******/ \tfunction __nccwpck_require__(moduleId) {\n/******/ \t\t// Check if module is in cache\n/******/ \t\tif(__webpack_module_cache__[moduleId]) {\n/******/ \t\t\treturn __webpack_module_cache__[moduleId].exports;\n/******/ \t\t}\n/******/ \t\t// Create a new module (and put it into the cache)\n/******/ \t\tvar module = __webpack_module_cache__[moduleId] = {\n/******/ \t\t\t// no module.id needed\n/******/ \t\t\t// no module.loaded needed\n/******/ \t\t\texports: {}\n/******/ \t\t};\n/******/ \t\n/******/ \t\t// Execute the module function\n/******/ \t\tvar threw = true;\n/******/ \t\ttry {\n/******/ \t\t\t__webpack_modules__[moduleId].call(module.exports, module, module.exports, __nccwpck_require__);\n/******/ \t\t\tthrew = false;\n/******/ \t\t} finally {\n/******/ \t\t\tif(threw) delete __webpack_module_cache__[moduleId];\n/******/ \t\t}\n/******/ \t\n/******/ \t\t// Return the exports of the module\n/******/ \t\treturn module.exports;\n/******/ \t}\n/******/ \t\n/************************************************************************/\n/******/ \t/* webpack/runtime/compat */\n/******/ \t\n/******/ \t__nccwpck_require__.ab = __dirname + \"/\";/************************************************************************/\n/******/ \t// module exports must be returned from runtime so entry inlining is disabled\n/******/ \t// startup\n/******/ \t// Load entry module and return exports\n/******/ \treturn __nccwpck_require__(5496);\n/******/ })()\n;"
  },
  {
    "path": ".github/actions/check_artifact_exists/dist/licenses.txt",
    "content": "@actions/core\nMIT\nThe MIT License (MIT)\n\nCopyright 2019 GitHub\n\nPermission 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:\n\nThe above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.\n\nTHE 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.\n\n@actions/github\nMIT\n\n@actions/http-client\nMIT\nActions Http Client for Node.js\n\nCopyright (c) GitHub, Inc.\n\nAll rights reserved.\n\nMIT License\n\nPermission is hereby granted, free of charge, to any person obtaining a copy of this software and\nassociated documentation files (the \"Software\"), to deal in the Software without restriction,\nincluding without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense,\nand/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so,\nsubject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED *AS IS*, WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT\nLIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\nNO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,\nWHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE\nSOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n\n@octokit/auth-token\nMIT\nThe MIT License\n\nCopyright (c) 2019 Octokit contributors\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in\nall copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\nTHE SOFTWARE.\n\n\n@octokit/core\nMIT\nThe MIT License\n\nCopyright (c) 2019 Octokit contributors\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in\nall copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\nTHE SOFTWARE.\n\n\n@octokit/endpoint\nMIT\nThe MIT License\n\nCopyright (c) 2018 Octokit contributors\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in\nall copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\nTHE SOFTWARE.\n\n\n@octokit/graphql\nMIT\nThe MIT License\n\nCopyright (c) 2018 Octokit contributors\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in\nall copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\nTHE SOFTWARE.\n\n\n@octokit/plugin-paginate-rest\nMIT\nMIT License Copyright (c) 2019 Octokit contributors\n\nPermission 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:\n\nThe above copyright notice and this permission notice (including the next paragraph) shall be included in all copies or substantial portions of the Software.\n\nTHE 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.\n\n\n@octokit/plugin-rest-endpoint-methods\nMIT\nMIT License Copyright (c) 2019 Octokit contributors\n\nPermission 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:\n\nThe above copyright notice and this permission notice (including the next paragraph) shall be included in all copies or substantial portions of the Software.\n\nTHE 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.\n\n\n@octokit/plugin-throttling\nMIT\nThe MIT License\n\nCopyright (c) 2018 Octokit contributors\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in\nall copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\nTHE SOFTWARE.\n\n\n@octokit/request\nMIT\nThe MIT License\n\nCopyright (c) 2018 Octokit contributors\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in\nall copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\nTHE SOFTWARE.\n\n\n@octokit/request-error\nMIT\nThe MIT License\n\nCopyright (c) 2019 Octokit contributors\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in\nall copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\nTHE SOFTWARE.\n\n\n@vercel/ncc\nMIT\nCopyright 2018 ZEIT, Inc.\n\nPermission 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:\n\nThe above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.\n\nTHE 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.\n\nadm-zip\nMIT\nMIT License\n\nCopyright (c) 2012 Another-D-Mention Software and other contributors\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in all\ncopies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\nSOFTWARE.\n\n\nbefore-after-hook\nApache-2.0\n                                 Apache License\n                           Version 2.0, January 2004\n                        http://www.apache.org/licenses/\n\n   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION\n\n   1. Definitions.\n\n      \"License\" shall mean the terms and conditions for use, reproduction,\n      and distribution as defined by Sections 1 through 9 of this document.\n\n      \"Licensor\" shall mean the copyright owner or entity authorized by\n      the copyright owner that is granting the License.\n\n      \"Legal Entity\" shall mean the union of the acting entity and all\n      other entities that control, are controlled by, or are under common\n      control with that entity. For the purposes of this definition,\n      \"control\" means (i) the power, direct or indirect, to cause the\n      direction or management of such entity, whether by contract or\n      otherwise, or (ii) ownership of fifty percent (50%) or more of the\n      outstanding shares, or (iii) beneficial ownership of such entity.\n\n      \"You\" (or \"Your\") shall mean an individual or Legal Entity\n      exercising permissions granted by this License.\n\n      \"Source\" form shall mean the preferred form for making modifications,\n      including but not limited to software source code, documentation\n      source, and configuration files.\n\n      \"Object\" form shall mean any form resulting from mechanical\n      transformation or translation of a Source form, including but\n      not limited to compiled object code, generated documentation,\n      and conversions to other media types.\n\n      \"Work\" shall mean the work of authorship, whether in Source or\n      Object form, made available under the License, as indicated by a\n      copyright notice that is included in or attached to the work\n      (an example is provided in the Appendix below).\n\n      \"Derivative Works\" shall mean any work, whether in Source or Object\n      form, that is based on (or derived from) the Work and for which the\n      editorial revisions, annotations, elaborations, or other modifications\n      represent, as a whole, an original work of authorship. For the purposes\n      of this License, Derivative Works shall not include works that remain\n      separable from, or merely link (or bind by name) to the interfaces of,\n      the Work and Derivative Works thereof.\n\n      \"Contribution\" shall mean any work of authorship, including\n      the original version of the Work and any modifications or additions\n      to that Work or Derivative Works thereof, that is intentionally\n      submitted to Licensor for inclusion in the Work by the copyright owner\n      or by an individual or Legal Entity authorized to submit on behalf of\n      the copyright owner. For the purposes of this definition, \"submitted\"\n      means any form of electronic, verbal, or written communication sent\n      to the Licensor or its representatives, including but not limited to\n      communication on electronic mailing lists, source code control systems,\n      and issue tracking systems that are managed by, or on behalf of, the\n      Licensor for the purpose of discussing and improving the Work, but\n      excluding communication that is conspicuously marked or otherwise\n      designated in writing by the copyright owner as \"Not a Contribution.\"\n\n      \"Contributor\" shall mean Licensor and any individual or Legal Entity\n      on behalf of whom a Contribution has been received by Licensor and\n      subsequently incorporated within the Work.\n\n   2. Grant of Copyright License. Subject to the terms and conditions of\n      this License, each Contributor hereby grants to You a perpetual,\n      worldwide, non-exclusive, no-charge, royalty-free, irrevocable\n      copyright license to reproduce, prepare Derivative Works of,\n      publicly display, publicly perform, sublicense, and distribute the\n      Work and such Derivative Works in Source or Object form.\n\n   3. Grant of Patent License. Subject to the terms and conditions of\n      this License, each Contributor hereby grants to You a perpetual,\n      worldwide, non-exclusive, no-charge, royalty-free, irrevocable\n      (except as stated in this section) patent license to make, have made,\n      use, offer to sell, sell, import, and otherwise transfer the Work,\n      where such license applies only to those patent claims licensable\n      by such Contributor that are necessarily infringed by their\n      Contribution(s) alone or by combination of their Contribution(s)\n      with the Work to which such Contribution(s) was submitted. If You\n      institute patent litigation against any entity (including a\n      cross-claim or counterclaim in a lawsuit) alleging that the Work\n      or a Contribution incorporated within the Work constitutes direct\n      or contributory patent infringement, then any patent licenses\n      granted to You under this License for that Work shall terminate\n      as of the date such litigation is filed.\n\n   4. Redistribution. You may reproduce and distribute copies of the\n      Work or Derivative Works thereof in any medium, with or without\n      modifications, and in Source or Object form, provided that You\n      meet the following conditions:\n\n      (a) You must give any other recipients of the Work or\n          Derivative Works a copy of this License; and\n\n      (b) You must cause any modified files to carry prominent notices\n          stating that You changed the files; and\n\n      (c) You must retain, in the Source form of any Derivative Works\n          that You distribute, all copyright, patent, trademark, and\n          attribution notices from the Source form of the Work,\n          excluding those notices that do not pertain to any part of\n          the Derivative Works; and\n\n      (d) If the Work includes a \"NOTICE\" text file as part of its\n          distribution, then any Derivative Works that You distribute must\n          include a readable copy of the attribution notices contained\n          within such NOTICE file, excluding those notices that do not\n          pertain to any part of the Derivative Works, in at least one\n          of the following places: within a NOTICE text file distributed\n          as part of the Derivative Works; within the Source form or\n          documentation, if provided along with the Derivative Works; or,\n          within a display generated by the Derivative Works, if and\n          wherever such third-party notices normally appear. The contents\n          of the NOTICE file are for informational purposes only and\n          do not modify the License. You may add Your own attribution\n          notices within Derivative Works that You distribute, alongside\n          or as an addendum to the NOTICE text from the Work, provided\n          that such additional attribution notices cannot be construed\n          as modifying the License.\n\n      You may add Your own copyright statement to Your modifications and\n      may provide additional or different license terms and conditions\n      for use, reproduction, or distribution of Your modifications, or\n      for any such Derivative Works as a whole, provided Your use,\n      reproduction, and distribution of the Work otherwise complies with\n      the conditions stated in this License.\n\n   5. Submission of Contributions. Unless You explicitly state otherwise,\n      any Contribution intentionally submitted for inclusion in the Work\n      by You to the Licensor shall be under the terms and conditions of\n      this License, without any additional terms or conditions.\n      Notwithstanding the above, nothing herein shall supersede or modify\n      the terms of any separate license agreement you may have executed\n      with Licensor regarding such Contributions.\n\n   6. Trademarks. This License does not grant permission to use the trade\n      names, trademarks, service marks, or product names of the Licensor,\n      except as required for reasonable and customary use in describing the\n      origin of the Work and reproducing the content of the NOTICE file.\n\n   7. Disclaimer of Warranty. Unless required by applicable law or\n      agreed to in writing, Licensor provides the Work (and each\n      Contributor provides its Contributions) on an \"AS IS\" BASIS,\n      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or\n      implied, including, without limitation, any warranties or conditions\n      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A\n      PARTICULAR PURPOSE. You are solely responsible for determining the\n      appropriateness of using or redistributing the Work and assume any\n      risks associated with Your exercise of permissions under this License.\n\n   8. Limitation of Liability. In no event and under no legal theory,\n      whether in tort (including negligence), contract, or otherwise,\n      unless required by applicable law (such as deliberate and grossly\n      negligent acts) or agreed to in writing, shall any Contributor be\n      liable to You for damages, including any direct, indirect, special,\n      incidental, or consequential damages of any character arising as a\n      result of this License or out of the use or inability to use the\n      Work (including but not limited to damages for loss of goodwill,\n      work stoppage, computer failure or malfunction, or any and all\n      other commercial damages or losses), even if such Contributor\n      has been advised of the possibility of such damages.\n\n   9. Accepting Warranty or Additional Liability. While redistributing\n      the Work or Derivative Works thereof, You may choose to offer,\n      and charge a fee for, acceptance of support, warranty, indemnity,\n      or other liability obligations and/or rights consistent with this\n      License. However, in accepting such obligations, You may act only\n      on Your own behalf and on Your sole responsibility, not on behalf\n      of any other Contributor, and only if You agree to indemnify,\n      defend, and hold each Contributor harmless for any liability\n      incurred by, or claims asserted against, such Contributor by reason\n      of your accepting any such warranty or additional liability.\n\n   END OF TERMS AND CONDITIONS\n\n   APPENDIX: How to apply the Apache License to your work.\n\n      To apply the Apache License to your work, attach the following\n      boilerplate notice, with the fields enclosed by brackets \"{}\"\n      replaced with your own identifying information. (Don't include\n      the brackets!)  The text should be enclosed in the appropriate\n      comment syntax for the file format. We also recommend that a\n      file or class name and description of purpose be included on the\n      same \"printed page\" as the copyright notice for easier\n      identification within third-party archives.\n\n   Copyright 2018 Gregor Martynus and other contributors.\n\n   Licensed under the Apache License, Version 2.0 (the \"License\");\n   you may not use this file except in compliance with the License.\n   You may obtain a copy of the License at\n\n       http://www.apache.org/licenses/LICENSE-2.0\n\n   Unless required by applicable law or agreed to in writing, software\n   distributed under the License is distributed on an \"AS IS\" BASIS,\n   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n   See the License for the specific language governing permissions and\n   limitations under the License.\n\n\nbottleneck\nMIT\nThe MIT License (MIT)\n\nCopyright (c) 2014 Simon Grondin\n\nPermission is hereby granted, free of charge, to any person obtaining a copy of\nthis software and associated documentation files (the \"Software\"), to deal in\nthe Software without restriction, including without limitation the rights to\nuse, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of\nthe Software, and to permit persons to whom the Software is furnished to do so,\nsubject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in all\ncopies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS\nFOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR\nCOPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER\nIN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN\nCONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n\ndeprecation\nISC\nThe ISC License\n\nCopyright (c) Gregor Martynus and contributors\n\nPermission to use, copy, modify, and/or distribute this software for any\npurpose with or without fee is hereby granted, provided that the above\ncopyright notice and this permission notice appear in all copies.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES\nWITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF\nMERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR\nANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES\nWHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN\nACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR\nIN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.\n\n\nfilesize\nBSD-3-Clause\nCopyright (c) 2020, Jason Mulligan\nAll rights reserved.\n\nRedistribution and use in source and binary forms, with or without\nmodification, are permitted provided that the following conditions are met:\n\n* Redistributions of source code must retain the above copyright notice, this\n  list of conditions and the following disclaimer.\n\n* Redistributions in binary form must reproduce the above copyright notice,\n  this list of conditions and the following disclaimer in the documentation\n  and/or other materials provided with the distribution.\n\n* Neither the name of filesize nor the names of its\n  contributors may be used to endorse or promote products derived from\n  this software without specific prior written permission.\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\nAND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\nIMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\nDISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\nFOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\nDAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\nSERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\nCAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\nOR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\nOF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\n\n\nis-plain-object\nMIT\nThe MIT License (MIT)\n\nCopyright (c) 2014-2017, Jon Schlinkert.\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in\nall copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\nTHE SOFTWARE.\n\n\nnode-fetch\nMIT\nThe MIT License (MIT)\n\nCopyright (c) 2016 David Frank\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in all\ncopies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\nSOFTWARE.\n\n\n\nonce\nISC\nThe ISC License\n\nCopyright (c) Isaac Z. Schlueter and Contributors\n\nPermission to use, copy, modify, and/or distribute this software for any\npurpose with or without fee is hereby granted, provided that the above\ncopyright notice and this permission notice appear in all copies.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES\nWITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF\nMERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR\nANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES\nWHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN\nACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR\nIN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.\n\n\ntunnel\nMIT\nThe MIT License (MIT)\n\nCopyright (c) 2012 Koichi Kobayashi\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in\nall copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\nTHE SOFTWARE.\n\n\nuniversal-user-agent\nISC\n# [ISC License](https://spdx.org/licenses/ISC)\n\nCopyright (c) 2018, Gregor Martynus (https://github.com/gr2m)\n\nPermission to use, copy, modify, and/or distribute this software for any purpose with or without fee is hereby granted, provided that the above copyright notice and this permission notice appear in all copies.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, 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 THIS SOFTWARE.\n\n\nwrappy\nISC\nThe ISC License\n\nCopyright (c) Isaac Z. Schlueter and Contributors\n\nPermission to use, copy, modify, and/or distribute this software for any\npurpose with or without fee is hereby granted, provided that the above\ncopyright notice and this permission notice appear in all copies.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES\nWITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF\nMERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR\nANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES\nWHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN\nACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR\nIN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.\n"
  },
  {
    "path": ".github/actions/check_artifact_exists/main.js",
    "content": "const core = require('@actions/core');\nconst github = require('@actions/github');\nconst AdmZip = require('adm-zip');\nconst filesize = require('filesize');\nconst pathname = require('path');\nconst fs = require('fs');\nconst { throttling } = require('@octokit/plugin-throttling');\nconst { GitHub } = require('@actions/github/lib/utils');\n\nasync function getGoodArtifacts(client, owner, repo, name) {\n    const goodRepoArtifacts = await client.paginate(\n        \"GET /repos/{owner}/{repo}/actions/artifacts\",\n        {\n            owner: owner,\n            repo: repo,\n            per_page: 100,\n        },\n        (repoArtifacts, done) => {\n            // console.log(\" ==> repoArtifacts\", repoArtifacts);\n            const goodArtifacts = repoArtifacts.data.filter((a) => {\n                // console.log(\"==> Artifact check\", a);\n                return a.name == name\n            });\n            if (goodArtifacts.length > 0) {\n                done();\n            }\n            return goodArtifacts;\n        }\n    );\n\n    console.log(\"==> maybe goodRepoArtifacts:\", goodRepoArtifacts);\n    return goodRepoArtifacts;\n}\n\nasync function main() {\n    const token = core.getInput(\"github_token\", { required: true });\n    const [owner, repo] = core.getInput(\"repo\", { required: true }).split(\"/\");\n    const path = core.getInput(\"path\", { required: true });\n    const name = core.getInput(\"name\");\n    const download = core.getInput(\"download\");\n    const OctokitWithThrottling = GitHub.plugin(throttling);\n    const client = new OctokitWithThrottling({\n        auth: token,\n        throttle: {\n            onRateLimit: (retryAfter, options) => {\n                console.log(\n                    `Request quota exhausted for request ${options.method} ${options.url}`\n                );\n\n                // Retry twice after hitting a rate limit error, then give up\n                if (options.request.retryCount <= 2) {\n                    console.log(`Retrying after ${retryAfter} seconds!`);\n                    return true;\n                }\n            },\n            onAbuseLimit: (retryAfter, options) => {\n                // does not retry, only logs a warning\n                console.log(\n                    `Abuse detected for request ${options.method} ${options.url}`\n                );\n            },\n        },\n    });\n    console.log(\"==> Repo:\", owner + \"/\" + repo);\n\n    const goodArtifacts = await getGoodArtifacts(client, owner, repo, name);\n    console.log(\"==> goodArtifacts:\", goodArtifacts);\n\n    let artifactStatus = \"\";\n        if (goodArtifacts.length === 0) {\n        artifactStatus = \"missing\";\n    } else {\n        artifactStatus = \"found\";\n    }\n\n    console.log(\"==> Artifact\", name, artifactStatus);\n    console.log(\"==> download\", download);\n\n    core.setOutput(\"status\", artifactStatus);\n\n    if (artifactStatus === \"found\" && download == \"true\") {\n        console.log(\"==> # artifacts:\", goodArtifacts.length);\n\n        let artifact = goodArtifacts[0];\n\n        console.log(\"==> Artifact:\", artifact.id)\n\n        const size = filesize(artifact.size_in_bytes, { base: 10 })\n\n        console.log(\"==> Downloading:\", artifact.name + \".zip\", `(${size})`)\n\n        const zip = await client.actions.downloadArtifact({\n            owner: owner,\n            repo: repo,\n            artifact_id: artifact.id,\n            archive_format: \"zip\",\n        })\n\n        const dir = name ? path : pathname.join(path, artifact.name)\n\n        fs.mkdirSync(dir, { recursive: true })\n\n        const adm = new AdmZip(Buffer.from(zip.data))\n\n        adm.getEntries().forEach((entry) => {\n            const action = entry.isDirectory ? \"creating\" : \"inflating\"\n            const filepath = pathname.join(dir, entry.entryName)\n            console.log(`  ${action}: ${filepath}`)\n        })\n\n        adm.extractAllTo(dir, true)\n    }\n\n    if (artifactStatus === \"missing\" && download == \"true\") {\n        core.setFailed(\"Required\", name, \"that is missing\");\n    }\n\n    return;\n}\n\n// We have to manually wrap the main function with a try-catch here because\n// GitHub will ignore uncatched exceptions and continue running the workflow,\n// leading to harder to diagnose errors downstream from this action.\ntry {\n    main();\n} catch (error) {\n    core.setFailed(error.message);\n}\n"
  },
  {
    "path": ".github/actions/check_artifact_exists/package.json",
    "content": "{\n  \"name\": \"check_artifact_exists\",\n  \"main\": \"main.js\",\n  \"devDependencies\": {\n    \"@actions/core\": \"^1.2.6\",\n    \"@actions/github\": \"^4.0.0\",\n    \"@octokit/plugin-throttling\": \"^3.4.1\",\n    \"@vercel/ncc\": \"^0.27.0\",\n    \"adm-zip\": \"^0.5.2\",\n    \"filesize\": \"^6.1.0\"\n  }\n}\n"
  },
  {
    "path": ".github/actions/chroot-bind-mount/action.yml",
    "content": "name: \"chroot bind mount\"\ndescription: \"Bind mount into chroot\"\ninputs:\n  mounts:\n    description: \"Path to consider\"\n    required: true\nruns:\n  using: \"composite\"\n  steps:\n    - id: install_qemu\n      run: |\n        sudo apt-get update -y\n        sudo apt-get install -y --no-install-recommends qemu-user-static\n      shell: bash\n    - id: bind_mount_chroot\n      run: |\n        set -xe\n\n        # Bind-mount so that we have the same tree inside the chroot\n        for dev in ${{ github.workspace }} ${{ inputs.mounts }};\n        do\n          sudo mount -o bind ${dev} ${{ env.SYSTEM_RASPBIAN }}${dev}\n        done;\n\n          for dev in ${{ inputs.mounts }};\n          do\n            sudo mount -o bind /${dev} ${{ env.SYSTEM_RASPBIAN }}/${dev}\n          done;\n      shell: bash\n"
  },
  {
    "path": ".github/actions/get_cache_key/README.md",
    "content": "GitHub Action to compute cache key\n==================================\n\nIt is intended to work in harmony with `check_artifact_exists`:\n - compute a stable cache key\n - as simple to use as possible (less parameters)\n\nIt will expect to be ran in a GitHub Action job that follows\n`SUBMODULE_FLAVOR-PLATFORM`:\n - it will use the `SUBMODULE` part to check what is the current SHA1 of this git submodule.\n - the `FLAVOR` allows to distringuish e.g., opt/dbg builds\n - the PLATFORM permits defining an os/arch couple\n\nIt allows for an `extras` field for extensive customization, like forcing a\nre-build.\n"
  },
  {
    "path": ".github/actions/get_cache_key/action.yml",
    "content": "name: \"get cache key for submodule\"\ndescription: \"Compute a cache key based on git submodule\"\ninputs:\n  extras:\n    description: \"Extra cache key value\"\n    required: true\n  osarch:\n    description: \"Override automatic OSARCH value\"\n    required: false\noutputs:\n  key:\n    description: \"Computed cache key name\"\n    value: ${{ steps.compute_cache_key.outputs.key }}\nruns:\n  using: \"composite\"\n  steps:\n    - id: compute_cache_key\n      run: |\n        JOB=${{ github.job }}\n        SUBMODULE=$(echo $JOB | cut -d'-' -f1 | cut -d'_' -f1)\n        FLAVOR=$(echo $JOB | cut -d'-' -f1 | cut -d'_' -f2)\n\n        if [ -z \"${{ inputs.osarch }}\" ]; then\n          OSARCH=$(echo $JOB | cut -d'-' -f2)\n        else\n          OSARCH=${{ inputs.osarch }}\n        fi\n\n        SHA=$(git submodule status ${SUBMODULE} | sed -e 's/^-//g' -e 's/^+//g' -e 's/^U//g' | awk '{ print $1 }')\n\n        KEY=${SUBMODULE}-${FLAVOR}_${OSARCH}_${SHA}_${{ inputs.extras }}\n        echo \"::set-output name=key::${KEY}\"\n      shell: bash\n"
  },
  {
    "path": ".github/actions/host-build/action.yml",
    "content": "name: \"Run build lib\"\ndescription: \"Run build of lib\"\ninputs:\n  arch:\n    description: \"Target arch for loading script (host/armv7/aarch64)\"\n    required: false\n    default: \"host\"\n  flavor:\n    description: \"Build flavor\"\n    required: true\nruns:\n  using: \"composite\"\n  steps:\n    - run: ./ci_scripts/${{ inputs.arch }}-build.sh ${{ inputs.flavor }}\n      shell: bash\n"
  },
  {
    "path": ".github/actions/install-python-upstream/action.yml",
    "content": "name: \"Install Python\"\ndescription: \"Installing an upstream python release\"\ninputs:\n  version:\n    description: \"Python version\"\n    required: true\nruns:\n  using: \"composite\"\n  steps:\n    - shell: bash\n      run: |\n        set -xe\n        curl https://www.python.org/ftp/python/${{ inputs.version }}/python-${{ inputs.version }}-macosx10.9.pkg -o \"python.pkg\"\n    - shell: bash\n      run: ls -hal .\n    - shell: bash\n      run: |\n        set -xe\n        sudo installer -verbose -pkg python.pkg -target /\n    - shell: bash\n      run: |\n        set -xe\n        which python3\n        python3 --version\n        python3 -c \"import sysconfig; print(sysconfig.get_config_var('MACOSX_DEPLOYMENT_TARGET'))\"\n    - shell: bash\n      name: Set up venv with upstream Python\n      run: |\n        python3 -m venv /tmp/venv\n        echo \"/tmp/venv/bin\" >> $GITHUB_PATH\n"
  },
  {
    "path": ".github/actions/install-xldd/action.yml",
    "content": "name: \"xldd install\"\ndescription: \"Install xldd\"\ninputs:\n  target:\n    description: \"System target\"\n    required: true\nruns:\n  using: \"composite\"\n  steps:\n    - id: install_xldd\n      run: |\n        source ./ci_scripts/all-vars.sh\n        # -s required to avoid the noisy output like \"Entering / Leaving directories\"\n        toolchain=$(make -s -C ${DS_DSDIR}/native_client/ TARGET=${{ inputs.target }} TFDIR=${DS_TFDIR} print-toolchain)\n        if [ ! -x \"${toolchain}ldd\" ]; then\n          cp \"${DS_DSDIR}/native_client/xldd\" \"${toolchain}ldd\" && chmod +x \"${toolchain}ldd\"\n        fi\n      shell: bash\n"
  },
  {
    "path": ".github/actions/multistrap/action.yml",
    "content": "name: \"multistrap install\"\ndescription: \"Install a system root using multistrap\"\ninputs:\n  arch:\n    description: \"Target arch\"\n    required: true\n  packages:\n    description: \"Extra packages to install\"\n    required: false\n    default: \"\"\nruns:\n  using: \"composite\"\n  steps:\n    - id: install_multistrap\n      run: |\n        sudo apt-get update -y\n        sudo apt-get install -y --no-install-recommends multistrap qemu-user-static\n      shell: bash\n    - id: create_chroot\n      run: |\n        set -xe\n\n        multistrap_conf=\"\"\n        if [ \"${{ inputs.arch }}\" = \"armv7\" ]; then\n          multistrap_conf=multistrap_raspbian_buster.conf\n          wget http://archive.raspbian.org/raspbian/pool/main/r/raspbian-archive-keyring/raspbian-archive-keyring_20120528.2_all.deb && sudo dpkg -i raspbian-archive-keyring_20120528.2_all.deb\n        fi\n        if [ \"${{ inputs.arch }}\" = \"aarch64\" ]; then\n          multistrap_conf=multistrap_armbian64_buster.conf\n        fi\n\n        multistrap -d ${{ env.SYSTEM_RASPBIAN }} -f ${{ github.workspace }}/native_client/${multistrap_conf}\n\n        if [ ! -z \"${{ inputs.packages }}\" ]; then\n          TO_MOUNT=${{ github.workspace }}\n          # Prepare target directory to bind-mount the github tree\n          mkdir -p ${{ env.SYSTEM_RASPBIAN }}/${{ github.workspace }}\n\n          # Bind-mount so that we have the same tree inside the chroot\n          for dev in ${TO_MOUNT};\n          do\n            sudo mount -o bind ${dev} ${{ env.SYSTEM_RASPBIAN }}${dev}\n          done;\n\n          # Copy some host data:\n          #   resolv.conf: for getting DNS working\n          #   passwd, group, shadow: to have user accounts and apt-get install working\n          for ff in resolv.conf passwd group shadow;\n          do\n            sudo cp /etc/${ff} ${{ env.SYSTEM_RASPBIAN }}/etc/\n          done;\n\n          # Perform apt steps.\n          # Preserving the env is required\n          sudo --preserve-env chroot ${{ env.SYSTEM_RASPBIAN }}/ apt-get update -y\n          sudo --preserve-env chroot ${{ env.SYSTEM_RASPBIAN }}/ apt-get install -y --no-install-recommends ${{ inputs.packages }}\n\n          # Cleanup apt info to save space\n          sudo --preserve-env chroot ${{ env.SYSTEM_RASPBIAN }}/ rm -fr /var/cache/apt/* /var/lib/apt/lists/*\n\n          # Unmount what has been mounted\n          for dev in ${TO_MOUNT};\n          do\n            sudo umount ${{ env.SYSTEM_RASPBIAN }}${dev}\n          done;\n        fi\n      shell: bash\n"
  },
  {
    "path": ".github/actions/node-build/action.yml",
    "content": "name: \"NodeJS binding\"\ndescription: \"Binding a nodejs binding\"\ninputs:\n  nodejs_versions:\n    description: \"NodeJS versions supported\"\n    required: true\n  electronjs_versions:\n    description: \"ElectronJS versions supported\"\n    required: true\n  local_cflags:\n    description: \"CFLAGS for NodeJS package\"\n    required: false\n    default: \"\"\n  local_ldflags:\n    description: \"LDFLAGS for NodeJS package\"\n    required: false\n    default: \"\"\n  local_libs:\n    description: \"LIBS for NodeJS package\"\n    required: false\n    default: \"\"\n  target:\n    description: \"TARGET value\"\n    required: false\n    default: \"host\"\n  chroot:\n    description: \"RASPBIAN value\"\n    required: false\n    default: \"\"\nruns:\n  using: \"composite\"\n  steps:\n    - run: |\n        node --version\n        npm --version\n      shell: bash\n    - run: |\n        npm update\n      shell: bash\n    - run: |\n        mkdir -p tmp/headers/nodejs tmp/headers/electronjs\n      shell: bash\n    - run: |\n        for node in ${{ inputs.nodejs_versions }}; do\n          EXTRA_CFLAGS=${{ inputs.local_cflags }} \\\n          EXTRA_LDFLAGS=${{ inputs.local_ldflags }} \\\n          EXTRA_LIBS=${{ inputs.local_libs }} \\\n            make -C native_client/javascript \\\n              TARGET=${{ inputs.target }} \\\n              RASPBIAN=${{ inputs.chroot }} \\\n              NODE_ABI_TARGET=--target=${node} \\\n              NODE_DEVDIR=--devdir=headers/nodejs \\\n            clean node-wrapper\n        done;\n      shell: bash\n    - run: |\n        for electron in ${{ inputs.electronjs_versions }}; do\n          EXTRA_CFLAGS=${{ inputs.local_cflags }} \\\n          EXTRA_LDFLAGS=${{ inputs.local_ldflags }} \\\n          EXTRA_LIBS=${{ inputs.local_libs }} \\\n            make -C native_client/javascript \\\n              TARGET=${{ inputs.target }} \\\n              RASPBIAN=${{ inputs.chroot }} \\\n              NODE_ABI_TARGET=--target=${electron} \\\n              NODE_DIST_URL=--disturl=https://electronjs.org/headers \\\n              NODE_RUNTIME=--runtime=electron \\\n              NODE_DEVDIR=--devdir=headers/electronjs \\\n            clean node-wrapper\n        done;\n      shell: bash\n    - run: |\n        make -C native_client/javascript clean npm-pack\n      shell: bash\n    - run: |\n        tar -czf native_client/javascript/wrapper.tar.gz \\\n          -C native_client/javascript/ lib/\n      shell: bash\n"
  },
  {
    "path": ".github/actions/node-install/action.yml",
    "content": "name: \"nodejs install\"\ndescription: \"Install nodejs in a chroot\"\ninputs:\n  node:\n    description: \"NodeJS version\"\n    required: true\nruns:\n  using: \"composite\"\n  steps:\n    - id: add_apt_source\n      run: |\n        set -ex\n        (echo \"Package: nodejs\" && echo \"Pin: origin deb.nodesource.com\" && echo \"Pin-Priority: 999\") > ${{ env.SYSTEM_RASPBIAN }}/etc/apt/preferences\n        echo \"deb http://deb.nodesource.com/node_${{ inputs.node }}.x buster main\" > ${{ env.SYSTEM_RASPBIAN }}/etc/apt/sources.list.d/nodesource.list\n        wget -qO- https://deb.nodesource.com/gpgkey/nodesource.gpg.key | sudo --preserve-env chroot ${{ env.SYSTEM_RASPBIAN }}/ apt-key add -\n      shell: bash\n    - id: install_nodejs\n      run: |\n        set -ex\n        sudo --preserve-env chroot ${{ env.SYSTEM_RASPBIAN }}/ apt-get update -y\n        sudo --preserve-env chroot ${{ env.SYSTEM_RASPBIAN }}/ apt-get install -y nodejs\n      shell: bash\n"
  },
  {
    "path": ".github/actions/numpy_vers/README.md",
    "content": "GitHub Action to set NumPy versions\n===================================\n\nThis actions aims at computing correct values for NumPy dependencies:\n - `NUMPY_BUILD_VERSION`: range of accepted versions at Python binding build time\n - `NUMPY_DEP_VERSION`: range of accepted versions for execution time\n\nVersions are set considering several factors:\n - API and ABI compatibility ; otherwise we can have the binding wrapper\n   throwing errors like \"Illegal instruction\", or computing wrong values\n   because of changed memory layout\n - Wheels availability: for CI and end users, we want to avoid having to\n   rebuild numpy so we stick to versions where there is an existing upstream\n   `wheel` file\n"
  },
  {
    "path": ".github/actions/numpy_vers/action.yml",
    "content": "name: \"get numpy versions\"\ndescription: \"Get proper NumPy build and runtime versions dependencies range\"\ninputs:\n  pyver:\n    description: \"Python version\"\n    required: true\noutputs:\n  build_version:\n    description: \"NumPy build dependency\"\n    value: ${{ steps.numpy.outputs.build }}\n  dep_version:\n    description: \"NumPy runtime dependency\"\n    value: ${{ steps.numpy.outputs.dep }}\nruns:\n  using: \"composite\"\n  steps:\n    - id: numpy\n      run: |\n        set -ex\n        NUMPY_BUILD_VERSION=\"==1.7.0\"\n        NUMPY_DEP_VERSION=\">=1.7.0\"\n\n        OS=$(uname -s)\n        ARCH=$(uname -m)\n\n        case \"${OS}:${ARCH}\" in\n            Linux:x86_64)\n                case \"${{ inputs.pyver }}\" in\n                    3.7*)\n                        NUMPY_BUILD_VERSION=\"==1.14.5\"\n                        NUMPY_DEP_VERSION=\">=1.14.5\"\n                    ;;\n                    3.8*)\n                        NUMPY_BUILD_VERSION=\"==1.17.3\"\n                        NUMPY_DEP_VERSION=\">=1.17.3\"\n                    ;;\n                    3.9*)\n                        NUMPY_BUILD_VERSION=\"==1.19.4\"\n                        NUMPY_DEP_VERSION=\">=1.19.4\"\n                    ;;\n                esac\n            ;;\n\n            Darwin:*)\n                case \"${{ inputs.pyver }}\" in\n                    3.6*)\n                        NUMPY_BUILD_VERSION=\"==1.9.0\"\n                        NUMPY_DEP_VERSION=\">=1.9.0\"\n                    ;;\n                    3.7*)\n                        NUMPY_BUILD_VERSION=\"==1.14.5\"\n                        NUMPY_DEP_VERSION=\">=1.14.5,<=1.17.0\"\n                    ;;\n                    3.8*)\n                        NUMPY_BUILD_VERSION=\"==1.17.3\"\n                        NUMPY_DEP_VERSION=\">=1.17.3,<=1.17.3\"\n                    ;;\n                    3.9*)\n                        NUMPY_BUILD_VERSION=\"==1.19.4\"\n                        NUMPY_DEP_VERSION=\">=1.19.4\"\n                    ;;\n                esac\n            ;;\n\n            ${CI_MSYS_VERSION}:x86_64)\n                case \"${{ inputs.pyver }}\" in\n                    3.5*)\n                        NUMPY_BUILD_VERSION=\"==1.11.0\"\n                        NUMPY_DEP_VERSION=\">=1.11.0,<1.12.0\"\n                    ;;\n                    3.6*)\n                        NUMPY_BUILD_VERSION=\"==1.12.0\"\n                        NUMPY_DEP_VERSION=\">=1.12.0,<1.14.5\"\n                    ;;\n                    3.7*)\n                        NUMPY_BUILD_VERSION=\"==1.14.5\"\n                        NUMPY_DEP_VERSION=\">=1.14.5,<=1.17.0\"\n                    ;;\n                    3.8*)\n                        NUMPY_BUILD_VERSION=\"==1.17.3\"\n                        NUMPY_DEP_VERSION=\">=1.17.3,<=1.17.3\"\n                    ;;\n                    3.9*)\n                        NUMPY_BUILD_VERSION=\"==1.19.4\"\n                        NUMPY_DEP_VERSION=\">=1.19.4\"\n                    ;;\n                esac\n            ;;\n        esac\n\n        echo \"::set-output name=build::${NUMPY_BUILD_VERSION}\"\n        echo \"::set-output name=dep::${NUMPY_DEP_VERSION}\"\n      shell: bash\n"
  },
  {
    "path": ".github/actions/package/action.yml",
    "content": "name: \"Package lib\"\ndescription: \"Package of lib\"\nruns:\n  using: \"composite\"\n  steps:\n    - run: ./ci_scripts/package.sh\n      shell: bash\n"
  },
  {
    "path": ".github/actions/package-tensorflow/action.yml",
    "content": "name: \"Package TensorFlow\"\ndescription: \"Package TensorFlow Build\"\nruns:\n  using: \"composite\"\n  steps:\n    - run: ./ci_scripts/tf-package.sh\n      shell: bash\n"
  },
  {
    "path": ".github/actions/python-build/action.yml",
    "content": "name: \"Python binding\"\ndescription: \"Binding a python binding\"\ninputs:\n  build_flavor:\n    description: \"Python package name\"\n    required: true\n  numpy_build:\n    description: \"NumPy build dependecy\"\n    required: true\n  numpy_dep:\n    description: \"NumPy runtime dependecy\"\n    required: true\n  local_cflags:\n    description: \"CFLAGS for Python package\"\n    required: false\n    default: \"\"\n  local_ldflags:\n    description: \"LDFLAGS for Python package\"\n    required: false\n    default: \"\"\n  local_libs:\n    description: \"LIBS for Python package\"\n    required: false\n    default: \"\"\n  target:\n    description: \"TARGET value\"\n    required: false\n    default: \"host\"\n  chroot:\n    description: \"RASPBIAN value\"\n    required: false\n    default: \"\"\nruns:\n  using: \"composite\"\n  steps:\n    - run: |\n        python3 --version\n        pip3 --version\n        python3 -m pip install virtualenv\n        python3 -m virtualenv deepspeech-build\n      shell: bash\n    - run: |\n        mkdir -p wheels\n      shell: bash\n    - run: |\n        set -xe\n\n        PROJECT_NAME=\"deepspeech\"\n        if [ \"${{ inputs.build_flavor }}\" = \"tflite\" ]; then\n          PROJECT_NAME=\"deepspeech-tflite\"\n        fi\n\n        OS=$(uname)\n        if [ \"${OS}\" = \"Linux\" ]; then\n          source deepspeech-build/bin/activate\n        fi\n\n        NUMPY_BUILD_VERSION=\"${{ inputs.numpy_build }}\" \\\n        NUMPY_DEP_VERSION=\"${{ inputs.numpy_dep }}\" \\\n        EXTRA_CFLAGS=${{ inputs.local_cflags }} \\\n        EXTRA_LDFLAGS=${{ inputs.local_ldflags }} \\\n        EXTRA_LIBS=${{ inputs.local_libs }} \\\n          make -C native_client/python/ \\\n            TARGET=${{ inputs.target }} \\\n            RASPBIAN=${{ inputs.chroot }} \\\n            SETUP_FLAGS=\"--project_name ${PROJECT_NAME}\" \\\n            bindings-clean bindings\n\n        if [ \"${OS}\" = \"Linux\" ]; then\n          deactivate\n        fi\n      shell: bash\n    - run: |\n        cp native_client/python/dist/*.whl wheels\n      shell: bash\n    - run: |\n        make -C native_client/python/ bindings-clean\n      shell: bash\n"
  },
  {
    "path": ".github/actions/run-tests/action.yml",
    "content": "name: \"Tests execution\"\ndescription: \"Running DeepSpeech tests\"\ninputs:\n  runtime:\n    description: \"Runtime to use for running test\"\n    required: true\n  build-flavor:\n    description: \"Running against TF or TFLite\"\n    required: true\n  model-kind:\n    description: \"Running against CI baked or production model\"\n    required: true\n  bitrate:\n    description: \"Bitrate for testing\"\n    required: true\n  chroot:\n    description: \"Run using a chroot\"\n    required: false\nruns:\n  using: \"composite\"\n  steps:\n    - run: |\n        set -xe\n\n        build=\"\"\n        if [ \"${{ inputs.build-flavor }}\" = \"tflite\" ]; then\n          build=\"_tflite\"\n        fi\n\n        model_kind=\"\"\n        if [ \"${{ inputs.model-kind }}\" = \"prod\" ]; then\n          model_kind=\"-prod\"\n        fi\n\n        prefix=\".\"\n        if [ ! -z \"${{ inputs.chroot }}\" ]; then\n          prefix=\"${{ inputs.chroot }}\"\n        fi\n\n        ${prefix}/ci_scripts/${{ inputs.runtime }}${build}-tests${model_kind}.sh ${{ inputs.bitrate }}\n      shell: bash\n"
  },
  {
    "path": ".github/actions/select-xcode/action.yml",
    "content": "name: \"Select XCode version\"\ndescription: \"Select XCode version\"\ninputs:\n  version:\n    description: \"XCode version\"\n    required: true\nruns:\n  using: \"composite\"\n  steps:\n    - run: sudo xcode-select --switch /Applications/Xcode_${{ inputs.version }}.app\n      shell: bash\n"
  },
  {
    "path": ".github/actions/setup-tensorflow/action.yml",
    "content": "name: \"Setup TensorFlow\"\ndescription: \"Setup TensorFlow Build\"\nruns:\n  using: \"composite\"\n  steps:\n    - run: ./ci_scripts/tf-setup.sh\n      shell: bash\n"
  },
  {
    "path": ".github/actions/win-install-sox/action.yml",
    "content": "name: \"Install SoX and add to PATH\"\ndescription: \"Install SoX and add to PATH\"\nruns:\n  using: \"composite\"\n  steps:\n    - run: |\n        set -ex\n        wget https://sourceforge.net/projects/sox/files/sox/14.4.2/sox-14.4.2-win32.zip/download -O sox-14.4.2-win32.zip\n        \"C:/Program Files/7-Zip/7z.exe\" x -o`pwd`/bin/ -tzip -aoa sox-14.4.2-win32.zip\n        rm sox-*zip\n        echo \"`pwd`/bin/sox-14.4.2/\" >> $GITHUB_PATH\n      shell: bash\n"
  },
  {
    "path": ".github/lock.yml",
    "content": "# Configuration for lock-threads - https://github.com/dessant/lock-threads\n\n# Number of days of inactivity before a closed issue or pull request is locked\ndaysUntilLock: 30\n\n# Skip issues and pull requests created before a given timestamp. Timestamp must\n# follow ISO 8601 (`YYYY-MM-DD`). Set to `false` to disable\nskipCreatedBefore: false\n\n# Issues and pull requests with these labels will not be locked. Set to `[]` to disable\nexemptLabels: []\n\n# Label to add before locking, such as `outdated`. Set to `false` to disable\nlockLabel: false\n\n# Comment to post before locking. Set to `false` to disable\nlockComment: >\n  This thread has been automatically locked since there has not been\n  any recent activity after it was closed. Please open a new issue for\n  related bugs.\n\n# Assign `resolved` as the reason for locking. Set to `false` to disable\nsetLockReason: false\n\n# Limit to only `issues` or `pulls`\n# only: issues\n\n# Optionally, specify configuration settings just for `issues` or `pulls`\n# issues:\n#   exemptLabels:\n#     - help-wanted\n#   lockLabel: outdated\n\n# pulls:\n#   daysUntilLock: 30\n\n# Repository to extend settings from\n# _extends: repo"
  },
  {
    "path": ".github/workflows/.git-keep-empty-folder",
    "content": ""
  },
  {
    "path": ".github/workflows/build-and-test.yml",
    "content": "name: \"Builds and tests\"\non:\n  pull_request:\n  push:\n    branches:\n      - master\nenv:\n  # Shared variables\n  CI_TASK_DIR: ${{ github.workspace }}\n  CI_ARTIFACTS_DIR: ${{ github.workspace }}/artifacts\n\n  # macOS specific\n  MACOSX_DEPLOYMENT_TARGET: \"10.10\"\n  CI_NODE_MODULES_NTH: 1\n\n  # Windows specific\n  CI_MSYS_VERSION: MSYS_NT-10.0-17763\n  MSYS2_SHELL_PATH: D:\\a\\_temp\\msys\\msys64\\usr\\bin\ndefaults:\n  run:\n    shell: bash\njobs:\n  # Linux jobs\n  swig_Windows_crosscompiled:\n    name: \"Lin|Build SWIG for Windows\"\n    runs-on: ubuntu-20.04\n    env:\n      swig_hash: \"90cdbee6a69d13b39d734083b9f91069533b0d7b\"\n    steps:\n      - uses: actions/checkout@v2\n        with:\n          repository: \"swig/swig\"\n          ref: ${{ env.swig_hash }}\n      - run: |\n          mkdir -p build-static/\n      - uses: actions/cache@v2\n        id: swig-build-cache\n        with:\n          path: build-static/\n          key: swig-win-3-${{ env.swig_hash }}\n      - run: |\n          sudo apt-get install -y --no-install-recommends autoconf automake bison build-essential mingw-w64\n        if: steps.swig-build-cache.outputs.cache-hit != 'true'\n      - run: |\n          curl -sSL https://ftp.pcre.org/pub/pcre/pcre-8.43.tar.gz > pcre-8.43.tar.gz\n        if: steps.swig-build-cache.outputs.cache-hit != 'true'\n      - run: |\n          ./Tools/pcre-build.sh --host=x86_64-w64-mingw32\n        if: steps.swig-build-cache.outputs.cache-hit != 'true'\n      - run: |\n          sh autogen.sh\n          CFLAGS=\"-static-libgcc -static-libstdc++\" \\\n          CXXFLAGS=\"-static-libgcc -static-libstdc++\" \\\n          ./configure \\\n            --host=x86_64-w64-mingw32 \\\n            --prefix=`pwd`/build-static/ \\\n            --program-prefix=ds-\n        if: steps.swig-build-cache.outputs.cache-hit != 'true'\n      - run: |\n          make -j\n        if: steps.swig-build-cache.outputs.cache-hit != 'true'\n      - run: |\n          make install\n        if: steps.swig-build-cache.outputs.cache-hit != 'true'\n      - uses: actions/upload-artifact@v2\n        with:\n          name: ${{ github.job }}\n          path: ${{ github.workspace }}/build-static/\n  swig_Linux:\n    name: \"Lin|Build SWIG\"\n    runs-on: ubuntu-20.04\n    env:\n      swig_hash: \"90cdbee6a69d13b39d734083b9f91069533b0d7b\"\n    steps:\n      - uses: actions/checkout@v2\n        with:\n          repository: \"swig/swig\"\n          ref: ${{ env.swig_hash }}\n      - run: |\n          mkdir -p build-static/\n      - uses: actions/cache@v2\n        id: swig-build-cache\n        with:\n          path: build-static/\n          key: swig-2-${{ runner.os }}-${{ env.swig_hash }}\n      - run: |\n          sudo apt-get install -y --no-install-recommends autoconf automake bison build-essential\n        if: steps.swig-build-cache.outputs.cache-hit != 'true'\n      - run: |\n          curl -sSL https://ftp.pcre.org/pub/pcre/pcre-8.43.tar.gz > pcre-8.43.tar.gz\n        if: steps.swig-build-cache.outputs.cache-hit != 'true'\n      - run: |\n          ./Tools/pcre-build.sh\n        if: steps.swig-build-cache.outputs.cache-hit != 'true'\n      - run: |\n          sh autogen.sh\n          ./configure \\\n            --prefix=${{ github.workspace }}/build-static/ \\\n            --program-prefix=ds-\n        if: steps.swig-build-cache.outputs.cache-hit != 'true'\n      - run: |\n          make -j\n        if: steps.swig-build-cache.outputs.cache-hit != 'true'\n      - run: |\n          make install\n        if: steps.swig-build-cache.outputs.cache-hit != 'true'\n      - uses: actions/upload-artifact@v2\n        with:\n          name: ${{ github.job }}\n          path: ${{ github.workspace }}/build-static/\n  build-ctc-decoder-Linux:\n    name: \"Lin|Build CTC decoder Python package for testing\"\n    needs: [ swig_Linux ]\n    runs-on: ubuntu-20.04\n    if: ${{ github.event_name == 'pull_request' }}\n    steps:\n      - uses: actions/checkout@v2\n        with:\n          fetch-depth: 0\n      - uses: actions/setup-python@v2\n        with:\n          python-version: 3.6\n      - run: |\n          python --version\n          pip --version\n      - uses: actions/download-artifact@v2\n        with:\n          name: \"swig_Linux\"\n          path: ${{ github.workspace }}/native_client/ds-swig/\n      - name: Link ds-swig into swig\n        run: |\n          ls -hal ${{ github.workspace }}/native_client/ds-swig/bin\n          ln -s ds-swig ${{ github.workspace }}/native_client/ds-swig/bin/swig\n          chmod +x ${{ github.workspace }}/native_client/ds-swig/bin/ds-swig ${{ github.workspace }}/native_client/ds-swig/bin/swig\n      - id: get_numpy\n        uses: ./.github/actions/numpy_vers\n        with:\n          pyver: 3.6\n      - name: Make decoder package\n        run: |\n          NUMPY_BUILD_VERSION=${{ steps.get_numpy.outputs.build_version }} \\\n          NUMPY_DEP_VERSION=${{ steps.get_numpy.outputs.dep_version }} \\\n          make -C native_client/ctcdecode/ \\\n            NUM_PROCESSES=$(nproc) \\\n            bindings\n      - uses: actions/upload-artifact@v2\n        with:\n          name: \"ds_ctcdecoder-Linux-test.whl\"\n          path: ${{ github.workspace }}/native_client/ctcdecode/dist/*.whl\n      - run: |\n          make -C native_client/ctcdecode clean-keep-third-party\n  train-test-model-Linux:\n    name: \"Lin|Train a test model\"\n    needs: [ \"build-ctc-decoder-Linux\" ]\n    runs-on: ubuntu-20.04\n    if: ${{ github.event_name == 'pull_request' }}\n    strategy:\n      matrix:\n        bitrate: [\"8k\", \"16k\"]\n    steps:\n      - uses: actions/checkout@v2\n        with:\n          fetch-depth: 1\n      - uses: actions/setup-python@v2\n        with:\n          python-version: 3.6\n      - uses: actions/download-artifact@v2\n        with:\n          name: \"ds_ctcdecoder-Linux-test.whl\"\n      - run: |\n          python --version\n          pip --version\n      - run: |\n          pip install --upgrade pip==19.3.1 setuptools==45.0.0 wheel==0.33.6\n      - run: |\n          pip install ds_ctcdecoder-*-cp36-cp36m-*_x86_64.whl\n          DS_NODECODER=y pip install --upgrade .\n      - run: |\n          bits=\"\"\n          if [ \"${{ matrix.bitrate }}\" = \"8k\" ]; then\n            bits=8000\n          fi\n          if [ \"${{ matrix.bitrate }}\" = \"16k\"  ]; then\n            bits=16000\n          fi\n\n          # Easier to rename to that we can exercize the LDC93S1 importer code to\n          # generate the CSV file.\n          echo \"Moving ${bits} to LDC93S1.wav\"\n          mv data/smoke_test/LDC93S1_pcms16le_1_${bits}.wav data/smoke_test/LDC93S1.wav\n\n          ./bin/run-ci-ldc93s1_new.sh 249 ${bits}\n          ./bin/run-ci-ldc93s1_tflite.sh ${bits}\n      - run: |\n          curl -vsSL https://github.com/mozilla/DeepSpeech/releases/download/v0.9.3/linux.amd64.convert_graphdef_memmapped_format.xz | xz -d > /tmp/convert_graphdef_memmapped_format\n          chmod +x /tmp/convert_graphdef_memmapped_format\n          /tmp/convert_graphdef_memmapped_format --in_graph=/tmp/train/output_graph.pb --out_graph=/tmp/train/output_graph.pbmm\n      - run: |\n          tar -cf - \\\n            -C /tmp/ckpt/ . \\\n            | xz -9 -T0 > /tmp/checkpoint.tar.xz\n      - run: |\n          mkdir -p ${{ github.workspace }}/tmp/\n          cp /tmp/train*/output_graph.* /tmp/checkpoint.tar.xz ${{ github.workspace }}/tmp/\n      - run: |\n          ls -hal /tmp/ ${{ github.workspace }}/tmp/\n      - uses: actions/upload-artifact@v2\n        with:\n          name: \"test-model.tf-${{ matrix.bitrate }}.zip\"\n          path: ${{ github.workspace }}/tmp/output_graph.pb*\n      - uses: actions/upload-artifact@v2\n        with:\n          name: \"test-model.tflite-${{ matrix.bitrate }}.zip\"\n          path: ${{ github.workspace }}/tmp/output_graph.tflite\n      - uses: actions/upload-artifact@v2\n        with:\n          name: \"test-checkpoint.${{ matrix.bitrate }}.zip\"\n          path: ${{ github.workspace }}/tmp/checkpoint.tar.xz\n  tensorflow_opt-Linux:\n    name: \"Lin|Check TensorFlow cache\"\n    runs-on: ubuntu-20.04\n    outputs:\n      status: ${{ steps.check_artifact_exists.outputs.status }}\n      cache_key: ${{ steps.get_cache_key.outputs.key }}\n    steps:\n      - uses: actions/checkout@v2\n        with:\n          fetch-depth: 1\n      - id: get_cache_key\n        uses: ./.github/actions/get_cache_key\n        with:\n          extras: \"2\"\n      - id: check_artifact_exists\n        uses: ./.github/actions/check_artifact_exists\n        with:\n          name: ${{ steps.get_cache_key.outputs.key }}\n  build-tensorflow-Linux:\n    name: \"Lin|Build TensorFlow (opt)\"\n    needs: tensorflow_opt-Linux\n    runs-on: ubuntu-20.04\n    steps:\n      - run: true\n        if: needs.tensorflow_opt-Linux.outputs.status == 'found'\n      - uses: actions/checkout@v2\n        with:\n          fetch-depth: 0\n          submodules: 'recursive'\n        if: needs.tensorflow_opt-Linux.outputs.status == 'missing'\n      - run: |\n          sudo apt-get install -y --no-install-recommends pixz\n        if: needs.tensorflow_opt-Linux.outputs.status == 'missing'\n      - uses: ./.github/actions/setup-tensorflow\n        if: needs.tensorflow_opt-Linux.outputs.status == 'missing'\n      - uses: ./.github/actions/build-tensorflow\n        with:\n          flavor: \"--linux-cpu\"\n        if: needs.tensorflow_opt-Linux.outputs.status == 'missing'\n      - uses: ./.github/actions/package-tensorflow\n        if: needs.tensorflow_opt-Linux.outputs.status == 'missing'\n      - uses: actions/upload-artifact@v2\n        with:\n          name: ${{ needs.tensorflow_opt-Linux.outputs.cache_key }}\n          path: ${{ github.workspace }}/artifacts/home.tar.xz\n        if: needs.tensorflow_opt-Linux.outputs.status == 'missing'\n  build-lib_Linux:\n    name: \"Lin|Build libdeepspeech+client\"\n    runs-on: ubuntu-20.04\n    needs: [ build-tensorflow-Linux, tensorflow_opt-Linux ]\n    strategy:\n      matrix:\n        build-flavor: [\"tf\", \"tflite\"]\n    steps:\n      - uses: actions/checkout@v2\n        with:\n          fetch-depth: 0\n      - uses: actions/download-artifact@v2\n        with:\n          name: ${{ needs.tensorflow_opt-Linux.outputs.cache_key }}\n          path: ${{ github.workspace }}/\n        if: needs.tensorflow_opt-Linux.outputs.status == 'missing'\n      - uses: ./.github/actions/check_artifact_exists\n        with:\n          name: ${{ needs.tensorflow_opt-Linux.outputs.cache_key }}\n          path: ${{ github.workspace }}/\n          download: true\n        if: needs.tensorflow_opt-Linux.outputs.status == 'found'\n      - run: |\n          tar --skip-old-files -xf ${{ github.workspace }}/home.tar.xz\n          rm ${{ github.workspace }}/home.tar.xz\n      - run: |\n          sudo apt-get install -y --no-install-recommends make build-essential gfortran git libblas-dev liblapack-dev libsox-dev libmagic-dev libgsm1-dev libltdl-dev libpng-dev python python-dev zlib1g-dev\n      - run: |\n          git status\n      - uses: ./.github/actions/host-build\n        with:\n          flavor: ${{ matrix.build-flavor }}\n      - uses: ./.github/actions/package\n      - uses: actions/upload-artifact@v2\n        with:\n          name: \"native_client.${{ matrix.build-flavor }}.Linux.tar.xz\"\n          path: ${{ github.workspace }}/artifacts/native_client.tar.xz\n      - uses: actions/upload-artifact@v2\n        with:\n          name: \"libdeepspeech.${{ matrix.build-flavor }}.zip\"\n          path: ${{ github.workspace }}/artifacts/libdeepspeech.zip\n  build-python-Linux:\n    name: \"Lin|Build Python bindings\"\n    runs-on: ubuntu-20.04\n    needs: [ build-lib_Linux, swig_Linux ]\n    strategy:\n      matrix:\n        build-flavor: [\"tf\", \"tflite\"]\n        python-version: [3.6, 3.7, 3.8, 3.9]\n    steps:\n      - uses: actions/checkout@v2\n        with:\n          fetch-depth: 1\n      - uses: actions/download-artifact@v2\n        with:\n          name: \"native_client.${{ matrix.build-flavor }}.Linux.tar.xz\"\n          path: ${{ github.workspace }}/tensorflow/bazel-bin/native_client/\n      - run: |\n          cd ${{ github.workspace }}/tensorflow/bazel-bin/native_client/\n          tar xf native_client.tar.xz\n          ls -hal\n          cd ${{ github.workspace }}/\n      - uses: actions/download-artifact@v2\n        with:\n          name: \"swig_Linux\"\n          path: ${{ github.workspace }}/native_client/ds-swig/\n      - name: Link ds-swig into swig\n        run: |\n          ls -hal ${{ github.workspace }}/native_client/ds-swig/bin\n          ln -s ds-swig ${{ github.workspace }}/native_client/ds-swig/bin/swig\n          chmod +x ${{ github.workspace }}/native_client/ds-swig/bin/ds-swig ${{ github.workspace }}/native_client/ds-swig/bin/swig\n      - uses: actions/setup-python@v2\n        with:\n          python-version: ${{ matrix.python-version }}\n      - id: get_numpy\n        uses: ./.github/actions/numpy_vers\n        with:\n          pyver: ${{ matrix.python-version }}\n      - uses: ./.github/actions/python-build\n        with:\n          build_flavor: ${{ matrix.build-flavor }}\n          numpy_build: \"${{ steps.get_numpy.outputs.build_version }}\"\n          numpy_dep: \"${{ steps.get_numpy.outputs.dep_version }}\"\n      - uses: actions/upload-artifact@v2\n        with:\n          name: \"deepspeech-${{ matrix.build-flavor }}-${{ matrix.python-version }}-Linux.whl\"\n          path: ${{ github.workspace }}/wheels/*.whl\n  build-nodejs-Linux:\n    name: \"Lin|Build NodeJS and ElectronJS\"\n    runs-on: ubuntu-20.04\n    needs: [ build-lib_Linux, swig_Linux ]\n    strategy:\n      matrix:\n        build-flavor: [\"tf\", \"tflite\"]\n    steps:\n      - uses: actions/checkout@v2\n        with:\n          fetch-depth: 1\n      - uses: actions/download-artifact@v2\n        with:\n          name: \"native_client.${{ matrix.build-flavor }}.Linux.tar.xz\"\n          path: ${{ github.workspace }}/tensorflow/bazel-bin/native_client/\n      - run: |\n          cd ${{ github.workspace }}/tensorflow/bazel-bin/native_client/\n          tar xf native_client.tar.xz\n          ls -hal\n          cd ${{ github.workspace }}/\n      - uses: actions/download-artifact@v2\n        with:\n          name: \"swig_Linux\"\n          path: ${{ github.workspace }}/native_client/ds-swig/\n      - name: Link ds-swig into swig\n        run: |\n          ls -hal ${{ github.workspace }}/native_client/ds-swig/bin\n          ln -s ds-swig ${{ github.workspace }}/native_client/ds-swig/bin/swig\n          chmod +x ${{ github.workspace }}/native_client/ds-swig/bin/ds-swig ${{ github.workspace }}/native_client/ds-swig/bin/swig\n      - uses: actions/setup-node@v2\n        with:\n          node-version: 12\n      - uses: actions/cache@v2\n        id: node-headers-cache\n        with:\n          path: native_client/javascript/headers/nodejs/\n          key: node-headers-10.0.0_16.0.0\n      - uses: actions/cache@v2\n        id: electron-headers-cache\n        with:\n          path: native_client/javascript/headers/electronjs/\n          key: electron-headers-5.0.13_12.0.0\n      - uses: ./.github/actions/node-build\n        with:\n          nodejs_versions: \"10.0.0 11.0.0 12.7.0 13.0.0 14.0.0 15.0.0 16.0.0\"\n          electronjs_versions: \"5.0.13 6.0.12 6.1.7 7.0.1 7.1.8 8.0.1 9.0.1 9.1.0 9.2.0 10.0.0 10.1.0 11.0.0 12.0.0\"\n      - uses: actions/upload-artifact@v2\n        with:\n          name: \"nodewrapper-${{ matrix.build-flavor }}-Linux_amd64.tar.gz\"\n          path: ${{ github.workspace }}/native_client/javascript/wrapper.tar.gz\n      - uses: actions/upload-artifact@v2\n        with:\n          name: \"deepspeech_intermediate-${{ matrix.build-flavor }}-Linux.tgz\"\n          path: ${{ github.workspace }}/native_client/javascript/deepspeech-*.tgz\n  test-cpp-Linux:\n    name: \"Lin|Test C++ binary\"\n    runs-on: ubuntu-20.04\n    needs: [ build-lib_Linux, train-test-model-Linux ]\n    if: ${{ github.event_name == 'pull_request' }}\n    strategy:\n      matrix:\n        build-flavor: [\"tf\", \"tflite\"]\n        models: [\"test\", \"prod\"]\n        bitrate: [\"8k\", \"16k\"]\n    env:\n      CI_TMP_DIR: ${{ github.workspace }}/tmp/\n      DEEPSPEECH_PROD_MODEL: https://github.com/reuben/DeepSpeech/releases/download/v0.7.0-alpha.3/output_graph.pb\n      DEEPSPEECH_PROD_MODEL_MMAP: https://github.com/reuben/DeepSpeech/releases/download/v0.7.0-alpha.3/output_graph.pbmm\n      DEEPSPEECH_TEST_MODEL: ${{ github.workspace }}/tmp/output_graph.pb\n      EXPECTED_TENSORFLOW_VERSION: \"TensorFlow: v2.3.0-6-g23ad988\"\n    steps:\n      - uses: actions/checkout@v2\n        with:\n          fetch-depth: 1\n      - uses: actions/download-artifact@v2\n        with:\n          name: \"native_client.${{ matrix.build-flavor }}.Linux.tar.xz\"\n          path: ${{ env.CI_TMP_DIR }}\n      - run: |\n          cd ${{ env.CI_TMP_DIR }}\n          mkdir ds && cd ds && tar xf ../native_client.tar.xz\n      - uses: actions/download-artifact@v2\n        with:\n          name: \"test-model.${{ matrix.build-flavor }}-${{ matrix.bitrate }}.zip\"\n          path: ${{ env.CI_TMP_DIR }}\n        if: matrix.models == 'test'\n      - run: |\n          ls -hal ${{ env.CI_TMP_DIR }}/\n        if: matrix.models == 'test'\n      - uses: ./.github/actions/run-tests\n        with:\n          runtime: \"cpp\"\n          build-flavor: ${{ matrix.build-flavor }}\n          bitrate: ${{ matrix.bitrate }}\n          model-kind: ${{ matrix.models }}\n  test-py-Linux:\n    name: \"Lin|Test Python bindings\"\n    runs-on: ubuntu-20.04\n    needs: [ build-python-Linux, train-test-model-Linux ]\n    if: ${{ github.event_name == 'pull_request' }}\n    strategy:\n      matrix:\n        python-version: [3.6, 3.7, 3.8, 3.9]\n        build-flavor: [\"tf\", \"tflite\"]\n        models: [\"test\", \"prod\"]\n        bitrate: [\"8k\", \"16k\"]\n    env:\n      CI_TMP_DIR: ${{ github.workspace }}/tmp/\n      DEEPSPEECH_PROD_MODEL: https://github.com/reuben/DeepSpeech/releases/download/v0.7.0-alpha.3/output_graph.pb\n      DEEPSPEECH_PROD_MODEL_MMAP: https://github.com/reuben/DeepSpeech/releases/download/v0.7.0-alpha.3/output_graph.pbmm\n      DEEPSPEECH_TEST_MODEL: ${{ github.workspace }}/tmp/output_graph.pb\n      EXPECTED_TENSORFLOW_VERSION: \"TensorFlow: v2.3.0-6-g23ad988\"\n    steps:\n      - uses: actions/checkout@v2\n        with:\n          fetch-depth: 1\n      - uses: actions/setup-python@v2\n        with:\n          python-version: ${{ matrix.python-version }}\n      - run: |\n          sudo apt-get install -y --no-install-recommends sox\n      - uses: actions/download-artifact@v2\n        with:\n          name: \"deepspeech-${{ matrix.build-flavor }}-${{ matrix.python-version }}-Linux.whl\"\n          path: ${{ env.CI_TMP_DIR }}\n      - uses: actions/download-artifact@v2\n        with:\n          name: \"test-model.${{ matrix.build-flavor }}-${{ matrix.bitrate }}.zip\"\n          path: ${{ env.CI_TMP_DIR }}\n        if: matrix.models == 'test'\n      - run: |\n          ls -hal ${{ env.CI_TMP_DIR }}/\n        if: matrix.models == 'test'\n      - run: |\n          ls -hal ${{ env.CI_TMP_DIR }}/\n          pip3 install --only-binary :all: --upgrade ${{ env.CI_TMP_DIR }}/deepspeech*.whl\n      - uses: ./.github/actions/run-tests\n        with:\n          runtime: \"python\"\n          build-flavor: ${{ matrix.build-flavor }}\n          bitrate: ${{ matrix.bitrate }}\n          model-kind: ${{ matrix.models }}\n  test-nodejs-Linux:\n    name: \"Lin|Test NodeJS bindings\"\n    runs-on: ubuntu-20.04\n    needs: [ build-nodejs-Linux, train-test-model-Linux ]\n    if: ${{ github.event_name == 'pull_request' }}\n    strategy:\n      matrix:\n        # https://nodejs.org/en/about/releases/\n        nodejs-version: [10, 12, 14, 16]\n        build-flavor: [\"tf\", \"tflite\"]\n        models: [\"test\"]\n        bitrate: [\"16k\"]\n    env:\n      CI_TMP_DIR: ${{ github.workspace }}/tmp/\n      DEEPSPEECH_PROD_MODEL: https://github.com/reuben/DeepSpeech/releases/download/v0.7.0-alpha.3/output_graph.pb\n      DEEPSPEECH_PROD_MODEL_MMAP: https://github.com/reuben/DeepSpeech/releases/download/v0.7.0-alpha.3/output_graph.pbmm\n      DEEPSPEECH_TEST_MODEL: ${{ github.workspace }}/tmp/output_graph.pb\n      EXPECTED_TENSORFLOW_VERSION: \"TensorFlow: v2.3.0-6-g23ad988\"\n    steps:\n      - uses: actions/checkout@v2\n        with:\n          fetch-depth: 1\n      - uses: actions/setup-node@v2\n        with:\n          node-version: ${{ matrix.nodejs-version }}\n      - run: |\n          sudo apt-get install -y --no-install-recommends sox\n      - uses: actions/download-artifact@v2\n        with:\n          name: \"deepspeech_intermediate-${{ matrix.build-flavor }}-Linux.tgz\"\n          path: ${{ env.CI_TMP_DIR }}\n      - uses: actions/download-artifact@v2\n        with:\n          name: \"test-model.${{ matrix.build-flavor }}-${{ matrix.bitrate }}.zip\"\n          path: ${{ env.CI_TMP_DIR }}\n        if: matrix.models == 'test'\n      - run: |\n          ls -hal ${{ env.CI_TMP_DIR }}/\n        if: matrix.models == 'test'\n      - uses: actions/cache@v2\n        id: node-modules-cache\n        with:\n          path: ~/.npm/\n          key: node-modules-${{ matrix.build-flavor }}-${{ runner.os }}-${{ env.CI_NODE_MODULES_NTH }}\n      - name: Install deepspeech package\n        run: |\n          ls -hal ${{ env.CI_TMP_DIR }}/\n          npm install --verbose ${{ env.CI_TMP_DIR }}/deepspeech*.tgz\n      - run: |\n          ls -hal node_modules/deepspeech* node_modules/.bin/\n      - uses: ./.github/actions/run-tests\n        with:\n          runtime: \"node\"\n          build-flavor: ${{ matrix.build-flavor }}\n          bitrate: ${{ matrix.bitrate }}\n          model-kind: ${{ matrix.models }}\n  test-electronjs-Linux:\n    name: \"Lin|Test ElectronJS bindings\"\n    runs-on: ubuntu-20.04\n    needs: [ build-nodejs-Linux, train-test-model-Linux ]\n    if: ${{ github.event_name == 'pull_request' }}\n    strategy:\n      matrix:\n        electronjs-version: [5.0.13, 6.1.7, 7.1.8, 8.0.1, 9.2.0, 10.1.0, 11.0.0, 12.0.0]\n        build-flavor: [\"tf\", \"tflite\"]\n        models: [\"test\"]\n        bitrate: [\"16k\"]\n    env:\n      CI_TMP_DIR: ${{ github.workspace }}/tmp/\n      DEEPSPEECH_PROD_MODEL: https://github.com/reuben/DeepSpeech/releases/download/v0.7.0-alpha.3/output_graph.pb\n      DEEPSPEECH_PROD_MODEL_MMAP: https://github.com/reuben/DeepSpeech/releases/download/v0.7.0-alpha.3/output_graph.pbmm\n      DEEPSPEECH_TEST_MODEL: ${{ github.workspace }}/tmp/output_graph.pb\n      EXPECTED_TENSORFLOW_VERSION: \"TensorFlow: v2.3.0-6-g23ad988\"\n    steps:\n      - uses: actions/checkout@v2\n        with:\n          fetch-depth: 1\n      - uses: actions/setup-node@v2\n        with:\n          node-version: 12\n      - run: |\n          sudo apt-get install -y --no-install-recommends sox\n      - uses: actions/download-artifact@v2\n        with:\n          name: \"deepspeech_intermediate-${{ matrix.build-flavor }}-Linux.tgz\"\n          path: ${{ env.CI_TMP_DIR }}\n      - uses: actions/download-artifact@v2\n        with:\n          name: \"test-model.${{ matrix.build-flavor }}-${{ matrix.bitrate }}.zip\"\n          path: ${{ env.CI_TMP_DIR }}\n        if: matrix.models == 'test'\n      - run: |\n          ls -hal ${{ env.CI_TMP_DIR }}/\n        if: matrix.models == 'test'\n      - uses: actions/cache@v2\n        id: electron-modules-cache\n        with:\n          path: ~/.npm/\n          key: electron-modules-${{ matrix.build-flavor }}-${{ runner.os }}-${{ env.CI_NODE_MODULES_NTH }}\n      - name: Install deepspeech package\n        run: |\n          ls -hal ${{ env.CI_TMP_DIR }}/\n          npm install ${{ env.CI_TMP_DIR }}/deepspeech*.tgz\n      - run: |\n          npm install electron@${{ matrix.electronjs-version }}\n      - uses: ./.github/actions/run-tests\n        with:\n          runtime: \"electronjs\"\n          build-flavor: ${{ matrix.build-flavor }}\n          bitrate: ${{ matrix.bitrate }}\n          model-kind: ${{ matrix.models }}\n        timeout-minutes: 5\n  # macOS jobs\n  swig_macOS:\n    name: \"Mac|Build SWIG\"\n    runs-on: macos-10.15\n    env:\n      swig_hash: \"90cdbee6a69d13b39d734083b9f91069533b0d7b\"\n    steps:\n      - uses: actions/checkout@v2\n        with:\n          repository: \"swig/swig\"\n          ref: ${{ env.swig_hash }}\n      - run: |\n          mkdir -p build-static/\n      - uses: actions/cache@v2\n        id: swig-build-cache\n        with:\n          path: build-static/\n          key: swig-${{ runner.os }}-${{ env.swig_hash }}\n      - run: |\n          brew install automake\n        if: steps.swig-build-cache.outputs.cache-hit != 'true'\n      - run: |\n          curl -sSL https://ftp.pcre.org/pub/pcre/pcre-8.43.tar.gz > pcre-8.43.tar.gz\n        if: steps.swig-build-cache.outputs.cache-hit != 'true'\n      - run: |\n          ./Tools/pcre-build.sh\n        if: steps.swig-build-cache.outputs.cache-hit != 'true'\n      - run: |\n          sh autogen.sh\n          ./configure \\\n            --prefix=${{ github.workspace }}/build-static/ \\\n            --program-prefix=ds-\n        if: steps.swig-build-cache.outputs.cache-hit != 'true'\n      - run: |\n          make -j\n        if: steps.swig-build-cache.outputs.cache-hit != 'true'\n      - run: |\n          make install\n        if: steps.swig-build-cache.outputs.cache-hit != 'true'\n      - uses: actions/upload-artifact@v2\n        with:\n          name: ${{ github.job }}\n          path: ${{ github.workspace }}/build-static/\n  build-ctc-decoder-macos:\n    name: \"Mac|Build CTC decoder Python package for testing\"\n    needs: [ swig_macOS ]\n    runs-on: macos-10.15\n    if: ${{ github.event_name == 'pull_request' }}\n    steps:\n      - uses: actions/checkout@v2\n        with:\n          fetch-depth: 0\n      - uses: ./.github/actions/install-python-upstream\n        with:\n          version: 3.6.8\n      - run: |\n          python --version\n          pip --version\n      - uses: actions/download-artifact@v2\n        with:\n          name: \"swig_macOS\"\n          path: ${{ github.workspace }}/native_client/ds-swig/\n      - name: Link ds-swig into swig\n        run: |\n          ls -hal ${{ github.workspace }}/native_client/ds-swig/bin\n          ln -s ds-swig ${{ github.workspace }}/native_client/ds-swig/bin/swig\n          chmod +x ${{ github.workspace }}/native_client/ds-swig/bin/ds-swig ${{ github.workspace }}/native_client/ds-swig/bin/swig\n      - id: get_numpy\n        uses: ./.github/actions/numpy_vers\n        with:\n          pyver: 3.6.8\n      - name: Make decoder package\n        run: |\n          NUMPY_BUILD_VERSION=${{ steps.get_numpy.outputs.build_version }} \\\n          NUMPY_DEP_VERSION=${{ steps.get_numpy.outputs.dep_version }} \\\n          make -C native_client/ctcdecode/ \\\n            NUM_PROCESSES=$(sysctl hw.ncpu |cut -d' ' -f2) \\\n            bindings\n      - uses: actions/upload-artifact@v2\n        with:\n          name: \"ds_ctcdecoder-macOS-test.whl\"\n          path: ${{ github.workspace }}/native_client/ctcdecode/dist/*.whl\n      - run: |\n          make -C native_client/ctcdecode clean-keep-third-party\n  train-test-model-macOS:\n    name: \"Mac|Train a test model\"\n    needs: [ \"build-ctc-decoder-macos\" ]\n    runs-on: macos-10.15\n    if: ${{ github.event_name == 'pull_request' }}\n    strategy:\n      matrix:\n        bitrate: [\"8k\", \"16k\"]\n    steps:\n      - uses: actions/checkout@v2\n        with:\n          fetch-depth: 1\n      - uses: actions/setup-python@v2\n        with:\n          python-version: 3.6\n      - uses: actions/download-artifact@v2\n        with:\n          name: \"ds_ctcdecoder-macOS-test.whl\"\n      - run: |\n          python --version\n          pip --version\n      - run: |\n          pip install --upgrade pip==19.3.1 setuptools==45.0.0 wheel==0.33.6\n      - run: |\n          pip install ds_ctcdecoder-*-cp36-cp36m-*_x86_64.whl\n          DS_NODECODER=y pip install --upgrade .\n      - run: |\n          bits=\"\"\n          if [ \"${{ matrix.bitrate }}\" = \"8k\" ]; then\n            bits=8000\n          fi\n          if [ \"${{ matrix.bitrate }}\" = \"16k\"  ]; then\n            bits=16000\n          fi\n\n          # Easier to rename to that we can exercize the LDC93S1 importer code to\n          # generate the CSV file.\n          echo \"Moving ${bits} to LDC93S1.wav\"\n          mv data/smoke_test/LDC93S1_pcms16le_1_${bits}.wav data/smoke_test/LDC93S1.wav\n\n          ./bin/run-ci-ldc93s1_new.sh 249 ${bits}\n          ./bin/run-ci-ldc93s1_tflite.sh ${bits}\n      - run: |\n          curl -vsSL https://github.com/mozilla/DeepSpeech/releases/download/v0.9.3/macOS.amd64.convert_graphdef_memmapped_format.xz | xz -d > /tmp/convert_graphdef_memmapped_format\n          chmod +x /tmp/convert_graphdef_memmapped_format\n          /tmp/convert_graphdef_memmapped_format --in_graph=/tmp/train/output_graph.pb --out_graph=/tmp/train/output_graph.pbmm\n      - run: |\n          tar -cf - \\\n            -C /tmp/ckpt/ . \\\n            | xz -9 -T0 > /tmp/checkpoint.tar.xz\n      - run: |\n          mkdir -p ${{ github.workspace }}/tmp/\n          cp /tmp/train*/output_graph.* /tmp/checkpoint.tar.xz ${{ github.workspace }}/tmp/\n      - run: |\n          ls -hal /tmp/ ${{ github.workspace }}/tmp/\n      - uses: actions/upload-artifact@v2\n        with:\n          name: \"test-model.tf-${{ matrix.bitrate }}.zip\"\n          path: ${{ github.workspace }}/tmp/output_graph.pb*\n      - uses: actions/upload-artifact@v2\n        with:\n          name: \"test-model.tflite-${{ matrix.bitrate }}.zip\"\n          path: ${{ github.workspace }}/tmp/output_graph.tflite\n      - uses: actions/upload-artifact@v2\n        with:\n          name: \"test-checkpoint.${{ matrix.bitrate }}.zip\"\n          path: ${{ github.workspace }}/tmp/checkpoint.tar.xz\n  tensorflow_opt-macOS:\n    name: \"Mac|Check TensorFlow cache\"\n    runs-on: ubuntu-20.04\n    outputs:\n      status: ${{ steps.check_artifact_exists.outputs.status }}\n      cache_key: ${{ steps.get_cache_key.outputs.key }}\n    steps:\n      - uses: actions/checkout@v2\n        with:\n          fetch-depth: 1\n      - id: get_cache_key\n        uses: ./.github/actions/get_cache_key\n        with:\n          extras: \"2\"\n      - id: check_artifact_exists\n        uses: ./.github/actions/check_artifact_exists\n        with:\n          name: ${{ steps.get_cache_key.outputs.key }}\n  build-tensorflow-macOS:\n    name: \"Mac|Build TensorFlow (opt)\"\n    needs: tensorflow_opt-macOS\n    runs-on: macos-10.15\n    steps:\n      - run: true\n        if: needs.tensorflow_opt-macOS.outputs.status == 'found'\n      - uses: actions/checkout@v2\n        with:\n          fetch-depth: 0\n          submodules: 'recursive'\n        if: needs.tensorflow_opt-macOS.outputs.status == 'missing'\n      - uses: ./.github/actions/select-xcode\n        with:\n          version: \"12.1.1\"\n        if: needs.tensorflow_opt-macOS.outputs.status == 'missing'\n      - uses: ./.github/actions/setup-tensorflow\n        if: needs.tensorflow_opt-macOS.outputs.status == 'missing'\n      - uses: ./.github/actions/build-tensorflow\n        with:\n          flavor: \"--darwin-cpu\"\n        if: needs.tensorflow_opt-macOS.outputs.status == 'missing'\n      - uses: ./.github/actions/package-tensorflow\n        if: needs.tensorflow_opt-macOS.outputs.status == 'missing'\n      - uses: actions/upload-artifact@v2\n        with:\n          name: ${{ needs.tensorflow_opt-macOS.outputs.cache_key }}\n          path: ${{ github.workspace }}/artifacts/home.tar.xz\n        if: needs.tensorflow_opt-macOS.outputs.status == 'missing'\n  build-lib_macOS:\n    name: \"Mac|Build libdeepspeech+client\"\n    runs-on: macos-10.15\n    needs: [ build-tensorflow-macOS, tensorflow_opt-macOS ]\n    strategy:\n      matrix:\n        build-flavor: [\"tf\", \"tflite\"]\n    steps:\n      - uses: actions/checkout@v2\n        with:\n          fetch-depth: 0\n      - uses: actions/download-artifact@v2\n        with:\n          name: ${{ needs.tensorflow_opt-macOS.outputs.cache_key }}\n          path: ${{ github.workspace }}/\n        if: needs.tensorflow_opt-macOS.outputs.status == 'missing'\n      - uses: ./.github/actions/check_artifact_exists\n        with:\n          name: ${{ needs.tensorflow_opt-macOS.outputs.cache_key }}\n          path: ${{ github.workspace }}/\n          download: true\n        if: needs.tensorflow_opt-macOS.outputs.status == 'found'\n      - run: |\n          tar xkf ${{ github.workspace }}/home.tar.xz\n          rm ${{ github.workspace }}/home.tar.xz\n      - run: |\n          git status\n      - uses: ./.github/actions/select-xcode\n        with:\n          version: \"12.1.1\"\n      - uses: ./.github/actions/host-build\n        with:\n          flavor: ${{ matrix.build-flavor }}\n      - uses: ./.github/actions/package\n      - uses: actions/upload-artifact@v2\n        with:\n          name: \"native_client.${{ matrix.build-flavor }}.macOS.tar.xz\"\n          path: ${{ github.workspace }}/artifacts/native_client.tar.xz\n      - uses: actions/upload-artifact@v2\n        with:\n          name: \"libdeepspeech.${{ matrix.build-flavor }}.zip\"\n          path: ${{ github.workspace }}/artifacts/libdeepspeech.zip\n  build-python-macOS:\n    name: \"Mac|Build python bindings\"\n    runs-on: macos-10.15\n    needs: [ build-lib_macOS, swig_macOS ]\n    strategy:\n      matrix:\n        build-flavor: [\"tf\", \"tflite\"]\n        python-version: [3.6.8, 3.7.9, 3.8.8, 3.9.2]\n    steps:\n      - uses: actions/checkout@v2\n        with:\n          fetch-depth: 1\n      - uses: actions/download-artifact@v2\n        with:\n          name: \"native_client.${{ matrix.build-flavor }}.macOS.tar.xz\"\n          path: ${{ github.workspace }}/tensorflow/bazel-bin/native_client/\n      - run: |\n          cd ${{ github.workspace }}/tensorflow/bazel-bin/native_client/\n          tar xf native_client.tar.xz\n          ls -hal\n          cd ${{ github.workspace }}/\n      - uses: actions/download-artifact@v2\n        with:\n          name: \"swig_macOS\"\n          path: ${{ github.workspace }}/native_client/ds-swig/\n      - name: Link ds-swig into swig\n        run: |\n          ls -hal ${{ github.workspace }}/native_client/ds-swig/bin\n          ln -s ds-swig ${{ github.workspace }}/native_client/ds-swig/bin/swig\n          chmod +x ${{ github.workspace }}/native_client/ds-swig/bin/ds-swig ${{ github.workspace }}/native_client/ds-swig/bin/swig\n      - uses: ./.github/actions/install-python-upstream\n        with:\n          version: ${{ matrix.python-version }}\n      # GitHub packaged version are limited to macOS deployment target 10.14\n      #- uses: actions/setup-python@v2\n      #  with:\n      #    python-version: ${{ matrix.python-version }}\n      - id: get_numpy\n        uses: ./.github/actions/numpy_vers\n        with:\n          pyver: ${{ matrix.python-version }}\n      - uses: ./.github/actions/python-build\n        with:\n          build_flavor: ${{ matrix.build-flavor }}\n          numpy_build: \"${{ steps.get_numpy.outputs.build_version }}\"\n          numpy_dep: \"${{ steps.get_numpy.outputs.dep_version }}\"\n      - uses: actions/upload-artifact@v2\n        with:\n          name: \"deepspeech-${{ matrix.build-flavor }}-${{ matrix.python-version }}-macOS.whl\"\n          path: ${{ github.workspace }}/wheels/*.whl\n  build-nodejs-macOS:\n    name: \"Mac|Build NodeJS and ElectronJS\"\n    runs-on: macos-10.15\n    needs: [ build-lib_macOS, swig_macOS ]\n    strategy:\n      matrix:\n        build-flavor: [\"tf\", \"tflite\"]\n    steps:\n      - uses: actions/checkout@v2\n        with:\n          fetch-depth: 1\n      - uses: actions/download-artifact@v2\n        with:\n          name: \"native_client.${{ matrix.build-flavor }}.macOS.tar.xz\"\n          path: ${{ github.workspace }}/tensorflow/bazel-bin/native_client/\n      - run: |\n          cd ${{ github.workspace }}/tensorflow/bazel-bin/native_client/\n          tar xf native_client.tar.xz\n          ls -hal\n          cd ${{ github.workspace }}/\n      - uses: actions/download-artifact@v2\n        with:\n          name: \"swig_macOS\"\n          path: ${{ github.workspace }}/native_client/ds-swig/\n      - name: Link ds-swig into swig\n        run: |\n          ls -hal ${{ github.workspace }}/native_client/ds-swig/bin\n          ln -s ds-swig ${{ github.workspace }}/native_client/ds-swig/bin/swig\n          chmod +x ${{ github.workspace }}/native_client/ds-swig/bin/ds-swig ${{ github.workspace }}/native_client/ds-swig/bin/swig\n      - uses: actions/setup-node@v2\n        with:\n          node-version: 12\n      - uses: actions/cache@v2\n        id: node-headers-cache\n        with:\n          path: native_client/javascript/headers/nodejs/\n          key: node-headers-10.0.0_16.0.0\n      - uses: actions/cache@v2\n        id: electron-headers-cache\n        with:\n          path: native_client/javascript/headers/electronjs/\n          key: electron-headers-5.0.13_12.0.0\n      - uses: ./.github/actions/node-build\n        with:\n          nodejs_versions: \"10.0.0 11.0.0 12.7.0 13.0.0 14.0.0 15.0.0 16.0.0\"\n          electronjs_versions: \"5.0.13 6.0.12 6.1.7 7.0.1 7.1.8 8.0.1 9.0.1 9.1.0 9.2.0 10.0.0 10.1.0 11.0.0 12.0.0\"\n      - uses: actions/upload-artifact@v2\n        with:\n          name: \"nodewrapper-${{ matrix.build-flavor }}-macOS_amd64.tar.gz\"\n          path: ${{ github.workspace }}/native_client/javascript/wrapper.tar.gz\n      - uses: actions/upload-artifact@v2\n        with:\n          name: \"deepspeech_intermediate-${{ matrix.build-flavor }}-macOS.tgz\"\n          path: ${{ github.workspace }}/native_client/javascript/deepspeech-*.tgz\n  test-cpp-macOS:\n    name: \"Mac|Test C++ binary\"\n    runs-on: macos-10.15\n    needs: [ build-lib_macOS, train-test-model-macOS ]\n    if: ${{ github.event_name == 'pull_request' }}\n    strategy:\n      matrix:\n        build-flavor: [\"tf\", \"tflite\"]\n        models: [\"test\", \"prod\"]\n        bitrate: [\"8k\", \"16k\"]\n    env:\n      CI_TMP_DIR: ${{ github.workspace }}/tmp/\n      DEEPSPEECH_PROD_MODEL: https://github.com/reuben/DeepSpeech/releases/download/v0.7.0-alpha.3/output_graph.pb\n      DEEPSPEECH_PROD_MODEL_MMAP: https://github.com/reuben/DeepSpeech/releases/download/v0.7.0-alpha.3/output_graph.pbmm\n      DEEPSPEECH_TEST_MODEL: ${{ github.workspace }}/tmp/output_graph.pb\n      EXPECTED_TENSORFLOW_VERSION: \"TensorFlow: v2.3.0-6-g23ad988\"\n    steps:\n      - uses: actions/checkout@v2\n        with:\n          fetch-depth: 1\n      - uses: actions/download-artifact@v2\n        with:\n          name: \"native_client.${{ matrix.build-flavor }}.macOS.tar.xz\"\n          path: ${{ env.CI_TMP_DIR }}\n      - run: |\n          cd ${{ env.CI_TMP_DIR }}\n          mkdir ds && cd ds && tar xf ../native_client.tar.xz\n      - uses: actions/download-artifact@v2\n        with:\n          name: \"test-model.${{ matrix.build-flavor }}-${{ matrix.bitrate }}.zip\"\n          path: ${{ env.CI_TMP_DIR }}\n        if: matrix.models == 'test'\n      - run: |\n          ls -hal ${{ env.CI_TMP_DIR }}/\n        if: matrix.models == 'test'\n      - uses: ./.github/actions/run-tests\n        with:\n          runtime: \"cpp\"\n          build-flavor: ${{ matrix.build-flavor }}\n          bitrate: ${{ matrix.bitrate }}\n          model-kind: ${{ matrix.models }}\n  test-py-macOS:\n    name: \"Mac|Test Python bindings\"\n    runs-on: macos-10.15\n    needs: [ build-python-macOS, train-test-model-macOS ]\n    if: ${{ github.event_name == 'pull_request' }}\n    strategy:\n      matrix:\n        python-version: [3.6.8, 3.7.9, 3.8.8, 3.9.2]\n        build-flavor: [\"tf\", \"tflite\"]\n        models: [\"test\", \"prod\"]\n        bitrate: [\"8k\", \"16k\"]\n    env:\n      CI_TMP_DIR: ${{ github.workspace }}/tmp/\n      DEEPSPEECH_PROD_MODEL: https://github.com/reuben/DeepSpeech/releases/download/v0.7.0-alpha.3/output_graph.pb\n      DEEPSPEECH_PROD_MODEL_MMAP: https://github.com/reuben/DeepSpeech/releases/download/v0.7.0-alpha.3/output_graph.pbmm\n      DEEPSPEECH_TEST_MODEL: ${{ github.workspace }}/tmp/output_graph.pb\n      EXPECTED_TENSORFLOW_VERSION: \"TensorFlow: v2.3.0-6-g23ad988\"\n    steps:\n      - uses: actions/checkout@v2\n        with:\n          fetch-depth: 1\n      - uses: actions/setup-python@v2\n        with:\n          python-version: ${{ matrix.python-version }}\n      - uses: actions/download-artifact@v2\n        with:\n          name: \"deepspeech-${{ matrix.build-flavor }}-${{ matrix.python-version }}-macOS.whl\"\n          path: ${{ env.CI_TMP_DIR }}\n      - uses: actions/download-artifact@v2\n        with:\n          name: \"test-model.${{ matrix.build-flavor }}-${{ matrix.bitrate }}.zip\"\n          path: ${{ env.CI_TMP_DIR }}\n        if: matrix.models == 'test'\n      - run: |\n          ls -hal ${{ env.CI_TMP_DIR }}/\n        if: matrix.models == 'test'\n      - run: |\n          ls -hal ${{ env.CI_TMP_DIR }}/\n          pip3 install --only-binary :all: --upgrade ${{ env.CI_TMP_DIR }}/deepspeech*.whl\n      - uses: ./.github/actions/run-tests\n        with:\n          runtime: \"python\"\n          build-flavor: ${{ matrix.build-flavor }}\n          bitrate: ${{ matrix.bitrate }}\n          model-kind: ${{ matrix.models }}\n  test-nodejs-macOS:\n    name: \"Mac|Test NodeJS bindings\"\n    runs-on: macos-10.15\n    needs: [ build-nodejs-macOS, train-test-model-macOS ]\n    if: ${{ github.event_name == 'pull_request' }}\n    strategy:\n      matrix:\n        # https://nodejs.org/en/about/releases/\n        nodejs-version: [10, 12, 14, 16]\n        build-flavor: [\"tf\", \"tflite\"]\n        models: [\"test\"]\n        bitrate: [\"16k\"]\n    env:\n      CI_TMP_DIR: ${{ github.workspace }}/tmp/\n      DEEPSPEECH_PROD_MODEL: https://github.com/reuben/DeepSpeech/releases/download/v0.7.0-alpha.3/output_graph.pb\n      DEEPSPEECH_PROD_MODEL_MMAP: https://github.com/reuben/DeepSpeech/releases/download/v0.7.0-alpha.3/output_graph.pbmm\n      DEEPSPEECH_TEST_MODEL: ${{ github.workspace }}/tmp/output_graph.pb\n      EXPECTED_TENSORFLOW_VERSION: \"TensorFlow: v2.3.0-6-g23ad988\"\n    steps:\n      - uses: actions/checkout@v2\n        with:\n          fetch-depth: 1\n      - uses: actions/setup-node@v2\n        with:\n          node-version: ${{ matrix.nodejs-version }}\n      - uses: actions/download-artifact@v2\n        with:\n          name: \"deepspeech_intermediate-${{ matrix.build-flavor }}-macOS.tgz\"\n          path: ${{ env.CI_TMP_DIR }}\n      - uses: actions/download-artifact@v2\n        with:\n          name: \"test-model.${{ matrix.build-flavor }}-${{ matrix.bitrate }}.zip\"\n          path: ${{ env.CI_TMP_DIR }}\n        if: matrix.models == 'test'\n      - run: |\n          ls -hal ${{ env.CI_TMP_DIR }}/\n        if: matrix.models == 'test'\n      - uses: actions/cache@v2\n        id: node-modules-cache\n        with:\n          path: ~/.npm/\n          key: node-modules-${{ matrix.build-flavor }}-${{ runner.os }}-${{ env.CI_NODE_MODULES_NTH }}\n      - name: Install deepspeech package\n        run: |\n          ls -hal ${{ env.CI_TMP_DIR }}/\n          npm install --verbose ${{ env.CI_TMP_DIR }}/deepspeech*.tgz\n      - run: |\n          ls -hal node_modules/deepspeech* node_modules/.bin/\n      - uses: ./.github/actions/run-tests\n        with:\n          runtime: \"node\"\n          build-flavor: ${{ matrix.build-flavor }}\n          bitrate: ${{ matrix.bitrate }}\n          model-kind: ${{ matrix.models }}\n  test-electronjs-macOS:\n    name: \"Mac|Test ElectronJS bindings\"\n    runs-on: macos-10.15\n    needs: [ build-nodejs-macOS, train-test-model-macOS ]\n    if: ${{ github.event_name == 'pull_request' }}\n    strategy:\n      matrix:\n        electronjs-version: [5.0.13, 6.1.7, 7.1.8, 8.0.1, 9.2.0, 10.1.0, 11.0.0, 12.0.0]\n        build-flavor: [\"tf\", \"tflite\"]\n        models: [\"test\"]\n        bitrate: [\"16k\"]\n    env:\n      CI_TMP_DIR: ${{ github.workspace }}/tmp/\n      DEEPSPEECH_PROD_MODEL: https://github.com/reuben/DeepSpeech/releases/download/v0.7.0-alpha.3/output_graph.pb\n      DEEPSPEECH_PROD_MODEL_MMAP: https://github.com/reuben/DeepSpeech/releases/download/v0.7.0-alpha.3/output_graph.pbmm\n      DEEPSPEECH_TEST_MODEL: ${{ github.workspace }}/tmp/output_graph.pb\n      EXPECTED_TENSORFLOW_VERSION: \"TensorFlow: v2.3.0-6-g23ad988\"\n    steps:\n      - uses: actions/checkout@v2\n        with:\n          fetch-depth: 1\n      - uses: actions/setup-node@v2\n        with:\n          node-version: 12\n      - uses: actions/download-artifact@v2\n        with:\n          name: \"deepspeech_intermediate-${{ matrix.build-flavor }}-macOS.tgz\"\n          path: ${{ env.CI_TMP_DIR }}\n      - uses: actions/download-artifact@v2\n        with:\n          name: \"test-model.${{ matrix.build-flavor }}-${{ matrix.bitrate }}.zip\"\n          path: ${{ env.CI_TMP_DIR }}\n        if: matrix.models == 'test'\n      - run: |\n          ls -hal ${{ env.CI_TMP_DIR }}/\n        if: matrix.models == 'test'\n      - uses: actions/cache@v2\n        id: electron-modules-cache\n        with:\n          path: ~/.npm/\n          key: electron-modules-${{ matrix.build-flavor }}-${{ runner.os }}-${{ env.CI_NODE_MODULES_NTH }}\n      - name: Install deepspeech package\n        run: |\n          ls -hal ${{ env.CI_TMP_DIR }}/\n          npm install ${{ env.CI_TMP_DIR }}/deepspeech*.tgz\n      - run: |\n          npm install electron@${{ matrix.electronjs-version }}\n      - uses: ./.github/actions/run-tests\n        with:\n          runtime: \"electronjs\"\n          build-flavor: ${{ matrix.build-flavor }}\n          bitrate: ${{ matrix.bitrate }}\n          model-kind: ${{ matrix.models }}\n        timeout-minutes: 5\n  # Windows jobs\n  build-ctc-decoder-windows:\n    name: \"Win|Build CTC decoder Python package\"\n    needs: [swig_Windows_crosscompiled]\n    runs-on: windows-2019\n    steps:\n      - name: Switch git-bash shell to MSYS2 shell by adding MSYS2 path to PATH front\n        run: echo \"$MSYS2_SHELL_PATH\" >> $GITHUB_PATH\n      - uses: mozilla/setup-msys2@v2\n        with:\n          msystem: MSYS\n          path-type: inherit\n          update: true\n          install: >-\n            git\n            make\n      - uses: mozilla/msvc-dev-cmd@v1\n      - uses: actions/checkout@v2\n        with:\n          fetch-depth: 0\n      - uses: actions/setup-python@v2\n        with:\n          python-version: 3.7.9\n      - run: |\n          python --version\n          python -m pip --version\n      - uses: actions/download-artifact@v2\n        with:\n          name: \"swig_Windows_crosscompiled\"\n          path: ${{ github.workspace }}/native_client/ds-swig/\n      - name: Link ds-swig into swig\n        run: |\n          set -ex\n          ls -hal native_client/ds-swig/bin\n          ln -s ds-swig.exe native_client/ds-swig/bin/swig.exe\n          chmod +x native_client/ds-swig/bin/ds-swig.exe native_client/ds-swig/bin/swig.exe\n      - name: Remove /usr/bin/link conflicting with MSVC link.exe\n        run: |\n          rm /usr/bin/link\n      - run: |\n          make -C native_client/ctcdecode/ \\\n            NUM_PROCESSES=$(nproc) \\\n            bindings\n      - uses: actions/upload-artifact@v2\n        with:\n          name: \"ds_ctcdecoder-windows-test.whl\"\n          path: ${{ github.workspace }}/native_client/ctcdecode/dist/*.whl\n      - run: |\n          make -C native_client/ctcdecode clean-keep-third-party\n  tensorflow_opt-Windows:\n    name: \"Win|Check TensorFlow cache\"\n    runs-on: ubuntu-20.04\n    outputs:\n      status: ${{ steps.check_artifact_exists.outputs.status }}\n      cache_key: ${{ steps.get_cache_key.outputs.key }}\n    steps:\n      - uses: actions/checkout@v2\n        with:\n          fetch-depth: 1\n      - id: get_cache_key\n        uses: ./.github/actions/get_cache_key\n        with:\n          extras: \"7\"\n      - id: check_artifact_exists\n        uses: ./.github/actions/check_artifact_exists\n        with:\n          name: ${{ steps.get_cache_key.outputs.key }}\n  build-tensorflow-Windows:\n    name: \"Win|Build TensorFlow (opt)\"\n    needs: tensorflow_opt-Windows\n    runs-on: windows-2019\n    steps:\n      - run: true\n        if: needs.tensorflow_opt-Windows.outputs.status == 'found'\n      - uses: mozilla/setup-msys2@v2\n        with:\n          msystem: MSYS\n          path-type: inherit\n          update: true\n          install: >-\n            git\n            patch\n            tar\n            unzip\n            zip\n        if: needs.tensorflow_opt-Windows.outputs.status == 'missing'\n      - uses: actions/setup-python@v2\n        with:\n          python-version: 3.7.9\n        if: needs.tensorflow_opt-Windows.outputs.status == 'missing'\n      - uses: actions/checkout@v2\n        with:\n          fetch-depth: 0\n          submodules: 'recursive'\n        if: needs.tensorflow_opt-Windows.outputs.status == 'missing'\n      # It's important that this PATH change only happens *after* the checkout\n      # above, because otherwise the checkout fails when persisisting the\n      # credentials for submodules due to using MSYS2 Git\n      - name: Switch git-bash shell to MSYS2 shell by adding MSYS2 path to PATH front\n        run: echo \"$MSYS2_SHELL_PATH\" >> $GITHUB_PATH\n        if: needs.tensorflow_opt-Windows.outputs.status == 'missing'\n      - run: ./ci_scripts/tf-setup.sh\n        if: needs.tensorflow_opt-Windows.outputs.status == 'missing'\n      - run: ./ci_scripts/tf-build.sh \"--windows-cpu\"\n        if: needs.tensorflow_opt-Windows.outputs.status == 'missing'\n      - run: ./ci_scripts/tf-package.sh\n        if: needs.tensorflow_opt-Windows.outputs.status == 'missing'\n      - uses: actions/upload-artifact@v2\n        with:\n          name: ${{ needs.tensorflow_opt-Windows.outputs.cache_key }}\n          path: ${{ github.workspace }}/artifacts/home.tar.xz\n        if: needs.tensorflow_opt-Windows.outputs.status == 'missing'\n  build-lib_Windows:\n    name: \"Win|Build libdeepspeech+client\"\n    runs-on: windows-2019\n    needs: [build-tensorflow-Windows, tensorflow_opt-Windows]\n    strategy:\n      matrix:\n        build-flavor: [\"tf\", \"tflite\"]\n    steps:\n      - uses: actions/checkout@v2\n        with:\n          fetch-depth: 0\n      - uses: mozilla/msvc-dev-cmd@v1\n      - name: Switch git-bash shell to MSYS2 shell by adding MSYS2 path to PATH front\n        run: echo \"$MSYS2_SHELL_PATH\" >> $GITHUB_PATH\n      - uses: mozilla/setup-msys2@v2\n        with:\n          msystem: MSYS\n          update: true\n          install: >-\n            git\n            make\n            patch\n            pkg-config\n            tar\n            unzip\n            zip\n      - uses: actions/download-artifact@v2\n        with:\n          name: ${{ needs.tensorflow_opt-Windows.outputs.cache_key }}\n          path: ${{ github.workspace }}/\n        if: needs.tensorflow_opt-Windows.outputs.status == 'missing'\n      - uses: ./.github/actions/check_artifact_exists\n        with:\n          name: ${{ needs.tensorflow_opt-Windows.outputs.cache_key }}\n          path: ${{ github.workspace }}/\n          download: true\n        if: needs.tensorflow_opt-Windows.outputs.status == 'found'\n      - run: |\n          \"C:/Program Files/7-Zip/7z.exe\" x home.tar.xz -so | \"C:/Program Files/7-Zip/7z.exe\" x -aos -si -ttar -o`pwd`\n          rm home.tar.xz\n      - run: |\n          git status\n      - run: ./ci_scripts/host-build.sh ${{ matrix.build-flavor }}\n      - run: ./ci_scripts/package.sh\n      - uses: actions/upload-artifact@v2\n        with:\n          name: \"native_client.${{ matrix.build-flavor }}.Windows.tar.xz\"\n          path: ${{ github.workspace }}/artifacts/native_client.tar.xz\n      - uses: actions/upload-artifact@v2\n        with:\n          name: \"libdeepspeech.${{ matrix.build-flavor }}.zip\"\n          path: ${{ github.workspace }}/artifacts/libdeepspeech.zip\n  build-python-Windows:\n    name: \"Win|Build Python bindings\"\n    runs-on: windows-2019\n    needs: [build-lib_Windows, swig_Windows_crosscompiled]\n    strategy:\n      matrix:\n        build-flavor: [\"tf\", \"tflite\"]\n        # Try to keep Python versions in sync with cached versions to speed things up:\n        # https://github.com/actions/virtual-environments/blob/main/images/win/Windows2019-Readme.md\n        python-version: [3.6.8, 3.7.9, 3.8.8, 3.9.4]\n    steps:\n      - name: Switch git-bash shell to MSYS2 shell by adding MSYS2 path to PATH front\n        run: echo \"$MSYS2_SHELL_PATH\" >> $GITHUB_PATH\n      - uses: mozilla/setup-msys2@v2\n        with:\n          msystem: MSYS\n          path-type: inherit\n          update: true\n          install: >-\n            make\n      - uses: mozilla/msvc-dev-cmd@v1\n      - uses: actions/checkout@v2\n        with:\n          fetch-depth: 1\n      - uses: actions/download-artifact@v2\n        with:\n          name: \"native_client.${{ matrix.build-flavor }}.Windows.tar.xz\"\n          path: ${{ github.workspace }}/tensorflow/bazel-bin/native_client/\n      - run: |\n          pushd tensorflow/bazel-bin/native_client/\n          \"C:/Program Files/7-Zip/7z.exe\" x native_client.tar.xz -so | \"C:/Program Files/7-Zip/7z.exe\" x -aoa -si -ttar -o`pwd`\n          ls -hal\n          popd\n      - uses: actions/download-artifact@v2\n        with:\n          name: \"swig_Windows_crosscompiled\"\n          path: ${{ github.workspace }}/native_client/ds-swig/\n      - name: Link ds-swig into swig\n        run: |\n          set -ex\n          ls -hal native_client/ds-swig/bin\n          ln -s ds-swig.exe native_client/ds-swig/bin/swig.exe\n          chmod +x native_client/ds-swig/bin/ds-swig.exe native_client/ds-swig/bin/swig.exe\n      - uses: actions/setup-python@v2\n        with:\n          python-version: ${{ matrix.python-version }}\n      - name: Remove /usr/bin/link conflicting with MSVC link.exe\n        run: |\n          rm /usr/bin/link\n      - id: get_numpy\n        uses: ./.github/actions/numpy_vers\n        with:\n          pyver: ${{ matrix.python-version }}\n      - uses: ./.github/actions/python-build\n        with:\n          build_flavor: ${{ matrix.build-flavor }}\n          numpy_build: \"${{ steps.get_numpy.outputs.build_version }}\"\n          numpy_dep: \"${{ steps.get_numpy.outputs.dep_version }}\"\n      - uses: actions/upload-artifact@v2\n        with:\n          name: \"deepspeech-${{ matrix.build-flavor }}-${{ matrix.python-version }}-Windows.whl\"\n          path: ${{ github.workspace }}/wheels/*.whl\n  build-nodejs-Windows:\n    name: \"Win|Build NodeJS/ElectronJS\"\n    runs-on: windows-2019\n    needs: [build-lib_Windows, swig_Windows_crosscompiled]\n    strategy:\n      matrix:\n        build-flavor: [\"tf\", \"tflite\"]\n    steps:\n      - name: Switch git-bash shell to MSYS2 shell by adding MSYS2 path to PATH front\n        run: echo \"$MSYS2_SHELL_PATH\" >> $GITHUB_PATH\n      - uses: mozilla/setup-msys2@v2\n        with:\n          msystem: MSYS\n          path-type: inherit\n          update: true\n          install: >-\n            make\n            tar\n      - uses: mozilla/msvc-dev-cmd@v1\n      - uses: actions/checkout@v2\n        with:\n          fetch-depth: 1\n      - uses: actions/download-artifact@v2\n        with:\n          name: \"native_client.${{ matrix.build-flavor }}.Windows.tar.xz\"\n          path: ${{ github.workspace }}/tensorflow/bazel-bin/native_client/\n      - run: |\n          pushd tensorflow/bazel-bin/native_client/\n          \"C:/Program Files/7-Zip/7z.exe\" x native_client.tar.xz -so | \"C:/Program Files/7-Zip/7z.exe\" x -aoa -si -ttar -o`pwd`\n          ls -hal\n          popd\n      - uses: actions/download-artifact@v2\n        with:\n          name: \"swig_Windows_crosscompiled\"\n          path: ${{ github.workspace }}/native_client/ds-swig/\n      - name: Link ds-swig into swig\n        run: |\n          set -ex\n          ls -hal native_client/ds-swig/bin\n          ln -s ds-swig.exe native_client/ds-swig/bin/swig.exe\n          chmod +x native_client/ds-swig/bin/ds-swig.exe native_client/ds-swig/bin/swig.exe\n      - uses: actions/setup-node@v2\n        with:\n          node-version: 12\n      - uses: actions/cache@v2\n        id: node-headers-cache\n        with:\n          path: native_client/javascript/headers/nodejs/\n          key: node-headers-win-10.0.0_16.0.0\n      - uses: actions/cache@v2\n        id: electron-headers-cache\n        with:\n          path: native_client/javascript/headers/electronjs/\n          key: electron-headers-win-5.0.13_12.0.0\n      - uses: ./.github/actions/node-build\n        with:\n          nodejs_versions: \"10.0.0 11.0.0 12.7.0 13.0.0 14.0.0 15.0.0 16.0.0\"\n          electronjs_versions: \"5.0.13 6.0.12 6.1.7 7.0.1 7.1.8 8.0.1 9.0.1 9.1.0 9.2.0 10.0.0 10.1.0 11.0.0 12.0.0\"\n      - uses: actions/upload-artifact@v2\n        with:\n          name: \"nodewrapper-${{ matrix.build-flavor }}-Windows_amd64.tar.gz\"\n          path: ${{ github.workspace }}/native_client/javascript/wrapper.tar.gz\n      - uses: actions/upload-artifact@v2\n        with:\n          name: \"deepspeech_intermediate-${{ matrix.build-flavor }}-Windows.tgz\"\n          path: ${{ github.workspace }}/native_client/javascript/deepspeech-*.tgz\n  test-cpp-Windows:\n    name: \"Win|Test C++ binary\"\n    runs-on: windows-2019\n    needs: [build-lib_Windows, train-test-model-Linux]\n    strategy:\n      matrix:\n        build-flavor: [\"tf\", \"tflite\"]\n    env:\n      CI_TMP_DIR: tmp/\n      DEEPSPEECH_TEST_MODEL: tmp/output_graph.pb\n      EXPECTED_TENSORFLOW_VERSION: \"TensorFlow: v2.3.0-6-g23ad988\"\n    steps:\n      - name: Switch git-bash shell to MSYS2 shell by adding MSYS2 path to PATH front\n        run: echo \"$MSYS2_SHELL_PATH\" >> $GITHUB_PATH\n      - uses: mozilla/setup-msys2@v2\n        with:\n          msystem: MSYS\n          update: true\n          install: >-\n            vim\n      - uses: actions/checkout@v2\n        with:\n          fetch-depth: 1\n      - name: Download native_client.tar.xz\n        uses: actions/download-artifact@v2\n        with:\n          name: \"native_client.${{ matrix.build-flavor }}.Windows.tar.xz\"\n          path: ${{ env.CI_TMP_DIR }}\n      - name: Extract native_client.tar.xz\n        run: |\n          mkdir -p ${{ env.CI_TMP_DIR }}/ds\n          pushd ${{ env.CI_TMP_DIR }}/ds\n          \"C:/Program Files/7-Zip/7z.exe\" x ../native_client.tar.xz -so | \"C:/Program Files/7-Zip/7z.exe\" x -aoa -si -ttar -o`pwd`\n          ls -hal\n          popd\n      - name: Download trained test model\n        uses: actions/download-artifact@v2\n        with:\n          name: \"test-model.${{ matrix.build-flavor }}-16k.zip\"\n          path: ${{ env.CI_TMP_DIR }}\n      - run: |\n          ls -hal ${{ env.CI_TMP_DIR }}/\n      - uses: ./.github/actions/run-tests\n        with:\n          runtime: \"cppwin\"\n          build-flavor: ${{ matrix.build-flavor }}\n          bitrate: \"16k\"\n          model-kind: \"\"\n  test-py-Windows:\n    name: \"Win|Test Python bindings\"\n    runs-on: windows-2019\n    needs: [ build-python-Windows, train-test-model-Linux ]\n    if: ${{ github.event_name == 'pull_request' }}\n    strategy:\n      matrix:\n        # Try to keep Python versions in sync with cached versions to speed things up:\n        # https://github.com/actions/virtual-environments/blob/main/images/win/Windows2019-Readme.md\n        python-version: [3.6.8, 3.7.9, 3.8.8, 3.9.4]\n        build-flavor: [\"tf\", \"tflite\"]\n        models: [\"test\", \"prod\"]\n        bitrate: [\"8k\", \"16k\"]\n    env:\n      CI_TMP_DIR: tmp/\n      DEEPSPEECH_PROD_MODEL: https://github.com/reuben/DeepSpeech/releases/download/v0.7.0-alpha.3/output_graph.pb\n      DEEPSPEECH_PROD_MODEL_MMAP: https://github.com/reuben/DeepSpeech/releases/download/v0.7.0-alpha.3/output_graph.pbmm\n      DEEPSPEECH_TEST_MODEL: tmp/output_graph.pb\n      EXPECTED_TENSORFLOW_VERSION: \"TensorFlow: v2.3.0-6-g23ad988\"\n    steps:\n      - name: Switch git-bash shell to MSYS2 shell by adding MSYS2 path to PATH front\n        run: echo \"$MSYS2_SHELL_PATH\" >> $GITHUB_PATH\n      - uses: mozilla/setup-msys2@v2\n        with:\n          msystem: MSYS\n          path-type: inherit\n          update: true\n          install: >-\n            vim\n      - uses: actions/checkout@v2\n        with:\n          fetch-depth: 1\n      - uses: actions/setup-python@v2\n        with:\n          python-version: ${{ matrix.python-version }}\n      - uses: ./.github/actions/win-install-sox\n      - uses: actions/download-artifact@v2\n        with:\n          name: \"deepspeech-${{ matrix.build-flavor }}-${{ matrix.python-version }}-Windows.whl\"\n          path: ${{ env.CI_TMP_DIR }}\n      - uses: actions/download-artifact@v2\n        with:\n          name: \"test-model.${{ matrix.build-flavor }}-${{ matrix.bitrate }}.zip\"\n          path: ${{ env.CI_TMP_DIR }}\n        if: matrix.models == 'test'\n      - run: |\n          ls -hal ${{ env.CI_TMP_DIR }}/\n        if: matrix.models == 'test'\n      - run: |\n          ls -hal ${{ env.CI_TMP_DIR }}/\n          python -m pip install --only-binary :all: --upgrade ${{ env.CI_TMP_DIR }}/deepspeech*.whl\n      - uses: ./.github/actions/run-tests\n        with:\n          runtime: \"python\"\n          build-flavor: ${{ matrix.build-flavor }}\n          bitrate: ${{ matrix.bitrate }}\n          model-kind: ${{ matrix.models }}\n  test-nodejs-Windows:\n    name: \"Win|Test NodeJS bindings\"\n    runs-on: windows-2019\n    needs: [ build-nodejs-Windows, train-test-model-Linux ]\n    if: ${{ github.event_name == 'pull_request' }}\n    strategy:\n      matrix:\n        nodejs-version: [10, 12, 14, 16]\n        build-flavor: [\"tf\", \"tflite\"]\n        models: [\"test\"]\n        bitrate: [\"16k\"]\n    env:\n      CI_TMP_DIR: tmp/\n      DEEPSPEECH_PROD_MODEL: https://github.com/reuben/DeepSpeech/releases/download/v0.7.0-alpha.3/output_graph.pb\n      DEEPSPEECH_PROD_MODEL_MMAP: https://github.com/reuben/DeepSpeech/releases/download/v0.7.0-alpha.3/output_graph.pbmm\n      DEEPSPEECH_TEST_MODEL: tmp/output_graph.pb\n      EXPECTED_TENSORFLOW_VERSION: \"TensorFlow: v2.3.0-6-g23ad988\"\n    steps:\n      - name: Switch git-bash shell to MSYS2 shell by adding MSYS2 path to PATH front\n        run: echo \"$MSYS2_SHELL_PATH\" >> $GITHUB_PATH\n      - uses: mozilla/setup-msys2@v2\n        with:\n          msystem: MSYS\n          path-type: inherit\n          update: true\n          install: >-\n            vim\n      - uses: actions/checkout@v2\n        with:\n          fetch-depth: 1\n      - uses: actions/setup-node@v2\n        with:\n          node-version: ${{ matrix.nodejs-version }}\n      - uses: ./.github/actions/win-install-sox\n      - uses: actions/download-artifact@v2\n        with:\n          name: \"deepspeech_intermediate-${{ matrix.build-flavor }}-Windows.tgz\"\n          path: ${{ env.CI_TMP_DIR }}\n      - uses: actions/download-artifact@v2\n        with:\n          name: \"test-model.${{ matrix.build-flavor }}-${{ matrix.bitrate }}.zip\"\n          path: ${{ env.CI_TMP_DIR }}\n        if: matrix.models == 'test'\n      - name: Get npm cache directory\n        id: npm-cache-dir\n        run: |\n          echo \"::set-output name=dir::$(npm config get cache)\"\n      - uses: actions/cache@v2\n        id: node-modules-cache\n        with:\n          path: ${{ steps.npm-cache-dir.outputs.dir }}\n          key: node-modules-${{ matrix.build-flavor }}-${{ runner.os }}-${{ env.CI_NODE_MODULES_NTH }}\n      - run: |\n          ls -hal ${{ env.CI_TMP_DIR }}/\n        if: matrix.models == 'test'\n      - name: Install deepspeech package\n        run: |\n          ls -hal ${{ env.CI_TMP_DIR }}/\n          npm install ${{ env.CI_TMP_DIR }}/deepspeech*.tgz\n      - uses: ./.github/actions/run-tests\n        with:\n          runtime: \"node\"\n          build-flavor: ${{ matrix.build-flavor }}\n          bitrate: ${{ matrix.bitrate }}\n          model-kind: ${{ matrix.models }}\n  test-electronjs-Windows:\n    name: \"Win|Test ElectronJS bindings\"\n    runs-on: windows-2019\n    needs: [ build-nodejs-Windows, train-test-model-Linux ]\n    if: ${{ github.event_name == 'pull_request' }}\n    strategy:\n      matrix:\n        electronjs-version: [5.0.13, 6.1.7, 7.1.8, 8.0.1, 9.2.0, 10.1.0, 11.0.0, 12.0.0]\n        build-flavor: [\"tf\", \"tflite\"]\n        models: [\"test\"]\n        bitrate: [\"16k\"]\n    env:\n      CI_TMP_DIR: tmp/\n      DEEPSPEECH_PROD_MODEL: https://github.com/reuben/DeepSpeech/releases/download/v0.7.0-alpha.3/output_graph.pb\n      DEEPSPEECH_PROD_MODEL_MMAP: https://github.com/reuben/DeepSpeech/releases/download/v0.7.0-alpha.3/output_graph.pbmm\n      DEEPSPEECH_TEST_MODEL: tmp/output_graph.pb\n      EXPECTED_TENSORFLOW_VERSION: \"TensorFlow: v2.3.0-6-g23ad988\"\n    steps:\n      - name: Switch git-bash shell to MSYS2 shell by adding MSYS2 path to PATH front\n        run: echo \"$MSYS2_SHELL_PATH\" >> $GITHUB_PATH\n      - uses: mozilla/setup-msys2@v2\n        with:\n          msystem: MSYS\n          path-type: inherit\n          update: true\n          install: >-\n            vim\n      - uses: actions/checkout@v2\n        with:\n          fetch-depth: 1\n      - uses: actions/setup-node@v2\n        with:\n          node-version: 12\n      - uses: ./.github/actions/win-install-sox\n      - uses: actions/download-artifact@v2\n        with:\n          name: \"deepspeech_intermediate-${{ matrix.build-flavor }}-Windows.tgz\"\n          path: ${{ env.CI_TMP_DIR }}\n      - uses: actions/download-artifact@v2\n        with:\n          name: \"test-model.${{ matrix.build-flavor }}-${{ matrix.bitrate }}.zip\"\n          path: ${{ env.CI_TMP_DIR }}\n        if: matrix.models == 'test'\n      - run: |\n          ls -hal ${{ env.CI_TMP_DIR }}/\n        if: matrix.models == 'test'\n      - name: Get npm cache directory\n        id: npm-cache-dir\n        run: |\n          echo \"::set-output name=dir::$(npm config get cache)\"\n      - uses: actions/cache@v2\n        id: electron-modules-cache\n        with:\n          path: ${{ steps.npm-cache-dir.outputs.dir }}\n          key: electron-modules-${{ matrix.build-flavor }}-${{ runner.os }}-${{ env.CI_NODE_MODULES_NTH }}\n      - name: Install deepspeech package\n        run: |\n          ls -hal ${{ env.CI_TMP_DIR }}/\n          npm install ${{ env.CI_TMP_DIR }}/deepspeech*.tgz\n      - run: |\n          npm install electron@${{ matrix.electronjs-version }}\n      - uses: ./.github/actions/run-tests\n        with:\n          runtime: \"electronjs\"\n          build-flavor: ${{ matrix.build-flavor }}\n          bitrate: ${{ matrix.bitrate }}\n          model-kind: ${{ matrix.models }}\n        timeout-minutes: 5\n  # Shared jobs (multi-platform dependencies)\n  repackage-nodejs-allplatforms:\n    name: \"Repackage NodeJS / ElectronJS for multiplatforms\"\n    runs-on: ubuntu-20.04\n    needs: [build-nodejs-macOS, build-nodejs-Windows, build-nodejs-Linux, build-nodejs-LinuxArmv7, build-nodejs-LinuxAarch64]\n    strategy:\n      matrix:\n        build-flavor: [\"tf\", \"tflite\"]\n    steps:\n      - uses: actions/checkout@v2\n        with:\n          fetch-depth: 1\n      - run: |\n          mkdir -p /tmp/nodewrapper-${{ matrix.build-flavor }}-macOS_amd64/\n          mkdir -p /tmp/nodewrapper-${{ matrix.build-flavor }}-Windows_amd64/\n      - uses: actions/download-artifact@v2\n        with:\n          name: \"nodewrapper-${{ matrix.build-flavor }}-macOS_amd64.tar.gz\"\n          path: /tmp/nodewrapper-macOS_amd64/\n      - uses: actions/download-artifact@v2\n        with:\n          name: \"nodewrapper-${{ matrix.build-flavor }}-Windows_amd64.tar.gz\"\n          path: /tmp/nodewrapper-Windows_amd64/\n      - uses: actions/download-artifact@v2\n        with:\n          name: \"nodewrapper-${{ matrix.build-flavor }}-Linux_amd64.tar.gz\"\n          path: /tmp/nodewrapper-Linux_amd64/\n      - uses: actions/download-artifact@v2\n        with:\n          name: \"nodewrapper-${{ matrix.build-flavor }}-Linux_armv7.tar.gz\"\n          path: /tmp/nodewrapper-Linux_armv7/\n        if: matrix.build-flavor == 'tflite'\n      - uses: actions/download-artifact@v2\n        with:\n          name: \"nodewrapper-${{ matrix.build-flavor }}-Linux_aarch64.tar.gz\"\n          path: /tmp/nodewrapper-Linux_aarch64/\n        if: matrix.build-flavor == 'tflite'\n      - name: Extract nodewrapper archives\n        run: |\n          tar -C ${{ github.workspace }}/native_client/javascript -xzvf /tmp/nodewrapper-macOS_amd64/wrapper.tar.gz\n          tar -C ${{ github.workspace }}/native_client/javascript -xzvf /tmp/nodewrapper-Windows_amd64/wrapper.tar.gz\n          tar -C ${{ github.workspace }}/native_client/javascript -xzvf /tmp/nodewrapper-Linux_amd64/wrapper.tar.gz\n      - name: Extract nodewrapper tflite-only archives\n        run: |\n          tar -C ${{ github.workspace }}/native_client/javascript -xzvf /tmp/nodewrapper-Linux_armv7/wrapper.tar.gz\n          tar -C ${{ github.workspace }}/native_client/javascript -xzvf /tmp/nodewrapper-Linux_aarch64/wrapper.tar.gz\n        if: matrix.build-flavor == 'tflite'\n      - run: |\n          PROJECT_NAME=\"deepspeech\"\n          if [ \"${{ matrix.build-flavor }}\" = \"tflite\" ]; then\n            PROJECT_NAME=\"deepspeech-tflite\"\n          fi\n          make -C native_client/javascript clean npm-pack PROJECT_NAME=$PROJECT_NAME\n      - uses: actions/upload-artifact@v2\n        with:\n          name: \"deepspeech-${{ matrix.build-flavor }}.tgz\"\n          path: ${{ github.workspace }}/native_client/javascript/deepspeech-*.tgz\n  test-nodejs_all-Linux:\n    name: \"Lin|Test MultiArchPlatform NodeJS bindings\"\n    runs-on: ubuntu-20.04\n    needs: [repackage-nodejs-allplatforms, train-test-model-Linux]\n    if: ${{ github.event_name == 'pull_request' }}\n    strategy:\n      matrix:\n        # https://nodejs.org/en/about/releases/\n        nodejs-version: [10, 16]\n        build-flavor: [\"tf\", \"tflite\"]\n        models: [\"test\", \"prod\"]\n        bitrate: [\"8k\", \"16k\"]\n    env:\n      CI_TMP_DIR: ${{ github.workspace }}/tmp/\n      DEEPSPEECH_PROD_MODEL: https://github.com/reuben/DeepSpeech/releases/download/v0.7.0-alpha.3/output_graph.pb\n      DEEPSPEECH_PROD_MODEL_MMAP: https://github.com/reuben/DeepSpeech/releases/download/v0.7.0-alpha.3/output_graph.pbmm\n      DEEPSPEECH_TEST_MODEL: ${{ github.workspace }}/tmp/output_graph.pb\n      EXPECTED_TENSORFLOW_VERSION: \"TensorFlow: v2.3.0-6-g23ad988\"\n    steps:\n      - uses: actions/checkout@v2\n        with:\n          fetch-depth: 1\n      - uses: actions/setup-node@v2\n        with:\n          node-version: ${{ matrix.nodejs-version }}\n      - run: |\n          sudo apt-get install -y --no-install-recommends sox\n      - uses: actions/download-artifact@v2\n        with:\n          name: \"deepspeech-${{ matrix.build-flavor }}.tgz\"\n          path: ${{ env.CI_TMP_DIR }}\n      - uses: actions/download-artifact@v2\n        with:\n          name: \"test-model.${{ matrix.build-flavor }}-${{ matrix.bitrate }}.zip\"\n          path: ${{ env.CI_TMP_DIR }}\n        if: matrix.models == 'test'\n      - uses: actions/cache@v2\n        id: node-modules-cache\n        with:\n          path: ~/.npm/\n          key: node-modules-${{ matrix.build-flavor }}-${{ runner.os }}-${{ env.CI_NODE_MODULES_NTH }}\n      - run: |\n          ls -hal ${{ env.CI_TMP_DIR }}/\n        if: matrix.models == 'test'\n      - name: Install deepspeech package\n        run: |\n          ls -hal ${{ env.CI_TMP_DIR }}/\n          npm install --verbose ${{ env.CI_TMP_DIR }}/deepspeech*.tgz\n      - run: |\n          ls -hal node_modules/deepspeech* node_modules/.bin/\n      - uses: ./.github/actions/run-tests\n        with:\n          runtime: \"node\"\n          build-flavor: ${{ matrix.build-flavor }}\n          bitrate: ${{ matrix.bitrate }}\n          model-kind: ${{ matrix.models }}\n  test-electronjs_all-Linux:\n    name: \"Lin|Test MultiArchPlatform ElectronJS bindings\"\n    runs-on: ubuntu-20.04\n    needs: [repackage-nodejs-allplatforms, train-test-model-Linux]\n    if: ${{ github.event_name == 'pull_request' }}\n    strategy:\n      matrix:\n        electronjs-version: [5.0.13, 12.0.0]\n        build-flavor: [\"tf\", \"tflite\"]\n        models: [\"test\", \"prod\"]\n        bitrate: [\"8k\", \"16k\"]\n    env:\n      CI_TMP_DIR: ${{ github.workspace }}/tmp/\n      DEEPSPEECH_PROD_MODEL: https://github.com/reuben/DeepSpeech/releases/download/v0.7.0-alpha.3/output_graph.pb\n      DEEPSPEECH_PROD_MODEL_MMAP: https://github.com/reuben/DeepSpeech/releases/download/v0.7.0-alpha.3/output_graph.pbmm\n      DEEPSPEECH_TEST_MODEL: ${{ github.workspace }}/tmp/output_graph.pb\n      EXPECTED_TENSORFLOW_VERSION: \"TensorFlow: v2.3.0-6-g23ad988\"\n    steps:\n      - uses: actions/checkout@v2\n        with:\n          fetch-depth: 1\n      - uses: actions/setup-node@v2\n        with:\n          node-version: 12\n      - run: |\n          sudo apt-get install -y --no-install-recommends sox\n      - uses: actions/download-artifact@v2\n        with:\n          name: \"deepspeech-${{ matrix.build-flavor }}.tgz\"\n          path: ${{ env.CI_TMP_DIR }}\n      - uses: actions/download-artifact@v2\n        with:\n          name: \"test-model.${{ matrix.build-flavor }}-${{ matrix.bitrate }}.zip\"\n          path: ${{ env.CI_TMP_DIR }}\n        if: matrix.models == 'test'\n      - run: |\n          ls -hal ${{ env.CI_TMP_DIR }}/\n        if: matrix.models == 'test'\n      - uses: actions/cache@v2\n        id: electron-modules-cache\n        with:\n          path: ~/.npm/\n          key: electron-modules-${{ matrix.build-flavor }}-${{ runner.os }}-${{ env.CI_NODE_MODULES_NTH }}\n      - name: Install deepspeech package\n        run: |\n          ls -hal ${{ env.CI_TMP_DIR }}/\n          npm install ${{ env.CI_TMP_DIR }}/deepspeech*.tgz\n      - run: |\n          npm install electron@${{ matrix.electronjs-version }}\n      - uses: ./.github/actions/run-tests\n        with:\n          runtime: \"electronjs\"\n          build-flavor: ${{ matrix.build-flavor }}\n          bitrate: ${{ matrix.bitrate }}\n          model-kind: ${{ matrix.models }}\n        timeout-minutes: 5\n  test-nodejs_all-macOS:\n    name: \"Mac|Test MultiArchPlatform NodeJS bindings\"\n    runs-on: macos-10.15\n    needs: [ repackage-nodejs-allplatforms, train-test-model-macOS ]\n    if: ${{ github.event_name == 'pull_request' }}\n    strategy:\n      matrix:\n        # https://nodejs.org/en/about/releases/\n        nodejs-version: [10, 16]\n        build-flavor: [\"tf\", \"tflite\"]\n        models: [\"test\", \"prod\"]\n        bitrate: [\"8k\", \"16k\"]\n    env:\n      CI_TMP_DIR: ${{ github.workspace }}/tmp/\n      DEEPSPEECH_PROD_MODEL: https://github.com/reuben/DeepSpeech/releases/download/v0.7.0-alpha.3/output_graph.pb\n      DEEPSPEECH_PROD_MODEL_MMAP: https://github.com/reuben/DeepSpeech/releases/download/v0.7.0-alpha.3/output_graph.pbmm\n      DEEPSPEECH_TEST_MODEL: ${{ github.workspace }}/tmp/output_graph.pb\n      EXPECTED_TENSORFLOW_VERSION: \"TensorFlow: v2.3.0-6-g23ad988\"\n    steps:\n      - uses: actions/checkout@v2\n        with:\n          fetch-depth: 1\n      - uses: actions/setup-node@v2\n        with:\n          node-version: ${{ matrix.nodejs-version }}\n      - uses: actions/download-artifact@v2\n        with:\n          name: \"deepspeech-${{ matrix.build-flavor }}.tgz\"\n          path: ${{ env.CI_TMP_DIR }}\n      - uses: actions/download-artifact@v2\n        with:\n          name: \"test-model.${{ matrix.build-flavor }}-${{ matrix.bitrate }}.zip\"\n          path: ${{ env.CI_TMP_DIR }}\n        if: matrix.models == 'test'\n      - uses: actions/cache@v2\n        id: node-modules-cache\n        with:\n          path: ~/.npm/\n          key: node-modules-${{ matrix.build-flavor }}-${{ runner.os }}-${{ env.CI_NODE_MODULES_NTH }}\n      - run: |\n          ls -hal ${{ env.CI_TMP_DIR }}/\n        if: matrix.models == 'test'\n      - name: Install deepspeech package\n        run: |\n          ls -hal ${{ env.CI_TMP_DIR }}/\n          npm install --verbose ${{ env.CI_TMP_DIR }}/deepspeech*.tgz\n      - run: |\n          ls -hal node_modules/deepspeech* node_modules/.bin/\n      - uses: ./.github/actions/run-tests\n        with:\n          runtime: \"node\"\n          build-flavor: ${{ matrix.build-flavor }}\n          bitrate: ${{ matrix.bitrate }}\n          model-kind: ${{ matrix.models }}\n  test-electronjs_all-macOS:\n    name: \"Mac|Test MultiArchPlatform ElectronJS bindings\"\n    runs-on: macos-10.15\n    needs: [ repackage-nodejs-allplatforms, train-test-model-macOS ]\n    if: ${{ github.event_name == 'pull_request' }}\n    strategy:\n      matrix:\n        electronjs-version: [5.0.13, 12.0.0]\n        build-flavor: [\"tf\", \"tflite\"]\n        models: [\"test\", \"prod\"]\n        bitrate: [\"8k\", \"16k\"]\n    env:\n      CI_TMP_DIR: ${{ github.workspace }}/tmp/\n      DEEPSPEECH_PROD_MODEL: https://github.com/reuben/DeepSpeech/releases/download/v0.7.0-alpha.3/output_graph.pb\n      DEEPSPEECH_PROD_MODEL_MMAP: https://github.com/reuben/DeepSpeech/releases/download/v0.7.0-alpha.3/output_graph.pbmm\n      DEEPSPEECH_TEST_MODEL: ${{ github.workspace }}/tmp/output_graph.pb\n      EXPECTED_TENSORFLOW_VERSION: \"TensorFlow: v2.3.0-6-g23ad988\"\n    steps:\n      - uses: actions/checkout@v2\n        with:\n          fetch-depth: 1\n      - uses: actions/setup-node@v2\n        with:\n          node-version: 12\n      - uses: actions/download-artifact@v2\n        with:\n          name: \"deepspeech-${{ matrix.build-flavor }}.tgz\"\n          path: ${{ env.CI_TMP_DIR }}\n      - uses: actions/download-artifact@v2\n        with:\n          name: \"test-model.${{ matrix.build-flavor }}-${{ matrix.bitrate }}.zip\"\n          path: ${{ env.CI_TMP_DIR }}\n        if: matrix.models == 'test'\n      - run: |\n          ls -hal ${{ env.CI_TMP_DIR }}/\n        if: matrix.models == 'test'\n      - uses: actions/cache@v2\n        id: electron-modules-cache\n        with:\n          path: ~/.npm/\n          key: electron-modules-${{ matrix.build-flavor }}-${{ runner.os }}-${{ env.CI_NODE_MODULES_NTH }}\n      - name: Install deepspeech package\n        run: |\n          ls -hal ${{ env.CI_TMP_DIR }}/\n          npm install ${{ env.CI_TMP_DIR }}/deepspeech*.tgz\n      - run: |\n          npm install electron@${{ matrix.electronjs-version }}\n      - uses: ./.github/actions/run-tests\n        with:\n          runtime: \"electronjs\"\n          build-flavor: ${{ matrix.build-flavor }}\n          bitrate: ${{ matrix.bitrate }}\n          model-kind: ${{ matrix.models }}\n        timeout-minutes: 5\n  test-nodejs_all-Windows:\n    name: \"Win|Test MultiArchPlatform NodeJS bindings\"\n    runs-on: windows-2019\n    needs: [repackage-nodejs-allplatforms, train-test-model-Linux]\n    if: ${{ github.event_name == 'pull_request' }}\n    strategy:\n      matrix:\n        # https://nodejs.org/en/about/releases/\n        nodejs-version: [10, 16]\n        build-flavor: [\"tf\", \"tflite\"]\n        models: [\"test\", \"prod\"]\n        bitrate: [\"8k\", \"16k\"]\n    env:\n      CI_TMP_DIR: tmp/\n      DEEPSPEECH_PROD_MODEL: https://github.com/reuben/DeepSpeech/releases/download/v0.7.0-alpha.3/output_graph.pb\n      DEEPSPEECH_PROD_MODEL_MMAP: https://github.com/reuben/DeepSpeech/releases/download/v0.7.0-alpha.3/output_graph.pbmm\n      DEEPSPEECH_TEST_MODEL: tmp/output_graph.pb\n      EXPECTED_TENSORFLOW_VERSION: \"TensorFlow: v2.3.0-6-g23ad988\"\n    steps:\n      - name: Switch git-bash shell to MSYS2 shell by adding MSYS2 path to PATH front\n        run: echo \"$MSYS2_SHELL_PATH\" >> $GITHUB_PATH\n      - uses: mozilla/setup-msys2@v2\n        with:\n          msystem: MSYS\n          path-type: inherit\n          update: true\n          install: >-\n            vim\n      - uses: actions/checkout@v2\n        with:\n          fetch-depth: 1\n      - uses: actions/setup-node@v2\n        with:\n          node-version: ${{ matrix.nodejs-version }}\n      - uses: ./.github/actions/win-install-sox\n      - uses: actions/download-artifact@v2\n        with:\n          name: \"deepspeech-${{ matrix.build-flavor }}.tgz\"\n          path: ${{ env.CI_TMP_DIR }}\n      - uses: actions/download-artifact@v2\n        with:\n          name: \"test-model.${{ matrix.build-flavor }}-${{ matrix.bitrate }}.zip\"\n          path: ${{ env.CI_TMP_DIR }}\n        if: matrix.models == 'test'\n      - name: Get npm cache directory\n        id: npm-cache-dir\n        run: |\n          echo \"::set-output name=dir::$(npm config get cache)\"\n      - uses: actions/cache@v2\n        id: node-modules-cache\n        with:\n          path: ${{ steps.npm-cache-dir.outputs.dir }}\n          key: node-modules-${{ matrix.build-flavor }}-${{ runner.os }}-${{ env.CI_NODE_MODULES_NTH }}\n      - run: |\n          ls -hal ${{ env.CI_TMP_DIR }}/\n        if: matrix.models == 'test'\n      - name: Install deepspeech package\n        run: |\n          ls -hal ${{ env.CI_TMP_DIR }}/\n          npm install ${{ env.CI_TMP_DIR }}/deepspeech*.tgz\n      - uses: ./.github/actions/run-tests\n        with:\n          runtime: \"node\"\n          build-flavor: ${{ matrix.build-flavor }}\n          bitrate: ${{ matrix.bitrate }}\n          model-kind: ${{ matrix.models }}\n  test-electronjs_all-Windows:\n    name: \"Win|Test MultiArchPlatform ElectronJS bindings\"\n    runs-on: windows-2019\n    needs: [repackage-nodejs-allplatforms, train-test-model-Linux]\n    if: ${{ github.event_name == 'pull_request' }}\n    strategy:\n      matrix:\n        electronjs-version: [5.0.13, 12.0.0]\n        build-flavor: [\"tf\", \"tflite\"]\n        models: [\"test\", \"prod\"]\n        bitrate: [\"8k\", \"16k\"]\n    env:\n      CI_TMP_DIR: tmp/\n      DEEPSPEECH_PROD_MODEL: https://github.com/reuben/DeepSpeech/releases/download/v0.7.0-alpha.3/output_graph.pb\n      DEEPSPEECH_PROD_MODEL_MMAP: https://github.com/reuben/DeepSpeech/releases/download/v0.7.0-alpha.3/output_graph.pbmm\n      DEEPSPEECH_TEST_MODEL: tmp/output_graph.pb\n      EXPECTED_TENSORFLOW_VERSION: \"TensorFlow: v2.3.0-6-g23ad988\"\n    steps:\n      - name: Switch git-bash shell to MSYS2 shell by adding MSYS2 path to PATH front\n        run: echo \"$MSYS2_SHELL_PATH\" >> $GITHUB_PATH\n      - uses: mozilla/setup-msys2@v2\n        with:\n          msystem: MSYS\n          path-type: inherit\n          update: true\n          install: >-\n            vim\n      - uses: actions/checkout@v2\n        with:\n          fetch-depth: 1\n      - uses: actions/setup-node@v2\n        with:\n          node-version: 12\n      - uses: ./.github/actions/win-install-sox\n      - uses: actions/download-artifact@v2\n        with:\n          name: \"deepspeech-${{ matrix.build-flavor }}.tgz\"\n          path: ${{ env.CI_TMP_DIR }}\n      - uses: actions/download-artifact@v2\n        with:\n          name: \"test-model.${{ matrix.build-flavor }}-${{ matrix.bitrate }}.zip\"\n          path: ${{ env.CI_TMP_DIR }}\n        if: matrix.models == 'test'\n      - run: |\n          ls -hal ${{ env.CI_TMP_DIR }}/\n        if: matrix.models == 'test'\n      - name: Get npm cache directory\n        id: npm-cache-dir\n        run: |\n          echo \"::set-output name=dir::$(npm config get cache)\"\n      - uses: actions/cache@v2\n        id: electron-modules-cache\n        with:\n          path: ${{ steps.npm-cache-dir.outputs.dir }}\n          key: electron-modules-${{ matrix.build-flavor }}-${{ runner.os }}-${{ env.CI_NODE_MODULES_NTH }}\n      - name: Install deepspeech package\n        run: |\n          ls -hal ${{ env.CI_TMP_DIR }}/\n          npm install ${{ env.CI_TMP_DIR }}/deepspeech*.tgz\n      - run: |\n          npm install electron@${{ matrix.electronjs-version }}\n      - uses: ./.github/actions/run-tests\n        with:\n          runtime: \"electronjs\"\n          build-flavor: ${{ matrix.build-flavor }}\n          bitrate: ${{ matrix.bitrate }}\n          model-kind: ${{ matrix.models }}\n        timeout-minutes: 5\n  # Linux Armv7 and Aarch64 jobs\n  tensorflow_opt-LinuxArmv7:\n    name: \"LinArmv7|Check TensorFlow cache\"\n    runs-on: ubuntu-20.04\n    outputs:\n      status: ${{ steps.check_artifact_exists.outputs.status }}\n      cache_key: ${{ steps.get_cache_key.outputs.key }}\n    strategy:\n      matrix:\n        arch: [ \"armv7\" ]\n    steps:\n      - uses: actions/checkout@v2\n        with:\n          fetch-depth: 1\n      - id: get_cache_key\n        uses: ./.github/actions/get_cache_key\n        with:\n          extras: \"0\"\n      - id: check_artifact_exists\n        uses: ./.github/actions/check_artifact_exists\n        with:\n          name: ${{ steps.get_cache_key.outputs.key }}\n  tensorflow_opt-LinuxAarch64:\n    name: \"LinAarch64|Check TensorFlow cache\"\n    runs-on: ubuntu-20.04\n    outputs:\n      status: ${{ steps.check_artifact_exists.outputs.status }}\n      cache_key: ${{ steps.get_cache_key.outputs.key }}\n    strategy:\n      matrix:\n        arch: [ \"aarch64\" ]\n    steps:\n      - uses: actions/checkout@v2\n        with:\n          fetch-depth: 1\n      - id: get_cache_key\n        uses: ./.github/actions/get_cache_key\n        with:\n          extras: \"0\"\n      - id: check_artifact_exists\n        uses: ./.github/actions/check_artifact_exists\n        with:\n          name: ${{ steps.get_cache_key.outputs.key }}\n  build-tensorflow-LinuxArmv7:\n    name: \"LinArmv7|Build TensorFlow (opt)\"\n    needs: tensorflow_opt-LinuxArmv7\n    runs-on: ubuntu-20.04\n    strategy:\n      matrix:\n        arch: [ \"armv7\" ]\n    steps:\n      - run: true\n        if: needs.tensorflow_opt-LinuxArmv7.outputs.status == 'found'\n      - uses: actions/checkout@v2\n        with:\n          fetch-depth: 0\n          submodules: 'recursive'\n        if: needs.tensorflow_opt-LinuxArmv7.outputs.status == 'missing'\n      - uses: ./.github/actions/setup-tensorflow\n        if: needs.tensorflow_opt-LinuxArmv7.outputs.status == 'missing'\n      - uses: ./.github/actions/build-tensorflow\n        with:\n          flavor: \"--linux-${{ matrix.arch }}\"\n        if: needs.tensorflow_opt-LinuxArmv7.outputs.status == 'missing'\n      - uses: ./.github/actions/package-tensorflow\n        if: needs.tensorflow_opt-LinuxArmv7.outputs.status == 'missing'\n      - uses: actions/upload-artifact@v2\n        with:\n          name: ${{ needs.tensorflow_opt-LinuxArmv7.outputs.cache_key }}\n          path: ${{ github.workspace }}/artifacts/home.tar.xz\n        if: needs.tensorflow_opt-LinuxArmv7.outputs.status == 'missing'\n  build-tensorflow-LinuxAarch64:\n    name: \"LinAarch64|Build TensorFlow (opt)\"\n    needs: tensorflow_opt-LinuxAarch64\n    runs-on: ubuntu-20.04\n    strategy:\n      matrix:\n        arch: [ \"aarch64\" ]\n    steps:\n      - run: true\n        if: needs.tensorflow_opt-LinuxAarch64.outputs.status == 'found'\n      - uses: actions/checkout@v2\n        with:\n          fetch-depth: 0\n          submodules: 'recursive'\n        if: needs.tensorflow_opt-LinuxAarch64.outputs.status == 'missing'\n      - uses: ./.github/actions/setup-tensorflow\n        if: needs.tensorflow_opt-LinuxAarch64.outputs.status == 'missing'\n      - uses: ./.github/actions/build-tensorflow\n        with:\n          flavor: \"--linux-${{ matrix.arch }}\"\n        if: needs.tensorflow_opt-LinuxAarch64.outputs.status == 'missing'\n      - uses: ./.github/actions/package-tensorflow\n        if: needs.tensorflow_opt-LinuxAarch64.outputs.status == 'missing'\n      - uses: actions/upload-artifact@v2\n        with:\n          name: ${{ needs.tensorflow_opt-LinuxAarch64.outputs.cache_key }}\n          path: ${{ github.workspace }}/artifacts/home.tar.xz\n        if: needs.tensorflow_opt-LinuxAarch64.outputs.status == 'missing'\n  build-lib_LinuxArmv7:\n    name: \"LinArmv7|Build libdeepspeech+client\"\n    runs-on: ubuntu-20.04\n    strategy:\n      matrix:\n        build-flavor: [\"tflite\"]\n        arch: [ \"armv7\" ]\n    needs: [ build-tensorflow-LinuxArmv7, tensorflow_opt-LinuxArmv7 ]\n    env:\n      SYSTEM_TARGET: rpi3\n      SYSTEM_RASPBIAN: ${{ github.workspace }}/multistrap-raspbian-buster\n    steps:\n      - uses: actions/checkout@v2\n        with:\n          fetch-depth: 0\n      - uses: actions/download-artifact@v2\n        with:\n          name: ${{ needs.tensorflow_opt-LinuxArmv7.outputs.cache_key }}\n          path: ${{ github.workspace }}/\n        if: needs.tensorflow_opt-LinuxArmv7.outputs.status == 'missing'\n      - uses: ./.github/actions/check_artifact_exists\n        with:\n          name: ${{ needs.tensorflow_opt-LinuxArmv7.outputs.cache_key }}\n          path: ${{ github.workspace }}/\n          download: true\n        if: needs.tensorflow_opt-LinuxArmv7.outputs.status == 'found'\n      - run: |\n          tar -xf ${{ github.workspace }}/home.tar.xz --skip-old-files\n          rm ${{ github.workspace }}/home.tar.xz\n      - run: |\n          git status\n      - name: \"Install chroot\"\n        uses: ./.github/actions/multistrap\n        with:\n          arch: ${{ matrix.arch }}\n      - uses: ./.github/actions/host-build\n        with:\n          arch: ${{ matrix.arch }}\n          flavor: ${{ matrix.build-flavor }}\n      - uses: ./.github/actions/package\n      - uses: actions/upload-artifact@v2\n        with:\n          name: \"native_client.${{ matrix.build-flavor }}.linux.${{ matrix.arch }}.tar.xz\"\n          path: ${{ github.workspace }}/artifacts/native_client.tar.xz\n      - uses: actions/upload-artifact@v2\n        with:\n          name: \"libdeepspeech.${{ matrix.build-flavor }}.linux.${{ matrix.arch }}.zip\"\n          path: ${{ github.workspace }}/artifacts/libdeepspeech.zip\n  build-lib_LinuxAarch64:\n    name: \"LinAarch64|Build libdeepspeech+client\"\n    runs-on: ubuntu-20.04\n    strategy:\n      matrix: \n        build-flavor: [\"tflite\"]\n        arch: [ \"aarch64\" ]\n    needs: [ build-tensorflow-LinuxAarch64, tensorflow_opt-LinuxAarch64 ]\n    env:\n      SYSTEM_TARGET: rpi3-armv8\n      SYSTEM_RASPBIAN: ${{ github.workspace }}/multistrap-armbian64-buster\n    steps:\n      - uses: actions/checkout@v2\n        with:\n          fetch-depth: 0\n      - uses: actions/download-artifact@v2\n        with:\n          name: ${{ needs.tensorflow_opt-LinuxAarch64.outputs.cache_key }}\n          path: ${{ github.workspace }}/\n        if: needs.tensorflow_opt-LinuxAarch64.outputs.status == 'missing'\n      - uses: ./.github/actions/check_artifact_exists\n        with:\n          name: ${{ needs.tensorflow_opt-LinuxAarch64.outputs.cache_key }}\n          path: ${{ github.workspace }}/\n          download: true\n        if: needs.tensorflow_opt-LinuxAarch64.outputs.status == 'found'\n      - run: |\n          tar -xf ${{ github.workspace }}/home.tar.xz --skip-old-files\n          rm ${{ github.workspace }}/home.tar.xz\n      - run: |\n          git status\n      - name: \"Install chroot\"\n        uses: ./.github/actions/multistrap\n        with:\n          arch: ${{ matrix.arch }}\n      - uses: ./.github/actions/host-build\n        with:\n          arch: ${{ matrix.arch }}\n          flavor: ${{ matrix.build-flavor }}\n      - uses: ./.github/actions/package\n      - uses: actions/upload-artifact@v2\n        with:\n          name: \"native_client.${{ matrix.build-flavor }}.linux.${{ matrix.arch }}.tar.xz\"\n          path: ${{ github.workspace }}/artifacts/native_client.tar.xz\n      - uses: actions/upload-artifact@v2\n        with:\n          name: \"libdeepspeech.${{ matrix.build-flavor }}.linux.${{ matrix.arch }}.zip\"\n          path: ${{ github.workspace }}/artifacts/libdeepspeech.zip\n  build-python-LinuxArmv7:\n    name: \"LinArmv7|Build python bindings\"\n    runs-on: ubuntu-20.04\n    needs: [ build-lib_LinuxArmv7, swig_Linux, tensorflow_opt-LinuxArmv7 ]\n    strategy:\n      matrix:\n        build-flavor: [\"tflite\"]\n        python-version: [3.7]\n        arch: [ \"armv7\" ]\n    env:\n      DEBIAN_FRONTEND: \"noninteractive\"\n      SYSTEM_TARGET: rpi3\n      SYSTEM_RASPBIAN: ${{ github.workspace }}/multistrap-raspbian-buster\n    steps:\n      - uses: actions/checkout@v2\n        with:\n          fetch-depth: 1\n      - uses: actions/download-artifact@v2\n        with:\n          name: \"native_client.${{ matrix.build-flavor }}.linux.${{ matrix.arch }}.tar.xz\"\n          path: ${{ github.workspace }}/tensorflow/bazel-bin/native_client/\n      - run: |\n          cd ${{ github.workspace }}/tensorflow/bazel-bin/native_client/\n          tar xf native_client.tar.xz\n          ls -hal\n          cd ${{ github.workspace }}/\n      - uses: actions/download-artifact@v2\n        with:\n          name: \"swig_Linux\"\n          path: ${{ github.workspace }}/native_client/ds-swig/\n      - name: Link ds-swig into swig\n        run: |\n          ls -hal ${{ github.workspace }}/native_client/ds-swig/bin\n          ln -s ds-swig ${{ github.workspace }}/native_client/ds-swig/bin/swig\n          chmod +x ${{ github.workspace }}/native_client/ds-swig/bin/ds-swig ${{ github.workspace }}/native_client/ds-swig/bin/swig\n      - uses: actions/download-artifact@v2\n        with:\n          name: ${{ needs.tensorflow_opt-LinuxArmv7.outputs.cache_key }}\n          path: ${{ github.workspace }}/\n        if: needs.tensorflow_opt-LinuxArmv7.outputs.status == 'missing'\n      - uses: ./.github/actions/check_artifact_exists\n        with:\n          name: ${{ needs.tensorflow_opt-LinuxArmv7.outputs.cache_key }}\n          path: ${{ github.workspace }}/\n          download: true\n        if: needs.tensorflow_opt-LinuxArmv7.outputs.status == 'found'\n      - run: |\n          tar -xf ${{ github.workspace }}/home.tar.xz --skip-old-files\n          rm ${{ github.workspace }}/home.tar.xz\n      - uses: actions/setup-python@v2\n        with:\n          python-version: ${{ matrix.python-version }}\n      - uses: ./.github/actions/install-xldd\n        with:\n          target: ${{ env.SYSTEM_TARGET }}\n      - name: \"Install chroot\"\n        uses: ./.github/actions/multistrap\n        with:\n          arch: ${{ matrix.arch }}\n      - id: get_numpy\n        uses: ./.github/actions/numpy_vers\n        with:\n          pyver: ${{ matrix.python-version }}\n      - uses: ./.github/actions/python-build\n        with:\n          build_flavor: ${{ matrix.build-flavor }}\n          numpy_build: \"${{ steps.get_numpy.outputs.build_version }}\"\n          numpy_dep: \"${{ steps.get_numpy.outputs.dep_version }}\"\n          target: ${{ env.SYSTEM_TARGET }}\n          chroot: ${{ env.SYSTEM_RASPBIAN }}\n      - uses: actions/upload-artifact@v2\n        with:\n          name: \"deepspeech-${{ matrix.build-flavor }}-${{ matrix.python-version }}-${{ matrix.arch }}.whl\"\n          path: ${{ github.workspace }}/wheels/*.whl\n  build-nodejs-LinuxArmv7:\n    name: \"LinArmv7|Build NodeJS and ElectronJS\"\n    runs-on: ubuntu-20.04\n    needs: [ build-lib_LinuxArmv7, swig_Linux, tensorflow_opt-LinuxArmv7 ]\n    strategy:\n      matrix:\n        build-flavor: [\"tflite\"]\n        arch: [ \"armv7\" ]\n    env:\n      SYSTEM_TARGET: rpi3\n      SYSTEM_RASPBIAN: ${{ github.workspace }}/multistrap-raspbian-buster\n    steps:\n      - uses: actions/checkout@v2\n        with:\n          fetch-depth: 1\n      - uses: actions/download-artifact@v2\n        with:\n          name: \"native_client.${{ matrix.build-flavor }}.linux.${{ matrix.arch }}.tar.xz\"\n          path: ${{ github.workspace }}/tensorflow/bazel-bin/native_client/\n      - run: |\n          cd ${{ github.workspace }}/tensorflow/bazel-bin/native_client/\n          tar xf native_client.tar.xz\n          ls -hal\n          cd ${{ github.workspace }}/\n      - uses: actions/download-artifact@v2\n        with:\n          name: \"swig_Linux\"\n          path: ${{ github.workspace }}/native_client/ds-swig/\n      - name: Link ds-swig into swig\n        run: |\n          ls -hal ${{ github.workspace }}/native_client/ds-swig/bin\n          ln -s ds-swig ${{ github.workspace }}/native_client/ds-swig/bin/swig\n          chmod +x ${{ github.workspace }}/native_client/ds-swig/bin/ds-swig ${{ github.workspace }}/native_client/ds-swig/bin/swig\n      - uses: actions/download-artifact@v2\n        with:\n          name: ${{ needs.tensorflow_opt-LinuxArmv7.outputs.cache_key }}\n          path: ${{ github.workspace }}/\n        if: needs.tensorflow_opt-LinuxArmv7.outputs.status == 'missing'\n      - uses: ./.github/actions/check_artifact_exists\n        with:\n          name: ${{ needs.tensorflow_opt-LinuxArmv7.outputs.cache_key }}\n          path: ${{ github.workspace }}/\n          download: true\n        if: needs.tensorflow_opt-LinuxArmv7.outputs.status == 'found'\n      - run: |\n          tar -xf ${{ github.workspace }}/home.tar.xz --skip-old-files\n          rm ${{ github.workspace }}/home.tar.xz\n      - uses: ./.github/actions/install-xldd\n        with:\n          target: ${{ env.SYSTEM_TARGET }}\n      - name: \"Install chroot\"\n        uses: ./.github/actions/multistrap\n        with:\n          arch: ${{ matrix.arch }}\n      - uses: actions/setup-node@v2\n        with:\n          node-version: 12\n      - uses: actions/cache@v2\n        id: node-headers-cache\n        with:\n          path: native_client/javascript/headers/nodejs/\n          key: node-headers-10.0.0_15.0.0\n      - uses: actions/cache@v2\n        id: electron-headers-cache\n        with:\n          path: native_client/javascript/headers/electronjs/\n          key: electron-headers-5.0.13_12.0.0\n      - uses: ./.github/actions/node-build\n        with:\n          nodejs_versions: \"10.0.0 11.0.0 12.7.0 13.0.0 14.0.0 15.0.0\"\n          electronjs_versions: \"5.0.13 6.0.12 6.1.7 7.0.1 7.1.8 8.0.1 9.0.1 9.1.0 9.2.0 10.0.0 10.1.0 11.0.0 12.0.0\"\n          target: ${{ env.SYSTEM_TARGET }}\n          chroot: ${{ env.SYSTEM_RASPBIAN }}\n      - uses: actions/upload-artifact@v2\n        with:\n          name: \"nodewrapper-${{ matrix.build-flavor }}-Linux_${{ matrix.arch }}.tar.gz\"\n          path: ${{ github.workspace }}/native_client/javascript/wrapper.tar.gz\n      - uses: actions/upload-artifact@v2\n        with:\n          name: \"deepspeech_intermediate-${{ matrix.build-flavor }}-${{ matrix.arch }}.tgz\"\n          path: ${{ github.workspace }}/native_client/javascript/deepspeech-*.tgz\n  build-python-LinuxAarch64:\n    name: \"LinAarch64|Build python bindings\"\n    runs-on: ubuntu-20.04\n    needs: [ build-lib_LinuxAarch64, swig_Linux, tensorflow_opt-LinuxAarch64 ]\n    strategy:\n      matrix:\n        build-flavor: [\"tflite\"]\n        python-version: [3.7]\n        arch: [ \"aarch64\" ]\n    env:\n      DEBIAN_FRONTEND: \"noninteractive\"\n      SYSTEM_TARGET: rpi3-armv8\n      SYSTEM_RASPBIAN: ${{ github.workspace }}/multistrap-armbian64-buster\n    steps:\n      - run: |\n          sudo apt-get install -y --no-install-recommends\n      - uses: actions/checkout@v2\n        with:\n          fetch-depth: 1\n      - uses: actions/download-artifact@v2\n        with:\n          name: \"native_client.${{ matrix.build-flavor }}.linux.${{ matrix.arch }}.tar.xz\"\n          path: ${{ github.workspace }}/tensorflow/bazel-bin/native_client/\n      - run: |\n          cd ${{ github.workspace }}/tensorflow/bazel-bin/native_client/\n          tar xf native_client.tar.xz\n          ls -hal\n          cd ${{ github.workspace }}/\n      - uses: actions/download-artifact@v2\n        with:\n          name: \"swig_Linux\"\n          path: ${{ github.workspace }}/native_client/ds-swig/\n      - name: Link ds-swig into swig\n        run: |\n          ls -hal ${{ github.workspace }}/native_client/ds-swig/bin\n          ln -s ds-swig ${{ github.workspace }}/native_client/ds-swig/bin/swig\n          chmod +x ${{ github.workspace }}/native_client/ds-swig/bin/ds-swig ${{ github.workspace }}/native_client/ds-swig/bin/swig\n      - uses: actions/download-artifact@v2\n        with:\n          name: ${{ needs.tensorflow_opt-LinuxAarch64.outputs.cache_key }}\n          path: ${{ github.workspace }}/\n        if: needs.tensorflow_opt-LinuxAarch64.outputs.status == 'missing'\n      - uses: ./.github/actions/check_artifact_exists\n        with:\n          name: ${{ needs.tensorflow_opt-LinuxAarch64.outputs.cache_key }}\n          path: ${{ github.workspace }}/\n          download: true\n        if: needs.tensorflow_opt-LinuxAarch64.outputs.status == 'found'\n      - run: |\n          tar -xf ${{ github.workspace }}/home.tar.xz --skip-old-files\n          rm ${{ github.workspace }}/home.tar.xz\n      - uses: actions/setup-python@v2\n        with:\n          python-version: ${{ matrix.python-version }}\n      - uses: ./.github/actions/install-xldd\n        with:\n          target: ${{ env.SYSTEM_TARGET }}\n      - name: \"Install chroot\"\n        uses: ./.github/actions/multistrap\n        with:\n          arch: ${{ matrix.arch }}\n      - id: get_numpy\n        uses: ./.github/actions/numpy_vers\n        with:\n          pyver: ${{ matrix.python-version }}\n      - uses: ./.github/actions/python-build\n        with:\n          build_flavor: ${{ matrix.build-flavor }}\n          numpy_build: \"${{ steps.get_numpy.outputs.build_version }}\"\n          numpy_dep: \"${{ steps.get_numpy.outputs.dep_version }}\"\n          target: ${{ env.SYSTEM_TARGET }}\n          chroot: ${{ env.SYSTEM_RASPBIAN }}\n      - uses: actions/upload-artifact@v2\n        with:\n          name: \"deepspeech-${{ matrix.build-flavor }}-${{ matrix.python-version }}-${{ matrix.arch }}.whl\"\n          path: ${{ github.workspace }}/wheels/*.whl\n  build-nodejs-LinuxAarch64:\n    name: \"LinAarch64|Build NodeJS and ElectronJS\"\n    runs-on: ubuntu-20.04\n    needs: [ build-lib_LinuxAarch64, swig_Linux, tensorflow_opt-LinuxAarch64 ]\n    strategy:\n      matrix:\n        build-flavor: [\"tflite\"]\n        arch: [ \"aarch64\" ]\n    env:\n      SYSTEM_TARGET: rpi3-armv8\n      SYSTEM_RASPBIAN: ${{ github.workspace }}/multistrap-armbian64-buster\n    steps:\n      - uses: actions/checkout@v2\n        with:\n          fetch-depth: 1\n      - uses: actions/download-artifact@v2\n        with:\n          name: \"native_client.${{ matrix.build-flavor }}.linux.${{ matrix.arch }}.tar.xz\"\n          path: ${{ github.workspace }}/tensorflow/bazel-bin/native_client/\n      - run: |\n          cd ${{ github.workspace }}/tensorflow/bazel-bin/native_client/\n          tar xf native_client.tar.xz\n          ls -hal\n          cd ${{ github.workspace }}/\n      - uses: actions/download-artifact@v2\n        with:\n          name: \"swig_Linux\"\n          path: ${{ github.workspace }}/native_client/ds-swig/\n      - name: Link ds-swig into swig\n        run: |\n          ls -hal ${{ github.workspace }}/native_client/ds-swig/bin\n          ln -s ds-swig ${{ github.workspace }}/native_client/ds-swig/bin/swig\n          chmod +x ${{ github.workspace }}/native_client/ds-swig/bin/ds-swig ${{ github.workspace }}/native_client/ds-swig/bin/swig\n      - uses: actions/download-artifact@v2\n        with:\n          name: ${{ needs.tensorflow_opt-LinuxAarch64.outputs.cache_key }}\n          path: ${{ github.workspace }}/\n        if: needs.tensorflow_opt-LinuxAarch64.outputs.status == 'missing'\n      - uses: ./.github/actions/check_artifact_exists\n        with:\n          name: ${{ needs.tensorflow_opt-LinuxAarch64.outputs.cache_key }}\n          path: ${{ github.workspace }}/\n          download: true\n        if: needs.tensorflow_opt-LinuxAarch64.outputs.status == 'found'\n      - run: |\n          tar -xf ${{ github.workspace }}/home.tar.xz --skip-old-files\n          rm ${{ github.workspace }}/home.tar.xz\n      - uses: ./.github/actions/install-xldd\n        with:\n          target: ${{ env.SYSTEM_TARGET }}\n      - name: \"Install chroot\"\n        uses: ./.github/actions/multistrap\n        with:\n          arch: ${{ matrix.arch }}\n      - uses: actions/setup-node@v2\n        with:\n          node-version: 12\n      - uses: actions/cache@v2\n        id: node-headers-cache\n        with:\n          path: native_client/javascript/headers/nodejs/\n          key: node-headers-10.0.0_15.0.0\n      - uses: actions/cache@v2\n        id: electron-headers-cache\n        with:\n          path: native_client/javascript/headers/electronjs/\n          key: electron-headers-5.0.13_12.0.0\n      - uses: ./.github/actions/node-build\n        with:\n          nodejs_versions: \"10.0.0 11.0.0 12.7.0 13.0.0 14.0.0 15.0.0\"\n          electronjs_versions: \"5.0.13 6.0.12 6.1.7 7.0.1 7.1.8 8.0.1 9.0.1 9.1.0 9.2.0 10.0.0 10.1.0 11.0.0 12.0.0\"\n          target: ${{ env.SYSTEM_TARGET }}\n          chroot: ${{ env.SYSTEM_RASPBIAN }}\n      - uses: actions/upload-artifact@v2\n        with:\n          name: \"nodewrapper-${{ matrix.build-flavor }}-Linux_${{ matrix.arch }}.tar.gz\"\n          path: ${{ github.workspace }}/native_client/javascript/wrapper.tar.gz\n      - uses: actions/upload-artifact@v2\n        with:\n          name: \"deepspeech_intermediate-${{ matrix.build-flavor }}-${{ matrix.arch }}.tgz\"\n          path: ${{ github.workspace }}/native_client/javascript/deepspeech-*.tgz\n  build-test-chroot:\n    name: \"Lin|Build test chroot\"\n    runs-on: ubuntu-20.04\n    if: ${{ github.event_name == 'pull_request' }}\n    strategy:\n      matrix:\n        arch: [ \"armv7\", \"aarch64\" ]\n    env:\n      CI_TMP_DIR: ${{ github.workspace }}/tmp\n      DEBIAN_FRONTEND: \"noninteractive\"\n      SYSTEM_RASPBIAN: ${{ github.workspace }}/chroot-${{ matrix.arch }}\n    steps:\n      - uses: actions/checkout@v2\n        with:\n          fetch-depth: 1\n      - name: \"Install and setup chroot\"\n        uses: ./.github/actions/multistrap\n        with:\n          arch: ${{ matrix.arch }}\n          packages: \"bash wget curl sox xxd libatlas3-base libopenblas-base ca-certificates python3 python3-pip gnupg libatk1.0-0 libatk-bridge2.0-0 libcairo2 libcups2 libdbus-1-3 libgdk-pixbuf2.0-0 libgtk-3-0 libgbm1 libnspr4 libnss3 libpango-1.0-0 libpangocairo-1.0-0 libx11-xcb1 libxcb-dri3-0 libxcomposite1 libxcursor1 libxdamage1 libxfixes3 libxi6 libxrandr2 libxrender1 libxss1 libxtst6 xauth\"\n      - name: \"Create a chroot tarball\"\n        run: |\n          sudo tar -cf - -C ${{ env.SYSTEM_RASPBIAN }}/ --one-file-system . | xz -9 -T0 > ${{ github.workspace }}/chroot.tar.xz\n      - uses: actions/upload-artifact@v2\n        with:\n          name: chroot-${{ matrix.arch }}\n          path: ${{ github.workspace }}/chroot.tar.xz\n  test-cpp-LinuxArm:\n    name: \"LinArm*|Test C++ binary\"\n    runs-on: ubuntu-20.04\n    needs: [ build-lib_LinuxArmv7, build-lib_LinuxAarch64, train-test-model-Linux, build-test-chroot ]\n    if: ${{ github.event_name == 'pull_request' }}\n    strategy:\n      matrix:\n        arch: [ \"armv7\", \"aarch64\" ]\n        build-flavor: [\"tflite\"]\n        models: [\"test\", \"prod\"]\n        bitrate: [\"8k\", \"16k\"]\n    env:\n      CI_TMP_DIR: ${{ github.workspace }}/tmp\n      DEBIAN_FRONTEND: \"noninteractive\"\n      DEEPSPEECH_PROD_MODEL: https://github.com/reuben/DeepSpeech/releases/download/v0.7.0-alpha.3/output_graph.pb\n      DEEPSPEECH_PROD_MODEL_MMAP: https://github.com/reuben/DeepSpeech/releases/download/v0.7.0-alpha.3/output_graph.pbmm\n      DEEPSPEECH_TEST_MODEL: ${{ github.workspace }}/tmp/output_graph.pb\n      EXPECTED_TENSORFLOW_VERSION: \"TensorFlow: v2.3.0-6-g23ad988\"\n      SYSTEM_RASPBIAN: ${{ github.workspace }}/chroot-${{ matrix.arch }}\n    steps:\n      - name: \"Install QEMU\"\n        run: |\n          sudo apt-get update -y\n          sudo apt-get install -y --no-install-recommends qemu-user-static\n      - uses: actions/checkout@v2\n        with:\n          fetch-depth: 1\n      - uses: actions/download-artifact@v2\n        with:\n          name: \"chroot-${{ matrix.arch }}\"\n          path: ${{ env.CI_TMP_DIR }}/\n      - run: |\n          mkdir ${{ env.SYSTEM_RASPBIAN }}/\n          sudo tar -xf ${{ env.CI_TMP_DIR }}/chroot.tar.xz -C ${{ env.SYSTEM_RASPBIAN }}/\n          rm ${{ env.CI_TMP_DIR }}/chroot.tar.xz\n      - uses: actions/download-artifact@v2\n        with:\n          name: \"native_client.${{ matrix.build-flavor }}.linux.${{ matrix.arch }}.tar.xz\"\n          path: ${{ env.CI_TMP_DIR }}/\n      - run: |\n          cd ${{ env.CI_TMP_DIR }}/\n          mkdir ds && cd ds && tar xf ../native_client.tar.xz\n      - uses: actions/download-artifact@v2\n        with:\n          name: \"test-model.${{ matrix.build-flavor }}-${{ matrix.bitrate }}.zip\"\n          path: ${{ env.CI_TMP_DIR }}/\n        if: matrix.models == 'test'\n      - run: |\n          ls -hal ${{ env.CI_TMP_DIR }}/\n        if: matrix.models == 'test'\n      - name: \"Check tests\"\n        run: |\n          file ${{ env.SYSTEM_RASPBIAN }}/${{ env.CI_TMP_DIR }}/ds/*\n      - uses: ./.github/actions/chroot-bind-mount\n        with:\n          mounts: \"/dev\"\n      - uses: ./.github/actions/run-tests\n        with:\n          runtime: \"cpp\"\n          chroot: \"sudo --preserve-env chroot --userspec=runner:docker ${{ env.SYSTEM_RASPBIAN }}/ ${{ github.workspace }}\"\n          build-flavor: ${{ matrix.build-flavor }}\n          bitrate: ${{ matrix.bitrate }}\n          model-kind: ${{ matrix.models }}\n  test-py-LinuxArm:\n    name: \"LinArm*|Test Python bindings\"\n    runs-on: ubuntu-20.04\n    needs: [ build-python-LinuxArmv7, build-python-LinuxAarch64, train-test-model-Linux, build-test-chroot ]\n    if: ${{ github.event_name == 'pull_request' }}\n    strategy:\n      matrix:\n        arch: [ \"armv7\", \"aarch64\" ]\n        python-version: [3.7]\n        build-flavor: [\"tflite\"]\n        models: [\"test\", \"prod\"]\n        bitrate: [\"8k\", \"16k\"]\n    env:\n      CI_TMP_DIR: ${{ github.workspace }}/tmp\n      DEBIAN_FRONTEND: \"noninteractive\"\n      DEEPSPEECH_PROD_MODEL: https://github.com/reuben/DeepSpeech/releases/download/v0.7.0-alpha.3/output_graph.pb\n      DEEPSPEECH_PROD_MODEL_MMAP: https://github.com/reuben/DeepSpeech/releases/download/v0.7.0-alpha.3/output_graph.pbmm\n      DEEPSPEECH_TEST_MODEL: ${{ github.workspace }}/tmp/output_graph.pb\n      EXPECTED_TENSORFLOW_VERSION: \"TensorFlow: v2.3.0-6-g23ad988\"\n      SYSTEM_RASPBIAN: ${{ github.workspace }}/chroot-${{ matrix.arch }}\n      PIP_EXTRA_INDEX_URL: \"https://www.piwheels.org/simple https://lissyx.github.io/deepspeech-python-wheels/\"\n    steps:\n      - name: \"Install QEMU\"\n        run: |\n          sudo apt-get update -y\n          sudo apt-get install -y --no-install-recommends qemu-user-static\n      - uses: actions/checkout@v2\n        with:\n          fetch-depth: 1\n      - uses: actions/download-artifact@v2\n        with:\n          name: \"chroot-${{ matrix.arch }}\"\n          path: ${{ env.CI_TMP_DIR }}/\n      - run: |\n          mkdir ${{ env.SYSTEM_RASPBIAN }}/\n          sudo tar -xf ${{ env.CI_TMP_DIR }}/chroot.tar.xz -C ${{ env.SYSTEM_RASPBIAN }}/\n          rm ${{ env.CI_TMP_DIR }}/chroot.tar.xz\n      - uses: actions/download-artifact@v2\n        with:\n          name: \"deepspeech-${{ matrix.build-flavor }}-${{ matrix.python-version }}-${{ matrix.arch }}.whl\"\n          path: ${{ env.CI_TMP_DIR }}/\n      - uses: actions/download-artifact@v2\n        with:\n          name: \"test-model.${{ matrix.build-flavor }}-${{ matrix.bitrate }}.zip\"\n          path: ${{ env.CI_TMP_DIR }}/\n        if: matrix.models == 'test'\n      - run: |\n          ls -hal ${{ env.CI_TMP_DIR }}/\n        if: matrix.models == 'test'\n      - uses: ./.github/actions/chroot-bind-mount\n        with:\n          mounts: \"/dev\"\n      - run: |\n          ls -hal ${{ env.CI_TMP_DIR }}/\n          ls -hal ${{ github.workspace }}/\n          ls -hal ${{ env.SYSTEM_RASPBIAN }}/${{ github.workspace }}/\n          sudo --preserve-env chroot --userspec=runner:docker ${{ env.SYSTEM_RASPBIAN }}/ pip3 install --only-binary :all: --upgrade ${{ env.CI_TMP_DIR }}/deepspeech*.whl\n      - uses: ./.github/actions/run-tests\n        with:\n          runtime: \"python\"\n          chroot: \"sudo --preserve-env chroot --userspec=runner:docker ${{ env.SYSTEM_RASPBIAN }}/ ${{ github.workspace }}\"\n          build-flavor: ${{ matrix.build-flavor }}\n          bitrate: ${{ matrix.bitrate }}\n          model-kind: ${{ matrix.models }}\n  test-nodejs-LinuxArm:\n    name: \"LinArm*|Test NodeJS bindings\"\n    runs-on: ubuntu-20.04\n    needs: [ build-nodejs-LinuxArmv7, build-nodejs-LinuxAarch64, train-test-model-Linux, build-test-chroot ]\n    if: ${{ github.event_name == 'pull_request' }}\n    strategy:\n      matrix:\n        arch: [ \"armv7\", \"aarch64\" ]\n        # https://nodejs.org/en/about/releases/\n        nodejs-version: [10, 12, 14, 16]\n        build-flavor: [\"tflite\"]\n        models: [\"test\"]\n        bitrate: [\"16k\"]\n    env:\n      CI_TMP_DIR: ${{ github.workspace }}/tmp\n      DEBIAN_FRONTEND: \"noninteractive\"\n      DEEPSPEECH_PROD_MODEL: https://github.com/reuben/DeepSpeech/releases/download/v0.7.0-alpha.3/output_graph.pb\n      DEEPSPEECH_PROD_MODEL_MMAP: https://github.com/reuben/DeepSpeech/releases/download/v0.7.0-alpha.3/output_graph.pbmm\n      DEEPSPEECH_TEST_MODEL: ${{ github.workspace }}/tmp/output_graph.pb\n      EXPECTED_TENSORFLOW_VERSION: \"TensorFlow: v2.3.0-6-g23ad988\"\n      SYSTEM_RASPBIAN: ${{ github.workspace }}/chroot-${{ matrix.arch }}\n    steps:\n      - name: \"Install QEMU\"\n        run: |\n          sudo apt-get update -y\n          sudo apt-get install -y --no-install-recommends qemu-user-static\n      - uses: actions/checkout@v2\n        with:\n          fetch-depth: 1\n      - uses: actions/download-artifact@v2\n        with:\n          name: \"chroot-${{ matrix.arch }}\"\n          path: ${{ env.CI_TMP_DIR }}/\n      - run: |\n          mkdir ${{ env.SYSTEM_RASPBIAN }}/\n          sudo tar -xf ${{ env.CI_TMP_DIR }}/chroot.tar.xz -C ${{ env.SYSTEM_RASPBIAN }}/\n          rm ${{ env.CI_TMP_DIR }}/chroot.tar.xz\n      - name: \"Install NodeJS\"\n        uses: ./.github/actions/node-install\n        with:\n          node: ${{ matrix.nodejs-version }}\n      - uses: actions/download-artifact@v2\n        with:\n          name: \"deepspeech_intermediate-${{ matrix.build-flavor }}-${{ matrix.arch }}.tgz\"\n          path: ${{ env.CI_TMP_DIR }}/\n      - uses: actions/download-artifact@v2\n        with:\n          name: \"test-model.${{ matrix.build-flavor }}-${{ matrix.bitrate }}.zip\"\n          path: ${{ env.CI_TMP_DIR }}/\n        if: matrix.models == 'test'\n      - run: |\n          ls -hal ${{ env.CI_TMP_DIR }}/\n        if: matrix.models == 'test'\n      - uses: ./.github/actions/chroot-bind-mount\n        with:\n          mounts: \"/dev\"\n      - name: Install deepspeech package\n        run: |\n          sudo --preserve-env chroot --userspec=runner:docker ${{ env.SYSTEM_RASPBIAN }}/ npm install --prefix ${{ github.workspace }}/ --verbose ${{ env.CI_TMP_DIR }}/deepspeech*.tgz\n      - uses: ./.github/actions/run-tests\n        with:\n          runtime: \"node\"\n          chroot: \"sudo --preserve-env chroot --userspec=runner:docker ${{ env.SYSTEM_RASPBIAN }}/ ${{ github.workspace }}\"\n          build-flavor: ${{ matrix.build-flavor }}\n          bitrate: ${{ matrix.bitrate }}\n          model-kind: ${{ matrix.models }}\n  test-electronjs-LinuxArm:\n    name: \"LinArm*|Test ElectronJS bindings\"\n    runs-on: ubuntu-20.04\n    needs: [ build-nodejs-LinuxArmv7, build-nodejs-LinuxAarch64, train-test-model-Linux, build-test-chroot ]\n    # Disable this task because it seems qemu does not work super-well with ElectronJS\n    if: ${{ github.event_name == 'disabled' }}\n    strategy:\n      matrix:\n        arch: [ \"armv7\", \"aarch64\" ]\n        electronjs-version: [5.0.13, 6.1.7, 7.1.8, 8.0.1, 9.2.0, 10.1.0, 11.0.0, 12.0.0]\n        build-flavor: [\"tflite\"]\n        models: [\"test\"]\n        bitrate: [\"16k\"]\n    env:\n      CI_TMP_DIR: ${{ github.workspace }}/tmp\n      DEBIAN_FRONTEND: \"noninteractive\"\n      DEEPSPEECH_PROD_MODEL: https://github.com/reuben/DeepSpeech/releases/download/v0.7.0-alpha.3/output_graph.pb\n      DEEPSPEECH_PROD_MODEL_MMAP: https://github.com/reuben/DeepSpeech/releases/download/v0.7.0-alpha.3/output_graph.pbmm\n      DEEPSPEECH_TEST_MODEL: ${{ github.workspace }}/tmp/output_graph.pb\n      EXPECTED_TENSORFLOW_VERSION: \"TensorFlow: v2.3.0-6-g23ad988\"\n      SYSTEM_RASPBIAN: ${{ github.workspace }}/chroot-${{ matrix.arch }}\n      DISPLAY: \":99.0\"\n    steps:\n      - name: \"Install QEMU\"\n        run: |\n          sudo apt-get update -y\n          sudo apt-get install -y --no-install-recommends qemu-user-static xvfb xauth\n      - uses: actions/checkout@v2\n        with:\n          fetch-depth: 1\n      - uses: actions/download-artifact@v2\n        with:\n          name: \"chroot-${{ matrix.arch }}\"\n          path: ${{ env.CI_TMP_DIR }}/\n      - run: |\n          mkdir ${{ env.SYSTEM_RASPBIAN }}/\n          sudo tar -xf ${{ env.CI_TMP_DIR }}/chroot.tar.xz -C ${{ env.SYSTEM_RASPBIAN }}/\n          rm ${{ env.CI_TMP_DIR }}/chroot.tar.xz\n      - name: \"Install NodeJS\"\n        uses: ./.github/actions/node-install\n        with:\n          node: 12\n      - uses: actions/download-artifact@v2\n        with:\n          name: \"deepspeech_intermediate-${{ matrix.build-flavor }}-${{ matrix.arch }}.tgz\"\n          path: ${{ env.CI_TMP_DIR }}/\n      - uses: actions/download-artifact@v2\n        with:\n          name: \"test-model.${{ matrix.build-flavor }}-${{ matrix.bitrate }}.zip\"\n          path: ${{ env.CI_TMP_DIR }}/\n        if: matrix.models == 'test'\n      - run: |\n          ls -hal ${{ env.CI_TMP_DIR }}/\n        if: matrix.models == 'test'\n      - uses: ./.github/actions/chroot-bind-mount\n        with:\n          mounts: \"/dev /proc /sys /run\"\n      - name: Install deepspeech package\n        run: |\n          sudo --preserve-env chroot --userspec=runner:docker ${{ env.SYSTEM_RASPBIAN }}/ npm install --prefix ${{ github.workspace }}/ ${{ env.CI_TMP_DIR }}/deepspeech*.tgz\n      - run: |\n          sudo --preserve-env chroot --userspec=runner:docker ${{ env.SYSTEM_RASPBIAN }}/ npm install --prefix ${{ github.workspace }}/ electron@${{ matrix.electronjs-version }}\n      - name: \"Fake X display\"\n        run: |\n          sudo Xvfb :99 -screen 0 1024x768x24 > /dev/null 2>&1 &\n          xvfb_process=$!\n          echo $xvfb_process > ${{ env.CI_TMP_DIR }}/xvfb.pid\n          cat ${{ env.CI_TMP_DIR }}/xvfb.pid\n      - name: \"Debug missing libs\"\n        run: |\n          sudo --preserve-env chroot --userspec=runner:docker ${{ env.SYSTEM_RASPBIAN }}/ ls -hal ${{ github.workspace }}/node_modules/electron/dist/electron\n          sudo --preserve-env chroot --userspec=runner:docker ${{ env.SYSTEM_RASPBIAN }}/ ldd ${{ github.workspace }}/node_modules/electron/dist/electron\n      - uses: ./.github/actions/run-tests\n        with:\n          runtime: \"electronjs\"\n          chroot: \"sudo --preserve-env chroot --userspec=runner:docker ${{ env.SYSTEM_RASPBIAN }}/ ${{ github.workspace }}\"\n          build-flavor: ${{ matrix.build-flavor }}\n          bitrate: ${{ matrix.bitrate }}\n          model-kind: ${{ matrix.models }}\n        timeout-minutes: 5\n      - name: \"Kill X\"\n        run: |\n          cat ${{ env.CI_TMP_DIR }}/xvfb.pid\n          sudo kill -9 $(cat ${{ env.CI_TMP_DIR }}/xvfb.pid)\n"
  },
  {
    "path": ".github/workflows/docker.yml",
    "content": "name: \"Docker Images\"\non:\n  pull_request:\n  push:\n    branches:\n      - master\njobs:\n  make-docker-img:\n    name: \"Build Dockerfile\"\n    runs-on: ubuntu-20.04\n    strategy:\n      matrix:\n        template: [\"build\", \"train\"]\n    steps:\n      - uses: actions/checkout@v2\n        with:\n          fetch-depth: 1\n      - run: |\n          make Dockerfile.${{ matrix.template }} \\\n            DEEPSPEECH_REPO=https://github.com/${{ github.repository }} \\\n            DEEPSPEECH_SHA=${{ github.sha }}\n      - run: |\n          mkdir /tmp/empty\n      - run: |\n          cd /tmp/empty; docker build -t app:${{ matrix.template }} -f ${{ github.workspace }}/Dockerfile.${{ matrix.template }} .\n      - run: |\n          docker save app:${{ matrix.template}} | zstd -o app_${{ matrix.template }}.zstd\n"
  },
  {
    "path": ".github/workflows/lint.yml",
    "content": "name: \"Python linter\"\non:\n  pull_request:\njobs:\n  lint:\n    name: \"Running cardboardlinter\"\n    runs-on: ubuntu-20.04\n    container:\n      image: python:3.9.4-slim-buster\n    steps:\n      # https://github.com/actions/checkout/issues/175#issuecomment-595410280\n      - run: |\n          apt-get -qq -y update\n          apt-get -qq -y install git\n      - uses: actions/checkout@v2\n        with:\n          fetch-depth: 0\n      - run: |\n          pip install --upgrade cardboardlint pylint\n      - run: |\n          set -ex\n          # Check if branch can be merged with master (if failing script will stop due to set -e)\n          git config user.email \"you@example.com\"\n          git config user.name \"Your Name\"\n          git merge --no-commit --no-ff origin/${{ github.base_ref }}\n      - run: |\n          set -ex\n          # Undo merge changes if any\n          git reset --hard ${{ github.sha }}\n      - run: |\n          set -ex\n          # Lint differences against master\n          cardboardlinter --refspec origin/${{ github.base_ref }} -n auto;\n"
  },
  {
    "path": ".gitignore",
    "content": ".ipynb_checkpoints\n*.pyc\n*.swp\n*.DS_Store\n*.egg-info\n.pit*\n/.run\n/werlog.js\n/runs\n/logs\n/exports\n/data/ldc93s1\n/native_client/setup.cfg\n/native_client/build\n/native_client/*.egg-info\n/native_client/dist\n/native_client/deepspeech\n/native_client/ds-swig\n/native_client/libdeepspeech.so\n/native_client/node_modules\n/native_client/javascript/build\n/native_client/javascript/lib\n/native_client/javascript/package.json\n/native_client/javascript/package-lock.json\n/native_client/javascript/client.js\n/native_client/javascript/deepspeech_wrap.cxx\n/native_client/javascript/node_modules\n/native_client/python/MANIFEST.in\n/native_client/python/dist\n/native_client/python/impl.py\n/native_client/python/impl_wrap.cpp\n/doc/.build/\n/doc/xml-c/\n/doc/xml-java/\nDockerfile.build\nDockerfile.train\ndoc/xml-c\ndoc/xml-java\ndoc/xml-dotnet\nconvert_graphdef_memmapped_format\nnative_client/swift/deepspeech_ios.framework/deepspeech_ios\n.github/actions/check_artifact_exists/node_modules/\n"
  },
  {
    "path": ".gitmodules",
    "content": "[submodule \"doc/examples\"]\n\tpath = doc/examples\n\turl = https://github.com/mozilla/DeepSpeech-examples.git\n\tbranch = master\n[submodule \"tensorflow\"]\n\tpath = tensorflow\n\turl = https://github.com/mozilla/tensorflow.git\n[submodule \"kenlm\"]\n\tpath = kenlm\n\turl = https://github.com/kpu/kenlm\n"
  },
  {
    "path": ".isort.cfg",
    "content": "[settings]\nline_length=80\nmulti_line_output=3\ndefault_section=FIRSTPARTY"
  },
  {
    "path": ".pylintrc",
    "content": "[MASTER]\n\n# A comma-separated list of package or module names from where C extensions may\n# be loaded. Extensions are loading into the active Python interpreter and may\n# run arbitrary code.\nextension-pkg-whitelist=\n\n# Add files or directories to the blacklist. They should be base names, not\n# paths.\nignore=native_client/kenlm\n\n# Add files or directories matching the regex patterns to the blacklist. The\n# regex matches against base names, not paths.\nignore-patterns=\n\n# Python code to execute, usually for sys.path manipulation such as\n# pygtk.require().\n#init-hook=\n\n# Use multiple processes to speed up Pylint. Specifying 0 will auto-detect the\n# number of processors available to use.\njobs=1\n\n# Control the amount of potential inferred values when inferring a single\n# object. This can help the performance when dealing with large functions or\n# complex, nested conditions.\nlimit-inference-results=100\n\n# List of plugins (as comma separated values of python modules names) to load,\n# usually to register additional checkers.\nload-plugins=\n\n# Pickle collected data for later comparisons.\npersistent=yes\n\n# Specify a configuration file.\n#rcfile=\n\n# When enabled, pylint would attempt to guess common misconfiguration and emit\n# user-friendly hints instead of false-positive error messages.\nsuggestion-mode=yes\n\n# Allow loading of arbitrary C extensions. Extensions are imported into the\n# active Python interpreter and may run arbitrary code.\nunsafe-load-any-extension=no\n\n\n[MESSAGES CONTROL]\n\n# Only show warnings with the listed confidence levels. Leave empty to show\n# all. Valid levels: HIGH, INFERENCE, INFERENCE_FAILURE, UNDEFINED.\nconfidence=\n\n# Disable the message, report, category or checker with the given id(s). You\n# can either give multiple identifiers separated by comma (,) or put this\n# option multiple times (only on the command line, not in the configuration\n# file where it should appear only once). You can also use \"--disable=all\" to\n# disable everything first and then reenable specific checks. For example, if\n# you want to run only the similarities checker, you can use \"--disable=all\n# --enable=similarities\". If you want to run only the classes checker, but have\n# no Warning level messages displayed, use \"--disable=all --enable=classes\n# --disable=W\".\ndisable=missing-docstring,\n        line-too-long,\n        wrong-import-order,\n        ungrouped-imports,\n        wrong-import-position,\n        import-error,\n        no-name-in-module,\n        no-member,\n        unsubscriptable-object,\n        print-statement,\n        parameter-unpacking,\n        unpacking-in-except,\n        old-raise-syntax,\n        backtick,\n        long-suffix,\n        old-ne-operator,\n        old-octal-literal,\n        import-star-module-level,\n        non-ascii-bytes-literal,\n        raw-checker-failed,\n        bad-inline-option,\n        locally-disabled,\n        file-ignored,\n        suppressed-message,\n        useless-suppression,\n        deprecated-pragma,\n        use-symbolic-message-instead,\n        useless-object-inheritance,\n        too-few-public-methods,\n        too-many-branches,\n        too-many-arguments,\n        too-many-locals,\n        too-many-statements,\n        apply-builtin,\n        basestring-builtin,\n        buffer-builtin,\n        cmp-builtin,\n        coerce-builtin,\n        execfile-builtin,\n        file-builtin,\n        long-builtin,\n        raw_input-builtin,\n        reduce-builtin,\n        standarderror-builtin,\n        unicode-builtin,\n        xrange-builtin,\n        coerce-method,\n        delslice-method,\n        getslice-method,\n        setslice-method,\n        no-absolute-import,\n        old-division,\n        dict-iter-method,\n        dict-view-method,\n        next-method-called,\n        metaclass-assignment,\n        indexing-exception,\n        raising-string,\n        reload-builtin,\n        oct-method,\n        hex-method,\n        nonzero-method,\n        cmp-method,\n        input-builtin,\n        round-builtin,\n        intern-builtin,\n        unichr-builtin,\n        map-builtin-not-iterating,\n        zip-builtin-not-iterating,\n        range-builtin-not-iterating,\n        filter-builtin-not-iterating,\n        using-cmp-argument,\n        eq-without-hash,\n        div-method,\n        idiv-method,\n        rdiv-method,\n        exception-message-attribute,\n        invalid-str-codec,\n        sys-max-int,\n        bad-python3-import,\n        deprecated-string-function,\n        deprecated-str-translate-call,\n        deprecated-itertools-function,\n        deprecated-types-field,\n        next-method-defined,\n        dict-items-not-iterating,\n        dict-keys-not-iterating,\n        dict-values-not-iterating,\n        deprecated-operator-function,\n        deprecated-urllib-function,\n        xreadlines-attribute,\n        deprecated-sys-function,\n        exception-escape,\n        comprehension-escape\n\n# Enable the message, report, category or checker with the given id(s). You can\n# either give multiple identifier separated by comma (,) or put this option\n# multiple time (only on the command line, not in the configuration file where\n# it should appear only once). See also the \"--disable\" option for examples.\nenable=c-extension-no-member\n\n\n[REPORTS]\n\n# Python expression which should return a note less than 10 (10 is the highest\n# note). You have access to the variables errors warning, statement which\n# respectively contain the number of errors / warnings messages and the total\n# number of statements analyzed. This is used by the global evaluation report\n# (RP0004).\nevaluation=10.0 - ((float(5 * error + warning + refactor + convention) / statement) * 10)\n\n# Template used to display messages. This is a python new-style format string\n# used to format the message information. See doc for all details.\n#msg-template=\n\n# Set the output format. Available formats are text, parseable, colorized, json\n# and msvs (visual studio). You can also give a reporter class, e.g.\n# mypackage.mymodule.MyReporterClass.\noutput-format=text\n\n# Tells whether to display a full report or only the messages.\nreports=no\n\n# Activate the evaluation score.\nscore=yes\n\n\n[REFACTORING]\n\n# Maximum number of nested blocks for function / method body\nmax-nested-blocks=5\n\n# Complete name of functions that never returns. When checking for\n# inconsistent-return-statements if a never returning function is called then\n# it will be considered as an explicit return statement and no message will be\n# printed.\nnever-returning-functions=sys.exit\n\n\n[LOGGING]\n\n# Format style used to check logging format string. `old` means using %\n# formatting, while `new` is for `{}` formatting.\nlogging-format-style=old\n\n# Logging modules to check that the string format arguments are in logging\n# function parameter format.\nlogging-modules=logging\n\n\n[SPELLING]\n\n# Limits count of emitted suggestions for spelling mistakes.\nmax-spelling-suggestions=4\n\n# Spelling dictionary name. Available dictionaries: none. To make it working\n# install python-enchant package..\nspelling-dict=\n\n# List of comma separated words that should not be checked.\nspelling-ignore-words=\n\n# A path to a file that contains private dictionary; one word per line.\nspelling-private-dict-file=\n\n# Tells whether to store unknown words to indicated private dictionary in\n# --spelling-private-dict-file option instead of raising a message.\nspelling-store-unknown-words=no\n\n\n[MISCELLANEOUS]\n\n# List of note tags to take in consideration, separated by a comma.\nnotes=FIXME,\n      XXX,\n      TODO\n\n\n[TYPECHECK]\n\n# List of decorators that produce context managers, such as\n# contextlib.contextmanager. Add to this list to register other decorators that\n# produce valid context managers.\ncontextmanager-decorators=contextlib.contextmanager\n\n# List of members which are set dynamically and missed by pylint inference\n# system, and so shouldn't trigger E1101 when accessed. Python regular\n# expressions are accepted.\ngenerated-members=\n\n# Tells whether missing members accessed in mixin class should be ignored. A\n# mixin class is detected if its name ends with \"mixin\" (case insensitive).\nignore-mixin-members=yes\n\n# Tells whether to warn about missing members when the owner of the attribute\n# is inferred to be None.\nignore-none=yes\n\n# This flag controls whether pylint should warn about no-member and similar\n# checks whenever an opaque object is returned when inferring. The inference\n# can return multiple potential results while evaluating a Python object, but\n# some branches might not be evaluated, which results in partial inference. In\n# that case, it might be useful to still emit no-member and other checks for\n# the rest of the inferred objects.\nignore-on-opaque-inference=yes\n\n# List of class names for which member attributes should not be checked (useful\n# for classes with dynamically set attributes). This supports the use of\n# qualified names.\nignored-classes=optparse.Values,thread._local,_thread._local\n\n# List of module names for which member attributes should not be checked\n# (useful for modules/projects where namespaces are manipulated during runtime\n# and thus existing member attributes cannot be deduced by static analysis. It\n# supports qualified module names, as well as Unix pattern matching.\nignored-modules=\n\n# Show a hint with possible names when a member name was not found. The aspect\n# of finding the hint is based on edit distance.\nmissing-member-hint=yes\n\n# The minimum edit distance a name should have in order to be considered a\n# similar match for a missing member name.\nmissing-member-hint-distance=1\n\n# The total number of similar names that should be taken in consideration when\n# showing a hint for a missing member.\nmissing-member-max-choices=1\n\n\n[VARIABLES]\n\n# List of additional names supposed to be defined in builtins. Remember that\n# you should avoid defining new builtins when possible.\nadditional-builtins=\n\n# Tells whether unused global variables should be treated as a violation.\nallow-global-unused-variables=yes\n\n# List of strings which can identify a callback function by name. A callback\n# name must start or end with one of those strings.\ncallbacks=cb_,\n          _cb\n\n# A regular expression matching the name of dummy variables (i.e. expected to\n# not be used).\ndummy-variables-rgx=_+$|(_[a-zA-Z0-9_]*[a-zA-Z0-9]+?$)|dummy|^ignored_|^unused_\n\n# Argument names that match this expression will be ignored. Default to name\n# with leading underscore.\nignored-argument-names=_.*|^ignored_|^unused_\n\n# Tells whether we should check for unused import in __init__ files.\ninit-import=no\n\n# List of qualified module names which can have objects that can redefine\n# builtins.\nredefining-builtins-modules=six.moves,past.builtins,future.builtins,builtins,io\n\n\n[FORMAT]\n\n# Expected format of line ending, e.g. empty (any line ending), LF or CRLF.\nexpected-line-ending-format=\n\n# Regexp for a line that is allowed to be longer than the limit.\nignore-long-lines=^\\s*(# )?<?https?://\\S+>?$\n\n# Number of spaces of indent required inside a hanging or continued line.\nindent-after-paren=4\n\n# String used as indentation unit. This is usually \"    \" (4 spaces) or \"\\t\" (1\n# tab).\nindent-string='    '\n\n# Maximum number of characters on a single line.\nmax-line-length=100\n\n# Maximum number of lines in a module.\nmax-module-lines=1000\n\n# List of optional constructs for which whitespace checking is disabled. `dict-\n# separator` is used to allow tabulation in dicts, etc.: {1  : 1,\\n222: 2}.\n# `trailing-comma` allows a space between comma and closing bracket: (a, ).\n# `empty-line` allows space-only lines.\nno-space-check=trailing-comma,\n               dict-separator\n\n# Allow the body of a class to be on the same line as the declaration if body\n# contains single statement.\nsingle-line-class-stmt=no\n\n# Allow the body of an if to be on the same line as the test if there is no\n# else.\nsingle-line-if-stmt=no\n\n\n[SIMILARITIES]\n\n# Ignore comments when computing similarities.\nignore-comments=yes\n\n# Ignore docstrings when computing similarities.\nignore-docstrings=yes\n\n# Ignore imports when computing similarities.\nignore-imports=no\n\n# Minimum lines number of a similarity.\nmin-similarity-lines=4\n\n\n[BASIC]\n\n# Naming style matching correct argument names.\nargument-naming-style=snake_case\n\n# Regular expression matching correct argument names. Overrides argument-\n# naming-style.\nargument-rgx=[a-z_][a-z0-9_]{0,30}$\n\n# Naming style matching correct attribute names.\nattr-naming-style=snake_case\n\n# Regular expression matching correct attribute names. Overrides attr-naming-\n# style.\n#attr-rgx=\n\n# Bad variable names which should always be refused, separated by a comma.\nbad-names=\n\n# Naming style matching correct class attribute names.\nclass-attribute-naming-style=any\n\n# Regular expression matching correct class attribute names. Overrides class-\n# attribute-naming-style.\n#class-attribute-rgx=\n\n# Naming style matching correct class names.\nclass-naming-style=PascalCase\n\n# Regular expression matching correct class names. Overrides class-naming-\n# style.\n#class-rgx=\n\n# Naming style matching correct constant names.\nconst-naming-style=UPPER_CASE\n\n# Regular expression matching correct constant names. Overrides const-naming-\n# style.\n#const-rgx=\n\n# Minimum line length for functions/classes that require docstrings, shorter\n# ones are exempt.\ndocstring-min-length=-1\n\n# Naming style matching correct function names.\nfunction-naming-style=snake_case\n\n# Regular expression matching correct function names. Overrides function-\n# naming-style.\n#function-rgx=\n\n# Good variable names which should always be accepted, separated by a comma.\ngood-names=i,\n           j,\n           k,\n           x,\n           ex,\n           Run,\n           _\n\n# Include a hint for the correct naming format with invalid-name.\ninclude-naming-hint=no\n\n# Naming style matching correct inline iteration names.\ninlinevar-naming-style=any\n\n# Regular expression matching correct inline iteration names. Overrides\n# inlinevar-naming-style.\n#inlinevar-rgx=\n\n# Naming style matching correct method names.\nmethod-naming-style=snake_case\n\n# Regular expression matching correct method names. Overrides method-naming-\n# style.\n#method-rgx=\n\n# Naming style matching correct module names.\nmodule-naming-style=snake_case\n\n# Regular expression matching correct module names. Overrides module-naming-\n# style.\n#module-rgx=\n\n# Colon-delimited sets of names that determine each other's naming style when\n# the name regexes allow several styles.\nname-group=\n\n# Regular expression which should only match function or class names that do\n# not require a docstring.\nno-docstring-rgx=^_\n\n# List of decorators that produce properties, such as abc.abstractproperty. Add\n# to this list to register other decorators that produce valid properties.\n# These decorators are taken in consideration only for invalid-name.\nproperty-classes=abc.abstractproperty\n\n# Naming style matching correct variable names.\nvariable-naming-style=snake_case\n\n# Regular expression matching correct variable names. Overrides variable-\n# naming-style.\nvariable-rgx=[a-z_][a-z0-9_]{0,30}$\n\n\n[STRING]\n\n# This flag controls whether the implicit-str-concat-in-sequence should\n# generate a warning on implicit string concatenation in sequences defined over\n# several lines.\ncheck-str-concat-over-line-jumps=no\n\n\n[IMPORTS]\n\n# Allow wildcard imports from modules that define __all__.\nallow-wildcard-with-all=no\n\n# Analyse import fallback blocks. This can be used to support both Python 2 and\n# 3 compatible code, which means that the block might have code that exists\n# only in one or another interpreter, leading to false positives when analysed.\nanalyse-fallback-blocks=no\n\n# Deprecated modules which should not be used, separated by a comma.\ndeprecated-modules=optparse,tkinter.tix\n\n# Create a graph of external dependencies in the given file (report RP0402 must\n# not be disabled).\next-import-graph=\n\n# Create a graph of every (i.e. internal and external) dependencies in the\n# given file (report RP0402 must not be disabled).\nimport-graph=\n\n# Create a graph of internal dependencies in the given file (report RP0402 must\n# not be disabled).\nint-import-graph=\n\n# Force import order to recognize a module as part of the standard\n# compatibility libraries.\nknown-standard-library=\n\n# Force import order to recognize a module as part of a third party library.\nknown-third-party=enchant\n\n\n[CLASSES]\n\n# List of method names used to declare (i.e. assign) instance attributes.\ndefining-attr-methods=__init__,\n                      __new__,\n                      setUp\n\n# List of member names, which should be excluded from the protected access\n# warning.\nexclude-protected=_asdict,\n                  _fields,\n                  _replace,\n                  _source,\n                  _make\n\n# List of valid names for the first argument in a class method.\nvalid-classmethod-first-arg=cls\n\n# List of valid names for the first argument in a metaclass class method.\nvalid-metaclass-classmethod-first-arg=cls\n\n\n[DESIGN]\n\n# Maximum number of arguments for function / method.\nmax-args=5\n\n# Maximum number of attributes for a class (see R0902).\nmax-attributes=7\n\n# Maximum number of boolean expressions in an if statement.\nmax-bool-expr=5\n\n# Maximum number of branch for function / method body.\nmax-branches=12\n\n# Maximum number of locals for function / method body.\nmax-locals=15\n\n# Maximum number of parents for a class (see R0901).\nmax-parents=7\n\n# Maximum number of public methods for a class (see R0904).\nmax-public-methods=20\n\n# Maximum number of return / yield for function / method body.\nmax-returns=6\n\n# Maximum number of statements in function / method body.\nmax-statements=50\n\n# Minimum number of public methods for a class (see R0903).\nmin-public-methods=2\n\n\n[EXCEPTIONS]\n\n# Exceptions that will emit a warning when being caught. Defaults to\n# \"BaseException, Exception\".\novergeneral-exceptions=BaseException,\n                       Exception\n"
  },
  {
    "path": ".readthedocs.yml",
    "content": "# .readthedocs.yml\n# Read the Docs configuration file\n# See https://docs.readthedocs.io/en/stable/config-file/v2.html for details\n\n# Required\nversion: 2\n\n# Build documentation in the docs/ directory with Sphinx\nsphinx:\n  builder: html\n  configuration: doc/conf.py\n\n# Optionally set the version of Python and requirements required to build your docs\npython:\n  version: 3.7\n  install:\n    - requirements: ci_scripts/docs-requirements.txt\n"
  },
  {
    "path": "BIBLIOGRAPHY.md",
    "content": "This file contains a list of papers in chronological order that have been published \nusing DeepSpeech.\n\nTo appear\n==========\n\n* Raghuveer Peri, Haoqi Li, Krishna Somandepalli, Arindam Jati, Shrikanth Narayanan (2020) \"An empirical analysis of information encoded in disentangled neural speaker representations\". \n* Rosana Ardila, Megan Branson, Kelly Davis, Michael Henretty, Michael Kohler, Josh Meyer, Reuben Morais, Lindsay Saunders, Francis M. Tyers, and Gregor Weber (2020) \"Common Voice: A Massively-Multilingual Speech Corpus\".\n\nPublished \n==========\n\n2020\n----------\n\n* Nils Hjortnaes, Niko Partanen, Michael Rießler and Francis M. Tyers (2020) \n\"Towards a Speech Recognizer for Komi, an Endangered and Low-Resource Uralic Language\". *Proceedings of the 6th International Workshop on Computational Linguistics of Uralic Languages*.\n\n```\n@inproceedings{hjortnaes:2020,\n    author = {Nils Hjortnaes and Niko Partanen and Michael Rießler and Francis M. Tyers},\n    title = {Towards a Speech Recognizer for Komi, an Endangered and Low-Resource Uralic Language},\n    booktitle = {Proceedings of the 6th International Workshop on Computational Linguistics of Uralic Languages},\n    year = 2020\n}\n```\n\n2019\n----------\n\n* Aashish Agarwal and Torsten Zesch (2019) \"German End-to-end Speech Recognition based on DeepSpeech\". *Proceedings of the 15th Conference on Natural Language Processing (KONVENS 2019)*\n\n```\n@inproceedings{agarwal:2019,\n    author = {Aashish Agarwal and Torsten Zesch},\n    title = {German End-to-end Speech Recognition based on DeepSpeech},\n    booktitle = {Proceedings of the 15th Conference on Natural Language Processing (KONVENS 2019)},\n    year = 2019\n```\n\n\n* Yihong Theis (2019) \"Learning to detect named entities in bilingual code-mixed open speech corpora\". MA Thesis. Kansas State University.\n\n```\n@mastersthesis{theis:2019,\n    author = {Yihong Theis},\n    title = {Learning to detect named entities in bilingual code-mixed open speech corpora},\n    school = {Kansas State University},\n    year = 2019\n}\n```\n\n* Ruswan Efendi (2019) \"Automatic Speech Recognition Bahasa Indonesia Menggunakan Bidirectional Long Short-Term Memory dan Connectionist Temporal Classification\". MA Thesis. Universitas Sumatera Utara.\n\n```\n@mastersthesis{theis:2019,\n    author = {Ruswan Efendi},\n    title = {Automatic Speech Recognition Bahasa Indonesia Menggunakan Bidirectional Long Short-Term Memory dan Connectionist Temporal Classification},\n    school = {Universitas Sumatera Utara},\n    year = 2019\n}\n```\n\n2018\n------------\n\n*  Deepthi Karkada and Vikram A. Saletore (2018) \"Training Speech Recognition Models on HPC Infrastructure\". 2018 IEEE/ACM Machine Learning in HPC Environments (MLHPC), Dallas, TX, USA, pp. 124-132.\n\n```\n@inproceedings{karkada:2018,\n    author = {Deepthi Karkada and Vikram A. Saletore},\n    title = {Training Speech Recognition Models on HPC Infrastructure},\n    booktitle = {2018 IEEE/ACM Machine Learning in HPC Environments (MLHPC)},\n    doi = {https://doi.org/10.1109/MLHPC.2018.8638637}\n    year = 2018\n}    \n```\n"
  },
  {
    "path": "CODE_OF_CONDUCT.md",
    "content": "# Community Participation Guidelines\n\nThis repository is governed by Mozilla's code of conduct and etiquette guidelines. \nFor more details, please read the\n[Mozilla Community Participation Guidelines](https://www.mozilla.org/about/governance/policies/participation/). \n\n## How to Report\nFor more information on how to report violations of the Community Participation Guidelines, please read our '[How to Report](https://www.mozilla.org/about/governance/policies/participation/reporting/)' page.\n\n<!--\n## Project Specific Etiquette\n\nIn some cases, there will be additional project etiquette i.e.: (https://bugzilla.mozilla.org/page.cgi?id=etiquette.html).\nPlease update for your project.\n-->\n"
  },
  {
    "path": "CODE_OWNERS.rst",
    "content": "DeepSpeech code owners / governance system\n==========================================\n\nDeepSpeech is run under a governance system inspired (and partially copied from) by the `Mozilla module ownership system <https://www.mozilla.org/about/governance/policies/module-ownership/>`_. The project is roughly divided into modules, and each module has its own owners, which are responsible for reviewing pull requests and deciding on technical direction for their modules. Module ownership authority is given to people who have worked extensively on areas of the project.\n\nModule owners also have the authority of naming other module owners or appointing module peers, which are people with authority to review pull requests in that module. They can also sub-divide their module into sub-modules with their own owners.\n\nModule owners are not tyrants. They are chartered to make decisions with input from the community and in the best interests of the community. Module owners are not required to make code changes or additions solely because the community wants them to do so. (Like anyone else, the module owners may write code because they want to, because their employers want them to, because the community wants them to, or for some other reason.) Module owners do need to pay attention to patches submitted to that module. However “pay attention” does not mean agreeing to every patch. Some patches may not make sense for the WebThings project; some may be poorly implemented. Module owners have the authority to decline a patch; this is a necessary part of the role. We ask the module owners to describe in the relevant issue their reasons for wanting changes to a patch, for declining it altogether, or for postponing review for some period. We don’t ask or expect them to rewrite patches to make them acceptable. Similarly, module owners may need to delay review of a promising patch due to an upcoming deadline. For example, a patch may be of interest, but not for the next milestone. In such a case it may make sense for the module owner to postpone review of a patch until after matters needed for a milestone have been finalized. Again, we expect this to be described in the relevant issue. And of course, it shouldn’t go on very often or for very long or escalation and review is likely.\n\nThe work of the various module owners and peers is overseen by the global owners, which are responsible for making final decisions in case there's conflict between owners as well as set the direction for the project as a whole.\n\nThis file describes module owners who are active on the project and which parts of the code they have expertise on (and interest in). If you're making changes to the code and are wondering who's an appropriate person to talk to, this list will tell you who to ping.\n\nThere's overlap in the areas of expertise of each owner, and in particular when looking at which files are covered by each area, there is a lot of overlap. Don't worry about getting it exactly right when requesting review, any code owner will be happy to redirect the request to a more appropriate person.\n\nGlobal owners\n----------------\n\nThese are people who have worked on the project extensively and are familiar with all or most parts of it. Their expertise and review guidance is trusted by other code owners to cover their own areas of expertise. In case of conflicting opinions from other owners, global owners will make a final decision.\n\n- Alexandre Lissy (@lissyx)\n- Reuben Morais (@reuben)\n\nTraining, feeding\n-----------------\n\n- Reuben Morais (@reuben)\n\nModel exporting\n---------------\n\n- Alexandre Lissy (@lissyx)\n\nTransfer learning\n-----------------\n\n- Josh Meyer (@JRMeyer)\n- Reuben Morais (@reuben)\n\nTesting & CI\n------------\n\n- Alexandre Lissy (@lissyx)\n- Reuben Morais (@reuben)\n\nNative inference client\n-----------------------\n\nEverything that goes into libdeepspeech.so and is not specifically covered in another area fits here.\n\n- Alexandre Lissy (@lissyx)\n- Reuben Morais (@reuben)\n\nStreaming decoder\n-----------------\n\n- Reuben Morais (@reuben)\n- @dabinat\n\nPython bindings\n---------------\n\n- Alexandre Lissy (@lissyx)\n- Reuben Morais (@reuben)\n\nJava Bindings\n-------------\n\n- Alexandre Lissy (@lissyx)\n\nJavaScript/NodeJS/ElectronJS bindings\n-------------------------------------\n\n- Alexandre Lissy (@lissyx)\n- Reuben Morais (@reuben)\n\n.NET bindings\n-------------\n\n- Carlos Fonseca (@carlfm01)\n\nSwift bindings\n--------------\n\n- Reuben Morais (@reuben)\n\nAndroid support\n---------------\n\n- Alexandre Lissy (@lissyx)\n\nRaspberry Pi support\n--------------------\n\n- Alexandre Lissy (@lissyx)\n\nWindows support\n---------------\n\n- Carlos Fonseca (@carlfm01)\n\niOS support\n-----------\n\n- Reuben Morais (@reuben)\n\nDocumentation\n-------------\n\n- Alexandre Lissy (@lissyx)\n- Reuben Morais (@reuben)\n\nThird party bindings\n--------------------\n\nHosted externally and owned by the individual authors. See the `list of third-party bindings <https://deepspeech.readthedocs.io/en/master/USING.html#third-party-bindings>`_ for more info.\n"
  },
  {
    "path": "CONTRIBUTING.rst",
    "content": "Contribution guidelines\n=======================\n\nWelcome to the DeepSpeech project! We are excited to see your interest, and appreciate your support!\n\nThis repository is governed by Mozilla's code of conduct and etiquette guidelines. For more details, please read the `Mozilla Community Participation Guidelines <https://www.mozilla.org/about/governance/policies/participation/>`_.\n\nHow to Make a Good Pull Request\n-------------------------------\n\nHere's some guidelines on how to make a good PR to DeepSpeech.\n\nBug-fix PR\n^^^^^^^^^^\n\nYou've found a bug and you were able to squash it! Great job! Please write a short but clear commit message describing the bug, and how you fixed it. This makes review much easier. Also, please name your branch something related to the bug-fix.\n\nDocumentation PR\n^^^^^^^^^^^^^^^^\n\nIf you're just making updates or changes to the documentation, there's no need to run all of DeepSpeech's tests for Continuous Integration (i.e. Taskcluster tests). In this case, at the end of your short but clear commit message, you should add **X-DeepSpeech: NOBUILD**. This will trigger the CI tests to skip your PR, saving both time and compute.\n\nNew Feature PR\n^^^^^^^^^^^^^^\n\nYou've made some core changes to DeepSpeech, and you would like to share them back with the community -- great! First things first: if you're planning to add a feature (not just fix a bug or docs) let the DeepSpeech team know ahead of time and get some feedback early. A quick check-in with the team can save time during code-review, and also ensure that your new feature fits into the project.\n\nThe DeepSpeech codebase is made of many connected parts. There is Python code for training DeepSpeech, core C++ code for running inference on trained models, and multiple language bindings to the C++ core so you can use DeepSpeech in your favorite language.\n\nWhenever you add a new feature to DeepSpeech and what to contribute that feature back to the project, here are some things to keep in mind:\n\n1. You've made changes to the core C++ code. Core changes can have downstream effects on all parts of the DeepSpeech project, so keep that in mind. You should minimally also make necessary changes to the C client (i.e. **args.h** and **client.cc**). The bindings for Python, Java, and Javascript are SWIG generated, and in the best-case scenario you won't have to worry about them. However, if you've added a whole new feature, you may need to make custom tweaks to those bindings, because SWIG may not automagically work with your new feature, especially if you've exposed new arguments. The bindings for .NET and Swift are not generated automatically. It would be best if you also made the necessary manual changes to these bindings as well. It is best to communicate with the core DeepSpeech team and come to an understanding of where you will likely need to work with the bindings. They can't predict all the bugs you will run into, but they will have a good idea of how to plan for some obvious challenges.\n2. You've made changes to the Python code. Make sure you run a linter (described below).\n3. Make sure your new feature doesn't regress the project. If you've added a significant feature or amount of code, you want to be sure your new feature doesn't create performance issues. For example, if you've made a change to the DeepSpeech decoder, you should know that inference performance doesn't drop in terms of latency, accuracy, or memory usage. Unless you're proposing a new decoding algorithm, you probably don't have to worry about affecting accuracy. However, it's very possible you've affected latency or memory usage. You should run local performance tests to make sure no bugs have crept in. There are lots of tools to check latency and memory usage, and you should use what is most comfortable for you and gets the job done. If you're on Linux, you might find [[perf](https://perf.wiki.kernel.org/index.php/Main_Page)] to be a useful tool. You can use sample WAV files for testing which are provided in the `DeepSpeech/data/` directory.\n\nRequesting review on your PR\n----------------------------\n\nGenerally, a code owner will be notified of your pull request and will either review it or ask some other code owner for their review. If you'd like to proactively request review as you open the PR, see the the CODE_OWNERS.rst file which describes who's an appropriate reviewer depending on which parts of the code you're changing.\n\n\nPython Linter\n-------------\n\nBefore making a Pull Request for Python code changes, check your changes for basic mistakes and style problems by using a linter. We have cardboardlinter setup in this repository, so for example, if you've made some changes and would like to run the linter on just the changed code, you can use the follow command:\n\n.. code-block:: bash\n\n   pip install pylint cardboardlint\n   cardboardlinter --refspec master\n\nThis will compare the code against master and run the linter on all the changes. We plan to introduce more linter checks (e.g. for C++) in the future. To run it automatically as a git pre-commit hook, do the following:\n\n.. code-block:: bash\n\n   cat <<\\EOF > .git/hooks/pre-commit\n   #!/bin/bash\n   if [ ! -x \"$(command -v cardboardlinter)\" ]; then\n       exit 0\n   fi\n\n   # First, stash index and work dir, keeping only the\n   # to-be-committed changes in the working directory.\n   echo \"Stashing working tree changes...\" 1>&2\n   old_stash=$(git rev-parse -q --verify refs/stash)\n   git stash save -q --keep-index\n   new_stash=$(git rev-parse -q --verify refs/stash)\n\n   # If there were no changes (e.g., `--amend` or `--allow-empty`)\n   # then nothing was stashed, and we should skip everything,\n   # including the tests themselves.  (Presumably the tests passed\n   # on the previous commit, so there is no need to re-run them.)\n   if [ \"$old_stash\" = \"$new_stash\" ]; then\n       echo \"No changes, skipping lint.\" 1>&2\n       exit 0\n   fi\n\n   # Run tests\n   cardboardlinter --refspec HEAD -n auto\n   status=$?\n\n   # Restore changes\n   echo \"Restoring working tree changes...\" 1>&2\n   git reset --hard -q && git stash apply --index -q && git stash drop -q\n\n   # Exit with status from test-run: nonzero prevents commit\n   exit $status\n   EOF\n   chmod +x .git/hooks/pre-commit\n\nThis will run the linters on just the changes made in your commit.\n\n"
  },
  {
    "path": "DeepSpeech.py",
    "content": "#!/usr/bin/env python\n# -*- coding: utf-8 -*-\nfrom __future__ import absolute_import, division, print_function\n\nif __name__ == '__main__':\n    try:\n        from deepspeech_training import train as ds_train\n    except ImportError:\n        print('Training package is not installed. See training documentation.')\n        raise\n\n    ds_train.run_script()\n"
  },
  {
    "path": "Dockerfile.build.tmpl",
    "content": "# Please refer to the USING documentation, \"Dockerfile for building from source\"\n\n# Need devel version cause we need /usr/include/cudnn.h \nFROM nvidia/cuda:10.1-cudnn7-devel-ubuntu18.04\n\nENV DEEPSPEECH_REPO=#DEEPSPEECH_REPO# \\\n    DEEPSPEECH_SHA=#DEEPSPEECH_SHA#\n\n# >> START Install base software\n\n# Get basic packages\nRUN apt-get update && apt-get install -y --no-install-recommends \\\n    apt-utils \\\n    bash-completion \\\n    build-essential \\\n    ca-certificates \\\n    cmake \\\n    curl \\\n    g++ \\\n    gcc \\\n    git \\\n    libbz2-dev \\\n    libboost-all-dev \\\n    libgsm1-dev \\\n    libltdl-dev \\\n    liblzma-dev \\\n    libmagic-dev \\\n    libpng-dev \\\n    libsox-fmt-mp3 \\\n    libsox-dev \\\n    locales \\\n    openjdk-8-jdk \\\n    pkg-config \\\n    python3 \\\n    python3-dev \\\n    python3-pip \\\n    python3-wheel \\\n    python3-numpy \\\n    sox \\\n    unzip \\\n    wget \\\n    zlib1g-dev; \\\n    update-alternatives --install /usr/bin/pip pip /usr/bin/pip3 1 && \\\n    update-alternatives --install /usr/bin/python python /usr/bin/python3 1; \\\n    # Install Bazel \\\n    curl -LO \"https://github.com/bazelbuild/bazel/releases/download/3.1.0/bazel_3.1.0-linux-x86_64.deb\" && dpkg -i bazel_*.deb; \\\n    # Try and free some space \\\n    rm -rf /var/lib/apt/lists/* bazel_*.deb\n\n# << END Install base software\n\n# >> START Configure Tensorflow Build\n\n# GPU Environment Setup\nENV TF_NEED_ROCM=0 \\\n    TF_NEED_OPENCL_SYCL=0 \\\n    TF_NEED_OPENCL=0 \\\n    TF_NEED_CUDA=1 \\\n    TF_CUDA_PATHS=\"/usr,/usr/local/cuda-10.1,/usr/lib/x86_64-linux-gnu/\" \\\n    TF_CUDA_VERSION=10.1 \\\n    TF_CUDNN_VERSION=7.6 \\\n    TF_CUDA_COMPUTE_CAPABILITIES=6.0 \\\n    TF_NCCL_VERSION=2.8 \\\n    # Common Environment Setup \\\n    TF_BUILD_CONTAINER_TYPE=GPU \\\n    TF_BUILD_OPTIONS=OPT \\\n    TF_BUILD_DISABLE_GCP=1 \\\n    TF_BUILD_ENABLE_XLA=0 \\\n    TF_BUILD_PYTHON_VERSION=PYTHON3 \\\n    TF_BUILD_IS_OPT=OPT \\\n    TF_BUILD_IS_PIP=PIP \\\n    # Build client.cc and install Python client and decoder bindings \\\n    TFDIR=/DeepSpeech/tensorflow \\\n    # Allow Python printing utf-8 \\\n    PYTHONIOENCODING=UTF-8 \\\n    # Other Parameters \\\n    CC_OPT_FLAGS=\"-mavx -mavx2 -msse4.1 -msse4.2 -mfma\" \\\n    TF_NEED_GCP=0 \\\n    TF_NEED_HDFS=0 \\\n    TF_NEED_JEMALLOC=1 \\\n    TF_NEED_OPENCL=0 \\\n    TF_CUDA_CLANG=0 \\\n    TF_NEED_MKL=0 \\\n    TF_ENABLE_XLA=0 \\\n    TF_NEED_AWS=0 \\\n    TF_NEED_KAFKA=0 \\\n    TF_NEED_NGRAPH=0 \\\n    TF_DOWNLOAD_CLANG=0 \\\n    TF_NEED_TENSORRT=0 \\\n    TF_NEED_GDR=0 \\\n    TF_NEED_VERBS=0 \\\n    TF_NEED_OPENCL_SYCL=0 \\\n    PYTHON_BIN_PATH=/usr/bin/python3.6 \\\n    PYTHON_LIB_PATH=/usr/local/lib/python3.6/dist-packages\n\n# << END Configure Tensorflow Build\n\n# >> START Configure Bazel\n\n# Running bazel inside a `docker build` command causes trouble, cf:\n#   https://github.com/bazelbuild/bazel/issues/134\n# The easiest solution is to set up a bazelrc file forcing --batch.\n# Similarly, we need to workaround sandboxing issues:\n#   https://github.com/bazelbuild/bazel/issues/418\nRUN echo \"startup --batch\" >>/etc/bazel.bazelrc; \\\n    echo \"build --spawn_strategy=standalone --genrule_strategy=standalone\" >> /etc/bazel.bazelrc\n\n# << END Configure Bazel\n\nWORKDIR /\n\nRUN git clone --recursive $DEEPSPEECH_REPO DeepSpeech && \\\n    cd /DeepSpeech && \\\n    git fetch origin $DEEPSPEECH_SHA && git checkout $DEEPSPEECH_SHA; \\\n    git submodule sync tensorflow/ && git submodule update --init tensorflow/; \\\n    git submodule sync kenlm/ && git submodule update --init kenlm/\n\n# >> START Build and bind\n# Fix for not found script https://github.com/tensorflow/tensorflow/issues/471\n# Using CPU optimizations:\n# -mtune=generic -march=x86-64 -msse -msse2 -msse3 -msse4.1 -msse4.2 -mavx.\n# Adding --config=cuda flag to build using CUDA.\n\n# passing LD_LIBRARY_PATH is required cause Bazel doesn't pickup it from environment\n\n# Build DeepSpeech\nRUN cd /DeepSpeech/tensorflow && ./configure && bazel build \\\n\t--workspace_status_command=\"bash native_client/bazel_workspace_status_cmd.sh\" \\\n\t--config=monolithic \\\n\t--config=cuda \\\n\t-c opt \\\n\t--copt=-O3 \\\n\t--copt=\"-D_GLIBCXX_USE_CXX11_ABI=0\" \\\n\t--copt=-mtune=generic \\\n\t--copt=-march=x86-64 \\\n\t--copt=-msse \\\n\t--copt=-msse2 \\\n\t--copt=-msse3 \\\n\t--copt=-msse4.1 \\\n\t--copt=-msse4.2 \\\n\t--copt=-mavx \\\n\t--copt=-fvisibility=hidden \\\n\t//native_client:libdeepspeech.so \\\n\t--verbose_failures \\\n\t--action_env=LD_LIBRARY_PATH=${LD_LIBRARY_PATH} && \\\n    cp bazel-bin/native_client/libdeepspeech.so /DeepSpeech/native_client/ && \\\n    rm -fr /root/.cache/*\n\nRUN cd /DeepSpeech/native_client && make NUM_PROCESSES=$(nproc) deepspeech ; \\\n    cd /DeepSpeech/native_client/python && make NUM_PROCESSES=$(nproc) bindings; \\\n    pip3 install --upgrade dist/*.whl; \\\n    cd /DeepSpeech/native_client/ctcdecode && make NUM_PROCESSES=$(nproc) bindings; \\\n    pip3 install --upgrade dist/*.whl\n\n# << END Build and bind\n\n# Build KenLM in /DeepSpeech/kenlm folder\nWORKDIR /DeepSpeech/kenlm\nRUN wget -O - https://gitlab.com/libeigen/eigen/-/archive/3.3.8/eigen-3.3.8.tar.bz2 | tar xj; \\\n    mkdir -p build && \\\n    cd build && \\\n    EIGEN3_ROOT=/DeepSpeech/kenlm/eigen-3.3.8 cmake .. && \\\n    make -j $(nproc)\n\n# Done\nWORKDIR /DeepSpeech\n"
  },
  {
    "path": "Dockerfile.train.tmpl",
    "content": "# Please refer to the TRAINING documentation, \"Basic Dockerfile for training\"\n\nFROM tensorflow/tensorflow:1.15.4-gpu-py3\nENV DEBIAN_FRONTEND=noninteractive \\\n    DEEPSPEECH_REPO=#DEEPSPEECH_REPO# \\\n    DEEPSPEECH_SHA=#DEEPSPEECH_SHA#\n\nRUN apt-get update && apt-get install -y --no-install-recommends \\\n    apt-utils \\\n    bash-completion \\\n    build-essential \\\n    cmake \\\n    curl \\\n    git \\\n    libboost-all-dev \\\n    libbz2-dev \\\n    liblzma-dev \\\n    locales \\\n    python3-venv \\\n    unzip \\\n    xz-utils \\\n    wget && \\\n    # We need to remove it because it's breaking deepspeech install later with \\\n    # weird errors about setuptools \\\n    apt-get purge -y python3-xdg && \\\n    # Install dependencies for audio augmentation \\\n    apt-get install -y --no-install-recommends libopus0 libsndfile1 && \\\n    # Try and free some space \\\n    rm -rf /var/lib/apt/lists/*\n\nWORKDIR /\nRUN git clone $DEEPSPEECH_REPO DeepSpeech && \\\n    cd /DeepSpeech && git fetch origin $DEEPSPEECH_SHA && git checkout $DEEPSPEECH_SHA && \\\n    git submodule sync kenlm/ && git submodule update --init kenlm/\n\n# Build CTC decoder first, to avoid clashes on incompatible versions upgrades\nRUN cd /DeepSpeech/native_client/ctcdecode && make NUM_PROCESSES=$(nproc) bindings && \\\n    pip3 install --upgrade dist/*.whl\n\n# Prepare deps\nRUN cd /DeepSpeech && pip3 install --upgrade pip==20.2.2 wheel==0.34.2 setuptools==49.6.0 && \\\n    # Install DeepSpeech \\\n    #  - No need for the decoder since we did it earlier \\\n    #  - There is already correct TensorFlow GPU installed on the base image, \\\n    #    we don't want to break that \\\n    DS_NODECODER=y DS_NOTENSORFLOW=y pip3 install --upgrade -e . && \\\n    # Tool to convert output graph for inference \\\n    curl -vsSL https://github.com/mozilla/DeepSpeech/releases/download/v0.9.3/linux.amd64.convert_graphdef_memmapped_format.xz | xz -d > convert_graphdef_memmapped_format && \\\n    chmod +x convert_graphdef_memmapped_format\n\n# Build KenLM to generate new scorers\nWORKDIR /DeepSpeech/kenlm\nRUN wget -O - https://gitlab.com/libeigen/eigen/-/archive/3.3.8/eigen-3.3.8.tar.bz2 | tar xj && \\\n    mkdir -p build && \\\n    cd build && \\\n    EIGEN3_ROOT=/DeepSpeech/kenlm/eigen-3.3.8 cmake .. && \\\n    make -j $(nproc)\n\nWORKDIR /DeepSpeech\n\nRUN ./bin/run-ldc93s1.sh\n"
  },
  {
    "path": "ISSUE_TEMPLATE.md",
    "content": "For support and discussions, please use our [Discourse forums](https://discourse.mozilla.org/c/deep-speech).\n\nIf you've found a bug, or have a feature request, then please create an issue with the following information:\n\n- **Have I written custom code (as opposed to running examples on an unmodified clone of the repository)**:\n- **OS Platform and Distribution (e.g., Linux Ubuntu 16.04)**:\n- **TensorFlow installed from (our builds, or upstream TensorFlow)**:\n- **TensorFlow version (use command below)**:\n- **Python version**: \n- **Bazel version (if compiling from source)**:\n- **GCC/Compiler version (if compiling from source)**:\n- **CUDA/cuDNN version**:\n- **GPU model and memory**:\n- **Exact command to reproduce**:\n\nYou can obtain the TensorFlow version with\n\n```bash\npython -c \"import tensorflow as tf; print(tf.GIT_VERSION, tf.VERSION)\"\n```\n\nPlease describe the problem clearly. Be sure to convey here why it's a bug or a feature request.\n\nInclude any logs or source code that would be helpful to diagnose the problem. For larger logs, link to a Gist, not a screenshot. If including tracebacks, please include the full traceback. Try to provide a reproducible test case.\n"
  },
  {
    "path": "LICENSE",
    "content": "Mozilla Public License Version 2.0\n==================================\n\n1. Definitions\n--------------\n\n1.1. \"Contributor\"\n    means each individual or legal entity that creates, contributes to\n    the creation of, or owns Covered Software.\n\n1.2. \"Contributor Version\"\n    means the combination of the Contributions of others (if any) used\n    by a Contributor and that particular Contributor's Contribution.\n\n1.3. \"Contribution\"\n    means Covered Software of a particular Contributor.\n\n1.4. \"Covered Software\"\n    means Source Code Form to which the initial Contributor has attached\n    the notice in Exhibit A, the Executable Form of such Source Code\n    Form, and Modifications of such Source Code Form, in each case\n    including portions thereof.\n\n1.5. \"Incompatible With Secondary Licenses\"\n    means\n\n    (a) that the initial Contributor has attached the notice described\n        in Exhibit B to the Covered Software; or\n\n    (b) that the Covered Software was made available under the terms of\n        version 1.1 or earlier of the License, but not also under the\n        terms of a Secondary License.\n\n1.6. \"Executable Form\"\n    means any form of the work other than Source Code Form.\n\n1.7. \"Larger Work\"\n    means a work that combines Covered Software with other material, in\n    a separate file or files, that is not Covered Software.\n\n1.8. \"License\"\n    means this document.\n\n1.9. \"Licensable\"\n    means having the right to grant, to the maximum extent possible,\n    whether at the time of the initial grant or subsequently, any and\n    all of the rights conveyed by this License.\n\n1.10. \"Modifications\"\n    means any of the following:\n\n    (a) any file in Source Code Form that results from an addition to,\n        deletion from, or modification of the contents of Covered\n        Software; or\n\n    (b) any new file in Source Code Form that contains any Covered\n        Software.\n\n1.11. \"Patent Claims\" of a Contributor\n    means any patent claim(s), including without limitation, method,\n    process, and apparatus claims, in any patent Licensable by such\n    Contributor that would be infringed, but for the grant of the\n    License, by the making, using, selling, offering for sale, having\n    made, import, or transfer of either its Contributions or its\n    Contributor Version.\n\n1.12. \"Secondary License\"\n    means either the GNU General Public License, Version 2.0, the GNU\n    Lesser General Public License, Version 2.1, the GNU Affero General\n    Public License, Version 3.0, or any later versions of those\n    licenses.\n\n1.13. \"Source Code Form\"\n    means the form of the work preferred for making modifications.\n\n1.14. \"You\" (or \"Your\")\n    means an individual or a legal entity exercising rights under this\n    License. For legal entities, \"You\" includes any entity that\n    controls, is controlled by, or is under common control with You. For\n    purposes of this definition, \"control\" means (a) the power, direct\n    or indirect, to cause the direction or management of such entity,\n    whether by contract or otherwise, or (b) ownership of more than\n    fifty percent (50%) of the outstanding shares or beneficial\n    ownership of such entity.\n\n2. License Grants and Conditions\n--------------------------------\n\n2.1. Grants\n\nEach Contributor hereby grants You a world-wide, royalty-free,\nnon-exclusive license:\n\n(a) under intellectual property rights (other than patent or trademark)\n    Licensable by such Contributor to use, reproduce, make available,\n    modify, display, perform, distribute, and otherwise exploit its\n    Contributions, either on an unmodified basis, with Modifications, or\n    as part of a Larger Work; and\n\n(b) under Patent Claims of such Contributor to make, use, sell, offer\n    for sale, have made, import, and otherwise transfer either its\n    Contributions or its Contributor Version.\n\n2.2. Effective Date\n\nThe licenses granted in Section 2.1 with respect to any Contribution\nbecome effective for each Contribution on the date the Contributor first\ndistributes such Contribution.\n\n2.3. Limitations on Grant Scope\n\nThe licenses granted in this Section 2 are the only rights granted under\nthis License. No additional rights or licenses will be implied from the\ndistribution or licensing of Covered Software under this License.\nNotwithstanding Section 2.1(b) above, no patent license is granted by a\nContributor:\n\n(a) for any code that a Contributor has removed from Covered Software;\n    or\n\n(b) for infringements caused by: (i) Your and any other third party's\n    modifications of Covered Software, or (ii) the combination of its\n    Contributions with other software (except as part of its Contributor\n    Version); or\n\n(c) under Patent Claims infringed by Covered Software in the absence of\n    its Contributions.\n\nThis License does not grant any rights in the trademarks, service marks,\nor logos of any Contributor (except as may be necessary to comply with\nthe notice requirements in Section 3.4).\n\n2.4. Subsequent Licenses\n\nNo Contributor makes additional grants as a result of Your choice to\ndistribute the Covered Software under a subsequent version of this\nLicense (see Section 10.2) or under the terms of a Secondary License (if\npermitted under the terms of Section 3.3).\n\n2.5. Representation\n\nEach Contributor represents that the Contributor believes its\nContributions are its original creation(s) or it has sufficient rights\nto grant the rights to its Contributions conveyed by this License.\n\n2.6. Fair Use\n\nThis License is not intended to limit any rights You have under\napplicable copyright doctrines of fair use, fair dealing, or other\nequivalents.\n\n2.7. Conditions\n\nSections 3.1, 3.2, 3.3, and 3.4 are conditions of the licenses granted\nin Section 2.1.\n\n3. Responsibilities\n-------------------\n\n3.1. Distribution of Source Form\n\nAll distribution of Covered Software in Source Code Form, including any\nModifications that You create or to which You contribute, must be under\nthe terms of this License. You must inform recipients that the Source\nCode Form of the Covered Software is governed by the terms of this\nLicense, and how they can obtain a copy of this License. You may not\nattempt to alter or restrict the recipients' rights in the Source Code\nForm.\n\n3.2. Distribution of Executable Form\n\nIf You distribute Covered Software in Executable Form then:\n\n(a) such Covered Software must also be made available in Source Code\n    Form, as described in Section 3.1, and You must inform recipients of\n    the Executable Form how they can obtain a copy of such Source Code\n    Form by reasonable means in a timely manner, at a charge no more\n    than the cost of distribution to the recipient; and\n\n(b) You may distribute such Executable Form under the terms of this\n    License, or sublicense it under different terms, provided that the\n    license for the Executable Form does not attempt to limit or alter\n    the recipients' rights in the Source Code Form under this License.\n\n3.3. Distribution of a Larger Work\n\nYou may create and distribute a Larger Work under terms of Your choice,\nprovided that You also comply with the requirements of this License for\nthe Covered Software. If the Larger Work is a combination of Covered\nSoftware with a work governed by one or more Secondary Licenses, and the\nCovered Software is not Incompatible With Secondary Licenses, this\nLicense permits You to additionally distribute such Covered Software\nunder the terms of such Secondary License(s), so that the recipient of\nthe Larger Work may, at their option, further distribute the Covered\nSoftware under the terms of either this License or such Secondary\nLicense(s).\n\n3.4. Notices\n\nYou may not remove or alter the substance of any license notices\n(including copyright notices, patent notices, disclaimers of warranty,\nor limitations of liability) contained within the Source Code Form of\nthe Covered Software, except that You may alter any license notices to\nthe extent required to remedy known factual inaccuracies.\n\n3.5. Application of Additional Terms\n\nYou may choose to offer, and to charge a fee for, warranty, support,\nindemnity or liability obligations to one or more recipients of Covered\nSoftware. However, You may do so only on Your own behalf, and not on\nbehalf of any Contributor. You must make it absolutely clear that any\nsuch warranty, support, indemnity, or liability obligation is offered by\nYou alone, and You hereby agree to indemnify every Contributor for any\nliability incurred by such Contributor as a result of warranty, support,\nindemnity or liability terms You offer. You may include additional\ndisclaimers of warranty and limitations of liability specific to any\njurisdiction.\n\n4. Inability to Comply Due to Statute or Regulation\n---------------------------------------------------\n\nIf it is impossible for You to comply with any of the terms of this\nLicense with respect to some or all of the Covered Software due to\nstatute, judicial order, or regulation then You must: (a) comply with\nthe terms of this License to the maximum extent possible; and (b)\ndescribe the limitations and the code they affect. Such description must\nbe placed in a text file included with all distributions of the Covered\nSoftware under this License. Except to the extent prohibited by statute\nor regulation, such description must be sufficiently detailed for a\nrecipient of ordinary skill to be able to understand it.\n\n5. Termination\n--------------\n\n5.1. The rights granted under this License will terminate automatically\nif You fail to comply with any of its terms. However, if You become\ncompliant, then the rights granted under this License from a particular\nContributor are reinstated (a) provisionally, unless and until such\nContributor explicitly and finally terminates Your grants, and (b) on an\nongoing basis, if such Contributor fails to notify You of the\nnon-compliance by some reasonable means prior to 60 days after You have\ncome back into compliance. Moreover, Your grants from a particular\nContributor are reinstated on an ongoing basis if such Contributor\nnotifies You of the non-compliance by some reasonable means, this is the\nfirst time You have received notice of non-compliance with this License\nfrom such Contributor, and You become compliant prior to 30 days after\nYour receipt of the notice.\n\n5.2. If You initiate litigation against any entity by asserting a patent\ninfringement claim (excluding declaratory judgment actions,\ncounter-claims, and cross-claims) alleging that a Contributor Version\ndirectly or indirectly infringes any patent, then the rights granted to\nYou by any and all Contributors for the Covered Software under Section\n2.1 of this License shall terminate.\n\n5.3. In the event of termination under Sections 5.1 or 5.2 above, all\nend user license agreements (excluding distributors and resellers) which\nhave been validly granted by You or Your distributors under this License\nprior to termination shall survive termination.\n\n************************************************************************\n*                                                                      *\n*  6. Disclaimer of Warranty                                           *\n*  -------------------------                                           *\n*                                                                      *\n*  Covered Software is provided under this License on an \"as is\"       *\n*  basis, without warranty of any kind, either expressed, implied, or  *\n*  statutory, including, without limitation, warranties that the       *\n*  Covered Software is free of defects, merchantable, fit for a        *\n*  particular purpose or non-infringing. The entire risk as to the     *\n*  quality and performance of the Covered Software is with You.        *\n*  Should any Covered Software prove defective in any respect, You     *\n*  (not any Contributor) assume the cost of any necessary servicing,   *\n*  repair, or correction. This disclaimer of warranty constitutes an   *\n*  essential part of this License. No use of any Covered Software is   *\n*  authorized under this License except under this disclaimer.         *\n*                                                                      *\n************************************************************************\n\n************************************************************************\n*                                                                      *\n*  7. Limitation of Liability                                          *\n*  --------------------------                                          *\n*                                                                      *\n*  Under no circumstances and under no legal theory, whether tort      *\n*  (including negligence), contract, or otherwise, shall any           *\n*  Contributor, or anyone who distributes Covered Software as          *\n*  permitted above, be liable to You for any direct, indirect,         *\n*  special, incidental, or consequential damages of any character      *\n*  including, without limitation, damages for lost profits, loss of    *\n*  goodwill, work stoppage, computer failure or malfunction, or any    *\n*  and all other commercial damages or losses, even if such party      *\n*  shall have been informed of the possibility of such damages. This   *\n*  limitation of liability shall not apply to liability for death or   *\n*  personal injury resulting from such party's negligence to the       *\n*  extent applicable law prohibits such limitation. Some               *\n*  jurisdictions do not allow the exclusion or limitation of           *\n*  incidental or consequential damages, so this exclusion and          *\n*  limitation may not apply to You.                                    *\n*                                                                      *\n************************************************************************\n\n8. Litigation\n-------------\n\nAny litigation relating to this License may be brought only in the\ncourts of a jurisdiction where the defendant maintains its principal\nplace of business and such litigation shall be governed by laws of that\njurisdiction, without reference to its conflict-of-law provisions.\nNothing in this Section shall prevent a party's ability to bring\ncross-claims or counter-claims.\n\n9. Miscellaneous\n----------------\n\nThis License represents the complete agreement concerning the subject\nmatter hereof. If any provision of this License is held to be\nunenforceable, such provision shall be reformed only to the extent\nnecessary to make it enforceable. Any law or regulation which provides\nthat the language of a contract shall be construed against the drafter\nshall not be used to construe this License against a Contributor.\n\n10. Versions of the License\n---------------------------\n\n10.1. New Versions\n\nMozilla Foundation is the license steward. Except as provided in Section\n10.3, no one other than the license steward has the right to modify or\npublish new versions of this License. Each version will be given a\ndistinguishing version number.\n\n10.2. Effect of New Versions\n\nYou may distribute the Covered Software under the terms of the version\nof the License under which You originally received the Covered Software,\nor under the terms of any subsequent version published by the license\nsteward.\n\n10.3. Modified Versions\n\nIf you create software not governed by this License, and you want to\ncreate a new license for such software, you may create and use a\nmodified version of this License if you rename the license and remove\nany references to the name of the license steward (except to note that\nsuch modified license differs from this License).\n\n10.4. Distributing Source Code Form that is Incompatible With Secondary\nLicenses\n\nIf You choose to distribute Source Code Form that is Incompatible With\nSecondary Licenses under the terms of this version of the License, the\nnotice described in Exhibit B of this License must be attached.\n\nExhibit A - Source Code Form License Notice\n-------------------------------------------\n\n  This Source Code Form is subject to the terms of the Mozilla Public\n  License, v. 2.0. If a copy of the MPL was not distributed with this\n  file, You can obtain one at http://mozilla.org/MPL/2.0/.\n\nIf it is not possible or desirable to put the notice in a particular\nfile, then You may include the notice in a location (such as a LICENSE\nfile in a relevant directory) where a recipient would be likely to look\nfor such a notice.\n\nYou may add additional accurate notices of copyright ownership.\n\nExhibit B - \"Incompatible With Secondary Licenses\" Notice\n---------------------------------------------------------\n\n  This Source Code Form is \"Incompatible With Secondary Licenses\", as\n  defined by the Mozilla Public License, v. 2.0.\n"
  },
  {
    "path": "Makefile",
    "content": "DEEPSPEECH_REPO ?= https://github.com/mozilla/DeepSpeech.git\nDEEPSPEECH_SHA  ?= master\n\nDockerfile%: Dockerfile%.tmpl\n\tsed \\\n\t\t-e \"s|#DEEPSPEECH_REPO#|$(DEEPSPEECH_REPO)|g\" \\\n\t\t-e \"s|#DEEPSPEECH_SHA#|$(DEEPSPEECH_SHA)|g\" \\\n\t\t< $< > $@\n"
  },
  {
    "path": "README.rst",
    "content": "Status\n======\n\nThis project is now discontinued.\n\nProject DeepSpeech\n==================\n\n.. image:: https://readthedocs.org/projects/deepspeech/badge/?version=latest\n   :target: https://deepspeech.readthedocs.io/?badge=latest\n   :alt: Documentation\n\n\n.. image:: https://github.com/mozilla/DeepSpeech/actions/workflows/macOS-amd64.yml/badge.svg\n   :target: https://github.com/mozilla/DeepSpeech/actions/workflows/macOS-amd64.yml\n   :alt: macOS builds\n\n.. image:: https://github.com/mozilla/DeepSpeech/actions/workflows/lint.yml/badge.svg\n   :target: https://github.com/mozilla/DeepSpeech/actions/workflows/lint.yml\n   :alt: Linters\n\n.. image:: https://github.com/mozilla/DeepSpeech/actions/workflows/docker.yml/badge.svg\n   :target: https://github.com/mozilla/DeepSpeech/actions/workflows/docker.yml\n   :alt: Docker Images\n\n\nDeepSpeech is an open-source Speech-To-Text engine, using a model trained by machine learning techniques based on `Baidu's Deep Speech research paper <https://arxiv.org/abs/1412.5567>`_. Project DeepSpeech uses Google's `TensorFlow <https://www.tensorflow.org/>`_ to make the implementation easier.\n\nDocumentation for installation, usage, and training models are available on `deepspeech.readthedocs.io <https://deepspeech.readthedocs.io/?badge=latest>`_.\n\nFor the latest release, including pre-trained models and checkpoints, `see the latest release on GitHub <https://github.com/mozilla/DeepSpeech/releases/latest>`_.\n\nFor contribution guidelines, see `CONTRIBUTING.rst <CONTRIBUTING.rst>`_.\n\nFor contact and support information, see `SUPPORT.rst <SUPPORT.rst>`_.\n"
  },
  {
    "path": "RELEASE.rst",
    "content": "\nMaking a (new) release of the codebase\n======================================\n\n\n* Update version in VERSION file, commit\n* Open PR, ensure all tests are passing properly\n* Merge the PR\n* Fetch the new master, tag it with (hopefully) the same version as in VERSION\n* Push that to Github\n* New build should be triggered and new packages should be made\n* TaskCluster should schedule a merge build **including** a \"DeepSpeech Packages\" task\n"
  },
  {
    "path": "SUPPORT.rst",
    "content": ".. _support:\n\nContact/Getting Help\n====================\n\nThere are several ways to contact us or to get help:\n\n#. `Discourse Forums <https://discourse.mozilla.org/c/deep-speech>`_ - The `Deep Speech category on Discourse <https://discourse.mozilla.org/c/deep-speech>`_ is the first place to look. Search for keywords related to your question or problem to see if someone else has run into it already. If you can't find anything relevant there, search on our `issue tracker <https://github.com/mozilla/deepspeech/issues>`_ to see if there is an existing issue about your problem.\n\n#. `Matrix chat <https://chat.mozilla.org/#/room/#machinelearning:mozilla.org>`_ - If your question is not addressed by either the `FAQ <https://github.com/mozilla/DeepSpeech/wiki#frequently-asked-questions>`_ or `Discourse Forums <https://discourse.mozilla.org/c/deep-speech>`_\\ , you can contact us on the ``#machinelearning`` channel on `Mozilla Matrix <https://chat.mozilla.org/#/room/#machinelearning:mozilla.org>`_\\ ; people there can try to answer/help\n\n#. `Create a new issue <https://github.com/mozilla/deepspeech/issues>`_ - Finally, if you have a bug report or a feature request that isn't already covered by an existing issue, please open an issue in our repo and fill the appropriate information on your hardware and software setup.\n"
  },
  {
    "path": "bazel.patch",
    "content": "diff --git a/src/main/java/com/google/devtools/build/lib/analysis/actions/FileWriteAction.java b/src/main/java/com/google/devtools/build/lib/analysis/actions/FileWriteAction.java\nindex c7aa4cb63..e084bc27c 100644\n--- a/src/main/java/com/google/devtools/build/lib/analysis/actions/FileWriteAction.java\n+++ b/src/main/java/com/google/devtools/build/lib/analysis/actions/FileWriteAction.java\n@@ -28,6 +28,7 @@ import java.io.ByteArrayInputStream;\n import java.io.ByteArrayOutputStream;\n import java.io.IOException;\n import java.io.OutputStream;\n+import java.io.PrintWriter;\n import java.util.zip.GZIPInputStream;\n import java.util.zip.GZIPOutputStream;\n \n@@ -73,6 +74,8 @@ public final class FileWriteAction extends AbstractFileWriteAction {\n    */\n   private final CharSequence fileContents;\n \n+  private final Artifact output;\n+\n   /** Minimum length (in chars) for content to be eligible for compression. */\n   private static final int COMPRESS_CHARS_THRESHOLD = 256;\n \n@@ -90,6 +93,7 @@ public final class FileWriteAction extends AbstractFileWriteAction {\n       fileContents = new CompressedString((String) fileContents);\n     }\n     this.fileContents = fileContents;\n+    this.output = output;\n   }\n \n   /**\n@@ -230,11 +234,32 @@ public final class FileWriteAction extends AbstractFileWriteAction {\n    */\n   @Override\n   protected String computeKey() {\n+    // System.err.println(\"src/main/java/com/google/devtools/build/lib/analysis/actions/FileWriteAction.java => output: \" + output.getExecPath());\n+    // \".ckd\" Compute Key Debug\n+    PrintWriter computeKeyDebugWriter = null;\n+    String computeKeyDebugFile = output.getExecPath() + \".FileWriteAction.ckd\";\n+    try {\n+      computeKeyDebugWriter = new PrintWriter(computeKeyDebugFile, \"UTF-8\");\n+    } catch (java.io.FileNotFoundException ex) {\n+      System.err.println(\"Unable to create \" + computeKeyDebugFile);\n+    } catch (java.io.UnsupportedEncodingException ex) {\n+      System.err.println(\"Unsupported encoding\");\n+    }\n+\n     Fingerprint f = new Fingerprint();\n     f.addString(GUID);\n+    computeKeyDebugWriter.println(\"GUID: \" + GUID);\n+\n     f.addString(String.valueOf(makeExecutable));\n+    computeKeyDebugWriter.println(\"MAKEEXECUTABLE: \" + String.valueOf(makeExecutable));\n+\n     f.addString(getFileContents());\n-    return f.hexDigestAndReset();\n+    computeKeyDebugWriter.println(\"FILECONTENTS: \" + getFileContents());\n+\n+    String rv = f.hexDigestAndReset();\n+    computeKeyDebugWriter.println(\"KEY: \" + rv);\n+    computeKeyDebugWriter.close();\n+    return rv;\n   }\n \n   /**\ndiff --git a/src/main/java/com/google/devtools/build/lib/analysis/actions/SpawnAction.java b/src/main/java/com/google/devtools/build/lib/analysis/actions/SpawnAction.java\nindex 580788160..26883eb92 100644\n--- a/src/main/java/com/google/devtools/build/lib/analysis/actions/SpawnAction.java\n+++ b/src/main/java/com/google/devtools/build/lib/analysis/actions/SpawnAction.java\n@@ -60,6 +60,7 @@ import com.google.devtools.build.lib.util.ShellEscaper;\n import com.google.devtools.build.lib.vfs.PathFragment;\n import com.google.protobuf.GeneratedMessage.GeneratedExtension;\n import java.nio.charset.Charset;\n+import java.io.PrintWriter;\n import java.util.ArrayList;\n import java.util.Collections;\n import java.util.LinkedHashMap;\n@@ -91,6 +92,9 @@ public class SpawnAction extends AbstractAction implements ExecutionInfoSpecifie\n \n   private final CommandLine argv;\n \n+  private final Iterable<Artifact> inputs;\n+  private final Iterable<Artifact> outputs;\n+\n   private final boolean executeUnconditionally;\n   private final boolean isShellCommand;\n   private final String progressMessage;\n@@ -197,6 +201,9 @@ public class SpawnAction extends AbstractAction implements ExecutionInfoSpecifie\n     this.mnemonic = mnemonic;\n     this.executeUnconditionally = executeUnconditionally;\n     this.extraActionInfoSupplier = extraActionInfoSupplier;\n+\n+    this.inputs = inputs;\n+    this.outputs = outputs;\n   }\n \n   @Override\n@@ -312,23 +319,89 @@ public class SpawnAction extends AbstractAction implements ExecutionInfoSpecifie\n \n   @Override\n   protected String computeKey() {\n+    boolean genruleSetup = String.valueOf(Iterables.get(inputs, 0).getExecPath()).contains(\"genrule/genrule-setup.sh\");\n+    boolean validGenrule = genruleSetup && (Iterables.size(inputs) > 1);\n+\n+    String genruleScript = null;\n+    if (validGenrule) {\n+      genruleScript = String.valueOf(Iterables.get(inputs, 1).getExecPath());\n+    }\n+\n+    // \".ckd\" Compute Key Debug\n+    PrintWriter computeKeyDebugWriter = null;\n+    if (validGenrule) {\n+      String computeKeyDebugFile = genruleScript + \".SpawnAction.ckd\";\n+      try {\n+        computeKeyDebugWriter = new PrintWriter(computeKeyDebugFile, \"UTF-8\");\n+      } catch (java.io.FileNotFoundException ex) {\n+        System.err.println(\"Unable to create \" + computeKeyDebugFile);\n+      } catch (java.io.UnsupportedEncodingException ex) {\n+        System.err.println(\"Unsupported encoding\");\n+      }\n+    }\n+\n+    validGenrule = validGenrule && (computeKeyDebugWriter != null);\n+\n     Fingerprint f = new Fingerprint();\n     f.addString(GUID);\n+    if (validGenrule) { computeKeyDebugWriter.println(\"GUID: \" + GUID); }\n+\n     f.addStrings(argv.arguments());\n+    if (validGenrule) {\n+      for (String input : argv.arguments()) {\n+        computeKeyDebugWriter.println(\"ARGUMENTS: \" + input);\n+      }\n+    }\n+\n     f.addString(getMnemonic());\n+    if (validGenrule) { computeKeyDebugWriter.println(\"MNEMONIC: \" + getMnemonic()); }\n+\n     // We don't need the toolManifests here, because they are a subset of the inputManifests by\n     // definition and the output of an action shouldn't change whether something is considered a\n     // tool or not.\n     f.addPaths(getRunfilesSupplier().getRunfilesDirs());\n+    if (validGenrule) {\n+      for (PathFragment path : getRunfilesSupplier().getRunfilesDirs()) {\n+        computeKeyDebugWriter.println(\"RUNFILESDIRS: \" + path.getPathString());\n+      }\n+    }\n+\n     ImmutableList<Artifact> runfilesManifests = getRunfilesSupplier().getManifests();\n     f.addInt(runfilesManifests.size());\n+    if (validGenrule) { computeKeyDebugWriter.println(\"RUNFILESMANIFESTSSIZE: \" + runfilesManifests.size()); }\n+\n     for (Artifact runfilesManifest : runfilesManifests) {\n       f.addPath(runfilesManifest.getExecPath());\n+      if (validGenrule) { computeKeyDebugWriter.println(\"RUNFILESMANIFEST: \" + runfilesManifest.getExecPath().getPathString()); }\n     }\n+\n     f.addStringMap(getEnvironment());\n+    if (validGenrule) {\n+      for (Map.Entry<String, String> entry : getEnvironment().entrySet()) {\n+        computeKeyDebugWriter.println(\"ENV: \" + entry.getKey() + \"=\" + entry.getValue());\n+      }\n+    }\n+\n     f.addStrings(getClientEnvironmentVariables());\n+    if (validGenrule) {\n+      for (String input : argv.arguments()) {\n+        computeKeyDebugWriter.println(\"CLIENTENV: \" + input);\n+      }\n+    }\n+\n     f.addStringMap(getExecutionInfo());\n-    return f.hexDigestAndReset();\n+    if (validGenrule) {\n+      for (Map.Entry<String, String> entry : executionInfo.entrySet()) {\n+        computeKeyDebugWriter.println(\"EXECINFO: \" + entry.getKey() + \"=\" + entry.getValue());\n+      }\n+    }\n+\n+    String rv = f.hexDigestAndReset();\n+    if (validGenrule) {\n+      computeKeyDebugWriter.println(\"KEY: \" + rv);\n+      computeKeyDebugWriter.close();\n+    }\n+    return rv;\n   }\n \n   @Override\ndiff --git a/src/main/java/com/google/devtools/build/lib/rules/cpp/CppCompileAction.java b/src/main/java/com/google/devtools/build/lib/rules/cpp/CppCompileAction.java\nindex 3559fffde..3ba39617c 100644\n--- a/src/main/java/com/google/devtools/build/lib/rules/cpp/CppCompileAction.java\n+++ b/src/main/java/com/google/devtools/build/lib/rules/cpp/CppCompileAction.java\n@@ -1111,10 +1111,30 @@ public class CppCompileAction extends AbstractAction\n \n   @Override\n   public String computeKey() {\n+    // \".ckd\" Compute Key Debug\n+    PrintWriter computeKeyDebugWriter = null;\n+    String computeKeyDebugFile = getInternalOutputFile() + \".CppCompileAction.ckd\";\n+    try {\n+      computeKeyDebugWriter = new PrintWriter(computeKeyDebugFile, \"UTF-8\");\n+    } catch (java.io.FileNotFoundException ex) {\n+      System.err.println(\"Unable to create \" + computeKeyDebugFile);\n+    } catch (java.io.UnsupportedEncodingException ex) {\n+      System.err.println(\"Unsupported encoding\");\n+    }\n+\n     Fingerprint f = new Fingerprint();\n     f.addUUID(actionClassId);\n+    computeKeyDebugWriter.println(\"UUID: \" + actionClassId);\n+\n     f.addStringMap(getEnvironment());\n+    for (Map.Entry<String, String> entry : getEnvironment().entrySet()) {\n+      computeKeyDebugWriter.println(\"ENV: \" + entry.getKey() + \"=\" + entry.getValue());\n+    }\n+\n     f.addStringMap(executionInfo);\n+    for (Map.Entry<String, String> entry : executionInfo.entrySet()) {\n+      computeKeyDebugWriter.println(\"EXECINFO: \" + entry.getKey() + \"=\" + entry.getValue());\n+    }\n \n     // For the argv part of the cache key, ignore all compiler flags that explicitly denote module\n     // file (.pcm) inputs. Depending on input discovery, some of the unused ones are removed from\n@@ -1124,6 +1144,9 @@ public class CppCompileAction extends AbstractAction\n     // A better long-term solution would be to make the compiler to find them automatically and\n     // never hand in the .pcm files explicitly on the command line in the first place.\n     f.addStrings(compileCommandLine.getArgv(getInternalOutputFile(), null));\n+    for (String input : compileCommandLine.getArgv(getInternalOutputFile(), null)) {\n+      computeKeyDebugWriter.println(\"COMMAND: \" + input);\n+    }\n \n     /*\n      * getArgv() above captures all changes which affect the compilation\n@@ -1133,19 +1156,31 @@ public class CppCompileAction extends AbstractAction\n      * have changed, otherwise we might miss some errors.\n      */\n     f.addPaths(context.getDeclaredIncludeDirs());\n+    for (PathFragment path : context.getDeclaredIncludeDirs()) {\n+      computeKeyDebugWriter.println(\"DECLAREDINCLUDEDIRS: \" + path.getPathString());\n+    }\n     f.addPaths(context.getDeclaredIncludeWarnDirs());\n+    for (PathFragment path : context.getDeclaredIncludeWarnDirs()) {\n+      computeKeyDebugWriter.println(\"DECLAREDINCLUDEWARNDIRS: \" + path.getPathString());\n+    }\n     for (Artifact declaredIncludeSrc : context.getDeclaredIncludeSrcs()) {\n       f.addPath(declaredIncludeSrc.getExecPath());\n+      computeKeyDebugWriter.println(\"DECLAREDINCLUDESRCS: \" + declaredIncludeSrc.getExecPath().getPathString());\n     }\n     f.addInt(0);  // mark the boundary between input types\n     for (Artifact input : getMandatoryInputs()) {\n       f.addPath(input.getExecPath());\n+      computeKeyDebugWriter.println(\"MANDATORYINPUTS: \" + input.getExecPath().getPathString());\n     }\n     f.addInt(0);\n     for (Artifact input : prunableInputs) {\n       f.addPath(input.getExecPath());\n+      computeKeyDebugWriter.println(\"PRUNABLEINPUTS: \" + input.getExecPath().getPathString());\n     }\n-    return f.hexDigestAndReset();\n+    String rv = f.hexDigestAndReset();\n+    computeKeyDebugWriter.println(\"KEY: \" + rv);\n+    computeKeyDebugWriter.close();\n+    return rv;\n   }\n \n   @Override\n"
  },
  {
    "path": "bin/README.rst",
    "content": "Utility scripts\n===============\n\nThis folder contains scripts that can be used to do training on the various included importers from the command line. This is useful to be able to run training without a browser open, or unattended on a remote machine. They should be run from the base directory of the repository. Note that the default settings assume a very well-specified machine. In the situation that out-of-memory errors occur, you may find decreasing the values of ``--train_batch_size``\\ , ``--dev_batch_size`` and ``--test_batch_size`` will allow you to continue, at the expense of speed.\n"
  },
  {
    "path": "bin/compare_samples.py",
    "content": "#!/usr/bin/env python\n\"\"\"\nTool for comparing two wav samples\n\"\"\"\nimport sys\nimport argparse\nimport numpy as np\n\nfrom deepspeech_training.util.audio import AUDIO_TYPE_NP, mean_dbfs\nfrom deepspeech_training.util.sample_collections import load_sample\n\n\ndef fail(message):\n    print(message, file=sys.stderr, flush=True)\n    sys.exit(1)\n\n\ndef compare_samples():\n    sample1 = load_sample(CLI_ARGS.sample1).unpack()\n    sample2 = load_sample(CLI_ARGS.sample2).unpack()\n    if sample1.audio_format != sample2.audio_format:\n        fail('Samples differ on: audio-format ({} and {})'.format(sample1.audio_format, sample2.audio_format))\n    if abs(sample1.duration - sample2.duration) > 0.001:\n        fail('Samples differ on: duration ({} and {})'.format(sample1.duration, sample2.duration))\n    sample1.change_audio_type(AUDIO_TYPE_NP)\n    sample2.change_audio_type(AUDIO_TYPE_NP)\n    samples = [sample1, sample2]\n    largest = np.argmax([sample1.audio.shape[0], sample2.audio.shape[0]])\n    smallest = (largest + 1) % 2\n    samples[largest].audio = samples[largest].audio[:len(samples[smallest].audio)]\n    audio_diff = samples[largest].audio - samples[smallest].audio\n    diff_dbfs = mean_dbfs(audio_diff)\n    differ_msg = 'Samples differ on: sample data ({:0.2f} dB difference) '.format(diff_dbfs)\n    equal_msg = 'Samples are considered equal ({:0.2f} dB difference)'.format(diff_dbfs)\n    if CLI_ARGS.if_differ:\n        if diff_dbfs <= CLI_ARGS.threshold:\n            fail(equal_msg)\n        if not CLI_ARGS.no_success_output:\n            print(differ_msg, file=sys.stderr, flush=True)\n    else:\n        if diff_dbfs > CLI_ARGS.threshold:\n            fail(differ_msg)\n        if not CLI_ARGS.no_success_output:\n            print(equal_msg, file=sys.stderr, flush=True)\n\n\ndef handle_args():\n    parser = argparse.ArgumentParser(\n        description=\"Tool for checking similarity of two samples\"\n    )\n    parser.add_argument(\"sample1\", help=\"Filename of sample 1 to compare\")\n    parser.add_argument(\"sample2\", help=\"Filename of sample 2 to compare\")\n    parser.add_argument(\"--threshold\", type=float, default=-60.0,\n                        help=\"dB of sample deltas above which they are considered different\")\n    parser.add_argument(\n        \"--if-differ\",\n        action=\"store_true\",\n        help=\"If to succeed and return status code 0 on different signals and fail on equal ones (inverse check).\"\n             \"This will still fail on different formats or durations.\",\n    )\n    parser.add_argument(\n        \"--no-success-output\",\n        action=\"store_true\",\n        help=\"Stay silent on success (if samples are equal of - with --if-differ - samples are not equal)\",\n    )\n    return parser.parse_args()\n\n\nif __name__ == \"__main__\":\n    CLI_ARGS = handle_args()\n    compare_samples()\n"
  },
  {
    "path": "bin/data_set_tool.py",
    "content": "#!/usr/bin/env python\n'''\nTool for building a combined SDB or CSV sample-set from other sets\nUse 'python3 data_set_tool.py -h' for help\n'''\nimport sys\nimport argparse\nimport progressbar\nfrom pathlib import Path\n\nfrom deepspeech_training.util.audio import (\n    AUDIO_TYPE_PCM,\n    AUDIO_TYPE_OPUS,\n    AUDIO_TYPE_WAV,\n    change_audio_types,\n)\nfrom deepspeech_training.util.downloader import SIMPLE_BAR\nfrom deepspeech_training.util.sample_collections import (\n    CSVWriter,\n    DirectSDBWriter,\n    TarWriter,\n    samples_from_sources,\n)\nfrom deepspeech_training.util.augmentations import (\n    parse_augmentations,\n    apply_sample_augmentations,\n    SampleAugmentation\n)\n\nAUDIO_TYPE_LOOKUP = {'wav': AUDIO_TYPE_WAV, 'opus': AUDIO_TYPE_OPUS}\n\n\ndef build_data_set():\n    audio_type = AUDIO_TYPE_LOOKUP[CLI_ARGS.audio_type]\n    augmentations = parse_augmentations(CLI_ARGS.augment)\n    if any(not isinstance(a, SampleAugmentation) for a in augmentations):\n        print('Warning: Some of the specified augmentations will not get applied, as this tool only supports '\n              'overlay, codec, reverb, resample and volume.')\n    extension = Path(CLI_ARGS.target).suffix.lower()\n    labeled = not CLI_ARGS.unlabeled\n    if extension == '.csv':\n        writer = CSVWriter(CLI_ARGS.target, absolute_paths=CLI_ARGS.absolute_paths, labeled=labeled)\n    elif extension == '.sdb':\n        writer = DirectSDBWriter(CLI_ARGS.target, audio_type=audio_type, labeled=labeled)\n    elif extension == '.tar':\n        writer = TarWriter(CLI_ARGS.target, labeled=labeled, gz=False, include=CLI_ARGS.include)\n    elif extension == '.tgz' or CLI_ARGS.target.lower().endswith('.tar.gz'):\n        writer = TarWriter(CLI_ARGS.target, labeled=labeled, gz=True, include=CLI_ARGS.include)\n    else:\n        print('Unknown extension of target file - has to be either .csv, .sdb, .tar, .tar.gz or .tgz')\n        sys.exit(1)\n    with writer:\n        samples = samples_from_sources(CLI_ARGS.sources, labeled=not CLI_ARGS.unlabeled)\n        num_samples = len(samples)\n        if augmentations:\n            samples = apply_sample_augmentations(samples, audio_type=AUDIO_TYPE_PCM, augmentations=augmentations)\n        bar = progressbar.ProgressBar(max_value=num_samples, widgets=SIMPLE_BAR)\n        for sample in bar(change_audio_types(\n                samples,\n                audio_type=audio_type,\n                bitrate=CLI_ARGS.bitrate,\n                processes=CLI_ARGS.workers)):\n            writer.add(sample)\n\n\ndef handle_args():\n    parser = argparse.ArgumentParser(\n        description='Tool for building a combined SDB or CSV sample-set from other sets'\n    )\n    parser.add_argument(\n        'sources',\n        nargs='+',\n        help='Source CSV and/or SDB files - '\n        'Note: For getting a correctly ordered target set, source SDBs have to have their samples '\n        'already ordered from shortest to longest.',\n    )\n    parser.add_argument(\n        'target',\n        help='SDB, CSV or TAR(.gz) file to create'\n    )\n    parser.add_argument(\n        '--audio-type',\n        default='opus',\n        choices=AUDIO_TYPE_LOOKUP.keys(),\n        help='Audio representation inside target SDB',\n    )\n    parser.add_argument(\n        '--bitrate',\n        type=int,\n        help='Bitrate for lossy compressed SDB samples like in case of --audio-type opus',\n    )\n    parser.add_argument(\n        '--workers', type=int, default=None, help='Number of encoding SDB workers'\n    )\n    parser.add_argument(\n        '--unlabeled',\n        action='store_true',\n        help='If to build an data-set with unlabeled (audio only) samples - '\n        'typically used for building noise augmentation corpora',\n    )\n    parser.add_argument(\n        '--absolute-paths',\n        action='store_true',\n        help='If to reference samples by their absolute paths when writing CSV files',\n    )\n    parser.add_argument(\n        '--augment',\n        action='append',\n        help='Add an augmentation operation',\n    )\n    parser.add_argument(\n        '--include',\n        action='append',\n        help='Adds a file to the root directory of .tar(.gz) targets',\n    )\n    return parser.parse_args()\n\n\nif __name__ == '__main__':\n    CLI_ARGS = handle_args()\n    build_data_set()\n"
  },
  {
    "path": "bin/graphdef_binary_to_text.py",
    "content": "#!/usr/bin/env python\n# -*- coding: utf-8 -*-\n\nimport sys\n\nimport tensorflow.compat.v1 as tfv1\nfrom google.protobuf import text_format\n\n\ndef main():\n    # Load and export as string\n    with tfv1.gfile.FastGFile(sys.argv[1], \"rb\") as fin:\n        graph_def = tfv1.GraphDef()\n        graph_def.ParseFromString(fin.read())\n\n        with tfv1.gfile.FastGFile(sys.argv[1] + \"txt\", \"w\") as fout:\n            fout.write(text_format.MessageToString(graph_def))\n\n\nif __name__ == \"__main__\":\n    main()\n"
  },
  {
    "path": "bin/import_aidatatang.py",
    "content": "#!/usr/bin/env python\nimport glob\nimport os\nimport tarfile\n\nimport pandas\n\nfrom deepspeech_training.util.importers import get_importers_parser\n\nCOLUMN_NAMES = [\"wav_filename\", \"wav_filesize\", \"transcript\"]\n\n\ndef extract(archive_path, target_dir):\n    print(\"Extracting {} into {}...\".format(archive_path, target_dir))\n    with tarfile.open(archive_path) as tar:\n        tar.extractall(target_dir)\n\n\ndef preprocess_data(tgz_file, target_dir):\n    # First extract main archive and sub-archives\n    extract(tgz_file, target_dir)\n    main_folder = os.path.join(target_dir, \"aidatatang_200zh\")\n\n    for targz in glob.glob(os.path.join(main_folder, \"corpus\", \"*\", \"*.tar.gz\")):\n        extract(targz, os.path.dirname(targz))\n\n    # Folder structure is now:\n    # - aidatatang_200zh/\n    #   - transcript/aidatatang_200_zh_transcript.txt\n    #   - corpus/train/*.tar.gz\n    #   - corpus/train/*/*.{wav,txt,trn,metadata}\n    #   - corpus/dev/*.tar.gz\n    #   - corpus/dev/*/*.{wav,txt,trn,metadata}\n    #   - corpus/test/*.tar.gz\n    #   - corpus/test/*/*.{wav,txt,trn,metadata}\n\n    # Transcripts file has one line per WAV file, where each line consists of\n    # the WAV file name without extension followed by a single space followed\n    # by the transcript.\n\n    # Since the transcripts themselves can contain spaces, we split on space but\n    # only once, then build a mapping from file name to transcript\n    transcripts_path = os.path.join(\n        main_folder, \"transcript\", \"aidatatang_200_zh_transcript.txt\"\n    )\n    with open(transcripts_path) as fin:\n        transcripts = dict((line.split(\" \", maxsplit=1) for line in fin))\n\n    def load_set(glob_path):\n        set_files = []\n        for wav in glob.glob(glob_path):\n            try:\n                wav_filename = wav\n                wav_filesize = os.path.getsize(wav)\n                transcript_key = os.path.splitext(os.path.basename(wav))[0]\n                transcript = transcripts[transcript_key].strip(\"\\n\")\n                set_files.append((wav_filename, wav_filesize, transcript))\n            except KeyError:\n                print(\"Warning: Missing transcript for WAV file {}.\".format(wav))\n        return set_files\n\n    for subset in (\"train\", \"dev\", \"test\"):\n        print(\"Loading {} set samples...\".format(subset))\n        subset_files = load_set(\n            os.path.join(main_folder, \"corpus\", subset, \"*\", \"*.wav\")\n        )\n        df = pandas.DataFrame(data=subset_files, columns=COLUMN_NAMES)\n\n        # Trim train set to under 10s by removing the last couple hundred samples\n        if subset == \"train\":\n            durations = (df[\"wav_filesize\"] - 44) / 16000 / 2\n            df = df[durations <= 10.0]\n            print(\"Trimming {} samples > 10 seconds\".format((durations > 10.0).sum()))\n\n        dest_csv = os.path.join(target_dir, \"aidatatang_{}.csv\".format(subset))\n        print(\"Saving {} set into {}...\".format(subset, dest_csv))\n        df.to_csv(dest_csv, index=False)\n\n\ndef main():\n    # https://www.openslr.org/62/\n    parser = get_importers_parser(description=\"Import aidatatang_200zh corpus\")\n    parser.add_argument(\"tgz_file\", help=\"Path to aidatatang_200zh.tgz\")\n    parser.add_argument(\n        \"--target_dir\",\n        default=\"\",\n        help=\"Target folder to extract files into and put the resulting CSVs. Defaults to same folder as the main archive.\",\n    )\n    params = parser.parse_args()\n\n    if not params.target_dir:\n        params.target_dir = os.path.dirname(params.tgz_file)\n\n    preprocess_data(params.tgz_file, params.target_dir)\n\n\nif __name__ == \"__main__\":\n    main()\n"
  },
  {
    "path": "bin/import_aishell.py",
    "content": "#!/usr/bin/env python\nimport glob\nimport os\nimport tarfile\n\nimport pandas\n\nfrom deepspeech_training.util.importers import get_importers_parser\n\nCOLUMNNAMES = [\"wav_filename\", \"wav_filesize\", \"transcript\"]\n\n\ndef extract(archive_path, target_dir):\n    print(\"Extracting {} into {}...\".format(archive_path, target_dir))\n    with tarfile.open(archive_path) as tar:\n        tar.extractall(target_dir)\n\n\ndef preprocess_data(tgz_file, target_dir):\n    # First extract main archive and sub-archives\n    extract(tgz_file, target_dir)\n    main_folder = os.path.join(target_dir, \"data_aishell\")\n\n    wav_archives_folder = os.path.join(main_folder, \"wav\")\n    for targz in glob.glob(os.path.join(wav_archives_folder, \"*.tar.gz\")):\n        extract(targz, main_folder)\n\n    # Folder structure is now:\n    # - data_aishell/\n    #   - train/S****/*.wav\n    #   - dev/S****/*.wav\n    #   - test/S****/*.wav\n    #   - wav/S****.tar.gz\n    #   - transcript/aishell_transcript_v0.8.txt\n\n    # Transcripts file has one line per WAV file, where each line consists of\n    # the WAV file name without extension followed by a single space followed\n    # by the transcript.\n\n    # Since the transcripts themselves can contain spaces, we split on space but\n    # only once, then build a mapping from file name to transcript\n    transcripts_path = os.path.join(\n        main_folder, \"transcript\", \"aishell_transcript_v0.8.txt\"\n    )\n    with open(transcripts_path) as fin:\n        transcripts = dict((line.split(\" \", maxsplit=1) for line in fin))\n\n    def load_set(glob_path):\n        set_files = []\n        for wav in glob.glob(glob_path):\n            try:\n                wav_filename = wav\n                wav_filesize = os.path.getsize(wav)\n                transcript_key = os.path.splitext(os.path.basename(wav))[0]\n                transcript = transcripts[transcript_key].strip(\"\\n\")\n                set_files.append((wav_filename, wav_filesize, transcript))\n            except KeyError:\n                print(\"Warning: Missing transcript for WAV file {}.\".format(wav))\n        return set_files\n\n    for subset in (\"train\", \"dev\", \"test\"):\n        print(\"Loading {} set samples...\".format(subset))\n        subset_files = load_set(os.path.join(main_folder, subset, \"S*\", \"*.wav\"))\n        df = pandas.DataFrame(data=subset_files, columns=COLUMNNAMES)\n\n        # Trim train set to under 10s by removing the last couple hundred samples\n        if subset == \"train\":\n            durations = (df[\"wav_filesize\"] - 44) / 16000 / 2\n            df = df[durations <= 10.0]\n            print(\"Trimming {} samples > 10 seconds\".format((durations > 10.0).sum()))\n\n        dest_csv = os.path.join(target_dir, \"aishell_{}.csv\".format(subset))\n        print(\"Saving {} set into {}...\".format(subset, dest_csv))\n        df.to_csv(dest_csv, index=False)\n\n\ndef main():\n    # http://www.openslr.org/33/\n    parser = get_importers_parser(description=\"Import AISHELL corpus\")\n    parser.add_argument(\"aishell_tgz_file\", help=\"Path to data_aishell.tgz\")\n    parser.add_argument(\n        \"--target_dir\",\n        default=\"\",\n        help=\"Target folder to extract files into and put the resulting CSVs. Defaults to same folder as the main archive.\",\n    )\n    params = parser.parse_args()\n\n    if not params.target_dir:\n        params.target_dir = os.path.dirname(params.aishell_tgz_file)\n\n    preprocess_data(params.aishell_tgz_file, params.target_dir)\n\n\nif __name__ == \"__main__\":\n    main()\n"
  },
  {
    "path": "bin/import_ccpmf.py",
    "content": "#!/usr/bin/env python\n\"\"\"\nImporter for dataset published from Centre de Conférence Pierre Mendès-France\nMinistère de l'Économie, des Finances et de la Relance\n\"\"\"\n\nimport csv\nimport sys\nimport os\nimport progressbar\nimport subprocess\nimport zipfile\nfrom glob import glob\nfrom multiprocessing import Pool\n\nimport hashlib\nimport decimal\nimport math\nimport unicodedata\nimport re\nimport sox\nimport xml.etree.ElementTree as ET\n\ntry:\n    from num2words import num2words\nexcept ImportError as ex:\n    print(\"pip install num2words\")\n    sys.exit(1)\n\nimport requests\nimport json\n\nfrom deepspeech_training.util.downloader import SIMPLE_BAR, maybe_download\nfrom deepspeech_training.util.helpers import secs_to_hours\nfrom deepspeech_training.util.importers import (\n    get_counter,\n    get_importers_parser,\n    get_imported_samples,\n    get_validate_label,\n    print_import_report,\n)\nfrom ds_ctcdecoder import Alphabet\n\nFIELDNAMES = [\"wav_filename\", \"wav_filesize\", \"transcript\"]\nSAMPLE_RATE = 16000\nCHANNELS = 1\nBIT_DEPTH = 16\nMAX_SECS = 10\nMIN_SECS = 0.85\n\nDATASET_RELEASE_CSV = \"https://data.economie.gouv.fr/explore/dataset/transcriptionsxml_audiomp3_mefr_ccpmf_2012-2020/download/?format=csv&timezone=Europe/Berlin&lang=fr&use_labels_for_header=true&csv_separator=%3B\"\nDATASET_RELEASE_SHA = [\n    (\"863d39a06a388c6491c6ff2f6450b151f38f1b57\", \"transcriptionsxml_audiomp3_mefr_ccpmf_2012-2020_2.zip.001\"),\n    (\"2f3a0305aa04c61220bb00b5a4e553e45dbf12e1\", \"transcriptionsxml_audiomp3_mefr_ccpmf_2012-2020_2.zip.002\"),\n    (\"5e55e9f1f844097349188ac875947e5a3d7fe9f1\", \"transcriptionsxml_audiomp3_mefr_ccpmf_2012-2020_2.zip.003\"),\n    (\"8bf54842cf07948ca5915e27a8bd5fa5139c06ae\", \"transcriptionsxml_audiomp3_mefr_ccpmf_2012-2020_2.zip.004\"),\n    (\"c8963504aadc015ac48f9af80058a0bb3440b94f\", \"transcriptionsxml_audiomp3_mefr_ccpmf_2012-2020_2.zip.005\"),\n    (\"d95e225e908621d83ce4e9795fd108d9d310e244\", \"transcriptionsxml_audiomp3_mefr_ccpmf_2012-2020_2.zip.006\"),\n    (\"de6ed9c2b0ee80ca879aae8ba7923cc93217d811\", \"transcriptionsxml_audiomp3_mefr_ccpmf_2012-2020_2.zip.007\"),\n    (\"234283c47dacfcd4450d836c52c25f3e807fc5f2\", \"transcriptionsxml_audiomp3_mefr_ccpmf_2012-2020_2.zip.008\"),\n    (\"4e6b67a688639bb72f8cd81782eaba604a8d32a6\", \"transcriptionsxml_audiomp3_mefr_ccpmf_2012-2020_2.zip.009\"),\n    (\"4165a51389777c8af8e6253d87bdacb877e8b3b0\", \"transcriptionsxml_audiomp3_mefr_ccpmf_2012-2020_2.zip.010\"),\n    (\"34322e7009780d97ef5bd02bf2f2c7a31f00baff\", \"transcriptionsxml_audiomp3_mefr_ccpmf_2012-2020_2.zip.011\"),\n    (\"48c5be3b2ca9d6108d525da6a03e91d93a95dbac\", \"transcriptionsxml_audiomp3_mefr_ccpmf_2012-2020_2.zip.012\"),\n    (\"87573172f506a189c2ebc633856fe11a2e9cd213\", \"transcriptionsxml_audiomp3_mefr_ccpmf_2012-2020_2.zip.013\"),\n    (\"6ab2c9e508e9278d5129f023e018725c4a7c69e8\", \"transcriptionsxml_audiomp3_mefr_ccpmf_2012-2020_2.zip.014\"),\n    (\"4f84df831ef46dce5d3ab3e21817687a2d8c12d0\", \"transcriptionsxml_audiomp3_mefr_ccpmf_2012-2020_2.zip.015\"),\n    (\"e69bfb079885c299cb81080ef88b1b8b57158aa6\", \"transcriptionsxml_audiomp3_mefr_ccpmf_2012-2020_2.zip.016\"),\n    (\"5f764ba788ee273981cf211b242c29b49ca22c5e\", \"transcriptionsxml_audiomp3_mefr_ccpmf_2012-2020_2.zip.017\"),\n    (\"b6aa81a959525363223494830c1e7307d4c4bae6\", \"transcriptionsxml_audiomp3_mefr_ccpmf_2012-2020_2.zip.018\"),\n    (\"91ddcf43c7bf113a6f2528b857c7ec22a50a148a\", \"transcriptionsxml_audiomp3_mefr_ccpmf_2012-2020_2.zip.019\"),\n    (\"fa1b29273dd77b9a7494983a2f9ae52654b931d7\", \"transcriptionsxml_audiomp3_mefr_ccpmf_2012-2020_2.zip.020\"),\n    (\"1113aef4f5e2be2f7fbf2d54b6c710c1c0e7135f\", \"transcriptionsxml_audiomp3_mefr_ccpmf_2012-2020_2.zip.021\"),\n    (\"ce6420d5d0b6b5135ba559f83e1a82d4d615c470\", \"transcriptionsxml_audiomp3_mefr_ccpmf_2012-2020_2.zip.022\"),\n    (\"d0976ed292ac24fcf1590d1ea195077c74b05471\", \"transcriptionsxml_audiomp3_mefr_ccpmf_2012-2020_2.zip.023\"),\n    (\"ec746cd6af066f62d9bf8d3b2f89174783ff4e3c\", \"transcriptionsxml_audiomp3_mefr_ccpmf_2012-2020_2.zip.024\"),\n    (\"570d9e1e84178e32fd867171d4b3aaecda1fd4fb\", \"transcriptionsxml_audiomp3_mefr_ccpmf_2012-2020_2.zip.025\"),\n    (\"c29ccc7467a75b2cae3d7f2e9fbbb2ab276cb8ac\", \"transcriptionsxml_audiomp3_mefr_ccpmf_2012-2020_2.zip.026\"),\n    (\"08406a51146d88e208704ce058c060a1e44efa50\", \"transcriptionsxml_audiomp3_mefr_ccpmf_2012-2020_2.zip.027\"),\n    (\"199aedad733a78ea1e7d47def9c71c6fd5795e02\", \"transcriptionsxml_audiomp3_mefr_ccpmf_2012-2020_2.zip.028\"),\n    (\"db856a068f92fb4f01f410bba42c7271de0f231a\", \"transcriptionsxml_audiomp3_mefr_ccpmf_2012-2020_2.zip.029\"),\n    (\"e3c0135f16c6c9d25a09dcb4f99a685438a84740\", \"transcriptionsxml_audiomp3_mefr_ccpmf_2012-2020_2.zip.030\"),\n    (\"e51b8bb9c0ae4339f98b4f21e6d29b825109f0ac\", \"transcriptionsxml_audiomp3_mefr_ccpmf_2012-2020_2.zip.031\"),\n    (\"be5e80cbc49b59b31ae33c30576ef0e1a162d84e\", \"transcriptionsxml_audiomp3_mefr_ccpmf_2012-2020_2.zip.032\"),\n    (\"501df58e3ff55fcfd75b93dab57566dc536948b8\", \"transcriptionsxml_audiomp3_mefr_ccpmf_2012-2020_2.zip.033\"),\n    (\"1a114875811a8cdcb8d85a9f6dbee78be3e05131\", \"transcriptionsxml_audiomp3_mefr_ccpmf_2012-2020_2.zip.034\"),\n    (\"465d824e7ee46448369182c0c28646d155a2249b\", \"transcriptionsxml_audiomp3_mefr_ccpmf_2012-2020_2.zip.035\"),\n    (\"37f341b1b266d143eb73138c31cfff3201b9d619\", \"transcriptionsxml_audiomp3_mefr_ccpmf_2012-2020_2.zip.036\"),\n    (\"9e7d8255987a8a77a90e0d4b55c8fd38b9fb5694\", \"transcriptionsxml_audiomp3_mefr_ccpmf_2012-2020_2.zip.037\"),\n    (\"54886755630cb080a53098cb1b6c951c6714a143\", \"transcriptionsxml_audiomp3_mefr_ccpmf_2012-2020_2.zip.038\"),\n    (\"4b7cbb0154697be795034f7a49712e882a97197a\", \"transcriptionsxml_audiomp3_mefr_ccpmf_2012-2020_2.zip.039\"),\n    (\"c8e1e565a0e7a1f6ff1dbfcefe677aa74a41d2f2\", \"transcriptionsxml_audiomp3_mefr_ccpmf_2012-2020_2.zip.040\"),\n]\n\ndef _download_and_preprocess_data(csv_url, target_dir):\n    dataset_sources = os.path.join(target_dir, \"transcriptionsXML_audioMP3_MEFR_CCPMF_2012-2020\", \"data.txt\")\n    if os.path.exists(dataset_sources):\n        return dataset_sources\n\n    # Making path absolute\n    target_dir = os.path.abspath(target_dir)\n    csv_ref = requests.get(csv_url).text.split('\\r\\n')[1:-1]\n    for part in csv_ref:\n        part_filename = requests.head(part).headers.get(\"Content-Disposition\").split(\" \")[1].split(\"=\")[1].replace('\"', \"\")\n        if not os.path.exists(os.path.join(target_dir, part_filename)):\n            part_path = maybe_download(part_filename, target_dir, part)\n\n    def _big_sha1(fname):\n        s = hashlib.sha1()\n        buffer_size = 65536\n        with open(fname, \"rb\") as f:\n            while True:\n                data = f.read(buffer_size)\n                if not data:\n                    break\n                s.update(data)\n        return s.hexdigest()\n\n    for (sha1, filename) in DATASET_RELEASE_SHA:\n        print(\"Checking {} SHA1:\".format(filename))\n        csum = _big_sha1(os.path.join(target_dir, filename))\n        if csum == sha1:\n            print(\"\\t{}: OK {}\".format(filename, sha1))\n        else:\n            print(\"\\t{}: ERROR: expected {}, computed {}\".format(filename, sha1, csum))\n        assert csum == sha1\n\n    # Conditionally extract data\n    _maybe_extract(target_dir, \"transcriptionsXML_audioMP3_MEFR_CCPMF_2012-2020\", \"transcriptionsxml_audiomp3_mefr_ccpmf_2012-2020_2.zip\", \"transcriptionsXML_audioMP3_MEFR_CCPMF_2012-2020.zip\")\n\n    # Produce source text for extraction / conversion\n    return _maybe_create_sources(os.path.join(target_dir, \"transcriptionsXML_audioMP3_MEFR_CCPMF_2012-2020\"))\n\ndef _maybe_extract(target_dir, extracted_data, archive, final):\n    # If target_dir/extracted_data does not exist, extract archive in target_dir\n    extracted_path = os.path.join(target_dir, extracted_data)\n    archive_path = os.path.join(target_dir, archive)\n    final_archive = os.path.join(extracted_path, final)\n\n    if not os.path.exists(extracted_path):\n        if not os.path.exists(archive_path):\n            print('No archive \"%s\" - building ...' % archive_path)\n            all_zip_parts = glob(archive_path + \".*\")\n            all_zip_parts.sort()\n            cmdline = \"cat {} > {}\".format(\" \".join(all_zip_parts), archive_path)\n            print('Building with \"%s\"' % cmdline)\n            subprocess.check_call(cmdline, shell=True, cwd=target_dir)\n            assert os.path.exists(archive_path)\n\n        print('No directory \"%s\" - extracting archive %s ...' % (extracted_path, archive_path))\n        with zipfile.ZipFile(archive_path) as zip_f:\n            zip_f.extractall(extracted_path)\n\n        with zipfile.ZipFile(final_archive) as zip_f:\n            zip_f.extractall(target_dir)\n    else:\n        print('Found directory \"%s\" - not extracting it from archive.' % extracted_path)\n\ndef _maybe_create_sources(dir):\n    dataset_sources = os.path.join(dir, \"data.txt\")\n    MP3 = glob(os.path.join(dir, \"**\", \"*.mp3\"))\n    XML = glob(os.path.join(dir, \"**\", \"*.xml\"))\n\n    MP3_XML_Scores = []\n    MP3_XML_Fin = {}\n\n    for f_mp3 in MP3:\n        for f_xml in XML:\n            b_mp3 = os.path.splitext(os.path.basename(f_mp3))[0]\n            b_xml = os.path.splitext(os.path.basename(f_xml))[0]\n            a_mp3 = b_mp3.split('_')\n            a_xml = b_xml.split('_')\n            score = 0\n            date_mp3 = a_mp3[0]\n            date_xml = a_xml[0]\n\n            if date_mp3 != date_xml:\n                continue\n\n            for i in range(min(len(a_mp3), len(a_xml))):\n                if (a_mp3[i] == a_xml[i]):\n                    score += 1\n\n            if score >= 1:\n                MP3_XML_Scores.append((f_mp3, f_xml, score))\n\n    # sort by score\n    MP3_XML_Scores.sort(key=lambda x: x[2], reverse=True)\n    for s_mp3, s_xml, score in MP3_XML_Scores:\n        #print(s_mp3, s_xml, score)\n        if score not in MP3_XML_Fin:\n            MP3_XML_Fin[score] = {}\n\n        if s_mp3 not in MP3_XML_Fin[score]:\n            try:\n                MP3.index(s_mp3)\n                MP3.remove(s_mp3)\n                MP3_XML_Fin[score][s_mp3] = s_xml\n            except ValueError as ex:\n                pass\n        else:\n            print(\"here:\", MP3_XML_Fin[score][s_mp3], s_xml, file=sys.stderr)\n\n    with open(dataset_sources, \"w\") as ds:\n        for score in MP3_XML_Fin:\n            for mp3 in MP3_XML_Fin[score]:\n                xml = MP3_XML_Fin[score][mp3]\n                if os.path.getsize(mp3) > 0 and os.path.getsize(xml) > 0:\n                    mp3 = os.path.relpath(mp3, dir)\n                    xml = os.path.relpath(xml, dir)\n                    ds.write('{},{},{:0.2e}\\n'.format(xml, mp3, 2.5e-4))\n                else:\n                    print(\"Empty file {} or {}\".format(mp3, xml), file=sys.stderr)\n\n    print(\"Missing XML pairs:\", MP3, file=sys.stderr)\n    return dataset_sources\n\ndef maybe_normalize_for_digits(label):\n    # first, try to identify numbers like \"50 000\", \"260 000\"\n    if \" \" in label:\n        if any(s.isdigit() for s in label):\n            thousands = re.compile(r\"(\\d{1,3}(?:\\s*\\d{3})*(?:,\\d+)?)\")\n            maybe_thousands = thousands.findall(label)\n            if len(maybe_thousands) > 0:\n                while True:\n                    (label, r) = re.subn(r\"(\\d)\\s(\\d{3})\", \"\\\\1\\\\2\", label)\n                    if r == 0:\n                        break\n\n    # this might be a time or duration in the form \"hh:mm\" or \"hh:mm:ss\"\n    if \":\" in label:\n        for s in label.split(\" \"):\n            if any(i.isdigit() for i in s):\n                date_or_time = re.compile(r\"(\\d{1,2}):(\\d{2}):?(\\d{2})?\")\n                maybe_date_or_time = date_or_time.findall(s)\n                if len(maybe_date_or_time) > 0:\n                    maybe_hours   = maybe_date_or_time[0][0]\n                    maybe_minutes = maybe_date_or_time[0][1]\n                    maybe_seconds = maybe_date_or_time[0][2]\n                    if len(maybe_seconds) > 0:\n                        label = label.replace(\"{}:{}:{}\".format(maybe_hours, maybe_minutes, maybe_seconds), \"{} heures {} minutes et {} secondes\".format(maybe_hours, maybe_minutes, maybe_seconds))\n                    else:\n                        label = label.replace(\"{}:{}\".format(maybe_hours, maybe_minutes), \"{} heures et {} minutes\".format(maybe_hours, maybe_minutes))\n\n    new_label = []\n    # pylint: disable=too-many-nested-blocks\n    for s in label.split(\" \"):\n        if any(i.isdigit() for i in s):\n            s = s.replace(\",\", \".\") # num2words requires \".\" for floats\n            s = s.replace(\"\\\"\", \"\")  # clean some data, num2words would choke on 1959\"\n\n            last_c = s[-1]\n            if not last_c.isdigit(): # num2words will choke on \"0.6.\", \"24 ?\"\n                s = s[:-1]\n\n            if any(i.isalpha() for i in s): # So we have any(isdigit()) **and** any(sialpha), like \"3D\"\n                ns = []\n                for c in s:\n                    nc = c\n                    if c.isdigit(): # convert \"3\" to \"trois-\"\n                        try:\n                            nc = num2words(c, lang=\"fr\") + \"-\"\n                        except decimal.InvalidOperation as ex:\n                            print(\"decimal.InvalidOperation: '{}'\".format(s))\n                            raise ex\n                    ns.append(nc)\n                s = \"\".join(s)\n            else:\n                try:\n                    s = num2words(s, lang=\"fr\")\n                except decimal.InvalidOperation as ex:\n                    print(\"decimal.InvalidOperation: '{}'\".format(s))\n                    raise ex\n        new_label.append(s)\n    return \" \".join(new_label)\n\ndef maybe_normalize_for_specials_chars(label):\n    label = label.replace(\"%\", \"pourcents\")\n    label = label.replace(\"/\", \", \") # clean intervals like 2019/2022 to \"2019 2022\"\n    label = label.replace(\"-\", \", \") # clean intervals like 70-80 to \"70 80\"\n    label = label.replace(\"+\", \" plus \") # clean + and make it speakable\n    label = label.replace(\"€\", \" euros \") # clean euro symbol and make it speakable\n    label = label.replace(\"., \", \", \") # clean some strange \"4.0., \" (20181017_Innovation.xml)\n    label = label.replace(\"°\", \" degré \") # clean some strange \"°5\" (20181210_EtatsGeneraux-1000_fre_750_und.xml)\n    label = label.replace(\"...\", \".\") # remove ellipsis\n    label = label.replace(\"..\", \".\") # remove broken ellipsis\n    label = label.replace(\"m²\", \"mètre-carrés\") # 20150616_Defi_Climat_3_wmv_0_fre_minefi.xml\n    label = label.replace(\"[end]\", \"\") # broken tag in 20150123_Entretiens_Tresor_PGM_wmv_0_fre_minefi.xml\n    label = label.replace(u'\\xB8c', \" ç\") # strange cedilla in 20150417_Printemps_Economie_2_wmv_0_fre_minefi.xml\n    label = label.replace(\"C0²\", \"CO 2\") # 20121016_Syteme_sante_copie_wmv_0_fre_minefi.xml\n    return label\n\ndef maybe_normalize_for_anglicisms(label):\n    label = label.replace(\"B2B\", \"B to B\")\n    label = label.replace(\"B2C\", \"B to C\")\n    label = label.replace(\"#\", \"hashtag \")\n    label = label.replace(\"@\", \"at \")\n    return label\n\ndef maybe_normalize(label):\n    label = maybe_normalize_for_specials_chars(label)\n    label = maybe_normalize_for_anglicisms(label)\n    label = maybe_normalize_for_digits(label)\n    return label\n\ndef one_sample(sample):\n    file_size = -1\n    frames = 0\n\n    audio_source = sample[0]\n    target_dir = sample[1]\n    dataset_basename = sample[2]\n\n    start_time = sample[3]\n    duration = sample[4]\n    label = label_filter_fun(sample[5])\n    sample_id = sample[6]\n\n    _wav_filename = os.path.basename(audio_source.replace(\".wav\", \"_{:06}.wav\".format(sample_id)))\n    wav_fullname = os.path.join(target_dir, dataset_basename, _wav_filename)\n\n    if not os.path.exists(wav_fullname):\n        subprocess.check_output([\"ffmpeg\", \"-i\", audio_source, \"-ss\", str(start_time), \"-t\", str(duration), \"-c\", \"copy\", wav_fullname], stdin=subprocess.DEVNULL, stderr=subprocess.STDOUT)\n\n    file_size = os.path.getsize(wav_fullname)\n    frames = int(subprocess.check_output([\"soxi\", \"-s\", wav_fullname], stderr=subprocess.STDOUT))\n\n    _counter = get_counter()\n    _rows = []\n\n    if file_size == -1:\n        # Excluding samples that failed upon conversion\n        _counter[\"failed\"] += 1\n    elif label is None:\n        # Excluding samples that failed on label validation\n        _counter[\"invalid_label\"] += 1\n    elif int(frames/SAMPLE_RATE*1000/10/2) < len(str(label)):\n        # Excluding samples that are too short to fit the transcript\n        _counter[\"too_short\"] += 1\n    elif frames/SAMPLE_RATE < MIN_SECS:\n        # Excluding samples that are too short\n        _counter[\"too_short\"] += 1\n    elif frames/SAMPLE_RATE > MAX_SECS:\n        # Excluding very long samples to keep a reasonable batch-size\n        _counter[\"too_long\"] += 1\n    else:\n        # This one is good - keep it for the target CSV\n        _rows.append((os.path.join(dataset_basename, _wav_filename), file_size, label))\n        _counter[\"imported_time\"] += frames\n    _counter[\"all\"] += 1\n    _counter[\"total_time\"] += frames\n\n    return (_counter, _rows)\n\ndef _maybe_import_data(xml_file, audio_source, target_dir, rel_tol=1e-1):\n    dataset_basename = os.path.splitext(os.path.split(xml_file)[1])[0]\n    wav_root = os.path.join(target_dir, dataset_basename)\n    if not os.path.exists(wav_root):\n        os.makedirs(wav_root)\n\n    source_frames = int(subprocess.check_output([\"soxi\", \"-s\", audio_source], stderr=subprocess.STDOUT))\n    print(\"Source audio length: %s\" % secs_to_hours(source_frames / SAMPLE_RATE))\n\n    # Get audiofile path and transcript for each sentence in tsv\n    samples = []\n    tree = ET.parse(xml_file)\n    root = tree.getroot()\n    seq_id        = 0\n    this_time     = 0.0\n    this_duration = 0.0\n    prev_time     = 0.0\n    prev_duration = 0.0\n    this_text     = \"\"\n    for child in root:\n        if child.tag == \"row\":\n            cur_time     = float(child.attrib[\"timestamp\"])\n            cur_duration = float(child.attrib[\"timedur\"])\n            cur_text     = child.text\n\n            if this_time == 0.0:\n                this_time = cur_time\n\n            delta    = cur_time - (prev_time + prev_duration)\n            # rel_tol value is made from trial/error to try and compromise between:\n            # - cutting enough to skip missing words\n            # - not too short, not too long sentences\n            is_close = math.isclose(cur_time, this_time + this_duration, rel_tol=rel_tol)\n            is_short = ((this_duration + cur_duration + delta) < MAX_SECS)\n\n            # when the previous element is close enough **and** this does not\n            # go over MAX_SECS, we append content\n            if (is_close and is_short):\n                this_duration += cur_duration + delta\n                this_text     += cur_text\n            else:\n                samples.append((audio_source, target_dir, dataset_basename, this_time, this_duration, this_text, seq_id))\n\n                this_time     = cur_time\n                this_duration = cur_duration\n                this_text     = cur_text\n\n                seq_id += 1\n\n            prev_time     = cur_time\n            prev_duration = cur_duration\n\n    # Keep track of how many samples are good vs. problematic\n    _counter = get_counter()\n    num_samples = len(samples)\n    _rows = []\n\n    print(\"Processing XML data: {}\".format(xml_file))\n    pool = Pool()\n    bar = progressbar.ProgressBar(max_value=num_samples, widgets=SIMPLE_BAR)\n    for i, processed in enumerate(pool.imap_unordered(one_sample, samples), start=1):\n        _counter += processed[0]\n        _rows += processed[1]\n        bar.update(i)\n    bar.update(num_samples)\n    pool.close()\n    pool.join()\n\n    imported_samples = get_imported_samples(_counter)\n    assert _counter[\"all\"] == num_samples\n    assert len(_rows) == imported_samples\n\n    print_import_report(_counter, SAMPLE_RATE, MAX_SECS)\n    print(\"Import efficiency: %.1f%%\" % ((_counter[\"total_time\"] / source_frames)*100))\n    print(\"\")\n\n    return _counter, _rows\n\ndef _maybe_convert_wav(mp3_filename, _wav_filename):\n    if not os.path.exists(_wav_filename):\n        print(\"Converting {} to WAV file: {}\".format(mp3_filename, _wav_filename))\n        transformer = sox.Transformer()\n        transformer.convert(samplerate=SAMPLE_RATE, n_channels=CHANNELS, bitdepth=BIT_DEPTH)\n        try:\n            transformer.build(mp3_filename, _wav_filename)\n        except sox.core.SoxError:\n            pass\n\ndef write_general_csv(target_dir, _rows, _counter):\n    target_csv_template = os.path.join(target_dir, \"ccpmf_{}.csv\")\n    with open(target_csv_template.format(\"train\"), \"w\") as train_csv_file:  # 80%\n        with open(target_csv_template.format(\"dev\"), \"w\") as dev_csv_file:  # 10%\n            with open(target_csv_template.format(\"test\"), \"w\") as test_csv_file:  # 10%\n                train_writer = csv.DictWriter(train_csv_file, fieldnames=FIELDNAMES)\n                train_writer.writeheader()\n                dev_writer = csv.DictWriter(dev_csv_file, fieldnames=FIELDNAMES)\n                dev_writer.writeheader()\n                test_writer = csv.DictWriter(test_csv_file, fieldnames=FIELDNAMES)\n                test_writer.writeheader()\n\n                bar = progressbar.ProgressBar(max_value=len(_rows), widgets=SIMPLE_BAR)\n                for i, item in enumerate(bar(_rows)):\n                    i_mod = i % 10\n                    if i_mod == 0:\n                        writer = test_writer\n                    elif i_mod == 1:\n                        writer = dev_writer\n                    else:\n                        writer = train_writer\n                    writer.writerow({\"wav_filename\": item[0], \"wav_filesize\": item[1], \"transcript\": item[2]})\n\n    print(\"\")\n    print(\"~~~~ FINAL STATISTICS ~~~~\")\n    print_import_report(_counter, SAMPLE_RATE, MAX_SECS)\n    print(\"~~~~ (FINAL STATISTICS) ~~~~\")\n    print(\"\")\n\nif __name__ == \"__main__\":\n    PARSER = get_importers_parser(description=\"Import XML from Conference Centre for Economics, France\")\n    PARSER.add_argument(\"target_dir\", help=\"Destination directory\")\n    PARSER.add_argument(\"--filter_alphabet\", help=\"Exclude samples with characters not in provided alphabet\")\n    PARSER.add_argument(\"--normalize\", action=\"store_true\", help=\"Converts diacritic characters to their base ones\")\n\n    PARAMS = PARSER.parse_args()\n    validate_label = get_validate_label(PARAMS)\n    ALPHABET = Alphabet(PARAMS.filter_alphabet) if PARAMS.filter_alphabet else None\n\n    def label_filter_fun(label):\n        if PARAMS.normalize:\n            label = unicodedata.normalize(\"NFKD\", label.strip()) \\\n                .encode(\"ascii\", \"ignore\") \\\n                .decode(\"ascii\", \"ignore\")\n        label = maybe_normalize(label)\n        label = validate_label(label)\n        if ALPHABET and label:\n            try:\n                ALPHABET.encode(label)\n            except KeyError:\n                label = None\n        return label\n\n    dataset_sources = _download_and_preprocess_data(csv_url=DATASET_RELEASE_CSV, target_dir=PARAMS.target_dir)\n    sources_root_dir = os.path.dirname(dataset_sources)\n    all_counter = get_counter()\n    all_rows = []\n    with open(dataset_sources, \"r\") as sources:\n        for line in sources.readlines():\n            d = line.split(\",\")\n            this_xml = os.path.join(sources_root_dir, d[0])\n            this_mp3 = os.path.join(sources_root_dir, d[1])\n            this_rel = float(d[2])\n\n            wav_filename = os.path.join(sources_root_dir, os.path.splitext(os.path.basename(this_mp3))[0] + \".wav\")\n            _maybe_convert_wav(this_mp3, wav_filename)\n            counter, rows = _maybe_import_data(this_xml, wav_filename, sources_root_dir, this_rel)\n\n            all_counter += counter\n            all_rows += rows\n    write_general_csv(sources_root_dir, _counter=all_counter, _rows=all_rows)\n"
  },
  {
    "path": "bin/import_cv.py",
    "content": "#!/usr/bin/env python\nimport csv\nimport os\nimport sys\nimport subprocess\nimport tarfile\nfrom glob import glob\nfrom multiprocessing import Pool\n\nimport progressbar\nimport sox\n\nfrom deepspeech_training.util.downloader import SIMPLE_BAR, maybe_download\nfrom deepspeech_training.util.importers import (\n    get_counter,\n    get_imported_samples,\n    print_import_report,\n)\nfrom deepspeech_training.util.importers import validate_label_eng as validate_label\n\nFIELDNAMES = [\"wav_filename\", \"wav_filesize\", \"transcript\"]\nSAMPLE_RATE = 16000\nMAX_SECS = 10\nARCHIVE_DIR_NAME = \"cv_corpus_v1\"\nARCHIVE_NAME = ARCHIVE_DIR_NAME + \".tar.gz\"\nARCHIVE_URL = (\n    \"https://s3.us-east-2.amazonaws.com/common-voice-data-download/\" + ARCHIVE_NAME\n)\n\n\ndef _download_and_preprocess_data(target_dir):\n    # Making path absolute\n    target_dir = os.path.abspath(target_dir)\n    # Conditionally download data\n    archive_path = maybe_download(ARCHIVE_NAME, target_dir, ARCHIVE_URL)\n    # Conditionally extract common voice data\n    _maybe_extract(target_dir, ARCHIVE_DIR_NAME, archive_path)\n    # Conditionally convert common voice CSV files and mp3 data to DeepSpeech CSVs and wav\n    _maybe_convert_sets(target_dir, ARCHIVE_DIR_NAME)\n\n\ndef _maybe_extract(target_dir, extracted_data, archive_path):\n    # If target_dir/extracted_data does not exist, extract archive in target_dir\n    extracted_path = os.join(target_dir, extracted_data)\n    if not os.path.exists(extracted_path):\n        print('No directory \"%s\" - extracting archive...' % extracted_path)\n        with tarfile.open(archive_path) as tar:\n            tar.extractall(target_dir)\n    else:\n        print('Found directory \"%s\" - not extracting it from archive.' % extracted_path)\n\n\ndef _maybe_convert_sets(target_dir, extracted_data):\n    extracted_dir = os.path.join(target_dir, extracted_data)\n    for source_csv in glob(os.path.join(extracted_dir, \"*.csv\")):\n        _maybe_convert_set(\n            extracted_dir,\n            source_csv,\n            os.path.join(target_dir, os.path.split(source_csv)[-1]),\n        )\n\n\ndef one_sample(sample):\n    mp3_filename = sample[0]\n    # Storing wav files next to the mp3 ones - just with a different suffix\n    wav_filename = path.splitext(mp3_filename)[0] + \".wav\"\n    _maybe_convert_wav(mp3_filename, wav_filename)\n    frames = int(\n        subprocess.check_output([\"soxi\", \"-s\", wav_filename], stderr=subprocess.STDOUT)\n    )\n    file_size = -1\n    if os.path.exists(wav_filename):\n        file_size = path.getsize(wav_filename)\n        frames = int(\n            subprocess.check_output(\n                [\"soxi\", \"-s\", wav_filename], stderr=subprocess.STDOUT\n            )\n        )\n    label = validate_label(sample[1])\n    rows = []\n    counter = get_counter()\n    if file_size == -1:\n        # Excluding samples that failed upon conversion\n        counter[\"failed\"] += 1\n    elif label is None:\n        # Excluding samples that failed on label validation\n        counter[\"invalid_label\"] += 1\n    elif int(frames / SAMPLE_RATE * 1000 / 10 / 2) < len(str(label)):\n        # Excluding samples that are too short to fit the transcript\n        counter[\"too_short\"] += 1\n    elif frames / SAMPLE_RATE > MAX_SECS:\n        # Excluding very long samples to keep a reasonable batch-size\n        counter[\"too_long\"] += 1\n    else:\n        # This one is good - keep it for the target CSV\n        rows.append((wav_filename, file_size, label))\n        counter[\"imported_time\"] += frames\n    counter[\"all\"] += 1\n    counter[\"total_time\"] += frames\n    return (counter, rows)\n\n\ndef _maybe_convert_set(extracted_dir, source_csv, target_csv):\n    print()\n    if os.path.exists(target_csv):\n        print('Found CSV file \"%s\" - not importing \"%s\".' % (target_csv, source_csv))\n        return\n    print('No CSV file \"%s\" - importing \"%s\"...' % (target_csv, source_csv))\n    samples = []\n    with open(source_csv) as source_csv_file:\n        reader = csv.DictReader(source_csv_file)\n        for row in reader:\n            samples.append((os.path.join(extracted_dir, row[\"filename\"]), row[\"text\"]))\n\n    # Mutable counters for the concurrent embedded routine\n    counter = get_counter()\n    num_samples = len(samples)\n    rows = []\n\n    print(\"Importing mp3 files...\")\n    pool = Pool()\n    bar = progressbar.ProgressBar(max_value=num_samples, widgets=SIMPLE_BAR)\n    for i, processed in enumerate(pool.imap_unordered(one_sample, samples), start=1):\n        counter += processed[0]\n        rows += processed[1]\n        bar.update(i)\n    bar.update(num_samples)\n    pool.close()\n    pool.join()\n\n    print('Writing \"%s\"...' % target_csv)\n    with open(target_csv, \"w\", encoding=\"utf-8\", newline=\"\") as target_csv_file:\n        writer = csv.DictWriter(target_csv_file, fieldnames=FIELDNAMES)\n        writer.writeheader()\n        bar = progressbar.ProgressBar(max_value=len(rows), widgets=SIMPLE_BAR)\n        for filename, file_size, transcript in bar(rows):\n            writer.writerow(\n                {\n                    \"wav_filename\": filename,\n                    \"wav_filesize\": file_size,\n                    \"transcript\": transcript,\n                }\n            )\n\n    imported_samples = get_imported_samples(counter)\n    assert counter[\"all\"] == num_samples\n    assert len(rows) == imported_samples\n\n    print_import_report(counter, SAMPLE_RATE, MAX_SECS)\n\n\ndef _maybe_convert_wav(mp3_filename, wav_filename):\n    if not os.path.exists(wav_filename):\n        transformer = sox.Transformer()\n        transformer.convert(samplerate=SAMPLE_RATE)\n        try:\n            transformer.build(mp3_filename, wav_filename)\n        except sox.core.SoxError:\n            pass\n\n\nif __name__ == \"__main__\":\n    _download_and_preprocess_data(sys.argv[1])\n"
  },
  {
    "path": "bin/import_cv2.py",
    "content": "#!/usr/bin/env python\n\"\"\"\nBroadly speaking, this script takes the audio downloaded from Common Voice\nfor a certain language, in addition to the *.tsv files output by CorporaCreator,\nand the script formats the data and transcripts to be in a state usable by\nDeepSpeech.py\nUse \"python3 import_cv2.py -h\" for help\n\"\"\"\nimport csv\nimport os\nimport subprocess\nimport unicodedata\nfrom multiprocessing import Pool\n\nimport progressbar\nimport sox\n\nfrom deepspeech_training.util.downloader import SIMPLE_BAR\nfrom deepspeech_training.util.importers import (\n    get_counter,\n    get_imported_samples,\n    get_importers_parser,\n    get_validate_label,\n    print_import_report,\n)\nfrom ds_ctcdecoder import Alphabet\n\nFIELDNAMES = [\"wav_filename\", \"wav_filesize\", \"transcript\"]\nSAMPLE_RATE = 16000\nCHANNELS = 1\nMAX_SECS = 10\nPARAMS = None\nFILTER_OBJ = None\n\n\nclass LabelFilter:\n    def __init__(self, normalize, alphabet, validate_fun):\n        self.normalize = normalize\n        self.alphabet = alphabet\n        self.validate_fun = validate_fun\n\n    def filter(self, label):\n        if self.normalize:\n            label = unicodedata.normalize(\"NFKD\", label.strip()).encode(\"ascii\", \"ignore\").decode(\"ascii\", \"ignore\")\n        label = self.validate_fun(label)\n        if self.alphabet and label and not self.alphabet.CanEncode(label):\n            label = None\n        return label\n\n\ndef init_worker(params):\n    global FILTER_OBJ  # pylint: disable=global-statement\n    validate_label = get_validate_label(params)\n    alphabet = Alphabet(params.filter_alphabet) if params.filter_alphabet else None\n    FILTER_OBJ = LabelFilter(params.normalize, alphabet, validate_label)\n\n\ndef one_sample(sample):\n    \"\"\" Take an audio file, and optionally convert it to 16kHz WAV \"\"\"\n    mp3_filename = sample[0]\n    if not os.path.splitext(mp3_filename.lower())[1] == \".mp3\":\n        mp3_filename += \".mp3\"\n    # Storing wav files next to the mp3 ones - just with a different suffix\n    wav_filename = os.path.splitext(mp3_filename)[0] + \".wav\"\n    _maybe_convert_wav(mp3_filename, wav_filename)\n    file_size = -1\n    frames = 0\n    if os.path.exists(wav_filename):\n        file_size = os.path.getsize(wav_filename)\n        frames = int(\n            subprocess.check_output(\n                [\"soxi\", \"-s\", wav_filename], stderr=subprocess.STDOUT\n            )\n        )\n    label = FILTER_OBJ.filter(sample[1])\n    rows = []\n    counter = get_counter()\n    if file_size == -1:\n        # Excluding samples that failed upon conversion\n        counter[\"failed\"] += 1\n    elif label is None:\n        # Excluding samples that failed on label validation\n        counter[\"invalid_label\"] += 1\n    elif int(frames / SAMPLE_RATE * 1000 / 10 / 2) < len(str(label)):\n        # Excluding samples that are too short to fit the transcript\n        counter[\"too_short\"] += 1\n    elif frames / SAMPLE_RATE > MAX_SECS:\n        # Excluding very long samples to keep a reasonable batch-size\n        counter[\"too_long\"] += 1\n    else:\n        # This one is good - keep it for the target CSV\n        rows.append((os.path.split(wav_filename)[-1], file_size, label, sample[2]))\n        counter[\"imported_time\"] += frames\n    counter[\"all\"] += 1\n    counter[\"total_time\"] += frames\n\n    return (counter, rows)\n\n\ndef _maybe_convert_set(dataset, tsv_dir, audio_dir, filter_obj, space_after_every_character=None, rows=None, exclude=None):\n    exclude_transcripts = set()\n    exclude_speakers = set()\n    if exclude is not None:\n        for sample in exclude:\n            exclude_transcripts.add(sample[2])\n            exclude_speakers.add(sample[3])\n\n    if rows is None:\n        rows = []\n        input_tsv = os.path.join(os.path.abspath(tsv_dir), dataset + \".tsv\")\n        if not os.path.isfile(input_tsv):\n            return rows\n        print(\"Loading TSV file: \", input_tsv)\n        # Get audiofile path and transcript for each sentence in tsv\n        samples = []\n        with open(input_tsv, encoding=\"utf-8\") as input_tsv_file:\n            reader = csv.DictReader(input_tsv_file, delimiter=\"\\t\")\n            for row in reader:\n                samples.append((os.path.join(audio_dir, row[\"path\"]), row[\"sentence\"], row[\"client_id\"]))\n\n        counter = get_counter()\n        num_samples = len(samples)\n\n        print(\"Importing mp3 files...\")\n        pool = Pool(initializer=init_worker, initargs=(PARAMS,))\n        bar = progressbar.ProgressBar(max_value=num_samples, widgets=SIMPLE_BAR)\n        for i, processed in enumerate(pool.imap_unordered(one_sample, samples), start=1):\n            counter += processed[0]\n            rows += processed[1]\n            bar.update(i)\n        bar.update(num_samples)\n        pool.close()\n        pool.join()\n\n        imported_samples = get_imported_samples(counter)\n        assert counter[\"all\"] == num_samples\n        assert len(rows) == imported_samples\n        print_import_report(counter, SAMPLE_RATE, MAX_SECS)\n\n    output_csv = os.path.join(os.path.abspath(audio_dir), dataset + \".csv\")\n    print(\"Saving new DeepSpeech-formatted CSV file to: \", output_csv)\n    with open(output_csv, \"w\", encoding=\"utf-8\", newline=\"\") as output_csv_file:\n        print(\"Writing CSV file for DeepSpeech.py as: \", output_csv)\n        writer = csv.DictWriter(output_csv_file, fieldnames=FIELDNAMES)\n        writer.writeheader()\n        bar = progressbar.ProgressBar(max_value=len(rows), widgets=SIMPLE_BAR)\n        for filename, file_size, transcript, speaker in bar(rows):\n            if transcript in exclude_transcripts or speaker in exclude_speakers:\n                continue\n            if space_after_every_character:\n                writer.writerow(\n                    {\n                        \"wav_filename\": filename,\n                        \"wav_filesize\": file_size,\n                        \"transcript\": \" \".join(transcript),\n                    }\n                )\n            else:\n                writer.writerow(\n                    {\n                        \"wav_filename\": filename,\n                        \"wav_filesize\": file_size,\n                        \"transcript\": transcript,\n                    }\n                )\n    return rows\n\n\ndef _preprocess_data(tsv_dir, audio_dir, space_after_every_character=False):\n    exclude = []\n    for dataset in [\"test\", \"dev\", \"train\", \"validated\", \"other\"]:\n        set_samples = _maybe_convert_set(dataset, tsv_dir, audio_dir, space_after_every_character)\n        if dataset in [\"test\", \"dev\"]:\n            exclude += set_samples\n        if dataset == \"validated\":\n            _maybe_convert_set(\"train-all\", tsv_dir, audio_dir, space_after_every_character,\n                               rows=set_samples, exclude=exclude)\n\n\ndef _maybe_convert_wav(mp3_filename, wav_filename):\n    if not os.path.exists(wav_filename):\n        transformer = sox.Transformer()\n        transformer.convert(samplerate=SAMPLE_RATE, n_channels=CHANNELS)\n        try:\n            transformer.build(mp3_filename, wav_filename)\n        except sox.core.SoxError:\n            pass\n\n\ndef parse_args():\n    parser = get_importers_parser(description=\"Import CommonVoice v2.0 corpora\")\n    parser.add_argument(\"tsv_dir\", help=\"Directory containing tsv files\")\n    parser.add_argument(\n        \"--audio_dir\",\n        help='Directory containing the audio clips - defaults to \"<tsv_dir>/clips\"',\n    )\n    parser.add_argument(\n        \"--filter_alphabet\",\n        help=\"Exclude samples with characters not in provided alphabet\",\n    )\n    parser.add_argument(\n        \"--normalize\",\n        action=\"store_true\",\n        help=\"Converts diacritic characters to their base ones\",\n    )\n    parser.add_argument(\n        \"--space_after_every_character\",\n        action=\"store_true\",\n        help=\"To help transcript join by white space\",\n    )\n    return parser.parse_args()\n\n\ndef main():\n    audio_dir = PARAMS.audio_dir if PARAMS.audio_dir else os.path.join(PARAMS.tsv_dir, \"clips\")\n    _preprocess_data(PARAMS.tsv_dir, audio_dir, PARAMS.space_after_every_character)\n\n\nif __name__ == \"__main__\":\n    PARAMS = parse_args()\n    main()\n"
  },
  {
    "path": "bin/import_fisher.py",
    "content": "#!/usr/bin/env python\nimport codecs\nimport fnmatch\nimport os\nimport random\nimport subprocess\nimport sys\nimport unicodedata\n\nimport librosa\nimport pandas\nimport soundfile  # <= Has an external dependency on libsndfile\n\nfrom deepspeech_training.util.importers import validate_label_eng as validate_label\n\n# Prerequisite: Having the sph2pipe tool in your PATH:\n# https://www.ldc.upenn.edu/language-resources/tools/sphere-conversion-tools\n\n\ndef _download_and_preprocess_data(data_dir):\n    # Assume data_dir contains extracted LDC2004S13, LDC2004T19, LDC2005S13, LDC2005T19\n\n    # Conditionally convert Fisher sph data to wav\n    _maybe_convert_wav(data_dir, \"LDC2004S13\", \"fisher-2004-wav\")\n    _maybe_convert_wav(data_dir, \"LDC2005S13\", \"fisher-2005-wav\")\n\n    # Conditionally split Fisher wav data\n    all_2004 = _split_wav_and_sentences(\n        data_dir,\n        original_data=\"fisher-2004-wav\",\n        converted_data=\"fisher-2004-split-wav\",\n        trans_data=os.path.join(\"LDC2004T19\", \"fe_03_p1_tran\", \"data\", \"trans\"),\n    )\n    all_2005 = _split_wav_and_sentences(\n        data_dir,\n        original_data=\"fisher-2005-wav\",\n        converted_data=\"fisher-2005-split-wav\",\n        trans_data=os.path.join(\"LDC2005T19\", \"fe_03_p2_tran\", \"data\", \"trans\"),\n    )\n\n    # The following files have incorrect transcripts that are much longer than\n    # their audio source. The result is that we end up with more labels than time\n    # slices, which breaks CTC.\n    all_2004.loc[\n        all_2004[\"wav_filename\"].str.endswith(\"fe_03_00265-33.53-33.81.wav\"),\n        \"transcript\",\n    ] = \"correct\"\n    all_2004.loc[\n        all_2004[\"wav_filename\"].str.endswith(\"fe_03_00991-527.39-528.3.wav\"),\n        \"transcript\",\n    ] = \"that's one of those\"\n    all_2005.loc[\n        all_2005[\"wav_filename\"].str.endswith(\"fe_03_10282-344.42-344.84.wav\"),\n        \"transcript\",\n    ] = \"they don't want\"\n    all_2005.loc[\n        all_2005[\"wav_filename\"].str.endswith(\"fe_03_10677-101.04-106.41.wav\"),\n        \"transcript\",\n    ] = \"uh my mine yeah the german shepherd pitbull mix he snores almost as loud as i do\"\n\n    # The following file is just a short sound and not at all transcribed like provided.\n    # So we just exclude it.\n    all_2004 = all_2004[\n        ~all_2004[\"wav_filename\"].str.endswith(\"fe_03_00027-393.8-394.05.wav\")\n    ]\n\n    # The following file is far too long and would ruin our training batch size.\n    # So we just exclude it.\n    all_2005 = all_2005[\n        ~all_2005[\"wav_filename\"].str.endswith(\"fe_03_11487-31.09-234.06.wav\")\n    ]\n\n    # The following file is too large for its transcript, so we just exclude it.\n    all_2004 = all_2004[\n        ~all_2004[\"wav_filename\"].str.endswith(\"fe_03_01326-307.42-307.93.wav\")\n    ]\n\n    # Conditionally split Fisher data into train/validation/test sets\n    train_2004, dev_2004, test_2004 = _split_sets(all_2004)\n    train_2005, dev_2005, test_2005 = _split_sets(all_2005)\n\n    # Join 2004 and 2005 data\n    train_files = train_2004.append(train_2005)\n    dev_files = dev_2004.append(dev_2005)\n    test_files = test_2004.append(test_2005)\n\n    # Write sets to disk as CSV files\n    train_files.to_csv(os.path.join(data_dir, \"fisher-train.csv\"), index=False)\n    dev_files.to_csv(os.path.join(data_dir, \"fisher-dev.csv\"), index=False)\n    test_files.to_csv(os.path.join(data_dir, \"fisher-test.csv\"), index=False)\n\n\ndef _maybe_convert_wav(data_dir, original_data, converted_data):\n    source_dir = os.path.join(data_dir, original_data)\n    target_dir = os.path.join(data_dir, converted_data)\n\n    # Conditionally convert sph files to wav files\n    if os.path.exists(target_dir):\n        print(\"skipping maybe_convert_wav\")\n        return\n\n    # Create target_dir\n    os.makedirs(target_dir)\n\n    # Loop over sph files in source_dir and convert each to 16-bit PCM wav\n    for root, dirnames, filenames in os.walk(source_dir):\n        for filename in fnmatch.filter(filenames, \"*.sph\"):\n            sph_file = os.path.join(root, filename)\n            for channel in [\"1\", \"2\"]:\n                wav_filename = (\n                    os.path.splitext(os.path.basename(sph_file))[0]\n                    + \"_c\"\n                    + channel\n                    + \".wav\"\n                )\n                wav_file = os.path.join(target_dir, wav_filename)\n                print(\"converting {} to {}\".format(sph_file, wav_file))\n                subprocess.check_call(\n                    [\"sph2pipe\", \"-c\", channel, \"-p\", \"-f\", \"rif\", sph_file, wav_file]\n                )\n\n\ndef _parse_transcriptions(trans_file):\n    segments = []\n    with codecs.open(trans_file, \"r\", \"utf-8\") as fin:\n        for line in fin:\n            if line.startswith(\"#\") or len(line) <= 1:\n                continue\n\n            tokens = line.split()\n            start_time = float(tokens[0])\n            stop_time = float(tokens[1])\n            speaker = tokens[2]\n            transcript = \" \".join(tokens[3:])\n\n            # We need to do the encode-decode dance here because encode\n            # returns a bytes() object on Python 3, and text_to_char_array\n            # expects a string.\n            transcript = (\n                unicodedata.normalize(\"NFKD\", transcript)\n                .encode(\"ascii\", \"ignore\")\n                .decode(\"ascii\", \"ignore\")\n            )\n\n            segments.append(\n                {\n                    \"start_time\": start_time,\n                    \"stop_time\": stop_time,\n                    \"speaker\": speaker,\n                    \"transcript\": transcript,\n                }\n            )\n    return segments\n\n\ndef _split_wav_and_sentences(data_dir, trans_data, original_data, converted_data):\n    trans_dir = os.path.join(data_dir, trans_data)\n    source_dir = os.path.join(data_dir, original_data)\n    target_dir = os.path.join(data_dir, converted_data)\n    if not os.path.exists(target_dir):\n        os.makedirs(target_dir)\n\n    files = []\n\n    # Loop over transcription files and split corresponding wav\n    for root, dirnames, filenames in os.walk(trans_dir):\n        for filename in fnmatch.filter(filenames, \"*.txt\"):\n            trans_file = os.path.join(root, filename)\n            segments = _parse_transcriptions(trans_file)\n\n            # Open wav corresponding to transcription file\n            wav_filenames = [\n                os.path.splitext(os.path.basename(trans_file))[0]\n                + \"_c\"\n                + channel\n                + \".wav\"\n                for channel in [\"1\", \"2\"]\n            ]\n            wav_files = [\n                os.path.join(source_dir, wav_filename) for wav_filename in wav_filenames\n            ]\n\n            print(\"splitting {} according to {}\".format(wav_files, trans_file))\n\n            origAudios = [\n                librosa.load(wav_file, sr=16000, mono=False) for wav_file in wav_files\n            ]\n\n            # Loop over segments and split wav_file for each segment\n            for segment in segments:\n                # Create wav segment filename\n                start_time = segment[\"start_time\"]\n                stop_time = segment[\"stop_time\"]\n                new_wav_filename = (\n                    os.path.splitext(os.path.basename(trans_file))[0]\n                    + \"-\"\n                    + str(start_time)\n                    + \"-\"\n                    + str(stop_time)\n                    + \".wav\"\n                )\n                new_wav_file = os.path.join(target_dir, new_wav_filename)\n\n                channel = 0 if segment[\"speaker\"] == \"A:\" else 1\n                _split_and_resample_wav(\n                    origAudios[channel], start_time, stop_time, new_wav_file\n                )\n\n                new_wav_filesize = os.path.getsize(new_wav_file)\n                transcript = validate_label(segment[\"transcript\"])\n                if transcript != None:\n                    files.append(\n                        (os.path.abspath(new_wav_file), new_wav_filesize, transcript)\n                    )\n\n    return pandas.DataFrame(\n        data=files, columns=[\"wav_filename\", \"wav_filesize\", \"transcript\"]\n    )\n\n\ndef _split_audio(origAudio, start_time, stop_time):\n    audioData, frameRate = origAudio\n    nChannels = len(audioData.shape)\n    startIndex = int(start_time * frameRate)\n    stopIndex = int(stop_time * frameRate)\n    return (\n        audioData[startIndex:stopIndex]\n        if 1 == nChannels\n        else audioData[:, startIndex:stopIndex]\n    )\n\n\ndef _split_and_resample_wav(origAudio, start_time, stop_time, new_wav_file):\n    frameRate = origAudio[1]\n    chunkData = _split_audio(origAudio, start_time, stop_time)\n    soundfile.write(new_wav_file, chunkData, frameRate, \"PCM_16\")\n\n\ndef _split_sets(filelist):\n    \"\"\"\n    randomply split the datasets into train, validation, and test sets where the size of the\n    validation and test sets are determined by the `get_sample_size` function. \n    \"\"\"\n    random.shuffle(filelist)\n    sample_size = get_sample_size(len(filelist))\n\n    train_beg = 0\n    train_end = len(filelist) - 2 * sample_size\n\n    dev_beg = train_end\n    dev_end = train_end + sample_size\n\n    test_beg = dev_end\n    test_end = len(filelist)\n\n    return (\n        filelist[train_beg:train_end],\n        filelist[dev_beg:dev_end],\n        filelist[test_beg:test_end],\n    )\n\n\ndef get_sample_size(population_size):\n    \"\"\"calculates the sample size for a 99% confidence and 1% margin of error\n    \"\"\"\n    margin_of_error = 0.01\n    fraction_picking = 0.50\n    z_score = 2.58  # Corresponds to confidence level 99%\n    numerator = (z_score ** 2 * fraction_picking * (1 - fraction_picking)) / (\n        margin_of_error ** 2\n    )\n    sample_size = 0\n    for train_size in range(population_size, 0, -1):\n        denominator = 1 + (z_score ** 2 * fraction_picking * (1 - fraction_picking)) / (\n            margin_of_error ** 2 * train_size\n        )\n        sample_size = int(numerator / denominator)\n        if 2 * sample_size + train_size <= population_size:\n            break\n    return sample_size\n\n\nif __name__ == \"__main__\":\n    _download_and_preprocess_data(sys.argv[1])\n"
  },
  {
    "path": "bin/import_freestmandarin.py",
    "content": "#!/usr/bin/env python\nimport glob\nimport os\nimport tarfile\n\nimport numpy as np\nimport pandas\n\nfrom deepspeech_training.util.importers import get_importers_parser\n\nCOLUMN_NAMES = [\"wav_filename\", \"wav_filesize\", \"transcript\"]\n\n\ndef extract(archive_path, target_dir):\n    print(\"Extracting {} into {}...\".format(archive_path, target_dir))\n    with tarfile.open(archive_path) as tar:\n        tar.extractall(target_dir)\n\n\ndef preprocess_data(tgz_file, target_dir):\n    # First extract main archive and sub-archives\n    extract(tgz_file, target_dir)\n    main_folder = os.path.join(target_dir, \"ST-CMDS-20170001_1-OS\")\n\n    # Folder structure is now:\n    # - ST-CMDS-20170001_1-OS/\n    #   - *.wav\n    #   - *.txt\n    #   - *.metadata\n\n    def load_set(glob_path):\n        set_files = []\n        for wav in glob.glob(glob_path):\n            wav_filename = wav\n            wav_filesize = os.path.getsize(wav)\n            txt_filename = os.path.splitext(wav_filename)[0] + \".txt\"\n            with open(txt_filename, \"r\") as fin:\n                transcript = fin.read()\n            set_files.append((wav_filename, wav_filesize, transcript))\n        return set_files\n\n    # Load all files, then deterministically split into train/dev/test sets\n    all_files = load_set(os.path.join(main_folder, \"*.wav\"))\n    df = pandas.DataFrame(data=all_files, columns=COLUMN_NAMES)\n    df.sort_values(by=\"wav_filename\", inplace=True)\n\n    indices = np.arange(0, len(df))\n    np.random.seed(12345)\n    np.random.shuffle(indices)\n\n    # Total corpus size: 102600 samples. 5000 samples gives us 99% confidence\n    # level with a margin of error of under 2%.\n    test_indices = indices[-5000:]\n    dev_indices = indices[-10000:-5000]\n    train_indices = indices[:-10000]\n\n    train_files = df.iloc[train_indices]\n    durations = (train_files[\"wav_filesize\"] - 44) / 16000 / 2\n    train_files = train_files[durations <= 10.0]\n    print(\"Trimming {} samples > 10 seconds\".format((durations > 10.0).sum()))\n    dest_csv = os.path.join(target_dir, \"freestmandarin_train.csv\")\n    print(\"Saving train set into {}...\".format(dest_csv))\n    train_files.to_csv(dest_csv, index=False)\n\n    dev_files = df.iloc[dev_indices]\n    dest_csv = os.path.join(target_dir, \"freestmandarin_dev.csv\")\n    print(\"Saving dev set into {}...\".format(dest_csv))\n    dev_files.to_csv(dest_csv, index=False)\n\n    test_files = df.iloc[test_indices]\n    dest_csv = os.path.join(target_dir, \"freestmandarin_test.csv\")\n    print(\"Saving test set into {}...\".format(dest_csv))\n    test_files.to_csv(dest_csv, index=False)\n\n\ndef main():\n    # https://www.openslr.org/38/\n    parser = get_importers_parser(description=\"Import Free ST Chinese Mandarin corpus\")\n    parser.add_argument(\"tgz_file\", help=\"Path to ST-CMDS-20170001_1-OS.tar.gz\")\n    parser.add_argument(\n        \"--target_dir\",\n        default=\"\",\n        help=\"Target folder to extract files into and put the resulting CSVs. Defaults to same folder as the main archive.\",\n    )\n    params = parser.parse_args()\n\n    if not params.target_dir:\n        params.target_dir = os.path.dirname(params.tgz_file)\n\n    preprocess_data(params.tgz_file, params.target_dir)\n\n\nif __name__ == \"__main__\":\n    main()\n"
  },
  {
    "path": "bin/import_gram_vaani.py",
    "content": "#!/usr/bin/env python\n\nimport csv\nimport logging\nimport math\nimport os\nimport subprocess\nimport urllib\nfrom pathlib import Path\n\nimport pandas as pd\nfrom sox import Transformer\n\nimport swifter\nfrom deepspeech_training.util.importers import get_importers_parser, get_validate_label\n\n__version__ = \"0.1.0\"\n_logger = logging.getLogger(__name__)\n\n\nMAX_SECS = 10\nBITDEPTH = 16\nN_CHANNELS = 1\nSAMPLE_RATE = 16000\n\nDEV_PERCENTAGE = 0.10\nTRAIN_PERCENTAGE = 0.80\n\n\ndef parse_args(args):\n    \"\"\"Parse command line parameters\n    Args:\n      args ([str]): Command line parameters as list of strings\n    Returns:\n      :obj:`argparse.Namespace`: command line parameters namespace\n    \"\"\"\n    parser = get_importers_parser(description=\"Imports GramVaani data for Deep Speech\")\n    parser.add_argument(\n        \"--version\",\n        action=\"version\",\n        version=\"GramVaaniImporter {ver}\".format(ver=__version__),\n    )\n    parser.add_argument(\n        \"-v\",\n        \"--verbose\",\n        action=\"store_const\",\n        required=False,\n        help=\"set loglevel to INFO\",\n        dest=\"loglevel\",\n        const=logging.INFO,\n    )\n    parser.add_argument(\n        \"-vv\",\n        \"--very-verbose\",\n        action=\"store_const\",\n        required=False,\n        help=\"set loglevel to DEBUG\",\n        dest=\"loglevel\",\n        const=logging.DEBUG,\n    )\n    parser.add_argument(\n        \"-c\",\n        \"--csv_filename\",\n        required=True,\n        help=\"Path to the GramVaani csv\",\n        dest=\"csv_filename\",\n    )\n    parser.add_argument(\n        \"-t\",\n        \"--target_dir\",\n        required=True,\n        help=\"Directory in which to save the importer GramVaani data\",\n        dest=\"target_dir\",\n    )\n    return parser.parse_args(args)\n\n\ndef setup_logging(level):\n    \"\"\"Setup basic logging\n    Args:\n      level (int): minimum log level for emitting messages\n    \"\"\"\n    format = \"[%(asctime)s] %(levelname)s:%(name)s:%(message)s\"\n    logging.basicConfig(\n        level=level, stream=sys.stdout, format=format, datefmt=\"%Y-%m-%d %H:%M:%S\"\n    )\n\n\nclass GramVaaniCSV:\n    \"\"\"GramVaaniCSV representing a GramVaani dataset.\n    Args:\n      csv_filename (str): Path to the GramVaani csv\n    Attributes:\n        data (:class:`pandas.DataFrame`): `pandas.DataFrame` Containing the GramVaani csv data\n    \"\"\"\n\n    def __init__(self, csv_filename):\n        self.data = self._parse_csv(csv_filename)\n\n    def _parse_csv(self, csv_filename):\n        _logger.info(\"Parsing csv file...%s\", os.path.abspath(csv_filename))\n        data = pd.read_csv(\n            os.path.abspath(csv_filename),\n            names=[\n                \"piece_id\",\n                \"audio_url\",\n                \"transcript_labelled\",\n                \"transcript\",\n                \"labels\",\n                \"content_filename\",\n                \"audio_length\",\n                \"user_id\",\n            ],\n            usecols=[\"audio_url\", \"transcript\", \"audio_length\"],\n            skiprows=[0],\n            engine=\"python\",\n            encoding=\"utf-8\",\n            quotechar='\"',\n            quoting=csv.QUOTE_ALL,\n        )\n        data.dropna(inplace=True)\n        _logger.info(\"Parsed %d lines csv file.\" % len(data))\n        return data\n\n\nclass GramVaaniDownloader:\n    \"\"\"GramVaaniDownloader downloads a GramVaani dataset.\n    Args:\n      gram_vaani_csv (GramVaaniCSV): A GramVaaniCSV representing the data to download\n      target_dir (str): The path to download the data to\n    Attributes:\n        data (:class:`pandas.DataFrame`): `pandas.DataFrame` Containing the GramVaani csv data\n    \"\"\"\n\n    def __init__(self, gram_vaani_csv, target_dir):\n        self.target_dir = target_dir\n        self.data = gram_vaani_csv.data\n\n    def download(self):\n        \"\"\"Downloads the data associated with this instance\n        Return:\n          mp3_directory (os.path): The directory into which the associated mp3's were downloaded\n        \"\"\"\n        mp3_directory = self._pre_download()\n        self.data.swifter.apply(\n            func=lambda arg: self._download(*arg, mp3_directory), axis=1, raw=True\n        )\n        return mp3_directory\n\n    def _pre_download(self):\n        mp3_directory = os.path.join(self.target_dir, \"mp3\")\n        if not os.path.exists(self.target_dir):\n            _logger.info(\"Creating directory...%s\", self.target_dir)\n            os.mkdir(self.target_dir)\n        if not os.path.exists(mp3_directory):\n            _logger.info(\"Creating directory...%s\", mp3_directory)\n            os.mkdir(mp3_directory)\n        return mp3_directory\n\n    def _download(self, audio_url, transcript, audio_length, mp3_directory):\n        if audio_url == \"audio_url\":\n            return\n        mp3_filename = os.path.join(mp3_directory, os.path.basename(audio_url))\n        if not os.path.exists(mp3_filename):\n            _logger.debug(\"Downloading mp3 file...%s\", audio_url)\n            urllib.request.urlretrieve(audio_url, mp3_filename)\n        else:\n            _logger.debug(\"Already downloaded mp3 file...%s\", audio_url)\n\n\nclass GramVaaniConverter:\n    \"\"\"GramVaaniConverter converts the mp3's to wav's for a GramVaani dataset.\n    Args:\n      target_dir (str): The path to download the data from\n      mp3_directory (os.path): The path containing the GramVaani mp3's\n    Attributes:\n        target_dir (str): The target directory passed as a command line argument\n        mp3_directory (os.path): The path containing the GramVaani mp3's\n    \"\"\"\n\n    def __init__(self, target_dir, mp3_directory):\n        self.target_dir = target_dir\n        self.mp3_directory = Path(mp3_directory)\n\n    def convert(self):\n        \"\"\"Converts the mp3's associated with this instance to wav's\n        Return:\n          wav_directory (os.path): The directory into which the associated wav's were downloaded\n        \"\"\"\n        wav_directory = self._pre_convert()\n        for mp3_filename in self.mp3_directory.glob(\"**/*.mp3\"):\n            wav_filename = os.path.join(\n                wav_directory,\n                os.path.splitext(os.path.basename(mp3_filename))[0] + \".wav\",\n            )\n            if not os.path.exists(wav_filename):\n                _logger.debug(\n                    \"Converting mp3 file %s to wav file %s\"\n                    % (mp3_filename, wav_filename)\n                )\n                transformer = Transformer()\n                transformer.convert(\n                    samplerate=SAMPLE_RATE, n_channels=N_CHANNELS, bitdepth=BITDEPTH\n                )\n                transformer.build(str(mp3_filename), str(wav_filename))\n            else:\n                _logger.debug(\n                    \"Already converted mp3 file %s to wav file %s\"\n                    % (mp3_filename, wav_filename)\n                )\n        return wav_directory\n\n    def _pre_convert(self):\n        wav_directory = os.path.join(self.target_dir, \"wav\")\n        if not os.path.exists(self.target_dir):\n            _logger.info(\"Creating directory...%s\", self.target_dir)\n            os.mkdir(self.target_dir)\n        if not os.path.exists(wav_directory):\n            _logger.info(\"Creating directory...%s\", wav_directory)\n            os.mkdir(wav_directory)\n        return wav_directory\n\n\nclass GramVaaniDataSets:\n    def __init__(self, target_dir, wav_directory, gram_vaani_csv):\n        self.target_dir = target_dir\n        self.wav_directory = wav_directory\n        self.csv_data = gram_vaani_csv.data\n        self.raw = pd.DataFrame(columns=[\"wav_filename\", \"wav_filesize\", \"transcript\"])\n        self.valid = pd.DataFrame(\n            columns=[\"wav_filename\", \"wav_filesize\", \"transcript\"]\n        )\n        self.train = pd.DataFrame(\n            columns=[\"wav_filename\", \"wav_filesize\", \"transcript\"]\n        )\n        self.dev = pd.DataFrame(columns=[\"wav_filename\", \"wav_filesize\", \"transcript\"])\n        self.test = pd.DataFrame(columns=[\"wav_filename\", \"wav_filesize\", \"transcript\"])\n\n    def create(self):\n        self._convert_csv_data_to_raw_data()\n        self.raw.index = range(len(self.raw.index))\n        self.valid = self.raw[self._is_valid_raw_rows()]\n        self.valid = self.valid.sample(frac=1).reset_index(drop=True)\n        train_size, dev_size, test_size = self._calculate_data_set_sizes()\n        self.train = self.valid.loc[0:train_size]\n        self.dev = self.valid.loc[train_size : train_size + dev_size]\n        self.test = self.valid.loc[\n            train_size + dev_size : train_size + dev_size + test_size\n        ]\n\n    def _convert_csv_data_to_raw_data(self):\n        self.raw[[\"wav_filename\", \"wav_filesize\", \"transcript\"]] = self.csv_data[\n            [\"audio_url\", \"transcript\", \"audio_length\"]\n        ].swifter.apply(\n            func=lambda arg: self._convert_csv_data_to_raw_data_impl(*arg),\n            axis=1,\n            raw=True,\n        )\n        self.raw.reset_index()\n\n    def _convert_csv_data_to_raw_data_impl(self, audio_url, transcript, audio_length):\n        if audio_url == \"audio_url\":\n            return pd.Series([\"wav_filename\", \"wav_filesize\", \"transcript\"])\n        mp3_filename = os.path.basename(audio_url)\n        wav_relative_filename = os.path.join(\n            \"wav\", os.path.splitext(os.path.basename(mp3_filename))[0] + \".wav\"\n        )\n        wav_filesize = os.path.getsize(\n            os.path.join(self.target_dir, wav_relative_filename)\n        )\n        transcript = validate_label(transcript)\n        if None == transcript:\n            transcript = \"\"\n        return pd.Series([wav_relative_filename, wav_filesize, transcript])\n\n    def _is_valid_raw_rows(self):\n        is_valid_raw_transcripts = self._is_valid_raw_transcripts()\n        is_valid_raw_wav_frames = self._is_valid_raw_wav_frames()\n        is_valid_raw_row = [\n            (is_valid_raw_transcript & is_valid_raw_wav_frame)\n            for is_valid_raw_transcript, is_valid_raw_wav_frame in zip(\n                is_valid_raw_transcripts, is_valid_raw_wav_frames\n            )\n        ]\n        series = pd.Series(is_valid_raw_row)\n        return series\n\n    def _is_valid_raw_transcripts(self):\n        return pd.Series([bool(transcript) for transcript in self.raw.transcript])\n\n    def _is_valid_raw_wav_frames(self):\n        transcripts = [str(transcript) for transcript in self.raw.transcript]\n        wav_filepaths = [\n            os.path.join(self.target_dir, str(wav_filename))\n            for wav_filename in self.raw.wav_filename\n        ]\n        wav_frames = [\n            int(\n                subprocess.check_output(\n                    [\"soxi\", \"-s\", wav_filepath], stderr=subprocess.STDOUT\n                )\n            )\n            for wav_filepath in wav_filepaths\n        ]\n        is_valid_raw_wav_frames = [\n            self._is_wav_frame_valid(wav_frame, transcript)\n            for wav_frame, transcript in zip(wav_frames, transcripts)\n        ]\n        return pd.Series(is_valid_raw_wav_frames)\n\n    def _is_wav_frame_valid(self, wav_frame, transcript):\n        is_wav_frame_valid = True\n        if int(wav_frame / SAMPLE_RATE * 1000 / 10 / 2) < len(str(transcript)):\n            is_wav_frame_valid = False\n        elif wav_frame / SAMPLE_RATE > MAX_SECS:\n            is_wav_frame_valid = False\n        return is_wav_frame_valid\n\n    def _calculate_data_set_sizes(self):\n        total_size = len(self.valid)\n        dev_size = math.floor(total_size * DEV_PERCENTAGE)\n        train_size = math.floor(total_size * TRAIN_PERCENTAGE)\n        test_size = total_size - (train_size + dev_size)\n        return (train_size, dev_size, test_size)\n\n    def save(self):\n        datasets = [\"train\", \"dev\", \"test\"]\n        for dataset in datasets:\n            self._save(dataset)\n\n    def _save(self, dataset):\n        dataset_path = os.path.join(self.target_dir, dataset + \".csv\")\n        dataframe = getattr(self, dataset)\n        dataframe.to_csv(\n            dataset_path,\n            index=False,\n            encoding=\"utf-8\",\n            escapechar=\"\\\\\",\n            quoting=csv.QUOTE_MINIMAL,\n        )\n\n\ndef main(args):\n    \"\"\"Main entry point allowing external calls\n    Args:\n      args ([str]): command line parameter list\n    \"\"\"\n    args = parse_args(args)\n    validate_label = get_validate_label(args)\n    setup_logging(args.loglevel)\n    _logger.info(\"Starting GramVaani importer...\")\n    _logger.info(\"Starting loading GramVaani csv...\")\n    csv = GramVaaniCSV(args.csv_filename)\n    _logger.info(\"Starting downloading GramVaani mp3's...\")\n    downloader = GramVaaniDownloader(csv, args.target_dir)\n    mp3_directory = downloader.download()\n    _logger.info(\"Starting converting GramVaani mp3's to wav's...\")\n    converter = GramVaaniConverter(args.target_dir, mp3_directory)\n    wav_directory = converter.convert()\n    datasets = GramVaaniDataSets(args.target_dir, wav_directory, csv)\n    datasets.create()\n    datasets.save()\n    _logger.info(\"Finished GramVaani importer...\")\n\n\nmain(sys.argv[1:])\n"
  },
  {
    "path": "bin/import_ldc93s1.py",
    "content": "#!/usr/bin/env python\nimport os\nimport sys\n\nimport pandas\n\nfrom deepspeech_training.util.downloader import maybe_download\n\n\ndef _download_and_preprocess_data(data_dir):\n    # Conditionally download data\n    LDC93S1_BASE = \"LDC93S1\"\n    LDC93S1_BASE_URL = \"https://catalog.ldc.upenn.edu/desc/addenda/\"\n    local_file = maybe_download(\n        LDC93S1_BASE + \".wav\", data_dir, LDC93S1_BASE_URL + LDC93S1_BASE + \".wav\"\n    )\n    trans_file = maybe_download(\n        LDC93S1_BASE + \".txt\", data_dir, LDC93S1_BASE_URL + LDC93S1_BASE + \".txt\"\n    )\n    with open(trans_file, \"r\") as fin:\n        transcript = \" \".join(fin.read().strip().lower().split(\" \")[2:]).replace(\n            \".\", \"\"\n        )\n\n    df = pandas.DataFrame(\n        data=[(os.path.abspath(local_file), os.path.getsize(local_file), transcript)],\n        columns=[\"wav_filename\", \"wav_filesize\", \"transcript\"],\n    )\n    df.to_csv(os.path.join(data_dir, \"ldc93s1.csv\"), index=False)\n\n\nif __name__ == \"__main__\":\n    _download_and_preprocess_data(sys.argv[1])\n"
  },
  {
    "path": "bin/import_librivox.py",
    "content": "#!/usr/bin/env python\nimport codecs\nimport fnmatch\nimport os\nimport subprocess\nimport sys\nimport tarfile\nimport unicodedata\n\nimport pandas\nimport progressbar\nfrom sox import Transformer\nfrom tensorflow.python.platform import gfile\n\nfrom deepspeech_training.util.downloader import maybe_download\n\nSAMPLE_RATE = 16000\n\n\ndef _download_and_preprocess_data(data_dir):\n    # Conditionally download data to data_dir\n    print(\n        \"Downloading Librivox data set (55GB) into {} if not already present...\".format(\n            data_dir\n        )\n    )\n    with progressbar.ProgressBar(max_value=7, widget=progressbar.AdaptiveETA) as bar:\n        TRAIN_CLEAN_100_URL = (\n            \"http://www.openslr.org/resources/12/train-clean-100.tar.gz\"\n        )\n        TRAIN_CLEAN_360_URL = (\n            \"http://www.openslr.org/resources/12/train-clean-360.tar.gz\"\n        )\n        TRAIN_OTHER_500_URL = (\n            \"http://www.openslr.org/resources/12/train-other-500.tar.gz\"\n        )\n\n        DEV_CLEAN_URL = \"http://www.openslr.org/resources/12/dev-clean.tar.gz\"\n        DEV_OTHER_URL = \"http://www.openslr.org/resources/12/dev-other.tar.gz\"\n\n        TEST_CLEAN_URL = \"http://www.openslr.org/resources/12/test-clean.tar.gz\"\n        TEST_OTHER_URL = \"http://www.openslr.org/resources/12/test-other.tar.gz\"\n\n        def filename_of(x):\n            return os.path.split(x)[1]\n\n        train_clean_100 = maybe_download(\n            filename_of(TRAIN_CLEAN_100_URL), data_dir, TRAIN_CLEAN_100_URL\n        )\n        bar.update(0)\n        train_clean_360 = maybe_download(\n            filename_of(TRAIN_CLEAN_360_URL), data_dir, TRAIN_CLEAN_360_URL\n        )\n        bar.update(1)\n        train_other_500 = maybe_download(\n            filename_of(TRAIN_OTHER_500_URL), data_dir, TRAIN_OTHER_500_URL\n        )\n        bar.update(2)\n\n        dev_clean = maybe_download(filename_of(DEV_CLEAN_URL), data_dir, DEV_CLEAN_URL)\n        bar.update(3)\n        dev_other = maybe_download(filename_of(DEV_OTHER_URL), data_dir, DEV_OTHER_URL)\n        bar.update(4)\n\n        test_clean = maybe_download(\n            filename_of(TEST_CLEAN_URL), data_dir, TEST_CLEAN_URL\n        )\n        bar.update(5)\n        test_other = maybe_download(\n            filename_of(TEST_OTHER_URL), data_dir, TEST_OTHER_URL\n        )\n        bar.update(6)\n\n    # Conditionally extract LibriSpeech data\n    # We extract each archive into data_dir, but test for existence in\n    # data_dir/LibriSpeech because the archives share that root.\n    print(\"Extracting librivox data if not already extracted...\")\n    with progressbar.ProgressBar(max_value=7, widget=progressbar.AdaptiveETA) as bar:\n        LIBRIVOX_DIR = \"LibriSpeech\"\n        work_dir = os.path.join(data_dir, LIBRIVOX_DIR)\n\n        _maybe_extract(\n            data_dir, os.path.join(LIBRIVOX_DIR, \"train-clean-100\"), train_clean_100\n        )\n        bar.update(0)\n        _maybe_extract(\n            data_dir, os.path.join(LIBRIVOX_DIR, \"train-clean-360\"), train_clean_360\n        )\n        bar.update(1)\n        _maybe_extract(\n            data_dir, os.path.join(LIBRIVOX_DIR, \"train-other-500\"), train_other_500\n        )\n        bar.update(2)\n\n        _maybe_extract(data_dir, os.path.join(LIBRIVOX_DIR, \"dev-clean\"), dev_clean)\n        bar.update(3)\n        _maybe_extract(data_dir, os.path.join(LIBRIVOX_DIR, \"dev-other\"), dev_other)\n        bar.update(4)\n\n        _maybe_extract(data_dir, os.path.join(LIBRIVOX_DIR, \"test-clean\"), test_clean)\n        bar.update(5)\n        _maybe_extract(data_dir, os.path.join(LIBRIVOX_DIR, \"test-other\"), test_other)\n        bar.update(6)\n\n    # Convert FLAC data to wav, from:\n    #  data_dir/LibriSpeech/split/1/2/1-2-3.flac\n    # to:\n    #  data_dir/LibriSpeech/split-wav/1-2-3.wav\n    #\n    # And split LibriSpeech transcriptions, from:\n    #  data_dir/LibriSpeech/split/1/2/1-2.trans.txt\n    # to:\n    #  data_dir/LibriSpeech/split-wav/1-2-0.txt\n    #  data_dir/LibriSpeech/split-wav/1-2-1.txt\n    #  data_dir/LibriSpeech/split-wav/1-2-2.txt\n    #  ...\n    print(\"Converting FLAC to WAV and splitting transcriptions...\")\n    with progressbar.ProgressBar(max_value=7, widget=progressbar.AdaptiveETA) as bar:\n        train_100 = _convert_audio_and_split_sentences(\n            work_dir, \"train-clean-100\", \"train-clean-100-wav\"\n        )\n        bar.update(0)\n        train_360 = _convert_audio_and_split_sentences(\n            work_dir, \"train-clean-360\", \"train-clean-360-wav\"\n        )\n        bar.update(1)\n        train_500 = _convert_audio_and_split_sentences(\n            work_dir, \"train-other-500\", \"train-other-500-wav\"\n        )\n        bar.update(2)\n\n        dev_clean = _convert_audio_and_split_sentences(\n            work_dir, \"dev-clean\", \"dev-clean-wav\"\n        )\n        bar.update(3)\n        dev_other = _convert_audio_and_split_sentences(\n            work_dir, \"dev-other\", \"dev-other-wav\"\n        )\n        bar.update(4)\n\n        test_clean = _convert_audio_and_split_sentences(\n            work_dir, \"test-clean\", \"test-clean-wav\"\n        )\n        bar.update(5)\n        test_other = _convert_audio_and_split_sentences(\n            work_dir, \"test-other\", \"test-other-wav\"\n        )\n        bar.update(6)\n\n    # Write sets to disk as CSV files\n    train_100.to_csv(\n        os.path.join(data_dir, \"librivox-train-clean-100.csv\"), index=False\n    )\n    train_360.to_csv(\n        os.path.join(data_dir, \"librivox-train-clean-360.csv\"), index=False\n    )\n    train_500.to_csv(\n        os.path.join(data_dir, \"librivox-train-other-500.csv\"), index=False\n    )\n\n    dev_clean.to_csv(os.path.join(data_dir, \"librivox-dev-clean.csv\"), index=False)\n    dev_other.to_csv(os.path.join(data_dir, \"librivox-dev-other.csv\"), index=False)\n\n    test_clean.to_csv(os.path.join(data_dir, \"librivox-test-clean.csv\"), index=False)\n    test_other.to_csv(os.path.join(data_dir, \"librivox-test-other.csv\"), index=False)\n\n\ndef _maybe_extract(data_dir, extracted_data, archive):\n    # If data_dir/extracted_data does not exist, extract archive in data_dir\n    if not gfile.Exists(os.path.join(data_dir, extracted_data)):\n        tar = tarfile.open(archive)\n        tar.extractall(data_dir)\n        tar.close()\n\n\ndef _convert_audio_and_split_sentences(extracted_dir, data_set, dest_dir):\n    source_dir = os.path.join(extracted_dir, data_set)\n    target_dir = os.path.join(extracted_dir, dest_dir)\n\n    if not os.path.exists(target_dir):\n        os.makedirs(target_dir)\n\n    # Loop over transcription files and split each one\n    #\n    # The format for each file 1-2.trans.txt is:\n    #  1-2-0 transcription of 1-2-0.flac\n    #  1-2-1 transcription of 1-2-1.flac\n    #  ...\n    #\n    # Each file is then split into several files:\n    #  1-2-0.txt (contains transcription of 1-2-0.flac)\n    #  1-2-1.txt (contains transcription of 1-2-1.flac)\n    #  ...\n    #\n    # We also convert the corresponding FLACs to WAV in the same pass\n    files = []\n    for root, dirnames, filenames in os.walk(source_dir):\n        for filename in fnmatch.filter(filenames, \"*.trans.txt\"):\n            trans_filename = os.path.join(root, filename)\n            with codecs.open(trans_filename, \"r\", \"utf-8\") as fin:\n                for line in fin:\n                    # Parse each segment line\n                    first_space = line.find(\" \")\n                    seqid, transcript = line[:first_space], line[first_space + 1 :]\n\n                    # We need to do the encode-decode dance here because encode\n                    # returns a bytes() object on Python 3, and text_to_char_array\n                    # expects a string.\n                    transcript = (\n                        unicodedata.normalize(\"NFKD\", transcript)\n                        .encode(\"ascii\", \"ignore\")\n                        .decode(\"ascii\", \"ignore\")\n                    )\n\n                    transcript = transcript.lower().strip()\n\n                    # Convert corresponding FLAC to a WAV\n                    flac_file = os.path.join(root, seqid + \".flac\")\n                    wav_file = os.path.join(target_dir, seqid + \".wav\")\n                    if not os.path.exists(wav_file):\n                        tfm = Transformer()\n                        tfm.set_output_format(rate=SAMPLE_RATE)\n                        tfm.build(flac_file, wav_file)\n                    wav_filesize = os.path.getsize(wav_file)\n\n                    files.append((os.path.abspath(wav_file), wav_filesize, transcript))\n\n    return pandas.DataFrame(\n        data=files, columns=[\"wav_filename\", \"wav_filesize\", \"transcript\"]\n    )\n\n\nif __name__ == \"__main__\":\n    _download_and_preprocess_data(sys.argv[1])\n"
  },
  {
    "path": "bin/import_lingua_libre.py",
    "content": "#!/usr/bin/env python3\nimport argparse\nimport csv\nimport os\nimport re\nimport subprocess\nimport unicodedata\nimport zipfile\nfrom glob import glob\nfrom multiprocessing import Pool\n\nimport progressbar\nimport sox\n\nfrom deepspeech_training.util.downloader import SIMPLE_BAR, maybe_download\nfrom deepspeech_training.util.importers import (\n    get_counter,\n    get_imported_samples,\n    get_importers_parser,\n    get_validate_label,\n    print_import_report,\n)\nfrom ds_ctcdecoder import Alphabet\n\nFIELDNAMES = [\"wav_filename\", \"wav_filesize\", \"transcript\"]\nSAMPLE_RATE = 16000\nBITDEPTH = 16\nN_CHANNELS = 1\nMAX_SECS = 10\n\nARCHIVE_DIR_NAME = \"lingua_libre\"\nARCHIVE_NAME = \"Q{qId}-{iso639_3}-{language_English_name}.zip\"\nARCHIVE_URL = \"https://lingualibre.fr/datasets/\" + ARCHIVE_NAME\n\n\ndef _download_and_preprocess_data(target_dir):\n    # Making path absolute\n    target_dir = os.path.abspath(target_dir)\n    # Conditionally download data\n    archive_path = maybe_download(ARCHIVE_NAME, target_dir, ARCHIVE_URL)\n    # Conditionally extract data\n    _maybe_extract(target_dir, ARCHIVE_DIR_NAME, archive_path)\n    # Produce CSV files and convert ogg data to wav\n    _maybe_convert_sets(target_dir, ARCHIVE_DIR_NAME)\n\n\ndef _maybe_extract(target_dir, extracted_data, archive_path):\n    # If target_dir/extracted_data does not exist, extract archive in target_dir\n    extracted_path = os.path.join(target_dir, extracted_data)\n    if not os.path.exists(extracted_path):\n        print('No directory \"%s\" - extracting archive...' % extracted_path)\n        if not os.path.isdir(extracted_path):\n            os.mkdir(extracted_path)\n        with zipfile.ZipFile(archive_path) as zip_f:\n            zip_f.extractall(extracted_path)\n    else:\n        print('Found directory \"%s\" - not extracting it from archive.' % archive_path)\n\n\ndef one_sample(sample):\n    \"\"\" Take a audio file, and optionally convert it to 16kHz WAV \"\"\"\n    ogg_filename = sample[0]\n    # Storing wav files next to the ogg ones - just with a different suffix\n    wav_filename = os.path.splitext(ogg_filename)[0] + \".wav\"\n    _maybe_convert_wav(ogg_filename, wav_filename)\n    file_size = -1\n    frames = 0\n    if os.path.exists(wav_filename):\n        file_size = os.path.getsize(wav_filename)\n        frames = int(\n            subprocess.check_output(\n                [\"soxi\", \"-s\", wav_filename], stderr=subprocess.STDOUT\n            )\n        )\n    label = label_filter(sample[1])\n    rows = []\n    counter = get_counter()\n\n    if file_size == -1:\n        # Excluding samples that failed upon conversion\n        counter[\"failed\"] += 1\n    elif label is None:\n        # Excluding samples that failed on label validation\n        counter[\"invalid_label\"] += 1\n    elif int(frames / SAMPLE_RATE * 1000 / 10 / 2) < len(str(label)):\n        # Excluding samples that are too short to fit the transcript\n        counter[\"too_short\"] += 1\n    elif frames / SAMPLE_RATE > MAX_SECS:\n        # Excluding very long samples to keep a reasonable batch-size\n        counter[\"too_long\"] += 1\n    else:\n        # This one is good - keep it for the target CSV\n        rows.append((wav_filename, file_size, label))\n        counter[\"imported_time\"] += frames\n    counter[\"all\"] += 1\n    counter[\"total_time\"] += frames\n\n    return (counter, rows)\n\n\ndef _maybe_convert_sets(target_dir, extracted_data):\n    extracted_dir = os.path.join(target_dir, extracted_data)\n    # override existing CSV with normalized one\n    target_csv_template = os.path.join(\n        target_dir, ARCHIVE_DIR_NAME + \"_\" + ARCHIVE_NAME.replace(\".zip\", \"_{}.csv\")\n    )\n    if os.path.isfile(target_csv_template):\n        return\n\n    ogg_root_dir = os.path.join(extracted_dir, ARCHIVE_NAME.replace(\".zip\", \"\"))\n\n    # Get audiofile path and transcript for each sentence in tsv\n    samples = []\n    glob_dir = os.path.join(ogg_root_dir, \"**/*.ogg\")\n    for record in glob(glob_dir, recursive=True):\n        record_file = record.replace(ogg_root_dir + os.path.sep, \"\")\n        if record_filter(record_file):\n            samples.append(\n                (\n                    os.path.join(ogg_root_dir, record_file),\n                    os.path.splitext(os.path.basename(record_file))[0],\n                )\n            )\n\n    counter = get_counter()\n    num_samples = len(samples)\n    rows = []\n\n    print(\"Importing ogg files...\")\n    pool = Pool()\n    bar = progressbar.ProgressBar(max_value=num_samples, widgets=SIMPLE_BAR)\n    for i, processed in enumerate(pool.imap_unordered(one_sample, samples), start=1):\n        counter += processed[0]\n        rows += processed[1]\n        bar.update(i)\n    bar.update(num_samples)\n    pool.close()\n    pool.join()\n\n    with open(target_csv_template.format(\"train\"), \"w\", encoding=\"utf-8\", newline=\"\") as train_csv_file:  # 80%\n        with open(target_csv_template.format(\"dev\"), \"w\", encoding=\"utf-8\", newline=\"\") as dev_csv_file:  # 10%\n            with open(target_csv_template.format(\"test\"), \"w\", encoding=\"utf-8\", newline=\"\") as test_csv_file:  # 10%\n                train_writer = csv.DictWriter(train_csv_file, fieldnames=FIELDNAMES)\n                train_writer.writeheader()\n                dev_writer = csv.DictWriter(dev_csv_file, fieldnames=FIELDNAMES)\n                dev_writer.writeheader()\n                test_writer = csv.DictWriter(test_csv_file, fieldnames=FIELDNAMES)\n                test_writer.writeheader()\n\n                for i, item in enumerate(rows):\n                    transcript = validate_label(item[2])\n                    if not transcript:\n                        continue\n                    wav_filename = os.path.join(\n                        ogg_root_dir, item[0].replace(\".ogg\", \".wav\")\n                    )\n                    i_mod = i % 10\n                    if i_mod == 0:\n                        writer = test_writer\n                    elif i_mod == 1:\n                        writer = dev_writer\n                    else:\n                        writer = train_writer\n                    writer.writerow(\n                        dict(\n                            wav_filename=wav_filename,\n                            wav_filesize=os.path.getsize(wav_filename),\n                            transcript=transcript,\n                        )\n                    )\n\n    imported_samples = get_imported_samples(counter)\n    assert counter[\"all\"] == num_samples\n    assert len(rows) == imported_samples\n\n    print_import_report(counter, SAMPLE_RATE, MAX_SECS)\n\n\ndef _maybe_convert_wav(ogg_filename, wav_filename):\n    if not os.path.exists(wav_filename):\n        transformer = sox.Transformer()\n        transformer.convert(samplerate=SAMPLE_RATE, n_channels=N_CHANNELS, bitdepth=BITDEPTH)\n        try:\n            transformer.build(ogg_filename, wav_filename)\n        except sox.core.SoxError as ex:\n            print(\"SoX processing error\", ex, ogg_filename, wav_filename)\n\n\ndef handle_args():\n    parser = get_importers_parser(\n        description=\"Importer for LinguaLibre dataset. Check https://lingualibre.fr/wiki/Help:Download_from_LinguaLibre for details.\"\n    )\n    parser.add_argument(dest=\"target_dir\")\n    parser.add_argument(\n        \"--qId\", type=int, required=True, help=\"LinguaLibre language qId\"\n    )\n    parser.add_argument(\n        \"--iso639-3\", type=str, required=True, help=\"ISO639-3 language code\"\n    )\n    parser.add_argument(\n        \"--english-name\", type=str, required=True, help=\"English name of the language\"\n    )\n    parser.add_argument(\n        \"--filter_alphabet\",\n        help=\"Exclude samples with characters not in provided alphabet\",\n    )\n    parser.add_argument(\n        \"--normalize\",\n        action=\"store_true\",\n        help=\"Converts diacritic characters to their base ones\",\n    )\n    parser.add_argument(\n        \"--bogus-records\",\n        type=argparse.FileType(\"r\"),\n        required=False,\n        help=\"Text file listing well-known bogus record to skip from importing, from https://lingualibre.fr/wiki/LinguaLibre:Misleading_items\",\n    )\n    return parser.parse_args()\n\n\nif __name__ == \"__main__\":\n    CLI_ARGS = handle_args()\n    ALPHABET = Alphabet(CLI_ARGS.filter_alphabet) if CLI_ARGS.filter_alphabet else None\n    validate_label = get_validate_label(CLI_ARGS)\n\n    bogus_regexes = []\n    if CLI_ARGS.bogus_records:\n        for line in CLI_ARGS.bogus_records:\n            bogus_regexes.append(re.compile(line.strip()))\n\n    def record_filter(path):\n        if any(regex.match(path) for regex in bogus_regexes):\n            print(\"Reject\", path)\n            return False\n        return True\n\n    def label_filter(label):\n        if CLI_ARGS.normalize:\n            label = (\n                unicodedata.normalize(\"NFKD\", label.strip())\n                .encode(\"ascii\", \"ignore\")\n                .decode(\"ascii\", \"ignore\")\n            )\n        label = validate_label(label)\n        if ALPHABET and label and not ALPHABET.CanEncode(label):\n            label = None\n        return label\n\n    ARCHIVE_NAME = ARCHIVE_NAME.format(\n        qId=CLI_ARGS.qId,\n        iso639_3=CLI_ARGS.iso639_3,\n        language_English_name=CLI_ARGS.english_name,\n    )\n    ARCHIVE_URL = ARCHIVE_URL.format(\n        qId=CLI_ARGS.qId,\n        iso639_3=CLI_ARGS.iso639_3,\n        language_English_name=CLI_ARGS.english_name,\n    )\n    _download_and_preprocess_data(target_dir=CLI_ARGS.target_dir)\n"
  },
  {
    "path": "bin/import_m-ailabs.py",
    "content": "#!/usr/bin/env python3\n# pylint: disable=invalid-name\nimport csv\nimport os\nimport subprocess\nimport tarfile\nimport unicodedata\nfrom glob import glob\nfrom multiprocessing import Pool\n\nimport progressbar\n\nfrom deepspeech_training.util.downloader import SIMPLE_BAR, maybe_download\nfrom deepspeech_training.util.importers import (\n    get_counter,\n    get_imported_samples,\n    get_importers_parser,\n    get_validate_label,\n    print_import_report,\n)\nfrom ds_ctcdecoder import Alphabet\n\nFIELDNAMES = [\"wav_filename\", \"wav_filesize\", \"transcript\"]\nSAMPLE_RATE = 16000\nMAX_SECS = 15\n\nARCHIVE_DIR_NAME = \"{language}\"\nARCHIVE_NAME = \"{language}.tgz\"\nARCHIVE_URL = \"https://data.solak.de/data/Training/stt_tts/\" + ARCHIVE_NAME\n\n\ndef _download_and_preprocess_data(target_dir):\n    # Making path absolute\n    target_dir = os.path.abspath(target_dir)\n    # Conditionally download data\n    archive_path = maybe_download(ARCHIVE_NAME, target_dir, ARCHIVE_URL)\n    # Conditionally extract data\n    _maybe_extract(target_dir, ARCHIVE_DIR_NAME, archive_path)\n    # Produce CSV files\n    _maybe_convert_sets(target_dir, ARCHIVE_DIR_NAME)\n\n\ndef _maybe_extract(target_dir, extracted_data, archive_path):\n    # If target_dir/extracted_data does not exist, extract archive in target_dir\n    extracted_path = os.path.join(target_dir, extracted_data)\n    if not os.path.exists(extracted_path):\n        print('No directory \"%s\" - extracting archive...' % extracted_path)\n        if not os.path.isdir(extracted_path):\n            os.mkdir(extracted_path)\n        tar = tarfile.open(archive_path)\n        tar.extractall(extracted_path)\n        tar.close()\n    else:\n        print('Found directory \"%s\" - not extracting it from archive.' % archive_path)\n\n\ndef one_sample(sample):\n    \"\"\" Take a audio file, and optionally convert it to 16kHz WAV \"\"\"\n    wav_filename = sample[0]\n    file_size = -1\n    frames = 0\n    if os.path.exists(wav_filename):\n        tmp_filename = os.path.splitext(wav_filename)[0]+'.tmp.wav'\n        subprocess.check_call(\n            ['sox', wav_filename, '-r', str(SAMPLE_RATE), '-c', '1', '-b', '16', tmp_filename], stderr=subprocess.STDOUT\n        )\n        os.rename(tmp_filename, wav_filename)\n        file_size = os.path.getsize(wav_filename)\n        frames = int(\n            subprocess.check_output(\n                [\"soxi\", \"-s\", wav_filename], stderr=subprocess.STDOUT\n            )\n        )\n    label = label_filter(sample[1])\n    counter = get_counter()\n    rows = []\n\n    if file_size == -1:\n        # Excluding samples that failed upon conversion\n        print(\"conversion failure\", wav_filename)\n        counter[\"failed\"] += 1\n    elif label is None:\n        # Excluding samples that failed on label validation\n        counter[\"invalid_label\"] += 1\n    elif int(frames / SAMPLE_RATE * 1000 / 15 / 2) < len(str(label)):\n        # Excluding samples that are too short to fit the transcript\n        counter[\"too_short\"] += 1\n    elif frames / SAMPLE_RATE > MAX_SECS:\n        # Excluding very long samples to keep a reasonable batch-size\n        counter[\"too_long\"] += 1\n    else:\n        # This one is good - keep it for the target CSV\n        rows.append((wav_filename, file_size, label))\n        counter[\"imported_time\"] += frames\n    counter[\"all\"] += 1\n    counter[\"total_time\"] += frames\n    return (counter, rows)\n\n\ndef _maybe_convert_sets(target_dir, extracted_data):\n    extracted_dir = os.path.join(target_dir, extracted_data)\n    # override existing CSV with normalized one\n    target_csv_template = os.path.join(\n        target_dir, ARCHIVE_DIR_NAME, ARCHIVE_NAME.replace(\".tgz\", \"_{}.csv\")\n    )\n    if os.path.isfile(target_csv_template):\n        return\n\n    wav_root_dir = os.path.join(extracted_dir)\n\n    # Get audiofile path and transcript for each sentence in tsv\n    samples = []\n    glob_dir = os.path.join(wav_root_dir, \"**/metadata.csv\")\n    for record in glob(glob_dir, recursive=True):\n        if any(\n            map(lambda sk: sk in record, SKIP_LIST)\n        ):  # pylint: disable=cell-var-from-loop\n            continue\n        with open(record, \"r\") as rec:\n            for re in rec.readlines():\n                re = re.strip().split(\"|\")\n                audio = os.path.join(os.path.dirname(record), \"wavs\", re[0] + \".wav\")\n                transcript = re[2]\n                samples.append((audio, transcript))\n\n    counter = get_counter()\n    num_samples = len(samples)\n    rows = []\n\n    print(\"Importing WAV files...\")\n    pool = Pool()\n    bar = progressbar.ProgressBar(max_value=num_samples, widgets=SIMPLE_BAR)\n    for i, processed in enumerate(pool.imap_unordered(one_sample, samples), start=1):\n        counter += processed[0]\n        rows += processed[1]\n        bar.update(i)\n    bar.update(num_samples)\n    pool.close()\n    pool.join()\n\n    with open(target_csv_template.format(\"train\"), \"w\", encoding=\"utf-8\", newline=\"\") as train_csv_file:  # 80%\n        with open(target_csv_template.format(\"dev\"), \"w\", encoding=\"utf-8\", newline=\"\") as dev_csv_file:  # 10%\n            with open(target_csv_template.format(\"test\"), \"w\", encoding=\"utf-8\", newline=\"\") as test_csv_file:  # 10%\n                train_writer = csv.DictWriter(train_csv_file, fieldnames=FIELDNAMES)\n                train_writer.writeheader()\n                dev_writer = csv.DictWriter(dev_csv_file, fieldnames=FIELDNAMES)\n                dev_writer.writeheader()\n                test_writer = csv.DictWriter(test_csv_file, fieldnames=FIELDNAMES)\n                test_writer.writeheader()\n\n                for i, item in enumerate(rows):\n                    transcript = validate_label(item[2])\n                    if not transcript:\n                        continue\n                    wav_filename = item[0]\n                    i_mod = i % 10\n                    if i_mod == 0:\n                        writer = test_writer\n                    elif i_mod == 1:\n                        writer = dev_writer\n                    else:\n                        writer = train_writer\n                    writer.writerow(\n                        dict(\n                            wav_filename=os.path.relpath(wav_filename, extracted_dir),\n                            wav_filesize=os.path.getsize(wav_filename),\n                            transcript=transcript,\n                        )\n                    )\n\n    imported_samples = get_imported_samples(counter)\n    assert counter[\"all\"] == num_samples\n    assert len(rows) == imported_samples\n\n    print_import_report(counter, SAMPLE_RATE, MAX_SECS)\n\n\ndef handle_args():\n    parser = get_importers_parser(\n        description=\"Importer for M-AILABS dataset. https://www.caito.de/2019/01/the-m-ailabs-speech-dataset/.\"\n    )\n    parser.add_argument(dest=\"target_dir\")\n    parser.add_argument(\n        \"--filter_alphabet\",\n        help=\"Exclude samples with characters not in provided alphabet\",\n    )\n    parser.add_argument(\n        \"--normalize\",\n        action=\"store_true\",\n        help=\"Converts diacritic characters to their base ones\",\n    )\n    parser.add_argument(\n        \"--skiplist\",\n        type=str,\n        default=\"\",\n        help=\"Directories / books to skip, comma separated\",\n    )\n    parser.add_argument(\n        \"--language\", required=True, type=str, help=\"Dataset language to use\"\n    )\n    return parser.parse_args()\n\n\nif __name__ == \"__main__\":\n    CLI_ARGS = handle_args()\n    ALPHABET = Alphabet(CLI_ARGS.filter_alphabet) if CLI_ARGS.filter_alphabet else None\n    SKIP_LIST = filter(None, CLI_ARGS.skiplist.split(\",\"))\n    validate_label = get_validate_label(CLI_ARGS)\n\n    def label_filter(label):\n        if CLI_ARGS.normalize:\n            label = (\n                unicodedata.normalize(\"NFKD\", label.strip())\n                .encode(\"ascii\", \"ignore\")\n                .decode(\"ascii\", \"ignore\")\n            )\n        label = validate_label(label)\n        if ALPHABET and label and not ALPHABET.CanEncode(label):\n            label = None\n        return label\n\n    ARCHIVE_DIR_NAME = ARCHIVE_DIR_NAME.format(language=CLI_ARGS.language)\n    ARCHIVE_NAME = ARCHIVE_NAME.format(language=CLI_ARGS.language)\n    ARCHIVE_URL = ARCHIVE_URL.format(language=CLI_ARGS.language)\n\n    _download_and_preprocess_data(target_dir=CLI_ARGS.target_dir)\n"
  },
  {
    "path": "bin/import_magicdata.py",
    "content": "#!/usr/bin/env python\nimport glob\nimport os\nimport tarfile\nimport wave\n\nimport pandas\n\nfrom deepspeech_training.util.importers import get_importers_parser\n\nCOLUMN_NAMES = [\"wav_filename\", \"wav_filesize\", \"transcript\"]\n\n\ndef extract(archive_path, target_dir):\n    print(\"Extracting {} into {}...\".format(archive_path, target_dir))\n    with tarfile.open(archive_path) as tar:\n        tar.extractall(target_dir)\n\n\ndef is_file_truncated(wav_filename, wav_filesize):\n    with wave.open(wav_filename, mode=\"rb\") as fin:\n        assert fin.getframerate() == 16000\n        assert fin.getsampwidth() == 2\n        assert fin.getnchannels() == 1\n\n        header_duration = fin.getnframes() / fin.getframerate()\n        filesize_duration = (wav_filesize - 44) / 16000 / 2\n\n    return header_duration != filesize_duration\n\n\ndef preprocess_data(folder_with_archives, target_dir):\n    # First extract subset archives\n    for subset in (\"train\", \"dev\", \"test\"):\n        extract(\n            os.path.join(\n                folder_with_archives, \"magicdata_{}_set.tar.gz\".format(subset)\n            ),\n            target_dir,\n        )\n\n    # Folder structure is now:\n    # - magicdata_{train,dev,test}.tar.gz\n    # - magicdata/\n    #   - train/*.wav\n    #   - train/TRANS.txt\n    #   - dev/*.wav\n    #   - dev/TRANS.txt\n    #   - test/*.wav\n    #   - test/TRANS.txt\n\n    # The TRANS files are CSVs with three columns, one containing the WAV file\n    # name, one containing the speaker ID, and one containing the transcription\n\n    def load_set(set_path):\n        transcripts = pandas.read_csv(\n            os.path.join(set_path, \"TRANS.txt\"), sep=\"\\t\", index_col=0\n        )\n        glob_path = os.path.join(set_path, \"*\", \"*.wav\")\n        set_files = []\n        for wav in glob.glob(glob_path):\n            try:\n                wav_filename = wav\n                wav_filesize = os.path.getsize(wav)\n                transcript_key = os.path.basename(wav)\n                transcript = transcripts.loc[transcript_key, \"Transcription\"]\n\n                # Some files in this dataset are truncated, the header duration\n                # doesn't match the file size. This causes errors at training\n                # time, so check here if things are fine before including a file\n                if is_file_truncated(wav_filename, wav_filesize):\n                    print(\n                        \"Warning: File {} is corrupted, header duration does \"\n                        \"not match file size. Ignoring.\".format(wav_filename)\n                    )\n                    continue\n\n                set_files.append((wav_filename, wav_filesize, transcript))\n            except KeyError:\n                print(\"Warning: Missing transcript for WAV file {}.\".format(wav))\n        return set_files\n\n    for subset in (\"train\", \"dev\", \"test\"):\n        print(\"Loading {} set samples...\".format(subset))\n        subset_files = load_set(os.path.join(target_dir, subset))\n        df = pandas.DataFrame(data=subset_files, columns=COLUMN_NAMES)\n\n        # Trim train set to under 10s\n        if subset == \"train\":\n            durations = (df[\"wav_filesize\"] - 44) / 16000 / 2\n            df = df[durations <= 10.0]\n            print(\"Trimming {} samples > 10 seconds\".format((durations > 10.0).sum()))\n\n            with_noise = df[\"transcript\"].str.contains(r\"\\[(FIL|SPK)\\]\")\n            df = df[~with_noise]\n            print(\n                \"Trimming {} samples with noise ([FIL] or [SPK])\".format(\n                    sum(with_noise)\n                )\n            )\n\n        dest_csv = os.path.join(target_dir, \"magicdata_{}.csv\".format(subset))\n        print(\"Saving {} set into {}...\".format(subset, dest_csv))\n        df.to_csv(dest_csv, index=False)\n\n\ndef main():\n    # https://openslr.org/68/\n    parser = get_importers_parser(description=\"Import MAGICDATA corpus\")\n    parser.add_argument(\n        \"folder_with_archives\",\n        help=\"Path to folder containing magicdata_{train,dev,test}.tar.gz\",\n    )\n    parser.add_argument(\n        \"--target_dir\",\n        default=\"\",\n        help=\"Target folder to extract files into and put the resulting CSVs. Defaults to a folder called magicdata next to the archives\",\n    )\n    params = parser.parse_args()\n\n    if not params.target_dir:\n        params.target_dir = os.path.join(params.folder_with_archives, \"magicdata\")\n\n    preprocess_data(params.folder_with_archives, params.target_dir)\n\n\nif __name__ == \"__main__\":\n    main()\n"
  },
  {
    "path": "bin/import_primewords.py",
    "content": "#!/usr/bin/env python\nimport glob\nimport json\nimport os\nimport tarfile\n\nimport numpy as np\nimport pandas\n\nfrom deepspeech_training.util.importers import get_importers_parser\n\nCOLUMN_NAMES = [\"wav_filename\", \"wav_filesize\", \"transcript\"]\n\n\ndef extract(archive_path, target_dir):\n    print(\"Extracting {} into {}...\".format(archive_path, target_dir))\n    with tarfile.open(archive_path) as tar:\n        tar.extractall(target_dir)\n\n\ndef preprocess_data(tgz_file, target_dir):\n    # First extract main archive and sub-archives\n    extract(tgz_file, target_dir)\n    main_folder = os.path.join(target_dir, \"primewords_md_2018_set1\")\n\n    # Folder structure is now:\n    # - primewords_md_2018_set1/\n    #   - audio_files/\n    #     - [0-f]/[00-0f]/*.wav\n    #   - set1_transcript.json\n\n    transcripts_path = os.path.join(main_folder, \"set1_transcript.json\")\n    with open(transcripts_path) as fin:\n        transcripts = json.load(fin)\n\n    transcripts = {entry[\"file\"]: entry[\"text\"] for entry in transcripts}\n\n    def load_set(glob_path):\n        set_files = []\n        for wav in glob.glob(glob_path):\n            try:\n                wav_filename = wav\n                wav_filesize = os.path.getsize(wav)\n                transcript_key = os.path.basename(wav)\n                transcript = transcripts[transcript_key]\n                set_files.append((wav_filename, wav_filesize, transcript))\n            except KeyError:\n                print(\"Warning: Missing transcript for WAV file {}.\".format(wav))\n        return set_files\n\n    # Load all files, then deterministically split into train/dev/test sets\n    all_files = load_set(os.path.join(main_folder, \"audio_files\", \"*\", \"*\", \"*.wav\"))\n    df = pandas.DataFrame(data=all_files, columns=COLUMN_NAMES)\n    df.sort_values(by=\"wav_filename\", inplace=True)\n\n    indices = np.arange(0, len(df))\n    np.random.seed(12345)\n    np.random.shuffle(indices)\n\n    # Total corpus size: 50287 samples. 5000 samples gives us 99% confidence\n    # level with a margin of error of under 2%.\n    test_indices = indices[-5000:]\n    dev_indices = indices[-10000:-5000]\n    train_indices = indices[:-10000]\n\n    train_files = df.iloc[train_indices]\n    durations = (train_files[\"wav_filesize\"] - 44) / 16000 / 2\n    train_files = train_files[durations <= 15.0]\n    print(\"Trimming {} samples > 15 seconds\".format((durations > 15.0).sum()))\n    dest_csv = os.path.join(target_dir, \"primewords_train.csv\")\n    print(\"Saving train set into {}...\".format(dest_csv))\n    train_files.to_csv(dest_csv, index=False)\n\n    dev_files = df.iloc[dev_indices]\n    dest_csv = os.path.join(target_dir, \"primewords_dev.csv\")\n    print(\"Saving dev set into {}...\".format(dest_csv))\n    dev_files.to_csv(dest_csv, index=False)\n\n    test_files = df.iloc[test_indices]\n    dest_csv = os.path.join(target_dir, \"primewords_test.csv\")\n    print(\"Saving test set into {}...\".format(dest_csv))\n    test_files.to_csv(dest_csv, index=False)\n\n\ndef main():\n    # https://www.openslr.org/47/\n    parser = get_importers_parser(description=\"Import Primewords Chinese corpus set 1\")\n    parser.add_argument(\"tgz_file\", help=\"Path to primewords_md_2018_set1.tar.gz\")\n    parser.add_argument(\n        \"--target_dir\",\n        default=\"\",\n        help=\"Target folder to extract files into and put the resulting CSVs. Defaults to same folder as the main archive.\",\n    )\n    params = parser.parse_args()\n\n    if not params.target_dir:\n        params.target_dir = os.path.dirname(params.tgz_file)\n\n    preprocess_data(params.tgz_file, params.target_dir)\n\n\nif __name__ == \"__main__\":\n    main()\n"
  },
  {
    "path": "bin/import_slr57.py",
    "content": "#!/usr/bin/env python3\nimport csv\nimport os\nimport subprocess\nimport tarfile\nimport unicodedata\nfrom glob import glob\nfrom multiprocessing import Pool\n\nimport progressbar\n\nfrom deepspeech_training.util.downloader import SIMPLE_BAR, maybe_download\nfrom deepspeech_training.util.importers import (\n    get_counter,\n    get_imported_samples,\n    get_importers_parser,\n    get_validate_label,\n    print_import_report,\n)\nfrom ds_ctcdecoder import Alphabet\n\nFIELDNAMES = [\"wav_filename\", \"wav_filesize\", \"transcript\"]\nSAMPLE_RATE = 16000\nMAX_SECS = 15\n\nARCHIVE_DIR_NAME = \"African_Accented_French\"\nARCHIVE_NAME = \"African_Accented_French.tar.gz\"\nARCHIVE_URL = \"http://www.openslr.org/resources/57/\" + ARCHIVE_NAME\n\n\ndef _download_and_preprocess_data(target_dir):\n    # Making path absolute\n    target_dir = os.path.abspath(target_dir)\n    # Conditionally download data\n    archive_path = maybe_download(ARCHIVE_NAME, target_dir, ARCHIVE_URL)\n    # Conditionally extract data\n    _maybe_extract(target_dir, ARCHIVE_DIR_NAME, archive_path)\n    # Produce CSV files\n    _maybe_convert_sets(target_dir, ARCHIVE_DIR_NAME)\n\n\ndef _maybe_extract(target_dir, extracted_data, archive_path):\n    # If target_dir/extracted_data does not exist, extract archive in target_dir\n    extracted_path = os.path.join(target_dir, extracted_data)\n    if not os.path.exists(extracted_path):\n        print('No directory \"%s\" - extracting archive...' % extracted_path)\n        if not os.path.isdir(extracted_path):\n            os.mkdir(extracted_path)\n        tar = tarfile.open(archive_path)\n        tar.extractall(target_dir)\n        tar.close()\n    else:\n        print('Found directory \"%s\" - not extracting it from archive.' % archive_path)\n\n\ndef one_sample(sample):\n    \"\"\" Take a audio file, and optionally convert it to 16kHz WAV \"\"\"\n    wav_filename = sample[0]\n    file_size = -1\n    frames = 0\n    if os.path.exists(wav_filename):\n        file_size = os.path.getsize(wav_filename)\n        frames = int(\n            subprocess.check_output(\n                [\"soxi\", \"-s\", wav_filename], stderr=subprocess.STDOUT\n            )\n        )\n    label = label_filter(sample[1])\n    counter = get_counter()\n    rows = []\n    if file_size == -1:\n        # Excluding samples that failed upon conversion\n        counter[\"failed\"] += 1\n    elif label is None:\n        # Excluding samples that failed on label validation\n        counter[\"invalid_label\"] += 1\n    elif int(frames / SAMPLE_RATE * 1000 / 15 / 2) < len(str(label)):\n        # Excluding samples that are too short to fit the transcript\n        counter[\"too_short\"] += 1\n    elif frames / SAMPLE_RATE > MAX_SECS:\n        # Excluding very long samples to keep a reasonable batch-size\n        counter[\"too_long\"] += 1\n    else:\n        # This one is good - keep it for the target CSV\n        rows.append((wav_filename, file_size, label))\n        counter[\"imported_time\"] += frames\n    counter[\"all\"] += 1\n    counter[\"total_time\"] += frames\n\n    return (counter, rows)\n\n\ndef _maybe_convert_sets(target_dir, extracted_data):\n    extracted_dir = os.path.join(target_dir, extracted_data)\n    # override existing CSV with normalized one\n    target_csv_template = os.path.join(\n        target_dir, ARCHIVE_DIR_NAME, ARCHIVE_NAME.replace(\".tar.gz\", \"_{}.csv\")\n    )\n    if os.path.isfile(target_csv_template):\n        return\n\n    wav_root_dir = os.path.join(extracted_dir)\n\n    all_files = [\n        \"transcripts/train/yaounde/fn_text.txt\",\n        \"transcripts/train/ca16_conv/transcripts.txt\",\n        \"transcripts/train/ca16_read/conditioned.txt\",\n        \"transcripts/dev/niger_west_african_fr/transcripts.txt\",\n        \"speech/dev/niger_west_african_fr/niger_wav_file_name_transcript.tsv\",\n        \"transcripts/devtest/ca16_read/conditioned.txt\",\n        \"transcripts/test/ca16/prompts.txt\",\n    ]\n\n    transcripts = {}\n    for tr in all_files:\n        with open(os.path.join(target_dir, ARCHIVE_DIR_NAME, tr), \"r\") as tr_source:\n            for line in tr_source.readlines():\n                line = line.strip()\n\n                if \".tsv\" in tr:\n                    sep = \"\t\"\n                else:\n                    sep = \" \"\n\n                audio = os.path.basename(line.split(sep)[0])\n\n                if not (\".wav\" in audio):\n                    if \".tdf\" in audio:\n                        audio = audio.replace(\".tdf\", \".wav\")\n                    else:\n                        audio += \".wav\"\n\n                transcript = \" \".join(line.split(sep)[1:])\n                transcripts[audio] = transcript\n\n    # Get audiofile path and transcript for each sentence in tsv\n    samples = []\n    glob_dir = os.path.join(wav_root_dir, \"**/*.wav\")\n    for record in glob(glob_dir, recursive=True):\n        record_file = os.path.basename(record)\n        if record_file in transcripts:\n            samples.append((record, transcripts[record_file]))\n\n    # Keep track of how many samples are good vs. problematic\n    counter = get_counter()\n    num_samples = len(samples)\n    rows = []\n\n    print(\"Importing WAV files...\")\n    pool = Pool()\n    bar = progressbar.ProgressBar(max_value=num_samples, widgets=SIMPLE_BAR)\n    for i, processed in enumerate(pool.imap_unordered(one_sample, samples), start=1):\n        counter += processed[0]\n        rows += processed[1]\n        bar.update(i)\n    bar.update(num_samples)\n    pool.close()\n    pool.join()\n\n    with open(target_csv_template.format(\"train\"), \"w\", encoding=\"utf-8\", newline=\"\") as train_csv_file:  # 80%\n        with open(target_csv_template.format(\"dev\"), \"w\", encoding=\"utf-8\", newline=\"\") as dev_csv_file:  # 10%\n            with open(target_csv_template.format(\"test\"), \"w\", encoding=\"utf-8\", newline=\"\") as test_csv_file:  # 10%\n                train_writer = csv.DictWriter(train_csv_file, fieldnames=FIELDNAMES)\n                train_writer.writeheader()\n                dev_writer = csv.DictWriter(dev_csv_file, fieldnames=FIELDNAMES)\n                dev_writer.writeheader()\n                test_writer = csv.DictWriter(test_csv_file, fieldnames=FIELDNAMES)\n                test_writer.writeheader()\n\n                for i, item in enumerate(rows):\n                    transcript = validate_label(item[2])\n                    if not transcript:\n                        continue\n                    wav_filename = item[0]\n                    i_mod = i % 10\n                    if i_mod == 0:\n                        writer = test_writer\n                    elif i_mod == 1:\n                        writer = dev_writer\n                    else:\n                        writer = train_writer\n                    writer.writerow(\n                        dict(\n                            wav_filename=wav_filename,\n                            wav_filesize=os.path.getsize(wav_filename),\n                            transcript=transcript,\n                        )\n                    )\n\n    imported_samples = get_imported_samples(counter)\n    assert counter[\"all\"] == num_samples\n    assert len(rows) == imported_samples\n\n    print_import_report(counter, SAMPLE_RATE, MAX_SECS)\n\n\ndef handle_args():\n    parser = get_importers_parser(\n        description=\"Importer for African Accented French dataset. More information on http://www.openslr.org/57/.\"\n    )\n    parser.add_argument(dest=\"target_dir\")\n    parser.add_argument(\n        \"--filter_alphabet\",\n        help=\"Exclude samples with characters not in provided alphabet\",\n    )\n    parser.add_argument(\n        \"--normalize\",\n        action=\"store_true\",\n        help=\"Converts diacritic characters to their base ones\",\n    )\n    return parser.parse_args()\n\n\nif __name__ == \"__main__\":\n    CLI_ARGS = handle_args()\n    ALPHABET = Alphabet(CLI_ARGS.filter_alphabet) if CLI_ARGS.filter_alphabet else None\n    validate_label = get_validate_label(CLI_ARGS)\n\n    def label_filter(label):\n        if CLI_ARGS.normalize:\n            label = (\n                unicodedata.normalize(\"NFKD\", label.strip())\n                .encode(\"ascii\", \"ignore\")\n                .decode(\"ascii\", \"ignore\")\n            )\n        label = validate_label(label)\n        if ALPHABET and label and not ALPHABET.CanEncode(label):\n            label = None\n        return label\n\n    _download_and_preprocess_data(target_dir=CLI_ARGS.target_dir)\n"
  },
  {
    "path": "bin/import_swb.py",
    "content": "#!/usr/bin/env python\n# ensure that you have downloaded the LDC dataset LDC97S62 and tar exists in a folder e.g.\n# ./data/swb/swb1_LDC97S62.tgz\n# from the deepspeech directory run with: ./bin/import_swb.py ./data/swb/\nimport codecs\nimport fnmatch\nimport os\nimport random\nimport subprocess\nimport sys\nimport tarfile\nimport unicodedata\nimport wave\n\nimport librosa\nimport pandas\nimport requests\nimport soundfile  # <= Has an external dependency on libsndfile\n\nfrom deepspeech_training.util.importers import validate_label_eng as validate_label\n\n# ARCHIVE_NAME refers to ISIP alignments from 01/29/03\nARCHIVE_NAME = \"switchboard_word_alignments.tar.gz\"\nARCHIVE_URL = \"http://www.openslr.org/resources/5/\"\nARCHIVE_DIR_NAME = \"LDC97S62\"\nLDC_DATASET = \"swb1_LDC97S62.tgz\"\n\n\ndef download_file(folder, url):\n    # https://stackoverflow.com/a/16696317/738515\n    local_filename = url.split(\"/\")[-1]\n    full_filename = os.path.join(folder, local_filename)\n    r = requests.get(url, stream=True)\n    with open(full_filename, \"wb\") as f:\n        for chunk in r.iter_content(chunk_size=1024):\n            if chunk:  # filter out keep-alive new chunks\n                f.write(chunk)\n    return full_filename\n\n\ndef maybe_download(archive_url, target_dir, ldc_dataset):\n    # If archive file does not exist, download it...\n    archive_path = os.path.join(target_dir, ldc_dataset)\n    ldc_path = archive_url + ldc_dataset\n    if not os.path.exists(target_dir):\n        print('No path \"%s\" - creating ...' % target_dir)\n        os.makedirs(target_dir)\n\n    if not os.path.exists(archive_path):\n        print('No archive \"%s\" - downloading...' % archive_path)\n        download_file(target_dir, ldc_path)\n    else:\n        print('Found archive \"%s\" - not downloading.' % archive_path)\n    return archive_path\n\n\ndef _download_and_preprocess_data(data_dir):\n    new_data_dir = os.path.join(data_dir, ARCHIVE_DIR_NAME)\n    target_dir = os.path.abspath(new_data_dir)\n    archive_path = os.path.abspath(os.path.join(data_dir, LDC_DATASET))\n\n    # Check swb1_LDC97S62.tgz then extract\n    assert os.path.isfile(archive_path)\n    _extract(target_dir, archive_path)\n\n    # Transcripts\n    transcripts_path = maybe_download(ARCHIVE_URL, target_dir, ARCHIVE_NAME)\n    _extract(target_dir, transcripts_path)\n\n    # Check swb1_d1/2/3/4/swb_ms98_transcriptions\n    expected_folders = [\n        \"swb1_d1\",\n        \"swb1_d2\",\n        \"swb1_d3\",\n        \"swb1_d4\",\n        \"swb_ms98_transcriptions\",\n    ]\n    assert all([os.path.isdir(os.path.join(target_dir, e)) for e in expected_folders])\n\n    # Conditionally convert swb sph data to wav\n    _maybe_convert_wav(target_dir, \"swb1_d1\", \"swb1_d1-wav\")\n    _maybe_convert_wav(target_dir, \"swb1_d2\", \"swb1_d2-wav\")\n    _maybe_convert_wav(target_dir, \"swb1_d3\", \"swb1_d3-wav\")\n    _maybe_convert_wav(target_dir, \"swb1_d4\", \"swb1_d4-wav\")\n\n    # Conditionally split wav data\n    d1 = _maybe_split_wav_and_sentences(\n        target_dir, \"swb_ms98_transcriptions\", \"swb1_d1-wav\", \"swb1_d1-split-wav\"\n    )\n    d2 = _maybe_split_wav_and_sentences(\n        target_dir, \"swb_ms98_transcriptions\", \"swb1_d2-wav\", \"swb1_d2-split-wav\"\n    )\n    d3 = _maybe_split_wav_and_sentences(\n        target_dir, \"swb_ms98_transcriptions\", \"swb1_d3-wav\", \"swb1_d3-split-wav\"\n    )\n    d4 = _maybe_split_wav_and_sentences(\n        target_dir, \"swb_ms98_transcriptions\", \"swb1_d4-wav\", \"swb1_d4-split-wav\"\n    )\n\n    swb_files = d1.append(d2).append(d3).append(d4)\n\n    train_files, dev_files, test_files = _split_sets(swb_files)\n\n    # Write sets to disk as CSV files\n    train_files.to_csv(os.path.join(target_dir, \"swb-train.csv\"), index=False)\n    dev_files.to_csv(os.path.join(target_dir, \"swb-dev.csv\"), index=False)\n    test_files.to_csv(os.path.join(target_dir, \"swb-test.csv\"), index=False)\n\n\ndef _extract(target_dir, archive_path):\n    with tarfile.open(archive_path) as tar:\n        tar.extractall(target_dir)\n\n\ndef _maybe_convert_wav(data_dir, original_data, converted_data):\n    source_dir = os.path.join(data_dir, original_data)\n    target_dir = os.path.join(data_dir, converted_data)\n\n    # Conditionally convert sph files to wav files\n    if os.path.exists(target_dir):\n        print(\"skipping maybe_convert_wav\")\n        return\n\n    # Create target_dir\n    os.makedirs(target_dir)\n\n    # Loop over sph files in source_dir and convert each to 16-bit PCM wav\n    for root, dirnames, filenames in os.walk(source_dir):\n        for filename in fnmatch.filter(filenames, \"*.sph\"):\n            for channel in [\"1\", \"2\"]:\n                sph_file = os.path.join(root, filename)\n                wav_filename = (\n                    os.path.splitext(os.path.basename(sph_file))[0]\n                    + \"-\"\n                    + channel\n                    + \".wav\"\n                )\n                wav_file = os.path.join(target_dir, wav_filename)\n                temp_wav_filename = (\n                    os.path.splitext(os.path.basename(sph_file))[0]\n                    + \"-\"\n                    + channel\n                    + \"-temp.wav\"\n                )\n                temp_wav_file = os.path.join(target_dir, temp_wav_filename)\n                print(\"converting {} to {}\".format(sph_file, temp_wav_file))\n                subprocess.check_call(\n                    [\n                        \"sph2pipe\",\n                        \"-c\",\n                        channel,\n                        \"-p\",\n                        \"-f\",\n                        \"rif\",\n                        sph_file,\n                        temp_wav_file,\n                    ]\n                )\n                print(\"upsampling {} to {}\".format(temp_wav_file, wav_file))\n                audioData, frameRate = librosa.load(temp_wav_file, sr=16000, mono=True)\n                soundfile.write(wav_file, audioData, frameRate, \"PCM_16\")\n                os.remove(temp_wav_file)\n\n\ndef _parse_transcriptions(trans_file):\n    segments = []\n    with codecs.open(trans_file, \"r\", \"utf-8\") as fin:\n        for line in fin:\n            if line.startswith(\"#\") or len(line) <= 1:\n                continue\n\n            tokens = line.split()\n            start_time = float(tokens[1])\n            stop_time = float(tokens[2])\n            transcript = validate_label(\" \".join(tokens[3:]))\n\n            if transcript == None:\n                continue\n\n            # We need to do the encode-decode dance here because encode\n            # returns a bytes() object on Python 3, and text_to_char_array\n            # expects a string.\n            transcript = (\n                unicodedata.normalize(\"NFKD\", transcript)\n                .encode(\"ascii\", \"ignore\")\n                .decode(\"ascii\", \"ignore\")\n            )\n\n            segments.append(\n                {\n                    \"start_time\": start_time,\n                    \"stop_time\": stop_time,\n                    \"transcript\": transcript,\n                }\n            )\n    return segments\n\n\ndef _maybe_split_wav_and_sentences(data_dir, trans_data, original_data, converted_data):\n    trans_dir = os.path.join(data_dir, trans_data)\n    source_dir = os.path.join(data_dir, original_data)\n    target_dir = os.path.join(data_dir, converted_data)\n    if os.path.exists(target_dir):\n        print(\"skipping maybe_split_wav\")\n        return\n\n    os.makedirs(target_dir)\n\n    files = []\n\n    # Loop over transcription files and split corresponding wav\n    for root, dirnames, filenames in os.walk(trans_dir):\n        for filename in fnmatch.filter(filenames, \"*.text\"):\n            if \"trans\" not in filename:\n                continue\n            trans_file = os.path.join(root, filename)\n            segments = _parse_transcriptions(trans_file)\n\n            # Open wav corresponding to transcription file\n            channel = (\"2\", \"1\")[\n                (os.path.splitext(os.path.basename(trans_file))[0])[6] == \"A\"\n            ]\n            wav_filename = (\n                \"sw0\"\n                + (os.path.splitext(os.path.basename(trans_file))[0])[2:6]\n                + \"-\"\n                + channel\n                + \".wav\"\n            )\n            wav_file = os.path.join(source_dir, wav_filename)\n\n            print(\"splitting {} according to {}\".format(wav_file, trans_file))\n\n            if not os.path.exists(wav_file):\n                print(\"skipping. does not exist:\" + wav_file)\n                continue\n\n            origAudio = wave.open(wav_file, \"r\")\n\n            # Loop over segments and split wav_file for each segment\n            for segment in segments:\n                # Create wav segment filename\n                start_time = segment[\"start_time\"]\n                stop_time = segment[\"stop_time\"]\n                new_wav_filename = (\n                    os.path.splitext(os.path.basename(trans_file))[0]\n                    + \"-\"\n                    + str(start_time)\n                    + \"-\"\n                    + str(stop_time)\n                    + \".wav\"\n                )\n                if _is_wav_too_short(new_wav_filename):\n                    continue\n                new_wav_file = os.path.join(target_dir, new_wav_filename)\n\n                _split_wav(origAudio, start_time, stop_time, new_wav_file)\n\n                new_wav_filesize = os.path.getsize(new_wav_file)\n                transcript = segment[\"transcript\"]\n                files.append(\n                    (os.path.abspath(new_wav_file), new_wav_filesize, transcript)\n                )\n\n            # Close origAudio\n            origAudio.close()\n\n    return pandas.DataFrame(\n        data=files, columns=[\"wav_filename\", \"wav_filesize\", \"transcript\"]\n    )\n\n\ndef _is_wav_too_short(wav_filename):\n    short_wav_filenames = [\n        \"sw2986A-ms98-a-trans-80.6385-83.358875.wav\",\n        \"sw2663A-ms98-a-trans-161.12025-164.213375.wav\",\n    ]\n    return wav_filename in short_wav_filenames\n\n\ndef _split_wav(origAudio, start_time, stop_time, new_wav_file):\n    frameRate = origAudio.getframerate()\n    origAudio.setpos(int(start_time * frameRate))\n    chunkData = origAudio.readframes(int((stop_time - start_time) * frameRate))\n    chunkAudio = wave.open(new_wav_file, \"w\")\n    chunkAudio.setnchannels(origAudio.getnchannels())\n    chunkAudio.setsampwidth(origAudio.getsampwidth())\n    chunkAudio.setframerate(frameRate)\n    chunkAudio.writeframes(chunkData)\n    chunkAudio.close()\n\n\ndef _split_sets(filelist):\n    \"\"\"\n    randomply split the datasets into train, validation, and test sets where the size of the\n    validation and test sets are determined by the `get_sample_size` function. \n    \"\"\"\n    random.shuffle(filelist)\n    sample_size = get_sample_size(len(filelist))\n\n    train_beg = 0\n    train_end = len(filelist) - 2 * sample_size\n\n    dev_beg = train_end\n    dev_end = train_end + sample_size\n\n    test_beg = dev_end\n    test_end = len(filelist)\n\n    return (\n        filelist[train_beg:train_end],\n        filelist[dev_beg:dev_end],\n        filelist[test_beg:test_end],\n    )\n\n\ndef get_sample_size(population_size):\n    \"\"\"calculates the sample size for a 99% confidence and 1% margin of error\n    \"\"\"\n    margin_of_error = 0.01\n    fraction_picking = 0.50\n    z_score = 2.58  # Corresponds to confidence level 99%\n    numerator = (z_score ** 2 * fraction_picking * (1 - fraction_picking)) / (\n        margin_of_error ** 2\n    )\n    sample_size = 0\n    for train_size in range(population_size, 0, -1):\n        denominator = 1 + (z_score ** 2 * fraction_picking * (1 - fraction_picking)) / (\n            margin_of_error ** 2 * train_size\n        )\n        sample_size = int(numerator / denominator)\n        if 2 * sample_size + train_size <= population_size:\n            break\n    return sample_size\n\n\ndef _read_data_set(\n    filelist,\n    thread_count,\n    batch_size,\n    numcep,\n    numcontext,\n    stride=1,\n    offset=0,\n    next_index=lambda i: i + 1,\n    limit=0,\n):\n    # Optionally apply dataset size limit\n    if limit > 0:\n        filelist = filelist.iloc[:limit]\n\n    filelist = filelist[offset::stride]\n\n    # Return DataSet\n    return DataSet(\n        txt_files, thread_count, batch_size, numcep, numcontext, next_index=next_index\n    )\n\n\nif __name__ == \"__main__\":\n    _download_and_preprocess_data(sys.argv[1])\n"
  },
  {
    "path": "bin/import_swc.py",
    "content": "#!/usr/bin/env python\n\"\"\"\nDownloads and prepares (parts of) the \"Spoken Wikipedia Corpora\" for DeepSpeech.py\nUse \"python3 import_swc.py -h\" for help\n\"\"\"\n\nimport argparse\nimport csv\nimport os\nimport random\nimport re\nimport shutil\nimport sys\nimport tarfile\nimport unicodedata\nimport wave\nimport xml.etree.ElementTree as ET\nfrom collections import Counter\nfrom glob import glob\nfrom multiprocessing.pool import ThreadPool\n\nimport progressbar\nimport sox\n\nfrom deepspeech_training.util.downloader import SIMPLE_BAR, maybe_download\nfrom deepspeech_training.util.importers import validate_label_eng as validate_label\nfrom ds_ctcdecoder import Alphabet\n\nSWC_URL = \"https://www2.informatik.uni-hamburg.de/nats/pub/SWC/SWC_{language}.tar\"\nSWC_ARCHIVE = \"SWC_{language}.tar\"\nLANGUAGES = [\"dutch\", \"english\", \"german\"]\nFIELDNAMES = [\"wav_filename\", \"wav_filesize\", \"transcript\"]\nFIELDNAMES_EXT = FIELDNAMES + [\"article\", \"speaker\"]\nCHANNELS = 1\nSAMPLE_RATE = 16000\nUNKNOWN = \"<unknown>\"\nAUDIO_PATTERN = \"audio*.ogg\"\nWAV_NAME = \"audio.wav\"\nALIGNED_NAME = \"aligned.swc\"\n\nSUBSTITUTIONS = {\n    \"german\": [\n        (re.compile(r\"\\$\"), \"dollar\"),\n        (re.compile(r\"€\"), \"euro\"),\n        (re.compile(r\"£\"), \"pfund\"),\n        (\n            re.compile(r\"ein tausend ([^\\s]+) hundert ([^\\s]+) er( |$)\"),\n            r\"\\1zehnhundert \\2er \",\n        ),\n        (re.compile(r\"ein tausend (acht|neun) hundert\"), r\"\\1zehnhundert\"),\n        (\n            re.compile(\n                r\"eins punkt null null null punkt null null null punkt null null null\"\n            ),\n            \"eine milliarde\",\n        ),\n        (\n            re.compile(\n                r\"punkt null null null punkt null null null punkt null null null\"\n            ),\n            \"milliarden\",\n        ),\n        (re.compile(r\"eins punkt null null null punkt null null null\"), \"eine million\"),\n        (re.compile(r\"punkt null null null punkt null null null\"), \"millionen\"),\n        (re.compile(r\"eins punkt null null null\"), \"ein tausend\"),\n        (re.compile(r\"punkt null null null\"), \"tausend\"),\n        (re.compile(r\"punkt null\"), None),\n    ]\n}\n\nDONT_NORMALIZE = {\"german\": \"ÄÖÜäöüß\"}\n\nPRE_FILTER = str.maketrans(dict.fromkeys(\"/()[]{}<>:\"))\n\n\nclass Sample:\n    def __init__(self, wav_path, start, end, text, article, speaker, sub_set=None):\n        self.wav_path = wav_path\n        self.start = start\n        self.end = end\n        self.text = text\n        self.article = article\n        self.speaker = speaker\n        self.sub_set = sub_set\n\n\ndef fail(message):\n    print(message)\n    sys.exit(1)\n\n\ndef group(lst, get_key):\n    groups = {}\n    for obj in lst:\n        key = get_key(obj)\n        if key in groups:\n            groups[key].append(obj)\n        else:\n            groups[key] = [obj]\n    return groups\n\n\ndef get_sample_size(population_size):\n    margin_of_error = 0.01\n    fraction_picking = 0.50\n    z_score = 2.58  # Corresponds to confidence level 99%\n    numerator = (z_score ** 2 * fraction_picking * (1 - fraction_picking)) / (\n        margin_of_error ** 2\n    )\n    sample_size = 0\n    for train_size in range(population_size, 0, -1):\n        denominator = 1 + (z_score ** 2 * fraction_picking * (1 - fraction_picking)) / (\n            margin_of_error ** 2 * train_size\n        )\n        sample_size = int(numerator / denominator)\n        if 2 * sample_size + train_size <= population_size:\n            break\n    return sample_size\n\n\ndef maybe_download_language(language):\n    lang_upper = language[0].upper() + language[1:]\n    return maybe_download(\n        SWC_ARCHIVE.format(language=lang_upper),\n        CLI_ARGS.base_dir,\n        SWC_URL.format(language=lang_upper),\n    )\n\n\ndef maybe_extract(data_dir, extracted_data, archive):\n    extracted = os.path.join(data_dir, extracted_data)\n    if os.path.isdir(extracted):\n        print('Found directory \"{}\" - not extracting.'.format(extracted))\n    else:\n        print('Extracting \"{}\"...'.format(archive))\n        with tarfile.open(archive) as tar:\n            members = tar.getmembers()\n            bar = progressbar.ProgressBar(max_value=len(members), widgets=SIMPLE_BAR)\n            for member in bar(members):\n                tar.extract(member=member, path=extracted)\n    return extracted\n\n\ndef ignored(node):\n    if node is None:\n        return False\n    if node.tag == \"ignored\":\n        return True\n    return ignored(node.find(\"..\"))\n\n\ndef read_token(token):\n    texts, start, end = [], None, None\n    notes = token.findall(\"n\")\n    if len(notes) > 0:\n        for note in notes:\n            attributes = note.attrib\n            if start is None and \"start\" in attributes:\n                start = int(attributes[\"start\"])\n            if \"end\" in attributes:\n                token_end = int(attributes[\"end\"])\n                if end is None or token_end > end:\n                    end = token_end\n            if \"pronunciation\" in attributes:\n                t = attributes[\"pronunciation\"]\n                texts.append(t)\n    elif \"text\" in token.attrib:\n        texts.append(token.attrib[\"text\"])\n    return start, end, \" \".join(texts)\n\n\ndef in_alphabet(alphabet, c):\n    return alphabet.CanEncode(c) if alphabet else True\n\n\n\nALPHABETS = {}\n\n\ndef get_alphabet(language):\n    if language in ALPHABETS:\n        return ALPHABETS[language]\n    alphabet_path = getattr(CLI_ARGS, language + \"_alphabet\")\n    alphabet = Alphabet(alphabet_path) if alphabet_path else None\n    ALPHABETS[language] = alphabet\n    return alphabet\n\n\ndef label_filter(label, language):\n    label = label.translate(PRE_FILTER)\n    label = validate_label(label)\n    if label is None:\n        return None, \"validation\"\n    substitutions = SUBSTITUTIONS[language] if language in SUBSTITUTIONS else []\n    for pattern, replacement in substitutions:\n        if replacement is None:\n            if pattern.match(label):\n                return None, \"substitution rule\"\n        else:\n            label = pattern.sub(replacement, label)\n    chars = []\n    dont_normalize = DONT_NORMALIZE[language] if language in DONT_NORMALIZE else \"\"\n    alphabet = get_alphabet(language)\n    for c in label:\n        if CLI_ARGS.normalize and c not in dont_normalize and not in_alphabet(alphabet, c):\n            c = unicodedata.normalize(\"NFKD\", c).encode(\"ascii\", \"ignore\").decode(\"ascii\", \"ignore\")\n        for sc in c:\n            if not in_alphabet(alphabet, sc):\n                return None, \"illegal character\"\n            chars.append(sc)\n    label = \"\".join(chars)\n    label = validate_label(label)\n    return label, \"validation\" if label is None else None\n\n\ndef collect_samples(base_dir, language):\n    roots = []\n    for root, _, files in os.walk(base_dir):\n        if ALIGNED_NAME in files and WAV_NAME in files:\n            roots.append(root)\n    samples = []\n    reasons = Counter()\n\n    def add_sample(\n        p_wav_path, p_article, p_speaker, p_start, p_end, p_text, p_reason=\"complete\"\n    ):\n        if p_start is not None and p_end is not None and p_text is not None:\n            duration = p_end - p_start\n            text, filter_reason = label_filter(p_text, language)\n            skip = False\n            if filter_reason is not None:\n                skip = True\n                p_reason = filter_reason\n            elif CLI_ARGS.exclude_unknown_speakers and p_speaker == UNKNOWN:\n                skip = True\n                p_reason = \"unknown speaker\"\n            elif CLI_ARGS.exclude_unknown_articles and p_article == UNKNOWN:\n                skip = True\n                p_reason = \"unknown article\"\n            elif duration > CLI_ARGS.max_duration > 0 and CLI_ARGS.ignore_too_long:\n                skip = True\n                p_reason = \"exceeded duration\"\n            elif int(duration / 30) < len(text):\n                skip = True\n                p_reason = \"too short to decode\"\n            elif duration / len(text) < 10:\n                skip = True\n                p_reason = \"length duration ratio\"\n            if skip:\n                reasons[p_reason] += 1\n            else:\n                samples.append(\n                    Sample(p_wav_path, p_start, p_end, text, p_article, p_speaker)\n                )\n        elif p_start is None or p_end is None:\n            reasons[\"missing timestamps\"] += 1\n        else:\n            reasons[\"missing text\"] += 1\n\n    print(\"Collecting samples...\")\n    bar = progressbar.ProgressBar(max_value=len(roots), widgets=SIMPLE_BAR)\n    for root in bar(roots):\n        wav_path = os.path.join(root, WAV_NAME)\n        aligned = ET.parse(os.path.join(root, ALIGNED_NAME))\n        article = UNKNOWN\n        speaker = UNKNOWN\n        for prop in aligned.iter(\"prop\"):\n            attributes = prop.attrib\n            if \"key\" in attributes and \"value\" in attributes:\n                if attributes[\"key\"] == \"DC.identifier\":\n                    article = attributes[\"value\"]\n                elif attributes[\"key\"] == \"reader.name\":\n                    speaker = attributes[\"value\"]\n        for sentence in aligned.iter(\"s\"):\n            if ignored(sentence):\n                continue\n            split = False\n            tokens = list(map(read_token, sentence.findall(\"t\")))\n            sample_start, sample_end, token_texts, sample_texts = None, None, [], []\n            for token_start, token_end, token_text in tokens:\n                if CLI_ARGS.exclude_numbers and any(c.isdigit() for c in token_text):\n                    add_sample(\n                        wav_path,\n                        article,\n                        speaker,\n                        sample_start,\n                        sample_end,\n                        \" \".join(sample_texts),\n                        p_reason=\"has numbers\",\n                    )\n                    sample_start, sample_end, token_texts, sample_texts = (\n                        None,\n                        None,\n                        [],\n                        [],\n                    )\n                    continue\n                if sample_start is None:\n                    sample_start = token_start\n                if sample_start is None:\n                    continue\n                token_texts.append(token_text)\n                if token_end is not None:\n                    if (\n                        token_start != sample_start\n                        and token_end - sample_start > CLI_ARGS.max_duration > 0\n                    ):\n                        add_sample(\n                            wav_path,\n                            article,\n                            speaker,\n                            sample_start,\n                            sample_end,\n                            \" \".join(sample_texts),\n                            p_reason=\"split\",\n                        )\n                        sample_start = sample_end\n                        sample_texts = []\n                        split = True\n                    sample_end = token_end\n                    sample_texts.extend(token_texts)\n                    token_texts = []\n            add_sample(\n                wav_path,\n                article,\n                speaker,\n                sample_start,\n                sample_end,\n                \" \".join(sample_texts),\n                p_reason=\"split\" if split else \"complete\",\n            )\n    print(\"Skipped samples:\")\n    for reason, n in reasons.most_common():\n        print(\" - {}: {}\".format(reason, n))\n    return samples\n\n\ndef maybe_convert_one_to_wav(entry):\n    root, _, files = entry\n    transformer = sox.Transformer()\n    transformer.convert(samplerate=SAMPLE_RATE, n_channels=CHANNELS)\n    combiner = sox.Combiner()\n    combiner.convert(samplerate=SAMPLE_RATE, n_channels=CHANNELS)\n    output_wav = os.path.join(root, WAV_NAME)\n    if os.path.isfile(output_wav):\n        return\n    files = sorted(glob(os.path.join(root, AUDIO_PATTERN)))\n    try:\n        if len(files) == 1:\n            transformer.build(files[0], output_wav)\n        elif len(files) > 1:\n            wav_files = []\n            for i, file in enumerate(files):\n                wav_path = os.path.join(root, \"audio{}.wav\".format(i))\n                transformer.build(file, wav_path)\n                wav_files.append(wav_path)\n            combiner.set_input_format(file_type=[\"wav\"] * len(wav_files))\n            combiner.build(wav_files, output_wav, \"concatenate\")\n    except sox.core.SoxError:\n        return\n\n\ndef maybe_convert_to_wav(base_dir):\n    roots = list(os.walk(base_dir))\n    print(\"Converting and joining source audio files...\")\n    bar = progressbar.ProgressBar(max_value=len(roots), widgets=SIMPLE_BAR)\n    tp = ThreadPool()\n    for _ in bar(tp.imap_unordered(maybe_convert_one_to_wav, roots)):\n        pass\n    tp.close()\n    tp.join()\n\n\ndef assign_sub_sets(samples):\n    sample_size = get_sample_size(len(samples))\n    speakers = group(samples, lambda sample: sample.speaker).values()\n    speakers = list(sorted(speakers, key=len))\n    sample_sets = [[], []]\n    while any(map(lambda s: len(s) < sample_size, sample_sets)) and len(speakers) > 0:\n        for sample_set in sample_sets:\n            if len(sample_set) < sample_size and len(speakers) > 0:\n                sample_set.extend(speakers.pop(0))\n    train_set = sum(speakers, [])\n    if len(train_set) == 0:\n        print(\n            \"WARNING: Unable to build dev and test sets without speaker bias as there is no speaker meta data\"\n        )\n        random.seed(42)  # same source data == same output\n        random.shuffle(samples)\n        for index, sample in enumerate(samples):\n            if index < sample_size:\n                sample.sub_set = \"dev\"\n            elif index < 2 * sample_size:\n                sample.sub_set = \"test\"\n            else:\n                sample.sub_set = \"train\"\n    else:\n        for sub_set, sub_set_samples in [\n            (\"train\", train_set),\n            (\"dev\", sample_sets[0]),\n            (\"test\", sample_sets[1]),\n        ]:\n            for sample in sub_set_samples:\n                sample.sub_set = sub_set\n    for sub_set, sub_set_samples in group(samples, lambda s: s.sub_set).items():\n        t = sum(map(lambda s: s.end - s.start, sub_set_samples)) / (1000 * 60 * 60)\n        print(\n            'Sub-set \"{}\" with {} samples (duration: {:.2f} h)'.format(\n                sub_set, len(sub_set_samples), t\n            )\n        )\n\n\ndef create_sample_dirs(language):\n    print(\"Creating sample directories...\")\n    for set_name in [\"train\", \"dev\", \"test\"]:\n        dir_path = os.path.join(CLI_ARGS.base_dir, language + \"-\" + set_name)\n        if not os.path.isdir(dir_path):\n            os.mkdir(dir_path)\n\n\ndef split_audio_files(samples, language):\n    print(\"Splitting audio files...\")\n    sub_sets = Counter()\n    src_wav_files = group(samples, lambda s: s.wav_path).items()\n    bar = progressbar.ProgressBar(max_value=len(src_wav_files), widgets=SIMPLE_BAR)\n    for wav_path, file_samples in bar(src_wav_files):\n        file_samples = sorted(file_samples, key=lambda s: s.start)\n        with wave.open(wav_path, \"r\") as src_wav_file:\n            rate = src_wav_file.getframerate()\n            for sample in file_samples:\n                index = sub_sets[sample.sub_set]\n                sample_wav_path = os.path.join(\n                    CLI_ARGS.base_dir,\n                    language + \"-\" + sample.sub_set,\n                    \"sample-{0:06d}.wav\".format(index),\n                )\n                sample.wav_path = sample_wav_path\n                sub_sets[sample.sub_set] += 1\n                src_wav_file.setpos(int(sample.start * rate / 1000.0))\n                data = src_wav_file.readframes(\n                    int((sample.end - sample.start) * rate / 1000.0)\n                )\n                with wave.open(sample_wav_path, \"w\") as sample_wav_file:\n                    sample_wav_file.setnchannels(src_wav_file.getnchannels())\n                    sample_wav_file.setsampwidth(src_wav_file.getsampwidth())\n                    sample_wav_file.setframerate(rate)\n                    sample_wav_file.writeframes(data)\n\n\ndef write_csvs(samples, language):\n    for sub_set, set_samples in group(samples, lambda s: s.sub_set).items():\n        set_samples = sorted(set_samples, key=lambda s: s.wav_path)\n        base_dir = os.path.abspath(CLI_ARGS.base_dir)\n        csv_path = os.path.join(base_dir, language + \"-\" + sub_set + \".csv\")\n        print('Writing \"{}\"...'.format(csv_path))\n        with open(csv_path, \"w\", encoding=\"utf-8\", newline=\"\") as csv_file:\n            writer = csv.DictWriter(\n                csv_file, fieldnames=FIELDNAMES_EXT if CLI_ARGS.add_meta else FIELDNAMES\n            )\n            writer.writeheader()\n            bar = progressbar.ProgressBar(\n                max_value=len(set_samples), widgets=SIMPLE_BAR\n            )\n            for sample in bar(set_samples):\n                row = {\n                    \"wav_filename\": os.path.relpath(sample.wav_path, base_dir),\n                    \"wav_filesize\": os.path.getsize(sample.wav_path),\n                    \"transcript\": sample.text,\n                }\n                if CLI_ARGS.add_meta:\n                    row[\"article\"] = sample.article\n                    row[\"speaker\"] = sample.speaker\n                writer.writerow(row)\n\n\ndef cleanup(archive, language):\n    if not CLI_ARGS.keep_archive:\n        print('Removing archive \"{}\"...'.format(archive))\n        os.remove(archive)\n    language_dir = os.path.join(CLI_ARGS.base_dir, language)\n    if not CLI_ARGS.keep_intermediate and os.path.isdir(language_dir):\n        print('Removing intermediate files in \"{}\"...'.format(language_dir))\n        shutil.rmtree(language_dir)\n\n\ndef prepare_language(language):\n    archive = maybe_download_language(language)\n    extracted = maybe_extract(CLI_ARGS.base_dir, language, archive)\n    maybe_convert_to_wav(extracted)\n    samples = collect_samples(extracted, language)\n    assign_sub_sets(samples)\n    create_sample_dirs(language)\n    split_audio_files(samples, language)\n    write_csvs(samples, language)\n    cleanup(archive, language)\n\n\ndef handle_args():\n    parser = argparse.ArgumentParser(description=\"Import Spoken Wikipedia Corpora\")\n    parser.add_argument(\"base_dir\", help=\"Directory containing all data\")\n    parser.add_argument(\n        \"--language\", default=\"all\", help=\"One of (all|{})\".format(\"|\".join(LANGUAGES))\n    )\n    parser.add_argument(\n        \"--exclude_numbers\",\n        type=bool,\n        default=True,\n        help=\"If sequences with non-transliterated numbers should be excluded\",\n    )\n    parser.add_argument(\n        \"--max_duration\",\n        type=int,\n        default=10000,\n        help=\"Maximum sample duration in milliseconds\",\n    )\n    parser.add_argument(\n        \"--ignore_too_long\",\n        type=bool,\n        default=False,\n        help=\"If samples exceeding max_duration should be removed\",\n    )\n    parser.add_argument(\n        \"--normalize\",\n        action=\"store_true\",\n        help=\"Converts diacritic characters to their base ones\",\n    )\n    for language in LANGUAGES:\n        parser.add_argument(\n            \"--{}_alphabet\".format(language),\n            help=\"Exclude {} samples with characters not in provided alphabet file\".format(\n                language\n            ),\n        )\n    parser.add_argument(\n        \"--add_meta\", action=\"store_true\", help=\"Adds article and speaker CSV columns\"\n    )\n    parser.add_argument(\n        \"--exclude_unknown_speakers\",\n        action=\"store_true\",\n        help=\"Exclude unknown speakers\",\n    )\n    parser.add_argument(\n        \"--exclude_unknown_articles\",\n        action=\"store_true\",\n        help=\"Exclude unknown articles\",\n    )\n    parser.add_argument(\n        \"--keep_archive\",\n        type=bool,\n        default=True,\n        help=\"If downloaded archives should be kept\",\n    )\n    parser.add_argument(\n        \"--keep_intermediate\",\n        type=bool,\n        default=False,\n        help=\"If intermediate files should be kept\",\n    )\n    return parser.parse_args()\n\n\nif __name__ == \"__main__\":\n    CLI_ARGS = handle_args()\n    if CLI_ARGS.language == \"all\":\n        for lang in LANGUAGES:\n            prepare_language(lang)\n    elif CLI_ARGS.language in LANGUAGES:\n        prepare_language(CLI_ARGS.language)\n    else:\n        fail(\"Wrong language id\")\n"
  },
  {
    "path": "bin/import_ted.py",
    "content": "#!/usr/bin/env python\nimport sys\nimport tarfile\nimport unicodedata\nimport wave\nfrom glob import glob\nfrom os import makedirs, path, remove, rmdir\n\nimport pandas\nfrom sox import Transformer\nfrom tensorflow.python.platform import gfile\n\nfrom deepspeech_training.util.downloader import maybe_download\nfrom deepspeech_training.util.stm import parse_stm_file\n\n\ndef _download_and_preprocess_data(data_dir):\n    # Conditionally download data\n    TED_DATA = \"TEDLIUM_release2.tar.gz\"\n    TED_DATA_URL = \"http://www.openslr.org/resources/19/TEDLIUM_release2.tar.gz\"\n    local_file = maybe_download(TED_DATA, data_dir, TED_DATA_URL)\n\n    # Conditionally extract TED data\n    TED_DIR = \"TEDLIUM_release2\"\n    _maybe_extract(data_dir, TED_DIR, local_file)\n\n    # Conditionally convert TED sph data to wav\n    _maybe_convert_wav(data_dir, TED_DIR)\n\n    # Conditionally split TED wav and text data into sentences\n    train_files, dev_files, test_files = _maybe_split_sentences(data_dir, TED_DIR)\n\n    # Write sets to disk as CSV files\n    train_files.to_csv(path.join(data_dir, \"ted-train.csv\"), index=False)\n    dev_files.to_csv(path.join(data_dir, \"ted-dev.csv\"), index=False)\n    test_files.to_csv(path.join(data_dir, \"ted-test.csv\"), index=False)\n\n\ndef _maybe_extract(data_dir, extracted_data, archive):\n    # If data_dir/extracted_data does not exist, extract archive in data_dir\n    if not gfile.Exists(path.join(data_dir, extracted_data)):\n        tar = tarfile.open(archive)\n        tar.extractall(data_dir)\n        tar.close()\n\n\ndef _maybe_convert_wav(data_dir, extracted_data):\n    # Create extracted_data dir\n    extracted_dir = path.join(data_dir, extracted_data)\n\n    # Conditionally convert dev sph to wav\n    _maybe_convert_wav_dataset(extracted_dir, \"dev\")\n\n    # Conditionally convert train sph to wav\n    _maybe_convert_wav_dataset(extracted_dir, \"train\")\n\n    # Conditionally convert test sph to wav\n    _maybe_convert_wav_dataset(extracted_dir, \"test\")\n\n\ndef _maybe_convert_wav_dataset(extracted_dir, data_set):\n    # Create source dir\n    source_dir = path.join(extracted_dir, data_set, \"sph\")\n\n    # Create target dir\n    target_dir = path.join(extracted_dir, data_set, \"wav\")\n\n    # Conditionally convert sph files to wav files\n    if not gfile.Exists(target_dir):\n        # Create target_dir\n        makedirs(target_dir)\n\n        # Loop over sph files in source_dir and convert each to wav\n        for sph_file in glob(path.join(source_dir, \"*.sph\")):\n            transformer = Transformer()\n            wav_filename = path.splitext(path.basename(sph_file))[0] + \".wav\"\n            wav_file = path.join(target_dir, wav_filename)\n            transformer.build(sph_file, wav_file)\n            remove(sph_file)\n\n        # Remove source_dir\n        rmdir(source_dir)\n\n\ndef _maybe_split_sentences(data_dir, extracted_data):\n    # Create extracted_data dir\n    extracted_dir = path.join(data_dir, extracted_data)\n\n    # Conditionally split dev wav\n    dev_files = _maybe_split_dataset(extracted_dir, \"dev\")\n\n    # Conditionally split train wav\n    train_files = _maybe_split_dataset(extracted_dir, \"train\")\n\n    # Conditionally split test wav\n    test_files = _maybe_split_dataset(extracted_dir, \"test\")\n\n    return train_files, dev_files, test_files\n\n\ndef _maybe_split_dataset(extracted_dir, data_set):\n    # Create stm dir\n    stm_dir = path.join(extracted_dir, data_set, \"stm\")\n\n    # Create wav dir\n    wav_dir = path.join(extracted_dir, data_set, \"wav\")\n\n    files = []\n\n    # Loop over stm files and split corresponding wav\n    for stm_file in glob(path.join(stm_dir, \"*.stm\")):\n        # Parse stm file\n        stm_segments = parse_stm_file(stm_file)\n\n        # Open wav corresponding to stm_file\n        wav_filename = path.splitext(path.basename(stm_file))[0] + \".wav\"\n        wav_file = path.join(wav_dir, wav_filename)\n        origAudio = wave.open(wav_file, \"r\")\n\n        # Loop over stm_segments and split wav_file for each segment\n        for stm_segment in stm_segments:\n            # Create wav segment filename\n            start_time = stm_segment.start_time\n            stop_time = stm_segment.stop_time\n            new_wav_filename = (\n                path.splitext(path.basename(stm_file))[0]\n                + \"-\"\n                + str(start_time)\n                + \"-\"\n                + str(stop_time)\n                + \".wav\"\n            )\n            new_wav_file = path.join(wav_dir, new_wav_filename)\n\n            # If the wav segment filename does not exist create it\n            if not gfile.Exists(new_wav_file):\n                _split_wav(origAudio, start_time, stop_time, new_wav_file)\n\n            new_wav_filesize = path.getsize(new_wav_file)\n            files.append(\n                (path.abspath(new_wav_file), new_wav_filesize, stm_segment.transcript)\n            )\n\n        # Close origAudio\n        origAudio.close()\n\n    return pandas.DataFrame(\n        data=files, columns=[\"wav_filename\", \"wav_filesize\", \"transcript\"]\n    )\n\n\ndef _split_wav(origAudio, start_time, stop_time, new_wav_file):\n    frameRate = origAudio.getframerate()\n    origAudio.setpos(int(start_time * frameRate))\n    chunkData = origAudio.readframes(int((stop_time - start_time) * frameRate))\n    chunkAudio = wave.open(new_wav_file, \"w\")\n    chunkAudio.setnchannels(origAudio.getnchannels())\n    chunkAudio.setsampwidth(origAudio.getsampwidth())\n    chunkAudio.setframerate(frameRate)\n    chunkAudio.writeframes(chunkData)\n    chunkAudio.close()\n\n\nif __name__ == \"__main__\":\n    _download_and_preprocess_data(sys.argv[1])\n"
  },
  {
    "path": "bin/import_timit.py",
    "content": "#!/usr/bin/env python\n\n\"\"\"\n    NAME    : LDC TIMIT Dataset\n    URL     : https://catalog.ldc.upenn.edu/ldc93s1\n    HOURS   : 5\n    TYPE    : Read - English\n    AUTHORS : Garofolo, John, et al.\n    TYPE    : LDC Membership\n    LICENCE : LDC User Agreement\n\"\"\"\n\nimport errno\nimport fnmatch\nimport os\nimport subprocess\nimport sys\nimport tarfile\nfrom os import path\n\nimport pandas as pd\n\n\ndef clean(word):\n    # LC ALL & strip punctuation which are not required\n    new = word.lower().replace(\".\", \"\")\n    new = new.replace(\",\", \"\")\n    new = new.replace(\";\", \"\")\n    new = new.replace('\"', \"\")\n    new = new.replace(\"!\", \"\")\n    new = new.replace(\"?\", \"\")\n    new = new.replace(\":\", \"\")\n    new = new.replace(\"-\", \"\")\n    return new\n\n\ndef _preprocess_data(args):\n\n    # Assume data is downloaded from LDC - https://catalog.ldc.upenn.edu/ldc93s1\n\n    # SA sentences are repeated throughout by each speaker therefore can be removed for ASR as they will affect WER\n    ignoreSASentences = True\n\n    if ignoreSASentences:\n        print(\"Using recommended ignore SA sentences\")\n        print(\n            \"Ignoring SA sentences (2 x sentences which are repeated by all speakers)\"\n        )\n    else:\n        print(\"Using unrecommended setting to include SA sentences\")\n\n    datapath = args\n    target = path.join(datapath, \"TIMIT\")\n    print(\n        \"Checking to see if data has already been extracted in given argument: %s\",\n        target,\n    )\n\n    if not path.isdir(target):\n        print(\n            \"Could not find extracted data, trying to find: TIMIT-LDC93S1.tgz in: \",\n            datapath,\n        )\n        filepath = path.join(datapath, \"TIMIT-LDC93S1.tgz\")\n        if path.isfile(filepath):\n            print(\"File found, extracting\")\n            tar = tarfile.open(filepath)\n            tar.extractall(target)\n            tar.close()\n        else:\n            print(\"File should be downloaded from LDC and placed at:\", filepath)\n            strerror = \"File not found\"\n            raise IOError(errno, strerror, filepath)\n\n    else:\n        # is path therefore continue\n        print(\"Found extracted data in: \", target)\n\n    print(\"Preprocessing data\")\n    # We convert the .WAV (NIST sphere format) into MSOFT .wav\n    # creates _rif.wav as the new .wav file\n    for root, dirnames, filenames in os.walk(target):\n        for filename in fnmatch.filter(filenames, \"*.WAV\"):\n            sph_file = os.path.join(root, filename)\n            wav_file = os.path.join(root, filename)[:-4] + \"_rif.wav\"\n            print(\"converting {} to {}\".format(sph_file, wav_file))\n            subprocess.check_call([\"sox\", sph_file, wav_file])\n\n    print(\"Preprocessing Complete\")\n    print(\"Building CSVs\")\n\n    # Lists to build CSV files\n    train_list_wavs, train_list_trans, train_list_size = [], [], []\n    test_list_wavs, test_list_trans, test_list_size = [], [], []\n\n    for root, dirnames, filenames in os.walk(target):\n        for filename in fnmatch.filter(filenames, \"*_rif.wav\"):\n            full_wav = os.path.join(root, filename)\n            wav_filesize = path.getsize(full_wav)\n\n            # need to remove _rif.wav (8chars) then add .TXT\n            trans_file = full_wav[:-8] + \".TXT\"\n            with open(trans_file, \"r\") as f:\n                for line in f:\n                    split = line.split()\n                    start = split[0]\n                    end = split[1]\n                    t_list = split[2:]\n                    trans = \"\"\n\n                    for t in t_list:\n                        trans = trans + \" \" + clean(t)\n\n            # if ignoreSAsentences we only want those without SA in the name\n            # OR\n            # if not ignoreSAsentences we want all to be added\n            if (ignoreSASentences and not (\"SA\" in os.path.basename(full_wav))) or (\n                not ignoreSASentences\n            ):\n                if \"train\" in full_wav.lower():\n                    train_list_wavs.append(full_wav)\n                    train_list_trans.append(trans)\n                    train_list_size.append(wav_filesize)\n                elif \"test\" in full_wav.lower():\n                    test_list_wavs.append(full_wav)\n                    test_list_trans.append(trans)\n                    test_list_size.append(wav_filesize)\n                else:\n                    raise IOError\n\n    a = {\n        \"wav_filename\": train_list_wavs,\n        \"wav_filesize\": train_list_size,\n        \"transcript\": train_list_trans,\n    }\n\n    c = {\n        \"wav_filename\": test_list_wavs,\n        \"wav_filesize\": test_list_size,\n        \"transcript\": test_list_trans,\n    }\n\n    all = {\n        \"wav_filename\": train_list_wavs + test_list_wavs,\n        \"wav_filesize\": train_list_size + test_list_size,\n        \"transcript\": train_list_trans + test_list_trans,\n    }\n\n    df_all = pd.DataFrame(\n        all, columns=[\"wav_filename\", \"wav_filesize\", \"transcript\"], dtype=int\n    )\n    df_train = pd.DataFrame(\n        a, columns=[\"wav_filename\", \"wav_filesize\", \"transcript\"], dtype=int\n    )\n    df_test = pd.DataFrame(\n        c, columns=[\"wav_filename\", \"wav_filesize\", \"transcript\"], dtype=int\n    )\n\n    df_all.to_csv(\n        target + \"/timit_all.csv\", sep=\",\", header=True, index=False, encoding=\"ascii\"\n    )\n    df_train.to_csv(\n        target + \"/timit_train.csv\", sep=\",\", header=True, index=False, encoding=\"ascii\"\n    )\n    df_test.to_csv(\n        target + \"/timit_test.csv\", sep=\",\", header=True, index=False, encoding=\"ascii\"\n    )\n\n\nif __name__ == \"__main__\":\n    _preprocess_data(sys.argv[1])\n    print(\"Completed\")\n"
  },
  {
    "path": "bin/import_ts.py",
    "content": "#!/usr/bin/env python3\nimport csv\nimport os\nimport re\nimport subprocess\nimport zipfile\nfrom multiprocessing import Pool\n\nimport progressbar\nimport sox\n\nimport unidecode\nfrom deepspeech_training.util.downloader import SIMPLE_BAR, maybe_download\nfrom deepspeech_training.util.importers import (\n    get_counter,\n    get_imported_samples,\n    get_importers_parser,\n    get_validate_label,\n    print_import_report,\n)\n\nFIELDNAMES = [\"wav_filename\", \"wav_filesize\", \"transcript\"]\nSAMPLE_RATE = 16000\nMAX_SECS = 15\nARCHIVE_NAME = \"2019-04-11_fr_FR\"\nARCHIVE_DIR_NAME = \"ts_\" + ARCHIVE_NAME\nARCHIVE_URL = (\n    \"https://deepspeech-storage-mirror.s3.fr-par.scw.cloud/\" + ARCHIVE_NAME + \".zip\"\n)\n\n\ndef _download_and_preprocess_data(target_dir, english_compatible=False):\n    # Making path absolute\n    target_dir = os.path.abspath(target_dir)\n    # Conditionally download data\n    archive_path = maybe_download(\n        \"ts_\" + ARCHIVE_NAME + \".zip\", target_dir, ARCHIVE_URL\n    )\n    # Conditionally extract archive data\n    _maybe_extract(target_dir, ARCHIVE_DIR_NAME, archive_path)\n    # Conditionally convert TrainingSpeech data to DeepSpeech CSVs and wav\n    _maybe_convert_sets(\n        target_dir, ARCHIVE_DIR_NAME, english_compatible=english_compatible\n    )\n\n\ndef _maybe_extract(target_dir, extracted_data, archive_path):\n    # If target_dir/extracted_data does not exist, extract archive in target_dir\n    extracted_path = os.path.join(target_dir, extracted_data)\n    if not os.path.exists(extracted_path):\n        print('No directory \"%s\" - extracting archive...' % extracted_path)\n        if not os.path.isdir(extracted_path):\n            os.mkdir(extracted_path)\n        with zipfile.ZipFile(archive_path) as zip_f:\n            zip_f.extractall(extracted_path)\n    else:\n        print('Found directory \"%s\" - not extracting it from archive.' % archive_path)\n\n\ndef one_sample(sample):\n    \"\"\" Take a audio file, and optionally convert it to 16kHz WAV \"\"\"\n    orig_filename = sample[\"path\"]\n    # Storing wav files next to the wav ones - just with a different suffix\n    wav_filename = os.path.splitext(orig_filename)[0] + \".converted.wav\"\n    _maybe_convert_wav(orig_filename, wav_filename)\n    file_size = -1\n    frames = 0\n    if os.path.exists(wav_filename):\n        file_size = os.path.getsize(wav_filename)\n        frames = int(\n            subprocess.check_output(\n                [\"soxi\", \"-s\", wav_filename], stderr=subprocess.STDOUT\n            )\n        )\n    label = sample[\"text\"]\n\n    rows = []\n\n    # Keep track of how many samples are good vs. problematic\n    counter = get_counter()\n    if file_size == -1:\n        # Excluding samples that failed upon conversion\n        counter[\"failed\"] += 1\n    elif label is None:\n        # Excluding samples that failed on label validation\n        counter[\"invalid_label\"] += 1\n    elif int(frames / SAMPLE_RATE * 1000 / 10 / 2) < len(str(label)):\n        # Excluding samples that are too short to fit the transcript\n        counter[\"too_short\"] += 1\n    elif frames / SAMPLE_RATE > MAX_SECS:\n        # Excluding very long samples to keep a reasonable batch-size\n        counter[\"too_long\"] += 1\n    else:\n        # This one is good - keep it for the target CSV\n        rows.append((wav_filename, file_size, label))\n        counter[\"imported_time\"] += frames\n    counter[\"all\"] += 1\n    counter[\"total_time\"] += frames\n\n    return (counter, rows)\n\n\ndef _maybe_convert_sets(target_dir, extracted_data, english_compatible=False):\n    extracted_dir = os.path.join(target_dir, extracted_data)\n    # override existing CSV with normalized one\n    target_csv_template = os.path.join(target_dir, \"ts_\" + ARCHIVE_NAME + \"_{}.csv\")\n    if os.path.isfile(target_csv_template):\n        return\n    path_to_original_csv = os.path.join(extracted_dir, \"data.csv\")\n    with open(path_to_original_csv) as csv_f:\n        data = [\n            d\n            for d in csv.DictReader(csv_f, delimiter=\",\")\n            if float(d[\"duration\"]) <= MAX_SECS\n        ]\n\n    for line in data:\n        line[\"path\"] = os.path.join(extracted_dir, line[\"path\"])\n\n    num_samples = len(data)\n    rows = []\n    counter = get_counter()\n\n    print(\"Importing {} wav files...\".format(num_samples))\n    pool = Pool()\n    bar = progressbar.ProgressBar(max_value=num_samples, widgets=SIMPLE_BAR)\n    for i, processed in enumerate(pool.imap_unordered(one_sample, data), start=1):\n        counter += processed[0]\n        rows += processed[1]\n        bar.update(i)\n    bar.update(num_samples)\n    pool.close()\n    pool.join()\n\n    with open(target_csv_template.format(\"train\"), \"w\", encoding=\"utf-8\", newline=\"\") as train_csv_file:  # 80%\n        with open(target_csv_template.format(\"dev\"), \"w\", encoding=\"utf-8\", newline=\"\") as dev_csv_file:  # 10%\n            with open(target_csv_template.format(\"test\"), \"w\", encoding=\"utf-8\", newline=\"\") as test_csv_file:  # 10%\n                train_writer = csv.DictWriter(train_csv_file, fieldnames=FIELDNAMES)\n                train_writer.writeheader()\n                dev_writer = csv.DictWriter(dev_csv_file, fieldnames=FIELDNAMES)\n                dev_writer.writeheader()\n                test_writer = csv.DictWriter(test_csv_file, fieldnames=FIELDNAMES)\n                test_writer.writeheader()\n\n                for i, item in enumerate(rows):\n                    transcript = validate_label(\n                        cleanup_transcript(\n                            item[2], english_compatible=english_compatible\n                        )\n                    )\n                    if not transcript:\n                        continue\n                    wav_filename = os.path.join(target_dir, extracted_data, item[0])\n                    i_mod = i % 10\n                    if i_mod == 0:\n                        writer = test_writer\n                    elif i_mod == 1:\n                        writer = dev_writer\n                    else:\n                        writer = train_writer\n                    writer.writerow(\n                        dict(\n                            wav_filename=wav_filename,\n                            wav_filesize=os.path.getsize(wav_filename),\n                            transcript=transcript,\n                        )\n                    )\n\n    imported_samples = get_imported_samples(counter)\n    assert counter[\"all\"] == num_samples\n    assert len(rows) == imported_samples\n\n    print_import_report(counter, SAMPLE_RATE, MAX_SECS)\n\n\ndef _maybe_convert_wav(orig_filename, wav_filename):\n    if not os.path.exists(wav_filename):\n        transformer = sox.Transformer()\n        transformer.convert(samplerate=SAMPLE_RATE)\n        try:\n            transformer.build(orig_filename, wav_filename)\n        except sox.core.SoxError as ex:\n            print(\"SoX processing error\", ex, orig_filename, wav_filename)\n\n\nPUNCTUATIONS_REG = re.compile(r\"[°\\-,;!?.()\\[\\]*…—]\")\nMULTIPLE_SPACES_REG = re.compile(r\"\\s{2,}\")\n\n\ndef cleanup_transcript(text, english_compatible=False):\n    text = text.replace(\"’\", \"'\").replace(\"\\u00A0\", \" \")\n    text = PUNCTUATIONS_REG.sub(\" \", text)\n    text = MULTIPLE_SPACES_REG.sub(\" \", text)\n    if english_compatible:\n        text = unidecode.unidecode(text)\n    return text.strip().lower()\n\n\ndef handle_args():\n    parser = get_importers_parser(description=\"Importer for TrainingSpeech dataset.\")\n    parser.add_argument(dest=\"target_dir\")\n    parser.add_argument(\n        \"--english-compatible\",\n        action=\"store_true\",\n        dest=\"english_compatible\",\n        help=\"Remove diactrics and other non-ascii chars.\",\n    )\n    return parser.parse_args()\n\n\nif __name__ == \"__main__\":\n    cli_args = handle_args()\n    validate_label = get_validate_label(cli_args)\n    _download_and_preprocess_data(cli_args.target_dir, cli_args.english_compatible)\n"
  },
  {
    "path": "bin/import_tuda.py",
    "content": "#!/usr/bin/env python\n\"\"\"\nDownloads and prepares (parts of) the \"German Distant Speech\" corpus (TUDA) for DeepSpeech.py\nUse \"python3 import_tuda.py -h\" for help\n\"\"\"\nimport argparse\nimport csv\nimport os\nimport tarfile\nimport unicodedata\nimport wave\nimport xml.etree.ElementTree as ET\nfrom collections import Counter\n\nimport progressbar\n\nfrom deepspeech_training.util.downloader import SIMPLE_BAR, maybe_download\nfrom deepspeech_training.util.importers import validate_label_eng as validate_label\nfrom ds_ctcdecoder import Alphabet\n\nTUDA_VERSION = \"v2\"\nTUDA_PACKAGE = \"german-speechdata-package-{}\".format(TUDA_VERSION)\nTUDA_URL = \"http://ltdata1.informatik.uni-hamburg.de/kaldi_tuda_de/{}.tar.gz\".format(\n    TUDA_PACKAGE\n)\nTUDA_ARCHIVE = \"{}.tar.gz\".format(TUDA_PACKAGE)\n\nCHANNELS = 1\nSAMPLE_WIDTH = 2\nSAMPLE_RATE = 16000\n\nFIELDNAMES = [\"wav_filename\", \"wav_filesize\", \"transcript\"]\n\n\ndef maybe_extract(archive):\n    extracted = os.path.join(CLI_ARGS.base_dir, TUDA_PACKAGE)\n    if os.path.isdir(extracted):\n        print('Found directory \"{}\" - not extracting.'.format(extracted))\n    else:\n        print('Extracting \"{}\"...'.format(archive))\n        with tarfile.open(archive) as tar:\n            members = tar.getmembers()\n            bar = progressbar.ProgressBar(max_value=len(members), widgets=SIMPLE_BAR)\n            for member in bar(members):\n                tar.extract(member=member, path=CLI_ARGS.base_dir)\n    return extracted\n\n\ndef in_alphabet(c):\n    return ALPHABET.CanEncode(c) if ALPHABET else True\n\n\ndef check_and_prepare_sentence(sentence):\n    sentence = sentence.lower().replace(\"co2\", \"c o zwei\")\n    chars = []\n    for c in sentence:\n        if CLI_ARGS.normalize and c not in \"äöüß\" and not in_alphabet(c):\n            c = unicodedata.normalize(\"NFKD\", c).encode(\"ascii\", \"ignore\").decode(\"ascii\", \"ignore\")\n        for sc in c:\n            if not in_alphabet(c):\n                return None\n            chars.append(sc)\n    return validate_label(\"\".join(chars))\n\n\ndef check_wav_file(wav_path, sentence):  # pylint: disable=too-many-return-statements\n    try:\n        with wave.open(wav_path, \"r\") as src_wav_file:\n            rate = src_wav_file.getframerate()\n            channels = src_wav_file.getnchannels()\n            sample_width = src_wav_file.getsampwidth()\n            milliseconds = int(src_wav_file.getnframes() * 1000 / rate)\n        if rate != SAMPLE_RATE:\n            return False, \"wrong sample rate\"\n        if channels != CHANNELS:\n            return False, \"wrong number of channels\"\n        if sample_width != SAMPLE_WIDTH:\n            return False, \"wrong sample width\"\n        if milliseconds / len(sentence) < 30:\n            return False, \"too short\"\n        if milliseconds > CLI_ARGS.max_duration > 0:\n            return False, \"too long\"\n    except wave.Error:\n        return False, \"invalid wav file\"\n    except EOFError:\n        return False, \"premature EOF\"\n    return True, \"OK\"\n\n\ndef write_csvs(extracted):\n    sample_counter = 0\n    reasons = Counter()\n    for sub_set in [\"train\", \"dev\", \"test\"]:\n        set_path = os.path.join(extracted, sub_set)\n        set_files = os.listdir(set_path)\n        recordings = {}\n        for file in set_files:\n            if file.endswith(\".xml\"):\n                recordings[file[:-4]] = []\n        for file in set_files:\n            if file.endswith(\".wav\") and \"_\" in file:\n                prefix = file.split(\"_\")[0]\n                if prefix in recordings:\n                    recordings[prefix].append(file)\n        recordings = recordings.items()\n        csv_path = os.path.join(\n            CLI_ARGS.base_dir, \"tuda-{}-{}.csv\".format(TUDA_VERSION, sub_set)\n        )\n        print('Writing \"{}\"...'.format(csv_path))\n        with open(csv_path, \"w\", encoding=\"utf-8\", newline=\"\") as csv_file:\n            writer = csv.DictWriter(csv_file, fieldnames=FIELDNAMES)\n            writer.writeheader()\n            set_dir = os.path.join(extracted, sub_set)\n            bar = progressbar.ProgressBar(max_value=len(recordings), widgets=SIMPLE_BAR)\n            for prefix, wav_names in bar(recordings):\n                xml_path = os.path.join(set_dir, prefix + \".xml\")\n                meta = ET.parse(xml_path).getroot()\n                sentence = list(meta.iter(\"cleaned_sentence\"))[0].text\n                sentence = check_and_prepare_sentence(sentence)\n                if sentence is None:\n                    reasons['alphabet filter'] += 1\n                    continue\n                for wav_name in wav_names:\n                    sample_counter += 1\n                    wav_path = os.path.join(set_path, wav_name)\n                    keep, reason = check_wav_file(wav_path, sentence)\n                    if keep:\n                        writer.writerow(\n                            {\n                                \"wav_filename\": os.path.relpath(\n                                    wav_path, CLI_ARGS.base_dir\n                                ),\n                                \"wav_filesize\": os.path.getsize(wav_path),\n                                \"transcript\": sentence.lower(),\n                            }\n                        )\n                    else:\n                        reasons[reason] += 1\n    if len(reasons.keys()) > 0:\n        print(\"Excluded samples:\")\n        for reason, n in reasons.most_common():\n            print(' - \"{}\": {} ({:.2f}%)'.format(reason, n, n * 100 / sample_counter))\n\n\ndef cleanup(archive):\n    if not CLI_ARGS.keep_archive:\n        print('Removing archive \"{}\"...'.format(archive))\n        os.remove(archive)\n\n\ndef download_and_prepare():\n    archive = maybe_download(TUDA_ARCHIVE, CLI_ARGS.base_dir, TUDA_URL)\n    extracted = maybe_extract(archive)\n    write_csvs(extracted)\n    cleanup(archive)\n\n\ndef handle_args():\n    parser = argparse.ArgumentParser(description=\"Import German Distant Speech (TUDA)\")\n    parser.add_argument(\"base_dir\", help=\"Directory containing all data\")\n    parser.add_argument(\n        \"--max_duration\",\n        type=int,\n        default=10000,\n        help=\"Maximum sample duration in milliseconds\",\n    )\n    parser.add_argument(\n        \"--normalize\",\n        action=\"store_true\",\n        help=\"Converts diacritic characters to their base ones\",\n    )\n    parser.add_argument(\n        \"--alphabet\",\n        help=\"Exclude samples with characters not in provided alphabet file\",\n    )\n    parser.add_argument(\n        \"--keep_archive\",\n        type=bool,\n        default=True,\n        help=\"If downloaded archives should be kept\",\n    )\n    return parser.parse_args()\n\n\nif __name__ == \"__main__\":\n    CLI_ARGS = handle_args()\n    ALPHABET = Alphabet(CLI_ARGS.alphabet) if CLI_ARGS.alphabet else None\n    download_and_prepare()\n"
  },
  {
    "path": "bin/import_vctk.py",
    "content": "#!/usr/bin/env python\n# VCTK used in wavenet paper https://arxiv.org/pdf/1609.03499.pdf\n# Licenced under Open Data Commons Attribution License (ODC-By) v1.0.\n# as per https://homepages.inf.ed.ac.uk/jyamagis/page3/page58/page58.html\nimport os\nimport random\nimport re\nfrom multiprocessing import Pool\nfrom zipfile import ZipFile\n\nimport librosa\nimport progressbar\n\nfrom deepspeech_training.util.downloader import SIMPLE_BAR, maybe_download\nfrom deepspeech_training.util.importers import (\n    get_counter,\n    get_imported_samples,\n    print_import_report,\n)\n\nSAMPLE_RATE = 16000\nMAX_SECS = 10\nMIN_SECS = 1\nARCHIVE_DIR_NAME = \"VCTK-Corpus\"\nARCHIVE_NAME = \"VCTK-Corpus.zip?sequence=2&isAllowed=y\"\nARCHIVE_URL = (\n    \"https://datashare.is.ed.ac.uk/bitstream/handle/10283/2651/\" + ARCHIVE_NAME\n)\n\n\ndef _download_and_preprocess_data(target_dir):\n    # Making path absolute\n    target_dir = os.path.abspath(target_dir)\n    # Conditionally download data\n    archive_path = maybe_download(ARCHIVE_NAME, target_dir, ARCHIVE_URL)\n    # Conditionally extract common voice data\n    _maybe_extract(target_dir, ARCHIVE_DIR_NAME, archive_path)\n    # Conditionally convert common voice CSV files and mp3 data to DeepSpeech CSVs and wav\n    _maybe_convert_sets(target_dir, ARCHIVE_DIR_NAME)\n\n\ndef _maybe_extract(target_dir, extracted_data, archive_path):\n    # If target_dir/extracted_data does not exist, extract archive in target_dir\n    extracted_path = os.path.join(target_dir, extracted_data)\n    if not os.path.exists(extracted_path):\n        print(f\"No directory {extracted_path} - extracting archive...\")\n        with ZipFile(archive_path, \"r\") as zipobj:\n            # Extract all the contents of zip file in current directory\n            zipobj.extractall(target_dir)\n    else:\n        print(f\"Found directory {extracted_path} - not extracting it from archive.\")\n\n\ndef _maybe_convert_sets(target_dir, extracted_data):\n    extracted_dir = os.path.join(target_dir, extracted_data, \"wav48\")\n    txt_dir = os.path.join(target_dir, extracted_data, \"txt\")\n\n    directory = os.path.expanduser(extracted_dir)\n    srtd = len(sorted(os.listdir(directory)))\n    all_samples = []\n\n    for target in sorted(os.listdir(directory)):\n        all_samples += _maybe_prepare_set(\n            path.join(extracted_dir, os.path.split(target)[-1])\n        )\n\n    num_samples = len(all_samples)\n    print(f\"Converting wav files to {SAMPLE_RATE}hz...\")\n    pool = Pool()\n    bar = progressbar.ProgressBar(max_value=num_samples, widgets=SIMPLE_BAR)\n    for i, _ in enumerate(pool.imap_unordered(one_sample, all_samples), start=1):\n        bar.update(i)\n    bar.update(num_samples)\n    pool.close()\n    pool.join()\n\n    _write_csv(extracted_dir, txt_dir, target_dir)\n\n\ndef one_sample(sample):\n    if is_audio_file(sample):\n        y, sr = librosa.load(sample, sr=16000)\n\n        # Trim the beginning and ending silence\n        yt, index = librosa.effects.trim(y)  # pylint: disable=unused-variable\n\n        duration = librosa.get_duration(yt, sr)\n        if duration > MAX_SECS or duration < MIN_SECS:\n            os.remove(sample)\n        else:\n            librosa.output.write_wav(sample, yt, sr)\n\n\ndef _maybe_prepare_set(target_csv):\n    samples = sorted(os.listdir(target_csv))\n    new_samples = []\n    for s in samples:\n        new_samples.append(os.path.join(target_csv, s))\n    samples = new_samples\n    return samples\n\n\ndef _write_csv(extracted_dir, txt_dir, target_dir):\n    print(f\"Writing CSV file\")\n    dset_abs_path = extracted_dir\n    dset_txt_abs_path = txt_dir\n\n    audios = make_manifest(dset_abs_path)\n    utterences = load_txts(dset_txt_abs_path)\n\n    csv = []\n\n    for file in audios:\n\n        st = os.stat(file)\n        file_size = st.st_size\n\n        # Seems to be one wav directory missing from txts - skip it\n        file_parts = file.split(os.sep)\n        file_subdir = file_parts[-2]\n        if file_subdir == \"p315\":\n            continue\n\n        file_name = file_parts[-1]\n        file_name_no_ext = file_name.split(\".\")[0]\n\n        utterence = utterences[file_name_no_ext]\n        utterence_clean = re.sub(r\"[^a-zA-Z' ]+\", \"\", utterence).lower().strip()\n\n        csv_line = f\"{file},{file_size},{utterence_clean}\\n\"\n        csv.append(csv_line)\n\n    random.seed(1454)\n    random.shuffle(csv)\n\n    train_data = csv[:37000]\n    dev_data = csv[37000:40200]\n    test_data = csv[40200:]\n\n    with open(os.path.join(target_dir, \"vctk_full.csv\"), \"w\") as fd:\n        fd.write(\"wav_filename,wav_filesize,transcript\\n\")\n        for i in csv:\n            fd.write(i)\n    with open(os.path.join(target_dir, \"vctk_train.csv\"), \"w\") as fd:\n        fd.write(\"wav_filename,wav_filesize,transcript\\n\")\n        for i in train_data:\n            fd.write(i)\n    with open(os.path.join(target_dir, \"vctk_dev.csv\"), \"w\") as fd:\n        fd.write(\"wav_filename,wav_filesize,transcript\\n\")\n        for i in dev_data:\n            fd.write(i)\n    with open(os.path.join(target_dir, \"vctk_test.csv\"), \"w\") as fd:\n        fd.write(\"wav_filename,wav_filesize,transcript\\n\")\n        for i in test_data:\n            fd.write(i)\n\n    print(f\"Wrote {len(csv)} entries\")\n\n\ndef make_manifest(directory):\n    audios = []\n    directory = os.path.expanduser(directory)\n    for target in sorted(os.listdir(directory)):\n        d = os.path.join(directory, target)\n        if not os.path.isdir(d):\n            continue\n\n        for root, _, fnames in sorted(os.walk(d)):\n            for fname in fnames:\n                new_path = os.path.join(root, fname)\n                item = new_path\n                audios.append(item)\n    return audios\n\n\ndef load_txts(directory):\n    utterences = dict()\n    directory = os.path.expanduser(directory)\n    for target in sorted(os.listdir(directory)):\n        d = os.path.join(directory, target)\n        if not os.path.isdir(d):\n            continue\n\n        for root, _, fnames in sorted(os.walk(d)):\n            for fname in fnames:\n                if fname.endswith(\".txt\"):\n                    with open(os.path.join(root, fname), \"r\") as f:\n                        fname_no_ext = os.path.basename(fname).rsplit(\".\", 1)[0]\n                        utterences[fname_no_ext] = f.readline()\n    return utterences\n\n\nAUDIO_EXTENSIONS = [\".wav\", \"WAV\"]\n\n\ndef is_audio_file(filepath):\n    return any(\n        os.path.basename(filepath).endswith(extension) for extension in AUDIO_EXTENSIONS\n    )\n\n\nif __name__ == \"__main__\":\n    _download_and_preprocess_data(sys.argv[1])\n"
  },
  {
    "path": "bin/import_voxforge.py",
    "content": "#!/usr/bin/env python\nimport codecs\nimport os\nimport re\nimport sys\nimport tarfile\nimport threading\nimport unicodedata\nimport urllib\nfrom glob import glob\nfrom multiprocessing.pool import ThreadPool\nfrom os import makedirs, path\n\nimport pandas\nfrom bs4 import BeautifulSoup\nfrom tensorflow.python.platform import gfile\nfrom deepspeech_training.util.downloader import maybe_download\n\n\"\"\"The number of jobs to run in parallel\"\"\"\nNUM_PARALLEL = 8\n\n\"\"\"Lambda function returns the filename of a path\"\"\"\nfilename_of = lambda x: path.split(x)[1]\n\n\nclass AtomicCounter(object):\n    \"\"\"A class that atomically increments a counter\"\"\"\n\n    def __init__(self, start_count=0):\n        \"\"\"Initialize the counter\n        :param start_count: the number to start counting at\n        \"\"\"\n        self.__lock = threading.Lock()\n        self.__count = start_count\n\n    def increment(self, amount=1):\n        \"\"\"Increments the counter by the given amount\n        :param amount: the amount to increment by (default 1)\n        :return:       the incremented value of the counter\n        \"\"\"\n        self.__lock.acquire()\n        self.__count += amount\n        v = self.value()\n        self.__lock.release()\n        return v\n\n    def value(self):\n        \"\"\"Returns the current value of the counter (not atomic)\"\"\"\n        return self.__count\n\n\ndef _parallel_downloader(voxforge_url, archive_dir, total, counter):\n    \"\"\"Generate a function to download a file based on given parameters\n    This works by currying the above given arguments into a closure\n    in the form of the following function.\n\n    :param voxforge_url: the base voxforge URL\n    :param archive_dir:  the location to store the downloaded file\n    :param total:        the total number of files to download\n    :param counter:      an atomic counter to keep track of # of downloaded files\n    :return:             a function that actually downloads a file given these params\n    \"\"\"\n\n    def download(d):\n        \"\"\"Binds voxforge_url, archive_dir, total, and counter into this scope\n        Downloads the given file\n        :param d: a tuple consisting of (index, file) where index is the index\n                  of the file to download and file is the name of the file to download\n        \"\"\"\n        (i, file) = d\n        download_url = voxforge_url + \"/\" + file\n        c = counter.increment()\n        print(\"Downloading file {} ({}/{})...\".format(i + 1, c, total))\n        maybe_download(filename_of(download_url), archive_dir, download_url)\n\n    return download\n\n\ndef _parallel_extracter(data_dir, number_of_test, number_of_dev, total, counter):\n    \"\"\"Generate a function to extract a tar file based on given parameters\n    This works by currying the above given arguments into a closure\n    in the form of the following function.\n\n    :param data_dir:       the target directory to extract into\n    :param number_of_test: the number of files to keep as the test set\n    :param number_of_dev:  the number of files to keep as the dev set\n    :param total:          the total number of files to extract\n    :param counter:        an atomic counter to keep track of # of extracted files\n    :return:               a function that actually extracts a tar file given these params\n    \"\"\"\n\n    def extract(d):\n        \"\"\"Binds data_dir, number_of_test, number_of_dev, total, and counter into this scope\n        Extracts the given file\n        :param d: a tuple consisting of (index, file) where index is the index\n                  of the file to extract and file is the name of the file to extract\n        \"\"\"\n        (i, archive) = d\n        if i < number_of_test:\n            dataset_dir = path.join(data_dir, \"test\")\n        elif i < number_of_test + number_of_dev:\n            dataset_dir = path.join(data_dir, \"dev\")\n        else:\n            dataset_dir = path.join(data_dir, \"train\")\n        if not gfile.Exists(\n            os.path.join(dataset_dir, \".\".join(filename_of(archive).split(\".\")[:-1]))\n        ):\n            c = counter.increment()\n            print(\"Extracting file {} ({}/{})...\".format(i + 1, c, total))\n            tar = tarfile.open(archive)\n            tar.extractall(dataset_dir)\n            tar.close()\n\n    return extract\n\n\ndef _download_and_preprocess_data(data_dir):\n    # Conditionally download data to data_dir\n    if not path.isdir(data_dir):\n        makedirs(data_dir)\n\n    archive_dir = data_dir + \"/archive\"\n    if not path.isdir(archive_dir):\n        makedirs(archive_dir)\n\n    print(\n        \"Downloading Voxforge data set into {} if not already present...\".format(\n            archive_dir\n        )\n    )\n\n    voxforge_url = \"http://www.repository.voxforge1.org/downloads/SpeechCorpus/Trunk/Audio/Main/16kHz_16bit\"\n    html_page = urllib.request.urlopen(voxforge_url)\n    soup = BeautifulSoup(html_page, \"html.parser\")\n\n    # list all links\n    refs = [l[\"href\"] for l in soup.find_all(\"a\") if \".tgz\" in l[\"href\"]]\n\n    # download files in parallel\n    print(\"{} files to download\".format(len(refs)))\n    downloader = _parallel_downloader(\n        voxforge_url, archive_dir, len(refs), AtomicCounter()\n    )\n    p = ThreadPool(NUM_PARALLEL)\n    p.map(downloader, enumerate(refs))\n\n    # Conditionally extract data to dataset_dir\n    if not path.isdir(os.path.join(data_dir, \"test\")):\n        makedirs(os.path.join(data_dir, \"test\"))\n    if not path.isdir(os.path.join(data_dir, \"dev\")):\n        makedirs(os.path.join(data_dir, \"dev\"))\n    if not path.isdir(os.path.join(data_dir, \"train\")):\n        makedirs(os.path.join(data_dir, \"train\"))\n\n    tarfiles = glob(os.path.join(archive_dir, \"*.tgz\"))\n    number_of_files = len(tarfiles)\n    number_of_test = number_of_files // 100\n    number_of_dev = number_of_files // 100\n\n    # extract tars in parallel\n    print(\n        \"Extracting Voxforge data set into {} if not already present...\".format(\n            data_dir\n        )\n    )\n    extracter = _parallel_extracter(\n        data_dir, number_of_test, number_of_dev, len(tarfiles), AtomicCounter()\n    )\n    p.map(extracter, enumerate(tarfiles))\n\n    # Generate data set\n    print(\"Generating Voxforge data set into {}\".format(data_dir))\n    test_files = _generate_dataset(data_dir, \"test\")\n    dev_files = _generate_dataset(data_dir, \"dev\")\n    train_files = _generate_dataset(data_dir, \"train\")\n\n    # Write sets to disk as CSV files\n    train_files.to_csv(os.path.join(data_dir, \"voxforge-train.csv\"), index=False)\n    dev_files.to_csv(os.path.join(data_dir, \"voxforge-dev.csv\"), index=False)\n    test_files.to_csv(os.path.join(data_dir, \"voxforge-test.csv\"), index=False)\n\n\ndef _generate_dataset(data_dir, data_set):\n    extracted_dir = path.join(data_dir, data_set)\n    files = []\n    for promts_file in glob(os.path.join(extracted_dir + \"/*/etc/\", \"PROMPTS\")):\n        if path.isdir(os.path.join(promts_file[:-11], \"wav\")):\n            with codecs.open(promts_file, \"r\", \"utf-8\") as f:\n                for line in f:\n                    id = line.split(\" \")[0].split(\"/\")[-1]\n                    sentence = \" \".join(line.split(\" \")[1:])\n                    sentence = re.sub(\"[^a-z']\", \" \", sentence.strip().lower())\n                    transcript = \"\"\n                    for token in sentence.split(\" \"):\n                        word = token.strip()\n                        if word != \"\" and word != \" \":\n                            transcript += word + \" \"\n                    transcript = (\n                        unicodedata.normalize(\"NFKD\", transcript.strip())\n                        .encode(\"ascii\", \"ignore\")\n                        .decode(\"ascii\", \"ignore\")\n                    )\n                    wav_file = path.join(promts_file[:-11], \"wav/\" + id + \".wav\")\n                    if gfile.Exists(wav_file):\n                        wav_filesize = path.getsize(wav_file)\n                        # remove audios that are shorter than 0.5s and longer than 20s.\n                        # remove audios that are too short for transcript.\n                        if (\n                            (wav_filesize / 32000) > 0.5\n                            and (wav_filesize / 32000) < 20\n                            and transcript != \"\"\n                            and wav_filesize / len(transcript) > 1400\n                        ):\n                            files.append(\n                                (os.path.abspath(wav_file), wav_filesize, transcript)\n                            )\n\n    return pandas.DataFrame(\n        data=files, columns=[\"wav_filename\", \"wav_filesize\", \"transcript\"]\n    )\n\n\nif __name__ == \"__main__\":\n    _download_and_preprocess_data(sys.argv[1])\n"
  },
  {
    "path": "bin/ops_in_graph.py",
    "content": "#!/usr/bin/env python\n# -*- coding: utf-8 -*-\n\nimport sys\n\nimport tensorflow.compat.v1 as tfv1\n\n\ndef main():\n    with tfv1.gfile.FastGFile(sys.argv[1], \"rb\") as fin:\n        graph_def = tfv1.GraphDef()\n        graph_def.ParseFromString(fin.read())\n\n        print(\"\\n\".join(sorted(set(n.op for n in graph_def.node))))\n\n\nif __name__ == \"__main__\":\n    main()\n"
  },
  {
    "path": "bin/play.py",
    "content": "#!/usr/bin/env python\n\"\"\"\nTool for playing (and augmenting) single samples or samples from Sample Databases (SDB files) and DeepSpeech CSV files\nUse \"python3 play.py -h\" for help\n\"\"\"\n\nimport os\nimport sys\nimport random\nimport argparse\n\nfrom deepspeech_training.util.audio import get_loadable_audio_type_from_extension, AUDIO_TYPE_PCM, AUDIO_TYPE_WAV\nfrom deepspeech_training.util.sample_collections import SampleList, LabeledSample, samples_from_source\nfrom deepspeech_training.util.augmentations import parse_augmentations, apply_sample_augmentations, SampleAugmentation\n\n\ndef get_samples_in_play_order():\n    ext = os.path.splitext(CLI_ARGS.source)[1].lower()\n    if get_loadable_audio_type_from_extension(ext):\n        samples = SampleList([(CLI_ARGS.source, 0)], labeled=False)\n    else:\n        samples = samples_from_source(CLI_ARGS.source, buffering=0)\n    played = 0\n    index = CLI_ARGS.start\n    while True:\n        if 0 <= CLI_ARGS.number <= played:\n            return\n        if CLI_ARGS.random:\n            yield samples[random.randint(0, len(samples) - 1)]\n        elif index < 0:\n            yield samples[len(samples) + index]\n        elif index >= len(samples):\n            print(\"No sample with index {}\".format(CLI_ARGS.start))\n            sys.exit(1)\n        else:\n            yield samples[index]\n        played += 1\n        index = (index + 1) % len(samples)\n\n\ndef play_collection():\n    augmentations = parse_augmentations(CLI_ARGS.augment)\n    if any(not isinstance(a, SampleAugmentation) for a in augmentations):\n        print(\"Warning: Some of the augmentations cannot be simulated by this command.\")\n    samples = get_samples_in_play_order()\n    samples = apply_sample_augmentations(samples,\n                                         audio_type=AUDIO_TYPE_PCM,\n                                         augmentations=augmentations,\n                                         process_ahead=0,\n                                         clock=CLI_ARGS.clock)\n    for sample in samples:\n        if not CLI_ARGS.quiet:\n            print('Sample \"{}\"'.format(sample.sample_id), file=sys.stderr)\n            if isinstance(sample, LabeledSample):\n                print('  \"{}\"'.format(sample.transcript), file=sys.stderr)\n        if CLI_ARGS.pipe:\n            sample.change_audio_type(AUDIO_TYPE_WAV)\n            sys.stdout.buffer.write(sample.audio.getvalue())\n            return\n        wave_obj = simpleaudio.WaveObject(sample.audio,\n                                          sample.audio_format.channels,\n                                          sample.audio_format.width,\n                                          sample.audio_format.rate)\n        play_obj = wave_obj.play()\n        play_obj.wait_done()\n\n\ndef handle_args():\n    parser = argparse.ArgumentParser(\n        description=\"Tool for playing (and augmenting) single samples or samples from Sample Databases (SDB files) \"\n        \"and DeepSpeech CSV files\"\n    )\n    parser.add_argument(\"source\", help=\"Sample DB, CSV or WAV file to play samples from\")\n    parser.add_argument(\n        \"--start\",\n        type=int,\n        default=0,\n        help=\"Sample index to start at (negative numbers are relative to the end of the collection)\",\n    )\n    parser.add_argument(\n        \"--number\",\n        type=int,\n        default=-1,\n        help=\"Number of samples to play (-1 for endless)\",\n    )\n    parser.add_argument(\n        \"--random\",\n        action=\"store_true\",\n        help=\"If samples should be played in random order\",\n    )\n    parser.add_argument(\n        \"--augment\",\n        action='append',\n        help=\"Add an augmentation operation\",\n    )\n    parser.add_argument(\n        \"--clock\",\n        type=float,\n        default=0.5,\n        help=\"Simulates clock value used for augmentations during training.\"\n             \"Ranges from 0.0 (representing parameter start values) to\"\n             \"1.0 (representing parameter end values)\",\n    )\n    parser.add_argument(\n        \"--pipe\",\n        action=\"store_true\",\n        help=\"Pipe first sample as wav file to stdout. Forces --number to 1.\",\n    )\n    parser.add_argument(\n        \"--quiet\",\n        action=\"store_true\",\n        help=\"No info logging to console\",\n    )\n    return parser.parse_args()\n\n\nif __name__ == \"__main__\":\n    CLI_ARGS = handle_args()\n    if not CLI_ARGS.pipe:\n        try:\n            import simpleaudio\n        except ModuleNotFoundError:\n            print('Unless using the --pipe flag, play.py requires Python package \"simpleaudio\" for playing samples')\n            sys.exit(1)\n    try:\n        play_collection()\n    except KeyboardInterrupt:\n        print(\" Stopped\")\n        sys.exit(0)\n"
  },
  {
    "path": "bin/run-ci-graph_augmentations.sh",
    "content": "#!/bin/sh\n\nset -xe\n\nldc93s1_dir=\"./data/smoke_test\"\nldc93s1_csv=\"${ldc93s1_dir}/ldc93s1.csv\"\n\nif [ ! -f \"${ldc93s1_dir}/ldc93s1.csv\" ]; then\n    echo \"Downloading and preprocessing LDC93S1 example data, saving in ${ldc93s1_dir}.\"\n    python -u bin/import_ldc93s1.py ${ldc93s1_dir}\nfi;\n\n# Force only one visible device because we have a single-sample dataset\n# and when trying to run on multiple devices (like GPUs), this will break\nexport CUDA_VISIBLE_DEVICES=0\n\npython -u DeepSpeech.py --noshow_progressbar --noearly_stop \\\n  --train_files ${ldc93s1_csv} --train_batch_size 1 \\\n  --scorer \"\" \\\n  --augment dropout \\\n  --augment pitch \\\n  --augment tempo \\\n  --augment warp \\\n  --augment time_mask \\\n  --augment frequency_mask \\\n  --augment add \\\n  --augment multiply \\\n  --n_hidden 100 \\\n  --epochs 1\n"
  },
  {
    "path": "bin/run-ci-ldc93s1_checkpoint.sh",
    "content": "#!/bin/sh\n\nset -xe\n\nldc93s1_dir=\"./data/smoke_test\"\nldc93s1_csv=\"${ldc93s1_dir}/ldc93s1.csv\"\n\nif [ ! -f \"${ldc93s1_dir}/ldc93s1.csv\" ]; then\n    echo \"Downloading and preprocessing LDC93S1 example data, saving in ${ldc93s1_dir}.\"\n    python -u bin/import_ldc93s1.py ${ldc93s1_dir}\nfi;\n\n# Force only one visible device because we have a single-sample dataset\n# and when trying to run on multiple devices (like GPUs), this will break\nexport CUDA_VISIBLE_DEVICES=0\n\npython -u DeepSpeech.py --noshow_progressbar --noearly_stop \\\n  --train_files ${ldc93s1_csv} --train_batch_size 1 \\\n  --dev_files ${ldc93s1_csv} --dev_batch_size 1 \\\n  --test_files ${ldc93s1_csv} --test_batch_size 1 \\\n  --n_hidden 100 --epochs 1 \\\n  --max_to_keep 1 --checkpoint_dir '/tmp/ckpt' \\\n  --learning_rate 0.001 --dropout_rate 0.05 \\\n  --scorer_path 'data/smoke_test/pruned_lm.scorer' | tee /tmp/resume.log\n\nif ! grep \"Loading best validating checkpoint from\" /tmp/resume.log; then\n  echo \"Did not resume training from checkpoint\"\n  exit 1\nelse\n  exit 0\nfi\n"
  },
  {
    "path": "bin/run-ci-ldc93s1_checkpoint_bytes.sh",
    "content": "#!/bin/sh\n\nset -xe\n\nldc93s1_dir=\"./data/smoke_test\"\nldc93s1_csv=\"${ldc93s1_dir}/ldc93s1.csv\"\n\nif [ ! -f \"${ldc93s1_dir}/ldc93s1.csv\" ]; then\n    echo \"Downloading and preprocessing LDC93S1 example data, saving in ${ldc93s1_dir}.\"\n    python -u bin/import_ldc93s1.py ${ldc93s1_dir}\nfi;\n\n# Force only one visible device because we have a single-sample dataset\n# and when trying to run on multiple devices (like GPUs), this will break\nexport CUDA_VISIBLE_DEVICES=0\n\npython -u DeepSpeech.py --noshow_progressbar --noearly_stop \\\n  --train_files ${ldc93s1_csv} --train_batch_size 1 \\\n  --dev_files ${ldc93s1_csv} --dev_batch_size 1 \\\n  --test_files ${ldc93s1_csv} --test_batch_size 1 \\\n  --n_hidden 100 --epochs 1 \\\n  --max_to_keep 1 --checkpoint_dir '/tmp/ckpt_bytes' --bytes_output_mode \\\n  --learning_rate 0.001 --dropout_rate 0.05 \\\n  --scorer_path 'data/smoke_test/pruned_lm.bytes.scorer' | tee /tmp/resume.log\n\nif ! grep \"Loading best validating checkpoint from\" /tmp/resume.log; then\n  echo \"Did not resume training from checkpoint\"\n  exit 1\nelse\n  exit 0\nfi\n"
  },
  {
    "path": "bin/run-ci-ldc93s1_checkpoint_sdb.sh",
    "content": "#!/bin/sh\n\nset -xe\n\nldc93s1_dir=\"./data/smoke_test\"\nldc93s1_csv=\"${ldc93s1_dir}/ldc93s1.csv\"\nldc93s1_sdb=\"${ldc93s1_dir}/ldc93s1.sdb\"\n\nif [ ! -f \"${ldc93s1_dir}/ldc93s1.csv\" ]; then\n    echo \"Downloading and preprocessing LDC93S1 example data, saving in ${ldc93s1_dir}.\"\n    python -u bin/import_ldc93s1.py ${ldc93s1_dir}\nfi;\n\nif [ ! -f \"${ldc93s1_dir}/ldc93s1.sdb\" ]; then\n    echo \"Converting LDC93S1 example data, saving to ${ldc93s1_sdb}.\"\n    python -u bin/data_set_tool.py ${ldc93s1_csv} ${ldc93s1_sdb}\nfi;\n\n# Force only one visible device because we have a single-sample dataset\n# and when trying to run on multiple devices (like GPUs), this will break\nexport CUDA_VISIBLE_DEVICES=0\n\npython -u DeepSpeech.py --noshow_progressbar --noearly_stop \\\n  --train_files ${ldc93s1_sdb} --train_batch_size 1 \\\n  --dev_files ${ldc93s1_sdb} --dev_batch_size 1 \\\n  --test_files ${ldc93s1_sdb} --test_batch_size 1 \\\n  --n_hidden 100 --epochs 1 \\\n  --max_to_keep 1 --checkpoint_dir '/tmp/ckpt_sdb' \\\n  --learning_rate 0.001 --dropout_rate 0.05 \\\n  --scorer_path 'data/smoke_test/pruned_lm.scorer' | tee /tmp/resume.log\n\nif ! grep \"Loading best validating checkpoint from\" /tmp/resume.log; then\n  echo \"Did not resume training from checkpoint\"\n  exit 1\nelse\n  exit 0\nfi\n"
  },
  {
    "path": "bin/run-ci-ldc93s1_new.sh",
    "content": "#!/bin/sh\n\nset -xe\n\nldc93s1_dir=\"./data/smoke_test\"\nldc93s1_csv=\"${ldc93s1_dir}/ldc93s1.csv\"\n\nepoch_count=$1\naudio_sample_rate=$2\n\nif [ ! -f \"${ldc93s1_dir}/ldc93s1.csv\" ]; then\n    echo \"Downloading and preprocessing LDC93S1 example data, saving in ${ldc93s1_dir}.\"\n    python -u bin/import_ldc93s1.py ${ldc93s1_dir}\nfi;\n\n# Force only one visible device because we have a single-sample dataset\n# and when trying to run on multiple devices (like GPUs), this will break\nexport CUDA_VISIBLE_DEVICES=0\n\npython -u DeepSpeech.py --noshow_progressbar --noearly_stop \\\n  --train_files ${ldc93s1_csv} --train_batch_size 1 \\\n  --feature_cache '/tmp/ldc93s1_cache' \\\n  --dev_files ${ldc93s1_csv} --dev_batch_size 1 \\\n  --test_files ${ldc93s1_csv} --test_batch_size 1 \\\n  --n_hidden 100 --epochs $epoch_count \\\n  --max_to_keep 1 --checkpoint_dir '/tmp/ckpt' \\\n  --learning_rate 0.001 --dropout_rate 0.05  --export_dir '/tmp/train' \\\n  --scorer_path 'data/smoke_test/pruned_lm.scorer' \\\n  --audio_sample_rate ${audio_sample_rate}\n"
  },
  {
    "path": "bin/run-ci-ldc93s1_new_bytes.sh",
    "content": "#!/bin/sh\n\nset -xe\n\nldc93s1_dir=\"./data/smoke_test\"\nldc93s1_csv=\"${ldc93s1_dir}/ldc93s1.csv\"\n\nepoch_count=$1\naudio_sample_rate=$2\n\nif [ ! -f \"${ldc93s1_dir}/ldc93s1.csv\" ]; then\n    echo \"Downloading and preprocessing LDC93S1 example data, saving in ${ldc93s1_dir}.\"\n    python -u bin/import_ldc93s1.py ${ldc93s1_dir}\nfi;\n\n# Force only one visible device because we have a single-sample dataset\n# and when trying to run on multiple devices (like GPUs), this will break\nexport CUDA_VISIBLE_DEVICES=0\n\npython -u DeepSpeech.py --noshow_progressbar --noearly_stop \\\n  --train_files ${ldc93s1_csv} --train_batch_size 1 \\\n  --feature_cache '/tmp/ldc93s1_cache' \\\n  --dev_files ${ldc93s1_csv} --dev_batch_size 1 \\\n  --test_files ${ldc93s1_csv} --test_batch_size 1 \\\n  --n_hidden 100 --epochs $epoch_count \\\n  --max_to_keep 1 --checkpoint_dir '/tmp/ckpt_bytes' \\\n  --learning_rate 0.001 --dropout_rate 0.05  --export_dir '/tmp/train_bytes' \\\n  --scorer_path 'data/smoke_test/pruned_lm.bytes.scorer' \\\n  --audio_sample_rate ${audio_sample_rate} \\\n  --bytes_output_mode\n"
  },
  {
    "path": "bin/run-ci-ldc93s1_new_bytes_tflite.sh",
    "content": "#!/bin/sh\n\nset -xe\n\nldc93s1_dir=\"./data/smoke_test\"\nldc93s1_csv=\"${ldc93s1_dir}/ldc93s1.csv\"\n\naudio_sample_rate=$1\n\nif [ ! -f \"${ldc93s1_dir}/ldc93s1.csv\" ]; then\n    echo \"Downloading and preprocessing LDC93S1 example data, saving in ${ldc93s1_dir}.\"\n    python -u bin/import_ldc93s1.py ${ldc93s1_dir}\nfi;\n\n# Force only one visible device because we have a single-sample dataset\n# and when trying to run on multiple devices (like GPUs), this will break\nexport CUDA_VISIBLE_DEVICES=0\n\npython -u DeepSpeech.py --noshow_progressbar \\\n  --n_hidden 100 \\\n  --checkpoint_dir '/tmp/ckpt_bytes' \\\n  --export_dir '/tmp/train_bytes_tflite' \\\n  --scorer_path 'data/smoke_test/pruned_lm.bytes.scorer' \\\n  --bytes_output_mode \\\n  --audio_sample_rate ${audio_sample_rate} \\\n  --export_tflite\n"
  },
  {
    "path": "bin/run-ci-ldc93s1_new_metrics.sh",
    "content": "#!/bin/sh\n\nset -xe\n\nldc93s1_dir=\"./data/smoke_test\"\nldc93s1_csv=\"${ldc93s1_dir}/ldc93s1.csv\"\n\nepoch_count=$1\naudio_sample_rate=$2\n\nif [ ! -f \"${ldc93s1_dir}/ldc93s1.csv\" ]; then\n    echo \"Downloading and preprocessing LDC93S1 example data, saving in ${ldc93s1_dir}.\"\n    python -u bin/import_ldc93s1.py ${ldc93s1_dir}\nfi;\n\n# Force only one visible device because we have a single-sample dataset\n# and when trying to run on multiple devices (like GPUs), this will break\nexport CUDA_VISIBLE_DEVICES=0\n\npython -u DeepSpeech.py --noshow_progressbar --noearly_stop \\\n  --train_files ${ldc93s1_csv} --train_batch_size 1 \\\n  --dev_files ${ldc93s1_csv} --dev_batch_size 1 \\\n  --test_files ${ldc93s1_csv} --test_batch_size 1 \\\n  --metrics_files ${ldc93s1_csv} \\\n  --n_hidden 100 --epochs $epoch_count \\\n  --max_to_keep 1 --checkpoint_dir '/tmp/ckpt_metrics' \\\n  --learning_rate 0.001 --dropout_rate 0.05 --export_dir '/tmp/train_metrics' \\\n  --scorer_path 'data/smoke_test/pruned_lm.scorer' \\\n  --audio_sample_rate ${audio_sample_rate}\n"
  },
  {
    "path": "bin/run-ci-ldc93s1_new_sdb.sh",
    "content": "#!/bin/sh\n\nset -xe\n\nldc93s1_dir=\"./data/smoke_test\"\nldc93s1_csv=\"${ldc93s1_dir}/ldc93s1.csv\"\nldc93s1_sdb=\"${ldc93s1_dir}/ldc93s1.sdb\"\n\nepoch_count=$1\naudio_sample_rate=$2\n\nif [ ! -f \"${ldc93s1_dir}/ldc93s1.csv\" ]; then\n    echo \"Downloading and preprocessing LDC93S1 example data, saving in ${ldc93s1_dir}.\"\n    python -u bin/import_ldc93s1.py ${ldc93s1_dir}\nfi;\n\nif [ ! -f \"${ldc93s1_dir}/ldc93s1.sdb\" ]; then\n    echo \"Converting LDC93S1 example data, saving to ${ldc93s1_sdb}.\"\n    python -u bin/data_set_tool.py ${ldc93s1_csv} ${ldc93s1_sdb}\nfi;\n\n# Force only one visible device because we have a single-sample dataset\n# and when trying to run on multiple devices (like GPUs), this will break\nexport CUDA_VISIBLE_DEVICES=0\n\npython -u DeepSpeech.py --noshow_progressbar --noearly_stop \\\n  --train_files ${ldc93s1_sdb} --train_batch_size 1 \\\n  --dev_files ${ldc93s1_sdb} --dev_batch_size 1 \\\n  --test_files ${ldc93s1_sdb} --test_batch_size 1 \\\n  --n_hidden 100 --epochs $epoch_count \\\n  --max_to_keep 1 --checkpoint_dir '/tmp/ckpt_sdb' \\\n  --learning_rate 0.001 --dropout_rate 0.05  --export_dir '/tmp/train_sdb' \\\n  --scorer_path 'data/smoke_test/pruned_lm.scorer' \\\n  --audio_sample_rate ${audio_sample_rate}\n"
  },
  {
    "path": "bin/run-ci-ldc93s1_new_sdb_csv.sh",
    "content": "#!/bin/sh\n\nset -xe\n\nldc93s1_dir=\"./data/smoke_test\"\nldc93s1_csv=\"${ldc93s1_dir}/ldc93s1.csv\"\nldc93s1_sdb=\"${ldc93s1_dir}/ldc93s1.sdb\"\n\nepoch_count=$1\naudio_sample_rate=$2\n\nif [ ! -f \"${ldc93s1_dir}/ldc93s1.csv\" ]; then\n    echo \"Downloading and preprocessing LDC93S1 example data, saving in ${ldc93s1_dir}.\"\n    python -u bin/import_ldc93s1.py ${ldc93s1_dir}\nfi;\n\nif [ ! -f \"${ldc93s1_dir}/ldc93s1.sdb\" ]; then\n    echo \"Converting LDC93S1 example data, saving to ${ldc93s1_sdb}.\"\n    python -u bin/data_set_tool.py ${ldc93s1_csv} ${ldc93s1_sdb}\nfi;\n\n# Force only one visible device because we have a single-sample dataset\n# and when trying to run on multiple devices (like GPUs), this will break\nexport CUDA_VISIBLE_DEVICES=0\n\npython -u DeepSpeech.py --noshow_progressbar --noearly_stop \\\n  --train_files ${ldc93s1_sdb},${ldc93s1_csv} --train_batch_size 1 \\\n  --feature_cache '/tmp/ldc93s1_cache_sdb_csv' \\\n  --dev_files ${ldc93s1_sdb},${ldc93s1_csv} --dev_batch_size 1 \\\n  --test_files ${ldc93s1_sdb},${ldc93s1_csv} --test_batch_size 1 \\\n  --n_hidden 100 --epochs $epoch_count \\\n  --max_to_keep 1 --checkpoint_dir '/tmp/ckpt_sdb_csv' \\\n  --learning_rate 0.001 --dropout_rate 0.05  --export_dir '/tmp/train_sdb_csv' \\\n  --scorer_path 'data/smoke_test/pruned_lm.scorer' \\\n  --audio_sample_rate ${audio_sample_rate}\n"
  },
  {
    "path": "bin/run-ci-ldc93s1_singleshotinference.sh",
    "content": "#!/bin/sh\n\nset -xe\n\nldc93s1_dir=\"./data/smoke_test\"\nldc93s1_csv=\"${ldc93s1_dir}/ldc93s1.csv\"\n\nif [ ! -f \"${ldc93s1_dir}/ldc93s1.csv\" ]; then\n    echo \"Downloading and preprocessing LDC93S1 example data, saving in ${ldc93s1_dir}.\"\n    python -u bin/import_ldc93s1.py ${ldc93s1_dir}\nfi;\n\n# Force only one visible device because we have a single-sample dataset\n# and when trying to run on multiple devices (like GPUs), this will break\nexport CUDA_VISIBLE_DEVICES=0\n\npython -u DeepSpeech.py --noshow_progressbar --noearly_stop \\\n  --train_files ${ldc93s1_csv} --train_batch_size 1 \\\n  --dev_files ${ldc93s1_csv} --dev_batch_size 1 \\\n  --test_files ${ldc93s1_csv} --test_batch_size 1 \\\n  --n_hidden 100 --epochs 1 \\\n  --max_to_keep 1 --checkpoint_dir '/tmp/ckpt' --checkpoint_secs 0 \\\n  --learning_rate 0.001 --dropout_rate 0.05 \\\n  --scorer_path 'data/smoke_test/pruned_lm.scorer'\n\npython -u DeepSpeech.py \\\n  --n_hidden 100 \\\n  --checkpoint_dir '/tmp/ckpt' \\\n  --scorer_path 'data/smoke_test/pruned_lm.scorer' \\\n  --one_shot_infer 'data/smoke_test/LDC93S1.wav'\n"
  },
  {
    "path": "bin/run-ci-ldc93s1_tflite.sh",
    "content": "#!/bin/sh\n\nset -xe\n\nldc93s1_dir=\"./data/smoke_test\"\nldc93s1_csv=\"${ldc93s1_dir}/ldc93s1.csv\"\n\naudio_sample_rate=$1\n\nif [ ! -f \"${ldc93s1_dir}/ldc93s1.csv\" ]; then\n    echo \"Downloading and preprocessing LDC93S1 example data, saving in ${ldc93s1_dir}.\"\n    python -u bin/import_ldc93s1.py ${ldc93s1_dir}\nfi;\n\n# Force only one visible device because we have a single-sample dataset\n# and when trying to run on multiple devices (like GPUs), this will break\nexport CUDA_VISIBLE_DEVICES=0\n\npython -u DeepSpeech.py --noshow_progressbar \\\n  --n_hidden 100 \\\n  --checkpoint_dir '/tmp/ckpt' \\\n  --export_dir '/tmp/train_tflite' \\\n  --scorer_path 'data/smoke_test/pruned_lm.scorer' \\\n  --audio_sample_rate ${audio_sample_rate} \\\n  --export_tflite\n\nmkdir /tmp/train_tflite/en-us\n\npython -u DeepSpeech.py --noshow_progressbar \\\n  --n_hidden 100 \\\n  --checkpoint_dir '/tmp/ckpt' \\\n  --export_dir '/tmp/train_tflite/en-us' \\\n  --scorer_path 'data/smoke_test/pruned_lm.scorer' \\\n  --audio_sample_rate ${audio_sample_rate} \\\n  --export_language 'Fake English (fk-FK)' \\\n  --export_zip\n"
  },
  {
    "path": "bin/run-ci-sample_augmentations.sh",
    "content": "#!/bin/sh\n\nset -xe\n\nldc93s1_dir=`cd data/smoke_test; pwd`\nldc93s1_csv=\"${ldc93s1_dir}/LDC93S1.csv\"\nldc93s1_wav=\"${ldc93s1_dir}/LDC93S1.wav\"\nldc93s1_overlay_csv=\"${ldc93s1_dir}/LDC93S1_overlay.csv\"\nldc93s1_overlay_wav=\"${ldc93s1_dir}/LDC93S1_reversed.wav\"\n\nplay=\"python bin/play.py --number 1 --quiet\"\ncompare=\"python bin/compare_samples.py --no-success-output\"\n\nif [ ! -f \"${ldc93s1_csv}\" ]; then\n    echo \"Downloading and preprocessing LDC93S1 example data, saving in ${ldc93s1_dir}.\"\n    python -u bin/import_ldc93s1.py ${ldc93s1_dir}\nfi;\n\nif [ ! -f \"${ldc93s1_overlay_csv}\" ]; then\n    echo \"Reversing ${ldc93s1_wav} to ${ldc93s1_overlay_wav}.\"\n    sox \"${ldc93s1_wav}\" \"${ldc93s1_overlay_wav}\" reverse\n\n    echo \"Creating ${ldc93s1_overlay_csv}.\"\n    printf \"wav_filename\\n${ldc93s1_overlay_wav}\" > \"${ldc93s1_overlay_csv}\"\nfi;\n\nif ! $compare --if-differ \"${ldc93s1_wav}\" \"${ldc93s1_overlay_wav}\"; then\n  echo \"Sample comparison tool not working correctly\"\n  exit 1\nfi\n\n$play ${ldc93s1_wav} --augment overlay[source=\"${ldc93s1_overlay_csv}\",snr=20] --pipe >/tmp/overlay-test.wav\nif ! $compare --if-differ \"${ldc93s1_wav}\" /tmp/overlay-test.wav; then\n  echo \"Overlay augmentation had no effect or changed basic sample properties\"\n  exit 1\nfi\n\n$play ${ldc93s1_wav} --augment reverb[delay=50.0,decay=2.0] --pipe >/tmp/reverb-test.wav\nif ! $compare --if-differ \"${ldc93s1_wav}\" /tmp/reverb-test.wav; then\n  echo \"Reverb augmentation had no effect or changed basic sample properties\"\n  exit 1\nfi\n\n$play ${ldc93s1_wav} --augment resample[rate=4000] --pipe >/tmp/resample-test.wav\nif ! $compare --if-differ \"${ldc93s1_wav}\" /tmp/resample-test.wav; then\n  echo \"Resample augmentation had no effect or changed basic sample properties\"\n  exit 1\nfi\n\n$play ${ldc93s1_wav} --augment codec[bitrate=4000] --pipe >/tmp/codec-test.wav\nif ! $compare --if-differ \"${ldc93s1_wav}\" /tmp/codec-test.wav; then\n  echo \"Codec augmentation had no effect or changed basic sample properties\"\n  exit 1\nfi\n\n$play ${ldc93s1_wav} --augment volume --pipe >/tmp/volume-test.wav\nif ! $compare --if-differ \"${ldc93s1_wav}\" /tmp/volume-test.wav; then\n  echo \"Volume augmentation had no effect or changed basic sample properties\"\n  exit 1\nfi\n"
  },
  {
    "path": "bin/run-ci-transfer.sh",
    "content": "#!/bin/sh\n# This bash script is for running minimum working examples\n# of transfer learning for continuous integration tests\n# to be run on CI.\nset -xe\n\nru_dir=\"./data/smoke_test/russian_sample_data\"\nru_csv=\"${ru_dir}/ru.csv\"\n\nldc93s1_dir=\"./data/smoke_test\"\nldc93s1_csv=\"${ldc93s1_dir}/ldc93s1.csv\"\n\nif [ ! -f \"${ldc93s1_dir}/ldc93s1.csv\" ]; then\n    echo \"Downloading and preprocessing LDC93S1 example data, saving in ${ldc93s1_dir}.\"\n    python -u bin/import_ldc93s1.py ${ldc93s1_dir}\nfi;\n\n# Force only one visible device because we have a single-sample dataset\n# and when trying to run on multiple devices (like GPUs), this will break\nexport CUDA_VISIBLE_DEVICES=0\n\n# Force UTF-8 output\nexport PYTHONIOENCODING=utf-8\n\necho \"##### Train ENGLISH model and transfer to RUSSIAN #####\"\necho \"##### while iterating over loading logic #####\"\n\nfor LOAD in 'init' 'last' 'auto'; do\n    echo \"########################################################\"\n    echo \"#### Train ENGLISH model with just --checkpoint_dir ####\"\n    echo \"########################################################\"\n    python -u DeepSpeech.py --noshow_progressbar --noearly_stop \\\n       --alphabet_config_path \"./data/alphabet.txt\" \\\n       --load_train \"$LOAD\" \\\n       --train_files  \"${ldc93s1_csv}\" --train_batch_size 1  \\\n       --dev_files  \"${ldc93s1_csv}\" --dev_batch_size 1 \\\n       --test_files  \"${ldc93s1_csv}\" --test_batch_size 1 \\\n       --scorer_path '' \\\n       --checkpoint_dir '/tmp/ckpt/transfer/eng' \\\n       --n_hidden 100 \\\n       --epochs 10\n\n    echo \"##############################################################################\"\n    echo \"#### Train ENGLISH model with --save_checkpoint_dir --load_checkpoint_dir ####\"\n    echo \"##############################################################################\"\n    python -u DeepSpeech.py --noshow_progressbar --noearly_stop \\\n           --alphabet_config_path \"./data/alphabet.txt\" \\\n           --load_train \"$LOAD\" \\\n           --train_files  \"${ldc93s1_csv}\" --train_batch_size 1  \\\n           --dev_files  \"${ldc93s1_csv}\" --dev_batch_size 1 \\\n           --test_files  \"${ldc93s1_csv}\" --test_batch_size 1 \\\n           --save_checkpoint_dir '/tmp/ckpt/transfer/eng' \\\n           --load_checkpoint_dir '/tmp/ckpt/transfer/eng' \\\n           --scorer_path '' \\\n           --n_hidden 100 \\\n           --epochs 10\n\n    echo \"####################################################################################\"\n    echo \"#### Transfer to RUSSIAN model with --save_checkpoint_dir --load_checkpoint_dir ####\"\n    echo \"####################################################################################\"\n    python -u DeepSpeech.py --noshow_progressbar --noearly_stop \\\n           --drop_source_layers 1 \\\n           --alphabet_config_path \"${ru_dir}/alphabet.ru\" \\\n           --load_train 'last' \\\n           --train_files  \"${ru_csv}\" --train_batch_size 1  \\\n           --dev_files  \"${ru_csv}\" --dev_batch_size 1 \\\n           --save_checkpoint_dir '/tmp/ckpt/transfer/ru' \\\n           --load_checkpoint_dir '/tmp/ckpt/transfer/eng' \\\n           --scorer_path '' \\\n           --n_hidden 100 \\\n           --epochs 10\n\n    # Test transfer learning checkpoint\n    python -u evaluate.py --noshow_progressbar \\\n           --test_files  \"${ru_csv}\" --test_batch_size 1 \\\n           --alphabet_config_path \"${ru_dir}/alphabet.ru\" \\\n           --load_checkpoint_dir '/tmp/ckpt/transfer/ru' \\\n           --scorer_path '' \\\n           --n_hidden 100\ndone\n"
  },
  {
    "path": "bin/run-ldc93s1.sh",
    "content": "#!/bin/sh\nset -xe\nif [ ! -f DeepSpeech.py ]; then\n    echo \"Please make sure you run this from DeepSpeech's top level directory.\"\n    exit 1\nfi;\n\nif [ ! -f \"data/ldc93s1/ldc93s1.csv\" ]; then\n    echo \"Downloading and preprocessing LDC93S1 example data, saving in ./data/ldc93s1.\"\n    python -u bin/import_ldc93s1.py ./data/ldc93s1\nfi;\n\nif [ -d \"${COMPUTE_KEEP_DIR}\" ]; then\n    checkpoint_dir=$COMPUTE_KEEP_DIR\nelse\n    checkpoint_dir=$(python -c 'from xdg import BaseDirectory as xdg; print(xdg.save_data_path(\"deepspeech/ldc93s1\"))')\nfi\n\n# Force only one visible device because we have a single-sample dataset\n# and when trying to run on multiple devices (like GPUs), this will break\nexport CUDA_VISIBLE_DEVICES=0\n\npython -u DeepSpeech.py --noshow_progressbar \\\n  --train_files data/ldc93s1/ldc93s1.csv \\\n  --test_files data/ldc93s1/ldc93s1.csv \\\n  --train_batch_size 1 \\\n  --test_batch_size 1 \\\n  --n_hidden 100 \\\n  --epochs 200 \\\n  --checkpoint_dir \"$checkpoint_dir\" \\\n  \"$@\"\n"
  },
  {
    "path": "build-python-wheel.yml-DISABLED_ENABLE_ME_TO_REBUILD_DURING_PR",
    "content": "build:\n  template_file: build-python-wheel.tyml\n  metadata:\n    name: \"Build Python 3.5 wheels on ARM64\"\n    description: \"Building some Python 3.5 wheels for ARM64 system\"\n"
  },
  {
    "path": "ci_scripts/aarch64-build.sh",
    "content": "#!/bin/bash\n\nset -xe\n\nsource $(dirname \"$0\")/all-vars.sh\nsource $(dirname \"$0\")/all-utils.sh\nsource $(dirname \"$0\")/build-utils.sh\n\nsource $(dirname \"$0\")/tf-vars.sh\n\nBAZEL_TARGETS=\"\n//native_client:libdeepspeech.so\n//native_client:generate_scorer_package\n\"\n\nBAZEL_BUILD_FLAGS=\"${BAZEL_ARM64_FLAGS} ${BAZEL_EXTRA_FLAGS}\"\nBAZEL_ENV_FLAGS=\"TF_NEED_CUDA=0\"\n\nmaybe_install_xldd\n\ndo_bazel_build\n\ndo_deepspeech_binary_build\n"
  },
  {
    "path": "ci_scripts/all-utils.sh",
    "content": "#!/bin/bash\n\nset -xe\n\nset_ldc_sample_filename()\n{\n  local _bitrate=$1\n\n  if [ -z \"${_bitrate}\" ]; then\n    echo \"Bitrate should not be empty\"\n    exit 1\n  fi;\n\n  case \"${_bitrate}\" in\n    8k)\n      ldc93s1_sample_filename='LDC93S1_pcms16le_1_8000.wav'\n    ;;\n    16k)\n      ldc93s1_sample_filename='LDC93S1_pcms16le_1_16000.wav'\n    ;;\n  esac\n}\n\ndownload_model_prod()\n{\n  local _model_source_file=$(basename \"${model_source}\")\n  ${WGET} \"${model_source}\" -O - | gunzip --force > \"${CI_TMP_DIR}/${_model_source_file}\"\n\n  local _model_source_mmap_file=$(basename \"${model_source_mmap}\")\n  ${WGET} \"${model_source_mmap}\" -O - | gunzip --force > \"${CI_TMP_DIR}/${_model_source_mmap_file}\"\n}\n\ndownload_data()\n{\n  cp ${DS_DSDIR}/data/smoke_test/*.wav ${CI_TMP_DIR}/\n  cp ${DS_DSDIR}/data/smoke_test/pruned_lm.scorer ${CI_TMP_DIR}/kenlm.scorer\n  cp ${DS_DSDIR}/data/smoke_test/pruned_lm.bytes.scorer ${CI_TMP_DIR}/kenlm.bytes.scorer\n\n  cp -R ${DS_DSDIR}/native_client/test ${CI_TMP_DIR}/test_sources\n}\n\ndownload_material()\n{\n  download_data\n\n  ls -hal ${CI_TMP_DIR}/${model_name} ${CI_TMP_DIR}/${model_name_mmap} ${CI_TMP_DIR}/LDC93S1*.wav\n}\n\nmaybe_install_xldd()\n{\n  # -s required to avoid the noisy output like \"Entering / Leaving directories\"\n  toolchain=$(make -s -C ${DS_DSDIR}/native_client/ TARGET=${SYSTEM_TARGET} TFDIR=${DS_TFDIR} print-toolchain)\n  if [ ! -x \"${toolchain}ldd\" ]; then\n    cp \"${DS_DSDIR}/native_client/xldd\" \"${toolchain}ldd\" && chmod +x \"${toolchain}ldd\"\n  fi\n}\n\n# Checks whether we run a patched version of bazel.\n# Patching is required to dump computeKey() parameters to .ckd files\n# See bazel.patch\n# Return 0 (success exit code) on patched version, 1 on release version\nis_patched_bazel()\n{\n  bazel_version=$(bazel version | grep 'Build label:' | cut -d':' -f2)\n\n  bazel shutdown\n\n  if [ -z \"${bazel_version}\" ]; then\n    return 0;\n  else\n    return 1;\n  fi;\n}\n\nverify_bazel_rebuild()\n{\n  bazel_explain_file=\"$1\"\n\n  if [ ! -f \"${bazel_explain_file}\" ]; then\n    echo \"No such explain file: ${bazel_explain_file}\"\n    exit 1\n  fi;\n\n  mkdir -p ${CI_ARTIFACTS_DIR} || true\n\n  cp ${DS_DSDIR}/tensorflow/bazel*.log ${CI_ARTIFACTS_DIR}/\n\n  spurious_rebuilds=$(grep 'Executing action' \"${bazel_explain_file}\" | grep 'Compiling' | grep -v -E 'no entry in the cache|[for host]|unconditional execution is requested|Executing genrule //native_client:workspace_status|Compiling native_client/workspace_status.cc|Linking native_client/libdeepspeech.so' | wc -l)\n  if [ \"${spurious_rebuilds}\" -ne 0 ]; then\n    echo \"Bazel rebuilds some file it should not, please check.\"\n\n    if is_patched_bazel; then\n      mkdir -p ${DS_ROOT_TASK}/ckd/ds ${DS_ROOT_TASK}/ckd/tf\n      tar xf ${DS_ROOT_TASK}/bazel-ckd-tf.tar --strip-components=4 -C ${DS_ROOT_TASK}/ckd/ds/\n      tar xf ${DS_ROOT_TASK}/bazel-ckd-ds.tar --strip-components=4 -C ${DS_DSDIR}/ckd/tensorflow/\n\n      echo \"Making a diff between CKD files\"\n      mkdir -p ${CI_ARTIFACTS_DIR}\n      diff -urNw ${DS_DSDIR}/ckd/tensorflow/ ${DS_ROOT_TASK}/ckd/ds/ | tee ${CI_ARTIFACTS_DIR}/ckd.diff\n\n      rm -fr ${DS_DSDIR}/ckd/tensorflow/ ${DS_ROOT_TASK}/ckd/ds/\n    else\n      echo \"Cannot get CKD information from release, please use patched Bazel\"\n    fi;\n\n    exit 1\n  fi;\n}\n\nsymlink_electron()\n{\n  if [ \"${OS}\" = \"Darwin\" ]; then\n    ln -s Electron.app/Contents/MacOS/Electron node_modules/electron/dist/node\n  else\n    ln -s electron \"${DS_ROOT_TASK}/node_modules/electron/dist/node\"\n\n    if [ \"${OS}\" = \"Linux\" -a -f \"${DS_ROOT_TASK}/node_modules/electron/dist/chrome-sandbox\" ]; then\n      export ELECTRON_DISABLE_SANDBOX=1\n    fi\n  fi\n}\n\nexport_node_bin_path()\n{\n  export PATH=${DS_ROOT_TASK}/node_modules/.bin/:${DS_ROOT_TASK}/node_modules/electron/dist/:$PATH\n}\n\nexport_py_bin_path()\n{\n  export PATH=$HOME/.local/bin/:$PATH\n}\n"
  },
  {
    "path": "ci_scripts/all-vars.sh",
    "content": "#!/bin/bash\n\nset -xe\n\nexport OS=$(uname)\nif [ \"${OS}\" = \"Linux\" ]; then\n    export DS_ROOT_TASK=${CI_TASK_DIR}\n    export PYENV_ROOT=\"${DS_ROOT_TASK}/pyenv-root\"\n    export DS_CPU_COUNT=$(nproc)\nfi;\n\nif [ \"${OS}\" = \"${CI_MSYS_VERSION}\" ]; then\n    export CI_TASK_DIR=\"$(cygpath ${CI_TASK_DIR})\"\n    export DS_ROOT_TASK=${CI_TASK_DIR}\n    export PYENV_ROOT=\"${CI_TASK_DIR}/pyenv-root\"\n    export PLATFORM_EXE_SUFFIX=.exe\n    export DS_CPU_COUNT=$(nproc)\n\n    # Those are the versions available on NuGet.org\n    export SUPPORTED_PYTHON_VERSIONS=\"3.5.4:ucs2 3.6.8:ucs2 3.7.6:ucs2 3.8.1:ucs2 3.9.0:ucs2\"\nfi;\n\nif [ \"${OS}\" = \"Darwin\" ]; then\n    export DS_ROOT_TASK=${CI_TASK_DIR}\n    export DS_CPU_COUNT=$(sysctl hw.ncpu |cut -d' ' -f2)\n    export PYENV_ROOT=\"${DS_ROOT_TASK}/pyenv-root\"\n\n    export HOMEBREW_NO_AUTO_UPDATE=1\n    export BREW_URL=https://github.com/Homebrew/brew/tarball/2.2.17\n\n    export BUILDS_BREW=\"${CI_TASK_DIR}/homebrew-builds\"\n    export TESTS_BREW=\"${CI_TASK_DIR}/homebrew-tests\"\n\n    export NVM_DIR=$TESTS_BREW/.nvm/ && mkdir -p $NVM_DIR\n    export PKG_CONFIG_PATH=\"${BUILDS_BREW}/lib/pkgconfig\"\n\n    if [ -f \"${BUILDS_BREW}/bin/brew\" ]; then\n        export PATH=${BUILDS_BREW}/bin/:${BUILDS_BREW}/opt/node@12/bin:$PATH\n    fi;\n\n    if [ -f \"${TESTS_BREW}/bin/brew\" ]; then\n        export PATH=${TESTS_BREW}/bin/:$PATH\n    fi;\nfi;\n\nexport CI_ARTIFACTS_DIR=${CI_ARTIFACTS_DIR:-/tmp/artifacts}\nexport CI_TMP_DIR=${CI_TMP_DIR:-/tmp}\n\nexport ANDROID_TMP_DIR=/data/local/tmp\n\nmkdir -p ${CI_TMP_DIR} || true\n\nexport DS_TFDIR=${DS_ROOT_TASK}/tensorflow\nexport DS_DSDIR=${DS_ROOT_TASK}/\nexport DS_EXAMPLEDIR=${DS_ROOT_TASK}/examples\n\nexport DS_VERSION=\"$(cat ${DS_DSDIR}/training/deepspeech_training/VERSION)\"\n\nexport GRADLE_USER_HOME=${DS_ROOT_TASK}/gradle-cache\nexport ANDROID_SDK_HOME=${DS_ROOT_TASK}/DeepSpeech/Android/SDK/\nexport ANDROID_NDK_HOME=${DS_ROOT_TASK}/DeepSpeech/Android/android-ndk-r18b/\n\nWGET=${WGET:-\"wget\"}\nTAR=${TAR:-\"tar\"}\nXZ=${XZ:-\"xz -9 -T0\"}\nZIP=${ZIP:-\"zip\"}\nUNXZ=${UNXZ:-\"xz -T0 -d\"}\nUNGZ=${UNGZ:-\"gunzip\"}\n\nif [ \"${OS}\" = \"Darwin\" ]; then\n  TAR=\"gtar\"\nfi\n\nif [ \"${OS}\" = \"${CI_MSYS_VERSION}\" ]; then\n  WGET=/usr/bin/wget.exe\n  TAR=/usr/bin/tar.exe\n  XZ=\"xz -9 -T0 -c -\"\n  UNXZ=\"xz -9 -T0 -d\"\nfi\n\nmodel_source=\"${DEEPSPEECH_TEST_MODEL}\"\nmodel_name=\"$(basename \"${model_source}\")\"\nmodel_name_mmap=\"$(basename -s \".pb\" \"${model_source}\").pbmm\"\nmodel_source_mmap=\"$(dirname \"${model_source}\")/${model_name_mmap}\"\n\nldc93s1_sample_filename=''\n"
  },
  {
    "path": "ci_scripts/armv7-build.sh",
    "content": "#!/bin/bash\n\nset -xe\n\nsource $(dirname \"$0\")/all-vars.sh\nsource $(dirname \"$0\")/all-utils.sh\nsource $(dirname \"$0\")/build-utils.sh\n\nsource $(dirname \"$0\")/tf-vars.sh\n\nBAZEL_TARGETS=\"\n//native_client:libdeepspeech.so\n//native_client:generate_scorer_package\n\"\n\nBAZEL_BUILD_FLAGS=\"${BAZEL_ARM_FLAGS} ${BAZEL_EXTRA_FLAGS}\"\nBAZEL_ENV_FLAGS=\"TF_NEED_CUDA=0\"\n\nmaybe_install_xldd\n\ndo_bazel_build\n\ndo_deepspeech_binary_build\n"
  },
  {
    "path": "ci_scripts/asserts.sh",
    "content": "#!/bin/bash\n\nset -xe\n\nstrip() {\n  # We strip leading carriage return due to ElectronJS on Windows producing stray\n  # characters before its output intermittently.\n  # Then we strip leading and trailing whitespace.\n  echo \"$(echo $1 | tr -d $'\\r' | sed -e 's/^[[:space:]]*//' -e 's/[[:space:]]*$//')\"\n}\n\n# This verify exact inference result\nassert_correct_inference()\n{\n  phrase=$(strip \"$1\")\n  expected=$(strip \"$2\")\n  status=$3\n\n  if [ \"$status\" -ne \"0\" ]; then\n      case \"$(cat ${CI_TMP_DIR}/stderr)\" in\n          *\"incompatible with minimum version\"*)\n              echo \"Prod model too old for client, skipping test.\"\n              return 0\n          ;;\n\n          *)\n              echo \"Client failed to run:\"\n              cat ${CI_TMP_DIR}/stderr\n              return 1\n          ;;\n      esac\n  fi\n\n  if [ -z \"${phrase}\" -o -z \"${expected}\" ]; then\n      echo \"One or more empty strings:\"\n      echo \"phrase: <${phrase}>\"\n      echo \"expected: <${expected}>\"\n      return 1\n  fi;\n\n  if [ \"${phrase}\" = \"${expected}\" ]; then\n      echo \"Proper output has been produced:\"\n      echo \"${phrase}\"\n      return 0\n  else\n      echo \"!! Non matching output !!\"\n      echo \"got: <${phrase}>\"\n      if [ -x \"$(command -v xxd)\" ]; then\n        echo \"xxd:\"; echo \"${phrase}\" | xxd\n      fi\n      echo \"-------------------\"\n      echo \"expected: <${expected}>\"\n      if [ -x \"$(command -v xxd)\" ]; then\n        echo \"xxd:\"; echo \"${expected}\" | xxd\n      fi\n      return 1\n  fi;\n}\n\n# This verify that ${expected} is contained within ${phrase}\nassert_working_inference()\n{\n  phrase=$1\n  expected=$2\n  status=$3\n\n  if [ -z \"${phrase}\" -o -z \"${expected}\" ]; then\n      echo \"One or more empty strings:\"\n      echo \"phrase: <${phrase}>\"\n      echo \"expected: <${expected}>\"\n      return 1\n  fi;\n\n  if [ \"$status\" -ne \"0\" ]; then\n      case \"$(cat ${CI_TMP_DIR}/stderr)\" in\n          *\"incompatible with minimum version\"*)\n              echo \"Prod model too old for client, skipping test.\"\n              return 0\n          ;;\n\n          *)\n              echo \"Client failed to run:\"\n              cat ${CI_TMP_DIR}/stderr\n              return 1\n          ;;\n      esac\n  fi\n\n  case \"${phrase}\" in\n      *${expected}*)\n          echo \"Proper output has been produced:\"\n          echo \"${phrase}\"\n          return 0\n      ;;\n\n      *)\n          echo \"!! Non matching output !!\"\n          echo \"got: <${phrase}>\"\n          if [ -x \"$(command -v xxd)\" ]; then\n            echo \"xxd:\"; echo \"${phrase}\" | xxd\n          fi\n          echo \"-------------------\"\n          echo \"expected: <${expected}>\"\n          if [ -x \"$(command -v xxd)\" ]; then\n            echo \"xxd:\"; echo \"${expected}\" | xxd\n          fi\n          return 1\n      ;;\n  esac\n}\n\nassert_shows_something()\n{\n  stderr=$1\n  expected=$2\n\n  if [ -z \"${stderr}\" -o -z \"${expected}\" ]; then\n      echo \"One or more empty strings:\"\n      echo \"stderr: <${stderr}>\"\n      echo \"expected: <${expected}>\"\n      return 1\n  fi;\n\n  case \"${stderr}\" in\n      *\"incompatible with minimum version\"*)\n          echo \"Prod model too old for client, skipping test.\"\n          return 0\n      ;;\n\n      *${expected}*)\n          echo \"Proper output has been produced:\"\n          echo \"${stderr}\"\n          return 0\n      ;;\n\n      *)\n          echo \"!! Non matching output !!\"\n          echo \"got: <${stderr}>\"\n          if [ -x \"$(command -v xxd)\" ]; then\n            echo \"xxd:\"; echo \"${stderr}\" | xxd\n          fi\n          echo \"-------------------\"\n          echo \"expected: <${expected}>\"\n          if [ -x \"$(command -v xxd)\" ]; then\n            echo \"xxd:\"; echo \"${expected}\" | xxd\n          fi\n          return 1\n      ;;\n  esac\n}\n\nassert_not_present()\n{\n  stderr=$1\n  not_expected=$2\n\n  if [ -z \"${stderr}\" -o -z \"${not_expected}\" ]; then\n      echo \"One or more empty strings:\"\n      echo \"stderr: <${stderr}>\"\n      echo \"not_expected: <${not_expected}>\"\n      return 1\n  fi;\n\n  case \"${stderr}\" in\n      *${not_expected}*)\n          echo \"!! Not expected was present !!\"\n          echo \"got: <${stderr}>\"\n          if [ -x \"$(command -v xxd)\" ]; then\n            echo \"xxd:\"; echo \"${stderr}\" | xxd\n          fi\n          echo \"-------------------\"\n          echo \"not_expected: <${not_expected}>\"\n          if [ -x \"$(command -v xxd)\" ]; then\n            echo \"xxd:\"; echo \"${not_expected}\" | xxd\n          fi\n          return 1\n      ;;\n\n      *)\n          echo \"Proper not expected output has not been produced:\"\n          echo \"${stderr}\"\n          return 0\n      ;;\n  esac\n}\n\nassert_correct_ldc93s1()\n{\n  assert_correct_inference \"$1\" \"she had your dark suit in greasy wash water all year\" \"$2\"\n}\n\nassert_working_ldc93s1()\n{\n  assert_working_inference \"$1\" \"she had your dark suit in greasy wash water all year\" \"$2\"\n}\n\nassert_correct_ldc93s1_lm()\n{\n  assert_correct_inference \"$1\" \"she had your dark suit in greasy wash water all year\" \"$2\"\n}\n\nassert_working_ldc93s1_lm()\n{\n  assert_working_inference \"$1\" \"she had your dark suit in greasy wash water all year\" \"$2\"\n}\n\nassert_correct_multi_ldc93s1()\n{\n  assert_shows_something \"$1\" \"/${ldc93s1_sample_filename}%she had your dark suit in greasy wash water all year%\" \"$?\"\n  assert_shows_something \"$1\" \"/LDC93S1_pcms16le_2_44100.wav%she had your dark suit in greasy wash water all year%\" \"$?\"\n  ## 8k will output garbage anyway ...\n  # assert_shows_something \"$1\" \"/LDC93S1_pcms16le_1_8000.wav%she hayorasryrtl lyreasy asr watal w water all year%\"\n}\n\nassert_correct_ldc93s1_prodmodel()\n{\n  if [ -z \"$3\" -o \"$3\" = \"16k\" ]; then\n    assert_correct_inference \"$1\" \"she had your dark suit in greasy wash water all year\" \"$2\"\n  fi;\n\n  if [ \"$3\" = \"8k\" ]; then\n    assert_correct_inference \"$1\" \"she had to do suit in greasy wash water all year\" \"$2\"\n  fi;\n}\n\nassert_working_ldc93s1_prodmodel()\n{\n  if [ -z \"$3\" -o \"$3\" = \"16k\" ]; then\n    assert_working_inference \"$1\" \"she had your dark suit in greasy wash water all year\" \"$2\"\n  fi\n\n  if [ \"$3\" = \"8k\" ]; then\n    assert_working_inference \"$1\" \"she had to do suit in greasy wash water all year\" \"$2\"\n  fi\n}\n\nassert_correct_ldc93s1_prodtflitemodel()\n{\n  if [ -z \"$3\" -o \"$3\" = \"16k\" ]; then\n    assert_correct_inference \"$1\" \"she had her dark suit in greasy wash water all year\" \"$2\"\n  fi;\n\n  if [ \"$3\" = \"8k\" ]; then\n    assert_correct_inference \"$1\" \"she had to do so and greasy wash water all year\" \"$2\"\n  fi;\n}\n\nassert_working_ldc93s1_prodtflitemodel()\n{\n  if [ -z \"$3\" -o \"$3\" = \"16k\" ]; then\n    assert_working_inference \"$1\" \"she had her dark suit in greasy wash water all year\" \"$2\"\n  fi;\n\n  if [ \"$3\" = \"8k\" ]; then\n    assert_working_inference \"$1\" \"she had to do so and greasy wash water all year\" \"$2\"\n  fi;\n}\n\nassert_correct_ldc93s1_prodmodel_stereo_44k()\n{\n  assert_correct_inference \"$1\" \"she had your dark suit in greasy wash water all year\" \"$2\"\n}\n\nassert_working_ldc93s1_prodmodel_stereo_44k()\n{\n  assert_working_inference \"$1\" \"she had your dark suit in greasy wash water all year\" \"$2\"\n}\n\nassert_correct_ldc93s1_prodtflitemodel_stereo_44k()\n{\n  assert_correct_inference \"$1\" \"she had her dark suit in greasy wash water all year\" \"$2\"\n}\n\nassert_working_ldc93s1_prodtflitemodel_stereo_44k()\n{\n  assert_working_inference \"$1\" \"she had her dark suit in greasy wash water all year\" \"$2\"\n}\n\nassert_correct_warning_upsampling()\n{\n  assert_shows_something \"$1\" \"erratic speech recognition\"\n}\n\nassert_tensorflow_version()\n{\n  assert_shows_something \"$1\" \"${EXPECTED_TENSORFLOW_VERSION}\"\n}\n\nassert_deepspeech_version()\n{\n  assert_not_present \"$1\" \"DeepSpeech: unknown\"\n}\n\n# We need to ensure that running on inference really leverages GPU because\n# it might default back to CPU\nensure_cuda_usage()\n{\n  local _maybe_cuda=$1\n  DS_BINARY_FILE=${DS_BINARY_FILE:-\"deepspeech\"}\n\n  if [ \"${_maybe_cuda}\" = \"cuda\" ]; then\n    set +e\n    export TF_CPP_MIN_VLOG_LEVEL=1\n    ds_cuda=$(${DS_BINARY_PREFIX}${DS_BINARY_FILE} --model ${CI_TMP_DIR}/${model_name} --audio ${CI_TMP_DIR}/${ldc93s1_sample_filename} 2>&1 1>/dev/null)\n    export TF_CPP_MIN_VLOG_LEVEL=\n    set -e\n\n    assert_shows_something \"${ds_cuda}\" \"Successfully opened dynamic library nvcuda.dll\"\n    assert_not_present \"${ds_cuda}\" \"Skipping registering GPU devices\"\n  fi;\n}\n\ncheck_versions()\n{\n  set +e\n  ds_help=$(${DS_BINARY_PREFIX}deepspeech --model ${CI_TMP_DIR}/${model_name} --audio ${CI_TMP_DIR}/${ldc93s1_sample_filename} 2>&1 1>/dev/null)\n  set -e\n\n  assert_tensorflow_version \"${ds_help}\"\n  assert_deepspeech_version \"${ds_help}\"\n}\n\nassert_deepspeech_runtime()\n{\n  local expected_runtime=$1\n\n  set +e\n  local ds_version=$(${DS_BINARY_PREFIX}deepspeech --version 2>&1)\n  set -e\n\n  assert_shows_something \"${ds_version}\" \"${expected_runtime}\"\n}\n\ncheck_runtime_nodejs()\n{\n  assert_deepspeech_runtime \"Runtime: Node\"\n}\n\ncheck_runtime_electronjs()\n{\n  assert_deepspeech_runtime \"Runtime: Electron\"\n}\n\nrun_tflite_basic_inference_tests()\n{\n  set +e\n  phrase_pbmodel_nolm=$(${DS_BINARY_PREFIX}deepspeech --model ${DATA_TMP_DIR}/${model_name} --audio ${DATA_TMP_DIR}/${ldc93s1_sample_filename} 2>${CI_TMP_DIR}/stderr)\n  set -e\n  assert_correct_ldc93s1 \"${phrase_pbmodel_nolm}\" \"$?\"\n\n  set +e\n  phrase_pbmodel_nolm=$(${DS_BINARY_PREFIX}deepspeech --model ${DATA_TMP_DIR}/${model_name} --audio ${DATA_TMP_DIR}/${ldc93s1_sample_filename} --extended 2>${CI_TMP_DIR}/stderr)\n  set -e\n  assert_correct_ldc93s1 \"${phrase_pbmodel_nolm}\" \"$?\"\n}\n\nrun_netframework_inference_tests()\n{\n  set +e\n  phrase_pbmodel_nolm=$(DeepSpeechConsole.exe --model ${CI_TMP_DIR}/${model_name} --audio ${CI_TMP_DIR}/${ldc93s1_sample_filename} 2>${CI_TMP_DIR}/stderr)\n  set -e\n  assert_working_ldc93s1 \"${phrase_pbmodel_nolm}\" \"$?\"\n\n  set +e\n  phrase_pbmodel_nolm=$(DeepSpeechConsole.exe --model ${CI_TMP_DIR}/${model_name} --audio ${CI_TMP_DIR}/${ldc93s1_sample_filename} --extended yes 2>${CI_TMP_DIR}/stderr)\n  set -e\n  assert_working_ldc93s1 \"${phrase_pbmodel_nolm}\" \"$?\"\n\n  set +e\n  phrase_pbmodel_nolm=$(DeepSpeechConsole.exe --model ${CI_TMP_DIR}/${model_name_mmap} --audio ${CI_TMP_DIR}/${ldc93s1_sample_filename} 2>${CI_TMP_DIR}/stderr)\n  set -e\n  assert_working_ldc93s1 \"${phrase_pbmodel_nolm}\" \"$?\"\n\n  set +e\n  phrase_pbmodel_withlm=$(DeepSpeechConsole.exe --model ${CI_TMP_DIR}/${model_name_mmap} --scorer ${CI_TMP_DIR}/kenlm.scorer --audio ${CI_TMP_DIR}/${ldc93s1_sample_filename} 2>${CI_TMP_DIR}/stderr)\n  set -e\n  assert_working_ldc93s1_lm \"${phrase_pbmodel_withlm}\" \"$?\"\n}\n\nrun_electronjs_inference_tests()\n{\n  set +e\n  phrase_pbmodel_nolm=$(deepspeech --model ${CI_TMP_DIR}/${model_name} --audio ${CI_TMP_DIR}/${ldc93s1_sample_filename} 2>${CI_TMP_DIR}/stderr)\n  set -e\n  assert_working_ldc93s1 \"${phrase_pbmodel_nolm}\" \"$?\"\n\n  set +e\n  phrase_pbmodel_nolm=$(deepspeech --model ${CI_TMP_DIR}/${model_name} --audio ${CI_TMP_DIR}/${ldc93s1_sample_filename} --extended 2>${CI_TMP_DIR}/stderr)\n  set -e\n  assert_working_ldc93s1 \"${phrase_pbmodel_nolm}\" \"$?\"\n\n  set +e\n  phrase_pbmodel_nolm=$(deepspeech --model ${CI_TMP_DIR}/${model_name_mmap} --audio ${CI_TMP_DIR}/${ldc93s1_sample_filename} 2>${CI_TMP_DIR}/stderr)\n  set -e\n  assert_working_ldc93s1 \"${phrase_pbmodel_nolm}\" \"$?\"\n\n  set +e\n  phrase_pbmodel_withlm=$(deepspeech --model ${CI_TMP_DIR}/${model_name_mmap} --scorer ${CI_TMP_DIR}/kenlm.scorer --audio ${CI_TMP_DIR}/${ldc93s1_sample_filename} 2>${CI_TMP_DIR}/stderr)\n  set -e\n  assert_working_ldc93s1_lm \"${phrase_pbmodel_withlm}\" \"$?\"\n}\n\nrun_basic_inference_tests()\n{\n  set +e\n  deepspeech --model \"\" --audio ${CI_TMP_DIR}/${ldc93s1_sample_filename} 2>${CI_TMP_DIR}/stderr\n  set -e\n  grep \"Missing model information\" ${CI_TMP_DIR}/stderr\n\n  set +e\n  phrase_pbmodel_nolm=$(deepspeech --model ${CI_TMP_DIR}/${model_name} --audio ${CI_TMP_DIR}/${ldc93s1_sample_filename} 2>${CI_TMP_DIR}/stderr)\n  status=$?\n  set -e\n  assert_correct_ldc93s1 \"${phrase_pbmodel_nolm}\" \"$status\"\n\n  set +e\n  phrase_pbmodel_nolm=$(deepspeech --model ${CI_TMP_DIR}/${model_name} --audio ${CI_TMP_DIR}/${ldc93s1_sample_filename} --extended 2>${CI_TMP_DIR}/stderr)\n  status=$?\n  set -e\n  assert_correct_ldc93s1 \"${phrase_pbmodel_nolm}\" \"$status\"\n\n  set +e\n  phrase_pbmodel_nolm=$(deepspeech --model ${CI_TMP_DIR}/${model_name_mmap} --audio ${CI_TMP_DIR}/${ldc93s1_sample_filename} 2>${CI_TMP_DIR}/stderr)\n  status=$?\n  set -e\n  assert_correct_ldc93s1 \"${phrase_pbmodel_nolm}\" \"$status\"\n\n  set +e\n  phrase_pbmodel_withlm=$(deepspeech --model ${CI_TMP_DIR}/${model_name_mmap} --scorer ${CI_TMP_DIR}/kenlm.scorer --audio ${CI_TMP_DIR}/${ldc93s1_sample_filename} 2>${CI_TMP_DIR}/stderr)\n  status=$?\n  set -e\n  assert_correct_ldc93s1_lm \"${phrase_pbmodel_withlm}\" \"$status\"\n}\n\nrun_all_inference_tests()\n{\n  run_basic_inference_tests\n\n  set +e\n  phrase_pbmodel_nolm_stereo_44k=$(deepspeech --model ${CI_TMP_DIR}/${model_name_mmap} --audio ${CI_TMP_DIR}/LDC93S1_pcms16le_2_44100.wav 2>${CI_TMP_DIR}/stderr)\n  status=$?\n  set -e\n  assert_correct_ldc93s1 \"${phrase_pbmodel_nolm_stereo_44k}\" \"$status\"\n\n  set +e\n  phrase_pbmodel_withlm_stereo_44k=$(deepspeech --model ${CI_TMP_DIR}/${model_name_mmap} --scorer ${CI_TMP_DIR}/kenlm.scorer --audio ${CI_TMP_DIR}/LDC93S1_pcms16le_2_44100.wav 2>${CI_TMP_DIR}/stderr)\n  status=$?\n  set -e\n  assert_correct_ldc93s1_lm \"${phrase_pbmodel_withlm_stereo_44k}\" \"$status\"\n\n  # Run down-sampling warning test only when we actually perform downsampling\n  if [ \"${ldc93s1_sample_filename}\" != \"LDC93S1_pcms16le_1_8000.wav\" ]; then\n    set +e\n    phrase_pbmodel_nolm_mono_8k=$(deepspeech --model ${CI_TMP_DIR}/${model_name_mmap} --audio ${CI_TMP_DIR}/LDC93S1_pcms16le_1_8000.wav 2>&1 1>/dev/null)\n    set -e\n    assert_correct_warning_upsampling \"${phrase_pbmodel_nolm_mono_8k}\"\n\n    set +e\n    phrase_pbmodel_withlm_mono_8k=$(deepspeech --model ${CI_TMP_DIR}/${model_name_mmap} --scorer ${CI_TMP_DIR}/kenlm.scorer --audio ${CI_TMP_DIR}/LDC93S1_pcms16le_1_8000.wav 2>&1 1>/dev/null)\n    set -e\n    assert_correct_warning_upsampling \"${phrase_pbmodel_withlm_mono_8k}\"\n  fi;\n}\n\nrun_prod_concurrent_stream_tests()\n{\n  local _bitrate=$1\n\n  set +e\n  output=$(python3 ${CI_TMP_DIR}/test_sources/concurrent_streams.py \\\n             --model ${CI_TMP_DIR}/${model_name_mmap} \\\n             --scorer ${CI_TMP_DIR}/kenlm.scorer \\\n             --audio1 ${CI_TMP_DIR}/LDC93S1_pcms16le_1_16000.wav \\\n             --audio2 ${CI_TMP_DIR}/new-home-in-the-stars-16k.wav 2>${CI_TMP_DIR}/stderr)\n  status=$?\n  set -e\n\n  output1=$(echo \"${output}\" | head -n 1)\n  output2=$(echo \"${output}\" | tail -n 1)\n\n  assert_correct_ldc93s1_prodmodel \"${output1}\" \"${status}\" \"16k\"\n  assert_correct_inference \"${output2}\" \"we must find a new home in the stars\" \"${status}\"\n}\n\nrun_prod_inference_tests()\n{\n  local _bitrate=$1\n\n  set +e\n  phrase_pbmodel_withlm=$(deepspeech --model ${CI_TMP_DIR}/${model_name} --scorer ${CI_TMP_DIR}/kenlm.scorer --audio ${CI_TMP_DIR}/${ldc93s1_sample_filename} 2>${CI_TMP_DIR}/stderr)\n  status=$?\n  set -e\n  assert_correct_ldc93s1_prodmodel \"${phrase_pbmodel_withlm}\" \"$status\" \"${_bitrate}\"\n\n  set +e\n  phrase_pbmodel_withlm=$(deepspeech --model ${CI_TMP_DIR}/${model_name_mmap} --scorer ${CI_TMP_DIR}/kenlm.scorer --audio ${CI_TMP_DIR}/${ldc93s1_sample_filename} 2>${CI_TMP_DIR}/stderr)\n  status=$?\n  set -e\n  assert_correct_ldc93s1_prodmodel \"${phrase_pbmodel_withlm}\" \"$status\" \"${_bitrate}\"\n\n  set +e\n  phrase_pbmodel_withlm_stereo_44k=$(deepspeech --model ${CI_TMP_DIR}/${model_name_mmap} --scorer ${CI_TMP_DIR}/kenlm.scorer --audio ${CI_TMP_DIR}/LDC93S1_pcms16le_2_44100.wav 2>${CI_TMP_DIR}/stderr)\n  status=$?\n  set -e\n  assert_correct_ldc93s1_prodmodel_stereo_44k \"${phrase_pbmodel_withlm_stereo_44k}\" \"$status\"\n\n  # Run down-sampling warning test only when we actually perform downsampling\n  if [ \"${ldc93s1_sample_filename}\" != \"LDC93S1_pcms16le_1_8000.wav\" ]; then\n    set +e\n    phrase_pbmodel_withlm_mono_8k=$(deepspeech --model ${CI_TMP_DIR}/${model_name_mmap} --scorer ${CI_TMP_DIR}/kenlm.scorer --audio ${CI_TMP_DIR}/LDC93S1_pcms16le_1_8000.wav 2>&1 1>/dev/null)\n    set -e\n    assert_correct_warning_upsampling \"${phrase_pbmodel_withlm_mono_8k}\"\n  fi;\n}\n\n# Equivalent to run_prod_inference_tests but we use assert_working* instead of assert_correct\n# ElectronJS mixes stdout and stderr and exact matching is broken\nrun_electronjs_prod_inference_tests()\n{\n  local _bitrate=$1\n\n  set +e\n  phrase_pbmodel_withlm=$(deepspeech --model ${CI_TMP_DIR}/${model_name} --scorer ${CI_TMP_DIR}/kenlm.scorer --audio ${CI_TMP_DIR}/${ldc93s1_sample_filename} 2>${CI_TMP_DIR}/stderr)\n  status=$?\n  set -e\n  assert_working_ldc93s1_prodmodel \"${phrase_pbmodel_withlm}\" \"$status\" \"${_bitrate}\"\n\n  set +e\n  phrase_pbmodel_withlm=$(deepspeech --model ${CI_TMP_DIR}/${model_name_mmap} --scorer ${CI_TMP_DIR}/kenlm.scorer --audio ${CI_TMP_DIR}/${ldc93s1_sample_filename} 2>${CI_TMP_DIR}/stderr)\n  status=$?\n  set -e\n  assert_working_ldc93s1_prodmodel \"${phrase_pbmodel_withlm}\" \"$status\" \"${_bitrate}\"\n\n  set +e\n  phrase_pbmodel_withlm_stereo_44k=$(deepspeech --model ${CI_TMP_DIR}/${model_name_mmap} --scorer ${CI_TMP_DIR}/kenlm.scorer --audio ${CI_TMP_DIR}/LDC93S1_pcms16le_2_44100.wav 2>${CI_TMP_DIR}/stderr)\n  status=$?\n  set -e\n  assert_working_ldc93s1_prodmodel_stereo_44k \"${phrase_pbmodel_withlm_stereo_44k}\" \"$status\"\n}\n\nrun_prodtflite_inference_tests()\n{\n  local _bitrate=$1\n\n  set +e\n  phrase_pbmodel_withlm=$(deepspeech --model ${CI_TMP_DIR}/${model_name} --scorer ${CI_TMP_DIR}/kenlm.scorer --audio ${CI_TMP_DIR}/${ldc93s1_sample_filename} 2>${CI_TMP_DIR}/stderr)\n  status=$?\n  set -e\n  assert_correct_ldc93s1_prodtflitemodel \"${phrase_pbmodel_withlm}\" \"$status\" \"${_bitrate}\"\n\n  set +e\n  phrase_pbmodel_withlm=$(deepspeech --model ${CI_TMP_DIR}/${model_name_mmap} --scorer ${CI_TMP_DIR}/kenlm.scorer --audio ${CI_TMP_DIR}/${ldc93s1_sample_filename} 2>${CI_TMP_DIR}/stderr)\n  status=$?\n  set -e\n  assert_correct_ldc93s1_prodtflitemodel \"${phrase_pbmodel_withlm}\" \"$status\" \"${_bitrate}\"\n\n  set +e\n  phrase_pbmodel_withlm_stereo_44k=$(deepspeech --model ${CI_TMP_DIR}/${model_name_mmap} --scorer ${CI_TMP_DIR}/kenlm.scorer --audio ${CI_TMP_DIR}/LDC93S1_pcms16le_2_44100.wav 2>${CI_TMP_DIR}/stderr)\n  status=$?\n  set -e\n  assert_correct_ldc93s1_prodtflitemodel_stereo_44k \"${phrase_pbmodel_withlm_stereo_44k}\" \"$status\"\n\n  # Run down-sampling warning test only when we actually perform downsampling\n  if [ \"${ldc93s1_sample_filename}\" != \"LDC93S1_pcms16le_1_8000.wav\" ]; then\n    set +e\n    phrase_pbmodel_withlm_mono_8k=$(deepspeech --model ${CI_TMP_DIR}/${model_name_mmap} --scorer ${CI_TMP_DIR}/kenlm.scorer --audio ${CI_TMP_DIR}/LDC93S1_pcms16le_1_8000.wav 2>&1 1>/dev/null)\n    set -e\n    assert_correct_warning_upsampling \"${phrase_pbmodel_withlm_mono_8k}\"\n  fi;\n}\n\n# Equivalent to run_prodtflite_inference_tests but we use assert_working* instead of assert_correct\n# ElectronJS mixes stdout and stderr and exact matching is broken\nrun_electronjs_prodtflite_inference_tests()\n{\n  local _bitrate=$1\n\n  set +e\n  phrase_pbmodel_withlm=$(deepspeech --model ${CI_TMP_DIR}/${model_name} --scorer ${CI_TMP_DIR}/kenlm.scorer --audio ${CI_TMP_DIR}/${ldc93s1_sample_filename} 2>${CI_TMP_DIR}/stderr)\n  status=$?\n  set -e\n  assert_working_ldc93s1_prodtflitemodel \"${phrase_pbmodel_withlm}\" \"$status\" \"${_bitrate}\"\n\n  set +e\n  phrase_pbmodel_withlm=$(deepspeech --model ${CI_TMP_DIR}/${model_name_mmap} --scorer ${CI_TMP_DIR}/kenlm.scorer --audio ${CI_TMP_DIR}/${ldc93s1_sample_filename} 2>${CI_TMP_DIR}/stderr)\n  status=$?\n  set -e\n  assert_working_ldc93s1_prodtflitemodel \"${phrase_pbmodel_withlm}\" \"$status\" \"${_bitrate}\"\n\n  set +e\n  phrase_pbmodel_withlm_stereo_44k=$(deepspeech --model ${CI_TMP_DIR}/${model_name_mmap} --scorer ${CI_TMP_DIR}/kenlm.scorer --audio ${CI_TMP_DIR}/LDC93S1_pcms16le_2_44100.wav 2>${CI_TMP_DIR}/stderr)\n  status=$?\n  set -e\n  assert_working_ldc93s1_prodtflitemodel_stereo_44k \"${phrase_pbmodel_withlm_stereo_44k}\" \"$status\"\n}\n\nrun_multi_inference_tests()\n{\n  set +e -o pipefail\n  multi_phrase_pbmodel_nolm=$(deepspeech --model ${CI_TMP_DIR}/${model_name} --audio ${CI_TMP_DIR}/ 2>${CI_TMP_DIR}/stderr | tr '\\n' '%')\n  status=$?\n  set -e +o pipefail\n  assert_correct_multi_ldc93s1 \"${multi_phrase_pbmodel_nolm}\" \"$status\"\n\n  set +e -o pipefail\n  multi_phrase_pbmodel_withlm=$(deepspeech --model ${CI_TMP_DIR}/${model_name} --scorer ${CI_TMP_DIR}/kenlm.scorer --audio ${CI_TMP_DIR}/ 2>${CI_TMP_DIR}/stderr | tr '\\n' '%')\n  status=$?\n  set -e +o pipefail\n  assert_correct_multi_ldc93s1 \"${multi_phrase_pbmodel_withlm}\" \"$status\"\n}\n\nrun_hotword_tests()\n{\n  DS_BINARY_FILE=${DS_BINARY_FILE:-\"deepspeech\"}\n  set +e\n  hotwords_decode=$(${DS_BINARY_PREFIX}${DS_BINARY_FILE} --model ${CI_TMP_DIR}/${model_name_mmap} --scorer ${CI_TMP_DIR}/kenlm.scorer --audio ${CI_TMP_DIR}/${ldc93s1_sample_filename} --hot_words \"foo:0.0,bar:-0.1\" 2>${CI_TMP_DIR}/stderr)\n  status=$?\n  set -e\n  assert_working_ldc93s1_lm \"${hotwords_decode}\" \"$status\"\n}\n\nrun_android_hotword_tests()\n{\n  set +e\n  hotwords_decode=$(${DS_BINARY_PREFIX}deepspeech --model ${DATA_TMP_DIR}/${model_name} --scorer ${DATA_TMP_DIR}/kenlm.scorer --audio ${DATA_TMP_DIR}/${ldc93s1_sample_filename} --hot_words \"foo:0.0,bar:-0.1\" 2>${CI_TMP_DIR}/stderr)\n  status=$?\n  set -e\n  assert_correct_ldc93s1_lm \"${hotwords_decode}\" \"$status\"\n}\n\nrun_cpp_only_inference_tests()\n{\n  set +e\n  phrase_pbmodel_withlm_intermediate_decode=$(deepspeech --model ${CI_TMP_DIR}/${model_name_mmap} --scorer ${CI_TMP_DIR}/kenlm.scorer --audio ${CI_TMP_DIR}/${ldc93s1_sample_filename} --stream 1280 2>${CI_TMP_DIR}/stderr | tail -n 1)\n  status=$?\n  set -e\n  assert_correct_ldc93s1_lm \"${phrase_pbmodel_withlm_intermediate_decode}\" \"$status\"\n}\n\nrun_js_streaming_inference_tests()\n{\n  set +e\n  phrase_pbmodel_withlm=$(deepspeech --model ${CI_TMP_DIR}/${model_name_mmap} --scorer ${CI_TMP_DIR}/kenlm.scorer --audio ${CI_TMP_DIR}/${ldc93s1_sample_filename} --stream 2>${CI_TMP_DIR}/stderr | tail -n 1)\n  status=$?\n  set -e\n  assert_correct_ldc93s1_lm \"${phrase_pbmodel_withlm}\" \"$status\"\n\n  set +e\n  phrase_pbmodel_withlm=$(deepspeech --model ${CI_TMP_DIR}/${model_name_mmap} --scorer ${CI_TMP_DIR}/kenlm.scorer --audio ${CI_TMP_DIR}/${ldc93s1_sample_filename} --stream --extended 2>${CI_TMP_DIR}/stderr | tail -n 1)\n  status=$?\n  set -e\n  assert_correct_ldc93s1_lm \"${phrase_pbmodel_withlm}\" \"$status\"\n}\n\nrun_js_streaming_prod_inference_tests()\n{\n  local _bitrate=$1\n  set +e\n  phrase_pbmodel_withlm=$(deepspeech --model ${CI_TMP_DIR}/${model_name_mmap} --scorer ${CI_TMP_DIR}/kenlm.scorer --audio ${CI_TMP_DIR}/${ldc93s1_sample_filename} --stream 2>${CI_TMP_DIR}/stderr | tail -n 1)\n  status=$?\n  set -e\n  assert_correct_ldc93s1_prodmodel \"${phrase_pbmodel_withlm}\" \"$status\" \"${_bitrate}\"\n\n  local _bitrate=$1\n  set +e\n  phrase_pbmodel_withlm=$(deepspeech --model ${CI_TMP_DIR}/${model_name_mmap} --scorer ${CI_TMP_DIR}/kenlm.scorer --audio ${CI_TMP_DIR}/${ldc93s1_sample_filename} --stream --extended 2>${CI_TMP_DIR}/stderr | tail -n 1)\n  status=$?\n  set -e\n  assert_correct_ldc93s1_prodmodel \"${phrase_pbmodel_withlm}\" \"$status\" \"${_bitrate}\"\n}\n\nrun_js_streaming_prodtflite_inference_tests()\n{\n  local _bitrate=$1\n  set +e\n  phrase_pbmodel_withlm=$(deepspeech --model ${CI_TMP_DIR}/${model_name_mmap} --scorer ${CI_TMP_DIR}/kenlm.scorer --audio ${CI_TMP_DIR}/${ldc93s1_sample_filename} --stream 2>${CI_TMP_DIR}/stderr | tail -n 1)\n  status=$?\n  set -e\n  assert_correct_ldc93s1_prodtflitemodel \"${phrase_pbmodel_withlm}\" \"$status\" \"${_bitrate}\"\n\n  local _bitrate=$1\n  set +e\n  phrase_pbmodel_withlm=$(deepspeech --model ${CI_TMP_DIR}/${model_name_mmap} --scorer ${CI_TMP_DIR}/kenlm.scorer --audio ${CI_TMP_DIR}/${ldc93s1_sample_filename} --stream --extended 2>${CI_TMP_DIR}/stderr | tail -n 1)\n  status=$?\n  set -e\n  assert_correct_ldc93s1_prodtflitemodel \"${phrase_pbmodel_withlm}\" \"$status\" \"${_bitrate}\"\n}\n"
  },
  {
    "path": "ci_scripts/build-utils.sh",
    "content": "#!/bin/bash\n\nset -xe\n\ndo_bazel_build()\n{\n  local _opt_or_dbg=${1:-\"opt\"}\n\n  cd ${DS_TFDIR}\n  eval \"export ${BAZEL_ENV_FLAGS}\"\n\n  if [ \"${_opt_or_dbg}\" = \"opt\" ]; then\n    if is_patched_bazel; then\n      find ${DS_ROOT_TASK}/tensorflow/bazel-out/ -iname \"*.ckd\" | tar -cf ${DS_ROOT_TASK}/bazel-ckd-tf.tar -T -\n    fi;\n  fi;\n\n  bazel ${BAZEL_OUTPUT_USER_ROOT} build \\\n    -s --explain bazel_monolithic.log --verbose_explanations --experimental_strict_action_env --workspace_status_command=\"bash native_client/bazel_workspace_status_cmd.sh\" --config=monolithic -c ${_opt_or_dbg} ${BAZEL_BUILD_FLAGS} ${BAZEL_TARGETS}\n\n  if [ \"${_opt_or_dbg}\" = \"opt\" ]; then\n    if is_patched_bazel; then\n      find ${DS_ROOT_TASK}/tensorflow/bazel-out/ -iname \"*.ckd\" | tar -cf ${DS_ROOT_TASK}/bazel-ckd-ds.tar -T -\n    fi;\n    verify_bazel_rebuild \"${DS_ROOT_TASK}/tensorflow/bazel_monolithic.log\"\n  fi;\n}\n\nshutdown_bazel()\n{\n  cd ${DS_TFDIR}\n  bazel ${BAZEL_OUTPUT_USER_ROOT} shutdown\n}\n\ndo_deepspeech_binary_build()\n{\n  cd ${DS_DSDIR}\n  make -C native_client/ \\\n    TARGET=${SYSTEM_TARGET} \\\n    TFDIR=${DS_TFDIR} \\\n    RASPBIAN=${SYSTEM_RASPBIAN} \\\n    EXTRA_CFLAGS=\"${EXTRA_LOCAL_CFLAGS}\" \\\n    EXTRA_LDFLAGS=\"${EXTRA_LOCAL_LDFLAGS}\" \\\n    EXTRA_LIBS=\"${EXTRA_LOCAL_LIBS}\" \\\n    deepspeech${PLATFORM_EXE_SUFFIX}\n}\n"
  },
  {
    "path": "ci_scripts/cpp-bytes-tests.sh",
    "content": "#!/bin/bash\n\nset -xe\n\nsource $(dirname \"$0\")/all-vars.sh\nsource $(dirname \"$0\")/all-utils.sh\nsource $(dirname \"$0\")/asserts.sh\n\nbitrate=$1\nset_ldc_sample_filename \"${bitrate}\"\n\ndownload_material \"${CI_TMP_DIR}/ds\"\n\nexport PATH=${CI_TMP_DIR}/ds/:$PATH\n\n# Bytes output mode with LDC93S1 takes too long to converge so we simply test\n# that loading the model won't crash\ncheck_versions\n"
  },
  {
    "path": "ci_scripts/cpp-tests-prod.sh",
    "content": "#!/bin/bash\n\nset -xe\n\nsource $(dirname \"$0\")/all-vars.sh\nsource $(dirname \"$0\")/all-utils.sh\nsource $(dirname \"$0\")/asserts.sh\n\nbitrate=$1\nset_ldc_sample_filename \"${bitrate}\"\n\nmodel_source=${DEEPSPEECH_PROD_MODEL}\nmodel_name=$(basename \"${model_source}\")\n\nmodel_source_mmap=${DEEPSPEECH_PROD_MODEL_MMAP}\nmodel_name_mmap=$(basename \"${model_source_mmap}\")\n\ndownload_model_prod\n\ndownload_material\n\nexport PATH=${CI_TMP_DIR}/ds/:$PATH\n\ncheck_versions\n\nrun_prod_inference_tests \"${bitrate}\"\n"
  },
  {
    "path": "ci_scripts/cpp-tests.sh",
    "content": "#!/bin/bash\n\nset -xe\n\nsource $(dirname \"$0\")/all-vars.sh\nsource $(dirname \"$0\")/all-utils.sh\nsource $(dirname \"$0\")/asserts.sh\n\nbitrate=$1\nset_ldc_sample_filename \"${bitrate}\"\n\ndownload_data\n\nexport PATH=${CI_TMP_DIR}/ds/:$PATH\n\ncheck_versions\n\nrun_all_inference_tests\n\nrun_multi_inference_tests\n\nrun_cpp_only_inference_tests\n\nrun_hotword_tests\n"
  },
  {
    "path": "ci_scripts/cpp_tflite-tests-prod.sh",
    "content": "#!/bin/bash\n\nset -xe\n\nsource $(dirname \"$0\")/all-vars.sh\nsource $(dirname \"$0\")/all-utils.sh\nsource $(dirname \"$0\")/asserts.sh\n\nbitrate=$1\nset_ldc_sample_filename \"${bitrate}\"\n\nmodel_source=${DEEPSPEECH_PROD_MODEL//.pb/.tflite}\nmodel_name=$(basename \"${model_source}\")\nmodel_name_mmap=$(basename \"${model_source}\")\nmodel_source_mmap=${DEEPSPEECH_PROD_MODEL_MMAP//.pbmm/.tflite}\nexport DATA_TMP_DIR=${CI_TMP_DIR}\n\ndownload_model_prod\n\ndownload_material \"${CI_TMP_DIR}/ds\"\n\nexport PATH=${CI_TMP_DIR}/ds/:$PATH\n\ncheck_versions\n\nrun_prodtflite_inference_tests \"${bitrate}\"\n"
  },
  {
    "path": "ci_scripts/cpp_tflite-tests.sh",
    "content": "#!/bin/bash\n\nset -xe\n\nsource $(dirname \"$0\")/all-vars.sh\nsource $(dirname \"$0\")/all-utils.sh\nsource $(dirname \"$0\")/asserts.sh\n\nbitrate=$1\nset_ldc_sample_filename \"${bitrate}\"\n\nmodel_source=${DEEPSPEECH_TEST_MODEL//.pb/.tflite}\nmodel_name=$(basename \"${model_source}\")\nmodel_name_mmap=$(basename \"${model_source}\")\nexport DATA_TMP_DIR=${CI_TMP_DIR}\n\ndownload_material \"${CI_TMP_DIR}/ds\"\n\nexport PATH=${CI_TMP_DIR}/ds/:$PATH\n\ncheck_versions\n\nrun_all_inference_tests\n\nrun_multi_inference_tests\n\nrun_cpp_only_inference_tests\n\nrun_hotword_tests\n"
  },
  {
    "path": "ci_scripts/cpp_tflite_basic-tests.sh",
    "content": "#!/bin/bash\n\nset -xe\n\nsource $(dirname \"$0\")/all-vars.sh\nsource $(dirname \"$0\")/all-utils.sh\nsource $(dirname \"$0\")/asserts.sh\n\nbitrate=$1\nset_ldc_sample_filename \"${bitrate}\"\n\nmodel_source=${DEEPSPEECH_TEST_MODEL//.pb/.tflite}\nmodel_name=$(basename \"${model_source}\")\nexport DATA_TMP_DIR=${CI_TMP_DIR}\n\ndownload_material \"${CI_TMP_DIR}/ds\"\n\nexport PATH=${CI_TMP_DIR}/ds/:$PATH\n\ncheck_versions\n\nrun_tflite_basic_inference_tests\n"
  },
  {
    "path": "ci_scripts/cppwin-tests.sh",
    "content": "#!/bin/bash\n\nset -xe\n\nsource $(dirname \"$0\")/all-vars.sh\nsource $(dirname \"$0\")/all-utils.sh\nsource $(dirname \"$0\")/asserts.sh\n\nbitrate=$1\nset_ldc_sample_filename \"${bitrate}\"\n\ndownload_material \"${CI_TMP_DIR}/ds\"\n\nexport PATH=${CI_TMP_DIR}/ds/:$PATH\n\ncheck_versions\n\nensure_cuda_usage \"$2\"\n\nrun_basic_inference_tests\n"
  },
  {
    "path": "ci_scripts/cppwin_tflite-tests.sh",
    "content": "#!/bin/bash\n\nset -xe\n\nsource $(dirname \"$0\")/all-vars.sh\nsource $(dirname \"$0\")/all-utils.sh\nsource $(dirname \"$0\")/asserts.sh\n\nbitrate=$1\nset_ldc_sample_filename \"${bitrate}\"\n\nmodel_source=${DEEPSPEECH_TEST_MODEL//.pb/.tflite}\nmodel_name=$(basename \"${model_source}\")\nmodel_name_mmap=$(basename \"${model_source}\")\nexport DATA_TMP_DIR=${CI_TMP_DIR}\n\ndownload_material \"${CI_TMP_DIR}/ds\"\n\nexport PATH=${CI_TMP_DIR}/ds/:$PATH\n\ncheck_versions\n\nrun_basic_inference_tests\n"
  },
  {
    "path": "ci_scripts/docs-requirements.txt",
    "content": "breathe==4.14.2\nsemver==2.8.1\nsphinx==2.4.4\n#FIXME: switch back to upstream sphinx-js when https://github.com/mozilla/sphinx-js/pull/135 is merged or the issue is fixed otherwise\ngit+git://github.com/reuben/sphinx-js.git@a24775935443d21028ee4a7025a407c78030c4e7#egg=sphinx-js\nsphinx-rtd-theme==0.4.3\npygments==2.7.4\n"
  },
  {
    "path": "ci_scripts/electronjs-tests-prod.sh",
    "content": "#!/bin/bash\n\nset -xe\n\nsource $(dirname \"$0\")/all-vars.sh\nsource $(dirname \"$0\")/all-utils.sh\nsource $(dirname \"$0\")/asserts.sh\n\nbitrate=$1\nset_ldc_sample_filename \"${bitrate}\"\n\nmodel_source=${DEEPSPEECH_PROD_MODEL}\nmodel_name=$(basename \"${model_source}\")\nmodel_source_mmap=${DEEPSPEECH_PROD_MODEL_MMAP}\nmodel_name_mmap=$(basename \"${model_source_mmap}\")\n\ndownload_model_prod\n\ndownload_data\n\nnode --version\nnpm --version\n\nsymlink_electron\n\nexport_node_bin_path\n\nwhich electron\nwhich node\n\nif [ \"${OS}\" = \"Linux\" ]; then\n  export DISPLAY=':99.0'\n  sudo Xvfb :99 -screen 0 1024x768x24 > /dev/null 2>&1 &\n  xvfb_process=$!\nfi\n\nnode --version\n\ndeepspeech --version\n\ncheck_runtime_electronjs\n\nrun_electronjs_prod_inference_tests \"${bitrate}\"\n\nif [ \"${OS}\" = \"Linux\" ]; then\n  sleep 1\n  sudo kill -9 ${xvfb_process} || true\nfi\n"
  },
  {
    "path": "ci_scripts/electronjs-tests.sh",
    "content": "#!/bin/bash\n\nset -xe\n\nsource $(dirname \"$0\")/all-vars.sh\nsource $(dirname \"$0\")/all-utils.sh\nsource $(dirname \"$0\")/asserts.sh\n\nbitrate=$1\nset_ldc_sample_filename \"${bitrate}\"\n\ndownload_data\n\nnode --version\nnpm --version\n\nsymlink_electron\n\nexport_node_bin_path\n\nwhich electron\nwhich node\n\nif [ \"${OS}\" = \"Linux\" ]; then\n  export DISPLAY=':99.0'\n  sudo Xvfb :99 -screen 0 1024x768x24 > /dev/null 2>&1 &\n  xvfb_process=$!\nfi\n\nnode --version\n\ndeepspeech --version\n\ncheck_runtime_electronjs\n\nrun_electronjs_inference_tests\n\nif [ \"${OS}\" = \"Linux\" ]; then\n  sleep 1\n  sudo kill -9 ${xvfb_process} || true\nfi\n"
  },
  {
    "path": "ci_scripts/electronjs_tflite-tests-prod.sh",
    "content": "#!/bin/bash\n\nset -xe\n\nsource $(dirname \"$0\")/all-vars.sh\nsource $(dirname \"$0\")/all-utils.sh\nsource $(dirname \"$0\")/asserts.sh\n\nbitrate=$1\nset_ldc_sample_filename \"${bitrate}\"\n\nmodel_source=${DEEPSPEECH_PROD_MODEL//.pb/.tflite}\nmodel_name=$(basename \"${model_source}\")\nmodel_source_mmap=${DEEPSPEECH_PROD_MODEL_MMAP//.pbmm/.tflite}\nmodel_name_mmap=$(basename \"${model_source}\")\n\ndownload_model_prod\n\ndownload_data\n\nnode --version\nnpm --version\n\nsymlink_electron\n\nexport_node_bin_path\n\nwhich electron\nwhich node\n\nif [ \"${OS}\" = \"Linux\" ]; then\n  export DISPLAY=':99.0'\n  sudo Xvfb :99 -screen 0 1024x768x24 > /dev/null 2>&1 &\n  xvfb_process=$!\nfi\n\nnode --version\n\ndeepspeech --version\n\ncheck_runtime_electronjs\n\nrun_electronjs_prodtflite_inference_tests \"${bitrate}\"\n\nif [ \"${OS}\" = \"Linux\" ]; then\n  sleep 1\n  sudo kill -9 ${xvfb_process} || true\nfi\n"
  },
  {
    "path": "ci_scripts/electronjs_tflite-tests.sh",
    "content": "#!/bin/bash\n\nset -xe\n\nsource $(dirname \"$0\")/all-vars.sh\nsource $(dirname \"$0\")/all-utils.sh\nsource $(dirname \"$0\")/asserts.sh\n\nbitrate=$1\nset_ldc_sample_filename \"${bitrate}\"\n\nmodel_source=${DEEPSPEECH_TEST_MODEL//.pb/.tflite}\nmodel_name=$(basename \"${model_source}\")\nmodel_name_mmap=$(basename \"${model_source}\")\n\ndownload_data\n\nnode --version\nnpm --version\n\nsymlink_electron\n\nexport_node_bin_path\n\nwhich electron\nwhich node\n\nif [ \"${OS}\" = \"Linux\" ]; then\n  export DISPLAY=':99.0'\n  sudo Xvfb :99 -screen 0 1024x768x24 > /dev/null 2>&1 &\n  xvfb_process=$!\nfi\n\nnode --version\n\ndeepspeech --version\n\ncheck_runtime_electronjs\n\nrun_electronjs_inference_tests\n\nif [ \"${OS}\" = \"Linux\" ]; then\n  sleep 1\n  sudo kill -9 ${xvfb_process} || true\nfi\n"
  },
  {
    "path": "ci_scripts/host-build.sh",
    "content": "#!/bin/bash\n\nset -xe\n\nruntime=$1\n\nsource $(dirname \"$0\")/all-vars.sh\nsource $(dirname \"$0\")/all-utils.sh\nsource $(dirname \"$0\")/build-utils.sh\n\nsource $(dirname \"$0\")/tf-vars.sh\n\nBAZEL_TARGETS=\"\n//native_client:libdeepspeech.so\n//native_client:generate_scorer_package\n\"\n\nif [ \"${runtime}\" = \"tflite\" ]; then\n  BAZEL_BUILD_TFLITE=\"--define=runtime=tflite\"\nfi;\nBAZEL_BUILD_FLAGS=\"${BAZEL_BUILD_TFLITE} ${BAZEL_OPT_FLAGS} ${BAZEL_EXTRA_FLAGS}\"\n\nBAZEL_ENV_FLAGS=\"TF_NEED_CUDA=0\"\nSYSTEM_TARGET=host\n\ndo_bazel_build\n\ndo_deepspeech_binary_build\n"
  },
  {
    "path": "ci_scripts/node-tests-prod.sh",
    "content": "#!/bin/bash\n\nset -xe\n\nsource $(dirname \"$0\")/all-vars.sh\nsource $(dirname \"$0\")/all-utils.sh\nsource $(dirname \"$0\")/asserts.sh\n\nbitrate=$1\nset_ldc_sample_filename \"${bitrate}\"\n\nmodel_source=${DEEPSPEECH_PROD_MODEL}\nmodel_name=$(basename \"${model_source}\")\nmodel_source_mmap=${DEEPSPEECH_PROD_MODEL_MMAP}\nmodel_name_mmap=$(basename \"${model_source_mmap}\")\n\ndownload_model_prod\n\ndownload_data\n\nnode --version\nnpm --version\n\nexport_node_bin_path\n\ncheck_runtime_nodejs\n\nrun_prod_inference_tests \"${bitrate}\"\n\nrun_js_streaming_prod_inference_tests \"${bitrate}\"\n"
  },
  {
    "path": "ci_scripts/node-tests.sh",
    "content": "#!/bin/bash\n\nset -xe\n\nsource $(dirname \"$0\")/all-vars.sh\nsource $(dirname \"$0\")/all-utils.sh\nsource $(dirname \"$0\")/asserts.sh\n\nbitrate=$1\nset_ldc_sample_filename \"${bitrate}\"\n\ndownload_data\n\nnode --version\nnpm --version\n\nexport_node_bin_path\n\ncheck_runtime_nodejs\n\nrun_all_inference_tests\n\nrun_js_streaming_inference_tests\n\nrun_hotword_tests\n"
  },
  {
    "path": "ci_scripts/node_tflite-tests-prod.sh",
    "content": "#!/bin/bash\n\nset -xe\n\nsource $(dirname \"$0\")/all-vars.sh\nsource $(dirname \"$0\")/all-utils.sh\nsource $(dirname \"$0\")/asserts.sh\n\nbitrate=$1\nset_ldc_sample_filename \"${bitrate}\"\n\nmodel_source=${DEEPSPEECH_PROD_MODEL//.pb/.tflite}\nmodel_name=$(basename \"${model_source}\")\nmodel_source_mmap=${DEEPSPEECH_PROD_MODEL_MMAP//.pbmm/.tflite}\nmodel_name_mmap=$(basename \"${model_source}\")\n\ndownload_model_prod\n\ndownload_data\n\nnode --version\nnpm --version\n\nexport_node_bin_path\n\ncheck_runtime_nodejs\n\nrun_prodtflite_inference_tests \"${bitrate}\"\n\nrun_js_streaming_prodtflite_inference_tests \"${bitrate}\"\n"
  },
  {
    "path": "ci_scripts/node_tflite-tests.sh",
    "content": "#!/bin/bash\n\nset -xe\n\nsource $(dirname \"$0\")/all-vars.sh\nsource $(dirname \"$0\")/all-utils.sh\nsource $(dirname \"$0\")/asserts.sh\n\nbitrate=$1\nset_ldc_sample_filename \"${bitrate}\"\n\nmodel_source=${DEEPSPEECH_TEST_MODEL//.pb/.tflite}\nmodel_name=$(basename \"${model_source}\")\nmodel_name_mmap=$(basename \"${model_source}\")\n\ndownload_data\n\nnode --version\nnpm --version\n\nexport_node_bin_path\n\ncheck_runtime_nodejs\n\nrun_all_inference_tests\n\nrun_js_streaming_inference_tests\n\nrun_hotword_tests\n"
  },
  {
    "path": "ci_scripts/package-utils.sh",
    "content": "#!/bin/bash\n\nset -xe\n\npackage_native_client()\n{\n  tensorflow_dir=${DS_TFDIR}\n  deepspeech_dir=${DS_DSDIR}\n  artifacts_dir=${CI_ARTIFACTS_DIR}\n  artifact_name=$1\n\n  if [ ! -d ${tensorflow_dir} -o ! -d ${deepspeech_dir} -o ! -d ${artifacts_dir} ]; then\n    echo \"Missing directory. Please check:\"\n    echo \"tensorflow_dir=${tensorflow_dir}\"\n    echo \"deepspeech_dir=${deepspeech_dir}\"\n    echo \"artifacts_dir=${artifacts_dir}\"\n    exit 1\n  fi;\n\n  if [ -z \"${artifact_name}\" ]; then\n    echo \"Please specify artifact name.\"\n  fi;\n\n  win_lib=\"\"\n  if [ -f \"${tensorflow_dir}/bazel-bin/native_client/libdeepspeech.so.if.lib\" ]; then\n    win_lib=\"-C ${tensorflow_dir}/bazel-bin/native_client/ libdeepspeech.so.if.lib\"\n  fi;\n\n  ${TAR} --verbose -cf - \\\n    -C ${tensorflow_dir}/bazel-bin/native_client/ libdeepspeech.so \\\n    ${win_lib} \\\n    -C ${tensorflow_dir}/bazel-bin/native_client/ generate_scorer_package \\\n    -C ${deepspeech_dir}/ LICENSE \\\n    -C ${deepspeech_dir}/native_client/ deepspeech${PLATFORM_EXE_SUFFIX} \\\n    -C ${deepspeech_dir}/native_client/ deepspeech.h \\\n    -C ${deepspeech_dir}/native_client/kenlm/ README.mozilla \\\n    | ${XZ} > \"${artifacts_dir}/${artifact_name}\"\n}\n\npackage_native_client_ndk()\n{\n  deepspeech_dir=${DS_DSDIR}\n  tensorflow_dir=${DS_TFDIR}\n  artifacts_dir=${CI_ARTIFACTS_DIR}\n  artifact_name=$1\n  arch_abi=$2\n\n  if [ ! -d ${deepspeech_dir} -o ! -d ${artifacts_dir} ]; then\n    echo \"Missing directory. Please check:\"\n    echo \"deepspeech_dir=${deepspeech_dir}\"\n    echo \"artifacts_dir=${artifacts_dir}\"\n    exit 1\n  fi;\n\n  if [ -z \"${artifact_name}\" ]; then\n    echo \"Please specify artifact name.\"\n  fi;\n\n  if [ -z \"${arch_abi}\" ]; then\n    echo \"Please specify arch abi.\"\n  fi;\n\n  ${TAR} --verbose -cf - \\\n    -C ${deepspeech_dir}/native_client/libs/${arch_abi}/ deepspeech \\\n    -C ${deepspeech_dir}/native_client/libs/${arch_abi}/ libdeepspeech.so \\\n    -C ${tensorflow_dir}/bazel-bin/native_client/ generate_scorer_package \\\n    -C ${deepspeech_dir}/native_client/libs/${arch_abi}/ libc++_shared.so \\\n    -C ${deepspeech_dir}/native_client/ deepspeech.h \\\n    -C ${deepspeech_dir}/ LICENSE \\\n    -C ${deepspeech_dir}/native_client/kenlm/ README.mozilla \\\n    | ${XZ} > \"${artifacts_dir}/${artifact_name}\"\n}\n\npackage_libdeepspeech_as_zip()\n{\n  tensorflow_dir=${DS_TFDIR}\n  artifacts_dir=${CI_ARTIFACTS_DIR}\n  artifact_name=$1\n\n  if [ ! -d ${tensorflow_dir} -o ! -d ${artifacts_dir} ]; then\n    echo \"Missing directory. Please check:\"\n    echo \"tensorflow_dir=${tensorflow_dir}\"\n    echo \"artifacts_dir=${artifacts_dir}\"\n    exit 1\n  fi;\n\n  if [ -z \"${artifact_name}\" ]; then\n    echo \"Please specify artifact name.\"\n  fi;\n\n  ${ZIP} -r9 --junk-paths \"${artifacts_dir}/${artifact_name}\" ${tensorflow_dir}/bazel-bin/native_client/libdeepspeech.so\n}\n"
  },
  {
    "path": "ci_scripts/package.sh",
    "content": "#!/bin/bash\n\nset -xe\n\nsource $(dirname \"$0\")/all-vars.sh\nsource $(dirname \"$0\")/package-utils.sh\n\nmkdir -p ${CI_ARTIFACTS_DIR} || true\n\ncp ${DS_DSDIR}/tensorflow/bazel*.log ${CI_ARTIFACTS_DIR}/\n\npackage_native_client \"native_client.tar.xz\"\n\npackage_libdeepspeech_as_zip \"libdeepspeech.zip\"\n\nif [ -d ${DS_DSDIR}/wheels ]; then\n    cp ${DS_DSDIR}/wheels/* ${CI_ARTIFACTS_DIR}/\n    cp ${DS_DSDIR}/native_client/javascript/deepspeech-*.tgz ${CI_ARTIFACTS_DIR}/\nfi;\n\nif [ -f ${DS_DSDIR}/native_client/javascript/wrapper.tar.gz ]; then\n    cp ${DS_DSDIR}/native_client/javascript/wrapper.tar.gz ${CI_ARTIFACTS_DIR}/\nfi;\n"
  },
  {
    "path": "ci_scripts/python-tests-prod.sh",
    "content": "#!/bin/bash\n\nset -xe\n\nsource $(dirname \"$0\")/all-vars.sh\nsource $(dirname \"$0\")/all-utils.sh\nsource $(dirname \"$0\")/asserts.sh\n\nbitrate=$1\nset_ldc_sample_filename \"${bitrate}\"\n\nmodel_source=${DEEPSPEECH_PROD_MODEL}\nmodel_name=$(basename \"${model_source}\")\n\nmodel_source_mmap=${DEEPSPEECH_PROD_MODEL_MMAP}\nmodel_name_mmap=$(basename \"${model_source_mmap}\")\n\ndownload_model_prod\n\ndownload_material\n\nexport_py_bin_path\n\ndeepspeech --version\n\nrun_prod_inference_tests \"${bitrate}\"\n\nrun_prod_concurrent_stream_tests \"${bitrate}\"\n"
  },
  {
    "path": "ci_scripts/python-tests.sh",
    "content": "#!/bin/bash\n\nset -xe\n\nsource $(dirname \"$0\")/all-vars.sh\nsource $(dirname \"$0\")/all-utils.sh\nsource $(dirname \"$0\")/asserts.sh\n\nbitrate=$1\nset_ldc_sample_filename \"${bitrate}\"\n\ndownload_data\n\nexport_py_bin_path\n\ndeepspeech --version\n\nrun_all_inference_tests\n\nrun_hotword_tests\n"
  },
  {
    "path": "ci_scripts/python_tflite-tests-prod.sh",
    "content": "#!/bin/bash\n\nset -xe\n\nsource $(dirname \"$0\")/all-vars.sh\nsource $(dirname \"$0\")/all-utils.sh\nsource $(dirname \"$0\")/asserts.sh\n\nbitrate=$1\nset_ldc_sample_filename \"${bitrate}\"\n\nmodel_source=${DEEPSPEECH_PROD_MODEL//.pb/.tflite}\nmodel_name=$(basename \"${model_source}\")\nmodel_name_mmap=$(basename \"${model_source}\")\nmodel_source_mmap=${DEEPSPEECH_PROD_MODEL_MMAP//.pbmm/.tflite}\n\ndownload_model_prod\n\ndownload_material\n\nexport_py_bin_path\n\ndeepspeech --version\n\nrun_prodtflite_inference_tests \"${bitrate}\"\n"
  },
  {
    "path": "ci_scripts/python_tflite-tests.sh",
    "content": "#!/bin/bash\n\nset -xe\n\nsource $(dirname \"$0\")/all-vars.sh\nsource $(dirname \"$0\")/all-utils.sh\nsource $(dirname \"$0\")/asserts.sh\n\nbitrate=$1\nset_ldc_sample_filename \"${bitrate}\"\n\nmodel_source=${DEEPSPEECH_TEST_MODEL//.pb/.tflite}\nmodel_name=$(basename \"${model_source}\")\nmodel_name_mmap=$(basename \"${model_source}\")\n\ndownload_data\n\nexport_py_bin_path\n\ndeepspeech --version\n\nrun_all_inference_tests\n\nrun_hotword_tests\n"
  },
  {
    "path": "ci_scripts/tf-build.sh",
    "content": "#!/bin/bash\n\nset -ex\nset -o pipefail\n\nsource $(dirname $0)/tf-vars.sh\n\npushd ${DS_ROOT_TASK}/tensorflow/\n    BAZEL_BUILD=\"bazel ${BAZEL_OUTPUT_USER_ROOT} build -s --explain bazel_monolithic_tf.log --verbose_explanations --experimental_strict_action_env --config=monolithic\"\n\n    # Start a bazel process to ensure reliability on Windows and avoid:\n    # FATAL: corrupt installation: file 'c:\\builds\\tc-workdir\\.bazel_cache/install/6b1660721930e9d5f231f7d2a626209b/_embedded_binaries/build-runfiles.exe' missing.\n    bazel ${BAZEL_OUTPUT_USER_ROOT} info\n\n    # Force toolchain sync (useful on macOS ?)\n    bazel ${BAZEL_OUTPUT_USER_ROOT} sync --configure\n\n    MAYBE_DEBUG=$2\n    OPT_OR_DBG=\"-c opt\"\n    if [ \"${MAYBE_DEBUG}\" = \"dbg\" ]; then\n\tOPT_OR_DBG=\"-c dbg\"\n    fi;\n\n    case \"$1\" in\n    \"--windows-cpu\")\n        echo \"\" | TF_NEED_CUDA=0 ./configure && ${BAZEL_BUILD} ${OPT_OR_DBG} ${BAZEL_OPT_FLAGS} ${BAZEL_EXTRA_FLAGS} ${BUILD_TARGET_LIBDEEPSPEECH} ${BUILD_TARGET_LITE_LIB} --workspace_status_command=\"bash native_client/bazel_workspace_status_cmd.sh\"\n        ;;\n    \"--linux-cpu\"|\"--darwin-cpu\")\n        echo \"\" | TF_NEED_CUDA=0 ./configure && ${BAZEL_BUILD} ${OPT_OR_DBG} ${BAZEL_OPT_FLAGS} ${BAZEL_EXTRA_FLAGS} ${BUILD_TARGET_LIB_CPP_API} ${BUILD_TARGET_LITE_LIB}\n        ;;\n    \"--linux-cuda\"|\"--windows-cuda\")\n        eval \"export ${TF_CUDA_FLAGS}\" && (echo \"\" | TF_NEED_CUDA=1 ./configure) && ${BAZEL_BUILD} ${OPT_OR_DBG} ${BAZEL_CUDA_FLAGS} ${BAZEL_EXTRA_FLAGS} ${BAZEL_OPT_FLAGS} ${BUILD_TARGET_LIB_CPP_API}\n        ;;\n    \"--linux-armv7\")\n        echo \"\" | TF_NEED_CUDA=0 ./configure && ${BAZEL_BUILD} ${OPT_OR_DBG} ${BAZEL_ARM_FLAGS} ${BAZEL_EXTRA_FLAGS} ${BUILD_TARGET_LITE_LIB}\n        ;;\n    \"--linux-aarch64\")\n        echo \"\" | TF_NEED_CUDA=0 ./configure && ${BAZEL_BUILD} ${OPT_OR_DBG} ${BAZEL_ARM64_FLAGS} ${BAZEL_EXTRA_FLAGS} ${BUILD_TARGET_LITE_LIB}\n        ;;\n    \"--android-armv7\")\n        echo \"\" | TF_SET_ANDROID_WORKSPACE=1 ./configure && ${BAZEL_BUILD} ${OPT_OR_DBG} ${BAZEL_ANDROID_ARM_FLAGS} ${BAZEL_EXTRA_FLAGS} ${BUILD_TARGET_LITE_LIB}\n        ;;\n    \"--android-arm64\")\n        echo \"\" | TF_SET_ANDROID_WORKSPACE=1 ./configure && ${BAZEL_BUILD} ${OPT_OR_DBG} ${BAZEL_ANDROID_ARM64_FLAGS} ${BAZEL_EXTRA_FLAGS} ${BUILD_TARGET_LITE_LIB}\n        ;;\n    \"--ios-arm64\")\n        echo \"\" | TF_NEED_CUDA=0 TF_CONFIGURE_IOS=1 ./configure && ${BAZEL_BUILD} ${OPT_OR_DBG} ${BAZEL_IOS_ARM64_FLAGS} ${BUILD_TARGET_LITE_LIB}\n        ;;\n    \"--ios-x86_64\")\n        echo \"\" | TF_NEED_CUDA=0 TF_CONFIGURE_IOS=1 ./configure && ${BAZEL_BUILD} ${OPT_OR_DBG} ${BAZEL_IOS_X86_64_FLAGS} ${BUILD_TARGET_LITE_LIB}\n        ;;\n    esac\n\n    bazel ${BAZEL_OUTPUT_USER_ROOT} shutdown\npopd\n"
  },
  {
    "path": "ci_scripts/tf-package.sh",
    "content": "#!/bin/bash\n\nset -xe\n\nsource $(dirname $0)/tf-vars.sh\n\nmkdir -p ${CI_ARTIFACTS_DIR} || true\n\ncp ${DS_ROOT_TASK}/tensorflow/bazel_*.log ${CI_ARTIFACTS_DIR} || true\n\nOUTPUT_ROOT=\"${DS_ROOT_TASK}/tensorflow/bazel-bin\"\n\nfor output_bin in                                                            \\\n    tensorflow/lite/experimental/c/libtensorflowlite_c.so                    \\\n    tensorflow/tools/graph_transforms/transform_graph                        \\\n    tensorflow/tools/graph_transforms/summarize_graph                        \\\n    tensorflow/tools/benchmark/benchmark_model                               \\\n    tensorflow/contrib/util/convert_graphdef_memmapped_format                \\\n    tensorflow/lite/toco/toco;\ndo\n    if [ -f \"${OUTPUT_ROOT}/${output_bin}\" ]; then\n        cp ${OUTPUT_ROOT}/${output_bin} ${CI_ARTIFACTS_DIR}/\n    fi;\ndone;\n\nif [ -f \"${OUTPUT_ROOT}/tensorflow/lite/tools/benchmark/benchmark_model\" ]; then\n    cp ${OUTPUT_ROOT}/tensorflow/lite/tools/benchmark/benchmark_model ${CI_ARTIFACTS_DIR}/lite_benchmark_model\nfi\n\n# It seems that bsdtar and gnutar are behaving a bit differently on the way\n# they deal with --exclude=\"./public/*\" ; this caused ./DeepSpeech/tensorflow/core/public/\n# to be ditched when we just wanted to get rid of ./public/ on OSX.\n# Switching to gnutar (already needed for the --transform on DeepSpeech tasks)\n# does the trick.\nTAR_EXCLUDE=\"--exclude=./dls/*\"\nif [ \"${OS}\" = \"Darwin\" ]; then\n    TAR_EXCLUDE=\"--exclude=./dls/* --exclude=./public/* --exclude=./generic-worker/* --exclude=./homebrew/* --exclude=./homebrew.cache/* --exclude=./homebrew.logs/*\"\nfi;\n\n# Make a tar of\n#  - /home/build-user/ (linux\n#  - /Users/build-user/TaskCluster/HeavyTasks/X/ (OSX)\n#  - C:\\builds\\tc-workdir\\ (windows)\n\nif [ \"${OS}\" = \"${CI_MSYS_VERSION}\" ]; then\n    export PATH=$PATH:'/c/Program Files/7-Zip/'\n    pushd ${DS_ROOT_TASK}\n        7z a '-xr!.\\dls\\' '-xr!.\\tmp\\' '-xr!.\\msys64\\' -snl -snh -so home.tar . | 7z a -si ${CI_ARTIFACTS_DIR}/home.tar.xz\n    popd\nelse\n    ${TAR} -C ${DS_ROOT_TASK} ${TAR_EXCLUDE} -cf - . | ${XZ} > ${CI_ARTIFACTS_DIR}/home.tar.xz\nfi\n\nif [ \"${OS}\" = \"Linux\" ]; then\n    SHA_SUM_GEN=\"sha256sum\"\nelif [ \"${OS}\" = \"${CI_MSYS_VERSION}\" ]; then\n    SHA_SUM_GEN=\"sha256sum\"\nelif [ \"${OS}\" = \"Darwin\" ]; then\n    SHA_SUM_GEN=\"shasum -a 256\"\nfi;\n\n${SHA_SUM_GEN} ${CI_ARTIFACTS_DIR}/* > ${CI_ARTIFACTS_DIR}/checksums.txt\n"
  },
  {
    "path": "ci_scripts/tf-setup.sh",
    "content": "#!/bin/bash\n\nset -ex\n\nsource $(dirname $0)/tf-vars.sh\n\ninstall_android=\ninstall_cuda=\ncase \"$1\" in\n    \"--linux-cuda\"|\"--windows-cuda\")\n    install_cuda=yes\n    ;;\n\n    \"--android-armv7\"|\"--android-arm64\")\n    install_android=yes\n    ;;\nesac\n\n# $1 url\n# $2 sha256\ndownload()\n{\n    fname=`basename $1`\n\n    ${WGET} $1 -O ${DS_ROOT_TASK}/dls/$fname && echo \"$2  ${DS_ROOT_TASK}/dls/$fname\" | ${SHA_SUM} -\n}\n\n# Download stuff\nmkdir -p ${DS_ROOT_TASK}/dls || true\ndownload $BAZEL_URL $BAZEL_SHA256\n\nif [ ! -z \"${install_cuda}\" ]; then\n    download $CUDA_URL $CUDA_SHA256\n    download $CUDNN_URL $CUDNN_SHA256\nfi;\n\nif [ ! -z \"${install_android}\" ]; then\n    download $ANDROID_NDK_URL $ANDROID_NDK_SHA256\n    download $ANDROID_SDK_URL $ANDROID_SDK_SHA256\nfi;\n\n# For debug\nls -hal ${DS_ROOT_TASK}/dls/\n\n# Install Bazel in ${DS_ROOT_TASK}/bin\nBAZEL_INSTALL_FILENAME=$(basename \"${BAZEL_URL}\")\nif [ \"${OS}\" = \"Linux\" ]; then\n    BAZEL_INSTALL_FLAGS=\"--user\"\nelif [ \"${OS}\" = \"Darwin\" ]; then\n    BAZEL_INSTALL_FLAGS=\"--bin=${DS_ROOT_TASK}/bin --base=${DS_ROOT_TASK}/.bazel\"\nfi;\nmkdir -p ${DS_ROOT_TASK}/bin || true\npushd ${DS_ROOT_TASK}/bin\n    if [ \"${OS}\" = \"${CI_MSYS_VERSION}\" ]; then\n        cp ${DS_ROOT_TASK}/dls/${BAZEL_INSTALL_FILENAME} ${DS_ROOT_TASK}/bin/bazel.exe\n    else\n        /bin/bash ${DS_ROOT_TASK}/dls/${BAZEL_INSTALL_FILENAME} ${BAZEL_INSTALL_FLAGS}\n    fi\npopd\n\n# For debug\nbazel version\n\nbazel shutdown\n\nif [ ! -z \"${install_cuda}\" ]; then\n    # Install CUDA and CuDNN\n    mkdir -p ${DS_ROOT_TASK}/DeepSpeech/CUDA/ || true\n    pushd ${DS_ROOT_TASK}\n        CUDA_FILE=`basename ${CUDA_URL}`\n        PERL5LIB=. sh ${DS_ROOT_TASK}/dls/${CUDA_FILE} --silent --override --toolkit --toolkitpath=${DS_ROOT_TASK}/DeepSpeech/CUDA/ --defaultroot=${DS_ROOT_TASK}/DeepSpeech/CUDA/\n\n        CUDNN_FILE=`basename ${CUDNN_URL}`\n        tar xvf ${DS_ROOT_TASK}/dls/${CUDNN_FILE} --strip-components=1 -C ${DS_ROOT_TASK}/DeepSpeech/CUDA/\n    popd\n\n    LD_LIBRARY_PATH=${DS_ROOT_TASK}/DeepSpeech/CUDA/lib64/:${DS_ROOT_TASK}/DeepSpeech/CUDA/lib64/stubs/:$LD_LIBRARY_PATH\n    export LD_LIBRARY_PATH\n\n    # We might lack libcuda.so.1 symlink, let's fix as upstream does:\n    # https://github.com/tensorflow/tensorflow/pull/13811/files?diff=split#diff-2352449eb75e66016e97a591d3f0f43dR96\n    if [ ! -h \"${DS_ROOT_TASK}/DeepSpeech/CUDA/lib64/stubs/libcuda.so.1\" ]; then\n        ln -s \"${DS_ROOT_TASK}/DeepSpeech/CUDA/lib64/stubs/libcuda.so\" \"${DS_ROOT_TASK}/DeepSpeech/CUDA/lib64/stubs/libcuda.so.1\"\n    fi;\n\nelse\n    echo \"No CUDA/CuDNN to install\"\nfi\n\nif [ ! -z \"${install_android}\" ]; then\n    mkdir -p ${DS_ROOT_TASK}/DeepSpeech/Android/SDK || true\n    ANDROID_NDK_FILE=`basename ${ANDROID_NDK_URL}`\n    ANDROID_SDK_FILE=`basename ${ANDROID_SDK_URL}`\n\n    pushd ${DS_ROOT_TASK}/DeepSpeech/Android\n        unzip ${DS_ROOT_TASK}/dls/${ANDROID_NDK_FILE}\n    popd\n\n    pushd ${DS_ROOT_TASK}/DeepSpeech/Android/SDK\n        unzip ${DS_ROOT_TASK}/dls/${ANDROID_SDK_FILE}\n        yes | ./tools/bin/sdkmanager --licenses\n        ./tools/bin/sdkmanager --update\n        ./tools/bin/sdkmanager --install \"platforms;android-16\" \"build-tools;28.0.3\"\n    popd\nfi\n\nmkdir -p ${CI_ARTIFACTS_DIR} || true\n\n\n# Taken from https://www.tensorflow.org/install/source\n# Only future is needed for our builds, as we don't build the Python package\npython -m pip install -U --user future==0.17.1 || true\n"
  },
  {
    "path": "ci_scripts/tf-vars.sh",
    "content": "#!/bin/bash\n\nset -ex\n\nexport OS=$(uname)\nif [ \"${OS}\" = \"Linux\" ]; then\n    export DS_ROOT_TASK=${CI_TASK_DIR}\n\n    BAZEL_URL=https://github.com/bazelbuild/bazel/releases/download/3.1.0/bazel-3.1.0-installer-linux-x86_64.sh\n    BAZEL_SHA256=7ba815cbac712d061fe728fef958651512ff394b2708e89f79586ec93d1185ed\n\n    CUDA_URL=http://developer.download.nvidia.com/compute/cuda/10.1/Prod/local_installers/cuda_10.1.243_418.87.00_linux.run\n    CUDA_SHA256=e7c22dc21278eb1b82f34a60ad7640b41ad3943d929bebda3008b72536855d31\n\n    # From https://gitlab.com/nvidia/cuda/blob/centos7/10.1/devel/cudnn7/Dockerfile\n    CUDNN_URL=http://developer.download.nvidia.com/compute/redist/cudnn/v7.6.0/cudnn-10.1-linux-x64-v7.6.0.64.tgz\n    CUDNN_SHA256=e956c6f9222fcb867a10449cfc76dee5cfd7c7531021d95fe9586d7e043b57d7\n\n    ANDROID_NDK_URL=https://dl.google.com/android/repository/android-ndk-r18b-linux-x86_64.zip\n    ANDROID_NDK_SHA256=4f61cbe4bbf6406aa5ef2ae871def78010eed6271af72de83f8bd0b07a9fd3fd\n\n    ANDROID_SDK_URL=https://dl.google.com/android/repository/sdk-tools-linux-4333796.zip\n    ANDROID_SDK_SHA256=92ffee5a1d98d856634e8b71132e8a95d96c83a63fde1099be3d86df3106def9\n\n    WGET=/usr/bin/wget\nelif [ \"${OS}\" = \"${CI_MSYS_VERSION}\" ]; then\n    if [ -z \"${CI_TASK_DIR}\" -o -z \"${CI_ARTIFACTS_DIR}\" ]; then\n        echo \"Inconsistent Windows setup: missing some vars.\"\n        echo \"CI_TASK_DIR=${CI_TASK_DIR}\"\n        echo \"CI_ARTIFACTS_DIR=${CI_ARTIFACTS_DIR}\"\n        exit 1\n    fi;\n\n    # Re-export with cygpath to make sure it is sane, otherwise it might trigger\n    # unobvious failures with cp etc.\n    export CI_TASK_DIR=\"$(cygpath ${CI_TASK_DIR})\"\n    export CI_ARTIFACTS_DIR=\"$(cygpath ${CI_ARTIFACTS_DIR})\"\n\n    export DS_ROOT_TASK=${CI_TASK_DIR}\n    export BAZEL_VC=\"C:\\Program Files (x86)\\Microsoft Visual Studio\\2019\\Enterprise\\VC\"\n    export BAZEL_VC_FULL_VERSION=\"14.28.29910\"\n    export MSYS2_ARG_CONV_EXCL='//'\n\n    mkdir -p ${CI_TASK_DIR}/tmp/\n    export TEMP=${CI_TASK_DIR}/tmp/\n    export TMP=${CI_TASK_DIR}/tmp/\n\n    BAZEL_URL=https://github.com/bazelbuild/bazel/releases/download/3.1.0/bazel-3.1.0-windows-x86_64.exe\n    BAZEL_SHA256=776db1f4986dacc3eda143932f00f7529f9ee65c7c1c004414c44aaa6419d0e9\n\n    CUDA_INSTALL_DIRECTORY=$(cygpath 'C:\\Program Files\\NVIDIA GPU Computing Toolkit\\CUDA\\v10.1')\n\n    TAR=/usr/bin/tar.exe\nelif [ \"${OS}\" = \"Darwin\" ]; then\n    if [ -z \"${CI_TASK_DIR}\" -o -z \"${CI_ARTIFACTS_DIR}\" ]; then\n        echo \"Inconsistent OSX setup: missing some vars.\"\n        echo \"CI_TASK_DIR=${CI_TASK_DIR}\"\n        echo \"CI_ARTIFACTS_DIR=${CI_ARTIFACTS_DIR}\"\n        exit 1\n    fi;\n\n    export DS_ROOT_TASK=${CI_TASK_DIR}\n\n    BAZEL_URL=https://github.com/bazelbuild/bazel/releases/download/3.1.0/bazel-3.1.0-installer-darwin-x86_64.sh\n    BAZEL_SHA256=5cfa97031b43432b3c742c80e2e01c41c0acdca7ba1052fc8cf1e291271bc9cd\n\n    SHA_SUM=\"shasum -a 256 -c\"\n    TAR=gtar\nfi;\n\nWGET=${WGET:-\"wget\"}\nTAR=${TAR:-\"tar\"}\nXZ=${XZ:-\"xz -9 -T0\"}\nZIP=${ZIP:-\"zip\"}\nUNXZ=${UNXZ:-\"xz -T0 -d\"}\nUNGZ=${UNGZ:-\"gunzip\"}\nSHA_SUM=${SHA_SUM:-\"sha256sum -c --strict\"}\n\n# /tmp/artifacts for docker-worker on linux,\n# and task subdir for generic-worker on osx\nexport CI_ARTIFACTS_DIR=${CI_ARTIFACTS_DIR:-/tmp/artifacts}\n\n### Define variables that needs to be exported to other processes\n\nPATH=${DS_ROOT_TASK}/bin:$PATH\nif [ \"${OS}\" = \"Darwin\" ]; then\n    PATH=${DS_ROOT_TASK}/homebrew/bin/:${DS_ROOT_TASK}/homebrew/opt/node@10/bin:$PATH\nfi;\nexport PATH\n\nif [ \"${OS}\" = \"Linux\" ]; then\n    export LD_LIBRARY_PATH=${DS_ROOT_TASK}/DeepSpeech/CUDA/lib64/:${DS_ROOT_TASK}/DeepSpeech/CUDA/lib64/stubs/:$LD_LIBRARY_PATH\n    export ANDROID_SDK_HOME=${DS_ROOT_TASK}/DeepSpeech/Android/SDK/\n    export ANDROID_NDK_HOME=${DS_ROOT_TASK}/DeepSpeech/Android/android-ndk-r18b/\nfi;\n\nexport TF_ENABLE_XLA=0\nif [ \"${OS}\" = \"Linux\" ]; then\n    TF_NEED_JEMALLOC=1\nelif [ \"${OS}\" = \"${CI_MSYS_VERSION}\" ]; then\n    TF_NEED_JEMALLOC=0\nelif [ \"${OS}\" = \"Darwin\" ]; then\n    TF_NEED_JEMALLOC=0\nfi;\nexport TF_NEED_JEMALLOC\nexport TF_NEED_OPENCL_SYCL=0\nexport TF_NEED_MKL=0\nexport TF_NEED_VERBS=0\nexport TF_NEED_MPI=0\nexport TF_NEED_IGNITE=0\nexport TF_NEED_GDR=0\nexport TF_NEED_NGRAPH=0\nexport TF_DOWNLOAD_CLANG=0\nexport TF_SET_ANDROID_WORKSPACE=0\nexport TF_NEED_TENSORRT=0\nexport TF_NEED_ROCM=0\n\n# This should be gcc-5, hopefully. CUDA and TensorFlow might not be happy, otherwise.\nexport GCC_HOST_COMPILER_PATH=/usr/bin/gcc\n\nif [ \"${OS}\" = \"Linux\" ]; then\n    source /etc/os-release\n    if [ \"${ID}\" = \"ubuntu\" -a \"${VERSION_ID}\" = \"20.04\" ]; then\n        export PYTHON_BIN_PATH=/usr/bin/python3\n    else\n        export PYTHON_BIN_PATH=/usr/bin/python2.7\n    fi\nfi\n\n## Below, define or export some build variables\n\n# Enable some SIMD support. Limit ourselves to what Tensorflow needs.\n# Also ensure to not require too recent CPU: AVX2/FMA introduced by:\n#  - Intel with Haswell (2013)\n#  - AMD with Excavator (2015)\n# For better compatibility, AVX ony might be better.\n#\n# Build for generic amd64 platforms, no device-specific optimization\n# See https://gcc.gnu.org/onlinedocs/gcc/x86-Options.html for targetting specific CPUs\n\nif [ \"${OS}\" = \"${CI_MSYS_VERSION}\" ]; then\n    OPT_FLAGS=\"/arch:AVX\"\nelse\n    OPT_FLAGS=\"-mtune=generic -march=x86-64 -msse -msse2 -msse3 -msse4.1 -msse4.2 -mavx\"\nfi\nBAZEL_OPT_FLAGS=\"\"\nfor flag in ${OPT_FLAGS};\ndo\n    BAZEL_OPT_FLAGS=\"${BAZEL_OPT_FLAGS} --copt=${flag}\"\ndone;\n\nBAZEL_OUTPUT_CACHE_DIR=\"${DS_ROOT_TASK}/.bazel_cache/\"\nBAZEL_OUTPUT_CACHE_INSTANCE=\"${BAZEL_OUTPUT_CACHE_DIR}/output/\"\nmkdir -p ${BAZEL_OUTPUT_CACHE_INSTANCE} || true\n\n# We need both to ensure stable path ; default value for output_base is some\n# MD5 value.\nBAZEL_OUTPUT_USER_ROOT=\"--output_user_root ${BAZEL_OUTPUT_CACHE_DIR} --output_base ${BAZEL_OUTPUT_CACHE_INSTANCE}\"\nexport BAZEL_OUTPUT_USER_ROOT\n\nNVCC_COMPUTE=\"3.5\"\n\n### Define build parameters/env variables that we will re-ues in sourcing scripts.\nif [ \"${OS}\" = \"${CI_MSYS_VERSION}\" ]; then\n    TF_CUDA_FLAGS=\"TF_CUDA_CLANG=0 TF_CUDA_VERSION=10.1 TF_CUDNN_VERSION=7.6.0 CUDNN_INSTALL_PATH=\\\"${CUDA_INSTALL_DIRECTORY}\\\" TF_CUDA_PATHS=\\\"${CUDA_INSTALL_DIRECTORY}\\\" TF_CUDA_COMPUTE_CAPABILITIES=\\\"${NVCC_COMPUTE}\\\"\"\nelse\n    TF_CUDA_FLAGS=\"TF_CUDA_CLANG=0 TF_CUDA_VERSION=10.1 TF_CUDNN_VERSION=7.6.0 CUDNN_INSTALL_PATH=\\\"${DS_ROOT_TASK}/DeepSpeech/CUDA\\\" TF_CUDA_PATHS=\\\"${DS_ROOT_TASK}/DeepSpeech/CUDA\\\" TF_CUDA_COMPUTE_CAPABILITIES=\\\"${NVCC_COMPUTE}\\\"\"\nfi\nBAZEL_ARM_FLAGS=\"--config=rpi3 --config=rpi3_opt --copt=-DTFLITE_WITH_RUY_GEMV\"\nBAZEL_ARM64_FLAGS=\"--config=rpi3-armv8 --config=rpi3-armv8_opt --copt=-DTFLITE_WITH_RUY_GEMV\"\nBAZEL_ANDROID_ARM_FLAGS=\"--config=android --config=android_arm --action_env ANDROID_NDK_API_LEVEL=21 --cxxopt=-std=c++14 --copt=-D_GLIBCXX_USE_C99 --copt=-DTFLITE_WITH_RUY_GEMV\"\nBAZEL_ANDROID_ARM64_FLAGS=\"--config=android --config=android_arm64 --action_env ANDROID_NDK_API_LEVEL=21 --cxxopt=-std=c++14 --copt=-D_GLIBCXX_USE_C99 --copt=-DTFLITE_WITH_RUY_GEMV\"\nBAZEL_CUDA_FLAGS=\"--config=cuda\"\nif [ \"${OS}\" = \"Linux\" ]; then\n    # constexpr usage in tensorflow's absl dep fails badly because of gcc-5\n    # so let's skip that\n    BAZEL_CUDA_FLAGS=\"${BAZEL_CUDA_FLAGS} --copt=-DNO_CONSTEXPR_FOR_YOU=1\"\nfi\nBAZEL_IOS_ARM64_FLAGS=\"--config=ios_arm64 --define=runtime=tflite --copt=-DTFLITE_WITH_RUY_GEMV\"\nBAZEL_IOS_X86_64_FLAGS=\"--config=ios_x86_64 --define=runtime=tflite --copt=-DTFLITE_WITH_RUY_GEMV\"\n\nif [ \"${OS}\" != \"${CI_MSYS_VERSION}\" ]; then\n    BAZEL_EXTRA_FLAGS=\"--config=noaws --config=nogcp --config=nohdfs --config=nonccl --copt=-fvisibility=hidden\"\nfi\n\nif [ \"${OS}\" = \"Darwin\" ]; then\n    BAZEL_EXTRA_FLAGS=\"${BAZEL_EXTRA_FLAGS} --macos_minimum_os 10.10 --macos_sdk_version 10.15\"\nfi\n\n### Define build targets that we will re-ues in sourcing scripts.\nBUILD_TARGET_LIB_CPP_API=\"//tensorflow:tensorflow_cc\"\nBUILD_TARGET_GRAPH_TRANSFORMS=\"//tensorflow/tools/graph_transforms:transform_graph\"\nBUILD_TARGET_GRAPH_SUMMARIZE=\"//tensorflow/tools/graph_transforms:summarize_graph\"\nBUILD_TARGET_GRAPH_BENCHMARK=\"//tensorflow/tools/benchmark:benchmark_model\"\n#BUILD_TARGET_CONVERT_MMAP=\"//tensorflow/contrib/util:convert_graphdef_memmapped_format\"\nBUILD_TARGET_TOCO=\"//tensorflow/lite/toco:toco\"\nBUILD_TARGET_LITE_BENCHMARK=\"//tensorflow/lite/tools/benchmark:benchmark_model\"\nBUILD_TARGET_LITE_LIB=\"//tensorflow/lite/c:libtensorflowlite_c.so\"\nBUILD_TARGET_LIBDEEPSPEECH=\"//native_client:libdeepspeech.so\"\n"
  },
  {
    "path": "data/README.rst",
    "content": "Language-Specific Data\n======================\n\nThis directory contains language-specific data files. Most importantly, you will find here:\n\n1. A list of unique characters for the target language (e.g. English) in ``data/alphabet.txt``. After installing the training code, you can check ``python -m deepspeech_training.util.check_characters --help`` for a tool that creates an alphabet file from a list of training CSV files.\n\n2. A script used to generate a binary n-gram language model: ``data/lm/generate_lm.py``.\n\nFor more information on how to build these resources from scratch, see the ``External scorer scripts`` section on `deepspeech.readthedocs.io <https://deepspeech.readthedocs.io/>`_.\n\n"
  },
  {
    "path": "data/alphabet.txt",
    "content": "# Each line in this file represents the Unicode codepoint (UTF-8 encoded)\n# associated with a numeric label.\n# A line that starts with # is a comment. You can escape it with \\# if you wish\n# to use '#' as a label.\n \na\nb\nc\nd\ne\nf\ng\nh\ni\nj\nk\nl\nm\nn\no\np\nq\nr\ns\nt\nu\nv\nw\nx\ny\nz\n'\n# The last (non-comment) line needs to end with a newline.\n"
  },
  {
    "path": "data/lm/generate_lm.py",
    "content": "import argparse\nimport gzip\nimport io\nimport os\nimport subprocess\nfrom collections import Counter\n\nimport progressbar\n\n\ndef convert_and_filter_topk(args):\n    \"\"\" Convert to lowercase, count word occurrences and save top-k words to a file \"\"\"\n\n    counter = Counter()\n    data_lower = os.path.join(args.output_dir, \"lower.txt.gz\")\n\n    print(\"\\nConverting to lowercase and counting word occurrences ...\")\n    with io.TextIOWrapper(\n        io.BufferedWriter(gzip.open(data_lower, \"w+\")), encoding=\"utf-8\"\n    ) as file_out:\n\n        # Open the input file either from input.txt or input.txt.gz\n        _, file_extension = os.path.splitext(args.input_txt)\n        if file_extension == \".gz\":\n            file_in = io.TextIOWrapper(\n                io.BufferedReader(gzip.open(args.input_txt)), encoding=\"utf-8\"\n            )\n        else:\n            file_in = open(args.input_txt, encoding=\"utf-8\")\n\n        for line in progressbar.progressbar(file_in):\n            line_lower = line.lower()\n            counter.update(line_lower.split())\n            file_out.write(line_lower)\n\n        file_in.close()\n\n    # Save top-k words\n    print(\"\\nSaving top {} words ...\".format(args.top_k))\n    top_counter = counter.most_common(args.top_k)\n    vocab_str = \"\\n\".join(word for word, count in top_counter)\n    vocab_path = \"vocab-{}.txt\".format(args.top_k)\n    vocab_path = os.path.join(args.output_dir, vocab_path)\n    with open(vocab_path, \"w+\") as file:\n        file.write(vocab_str)\n\n    print(\"\\nCalculating word statistics ...\")\n    total_words = sum(counter.values())\n    print(\"  Your text file has {} words in total\".format(total_words))\n    print(\"  It has {} unique words\".format(len(counter)))\n    top_words_sum = sum(count for word, count in top_counter)\n    word_fraction = (top_words_sum / total_words) * 100\n    print(\n        \"  Your top-{} words are {:.4f} percent of all words\".format(\n            args.top_k, word_fraction\n        )\n    )\n    print('  Your most common word \"{}\" occurred {} times'.format(*top_counter[0]))\n    last_word, last_count = top_counter[-1]\n    print(\n        '  The least common word in your top-k is \"{}\" with {} times'.format(\n            last_word, last_count\n        )\n    )\n    for i, (w, c) in enumerate(reversed(top_counter)):\n        if c > last_count:\n            print(\n                '  The first word with {} occurrences is \"{}\" at place {}'.format(\n                    c, w, len(top_counter) - 1 - i\n                )\n            )\n            break\n\n    return data_lower, vocab_str\n\n\ndef build_lm(args, data_lower, vocab_str):\n    print(\"\\nCreating ARPA file ...\")\n    lm_path = os.path.join(args.output_dir, \"lm.arpa\")\n    subargs = [\n            os.path.join(args.kenlm_bins, \"lmplz\"),\n            \"--order\",\n            str(args.arpa_order),\n            \"--temp_prefix\",\n            args.output_dir,\n            \"--memory\",\n            args.max_arpa_memory,\n            \"--text\",\n            data_lower,\n            \"--arpa\",\n            lm_path,\n            \"--prune\",\n            *args.arpa_prune.split(\"|\"),\n        ]\n    if args.discount_fallback:\n        subargs += [\"--discount_fallback\"]\n    subprocess.check_call(subargs)\n\n    # Filter LM using vocabulary of top-k words\n    print(\"\\nFiltering ARPA file using vocabulary of top-k words ...\")\n    filtered_path = os.path.join(args.output_dir, \"lm_filtered.arpa\")\n    subprocess.run(\n        [\n            os.path.join(args.kenlm_bins, \"filter\"),\n            \"single\",\n            \"model:{}\".format(lm_path),\n            filtered_path,\n        ],\n        input=vocab_str.encode(\"utf-8\"),\n        check=True,\n    )\n\n    # Quantize and produce trie binary.\n    print(\"\\nBuilding lm.binary ...\")\n    binary_path = os.path.join(args.output_dir, \"lm.binary\")\n    subprocess.check_call(\n        [\n            os.path.join(args.kenlm_bins, \"build_binary\"),\n            \"-a\",\n            str(args.binary_a_bits),\n            \"-q\",\n            str(args.binary_q_bits),\n            \"-v\",\n            args.binary_type,\n            filtered_path,\n            binary_path,\n        ]\n    )\n\n\ndef main():\n    parser = argparse.ArgumentParser(\n        description=\"Generate lm.binary and top-k vocab for DeepSpeech.\"\n    )\n    parser.add_argument(\n        \"--input_txt\",\n        help=\"Path to a file.txt or file.txt.gz with sample sentences\",\n        type=str,\n        required=True,\n    )\n    parser.add_argument(\n        \"--output_dir\", help=\"Directory path for the output\", type=str, required=True\n    )\n    parser.add_argument(\n        \"--top_k\",\n        help=\"Use top_k most frequent words for the vocab.txt file. These will be used to filter the ARPA file.\",\n        type=int,\n        required=True,\n    )\n    parser.add_argument(\n        \"--kenlm_bins\",\n        help=\"File path to the KENLM binaries lmplz, filter and build_binary\",\n        type=str,\n        required=True,\n    )\n    parser.add_argument(\n        \"--arpa_order\",\n        help=\"Order of k-grams in ARPA-file generation\",\n        type=int,\n        required=True,\n    )\n    parser.add_argument(\n        \"--max_arpa_memory\",\n        help=\"Maximum allowed memory usage for ARPA-file generation\",\n        type=str,\n        required=True,\n    )\n    parser.add_argument(\n        \"--arpa_prune\",\n        help=\"ARPA pruning parameters. Separate values with '|'\",\n        type=str,\n        required=True,\n    )\n    parser.add_argument(\n        \"--binary_a_bits\",\n        help=\"Build binary quantization value a in bits\",\n        type=int,\n        required=True,\n    )\n    parser.add_argument(\n        \"--binary_q_bits\",\n        help=\"Build binary quantization value q in bits\",\n        type=int,\n        required=True,\n    )\n    parser.add_argument(\n        \"--binary_type\",\n        help=\"Build binary data structure type\",\n        type=str,\n        required=True,\n    )\n    parser.add_argument(\n        \"--discount_fallback\",\n        help=\"To try when such message is returned by kenlm: 'Could not calculate Kneser-Ney discounts [...] rerun with --discount_fallback'\",\n        action=\"store_true\",\n    )\n\n    args = parser.parse_args()\n\n    data_lower, vocab_str = convert_and_filter_topk(args)\n    build_lm(args, data_lower, vocab_str)\n\n    # Delete intermediate files\n    os.remove(os.path.join(args.output_dir, \"lower.txt.gz\"))\n    os.remove(os.path.join(args.output_dir, \"lm.arpa\"))\n    os.remove(os.path.join(args.output_dir, \"lm_filtered.arpa\"))\n\n\nif __name__ == \"__main__\":\n    main()\n"
  },
  {
    "path": "data/smoke_test/LDC93S1.txt",
    "content": "0 46797 She had your dark suit in greasy wash water all year.\n"
  },
  {
    "path": "data/smoke_test/russian_sample_data/alphabet.ru",
    "content": " \nо\nе\nа\nи\nн\nт\nс\nл\nв\nр\nк\nм\nд\nп\nы\nу\nб\nя\nь\nг\nз\nч\nй\nж\nх\nш\nю\nц\nэ\nщ\nф\nё\nъ\n"
  },
  {
    "path": "data/smoke_test/russian_sample_data/ru.csv",
    "content": "wav_filename,wav_filesize,transcript\nru.wav,0,бедняга ребят на его месте должен был быть я"
  },
  {
    "path": "data/smoke_test/vocab.pruned.bytes.txt",
    "content": "s p o t\nw o r d\nj a u n t y\nn e a r e r\nh e a v y\nb e l l\nf l i n t ' s\nm o r a l i s t\nr e s o l v e d\ne i g h t h\ne u r o p e a n\nm o u t h\nm i s s u s\nm o s s\np a r t y\np a l e\nm i l l\nc e l t s\nd i s p e n s e d\nf r a n k l y\ns y m p a t h y\nm a d\nf l a t t e r e d\nd e v i l s\nv o m i t\nc o n t i n u e d\nl e a v e\np h i l o s o p h y\ni n d e m n i t y\nw a i t e d\nn e t\nt e s t e d\ns a x o n\np r o t e c t i v e\ng l i t t e r i n\np r e v i o u s\nd e a d\nl e a r n\nf o r t h\nl e t t e r\nc a r e s\na b o v e\ne x c e l l e n c e s\nf l a u b e r t\ng r a m m o n t\ne m p l o y m e n t s\np r e p a r a t o r y\ne x h a u s t e d\ng r a v e l y\nv o l t a i r e\nf i f t e e n\ni n t i m a c y\nr e a s o n a b l y\nm i r e\ne g g s\nh u m b l e\ns o m e t h i n g\nd a m a g e\np o e t r y\nm i n g l e\nl o w\ns t i c k\nv\nc o v e r l e s s\nf e l l\nm e t\ns i l e n t\nc a s t s\nt r o t h\no n l y\nl i v e d\nu s\nr e a s o n i n g s\ng a i t\ns e v e n t h\nh u m b u g\ns t r i v i n g\nh a b i t\ng e n e r a l\nt a k e n\na t t r a c t e d\nd r a i n e d\nw o r t h y\ns e c r e t\na r r i v e\no f f\nc l o u d s\nh a n d\nt h e m\ni n g e n u u s\ni n e v i t a b l e\ne a g e r l y\nm e l o d y\nc u n n i n g\nv o l u n t a r i l y\ng o l d\nb l o o d\nt h a n\nc o n s c i e n c e\nb r e a k i n g\nn a t u r e\nc o l o r\na t t i t u d e\nw h e r e\nd i s p o s e s\ns t o r e r o o m\ni m p e r f e c t\na n g e r\na\ns y s t e m a t i c a l l y\nr e l i e v e\np a c k e d\np l e a s u r e\nf l a t t e r i e s\ns l u r\na c c e p t a n c e s\np e c u l i a r\nb e s t o w e d\nl a b y r i n t h\na r r i v e d\nv e n t u r e d\ns o c i e t y\na f f a i r s\na f t e r n o o n\nw h e e l s\np r i n c e\nc h i m e\ne a c h\nb e a t s\nd i s t e m p e r e d\nn a t u r a l l y\np e r s o n a l\nr e p u t a t i o n\ne v e n i n g\nv a s t e\nm a d a m e\nl\ni n s i d i o u s\nc e t e r a\ns m o t h e r e d\nc l o t h e s\nn o t i c e d\nw o n d e r s\nb l u e\ns u g g e s t i o n\nf o r r e s t\nm o r n i n g\nm e d i t a t e d\na r t i l l e r y\np a s s e s\ni m p o s e\nc e r t a i n l y\nb u s i n e s s\nf a t h e r s\nn a y\ni n t o x i c a t i o n\nu n e x p e c t e d\ns t r o k i n g\nb u t\nr e p e a t\nd i s t u r b\np o s s i b l y\no h\na c c e p t\nl i p s\np l e a s e\nh e a r t i l y\na c q u i s i t i o n\ne n j o y\na c c e n t u a t i o n\na c c o u n t e d\ns w e e t\nf i x e d\nd e f i n i t e\nv i g o r o u s l y\np r o b l e m s\nf o l l o w\nm a n i f e s t e d\nf a s t i n\nd e l a y s\nd r a w n\ne v e n i n g ' s\ni s l a n d s\nb e t w e e n\nn o t w i t h s t a n d i n g\nt e r r i b l y\np a s s i o n\nr e a d y\ns u p e r i m p o s e d\ne x p e c t a t i o n s\nr e l i g i o u s\nr e s p e c t s\ns e l f\ne m o t i o n a l\nm a d e\ni n v a r i a b l e\nc o n t e m p l a t e\ne f f e c t s\ni m m o r a l\nr e s t e d\nm a i n m a s t\ns t r i n g s\nd e s i g n\nc a p a c i t y\na d d e d\nu n l o a d\nd o n ' t\ng r e a t e r\ns p e c i a l\nl e f t\nl e s s\no u g h t\ni n e x p r e s s i v e\nd r a m a\nc h a r i t y\ne x c u s e\nf o r e i g n\no t h e r ' s\ns t y l e\nc o n g r a t u l a t i o n s\ne n m i t y\nf a i r\nt h i r t y\ns o\nt o p\nd i a p h o r e s i s\nf o r w a r d\ns t a g e\no u t s i d e\ng r e w\ns c o w l\nf r e e\np o r t\ng r e n a d i e r\nu n d e r s t a n d i n g\ns t r a i n e d\ns e r v i c e s\nd i s a g r e e a b l e\nw h e n\na n o m a l y\nb l a m e\nd a y s\nm e r r y\nc o m p l a i s a n c e\no b t a i n e d\nf l u i d\nm e d i u m\ni ' d\np r i v i l e g e s\nr a g\nh a g g a r d\ni n a u d i b l e\nd e v o t i o n\nu n c o n s c i o u s l y\nr o c k\nh o n e s t y '\nr o u n d\ns e v e r e\na m o u n t\nt a n k a r d\np a i n f u l l y\ne n c l o s u r e s\ns e t t l e d\np l e a s e d\ny o u r s e l v e s\ns h e l v e d\nh o u r s\nc h a s t e\nh e r e d i t a r i l y\nc o m e s\nm a r v e l o u s\ny e a\ni n c o n s i s t e n c y\nh a r d e s t\ns t e p s\nr i d d l e\ns u i t\na p p l i c a t i o n s\np r o f u n d i s\ns a n c t i f i e d\ne x\ns i n s\nn o i s e\nu t t e r e d\nd i s c o v e r e r\nn o b l e\nr i d e r\nc r o s s\na w o k e\nh i m s e l f\nm e a n s\nf e l t\nu n d e r s t a n d\ns p a n i s h\nd e f e n d i n g\ne x p r e s s\ns k i e s\nt w i l i g h t\nc o r n e r e d\np r o s p e c t\ng o d s\ns o e v e r\na r e\nr e d o u b l e d\nm a c h i n e\nt w e n t y\nm i x\nj u d g i n g\nu t m o s t\ne v e n t u a l l y\ne x c i t i n g\nb e g\nl u n c h\ns e n s e s\no ' s h a n t e r\nc o n s i d e r a b l e\ni n f a n t r y\ne d g e\nc l e r i c a l\ni t a l i a n\na n g e l\nd r e a m s\nt e n s i o n\nm i r t h\nf i l t e r i n\ns t r u g g l e\nw i l l\nd e f i n e\nl a d y s h i p\nd ' e p i n a y\no b j e c t i v e\nu n c o n s c i o u s n e s s\nw e ' l l\nw h o l l y\na r t i s t ' s\nl o d g i n g\np i l e\nn u m b e r\nb e d c l o t h e s\nm e a t\nr o a s t e d\nf i r s t l i n g s\nc o m f o r t a b l e\ns l o w\ns u p e r s e d e\ns h r e d\nc o u r s e\np l a c e s\na g a i n s t\ns e c u r i n g\np r o b l e m\ns a t\nl o s e\nc u r e s\ni n c o m e\nv i s i o n s\np o n d e r o u s l y\nd e p e n d s\nc o n c u r r e n c e\nb e g a n\ns a k e\ne v e ' s\nd r o w n\nc o n s c i e n t i o u s\nw a v e s\na s s e n t\nt h e n c e\nf a l s e\nf r e e t h i n k e r\na c q u a i n t a n c e\ns t a r e\nm a r k\np a c k e t\ns h a f t e s b u r y\nh e a r e r s\nn i c e l y\ns u b s t a n c e\ne x t e n d s\ns t a r e d\nh a i r e d\nw o u n d\nc h a r i o t e e r\ns e e\nt h y\nf i n g e r s\ns i l l y\nm u s i c a l\nf i t\ng l a z e d\nc h a r g e\nd i r e c t e d\ne n c o u r a g e d\np a r i s h\nd e c e i v i n g\ns t a r t i n g\ng a l l a n t r y\np l a i n l y\np a r d o n\nm a n i f e s t\nf a u l t\nh a s t y\ns l u m b e r\np i t e o u s l y\ne v o k e\nw i t h\nn e a r l y\nh e a r t\nt h a t\nm a n k i n d\nd i s p o s i n g\nb r i t i s h\ni n t e r e s t i n g\nf l o o r\np a i n\na b s o l u t e l y\nh o l y\nc l o s e l y\nu t i l i t y\nb r i s t o l\ni m p o r t a n c e\nr e c o v e r y\ns o f t\nf i g\nt u p p e n c e\nc e n t u r y\ne x p e n s i v e\ne d i t i o n\na d a m ' s\ns u p p l y\ns o n s\nw i r e\ns h i e l d s\ng u i d e d\nb e a t i n g\nh o u r\nc h e a p e r\nt e n\nb e l i e f\np r o v e\nt h e o r y\nf u l l y\nj a n i u s\na m\nc u r i o u s\ne x h i b i t s\nn o w\ns a n g\nt e l e g r a m\nm i s u n d e r s t a n d\nt h r o n e\nd o c t o r ' s\ny o u t h\nc o n f e s s i o n s\ne x p e r i m e n t s\ng o l d e n n e s s\nb r e a t h\nb o r n e\nm o d e\nl a s t\na l p s\nh a r d\ns i c k n e s s\ns u g g e s t i o n s\nc o r r i d o r\nh a l f\nf e a t u r e s\nc o n c i s e l y\nd i s c u s s i n g\nt h e r e ' l l\ns y n t h e s i s\np r e s u m a b l y\nc e r e b r a l\np u r s u i t s\na c c o r d i n g\nr e p u g n a n t\nw a i t\nt h o r n\nb r u i s e d\ns t a v e\nb a b y\nc r o a k e d\np o w e r\nh o w e v e r\np r a c t i c e\nb a y c o n\nb e f o r e\nr e m e m b e r\ns p e c t a t o r\nb a b i e s\np r o o f\ni r e l a n d\np h e n o m e n o n\nd i s t i n g u i s h\nl i g h t l y\nc h a i n\nn e a r e s t\ni n f a n t\ns t a t i o n\np r o d u c t\ns e t\ns h e e p i s h\np r a y e r\nf e m a l e\nc o m p r i s e d\np r o f e s s i o n\nb a r b a r i t y\ne x p e r i e n c e d\nf o o l\nu n i n t e r e s t i n g\nd ' y e\nn i h i l o\ne x e r c i s e\no b s t r u c k t\ne i g h t e e n\nd i f f e r\np r i c e\nu t t e r m o s t\nd e s p e r a t i o n\ns p e c u l a t i o n\nl o u d e r\ns p e c u l a t i o n s\nf a k i r s\nr h o n e\na m i s s\ns h i p\np i a n o\nr e a l m s\ns e e m e d\ns o l i t a r y\ns c r a p i n g\nc o n s i d e r e d\nd o u b l e\nm a y b e\ns u p r e m e\nw h o l e s o m e\nf l o t s a m\nc r e a t e d\nb e d s i d e\ns o w e r b y ' s\nb i l l s\ns u p p o s e\nh o n o u r a b l e\ns e n s i t i v e\nm o r a l i s t s\ne a s i e r\ns t o o d\nd i s t r i c t\na s k\nb i l l y ' s\nb i t t e r n e s s\nw i d o w\nt h o u g h t\nm e d i c a l\nn e x t\na r o s e\np a n t o m i m e\nt r e a s u r e\np e e v i s h l y\nw h a t\nl i s t e n e r s\ns e r v e d\nh i g h l y\nr e s u m e d\nt h o s e\nt r a v e l l i n g\nr u l e\ne n t r e n c h m e n t s\np a r t l y\nm e r c y\nd o u b t e d\ng i v e n\nd e e p\nt a k e\ng e n t l e m e n\nr e f o r m a t i o n\na b b e y\nc o m m u n i t y\nf i n g e r\nc h i c k e n\no b e d i e n c e\nw i v e s\nt h r o w n\nc o m p o s e\nu n i n t e l l i g i b l e\nm a i n\nc l o s e d\nc l a s s i c a l\nm\np u l l i n g\nc o n t a g i o n\ns i r\ne m p t y\nm i s t r e s s\ns u b m i s s i v e l y\ns c r u p l e\nc i v i l i z a t i o n\nt o b a c c o\na l m o s t\nl a b e l l e d\na c c o m p a n y i n g\na b o a r d\nu n d o u b t e d l y\nl o f t y\ns o m e t i m e s\na c q u a i n t a n c e s\nl i t t l e\nc r e a t o r\nc o m m o d i o u s\ns o m e w h a t\nt w e n t i e t h\nn o t i c e s\nd e b t\nc r e a t u r e\ns e y f f e r t\nw r i n k l e d\nb o u n d l e s s\ns p e c t a t o r s\nb e c a u s e\nw e e k\ns p e c i f i e d\ng o w n\nc a s t l e s\nw a i t i n g\nt e l l s\np o p u l a r\nn e c e s s a r y\nc e r e m o n i a l\nq u i e t l y\nf r i e n d s\np r e c i s e\ns u f f i c i e n c y\nh o n e s t y\nd e c l i n e\ns c i e n t i f i c\nt e r r o r\ne c h o\ng r i d d l e\nb a r c h e s t e r\nf u n d a m e n t a l l y\nk e p t\np u s h i n g\nd i s t r e s s i n g\nu s e\nt a y\nc o n d u c t\ni n t e n s e\np e a c e\ns h o u l d\nc u l t u r e s\nq u i t e\nl o w e r e d\np r o d i g y\ns o w e r b y\nd u t y\nc h i l d h o o d\ns t a g g e r e d\nt r u t h\nl a n d s c a p e\no f f e r\na c t i o n\nd e a n ' s\nl o o k s\nw o r s h i p\np e e r a g e\nc r a c k\nf i r m\no u n c e s\nm i s t a k e\nn o t i c e a b l e\nl o a d i n g\no w n\nd i s m i s s e d\nw h e r e ' s\nw a r e\ne l e v a t i o n s\ne s p e c i a l l y\nw r o t e\np r e s e n c e\nj o u r n e y\ns h a k s p e a r e\nw h a t e v e r\nd e n i e d\ne a r\nm e a d o w\na i s y\ns u b j e c t\nw a s t e\na p p a r a t u s\na s t u t e n e s s\np o n d e r o u s\ns p l a s h\nl a u g h e d\ng r a n t i n g\na l t o g e t h e r\nc o u g h\ns e r v a n t s\nl e s t\nb e g i n n i n g\ns m o k e\nl e t t i n g\nc a u s e\nt r y\nd i v i n e\no c c u p i e s\nh e r o e s\nt h e r e ' s\no n e ' s\nk e e p\nr e a d e r s\np o s t\nb o o k s\nh a r d l y\nr a p i d\ns l e e p y\ne n d u r i n g\na f f o r d s\ns l e e k\nv i s c o u n t\nr e a d i l y\np e r s i s t e d\nr e i n s\nu n f o r e s e e n\nl a p\ni n s t r u m e n t\nd e t e r m i n e d\nn o r\ni n t e n t l y\nd i s c o v e r\nv e x a t i o n\np u p i l s\na r t i s a n s\ns t a r v a t i o n\np u r c h a s e d\nm o u n t e d\nd a y\ns i g m u n d\nl a i d\ng r e a t\nf e w\ne n t i r e l y\ne x t r e m e\nc o n s i d e r a b l y\np o l e m i c a l\ng o d\nm o r i b u s\nl o w e s t\nr a t h e r\ne x p e c t\np o i n t\nb r o t h\nm a n ' s\na n x i o u s\ni n t e r c o s t i a l s\np o n y\nd r a w e r s\np h i l o s o p h e r s\nn e e d s\ns h o w\nm e d i c a t r i x\nr e f l e c t s\ns n u g\nc a m e\ne x p e n s e\ns p i r i t u a l i t y\ns p r i n g\nd e v o i d\nd e a l i n g\ns e c o n d a r y\ng e t t i n g\nc h e s t\nk i n d\nd e f e c t i v e\ns t r u g g l e s\ns p a i n\nf a n n y\ns t a l k e d\nd e x t e r o u s l y\nt h i n k s\ny e s\nb a g s\nf a i n t\nk n o w n\no l d\nw i p e\nc a l l i n g\nr u n n i n\nr e s p o n s i v e\nr i g h t l y\nf u r i o u s l y\nc h a r a c t e r\np e o p l e\ny e\nm o u n t a i n\ni m a g i n a r y\nc o n t r a s t\nt h i t h e r\nw o r k e d\nw a l k i n g\ny o u n g e r\ne x p e c t e d\nm e c h a n i c a l\ns e l l\nr i d i c u l e\np e r f e c t e d\no v e r l o o k\ne n t h u s i a s m\nh y p n o t i s m\nd o o r\nf a m i l i a r\nd r e a m l a n d\nt h r o u g h\nc a l l\nt r o u s s e a u\nd e l i g h t\na l o n e\nd i s t r i c t s\nf l o w s\nb l a n k\ng a s p i n g\nd i s c o u r a g i n g\nm o d e s t\nd e s c r i b e s\nt o u c h e d\nu n e d u c a t e d\ns c u l p t o r\ne a t e r\nc o l o u r e d\nd e g r e e\nw e r e\na r a b i n\nl i s t e n i n g\nt o n e d\nc h a r l e s\no u t l o o k\nv a i n\nh e r e ' s\nw r e t c h e d\nd i s c o v e r i n g\ns o n g s\np a g e s\nr e c e i v e d\nc o n g e s t i o n\nb o w e d\nu n i t e d\ns u p p o s i t i o u s\ns e a t\na d v a n t a g e o u s\nw h i s p e r\nl a w\nt r a c t\nb o b\nf l o w i n g\nt e r m s\nh u m a n\nc r a d l e\nr e t u r n e d\nr a c k\nb a d\nt i r e d\ns h a p e\na s s i s t a n c e\nl o n g i n g\np u n c t u a l l y\nh u n d r e d\nm i d d l e\nd y k e s\ne n e r g y\nm a d n e s s\nu n s e l f i s h\na b u n d a n c e\nv i e w\nc u r e\nt e m p l e\ne x a l t e d\nd e v e l o p m e n t\no b j e c t\ny e a r s\nt e a\ne n d o w e d\ns p i r i t\ns t a b l e s\nb a g\np e r f e c t i n g\nj u s t i c e\nr e d r i f f\nh o u s e h o l d\nl a u g h t e r\nt h r o e s\nw a k i n g\nl o o k\nm a n y\np a s s a g e s\nc a r e\nt r u c k l i n g\ns h r i e k e d\nd i s t a n c e\nh e ' d\nd e s i r e\ns t r a i t e n e d\ns o o n\nt o l d\ni n t e n s e l y\nf a n c i e s\np u r c h a s i n g\nm a r r y\nh y p n o t i z e r\nc a s e\ng a r d e n\nm a n a g i n g\nl u m p s\nd e t e r m i n e\nd a n g e r o u s\nr e s o l v e\np e r c e i v e\nl i d s\np a r s o n\nl a n d\ng o e s\nw e n d\nl o f t i e r\nd o c t o r s\nb e s t\nw e e k s\np a r o d i s t s\np e r s o n a t e d\np l a y i n g\nn o r t h w a r d\nh o s t i l e\nr e m a i n\nc o m m e r c i a l\ni ' l l\ns a f f r o n\nc o n d i t i o n\nc a n ' t\nc o m p a n i o n ' s\no p e r a s\nq u e s t i o n a b l e\nn a r r a t i v e\nt r u n k s\ns t r o k e d\ns t a b l e\nd e s i r a b l e\np r e y\ne f f o r t s\nm e a n\na r t e r y\nd a u g h t e r s\ns u n k e n\na m o u n t s\ni m p r o p e r\ne n e r g i e s\nb o t h\na t t a c h\nt e d i o u s n e s s\nw i s h\nc r e d i t e d\ns a t i s\ns i t t i n g\nb u t t e r\na t h e n i a n\nc h o r d\na b s o l u t e\ns t a t u e\ns m i l i n g\nl e a r n e d\ni n n o c e n t\nh o r s e\ng r a s p\nq u a r t e r\nc o r r e s p o n d e n t\nc o u r s e d\ns l e e p l e s s\nw i f e ' s\ns e c o n d\np o i n t e d\nt r a d i t i o n a l\nv i c t o r i a\nb a t h\nh i d\ne t\nf a s h i o n e d\nf a t h e r\ni n c h\ng r a c e\nm i n d\nt h e n\ns c a r c e l y\nk i s s e s\ne v e r y w h e r e\ns t i p e n d\np u l s e\nr e s t r a i n\ns u m m e r\nc l o u d\nr a p i d l y\nw o o d s\ns i s t e r\nr e m a r k\nd e s p i s e\nh o o k\nj i m\nc o n t i g u o u s\nr i c h m o n d\nf r a m l e y\np o p e ' s\ns e c t i o n\nc o u n t i n g\na l l\nn o b o d y\np a s s\nd o o m\ns u m m o n\nf e a r\ni n c r e d u l o u s\nd i n e\nd o c u m e n t a r i l y\nr e s e r v e d\np e r m i t t e d\nh u m b l e s t\nc h a r l o t t e\nb e\nd r e a m i l y\na s s u m e s\nm e r e\ns p o k e\nq u a l i t i e s\nc a p t a i n\nd e l u s i o n s\na n c i e n t s\nn o t i c e\ns i g n a l\nf a c i l i t a t e\na c c o r d a n c e\nw i s h i n g\np r e o c c u p i e d\nn o v e l\ns n e e r\ns u b j e c t s\ni n f o r m e d\nc h a n g e s\np e r f e c t l y\ns p i r i t u a l i s e s\nd a n c i n\nb a s e d\ns m o o t h\nw a y s\nc a n d y\nt r e e s\ni n\ng e n i a l\ne x p e r i m e n t\ni n d e e d\np o r t i o n\no p e r a t i o n s\nb e l o n g s\np r o s t i t u t e d\no f t e n\ng r e e n\na u d a c i t y\nm e s m e r ' s\nu g l i f y i n g\nd i f f i c u l t i e s\no b e y e d\nl o v i n g\nh u n t i n g\nf u r n i s h e d\nh y p n o t i s t s\ne n t r a n c e\nt e n d e r\nd i v e r t\nc r o u p\nt h i n k\nc l a s p e d\nl i k e\nc o n f u s i o n\nc o m m i t t e d\nf o l k\nf o r g i v e\nr o c k s\ni n s i n u a t e d\ng l o w i n g\nc o n g e n i a l\ns m i l e s\nc r a f t\ng r o u n d\ns a m e\nw o r l d\nt r a n s c e n d e n t a l\np o w e r s\nl o c k\nc o m p l e t e l y\na s s u m e d\nw h o e v e r\ns l e e p\ns h a m e f u l\nh a r a n g u e d\ns o n g\nd e c l a r e d\nq u e e n\nb r o o m s t i c k\nu p\nd e g r e e s\ns u b j e c t i v e\nb r i g a d e d\ni n s e n s i b l e\na p a r t\nr e c o m m e n d\np o u n d s\ne d u c a t e\nr e c r u i t s\ne n d e a v o u r\nc o n f i d e n c e\ns e e m s\ne x p e r t\nd o u b t l e s s\nm a i l\no v e r\nv o l u n t e e r s\nf o o d\nt h o u s a n d\nd e f i n e d\nc o m p e l l e d\ns i d e s\ng l o r y\nd e v o t e e s\nl e d g e\nc a r r i e d\nh a d n ' t\nl u x u r i e s\nd e v i c e\nm o r a l l y\np r o f e s s e d\ne x p r e s s i o n\na s s i s t\ns i n g l e d\ng o n e\ns t r e t c h e d\nl i t a n i e s\nb a r b a r i a n s\np o c o c u r a n t e\na l f r e d\nt e r r i b l e\nb r a s s\nw o r l d ' s\nb o y\nw a t e r ' s\nb e l i e v i n g\np l a n e t s\nf a s t i d i o u s\nn o t\ne n j o y m e n t\ns p i t e\nh o w\nw o r k\nl o u d l y\nc o n c e a l e d\np h e n o m e n a\nm i n u t e\nt h e m ' s\nm e e k\nw e l l s\nw o r s t\nf a c t o r s\ns p i r i t u a l\na p p e t i t e\ns o l e m n\nt h e r e\nd o a b l e\ns h a r e d\nc o s t u m e\ne n g r o s s\nm y s t i c\nw e i g h\nl o s s\nm o r r o w\ns o u n d e d\np o k e r\nv e r d u r e\nf u l f i l\nw i l l i n g\ns i g h t\nm u s k e t r y\nf l e e t\nc o m m e n t a r y\nh o p e\nw o o d\nu n e g o i s t i c\ni n t e n t i o n\na n c i e n t\nr e l i s h e d\no c c u p i e d\nt h o u g h t s\nc o m m u n i t i e s\nc o r r e s p o n d e n c e\np e r s o n\nn o w a d a y s\nr e m i t\nd e s i r e d\nd e v e l o p e d\ns t a y e d\ni n d i f f e r e n t l y\ns t e a l t h i l y\ne x p e r i m e n t e d\nd i r e\na l e\ns e a r c h i n g\nm i g h t\ny e l l o w e r\nn a t u r a l\nt e a r s\ni n c r e a s e d\na g r e e d\nh o m e r\nr o m a n s\np r e v i o u s l y\ns h e e t\na s p e c t s\ns l i p p e d\nn o n\nr e f l e c t\ni m p e r s o n a t i n g\np a n t i n g\nw e t t e d\nc e r e b r u m\ng r o w n\na r d e n t\nh a p p i e s t\np o s s i b l e\na r m s\nc l e r g y m a n\nr e t u r n\ne n g l i s h\nu n h a p p y\ns h e d\nm e n t a l l y\nh e l v e t i u s\ng e n u s\no r g a n s\np r o d u c e\nw a n t s\np a i d\nl e g s\nv a r i o u s\ng a i n s a i d\nt r u s t\ne l e m e n t s\np o l e\ni n v e n t i n g\ni n t e r e s t e d\nc h a s e\nn a i v e t e s\nd o i n g\ni t s\nc u r a t e\nw a g n e r ' s\nn e w s b o y\nb l u s h e d\nl o v e l i e r\nr e s p o n s e\nw o r t h\nf a r e\np r o m i s e\na m u s e\nd o m e s t i c\ns t e p\no c c a s i o n\nr a g g e d\nb i r d s\nm u r m u r\nd e c e p t i o n\nm i s f o r t u n e\nf a s t\nh o l d i n g\np a r a d o x i c a l\no r g a n i c\ni n d u c e d\np l a t f o r m\nc r a y t u r e\nm o r a l i s t i c\ns e r m o n s\nc o c k e ' s\nk n o w\nm e a n t i m e\ns h o u l d n ' t\nc e n t\ne s p r i t\nt u r n e d\ng e n t l e m a n\np e r c e p t i o n s\ni m m e d i a t e l y\na d v o c a t e s\na n n e a l e d\no r a n g e s\no n e\ns p o k e n\np u e r\nf r o m\na d d i n g\nn e l l y\nc o m p a r a t i v e l y\nh a t\nl o n e l y\nr e f i n e d\na d m i r e\nb u n d l e\ns t a y\ni s l e\ne y e s\nb r a i n s\nt h i r d\nt u r n\ne n d l e s s\nd e m e a n e d\ng r a n t l y\nf a v o u r i t e\no p i n i o n\nd r e s s e d\nh e a r t y\nb i g\ns m i l e d\nd e s c r i p t i o n s\nm e m o r y\nf u l l\nr e f u l g e n t\nc o n s i d e r a t i o n s\nm e t h o d\ng a l i a n i\ns a c r i f i c e r\ns h a k e s p e a r e ' s\no v e r s h a d o w i n g\ns a v o u r e d\nh o n e s t\ns u m n e r\nv o y a g e\na h\ng i l d\np a p a ' s\ns e m i\ni d e a\nr e a l i t y\ns e c r e t l y\nr e m a i n e d\nk n o w s\nh e d o n i s m\no r d i n a r y\nr e q u i r e d\nb o n d\nd e l u s i o n\nd i s t u r b a n c e\nc o m m o n l y\nv i e n n a\na c q u i r i n g\np a s s e d\ng r i n\np h y s i c s\nc o n t r o l l e d\nr e s o u n d e d\nm i n d s\nw a t e r\no r i e n t a l\ns i x t y\ni n a s m u c h\ng o t\ng l a d\ns h e e p\ne a r n s\nt e w k e s b u r y\no b l i g i n g\nf i e r c e l y\nw r i t e\nr a r e\nm i g h t y\np r e t t y\nr e g a r d e d\nw e d d i n g\ne a r n e s t\np r a c t i s e\nt a s t e d\nh a v e n\nc a l l s\nw h e t h e r\nt h i s\nc o a x i n g l y\nf o r e s t\nv i v i d\nc o n v i n c e d\ns p i n s t e r\nm e e t\ns t u p i d i t y\nl o o k e d\ni n d i v i d u a l\na b i l i t y\nr h y m e\nc h e e r f u l\nn u r s e r y\na n g r i l y\ns h e\na b s e n t\nd a s h e d\nf r a n t i c\nm e m b r a n e s\nm i s m a n a g i n g\nc o r r e s p o n d e d\nc a p t i o u s\nw o t a n\ns a r v e\no r\nc o n d e m n i n g\nm o v i n g\nv e r b s\no v e r h e a r\ns t a l l\nd e e p e s t\ns t a i r s\na p p r o p r i a t e\nc a l m e r\nl a u g h i n g\nl y i n g\ns e n s a t i o n\nf e s t i v a l\nc o m p l e t e\ns u f f i c e\nc o n f i d e\nq u i e t\nh a p p i l y\nf a c u l t y\nu n f a v o u r a b l y\nw a s n ' t\nt i l l\nl o o k i n g\ne y e l i d s\nc o m f o r t\nc l a i m\ne x c l a i m e d\na p p l a u s e\nr i d e s\nm u t t e r e d\nf o r g e t t i n g\nb o b b y ' s\na c c e n t\ns u g g e s t i n g\np r e b e n d a r y\ns t a n d i n g\np e n c i l\nw a r t h i n\nr u s s i a\nm u s i c\nc h o s e\nf u r t h e r\nl u c y ' s\nf r o n t\na p p e a r a n c e s\ny o u\na b o u t\nb r o a d\nm o n t h\nf i n i s h e d\na c c u s e s\np r i m e\nv i c e\np r o f e s s i o n a l\nb o a r d\nw o n d e r f u l\ni f\nd i d\np e r s o n s\nr a i s e\ne u r o p e\nf a l s e h o o d\na n g r y\na c c o m p a n i e d\nr u f f l e d\nf a l m o u t h\nb e g g a r\ns i n g l e\na m e r i c a n\nu n l u c k y\ni n t r o d u c t i o n\np r o p e r\na r t i b u s\nc h a p s\ns u s p i c i o n\ns i d e\nh a p p e n e d\nd o w n w a r d s\no u t\nr i s e n\np o s s e s s e d\nt h e y ' d\np a r t i c u l a r\ni n d i f f e r e n t\ns a n k\nd a r e s a y\nc o n c e i v e\ne s t a t e\nh u m a n i t y\no p e n s\nb a r l e y\nc a t h e d r a l\ns t o n e\np r o d u c e d\nc h a n n e l\nr e m e m b r a n c e\nj a m e s\nc r o w d\nd r i v e\nl o n d o n\nw o m e n\ns a n g u i n e o u s\nc a u s e d\np r o l o n g i n g\np e r c e i v e d\nc h a n c e\nc o n j u n c t i o n\nr e g r e t t i n g\np u t\nw h i c h\np e r f o r m\nc l a i r v o y a n c e\ny e a r\ns h o r t c o m i n g s\np r e j u d i c e d\ne n c h a n t i n g\no b s e r v e\nl a r r y\ns t o p p e d\np e a s a n t r y\nd i s p l a c i n g\nc o n v e r s i n g\ns c o r e\na l l y\nb e h a v e s\na c c o r d\ns t u d i e d\ne x h o r t e d\nb a l t i c\nr e f r e s h m e n t\nc i r c u m s t a n c e\nk i s s\np l u n g e d\nm o s t\nd e l a y\ng u a v a\np i c t u r e d\nb i l l y\nm o r e o v e r\np r e t e n t i o u s l y\nt r i e d\nt h e r e o f\ns t i f f\nb e l i e v e d\nc o l d n e s s\nr e s t\nh e r o i s m\nu p r o a r i o u s l y\ne x i s t e d\np r i n c e s s e s\ni m p r i n t e d\nu n l i k e l y\ni n t i m a t e\nc h i l d r e n\ns e n d\nm o u n t a i n ' s\nh e a p\nb r o k e n\na c t i o n s\ns y m p t o m s\nf o r c e s\nd o c t o r\np h r a s e\nb a s e\ns o r r y\ng o i n g\np a s s i n g\nr a n k\nl a b y r i n t h s\nf e e l s\nm u t u a l\ni n e x p r e s s i v e n e s s\ne\nr e p l y\ne x a m p l e\nc o n s e q u e n t l y\na l l o w\nw h i f f\nh o r r i d l y\ns u r e\nc h a r l a t a n\np o t\ns u c h\ns e n s e\nn e w\na d v a n t a g e\na w a k e\nf r e e d o m\nc r u s a d e\nt r e m b l i n g\na i n ' t\na t l a n t i c\no ' c l o c k\nb o u n d\nc a b i n\np r o m p t e d\nm o m e n t s\ns p e a k e r\ns e a s o n\ns i n g\nf a k i r\ne x p e d i e n t\np r o f i t s\np r a i s e\nn i n e t e e n t h\ns h i n d y\nf o r e h e a d\ns c o t c h\nc o n s t r a i n e t h\ns u p p e r\nv a l h a l l a\ns a c r i f i c e\nh o m e r i c\nw h i t e\ne x p l a n a t i o n\nh y p n o t i s t\ns u f f i c i e n t\nd e a r\ns t u f f\ne x p a n d\np e s s i m i s m\np a t i e n t s\nn o r t h\nw i c k e d\ns t a r s\nc o r r e s p o n d i e n c e\nr e c r u i t\nf e a r f u l l y\nc h a p t e r\ne l e g a n t\nt r i c k\np r i c e s\ns i x\nw i n t e r\nc h e a p\ns t r e a m\nr e v e n g e\ns t e l l a r\nd e a l\nm o o n\nb e y o n d\nb e c o m i n g\nr e p u l s i v e\nm y s t i c a l\nd e a n e r y\ns m a l l\na h e a d\ny e ' d\nb e t t e r\ns w o r d s\nl i v i n g\nj e l l y\nb o l d e r\nv e r y\np l a y e d\nt r e a s u r e s\na c c e p t e d\nh e c t i c\nr e v e r e n d\nd e s t r u c t i o n\no x e n\nb r o u g h t\ns p r e a d s\nm o r e\ni n d u l g e\nv a u l t\nc o m e\nh e ' l l\no f f e r e d\nr i d e\nc o a c h\nc o n s e n t e d\nn ' t\ng e t\ns u b m i t t e d\ns o u n d s\nd e g r a d a t i o n\ns t a l k\nl a t i n\ni m p e r f e c t l y\na l w a y s\nb r e a k f a s t\nn e i t h e r\nc r i e d\ns e n s i b l y\nv a s t\nf i e l d\np l e a s a n t\nc a r r i a g e\ng a v e\nf a l l\ni d e a s\nt a x e d\nl i v e s\nb o n b o n s\nu t i l i t a r i a n s\ns e v e n t y\nt i m e\nm y s e l f\nr a y s o n\nm a y\nc o u n t y\ns u n d a y s\na r s\nt h e r e f o r e\np r i e s t s\ng r o u p\np r o m i s e d\nc o r d i a l i t y\nc o n s c i o u s n e s s\ns o u l\nm y s t e r i o u s\nc h a n s o n s\nn o n e\nc a s t o n\nh i g h\nb o b b y\nh i t h e r t o\nf a t h e r ' s\nc i r c u s\no u r\nt h u s\nn i n e t y\nl i g h t\ns t r o n g\nl o n g\no p e r a t e s\nr e v i v a l\nt o l e r a b l y\nr e p e a t i n g\nc h a m b e r\nu l t i m a t e\ns o l i c i t e d\nr e s p i r a t i o n\nl i q u i d\nm e g a n t i c\nl i k e s\na n g l o\ni n v i s i b l e\no p e n\nm u l t i f a r i o u s n e s s\nc h a o s\nu n d e r\ns c a l p\nr e a l l y\np i n c h\nr a r e r\na g r e e a b l e\no b l i g e d\nd i s g u i s i n g\ng e n t l y\nf a i r y\nr u i n\nc o n c u r r e d\nw r a p p e d\no f\ne x e r t\nv a l e s\nf r e e l y\nf i x\nr e s p e c t a b l y\nm a l i c e\nm u c h\np a r t i c u l a r l y\nb e t w i x t\nd r a w i n g\nn i g h\ne s c a p e d\np h i l o s o p h i z i n g\nh y p n o t i c\nh y p n o t i z e d\nm e a s u r e\nu n d e r s t o o d\nm e a n w h i l e\ns u g a r\nb r a v e r y\ng r e a s y\ng r a n d\nc o o k e\nt o r r e n t ' s\ns u b l i m e r\np l e b e i a n\nc o s t u m e s\nh e a d e d\nn o n s e n s e\nd o e s n ' t\ns t a t e\ng r o w i n g\no b e i s a n c e\nd r o p p e d\nb e e n\nf i r m l y\nr e g u l a r\np e t t i n g\np r o f o u n d l y\nm o t i v e s\ns t o o p i n g\nb e i n g s\np o s s i b i l i t y\nh y b r i d\nh o u s e\nh a r m o n y\nl a m p\nv i r t u e\nd i f f i c u l t\nm o d e r n\nh i g h w a y\nu s u a l\ne u d a e m o n i s m\ns c h o l a r\ns e n t i m e n t\ns e e i n g\ni n n e r\nm i n e\nw i n d\nr e p o r t s\nb a s i s\nf a i l\nt r a y n o r\nb l e s s\nl o d g e d\nd i n n e r\nw a l l s\ns e v e r n\ns a n d y\na l r e a d y\ni l l\ns i x t e e n\nc l o s e\nr e s i d e n c e\ns h a r p\nl a k e\nt i d i n g s\nh e s i t a t i n g l y\nc l o t h i n g\no b s e r v a t i o n\nr e c o g n i z e d\nt r a v e r s i n g\nd a u g h t e r ' s\nw i t h d r e w\ng e n e r a l l y\nh e a v e n ' s\nu n c o n s c i o u s\nm u s i n g\nc o n f e s s\nc h a n g e\nd u g\nf o r g e d\nd o m i n a t e\nw h e r e b y\nf r a n c e\nl e a s t\no v e r s p r e a d\nk n o w l e d g e\nc o r i n t h i a n\ns t r u c k\np i c t u r e\nc l o t h e\na y\ns t a i r\np r e s e n t\ns t a t e s\ns o n\nd a m a s k\nc o m m a n d e d\nn a p l e s\ni n s t a n c e\nb e c a m e\ns n a p p i n g\nw e n t\nr e\ng r a d a t i o n s\nt a k e s\nc h i l d\nk i n d n e s s\nb o o k s h e l f\ns t a r t\na r i s t o p h a n i c\nf e e l\nq u e s t i o n e d\nl e t t e r s\nf r e q u e n t l y\na p p e a r\nr e m a i n s\ns e l l i n g\nh y p n o s i s\nf l u n g\ni r k\nb a c k\nw o r n\nh a n o v e r i a n s\ns t i m u l a t i o n\nk i t c h e n\ny a w l\nh a p p i n e s s\nh i g h e r\ng o\np r o x i m i t y\nc o r n i s h\nh a n d l e\ns p i r i t s\no f f e r s\nr e l a t i o n\ng a m e\nq u i n c e y ' s\ns p e a k i n\nc o u l d\nh a n d s\nd e v i l r y\nj u d i c i o u s l y\np o t a t o e s\nt a l k e d\nc l e r g y m e n\nb o u g h t\ne v i d e n t\nb o w\na d v a n c e\nc r i m e\nt w o\ne d u c a t e d\ne a t e n\ng u i l t y\nt o w a r d s\no c c a s i o n s\nr i d i c u l o u s\na f f o r d\ni n t e l l e c t u a l l y\nc o u n t e r\nh a v e n ' t\ne a r s\nc h e e k s\nf a t\nn i g h t\nu t i l i t a r i a n i s m\ne a g e r\nr i g i d\nc o r n e r\na r r a n g e\ns t a n d a r d\na r i s t o t l e\np u t t i n g\nw a l e s\np i c k e d\nw e\nf a c e s\nu n a b l e\ni m p o r t a n t\nh e a d\ni n s i d e\ns o l d\nb e d\ns h o e\nd o m e\ne x p e r i e n c e\nb e l i e v e\nt h e y\nm a g n e t i z e r\nc o l u m n s\np i c k\ns i n\nq u a c k\nr e c i t e d\no m i s s i o n\nf i n d s\no p e r a t o r s\na r t i s a n\nw i n d f a l l s\ny o r k\nv a c a n t\nd e r v i s h e s\nf a n c i e d\na n i m a l\nb o b ' s\ni m p a t i e n t\nh i s\np r e b e n d\np r e s s e d\nc h e e k\nh a n d i n g\nm o d e s\nh o g g l e s t o c k\na m o n g\nc a n n o t\nl a r g e\np r o f e s s i o n a l s\nt h r e w\np r o c e s s\ns e n t i m e n t s\nd o n e\nb e i n g\nc o n t e n t\ns e r e n e\nb e a r i n g\ns t a r t e d\np e r i o d\nl o r d ' s\nm a r t h i e u ' s\nw a n d e r i n g s\ni n c r e a s i n g\nc l u n g\nb r e a d\nr e f l e c t i o n s\no t h e r w i s e\nu n d e f e n d e d\ns p l e n d i d\nh o p e s\nb e l o n g i n g\ns o u n d\nb r u s h y\ni v o r y\ne q u a l l y\ns o m e o n e\no r d e r e d\ns o r r a\nt h r i v e s\nd i s t r i b u t e\ng a u n t\nt a l e\nu n c e a s i n g\nd i s m a y\ns a d\ng l a s s y\na r t i c l e\nl u f t o n ' s\ne v e n\no ' e r c a s t s\ns h a l l o w\nn i n e\nd i f f e r e n t\nc l o t h s\nm i s s\na p p e a l s\na n d r e w s\nw h i p\no ' e r\nf o r g o t\ns o o t h i n g\nw e s t\nu n j u s t\ng r a m m a r\no d e\nw r o n g\ns t r e n g t h\nm a r k e d\nd r i n k\ng a r d e n e r\ni n j u r y\ne a s i e s t\np e r f o r m a n c e s\nt o u c h\nc o r n w a l l\nm y s t e r i e s\nt e l l i n g\nr e t r e a t e d\nw a l l\na k i n\nd e e d s\ni n s t e a d\nt a s t e s\nw r e t c h\ns y s t e m s\nm a t c h\nl a n c e t\na f o o t\ns t o n e h e n g e\ns t a t i n g\ns n a k e s\ne x h i b i t i o n\no a r s\nt o\np r e s e n t a t i o n\nl u f t o n\ns e a t e d\nn a t i o n a l\nd u e\nw o r t h l e s s\ns p e c u l a t e\ns u p p o s e d\na v e r a g e\ng r o o m\nd e s i n t e r e s s e\nf i r m a m e n t\nc h o o s e\nc o m m e n c e d\nt u r f\ng r i e v o u s\ne n t r a p p e d\nf a r m e r\ne q u a l\ni n t e r v a l\ne v i d e n t l y\np h y s i c\ns u p e r f l u i t i e s\nh u m o u r\np r o v i d e\nu n t i l\np r o p e r l y\nd u t i e s\ne x c e s s\na r t f u l\nd i r e c t i o n\nd e s t i n e d\ns i g h\ns t e a d i l y\ng o o d y\ni n t r o d u c e\nr e t u r n s\np i l l o w\nm o r a l s\np r o g r e s s e d\nr i p\nd i s c o o r s i n\nc h e e r f u l l y\no p p o s e d\ng r i s e l d a\nd e m i\nd i s t r e s s\na m b i t i o n\nc u l t u r e d\ns t o r y\nr e s i s t\nv i s i t s\ns l a v e r y\nd e c e i v e\np h i l a n t h r o p y\nh o n o u r\nd i f f e r i n g\nm o u r n\nf o r n i n t\nd r o w n e d\nd r i v e n\nh u s b a n d\ns a t u r d a y s\nc o i n c i d e n c e\ns e n a t e u r\nh a l t\nm a n a g e\nc o r p o r a l ' s\nf o u n t a i n\nu n d e r g o i n g\nl i f e\na l o n g\nc o m p l i c a t e d\ng e s t u r e\nl o s t\nd a n c e\np u r c h a s e r\nm o r a l i z i n g\nc u r i o s i t y\ng o d ' s\nb e a t e n\nc h i e f\nd e c i d e d\na p o l o g e t i c a l l y\nc l a s s e s\ng e n u i n e\nm o t o r\ns h o p\nf o r t u n e\ns u n s\nr o a r\nr o c k i n g\ns u i t i n g\nr e d\nr e l a t i o n s h i p s\np u n i s h\nt e n d e n c y\nh o r a c e\nf u l n e s s\na r o u n d\nr e p e a t e d\np s y c h o l o g i s t\ne x p r e s s l y\ns i n c e\no c c a s i o n a l l y\nf o u n d\ne n d e a v o r s\nt w i c e\no b s e r v e d\nl i s t e n\ne i t h e r\no m i t t e d\nf r i g h t e n\nc a l m l y\nc a r e e r\ns t e a d y\ns c e n e\nt e a r\nf o l l o w e d\ns a t i s f y\nb a s k e t\ns p a n g l e s\nf r i n c h\nt i t l e\nb a c k w a r d s\nd i e s\nh a n d k e r c h i e f\ns e d u c t i o n\no w i n g\ni r r i t a b i l e\ns a f e\nd i s c u s s i o n s\nz e a l\ns c e n e s\nc h a f f e d\nc o a t\np a t i e n t\nv i s i t\nb l u n d e r s\nf i t t e d\nf u m e s\nw h a t ' s\np u r p o s e\nd o c t r i n e\ng i l d e d\ns a y\ns h a d e d\nb o x\na r r o g a n c e\nr o m a n i z e d\nd a m\nd r a g o o n\nc o n v e r s e d\na d m i r a t i o n\ne x t e r n a l\na n\nd r e a d f u l\nc o n s o r t\nh e i g h t e n i n g\ns i t\ng a t h e r e d\nf u r y\nm a s s\nc a r e f u l\nd i g g i n g\nw o m e n ' s\nr e m o t e\nm i l k\ng o r g e d\no l i v i a\nw e l l\nm a l v o l i o\nb o u n d s\np i n\nb u l l\nc u l t u r e\nd i s c u s s i o n\nm i s f o r t u n e d\nb r i n g\ns i l v e r\nn e a r\ni t c h i n g\nf i v e\na g e n t\nl i k e d\nt y p e\nl a w y e r\np a p a\nt h o u g h t f u l\np o o r\np e e p e d\nw a l k e d\nc l e a r\nd i s c l o s e s\nm o c k i n g\nn a m e l y\np r e a c h e r s\no p e n e d\nc l a s s\np e r s u a d e\nt e m p o r i a l\nw a s h i n g t o n\ng r a d u a l l y\nh y p n o t i z a t i o n\nh u n t\no r i e n t\ns o m e r s e t\ns u b j u g a t i o n\np e r s p i r a t i o n\nd i v e r s i o n\nf o o t s t e p s\nb e l o n g e d\nt r e a t s\nt h e\ne x p r e s s e s\nh e r s e l f\nt e n t\nl e a v i n g\ns i g h t e d\nh a n d i n\nn o t e\nt a l l\nh e r o\nd e a t h\np r i n c i p l e s\nr e a s o n\no p e n i n g\nh e r s\nd a u g h t e r\ns e d u c t i v e\no b\nv a g u e\nh a v e\na d d r e s s e d\ne n d s\ni n c r e a s e\nm o r r i s\nf i n d\nc o r p o r a l\ni n q u i r e\ni n m o s t\nf a c e\ni m p a t i e n c e\nf l o g g e d\nl o n g e r\nc r a w l e d\ns u r g e d\no r i g i n a l\ne n t h u s i a s t i c\no p p o s i t e\ny e ' r e\nh y p n o t i z i n g\ns u r r o u n d e r s\np e r\nw e a t h e r i n\nc l u m s y\nf r e s h\na c c e s s\ns e v e r a l\nb u y\nc o n c e r n i n g\nu n t r u e\na n d\ns u c h l i k e\nm o m e n t\nf e l l o w\nt h o r o u g h l y\ns e n d i n g\ng r o a n i n g\nq u a n t i t i e s\nd o m a i n\no u r s e l v e s\ns a t i s f i e d\nl o t\ns h o r t\nh o t\nl o v e ' s\nm i s t e r\ns m i l e\nt\ns h a m e\nn e w s p a p e r s\ng o l d s m i t h ' s\nb o d y\na c c o u n t a b l e\nm y\nd i s l i k e\nf l o w e r s\ns t r a n g e\na p p e r t a i n\na d v e r t i s i n g\no p p o r t u n i t i e s\nm i n u t e s\nu t t e r l y\ns p e n t\nr e s p e c t\nr e l i e v e d\nm o r a l i t i e s\nr o c k y\na n s w e r s\nd e s c r i b e\na c t i v i t i e s\nf o r w a r d s\nd r o p p i n\na n o t h e r\ny o u n g\nd e n i a l\ne n j o y e d\ns u d d e n l y\nh e a r t i e s t\nt o n e\nd o z e d\ns a n c t i t y\nl i t e r a t u r e\nn e v e r t h e l e s s\ns u b t l e\nf o u r\ns u b t l e t y\na f f a i r\nc o w l d\nc l a d\nr e l i n q u i s h e d\no p e n l y\np s y c h i c\nc e n t s\nl l\nr e s p i r a t o r y\nt a l k\na r i s t o p h a n e s\nh y s t e r i c a l\ne i g h t\ns i x t h\ni r r e g u l a r\nw i f e\nb i t\ny e t\nm o t h e r\ns c a n t y\nd i s i n t e r e s t e d l y\nb u t c h e r ' s\nc r u s a d e s\nl o r d\np a t h\ns p e a k i n g\ng r a n d f a t h e r s\ns u p p l i e d\no b e y i n g\nc o m p a t i b l e\nc h e r i s h\nr i s e\na d d i c t e d\ne f f e c t\ns p r e a d\na d d i t i o n a l\np i n i n g\ng o d s e n d s\ne x t e n t\nh e ' s\na p p r o a c h e d\na t o n i n g\nw h i l e\nf l o r e n t i n e\na p p e a r a n c e\ns p e e d y\na p r i l\ne u r o p e a n s\ne y e\nv a l u a t i o n s\ns a t i s f a c t o r y\na r m\ns c h o o l\nw o r l d l y\nm e r e l y\nl a d i e s\nd i s t u r b e d\nm e d i t a t i o n s\ne v e r y t h i n g\nt r u s t e d\nw o n ' t\nr a i m e n t\na f t e r w a r d s\nc r o w d e d\nk n e e s\nr i d i n g\np r i n c i p l e\nm a t t e r\ns c r e w i n g\np r o v e s\nf i n a l l y\np a y\np l e a s i n g\nb u t l e r\ng i v e\ne a r l i e r\ns h o o k\np r e s e n t l y\na l b a n y\ne n o r m o u s l y\ns o m e\nf o r m s\na f f e c t e d\ng l i d i n g\ni n t e n s i f i e d\nw a n t\nc l o s e r\ng r e e k\nc a l l e d\nk i n g\nc o n t r a d i c t o r y\na n x i o u s l y\nr a i s e d\ns n a r e s\nr e a c h e d\nw i t h o u t\na s k e d\nf a s t e r\nc h r i s t i a n\nm e r i t s\nm e l a n c h o l y\ns i n c e r e\nn o\na u t u m n\np r e s u m p t i o n\nl o v e r\na f t e r\nc r a g g s\na r t\nh y p n o t i z e\ni m m e a s u r a b l e\na s s u r i n g\nd i l a t e\na p p l i e s\nv e n t u r e\nw o n d e r\ns c h o o l s\nu n f a l t e r i n g\ns u b s e q u e n t\np u z z l e d\ns o m e h o w\nh o l l a n d i a\nu n n u m b e r e d\no n c e\ne v e r y\nf o r m\nc o o l e r\nt o g e t h e r\np l u m s\nw a l k s\na p p o r t i o n e d\nt h o u g h\nc h a r m s\nr e t u r n i n g\nc e n t e r\nt i d e\na f t e r w a r d\nb e n t h a m\ns a w\nd r o w s y\nf i x i n g\nh e r b e r t\nd e s i r e s\nl o v e s\ns h o w e d\nt h i n g s\na c r o s s\nf o n d l e d\nl a t e r\nw i d e\ns t o r m s\nb l i n d\ni n t e l l i g e n c e\nb o d k i n s\nk i n d s\nh e x a m e t e r s\nm a i d\ne a s y\nv e s s e l s\nf a i x\ng i n g e r b r e a d\nr e d u c e\nf o l l i e s\np l e n t i f u l\nw i l d\na d m i t\nr u n\nm e e t i n g\nd o l l\na g a i n\nh i s t o r i c a l\nk i n d l y\np o o r l y\na n s w e r e d\nc o m m u n i c a t e s\nm u f f\nf r i e n d\nf r o\np r i c k i n g\ne n t e r t a i n m e n t\nc a u s e s\nm u n i f i c e n c e\nm e\nr e c u r r i n g\nu p r o o t e d\ng r e a t e s t\nc o n c o c t i o n\nc o a r s e\na u t h e n t i c\np r i d e\nt w e l v e\ns h o w m a n\nr i n g i n g\nd i d n ' t\ni l l i g a n t\nm i l f o r d\nb a l l a d s\ns t i l l\nd e\nc o u r a g e\no b v i o u s\ni t ' s\ns u c c e s s f u l\nb a l a n c e\nr a t e\nc o m m a n d\nu n c o n d i t i o n a l l y\nm o r a l i t y\nw h i r l e d\nf a c t\nh e r e a f t e r\nu t t e r\nc a n\nl o v e\nh u g\nr e q u i r e s\na s i d e\nt h u n d e r s t o r m\nd o e s\np h r a s e s\nc o n s i d e r\np r e c o c i o u s\nz o l a ' s\ne v e n t s\nl o u r d e s\ni n w a r d\nc o n s t a n t l y\nw h y\nc a n v a s\nd r i n k e r\nc l e a r e d\np l a i n w a r d\nm a k e\nt i m b e r\ns c h e m i n g\np o e t s\ns l u i c e\no n e s\ns i e g e\nw a s h\nm i l t o n\ne a s t\nm o r a l\nw h i t h e r\ne a t i n g\nc e r t a i n\nf i n e\na t t e n d a n c e\nd e s c r i b e d\nt e m p e r a m e n t\nb e g g e d\nr i c h e s\nm e n\ne l e v e n\ns i m p l e\nu n c l a s p\nd e m o c r a t i c\np a r s o n a g e\nt u n e\nd r e a m\nm e c h a n i s m\no t h e r\nm a n i f e s t a t i o n s\nn a r r o w\na t\nr o b a r t s\nt u r n i n g\nc o n v u l s i v e\ns a l t p e t r e\nd e e p l y\nc l e a n\nd w a r f s\nt e a c h i n g\nr e l i e f\na b l e\np a p e r s\nc u r a c y\nh a m m e r\np r o u d l y\nm e d i o c r i t y\nv i r t u e s\na n y h o w\nh a r d n e s s\nh a v i n g\nd i s t u r b s\nt e n d\nr e a d\ns a c r e t\nd i s c i p l i n e\no f f i c e\nl i b e r a l\ns o f t l y\np r o t e c t\nm o t l e y\nc o m f o r t s\nh a i r\nc o n t r a r y\ns e n s a t i o n s\nc r e d i t\nu p o n\nf i n a l\nt i n g l i n g\nm a s k\ns p i r i t u a l i s i n g\na i r\nr e s p e c t a b l e\ng r e y\nl e d\nb a r e\nc i r c u m s t a n c e s\ng a l l o n\ne n g a g e d\nh e a r t h s t o n e\ng o o d n e s s\nc o n t r o l\nf o o l s\ny e l l o w\ni s l a n d\nh e a r\nb r o t h e r ' s\np l a c e d\na m u s e d\nj u s t\np r o f o u n d\nn u m b\na c c i d e n t a l\nb l e s s e d\nw i g s\ns e a r c h\nc h a r l a t a n i s m\nc r a c k l e d\nh e\na s k i n g\np r o t e s t\na b s e n c e\ng a z e\nt e n d e r e d\nb u r s t s\np a r t\nd i s c o u r a g e m e n t\ni n c i d e n t a l l y\nq u o t e\nf i n e r y\nt a k i n g\nh o l d\na b o u n d i n g\ns c i s s o r s\nw e a k e r\ne x p l a i n\nt o o\nm i s f o r t u n e s\ns h i p s\nd e m o n i a c a l\nb e n t\nl e t\nr i g h t\ns o r t\nw i s h e d\nt h i n g\np r e s e n t s\ng l i b l y\nt i s\ns h i n e\no r d e r\nf a i l e d\nl a y\nc h i e f l y\ne x p r e s s e d\ns e e n\ns c a r r e d\ni m p o s s i b l e\nr e g a r d s\nd e a f e n i n g\nl a u g h\nr o o m\nd a n d y\na c c o u n t s\nf o r m e r l y\ni m p e r s o n a t i o n s\nm o o d\np o p e\nh e i r e s s\na c r e s\nn e w s\nw o m a n\nc o u r t i n g\nj o v e\na c c o u n t\nw a n d e r e d\nl a t t e r\na d o p t e d\nw o u l d n ' t\ns t r i v e\na f e a r ' d\nb a d l y\nc o u n t e d\ni n v o l u n t a r i l y\nt h e i r\ng i r l s\nj u m p e d\ns t r i c t e s t\nh e a l e r s\nh a s\nv i r g i n i a\na p p e a r s\nc u t\nr e d u c e d\nb l i s t e r\nr e m e m b e r e d\np r o m o t i o n\ni n j u r e d\nc l a i m s\nf r o n t a l\nn o r m a l\nh e a l t h\np r o t e s t e d\nb o l d l y\ns p e n d i n g\nm o o r i s h\nr e l i g i o n\nb e c o m e s\nf u t u r e\ns e x\nh u r r y\ns e m i c i r c l e\nf o o t\ne x p e r i e n c e s\nf e e d\nn u r s e s\ns i t u a t i o n\nc l i n g\nc o u r t s h i p\ng e r m a n s\np r o p e r t y\nd i s a z e\na w a y\np r e v a i l e d\nv o i c e\ns o n ' s\nu s e f u l n e s s\nm o v e d\np u c k ' s\ns p r u n g\nr e a l i s t i c\nn i n e t e e n\ns u n k\ne a s i l y\np e r q u i s i t e s\ng e r m a n y\nf e e l i n g\np r e c e d e n t\ni n f i n i t e l y\nb r o t h e r\nr e a c h i n g\nw i n e\ni n f l u e n c e\ni s n ' t\ne n e m i e s\np e r f o r m e r s\np e r f o r m a n c e\ne f f i c i e n t\no u t w a r d\ne x c e e d i n g l y\nc h u r c h\nc o n c e a l m e n t\na n y t h i n g\nc o m m e n t\nc a n e\nu n c o m m o n\ng r a n d e u r\nt r u l y\nb o o k\nd r i n k i n g\nt i l l a g e\ns a m p l e\nl o v e l y\nr u n n i n g\ns a x o n s\nw a s\ne n t e r e d\na s t o n i s h m e n t\nb r e a k\ni r i s h\np o e t ' s\nw i t n e s s\nm e n t i o n e d\ng r u m b l i n g\nm a n n e r\nr e t i r e m e n t\nc a s u a l\ns u p e r h u m a n\ns a y s\ns i c k\nn a t u r e s\nm a s t e r ' s\nh u n t e r\ni n s t r u c t i o n s\ni m m e d i a t e\nr e s u l t s\nh e r\nc h a i r\na c t\ni n v e n t i v e n e s s\ns w e d e n b o r g\nm a k i n g\nb o t t l e s\nh o u s e s\np o e t\nd a r k\nl i e\ni l l n e s s\na g e d\nl e g i t i m a t e\np u l l\ns t a t e m e n t s\nc o m p a n i o n\ni n t e r e s t s\nt h e r e b y\nm i n g l i n g\ns e i z i n g\nr e f l e c t i o n\nf r e n c h\nw i s h e s\nf a c i n g\nt e n t s\nb r i t a i n\na l s o\nt e m p t e d\ns u p e r\ni r o n\np e a s a n t\nt h i n k i n g\ns w e e t h e a r t s\nf o l l o w i n g\nr e q u i r e\np l e a s a n t l y\nm e t a p h o r\nv o l t a i r e a n\ns p a r e\nf l o o d\nd e l i c a t e\nc o n f i d e n t\nt h i n k e r\nc o o p e r ' s\nt o d a y\np r e d e c e s s o r\nv i e w s\no p e r a t i o n\nd i n\no c c u r r e d\nc o n t r a c t e d\ns u f f e r i n g\nh e r e\ni n c e n t i v e\nf o r c e\nb u l l s\ns o l a c e\ni n c o m p r e h e n s i b l e\nt r a i n\nn u t s\ni n q u i r e d\np u c k\ns p e e c h\ne s t e e m\nd i m i n i s h i n g\ni n o r g a n i c\ni n t e l l i g e n t\nq u i c k l y\nm u s c l e\nn a m e\ne n d u r e\ns t r i p e d\np a t t e r n\nr e q u i r e m e n t s\nt a l k s\na t t e n d e d\nt e m p o r a l\ni g n o b l e\nv o i c e s\nl e a v e s\nn i h i l\nm a s t e r\nd a n g e r\nf l a m e s\nb o a t\ng i v e s\nl i b r a r y\np e n n i l e s s\na m e r i c a\nh u s h\ni ' m\nw o r s e\ns h a m e f a c e d\ng l a n c e\nm a n\nt a c t\nd e l i b e r a t e l y\nt r u e\nc l o t h\nm a s q u e r a d e s\nd i f f i d e n t\nt i r e\nb r e a t h i n g\nw e a t h e r\nr e j e c t\np a s t\nt o s s e d\nl i n e\np r e c i s e l y\ns t r o k e\nw o r k s\nu s e d\na p p e a r e d\nc o n t i g i t\ng i r l\nr e a l\nw o o i n g\nd o u b t\ns i m i l a r i t y\nd u r i n g\nt e m p e r\nc\nl o c k e d\np e n k n i v e s\no m n i u m\ne x c i t e m e n t\ni n t o\nv i c t i m s\nr a n d o m\ns t r i p e s\nd i v i n i n g\nl i k e n e s s\nc a p a b l e\ni m p o s t o r\nh e l p\nw a y\ns p o i l e d\np r o p h e t s\ns a c r e d\ne n g a g e m e n t s\ns a y i n g\ne x t r a o r d i n a r y\ni s\np r o v i d e n c e\nc r a w l e y\nd r a w\no p p o r t u n i t y\ni m p r o v e d\ng l a s t o n b u r y\ns e a\nc i g a r e t t e\ne x h i b i t\np r o b a b l y\nb e h i n d\nh o m e\ns w a i n s\nj u l y\nc h a i n s\nd i f f i c u l t y\nc l a i r v o y a n t\ni\nf a c u l t i e s\nc o m i n g\nr e t a l i a t o r y\nr e s p o n d e d\nt i m e s\ne m p l o y e d\nb r o w n\ng l o u c e s t e r s\nl u c y\ns c o r n\na u g u s t\nv i c i o u s\nm u s h a\nc r y i n g\nc a r b i n e e r\nd w a r f\ng u a r d\nt o m o r r o w\ng o o d s\nr e p u l s e d\nr u b b e d\no p e r a t i n g\nc a s e s\ng a y\ns a i d\nu n k n o w n\ns u b j e c t ' s\ni n f i n i t e\np r o d u c i n g\nh a s t e n e d\nh i m\ng i v i n g\ne l s e\nl a d y\nn e v e r\nc o n c e r n\ns i l e n c e\nm e a n l y\na s\nc h a n c e d\nf i n e r\nr o m a n t i c\ns h o o t\nt h e s e\ni t s e l f\nd i s p o s e\nb e t r a y\ns h u d d e r i n g\na r e n t s c h i l d ' s\nn e e d\na r t i s a n ' s\ne s s e n t i a l l y\ns t o p\nt o o k\nc o n v i n c e\ni g n o r a n c e\np a t i e n c e\np r i v i l e g e d\ns h a l l\nr e f i n e m e n t\nd e t e r m i n e s\nm o v e m e n t s\nm o n e y\na c c u s t o m e d\nf o o t i n g\nd r e a m t\nc o l o r s\nr e l a t i o n s\na v o i d\nd i s c e r n m e n t\ns t o c k\ni n t e n d e d\nr e c o r d s\nl i v e\nr i v e r\nd e v i l\na m u s i n g\nf i d d l e\ni m p l i e s\na n s w e r\ni n t e r e s t\ne m p l o y m e n t\ne n g a g e m e n t\nm a s s i v e\nh o r s e s\ns i n t r y\na w a r e\np r e f e r m e n t\nu g l y\nf e v e r\nt h e m s e l v e s\nw r i t t e n\nm a k e s\nc r a w l e y ' s\nb e l i e v e r\nn a t i v e\nm o n t h ' s\nl a d e n\ne x t i n g u i s h\nl o u d\nh u s b a n d ' s\nt w i r l e d\nh o n o r\nf u n n y\nl e a n e d\nm a m m a\np l a n e t\ns u f f u s e d\nc o m p a n i o n s\nf a m i l y\ni t\ni n c l i n e s\na b u n d a n t\ng a l l e d\nh e a r d\nf a r e w e l l\na u t h o r i t a t i v e\na z u r e\no p e r a t e d\ns w a m p\nl a b o u r\nu s e f u l\nc u s h m a n\nr e j o i c i n g\nb a n k\nr e a s o n s\nh a s t e\ng a r m e n t\na u d i e n c e\nw e a r i n e s s\nt h r e e\nw o v e n\nh o a r s e\nw h o\ni n c o m e s\np a r i s\ns t u p i d\ns w i r l i n g\nc a r g o\nd e c e i t\ne m p r e s s e s\na c t u a t e d\nw a t e r s\nm a r v e l l o u s l y\nl a n g u a g e\nd a s h\no n\ni n v e n t i o n\ng r e a t l y\ns\ng i r l ' s\nm a n a g e d\ni n t e r r o g a t i o n\nn e g l e c t e d\na s s ' s\nd a n e s\no p i u m\nt y p e s\nd o m i n a t i n g\ni m p r e s s i o n\np r o v i n c i a l i s m\nv a n i t y\nr e s u l t\nh e a v i l y\na r i s e s\ne n d\ns c h o l a r s h i p\nr i c h\nr e s p o n d\ne n t e r t a i n i n g\nt a s t e\nr e p r e s e n t\nc h i a j a\ns u f f e r e d\ns u p p o r t\nc i v i l i z a t i o n s\nm a t t e r s\no b j e c t e d\nm a l e\ny o u r\no w n e d\ne x i s t s\nr e s i s t e d\nb r i t o n s\nl i n e r\nf a r\ng u i d e\nd i s c o v e r e d\nu n w i l l i n g\nc u r l y\nc o t t a g e\ns h a r e\no b l i g e\ni n v a r i a b l y\ni n s t i n c t\nd i s g u s t\na p p r o v a l\no p e r a t o r\nc a r e f u l l y\nn o r t h m e n\nw i t h i n\nm o t i o n\nf o r t i f i e d\ns h e f f i e l d\nf o l l y\nm a t e r i a l\no f f e r i n g\nl a n d l a d y\nb a r o c c o\nw e a k\nt i p p e d\np u r i t a n\nm e l l o w\nt h r a v e l s\ni m p a r t\nc a r r y\nc o u n t r y\np o r k\np l a c e\nr\ns t r a i g h t\nr o s e\nw h o l e\ni m p a d e\np r e f e r e n c e s\nm a t u r i t y\ns p e a k\nc o u l d n ' t\nd u k e\nw a n t e d\ns e e m i n g l y\ne n o u g h\nw a r m\nl a k e ' s\nb r a i n\ng a t h e r\nm o i s t e n\nf o r\np h e n o m e n o n s\na r m e d\ns n o r e d\np r a c t i c a l l y\na g e\ne x p l a i n e d\nf a r m y a r d\nh y d r a u l i c\nd r e w\nw o o d e d\nd i s e n g a g e\nc o n v e r s a t i o n\nn a r r o w n e s s\nh u r r i e d l y\nb r o o m\np o p u l a c e\nd e a f\np u r e l y\ng l o r i f i c a t i o n s\nh i s t o r y\nc a r n i v a l\nh a s t i l y\ne f f o r t\ns u g g e s t i v e\nu n a p p r o a c h a b l e\ne a r t h\ni n s t i n c t i v e\nb r i g h t\nd i v i n i t y\ns c a l e\nc l a y\nm u s t\ns e n t\nw h o s e\na b s o r b e d\nh e i g h t\ng a z i n g\ns t r o n g e s t\ns y s t e m\nw a r\ns u b t l e r\nl i s t e n e d\nu n e q u i v o c a l\nb o y s\nj o y\ne n t e r i n g\ns e l d o m\na d m i r e d\nw e a r\ns t o r m\nf e a t s\no u t r a g e o u s\ns h a k e s p e a r e\nf l i n t\ne v e r y b o d y\nw i t c h\nm a g n e t i c\na l t h o u g h\ns u c c e s s e s\nt h e e\nd i l a t e d\ne v i l\nr o a r s\nd o\nr e a l i t i e s\nq u e s t i o n\nc u l t i v a t o r\nb u s i l y\nu s i n g\ns h o w i n g\nb r i n g i n g\nd o w n\nl e t h a r g y\na t t e n t i o n\nr o l l\ng r a t i f i c a t i o n\nc o n t e m p t\ns u g g e s t e d\np o c k e t\nb e d r o o m\nr e g a i n e d\ns t a n d\nb e a r\np l a u s i b l e\nm e a n i n g\nt e l l\no r g a n\nb r o k e\np u r s e\ns o n s y\nb a r\np u b l i c\nh a l c y o n\nc o n n e c t i o n\nf o r c i n g\ns i n k i n g\nd i s g u i s e d\ne v e r\ne s t a b l i s h e d\ne m p e r o r s\na s l e e p\ny o u ' r e\ns l i g h t\nr e p l i e d\nb o n h o m m e\nl e s s o n\nd i e d\nd e l i g h t e d\nf r e q u e n t\nc a s t\nf i l l e d\np r o b a b i l i t y\nc o v e r e d\nh a d\nu n u s u a l\nr i d\nf a s h i o n\nf i r e\ne m b o d i m e n t\nu n f o r t u n a t e l y\np e r f e c t i o n\nd e s e r v e\nf e e t\na t t a c k e d\nf i r s t\nr e a d i n g\nb y\na u t h o r i t y\nc r y\nc o c k e\nc o l o u r s\nc o l d\nm o n u m e n t s\ns u m\ns e r i e s\ns e p a r a t e\nr a r e l y\nn o t h i n g\nb l e n d e d\nb o x w o o d\nf e l l o w s\nw o r d s\ne n g l a n d\na f r a i d\nc o o l i n g\nt o n g u e\nm a t r i m o n y\nr a c e s\ns w e l l\nw i d\na n y\nd i s t i n g u i s h e d\nm a g n e t i s m\nw a l k\na c k n o w l e d g e d\ns u c c e s s i o n\nw h i s p e r e d\nb l e e d i n g\nw o u l d\nm e m b e r\nd i s s a t i s f a c t i o n\nt h r o w\ni n t e l l e c t u a l\nt a b l e\nc h i l d r e n ' s\nt r y i n g\nb e g i n n i n\nr e l u c t a n c e\ng r o s s l y\ng o o d\ni m a g i n a t i o n\nb e c o m e\nb e a u t i f u l\ng u n t e r\no t h e r s\nf l a t t e r\nm a s c u l i n e\nt r o u b l e\nb e h a v e d\np e r h a p s\nm i t i g a t e d\nf a l t e r e d\nh a p p y\nw a i s t\nk n e w\nt a m\nc o u n t e n a n c e\nl o d g i n g s\nc o a l s\nc o m p u l s i o n\ne a r l y\ns u r p r i s e d\nd i m i n i s h e d\ns h o w s\na g o\na c k n o w l e d g m e n t\np e d a n t\np r i v i l e g e\ne n c h a n t e d\nb a n t e r\np r o b a b l e\np r a y\nd e s t i n y\np e r v e r s i t y\ni n c u m b e n t\nr h i n e\nl i n e s\nb u r i e d\nw a s t e d\nb a t h e d\ns e v e n\nc o a s t\ns e c o n d l y\nr o s e t t e\nv e r s e s\np r e p a r e d\ns w e e t h e a r t\ns t e r n\nc r e a t i v e\na p p r e c i a t e\nc a u t i o u s\nw h o m\nd e l e c t u s\nh a n d s o m e\nm a r r i e d\ny i e l d i n g\nk i n g ' s\nr e m i t t e d\ns h o r e\nf i e l d s\nf u l l e s t\nd i m\nd e s c r i p t i o n\nc o m p a n y\nl u c k y\nm i d\nb e e r\nc o n s c i o u s\nd e c r e a s e d\np r e a c h e d\ni n c l u d i n g\np r o t e c t e d\nt h a t ' s\nf o r m e r\nm e a n t\nj o i n t"
  },
  {
    "path": "data/smoke_test/vocab.pruned.txt",
    "content": "spot\nword\njaunty\nnearer\nheavy\nbell\nflint's\nmoralist\nresolved\neighth\neuropean\nmouth\nmissus\nmoss\nparty\npale\nmill\ncelts\ndispensed\nfrankly\nsympathy\nmad\nflattered\ndevils\nvomit\ncontinued\nleave\nphilosophy\nindemnity\nwaited\nnet\ntested\nsaxon\nprotective\nglitterin\nprevious\ndead\nlearn\nforth\nletter\ncares\nabove\nexcellences\nflaubert\ngrammont\nemployments\npreparatory\nexhausted\ngravely\nvoltaire\nfifteen\nintimacy\nreasonably\nmire\neggs\nhumble\nsomething\ndamage\npoetry\nmingle\nlow\nstick\nv\ncoverless\nfell\nmet\nsilent\ncasts\ntroth\nonly\nlived\nus\nreasonings\ngait\nseventh\nhumbug\nstriving\nhabit\ngeneral\ntaken\nattracted\ndrained\nworthy\nsecret\narrive\noff\nclouds\nhand\nthem\ningenuus\ninevitable\neagerly\nmelody\ncunning\nvoluntarily\ngold\nblood\nthan\nconscience\nbreaking\nnature\ncolor\nattitude\nwhere\ndisposes\nstoreroom\nimperfect\nanger\na\nsystematically\nrelieve\npacked\npleasure\nflatteries\nslur\nacceptances\npeculiar\nbestowed\nlabyrinth\narrived\nventured\nsociety\naffairs\nafternoon\nwheels\nprince\nchime\neach\nbeats\ndistempered\nnaturally\npersonal\nreputation\nevening\nvaste\nmadame\nl\ninsidious\ncetera\nsmothered\nclothes\nnoticed\nwonders\nblue\nsuggestion\nforrest\nmorning\nmeditated\nartillery\npasses\nimpose\ncertainly\nbusiness\nfathers\nnay\nintoxication\nunexpected\nstroking\nbut\nrepeat\ndisturb\npossibly\noh\naccept\nlips\nplease\nheartily\nacquisition\nenjoy\naccentuation\naccounted\nsweet\nfixed\ndefinite\nvigorously\nproblems\nfollow\nmanifested\nfastin\ndelays\ndrawn\nevening's\nislands\nbetween\nnotwithstanding\nterribly\npassion\nready\nsuperimposed\nexpectations\nreligious\nrespects\nself\nemotional\nmade\ninvariable\ncontemplate\neffects\nimmoral\nrested\nmainmast\nstrings\ndesign\ncapacity\nadded\nunload\ndon't\ngreater\nspecial\nleft\nless\nought\ninexpressive\ndrama\ncharity\nexcuse\nforeign\nother's\nstyle\ncongratulations\nenmity\nfair\nthirty\nso\ntop\ndiaphoresis\nforward\nstage\noutside\ngrew\nscowl\nfree\nport\ngrenadier\nunderstanding\nstrained\nservices\ndisagreeable\nwhen\nanomaly\nblame\ndays\nmerry\ncomplaisance\nobtained\nfluid\nmedium\ni'd\nprivileges\nrag\nhaggard\ninaudible\ndevotion\nunconsciously\nrock\nhonesty'\nround\nsevere\namount\ntankard\npainfully\nenclosures\nsettled\npleased\nyourselves\nshelved\nhours\nchaste\nhereditarily\ncomes\nmarvelous\nyea\ninconsistency\nhardest\nsteps\nriddle\nsuit\napplications\nprofundis\nsanctified\nex\nsins\nnoise\nuttered\ndiscoverer\nnoble\nrider\ncross\nawoke\nhimself\nmeans\nfelt\nunderstand\nspanish\ndefending\nexpress\nskies\ntwilight\ncornered\nprospect\ngods\nsoever\nare\nredoubled\nmachine\ntwenty\nmix\njudging\nutmost\neventually\nexciting\nbeg\nlunch\nsenses\no'shanter\nconsiderable\ninfantry\nedge\nclerical\nitalian\nangel\ndreams\ntension\nmirth\nfilterin\nstruggle\nwill\ndefine\nladyship\nd'epinay\nobjective\nunconsciousness\nwe'll\nwholly\nartist's\nlodging\npile\nnumber\nbedclothes\nmeat\nroasted\nfirstlings\ncomfortable\nslow\nsupersede\nshred\ncourse\nplaces\nagainst\nsecuring\nproblem\nsat\nlose\ncures\nincome\nvisions\nponderously\ndepends\nconcurrence\nbegan\nsake\neve's\ndrown\nconscientious\nwaves\nassent\nthence\nfalse\nfreethinker\nacquaintance\nstare\nmark\npacket\nshaftesbury\nhearers\nnicely\nsubstance\nextends\nstared\nhaired\nwound\ncharioteer\nsee\nthy\nfingers\nsilly\nmusical\nfit\nglazed\ncharge\ndirected\nencouraged\nparish\ndeceiving\nstarting\ngallantry\nplainly\npardon\nmanifest\nfault\nhasty\nslumber\npiteously\nevoke\nwith\nnearly\nheart\nthat\nmankind\ndisposing\nbritish\ninteresting\nfloor\npain\nabsolutely\nholy\nclosely\nutility\nbristol\nimportance\nrecovery\nsoft\nfig\ntuppence\ncentury\nexpensive\nedition\nadam's\nsupply\nsons\nwire\nshields\nguided\nbeating\nhour\ncheaper\nten\nbelief\nprove\ntheory\nfully\njanius\nam\ncurious\nexhibits\nnow\nsang\ntelegram\nmisunderstand\nthrone\ndoctor's\nyouth\nconfessions\nexperiments\ngoldenness\nbreath\nborne\nmode\nlast\nalps\nhard\nsickness\nsuggestions\ncorridor\nhalf\nfeatures\nconcisely\ndiscussing\nthere'll\nsynthesis\npresumably\ncerebral\npursuits\naccording\nrepugnant\nwait\nthorn\nbruised\nstave\nbaby\ncroaked\npower\nhowever\npractice\nbaycon\nbefore\nremember\nspectator\nbabies\nproof\nireland\nphenomenon\ndistinguish\nlightly\nchain\nnearest\ninfant\nstation\nproduct\nset\nsheepish\nprayer\nfemale\ncomprised\nprofession\nbarbarity\nexperienced\nfool\nuninteresting\nd'ye\nnihilo\nexercise\nobstruckt\neighteen\ndiffer\nprice\nuttermost\ndesperation\nspeculation\nlouder\nspeculations\nfakirs\nrhone\namiss\nship\npiano\nrealms\nseemed\nsolitary\nscraping\nconsidered\ndouble\nmaybe\nsupreme\nwholesome\nflotsam\ncreated\nbedside\nsowerby's\nbills\nsuppose\nhonourable\nsensitive\nmoralists\neasier\nstood\ndistrict\nask\nbilly's\nbitterness\nwidow\nthought\nmedical\nnext\narose\npantomime\ntreasure\npeevishly\nwhat\nlisteners\nserved\nhighly\nresumed\nthose\ntravelling\nrule\nentrenchments\npartly\nmercy\ndoubted\ngiven\ndeep\ntake\ngentlemen\nreformation\nabbey\ncommunity\nfinger\nchicken\nobedience\nwives\nthrown\ncompose\nunintelligible\nmain\nclosed\nclassical\nm\npulling\ncontagion\nsir\nempty\nmistress\nsubmissively\nscruple\ncivilization\ntobacco\nalmost\nlabelled\naccompanying\naboard\nundoubtedly\nlofty\nsometimes\nacquaintances\nlittle\ncreator\ncommodious\nsomewhat\ntwentieth\nnotices\ndebt\ncreature\nseyffert\nwrinkled\nboundless\nspectators\nbecause\nweek\nspecified\ngown\ncastles\nwaiting\ntells\npopular\nnecessary\nceremonial\nquietly\nfriends\nprecise\nsufficiency\nhonesty\ndecline\nscientific\nterror\necho\ngriddle\nbarchester\nfundamentally\nkept\npushing\ndistressing\nuse\ntay\nconduct\nintense\npeace\nshould\ncultures\nquite\nlowered\nprodigy\nsowerby\nduty\nchildhood\nstaggered\ntruth\nlandscape\noffer\naction\ndean's\nlooks\nworship\npeerage\ncrack\nfirm\nounces\nmistake\nnoticeable\nloading\nown\ndismissed\nwhere's\nware\nelevations\nespecially\nwrote\npresence\njourney\nshakspeare\nwhatever\ndenied\near\nmeadow\naisy\nsubject\nwaste\napparatus\nastuteness\nponderous\nsplash\nlaughed\ngranting\naltogether\ncough\nservants\nlest\nbeginning\nsmoke\nletting\ncause\ntry\ndivine\noccupies\nheroes\nthere's\none's\nkeep\nreaders\npost\nbooks\nhardly\nrapid\nsleepy\nenduring\naffords\nsleek\nviscount\nreadily\npersisted\nreins\nunforeseen\nlap\ninstrument\ndetermined\nnor\nintently\ndiscover\nvexation\npupils\nartisans\nstarvation\npurchased\nmounted\nday\nsigmund\nlaid\ngreat\nfew\nentirely\nextreme\nconsiderably\npolemical\ngod\nmoribus\nlowest\nrather\nexpect\npoint\nbroth\nman's\nanxious\nintercostials\npony\ndrawers\nphilosophers\nneeds\nshow\nmedicatrix\nreflects\nsnug\ncame\nexpense\nspirituality\nspring\ndevoid\ndealing\nsecondary\ngetting\nchest\nkind\ndefective\nstruggles\nspain\nfanny\nstalked\ndexterously\nthinks\nyes\nbags\nfaint\nknown\nold\nwipe\ncalling\nrunnin\nresponsive\nrightly\nfuriously\ncharacter\npeople\nye\nmountain\nimaginary\ncontrast\nthither\nworked\nwalking\nyounger\nexpected\nmechanical\nsell\nridicule\nperfected\noverlook\nenthusiasm\nhypnotism\ndoor\nfamiliar\ndreamland\nthrough\ncall\ntrousseau\ndelight\nalone\ndistricts\nflows\nblank\ngasping\ndiscouraging\nmodest\ndescribes\ntouched\nuneducated\nsculptor\neater\ncoloured\ndegree\nwere\narabin\nlistening\ntoned\ncharles\noutlook\nvain\nhere's\nwretched\ndiscovering\nsongs\npages\nreceived\ncongestion\nbowed\nunited\nsuppositious\nseat\nadvantageous\nwhisper\nlaw\ntract\nbob\nflowing\nterms\nhuman\ncradle\nreturned\nrack\nbad\ntired\nshape\nassistance\nlonging\npunctually\nhundred\nmiddle\ndykes\nenergy\nmadness\nunselfish\nabundance\nview\ncure\ntemple\nexalted\ndevelopment\nobject\nyears\ntea\nendowed\nspirit\nstables\nbag\nperfecting\njustice\nredriff\nhousehold\nlaughter\nthroes\nwaking\nlook\nmany\npassages\ncare\ntruckling\nshrieked\ndistance\nhe'd\ndesire\nstraitened\nsoon\ntold\nintensely\nfancies\npurchasing\nmarry\nhypnotizer\ncase\ngarden\nmanaging\nlumps\ndetermine\ndangerous\nresolve\nperceive\nlids\nparson\nland\ngoes\nwend\nloftier\ndoctors\nbest\nweeks\nparodists\npersonated\nplaying\nnorthward\nhostile\nremain\ncommercial\ni'll\nsaffron\ncondition\ncan't\ncompanion's\noperas\nquestionable\nnarrative\ntrunks\nstroked\nstable\ndesirable\nprey\nefforts\nmean\nartery\ndaughters\nsunken\namounts\nimproper\nenergies\nboth\nattach\ntediousness\nwish\ncredited\nsatis\nsitting\nbutter\nathenian\nchord\nabsolute\nstatue\nsmiling\nlearned\ninnocent\nhorse\ngrasp\nquarter\ncorrespondent\ncoursed\nsleepless\nwife's\nsecond\npointed\ntraditional\nvictoria\nbath\nhid\net\nfashioned\nfather\ninch\ngrace\nmind\nthen\nscarcely\nkisses\neverywhere\nstipend\npulse\nrestrain\nsummer\ncloud\nrapidly\nwoods\nsister\nremark\ndespise\nhook\njim\ncontiguous\nrichmond\nframley\npope's\nsection\ncounting\nall\nnobody\npass\ndoom\nsummon\nfear\nincredulous\ndine\ndocumentarily\nreserved\npermitted\nhumblest\ncharlotte\nbe\ndreamily\nassumes\nmere\nspoke\nqualities\ncaptain\ndelusions\nancients\nnotice\nsignal\nfacilitate\naccordance\nwishing\npreoccupied\nnovel\nsneer\nsubjects\ninformed\nchanges\nperfectly\nspiritualises\ndancin\nbased\nsmooth\nways\ncandy\ntrees\nin\ngenial\nexperiment\nindeed\nportion\noperations\nbelongs\nprostituted\noften\ngreen\naudacity\nmesmer's\nuglifying\ndifficulties\nobeyed\nloving\nhunting\nfurnished\nhypnotists\nentrance\ntender\ndivert\ncroup\nthink\nclasped\nlike\nconfusion\ncommitted\nfolk\nforgive\nrocks\ninsinuated\nglowing\ncongenial\nsmiles\ncraft\nground\nsame\nworld\ntranscendental\npowers\nlock\ncompletely\nassumed\nwhoever\nsleep\nshameful\nharangued\nsong\ndeclared\nqueen\nbroomstick\nup\ndegrees\nsubjective\nbrigaded\ninsensible\napart\nrecommend\npounds\neducate\nrecruits\nendeavour\nconfidence\nseems\nexpert\ndoubtless\nmail\nover\nvolunteers\nfood\nthousand\ndefined\ncompelled\nsides\nglory\ndevotees\nledge\ncarried\nhadn't\nluxuries\ndevice\nmorally\nprofessed\nexpression\nassist\nsingled\ngone\nstretched\nlitanies\nbarbarians\npococurante\nalfred\nterrible\nbrass\nworld's\nboy\nwater's\nbelieving\nplanets\nfastidious\nnot\nenjoyment\nspite\nhow\nwork\nloudly\nconcealed\nphenomena\nminute\nthem's\nmeek\nwells\nworst\nfactors\nspiritual\nappetite\nsolemn\nthere\ndoable\nshared\ncostume\nengross\nmystic\nweigh\nloss\nmorrow\nsounded\npoker\nverdure\nfulfil\nwilling\nsight\nmusketry\nfleet\ncommentary\nhope\nwood\nunegoistic\nintention\nancient\nrelished\noccupied\nthoughts\ncommunities\ncorrespondence\nperson\nnowadays\nremit\ndesired\ndeveloped\nstayed\nindifferently\nstealthily\nexperimented\ndire\nale\nsearching\nmight\nyellower\nnatural\ntears\nincreased\nagreed\nhomer\nromans\npreviously\nsheet\naspects\nslipped\nnon\nreflect\nimpersonating\npanting\nwetted\ncerebrum\ngrown\nardent\nhappiest\npossible\narms\nclergyman\nreturn\nenglish\nunhappy\nshed\nmentally\nhelvetius\ngenus\norgans\nproduce\nwants\npaid\nlegs\nvarious\ngainsaid\ntrust\nelements\npole\ninventing\ninterested\nchase\nnaivetes\ndoing\nits\ncurate\nwagner's\nnewsboy\nblushed\nlovelier\nresponse\nworth\nfare\npromise\namuse\ndomestic\nstep\noccasion\nragged\nbirds\nmurmur\ndeception\nmisfortune\nfast\nholding\nparadoxical\norganic\ninduced\nplatform\ncrayture\nmoralistic\nsermons\ncocke's\nknow\nmeantime\nshouldn't\ncent\nesprit\nturned\ngentleman\nperceptions\nimmediately\nadvocates\nannealed\noranges\none\nspoken\npuer\nfrom\nadding\nnelly\ncomparatively\nhat\nlonely\nrefined\nadmire\nbundle\nstay\nisle\neyes\nbrains\nthird\nturn\nendless\ndemeaned\ngrantly\nfavourite\nopinion\ndressed\nhearty\nbig\nsmiled\ndescriptions\nmemory\nfull\nrefulgent\nconsiderations\nmethod\ngaliani\nsacrificer\nshakespeare's\novershadowing\nsavoured\nhonest\nsumner\nvoyage\nah\ngild\npapa's\nsemi\nidea\nreality\nsecretly\nremained\nknows\nhedonism\nordinary\nrequired\nbond\ndelusion\ndisturbance\ncommonly\nvienna\nacquiring\npassed\ngrin\nphysics\ncontrolled\nresounded\nminds\nwater\noriental\nsixty\ninasmuch\ngot\nglad\nsheep\nearns\ntewkesbury\nobliging\nfiercely\nwrite\nrare\nmighty\npretty\nregarded\nwedding\nearnest\npractise\ntasted\nhaven\ncalls\nwhether\nthis\ncoaxingly\nforest\nvivid\nconvinced\nspinster\nmeet\nstupidity\nlooked\nindividual\nability\nrhyme\ncheerful\nnursery\nangrily\nshe\nabsent\ndashed\nfrantic\nmembranes\nmismanaging\ncorresponded\ncaptious\nwotan\nsarve\nor\ncondemning\nmoving\nverbs\noverhear\nstall\ndeepest\nstairs\nappropriate\ncalmer\nlaughing\nlying\nsensation\nfestival\ncomplete\nsuffice\nconfide\nquiet\nhappily\nfaculty\nunfavourably\nwasn't\ntill\nlooking\neyelids\ncomfort\nclaim\nexclaimed\napplause\nrides\nmuttered\nforgetting\nbobby's\naccent\nsuggesting\nprebendary\nstanding\npencil\nwarthin\nrussia\nmusic\nchose\nfurther\nlucy's\nfront\nappearances\nyou\nabout\nbroad\nmonth\nfinished\naccuses\nprime\nvice\nprofessional\nboard\nwonderful\nif\ndid\npersons\nraise\neurope\nfalsehood\nangry\naccompanied\nruffled\nfalmouth\nbeggar\nsingle\namerican\nunlucky\nintroduction\nproper\nartibus\nchaps\nsuspicion\nside\nhappened\ndownwards\nout\nrisen\npossessed\nthey'd\nparticular\nindifferent\nsank\ndaresay\nconceive\nestate\nhumanity\nopens\nbarley\ncathedral\nstone\nproduced\nchannel\nremembrance\njames\ncrowd\ndrive\nlondon\nwomen\nsanguineous\ncaused\nprolonging\nperceived\nchance\nconjunction\nregretting\nput\nwhich\nperform\nclairvoyance\nyear\nshortcomings\nprejudiced\nenchanting\nobserve\nlarry\nstopped\npeasantry\ndisplacing\nconversing\nscore\nally\nbehaves\naccord\nstudied\nexhorted\nbaltic\nrefreshment\ncircumstance\nkiss\nplunged\nmost\ndelay\nguava\npictured\nbilly\nmoreover\npretentiously\ntried\nthereof\nstiff\nbelieved\ncoldness\nrest\nheroism\nuproariously\nexisted\nprincesses\nimprinted\nunlikely\nintimate\nchildren\nsend\nmountain's\nheap\nbroken\nactions\nsymptoms\nforces\ndoctor\nphrase\nbase\nsorry\ngoing\npassing\nrank\nlabyrinths\nfeels\nmutual\ninexpressiveness\ne\nreply\nexample\nconsequently\nallow\nwhiff\nhorridly\nsure\ncharlatan\npot\nsuch\nsense\nnew\nadvantage\nawake\nfreedom\ncrusade\ntrembling\nain't\natlantic\no'clock\nbound\ncabin\nprompted\nmoments\nspeaker\nseason\nsing\nfakir\nexpedient\nprofits\npraise\nnineteenth\nshindy\nforehead\nscotch\nconstraineth\nsupper\nvalhalla\nsacrifice\nhomeric\nwhite\nexplanation\nhypnotist\nsufficient\ndear\nstuff\nexpand\npessimism\npatients\nnorth\nwicked\nstars\ncorrespondience\nrecruit\nfearfully\nchapter\nelegant\ntrick\nprices\nsix\nwinter\ncheap\nstream\nrevenge\nstellar\ndeal\nmoon\nbeyond\nbecoming\nrepulsive\nmystical\ndeanery\nsmall\nahead\nye'd\nbetter\nswords\nliving\njelly\nbolder\nvery\nplayed\ntreasures\naccepted\nhectic\nreverend\ndestruction\noxen\nbrought\nspreads\nmore\nindulge\nvault\ncome\nhe'll\noffered\nride\ncoach\nconsented\nn't\nget\nsubmitted\nsounds\ndegradation\nstalk\nlatin\nimperfectly\nalways\nbreakfast\nneither\ncried\nsensibly\nvast\nfield\npleasant\ncarriage\ngave\nfall\nideas\ntaxed\nlives\nbonbons\nutilitarians\nseventy\ntime\nmyself\nrayson\nmay\ncounty\nsundays\nars\ntherefore\npriests\ngroup\npromised\ncordiality\nconsciousness\nsoul\nmysterious\nchansons\nnone\ncaston\nhigh\nbobby\nhitherto\nfather's\ncircus\nour\nthus\nninety\nlight\nstrong\nlong\noperates\nrevival\ntolerably\nrepeating\nchamber\nultimate\nsolicited\nrespiration\nliquid\nmegantic\nlikes\nanglo\ninvisible\nopen\nmultifariousness\nchaos\nunder\nscalp\nreally\npinch\nrarer\nagreeable\nobliged\ndisguising\ngently\nfairy\nruin\nconcurred\nwrapped\nof\nexert\nvales\nfreely\nfix\nrespectably\nmalice\nmuch\nparticularly\nbetwixt\ndrawing\nnigh\nescaped\nphilosophizing\nhypnotic\nhypnotized\nmeasure\nunderstood\nmeanwhile\nsugar\nbravery\ngreasy\ngrand\ncooke\ntorrent's\nsublimer\nplebeian\ncostumes\nheaded\nnonsense\ndoesn't\nstate\ngrowing\nobeisance\ndropped\nbeen\nfirmly\nregular\npetting\nprofoundly\nmotives\nstooping\nbeings\npossibility\nhybrid\nhouse\nharmony\nlamp\nvirtue\ndifficult\nmodern\nhighway\nusual\neudaemonism\nscholar\nsentiment\nseeing\ninner\nmine\nwind\nreports\nbasis\nfail\ntraynor\nbless\nlodged\ndinner\nwalls\nsevern\nsandy\nalready\nill\nsixteen\nclose\nresidence\nsharp\nlake\ntidings\nhesitatingly\nclothing\nobservation\nrecognized\ntraversing\ndaughter's\nwithdrew\ngenerally\nheaven's\nunconscious\nmusing\nconfess\nchange\ndug\nforged\ndominate\nwhereby\nfrance\nleast\noverspread\nknowledge\ncorinthian\nstruck\npicture\nclothe\nay\nstair\npresent\nstates\nson\ndamask\ncommanded\nnaples\ninstance\nbecame\nsnapping\nwent\nre\ngradations\ntakes\nchild\nkindness\nbookshelf\nstart\naristophanic\nfeel\nquestioned\nletters\nfrequently\nappear\nremains\nselling\nhypnosis\nflung\nirk\nback\nworn\nhanoverians\nstimulation\nkitchen\nyawl\nhappiness\nhigher\ngo\nproximity\ncornish\nhandle\nspirits\noffers\nrelation\ngame\nquincey's\nspeakin\ncould\nhands\ndevilry\njudiciously\npotatoes\ntalked\nclergymen\nbought\nevident\nbow\nadvance\ncrime\ntwo\neducated\neaten\nguilty\ntowards\noccasions\nridiculous\nafford\nintellectually\ncounter\nhaven't\nears\ncheeks\nfat\nnight\nutilitarianism\neager\nrigid\ncorner\narrange\nstandard\naristotle\nputting\nwales\npicked\nwe\nfaces\nunable\nimportant\nhead\ninside\nsold\nbed\nshoe\ndome\nexperience\nbelieve\nthey\nmagnetizer\ncolumns\npick\nsin\nquack\nrecited\nomission\nfinds\noperators\nartisan\nwindfalls\nyork\nvacant\ndervishes\nfancied\nanimal\nbob's\nimpatient\nhis\nprebend\npressed\ncheek\nhanding\nmodes\nhogglestock\namong\ncannot\nlarge\nprofessionals\nthrew\nprocess\nsentiments\ndone\nbeing\ncontent\nserene\nbearing\nstarted\nperiod\nlord's\nmarthieu's\nwanderings\nincreasing\nclung\nbread\nreflections\notherwise\nundefended\nsplendid\nhopes\nbelonging\nsound\nbrushy\nivory\nequally\nsomeone\nordered\nsorra\nthrives\ndistribute\ngaunt\ntale\nunceasing\ndismay\nsad\nglassy\narticle\nlufton's\neven\no'ercasts\nshallow\nnine\ndifferent\ncloths\nmiss\nappeals\nandrews\nwhip\no'er\nforgot\nsoothing\nwest\nunjust\ngrammar\node\nwrong\nstrength\nmarked\ndrink\ngardener\ninjury\neasiest\nperformances\ntouch\ncornwall\nmysteries\ntelling\nretreated\nwall\nakin\ndeeds\ninstead\ntastes\nwretch\nsystems\nmatch\nlancet\nafoot\nstonehenge\nstating\nsnakes\nexhibition\noars\nto\npresentation\nlufton\nseated\nnational\ndue\nworthless\nspeculate\nsupposed\naverage\ngroom\ndesinteresse\nfirmament\nchoose\ncommenced\nturf\ngrievous\nentrapped\nfarmer\nequal\ninterval\nevidently\nphysic\nsuperfluities\nhumour\nprovide\nuntil\nproperly\nduties\nexcess\nartful\ndirection\ndestined\nsigh\nsteadily\ngoody\nintroduce\nreturns\npillow\nmorals\nprogressed\nrip\ndiscoorsin\ncheerfully\nopposed\ngriselda\ndemi\ndistress\nambition\ncultured\nstory\nresist\nvisits\nslavery\ndeceive\nphilanthropy\nhonour\ndiffering\nmourn\nfornint\ndrowned\ndriven\nhusband\nsaturdays\ncoincidence\nsenateur\nhalt\nmanage\ncorporal's\nfountain\nundergoing\nlife\nalong\ncomplicated\ngesture\nlost\ndance\npurchaser\nmoralizing\ncuriosity\ngod's\nbeaten\nchief\ndecided\napologetically\nclasses\ngenuine\nmotor\nshop\nfortune\nsuns\nroar\nrocking\nsuiting\nred\nrelationships\npunish\ntendency\nhorace\nfulness\naround\nrepeated\npsychologist\nexpressly\nsince\noccasionally\nfound\nendeavors\ntwice\nobserved\nlisten\neither\nomitted\nfrighten\ncalmly\ncareer\nsteady\nscene\ntear\nfollowed\nsatisfy\nbasket\nspangles\nfrinch\ntitle\nbackwards\ndies\nhandkerchief\nseduction\nowing\nirritabile\nsafe\ndiscussions\nzeal\nscenes\nchaffed\ncoat\npatient\nvisit\nblunders\nfitted\nfumes\nwhat's\npurpose\ndoctrine\ngilded\nsay\nshaded\nbox\narrogance\nromanized\ndam\ndragoon\nconversed\nadmiration\nexternal\nan\ndreadful\nconsort\nheightening\nsit\ngathered\nfury\nmass\ncareful\ndigging\nwomen's\nremote\nmilk\ngorged\nolivia\nwell\nmalvolio\nbounds\npin\nbull\nculture\ndiscussion\nmisfortuned\nbring\nsilver\nnear\nitching\nfive\nagent\nliked\ntype\nlawyer\npapa\nthoughtful\npoor\npeeped\nwalked\nclear\ndiscloses\nmocking\nnamely\npreachers\nopened\nclass\npersuade\ntemporial\nwashington\ngradually\nhypnotization\nhunt\norient\nsomerset\nsubjugation\nperspiration\ndiversion\nfootsteps\nbelonged\ntreats\nthe\nexpresses\nherself\ntent\nleaving\nsighted\nhandin\nnote\ntall\nhero\ndeath\nprinciples\nreason\nopening\nhers\ndaughter\nseductive\nob\nvague\nhave\naddressed\nends\nincrease\nmorris\nfind\ncorporal\ninquire\ninmost\nface\nimpatience\nflogged\nlonger\ncrawled\nsurged\noriginal\nenthusiastic\nopposite\nye're\nhypnotizing\nsurrounders\nper\nweatherin\nclumsy\nfresh\naccess\nseveral\nbuy\nconcerning\nuntrue\nand\nsuchlike\nmoment\nfellow\nthoroughly\nsending\ngroaning\nquantities\ndomain\nourselves\nsatisfied\nlot\nshort\nhot\nlove's\nmister\nsmile\nt\nshame\nnewspapers\ngoldsmith's\nbody\naccountable\nmy\ndislike\nflowers\nstrange\nappertain\nadvertising\nopportunities\nminutes\nutterly\nspent\nrespect\nrelieved\nmoralities\nrocky\nanswers\ndescribe\nactivities\nforwards\ndroppin\nanother\nyoung\ndenial\nenjoyed\nsuddenly\nheartiest\ntone\ndozed\nsanctity\nliterature\nnevertheless\nsubtle\nfour\nsubtlety\naffair\ncowld\nclad\nrelinquished\nopenly\npsychic\ncents\nll\nrespiratory\ntalk\naristophanes\nhysterical\neight\nsixth\nirregular\nwife\nbit\nyet\nmother\nscanty\ndisinterestedly\nbutcher's\ncrusades\nlord\npath\nspeaking\ngrandfathers\nsupplied\nobeying\ncompatible\ncherish\nrise\naddicted\neffect\nspread\nadditional\npining\ngodsends\nextent\nhe's\napproached\natoning\nwhile\nflorentine\nappearance\nspeedy\napril\neuropeans\neye\nvaluations\nsatisfactory\narm\nschool\nworldly\nmerely\nladies\ndisturbed\nmeditations\neverything\ntrusted\nwon't\nraiment\nafterwards\ncrowded\nknees\nriding\nprinciple\nmatter\nscrewing\nproves\nfinally\npay\npleasing\nbutler\ngive\nearlier\nshook\npresently\nalbany\nenormously\nsome\nforms\naffected\ngliding\nintensified\nwant\ncloser\ngreek\ncalled\nking\ncontradictory\nanxiously\nraised\nsnares\nreached\nwithout\nasked\nfaster\nchristian\nmerits\nmelancholy\nsincere\nno\nautumn\npresumption\nlover\nafter\ncraggs\nart\nhypnotize\nimmeasurable\nassuring\ndilate\napplies\nventure\nwonder\nschools\nunfaltering\nsubsequent\npuzzled\nsomehow\nhollandia\nunnumbered\nonce\nevery\nform\ncooler\ntogether\nplums\nwalks\napportioned\nthough\ncharms\nreturning\ncenter\ntide\nafterward\nbentham\nsaw\ndrowsy\nfixing\nherbert\ndesires\nloves\nshowed\nthings\nacross\nfondled\nlater\nwide\nstorms\nblind\nintelligence\nbodkins\nkinds\nhexameters\nmaid\neasy\nvessels\nfaix\ngingerbread\nreduce\nfollies\nplentiful\nwild\nadmit\nrun\nmeeting\ndoll\nagain\nhistorical\nkindly\npoorly\nanswered\ncommunicates\nmuff\nfriend\nfro\npricking\nentertainment\ncauses\nmunificence\nme\nrecurring\nuprooted\ngreatest\nconcoction\ncoarse\nauthentic\npride\ntwelve\nshowman\nringing\ndidn't\nilligant\nmilford\nballads\nstill\nde\ncourage\nobvious\nit's\nsuccessful\nbalance\nrate\ncommand\nunconditionally\nmorality\nwhirled\nfact\nhereafter\nutter\ncan\nlove\nhug\nrequires\naside\nthunderstorm\ndoes\nphrases\nconsider\nprecocious\nzola's\nevents\nlourdes\ninward\nconstantly\nwhy\ncanvas\ndrinker\ncleared\nplainward\nmake\ntimber\nscheming\npoets\nsluice\nones\nsiege\nwash\nmilton\neast\nmoral\nwhither\neating\ncertain\nfine\nattendance\ndescribed\ntemperament\nbegged\nriches\nmen\neleven\nsimple\nunclasp\ndemocratic\nparsonage\ntune\ndream\nmechanism\nother\nmanifestations\nnarrow\nat\nrobarts\nturning\nconvulsive\nsaltpetre\ndeeply\nclean\ndwarfs\nteaching\nrelief\nable\npapers\ncuracy\nhammer\nproudly\nmediocrity\nvirtues\nanyhow\nhardness\nhaving\ndisturbs\ntend\nread\nsacret\ndiscipline\noffice\nliberal\nsoftly\nprotect\nmotley\ncomforts\nhair\ncontrary\nsensations\ncredit\nupon\nfinal\ntingling\nmask\nspiritualising\nair\nrespectable\ngrey\nled\nbare\ncircumstances\ngallon\nengaged\nhearthstone\ngoodness\ncontrol\nfools\nyellow\nisland\nhear\nbrother's\nplaced\namused\njust\nprofound\nnumb\naccidental\nblessed\nwigs\nsearch\ncharlatanism\ncrackled\nhe\nasking\nprotest\nabsence\ngaze\ntendered\nbursts\npart\ndiscouragement\nincidentally\nquote\nfinery\ntaking\nhold\nabounding\nscissors\nweaker\nexplain\ntoo\nmisfortunes\nships\ndemoniacal\nbent\nlet\nright\nsort\nwished\nthing\npresents\nglibly\ntis\nshine\norder\nfailed\nlay\nchiefly\nexpressed\nseen\nscarred\nimpossible\nregards\ndeafening\nlaugh\nroom\ndandy\naccounts\nformerly\nimpersonations\nmood\npope\nheiress\nacres\nnews\nwoman\ncourting\njove\naccount\nwandered\nlatter\nadopted\nwouldn't\nstrive\nafear'd\nbadly\ncounted\ninvoluntarily\ntheir\ngirls\njumped\nstrictest\nhealers\nhas\nvirginia\nappears\ncut\nreduced\nblister\nremembered\npromotion\ninjured\nclaims\nfrontal\nnormal\nhealth\nprotested\nboldly\nspending\nmoorish\nreligion\nbecomes\nfuture\nsex\nhurry\nsemicircle\nfoot\nexperiences\nfeed\nnurses\nsituation\ncling\ncourtship\ngermans\nproperty\ndisaze\naway\nprevailed\nvoice\nson's\nusefulness\nmoved\npuck's\nsprung\nrealistic\nnineteen\nsunk\neasily\nperquisites\ngermany\nfeeling\nprecedent\ninfinitely\nbrother\nreaching\nwine\ninfluence\nisn't\nenemies\nperformers\nperformance\nefficient\noutward\nexceedingly\nchurch\nconcealment\nanything\ncomment\ncane\nuncommon\ngrandeur\ntruly\nbook\ndrinking\ntillage\nsample\nlovely\nrunning\nsaxons\nwas\nentered\nastonishment\nbreak\nirish\npoet's\nwitness\nmentioned\ngrumbling\nmanner\nretirement\ncasual\nsuperhuman\nsays\nsick\nnatures\nmaster's\nhunter\ninstructions\nimmediate\nresults\nher\nchair\nact\ninventiveness\nswedenborg\nmaking\nbottles\nhouses\npoet\ndark\nlie\nillness\naged\nlegitimate\npull\nstatements\ncompanion\ninterests\nthereby\nmingling\nseizing\nreflection\nfrench\nwishes\nfacing\ntents\nbritain\nalso\ntempted\nsuper\niron\npeasant\nthinking\nsweethearts\nfollowing\nrequire\npleasantly\nmetaphor\nvoltairean\nspare\nflood\ndelicate\nconfident\nthinker\ncooper's\ntoday\npredecessor\nviews\noperation\ndin\noccurred\ncontracted\nsuffering\nhere\nincentive\nforce\nbulls\nsolace\nincomprehensible\ntrain\nnuts\ninquired\npuck\nspeech\nesteem\ndiminishing\ninorganic\nintelligent\nquickly\nmuscle\nname\nendure\nstriped\npattern\nrequirements\ntalks\nattended\ntemporal\nignoble\nvoices\nleaves\nnihil\nmaster\ndanger\nflames\nboat\ngives\nlibrary\npenniless\namerica\nhush\ni'm\nworse\nshamefaced\nglance\nman\ntact\ndeliberately\ntrue\ncloth\nmasquerades\ndiffident\ntire\nbreathing\nweather\nreject\npast\ntossed\nline\nprecisely\nstroke\nworks\nused\nappeared\ncontigit\ngirl\nreal\nwooing\ndoubt\nsimilarity\nduring\ntemper\nc\nlocked\npenknives\nomnium\nexcitement\ninto\nvictims\nrandom\nstripes\ndivining\nlikeness\ncapable\nimpostor\nhelp\nway\nspoiled\nprophets\nsacred\nengagements\nsaying\nextraordinary\nis\nprovidence\ncrawley\ndraw\nopportunity\nimproved\nglastonbury\nsea\ncigarette\nexhibit\nprobably\nbehind\nhome\nswains\njuly\nchains\ndifficulty\nclairvoyant\ni\nfaculties\ncoming\nretaliatory\nresponded\ntimes\nemployed\nbrown\ngloucesters\nlucy\nscorn\naugust\nvicious\nmusha\ncrying\ncarbineer\ndwarf\nguard\ntomorrow\ngoods\nrepulsed\nrubbed\noperating\ncases\ngay\nsaid\nunknown\nsubject's\ninfinite\nproducing\nhastened\nhim\ngiving\nelse\nlady\nnever\nconcern\nsilence\nmeanly\nas\nchanced\nfiner\nromantic\nshoot\nthese\nitself\ndispose\nbetray\nshuddering\narentschild's\nneed\nartisan's\nessentially\nstop\ntook\nconvince\nignorance\npatience\nprivileged\nshall\nrefinement\ndetermines\nmovements\nmoney\naccustomed\nfooting\ndreamt\ncolors\nrelations\navoid\ndiscernment\nstock\nintended\nrecords\nlive\nriver\ndevil\namusing\nfiddle\nimplies\nanswer\ninterest\nemployment\nengagement\nmassive\nhorses\nsintry\naware\npreferment\nugly\nfever\nthemselves\nwritten\nmakes\ncrawley's\nbeliever\nnative\nmonth's\nladen\nextinguish\nloud\nhusband's\ntwirled\nhonor\nfunny\nleaned\nmamma\nplanet\nsuffused\ncompanions\nfamily\nit\ninclines\nabundant\ngalled\nheard\nfarewell\nauthoritative\nazure\noperated\nswamp\nlabour\nuseful\ncushman\nrejoicing\nbank\nreasons\nhaste\ngarment\naudience\nweariness\nthree\nwoven\nhoarse\nwho\nincomes\nparis\nstupid\nswirling\ncargo\ndeceit\nempresses\nactuated\nwaters\nmarvellously\nlanguage\ndash\non\ninvention\ngreatly\ns\ngirl's\nmanaged\ninterrogation\nneglected\nass's\ndanes\nopium\ntypes\ndominating\nimpression\nprovincialism\nvanity\nresult\nheavily\narises\nend\nscholarship\nrich\nrespond\nentertaining\ntaste\nrepresent\nchiaja\nsuffered\nsupport\ncivilizations\nmatters\nobjected\nmale\nyour\nowned\nexists\nresisted\nbritons\nliner\nfar\nguide\ndiscovered\nunwilling\ncurly\ncottage\nshare\noblige\ninvariably\ninstinct\ndisgust\napproval\noperator\ncarefully\nnorthmen\nwithin\nmotion\nfortified\nsheffield\nfolly\nmaterial\noffering\nlandlady\nbarocco\nweak\ntipped\npuritan\nmellow\nthravels\nimpart\ncarry\ncountry\npork\nplace\nr\nstraight\nrose\nwhole\nimpade\npreferences\nmaturity\nspeak\ncouldn't\nduke\nwanted\nseemingly\nenough\nwarm\nlake's\nbrain\ngather\nmoisten\nfor\nphenomenons\narmed\nsnored\npractically\nage\nexplained\nfarmyard\nhydraulic\ndrew\nwooded\ndisengage\nconversation\nnarrowness\nhurriedly\nbroom\npopulace\ndeaf\npurely\nglorifications\nhistory\ncarnival\nhastily\neffort\nsuggestive\nunapproachable\nearth\ninstinctive\nbright\ndivinity\nscale\nclay\nmust\nsent\nwhose\nabsorbed\nheight\ngazing\nstrongest\nsystem\nwar\nsubtler\nlistened\nunequivocal\nboys\njoy\nentering\nseldom\nadmired\nwear\nstorm\nfeats\noutrageous\nshakespeare\nflint\neverybody\nwitch\nmagnetic\nalthough\nsuccesses\nthee\ndilated\nevil\nroars\ndo\nrealities\nquestion\ncultivator\nbusily\nusing\nshowing\nbringing\ndown\nlethargy\nattention\nroll\ngratification\ncontempt\nsuggested\npocket\nbedroom\nregained\nstand\nbear\nplausible\nmeaning\ntell\norgan\nbroke\npurse\nsonsy\nbar\npublic\nhalcyon\nconnection\nforcing\nsinking\ndisguised\never\nestablished\nemperors\nasleep\nyou're\nslight\nreplied\nbonhomme\nlesson\ndied\ndelighted\nfrequent\ncast\nfilled\nprobability\ncovered\nhad\nunusual\nrid\nfashion\nfire\nembodiment\nunfortunately\nperfection\ndeserve\nfeet\nattacked\nfirst\nreading\nby\nauthority\ncry\ncocke\ncolours\ncold\nmonuments\nsum\nseries\nseparate\nrarely\nnothing\nblended\nboxwood\nfellows\nwords\nengland\nafraid\ncooling\ntongue\nmatrimony\nraces\nswell\nwid\nany\ndistinguished\nmagnetism\nwalk\nacknowledged\nsuccession\nwhispered\nbleeding\nwould\nmember\ndissatisfaction\nthrow\nintellectual\ntable\nchildren's\ntrying\nbeginnin\nreluctance\ngrossly\ngood\nimagination\nbecome\nbeautiful\ngunter\nothers\nflatter\nmasculine\ntrouble\nbehaved\nperhaps\nmitigated\nfaltered\nhappy\nwaist\nknew\ntam\ncountenance\nlodgings\ncoals\ncompulsion\nearly\nsurprised\ndiminished\nshows\nago\nacknowledgment\npedant\nprivilege\nenchanted\nbanter\nprobable\npray\ndestiny\nperversity\nincumbent\nrhine\nlines\nburied\nwasted\nbathed\nseven\ncoast\nsecondly\nrosette\nverses\nprepared\nsweetheart\nstern\ncreative\nappreciate\ncautious\nwhom\ndelectus\nhandsome\nmarried\nyielding\nking's\nremitted\nshore\nfields\nfullest\ndim\ndescription\ncompany\nlucky\nmid\nbeer\nconscious\ndecreased\npreached\nincluding\nprotected\nthat's\nformer\nmeant\njoint\n"
  },
  {
    "path": "data/smoke_test/vocab.txt",
    "content": "  she had your dark suit in greasy wash water all year\ngroups we were brought together with several other victims families when i saw aicha in the media\ncoming over when her son was indicted and i thought what a brave woman someday i want to meet that woman when im stronger i was still in deep grief i knew i didnt have the strength i knew i would find her someday or we would find each other because when people heard that my son\nwas a victim i got immediate sympathy\nbut when people learned what her son was accused of she didnt get that sympathy but her suffering is equal to mine so we met in november two thousand and two and aicha will now tell you how that came about\ntoday because of\nintroduced me to five families and i saw phyllis and i watched\nand i saw in her eyes that she was a mother just like me\ni was married when i was fourteen i lost a child when i was fifteen a second child when i was sixteen so the story with zacarias was too much really\nso thats why i decided to tell my story so that my suffering is something positive for other women\nall the women all the mothers\ni first learned that my son had been in the world trade center on the morning of september eleventh two thousand and one\nits up to us women because we are women because we love our children\nits not against women its for us for us women for\ni talk against violence against terrorism i go to schools to talk to young muslim\ngirls so they dont accept to be married against their will very young\nso if i can save one of the young girls and avoid that they get married and suffer as much as i did well this is something\ni have learned so much\nwe didnt know if he had perished yet until thirty six hours later at the time\nfamily members but we were all so nervous why does she want to meet us\nand then she was nervous why did we want to meet her what did we want from each other\nbefore we knew each others names or anything we had embraced\nand wept then we sat in a circle\nwith support with help from people experienced in this kind of reconciliation and aicha started and she said\ni dont know if my son is guilty or innocent but i want to tell you how sorry i am for what happened to your families\ni know what it is to suffer\nand i feel that if there is a crime a person should be tried fairly and punished\nbut\nshe reached out to us in that way and it was id like to say it was an ice breaker and what happened then is we all told our stories\nand we all connected as human beings by the end of the afternoon it was about three hours after lunch\nwed felt as if wed known each other forever now what i learned from her is a woman not only who could be so generous under these present circumstances and what it was then and what was being done to her son but the life shes had i never had met\nsomeone with such a hard life from such a totally different culture and environment from my own\nwe knew that it was political\nbeing afraid of the other but making that step\nand then realizing hey this wasnt so hard who else can i meet that i dont know or that im so different from\nso aicha do you have\na couple of words for conclusion because our time is up\nwe were afraid of what our country was going to do in the name of our son my husband orlando and i\ni wanted to say that we have to try to know other people the other\nand i hope that someday well all live together in peace and respecting each other this is what i wanted to say\nand our family and when i saw it and yet through the shock\nthe terrible shock and the terrible\nexplosion in our lives literally\nwe were not vengeful\non six counts of conspiracy to commit terrorism\nand the u s government called for a death penalty for him if convicted\nmy husband and i spoke out\nin opposition to that publicly through that and through human rights\nive also had some meals that make me want to dry heave so its about choosing the parts of the bible about compassion about tolerance about loving your neighbor as opposed to the parts\nabout homosexuality is a sin or intolerance or violence which are very much in the bible as well\nso if we are to find any meaning in this book then we have to really engage it and wrestle with it and i thought id end with just a couple more\ntheres me reading the bible thats how i hailed taxi cabs\nmorning but it served well for a day so anyway thank you so much for letting me\nso\nand it was about the year i spent reading the encyclopedia britannica from a to z in my quest to learn everything in the world or more precisely from\nwhich is a type of east asian music all the way to zwyiec which is well i dont\nalthough listening to kevin kelly you dont have to remember anything you can just google it so i wasted some time there\ni love those experiments but i think that the most profound and life changing experiment that ive done is my most recent experiment\ni thought id tell you a little about what i like to write and i like to immerse myself in my topics i just like to dive right in and become sort of a human guinea pig and\nwhere i spent a year trying to follow all of the rules of the bible the year of living biblically and\ni undertook this for two reasons the first was that i grew up with no religion at all as i say in my book im jewish in the same way the olive garden is italian\nso\nbut ive become increasingly interested in religion i do think its the defining issue of our time or one of the main ones and i have a son i want to know what to teach him so i decided to dive in head first and try to live the bible\nthe second reason i undertook this is because im concerned about the rise of fundamentalism religious fundamentalism and people who say\nwhat if you really did take the bible literally i decided to take it to its logical conclusion and take everything in the bible literally\nwithout picking and choosing the first thing i did was i got a stack of bibles i had christian bibles i had\njewish bibles a friend of mine sent me something called a hip hop bible where the twenty three rd psalm is rendered as the lord is all that as opposed to what i knew it as the lord is my shepherd\nthen i went down and i read several versions and i wrote down every single law that i could find and this was a very long list over seven hundred rules\nand they range from the famous ones that i had heard of the ten commandments love your neighbor be fruitful and multiply so i wanted to follow those and actually i take my projects very seriously because i had twins during my year so i\ndefinitely take my projects seriously but i also wanted to follow the hundreds of arcane and obscure laws that are in the bible\nthere is the law in leviticus you cannot shave the corners of your beard i didnt know where my corners were so i decided\nto let the whole thing grow and this is what i looked like by the end as you can imagine i spent a lot of time at airport security\nmy wife wouldnt kiss me for the last two months so certainly the challenge was there the bible says you cannot wear clothes made of mixed fibers so i thought sounds strange but ill try it you only know\ni see my life as a series of experiments so i work for esquire magazine and a couple of years ago i wrote an article called my outsourced life\ni got rid of all my poly cotton t shirts the bible says that if two men are in a fight and the wife of one of those men grabs the testicles of the other\nher hand shall be cut off so i wanted to follow that rule\nwife was standing nearby looking like she had a strong grip so\ntheres another shot of my beard i will say it was an amazing year because it really was life changing and incredibly challenging and there were two types of laws\nwere particularly challenging the first was avoiding the little sins that we all commit every day\nknow i could spend a year not killing but spending a year not gossiping not coveting not lying you know i live in new york and i work as a journalist so this was seventy five eighty percent of my\nbut it was really interesting because i was able to make some progress because i couldnt believe how\nmy behavior changed my thoughts this was one of the huge lessons of the year is that i almost pretended to be a better person and i became a little bit of a better person so\ni had always thought you know you change your mind and you change your behavior but its often the other way round you change your behavior\nand you change your mind so you know if you want to become more compassionate you visit sick people in the hospital and you will become more compassionate\nwhere i hired a team of people in bangalore india to live my life for me so they answered my emails they answered my phone they argued with my wife for me and they\nyou donate money to a cause and you become emotionally involved in that cause so it really was cognitive psychology\nthat if you smile you will become happier which as we know is actually true the second type of\nrule that was difficult to obey was the rules that will get you into a little trouble in twenty one st century america and\nthe clearest example of this is stoning adulterers\nbut its a big part of the bible so i\nhad to address\ni was able to stone one adulterer it happened i was in the park and i was dressed in my biblical clothing sandals and a white robe you know because again the outer\nsee how dressing biblically affected my mind\nup to me and he said why are you dressed like that and i explained my project and he said well i am an adulterer are you going to stone me and i said well that would be great\nand\ni took out a handful of stones from my pocket that i had been carrying around for weeks hoping for just this interaction and you know they were pebbles\nout of my hand he was actually an elderly man mid seventies just so you know but hes still an adulterer and still quite angry he grabbed them out of my hand and threw them at my face\nand i felt that i could eye for an eye i could retaliate and throw one back at him so that was my experience stoning and it did allow me to talk\nabout in a more serious way these big issues how can the bible be so barbaric in some places and yet so incredibly wise in others\nit has all of these authors and editors over hundreds of years and its sort of evolved its not a book that was written and came down from on high\nmy son bedtime stories it was the best month of my life because i just sat back and i read books and watched movies\nso i thought i would end by telling you just a couple of the take away the bigger\nlessons that i learned from my year the first is thou shalt not take the bible literally this\nvery very clear early on because if you do then you end up acting like a crazy person and stoning adulterers or here\nwell thats another i did spend some time shepherding its a very relaxing vocation i recommend it but this one is\nand my wife thought this was very offensive so she sat in every seat in our apartment and i had to spend much of the year standing until\ni bought my own seat and carried it around\nso you know i met with creationists i went to the creationists museum and these are the ultimate literalists and it was fascinating because they were not stupid people at all\nthat they distort all the data to fit their model and they go through these amazing mental gymnastics to accomplish this and i will say though\nwas a wonderful experience more recently i wrote an article for esquire called about radical honesty and this is a movement\nthe museum is gorgeous they really did a fantastic job if youre ever in kentucky theres\ni think its crazy they did a great job\nanother lesson is that\nthou shalt give thanks and this one was a big lesson because i was praying giving these prayers of thanksgiving which was odd for an agnostic but\nsaying thanks all the time every day and i started to change my perspective and i started to realize the hundreds of little things that go right every day\nthat i didnt even notice that i took for granted as opposed to focusing on the three or four that went wrong\nso this is actually a key to happiness for me is to just remember when i came over here the car didnt flip over and i didnt trip coming up the stairs its a remarkable thing\nthis one was unexpected because i started the year as an agnostic and by the end of the year i became what a friend of mine calls a reverent agnostic which i love\na movement so if anyone wants to join the basic idea is whether or not there is a god theres something important and beautiful about the idea of sacredness and that our rituals can be sacred the sabbath can be\nthis is started by a psychologist in virginia who says that you should never ever lie except maybe during poker and golf his only exceptions and more than that\nthis was one of the great things about my year doing the sabbath because i am a workaholic so having this one day where you cannot work it really that changed my life\njourney i wanted it to be about religion in america so i spent time with evangelical christians and hasidic jews and the\nim very proud because i think im the only person in america to out bible talk a jehovahs witness\nthank you\nbut it was\nbecause i had some very preconceived notions about for instance evangelical christianity and i found that its such a wide\nand varied movement that it is difficult to make generalizations about it theres a group i met with called the red letter christians and they focus on\nwords in the bible which are the ones that jesus spoke thats how they printed them in the old bibles and\nis that jesus never talked about homosexuality they have a pamphlet that says heres what jesus said about homosexuality and you open it up and theres nothing in it so\nthey say jesus did talk a lot about helping the outcasts helping poor people so this was very inspiring to me\ni recommend jim wallace and tony campolo theyre very inspiring leaders even though i disagree with much of what they say also thou shalt not\ni was shocked learning how much of my life is governed by irrational forces and\nthe thing is if theyre not harmful theyre not to be completely dismissed because i learned that i was thinking i was doing all these rituals these biblical rituals separating my\nand linen and i would ask these religious people why would the bible possibly tell us to do this why would god care and they said we dont know but its just rituals\nthat give us meaning and i would say but thats crazy and they would say well what about you you blow out candles on top of a birthday cake if a guy from mars came down and saw\nheres one guy blowing out the fire on top of a cake versus another guy not wearing clothes of mixed fabrics would the martians say well that\nhe makes sense but that guys crazy so no i think that\nare not harmful but rituals by themselves are not to be dismissed and finally\ni learned that thou shall pick and choose and this one i learned because i tried to follow everything in the bible and\ni do not recommend this at all to give you a sense of the experience the article was called i think youre fat\ni failed miserably because you cant you have to pick and choose and anyone who follows the bible is going to be picking and choosing the key is\nto pick and choose the right parts theres the phrase called\nmy argument is whats wrong with cafeterias ive had some great meals at cafeterias\nand theres the sheep now the final part of the trilogy was i wanted to focus on the body and try to be the healthiest person i could be the healthiest person alive so thats what ive been doing the last couple of years\nlast decade subjecting myself to pain and humiliation hopefully for a good cause which is self improvement\nand i just finished a couple of months ago and i have to say thank god because living so healthily was killing me\nit was so overwhelming because the amount of things you have to do its just\nmind boggling i was listening to all the experts and talking to sort of a board of medical advisers\nand they were telling me all the things i had to do i had to eat right exercise meditate pet dogs because that lowers the blood pressure i wrote the book on a treadmill and it took me about a thousand miles to write the book\nwent into sunscreen i was like a glazed doughnut for most of the year\nthat i should also wipe down all of the remote controls and iphones in my house because those are just orgies of germs so that\nand ive done this in three parts so first i started with the mind and i decided to try to get smarter by reading the entire encyclopedia britannica from a to z or more precisely from\nnow its a little extreme i admit but if you think about this this is actually the freakonomics authors wrote about this that more people die on a per mile basis from drunk walking than from drunk driving\nso something to think about tonight if youve had a couple\nso i finished and it was a success\nso i finished and i\nwithout the sex part because i have three young kids so that wasnt happening but\nand i finally\nhave stabilized so now im back to\nadopting many not all i dont wear a helmet anymore but dozens of healthy behaviors that i adopted during my year it was really a life changing project and i of course dont have time to go into all of them let me just tell you two really quickly\nthe first is and this was surprising to me i didnt expect this to come out but i live a much quieter life now\nand this is a real underestimated under appreciated health hazard not just because it harms our hearing which it obviously does but it actually initiates the fight or flight response a loud noise will get your fight or flight response going and this\nover the years can cause real damage cardiovascular damage\nthe world health organization just did a big study that they published this year and it was done in europe and they estimated that one point six million years of healthy living are lost\nevery year in europe because of noise pollution so they think its actually very deadly and by the way its also terrible for your brain\nthey put dirt all over the cobblestones outside the hall so that they could concentrate so without noise reduction technology our country would not exist so as a patriot i felt it was important to i wear all the earplugs and the earphones\nthat joy is so important to your health that very few of these behaviors will stick with me unless theres some sense of pleasure and joy in them and just to give you one instance of this food\nbut i think we can use their techniques and apply them to healthy food to give just one example we love crunchiness mouthfeel so i basically have tried to incorporate crunchiness into a lot of my recipes throw in some sunflower seeds\nand you can almost trick yourself into thinking youre eating doritos laughter and\nit had its downsides\nthe\nbecause leviticus says you cannot shave so this is what i looked like by the end\nthank you for that reaction laughter i look a little like moses or ted kaczynski i got both of them so there was the topiary there\nwe have indeed taken the best part of the meat so lets look today at a set of photographs of a people who lost so that we could gain\nand know that when you see these peoples faces that these are not just images of the lakota they stand for all indigenous people\non this piece of paper is the history the way i learned it from my lakota friends and family\nim here today to show my photographs of the lakota many of you may have heard of the lakota or at least the larger group of tribes called\nsixty six the beginning of the transcontinental railroad a new era\nwe appropriated land for trails and trains to shortcut through the heart of the lakota nation the treaties were out the window in response three tribes led by the lakota chief red cloud\nattacked and defeated the u s army many times over i want to repeat that part the lakota defeat the u s army\nsixty eight the second fort laramie treaty clearly guarantees the sovereignty of the great sioux nation and the lakotas ownership of the sacred black hills\nthe lakota are one of many tribes that were moved off their land to prisoner of war camps now called reservations the pine ridge reservation\nseventy one the indian appropriation act makes all indians wards of the federal government in addition the military issued orders forbidding western indians from leaving reservations\nthe move destroyed the reservations making it easier to further subdivide and to sell with every passing generation most of the surplus land\ni believe to be the most important in this slide show this is the year of the wounded knee massacre\nto this day this is the most medals of honor ever awarded for a single battle\nmore medals of honor were given for the indiscriminate slaughter of women and children than for any battle in world war one world war two korea vietnam iraq or afghanistan\nnow if any of you have ever heard of aim the american indian movement or of russell means or leonard peltier or of the stand off at oglala\nthe wounded knee massacre is considered the end of the indian wars whenever i visit the site of the mass grave at wounded knee\ni see it not just a grave for the lakota or for the sioux but as a grave for all indigenous peoples\nthe holy man black elk said i did not know then how much was ended when i look back now from this high hill of my old age\ni can still see the butchered women and children lying heaped and scattered all along the crooked gulch\nwhen i saw them with eyes still young\nand i can see that something else died there in the bloody mud and was buried in the blizzard\na peoples dream died there and it was a beautiful dream with\nthis event a new era in native american history began everything can be measured before wounded knee and after because it was in this moment with the fingers on the triggers of the hotchkiss guns\nthe court determined that when the sioux were resettled onto reservations and seven million acres of their land were opened up to prospectors and homesteaders the terms of the second fort laramie treaty had been violated\nthe court stated that the black hills were illegally taken and that the initial offering price plus interest should be paid to the sioux nation\nten statistics about native population today more than a century after the massacre at wounded knee reveal the legacy of colonization forced migration and treaty violations\nat least sixty percent of the homes on the reservation are infested with black mold more than ninety percent of the population lives below the federal poverty line\nthe tuberculosis rate on pine ridge is approximately eight times higher than the u s national average the infant mortality rate is the highest on this continent and is about three times higher than the u s national average\nthe last chapter in any successful genocide is the one in which the oppressor can remove their hands and say\nmy god what are these people doing to themselves theyre killing each other theyre killing themselves while we watch them die\nthis is how we came to own these united states this is the legacy of manifest destiny prisoners are still born into prisoner of war camps long after the guards are gone\nthese are the bones left after the best meat has been has been taken\na long time ago a series of events was set in motion by a people who look like me by wasichu eager to take the land and the water and the gold in the hills\nthose events led to a domino effect that has yet to end as removed as we the dominant society may feel\nwhat is the connection between these images of suffering and the history that i just read to you and how much of this history do you need to own even is any of this your responsibility today\nbeen told that there must be something we can do there must be some call to action because for so long ive been standing on the sidelines\ncontent to be a witness just taking photographs because the solution seems so far in the past i needed nothing short of a time machine to access them\nthe suffering of indigenous peoples is not a simple issue to fix its not something everyone can get behind the way they get behind helping haiti of ending aids or fighting a famine\nand invited me again and again over five years but on pine ridge i will always be what is called wasichu and wasichu is a lakota word\nthe fix as its called may be much more difficult for the dominant society than say a fifty dollar check\nor church trip to paint some graffiti covered houses or a suburban family donating a box of clothes they dont even want anymore\nso where does that leave us shrugging our shoulders in the dark\nthe call to action i offer today my ted wish is this honor the treaties give back the black hills its not your business what they do with them\nthat means non indian but another version of this word means the one who takes the best meat for himself and thats what i want to focus on the one who takes the best part of the meat it means greedy\nyou can also toggle between altitude for model and manufacturer see again the diversity\nand you can scroll around and see some of the different airports and the different patterns that they have this is scrolling up the east coast you can see some of the chaos thats happening in new york with the air traffic controllers having to deal with\nso zooming back out real quick we see again the u s you get florida down in the right hand corner moving across to the west coast you see san francisco and los angeles big low traffic zones across nevada and arizona and thats us down there in l a and long beach on the bottom\ni started taking a look as well at different perimeters because you can choose what you want to pull out from the data this is looking at ascending versus descending flights and you can see over time the ways the airports change you see the holding patterns that start to develop in the bottom of the screen and you can see eventually the airport actually flips directions\ndata can actually make us more human were collecting and creating all kinds of data about how were living our lives\nso this is another project that i worked on with the sensible cities lab at mit this is visualizing international communications so its how new york communicates with other international cities and we set this up as a live globe in the museum of modern art in new york for the design the elastic mind exhibition\nits visualizing sms messages being sent in the city of amsterdam so youre seeing the daily ebb and flow of people sending sms messages from different parts of the city until we approach new years eve where everybody says happy new year\nand its enabling us to tell some amazing stories recently a wise media theorist tweeted the nineteenth century culture was defined by the novel the twentieth century culture was defined by the cinema and the culture of the twenty first century will be defined by the interface\nand then youre going to see people start to gather in the center of the city to celebrate the night before which happens right here and then you can see people celebrating the next day and you can pause it and step back and forth and see different phases\nso now on to something completely different some of you may recognize this this is baron wolfgang von kempelens mechanical chess playing machine and its this amazing robot that plays chess extremely well except for one thing its not a robot at all theres actually a legless man that sits in that box and controls this chess player\nthis was the inspiration for a web service by amazon called the mechanical turk named after this guy and its based on the premise that there are certain things that are easy for people but really difficult for computers\nso they made this web service and said any programmer can write a piece of software and tap into the minds of thousands of people the nerdy side of me thought wow this is amazing i can tap into thousands of peoples minds and the other nerdy side of me thought this is horrible this is completely bizarre what does this mean for the future of mankind\nso i created this drawing tool i asked people to draw a sheep facing to the left and i said ill pay you two cents for your contribution\nand i started collecting sheep and i collected\na lot a lot of different sheep\nlots of sheep\ni took the first ten thousand sheep that i collected and i put them on a website called thesheepmarket com\nwhere you can actually buy collections of twenty sheep you cant pick individual sheep but you can buy a single plate block of stamps as a commodity and juxtaposed against this grid you see actually by rolling over each individual one the humanity behind this hugely mechanical process\nso heres a few statistics from the project approximate collection rate of eleven sheep per hour which would make a working wage of sixty nine cents per hour\nthere were six hundred and sixty two rejected sheep that didnt meet sheep like criteria and were thrown out of\nand i believe this is going to prove true our lives are being driven by data and the presentation of that data is an opportunity for us to make some amazing interfaces that tell great stories so im going to show you a few of the projects that ive been working on over the last couple years that reflect on our lives and our systems\nthe flock laughter the amount of time spent drawing ranged from four seconds to forty six minutes that gives you an idea of the different types of motivations and dedication and there were seven thousand five hundred and ninety nine people that contributed to the project or were unique ip addresses so about how many people contributed but only one of them out of the seven thousand five hundred and ninety nine said this\nobviously we think of sheep as followers and theres this reference to le petit prince where the narrator asks the prince to draw a sheep he draws sheep after sheep the narrators only appeased when he draws a box and he says its not about a scientific rendering of a sheep its about your own interpretation and doing something different and i like that\nso there were no longer shoe makers but now there are people slapping soles on peoples shoes and the whole idea of ones relationship to their work changed a lot so i thought this was an interesting clip to divide into sixteen pieces and feed into the mechanical turk with a drawing tool\nthis basically allowed what you see on the left side is the original frame and on the right side you see that frame as interpreted by sixteen people who have no idea what it is theyre doing\nand this was the inspiration for a project that i worked on with my friend takashi kawashima we decided to use the mechanical turk for exactly what it was meant for which is making money so we took a hundred dollar bill and divided it into ten thousand teeny pieces and we fed those into the mechanical turk\nwe asked people to draw what it was that they saw but here there was no sheep like criteria people if they drew a stick figure or a smiley face it actually made it into the bill so what you see is actually a representation of how well people did what it was they were asked to do\nso we took these hundred dollar bills and we put them on a website called tenthousandscents com where you can browse through and see all the individual contributions and you can also trade real hundred dollar bills for fake hundred dollar bills and make a donation to the hundred dollar laptop project which is now known as one laptop per child\nthis is again showing all the different contributions you see some people did beautiful stipple renderings like this one on top spent a long time making realistic versions and other people would draw stick figures or smiley faces here\nthis is a project called flight patterns what youre looking at is airplane traffic over north america for a twenty four hour period as you see everything starts to fade to black and you see people going to sleep\nyou may recognize it from two thousand and one a space odyssey when hals dying at the end of the film he starts singing this song as a reference to when computers became human so we resynthesized this song this is what that sounded like we broke down all the individual notes in the singing as well as the phonemes in the singing\nand we took all of those individual pieces and we fed them into another turk request this is what it would look like if you went to the site you type in your code\nbut you first test your mic youd be fed a simple audio clip\nafter\nfollowed by that you see on the west coast planes moving across the red eye flights to the east coast and youll see everybody waking up on the east coast\nfollowed by european flights coming in the upper right hand corner everybodys moving from the east coast to the west coast you see san francisco and los angeles start to make their journeys down to hawaii in the lower left hand corner i think its one thing to say theres one hundred and forty thousand planes being monitored by the federal government at any one time and its another thing to see that system as it ebbs and flows\nand this was seen by a director in l a named james frost who said wait a minute you mean we can shoot a music video without actually using any video\nso we did exactly that we made a music video for one of my favorite bands radiohead and i think one of my favorite parts of this project was not just shooting a video with lasers but we also open sourced it and we made it released as a google code project where people could download a bunch of the data and some source code to build their own versions of it and people were making some amazing things this is actually two of my favorites the\nso with everybody making so much amazing stuff and actually understanding what it was they were working on i was really interested in trying to make a collaborative project where people were working together to build something and i met a music video director named chris milk and we started bouncing around ideas to make a collaborative music video project but we knew we really needed the right person to kind of rally behind and build something for\nso we put the idea on the back burner for a few months and he ended up talking to rick rubin who was finishing up johnny cashs final album\ncalled aint no grave the lyrics to the leading track are aint no grave can hold my body down so we thought this was the perfect project to build a collaborative memorial and a virtual resurrection for johnny cash so i teamed up with my good friend ricardo cabello also known as mr doob whos a much better programmer than i am\nand he made this amazing flash drawing tool as you know an animation is\na series of images so what we did was cross cut a bunch of archival footage of johnny cash and at eight frames a second we allowed individuals to draw a single frame that would get woven into this dynamically changing music video\nso i dont have time to play the entire thing for you but i want to show you two short clips one is the beginning of the music video and thats going to be followed by a short clip of people who have already contributed to the project talking about it briefly\nthis is a time lapse image of that exact same data but ive color coded it by type so you can see the diversity of aircraft that are in the skies above us\nyou can see the person who drew that individual thumbnail and where they were located and if you find one that youre interested in you can actually click on it and open up an information panel where youre able to rate that frame which helps it bubble up to the top\nand then this is again the abstract version\nwhich ends up getting a little bit crazy\nso the last project i want to talk to you about is another collaboration with chris milk and this is called the wilderness downtown its an online music video for the arcade fire chris and i were really amazed by the potential now with modern web browsers where you have html five audio and video and the power of javascript to render amazingly fast\nbut most importantly i think\nwe really wanted to make an experience that was unlike the johnny cash project where you had a small group of people spending a lot of time to contribute something for everyone\nwhat if we had a very low commitment but delivered something individually unique to each person who contributed\nso the project starts off by asking you to enter the address of the home where you grew up and you type in the address it actually creates a music video specifically for you pulling in google maps and streetview images into the experience itself so this should really be seen at home with you typing in your own address but im going to give you a little preview of what you can expect\nand i remember watching a kid playing on a car stop he was just a toddler and he wasnt very good at it and he kept falling over but i bet playing with this car stop taught him a really valuable lesson and thats that large things dont let you get right past them and that they stay in one place\nand so this is a great conceptual model to have of the world\nunless youre a particle physicist itd be a terrible model for a particle physicist because they dont play with car stops they play with these little weird particles and when they play with their particles they find they do all sorts of really weird things like they can fly right through walls or they can be in two different places at the same time\nand so they wrote down all these observations and they called it the theory of quantum mechanics and so thats where physics was at a few years ago you needed quantum mechanics to describe little tiny particles but you didnt need it to describe the large everyday objects around us\nthis didnt really sit well with my intuition and maybe its just because i dont play with particles very often well i play with them sometimes but not very often and ive never seen them i mean nobodys ever seen a particle\nbut it didnt sit well with my logical side either because if everything is made up of little particles and all the little particles follow quantum mechanics then shouldnt everything just follow quantum mechanics\nand so id feel a lot better about the whole thing if we could somehow show that an everyday object also follows quantum mechanics so a few years ago i set off to do just that\nso i made one this is the first object\nthat you can see that has been in a mechanical quantum superposition\nthis device has the ability to be in a quantum superposition but it needs a little help to do it here let me give you an analogy\ni dont want to bother them or frankly scare them\nso quantum mechanics says that inanimate objects feel the same way the fellow passengers for inanimate objects are not just people but its also the light shining on it and the wind blowing past it and the heat of the room\nand so we knew if we wanted to see this piece of metal behave quantum mechanically were going to have to kick out all the other passengers and so thats what we did\ninstead of just sitting perfectly still it was vibrating and the way it was vibrating was breathing something like this like expanding and contracting bellows and by giving it a gentle nudge we were able to make it both vibrate and not vibrate at the same time\nsomething thats only allowed with quantum mechanics so what im telling you here is something truly\nthis would be someone whos entirely intuitive\nwhich in turn means the entire chunk of metal is in two different places i think this is really cool\nso where would you put your brain on this scale some of us may have opted for one of these extremes but i think for most people in the audience your brain is something like this with a high aptitude in both hemispheres at the same time its not like theyre mutually exclusive or anything you can be logical and intuitive\nthen why not you\nso imagine if youre in multiple places at the same time\nhow would your consciousness handle your body being delocalized in space\ntheres one more part to the story its when we warmed it up and we turned on the lights and looked inside the box we saw that the piece metal was still there in one piece\nand so i had to develop this new intuition that it seems like all the objects in the elevator are really just quantum objects just crammed into a tiny space you hear a lot of talk about how quantum mechanics says that everything is all interconnected well thats not quite right its more than that\nand so i consider myself one of these people along with most of the other experimental quantum physicists who need a good deal of logic to string together these complex ideas but at the same time we need a good deal of intuition to actually make the experiments work\nhow do we develop this intuition well we like to play with stuff so we go out and play with it and then we see how it acts and then we develop our intuition from there and really you do the same thing so some intuition that you may have developed over the years is that one thing is only in one place at a time\ni mean it can sound weird to think about one thing being in two different places at the same time but you werent born with this notion you developed it\ntruly awesome i knew i had to take a banjo with me to china\nand i can tell you that i didnt go to china to become a lawyer in fact i went to nashville\nand after a few months i was writing songs and the first song i wrote was in english and the second one was in chinese\nand ive played thousands of shows and ive collaborated with so many incredible inspirational musicians around the world and i see the power of music i see the power of music to connect\nand asked me what i was going to do with my life i would have told you\ncultures i see it when i stand on a stage in a bluegrass festival in east virginia and i look out at the sea of lawn chairs and i bust out into a song in chinese\nand everybodys eyes just pop wide open like its going to\nand i bust out into a song in chinese and everybody sings along and they roar with delight at this girl with the hair and the instrument and shes singing their music\nand i see even more importantly the power of music to connect hearts like the time i was in sichuan province and i was singing for kids in relocation schools in the earthquake disaster zone and this little girl comes up to me\nbig sister wong washburn wong same difference\nbig sister wong can i sing you a song that my mom sang for me before she was swallowed in the earthquake\nand i sat down she sat on my lap she started singing\nand the warmth of her body\nwas a place i could have stayed forever and in that moment we werent our american selves we werent our chinese selves we were just\nmortals\nsitting together in that light that keeps us here\never thought it would have anything to do with the banjo\nbeautiful the sound of docs voice and the rippling groove of the banjo and after being\ntotally and completely obsessed with the mammoth richness and history of chinese culture it was like this total relief to hear something so truly american\na\nwhen he saw me on what turned out to be his last hours on this earth his hands moved as if in slow motion and as i wondered what he was up to\nhis stick fingers made their way up to his pajama shirt fumbling with his buttons\ni realized that he was wanting to expose his wicker basket chest to me it was an offering an invitation i did not decline\nwhen we shortcut the physical exam when we lean towards ordering tests instead of talking to and examining the patient we not only overlook simple diagnoses that can be diagnosed at a treatable early stage but were losing much more than that were losing a ritual\nno this ritual was about the one message that physicians have needed to convey to their patients although god knows of late in our hubris we seem to have drifted away we seem to have forgotten\nas though with the explosion of knowledge the whole human genome mapped out at our feet we are lulled into inattention forgetting that the ritual is cathartic to the physician necessary for the patient forgetting that the ritual has meaning and a singular message to convey to the patient\nand the message which i didnt fully understand then even as i delivered it and which i understand better now is this i will always always always be there\ni will see you through this i will never abandon you\ni will be with you through the end thank you very\nwere losing a ritual that i believe is transformative transcendent and is at the heart of the patient physician relationship\nthis may actually be heresy to say this at ted but id like to introduce you to the most important innovation i think in medicine to come in the next ten years and that is the power of the human hand\nto touch to comfort to diagnose and to bring about treatment id like to introduce you first to this person whose image you may or may not recognize this is sir arthur conan doyle since were in edinburgh im a big fan of conan doyle you might not know that conan doyle went to medical school here in edinburgh\nand his character sherlock holmes was inspired by sir joseph bell joseph bell was an extraordinary teacher by all accounts and conan doyle writing about bell described the following exchange between bell and his students so picture bell sitting in the outpatient department students all around him\npatients signing up in the emergency room and being registered and being brought in and a woman comes in with a child and conan doyle describes the following exchange\nshe says it was good and he says what did you do with the other child she says i left him with my sister at leith\nand he says and did you take the shortcut down inverleith row to get here to the infirmary\nand bell then goes on to explain to the students he says you see when she said good morning\ni picked up her fife accent and the nearest ferry crossing from fife is from burntisland and so she must have taken the ferry over\nyou notice that the coat shes carrying is too small for the child who is with her and therefore she started out the journey with two children but dropped one off along the way\nyou notice the clay on the soles of her feet such red clay is not found within a hundred miles of edinburgh except in the botanical gardens and therefore she took a short\nand when bell actually strips the patient begins to examine the patient you can only imagine how much more he would discern and as a teacher of medicine as a student myself i was so inspired by that story\nwithin a few minutes she went into cardiac collapse she was resuscitated stabilized whisked over to a cat scan suite right next to the emergency room because they were concerned about blood clots in the lung\nhis father used to go down into the basement to tap on the sides of casks of wine to determine how much wine was left and whether to reorder\nand so when auenbrugger became a physician he began to do the same thing he began to tap on the chests of his patients on their abdomens and basically everything we know about percussion which you can think of as an ultrasound of its day\norgan enlargement fluid around the heart fluid in the lungs abdominal changes all of this he described in this wonderful manuscript inventum novum new invention which would have disappeared into obscurity except for the fact that this physician corvisart a famous french physician\nfamous only because he was physician to this gentleman corvisart repopularized and reintroduced the work and it was followed a year or two later by laennec discovering the stethoscope\nthat the barber pole the red and white stripes represents the blood bandages of the barber surgeon and the receptacles on either end represent the pots in which the blood was collected\nand the cat scan revealed no blood clots in the lung\nluke fildes was commissioned to paint this by tate who then established the tate gallery and tate asked fildes to paint a painting of social importance and its interesting that fildes picked this topic fildes oldest son philip died at the age of nine on christmas eve\ntaken by the physician who held vigil at the bedside for two three nights that he decided that he would try and depict the physician in our time almost a tribute to this physician and hence the painting the doctor a very famous painting its been on calendars postage stamps in many different countries ive often wondered\nfor where he had the patient ive gotten into some trouble in silicon valley for saying that the patient in the bed has almost become an icon for the real patient whos in the computer\nive actually coined a term for that entity in the computer i call it the ipatient the ipatient is getting wonderful care all across america\nthe real patient often wonders where is everyone when are they going to come by and explain things to me whos in charge\ntheres a real disjunction between the patients perception and our own perceptions as physicians of the best medical care i want to show you a picture of what rounds looked like\nwhen i was in training the focus was around the patient we went from bed to bed the attending physician was in charge too often these days rounds look very much like this where the discussion is taking place in a room\nfar away from the patient the discussion is all about images on the computer data and the one critical piece missing is that of the patient now ive been influenced in this thinking\nby two anecdotes that i want to share with you\none had to do with a friend of mine who had a breast cancer\nback in our own town getting her subsequent care with her private oncologist and i pressed her and i asked her why did you\ncome back and get your care\nthe cancer center was wonderful it had a\nbeautiful facility giant atrium valet parking a piano that played itself a concierge that took you around from here to there but\nshe said but they did not touch my breasts\nto her it mattered deeply it was enough\nfor her to make the decision to get her subsequent care\nwith her private oncologist who every time she went examined both breasts including the axillary tail examined her axilla carefully examined her cervical region her inguinal region did a thorough exam and to her that spoke of a kind of attentiveness that she needed\ni was very influenced by that anecdote i was also influenced by another experience that i had again when i was in texas before i moved to stanford i had a reputation as being interested in patients with chronic fatigue this is not a reputation you would wish on your worst enemy\ni say that because these are difficult patients they have often been rejected by their families have had bad experiences with medical care and they come to you fully prepared for you to join the long list of people whos about to disappoint them\nand i learned very early on with my first patient that i could not do justice to this very complicated patient with all the records they were bringing in a new patient visit of forty five minutes there was just no way\nand if i tried id disappoint\nwe know the average american physician interrupts their patient in fourteen seconds and if i ever get to heaven it will be because i held my piece for forty five minutes and did not interrupt my patient\ni then scheduled the physical exam for two weeks hence and when the patient came for the physical\ni was able to do a thorough physical because i had nothing else to do i like to think that i do a thorough physical exam but because the whole visit was now about the physical i could do an extraordinarily thorough exam\nand i remember my very first patient in that series\nand when my ritual began\nthis very voluble patient began to quiet down\nand i remember having a very eerie sense that the patient and i\nin which i had a role and the patient had a role\ni have never been examined like this before\nnow if that were true its a true condemnation of our health care system because they had been seen in other places i then proceeded to tell the patient once the patient was dressed the standard things that the person must have heard in other institutions which is this is not in your head this is real\nunfortunately it happens all the time\nthe good news its not cancer its not tuberculosis its not coccidioidomycosis or some obscure fungal infection the bad news is we dont know exactly whats causing this but heres what you should do heres what we should do\ni joke but i only half joke that if you come to one of our hospitals missing a limb no one will believe you till they get a cat scan mri or orthopedic consult\nand i would lay out all\nthe standard treatment options that the patient had heard elsewhere\nand i always felt that if my patient\ngave up the quest for the magic doctor the magic treatment and began with me on a course towards wellness it was because i had earned the right to tell them these things by virtue of the examination something of importance had transpired in the exchange\nand they immediately said to me well you are describing a classic ritual\nand they helped me understand that rituals are all about transformation\nwe marry for example with great pomp and ceremony and expense to signal our departure from a life of solitude and misery and loneliness to one of eternal bliss\nwe signal transitions of power with rituals we signal the passage of a life\nwith rituals rituals are terribly important theyre all about transformation well i would submit to you\nand then incredibly on top of that disrobing and allowing touch\ni would submit to you that that is a ritual of exceeding importance and if you shortchange that ritual\nby not undressing the patient by listening with your stethoscope on top of the nightgown by not doing a complete exam you have bypassed on the opportunity to seal the patient physician relationship\ni am a writer and i want to close by reading you a short passage that i wrote that has to do very much with this scene im an infectious disease physician and in the early days of hiv before we had our medications i presided over so many scenes like this\ni am not a luddite i teach at stanford im a physician practicing with cutting edge technology but id like to make the case to you in the next seventeen minutes that\ni remember every time i went to a patients deathbed whether in the hospital\nor at home i remember my sense of failure\ni would look at the tongue i would percuss the chest i would listen to the heart\ni would feel the abdomen\ni remember so many\npatients their names still vivid on my tongue their faces still so clear i remember so many huge hollowed out haunted eyes staring up at me as i performed this ritual and then the next day i would come and i would do it again\nand i wanted to read you this one closing passage about one patient\ni recall one patient who was at that point no more than a skeleton encased in shrinking skin unable to speak his mouth crusted with candida that was resistant to the usual medications\nwe had the battle between jefferson and hamilton in one thousand nine hundred and thirteen we had this ugly battle over the federal reserve when it was created with\nvicious angry arguments over how it would be constituted and a general agreement that the way it was constituted was the worst possible compromise a compromise guaranteed to destroy this valuable thing this dollar\nbut then everyone agreeing okay so long as were on the gold standard it should be okay the fed cant mess it up so badly\nbut then we got off the gold standard for individuals during the depression and we got off the gold standard as a source of international currency coordination during richard nixons presidency each of those times we were on the verge of complete collapse\nand nothing happened at all throughout it all the dollar has been one of the most long standing stable reasonable currencies and we all use it every single day no matter what the people screaming about tell us no matter how scared were supposed to be\nand this long term fiscal picture that were in right now i think what is most maddening about it is if congress were simply able\nto show not that they agree with each other not that theyre able to come up with the best possible compromise but that they are able to just begin the process towards compromise we all instantly are better off the fear\nand the longer we put that off the more we make the world nervous the higher interest rates are going to be the quicker were going to\nhave to face a day of horrible calamity and so just the act of compromise itself and sustained real compromise would give us even more time would allow both sides even longer to spread out the pain and reach even more compromise down the road\nso im in the media i feel like my job to make this happen is to help foster the things that seem to lead to compromise to not talk about this in those vague and scary terms that do polarize us but to just talk about it like what it is not an existential crisis not some\nto give you a quick primer on where we are a quick refresher on where we are so the fiscal cliff i was told that thats too partisan a thing to say although i cant remember which party\nbattle between two fundamentally different religious views but a math problem a really solvable math problem one where were not all going to get what we want and one where you know theres going to be a little pain to spread around\nits supporting or attacking people say we should call it the fiscal slope or we should call it an austerity crisis but then other people say no thats even more partisan\nso i just call it the self imposed self destructive arbitrary deadline about resolving an inevitable problem\nthe light blue dotted line represents the congressional budget offices best guess of what will happen if congress really doesnt do anything and as you can see sometime around two thousand and twenty seven we reach greek levels of debt somewhere around one hundred and thirty percent of gdp\nwhich tells you that some time in the next twenty years if congress does absolutely nothing were going to hit a moment where the worlds investors the worlds bond buyers are going to say we don\nheres another way to look at exactly the same problem\nthe dark blue line is how much the government spends the light blue line is how much the government gets in and as you can see for most of recent history except for a brief period we have consistently spent more than we take in thus the national debt\nand thirty and this graph sort of sums up\nwhat the problem is the democrats they say well this isnt a big deal we can just raise taxes a bit and close that gap especially if we raise taxes on the rich\nthe republicans say hey no no weve got a better idea why dont we lower both lines why dont we lower government spending and lower government taxes and then well be on an even more favorable long term deficit trajectory\nand behind this powerful disagreement between how to close that gap theres the worst kind of cynical party politics the worst kind of insider baseball lobbying all of that stuff but theres also this\npowerfully interesting respectful disagreement between two fundamentally different economic philosophies and i like to think\nwhen i picture how republicans see the economy what i picture is\njust some amazingly well engineered machine some perfect machine unfortunately i picture it made in germany or japan but this amazing machine that\nbuilds up the more productive areas and lets the less productive areas fade away and die and as a result the whole system is so much more efficient so much richer for everybody\nand this view generally believes that there is a role for government a small role to set the rules so people arent lying and cheating and hurting each other maybe you know have a police force and a fire department and an army but to have a very limited reach into the mechanisms of this machinery\nand when i picture how democrats and democratic leaning economists picture this economy most democratic economists are you know theyre capitalists they believe yes thats a good system a lot of the time its good to let markets move resources to their more productive use but that system has tons of problems\nangry negotiations negotiations breaking apart reports of phone calls that arent going well people saying nothings happening at all and then sometime around christmas or new years were going to hear okay they resolved everything\nthat make this life worse for all of us and so the government does have a role\nto take resources from more productive uses or from richer sources and give them to other sources\nand when you think about the economy through these two different lenses\nyou understand why this crisis is so hard to solve because the worse the crisis gets the higher the stakes are the more each side thinks they know the answer and the other side is just going to ruin everything\nand i can get really despairing ive spent a lot of the last few years really depressed about this until this year i learned something that i felt really excited about i feel like its really good news and its so shocking i dont like saying it because i think\npeople wont believe me but heres what i learned the american people taken as a whole when it comes to these issues to fiscal issues are moderate pragmatic centrists and i know thats hard to believe that the american people are moderate pragmatic centrists but let me explain what im thinking\nwhen you look at how the federal government spends money so this is the battle right here\nfifty five percent more than half is on social security medicare medicaid a few other health programs twenty percent defense nineteen percent discretionary and six percent interest so\nwhen were talking about cutting government spending this is the pie were talking about and americans overwhelmingly and it doesnt matter what party theyre in overwhelmingly like that big fifty five percent chunk\nthey like social security they like medicare they even like medicaid even though that goes to the poor and indigent which you might think would have less support\nand they do not want it fundamentally touched although the american people are remarkably comfortable\nand democrats roughly equal to republicans with some minor tweaks to make the system more stable social security is fairly easy to fix the rumors of its demise are always greatly exaggerated so gradually raise social security retirement age maybe only on people not yet born\nhe told me that a few months ago he said hes ninety eight percent positive theyre going to resolve it\namericans are about fifty fifty whether theyre democrats or republicans reduce medicare for very wealthy seniors seniors who make a lot of money dont even eliminate it just reduce it people generally are\nwe are not a nation thats powerfully divided on the major major issue were comfortable with it needing some tweaks but we want to keep it were not open to a discussion of eliminating it\nand i got an email from him today saying all right were basically on track but now im eighty percent positive that theyre going to resolve it\nnow there is one issue that is hyper partisan and where there is one party that is just spend spend spend we dont care spend some more and that of course is republicans when it comes to military defense spending they way outweigh democrats the vast majority want to protect\nmilitary defense spending thats twenty percent of the budget\nand that presents a more difficult issue\ni should also note that the discretionary spending which is about nineteen percent of the budget that is democratic and republican issues so you do have welfare food stamps other programs that tend to be popular among democrats but you also have the farm bill and all sorts of department of interior inducements for\noil drilling and other things which tend to be popular among republicans\nnow when it comes to taxes there is more disagreement thats a more partisan area you have democrats overwhelmingly supportive of raising the income tax on people who make two hundred and fifty thousand dollars a year republicans\nsort of against it although if you break it out by income republicans who make less than seventy five thousand dollars a year like this idea so basically republicans who make more than two hundred and fifty thousand dollars a year dont want to be taxed\nraising taxes on investment income you also see about two thirds of democrats but only one third of republicans are comfortable with that idea\nand it made me think i love studying these moments in american history when there was this frenzy of partisan anger that the economy was on the verge of total collapse\nthis brings up a really important point which is that we tend in this country to talk about democrats and republicans and think theres this little group over there called independents thats what two percent\nif you add democrats you add republicans youve got the american people\nbut that is not the case at all and it has not been the case for most of modern american history roughly a third of americans say that they are democrats around a quarter say that they are republicans a tiny little sliver\ncall themselves libertarians or socialists or some other small third party\nand the largest block forty percent say theyre independents so most americans are not partisan and most of the people in the independent camp fall somewhere in between so even though we have tremendous overlap between the views on these fiscal issues of democrats and republicans\nwe have even more overlap when you add in the independents\nnow we get to fight about all sorts of other issues we get to hate each other on gun control and abortion and the environment\nbut on these fiscal issues these important fiscal issues we just are not anywhere nearly as divided as people say and in fact theres this other group of people who are not as divided as people might think and that group is economists\ni talk to a lot of economists and\nyou were a free market capitalist economist or you were a keynesian liberal economist and these people didnt go to each others weddings\nthe most famous early battle was alexander hamilton and thomas jefferson over what the dollar would be and how it would be backed up with alexander hamilton saying we need a central bank the first bank of the united states or else the dollar will have no value this economy wont work and\nbut in my experience it is really really hard to find an economist under forty who still has that kind of way of seeing the world the vast majority of economists it is so uncool to call yourself an ideologue of either camp\nthe phrase that you want if youre a graduate student or a postdoc or youre a professor a thirty eight year old economics professor is im an empiricist i go by the data\nand the data is very clear none of these major theories have been completely successful the twentieth century the last hundred years is riddled with disastrous examples of times that one school or the other tried to explain the past or predict the future and just did an awful awful job so\nthe economics profession has acquired some degree of modesty\nthey still are an awfully arrogant group of people i will assure you but theyre now arrogant about their impartiality and they too see a tremendous range of potential outcomes\nand this nonpartisanship is something that exists that has existed in secret in america for years and years and years ive spent a lot of the fall\ntalking to the three major organizations that survey american political attitudes pew research the university of chicagos national opinion research center and\nsupport no we mustnt tax and we must limit the size of government or no we must encourage government to play a larger role in redistribution and correcting the ills of capitalism those groups are very very small the vast majority of people\nthey pick and choose they see compromise and they change over time when they hear a better argument or a worse argument\nand that part of it has not changed what has changed is how people respond to vague questions if you ask people vague questions like\ndo you think there should be more government or less government do you think government\nshould especially if you use loaded language do you think the government should provide handouts or do you think the government should redistribute then you can see radical partisan change but when you get specific when you actually ask about the actual taxing and spending issues under consideration\nthomas jefferson saying the people wont trust that they just fought off a king theyre not going to accept some central authority this battle defined the first one hundred and fifty years of the u s economy and at every moment different partisans saying oh my god the economys about to collapse\npeople are remarkably centrist theyre remarkably open to compromise\nso what we have then when you think about the fiscal cliff dont think of it as\nthe american people fundamentally cant stand each other on these issues and that we must be ripped apart into two separate warring nations\nthink of it as a tiny tiny number of ancient economists\nand misrepresentative ideologues have captured the process and theyve captured the process through familiar ways through a primary system which encourages that small group of peoples voices\nbecause that small group of people the people who answer all yeses or all noes on those ideological questions they might be small but every one of them has a blog every one of them has been on fox or msnbc in the last week\nevery one of them becomes a louder and louder voice but they dont represent us they dont represent what our views are\nand that gets me back to the dollar and it gets me back to reminding myself that we know this experience we know what its like\nto have these people on tv in congress yelling about how the end of the world is coming if we dont adopt their view completely because its happened about the dollar ever since theres been a dollar\nrock a mustache not a beard not a goatee a mustache for the thirty days of november and then we agreed that we would come together at the end of the month have a mustache themed party\nand award a prize for the best and of course the worst mustache\nthink the beautiful malin akerman put it perfectly every man deserves the opportunity to grow a little bit of luxury\nhipster mustache\nit created a lot of controversy\nhated it parents would shuffle kids away from\nwe came together at the end of the month and we celebrated our journey and it was a real journey and we had a lot of fun and in two thousand and four i said to the guys that was so much fun we need to legitimize this so we can get away with it year on year\nso we married growing a mustache with prostate cancer and then we created our tagline which is changing the face of mens health and that eloquently describes the challenge changing your appearance for the thirty days and also the outcome that were trying to achieve getting men engaged in their health\nthe ceo of the prostate cancer foundation\ni said to him ive got the most amazing idea thats going to transform your organization\nand funds for his organization\nand i said were going to come together at the end were going to have a mustache themed party were going to have djs were going to celebrate life and were going to change the face of mens health and he just looked at me and laughed and he said\nbut were an ultraconservative organization we cant have anything to do with you\n"
  },
  {
    "path": "data/ted/.gitkeep",
    "content": ""
  },
  {
    "path": "doc/BUILDING.rst",
    "content": ".. _build-native-client:\n\nBuilding DeepSpeech Binaries\n============================\n\nThis section describes how to rebuild binaries. We have already several prebuilt binaries for all the supported platform,\nit is highly advised to use them except if you know what you are doing.\n\nIf you'd like to build the DeepSpeech binaries yourself, you'll need the following pre-requisites downloaded and installed:\n\n* `Bazel 3.1.0 <https://github.com/bazelbuild/bazel/releases/tag/3.1.0>`_\n* `General TensorFlow r2.3 requirements <https://www.tensorflow.org/install/source#tested_build_configurations>`_\n* `libsox <https://sourceforge.net/projects/sox/>`_\n\nIt is required to use our fork of TensorFlow since it includes fixes for common problems encountered when building the native client files.\n\nIf you'd like to build the language bindings or the decoder package, you'll also need:\n\n.. _swig-dep:\n\n* `SWIG >= 4.0 <http://www.swig.org/>`_.\n  Unfortunately, NodeJS / ElectronJS after 10.x support on SWIG is a bit behind, but patches have been merged and 4.1 is good.\n  The proper prebuilt patched version (covering linux, windows and macOS) of SWIG should get installed under `native_client/ <native_client/>`_ as soon as you build any bindings that requires it.\n  Prebuilt versions for linux, macOS and Windows are `available (look for ds-swig*.tar.gz) <https://github.com/mozilla/DeepSpeech/releases/tag/v0.9.3>`_\n\n* `node-pre-gyp <https://github.com/mapbox/node-pre-gyp>`_ (for Node.JS bindings only)\n\nDependencies\n------------\n\nIf you follow these instructions, you should compile your own binaries of DeepSpeech (built on TensorFlow using Bazel).\n\nFor more information on configuring TensorFlow, read the docs up to the end of `\"Configure the Build\" <https://www.tensorflow.org/install/source#configure_the_build>`_.\n\nCheckout source code\n^^^^^^^^^^^^^^^^^^^^\n\nClone DeepSpeech source code (TensorFlow will come as a submdule):\n\n.. code-block::\n\n   git clone https://github.com/mozilla/DeepSpeech.git\n   git submodule sync tensorflow/\n   git submodule update --init tensorflow/\n\nBazel: Download & Install\n^^^^^^^^^^^^^^^^^^^^^^^^^\n\nFirst, install Bazel 3.1.0 following the `Bazel installation documentation <https://docs.bazel.build/versions/3.1.0/install.html>`_.\n\nTensorFlow: Configure with Bazel\n^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^\n\nAfter you have installed the correct version of Bazel, configure TensorFlow:\n\n.. code-block::\n\n   cd tensorflow\n   ./configure\n\nCompile DeepSpeech\n------------------\n\nCompile ``libdeepspeech.so``\n^^^^^^^^^^^^^^^^^^^^^^^^^^^^\n\nWithin your TensorFlow directory, there should be a symbolic link to the DeepSpeech ``native_client`` directory. If it is not present, create it with the follow command:\n\n.. code-block::\n\n   cd tensorflow\n   ln -s ../native_client\n\nYou can now use Bazel to build the main DeepSpeech library, ``libdeepspeech.so``. Add ``--config=cuda`` if you want a CUDA build.\n\n.. code-block::\n\n   bazel build --workspace_status_command=\"bash native_client/bazel_workspace_status_cmd.sh\" --config=monolithic -c opt --copt=-O3 --copt=\"-D_GLIBCXX_USE_CXX11_ABI=0\" --copt=-fvisibility=hidden //native_client:libdeepspeech.so\n\nThe generated binaries will be saved to ``bazel-bin/native_client/``.\n\n.. _build-generate-scorer-package:\n\nCompile ``generate_scorer_package``\n^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^\n\nFollowing the same setup as for ``libdeepspeech.so`` above, you can rebuild the ``generate_scorer_package`` binary by adding its target to the command line: ``//native_client:generate_scorer_package``.\nUsing the example from above you can build the library and that binary at the same time:\n\n.. code-block::\n\n   bazel build --workspace_status_command=\"bash native_client/bazel_workspace_status_cmd.sh\" --config=monolithic -c opt --copt=-O3 --copt=\"-D_GLIBCXX_USE_CXX11_ABI=0\" --copt=-fvisibility=hidden //native_client:libdeepspeech.so //native_client:generate_scorer_package\n\nThe generated binaries will be saved to ``bazel-bin/native_client/``.\n\nCompile Language Bindings\n^^^^^^^^^^^^^^^^^^^^^^^^^\n\nNow, ``cd`` into the ``DeepSpeech/native_client`` directory and use the ``Makefile`` to build all the language bindings (C++ client, Python package, Nodejs package, etc.).\n\n.. code-block::\n\n   cd ../DeepSpeech/native_client\n   make deepspeech\n\nInstalling your own Binaries\n----------------------------\n\nAfter building, the library files and binary can optionally be installed to a system path for ease of development. This is also a required step for bindings generation.\n\n.. code-block::\n\n   PREFIX=/usr/local sudo make install\n\nIt is assumed that ``$PREFIX/lib`` is a valid library path, otherwise you may need to alter your environment.\n\nInstall Python bindings\n^^^^^^^^^^^^^^^^^^^^^^^\n\nIncluded are a set of generated Python bindings. After following the above build and installation instructions, these can be installed by executing the following commands (or equivalent on your system):\n\n.. code-block::\n\n   cd native_client/python\n   make bindings\n   pip install dist/deepspeech*\n\nThe API mirrors the C++ API and is demonstrated in `client.py <python/client.py>`_. Refer to `deepspeech.h <deepspeech.h>`_ for documentation.\n\nInstall NodeJS / ElectronJS bindings\n^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^\n\nAfter following the above build and installation instructions, the Node.JS bindings can be built:\n\n.. code-block::\n\n   cd native_client/javascript\n   make build\n   make npm-pack\n\nThis will create the package ``deepspeech-VERSION.tgz`` in ``native_client/javascript``.\n\nInstall the CTC decoder package\n^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^\n\nTo build the ``ds_ctcdecoder`` package, you'll need the general requirements listed above (in particular :ref:`SWIG <swig-dep>`). The command below builds the bindings using eight (8) processes for compilation. Adjust the parameter accordingly for more or less parallelism.\n\n.. code-block::\n\n   cd native_client/ctcdecode\n   make bindings NUM_PROCESSES=8\n   pip install dist/*.whl\n\n\nBuilding CTC Decoder for training on unsupported platforms\n^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^\n\nWe only support building CTC Decoder on x86-64 architecture.\nHowever, we offer some hints on building the CTC decoder on other\narchitectures, and you might find some help in our `discourse <https://discourse.mozilla.org/>`.\n\nFeedback on improving this section or usage on other architectures is welcome.\n\nFirst, you need to build SWIG from scratch. See :ref:`SWIG dep <swig-dep>` for details.\n\nYou can supply your prebuild SWIG using ``SWIG_DIST_URL``\n\nMoreover you may have to change ``PYTHON_PLATFORM_NAME`` corresponding to your platform.\n\n.. code-block::\n\n    # PowerPC (ppc64le)\n    PYTHON_PLATFORM_NAME=\"--plat-name linux_ppc64le\"\n\n\nComplete build command:\n\n.. code-block::\n\n    SWIG_DIST_URL=[...] PYTHON_PLATFORM_NAME=[...] make bindings\n    pip install dist/*.whl\n\nCross-building\n--------------\n\nRPi3 ARMv7 and LePotato ARM64\n^^^^^^^^^^^^^^^^^^^^^^^^^^^^^\n\nWe do support cross-compilation. Please refer to our ``mozilla/tensorflow`` fork, where we define the following ``--config`` flags:\n\n\n* ``--config=rpi3`` and ``--config=rpi3_opt`` for Raspbian / ARMv7\n* ``--config=rpi3-armv8`` and ``--config=rpi3-armv8_opt`` for ARMBian / ARM64\n\nSo your command line for ``RPi3`` and ``ARMv7`` should look like:\n\n.. code-block::\n\n   bazel build --workspace_status_command=\"bash native_client/bazel_workspace_status_cmd.sh\" --config=monolithic --config=rpi3 --config=rpi3_opt -c opt --copt=-O3 --copt=-fvisibility=hidden //native_client:libdeepspeech.so\n\nAnd your command line for ``LePotato`` and ``ARM64`` should look like:\n\n.. code-block::\n\n   bazel build --workspace_status_command=\"bash native_client/bazel_workspace_status_cmd.sh\" --config=monolithic --config=rpi3-armv8 --config=rpi3-armv8_opt -c opt --copt=-O3 --copt=-fvisibility=hidden //native_client:libdeepspeech.so\n\nWhile we test only on RPi3 Raspbian Buster and LePotato ARMBian Buster, anything compatible with ``armv7-a cortex-a53`` or ``armv8-a cortex-a53`` should be fine.\n\nThe ``deepspeech`` binary can also be cross-built, with ``TARGET=rpi3`` or ``TARGET=rpi3-armv8``. This might require you to setup a system tree using the tool ``multistrap`` and the multitrap configuration files: ``native_client/multistrap_armbian64_buster.conf`` and ``native_client/multistrap_raspbian_buster.conf``.\nThe path of the system tree can be overridden from the default values defined in ``definitions.mk`` through the ``RASPBIAN`` ``make`` variable.\n\n.. code-block::\n\n   cd ../DeepSpeech/native_client\n   make TARGET=<system> deepspeech\n\nAndroid devices support\n-----------------------\n\nWe have support for Android relying on TensorFlow Lite, with Java and JNI bindinds. For more details on how to experiment with those, please refer to the section below.\n\nPlease refer to TensorFlow documentation on how to setup the environment to build for Android (SDK and NDK required).\n\nUsing the library from Android project\n^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^\n\nWe provide uptodate and tested ``libdeepspeech`` usable as an ``AAR`` package,\nfor Android versions starting with 7.0 to 11.0. The package is published on\n`JCenter <https://bintray.com/alissy/org.mozilla.deepspeech/libdeepspeech>`_,\nand the ``JCenter`` repository should be available by default in any Android\nproject.  Please make sure your project is setup to pull from this repository.\nYou can then include the library by just adding this line to your\n``gradle.build``, adjusting ``VERSION`` to  the version you need:\n\n.. code-block::\n\n   implementation 'deepspeech.mozilla.org:libdeepspeech:VERSION@aar'\n\nBuilding ``libdeepspeech.so``\n^^^^^^^^^^^^^^^^^^^^^^^^^^^^^\n\nYou can build the ``libdeepspeech.so`` using (ARMv7):\n\n.. code-block::\n\n   bazel build --workspace_status_command=\"bash native_client/bazel_workspace_status_cmd.sh\" --config=monolithic --config=android --config=android_arm --define=runtime=tflite --action_env ANDROID_NDK_API_LEVEL=21 --cxxopt=-std=c++14 --copt=-D_GLIBCXX_USE_C99 //native_client:libdeepspeech.so\n\nOr (ARM64):\n\n.. code-block::\n\n   bazel build --workspace_status_command=\"bash native_client/bazel_workspace_status_cmd.sh\" --config=monolithic --config=android --config=android_arm64 --define=runtime=tflite --action_env ANDROID_NDK_API_LEVEL=21 --cxxopt=-std=c++14 --copt=-D_GLIBCXX_USE_C99 //native_client:libdeepspeech.so\n\nBuilding ``libdeepspeech.aar``\n^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^\n\nIn the unlikely event you have to rebuild the JNI bindings, source code is\navailable under the ``libdeepspeech`` subdirectory.  Building depends on shared\nobject: please ensure to place ``libdeepspeech.so`` into the\n``libdeepspeech/libs/{arm64-v8a,armeabi-v7a,x86_64}/`` matching subdirectories.\n\nBuilding the bindings is managed by ``gradle`` and should be limited to issuing\n``./gradlew libdeepspeech:build``, producing an ``AAR`` package in\n``./libdeepspeech/build/outputs/aar/``.\n\nPlease note that you might have to copy the file to a local Maven repository\nand adapt file naming (when missing, the error message should states what\nfilename it expects and where).\n\nBuilding C++ ``deepspeech`` binary\n^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^\n\nBuilding the ``deepspeech`` binary will happen through ``ndk-build`` (ARMv7):\n\n.. code-block::\n\n   cd ../DeepSpeech/native_client\n   $ANDROID_NDK_HOME/ndk-build APP_PLATFORM=android-21 APP_BUILD_SCRIPT=$(pwd)/Android.mk NDK_PROJECT_PATH=$(pwd) APP_STL=c++_shared TFDIR=$(pwd)/../tensorflow/ TARGET_ARCH_ABI=armeabi-v7a\n\nAnd (ARM64):\n\n.. code-block::\n\n   cd ../DeepSpeech/native_client\n   $ANDROID_NDK_HOME/ndk-build APP_PLATFORM=android-21 APP_BUILD_SCRIPT=$(pwd)/Android.mk NDK_PROJECT_PATH=$(pwd) APP_STL=c++_shared TFDIR=$(pwd)/../tensorflow/ TARGET_ARCH_ABI=arm64-v8a\n\nAndroid demo APK\n^^^^^^^^^^^^^^^^\n\nProvided is a very simple Android demo app that allows you to test the library.\nYou can build it with ``make apk`` and install the resulting APK file. Please\nrefer to Gradle documentation for more details.\n\nThe ``APK`` should be produced in ``/app/build/outputs/apk/``. This demo app might\nrequire external storage permissions. You can then push models files to your\ndevice, set the path to the file in the UI and try to run on an audio file.\nWhen running, it should first play the audio file and then run the decoding. At\nthe end of the decoding, you should be presented with the decoded text as well\nas time elapsed to decode in miliseconds.\n\nThis application is very limited on purpose, and is only here as a very basic\ndemo of one usage of the application. For example, it's only able to read PCM\nmono 16kHz 16-bits file and it might fail on some WAVE file that are not\nfollowing exactly the specification.\n\nRunning ``deepspeech`` via adb\n^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^\n\nYou should use ``adb push`` to send data to device, please refer to Android\ndocumentation on how to use that.\n\nPlease push DeepSpeech data to ``/sdcard/deepspeech/``\\ , including:\n\n\n* ``output_graph.tflite`` which is the TF Lite model\n* External scorer file (available from one of our releases), if you want to use\n  the scorer; please be aware that too big scorer will make the device run out\n  of memory\n\nThen, push binaries from ``native_client.tar.xz`` to ``/data/local/tmp/ds``\\ :\n\n* ``deepspeech``\n* ``libdeepspeech.so``\n* ``libc++_shared.so``\n\nYou should then be able to run as usual, using a shell from ``adb shell``\\ :\n\n.. code-block::\n\n   user@device$ cd /data/local/tmp/ds/\n   user@device$ LD_LIBRARY_PATH=$(pwd)/ ./deepspeech [...]\n\nPlease note that Android linker does not support ``rpath`` so you have to set\n``LD_LIBRARY_PATH``. Properly wrapped / packaged bindings does embed the library\nat a place the linker knows where to search, so Android apps will be fine.\n\nDelegation API\n^^^^^^^^^^^^^^\n\nTensorFlow Lite supports Delegate API to offload some computation from the main\nCPU. Please refer to `TensorFlow's documentation\n<https://www.tensorflow.org/lite/performance/delegates>`_ for details.\n\nTo ease with experimentations, we have enabled some of those delegations on our\nAndroid builds: * GPU, to leverage OpenGL capabilities * NNAPI, the Android API\nto leverage GPU / DSP / NPU * Hexagon, the Qualcomm-specific DSP\n\nThis is highly experimental:\n\n* Requires passing environment variable ``DS_TFLITE_DELEGATE`` with values of\n  ``gpu``, ``nnapi`` or ``hexagon`` (only one at a time)\n* Might require exported model changes (some Op might not be supported)\n* We can't guarantee it will work, nor it will be faster than default\n  implementation\n\nFeedback on improving this is welcome: how it could be exposed in the API, how\nmuch performance gains do you get in your applications, how you had to change\nthe model to make it work with a delegate, etc.\n\nSee :ref:`the support / contact details <support>`\n"
  },
  {
    "path": "doc/BUILDING_DotNet.rst",
    "content": ".. _build-native-client-dotnet:\n\nBuilding DeepSpeech native client for Windows\n=============================================\n\nNow we can build the native client of DeepSpeech and run inference on Windows using the C# client, to do that we need to compile the ``native_client``.\n\n**Table of Contents**\n\n\n* `Prerequisites <#prerequisites>`_\n* `Getting the code <#getting-the-code>`_\n* `Configuring the paths <#configuring-the-paths>`_\n* `Adding environment variables <#adding-environment-variables>`_\n\n  * `MSYS2 paths <#msys2-paths>`_\n  * `BAZEL path <#bazel-path>`_\n  * `Python path <#python-path>`_\n  * `CUDA paths <#cuda-paths>`_\n\n* `Building the native_client <#building-the-native_client>`_\n\n  * `Build for CPU <#cpu>`_\n  * `Build with CUDA support <#gpu-with-cuda>`_\n\n* `Using the generated library <#using-the-generated-library>`_\n\nPrerequisites\n-------------\n\n\n* Windows 10\n* `Windows 10 SDK <https://developer.microsoft.com/en-us/windows/downloads/windows-10-sdk>`_\n* `Visual Studio 2019 Community <https://visualstudio.microsoft.com/vs/community/>`_ v16.5.4.0\n* `Visual Studio 2019 BuildTools <https://visualstudio.microsoft.com/vs/community/>`_ v16.5.4.0\n* `TensorFlow Windows pre-requisites <https://www.tensorflow.org/install/source_windows>`_\n\nInside the Visual Studio Installer enable ``MS Build Tools`` and ``VC++ 2019 v16.00 (v160) toolset for desktop``.\n\nIf you want to enable CUDA support you need to follow the steps in `the TensorFlow docs for building on Windows with CUDA <https://www.tensorflow.org/install/gpu#windows_setup>`_.\n\nWe highly recommend sticking to the recommended versions of CUDA/cuDNN in order to avoid compilation errors caused by incompatible versions. We only test with the versions recommended by TensorFlow.\n\nGetting the code\n----------------\n\nWe need to clone ``mozilla/DeepSpeech``.\n\n.. code-block:: bash\n\n   git clone https://github.com/mozilla/DeepSpeech\n   git submodule sync tensorflow/\n   git submodule update --init tensorflow/\n\nConfiguring the paths\n---------------------\n\nThere should already be a symbolic link, for this example let's suppose that we cloned into ``D:\\cloned`` and now the structure looks like:\n\n.. code-block::\n\n   .\n   ├── D:\\\n   │   ├── cloned                 # Contains DeepSpeech and tensorflow side by side\n   │   │   └── DeepSpeech         # Root of the cloned DeepSpeech\n   │   │       ├── tensorflow     # Root of the cloned mozilla/tensorflow \n   └── ...\n\n\nChange your path accordingly to your path structure, for the structure above we are going to use the following command if the symbolic link does not exists:\n\n.. code-block:: bash\n\n   mklink /d \"D:\\cloned\\DeepSpeech\\tensorflow\\native_client\" \"D:\\cloned\\DeepSpeech\\native_client\"\n\nAdding environment variables\n----------------------------\n\nAfter you have installed the requirements there are few environment variables that we need to add to our ``PATH`` variable of the system variables.\n\nMSYS2 paths\n~~~~~~~~~~~\n\nFor MSYS2 we need to add ``bin`` directory, if you installed in the default route the path that we need to add should looks like ``C:\\msys64\\usr\\bin``. Now we can run ``pacman``:\n\n.. code-block:: bash\n\n   pacman -Syu\n   pacman -Su\n   pacman -S patch unzip\n\nBAZEL path\n~~~~~~~~~~\n\nFor BAZEL we need to add the path to the executable, make sure you rename the executable to ``bazel``.\n\nTo check the version installed you can run:\n\n.. code-block:: bash\n\n   bazel version\n\nPYTHON path\n~~~~~~~~~~~\n\nAdd your ``python.exe`` path to the ``PATH`` variable.\n\nCUDA paths\n~~~~~~~~~~\n\nIf you run CUDA enabled ``native_client`` we need to add the following to the ``PATH`` variable.\n\n.. code-block::\n\n   C:\\Program Files\\NVIDIA GPU Computing Toolkit\\CUDA\\v10.1\\bin\n\nBuilding the native_client\n^^^^^^^^^^^^^^^^^^^^^^^^^^\n\nThere's one last command to run before building, you need to run the `configure.py <https://github.com/mozilla/tensorflow/blob/master/configure.py>`_ inside ``tensorflow`` cloned directory.\n\nAt this point we are ready to start building the ``native_client``, go to ``tensorflow`` sub-directory, following our examples should be ``D:\\cloned\\DeepSpeech\\tensorflow``.  \n\nCPU\n~~~\n\nWe will add AVX/AVX2 support in the command, please make sure that your CPU supports these instructions before adding the flags, if not you can remove them.\n\n.. code-block:: bash\n\n   bazel build --workspace_status_command=\"bash native_client/bazel_workspace_status_cmd.sh\" -c opt --copt=/arch:AVX --copt=/arch:AVX2 //native_client:libdeepspeech.so\n\nGPU with CUDA\n~~~~~~~~~~~~~\n\nIf you enabled CUDA in `configure.py <https://github.com/mozilla/tensorflow/blob/master/configure.py>`_ configuration command now you can add ``--config=cuda`` to compile with CUDA support.\n\n.. code-block:: bash\n\n   bazel build --workspace_status_command=\"bash native_client/bazel_workspace_status_cmd.sh\" -c opt --config=cuda --copt=/arch:AVX --copt=/arch:AVX2 //native_client:libdeepspeech.so\n\nBe patient, if you enabled AVX/AVX2 and CUDA it will take a long time. Finally you should see it stops and shows the path to the generated ``libdeepspeech.so``.\n\nUsing the generated library\n---------------------------\n\nAs for now we can only use the generated ``libdeepspeech.so`` with the C# clients, go to `native_client/dotnet/ <https://github.com/mozilla/DeepSpeech/tree/master/native_client/dotnet>`_ in your DeepSpeech directory and open the Visual Studio solution, then we need to build in debug or release mode, finally we just need to copy ``libdeepspeech.so`` to the generated ``x64/Debug`` or ``x64/Release`` directory.\n"
  },
  {
    "path": "doc/C-API.rst",
    "content": ".. _c-usage:\n\nC API\n=====\n\n.. toctree::\n   :maxdepth: 2\n\n   Structs\n\nSee also the list of error codes including descriptions for each error in :ref:`error-codes`.\n\n.. doxygenfunction:: DS_CreateModel\n   :project: deepspeech-c\n\n.. doxygenfunction:: DS_FreeModel\n   :project: deepspeech-c\n\n.. doxygenfunction:: DS_EnableExternalScorer\n   :project: deepspeech-c\n\n.. doxygenfunction:: DS_DisableExternalScorer\n   :project: deepspeech-c\n\n.. doxygenfunction:: DS_AddHotWord\n   :project: deepspeech-c\n\n.. doxygenfunction:: DS_EraseHotWord\n   :project: deepspeech-c\n\n.. doxygenfunction:: DS_ClearHotWords\n   :project: deepspeech-c\n\n.. doxygenfunction:: DS_SetScorerAlphaBeta\n   :project: deepspeech-c\n\n.. doxygenfunction:: DS_GetModelSampleRate\n   :project: deepspeech-c\n\n.. doxygenfunction:: DS_SpeechToText\n   :project: deepspeech-c\n\n.. doxygenfunction:: DS_SpeechToTextWithMetadata\n   :project: deepspeech-c\n\n.. doxygenfunction:: DS_CreateStream\n   :project: deepspeech-c\n\n.. doxygenfunction:: DS_FeedAudioContent\n   :project: deepspeech-c\n\n.. doxygenfunction:: DS_IntermediateDecode\n   :project: deepspeech-c\n\n.. doxygenfunction:: DS_IntermediateDecodeWithMetadata\n   :project: deepspeech-c\n\n.. doxygenfunction:: DS_FinishStream\n   :project: deepspeech-c\n\n.. doxygenfunction:: DS_FinishStreamWithMetadata\n   :project: deepspeech-c\n\n.. doxygenfunction:: DS_FreeStream\n   :project: deepspeech-c\n\n.. doxygenfunction:: DS_FreeMetadata\n   :project: deepspeech-c\n\n.. doxygenfunction:: DS_FreeString\n   :project: deepspeech-c\n\n.. doxygenfunction:: DS_Version\n   :project: deepspeech-c\n"
  },
  {
    "path": "doc/C-Examples.rst",
    "content": "C API Usage example\n===================\n\nExamples are from `native_client/client.cc`.\n\nCreating a model instance and loading model\n-------------------------------------------\n\n.. literalinclude:: ../native_client/client.cc\n   :language: c\n   :linenos:\n   :lineno-match:\n   :start-after: sphinx-doc: c_ref_model_start\n   :end-before: sphinx-doc: c_ref_model_stop\n\nPerforming inference\n--------------------\n\n.. literalinclude:: ../native_client/client.cc\n   :language: c\n   :linenos:\n   :lineno-match:\n   :start-after: sphinx-doc: c_ref_inference_start\n   :end-before: sphinx-doc: c_ref_inference_stop\n\nFull source code\n----------------\n\nSee :download:`Full source code<../native_client/client.cc>`.\n"
  },
  {
    "path": "doc/Contributed-Examples.rst",
    "content": "User contributed examples\n=========================\n\nThere are also several user contributed examples available on a separate examples repository: `https://github.com/mozilla/DeepSpeech-examples <https://github.com/mozilla/DeepSpeech-examples>`_.\n"
  },
  {
    "path": "doc/Decoder.rst",
    "content": ".. _decoder-docs:\n\nCTC beam search decoder\n=======================\n\nIntroduction\n^^^^^^^^^^^^\n\nDeepSpeech uses the `Connectionist Temporal Classification <http://www.cs.toronto.edu/~graves/icml_2006.pdf>`_ loss function. For an excellent explanation of CTC and its usage, see this Distill article: `Sequence Modeling with CTC <https://distill.pub/2017/ctc/>`_. This document assumes the reader is familiar with the concepts described in that article, and describes DeepSpeech specific behaviors that developers building systems with DeepSpeech should know to avoid problems.\n\nNote: Documentation for the tooling for creating custom scorer packages is available in :ref:`scorer-scripts`.\n\nThe key words \"MUST\", \"MUST NOT\", \"REQUIRED\", \"SHALL\", \"SHALL NOT\", \"SHOULD\", \"SHOULD NOT\", \"RECOMMENDED\",  \"MAY\", and \"OPTIONAL\" in this document are to be interpreted as described in `BCP 14 <https://tools.ietf.org/html/bcp14>`_ when, and only when, they appear in all capitals, as shown here.\n\n\nExternal scorer\n^^^^^^^^^^^^^^^\n\nDeepSpeech clients support OPTIONAL use of an external language model to improve the accuracy of the predicted transcripts. In the code, command line parameters, and documentation, this is referred to as a \"scorer\". The scorer is used to compute the likelihood (also called a score, hence the name \"scorer\") of sequences of words or characters in the output, to guide the decoder towards more likely results. This improves accuracy significantly.\n\nThe use of an external scorer is fully optional. When an external scorer is not specified, DeepSpeech still uses a beam search decoding algorithm, but without any outside scoring.\n\nCurrently, the DeepSpeech external scorer is implemented with `KenLM <https://kheafield.com/code/kenlm/>`_, plus some tooling to package the necessary files and metadata into a single ``.scorer`` package. The tooling lives in ``data/lm/``. The scripts included in ``data/lm/`` can be used and modified to build your own language model based on your particular use case or language. See :ref:`scorer-scripts` for more details on how to reproduce our scorer file as well as create your own.\n\nThe scripts are geared towards replicating the language model files we release as part of `DeepSpeech model releases <https://github.com/mozilla/DeepSpeech/releases/latest>`_, but modifying them to use different datasets or language model construction parameters should be simple.\n\n\nDecoding modes\n^^^^^^^^^^^^^^\n\nDeepSpeech currently supports two modes of operation with significant differences at both training and decoding time. Note that Bytes output mode is experimental and has not been tested for languages other than Chinese Mandarin.\n\n\nDefault mode (alphabet based)\n^^^^^^^^^^^^^^^^^^^^^^^^^^^^^\n\nThe default mode, which uses an alphabet file (specified with ``--alphabet_config_path`` at training and export time) to determine which labels (characters), and how many of them, to predict in the output layer. At decoding time, if using an external scorer, it MUST be word based and MUST be built using the same alphabet file used for training. Word based means the text corpus used to build the scorer should contain words separated by whitespace. For most western languages, this is the default and requires no special steps from the developer when creating the scorer.\n\n\nBytes output mode\n^^^^^^^^^^^^^^^^^\n\n**Note**: Currently, Bytes output mode makes assumptions that hold for Chinese Mandarin models but do not hold for other language targets, such as not predicting spaces.\n\nIn bytes output mode the model predicts UTF-8 bytes directly instead of letters from an alphabet file. This idea was proposed in the paper `Bytes Are All You Need <https://arxiv.org/abs/1811.09021>`_. This mode is enabled with the ``--bytes_output_mode`` flag at training and export time. At training time, the alphabet file is not used. Instead, the model is forced to have 256 labels, with labels 0-254 corresponding to UTF-8 byte values 1-255, and label 255 is used for the CTC blank symbol. If using an external scorer at decoding time, it MUST be built according to the instructions that follow.\n\nBytes output mode can be useful for languages with very large alphabets, such as Mandarin written with Simplified Chinese characters. It may also be useful for building multi-language models, or as a base for transfer learning. Currently these cases are untested and unsupported. Note that bytes output mode makes assumptions that hold for Mandarin written with Simplified Chinese characters and may not hold for other languages.\n\nUTF-8 scorers are character based (more specifically, Unicode codepoint based), but the way they are used is similar to a word based scorer where each \"word\" is a sequence of UTF-8 bytes representing a single Unicode codepoint. This means that the input text used to create UTF-8 scorers should contain space separated Unicode codepoints. For example, the following input text:\n\n``早 上 好``\n\ncorresponds to the following three \"words\", or UTF-8 byte sequences:\n\n``E6 97 A9``\n``E4 B8 8A``\n``E5 A5 BD``\n\nAt decoding time, the scorer is queried every time a Unicode codepoint is predicted, instead of when a space character is predicted. From the language modeling perspective, this is a character based model. From the implementation perspective, this is a word based model, because each character is composed of multiple labels.\n\n**Acoustic models trained with ``--bytes_output_mode`` MUST NOT be used with an alphabet based scorer. Conversely, acoustic models trained with an alphabet file MUST NOT be used with a UTF-8 scorer.**\n\nUTF-8 scorers can be built by using an input corpus with space separated codepoints. If your corpus only contains single codepoints separated by spaces, ``generate_scorer_package`` should automatically enable bytes output mode, and it should print the message \"Looks like a character based model.\"\n\nIf the message \"Doesn't look like a character based model.\" is printed, you should double check your inputs to make sure it only contains single codepoints separated by spaces. Bytes output mode can be forced by specifying the ``--force_bytes_output_mode`` flag when running ``generate_scorer_package``, but it is NOT RECOMMENDED.\n\nSee :ref:`scorer-scripts` for more details on using ``generate_scorer_package``.\n\nBecause KenLM uses spaces as a word separator, the resulting language model will not include space characters in it. If you wish to use bytes output mode but still model spaces, you need to replace spaces in the input corpus with a different character **before** converting it to space separated codepoints. For example:\n\n.. code-block:: python\n\n   input_text = 'The quick brown fox jumps over the lazy dog'\n   spaces_replaced = input_text.replace(' ', '|')\n   space_separated = ' '.join(spaces_replaced)\n   print(space_separated)\n   # T h e | q u i c k | b r o w n | f o x | j u m p s | o v e r | t h e | l a z y | d o g\n\nThe character, '|' in this case, will then have to be replaced with spaces as a post-processing step after decoding.\n\n\nImplementation\n^^^^^^^^^^^^^^\n\nThe decoder source code can be found in ``native_client/ctcdecode``. The decoder is included in the language bindings and clients. In addition, there is a separate Python module which includes just the decoder and is needed for evaluation. A pre-built version of this package is automatically downloaded and installed when installing the training code. If you want or need to manually build and install it from source, see the :github:`native_client README <native_client/README.rst#install-the-ctc-decoder-package>`.\n"
  },
  {
    "path": "doc/DeepSpeech.rst",
    "content": "DeepSpeech Model\n================\n\nThe aim of this project is to create a simple, open, and ubiquitous speech\nrecognition engine. Simple, in that the engine should not require server-class\nhardware to execute. Open, in that the code and models are released under the\nMozilla Public License. Ubiquitous, in that the engine should run on many\nplatforms and have bindings to many different languages.\n\nThe architecture of the engine was originally motivated by that presented in\n`Deep Speech: Scaling up end-to-end speech recognition <http://arxiv.org/abs/1412.5567>`_.\nHowever, the engine currently differs in many respects from the engine it was\noriginally motivated by. The core of the engine is a recurrent neural network (RNN)\ntrained to ingest speech spectrograms and generate English text transcriptions.\n\nLet a single utterance :math:`x` and label :math:`y` be sampled from a training set\n\n.. math::\n    S = \\{(x^{(1)}, y^{(1)}), (x^{(2)}, y^{(2)}), . . .\\}.\n\nEach utterance, :math:`x^{(i)}` is a time-series of length :math:`T^{(i)}`\nwhere every time-slice is a vector of audio features,\n:math:`x^{(i)}_t` where :math:`t=1,\\ldots,T^{(i)}`.\nWe use MFCC's as our features; so :math:`x^{(i)}_{t,p}` denotes the :math:`p`-th MFCC feature\nin the audio frame at time :math:`t`. The goal of our RNN is to convert an input\nsequence :math:`x` into a sequence of character probabilities for the transcription\n:math:`y`, with :math:`\\hat{y}_t =\\mathbb{P}(c_t \\mid x)`,\nwhere for English :math:`c_t \\in \\{a,b,c, . . . , z, space, apostrophe, blank\\}`.\n(The significance of :math:`blank` will be explained below.)\n\nOur RNN model is composed of :math:`5` layers of hidden units.\nFor an input :math:`x`, the hidden units at layer :math:`l` are denoted :math:`h^{(l)}` with the\nconvention that :math:`h^{(0)}` is the input. The first three layers are not recurrent.\nFor the first layer, at each time :math:`t`, the output depends on the MFCC frame\n:math:`x_t` along with a context of :math:`C` frames on each side.\n(We use :math:`C = 9` for our experiments.)\nThe remaining non-recurrent layers operate on independent data for each time step.\nThus, for each time :math:`t`, the first :math:`3` layers are computed by:\n\n.. math::\n    h^{(l)}_t = g(W^{(l)} h^{(l-1)}_t + b^{(l)})\n\nwhere :math:`g(z) = \\min\\{\\max\\{0, z\\}, 20\\}` is a clipped rectified-linear (ReLu)\nactivation function and :math:`W^{(l)}`, :math:`b^{(l)}` are the weight matrix and bias\nparameters for layer :math:`l`. The fourth layer is a recurrent\nlayer `[1] <https://en.wikipedia.org/wiki/Recurrent_neural_network>`_.\nThis layer includes a set of hidden units with forward recurrence,\n:math:`h^{(f)}`:\n\n.. math::\n    h^{(f)}_t = g(W^{(4)} h^{(3)}_t + W^{(f)}_r h^{(f)}_{t-1} + b^{(4)})\n\nNote that :math:`h^{(f)}` must be computed sequentially from :math:`t = 1` to :math:`t = T^{(i)}`\nfor the :math:`i`-th utterance.\n\nThe fifth (non-recurrent) layer takes the forward units as inputs\n\n.. math::\n    h^{(5)} = g(W^{(5)} h^{(f)} + b^{(5)}).\n\nThe output layer is standard logits that correspond to the predicted character probabilities\nfor each time slice :math:`t` and character :math:`k` in the alphabet:\n\n.. math::\n    h^{(6)}_{t,k} = \\hat{y}_{t,k} = (W^{(6)} h^{(5)}_t)_k + b^{(6)}_k\n\nHere :math:`b^{(6)}_k` denotes the :math:`k`-th bias and :math:`(W^{(6)} h^{(5)}_t)_k` the :math:`k`-th\nelement of the matrix product.\n\nOnce we have computed a prediction for :math:`\\hat{y}_{t,k}`, we compute the CTC loss\n`[2] <http://www.cs.toronto.edu/~graves/preprint.pdf>`_ :math:`\\cal{L}(\\hat{y}, y)`\nto measure the error in prediction. (The CTC loss requires the :math:`blank` above\nto indicate transitions between characters.) During training, we can evaluate the gradient\n:math:`\\nabla \\cal{L}(\\hat{y}, y)` with respect to the network outputs given the\nground-truth character sequence :math:`y`. From this point, computing the gradient\nwith respect to all of the model parameters may be done via back-propagation\nthrough the rest of the network. We use the Adam method for training\n`[3] <http://arxiv.org/abs/1412.6980>`_.\n\nThe complete RNN model is illustrated in the figure below.\n\n.. image:: ../images/rnn_fig-624x598.png\n    :alt: DeepSpeech BRNN\n"
  },
  {
    "path": "doc/DotNet-API.rst",
    "content": ".NET Framework\n==============\n\n\nDeepSpeech Class\n----------------\n\n.. doxygenclass:: DeepSpeechClient::DeepSpeech\n   :project: deepspeech-dotnet\n   :members:\n\nDeepSpeechStream Class\n----------------------\n\n.. doxygenclass:: DeepSpeechClient::Models::DeepSpeechStream\n   :project: deepspeech-dotnet\n   :members:\n\nErrorCodes\n----------\n\nSee also the main definition including descriptions for each error in :ref:`error-codes`.\n\n.. doxygenenum:: DeepSpeechClient::Enums::ErrorCodes\n   :project: deepspeech-dotnet\n\nMetadata\n--------\n\n.. doxygenclass:: DeepSpeechClient::Models::Metadata\n   :project: deepspeech-dotnet\n   :members: Transcripts\n\nCandidateTranscript\n-------------------\n\n.. doxygenclass:: DeepSpeechClient::Models::CandidateTranscript\n   :project: deepspeech-dotnet\n   :members: Tokens, Confidence\n\nTokenMetadata\n-------------\n\n.. doxygenclass:: DeepSpeechClient::Models::TokenMetadata\n   :project: deepspeech-dotnet\n   :members: Text, Timestep, StartTime\n\nDeepSpeech Interface\n--------------------\n\n.. doxygeninterface:: DeepSpeechClient::Interfaces::IDeepSpeech\n   :project: deepspeech-dotnet\n   :members:\n"
  },
  {
    "path": "doc/DotNet-Examples.rst",
    "content": ".NET API Usage example\n======================\n\nExamples are from `native_client/dotnet/DeepSpeechConsole/Program.cs`.\n\nCreating a model instance and loading model\n-------------------------------------------\n\n.. literalinclude:: ../native_client/dotnet/DeepSpeechConsole/Program.cs\n   :language: csharp\n   :linenos:\n   :lineno-match:\n   :start-after: sphinx-doc: csharp_ref_model_start\n   :end-before: sphinx-doc: csharp_ref_model_stop\n\nPerforming inference\n--------------------\n\n.. literalinclude:: ../native_client/dotnet/DeepSpeechConsole/Program.cs\n   :language: csharp\n   :linenos:\n   :lineno-match:\n   :start-after: sphinx-doc: csharp_ref_inference_start\n   :end-before: sphinx-doc: csharp_ref_inference_stop\n\nFull source code\n----------------\n\nSee :download:`Full source code<../native_client/dotnet/DeepSpeechConsole/Program.cs>`.\n"
  },
  {
    "path": "doc/Error-Codes.rst",
    "content": ".. _error-codes:\n\nError codes\n===========\n\nBelow is the definition for all error codes used in the API, their numerical values, and a human readable description.\n\n.. literalinclude:: ../native_client/deepspeech.h\n   :language: c\n   :start-after: sphinx-doc: error_code_listing_start\n   :end-before: sphinx-doc: error_code_listing_end\n"
  },
  {
    "path": "doc/Flags.rst",
    "content": ".. _training-flags:\n\nCommand-line flags for the training scripts\n===========================================\n\nBelow you can find the definition of all command-line flags supported by the training scripts. This includes ``DeepSpeech.py``, ``evaluate.py``, ``evaluate_tflite.py``, ``transcribe.py`` and ``lm_optimizer.py``.\n\nFlags\n-----\n\n.. literalinclude:: ../training/deepspeech_training/util/flags.py\n   :language: python\n   :linenos:\n   :lineno-match:\n   :start-after: sphinx-doc: training_ref_flags_start\n   :end-before: sphinx-doc: training_ref_flags_end\n"
  },
  {
    "path": "doc/Geometry.rst",
    "content": "Geometric Constants\n===================\n\nThis is about several constants related to the geometry of the network.\n\nn_input\n-------\nEach of the at maximum ``n_steps`` vectors is a vector of MFCC features of a\ntime-slice of the speech sample. We will make the number of MFCC features\ndependent upon the sample rate of the data set. Generically, if the sample rate\nis 8kHz we use 13 features. If the sample rate is 16kHz we use 26 features...\nWe capture the dimension of these vectors, equivalently the number of MFCC\nfeatures, in the variable ``n_input``. By default ``n_input`` is 26.\n\nn_context\n---------\nAs previously mentioned, the RNN is not simply fed the MFCC features of a given\ntime-slice. It is fed, in addition, a context of :math:`C` frames on\neither side of the frame in question. The number of frames in this context is\ncaptured in the variable ``n_context``. By default ``n_context`` is 9.\n\nNext we will introduce constants that specify the geometry of some of the\nnon-recurrent layers of the network. We do this by simply specifying the number\nof units in each of the layers.\n\nn_hidden_1, n_hidden_2, n_hidden_5\n----------------------------------\n``n_hidden_1`` is the number of units in the first layer, ``n_hidden_2`` the number\nof units in the second, and  ``n_hidden_5`` the number in the fifth. We haven't\nforgotten about the third or sixth layer. We will define their unit count below.\n\nThe RNN consists of an LSTM RNN that works \"forward in time\":\n\n.. image:: ../images/LSTM3-chain.png\n    :alt: Image shows a diagram of a recurrent neural network with LSTM cells, with arrows depicting the flow of data from earlier time steps to later timesteps within the RNN.\n\nThe dimension of the cell state, the upper line connecting subsequent LSTM units,\nis independent of the input dimension.\n\nn_cell_dim\n----------\nHence, we are free to choose the dimension of this cell state independent of the\ninput dimension. We capture the cell state dimension in the variable ``n_cell_dim``.\n\nn_hidden_3\n----------\nThe number of units in the third layer, which feeds in to the LSTM, is\ndetermined by ``n_cell_dim`` as follows\n\n.. code:: python\n\n    n_hidden_3 = n_cell_dim\n\nn_hidden_6\n-----------\nThe variable ``n_hidden_6`` will hold the number of characters in the target\nlanguage plus one, for the :math:`blank`.\nFor English it is the cardinality of the set\n\n.. math::\n    \\{a,b,c, . . . , z, space, apostrophe, blank\\}\n\nwe referred to earlier.\n"
  },
  {
    "path": "doc/HotWordBoosting-Examples.rst",
    "content": "Hot-word boosting API Usage example\n===================================\n\nWith DeepSpeech 0.9 release a new API feature was introduced that allows boosting probability from the scorer of given words. It is exposed in all bindings (C, Python, JS, Java and .Net). \n\nCurrently, it provides three methods for the Model class:\n\n- ``AddHotWord(word, boost)``\n- ``EraseHotWord(word)`` \n- ``ClearHotWords()``\n\nExact API binding for the language you are using can be found in API Reference.\n\nGeneral usage\n-------------\n\nIt is worth noting that boosting non-existent words in scorer (mostly proper nouns) or a word that share no phonetic prefix with other word in the input audio don't change the final transcription. Additionally, hot-word that has a space will not be taken into consideration, meaning that combination of words can not be boosted and each word must be added as hot-word separately. \n\nAdjusting the boosting value\n----------------------------\n\nFor hot-word boosting it is hard to determine what the optimal value that one might be searching for is. Additionally, this is dependant on the input audio file. In practice, as it was reported by DeepSpeech users, the value should be not bigger than 20.0 for positive value boosting. Nevertheless, each usecase is different and you might need to adjust values on your own.\n\nThere is a user contributed script available on ``DeepSpeech-examples`` repository for adjusting boost values:\n\n`https://github.com/mozilla/DeepSpeech-examples/tree/master/hotword_adjusting <https://github.com/mozilla/DeepSpeech-examples/tree/master/hotword_adjusting>`_.\n\n\nPositive value boosting\n-----------------------\n\nBy adding a positive boost value to one of the words it is possible to increase the probability of the word occurence. This is particularly useful for detecting speech that is expected by the system. \n\nIn the output, overextensive positive boost value (e.g. 250.0 but it does vary) may cause a word following the boosted hot-word to be split into separate letters. This problem is related to the scorer structure and currently only way to avoid it is to tune boost to a lower value.  \n\nNegative value boosting\n-----------------------\n\nRespectively, applying negative boost value might cause the selected word to occur less frequently. Keep in mind that words forming similar sound of a boosted word might be used instead (e.g. homophones \"accept\" as \"except\") or it will be split into separate parts (e.g. \"another\" into \"an other\").\n\nPreviously mentioned problem where extensive boost value caused letter splitting doesn't arise for negative boost values.\n\nExample \n-------\n\nTo use hot-word boosting just add hot-words of your choice before performing an inference to a ``Model``. You can also erase boosting of a chosen word or clear it for all hot-words.\n\n.. code-block:: python\n\n\tds = Model(args.model)\n\t...\n\tds.addHotWord(word, boosting)\n\t...\n\tprint(ds.stt(audio))\n\t\nAdding boost value to a word repeatedly or erasing hot-word without previously boosting it results in an error.\n"
  },
  {
    "path": "doc/Java-API.rst",
    "content": "Java\n====\n\nDeepSpeechModel\n---------------\n\n.. doxygenclass:: org::deepspeech::libdeepspeech::DeepSpeechModel\n   :project: deepspeech-java\n   :members:\n\nMetadata\n--------\n\n.. doxygenclass:: org::deepspeech::libdeepspeech::Metadata\n   :project: deepspeech-java\n   :members: getNumTranscripts, getTranscript\n\nCandidateTranscript\n-------------------\n\n.. doxygenclass:: org::deepspeech::libdeepspeech::CandidateTranscript\n   :project: deepspeech-java\n   :members: getNumTokens, getConfidence, getToken\n\nTokenMetadata\n-------------\n.. doxygenclass:: org::deepspeech::libdeepspeech::TokenMetadata\n   :project: deepspeech-java\n   :members: getText, getTimestep, getStartTime\n"
  },
  {
    "path": "doc/Java-Examples.rst",
    "content": "Java API Usage example\n======================\n\nExamples are from `native_client/java/app/src/main/java/org/deepspeech/DeepSpeechActivity.java`.\n\nCreating a model instance and loading model\n-------------------------------------------\n\n.. literalinclude:: ../native_client/java/app/src/main/java/org/deepspeech/DeepSpeechActivity.java\n   :language: java\n   :linenos:\n   :lineno-match:\n   :start-after: sphinx-doc: java_ref_model_start\n   :end-before: sphinx-doc: java_ref_model_stop\n\nPerforming inference\n--------------------\n\n.. literalinclude:: ../native_client/java/app/src/main/java/org/deepspeech/DeepSpeechActivity.java\n   :language: java\n   :linenos:\n   :lineno-match:\n   :start-after: sphinx-doc: java_ref_inference_start\n   :end-before: sphinx-doc: java_ref_inference_stop\n\nFull source code\n----------------\n\nSee :download:`Full source code<../native_client/java/app/src/main/java/org/deepspeech/DeepSpeechActivity.java>`.\n"
  },
  {
    "path": "doc/Makefile",
    "content": "# Minimal makefile for Sphinx documentation\n#\n\n# You can set these variables from the command line.\nSPHINXOPTS    =\nSPHINXBUILD   = sphinx-build\nSPHINXPROJ    = DeepSpeech\nSOURCEDIR     = .\nBUILDDIR      = .build\n\nPIP_INSTALL   ?= pip3 install --user\n\n# Put it first so that \"make\" without argument is like \"make help\".\nhelp:\n\t@$(SPHINXBUILD) -M help \"$(SOURCEDIR)\" \"$(BUILDDIR)\" $(SPHINXOPTS) $(O)\n\n.PHONY: help pip3 Makefile\n\npip3:\n\t$(PIP_INSTALL) -r ../ci_scripts/docs-requirements.txt\n\nsubmodule:\n\tgit submodule update --init --remote -- ../doc/examples\n\n# Add submodule update dependency to Sphinx's \"html\" target\nhtml: Makefile submodule pip3\n\t@PATH=$$HOME/.local/bin:`pwd`/../node_modules/.bin/:$$PATH \\\n\t     $(SPHINXBUILD) -M $@ \"$(SOURCEDIR)\" \"$(BUILDDIR)\" $(SPHINXOPTS) $(O)\n\ndist: html\n\tcd $(BUILDDIR)/html/ && zip -r9 ../../html.zip *\n\n# Catch-all target: route all unknown targets to Sphinx using the new\n# \"make mode\" option.  $(O) is meant as a shortcut for $(SPHINXOPTS).\n%: Makefile pip3\n\t@$(SPHINXBUILD) -M $@ \"$(SOURCEDIR)\" \"$(BUILDDIR)\" $(SPHINXOPTS) $(O)\n"
  },
  {
    "path": "doc/NodeJS-API.rst",
    "content": "JavaScript (NodeJS / ElectronJS)\n================================\n\nModel\n-----\n\n.. js:autoclass:: Model\n   :members:\n\nStream\n------\n\n.. js:autoclass:: StreamImpl\n   :members:\n\nModule exported methods\n-----------------------\n\n.. js:autofunction:: FreeModel\n\n.. js:autofunction:: FreeStream\n\n.. js:autofunction:: FreeMetadata\n\n.. js:autofunction:: Version\n\nMetadata\n--------\n\n.. js:autoclass:: Metadata\n   :members:\n\nCandidateTranscript\n-------------------\n\n.. js:autoclass:: CandidateTranscript\n   :members:\n\nTokenMetadata\n-------------\n\n.. js:autoclass:: TokenMetadata\n   :members:\n"
  },
  {
    "path": "doc/NodeJS-Examples.rst",
    "content": ".. _js-api-example:\n\nJavaScript API Usage example\n=============================\n\nExamples are from `native_client/javascript/client.ts`.\n\nCreating a model instance and loading model\n-------------------------------------------\n\n.. literalinclude:: ../native_client/javascript/client.ts\n   :language: javascript\n   :linenos:\n   :lineno-match:\n   :start-after: sphinx-doc: js_ref_model_start\n   :end-before: sphinx-doc: js_ref_model_stop\n\nPerforming inference\n--------------------\n\n.. literalinclude:: ../native_client/javascript/client.ts\n   :language: javascript\n   :linenos:\n   :lineno-match:\n   :start-after: sphinx-doc: js_ref_inference_start\n   :end-before: sphinx-doc: js_ref_inference_stop\n\nFull source code\n----------------\n\nSee :download:`Full source code<../native_client/javascript/client.ts>`.\n"
  },
  {
    "path": "doc/ParallelOptimization.rst",
    "content": "Parallel Optimization\n=====================\n\nThis is how we implement optimization of the DeepSpeech model across GPUs on a\nsingle host. Parallel optimization can take on various forms. For example\none can use asynchronous updates of the model, synchronous updates of the model,\nor some combination of the two.\n\nAsynchronous Parallel Optimization\n----------------------------------\n\nIn asynchronous parallel optimization, for example, one places the model\ninitially in CPU memory. Then each of the :math:`G` GPUs obtains a mini-batch of data\nalong with the current model parameters. Using this mini-batch each GPU then\ncomputes the gradients for all model parameters and sends these gradients back\nto the CPU when the GPU is done with its mini-batch. The CPU then asynchronously\nupdates the model parameters whenever it receives a set of gradients from a GPU.\n\nAsynchronous parallel optimization has several advantages and several\ndisadvantages. One large advantage is throughput. No GPU will ever be waiting\nidle. When a GPU is done processing a mini-batch, it can immediately obtain the\nnext mini-batch to process. It never has to wait on other GPUs to finish their\nmini-batch. However, this means that the model updates will also be asynchronous\nwhich can have problems.\n\nFor example, one may have model parameters :math:`W` on the CPU and send mini-batch\n:math:`n` to GPU 1 and send mini-batch :math:`n+1` to GPU 2. As processing is asynchronous,\nGPU 2 may finish before GPU 1 and thus update the CPU's model parameters :math:`W`\nwith its gradients :math:`\\Delta W_{n+1}(W)`, where the subscript :math:`n+1` identifies the\nmini-batch and the argument :math:`W` the location at which the gradient was evaluated.\nThis results in the new model parameters\n\n.. math::\n    W + \\Delta W_{n+1}(W).\n\nNext GPU 1 could finish with its mini-batch and update the parameters to\n\n.. math::\n    W + \\Delta W_{n+1}(W) + \\Delta W_{n}(W).\n\nThe problem with this is that :math:`\\Delta W_{n}(W)` is evaluated at :math:`W` and not\n:math:`W + \\Delta W_{n+1}(W)`. Hence, the direction of the gradient :math:`\\Delta W_{n}(W)`\nis slightly incorrect as it is evaluated at the wrong location. This can be\ncounteracted through synchronous updates of model, but this is also problematic.\n\nSynchronous Optimization\n------------------------\n\nSynchronous optimization solves the problem we saw above. In synchronous\noptimization, one places the model initially in CPU memory. Then one of the `G`\nGPUs is given a mini-batch of data along with the current model parameters.\nUsing the mini-batch the GPU computes the gradients for all model parameters and\nsends the gradients back to the CPU. The CPU then updates the model parameters\nand starts the process of sending out the next mini-batch.\n\nAs on can readily see, synchronous optimization does not have the problem we\nfound in the last section, that of incorrect gradients. However, synchronous\noptimization can only make use of a single GPU at a time. So, when we have a\nmulti-GPU setup, :math:`G > 1`, all but one of the GPUs will remain idle, which is\nunacceptable. However, there is a third alternative which is combines the\nadvantages of asynchronous and synchronous optimization.\n\nHybrid Parallel Optimization\n----------------------------\n\nHybrid parallel optimization combines most of the benefits of asynchronous and\nsynchronous optimization. It allows for multiple GPUs to be used, but does not\nsuffer from the incorrect gradient problem exhibited by asynchronous\noptimization.\n\nIn hybrid parallel optimization one places the model initially in CPU memory.\nThen, as in asynchronous optimization, each of the :math:`G` GPUs obtains a\nmini-batch of data along with the current model parameters. Using the mini-batch\neach of the GPUs then computes the gradients for all model parameters and sends\nthese gradients back to the CPU. Now, in contrast to asynchronous optimization,\nthe CPU waits until each GPU is finished with its mini-batch then takes the mean\nof all the gradients from the :math:`G` GPUs and updates the model with this mean\ngradient.\n\n.. image:: ../images/Parallelism.png\n    :alt: Image shows a diagram with arrows displaying the flow of information between devices during training. A CPU device sends weights and gradients to one or more GPU devices, which run an optimization step and then return the new parameters to the CPU, which averages them and starts a new training iteration.\n\nHybrid parallel optimization has several advantages and few disadvantages. As in\nasynchronous parallel optimization, hybrid parallel optimization allows for one\nto use multiple GPUs in parallel. Furthermore, unlike asynchronous parallel\noptimization, the incorrect gradient problem is not present here. In fact,\nhybrid parallel optimization performs as if one is working with a single\nmini-batch which is :math:`G` times the size of a mini-batch handled by a single GPU.\nHowever, hybrid parallel optimization is not perfect. If one GPU is slower than\nall the others in completing its mini-batch, all other GPUs will have to sit\nidle until this straggler finishes with its mini-batch. This hurts throughput.\nBut, if all GPUs are of the same make and model, this problem should be\nminimized.\n\nSo, relatively speaking, hybrid parallel optimization seems the have more\nadvantages and fewer disadvantages as compared to both asynchronous and\nsynchronous optimization. So, we will, for our work, use this hybrid model.\n\nAdam Optimization\n-----------------\n\nIn contrast to\n`Deep Speech: Scaling up end-to-end speech recognition <http://arxiv.org/abs/1412.5567>`_,\nin which `Nesterov’s Accelerated Gradient Descent <www.cs.toronto.edu/~fritz/absps/momentum.pdf>`_ was used, we will use the Adam method for optimization `[3] <http://arxiv.org/abs/1412.6980>`_,\nbecause, generally, it requires less fine-tuning.\n"
  },
  {
    "path": "doc/Python-API.rst",
    "content": "Python\n======\n\n.. automodule:: native_client.python\n\nModel\n-----\n\n.. autoclass:: Model\n   :members:\n\nStream\n------\n\n.. autoclass:: Stream\n   :members:\n\nMetadata\n--------\n\n.. autoclass:: Metadata\n   :members:\n\nCandidateTranscript\n-------------------\n\n.. autoclass:: CandidateTranscript\n   :members:\n\nTokenMetadata\n-------------\n\n.. autoclass:: TokenMetadata\n   :members:\n"
  },
  {
    "path": "doc/Python-Examples.rst",
    "content": ".. _py-api-example:\n\nPython API Usage example\n========================\n\nExamples are from `native_client/python/client.py`.\n\nCreating a model instance and loading model\n-------------------------------------------\n\n.. literalinclude:: ../native_client/python/client.py\n   :language: python\n   :linenos:\n   :lineno-match:\n   :start-after: sphinx-doc: python_ref_model_start\n   :end-before: sphinx-doc: python_ref_model_stop\n\nPerforming inference\n--------------------\n\n.. literalinclude:: ../native_client/python/client.py\n   :language: python\n   :linenos:\n   :lineno-match:\n   :start-after: sphinx-doc: python_ref_inference_start\n   :end-before: sphinx-doc: python_ref_inference_stop\n\nFull source code\n----------------\n\nSee :download:`Full source code<../native_client/python/client.py>`.\n"
  },
  {
    "path": "doc/SUPPORTED_PLATFORMS.rst",
    "content": ".. _supported-platforms-inference:\n\nSupported platforms for inference\n=================================\n\nHere we maintain the list of supported platforms for running inference.\n\nLinux / AMD64 without GPU\n^^^^^^^^^^^^^^^^^^^^^^^^^\n* x86-64 CPU with AVX/FMA (one can rebuild without AVX/FMA, but it might slow down inference)\n* Ubuntu 14.04+ (glibc >= 2.19, libstdc++6 >= 4.8)\n* Full TensorFlow runtime (``deepspeech`` packages)\n* TensorFlow Lite runtime (``deepspeech-tflite`` packages)\n\nLinux / AMD64 with GPU\n^^^^^^^^^^^^^^^^^^^^^^\n* x86-64 CPU with AVX/FMA (one can rebuild without AVX/FMA, but it might slow down inference)\n* Ubuntu 14.04+ (glibc >= 2.19, libstdc++6 >= 4.8)\n* CUDA 10.0 (and capable GPU)\n* Full TensorFlow runtime (``deepspeech`` packages)\n* TensorFlow Lite runtime (``deepspeech-tflite`` packages)\n\nLinux / ARMv7\n^^^^^^^^^^^^^\n* Cortex-A53 compatible ARMv7 SoC with Neon support\n* Raspbian Buster-compatible distribution\n* TensorFlow Lite runtime (``deepspeech-tflite`` packages)\n\nLinux / Aarch64\n^^^^^^^^^^^^^^^\n* Cortex-A72 compatible Aarch64 SoC\n* ARMbian Buster-compatible distribution\n* TensorFlow Lite runtime (``deepspeech-tflite`` packages)\n\nAndroid / ARMv7\n^^^^^^^^^^^^^^^\n* ARMv7 SoC with Neon support\n* Android 7.0-10.0\n* NDK API level >= 21\n* TensorFlow Lite runtime (``deepspeech-tflite`` packages)\n\nAndroid / Aarch64\n^^^^^^^^^^^^^^^^^\n* Aarch64 SoC\n* Android 7.0-10.0\n* NDK API level >= 21\n* TensorFlow Lite runtime (``deepspeech-tflite`` packages)\n\nmacOS / AMD64\n^^^^^^^^^^^^^\n* x86-64 CPU with AVX/FMA (one can rebuild without AVX/FMA, but it might slow down inference)\n* macOS >= 10.10\n* Full TensorFlow runtime (``deepspeech`` packages)\n* TensorFlow Lite runtime (``deepspeech-tflite`` packages)\n\nWindows / AMD64 without GPU\n^^^^^^^^^^^^^^^^^^^^^^^^^^^\n* x86-64 CPU with AVX/FMA (one can rebuild without AVX/FMA, but it might slow down inference)\n* Windows Server >= 2012 R2 ; Windows >= 8.1\n* Full TensorFlow runtime (``deepspeech`` packages)\n* TensorFlow Lite runtime (``deepspeech-tflite`` packages)\n\nWindows / AMD64 with GPU\n^^^^^^^^^^^^^^^^^^^^^^^^\n* x86-64 CPU with AVX/FMA (one can rebuild without AVX/FMA, but it might slow down inference)\n* Windows Server >= 2012 R2 ; Windows >= 8.1\n* CUDA 10.0 (and capable GPU)\n* Full TensorFlow runtime (``deepspeech`` packages)\n* TensorFlow Lite runtime (``deepspeech-tflite`` packages)\n"
  },
  {
    "path": "doc/Scorer.rst",
    "content": ".. _scorer-scripts:\n\nExternal scorer scripts\n=======================\n\nDeepSpeech pre-trained models include an external scorer. This document explains how to reproduce our external scorer, as well as adapt the scripts to create your own.\n\nThe scorer is composed of two sub-components, a KenLM language model and a trie data structure containing all words in the vocabulary. In order to create the scorer package, first we must create a KenLM language model (using ``data/lm/generate_lm.py``, and then use ``generate_scorer_package`` to create the final package file including the trie data structure.\n\nThe ``generate_scorer_package`` binary is part of the native client package that is included with official releases. You can find the appropriate archive for your platform in the `GitHub release downloads <https://github.com/mozilla/DeepSpeech/releases/latest>`_. The native client package is named ``native_client.{arch}.{config}.{plat}.tar.xz``, where ``{arch}`` is the architecture the binary was built for, for example ``amd64`` or ``arm64``, ``config`` is the build configuration, which for building decoder packages does not matter, and ``{plat}`` is the platform the binary was built-for, for example ``linux`` or ``osx``. If you wanted to run the ``generate_scorer_package`` binary on a Linux desktop, you would download ``native_client.amd64.cpu.linux.tar.xz``.\n\nReproducing our external scorer\n-------------------------------\n\nOur KenLM language model was generated from the LibriSpeech normalized LM training text, available `here <http://www.openslr.org/11>`_.\nIt is created with `KenLM <https://github.com/kpu/kenlm>`_.\n\nYou can download the LibriSpeech corpus with the following command:\n\n.. code-block:: bash\n\n    cd data/lm\n    wget http://www.openslr.org/resources/11/librispeech-lm-norm.txt.gz\n\nThen use the ``generate_lm.py`` script to generate ``lm.binary`` and ``vocab-500000.txt``.\n\nAs input you can use a plain text (e.g. ``file.txt``) or gzipped (e.g. ``file.txt.gz``) text file with one sentence in each line.\n\nIf you are using a container created from ``Dockerfile.build``, you can use ``--kenlm_bins /DeepSpeech/native_client/kenlm/build/bin/``.\nElse you have to build `KenLM <https://github.com/kpu/kenlm>`_ first and then pass the build directory to the script.\n\n.. code-block:: bash\n\n    cd data/lm\n    python3 generate_lm.py --input_txt librispeech-lm-norm.txt.gz --output_dir . \\\n      --top_k 500000 --kenlm_bins path/to/kenlm/build/bin/ \\\n      --arpa_order 5 --max_arpa_memory \"85%\" --arpa_prune \"0|0|1\" \\\n      --binary_a_bits 255 --binary_q_bits 8 --binary_type trie\n\n\nAfterwards you can use ``generate_scorer_package`` to generate the scorer package using the ``lm.binary`` and ``vocab-500000.txt`` files:\n\n.. code-block:: bash\n\n    cd data/lm\n    # Download and extract appropriate native_client package:\n    curl -LO http://github.com/mozilla/DeepSpeech/releases/...\n    tar xvf native_client.*.tar.xz\n    ./generate_scorer_package --alphabet ../alphabet.txt --lm lm.binary --vocab vocab-500000.txt \\\n      --package kenlm.scorer --default_alpha 0.931289039105002 --default_beta 1.1834137581510284\n\nThe ``generate_scorer_package`` binary is part of the released ``native_client.tar.xz``. If for some reason you need to rebuild it,\nplease refer to how to :ref:`build-generate-scorer-package`.\n\nBuilding your own scorer\n------------------------\n\nBuilding your own scorer can be useful if you're using models in a narrow usage context, with a more limited vocabulary, for example. Building a scorer requires text data matching your intended use case, which must be formatted in a text file with one sentence per line.\n\nThe LibriSpeech LM training text used by our scorer is around 4GB uncompressed, which should give an idea of the size of a corpus needed for a reasonable language model for general speech recognition. For more constrained use cases with smaller vocabularies, you don't need as much data, but you should still try to gather as much as you can.\n\nWith a text corpus in hand, you can then re-use ``generate_lm.py`` and ``generate_scorer_package`` to create your own scorer that is compatible with DeepSpeech clients and language bindings. Before building the language model, you must first familiarize yourself with the `KenLM toolkit <https://kheafield.com/code/kenlm/>`_. Most of the options exposed by the ``generate_lm.py`` script are simply forwarded to KenLM options of the same name, so you must read the KenLM documentation in order to fully understand their behavior.\n\nAfter using ``generate_lm.py`` to create a KenLM language model binary file, you can use ``generate_scorer_package`` to create a scorer package as described in the previous section. Note that we have a :github:`lm_optimizer.py script <lm_optimizer.py>` which can be used to find good default values for alpha and beta. To use it, you must first generate a package with any value set for default alpha and beta flags. For this step, it doesn't matter what values you use, as they'll be overridden by ``lm_optimizer.py`` later. Then, use ``lm_optimizer.py`` with this scorer file to find good alpha and beta values. Finally, use ``generate_scorer_package`` again, this time with the new values.\n"
  },
  {
    "path": "doc/Structs.rst",
    "content": "Data structures\n===============\n\nMetadata\n--------\n\n.. doxygenstruct:: Metadata\n   :project: deepspeech-c\n   :members:\n\nCandidateTranscript\n-------------------\n\n.. doxygenstruct:: CandidateTranscript\n   :project: deepspeech-c\n   :members:\n\nTokenMetadata\n-------------\n\n.. doxygenstruct:: TokenMetadata\n   :project: deepspeech-c\n   :members:\n"
  },
  {
    "path": "doc/TRAINING.rst",
    "content": ".. _training-docs:\n\nTraining Your Own Model\n=======================\n\n.. _cuda-training-deps:\n\nPrerequisites for training a model\n^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^\n\n* `Python 3.6 <https://www.python.org/>`_\n* Mac or Linux environment\n* CUDA 10.0 / CuDNN v7.6 per `Dockerfile <https://hub.docker.com/layers/tensorflow/tensorflow/1.15.4-gpu-py3/images/sha256-a5255ae38bcce7c7610816c778244309f8b8d1576e2c0023c685c011392958d7?context=explore>`_.\n\nGetting the training code\n^^^^^^^^^^^^^^^^^^^^^^^^^\n\nClone the latest released stable branch from Github (e.g. 0.9.3, check `here <https://github.com/mozilla/DeepSpeech/releases>`_):\n\n.. code-block:: bash\n\n   git clone --branch v0.9.3 https://github.com/mozilla/DeepSpeech\n\nIf you plan on committing code or you want to report bugs, please use the master branch.\n\nCreating a virtual environment\n^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^\n\nThroughout the documentation we assume you are using **virtualenv** to manage your Python environments. This setup is the one used and recommended by the project authors and is the easiest way to make sure you won't run into environment issues. If you're using **Anaconda, Miniconda or Mamba**, first read the instructions at :ref:`training-with-conda` and then continue from the installation step below.\n\nIn creating a virtual environment you will create a directory containing a ``python3`` binary and everything needed to run deepspeech. You can use whatever directory you want. For the purpose of the documentation, we will rely on ``$HOME/tmp/deepspeech-train-venv``. You can create it using this command:\n\n.. code-block::\n\n   $ python3 -m venv $HOME/tmp/deepspeech-train-venv/\n\nOnce this command completes successfully, the environment will be ready to be activated.\n\nActivating the environment\n^^^^^^^^^^^^^^^^^^^^^^^^^^\n\nEach time you need to work with DeepSpeech, you have to *activate* this virtual environment. This is done with this simple command:\n\n.. code-block::\n\n   $ source $HOME/tmp/deepspeech-train-venv/bin/activate\n\nInstalling DeepSpeech Training Code and its dependencies\n^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^\n\nInstall the required dependencies using ``pip3``\\ :\n\n.. code-block:: bash\n\n   cd DeepSpeech\n   pip3 install --upgrade pip==20.2.2 wheel==0.34.2 setuptools==49.6.0\n   pip3 install --upgrade -e .\n\nRemember to re-run the last ``pip3 install`` command above when you update the training code (for example by pulling new changes), in order to update any dependencies.\n\nThe ``webrtcvad`` Python package might require you to ensure you have proper tooling to build Python modules:\n\n.. code-block:: bash\n\n   sudo apt-get install python3-dev\n\nRecommendations\n^^^^^^^^^^^^^^^\n\nIf you have a capable (NVIDIA, at least 8GB of VRAM) GPU, it is highly recommended to install TensorFlow with GPU support. Training will be significantly faster than using the CPU. To enable GPU support, you can do:\n\n.. code-block:: bash\n\n   pip3 uninstall tensorflow\n   pip3 install 'tensorflow-gpu==1.15.4'\n\nPlease ensure you have the required `CUDA dependency <https://www.tensorflow.org/install/source#gpu>`_ and/or :ref:`Prerequisites <cuda-training-deps>`.\n\nIt has been reported for some people failure at training:\n\n.. code-block::\n\n   tensorflow.python.framework.errors_impl.UnknownError: Failed to get convolution algorithm. This is probably because cuDNN failed to initialize, so try looking to see if a warning log message was printed above.\n        [[{{node tower_0/conv1d/Conv2D}}]]\n\nSetting the ``TF_FORCE_GPU_ALLOW_GROWTH`` environment variable to ``true`` seems to help in such cases. This could also be due to an incorrect version of libcudnn. Double check your versions with the :ref:`TensorFlow 1.15 documentation <cuda-training-deps>`.\n\nBasic Dockerfile for training\n^^^^^^^^^^^^^^^^^^^^^^^^^^^^^\n\nWe provide ``Dockerfile.train`` to automatically set up a basic training environment in Docker. You need to generate the Dockerfile from the template using:\nThis should ensure that you'll re-use the upstream Python 3 TensorFlow GPU-enabled Docker image.\n\n.. code-block:: bash\n\n   make Dockerfile.train\n\nIf you want to specify a different DeepSpeech repository / branch, you can pass ``DEEPSPEECH_REPO`` or ``DEEPSPEECH_SHA`` parameters:\n\n.. code-block:: bash\n\n   make Dockerfile.train DEEPSPEECH_REPO=git://your/fork DEEPSPEECH_SHA=origin/your-branch\n\nCommon Voice training data\n^^^^^^^^^^^^^^^^^^^^^^^^^^\n\nThe Common Voice corpus consists of voice samples that were donated through Mozilla's `Common Voice <https://voice.mozilla.org/>`_ Initiative.\nYou can download individual CommonVoice v2.0 language data sets from `here <https://voice.mozilla.org/data>`_.\nAfter extraction of such a data set, you'll find the following contents:\n\n\n* the ``*.tsv`` files output by CorporaCreator for the downloaded language\n* the mp3 audio files they reference in a ``clips`` sub-directory.\n\nFor bringing this data into a form that DeepSpeech understands, you have to run the CommonVoice v2.0 importer (\\ ``bin/import_cv2.py``\\ ):\n\n.. code-block:: bash\n\n   bin/import_cv2.py --filter_alphabet path/to/some/alphabet.txt /path/to/extracted/language/archive\n\nProviding a filter alphabet is optional. It will exclude all samples whose transcripts contain characters not in the specified alphabet.\nRunning the importer with ``-h`` will show you some additional options.\n\nOnce the import is done, the ``clips`` sub-directory will contain for each required ``.mp3`` an additional ``.wav`` file.\nIt will also add the following ``.csv`` files:\n\n* ``clips/train.csv``\n* ``clips/dev.csv``\n* ``clips/test.csv``\n\nThe CSV files comprise of the following fields:\n\n* ``wav_filename`` - path of the sample, either absolute or relative. Here, the importer produces relative paths.\n* ``wav_filesize`` - samples size given in bytes, used for sorting the data before training. Expects integer.\n* ``transcript`` - transcription target for the sample.\n\nTo use Common Voice data during training, validation and testing, you pass (comma separated combinations of) their filenames into ``--train_files``\\ , ``--dev_files``\\ , ``--test_files`` parameters of ``DeepSpeech.py``.\n\nIf, for example, Common Voice language ``en`` was extracted to ``../data/CV/en/``\\ , ``DeepSpeech.py`` could be called like this:\n\n.. code-block:: bash\n\n   python3 DeepSpeech.py --train_files ../data/CV/en/clips/train.csv --dev_files ../data/CV/en/clips/dev.csv --test_files ../data/CV/en/clips/test.csv\n\nTraining a model\n^^^^^^^^^^^^^^^^\n\nThe central (Python) script is ``DeepSpeech.py`` in the project's root directory. For its list of command line options, you can call:\n\n.. code-block:: bash\n\n   python3 DeepSpeech.py --helpfull\n\nTo get the output of this in a slightly better-formatted way, you can also look at the flag definitions in :ref:`training-flags`.\n\nFor executing pre-configured training scenarios, there is a collection of convenience scripts in the ``bin`` folder. Most of them are named after the corpora they are configured for. Keep in mind that most speech corpora are *very large*, on the order of tens of gigabytes, and some aren't free. Downloading and preprocessing them can take a very long time, and training on them without a fast GPU (GTX 10 series or newer recommended) takes even longer.\n\n**If you experience GPU OOM errors while training, try reducing the batch size with the ``--train_batch_size``\\ , ``--dev_batch_size`` and ``--test_batch_size`` parameters.**\n\nAs a simple first example you can open a terminal, change to the directory of the DeepSpeech checkout, activate the virtualenv created above, and run:\n\n.. code-block:: bash\n\n   ./bin/run-ldc93s1.sh\n\nThis script will train on a small sample dataset composed of just a single audio file, the sample file for the `TIMIT Acoustic-Phonetic Continuous Speech Corpus <https://catalog.ldc.upenn.edu/LDC93S1>`_, which can be overfitted on a GPU in a few minutes for demonstration purposes. From here, you can alter any variables with regards to what dataset is used, how many training iterations are run and the default values of the network parameters.\n\nFeel also free to pass additional (or overriding) ``DeepSpeech.py`` parameters to these scripts. Then, just run the script to train the modified network.\n\nEach dataset has a corresponding importer script in ``bin/`` that can be used to download (if it's freely available) and preprocess the dataset. See ``bin/import_librivox.py`` for an example of how to import and preprocess a large dataset for training with DeepSpeech.\n\nSome importers might require additional code to properly handled your locale-specific requirements. Such handling is dealt with ``--validate_label_locale`` flag that allows you to source out-of-tree Python script that defines a ``validate_label`` function. Please refer to ``util/importers.py`` for implementation example of that function.\nIf you don't provide this argument, the default ``validate_label`` function will be used. This one is only intended for English language, so you might have consistency issues in your data for other languages.\n\nFor example, in order to use a custom validation function that disallows any sample with \"a\" in its transcript, and lower cases everything else, you could put the following code in a file called ``my_validation.py`` and then use ``--validate_label_locale my_validation.py``:\n\n.. code-block:: python\n\n  def validate_label(label):\n      if 'a' in label: # disallow labels with 'a'\n          return None\n      return label.lower() # lower case valid labels\n\nIf you've run the old importers (in ``util/importers/``\\ ), they could have removed source files that are needed for the new importers to run. In that case, simply remove the extracted folders and let the importer extract and process the dataset from scratch, and things should work.\n\nTraining with automatic mixed precision\n^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^\n\nAutomatic Mixed Precision (AMP) training on GPU for TensorFlow has been recently [introduced](https://medium.com/tensorflow/automatic-mixed-precision-in-tensorflow-for-faster-ai-training-on-nvidia-gpus-6033234b2540).\n\nMixed precision training makes use of both FP32 and FP16 precisions where appropriate. FP16 operations can leverage the Tensor cores on NVIDIA GPUs (Volta, Turing or newer architectures) for improved throughput. Mixed precision training also often allows larger batch sizes. Automatic mixed precision training can be enabled by including the flag `--automatic_mixed_precision` at training time:\n\n```\npython3 DeepSpeech.py --train_files ./train.csv --dev_files ./dev.csv --test_files ./test.csv --automatic_mixed_precision\n```\n\nOn a Volta generation V100 GPU, automatic mixed precision speeds up DeepSpeech training and evaluation by ~30%-40%.\n\nDistributed training using Horovod\n^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^\n\nIf you have a capable compute architecture, it is possible to distribute the training using `Horovod <https://github.com/horovod/horovod>`_. A fast network is recommended.\nHorovod is capable of using MPI and NVIDIA's NCCL for highly optimized inter-process communication.\nIt also offers `Gloo <https://github.com/facebookincubator/gloo>`_ as an easy-to-setup communication backend.\n\nFor more information about setup or tuning of Horovod please visit `Horovod's documentation <https://horovod.readthedocs.io/en/stable/summary_include.html>`_.\n\nHorovod is expected to run on heterogeneous systems (e.g. different number and model type of GPUs per machine).\nHowever, this can cause unpredictable problems and user interaction in training code is needed.\nTherefore, we do only support homogenous systems, which means same hardware and also same software configuration (OS, drivers, MPI, NCCL, TensorFlow, ...) on each machine.\nThe only exception is different number of GPUs per machine, since this can be controlled by ``horovodrun -H``.\n\nDetailed documentation how to run Horovod is provided `here <https://horovod.readthedocs.io/en/stable/running.html>`_.\nThe short command to train on 4 machines using 4 GPUs each:\n\n.. code-block:: bash\n\n    horovodrun -np 16 -H server1:4,server2:4,server3:4,server4:4 python3 DeepSpeech.py --train_files [...] --horovod\n\nCheckpointing\n^^^^^^^^^^^^^\n\nDuring training of a model so-called checkpoints will get stored on disk. This takes place at a configurable time interval. The purpose of checkpoints is to allow interruption (also in the case of some unexpected failure) and later continuation of training without losing hours of training time. Resuming from checkpoints happens automatically by just (re)starting training with the same ``--checkpoint_dir`` of the former run. Alternatively, you can specify more fine grained options with ``--load_checkpoint_dir`` and ``--save_checkpoint_dir``, which specify separate locations to use for loading and saving checkpoints respectively. If not specified these flags use the same value as ``--checkpoint_dir``, ie. load from and save to the same directory.\n\nBe aware however that checkpoints are only valid for the same model geometry they had been generated from. In other words: If there are error messages of certain ``Tensors`` having incompatible dimensions, this is most likely due to an incompatible model change. One usual way out would be to wipe all checkpoint files in the checkpoint directory or changing it before starting the training.\n\nExporting a model for inference\n^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^\n\nIf the ``--export_dir`` parameter is provided, a model will have been exported to this directory during training.\nRefer to the :ref:`usage instructions <usage-docs>` for information on running a client that can use the exported model.\n\nExporting a model for TFLite\n^^^^^^^^^^^^^^^^^^^^^^^^^^^^\n\nIf you want to experiment with the TF Lite engine, you need to export a model that is compatible with it, then use the ``--export_tflite`` flags. If you already have a trained model, you can re-export it for TFLite by running ``DeepSpeech.py`` again and specifying the same ``checkpoint_dir`` that you used for training, as well as passing ``--export_tflite --export_dir /model/export/destination``. If you changed the alphabet you also need to add the ``--alphabet_config_path my-new-language-alphabet.txt`` flag.\n\nMaking a mmap-able model for inference\n^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^\n\nThe ``output_graph.pb`` model file generated in the above step will be loaded in memory to be dealt with when running inference.\nThis will result in extra loading time and memory consumption. One way to avoid this is to directly read data from the disk.\n\nTensorFlow has tooling to achieve this: it requires building the target ``//tensorflow/contrib/util:convert_graphdef_memmapped_format``. We recommend you build it from `TensorFlow r1.15 <https://github.com/tensorflow/tensorflow/tree/r1.15/>`_.\n\nFor convenience, builds for Linux and macOS are `available (look for file named convert_graphdef_memmapped_format) <https://github.com/mozilla/DeepSpeech/releases/tag/v0.9.3>`_\n\nProducing a mmap-able model is as simple as:\n\n.. code-block::\n\n   $ convert_graphdef_memmapped_format --in_graph=output_graph.pb --out_graph=output_graph.pbmm\n\nUpon sucessfull run, it should report about conversion of a non-zero number of nodes. If it reports converting ``0`` nodes, something is wrong: make sure your model is a frozen one, and that you have not applied any incompatible changes (this includes ``quantize_weights``\\ ).\n\nContinuing training from a release model\n----------------------------------------\nThere are currently two supported approaches to make use of a pre-trained DeepSpeech model: fine-tuning or transfer-learning. Choosing which one to use is a simple decision, and it depends on your target dataset. Does your data use the same alphabet as the release model? If \"Yes\": fine-tune. If \"No\" use transfer-learning.\n\nIf your own data uses the *extact* same alphabet as the English release model (i.e. `a-z` plus `'`) then the release model's output layer will match your data, and you can just fine-tune the existing parameters. However, if you want to use a new alphabet (e.g. Cyrillic `а`, `б`, `д`), the output layer of a release DeepSpeech model will *not* match your data. In this case, you should use transfer-learning (i.e. remove the trained model's output layer, and reinitialize a new output layer that matches your target character set.\n\nN.B. - If you have access to a pre-trained model which uses UTF-8 bytes at the output layer you can always fine-tune, because any alphabet should be encodable as UTF-8.\n\n.. _training-fine-tuning:\n\nFine-Tuning (same alphabet)\n^^^^^^^^^^^^^^^^^^^^^^^^^^^\n\nIf you'd like to use one of the pre-trained models to bootstrap your training process (fine tuning), you can do so by using the ``--checkpoint_dir`` flag in ``DeepSpeech.py``. Specify the path where you downloaded the checkpoint from the release, and training will resume from the pre-trained model.\n\nFor example, if you want to fine tune the entire graph using your own data in ``my-train.csv``\\ , ``my-dev.csv`` and ``my-test.csv``\\ , for three epochs, you can something like the following, tuning the hyperparameters as needed:\n\n.. code-block:: bash\n\n   mkdir fine_tuning_checkpoints\n   python3 DeepSpeech.py --n_hidden 2048 --checkpoint_dir path/to/checkpoint/folder --epochs 3 --train_files my-train.csv --dev_files my-dev.csv --test_files my_dev.csv --learning_rate 0.0001\n\nNotes about the release checkpoints: the released models were trained with ``--n_hidden 2048``\\ , so you need to use that same value when initializing from the release models. Since v0.6.0, the release models are also trained with ``--train_cudnn``\\ , so you'll need to specify that as well. If you don't have a CUDA compatible GPU, then you can workaround it by using the ``--load_cudnn`` flag. Use ``--helpfull`` to get more information on how the flags work.\n\nYou also cannot use ```--automatic_mixed_precision``` when loading release checkpoints, as they do not use automatic mixed precision training.\n\nIf you try to load a release model without following these steps, you'll get an error similar to this:\n\n.. code-block::\n\n   E Tried to load a CuDNN RNN checkpoint but there were more missing variables than just the Adam moment tensors.\n\n\nTransfer-Learning (new alphabet)\n^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^\n\nIf you want to continue training an alphabet-based DeepSpeech model (i.e. not a UTF-8 model) on a new language, or if you just want to add new characters to your custom alphabet, you will probably want to use transfer-learning instead of fine-tuning. If you're starting with a pre-trained UTF-8 model -- even if your data comes from a different language or uses a different alphabet -- the model will be able to predict your new transcripts, and you should use fine-tuning instead.\n\nIn a nutshell, DeepSpeech's transfer-learning allows you to remove certain layers from a pre-trained model, initialize new layers for your target data, stitch together the old and new layers, and update all layers via gradient descent. You will remove the pre-trained output layer (and optionally more layers) and reinitialize parameters to fit your target alphabet. The simplest case of transfer-learning is when you remove just the output layer.\n\nIn DeepSpeech's implementation of transfer-learning, all removed layers will be contiguous, starting from the output layer. The key flag you will want to experiment with is ``--drop_source_layers``. This flag accepts an integer from ``1`` to ``5`` and allows you to specify how many layers you want to remove from the pre-trained model. For example, if you supplied ``--drop_source_layers 3``, you will drop the last three layers of the pre-trained model: the output layer, penultimate layer, and LSTM layer. All dropped layers will be reinintialized, and (crucially) the output layer will be defined to match your supplied target alphabet.\n\nYou need to specify the location of the pre-trained model with ``--load_checkpoint_dir`` and define where your new model checkpoints will be saved with ``--save_checkpoint_dir``. You need to specify how many layers to remove (aka \"drop\") from the pre-trained model: ``--drop_source_layers``. You also need to supply your new alphabet file using the standard ``--alphabet_config_path`` (remember, using a new alphabet is the whole reason you want to use transfer-learning).\n\n.. code-block:: bash\n\n       python3 DeepSpeech.py \\\n           --drop_source_layers 1 \\\n           --alphabet_config_path my-new-language-alphabet.txt \\\n           --save_checkpoint_dir path/to/output-checkpoint/folder \\\n           --load_checkpoint_dir path/to/release-checkpoint/folder \\\n           --train_files   my-new-language-train.csv \\\n           --dev_files   my-new-language-dev.csv \\\n           --test_files  my-new-language-test.csv\n\nUTF-8 mode\n^^^^^^^^^^\n\nDeepSpeech includes a UTF-8 operating mode which can be useful to model languages with very large alphabets, such as Chinese Mandarin. For details on how it works and how to use it, see :ref:`decoder-docs`.\n\n\n.. _training-data-augmentation:\n\nAugmentation\n^^^^^^^^^^^^\n\nAugmentation is a useful technique for better generalization of machine learning models. Thus, a pre-processing pipeline with various augmentation techniques on raw pcm and spectrogram has been implemented and can be used while training the model. Following are the available augmentation techniques that can be enabled at training time by using the corresponding flags in the command line.\n\nEach sample of the training data will get treated by every specified augmentation in their given order. However: whether an augmentation will actually get applied to a sample is decided by chance on base of the augmentation's probability value. For example a value of ``p=0.1`` would apply the according augmentation to just 10% of all samples. This also means that augmentations are not mutually exclusive on a per-sample basis.\n\nThe ``--augment`` flag uses a common syntax for all augmentation types:\n\n.. code-block::\n\n  --augment augmentation_type1[param1=value1,param2=value2,...] --augment augmentation_type2[param1=value1,param2=value2,...] ...\n\nFor example, for the ``overlay`` augmentation:\n\n.. code-block::\n\n  python3 DeepSpeech.py --augment overlay[p=0.1,source=/path/to/audio.sdb,snr=20.0] ...\n\n\nIn the documentation below, whenever a value is specified as ``<float-range>`` or ``<int-range>``, it supports one of the follow formats:\n\n  * ``<value>``: A constant (int or float) value.\n\n  * ``<value>~<r>``: A center value with a randomization radius around it. E.g. ``1.2~0.4`` will result in picking of a uniformly random value between 0.8 and 1.6 on each sample augmentation.\n\n  * ``<start>:<end>``: The value will range from `<start>` at the beginning of the training to `<end>` at the end of the training. E.g. ``-0.2:1.2`` (float) or ``2000:4000`` (int)\n\n  * ``<start>:<end>~<r>``: Combination of the two previous cases with a ranging center value. E.g. ``4-6~2`` would at the beginning of the training pick values between 2 and 6 and at the end of the training between 4 and 8.\n\nRanges specified with integer limits will only assume integer (rounded) values.\n\n.. warning::\n    When feature caching is enabled, by default the cache has no expiration limit and will be used for the entire training run. This will cause these augmentations to only be performed once during the first epoch and the result will be reused for subsequent epochs. This would not only hinder value ranges from reaching their intended final values, but could also lead to unintended over-fitting. In this case flag ``--cache_for_epochs N`` (with N > 1) should be used to periodically invalidate the cache after every N epochs and thus allow samples to be re-augmented in new ways and with current range-values.\n\nEvery augmentation targets a certain representation of the sample - in this documentation these representations are referred to as *domains*.\nAugmentations are applied in the following order:\n\n1. **sample** domain: The sample just got loaded and its waveform is represented as a NumPy array. For implementation reasons these augmentations are the only ones that can be \"simulated\" through ``bin/play.py``.\n\n2. **signal** domain: The sample waveform is represented as a tensor.\n\n3. **spectrogram** domain: The sample spectrogram is represented as a tensor.\n\n4. **features** domain: The sample's mel spectrogram features are represented as a tensor.\n\nWithin a single domain, augmentations are applied in the same order as they appear in the command-line.\n\n\nSample domain augmentations\n---------------------------\n\n**Overlay augmentation** ``--augment overlay[p=<float>,source=<str>,snr=<float-range>,layers=<int-range>]``\n  Layers another audio source (multiple times) onto augmented samples.\n\n  * **p**: probability value between 0.0 (never) and 1.0 (always) if a given sample gets augmented by this method\n\n  * **source**: path to the sample collection to use for augmenting (\\*.sdb or \\*.csv file). It will be repeated if there are not enough samples left.\n\n  * **snr**: signal to noise ratio in dB - positive values for lowering volume of the overlay in relation to the sample\n\n  * **layers**: number of layers added onto the sample (e.g. 10 layers of speech to get \"cocktail-party effect\"). A layer is just a sample of the same duration as the sample to augment. It gets stitched together from as many source samples as required.\n\n\n**Reverb augmentation** ``--augment reverb[p=<float>,delay=<float-range>,decay=<float-range>]``\n  Adds simplified (no all-pass filters) `Schroeder reverberation <https://ccrma.stanford.edu/~jos/pasp/Schroeder_Reverberators.html>`_ to the augmented samples.\n\n  * **p**: probability value between 0.0 (never) and 1.0 (always) if a given sample gets augmented by this method\n\n  * **delay**: time delay in ms for the first signal reflection - higher values are widening the perceived \"room\"\n\n  * **decay**: sound decay in dB per reflection - higher values will result in a less reflective perceived \"room\"\n\n\n**Resample augmentation** ``--augment resample[p=<float>,rate=<int-range>]``\n  Resamples augmented samples to another sample rate and then resamples back to the original sample rate.\n\n  * **p**: probability value between 0.0 (never) and 1.0 (always) if a given sample gets augmented by this method\n\n  * **rate**: sample-rate to re-sample to\n\n\n**Codec augmentation** ``--augment codec[p=<float>,bitrate=<int-range>]``\n  Compresses and then decompresses augmented samples using the lossy Opus audio codec.\n\n  * **p**: probability value between 0.0 (never) and 1.0 (always) if a given sample gets augmented by this method\n\n  * **bitrate**: bitrate used during compression\n\n\n**Volume augmentation** ``--augment volume[p=<float>,dbfs=<float-range>]``\n  Measures and levels augmented samples to a target dBFS value.\n\n  * **p**: probability value between 0.0 (never) and 1.0 (always) if a given sample gets augmented by this method\n\n  * **dbfs** : target volume in dBFS (default value of 3.0103 will normalize min and max amplitudes to -1.0/1.0)\n\nSpectrogram domain augmentations\n--------------------------------\n\n**Pitch augmentation** ``--augment pitch[p=<float>,pitch=<float-range>]``\n  Scales spectrogram on frequency axis and thus changes pitch.\n\n  * **p**: probability value between 0.0 (never) and 1.0 (always) if a given sample gets augmented by this method\n\n  * **pitch**: pitch factor by with the frequency axis is scaled (e.g. a value of 2.0 will raise audio frequency by one octave)\n\n\n**Tempo augmentation** ``--augment tempo[p=<float>,factor=<float-range>]``\n  Scales spectrogram on time axis and thus changes playback tempo.\n\n  * **p**: probability value between 0.0 (never) and 1.0 (always) if a given sample gets augmented by this method\n\n  * **factor**: speed factor by which the time axis is stretched or shrunken (e.g. a value of 2.0 will double playback tempo)\n\n\n**Warp augmentation** ``--augment warp[p=<float>,nt=<int-range>,nf=<int-range>,wt=<float-range>,wf=<float-range>]``\n  Applies a non-linear image warp to the spectrogram. This is achieved by randomly shifting a grid of equally distributed warp points along time and frequency axis.\n\n  * **p**: probability value between 0.0 (never) and 1.0 (always) if a given sample gets augmented by this method\n\n  * **nt**: number of equally distributed warp grid lines along time axis of the spectrogram (excluding the edges)\n\n  * **nf**: number of equally distributed warp grid lines along frequency axis of the spectrogram (excluding the edges)\n\n  * **wt**: standard deviation of the random shift applied to warp points along time axis (0.0 = no warp, 1.0 = half the distance to the neighbour point)\n\n  * **wf**: standard deviation of the random shift applied to warp points along frequency axis (0.0 = no warp, 1.0 = half the distance to the neighbour point)\n\n\n**Frequency mask augmentation** ``--augment frequency_mask[p=<float>,n=<int-range>,size=<int-range>]``\n  Sets frequency-intervals within the augmented samples to zero (silence) at random frequencies. See the SpecAugment paper for more details - https://arxiv.org/abs/1904.08779\n\n  * **p**: probability value between 0.0 (never) and 1.0 (always) if a given sample gets augmented by this method\n\n  * **n**: number of intervals to mask\n\n  * **size**: number of frequency bands to mask per interval\n\nMulti domain augmentations\n--------------------------\n\n**Time mask augmentation** ``--augment time_mask[p=<float>,n=<int-range>,size=<float-range>,domain=<domain>]``\n  Sets time-intervals within the augmented samples to zero (silence) at random positions.\n\n  * **p**: probability value between 0.0 (never) and 1.0 (always) if a given sample gets augmented by this method\n\n  * **n**: number of intervals to set to zero\n\n  * **size**: duration of intervals in ms\n\n  * **domain**: data representation to apply augmentation to - \"signal\", \"features\" or \"spectrogram\" (default)\n\n\n**Dropout augmentation** ``--augment dropout[p=<float>,rate=<float-range>,domain=<domain>]``\n  Zeros random data points of the targeted data representation.\n\n  * **p**: probability value between 0.0 (never) and 1.0 (always) if a given sample gets augmented by this method\n\n  * **rate**: dropout rate ranging from 0.0 for no dropout to 1.0 for 100% dropout\n\n  * **domain**: data representation to apply augmentation to - \"signal\", \"features\" or \"spectrogram\" (default)\n\n\n**Add augmentation** ``--augment add[p=<float>,stddev=<float-range>,domain=<domain>]``\n  Adds random values picked from a normal distribution (with a mean of 0.0) to all data points of the targeted data representation.\n\n  * **p**: probability value between 0.0 (never) and 1.0 (always) if a given sample gets augmented by this method\n\n  * **stddev**: standard deviation of the normal distribution to pick values from\n\n  * **domain**: data representation to apply augmentation to - \"signal\", \"features\" (default) or \"spectrogram\"\n\n\n**Multiply augmentation** ``--augment multiply[p=<float>,stddev=<float-range>,domain=<domain>]``\n  Multiplies all data points of the targeted data representation with random values picked from a normal distribution (with a mean of 1.0).\n\n  * **p**: probability value between 0.0 (never) and 1.0 (always) if a given sample gets augmented by this method\n\n  * **stddev**: standard deviation of the normal distribution to pick values from\n\n  * **domain**: data representation to apply augmentation to - \"signal\", \"features\" (default) or \"spectrogram\"\n\n\nExample training with all augmentations:\n\n.. code-block:: bash\n\n        python -u DeepSpeech.py \\\n          --train_files \"train.sdb\" \\\n          --feature_cache ./feature.cache \\\n          --cache_for_epochs 10 \\\n          --epochs 100 \\\n          --augment overlay[p=0.5,source=noise.sdb,layers=1,snr=50:20~10] \\\n          --augment reverb[p=0.1,delay=50.0~30.0,decay=10.0:2.0~1.0] \\\n          --augment resample[p=0.1,rate=12000:8000~4000] \\\n          --augment codec[p=0.1,bitrate=48000:16000] \\\n          --augment volume[p=0.1,dbfs=-10:-40] \\\n          --augment pitch[p=0.1,pitch=1~0.2] \\\n          --augment tempo[p=0.1,factor=1~0.5] \\\n          --augment warp[p=0.1,nt=4,nf=1,wt=0.5:1.0,wf=0.1:0.2] \\\n          --augment frequency_mask[p=0.1,n=1:3,size=1:5] \\\n          --augment time_mask[p=0.1,domain=signal,n=3:10~2,size=50:100~40] \\\n          --augment dropout[p=0.1,rate=0.05] \\\n          --augment add[p=0.1,domain=signal,stddev=0~0.5] \\\n          --augment multiply[p=0.1,domain=features,stddev=0~0.5] \\\n          [...]\n\n\nThe ``bin/play.py`` and ``bin/data_set_tool.py`` tools also support ``--augment`` parameters (for sample domain augmentations) and can be used for experimenting with different configurations or creating augmented data sets.\n\nExample of playing all samples with reverberation and maximized volume:\n\n.. code-block:: bash\n\n        bin/play.py --augment reverb[p=0.1,delay=50.0,decay=2.0] --augment volume --random test.sdb\n\nExample simulation of the codec augmentation of a wav-file first at the beginning and then at the end of an epoch:\n\n.. code-block:: bash\n\n        bin/play.py --augment codec[p=0.1,bitrate=48000:16000] --clock 0.0 test.wav\n        bin/play.py --augment codec[p=0.1,bitrate=48000:16000] --clock 1.0 test.wav\n\nExample of creating a pre-augmented test set:\n\n.. code-block:: bash\n\n        bin/data_set_tool.py \\\n          --augment overlay[source=noise.sdb,layers=1,snr=20~10] \\\n          --augment resample[rate=12000:8000~4000] \\\n          test.sdb test-augmented.sdb\n\n.. _training-with-conda:\n\nTraining from an Anaconda or miniconda environment\n^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^\n\nKeep in mind that none of the core authors use Anaconda or miniconda, so this setup is not guaranteed to work. If you experience problems, try using a non-conda setup first. We're happy to accept pull requests fixing any incompatibilities with conda setups, but we will not offer any support ourselves beyond reviewing pull requests.\n\nTo prevent common problems, make sure you **always use a separate environment when setting things up for training**:\n\n.. code-block:: bash\n\n   (base) $ conda create -n deepspeech python=3.7\n   (base) $ conda activate deepspeech\n"
  },
  {
    "path": "doc/USING.rst",
    "content": ".. _usage-docs:\n\nUsing a Pre-trained Model\n=========================\n\nInference using a DeepSpeech pre-trained model can be done with a client/language binding package. We have four clients/language bindings in this repository, listed below, and also a few community-maintained clients/language bindings in other repositories, listed `further down in this README <#third-party-bindings>`_.\n\n* :ref:`The C API <c-usage>`.\n* :ref:`The Python package/language binding <py-usage>`\n* :ref:`The Node.JS package/language binding <nodejs-usage>`\n* :ref:`The command-line client <cli-usage>`\n* :github:`The .NET client/language binding <native_client/dotnet/README.rst>`\n\n.. _runtime-deps:\n\nRunning ``deepspeech`` might, see below, require some runtime dependencies to be already installed on your system:\n\n* ``sox`` - The Python and Node.JS clients use SoX to resample files to 16kHz.\n* ``libgomp1`` - libsox (statically linked into the clients) depends on OpenMP. Some people have had to install this manually.\n* ``libstdc++`` - Standard C++ Library implementation. Some people have had to install this manually.\n* ``libpthread`` - On Linux, some people have had to install libpthread manually. On Ubuntu, ``libpthread`` is part of the ``libpthread-stubs0-dev`` package.  \n* ``Redistribuable Visual C++ 2015 Update 3 (64-bits)`` - On Windows, it might be required to ensure this is installed. Please `download from Microsoft <https://www.microsoft.com/download/details.aspx?id=53587>`_.\n\nPlease refer to your system's documentation on how to install these dependencies.\n\n.. _cuda-inference-deps:\n\nCUDA dependency (inference)\n^^^^^^^^^^^^^^^^^^^^^^^^^^^\n\nThe GPU capable builds (Python, NodeJS, C++, etc) depend on CUDA 10.1 and CuDNN v7.6.\n\nGetting the pre-trained model\n^^^^^^^^^^^^^^^^^^^^^^^^^^^^^\n\nIf you want to use the pre-trained English model for performing speech-to-text, you can download it (along with other important inference material) from the DeepSpeech `releases page <https://github.com/mozilla/DeepSpeech/releases>`_. Alternatively, you can run the following command to download the model files in your current directory:\n\n.. code-block:: bash\n\n   wget https://github.com/mozilla/DeepSpeech/releases/download/v0.9.3/deepspeech-0.9.3-models.pbmm\n   wget https://github.com/mozilla/DeepSpeech/releases/download/v0.9.3/deepspeech-0.9.3-models.scorer\n\nThere are several pre-trained model files available in official releases. Files ending in ``.pbmm`` are compatible with clients and language bindings built against the standard TensorFlow runtime. Usually these packages are simply called ``deepspeech``. These files are also compatible with CUDA enabled clients and language bindings. These packages are usually called ``deepspeech-gpu``. Files ending in ``.tflite`` are compatible with clients and language bindings built against the `TensorFlow Lite runtime <https://www.tensorflow.org/lite/>`_. These models are optimized for size and performance in low power devices. On desktop platforms, the compatible packages are called ``deepspeech-tflite``. On Android and Raspberry Pi, we only publish TensorFlow Lite enabled packages, and they are simply called ``deepspeech``. You can see a full list of supported platforms and which TensorFlow runtime is supported at :ref:`supported-platforms-inference`.\n\n+--------------------+---------------------+---------------------+\n| Package/Model type | .pbmm               | .tflite             |\n+====================+=====================+=====================+\n| deepspeech         | Depends on platform | Depends on platform |\n+--------------------+---------------------+---------------------+\n| deepspeech-gpu     | ✅                  | ❌                  |\n+--------------------+---------------------+---------------------+\n| deepspeech-tflite  | ❌                  | ✅                  |\n+--------------------+---------------------+---------------------+\n\nFinally, the pre-trained model files also include files ending in ``.scorer``. These are external scorers (language models) that are used at inference time in conjunction with an acoustic model (``.pbmm`` or ``.tflite`` file) to produce transcriptions. We also provide further documentation on :ref:`the decoding process <decoder-docs>` and :ref:`how scorers are generated <scorer-scripts>`.\n\nImportant considerations on model inputs\n^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^\n\nThe release notes include detailed information on how the released models were trained/constructed. Important considerations for users include the characteristics of the training data used and whether they match your intended use case. For acoustic models, an important characteristic is the demographic distribution of speakers. For external scorers, the texts should be similar to those of the expected use case. If the data used for training the models does not align with your intended use case, it may be necessary to adapt or train new models in order to get good accuracy in your transcription results.\n\nThe process for training an acoustic model is described in :ref:`training-docs`. In particular, fine tuning a release model using your own data can be a good way to leverage relatively smaller amounts of data that would not be sufficient for training a new model from scratch. See the :ref:`fine tuning and transfer learning sections <training-fine-tuning>` for more information. :ref:`Data augmentation <training-data-augmentation>` can also be a good way to increase the value of smaller training sets.\n\nCreating your own external scorer from text data is another way that you can adapt the model to your specific needs. The process and tools used to generate an external scorer package are described in :ref:`scorer-scripts` and an overview of how the external scorer is used by DeepSpeech to perform inference is available in :ref:`decoder-docs`. Generating a smaller scorer from a single purpose text dataset is a quick process and can bring significant accuracy improvements, specially for more constrained, limited vocabulary applications.\n\nModel compatibility\n^^^^^^^^^^^^^^^^^^^\n\nDeepSpeech models are versioned to keep you from trying to use an incompatible graph with a newer client after a breaking change was made to the code. If you get an error saying your model file version is too old for the client, you should either upgrade to a newer model release, re-export your model from the checkpoint using a newer version of the code, or downgrade your client if you need to use the old model and can't re-export it.\n\n.. _py-usage:\n\nUsing the Python package\n^^^^^^^^^^^^^^^^^^^^^^^^\n\nPre-built binaries which can be used for performing inference with a trained model can be installed with ``pip3``. You can then use the ``deepspeech`` binary to do speech-to-text on an audio file:\n\nFor the Python bindings, it is highly recommended that you perform the installation within a Python 3.5 or later virtual environment. You can find more information about those in `this documentation <http://docs.python-guide.org/en/latest/dev/virtualenvs/>`_.\n\nWe will continue under the assumption that you already have your system properly setup to create new virtual environments.\n\nCreate a DeepSpeech virtual environment\n~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\n\nIn creating a virtual environment you will create a directory containing a ``python3`` binary and everything needed to run deepspeech. You can use whatever directory you want. For the purpose of the documentation, we will rely on ``$HOME/tmp/deepspeech-venv``. You can create it using this command:\n\n.. code-block::\n\n   $ virtualenv -p python3 $HOME/tmp/deepspeech-venv/\n\nOnce this command completes successfully, the environment will be ready to be activated.\n\nActivating the environment\n~~~~~~~~~~~~~~~~~~~~~~~~~~\n\nEach time you need to work with DeepSpeech, you have to *activate* this virtual environment. This is done with this simple command:\n\n.. code-block::\n\n   $ source $HOME/tmp/deepspeech-venv/bin/activate\n\nInstalling DeepSpeech Python bindings\n~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\n\nOnce your environment has been set-up and loaded, you can use ``pip3`` to manage packages locally. On a fresh setup of the ``virtualenv``\\ , you will have to install the DeepSpeech wheel. You can check if ``deepspeech`` is already installed with ``pip3 list``.\n\nTo perform the installation, just use ``pip3`` as such:\n\n.. code-block::\n\n   $ pip3 install deepspeech\n\nIf ``deepspeech`` is already installed, you can update it as such:\n\n.. code-block::\n\n   $ pip3 install --upgrade deepspeech\n\nAlternatively, if you have a supported NVIDIA GPU on Linux, you can install the GPU specific package as follows:\n\n.. code-block::\n\n   $ pip3 install deepspeech-gpu\n\nSee the `release notes <https://github.com/mozilla/DeepSpeech/releases>`_ to find which GPUs are supported. Please ensure you have the required `CUDA dependency <#cuda-dependency>`_.\n\nYou can update ``deepspeech-gpu`` as follows:\n\n.. code-block::\n\n   $ pip3 install --upgrade deepspeech-gpu\n\nIn both cases, ``pip3`` should take care of installing all the required dependencies. After installation has finished, you should be able to call ``deepspeech`` from the command-line.\n\nNote: the following command assumes you `downloaded the pre-trained model <#getting-the-pre-trained-model>`_.\n\n.. code-block:: bash\n\n   deepspeech --model deepspeech-0.9.3-models.pbmm --scorer deepspeech-0.9.3-models.scorer --audio my_audio_file.wav\n\nThe ``--scorer`` argument is optional, and represents an external language model to be used when transcribing the audio.\n\nSee :ref:`the Python client <py-api-example>` for an example of how to use the package programatically.\n\n.. _nodejs-usage:\n\nUsing the Node.JS / Electron.JS package\n^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^\n\nYou can download the JS bindings using ``npm``\\ :\n\n.. code-block:: bash\n\n   npm install deepspeech\n\nPlease note that as of now, we support:\n - Node.JS versions 4 to 13.\n - Electron.JS versions 1.6 to 7.1\n\nTypeScript support is also provided.\n\nAlternatively, if you're using Linux and have a supported NVIDIA GPU, you can install the GPU specific package as follows:\n\n.. code-block:: bash\n\n   npm install deepspeech-gpu\n\nSee the `release notes <https://github.com/mozilla/DeepSpeech/releases>`_ to find which GPUs are supported. Please ensure you have the required `CUDA dependency <#cuda-dependency>`_.\n\nSee the :ref:`TypeScript client <js-api-example>` for an example of how to use the bindings programatically.\n\n.. _cli-usage:\n\nUsing the command-line client\n^^^^^^^^^^^^^^^^^^^^^^^^^^^^^\n\nTo download the pre-built binaries for the ``deepspeech`` command-line (compiled C++) client, use one of the ``native_client.tar.xz`` files from the [releases](https://github.com/mozilla/DeepSpeech/releases).\n\nNote: the following command assumes you `downloaded the pre-trained model <#getting-the-pre-trained-model>`_.\n\n.. code-block:: bash\n\n   ./deepspeech --model deepspeech-0.9.3-models.pbmm --scorer deepspeech-0.9.3-models.scorer --audio audio_input.wav\n\nSee the help output with ``./deepspeech -h`` for more details.\n\nInstalling bindings from source\n^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^\n\nIf pre-built binaries aren't available for your system, you'll need to install them from scratch. Follow the :github:`native client build and installation instructions <native_client/README.rst>`.\n\nDockerfile for building from source\n^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^\n\nWe provide ``Dockerfile.build`` to automatically build ``libdeepspeech.so``, the C++ native client, Python bindings, and KenLM.\nYou need to generate the Dockerfile from the template using:\n\n.. code-block:: bash\n\n   make Dockerfile.build\n\nIf you want to specify a different DeepSpeech repository / branch, you can pass ``DEEPSPEECH_REPO`` or ``DEEPSPEECH_SHA`` parameters:\n\n.. code-block:: bash\n\n   make Dockerfile.build DEEPSPEECH_REPO=git://your/fork DEEPSPEECH_SHA=origin/your-branch\n\nThird party bindings\n^^^^^^^^^^^^^^^^^^^^\n\nIn addition to the bindings above, third party developers have started to provide bindings to other languages:\n\n\n* `Asticode <https://github.com/asticode>`_ provides `Golang <https://golang.org>`_ bindings in its `go-astideepspeech <https://github.com/asticode/go-astideepspeech>`_ repo.\n* `RustAudio <https://github.com/RustAudio>`_ provide a `Rust <https://www.rust-lang.org>`_ binding, the installation and use of which is described in their `deepspeech-rs <https://github.com/RustAudio/deepspeech-rs>`_ repo.\n* `stes <https://github.com/stes>`_ provides preliminary `PKGBUILDs <https://wiki.archlinux.org/index.php/PKGBUILD>`_ to install the client and python bindings on `Arch Linux <https://www.archlinux.org/>`_ in the `arch-deepspeech <https://github.com/stes/arch-deepspeech>`_ repo.\n* `gst-deepspeech <https://github.com/Elleo/gst-deepspeech>`_ provides a `GStreamer <https://gstreamer.freedesktop.org/>`_ plugin which can be used from any language with GStreamer bindings.\n* `thecodrr <https://github.com/thecodrr>`_ provides `Vlang <https://vlang.io>`_ bindings. The installation and use of which is described in their `vspeech <https://github.com/thecodrr/vspeech>`_ repo.\n* `eagledot <https://gitlab.com/eagledot>`_ provides `NIM-lang <https://nim-lang.org/>`_ bindings. The installation and use of which is described in their `nim-deepspeech <https://gitlab.com/eagledot/nim-deepspeech>`_ repo.\n"
  },
  {
    "path": "doc/conf.py",
    "content": "# -*- coding: utf-8 -*-\n#\n# DeepSpeech documentation build configuration file, created by\n# sphinx-quickstart on Thu Feb  2 21:20:39 2017.\n#\n# This file is execfile()d with the current directory set to its\n# containing dir.\n#\n# Note that not all possible configuration values are present in this\n# autogenerated file.\n#\n# All configuration values have a default; values that are commented out\n# serve to show the default.\n\n# If extensions (or modules to document with autodoc) are in another directory,\n# add these directories to sys.path here. If the directory is relative to the\n# documentation root, use os.path.abspath to make it absolute, like shown here.\n#\n\n# pylint: skip-file\n\nimport os\nimport sys\n\nsys.path.insert(0, os.path.abspath('../'))\n\nautodoc_mock_imports = ['deepspeech']\n\n# This is in fact only relevant on ReadTheDocs, but we want to run the same way\n# on our CI as in RTD to avoid regressions on RTD that we would not catch on CI\nimport subprocess\nparent = subprocess.check_output(\"cd ../ && pwd\", shell=True).decode().strip()\nos.environ[\"PATH\"] = os.path.join(parent, 'node_modules', '.bin') + ':' + os.environ[\"PATH\"]\nsubprocess.check_call('cd ../ && npm install typedoc@0.17.4 typescript@3.8.3 @types/node@13.9.x', shell=True)\nsubprocess.check_call('env', shell=True)\nsubprocess.check_call('which typedoc', shell=True)\nsubprocess.check_call('cd ../ && doxygen doc/doxygen-c.conf', shell=True)\nsubprocess.check_call('cd ../ && doxygen doc/doxygen-java.conf', shell=True)\nsubprocess.check_call('cd ../ && doxygen doc/doxygen-dotnet.conf', shell=True)\n\n# -- General configuration ------------------------------------------------\n\nimport semver\n\n# -- Project information -----------------------------------------------------\n\nproject = u'Mozilla DeepSpeech'\ncopyright = '2016-2020 Mozilla Corporation, 2020 DeepSpeech authors'\nauthor = 'DeepSpeech authors'\n\nwith open('../VERSION', 'r') as ver:\n    v = ver.read().strip()\nvv = semver.parse(v)\n\n# The version info for the project you're documenting, acts as replacement for\n# |version| and |release|, also used in various other places throughout the\n# built documents.\n# The short X.Y version\nversion = '{}.{}'.format(vv['major'], vv['minor'])\n# The full version, including alpha/beta/rc tags\nrelease = v\n\n# If your documentation needs a minimal Sphinx version, state it here.\n#\n# needs_sphinx = '1.0'\n\n# Add any Sphinx extension module names here, as strings. They can be\n# extensions coming with Sphinx (named 'sphinx.ext.*') or your custom\n# ones.\nextensions = [\n  'sphinx.ext.autodoc',\n  'sphinx.ext.extlinks',\n  'sphinx.ext.intersphinx',\n  'sphinx.ext.mathjax',\n  'sphinx.ext.viewcode',\n  'sphinx_rtd_theme',\n  'sphinx_js',\n  'breathe'\n]\n\n\nbreathe_projects = {\n  \"deepspeech-c\": \"xml-c/\",\n  \"deepspeech-java\": \"xml-java/\",\n  \"deepspeech-dotnet\": \"xml-dotnet/\",\n}\n\njs_source_path = \"../native_client/javascript/index.ts\"\njs_language = \"typescript\"\njsdoc_config_path = \"../native_client/javascript/tsconfig.json\"\n\n# Add any paths that contain templates here, relative to this directory.\ntemplates_path = ['.templates']\n\n# The suffix(es) of source filenames.\n# You can specify multiple suffix as a list of string:\n#\n# source_suffix = ['.rst', '.md']\nsource_suffix = '.rst'\n\n# The master toctree document.\nmaster_doc = 'index'\n\n# The language for content autogenerated by Sphinx. Refer to documentation\n# for a list of supported languages.\n#\n# This is also used if you do content translation via gettext catalogs.\n# Usually you set \"language\" from the command line for these cases.\nlanguage = None\n\n# List of patterns, relative to source directory, that match files and\n# directories to ignore when looking for source files.\n# This patterns also effect to html_static_path and html_extra_path\nexclude_patterns = ['.build', 'Thumbs.db', '.DS_Store', 'node_modules']\n\n# The name of the Pygments (syntax highlighting) style to use.\npygments_style = 'sphinx'\n\n# If true, `todo` and `todoList` produce output, else they produce nothing.\ntodo_include_todos = False\n\nadd_module_names = False\n\n\n# -- Options for HTML output ----------------------------------------------\n\n# The theme to use for HTML and HTML Help pages.  See the documentation for\n# a list of builtin themes.\n#\nhtml_theme = 'sphinx_rtd_theme'\n\n# Theme options are theme-specific and customize the look and feel of a theme\n# further.  For a list of options available for each theme, see the\n# documentation.\n#\nhtml_theme_options = {\n  'collapse_navigation': False,\n}\n\n# Add any paths that contain custom static files (such as style sheets) here,\n# relative to this directory. They are copied after the builtin static files,\n# so a file named \"default.css\" will overwrite the builtin \"default.css\".\nhtml_static_path = ['.static']\n\n\n# -- Options for HTMLHelp output ------------------------------------------\n\n# Output file base name for HTML help builder.\nhtmlhelp_basename = 'DeepSpeechdoc'\n\n\n# -- Options for LaTeX output ---------------------------------------------\n\nlatex_elements = {\n    # The paper size ('letterpaper' or 'a4paper').\n    #\n    # 'papersize': 'letterpaper',\n\n    # The font size ('10pt', '11pt' or '12pt').\n    #\n    # 'pointsize': '10pt',\n\n    # Additional stuff for the LaTeX preamble.\n    #\n    # 'preamble': '',\n\n    # Latex figure (float) alignment\n    #\n    # 'figure_align': 'htbp',\n}\n\n# Grouping the document tree into LaTeX files. List of tuples\n# (source start file, target name, title,\n#  author, documentclass [howto, manual, or own class]).\nlatex_documents = [\n    (master_doc, 'DeepSpeech.tex', u'DeepSpeech Documentation',\n     u'DeepSpeech authors', 'manual'),\n]\n\n\n# -- Options for manual page output ---------------------------------------\n\n# One entry per manual page. List of tuples\n# (source start file, name, description, authors, manual section).\nman_pages = [\n    (master_doc, 'deepspeech', u'DeepSpeech Documentation',\n     [author], 1)\n]\n\n\n# -- Options for Texinfo output -------------------------------------------\n\n# Grouping the document tree into Texinfo files. List of tuples\n# (source start file, target name, title, author,\n#  dir menu entry, description, category)\ntexinfo_documents = [\n    (master_doc, 'DeepSpeech', u'DeepSpeech Documentation',\n     author, 'DeepSpeech', 'One line description of project.',\n     'Miscellaneous'),\n]\n\n\n\n\n# Example configuration for intersphinx: refer to the Python standard library.\nintersphinx_mapping = {'https://docs.python.org/': None}\n\nextlinks = {'github': ('https://github.com/mozilla/DeepSpeech/blob/v{}/%s'.format(release),\n                      '%s')}\n"
  },
  {
    "path": "doc/doxygen-c.conf",
    "content": "# Doxyfile 1.8.13\n\n# This file describes the settings to be used by the documentation system\n# doxygen (www.doxygen.org) for a project.\n#\n# All text after a double hash (##) is considered a comment and is placed in\n# front of the TAG it is preceding.\n#\n# All text after a single hash (#) is considered a comment and will be ignored.\n# The format is:\n# TAG = value [value, ...]\n# For lists, items can also be appended using:\n# TAG += value [value, ...]\n# Values that contain spaces should be placed between quotes (\\\" \\\").\n\n#---------------------------------------------------------------------------\n# Project related configuration options\n#---------------------------------------------------------------------------\n\n# This tag specifies the encoding used for all characters in the config file\n# that follow. The default is UTF-8 which is also the encoding used for all text\n# before the first occurrence of this tag. Doxygen uses libiconv (or the iconv\n# built into libc) for the transcoding. See http://www.gnu.org/software/libiconv\n# for the list of possible encodings.\n# The default value is: UTF-8.\n\nDOXYFILE_ENCODING      = UTF-8\n\n# The PROJECT_NAME tag is a single word (or a sequence of words surrounded by\n# double-quotes, unless you are using Doxywizard) that should identify the\n# project for which the documentation is generated. This name is used in the\n# title of most generated pages and in a few other places.\n# The default value is: My Project.\n\nPROJECT_NAME           = \"My Project\"\n\n# The PROJECT_NUMBER tag can be used to enter a project or revision number. This\n# could be handy for archiving the generated documentation or if some version\n# control system is used.\n\nPROJECT_NUMBER         =\n\n# Using the PROJECT_BRIEF tag one can provide an optional one line description\n# for a project that appears at the top of each page and should give viewer a\n# quick idea about the purpose of the project. Keep the description short.\n\nPROJECT_BRIEF          =\n\n# With the PROJECT_LOGO tag one can specify a logo or an icon that is included\n# in the documentation. The maximum height of the logo should not exceed 55\n# pixels and the maximum width should not exceed 200 pixels. Doxygen will copy\n# the logo to the output directory.\n\nPROJECT_LOGO           =\n\n# The OUTPUT_DIRECTORY tag is used to specify the (relative or absolute) path\n# into which the generated documentation will be written. If a relative path is\n# entered, it will be relative to the location where doxygen was started. If\n# left blank the current directory will be used.\n\nOUTPUT_DIRECTORY       = doc/\n\n# If the CREATE_SUBDIRS tag is set to YES then doxygen will create 4096 sub-\n# directories (in 2 levels) under the output directory of each output format and\n# will distribute the generated files over these directories. Enabling this\n# option can be useful when feeding doxygen a huge amount of source files, where\n# putting all generated files in the same directory would otherwise causes\n# performance problems for the file system.\n# The default value is: NO.\n\nCREATE_SUBDIRS         = NO\n\n# If the ALLOW_UNICODE_NAMES tag is set to YES, doxygen will allow non-ASCII\n# characters to appear in the names of generated files. If set to NO, non-ASCII\n# characters will be escaped, for example _xE3_x81_x84 will be used for Unicode\n# U+3044.\n# The default value is: NO.\n\nALLOW_UNICODE_NAMES    = NO\n\n# The OUTPUT_LANGUAGE tag is used to specify the language in which all\n# documentation generated by doxygen is written. Doxygen will use this\n# information to generate all constant output in the proper language.\n# Possible values are: Afrikaans, Arabic, Armenian, Brazilian, Catalan, Chinese,\n# Chinese-Traditional, Croatian, Czech, Danish, Dutch, English (United States),\n# Esperanto, Farsi (Persian), Finnish, French, German, Greek, Hungarian,\n# Indonesian, Italian, Japanese, Japanese-en (Japanese with English messages),\n# Korean, Korean-en (Korean with English messages), Latvian, Lithuanian,\n# Macedonian, Norwegian, Persian (Farsi), Polish, Portuguese, Romanian, Russian,\n# Serbian, Serbian-Cyrillic, Slovak, Slovene, Spanish, Swedish, Turkish,\n# Ukrainian and Vietnamese.\n# The default value is: English.\n\nOUTPUT_LANGUAGE        = English\n\n# If the BRIEF_MEMBER_DESC tag is set to YES, doxygen will include brief member\n# descriptions after the members that are listed in the file and class\n# documentation (similar to Javadoc). Set to NO to disable this.\n# The default value is: YES.\n\nBRIEF_MEMBER_DESC      = YES\n\n# If the REPEAT_BRIEF tag is set to YES, doxygen will prepend the brief\n# description of a member or function before the detailed description\n#\n# Note: If both HIDE_UNDOC_MEMBERS and BRIEF_MEMBER_DESC are set to NO, the\n# brief descriptions will be completely suppressed.\n# The default value is: YES.\n\nREPEAT_BRIEF           = YES\n\n# This tag implements a quasi-intelligent brief description abbreviator that is\n# used to form the text in various listings. Each string in this list, if found\n# as the leading text of the brief description, will be stripped from the text\n# and the result, after processing the whole list, is used as the annotated\n# text. Otherwise, the brief description is used as-is. If left blank, the\n# following values are used ($name is automatically replaced with the name of\n# the entity):The $name class, The $name widget, The $name file, is, provides,\n# specifies, contains, represents, a, an and the.\n\nABBREVIATE_BRIEF       = \"The $name class\" \\\n                         \"The $name widget\" \\\n                         \"The $name file\" \\\n                         is \\\n                         provides \\\n                         specifies \\\n                         contains \\\n                         represents \\\n                         a \\\n                         an \\\n                         the\n\n# If the ALWAYS_DETAILED_SEC and REPEAT_BRIEF tags are both set to YES then\n# doxygen will generate a detailed section even if there is only a brief\n# description.\n# The default value is: NO.\n\nALWAYS_DETAILED_SEC    = NO\n\n# If the INLINE_INHERITED_MEMB tag is set to YES, doxygen will show all\n# inherited members of a class in the documentation of that class as if those\n# members were ordinary class members. Constructors, destructors and assignment\n# operators of the base classes will not be shown.\n# The default value is: NO.\n\nINLINE_INHERITED_MEMB  = NO\n\n# If the FULL_PATH_NAMES tag is set to YES, doxygen will prepend the full path\n# before files name in the file list and in the header files. If set to NO the\n# shortest path that makes the file name unique will be used\n# The default value is: YES.\n\nFULL_PATH_NAMES        = YES\n\n# The STRIP_FROM_PATH tag can be used to strip a user-defined part of the path.\n# Stripping is only done if one of the specified strings matches the left-hand\n# part of the path. The tag can be used to show relative paths in the file list.\n# If left blank the directory from which doxygen is run is used as the path to\n# strip.\n#\n# Note that you can specify absolute paths here, but also relative paths, which\n# will be relative from the directory where doxygen is started.\n# This tag requires that the tag FULL_PATH_NAMES is set to YES.\n\nSTRIP_FROM_PATH        =\n\n# The STRIP_FROM_INC_PATH tag can be used to strip a user-defined part of the\n# path mentioned in the documentation of a class, which tells the reader which\n# header file to include in order to use a class. If left blank only the name of\n# the header file containing the class definition is used. Otherwise one should\n# specify the list of include paths that are normally passed to the compiler\n# using the -I flag.\n\nSTRIP_FROM_INC_PATH    =\n\n# If the SHORT_NAMES tag is set to YES, doxygen will generate much shorter (but\n# less readable) file names. This can be useful is your file systems doesn't\n# support long names like on DOS, Mac, or CD-ROM.\n# The default value is: NO.\n\nSHORT_NAMES            = NO\n\n# If the JAVADOC_AUTOBRIEF tag is set to YES then doxygen will interpret the\n# first line (until the first dot) of a Javadoc-style comment as the brief\n# description. If set to NO, the Javadoc-style will behave just like regular Qt-\n# style comments (thus requiring an explicit @brief command for a brief\n# description.)\n# The default value is: NO.\n\nJAVADOC_AUTOBRIEF      = NO\n\n# If the QT_AUTOBRIEF tag is set to YES then doxygen will interpret the first\n# line (until the first dot) of a Qt-style comment as the brief description. If\n# set to NO, the Qt-style will behave just like regular Qt-style comments (thus\n# requiring an explicit \\brief command for a brief description.)\n# The default value is: NO.\n\nQT_AUTOBRIEF           = NO\n\n# The MULTILINE_CPP_IS_BRIEF tag can be set to YES to make doxygen treat a\n# multi-line C++ special comment block (i.e. a block of //! or /// comments) as\n# a brief description. This used to be the default behavior. The new default is\n# to treat a multi-line C++ comment block as a detailed description. Set this\n# tag to YES if you prefer the old behavior instead.\n#\n# Note that setting this tag to YES also means that rational rose comments are\n# not recognized any more.\n# The default value is: NO.\n\nMULTILINE_CPP_IS_BRIEF = NO\n\n# If the INHERIT_DOCS tag is set to YES then an undocumented member inherits the\n# documentation from any documented member that it re-implements.\n# The default value is: YES.\n\nINHERIT_DOCS           = YES\n\n# If the SEPARATE_MEMBER_PAGES tag is set to YES then doxygen will produce a new\n# page for each member. If set to NO, the documentation of a member will be part\n# of the file/class/namespace that contains it.\n# The default value is: NO.\n\nSEPARATE_MEMBER_PAGES  = NO\n\n# The TAB_SIZE tag can be used to set the number of spaces in a tab. Doxygen\n# uses this value to replace tabs by spaces in code fragments.\n# Minimum value: 1, maximum value: 16, default value: 4.\n\nTAB_SIZE               = 4\n\n# This tag can be used to specify a number of aliases that act as commands in\n# the documentation. An alias has the form:\n# name=value\n# For example adding\n# \"sideeffect=@par Side Effects:\\n\"\n# will allow you to put the command \\sideeffect (or @sideeffect) in the\n# documentation, which will result in a user-defined paragraph with heading\n# \"Side Effects:\". You can put \\n's in the value part of an alias to insert\n# newlines.\n\nALIASES                =\n\n# This tag can be used to specify a number of word-keyword mappings (TCL only).\n# A mapping has the form \"name=value\". For example adding \"class=itcl::class\"\n# will allow you to use the command class in the itcl::class meaning.\n\nTCL_SUBST              =\n\n# Set the OPTIMIZE_OUTPUT_FOR_C tag to YES if your project consists of C sources\n# only. Doxygen will then generate output that is more tailored for C. For\n# instance, some of the names that are used will be different. The list of all\n# members will be omitted, etc.\n# The default value is: NO.\n\nOPTIMIZE_OUTPUT_FOR_C  = YES\n\n# Set the OPTIMIZE_OUTPUT_JAVA tag to YES if your project consists of Java or\n# Python sources only. Doxygen will then generate output that is more tailored\n# for that language. For instance, namespaces will be presented as packages,\n# qualified scopes will look different, etc.\n# The default value is: NO.\n\nOPTIMIZE_OUTPUT_JAVA   = NO\n\n# Set the OPTIMIZE_FOR_FORTRAN tag to YES if your project consists of Fortran\n# sources. Doxygen will then generate output that is tailored for Fortran.\n# The default value is: NO.\n\nOPTIMIZE_FOR_FORTRAN   = NO\n\n# Set the OPTIMIZE_OUTPUT_VHDL tag to YES if your project consists of VHDL\n# sources. Doxygen will then generate output that is tailored for VHDL.\n# The default value is: NO.\n\nOPTIMIZE_OUTPUT_VHDL   = NO\n\n# Doxygen selects the parser to use depending on the extension of the files it\n# parses. With this tag you can assign which parser to use for a given\n# extension. Doxygen has a built-in mapping, but you can override or extend it\n# using this tag. The format is ext=language, where ext is a file extension, and\n# language is one of the parsers supported by doxygen: IDL, Java, Javascript,\n# C#, C, C++, D, PHP, Objective-C, Python, Fortran (fixed format Fortran:\n# FortranFixed, free formatted Fortran: FortranFree, unknown formatted Fortran:\n# Fortran. In the later case the parser tries to guess whether the code is fixed\n# or free formatted code, this is the default for Fortran type files), VHDL. For\n# instance to make doxygen treat .inc files as Fortran files (default is PHP),\n# and .f files as C (default is Fortran), use: inc=Fortran f=C.\n#\n# Note: For files without extension you can use no_extension as a placeholder.\n#\n# Note that for custom extensions you also need to set FILE_PATTERNS otherwise\n# the files are not read by doxygen.\n\nEXTENSION_MAPPING      =\n\n# If the MARKDOWN_SUPPORT tag is enabled then doxygen pre-processes all comments\n# according to the Markdown format, which allows for more readable\n# documentation. See http://daringfireball.net/projects/markdown/ for details.\n# The output of markdown processing is further processed by doxygen, so you can\n# mix doxygen, HTML, and XML commands with Markdown formatting. Disable only in\n# case of backward compatibilities issues.\n# The default value is: YES.\n\nMARKDOWN_SUPPORT       = YES\n\n# When the TOC_INCLUDE_HEADINGS tag is set to a non-zero value, all headings up\n# to that level are automatically included in the table of contents, even if\n# they do not have an id attribute.\n# Note: This feature currently applies only to Markdown headings.\n# Minimum value: 0, maximum value: 99, default value: 0.\n# This tag requires that the tag MARKDOWN_SUPPORT is set to YES.\n\nTOC_INCLUDE_HEADINGS   = 0\n\n# When enabled doxygen tries to link words that correspond to documented\n# classes, or namespaces to their corresponding documentation. Such a link can\n# be prevented in individual cases by putting a % sign in front of the word or\n# globally by setting AUTOLINK_SUPPORT to NO.\n# The default value is: YES.\n\nAUTOLINK_SUPPORT       = YES\n\n# If you use STL classes (i.e. std::string, std::vector, etc.) but do not want\n# to include (a tag file for) the STL sources as input, then you should set this\n# tag to YES in order to let doxygen match functions declarations and\n# definitions whose arguments contain STL classes (e.g. func(std::string);\n# versus func(std::string) {}). This also make the inheritance and collaboration\n# diagrams that involve STL classes more complete and accurate.\n# The default value is: NO.\n\nBUILTIN_STL_SUPPORT    = NO\n\n# If you use Microsoft's C++/CLI language, you should set this option to YES to\n# enable parsing support.\n# The default value is: NO.\n\nCPP_CLI_SUPPORT        = NO\n\n# Set the SIP_SUPPORT tag to YES if your project consists of sip (see:\n# http://www.riverbankcomputing.co.uk/software/sip/intro) sources only. Doxygen\n# will parse them like normal C++ but will assume all classes use public instead\n# of private inheritance when no explicit protection keyword is present.\n# The default value is: NO.\n\nSIP_SUPPORT            = NO\n\n# For Microsoft's IDL there are propget and propput attributes to indicate\n# getter and setter methods for a property. Setting this option to YES will make\n# doxygen to replace the get and set methods by a property in the documentation.\n# This will only work if the methods are indeed getting or setting a simple\n# type. If this is not the case, or you want to show the methods anyway, you\n# should set this option to NO.\n# The default value is: YES.\n\nIDL_PROPERTY_SUPPORT   = YES\n\n# If member grouping is used in the documentation and the DISTRIBUTE_GROUP_DOC\n# tag is set to YES then doxygen will reuse the documentation of the first\n# member in the group (if any) for the other members of the group. By default\n# all members of a group must be documented explicitly.\n# The default value is: NO.\n\nDISTRIBUTE_GROUP_DOC   = NO\n\n# If one adds a struct or class to a group and this option is enabled, then also\n# any nested class or struct is added to the same group. By default this option\n# is disabled and one has to add nested compounds explicitly via \\ingroup.\n# The default value is: NO.\n\nGROUP_NESTED_COMPOUNDS = NO\n\n# Set the SUBGROUPING tag to YES to allow class member groups of the same type\n# (for instance a group of public functions) to be put as a subgroup of that\n# type (e.g. under the Public Functions section). Set it to NO to prevent\n# subgrouping. Alternatively, this can be done per class using the\n# \\nosubgrouping command.\n# The default value is: YES.\n\nSUBGROUPING            = YES\n\n# When the INLINE_GROUPED_CLASSES tag is set to YES, classes, structs and unions\n# are shown inside the group in which they are included (e.g. using \\ingroup)\n# instead of on a separate page (for HTML and Man pages) or section (for LaTeX\n# and RTF).\n#\n# Note that this feature does not work in combination with\n# SEPARATE_MEMBER_PAGES.\n# The default value is: NO.\n\nINLINE_GROUPED_CLASSES = NO\n\n# When the INLINE_SIMPLE_STRUCTS tag is set to YES, structs, classes, and unions\n# with only public data fields or simple typedef fields will be shown inline in\n# the documentation of the scope in which they are defined (i.e. file,\n# namespace, or group documentation), provided this scope is documented. If set\n# to NO, structs, classes, and unions are shown on a separate page (for HTML and\n# Man pages) or section (for LaTeX and RTF).\n# The default value is: NO.\n\nINLINE_SIMPLE_STRUCTS  = NO\n\n# When TYPEDEF_HIDES_STRUCT tag is enabled, a typedef of a struct, union, or\n# enum is documented as struct, union, or enum with the name of the typedef. So\n# typedef struct TypeS {} TypeT, will appear in the documentation as a struct\n# with name TypeT. When disabled the typedef will appear as a member of a file,\n# namespace, or class. And the struct will be named TypeS. This can typically be\n# useful for C code in case the coding convention dictates that all compound\n# types are typedef'ed and only the typedef is referenced, never the tag name.\n# The default value is: NO.\n\nTYPEDEF_HIDES_STRUCT   = NO\n\n# The size of the symbol lookup cache can be set using LOOKUP_CACHE_SIZE. This\n# cache is used to resolve symbols given their name and scope. Since this can be\n# an expensive process and often the same symbol appears multiple times in the\n# code, doxygen keeps a cache of pre-resolved symbols. If the cache is too small\n# doxygen will become slower. If the cache is too large, memory is wasted. The\n# cache size is given by this formula: 2^(16+LOOKUP_CACHE_SIZE). The valid range\n# is 0..9, the default is 0, corresponding to a cache size of 2^16=65536\n# symbols. At the end of a run doxygen will report the cache usage and suggest\n# the optimal cache size from a speed point of view.\n# Minimum value: 0, maximum value: 9, default value: 0.\n\nLOOKUP_CACHE_SIZE      = 0\n\n#---------------------------------------------------------------------------\n# Build related configuration options\n#---------------------------------------------------------------------------\n\n# If the EXTRACT_ALL tag is set to YES, doxygen will assume all entities in\n# documentation are documented, even if no documentation was available. Private\n# class members and static file members will be hidden unless the\n# EXTRACT_PRIVATE respectively EXTRACT_STATIC tags are set to YES.\n# Note: This will also disable the warnings about undocumented members that are\n# normally produced when WARNINGS is set to YES.\n# The default value is: NO.\n\nEXTRACT_ALL            = YES\n\n# If the EXTRACT_PRIVATE tag is set to YES, all private members of a class will\n# be included in the documentation.\n# The default value is: NO.\n\nEXTRACT_PRIVATE        = NO\n\n# If the EXTRACT_PACKAGE tag is set to YES, all members with package or internal\n# scope will be included in the documentation.\n# The default value is: NO.\n\nEXTRACT_PACKAGE        = NO\n\n# If the EXTRACT_STATIC tag is set to YES, all static members of a file will be\n# included in the documentation.\n# The default value is: NO.\n\nEXTRACT_STATIC         = NO\n\n# If the EXTRACT_LOCAL_CLASSES tag is set to YES, classes (and structs) defined\n# locally in source files will be included in the documentation. If set to NO,\n# only classes defined in header files are included. Does not have any effect\n# for Java sources.\n# The default value is: YES.\n\nEXTRACT_LOCAL_CLASSES  = YES\n\n# This flag is only useful for Objective-C code. If set to YES, local methods,\n# which are defined in the implementation section but not in the interface are\n# included in the documentation. If set to NO, only methods in the interface are\n# included.\n# The default value is: NO.\n\nEXTRACT_LOCAL_METHODS  = NO\n\n# If this flag is set to YES, the members of anonymous namespaces will be\n# extracted and appear in the documentation as a namespace called\n# 'anonymous_namespace{file}', where file will be replaced with the base name of\n# the file that contains the anonymous namespace. By default anonymous namespace\n# are hidden.\n# The default value is: NO.\n\nEXTRACT_ANON_NSPACES   = NO\n\n# If the HIDE_UNDOC_MEMBERS tag is set to YES, doxygen will hide all\n# undocumented members inside documented classes or files. If set to NO these\n# members will be included in the various overviews, but no documentation\n# section is generated. This option has no effect if EXTRACT_ALL is enabled.\n# The default value is: NO.\n\nHIDE_UNDOC_MEMBERS     = NO\n\n# If the HIDE_UNDOC_CLASSES tag is set to YES, doxygen will hide all\n# undocumented classes that are normally visible in the class hierarchy. If set\n# to NO, these classes will be included in the various overviews. This option\n# has no effect if EXTRACT_ALL is enabled.\n# The default value is: NO.\n\nHIDE_UNDOC_CLASSES     = NO\n\n# If the HIDE_FRIEND_COMPOUNDS tag is set to YES, doxygen will hide all friend\n# (class|struct|union) declarations. If set to NO, these declarations will be\n# included in the documentation.\n# The default value is: NO.\n\nHIDE_FRIEND_COMPOUNDS  = NO\n\n# If the HIDE_IN_BODY_DOCS tag is set to YES, doxygen will hide any\n# documentation blocks found inside the body of a function. If set to NO, these\n# blocks will be appended to the function's detailed documentation block.\n# The default value is: NO.\n\nHIDE_IN_BODY_DOCS      = NO\n\n# The INTERNAL_DOCS tag determines if documentation that is typed after a\n# \\internal command is included. If the tag is set to NO then the documentation\n# will be excluded. Set it to YES to include the internal documentation.\n# The default value is: NO.\n\nINTERNAL_DOCS          = NO\n\n# If the CASE_SENSE_NAMES tag is set to NO then doxygen will only generate file\n# names in lower-case letters. If set to YES, upper-case letters are also\n# allowed. This is useful if you have classes or files whose names only differ\n# in case and if your file system supports case sensitive file names. Windows\n# and Mac users are advised to set this option to NO.\n# The default value is: system dependent.\n\nCASE_SENSE_NAMES       = YES\n\n# If the HIDE_SCOPE_NAMES tag is set to NO then doxygen will show members with\n# their full class and namespace scopes in the documentation. If set to YES, the\n# scope will be hidden.\n# The default value is: NO.\n\nHIDE_SCOPE_NAMES       = NO\n\n# If the HIDE_COMPOUND_REFERENCE tag is set to NO (default) then doxygen will\n# append additional text to a page's title, such as Class Reference. If set to\n# YES the compound reference will be hidden.\n# The default value is: NO.\n\nHIDE_COMPOUND_REFERENCE= NO\n\n# If the SHOW_INCLUDE_FILES tag is set to YES then doxygen will put a list of\n# the files that are included by a file in the documentation of that file.\n# The default value is: YES.\n\nSHOW_INCLUDE_FILES     = YES\n\n# If the SHOW_GROUPED_MEMB_INC tag is set to YES then Doxygen will add for each\n# grouped member an include statement to the documentation, telling the reader\n# which file to include in order to use the member.\n# The default value is: NO.\n\nSHOW_GROUPED_MEMB_INC  = NO\n\n# If the FORCE_LOCAL_INCLUDES tag is set to YES then doxygen will list include\n# files with double quotes in the documentation rather than with sharp brackets.\n# The default value is: NO.\n\nFORCE_LOCAL_INCLUDES   = NO\n\n# If the INLINE_INFO tag is set to YES then a tag [inline] is inserted in the\n# documentation for inline members.\n# The default value is: YES.\n\nINLINE_INFO            = YES\n\n# If the SORT_MEMBER_DOCS tag is set to YES then doxygen will sort the\n# (detailed) documentation of file and class members alphabetically by member\n# name. If set to NO, the members will appear in declaration order.\n# The default value is: YES.\n\nSORT_MEMBER_DOCS       = YES\n\n# If the SORT_BRIEF_DOCS tag is set to YES then doxygen will sort the brief\n# descriptions of file, namespace and class members alphabetically by member\n# name. If set to NO, the members will appear in declaration order. Note that\n# this will also influence the order of the classes in the class list.\n# The default value is: NO.\n\nSORT_BRIEF_DOCS        = NO\n\n# If the SORT_MEMBERS_CTORS_1ST tag is set to YES then doxygen will sort the\n# (brief and detailed) documentation of class members so that constructors and\n# destructors are listed first. If set to NO the constructors will appear in the\n# respective orders defined by SORT_BRIEF_DOCS and SORT_MEMBER_DOCS.\n# Note: If SORT_BRIEF_DOCS is set to NO this option is ignored for sorting brief\n# member documentation.\n# Note: If SORT_MEMBER_DOCS is set to NO this option is ignored for sorting\n# detailed member documentation.\n# The default value is: NO.\n\nSORT_MEMBERS_CTORS_1ST = NO\n\n# If the SORT_GROUP_NAMES tag is set to YES then doxygen will sort the hierarchy\n# of group names into alphabetical order. If set to NO the group names will\n# appear in their defined order.\n# The default value is: NO.\n\nSORT_GROUP_NAMES       = NO\n\n# If the SORT_BY_SCOPE_NAME tag is set to YES, the class list will be sorted by\n# fully-qualified names, including namespaces. If set to NO, the class list will\n# be sorted only by class name, not including the namespace part.\n# Note: This option is not very useful if HIDE_SCOPE_NAMES is set to YES.\n# Note: This option applies only to the class list, not to the alphabetical\n# list.\n# The default value is: NO.\n\nSORT_BY_SCOPE_NAME     = NO\n\n# If the STRICT_PROTO_MATCHING option is enabled and doxygen fails to do proper\n# type resolution of all parameters of a function it will reject a match between\n# the prototype and the implementation of a member function even if there is\n# only one candidate or it is obvious which candidate to choose by doing a\n# simple string match. By disabling STRICT_PROTO_MATCHING doxygen will still\n# accept a match between prototype and implementation in such cases.\n# The default value is: NO.\n\nSTRICT_PROTO_MATCHING  = NO\n\n# The GENERATE_TODOLIST tag can be used to enable (YES) or disable (NO) the todo\n# list. This list is created by putting \\todo commands in the documentation.\n# The default value is: YES.\n\nGENERATE_TODOLIST      = NO\n\n# The GENERATE_TESTLIST tag can be used to enable (YES) or disable (NO) the test\n# list. This list is created by putting \\test commands in the documentation.\n# The default value is: YES.\n\nGENERATE_TESTLIST      = NO\n\n# The GENERATE_BUGLIST tag can be used to enable (YES) or disable (NO) the bug\n# list. This list is created by putting \\bug commands in the documentation.\n# The default value is: YES.\n\nGENERATE_BUGLIST       = NO\n\n# The GENERATE_DEPRECATEDLIST tag can be used to enable (YES) or disable (NO)\n# the deprecated list. This list is created by putting \\deprecated commands in\n# the documentation.\n# The default value is: YES.\n\nGENERATE_DEPRECATEDLIST= YES\n\n# The ENABLED_SECTIONS tag can be used to enable conditional documentation\n# sections, marked by \\if <section_label> ... \\endif and \\cond <section_label>\n# ... \\endcond blocks.\n\nENABLED_SECTIONS       =\n\n# The MAX_INITIALIZER_LINES tag determines the maximum number of lines that the\n# initial value of a variable or macro / define can have for it to appear in the\n# documentation. If the initializer consists of more lines than specified here\n# it will be hidden. Use a value of 0 to hide initializers completely. The\n# appearance of the value of individual variables and macros / defines can be\n# controlled using \\showinitializer or \\hideinitializer command in the\n# documentation regardless of this setting.\n# Minimum value: 0, maximum value: 10000, default value: 30.\n\nMAX_INITIALIZER_LINES  = 30\n\n# Set the SHOW_USED_FILES tag to NO to disable the list of files generated at\n# the bottom of the documentation of classes and structs. If set to YES, the\n# list will mention the files that were used to generate the documentation.\n# The default value is: YES.\n\nSHOW_USED_FILES        = YES\n\n# Set the SHOW_FILES tag to NO to disable the generation of the Files page. This\n# will remove the Files entry from the Quick Index and from the Folder Tree View\n# (if specified).\n# The default value is: YES.\n\nSHOW_FILES             = YES\n\n# Set the SHOW_NAMESPACES tag to NO to disable the generation of the Namespaces\n# page. This will remove the Namespaces entry from the Quick Index and from the\n# Folder Tree View (if specified).\n# The default value is: YES.\n\nSHOW_NAMESPACES        = YES\n\n# The FILE_VERSION_FILTER tag can be used to specify a program or script that\n# doxygen should invoke to get the current version for each file (typically from\n# the version control system). Doxygen will invoke the program by executing (via\n# popen()) the command command input-file, where command is the value of the\n# FILE_VERSION_FILTER tag, and input-file is the name of an input file provided\n# by doxygen. Whatever the program writes to standard output is used as the file\n# version. For an example see the documentation.\n\nFILE_VERSION_FILTER    =\n\n# The LAYOUT_FILE tag can be used to specify a layout file which will be parsed\n# by doxygen. The layout file controls the global structure of the generated\n# output files in an output format independent way. To create the layout file\n# that represents doxygen's defaults, run doxygen with the -l option. You can\n# optionally specify a file name after the option, if omitted DoxygenLayout.xml\n# will be used as the name of the layout file.\n#\n# Note that if you run doxygen from a directory containing a file called\n# DoxygenLayout.xml, doxygen will parse it automatically even if the LAYOUT_FILE\n# tag is left empty.\n\nLAYOUT_FILE            =\n\n# The CITE_BIB_FILES tag can be used to specify one or more bib files containing\n# the reference definitions. This must be a list of .bib files. The .bib\n# extension is automatically appended if omitted. This requires the bibtex tool\n# to be installed. See also http://en.wikipedia.org/wiki/BibTeX for more info.\n# For LaTeX the style of the bibliography can be controlled using\n# LATEX_BIB_STYLE. To use this feature you need bibtex and perl available in the\n# search path. See also \\cite for info how to create references.\n\nCITE_BIB_FILES         =\n\n#---------------------------------------------------------------------------\n# Configuration options related to warning and progress messages\n#---------------------------------------------------------------------------\n\n# The QUIET tag can be used to turn on/off the messages that are generated to\n# standard output by doxygen. If QUIET is set to YES this implies that the\n# messages are off.\n# The default value is: NO.\n\nQUIET                  = NO\n\n# The WARNINGS tag can be used to turn on/off the warning messages that are\n# generated to standard error (stderr) by doxygen. If WARNINGS is set to YES\n# this implies that the warnings are on.\n#\n# Tip: Turn warnings on while writing the documentation.\n# The default value is: YES.\n\nWARNINGS               = YES\n\n# If the WARN_IF_UNDOCUMENTED tag is set to YES then doxygen will generate\n# warnings for undocumented members. If EXTRACT_ALL is set to YES then this flag\n# will automatically be disabled.\n# The default value is: YES.\n\nWARN_IF_UNDOCUMENTED   = YES\n\n# If the WARN_IF_DOC_ERROR tag is set to YES, doxygen will generate warnings for\n# potential errors in the documentation, such as not documenting some parameters\n# in a documented function, or documenting parameters that don't exist or using\n# markup commands wrongly.\n# The default value is: YES.\n\nWARN_IF_DOC_ERROR      = YES\n\n# This WARN_NO_PARAMDOC option can be enabled to get warnings for functions that\n# are documented, but have no documentation for their parameters or return\n# value. If set to NO, doxygen will only warn about wrong or incomplete\n# parameter documentation, but not about the absence of documentation.\n# The default value is: NO.\n\nWARN_NO_PARAMDOC       = NO\n\n# If the WARN_AS_ERROR tag is set to YES then doxygen will immediately stop when\n# a warning is encountered.\n# The default value is: NO.\n\nWARN_AS_ERROR          = NO\n\n# The WARN_FORMAT tag determines the format of the warning messages that doxygen\n# can produce. The string should contain the $file, $line, and $text tags, which\n# will be replaced by the file and line number from which the warning originated\n# and the warning text. Optionally the format may contain $version, which will\n# be replaced by the version of the file (if it could be obtained via\n# FILE_VERSION_FILTER)\n# The default value is: $file:$line: $text.\n\nWARN_FORMAT            = \"$file:$line: $text\"\n\n# The WARN_LOGFILE tag can be used to specify a file to which warning and error\n# messages should be written. If left blank the output is written to standard\n# error (stderr).\n\nWARN_LOGFILE           =\n\n#---------------------------------------------------------------------------\n# Configuration options related to the input files\n#---------------------------------------------------------------------------\n\n# The INPUT tag is used to specify the files and/or directories that contain\n# documented source files. You may enter file names like myfile.cpp or\n# directories like /usr/src/myproject. Separate the files or directories with\n# spaces. See also FILE_PATTERNS and EXTENSION_MAPPING\n# Note: If this tag is empty the current directory is searched.\n\nINPUT                  = native_client/deepspeech.h\n\n# This tag can be used to specify the character encoding of the source files\n# that doxygen parses. Internally doxygen uses the UTF-8 encoding. Doxygen uses\n# libiconv (or the iconv built into libc) for the transcoding. See the libiconv\n# documentation (see: http://www.gnu.org/software/libiconv) for the list of\n# possible encodings.\n# The default value is: UTF-8.\n\nINPUT_ENCODING         = UTF-8\n\n# If the value of the INPUT tag contains directories, you can use the\n# FILE_PATTERNS tag to specify one or more wildcard patterns (like *.cpp and\n# *.h) to filter out the source-files in the directories.\n#\n# Note that for custom extensions or not directly supported extensions you also\n# need to set EXTENSION_MAPPING for the extension otherwise the files are not\n# read by doxygen.\n#\n# If left blank the following patterns are tested:*.c, *.cc, *.cxx, *.cpp,\n# *.c++, *.java, *.ii, *.ixx, *.ipp, *.i++, *.inl, *.idl, *.ddl, *.odl, *.h,\n# *.hh, *.hxx, *.hpp, *.h++, *.cs, *.d, *.php, *.php4, *.php5, *.phtml, *.inc,\n# *.m, *.markdown, *.md, *.mm, *.dox, *.py, *.pyw, *.f90, *.f95, *.f03, *.f08,\n# *.f, *.for, *.tcl, *.vhd, *.vhdl, *.ucf and *.qsf.\n\nFILE_PATTERNS          = *.c \\\n                         *.cc \\\n                         *.cxx \\\n                         *.cpp \\\n                         *.c++ \\\n                         *.java \\\n                         *.ii \\\n                         *.ixx \\\n                         *.ipp \\\n                         *.i++ \\\n                         *.inl \\\n                         *.idl \\\n                         *.ddl \\\n                         *.odl \\\n                         *.h \\\n                         *.hh \\\n                         *.hxx \\\n                         *.hpp \\\n                         *.h++ \\\n                         *.cs \\\n                         *.d \\\n                         *.php \\\n                         *.php4 \\\n                         *.php5 \\\n                         *.phtml \\\n                         *.inc \\\n                         *.m \\\n                         *.markdown \\\n                         *.md \\\n                         *.mm \\\n                         *.dox \\\n                         *.py \\\n                         *.pyw \\\n                         *.f90 \\\n                         *.f95 \\\n                         *.f03 \\\n                         *.f08 \\\n                         *.f \\\n                         *.for \\\n                         *.tcl \\\n                         *.vhd \\\n                         *.vhdl \\\n                         *.ucf \\\n                         *.qsf\n\n# The RECURSIVE tag can be used to specify whether or not subdirectories should\n# be searched for input files as well.\n# The default value is: NO.\n\nRECURSIVE              = NO\n\n# The EXCLUDE tag can be used to specify files and/or directories that should be\n# excluded from the INPUT source files. This way you can easily exclude a\n# subdirectory from a directory tree whose root is specified with the INPUT tag.\n#\n# Note that relative paths are relative to the directory from which doxygen is\n# run.\n\nEXCLUDE                =\n\n# The EXCLUDE_SYMLINKS tag can be used to select whether or not files or\n# directories that are symbolic links (a Unix file system feature) are excluded\n# from the input.\n# The default value is: NO.\n\nEXCLUDE_SYMLINKS       = NO\n\n# If the value of the INPUT tag contains directories, you can use the\n# EXCLUDE_PATTERNS tag to specify one or more wildcard patterns to exclude\n# certain files from those directories.\n#\n# Note that the wildcards are matched against the file with absolute path, so to\n# exclude all test directories for example use the pattern */test/*\n\nEXCLUDE_PATTERNS       =\n\n# The EXCLUDE_SYMBOLS tag can be used to specify one or more symbol names\n# (namespaces, classes, functions, etc.) that should be excluded from the\n# output. The symbol name can be a fully qualified name, a word, or if the\n# wildcard * is used, a substring. Examples: ANamespace, AClass,\n# AClass::ANamespace, ANamespace::*Test\n#\n# Note that the wildcards are matched against the file with absolute path, so to\n# exclude all test directories use the pattern */test/*\n\nEXCLUDE_SYMBOLS        =\n\n# The EXAMPLE_PATH tag can be used to specify one or more files or directories\n# that contain example code fragments that are included (see the \\include\n# command).\n\nEXAMPLE_PATH           =\n\n# If the value of the EXAMPLE_PATH tag contains directories, you can use the\n# EXAMPLE_PATTERNS tag to specify one or more wildcard pattern (like *.cpp and\n# *.h) to filter out the source-files in the directories. If left blank all\n# files are included.\n\nEXAMPLE_PATTERNS       = *\n\n# If the EXAMPLE_RECURSIVE tag is set to YES then subdirectories will be\n# searched for input files to be used with the \\include or \\dontinclude commands\n# irrespective of the value of the RECURSIVE tag.\n# The default value is: NO.\n\nEXAMPLE_RECURSIVE      = NO\n\n# The IMAGE_PATH tag can be used to specify one or more files or directories\n# that contain images that are to be included in the documentation (see the\n# \\image command).\n\nIMAGE_PATH             =\n\n# The INPUT_FILTER tag can be used to specify a program that doxygen should\n# invoke to filter for each input file. Doxygen will invoke the filter program\n# by executing (via popen()) the command:\n#\n# <filter> <input-file>\n#\n# where <filter> is the value of the INPUT_FILTER tag, and <input-file> is the\n# name of an input file. Doxygen will then use the output that the filter\n# program writes to standard output. If FILTER_PATTERNS is specified, this tag\n# will be ignored.\n#\n# Note that the filter must not add or remove lines; it is applied before the\n# code is scanned, but not when the output code is generated. If lines are added\n# or removed, the anchors will not be placed correctly.\n#\n# Note that for custom extensions or not directly supported extensions you also\n# need to set EXTENSION_MAPPING for the extension otherwise the files are not\n# properly processed by doxygen.\n\nINPUT_FILTER           =\n\n# The FILTER_PATTERNS tag can be used to specify filters on a per file pattern\n# basis. Doxygen will compare the file name with each pattern and apply the\n# filter if there is a match. The filters are a list of the form: pattern=filter\n# (like *.cpp=my_cpp_filter). See INPUT_FILTER for further information on how\n# filters are used. If the FILTER_PATTERNS tag is empty or if none of the\n# patterns match the file name, INPUT_FILTER is applied.\n#\n# Note that for custom extensions or not directly supported extensions you also\n# need to set EXTENSION_MAPPING for the extension otherwise the files are not\n# properly processed by doxygen.\n\nFILTER_PATTERNS        =\n\n# If the FILTER_SOURCE_FILES tag is set to YES, the input filter (if set using\n# INPUT_FILTER) will also be used to filter the input files that are used for\n# producing the source files to browse (i.e. when SOURCE_BROWSER is set to YES).\n# The default value is: NO.\n\nFILTER_SOURCE_FILES    = NO\n\n# The FILTER_SOURCE_PATTERNS tag can be used to specify source filters per file\n# pattern. A pattern will override the setting for FILTER_PATTERN (if any) and\n# it is also possible to disable source filtering for a specific pattern using\n# *.ext= (so without naming a filter).\n# This tag requires that the tag FILTER_SOURCE_FILES is set to YES.\n\nFILTER_SOURCE_PATTERNS =\n\n# If the USE_MDFILE_AS_MAINPAGE tag refers to the name of a markdown file that\n# is part of the input, its contents will be placed on the main page\n# (index.html). This can be useful if you have a project on for instance GitHub\n# and want to reuse the introduction page also for the doxygen output.\n\nUSE_MDFILE_AS_MAINPAGE =\n\n#---------------------------------------------------------------------------\n# Configuration options related to source browsing\n#---------------------------------------------------------------------------\n\n# If the SOURCE_BROWSER tag is set to YES then a list of source files will be\n# generated. Documented entities will be cross-referenced with these sources.\n#\n# Note: To get rid of all source code in the generated output, make sure that\n# also VERBATIM_HEADERS is set to NO.\n# The default value is: NO.\n\nSOURCE_BROWSER         = NO\n\n# Setting the INLINE_SOURCES tag to YES will include the body of functions,\n# classes and enums directly into the documentation.\n# The default value is: NO.\n\nINLINE_SOURCES         = NO\n\n# Setting the STRIP_CODE_COMMENTS tag to YES will instruct doxygen to hide any\n# special comment blocks from generated source code fragments. Normal C, C++ and\n# Fortran comments will always remain visible.\n# The default value is: YES.\n\nSTRIP_CODE_COMMENTS    = YES\n\n# If the REFERENCED_BY_RELATION tag is set to YES then for each documented\n# function all documented functions referencing it will be listed.\n# The default value is: NO.\n\nREFERENCED_BY_RELATION = NO\n\n# If the REFERENCES_RELATION tag is set to YES then for each documented function\n# all documented entities called/used by that function will be listed.\n# The default value is: NO.\n\nREFERENCES_RELATION    = NO\n\n# If the REFERENCES_LINK_SOURCE tag is set to YES and SOURCE_BROWSER tag is set\n# to YES then the hyperlinks from functions in REFERENCES_RELATION and\n# REFERENCED_BY_RELATION lists will link to the source code. Otherwise they will\n# link to the documentation.\n# The default value is: YES.\n\nREFERENCES_LINK_SOURCE = NO\n\n# If SOURCE_TOOLTIPS is enabled (the default) then hovering a hyperlink in the\n# source code will show a tooltip with additional information such as prototype,\n# brief description and links to the definition and documentation. Since this\n# will make the HTML file larger and loading of large files a bit slower, you\n# can opt to disable this feature.\n# The default value is: YES.\n# This tag requires that the tag SOURCE_BROWSER is set to YES.\n\nSOURCE_TOOLTIPS        = YES\n\n# If the USE_HTAGS tag is set to YES then the references to source code will\n# point to the HTML generated by the htags(1) tool instead of doxygen built-in\n# source browser. The htags tool is part of GNU's global source tagging system\n# (see http://www.gnu.org/software/global/global.html). You will need version\n# 4.8.6 or higher.\n#\n# To use it do the following:\n# - Install the latest version of global\n# - Enable SOURCE_BROWSER and USE_HTAGS in the config file\n# - Make sure the INPUT points to the root of the source tree\n# - Run doxygen as normal\n#\n# Doxygen will invoke htags (and that will in turn invoke gtags), so these\n# tools must be available from the command line (i.e. in the search path).\n#\n# The result: instead of the source browser generated by doxygen, the links to\n# source code will now point to the output of htags.\n# The default value is: NO.\n# This tag requires that the tag SOURCE_BROWSER is set to YES.\n\nUSE_HTAGS              = NO\n\n# If the VERBATIM_HEADERS tag is set the YES then doxygen will generate a\n# verbatim copy of the header file for each class for which an include is\n# specified. Set to NO to disable this.\n# See also: Section \\class.\n# The default value is: YES.\n\nVERBATIM_HEADERS       = YES\n\n# If the CLANG_ASSISTED_PARSING tag is set to YES then doxygen will use the\n# clang parser (see: http://clang.llvm.org/) for more accurate parsing at the\n# cost of reduced performance. This can be particularly helpful with template\n# rich C++ code for which doxygen's built-in parser lacks the necessary type\n# information.\n# Note: The availability of this option depends on whether or not doxygen was\n# generated with the -Duse-libclang=ON option for CMake.\n# The default value is: NO.\n\nCLANG_ASSISTED_PARSING = NO\n\n# If clang assisted parsing is enabled you can provide the compiler with command\n# line options that you would normally use when invoking the compiler. Note that\n# the include paths will already be set by doxygen for the files and directories\n# specified with INPUT and INCLUDE_PATH.\n# This tag requires that the tag CLANG_ASSISTED_PARSING is set to YES.\n\nCLANG_OPTIONS          =\n\n#---------------------------------------------------------------------------\n# Configuration options related to the alphabetical class index\n#---------------------------------------------------------------------------\n\n# If the ALPHABETICAL_INDEX tag is set to YES, an alphabetical index of all\n# compounds will be generated. Enable this if the project contains a lot of\n# classes, structs, unions or interfaces.\n# The default value is: YES.\n\nALPHABETICAL_INDEX     = YES\n\n# The COLS_IN_ALPHA_INDEX tag can be used to specify the number of columns in\n# which the alphabetical index list will be split.\n# Minimum value: 1, maximum value: 20, default value: 5.\n# This tag requires that the tag ALPHABETICAL_INDEX is set to YES.\n\nCOLS_IN_ALPHA_INDEX    = 5\n\n# In case all classes in a project start with a common prefix, all classes will\n# be put under the same header in the alphabetical index. The IGNORE_PREFIX tag\n# can be used to specify a prefix (or a list of prefixes) that should be ignored\n# while generating the index headers.\n# This tag requires that the tag ALPHABETICAL_INDEX is set to YES.\n\nIGNORE_PREFIX          =\n\n#---------------------------------------------------------------------------\n# Configuration options related to the HTML output\n#---------------------------------------------------------------------------\n\n# If the GENERATE_HTML tag is set to YES, doxygen will generate HTML output\n# The default value is: YES.\n\nGENERATE_HTML          = NO\n\n# The HTML_OUTPUT tag is used to specify where the HTML docs will be put. If a\n# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of\n# it.\n# The default directory is: html.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nHTML_OUTPUT            = html\n\n# The HTML_FILE_EXTENSION tag can be used to specify the file extension for each\n# generated HTML page (for example: .htm, .php, .asp).\n# The default value is: .html.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nHTML_FILE_EXTENSION    = .html\n\n# The HTML_HEADER tag can be used to specify a user-defined HTML header file for\n# each generated HTML page. If the tag is left blank doxygen will generate a\n# standard header.\n#\n# To get valid HTML the header file that includes any scripts and style sheets\n# that doxygen needs, which is dependent on the configuration options used (e.g.\n# the setting GENERATE_TREEVIEW). It is highly recommended to start with a\n# default header using\n# doxygen -w html new_header.html new_footer.html new_stylesheet.css\n# YourConfigFile\n# and then modify the file new_header.html. See also section \"Doxygen usage\"\n# for information on how to generate the default header that doxygen normally\n# uses.\n# Note: The header is subject to change so you typically have to regenerate the\n# default header when upgrading to a newer version of doxygen. For a description\n# of the possible markers and block names see the documentation.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nHTML_HEADER            =\n\n# The HTML_FOOTER tag can be used to specify a user-defined HTML footer for each\n# generated HTML page. If the tag is left blank doxygen will generate a standard\n# footer. See HTML_HEADER for more information on how to generate a default\n# footer and what special commands can be used inside the footer. See also\n# section \"Doxygen usage\" for information on how to generate the default footer\n# that doxygen normally uses.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nHTML_FOOTER            =\n\n# The HTML_STYLESHEET tag can be used to specify a user-defined cascading style\n# sheet that is used by each HTML page. It can be used to fine-tune the look of\n# the HTML output. If left blank doxygen will generate a default style sheet.\n# See also section \"Doxygen usage\" for information on how to generate the style\n# sheet that doxygen normally uses.\n# Note: It is recommended to use HTML_EXTRA_STYLESHEET instead of this tag, as\n# it is more robust and this tag (HTML_STYLESHEET) will in the future become\n# obsolete.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nHTML_STYLESHEET        =\n\n# The HTML_EXTRA_STYLESHEET tag can be used to specify additional user-defined\n# cascading style sheets that are included after the standard style sheets\n# created by doxygen. Using this option one can overrule certain style aspects.\n# This is preferred over using HTML_STYLESHEET since it does not replace the\n# standard style sheet and is therefore more robust against future updates.\n# Doxygen will copy the style sheet files to the output directory.\n# Note: The order of the extra style sheet files is of importance (e.g. the last\n# style sheet in the list overrules the setting of the previous ones in the\n# list). For an example see the documentation.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nHTML_EXTRA_STYLESHEET  =\n\n# The HTML_EXTRA_FILES tag can be used to specify one or more extra images or\n# other source files which should be copied to the HTML output directory. Note\n# that these files will be copied to the base HTML output directory. Use the\n# $relpath^ marker in the HTML_HEADER and/or HTML_FOOTER files to load these\n# files. In the HTML_STYLESHEET file, use the file name only. Also note that the\n# files will be copied as-is; there are no commands or markers available.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nHTML_EXTRA_FILES       =\n\n# The HTML_COLORSTYLE_HUE tag controls the color of the HTML output. Doxygen\n# will adjust the colors in the style sheet and background images according to\n# this color. Hue is specified as an angle on a colorwheel, see\n# http://en.wikipedia.org/wiki/Hue for more information. For instance the value\n# 0 represents red, 60 is yellow, 120 is green, 180 is cyan, 240 is blue, 300\n# purple, and 360 is red again.\n# Minimum value: 0, maximum value: 359, default value: 220.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nHTML_COLORSTYLE_HUE    = 220\n\n# The HTML_COLORSTYLE_SAT tag controls the purity (or saturation) of the colors\n# in the HTML output. For a value of 0 the output will use grayscales only. A\n# value of 255 will produce the most vivid colors.\n# Minimum value: 0, maximum value: 255, default value: 100.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nHTML_COLORSTYLE_SAT    = 100\n\n# The HTML_COLORSTYLE_GAMMA tag controls the gamma correction applied to the\n# luminance component of the colors in the HTML output. Values below 100\n# gradually make the output lighter, whereas values above 100 make the output\n# darker. The value divided by 100 is the actual gamma applied, so 80 represents\n# a gamma of 0.8, The value 220 represents a gamma of 2.2, and 100 does not\n# change the gamma.\n# Minimum value: 40, maximum value: 240, default value: 80.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nHTML_COLORSTYLE_GAMMA  = 80\n\n# If the HTML_TIMESTAMP tag is set to YES then the footer of each generated HTML\n# page will contain the date and time when the page was generated. Setting this\n# to YES can help to show when doxygen was last run and thus if the\n# documentation is up to date.\n# The default value is: NO.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nHTML_TIMESTAMP         = NO\n\n# If the HTML_DYNAMIC_SECTIONS tag is set to YES then the generated HTML\n# documentation will contain sections that can be hidden and shown after the\n# page has loaded.\n# The default value is: NO.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nHTML_DYNAMIC_SECTIONS  = NO\n\n# With HTML_INDEX_NUM_ENTRIES one can control the preferred number of entries\n# shown in the various tree structured indices initially; the user can expand\n# and collapse entries dynamically later on. Doxygen will expand the tree to\n# such a level that at most the specified number of entries are visible (unless\n# a fully collapsed tree already exceeds this amount). So setting the number of\n# entries 1 will produce a full collapsed tree by default. 0 is a special value\n# representing an infinite number of entries and will result in a full expanded\n# tree by default.\n# Minimum value: 0, maximum value: 9999, default value: 100.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nHTML_INDEX_NUM_ENTRIES = 100\n\n# If the GENERATE_DOCSET tag is set to YES, additional index files will be\n# generated that can be used as input for Apple's Xcode 3 integrated development\n# environment (see: http://developer.apple.com/tools/xcode/), introduced with\n# OSX 10.5 (Leopard). To create a documentation set, doxygen will generate a\n# Makefile in the HTML output directory. Running make will produce the docset in\n# that directory and running make install will install the docset in\n# ~/Library/Developer/Shared/Documentation/DocSets so that Xcode will find it at\n# startup. See http://developer.apple.com/tools/creatingdocsetswithdoxygen.html\n# for more information.\n# The default value is: NO.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nGENERATE_DOCSET        = NO\n\n# This tag determines the name of the docset feed. A documentation feed provides\n# an umbrella under which multiple documentation sets from a single provider\n# (such as a company or product suite) can be grouped.\n# The default value is: Doxygen generated docs.\n# This tag requires that the tag GENERATE_DOCSET is set to YES.\n\nDOCSET_FEEDNAME        = \"Doxygen generated docs\"\n\n# This tag specifies a string that should uniquely identify the documentation\n# set bundle. This should be a reverse domain-name style string, e.g.\n# com.mycompany.MyDocSet. Doxygen will append .docset to the name.\n# The default value is: org.doxygen.Project.\n# This tag requires that the tag GENERATE_DOCSET is set to YES.\n\nDOCSET_BUNDLE_ID       = org.doxygen.Project\n\n# The DOCSET_PUBLISHER_ID tag specifies a string that should uniquely identify\n# the documentation publisher. This should be a reverse domain-name style\n# string, e.g. com.mycompany.MyDocSet.documentation.\n# The default value is: org.doxygen.Publisher.\n# This tag requires that the tag GENERATE_DOCSET is set to YES.\n\nDOCSET_PUBLISHER_ID    = org.doxygen.Publisher\n\n# The DOCSET_PUBLISHER_NAME tag identifies the documentation publisher.\n# The default value is: Publisher.\n# This tag requires that the tag GENERATE_DOCSET is set to YES.\n\nDOCSET_PUBLISHER_NAME  = Publisher\n\n# If the GENERATE_HTMLHELP tag is set to YES then doxygen generates three\n# additional HTML index files: index.hhp, index.hhc, and index.hhk. The\n# index.hhp is a project file that can be read by Microsoft's HTML Help Workshop\n# (see: http://www.microsoft.com/en-us/download/details.aspx?id=21138) on\n# Windows.\n#\n# The HTML Help Workshop contains a compiler that can convert all HTML output\n# generated by doxygen into a single compiled HTML file (.chm). Compiled HTML\n# files are now used as the Windows 98 help format, and will replace the old\n# Windows help format (.hlp) on all Windows platforms in the future. Compressed\n# HTML files also contain an index, a table of contents, and you can search for\n# words in the documentation. The HTML workshop also contains a viewer for\n# compressed HTML files.\n# The default value is: NO.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nGENERATE_HTMLHELP      = NO\n\n# The CHM_FILE tag can be used to specify the file name of the resulting .chm\n# file. You can add a path in front of the file if the result should not be\n# written to the html output directory.\n# This tag requires that the tag GENERATE_HTMLHELP is set to YES.\n\nCHM_FILE               =\n\n# The HHC_LOCATION tag can be used to specify the location (absolute path\n# including file name) of the HTML help compiler (hhc.exe). If non-empty,\n# doxygen will try to run the HTML help compiler on the generated index.hhp.\n# The file has to be specified with full path.\n# This tag requires that the tag GENERATE_HTMLHELP is set to YES.\n\nHHC_LOCATION           =\n\n# The GENERATE_CHI flag controls if a separate .chi index file is generated\n# (YES) or that it should be included in the master .chm file (NO).\n# The default value is: NO.\n# This tag requires that the tag GENERATE_HTMLHELP is set to YES.\n\nGENERATE_CHI           = NO\n\n# The CHM_INDEX_ENCODING is used to encode HtmlHelp index (hhk), content (hhc)\n# and project file content.\n# This tag requires that the tag GENERATE_HTMLHELP is set to YES.\n\nCHM_INDEX_ENCODING     =\n\n# The BINARY_TOC flag controls whether a binary table of contents is generated\n# (YES) or a normal table of contents (NO) in the .chm file. Furthermore it\n# enables the Previous and Next buttons.\n# The default value is: NO.\n# This tag requires that the tag GENERATE_HTMLHELP is set to YES.\n\nBINARY_TOC             = NO\n\n# The TOC_EXPAND flag can be set to YES to add extra items for group members to\n# the table of contents of the HTML help documentation and to the tree view.\n# The default value is: NO.\n# This tag requires that the tag GENERATE_HTMLHELP is set to YES.\n\nTOC_EXPAND             = NO\n\n# If the GENERATE_QHP tag is set to YES and both QHP_NAMESPACE and\n# QHP_VIRTUAL_FOLDER are set, an additional index file will be generated that\n# can be used as input for Qt's qhelpgenerator to generate a Qt Compressed Help\n# (.qch) of the generated HTML documentation.\n# The default value is: NO.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nGENERATE_QHP           = NO\n\n# If the QHG_LOCATION tag is specified, the QCH_FILE tag can be used to specify\n# the file name of the resulting .qch file. The path specified is relative to\n# the HTML output folder.\n# This tag requires that the tag GENERATE_QHP is set to YES.\n\nQCH_FILE               =\n\n# The QHP_NAMESPACE tag specifies the namespace to use when generating Qt Help\n# Project output. For more information please see Qt Help Project / Namespace\n# (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#namespace).\n# The default value is: org.doxygen.Project.\n# This tag requires that the tag GENERATE_QHP is set to YES.\n\nQHP_NAMESPACE          = org.doxygen.Project\n\n# The QHP_VIRTUAL_FOLDER tag specifies the namespace to use when generating Qt\n# Help Project output. For more information please see Qt Help Project / Virtual\n# Folders (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#virtual-\n# folders).\n# The default value is: doc.\n# This tag requires that the tag GENERATE_QHP is set to YES.\n\nQHP_VIRTUAL_FOLDER     = doc\n\n# If the QHP_CUST_FILTER_NAME tag is set, it specifies the name of a custom\n# filter to add. For more information please see Qt Help Project / Custom\n# Filters (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#custom-\n# filters).\n# This tag requires that the tag GENERATE_QHP is set to YES.\n\nQHP_CUST_FILTER_NAME   =\n\n# The QHP_CUST_FILTER_ATTRS tag specifies the list of the attributes of the\n# custom filter to add. For more information please see Qt Help Project / Custom\n# Filters (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#custom-\n# filters).\n# This tag requires that the tag GENERATE_QHP is set to YES.\n\nQHP_CUST_FILTER_ATTRS  =\n\n# The QHP_SECT_FILTER_ATTRS tag specifies the list of the attributes this\n# project's filter section matches. Qt Help Project / Filter Attributes (see:\n# http://qt-project.org/doc/qt-4.8/qthelpproject.html#filter-attributes).\n# This tag requires that the tag GENERATE_QHP is set to YES.\n\nQHP_SECT_FILTER_ATTRS  =\n\n# The QHG_LOCATION tag can be used to specify the location of Qt's\n# qhelpgenerator. If non-empty doxygen will try to run qhelpgenerator on the\n# generated .qhp file.\n# This tag requires that the tag GENERATE_QHP is set to YES.\n\nQHG_LOCATION           =\n\n# If the GENERATE_ECLIPSEHELP tag is set to YES, additional index files will be\n# generated, together with the HTML files, they form an Eclipse help plugin. To\n# install this plugin and make it available under the help contents menu in\n# Eclipse, the contents of the directory containing the HTML and XML files needs\n# to be copied into the plugins directory of eclipse. The name of the directory\n# within the plugins directory should be the same as the ECLIPSE_DOC_ID value.\n# After copying Eclipse needs to be restarted before the help appears.\n# The default value is: NO.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nGENERATE_ECLIPSEHELP   = NO\n\n# A unique identifier for the Eclipse help plugin. When installing the plugin\n# the directory name containing the HTML and XML files should also have this\n# name. Each documentation set should have its own identifier.\n# The default value is: org.doxygen.Project.\n# This tag requires that the tag GENERATE_ECLIPSEHELP is set to YES.\n\nECLIPSE_DOC_ID         = org.doxygen.Project\n\n# If you want full control over the layout of the generated HTML pages it might\n# be necessary to disable the index and replace it with your own. The\n# DISABLE_INDEX tag can be used to turn on/off the condensed index (tabs) at top\n# of each HTML page. A value of NO enables the index and the value YES disables\n# it. Since the tabs in the index contain the same information as the navigation\n# tree, you can set this option to YES if you also set GENERATE_TREEVIEW to YES.\n# The default value is: NO.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nDISABLE_INDEX          = NO\n\n# The GENERATE_TREEVIEW tag is used to specify whether a tree-like index\n# structure should be generated to display hierarchical information. If the tag\n# value is set to YES, a side panel will be generated containing a tree-like\n# index structure (just like the one that is generated for HTML Help). For this\n# to work a browser that supports JavaScript, DHTML, CSS and frames is required\n# (i.e. any modern browser). Windows users are probably better off using the\n# HTML help feature. Via custom style sheets (see HTML_EXTRA_STYLESHEET) one can\n# further fine-tune the look of the index. As an example, the default style\n# sheet generated by doxygen has an example that shows how to put an image at\n# the root of the tree instead of the PROJECT_NAME. Since the tree basically has\n# the same information as the tab index, you could consider setting\n# DISABLE_INDEX to YES when enabling this option.\n# The default value is: NO.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nGENERATE_TREEVIEW      = NO\n\n# The ENUM_VALUES_PER_LINE tag can be used to set the number of enum values that\n# doxygen will group on one line in the generated HTML documentation.\n#\n# Note that a value of 0 will completely suppress the enum values from appearing\n# in the overview section.\n# Minimum value: 0, maximum value: 20, default value: 4.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nENUM_VALUES_PER_LINE   = 4\n\n# If the treeview is enabled (see GENERATE_TREEVIEW) then this tag can be used\n# to set the initial width (in pixels) of the frame in which the tree is shown.\n# Minimum value: 0, maximum value: 1500, default value: 250.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nTREEVIEW_WIDTH         = 250\n\n# If the EXT_LINKS_IN_WINDOW option is set to YES, doxygen will open links to\n# external symbols imported via tag files in a separate window.\n# The default value is: NO.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nEXT_LINKS_IN_WINDOW    = NO\n\n# Use this tag to change the font size of LaTeX formulas included as images in\n# the HTML documentation. When you change the font size after a successful\n# doxygen run you need to manually remove any form_*.png images from the HTML\n# output directory to force them to be regenerated.\n# Minimum value: 8, maximum value: 50, default value: 10.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nFORMULA_FONTSIZE       = 10\n\n# Use the FORMULA_TRANPARENT tag to determine whether or not the images\n# generated for formulas are transparent PNGs. Transparent PNGs are not\n# supported properly for IE 6.0, but are supported on all modern browsers.\n#\n# Note that when changing this option you need to delete any form_*.png files in\n# the HTML output directory before the changes have effect.\n# The default value is: YES.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nFORMULA_TRANSPARENT    = YES\n\n# Enable the USE_MATHJAX option to render LaTeX formulas using MathJax (see\n# http://www.mathjax.org) which uses client side Javascript for the rendering\n# instead of using pre-rendered bitmaps. Use this if you do not have LaTeX\n# installed or if you want to formulas look prettier in the HTML output. When\n# enabled you may also need to install MathJax separately and configure the path\n# to it using the MATHJAX_RELPATH option.\n# The default value is: NO.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nUSE_MATHJAX            = NO\n\n# When MathJax is enabled you can set the default output format to be used for\n# the MathJax output. See the MathJax site (see:\n# http://docs.mathjax.org/en/latest/output.html) for more details.\n# Possible values are: HTML-CSS (which is slower, but has the best\n# compatibility), NativeMML (i.e. MathML) and SVG.\n# The default value is: HTML-CSS.\n# This tag requires that the tag USE_MATHJAX is set to YES.\n\nMATHJAX_FORMAT         = HTML-CSS\n\n# When MathJax is enabled you need to specify the location relative to the HTML\n# output directory using the MATHJAX_RELPATH option. The destination directory\n# should contain the MathJax.js script. For instance, if the mathjax directory\n# is located at the same level as the HTML output directory, then\n# MATHJAX_RELPATH should be ../mathjax. The default value points to the MathJax\n# Content Delivery Network so you can quickly see the result without installing\n# MathJax. However, it is strongly recommended to install a local copy of\n# MathJax from http://www.mathjax.org before deployment.\n# The default value is: http://cdn.mathjax.org/mathjax/latest.\n# This tag requires that the tag USE_MATHJAX is set to YES.\n\nMATHJAX_RELPATH        = http://cdn.mathjax.org/mathjax/latest\n\n# The MATHJAX_EXTENSIONS tag can be used to specify one or more MathJax\n# extension names that should be enabled during MathJax rendering. For example\n# MATHJAX_EXTENSIONS = TeX/AMSmath TeX/AMSsymbols\n# This tag requires that the tag USE_MATHJAX is set to YES.\n\nMATHJAX_EXTENSIONS     =\n\n# The MATHJAX_CODEFILE tag can be used to specify a file with javascript pieces\n# of code that will be used on startup of the MathJax code. See the MathJax site\n# (see: http://docs.mathjax.org/en/latest/output.html) for more details. For an\n# example see the documentation.\n# This tag requires that the tag USE_MATHJAX is set to YES.\n\nMATHJAX_CODEFILE       =\n\n# When the SEARCHENGINE tag is enabled doxygen will generate a search box for\n# the HTML output. The underlying search engine uses javascript and DHTML and\n# should work on any modern browser. Note that when using HTML help\n# (GENERATE_HTMLHELP), Qt help (GENERATE_QHP), or docsets (GENERATE_DOCSET)\n# there is already a search function so this one should typically be disabled.\n# For large projects the javascript based search engine can be slow, then\n# enabling SERVER_BASED_SEARCH may provide a better solution. It is possible to\n# search using the keyboard; to jump to the search box use <access key> + S\n# (what the <access key> is depends on the OS and browser, but it is typically\n# <CTRL>, <ALT>/<option>, or both). Inside the search box use the <cursor down\n# key> to jump into the search results window, the results can be navigated\n# using the <cursor keys>. Press <Enter> to select an item or <escape> to cancel\n# the search. The filter options can be selected when the cursor is inside the\n# search box by pressing <Shift>+<cursor down>. Also here use the <cursor keys>\n# to select a filter and <Enter> or <escape> to activate or cancel the filter\n# option.\n# The default value is: YES.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nSEARCHENGINE           = YES\n\n# When the SERVER_BASED_SEARCH tag is enabled the search engine will be\n# implemented using a web server instead of a web client using Javascript. There\n# are two flavors of web server based searching depending on the EXTERNAL_SEARCH\n# setting. When disabled, doxygen will generate a PHP script for searching and\n# an index file used by the script. When EXTERNAL_SEARCH is enabled the indexing\n# and searching needs to be provided by external tools. See the section\n# \"External Indexing and Searching\" for details.\n# The default value is: NO.\n# This tag requires that the tag SEARCHENGINE is set to YES.\n\nSERVER_BASED_SEARCH    = NO\n\n# When EXTERNAL_SEARCH tag is enabled doxygen will no longer generate the PHP\n# script for searching. Instead the search results are written to an XML file\n# which needs to be processed by an external indexer. Doxygen will invoke an\n# external search engine pointed to by the SEARCHENGINE_URL option to obtain the\n# search results.\n#\n# Doxygen ships with an example indexer (doxyindexer) and search engine\n# (doxysearch.cgi) which are based on the open source search engine library\n# Xapian (see: http://xapian.org/).\n#\n# See the section \"External Indexing and Searching\" for details.\n# The default value is: NO.\n# This tag requires that the tag SEARCHENGINE is set to YES.\n\nEXTERNAL_SEARCH        = NO\n\n# The SEARCHENGINE_URL should point to a search engine hosted by a web server\n# which will return the search results when EXTERNAL_SEARCH is enabled.\n#\n# Doxygen ships with an example indexer (doxyindexer) and search engine\n# (doxysearch.cgi) which are based on the open source search engine library\n# Xapian (see: http://xapian.org/). See the section \"External Indexing and\n# Searching\" for details.\n# This tag requires that the tag SEARCHENGINE is set to YES.\n\nSEARCHENGINE_URL       =\n\n# When SERVER_BASED_SEARCH and EXTERNAL_SEARCH are both enabled the unindexed\n# search data is written to a file for indexing by an external tool. With the\n# SEARCHDATA_FILE tag the name of this file can be specified.\n# The default file is: searchdata.xml.\n# This tag requires that the tag SEARCHENGINE is set to YES.\n\nSEARCHDATA_FILE        = searchdata.xml\n\n# When SERVER_BASED_SEARCH and EXTERNAL_SEARCH are both enabled the\n# EXTERNAL_SEARCH_ID tag can be used as an identifier for the project. This is\n# useful in combination with EXTRA_SEARCH_MAPPINGS to search through multiple\n# projects and redirect the results back to the right project.\n# This tag requires that the tag SEARCHENGINE is set to YES.\n\nEXTERNAL_SEARCH_ID     =\n\n# The EXTRA_SEARCH_MAPPINGS tag can be used to enable searching through doxygen\n# projects other than the one defined by this configuration file, but that are\n# all added to the same external search index. Each project needs to have a\n# unique id set via EXTERNAL_SEARCH_ID. The search mapping then maps the id of\n# to a relative location where the documentation can be found. The format is:\n# EXTRA_SEARCH_MAPPINGS = tagname1=loc1 tagname2=loc2 ...\n# This tag requires that the tag SEARCHENGINE is set to YES.\n\nEXTRA_SEARCH_MAPPINGS  =\n\n#---------------------------------------------------------------------------\n# Configuration options related to the LaTeX output\n#---------------------------------------------------------------------------\n\n# If the GENERATE_LATEX tag is set to YES, doxygen will generate LaTeX output.\n# The default value is: YES.\n\nGENERATE_LATEX         = NO\n\n# The LATEX_OUTPUT tag is used to specify where the LaTeX docs will be put. If a\n# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of\n# it.\n# The default directory is: latex.\n# This tag requires that the tag GENERATE_LATEX is set to YES.\n\nLATEX_OUTPUT           = latex\n\n# The LATEX_CMD_NAME tag can be used to specify the LaTeX command name to be\n# invoked.\n#\n# Note that when enabling USE_PDFLATEX this option is only used for generating\n# bitmaps for formulas in the HTML output, but not in the Makefile that is\n# written to the output directory.\n# The default file is: latex.\n# This tag requires that the tag GENERATE_LATEX is set to YES.\n\nLATEX_CMD_NAME         = latex\n\n# The MAKEINDEX_CMD_NAME tag can be used to specify the command name to generate\n# index for LaTeX.\n# The default file is: makeindex.\n# This tag requires that the tag GENERATE_LATEX is set to YES.\n\nMAKEINDEX_CMD_NAME     = makeindex\n\n# If the COMPACT_LATEX tag is set to YES, doxygen generates more compact LaTeX\n# documents. This may be useful for small projects and may help to save some\n# trees in general.\n# The default value is: NO.\n# This tag requires that the tag GENERATE_LATEX is set to YES.\n\nCOMPACT_LATEX          = NO\n\n# The PAPER_TYPE tag can be used to set the paper type that is used by the\n# printer.\n# Possible values are: a4 (210 x 297 mm), letter (8.5 x 11 inches), legal (8.5 x\n# 14 inches) and executive (7.25 x 10.5 inches).\n# The default value is: a4.\n# This tag requires that the tag GENERATE_LATEX is set to YES.\n\nPAPER_TYPE             = a4\n\n# The EXTRA_PACKAGES tag can be used to specify one or more LaTeX package names\n# that should be included in the LaTeX output. The package can be specified just\n# by its name or with the correct syntax as to be used with the LaTeX\n# \\usepackage command. To get the times font for instance you can specify :\n# EXTRA_PACKAGES=times or EXTRA_PACKAGES={times}\n# To use the option intlimits with the amsmath package you can specify:\n# EXTRA_PACKAGES=[intlimits]{amsmath}\n# If left blank no extra packages will be included.\n# This tag requires that the tag GENERATE_LATEX is set to YES.\n\nEXTRA_PACKAGES         =\n\n# The LATEX_HEADER tag can be used to specify a personal LaTeX header for the\n# generated LaTeX document. The header should contain everything until the first\n# chapter. If it is left blank doxygen will generate a standard header. See\n# section \"Doxygen usage\" for information on how to let doxygen write the\n# default header to a separate file.\n#\n# Note: Only use a user-defined header if you know what you are doing! The\n# following commands have a special meaning inside the header: $title,\n# $datetime, $date, $doxygenversion, $projectname, $projectnumber,\n# $projectbrief, $projectlogo. Doxygen will replace $title with the empty\n# string, for the replacement values of the other commands the user is referred\n# to HTML_HEADER.\n# This tag requires that the tag GENERATE_LATEX is set to YES.\n\nLATEX_HEADER           =\n\n# The LATEX_FOOTER tag can be used to specify a personal LaTeX footer for the\n# generated LaTeX document. The footer should contain everything after the last\n# chapter. If it is left blank doxygen will generate a standard footer. See\n# LATEX_HEADER for more information on how to generate a default footer and what\n# special commands can be used inside the footer.\n#\n# Note: Only use a user-defined footer if you know what you are doing!\n# This tag requires that the tag GENERATE_LATEX is set to YES.\n\nLATEX_FOOTER           =\n\n# The LATEX_EXTRA_STYLESHEET tag can be used to specify additional user-defined\n# LaTeX style sheets that are included after the standard style sheets created\n# by doxygen. Using this option one can overrule certain style aspects. Doxygen\n# will copy the style sheet files to the output directory.\n# Note: The order of the extra style sheet files is of importance (e.g. the last\n# style sheet in the list overrules the setting of the previous ones in the\n# list).\n# This tag requires that the tag GENERATE_LATEX is set to YES.\n\nLATEX_EXTRA_STYLESHEET =\n\n# The LATEX_EXTRA_FILES tag can be used to specify one or more extra images or\n# other source files which should be copied to the LATEX_OUTPUT output\n# directory. Note that the files will be copied as-is; there are no commands or\n# markers available.\n# This tag requires that the tag GENERATE_LATEX is set to YES.\n\nLATEX_EXTRA_FILES      =\n\n# If the PDF_HYPERLINKS tag is set to YES, the LaTeX that is generated is\n# prepared for conversion to PDF (using ps2pdf or pdflatex). The PDF file will\n# contain links (just like the HTML output) instead of page references. This\n# makes the output suitable for online browsing using a PDF viewer.\n# The default value is: YES.\n# This tag requires that the tag GENERATE_LATEX is set to YES.\n\nPDF_HYPERLINKS         = YES\n\n# If the USE_PDFLATEX tag is set to YES, doxygen will use pdflatex to generate\n# the PDF file directly from the LaTeX files. Set this option to YES, to get a\n# higher quality PDF documentation.\n# The default value is: YES.\n# This tag requires that the tag GENERATE_LATEX is set to YES.\n\nUSE_PDFLATEX           = YES\n\n# If the LATEX_BATCHMODE tag is set to YES, doxygen will add the \\batchmode\n# command to the generated LaTeX files. This will instruct LaTeX to keep running\n# if errors occur, instead of asking the user for help. This option is also used\n# when generating formulas in HTML.\n# The default value is: NO.\n# This tag requires that the tag GENERATE_LATEX is set to YES.\n\nLATEX_BATCHMODE        = NO\n\n# If the LATEX_HIDE_INDICES tag is set to YES then doxygen will not include the\n# index chapters (such as File Index, Compound Index, etc.) in the output.\n# The default value is: NO.\n# This tag requires that the tag GENERATE_LATEX is set to YES.\n\nLATEX_HIDE_INDICES     = NO\n\n# If the LATEX_SOURCE_CODE tag is set to YES then doxygen will include source\n# code with syntax highlighting in the LaTeX output.\n#\n# Note that which sources are shown also depends on other settings such as\n# SOURCE_BROWSER.\n# The default value is: NO.\n# This tag requires that the tag GENERATE_LATEX is set to YES.\n\nLATEX_SOURCE_CODE      = NO\n\n# The LATEX_BIB_STYLE tag can be used to specify the style to use for the\n# bibliography, e.g. plainnat, or ieeetr. See\n# http://en.wikipedia.org/wiki/BibTeX and \\cite for more info.\n# The default value is: plain.\n# This tag requires that the tag GENERATE_LATEX is set to YES.\n\nLATEX_BIB_STYLE        = plain\n\n# If the LATEX_TIMESTAMP tag is set to YES then the footer of each generated\n# page will contain the date and time when the page was generated. Setting this\n# to NO can help when comparing the output of multiple runs.\n# The default value is: NO.\n# This tag requires that the tag GENERATE_LATEX is set to YES.\n\nLATEX_TIMESTAMP        = NO\n\n#---------------------------------------------------------------------------\n# Configuration options related to the RTF output\n#---------------------------------------------------------------------------\n\n# If the GENERATE_RTF tag is set to YES, doxygen will generate RTF output. The\n# RTF output is optimized for Word 97 and may not look too pretty with other RTF\n# readers/editors.\n# The default value is: NO.\n\nGENERATE_RTF           = NO\n\n# The RTF_OUTPUT tag is used to specify where the RTF docs will be put. If a\n# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of\n# it.\n# The default directory is: rtf.\n# This tag requires that the tag GENERATE_RTF is set to YES.\n\nRTF_OUTPUT             = rtf\n\n# If the COMPACT_RTF tag is set to YES, doxygen generates more compact RTF\n# documents. This may be useful for small projects and may help to save some\n# trees in general.\n# The default value is: NO.\n# This tag requires that the tag GENERATE_RTF is set to YES.\n\nCOMPACT_RTF            = NO\n\n# If the RTF_HYPERLINKS tag is set to YES, the RTF that is generated will\n# contain hyperlink fields. The RTF file will contain links (just like the HTML\n# output) instead of page references. This makes the output suitable for online\n# browsing using Word or some other Word compatible readers that support those\n# fields.\n#\n# Note: WordPad (write) and others do not support links.\n# The default value is: NO.\n# This tag requires that the tag GENERATE_RTF is set to YES.\n\nRTF_HYPERLINKS         = NO\n\n# Load stylesheet definitions from file. Syntax is similar to doxygen's config\n# file, i.e. a series of assignments. You only have to provide replacements,\n# missing definitions are set to their default value.\n#\n# See also section \"Doxygen usage\" for information on how to generate the\n# default style sheet that doxygen normally uses.\n# This tag requires that the tag GENERATE_RTF is set to YES.\n\nRTF_STYLESHEET_FILE    =\n\n# Set optional variables used in the generation of an RTF document. Syntax is\n# similar to doxygen's config file. A template extensions file can be generated\n# using doxygen -e rtf extensionFile.\n# This tag requires that the tag GENERATE_RTF is set to YES.\n\nRTF_EXTENSIONS_FILE    =\n\n# If the RTF_SOURCE_CODE tag is set to YES then doxygen will include source code\n# with syntax highlighting in the RTF output.\n#\n# Note that which sources are shown also depends on other settings such as\n# SOURCE_BROWSER.\n# The default value is: NO.\n# This tag requires that the tag GENERATE_RTF is set to YES.\n\nRTF_SOURCE_CODE        = NO\n\n#---------------------------------------------------------------------------\n# Configuration options related to the man page output\n#---------------------------------------------------------------------------\n\n# If the GENERATE_MAN tag is set to YES, doxygen will generate man pages for\n# classes and files.\n# The default value is: NO.\n\nGENERATE_MAN           = NO\n\n# The MAN_OUTPUT tag is used to specify where the man pages will be put. If a\n# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of\n# it. A directory man3 will be created inside the directory specified by\n# MAN_OUTPUT.\n# The default directory is: man.\n# This tag requires that the tag GENERATE_MAN is set to YES.\n\nMAN_OUTPUT             = man\n\n# The MAN_EXTENSION tag determines the extension that is added to the generated\n# man pages. In case the manual section does not start with a number, the number\n# 3 is prepended. The dot (.) at the beginning of the MAN_EXTENSION tag is\n# optional.\n# The default value is: .3.\n# This tag requires that the tag GENERATE_MAN is set to YES.\n\nMAN_EXTENSION          = .3\n\n# The MAN_SUBDIR tag determines the name of the directory created within\n# MAN_OUTPUT in which the man pages are placed. If defaults to man followed by\n# MAN_EXTENSION with the initial . removed.\n# This tag requires that the tag GENERATE_MAN is set to YES.\n\nMAN_SUBDIR             =\n\n# If the MAN_LINKS tag is set to YES and doxygen generates man output, then it\n# will generate one additional man file for each entity documented in the real\n# man page(s). These additional files only source the real man page, but without\n# them the man command would be unable to find the correct page.\n# The default value is: NO.\n# This tag requires that the tag GENERATE_MAN is set to YES.\n\nMAN_LINKS              = NO\n\n#---------------------------------------------------------------------------\n# Configuration options related to the XML output\n#---------------------------------------------------------------------------\n\n# If the GENERATE_XML tag is set to YES, doxygen will generate an XML file that\n# captures the structure of the code including all documentation.\n# The default value is: NO.\n\nGENERATE_XML           = YES\n\n# The XML_OUTPUT tag is used to specify where the XML pages will be put. If a\n# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of\n# it.\n# The default directory is: xml.\n# This tag requires that the tag GENERATE_XML is set to YES.\n\nXML_OUTPUT             = xml-c\n\n# If the XML_PROGRAMLISTING tag is set to YES, doxygen will dump the program\n# listings (including syntax highlighting and cross-referencing information) to\n# the XML output. Note that enabling this will significantly increase the size\n# of the XML output.\n# The default value is: YES.\n# This tag requires that the tag GENERATE_XML is set to YES.\n\nXML_PROGRAMLISTING     = YES\n\n#---------------------------------------------------------------------------\n# Configuration options related to the DOCBOOK output\n#---------------------------------------------------------------------------\n\n# If the GENERATE_DOCBOOK tag is set to YES, doxygen will generate Docbook files\n# that can be used to generate PDF.\n# The default value is: NO.\n\nGENERATE_DOCBOOK       = NO\n\n# The DOCBOOK_OUTPUT tag is used to specify where the Docbook pages will be put.\n# If a relative path is entered the value of OUTPUT_DIRECTORY will be put in\n# front of it.\n# The default directory is: docbook.\n# This tag requires that the tag GENERATE_DOCBOOK is set to YES.\n\nDOCBOOK_OUTPUT         = docbook\n\n# If the DOCBOOK_PROGRAMLISTING tag is set to YES, doxygen will include the\n# program listings (including syntax highlighting and cross-referencing\n# information) to the DOCBOOK output. Note that enabling this will significantly\n# increase the size of the DOCBOOK output.\n# The default value is: NO.\n# This tag requires that the tag GENERATE_DOCBOOK is set to YES.\n\nDOCBOOK_PROGRAMLISTING = NO\n\n#---------------------------------------------------------------------------\n# Configuration options for the AutoGen Definitions output\n#---------------------------------------------------------------------------\n\n# If the GENERATE_AUTOGEN_DEF tag is set to YES, doxygen will generate an\n# AutoGen Definitions (see http://autogen.sf.net) file that captures the\n# structure of the code including all documentation. Note that this feature is\n# still experimental and incomplete at the moment.\n# The default value is: NO.\n\nGENERATE_AUTOGEN_DEF   = NO\n\n#---------------------------------------------------------------------------\n# Configuration options related to the Perl module output\n#---------------------------------------------------------------------------\n\n# If the GENERATE_PERLMOD tag is set to YES, doxygen will generate a Perl module\n# file that captures the structure of the code including all documentation.\n#\n# Note that this feature is still experimental and incomplete at the moment.\n# The default value is: NO.\n\nGENERATE_PERLMOD       = NO\n\n# If the PERLMOD_LATEX tag is set to YES, doxygen will generate the necessary\n# Makefile rules, Perl scripts and LaTeX code to be able to generate PDF and DVI\n# output from the Perl module output.\n# The default value is: NO.\n# This tag requires that the tag GENERATE_PERLMOD is set to YES.\n\nPERLMOD_LATEX          = NO\n\n# If the PERLMOD_PRETTY tag is set to YES, the Perl module output will be nicely\n# formatted so it can be parsed by a human reader. This is useful if you want to\n# understand what is going on. On the other hand, if this tag is set to NO, the\n# size of the Perl module output will be much smaller and Perl will parse it\n# just the same.\n# The default value is: YES.\n# This tag requires that the tag GENERATE_PERLMOD is set to YES.\n\nPERLMOD_PRETTY         = YES\n\n# The names of the make variables in the generated doxyrules.make file are\n# prefixed with the string contained in PERLMOD_MAKEVAR_PREFIX. This is useful\n# so different doxyrules.make files included by the same Makefile don't\n# overwrite each other's variables.\n# This tag requires that the tag GENERATE_PERLMOD is set to YES.\n\nPERLMOD_MAKEVAR_PREFIX =\n\n#---------------------------------------------------------------------------\n# Configuration options related to the preprocessor\n#---------------------------------------------------------------------------\n\n# If the ENABLE_PREPROCESSING tag is set to YES, doxygen will evaluate all\n# C-preprocessor directives found in the sources and include files.\n# The default value is: YES.\n\nENABLE_PREPROCESSING   = YES\n\n# If the MACRO_EXPANSION tag is set to YES, doxygen will expand all macro names\n# in the source code. If set to NO, only conditional compilation will be\n# performed. Macro expansion can be done in a controlled way by setting\n# EXPAND_ONLY_PREDEF to YES.\n# The default value is: NO.\n# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.\n\nMACRO_EXPANSION        = YES\n\n# If the EXPAND_ONLY_PREDEF and MACRO_EXPANSION tags are both set to YES then\n# the macro expansion is limited to the macros specified with the PREDEFINED and\n# EXPAND_AS_DEFINED tags.\n# The default value is: NO.\n# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.\n\nEXPAND_ONLY_PREDEF     = NO\n\n# If the SEARCH_INCLUDES tag is set to YES, the include files in the\n# INCLUDE_PATH will be searched if a #include is found.\n# The default value is: YES.\n# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.\n\nSEARCH_INCLUDES        = YES\n\n# The INCLUDE_PATH tag can be used to specify one or more directories that\n# contain include files that are not input files but should be processed by the\n# preprocessor.\n# This tag requires that the tag SEARCH_INCLUDES is set to YES.\n\nINCLUDE_PATH           =\n\n# You can use the INCLUDE_FILE_PATTERNS tag to specify one or more wildcard\n# patterns (like *.h and *.hpp) to filter out the header-files in the\n# directories. If left blank, the patterns specified with FILE_PATTERNS will be\n# used.\n# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.\n\nINCLUDE_FILE_PATTERNS  =\n\n# The PREDEFINED tag can be used to specify one or more macro names that are\n# defined before the preprocessor is started (similar to the -D option of e.g.\n# gcc). The argument of the tag is a list of macros of the form: name or\n# name=definition (no spaces). If the definition and the \"=\" are omitted, \"=1\"\n# is assumed. To prevent a macro definition from being undefined via #undef or\n# recursively expanded use the := operator instead of the = operator.\n# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.\n\nPREDEFINED             = SWIG\n\n# If the MACRO_EXPANSION and EXPAND_ONLY_PREDEF tags are set to YES then this\n# tag can be used to specify a list of macro names that should be expanded. The\n# macro definition that is found in the sources will be used. Use the PREDEFINED\n# tag if you want to use a different macro definition that overrules the\n# definition found in the source code.\n# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.\n\nEXPAND_AS_DEFINED      =\n\n# If the SKIP_FUNCTION_MACROS tag is set to YES then doxygen's preprocessor will\n# remove all references to function-like macros that are alone on a line, have\n# an all uppercase name, and do not end with a semicolon. Such function macros\n# are typically used for boiler-plate code, and will confuse the parser if not\n# removed.\n# The default value is: YES.\n# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.\n\nSKIP_FUNCTION_MACROS   = YES\n\n#---------------------------------------------------------------------------\n# Configuration options related to external references\n#---------------------------------------------------------------------------\n\n# The TAGFILES tag can be used to specify one or more tag files. For each tag\n# file the location of the external documentation should be added. The format of\n# a tag file without this location is as follows:\n# TAGFILES = file1 file2 ...\n# Adding location for the tag files is done as follows:\n# TAGFILES = file1=loc1 \"file2 = loc2\" ...\n# where loc1 and loc2 can be relative or absolute paths or URLs. See the\n# section \"Linking to external documentation\" for more information about the use\n# of tag files.\n# Note: Each tag file must have a unique name (where the name does NOT include\n# the path). If a tag file is not located in the directory in which doxygen is\n# run, you must also specify the path to the tagfile here.\n\nTAGFILES               =\n\n# When a file name is specified after GENERATE_TAGFILE, doxygen will create a\n# tag file that is based on the input files it reads. See section \"Linking to\n# external documentation\" for more information about the usage of tag files.\n\nGENERATE_TAGFILE       =\n\n# If the ALLEXTERNALS tag is set to YES, all external class will be listed in\n# the class index. If set to NO, only the inherited external classes will be\n# listed.\n# The default value is: NO.\n\nALLEXTERNALS           = NO\n\n# If the EXTERNAL_GROUPS tag is set to YES, all external groups will be listed\n# in the modules index. If set to NO, only the current project's groups will be\n# listed.\n# The default value is: YES.\n\nEXTERNAL_GROUPS        = YES\n\n# If the EXTERNAL_PAGES tag is set to YES, all external pages will be listed in\n# the related pages index. If set to NO, only the current project's pages will\n# be listed.\n# The default value is: YES.\n\nEXTERNAL_PAGES         = YES\n\n# The PERL_PATH should be the absolute path and name of the perl script\n# interpreter (i.e. the result of 'which perl').\n# The default file (with absolute path) is: /usr/bin/perl.\n\nPERL_PATH              = /usr/bin/perl\n\n#---------------------------------------------------------------------------\n# Configuration options related to the dot tool\n#---------------------------------------------------------------------------\n\n# If the CLASS_DIAGRAMS tag is set to YES, doxygen will generate a class diagram\n# (in HTML and LaTeX) for classes with base or super classes. Setting the tag to\n# NO turns the diagrams off. Note that this option also works with HAVE_DOT\n# disabled, but it is recommended to install and use dot, since it yields more\n# powerful graphs.\n# The default value is: YES.\n\nCLASS_DIAGRAMS         = YES\n\n# You can define message sequence charts within doxygen comments using the \\msc\n# command. Doxygen will then run the mscgen tool (see:\n# http://www.mcternan.me.uk/mscgen/)) to produce the chart and insert it in the\n# documentation. The MSCGEN_PATH tag allows you to specify the directory where\n# the mscgen tool resides. If left empty the tool is assumed to be found in the\n# default search path.\n\nMSCGEN_PATH            =\n\n# You can include diagrams made with dia in doxygen documentation. Doxygen will\n# then run dia to produce the diagram and insert it in the documentation. The\n# DIA_PATH tag allows you to specify the directory where the dia binary resides.\n# If left empty dia is assumed to be found in the default search path.\n\nDIA_PATH               =\n\n# If set to YES the inheritance and collaboration graphs will hide inheritance\n# and usage relations if the target is undocumented or is not a class.\n# The default value is: YES.\n\nHIDE_UNDOC_RELATIONS   = YES\n\n# If you set the HAVE_DOT tag to YES then doxygen will assume the dot tool is\n# available from the path. This tool is part of Graphviz (see:\n# http://www.graphviz.org/), a graph visualization toolkit from AT&T and Lucent\n# Bell Labs. The other options in this section have no effect if this option is\n# set to NO\n# The default value is: YES.\n\nHAVE_DOT               = YES\n\n# The DOT_NUM_THREADS specifies the number of dot invocations doxygen is allowed\n# to run in parallel. When set to 0 doxygen will base this on the number of\n# processors available in the system. You can set it explicitly to a value\n# larger than 0 to get control over the balance between CPU load and processing\n# speed.\n# Minimum value: 0, maximum value: 32, default value: 0.\n# This tag requires that the tag HAVE_DOT is set to YES.\n\nDOT_NUM_THREADS        = 0\n\n# When you want a differently looking font in the dot files that doxygen\n# generates you can specify the font name using DOT_FONTNAME. You need to make\n# sure dot is able to find the font, which can be done by putting it in a\n# standard location or by setting the DOTFONTPATH environment variable or by\n# setting DOT_FONTPATH to the directory containing the font.\n# The default value is: Helvetica.\n# This tag requires that the tag HAVE_DOT is set to YES.\n\nDOT_FONTNAME           = Helvetica\n\n# The DOT_FONTSIZE tag can be used to set the size (in points) of the font of\n# dot graphs.\n# Minimum value: 4, maximum value: 24, default value: 10.\n# This tag requires that the tag HAVE_DOT is set to YES.\n\nDOT_FONTSIZE           = 10\n\n# By default doxygen will tell dot to use the default font as specified with\n# DOT_FONTNAME. If you specify a different font using DOT_FONTNAME you can set\n# the path where dot can find it using this tag.\n# This tag requires that the tag HAVE_DOT is set to YES.\n\nDOT_FONTPATH           =\n\n# If the CLASS_GRAPH tag is set to YES then doxygen will generate a graph for\n# each documented class showing the direct and indirect inheritance relations.\n# Setting this tag to YES will force the CLASS_DIAGRAMS tag to NO.\n# The default value is: YES.\n# This tag requires that the tag HAVE_DOT is set to YES.\n\nCLASS_GRAPH            = YES\n\n# If the COLLABORATION_GRAPH tag is set to YES then doxygen will generate a\n# graph for each documented class showing the direct and indirect implementation\n# dependencies (inheritance, containment, and class references variables) of the\n# class with other documented classes.\n# The default value is: YES.\n# This tag requires that the tag HAVE_DOT is set to YES.\n\nCOLLABORATION_GRAPH    = YES\n\n# If the GROUP_GRAPHS tag is set to YES then doxygen will generate a graph for\n# groups, showing the direct groups dependencies.\n# The default value is: YES.\n# This tag requires that the tag HAVE_DOT is set to YES.\n\nGROUP_GRAPHS           = YES\n\n# If the UML_LOOK tag is set to YES, doxygen will generate inheritance and\n# collaboration diagrams in a style similar to the OMG's Unified Modeling\n# Language.\n# The default value is: NO.\n# This tag requires that the tag HAVE_DOT is set to YES.\n\nUML_LOOK               = NO\n\n# If the UML_LOOK tag is enabled, the fields and methods are shown inside the\n# class node. If there are many fields or methods and many nodes the graph may\n# become too big to be useful. The UML_LIMIT_NUM_FIELDS threshold limits the\n# number of items for each type to make the size more manageable. Set this to 0\n# for no limit. Note that the threshold may be exceeded by 50% before the limit\n# is enforced. So when you set the threshold to 10, up to 15 fields may appear,\n# but if the number exceeds 15, the total amount of fields shown is limited to\n# 10.\n# Minimum value: 0, maximum value: 100, default value: 10.\n# This tag requires that the tag HAVE_DOT is set to YES.\n\nUML_LIMIT_NUM_FIELDS   = 10\n\n# If the TEMPLATE_RELATIONS tag is set to YES then the inheritance and\n# collaboration graphs will show the relations between templates and their\n# instances.\n# The default value is: NO.\n# This tag requires that the tag HAVE_DOT is set to YES.\n\nTEMPLATE_RELATIONS     = NO\n\n# If the INCLUDE_GRAPH, ENABLE_PREPROCESSING and SEARCH_INCLUDES tags are set to\n# YES then doxygen will generate a graph for each documented file showing the\n# direct and indirect include dependencies of the file with other documented\n# files.\n# The default value is: YES.\n# This tag requires that the tag HAVE_DOT is set to YES.\n\nINCLUDE_GRAPH          = YES\n\n# If the INCLUDED_BY_GRAPH, ENABLE_PREPROCESSING and SEARCH_INCLUDES tags are\n# set to YES then doxygen will generate a graph for each documented file showing\n# the direct and indirect include dependencies of the file with other documented\n# files.\n# The default value is: YES.\n# This tag requires that the tag HAVE_DOT is set to YES.\n\nINCLUDED_BY_GRAPH      = YES\n\n# If the CALL_GRAPH tag is set to YES then doxygen will generate a call\n# dependency graph for every global function or class method.\n#\n# Note that enabling this option will significantly increase the time of a run.\n# So in most cases it will be better to enable call graphs for selected\n# functions only using the \\callgraph command. Disabling a call graph can be\n# accomplished by means of the command \\hidecallgraph.\n# The default value is: NO.\n# This tag requires that the tag HAVE_DOT is set to YES.\n\nCALL_GRAPH             = NO\n\n# If the CALLER_GRAPH tag is set to YES then doxygen will generate a caller\n# dependency graph for every global function or class method.\n#\n# Note that enabling this option will significantly increase the time of a run.\n# So in most cases it will be better to enable caller graphs for selected\n# functions only using the \\callergraph command. Disabling a caller graph can be\n# accomplished by means of the command \\hidecallergraph.\n# The default value is: NO.\n# This tag requires that the tag HAVE_DOT is set to YES.\n\nCALLER_GRAPH           = NO\n\n# If the GRAPHICAL_HIERARCHY tag is set to YES then doxygen will graphical\n# hierarchy of all classes instead of a textual one.\n# The default value is: YES.\n# This tag requires that the tag HAVE_DOT is set to YES.\n\nGRAPHICAL_HIERARCHY    = YES\n\n# If the DIRECTORY_GRAPH tag is set to YES then doxygen will show the\n# dependencies a directory has on other directories in a graphical way. The\n# dependency relations are determined by the #include relations between the\n# files in the directories.\n# The default value is: YES.\n# This tag requires that the tag HAVE_DOT is set to YES.\n\nDIRECTORY_GRAPH        = YES\n\n# The DOT_IMAGE_FORMAT tag can be used to set the image format of the images\n# generated by dot. For an explanation of the image formats see the section\n# output formats in the documentation of the dot tool (Graphviz (see:\n# http://www.graphviz.org/)).\n# Note: If you choose svg you need to set HTML_FILE_EXTENSION to xhtml in order\n# to make the SVG files visible in IE 9+ (other browsers do not have this\n# requirement).\n# Possible values are: png, png:cairo, png:cairo:cairo, png:cairo:gd, png:gd,\n# png:gd:gd, jpg, jpg:cairo, jpg:cairo:gd, jpg:gd, jpg:gd:gd, gif, gif:cairo,\n# gif:cairo:gd, gif:gd, gif:gd:gd, svg, png:gd, png:gd:gd, png:cairo,\n# png:cairo:gd, png:cairo:cairo, png:cairo:gdiplus, png:gdiplus and\n# png:gdiplus:gdiplus.\n# The default value is: png.\n# This tag requires that the tag HAVE_DOT is set to YES.\n\nDOT_IMAGE_FORMAT       = png\n\n# If DOT_IMAGE_FORMAT is set to svg, then this option can be set to YES to\n# enable generation of interactive SVG images that allow zooming and panning.\n#\n# Note that this requires a modern browser other than Internet Explorer. Tested\n# and working are Firefox, Chrome, Safari, and Opera.\n# Note: For IE 9+ you need to set HTML_FILE_EXTENSION to xhtml in order to make\n# the SVG files visible. Older versions of IE do not have SVG support.\n# The default value is: NO.\n# This tag requires that the tag HAVE_DOT is set to YES.\n\nINTERACTIVE_SVG        = NO\n\n# The DOT_PATH tag can be used to specify the path where the dot tool can be\n# found. If left blank, it is assumed the dot tool can be found in the path.\n# This tag requires that the tag HAVE_DOT is set to YES.\n\nDOT_PATH               =\n\n# The DOTFILE_DIRS tag can be used to specify one or more directories that\n# contain dot files that are included in the documentation (see the \\dotfile\n# command).\n# This tag requires that the tag HAVE_DOT is set to YES.\n\nDOTFILE_DIRS           =\n\n# The MSCFILE_DIRS tag can be used to specify one or more directories that\n# contain msc files that are included in the documentation (see the \\mscfile\n# command).\n\nMSCFILE_DIRS           =\n\n# The DIAFILE_DIRS tag can be used to specify one or more directories that\n# contain dia files that are included in the documentation (see the \\diafile\n# command).\n\nDIAFILE_DIRS           =\n\n# When using plantuml, the PLANTUML_JAR_PATH tag should be used to specify the\n# path where java can find the plantuml.jar file. If left blank, it is assumed\n# PlantUML is not used or called during a preprocessing step. Doxygen will\n# generate a warning when it encounters a \\startuml command in this case and\n# will not generate output for the diagram.\n\nPLANTUML_JAR_PATH      =\n\n# When using plantuml, the PLANTUML_CFG_FILE tag can be used to specify a\n# configuration file for plantuml.\n\nPLANTUML_CFG_FILE      =\n\n# When using plantuml, the specified paths are searched for files specified by\n# the !include statement in a plantuml block.\n\nPLANTUML_INCLUDE_PATH  =\n\n# The DOT_GRAPH_MAX_NODES tag can be used to set the maximum number of nodes\n# that will be shown in the graph. If the number of nodes in a graph becomes\n# larger than this value, doxygen will truncate the graph, which is visualized\n# by representing a node as a red box. Note that doxygen if the number of direct\n# children of the root node in a graph is already larger than\n# DOT_GRAPH_MAX_NODES then the graph will not be shown at all. Also note that\n# the size of a graph can be further restricted by MAX_DOT_GRAPH_DEPTH.\n# Minimum value: 0, maximum value: 10000, default value: 50.\n# This tag requires that the tag HAVE_DOT is set to YES.\n\nDOT_GRAPH_MAX_NODES    = 50\n\n# The MAX_DOT_GRAPH_DEPTH tag can be used to set the maximum depth of the graphs\n# generated by dot. A depth value of 3 means that only nodes reachable from the\n# root by following a path via at most 3 edges will be shown. Nodes that lay\n# further from the root node will be omitted. Note that setting this option to 1\n# or 2 may greatly reduce the computation time needed for large code bases. Also\n# note that the size of a graph can be further restricted by\n# DOT_GRAPH_MAX_NODES. Using a depth of 0 means no depth restriction.\n# Minimum value: 0, maximum value: 1000, default value: 0.\n# This tag requires that the tag HAVE_DOT is set to YES.\n\nMAX_DOT_GRAPH_DEPTH    = 0\n\n# Set the DOT_TRANSPARENT tag to YES to generate images with a transparent\n# background. This is disabled by default, because dot on Windows does not seem\n# to support this out of the box.\n#\n# Warning: Depending on the platform used, enabling this option may lead to\n# badly anti-aliased labels on the edges of a graph (i.e. they become hard to\n# read).\n# The default value is: NO.\n# This tag requires that the tag HAVE_DOT is set to YES.\n\nDOT_TRANSPARENT        = NO\n\n# Set the DOT_MULTI_TARGETS tag to YES to allow dot to generate multiple output\n# files in one run (i.e. multiple -o and -T options on the command line). This\n# makes dot run faster, but since only newer versions of dot (>1.8.10) support\n# this, this feature is disabled by default.\n# The default value is: NO.\n# This tag requires that the tag HAVE_DOT is set to YES.\n\nDOT_MULTI_TARGETS      = NO\n\n# If the GENERATE_LEGEND tag is set to YES doxygen will generate a legend page\n# explaining the meaning of the various boxes and arrows in the dot generated\n# graphs.\n# The default value is: YES.\n# This tag requires that the tag HAVE_DOT is set to YES.\n\nGENERATE_LEGEND        = YES\n\n# If the DOT_CLEANUP tag is set to YES, doxygen will remove the intermediate dot\n# files that are used to generate the various graphs.\n# The default value is: YES.\n# This tag requires that the tag HAVE_DOT is set to YES.\n\nDOT_CLEANUP            = YES\n"
  },
  {
    "path": "doc/doxygen-dotnet.conf",
    "content": "# Doxyfile 1.8.13\n\n# This file describes the settings to be used by the documentation system\n# doxygen (www.doxygen.org) for a project.\n#\n# All text after a double hash (##) is considered a comment and is placed in\n# front of the TAG it is preceding.\n#\n# All text after a single hash (#) is considered a comment and will be ignored.\n# The format is:\n# TAG = value [value, ...]\n# For lists, items can also be appended using:\n# TAG += value [value, ...]\n# Values that contain spaces should be placed between quotes (\\\" \\\").\n\n#---------------------------------------------------------------------------\n# Project related configuration options\n#---------------------------------------------------------------------------\n\n# This tag specifies the encoding used for all characters in the config file\n# that follow. The default is UTF-8 which is also the encoding used for all text\n# before the first occurrence of this tag. Doxygen uses libiconv (or the iconv\n# built into libc) for the transcoding. See http://www.gnu.org/software/libiconv\n# for the list of possible encodings.\n# The default value is: UTF-8.\n\nDOXYFILE_ENCODING      = UTF-8\n\n# The PROJECT_NAME tag is a single word (or a sequence of words surrounded by\n# double-quotes, unless you are using Doxywizard) that should identify the\n# project for which the documentation is generated. This name is used in the\n# title of most generated pages and in a few other places.\n# The default value is: My Project.\n\nPROJECT_NAME           = \"My Project\"\n\n# The PROJECT_NUMBER tag can be used to enter a project or revision number. This\n# could be handy for archiving the generated documentation or if some version\n# control system is used.\n\nPROJECT_NUMBER         =\n\n# Using the PROJECT_BRIEF tag one can provide an optional one line description\n# for a project that appears at the top of each page and should give viewer a\n# quick idea about the purpose of the project. Keep the description short.\n\nPROJECT_BRIEF          =\n\n# With the PROJECT_LOGO tag one can specify a logo or an icon that is included\n# in the documentation. The maximum height of the logo should not exceed 55\n# pixels and the maximum width should not exceed 200 pixels. Doxygen will copy\n# the logo to the output directory.\n\nPROJECT_LOGO           =\n\n# The OUTPUT_DIRECTORY tag is used to specify the (relative or absolute) path\n# into which the generated documentation will be written. If a relative path is\n# entered, it will be relative to the location where doxygen was started. If\n# left blank the current directory will be used.\n\nOUTPUT_DIRECTORY       = doc/\n\n# If the CREATE_SUBDIRS tag is set to YES then doxygen will create 4096 sub-\n# directories (in 2 levels) under the output directory of each output format and\n# will distribute the generated files over these directories. Enabling this\n# option can be useful when feeding doxygen a huge amount of source files, where\n# putting all generated files in the same directory would otherwise causes\n# performance problems for the file system.\n# The default value is: NO.\n\nCREATE_SUBDIRS         = NO\n\n# If the ALLOW_UNICODE_NAMES tag is set to YES, doxygen will allow non-ASCII\n# characters to appear in the names of generated files. If set to NO, non-ASCII\n# characters will be escaped, for example _xE3_x81_x84 will be used for Unicode\n# U+3044.\n# The default value is: NO.\n\nALLOW_UNICODE_NAMES    = NO\n\n# The OUTPUT_LANGUAGE tag is used to specify the language in which all\n# documentation generated by doxygen is written. Doxygen will use this\n# information to generate all constant output in the proper language.\n# Possible values are: Afrikaans, Arabic, Armenian, Brazilian, Catalan, Chinese,\n# Chinese-Traditional, Croatian, Czech, Danish, Dutch, English (United States),\n# Esperanto, Farsi (Persian), Finnish, French, German, Greek, Hungarian,\n# Indonesian, Italian, Japanese, Japanese-en (Japanese with English messages),\n# Korean, Korean-en (Korean with English messages), Latvian, Lithuanian,\n# Macedonian, Norwegian, Persian (Farsi), Polish, Portuguese, Romanian, Russian,\n# Serbian, Serbian-Cyrillic, Slovak, Slovene, Spanish, Swedish, Turkish,\n# Ukrainian and Vietnamese.\n# The default value is: English.\n\nOUTPUT_LANGUAGE        = English\n\n# If the BRIEF_MEMBER_DESC tag is set to YES, doxygen will include brief member\n# descriptions after the members that are listed in the file and class\n# documentation (similar to Javadoc). Set to NO to disable this.\n# The default value is: YES.\n\nBRIEF_MEMBER_DESC      = YES\n\n# If the REPEAT_BRIEF tag is set to YES, doxygen will prepend the brief\n# description of a member or function before the detailed description\n#\n# Note: If both HIDE_UNDOC_MEMBERS and BRIEF_MEMBER_DESC are set to NO, the\n# brief descriptions will be completely suppressed.\n# The default value is: YES.\n\nREPEAT_BRIEF           = YES\n\n# This tag implements a quasi-intelligent brief description abbreviator that is\n# used to form the text in various listings. Each string in this list, if found\n# as the leading text of the brief description, will be stripped from the text\n# and the result, after processing the whole list, is used as the annotated\n# text. Otherwise, the brief description is used as-is. If left blank, the\n# following values are used ($name is automatically replaced with the name of\n# the entity):The $name class, The $name widget, The $name file, is, provides,\n# specifies, contains, represents, a, an and the.\n\nABBREVIATE_BRIEF       = \"The $name class\" \\\n                         \"The $name widget\" \\\n                         \"The $name file\" \\\n                         is \\\n                         provides \\\n                         specifies \\\n                         contains \\\n                         represents \\\n                         a \\\n                         an \\\n                         the\n\n# If the ALWAYS_DETAILED_SEC and REPEAT_BRIEF tags are both set to YES then\n# doxygen will generate a detailed section even if there is only a brief\n# description.\n# The default value is: NO.\n\nALWAYS_DETAILED_SEC    = NO\n\n# If the INLINE_INHERITED_MEMB tag is set to YES, doxygen will show all\n# inherited members of a class in the documentation of that class as if those\n# members were ordinary class members. Constructors, destructors and assignment\n# operators of the base classes will not be shown.\n# The default value is: NO.\n\nINLINE_INHERITED_MEMB  = NO\n\n# If the FULL_PATH_NAMES tag is set to YES, doxygen will prepend the full path\n# before files name in the file list and in the header files. If set to NO the\n# shortest path that makes the file name unique will be used\n# The default value is: YES.\n\nFULL_PATH_NAMES        = YES\n\n# The STRIP_FROM_PATH tag can be used to strip a user-defined part of the path.\n# Stripping is only done if one of the specified strings matches the left-hand\n# part of the path. The tag can be used to show relative paths in the file list.\n# If left blank the directory from which doxygen is run is used as the path to\n# strip.\n#\n# Note that you can specify absolute paths here, but also relative paths, which\n# will be relative from the directory where doxygen is started.\n# This tag requires that the tag FULL_PATH_NAMES is set to YES.\n\nSTRIP_FROM_PATH        =\n\n# The STRIP_FROM_INC_PATH tag can be used to strip a user-defined part of the\n# path mentioned in the documentation of a class, which tells the reader which\n# header file to include in order to use a class. If left blank only the name of\n# the header file containing the class definition is used. Otherwise one should\n# specify the list of include paths that are normally passed to the compiler\n# using the -I flag.\n\nSTRIP_FROM_INC_PATH    =\n\n# If the SHORT_NAMES tag is set to YES, doxygen will generate much shorter (but\n# less readable) file names. This can be useful is your file systems doesn't\n# support long names like on DOS, Mac, or CD-ROM.\n# The default value is: NO.\n\nSHORT_NAMES            = NO\n\n# If the JAVADOC_AUTOBRIEF tag is set to YES then doxygen will interpret the\n# first line (until the first dot) of a Javadoc-style comment as the brief\n# description. If set to NO, the Javadoc-style will behave just like regular Qt-\n# style comments (thus requiring an explicit @brief command for a brief\n# description.)\n# The default value is: NO.\n\nJAVADOC_AUTOBRIEF      = NO\n\n# If the QT_AUTOBRIEF tag is set to YES then doxygen will interpret the first\n# line (until the first dot) of a Qt-style comment as the brief description. If\n# set to NO, the Qt-style will behave just like regular Qt-style comments (thus\n# requiring an explicit \\brief command for a brief description.)\n# The default value is: NO.\n\nQT_AUTOBRIEF           = NO\n\n# The MULTILINE_CPP_IS_BRIEF tag can be set to YES to make doxygen treat a\n# multi-line C++ special comment block (i.e. a block of //! or /// comments) as\n# a brief description. This used to be the default behavior. The new default is\n# to treat a multi-line C++ comment block as a detailed description. Set this\n# tag to YES if you prefer the old behavior instead.\n#\n# Note that setting this tag to YES also means that rational rose comments are\n# not recognized any more.\n# The default value is: NO.\n\nMULTILINE_CPP_IS_BRIEF = NO\n\n# If the INHERIT_DOCS tag is set to YES then an undocumented member inherits the\n# documentation from any documented member that it re-implements.\n# The default value is: YES.\n\nINHERIT_DOCS           = YES\n\n# If the SEPARATE_MEMBER_PAGES tag is set to YES then doxygen will produce a new\n# page for each member. If set to NO, the documentation of a member will be part\n# of the file/class/namespace that contains it.\n# The default value is: NO.\n\nSEPARATE_MEMBER_PAGES  = NO\n\n# The TAB_SIZE tag can be used to set the number of spaces in a tab. Doxygen\n# uses this value to replace tabs by spaces in code fragments.\n# Minimum value: 1, maximum value: 16, default value: 4.\n\nTAB_SIZE               = 4\n\n# This tag can be used to specify a number of aliases that act as commands in\n# the documentation. An alias has the form:\n# name=value\n# For example adding\n# \"sideeffect=@par Side Effects:\\n\"\n# will allow you to put the command \\sideeffect (or @sideeffect) in the\n# documentation, which will result in a user-defined paragraph with heading\n# \"Side Effects:\". You can put \\n's in the value part of an alias to insert\n# newlines.\n\nALIASES                =\n\n# This tag can be used to specify a number of word-keyword mappings (TCL only).\n# A mapping has the form \"name=value\". For example adding \"class=itcl::class\"\n# will allow you to use the command class in the itcl::class meaning.\n\nTCL_SUBST              =\n\n# Set the OPTIMIZE_OUTPUT_FOR_C tag to YES if your project consists of C sources\n# only. Doxygen will then generate output that is more tailored for C. For\n# instance, some of the names that are used will be different. The list of all\n# members will be omitted, etc.\n# The default value is: NO.\n\nOPTIMIZE_OUTPUT_FOR_C  = NO\n\n# Set the OPTIMIZE_OUTPUT_JAVA tag to YES if your project consists of Java or\n# Python sources only. Doxygen will then generate output that is more tailored\n# for that language. For instance, namespaces will be presented as packages,\n# qualified scopes will look different, etc.\n# The default value is: NO.\n\nOPTIMIZE_OUTPUT_JAVA   = NO\n\n# Set the OPTIMIZE_FOR_FORTRAN tag to YES if your project consists of Fortran\n# sources. Doxygen will then generate output that is tailored for Fortran.\n# The default value is: NO.\n\nOPTIMIZE_FOR_FORTRAN   = NO\n\n# Set the OPTIMIZE_OUTPUT_VHDL tag to YES if your project consists of VHDL\n# sources. Doxygen will then generate output that is tailored for VHDL.\n# The default value is: NO.\n\nOPTIMIZE_OUTPUT_VHDL   = NO\n\n# Doxygen selects the parser to use depending on the extension of the files it\n# parses. With this tag you can assign which parser to use for a given\n# extension. Doxygen has a built-in mapping, but you can override or extend it\n# using this tag. The format is ext=language, where ext is a file extension, and\n# language is one of the parsers supported by doxygen: IDL, Java, Javascript,\n# C#, C, C++, D, PHP, Objective-C, Python, Fortran (fixed format Fortran:\n# FortranFixed, free formatted Fortran: FortranFree, unknown formatted Fortran:\n# Fortran. In the later case the parser tries to guess whether the code is fixed\n# or free formatted code, this is the default for Fortran type files), VHDL. For\n# instance to make doxygen treat .inc files as Fortran files (default is PHP),\n# and .f files as C (default is Fortran), use: inc=Fortran f=C.\n#\n# Note: For files without extension you can use no_extension as a placeholder.\n#\n# Note that for custom extensions you also need to set FILE_PATTERNS otherwise\n# the files are not read by doxygen.\n\nEXTENSION_MAPPING      =\n\n# If the MARKDOWN_SUPPORT tag is enabled then doxygen pre-processes all comments\n# according to the Markdown format, which allows for more readable\n# documentation. See http://daringfireball.net/projects/markdown/ for details.\n# The output of markdown processing is further processed by doxygen, so you can\n# mix doxygen, HTML, and XML commands with Markdown formatting. Disable only in\n# case of backward compatibilities issues.\n# The default value is: YES.\n\nMARKDOWN_SUPPORT       = YES\n\n# When the TOC_INCLUDE_HEADINGS tag is set to a non-zero value, all headings up\n# to that level are automatically included in the table of contents, even if\n# they do not have an id attribute.\n# Note: This feature currently applies only to Markdown headings.\n# Minimum value: 0, maximum value: 99, default value: 0.\n# This tag requires that the tag MARKDOWN_SUPPORT is set to YES.\n\nTOC_INCLUDE_HEADINGS   = 0\n\n# When enabled doxygen tries to link words that correspond to documented\n# classes, or namespaces to their corresponding documentation. Such a link can\n# be prevented in individual cases by putting a % sign in front of the word or\n# globally by setting AUTOLINK_SUPPORT to NO.\n# The default value is: YES.\n\nAUTOLINK_SUPPORT       = YES\n\n# If you use STL classes (i.e. std::string, std::vector, etc.) but do not want\n# to include (a tag file for) the STL sources as input, then you should set this\n# tag to YES in order to let doxygen match functions declarations and\n# definitions whose arguments contain STL classes (e.g. func(std::string);\n# versus func(std::string) {}). This also make the inheritance and collaboration\n# diagrams that involve STL classes more complete and accurate.\n# The default value is: NO.\n\nBUILTIN_STL_SUPPORT    = NO\n\n# If you use Microsoft's C++/CLI language, you should set this option to YES to\n# enable parsing support.\n# The default value is: NO.\n\nCPP_CLI_SUPPORT        = NO\n\n# Set the SIP_SUPPORT tag to YES if your project consists of sip (see:\n# http://www.riverbankcomputing.co.uk/software/sip/intro) sources only. Doxygen\n# will parse them like normal C++ but will assume all classes use public instead\n# of private inheritance when no explicit protection keyword is present.\n# The default value is: NO.\n\nSIP_SUPPORT            = NO\n\n# For Microsoft's IDL there are propget and propput attributes to indicate\n# getter and setter methods for a property. Setting this option to YES will make\n# doxygen to replace the get and set methods by a property in the documentation.\n# This will only work if the methods are indeed getting or setting a simple\n# type. If this is not the case, or you want to show the methods anyway, you\n# should set this option to NO.\n# The default value is: YES.\n\nIDL_PROPERTY_SUPPORT   = YES\n\n# If member grouping is used in the documentation and the DISTRIBUTE_GROUP_DOC\n# tag is set to YES then doxygen will reuse the documentation of the first\n# member in the group (if any) for the other members of the group. By default\n# all members of a group must be documented explicitly.\n# The default value is: NO.\n\nDISTRIBUTE_GROUP_DOC   = NO\n\n# If one adds a struct or class to a group and this option is enabled, then also\n# any nested class or struct is added to the same group. By default this option\n# is disabled and one has to add nested compounds explicitly via \\ingroup.\n# The default value is: NO.\n\nGROUP_NESTED_COMPOUNDS = NO\n\n# Set the SUBGROUPING tag to YES to allow class member groups of the same type\n# (for instance a group of public functions) to be put as a subgroup of that\n# type (e.g. under the Public Functions section). Set it to NO to prevent\n# subgrouping. Alternatively, this can be done per class using the\n# \\nosubgrouping command.\n# The default value is: YES.\n\nSUBGROUPING            = YES\n\n# When the INLINE_GROUPED_CLASSES tag is set to YES, classes, structs and unions\n# are shown inside the group in which they are included (e.g. using \\ingroup)\n# instead of on a separate page (for HTML and Man pages) or section (for LaTeX\n# and RTF).\n#\n# Note that this feature does not work in combination with\n# SEPARATE_MEMBER_PAGES.\n# The default value is: NO.\n\nINLINE_GROUPED_CLASSES = NO\n\n# When the INLINE_SIMPLE_STRUCTS tag is set to YES, structs, classes, and unions\n# with only public data fields or simple typedef fields will be shown inline in\n# the documentation of the scope in which they are defined (i.e. file,\n# namespace, or group documentation), provided this scope is documented. If set\n# to NO, structs, classes, and unions are shown on a separate page (for HTML and\n# Man pages) or section (for LaTeX and RTF).\n# The default value is: NO.\n\nINLINE_SIMPLE_STRUCTS  = NO\n\n# When TYPEDEF_HIDES_STRUCT tag is enabled, a typedef of a struct, union, or\n# enum is documented as struct, union, or enum with the name of the typedef. So\n# typedef struct TypeS {} TypeT, will appear in the documentation as a struct\n# with name TypeT. When disabled the typedef will appear as a member of a file,\n# namespace, or class. And the struct will be named TypeS. This can typically be\n# useful for C code in case the coding convention dictates that all compound\n# types are typedef'ed and only the typedef is referenced, never the tag name.\n# The default value is: NO.\n\nTYPEDEF_HIDES_STRUCT   = NO\n\n# The size of the symbol lookup cache can be set using LOOKUP_CACHE_SIZE. This\n# cache is used to resolve symbols given their name and scope. Since this can be\n# an expensive process and often the same symbol appears multiple times in the\n# code, doxygen keeps a cache of pre-resolved symbols. If the cache is too small\n# doxygen will become slower. If the cache is too large, memory is wasted. The\n# cache size is given by this formula: 2^(16+LOOKUP_CACHE_SIZE). The valid range\n# is 0..9, the default is 0, corresponding to a cache size of 2^16=65536\n# symbols. At the end of a run doxygen will report the cache usage and suggest\n# the optimal cache size from a speed point of view.\n# Minimum value: 0, maximum value: 9, default value: 0.\n\nLOOKUP_CACHE_SIZE      = 0\n\n#---------------------------------------------------------------------------\n# Build related configuration options\n#---------------------------------------------------------------------------\n\n# If the EXTRACT_ALL tag is set to YES, doxygen will assume all entities in\n# documentation are documented, even if no documentation was available. Private\n# class members and static file members will be hidden unless the\n# EXTRACT_PRIVATE respectively EXTRACT_STATIC tags are set to YES.\n# Note: This will also disable the warnings about undocumented members that are\n# normally produced when WARNINGS is set to YES.\n# The default value is: NO.\n\nEXTRACT_ALL            = YES\n\n# If the EXTRACT_PRIVATE tag is set to YES, all private members of a class will\n# be included in the documentation.\n# The default value is: NO.\n\nEXTRACT_PRIVATE        = NO\n\n# If the EXTRACT_PACKAGE tag is set to YES, all members with package or internal\n# scope will be included in the documentation.\n# The default value is: NO.\n\nEXTRACT_PACKAGE        = NO\n\n# If the EXTRACT_STATIC tag is set to YES, all static members of a file will be\n# included in the documentation.\n# The default value is: NO.\n\nEXTRACT_STATIC         = NO\n\n# If the EXTRACT_LOCAL_CLASSES tag is set to YES, classes (and structs) defined\n# locally in source files will be included in the documentation. If set to NO,\n# only classes defined in header files are included. Does not have any effect\n# for Java sources.\n# The default value is: YES.\n\nEXTRACT_LOCAL_CLASSES  = YES\n\n# This flag is only useful for Objective-C code. If set to YES, local methods,\n# which are defined in the implementation section but not in the interface are\n# included in the documentation. If set to NO, only methods in the interface are\n# included.\n# The default value is: NO.\n\nEXTRACT_LOCAL_METHODS  = NO\n\n# If this flag is set to YES, the members of anonymous namespaces will be\n# extracted and appear in the documentation as a namespace called\n# 'anonymous_namespace{file}', where file will be replaced with the base name of\n# the file that contains the anonymous namespace. By default anonymous namespace\n# are hidden.\n# The default value is: NO.\n\nEXTRACT_ANON_NSPACES   = NO\n\n# If the HIDE_UNDOC_MEMBERS tag is set to YES, doxygen will hide all\n# undocumented members inside documented classes or files. If set to NO these\n# members will be included in the various overviews, but no documentation\n# section is generated. This option has no effect if EXTRACT_ALL is enabled.\n# The default value is: NO.\n\nHIDE_UNDOC_MEMBERS     = NO\n\n# If the HIDE_UNDOC_CLASSES tag is set to YES, doxygen will hide all\n# undocumented classes that are normally visible in the class hierarchy. If set\n# to NO, these classes will be included in the various overviews. This option\n# has no effect if EXTRACT_ALL is enabled.\n# The default value is: NO.\n\nHIDE_UNDOC_CLASSES     = NO\n\n# If the HIDE_FRIEND_COMPOUNDS tag is set to YES, doxygen will hide all friend\n# (class|struct|union) declarations. If set to NO, these declarations will be\n# included in the documentation.\n# The default value is: NO.\n\nHIDE_FRIEND_COMPOUNDS  = NO\n\n# If the HIDE_IN_BODY_DOCS tag is set to YES, doxygen will hide any\n# documentation blocks found inside the body of a function. If set to NO, these\n# blocks will be appended to the function's detailed documentation block.\n# The default value is: NO.\n\nHIDE_IN_BODY_DOCS      = NO\n\n# The INTERNAL_DOCS tag determines if documentation that is typed after a\n# \\internal command is included. If the tag is set to NO then the documentation\n# will be excluded. Set it to YES to include the internal documentation.\n# The default value is: NO.\n\nINTERNAL_DOCS          = NO\n\n# If the CASE_SENSE_NAMES tag is set to NO then doxygen will only generate file\n# names in lower-case letters. If set to YES, upper-case letters are also\n# allowed. This is useful if you have classes or files whose names only differ\n# in case and if your file system supports case sensitive file names. Windows\n# and Mac users are advised to set this option to NO.\n# The default value is: system dependent.\n\nCASE_SENSE_NAMES       = YES\n\n# If the HIDE_SCOPE_NAMES tag is set to NO then doxygen will show members with\n# their full class and namespace scopes in the documentation. If set to YES, the\n# scope will be hidden.\n# The default value is: NO.\n\nHIDE_SCOPE_NAMES       = NO\n\n# If the HIDE_COMPOUND_REFERENCE tag is set to NO (default) then doxygen will\n# append additional text to a page's title, such as Class Reference. If set to\n# YES the compound reference will be hidden.\n# The default value is: NO.\n\nHIDE_COMPOUND_REFERENCE= NO\n\n# If the SHOW_INCLUDE_FILES tag is set to YES then doxygen will put a list of\n# the files that are included by a file in the documentation of that file.\n# The default value is: YES.\n\nSHOW_INCLUDE_FILES     = YES\n\n# If the SHOW_GROUPED_MEMB_INC tag is set to YES then Doxygen will add for each\n# grouped member an include statement to the documentation, telling the reader\n# which file to include in order to use the member.\n# The default value is: NO.\n\nSHOW_GROUPED_MEMB_INC  = NO\n\n# If the FORCE_LOCAL_INCLUDES tag is set to YES then doxygen will list include\n# files with double quotes in the documentation rather than with sharp brackets.\n# The default value is: NO.\n\nFORCE_LOCAL_INCLUDES   = NO\n\n# If the INLINE_INFO tag is set to YES then a tag [inline] is inserted in the\n# documentation for inline members.\n# The default value is: YES.\n\nINLINE_INFO            = YES\n\n# If the SORT_MEMBER_DOCS tag is set to YES then doxygen will sort the\n# (detailed) documentation of file and class members alphabetically by member\n# name. If set to NO, the members will appear in declaration order.\n# The default value is: YES.\n\nSORT_MEMBER_DOCS       = YES\n\n# If the SORT_BRIEF_DOCS tag is set to YES then doxygen will sort the brief\n# descriptions of file, namespace and class members alphabetically by member\n# name. If set to NO, the members will appear in declaration order. Note that\n# this will also influence the order of the classes in the class list.\n# The default value is: NO.\n\nSORT_BRIEF_DOCS        = NO\n\n# If the SORT_MEMBERS_CTORS_1ST tag is set to YES then doxygen will sort the\n# (brief and detailed) documentation of class members so that constructors and\n# destructors are listed first. If set to NO the constructors will appear in the\n# respective orders defined by SORT_BRIEF_DOCS and SORT_MEMBER_DOCS.\n# Note: If SORT_BRIEF_DOCS is set to NO this option is ignored for sorting brief\n# member documentation.\n# Note: If SORT_MEMBER_DOCS is set to NO this option is ignored for sorting\n# detailed member documentation.\n# The default value is: NO.\n\nSORT_MEMBERS_CTORS_1ST = NO\n\n# If the SORT_GROUP_NAMES tag is set to YES then doxygen will sort the hierarchy\n# of group names into alphabetical order. If set to NO the group names will\n# appear in their defined order.\n# The default value is: NO.\n\nSORT_GROUP_NAMES       = NO\n\n# If the SORT_BY_SCOPE_NAME tag is set to YES, the class list will be sorted by\n# fully-qualified names, including namespaces. If set to NO, the class list will\n# be sorted only by class name, not including the namespace part.\n# Note: This option is not very useful if HIDE_SCOPE_NAMES is set to YES.\n# Note: This option applies only to the class list, not to the alphabetical\n# list.\n# The default value is: NO.\n\nSORT_BY_SCOPE_NAME     = NO\n\n# If the STRICT_PROTO_MATCHING option is enabled and doxygen fails to do proper\n# type resolution of all parameters of a function it will reject a match between\n# the prototype and the implementation of a member function even if there is\n# only one candidate or it is obvious which candidate to choose by doing a\n# simple string match. By disabling STRICT_PROTO_MATCHING doxygen will still\n# accept a match between prototype and implementation in such cases.\n# The default value is: NO.\n\nSTRICT_PROTO_MATCHING  = NO\n\n# The GENERATE_TODOLIST tag can be used to enable (YES) or disable (NO) the todo\n# list. This list is created by putting \\todo commands in the documentation.\n# The default value is: YES.\n\nGENERATE_TODOLIST      = NO\n\n# The GENERATE_TESTLIST tag can be used to enable (YES) or disable (NO) the test\n# list. This list is created by putting \\test commands in the documentation.\n# The default value is: YES.\n\nGENERATE_TESTLIST      = NO\n\n# The GENERATE_BUGLIST tag can be used to enable (YES) or disable (NO) the bug\n# list. This list is created by putting \\bug commands in the documentation.\n# The default value is: YES.\n\nGENERATE_BUGLIST       = NO\n\n# The GENERATE_DEPRECATEDLIST tag can be used to enable (YES) or disable (NO)\n# the deprecated list. This list is created by putting \\deprecated commands in\n# the documentation.\n# The default value is: YES.\n\nGENERATE_DEPRECATEDLIST= YES\n\n# The ENABLED_SECTIONS tag can be used to enable conditional documentation\n# sections, marked by \\if <section_label> ... \\endif and \\cond <section_label>\n# ... \\endcond blocks.\n\nENABLED_SECTIONS       =\n\n# The MAX_INITIALIZER_LINES tag determines the maximum number of lines that the\n# initial value of a variable or macro / define can have for it to appear in the\n# documentation. If the initializer consists of more lines than specified here\n# it will be hidden. Use a value of 0 to hide initializers completely. The\n# appearance of the value of individual variables and macros / defines can be\n# controlled using \\showinitializer or \\hideinitializer command in the\n# documentation regardless of this setting.\n# Minimum value: 0, maximum value: 10000, default value: 30.\n\nMAX_INITIALIZER_LINES  = 30\n\n# Set the SHOW_USED_FILES tag to NO to disable the list of files generated at\n# the bottom of the documentation of classes and structs. If set to YES, the\n# list will mention the files that were used to generate the documentation.\n# The default value is: YES.\n\nSHOW_USED_FILES        = YES\n\n# Set the SHOW_FILES tag to NO to disable the generation of the Files page. This\n# will remove the Files entry from the Quick Index and from the Folder Tree View\n# (if specified).\n# The default value is: YES.\n\nSHOW_FILES             = YES\n\n# Set the SHOW_NAMESPACES tag to NO to disable the generation of the Namespaces\n# page. This will remove the Namespaces entry from the Quick Index and from the\n# Folder Tree View (if specified).\n# The default value is: YES.\n\nSHOW_NAMESPACES        = YES\n\n# The FILE_VERSION_FILTER tag can be used to specify a program or script that\n# doxygen should invoke to get the current version for each file (typically from\n# the version control system). Doxygen will invoke the program by executing (via\n# popen()) the command command input-file, where command is the value of the\n# FILE_VERSION_FILTER tag, and input-file is the name of an input file provided\n# by doxygen. Whatever the program writes to standard output is used as the file\n# version. For an example see the documentation.\n\nFILE_VERSION_FILTER    =\n\n# The LAYOUT_FILE tag can be used to specify a layout file which will be parsed\n# by doxygen. The layout file controls the global structure of the generated\n# output files in an output format independent way. To create the layout file\n# that represents doxygen's defaults, run doxygen with the -l option. You can\n# optionally specify a file name after the option, if omitted DoxygenLayout.xml\n# will be used as the name of the layout file.\n#\n# Note that if you run doxygen from a directory containing a file called\n# DoxygenLayout.xml, doxygen will parse it automatically even if the LAYOUT_FILE\n# tag is left empty.\n\nLAYOUT_FILE            =\n\n# The CITE_BIB_FILES tag can be used to specify one or more bib files containing\n# the reference definitions. This must be a list of .bib files. The .bib\n# extension is automatically appended if omitted. This requires the bibtex tool\n# to be installed. See also http://en.wikipedia.org/wiki/BibTeX for more info.\n# For LaTeX the style of the bibliography can be controlled using\n# LATEX_BIB_STYLE. To use this feature you need bibtex and perl available in the\n# search path. See also \\cite for info how to create references.\n\nCITE_BIB_FILES         =\n\n#---------------------------------------------------------------------------\n# Configuration options related to warning and progress messages\n#---------------------------------------------------------------------------\n\n# The QUIET tag can be used to turn on/off the messages that are generated to\n# standard output by doxygen. If QUIET is set to YES this implies that the\n# messages are off.\n# The default value is: NO.\n\nQUIET                  = NO\n\n# The WARNINGS tag can be used to turn on/off the warning messages that are\n# generated to standard error (stderr) by doxygen. If WARNINGS is set to YES\n# this implies that the warnings are on.\n#\n# Tip: Turn warnings on while writing the documentation.\n# The default value is: YES.\n\nWARNINGS               = YES\n\n# If the WARN_IF_UNDOCUMENTED tag is set to YES then doxygen will generate\n# warnings for undocumented members. If EXTRACT_ALL is set to YES then this flag\n# will automatically be disabled.\n# The default value is: YES.\n\nWARN_IF_UNDOCUMENTED   = YES\n\n# If the WARN_IF_DOC_ERROR tag is set to YES, doxygen will generate warnings for\n# potential errors in the documentation, such as not documenting some parameters\n# in a documented function, or documenting parameters that don't exist or using\n# markup commands wrongly.\n# The default value is: YES.\n\nWARN_IF_DOC_ERROR      = YES\n\n# This WARN_NO_PARAMDOC option can be enabled to get warnings for functions that\n# are documented, but have no documentation for their parameters or return\n# value. If set to NO, doxygen will only warn about wrong or incomplete\n# parameter documentation, but not about the absence of documentation.\n# The default value is: NO.\n\nWARN_NO_PARAMDOC       = NO\n\n# If the WARN_AS_ERROR tag is set to YES then doxygen will immediately stop when\n# a warning is encountered.\n# The default value is: NO.\n\nWARN_AS_ERROR          = NO\n\n# The WARN_FORMAT tag determines the format of the warning messages that doxygen\n# can produce. The string should contain the $file, $line, and $text tags, which\n# will be replaced by the file and line number from which the warning originated\n# and the warning text. Optionally the format may contain $version, which will\n# be replaced by the version of the file (if it could be obtained via\n# FILE_VERSION_FILTER)\n# The default value is: $file:$line: $text.\n\nWARN_FORMAT            = \"$file:$line: $text\"\n\n# The WARN_LOGFILE tag can be used to specify a file to which warning and error\n# messages should be written. If left blank the output is written to standard\n# error (stderr).\n\nWARN_LOGFILE           =\n\n#---------------------------------------------------------------------------\n# Configuration options related to the input files\n#---------------------------------------------------------------------------\n\n# The INPUT tag is used to specify the files and/or directories that contain\n# documented source files. You may enter file names like myfile.cpp or\n# directories like /usr/src/myproject. Separate the files or directories with\n# spaces. See also FILE_PATTERNS and EXTENSION_MAPPING\n# Note: If this tag is empty the current directory is searched.\n\nINPUT                  = native_client/dotnet/DeepSpeechClient/ native_client/dotnet/DeepSpeechClient/Interfaces/ native_client/dotnet/DeepSpeechClient/Enums/ native_client/dotnet/DeepSpeechClient/Models/\n\n# This tag can be used to specify the character encoding of the source files\n# that doxygen parses. Internally doxygen uses the UTF-8 encoding. Doxygen uses\n# libiconv (or the iconv built into libc) for the transcoding. See the libiconv\n# documentation (see: http://www.gnu.org/software/libiconv) for the list of\n# possible encodings.\n# The default value is: UTF-8.\n\nINPUT_ENCODING         = UTF-8\n\n# If the value of the INPUT tag contains directories, you can use the\n# FILE_PATTERNS tag to specify one or more wildcard patterns (like *.cpp and\n# *.h) to filter out the source-files in the directories.\n#\n# Note that for custom extensions or not directly supported extensions you also\n# need to set EXTENSION_MAPPING for the extension otherwise the files are not\n# read by doxygen.\n#\n# If left blank the following patterns are tested:*.c, *.cc, *.cxx, *.cpp,\n# *.c++, *.java, *.ii, *.ixx, *.ipp, *.i++, *.inl, *.idl, *.ddl, *.odl, *.h,\n# *.hh, *.hxx, *.hpp, *.h++, *.cs, *.d, *.php, *.php4, *.php5, *.phtml, *.inc,\n# *.m, *.markdown, *.md, *.mm, *.dox, *.py, *.pyw, *.f90, *.f95, *.f03, *.f08,\n# *.f, *.for, *.tcl, *.vhd, *.vhdl, *.ucf and *.qsf.\n\nFILE_PATTERNS          = *.c \\\n                         *.cc \\\n                         *.cxx \\\n                         *.cpp \\\n                         *.c++ \\\n                         *.java \\\n                         *.ii \\\n                         *.ixx \\\n                         *.ipp \\\n                         *.i++ \\\n                         *.inl \\\n                         *.idl \\\n                         *.ddl \\\n                         *.odl \\\n                         *.h \\\n                         *.hh \\\n                         *.hxx \\\n                         *.hpp \\\n                         *.h++ \\\n                         *.cs \\\n                         *.d \\\n                         *.php \\\n                         *.php4 \\\n                         *.php5 \\\n                         *.phtml \\\n                         *.inc \\\n                         *.m \\\n                         *.markdown \\\n                         *.md \\\n                         *.mm \\\n                         *.dox \\\n                         *.py \\\n                         *.pyw \\\n                         *.f90 \\\n                         *.f95 \\\n                         *.f03 \\\n                         *.f08 \\\n                         *.f \\\n                         *.for \\\n                         *.tcl \\\n                         *.vhd \\\n                         *.vhdl \\\n                         *.ucf \\\n                         *.qsf\n\n# The RECURSIVE tag can be used to specify whether or not subdirectories should\n# be searched for input files as well.\n# The default value is: NO.\n\nRECURSIVE              = NO\n\n# The EXCLUDE tag can be used to specify files and/or directories that should be\n# excluded from the INPUT source files. This way you can easily exclude a\n# subdirectory from a directory tree whose root is specified with the INPUT tag.\n#\n# Note that relative paths are relative to the directory from which doxygen is\n# run.\n\nEXCLUDE                =\n\n# The EXCLUDE_SYMLINKS tag can be used to select whether or not files or\n# directories that are symbolic links (a Unix file system feature) are excluded\n# from the input.\n# The default value is: NO.\n\nEXCLUDE_SYMLINKS       = NO\n\n# If the value of the INPUT tag contains directories, you can use the\n# EXCLUDE_PATTERNS tag to specify one or more wildcard patterns to exclude\n# certain files from those directories.\n#\n# Note that the wildcards are matched against the file with absolute path, so to\n# exclude all test directories for example use the pattern */test/*\n\nEXCLUDE_PATTERNS       =\n\n# The EXCLUDE_SYMBOLS tag can be used to specify one or more symbol names\n# (namespaces, classes, functions, etc.) that should be excluded from the\n# output. The symbol name can be a fully qualified name, a word, or if the\n# wildcard * is used, a substring. Examples: ANamespace, AClass,\n# AClass::ANamespace, ANamespace::*Test\n#\n# Note that the wildcards are matched against the file with absolute path, so to\n# exclude all test directories use the pattern */test/*\n\nEXCLUDE_SYMBOLS        =\n\n# The EXAMPLE_PATH tag can be used to specify one or more files or directories\n# that contain example code fragments that are included (see the \\include\n# command).\n\nEXAMPLE_PATH           =\n\n# If the value of the EXAMPLE_PATH tag contains directories, you can use the\n# EXAMPLE_PATTERNS tag to specify one or more wildcard pattern (like *.cpp and\n# *.h) to filter out the source-files in the directories. If left blank all\n# files are included.\n\nEXAMPLE_PATTERNS       = *\n\n# If the EXAMPLE_RECURSIVE tag is set to YES then subdirectories will be\n# searched for input files to be used with the \\include or \\dontinclude commands\n# irrespective of the value of the RECURSIVE tag.\n# The default value is: NO.\n\nEXAMPLE_RECURSIVE      = NO\n\n# The IMAGE_PATH tag can be used to specify one or more files or directories\n# that contain images that are to be included in the documentation (see the\n# \\image command).\n\nIMAGE_PATH             =\n\n# The INPUT_FILTER tag can be used to specify a program that doxygen should\n# invoke to filter for each input file. Doxygen will invoke the filter program\n# by executing (via popen()) the command:\n#\n# <filter> <input-file>\n#\n# where <filter> is the value of the INPUT_FILTER tag, and <input-file> is the\n# name of an input file. Doxygen will then use the output that the filter\n# program writes to standard output. If FILTER_PATTERNS is specified, this tag\n# will be ignored.\n#\n# Note that the filter must not add or remove lines; it is applied before the\n# code is scanned, but not when the output code is generated. If lines are added\n# or removed, the anchors will not be placed correctly.\n#\n# Note that for custom extensions or not directly supported extensions you also\n# need to set EXTENSION_MAPPING for the extension otherwise the files are not\n# properly processed by doxygen.\n\nINPUT_FILTER           =\n\n# The FILTER_PATTERNS tag can be used to specify filters on a per file pattern\n# basis. Doxygen will compare the file name with each pattern and apply the\n# filter if there is a match. The filters are a list of the form: pattern=filter\n# (like *.cpp=my_cpp_filter). See INPUT_FILTER for further information on how\n# filters are used. If the FILTER_PATTERNS tag is empty or if none of the\n# patterns match the file name, INPUT_FILTER is applied.\n#\n# Note that for custom extensions or not directly supported extensions you also\n# need to set EXTENSION_MAPPING for the extension otherwise the files are not\n# properly processed by doxygen.\n\nFILTER_PATTERNS        =\n\n# If the FILTER_SOURCE_FILES tag is set to YES, the input filter (if set using\n# INPUT_FILTER) will also be used to filter the input files that are used for\n# producing the source files to browse (i.e. when SOURCE_BROWSER is set to YES).\n# The default value is: NO.\n\nFILTER_SOURCE_FILES    = NO\n\n# The FILTER_SOURCE_PATTERNS tag can be used to specify source filters per file\n# pattern. A pattern will override the setting for FILTER_PATTERN (if any) and\n# it is also possible to disable source filtering for a specific pattern using\n# *.ext= (so without naming a filter).\n# This tag requires that the tag FILTER_SOURCE_FILES is set to YES.\n\nFILTER_SOURCE_PATTERNS =\n\n# If the USE_MDFILE_AS_MAINPAGE tag refers to the name of a markdown file that\n# is part of the input, its contents will be placed on the main page\n# (index.html). This can be useful if you have a project on for instance GitHub\n# and want to reuse the introduction page also for the doxygen output.\n\nUSE_MDFILE_AS_MAINPAGE =\n\n#---------------------------------------------------------------------------\n# Configuration options related to source browsing\n#---------------------------------------------------------------------------\n\n# If the SOURCE_BROWSER tag is set to YES then a list of source files will be\n# generated. Documented entities will be cross-referenced with these sources.\n#\n# Note: To get rid of all source code in the generated output, make sure that\n# also VERBATIM_HEADERS is set to NO.\n# The default value is: NO.\n\nSOURCE_BROWSER         = NO\n\n# Setting the INLINE_SOURCES tag to YES will include the body of functions,\n# classes and enums directly into the documentation.\n# The default value is: NO.\n\nINLINE_SOURCES         = NO\n\n# Setting the STRIP_CODE_COMMENTS tag to YES will instruct doxygen to hide any\n# special comment blocks from generated source code fragments. Normal C, C++ and\n# Fortran comments will always remain visible.\n# The default value is: YES.\n\nSTRIP_CODE_COMMENTS    = YES\n\n# If the REFERENCED_BY_RELATION tag is set to YES then for each documented\n# function all documented functions referencing it will be listed.\n# The default value is: NO.\n\nREFERENCED_BY_RELATION = NO\n\n# If the REFERENCES_RELATION tag is set to YES then for each documented function\n# all documented entities called/used by that function will be listed.\n# The default value is: NO.\n\nREFERENCES_RELATION    = NO\n\n# If the REFERENCES_LINK_SOURCE tag is set to YES and SOURCE_BROWSER tag is set\n# to YES then the hyperlinks from functions in REFERENCES_RELATION and\n# REFERENCED_BY_RELATION lists will link to the source code. Otherwise they will\n# link to the documentation.\n# The default value is: YES.\n\nREFERENCES_LINK_SOURCE = YES\n\n# If SOURCE_TOOLTIPS is enabled (the default) then hovering a hyperlink in the\n# source code will show a tooltip with additional information such as prototype,\n# brief description and links to the definition and documentation. Since this\n# will make the HTML file larger and loading of large files a bit slower, you\n# can opt to disable this feature.\n# The default value is: YES.\n# This tag requires that the tag SOURCE_BROWSER is set to YES.\n\nSOURCE_TOOLTIPS        = YES\n\n# If the USE_HTAGS tag is set to YES then the references to source code will\n# point to the HTML generated by the htags(1) tool instead of doxygen built-in\n# source browser. The htags tool is part of GNU's global source tagging system\n# (see http://www.gnu.org/software/global/global.html). You will need version\n# 4.8.6 or higher.\n#\n# To use it do the following:\n# - Install the latest version of global\n# - Enable SOURCE_BROWSER and USE_HTAGS in the config file\n# - Make sure the INPUT points to the root of the source tree\n# - Run doxygen as normal\n#\n# Doxygen will invoke htags (and that will in turn invoke gtags), so these\n# tools must be available from the command line (i.e. in the search path).\n#\n# The result: instead of the source browser generated by doxygen, the links to\n# source code will now point to the output of htags.\n# The default value is: NO.\n# This tag requires that the tag SOURCE_BROWSER is set to YES.\n\nUSE_HTAGS              = NO\n\n# If the VERBATIM_HEADERS tag is set the YES then doxygen will generate a\n# verbatim copy of the header file for each class for which an include is\n# specified. Set to NO to disable this.\n# See also: Section \\class.\n# The default value is: YES.\n\nVERBATIM_HEADERS       = YES\n\n# If the CLANG_ASSISTED_PARSING tag is set to YES then doxygen will use the\n# clang parser (see: http://clang.llvm.org/) for more accurate parsing at the\n# cost of reduced performance. This can be particularly helpful with template\n# rich C++ code for which doxygen's built-in parser lacks the necessary type\n# information.\n# Note: The availability of this option depends on whether or not doxygen was\n# generated with the -Duse-libclang=ON option for CMake.\n# The default value is: NO.\n\nCLANG_ASSISTED_PARSING = NO\n\n# If clang assisted parsing is enabled you can provide the compiler with command\n# line options that you would normally use when invoking the compiler. Note that\n# the include paths will already be set by doxygen for the files and directories\n# specified with INPUT and INCLUDE_PATH.\n# This tag requires that the tag CLANG_ASSISTED_PARSING is set to YES.\n\nCLANG_OPTIONS          =\n\n#---------------------------------------------------------------------------\n# Configuration options related to the alphabetical class index\n#---------------------------------------------------------------------------\n\n# If the ALPHABETICAL_INDEX tag is set to YES, an alphabetical index of all\n# compounds will be generated. Enable this if the project contains a lot of\n# classes, structs, unions or interfaces.\n# The default value is: YES.\n\nALPHABETICAL_INDEX     = YES\n\n# The COLS_IN_ALPHA_INDEX tag can be used to specify the number of columns in\n# which the alphabetical index list will be split.\n# Minimum value: 1, maximum value: 20, default value: 5.\n# This tag requires that the tag ALPHABETICAL_INDEX is set to YES.\n\nCOLS_IN_ALPHA_INDEX    = 5\n\n# In case all classes in a project start with a common prefix, all classes will\n# be put under the same header in the alphabetical index. The IGNORE_PREFIX tag\n# can be used to specify a prefix (or a list of prefixes) that should be ignored\n# while generating the index headers.\n# This tag requires that the tag ALPHABETICAL_INDEX is set to YES.\n\nIGNORE_PREFIX          =\n\n#---------------------------------------------------------------------------\n# Configuration options related to the HTML output\n#---------------------------------------------------------------------------\n\n# If the GENERATE_HTML tag is set to YES, doxygen will generate HTML output\n# The default value is: YES.\n\nGENERATE_HTML          = NO\n\n# The HTML_OUTPUT tag is used to specify where the HTML docs will be put. If a\n# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of\n# it.\n# The default directory is: html.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nHTML_OUTPUT            = html\n\n# The HTML_FILE_EXTENSION tag can be used to specify the file extension for each\n# generated HTML page (for example: .htm, .php, .asp).\n# The default value is: .html.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nHTML_FILE_EXTENSION    = .html\n\n# The HTML_HEADER tag can be used to specify a user-defined HTML header file for\n# each generated HTML page. If the tag is left blank doxygen will generate a\n# standard header.\n#\n# To get valid HTML the header file that includes any scripts and style sheets\n# that doxygen needs, which is dependent on the configuration options used (e.g.\n# the setting GENERATE_TREEVIEW). It is highly recommended to start with a\n# default header using\n# doxygen -w html new_header.html new_footer.html new_stylesheet.css\n# YourConfigFile\n# and then modify the file new_header.html. See also section \"Doxygen usage\"\n# for information on how to generate the default header that doxygen normally\n# uses.\n# Note: The header is subject to change so you typically have to regenerate the\n# default header when upgrading to a newer version of doxygen. For a description\n# of the possible markers and block names see the documentation.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nHTML_HEADER            =\n\n# The HTML_FOOTER tag can be used to specify a user-defined HTML footer for each\n# generated HTML page. If the tag is left blank doxygen will generate a standard\n# footer. See HTML_HEADER for more information on how to generate a default\n# footer and what special commands can be used inside the footer. See also\n# section \"Doxygen usage\" for information on how to generate the default footer\n# that doxygen normally uses.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nHTML_FOOTER            =\n\n# The HTML_STYLESHEET tag can be used to specify a user-defined cascading style\n# sheet that is used by each HTML page. It can be used to fine-tune the look of\n# the HTML output. If left blank doxygen will generate a default style sheet.\n# See also section \"Doxygen usage\" for information on how to generate the style\n# sheet that doxygen normally uses.\n# Note: It is recommended to use HTML_EXTRA_STYLESHEET instead of this tag, as\n# it is more robust and this tag (HTML_STYLESHEET) will in the future become\n# obsolete.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nHTML_STYLESHEET        =\n\n# The HTML_EXTRA_STYLESHEET tag can be used to specify additional user-defined\n# cascading style sheets that are included after the standard style sheets\n# created by doxygen. Using this option one can overrule certain style aspects.\n# This is preferred over using HTML_STYLESHEET since it does not replace the\n# standard style sheet and is therefore more robust against future updates.\n# Doxygen will copy the style sheet files to the output directory.\n# Note: The order of the extra style sheet files is of importance (e.g. the last\n# style sheet in the list overrules the setting of the previous ones in the\n# list). For an example see the documentation.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nHTML_EXTRA_STYLESHEET  =\n\n# The HTML_EXTRA_FILES tag can be used to specify one or more extra images or\n# other source files which should be copied to the HTML output directory. Note\n# that these files will be copied to the base HTML output directory. Use the\n# $relpath^ marker in the HTML_HEADER and/or HTML_FOOTER files to load these\n# files. In the HTML_STYLESHEET file, use the file name only. Also note that the\n# files will be copied as-is; there are no commands or markers available.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nHTML_EXTRA_FILES       =\n\n# The HTML_COLORSTYLE_HUE tag controls the color of the HTML output. Doxygen\n# will adjust the colors in the style sheet and background images according to\n# this color. Hue is specified as an angle on a colorwheel, see\n# http://en.wikipedia.org/wiki/Hue for more information. For instance the value\n# 0 represents red, 60 is yellow, 120 is green, 180 is cyan, 240 is blue, 300\n# purple, and 360 is red again.\n# Minimum value: 0, maximum value: 359, default value: 220.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nHTML_COLORSTYLE_HUE    = 220\n\n# The HTML_COLORSTYLE_SAT tag controls the purity (or saturation) of the colors\n# in the HTML output. For a value of 0 the output will use grayscales only. A\n# value of 255 will produce the most vivid colors.\n# Minimum value: 0, maximum value: 255, default value: 100.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nHTML_COLORSTYLE_SAT    = 100\n\n# The HTML_COLORSTYLE_GAMMA tag controls the gamma correction applied to the\n# luminance component of the colors in the HTML output. Values below 100\n# gradually make the output lighter, whereas values above 100 make the output\n# darker. The value divided by 100 is the actual gamma applied, so 80 represents\n# a gamma of 0.8, The value 220 represents a gamma of 2.2, and 100 does not\n# change the gamma.\n# Minimum value: 40, maximum value: 240, default value: 80.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nHTML_COLORSTYLE_GAMMA  = 80\n\n# If the HTML_TIMESTAMP tag is set to YES then the footer of each generated HTML\n# page will contain the date and time when the page was generated. Setting this\n# to YES can help to show when doxygen was last run and thus if the\n# documentation is up to date.\n# The default value is: NO.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nHTML_TIMESTAMP         = NO\n\n# If the HTML_DYNAMIC_SECTIONS tag is set to YES then the generated HTML\n# documentation will contain sections that can be hidden and shown after the\n# page has loaded.\n# The default value is: NO.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nHTML_DYNAMIC_SECTIONS  = NO\n\n# With HTML_INDEX_NUM_ENTRIES one can control the preferred number of entries\n# shown in the various tree structured indices initially; the user can expand\n# and collapse entries dynamically later on. Doxygen will expand the tree to\n# such a level that at most the specified number of entries are visible (unless\n# a fully collapsed tree already exceeds this amount). So setting the number of\n# entries 1 will produce a full collapsed tree by default. 0 is a special value\n# representing an infinite number of entries and will result in a full expanded\n# tree by default.\n# Minimum value: 0, maximum value: 9999, default value: 100.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nHTML_INDEX_NUM_ENTRIES = 100\n\n# If the GENERATE_DOCSET tag is set to YES, additional index files will be\n# generated that can be used as input for Apple's Xcode 3 integrated development\n# environment (see: http://developer.apple.com/tools/xcode/), introduced with\n# OSX 10.5 (Leopard). To create a documentation set, doxygen will generate a\n# Makefile in the HTML output directory. Running make will produce the docset in\n# that directory and running make install will install the docset in\n# ~/Library/Developer/Shared/Documentation/DocSets so that Xcode will find it at\n# startup. See http://developer.apple.com/tools/creatingdocsetswithdoxygen.html\n# for more information.\n# The default value is: NO.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nGENERATE_DOCSET        = NO\n\n# This tag determines the name of the docset feed. A documentation feed provides\n# an umbrella under which multiple documentation sets from a single provider\n# (such as a company or product suite) can be grouped.\n# The default value is: Doxygen generated docs.\n# This tag requires that the tag GENERATE_DOCSET is set to YES.\n\nDOCSET_FEEDNAME        = \"Doxygen generated docs\"\n\n# This tag specifies a string that should uniquely identify the documentation\n# set bundle. This should be a reverse domain-name style string, e.g.\n# com.mycompany.MyDocSet. Doxygen will append .docset to the name.\n# The default value is: org.doxygen.Project.\n# This tag requires that the tag GENERATE_DOCSET is set to YES.\n\nDOCSET_BUNDLE_ID       = org.doxygen.Project\n\n# The DOCSET_PUBLISHER_ID tag specifies a string that should uniquely identify\n# the documentation publisher. This should be a reverse domain-name style\n# string, e.g. com.mycompany.MyDocSet.documentation.\n# The default value is: org.doxygen.Publisher.\n# This tag requires that the tag GENERATE_DOCSET is set to YES.\n\nDOCSET_PUBLISHER_ID    = org.doxygen.Publisher\n\n# The DOCSET_PUBLISHER_NAME tag identifies the documentation publisher.\n# The default value is: Publisher.\n# This tag requires that the tag GENERATE_DOCSET is set to YES.\n\nDOCSET_PUBLISHER_NAME  = Publisher\n\n# If the GENERATE_HTMLHELP tag is set to YES then doxygen generates three\n# additional HTML index files: index.hhp, index.hhc, and index.hhk. The\n# index.hhp is a project file that can be read by Microsoft's HTML Help Workshop\n# (see: http://www.microsoft.com/en-us/download/details.aspx?id=21138) on\n# Windows.\n#\n# The HTML Help Workshop contains a compiler that can convert all HTML output\n# generated by doxygen into a single compiled HTML file (.chm). Compiled HTML\n# files are now used as the Windows 98 help format, and will replace the old\n# Windows help format (.hlp) on all Windows platforms in the future. Compressed\n# HTML files also contain an index, a table of contents, and you can search for\n# words in the documentation. The HTML workshop also contains a viewer for\n# compressed HTML files.\n# The default value is: NO.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nGENERATE_HTMLHELP      = NO\n\n# The CHM_FILE tag can be used to specify the file name of the resulting .chm\n# file. You can add a path in front of the file if the result should not be\n# written to the html output directory.\n# This tag requires that the tag GENERATE_HTMLHELP is set to YES.\n\nCHM_FILE               =\n\n# The HHC_LOCATION tag can be used to specify the location (absolute path\n# including file name) of the HTML help compiler (hhc.exe). If non-empty,\n# doxygen will try to run the HTML help compiler on the generated index.hhp.\n# The file has to be specified with full path.\n# This tag requires that the tag GENERATE_HTMLHELP is set to YES.\n\nHHC_LOCATION           =\n\n# The GENERATE_CHI flag controls if a separate .chi index file is generated\n# (YES) or that it should be included in the master .chm file (NO).\n# The default value is: NO.\n# This tag requires that the tag GENERATE_HTMLHELP is set to YES.\n\nGENERATE_CHI           = NO\n\n# The CHM_INDEX_ENCODING is used to encode HtmlHelp index (hhk), content (hhc)\n# and project file content.\n# This tag requires that the tag GENERATE_HTMLHELP is set to YES.\n\nCHM_INDEX_ENCODING     =\n\n# The BINARY_TOC flag controls whether a binary table of contents is generated\n# (YES) or a normal table of contents (NO) in the .chm file. Furthermore it\n# enables the Previous and Next buttons.\n# The default value is: NO.\n# This tag requires that the tag GENERATE_HTMLHELP is set to YES.\n\nBINARY_TOC             = NO\n\n# The TOC_EXPAND flag can be set to YES to add extra items for group members to\n# the table of contents of the HTML help documentation and to the tree view.\n# The default value is: NO.\n# This tag requires that the tag GENERATE_HTMLHELP is set to YES.\n\nTOC_EXPAND             = NO\n\n# If the GENERATE_QHP tag is set to YES and both QHP_NAMESPACE and\n# QHP_VIRTUAL_FOLDER are set, an additional index file will be generated that\n# can be used as input for Qt's qhelpgenerator to generate a Qt Compressed Help\n# (.qch) of the generated HTML documentation.\n# The default value is: NO.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nGENERATE_QHP           = NO\n\n# If the QHG_LOCATION tag is specified, the QCH_FILE tag can be used to specify\n# the file name of the resulting .qch file. The path specified is relative to\n# the HTML output folder.\n# This tag requires that the tag GENERATE_QHP is set to YES.\n\nQCH_FILE               =\n\n# The QHP_NAMESPACE tag specifies the namespace to use when generating Qt Help\n# Project output. For more information please see Qt Help Project / Namespace\n# (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#namespace).\n# The default value is: org.doxygen.Project.\n# This tag requires that the tag GENERATE_QHP is set to YES.\n\nQHP_NAMESPACE          = org.doxygen.Project\n\n# The QHP_VIRTUAL_FOLDER tag specifies the namespace to use when generating Qt\n# Help Project output. For more information please see Qt Help Project / Virtual\n# Folders (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#virtual-\n# folders).\n# The default value is: doc.\n# This tag requires that the tag GENERATE_QHP is set to YES.\n\nQHP_VIRTUAL_FOLDER     = doc\n\n# If the QHP_CUST_FILTER_NAME tag is set, it specifies the name of a custom\n# filter to add. For more information please see Qt Help Project / Custom\n# Filters (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#custom-\n# filters).\n# This tag requires that the tag GENERATE_QHP is set to YES.\n\nQHP_CUST_FILTER_NAME   =\n\n# The QHP_CUST_FILTER_ATTRS tag specifies the list of the attributes of the\n# custom filter to add. For more information please see Qt Help Project / Custom\n# Filters (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#custom-\n# filters).\n# This tag requires that the tag GENERATE_QHP is set to YES.\n\nQHP_CUST_FILTER_ATTRS  =\n\n# The QHP_SECT_FILTER_ATTRS tag specifies the list of the attributes this\n# project's filter section matches. Qt Help Project / Filter Attributes (see:\n# http://qt-project.org/doc/qt-4.8/qthelpproject.html#filter-attributes).\n# This tag requires that the tag GENERATE_QHP is set to YES.\n\nQHP_SECT_FILTER_ATTRS  =\n\n# The QHG_LOCATION tag can be used to specify the location of Qt's\n# qhelpgenerator. If non-empty doxygen will try to run qhelpgenerator on the\n# generated .qhp file.\n# This tag requires that the tag GENERATE_QHP is set to YES.\n\nQHG_LOCATION           =\n\n# If the GENERATE_ECLIPSEHELP tag is set to YES, additional index files will be\n# generated, together with the HTML files, they form an Eclipse help plugin. To\n# install this plugin and make it available under the help contents menu in\n# Eclipse, the contents of the directory containing the HTML and XML files needs\n# to be copied into the plugins directory of eclipse. The name of the directory\n# within the plugins directory should be the same as the ECLIPSE_DOC_ID value.\n# After copying Eclipse needs to be restarted before the help appears.\n# The default value is: NO.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nGENERATE_ECLIPSEHELP   = NO\n\n# A unique identifier for the Eclipse help plugin. When installing the plugin\n# the directory name containing the HTML and XML files should also have this\n# name. Each documentation set should have its own identifier.\n# The default value is: org.doxygen.Project.\n# This tag requires that the tag GENERATE_ECLIPSEHELP is set to YES.\n\nECLIPSE_DOC_ID         = org.doxygen.Project\n\n# If you want full control over the layout of the generated HTML pages it might\n# be necessary to disable the index and replace it with your own. The\n# DISABLE_INDEX tag can be used to turn on/off the condensed index (tabs) at top\n# of each HTML page. A value of NO enables the index and the value YES disables\n# it. Since the tabs in the index contain the same information as the navigation\n# tree, you can set this option to YES if you also set GENERATE_TREEVIEW to YES.\n# The default value is: NO.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nDISABLE_INDEX          = NO\n\n# The GENERATE_TREEVIEW tag is used to specify whether a tree-like index\n# structure should be generated to display hierarchical information. If the tag\n# value is set to YES, a side panel will be generated containing a tree-like\n# index structure (just like the one that is generated for HTML Help). For this\n# to work a browser that supports JavaScript, DHTML, CSS and frames is required\n# (i.e. any modern browser). Windows users are probably better off using the\n# HTML help feature. Via custom style sheets (see HTML_EXTRA_STYLESHEET) one can\n# further fine-tune the look of the index. As an example, the default style\n# sheet generated by doxygen has an example that shows how to put an image at\n# the root of the tree instead of the PROJECT_NAME. Since the tree basically has\n# the same information as the tab index, you could consider setting\n# DISABLE_INDEX to YES when enabling this option.\n# The default value is: NO.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nGENERATE_TREEVIEW      = NO\n\n# The ENUM_VALUES_PER_LINE tag can be used to set the number of enum values that\n# doxygen will group on one line in the generated HTML documentation.\n#\n# Note that a value of 0 will completely suppress the enum values from appearing\n# in the overview section.\n# Minimum value: 0, maximum value: 20, default value: 4.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nENUM_VALUES_PER_LINE   = 4\n\n# If the treeview is enabled (see GENERATE_TREEVIEW) then this tag can be used\n# to set the initial width (in pixels) of the frame in which the tree is shown.\n# Minimum value: 0, maximum value: 1500, default value: 250.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nTREEVIEW_WIDTH         = 250\n\n# If the EXT_LINKS_IN_WINDOW option is set to YES, doxygen will open links to\n# external symbols imported via tag files in a separate window.\n# The default value is: NO.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nEXT_LINKS_IN_WINDOW    = NO\n\n# Use this tag to change the font size of LaTeX formulas included as images in\n# the HTML documentation. When you change the font size after a successful\n# doxygen run you need to manually remove any form_*.png images from the HTML\n# output directory to force them to be regenerated.\n# Minimum value: 8, maximum value: 50, default value: 10.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nFORMULA_FONTSIZE       = 10\n\n# Use the FORMULA_TRANPARENT tag to determine whether or not the images\n# generated for formulas are transparent PNGs. Transparent PNGs are not\n# supported properly for IE 6.0, but are supported on all modern browsers.\n#\n# Note that when changing this option you need to delete any form_*.png files in\n# the HTML output directory before the changes have effect.\n# The default value is: YES.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nFORMULA_TRANSPARENT    = YES\n\n# Enable the USE_MATHJAX option to render LaTeX formulas using MathJax (see\n# http://www.mathjax.org) which uses client side Javascript for the rendering\n# instead of using pre-rendered bitmaps. Use this if you do not have LaTeX\n# installed or if you want to formulas look prettier in the HTML output. When\n# enabled you may also need to install MathJax separately and configure the path\n# to it using the MATHJAX_RELPATH option.\n# The default value is: NO.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nUSE_MATHJAX            = NO\n\n# When MathJax is enabled you can set the default output format to be used for\n# the MathJax output. See the MathJax site (see:\n# http://docs.mathjax.org/en/latest/output.html) for more details.\n# Possible values are: HTML-CSS (which is slower, but has the best\n# compatibility), NativeMML (i.e. MathML) and SVG.\n# The default value is: HTML-CSS.\n# This tag requires that the tag USE_MATHJAX is set to YES.\n\nMATHJAX_FORMAT         = HTML-CSS\n\n# When MathJax is enabled you need to specify the location relative to the HTML\n# output directory using the MATHJAX_RELPATH option. The destination directory\n# should contain the MathJax.js script. For instance, if the mathjax directory\n# is located at the same level as the HTML output directory, then\n# MATHJAX_RELPATH should be ../mathjax. The default value points to the MathJax\n# Content Delivery Network so you can quickly see the result without installing\n# MathJax. However, it is strongly recommended to install a local copy of\n# MathJax from http://www.mathjax.org before deployment.\n# The default value is: http://cdn.mathjax.org/mathjax/latest.\n# This tag requires that the tag USE_MATHJAX is set to YES.\n\nMATHJAX_RELPATH        = http://cdn.mathjax.org/mathjax/latest\n\n# The MATHJAX_EXTENSIONS tag can be used to specify one or more MathJax\n# extension names that should be enabled during MathJax rendering. For example\n# MATHJAX_EXTENSIONS = TeX/AMSmath TeX/AMSsymbols\n# This tag requires that the tag USE_MATHJAX is set to YES.\n\nMATHJAX_EXTENSIONS     =\n\n# The MATHJAX_CODEFILE tag can be used to specify a file with javascript pieces\n# of code that will be used on startup of the MathJax code. See the MathJax site\n# (see: http://docs.mathjax.org/en/latest/output.html) for more details. For an\n# example see the documentation.\n# This tag requires that the tag USE_MATHJAX is set to YES.\n\nMATHJAX_CODEFILE       =\n\n# When the SEARCHENGINE tag is enabled doxygen will generate a search box for\n# the HTML output. The underlying search engine uses javascript and DHTML and\n# should work on any modern browser. Note that when using HTML help\n# (GENERATE_HTMLHELP), Qt help (GENERATE_QHP), or docsets (GENERATE_DOCSET)\n# there is already a search function so this one should typically be disabled.\n# For large projects the javascript based search engine can be slow, then\n# enabling SERVER_BASED_SEARCH may provide a better solution. It is possible to\n# search using the keyboard; to jump to the search box use <access key> + S\n# (what the <access key> is depends on the OS and browser, but it is typically\n# <CTRL>, <ALT>/<option>, or both). Inside the search box use the <cursor down\n# key> to jump into the search results window, the results can be navigated\n# using the <cursor keys>. Press <Enter> to select an item or <escape> to cancel\n# the search. The filter options can be selected when the cursor is inside the\n# search box by pressing <Shift>+<cursor down>. Also here use the <cursor keys>\n# to select a filter and <Enter> or <escape> to activate or cancel the filter\n# option.\n# The default value is: YES.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nSEARCHENGINE           = YES\n\n# When the SERVER_BASED_SEARCH tag is enabled the search engine will be\n# implemented using a web server instead of a web client using Javascript. There\n# are two flavors of web server based searching depending on the EXTERNAL_SEARCH\n# setting. When disabled, doxygen will generate a PHP script for searching and\n# an index file used by the script. When EXTERNAL_SEARCH is enabled the indexing\n# and searching needs to be provided by external tools. See the section\n# \"External Indexing and Searching\" for details.\n# The default value is: NO.\n# This tag requires that the tag SEARCHENGINE is set to YES.\n\nSERVER_BASED_SEARCH    = NO\n\n# When EXTERNAL_SEARCH tag is enabled doxygen will no longer generate the PHP\n# script for searching. Instead the search results are written to an XML file\n# which needs to be processed by an external indexer. Doxygen will invoke an\n# external search engine pointed to by the SEARCHENGINE_URL option to obtain the\n# search results.\n#\n# Doxygen ships with an example indexer (doxyindexer) and search engine\n# (doxysearch.cgi) which are based on the open source search engine library\n# Xapian (see: http://xapian.org/).\n#\n# See the section \"External Indexing and Searching\" for details.\n# The default value is: NO.\n# This tag requires that the tag SEARCHENGINE is set to YES.\n\nEXTERNAL_SEARCH        = NO\n\n# The SEARCHENGINE_URL should point to a search engine hosted by a web server\n# which will return the search results when EXTERNAL_SEARCH is enabled.\n#\n# Doxygen ships with an example indexer (doxyindexer) and search engine\n# (doxysearch.cgi) which are based on the open source search engine library\n# Xapian (see: http://xapian.org/). See the section \"External Indexing and\n# Searching\" for details.\n# This tag requires that the tag SEARCHENGINE is set to YES.\n\nSEARCHENGINE_URL       =\n\n# When SERVER_BASED_SEARCH and EXTERNAL_SEARCH are both enabled the unindexed\n# search data is written to a file for indexing by an external tool. With the\n# SEARCHDATA_FILE tag the name of this file can be specified.\n# The default file is: searchdata.xml.\n# This tag requires that the tag SEARCHENGINE is set to YES.\n\nSEARCHDATA_FILE        = searchdata.xml\n\n# When SERVER_BASED_SEARCH and EXTERNAL_SEARCH are both enabled the\n# EXTERNAL_SEARCH_ID tag can be used as an identifier for the project. This is\n# useful in combination with EXTRA_SEARCH_MAPPINGS to search through multiple\n# projects and redirect the results back to the right project.\n# This tag requires that the tag SEARCHENGINE is set to YES.\n\nEXTERNAL_SEARCH_ID     =\n\n# The EXTRA_SEARCH_MAPPINGS tag can be used to enable searching through doxygen\n# projects other than the one defined by this configuration file, but that are\n# all added to the same external search index. Each project needs to have a\n# unique id set via EXTERNAL_SEARCH_ID. The search mapping then maps the id of\n# to a relative location where the documentation can be found. The format is:\n# EXTRA_SEARCH_MAPPINGS = tagname1=loc1 tagname2=loc2 ...\n# This tag requires that the tag SEARCHENGINE is set to YES.\n\nEXTRA_SEARCH_MAPPINGS  =\n\n#---------------------------------------------------------------------------\n# Configuration options related to the LaTeX output\n#---------------------------------------------------------------------------\n\n# If the GENERATE_LATEX tag is set to YES, doxygen will generate LaTeX output.\n# The default value is: YES.\n\nGENERATE_LATEX         = NO\n\n# The LATEX_OUTPUT tag is used to specify where the LaTeX docs will be put. If a\n# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of\n# it.\n# The default directory is: latex.\n# This tag requires that the tag GENERATE_LATEX is set to YES.\n\nLATEX_OUTPUT           = latex\n\n# The LATEX_CMD_NAME tag can be used to specify the LaTeX command name to be\n# invoked.\n#\n# Note that when enabling USE_PDFLATEX this option is only used for generating\n# bitmaps for formulas in the HTML output, but not in the Makefile that is\n# written to the output directory.\n# The default file is: latex.\n# This tag requires that the tag GENERATE_LATEX is set to YES.\n\nLATEX_CMD_NAME         = latex\n\n# The MAKEINDEX_CMD_NAME tag can be used to specify the command name to generate\n# index for LaTeX.\n# The default file is: makeindex.\n# This tag requires that the tag GENERATE_LATEX is set to YES.\n\nMAKEINDEX_CMD_NAME     = makeindex\n\n# If the COMPACT_LATEX tag is set to YES, doxygen generates more compact LaTeX\n# documents. This may be useful for small projects and may help to save some\n# trees in general.\n# The default value is: NO.\n# This tag requires that the tag GENERATE_LATEX is set to YES.\n\nCOMPACT_LATEX          = NO\n\n# The PAPER_TYPE tag can be used to set the paper type that is used by the\n# printer.\n# Possible values are: a4 (210 x 297 mm), letter (8.5 x 11 inches), legal (8.5 x\n# 14 inches) and executive (7.25 x 10.5 inches).\n# The default value is: a4.\n# This tag requires that the tag GENERATE_LATEX is set to YES.\n\nPAPER_TYPE             = a4\n\n# The EXTRA_PACKAGES tag can be used to specify one or more LaTeX package names\n# that should be included in the LaTeX output. The package can be specified just\n# by its name or with the correct syntax as to be used with the LaTeX\n# \\usepackage command. To get the times font for instance you can specify :\n# EXTRA_PACKAGES=times or EXTRA_PACKAGES={times}\n# To use the option intlimits with the amsmath package you can specify:\n# EXTRA_PACKAGES=[intlimits]{amsmath}\n# If left blank no extra packages will be included.\n# This tag requires that the tag GENERATE_LATEX is set to YES.\n\nEXTRA_PACKAGES         =\n\n# The LATEX_HEADER tag can be used to specify a personal LaTeX header for the\n# generated LaTeX document. The header should contain everything until the first\n# chapter. If it is left blank doxygen will generate a standard header. See\n# section \"Doxygen usage\" for information on how to let doxygen write the\n# default header to a separate file.\n#\n# Note: Only use a user-defined header if you know what you are doing! The\n# following commands have a special meaning inside the header: $title,\n# $datetime, $date, $doxygenversion, $projectname, $projectnumber,\n# $projectbrief, $projectlogo. Doxygen will replace $title with the empty\n# string, for the replacement values of the other commands the user is referred\n# to HTML_HEADER.\n# This tag requires that the tag GENERATE_LATEX is set to YES.\n\nLATEX_HEADER           =\n\n# The LATEX_FOOTER tag can be used to specify a personal LaTeX footer for the\n# generated LaTeX document. The footer should contain everything after the last\n# chapter. If it is left blank doxygen will generate a standard footer. See\n# LATEX_HEADER for more information on how to generate a default footer and what\n# special commands can be used inside the footer.\n#\n# Note: Only use a user-defined footer if you know what you are doing!\n# This tag requires that the tag GENERATE_LATEX is set to YES.\n\nLATEX_FOOTER           =\n\n# The LATEX_EXTRA_STYLESHEET tag can be used to specify additional user-defined\n# LaTeX style sheets that are included after the standard style sheets created\n# by doxygen. Using this option one can overrule certain style aspects. Doxygen\n# will copy the style sheet files to the output directory.\n# Note: The order of the extra style sheet files is of importance (e.g. the last\n# style sheet in the list overrules the setting of the previous ones in the\n# list).\n# This tag requires that the tag GENERATE_LATEX is set to YES.\n\nLATEX_EXTRA_STYLESHEET =\n\n# The LATEX_EXTRA_FILES tag can be used to specify one or more extra images or\n# other source files which should be copied to the LATEX_OUTPUT output\n# directory. Note that the files will be copied as-is; there are no commands or\n# markers available.\n# This tag requires that the tag GENERATE_LATEX is set to YES.\n\nLATEX_EXTRA_FILES      =\n\n# If the PDF_HYPERLINKS tag is set to YES, the LaTeX that is generated is\n# prepared for conversion to PDF (using ps2pdf or pdflatex). The PDF file will\n# contain links (just like the HTML output) instead of page references. This\n# makes the output suitable for online browsing using a PDF viewer.\n# The default value is: YES.\n# This tag requires that the tag GENERATE_LATEX is set to YES.\n\nPDF_HYPERLINKS         = YES\n\n# If the USE_PDFLATEX tag is set to YES, doxygen will use pdflatex to generate\n# the PDF file directly from the LaTeX files. Set this option to YES, to get a\n# higher quality PDF documentation.\n# The default value is: YES.\n# This tag requires that the tag GENERATE_LATEX is set to YES.\n\nUSE_PDFLATEX           = YES\n\n# If the LATEX_BATCHMODE tag is set to YES, doxygen will add the \\batchmode\n# command to the generated LaTeX files. This will instruct LaTeX to keep running\n# if errors occur, instead of asking the user for help. This option is also used\n# when generating formulas in HTML.\n# The default value is: NO.\n# This tag requires that the tag GENERATE_LATEX is set to YES.\n\nLATEX_BATCHMODE        = NO\n\n# If the LATEX_HIDE_INDICES tag is set to YES then doxygen will not include the\n# index chapters (such as File Index, Compound Index, etc.) in the output.\n# The default value is: NO.\n# This tag requires that the tag GENERATE_LATEX is set to YES.\n\nLATEX_HIDE_INDICES     = NO\n\n# If the LATEX_SOURCE_CODE tag is set to YES then doxygen will include source\n# code with syntax highlighting in the LaTeX output.\n#\n# Note that which sources are shown also depends on other settings such as\n# SOURCE_BROWSER.\n# The default value is: NO.\n# This tag requires that the tag GENERATE_LATEX is set to YES.\n\nLATEX_SOURCE_CODE      = NO\n\n# The LATEX_BIB_STYLE tag can be used to specify the style to use for the\n# bibliography, e.g. plainnat, or ieeetr. See\n# http://en.wikipedia.org/wiki/BibTeX and \\cite for more info.\n# The default value is: plain.\n# This tag requires that the tag GENERATE_LATEX is set to YES.\n\nLATEX_BIB_STYLE        = plain\n\n# If the LATEX_TIMESTAMP tag is set to YES then the footer of each generated\n# page will contain the date and time when the page was generated. Setting this\n# to NO can help when comparing the output of multiple runs.\n# The default value is: NO.\n# This tag requires that the tag GENERATE_LATEX is set to YES.\n\nLATEX_TIMESTAMP        = NO\n\n#---------------------------------------------------------------------------\n# Configuration options related to the RTF output\n#---------------------------------------------------------------------------\n\n# If the GENERATE_RTF tag is set to YES, doxygen will generate RTF output. The\n# RTF output is optimized for Word 97 and may not look too pretty with other RTF\n# readers/editors.\n# The default value is: NO.\n\nGENERATE_RTF           = NO\n\n# The RTF_OUTPUT tag is used to specify where the RTF docs will be put. If a\n# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of\n# it.\n# The default directory is: rtf.\n# This tag requires that the tag GENERATE_RTF is set to YES.\n\nRTF_OUTPUT             = rtf\n\n# If the COMPACT_RTF tag is set to YES, doxygen generates more compact RTF\n# documents. This may be useful for small projects and may help to save some\n# trees in general.\n# The default value is: NO.\n# This tag requires that the tag GENERATE_RTF is set to YES.\n\nCOMPACT_RTF            = NO\n\n# If the RTF_HYPERLINKS tag is set to YES, the RTF that is generated will\n# contain hyperlink fields. The RTF file will contain links (just like the HTML\n# output) instead of page references. This makes the output suitable for online\n# browsing using Word or some other Word compatible readers that support those\n# fields.\n#\n# Note: WordPad (write) and others do not support links.\n# The default value is: NO.\n# This tag requires that the tag GENERATE_RTF is set to YES.\n\nRTF_HYPERLINKS         = NO\n\n# Load stylesheet definitions from file. Syntax is similar to doxygen's config\n# file, i.e. a series of assignments. You only have to provide replacements,\n# missing definitions are set to their default value.\n#\n# See also section \"Doxygen usage\" for information on how to generate the\n# default style sheet that doxygen normally uses.\n# This tag requires that the tag GENERATE_RTF is set to YES.\n\nRTF_STYLESHEET_FILE    =\n\n# Set optional variables used in the generation of an RTF document. Syntax is\n# similar to doxygen's config file. A template extensions file can be generated\n# using doxygen -e rtf extensionFile.\n# This tag requires that the tag GENERATE_RTF is set to YES.\n\nRTF_EXTENSIONS_FILE    =\n\n# If the RTF_SOURCE_CODE tag is set to YES then doxygen will include source code\n# with syntax highlighting in the RTF output.\n#\n# Note that which sources are shown also depends on other settings such as\n# SOURCE_BROWSER.\n# The default value is: NO.\n# This tag requires that the tag GENERATE_RTF is set to YES.\n\nRTF_SOURCE_CODE        = NO\n\n#---------------------------------------------------------------------------\n# Configuration options related to the man page output\n#---------------------------------------------------------------------------\n\n# If the GENERATE_MAN tag is set to YES, doxygen will generate man pages for\n# classes and files.\n# The default value is: NO.\n\nGENERATE_MAN           = NO\n\n# The MAN_OUTPUT tag is used to specify where the man pages will be put. If a\n# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of\n# it. A directory man3 will be created inside the directory specified by\n# MAN_OUTPUT.\n# The default directory is: man.\n# This tag requires that the tag GENERATE_MAN is set to YES.\n\nMAN_OUTPUT             = man\n\n# The MAN_EXTENSION tag determines the extension that is added to the generated\n# man pages. In case the manual section does not start with a number, the number\n# 3 is prepended. The dot (.) at the beginning of the MAN_EXTENSION tag is\n# optional.\n# The default value is: .3.\n# This tag requires that the tag GENERATE_MAN is set to YES.\n\nMAN_EXTENSION          = .3\n\n# The MAN_SUBDIR tag determines the name of the directory created within\n# MAN_OUTPUT in which the man pages are placed. If defaults to man followed by\n# MAN_EXTENSION with the initial . removed.\n# This tag requires that the tag GENERATE_MAN is set to YES.\n\nMAN_SUBDIR             =\n\n# If the MAN_LINKS tag is set to YES and doxygen generates man output, then it\n# will generate one additional man file for each entity documented in the real\n# man page(s). These additional files only source the real man page, but without\n# them the man command would be unable to find the correct page.\n# The default value is: NO.\n# This tag requires that the tag GENERATE_MAN is set to YES.\n\nMAN_LINKS              = NO\n\n#---------------------------------------------------------------------------\n# Configuration options related to the XML output\n#---------------------------------------------------------------------------\n\n# If the GENERATE_XML tag is set to YES, doxygen will generate an XML file that\n# captures the structure of the code including all documentation.\n# The default value is: NO.\n\nGENERATE_XML           = YES\n\n# The XML_OUTPUT tag is used to specify where the XML pages will be put. If a\n# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of\n# it.\n# The default directory is: xml.\n# This tag requires that the tag GENERATE_XML is set to YES.\n\nXML_OUTPUT             = xml-dotnet\n\n# If the XML_PROGRAMLISTING tag is set to YES, doxygen will dump the program\n# listings (including syntax highlighting and cross-referencing information) to\n# the XML output. Note that enabling this will significantly increase the size\n# of the XML output.\n# The default value is: YES.\n# This tag requires that the tag GENERATE_XML is set to YES.\n\nXML_PROGRAMLISTING     = YES\n\n#---------------------------------------------------------------------------\n# Configuration options related to the DOCBOOK output\n#---------------------------------------------------------------------------\n\n# If the GENERATE_DOCBOOK tag is set to YES, doxygen will generate Docbook files\n# that can be used to generate PDF.\n# The default value is: NO.\n\nGENERATE_DOCBOOK       = NO\n\n# The DOCBOOK_OUTPUT tag is used to specify where the Docbook pages will be put.\n# If a relative path is entered the value of OUTPUT_DIRECTORY will be put in\n# front of it.\n# The default directory is: docbook.\n# This tag requires that the tag GENERATE_DOCBOOK is set to YES.\n\nDOCBOOK_OUTPUT         = docbook\n\n# If the DOCBOOK_PROGRAMLISTING tag is set to YES, doxygen will include the\n# program listings (including syntax highlighting and cross-referencing\n# information) to the DOCBOOK output. Note that enabling this will significantly\n# increase the size of the DOCBOOK output.\n# The default value is: NO.\n# This tag requires that the tag GENERATE_DOCBOOK is set to YES.\n\nDOCBOOK_PROGRAMLISTING = NO\n\n#---------------------------------------------------------------------------\n# Configuration options for the AutoGen Definitions output\n#---------------------------------------------------------------------------\n\n# If the GENERATE_AUTOGEN_DEF tag is set to YES, doxygen will generate an\n# AutoGen Definitions (see http://autogen.sf.net) file that captures the\n# structure of the code including all documentation. Note that this feature is\n# still experimental and incomplete at the moment.\n# The default value is: NO.\n\nGENERATE_AUTOGEN_DEF   = NO\n\n#---------------------------------------------------------------------------\n# Configuration options related to the Perl module output\n#---------------------------------------------------------------------------\n\n# If the GENERATE_PERLMOD tag is set to YES, doxygen will generate a Perl module\n# file that captures the structure of the code including all documentation.\n#\n# Note that this feature is still experimental and incomplete at the moment.\n# The default value is: NO.\n\nGENERATE_PERLMOD       = NO\n\n# If the PERLMOD_LATEX tag is set to YES, doxygen will generate the necessary\n# Makefile rules, Perl scripts and LaTeX code to be able to generate PDF and DVI\n# output from the Perl module output.\n# The default value is: NO.\n# This tag requires that the tag GENERATE_PERLMOD is set to YES.\n\nPERLMOD_LATEX          = NO\n\n# If the PERLMOD_PRETTY tag is set to YES, the Perl module output will be nicely\n# formatted so it can be parsed by a human reader. This is useful if you want to\n# understand what is going on. On the other hand, if this tag is set to NO, the\n# size of the Perl module output will be much smaller and Perl will parse it\n# just the same.\n# The default value is: YES.\n# This tag requires that the tag GENERATE_PERLMOD is set to YES.\n\nPERLMOD_PRETTY         = YES\n\n# The names of the make variables in the generated doxyrules.make file are\n# prefixed with the string contained in PERLMOD_MAKEVAR_PREFIX. This is useful\n# so different doxyrules.make files included by the same Makefile don't\n# overwrite each other's variables.\n# This tag requires that the tag GENERATE_PERLMOD is set to YES.\n\nPERLMOD_MAKEVAR_PREFIX =\n\n#---------------------------------------------------------------------------\n# Configuration options related to the preprocessor\n#---------------------------------------------------------------------------\n\n# If the ENABLE_PREPROCESSING tag is set to YES, doxygen will evaluate all\n# C-preprocessor directives found in the sources and include files.\n# The default value is: YES.\n\nENABLE_PREPROCESSING   = YES\n\n# If the MACRO_EXPANSION tag is set to YES, doxygen will expand all macro names\n# in the source code. If set to NO, only conditional compilation will be\n# performed. Macro expansion can be done in a controlled way by setting\n# EXPAND_ONLY_PREDEF to YES.\n# The default value is: NO.\n# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.\n\nMACRO_EXPANSION        = NO\n\n# If the EXPAND_ONLY_PREDEF and MACRO_EXPANSION tags are both set to YES then\n# the macro expansion is limited to the macros specified with the PREDEFINED and\n# EXPAND_AS_DEFINED tags.\n# The default value is: NO.\n# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.\n\nEXPAND_ONLY_PREDEF     = NO\n\n# If the SEARCH_INCLUDES tag is set to YES, the include files in the\n# INCLUDE_PATH will be searched if a #include is found.\n# The default value is: YES.\n# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.\n\nSEARCH_INCLUDES        = YES\n\n# The INCLUDE_PATH tag can be used to specify one or more directories that\n# contain include files that are not input files but should be processed by the\n# preprocessor.\n# This tag requires that the tag SEARCH_INCLUDES is set to YES.\n\nINCLUDE_PATH           =\n\n# You can use the INCLUDE_FILE_PATTERNS tag to specify one or more wildcard\n# patterns (like *.h and *.hpp) to filter out the header-files in the\n# directories. If left blank, the patterns specified with FILE_PATTERNS will be\n# used.\n# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.\n\nINCLUDE_FILE_PATTERNS  =\n\n# The PREDEFINED tag can be used to specify one or more macro names that are\n# defined before the preprocessor is started (similar to the -D option of e.g.\n# gcc). The argument of the tag is a list of macros of the form: name or\n# name=definition (no spaces). If the definition and the \"=\" are omitted, \"=1\"\n# is assumed. To prevent a macro definition from being undefined via #undef or\n# recursively expanded use the := operator instead of the = operator.\n# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.\n\nPREDEFINED             =\n\n# If the MACRO_EXPANSION and EXPAND_ONLY_PREDEF tags are set to YES then this\n# tag can be used to specify a list of macro names that should be expanded. The\n# macro definition that is found in the sources will be used. Use the PREDEFINED\n# tag if you want to use a different macro definition that overrules the\n# definition found in the source code.\n# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.\n\nEXPAND_AS_DEFINED      =\n\n# If the SKIP_FUNCTION_MACROS tag is set to YES then doxygen's preprocessor will\n# remove all references to function-like macros that are alone on a line, have\n# an all uppercase name, and do not end with a semicolon. Such function macros\n# are typically used for boiler-plate code, and will confuse the parser if not\n# removed.\n# The default value is: YES.\n# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.\n\nSKIP_FUNCTION_MACROS   = YES\n\n#---------------------------------------------------------------------------\n# Configuration options related to external references\n#---------------------------------------------------------------------------\n\n# The TAGFILES tag can be used to specify one or more tag files. For each tag\n# file the location of the external documentation should be added. The format of\n# a tag file without this location is as follows:\n# TAGFILES = file1 file2 ...\n# Adding location for the tag files is done as follows:\n# TAGFILES = file1=loc1 \"file2 = loc2\" ...\n# where loc1 and loc2 can be relative or absolute paths or URLs. See the\n# section \"Linking to external documentation\" for more information about the use\n# of tag files.\n# Note: Each tag file must have a unique name (where the name does NOT include\n# the path). If a tag file is not located in the directory in which doxygen is\n# run, you must also specify the path to the tagfile here.\n\nTAGFILES               =\n\n# When a file name is specified after GENERATE_TAGFILE, doxygen will create a\n# tag file that is based on the input files it reads. See section \"Linking to\n# external documentation\" for more information about the usage of tag files.\n\nGENERATE_TAGFILE       =\n\n# If the ALLEXTERNALS tag is set to YES, all external class will be listed in\n# the class index. If set to NO, only the inherited external classes will be\n# listed.\n# The default value is: NO.\n\nALLEXTERNALS           = NO\n\n# If the EXTERNAL_GROUPS tag is set to YES, all external groups will be listed\n# in the modules index. If set to NO, only the current project's groups will be\n# listed.\n# The default value is: YES.\n\nEXTERNAL_GROUPS        = YES\n\n# If the EXTERNAL_PAGES tag is set to YES, all external pages will be listed in\n# the related pages index. If set to NO, only the current project's pages will\n# be listed.\n# The default value is: YES.\n\nEXTERNAL_PAGES         = YES\n\n# The PERL_PATH should be the absolute path and name of the perl script\n# interpreter (i.e. the result of 'which perl').\n# The default file (with absolute path) is: /usr/bin/perl.\n\nPERL_PATH              = /usr/bin/perl\n\n#---------------------------------------------------------------------------\n# Configuration options related to the dot tool\n#---------------------------------------------------------------------------\n\n# If the CLASS_DIAGRAMS tag is set to YES, doxygen will generate a class diagram\n# (in HTML and LaTeX) for classes with base or super classes. Setting the tag to\n# NO turns the diagrams off. Note that this option also works with HAVE_DOT\n# disabled, but it is recommended to install and use dot, since it yields more\n# powerful graphs.\n# The default value is: YES.\n\nCLASS_DIAGRAMS         = YES\n\n# You can define message sequence charts within doxygen comments using the \\msc\n# command. Doxygen will then run the mscgen tool (see:\n# http://www.mcternan.me.uk/mscgen/)) to produce the chart and insert it in the\n# documentation. The MSCGEN_PATH tag allows you to specify the directory where\n# the mscgen tool resides. If left empty the tool is assumed to be found in the\n# default search path.\n\nMSCGEN_PATH            =\n\n# You can include diagrams made with dia in doxygen documentation. Doxygen will\n# then run dia to produce the diagram and insert it in the documentation. The\n# DIA_PATH tag allows you to specify the directory where the dia binary resides.\n# If left empty dia is assumed to be found in the default search path.\n\nDIA_PATH               =\n\n# If set to YES the inheritance and collaboration graphs will hide inheritance\n# and usage relations if the target is undocumented or is not a class.\n# The default value is: YES.\n\nHIDE_UNDOC_RELATIONS   = YES\n\n# If you set the HAVE_DOT tag to YES then doxygen will assume the dot tool is\n# available from the path. This tool is part of Graphviz (see:\n# http://www.graphviz.org/), a graph visualization toolkit from AT&T and Lucent\n# Bell Labs. The other options in this section have no effect if this option is\n# set to NO\n# The default value is: YES.\n\nHAVE_DOT               = YES\n\n# The DOT_NUM_THREADS specifies the number of dot invocations doxygen is allowed\n# to run in parallel. When set to 0 doxygen will base this on the number of\n# processors available in the system. You can set it explicitly to a value\n# larger than 0 to get control over the balance between CPU load and processing\n# speed.\n# Minimum value: 0, maximum value: 32, default value: 0.\n# This tag requires that the tag HAVE_DOT is set to YES.\n\nDOT_NUM_THREADS        = 0\n\n# When you want a differently looking font in the dot files that doxygen\n# generates you can specify the font name using DOT_FONTNAME. You need to make\n# sure dot is able to find the font, which can be done by putting it in a\n# standard location or by setting the DOTFONTPATH environment variable or by\n# setting DOT_FONTPATH to the directory containing the font.\n# The default value is: Helvetica.\n# This tag requires that the tag HAVE_DOT is set to YES.\n\nDOT_FONTNAME           = Helvetica\n\n# The DOT_FONTSIZE tag can be used to set the size (in points) of the font of\n# dot graphs.\n# Minimum value: 4, maximum value: 24, default value: 10.\n# This tag requires that the tag HAVE_DOT is set to YES.\n\nDOT_FONTSIZE           = 10\n\n# By default doxygen will tell dot to use the default font as specified with\n# DOT_FONTNAME. If you specify a different font using DOT_FONTNAME you can set\n# the path where dot can find it using this tag.\n# This tag requires that the tag HAVE_DOT is set to YES.\n\nDOT_FONTPATH           =\n\n# If the CLASS_GRAPH tag is set to YES then doxygen will generate a graph for\n# each documented class showing the direct and indirect inheritance relations.\n# Setting this tag to YES will force the CLASS_DIAGRAMS tag to NO.\n# The default value is: YES.\n# This tag requires that the tag HAVE_DOT is set to YES.\n\nCLASS_GRAPH            = YES\n\n# If the COLLABORATION_GRAPH tag is set to YES then doxygen will generate a\n# graph for each documented class showing the direct and indirect implementation\n# dependencies (inheritance, containment, and class references variables) of the\n# class with other documented classes.\n# The default value is: YES.\n# This tag requires that the tag HAVE_DOT is set to YES.\n\nCOLLABORATION_GRAPH    = YES\n\n# If the GROUP_GRAPHS tag is set to YES then doxygen will generate a graph for\n# groups, showing the direct groups dependencies.\n# The default value is: YES.\n# This tag requires that the tag HAVE_DOT is set to YES.\n\nGROUP_GRAPHS           = YES\n\n# If the UML_LOOK tag is set to YES, doxygen will generate inheritance and\n# collaboration diagrams in a style similar to the OMG's Unified Modeling\n# Language.\n# The default value is: NO.\n# This tag requires that the tag HAVE_DOT is set to YES.\n\nUML_LOOK               = NO\n\n# If the UML_LOOK tag is enabled, the fields and methods are shown inside the\n# class node. If there are many fields or methods and many nodes the graph may\n# become too big to be useful. The UML_LIMIT_NUM_FIELDS threshold limits the\n# number of items for each type to make the size more manageable. Set this to 0\n# for no limit. Note that the threshold may be exceeded by 50% before the limit\n# is enforced. So when you set the threshold to 10, up to 15 fields may appear,\n# but if the number exceeds 15, the total amount of fields shown is limited to\n# 10.\n# Minimum value: 0, maximum value: 100, default value: 10.\n# This tag requires that the tag HAVE_DOT is set to YES.\n\nUML_LIMIT_NUM_FIELDS   = 10\n\n# If the TEMPLATE_RELATIONS tag is set to YES then the inheritance and\n# collaboration graphs will show the relations between templates and their\n# instances.\n# The default value is: NO.\n# This tag requires that the tag HAVE_DOT is set to YES.\n\nTEMPLATE_RELATIONS     = NO\n\n# If the INCLUDE_GRAPH, ENABLE_PREPROCESSING and SEARCH_INCLUDES tags are set to\n# YES then doxygen will generate a graph for each documented file showing the\n# direct and indirect include dependencies of the file with other documented\n# files.\n# The default value is: YES.\n# This tag requires that the tag HAVE_DOT is set to YES.\n\nINCLUDE_GRAPH          = YES\n\n# If the INCLUDED_BY_GRAPH, ENABLE_PREPROCESSING and SEARCH_INCLUDES tags are\n# set to YES then doxygen will generate a graph for each documented file showing\n# the direct and indirect include dependencies of the file with other documented\n# files.\n# The default value is: YES.\n# This tag requires that the tag HAVE_DOT is set to YES.\n\nINCLUDED_BY_GRAPH      = YES\n\n# If the CALL_GRAPH tag is set to YES then doxygen will generate a call\n# dependency graph for every global function or class method.\n#\n# Note that enabling this option will significantly increase the time of a run.\n# So in most cases it will be better to enable call graphs for selected\n# functions only using the \\callgraph command. Disabling a call graph can be\n# accomplished by means of the command \\hidecallgraph.\n# The default value is: NO.\n# This tag requires that the tag HAVE_DOT is set to YES.\n\nCALL_GRAPH             = NO\n\n# If the CALLER_GRAPH tag is set to YES then doxygen will generate a caller\n# dependency graph for every global function or class method.\n#\n# Note that enabling this option will significantly increase the time of a run.\n# So in most cases it will be better to enable caller graphs for selected\n# functions only using the \\callergraph command. Disabling a caller graph can be\n# accomplished by means of the command \\hidecallergraph.\n# The default value is: NO.\n# This tag requires that the tag HAVE_DOT is set to YES.\n\nCALLER_GRAPH           = NO\n\n# If the GRAPHICAL_HIERARCHY tag is set to YES then doxygen will graphical\n# hierarchy of all classes instead of a textual one.\n# The default value is: YES.\n# This tag requires that the tag HAVE_DOT is set to YES.\n\nGRAPHICAL_HIERARCHY    = YES\n\n# If the DIRECTORY_GRAPH tag is set to YES then doxygen will show the\n# dependencies a directory has on other directories in a graphical way. The\n# dependency relations are determined by the #include relations between the\n# files in the directories.\n# The default value is: YES.\n# This tag requires that the tag HAVE_DOT is set to YES.\n\nDIRECTORY_GRAPH        = YES\n\n# The DOT_IMAGE_FORMAT tag can be used to set the image format of the images\n# generated by dot. For an explanation of the image formats see the section\n# output formats in the documentation of the dot tool (Graphviz (see:\n# http://www.graphviz.org/)).\n# Note: If you choose svg you need to set HTML_FILE_EXTENSION to xhtml in order\n# to make the SVG files visible in IE 9+ (other browsers do not have this\n# requirement).\n# Possible values are: png, png:cairo, png:cairo:cairo, png:cairo:gd, png:gd,\n# png:gd:gd, jpg, jpg:cairo, jpg:cairo:gd, jpg:gd, jpg:gd:gd, gif, gif:cairo,\n# gif:cairo:gd, gif:gd, gif:gd:gd, svg, png:gd, png:gd:gd, png:cairo,\n# png:cairo:gd, png:cairo:cairo, png:cairo:gdiplus, png:gdiplus and\n# png:gdiplus:gdiplus.\n# The default value is: png.\n# This tag requires that the tag HAVE_DOT is set to YES.\n\nDOT_IMAGE_FORMAT       = png\n\n# If DOT_IMAGE_FORMAT is set to svg, then this option can be set to YES to\n# enable generation of interactive SVG images that allow zooming and panning.\n#\n# Note that this requires a modern browser other than Internet Explorer. Tested\n# and working are Firefox, Chrome, Safari, and Opera.\n# Note: For IE 9+ you need to set HTML_FILE_EXTENSION to xhtml in order to make\n# the SVG files visible. Older versions of IE do not have SVG support.\n# The default value is: NO.\n# This tag requires that the tag HAVE_DOT is set to YES.\n\nINTERACTIVE_SVG        = NO\n\n# The DOT_PATH tag can be used to specify the path where the dot tool can be\n# found. If left blank, it is assumed the dot tool can be found in the path.\n# This tag requires that the tag HAVE_DOT is set to YES.\n\nDOT_PATH               =\n\n# The DOTFILE_DIRS tag can be used to specify one or more directories that\n# contain dot files that are included in the documentation (see the \\dotfile\n# command).\n# This tag requires that the tag HAVE_DOT is set to YES.\n\nDOTFILE_DIRS           =\n\n# The MSCFILE_DIRS tag can be used to specify one or more directories that\n# contain msc files that are included in the documentation (see the \\mscfile\n# command).\n\nMSCFILE_DIRS           =\n\n# The DIAFILE_DIRS tag can be used to specify one or more directories that\n# contain dia files that are included in the documentation (see the \\diafile\n# command).\n\nDIAFILE_DIRS           =\n\n# When using plantuml, the PLANTUML_JAR_PATH tag should be used to specify the\n# path where java can find the plantuml.jar file. If left blank, it is assumed\n# PlantUML is not used or called during a preprocessing step. Doxygen will\n# generate a warning when it encounters a \\startuml command in this case and\n# will not generate output for the diagram.\n\nPLANTUML_JAR_PATH      =\n\n# When using plantuml, the PLANTUML_CFG_FILE tag can be used to specify a\n# configuration file for plantuml.\n\nPLANTUML_CFG_FILE      =\n\n# When using plantuml, the specified paths are searched for files specified by\n# the !include statement in a plantuml block.\n\nPLANTUML_INCLUDE_PATH  =\n\n# The DOT_GRAPH_MAX_NODES tag can be used to set the maximum number of nodes\n# that will be shown in the graph. If the number of nodes in a graph becomes\n# larger than this value, doxygen will truncate the graph, which is visualized\n# by representing a node as a red box. Note that doxygen if the number of direct\n# children of the root node in a graph is already larger than\n# DOT_GRAPH_MAX_NODES then the graph will not be shown at all. Also note that\n# the size of a graph can be further restricted by MAX_DOT_GRAPH_DEPTH.\n# Minimum value: 0, maximum value: 10000, default value: 50.\n# This tag requires that the tag HAVE_DOT is set to YES.\n\nDOT_GRAPH_MAX_NODES    = 50\n\n# The MAX_DOT_GRAPH_DEPTH tag can be used to set the maximum depth of the graphs\n# generated by dot. A depth value of 3 means that only nodes reachable from the\n# root by following a path via at most 3 edges will be shown. Nodes that lay\n# further from the root node will be omitted. Note that setting this option to 1\n# or 2 may greatly reduce the computation time needed for large code bases. Also\n# note that the size of a graph can be further restricted by\n# DOT_GRAPH_MAX_NODES. Using a depth of 0 means no depth restriction.\n# Minimum value: 0, maximum value: 1000, default value: 0.\n# This tag requires that the tag HAVE_DOT is set to YES.\n\nMAX_DOT_GRAPH_DEPTH    = 0\n\n# Set the DOT_TRANSPARENT tag to YES to generate images with a transparent\n# background. This is disabled by default, because dot on Windows does not seem\n# to support this out of the box.\n#\n# Warning: Depending on the platform used, enabling this option may lead to\n# badly anti-aliased labels on the edges of a graph (i.e. they become hard to\n# read).\n# The default value is: NO.\n# This tag requires that the tag HAVE_DOT is set to YES.\n\nDOT_TRANSPARENT        = NO\n\n# Set the DOT_MULTI_TARGETS tag to YES to allow dot to generate multiple output\n# files in one run (i.e. multiple -o and -T options on the command line). This\n# makes dot run faster, but since only newer versions of dot (>1.8.10) support\n# this, this feature is disabled by default.\n# The default value is: NO.\n# This tag requires that the tag HAVE_DOT is set to YES.\n\nDOT_MULTI_TARGETS      = NO\n\n# If the GENERATE_LEGEND tag is set to YES doxygen will generate a legend page\n# explaining the meaning of the various boxes and arrows in the dot generated\n# graphs.\n# The default value is: YES.\n# This tag requires that the tag HAVE_DOT is set to YES.\n\nGENERATE_LEGEND        = YES\n\n# If the DOT_CLEANUP tag is set to YES, doxygen will remove the intermediate dot\n# files that are used to generate the various graphs.\n# The default value is: YES.\n# This tag requires that the tag HAVE_DOT is set to YES.\n\nDOT_CLEANUP            = YES\n"
  },
  {
    "path": "doc/doxygen-java.conf",
    "content": "# Doxyfile 1.8.13\n\n# This file describes the settings to be used by the documentation system\n# doxygen (www.doxygen.org) for a project.\n#\n# All text after a double hash (##) is considered a comment and is placed in\n# front of the TAG it is preceding.\n#\n# All text after a single hash (#) is considered a comment and will be ignored.\n# The format is:\n# TAG = value [value, ...]\n# For lists, items can also be appended using:\n# TAG += value [value, ...]\n# Values that contain spaces should be placed between quotes (\\\" \\\").\n\n#---------------------------------------------------------------------------\n# Project related configuration options\n#---------------------------------------------------------------------------\n\n# This tag specifies the encoding used for all characters in the config file\n# that follow. The default is UTF-8 which is also the encoding used for all text\n# before the first occurrence of this tag. Doxygen uses libiconv (or the iconv\n# built into libc) for the transcoding. See http://www.gnu.org/software/libiconv\n# for the list of possible encodings.\n# The default value is: UTF-8.\n\nDOXYFILE_ENCODING      = UTF-8\n\n# The PROJECT_NAME tag is a single word (or a sequence of words surrounded by\n# double-quotes, unless you are using Doxywizard) that should identify the\n# project for which the documentation is generated. This name is used in the\n# title of most generated pages and in a few other places.\n# The default value is: My Project.\n\nPROJECT_NAME           = \"My Project\"\n\n# The PROJECT_NUMBER tag can be used to enter a project or revision number. This\n# could be handy for archiving the generated documentation or if some version\n# control system is used.\n\nPROJECT_NUMBER         =\n\n# Using the PROJECT_BRIEF tag one can provide an optional one line description\n# for a project that appears at the top of each page and should give viewer a\n# quick idea about the purpose of the project. Keep the description short.\n\nPROJECT_BRIEF          =\n\n# With the PROJECT_LOGO tag one can specify a logo or an icon that is included\n# in the documentation. The maximum height of the logo should not exceed 55\n# pixels and the maximum width should not exceed 200 pixels. Doxygen will copy\n# the logo to the output directory.\n\nPROJECT_LOGO           =\n\n# The OUTPUT_DIRECTORY tag is used to specify the (relative or absolute) path\n# into which the generated documentation will be written. If a relative path is\n# entered, it will be relative to the location where doxygen was started. If\n# left blank the current directory will be used.\n\nOUTPUT_DIRECTORY       = doc/\n\n# If the CREATE_SUBDIRS tag is set to YES then doxygen will create 4096 sub-\n# directories (in 2 levels) under the output directory of each output format and\n# will distribute the generated files over these directories. Enabling this\n# option can be useful when feeding doxygen a huge amount of source files, where\n# putting all generated files in the same directory would otherwise causes\n# performance problems for the file system.\n# The default value is: NO.\n\nCREATE_SUBDIRS         = NO\n\n# If the ALLOW_UNICODE_NAMES tag is set to YES, doxygen will allow non-ASCII\n# characters to appear in the names of generated files. If set to NO, non-ASCII\n# characters will be escaped, for example _xE3_x81_x84 will be used for Unicode\n# U+3044.\n# The default value is: NO.\n\nALLOW_UNICODE_NAMES    = NO\n\n# The OUTPUT_LANGUAGE tag is used to specify the language in which all\n# documentation generated by doxygen is written. Doxygen will use this\n# information to generate all constant output in the proper language.\n# Possible values are: Afrikaans, Arabic, Armenian, Brazilian, Catalan, Chinese,\n# Chinese-Traditional, Croatian, Czech, Danish, Dutch, English (United States),\n# Esperanto, Farsi (Persian), Finnish, French, German, Greek, Hungarian,\n# Indonesian, Italian, Japanese, Japanese-en (Japanese with English messages),\n# Korean, Korean-en (Korean with English messages), Latvian, Lithuanian,\n# Macedonian, Norwegian, Persian (Farsi), Polish, Portuguese, Romanian, Russian,\n# Serbian, Serbian-Cyrillic, Slovak, Slovene, Spanish, Swedish, Turkish,\n# Ukrainian and Vietnamese.\n# The default value is: English.\n\nOUTPUT_LANGUAGE        = English\n\n# If the BRIEF_MEMBER_DESC tag is set to YES, doxygen will include brief member\n# descriptions after the members that are listed in the file and class\n# documentation (similar to Javadoc). Set to NO to disable this.\n# The default value is: YES.\n\nBRIEF_MEMBER_DESC      = YES\n\n# If the REPEAT_BRIEF tag is set to YES, doxygen will prepend the brief\n# description of a member or function before the detailed description\n#\n# Note: If both HIDE_UNDOC_MEMBERS and BRIEF_MEMBER_DESC are set to NO, the\n# brief descriptions will be completely suppressed.\n# The default value is: YES.\n\nREPEAT_BRIEF           = YES\n\n# This tag implements a quasi-intelligent brief description abbreviator that is\n# used to form the text in various listings. Each string in this list, if found\n# as the leading text of the brief description, will be stripped from the text\n# and the result, after processing the whole list, is used as the annotated\n# text. Otherwise, the brief description is used as-is. If left blank, the\n# following values are used ($name is automatically replaced with the name of\n# the entity):The $name class, The $name widget, The $name file, is, provides,\n# specifies, contains, represents, a, an and the.\n\nABBREVIATE_BRIEF       = \"The $name class\" \\\n                         \"The $name widget\" \\\n                         \"The $name file\" \\\n                         is \\\n                         provides \\\n                         specifies \\\n                         contains \\\n                         represents \\\n                         a \\\n                         an \\\n                         the\n\n# If the ALWAYS_DETAILED_SEC and REPEAT_BRIEF tags are both set to YES then\n# doxygen will generate a detailed section even if there is only a brief\n# description.\n# The default value is: NO.\n\nALWAYS_DETAILED_SEC    = NO\n\n# If the INLINE_INHERITED_MEMB tag is set to YES, doxygen will show all\n# inherited members of a class in the documentation of that class as if those\n# members were ordinary class members. Constructors, destructors and assignment\n# operators of the base classes will not be shown.\n# The default value is: NO.\n\nINLINE_INHERITED_MEMB  = NO\n\n# If the FULL_PATH_NAMES tag is set to YES, doxygen will prepend the full path\n# before files name in the file list and in the header files. If set to NO the\n# shortest path that makes the file name unique will be used\n# The default value is: YES.\n\nFULL_PATH_NAMES        = YES\n\n# The STRIP_FROM_PATH tag can be used to strip a user-defined part of the path.\n# Stripping is only done if one of the specified strings matches the left-hand\n# part of the path. The tag can be used to show relative paths in the file list.\n# If left blank the directory from which doxygen is run is used as the path to\n# strip.\n#\n# Note that you can specify absolute paths here, but also relative paths, which\n# will be relative from the directory where doxygen is started.\n# This tag requires that the tag FULL_PATH_NAMES is set to YES.\n\nSTRIP_FROM_PATH        =\n\n# The STRIP_FROM_INC_PATH tag can be used to strip a user-defined part of the\n# path mentioned in the documentation of a class, which tells the reader which\n# header file to include in order to use a class. If left blank only the name of\n# the header file containing the class definition is used. Otherwise one should\n# specify the list of include paths that are normally passed to the compiler\n# using the -I flag.\n\nSTRIP_FROM_INC_PATH    =\n\n# If the SHORT_NAMES tag is set to YES, doxygen will generate much shorter (but\n# less readable) file names. This can be useful is your file systems doesn't\n# support long names like on DOS, Mac, or CD-ROM.\n# The default value is: NO.\n\nSHORT_NAMES            = NO\n\n# If the JAVADOC_AUTOBRIEF tag is set to YES then doxygen will interpret the\n# first line (until the first dot) of a Javadoc-style comment as the brief\n# description. If set to NO, the Javadoc-style will behave just like regular Qt-\n# style comments (thus requiring an explicit @brief command for a brief\n# description.)\n# The default value is: NO.\n\nJAVADOC_AUTOBRIEF      = NO\n\n# If the QT_AUTOBRIEF tag is set to YES then doxygen will interpret the first\n# line (until the first dot) of a Qt-style comment as the brief description. If\n# set to NO, the Qt-style will behave just like regular Qt-style comments (thus\n# requiring an explicit \\brief command for a brief description.)\n# The default value is: NO.\n\nQT_AUTOBRIEF           = NO\n\n# The MULTILINE_CPP_IS_BRIEF tag can be set to YES to make doxygen treat a\n# multi-line C++ special comment block (i.e. a block of //! or /// comments) as\n# a brief description. This used to be the default behavior. The new default is\n# to treat a multi-line C++ comment block as a detailed description. Set this\n# tag to YES if you prefer the old behavior instead.\n#\n# Note that setting this tag to YES also means that rational rose comments are\n# not recognized any more.\n# The default value is: NO.\n\nMULTILINE_CPP_IS_BRIEF = NO\n\n# If the INHERIT_DOCS tag is set to YES then an undocumented member inherits the\n# documentation from any documented member that it re-implements.\n# The default value is: YES.\n\nINHERIT_DOCS           = YES\n\n# If the SEPARATE_MEMBER_PAGES tag is set to YES then doxygen will produce a new\n# page for each member. If set to NO, the documentation of a member will be part\n# of the file/class/namespace that contains it.\n# The default value is: NO.\n\nSEPARATE_MEMBER_PAGES  = NO\n\n# The TAB_SIZE tag can be used to set the number of spaces in a tab. Doxygen\n# uses this value to replace tabs by spaces in code fragments.\n# Minimum value: 1, maximum value: 16, default value: 4.\n\nTAB_SIZE               = 4\n\n# This tag can be used to specify a number of aliases that act as commands in\n# the documentation. An alias has the form:\n# name=value\n# For example adding\n# \"sideeffect=@par Side Effects:\\n\"\n# will allow you to put the command \\sideeffect (or @sideeffect) in the\n# documentation, which will result in a user-defined paragraph with heading\n# \"Side Effects:\". You can put \\n's in the value part of an alias to insert\n# newlines.\n\nALIASES                =\n\n# This tag can be used to specify a number of word-keyword mappings (TCL only).\n# A mapping has the form \"name=value\". For example adding \"class=itcl::class\"\n# will allow you to use the command class in the itcl::class meaning.\n\nTCL_SUBST              =\n\n# Set the OPTIMIZE_OUTPUT_FOR_C tag to YES if your project consists of C sources\n# only. Doxygen will then generate output that is more tailored for C. For\n# instance, some of the names that are used will be different. The list of all\n# members will be omitted, etc.\n# The default value is: NO.\n\nOPTIMIZE_OUTPUT_FOR_C  = NO\n\n# Set the OPTIMIZE_OUTPUT_JAVA tag to YES if your project consists of Java or\n# Python sources only. Doxygen will then generate output that is more tailored\n# for that language. For instance, namespaces will be presented as packages,\n# qualified scopes will look different, etc.\n# The default value is: NO.\n\nOPTIMIZE_OUTPUT_JAVA   = YES\n\n# Set the OPTIMIZE_FOR_FORTRAN tag to YES if your project consists of Fortran\n# sources. Doxygen will then generate output that is tailored for Fortran.\n# The default value is: NO.\n\nOPTIMIZE_FOR_FORTRAN   = NO\n\n# Set the OPTIMIZE_OUTPUT_VHDL tag to YES if your project consists of VHDL\n# sources. Doxygen will then generate output that is tailored for VHDL.\n# The default value is: NO.\n\nOPTIMIZE_OUTPUT_VHDL   = NO\n\n# Doxygen selects the parser to use depending on the extension of the files it\n# parses. With this tag you can assign which parser to use for a given\n# extension. Doxygen has a built-in mapping, but you can override or extend it\n# using this tag. The format is ext=language, where ext is a file extension, and\n# language is one of the parsers supported by doxygen: IDL, Java, Javascript,\n# C#, C, C++, D, PHP, Objective-C, Python, Fortran (fixed format Fortran:\n# FortranFixed, free formatted Fortran: FortranFree, unknown formatted Fortran:\n# Fortran. In the later case the parser tries to guess whether the code is fixed\n# or free formatted code, this is the default for Fortran type files), VHDL. For\n# instance to make doxygen treat .inc files as Fortran files (default is PHP),\n# and .f files as C (default is Fortran), use: inc=Fortran f=C.\n#\n# Note: For files without extension you can use no_extension as a placeholder.\n#\n# Note that for custom extensions you also need to set FILE_PATTERNS otherwise\n# the files are not read by doxygen.\n\nEXTENSION_MAPPING      =\n\n# If the MARKDOWN_SUPPORT tag is enabled then doxygen pre-processes all comments\n# according to the Markdown format, which allows for more readable\n# documentation. See http://daringfireball.net/projects/markdown/ for details.\n# The output of markdown processing is further processed by doxygen, so you can\n# mix doxygen, HTML, and XML commands with Markdown formatting. Disable only in\n# case of backward compatibilities issues.\n# The default value is: YES.\n\nMARKDOWN_SUPPORT       = YES\n\n# When the TOC_INCLUDE_HEADINGS tag is set to a non-zero value, all headings up\n# to that level are automatically included in the table of contents, even if\n# they do not have an id attribute.\n# Note: This feature currently applies only to Markdown headings.\n# Minimum value: 0, maximum value: 99, default value: 0.\n# This tag requires that the tag MARKDOWN_SUPPORT is set to YES.\n\nTOC_INCLUDE_HEADINGS   = 0\n\n# When enabled doxygen tries to link words that correspond to documented\n# classes, or namespaces to their corresponding documentation. Such a link can\n# be prevented in individual cases by putting a % sign in front of the word or\n# globally by setting AUTOLINK_SUPPORT to NO.\n# The default value is: YES.\n\nAUTOLINK_SUPPORT       = YES\n\n# If you use STL classes (i.e. std::string, std::vector, etc.) but do not want\n# to include (a tag file for) the STL sources as input, then you should set this\n# tag to YES in order to let doxygen match functions declarations and\n# definitions whose arguments contain STL classes (e.g. func(std::string);\n# versus func(std::string) {}). This also make the inheritance and collaboration\n# diagrams that involve STL classes more complete and accurate.\n# The default value is: NO.\n\nBUILTIN_STL_SUPPORT    = NO\n\n# If you use Microsoft's C++/CLI language, you should set this option to YES to\n# enable parsing support.\n# The default value is: NO.\n\nCPP_CLI_SUPPORT        = NO\n\n# Set the SIP_SUPPORT tag to YES if your project consists of sip (see:\n# http://www.riverbankcomputing.co.uk/software/sip/intro) sources only. Doxygen\n# will parse them like normal C++ but will assume all classes use public instead\n# of private inheritance when no explicit protection keyword is present.\n# The default value is: NO.\n\nSIP_SUPPORT            = NO\n\n# For Microsoft's IDL there are propget and propput attributes to indicate\n# getter and setter methods for a property. Setting this option to YES will make\n# doxygen to replace the get and set methods by a property in the documentation.\n# This will only work if the methods are indeed getting or setting a simple\n# type. If this is not the case, or you want to show the methods anyway, you\n# should set this option to NO.\n# The default value is: YES.\n\nIDL_PROPERTY_SUPPORT   = YES\n\n# If member grouping is used in the documentation and the DISTRIBUTE_GROUP_DOC\n# tag is set to YES then doxygen will reuse the documentation of the first\n# member in the group (if any) for the other members of the group. By default\n# all members of a group must be documented explicitly.\n# The default value is: NO.\n\nDISTRIBUTE_GROUP_DOC   = NO\n\n# If one adds a struct or class to a group and this option is enabled, then also\n# any nested class or struct is added to the same group. By default this option\n# is disabled and one has to add nested compounds explicitly via \\ingroup.\n# The default value is: NO.\n\nGROUP_NESTED_COMPOUNDS = NO\n\n# Set the SUBGROUPING tag to YES to allow class member groups of the same type\n# (for instance a group of public functions) to be put as a subgroup of that\n# type (e.g. under the Public Functions section). Set it to NO to prevent\n# subgrouping. Alternatively, this can be done per class using the\n# \\nosubgrouping command.\n# The default value is: YES.\n\nSUBGROUPING            = YES\n\n# When the INLINE_GROUPED_CLASSES tag is set to YES, classes, structs and unions\n# are shown inside the group in which they are included (e.g. using \\ingroup)\n# instead of on a separate page (for HTML and Man pages) or section (for LaTeX\n# and RTF).\n#\n# Note that this feature does not work in combination with\n# SEPARATE_MEMBER_PAGES.\n# The default value is: NO.\n\nINLINE_GROUPED_CLASSES = NO\n\n# When the INLINE_SIMPLE_STRUCTS tag is set to YES, structs, classes, and unions\n# with only public data fields or simple typedef fields will be shown inline in\n# the documentation of the scope in which they are defined (i.e. file,\n# namespace, or group documentation), provided this scope is documented. If set\n# to NO, structs, classes, and unions are shown on a separate page (for HTML and\n# Man pages) or section (for LaTeX and RTF).\n# The default value is: NO.\n\nINLINE_SIMPLE_STRUCTS  = NO\n\n# When TYPEDEF_HIDES_STRUCT tag is enabled, a typedef of a struct, union, or\n# enum is documented as struct, union, or enum with the name of the typedef. So\n# typedef struct TypeS {} TypeT, will appear in the documentation as a struct\n# with name TypeT. When disabled the typedef will appear as a member of a file,\n# namespace, or class. And the struct will be named TypeS. This can typically be\n# useful for C code in case the coding convention dictates that all compound\n# types are typedef'ed and only the typedef is referenced, never the tag name.\n# The default value is: NO.\n\nTYPEDEF_HIDES_STRUCT   = NO\n\n# The size of the symbol lookup cache can be set using LOOKUP_CACHE_SIZE. This\n# cache is used to resolve symbols given their name and scope. Since this can be\n# an expensive process and often the same symbol appears multiple times in the\n# code, doxygen keeps a cache of pre-resolved symbols. If the cache is too small\n# doxygen will become slower. If the cache is too large, memory is wasted. The\n# cache size is given by this formula: 2^(16+LOOKUP_CACHE_SIZE). The valid range\n# is 0..9, the default is 0, corresponding to a cache size of 2^16=65536\n# symbols. At the end of a run doxygen will report the cache usage and suggest\n# the optimal cache size from a speed point of view.\n# Minimum value: 0, maximum value: 9, default value: 0.\n\nLOOKUP_CACHE_SIZE      = 0\n\n#---------------------------------------------------------------------------\n# Build related configuration options\n#---------------------------------------------------------------------------\n\n# If the EXTRACT_ALL tag is set to YES, doxygen will assume all entities in\n# documentation are documented, even if no documentation was available. Private\n# class members and static file members will be hidden unless the\n# EXTRACT_PRIVATE respectively EXTRACT_STATIC tags are set to YES.\n# Note: This will also disable the warnings about undocumented members that are\n# normally produced when WARNINGS is set to YES.\n# The default value is: NO.\n\nEXTRACT_ALL            = YES\n\n# If the EXTRACT_PRIVATE tag is set to YES, all private members of a class will\n# be included in the documentation.\n# The default value is: NO.\n\nEXTRACT_PRIVATE        = NO\n\n# If the EXTRACT_PACKAGE tag is set to YES, all members with package or internal\n# scope will be included in the documentation.\n# The default value is: NO.\n\nEXTRACT_PACKAGE        = NO\n\n# If the EXTRACT_STATIC tag is set to YES, all static members of a file will be\n# included in the documentation.\n# The default value is: NO.\n\nEXTRACT_STATIC         = NO\n\n# If the EXTRACT_LOCAL_CLASSES tag is set to YES, classes (and structs) defined\n# locally in source files will be included in the documentation. If set to NO,\n# only classes defined in header files are included. Does not have any effect\n# for Java sources.\n# The default value is: YES.\n\nEXTRACT_LOCAL_CLASSES  = YES\n\n# This flag is only useful for Objective-C code. If set to YES, local methods,\n# which are defined in the implementation section but not in the interface are\n# included in the documentation. If set to NO, only methods in the interface are\n# included.\n# The default value is: NO.\n\nEXTRACT_LOCAL_METHODS  = NO\n\n# If this flag is set to YES, the members of anonymous namespaces will be\n# extracted and appear in the documentation as a namespace called\n# 'anonymous_namespace{file}', where file will be replaced with the base name of\n# the file that contains the anonymous namespace. By default anonymous namespace\n# are hidden.\n# The default value is: NO.\n\nEXTRACT_ANON_NSPACES   = NO\n\n# If the HIDE_UNDOC_MEMBERS tag is set to YES, doxygen will hide all\n# undocumented members inside documented classes or files. If set to NO these\n# members will be included in the various overviews, but no documentation\n# section is generated. This option has no effect if EXTRACT_ALL is enabled.\n# The default value is: NO.\n\nHIDE_UNDOC_MEMBERS     = NO\n\n# If the HIDE_UNDOC_CLASSES tag is set to YES, doxygen will hide all\n# undocumented classes that are normally visible in the class hierarchy. If set\n# to NO, these classes will be included in the various overviews. This option\n# has no effect if EXTRACT_ALL is enabled.\n# The default value is: NO.\n\nHIDE_UNDOC_CLASSES     = NO\n\n# If the HIDE_FRIEND_COMPOUNDS tag is set to YES, doxygen will hide all friend\n# (class|struct|union) declarations. If set to NO, these declarations will be\n# included in the documentation.\n# The default value is: NO.\n\nHIDE_FRIEND_COMPOUNDS  = NO\n\n# If the HIDE_IN_BODY_DOCS tag is set to YES, doxygen will hide any\n# documentation blocks found inside the body of a function. If set to NO, these\n# blocks will be appended to the function's detailed documentation block.\n# The default value is: NO.\n\nHIDE_IN_BODY_DOCS      = NO\n\n# The INTERNAL_DOCS tag determines if documentation that is typed after a\n# \\internal command is included. If the tag is set to NO then the documentation\n# will be excluded. Set it to YES to include the internal documentation.\n# The default value is: NO.\n\nINTERNAL_DOCS          = NO\n\n# If the CASE_SENSE_NAMES tag is set to NO then doxygen will only generate file\n# names in lower-case letters. If set to YES, upper-case letters are also\n# allowed. This is useful if you have classes or files whose names only differ\n# in case and if your file system supports case sensitive file names. Windows\n# and Mac users are advised to set this option to NO.\n# The default value is: system dependent.\n\nCASE_SENSE_NAMES       = YES\n\n# If the HIDE_SCOPE_NAMES tag is set to NO then doxygen will show members with\n# their full class and namespace scopes in the documentation. If set to YES, the\n# scope will be hidden.\n# The default value is: NO.\n\nHIDE_SCOPE_NAMES       = NO\n\n# If the HIDE_COMPOUND_REFERENCE tag is set to NO (default) then doxygen will\n# append additional text to a page's title, such as Class Reference. If set to\n# YES the compound reference will be hidden.\n# The default value is: NO.\n\nHIDE_COMPOUND_REFERENCE= NO\n\n# If the SHOW_INCLUDE_FILES tag is set to YES then doxygen will put a list of\n# the files that are included by a file in the documentation of that file.\n# The default value is: YES.\n\nSHOW_INCLUDE_FILES     = YES\n\n# If the SHOW_GROUPED_MEMB_INC tag is set to YES then Doxygen will add for each\n# grouped member an include statement to the documentation, telling the reader\n# which file to include in order to use the member.\n# The default value is: NO.\n\nSHOW_GROUPED_MEMB_INC  = NO\n\n# If the FORCE_LOCAL_INCLUDES tag is set to YES then doxygen will list include\n# files with double quotes in the documentation rather than with sharp brackets.\n# The default value is: NO.\n\nFORCE_LOCAL_INCLUDES   = NO\n\n# If the INLINE_INFO tag is set to YES then a tag [inline] is inserted in the\n# documentation for inline members.\n# The default value is: YES.\n\nINLINE_INFO            = YES\n\n# If the SORT_MEMBER_DOCS tag is set to YES then doxygen will sort the\n# (detailed) documentation of file and class members alphabetically by member\n# name. If set to NO, the members will appear in declaration order.\n# The default value is: YES.\n\nSORT_MEMBER_DOCS       = YES\n\n# If the SORT_BRIEF_DOCS tag is set to YES then doxygen will sort the brief\n# descriptions of file, namespace and class members alphabetically by member\n# name. If set to NO, the members will appear in declaration order. Note that\n# this will also influence the order of the classes in the class list.\n# The default value is: NO.\n\nSORT_BRIEF_DOCS        = NO\n\n# If the SORT_MEMBERS_CTORS_1ST tag is set to YES then doxygen will sort the\n# (brief and detailed) documentation of class members so that constructors and\n# destructors are listed first. If set to NO the constructors will appear in the\n# respective orders defined by SORT_BRIEF_DOCS and SORT_MEMBER_DOCS.\n# Note: If SORT_BRIEF_DOCS is set to NO this option is ignored for sorting brief\n# member documentation.\n# Note: If SORT_MEMBER_DOCS is set to NO this option is ignored for sorting\n# detailed member documentation.\n# The default value is: NO.\n\nSORT_MEMBERS_CTORS_1ST = NO\n\n# If the SORT_GROUP_NAMES tag is set to YES then doxygen will sort the hierarchy\n# of group names into alphabetical order. If set to NO the group names will\n# appear in their defined order.\n# The default value is: NO.\n\nSORT_GROUP_NAMES       = NO\n\n# If the SORT_BY_SCOPE_NAME tag is set to YES, the class list will be sorted by\n# fully-qualified names, including namespaces. If set to NO, the class list will\n# be sorted only by class name, not including the namespace part.\n# Note: This option is not very useful if HIDE_SCOPE_NAMES is set to YES.\n# Note: This option applies only to the class list, not to the alphabetical\n# list.\n# The default value is: NO.\n\nSORT_BY_SCOPE_NAME     = NO\n\n# If the STRICT_PROTO_MATCHING option is enabled and doxygen fails to do proper\n# type resolution of all parameters of a function it will reject a match between\n# the prototype and the implementation of a member function even if there is\n# only one candidate or it is obvious which candidate to choose by doing a\n# simple string match. By disabling STRICT_PROTO_MATCHING doxygen will still\n# accept a match between prototype and implementation in such cases.\n# The default value is: NO.\n\nSTRICT_PROTO_MATCHING  = NO\n\n# The GENERATE_TODOLIST tag can be used to enable (YES) or disable (NO) the todo\n# list. This list is created by putting \\todo commands in the documentation.\n# The default value is: YES.\n\nGENERATE_TODOLIST      = NO\n\n# The GENERATE_TESTLIST tag can be used to enable (YES) or disable (NO) the test\n# list. This list is created by putting \\test commands in the documentation.\n# The default value is: YES.\n\nGENERATE_TESTLIST      = NO\n\n# The GENERATE_BUGLIST tag can be used to enable (YES) or disable (NO) the bug\n# list. This list is created by putting \\bug commands in the documentation.\n# The default value is: YES.\n\nGENERATE_BUGLIST       = NO\n\n# The GENERATE_DEPRECATEDLIST tag can be used to enable (YES) or disable (NO)\n# the deprecated list. This list is created by putting \\deprecated commands in\n# the documentation.\n# The default value is: YES.\n\nGENERATE_DEPRECATEDLIST= YES\n\n# The ENABLED_SECTIONS tag can be used to enable conditional documentation\n# sections, marked by \\if <section_label> ... \\endif and \\cond <section_label>\n# ... \\endcond blocks.\n\nENABLED_SECTIONS       =\n\n# The MAX_INITIALIZER_LINES tag determines the maximum number of lines that the\n# initial value of a variable or macro / define can have for it to appear in the\n# documentation. If the initializer consists of more lines than specified here\n# it will be hidden. Use a value of 0 to hide initializers completely. The\n# appearance of the value of individual variables and macros / defines can be\n# controlled using \\showinitializer or \\hideinitializer command in the\n# documentation regardless of this setting.\n# Minimum value: 0, maximum value: 10000, default value: 30.\n\nMAX_INITIALIZER_LINES  = 30\n\n# Set the SHOW_USED_FILES tag to NO to disable the list of files generated at\n# the bottom of the documentation of classes and structs. If set to YES, the\n# list will mention the files that were used to generate the documentation.\n# The default value is: YES.\n\nSHOW_USED_FILES        = YES\n\n# Set the SHOW_FILES tag to NO to disable the generation of the Files page. This\n# will remove the Files entry from the Quick Index and from the Folder Tree View\n# (if specified).\n# The default value is: YES.\n\nSHOW_FILES             = YES\n\n# Set the SHOW_NAMESPACES tag to NO to disable the generation of the Namespaces\n# page. This will remove the Namespaces entry from the Quick Index and from the\n# Folder Tree View (if specified).\n# The default value is: YES.\n\nSHOW_NAMESPACES        = YES\n\n# The FILE_VERSION_FILTER tag can be used to specify a program or script that\n# doxygen should invoke to get the current version for each file (typically from\n# the version control system). Doxygen will invoke the program by executing (via\n# popen()) the command command input-file, where command is the value of the\n# FILE_VERSION_FILTER tag, and input-file is the name of an input file provided\n# by doxygen. Whatever the program writes to standard output is used as the file\n# version. For an example see the documentation.\n\nFILE_VERSION_FILTER    =\n\n# The LAYOUT_FILE tag can be used to specify a layout file which will be parsed\n# by doxygen. The layout file controls the global structure of the generated\n# output files in an output format independent way. To create the layout file\n# that represents doxygen's defaults, run doxygen with the -l option. You can\n# optionally specify a file name after the option, if omitted DoxygenLayout.xml\n# will be used as the name of the layout file.\n#\n# Note that if you run doxygen from a directory containing a file called\n# DoxygenLayout.xml, doxygen will parse it automatically even if the LAYOUT_FILE\n# tag is left empty.\n\nLAYOUT_FILE            =\n\n# The CITE_BIB_FILES tag can be used to specify one or more bib files containing\n# the reference definitions. This must be a list of .bib files. The .bib\n# extension is automatically appended if omitted. This requires the bibtex tool\n# to be installed. See also http://en.wikipedia.org/wiki/BibTeX for more info.\n# For LaTeX the style of the bibliography can be controlled using\n# LATEX_BIB_STYLE. To use this feature you need bibtex and perl available in the\n# search path. See also \\cite for info how to create references.\n\nCITE_BIB_FILES         =\n\n#---------------------------------------------------------------------------\n# Configuration options related to warning and progress messages\n#---------------------------------------------------------------------------\n\n# The QUIET tag can be used to turn on/off the messages that are generated to\n# standard output by doxygen. If QUIET is set to YES this implies that the\n# messages are off.\n# The default value is: NO.\n\nQUIET                  = NO\n\n# The WARNINGS tag can be used to turn on/off the warning messages that are\n# generated to standard error (stderr) by doxygen. If WARNINGS is set to YES\n# this implies that the warnings are on.\n#\n# Tip: Turn warnings on while writing the documentation.\n# The default value is: YES.\n\nWARNINGS               = YES\n\n# If the WARN_IF_UNDOCUMENTED tag is set to YES then doxygen will generate\n# warnings for undocumented members. If EXTRACT_ALL is set to YES then this flag\n# will automatically be disabled.\n# The default value is: YES.\n\nWARN_IF_UNDOCUMENTED   = YES\n\n# If the WARN_IF_DOC_ERROR tag is set to YES, doxygen will generate warnings for\n# potential errors in the documentation, such as not documenting some parameters\n# in a documented function, or documenting parameters that don't exist or using\n# markup commands wrongly.\n# The default value is: YES.\n\nWARN_IF_DOC_ERROR      = YES\n\n# This WARN_NO_PARAMDOC option can be enabled to get warnings for functions that\n# are documented, but have no documentation for their parameters or return\n# value. If set to NO, doxygen will only warn about wrong or incomplete\n# parameter documentation, but not about the absence of documentation.\n# The default value is: NO.\n\nWARN_NO_PARAMDOC       = NO\n\n# If the WARN_AS_ERROR tag is set to YES then doxygen will immediately stop when\n# a warning is encountered.\n# The default value is: NO.\n\nWARN_AS_ERROR          = NO\n\n# The WARN_FORMAT tag determines the format of the warning messages that doxygen\n# can produce. The string should contain the $file, $line, and $text tags, which\n# will be replaced by the file and line number from which the warning originated\n# and the warning text. Optionally the format may contain $version, which will\n# be replaced by the version of the file (if it could be obtained via\n# FILE_VERSION_FILTER)\n# The default value is: $file:$line: $text.\n\nWARN_FORMAT            = \"$file:$line: $text\"\n\n# The WARN_LOGFILE tag can be used to specify a file to which warning and error\n# messages should be written. If left blank the output is written to standard\n# error (stderr).\n\nWARN_LOGFILE           =\n\n#---------------------------------------------------------------------------\n# Configuration options related to the input files\n#---------------------------------------------------------------------------\n\n# The INPUT tag is used to specify the files and/or directories that contain\n# documented source files. You may enter file names like myfile.cpp or\n# directories like /usr/src/myproject. Separate the files or directories with\n# spaces. See also FILE_PATTERNS and EXTENSION_MAPPING\n# Note: If this tag is empty the current directory is searched.\n\nINPUT                  = native_client/java/libdeepspeech/src/main/java/org/deepspeech/libdeepspeech/ native_client/java/libdeepspeech/src/main/java/org/deepspeech/libdeepspeech_doc/\n\n# This tag can be used to specify the character encoding of the source files\n# that doxygen parses. Internally doxygen uses the UTF-8 encoding. Doxygen uses\n# libiconv (or the iconv built into libc) for the transcoding. See the libiconv\n# documentation (see: http://www.gnu.org/software/libiconv) for the list of\n# possible encodings.\n# The default value is: UTF-8.\n\nINPUT_ENCODING         = UTF-8\n\n# If the value of the INPUT tag contains directories, you can use the\n# FILE_PATTERNS tag to specify one or more wildcard patterns (like *.cpp and\n# *.h) to filter out the source-files in the directories.\n#\n# Note that for custom extensions or not directly supported extensions you also\n# need to set EXTENSION_MAPPING for the extension otherwise the files are not\n# read by doxygen.\n#\n# If left blank the following patterns are tested:*.c, *.cc, *.cxx, *.cpp,\n# *.c++, *.java, *.ii, *.ixx, *.ipp, *.i++, *.inl, *.idl, *.ddl, *.odl, *.h,\n# *.hh, *.hxx, *.hpp, *.h++, *.cs, *.d, *.php, *.php4, *.php5, *.phtml, *.inc,\n# *.m, *.markdown, *.md, *.mm, *.dox, *.py, *.pyw, *.f90, *.f95, *.f03, *.f08,\n# *.f, *.for, *.tcl, *.vhd, *.vhdl, *.ucf and *.qsf.\n\nFILE_PATTERNS          = *.c \\\n                         *.cc \\\n                         *.cxx \\\n                         *.cpp \\\n                         *.c++ \\\n                         *.java \\\n                         *.ii \\\n                         *.ixx \\\n                         *.ipp \\\n                         *.i++ \\\n                         *.inl \\\n                         *.idl \\\n                         *.ddl \\\n                         *.odl \\\n                         *.h \\\n                         *.hh \\\n                         *.hxx \\\n                         *.hpp \\\n                         *.h++ \\\n                         *.cs \\\n                         *.d \\\n                         *.php \\\n                         *.php4 \\\n                         *.php5 \\\n                         *.phtml \\\n                         *.inc \\\n                         *.m \\\n                         *.markdown \\\n                         *.md \\\n                         *.mm \\\n                         *.dox \\\n                         *.py \\\n                         *.pyw \\\n                         *.f90 \\\n                         *.f95 \\\n                         *.f03 \\\n                         *.f08 \\\n                         *.f \\\n                         *.for \\\n                         *.tcl \\\n                         *.vhd \\\n                         *.vhdl \\\n                         *.ucf \\\n                         *.qsf\n\n# The RECURSIVE tag can be used to specify whether or not subdirectories should\n# be searched for input files as well.\n# The default value is: NO.\n\nRECURSIVE              = NO\n\n# The EXCLUDE tag can be used to specify files and/or directories that should be\n# excluded from the INPUT source files. This way you can easily exclude a\n# subdirectory from a directory tree whose root is specified with the INPUT tag.\n#\n# Note that relative paths are relative to the directory from which doxygen is\n# run.\n\nEXCLUDE                =\n\n# The EXCLUDE_SYMLINKS tag can be used to select whether or not files or\n# directories that are symbolic links (a Unix file system feature) are excluded\n# from the input.\n# The default value is: NO.\n\nEXCLUDE_SYMLINKS       = NO\n\n# If the value of the INPUT tag contains directories, you can use the\n# EXCLUDE_PATTERNS tag to specify one or more wildcard patterns to exclude\n# certain files from those directories.\n#\n# Note that the wildcards are matched against the file with absolute path, so to\n# exclude all test directories for example use the pattern */test/*\n\nEXCLUDE_PATTERNS       =\n\n# The EXCLUDE_SYMBOLS tag can be used to specify one or more symbol names\n# (namespaces, classes, functions, etc.) that should be excluded from the\n# output. The symbol name can be a fully qualified name, a word, or if the\n# wildcard * is used, a substring. Examples: ANamespace, AClass,\n# AClass::ANamespace, ANamespace::*Test\n#\n# Note that the wildcards are matched against the file with absolute path, so to\n# exclude all test directories use the pattern */test/*\n\nEXCLUDE_SYMBOLS        =\n\n# The EXAMPLE_PATH tag can be used to specify one or more files or directories\n# that contain example code fragments that are included (see the \\include\n# command).\n\nEXAMPLE_PATH           =\n\n# If the value of the EXAMPLE_PATH tag contains directories, you can use the\n# EXAMPLE_PATTERNS tag to specify one or more wildcard pattern (like *.cpp and\n# *.h) to filter out the source-files in the directories. If left blank all\n# files are included.\n\nEXAMPLE_PATTERNS       = *\n\n# If the EXAMPLE_RECURSIVE tag is set to YES then subdirectories will be\n# searched for input files to be used with the \\include or \\dontinclude commands\n# irrespective of the value of the RECURSIVE tag.\n# The default value is: NO.\n\nEXAMPLE_RECURSIVE      = NO\n\n# The IMAGE_PATH tag can be used to specify one or more files or directories\n# that contain images that are to be included in the documentation (see the\n# \\image command).\n\nIMAGE_PATH             =\n\n# The INPUT_FILTER tag can be used to specify a program that doxygen should\n# invoke to filter for each input file. Doxygen will invoke the filter program\n# by executing (via popen()) the command:\n#\n# <filter> <input-file>\n#\n# where <filter> is the value of the INPUT_FILTER tag, and <input-file> is the\n# name of an input file. Doxygen will then use the output that the filter\n# program writes to standard output. If FILTER_PATTERNS is specified, this tag\n# will be ignored.\n#\n# Note that the filter must not add or remove lines; it is applied before the\n# code is scanned, but not when the output code is generated. If lines are added\n# or removed, the anchors will not be placed correctly.\n#\n# Note that for custom extensions or not directly supported extensions you also\n# need to set EXTENSION_MAPPING for the extension otherwise the files are not\n# properly processed by doxygen.\n\nINPUT_FILTER           =\n\n# The FILTER_PATTERNS tag can be used to specify filters on a per file pattern\n# basis. Doxygen will compare the file name with each pattern and apply the\n# filter if there is a match. The filters are a list of the form: pattern=filter\n# (like *.cpp=my_cpp_filter). See INPUT_FILTER for further information on how\n# filters are used. If the FILTER_PATTERNS tag is empty or if none of the\n# patterns match the file name, INPUT_FILTER is applied.\n#\n# Note that for custom extensions or not directly supported extensions you also\n# need to set EXTENSION_MAPPING for the extension otherwise the files are not\n# properly processed by doxygen.\n\nFILTER_PATTERNS        =\n\n# If the FILTER_SOURCE_FILES tag is set to YES, the input filter (if set using\n# INPUT_FILTER) will also be used to filter the input files that are used for\n# producing the source files to browse (i.e. when SOURCE_BROWSER is set to YES).\n# The default value is: NO.\n\nFILTER_SOURCE_FILES    = NO\n\n# The FILTER_SOURCE_PATTERNS tag can be used to specify source filters per file\n# pattern. A pattern will override the setting for FILTER_PATTERN (if any) and\n# it is also possible to disable source filtering for a specific pattern using\n# *.ext= (so without naming a filter).\n# This tag requires that the tag FILTER_SOURCE_FILES is set to YES.\n\nFILTER_SOURCE_PATTERNS =\n\n# If the USE_MDFILE_AS_MAINPAGE tag refers to the name of a markdown file that\n# is part of the input, its contents will be placed on the main page\n# (index.html). This can be useful if you have a project on for instance GitHub\n# and want to reuse the introduction page also for the doxygen output.\n\nUSE_MDFILE_AS_MAINPAGE =\n\n#---------------------------------------------------------------------------\n# Configuration options related to source browsing\n#---------------------------------------------------------------------------\n\n# If the SOURCE_BROWSER tag is set to YES then a list of source files will be\n# generated. Documented entities will be cross-referenced with these sources.\n#\n# Note: To get rid of all source code in the generated output, make sure that\n# also VERBATIM_HEADERS is set to NO.\n# The default value is: NO.\n\nSOURCE_BROWSER         = NO\n\n# Setting the INLINE_SOURCES tag to YES will include the body of functions,\n# classes and enums directly into the documentation.\n# The default value is: NO.\n\nINLINE_SOURCES         = NO\n\n# Setting the STRIP_CODE_COMMENTS tag to YES will instruct doxygen to hide any\n# special comment blocks from generated source code fragments. Normal C, C++ and\n# Fortran comments will always remain visible.\n# The default value is: YES.\n\nSTRIP_CODE_COMMENTS    = YES\n\n# If the REFERENCED_BY_RELATION tag is set to YES then for each documented\n# function all documented functions referencing it will be listed.\n# The default value is: NO.\n\nREFERENCED_BY_RELATION = NO\n\n# If the REFERENCES_RELATION tag is set to YES then for each documented function\n# all documented entities called/used by that function will be listed.\n# The default value is: NO.\n\nREFERENCES_RELATION    = NO\n\n# If the REFERENCES_LINK_SOURCE tag is set to YES and SOURCE_BROWSER tag is set\n# to YES then the hyperlinks from functions in REFERENCES_RELATION and\n# REFERENCED_BY_RELATION lists will link to the source code. Otherwise they will\n# link to the documentation.\n# The default value is: YES.\n\nREFERENCES_LINK_SOURCE = YES\n\n# If SOURCE_TOOLTIPS is enabled (the default) then hovering a hyperlink in the\n# source code will show a tooltip with additional information such as prototype,\n# brief description and links to the definition and documentation. Since this\n# will make the HTML file larger and loading of large files a bit slower, you\n# can opt to disable this feature.\n# The default value is: YES.\n# This tag requires that the tag SOURCE_BROWSER is set to YES.\n\nSOURCE_TOOLTIPS        = YES\n\n# If the USE_HTAGS tag is set to YES then the references to source code will\n# point to the HTML generated by the htags(1) tool instead of doxygen built-in\n# source browser. The htags tool is part of GNU's global source tagging system\n# (see http://www.gnu.org/software/global/global.html). You will need version\n# 4.8.6 or higher.\n#\n# To use it do the following:\n# - Install the latest version of global\n# - Enable SOURCE_BROWSER and USE_HTAGS in the config file\n# - Make sure the INPUT points to the root of the source tree\n# - Run doxygen as normal\n#\n# Doxygen will invoke htags (and that will in turn invoke gtags), so these\n# tools must be available from the command line (i.e. in the search path).\n#\n# The result: instead of the source browser generated by doxygen, the links to\n# source code will now point to the output of htags.\n# The default value is: NO.\n# This tag requires that the tag SOURCE_BROWSER is set to YES.\n\nUSE_HTAGS              = NO\n\n# If the VERBATIM_HEADERS tag is set the YES then doxygen will generate a\n# verbatim copy of the header file for each class for which an include is\n# specified. Set to NO to disable this.\n# See also: Section \\class.\n# The default value is: YES.\n\nVERBATIM_HEADERS       = YES\n\n# If the CLANG_ASSISTED_PARSING tag is set to YES then doxygen will use the\n# clang parser (see: http://clang.llvm.org/) for more accurate parsing at the\n# cost of reduced performance. This can be particularly helpful with template\n# rich C++ code for which doxygen's built-in parser lacks the necessary type\n# information.\n# Note: The availability of this option depends on whether or not doxygen was\n# generated with the -Duse-libclang=ON option for CMake.\n# The default value is: NO.\n\nCLANG_ASSISTED_PARSING = NO\n\n# If clang assisted parsing is enabled you can provide the compiler with command\n# line options that you would normally use when invoking the compiler. Note that\n# the include paths will already be set by doxygen for the files and directories\n# specified with INPUT and INCLUDE_PATH.\n# This tag requires that the tag CLANG_ASSISTED_PARSING is set to YES.\n\nCLANG_OPTIONS          =\n\n#---------------------------------------------------------------------------\n# Configuration options related to the alphabetical class index\n#---------------------------------------------------------------------------\n\n# If the ALPHABETICAL_INDEX tag is set to YES, an alphabetical index of all\n# compounds will be generated. Enable this if the project contains a lot of\n# classes, structs, unions or interfaces.\n# The default value is: YES.\n\nALPHABETICAL_INDEX     = YES\n\n# The COLS_IN_ALPHA_INDEX tag can be used to specify the number of columns in\n# which the alphabetical index list will be split.\n# Minimum value: 1, maximum value: 20, default value: 5.\n# This tag requires that the tag ALPHABETICAL_INDEX is set to YES.\n\nCOLS_IN_ALPHA_INDEX    = 5\n\n# In case all classes in a project start with a common prefix, all classes will\n# be put under the same header in the alphabetical index. The IGNORE_PREFIX tag\n# can be used to specify a prefix (or a list of prefixes) that should be ignored\n# while generating the index headers.\n# This tag requires that the tag ALPHABETICAL_INDEX is set to YES.\n\nIGNORE_PREFIX          =\n\n#---------------------------------------------------------------------------\n# Configuration options related to the HTML output\n#---------------------------------------------------------------------------\n\n# If the GENERATE_HTML tag is set to YES, doxygen will generate HTML output\n# The default value is: YES.\n\nGENERATE_HTML          = NO\n\n# The HTML_OUTPUT tag is used to specify where the HTML docs will be put. If a\n# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of\n# it.\n# The default directory is: html.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nHTML_OUTPUT            = html\n\n# The HTML_FILE_EXTENSION tag can be used to specify the file extension for each\n# generated HTML page (for example: .htm, .php, .asp).\n# The default value is: .html.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nHTML_FILE_EXTENSION    = .html\n\n# The HTML_HEADER tag can be used to specify a user-defined HTML header file for\n# each generated HTML page. If the tag is left blank doxygen will generate a\n# standard header.\n#\n# To get valid HTML the header file that includes any scripts and style sheets\n# that doxygen needs, which is dependent on the configuration options used (e.g.\n# the setting GENERATE_TREEVIEW). It is highly recommended to start with a\n# default header using\n# doxygen -w html new_header.html new_footer.html new_stylesheet.css\n# YourConfigFile\n# and then modify the file new_header.html. See also section \"Doxygen usage\"\n# for information on how to generate the default header that doxygen normally\n# uses.\n# Note: The header is subject to change so you typically have to regenerate the\n# default header when upgrading to a newer version of doxygen. For a description\n# of the possible markers and block names see the documentation.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nHTML_HEADER            =\n\n# The HTML_FOOTER tag can be used to specify a user-defined HTML footer for each\n# generated HTML page. If the tag is left blank doxygen will generate a standard\n# footer. See HTML_HEADER for more information on how to generate a default\n# footer and what special commands can be used inside the footer. See also\n# section \"Doxygen usage\" for information on how to generate the default footer\n# that doxygen normally uses.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nHTML_FOOTER            =\n\n# The HTML_STYLESHEET tag can be used to specify a user-defined cascading style\n# sheet that is used by each HTML page. It can be used to fine-tune the look of\n# the HTML output. If left blank doxygen will generate a default style sheet.\n# See also section \"Doxygen usage\" for information on how to generate the style\n# sheet that doxygen normally uses.\n# Note: It is recommended to use HTML_EXTRA_STYLESHEET instead of this tag, as\n# it is more robust and this tag (HTML_STYLESHEET) will in the future become\n# obsolete.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nHTML_STYLESHEET        =\n\n# The HTML_EXTRA_STYLESHEET tag can be used to specify additional user-defined\n# cascading style sheets that are included after the standard style sheets\n# created by doxygen. Using this option one can overrule certain style aspects.\n# This is preferred over using HTML_STYLESHEET since it does not replace the\n# standard style sheet and is therefore more robust against future updates.\n# Doxygen will copy the style sheet files to the output directory.\n# Note: The order of the extra style sheet files is of importance (e.g. the last\n# style sheet in the list overrules the setting of the previous ones in the\n# list). For an example see the documentation.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nHTML_EXTRA_STYLESHEET  =\n\n# The HTML_EXTRA_FILES tag can be used to specify one or more extra images or\n# other source files which should be copied to the HTML output directory. Note\n# that these files will be copied to the base HTML output directory. Use the\n# $relpath^ marker in the HTML_HEADER and/or HTML_FOOTER files to load these\n# files. In the HTML_STYLESHEET file, use the file name only. Also note that the\n# files will be copied as-is; there are no commands or markers available.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nHTML_EXTRA_FILES       =\n\n# The HTML_COLORSTYLE_HUE tag controls the color of the HTML output. Doxygen\n# will adjust the colors in the style sheet and background images according to\n# this color. Hue is specified as an angle on a colorwheel, see\n# http://en.wikipedia.org/wiki/Hue for more information. For instance the value\n# 0 represents red, 60 is yellow, 120 is green, 180 is cyan, 240 is blue, 300\n# purple, and 360 is red again.\n# Minimum value: 0, maximum value: 359, default value: 220.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nHTML_COLORSTYLE_HUE    = 220\n\n# The HTML_COLORSTYLE_SAT tag controls the purity (or saturation) of the colors\n# in the HTML output. For a value of 0 the output will use grayscales only. A\n# value of 255 will produce the most vivid colors.\n# Minimum value: 0, maximum value: 255, default value: 100.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nHTML_COLORSTYLE_SAT    = 100\n\n# The HTML_COLORSTYLE_GAMMA tag controls the gamma correction applied to the\n# luminance component of the colors in the HTML output. Values below 100\n# gradually make the output lighter, whereas values above 100 make the output\n# darker. The value divided by 100 is the actual gamma applied, so 80 represents\n# a gamma of 0.8, The value 220 represents a gamma of 2.2, and 100 does not\n# change the gamma.\n# Minimum value: 40, maximum value: 240, default value: 80.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nHTML_COLORSTYLE_GAMMA  = 80\n\n# If the HTML_TIMESTAMP tag is set to YES then the footer of each generated HTML\n# page will contain the date and time when the page was generated. Setting this\n# to YES can help to show when doxygen was last run and thus if the\n# documentation is up to date.\n# The default value is: NO.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nHTML_TIMESTAMP         = NO\n\n# If the HTML_DYNAMIC_SECTIONS tag is set to YES then the generated HTML\n# documentation will contain sections that can be hidden and shown after the\n# page has loaded.\n# The default value is: NO.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nHTML_DYNAMIC_SECTIONS  = NO\n\n# With HTML_INDEX_NUM_ENTRIES one can control the preferred number of entries\n# shown in the various tree structured indices initially; the user can expand\n# and collapse entries dynamically later on. Doxygen will expand the tree to\n# such a level that at most the specified number of entries are visible (unless\n# a fully collapsed tree already exceeds this amount). So setting the number of\n# entries 1 will produce a full collapsed tree by default. 0 is a special value\n# representing an infinite number of entries and will result in a full expanded\n# tree by default.\n# Minimum value: 0, maximum value: 9999, default value: 100.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nHTML_INDEX_NUM_ENTRIES = 100\n\n# If the GENERATE_DOCSET tag is set to YES, additional index files will be\n# generated that can be used as input for Apple's Xcode 3 integrated development\n# environment (see: http://developer.apple.com/tools/xcode/), introduced with\n# OSX 10.5 (Leopard). To create a documentation set, doxygen will generate a\n# Makefile in the HTML output directory. Running make will produce the docset in\n# that directory and running make install will install the docset in\n# ~/Library/Developer/Shared/Documentation/DocSets so that Xcode will find it at\n# startup. See http://developer.apple.com/tools/creatingdocsetswithdoxygen.html\n# for more information.\n# The default value is: NO.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nGENERATE_DOCSET        = NO\n\n# This tag determines the name of the docset feed. A documentation feed provides\n# an umbrella under which multiple documentation sets from a single provider\n# (such as a company or product suite) can be grouped.\n# The default value is: Doxygen generated docs.\n# This tag requires that the tag GENERATE_DOCSET is set to YES.\n\nDOCSET_FEEDNAME        = \"Doxygen generated docs\"\n\n# This tag specifies a string that should uniquely identify the documentation\n# set bundle. This should be a reverse domain-name style string, e.g.\n# com.mycompany.MyDocSet. Doxygen will append .docset to the name.\n# The default value is: org.doxygen.Project.\n# This tag requires that the tag GENERATE_DOCSET is set to YES.\n\nDOCSET_BUNDLE_ID       = org.doxygen.Project\n\n# The DOCSET_PUBLISHER_ID tag specifies a string that should uniquely identify\n# the documentation publisher. This should be a reverse domain-name style\n# string, e.g. com.mycompany.MyDocSet.documentation.\n# The default value is: org.doxygen.Publisher.\n# This tag requires that the tag GENERATE_DOCSET is set to YES.\n\nDOCSET_PUBLISHER_ID    = org.doxygen.Publisher\n\n# The DOCSET_PUBLISHER_NAME tag identifies the documentation publisher.\n# The default value is: Publisher.\n# This tag requires that the tag GENERATE_DOCSET is set to YES.\n\nDOCSET_PUBLISHER_NAME  = Publisher\n\n# If the GENERATE_HTMLHELP tag is set to YES then doxygen generates three\n# additional HTML index files: index.hhp, index.hhc, and index.hhk. The\n# index.hhp is a project file that can be read by Microsoft's HTML Help Workshop\n# (see: http://www.microsoft.com/en-us/download/details.aspx?id=21138) on\n# Windows.\n#\n# The HTML Help Workshop contains a compiler that can convert all HTML output\n# generated by doxygen into a single compiled HTML file (.chm). Compiled HTML\n# files are now used as the Windows 98 help format, and will replace the old\n# Windows help format (.hlp) on all Windows platforms in the future. Compressed\n# HTML files also contain an index, a table of contents, and you can search for\n# words in the documentation. The HTML workshop also contains a viewer for\n# compressed HTML files.\n# The default value is: NO.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nGENERATE_HTMLHELP      = NO\n\n# The CHM_FILE tag can be used to specify the file name of the resulting .chm\n# file. You can add a path in front of the file if the result should not be\n# written to the html output directory.\n# This tag requires that the tag GENERATE_HTMLHELP is set to YES.\n\nCHM_FILE               =\n\n# The HHC_LOCATION tag can be used to specify the location (absolute path\n# including file name) of the HTML help compiler (hhc.exe). If non-empty,\n# doxygen will try to run the HTML help compiler on the generated index.hhp.\n# The file has to be specified with full path.\n# This tag requires that the tag GENERATE_HTMLHELP is set to YES.\n\nHHC_LOCATION           =\n\n# The GENERATE_CHI flag controls if a separate .chi index file is generated\n# (YES) or that it should be included in the master .chm file (NO).\n# The default value is: NO.\n# This tag requires that the tag GENERATE_HTMLHELP is set to YES.\n\nGENERATE_CHI           = NO\n\n# The CHM_INDEX_ENCODING is used to encode HtmlHelp index (hhk), content (hhc)\n# and project file content.\n# This tag requires that the tag GENERATE_HTMLHELP is set to YES.\n\nCHM_INDEX_ENCODING     =\n\n# The BINARY_TOC flag controls whether a binary table of contents is generated\n# (YES) or a normal table of contents (NO) in the .chm file. Furthermore it\n# enables the Previous and Next buttons.\n# The default value is: NO.\n# This tag requires that the tag GENERATE_HTMLHELP is set to YES.\n\nBINARY_TOC             = NO\n\n# The TOC_EXPAND flag can be set to YES to add extra items for group members to\n# the table of contents of the HTML help documentation and to the tree view.\n# The default value is: NO.\n# This tag requires that the tag GENERATE_HTMLHELP is set to YES.\n\nTOC_EXPAND             = NO\n\n# If the GENERATE_QHP tag is set to YES and both QHP_NAMESPACE and\n# QHP_VIRTUAL_FOLDER are set, an additional index file will be generated that\n# can be used as input for Qt's qhelpgenerator to generate a Qt Compressed Help\n# (.qch) of the generated HTML documentation.\n# The default value is: NO.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nGENERATE_QHP           = NO\n\n# If the QHG_LOCATION tag is specified, the QCH_FILE tag can be used to specify\n# the file name of the resulting .qch file. The path specified is relative to\n# the HTML output folder.\n# This tag requires that the tag GENERATE_QHP is set to YES.\n\nQCH_FILE               =\n\n# The QHP_NAMESPACE tag specifies the namespace to use when generating Qt Help\n# Project output. For more information please see Qt Help Project / Namespace\n# (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#namespace).\n# The default value is: org.doxygen.Project.\n# This tag requires that the tag GENERATE_QHP is set to YES.\n\nQHP_NAMESPACE          = org.doxygen.Project\n\n# The QHP_VIRTUAL_FOLDER tag specifies the namespace to use when generating Qt\n# Help Project output. For more information please see Qt Help Project / Virtual\n# Folders (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#virtual-\n# folders).\n# The default value is: doc.\n# This tag requires that the tag GENERATE_QHP is set to YES.\n\nQHP_VIRTUAL_FOLDER     = doc\n\n# If the QHP_CUST_FILTER_NAME tag is set, it specifies the name of a custom\n# filter to add. For more information please see Qt Help Project / Custom\n# Filters (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#custom-\n# filters).\n# This tag requires that the tag GENERATE_QHP is set to YES.\n\nQHP_CUST_FILTER_NAME   =\n\n# The QHP_CUST_FILTER_ATTRS tag specifies the list of the attributes of the\n# custom filter to add. For more information please see Qt Help Project / Custom\n# Filters (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#custom-\n# filters).\n# This tag requires that the tag GENERATE_QHP is set to YES.\n\nQHP_CUST_FILTER_ATTRS  =\n\n# The QHP_SECT_FILTER_ATTRS tag specifies the list of the attributes this\n# project's filter section matches. Qt Help Project / Filter Attributes (see:\n# http://qt-project.org/doc/qt-4.8/qthelpproject.html#filter-attributes).\n# This tag requires that the tag GENERATE_QHP is set to YES.\n\nQHP_SECT_FILTER_ATTRS  =\n\n# The QHG_LOCATION tag can be used to specify the location of Qt's\n# qhelpgenerator. If non-empty doxygen will try to run qhelpgenerator on the\n# generated .qhp file.\n# This tag requires that the tag GENERATE_QHP is set to YES.\n\nQHG_LOCATION           =\n\n# If the GENERATE_ECLIPSEHELP tag is set to YES, additional index files will be\n# generated, together with the HTML files, they form an Eclipse help plugin. To\n# install this plugin and make it available under the help contents menu in\n# Eclipse, the contents of the directory containing the HTML and XML files needs\n# to be copied into the plugins directory of eclipse. The name of the directory\n# within the plugins directory should be the same as the ECLIPSE_DOC_ID value.\n# After copying Eclipse needs to be restarted before the help appears.\n# The default value is: NO.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nGENERATE_ECLIPSEHELP   = NO\n\n# A unique identifier for the Eclipse help plugin. When installing the plugin\n# the directory name containing the HTML and XML files should also have this\n# name. Each documentation set should have its own identifier.\n# The default value is: org.doxygen.Project.\n# This tag requires that the tag GENERATE_ECLIPSEHELP is set to YES.\n\nECLIPSE_DOC_ID         = org.doxygen.Project\n\n# If you want full control over the layout of the generated HTML pages it might\n# be necessary to disable the index and replace it with your own. The\n# DISABLE_INDEX tag can be used to turn on/off the condensed index (tabs) at top\n# of each HTML page. A value of NO enables the index and the value YES disables\n# it. Since the tabs in the index contain the same information as the navigation\n# tree, you can set this option to YES if you also set GENERATE_TREEVIEW to YES.\n# The default value is: NO.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nDISABLE_INDEX          = NO\n\n# The GENERATE_TREEVIEW tag is used to specify whether a tree-like index\n# structure should be generated to display hierarchical information. If the tag\n# value is set to YES, a side panel will be generated containing a tree-like\n# index structure (just like the one that is generated for HTML Help). For this\n# to work a browser that supports JavaScript, DHTML, CSS and frames is required\n# (i.e. any modern browser). Windows users are probably better off using the\n# HTML help feature. Via custom style sheets (see HTML_EXTRA_STYLESHEET) one can\n# further fine-tune the look of the index. As an example, the default style\n# sheet generated by doxygen has an example that shows how to put an image at\n# the root of the tree instead of the PROJECT_NAME. Since the tree basically has\n# the same information as the tab index, you could consider setting\n# DISABLE_INDEX to YES when enabling this option.\n# The default value is: NO.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nGENERATE_TREEVIEW      = NO\n\n# The ENUM_VALUES_PER_LINE tag can be used to set the number of enum values that\n# doxygen will group on one line in the generated HTML documentation.\n#\n# Note that a value of 0 will completely suppress the enum values from appearing\n# in the overview section.\n# Minimum value: 0, maximum value: 20, default value: 4.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nENUM_VALUES_PER_LINE   = 4\n\n# If the treeview is enabled (see GENERATE_TREEVIEW) then this tag can be used\n# to set the initial width (in pixels) of the frame in which the tree is shown.\n# Minimum value: 0, maximum value: 1500, default value: 250.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nTREEVIEW_WIDTH         = 250\n\n# If the EXT_LINKS_IN_WINDOW option is set to YES, doxygen will open links to\n# external symbols imported via tag files in a separate window.\n# The default value is: NO.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nEXT_LINKS_IN_WINDOW    = NO\n\n# Use this tag to change the font size of LaTeX formulas included as images in\n# the HTML documentation. When you change the font size after a successful\n# doxygen run you need to manually remove any form_*.png images from the HTML\n# output directory to force them to be regenerated.\n# Minimum value: 8, maximum value: 50, default value: 10.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nFORMULA_FONTSIZE       = 10\n\n# Use the FORMULA_TRANPARENT tag to determine whether or not the images\n# generated for formulas are transparent PNGs. Transparent PNGs are not\n# supported properly for IE 6.0, but are supported on all modern browsers.\n#\n# Note that when changing this option you need to delete any form_*.png files in\n# the HTML output directory before the changes have effect.\n# The default value is: YES.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nFORMULA_TRANSPARENT    = YES\n\n# Enable the USE_MATHJAX option to render LaTeX formulas using MathJax (see\n# http://www.mathjax.org) which uses client side Javascript for the rendering\n# instead of using pre-rendered bitmaps. Use this if you do not have LaTeX\n# installed or if you want to formulas look prettier in the HTML output. When\n# enabled you may also need to install MathJax separately and configure the path\n# to it using the MATHJAX_RELPATH option.\n# The default value is: NO.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nUSE_MATHJAX            = NO\n\n# When MathJax is enabled you can set the default output format to be used for\n# the MathJax output. See the MathJax site (see:\n# http://docs.mathjax.org/en/latest/output.html) for more details.\n# Possible values are: HTML-CSS (which is slower, but has the best\n# compatibility), NativeMML (i.e. MathML) and SVG.\n# The default value is: HTML-CSS.\n# This tag requires that the tag USE_MATHJAX is set to YES.\n\nMATHJAX_FORMAT         = HTML-CSS\n\n# When MathJax is enabled you need to specify the location relative to the HTML\n# output directory using the MATHJAX_RELPATH option. The destination directory\n# should contain the MathJax.js script. For instance, if the mathjax directory\n# is located at the same level as the HTML output directory, then\n# MATHJAX_RELPATH should be ../mathjax. The default value points to the MathJax\n# Content Delivery Network so you can quickly see the result without installing\n# MathJax. However, it is strongly recommended to install a local copy of\n# MathJax from http://www.mathjax.org before deployment.\n# The default value is: http://cdn.mathjax.org/mathjax/latest.\n# This tag requires that the tag USE_MATHJAX is set to YES.\n\nMATHJAX_RELPATH        = http://cdn.mathjax.org/mathjax/latest\n\n# The MATHJAX_EXTENSIONS tag can be used to specify one or more MathJax\n# extension names that should be enabled during MathJax rendering. For example\n# MATHJAX_EXTENSIONS = TeX/AMSmath TeX/AMSsymbols\n# This tag requires that the tag USE_MATHJAX is set to YES.\n\nMATHJAX_EXTENSIONS     =\n\n# The MATHJAX_CODEFILE tag can be used to specify a file with javascript pieces\n# of code that will be used on startup of the MathJax code. See the MathJax site\n# (see: http://docs.mathjax.org/en/latest/output.html) for more details. For an\n# example see the documentation.\n# This tag requires that the tag USE_MATHJAX is set to YES.\n\nMATHJAX_CODEFILE       =\n\n# When the SEARCHENGINE tag is enabled doxygen will generate a search box for\n# the HTML output. The underlying search engine uses javascript and DHTML and\n# should work on any modern browser. Note that when using HTML help\n# (GENERATE_HTMLHELP), Qt help (GENERATE_QHP), or docsets (GENERATE_DOCSET)\n# there is already a search function so this one should typically be disabled.\n# For large projects the javascript based search engine can be slow, then\n# enabling SERVER_BASED_SEARCH may provide a better solution. It is possible to\n# search using the keyboard; to jump to the search box use <access key> + S\n# (what the <access key> is depends on the OS and browser, but it is typically\n# <CTRL>, <ALT>/<option>, or both). Inside the search box use the <cursor down\n# key> to jump into the search results window, the results can be navigated\n# using the <cursor keys>. Press <Enter> to select an item or <escape> to cancel\n# the search. The filter options can be selected when the cursor is inside the\n# search box by pressing <Shift>+<cursor down>. Also here use the <cursor keys>\n# to select a filter and <Enter> or <escape> to activate or cancel the filter\n# option.\n# The default value is: YES.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nSEARCHENGINE           = YES\n\n# When the SERVER_BASED_SEARCH tag is enabled the search engine will be\n# implemented using a web server instead of a web client using Javascript. There\n# are two flavors of web server based searching depending on the EXTERNAL_SEARCH\n# setting. When disabled, doxygen will generate a PHP script for searching and\n# an index file used by the script. When EXTERNAL_SEARCH is enabled the indexing\n# and searching needs to be provided by external tools. See the section\n# \"External Indexing and Searching\" for details.\n# The default value is: NO.\n# This tag requires that the tag SEARCHENGINE is set to YES.\n\nSERVER_BASED_SEARCH    = NO\n\n# When EXTERNAL_SEARCH tag is enabled doxygen will no longer generate the PHP\n# script for searching. Instead the search results are written to an XML file\n# which needs to be processed by an external indexer. Doxygen will invoke an\n# external search engine pointed to by the SEARCHENGINE_URL option to obtain the\n# search results.\n#\n# Doxygen ships with an example indexer (doxyindexer) and search engine\n# (doxysearch.cgi) which are based on the open source search engine library\n# Xapian (see: http://xapian.org/).\n#\n# See the section \"External Indexing and Searching\" for details.\n# The default value is: NO.\n# This tag requires that the tag SEARCHENGINE is set to YES.\n\nEXTERNAL_SEARCH        = NO\n\n# The SEARCHENGINE_URL should point to a search engine hosted by a web server\n# which will return the search results when EXTERNAL_SEARCH is enabled.\n#\n# Doxygen ships with an example indexer (doxyindexer) and search engine\n# (doxysearch.cgi) which are based on the open source search engine library\n# Xapian (see: http://xapian.org/). See the section \"External Indexing and\n# Searching\" for details.\n# This tag requires that the tag SEARCHENGINE is set to YES.\n\nSEARCHENGINE_URL       =\n\n# When SERVER_BASED_SEARCH and EXTERNAL_SEARCH are both enabled the unindexed\n# search data is written to a file for indexing by an external tool. With the\n# SEARCHDATA_FILE tag the name of this file can be specified.\n# The default file is: searchdata.xml.\n# This tag requires that the tag SEARCHENGINE is set to YES.\n\nSEARCHDATA_FILE        = searchdata.xml\n\n# When SERVER_BASED_SEARCH and EXTERNAL_SEARCH are both enabled the\n# EXTERNAL_SEARCH_ID tag can be used as an identifier for the project. This is\n# useful in combination with EXTRA_SEARCH_MAPPINGS to search through multiple\n# projects and redirect the results back to the right project.\n# This tag requires that the tag SEARCHENGINE is set to YES.\n\nEXTERNAL_SEARCH_ID     =\n\n# The EXTRA_SEARCH_MAPPINGS tag can be used to enable searching through doxygen\n# projects other than the one defined by this configuration file, but that are\n# all added to the same external search index. Each project needs to have a\n# unique id set via EXTERNAL_SEARCH_ID. The search mapping then maps the id of\n# to a relative location where the documentation can be found. The format is:\n# EXTRA_SEARCH_MAPPINGS = tagname1=loc1 tagname2=loc2 ...\n# This tag requires that the tag SEARCHENGINE is set to YES.\n\nEXTRA_SEARCH_MAPPINGS  =\n\n#---------------------------------------------------------------------------\n# Configuration options related to the LaTeX output\n#---------------------------------------------------------------------------\n\n# If the GENERATE_LATEX tag is set to YES, doxygen will generate LaTeX output.\n# The default value is: YES.\n\nGENERATE_LATEX         = NO\n\n# The LATEX_OUTPUT tag is used to specify where the LaTeX docs will be put. If a\n# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of\n# it.\n# The default directory is: latex.\n# This tag requires that the tag GENERATE_LATEX is set to YES.\n\nLATEX_OUTPUT           = latex\n\n# The LATEX_CMD_NAME tag can be used to specify the LaTeX command name to be\n# invoked.\n#\n# Note that when enabling USE_PDFLATEX this option is only used for generating\n# bitmaps for formulas in the HTML output, but not in the Makefile that is\n# written to the output directory.\n# The default file is: latex.\n# This tag requires that the tag GENERATE_LATEX is set to YES.\n\nLATEX_CMD_NAME         = latex\n\n# The MAKEINDEX_CMD_NAME tag can be used to specify the command name to generate\n# index for LaTeX.\n# The default file is: makeindex.\n# This tag requires that the tag GENERATE_LATEX is set to YES.\n\nMAKEINDEX_CMD_NAME     = makeindex\n\n# If the COMPACT_LATEX tag is set to YES, doxygen generates more compact LaTeX\n# documents. This may be useful for small projects and may help to save some\n# trees in general.\n# The default value is: NO.\n# This tag requires that the tag GENERATE_LATEX is set to YES.\n\nCOMPACT_LATEX          = NO\n\n# The PAPER_TYPE tag can be used to set the paper type that is used by the\n# printer.\n# Possible values are: a4 (210 x 297 mm), letter (8.5 x 11 inches), legal (8.5 x\n# 14 inches) and executive (7.25 x 10.5 inches).\n# The default value is: a4.\n# This tag requires that the tag GENERATE_LATEX is set to YES.\n\nPAPER_TYPE             = a4\n\n# The EXTRA_PACKAGES tag can be used to specify one or more LaTeX package names\n# that should be included in the LaTeX output. The package can be specified just\n# by its name or with the correct syntax as to be used with the LaTeX\n# \\usepackage command. To get the times font for instance you can specify :\n# EXTRA_PACKAGES=times or EXTRA_PACKAGES={times}\n# To use the option intlimits with the amsmath package you can specify:\n# EXTRA_PACKAGES=[intlimits]{amsmath}\n# If left blank no extra packages will be included.\n# This tag requires that the tag GENERATE_LATEX is set to YES.\n\nEXTRA_PACKAGES         =\n\n# The LATEX_HEADER tag can be used to specify a personal LaTeX header for the\n# generated LaTeX document. The header should contain everything until the first\n# chapter. If it is left blank doxygen will generate a standard header. See\n# section \"Doxygen usage\" for information on how to let doxygen write the\n# default header to a separate file.\n#\n# Note: Only use a user-defined header if you know what you are doing! The\n# following commands have a special meaning inside the header: $title,\n# $datetime, $date, $doxygenversion, $projectname, $projectnumber,\n# $projectbrief, $projectlogo. Doxygen will replace $title with the empty\n# string, for the replacement values of the other commands the user is referred\n# to HTML_HEADER.\n# This tag requires that the tag GENERATE_LATEX is set to YES.\n\nLATEX_HEADER           =\n\n# The LATEX_FOOTER tag can be used to specify a personal LaTeX footer for the\n# generated LaTeX document. The footer should contain everything after the last\n# chapter. If it is left blank doxygen will generate a standard footer. See\n# LATEX_HEADER for more information on how to generate a default footer and what\n# special commands can be used inside the footer.\n#\n# Note: Only use a user-defined footer if you know what you are doing!\n# This tag requires that the tag GENERATE_LATEX is set to YES.\n\nLATEX_FOOTER           =\n\n# The LATEX_EXTRA_STYLESHEET tag can be used to specify additional user-defined\n# LaTeX style sheets that are included after the standard style sheets created\n# by doxygen. Using this option one can overrule certain style aspects. Doxygen\n# will copy the style sheet files to the output directory.\n# Note: The order of the extra style sheet files is of importance (e.g. the last\n# style sheet in the list overrules the setting of the previous ones in the\n# list).\n# This tag requires that the tag GENERATE_LATEX is set to YES.\n\nLATEX_EXTRA_STYLESHEET =\n\n# The LATEX_EXTRA_FILES tag can be used to specify one or more extra images or\n# other source files which should be copied to the LATEX_OUTPUT output\n# directory. Note that the files will be copied as-is; there are no commands or\n# markers available.\n# This tag requires that the tag GENERATE_LATEX is set to YES.\n\nLATEX_EXTRA_FILES      =\n\n# If the PDF_HYPERLINKS tag is set to YES, the LaTeX that is generated is\n# prepared for conversion to PDF (using ps2pdf or pdflatex). The PDF file will\n# contain links (just like the HTML output) instead of page references. This\n# makes the output suitable for online browsing using a PDF viewer.\n# The default value is: YES.\n# This tag requires that the tag GENERATE_LATEX is set to YES.\n\nPDF_HYPERLINKS         = YES\n\n# If the USE_PDFLATEX tag is set to YES, doxygen will use pdflatex to generate\n# the PDF file directly from the LaTeX files. Set this option to YES, to get a\n# higher quality PDF documentation.\n# The default value is: YES.\n# This tag requires that the tag GENERATE_LATEX is set to YES.\n\nUSE_PDFLATEX           = YES\n\n# If the LATEX_BATCHMODE tag is set to YES, doxygen will add the \\batchmode\n# command to the generated LaTeX files. This will instruct LaTeX to keep running\n# if errors occur, instead of asking the user for help. This option is also used\n# when generating formulas in HTML.\n# The default value is: NO.\n# This tag requires that the tag GENERATE_LATEX is set to YES.\n\nLATEX_BATCHMODE        = NO\n\n# If the LATEX_HIDE_INDICES tag is set to YES then doxygen will not include the\n# index chapters (such as File Index, Compound Index, etc.) in the output.\n# The default value is: NO.\n# This tag requires that the tag GENERATE_LATEX is set to YES.\n\nLATEX_HIDE_INDICES     = NO\n\n# If the LATEX_SOURCE_CODE tag is set to YES then doxygen will include source\n# code with syntax highlighting in the LaTeX output.\n#\n# Note that which sources are shown also depends on other settings such as\n# SOURCE_BROWSER.\n# The default value is: NO.\n# This tag requires that the tag GENERATE_LATEX is set to YES.\n\nLATEX_SOURCE_CODE      = NO\n\n# The LATEX_BIB_STYLE tag can be used to specify the style to use for the\n# bibliography, e.g. plainnat, or ieeetr. See\n# http://en.wikipedia.org/wiki/BibTeX and \\cite for more info.\n# The default value is: plain.\n# This tag requires that the tag GENERATE_LATEX is set to YES.\n\nLATEX_BIB_STYLE        = plain\n\n# If the LATEX_TIMESTAMP tag is set to YES then the footer of each generated\n# page will contain the date and time when the page was generated. Setting this\n# to NO can help when comparing the output of multiple runs.\n# The default value is: NO.\n# This tag requires that the tag GENERATE_LATEX is set to YES.\n\nLATEX_TIMESTAMP        = NO\n\n#---------------------------------------------------------------------------\n# Configuration options related to the RTF output\n#---------------------------------------------------------------------------\n\n# If the GENERATE_RTF tag is set to YES, doxygen will generate RTF output. The\n# RTF output is optimized for Word 97 and may not look too pretty with other RTF\n# readers/editors.\n# The default value is: NO.\n\nGENERATE_RTF           = NO\n\n# The RTF_OUTPUT tag is used to specify where the RTF docs will be put. If a\n# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of\n# it.\n# The default directory is: rtf.\n# This tag requires that the tag GENERATE_RTF is set to YES.\n\nRTF_OUTPUT             = rtf\n\n# If the COMPACT_RTF tag is set to YES, doxygen generates more compact RTF\n# documents. This may be useful for small projects and may help to save some\n# trees in general.\n# The default value is: NO.\n# This tag requires that the tag GENERATE_RTF is set to YES.\n\nCOMPACT_RTF            = NO\n\n# If the RTF_HYPERLINKS tag is set to YES, the RTF that is generated will\n# contain hyperlink fields. The RTF file will contain links (just like the HTML\n# output) instead of page references. This makes the output suitable for online\n# browsing using Word or some other Word compatible readers that support those\n# fields.\n#\n# Note: WordPad (write) and others do not support links.\n# The default value is: NO.\n# This tag requires that the tag GENERATE_RTF is set to YES.\n\nRTF_HYPERLINKS         = NO\n\n# Load stylesheet definitions from file. Syntax is similar to doxygen's config\n# file, i.e. a series of assignments. You only have to provide replacements,\n# missing definitions are set to their default value.\n#\n# See also section \"Doxygen usage\" for information on how to generate the\n# default style sheet that doxygen normally uses.\n# This tag requires that the tag GENERATE_RTF is set to YES.\n\nRTF_STYLESHEET_FILE    =\n\n# Set optional variables used in the generation of an RTF document. Syntax is\n# similar to doxygen's config file. A template extensions file can be generated\n# using doxygen -e rtf extensionFile.\n# This tag requires that the tag GENERATE_RTF is set to YES.\n\nRTF_EXTENSIONS_FILE    =\n\n# If the RTF_SOURCE_CODE tag is set to YES then doxygen will include source code\n# with syntax highlighting in the RTF output.\n#\n# Note that which sources are shown also depends on other settings such as\n# SOURCE_BROWSER.\n# The default value is: NO.\n# This tag requires that the tag GENERATE_RTF is set to YES.\n\nRTF_SOURCE_CODE        = NO\n\n#---------------------------------------------------------------------------\n# Configuration options related to the man page output\n#---------------------------------------------------------------------------\n\n# If the GENERATE_MAN tag is set to YES, doxygen will generate man pages for\n# classes and files.\n# The default value is: NO.\n\nGENERATE_MAN           = NO\n\n# The MAN_OUTPUT tag is used to specify where the man pages will be put. If a\n# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of\n# it. A directory man3 will be created inside the directory specified by\n# MAN_OUTPUT.\n# The default directory is: man.\n# This tag requires that the tag GENERATE_MAN is set to YES.\n\nMAN_OUTPUT             = man\n\n# The MAN_EXTENSION tag determines the extension that is added to the generated\n# man pages. In case the manual section does not start with a number, the number\n# 3 is prepended. The dot (.) at the beginning of the MAN_EXTENSION tag is\n# optional.\n# The default value is: .3.\n# This tag requires that the tag GENERATE_MAN is set to YES.\n\nMAN_EXTENSION          = .3\n\n# The MAN_SUBDIR tag determines the name of the directory created within\n# MAN_OUTPUT in which the man pages are placed. If defaults to man followed by\n# MAN_EXTENSION with the initial . removed.\n# This tag requires that the tag GENERATE_MAN is set to YES.\n\nMAN_SUBDIR             =\n\n# If the MAN_LINKS tag is set to YES and doxygen generates man output, then it\n# will generate one additional man file for each entity documented in the real\n# man page(s). These additional files only source the real man page, but without\n# them the man command would be unable to find the correct page.\n# The default value is: NO.\n# This tag requires that the tag GENERATE_MAN is set to YES.\n\nMAN_LINKS              = NO\n\n#---------------------------------------------------------------------------\n# Configuration options related to the XML output\n#---------------------------------------------------------------------------\n\n# If the GENERATE_XML tag is set to YES, doxygen will generate an XML file that\n# captures the structure of the code including all documentation.\n# The default value is: NO.\n\nGENERATE_XML           = YES\n\n# The XML_OUTPUT tag is used to specify where the XML pages will be put. If a\n# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of\n# it.\n# The default directory is: xml.\n# This tag requires that the tag GENERATE_XML is set to YES.\n\nXML_OUTPUT             = xml-java\n\n# If the XML_PROGRAMLISTING tag is set to YES, doxygen will dump the program\n# listings (including syntax highlighting and cross-referencing information) to\n# the XML output. Note that enabling this will significantly increase the size\n# of the XML output.\n# The default value is: YES.\n# This tag requires that the tag GENERATE_XML is set to YES.\n\nXML_PROGRAMLISTING     = YES\n\n#---------------------------------------------------------------------------\n# Configuration options related to the DOCBOOK output\n#---------------------------------------------------------------------------\n\n# If the GENERATE_DOCBOOK tag is set to YES, doxygen will generate Docbook files\n# that can be used to generate PDF.\n# The default value is: NO.\n\nGENERATE_DOCBOOK       = NO\n\n# The DOCBOOK_OUTPUT tag is used to specify where the Docbook pages will be put.\n# If a relative path is entered the value of OUTPUT_DIRECTORY will be put in\n# front of it.\n# The default directory is: docbook.\n# This tag requires that the tag GENERATE_DOCBOOK is set to YES.\n\nDOCBOOK_OUTPUT         = docbook\n\n# If the DOCBOOK_PROGRAMLISTING tag is set to YES, doxygen will include the\n# program listings (including syntax highlighting and cross-referencing\n# information) to the DOCBOOK output. Note that enabling this will significantly\n# increase the size of the DOCBOOK output.\n# The default value is: NO.\n# This tag requires that the tag GENERATE_DOCBOOK is set to YES.\n\nDOCBOOK_PROGRAMLISTING = NO\n\n#---------------------------------------------------------------------------\n# Configuration options for the AutoGen Definitions output\n#---------------------------------------------------------------------------\n\n# If the GENERATE_AUTOGEN_DEF tag is set to YES, doxygen will generate an\n# AutoGen Definitions (see http://autogen.sf.net) file that captures the\n# structure of the code including all documentation. Note that this feature is\n# still experimental and incomplete at the moment.\n# The default value is: NO.\n\nGENERATE_AUTOGEN_DEF   = NO\n\n#---------------------------------------------------------------------------\n# Configuration options related to the Perl module output\n#---------------------------------------------------------------------------\n\n# If the GENERATE_PERLMOD tag is set to YES, doxygen will generate a Perl module\n# file that captures the structure of the code including all documentation.\n#\n# Note that this feature is still experimental and incomplete at the moment.\n# The default value is: NO.\n\nGENERATE_PERLMOD       = NO\n\n# If the PERLMOD_LATEX tag is set to YES, doxygen will generate the necessary\n# Makefile rules, Perl scripts and LaTeX code to be able to generate PDF and DVI\n# output from the Perl module output.\n# The default value is: NO.\n# This tag requires that the tag GENERATE_PERLMOD is set to YES.\n\nPERLMOD_LATEX          = NO\n\n# If the PERLMOD_PRETTY tag is set to YES, the Perl module output will be nicely\n# formatted so it can be parsed by a human reader. This is useful if you want to\n# understand what is going on. On the other hand, if this tag is set to NO, the\n# size of the Perl module output will be much smaller and Perl will parse it\n# just the same.\n# The default value is: YES.\n# This tag requires that the tag GENERATE_PERLMOD is set to YES.\n\nPERLMOD_PRETTY         = YES\n\n# The names of the make variables in the generated doxyrules.make file are\n# prefixed with the string contained in PERLMOD_MAKEVAR_PREFIX. This is useful\n# so different doxyrules.make files included by the same Makefile don't\n# overwrite each other's variables.\n# This tag requires that the tag GENERATE_PERLMOD is set to YES.\n\nPERLMOD_MAKEVAR_PREFIX =\n\n#---------------------------------------------------------------------------\n# Configuration options related to the preprocessor\n#---------------------------------------------------------------------------\n\n# If the ENABLE_PREPROCESSING tag is set to YES, doxygen will evaluate all\n# C-preprocessor directives found in the sources and include files.\n# The default value is: YES.\n\nENABLE_PREPROCESSING   = YES\n\n# If the MACRO_EXPANSION tag is set to YES, doxygen will expand all macro names\n# in the source code. If set to NO, only conditional compilation will be\n# performed. Macro expansion can be done in a controlled way by setting\n# EXPAND_ONLY_PREDEF to YES.\n# The default value is: NO.\n# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.\n\nMACRO_EXPANSION        = NO\n\n# If the EXPAND_ONLY_PREDEF and MACRO_EXPANSION tags are both set to YES then\n# the macro expansion is limited to the macros specified with the PREDEFINED and\n# EXPAND_AS_DEFINED tags.\n# The default value is: NO.\n# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.\n\nEXPAND_ONLY_PREDEF     = NO\n\n# If the SEARCH_INCLUDES tag is set to YES, the include files in the\n# INCLUDE_PATH will be searched if a #include is found.\n# The default value is: YES.\n# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.\n\nSEARCH_INCLUDES        = YES\n\n# The INCLUDE_PATH tag can be used to specify one or more directories that\n# contain include files that are not input files but should be processed by the\n# preprocessor.\n# This tag requires that the tag SEARCH_INCLUDES is set to YES.\n\nINCLUDE_PATH           =\n\n# You can use the INCLUDE_FILE_PATTERNS tag to specify one or more wildcard\n# patterns (like *.h and *.hpp) to filter out the header-files in the\n# directories. If left blank, the patterns specified with FILE_PATTERNS will be\n# used.\n# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.\n\nINCLUDE_FILE_PATTERNS  =\n\n# The PREDEFINED tag can be used to specify one or more macro names that are\n# defined before the preprocessor is started (similar to the -D option of e.g.\n# gcc). The argument of the tag is a list of macros of the form: name or\n# name=definition (no spaces). If the definition and the \"=\" are omitted, \"=1\"\n# is assumed. To prevent a macro definition from being undefined via #undef or\n# recursively expanded use the := operator instead of the = operator.\n# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.\n\nPREDEFINED             =\n\n# If the MACRO_EXPANSION and EXPAND_ONLY_PREDEF tags are set to YES then this\n# tag can be used to specify a list of macro names that should be expanded. The\n# macro definition that is found in the sources will be used. Use the PREDEFINED\n# tag if you want to use a different macro definition that overrules the\n# definition found in the source code.\n# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.\n\nEXPAND_AS_DEFINED      =\n\n# If the SKIP_FUNCTION_MACROS tag is set to YES then doxygen's preprocessor will\n# remove all references to function-like macros that are alone on a line, have\n# an all uppercase name, and do not end with a semicolon. Such function macros\n# are typically used for boiler-plate code, and will confuse the parser if not\n# removed.\n# The default value is: YES.\n# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.\n\nSKIP_FUNCTION_MACROS   = YES\n\n#---------------------------------------------------------------------------\n# Configuration options related to external references\n#---------------------------------------------------------------------------\n\n# The TAGFILES tag can be used to specify one or more tag files. For each tag\n# file the location of the external documentation should be added. The format of\n# a tag file without this location is as follows:\n# TAGFILES = file1 file2 ...\n# Adding location for the tag files is done as follows:\n# TAGFILES = file1=loc1 \"file2 = loc2\" ...\n# where loc1 and loc2 can be relative or absolute paths or URLs. See the\n# section \"Linking to external documentation\" for more information about the use\n# of tag files.\n# Note: Each tag file must have a unique name (where the name does NOT include\n# the path). If a tag file is not located in the directory in which doxygen is\n# run, you must also specify the path to the tagfile here.\n\nTAGFILES               =\n\n# When a file name is specified after GENERATE_TAGFILE, doxygen will create a\n# tag file that is based on the input files it reads. See section \"Linking to\n# external documentation\" for more information about the usage of tag files.\n\nGENERATE_TAGFILE       =\n\n# If the ALLEXTERNALS tag is set to YES, all external class will be listed in\n# the class index. If set to NO, only the inherited external classes will be\n# listed.\n# The default value is: NO.\n\nALLEXTERNALS           = NO\n\n# If the EXTERNAL_GROUPS tag is set to YES, all external groups will be listed\n# in the modules index. If set to NO, only the current project's groups will be\n# listed.\n# The default value is: YES.\n\nEXTERNAL_GROUPS        = YES\n\n# If the EXTERNAL_PAGES tag is set to YES, all external pages will be listed in\n# the related pages index. If set to NO, only the current project's pages will\n# be listed.\n# The default value is: YES.\n\nEXTERNAL_PAGES         = YES\n\n# The PERL_PATH should be the absolute path and name of the perl script\n# interpreter (i.e. the result of 'which perl').\n# The default file (with absolute path) is: /usr/bin/perl.\n\nPERL_PATH              = /usr/bin/perl\n\n#---------------------------------------------------------------------------\n# Configuration options related to the dot tool\n#---------------------------------------------------------------------------\n\n# If the CLASS_DIAGRAMS tag is set to YES, doxygen will generate a class diagram\n# (in HTML and LaTeX) for classes with base or super classes. Setting the tag to\n# NO turns the diagrams off. Note that this option also works with HAVE_DOT\n# disabled, but it is recommended to install and use dot, since it yields more\n# powerful graphs.\n# The default value is: YES.\n\nCLASS_DIAGRAMS         = YES\n\n# You can define message sequence charts within doxygen comments using the \\msc\n# command. Doxygen will then run the mscgen tool (see:\n# http://www.mcternan.me.uk/mscgen/)) to produce the chart and insert it in the\n# documentation. The MSCGEN_PATH tag allows you to specify the directory where\n# the mscgen tool resides. If left empty the tool is assumed to be found in the\n# default search path.\n\nMSCGEN_PATH            =\n\n# You can include diagrams made with dia in doxygen documentation. Doxygen will\n# then run dia to produce the diagram and insert it in the documentation. The\n# DIA_PATH tag allows you to specify the directory where the dia binary resides.\n# If left empty dia is assumed to be found in the default search path.\n\nDIA_PATH               =\n\n# If set to YES the inheritance and collaboration graphs will hide inheritance\n# and usage relations if the target is undocumented or is not a class.\n# The default value is: YES.\n\nHIDE_UNDOC_RELATIONS   = YES\n\n# If you set the HAVE_DOT tag to YES then doxygen will assume the dot tool is\n# available from the path. This tool is part of Graphviz (see:\n# http://www.graphviz.org/), a graph visualization toolkit from AT&T and Lucent\n# Bell Labs. The other options in this section have no effect if this option is\n# set to NO\n# The default value is: YES.\n\nHAVE_DOT               = YES\n\n# The DOT_NUM_THREADS specifies the number of dot invocations doxygen is allowed\n# to run in parallel. When set to 0 doxygen will base this on the number of\n# processors available in the system. You can set it explicitly to a value\n# larger than 0 to get control over the balance between CPU load and processing\n# speed.\n# Minimum value: 0, maximum value: 32, default value: 0.\n# This tag requires that the tag HAVE_DOT is set to YES.\n\nDOT_NUM_THREADS        = 0\n\n# When you want a differently looking font in the dot files that doxygen\n# generates you can specify the font name using DOT_FONTNAME. You need to make\n# sure dot is able to find the font, which can be done by putting it in a\n# standard location or by setting the DOTFONTPATH environment variable or by\n# setting DOT_FONTPATH to the directory containing the font.\n# The default value is: Helvetica.\n# This tag requires that the tag HAVE_DOT is set to YES.\n\nDOT_FONTNAME           = Helvetica\n\n# The DOT_FONTSIZE tag can be used to set the size (in points) of the font of\n# dot graphs.\n# Minimum value: 4, maximum value: 24, default value: 10.\n# This tag requires that the tag HAVE_DOT is set to YES.\n\nDOT_FONTSIZE           = 10\n\n# By default doxygen will tell dot to use the default font as specified with\n# DOT_FONTNAME. If you specify a different font using DOT_FONTNAME you can set\n# the path where dot can find it using this tag.\n# This tag requires that the tag HAVE_DOT is set to YES.\n\nDOT_FONTPATH           =\n\n# If the CLASS_GRAPH tag is set to YES then doxygen will generate a graph for\n# each documented class showing the direct and indirect inheritance relations.\n# Setting this tag to YES will force the CLASS_DIAGRAMS tag to NO.\n# The default value is: YES.\n# This tag requires that the tag HAVE_DOT is set to YES.\n\nCLASS_GRAPH            = YES\n\n# If the COLLABORATION_GRAPH tag is set to YES then doxygen will generate a\n# graph for each documented class showing the direct and indirect implementation\n# dependencies (inheritance, containment, and class references variables) of the\n# class with other documented classes.\n# The default value is: YES.\n# This tag requires that the tag HAVE_DOT is set to YES.\n\nCOLLABORATION_GRAPH    = YES\n\n# If the GROUP_GRAPHS tag is set to YES then doxygen will generate a graph for\n# groups, showing the direct groups dependencies.\n# The default value is: YES.\n# This tag requires that the tag HAVE_DOT is set to YES.\n\nGROUP_GRAPHS           = YES\n\n# If the UML_LOOK tag is set to YES, doxygen will generate inheritance and\n# collaboration diagrams in a style similar to the OMG's Unified Modeling\n# Language.\n# The default value is: NO.\n# This tag requires that the tag HAVE_DOT is set to YES.\n\nUML_LOOK               = NO\n\n# If the UML_LOOK tag is enabled, the fields and methods are shown inside the\n# class node. If there are many fields or methods and many nodes the graph may\n# become too big to be useful. The UML_LIMIT_NUM_FIELDS threshold limits the\n# number of items for each type to make the size more manageable. Set this to 0\n# for no limit. Note that the threshold may be exceeded by 50% before the limit\n# is enforced. So when you set the threshold to 10, up to 15 fields may appear,\n# but if the number exceeds 15, the total amount of fields shown is limited to\n# 10.\n# Minimum value: 0, maximum value: 100, default value: 10.\n# This tag requires that the tag HAVE_DOT is set to YES.\n\nUML_LIMIT_NUM_FIELDS   = 10\n\n# If the TEMPLATE_RELATIONS tag is set to YES then the inheritance and\n# collaboration graphs will show the relations between templates and their\n# instances.\n# The default value is: NO.\n# This tag requires that the tag HAVE_DOT is set to YES.\n\nTEMPLATE_RELATIONS     = NO\n\n# If the INCLUDE_GRAPH, ENABLE_PREPROCESSING and SEARCH_INCLUDES tags are set to\n# YES then doxygen will generate a graph for each documented file showing the\n# direct and indirect include dependencies of the file with other documented\n# files.\n# The default value is: YES.\n# This tag requires that the tag HAVE_DOT is set to YES.\n\nINCLUDE_GRAPH          = YES\n\n# If the INCLUDED_BY_GRAPH, ENABLE_PREPROCESSING and SEARCH_INCLUDES tags are\n# set to YES then doxygen will generate a graph for each documented file showing\n# the direct and indirect include dependencies of the file with other documented\n# files.\n# The default value is: YES.\n# This tag requires that the tag HAVE_DOT is set to YES.\n\nINCLUDED_BY_GRAPH      = YES\n\n# If the CALL_GRAPH tag is set to YES then doxygen will generate a call\n# dependency graph for every global function or class method.\n#\n# Note that enabling this option will significantly increase the time of a run.\n# So in most cases it will be better to enable call graphs for selected\n# functions only using the \\callgraph command. Disabling a call graph can be\n# accomplished by means of the command \\hidecallgraph.\n# The default value is: NO.\n# This tag requires that the tag HAVE_DOT is set to YES.\n\nCALL_GRAPH             = NO\n\n# If the CALLER_GRAPH tag is set to YES then doxygen will generate a caller\n# dependency graph for every global function or class method.\n#\n# Note that enabling this option will significantly increase the time of a run.\n# So in most cases it will be better to enable caller graphs for selected\n# functions only using the \\callergraph command. Disabling a caller graph can be\n# accomplished by means of the command \\hidecallergraph.\n# The default value is: NO.\n# This tag requires that the tag HAVE_DOT is set to YES.\n\nCALLER_GRAPH           = NO\n\n# If the GRAPHICAL_HIERARCHY tag is set to YES then doxygen will graphical\n# hierarchy of all classes instead of a textual one.\n# The default value is: YES.\n# This tag requires that the tag HAVE_DOT is set to YES.\n\nGRAPHICAL_HIERARCHY    = YES\n\n# If the DIRECTORY_GRAPH tag is set to YES then doxygen will show the\n# dependencies a directory has on other directories in a graphical way. The\n# dependency relations are determined by the #include relations between the\n# files in the directories.\n# The default value is: YES.\n# This tag requires that the tag HAVE_DOT is set to YES.\n\nDIRECTORY_GRAPH        = YES\n\n# The DOT_IMAGE_FORMAT tag can be used to set the image format of the images\n# generated by dot. For an explanation of the image formats see the section\n# output formats in the documentation of the dot tool (Graphviz (see:\n# http://www.graphviz.org/)).\n# Note: If you choose svg you need to set HTML_FILE_EXTENSION to xhtml in order\n# to make the SVG files visible in IE 9+ (other browsers do not have this\n# requirement).\n# Possible values are: png, png:cairo, png:cairo:cairo, png:cairo:gd, png:gd,\n# png:gd:gd, jpg, jpg:cairo, jpg:cairo:gd, jpg:gd, jpg:gd:gd, gif, gif:cairo,\n# gif:cairo:gd, gif:gd, gif:gd:gd, svg, png:gd, png:gd:gd, png:cairo,\n# png:cairo:gd, png:cairo:cairo, png:cairo:gdiplus, png:gdiplus and\n# png:gdiplus:gdiplus.\n# The default value is: png.\n# This tag requires that the tag HAVE_DOT is set to YES.\n\nDOT_IMAGE_FORMAT       = png\n\n# If DOT_IMAGE_FORMAT is set to svg, then this option can be set to YES to\n# enable generation of interactive SVG images that allow zooming and panning.\n#\n# Note that this requires a modern browser other than Internet Explorer. Tested\n# and working are Firefox, Chrome, Safari, and Opera.\n# Note: For IE 9+ you need to set HTML_FILE_EXTENSION to xhtml in order to make\n# the SVG files visible. Older versions of IE do not have SVG support.\n# The default value is: NO.\n# This tag requires that the tag HAVE_DOT is set to YES.\n\nINTERACTIVE_SVG        = NO\n\n# The DOT_PATH tag can be used to specify the path where the dot tool can be\n# found. If left blank, it is assumed the dot tool can be found in the path.\n# This tag requires that the tag HAVE_DOT is set to YES.\n\nDOT_PATH               =\n\n# The DOTFILE_DIRS tag can be used to specify one or more directories that\n# contain dot files that are included in the documentation (see the \\dotfile\n# command).\n# This tag requires that the tag HAVE_DOT is set to YES.\n\nDOTFILE_DIRS           =\n\n# The MSCFILE_DIRS tag can be used to specify one or more directories that\n# contain msc files that are included in the documentation (see the \\mscfile\n# command).\n\nMSCFILE_DIRS           =\n\n# The DIAFILE_DIRS tag can be used to specify one or more directories that\n# contain dia files that are included in the documentation (see the \\diafile\n# command).\n\nDIAFILE_DIRS           =\n\n# When using plantuml, the PLANTUML_JAR_PATH tag should be used to specify the\n# path where java can find the plantuml.jar file. If left blank, it is assumed\n# PlantUML is not used or called during a preprocessing step. Doxygen will\n# generate a warning when it encounters a \\startuml command in this case and\n# will not generate output for the diagram.\n\nPLANTUML_JAR_PATH      =\n\n# When using plantuml, the PLANTUML_CFG_FILE tag can be used to specify a\n# configuration file for plantuml.\n\nPLANTUML_CFG_FILE      =\n\n# When using plantuml, the specified paths are searched for files specified by\n# the !include statement in a plantuml block.\n\nPLANTUML_INCLUDE_PATH  =\n\n# The DOT_GRAPH_MAX_NODES tag can be used to set the maximum number of nodes\n# that will be shown in the graph. If the number of nodes in a graph becomes\n# larger than this value, doxygen will truncate the graph, which is visualized\n# by representing a node as a red box. Note that doxygen if the number of direct\n# children of the root node in a graph is already larger than\n# DOT_GRAPH_MAX_NODES then the graph will not be shown at all. Also note that\n# the size of a graph can be further restricted by MAX_DOT_GRAPH_DEPTH.\n# Minimum value: 0, maximum value: 10000, default value: 50.\n# This tag requires that the tag HAVE_DOT is set to YES.\n\nDOT_GRAPH_MAX_NODES    = 50\n\n# The MAX_DOT_GRAPH_DEPTH tag can be used to set the maximum depth of the graphs\n# generated by dot. A depth value of 3 means that only nodes reachable from the\n# root by following a path via at most 3 edges will be shown. Nodes that lay\n# further from the root node will be omitted. Note that setting this option to 1\n# or 2 may greatly reduce the computation time needed for large code bases. Also\n# note that the size of a graph can be further restricted by\n# DOT_GRAPH_MAX_NODES. Using a depth of 0 means no depth restriction.\n# Minimum value: 0, maximum value: 1000, default value: 0.\n# This tag requires that the tag HAVE_DOT is set to YES.\n\nMAX_DOT_GRAPH_DEPTH    = 0\n\n# Set the DOT_TRANSPARENT tag to YES to generate images with a transparent\n# background. This is disabled by default, because dot on Windows does not seem\n# to support this out of the box.\n#\n# Warning: Depending on the platform used, enabling this option may lead to\n# badly anti-aliased labels on the edges of a graph (i.e. they become hard to\n# read).\n# The default value is: NO.\n# This tag requires that the tag HAVE_DOT is set to YES.\n\nDOT_TRANSPARENT        = NO\n\n# Set the DOT_MULTI_TARGETS tag to YES to allow dot to generate multiple output\n# files in one run (i.e. multiple -o and -T options on the command line). This\n# makes dot run faster, but since only newer versions of dot (>1.8.10) support\n# this, this feature is disabled by default.\n# The default value is: NO.\n# This tag requires that the tag HAVE_DOT is set to YES.\n\nDOT_MULTI_TARGETS      = NO\n\n# If the GENERATE_LEGEND tag is set to YES doxygen will generate a legend page\n# explaining the meaning of the various boxes and arrows in the dot generated\n# graphs.\n# The default value is: YES.\n# This tag requires that the tag HAVE_DOT is set to YES.\n\nGENERATE_LEGEND        = YES\n\n# If the DOT_CLEANUP tag is set to YES, doxygen will remove the intermediate dot\n# files that are used to generate the various graphs.\n# The default value is: YES.\n# This tag requires that the tag HAVE_DOT is set to YES.\n\nDOT_CLEANUP            = YES\n"
  },
  {
    "path": "doc/index.rst",
    "content": ".. DeepSpeech documentation master file, created by\n   sphinx-quickstart on Thu Feb  2 21:20:39 2017.\n   You can adapt this file completely to your liking, but it should at least\n   contain the root `toctree` directive.\n\nWelcome to DeepSpeech's documentation!\n======================================\n\nDeepSpeech is an open source Speech-To-Text engine, using a model trained by machine learning techniques based on `Baidu's Deep Speech research paper <https://arxiv.org/abs/1412.5567>`_. Project DeepSpeech uses Google's `TensorFlow <https://www.tensorflow.org/>`_ to make the implementation easier.\n\nTo install and use DeepSpeech all you have to do is:\n\n.. code-block:: bash\n\n   # Create and activate a virtualenv\n   virtualenv -p python3 $HOME/tmp/deepspeech-venv/\n   source $HOME/tmp/deepspeech-venv/bin/activate\n\n   # Install DeepSpeech\n   pip3 install deepspeech\n\n   # Download pre-trained English model files\n   curl -LO https://github.com/mozilla/DeepSpeech/releases/download/v0.9.3/deepspeech-0.9.3-models.pbmm\n   curl -LO https://github.com/mozilla/DeepSpeech/releases/download/v0.9.3/deepspeech-0.9.3-models.scorer\n\n   # Download example audio files\n   curl -LO https://github.com/mozilla/DeepSpeech/releases/download/v0.9.3/audio-0.9.3.tar.gz\n   tar xvf audio-0.9.3.tar.gz\n\n   # Transcribe an audio file\n   deepspeech --model deepspeech-0.9.3-models.pbmm --scorer deepspeech-0.9.3-models.scorer --audio audio/2830-3980-0043.wav\n\nA pre-trained English model is available for use and can be downloaded following the instructions in :ref:`the usage docs <usage-docs>`. For the latest release, including pre-trained models and checkpoints, `see the GitHub releases page <https://github.com/mozilla/DeepSpeech/releases/latest>`_.\n\nQuicker inference can be performed using a supported NVIDIA GPU on Linux. See the `release notes <https://github.com/mozilla/DeepSpeech/releases/latest>`_ to find which GPUs are supported. To run ``deepspeech`` on a GPU, install the GPU specific package:\n\n.. code-block:: bash\n\n   # Create and activate a virtualenv\n   virtualenv -p python3 $HOME/tmp/deepspeech-gpu-venv/\n   source $HOME/tmp/deepspeech-gpu-venv/bin/activate\n\n   # Install DeepSpeech CUDA enabled package\n   pip3 install deepspeech-gpu\n\n   # Transcribe an audio file.\n   deepspeech --model deepspeech-0.9.3-models.pbmm --scorer deepspeech-0.9.3-models.scorer --audio audio/2830-3980-0043.wav\n\nPlease ensure you have the required :ref:`CUDA dependencies <cuda-inference-deps>`.\n\nSee the output of ``deepspeech -h`` for more information on the use of ``deepspeech``. (If you experience problems running ``deepspeech``, please check :ref:`required runtime dependencies <runtime-deps>`).\n\n.. toctree::\n   :maxdepth: 2\n   :caption: Introduction\n\n   USING\n\n   TRAINING\n\n   SUPPORTED_PLATFORMS\n\n   BUILDING\n\n   BUILDING_DotNet\n\n.. include:: ../SUPPORT.rst\n\n.. toctree::\n   :maxdepth: 2\n   :caption: Decoder and scorer\n\n   Decoder\n\n   Scorer\n\n.. toctree::\n   :maxdepth: 2\n   :caption: Architecture and training\n\n   DeepSpeech\n\n   Geometry\n\n   ParallelOptimization\n\n.. toctree::\n   :maxdepth: 3\n   :caption: API Reference\n\n   Error-Codes\n\n   C-API\n\n   DotNet-API\n\n   Java-API\n\n   NodeJS-API\n\n   Python-API\n\n.. toctree::\n   :maxdepth: 2\n   :caption: Examples\n\n   C-Examples\n\n   DotNet-Examples\n\n   Java-Examples\n\n   NodeJS-Examples\n\n   Python-Examples\n   \n   HotWordBoosting-Examples\n\n   Contributed-Examples\n\nIndices and tables\n==================\n\n* :ref:`genindex`\n* :ref:`modindex`\n* :ref:`search`\n"
  },
  {
    "path": "doc/make.bat",
    "content": "@ECHO OFF\n\npushd %~dp0\n\nREM Command file for Sphinx documentation\n\nif \"%SPHINXBUILD%\" == \"\" (\n\tset SPHINXBUILD=sphinx-build\n)\nset SOURCEDIR=.\nset BUILDDIR=.build\nset SPHINXPROJ=DeepSpeech\n\nif \"%1\" == \"\" goto help\n\n%SPHINXBUILD% >NUL 2>NUL\nif errorlevel 9009 (\n\techo.\n\techo.The 'sphinx-build' command was not found. Make sure you have Sphinx\n\techo.installed, then set the SPHINXBUILD environment variable to point\n\techo.to the full path of the 'sphinx-build' executable. Alternatively you\n\techo.may add the Sphinx directory to PATH.\n\techo.\n\techo.If you don't have Sphinx installed, grab it from\n\techo.http://sphinx-doc.org/\n\texit /b 1\n)\n\n%SPHINXBUILD% -M %1 %SOURCEDIR% %BUILDDIR% %SPHINXOPTS%\ngoto end\n\n:help\n%SPHINXBUILD% -M help %SOURCEDIR% %BUILDDIR% %SPHINXOPTS%\n\n:end\npopd\n"
  },
  {
    "path": "ds_generic.supp",
    "content": "{\n   libgomp_malloc\n   Memcheck:Leak\n   match-leak-kinds: reachable\n   fun:malloc\n   obj:/usr/lib/*/libgomp.so.1.0.0\n}\n"
  },
  {
    "path": "ds_lib.supp",
    "content": "{\n   deepspeech_tflite_error_reporter\n   Memcheck:Leak\n   match-leak-kinds: reachable\n   fun:_Znwm\n   fun:_ZN6tflite20DefaultErrorReporterEv\n   fun:_ZN16TFLiteModelState4initEPKc\n   fun:DS_CreateModel\n   fun:main\n}\n"
  },
  {
    "path": "ds_openfst.supp",
    "content": "{\n   <openfst>\n   Memcheck:Leak\n   match-leak-kinds: reachable\n   fun:_Znwm\n   fun:_ZNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEE12_M_constructIPcEEvT_S7_St20forward_iterator_tag\n   fun:_ZZN3fst16DefaultCompactorINS_17AcceptorCompactorINS_6ArcTplINS_17TropicalWeightTplIfEEEEEEjNS_19DefaultCompactStoreISt4pairIS8_IiS4_EiEjEEE4TypeB5cxx11EvENKUlvE_clEv\n   fun:_ZN3fst16DefaultCompactorINS_17AcceptorCompactorINS_6ArcTplINS_17TropicalWeightTplIfEEEEEEjNS_19DefaultCompactStoreISt4pairIS8_IiS4_EiEjEEE4TypeB5cxx11Ev\n   fun:_ZN3fst8internal14CompactFstImplINS_6ArcTplINS_17TropicalWeightTplIfEEEENS_16DefaultCompactorINS_17AcceptorCompactorIS5_EEjNS_19DefaultCompactStoreISt4pairISA_IiS4_EiEjEEEENS_17DefaultCacheStoreIS5_EEEC1Ev\n   fun:_ZN9__gnu_cxx13new_allocatorIN3fst8internal14CompactFstImplINS1_6ArcTplINS1_17TropicalWeightTplIfEEEENS1_16DefaultCompactorINS1_17AcceptorCompactorIS7_EEjNS1_19DefaultCompactStoreISt4pairISC_IiS6_EiEjEEEENS1_17DefaultCacheStoreIS7_EEEEE9constructISJ_JEEEvPT_DpOT0_\n   fun:_ZNSt16allocator_traitsISaIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_17TropicalWeightTplIfEEEENS0_16DefaultCompactorINS0_17AcceptorCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairISB_IiS5_EiEjEEEENS0_17DefaultCacheStoreIS6_EEEEEE9constructISI_JEEEvRSJ_PT_DpOT0_\n   fun:_ZNSt23_Sp_counted_ptr_inplaceIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_17TropicalWeightTplIfEEEENS0_16DefaultCompactorINS0_17AcceptorCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairISB_IiS5_EiEjEEEENS0_17DefaultCacheStoreIS6_EEEESaISI_ELN9__gnu_cxx12_Lock_policyE2EEC1IJEEESJ_DpOT_\n   fun:_ZNSt14__shared_countILN9__gnu_cxx12_Lock_policyE2EEC1IN3fst8internal14CompactFstImplINS4_6ArcTplINS4_17TropicalWeightTplIfEEEENS4_16DefaultCompactorINS4_17AcceptorCompactorISA_EEjNS4_19DefaultCompactStoreISt4pairISF_IiS9_EiEjEEEENS4_17DefaultCacheStoreISA_EEEESaISM_EJEEERPT_St20_Sp_alloc_shared_tagIT0_EDpOT1_\n   fun:_ZNSt12__shared_ptrIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_17TropicalWeightTplIfEEEENS0_16DefaultCompactorINS0_17AcceptorCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairISB_IiS5_EiEjEEEENS0_17DefaultCacheStoreIS6_EEEELN9__gnu_cxx12_Lock_policyE2EEC1ISaISI_EJEEESt20_Sp_alloc_shared_tagIT_EDpOT0_\n   fun:_ZNSt10shared_ptrIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_17TropicalWeightTplIfEEEENS0_16DefaultCompactorINS0_17AcceptorCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairISB_IiS5_EiEjEEEENS0_17DefaultCacheStoreIS6_EEEEEC1ISaISI_EJEEESt20_Sp_alloc_shared_tagIT_EDpOT0_\n   fun:_ZSt15allocate_sharedIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_17TropicalWeightTplIfEEEENS0_16DefaultCompactorINS0_17AcceptorCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairISB_IiS5_EiEjEEEENS0_17DefaultCacheStoreIS6_EEEESaISI_EJEESt10shared_ptrIT_ERKT0_DpOT1_\n}\n{\n   <openfst>\n   Memcheck:Leak\n   match-leak-kinds: reachable\n   fun:_Znwm\n   fun:_ZNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEE12_M_constructIPcEEvT_S7_St20forward_iterator_tag\n   fun:_ZNSt4pairINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEEN3fst16FstRegisterEntryINS6_6ArcTplINS6_17TropicalWeightTplIfEEEEEEEC1IS5_SC_Lb1EEERKS5_RKSC_\n   fun:_ZSt9make_pairIRKNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEERKN3fst16FstRegisterEntryINS8_6ArcTplINS8_17TropicalWeightTplIfEEEEEEESt4pairINSt17__decay_and_stripIT_E6__typeENSI_IT0_E6__typeEEOSJ_OSM_\n   fun:_ZN3fst15GenericRegisterINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEENS_16FstRegisterEntryINS_6ArcTplINS_17TropicalWeightTplIfEEEEEENS_11FstRegisterISB_EEE8SetEntryERKS6_RKSC_\n   fun:_ZN3fst17GenericRegistererINS_11FstRegisterINS_6ArcTplINS_17TropicalWeightTplIfEEEEEEEC1ENSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEENS_16FstRegisterEntryIS5_EE\n   fun:_ZN3fst13FstRegistererINS_10CompactFstINS_6ArcTplINS_17TropicalWeightTplIfEEEENS_17AcceptorCompactorIS5_EEjNS_19DefaultCompactStoreISt4pairIS9_IiS4_EiEjEENS_17DefaultCacheStoreIS5_EEEEEC1Ev\n   fun:_Z41__static_initialization_and_destruction_0ii\n}\n{\n   <openfst>\n   Memcheck:Leak\n   match-leak-kinds: reachable\n   fun:_Znwm\n   fun:_ZNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEE12_M_constructIPcEEvT_S7_St20forward_iterator_tag\n   fun:_ZZN3fst16DefaultCompactorINS_17AcceptorCompactorINS_6ArcTplINS_12LogWeightTplIfEEEEEEjNS_19DefaultCompactStoreISt4pairIS8_IiS4_EiEjEEE4TypeB5cxx11EvENKUlvE_clEv\n   fun:_ZN3fst16DefaultCompactorINS_17AcceptorCompactorINS_6ArcTplINS_12LogWeightTplIfEEEEEEjNS_19DefaultCompactStoreISt4pairIS8_IiS4_EiEjEEE4TypeB5cxx11Ev\n   fun:_ZN3fst8internal14CompactFstImplINS_6ArcTplINS_12LogWeightTplIfEEEENS_16DefaultCompactorINS_17AcceptorCompactorIS5_EEjNS_19DefaultCompactStoreISt4pairISA_IiS4_EiEjEEEENS_17DefaultCacheStoreIS5_EEEC1Ev\n   fun:_ZN9__gnu_cxx13new_allocatorIN3fst8internal14CompactFstImplINS1_6ArcTplINS1_12LogWeightTplIfEEEENS1_16DefaultCompactorINS1_17AcceptorCompactorIS7_EEjNS1_19DefaultCompactStoreISt4pairISC_IiS6_EiEjEEEENS1_17DefaultCacheStoreIS7_EEEEE9constructISJ_JEEEvPT_DpOT0_\n   fun:_ZNSt16allocator_traitsISaIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_12LogWeightTplIfEEEENS0_16DefaultCompactorINS0_17AcceptorCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairISB_IiS5_EiEjEEEENS0_17DefaultCacheStoreIS6_EEEEEE9constructISI_JEEEvRSJ_PT_DpOT0_\n   fun:_ZNSt23_Sp_counted_ptr_inplaceIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_12LogWeightTplIfEEEENS0_16DefaultCompactorINS0_17AcceptorCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairISB_IiS5_EiEjEEEENS0_17DefaultCacheStoreIS6_EEEESaISI_ELN9__gnu_cxx12_Lock_policyE2EEC1IJEEESJ_DpOT_\n   fun:_ZNSt14__shared_countILN9__gnu_cxx12_Lock_policyE2EEC1IN3fst8internal14CompactFstImplINS4_6ArcTplINS4_12LogWeightTplIfEEEENS4_16DefaultCompactorINS4_17AcceptorCompactorISA_EEjNS4_19DefaultCompactStoreISt4pairISF_IiS9_EiEjEEEENS4_17DefaultCacheStoreISA_EEEESaISM_EJEEERPT_St20_Sp_alloc_shared_tagIT0_EDpOT1_\n   fun:_ZNSt12__shared_ptrIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_12LogWeightTplIfEEEENS0_16DefaultCompactorINS0_17AcceptorCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairISB_IiS5_EiEjEEEENS0_17DefaultCacheStoreIS6_EEEELN9__gnu_cxx12_Lock_policyE2EEC1ISaISI_EJEEESt20_Sp_alloc_shared_tagIT_EDpOT0_\n   fun:_ZNSt10shared_ptrIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_12LogWeightTplIfEEEENS0_16DefaultCompactorINS0_17AcceptorCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairISB_IiS5_EiEjEEEENS0_17DefaultCacheStoreIS6_EEEEEC1ISaISI_EJEEESt20_Sp_alloc_shared_tagIT_EDpOT0_\n   fun:_ZSt15allocate_sharedIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_12LogWeightTplIfEEEENS0_16DefaultCompactorINS0_17AcceptorCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairISB_IiS5_EiEjEEEENS0_17DefaultCacheStoreIS6_EEEESaISI_EJEESt10shared_ptrIT_ERKT0_DpOT1_\n}\n{\n   <openfst>\n   Memcheck:Leak\n   match-leak-kinds: reachable\n   fun:_Znwm\n   fun:_ZNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEE12_M_constructIPcEEvT_S7_St20forward_iterator_tag\n   fun:_ZNSt4pairINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEEN3fst16FstRegisterEntryINS6_6ArcTplINS6_12LogWeightTplIfEEEEEEEC1IS5_SC_Lb1EEERKS5_RKSC_\n   fun:_ZSt9make_pairIRKNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEERKN3fst16FstRegisterEntryINS8_6ArcTplINS8_12LogWeightTplIfEEEEEEESt4pairINSt17__decay_and_stripIT_E6__typeENSI_IT0_E6__typeEEOSJ_OSM_\n   fun:_ZN3fst15GenericRegisterINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEENS_16FstRegisterEntryINS_6ArcTplINS_12LogWeightTplIfEEEEEENS_11FstRegisterISB_EEE8SetEntryERKS6_RKSC_\n   fun:_ZN3fst17GenericRegistererINS_11FstRegisterINS_6ArcTplINS_12LogWeightTplIfEEEEEEEC1ENSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEENS_16FstRegisterEntryIS5_EE\n   fun:_ZN3fst13FstRegistererINS_10CompactFstINS_6ArcTplINS_12LogWeightTplIfEEEENS_17AcceptorCompactorIS5_EEjNS_19DefaultCompactStoreISt4pairIS9_IiS4_EiEjEENS_17DefaultCacheStoreIS5_EEEEEC1Ev\n   fun:_Z41__static_initialization_and_destruction_0ii\n}\n{\n   <openfst>\n   Memcheck:Leak\n   match-leak-kinds: reachable\n   fun:_Znwm\n   fun:_ZNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEE12_M_constructIPcEEvT_S7_St20forward_iterator_tag\n   fun:_ZZN3fst16DefaultCompactorINS_19UnweightedCompactorINS_6ArcTplINS_17TropicalWeightTplIfEEEEEEjNS_19DefaultCompactStoreISt4pairIS8_IiiEiEjEEE4TypeB5cxx11EvENKUlvE_clEv\n   fun:_ZN3fst16DefaultCompactorINS_19UnweightedCompactorINS_6ArcTplINS_17TropicalWeightTplIfEEEEEEjNS_19DefaultCompactStoreISt4pairIS8_IiiEiEjEEE4TypeB5cxx11Ev\n   fun:_ZN3fst8internal14CompactFstImplINS_6ArcTplINS_17TropicalWeightTplIfEEEENS_16DefaultCompactorINS_19UnweightedCompactorIS5_EEjNS_19DefaultCompactStoreISt4pairISA_IiiEiEjEEEENS_17DefaultCacheStoreIS5_EEEC1Ev\n   fun:_ZN9__gnu_cxx13new_allocatorIN3fst8internal14CompactFstImplINS1_6ArcTplINS1_17TropicalWeightTplIfEEEENS1_16DefaultCompactorINS1_19UnweightedCompactorIS7_EEjNS1_19DefaultCompactStoreISt4pairISC_IiiEiEjEEEENS1_17DefaultCacheStoreIS7_EEEEE9constructISJ_JEEEvPT_DpOT0_\n   fun:_ZNSt16allocator_traitsISaIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_17TropicalWeightTplIfEEEENS0_16DefaultCompactorINS0_19UnweightedCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairISB_IiiEiEjEEEENS0_17DefaultCacheStoreIS6_EEEEEE9constructISI_JEEEvRSJ_PT_DpOT0_\n   fun:_ZNSt23_Sp_counted_ptr_inplaceIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_17TropicalWeightTplIfEEEENS0_16DefaultCompactorINS0_19UnweightedCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairISB_IiiEiEjEEEENS0_17DefaultCacheStoreIS6_EEEESaISI_ELN9__gnu_cxx12_Lock_policyE2EEC1IJEEESJ_DpOT_\n   fun:_ZNSt14__shared_countILN9__gnu_cxx12_Lock_policyE2EEC1IN3fst8internal14CompactFstImplINS4_6ArcTplINS4_17TropicalWeightTplIfEEEENS4_16DefaultCompactorINS4_19UnweightedCompactorISA_EEjNS4_19DefaultCompactStoreISt4pairISF_IiiEiEjEEEENS4_17DefaultCacheStoreISA_EEEESaISM_EJEEERPT_St20_Sp_alloc_shared_tagIT0_EDpOT1_\n   fun:_ZNSt12__shared_ptrIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_17TropicalWeightTplIfEEEENS0_16DefaultCompactorINS0_19UnweightedCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairISB_IiiEiEjEEEENS0_17DefaultCacheStoreIS6_EEEELN9__gnu_cxx12_Lock_policyE2EEC1ISaISI_EJEEESt20_Sp_alloc_shared_tagIT_EDpOT0_\n   fun:_ZNSt10shared_ptrIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_17TropicalWeightTplIfEEEENS0_16DefaultCompactorINS0_19UnweightedCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairISB_IiiEiEjEEEENS0_17DefaultCacheStoreIS6_EEEEEC1ISaISI_EJEEESt20_Sp_alloc_shared_tagIT_EDpOT0_\n   fun:_ZSt15allocate_sharedIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_17TropicalWeightTplIfEEEENS0_16DefaultCompactorINS0_19UnweightedCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairISB_IiiEiEjEEEENS0_17DefaultCacheStoreIS6_EEEESaISI_EJEESt10shared_ptrIT_ERKT0_DpOT1_\n}\n{\n   <openfst>\n   Memcheck:Leak\n   match-leak-kinds: reachable\n   fun:_Znwm\n   fun:_ZNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEE12_M_constructIPcEEvT_S7_St20forward_iterator_tag\n   fun:_ZNSt4pairINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEEN3fst16FstRegisterEntryINS6_6ArcTplINS6_17TropicalWeightTplIfEEEEEEEC1IS5_SC_Lb1EEERKS5_RKSC_\n   fun:_ZSt9make_pairIRKNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEERKN3fst16FstRegisterEntryINS8_6ArcTplINS8_17TropicalWeightTplIfEEEEEEESt4pairINSt17__decay_and_stripIT_E6__typeENSI_IT0_E6__typeEEOSJ_OSM_\n   fun:_ZN3fst15GenericRegisterINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEENS_16FstRegisterEntryINS_6ArcTplINS_17TropicalWeightTplIfEEEEEENS_11FstRegisterISB_EEE8SetEntryERKS6_RKSC_\n   fun:_ZN3fst17GenericRegistererINS_11FstRegisterINS_6ArcTplINS_17TropicalWeightTplIfEEEEEEEC1ENSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEENS_16FstRegisterEntryIS5_EE\n   fun:_ZN3fst13FstRegistererINS_10CompactFstINS_6ArcTplINS_17TropicalWeightTplIfEEEENS_19UnweightedCompactorIS5_EEjNS_19DefaultCompactStoreISt4pairIS9_IiiEiEjEENS_17DefaultCacheStoreIS5_EEEEEC1Ev\n   fun:_Z41__static_initialization_and_destruction_0ii\n}\n{\n   <openfst>\n   Memcheck:Leak\n   match-leak-kinds: reachable\n   fun:_Znwm\n   fun:_ZNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEE12_M_constructIPcEEvT_S7_St20forward_iterator_tag\n   fun:_ZZN3fst16DefaultCompactorINS_19UnweightedCompactorINS_6ArcTplINS_12LogWeightTplIfEEEEEEjNS_19DefaultCompactStoreISt4pairIS8_IiiEiEjEEE4TypeB5cxx11EvENKUlvE_clEv\n   fun:_ZN3fst16DefaultCompactorINS_19UnweightedCompactorINS_6ArcTplINS_12LogWeightTplIfEEEEEEjNS_19DefaultCompactStoreISt4pairIS8_IiiEiEjEEE4TypeB5cxx11Ev\n   fun:_ZN3fst8internal14CompactFstImplINS_6ArcTplINS_12LogWeightTplIfEEEENS_16DefaultCompactorINS_19UnweightedCompactorIS5_EEjNS_19DefaultCompactStoreISt4pairISA_IiiEiEjEEEENS_17DefaultCacheStoreIS5_EEEC1Ev\n   fun:_ZN9__gnu_cxx13new_allocatorIN3fst8internal14CompactFstImplINS1_6ArcTplINS1_12LogWeightTplIfEEEENS1_16DefaultCompactorINS1_19UnweightedCompactorIS7_EEjNS1_19DefaultCompactStoreISt4pairISC_IiiEiEjEEEENS1_17DefaultCacheStoreIS7_EEEEE9constructISJ_JEEEvPT_DpOT0_\n   fun:_ZNSt16allocator_traitsISaIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_12LogWeightTplIfEEEENS0_16DefaultCompactorINS0_19UnweightedCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairISB_IiiEiEjEEEENS0_17DefaultCacheStoreIS6_EEEEEE9constructISI_JEEEvRSJ_PT_DpOT0_\n   fun:_ZNSt23_Sp_counted_ptr_inplaceIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_12LogWeightTplIfEEEENS0_16DefaultCompactorINS0_19UnweightedCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairISB_IiiEiEjEEEENS0_17DefaultCacheStoreIS6_EEEESaISI_ELN9__gnu_cxx12_Lock_policyE2EEC1IJEEESJ_DpOT_\n   fun:_ZNSt14__shared_countILN9__gnu_cxx12_Lock_policyE2EEC1IN3fst8internal14CompactFstImplINS4_6ArcTplINS4_12LogWeightTplIfEEEENS4_16DefaultCompactorINS4_19UnweightedCompactorISA_EEjNS4_19DefaultCompactStoreISt4pairISF_IiiEiEjEEEENS4_17DefaultCacheStoreISA_EEEESaISM_EJEEERPT_St20_Sp_alloc_shared_tagIT0_EDpOT1_\n   fun:_ZNSt12__shared_ptrIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_12LogWeightTplIfEEEENS0_16DefaultCompactorINS0_19UnweightedCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairISB_IiiEiEjEEEENS0_17DefaultCacheStoreIS6_EEEELN9__gnu_cxx12_Lock_policyE2EEC1ISaISI_EJEEESt20_Sp_alloc_shared_tagIT_EDpOT0_\n   fun:_ZNSt10shared_ptrIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_12LogWeightTplIfEEEENS0_16DefaultCompactorINS0_19UnweightedCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairISB_IiiEiEjEEEENS0_17DefaultCacheStoreIS6_EEEEEC1ISaISI_EJEEESt20_Sp_alloc_shared_tagIT_EDpOT0_\n   fun:_ZSt15allocate_sharedIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_12LogWeightTplIfEEEENS0_16DefaultCompactorINS0_19UnweightedCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairISB_IiiEiEjEEEENS0_17DefaultCacheStoreIS6_EEEESaISI_EJEESt10shared_ptrIT_ERKT0_DpOT1_\n}\n{\n   <openfst>\n   Memcheck:Leak\n   match-leak-kinds: reachable\n   fun:_Znwm\n   fun:_ZNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEE12_M_constructIPcEEvT_S7_St20forward_iterator_tag\n   fun:_ZNSt4pairINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEEN3fst16FstRegisterEntryINS6_6ArcTplINS6_12LogWeightTplIfEEEEEEEC1IS5_SC_Lb1EEERKS5_RKSC_\n   fun:_ZSt9make_pairIRKNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEERKN3fst16FstRegisterEntryINS8_6ArcTplINS8_12LogWeightTplIfEEEEEEESt4pairINSt17__decay_and_stripIT_E6__typeENSI_IT0_E6__typeEEOSJ_OSM_\n   fun:_ZN3fst15GenericRegisterINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEENS_16FstRegisterEntryINS_6ArcTplINS_12LogWeightTplIfEEEEEENS_11FstRegisterISB_EEE8SetEntryERKS6_RKSC_\n   fun:_ZN3fst17GenericRegistererINS_11FstRegisterINS_6ArcTplINS_12LogWeightTplIfEEEEEEEC1ENSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEENS_16FstRegisterEntryIS5_EE\n   fun:_ZN3fst13FstRegistererINS_10CompactFstINS_6ArcTplINS_12LogWeightTplIfEEEENS_19UnweightedCompactorIS5_EEjNS_19DefaultCompactStoreISt4pairIS9_IiiEiEjEENS_17DefaultCacheStoreIS5_EEEEEC1Ev\n   fun:_Z41__static_initialization_and_destruction_0ii\n}\n{\n   <openfst>\n   Memcheck:Leak\n   match-leak-kinds: reachable\n   fun:_Znwm\n   fun:_ZNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEE12_M_constructIPcEEvT_S7_St20forward_iterator_tag\n   fun:_ZNSt4pairINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEE15FlagDescriptionIbEEC1IS5_S7_Lb1EEERKS5_RKS7_\n   fun:_ZSt9make_pairIRKNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEERK15FlagDescriptionIbEESt4pairINSt17__decay_and_stripIT_E6__typeENSD_IT0_E6__typeEEOSE_OSH_\n   fun:_ZN12FlagRegisterIbE14SetDescriptionERKNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEERK15FlagDescriptionIbE\n   fun:_ZN14FlagRegistererIbEC1ERKNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEERK15FlagDescriptionIbE\n   fun:_Z41__static_initialization_and_destruction_0ii\n}\n{\n   <openfst>\n   Memcheck:Leak\n   match-leak-kinds: reachable\n   fun:_Znwm\n   fun:_ZNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEE12_M_constructIPKcEEvT_S8_St20forward_iterator_tag\n   fun:_ZN3fst27UnweightedAcceptorCompactorINS_6ArcTplINS_17TropicalWeightTplIfEEEEE4TypeB5cxx11Ev\n   fun:_ZZN3fst16DefaultCompactorINS_27UnweightedAcceptorCompactorINS_6ArcTplINS_17TropicalWeightTplIfEEEEEEjNS_19DefaultCompactStoreISt4pairIiiEjEEE4TypeB5cxx11EvENKUlvE_clEv\n   fun:_ZN3fst16DefaultCompactorINS_27UnweightedAcceptorCompactorINS_6ArcTplINS_17TropicalWeightTplIfEEEEEEjNS_19DefaultCompactStoreISt4pairIiiEjEEE4TypeB5cxx11Ev\n   fun:_ZN3fst8internal14CompactFstImplINS_6ArcTplINS_17TropicalWeightTplIfEEEENS_16DefaultCompactorINS_27UnweightedAcceptorCompactorIS5_EEjNS_19DefaultCompactStoreISt4pairIiiEjEEEENS_17DefaultCacheStoreIS5_EEEC1Ev\n   fun:_ZN9__gnu_cxx13new_allocatorIN3fst8internal14CompactFstImplINS1_6ArcTplINS1_17TropicalWeightTplIfEEEENS1_16DefaultCompactorINS1_27UnweightedAcceptorCompactorIS7_EEjNS1_19DefaultCompactStoreISt4pairIiiEjEEEENS1_17DefaultCacheStoreIS7_EEEEE9constructISI_JEEEvPT_DpOT0_\n   fun:_ZNSt16allocator_traitsISaIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_17TropicalWeightTplIfEEEENS0_16DefaultCompactorINS0_27UnweightedAcceptorCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairIiiEjEEEENS0_17DefaultCacheStoreIS6_EEEEEE9constructISH_JEEEvRSI_PT_DpOT0_\n   fun:_ZNSt23_Sp_counted_ptr_inplaceIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_17TropicalWeightTplIfEEEENS0_16DefaultCompactorINS0_27UnweightedAcceptorCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairIiiEjEEEENS0_17DefaultCacheStoreIS6_EEEESaISH_ELN9__gnu_cxx12_Lock_policyE2EEC1IJEEESI_DpOT_\n   fun:_ZNSt14__shared_countILN9__gnu_cxx12_Lock_policyE2EEC1IN3fst8internal14CompactFstImplINS4_6ArcTplINS4_17TropicalWeightTplIfEEEENS4_16DefaultCompactorINS4_27UnweightedAcceptorCompactorISA_EEjNS4_19DefaultCompactStoreISt4pairIiiEjEEEENS4_17DefaultCacheStoreISA_EEEESaISL_EJEEERPT_St20_Sp_alloc_shared_tagIT0_EDpOT1_\n   fun:_ZNSt12__shared_ptrIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_17TropicalWeightTplIfEEEENS0_16DefaultCompactorINS0_27UnweightedAcceptorCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairIiiEjEEEENS0_17DefaultCacheStoreIS6_EEEELN9__gnu_cxx12_Lock_policyE2EEC1ISaISH_EJEEESt20_Sp_alloc_shared_tagIT_EDpOT0_\n   fun:_ZNSt10shared_ptrIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_17TropicalWeightTplIfEEEENS0_16DefaultCompactorINS0_27UnweightedAcceptorCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairIiiEjEEEENS0_17DefaultCacheStoreIS6_EEEEEC1ISaISH_EJEEESt20_Sp_alloc_shared_tagIT_EDpOT0_\n}\n{\n   <openfst>\n   Memcheck:Leak\n   match-leak-kinds: reachable\n   fun:_Znwm\n   fun:_ZNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEE12_M_constructIPKcEEvT_S8_St20forward_iterator_tag\n   fun:_ZN3fst27UnweightedAcceptorCompactorINS_6ArcTplINS_12LogWeightTplIfEEEEE4TypeB5cxx11Ev\n   fun:_ZZN3fst16DefaultCompactorINS_27UnweightedAcceptorCompactorINS_6ArcTplINS_12LogWeightTplIfEEEEEEjNS_19DefaultCompactStoreISt4pairIiiEjEEE4TypeB5cxx11EvENKUlvE_clEv\n   fun:_ZN3fst16DefaultCompactorINS_27UnweightedAcceptorCompactorINS_6ArcTplINS_12LogWeightTplIfEEEEEEjNS_19DefaultCompactStoreISt4pairIiiEjEEE4TypeB5cxx11Ev\n   fun:_ZN3fst8internal14CompactFstImplINS_6ArcTplINS_12LogWeightTplIfEEEENS_16DefaultCompactorINS_27UnweightedAcceptorCompactorIS5_EEjNS_19DefaultCompactStoreISt4pairIiiEjEEEENS_17DefaultCacheStoreIS5_EEEC1Ev\n   fun:_ZN9__gnu_cxx13new_allocatorIN3fst8internal14CompactFstImplINS1_6ArcTplINS1_12LogWeightTplIfEEEENS1_16DefaultCompactorINS1_27UnweightedAcceptorCompactorIS7_EEjNS1_19DefaultCompactStoreISt4pairIiiEjEEEENS1_17DefaultCacheStoreIS7_EEEEE9constructISI_JEEEvPT_DpOT0_\n   fun:_ZNSt16allocator_traitsISaIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_12LogWeightTplIfEEEENS0_16DefaultCompactorINS0_27UnweightedAcceptorCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairIiiEjEEEENS0_17DefaultCacheStoreIS6_EEEEEE9constructISH_JEEEvRSI_PT_DpOT0_\n   fun:_ZNSt23_Sp_counted_ptr_inplaceIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_12LogWeightTplIfEEEENS0_16DefaultCompactorINS0_27UnweightedAcceptorCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairIiiEjEEEENS0_17DefaultCacheStoreIS6_EEEESaISH_ELN9__gnu_cxx12_Lock_policyE2EEC1IJEEESI_DpOT_\n   fun:_ZNSt14__shared_countILN9__gnu_cxx12_Lock_policyE2EEC1IN3fst8internal14CompactFstImplINS4_6ArcTplINS4_12LogWeightTplIfEEEENS4_16DefaultCompactorINS4_27UnweightedAcceptorCompactorISA_EEjNS4_19DefaultCompactStoreISt4pairIiiEjEEEENS4_17DefaultCacheStoreISA_EEEESaISL_EJEEERPT_St20_Sp_alloc_shared_tagIT0_EDpOT1_\n   fun:_ZNSt12__shared_ptrIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_12LogWeightTplIfEEEENS0_16DefaultCompactorINS0_27UnweightedAcceptorCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairIiiEjEEEENS0_17DefaultCacheStoreIS6_EEEELN9__gnu_cxx12_Lock_policyE2EEC1ISaISH_EJEEESt20_Sp_alloc_shared_tagIT_EDpOT0_\n   fun:_ZNSt10shared_ptrIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_12LogWeightTplIfEEEENS0_16DefaultCompactorINS0_27UnweightedAcceptorCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairIiiEjEEEENS0_17DefaultCacheStoreIS6_EEEEEC1ISaISH_EJEEESt20_Sp_alloc_shared_tagIT_EDpOT0_\n}\n{\n   <openfst>\n   Memcheck:Leak\n   match-leak-kinds: reachable\n   fun:_Znwm\n   fun:_ZNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEE12_M_constructIPcEEvT_S7_St20forward_iterator_tag\n   fun:_ZNSt4pairINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEE15FlagDescriptionIS5_EEC1IS5_S7_Lb1EEERKS5_RKS7_\n   fun:_ZSt9make_pairIRKNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEERK15FlagDescriptionIS5_EESt4pairINSt17__decay_and_stripIT_E6__typeENSD_IT0_E6__typeEEOSE_OSH_\n   fun:_ZN12FlagRegisterINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEEE14SetDescriptionERKS5_RK15FlagDescriptionIS5_E\n   fun:_ZN14FlagRegistererINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEEEC1ERKS5_RK15FlagDescriptionIS5_E\n   fun:_Z41__static_initialization_and_destruction_0ii\n}\n{\n   <openfst>\n   Memcheck:Leak\n   match-leak-kinds: reachable\n   fun:_Znwm\n   fun:_ZNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEE12_M_constructIPcEEvT_S7_St20forward_iterator_tag\n   fun:_ZNSt4pairINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEE15FlagDescriptionIS5_EEC1IS5_S7_Lb1EEERKS5_RKS7_\n   fun:_ZSt9make_pairIRKNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEERK15FlagDescriptionIS5_EESt4pairINSt17__decay_and_stripIT_E6__typeENSD_IT0_E6__typeEEOSE_OSH_\n   fun:_ZN12FlagRegisterINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEEE14SetDescriptionERKS5_RK15FlagDescriptionIS5_E\n   fun:_ZN14FlagRegistererINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEEEC1ERKS5_RK15FlagDescriptionIS5_E\n   fun:_Z41__static_initialization_and_destruction_0ii\n}\n{\n   <openfst>\n   Memcheck:Leak\n   match-leak-kinds: reachable\n   fun:_Znwm\n   fun:_ZNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEE12_M_constructIPcEEvT_S7_St20forward_iterator_tag\n   fun:_ZNSt4pairINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEE15FlagDescriptionIbEEC1IS5_S7_Lb1EEERKS5_RKS7_\n   fun:_ZSt9make_pairIRKNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEERK15FlagDescriptionIbEESt4pairINSt17__decay_and_stripIT_E6__typeENSD_IT0_E6__typeEEOSE_OSH_\n   fun:_ZN12FlagRegisterIbE14SetDescriptionERKNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEERK15FlagDescriptionIbE\n   fun:_ZN14FlagRegistererIbEC1ERKNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEERK15FlagDescriptionIbE\n   fun:_Z41__static_initialization_and_destruction_0ii\n}\n{\n   <openfst>\n   Memcheck:Leak\n   match-leak-kinds: reachable\n   fun:_Znwm\n   fun:_ZNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEE12_M_constructIPcEEvT_S7_St20forward_iterator_tag\n   fun:_ZNSt4pairINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEE15FlagDescriptionIS5_EEC1IS5_S7_Lb1EEERKS5_RKS7_\n   fun:_ZSt9make_pairIRKNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEERK15FlagDescriptionIS5_EESt4pairINSt17__decay_and_stripIT_E6__typeENSD_IT0_E6__typeEEOSE_OSH_\n   fun:_ZN12FlagRegisterINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEEE14SetDescriptionERKS5_RK15FlagDescriptionIS5_E\n   fun:_ZN14FlagRegistererINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEEEC1ERKS5_RK15FlagDescriptionIS5_E\n   fun:_Z41__static_initialization_and_destruction_0ii\n}\n{\n   <openfst>\n   Memcheck:Leak\n   match-leak-kinds: reachable\n   fun:_Znwm\n   fun:_ZNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEE12_M_constructIPcEEvT_S7_St20forward_iterator_tag\n   fun:_ZZN3fst16DefaultCompactorINS_23WeightedStringCompactorINS_6ArcTplINS_17TropicalWeightTplIfEEEEEEjNS_19DefaultCompactStoreISt4pairIiS4_EjEEE4TypeB5cxx11EvENKUlvE_clEv\n   fun:_ZN3fst16DefaultCompactorINS_23WeightedStringCompactorINS_6ArcTplINS_17TropicalWeightTplIfEEEEEEjNS_19DefaultCompactStoreISt4pairIiS4_EjEEE4TypeB5cxx11Ev\n   fun:_ZN3fst8internal14CompactFstImplINS_6ArcTplINS_17TropicalWeightTplIfEEEENS_16DefaultCompactorINS_23WeightedStringCompactorIS5_EEjNS_19DefaultCompactStoreISt4pairIiS4_EjEEEENS_17DefaultCacheStoreIS5_EEEC1Ev\n   fun:_ZN9__gnu_cxx13new_allocatorIN3fst8internal14CompactFstImplINS1_6ArcTplINS1_17TropicalWeightTplIfEEEENS1_16DefaultCompactorINS1_23WeightedStringCompactorIS7_EEjNS1_19DefaultCompactStoreISt4pairIiS6_EjEEEENS1_17DefaultCacheStoreIS7_EEEEE9constructISI_JEEEvPT_DpOT0_\n   fun:_ZNSt16allocator_traitsISaIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_17TropicalWeightTplIfEEEENS0_16DefaultCompactorINS0_23WeightedStringCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairIiS5_EjEEEENS0_17DefaultCacheStoreIS6_EEEEEE9constructISH_JEEEvRSI_PT_DpOT0_\n   fun:_ZNSt23_Sp_counted_ptr_inplaceIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_17TropicalWeightTplIfEEEENS0_16DefaultCompactorINS0_23WeightedStringCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairIiS5_EjEEEENS0_17DefaultCacheStoreIS6_EEEESaISH_ELN9__gnu_cxx12_Lock_policyE2EEC1IJEEESI_DpOT_\n   fun:_ZNSt14__shared_countILN9__gnu_cxx12_Lock_policyE2EEC1IN3fst8internal14CompactFstImplINS4_6ArcTplINS4_17TropicalWeightTplIfEEEENS4_16DefaultCompactorINS4_23WeightedStringCompactorISA_EEjNS4_19DefaultCompactStoreISt4pairIiS9_EjEEEENS4_17DefaultCacheStoreISA_EEEESaISL_EJEEERPT_St20_Sp_alloc_shared_tagIT0_EDpOT1_\n   fun:_ZNSt12__shared_ptrIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_17TropicalWeightTplIfEEEENS0_16DefaultCompactorINS0_23WeightedStringCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairIiS5_EjEEEENS0_17DefaultCacheStoreIS6_EEEELN9__gnu_cxx12_Lock_policyE2EEC1ISaISH_EJEEESt20_Sp_alloc_shared_tagIT_EDpOT0_\n   fun:_ZNSt10shared_ptrIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_17TropicalWeightTplIfEEEENS0_16DefaultCompactorINS0_23WeightedStringCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairIiS5_EjEEEENS0_17DefaultCacheStoreIS6_EEEEEC1ISaISH_EJEEESt20_Sp_alloc_shared_tagIT_EDpOT0_\n   fun:_ZSt15allocate_sharedIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_17TropicalWeightTplIfEEEENS0_16DefaultCompactorINS0_23WeightedStringCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairIiS5_EjEEEENS0_17DefaultCacheStoreIS6_EEEESaISH_EJEESt10shared_ptrIT_ERKT0_DpOT1_\n}\n{\n   <openfst>\n   Memcheck:Leak\n   match-leak-kinds: reachable\n   fun:_Znwm\n   fun:_ZNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEE12_M_constructIPcEEvT_S7_St20forward_iterator_tag\n   fun:_ZNSt4pairINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEEN3fst16FstRegisterEntryINS6_6ArcTplINS6_17TropicalWeightTplIfEEEEEEEC1IS5_SC_Lb1EEERKS5_RKSC_\n   fun:_ZSt9make_pairIRKNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEERKN3fst16FstRegisterEntryINS8_6ArcTplINS8_17TropicalWeightTplIfEEEEEEESt4pairINSt17__decay_and_stripIT_E6__typeENSI_IT0_E6__typeEEOSJ_OSM_\n   fun:_ZN3fst15GenericRegisterINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEENS_16FstRegisterEntryINS_6ArcTplINS_17TropicalWeightTplIfEEEEEENS_11FstRegisterISB_EEE8SetEntryERKS6_RKSC_\n   fun:_ZN3fst17GenericRegistererINS_11FstRegisterINS_6ArcTplINS_17TropicalWeightTplIfEEEEEEEC1ENSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEENS_16FstRegisterEntryIS5_EE\n   fun:_ZN3fst13FstRegistererINS_10CompactFstINS_6ArcTplINS_17TropicalWeightTplIfEEEENS_23WeightedStringCompactorIS5_EEjNS_19DefaultCompactStoreISt4pairIiS4_EjEENS_17DefaultCacheStoreIS5_EEEEEC1Ev\n   fun:_Z41__static_initialization_and_destruction_0ii\n}\n{\n   <openfst>\n   Memcheck:Leak\n   match-leak-kinds: reachable\n   fun:_Znwm\n   fun:_ZNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEE12_M_constructIPcEEvT_S7_St20forward_iterator_tag\n   fun:_ZZN3fst16DefaultCompactorINS_23WeightedStringCompactorINS_6ArcTplINS_12LogWeightTplIfEEEEEEjNS_19DefaultCompactStoreISt4pairIiS4_EjEEE4TypeB5cxx11EvENKUlvE_clEv\n   fun:_ZN3fst16DefaultCompactorINS_23WeightedStringCompactorINS_6ArcTplINS_12LogWeightTplIfEEEEEEjNS_19DefaultCompactStoreISt4pairIiS4_EjEEE4TypeB5cxx11Ev\n   fun:_ZN3fst8internal14CompactFstImplINS_6ArcTplINS_12LogWeightTplIfEEEENS_16DefaultCompactorINS_23WeightedStringCompactorIS5_EEjNS_19DefaultCompactStoreISt4pairIiS4_EjEEEENS_17DefaultCacheStoreIS5_EEEC1Ev\n   fun:_ZN9__gnu_cxx13new_allocatorIN3fst8internal14CompactFstImplINS1_6ArcTplINS1_12LogWeightTplIfEEEENS1_16DefaultCompactorINS1_23WeightedStringCompactorIS7_EEjNS1_19DefaultCompactStoreISt4pairIiS6_EjEEEENS1_17DefaultCacheStoreIS7_EEEEE9constructISI_JEEEvPT_DpOT0_\n   fun:_ZNSt16allocator_traitsISaIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_12LogWeightTplIfEEEENS0_16DefaultCompactorINS0_23WeightedStringCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairIiS5_EjEEEENS0_17DefaultCacheStoreIS6_EEEEEE9constructISH_JEEEvRSI_PT_DpOT0_\n   fun:_ZNSt23_Sp_counted_ptr_inplaceIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_12LogWeightTplIfEEEENS0_16DefaultCompactorINS0_23WeightedStringCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairIiS5_EjEEEENS0_17DefaultCacheStoreIS6_EEEESaISH_ELN9__gnu_cxx12_Lock_policyE2EEC1IJEEESI_DpOT_\n   fun:_ZNSt14__shared_countILN9__gnu_cxx12_Lock_policyE2EEC1IN3fst8internal14CompactFstImplINS4_6ArcTplINS4_12LogWeightTplIfEEEENS4_16DefaultCompactorINS4_23WeightedStringCompactorISA_EEjNS4_19DefaultCompactStoreISt4pairIiS9_EjEEEENS4_17DefaultCacheStoreISA_EEEESaISL_EJEEERPT_St20_Sp_alloc_shared_tagIT0_EDpOT1_\n   fun:_ZNSt12__shared_ptrIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_12LogWeightTplIfEEEENS0_16DefaultCompactorINS0_23WeightedStringCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairIiS5_EjEEEENS0_17DefaultCacheStoreIS6_EEEELN9__gnu_cxx12_Lock_policyE2EEC1ISaISH_EJEEESt20_Sp_alloc_shared_tagIT_EDpOT0_\n   fun:_ZNSt10shared_ptrIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_12LogWeightTplIfEEEENS0_16DefaultCompactorINS0_23WeightedStringCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairIiS5_EjEEEENS0_17DefaultCacheStoreIS6_EEEEEC1ISaISH_EJEEESt20_Sp_alloc_shared_tagIT_EDpOT0_\n   fun:_ZSt15allocate_sharedIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_12LogWeightTplIfEEEENS0_16DefaultCompactorINS0_23WeightedStringCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairIiS5_EjEEEENS0_17DefaultCacheStoreIS6_EEEESaISH_EJEESt10shared_ptrIT_ERKT0_DpOT1_\n}\n{\n   <openfst>\n   Memcheck:Leak\n   match-leak-kinds: reachable\n   fun:_Znwm\n   fun:_ZNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEE12_M_constructIPcEEvT_S7_St20forward_iterator_tag\n   fun:_ZNSt4pairINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEEN3fst16FstRegisterEntryINS6_6ArcTplINS6_12LogWeightTplIfEEEEEEEC1IS5_SC_Lb1EEERKS5_RKSC_\n   fun:_ZSt9make_pairIRKNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEERKN3fst16FstRegisterEntryINS8_6ArcTplINS8_12LogWeightTplIfEEEEEEESt4pairINSt17__decay_and_stripIT_E6__typeENSI_IT0_E6__typeEEOSJ_OSM_\n   fun:_ZN3fst15GenericRegisterINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEENS_16FstRegisterEntryINS_6ArcTplINS_12LogWeightTplIfEEEEEENS_11FstRegisterISB_EEE8SetEntryERKS6_RKSC_\n   fun:_ZN3fst17GenericRegistererINS_11FstRegisterINS_6ArcTplINS_12LogWeightTplIfEEEEEEEC1ENSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEENS_16FstRegisterEntryIS5_EE\n   fun:_ZN3fst13FstRegistererINS_10CompactFstINS_6ArcTplINS_12LogWeightTplIfEEEENS_23WeightedStringCompactorIS5_EEjNS_19DefaultCompactStoreISt4pairIiS4_EjEENS_17DefaultCacheStoreIS5_EEEEEC1Ev\n   fun:_Z41__static_initialization_and_destruction_0ii\n}\n{\n   <openfst>\n   Memcheck:Leak\n   match-leak-kinds: reachable\n   fun:_Znwm\n   fun:_ZNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEE12_M_constructIPcEEvT_S7_St20forward_iterator_tag\n   fun:_ZNSt4pairINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEE15FlagDescriptionIlEEC1IS5_S7_Lb1EEERKS5_RKS7_\n   fun:_ZSt9make_pairIRKNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEERK15FlagDescriptionIlEESt4pairINSt17__decay_and_stripIT_E6__typeENSD_IT0_E6__typeEEOSE_OSH_\n   fun:_ZN12FlagRegisterIlE14SetDescriptionERKNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEERK15FlagDescriptionIlE\n   fun:_ZN14FlagRegistererIlEC1ERKNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEERK15FlagDescriptionIlE\n   fun:_Z41__static_initialization_and_destruction_0ii\n}\n{\n   <openfst>\n   Memcheck:Leak\n   match-leak-kinds: reachable\n   fun:_Znwm\n   fun:_ZNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEE12_M_constructIPcEEvT_S7_St20forward_iterator_tag\n   fun:_ZZN3fst16DefaultCompactorINS_27UnweightedAcceptorCompactorINS_6ArcTplINS_17TropicalWeightTplIfEEEEEEjNS_19DefaultCompactStoreISt4pairIiiEjEEE4TypeB5cxx11EvENKUlvE_clEv\n   fun:_ZN3fst16DefaultCompactorINS_27UnweightedAcceptorCompactorINS_6ArcTplINS_17TropicalWeightTplIfEEEEEEjNS_19DefaultCompactStoreISt4pairIiiEjEEE4TypeB5cxx11Ev\n   fun:_ZN3fst8internal14CompactFstImplINS_6ArcTplINS_17TropicalWeightTplIfEEEENS_16DefaultCompactorINS_27UnweightedAcceptorCompactorIS5_EEjNS_19DefaultCompactStoreISt4pairIiiEjEEEENS_17DefaultCacheStoreIS5_EEEC1Ev\n   fun:_ZN9__gnu_cxx13new_allocatorIN3fst8internal14CompactFstImplINS1_6ArcTplINS1_17TropicalWeightTplIfEEEENS1_16DefaultCompactorINS1_27UnweightedAcceptorCompactorIS7_EEjNS1_19DefaultCompactStoreISt4pairIiiEjEEEENS1_17DefaultCacheStoreIS7_EEEEE9constructISI_JEEEvPT_DpOT0_\n   fun:_ZNSt16allocator_traitsISaIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_17TropicalWeightTplIfEEEENS0_16DefaultCompactorINS0_27UnweightedAcceptorCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairIiiEjEEEENS0_17DefaultCacheStoreIS6_EEEEEE9constructISH_JEEEvRSI_PT_DpOT0_\n   fun:_ZNSt23_Sp_counted_ptr_inplaceIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_17TropicalWeightTplIfEEEENS0_16DefaultCompactorINS0_27UnweightedAcceptorCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairIiiEjEEEENS0_17DefaultCacheStoreIS6_EEEESaISH_ELN9__gnu_cxx12_Lock_policyE2EEC1IJEEESI_DpOT_\n   fun:_ZNSt14__shared_countILN9__gnu_cxx12_Lock_policyE2EEC1IN3fst8internal14CompactFstImplINS4_6ArcTplINS4_17TropicalWeightTplIfEEEENS4_16DefaultCompactorINS4_27UnweightedAcceptorCompactorISA_EEjNS4_19DefaultCompactStoreISt4pairIiiEjEEEENS4_17DefaultCacheStoreISA_EEEESaISL_EJEEERPT_St20_Sp_alloc_shared_tagIT0_EDpOT1_\n   fun:_ZNSt12__shared_ptrIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_17TropicalWeightTplIfEEEENS0_16DefaultCompactorINS0_27UnweightedAcceptorCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairIiiEjEEEENS0_17DefaultCacheStoreIS6_EEEELN9__gnu_cxx12_Lock_policyE2EEC1ISaISH_EJEEESt20_Sp_alloc_shared_tagIT_EDpOT0_\n   fun:_ZNSt10shared_ptrIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_17TropicalWeightTplIfEEEENS0_16DefaultCompactorINS0_27UnweightedAcceptorCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairIiiEjEEEENS0_17DefaultCacheStoreIS6_EEEEEC1ISaISH_EJEEESt20_Sp_alloc_shared_tagIT_EDpOT0_\n   fun:_ZSt15allocate_sharedIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_17TropicalWeightTplIfEEEENS0_16DefaultCompactorINS0_27UnweightedAcceptorCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairIiiEjEEEENS0_17DefaultCacheStoreIS6_EEEESaISH_EJEESt10shared_ptrIT_ERKT0_DpOT1_\n}\n{\n   <openfst>\n   Memcheck:Leak\n   match-leak-kinds: reachable\n   fun:_Znwm\n   fun:_ZNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEE12_M_constructIPcEEvT_S7_St20forward_iterator_tag\n   fun:_ZNSt4pairINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEEN3fst16FstRegisterEntryINS6_6ArcTplINS6_17TropicalWeightTplIfEEEEEEEC1IS5_SC_Lb1EEERKS5_RKSC_\n   fun:_ZSt9make_pairIRKNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEERKN3fst16FstRegisterEntryINS8_6ArcTplINS8_17TropicalWeightTplIfEEEEEEESt4pairINSt17__decay_and_stripIT_E6__typeENSI_IT0_E6__typeEEOSJ_OSM_\n   fun:_ZN3fst15GenericRegisterINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEENS_16FstRegisterEntryINS_6ArcTplINS_17TropicalWeightTplIfEEEEEENS_11FstRegisterISB_EEE8SetEntryERKS6_RKSC_\n   fun:_ZN3fst17GenericRegistererINS_11FstRegisterINS_6ArcTplINS_17TropicalWeightTplIfEEEEEEEC1ENSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEENS_16FstRegisterEntryIS5_EE\n   fun:_ZN3fst13FstRegistererINS_10CompactFstINS_6ArcTplINS_17TropicalWeightTplIfEEEENS_27UnweightedAcceptorCompactorIS5_EEjNS_19DefaultCompactStoreISt4pairIiiEjEENS_17DefaultCacheStoreIS5_EEEEEC1Ev\n   fun:_Z41__static_initialization_and_destruction_0ii\n}\n{\n   <openfst>\n   Memcheck:Leak\n   match-leak-kinds: reachable\n   fun:_Znwm\n   fun:_ZNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEE12_M_constructIPcEEvT_S7_St20forward_iterator_tag\n   fun:_ZZN3fst16DefaultCompactorINS_27UnweightedAcceptorCompactorINS_6ArcTplINS_12LogWeightTplIfEEEEEEjNS_19DefaultCompactStoreISt4pairIiiEjEEE4TypeB5cxx11EvENKUlvE_clEv\n   fun:_ZN3fst16DefaultCompactorINS_27UnweightedAcceptorCompactorINS_6ArcTplINS_12LogWeightTplIfEEEEEEjNS_19DefaultCompactStoreISt4pairIiiEjEEE4TypeB5cxx11Ev\n   fun:_ZN3fst8internal14CompactFstImplINS_6ArcTplINS_12LogWeightTplIfEEEENS_16DefaultCompactorINS_27UnweightedAcceptorCompactorIS5_EEjNS_19DefaultCompactStoreISt4pairIiiEjEEEENS_17DefaultCacheStoreIS5_EEEC1Ev\n   fun:_ZN9__gnu_cxx13new_allocatorIN3fst8internal14CompactFstImplINS1_6ArcTplINS1_12LogWeightTplIfEEEENS1_16DefaultCompactorINS1_27UnweightedAcceptorCompactorIS7_EEjNS1_19DefaultCompactStoreISt4pairIiiEjEEEENS1_17DefaultCacheStoreIS7_EEEEE9constructISI_JEEEvPT_DpOT0_\n   fun:_ZNSt16allocator_traitsISaIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_12LogWeightTplIfEEEENS0_16DefaultCompactorINS0_27UnweightedAcceptorCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairIiiEjEEEENS0_17DefaultCacheStoreIS6_EEEEEE9constructISH_JEEEvRSI_PT_DpOT0_\n   fun:_ZNSt23_Sp_counted_ptr_inplaceIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_12LogWeightTplIfEEEENS0_16DefaultCompactorINS0_27UnweightedAcceptorCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairIiiEjEEEENS0_17DefaultCacheStoreIS6_EEEESaISH_ELN9__gnu_cxx12_Lock_policyE2EEC1IJEEESI_DpOT_\n   fun:_ZNSt14__shared_countILN9__gnu_cxx12_Lock_policyE2EEC1IN3fst8internal14CompactFstImplINS4_6ArcTplINS4_12LogWeightTplIfEEEENS4_16DefaultCompactorINS4_27UnweightedAcceptorCompactorISA_EEjNS4_19DefaultCompactStoreISt4pairIiiEjEEEENS4_17DefaultCacheStoreISA_EEEESaISL_EJEEERPT_St20_Sp_alloc_shared_tagIT0_EDpOT1_\n   fun:_ZNSt12__shared_ptrIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_12LogWeightTplIfEEEENS0_16DefaultCompactorINS0_27UnweightedAcceptorCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairIiiEjEEEENS0_17DefaultCacheStoreIS6_EEEELN9__gnu_cxx12_Lock_policyE2EEC1ISaISH_EJEEESt20_Sp_alloc_shared_tagIT_EDpOT0_\n   fun:_ZNSt10shared_ptrIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_12LogWeightTplIfEEEENS0_16DefaultCompactorINS0_27UnweightedAcceptorCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairIiiEjEEEENS0_17DefaultCacheStoreIS6_EEEEEC1ISaISH_EJEEESt20_Sp_alloc_shared_tagIT_EDpOT0_\n   fun:_ZSt15allocate_sharedIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_12LogWeightTplIfEEEENS0_16DefaultCompactorINS0_27UnweightedAcceptorCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairIiiEjEEEENS0_17DefaultCacheStoreIS6_EEEESaISH_EJEESt10shared_ptrIT_ERKT0_DpOT1_\n}\n{\n   <openfst>\n   Memcheck:Leak\n   match-leak-kinds: reachable\n   fun:_Znwm\n   fun:_ZNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEE12_M_constructIPcEEvT_S7_St20forward_iterator_tag\n   fun:_ZNSt4pairINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEEN3fst16FstRegisterEntryINS6_6ArcTplINS6_12LogWeightTplIfEEEEEEEC1IS5_SC_Lb1EEERKS5_RKSC_\n   fun:_ZSt9make_pairIRKNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEERKN3fst16FstRegisterEntryINS8_6ArcTplINS8_12LogWeightTplIfEEEEEEESt4pairINSt17__decay_and_stripIT_E6__typeENSI_IT0_E6__typeEEOSJ_OSM_\n   fun:_ZN3fst15GenericRegisterINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEENS_16FstRegisterEntryINS_6ArcTplINS_12LogWeightTplIfEEEEEENS_11FstRegisterISB_EEE8SetEntryERKS6_RKSC_\n   fun:_ZN3fst17GenericRegistererINS_11FstRegisterINS_6ArcTplINS_12LogWeightTplIfEEEEEEEC1ENSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEENS_16FstRegisterEntryIS5_EE\n   fun:_ZN3fst13FstRegistererINS_10CompactFstINS_6ArcTplINS_12LogWeightTplIfEEEENS_27UnweightedAcceptorCompactorIS5_EEjNS_19DefaultCompactStoreISt4pairIiiEjEENS_17DefaultCacheStoreIS5_EEEEEC1Ev\n   fun:_Z41__static_initialization_and_destruction_0ii\n}\n{\n   <openfst>\n   Memcheck:Leak\n   match-leak-kinds: reachable\n   fun:_Znwm\n   fun:_ZN3fst15StringCompactorINS_6ArcTplINS_17TropicalWeightTplIfEEEEE4TypeB5cxx11Ev\n   fun:_ZZN3fst16DefaultCompactorINS_15StringCompactorINS_6ArcTplINS_17TropicalWeightTplIfEEEEEEjNS_19DefaultCompactStoreIijEEE4TypeB5cxx11EvENKUlvE_clEv\n   fun:_ZN3fst16DefaultCompactorINS_15StringCompactorINS_6ArcTplINS_17TropicalWeightTplIfEEEEEEjNS_19DefaultCompactStoreIijEEE4TypeB5cxx11Ev\n   fun:_ZN3fst8internal14CompactFstImplINS_6ArcTplINS_17TropicalWeightTplIfEEEENS_16DefaultCompactorINS_15StringCompactorIS5_EEjNS_19DefaultCompactStoreIijEEEENS_17DefaultCacheStoreIS5_EEEC1Ev\n   fun:_ZN9__gnu_cxx13new_allocatorIN3fst8internal14CompactFstImplINS1_6ArcTplINS1_17TropicalWeightTplIfEEEENS1_16DefaultCompactorINS1_15StringCompactorIS7_EEjNS1_19DefaultCompactStoreIijEEEENS1_17DefaultCacheStoreIS7_EEEEE9constructISG_JEEEvPT_DpOT0_\n   fun:_ZNSt16allocator_traitsISaIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_17TropicalWeightTplIfEEEENS0_16DefaultCompactorINS0_15StringCompactorIS6_EEjNS0_19DefaultCompactStoreIijEEEENS0_17DefaultCacheStoreIS6_EEEEEE9constructISF_JEEEvRSG_PT_DpOT0_\n   fun:_ZNSt23_Sp_counted_ptr_inplaceIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_17TropicalWeightTplIfEEEENS0_16DefaultCompactorINS0_15StringCompactorIS6_EEjNS0_19DefaultCompactStoreIijEEEENS0_17DefaultCacheStoreIS6_EEEESaISF_ELN9__gnu_cxx12_Lock_policyE2EEC1IJEEESG_DpOT_\n   fun:_ZNSt14__shared_countILN9__gnu_cxx12_Lock_policyE2EEC1IN3fst8internal14CompactFstImplINS4_6ArcTplINS4_17TropicalWeightTplIfEEEENS4_16DefaultCompactorINS4_15StringCompactorISA_EEjNS4_19DefaultCompactStoreIijEEEENS4_17DefaultCacheStoreISA_EEEESaISJ_EJEEERPT_St20_Sp_alloc_shared_tagIT0_EDpOT1_\n   fun:_ZNSt12__shared_ptrIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_17TropicalWeightTplIfEEEENS0_16DefaultCompactorINS0_15StringCompactorIS6_EEjNS0_19DefaultCompactStoreIijEEEENS0_17DefaultCacheStoreIS6_EEEELN9__gnu_cxx12_Lock_policyE2EEC1ISaISF_EJEEESt20_Sp_alloc_shared_tagIT_EDpOT0_\n   fun:_ZNSt10shared_ptrIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_17TropicalWeightTplIfEEEENS0_16DefaultCompactorINS0_15StringCompactorIS6_EEjNS0_19DefaultCompactStoreIijEEEENS0_17DefaultCacheStoreIS6_EEEEEC1ISaISF_EJEEESt20_Sp_alloc_shared_tagIT_EDpOT0_\n   fun:_ZSt15allocate_sharedIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_17TropicalWeightTplIfEEEENS0_16DefaultCompactorINS0_15StringCompactorIS6_EEjNS0_19DefaultCompactStoreIijEEEENS0_17DefaultCacheStoreIS6_EEEESaISF_EJEESt10shared_ptrIT_ERKT0_DpOT1_\n}\n{\n   <openfst>\n   Memcheck:Leak\n   match-leak-kinds: reachable\n   fun:_Znwm\n   fun:_ZN3fst19DefaultCompactStoreIijE4TypeB5cxx11Ev\n   fun:_ZZN3fst16DefaultCompactorINS_15StringCompactorINS_6ArcTplINS_17TropicalWeightTplIfEEEEEEjNS_19DefaultCompactStoreIijEEE4TypeB5cxx11EvENKUlvE_clEv\n   fun:_ZN3fst16DefaultCompactorINS_15StringCompactorINS_6ArcTplINS_17TropicalWeightTplIfEEEEEEjNS_19DefaultCompactStoreIijEEE4TypeB5cxx11Ev\n   fun:_ZN3fst8internal14CompactFstImplINS_6ArcTplINS_17TropicalWeightTplIfEEEENS_16DefaultCompactorINS_15StringCompactorIS5_EEjNS_19DefaultCompactStoreIijEEEENS_17DefaultCacheStoreIS5_EEEC1Ev\n   fun:_ZN9__gnu_cxx13new_allocatorIN3fst8internal14CompactFstImplINS1_6ArcTplINS1_17TropicalWeightTplIfEEEENS1_16DefaultCompactorINS1_15StringCompactorIS7_EEjNS1_19DefaultCompactStoreIijEEEENS1_17DefaultCacheStoreIS7_EEEEE9constructISG_JEEEvPT_DpOT0_\n   fun:_ZNSt16allocator_traitsISaIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_17TropicalWeightTplIfEEEENS0_16DefaultCompactorINS0_15StringCompactorIS6_EEjNS0_19DefaultCompactStoreIijEEEENS0_17DefaultCacheStoreIS6_EEEEEE9constructISF_JEEEvRSG_PT_DpOT0_\n   fun:_ZNSt23_Sp_counted_ptr_inplaceIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_17TropicalWeightTplIfEEEENS0_16DefaultCompactorINS0_15StringCompactorIS6_EEjNS0_19DefaultCompactStoreIijEEEENS0_17DefaultCacheStoreIS6_EEEESaISF_ELN9__gnu_cxx12_Lock_policyE2EEC1IJEEESG_DpOT_\n   fun:_ZNSt14__shared_countILN9__gnu_cxx12_Lock_policyE2EEC1IN3fst8internal14CompactFstImplINS4_6ArcTplINS4_17TropicalWeightTplIfEEEENS4_16DefaultCompactorINS4_15StringCompactorISA_EEjNS4_19DefaultCompactStoreIijEEEENS4_17DefaultCacheStoreISA_EEEESaISJ_EJEEERPT_St20_Sp_alloc_shared_tagIT0_EDpOT1_\n   fun:_ZNSt12__shared_ptrIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_17TropicalWeightTplIfEEEENS0_16DefaultCompactorINS0_15StringCompactorIS6_EEjNS0_19DefaultCompactStoreIijEEEENS0_17DefaultCacheStoreIS6_EEEELN9__gnu_cxx12_Lock_policyE2EEC1ISaISF_EJEEESt20_Sp_alloc_shared_tagIT_EDpOT0_\n   fun:_ZNSt10shared_ptrIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_17TropicalWeightTplIfEEEENS0_16DefaultCompactorINS0_15StringCompactorIS6_EEjNS0_19DefaultCompactStoreIijEEEENS0_17DefaultCacheStoreIS6_EEEEEC1ISaISF_EJEEESt20_Sp_alloc_shared_tagIT_EDpOT0_\n   fun:_ZSt15allocate_sharedIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_17TropicalWeightTplIfEEEENS0_16DefaultCompactorINS0_15StringCompactorIS6_EEjNS0_19DefaultCompactStoreIijEEEENS0_17DefaultCacheStoreIS6_EEEESaISF_EJEESt10shared_ptrIT_ERKT0_DpOT1_\n}\n{\n   <openfst>\n   Memcheck:Leak\n   match-leak-kinds: reachable\n   fun:_Znwm\n   fun:_ZZN3fst16DefaultCompactorINS_15StringCompactorINS_6ArcTplINS_17TropicalWeightTplIfEEEEEEjNS_19DefaultCompactStoreIijEEE4TypeB5cxx11EvENKUlvE_clEv\n   fun:_ZN3fst16DefaultCompactorINS_15StringCompactorINS_6ArcTplINS_17TropicalWeightTplIfEEEEEEjNS_19DefaultCompactStoreIijEEE4TypeB5cxx11Ev\n   fun:_ZN3fst8internal14CompactFstImplINS_6ArcTplINS_17TropicalWeightTplIfEEEENS_16DefaultCompactorINS_15StringCompactorIS5_EEjNS_19DefaultCompactStoreIijEEEENS_17DefaultCacheStoreIS5_EEEC1Ev\n   fun:_ZN9__gnu_cxx13new_allocatorIN3fst8internal14CompactFstImplINS1_6ArcTplINS1_17TropicalWeightTplIfEEEENS1_16DefaultCompactorINS1_15StringCompactorIS7_EEjNS1_19DefaultCompactStoreIijEEEENS1_17DefaultCacheStoreIS7_EEEEE9constructISG_JEEEvPT_DpOT0_\n   fun:_ZNSt16allocator_traitsISaIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_17TropicalWeightTplIfEEEENS0_16DefaultCompactorINS0_15StringCompactorIS6_EEjNS0_19DefaultCompactStoreIijEEEENS0_17DefaultCacheStoreIS6_EEEEEE9constructISF_JEEEvRSG_PT_DpOT0_\n   fun:_ZNSt23_Sp_counted_ptr_inplaceIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_17TropicalWeightTplIfEEEENS0_16DefaultCompactorINS0_15StringCompactorIS6_EEjNS0_19DefaultCompactStoreIijEEEENS0_17DefaultCacheStoreIS6_EEEESaISF_ELN9__gnu_cxx12_Lock_policyE2EEC1IJEEESG_DpOT_\n   fun:_ZNSt14__shared_countILN9__gnu_cxx12_Lock_policyE2EEC1IN3fst8internal14CompactFstImplINS4_6ArcTplINS4_17TropicalWeightTplIfEEEENS4_16DefaultCompactorINS4_15StringCompactorISA_EEjNS4_19DefaultCompactStoreIijEEEENS4_17DefaultCacheStoreISA_EEEESaISJ_EJEEERPT_St20_Sp_alloc_shared_tagIT0_EDpOT1_\n   fun:_ZNSt12__shared_ptrIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_17TropicalWeightTplIfEEEENS0_16DefaultCompactorINS0_15StringCompactorIS6_EEjNS0_19DefaultCompactStoreIijEEEENS0_17DefaultCacheStoreIS6_EEEELN9__gnu_cxx12_Lock_policyE2EEC1ISaISF_EJEEESt20_Sp_alloc_shared_tagIT_EDpOT0_\n   fun:_ZNSt10shared_ptrIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_17TropicalWeightTplIfEEEENS0_16DefaultCompactorINS0_15StringCompactorIS6_EEjNS0_19DefaultCompactStoreIijEEEENS0_17DefaultCacheStoreIS6_EEEEEC1ISaISF_EJEEESt20_Sp_alloc_shared_tagIT_EDpOT0_\n   fun:_ZSt15allocate_sharedIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_17TropicalWeightTplIfEEEENS0_16DefaultCompactorINS0_15StringCompactorIS6_EEjNS0_19DefaultCompactStoreIijEEEENS0_17DefaultCacheStoreIS6_EEEESaISF_EJEESt10shared_ptrIT_ERKT0_DpOT1_\n   fun:_ZSt11make_sharedIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_17TropicalWeightTplIfEEEENS0_16DefaultCompactorINS0_15StringCompactorIS6_EEjNS0_19DefaultCompactStoreIijEEEENS0_17DefaultCacheStoreIS6_EEEEJEESt10shared_ptrIT_EDpOT0_\n}\n{\n   <openfst>\n   Memcheck:Leak\n   match-leak-kinds: reachable\n   fun:_Znwm\n   fun:_ZN3fst15StringCompactorINS_6ArcTplINS_12LogWeightTplIfEEEEE4TypeB5cxx11Ev\n   fun:_ZZN3fst16DefaultCompactorINS_15StringCompactorINS_6ArcTplINS_12LogWeightTplIfEEEEEEjNS_19DefaultCompactStoreIijEEE4TypeB5cxx11EvENKUlvE_clEv\n   fun:_ZN3fst16DefaultCompactorINS_15StringCompactorINS_6ArcTplINS_12LogWeightTplIfEEEEEEjNS_19DefaultCompactStoreIijEEE4TypeB5cxx11Ev\n   fun:_ZN3fst8internal14CompactFstImplINS_6ArcTplINS_12LogWeightTplIfEEEENS_16DefaultCompactorINS_15StringCompactorIS5_EEjNS_19DefaultCompactStoreIijEEEENS_17DefaultCacheStoreIS5_EEEC1Ev\n   fun:_ZN9__gnu_cxx13new_allocatorIN3fst8internal14CompactFstImplINS1_6ArcTplINS1_12LogWeightTplIfEEEENS1_16DefaultCompactorINS1_15StringCompactorIS7_EEjNS1_19DefaultCompactStoreIijEEEENS1_17DefaultCacheStoreIS7_EEEEE9constructISG_JEEEvPT_DpOT0_\n   fun:_ZNSt16allocator_traitsISaIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_12LogWeightTplIfEEEENS0_16DefaultCompactorINS0_15StringCompactorIS6_EEjNS0_19DefaultCompactStoreIijEEEENS0_17DefaultCacheStoreIS6_EEEEEE9constructISF_JEEEvRSG_PT_DpOT0_\n   fun:_ZNSt23_Sp_counted_ptr_inplaceIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_12LogWeightTplIfEEEENS0_16DefaultCompactorINS0_15StringCompactorIS6_EEjNS0_19DefaultCompactStoreIijEEEENS0_17DefaultCacheStoreIS6_EEEESaISF_ELN9__gnu_cxx12_Lock_policyE2EEC1IJEEESG_DpOT_\n   fun:_ZNSt14__shared_countILN9__gnu_cxx12_Lock_policyE2EEC1IN3fst8internal14CompactFstImplINS4_6ArcTplINS4_12LogWeightTplIfEEEENS4_16DefaultCompactorINS4_15StringCompactorISA_EEjNS4_19DefaultCompactStoreIijEEEENS4_17DefaultCacheStoreISA_EEEESaISJ_EJEEERPT_St20_Sp_alloc_shared_tagIT0_EDpOT1_\n   fun:_ZNSt12__shared_ptrIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_12LogWeightTplIfEEEENS0_16DefaultCompactorINS0_15StringCompactorIS6_EEjNS0_19DefaultCompactStoreIijEEEENS0_17DefaultCacheStoreIS6_EEEELN9__gnu_cxx12_Lock_policyE2EEC1ISaISF_EJEEESt20_Sp_alloc_shared_tagIT_EDpOT0_\n   fun:_ZNSt10shared_ptrIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_12LogWeightTplIfEEEENS0_16DefaultCompactorINS0_15StringCompactorIS6_EEjNS0_19DefaultCompactStoreIijEEEENS0_17DefaultCacheStoreIS6_EEEEEC1ISaISF_EJEEESt20_Sp_alloc_shared_tagIT_EDpOT0_\n   fun:_ZSt15allocate_sharedIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_12LogWeightTplIfEEEENS0_16DefaultCompactorINS0_15StringCompactorIS6_EEjNS0_19DefaultCompactStoreIijEEEENS0_17DefaultCacheStoreIS6_EEEESaISF_EJEESt10shared_ptrIT_ERKT0_DpOT1_\n}\n{\n   <openfst>\n   Memcheck:Leak\n   match-leak-kinds: reachable\n   fun:_Znwm\n   fun:_ZZN3fst16DefaultCompactorINS_15StringCompactorINS_6ArcTplINS_12LogWeightTplIfEEEEEEjNS_19DefaultCompactStoreIijEEE4TypeB5cxx11EvENKUlvE_clEv\n   fun:_ZN3fst16DefaultCompactorINS_15StringCompactorINS_6ArcTplINS_12LogWeightTplIfEEEEEEjNS_19DefaultCompactStoreIijEEE4TypeB5cxx11Ev\n   fun:_ZN3fst8internal14CompactFstImplINS_6ArcTplINS_12LogWeightTplIfEEEENS_16DefaultCompactorINS_15StringCompactorIS5_EEjNS_19DefaultCompactStoreIijEEEENS_17DefaultCacheStoreIS5_EEEC1Ev\n   fun:_ZN9__gnu_cxx13new_allocatorIN3fst8internal14CompactFstImplINS1_6ArcTplINS1_12LogWeightTplIfEEEENS1_16DefaultCompactorINS1_15StringCompactorIS7_EEjNS1_19DefaultCompactStoreIijEEEENS1_17DefaultCacheStoreIS7_EEEEE9constructISG_JEEEvPT_DpOT0_\n   fun:_ZNSt16allocator_traitsISaIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_12LogWeightTplIfEEEENS0_16DefaultCompactorINS0_15StringCompactorIS6_EEjNS0_19DefaultCompactStoreIijEEEENS0_17DefaultCacheStoreIS6_EEEEEE9constructISF_JEEEvRSG_PT_DpOT0_\n   fun:_ZNSt23_Sp_counted_ptr_inplaceIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_12LogWeightTplIfEEEENS0_16DefaultCompactorINS0_15StringCompactorIS6_EEjNS0_19DefaultCompactStoreIijEEEENS0_17DefaultCacheStoreIS6_EEEESaISF_ELN9__gnu_cxx12_Lock_policyE2EEC1IJEEESG_DpOT_\n   fun:_ZNSt14__shared_countILN9__gnu_cxx12_Lock_policyE2EEC1IN3fst8internal14CompactFstImplINS4_6ArcTplINS4_12LogWeightTplIfEEEENS4_16DefaultCompactorINS4_15StringCompactorISA_EEjNS4_19DefaultCompactStoreIijEEEENS4_17DefaultCacheStoreISA_EEEESaISJ_EJEEERPT_St20_Sp_alloc_shared_tagIT0_EDpOT1_\n   fun:_ZNSt12__shared_ptrIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_12LogWeightTplIfEEEENS0_16DefaultCompactorINS0_15StringCompactorIS6_EEjNS0_19DefaultCompactStoreIijEEEENS0_17DefaultCacheStoreIS6_EEEELN9__gnu_cxx12_Lock_policyE2EEC1ISaISF_EJEEESt20_Sp_alloc_shared_tagIT_EDpOT0_\n   fun:_ZNSt10shared_ptrIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_12LogWeightTplIfEEEENS0_16DefaultCompactorINS0_15StringCompactorIS6_EEjNS0_19DefaultCompactStoreIijEEEENS0_17DefaultCacheStoreIS6_EEEEEC1ISaISF_EJEEESt20_Sp_alloc_shared_tagIT_EDpOT0_\n   fun:_ZSt15allocate_sharedIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_12LogWeightTplIfEEEENS0_16DefaultCompactorINS0_15StringCompactorIS6_EEjNS0_19DefaultCompactStoreIijEEEENS0_17DefaultCacheStoreIS6_EEEESaISF_EJEESt10shared_ptrIT_ERKT0_DpOT1_\n   fun:_ZSt11make_sharedIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_12LogWeightTplIfEEEENS0_16DefaultCompactorINS0_15StringCompactorIS6_EEjNS0_19DefaultCompactStoreIijEEEENS0_17DefaultCacheStoreIS6_EEEEJEESt10shared_ptrIT_EDpOT0_\n}\n{\n   <openfst>\n   Memcheck:Leak\n   match-leak-kinds: reachable\n   fun:_Znwm\n   fun:_ZN3fst23WeightedStringCompactorINS_6ArcTplINS_17TropicalWeightTplIfEEEEE4TypeB5cxx11Ev\n   fun:_ZZN3fst16DefaultCompactorINS_23WeightedStringCompactorINS_6ArcTplINS_17TropicalWeightTplIfEEEEEEjNS_19DefaultCompactStoreISt4pairIiS4_EjEEE4TypeB5cxx11EvENKUlvE_clEv\n   fun:_ZN3fst16DefaultCompactorINS_23WeightedStringCompactorINS_6ArcTplINS_17TropicalWeightTplIfEEEEEEjNS_19DefaultCompactStoreISt4pairIiS4_EjEEE4TypeB5cxx11Ev\n   fun:_ZN3fst8internal14CompactFstImplINS_6ArcTplINS_17TropicalWeightTplIfEEEENS_16DefaultCompactorINS_23WeightedStringCompactorIS5_EEjNS_19DefaultCompactStoreISt4pairIiS4_EjEEEENS_17DefaultCacheStoreIS5_EEEC1Ev\n   fun:_ZN9__gnu_cxx13new_allocatorIN3fst8internal14CompactFstImplINS1_6ArcTplINS1_17TropicalWeightTplIfEEEENS1_16DefaultCompactorINS1_23WeightedStringCompactorIS7_EEjNS1_19DefaultCompactStoreISt4pairIiS6_EjEEEENS1_17DefaultCacheStoreIS7_EEEEE9constructISI_JEEEvPT_DpOT0_\n   fun:_ZNSt16allocator_traitsISaIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_17TropicalWeightTplIfEEEENS0_16DefaultCompactorINS0_23WeightedStringCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairIiS5_EjEEEENS0_17DefaultCacheStoreIS6_EEEEEE9constructISH_JEEEvRSI_PT_DpOT0_\n   fun:_ZNSt23_Sp_counted_ptr_inplaceIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_17TropicalWeightTplIfEEEENS0_16DefaultCompactorINS0_23WeightedStringCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairIiS5_EjEEEENS0_17DefaultCacheStoreIS6_EEEESaISH_ELN9__gnu_cxx12_Lock_policyE2EEC1IJEEESI_DpOT_\n   fun:_ZNSt14__shared_countILN9__gnu_cxx12_Lock_policyE2EEC1IN3fst8internal14CompactFstImplINS4_6ArcTplINS4_17TropicalWeightTplIfEEEENS4_16DefaultCompactorINS4_23WeightedStringCompactorISA_EEjNS4_19DefaultCompactStoreISt4pairIiS9_EjEEEENS4_17DefaultCacheStoreISA_EEEESaISL_EJEEERPT_St20_Sp_alloc_shared_tagIT0_EDpOT1_\n   fun:_ZNSt12__shared_ptrIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_17TropicalWeightTplIfEEEENS0_16DefaultCompactorINS0_23WeightedStringCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairIiS5_EjEEEENS0_17DefaultCacheStoreIS6_EEEELN9__gnu_cxx12_Lock_policyE2EEC1ISaISH_EJEEESt20_Sp_alloc_shared_tagIT_EDpOT0_\n   fun:_ZNSt10shared_ptrIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_17TropicalWeightTplIfEEEENS0_16DefaultCompactorINS0_23WeightedStringCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairIiS5_EjEEEENS0_17DefaultCacheStoreIS6_EEEEEC1ISaISH_EJEEESt20_Sp_alloc_shared_tagIT_EDpOT0_\n   fun:_ZSt15allocate_sharedIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_17TropicalWeightTplIfEEEENS0_16DefaultCompactorINS0_23WeightedStringCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairIiS5_EjEEEENS0_17DefaultCacheStoreIS6_EEEESaISH_EJEESt10shared_ptrIT_ERKT0_DpOT1_\n}\n{\n   <openfst>\n   Memcheck:Leak\n   match-leak-kinds: reachable\n   fun:_Znwm\n   fun:_ZN3fst19DefaultCompactStoreISt4pairIiNS_17TropicalWeightTplIfEEEjE4TypeB5cxx11Ev\n   fun:_ZZN3fst16DefaultCompactorINS_23WeightedStringCompactorINS_6ArcTplINS_17TropicalWeightTplIfEEEEEEjNS_19DefaultCompactStoreISt4pairIiS4_EjEEE4TypeB5cxx11EvENKUlvE_clEv\n   fun:_ZN3fst16DefaultCompactorINS_23WeightedStringCompactorINS_6ArcTplINS_17TropicalWeightTplIfEEEEEEjNS_19DefaultCompactStoreISt4pairIiS4_EjEEE4TypeB5cxx11Ev\n   fun:_ZN3fst8internal14CompactFstImplINS_6ArcTplINS_17TropicalWeightTplIfEEEENS_16DefaultCompactorINS_23WeightedStringCompactorIS5_EEjNS_19DefaultCompactStoreISt4pairIiS4_EjEEEENS_17DefaultCacheStoreIS5_EEEC1Ev\n   fun:_ZN9__gnu_cxx13new_allocatorIN3fst8internal14CompactFstImplINS1_6ArcTplINS1_17TropicalWeightTplIfEEEENS1_16DefaultCompactorINS1_23WeightedStringCompactorIS7_EEjNS1_19DefaultCompactStoreISt4pairIiS6_EjEEEENS1_17DefaultCacheStoreIS7_EEEEE9constructISI_JEEEvPT_DpOT0_\n   fun:_ZNSt16allocator_traitsISaIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_17TropicalWeightTplIfEEEENS0_16DefaultCompactorINS0_23WeightedStringCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairIiS5_EjEEEENS0_17DefaultCacheStoreIS6_EEEEEE9constructISH_JEEEvRSI_PT_DpOT0_\n   fun:_ZNSt23_Sp_counted_ptr_inplaceIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_17TropicalWeightTplIfEEEENS0_16DefaultCompactorINS0_23WeightedStringCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairIiS5_EjEEEENS0_17DefaultCacheStoreIS6_EEEESaISH_ELN9__gnu_cxx12_Lock_policyE2EEC1IJEEESI_DpOT_\n   fun:_ZNSt14__shared_countILN9__gnu_cxx12_Lock_policyE2EEC1IN3fst8internal14CompactFstImplINS4_6ArcTplINS4_17TropicalWeightTplIfEEEENS4_16DefaultCompactorINS4_23WeightedStringCompactorISA_EEjNS4_19DefaultCompactStoreISt4pairIiS9_EjEEEENS4_17DefaultCacheStoreISA_EEEESaISL_EJEEERPT_St20_Sp_alloc_shared_tagIT0_EDpOT1_\n   fun:_ZNSt12__shared_ptrIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_17TropicalWeightTplIfEEEENS0_16DefaultCompactorINS0_23WeightedStringCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairIiS5_EjEEEENS0_17DefaultCacheStoreIS6_EEEELN9__gnu_cxx12_Lock_policyE2EEC1ISaISH_EJEEESt20_Sp_alloc_shared_tagIT_EDpOT0_\n   fun:_ZNSt10shared_ptrIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_17TropicalWeightTplIfEEEENS0_16DefaultCompactorINS0_23WeightedStringCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairIiS5_EjEEEENS0_17DefaultCacheStoreIS6_EEEEEC1ISaISH_EJEEESt20_Sp_alloc_shared_tagIT_EDpOT0_\n   fun:_ZSt15allocate_sharedIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_17TropicalWeightTplIfEEEENS0_16DefaultCompactorINS0_23WeightedStringCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairIiS5_EjEEEENS0_17DefaultCacheStoreIS6_EEEESaISH_EJEESt10shared_ptrIT_ERKT0_DpOT1_\n}\n{\n   <openfst>\n   Memcheck:Leak\n   match-leak-kinds: reachable\n   fun:_Znwm\n   fun:_ZZN3fst16DefaultCompactorINS_23WeightedStringCompactorINS_6ArcTplINS_17TropicalWeightTplIfEEEEEEjNS_19DefaultCompactStoreISt4pairIiS4_EjEEE4TypeB5cxx11EvENKUlvE_clEv\n   fun:_ZN3fst16DefaultCompactorINS_23WeightedStringCompactorINS_6ArcTplINS_17TropicalWeightTplIfEEEEEEjNS_19DefaultCompactStoreISt4pairIiS4_EjEEE4TypeB5cxx11Ev\n   fun:_ZN3fst8internal14CompactFstImplINS_6ArcTplINS_17TropicalWeightTplIfEEEENS_16DefaultCompactorINS_23WeightedStringCompactorIS5_EEjNS_19DefaultCompactStoreISt4pairIiS4_EjEEEENS_17DefaultCacheStoreIS5_EEEC1Ev\n   fun:_ZN9__gnu_cxx13new_allocatorIN3fst8internal14CompactFstImplINS1_6ArcTplINS1_17TropicalWeightTplIfEEEENS1_16DefaultCompactorINS1_23WeightedStringCompactorIS7_EEjNS1_19DefaultCompactStoreISt4pairIiS6_EjEEEENS1_17DefaultCacheStoreIS7_EEEEE9constructISI_JEEEvPT_DpOT0_\n   fun:_ZNSt16allocator_traitsISaIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_17TropicalWeightTplIfEEEENS0_16DefaultCompactorINS0_23WeightedStringCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairIiS5_EjEEEENS0_17DefaultCacheStoreIS6_EEEEEE9constructISH_JEEEvRSI_PT_DpOT0_\n   fun:_ZNSt23_Sp_counted_ptr_inplaceIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_17TropicalWeightTplIfEEEENS0_16DefaultCompactorINS0_23WeightedStringCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairIiS5_EjEEEENS0_17DefaultCacheStoreIS6_EEEESaISH_ELN9__gnu_cxx12_Lock_policyE2EEC1IJEEESI_DpOT_\n   fun:_ZNSt14__shared_countILN9__gnu_cxx12_Lock_policyE2EEC1IN3fst8internal14CompactFstImplINS4_6ArcTplINS4_17TropicalWeightTplIfEEEENS4_16DefaultCompactorINS4_23WeightedStringCompactorISA_EEjNS4_19DefaultCompactStoreISt4pairIiS9_EjEEEENS4_17DefaultCacheStoreISA_EEEESaISL_EJEEERPT_St20_Sp_alloc_shared_tagIT0_EDpOT1_\n   fun:_ZNSt12__shared_ptrIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_17TropicalWeightTplIfEEEENS0_16DefaultCompactorINS0_23WeightedStringCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairIiS5_EjEEEENS0_17DefaultCacheStoreIS6_EEEELN9__gnu_cxx12_Lock_policyE2EEC1ISaISH_EJEEESt20_Sp_alloc_shared_tagIT_EDpOT0_\n   fun:_ZNSt10shared_ptrIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_17TropicalWeightTplIfEEEENS0_16DefaultCompactorINS0_23WeightedStringCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairIiS5_EjEEEENS0_17DefaultCacheStoreIS6_EEEEEC1ISaISH_EJEEESt20_Sp_alloc_shared_tagIT_EDpOT0_\n   fun:_ZSt15allocate_sharedIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_17TropicalWeightTplIfEEEENS0_16DefaultCompactorINS0_23WeightedStringCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairIiS5_EjEEEENS0_17DefaultCacheStoreIS6_EEEESaISH_EJEESt10shared_ptrIT_ERKT0_DpOT1_\n   fun:_ZSt11make_sharedIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_17TropicalWeightTplIfEEEENS0_16DefaultCompactorINS0_23WeightedStringCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairIiS5_EjEEEENS0_17DefaultCacheStoreIS6_EEEEJEESt10shared_ptrIT_EDpOT0_\n}\n{\n   <openfst>\n   Memcheck:Leak\n   match-leak-kinds: reachable\n   fun:_Znwm\n   fun:_ZN3fst23WeightedStringCompactorINS_6ArcTplINS_12LogWeightTplIfEEEEE4TypeB5cxx11Ev\n   fun:_ZZN3fst16DefaultCompactorINS_23WeightedStringCompactorINS_6ArcTplINS_12LogWeightTplIfEEEEEEjNS_19DefaultCompactStoreISt4pairIiS4_EjEEE4TypeB5cxx11EvENKUlvE_clEv\n   fun:_ZN3fst16DefaultCompactorINS_23WeightedStringCompactorINS_6ArcTplINS_12LogWeightTplIfEEEEEEjNS_19DefaultCompactStoreISt4pairIiS4_EjEEE4TypeB5cxx11Ev\n   fun:_ZN3fst8internal14CompactFstImplINS_6ArcTplINS_12LogWeightTplIfEEEENS_16DefaultCompactorINS_23WeightedStringCompactorIS5_EEjNS_19DefaultCompactStoreISt4pairIiS4_EjEEEENS_17DefaultCacheStoreIS5_EEEC1Ev\n   fun:_ZN9__gnu_cxx13new_allocatorIN3fst8internal14CompactFstImplINS1_6ArcTplINS1_12LogWeightTplIfEEEENS1_16DefaultCompactorINS1_23WeightedStringCompactorIS7_EEjNS1_19DefaultCompactStoreISt4pairIiS6_EjEEEENS1_17DefaultCacheStoreIS7_EEEEE9constructISI_JEEEvPT_DpOT0_\n   fun:_ZNSt16allocator_traitsISaIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_12LogWeightTplIfEEEENS0_16DefaultCompactorINS0_23WeightedStringCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairIiS5_EjEEEENS0_17DefaultCacheStoreIS6_EEEEEE9constructISH_JEEEvRSI_PT_DpOT0_\n   fun:_ZNSt23_Sp_counted_ptr_inplaceIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_12LogWeightTplIfEEEENS0_16DefaultCompactorINS0_23WeightedStringCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairIiS5_EjEEEENS0_17DefaultCacheStoreIS6_EEEESaISH_ELN9__gnu_cxx12_Lock_policyE2EEC1IJEEESI_DpOT_\n   fun:_ZNSt14__shared_countILN9__gnu_cxx12_Lock_policyE2EEC1IN3fst8internal14CompactFstImplINS4_6ArcTplINS4_12LogWeightTplIfEEEENS4_16DefaultCompactorINS4_23WeightedStringCompactorISA_EEjNS4_19DefaultCompactStoreISt4pairIiS9_EjEEEENS4_17DefaultCacheStoreISA_EEEESaISL_EJEEERPT_St20_Sp_alloc_shared_tagIT0_EDpOT1_\n   fun:_ZNSt12__shared_ptrIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_12LogWeightTplIfEEEENS0_16DefaultCompactorINS0_23WeightedStringCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairIiS5_EjEEEENS0_17DefaultCacheStoreIS6_EEEELN9__gnu_cxx12_Lock_policyE2EEC1ISaISH_EJEEESt20_Sp_alloc_shared_tagIT_EDpOT0_\n   fun:_ZNSt10shared_ptrIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_12LogWeightTplIfEEEENS0_16DefaultCompactorINS0_23WeightedStringCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairIiS5_EjEEEENS0_17DefaultCacheStoreIS6_EEEEEC1ISaISH_EJEEESt20_Sp_alloc_shared_tagIT_EDpOT0_\n   fun:_ZSt15allocate_sharedIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_12LogWeightTplIfEEEENS0_16DefaultCompactorINS0_23WeightedStringCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairIiS5_EjEEEENS0_17DefaultCacheStoreIS6_EEEESaISH_EJEESt10shared_ptrIT_ERKT0_DpOT1_\n}\n{\n   <openfst>\n   Memcheck:Leak\n   match-leak-kinds: reachable\n   fun:_Znwm\n   fun:_ZN3fst19DefaultCompactStoreISt4pairIiNS_12LogWeightTplIfEEEjE4TypeB5cxx11Ev\n   fun:_ZZN3fst16DefaultCompactorINS_23WeightedStringCompactorINS_6ArcTplINS_12LogWeightTplIfEEEEEEjNS_19DefaultCompactStoreISt4pairIiS4_EjEEE4TypeB5cxx11EvENKUlvE_clEv\n   fun:_ZN3fst16DefaultCompactorINS_23WeightedStringCompactorINS_6ArcTplINS_12LogWeightTplIfEEEEEEjNS_19DefaultCompactStoreISt4pairIiS4_EjEEE4TypeB5cxx11Ev\n   fun:_ZN3fst8internal14CompactFstImplINS_6ArcTplINS_12LogWeightTplIfEEEENS_16DefaultCompactorINS_23WeightedStringCompactorIS5_EEjNS_19DefaultCompactStoreISt4pairIiS4_EjEEEENS_17DefaultCacheStoreIS5_EEEC1Ev\n   fun:_ZN9__gnu_cxx13new_allocatorIN3fst8internal14CompactFstImplINS1_6ArcTplINS1_12LogWeightTplIfEEEENS1_16DefaultCompactorINS1_23WeightedStringCompactorIS7_EEjNS1_19DefaultCompactStoreISt4pairIiS6_EjEEEENS1_17DefaultCacheStoreIS7_EEEEE9constructISI_JEEEvPT_DpOT0_\n   fun:_ZNSt16allocator_traitsISaIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_12LogWeightTplIfEEEENS0_16DefaultCompactorINS0_23WeightedStringCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairIiS5_EjEEEENS0_17DefaultCacheStoreIS6_EEEEEE9constructISH_JEEEvRSI_PT_DpOT0_\n   fun:_ZNSt23_Sp_counted_ptr_inplaceIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_12LogWeightTplIfEEEENS0_16DefaultCompactorINS0_23WeightedStringCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairIiS5_EjEEEENS0_17DefaultCacheStoreIS6_EEEESaISH_ELN9__gnu_cxx12_Lock_policyE2EEC1IJEEESI_DpOT_\n   fun:_ZNSt14__shared_countILN9__gnu_cxx12_Lock_policyE2EEC1IN3fst8internal14CompactFstImplINS4_6ArcTplINS4_12LogWeightTplIfEEEENS4_16DefaultCompactorINS4_23WeightedStringCompactorISA_EEjNS4_19DefaultCompactStoreISt4pairIiS9_EjEEEENS4_17DefaultCacheStoreISA_EEEESaISL_EJEEERPT_St20_Sp_alloc_shared_tagIT0_EDpOT1_\n   fun:_ZNSt12__shared_ptrIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_12LogWeightTplIfEEEENS0_16DefaultCompactorINS0_23WeightedStringCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairIiS5_EjEEEENS0_17DefaultCacheStoreIS6_EEEELN9__gnu_cxx12_Lock_policyE2EEC1ISaISH_EJEEESt20_Sp_alloc_shared_tagIT_EDpOT0_\n   fun:_ZNSt10shared_ptrIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_12LogWeightTplIfEEEENS0_16DefaultCompactorINS0_23WeightedStringCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairIiS5_EjEEEENS0_17DefaultCacheStoreIS6_EEEEEC1ISaISH_EJEEESt20_Sp_alloc_shared_tagIT_EDpOT0_\n   fun:_ZSt15allocate_sharedIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_12LogWeightTplIfEEEENS0_16DefaultCompactorINS0_23WeightedStringCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairIiS5_EjEEEENS0_17DefaultCacheStoreIS6_EEEESaISH_EJEESt10shared_ptrIT_ERKT0_DpOT1_\n}\n{\n   <openfst>\n   Memcheck:Leak\n   match-leak-kinds: reachable\n   fun:_Znwm\n   fun:_ZZN3fst16DefaultCompactorINS_23WeightedStringCompactorINS_6ArcTplINS_12LogWeightTplIfEEEEEEjNS_19DefaultCompactStoreISt4pairIiS4_EjEEE4TypeB5cxx11EvENKUlvE_clEv\n   fun:_ZN3fst16DefaultCompactorINS_23WeightedStringCompactorINS_6ArcTplINS_12LogWeightTplIfEEEEEEjNS_19DefaultCompactStoreISt4pairIiS4_EjEEE4TypeB5cxx11Ev\n   fun:_ZN3fst8internal14CompactFstImplINS_6ArcTplINS_12LogWeightTplIfEEEENS_16DefaultCompactorINS_23WeightedStringCompactorIS5_EEjNS_19DefaultCompactStoreISt4pairIiS4_EjEEEENS_17DefaultCacheStoreIS5_EEEC1Ev\n   fun:_ZN9__gnu_cxx13new_allocatorIN3fst8internal14CompactFstImplINS1_6ArcTplINS1_12LogWeightTplIfEEEENS1_16DefaultCompactorINS1_23WeightedStringCompactorIS7_EEjNS1_19DefaultCompactStoreISt4pairIiS6_EjEEEENS1_17DefaultCacheStoreIS7_EEEEE9constructISI_JEEEvPT_DpOT0_\n   fun:_ZNSt16allocator_traitsISaIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_12LogWeightTplIfEEEENS0_16DefaultCompactorINS0_23WeightedStringCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairIiS5_EjEEEENS0_17DefaultCacheStoreIS6_EEEEEE9constructISH_JEEEvRSI_PT_DpOT0_\n   fun:_ZNSt23_Sp_counted_ptr_inplaceIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_12LogWeightTplIfEEEENS0_16DefaultCompactorINS0_23WeightedStringCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairIiS5_EjEEEENS0_17DefaultCacheStoreIS6_EEEESaISH_ELN9__gnu_cxx12_Lock_policyE2EEC1IJEEESI_DpOT_\n   fun:_ZNSt14__shared_countILN9__gnu_cxx12_Lock_policyE2EEC1IN3fst8internal14CompactFstImplINS4_6ArcTplINS4_12LogWeightTplIfEEEENS4_16DefaultCompactorINS4_23WeightedStringCompactorISA_EEjNS4_19DefaultCompactStoreISt4pairIiS9_EjEEEENS4_17DefaultCacheStoreISA_EEEESaISL_EJEEERPT_St20_Sp_alloc_shared_tagIT0_EDpOT1_\n   fun:_ZNSt12__shared_ptrIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_12LogWeightTplIfEEEENS0_16DefaultCompactorINS0_23WeightedStringCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairIiS5_EjEEEENS0_17DefaultCacheStoreIS6_EEEELN9__gnu_cxx12_Lock_policyE2EEC1ISaISH_EJEEESt20_Sp_alloc_shared_tagIT_EDpOT0_\n   fun:_ZNSt10shared_ptrIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_12LogWeightTplIfEEEENS0_16DefaultCompactorINS0_23WeightedStringCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairIiS5_EjEEEENS0_17DefaultCacheStoreIS6_EEEEEC1ISaISH_EJEEESt20_Sp_alloc_shared_tagIT_EDpOT0_\n   fun:_ZSt15allocate_sharedIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_12LogWeightTplIfEEEENS0_16DefaultCompactorINS0_23WeightedStringCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairIiS5_EjEEEENS0_17DefaultCacheStoreIS6_EEEESaISH_EJEESt10shared_ptrIT_ERKT0_DpOT1_\n   fun:_ZSt11make_sharedIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_12LogWeightTplIfEEEENS0_16DefaultCompactorINS0_23WeightedStringCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairIiS5_EjEEEENS0_17DefaultCacheStoreIS6_EEEEJEESt10shared_ptrIT_EDpOT0_\n}\n{\n   <openfst>\n   Memcheck:Leak\n   match-leak-kinds: reachable\n   fun:_Znwm\n   fun:_ZN3fst17AcceptorCompactorINS_6ArcTplINS_17TropicalWeightTplIfEEEEE4TypeB5cxx11Ev\n   fun:_ZZN3fst16DefaultCompactorINS_17AcceptorCompactorINS_6ArcTplINS_17TropicalWeightTplIfEEEEEEjNS_19DefaultCompactStoreISt4pairIS8_IiS4_EiEjEEE4TypeB5cxx11EvENKUlvE_clEv\n   fun:_ZN3fst16DefaultCompactorINS_17AcceptorCompactorINS_6ArcTplINS_17TropicalWeightTplIfEEEEEEjNS_19DefaultCompactStoreISt4pairIS8_IiS4_EiEjEEE4TypeB5cxx11Ev\n   fun:_ZN3fst8internal14CompactFstImplINS_6ArcTplINS_17TropicalWeightTplIfEEEENS_16DefaultCompactorINS_17AcceptorCompactorIS5_EEjNS_19DefaultCompactStoreISt4pairISA_IiS4_EiEjEEEENS_17DefaultCacheStoreIS5_EEEC1Ev\n   fun:_ZN9__gnu_cxx13new_allocatorIN3fst8internal14CompactFstImplINS1_6ArcTplINS1_17TropicalWeightTplIfEEEENS1_16DefaultCompactorINS1_17AcceptorCompactorIS7_EEjNS1_19DefaultCompactStoreISt4pairISC_IiS6_EiEjEEEENS1_17DefaultCacheStoreIS7_EEEEE9constructISJ_JEEEvPT_DpOT0_\n   fun:_ZNSt16allocator_traitsISaIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_17TropicalWeightTplIfEEEENS0_16DefaultCompactorINS0_17AcceptorCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairISB_IiS5_EiEjEEEENS0_17DefaultCacheStoreIS6_EEEEEE9constructISI_JEEEvRSJ_PT_DpOT0_\n   fun:_ZNSt23_Sp_counted_ptr_inplaceIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_17TropicalWeightTplIfEEEENS0_16DefaultCompactorINS0_17AcceptorCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairISB_IiS5_EiEjEEEENS0_17DefaultCacheStoreIS6_EEEESaISI_ELN9__gnu_cxx12_Lock_policyE2EEC1IJEEESJ_DpOT_\n   fun:_ZNSt14__shared_countILN9__gnu_cxx12_Lock_policyE2EEC1IN3fst8internal14CompactFstImplINS4_6ArcTplINS4_17TropicalWeightTplIfEEEENS4_16DefaultCompactorINS4_17AcceptorCompactorISA_EEjNS4_19DefaultCompactStoreISt4pairISF_IiS9_EiEjEEEENS4_17DefaultCacheStoreISA_EEEESaISM_EJEEERPT_St20_Sp_alloc_shared_tagIT0_EDpOT1_\n   fun:_ZNSt12__shared_ptrIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_17TropicalWeightTplIfEEEENS0_16DefaultCompactorINS0_17AcceptorCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairISB_IiS5_EiEjEEEENS0_17DefaultCacheStoreIS6_EEEELN9__gnu_cxx12_Lock_policyE2EEC1ISaISI_EJEEESt20_Sp_alloc_shared_tagIT_EDpOT0_\n   fun:_ZNSt10shared_ptrIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_17TropicalWeightTplIfEEEENS0_16DefaultCompactorINS0_17AcceptorCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairISB_IiS5_EiEjEEEENS0_17DefaultCacheStoreIS6_EEEEEC1ISaISI_EJEEESt20_Sp_alloc_shared_tagIT_EDpOT0_\n   fun:_ZSt15allocate_sharedIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_17TropicalWeightTplIfEEEENS0_16DefaultCompactorINS0_17AcceptorCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairISB_IiS5_EiEjEEEENS0_17DefaultCacheStoreIS6_EEEESaISI_EJEESt10shared_ptrIT_ERKT0_DpOT1_\n}\n{\n   <openfst>\n   Memcheck:Leak\n   match-leak-kinds: reachable\n   fun:_Znwm\n   fun:_ZN3fst19DefaultCompactStoreISt4pairIS1_IiNS_17TropicalWeightTplIfEEEiEjE4TypeB5cxx11Ev\n   fun:_ZZN3fst16DefaultCompactorINS_17AcceptorCompactorINS_6ArcTplINS_17TropicalWeightTplIfEEEEEEjNS_19DefaultCompactStoreISt4pairIS8_IiS4_EiEjEEE4TypeB5cxx11EvENKUlvE_clEv\n   fun:_ZN3fst16DefaultCompactorINS_17AcceptorCompactorINS_6ArcTplINS_17TropicalWeightTplIfEEEEEEjNS_19DefaultCompactStoreISt4pairIS8_IiS4_EiEjEEE4TypeB5cxx11Ev\n   fun:_ZN3fst8internal14CompactFstImplINS_6ArcTplINS_17TropicalWeightTplIfEEEENS_16DefaultCompactorINS_17AcceptorCompactorIS5_EEjNS_19DefaultCompactStoreISt4pairISA_IiS4_EiEjEEEENS_17DefaultCacheStoreIS5_EEEC1Ev\n   fun:_ZN9__gnu_cxx13new_allocatorIN3fst8internal14CompactFstImplINS1_6ArcTplINS1_17TropicalWeightTplIfEEEENS1_16DefaultCompactorINS1_17AcceptorCompactorIS7_EEjNS1_19DefaultCompactStoreISt4pairISC_IiS6_EiEjEEEENS1_17DefaultCacheStoreIS7_EEEEE9constructISJ_JEEEvPT_DpOT0_\n   fun:_ZNSt16allocator_traitsISaIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_17TropicalWeightTplIfEEEENS0_16DefaultCompactorINS0_17AcceptorCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairISB_IiS5_EiEjEEEENS0_17DefaultCacheStoreIS6_EEEEEE9constructISI_JEEEvRSJ_PT_DpOT0_\n   fun:_ZNSt23_Sp_counted_ptr_inplaceIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_17TropicalWeightTplIfEEEENS0_16DefaultCompactorINS0_17AcceptorCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairISB_IiS5_EiEjEEEENS0_17DefaultCacheStoreIS6_EEEESaISI_ELN9__gnu_cxx12_Lock_policyE2EEC1IJEEESJ_DpOT_\n   fun:_ZNSt14__shared_countILN9__gnu_cxx12_Lock_policyE2EEC1IN3fst8internal14CompactFstImplINS4_6ArcTplINS4_17TropicalWeightTplIfEEEENS4_16DefaultCompactorINS4_17AcceptorCompactorISA_EEjNS4_19DefaultCompactStoreISt4pairISF_IiS9_EiEjEEEENS4_17DefaultCacheStoreISA_EEEESaISM_EJEEERPT_St20_Sp_alloc_shared_tagIT0_EDpOT1_\n   fun:_ZNSt12__shared_ptrIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_17TropicalWeightTplIfEEEENS0_16DefaultCompactorINS0_17AcceptorCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairISB_IiS5_EiEjEEEENS0_17DefaultCacheStoreIS6_EEEELN9__gnu_cxx12_Lock_policyE2EEC1ISaISI_EJEEESt20_Sp_alloc_shared_tagIT_EDpOT0_\n   fun:_ZNSt10shared_ptrIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_17TropicalWeightTplIfEEEENS0_16DefaultCompactorINS0_17AcceptorCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairISB_IiS5_EiEjEEEENS0_17DefaultCacheStoreIS6_EEEEEC1ISaISI_EJEEESt20_Sp_alloc_shared_tagIT_EDpOT0_\n   fun:_ZSt15allocate_sharedIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_17TropicalWeightTplIfEEEENS0_16DefaultCompactorINS0_17AcceptorCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairISB_IiS5_EiEjEEEENS0_17DefaultCacheStoreIS6_EEEESaISI_EJEESt10shared_ptrIT_ERKT0_DpOT1_\n}\n{\n   <openfst>\n   Memcheck:Leak\n   match-leak-kinds: reachable\n   fun:_Znwm\n   fun:_ZZN3fst16DefaultCompactorINS_17AcceptorCompactorINS_6ArcTplINS_17TropicalWeightTplIfEEEEEEjNS_19DefaultCompactStoreISt4pairIS8_IiS4_EiEjEEE4TypeB5cxx11EvENKUlvE_clEv\n   fun:_ZN3fst16DefaultCompactorINS_17AcceptorCompactorINS_6ArcTplINS_17TropicalWeightTplIfEEEEEEjNS_19DefaultCompactStoreISt4pairIS8_IiS4_EiEjEEE4TypeB5cxx11Ev\n   fun:_ZN3fst8internal14CompactFstImplINS_6ArcTplINS_17TropicalWeightTplIfEEEENS_16DefaultCompactorINS_17AcceptorCompactorIS5_EEjNS_19DefaultCompactStoreISt4pairISA_IiS4_EiEjEEEENS_17DefaultCacheStoreIS5_EEEC1Ev\n   fun:_ZN9__gnu_cxx13new_allocatorIN3fst8internal14CompactFstImplINS1_6ArcTplINS1_17TropicalWeightTplIfEEEENS1_16DefaultCompactorINS1_17AcceptorCompactorIS7_EEjNS1_19DefaultCompactStoreISt4pairISC_IiS6_EiEjEEEENS1_17DefaultCacheStoreIS7_EEEEE9constructISJ_JEEEvPT_DpOT0_\n   fun:_ZNSt16allocator_traitsISaIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_17TropicalWeightTplIfEEEENS0_16DefaultCompactorINS0_17AcceptorCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairISB_IiS5_EiEjEEEENS0_17DefaultCacheStoreIS6_EEEEEE9constructISI_JEEEvRSJ_PT_DpOT0_\n   fun:_ZNSt23_Sp_counted_ptr_inplaceIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_17TropicalWeightTplIfEEEENS0_16DefaultCompactorINS0_17AcceptorCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairISB_IiS5_EiEjEEEENS0_17DefaultCacheStoreIS6_EEEESaISI_ELN9__gnu_cxx12_Lock_policyE2EEC1IJEEESJ_DpOT_\n   fun:_ZNSt14__shared_countILN9__gnu_cxx12_Lock_policyE2EEC1IN3fst8internal14CompactFstImplINS4_6ArcTplINS4_17TropicalWeightTplIfEEEENS4_16DefaultCompactorINS4_17AcceptorCompactorISA_EEjNS4_19DefaultCompactStoreISt4pairISF_IiS9_EiEjEEEENS4_17DefaultCacheStoreISA_EEEESaISM_EJEEERPT_St20_Sp_alloc_shared_tagIT0_EDpOT1_\n   fun:_ZNSt12__shared_ptrIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_17TropicalWeightTplIfEEEENS0_16DefaultCompactorINS0_17AcceptorCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairISB_IiS5_EiEjEEEENS0_17DefaultCacheStoreIS6_EEEELN9__gnu_cxx12_Lock_policyE2EEC1ISaISI_EJEEESt20_Sp_alloc_shared_tagIT_EDpOT0_\n   fun:_ZNSt10shared_ptrIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_17TropicalWeightTplIfEEEENS0_16DefaultCompactorINS0_17AcceptorCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairISB_IiS5_EiEjEEEENS0_17DefaultCacheStoreIS6_EEEEEC1ISaISI_EJEEESt20_Sp_alloc_shared_tagIT_EDpOT0_\n   fun:_ZSt15allocate_sharedIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_17TropicalWeightTplIfEEEENS0_16DefaultCompactorINS0_17AcceptorCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairISB_IiS5_EiEjEEEENS0_17DefaultCacheStoreIS6_EEEESaISI_EJEESt10shared_ptrIT_ERKT0_DpOT1_\n   fun:_ZSt11make_sharedIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_17TropicalWeightTplIfEEEENS0_16DefaultCompactorINS0_17AcceptorCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairISB_IiS5_EiEjEEEENS0_17DefaultCacheStoreIS6_EEEEJEESt10shared_ptrIT_EDpOT0_\n}\n{\n   <openfst>\n   Memcheck:Leak\n   match-leak-kinds: reachable\n   fun:_Znwm\n   fun:_ZN3fst17AcceptorCompactorINS_6ArcTplINS_12LogWeightTplIfEEEEE4TypeB5cxx11Ev\n   fun:_ZZN3fst16DefaultCompactorINS_17AcceptorCompactorINS_6ArcTplINS_12LogWeightTplIfEEEEEEjNS_19DefaultCompactStoreISt4pairIS8_IiS4_EiEjEEE4TypeB5cxx11EvENKUlvE_clEv\n   fun:_ZN3fst16DefaultCompactorINS_17AcceptorCompactorINS_6ArcTplINS_12LogWeightTplIfEEEEEEjNS_19DefaultCompactStoreISt4pairIS8_IiS4_EiEjEEE4TypeB5cxx11Ev\n   fun:_ZN3fst8internal14CompactFstImplINS_6ArcTplINS_12LogWeightTplIfEEEENS_16DefaultCompactorINS_17AcceptorCompactorIS5_EEjNS_19DefaultCompactStoreISt4pairISA_IiS4_EiEjEEEENS_17DefaultCacheStoreIS5_EEEC1Ev\n   fun:_ZN9__gnu_cxx13new_allocatorIN3fst8internal14CompactFstImplINS1_6ArcTplINS1_12LogWeightTplIfEEEENS1_16DefaultCompactorINS1_17AcceptorCompactorIS7_EEjNS1_19DefaultCompactStoreISt4pairISC_IiS6_EiEjEEEENS1_17DefaultCacheStoreIS7_EEEEE9constructISJ_JEEEvPT_DpOT0_\n   fun:_ZNSt16allocator_traitsISaIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_12LogWeightTplIfEEEENS0_16DefaultCompactorINS0_17AcceptorCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairISB_IiS5_EiEjEEEENS0_17DefaultCacheStoreIS6_EEEEEE9constructISI_JEEEvRSJ_PT_DpOT0_\n   fun:_ZNSt23_Sp_counted_ptr_inplaceIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_12LogWeightTplIfEEEENS0_16DefaultCompactorINS0_17AcceptorCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairISB_IiS5_EiEjEEEENS0_17DefaultCacheStoreIS6_EEEESaISI_ELN9__gnu_cxx12_Lock_policyE2EEC1IJEEESJ_DpOT_\n   fun:_ZNSt14__shared_countILN9__gnu_cxx12_Lock_policyE2EEC1IN3fst8internal14CompactFstImplINS4_6ArcTplINS4_12LogWeightTplIfEEEENS4_16DefaultCompactorINS4_17AcceptorCompactorISA_EEjNS4_19DefaultCompactStoreISt4pairISF_IiS9_EiEjEEEENS4_17DefaultCacheStoreISA_EEEESaISM_EJEEERPT_St20_Sp_alloc_shared_tagIT0_EDpOT1_\n   fun:_ZNSt12__shared_ptrIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_12LogWeightTplIfEEEENS0_16DefaultCompactorINS0_17AcceptorCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairISB_IiS5_EiEjEEEENS0_17DefaultCacheStoreIS6_EEEELN9__gnu_cxx12_Lock_policyE2EEC1ISaISI_EJEEESt20_Sp_alloc_shared_tagIT_EDpOT0_\n   fun:_ZNSt10shared_ptrIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_12LogWeightTplIfEEEENS0_16DefaultCompactorINS0_17AcceptorCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairISB_IiS5_EiEjEEEENS0_17DefaultCacheStoreIS6_EEEEEC1ISaISI_EJEEESt20_Sp_alloc_shared_tagIT_EDpOT0_\n   fun:_ZSt15allocate_sharedIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_12LogWeightTplIfEEEENS0_16DefaultCompactorINS0_17AcceptorCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairISB_IiS5_EiEjEEEENS0_17DefaultCacheStoreIS6_EEEESaISI_EJEESt10shared_ptrIT_ERKT0_DpOT1_\n}\n{\n   <openfst>\n   Memcheck:Leak\n   match-leak-kinds: reachable\n   fun:_Znwm\n   fun:_ZN3fst19DefaultCompactStoreISt4pairIS1_IiNS_12LogWeightTplIfEEEiEjE4TypeB5cxx11Ev\n   fun:_ZZN3fst16DefaultCompactorINS_17AcceptorCompactorINS_6ArcTplINS_12LogWeightTplIfEEEEEEjNS_19DefaultCompactStoreISt4pairIS8_IiS4_EiEjEEE4TypeB5cxx11EvENKUlvE_clEv\n   fun:_ZN3fst16DefaultCompactorINS_17AcceptorCompactorINS_6ArcTplINS_12LogWeightTplIfEEEEEEjNS_19DefaultCompactStoreISt4pairIS8_IiS4_EiEjEEE4TypeB5cxx11Ev\n   fun:_ZN3fst8internal14CompactFstImplINS_6ArcTplINS_12LogWeightTplIfEEEENS_16DefaultCompactorINS_17AcceptorCompactorIS5_EEjNS_19DefaultCompactStoreISt4pairISA_IiS4_EiEjEEEENS_17DefaultCacheStoreIS5_EEEC1Ev\n   fun:_ZN9__gnu_cxx13new_allocatorIN3fst8internal14CompactFstImplINS1_6ArcTplINS1_12LogWeightTplIfEEEENS1_16DefaultCompactorINS1_17AcceptorCompactorIS7_EEjNS1_19DefaultCompactStoreISt4pairISC_IiS6_EiEjEEEENS1_17DefaultCacheStoreIS7_EEEEE9constructISJ_JEEEvPT_DpOT0_\n   fun:_ZNSt16allocator_traitsISaIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_12LogWeightTplIfEEEENS0_16DefaultCompactorINS0_17AcceptorCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairISB_IiS5_EiEjEEEENS0_17DefaultCacheStoreIS6_EEEEEE9constructISI_JEEEvRSJ_PT_DpOT0_\n   fun:_ZNSt23_Sp_counted_ptr_inplaceIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_12LogWeightTplIfEEEENS0_16DefaultCompactorINS0_17AcceptorCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairISB_IiS5_EiEjEEEENS0_17DefaultCacheStoreIS6_EEEESaISI_ELN9__gnu_cxx12_Lock_policyE2EEC1IJEEESJ_DpOT_\n   fun:_ZNSt14__shared_countILN9__gnu_cxx12_Lock_policyE2EEC1IN3fst8internal14CompactFstImplINS4_6ArcTplINS4_12LogWeightTplIfEEEENS4_16DefaultCompactorINS4_17AcceptorCompactorISA_EEjNS4_19DefaultCompactStoreISt4pairISF_IiS9_EiEjEEEENS4_17DefaultCacheStoreISA_EEEESaISM_EJEEERPT_St20_Sp_alloc_shared_tagIT0_EDpOT1_\n   fun:_ZNSt12__shared_ptrIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_12LogWeightTplIfEEEENS0_16DefaultCompactorINS0_17AcceptorCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairISB_IiS5_EiEjEEEENS0_17DefaultCacheStoreIS6_EEEELN9__gnu_cxx12_Lock_policyE2EEC1ISaISI_EJEEESt20_Sp_alloc_shared_tagIT_EDpOT0_\n   fun:_ZNSt10shared_ptrIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_12LogWeightTplIfEEEENS0_16DefaultCompactorINS0_17AcceptorCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairISB_IiS5_EiEjEEEENS0_17DefaultCacheStoreIS6_EEEEEC1ISaISI_EJEEESt20_Sp_alloc_shared_tagIT_EDpOT0_\n   fun:_ZSt15allocate_sharedIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_12LogWeightTplIfEEEENS0_16DefaultCompactorINS0_17AcceptorCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairISB_IiS5_EiEjEEEENS0_17DefaultCacheStoreIS6_EEEESaISI_EJEESt10shared_ptrIT_ERKT0_DpOT1_\n}\n{\n   <openfst>\n   Memcheck:Leak\n   match-leak-kinds: reachable\n   fun:_Znwm\n   fun:_ZZN3fst16DefaultCompactorINS_17AcceptorCompactorINS_6ArcTplINS_12LogWeightTplIfEEEEEEjNS_19DefaultCompactStoreISt4pairIS8_IiS4_EiEjEEE4TypeB5cxx11EvENKUlvE_clEv\n   fun:_ZN3fst16DefaultCompactorINS_17AcceptorCompactorINS_6ArcTplINS_12LogWeightTplIfEEEEEEjNS_19DefaultCompactStoreISt4pairIS8_IiS4_EiEjEEE4TypeB5cxx11Ev\n   fun:_ZN3fst8internal14CompactFstImplINS_6ArcTplINS_12LogWeightTplIfEEEENS_16DefaultCompactorINS_17AcceptorCompactorIS5_EEjNS_19DefaultCompactStoreISt4pairISA_IiS4_EiEjEEEENS_17DefaultCacheStoreIS5_EEEC1Ev\n   fun:_ZN9__gnu_cxx13new_allocatorIN3fst8internal14CompactFstImplINS1_6ArcTplINS1_12LogWeightTplIfEEEENS1_16DefaultCompactorINS1_17AcceptorCompactorIS7_EEjNS1_19DefaultCompactStoreISt4pairISC_IiS6_EiEjEEEENS1_17DefaultCacheStoreIS7_EEEEE9constructISJ_JEEEvPT_DpOT0_\n   fun:_ZNSt16allocator_traitsISaIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_12LogWeightTplIfEEEENS0_16DefaultCompactorINS0_17AcceptorCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairISB_IiS5_EiEjEEEENS0_17DefaultCacheStoreIS6_EEEEEE9constructISI_JEEEvRSJ_PT_DpOT0_\n   fun:_ZNSt23_Sp_counted_ptr_inplaceIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_12LogWeightTplIfEEEENS0_16DefaultCompactorINS0_17AcceptorCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairISB_IiS5_EiEjEEEENS0_17DefaultCacheStoreIS6_EEEESaISI_ELN9__gnu_cxx12_Lock_policyE2EEC1IJEEESJ_DpOT_\n   fun:_ZNSt14__shared_countILN9__gnu_cxx12_Lock_policyE2EEC1IN3fst8internal14CompactFstImplINS4_6ArcTplINS4_12LogWeightTplIfEEEENS4_16DefaultCompactorINS4_17AcceptorCompactorISA_EEjNS4_19DefaultCompactStoreISt4pairISF_IiS9_EiEjEEEENS4_17DefaultCacheStoreISA_EEEESaISM_EJEEERPT_St20_Sp_alloc_shared_tagIT0_EDpOT1_\n   fun:_ZNSt12__shared_ptrIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_12LogWeightTplIfEEEENS0_16DefaultCompactorINS0_17AcceptorCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairISB_IiS5_EiEjEEEENS0_17DefaultCacheStoreIS6_EEEELN9__gnu_cxx12_Lock_policyE2EEC1ISaISI_EJEEESt20_Sp_alloc_shared_tagIT_EDpOT0_\n   fun:_ZNSt10shared_ptrIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_12LogWeightTplIfEEEENS0_16DefaultCompactorINS0_17AcceptorCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairISB_IiS5_EiEjEEEENS0_17DefaultCacheStoreIS6_EEEEEC1ISaISI_EJEEESt20_Sp_alloc_shared_tagIT_EDpOT0_\n   fun:_ZSt15allocate_sharedIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_12LogWeightTplIfEEEENS0_16DefaultCompactorINS0_17AcceptorCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairISB_IiS5_EiEjEEEENS0_17DefaultCacheStoreIS6_EEEESaISI_EJEESt10shared_ptrIT_ERKT0_DpOT1_\n   fun:_ZSt11make_sharedIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_12LogWeightTplIfEEEENS0_16DefaultCompactorINS0_17AcceptorCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairISB_IiS5_EiEjEEEENS0_17DefaultCacheStoreIS6_EEEEJEESt10shared_ptrIT_EDpOT0_\n}\n{\n   <openfst>\n   Memcheck:Leak\n   match-leak-kinds: reachable\n   fun:_Znwm\n   fun:_ZN3fst19UnweightedCompactorINS_6ArcTplINS_17TropicalWeightTplIfEEEEE4TypeB5cxx11Ev\n   fun:_ZZN3fst16DefaultCompactorINS_19UnweightedCompactorINS_6ArcTplINS_17TropicalWeightTplIfEEEEEEjNS_19DefaultCompactStoreISt4pairIS8_IiiEiEjEEE4TypeB5cxx11EvENKUlvE_clEv\n   fun:_ZN3fst16DefaultCompactorINS_19UnweightedCompactorINS_6ArcTplINS_17TropicalWeightTplIfEEEEEEjNS_19DefaultCompactStoreISt4pairIS8_IiiEiEjEEE4TypeB5cxx11Ev\n   fun:_ZN3fst8internal14CompactFstImplINS_6ArcTplINS_17TropicalWeightTplIfEEEENS_16DefaultCompactorINS_19UnweightedCompactorIS5_EEjNS_19DefaultCompactStoreISt4pairISA_IiiEiEjEEEENS_17DefaultCacheStoreIS5_EEEC1Ev\n   fun:_ZN9__gnu_cxx13new_allocatorIN3fst8internal14CompactFstImplINS1_6ArcTplINS1_17TropicalWeightTplIfEEEENS1_16DefaultCompactorINS1_19UnweightedCompactorIS7_EEjNS1_19DefaultCompactStoreISt4pairISC_IiiEiEjEEEENS1_17DefaultCacheStoreIS7_EEEEE9constructISJ_JEEEvPT_DpOT0_\n   fun:_ZNSt16allocator_traitsISaIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_17TropicalWeightTplIfEEEENS0_16DefaultCompactorINS0_19UnweightedCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairISB_IiiEiEjEEEENS0_17DefaultCacheStoreIS6_EEEEEE9constructISI_JEEEvRSJ_PT_DpOT0_\n   fun:_ZNSt23_Sp_counted_ptr_inplaceIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_17TropicalWeightTplIfEEEENS0_16DefaultCompactorINS0_19UnweightedCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairISB_IiiEiEjEEEENS0_17DefaultCacheStoreIS6_EEEESaISI_ELN9__gnu_cxx12_Lock_policyE2EEC1IJEEESJ_DpOT_\n   fun:_ZNSt14__shared_countILN9__gnu_cxx12_Lock_policyE2EEC1IN3fst8internal14CompactFstImplINS4_6ArcTplINS4_17TropicalWeightTplIfEEEENS4_16DefaultCompactorINS4_19UnweightedCompactorISA_EEjNS4_19DefaultCompactStoreISt4pairISF_IiiEiEjEEEENS4_17DefaultCacheStoreISA_EEEESaISM_EJEEERPT_St20_Sp_alloc_shared_tagIT0_EDpOT1_\n   fun:_ZNSt12__shared_ptrIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_17TropicalWeightTplIfEEEENS0_16DefaultCompactorINS0_19UnweightedCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairISB_IiiEiEjEEEENS0_17DefaultCacheStoreIS6_EEEELN9__gnu_cxx12_Lock_policyE2EEC1ISaISI_EJEEESt20_Sp_alloc_shared_tagIT_EDpOT0_\n   fun:_ZNSt10shared_ptrIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_17TropicalWeightTplIfEEEENS0_16DefaultCompactorINS0_19UnweightedCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairISB_IiiEiEjEEEENS0_17DefaultCacheStoreIS6_EEEEEC1ISaISI_EJEEESt20_Sp_alloc_shared_tagIT_EDpOT0_\n   fun:_ZSt15allocate_sharedIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_17TropicalWeightTplIfEEEENS0_16DefaultCompactorINS0_19UnweightedCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairISB_IiiEiEjEEEENS0_17DefaultCacheStoreIS6_EEEESaISI_EJEESt10shared_ptrIT_ERKT0_DpOT1_\n}\n{\n   <openfst>\n   Memcheck:Leak\n   match-leak-kinds: reachable\n   fun:_Znwm\n   fun:_ZN3fst19DefaultCompactStoreISt4pairIS1_IiiEiEjE4TypeB5cxx11Ev\n   fun:_ZZN3fst16DefaultCompactorINS_19UnweightedCompactorINS_6ArcTplINS_17TropicalWeightTplIfEEEEEEjNS_19DefaultCompactStoreISt4pairIS8_IiiEiEjEEE4TypeB5cxx11EvENKUlvE_clEv\n   fun:_ZN3fst16DefaultCompactorINS_19UnweightedCompactorINS_6ArcTplINS_17TropicalWeightTplIfEEEEEEjNS_19DefaultCompactStoreISt4pairIS8_IiiEiEjEEE4TypeB5cxx11Ev\n   fun:_ZN3fst8internal14CompactFstImplINS_6ArcTplINS_17TropicalWeightTplIfEEEENS_16DefaultCompactorINS_19UnweightedCompactorIS5_EEjNS_19DefaultCompactStoreISt4pairISA_IiiEiEjEEEENS_17DefaultCacheStoreIS5_EEEC1Ev\n   fun:_ZN9__gnu_cxx13new_allocatorIN3fst8internal14CompactFstImplINS1_6ArcTplINS1_17TropicalWeightTplIfEEEENS1_16DefaultCompactorINS1_19UnweightedCompactorIS7_EEjNS1_19DefaultCompactStoreISt4pairISC_IiiEiEjEEEENS1_17DefaultCacheStoreIS7_EEEEE9constructISJ_JEEEvPT_DpOT0_\n   fun:_ZNSt16allocator_traitsISaIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_17TropicalWeightTplIfEEEENS0_16DefaultCompactorINS0_19UnweightedCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairISB_IiiEiEjEEEENS0_17DefaultCacheStoreIS6_EEEEEE9constructISI_JEEEvRSJ_PT_DpOT0_\n   fun:_ZNSt23_Sp_counted_ptr_inplaceIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_17TropicalWeightTplIfEEEENS0_16DefaultCompactorINS0_19UnweightedCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairISB_IiiEiEjEEEENS0_17DefaultCacheStoreIS6_EEEESaISI_ELN9__gnu_cxx12_Lock_policyE2EEC1IJEEESJ_DpOT_\n   fun:_ZNSt14__shared_countILN9__gnu_cxx12_Lock_policyE2EEC1IN3fst8internal14CompactFstImplINS4_6ArcTplINS4_17TropicalWeightTplIfEEEENS4_16DefaultCompactorINS4_19UnweightedCompactorISA_EEjNS4_19DefaultCompactStoreISt4pairISF_IiiEiEjEEEENS4_17DefaultCacheStoreISA_EEEESaISM_EJEEERPT_St20_Sp_alloc_shared_tagIT0_EDpOT1_\n   fun:_ZNSt12__shared_ptrIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_17TropicalWeightTplIfEEEENS0_16DefaultCompactorINS0_19UnweightedCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairISB_IiiEiEjEEEENS0_17DefaultCacheStoreIS6_EEEELN9__gnu_cxx12_Lock_policyE2EEC1ISaISI_EJEEESt20_Sp_alloc_shared_tagIT_EDpOT0_\n   fun:_ZNSt10shared_ptrIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_17TropicalWeightTplIfEEEENS0_16DefaultCompactorINS0_19UnweightedCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairISB_IiiEiEjEEEENS0_17DefaultCacheStoreIS6_EEEEEC1ISaISI_EJEEESt20_Sp_alloc_shared_tagIT_EDpOT0_\n   fun:_ZSt15allocate_sharedIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_17TropicalWeightTplIfEEEENS0_16DefaultCompactorINS0_19UnweightedCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairISB_IiiEiEjEEEENS0_17DefaultCacheStoreIS6_EEEESaISI_EJEESt10shared_ptrIT_ERKT0_DpOT1_\n}\n{\n   <openfst>\n   Memcheck:Leak\n   match-leak-kinds: reachable\n   fun:_Znwm\n   fun:_ZZN3fst16DefaultCompactorINS_19UnweightedCompactorINS_6ArcTplINS_17TropicalWeightTplIfEEEEEEjNS_19DefaultCompactStoreISt4pairIS8_IiiEiEjEEE4TypeB5cxx11EvENKUlvE_clEv\n   fun:_ZN3fst16DefaultCompactorINS_19UnweightedCompactorINS_6ArcTplINS_17TropicalWeightTplIfEEEEEEjNS_19DefaultCompactStoreISt4pairIS8_IiiEiEjEEE4TypeB5cxx11Ev\n   fun:_ZN3fst8internal14CompactFstImplINS_6ArcTplINS_17TropicalWeightTplIfEEEENS_16DefaultCompactorINS_19UnweightedCompactorIS5_EEjNS_19DefaultCompactStoreISt4pairISA_IiiEiEjEEEENS_17DefaultCacheStoreIS5_EEEC1Ev\n   fun:_ZN9__gnu_cxx13new_allocatorIN3fst8internal14CompactFstImplINS1_6ArcTplINS1_17TropicalWeightTplIfEEEENS1_16DefaultCompactorINS1_19UnweightedCompactorIS7_EEjNS1_19DefaultCompactStoreISt4pairISC_IiiEiEjEEEENS1_17DefaultCacheStoreIS7_EEEEE9constructISJ_JEEEvPT_DpOT0_\n   fun:_ZNSt16allocator_traitsISaIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_17TropicalWeightTplIfEEEENS0_16DefaultCompactorINS0_19UnweightedCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairISB_IiiEiEjEEEENS0_17DefaultCacheStoreIS6_EEEEEE9constructISI_JEEEvRSJ_PT_DpOT0_\n   fun:_ZNSt23_Sp_counted_ptr_inplaceIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_17TropicalWeightTplIfEEEENS0_16DefaultCompactorINS0_19UnweightedCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairISB_IiiEiEjEEEENS0_17DefaultCacheStoreIS6_EEEESaISI_ELN9__gnu_cxx12_Lock_policyE2EEC1IJEEESJ_DpOT_\n   fun:_ZNSt14__shared_countILN9__gnu_cxx12_Lock_policyE2EEC1IN3fst8internal14CompactFstImplINS4_6ArcTplINS4_17TropicalWeightTplIfEEEENS4_16DefaultCompactorINS4_19UnweightedCompactorISA_EEjNS4_19DefaultCompactStoreISt4pairISF_IiiEiEjEEEENS4_17DefaultCacheStoreISA_EEEESaISM_EJEEERPT_St20_Sp_alloc_shared_tagIT0_EDpOT1_\n   fun:_ZNSt12__shared_ptrIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_17TropicalWeightTplIfEEEENS0_16DefaultCompactorINS0_19UnweightedCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairISB_IiiEiEjEEEENS0_17DefaultCacheStoreIS6_EEEELN9__gnu_cxx12_Lock_policyE2EEC1ISaISI_EJEEESt20_Sp_alloc_shared_tagIT_EDpOT0_\n   fun:_ZNSt10shared_ptrIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_17TropicalWeightTplIfEEEENS0_16DefaultCompactorINS0_19UnweightedCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairISB_IiiEiEjEEEENS0_17DefaultCacheStoreIS6_EEEEEC1ISaISI_EJEEESt20_Sp_alloc_shared_tagIT_EDpOT0_\n   fun:_ZSt15allocate_sharedIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_17TropicalWeightTplIfEEEENS0_16DefaultCompactorINS0_19UnweightedCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairISB_IiiEiEjEEEENS0_17DefaultCacheStoreIS6_EEEESaISI_EJEESt10shared_ptrIT_ERKT0_DpOT1_\n   fun:_ZSt11make_sharedIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_17TropicalWeightTplIfEEEENS0_16DefaultCompactorINS0_19UnweightedCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairISB_IiiEiEjEEEENS0_17DefaultCacheStoreIS6_EEEEJEESt10shared_ptrIT_EDpOT0_\n}\n{\n   <openfst>\n   Memcheck:Leak\n   match-leak-kinds: reachable\n   fun:_Znwm\n   fun:_ZN3fst19UnweightedCompactorINS_6ArcTplINS_12LogWeightTplIfEEEEE4TypeB5cxx11Ev\n   fun:_ZZN3fst16DefaultCompactorINS_19UnweightedCompactorINS_6ArcTplINS_12LogWeightTplIfEEEEEEjNS_19DefaultCompactStoreISt4pairIS8_IiiEiEjEEE4TypeB5cxx11EvENKUlvE_clEv\n   fun:_ZN3fst16DefaultCompactorINS_19UnweightedCompactorINS_6ArcTplINS_12LogWeightTplIfEEEEEEjNS_19DefaultCompactStoreISt4pairIS8_IiiEiEjEEE4TypeB5cxx11Ev\n   fun:_ZN3fst8internal14CompactFstImplINS_6ArcTplINS_12LogWeightTplIfEEEENS_16DefaultCompactorINS_19UnweightedCompactorIS5_EEjNS_19DefaultCompactStoreISt4pairISA_IiiEiEjEEEENS_17DefaultCacheStoreIS5_EEEC1Ev\n   fun:_ZN9__gnu_cxx13new_allocatorIN3fst8internal14CompactFstImplINS1_6ArcTplINS1_12LogWeightTplIfEEEENS1_16DefaultCompactorINS1_19UnweightedCompactorIS7_EEjNS1_19DefaultCompactStoreISt4pairISC_IiiEiEjEEEENS1_17DefaultCacheStoreIS7_EEEEE9constructISJ_JEEEvPT_DpOT0_\n   fun:_ZNSt16allocator_traitsISaIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_12LogWeightTplIfEEEENS0_16DefaultCompactorINS0_19UnweightedCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairISB_IiiEiEjEEEENS0_17DefaultCacheStoreIS6_EEEEEE9constructISI_JEEEvRSJ_PT_DpOT0_\n   fun:_ZNSt23_Sp_counted_ptr_inplaceIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_12LogWeightTplIfEEEENS0_16DefaultCompactorINS0_19UnweightedCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairISB_IiiEiEjEEEENS0_17DefaultCacheStoreIS6_EEEESaISI_ELN9__gnu_cxx12_Lock_policyE2EEC1IJEEESJ_DpOT_\n   fun:_ZNSt14__shared_countILN9__gnu_cxx12_Lock_policyE2EEC1IN3fst8internal14CompactFstImplINS4_6ArcTplINS4_12LogWeightTplIfEEEENS4_16DefaultCompactorINS4_19UnweightedCompactorISA_EEjNS4_19DefaultCompactStoreISt4pairISF_IiiEiEjEEEENS4_17DefaultCacheStoreISA_EEEESaISM_EJEEERPT_St20_Sp_alloc_shared_tagIT0_EDpOT1_\n   fun:_ZNSt12__shared_ptrIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_12LogWeightTplIfEEEENS0_16DefaultCompactorINS0_19UnweightedCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairISB_IiiEiEjEEEENS0_17DefaultCacheStoreIS6_EEEELN9__gnu_cxx12_Lock_policyE2EEC1ISaISI_EJEEESt20_Sp_alloc_shared_tagIT_EDpOT0_\n   fun:_ZNSt10shared_ptrIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_12LogWeightTplIfEEEENS0_16DefaultCompactorINS0_19UnweightedCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairISB_IiiEiEjEEEENS0_17DefaultCacheStoreIS6_EEEEEC1ISaISI_EJEEESt20_Sp_alloc_shared_tagIT_EDpOT0_\n   fun:_ZSt15allocate_sharedIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_12LogWeightTplIfEEEENS0_16DefaultCompactorINS0_19UnweightedCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairISB_IiiEiEjEEEENS0_17DefaultCacheStoreIS6_EEEESaISI_EJEESt10shared_ptrIT_ERKT0_DpOT1_\n}\n{\n   <openfst>\n   Memcheck:Leak\n   match-leak-kinds: reachable\n   fun:_Znwm\n   fun:_ZZN3fst16DefaultCompactorINS_19UnweightedCompactorINS_6ArcTplINS_12LogWeightTplIfEEEEEEjNS_19DefaultCompactStoreISt4pairIS8_IiiEiEjEEE4TypeB5cxx11EvENKUlvE_clEv\n   fun:_ZN3fst16DefaultCompactorINS_19UnweightedCompactorINS_6ArcTplINS_12LogWeightTplIfEEEEEEjNS_19DefaultCompactStoreISt4pairIS8_IiiEiEjEEE4TypeB5cxx11Ev\n   fun:_ZN3fst8internal14CompactFstImplINS_6ArcTplINS_12LogWeightTplIfEEEENS_16DefaultCompactorINS_19UnweightedCompactorIS5_EEjNS_19DefaultCompactStoreISt4pairISA_IiiEiEjEEEENS_17DefaultCacheStoreIS5_EEEC1Ev\n   fun:_ZN9__gnu_cxx13new_allocatorIN3fst8internal14CompactFstImplINS1_6ArcTplINS1_12LogWeightTplIfEEEENS1_16DefaultCompactorINS1_19UnweightedCompactorIS7_EEjNS1_19DefaultCompactStoreISt4pairISC_IiiEiEjEEEENS1_17DefaultCacheStoreIS7_EEEEE9constructISJ_JEEEvPT_DpOT0_\n   fun:_ZNSt16allocator_traitsISaIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_12LogWeightTplIfEEEENS0_16DefaultCompactorINS0_19UnweightedCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairISB_IiiEiEjEEEENS0_17DefaultCacheStoreIS6_EEEEEE9constructISI_JEEEvRSJ_PT_DpOT0_\n   fun:_ZNSt23_Sp_counted_ptr_inplaceIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_12LogWeightTplIfEEEENS0_16DefaultCompactorINS0_19UnweightedCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairISB_IiiEiEjEEEENS0_17DefaultCacheStoreIS6_EEEESaISI_ELN9__gnu_cxx12_Lock_policyE2EEC1IJEEESJ_DpOT_\n   fun:_ZNSt14__shared_countILN9__gnu_cxx12_Lock_policyE2EEC1IN3fst8internal14CompactFstImplINS4_6ArcTplINS4_12LogWeightTplIfEEEENS4_16DefaultCompactorINS4_19UnweightedCompactorISA_EEjNS4_19DefaultCompactStoreISt4pairISF_IiiEiEjEEEENS4_17DefaultCacheStoreISA_EEEESaISM_EJEEERPT_St20_Sp_alloc_shared_tagIT0_EDpOT1_\n   fun:_ZNSt12__shared_ptrIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_12LogWeightTplIfEEEENS0_16DefaultCompactorINS0_19UnweightedCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairISB_IiiEiEjEEEENS0_17DefaultCacheStoreIS6_EEEELN9__gnu_cxx12_Lock_policyE2EEC1ISaISI_EJEEESt20_Sp_alloc_shared_tagIT_EDpOT0_\n   fun:_ZNSt10shared_ptrIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_12LogWeightTplIfEEEENS0_16DefaultCompactorINS0_19UnweightedCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairISB_IiiEiEjEEEENS0_17DefaultCacheStoreIS6_EEEEEC1ISaISI_EJEEESt20_Sp_alloc_shared_tagIT_EDpOT0_\n   fun:_ZSt15allocate_sharedIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_12LogWeightTplIfEEEENS0_16DefaultCompactorINS0_19UnweightedCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairISB_IiiEiEjEEEENS0_17DefaultCacheStoreIS6_EEEESaISI_EJEESt10shared_ptrIT_ERKT0_DpOT1_\n   fun:_ZSt11make_sharedIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_12LogWeightTplIfEEEENS0_16DefaultCompactorINS0_19UnweightedCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairISB_IiiEiEjEEEENS0_17DefaultCacheStoreIS6_EEEEJEESt10shared_ptrIT_EDpOT0_\n}\n{\n   <openfst>\n   Memcheck:Leak\n   match-leak-kinds: reachable\n   fun:_Znwm\n   fun:_ZN3fst27UnweightedAcceptorCompactorINS_6ArcTplINS_17TropicalWeightTplIfEEEEE4TypeB5cxx11Ev\n   fun:_ZZN3fst16DefaultCompactorINS_27UnweightedAcceptorCompactorINS_6ArcTplINS_17TropicalWeightTplIfEEEEEEjNS_19DefaultCompactStoreISt4pairIiiEjEEE4TypeB5cxx11EvENKUlvE_clEv\n   fun:_ZN3fst16DefaultCompactorINS_27UnweightedAcceptorCompactorINS_6ArcTplINS_17TropicalWeightTplIfEEEEEEjNS_19DefaultCompactStoreISt4pairIiiEjEEE4TypeB5cxx11Ev\n   fun:_ZN3fst8internal14CompactFstImplINS_6ArcTplINS_17TropicalWeightTplIfEEEENS_16DefaultCompactorINS_27UnweightedAcceptorCompactorIS5_EEjNS_19DefaultCompactStoreISt4pairIiiEjEEEENS_17DefaultCacheStoreIS5_EEEC1Ev\n   fun:_ZN9__gnu_cxx13new_allocatorIN3fst8internal14CompactFstImplINS1_6ArcTplINS1_17TropicalWeightTplIfEEEENS1_16DefaultCompactorINS1_27UnweightedAcceptorCompactorIS7_EEjNS1_19DefaultCompactStoreISt4pairIiiEjEEEENS1_17DefaultCacheStoreIS7_EEEEE9constructISI_JEEEvPT_DpOT0_\n   fun:_ZNSt16allocator_traitsISaIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_17TropicalWeightTplIfEEEENS0_16DefaultCompactorINS0_27UnweightedAcceptorCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairIiiEjEEEENS0_17DefaultCacheStoreIS6_EEEEEE9constructISH_JEEEvRSI_PT_DpOT0_\n   fun:_ZNSt23_Sp_counted_ptr_inplaceIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_17TropicalWeightTplIfEEEENS0_16DefaultCompactorINS0_27UnweightedAcceptorCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairIiiEjEEEENS0_17DefaultCacheStoreIS6_EEEESaISH_ELN9__gnu_cxx12_Lock_policyE2EEC1IJEEESI_DpOT_\n   fun:_ZNSt14__shared_countILN9__gnu_cxx12_Lock_policyE2EEC1IN3fst8internal14CompactFstImplINS4_6ArcTplINS4_17TropicalWeightTplIfEEEENS4_16DefaultCompactorINS4_27UnweightedAcceptorCompactorISA_EEjNS4_19DefaultCompactStoreISt4pairIiiEjEEEENS4_17DefaultCacheStoreISA_EEEESaISL_EJEEERPT_St20_Sp_alloc_shared_tagIT0_EDpOT1_\n   fun:_ZNSt12__shared_ptrIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_17TropicalWeightTplIfEEEENS0_16DefaultCompactorINS0_27UnweightedAcceptorCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairIiiEjEEEENS0_17DefaultCacheStoreIS6_EEEELN9__gnu_cxx12_Lock_policyE2EEC1ISaISH_EJEEESt20_Sp_alloc_shared_tagIT_EDpOT0_\n   fun:_ZNSt10shared_ptrIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_17TropicalWeightTplIfEEEENS0_16DefaultCompactorINS0_27UnweightedAcceptorCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairIiiEjEEEENS0_17DefaultCacheStoreIS6_EEEEEC1ISaISH_EJEEESt20_Sp_alloc_shared_tagIT_EDpOT0_\n   fun:_ZSt15allocate_sharedIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_17TropicalWeightTplIfEEEENS0_16DefaultCompactorINS0_27UnweightedAcceptorCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairIiiEjEEEENS0_17DefaultCacheStoreIS6_EEEESaISH_EJEESt10shared_ptrIT_ERKT0_DpOT1_\n}\n{\n   <openfst>\n   Memcheck:Leak\n   match-leak-kinds: reachable\n   fun:_Znwm\n   fun:_ZN3fst19DefaultCompactStoreISt4pairIiiEjE4TypeB5cxx11Ev\n   fun:_ZZN3fst16DefaultCompactorINS_27UnweightedAcceptorCompactorINS_6ArcTplINS_17TropicalWeightTplIfEEEEEEjNS_19DefaultCompactStoreISt4pairIiiEjEEE4TypeB5cxx11EvENKUlvE_clEv\n   fun:_ZN3fst16DefaultCompactorINS_27UnweightedAcceptorCompactorINS_6ArcTplINS_17TropicalWeightTplIfEEEEEEjNS_19DefaultCompactStoreISt4pairIiiEjEEE4TypeB5cxx11Ev\n   fun:_ZN3fst8internal14CompactFstImplINS_6ArcTplINS_17TropicalWeightTplIfEEEENS_16DefaultCompactorINS_27UnweightedAcceptorCompactorIS5_EEjNS_19DefaultCompactStoreISt4pairIiiEjEEEENS_17DefaultCacheStoreIS5_EEEC1Ev\n   fun:_ZN9__gnu_cxx13new_allocatorIN3fst8internal14CompactFstImplINS1_6ArcTplINS1_17TropicalWeightTplIfEEEENS1_16DefaultCompactorINS1_27UnweightedAcceptorCompactorIS7_EEjNS1_19DefaultCompactStoreISt4pairIiiEjEEEENS1_17DefaultCacheStoreIS7_EEEEE9constructISI_JEEEvPT_DpOT0_\n   fun:_ZNSt16allocator_traitsISaIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_17TropicalWeightTplIfEEEENS0_16DefaultCompactorINS0_27UnweightedAcceptorCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairIiiEjEEEENS0_17DefaultCacheStoreIS6_EEEEEE9constructISH_JEEEvRSI_PT_DpOT0_\n   fun:_ZNSt23_Sp_counted_ptr_inplaceIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_17TropicalWeightTplIfEEEENS0_16DefaultCompactorINS0_27UnweightedAcceptorCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairIiiEjEEEENS0_17DefaultCacheStoreIS6_EEEESaISH_ELN9__gnu_cxx12_Lock_policyE2EEC1IJEEESI_DpOT_\n   fun:_ZNSt14__shared_countILN9__gnu_cxx12_Lock_policyE2EEC1IN3fst8internal14CompactFstImplINS4_6ArcTplINS4_17TropicalWeightTplIfEEEENS4_16DefaultCompactorINS4_27UnweightedAcceptorCompactorISA_EEjNS4_19DefaultCompactStoreISt4pairIiiEjEEEENS4_17DefaultCacheStoreISA_EEEESaISL_EJEEERPT_St20_Sp_alloc_shared_tagIT0_EDpOT1_\n   fun:_ZNSt12__shared_ptrIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_17TropicalWeightTplIfEEEENS0_16DefaultCompactorINS0_27UnweightedAcceptorCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairIiiEjEEEENS0_17DefaultCacheStoreIS6_EEEELN9__gnu_cxx12_Lock_policyE2EEC1ISaISH_EJEEESt20_Sp_alloc_shared_tagIT_EDpOT0_\n   fun:_ZNSt10shared_ptrIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_17TropicalWeightTplIfEEEENS0_16DefaultCompactorINS0_27UnweightedAcceptorCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairIiiEjEEEENS0_17DefaultCacheStoreIS6_EEEEEC1ISaISH_EJEEESt20_Sp_alloc_shared_tagIT_EDpOT0_\n   fun:_ZSt15allocate_sharedIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_17TropicalWeightTplIfEEEENS0_16DefaultCompactorINS0_27UnweightedAcceptorCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairIiiEjEEEENS0_17DefaultCacheStoreIS6_EEEESaISH_EJEESt10shared_ptrIT_ERKT0_DpOT1_\n}\n{\n   <openfst>\n   Memcheck:Leak\n   match-leak-kinds: reachable\n   fun:_Znwm\n   fun:_ZZN3fst16DefaultCompactorINS_27UnweightedAcceptorCompactorINS_6ArcTplINS_17TropicalWeightTplIfEEEEEEjNS_19DefaultCompactStoreISt4pairIiiEjEEE4TypeB5cxx11EvENKUlvE_clEv\n   fun:_ZN3fst16DefaultCompactorINS_27UnweightedAcceptorCompactorINS_6ArcTplINS_17TropicalWeightTplIfEEEEEEjNS_19DefaultCompactStoreISt4pairIiiEjEEE4TypeB5cxx11Ev\n   fun:_ZN3fst8internal14CompactFstImplINS_6ArcTplINS_17TropicalWeightTplIfEEEENS_16DefaultCompactorINS_27UnweightedAcceptorCompactorIS5_EEjNS_19DefaultCompactStoreISt4pairIiiEjEEEENS_17DefaultCacheStoreIS5_EEEC1Ev\n   fun:_ZN9__gnu_cxx13new_allocatorIN3fst8internal14CompactFstImplINS1_6ArcTplINS1_17TropicalWeightTplIfEEEENS1_16DefaultCompactorINS1_27UnweightedAcceptorCompactorIS7_EEjNS1_19DefaultCompactStoreISt4pairIiiEjEEEENS1_17DefaultCacheStoreIS7_EEEEE9constructISI_JEEEvPT_DpOT0_\n   fun:_ZNSt16allocator_traitsISaIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_17TropicalWeightTplIfEEEENS0_16DefaultCompactorINS0_27UnweightedAcceptorCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairIiiEjEEEENS0_17DefaultCacheStoreIS6_EEEEEE9constructISH_JEEEvRSI_PT_DpOT0_\n   fun:_ZNSt23_Sp_counted_ptr_inplaceIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_17TropicalWeightTplIfEEEENS0_16DefaultCompactorINS0_27UnweightedAcceptorCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairIiiEjEEEENS0_17DefaultCacheStoreIS6_EEEESaISH_ELN9__gnu_cxx12_Lock_policyE2EEC1IJEEESI_DpOT_\n   fun:_ZNSt14__shared_countILN9__gnu_cxx12_Lock_policyE2EEC1IN3fst8internal14CompactFstImplINS4_6ArcTplINS4_17TropicalWeightTplIfEEEENS4_16DefaultCompactorINS4_27UnweightedAcceptorCompactorISA_EEjNS4_19DefaultCompactStoreISt4pairIiiEjEEEENS4_17DefaultCacheStoreISA_EEEESaISL_EJEEERPT_St20_Sp_alloc_shared_tagIT0_EDpOT1_\n   fun:_ZNSt12__shared_ptrIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_17TropicalWeightTplIfEEEENS0_16DefaultCompactorINS0_27UnweightedAcceptorCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairIiiEjEEEENS0_17DefaultCacheStoreIS6_EEEELN9__gnu_cxx12_Lock_policyE2EEC1ISaISH_EJEEESt20_Sp_alloc_shared_tagIT_EDpOT0_\n   fun:_ZNSt10shared_ptrIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_17TropicalWeightTplIfEEEENS0_16DefaultCompactorINS0_27UnweightedAcceptorCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairIiiEjEEEENS0_17DefaultCacheStoreIS6_EEEEEC1ISaISH_EJEEESt20_Sp_alloc_shared_tagIT_EDpOT0_\n   fun:_ZSt15allocate_sharedIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_17TropicalWeightTplIfEEEENS0_16DefaultCompactorINS0_27UnweightedAcceptorCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairIiiEjEEEENS0_17DefaultCacheStoreIS6_EEEESaISH_EJEESt10shared_ptrIT_ERKT0_DpOT1_\n   fun:_ZSt11make_sharedIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_17TropicalWeightTplIfEEEENS0_16DefaultCompactorINS0_27UnweightedAcceptorCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairIiiEjEEEENS0_17DefaultCacheStoreIS6_EEEEJEESt10shared_ptrIT_EDpOT0_\n}\n{\n   <openfst>\n   Memcheck:Leak\n   match-leak-kinds: reachable\n   fun:_Znwm\n   fun:_ZN3fst27UnweightedAcceptorCompactorINS_6ArcTplINS_12LogWeightTplIfEEEEE4TypeB5cxx11Ev\n   fun:_ZZN3fst16DefaultCompactorINS_27UnweightedAcceptorCompactorINS_6ArcTplINS_12LogWeightTplIfEEEEEEjNS_19DefaultCompactStoreISt4pairIiiEjEEE4TypeB5cxx11EvENKUlvE_clEv\n   fun:_ZN3fst16DefaultCompactorINS_27UnweightedAcceptorCompactorINS_6ArcTplINS_12LogWeightTplIfEEEEEEjNS_19DefaultCompactStoreISt4pairIiiEjEEE4TypeB5cxx11Ev\n   fun:_ZN3fst8internal14CompactFstImplINS_6ArcTplINS_12LogWeightTplIfEEEENS_16DefaultCompactorINS_27UnweightedAcceptorCompactorIS5_EEjNS_19DefaultCompactStoreISt4pairIiiEjEEEENS_17DefaultCacheStoreIS5_EEEC1Ev\n   fun:_ZN9__gnu_cxx13new_allocatorIN3fst8internal14CompactFstImplINS1_6ArcTplINS1_12LogWeightTplIfEEEENS1_16DefaultCompactorINS1_27UnweightedAcceptorCompactorIS7_EEjNS1_19DefaultCompactStoreISt4pairIiiEjEEEENS1_17DefaultCacheStoreIS7_EEEEE9constructISI_JEEEvPT_DpOT0_\n   fun:_ZNSt16allocator_traitsISaIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_12LogWeightTplIfEEEENS0_16DefaultCompactorINS0_27UnweightedAcceptorCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairIiiEjEEEENS0_17DefaultCacheStoreIS6_EEEEEE9constructISH_JEEEvRSI_PT_DpOT0_\n   fun:_ZNSt23_Sp_counted_ptr_inplaceIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_12LogWeightTplIfEEEENS0_16DefaultCompactorINS0_27UnweightedAcceptorCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairIiiEjEEEENS0_17DefaultCacheStoreIS6_EEEESaISH_ELN9__gnu_cxx12_Lock_policyE2EEC1IJEEESI_DpOT_\n   fun:_ZNSt14__shared_countILN9__gnu_cxx12_Lock_policyE2EEC1IN3fst8internal14CompactFstImplINS4_6ArcTplINS4_12LogWeightTplIfEEEENS4_16DefaultCompactorINS4_27UnweightedAcceptorCompactorISA_EEjNS4_19DefaultCompactStoreISt4pairIiiEjEEEENS4_17DefaultCacheStoreISA_EEEESaISL_EJEEERPT_St20_Sp_alloc_shared_tagIT0_EDpOT1_\n   fun:_ZNSt12__shared_ptrIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_12LogWeightTplIfEEEENS0_16DefaultCompactorINS0_27UnweightedAcceptorCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairIiiEjEEEENS0_17DefaultCacheStoreIS6_EEEELN9__gnu_cxx12_Lock_policyE2EEC1ISaISH_EJEEESt20_Sp_alloc_shared_tagIT_EDpOT0_\n   fun:_ZNSt10shared_ptrIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_12LogWeightTplIfEEEENS0_16DefaultCompactorINS0_27UnweightedAcceptorCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairIiiEjEEEENS0_17DefaultCacheStoreIS6_EEEEEC1ISaISH_EJEEESt20_Sp_alloc_shared_tagIT_EDpOT0_\n   fun:_ZSt15allocate_sharedIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_12LogWeightTplIfEEEENS0_16DefaultCompactorINS0_27UnweightedAcceptorCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairIiiEjEEEENS0_17DefaultCacheStoreIS6_EEEESaISH_EJEESt10shared_ptrIT_ERKT0_DpOT1_\n}\n{\n   <openfst>\n   Memcheck:Leak\n   match-leak-kinds: reachable\n   fun:_Znwm\n   fun:_ZZN3fst16DefaultCompactorINS_27UnweightedAcceptorCompactorINS_6ArcTplINS_12LogWeightTplIfEEEEEEjNS_19DefaultCompactStoreISt4pairIiiEjEEE4TypeB5cxx11EvENKUlvE_clEv\n   fun:_ZN3fst16DefaultCompactorINS_27UnweightedAcceptorCompactorINS_6ArcTplINS_12LogWeightTplIfEEEEEEjNS_19DefaultCompactStoreISt4pairIiiEjEEE4TypeB5cxx11Ev\n   fun:_ZN3fst8internal14CompactFstImplINS_6ArcTplINS_12LogWeightTplIfEEEENS_16DefaultCompactorINS_27UnweightedAcceptorCompactorIS5_EEjNS_19DefaultCompactStoreISt4pairIiiEjEEEENS_17DefaultCacheStoreIS5_EEEC1Ev\n   fun:_ZN9__gnu_cxx13new_allocatorIN3fst8internal14CompactFstImplINS1_6ArcTplINS1_12LogWeightTplIfEEEENS1_16DefaultCompactorINS1_27UnweightedAcceptorCompactorIS7_EEjNS1_19DefaultCompactStoreISt4pairIiiEjEEEENS1_17DefaultCacheStoreIS7_EEEEE9constructISI_JEEEvPT_DpOT0_\n   fun:_ZNSt16allocator_traitsISaIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_12LogWeightTplIfEEEENS0_16DefaultCompactorINS0_27UnweightedAcceptorCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairIiiEjEEEENS0_17DefaultCacheStoreIS6_EEEEEE9constructISH_JEEEvRSI_PT_DpOT0_\n   fun:_ZNSt23_Sp_counted_ptr_inplaceIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_12LogWeightTplIfEEEENS0_16DefaultCompactorINS0_27UnweightedAcceptorCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairIiiEjEEEENS0_17DefaultCacheStoreIS6_EEEESaISH_ELN9__gnu_cxx12_Lock_policyE2EEC1IJEEESI_DpOT_\n   fun:_ZNSt14__shared_countILN9__gnu_cxx12_Lock_policyE2EEC1IN3fst8internal14CompactFstImplINS4_6ArcTplINS4_12LogWeightTplIfEEEENS4_16DefaultCompactorINS4_27UnweightedAcceptorCompactorISA_EEjNS4_19DefaultCompactStoreISt4pairIiiEjEEEENS4_17DefaultCacheStoreISA_EEEESaISL_EJEEERPT_St20_Sp_alloc_shared_tagIT0_EDpOT1_\n   fun:_ZNSt12__shared_ptrIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_12LogWeightTplIfEEEENS0_16DefaultCompactorINS0_27UnweightedAcceptorCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairIiiEjEEEENS0_17DefaultCacheStoreIS6_EEEELN9__gnu_cxx12_Lock_policyE2EEC1ISaISH_EJEEESt20_Sp_alloc_shared_tagIT_EDpOT0_\n   fun:_ZNSt10shared_ptrIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_12LogWeightTplIfEEEENS0_16DefaultCompactorINS0_27UnweightedAcceptorCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairIiiEjEEEENS0_17DefaultCacheStoreIS6_EEEEEC1ISaISH_EJEEESt20_Sp_alloc_shared_tagIT_EDpOT0_\n   fun:_ZSt15allocate_sharedIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_12LogWeightTplIfEEEENS0_16DefaultCompactorINS0_27UnweightedAcceptorCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairIiiEjEEEENS0_17DefaultCacheStoreIS6_EEEESaISH_EJEESt10shared_ptrIT_ERKT0_DpOT1_\n   fun:_ZSt11make_sharedIN3fst8internal14CompactFstImplINS0_6ArcTplINS0_12LogWeightTplIfEEEENS0_16DefaultCompactorINS0_27UnweightedAcceptorCompactorIS6_EEjNS0_19DefaultCompactStoreISt4pairIiiEjEEEENS0_17DefaultCacheStoreIS6_EEEEJEESt10shared_ptrIT_EDpOT0_\n}\n{\n   <openfst>\n   Memcheck:Leak\n   match-leak-kinds: reachable\n   fun:_Znwm\n   fun:_ZN3fst6ArcTplINS_17TropicalWeightTplIfEEE4TypeB5cxx11Ev\n   fun:_ZN3fst8internal7FstImplINS_6ArcTplINS_17TropicalWeightTplIfEEEEE10ReadHeaderERSiRKNS_14FstReadOptionsEiPNS_9FstHeaderE\n   fun:_ZN3fst8internal12ConstFstImplINS_6ArcTplINS_17TropicalWeightTplIfEEEEjE4ReadERSiRKNS_14FstReadOptionsE\n   fun:_ZN3fst8ConstFstINS_6ArcTplINS_17TropicalWeightTplIfEEEEjE4ReadERSiRKNS_14FstReadOptionsE\n   fun:_ZN6Scorer9load_trieERSt14basic_ifstreamIcSt11char_traitsIcEERKNSt7__cxx1112basic_stringIcS2_SaIcEEE\n   fun:_ZN6Scorer7load_lmERKNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEE\n   fun:_ZN6Scorer4initERKNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEERK8Alphabet\n   fun:DS_EnableExternalScorer\n   fun:main\n}\n{\n   <openfst>\n   Memcheck:Leak\n   match-leak-kinds: reachable\n   fun:_Znwm\n   fun:_ZN3fst17TropicalWeightTplIfE4TypeB5cxx11Ev\n   fun:_ZN3fst6ArcTplINS_17TropicalWeightTplIfEEE4TypeB5cxx11Ev\n   fun:_ZN3fst8internal7FstImplINS_6ArcTplINS_17TropicalWeightTplIfEEEEE10ReadHeaderERSiRKNS_14FstReadOptionsEiPNS_9FstHeaderE\n   fun:_ZN3fst8internal12ConstFstImplINS_6ArcTplINS_17TropicalWeightTplIfEEEEjE4ReadERSiRKNS_14FstReadOptionsE\n   fun:_ZN3fst8ConstFstINS_6ArcTplINS_17TropicalWeightTplIfEEEEjE4ReadERSiRKNS_14FstReadOptionsE\n   fun:_ZN6Scorer9load_trieERSt14basic_ifstreamIcSt11char_traitsIcEERKNSt7__cxx1112basic_stringIcS2_SaIcEEE\n   fun:_ZN6Scorer7load_lmERKNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEE\n   fun:_ZN6Scorer4initERKNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEERK8Alphabet\n   fun:DS_EnableExternalScorer\n   fun:main\n}\n{\n   <openfst>\n   Memcheck:Leak\n   match-leak-kinds: reachable\n   fun:_Znwm\n   fun:_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEEN3fst16FstRegisterEntryINSA_6ArcTplINSA_17TropicalWeightTplIfEEEEEEEEE8allocateEmPKv\n   fun:_ZNSt16allocator_traitsISaISt13_Rb_tree_nodeISt4pairIKNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEEN3fst16FstRegisterEntryINS9_6ArcTplINS9_17TropicalWeightTplIfEEEEEEEEEE8allocateERSI_m\n   fun:_ZNSt8_Rb_treeINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEESt4pairIKS5_N3fst16FstRegisterEntryINS8_6ArcTplINS8_17TropicalWeightTplIfEEEEEEESt10_Select1stISF_ESt4lessIS5_ESaISF_EE11_M_get_nodeEv\n   fun:_ZNSt8_Rb_treeINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEESt4pairIKS5_N3fst16FstRegisterEntryINS8_6ArcTplINS8_17TropicalWeightTplIfEEEEEEESt10_Select1stISF_ESt4lessIS5_ESaISF_EE14_M_create_nodeIJS6_IS5_SE_EEEEPSt13_Rb_tree_nodeISF_EDpOT_\n   fun:_ZNSt8_Rb_treeINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEESt4pairIKS5_N3fst16FstRegisterEntryINS8_6ArcTplINS8_17TropicalWeightTplIfEEEEEEESt10_Select1stISF_ESt4lessIS5_ESaISF_EE17_M_emplace_uniqueIJS6_IS5_SE_EEEES6_ISt17_Rb_tree_iteratorISF_EbEDpOT_\n   fun:_ZNSt3mapINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEEN3fst16FstRegisterEntryINS6_6ArcTplINS6_17TropicalWeightTplIfEEEEEESt4lessIS5_ESaISt4pairIKS5_SC_EEE6insertISF_IS5_SC_EEENSt9enable_ifIXsrSt16is_constructibleISH_JT_EE5valueESF_ISt17_Rb_tree_iteratorISH_EbEE4typeEOSO_\n   fun:_ZN3fst15GenericRegisterINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEENS_16FstRegisterEntryINS_6ArcTplINS_17TropicalWeightTplIfEEEEEENS_11FstRegisterISB_EEE8SetEntryERKS6_RKSC_\n   fun:_ZN3fst17GenericRegistererINS_11FstRegisterINS_6ArcTplINS_17TropicalWeightTplIfEEEEEEEC1ENSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEENS_16FstRegisterEntryIS5_EE\n   fun:_ZN3fst13FstRegistererINS_9VectorFstINS_6ArcTplINS_17TropicalWeightTplIfEEEENS_11VectorStateIS5_SaIS5_EEEEEEC1Ev\n   fun:_Z41__static_initialization_and_destruction_0ii\n}\n{\n   <openfst>\n   Memcheck:Leak\n   match-leak-kinds: reachable\n   fun:_Znwm\n   fun:_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEEN3fst16FstRegisterEntryINSA_6ArcTplINSA_12LogWeightTplIfEEEEEEEEE8allocateEmPKv\n   fun:_ZNSt16allocator_traitsISaISt13_Rb_tree_nodeISt4pairIKNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEEN3fst16FstRegisterEntryINS9_6ArcTplINS9_12LogWeightTplIfEEEEEEEEEE8allocateERSI_m\n   fun:_ZNSt8_Rb_treeINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEESt4pairIKS5_N3fst16FstRegisterEntryINS8_6ArcTplINS8_12LogWeightTplIfEEEEEEESt10_Select1stISF_ESt4lessIS5_ESaISF_EE11_M_get_nodeEv\n   fun:_ZNSt8_Rb_treeINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEESt4pairIKS5_N3fst16FstRegisterEntryINS8_6ArcTplINS8_12LogWeightTplIfEEEEEEESt10_Select1stISF_ESt4lessIS5_ESaISF_EE14_M_create_nodeIJS6_IS5_SE_EEEEPSt13_Rb_tree_nodeISF_EDpOT_\n   fun:_ZNSt8_Rb_treeINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEESt4pairIKS5_N3fst16FstRegisterEntryINS8_6ArcTplINS8_12LogWeightTplIfEEEEEEESt10_Select1stISF_ESt4lessIS5_ESaISF_EE17_M_emplace_uniqueIJS6_IS5_SE_EEEES6_ISt17_Rb_tree_iteratorISF_EbEDpOT_\n   fun:_ZNSt3mapINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEEN3fst16FstRegisterEntryINS6_6ArcTplINS6_12LogWeightTplIfEEEEEESt4lessIS5_ESaISt4pairIKS5_SC_EEE6insertISF_IS5_SC_EEENSt9enable_ifIXsrSt16is_constructibleISH_JT_EE5valueESF_ISt17_Rb_tree_iteratorISH_EbEE4typeEOSO_\n   fun:_ZN3fst15GenericRegisterINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEENS_16FstRegisterEntryINS_6ArcTplINS_12LogWeightTplIfEEEEEENS_11FstRegisterISB_EEE8SetEntryERKS6_RKSC_\n   fun:_ZN3fst17GenericRegistererINS_11FstRegisterINS_6ArcTplINS_12LogWeightTplIfEEEEEEEC1ENSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEENS_16FstRegisterEntryIS5_EE\n   fun:_ZN3fst13FstRegistererINS_9VectorFstINS_6ArcTplINS_12LogWeightTplIfEEEENS_11VectorStateIS5_SaIS5_EEEEEEC1Ev\n   fun:_Z41__static_initialization_and_destruction_0ii\n}\n{\n   <openfst>\n   Memcheck:Leak\n   match-leak-kinds: reachable\n   fun:_Znwm\n   fun:_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEEN3fst16FstRegisterEntryINSA_6ArcTplINSA_12LogWeightTplIdEEEEEEEEE8allocateEmPKv\n   fun:_ZNSt16allocator_traitsISaISt13_Rb_tree_nodeISt4pairIKNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEEN3fst16FstRegisterEntryINS9_6ArcTplINS9_12LogWeightTplIdEEEEEEEEEE8allocateERSI_m\n   fun:_ZNSt8_Rb_treeINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEESt4pairIKS5_N3fst16FstRegisterEntryINS8_6ArcTplINS8_12LogWeightTplIdEEEEEEESt10_Select1stISF_ESt4lessIS5_ESaISF_EE11_M_get_nodeEv\n   fun:_ZNSt8_Rb_treeINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEESt4pairIKS5_N3fst16FstRegisterEntryINS8_6ArcTplINS8_12LogWeightTplIdEEEEEEESt10_Select1stISF_ESt4lessIS5_ESaISF_EE14_M_create_nodeIJS6_IS5_SE_EEEEPSt13_Rb_tree_nodeISF_EDpOT_\n   fun:_ZNSt8_Rb_treeINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEESt4pairIKS5_N3fst16FstRegisterEntryINS8_6ArcTplINS8_12LogWeightTplIdEEEEEEESt10_Select1stISF_ESt4lessIS5_ESaISF_EE17_M_emplace_uniqueIJS6_IS5_SE_EEEES6_ISt17_Rb_tree_iteratorISF_EbEDpOT_\n   fun:_ZNSt3mapINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEEN3fst16FstRegisterEntryINS6_6ArcTplINS6_12LogWeightTplIdEEEEEESt4lessIS5_ESaISt4pairIKS5_SC_EEE6insertISF_IS5_SC_EEENSt9enable_ifIXsrSt16is_constructibleISH_JT_EE5valueESF_ISt17_Rb_tree_iteratorISH_EbEE4typeEOSO_\n   fun:_ZN3fst15GenericRegisterINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEENS_16FstRegisterEntryINS_6ArcTplINS_12LogWeightTplIdEEEEEENS_11FstRegisterISB_EEE8SetEntryERKS6_RKSC_\n   fun:_ZN3fst17GenericRegistererINS_11FstRegisterINS_6ArcTplINS_12LogWeightTplIdEEEEEEEC1ENSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEENS_16FstRegisterEntryIS5_EE\n   fun:_ZN3fst13FstRegistererINS_9VectorFstINS_6ArcTplINS_12LogWeightTplIdEEEENS_11VectorStateIS5_SaIS5_EEEEEEC1Ev\n   fun:_Z41__static_initialization_and_destruction_0ii\n}\n{\n   <openfst>\n   Memcheck:Leak\n   match-leak-kinds: reachable\n   fun:_Znwm\n   fun:_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEEN3fst16FstRegisterEntryINSA_6ArcTplINSA_17TropicalWeightTplIfEEEEEEEEE8allocateEmPKv\n   fun:_ZNSt16allocator_traitsISaISt13_Rb_tree_nodeISt4pairIKNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEEN3fst16FstRegisterEntryINS9_6ArcTplINS9_17TropicalWeightTplIfEEEEEEEEEE8allocateERSI_m\n   fun:_ZNSt8_Rb_treeINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEESt4pairIKS5_N3fst16FstRegisterEntryINS8_6ArcTplINS8_17TropicalWeightTplIfEEEEEEESt10_Select1stISF_ESt4lessIS5_ESaISF_EE11_M_get_nodeEv\n   fun:_ZNSt8_Rb_treeINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEESt4pairIKS5_N3fst16FstRegisterEntryINS8_6ArcTplINS8_17TropicalWeightTplIfEEEEEEESt10_Select1stISF_ESt4lessIS5_ESaISF_EE14_M_create_nodeIJS6_IS5_SE_EEEEPSt13_Rb_tree_nodeISF_EDpOT_\n   fun:_ZNSt8_Rb_treeINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEESt4pairIKS5_N3fst16FstRegisterEntryINS8_6ArcTplINS8_17TropicalWeightTplIfEEEEEEESt10_Select1stISF_ESt4lessIS5_ESaISF_EE17_M_emplace_uniqueIJS6_IS5_SE_EEEES6_ISt17_Rb_tree_iteratorISF_EbEDpOT_\n   fun:_ZNSt3mapINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEEN3fst16FstRegisterEntryINS6_6ArcTplINS6_17TropicalWeightTplIfEEEEEESt4lessIS5_ESaISt4pairIKS5_SC_EEE6insertISF_IS5_SC_EEENSt9enable_ifIXsrSt16is_constructibleISH_JT_EE5valueESF_ISt17_Rb_tree_iteratorISH_EbEE4typeEOSO_\n   fun:_ZN3fst15GenericRegisterINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEENS_16FstRegisterEntryINS_6ArcTplINS_17TropicalWeightTplIfEEEEEENS_11FstRegisterISB_EEE8SetEntryERKS6_RKSC_\n   fun:_ZN3fst17GenericRegistererINS_11FstRegisterINS_6ArcTplINS_17TropicalWeightTplIfEEEEEEEC1ENSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEENS_16FstRegisterEntryIS5_EE\n   fun:_ZN3fst13FstRegistererINS_8ConstFstINS_6ArcTplINS_17TropicalWeightTplIfEEEEjEEEC1Ev\n   fun:_Z41__static_initialization_and_destruction_0ii\n}\n{\n   <openfst>\n   Memcheck:Leak\n   match-leak-kinds: reachable\n   fun:_Znwm\n   fun:_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEEN3fst16FstRegisterEntryINSA_6ArcTplINSA_12LogWeightTplIfEEEEEEEEE8allocateEmPKv\n   fun:_ZNSt16allocator_traitsISaISt13_Rb_tree_nodeISt4pairIKNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEEN3fst16FstRegisterEntryINS9_6ArcTplINS9_12LogWeightTplIfEEEEEEEEEE8allocateERSI_m\n   fun:_ZNSt8_Rb_treeINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEESt4pairIKS5_N3fst16FstRegisterEntryINS8_6ArcTplINS8_12LogWeightTplIfEEEEEEESt10_Select1stISF_ESt4lessIS5_ESaISF_EE11_M_get_nodeEv\n   fun:_ZNSt8_Rb_treeINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEESt4pairIKS5_N3fst16FstRegisterEntryINS8_6ArcTplINS8_12LogWeightTplIfEEEEEEESt10_Select1stISF_ESt4lessIS5_ESaISF_EE14_M_create_nodeIJS6_IS5_SE_EEEEPSt13_Rb_tree_nodeISF_EDpOT_\n   fun:_ZNSt8_Rb_treeINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEESt4pairIKS5_N3fst16FstRegisterEntryINS8_6ArcTplINS8_12LogWeightTplIfEEEEEEESt10_Select1stISF_ESt4lessIS5_ESaISF_EE17_M_emplace_uniqueIJS6_IS5_SE_EEEES6_ISt17_Rb_tree_iteratorISF_EbEDpOT_\n   fun:_ZNSt3mapINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEEN3fst16FstRegisterEntryINS6_6ArcTplINS6_12LogWeightTplIfEEEEEESt4lessIS5_ESaISt4pairIKS5_SC_EEE6insertISF_IS5_SC_EEENSt9enable_ifIXsrSt16is_constructibleISH_JT_EE5valueESF_ISt17_Rb_tree_iteratorISH_EbEE4typeEOSO_\n   fun:_ZN3fst15GenericRegisterINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEENS_16FstRegisterEntryINS_6ArcTplINS_12LogWeightTplIfEEEEEENS_11FstRegisterISB_EEE8SetEntryERKS6_RKSC_\n   fun:_ZN3fst17GenericRegistererINS_11FstRegisterINS_6ArcTplINS_12LogWeightTplIfEEEEEEEC1ENSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEENS_16FstRegisterEntryIS5_EE\n   fun:_ZN3fst13FstRegistererINS_8ConstFstINS_6ArcTplINS_12LogWeightTplIfEEEEjEEEC1Ev\n   fun:_Z41__static_initialization_and_destruction_0ii\n}\n{\n   <openfst>\n   Memcheck:Leak\n   match-leak-kinds: reachable\n   fun:_Znwm\n   fun:_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEEN3fst16FstRegisterEntryINSA_6ArcTplINSA_12LogWeightTplIdEEEEEEEEE8allocateEmPKv\n   fun:_ZNSt16allocator_traitsISaISt13_Rb_tree_nodeISt4pairIKNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEEN3fst16FstRegisterEntryINS9_6ArcTplINS9_12LogWeightTplIdEEEEEEEEEE8allocateERSI_m\n   fun:_ZNSt8_Rb_treeINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEESt4pairIKS5_N3fst16FstRegisterEntryINS8_6ArcTplINS8_12LogWeightTplIdEEEEEEESt10_Select1stISF_ESt4lessIS5_ESaISF_EE11_M_get_nodeEv\n   fun:_ZNSt8_Rb_treeINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEESt4pairIKS5_N3fst16FstRegisterEntryINS8_6ArcTplINS8_12LogWeightTplIdEEEEEEESt10_Select1stISF_ESt4lessIS5_ESaISF_EE14_M_create_nodeIJS6_IS5_SE_EEEEPSt13_Rb_tree_nodeISF_EDpOT_\n   fun:_ZNSt8_Rb_treeINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEESt4pairIKS5_N3fst16FstRegisterEntryINS8_6ArcTplINS8_12LogWeightTplIdEEEEEEESt10_Select1stISF_ESt4lessIS5_ESaISF_EE17_M_emplace_uniqueIJS6_IS5_SE_EEEES6_ISt17_Rb_tree_iteratorISF_EbEDpOT_\n   fun:_ZNSt3mapINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEEN3fst16FstRegisterEntryINS6_6ArcTplINS6_12LogWeightTplIdEEEEEESt4lessIS5_ESaISt4pairIKS5_SC_EEE6insertISF_IS5_SC_EEENSt9enable_ifIXsrSt16is_constructibleISH_JT_EE5valueESF_ISt17_Rb_tree_iteratorISH_EbEE4typeEOSO_\n   fun:_ZN3fst15GenericRegisterINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEENS_16FstRegisterEntryINS_6ArcTplINS_12LogWeightTplIdEEEEEENS_11FstRegisterISB_EEE8SetEntryERKS6_RKSC_\n   fun:_ZN3fst17GenericRegistererINS_11FstRegisterINS_6ArcTplINS_12LogWeightTplIdEEEEEEEC1ENSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEENS_16FstRegisterEntryIS5_EE\n   fun:_ZN3fst13FstRegistererINS_8ConstFstINS_6ArcTplINS_12LogWeightTplIdEEEEjEEEC1Ev\n   fun:_Z41__static_initialization_and_destruction_0ii\n}\n{\n   <openfst>\n   Memcheck:Leak\n   match-leak-kinds: reachable\n   fun:_Znwm\n   fun:_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEEN3fst16FstRegisterEntryINSA_6ArcTplINSA_17TropicalWeightTplIfEEEEEEEEE8allocateEmPKv\n   fun:_ZNSt16allocator_traitsISaISt13_Rb_tree_nodeISt4pairIKNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEEN3fst16FstRegisterEntryINS9_6ArcTplINS9_17TropicalWeightTplIfEEEEEEEEEE8allocateERSI_m\n   fun:_ZNSt8_Rb_treeINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEESt4pairIKS5_N3fst16FstRegisterEntryINS8_6ArcTplINS8_17TropicalWeightTplIfEEEEEEESt10_Select1stISF_ESt4lessIS5_ESaISF_EE11_M_get_nodeEv\n   fun:_ZNSt8_Rb_treeINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEESt4pairIKS5_N3fst16FstRegisterEntryINS8_6ArcTplINS8_17TropicalWeightTplIfEEEEEEESt10_Select1stISF_ESt4lessIS5_ESaISF_EE14_M_create_nodeIJS6_IS5_SE_EEEEPSt13_Rb_tree_nodeISF_EDpOT_\n   fun:_ZNSt8_Rb_treeINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEESt4pairIKS5_N3fst16FstRegisterEntryINS8_6ArcTplINS8_17TropicalWeightTplIfEEEEEEESt10_Select1stISF_ESt4lessIS5_ESaISF_EE17_M_emplace_uniqueIJS6_IS5_SE_EEEES6_ISt17_Rb_tree_iteratorISF_EbEDpOT_\n   fun:_ZNSt3mapINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEEN3fst16FstRegisterEntryINS6_6ArcTplINS6_17TropicalWeightTplIfEEEEEESt4lessIS5_ESaISt4pairIKS5_SC_EEE6insertISF_IS5_SC_EEENSt9enable_ifIXsrSt16is_constructibleISH_JT_EE5valueESF_ISt17_Rb_tree_iteratorISH_EbEE4typeEOSO_\n   fun:_ZN3fst15GenericRegisterINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEENS_16FstRegisterEntryINS_6ArcTplINS_17TropicalWeightTplIfEEEEEENS_11FstRegisterISB_EEE8SetEntryERKS6_RKSC_\n   fun:_ZN3fst17GenericRegistererINS_11FstRegisterINS_6ArcTplINS_17TropicalWeightTplIfEEEEEEEC1ENSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEENS_16FstRegisterEntryIS5_EE\n   fun:_ZN3fst13FstRegistererINS_7EditFstINS_6ArcTplINS_17TropicalWeightTplIfEEEENS_11ExpandedFstIS5_EENS_9VectorFstIS5_NS_11VectorStateIS5_SaIS5_EEEEEEEEC1Ev\n   fun:_Z41__static_initialization_and_destruction_0ii\n}\n{\n   <openfst>\n   Memcheck:Leak\n   match-leak-kinds: reachable\n   fun:_Znwm\n   fun:_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEEN3fst16FstRegisterEntryINSA_6ArcTplINSA_12LogWeightTplIfEEEEEEEEE8allocateEmPKv\n   fun:_ZNSt16allocator_traitsISaISt13_Rb_tree_nodeISt4pairIKNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEEN3fst16FstRegisterEntryINS9_6ArcTplINS9_12LogWeightTplIfEEEEEEEEEE8allocateERSI_m\n   fun:_ZNSt8_Rb_treeINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEESt4pairIKS5_N3fst16FstRegisterEntryINS8_6ArcTplINS8_12LogWeightTplIfEEEEEEESt10_Select1stISF_ESt4lessIS5_ESaISF_EE11_M_get_nodeEv\n   fun:_ZNSt8_Rb_treeINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEESt4pairIKS5_N3fst16FstRegisterEntryINS8_6ArcTplINS8_12LogWeightTplIfEEEEEEESt10_Select1stISF_ESt4lessIS5_ESaISF_EE14_M_create_nodeIJS6_IS5_SE_EEEEPSt13_Rb_tree_nodeISF_EDpOT_\n   fun:_ZNSt8_Rb_treeINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEESt4pairIKS5_N3fst16FstRegisterEntryINS8_6ArcTplINS8_12LogWeightTplIfEEEEEEESt10_Select1stISF_ESt4lessIS5_ESaISF_EE17_M_emplace_uniqueIJS6_IS5_SE_EEEES6_ISt17_Rb_tree_iteratorISF_EbEDpOT_\n   fun:_ZNSt3mapINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEEN3fst16FstRegisterEntryINS6_6ArcTplINS6_12LogWeightTplIfEEEEEESt4lessIS5_ESaISt4pairIKS5_SC_EEE6insertISF_IS5_SC_EEENSt9enable_ifIXsrSt16is_constructibleISH_JT_EE5valueESF_ISt17_Rb_tree_iteratorISH_EbEE4typeEOSO_\n   fun:_ZN3fst15GenericRegisterINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEENS_16FstRegisterEntryINS_6ArcTplINS_12LogWeightTplIfEEEEEENS_11FstRegisterISB_EEE8SetEntryERKS6_RKSC_\n   fun:_ZN3fst17GenericRegistererINS_11FstRegisterINS_6ArcTplINS_12LogWeightTplIfEEEEEEEC1ENSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEENS_16FstRegisterEntryIS5_EE\n   fun:_ZN3fst13FstRegistererINS_7EditFstINS_6ArcTplINS_12LogWeightTplIfEEEENS_11ExpandedFstIS5_EENS_9VectorFstIS5_NS_11VectorStateIS5_SaIS5_EEEEEEEEC1Ev\n   fun:_Z41__static_initialization_and_destruction_0ii\n}\n{\n   <openfst>\n   Memcheck:Leak\n   match-leak-kinds: reachable\n   fun:_Znwm\n   fun:_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEEN3fst16FstRegisterEntryINSA_6ArcTplINSA_12LogWeightTplIdEEEEEEEEE8allocateEmPKv\n   fun:_ZNSt16allocator_traitsISaISt13_Rb_tree_nodeISt4pairIKNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEEN3fst16FstRegisterEntryINS9_6ArcTplINS9_12LogWeightTplIdEEEEEEEEEE8allocateERSI_m\n   fun:_ZNSt8_Rb_treeINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEESt4pairIKS5_N3fst16FstRegisterEntryINS8_6ArcTplINS8_12LogWeightTplIdEEEEEEESt10_Select1stISF_ESt4lessIS5_ESaISF_EE11_M_get_nodeEv\n   fun:_ZNSt8_Rb_treeINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEESt4pairIKS5_N3fst16FstRegisterEntryINS8_6ArcTplINS8_12LogWeightTplIdEEEEEEESt10_Select1stISF_ESt4lessIS5_ESaISF_EE14_M_create_nodeIJS6_IS5_SE_EEEEPSt13_Rb_tree_nodeISF_EDpOT_\n   fun:_ZNSt8_Rb_treeINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEESt4pairIKS5_N3fst16FstRegisterEntryINS8_6ArcTplINS8_12LogWeightTplIdEEEEEEESt10_Select1stISF_ESt4lessIS5_ESaISF_EE17_M_emplace_uniqueIJS6_IS5_SE_EEEES6_ISt17_Rb_tree_iteratorISF_EbEDpOT_\n   fun:_ZNSt3mapINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEEN3fst16FstRegisterEntryINS6_6ArcTplINS6_12LogWeightTplIdEEEEEESt4lessIS5_ESaISt4pairIKS5_SC_EEE6insertISF_IS5_SC_EEENSt9enable_ifIXsrSt16is_constructibleISH_JT_EE5valueESF_ISt17_Rb_tree_iteratorISH_EbEE4typeEOSO_\n   fun:_ZN3fst15GenericRegisterINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEENS_16FstRegisterEntryINS_6ArcTplINS_12LogWeightTplIdEEEEEENS_11FstRegisterISB_EEE8SetEntryERKS6_RKSC_\n   fun:_ZN3fst17GenericRegistererINS_11FstRegisterINS_6ArcTplINS_12LogWeightTplIdEEEEEEEC1ENSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEENS_16FstRegisterEntryIS5_EE\n   fun:_ZN3fst13FstRegistererINS_7EditFstINS_6ArcTplINS_12LogWeightTplIdEEEENS_11ExpandedFstIS5_EENS_9VectorFstIS5_NS_11VectorStateIS5_SaIS5_EEEEEEEEC1Ev\n   fun:_Z41__static_initialization_and_destruction_0ii\n}\n{\n   <openfst>\n   Memcheck:Leak\n   match-leak-kinds: reachable\n   fun:_Znwm\n   fun:_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEEN3fst16FstRegisterEntryINSA_6ArcTplINSA_17TropicalWeightTplIfEEEEEEEEE8allocateEmPKv\n   fun:_ZNSt16allocator_traitsISaISt13_Rb_tree_nodeISt4pairIKNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEEN3fst16FstRegisterEntryINS9_6ArcTplINS9_17TropicalWeightTplIfEEEEEEEEEE8allocateERSI_m\n   fun:_ZNSt8_Rb_treeINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEESt4pairIKS5_N3fst16FstRegisterEntryINS8_6ArcTplINS8_17TropicalWeightTplIfEEEEEEESt10_Select1stISF_ESt4lessIS5_ESaISF_EE11_M_get_nodeEv\n   fun:_ZNSt8_Rb_treeINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEESt4pairIKS5_N3fst16FstRegisterEntryINS8_6ArcTplINS8_17TropicalWeightTplIfEEEEEEESt10_Select1stISF_ESt4lessIS5_ESaISF_EE14_M_create_nodeIJS6_IS5_SE_EEEEPSt13_Rb_tree_nodeISF_EDpOT_\n   fun:_ZNSt8_Rb_treeINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEESt4pairIKS5_N3fst16FstRegisterEntryINS8_6ArcTplINS8_17TropicalWeightTplIfEEEEEEESt10_Select1stISF_ESt4lessIS5_ESaISF_EE17_M_emplace_uniqueIJS6_IS5_SE_EEEES6_ISt17_Rb_tree_iteratorISF_EbEDpOT_\n   fun:_ZNSt3mapINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEEN3fst16FstRegisterEntryINS6_6ArcTplINS6_17TropicalWeightTplIfEEEEEESt4lessIS5_ESaISt4pairIKS5_SC_EEE6insertISF_IS5_SC_EEENSt9enable_ifIXsrSt16is_constructibleISH_JT_EE5valueESF_ISt17_Rb_tree_iteratorISH_EbEE4typeEOSO_\n   fun:_ZN3fst15GenericRegisterINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEENS_16FstRegisterEntryINS_6ArcTplINS_17TropicalWeightTplIfEEEEEENS_11FstRegisterISB_EEE8SetEntryERKS6_RKSC_\n   fun:_ZN3fst17GenericRegistererINS_11FstRegisterINS_6ArcTplINS_17TropicalWeightTplIfEEEEEEEC1ENSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEENS_16FstRegisterEntryIS5_EE\n   fun:_ZN3fst13FstRegistererINS_10CompactFstINS_6ArcTplINS_17TropicalWeightTplIfEEEENS_15StringCompactorIS5_EEjNS_19DefaultCompactStoreIijEENS_17DefaultCacheStoreIS5_EEEEEC1Ev\n   fun:_Z41__static_initialization_and_destruction_0ii\n}\n{\n   <openfst>\n   Memcheck:Leak\n   match-leak-kinds: reachable\n   fun:_Znwm\n   fun:_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEEN3fst16FstRegisterEntryINSA_6ArcTplINSA_12LogWeightTplIfEEEEEEEEE8allocateEmPKv\n   fun:_ZNSt16allocator_traitsISaISt13_Rb_tree_nodeISt4pairIKNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEEN3fst16FstRegisterEntryINS9_6ArcTplINS9_12LogWeightTplIfEEEEEEEEEE8allocateERSI_m\n   fun:_ZNSt8_Rb_treeINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEESt4pairIKS5_N3fst16FstRegisterEntryINS8_6ArcTplINS8_12LogWeightTplIfEEEEEEESt10_Select1stISF_ESt4lessIS5_ESaISF_EE11_M_get_nodeEv\n   fun:_ZNSt8_Rb_treeINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEESt4pairIKS5_N3fst16FstRegisterEntryINS8_6ArcTplINS8_12LogWeightTplIfEEEEEEESt10_Select1stISF_ESt4lessIS5_ESaISF_EE14_M_create_nodeIJS6_IS5_SE_EEEEPSt13_Rb_tree_nodeISF_EDpOT_\n   fun:_ZNSt8_Rb_treeINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEESt4pairIKS5_N3fst16FstRegisterEntryINS8_6ArcTplINS8_12LogWeightTplIfEEEEEEESt10_Select1stISF_ESt4lessIS5_ESaISF_EE17_M_emplace_uniqueIJS6_IS5_SE_EEEES6_ISt17_Rb_tree_iteratorISF_EbEDpOT_\n   fun:_ZNSt3mapINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEEN3fst16FstRegisterEntryINS6_6ArcTplINS6_12LogWeightTplIfEEEEEESt4lessIS5_ESaISt4pairIKS5_SC_EEE6insertISF_IS5_SC_EEENSt9enable_ifIXsrSt16is_constructibleISH_JT_EE5valueESF_ISt17_Rb_tree_iteratorISH_EbEE4typeEOSO_\n   fun:_ZN3fst15GenericRegisterINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEENS_16FstRegisterEntryINS_6ArcTplINS_12LogWeightTplIfEEEEEENS_11FstRegisterISB_EEE8SetEntryERKS6_RKSC_\n   fun:_ZN3fst17GenericRegistererINS_11FstRegisterINS_6ArcTplINS_12LogWeightTplIfEEEEEEEC1ENSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEENS_16FstRegisterEntryIS5_EE\n   fun:_ZN3fst13FstRegistererINS_10CompactFstINS_6ArcTplINS_12LogWeightTplIfEEEENS_15StringCompactorIS5_EEjNS_19DefaultCompactStoreIijEENS_17DefaultCacheStoreIS5_EEEEEC1Ev\n   fun:_Z41__static_initialization_and_destruction_0ii\n}\n{\n   <openfst>\n   Memcheck:Leak\n   match-leak-kinds: reachable\n   fun:_Znwm\n   fun:_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEEN3fst16FstRegisterEntryINSA_6ArcTplINSA_17TropicalWeightTplIfEEEEEEEEE8allocateEmPKv\n   fun:_ZNSt16allocator_traitsISaISt13_Rb_tree_nodeISt4pairIKNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEEN3fst16FstRegisterEntryINS9_6ArcTplINS9_17TropicalWeightTplIfEEEEEEEEEE8allocateERSI_m\n   fun:_ZNSt8_Rb_treeINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEESt4pairIKS5_N3fst16FstRegisterEntryINS8_6ArcTplINS8_17TropicalWeightTplIfEEEEEEESt10_Select1stISF_ESt4lessIS5_ESaISF_EE11_M_get_nodeEv\n   fun:_ZNSt8_Rb_treeINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEESt4pairIKS5_N3fst16FstRegisterEntryINS8_6ArcTplINS8_17TropicalWeightTplIfEEEEEEESt10_Select1stISF_ESt4lessIS5_ESaISF_EE14_M_create_nodeIJS6_IS5_SE_EEEEPSt13_Rb_tree_nodeISF_EDpOT_\n   fun:_ZNSt8_Rb_treeINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEESt4pairIKS5_N3fst16FstRegisterEntryINS8_6ArcTplINS8_17TropicalWeightTplIfEEEEEEESt10_Select1stISF_ESt4lessIS5_ESaISF_EE17_M_emplace_uniqueIJS6_IS5_SE_EEEES6_ISt17_Rb_tree_iteratorISF_EbEDpOT_\n   fun:_ZNSt3mapINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEEN3fst16FstRegisterEntryINS6_6ArcTplINS6_17TropicalWeightTplIfEEEEEESt4lessIS5_ESaISt4pairIKS5_SC_EEE6insertISF_IS5_SC_EEENSt9enable_ifIXsrSt16is_constructibleISH_JT_EE5valueESF_ISt17_Rb_tree_iteratorISH_EbEE4typeEOSO_\n   fun:_ZN3fst15GenericRegisterINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEENS_16FstRegisterEntryINS_6ArcTplINS_17TropicalWeightTplIfEEEEEENS_11FstRegisterISB_EEE8SetEntryERKS6_RKSC_\n   fun:_ZN3fst17GenericRegistererINS_11FstRegisterINS_6ArcTplINS_17TropicalWeightTplIfEEEEEEEC1ENSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEENS_16FstRegisterEntryIS5_EE\n   fun:_ZN3fst13FstRegistererINS_10CompactFstINS_6ArcTplINS_17TropicalWeightTplIfEEEENS_23WeightedStringCompactorIS5_EEjNS_19DefaultCompactStoreISt4pairIiS4_EjEENS_17DefaultCacheStoreIS5_EEEEEC1Ev\n   fun:_Z41__static_initialization_and_destruction_0ii\n}\n{\n   <openfst>\n   Memcheck:Leak\n   match-leak-kinds: reachable\n   fun:_Znwm\n   fun:_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEEN3fst16FstRegisterEntryINSA_6ArcTplINSA_12LogWeightTplIfEEEEEEEEE8allocateEmPKv\n   fun:_ZNSt16allocator_traitsISaISt13_Rb_tree_nodeISt4pairIKNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEEN3fst16FstRegisterEntryINS9_6ArcTplINS9_12LogWeightTplIfEEEEEEEEEE8allocateERSI_m\n   fun:_ZNSt8_Rb_treeINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEESt4pairIKS5_N3fst16FstRegisterEntryINS8_6ArcTplINS8_12LogWeightTplIfEEEEEEESt10_Select1stISF_ESt4lessIS5_ESaISF_EE11_M_get_nodeEv\n   fun:_ZNSt8_Rb_treeINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEESt4pairIKS5_N3fst16FstRegisterEntryINS8_6ArcTplINS8_12LogWeightTplIfEEEEEEESt10_Select1stISF_ESt4lessIS5_ESaISF_EE14_M_create_nodeIJS6_IS5_SE_EEEEPSt13_Rb_tree_nodeISF_EDpOT_\n   fun:_ZNSt8_Rb_treeINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEESt4pairIKS5_N3fst16FstRegisterEntryINS8_6ArcTplINS8_12LogWeightTplIfEEEEEEESt10_Select1stISF_ESt4lessIS5_ESaISF_EE17_M_emplace_uniqueIJS6_IS5_SE_EEEES6_ISt17_Rb_tree_iteratorISF_EbEDpOT_\n   fun:_ZNSt3mapINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEEN3fst16FstRegisterEntryINS6_6ArcTplINS6_12LogWeightTplIfEEEEEESt4lessIS5_ESaISt4pairIKS5_SC_EEE6insertISF_IS5_SC_EEENSt9enable_ifIXsrSt16is_constructibleISH_JT_EE5valueESF_ISt17_Rb_tree_iteratorISH_EbEE4typeEOSO_\n   fun:_ZN3fst15GenericRegisterINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEENS_16FstRegisterEntryINS_6ArcTplINS_12LogWeightTplIfEEEEEENS_11FstRegisterISB_EEE8SetEntryERKS6_RKSC_\n   fun:_ZN3fst17GenericRegistererINS_11FstRegisterINS_6ArcTplINS_12LogWeightTplIfEEEEEEEC1ENSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEENS_16FstRegisterEntryIS5_EE\n   fun:_ZN3fst13FstRegistererINS_10CompactFstINS_6ArcTplINS_12LogWeightTplIfEEEENS_23WeightedStringCompactorIS5_EEjNS_19DefaultCompactStoreISt4pairIiS4_EjEENS_17DefaultCacheStoreIS5_EEEEEC1Ev\n   fun:_Z41__static_initialization_and_destruction_0ii\n}\n{\n   <openfst>\n   Memcheck:Leak\n   match-leak-kinds: reachable\n   fun:_Znwm\n   fun:_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEEN3fst16FstRegisterEntryINSA_6ArcTplINSA_17TropicalWeightTplIfEEEEEEEEE8allocateEmPKv\n   fun:_ZNSt16allocator_traitsISaISt13_Rb_tree_nodeISt4pairIKNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEEN3fst16FstRegisterEntryINS9_6ArcTplINS9_17TropicalWeightTplIfEEEEEEEEEE8allocateERSI_m\n   fun:_ZNSt8_Rb_treeINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEESt4pairIKS5_N3fst16FstRegisterEntryINS8_6ArcTplINS8_17TropicalWeightTplIfEEEEEEESt10_Select1stISF_ESt4lessIS5_ESaISF_EE11_M_get_nodeEv\n   fun:_ZNSt8_Rb_treeINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEESt4pairIKS5_N3fst16FstRegisterEntryINS8_6ArcTplINS8_17TropicalWeightTplIfEEEEEEESt10_Select1stISF_ESt4lessIS5_ESaISF_EE14_M_create_nodeIJS6_IS5_SE_EEEEPSt13_Rb_tree_nodeISF_EDpOT_\n   fun:_ZNSt8_Rb_treeINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEESt4pairIKS5_N3fst16FstRegisterEntryINS8_6ArcTplINS8_17TropicalWeightTplIfEEEEEEESt10_Select1stISF_ESt4lessIS5_ESaISF_EE17_M_emplace_uniqueIJS6_IS5_SE_EEEES6_ISt17_Rb_tree_iteratorISF_EbEDpOT_\n   fun:_ZNSt3mapINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEEN3fst16FstRegisterEntryINS6_6ArcTplINS6_17TropicalWeightTplIfEEEEEESt4lessIS5_ESaISt4pairIKS5_SC_EEE6insertISF_IS5_SC_EEENSt9enable_ifIXsrSt16is_constructibleISH_JT_EE5valueESF_ISt17_Rb_tree_iteratorISH_EbEE4typeEOSO_\n   fun:_ZN3fst15GenericRegisterINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEENS_16FstRegisterEntryINS_6ArcTplINS_17TropicalWeightTplIfEEEEEENS_11FstRegisterISB_EEE8SetEntryERKS6_RKSC_\n   fun:_ZN3fst17GenericRegistererINS_11FstRegisterINS_6ArcTplINS_17TropicalWeightTplIfEEEEEEEC1ENSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEENS_16FstRegisterEntryIS5_EE\n   fun:_ZN3fst13FstRegistererINS_10CompactFstINS_6ArcTplINS_17TropicalWeightTplIfEEEENS_17AcceptorCompactorIS5_EEjNS_19DefaultCompactStoreISt4pairIS9_IiS4_EiEjEENS_17DefaultCacheStoreIS5_EEEEEC1Ev\n   fun:_Z41__static_initialization_and_destruction_0ii\n}\n{\n   <openfst>\n   Memcheck:Leak\n   match-leak-kinds: reachable\n   fun:_Znwm\n   fun:_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEEN3fst16FstRegisterEntryINSA_6ArcTplINSA_12LogWeightTplIfEEEEEEEEE8allocateEmPKv\n   fun:_ZNSt16allocator_traitsISaISt13_Rb_tree_nodeISt4pairIKNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEEN3fst16FstRegisterEntryINS9_6ArcTplINS9_12LogWeightTplIfEEEEEEEEEE8allocateERSI_m\n   fun:_ZNSt8_Rb_treeINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEESt4pairIKS5_N3fst16FstRegisterEntryINS8_6ArcTplINS8_12LogWeightTplIfEEEEEEESt10_Select1stISF_ESt4lessIS5_ESaISF_EE11_M_get_nodeEv\n   fun:_ZNSt8_Rb_treeINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEESt4pairIKS5_N3fst16FstRegisterEntryINS8_6ArcTplINS8_12LogWeightTplIfEEEEEEESt10_Select1stISF_ESt4lessIS5_ESaISF_EE14_M_create_nodeIJS6_IS5_SE_EEEEPSt13_Rb_tree_nodeISF_EDpOT_\n   fun:_ZNSt8_Rb_treeINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEESt4pairIKS5_N3fst16FstRegisterEntryINS8_6ArcTplINS8_12LogWeightTplIfEEEEEEESt10_Select1stISF_ESt4lessIS5_ESaISF_EE17_M_emplace_uniqueIJS6_IS5_SE_EEEES6_ISt17_Rb_tree_iteratorISF_EbEDpOT_\n   fun:_ZNSt3mapINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEEN3fst16FstRegisterEntryINS6_6ArcTplINS6_12LogWeightTplIfEEEEEESt4lessIS5_ESaISt4pairIKS5_SC_EEE6insertISF_IS5_SC_EEENSt9enable_ifIXsrSt16is_constructibleISH_JT_EE5valueESF_ISt17_Rb_tree_iteratorISH_EbEE4typeEOSO_\n   fun:_ZN3fst15GenericRegisterINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEENS_16FstRegisterEntryINS_6ArcTplINS_12LogWeightTplIfEEEEEENS_11FstRegisterISB_EEE8SetEntryERKS6_RKSC_\n   fun:_ZN3fst17GenericRegistererINS_11FstRegisterINS_6ArcTplINS_12LogWeightTplIfEEEEEEEC1ENSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEENS_16FstRegisterEntryIS5_EE\n   fun:_ZN3fst13FstRegistererINS_10CompactFstINS_6ArcTplINS_12LogWeightTplIfEEEENS_17AcceptorCompactorIS5_EEjNS_19DefaultCompactStoreISt4pairIS9_IiS4_EiEjEENS_17DefaultCacheStoreIS5_EEEEEC1Ev\n   fun:_Z41__static_initialization_and_destruction_0ii\n}\n{\n   <openfst>\n   Memcheck:Leak\n   match-leak-kinds: reachable\n   fun:_Znwm\n   fun:_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEEN3fst16FstRegisterEntryINSA_6ArcTplINSA_17TropicalWeightTplIfEEEEEEEEE8allocateEmPKv\n   fun:_ZNSt16allocator_traitsISaISt13_Rb_tree_nodeISt4pairIKNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEEN3fst16FstRegisterEntryINS9_6ArcTplINS9_17TropicalWeightTplIfEEEEEEEEEE8allocateERSI_m\n   fun:_ZNSt8_Rb_treeINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEESt4pairIKS5_N3fst16FstRegisterEntryINS8_6ArcTplINS8_17TropicalWeightTplIfEEEEEEESt10_Select1stISF_ESt4lessIS5_ESaISF_EE11_M_get_nodeEv\n   fun:_ZNSt8_Rb_treeINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEESt4pairIKS5_N3fst16FstRegisterEntryINS8_6ArcTplINS8_17TropicalWeightTplIfEEEEEEESt10_Select1stISF_ESt4lessIS5_ESaISF_EE14_M_create_nodeIJS6_IS5_SE_EEEEPSt13_Rb_tree_nodeISF_EDpOT_\n   fun:_ZNSt8_Rb_treeINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEESt4pairIKS5_N3fst16FstRegisterEntryINS8_6ArcTplINS8_17TropicalWeightTplIfEEEEEEESt10_Select1stISF_ESt4lessIS5_ESaISF_EE17_M_emplace_uniqueIJS6_IS5_SE_EEEES6_ISt17_Rb_tree_iteratorISF_EbEDpOT_\n   fun:_ZNSt3mapINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEEN3fst16FstRegisterEntryINS6_6ArcTplINS6_17TropicalWeightTplIfEEEEEESt4lessIS5_ESaISt4pairIKS5_SC_EEE6insertISF_IS5_SC_EEENSt9enable_ifIXsrSt16is_constructibleISH_JT_EE5valueESF_ISt17_Rb_tree_iteratorISH_EbEE4typeEOSO_\n   fun:_ZN3fst15GenericRegisterINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEENS_16FstRegisterEntryINS_6ArcTplINS_17TropicalWeightTplIfEEEEEENS_11FstRegisterISB_EEE8SetEntryERKS6_RKSC_\n   fun:_ZN3fst17GenericRegistererINS_11FstRegisterINS_6ArcTplINS_17TropicalWeightTplIfEEEEEEEC1ENSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEENS_16FstRegisterEntryIS5_EE\n   fun:_ZN3fst13FstRegistererINS_10CompactFstINS_6ArcTplINS_17TropicalWeightTplIfEEEENS_19UnweightedCompactorIS5_EEjNS_19DefaultCompactStoreISt4pairIS9_IiiEiEjEENS_17DefaultCacheStoreIS5_EEEEEC1Ev\n   fun:_Z41__static_initialization_and_destruction_0ii\n}\n{\n   <openfst>\n   Memcheck:Leak\n   match-leak-kinds: reachable\n   fun:_Znwm\n   fun:_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEEN3fst16FstRegisterEntryINSA_6ArcTplINSA_12LogWeightTplIfEEEEEEEEE8allocateEmPKv\n   fun:_ZNSt16allocator_traitsISaISt13_Rb_tree_nodeISt4pairIKNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEEN3fst16FstRegisterEntryINS9_6ArcTplINS9_12LogWeightTplIfEEEEEEEEEE8allocateERSI_m\n   fun:_ZNSt8_Rb_treeINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEESt4pairIKS5_N3fst16FstRegisterEntryINS8_6ArcTplINS8_12LogWeightTplIfEEEEEEESt10_Select1stISF_ESt4lessIS5_ESaISF_EE11_M_get_nodeEv\n   fun:_ZNSt8_Rb_treeINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEESt4pairIKS5_N3fst16FstRegisterEntryINS8_6ArcTplINS8_12LogWeightTplIfEEEEEEESt10_Select1stISF_ESt4lessIS5_ESaISF_EE14_M_create_nodeIJS6_IS5_SE_EEEEPSt13_Rb_tree_nodeISF_EDpOT_\n   fun:_ZNSt8_Rb_treeINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEESt4pairIKS5_N3fst16FstRegisterEntryINS8_6ArcTplINS8_12LogWeightTplIfEEEEEEESt10_Select1stISF_ESt4lessIS5_ESaISF_EE17_M_emplace_uniqueIJS6_IS5_SE_EEEES6_ISt17_Rb_tree_iteratorISF_EbEDpOT_\n   fun:_ZNSt3mapINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEEN3fst16FstRegisterEntryINS6_6ArcTplINS6_12LogWeightTplIfEEEEEESt4lessIS5_ESaISt4pairIKS5_SC_EEE6insertISF_IS5_SC_EEENSt9enable_ifIXsrSt16is_constructibleISH_JT_EE5valueESF_ISt17_Rb_tree_iteratorISH_EbEE4typeEOSO_\n   fun:_ZN3fst15GenericRegisterINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEENS_16FstRegisterEntryINS_6ArcTplINS_12LogWeightTplIfEEEEEENS_11FstRegisterISB_EEE8SetEntryERKS6_RKSC_\n   fun:_ZN3fst17GenericRegistererINS_11FstRegisterINS_6ArcTplINS_12LogWeightTplIfEEEEEEEC1ENSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEENS_16FstRegisterEntryIS5_EE\n   fun:_ZN3fst13FstRegistererINS_10CompactFstINS_6ArcTplINS_12LogWeightTplIfEEEENS_19UnweightedCompactorIS5_EEjNS_19DefaultCompactStoreISt4pairIS9_IiiEiEjEENS_17DefaultCacheStoreIS5_EEEEEC1Ev\n   fun:_Z41__static_initialization_and_destruction_0ii\n}\n{\n   <openfst>\n   Memcheck:Leak\n   match-leak-kinds: reachable\n   fun:_Znwm\n   fun:_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEEN3fst16FstRegisterEntryINSA_6ArcTplINSA_17TropicalWeightTplIfEEEEEEEEE8allocateEmPKv\n   fun:_ZNSt16allocator_traitsISaISt13_Rb_tree_nodeISt4pairIKNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEEN3fst16FstRegisterEntryINS9_6ArcTplINS9_17TropicalWeightTplIfEEEEEEEEEE8allocateERSI_m\n   fun:_ZNSt8_Rb_treeINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEESt4pairIKS5_N3fst16FstRegisterEntryINS8_6ArcTplINS8_17TropicalWeightTplIfEEEEEEESt10_Select1stISF_ESt4lessIS5_ESaISF_EE11_M_get_nodeEv\n   fun:_ZNSt8_Rb_treeINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEESt4pairIKS5_N3fst16FstRegisterEntryINS8_6ArcTplINS8_17TropicalWeightTplIfEEEEEEESt10_Select1stISF_ESt4lessIS5_ESaISF_EE14_M_create_nodeIJS6_IS5_SE_EEEEPSt13_Rb_tree_nodeISF_EDpOT_\n   fun:_ZNSt8_Rb_treeINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEESt4pairIKS5_N3fst16FstRegisterEntryINS8_6ArcTplINS8_17TropicalWeightTplIfEEEEEEESt10_Select1stISF_ESt4lessIS5_ESaISF_EE17_M_emplace_uniqueIJS6_IS5_SE_EEEES6_ISt17_Rb_tree_iteratorISF_EbEDpOT_\n   fun:_ZNSt3mapINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEEN3fst16FstRegisterEntryINS6_6ArcTplINS6_17TropicalWeightTplIfEEEEEESt4lessIS5_ESaISt4pairIKS5_SC_EEE6insertISF_IS5_SC_EEENSt9enable_ifIXsrSt16is_constructibleISH_JT_EE5valueESF_ISt17_Rb_tree_iteratorISH_EbEE4typeEOSO_\n   fun:_ZN3fst15GenericRegisterINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEENS_16FstRegisterEntryINS_6ArcTplINS_17TropicalWeightTplIfEEEEEENS_11FstRegisterISB_EEE8SetEntryERKS6_RKSC_\n   fun:_ZN3fst17GenericRegistererINS_11FstRegisterINS_6ArcTplINS_17TropicalWeightTplIfEEEEEEEC1ENSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEENS_16FstRegisterEntryIS5_EE\n   fun:_ZN3fst13FstRegistererINS_10CompactFstINS_6ArcTplINS_17TropicalWeightTplIfEEEENS_27UnweightedAcceptorCompactorIS5_EEjNS_19DefaultCompactStoreISt4pairIiiEjEENS_17DefaultCacheStoreIS5_EEEEEC1Ev\n   fun:_Z41__static_initialization_and_destruction_0ii\n}\n{\n   <openfst>\n   Memcheck:Leak\n   match-leak-kinds: reachable\n   fun:_Znwm\n   fun:_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEEN3fst16FstRegisterEntryINSA_6ArcTplINSA_12LogWeightTplIfEEEEEEEEE8allocateEmPKv\n   fun:_ZNSt16allocator_traitsISaISt13_Rb_tree_nodeISt4pairIKNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEEN3fst16FstRegisterEntryINS9_6ArcTplINS9_12LogWeightTplIfEEEEEEEEEE8allocateERSI_m\n   fun:_ZNSt8_Rb_treeINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEESt4pairIKS5_N3fst16FstRegisterEntryINS8_6ArcTplINS8_12LogWeightTplIfEEEEEEESt10_Select1stISF_ESt4lessIS5_ESaISF_EE11_M_get_nodeEv\n   fun:_ZNSt8_Rb_treeINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEESt4pairIKS5_N3fst16FstRegisterEntryINS8_6ArcTplINS8_12LogWeightTplIfEEEEEEESt10_Select1stISF_ESt4lessIS5_ESaISF_EE14_M_create_nodeIJS6_IS5_SE_EEEEPSt13_Rb_tree_nodeISF_EDpOT_\n   fun:_ZNSt8_Rb_treeINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEESt4pairIKS5_N3fst16FstRegisterEntryINS8_6ArcTplINS8_12LogWeightTplIfEEEEEEESt10_Select1stISF_ESt4lessIS5_ESaISF_EE17_M_emplace_uniqueIJS6_IS5_SE_EEEES6_ISt17_Rb_tree_iteratorISF_EbEDpOT_\n   fun:_ZNSt3mapINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEEN3fst16FstRegisterEntryINS6_6ArcTplINS6_12LogWeightTplIfEEEEEESt4lessIS5_ESaISt4pairIKS5_SC_EEE6insertISF_IS5_SC_EEENSt9enable_ifIXsrSt16is_constructibleISH_JT_EE5valueESF_ISt17_Rb_tree_iteratorISH_EbEE4typeEOSO_\n   fun:_ZN3fst15GenericRegisterINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEENS_16FstRegisterEntryINS_6ArcTplINS_12LogWeightTplIfEEEEEENS_11FstRegisterISB_EEE8SetEntryERKS6_RKSC_\n   fun:_ZN3fst17GenericRegistererINS_11FstRegisterINS_6ArcTplINS_12LogWeightTplIfEEEEEEEC1ENSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEENS_16FstRegisterEntryIS5_EE\n   fun:_ZN3fst13FstRegistererINS_10CompactFstINS_6ArcTplINS_12LogWeightTplIfEEEENS_27UnweightedAcceptorCompactorIS5_EEjNS_19DefaultCompactStoreISt4pairIiiEjEENS_17DefaultCacheStoreIS5_EEEEEC1Ev\n   fun:_Z41__static_initialization_and_destruction_0ii\n}\n{\n   <openfst>\n   Memcheck:Leak\n   match-leak-kinds: reachable\n   fun:_Znwm\n   fun:_ZN12FlagRegisterIiE11GetRegisterEv\n   fun:_ZN14FlagRegistererIiEC1ERKNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEERK15FlagDescriptionIiE\n   fun:_Z41__static_initialization_and_destruction_0ii\n}\n{\n   <openfst>\n   Memcheck:Leak\n   match-leak-kinds: reachable\n   fun:_Znwm\n   fun:_ZN12FlagRegisterIbE11GetRegisterEv\n   fun:_ZN14FlagRegistererIbEC1ERKNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEERK15FlagDescriptionIbE\n   fun:_Z41__static_initialization_and_destruction_0ii\n}\n{\n   <openfst>\n   Memcheck:Leak\n   match-leak-kinds: reachable\n   fun:_Znwm\n   fun:_ZN12FlagRegisterINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEEE11GetRegisterEv\n   fun:_ZN14FlagRegistererINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEEEC1ERKS5_RK15FlagDescriptionIS5_E\n   fun:_Z41__static_initialization_and_destruction_0ii\n}\n{\n   <openfst>\n   Memcheck:Leak\n   match-leak-kinds: reachable\n   fun:_Znwm\n   fun:_ZN12FlagRegisterIlE11GetRegisterEv\n   fun:_ZN14FlagRegistererIlEC1ERKNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEERK15FlagDescriptionIlE\n   fun:_Z41__static_initialization_and_destruction_0ii\n}\n{\n   <openfst>\n   Memcheck:Leak\n   match-leak-kinds: reachable\n   fun:_Znwm\n   fun:_ZN3fst15GenericRegisterINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEENS_16FstRegisterEntryINS_6ArcTplINS_17TropicalWeightTplIfEEEEEENS_11FstRegisterISB_EEE11GetRegisterEv\n   fun:_ZN3fst17GenericRegistererINS_11FstRegisterINS_6ArcTplINS_17TropicalWeightTplIfEEEEEEEC1ENSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEENS_16FstRegisterEntryIS5_EE\n   fun:_ZN3fst13FstRegistererINS_9VectorFstINS_6ArcTplINS_17TropicalWeightTplIfEEEENS_11VectorStateIS5_SaIS5_EEEEEEC1Ev\n   fun:_Z41__static_initialization_and_destruction_0ii\n}\n{\n   <openfst>\n   Memcheck:Leak\n   match-leak-kinds: reachable\n   fun:_Znwm\n   fun:_ZN3fst15GenericRegisterINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEENS_16FstRegisterEntryINS_6ArcTplINS_12LogWeightTplIfEEEEEENS_11FstRegisterISB_EEE11GetRegisterEv\n   fun:_ZN3fst17GenericRegistererINS_11FstRegisterINS_6ArcTplINS_12LogWeightTplIfEEEEEEEC1ENSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEENS_16FstRegisterEntryIS5_EE\n   fun:_ZN3fst13FstRegistererINS_9VectorFstINS_6ArcTplINS_12LogWeightTplIfEEEENS_11VectorStateIS5_SaIS5_EEEEEEC1Ev\n   fun:_Z41__static_initialization_and_destruction_0ii\n}\n{\n   <openfst>\n   Memcheck:Leak\n   match-leak-kinds: reachable\n   fun:_Znwm\n   fun:_ZN3fst15GenericRegisterINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEENS_16FstRegisterEntryINS_6ArcTplINS_12LogWeightTplIdEEEEEENS_11FstRegisterISB_EEE11GetRegisterEv\n   fun:_ZN3fst17GenericRegistererINS_11FstRegisterINS_6ArcTplINS_12LogWeightTplIdEEEEEEEC1ENSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEENS_16FstRegisterEntryIS5_EE\n   fun:_ZN3fst13FstRegistererINS_9VectorFstINS_6ArcTplINS_12LogWeightTplIdEEEENS_11VectorStateIS5_SaIS5_EEEEEEC1Ev\n   fun:_Z41__static_initialization_and_destruction_0ii\n}\n{\n   <openfst>\n   Memcheck:Leak\n   match-leak-kinds: reachable\n   fun:_Znwm\n   fun:_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEE15FlagDescriptionIiEEEE8allocateEmPKv\n   fun:_ZNSt16allocator_traitsISaISt13_Rb_tree_nodeISt4pairIKNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEE15FlagDescriptionIiEEEEE8allocateERSD_m\n   fun:_ZNSt8_Rb_treeINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEESt4pairIKS5_15FlagDescriptionIiEESt10_Select1stISA_ESt4lessIS5_ESaISA_EE11_M_get_nodeEv\n   fun:_ZNSt8_Rb_treeINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEESt4pairIKS5_15FlagDescriptionIiEESt10_Select1stISA_ESt4lessIS5_ESaISA_EE14_M_create_nodeIJS6_IS5_S9_EEEEPSt13_Rb_tree_nodeISA_EDpOT_\n   fun:_ZNSt8_Rb_treeINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEESt4pairIKS5_15FlagDescriptionIiEESt10_Select1stISA_ESt4lessIS5_ESaISA_EE17_M_emplace_uniqueIJS6_IS5_S9_EEEES6_ISt17_Rb_tree_iteratorISA_EbEDpOT_\n   fun:_ZNSt3mapINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEE15FlagDescriptionIiESt4lessIS5_ESaISt4pairIKS5_S7_EEE6insertISA_IS5_S7_EEENSt9enable_ifIXsrSt16is_constructibleISC_JT_EE5valueESA_ISt17_Rb_tree_iteratorISC_EbEE4typeEOSJ_\n   fun:_ZN12FlagRegisterIiE14SetDescriptionERKNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEERK15FlagDescriptionIiE\n   fun:_ZN14FlagRegistererIiEC1ERKNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEERK15FlagDescriptionIiE\n   fun:_Z41__static_initialization_and_destruction_0ii\n}\n{\n   <openfst>\n   Memcheck:Leak\n   match-leak-kinds: reachable\n   fun:_Znwm\n   fun:_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEE15FlagDescriptionIbEEEE8allocateEmPKv\n   fun:_ZNSt16allocator_traitsISaISt13_Rb_tree_nodeISt4pairIKNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEE15FlagDescriptionIbEEEEE8allocateERSD_m\n   fun:_ZNSt8_Rb_treeINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEESt4pairIKS5_15FlagDescriptionIbEESt10_Select1stISA_ESt4lessIS5_ESaISA_EE11_M_get_nodeEv\n   fun:_ZNSt8_Rb_treeINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEESt4pairIKS5_15FlagDescriptionIbEESt10_Select1stISA_ESt4lessIS5_ESaISA_EE14_M_create_nodeIJS6_IS5_S9_EEEEPSt13_Rb_tree_nodeISA_EDpOT_\n   fun:_ZNSt8_Rb_treeINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEESt4pairIKS5_15FlagDescriptionIbEESt10_Select1stISA_ESt4lessIS5_ESaISA_EE17_M_emplace_uniqueIJS6_IS5_S9_EEEES6_ISt17_Rb_tree_iteratorISA_EbEDpOT_\n   fun:_ZNSt3mapINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEE15FlagDescriptionIbESt4lessIS5_ESaISt4pairIKS5_S7_EEE6insertISA_IS5_S7_EEENSt9enable_ifIXsrSt16is_constructibleISC_JT_EE5valueESA_ISt17_Rb_tree_iteratorISC_EbEE4typeEOSJ_\n   fun:_ZN12FlagRegisterIbE14SetDescriptionERKNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEERK15FlagDescriptionIbE\n   fun:_ZN14FlagRegistererIbEC1ERKNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEERK15FlagDescriptionIbE\n   fun:_Z41__static_initialization_and_destruction_0ii\n}\n{\n   <openfst>\n   Memcheck:Leak\n   match-leak-kinds: reachable\n   fun:_Znwm\n   fun:_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEE15FlagDescriptionIbEEEE8allocateEmPKv\n   fun:_ZNSt16allocator_traitsISaISt13_Rb_tree_nodeISt4pairIKNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEE15FlagDescriptionIbEEEEE8allocateERSD_m\n   fun:_ZNSt8_Rb_treeINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEESt4pairIKS5_15FlagDescriptionIbEESt10_Select1stISA_ESt4lessIS5_ESaISA_EE11_M_get_nodeEv\n   fun:_ZNSt8_Rb_treeINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEESt4pairIKS5_15FlagDescriptionIbEESt10_Select1stISA_ESt4lessIS5_ESaISA_EE14_M_create_nodeIJS6_IS5_S9_EEEEPSt13_Rb_tree_nodeISA_EDpOT_\n   fun:_ZNSt8_Rb_treeINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEESt4pairIKS5_15FlagDescriptionIbEESt10_Select1stISA_ESt4lessIS5_ESaISA_EE17_M_emplace_uniqueIJS6_IS5_S9_EEEES6_ISt17_Rb_tree_iteratorISA_EbEDpOT_\n   fun:_ZNSt3mapINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEE15FlagDescriptionIbESt4lessIS5_ESaISt4pairIKS5_S7_EEE6insertISA_IS5_S7_EEENSt9enable_ifIXsrSt16is_constructibleISC_JT_EE5valueESA_ISt17_Rb_tree_iteratorISC_EbEE4typeEOSJ_\n   fun:_ZN12FlagRegisterIbE14SetDescriptionERKNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEERK15FlagDescriptionIbE\n   fun:_ZN14FlagRegistererIbEC1ERKNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEERK15FlagDescriptionIbE\n   fun:_Z41__static_initialization_and_destruction_0ii\n}\n{\n   <openfst>\n   Memcheck:Leak\n   match-leak-kinds: reachable\n   fun:_Znwm\n   fun:_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEE15FlagDescriptionIlEEEE8allocateEmPKv\n   fun:_ZNSt16allocator_traitsISaISt13_Rb_tree_nodeISt4pairIKNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEE15FlagDescriptionIlEEEEE8allocateERSD_m\n   fun:_ZNSt8_Rb_treeINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEESt4pairIKS5_15FlagDescriptionIlEESt10_Select1stISA_ESt4lessIS5_ESaISA_EE11_M_get_nodeEv\n   fun:_ZNSt8_Rb_treeINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEESt4pairIKS5_15FlagDescriptionIlEESt10_Select1stISA_ESt4lessIS5_ESaISA_EE14_M_create_nodeIJS6_IS5_S9_EEEEPSt13_Rb_tree_nodeISA_EDpOT_\n   fun:_ZNSt8_Rb_treeINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEESt4pairIKS5_15FlagDescriptionIlEESt10_Select1stISA_ESt4lessIS5_ESaISA_EE17_M_emplace_uniqueIJS6_IS5_S9_EEEES6_ISt17_Rb_tree_iteratorISA_EbEDpOT_\n   fun:_ZNSt3mapINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEE15FlagDescriptionIlESt4lessIS5_ESaISt4pairIKS5_S7_EEE6insertISA_IS5_S7_EEENSt9enable_ifIXsrSt16is_constructibleISC_JT_EE5valueESA_ISt17_Rb_tree_iteratorISC_EbEE4typeEOSJ_\n   fun:_ZN12FlagRegisterIlE14SetDescriptionERKNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEERK15FlagDescriptionIlE\n   fun:_ZN14FlagRegistererIlEC1ERKNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEERK15FlagDescriptionIlE\n   fun:_Z41__static_initialization_and_destruction_0ii\n}\n{\n   <openfst>\n   Memcheck:Leak\n   match-leak-kinds: reachable\n   fun:_Znwm\n   fun:_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEE15FlagDescriptionIbEEEE8allocateEmPKv\n   fun:_ZNSt16allocator_traitsISaISt13_Rb_tree_nodeISt4pairIKNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEE15FlagDescriptionIbEEEEE8allocateERSD_m\n   fun:_ZNSt8_Rb_treeINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEESt4pairIKS5_15FlagDescriptionIbEESt10_Select1stISA_ESt4lessIS5_ESaISA_EE11_M_get_nodeEv\n   fun:_ZNSt8_Rb_treeINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEESt4pairIKS5_15FlagDescriptionIbEESt10_Select1stISA_ESt4lessIS5_ESaISA_EE14_M_create_nodeIJS6_IS5_S9_EEEEPSt13_Rb_tree_nodeISA_EDpOT_\n   fun:_ZNSt8_Rb_treeINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEESt4pairIKS5_15FlagDescriptionIbEESt10_Select1stISA_ESt4lessIS5_ESaISA_EE17_M_emplace_uniqueIJS6_IS5_S9_EEEES6_ISt17_Rb_tree_iteratorISA_EbEDpOT_\n   fun:_ZNSt3mapINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEE15FlagDescriptionIbESt4lessIS5_ESaISt4pairIKS5_S7_EEE6insertISA_IS5_S7_EEENSt9enable_ifIXsrSt16is_constructibleISC_JT_EE5valueESA_ISt17_Rb_tree_iteratorISC_EbEE4typeEOSJ_\n   fun:_ZN12FlagRegisterIbE14SetDescriptionERKNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEERK15FlagDescriptionIbE\n   fun:_ZN14FlagRegistererIbEC1ERKNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEERK15FlagDescriptionIbE\n   fun:_Z41__static_initialization_and_destruction_0ii\n}\n{\n   <openfst>\n   Memcheck:Leak\n   match-leak-kinds: reachable\n   fun:_Znwm\n   fun:_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEE15FlagDescriptionIbEEEE8allocateEmPKv\n   fun:_ZNSt16allocator_traitsISaISt13_Rb_tree_nodeISt4pairIKNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEE15FlagDescriptionIbEEEEE8allocateERSD_m\n   fun:_ZNSt8_Rb_treeINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEESt4pairIKS5_15FlagDescriptionIbEESt10_Select1stISA_ESt4lessIS5_ESaISA_EE11_M_get_nodeEv\n   fun:_ZNSt8_Rb_treeINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEESt4pairIKS5_15FlagDescriptionIbEESt10_Select1stISA_ESt4lessIS5_ESaISA_EE14_M_create_nodeIJS6_IS5_S9_EEEEPSt13_Rb_tree_nodeISA_EDpOT_\n   fun:_ZNSt8_Rb_treeINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEESt4pairIKS5_15FlagDescriptionIbEESt10_Select1stISA_ESt4lessIS5_ESaISA_EE17_M_emplace_uniqueIJS6_IS5_S9_EEEES6_ISt17_Rb_tree_iteratorISA_EbEDpOT_\n   fun:_ZNSt3mapINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEE15FlagDescriptionIbESt4lessIS5_ESaISt4pairIKS5_S7_EEE6insertISA_IS5_S7_EEENSt9enable_ifIXsrSt16is_constructibleISC_JT_EE5valueESA_ISt17_Rb_tree_iteratorISC_EbEE4typeEOSJ_\n   fun:_ZN12FlagRegisterIbE14SetDescriptionERKNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEERK15FlagDescriptionIbE\n   fun:_ZN14FlagRegistererIbEC1ERKNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEERK15FlagDescriptionIbE\n   fun:_Z41__static_initialization_and_destruction_0ii\n}\n{\n   <openfst>\n   Memcheck:Leak\n   match-leak-kinds: reachable\n   fun:_Znwm\n   fun:_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEE15FlagDescriptionIS8_EEEE8allocateEmPKv\n   fun:_ZNSt16allocator_traitsISaISt13_Rb_tree_nodeISt4pairIKNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEE15FlagDescriptionIS7_EEEEE8allocateERSD_m\n   fun:_ZNSt8_Rb_treeINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEESt4pairIKS5_15FlagDescriptionIS5_EESt10_Select1stISA_ESt4lessIS5_ESaISA_EE11_M_get_nodeEv\n   fun:_ZNSt8_Rb_treeINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEESt4pairIKS5_15FlagDescriptionIS5_EESt10_Select1stISA_ESt4lessIS5_ESaISA_EE14_M_create_nodeIJS6_IS5_S9_EEEEPSt13_Rb_tree_nodeISA_EDpOT_\n   fun:_ZNSt8_Rb_treeINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEESt4pairIKS5_15FlagDescriptionIS5_EESt10_Select1stISA_ESt4lessIS5_ESaISA_EE17_M_emplace_uniqueIJS6_IS5_S9_EEEES6_ISt17_Rb_tree_iteratorISA_EbEDpOT_\n   fun:_ZNSt3mapINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEE15FlagDescriptionIS5_ESt4lessIS5_ESaISt4pairIKS5_S7_EEE6insertISA_IS5_S7_EEENSt9enable_ifIXsrSt16is_constructibleISC_JT_EE5valueESA_ISt17_Rb_tree_iteratorISC_EbEE4typeEOSJ_\n   fun:_ZN12FlagRegisterINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEEE14SetDescriptionERKS5_RK15FlagDescriptionIS5_E\n   fun:_ZN14FlagRegistererINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEEEC1ERKS5_RK15FlagDescriptionIS5_E\n   fun:_Z41__static_initialization_and_destruction_0ii\n}\n{\n   <openfst>\n   Memcheck:Leak\n   match-leak-kinds: reachable\n   fun:_Znwm\n   fun:_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEE15FlagDescriptionIS8_EEEE8allocateEmPKv\n   fun:_ZNSt16allocator_traitsISaISt13_Rb_tree_nodeISt4pairIKNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEE15FlagDescriptionIS7_EEEEE8allocateERSD_m\n   fun:_ZNSt8_Rb_treeINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEESt4pairIKS5_15FlagDescriptionIS5_EESt10_Select1stISA_ESt4lessIS5_ESaISA_EE11_M_get_nodeEv\n   fun:_ZNSt8_Rb_treeINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEESt4pairIKS5_15FlagDescriptionIS5_EESt10_Select1stISA_ESt4lessIS5_ESaISA_EE14_M_create_nodeIJS6_IS5_S9_EEEEPSt13_Rb_tree_nodeISA_EDpOT_\n   fun:_ZNSt8_Rb_treeINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEESt4pairIKS5_15FlagDescriptionIS5_EESt10_Select1stISA_ESt4lessIS5_ESaISA_EE17_M_emplace_uniqueIJS6_IS5_S9_EEEES6_ISt17_Rb_tree_iteratorISA_EbEDpOT_\n   fun:_ZNSt3mapINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEE15FlagDescriptionIS5_ESt4lessIS5_ESaISt4pairIKS5_S7_EEE6insertISA_IS5_S7_EEENSt9enable_ifIXsrSt16is_constructibleISC_JT_EE5valueESA_ISt17_Rb_tree_iteratorISC_EbEE4typeEOSJ_\n   fun:_ZN12FlagRegisterINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEEE14SetDescriptionERKS5_RK15FlagDescriptionIS5_E\n   fun:_ZN14FlagRegistererINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEEEC1ERKS5_RK15FlagDescriptionIS5_E\n   fun:_Z41__static_initialization_and_destruction_0ii\n}\n{\n   <openfst>\n   Memcheck:Leak\n   match-leak-kinds: reachable\n   fun:_Znwm\n   fun:_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEE15FlagDescriptionIS8_EEEE8allocateEmPKv\n   fun:_ZNSt16allocator_traitsISaISt13_Rb_tree_nodeISt4pairIKNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEE15FlagDescriptionIS7_EEEEE8allocateERSD_m\n   fun:_ZNSt8_Rb_treeINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEESt4pairIKS5_15FlagDescriptionIS5_EESt10_Select1stISA_ESt4lessIS5_ESaISA_EE11_M_get_nodeEv\n   fun:_ZNSt8_Rb_treeINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEESt4pairIKS5_15FlagDescriptionIS5_EESt10_Select1stISA_ESt4lessIS5_ESaISA_EE14_M_create_nodeIJS6_IS5_S9_EEEEPSt13_Rb_tree_nodeISA_EDpOT_\n   fun:_ZNSt8_Rb_treeINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEESt4pairIKS5_15FlagDescriptionIS5_EESt10_Select1stISA_ESt4lessIS5_ESaISA_EE17_M_emplace_uniqueIJS6_IS5_S9_EEEES6_ISt17_Rb_tree_iteratorISA_EbEDpOT_\n   fun:_ZNSt3mapINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEE15FlagDescriptionIS5_ESt4lessIS5_ESaISt4pairIKS5_S7_EEE6insertISA_IS5_S7_EEENSt9enable_ifIXsrSt16is_constructibleISC_JT_EE5valueESA_ISt17_Rb_tree_iteratorISC_EbEE4typeEOSJ_\n   fun:_ZN12FlagRegisterINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEEE14SetDescriptionERKS5_RK15FlagDescriptionIS5_E\n   fun:_ZN14FlagRegistererINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEEEC1ERKS5_RK15FlagDescriptionIS5_E\n   fun:_Z41__static_initialization_and_destruction_0ii\n}\n{\n   <openfst>\n   Memcheck:Leak\n   match-leak-kinds: reachable\n   fun:_Znwm\n   fun:_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEE15FlagDescriptionIS8_EEEE8allocateEmPKv\n   fun:_ZNSt16allocator_traitsISaISt13_Rb_tree_nodeISt4pairIKNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEE15FlagDescriptionIS7_EEEEE8allocateERSD_m\n   fun:_ZNSt8_Rb_treeINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEESt4pairIKS5_15FlagDescriptionIS5_EESt10_Select1stISA_ESt4lessIS5_ESaISA_EE11_M_get_nodeEv\n   fun:_ZNSt8_Rb_treeINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEESt4pairIKS5_15FlagDescriptionIS5_EESt10_Select1stISA_ESt4lessIS5_ESaISA_EE14_M_create_nodeIJS6_IS5_S9_EEEEPSt13_Rb_tree_nodeISA_EDpOT_\n   fun:_ZNSt8_Rb_treeINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEESt4pairIKS5_15FlagDescriptionIS5_EESt10_Select1stISA_ESt4lessIS5_ESaISA_EE17_M_emplace_uniqueIJS6_IS5_S9_EEEES6_ISt17_Rb_tree_iteratorISA_EbEDpOT_\n   fun:_ZNSt3mapINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEE15FlagDescriptionIS5_ESt4lessIS5_ESaISt4pairIKS5_S7_EEE6insertISA_IS5_S7_EEENSt9enable_ifIXsrSt16is_constructibleISC_JT_EE5valueESA_ISt17_Rb_tree_iteratorISC_EbEE4typeEOSJ_\n   fun:_ZN12FlagRegisterINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEEE14SetDescriptionERKS5_RK15FlagDescriptionIS5_E\n   fun:_ZN14FlagRegistererINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEEEC1ERKS5_RK15FlagDescriptionIS5_E\n   fun:_Z41__static_initialization_and_destruction_0ii\n}\n"
  },
  {
    "path": "ds_sox.supp",
    "content": "{\n   sox_effect_gain\n   Memcheck:Leak\n   match-leak-kinds: reachable\n   fun:malloc\n   fun:realloc\n   fun:lsx_realloc\n   fun:lsx_usage_lines\n   fun:lsx_gain_effect_fn\n   fun:sox_find_effect\n   fun:_Z14GetAudioBufferPKci\n   fun:_Z11ProcessFileP10ModelStatePKcb\n   fun:main\n}\n{\n   sox_effect_rate\n   Memcheck:Leak\n   match-leak-kinds: reachable\n   fun:malloc\n   fun:realloc\n   fun:lsx_realloc\n   fun:lsx_usage_lines\n   fun:lsx_rate_effect_fn\n   fun:sox_find_effect\n   fun:_Z14GetAudioBufferPKci\n   fun:_Z11ProcessFileP10ModelStatePKcb\n   fun:main\n}\n{\n   sox_effect_flanger\n   Memcheck:Leak\n   match-leak-kinds: reachable\n   fun:malloc\n   fun:realloc\n   fun:lsx_realloc\n   fun:lsx_usage_lines\n   fun:lsx_flanger_effect_fn\n   fun:sox_find_effect\n   fun:_Z14GetAudioBufferPKci\n   fun:_Z11ProcessFileP10ModelStatePKcb\n   fun:main\n}\n"
  },
  {
    "path": "evaluate.py",
    "content": "#!/usr/bin/env python\n# -*- coding: utf-8 -*-\nfrom __future__ import absolute_import, division, print_function\n\nif __name__ == '__main__':\n    try:\n        from deepspeech_training import evaluate as ds_evaluate\n    except ImportError:\n        print('Training package is not installed. See training documentation.')\n        raise\n\n    ds_evaluate.run_script()\n"
  },
  {
    "path": "evaluate_tflite.py",
    "content": "#!/usr/bin/env python\n# -*- coding: utf-8 -*-\nfrom __future__ import absolute_import, division, print_function\n\nimport absl.app\nimport argparse\nimport numpy as np\nimport wave\nimport csv\nimport os\nimport sys\n\nfrom deepspeech import Model\nfrom deepspeech_training.util.evaluate_tools import calculate_and_print_report\nfrom deepspeech_training.util.flags import create_flags\nfrom functools import partial\nfrom multiprocessing import JoinableQueue, Process, cpu_count, Manager\nfrom six.moves import zip, range\n\nr'''\nThis module should be self-contained:\n  - build libdeepspeech.so with TFLite:\n    - bazel build [...] --define=runtime=tflite [...] //native_client:libdeepspeech.so\n  - make -C native_client/python/ TFDIR=... bindings\n  - setup a virtualenv\n  - pip install native_client/python/dist/deepspeech*.whl\n  - pip install -r requirements_eval_tflite.txt\n\nThen run with a TF Lite model, a scorer and a CSV test file\n'''\n\ndef tflite_worker(model, scorer, queue_in, queue_out, gpu_mask):\n    os.environ['CUDA_VISIBLE_DEVICES'] = str(gpu_mask)\n    ds = Model(model)\n    ds.enableExternalScorer(scorer)\n\n    while True:\n        try:\n            msg = queue_in.get()\n\n            filename = msg['filename']\n            fin = wave.open(filename, 'rb')\n            audio = np.frombuffer(fin.readframes(fin.getnframes()), np.int16)\n            fin.close()\n\n            decoded = ds.stt(audio)\n\n            queue_out.put({'wav': filename, 'prediction': decoded, 'ground_truth': msg['transcript']})\n        except FileNotFoundError as ex:\n            print('FileNotFoundError: ', ex)\n\n        print(queue_out.qsize(), end='\\r') # Update the current progress\n        queue_in.task_done()\n\ndef main(args, _):\n    manager = Manager()\n    work_todo = JoinableQueue()   # this is where we are going to store input data\n    work_done = manager.Queue()  # this where we are gonna push them out\n\n    processes = []\n    for i in range(args.proc):\n        worker_process = Process(target=tflite_worker, args=(args.model, args.scorer, work_todo, work_done, i), daemon=True, name='tflite_process_{}'.format(i))\n        worker_process.start()        # Launch reader() as a separate python process\n        processes.append(worker_process)\n\n    print([x.name for x in processes])\n\n    wavlist = []\n    ground_truths = []\n    predictions = []\n    losses = []\n    wav_filenames = []\n\n    with open(args.csv, 'r') as csvfile:\n        csvreader = csv.DictReader(csvfile)\n        count = 0\n        for row in csvreader:\n            count += 1\n            # Relative paths are relative to the folder the CSV file is in\n            if not os.path.isabs(row['wav_filename']):\n                row['wav_filename'] = os.path.join(os.path.dirname(args.csv), row['wav_filename'])\n            work_todo.put({'filename': row['wav_filename'], 'transcript': row['transcript']})\n            wav_filenames.extend(row['wav_filename'])\n\n    print('Totally %d wav entries found in csv\\n' % count)\n    work_todo.join()\n    print('\\nTotally %d wav file transcripted' % work_done.qsize())\n\n    while not work_done.empty():\n        msg = work_done.get()\n        losses.append(0.0)\n        ground_truths.append(msg['ground_truth'])\n        predictions.append(msg['prediction'])\n        wavlist.append(msg['wav'])\n\n    # Print test summary\n    _ = calculate_and_print_report(wav_filenames, ground_truths, predictions, losses, args.csv)\n\n    if args.dump:\n        with open(args.dump + '.txt', 'w') as ftxt, open(args.dump + '.out', 'w') as fout:\n            for wav, txt, out in zip(wavlist, ground_truths, predictions):\n                ftxt.write('%s %s\\n' % (wav, txt))\n                fout.write('%s %s\\n' % (wav, out))\n            print('Reference texts dumped to %s.txt' % args.dump)\n            print('Transcription   dumped to %s.out' % args.dump)\n\ndef parse_args():\n    parser = argparse.ArgumentParser(description='Computing TFLite accuracy')\n    parser.add_argument('--model', required=True,\n                        help='Path to the model (protocol buffer binary file)')\n    parser.add_argument('--scorer', required=True,\n                        help='Path to the external scorer file')\n    parser.add_argument('--csv', required=True,\n                        help='Path to the CSV source file')\n    parser.add_argument('--proc', required=False, default=cpu_count(), type=int,\n                        help='Number of processes to spawn, defaulting to number of CPUs')\n    parser.add_argument('--dump', required=False,\n                        help='Path to dump the results as text file, with one line for each wav: \"wav transcription\".')\n    args, unknown = parser.parse_known_args()\n    # Reconstruct argv for absl.flags\n    sys.argv = [sys.argv[0]] + unknown\n    return args\n\nif __name__ == '__main__':\n    create_flags()\n    absl.app.run(partial(main, parse_args()))\n"
  },
  {
    "path": "examples/README.rst",
    "content": "Examples\n========\n\nDeepSpeech examples were moved to a separate repository.\n\nNew location: https://github.com/mozilla/DeepSpeech-examples\n"
  },
  {
    "path": "lm_optimizer.py",
    "content": "#!/usr/bin/env python\n# -*- coding: utf-8 -*-\nfrom __future__ import absolute_import, print_function\n\nimport absl.app\nimport optuna\nimport sys\nimport tensorflow.compat.v1 as tfv1\n\nfrom deepspeech_training.evaluate import evaluate\nfrom deepspeech_training.train import create_model\nfrom deepspeech_training.util.config import Config, initialize_globals\nfrom deepspeech_training.util.flags import create_flags, FLAGS\nfrom deepspeech_training.util.logging import log_error\nfrom deepspeech_training.util.evaluate_tools import wer_cer_batch\nfrom ds_ctcdecoder import Scorer\n\n\ndef character_based():\n    is_character_based = False\n    if FLAGS.scorer_path:\n        scorer = Scorer(FLAGS.lm_alpha, FLAGS.lm_beta, FLAGS.scorer_path, Config.alphabet)\n        is_character_based = scorer.is_utf8_mode()\n    return is_character_based\n\ndef objective(trial):\n    FLAGS.lm_alpha = trial.suggest_uniform('lm_alpha', 0, FLAGS.lm_alpha_max)\n    FLAGS.lm_beta = trial.suggest_uniform('lm_beta', 0, FLAGS.lm_beta_max)\n\n    is_character_based = trial.study.user_attrs['is_character_based']\n\n    samples = []\n    for step, test_file in enumerate(FLAGS.test_files.split(',')):\n        tfv1.reset_default_graph()\n\n        current_samples = evaluate([test_file], create_model)\n        samples += current_samples\n\n        # Report intermediate objective value.\n        wer, cer = wer_cer_batch(current_samples)\n        trial.report(cer if is_character_based else wer, step)\n\n        # Handle pruning based on the intermediate value.\n        if trial.should_prune():\n            raise optuna.exceptions.TrialPruned()\n\n    wer, cer = wer_cer_batch(samples)\n    return cer if is_character_based else wer\n\ndef main(_):\n    initialize_globals()\n\n    if not FLAGS.test_files:\n        log_error('You need to specify what files to use for evaluation via '\n                  'the --test_files flag.')\n        sys.exit(1)\n\n    is_character_based = character_based()\n\n    study = optuna.create_study()\n    study.set_user_attr(\"is_character_based\", is_character_based)\n    study.optimize(objective, n_jobs=1, n_trials=FLAGS.n_trials)\n    print('Best params: lm_alpha={} and lm_beta={} with WER={}'.format(study.best_params['lm_alpha'],\n                                                                       study.best_params['lm_beta'],\n                                                                       study.best_value))\n\n\nif __name__ == '__main__':\n    create_flags()\n    absl.app.run(main)\n"
  },
  {
    "path": "native_client/Android.mk",
    "content": "LOCAL_PATH := $(call my-dir)\n\ninclude $(CLEAR_VARS)\nLOCAL_MODULE    := deepspeech-prebuilt\nLOCAL_SRC_FILES := $(TFDIR)/bazel-bin/native_client/libdeepspeech.so\ninclude $(PREBUILT_SHARED_LIBRARY)\n\ninclude $(CLEAR_VARS)\nLOCAL_CPP_EXTENSION    := .cc .cxx .cpp\nLOCAL_MODULE           := deepspeech\nLOCAL_SRC_FILES        := client.cc\nLOCAL_SHARED_LIBRARIES := deepspeech-prebuilt\nLOCAL_LDFLAGS          := -Wl,--no-as-needed\ninclude $(BUILD_EXECUTABLE)\n"
  },
  {
    "path": "native_client/BUILD",
    "content": "# Description: Deepspeech native client library.\n\nload(\"@org_tensorflow//tensorflow:tensorflow.bzl\", \"tf_cc_shared_object\", \"tf_copts\", \"lrt_if_needed\")\nload(\"@local_config_cuda//cuda:build_defs.bzl\", \"if_cuda\")\nload(\"@com_github_nelhage_rules_boost//:boost/boost.bzl\", \"boost_deps\")\nload(\"@build_bazel_rules_apple//apple:ios.bzl\", \"ios_static_framework\")\n\nload(\n    \"@org_tensorflow//tensorflow/lite:build_def.bzl\",\n    \"tflite_copts\",\n    \"tflite_linkopts\",\n)\n\nconfig_setting(\n    name = \"tflite\",\n    define_values = {\n        \"runtime\": \"tflite\",\n    },\n)\n\nconfig_setting(\n    name = \"rpi3\",\n    define_values = {\n        \"target_system\": \"rpi3\"\n    },\n)\n\nconfig_setting(\n    name = \"rpi3-armv8\",\n    define_values = {\n        \"target_system\": \"rpi3-armv8\"\n    },\n)\n\ngenrule(\n    name = \"workspace_status\",\n    outs = [\"workspace_status.cc\"],\n    cmd = \"$(location :gen_workspace_status.sh) >$@\",\n    local = 1,\n    stamp = 1,\n    tools = [\":gen_workspace_status.sh\"],\n)\n\n\nOPENFST_SOURCES_PLATFORM = select({\n    \"//tensorflow:windows\": glob([\"ctcdecode/third_party/openfst-1.6.9-win/src/lib/*.cc\"]),\n    \"//conditions:default\": glob([\"ctcdecode/third_party/openfst-1.6.7/src/lib/*.cc\"]),\n})\n\nOPENFST_INCLUDES_PLATFORM = select({\n    \"//tensorflow:windows\": [\"ctcdecode/third_party/openfst-1.6.9-win/src/include\"],\n    \"//conditions:default\": [\"ctcdecode/third_party/openfst-1.6.7/src/include\"],\n})\n\nLINUX_LINKOPTS = [\n    \"-ldl\",\n    \"-pthread\",\n    \"-Wl,-Bsymbolic\",\n    \"-Wl,-Bsymbolic-functions\",\n    \"-Wl,-export-dynamic\",\n]\n\ncc_library(\n    name = \"kenlm\",\n    srcs = glob([\n        \"kenlm/lm/*.cc\",\n        \"kenlm/util/*.cc\",\n        \"kenlm/util/double-conversion/*.cc\",\n        \"kenlm/util/double-conversion/*.h\",\n    ],\n    exclude = [\n        \"kenlm/*/*test.cc\",\n        \"kenlm/*/*main.cc\",\n    ],),\n    hdrs = glob([\n        \"kenlm/lm/*.hh\",\n        \"kenlm/util/*.hh\",\n    ]),\n    copts = [\"-std=c++11\"],\n    defines = [\"KENLM_MAX_ORDER=6\"],\n    includes = [\"kenlm\"],\n)\n\ncc_library(\n    name = \"decoder\",\n    srcs = [\n        \"ctcdecode/ctc_beam_search_decoder.cpp\",\n        \"ctcdecode/decoder_utils.cpp\",\n        \"ctcdecode/decoder_utils.h\",\n        \"ctcdecode/scorer.cpp\",\n        \"ctcdecode/path_trie.cpp\",\n        \"ctcdecode/path_trie.h\",\n        \"alphabet.cc\",\n    ] + OPENFST_SOURCES_PLATFORM,\n    hdrs = [\n        \"ctcdecode/ctc_beam_search_decoder.h\",\n        \"ctcdecode/scorer.h\",\n        \"ctcdecode/decoder_utils.h\",\n        \"alphabet.h\",\n    ],\n    includes = [\n        \".\",\n        \"ctcdecode/third_party/ThreadPool\",\n        \"ctcdecode/third_party/object_pool\",\n    ] + OPENFST_INCLUDES_PLATFORM,\n    deps = [\":kenlm\"],\n    linkopts = [\n        \"-lm\",\n        \"-ldl\",\n        \"-pthread\",\n    ],\n)\n\ncc_library(\n    name = \"deepspeech_bundle\",\n    srcs = [\n        \"deepspeech.cc\",\n        \"deepspeech.h\",\n        \"deepspeech_errors.cc\",\n        \"modelstate.cc\",\n        \"modelstate.h\",\n        \"workspace_status.cc\",\n        \"workspace_status.h\",\n    ] + select({\n        \"//native_client:tflite\": [\n            \"tflitemodelstate.h\",\n            \"tflitemodelstate.cc\",\n        ],\n        \"//conditions:default\": [\n            \"tfmodelstate.h\",\n            \"tfmodelstate.cc\",\n        ],\n    }),\n    copts = tf_copts() + select({\n        # -fvisibility=hidden is not required on Windows, MSCV hides all declarations by default\n        \"//tensorflow:windows\": [\"/w\"],\n        # -Wno-sign-compare to silent a lot of warnings from tensorflow itself,\n        # which makes it harder to see our own warnings\n        \"//conditions:default\": [\n            \"-Wno-sign-compare\",\n            \"-fvisibility=hidden\",\n        ],\n    }) + select({\n        \"//native_client:tflite\": [\"-DUSE_TFLITE\"],\n        \"//conditions:default\": [\"-UUSE_TFLITE\"],\n    }) + tflite_copts(),\n    linkopts = lrt_if_needed() + select({\n        \"//tensorflow:macos\": [],\n        \"//tensorflow:ios\": [\"-fembed-bitcode\"],\n        \"//tensorflow:linux_x86_64\": LINUX_LINKOPTS,\n        \"//native_client:rpi3\": LINUX_LINKOPTS,\n        \"//native_client:rpi3-armv8\": LINUX_LINKOPTS,\n        \"//tensorflow:windows\": [],\n        \"//conditions:default\": [],\n    }) + tflite_linkopts(),\n    deps = select({\n        \"//native_client:tflite\": [\n            \"//tensorflow/lite/kernels:builtin_ops\",\n            \"//tensorflow/lite/tools/evaluation:utils\",\n        ],\n        \"//conditions:default\": [\n            \"//tensorflow/core:core_cpu\",\n            \"//tensorflow/core:direct_session\",\n            \"//third_party/eigen3\",\n            #\"//tensorflow/core:all_kernels\",\n            ### => Trying to be more fine-grained\n            ### Use bin/ops_in_graph.py to list all the ops used by a frozen graph.\n            ### CPU only build, libdeepspeech.so file size reduced by ~50%\n            \"//tensorflow/core/kernels:spectrogram_op\",  # AudioSpectrogram\n            \"//tensorflow/core/kernels:bias_op\",  # BiasAdd\n            \"//tensorflow/core/kernels:cast_op\",  # Cast\n            \"//tensorflow/core/kernels:concat_op\",  # ConcatV2\n            \"//tensorflow/core/kernels:constant_op\",  # Const, Placeholder\n            \"//tensorflow/core/kernels:shape_ops\",  # ExpandDims, Shape\n            \"//tensorflow/core/kernels:gather_nd_op\",  # GatherNd\n            \"//tensorflow/core/kernels:identity_op\",  # Identity\n            \"//tensorflow/core/kernels:immutable_constant_op\",  # ImmutableConst (used in memmapped models)\n            \"//tensorflow/core/kernels:deepspeech_cwise_ops\",  # Less, Minimum, Mul\n            \"//tensorflow/core/kernels:matmul_op\",  # MatMul\n            \"//tensorflow/core/kernels:reduction_ops\",  # Max\n            \"//tensorflow/core/kernels:mfcc_op\",  # Mfcc\n            \"//tensorflow/core/kernels:no_op\",  # NoOp\n            \"//tensorflow/core/kernels:pack_op\",  # Pack\n            \"//tensorflow/core/kernels:sequence_ops\",  # Range\n            \"//tensorflow/core/kernels:relu_op\",  # Relu\n            \"//tensorflow/core/kernels:reshape_op\",  # Reshape\n            \"//tensorflow/core/kernels:softmax_op\",  # Softmax\n            \"//tensorflow/core/kernels:tile_ops\",  # Tile\n            \"//tensorflow/core/kernels:transpose_op\",  # Transpose\n            \"//tensorflow/core/kernels:rnn_ops\",  # BlockLSTM\n            # And we also need the op libs for these ops used in the model:\n            \"//tensorflow/core:audio_ops_op_lib\",  # AudioSpectrogram, Mfcc\n            \"//tensorflow/core:rnn_ops_op_lib\",  # BlockLSTM\n            \"//tensorflow/core:math_ops_op_lib\",  # Cast, Less, Max, MatMul, Minimum, Range\n            \"//tensorflow/core:array_ops_op_lib\",  # ConcatV2, Const, ExpandDims, Fill, GatherNd, Identity, Pack, Placeholder, Reshape, Tile, Transpose\n            \"//tensorflow/core:no_op_op_lib\",  # NoOp\n            \"//tensorflow/core:nn_ops_op_lib\",  # Relu, Softmax, BiasAdd\n            # And op libs for these ops brought in by dependencies of dependencies to silence unknown OpKernel warnings:\n            \"//tensorflow/core:dataset_ops_op_lib\",  # UnwrapDatasetVariant, WrapDatasetVariant\n            \"//tensorflow/core:sendrecv_ops_op_lib\",  # _HostRecv, _HostSend, _Recv, _Send\n        ],\n    }) + if_cuda([\n        \"//tensorflow/core:core\",\n    ]) + [\":decoder\"],\n)\n\ntf_cc_shared_object(\n    name = \"libdeepspeech.so\",\n    deps = [\":deepspeech_bundle\"],\n)\n\nios_static_framework(\n    name = \"deepspeech_ios\",\n    deps = [\":deepspeech_bundle\"],\n    families = [\"iphone\", \"ipad\"],\n    minimum_os_version = \"9.0\",\n    linkopts = [\"-lstdc++\"],\n)\n\ngenrule(\n    name = \"libdeepspeech_so_dsym\",\n    srcs = [\":libdeepspeech.so\"],\n    outs = [\"libdeepspeech.so.dSYM\"],\n    output_to_bindir = True,\n    cmd = \"dsymutil $(location :libdeepspeech.so) -o $@\"\n)\n\ncc_binary(\n    name = \"generate_scorer_package\",\n    srcs = [\n        \"generate_scorer_package.cpp\",\n        \"deepspeech_errors.cc\",\n    ],\n    copts = [\"-std=c++11\"],\n    deps = [\n        \":decoder\",\n        \"@com_google_absl//absl/flags:flag\",\n        \"@com_google_absl//absl/flags:parse\",\n        \"@com_google_absl//absl/types:optional\",\n        \"@boost//:program_options\",\n    ],\n    linkstatic = 1,\n    linkopts = [\n        \"-lm\",\n        \"-ldl\",\n        \"-pthread\",\n    ] + select({\n        # ARMv7: error: Android 5.0 and later only support position-independent executables (-fPIE).\n        \"//tensorflow:android\": [\"-fPIE -pie\"],\n        \"//conditions:default\": [],\n    }),\n)\n\ncc_binary(\n    name = \"enumerate_kenlm_vocabulary\",\n    srcs = [\n        \"enumerate_kenlm_vocabulary.cpp\",\n    ],\n    deps = [\":kenlm\"],\n    copts = [\"-std=c++11\"],\n)\n\ncc_binary(\n    name = \"trie_load\",\n    srcs = [\n        \"alphabet.h\",\n        \"trie_load.cc\",\n    ],\n    copts = [\"-std=c++11\"],\n    deps = [\":decoder\"],\n)\n"
  },
  {
    "path": "native_client/CODINGSTYLE.md",
    "content": "This file contains some notes on coding style within the C++ portion of the\nDeepSpeech project. It is very much a work in progress and incomplete.\n\nGeneral\n=======\n\nThe code has been imported from various places. Please try and blend in your\ncode with the surrounding code.\n\nIf you are coding from scratch, please follow [Google coding guidelines for C++](https://google.github.io/styleguide/cppguide.html).\n\nVariable naming\n===============\n\n* class/struct member variables which are private should follow lowercase with\n  a final underscore, e.g. `unsigned int beam_width_;` in `modelstate.h`.\n\nFile naming\n===========\n\n* Source code files should have a `.cc` prefix and headers a `.h` prefix, excluding \n  code important from elsewhere, which should follow local conventions, e.g. `.cpp` and `.h` \n  in `ctcdecode/`.\n\nDoubts\n======\n\nIf in doubt, please ask on our Matrix chat channel: https://chat.mozilla.org/#/room/#machinelearning:mozilla.org\n"
  },
  {
    "path": "native_client/Makefile",
    "content": "###\n### From topdir, first use multistrap to prepare a raspbian buster armhf root\n### $ multistrap -d multistrap-raspbian-buster -f native_client/multistrap_raspbian_buster.conf\n###\n### You can make a tarball after:\n### $ touch multistrap-raspbian-buster.tar && sudo tar cf multistrap-raspbian-buster.tar multistrap-raspbian-buster/ && xz multistrap-raspbian-buster.tar\n###\n### Then cross-build:\n### $ make -C native_client/ TARGET=rpi3 TFDIR=../../tensorflow/tensorflow/\n###\n\n.PHONY: clean run print-toolchain\n\ninclude definitions.mk\n\ndefault: $(DEEPSPEECH_BIN)\n\nclean:\n\trm -f deepspeech\n\n$(DEEPSPEECH_BIN): client.cc Makefile\n\t$(CXX) $(CFLAGS) $(CFLAGS_DEEPSPEECH) $(SOX_CFLAGS) client.cc $(LDFLAGS) $(SOX_LDFLAGS)\nifeq ($(OS),Darwin)\n\tinstall_name_tool -change bazel-out/local-opt/bin/native_client/libdeepspeech.so @rpath/libdeepspeech.so deepspeech\nendif\n\nrun: $(DEEPSPEECH_BIN)\n\t${META_LD_LIBRARY_PATH}=${TFDIR}/bazel-bin/native_client:${${META_LD_LIBRARY_PATH}} ./deepspeech ${ARGS}\n\ndebug: $(DEEPSPEECH_BIN)\n\t${META_LD_LIBRARY_PATH}=${TFDIR}/bazel-bin/native_client:${${META_LD_LIBRARY_PATH}} gdb --args ./deepspeech ${ARGS}\n\ninstall: $(DEEPSPEECH_BIN)\n\tinstall -d ${PREFIX}/lib\n\tinstall -m 0644 ${TFDIR}/bazel-bin/native_client/libdeepspeech.so ${PREFIX}/lib/\n\tinstall -d ${PREFIX}/include\n\tinstall -m 0644 deepspeech.h ${PREFIX}/include\n\tinstall -d ${PREFIX}/bin\n\tinstall -m 0755 deepspeech ${PREFIX}/bin/\n\nuninstall:\n\trm -f ${PREFIX}/bin/deepspeech\n\trmdir --ignore-fail-on-non-empty ${PREFIX}/bin\n\trm -f ${PREFIX}/lib/libdeepspeech.so\n\trmdir --ignore-fail-on-non-empty ${PREFIX}/lib\n\nprint-toolchain:\n\t@echo $(TOOLCHAIN)\n"
  },
  {
    "path": "native_client/alphabet.cc",
    "content": "#include \"alphabet.h\"\n#include \"ctcdecode/decoder_utils.h\"\n\n#include <fstream>\n\n// std::getline, but handle newline conventions from multiple platforms instead\n// of just the platform this code was built for\nstd::istream&\ngetline_crossplatform(std::istream& is, std::string& t)\n{\n  t.clear();\n\n  // The characters in the stream are read one-by-one using a std::streambuf.\n  // That is faster than reading them one-by-one using the std::istream.\n  // Code that uses streambuf this way must be guarded by a sentry object.\n  // The sentry object performs various tasks,\n  // such as thread synchronization and updating the stream state.\n  std::istream::sentry se(is, true);\n  std::streambuf* sb = is.rdbuf();\n\n  while (true) {\n    int c = sb->sbumpc();\n    switch (c) {\n    case '\\n':\n      return is;\n    case '\\r':\n      if(sb->sgetc() == '\\n')\n          sb->sbumpc();\n      return is;\n    case std::streambuf::traits_type::eof():\n      // Also handle the case when the last line has no line ending\n      if(t.empty())\n        is.setstate(std::ios::eofbit);\n      return is;\n    default:\n      t += (char)c;\n    }\n  }\n}\n\nint\nAlphabet::init(const char *config_file)\n{\n  std::ifstream in(config_file, std::ios::in);\n  if (!in) {\n    return 1;\n  }\n  unsigned int label = 0;\n  space_label_ = -2;\n  for (std::string line; getline_crossplatform(in, line);) {\n    if (line.size() == 2 && line[0] == '\\\\' && line[1] == '#') {\n      line = '#';\n    } else if (line[0] == '#') {\n      continue;\n    }\n    //TODO: we should probably do something more i18n-aware here\n    if (line == \" \") {\n      space_label_ = label;\n    }\n    if (line.length() == 0) {\n      continue;\n    }\n    label_to_str_[label] = line;\n    str_to_label_[line] = label;\n    ++label;\n  }\n  size_ = label;\n  in.close();\n  return 0;\n}\n\nstd::string\nAlphabet::Serialize()\n{\n  // Serialization format is a sequence of (key, value) pairs, where key is\n  // a uint16_t and value is a uint16_t length followed by `length` UTF-8\n  // encoded bytes with the label.\n  std::stringstream out;\n\n  // We start by writing the number of pairs in the buffer as uint16_t.\n  uint16_t size = size_;\n  out.write(reinterpret_cast<char*>(&size), sizeof(size));\n\n  for (auto it = label_to_str_.begin(); it != label_to_str_.end(); ++it) {\n    uint16_t key = it->first;\n    string str = it->second;\n    uint16_t len = str.length();\n    // Then we write the key as uint16_t, followed by the length of the value\n    // as uint16_t, followed by `length` bytes (the value itself).\n    out.write(reinterpret_cast<char*>(&key), sizeof(key));\n    out.write(reinterpret_cast<char*>(&len), sizeof(len));\n    out.write(str.data(), len);\n  }\n\n  return out.str();\n}\n\nint\nAlphabet::Deserialize(const char* buffer, const int buffer_size)\n{\n  // See util/text.py for an explanation of the serialization format.\n  int offset = 0;\n  if (buffer_size - offset < sizeof(uint16_t)) {\n    return 1;\n  }\n  uint16_t size = *(uint16_t*)(buffer + offset);\n  offset += sizeof(uint16_t);\n  size_ = size;\n\n  for (int i = 0; i < size; ++i) {\n    if (buffer_size - offset < sizeof(uint16_t)) {\n      return 1;\n    }\n    uint16_t label = *(uint16_t*)(buffer + offset);\n    offset += sizeof(uint16_t);\n\n    if (buffer_size - offset < sizeof(uint16_t)) {\n      return 1;\n    }\n    uint16_t val_len = *(uint16_t*)(buffer + offset);\n    offset += sizeof(uint16_t);\n\n    if (buffer_size - offset < val_len) {\n      return 1;\n    }\n    std::string val(buffer+offset, val_len);\n    offset += val_len;\n\n    label_to_str_[label] = val;\n    str_to_label_[val] = label;\n\n    if (val == \" \") {\n      space_label_ = label;\n    }\n  }\n\n  return 0;\n}\n\nbool\nAlphabet::CanEncodeSingle(const std::string& input) const\n{\n  auto it = str_to_label_.find(input);\n  return it != str_to_label_.end();\n}\n\nbool\nAlphabet::CanEncode(const std::string& input) const\n{\n  for (auto cp : split_into_codepoints(input)) {\n    if (!CanEncodeSingle(cp)) {\n      return false;\n    }\n  }\n  return true;\n}\n\nstd::string\nAlphabet::DecodeSingle(unsigned int label) const\n{\n  auto it = label_to_str_.find(label);\n  if (it != label_to_str_.end()) {\n    return it->second;\n  } else {\n    std::cerr << \"Invalid label \" << label << std::endl;\n    abort();\n  }\n}\n\nunsigned int\nAlphabet::EncodeSingle(const std::string& string) const\n{\n  auto it = str_to_label_.find(string);\n  if (it != str_to_label_.end()) {\n    return it->second;\n  } else {\n    std::cerr << \"Invalid string \" << string << std::endl;\n    abort();\n  }\n}\n\nstd::string\nAlphabet::Decode(const std::vector<unsigned int>& input) const\n{\n  std::string word;\n  for (auto ind : input) {\n    word += DecodeSingle(ind);\n  }\n  return word;\n}\n\nstd::string\nAlphabet::Decode(const unsigned int* input, int length) const\n{\n  std::string word;\n  for (int i = 0; i < length; ++i) {\n    word += DecodeSingle(input[i]);\n  }\n  return word;\n}\n\nstd::vector<unsigned int>\nAlphabet::Encode(const std::string& input) const\n{\n  std::vector<unsigned int> result;\n  for (auto cp : split_into_codepoints(input)) {\n    result.push_back(EncodeSingle(cp));\n  }\n  return result;\n}\n\nbool\nUTF8Alphabet::CanEncodeSingle(const std::string& input) const\n{\n  return true;\n}\n\nbool\nUTF8Alphabet::CanEncode(const std::string& input) const\n{\n  return true;\n}\n\nstd::vector<unsigned int>\nUTF8Alphabet::Encode(const std::string& input) const\n{\n  std::vector<unsigned int> result;\n  for (auto byte_char : input) {\n    std::string byte_str(1, byte_char);\n    result.push_back(EncodeSingle(byte_str));\n  }\n  return result;\n}\n"
  },
  {
    "path": "native_client/alphabet.h",
    "content": "#ifndef ALPHABET_H\n#define ALPHABET_H\n\n#include <string>\n#include <unordered_map>\n#include <vector>\n\n/*\n * Loads a text file describing a mapping of labels to strings, one string per\n * line. This is used by the decoder, client and Python scripts to convert the\n * output of the decoder to a human-readable string and vice-versa.\n */\nclass Alphabet {\npublic:\n  Alphabet() = default;\n  Alphabet(const Alphabet&) = default;\n  Alphabet& operator=(const Alphabet&) = default;\n  virtual ~Alphabet() = default;\n\n  virtual int init(const char *config_file);\n\n  // Serialize alphabet into a binary buffer.\n  std::string Serialize();\n\n  // Deserialize alphabet from a binary buffer.\n  int Deserialize(const char* buffer, const int buffer_size);\n\n  size_t GetSize() const {\n    return size_;\n  }\n\n  bool IsSpace(unsigned int label) const {\n    return label == space_label_;\n  }\n\n  unsigned int GetSpaceLabel() const {\n    return space_label_;\n  }\n\n  // Returns true if the single character/output class has a corresponding label\n  // in the alphabet.\n  virtual bool CanEncodeSingle(const std::string& string) const;\n\n  // Returns true if the entire string can be encoded into labels in this\n  // alphabet.\n  virtual bool CanEncode(const std::string& string) const;\n\n  // Decode a single label into a string.\n  std::string DecodeSingle(unsigned int label) const;\n\n  // Encode a single character/output class into a label. Character must be in\n  // the alphabet, this method will assert that. Use `CanEncodeSingle` to test.\n  unsigned int EncodeSingle(const std::string& string) const;\n\n  // Decode a sequence of labels into a string.\n  std::string Decode(const std::vector<unsigned int>& input) const;\n\n  // We provide a C-style overload for accepting NumPy arrays as input, since\n  // the NumPy library does not have built-in typemaps for std::vector<T>.\n  std::string Decode(const unsigned int* input, int length) const;\n\n  // Encode a sequence of character/output classes into a sequence of labels.\n  // Characters are assumed to always take a single Unicode codepoint.\n  // Characters must be in the alphabet, this method will assert that. Use\n  // `CanEncode` and `CanEncodeSingle` to test.\n  virtual std::vector<unsigned int> Encode(const std::string& input) const;\n\nprotected:\n  size_t size_;\n  unsigned int space_label_;\n  std::unordered_map<unsigned int, std::string> label_to_str_;\n  std::unordered_map<std::string, unsigned int> str_to_label_;\n};\n\nclass UTF8Alphabet : public Alphabet\n{\npublic:\n  UTF8Alphabet() {\n    size_ = 255;\n    space_label_ = ' ' - 1;\n    for (size_t i = 0; i < size_; ++i) {\n      std::string val(1, i+1);\n      label_to_str_[i] = val;\n      str_to_label_[val] = i;\n    }\n  }\n\n  int init(const char*) override {\n    return 0;\n  }\n\n  bool CanEncodeSingle(const std::string& string) const override;\n  bool CanEncode(const std::string& string) const override;\n  std::vector<unsigned int> Encode(const std::string& input) const override;\n};\n\n#endif //ALPHABET_H\n"
  },
  {
    "path": "native_client/args.h",
    "content": "#ifndef __ARGS_H__\n#define __ARGS_H__\n\n#if defined(_MSC_VER)\n#include \"getopt_win.h\"\n#else\n#include <getopt.h>\n#endif\n#include <iostream>\n\n#include \"deepspeech.h\"\n\nchar* model = NULL;\n\nchar* scorer = NULL;\n\nchar* audio = NULL;\n\nbool set_beamwidth = false;\n\nint beam_width = 0;\n\nbool set_alphabeta = false;\n\nfloat lm_alpha = 0.f;\n\nfloat lm_beta = 0.f;\n\nbool show_times = false;\n\nbool has_versions = false;\n\nbool extended_metadata = false;\n\nbool json_output = false;\n\nint json_candidate_transcripts = 3;\n\nint stream_size = 0;\n\nint extended_stream_size = 0;\n\nchar* hot_words = NULL;\n\nvoid PrintHelp(const char* bin)\n{\n    std::cout <<\n    \"Usage: \" << bin << \" --model MODEL [--scorer SCORER] --audio AUDIO [-t] [-e]\\n\"\n    \"\\n\"\n    \"Running DeepSpeech inference.\\n\"\n    \"\\n\"\n    \"\\t--model MODEL\\t\\t\\tPath to the model (protocol buffer binary file)\\n\"\n    \"\\t--scorer SCORER\\t\\t\\tPath to the external scorer file\\n\"\n    \"\\t--audio AUDIO\\t\\t\\tPath to the audio file to run (WAV format)\\n\"\n    \"\\t--beam_width BEAM_WIDTH\\t\\tValue for decoder beam width (int)\\n\"\n    \"\\t--lm_alpha LM_ALPHA\\t\\tValue for language model alpha param (float)\\n\"\n    \"\\t--lm_beta LM_BETA\\t\\tValue for language model beta param (float)\\n\"\n    \"\\t-t\\t\\t\\t\\tRun in benchmark mode, output mfcc & inference time\\n\"\n    \"\\t--extended\\t\\t\\tOutput string from extended metadata\\n\"\n    \"\\t--json\\t\\t\\t\\tExtended output, shows word timings as JSON\\n\"\n    \"\\t--candidate_transcripts NUMBER\\tNumber of candidate transcripts to include in JSON output\\n\"\n    \"\\t--stream size\\t\\t\\tRun in stream mode, output intermediate results\\n\"\n    \"\\t--extended_stream size\\t\\t\\tRun in stream mode using metadata output, output intermediate results\\n\"\n    \"\\t--hot_words\\t\\t\\tHot-words and their boosts. Word:Boost pairs are comma-separated\\n\"\n    \"\\t--help\\t\\t\\t\\tShow help\\n\"\n    \"\\t--version\\t\\t\\tPrint version and exits\\n\";\n    char* version = DS_Version();\n    std::cerr << \"DeepSpeech \" << version << \"\\n\";\n    DS_FreeString(version);\n    exit(1);\n}\n\nbool ProcessArgs(int argc, char** argv)\n{\n    const char* const short_opts = \"m:l:a:b:c:d:tejs:w:vh\";\n    const option long_opts[] = {\n            {\"model\", required_argument, nullptr, 'm'},\n            {\"scorer\", required_argument, nullptr, 'l'},\n            {\"audio\", required_argument, nullptr, 'a'},\n            {\"beam_width\", required_argument, nullptr, 'b'},\n            {\"lm_alpha\", required_argument, nullptr, 'c'},\n            {\"lm_beta\", required_argument, nullptr, 'd'},\n            {\"t\", no_argument, nullptr, 't'},\n            {\"extended\", no_argument, nullptr, 'e'},\n            {\"json\", no_argument, nullptr, 'j'},\n            {\"candidate_transcripts\", required_argument, nullptr, 150},\n            {\"stream\", required_argument, nullptr, 's'},\n            {\"extended_stream\", required_argument, nullptr, 'S'},\n            {\"hot_words\", required_argument, nullptr, 'w'},\n            {\"version\", no_argument, nullptr, 'v'},\n            {\"help\", no_argument, nullptr, 'h'},\n            {nullptr, no_argument, nullptr, 0}\n    };\n\n    while (true)\n    {\n        const auto opt = getopt_long(argc, argv, short_opts, long_opts, nullptr);\n\n        if (-1 == opt)\n            break;\n\n        switch (opt)\n        {\n        case 'm':\n            model = optarg;\n            break;\n\n        case 'l':\n            scorer = optarg;\n            break;\n\n        case 'a':\n            audio = optarg;\n            break;\n\n        case 'b':\n            set_beamwidth = true;\n            beam_width = atoi(optarg);\n            break;\n\n        case 'c':\n            set_alphabeta = true;\n            lm_alpha = atof(optarg);\n            break;\n\n        case 'd':\n            set_alphabeta = true;\n            lm_beta = atof(optarg);\n            break;\n\n        case 't':\n            show_times = true;\n            break;\n\n        case 'e':\n            extended_metadata = true;\n            break;\n\n        case 'j':\n            json_output = true;\n            break;\n\n        case 150:\n            json_candidate_transcripts = atoi(optarg);\n            break;\n\n        case 's':\n            stream_size = atoi(optarg);\n            break;\n\n        case 'S':\n            extended_stream_size = atoi(optarg);\n            break;\n\n        case 'v':\n            has_versions = true;\n            break;\n\n        case 'w':\n            hot_words = optarg;\n            break;\n\n        case 'h': // -h or --help\n        case '?': // Unrecognized option\n        default:\n            PrintHelp(argv[0]);\n            break;\n        }\n    }\n\n    if (has_versions) {\n        char* version = DS_Version();\n        std::cout << \"DeepSpeech \" << version << \"\\n\";\n        DS_FreeString(version);\n        return false;\n    }\n\n    if (!model || !audio) {\n        PrintHelp(argv[0]);\n        return false;\n    }\n\n    if ((stream_size < 0 || stream_size % 160 != 0) || (extended_stream_size < 0 || extended_stream_size % 160 != 0)) {\n        std::cout <<\n        \"Stream buffer size must be multiples of 160\\n\";\n        return false;\n    }\n\n    return true;\n}\n\n#endif // __ARGS_H__\n"
  },
  {
    "path": "native_client/bazel_workspace_status_cmd.sh",
    "content": "#!/bin/bash\nset -ex\n\n# This script will be run bazel when building process starts to\n# generate key-value information that represents the status of the\n# workspace. The output should be like\n#\n# KEY1 VALUE1\n# KEY2 VALUE2\n#\n# Keys starting with STABLE_ cause dependent rules to be re-run when their value\n# changes.\n#\n# If the script exits with non-zero code, it's considered as a failure\n# and the output will be discarded.\n\n# The code below presents an implementation that works for git repository\ntf_git_rev=$(git describe --long --tags)\necho \"STABLE_TF_GIT_VERSION ${tf_git_rev}\"\n\n# use this trick to be able to use the script from anywhere\npushd $(dirname \"$0\")\nds_git_rev=$(git describe --long --tags)\necho \"STABLE_DS_GIT_VERSION ${ds_git_rev}\"\nds_version=$(cat ../training/deepspeech_training/VERSION)\necho \"STABLE_DS_VERSION ${ds_version}\"\nds_graph_version=$(cat ../training/deepspeech_training/GRAPH_VERSION)\necho \"STABLE_DS_GRAPH_VERSION ${ds_graph_version}\"\npopd\n"
  },
  {
    "path": "native_client/client.cc",
    "content": "#include <stdlib.h>\n#include <stdio.h>\n\n#include <assert.h>\n#include <errno.h>\n#include <math.h>\n#include <string.h>\n#include <time.h>\n#include <sys/types.h>\n#include <sys/stat.h>\n\n#include <sstream>\n#include <string>\n\n#ifdef __APPLE__\n#include <TargetConditionals.h>\n#endif\n\n#if defined(__ANDROID__) || defined(_MSC_VER) || TARGET_OS_IPHONE\n#define NO_SOX\n#endif\n\n#if defined(_MSC_VER)\n#define NO_DIR\n#endif\n\n#ifndef NO_SOX\n#include <sox.h>\n#endif\n\n#ifndef NO_DIR\n#include <dirent.h>\n#include <unistd.h>\n#endif // NO_DIR\n#include <vector>\n\n#include \"deepspeech.h\"\n#include \"args.h\"\n\ntypedef struct {\n  const char* string;\n  double cpu_time_overall;\n} ds_result;\n\nstruct meta_word {\n  std::string word;\n  float start_time;\n  float duration;\n};\n\nchar*\nCandidateTranscriptToString(const CandidateTranscript* transcript)\n{\n  std::string retval = \"\";\n  for (int i = 0; i < transcript->num_tokens; i++) {\n    const TokenMetadata& token = transcript->tokens[i];\n    retval += token.text;\n  }\n  return strdup(retval.c_str());\n}\n\nstd::vector<meta_word>\nCandidateTranscriptToWords(const CandidateTranscript* transcript)\n{\n  std::vector<meta_word> word_list;\n\n  std::string word = \"\";\n  float word_start_time = 0;\n\n  // Loop through each token\n  for (int i = 0; i < transcript->num_tokens; i++) {\n    const TokenMetadata& token = transcript->tokens[i];\n\n    // Append token to word if it's not a space\n    if (strcmp(token.text, u8\" \") != 0) {\n      // Log the start time of the new word\n      if (word.length() == 0) {\n        word_start_time = token.start_time;\n      }\n      word.append(token.text);\n    }\n\n    // Word boundary is either a space or the last token in the array\n    if (strcmp(token.text, u8\" \") == 0 || i == transcript->num_tokens-1) {\n      float word_duration = token.start_time - word_start_time;\n\n      if (word_duration < 0) {\n        word_duration = 0;\n      }\n\n      meta_word w;\n      w.word = word;\n      w.start_time = word_start_time;\n      w.duration = word_duration;\n\n      word_list.push_back(w);\n\n      // Reset\n      word = \"\";\n      word_start_time = 0;\n    }\n  }\n\n  return word_list;\n}\n\nstd::string\nCandidateTranscriptToJSON(const CandidateTranscript *transcript)\n{\n  std::ostringstream out_string;\n\n  std::vector<meta_word> words = CandidateTranscriptToWords(transcript);\n\n  out_string << R\"(\"metadata\":{\"confidence\":)\" << transcript->confidence << R\"(},\"words\":[)\";\n\n  for (int i = 0; i < words.size(); i++) {\n    meta_word w = words[i];\n    out_string << R\"({\"word\":\")\" << w.word << R\"(\",\"time\":)\" << w.start_time << R\"(,\"duration\":)\" << w.duration << \"}\";\n\n    if (i < words.size() - 1) {\n      out_string << \",\";\n    }\n  }\n\n  out_string << \"]\";\n\n  return out_string.str();\n}\n\nchar*\nMetadataToJSON(Metadata* result)\n{\n  std::ostringstream out_string;\n  out_string << \"{\\n\";\n\n  for (int j=0; j < result->num_transcripts; ++j) {\n    const CandidateTranscript *transcript = &result->transcripts[j];\n\n    if (j == 0) {\n      out_string << CandidateTranscriptToJSON(transcript);\n\n      if (result->num_transcripts > 1) {\n        out_string << \",\\n\" << R\"(\"alternatives\")\" << \":[\\n\";\n      }\n    } else {\n      out_string << \"{\" << CandidateTranscriptToJSON(transcript) << \"}\";\n\n      if (j < result->num_transcripts - 1) {\n        out_string << \",\\n\";\n      } else {\n        out_string << \"\\n]\";\n      }\n    }\n  }\n  \n  out_string << \"\\n}\\n\";\n\n  return strdup(out_string.str().c_str());\n}\n\nds_result\nLocalDsSTT(ModelState* aCtx, const short* aBuffer, size_t aBufferSize,\n           bool extended_output, bool json_output)\n{\n  ds_result res = {0};\n\n  clock_t ds_start_time = clock();\n\n  // sphinx-doc: c_ref_inference_start\n  if (extended_output) {\n    Metadata *result = DS_SpeechToTextWithMetadata(aCtx, aBuffer, aBufferSize, 1);\n    res.string = CandidateTranscriptToString(&result->transcripts[0]);\n    DS_FreeMetadata(result);\n  } else if (json_output) {\n    Metadata *result = DS_SpeechToTextWithMetadata(aCtx, aBuffer, aBufferSize, json_candidate_transcripts);\n    res.string = MetadataToJSON(result);\n    DS_FreeMetadata(result);\n  } else if (stream_size > 0) {\n    StreamingState* ctx;\n    int status = DS_CreateStream(aCtx, &ctx);\n    if (status != DS_ERR_OK) {\n      res.string = strdup(\"\");\n      return res;\n    }\n    size_t off = 0;\n    const char *last = nullptr;\n    const char *prev = nullptr;\n    while (off < aBufferSize) {\n      size_t cur = aBufferSize - off > stream_size ? stream_size : aBufferSize - off;\n      DS_FeedAudioContent(ctx, aBuffer + off, cur);\n      off += cur;\n      prev = last;\n      const char* partial = DS_IntermediateDecode(ctx);\n      if (last == nullptr || strcmp(last, partial)) {\n        printf(\"%s\\n\", partial);\n        last = partial;\n      } else {\n        DS_FreeString((char *) partial);\n      }\n      if (prev != nullptr && prev != last) {\n        DS_FreeString((char *) prev);\n      }\n    }\n    if (last != nullptr) {\n      DS_FreeString((char *) last);\n    }\n    res.string = DS_FinishStream(ctx);\n  } else if (extended_stream_size > 0) {\n    StreamingState* ctx;\n    int status = DS_CreateStream(aCtx, &ctx);\n    if (status != DS_ERR_OK) {\n      res.string = strdup(\"\");\n      return res;\n    }\n    size_t off = 0;\n    const char *last = nullptr;\n    const char *prev = nullptr;\n    while (off < aBufferSize) {\n      size_t cur = aBufferSize - off > extended_stream_size ? extended_stream_size : aBufferSize - off;\n      DS_FeedAudioContent(ctx, aBuffer + off, cur);\n      off += cur;\n      prev = last;\n      const Metadata* result = DS_IntermediateDecodeWithMetadata(ctx, 1);\n      const char* partial = CandidateTranscriptToString(&result->transcripts[0]);\n      if (last == nullptr || strcmp(last, partial)) {\n        printf(\"%s\\n\", partial);\n       last = partial;\n      } else {\n        free((char *) partial);\n      }\n      if (prev != nullptr && prev != last) {\n        free((char *) prev);\n      }\n      DS_FreeMetadata((Metadata *)result);\n    }\n    const Metadata* result = DS_FinishStreamWithMetadata(ctx, 1);\n    res.string = CandidateTranscriptToString(&result->transcripts[0]);\n    DS_FreeMetadata((Metadata *)result);\n    free((char *) last);\n  } else {\n    res.string = DS_SpeechToText(aCtx, aBuffer, aBufferSize);\n  }\n  // sphinx-doc: c_ref_inference_stop\n\n  clock_t ds_end_infer = clock();\n\n  res.cpu_time_overall =\n    ((double) (ds_end_infer - ds_start_time)) / CLOCKS_PER_SEC;\n\n  return res;\n}\n\ntypedef struct {\n  char*  buffer;\n  size_t buffer_size;\n} ds_audio_buffer;\n\nds_audio_buffer\nGetAudioBuffer(const char* path, int desired_sample_rate)\n{\n  ds_audio_buffer res = {0};\n\n#ifndef NO_SOX\n  sox_format_t* input = sox_open_read(path, NULL, NULL, NULL);\n  assert(input);\n\n  // Resample/reformat the audio so we can pass it through the MFCC functions\n  sox_signalinfo_t target_signal = {\n      static_cast<sox_rate_t>(desired_sample_rate), // Rate\n      1, // Channels\n      16, // Precision\n      SOX_UNSPEC, // Length\n      NULL // Effects headroom multiplier\n  };\n\n  sox_signalinfo_t interm_signal;\n\n  sox_encodinginfo_t target_encoding = {\n    SOX_ENCODING_SIGN2, // Sample format\n    16, // Bits per sample\n    0.0, // Compression factor\n    sox_option_default, // Should bytes be reversed\n    sox_option_default, // Should nibbles be reversed\n    sox_option_default, // Should bits be reversed (pairs of bits?)\n    sox_false // Reverse endianness\n  };\n\n#if TARGET_OS_OSX\n  // It would be preferable to use sox_open_memstream_write here, but OS-X\n  // doesn't support POSIX 2008, which it requires. See Issue #461.\n  // Instead, we write to a temporary file.\n  char* output_name = tmpnam(NULL);\n  assert(output_name);\n  sox_format_t* output = sox_open_write(output_name, &target_signal,\n                                        &target_encoding, \"raw\", NULL, NULL);\n#else\n  sox_format_t* output = sox_open_memstream_write(&res.buffer,\n                                                  &res.buffer_size,\n                                                  &target_signal,\n                                                  &target_encoding,\n                                                  \"raw\", NULL);\n#endif\n\n  assert(output);\n\n  if ((int)input->signal.rate < desired_sample_rate) {\n    fprintf(stderr, \"Warning: original sample rate (%d) is lower than %dkHz. \"\n                    \"Up-sampling might produce erratic speech recognition.\\n\",\n                    desired_sample_rate, (int)input->signal.rate);\n  }\n\n  // Setup the effects chain to decode/resample\n  char* sox_args[10];\n  sox_effects_chain_t* chain =\n    sox_create_effects_chain(&input->encoding, &output->encoding);\n\n  interm_signal = input->signal;\n\n  sox_effect_t* e = sox_create_effect(sox_find_effect(\"input\"));\n  sox_args[0] = (char*)input;\n  assert(sox_effect_options(e, 1, sox_args) == SOX_SUCCESS);\n  assert(sox_add_effect(chain, e, &interm_signal, &input->signal) ==\n         SOX_SUCCESS);\n  free(e);\n\n  e = sox_create_effect(sox_find_effect(\"rate\"));\n  assert(sox_effect_options(e, 0, NULL) == SOX_SUCCESS);\n  assert(sox_add_effect(chain, e, &interm_signal, &output->signal) ==\n         SOX_SUCCESS);\n  free(e);\n\n  e = sox_create_effect(sox_find_effect(\"channels\"));\n  assert(sox_effect_options(e, 0, NULL) == SOX_SUCCESS);\n  assert(sox_add_effect(chain, e, &interm_signal, &output->signal) ==\n         SOX_SUCCESS);\n  free(e);\n\n  e = sox_create_effect(sox_find_effect(\"output\"));\n  sox_args[0] = (char*)output;\n  assert(sox_effect_options(e, 1, sox_args) == SOX_SUCCESS);\n  assert(sox_add_effect(chain, e, &interm_signal, &output->signal) ==\n         SOX_SUCCESS);\n  free(e);\n\n  // Finally run the effects chain\n  sox_flow_effects(chain, NULL, NULL);\n  sox_delete_effects_chain(chain);\n\n  // Close sox handles\n  sox_close(output);\n  sox_close(input);\n#endif // NO_SOX\n\n#ifdef NO_SOX\n  // FIXME: Hack and support only mono 16-bits PCM with standard SoX header\n  FILE* wave = fopen(path, \"r\");\n\n  size_t rv;\n\n  unsigned short audio_format;\n  fseek(wave, 20, SEEK_SET); rv = fread(&audio_format, 2, 1, wave);\n\n  unsigned short num_channels;\n  fseek(wave, 22, SEEK_SET); rv = fread(&num_channels, 2, 1, wave);\n\n  unsigned int sample_rate;\n  fseek(wave, 24, SEEK_SET); rv = fread(&sample_rate, 4, 1, wave);\n\n  unsigned short bits_per_sample;\n  fseek(wave, 34, SEEK_SET); rv = fread(&bits_per_sample, 2, 1, wave);\n\n  assert(audio_format == 1); // 1 is PCM\n  assert(num_channels == 1); // MONO\n  assert(sample_rate == desired_sample_rate); // at desired sample rate\n  assert(bits_per_sample == 16); // 16 bits per sample\n\n  fprintf(stderr, \"audio_format=%d\\n\", audio_format);\n  fprintf(stderr, \"num_channels=%d\\n\", num_channels);\n  fprintf(stderr, \"sample_rate=%d (desired=%d)\\n\", sample_rate, desired_sample_rate);\n  fprintf(stderr, \"bits_per_sample=%d\\n\", bits_per_sample);\n\n  fseek(wave, 40, SEEK_SET); rv = fread(&res.buffer_size, 4, 1, wave);\n  fprintf(stderr, \"res.buffer_size=%ld\\n\", res.buffer_size);\n\n  fseek(wave, 44, SEEK_SET);\n  res.buffer = (char*)malloc(sizeof(char) * res.buffer_size);\n  rv = fread(res.buffer, sizeof(char), res.buffer_size, wave);\n\n  fclose(wave);\n#endif // NO_SOX\n\n#if TARGET_OS_OSX\n  res.buffer_size = (size_t)(output->olength * 2);\n  res.buffer = (char*)malloc(sizeof(char) * res.buffer_size);\n  FILE* output_file = fopen(output_name, \"rb\");\n  assert(fread(res.buffer, sizeof(char), res.buffer_size, output_file) == res.buffer_size);\n  fclose(output_file);\n  unlink(output_name);\n#endif\n\n  return res;\n}\n\nvoid\nProcessFile(ModelState* context, const char* path, bool show_times)\n{\n  ds_audio_buffer audio = GetAudioBuffer(path, DS_GetModelSampleRate(context));\n\n  // Pass audio to DeepSpeech\n  // We take half of buffer_size because buffer is a char* while\n  // LocalDsSTT() expected a short*\n  ds_result result = LocalDsSTT(context,\n                                (const short*)audio.buffer,\n                                audio.buffer_size / 2,\n                                extended_metadata,\n                                json_output);\n  free(audio.buffer);\n\n  if (result.string) {\n    printf(\"%s\\n\", result.string);\n    DS_FreeString((char*)result.string);\n  }\n\n  if (show_times) {\n    printf(\"cpu_time_overall=%.05f\\n\",\n           result.cpu_time_overall);\n  }\n}\n\nstd::vector<std::string>\nSplitStringOnDelim(std::string in_string, std::string delim)\n{\n  std::vector<std::string> out_vector;\n  char * tmp_str = new char[in_string.size() + 1];\n  std::copy(in_string.begin(), in_string.end(), tmp_str);\n  tmp_str[in_string.size()] = '\\0';\n  const char* token = strtok(tmp_str, delim.c_str());\n  while( token != NULL ) {\n    out_vector.push_back(token);\n    token = strtok(NULL, delim.c_str());\n  }\n  delete[] tmp_str;\n  return out_vector;\n}\n\nint\nmain(int argc, char **argv)\n{\n  if (!ProcessArgs(argc, argv)) {\n    return 1;\n  }\n\n  // Initialise DeepSpeech\n  ModelState* ctx;\n  // sphinx-doc: c_ref_model_start\n  int status = DS_CreateModel(model, &ctx);\n  if (status != 0) {\n    char* error = DS_ErrorCodeToErrorMessage(status);\n    fprintf(stderr, \"Could not create model: %s\\n\", error);\n    free(error);\n    return 1;\n  }\n\n  if (set_beamwidth) {\n    status = DS_SetModelBeamWidth(ctx, beam_width);\n    if (status != 0) {\n      fprintf(stderr, \"Could not set model beam width.\\n\");\n      return 1;\n    }\n  }\n\n  if (scorer) {\n    status = DS_EnableExternalScorer(ctx, scorer);\n    if (status != 0) {\n      fprintf(stderr, \"Could not enable external scorer.\\n\");\n      return 1;\n    }\n    if (set_alphabeta) {\n      status = DS_SetScorerAlphaBeta(ctx, lm_alpha, lm_beta);\n      if (status != 0) {\n        fprintf(stderr, \"Error setting scorer alpha and beta.\\n\");\n        return 1;\n      }\n    }\n  }\n  // sphinx-doc: c_ref_model_stop\n\n  if (hot_words) {\n    std::vector<std::string> hot_words_ = SplitStringOnDelim(hot_words, \",\");\n    for ( std::string hot_word_ : hot_words_ ) {\n      std::vector<std::string> pair_ = SplitStringOnDelim(hot_word_, \":\");\n      const char* word = (pair_[0]).c_str();\n      // the strtof function will return 0 in case of non numeric characters\n      // so, check the boost string before we turn it into a float\n      bool boost_is_valid = (pair_[1].find_first_not_of(\"-.0123456789\") == std::string::npos);\n      float boost = strtof((pair_[1]).c_str(),0);\n      status = DS_AddHotWord(ctx, word, boost);\n      if (status != 0 || !boost_is_valid) {\n        fprintf(stderr, \"Could not enable hot-word.\\n\");\n        return 1;\n      }\n    }\n  }\n\n#ifndef NO_SOX\n  // Initialise SOX\n  assert(sox_init() == SOX_SUCCESS);\n#endif\n\n  struct stat wav_info;\n  if (0 != stat(audio, &wav_info)) {\n    printf(\"Error on stat: %d\\n\", errno);\n  }\n\n  switch (wav_info.st_mode & S_IFMT) {\n#ifndef _MSC_VER\n    case S_IFLNK:\n#endif\n    case S_IFREG:\n        ProcessFile(ctx, audio, show_times);\n      break;\n\n#ifndef NO_DIR\n    case S_IFDIR:\n        {\n          printf(\"Running on directory %s\\n\", audio);\n          DIR* wav_dir = opendir(audio);\n          assert(wav_dir);\n\n          struct dirent* entry;\n          while ((entry = readdir(wav_dir)) != NULL) {\n            std::string fname = std::string(entry->d_name);\n            if (fname.find(\".wav\") == std::string::npos) {\n              continue;\n            }\n\n            std::ostringstream fullpath;\n            fullpath << audio << \"/\" << fname;\n            std::string path = fullpath.str();\n            printf(\"> %s\\n\", path.c_str());\n            ProcessFile(ctx, path.c_str(), show_times);\n          }\n          closedir(wav_dir);\n        }\n      break;\n#endif\n\n    default:\n        printf(\"Unexpected type for %s: %d\\n\", audio, (wav_info.st_mode & S_IFMT));\n      break;\n  }\n\n#ifndef NO_SOX\n  // Deinitialise and quit\n  sox_quit();\n#endif // NO_SOX\n\n  DS_FreeModel(ctx);\n\n  return 0;\n}\n"
  },
  {
    "path": "native_client/ctcdecode/COPYING",
    "content": "Decoder sources originally imported from https://github.com/parlance/ctcdecode, commit 140b45860cec6671fb0bf6dbb675073241c0f9b0\nDecoder sources are under the MIT license (LICENSE.parlance).\n\nBinding code adapted from https://github.com/PaddlePaddle/DeepSpeech/tree/develop/decoders/swig, commit 3ea19973c66a6a10320888ba47a8857bebf5abfa\nBinding code are under the Apache License (LICENSE.paddlepaddle).\n"
  },
  {
    "path": "native_client/ctcdecode/LICENSE.paddlepaddle",
    "content": "                                 Apache License\n                           Version 2.0, January 2004\n                        http://www.apache.org/licenses/\n\n   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION\n\n   1. Definitions.\n\n      \"License\" shall mean the terms and conditions for use, reproduction,\n      and distribution as defined by Sections 1 through 9 of this document.\n\n      \"Licensor\" shall mean the copyright owner or entity authorized by\n      the copyright owner that is granting the License.\n\n      \"Legal Entity\" shall mean the union of the acting entity and all\n      other entities that control, are controlled by, or are under common\n      control with that entity. For the purposes of this definition,\n      \"control\" means (i) the power, direct or indirect, to cause the\n      direction or management of such entity, whether by contract or\n      otherwise, or (ii) ownership of fifty percent (50%) or more of the\n      outstanding shares, or (iii) beneficial ownership of such entity.\n\n      \"You\" (or \"Your\") shall mean an individual or Legal Entity\n      exercising permissions granted by this License.\n\n      \"Source\" form shall mean the preferred form for making modifications,\n      including but not limited to software source code, documentation\n      source, and configuration files.\n\n      \"Object\" form shall mean any form resulting from mechanical\n      transformation or translation of a Source form, including but\n      not limited to compiled object code, generated documentation,\n      and conversions to other media types.\n\n      \"Work\" shall mean the work of authorship, whether in Source or\n      Object form, made available under the License, as indicated by a\n      copyright notice that is included in or attached to the work\n      (an example is provided in the Appendix below).\n\n      \"Derivative Works\" shall mean any work, whether in Source or Object\n      form, that is based on (or derived from) the Work and for which the\n      editorial revisions, annotations, elaborations, or other modifications\n      represent, as a whole, an original work of authorship. For the purposes\n      of this License, Derivative Works shall not include works that remain\n      separable from, or merely link (or bind by name) to the interfaces of,\n      the Work and Derivative Works thereof.\n\n      \"Contribution\" shall mean any work of authorship, including\n      the original version of the Work and any modifications or additions\n      to that Work or Derivative Works thereof, that is intentionally\n      submitted to Licensor for inclusion in the Work by the copyright owner\n      or by an individual or Legal Entity authorized to submit on behalf of\n      the copyright owner. For the purposes of this definition, \"submitted\"\n      means any form of electronic, verbal, or written communication sent\n      to the Licensor or its representatives, including but not limited to\n      communication on electronic mailing lists, source code control systems,\n      and issue tracking systems that are managed by, or on behalf of, the\n      Licensor for the purpose of discussing and improving the Work, but\n      excluding communication that is conspicuously marked or otherwise\n      designated in writing by the copyright owner as \"Not a Contribution.\"\n\n      \"Contributor\" shall mean Licensor and any individual or Legal Entity\n      on behalf of whom a Contribution has been received by Licensor and\n      subsequently incorporated within the Work.\n\n   2. Grant of Copyright License. Subject to the terms and conditions of\n      this License, each Contributor hereby grants to You a perpetual,\n      worldwide, non-exclusive, no-charge, royalty-free, irrevocable\n      copyright license to reproduce, prepare Derivative Works of,\n      publicly display, publicly perform, sublicense, and distribute the\n      Work and such Derivative Works in Source or Object form.\n\n   3. Grant of Patent License. Subject to the terms and conditions of\n      this License, each Contributor hereby grants to You a perpetual,\n      worldwide, non-exclusive, no-charge, royalty-free, irrevocable\n      (except as stated in this section) patent license to make, have made,\n      use, offer to sell, sell, import, and otherwise transfer the Work,\n      where such license applies only to those patent claims licensable\n      by such Contributor that are necessarily infringed by their\n      Contribution(s) alone or by combination of their Contribution(s)\n      with the Work to which such Contribution(s) was submitted. If You\n      institute patent litigation against any entity (including a\n      cross-claim or counterclaim in a lawsuit) alleging that the Work\n      or a Contribution incorporated within the Work constitutes direct\n      or contributory patent infringement, then any patent licenses\n      granted to You under this License for that Work shall terminate\n      as of the date such litigation is filed.\n\n   4. Redistribution. You may reproduce and distribute copies of the\n      Work or Derivative Works thereof in any medium, with or without\n      modifications, and in Source or Object form, provided that You\n      meet the following conditions:\n\n      (a) You must give any other recipients of the Work or\n          Derivative Works a copy of this License; and\n\n      (b) You must cause any modified files to carry prominent notices\n          stating that You changed the files; and\n\n      (c) You must retain, in the Source form of any Derivative Works\n          that You distribute, all copyright, patent, trademark, and\n          attribution notices from the Source form of the Work,\n          excluding those notices that do not pertain to any part of\n          the Derivative Works; and\n\n      (d) If the Work includes a \"NOTICE\" text file as part of its\n          distribution, then any Derivative Works that You distribute must\n          include a readable copy of the attribution notices contained\n          within such NOTICE file, excluding those notices that do not\n          pertain to any part of the Derivative Works, in at least one\n          of the following places: within a NOTICE text file distributed\n          as part of the Derivative Works; within the Source form or\n          documentation, if provided along with the Derivative Works; or,\n          within a display generated by the Derivative Works, if and\n          wherever such third-party notices normally appear. The contents\n          of the NOTICE file are for informational purposes only and\n          do not modify the License. You may add Your own attribution\n          notices within Derivative Works that You distribute, alongside\n          or as an addendum to the NOTICE text from the Work, provided\n          that such additional attribution notices cannot be construed\n          as modifying the License.\n\n      You may add Your own copyright statement to Your modifications and\n      may provide additional or different license terms and conditions\n      for use, reproduction, or distribution of Your modifications, or\n      for any such Derivative Works as a whole, provided Your use,\n      reproduction, and distribution of the Work otherwise complies with\n      the conditions stated in this License.\n\n   5. Submission of Contributions. Unless You explicitly state otherwise,\n      any Contribution intentionally submitted for inclusion in the Work\n      by You to the Licensor shall be under the terms and conditions of\n      this License, without any additional terms or conditions.\n      Notwithstanding the above, nothing herein shall supersede or modify\n      the terms of any separate license agreement you may have executed\n      with Licensor regarding such Contributions.\n\n   6. Trademarks. This License does not grant permission to use the trade\n      names, trademarks, service marks, or product names of the Licensor,\n      except as required for reasonable and customary use in describing the\n      origin of the Work and reproducing the content of the NOTICE file.\n\n   7. Disclaimer of Warranty. Unless required by applicable law or\n      agreed to in writing, Licensor provides the Work (and each\n      Contributor provides its Contributions) on an \"AS IS\" BASIS,\n      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or\n      implied, including, without limitation, any warranties or conditions\n      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A\n      PARTICULAR PURPOSE. You are solely responsible for determining the\n      appropriateness of using or redistributing the Work and assume any\n      risks associated with Your exercise of permissions under this License.\n\n   8. Limitation of Liability. In no event and under no legal theory,\n      whether in tort (including negligence), contract, or otherwise,\n      unless required by applicable law (such as deliberate and grossly\n      negligent acts) or agreed to in writing, shall any Contributor be\n      liable to You for damages, including any direct, indirect, special,\n      incidental, or consequential damages of any character arising as a\n      result of this License or out of the use or inability to use the\n      Work (including but not limited to damages for loss of goodwill,\n      work stoppage, computer failure or malfunction, or any and all\n      other commercial damages or losses), even if such Contributor\n      has been advised of the possibility of such damages.\n\n   9. Accepting Warranty or Additional Liability. While redistributing\n      the Work or Derivative Works thereof, You may choose to offer,\n      and charge a fee for, acceptance of support, warranty, indemnity,\n      or other liability obligations and/or rights consistent with this\n      License. However, in accepting such obligations, You may act only\n      on Your own behalf and on Your sole responsibility, not on behalf\n      of any other Contributor, and only if You agree to indemnify,\n      defend, and hold each Contributor harmless for any liability\n      incurred by, or claims asserted against, such Contributor by reason\n      of your accepting any such warranty or additional liability.\n\n   END OF TERMS AND CONDITIONS\n\n   APPENDIX: How to apply the Apache License to your work.\n\n      To apply the Apache License to your work, attach the following\n      boilerplate notice, with the fields enclosed by brackets \"[]\"\n      replaced with your own identifying information. (Don't include\n      the brackets!)  The text should be enclosed in the appropriate\n      comment syntax for the file format. We also recommend that a\n      file or class name and description of purpose be included on the\n      same \"printed page\" as the copyright notice for easier\n      identification within third-party archives.\n\n   Copyright 2018 PaddlePaddle\n   Copyright 2018 Mozilla Corporation\n\n   Licensed under the Apache License, Version 2.0 (the \"License\");\n   you may not use this file except in compliance with the License.\n   You may obtain a copy of the License at\n\n       http://www.apache.org/licenses/LICENSE-2.0\n\n   Unless required by applicable law or agreed to in writing, software\n   distributed under the License is distributed on an \"AS IS\" BASIS,\n   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n   See the License for the specific language governing permissions and\n   limitations under the License.\n"
  },
  {
    "path": "native_client/ctcdecode/LICENSE.parlance",
    "content": "MIT License\n\nCopyright (c) 2017-2018 Ryan Leary\nCopyright (c) 2018 Mozilla Corporation\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in all\ncopies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\nSOFTWARE.\n\n"
  },
  {
    "path": "native_client/ctcdecode/Makefile",
    "content": ".PHONY: bindings clean workspace_status.cc\n\ninclude ../definitions.mk\n\nNUM_PROCESSES ?= 1\nDS_SWIG_DEP ?= ds-swig # Allow to disable the ds-swig dependency, useful for GitHub Actions move\n\n# ARM64 can't find the proper libm.so without this\nifeq ($(TARGET),rpi3-armv8)\nLDFLAGS_NEEDED += $(RASPBIAN)/lib/aarch64-linux-gnu/libm.so.6\nendif\n\nifeq ($(OS),Darwin)\nGENERATE_DEBUG_SYMS := dsymutil temp_build/temp_build/ds_ctcdecoder/_swigwrapper.*.so\nelse\nGENERATE_DEBUG_SYMS :=\nendif\n\nifeq ($(findstring _NT,$(OS)),_NT)\n\tARCHIVE_EXT := lib\nelse\n\tARCHIVE_EXT := a\nendif\n\nFIRST_PARTY := first_party.$(ARCHIVE_EXT)\nTHIRD_PARTY := third_party.$(ARCHIVE_EXT)\n\n\nall: bindings\n\nclean-keep-third-party:\n\trm -rf dist temp_build ds_ctcdecoder.egg-info\n\trm -f swigwrapper_wrap.cpp swigwrapper.py $(FIRST_PARTY)\n\nclean: clean-keep-third-party\n\trm -f $(THIRD_PARTY)\n\trm workspace_status.cc\n\trm -fr bazel-out/\n\nworkspace_status.cc:\n\tmkdir -p bazel-out/ && \\\n\t\t../bazel_workspace_status_cmd.sh > bazel-out/stable-status.txt && \\\n\t\t../gen_workspace_status.sh > $@\n\n# Enforce PATH here because swig calls from build_ext looses track of some\n# variables over several runs\nbindings: clean-keep-third-party workspace_status.cc $(DS_SWIG_DEP)\n\tpython -m pip install --quiet $(PYTHON_PACKAGES) wheel==0.33.6 setuptools==45.0.0\n\tDISTUTILS_USE_SDK=1 PATH=$(DS_SWIG_BIN_PATH):$(TOOLCHAIN_DIR):$$PATH SWIG_LIB=\"$(SWIG_LIB)\" AS=$(AS) CC=$(CC) CXX=$(CXX) LD=$(LD) LIBEXE=$(LIBEXE) CFLAGS=\"$(CFLAGS) $(CXXFLAGS)\" LDFLAGS=\"$(LDFLAGS_NEEDED)\" $(PYTHON_PATH) $(NUMPY_INCLUDE) python ./setup.py build_ext --num_processes $(NUM_PROCESSES) $(PYTHON_PLATFORM_NAME) $(SETUP_FLAGS)\n\tfind temp_build -type f -name \"*.o\" -delete\n\tDISTUTILS_USE_SDK=1 AS=$(AS) CC=$(CC) CXX=$(CXX) LD=$(LD) LIBEXE=$(LIBEXE) CFLAGS=\"$(CFLAGS) $(CXXFLAGS)\" LDFLAGS=\"$(LDFLAGS_NEEDED)\" $(PYTHON_PATH) $(NUMPY_INCLUDE) python ./setup.py bdist_wheel $(PYTHON_PLATFORM_NAME) $(SETUP_FLAGS)\n\trm -rf temp_build\n\nbindings-debug: clean-keep-third-party workspace_status.cc $(DS_SWIG_DEP)\n\tpython -m pip install --quiet $(PYTHON_PACKAGES) wheel==0.33.6 setuptools==45.0.0\n\tDISTUTILS_USE_SDK=1 PATH=$(DS_SWIG_BIN_PATH):$(TOOLCHAIN_DIR):$$PATH SWIG_LIB=\"$(SWIG_LIB)\" AS=$(AS) CC=$(CC) CXX=$(CXX) LD=$(LD) LIBEXE=$(LIBEXE) CFLAGS=\"$(CFLAGS) $(CXXFLAGS) -DDEBUG\" LDFLAGS=\"$(LDFLAGS_NEEDED)\" $(PYTHON_PATH) $(NUMPY_INCLUDE) python ./setup.py build_ext --debug --num_processes $(NUM_PROCESSES) $(PYTHON_PLATFORM_NAME) $(SETUP_FLAGS)\n\t$(GENERATE_DEBUG_SYMS)\n\tfind temp_build -type f -name \"*.o\" -delete\n\tDISTUTILS_USE_SDK=1 AS=$(AS) CC=$(CC) CXX=$(CXX) LD=$(LD) LIBEXE=$(LIBEXE) CFLAGS=\"$(CFLAGS) $(CXXFLAGS) -DDEBUG\" LDFLAGS=\"$(LDFLAGS_NEEDED)\" $(PYTHON_PATH) $(NUMPY_INCLUDE) python ./setup.py bdist_wheel $(PYTHON_PLATFORM_NAME) $(SETUP_FLAGS)\n\trm -rf temp_build\n"
  },
  {
    "path": "native_client/ctcdecode/__init__.py",
    "content": "from __future__ import absolute_import, division, print_function\n\nfrom . import swigwrapper # pylint: disable=import-self\n\n# This module is built with SWIG_PYTHON_STRICT_BYTE_CHAR so we must handle\n# string encoding explicitly, here and throughout this file.\n__version__ = swigwrapper.__version__.decode('utf-8')\n\n# Hack: import error codes by matching on their names, as SWIG unfortunately\n# does not support binding enums to Python in a scoped manner yet.\nfor symbol in dir(swigwrapper):\n    if symbol.startswith('DS_ERR_'):\n        globals()[symbol] = getattr(swigwrapper, symbol)\n\nclass Scorer(swigwrapper.Scorer):\n    \"\"\"Wrapper for Scorer.\n\n    :param alpha: Language model weight.\n    :type alpha: float\n    :param beta: Word insertion bonus.\n    :type beta: float\n    :scorer_path: Path to load scorer from.\n    :alphabet: Alphabet\n    :type scorer_path: basestring\n    \"\"\"\n    def __init__(self, alpha=None, beta=None, scorer_path=None, alphabet=None):\n        super(Scorer, self).__init__()\n        # Allow bare initialization\n        if alphabet:\n            assert alpha is not None, 'alpha parameter is required'\n            assert beta is not None, 'beta parameter is required'\n            assert scorer_path, 'scorer_path parameter is required'\n\n            err = self.init(scorer_path.encode('utf-8'), alphabet)\n            if err != 0:\n                raise ValueError('Scorer initialization failed with error code 0x{:X}'.format(err))\n\n            self.reset_params(alpha, beta)\n\n\nclass Alphabet(swigwrapper.Alphabet):\n    \"\"\"Convenience wrapper for Alphabet which calls init in the constructor\"\"\"\n    def __init__(self, config_path):\n        super(Alphabet, self).__init__()\n        err = self.init(config_path.encode('utf-8'))\n        if err != 0:\n            raise ValueError('Alphabet initialization failed with error code 0x{:X}'.format(err))\n\n    def CanEncodeSingle(self, input):\n        '''\n        Returns true if the single character/output class has a corresponding label\n        in the alphabet.\n        '''\n        return super(Alphabet, self).CanEncodeSingle(input.encode('utf-8'))\n\n    def CanEncode(self, input):\n        '''\n        Returns true if the entire string can be encoded into labels in this\n        alphabet.\n        '''\n        return super(Alphabet, self).CanEncode(input.encode('utf-8'))\n\n    def EncodeSingle(self, input):\n        '''\n        Encode a single character/output class into a label. Character must be in\n        the alphabet, this method will assert that. Use `CanEncodeSingle` to test.\n        '''\n        return super(Alphabet, self).EncodeSingle(input.encode('utf-8'))\n\n    def Encode(self, input):\n        '''\n        Encode a sequence of character/output classes into a sequence of labels.\n        Characters are assumed to always take a single Unicode codepoint.\n        Characters must be in the alphabet, this method will assert that. Use\n        `CanEncode` and `CanEncodeSingle` to test.\n        '''\n        # Convert SWIG's UnsignedIntVec to a Python list\n        res = super(Alphabet, self).Encode(input.encode('utf-8'))\n        return [el for el in res]\n\n    def DecodeSingle(self, input):\n        res = super(Alphabet, self).DecodeSingle(input)\n        return res.decode('utf-8')\n\n    def Decode(self, input):\n        '''Decode a sequence of labels into a string.'''\n        res = super(Alphabet, self).Decode(input)\n        return res.decode('utf-8')\n\n\nclass UTF8Alphabet(swigwrapper.UTF8Alphabet):\n    \"\"\"Convenience wrapper for Alphabet which calls init in the constructor\"\"\"\n    def __init__(self):\n        super(UTF8Alphabet, self).__init__()\n        err = self.init(b'')\n        if err != 0:\n            raise ValueError('UTF8Alphabet initialization failed with error code 0x{:X}'.format(err))\n\n    def CanEncodeSingle(self, input):\n        '''\n        Returns true if the single character/output class has a corresponding label\n        in the alphabet.\n        '''\n        return super(UTF8Alphabet, self).CanEncodeSingle(input.encode('utf-8'))\n\n    def CanEncode(self, input):\n        '''\n        Returns true if the entire string can be encoded into labels in this\n        alphabet.\n        '''\n        return super(UTF8Alphabet, self).CanEncode(input.encode('utf-8'))\n\n    def EncodeSingle(self, input):\n        '''\n        Encode a single character/output class into a label. Character must be in\n        the alphabet, this method will assert that. Use `CanEncodeSingle` to test.\n        '''\n        return super(UTF8Alphabet, self).EncodeSingle(input.encode('utf-8'))\n\n    def Encode(self, input):\n        '''\n        Encode a sequence of character/output classes into a sequence of labels.\n        Characters are assumed to always take a single Unicode codepoint.\n        Characters must be in the alphabet, this method will assert that. Use\n        `CanEncode` and `CanEncodeSingle` to test.\n        '''\n        # Convert SWIG's UnsignedIntVec to a Python list\n        res = super(UTF8Alphabet, self).Encode(input.encode('utf-8'))\n        return [el for el in res]\n\n    def DecodeSingle(self, input):\n        res = super(UTF8Alphabet, self).DecodeSingle(input)\n        return res.decode('utf-8')\n\n    def Decode(self, input):\n        '''Decode a sequence of labels into a string.'''\n        res = super(UTF8Alphabet, self).Decode(input)\n        return res.decode('utf-8')\n\n\n\ndef ctc_beam_search_decoder(probs_seq,\n                            alphabet,\n                            beam_size,\n                            cutoff_prob=1.0,\n                            cutoff_top_n=40,\n                            scorer=None,\n                            hot_words=dict(),\n                            num_results=1):\n    \"\"\"Wrapper for the CTC Beam Search Decoder.\n\n    :param probs_seq: 2-D list of probability distributions over each time\n                      step, with each element being a list of normalized\n                      probabilities over alphabet and blank.\n    :type probs_seq: 2-D list\n    :param alphabet: Alphabet\n    :param beam_size: Width for beam search.\n    :type beam_size: int\n    :param cutoff_prob: Cutoff probability in pruning,\n                        default 1.0, no pruning.\n    :type cutoff_prob: float\n    :param cutoff_top_n: Cutoff number in pruning, only top cutoff_top_n\n                         characters with highest probs in alphabet will be\n                         used in beam search, default 40.\n    :type cutoff_top_n: int\n    :param scorer: External scorer for partially decoded sentence, e.g. word\n                   count or language model.\n    :type scorer: Scorer\n    :param hot_words: Map of words (keys) to their assigned boosts (values)\n    :type hot_words: map{string:float}\n    :param num_results: Number of beams to return.\n    :type num_results: int\n    :return: List of tuples of confidence and sentence as decoding\n             results, in descending order of the confidence.\n    :rtype: list\n    \"\"\"\n    beam_results = swigwrapper.ctc_beam_search_decoder(\n        probs_seq, alphabet, beam_size, cutoff_prob, cutoff_top_n,\n        scorer, hot_words, num_results)\n    beam_results = [(res.confidence, alphabet.Decode(res.tokens)) for res in beam_results]\n    return beam_results\n\n\ndef ctc_beam_search_decoder_batch(probs_seq,\n                                  seq_lengths,\n                                  alphabet,\n                                  beam_size,\n                                  num_processes,\n                                  cutoff_prob=1.0,\n                                  cutoff_top_n=40,\n                                  scorer=None,\n                                  hot_words=dict(),\n                                  num_results=1):\n    \"\"\"Wrapper for the batched CTC beam search decoder.\n\n    :param probs_seq: 3-D list with each element as an instance of 2-D list\n                      of probabilities used by ctc_beam_search_decoder().\n    :type probs_seq: 3-D list\n    :param alphabet: alphabet list.\n    :alphabet: Alphabet\n    :param beam_size: Width for beam search.\n    :type beam_size: int\n    :param num_processes: Number of parallel processes.\n    :type num_processes: int\n    :param cutoff_prob: Cutoff probability in alphabet pruning,\n                        default 1.0, no pruning.\n    :type cutoff_prob: float\n    :param cutoff_top_n: Cutoff number in pruning, only top cutoff_top_n\n                         characters with highest probs in alphabet will be\n                         used in beam search, default 40.\n    :type cutoff_top_n: int\n    :param num_processes: Number of parallel processes.\n    :type num_processes: int\n    :param scorer: External scorer for partially decoded sentence, e.g. word\n                   count or language model.\n    :type scorer: Scorer\n    :param hot_words: Map of words (keys) to their assigned boosts (values)\n    :type hot_words: map{string:float}\n    :param num_results: Number of beams to return.\n    :type num_results: int\n    :return: List of tuples of confidence and sentence as decoding\n             results, in descending order of the confidence.\n    :rtype: list\n    \"\"\"\n    batch_beam_results = swigwrapper.ctc_beam_search_decoder_batch(probs_seq, seq_lengths, alphabet, beam_size, num_processes, cutoff_prob, cutoff_top_n, scorer, hot_words, num_results)\n    batch_beam_results = [\n        [(res.confidence, alphabet.Decode(res.tokens)) for res in beam_results]\n        for beam_results in batch_beam_results\n    ]\n    return batch_beam_results\n"
  },
  {
    "path": "native_client/ctcdecode/build_archive.py",
    "content": "#!/usr/bin/env python\nfrom __future__ import absolute_import, division, print_function\n\nimport glob\nimport os\nimport shlex\nimport subprocess\nimport sys\n\nfrom multiprocessing.dummy import Pool\n\nif sys.platform.startswith('win'):\n    ARGS = ['/nologo', '/D KENLM_MAX_ORDER=6', '/EHsc', '/source-charset:utf-8']\n    OPT_ARGS = ['/O2', '/MT', '/D NDEBUG']\n    DBG_ARGS = ['/Od', '/MTd', '/Zi', '/U NDEBUG', '/D DEBUG']\n    OPENFST_DIR = 'third_party/openfst-1.6.9-win'\nelse:\n    ARGS = ['-fPIC', '-DKENLM_MAX_ORDER=6', '-std=c++11', '-Wno-unused-local-typedefs', '-Wno-sign-compare']\n    OPT_ARGS = ['-O3', '-DNDEBUG']\n    DBG_ARGS = ['-O0', '-g', '-UNDEBUG', '-DDEBUG']\n    OPENFST_DIR = 'third_party/openfst-1.6.7'\n\n\n\nINCLUDES = [\n    '..',\n    '../kenlm',\n    OPENFST_DIR + '/src/include',\n    'third_party/ThreadPool',\n    'third_party/object_pool'\n]\n\nKENLM_FILES = (glob.glob('../kenlm/util/*.cc')\n                + glob.glob('../kenlm/lm/*.cc')\n                + glob.glob('../kenlm/util/double-conversion/*.cc'))\n\nKENLM_FILES += glob.glob(OPENFST_DIR + '/src/lib/*.cc')\n\nKENLM_FILES = [\n    fn for fn in KENLM_FILES\n    if not (fn.endswith('main.cc') or fn.endswith('test.cc') or fn.endswith(\n        'unittest.cc'))\n]\n\nCTC_DECODER_FILES = [\n    'ctc_beam_search_decoder.cpp',\n    'scorer.cpp',\n    'path_trie.cpp',\n    'decoder_utils.cpp',\n    'workspace_status.cc',\n    '../alphabet.cc',\n]\n\ndef build_archive(srcs=[], out_name='', build_dir='temp_build/temp_build', debug=False, num_parallel=1):\n    compiler = os.environ.get('CXX', 'g++')\n    if sys.platform.startswith('win'):\n        compiler = '\"{}\"'.format(compiler)\n    ar = os.environ.get('AR', 'ar')\n    libexe = os.environ.get('LIBEXE', 'lib.exe')\n    libtool = os.environ.get('LIBTOOL', 'libtool')\n    cflags = os.environ.get('CFLAGS', '') + os.environ.get('CXXFLAGS', '')\n    args = ARGS + (DBG_ARGS if debug else OPT_ARGS)\n\n    for file in srcs:\n        outfile = os.path.join(build_dir, os.path.splitext(file)[0] + '.o')\n        outdir = os.path.dirname(outfile)\n        if not os.path.exists(outdir):\n            print('mkdir', outdir)\n            os.makedirs(outdir)\n\n    def build_one(file):\n        outfile = os.path.join(build_dir, os.path.splitext(file)[0] + '.o')\n        if os.path.exists(outfile):\n            return\n\n        if sys.platform.startswith('win'):\n            file = '\"{}\"'.format(file.replace('\\\\', '/'))\n            output = '/Fo\"{}\"'.format(outfile.replace('\\\\', '/'))\n        else:\n            output = '-o ' + outfile\n\n        cmd = '{cc} -c {cflags} {args} {includes} {infile} {output}'.format(\n            cc=compiler,\n            cflags=cflags,\n            args=' '.join(args),\n            includes=' '.join('-I' + i for i in INCLUDES),\n            infile=file,\n            output=output,\n        )\n        print(cmd)\n        subprocess.check_call(shlex.split(cmd))\n        return outfile\n\n    pool = Pool(num_parallel)\n    obj_files = list(pool.imap_unordered(build_one, srcs))\n\n    if sys.platform.startswith('darwin'):\n        cmd = '{libtool} -static -o {outfile} {infiles}'.format(\n            libtool=libtool,\n            outfile=out_name,\n            infiles=' '.join(obj_files),\n        )\n        print(cmd)\n        subprocess.check_call(shlex.split(cmd))\n    elif sys.platform.startswith('win'):\n        cmd = '\"{libexe}\" /OUT:\"{outfile}\" {infiles} /MACHINE:X64 /NOLOGO'.format(\n            libexe=libexe,\n            outfile=out_name,\n            infiles=' '.join(obj_files))\n        cmd = cmd.replace('\\\\', '/')\n        print(cmd)\n        subprocess.check_call(shlex.split(cmd))\n    else:\n        cmd = '{ar} rcs {outfile} {infiles}'.format(\n            ar=ar,\n            outfile=out_name,\n            infiles=' '.join(obj_files)\n        )\n        print(cmd)\n        subprocess.check_call(shlex.split(cmd))\n\nif __name__ == '__main__':\n    build_common()\n"
  },
  {
    "path": "native_client/ctcdecode/ctc_beam_search_decoder.cpp",
    "content": "#include \"ctc_beam_search_decoder.h\"\n\n#include <algorithm>\n#include <cmath>\n#include <iostream>\n#include <limits>\n#include <unordered_map>\n#include <utility>\n\n#include \"decoder_utils.h\"\n#include \"ThreadPool.h\"\n#include \"fst/fstlib.h\"\n#include \"path_trie.h\"\n\n\nint\nDecoderState::init(const Alphabet& alphabet,\n                   size_t beam_size,\n                   double cutoff_prob,\n                   size_t cutoff_top_n,\n                   std::shared_ptr<Scorer> ext_scorer,\n                   std::unordered_map<std::string, float> hot_words)\n{\n  // assign special ids\n  abs_time_step_ = 0;\n  space_id_ = alphabet.GetSpaceLabel();\n  blank_id_ = alphabet.GetSize();\n\n  beam_size_ = beam_size;\n  cutoff_prob_ = cutoff_prob;\n  cutoff_top_n_ = cutoff_top_n;\n  ext_scorer_ = ext_scorer;\n  hot_words_ = hot_words;\n  start_expanding_ = false;\n\n  // init prefixes' root\n  PathTrie *root = new PathTrie;\n  root->score = root->log_prob_b_prev = 0.0;\n  prefix_root_.reset(root);\n  prefix_root_->timesteps = &timestep_tree_root_;\n  prefixes_.push_back(root);\n\n  if (ext_scorer && (bool)(ext_scorer_->dictionary)) {\n    // no need for std::make_shared<>() since Copy() does 'new' behind the doors\n    auto dict_ptr = std::shared_ptr<PathTrie::FstType>(ext_scorer->dictionary->Copy(true));\n    root->set_dictionary(dict_ptr);\n    auto matcher = std::make_shared<fst::SortedMatcher<PathTrie::FstType>>(*dict_ptr, fst::MATCH_INPUT);\n    root->set_matcher(matcher);\n  }\n\n  return 0;\n}\n\nvoid\nDecoderState::next(const double *probs,\n                   int time_dim,\n                   int class_dim)\n{\n  // prefix search over time\n  for (size_t rel_time_step = 0; rel_time_step < time_dim; ++rel_time_step, ++abs_time_step_) {\n    auto *prob = &probs[rel_time_step*class_dim];\n\n    // At the start of the decoding process, we delay beam expansion so that\n    // timings on the first letters is not incorrect. As soon as we see a\n    // timestep with blank probability lower than 0.999, we start expanding\n    // beams.\n    if (prob[blank_id_] < 0.999) {\n      start_expanding_ = true;\n    }\n\n    // If not expanding yet, just continue to next timestep.\n    if (!start_expanding_) {\n      continue;\n    }\n\n    float min_cutoff = -NUM_FLT_INF;\n    bool full_beam = false;\n    if (ext_scorer_) {\n      size_t num_prefixes = std::min(prefixes_.size(), beam_size_);\n      std::partial_sort(prefixes_.begin(),\n                        prefixes_.begin() + num_prefixes,\n                        prefixes_.end(),\n                        prefix_compare);\n\n      min_cutoff = prefixes_[num_prefixes - 1]->score +\n                   std::log(prob[blank_id_]) - std::max(0.0, ext_scorer_->beta);\n      full_beam = (num_prefixes == beam_size_);\n    }\n\n    std::vector<std::pair<size_t, float>> log_prob_idx =\n        get_pruned_log_probs(prob, class_dim, cutoff_prob_, cutoff_top_n_);\n    // loop over class dim\n    for (size_t index = 0; index < log_prob_idx.size(); index++) {\n      auto c = log_prob_idx[index].first;\n      auto log_prob_c = log_prob_idx[index].second;\n\n      for (size_t i = 0; i < prefixes_.size() && i < beam_size_; ++i) {\n        auto prefix = prefixes_[i];\n        if (full_beam && log_prob_c + prefix->score < min_cutoff) {\n          break;\n        }\n        if (prefix->score == -NUM_FLT_INF) {\n          continue;\n        }\n        assert(prefix->timesteps != nullptr);\n\n        // blank\n        if (c == blank_id_) {\n          // compute probability of current path\n          float log_p = log_prob_c + prefix->score;\n\n          // combine current path with previous ones with the same prefix\n          // the blank label comes last, so we can compare log_prob_nb_cur with log_p\n          if (prefix->log_prob_nb_cur < log_p) {\n            // keep current timesteps\n            prefix->previous_timesteps = nullptr;\n          }\n          prefix->log_prob_b_cur =\n              log_sum_exp(prefix->log_prob_b_cur, log_p);\n          continue;\n        }\n\n        // repeated character\n        if (c == prefix->character) {\n          // compute probability of current path\n          float log_p = log_prob_c + prefix->log_prob_nb_prev;\n\n          // combine current path with previous ones with the same prefix\n          if (prefix->log_prob_nb_cur < log_p) {\n            // keep current timesteps\n            prefix->previous_timesteps = nullptr;\n          }\n          prefix->log_prob_nb_cur = log_sum_exp(\n              prefix->log_prob_nb_cur, log_p);\n        }\n\n        // get new prefix\n        auto prefix_new = prefix->get_path_trie(c, log_prob_c);\n\n        if (prefix_new != nullptr) {\n          // compute probability of current path\n          float log_p = -NUM_FLT_INF;\n\n          if (c == prefix->character &&\n              prefix->log_prob_b_prev > -NUM_FLT_INF) {\n            log_p = log_prob_c + prefix->log_prob_b_prev;\n          } else if (c != prefix->character) {\n            log_p = log_prob_c + prefix->score;\n          }\n\n          if (ext_scorer_) {\n            // skip scoring the space in word based LMs\n            PathTrie* prefix_to_score;\n            if (ext_scorer_->is_utf8_mode()) {\n              prefix_to_score = prefix_new;\n            } else {\n              prefix_to_score = prefix;\n            }\n\n            // language model scoring\n            if (ext_scorer_->is_scoring_boundary(prefix_to_score, c)) {\n              float score = 0.0;\n              std::vector<std::string> ngram;\n              ngram = ext_scorer_->make_ngram(prefix_to_score);\n\n              float hot_boost = 0.0;\n              if (!hot_words_.empty()) {\n                std::unordered_map<std::string, float>::iterator iter;\n                // increase prob of prefix for every word\n                // that matches a word in the hot-words list\n                for (std::string word : ngram) {\n                  iter = hot_words_.find(word);\n                  if ( iter != hot_words_.end() ) {\n                    // increase the log_cond_prob(prefix|LM)\n                    hot_boost += iter->second;\n                  }\n                }\n              }\n\n              bool bos = ngram.size() < ext_scorer_->get_max_order();\n              score = ( ext_scorer_->get_log_cond_prob(ngram, bos) + hot_boost ) * ext_scorer_->alpha;\n              log_p += score;\n              log_p += ext_scorer_->beta;\n            }\n          }\n\n          // combine current path with previous ones with the same prefix\n          if (prefix_new->log_prob_nb_cur < log_p) {\n            // record data needed to update timesteps\n            // the actual update will be done if nothing better is found\n            prefix_new->previous_timesteps = prefix->timesteps;\n            prefix_new->new_timestep = abs_time_step_;\n          }\n          prefix_new->log_prob_nb_cur =\n              log_sum_exp(prefix_new->log_prob_nb_cur, log_p);\n        }\n      }  // end of loop over prefix\n    }    // end of loop over alphabet\n\n    // update log probs\n    prefixes_.clear();\n    prefix_root_->iterate_to_vec(prefixes_);\n\n    // only preserve top beam_size prefixes\n    if (prefixes_.size() > beam_size_) {\n      std::nth_element(prefixes_.begin(),\n                       prefixes_.begin() + beam_size_,\n                       prefixes_.end(),\n                       prefix_compare);\n      for (size_t i = beam_size_; i < prefixes_.size(); ++i) {\n        prefixes_[i]->remove();\n      }\n\n      // Remove the elements from std::vector\n      prefixes_.resize(beam_size_);\n    }\n  }  // end of loop over time\n}\n\nstd::vector<Output>\nDecoderState::decode(size_t num_results) const\n{\n  std::vector<PathTrie*> prefixes_copy = prefixes_;\n  std::unordered_map<const PathTrie*, float> scores;\n  for (PathTrie* prefix : prefixes_copy) {\n    scores[prefix] = prefix->score;\n  }\n\n  // score the last word of each prefix that doesn't end with space\n  if (ext_scorer_) {\n    for (size_t i = 0; i < beam_size_ && i < prefixes_copy.size(); ++i) {\n      PathTrie* prefix = prefixes_copy[i];\n      PathTrie* prefix_boundary = ext_scorer_->is_utf8_mode() ? prefix : prefix->parent;\n      if (prefix_boundary && !ext_scorer_->is_scoring_boundary(prefix_boundary, prefix->character)) {\n        float score = 0.0;\n        std::vector<std::string> ngram = ext_scorer_->make_ngram(prefix);\n        bool bos = ngram.size() < ext_scorer_->get_max_order();\n        score = ext_scorer_->get_log_cond_prob(ngram, bos) * ext_scorer_->alpha;\n        score += ext_scorer_->beta;\n        scores[prefix] += score;\n      }\n    }\n  }\n\n  using namespace std::placeholders;\n  size_t num_returned = std::min(prefixes_copy.size(), num_results);\n  std::partial_sort(prefixes_copy.begin(),\n                    prefixes_copy.begin() + num_returned,\n                    prefixes_copy.end(),\n                    std::bind(prefix_compare_external, _1, _2, scores));\n\n  std::vector<Output> outputs;\n  outputs.reserve(num_returned);\n\n  for (size_t i = 0; i < num_returned; ++i) {\n    Output output;\n    prefixes_copy[i]->get_path_vec(output.tokens);\n    output.timesteps  = get_history(prefixes_copy[i]->timesteps, &timestep_tree_root_);\n    assert(output.tokens.size() == output.timesteps.size());\n    output.confidence = scores[prefixes_copy[i]];\n    outputs.push_back(output);\n  }\n\n  return outputs;\n}\n\nstd::vector<Output> ctc_beam_search_decoder(\n    const double *probs,\n    int time_dim,\n    int class_dim,\n    const Alphabet &alphabet,\n    size_t beam_size,\n    double cutoff_prob,\n    size_t cutoff_top_n,\n    std::shared_ptr<Scorer> ext_scorer,\n    std::unordered_map<std::string, float> hot_words,\n    size_t num_results)\n{\n  VALID_CHECK_EQ(alphabet.GetSize()+1, class_dim, \"Number of output classes in acoustic model does not match number of labels in the alphabet file. Alphabet file must be the same one that was used to train the acoustic model.\");\n  DecoderState state;\n  state.init(alphabet, beam_size, cutoff_prob, cutoff_top_n, ext_scorer, hot_words);\n  state.next(probs, time_dim, class_dim);\n  return state.decode(num_results);\n}\n\nstd::vector<std::vector<Output>>\nctc_beam_search_decoder_batch(\n    const double *probs,\n    int batch_size,\n    int time_dim,\n    int class_dim,\n    const int* seq_lengths,\n    int seq_lengths_size,\n    const Alphabet &alphabet,\n    size_t beam_size,\n    size_t num_processes,\n    double cutoff_prob,\n    size_t cutoff_top_n,\n    std::shared_ptr<Scorer> ext_scorer,\n    std::unordered_map<std::string, float> hot_words,\n    size_t num_results)\n{\n  VALID_CHECK_GT(num_processes, 0, \"num_processes must be nonnegative!\");\n  VALID_CHECK_EQ(batch_size, seq_lengths_size, \"must have one sequence length per batch element\");\n  // thread pool\n  ThreadPool pool(num_processes);\n\n  // enqueue the tasks of decoding\n  std::vector<std::future<std::vector<Output>>> res;\n  for (size_t i = 0; i < batch_size; ++i) {\n    res.emplace_back(pool.enqueue(ctc_beam_search_decoder,\n                                  &probs[i*time_dim*class_dim],\n                                  seq_lengths[i],\n                                  class_dim,\n                                  alphabet,\n                                  beam_size,\n                                  cutoff_prob,\n                                  cutoff_top_n,\n                                  ext_scorer,\n                                  hot_words,\n                                  num_results));\n  }\n\n  // get decoding results\n  std::vector<std::vector<Output>> batch_results;\n  for (size_t i = 0; i < batch_size; ++i) {\n    batch_results.emplace_back(res[i].get());\n  }\n  return batch_results;\n}\n"
  },
  {
    "path": "native_client/ctcdecode/ctc_beam_search_decoder.h",
    "content": "#ifndef CTC_BEAM_SEARCH_DECODER_H_\n#define CTC_BEAM_SEARCH_DECODER_H_\n\n#include <memory>\n#include <string>\n#include <vector>\n\n#include \"scorer.h\"\n#include \"output.h\"\n#include \"alphabet.h\"\n\nclass DecoderState {\n  int abs_time_step_;\n  int space_id_;\n  int blank_id_;\n  size_t beam_size_;\n  double cutoff_prob_;\n  size_t cutoff_top_n_;\n  bool start_expanding_;\n\n  std::shared_ptr<Scorer> ext_scorer_;\n  std::vector<PathTrie*> prefixes_;\n  std::unique_ptr<PathTrie> prefix_root_;\n  TimestepTreeNode timestep_tree_root_{nullptr, 0};\n  std::unordered_map<std::string, float> hot_words_;\n\npublic:\n  DecoderState() = default;\n  ~DecoderState() = default;\n\n  // Disallow copying\n  DecoderState(const DecoderState&) = delete;\n  DecoderState& operator=(DecoderState&) = delete;\n\n  /* Initialize CTC beam search decoder\n   *\n   * Parameters:\n   *     alphabet: The alphabet.\n   *     beam_size: The width of beam search.\n   *     cutoff_prob: Cutoff probability for pruning.\n   *     cutoff_top_n: Cutoff number for pruning.\n   *     ext_scorer: External scorer to evaluate a prefix, which consists of\n   *                 n-gram language model scoring and word insertion term.\n   *                 Default null, decoding the input sample without scorer.\n   * Return:\n   *     Zero on success, non-zero on failure.\n  */\n  int init(const Alphabet& alphabet,\n           size_t beam_size,\n           double cutoff_prob,\n           size_t cutoff_top_n,\n           std::shared_ptr<Scorer> ext_scorer,\n           std::unordered_map<std::string, float> hot_words);\n\n  /* Send data to the decoder\n   *\n   * Parameters:\n   *     probs: 2-D vector where each element is a vector of probabilities\n   *               over alphabet of one time step.\n   *     time_dim: Number of timesteps.\n   *     class_dim: Number of classes (alphabet length + 1 for space character).\n  */\n  void next(const double *probs,\n            int time_dim,\n            int class_dim);\n\n  /* Get up to num_results transcriptions from current decoder state.\n   *\n   * Parameters:\n   *     num_results: Number of beams to return.\n   *\n   * Return:\n   *     A vector where each element is a pair of score and decoding result,\n   *     in descending order.\n  */\n  std::vector<Output> decode(size_t num_results=1) const;\n};\n\n\n/* CTC Beam Search Decoder\n * Parameters:\n *     probs: 2-D vector where each element is a vector of probabilities\n *            over alphabet of one time step.\n *     time_dim: Number of timesteps.\n *     class_dim: Alphabet length (plus 1 for space character).\n *     alphabet: The alphabet.\n *     beam_size: The width of beam search.\n *     cutoff_prob: Cutoff probability for pruning.\n *     cutoff_top_n: Cutoff number for pruning.\n *     ext_scorer: External scorer to evaluate a prefix, which consists of\n *                 n-gram language model scoring and word insertion term.\n *                 Default null, decoding the input sample without scorer.\n *     hot_words: A map of hot-words and their corresponding boosts\n *                The hot-word is a string and the boost is a float.\n *     num_results: Number of beams to return.\n * Return:\n *     A vector where each element is a pair of score and decoding result,\n *     in descending order.\n*/\n\nstd::vector<Output> ctc_beam_search_decoder(\n    const double* probs,\n    int time_dim,\n    int class_dim,\n    const Alphabet &alphabet,\n    size_t beam_size,\n    double cutoff_prob,\n    size_t cutoff_top_n,\n    std::shared_ptr<Scorer> ext_scorer,\n    std::unordered_map<std::string, float> hot_words,\n    size_t num_results=1);\n\n/* CTC Beam Search Decoder for batch data\n * Parameters:\n *     probs: 3-D vector where each element is a 2-D vector that can be used\n *                by ctc_beam_search_decoder().\n *     alphabet: The alphabet.\n *     beam_size: The width of beam search.\n *     num_processes: Number of threads for beam search.\n *     cutoff_prob: Cutoff probability for pruning.\n *     cutoff_top_n: Cutoff number for pruning.\n *     ext_scorer: External scorer to evaluate a prefix, which consists of\n *                 n-gram language model scoring and word insertion term.\n *                 Default null, decoding the input sample without scorer.\n *     hot_words: A map of hot-words and their corresponding boosts\n *                The hot-word is a string and the boost is a float.\n *     num_results: Number of beams to return.\n * Return:\n *     A 2-D vector where each element is a vector of beam search decoding\n *     result for one audio sample.\n*/\nstd::vector<std::vector<Output>>\nctc_beam_search_decoder_batch(\n    const double* probs,\n    int batch_size,\n    int time_dim,\n    int class_dim,\n    const int* seq_lengths,\n    int seq_lengths_size,\n    const Alphabet &alphabet,\n    size_t beam_size,\n    size_t num_processes,\n    double cutoff_prob,\n    size_t cutoff_top_n,\n    std::shared_ptr<Scorer> ext_scorer,\n    std::unordered_map<std::string, float> hot_words,\n    size_t num_results=1);\n\n#endif  // CTC_BEAM_SEARCH_DECODER_H_\n"
  },
  {
    "path": "native_client/ctcdecode/decoder_utils.cpp",
    "content": "#include \"decoder_utils.h\"\n\n#include <algorithm>\n#include <cmath>\n#include <limits>\n\nstd::vector<std::pair<size_t, float>> get_pruned_log_probs(\n    const double *prob_step,\n    size_t class_dim,\n    double cutoff_prob,\n    size_t cutoff_top_n) {\n  std::vector<std::pair<int, double>> prob_idx;\n  for (size_t i = 0; i < class_dim; ++i) {\n    prob_idx.push_back(std::pair<int, double>(i, prob_step[i]));\n  }\n  // pruning of vacobulary\n  size_t cutoff_len = class_dim;\n  if (cutoff_prob < 1.0 || cutoff_top_n < cutoff_len) {\n    std::sort(\n        prob_idx.begin(), prob_idx.end(), pair_comp_second_rev<int, double>);\n    if (cutoff_prob < 1.0) {\n      double cum_prob = 0.0;\n      cutoff_len = 0;\n      for (size_t i = 0; i < prob_idx.size(); ++i) {\n        cum_prob += prob_idx[i].second;\n        cutoff_len += 1;\n        if (cum_prob >= cutoff_prob || cutoff_len >= cutoff_top_n) break;\n      }\n    }\n    prob_idx = std::vector<std::pair<int, double>>(\n        prob_idx.begin(), prob_idx.begin() + cutoff_len);\n  }\n  std::vector<std::pair<size_t, float>> log_prob_idx;\n  for (size_t i = 0; i < cutoff_len; ++i) {\n    log_prob_idx.push_back(std::pair<int, float>(\n        prob_idx[i].first, log(prob_idx[i].second + NUM_FLT_MIN)));\n  }\n  return log_prob_idx;\n}\n\nsize_t get_utf8_str_len(const std::string &str) {\n  size_t str_len = 0;\n  for (char c : str) {\n    str_len += ((c & 0xc0) != 0x80);\n  }\n  return str_len;\n}\n\nstd::vector<std::string> split_into_codepoints(const std::string &str) {\n  std::vector<std::string> result;\n  std::string out_str;\n\n  for (char c : str) {\n    if (byte_is_codepoint_boundary(c)) {\n      if (!out_str.empty()) {\n        result.push_back(out_str);\n        out_str.clear();\n      }\n    }\n\n    out_str.append(1, c);\n  }\n  result.push_back(out_str);\n  return result;\n}\n\nstd::vector<std::string> split_into_bytes(const std::string &str) {\n  std::vector<std::string> result;\n\n  for (char c : str) {\n    std::string ch(1, c);\n    result.push_back(ch);\n  }\n\n  return result;\n}\n\nstd::vector<std::string> split_str(const std::string &s,\n                                   const std::string &delim) {\n  std::vector<std::string> result;\n  std::size_t start = 0, delim_len = delim.size();\n  while (true) {\n    std::size_t end = s.find(delim, start);\n    if (end == std::string::npos) {\n      if (start < s.size()) {\n        result.push_back(s.substr(start));\n      }\n      break;\n    }\n    if (end > start) {\n      result.push_back(s.substr(start, end - start));\n    }\n    start = end + delim_len;\n  }\n  return result;\n}\n\nbool prefix_compare(const PathTrie *x, const PathTrie *y) {\n  if (x->score == y->score) {\n    if (x->character == y->character) {\n      return false;\n    } else {\n      return (x->character < y->character);\n    }\n  } else {\n    return x->score > y->score;\n  }\n}\n\nbool prefix_compare_external(const PathTrie *x, const PathTrie *y, const std::unordered_map<const PathTrie*, float>& scores) {\n  if (scores.at(x) == scores.at(y)) {\n    if (x->character == y->character) {\n      return false;\n    } else {\n      return (x->character < y->character);\n    }\n  } else {\n    return scores.at(x) > scores.at(y);\n  }\n}\n\nvoid add_word_to_fst(const std::vector<unsigned int> &word,\n                     fst::StdVectorFst *dictionary) {\n  if (dictionary->NumStates() == 0) {\n    fst::StdVectorFst::StateId start = dictionary->AddState();\n    assert(start == 0);\n    dictionary->SetStart(start);\n  }\n  fst::StdVectorFst::StateId src = dictionary->Start();\n  fst::StdVectorFst::StateId dst;\n  for (auto c : word) {\n    dst = dictionary->AddState();\n    dictionary->AddArc(src, fst::StdArc(c, c, 0, dst));\n    src = dst;\n  }\n  dictionary->SetFinal(dst, fst::StdArc::Weight::One());\n}\n\nbool add_word_to_dictionary(\n    const std::string &word,\n    const std::unordered_map<std::string, int> &char_map,\n    bool utf8,\n    int SPACE_ID,\n    fst::StdVectorFst *dictionary) {\n  auto characters = utf8 ? split_into_bytes(word) : split_into_codepoints(word);\n\n  std::vector<unsigned int> int_word;\n\n  for (auto &c : characters) {\n    auto int_c = char_map.find(c);\n    if (int_c != char_map.end()) {\n      int_word.push_back(int_c->second);\n    } else {\n      return false;  // return without adding\n    }\n  }\n\n  if (!utf8) {\n    int_word.push_back(SPACE_ID);\n  }\n\n  add_word_to_fst(int_word, dictionary);\n  return true;  // return with successful adding\n}"
  },
  {
    "path": "native_client/ctcdecode/decoder_utils.h",
    "content": "#ifndef DECODER_UTILS_H_\n#define DECODER_UTILS_H_\n\n#include <utility>\n#include <vector>\n\n#include \"fst/log.h\"\n#include \"path_trie.h\"\n#include \"output.h\"\n\nconst float NUM_FLT_INF  = std::numeric_limits<float>::max();\nconst float NUM_FLT_MIN  = std::numeric_limits<float>::min();\nconst float NUM_FLT_LOGE = 0.4342944819;\n\n// inline function for validation check\ninline void check(\n    bool x, const char *expr, const char *file, int line, const char *err) {\n  if (!x) {\n    std::cerr << \"[\" << file << \":\" << line << \"] \";\n    LOG(FATAL) << \"\\\"\" << expr << \"\\\" check failed. \" << err;\n  }\n}\n\n#define VALID_CHECK(x, info) \\\n  check(static_cast<bool>(x), #x, __FILE__, __LINE__, info)\n#define VALID_CHECK_EQ(x, y, info) VALID_CHECK((x) == (y), info)\n#define VALID_CHECK_GT(x, y, info) VALID_CHECK((x) > (y), info)\n#define VALID_CHECK_LT(x, y, info) VALID_CHECK((x) < (y), info)\n\n\n// Function template for comparing two pairs\ntemplate <typename T1, typename T2>\nbool pair_comp_first_rev(const std::pair<T1, T2> &a,\n                         const std::pair<T1, T2> &b) {\n  return a.first > b.first;\n}\n\n// Function template for comparing two pairs\ntemplate <typename T1, typename T2>\nbool pair_comp_second_rev(const std::pair<T1, T2> &a,\n                          const std::pair<T1, T2> &b) {\n  return a.second > b.second;\n}\n\n// Return the sum of two probabilities in log scale\ntemplate <typename T>\nT log_sum_exp(const T &x, const T &y) {\n  static T num_min = -std::numeric_limits<T>::max();\n  if (x <= num_min) return y;\n  if (y <= num_min) return x;\n  T xmax = std::max(x, y);\n  return std::log(std::exp(x - xmax) + std::exp(y - xmax)) + xmax;\n}\n\n// Get pruned probability vector for each time step's beam search\nstd::vector<std::pair<size_t, float>> get_pruned_log_probs(\n    const double *prob_step,\n    size_t class_dim,\n    double cutoff_prob,\n    size_t cutoff_top_n);\n\n// Functor for prefix comparsion\nbool prefix_compare(const PathTrie *x, const PathTrie *y);\n\nbool prefix_compare_external(const PathTrie *x, const PathTrie *y, const std::unordered_map<const PathTrie*, float>& scores);\n\n/* Get length of utf8 encoding string\n * See: http://stackoverflow.com/a/4063229\n */\nsize_t get_utf8_str_len(const std::string &str);\n\n/* Split a string into a list of strings on a given string\n * delimiter. NB: delimiters on beginning / end of string are\n * trimmed. Eg, \"FooBarFoo\" split on \"Foo\" returns [\"Bar\"].\n */\nstd::vector<std::string> split_str(const std::string &s,\n                                   const std::string &delim);\n\n/* Splits string into vector of UTF-8 byte sequences representing a single\n * Unicode codepoint.\n */\nstd::vector<std::string> split_into_codepoints(const std::string &str);\n\n/* Splits string into bytes.\n */\nstd::vector<std::string> split_into_bytes(const std::string &str);\n\n// Add a word in index to the dicionary of fst\nvoid add_word_to_fst(const std::vector<unsigned int> &word,\n                     fst::StdVectorFst *dictionary);\n\n// Return whether a byte is a code point boundary (not a continuation byte).\ninline bool byte_is_codepoint_boundary(unsigned char c) {\n  // only continuation bytes have their most significant bits set to 10\n  return (c & 0xC0) != 0x80;\n}\n\n// Add a word in string to dictionary\nbool add_word_to_dictionary(\n    const std::string &word,\n    const std::unordered_map<std::string, int> &char_map,\n    bool utf8,\n    int SPACE_ID,\n    fst::StdVectorFst *dictionary);\n#endif  // DECODER_UTILS_H\n"
  },
  {
    "path": "native_client/ctcdecode/numpy.i",
    "content": "/* -*- C -*-  (not really, but good for syntax highlighting) */\n\n/*\n * Copyright (c) 2005-2015, NumPy Developers.\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are\n * met:\n *\n *     * Redistributions of source code must retain the above copyright\n *        notice, this list of conditions and the following disclaimer.\n *\n *     * Redistributions in binary form must reproduce the above\n *        copyright notice, this list of conditions and the following\n *        disclaimer in the documentation and/or other materials provided\n *        with the distribution.\n *\n *     * Neither the name of the NumPy Developers nor the names of any\n *        contributors may be used to endorse or promote products derived\n *        from this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n */\n\n#ifdef SWIGPYTHON\n\n%{\n#ifndef SWIG_FILE_WITH_INIT\n#define NO_IMPORT_ARRAY\n#endif\n#include \"stdio.h\"\n#define NPY_NO_DEPRECATED_API NPY_1_7_API_VERSION\n#include <numpy/arrayobject.h>\n%}\n\n/**********************************************************************/\n\n%fragment(\"NumPy_Backward_Compatibility\", \"header\")\n{\n%#if NPY_API_VERSION < 0x00000007\n%#define NPY_ARRAY_DEFAULT NPY_DEFAULT\n%#define NPY_ARRAY_FARRAY  NPY_FARRAY\n%#define NPY_FORTRANORDER  NPY_FORTRAN\n%#endif\n}\n\n/**********************************************************************/\n\n/* The following code originally appeared in\n * enthought/kiva/agg/src/numeric.i written by Eric Jones.  It was\n * translated from C++ to C by John Hunter.  Bill Spotz has modified\n * it to fix some minor bugs, upgrade from Numeric to numpy (all\n * versions), add some comments and functionality, and convert from\n * direct code insertion to SWIG fragments.\n */\n\n%fragment(\"NumPy_Macros\", \"header\")\n{\n/* Macros to extract array attributes.\n */\n%#if NPY_API_VERSION < 0x00000007\n%#define is_array(a)            ((a) && PyArray_Check((PyArrayObject*)a))\n%#define array_type(a)          (int)(PyArray_TYPE((PyArrayObject*)a))\n%#define array_numdims(a)       (((PyArrayObject*)a)->nd)\n%#define array_dimensions(a)    (((PyArrayObject*)a)->dimensions)\n%#define array_size(a,i)        (((PyArrayObject*)a)->dimensions[i])\n%#define array_strides(a)       (((PyArrayObject*)a)->strides)\n%#define array_stride(a,i)      (((PyArrayObject*)a)->strides[i])\n%#define array_data(a)          (((PyArrayObject*)a)->data)\n%#define array_descr(a)         (((PyArrayObject*)a)->descr)\n%#define array_flags(a)         (((PyArrayObject*)a)->flags)\n%#define array_clearflags(a,f)  (((PyArrayObject*)a)->flags) &= ~f\n%#define array_enableflags(a,f) (((PyArrayObject*)a)->flags) = f\n%#define array_is_fortran(a)    (PyArray_ISFORTRAN((PyArrayObject*)a))\n%#else\n%#define is_array(a)            ((a) && PyArray_Check(a))\n%#define array_type(a)          PyArray_TYPE((PyArrayObject*)a)\n%#define array_numdims(a)       PyArray_NDIM((PyArrayObject*)a)\n%#define array_dimensions(a)    PyArray_DIMS((PyArrayObject*)a)\n%#define array_strides(a)       PyArray_STRIDES((PyArrayObject*)a)\n%#define array_stride(a,i)      PyArray_STRIDE((PyArrayObject*)a,i)\n%#define array_size(a,i)        PyArray_DIM((PyArrayObject*)a,i)\n%#define array_data(a)          PyArray_DATA((PyArrayObject*)a)\n%#define array_descr(a)         PyArray_DESCR((PyArrayObject*)a)\n%#define array_flags(a)         PyArray_FLAGS((PyArrayObject*)a)\n%#define array_enableflags(a,f) PyArray_ENABLEFLAGS((PyArrayObject*)a,f)\n%#define array_clearflags(a,f)  PyArray_CLEARFLAGS((PyArrayObject*)a,f)\n%#define array_is_fortran(a)    (PyArray_IS_F_CONTIGUOUS((PyArrayObject*)a))\n%#endif\n%#define array_is_contiguous(a) (PyArray_ISCONTIGUOUS((PyArrayObject*)a))\n%#define array_is_native(a)     (PyArray_ISNOTSWAPPED((PyArrayObject*)a))\n}\n\n/**********************************************************************/\n\n%fragment(\"NumPy_Utilities\",\n          \"header\")\n{\n  /* Given a PyObject, return a string describing its type.\n   */\n  const char* pytype_string(PyObject* py_obj)\n  {\n    if (py_obj == NULL          ) return \"C NULL value\";\n    if (py_obj == Py_None       ) return \"Python None\" ;\n    if (PyCallable_Check(py_obj)) return \"callable\"    ;\n    if (PyString_Check(  py_obj)) return \"string\"      ;\n    if (PyInt_Check(     py_obj)) return \"int\"         ;\n    if (PyFloat_Check(   py_obj)) return \"float\"       ;\n    if (PyDict_Check(    py_obj)) return \"dict\"        ;\n    if (PyList_Check(    py_obj)) return \"list\"        ;\n    if (PyTuple_Check(   py_obj)) return \"tuple\"       ;\n%#if PY_MAJOR_VERSION < 3\n    if (PyFile_Check(    py_obj)) return \"file\"        ;\n    if (PyModule_Check(  py_obj)) return \"module\"      ;\n    if (PyInstance_Check(py_obj)) return \"instance\"    ;\n%#endif\n\n    return \"unknown type\";\n  }\n\n  /* Given a NumPy typecode, return a string describing the type.\n   */\n  const char* typecode_string(int typecode)\n  {\n    static const char* type_names[25] = {\"bool\",\n                                         \"byte\",\n                                         \"unsigned byte\",\n                                         \"short\",\n                                         \"unsigned short\",\n                                         \"int\",\n                                         \"unsigned int\",\n                                         \"long\",\n                                         \"unsigned long\",\n                                         \"long long\",\n                                         \"unsigned long long\",\n                                         \"float\",\n                                         \"double\",\n                                         \"long double\",\n                                         \"complex float\",\n                                         \"complex double\",\n                                         \"complex long double\",\n                                         \"object\",\n                                         \"string\",\n                                         \"unicode\",\n                                         \"void\",\n                                         \"ntypes\",\n                                         \"notype\",\n                                         \"char\",\n                                         \"unknown\"};\n    return typecode < 24 ? type_names[typecode] : type_names[24];\n  }\n\n  /* Make sure input has correct numpy type.  This now just calls\n     PyArray_EquivTypenums().\n   */\n  int type_match(int actual_type,\n                 int desired_type)\n  {\n    return PyArray_EquivTypenums(actual_type, desired_type);\n  }\n\n%#ifdef SWIGPY_USE_CAPSULE\n  void free_cap(PyObject * cap)\n  {\n    void* array = (void*) PyCapsule_GetPointer(cap,SWIGPY_CAPSULE_NAME);\n    if (array != NULL) free(array);\n  }\n%#endif\n\n\n}\n\n/**********************************************************************/\n\n%fragment(\"NumPy_Object_to_Array\",\n          \"header\",\n          fragment=\"NumPy_Backward_Compatibility\",\n          fragment=\"NumPy_Macros\",\n          fragment=\"NumPy_Utilities\")\n{\n  /* Given a PyObject pointer, cast it to a PyArrayObject pointer if\n   * legal.  If not, set the python error string appropriately and\n   * return NULL.\n   */\n  PyArrayObject* obj_to_array_no_conversion(PyObject* input,\n                                            int        typecode)\n  {\n    PyArrayObject* ary = NULL;\n    if (is_array(input) && (typecode == NPY_NOTYPE ||\n                            PyArray_EquivTypenums(array_type(input), typecode)))\n    {\n      ary = (PyArrayObject*) input;\n    }\n    else if is_array(input)\n    {\n      const char* desired_type = typecode_string(typecode);\n      const char* actual_type  = typecode_string(array_type(input));\n      PyErr_Format(PyExc_TypeError,\n                   \"Array of type '%s' required.  Array of type '%s' given\",\n                   desired_type, actual_type);\n      ary = NULL;\n    }\n    else\n    {\n      const char* desired_type = typecode_string(typecode);\n      const char* actual_type  = pytype_string(input);\n      PyErr_Format(PyExc_TypeError,\n                   \"Array of type '%s' required.  A '%s' was given\",\n                   desired_type,\n                   actual_type);\n      ary = NULL;\n    }\n    return ary;\n  }\n\n  /* Convert the given PyObject to a NumPy array with the given\n   * typecode.  On success, return a valid PyArrayObject* with the\n   * correct type.  On failure, the python error string will be set and\n   * the routine returns NULL.\n   */\n  PyArrayObject* obj_to_array_allow_conversion(PyObject* input,\n                                               int       typecode,\n                                               int*      is_new_object)\n  {\n    PyArrayObject* ary = NULL;\n    PyObject*      py_obj;\n    if (is_array(input) && (typecode == NPY_NOTYPE ||\n                            PyArray_EquivTypenums(array_type(input),typecode)))\n    {\n      ary = (PyArrayObject*) input;\n      *is_new_object = 0;\n    }\n    else\n    {\n      py_obj = PyArray_FROMANY(input, typecode, 0, 0, NPY_ARRAY_DEFAULT);\n      /* If NULL, PyArray_FromObject will have set python error value.*/\n      ary = (PyArrayObject*) py_obj;\n      *is_new_object = 1;\n    }\n    return ary;\n  }\n\n  /* Given a PyArrayObject, check to see if it is contiguous.  If so,\n   * return the input pointer and flag it as not a new object.  If it is\n   * not contiguous, create a new PyArrayObject using the original data,\n   * flag it as a new object and return the pointer.\n   */\n  PyArrayObject* make_contiguous(PyArrayObject* ary,\n                                 int*           is_new_object,\n                                 int            min_dims,\n                                 int            max_dims)\n  {\n    PyArrayObject* result;\n    if (array_is_contiguous(ary))\n    {\n      result = ary;\n      *is_new_object = 0;\n    }\n    else\n    {\n      result = (PyArrayObject*) PyArray_ContiguousFromObject((PyObject*)ary,\n                                                              array_type(ary),\n                                                              min_dims,\n                                                              max_dims);\n      *is_new_object = 1;\n    }\n    return result;\n  }\n\n  /* Given a PyArrayObject, check to see if it is Fortran-contiguous.\n   * If so, return the input pointer, but do not flag it as not a new\n   * object.  If it is not Fortran-contiguous, create a new\n   * PyArrayObject using the original data, flag it as a new object\n   * and return the pointer.\n   */\n  PyArrayObject* make_fortran(PyArrayObject* ary,\n                              int*           is_new_object)\n  {\n    PyArrayObject* result;\n    if (array_is_fortran(ary))\n    {\n      result = ary;\n      *is_new_object = 0;\n    }\n    else\n    {\n      Py_INCREF(array_descr(ary));\n      result = (PyArrayObject*) PyArray_FromArray(ary,\n                                                  array_descr(ary),\n%#if NPY_API_VERSION < 0x00000007\n                                                  NPY_FORTRANORDER);\n%#else\n                                                  NPY_ARRAY_F_CONTIGUOUS);\n%#endif\n      *is_new_object = 1;\n    }\n    return result;\n  }\n\n  /* Convert a given PyObject to a contiguous PyArrayObject of the\n   * specified type.  If the input object is not a contiguous\n   * PyArrayObject, a new one will be created and the new object flag\n   * will be set.\n   */\n  PyArrayObject* obj_to_array_contiguous_allow_conversion(PyObject* input,\n                                                          int       typecode,\n                                                          int*      is_new_object)\n  {\n    int is_new1 = 0;\n    int is_new2 = 0;\n    PyArrayObject* ary2;\n    PyArrayObject* ary1 = obj_to_array_allow_conversion(input,\n                                                        typecode,\n                                                        &is_new1);\n    if (ary1)\n    {\n      ary2 = make_contiguous(ary1, &is_new2, 0, 0);\n      if ( is_new1 && is_new2)\n      {\n        Py_DECREF(ary1);\n      }\n      ary1 = ary2;\n    }\n    *is_new_object = is_new1 || is_new2;\n    return ary1;\n  }\n\n  /* Convert a given PyObject to a Fortran-ordered PyArrayObject of the\n   * specified type.  If the input object is not a Fortran-ordered\n   * PyArrayObject, a new one will be created and the new object flag\n   * will be set.\n   */\n  PyArrayObject* obj_to_array_fortran_allow_conversion(PyObject* input,\n                                                       int       typecode,\n                                                       int*      is_new_object)\n  {\n    int is_new1 = 0;\n    int is_new2 = 0;\n    PyArrayObject* ary2;\n    PyArrayObject* ary1 = obj_to_array_allow_conversion(input,\n                                                        typecode,\n                                                        &is_new1);\n    if (ary1)\n    {\n      ary2 = make_fortran(ary1, &is_new2);\n      if (is_new1 && is_new2)\n      {\n        Py_DECREF(ary1);\n      }\n      ary1 = ary2;\n    }\n    *is_new_object = is_new1 || is_new2;\n    return ary1;\n  }\n} /* end fragment */\n\n/**********************************************************************/\n\n%fragment(\"NumPy_Array_Requirements\",\n          \"header\",\n          fragment=\"NumPy_Backward_Compatibility\",\n          fragment=\"NumPy_Macros\")\n{\n  /* Test whether a python object is contiguous.  If array is\n   * contiguous, return 1.  Otherwise, set the python error string and\n   * return 0.\n   */\n  int require_contiguous(PyArrayObject* ary)\n  {\n    int contiguous = 1;\n    if (!array_is_contiguous(ary))\n    {\n      PyErr_SetString(PyExc_TypeError,\n                      \"Array must be contiguous.  A non-contiguous array was given\");\n      contiguous = 0;\n    }\n    return contiguous;\n  }\n\n  /* Test whether a python object is (C_ or F_) contiguous.  If array is\n   * contiguous, return 1.  Otherwise, set the python error string and\n   * return 0.\n   */\n  int require_c_or_f_contiguous(PyArrayObject* ary)\n  {\n    int contiguous = 1;\n    if (!(array_is_contiguous(ary) || array_is_fortran(ary)))\n    {\n      PyErr_SetString(PyExc_TypeError,\n                      \"Array must be contiguous (C_ or F_).  A non-contiguous array was given\");\n      contiguous = 0;\n    }\n    return contiguous;\n  }\n\n  /* Require that a numpy array is not byte-swapped.  If the array is\n   * not byte-swapped, return 1.  Otherwise, set the python error string\n   * and return 0.\n   */\n  int require_native(PyArrayObject* ary)\n  {\n    int native = 1;\n    if (!array_is_native(ary))\n    {\n      PyErr_SetString(PyExc_TypeError,\n                      \"Array must have native byteorder.  \"\n                      \"A byte-swapped array was given\");\n      native = 0;\n    }\n    return native;\n  }\n\n  /* Require the given PyArrayObject to have a specified number of\n   * dimensions.  If the array has the specified number of dimensions,\n   * return 1.  Otherwise, set the python error string and return 0.\n   */\n  int require_dimensions(PyArrayObject* ary,\n                         int            exact_dimensions)\n  {\n    int success = 1;\n    if (array_numdims(ary) != exact_dimensions)\n    {\n      PyErr_Format(PyExc_TypeError,\n                   \"Array must have %d dimensions.  Given array has %d dimensions\",\n                   exact_dimensions,\n                   array_numdims(ary));\n      success = 0;\n    }\n    return success;\n  }\n\n  /* Require the given PyArrayObject to have one of a list of specified\n   * number of dimensions.  If the array has one of the specified number\n   * of dimensions, return 1.  Otherwise, set the python error string\n   * and return 0.\n   */\n  int require_dimensions_n(PyArrayObject* ary,\n                           int*           exact_dimensions,\n                           int            n)\n  {\n    int success = 0;\n    int i;\n    char dims_str[255] = \"\";\n    char s[255];\n    for (i = 0; i < n && !success; i++)\n    {\n      if (array_numdims(ary) == exact_dimensions[i])\n      {\n        success = 1;\n      }\n    }\n    if (!success)\n    {\n      for (i = 0; i < n-1; i++)\n      {\n        sprintf(s, \"%d, \", exact_dimensions[i]);\n        strcat(dims_str,s);\n      }\n      sprintf(s, \" or %d\", exact_dimensions[n-1]);\n      strcat(dims_str,s);\n      PyErr_Format(PyExc_TypeError,\n                   \"Array must have %s dimensions.  Given array has %d dimensions\",\n                   dims_str,\n                   array_numdims(ary));\n    }\n    return success;\n  }\n\n  /* Require the given PyArrayObject to have a specified shape.  If the\n   * array has the specified shape, return 1.  Otherwise, set the python\n   * error string and return 0.\n   */\n  int require_size(PyArrayObject* ary,\n                   npy_intp*      size,\n                   int            n)\n  {\n    int i;\n    int success = 1;\n    size_t len;\n    char desired_dims[255] = \"[\";\n    char s[255];\n    char actual_dims[255] = \"[\";\n    for(i=0; i < n;i++)\n    {\n      if (size[i] != -1 &&  size[i] != array_size(ary,i))\n      {\n        success = 0;\n      }\n    }\n    if (!success)\n    {\n      for (i = 0; i < n; i++)\n      {\n        if (size[i] == -1)\n        {\n          sprintf(s, \"*,\");\n        }\n        else\n        {\n          sprintf(s, \"%ld,\", (long int)size[i]);\n        }\n        strcat(desired_dims,s);\n      }\n      len = strlen(desired_dims);\n      desired_dims[len-1] = ']';\n      for (i = 0; i < n; i++)\n      {\n        sprintf(s, \"%ld,\", (long int)array_size(ary,i));\n        strcat(actual_dims,s);\n      }\n      len = strlen(actual_dims);\n      actual_dims[len-1] = ']';\n      PyErr_Format(PyExc_TypeError,\n                   \"Array must have shape of %s.  Given array has shape of %s\",\n                   desired_dims,\n                   actual_dims);\n    }\n    return success;\n  }\n\n  /* Require the given PyArrayObject to to be Fortran ordered.  If the\n   * the PyArrayObject is already Fortran ordered, do nothing.  Else,\n   * set the Fortran ordering flag and recompute the strides.\n   */\n  int require_fortran(PyArrayObject* ary)\n  {\n    int success = 1;\n    int nd = array_numdims(ary);\n    int i;\n    npy_intp * strides = array_strides(ary);\n    if (array_is_fortran(ary)) return success;\n    int n_non_one = 0;\n    /* Set the Fortran ordered flag */\n    const npy_intp *dims = array_dimensions(ary);\n    for (i=0; i < nd; ++i)\n      n_non_one += (dims[i] != 1) ? 1 : 0;\n    if (n_non_one > 1)    \n      array_clearflags(ary,NPY_ARRAY_CARRAY);\n    array_enableflags(ary,NPY_ARRAY_FARRAY);\n    /* Recompute the strides */\n    strides[0] = strides[nd-1];\n    for (i=1; i < nd; ++i)\n      strides[i] = strides[i-1] * array_size(ary,i-1);\n    return success;\n  }\n}\n\n/* Combine all NumPy fragments into one for convenience */\n%fragment(\"NumPy_Fragments\",\n          \"header\",\n          fragment=\"NumPy_Backward_Compatibility\",\n          fragment=\"NumPy_Macros\",\n          fragment=\"NumPy_Utilities\",\n          fragment=\"NumPy_Object_to_Array\",\n          fragment=\"NumPy_Array_Requirements\")\n{\n}\n\n/* End John Hunter translation (with modifications by Bill Spotz)\n */\n\n/* %numpy_typemaps() macro\n *\n * This macro defines a family of 75 typemaps that allow C arguments\n * of the form\n *\n *    1. (DATA_TYPE IN_ARRAY1[ANY])\n *    2. (DATA_TYPE* IN_ARRAY1, DIM_TYPE DIM1)\n *    3. (DIM_TYPE DIM1, DATA_TYPE* IN_ARRAY1)\n *\n *    4. (DATA_TYPE IN_ARRAY2[ANY][ANY])\n *    5. (DATA_TYPE* IN_ARRAY2, DIM_TYPE DIM1, DIM_TYPE DIM2)\n *    6. (DIM_TYPE DIM1, DIM_TYPE DIM2, DATA_TYPE* IN_ARRAY2)\n *    7. (DATA_TYPE* IN_FARRAY2, DIM_TYPE DIM1, DIM_TYPE DIM2)\n *    8. (DIM_TYPE DIM1, DIM_TYPE DIM2, DATA_TYPE* IN_FARRAY2)\n *\n *    9. (DATA_TYPE IN_ARRAY3[ANY][ANY][ANY])\n *   10. (DATA_TYPE* IN_ARRAY3, DIM_TYPE DIM1, DIM_TYPE DIM2, DIM_TYPE DIM3)\n *   11. (DATA_TYPE** IN_ARRAY3, DIM_TYPE DIM1, DIM_TYPE DIM2, DIM_TYPE DIM3)\n *   12. (DIM_TYPE DIM1, DIM_TYPE DIM2, DIM_TYPE DIM3, DATA_TYPE* IN_ARRAY3)\n *   13. (DATA_TYPE* IN_FARRAY3, DIM_TYPE DIM1, DIM_TYPE DIM2, DIM_TYPE DIM3)\n *   14. (DIM_TYPE DIM1, DIM_TYPE DIM2, DIM_TYPE DIM3, DATA_TYPE* IN_FARRAY3)\n *\n *   15. (DATA_TYPE IN_ARRAY4[ANY][ANY][ANY][ANY])\n *   16. (DATA_TYPE* IN_ARRAY4, DIM_TYPE DIM1, DIM_TYPE DIM2, DIM_TYPE DIM3, DIM_TYPE DIM4)\n *   17. (DATA_TYPE** IN_ARRAY4, DIM_TYPE DIM1, DIM_TYPE DIM2, DIM_TYPE DIM3, DIM_TYPE DIM4)\n *   18. (DIM_TYPE DIM1, DIM_TYPE DIM2, DIM_TYPE DIM3, , DIM_TYPE DIM4, DATA_TYPE* IN_ARRAY4)\n *   19. (DATA_TYPE* IN_FARRAY4, DIM_TYPE DIM1, DIM_TYPE DIM2, DIM_TYPE DIM3, DIM_TYPE DIM4)\n *   20. (DIM_TYPE DIM1, DIM_TYPE DIM2, DIM_TYPE DIM3, DIM_TYPE DIM4, DATA_TYPE* IN_FARRAY4)\n *\n *   21. (DATA_TYPE INPLACE_ARRAY1[ANY])\n *   22. (DATA_TYPE* INPLACE_ARRAY1, DIM_TYPE DIM1)\n *   23. (DIM_TYPE DIM1, DATA_TYPE* INPLACE_ARRAY1)\n *\n *   24. (DATA_TYPE INPLACE_ARRAY2[ANY][ANY])\n *   25. (DATA_TYPE* INPLACE_ARRAY2, DIM_TYPE DIM1, DIM_TYPE DIM2)\n *   26. (DIM_TYPE DIM1, DIM_TYPE DIM2, DATA_TYPE* INPLACE_ARRAY2)\n *   27. (DATA_TYPE* INPLACE_FARRAY2, DIM_TYPE DIM1, DIM_TYPE DIM2)\n *   28. (DIM_TYPE DIM1, DIM_TYPE DIM2, DATA_TYPE* INPLACE_FARRAY2)\n *\n *   29. (DATA_TYPE INPLACE_ARRAY3[ANY][ANY][ANY])\n *   30. (DATA_TYPE* INPLACE_ARRAY3, DIM_TYPE DIM1, DIM_TYPE DIM2, DIM_TYPE DIM3)\n *   31. (DATA_TYPE** INPLACE_ARRAY3, DIM_TYPE DIM1, DIM_TYPE DIM2, DIM_TYPE DIM3)\n *   32. (DIM_TYPE DIM1, DIM_TYPE DIM2, DIM_TYPE DIM3, DATA_TYPE* INPLACE_ARRAY3)\n *   33. (DATA_TYPE* INPLACE_FARRAY3, DIM_TYPE DIM1, DIM_TYPE DIM2, DIM_TYPE DIM3)\n *   34. (DIM_TYPE DIM1, DIM_TYPE DIM2, DIM_TYPE DIM3, DATA_TYPE* INPLACE_FARRAY3)\n *\n *   35. (DATA_TYPE INPLACE_ARRAY4[ANY][ANY][ANY][ANY])\n *   36. (DATA_TYPE* INPLACE_ARRAY4, DIM_TYPE DIM1, DIM_TYPE DIM2, DIM_TYPE DIM3, DIM_TYPE DIM4)\n *   37. (DATA_TYPE** INPLACE_ARRAY4, DIM_TYPE DIM1, DIM_TYPE DIM2, DIM_TYPE DIM3, DIM_TYPE DIM4)\n *   38. (DIM_TYPE DIM1, DIM_TYPE DIM2, DIM_TYPE DIM3, DIM_TYPE DIM4, DATA_TYPE* INPLACE_ARRAY4)\n *   39. (DATA_TYPE* INPLACE_FARRAY4, DIM_TYPE DIM1, DIM_TYPE DIM2, DIM_TYPE DIM3, DIM_TYPE DIM4)\n *   40. (DIM_TYPE DIM1, DIM_TYPE DIM2, DIM_TYPE DIM3, DIM_TYPE DIM4, DATA_TYPE* INPLACE_FARRAY4)\n *\n *   41. (DATA_TYPE ARGOUT_ARRAY1[ANY])\n *   42. (DATA_TYPE* ARGOUT_ARRAY1, DIM_TYPE DIM1)\n *   43. (DIM_TYPE DIM1, DATA_TYPE* ARGOUT_ARRAY1)\n *\n *   44. (DATA_TYPE ARGOUT_ARRAY2[ANY][ANY])\n *\n *   45. (DATA_TYPE ARGOUT_ARRAY3[ANY][ANY][ANY])\n *\n *   46. (DATA_TYPE ARGOUT_ARRAY4[ANY][ANY][ANY][ANY])\n *\n *   47. (DATA_TYPE** ARGOUTVIEW_ARRAY1, DIM_TYPE* DIM1)\n *   48. (DIM_TYPE* DIM1, DATA_TYPE** ARGOUTVIEW_ARRAY1)\n *\n *   49. (DATA_TYPE** ARGOUTVIEW_ARRAY2, DIM_TYPE* DIM1, DIM_TYPE* DIM2)\n *   50. (DIM_TYPE* DIM1, DIM_TYPE* DIM2, DATA_TYPE** ARGOUTVIEW_ARRAY2)\n *   51. (DATA_TYPE** ARGOUTVIEW_FARRAY2, DIM_TYPE* DIM1, DIM_TYPE* DIM2)\n *   52. (DIM_TYPE* DIM1, DIM_TYPE* DIM2, DATA_TYPE** ARGOUTVIEW_FARRAY2)\n *\n *   53. (DATA_TYPE** ARGOUTVIEW_ARRAY3, DIM_TYPE* DIM1, DIM_TYPE* DIM2, DIM_TYPE* DIM3)\n *   54. (DIM_TYPE* DIM1, DIM_TYPE* DIM2, DIM_TYPE* DIM3, DATA_TYPE** ARGOUTVIEW_ARRAY3)\n *   55. (DATA_TYPE** ARGOUTVIEW_FARRAY3, DIM_TYPE* DIM1, DIM_TYPE* DIM2, DIM_TYPE* DIM3)\n *   56. (DIM_TYPE* DIM1, DIM_TYPE* DIM2, DIM_TYPE* DIM3, DATA_TYPE** ARGOUTVIEW_FARRAY3)\n *\n *   57. (DATA_TYPE** ARGOUTVIEW_ARRAY4, DIM_TYPE* DIM1, DIM_TYPE* DIM2, DIM_TYPE* DIM3, DIM_TYPE* DIM4)\n *   58. (DIM_TYPE* DIM1, DIM_TYPE* DIM2, DIM_TYPE* DIM3, DIM_TYPE* DIM4, DATA_TYPE** ARGOUTVIEW_ARRAY4)\n *   59. (DATA_TYPE** ARGOUTVIEW_FARRAY4, DIM_TYPE* DIM1, DIM_TYPE* DIM2, DIM_TYPE* DIM3, DIM_TYPE* DIM4)\n *   60. (DIM_TYPE* DIM1, DIM_TYPE* DIM2, DIM_TYPE* DIM3, DIM_TYPE* DIM4, DATA_TYPE** ARGOUTVIEW_FARRAY4)\n *\n *   61. (DATA_TYPE** ARGOUTVIEWM_ARRAY1, DIM_TYPE* DIM1)\n *   62. (DIM_TYPE* DIM1, DATA_TYPE** ARGOUTVIEWM_ARRAY1)\n *\n *   63. (DATA_TYPE** ARGOUTVIEWM_ARRAY2, DIM_TYPE* DIM1, DIM_TYPE* DIM2)\n *   64. (DIM_TYPE* DIM1, DIM_TYPE* DIM2, DATA_TYPE** ARGOUTVIEWM_ARRAY2)\n *   65. (DATA_TYPE** ARGOUTVIEWM_FARRAY2, DIM_TYPE* DIM1, DIM_TYPE* DIM2)\n *   66. (DIM_TYPE* DIM1, DIM_TYPE* DIM2, DATA_TYPE** ARGOUTVIEWM_FARRAY2)\n *\n *   67. (DATA_TYPE** ARGOUTVIEWM_ARRAY3, DIM_TYPE* DIM1, DIM_TYPE* DIM2, DIM_TYPE* DIM3)\n *   68. (DIM_TYPE* DIM1, DIM_TYPE* DIM2, DIM_TYPE* DIM3, DATA_TYPE** ARGOUTVIEWM_ARRAY3)\n *   69. (DATA_TYPE** ARGOUTVIEWM_FARRAY3, DIM_TYPE* DIM1, DIM_TYPE* DIM2, DIM_TYPE* DIM3)\n *   70. (DIM_TYPE* DIM1, DIM_TYPE* DIM2, DIM_TYPE* DIM3, DATA_TYPE** ARGOUTVIEWM_FARRAY3)\n *\n *   71. (DATA_TYPE** ARGOUTVIEWM_ARRAY4, DIM_TYPE* DIM1, DIM_TYPE* DIM2, DIM_TYPE* DIM3, DIM_TYPE* DIM4)\n *   72. (DIM_TYPE* DIM1, DIM_TYPE* DIM2, DIM_TYPE* DIM3, DIM_TYPE* DIM4, DATA_TYPE** ARGOUTVIEWM_ARRAY4)\n *   73. (DATA_TYPE** ARGOUTVIEWM_FARRAY4, DIM_TYPE* DIM1, DIM_TYPE* DIM2, DIM_TYPE* DIM3, DIM_TYPE* DIM4)\n *   74. (DIM_TYPE* DIM1, DIM_TYPE* DIM2, DIM_TYPE* DIM3, DIM_TYPE* DIM4, DATA_TYPE** ARGOUTVIEWM_FARRAY4)\n *\n *   75. (DATA_TYPE* INPLACE_ARRAY_FLAT, DIM_TYPE DIM_FLAT)\n *\n * where \"DATA_TYPE\" is any type supported by the NumPy module, and\n * \"DIM_TYPE\" is any int-like type suitable for specifying dimensions.\n * The difference between \"ARRAY\" typemaps and \"FARRAY\" typemaps is\n * that the \"FARRAY\" typemaps expect Fortran ordering of\n * multidimensional arrays.  In python, the dimensions will not need\n * to be specified (except for the \"DATA_TYPE* ARGOUT_ARRAY1\"\n * typemaps).  The IN_ARRAYs can be a numpy array or any sequence that\n * can be converted to a numpy array of the specified type.  The\n * INPLACE_ARRAYs must be numpy arrays of the appropriate type.  The\n * ARGOUT_ARRAYs will be returned as new numpy arrays of the\n * appropriate type.\n *\n * These typemaps can be applied to existing functions using the\n * %apply directive.  For example:\n *\n *     %apply (double* IN_ARRAY1, int DIM1) {(double* series, int length)};\n *     double prod(double* series, int length);\n *\n *     %apply (int DIM1, int DIM2, double* INPLACE_ARRAY2)\n *           {(int rows, int cols, double* matrix        )};\n *     void floor(int rows, int cols, double* matrix, double f);\n *\n *     %apply (double IN_ARRAY3[ANY][ANY][ANY])\n *           {(double tensor[2][2][2]         )};\n *     %apply (double ARGOUT_ARRAY3[ANY][ANY][ANY])\n *           {(double low[2][2][2]                )};\n *     %apply (double ARGOUT_ARRAY3[ANY][ANY][ANY])\n *           {(double upp[2][2][2]                )};\n *     void luSplit(double tensor[2][2][2],\n *                  double low[2][2][2],\n *                  double upp[2][2][2]    );\n *\n * or directly with\n *\n *     double prod(double* IN_ARRAY1, int DIM1);\n *\n *     void floor(int DIM1, int DIM2, double* INPLACE_ARRAY2, double f);\n *\n *     void luSplit(double IN_ARRAY3[ANY][ANY][ANY],\n *                  double ARGOUT_ARRAY3[ANY][ANY][ANY],\n *                  double ARGOUT_ARRAY3[ANY][ANY][ANY]);\n */\n\n%define %numpy_typemaps(DATA_TYPE, DATA_TYPECODE, DIM_TYPE)\n\n/************************/\n/* Input Array Typemaps */\n/************************/\n\n/* Typemap suite for (DATA_TYPE IN_ARRAY1[ANY])\n */\n%typecheck(SWIG_TYPECHECK_DOUBLE_ARRAY,\n           fragment=\"NumPy_Macros\")\n  (DATA_TYPE IN_ARRAY1[ANY])\n{\n  $1 = is_array($input) || PySequence_Check($input);\n}\n%typemap(in,\n         fragment=\"NumPy_Fragments\")\n  (DATA_TYPE IN_ARRAY1[ANY])\n  (PyArrayObject* array=NULL, int is_new_object=0)\n{\n  npy_intp size[1] = { $1_dim0 };\n  array = obj_to_array_contiguous_allow_conversion($input,\n                                                   DATA_TYPECODE,\n                                                   &is_new_object);\n  if (!array || !require_dimensions(array, 1) ||\n      !require_size(array, size, 1)) SWIG_fail;\n  $1 = ($1_ltype) array_data(array);\n}\n%typemap(freearg)\n  (DATA_TYPE IN_ARRAY1[ANY])\n{\n  if (is_new_object$argnum && array$argnum)\n    { Py_DECREF(array$argnum); }\n}\n\n/* Typemap suite for (DATA_TYPE* IN_ARRAY1, DIM_TYPE DIM1)\n */\n%typecheck(SWIG_TYPECHECK_DOUBLE_ARRAY,\n           fragment=\"NumPy_Macros\")\n  (DATA_TYPE* IN_ARRAY1, DIM_TYPE DIM1)\n{\n  $1 = is_array($input) || PySequence_Check($input);\n}\n%typemap(in,\n         fragment=\"NumPy_Fragments\")\n  (DATA_TYPE* IN_ARRAY1, DIM_TYPE DIM1)\n  (PyArrayObject* array=NULL, int is_new_object=0)\n{\n  npy_intp size[1] = { -1 };\n  array = obj_to_array_contiguous_allow_conversion($input,\n                                                   DATA_TYPECODE,\n                                                   &is_new_object);\n  if (!array || !require_dimensions(array, 1) ||\n      !require_size(array, size, 1)) SWIG_fail;\n  $1 = (DATA_TYPE*) array_data(array);\n  $2 = (DIM_TYPE) array_size(array,0);\n}\n%typemap(freearg)\n  (DATA_TYPE* IN_ARRAY1, DIM_TYPE DIM1)\n{\n  if (is_new_object$argnum && array$argnum)\n    { Py_DECREF(array$argnum); }\n}\n\n/* Typemap suite for (DIM_TYPE DIM1, DATA_TYPE* IN_ARRAY1)\n */\n%typecheck(SWIG_TYPECHECK_DOUBLE_ARRAY,\n           fragment=\"NumPy_Macros\")\n  (DIM_TYPE DIM1, DATA_TYPE* IN_ARRAY1)\n{\n  $1 = is_array($input) || PySequence_Check($input);\n}\n%typemap(in,\n         fragment=\"NumPy_Fragments\")\n  (DIM_TYPE DIM1, DATA_TYPE* IN_ARRAY1)\n  (PyArrayObject* array=NULL, int is_new_object=0)\n{\n  npy_intp size[1] = {-1};\n  array = obj_to_array_contiguous_allow_conversion($input,\n                                                   DATA_TYPECODE,\n                                                   &is_new_object);\n  if (!array || !require_dimensions(array, 1) ||\n      !require_size(array, size, 1)) SWIG_fail;\n  $1 = (DIM_TYPE) array_size(array,0);\n  $2 = (DATA_TYPE*) array_data(array);\n}\n%typemap(freearg)\n  (DIM_TYPE DIM1, DATA_TYPE* IN_ARRAY1)\n{\n  if (is_new_object$argnum && array$argnum)\n    { Py_DECREF(array$argnum); }\n}\n\n/* Typemap suite for (DATA_TYPE IN_ARRAY2[ANY][ANY])\n */\n%typecheck(SWIG_TYPECHECK_DOUBLE_ARRAY,\n           fragment=\"NumPy_Macros\")\n  (DATA_TYPE IN_ARRAY2[ANY][ANY])\n{\n  $1 = is_array($input) || PySequence_Check($input);\n}\n%typemap(in,\n         fragment=\"NumPy_Fragments\")\n  (DATA_TYPE IN_ARRAY2[ANY][ANY])\n  (PyArrayObject* array=NULL, int is_new_object=0)\n{\n  npy_intp size[2] = { $1_dim0, $1_dim1 };\n  array = obj_to_array_contiguous_allow_conversion($input,\n                                                   DATA_TYPECODE,\n                                                   &is_new_object);\n  if (!array || !require_dimensions(array, 2) ||\n      !require_size(array, size, 2)) SWIG_fail;\n  $1 = ($1_ltype) array_data(array);\n}\n%typemap(freearg)\n  (DATA_TYPE IN_ARRAY2[ANY][ANY])\n{\n  if (is_new_object$argnum && array$argnum)\n    { Py_DECREF(array$argnum); }\n}\n\n/* Typemap suite for (DATA_TYPE* IN_ARRAY2, DIM_TYPE DIM1, DIM_TYPE DIM2)\n */\n%typecheck(SWIG_TYPECHECK_DOUBLE_ARRAY,\n           fragment=\"NumPy_Macros\")\n  (DATA_TYPE* IN_ARRAY2, DIM_TYPE DIM1, DIM_TYPE DIM2)\n{\n  $1 = is_array($input) || PySequence_Check($input);\n}\n%typemap(in,\n         fragment=\"NumPy_Fragments\")\n  (DATA_TYPE* IN_ARRAY2, DIM_TYPE DIM1, DIM_TYPE DIM2)\n  (PyArrayObject* array=NULL, int is_new_object=0)\n{\n  npy_intp size[2] = { -1, -1 };\n  array = obj_to_array_contiguous_allow_conversion($input, DATA_TYPECODE,\n                                                   &is_new_object);\n  if (!array || !require_dimensions(array, 2) ||\n      !require_size(array, size, 2)) SWIG_fail;\n  $1 = (DATA_TYPE*) array_data(array);\n  $2 = (DIM_TYPE) array_size(array,0);\n  $3 = (DIM_TYPE) array_size(array,1);\n}\n%typemap(freearg)\n  (DATA_TYPE* IN_ARRAY2, DIM_TYPE DIM1, DIM_TYPE DIM2)\n{\n  if (is_new_object$argnum && array$argnum)\n    { Py_DECREF(array$argnum); }\n}\n\n/* Typemap suite for (DIM_TYPE DIM1, DIM_TYPE DIM2, DATA_TYPE* IN_ARRAY2)\n */\n%typecheck(SWIG_TYPECHECK_DOUBLE_ARRAY,\n           fragment=\"NumPy_Macros\")\n  (DIM_TYPE DIM1, DIM_TYPE DIM2, DATA_TYPE* IN_ARRAY2)\n{\n  $1 = is_array($input) || PySequence_Check($input);\n}\n%typemap(in,\n         fragment=\"NumPy_Fragments\")\n  (DIM_TYPE DIM1, DIM_TYPE DIM2, DATA_TYPE* IN_ARRAY2)\n  (PyArrayObject* array=NULL, int is_new_object=0)\n{\n  npy_intp size[2] = { -1, -1 };\n  array = obj_to_array_contiguous_allow_conversion($input,\n                                                   DATA_TYPECODE,\n                                                   &is_new_object);\n  if (!array || !require_dimensions(array, 2) ||\n      !require_size(array, size, 2)) SWIG_fail;\n  $1 = (DIM_TYPE) array_size(array,0);\n  $2 = (DIM_TYPE) array_size(array,1);\n  $3 = (DATA_TYPE*) array_data(array);\n}\n%typemap(freearg)\n  (DIM_TYPE DIM1, DIM_TYPE DIM2, DATA_TYPE* IN_ARRAY2)\n{\n  if (is_new_object$argnum && array$argnum)\n    { Py_DECREF(array$argnum); }\n}\n\n/* Typemap suite for (DATA_TYPE* IN_FARRAY2, DIM_TYPE DIM1, DIM_TYPE DIM2)\n */\n%typecheck(SWIG_TYPECHECK_DOUBLE_ARRAY,\n           fragment=\"NumPy_Macros\")\n  (DATA_TYPE* IN_FARRAY2, DIM_TYPE DIM1, DIM_TYPE DIM2)\n{\n  $1 = is_array($input) || PySequence_Check($input);\n}\n%typemap(in,\n         fragment=\"NumPy_Fragments\")\n  (DATA_TYPE* IN_FARRAY2, DIM_TYPE DIM1, DIM_TYPE DIM2)\n  (PyArrayObject* array=NULL, int is_new_object=0)\n{\n  npy_intp size[2] = { -1, -1 };\n  array = obj_to_array_fortran_allow_conversion($input,\n                                                DATA_TYPECODE,\n                                                &is_new_object);\n  if (!array || !require_dimensions(array, 2) ||\n      !require_size(array, size, 2) || !require_fortran(array)) SWIG_fail;\n  $1 = (DATA_TYPE*) array_data(array);\n  $2 = (DIM_TYPE) array_size(array,0);\n  $3 = (DIM_TYPE) array_size(array,1);\n}\n%typemap(freearg)\n  (DATA_TYPE* IN_FARRAY2, DIM_TYPE DIM1, DIM_TYPE DIM2)\n{\n  if (is_new_object$argnum && array$argnum)\n    { Py_DECREF(array$argnum); }\n}\n\n/* Typemap suite for (DIM_TYPE DIM1, DIM_TYPE DIM2, DATA_TYPE* IN_FARRAY2)\n */\n%typecheck(SWIG_TYPECHECK_DOUBLE_ARRAY,\n           fragment=\"NumPy_Macros\")\n  (DIM_TYPE DIM1, DIM_TYPE DIM2, DATA_TYPE* IN_FARRAY2)\n{\n  $1 = is_array($input) || PySequence_Check($input);\n}\n%typemap(in,\n         fragment=\"NumPy_Fragments\")\n  (DIM_TYPE DIM1, DIM_TYPE DIM2, DATA_TYPE* IN_FARRAY2)\n  (PyArrayObject* array=NULL, int is_new_object=0)\n{\n  npy_intp size[2] = { -1, -1 };\n  array = obj_to_array_fortran_allow_conversion($input,\n                                                   DATA_TYPECODE,\n                                                   &is_new_object);\n  if (!array || !require_dimensions(array, 2) ||\n      !require_size(array, size, 2) || !require_fortran(array)) SWIG_fail;\n  $1 = (DIM_TYPE) array_size(array,0);\n  $2 = (DIM_TYPE) array_size(array,1);\n  $3 = (DATA_TYPE*) array_data(array);\n}\n%typemap(freearg)\n  (DIM_TYPE DIM1, DIM_TYPE DIM2, DATA_TYPE* IN_FARRAY2)\n{\n  if (is_new_object$argnum && array$argnum)\n    { Py_DECREF(array$argnum); }\n}\n\n/* Typemap suite for (DATA_TYPE IN_ARRAY3[ANY][ANY][ANY])\n */\n%typecheck(SWIG_TYPECHECK_DOUBLE_ARRAY,\n           fragment=\"NumPy_Macros\")\n  (DATA_TYPE IN_ARRAY3[ANY][ANY][ANY])\n{\n  $1 = is_array($input) || PySequence_Check($input);\n}\n%typemap(in,\n         fragment=\"NumPy_Fragments\")\n  (DATA_TYPE IN_ARRAY3[ANY][ANY][ANY])\n  (PyArrayObject* array=NULL, int is_new_object=0)\n{\n  npy_intp size[3] = { $1_dim0, $1_dim1, $1_dim2 };\n  array = obj_to_array_contiguous_allow_conversion($input,\n                                                   DATA_TYPECODE,\n                                                   &is_new_object);\n  if (!array || !require_dimensions(array, 3) ||\n      !require_size(array, size, 3)) SWIG_fail;\n  $1 = ($1_ltype) array_data(array);\n}\n%typemap(freearg)\n  (DATA_TYPE IN_ARRAY3[ANY][ANY][ANY])\n{\n  if (is_new_object$argnum && array$argnum)\n    { Py_DECREF(array$argnum); }\n}\n\n/* Typemap suite for (DATA_TYPE* IN_ARRAY3, DIM_TYPE DIM1, DIM_TYPE DIM2,\n *                    DIM_TYPE DIM3)\n */\n%typecheck(SWIG_TYPECHECK_DOUBLE_ARRAY,\n           fragment=\"NumPy_Macros\")\n  (DATA_TYPE* IN_ARRAY3, DIM_TYPE DIM1, DIM_TYPE DIM2, DIM_TYPE DIM3)\n{\n  $1 = is_array($input) || PySequence_Check($input);\n}\n%typemap(in,\n         fragment=\"NumPy_Fragments\")\n  (DATA_TYPE* IN_ARRAY3, DIM_TYPE DIM1, DIM_TYPE DIM2, DIM_TYPE DIM3)\n  (PyArrayObject* array=NULL, int is_new_object=0)\n{\n  npy_intp size[3] = { -1, -1, -1 };\n  array = obj_to_array_contiguous_allow_conversion($input, DATA_TYPECODE,\n                                                   &is_new_object);\n  if (!array || !require_dimensions(array, 3) ||\n      !require_size(array, size, 3)) SWIG_fail;\n  $1 = (DATA_TYPE*) array_data(array);\n  $2 = (DIM_TYPE) array_size(array,0);\n  $3 = (DIM_TYPE) array_size(array,1);\n  $4 = (DIM_TYPE) array_size(array,2);\n}\n%typemap(freearg)\n  (DATA_TYPE* IN_ARRAY3, DIM_TYPE DIM1, DIM_TYPE DIM2, DIM_TYPE DIM3)\n{\n  if (is_new_object$argnum && array$argnum)\n    { Py_DECREF(array$argnum); }\n}\n\n/* Typemap suite for (DATA_TYPE** IN_ARRAY3, DIM_TYPE DIM1, DIM_TYPE DIM2,\n *                    DIM_TYPE DIM3)\n */\n%typecheck(SWIG_TYPECHECK_DOUBLE_ARRAY,\n           fragment=\"NumPy_Macros\")\n  (DATA_TYPE** IN_ARRAY3, DIM_TYPE DIM1, DIM_TYPE DIM2, DIM_TYPE DIM3)\n{\n  /* for now, only concerned with lists */\n  $1 = PySequence_Check($input);\n}\n%typemap(in,\n         fragment=\"NumPy_Fragments\")\n  (DATA_TYPE** IN_ARRAY3, DIM_TYPE DIM1, DIM_TYPE DIM2, DIM_TYPE DIM3)\n  (DATA_TYPE** array=NULL, PyArrayObject** object_array=NULL, int* is_new_object_array=NULL)\n{\n  npy_intp size[2] = { -1, -1 };\n  PyArrayObject* temp_array;\n  Py_ssize_t i;\n  int is_new_object;\n\n  /* length of the list */\n  $2 = PyList_Size($input);\n\n  /* the arrays */\n  array = (DATA_TYPE **)malloc($2*sizeof(DATA_TYPE *));\n  object_array = (PyArrayObject **)calloc($2,sizeof(PyArrayObject *));\n  is_new_object_array = (int *)calloc($2,sizeof(int));\n\n  if (array == NULL || object_array == NULL || is_new_object_array == NULL)\n  {\n    SWIG_fail;\n  }\n\n  for (i=0; i<$2; i++)\n  {\n    temp_array = obj_to_array_contiguous_allow_conversion(PySequence_GetItem($input,i), DATA_TYPECODE, &is_new_object);\n\n    /* the new array must be stored so that it can be destroyed in freearg */\n    object_array[i] = temp_array;\n    is_new_object_array[i] = is_new_object;\n\n    if (!temp_array || !require_dimensions(temp_array, 2)) SWIG_fail;\n\n    /* store the size of the first array in the list, then use that for comparison. */\n    if (i == 0)\n    {\n      size[0] = array_size(temp_array,0);\n      size[1] = array_size(temp_array,1);\n    }\n\n    if (!require_size(temp_array, size, 2)) SWIG_fail;\n\n    array[i] = (DATA_TYPE*) array_data(temp_array);\n  }\n\n  $1 = (DATA_TYPE**) array;\n  $3 = (DIM_TYPE) size[0];\n  $4 = (DIM_TYPE) size[1];\n}\n%typemap(freearg)\n  (DATA_TYPE** IN_ARRAY3, DIM_TYPE DIM1, DIM_TYPE DIM2, DIM_TYPE DIM3)\n{\n  Py_ssize_t i;\n\n  if (array$argnum!=NULL) free(array$argnum);\n\n  /*freeing the individual arrays if needed */\n  if (object_array$argnum!=NULL)\n  {\n    if (is_new_object_array$argnum!=NULL)\n    {\n      for (i=0; i<$2; i++)\n      {\n        if (object_array$argnum[i] != NULL && is_new_object_array$argnum[i])\n        { Py_DECREF(object_array$argnum[i]); }\n      }\n      free(is_new_object_array$argnum);\n    }\n    free(object_array$argnum);\n  }\n}\n\n/* Typemap suite for (DIM_TYPE DIM1, DIM_TYPE DIM2, DIM_TYPE DIM3,\n *                    DATA_TYPE* IN_ARRAY3)\n */\n%typecheck(SWIG_TYPECHECK_DOUBLE_ARRAY,\n           fragment=\"NumPy_Macros\")\n  (DIM_TYPE DIM1, DIM_TYPE DIM2, DIM_TYPE DIM3, DATA_TYPE* IN_ARRAY3)\n{\n  $1 = is_array($input) || PySequence_Check($input);\n}\n%typemap(in,\n         fragment=\"NumPy_Fragments\")\n  (DIM_TYPE DIM1, DIM_TYPE DIM2, DIM_TYPE DIM3, DATA_TYPE* IN_ARRAY3)\n  (PyArrayObject* array=NULL, int is_new_object=0)\n{\n  npy_intp size[3] = { -1, -1, -1 };\n  array = obj_to_array_contiguous_allow_conversion($input, DATA_TYPECODE,\n                                                   &is_new_object);\n  if (!array || !require_dimensions(array, 3) ||\n      !require_size(array, size, 3)) SWIG_fail;\n  $1 = (DIM_TYPE) array_size(array,0);\n  $2 = (DIM_TYPE) array_size(array,1);\n  $3 = (DIM_TYPE) array_size(array,2);\n  $4 = (DATA_TYPE*) array_data(array);\n}\n%typemap(freearg)\n  (DIM_TYPE DIM1, DIM_TYPE DIM2, DIM_TYPE DIM3, DATA_TYPE* IN_ARRAY3)\n{\n  if (is_new_object$argnum && array$argnum)\n    { Py_DECREF(array$argnum); }\n}\n\n/* Typemap suite for (DATA_TYPE* IN_FARRAY3, DIM_TYPE DIM1, DIM_TYPE DIM2,\n *                    DIM_TYPE DIM3)\n */\n%typecheck(SWIG_TYPECHECK_DOUBLE_ARRAY,\n           fragment=\"NumPy_Macros\")\n  (DATA_TYPE* IN_FARRAY3, DIM_TYPE DIM1, DIM_TYPE DIM2, DIM_TYPE DIM3)\n{\n  $1 = is_array($input) || PySequence_Check($input);\n}\n%typemap(in,\n         fragment=\"NumPy_Fragments\")\n  (DATA_TYPE* IN_FARRAY3, DIM_TYPE DIM1, DIM_TYPE DIM2, DIM_TYPE DIM3)\n  (PyArrayObject* array=NULL, int is_new_object=0)\n{\n  npy_intp size[3] = { -1, -1, -1 };\n  array = obj_to_array_fortran_allow_conversion($input, DATA_TYPECODE,\n                                                &is_new_object);\n  if (!array || !require_dimensions(array, 3) ||\n      !require_size(array, size, 3) | !require_fortran(array)) SWIG_fail;\n  $1 = (DATA_TYPE*) array_data(array);\n  $2 = (DIM_TYPE) array_size(array,0);\n  $3 = (DIM_TYPE) array_size(array,1);\n  $4 = (DIM_TYPE) array_size(array,2);\n}\n%typemap(freearg)\n  (DATA_TYPE* IN_FARRAY3, DIM_TYPE DIM1, DIM_TYPE DIM2, DIM_TYPE DIM3)\n{\n  if (is_new_object$argnum && array$argnum)\n    { Py_DECREF(array$argnum); }\n}\n\n/* Typemap suite for (DIM_TYPE DIM1, DIM_TYPE DIM2, DIM_TYPE DIM3,\n *                    DATA_TYPE* IN_FARRAY3)\n */\n%typecheck(SWIG_TYPECHECK_DOUBLE_ARRAY,\n           fragment=\"NumPy_Macros\")\n  (DIM_TYPE DIM1, DIM_TYPE DIM2, DIM_TYPE DIM3, DATA_TYPE* IN_FARRAY3)\n{\n  $1 = is_array($input) || PySequence_Check($input);\n}\n%typemap(in,\n         fragment=\"NumPy_Fragments\")\n  (DIM_TYPE DIM1, DIM_TYPE DIM2, DIM_TYPE DIM3, DATA_TYPE* IN_FARRAY3)\n  (PyArrayObject* array=NULL, int is_new_object=0)\n{\n  npy_intp size[3] = { -1, -1, -1 };\n  array = obj_to_array_fortran_allow_conversion($input,\n                                                   DATA_TYPECODE,\n                                                   &is_new_object);\n  if (!array || !require_dimensions(array, 3) ||\n      !require_size(array, size, 3) || !require_fortran(array)) SWIG_fail;\n  $1 = (DIM_TYPE) array_size(array,0);\n  $2 = (DIM_TYPE) array_size(array,1);\n  $3 = (DIM_TYPE) array_size(array,2);\n  $4 = (DATA_TYPE*) array_data(array);\n}\n%typemap(freearg)\n  (DIM_TYPE DIM1, DIM_TYPE DIM2, DIM_TYPE DIM3, DATA_TYPE* IN_FARRAY3)\n{\n  if (is_new_object$argnum && array$argnum)\n    { Py_DECREF(array$argnum); }\n}\n\n/* Typemap suite for (DATA_TYPE IN_ARRAY4[ANY][ANY][ANY][ANY])\n */\n%typecheck(SWIG_TYPECHECK_DOUBLE_ARRAY,\n           fragment=\"NumPy_Macros\")\n  (DATA_TYPE IN_ARRAY4[ANY][ANY][ANY][ANY])\n{\n  $1 = is_array($input) || PySequence_Check($input);\n}\n%typemap(in,\n         fragment=\"NumPy_Fragments\")\n  (DATA_TYPE IN_ARRAY4[ANY][ANY][ANY][ANY])\n  (PyArrayObject* array=NULL, int is_new_object=0)\n{\n  npy_intp size[4] = { $1_dim0, $1_dim1, $1_dim2 , $1_dim3};\n  array = obj_to_array_contiguous_allow_conversion($input, DATA_TYPECODE,\n                                                   &is_new_object);\n  if (!array || !require_dimensions(array, 4) ||\n      !require_size(array, size, 4)) SWIG_fail;\n  $1 = ($1_ltype) array_data(array);\n}\n%typemap(freearg)\n  (DATA_TYPE IN_ARRAY4[ANY][ANY][ANY][ANY])\n{\n  if (is_new_object$argnum && array$argnum)\n    { Py_DECREF(array$argnum); }\n}\n\n/* Typemap suite for (DATA_TYPE* IN_ARRAY4, DIM_TYPE DIM1, DIM_TYPE DIM2,\n *                    DIM_TYPE DIM3, DIM_TYPE DIM4)\n */\n%typecheck(SWIG_TYPECHECK_DOUBLE_ARRAY,\n           fragment=\"NumPy_Macros\")\n  (DATA_TYPE* IN_ARRAY4, DIM_TYPE DIM1, DIM_TYPE DIM2, DIM_TYPE DIM3, DIM_TYPE DIM4)\n{\n  $1 = is_array($input) || PySequence_Check($input);\n}\n%typemap(in,\n         fragment=\"NumPy_Fragments\")\n  (DATA_TYPE* IN_ARRAY4, DIM_TYPE DIM1, DIM_TYPE DIM2, DIM_TYPE DIM3, DIM_TYPE DIM4)\n  (PyArrayObject* array=NULL, int is_new_object=0)\n{\n  npy_intp size[4] = { -1, -1, -1, -1 };\n  array = obj_to_array_contiguous_allow_conversion($input, DATA_TYPECODE,\n                                                   &is_new_object);\n  if (!array || !require_dimensions(array, 4) ||\n      !require_size(array, size, 4)) SWIG_fail;\n  $1 = (DATA_TYPE*) array_data(array);\n  $2 = (DIM_TYPE) array_size(array,0);\n  $3 = (DIM_TYPE) array_size(array,1);\n  $4 = (DIM_TYPE) array_size(array,2);\n  $5 = (DIM_TYPE) array_size(array,3);\n}\n%typemap(freearg)\n  (DATA_TYPE* IN_ARRAY4, DIM_TYPE DIM1, DIM_TYPE DIM2, DIM_TYPE DIM3, DIM_TYPE DIM4)\n{\n  if (is_new_object$argnum && array$argnum)\n    { Py_DECREF(array$argnum); }\n}\n\n/* Typemap suite for (DATA_TYPE** IN_ARRAY4, DIM_TYPE DIM1, DIM_TYPE DIM2,\n *                    DIM_TYPE DIM3, DIM_TYPE DIM4)\n */\n%typecheck(SWIG_TYPECHECK_DOUBLE_ARRAY,\n           fragment=\"NumPy_Macros\")\n  (DATA_TYPE** IN_ARRAY4, DIM_TYPE DIM1, DIM_TYPE DIM2, DIM_TYPE DIM3, DIM_TYPE DIM4)\n{\n  /* for now, only concerned with lists */\n  $1 = PySequence_Check($input);\n}\n%typemap(in,\n         fragment=\"NumPy_Fragments\")\n  (DATA_TYPE** IN_ARRAY4, DIM_TYPE DIM1, DIM_TYPE DIM2, DIM_TYPE DIM3, DIM_TYPE DIM4)\n  (DATA_TYPE** array=NULL, PyArrayObject** object_array=NULL, int* is_new_object_array=NULL)\n{\n  npy_intp size[3] = { -1, -1, -1 };\n  PyArrayObject* temp_array;\n  Py_ssize_t i;\n  int is_new_object;\n\n  /* length of the list */\n  $2 = PyList_Size($input);\n\n  /* the arrays */\n  array = (DATA_TYPE **)malloc($2*sizeof(DATA_TYPE *));\n  object_array = (PyArrayObject **)calloc($2,sizeof(PyArrayObject *));\n  is_new_object_array = (int *)calloc($2,sizeof(int));\n\n  if (array == NULL || object_array == NULL || is_new_object_array == NULL)\n  {\n    SWIG_fail;\n  }\n\n  for (i=0; i<$2; i++)\n  {\n    temp_array = obj_to_array_contiguous_allow_conversion(PySequence_GetItem($input,i), DATA_TYPECODE, &is_new_object);\n\n    /* the new array must be stored so that it can be destroyed in freearg */\n    object_array[i] = temp_array;\n    is_new_object_array[i] = is_new_object;\n\n    if (!temp_array || !require_dimensions(temp_array, 3)) SWIG_fail;\n\n    /* store the size of the first array in the list, then use that for comparison. */\n    if (i == 0)\n    {\n      size[0] = array_size(temp_array,0);\n      size[1] = array_size(temp_array,1);\n      size[2] = array_size(temp_array,2);\n    }\n\n    if (!require_size(temp_array, size, 3)) SWIG_fail;\n\n    array[i] = (DATA_TYPE*) array_data(temp_array);\n  }\n\n  $1 = (DATA_TYPE**) array;\n  $3 = (DIM_TYPE) size[0];\n  $4 = (DIM_TYPE) size[1];\n  $5 = (DIM_TYPE) size[2];\n}\n%typemap(freearg)\n  (DATA_TYPE** IN_ARRAY4, DIM_TYPE DIM1, DIM_TYPE DIM2, DIM_TYPE DIM3, DIM_TYPE DIM4)\n{\n  Py_ssize_t i;\n\n  if (array$argnum!=NULL) free(array$argnum);\n\n  /*freeing the individual arrays if needed */\n  if (object_array$argnum!=NULL)\n  {\n    if (is_new_object_array$argnum!=NULL)\n    {\n      for (i=0; i<$2; i++)\n      {\n        if (object_array$argnum[i] != NULL && is_new_object_array$argnum[i])\n        { Py_DECREF(object_array$argnum[i]); }\n      }\n      free(is_new_object_array$argnum);\n    }\n    free(object_array$argnum);\n  }\n}\n\n/* Typemap suite for (DIM_TYPE DIM1, DIM_TYPE DIM2, DIM_TYPE DIM3, DIM_TYPE DIM4,\n *                    DATA_TYPE* IN_ARRAY4)\n */\n%typecheck(SWIG_TYPECHECK_DOUBLE_ARRAY,\n           fragment=\"NumPy_Macros\")\n  (DIM_TYPE DIM1, DIM_TYPE DIM2, DIM_TYPE DIM3, DIM_TYPE DIM4, DATA_TYPE* IN_ARRAY4)\n{\n  $1 = is_array($input) || PySequence_Check($input);\n}\n%typemap(in,\n         fragment=\"NumPy_Fragments\")\n  (DIM_TYPE DIM1, DIM_TYPE DIM2, DIM_TYPE DIM3, DIM_TYPE DIM4, DATA_TYPE* IN_ARRAY4)\n  (PyArrayObject* array=NULL, int is_new_object=0)\n{\n  npy_intp size[4] = { -1, -1, -1 , -1};\n  array = obj_to_array_contiguous_allow_conversion($input, DATA_TYPECODE,\n                                                   &is_new_object);\n  if (!array || !require_dimensions(array, 4) ||\n      !require_size(array, size, 4)) SWIG_fail;\n  $1 = (DIM_TYPE) array_size(array,0);\n  $2 = (DIM_TYPE) array_size(array,1);\n  $3 = (DIM_TYPE) array_size(array,2);\n  $4 = (DIM_TYPE) array_size(array,3);\n  $5 = (DATA_TYPE*) array_data(array);\n}\n%typemap(freearg)\n  (DIM_TYPE DIM1, DIM_TYPE DIM2, DIM_TYPE DIM3, DIM_TYPE DIM4, DATA_TYPE* IN_ARRAY4)\n{\n  if (is_new_object$argnum && array$argnum)\n    { Py_DECREF(array$argnum); }\n}\n\n/* Typemap suite for (DATA_TYPE* IN_FARRAY4, DIM_TYPE DIM1, DIM_TYPE DIM2,\n *                    DIM_TYPE DIM3, DIM_TYPE DIM4)\n */\n%typecheck(SWIG_TYPECHECK_DOUBLE_ARRAY,\n           fragment=\"NumPy_Macros\")\n  (DATA_TYPE* IN_FARRAY4, DIM_TYPE DIM1, DIM_TYPE DIM2, DIM_TYPE DIM3, DIM_TYPE DIM4)\n{\n  $1 = is_array($input) || PySequence_Check($input);\n}\n%typemap(in,\n         fragment=\"NumPy_Fragments\")\n  (DATA_TYPE* IN_FARRAY4, DIM_TYPE DIM1, DIM_TYPE DIM2, DIM_TYPE DIM3, DIM_TYPE DIM4)\n  (PyArrayObject* array=NULL, int is_new_object=0)\n{\n  npy_intp size[4] = { -1, -1, -1, -1 };\n  array = obj_to_array_fortran_allow_conversion($input, DATA_TYPECODE,\n                                                &is_new_object);\n  if (!array || !require_dimensions(array, 4) ||\n      !require_size(array, size, 4) | !require_fortran(array)) SWIG_fail;\n  $1 = (DATA_TYPE*) array_data(array);\n  $2 = (DIM_TYPE) array_size(array,0);\n  $3 = (DIM_TYPE) array_size(array,1);\n  $4 = (DIM_TYPE) array_size(array,2);\n  $5 = (DIM_TYPE) array_size(array,3);\n}\n%typemap(freearg)\n  (DATA_TYPE* IN_FARRAY4, DIM_TYPE DIM1, DIM_TYPE DIM2, DIM_TYPE DIM3, DIM_TYPE DIM4)\n{\n  if (is_new_object$argnum && array$argnum)\n    { Py_DECREF(array$argnum); }\n}\n\n/* Typemap suite for (DIM_TYPE DIM1, DIM_TYPE DIM2, DIM_TYPE DIM3, DIM_TYPE DIM4,\n *                    DATA_TYPE* IN_FARRAY4)\n */\n%typecheck(SWIG_TYPECHECK_DOUBLE_ARRAY,\n           fragment=\"NumPy_Macros\")\n  (DIM_TYPE DIM1, DIM_TYPE DIM2, DIM_TYPE DIM3, DIM_TYPE DIM4, DATA_TYPE* IN_FARRAY4)\n{\n  $1 = is_array($input) || PySequence_Check($input);\n}\n%typemap(in,\n         fragment=\"NumPy_Fragments\")\n  (DIM_TYPE DIM1, DIM_TYPE DIM2, DIM_TYPE DIM3, DIM_TYPE DIM4, DATA_TYPE* IN_FARRAY4)\n  (PyArrayObject* array=NULL, int is_new_object=0)\n{\n  npy_intp size[4] = { -1, -1, -1 , -1 };\n  array = obj_to_array_fortran_allow_conversion($input, DATA_TYPECODE,\n                                                   &is_new_object);\n  if (!array || !require_dimensions(array, 4) ||\n      !require_size(array, size, 4) || !require_fortran(array)) SWIG_fail;\n  $1 = (DIM_TYPE) array_size(array,0);\n  $2 = (DIM_TYPE) array_size(array,1);\n  $3 = (DIM_TYPE) array_size(array,2);\n  $4 = (DIM_TYPE) array_size(array,3);\n  $5 = (DATA_TYPE*) array_data(array);\n}\n%typemap(freearg)\n  (DIM_TYPE DIM1, DIM_TYPE DIM2, DIM_TYPE DIM3, DIM_TYPE DIM4, DATA_TYPE* IN_FARRAY4)\n{\n  if (is_new_object$argnum && array$argnum)\n    { Py_DECREF(array$argnum); }\n}\n\n/***************************/\n/* In-Place Array Typemaps */\n/***************************/\n\n/* Typemap suite for (DATA_TYPE INPLACE_ARRAY1[ANY])\n */\n%typecheck(SWIG_TYPECHECK_DOUBLE_ARRAY,\n           fragment=\"NumPy_Macros\")\n  (DATA_TYPE INPLACE_ARRAY1[ANY])\n{\n  $1 = is_array($input) && PyArray_EquivTypenums(array_type($input),\n                                                 DATA_TYPECODE);\n}\n%typemap(in,\n         fragment=\"NumPy_Fragments\")\n  (DATA_TYPE INPLACE_ARRAY1[ANY])\n  (PyArrayObject* array=NULL)\n{\n  npy_intp size[1] = { $1_dim0 };\n  array = obj_to_array_no_conversion($input, DATA_TYPECODE);\n  if (!array || !require_dimensions(array,1) || !require_size(array, size, 1) ||\n      !require_contiguous(array) || !require_native(array)) SWIG_fail;\n  $1 = ($1_ltype) array_data(array);\n}\n\n/* Typemap suite for (DATA_TYPE* INPLACE_ARRAY1, DIM_TYPE DIM1)\n */\n%typecheck(SWIG_TYPECHECK_DOUBLE_ARRAY,\n           fragment=\"NumPy_Macros\")\n  (DATA_TYPE* INPLACE_ARRAY1, DIM_TYPE DIM1)\n{\n  $1 = is_array($input) && PyArray_EquivTypenums(array_type($input),\n                                                 DATA_TYPECODE);\n}\n%typemap(in,\n         fragment=\"NumPy_Fragments\")\n  (DATA_TYPE* INPLACE_ARRAY1, DIM_TYPE DIM1)\n  (PyArrayObject* array=NULL, int i=1)\n{\n  array = obj_to_array_no_conversion($input, DATA_TYPECODE);\n  if (!array || !require_dimensions(array,1) || !require_contiguous(array)\n      || !require_native(array)) SWIG_fail;\n  $1 = (DATA_TYPE*) array_data(array);\n  $2 = 1;\n  for (i=0; i < array_numdims(array); ++i) $2 *= array_size(array,i);\n}\n\n/* Typemap suite for (DIM_TYPE DIM1, DATA_TYPE* INPLACE_ARRAY1)\n */\n%typecheck(SWIG_TYPECHECK_DOUBLE_ARRAY,\n           fragment=\"NumPy_Macros\")\n  (DIM_TYPE DIM1, DATA_TYPE* INPLACE_ARRAY1)\n{\n  $1 = is_array($input) && PyArray_EquivTypenums(array_type($input),\n                                                 DATA_TYPECODE);\n}\n%typemap(in,\n         fragment=\"NumPy_Fragments\")\n  (DIM_TYPE DIM1, DATA_TYPE* INPLACE_ARRAY1)\n  (PyArrayObject* array=NULL, int i=0)\n{\n  array = obj_to_array_no_conversion($input, DATA_TYPECODE);\n  if (!array || !require_dimensions(array,1) || !require_contiguous(array)\n      || !require_native(array)) SWIG_fail;\n  $1 = 1;\n  for (i=0; i < array_numdims(array); ++i) $1 *= array_size(array,i);\n  $2 = (DATA_TYPE*) array_data(array);\n}\n\n/* Typemap suite for (DATA_TYPE INPLACE_ARRAY2[ANY][ANY])\n */\n%typecheck(SWIG_TYPECHECK_DOUBLE_ARRAY,\n           fragment=\"NumPy_Macros\")\n  (DATA_TYPE INPLACE_ARRAY2[ANY][ANY])\n{\n  $1 = is_array($input) && PyArray_EquivTypenums(array_type($input),\n                                                 DATA_TYPECODE);\n}\n%typemap(in,\n         fragment=\"NumPy_Fragments\")\n  (DATA_TYPE INPLACE_ARRAY2[ANY][ANY])\n  (PyArrayObject* array=NULL)\n{\n  npy_intp size[2] = { $1_dim0, $1_dim1 };\n  array = obj_to_array_no_conversion($input, DATA_TYPECODE);\n  if (!array || !require_dimensions(array,2) || !require_size(array, size, 2) ||\n      !require_contiguous(array) || !require_native(array)) SWIG_fail;\n  $1 = ($1_ltype) array_data(array);\n}\n\n/* Typemap suite for (DATA_TYPE* INPLACE_ARRAY2, DIM_TYPE DIM1, DIM_TYPE DIM2)\n */\n%typecheck(SWIG_TYPECHECK_DOUBLE_ARRAY,\n           fragment=\"NumPy_Macros\")\n  (DATA_TYPE* INPLACE_ARRAY2, DIM_TYPE DIM1, DIM_TYPE DIM2)\n{\n  $1 = is_array($input) && PyArray_EquivTypenums(array_type($input),\n                                                 DATA_TYPECODE);\n}\n%typemap(in,\n         fragment=\"NumPy_Fragments\")\n  (DATA_TYPE* INPLACE_ARRAY2, DIM_TYPE DIM1, DIM_TYPE DIM2)\n  (PyArrayObject* array=NULL)\n{\n  array = obj_to_array_no_conversion($input, DATA_TYPECODE);\n  if (!array || !require_dimensions(array,2) || !require_contiguous(array)\n      || !require_native(array)) SWIG_fail;\n  $1 = (DATA_TYPE*) array_data(array);\n  $2 = (DIM_TYPE) array_size(array,0);\n  $3 = (DIM_TYPE) array_size(array,1);\n}\n\n/* Typemap suite for (DIM_TYPE DIM1, DIM_TYPE DIM2, DATA_TYPE* INPLACE_ARRAY2)\n */\n%typecheck(SWIG_TYPECHECK_DOUBLE_ARRAY,\n           fragment=\"NumPy_Macros\")\n  (DIM_TYPE DIM1, DIM_TYPE DIM2, DATA_TYPE* INPLACE_ARRAY2)\n{\n  $1 = is_array($input) && PyArray_EquivTypenums(array_type($input),\n                                                 DATA_TYPECODE);\n}\n%typemap(in,\n         fragment=\"NumPy_Fragments\")\n  (DIM_TYPE DIM1, DIM_TYPE DIM2, DATA_TYPE* INPLACE_ARRAY2)\n  (PyArrayObject* array=NULL)\n{\n  array = obj_to_array_no_conversion($input, DATA_TYPECODE);\n  if (!array || !require_dimensions(array,2) || !require_contiguous(array) ||\n      !require_native(array)) SWIG_fail;\n  $1 = (DIM_TYPE) array_size(array,0);\n  $2 = (DIM_TYPE) array_size(array,1);\n  $3 = (DATA_TYPE*) array_data(array);\n}\n\n/* Typemap suite for (DATA_TYPE* INPLACE_FARRAY2, DIM_TYPE DIM1, DIM_TYPE DIM2)\n */\n%typecheck(SWIG_TYPECHECK_DOUBLE_ARRAY,\n           fragment=\"NumPy_Macros\")\n  (DATA_TYPE* INPLACE_FARRAY2, DIM_TYPE DIM1, DIM_TYPE DIM2)\n{\n  $1 = is_array($input) && PyArray_EquivTypenums(array_type($input),\n                                                 DATA_TYPECODE);\n}\n%typemap(in,\n         fragment=\"NumPy_Fragments\")\n  (DATA_TYPE* INPLACE_FARRAY2, DIM_TYPE DIM1, DIM_TYPE DIM2)\n  (PyArrayObject* array=NULL)\n{\n  array = obj_to_array_no_conversion($input, DATA_TYPECODE);\n  if (!array || !require_dimensions(array,2) || !require_contiguous(array)\n      || !require_native(array) || !require_fortran(array)) SWIG_fail;\n  $1 = (DATA_TYPE*) array_data(array);\n  $2 = (DIM_TYPE) array_size(array,0);\n  $3 = (DIM_TYPE) array_size(array,1);\n}\n\n/* Typemap suite for (DIM_TYPE DIM1, DIM_TYPE DIM2, DATA_TYPE* INPLACE_FARRAY2)\n */\n%typecheck(SWIG_TYPECHECK_DOUBLE_ARRAY,\n           fragment=\"NumPy_Macros\")\n  (DIM_TYPE DIM1, DIM_TYPE DIM2, DATA_TYPE* INPLACE_FARRAY2)\n{\n  $1 = is_array($input) && PyArray_EquivTypenums(array_type($input),\n                                                 DATA_TYPECODE);\n}\n%typemap(in,\n         fragment=\"NumPy_Fragments\")\n  (DIM_TYPE DIM1, DIM_TYPE DIM2, DATA_TYPE* INPLACE_FARRAY2)\n  (PyArrayObject* array=NULL)\n{\n  array = obj_to_array_no_conversion($input, DATA_TYPECODE);\n  if (!array || !require_dimensions(array,2) || !require_contiguous(array) ||\n      !require_native(array) || !require_fortran(array)) SWIG_fail;\n  $1 = (DIM_TYPE) array_size(array,0);\n  $2 = (DIM_TYPE) array_size(array,1);\n  $3 = (DATA_TYPE*) array_data(array);\n}\n\n/* Typemap suite for (DATA_TYPE INPLACE_ARRAY3[ANY][ANY][ANY])\n */\n%typecheck(SWIG_TYPECHECK_DOUBLE_ARRAY,\n           fragment=\"NumPy_Macros\")\n  (DATA_TYPE INPLACE_ARRAY3[ANY][ANY][ANY])\n{\n  $1 = is_array($input) && PyArray_EquivTypenums(array_type($input),\n                                                 DATA_TYPECODE);\n}\n%typemap(in,\n         fragment=\"NumPy_Fragments\")\n  (DATA_TYPE INPLACE_ARRAY3[ANY][ANY][ANY])\n  (PyArrayObject* array=NULL)\n{\n  npy_intp size[3] = { $1_dim0, $1_dim1, $1_dim2 };\n  array = obj_to_array_no_conversion($input, DATA_TYPECODE);\n  if (!array || !require_dimensions(array,3) || !require_size(array, size, 3) ||\n      !require_contiguous(array) || !require_native(array)) SWIG_fail;\n  $1 = ($1_ltype) array_data(array);\n}\n\n/* Typemap suite for (DATA_TYPE* INPLACE_ARRAY3, DIM_TYPE DIM1, DIM_TYPE DIM2,\n *                    DIM_TYPE DIM3)\n */\n%typecheck(SWIG_TYPECHECK_DOUBLE_ARRAY,\n           fragment=\"NumPy_Macros\")\n  (DATA_TYPE* INPLACE_ARRAY3, DIM_TYPE DIM1, DIM_TYPE DIM2, DIM_TYPE DIM3)\n{\n  $1 = is_array($input) && PyArray_EquivTypenums(array_type($input),\n                                                 DATA_TYPECODE);\n}\n%typemap(in,\n         fragment=\"NumPy_Fragments\")\n  (DATA_TYPE* INPLACE_ARRAY3, DIM_TYPE DIM1, DIM_TYPE DIM2, DIM_TYPE DIM3)\n  (PyArrayObject* array=NULL)\n{\n  array = obj_to_array_no_conversion($input, DATA_TYPECODE);\n  if (!array || !require_dimensions(array,3) || !require_contiguous(array) ||\n      !require_native(array)) SWIG_fail;\n  $1 = (DATA_TYPE*) array_data(array);\n  $2 = (DIM_TYPE) array_size(array,0);\n  $3 = (DIM_TYPE) array_size(array,1);\n  $4 = (DIM_TYPE) array_size(array,2);\n}\n\n/* Typemap suite for (DATA_TYPE** INPLACE_ARRAY3, DIM_TYPE DIM1, DIM_TYPE DIM2,\n *                    DIM_TYPE DIM3)\n */\n%typecheck(SWIG_TYPECHECK_DOUBLE_ARRAY,\n           fragment=\"NumPy_Macros\")\n  (DATA_TYPE** INPLACE_ARRAY3, DIM_TYPE DIM1, DIM_TYPE DIM2, DIM_TYPE DIM3)\n{\n  $1 = PySequence_Check($input);\n}\n%typemap(in,\n         fragment=\"NumPy_Fragments\")\n  (DATA_TYPE** INPLACE_ARRAY3, DIM_TYPE DIM1, DIM_TYPE DIM2, DIM_TYPE DIM3)\n  (DATA_TYPE** array=NULL, PyArrayObject** object_array=NULL)\n{\n  npy_intp size[2] = { -1, -1 };\n  PyArrayObject* temp_array;\n  Py_ssize_t i;\n\n  /* length of the list */\n  $2 = PyList_Size($input);\n\n  /* the arrays */\n  array = (DATA_TYPE **)malloc($2*sizeof(DATA_TYPE *));\n  object_array = (PyArrayObject **)calloc($2,sizeof(PyArrayObject *));\n\n  if (array == NULL || object_array == NULL)\n  {\n    SWIG_fail;\n  }\n\n  for (i=0; i<$2; i++)\n  {\n    temp_array = obj_to_array_no_conversion(PySequence_GetItem($input,i), DATA_TYPECODE);\n\n    /* the new array must be stored so that it can be destroyed in freearg */\n    object_array[i] = temp_array;\n\n    if ( !temp_array || !require_dimensions(temp_array, 2) ||\n      !require_contiguous(temp_array) ||\n      !require_native(temp_array) ||\n      !PyArray_EquivTypenums(array_type(temp_array), DATA_TYPECODE)\n    ) SWIG_fail;\n\n    /* store the size of the first array in the list, then use that for comparison. */\n    if (i == 0)\n    {\n      size[0] = array_size(temp_array,0);\n      size[1] = array_size(temp_array,1);\n    }\n\n    if (!require_size(temp_array, size, 2)) SWIG_fail;\n\n    array[i] = (DATA_TYPE*) array_data(temp_array);\n  }\n\n  $1 = (DATA_TYPE**) array;\n  $3 = (DIM_TYPE) size[0];\n  $4 = (DIM_TYPE) size[1];\n}\n%typemap(freearg)\n  (DATA_TYPE** INPLACE_ARRAY3, DIM_TYPE DIM1, DIM_TYPE DIM2, DIM_TYPE DIM3)\n{\n  if (array$argnum!=NULL) free(array$argnum);\n  if (object_array$argnum!=NULL) free(object_array$argnum);\n}\n\n/* Typemap suite for (DIM_TYPE DIM1, DIM_TYPE DIM2, DIM_TYPE DIM3,\n *                    DATA_TYPE* INPLACE_ARRAY3)\n */\n%typecheck(SWIG_TYPECHECK_DOUBLE_ARRAY,\n           fragment=\"NumPy_Macros\")\n  (DIM_TYPE DIM1, DIM_TYPE DIM2, DIM_TYPE DIM3, DATA_TYPE* INPLACE_ARRAY3)\n{\n  $1 = is_array($input) && PyArray_EquivTypenums(array_type($input),\n                                                 DATA_TYPECODE);\n}\n%typemap(in,\n         fragment=\"NumPy_Fragments\")\n  (DIM_TYPE DIM1, DIM_TYPE DIM2, DIM_TYPE DIM3, DATA_TYPE* INPLACE_ARRAY3)\n  (PyArrayObject* array=NULL)\n{\n  array = obj_to_array_no_conversion($input, DATA_TYPECODE);\n  if (!array || !require_dimensions(array,3) || !require_contiguous(array)\n      || !require_native(array)) SWIG_fail;\n  $1 = (DIM_TYPE) array_size(array,0);\n  $2 = (DIM_TYPE) array_size(array,1);\n  $3 = (DIM_TYPE) array_size(array,2);\n  $4 = (DATA_TYPE*) array_data(array);\n}\n\n/* Typemap suite for (DATA_TYPE* INPLACE_FARRAY3, DIM_TYPE DIM1, DIM_TYPE DIM2,\n *                    DIM_TYPE DIM3)\n */\n%typecheck(SWIG_TYPECHECK_DOUBLE_ARRAY,\n           fragment=\"NumPy_Macros\")\n  (DATA_TYPE* INPLACE_FARRAY3, DIM_TYPE DIM1, DIM_TYPE DIM2, DIM_TYPE DIM3)\n{\n  $1 = is_array($input) && PyArray_EquivTypenums(array_type($input),\n                                                 DATA_TYPECODE);\n}\n%typemap(in,\n         fragment=\"NumPy_Fragments\")\n  (DATA_TYPE* INPLACE_FARRAY3, DIM_TYPE DIM1, DIM_TYPE DIM2, DIM_TYPE DIM3)\n  (PyArrayObject* array=NULL)\n{\n  array = obj_to_array_no_conversion($input, DATA_TYPECODE);\n  if (!array || !require_dimensions(array,3) || !require_contiguous(array) ||\n      !require_native(array) || !require_fortran(array)) SWIG_fail;\n  $1 = (DATA_TYPE*) array_data(array);\n  $2 = (DIM_TYPE) array_size(array,0);\n  $3 = (DIM_TYPE) array_size(array,1);\n  $4 = (DIM_TYPE) array_size(array,2);\n}\n\n/* Typemap suite for (DIM_TYPE DIM1, DIM_TYPE DIM2, DIM_TYPE DIM3,\n *                    DATA_TYPE* INPLACE_FARRAY3)\n */\n%typecheck(SWIG_TYPECHECK_DOUBLE_ARRAY,\n           fragment=\"NumPy_Macros\")\n  (DIM_TYPE DIM1, DIM_TYPE DIM2, DIM_TYPE DIM3, DATA_TYPE* INPLACE_FARRAY3)\n{\n  $1 = is_array($input) && PyArray_EquivTypenums(array_type($input),\n                                                 DATA_TYPECODE);\n}\n%typemap(in,\n         fragment=\"NumPy_Fragments\")\n  (DIM_TYPE DIM1, DIM_TYPE DIM2, DIM_TYPE DIM3, DATA_TYPE* INPLACE_FARRAY3)\n  (PyArrayObject* array=NULL)\n{\n  array = obj_to_array_no_conversion($input, DATA_TYPECODE);\n  if (!array || !require_dimensions(array,3) || !require_contiguous(array)\n      || !require_native(array) || !require_fortran(array)) SWIG_fail;\n  $1 = (DIM_TYPE) array_size(array,0);\n  $2 = (DIM_TYPE) array_size(array,1);\n  $3 = (DIM_TYPE) array_size(array,2);\n  $4 = (DATA_TYPE*) array_data(array);\n}\n\n/* Typemap suite for (DATA_TYPE INPLACE_ARRAY4[ANY][ANY][ANY][ANY])\n */\n%typecheck(SWIG_TYPECHECK_DOUBLE_ARRAY,\n           fragment=\"NumPy_Macros\")\n  (DATA_TYPE INPLACE_ARRAY4[ANY][ANY][ANY][ANY])\n{\n  $1 = is_array($input) && PyArray_EquivTypenums(array_type($input),\n                                                 DATA_TYPECODE);\n}\n%typemap(in,\n         fragment=\"NumPy_Fragments\")\n  (DATA_TYPE INPLACE_ARRAY4[ANY][ANY][ANY][ANY])\n  (PyArrayObject* array=NULL)\n{\n  npy_intp size[4] = { $1_dim0, $1_dim1, $1_dim2 , $1_dim3 };\n  array = obj_to_array_no_conversion($input, DATA_TYPECODE);\n  if (!array || !require_dimensions(array,4) || !require_size(array, size, 4) ||\n      !require_contiguous(array) || !require_native(array)) SWIG_fail;\n  $1 = ($1_ltype) array_data(array);\n}\n\n/* Typemap suite for (DATA_TYPE* INPLACE_ARRAY4, DIM_TYPE DIM1, DIM_TYPE DIM2,\n *                    DIM_TYPE DIM3, DIM_TYPE DIM4)\n */\n%typecheck(SWIG_TYPECHECK_DOUBLE_ARRAY,\n           fragment=\"NumPy_Macros\")\n  (DATA_TYPE* INPLACE_ARRAY4, DIM_TYPE DIM1, DIM_TYPE DIM2, DIM_TYPE DIM3, DIM_TYPE DIM4)\n{\n  $1 = is_array($input) && PyArray_EquivTypenums(array_type($input),\n                                                 DATA_TYPECODE);\n}\n%typemap(in,\n         fragment=\"NumPy_Fragments\")\n  (DATA_TYPE* INPLACE_ARRAY4, DIM_TYPE DIM1, DIM_TYPE DIM2, DIM_TYPE DIM3, DIM_TYPE DIM4)\n  (PyArrayObject* array=NULL)\n{\n  array = obj_to_array_no_conversion($input, DATA_TYPECODE);\n  if (!array || !require_dimensions(array,4) || !require_contiguous(array) ||\n      !require_native(array)) SWIG_fail;\n  $1 = (DATA_TYPE*) array_data(array);\n  $2 = (DIM_TYPE) array_size(array,0);\n  $3 = (DIM_TYPE) array_size(array,1);\n  $4 = (DIM_TYPE) array_size(array,2);\n  $5 = (DIM_TYPE) array_size(array,3);\n}\n\n/* Typemap suite for (DATA_TYPE** INPLACE_ARRAY4, DIM_TYPE DIM1, DIM_TYPE DIM2,\n *                    DIM_TYPE DIM3, DIM_TYPE DIM4)\n */\n%typecheck(SWIG_TYPECHECK_DOUBLE_ARRAY,\n           fragment=\"NumPy_Macros\")\n  (DATA_TYPE** INPLACE_ARRAY4, DIM_TYPE DIM1, DIM_TYPE DIM2, DIM_TYPE DIM3, DIM_TYPE DIM4)\n{\n  $1 = PySequence_Check($input);\n}\n%typemap(in,\n         fragment=\"NumPy_Fragments\")\n  (DATA_TYPE** INPLACE_ARRAY4, DIM_TYPE DIM1, DIM_TYPE DIM2, DIM_TYPE DIM3, DIM_TYPE DIM4)\n  (DATA_TYPE** array=NULL, PyArrayObject** object_array=NULL)\n{\n  npy_intp size[3] = { -1, -1, -1 };\n  PyArrayObject* temp_array;\n  Py_ssize_t i;\n\n  /* length of the list */\n  $2 = PyList_Size($input);\n\n  /* the arrays */\n  array = (DATA_TYPE **)malloc($2*sizeof(DATA_TYPE *));\n  object_array = (PyArrayObject **)calloc($2,sizeof(PyArrayObject *));\n\n  if (array == NULL || object_array == NULL)\n  {\n    SWIG_fail;\n  }\n\n  for (i=0; i<$2; i++)\n  {\n    temp_array = obj_to_array_no_conversion(PySequence_GetItem($input,i), DATA_TYPECODE);\n\n    /* the new array must be stored so that it can be destroyed in freearg */\n    object_array[i] = temp_array;\n\n    if ( !temp_array || !require_dimensions(temp_array, 3) ||\n      !require_contiguous(temp_array) ||\n      !require_native(temp_array) ||\n      !PyArray_EquivTypenums(array_type(temp_array), DATA_TYPECODE)\n    ) SWIG_fail;\n\n    /* store the size of the first array in the list, then use that for comparison. */\n    if (i == 0)\n    {\n      size[0] = array_size(temp_array,0);\n      size[1] = array_size(temp_array,1);\n      size[2] = array_size(temp_array,2);\n    }\n\n    if (!require_size(temp_array, size, 3)) SWIG_fail;\n\n    array[i] = (DATA_TYPE*) array_data(temp_array);\n  }\n\n  $1 = (DATA_TYPE**) array;\n  $3 = (DIM_TYPE) size[0];\n  $4 = (DIM_TYPE) size[1];\n  $5 = (DIM_TYPE) size[2];\n}\n%typemap(freearg)\n  (DATA_TYPE** INPLACE_ARRAY4, DIM_TYPE DIM1, DIM_TYPE DIM2, DIM_TYPE DIM3, DIM_TYPE DIM4)\n{\n  if (array$argnum!=NULL) free(array$argnum);\n  if (object_array$argnum!=NULL) free(object_array$argnum);\n}\n\n/* Typemap suite for (DIM_TYPE DIM1, DIM_TYPE DIM2, DIM_TYPE DIM3, DIM_TYPE DIM4,\n *                    DATA_TYPE* INPLACE_ARRAY4)\n */\n%typecheck(SWIG_TYPECHECK_DOUBLE_ARRAY,\n           fragment=\"NumPy_Macros\")\n  (DIM_TYPE DIM1, DIM_TYPE DIM2, DIM_TYPE DIM3, DIM_TYPE DIM4, DATA_TYPE* INPLACE_ARRAY4)\n{\n  $1 = is_array($input) && PyArray_EquivTypenums(array_type($input),\n                                                 DATA_TYPECODE);\n}\n%typemap(in,\n         fragment=\"NumPy_Fragments\")\n  (DIM_TYPE DIM1, DIM_TYPE DIM2, DIM_TYPE DIM3, DIM_TYPE DIM4, DATA_TYPE* INPLACE_ARRAY4)\n  (PyArrayObject* array=NULL)\n{\n  array = obj_to_array_no_conversion($input, DATA_TYPECODE);\n  if (!array || !require_dimensions(array,4) || !require_contiguous(array)\n      || !require_native(array)) SWIG_fail;\n  $1 = (DIM_TYPE) array_size(array,0);\n  $2 = (DIM_TYPE) array_size(array,1);\n  $3 = (DIM_TYPE) array_size(array,2);\n  $4 = (DIM_TYPE) array_size(array,3);\n  $5 = (DATA_TYPE*) array_data(array);\n}\n\n/* Typemap suite for (DATA_TYPE* INPLACE_FARRAY4, DIM_TYPE DIM1, DIM_TYPE DIM2,\n *                    DIM_TYPE DIM3, DIM_TYPE DIM4)\n */\n%typecheck(SWIG_TYPECHECK_DOUBLE_ARRAY,\n           fragment=\"NumPy_Macros\")\n  (DATA_TYPE* INPLACE_FARRAY4, DIM_TYPE DIM1, DIM_TYPE DIM2, DIM_TYPE DIM3, DIM_TYPE DIM4)\n{\n  $1 = is_array($input) && PyArray_EquivTypenums(array_type($input),\n                                                 DATA_TYPECODE);\n}\n%typemap(in,\n         fragment=\"NumPy_Fragments\")\n  (DATA_TYPE* INPLACE_FARRAY4, DIM_TYPE DIM1, DIM_TYPE DIM2, DIM_TYPE DIM3, DIM_TYPE DIM4)\n  (PyArrayObject* array=NULL)\n{\n  array = obj_to_array_no_conversion($input, DATA_TYPECODE);\n  if (!array || !require_dimensions(array,4) || !require_contiguous(array) ||\n      !require_native(array) || !require_fortran(array)) SWIG_fail;\n  $1 = (DATA_TYPE*) array_data(array);\n  $2 = (DIM_TYPE) array_size(array,0);\n  $3 = (DIM_TYPE) array_size(array,1);\n  $4 = (DIM_TYPE) array_size(array,2);\n  $5 = (DIM_TYPE) array_size(array,3);\n}\n\n/* Typemap suite for (DIM_TYPE DIM1, DIM_TYPE DIM2, DIM_TYPE DIM3,\n *                    DATA_TYPE* INPLACE_FARRAY4)\n */\n%typecheck(SWIG_TYPECHECK_DOUBLE_ARRAY,\n           fragment=\"NumPy_Macros\")\n  (DIM_TYPE DIM1, DIM_TYPE DIM2, DIM_TYPE DIM3, DIM_TYPE DIM4, DATA_TYPE* INPLACE_FARRAY4)\n{\n  $1 = is_array($input) && PyArray_EquivTypenums(array_type($input),\n                                                 DATA_TYPECODE);\n}\n%typemap(in,\n         fragment=\"NumPy_Fragments\")\n  (DIM_TYPE DIM1, DIM_TYPE DIM2, DIM_TYPE DIM3, DIM_TYPE DIM4, DATA_TYPE* INPLACE_FARRAY4)\n  (PyArrayObject* array=NULL)\n{\n  array = obj_to_array_no_conversion($input, DATA_TYPECODE);\n  if (!array || !require_dimensions(array,4) || !require_contiguous(array)\n      || !require_native(array) || !require_fortran(array)) SWIG_fail;\n  $1 = (DIM_TYPE) array_size(array,0);\n  $2 = (DIM_TYPE) array_size(array,1);\n  $3 = (DIM_TYPE) array_size(array,2);\n  $4 = (DIM_TYPE) array_size(array,3);\n  $5 = (DATA_TYPE*) array_data(array);\n}\n\n/*************************/\n/* Argout Array Typemaps */\n/*************************/\n\n/* Typemap suite for (DATA_TYPE ARGOUT_ARRAY1[ANY])\n */\n%typemap(in,numinputs=0,\n         fragment=\"NumPy_Backward_Compatibility,NumPy_Macros\")\n  (DATA_TYPE ARGOUT_ARRAY1[ANY])\n  (PyObject* array = NULL)\n{\n  npy_intp dims[1] = { $1_dim0 };\n  array = PyArray_SimpleNew(1, dims, DATA_TYPECODE);\n  if (!array) SWIG_fail;\n  $1 = ($1_ltype) array_data(array);\n}\n%typemap(argout)\n  (DATA_TYPE ARGOUT_ARRAY1[ANY])\n{\n  $result = SWIG_Python_AppendOutput($result,(PyObject*)array$argnum);\n}\n\n/* Typemap suite for (DATA_TYPE* ARGOUT_ARRAY1, DIM_TYPE DIM1)\n */\n%typemap(in,numinputs=1,\n         fragment=\"NumPy_Fragments\")\n  (DATA_TYPE* ARGOUT_ARRAY1, DIM_TYPE DIM1)\n  (PyObject* array = NULL)\n{\n  npy_intp dims[1];\n  if (!PyInt_Check($input))\n  {\n    const char* typestring = pytype_string($input);\n    PyErr_Format(PyExc_TypeError,\n                 \"Int dimension expected.  '%s' given.\",\n                 typestring);\n    SWIG_fail;\n  }\n  $2 = (DIM_TYPE) PyInt_AsLong($input);\n  dims[0] = (npy_intp) $2;\n  array = PyArray_SimpleNew(1, dims, DATA_TYPECODE);\n  if (!array) SWIG_fail;\n  $1 = (DATA_TYPE*) array_data(array);\n}\n%typemap(argout)\n  (DATA_TYPE* ARGOUT_ARRAY1, DIM_TYPE DIM1)\n{\n  $result = SWIG_Python_AppendOutput($result,(PyObject*)array$argnum);\n}\n\n/* Typemap suite for (DIM_TYPE DIM1, DATA_TYPE* ARGOUT_ARRAY1)\n */\n%typemap(in,numinputs=1,\n         fragment=\"NumPy_Fragments\")\n  (DIM_TYPE DIM1, DATA_TYPE* ARGOUT_ARRAY1)\n  (PyObject* array = NULL)\n{\n  npy_intp dims[1];\n  if (!PyInt_Check($input))\n  {\n    const char* typestring = pytype_string($input);\n    PyErr_Format(PyExc_TypeError,\n                 \"Int dimension expected.  '%s' given.\",\n                 typestring);\n    SWIG_fail;\n  }\n  $1 = (DIM_TYPE) PyInt_AsLong($input);\n  dims[0] = (npy_intp) $1;\n  array = PyArray_SimpleNew(1, dims, DATA_TYPECODE);\n  if (!array) SWIG_fail;\n  $2 = (DATA_TYPE*) array_data(array);\n}\n%typemap(argout)\n  (DIM_TYPE DIM1, DATA_TYPE* ARGOUT_ARRAY1)\n{\n  $result = SWIG_Python_AppendOutput($result,(PyObject*)array$argnum);\n}\n\n/* Typemap suite for (DATA_TYPE ARGOUT_ARRAY2[ANY][ANY])\n */\n%typemap(in,numinputs=0,\n         fragment=\"NumPy_Backward_Compatibility,NumPy_Macros\")\n  (DATA_TYPE ARGOUT_ARRAY2[ANY][ANY])\n  (PyObject* array = NULL)\n{\n  npy_intp dims[2] = { $1_dim0, $1_dim1 };\n  array = PyArray_SimpleNew(2, dims, DATA_TYPECODE);\n  if (!array) SWIG_fail;\n  $1 = ($1_ltype) array_data(array);\n}\n%typemap(argout)\n  (DATA_TYPE ARGOUT_ARRAY2[ANY][ANY])\n{\n  $result = SWIG_Python_AppendOutput($result,(PyObject*)array$argnum);\n}\n\n/* Typemap suite for (DATA_TYPE ARGOUT_ARRAY3[ANY][ANY][ANY])\n */\n%typemap(in,numinputs=0,\n         fragment=\"NumPy_Backward_Compatibility,NumPy_Macros\")\n  (DATA_TYPE ARGOUT_ARRAY3[ANY][ANY][ANY])\n  (PyObject* array = NULL)\n{\n  npy_intp dims[3] = { $1_dim0, $1_dim1, $1_dim2 };\n  array = PyArray_SimpleNew(3, dims, DATA_TYPECODE);\n  if (!array) SWIG_fail;\n  $1 = ($1_ltype) array_data(array);\n}\n%typemap(argout)\n  (DATA_TYPE ARGOUT_ARRAY3[ANY][ANY][ANY])\n{\n  $result = SWIG_Python_AppendOutput($result,(PyObject*)array$argnum);\n}\n\n/* Typemap suite for (DATA_TYPE ARGOUT_ARRAY4[ANY][ANY][ANY][ANY])\n */\n%typemap(in,numinputs=0,\n         fragment=\"NumPy_Backward_Compatibility,NumPy_Macros\")\n  (DATA_TYPE ARGOUT_ARRAY4[ANY][ANY][ANY][ANY])\n  (PyObject* array = NULL)\n{\n  npy_intp dims[4] = { $1_dim0, $1_dim1, $1_dim2, $1_dim3 };\n  array = PyArray_SimpleNew(4, dims, DATA_TYPECODE);\n  if (!array) SWIG_fail;\n  $1 = ($1_ltype) array_data(array);\n}\n%typemap(argout)\n  (DATA_TYPE ARGOUT_ARRAY4[ANY][ANY][ANY][ANY])\n{\n  $result = SWIG_Python_AppendOutput($result,(PyObject*)array$argnum);\n}\n\n/*****************************/\n/* Argoutview Array Typemaps */\n/*****************************/\n\n/* Typemap suite for (DATA_TYPE** ARGOUTVIEW_ARRAY1, DIM_TYPE* DIM1)\n */\n%typemap(in,numinputs=0)\n  (DATA_TYPE** ARGOUTVIEW_ARRAY1, DIM_TYPE* DIM1    )\n  (DATA_TYPE*  data_temp = NULL , DIM_TYPE  dim_temp)\n{\n  $1 = &data_temp;\n  $2 = &dim_temp;\n}\n%typemap(argout,\n         fragment=\"NumPy_Backward_Compatibility\")\n  (DATA_TYPE** ARGOUTVIEW_ARRAY1, DIM_TYPE* DIM1)\n{\n  npy_intp dims[1] = { *$2 };\n  PyObject* obj = PyArray_SimpleNewFromData(1, dims, DATA_TYPECODE, (void*)(*$1));\n  PyArrayObject* array = (PyArrayObject*) obj;\n\n  if (!array) SWIG_fail;\n  $result = SWIG_Python_AppendOutput($result,obj);\n}\n\n/* Typemap suite for (DIM_TYPE* DIM1, DATA_TYPE** ARGOUTVIEW_ARRAY1)\n */\n%typemap(in,numinputs=0)\n  (DIM_TYPE* DIM1    , DATA_TYPE** ARGOUTVIEW_ARRAY1)\n  (DIM_TYPE  dim_temp, DATA_TYPE*  data_temp = NULL )\n{\n  $1 = &dim_temp;\n  $2 = &data_temp;\n}\n%typemap(argout,\n         fragment=\"NumPy_Backward_Compatibility\")\n  (DIM_TYPE* DIM1, DATA_TYPE** ARGOUTVIEW_ARRAY1)\n{\n  npy_intp dims[1] = { *$1 };\n  PyObject* obj = PyArray_SimpleNewFromData(1, dims, DATA_TYPECODE, (void*)(*$2));\n  PyArrayObject* array = (PyArrayObject*) obj;\n\n  if (!array) SWIG_fail;\n  $result = SWIG_Python_AppendOutput($result,obj);\n}\n\n/* Typemap suite for (DATA_TYPE** ARGOUTVIEW_ARRAY2, DIM_TYPE* DIM1, DIM_TYPE* DIM2)\n */\n%typemap(in,numinputs=0)\n  (DATA_TYPE** ARGOUTVIEW_ARRAY2, DIM_TYPE* DIM1     , DIM_TYPE* DIM2     )\n  (DATA_TYPE*  data_temp = NULL , DIM_TYPE  dim1_temp, DIM_TYPE  dim2_temp)\n{\n  $1 = &data_temp;\n  $2 = &dim1_temp;\n  $3 = &dim2_temp;\n}\n%typemap(argout,\n         fragment=\"NumPy_Backward_Compatibility\")\n  (DATA_TYPE** ARGOUTVIEW_ARRAY2, DIM_TYPE* DIM1, DIM_TYPE* DIM2)\n{\n  npy_intp dims[2] = { *$2, *$3 };\n  PyObject* obj = PyArray_SimpleNewFromData(2, dims, DATA_TYPECODE, (void*)(*$1));\n  PyArrayObject* array = (PyArrayObject*) obj;\n\n  if (!array) SWIG_fail;\n  $result = SWIG_Python_AppendOutput($result,obj);\n}\n\n/* Typemap suite for (DIM_TYPE* DIM1, DIM_TYPE* DIM2, DATA_TYPE** ARGOUTVIEW_ARRAY2)\n */\n%typemap(in,numinputs=0)\n  (DIM_TYPE* DIM1     , DIM_TYPE* DIM2     , DATA_TYPE** ARGOUTVIEW_ARRAY2)\n  (DIM_TYPE  dim1_temp, DIM_TYPE  dim2_temp, DATA_TYPE*  data_temp = NULL )\n{\n  $1 = &dim1_temp;\n  $2 = &dim2_temp;\n  $3 = &data_temp;\n}\n%typemap(argout,\n         fragment=\"NumPy_Backward_Compatibility\")\n  (DIM_TYPE* DIM1, DIM_TYPE* DIM2, DATA_TYPE** ARGOUTVIEW_ARRAY2)\n{\n  npy_intp dims[2] = { *$1, *$2 };\n  PyObject* obj = PyArray_SimpleNewFromData(2, dims, DATA_TYPECODE, (void*)(*$3));\n  PyArrayObject* array = (PyArrayObject*) obj;\n\n  if (!array) SWIG_fail;\n  $result = SWIG_Python_AppendOutput($result,obj);\n}\n\n/* Typemap suite for (DATA_TYPE** ARGOUTVIEW_FARRAY2, DIM_TYPE* DIM1, DIM_TYPE* DIM2)\n */\n%typemap(in,numinputs=0)\n  (DATA_TYPE** ARGOUTVIEW_FARRAY2, DIM_TYPE* DIM1     , DIM_TYPE* DIM2     )\n  (DATA_TYPE*  data_temp = NULL  , DIM_TYPE  dim1_temp, DIM_TYPE  dim2_temp)\n{\n  $1 = &data_temp;\n  $2 = &dim1_temp;\n  $3 = &dim2_temp;\n}\n%typemap(argout,\n         fragment=\"NumPy_Backward_Compatibility,NumPy_Array_Requirements\")\n  (DATA_TYPE** ARGOUTVIEW_FARRAY2, DIM_TYPE* DIM1, DIM_TYPE* DIM2)\n{\n  npy_intp dims[2] = { *$2, *$3 };\n  PyObject* obj = PyArray_SimpleNewFromData(2, dims, DATA_TYPECODE, (void*)(*$1));\n  PyArrayObject* array = (PyArrayObject*) obj;\n\n  if (!array || !require_fortran(array)) SWIG_fail;\n  $result = SWIG_Python_AppendOutput($result,obj);\n}\n\n/* Typemap suite for (DIM_TYPE* DIM1, DIM_TYPE* DIM2, DATA_TYPE** ARGOUTVIEW_FARRAY2)\n */\n%typemap(in,numinputs=0)\n  (DIM_TYPE* DIM1     , DIM_TYPE* DIM2     , DATA_TYPE** ARGOUTVIEW_FARRAY2)\n  (DIM_TYPE  dim1_temp, DIM_TYPE  dim2_temp, DATA_TYPE*  data_temp = NULL  )\n{\n  $1 = &dim1_temp;\n  $2 = &dim2_temp;\n  $3 = &data_temp;\n}\n%typemap(argout,\n         fragment=\"NumPy_Backward_Compatibility,NumPy_Array_Requirements\")\n  (DIM_TYPE* DIM1, DIM_TYPE* DIM2, DATA_TYPE** ARGOUTVIEW_FARRAY2)\n{\n  npy_intp dims[2] = { *$1, *$2 };\n  PyObject* obj = PyArray_SimpleNewFromData(2, dims, DATA_TYPECODE, (void*)(*$3));\n  PyArrayObject* array = (PyArrayObject*) obj;\n\n  if (!array || !require_fortran(array)) SWIG_fail;\n  $result = SWIG_Python_AppendOutput($result,obj);\n}\n\n/* Typemap suite for (DATA_TYPE** ARGOUTVIEW_ARRAY3, DIM_TYPE* DIM1, DIM_TYPE* DIM2,\n                      DIM_TYPE* DIM3)\n */\n%typemap(in,numinputs=0)\n  (DATA_TYPE** ARGOUTVIEW_ARRAY3, DIM_TYPE* DIM1    , DIM_TYPE* DIM2    , DIM_TYPE* DIM3    )\n  (DATA_TYPE* data_temp = NULL  , DIM_TYPE dim1_temp, DIM_TYPE dim2_temp, DIM_TYPE dim3_temp)\n{\n  $1 = &data_temp;\n  $2 = &dim1_temp;\n  $3 = &dim2_temp;\n  $4 = &dim3_temp;\n}\n%typemap(argout,\n         fragment=\"NumPy_Backward_Compatibility\")\n  (DATA_TYPE** ARGOUTVIEW_ARRAY3, DIM_TYPE* DIM1, DIM_TYPE* DIM2, DIM_TYPE* DIM3)\n{\n  npy_intp dims[3] = { *$2, *$3, *$4 };\n  PyObject* obj = PyArray_SimpleNewFromData(3, dims, DATA_TYPECODE, (void*)(*$1));\n  PyArrayObject* array = (PyArrayObject*) obj;\n\n  if (!array) SWIG_fail;\n  $result = SWIG_Python_AppendOutput($result,obj);\n}\n\n/* Typemap suite for (DIM_TYPE* DIM1, DIM_TYPE* DIM2, DIM_TYPE* DIM3,\n                      DATA_TYPE** ARGOUTVIEW_ARRAY3)\n */\n%typemap(in,numinputs=0)\n  (DIM_TYPE* DIM1, DIM_TYPE* DIM2, DIM_TYPE* DIM3, DATA_TYPE** ARGOUTVIEW_ARRAY3)\n  (DIM_TYPE dim1_temp, DIM_TYPE dim2_temp, DIM_TYPE dim3_temp, DATA_TYPE* data_temp = NULL)\n{\n  $1 = &dim1_temp;\n  $2 = &dim2_temp;\n  $3 = &dim3_temp;\n  $4 = &data_temp;\n}\n%typemap(argout,\n         fragment=\"NumPy_Backward_Compatibility\")\n  (DIM_TYPE* DIM1, DIM_TYPE* DIM2, DIM_TYPE* DIM3, DATA_TYPE** ARGOUTVIEW_ARRAY3)\n{\n  npy_intp dims[3] = { *$1, *$2, *$3 };\n  PyObject* obj = PyArray_SimpleNewFromData(3, dims, DATA_TYPECODE, (void*)(*$4));\n  PyArrayObject* array = (PyArrayObject*) obj;\n\n  if (!array) SWIG_fail;\n  $result = SWIG_Python_AppendOutput($result,obj);\n}\n\n/* Typemap suite for (DATA_TYPE** ARGOUTVIEW_FARRAY3, DIM_TYPE* DIM1, DIM_TYPE* DIM2,\n                      DIM_TYPE* DIM3)\n */\n%typemap(in,numinputs=0)\n  (DATA_TYPE** ARGOUTVIEW_FARRAY3, DIM_TYPE* DIM1    , DIM_TYPE* DIM2    , DIM_TYPE* DIM3    )\n  (DATA_TYPE* data_temp = NULL   , DIM_TYPE dim1_temp, DIM_TYPE dim2_temp, DIM_TYPE dim3_temp)\n{\n  $1 = &data_temp;\n  $2 = &dim1_temp;\n  $3 = &dim2_temp;\n  $4 = &dim3_temp;\n}\n%typemap(argout,\n         fragment=\"NumPy_Backward_Compatibility,NumPy_Array_Requirements\")\n  (DATA_TYPE** ARGOUTVIEW_FARRAY3, DIM_TYPE* DIM1, DIM_TYPE* DIM2, DIM_TYPE* DIM3)\n{\n  npy_intp dims[3] = { *$2, *$3, *$4 };\n  PyObject* obj = PyArray_SimpleNewFromData(3, dims, DATA_TYPECODE, (void*)(*$1));\n  PyArrayObject* array = (PyArrayObject*) obj;\n\n  if (!array || !require_fortran(array)) SWIG_fail;\n  $result = SWIG_Python_AppendOutput($result,obj);\n}\n\n/* Typemap suite for (DIM_TYPE* DIM1, DIM_TYPE* DIM2, DIM_TYPE* DIM3,\n                      DATA_TYPE** ARGOUTVIEW_FARRAY3)\n */\n%typemap(in,numinputs=0)\n  (DIM_TYPE* DIM1    , DIM_TYPE* DIM2    , DIM_TYPE* DIM3    , DATA_TYPE** ARGOUTVIEW_FARRAY3)\n  (DIM_TYPE dim1_temp, DIM_TYPE dim2_temp, DIM_TYPE dim3_temp, DATA_TYPE* data_temp = NULL   )\n{\n  $1 = &dim1_temp;\n  $2 = &dim2_temp;\n  $3 = &dim3_temp;\n  $4 = &data_temp;\n}\n%typemap(argout,\n         fragment=\"NumPy_Backward_Compatibility,NumPy_Array_Requirements\")\n  (DIM_TYPE* DIM1, DIM_TYPE* DIM2, DIM_TYPE* DIM3, DATA_TYPE** ARGOUTVIEW_FARRAY3)\n{\n  npy_intp dims[3] = { *$1, *$2, *$3 };\n  PyObject* obj = PyArray_SimpleNewFromData(3, dims, DATA_TYPECODE, (void*)(*$4));\n  PyArrayObject* array = (PyArrayObject*) obj;\n\n  if (!array || !require_fortran(array)) SWIG_fail;\n  $result = SWIG_Python_AppendOutput($result,obj);\n}\n\n/* Typemap suite for (DATA_TYPE** ARGOUTVIEW_ARRAY4, DIM_TYPE* DIM1, DIM_TYPE* DIM2,\n                      DIM_TYPE* DIM3, DIM_TYPE* DIM4)\n */\n%typemap(in,numinputs=0)\n  (DATA_TYPE** ARGOUTVIEW_ARRAY4, DIM_TYPE* DIM1    , DIM_TYPE* DIM2    , DIM_TYPE* DIM3    , DIM_TYPE* DIM4    )\n  (DATA_TYPE* data_temp = NULL  , DIM_TYPE dim1_temp, DIM_TYPE dim2_temp, DIM_TYPE dim3_temp, DIM_TYPE dim4_temp)\n{\n  $1 = &data_temp;\n  $2 = &dim1_temp;\n  $3 = &dim2_temp;\n  $4 = &dim3_temp;\n  $5 = &dim4_temp;\n}\n%typemap(argout,\n         fragment=\"NumPy_Backward_Compatibility\")\n  (DATA_TYPE** ARGOUTVIEW_ARRAY4, DIM_TYPE* DIM1, DIM_TYPE* DIM2, DIM_TYPE* DIM3, DIM_TYPE* DIM4)\n{\n  npy_intp dims[4] = { *$2, *$3, *$4 , *$5 };\n  PyObject* obj = PyArray_SimpleNewFromData(4, dims, DATA_TYPECODE, (void*)(*$1));\n  PyArrayObject* array = (PyArrayObject*) obj;\n\n  if (!array) SWIG_fail;\n  $result = SWIG_Python_AppendOutput($result,obj);\n}\n\n/* Typemap suite for (DIM_TYPE* DIM1, DIM_TYPE* DIM2, DIM_TYPE* DIM3, DIM_TYPE* DIM4,\n                      DATA_TYPE** ARGOUTVIEW_ARRAY4)\n */\n%typemap(in,numinputs=0)\n  (DIM_TYPE* DIM1    , DIM_TYPE* DIM2    , DIM_TYPE* DIM3    , DIM_TYPE* DIM4    , DATA_TYPE** ARGOUTVIEW_ARRAY4)\n  (DIM_TYPE dim1_temp, DIM_TYPE dim2_temp, DIM_TYPE dim3_temp, DIM_TYPE dim4_temp, DATA_TYPE* data_temp = NULL  )\n{\n  $1 = &dim1_temp;\n  $2 = &dim2_temp;\n  $3 = &dim3_temp;\n  $4 = &dim4_temp;\n  $5 = &data_temp;\n}\n%typemap(argout,\n         fragment=\"NumPy_Backward_Compatibility\")\n  (DIM_TYPE* DIM1, DIM_TYPE* DIM2, DIM_TYPE* DIM3, DIM_TYPE* DIM4, DATA_TYPE** ARGOUTVIEW_ARRAY4)\n{\n  npy_intp dims[4] = { *$1, *$2, *$3 , *$4 };\n  PyObject* obj = PyArray_SimpleNewFromData(4, dims, DATA_TYPECODE, (void*)(*$5));\n  PyArrayObject* array = (PyArrayObject*) obj;\n\n  if (!array) SWIG_fail;\n  $result = SWIG_Python_AppendOutput($result,obj);\n}\n\n/* Typemap suite for (DATA_TYPE** ARGOUTVIEW_FARRAY4, DIM_TYPE* DIM1, DIM_TYPE* DIM2,\n                      DIM_TYPE* DIM3, DIM_TYPE* DIM4)\n */\n%typemap(in,numinputs=0)\n  (DATA_TYPE** ARGOUTVIEW_FARRAY4, DIM_TYPE* DIM1    , DIM_TYPE* DIM2    , DIM_TYPE* DIM3    , DIM_TYPE* DIM4    )\n  (DATA_TYPE* data_temp = NULL   , DIM_TYPE dim1_temp, DIM_TYPE dim2_temp, DIM_TYPE dim3_temp, DIM_TYPE dim4_temp)\n{\n  $1 = &data_temp;\n  $2 = &dim1_temp;\n  $3 = &dim2_temp;\n  $4 = &dim3_temp;\n  $5 = &dim4_temp;\n}\n%typemap(argout,\n         fragment=\"NumPy_Backward_Compatibility,NumPy_Array_Requirements\")\n  (DATA_TYPE** ARGOUTVIEW_FARRAY4, DIM_TYPE* DIM1, DIM_TYPE* DIM2, DIM_TYPE* DIM3, DIM_TYPE* DIM4)\n{\n  npy_intp dims[4] = { *$2, *$3, *$4 , *$5 };\n  PyObject* obj = PyArray_SimpleNewFromData(4, dims, DATA_TYPECODE, (void*)(*$1));\n  PyArrayObject* array = (PyArrayObject*) obj;\n\n  if (!array || !require_fortran(array)) SWIG_fail;\n  $result = SWIG_Python_AppendOutput($result,obj);\n}\n\n/* Typemap suite for (DIM_TYPE* DIM1, DIM_TYPE* DIM2, DIM_TYPE* DIM3, DIM_TYPE* DIM4,\n                      DATA_TYPE** ARGOUTVIEW_FARRAY4)\n */\n%typemap(in,numinputs=0)\n  (DIM_TYPE* DIM1    , DIM_TYPE* DIM2    , DIM_TYPE* DIM3    , DIM_TYPE* DIM4    , DATA_TYPE** ARGOUTVIEW_FARRAY4)\n  (DIM_TYPE dim1_temp, DIM_TYPE dim2_temp, DIM_TYPE dim3_temp, DIM_TYPE dim4_temp, DATA_TYPE* data_temp = NULL   )\n{\n  $1 = &dim1_temp;\n  $2 = &dim2_temp;\n  $3 = &dim3_temp;\n  $4 = &dim4_temp;\n  $5 = &data_temp;\n}\n%typemap(argout,\n         fragment=\"NumPy_Backward_Compatibility,NumPy_Array_Requirements\")\n  (DIM_TYPE* DIM1, DIM_TYPE* DIM2, DIM_TYPE* DIM3, DIM_TYPE* DIM4, DATA_TYPE** ARGOUTVIEW_FARRAY4)\n{\n  npy_intp dims[4] = { *$1, *$2, *$3 , *$4 };\n  PyObject* obj = PyArray_SimpleNewFromData(4, dims, DATA_TYPECODE, (void*)(*$5));\n  PyArrayObject* array = (PyArrayObject*) obj;\n\n  if (!array || !require_fortran(array)) SWIG_fail;\n  $result = SWIG_Python_AppendOutput($result,obj);\n}\n\n/*************************************/\n/* Managed Argoutview Array Typemaps */\n/*************************************/\n\n/* Typemap suite for (DATA_TYPE** ARGOUTVIEWM_ARRAY1, DIM_TYPE* DIM1)\n */\n%typemap(in,numinputs=0)\n  (DATA_TYPE** ARGOUTVIEWM_ARRAY1, DIM_TYPE* DIM1    )\n  (DATA_TYPE*  data_temp = NULL  , DIM_TYPE  dim_temp)\n{\n  $1 = &data_temp;\n  $2 = &dim_temp;\n}\n%typemap(argout,\n         fragment=\"NumPy_Backward_Compatibility,NumPy_Utilities\")\n  (DATA_TYPE** ARGOUTVIEWM_ARRAY1, DIM_TYPE* DIM1)\n{\n  npy_intp dims[1] = { *$2 };\n  PyObject* obj = PyArray_SimpleNewFromData(1, dims, DATA_TYPECODE, (void*)(*$1));\n  PyArrayObject* array = (PyArrayObject*) obj;\n\n  if (!array) SWIG_fail;\n\n%#ifdef SWIGPY_USE_CAPSULE\n    PyObject* cap = PyCapsule_New((void*)(*$1), SWIGPY_CAPSULE_NAME, free_cap);\n%#else\n    PyObject* cap = PyCObject_FromVoidPtr((void*)(*$1), free);\n%#endif\n\n%#if NPY_API_VERSION < 0x00000007\n  PyArray_BASE(array) = cap;\n%#else\n  PyArray_SetBaseObject(array,cap);\n%#endif\n\n  $result = SWIG_Python_AppendOutput($result,obj);\n}\n\n/* Typemap suite for (DIM_TYPE* DIM1, DATA_TYPE** ARGOUTVIEWM_ARRAY1)\n */\n%typemap(in,numinputs=0)\n  (DIM_TYPE* DIM1    , DATA_TYPE** ARGOUTVIEWM_ARRAY1)\n  (DIM_TYPE  dim_temp, DATA_TYPE*  data_temp = NULL  )\n{\n  $1 = &dim_temp;\n  $2 = &data_temp;\n}\n%typemap(argout,\n         fragment=\"NumPy_Backward_Compatibility,NumPy_Utilities\")\n  (DIM_TYPE* DIM1, DATA_TYPE** ARGOUTVIEWM_ARRAY1)\n{\n  npy_intp dims[1] = { *$1 };\n  PyObject* obj = PyArray_SimpleNewFromData(1, dims, DATA_TYPECODE, (void*)(*$2));\n  PyArrayObject* array = (PyArrayObject*) obj;\n\n  if (!array) SWIG_fail;\n\n%#ifdef SWIGPY_USE_CAPSULE\n    PyObject* cap = PyCapsule_New((void*)(*$1), SWIGPY_CAPSULE_NAME, free_cap);\n%#else\n    PyObject* cap = PyCObject_FromVoidPtr((void*)(*$1), free);\n%#endif\n\n%#if NPY_API_VERSION < 0x00000007\n  PyArray_BASE(array) = cap;\n%#else\n  PyArray_SetBaseObject(array,cap);\n%#endif\n\n  $result = SWIG_Python_AppendOutput($result,obj);\n}\n\n/* Typemap suite for (DATA_TYPE** ARGOUTVIEWM_ARRAY2, DIM_TYPE* DIM1, DIM_TYPE* DIM2)\n */\n%typemap(in,numinputs=0)\n  (DATA_TYPE** ARGOUTVIEWM_ARRAY2, DIM_TYPE* DIM1     , DIM_TYPE* DIM2     )\n  (DATA_TYPE*  data_temp = NULL  , DIM_TYPE  dim1_temp, DIM_TYPE  dim2_temp)\n{\n  $1 = &data_temp;\n  $2 = &dim1_temp;\n  $3 = &dim2_temp;\n}\n%typemap(argout,\n         fragment=\"NumPy_Backward_Compatibility,NumPy_Utilities\")\n  (DATA_TYPE** ARGOUTVIEWM_ARRAY2, DIM_TYPE* DIM1, DIM_TYPE* DIM2)\n{\n  npy_intp dims[2] = { *$2, *$3 };\n  PyObject* obj = PyArray_SimpleNewFromData(2, dims, DATA_TYPECODE, (void*)(*$1));\n  PyArrayObject* array = (PyArrayObject*) obj;\n\n  if (!array) SWIG_fail;\n\n%#ifdef SWIGPY_USE_CAPSULE\n    PyObject* cap = PyCapsule_New((void*)(*$1), SWIGPY_CAPSULE_NAME, free_cap);\n%#else\n    PyObject* cap = PyCObject_FromVoidPtr((void*)(*$1), free);\n%#endif\n\n%#if NPY_API_VERSION < 0x00000007\n  PyArray_BASE(array) = cap;\n%#else\n  PyArray_SetBaseObject(array,cap);\n%#endif\n\n  $result = SWIG_Python_AppendOutput($result,obj);\n}\n\n/* Typemap suite for (DIM_TYPE* DIM1, DIM_TYPE* DIM2, DATA_TYPE** ARGOUTVIEWM_ARRAY2)\n */\n%typemap(in,numinputs=0)\n  (DIM_TYPE* DIM1     , DIM_TYPE* DIM2     , DATA_TYPE** ARGOUTVIEWM_ARRAY2)\n  (DIM_TYPE  dim1_temp, DIM_TYPE  dim2_temp, DATA_TYPE*  data_temp = NULL  )\n{\n  $1 = &dim1_temp;\n  $2 = &dim2_temp;\n  $3 = &data_temp;\n}\n%typemap(argout,\n         fragment=\"NumPy_Backward_Compatibility,NumPy_Utilities\")\n  (DIM_TYPE* DIM1, DIM_TYPE* DIM2, DATA_TYPE** ARGOUTVIEWM_ARRAY2)\n{\n  npy_intp dims[2] = { *$1, *$2 };\n  PyObject* obj = PyArray_SimpleNewFromData(2, dims, DATA_TYPECODE, (void*)(*$3));\n  PyArrayObject* array = (PyArrayObject*) obj;\n\n  if (!array) SWIG_fail;\n\n%#ifdef SWIGPY_USE_CAPSULE\n    PyObject* cap = PyCapsule_New((void*)(*$1), SWIGPY_CAPSULE_NAME, free_cap);\n%#else\n    PyObject* cap = PyCObject_FromVoidPtr((void*)(*$1), free);\n%#endif\n\n%#if NPY_API_VERSION < 0x00000007\n  PyArray_BASE(array) = cap;\n%#else\n  PyArray_SetBaseObject(array,cap);\n%#endif\n\n  $result = SWIG_Python_AppendOutput($result,obj);\n}\n\n/* Typemap suite for (DATA_TYPE** ARGOUTVIEWM_FARRAY2, DIM_TYPE* DIM1, DIM_TYPE* DIM2)\n */\n%typemap(in,numinputs=0)\n  (DATA_TYPE** ARGOUTVIEWM_FARRAY2, DIM_TYPE* DIM1     , DIM_TYPE* DIM2     )\n  (DATA_TYPE*  data_temp = NULL   , DIM_TYPE  dim1_temp, DIM_TYPE  dim2_temp)\n{\n  $1 = &data_temp;\n  $2 = &dim1_temp;\n  $3 = &dim2_temp;\n}\n%typemap(argout,\n         fragment=\"NumPy_Backward_Compatibility,NumPy_Array_Requirements,NumPy_Utilities\")\n  (DATA_TYPE** ARGOUTVIEWM_FARRAY2, DIM_TYPE* DIM1, DIM_TYPE* DIM2)\n{\n  npy_intp dims[2] = { *$2, *$3 };\n  PyObject* obj = PyArray_SimpleNewFromData(2, dims, DATA_TYPECODE, (void*)(*$1));\n  PyArrayObject* array = (PyArrayObject*) obj;\n\n  if (!array || !require_fortran(array)) SWIG_fail;\n\n%#ifdef SWIGPY_USE_CAPSULE\n    PyObject* cap = PyCapsule_New((void*)(*$1), SWIGPY_CAPSULE_NAME, free_cap);\n%#else\n    PyObject* cap = PyCObject_FromVoidPtr((void*)(*$1), free);\n%#endif\n\n%#if NPY_API_VERSION < 0x00000007\n  PyArray_BASE(array) = cap;\n%#else\n  PyArray_SetBaseObject(array,cap);\n%#endif\n\n  $result = SWIG_Python_AppendOutput($result,obj);\n}\n\n/* Typemap suite for (DIM_TYPE* DIM1, DIM_TYPE* DIM2, DATA_TYPE** ARGOUTVIEWM_FARRAY2)\n */\n%typemap(in,numinputs=0)\n  (DIM_TYPE* DIM1     , DIM_TYPE* DIM2     , DATA_TYPE** ARGOUTVIEWM_FARRAY2)\n  (DIM_TYPE  dim1_temp, DIM_TYPE  dim2_temp, DATA_TYPE*  data_temp = NULL   )\n{\n  $1 = &dim1_temp;\n  $2 = &dim2_temp;\n  $3 = &data_temp;\n}\n%typemap(argout,\n         fragment=\"NumPy_Backward_Compatibility,NumPy_Array_Requirements,NumPy_Utilities\")\n  (DIM_TYPE* DIM1, DIM_TYPE* DIM2, DATA_TYPE** ARGOUTVIEWM_FARRAY2)\n{\n  npy_intp dims[2] = { *$1, *$2 };\n  PyObject* obj = PyArray_SimpleNewFromData(2, dims, DATA_TYPECODE, (void*)(*$3));\n  PyArrayObject* array = (PyArrayObject*) obj;\n\n  if (!array || !require_fortran(array)) SWIG_fail;\n\n%#ifdef SWIGPY_USE_CAPSULE\n    PyObject* cap = PyCapsule_New((void*)(*$1), SWIGPY_CAPSULE_NAME, free_cap);\n%#else\n    PyObject* cap = PyCObject_FromVoidPtr((void*)(*$1), free);\n%#endif\n\n%#if NPY_API_VERSION < 0x00000007\n  PyArray_BASE(array) = cap;\n%#else\n  PyArray_SetBaseObject(array,cap);\n%#endif\n\n  $result = SWIG_Python_AppendOutput($result,obj);\n}\n\n/* Typemap suite for (DATA_TYPE** ARGOUTVIEWM_ARRAY3, DIM_TYPE* DIM1, DIM_TYPE* DIM2,\n                      DIM_TYPE* DIM3)\n */\n%typemap(in,numinputs=0)\n  (DATA_TYPE** ARGOUTVIEWM_ARRAY3, DIM_TYPE* DIM1    , DIM_TYPE* DIM2    , DIM_TYPE* DIM3    )\n  (DATA_TYPE* data_temp = NULL   , DIM_TYPE dim1_temp, DIM_TYPE dim2_temp, DIM_TYPE dim3_temp)\n{\n  $1 = &data_temp;\n  $2 = &dim1_temp;\n  $3 = &dim2_temp;\n  $4 = &dim3_temp;\n}\n%typemap(argout,\n         fragment=\"NumPy_Backward_Compatibility,NumPy_Utilities\")\n  (DATA_TYPE** ARGOUTVIEWM_ARRAY3, DIM_TYPE* DIM1, DIM_TYPE* DIM2, DIM_TYPE* DIM3)\n{\n  npy_intp dims[3] = { *$2, *$3, *$4 };\n  PyObject* obj = PyArray_SimpleNewFromData(3, dims, DATA_TYPECODE, (void*)(*$1));\n  PyArrayObject* array = (PyArrayObject*) obj;\n\n  if (!array) SWIG_fail;\n\n%#ifdef SWIGPY_USE_CAPSULE\n    PyObject* cap = PyCapsule_New((void*)(*$1), SWIGPY_CAPSULE_NAME, free_cap);\n%#else\n    PyObject* cap = PyCObject_FromVoidPtr((void*)(*$1), free);\n%#endif\n\n%#if NPY_API_VERSION < 0x00000007\n  PyArray_BASE(array) = cap;\n%#else\n  PyArray_SetBaseObject(array,cap);\n%#endif\n\n  $result = SWIG_Python_AppendOutput($result,obj);\n}\n\n/* Typemap suite for (DIM_TYPE* DIM1, DIM_TYPE* DIM2, DIM_TYPE* DIM3,\n                      DATA_TYPE** ARGOUTVIEWM_ARRAY3)\n */\n%typemap(in,numinputs=0)\n  (DIM_TYPE* DIM1    , DIM_TYPE* DIM2    , DIM_TYPE* DIM3    , DATA_TYPE** ARGOUTVIEWM_ARRAY3)\n  (DIM_TYPE dim1_temp, DIM_TYPE dim2_temp, DIM_TYPE dim3_temp, DATA_TYPE* data_temp = NULL   )\n{\n  $1 = &dim1_temp;\n  $2 = &dim2_temp;\n  $3 = &dim3_temp;\n  $4 = &data_temp;\n}\n%typemap(argout,\n         fragment=\"NumPy_Backward_Compatibility,NumPy_Utilities\")\n  (DIM_TYPE* DIM1, DIM_TYPE* DIM2, DIM_TYPE* DIM3, DATA_TYPE** ARGOUTVIEWM_ARRAY3)\n{\n  npy_intp dims[3] = { *$1, *$2, *$3 };\n  PyObject* obj= PyArray_SimpleNewFromData(3, dims, DATA_TYPECODE, (void*)(*$4));\n  PyArrayObject* array = (PyArrayObject*) obj;\n\n  if (!array) SWIG_fail;\n\n%#ifdef SWIGPY_USE_CAPSULE\n    PyObject* cap = PyCapsule_New((void*)(*$1), SWIGPY_CAPSULE_NAME, free_cap);\n%#else\n    PyObject* cap = PyCObject_FromVoidPtr((void*)(*$1), free);\n%#endif\n\n%#if NPY_API_VERSION < 0x00000007\n  PyArray_BASE(array) = cap;\n%#else\n  PyArray_SetBaseObject(array,cap);\n%#endif\n\n  $result = SWIG_Python_AppendOutput($result,obj);\n}\n\n/* Typemap suite for (DATA_TYPE** ARGOUTVIEWM_FARRAY3, DIM_TYPE* DIM1, DIM_TYPE* DIM2,\n                      DIM_TYPE* DIM3)\n */\n%typemap(in,numinputs=0)\n  (DATA_TYPE** ARGOUTVIEWM_FARRAY3, DIM_TYPE* DIM1    , DIM_TYPE* DIM2    , DIM_TYPE* DIM3    )\n  (DATA_TYPE* data_temp = NULL    , DIM_TYPE dim1_temp, DIM_TYPE dim2_temp, DIM_TYPE dim3_temp)\n{\n  $1 = &data_temp;\n  $2 = &dim1_temp;\n  $3 = &dim2_temp;\n  $4 = &dim3_temp;\n}\n%typemap(argout,\n         fragment=\"NumPy_Backward_Compatibility,NumPy_Array_Requirements,NumPy_Utilities\")\n  (DATA_TYPE** ARGOUTVIEWM_FARRAY3, DIM_TYPE* DIM1, DIM_TYPE* DIM2, DIM_TYPE* DIM3)\n{\n  npy_intp dims[3] = { *$2, *$3, *$4 };\n  PyObject* obj = PyArray_SimpleNewFromData(3, dims, DATA_TYPECODE, (void*)(*$1));\n  PyArrayObject* array = (PyArrayObject*) obj;\n\n  if (!array || !require_fortran(array)) SWIG_fail;\n\n%#ifdef SWIGPY_USE_CAPSULE\n    PyObject* cap = PyCapsule_New((void*)(*$1), SWIGPY_CAPSULE_NAME, free_cap);\n%#else\n    PyObject* cap = PyCObject_FromVoidPtr((void*)(*$1), free);\n%#endif\n\n%#if NPY_API_VERSION < 0x00000007\n  PyArray_BASE(array) = cap;\n%#else\n  PyArray_SetBaseObject(array,cap);\n%#endif\n\n  $result = SWIG_Python_AppendOutput($result,obj);\n}\n\n/* Typemap suite for (DIM_TYPE* DIM1, DIM_TYPE* DIM2, DIM_TYPE* DIM3,\n                      DATA_TYPE** ARGOUTVIEWM_FARRAY3)\n */\n%typemap(in,numinputs=0)\n  (DIM_TYPE* DIM1    , DIM_TYPE* DIM2    , DIM_TYPE* DIM3    , DATA_TYPE** ARGOUTVIEWM_FARRAY3)\n  (DIM_TYPE dim1_temp, DIM_TYPE dim2_temp, DIM_TYPE dim3_temp, DATA_TYPE* data_temp = NULL    )\n{\n  $1 = &dim1_temp;\n  $2 = &dim2_temp;\n  $3 = &dim3_temp;\n  $4 = &data_temp;\n}\n%typemap(argout,\n         fragment=\"NumPy_Backward_Compatibility,NumPy_Array_Requirements,NumPy_Utilities\")\n  (DIM_TYPE* DIM1, DIM_TYPE* DIM2, DIM_TYPE* DIM3, DATA_TYPE** ARGOUTVIEWM_FARRAY3)\n{\n  npy_intp dims[3] = { *$1, *$2, *$3 };\n  PyObject* obj = PyArray_SimpleNewFromData(3, dims, DATA_TYPECODE, (void*)(*$4));\n  PyArrayObject* array = (PyArrayObject*) obj;\n\n  if (!array || !require_fortran(array)) SWIG_fail;\n\n%#ifdef SWIGPY_USE_CAPSULE\n    PyObject* cap = PyCapsule_New((void*)(*$1), SWIGPY_CAPSULE_NAME, free_cap);\n%#else\n    PyObject* cap = PyCObject_FromVoidPtr((void*)(*$1), free);\n%#endif\n\n%#if NPY_API_VERSION < 0x00000007\n  PyArray_BASE(array) = cap;\n%#else\n  PyArray_SetBaseObject(array,cap);\n%#endif\n\n  $result = SWIG_Python_AppendOutput($result,obj);\n}\n\n/* Typemap suite for (DATA_TYPE** ARGOUTVIEWM_ARRAY4, DIM_TYPE* DIM1, DIM_TYPE* DIM2,\n                      DIM_TYPE* DIM3, DIM_TYPE* DIM4)\n */\n%typemap(in,numinputs=0)\n  (DATA_TYPE** ARGOUTVIEWM_ARRAY4, DIM_TYPE* DIM1    , DIM_TYPE* DIM2    , DIM_TYPE* DIM3    , DIM_TYPE* DIM4    )\n  (DATA_TYPE* data_temp = NULL   , DIM_TYPE dim1_temp, DIM_TYPE dim2_temp, DIM_TYPE dim3_temp, DIM_TYPE dim4_temp)\n{\n  $1 = &data_temp;\n  $2 = &dim1_temp;\n  $3 = &dim2_temp;\n  $4 = &dim3_temp;\n  $5 = &dim4_temp;\n}\n%typemap(argout,\n         fragment=\"NumPy_Backward_Compatibility,NumPy_Utilities\")\n  (DATA_TYPE** ARGOUTVIEWM_ARRAY4, DIM_TYPE* DIM1, DIM_TYPE* DIM2, DIM_TYPE* DIM3, DIM_TYPE* DIM4)\n{\n  npy_intp dims[4] = { *$2, *$3, *$4 , *$5 };\n  PyObject* obj = PyArray_SimpleNewFromData(4, dims, DATA_TYPECODE, (void*)(*$1));\n  PyArrayObject* array = (PyArrayObject*) obj;\n\n  if (!array) SWIG_fail;\n\n%#ifdef SWIGPY_USE_CAPSULE\n    PyObject* cap = PyCapsule_New((void*)(*$1), SWIGPY_CAPSULE_NAME, free_cap);\n%#else\n    PyObject* cap = PyCObject_FromVoidPtr((void*)(*$1), free);\n%#endif\n\n%#if NPY_API_VERSION < 0x00000007\n  PyArray_BASE(array) = cap;\n%#else\n  PyArray_SetBaseObject(array,cap);\n%#endif\n\n  $result = SWIG_Python_AppendOutput($result,obj);\n}\n\n/* Typemap suite for (DIM_TYPE* DIM1, DIM_TYPE* DIM2, DIM_TYPE* DIM3, DIM_TYPE* DIM4,\n                      DATA_TYPE** ARGOUTVIEWM_ARRAY4)\n */\n%typemap(in,numinputs=0)\n  (DIM_TYPE* DIM1    , DIM_TYPE* DIM2    , DIM_TYPE* DIM3    , DIM_TYPE* DIM4    , DATA_TYPE** ARGOUTVIEWM_ARRAY4)\n  (DIM_TYPE dim1_temp, DIM_TYPE dim2_temp, DIM_TYPE dim3_temp, DIM_TYPE dim4_temp, DATA_TYPE* data_temp = NULL   )\n{\n  $1 = &dim1_temp;\n  $2 = &dim2_temp;\n  $3 = &dim3_temp;\n  $4 = &dim4_temp;\n  $5 = &data_temp;\n}\n%typemap(argout,\n         fragment=\"NumPy_Backward_Compatibility,NumPy_Utilities\")\n  (DIM_TYPE* DIM1, DIM_TYPE* DIM2, DIM_TYPE* DIM3, DIM_TYPE* DIM4, DATA_TYPE** ARGOUTVIEWM_ARRAY4)\n{\n  npy_intp dims[4] = { *$1, *$2, *$3 , *$4 };\n  PyObject* obj = PyArray_SimpleNewFromData(4, dims, DATA_TYPECODE, (void*)(*$5));\n  PyArrayObject* array = (PyArrayObject*) obj;\n\n  if (!array) SWIG_fail;\n\n%#ifdef SWIGPY_USE_CAPSULE\n    PyObject* cap = PyCapsule_New((void*)(*$1), SWIGPY_CAPSULE_NAME, free_cap);\n%#else\n    PyObject* cap = PyCObject_FromVoidPtr((void*)(*$1), free);\n%#endif\n\n%#if NPY_API_VERSION < 0x00000007\n  PyArray_BASE(array) = cap;\n%#else\n  PyArray_SetBaseObject(array,cap);\n%#endif\n\n  $result = SWIG_Python_AppendOutput($result,obj);\n}\n\n/* Typemap suite for (DATA_TYPE** ARGOUTVIEWM_FARRAY4, DIM_TYPE* DIM1, DIM_TYPE* DIM2,\n                      DIM_TYPE* DIM3, DIM_TYPE* DIM4)\n */\n%typemap(in,numinputs=0)\n  (DATA_TYPE** ARGOUTVIEWM_FARRAY4, DIM_TYPE* DIM1    , DIM_TYPE* DIM2    , DIM_TYPE* DIM3    , DIM_TYPE* DIM4    )\n  (DATA_TYPE* data_temp = NULL    , DIM_TYPE dim1_temp, DIM_TYPE dim2_temp, DIM_TYPE dim3_temp, DIM_TYPE dim4_temp)\n{\n  $1 = &data_temp;\n  $2 = &dim1_temp;\n  $3 = &dim2_temp;\n  $4 = &dim3_temp;\n  $5 = &dim4_temp;\n}\n%typemap(argout,\n         fragment=\"NumPy_Backward_Compatibility,NumPy_Array_Requirements,NumPy_Utilities\")\n  (DATA_TYPE** ARGOUTVIEWM_FARRAY4, DIM_TYPE* DIM1, DIM_TYPE* DIM2, DIM_TYPE* DIM3)\n{\n  npy_intp dims[4] = { *$2, *$3, *$4 , *$5 };\n  PyObject* obj = PyArray_SimpleNewFromData(4, dims, DATA_TYPECODE, (void*)(*$1));\n  PyArrayObject* array = (PyArrayObject*) obj;\n\n  if (!array || !require_fortran(array)) SWIG_fail;\n\n%#ifdef SWIGPY_USE_CAPSULE\n    PyObject* cap = PyCapsule_New((void*)(*$1), SWIGPY_CAPSULE_NAME, free_cap);\n%#else\n    PyObject* cap = PyCObject_FromVoidPtr((void*)(*$1), free);\n%#endif\n\n%#if NPY_API_VERSION < 0x00000007\n  PyArray_BASE(array) = cap;\n%#else\n  PyArray_SetBaseObject(array,cap);\n%#endif\n\n  $result = SWIG_Python_AppendOutput($result,obj);\n}\n\n/* Typemap suite for (DIM_TYPE* DIM1, DIM_TYPE* DIM2, DIM_TYPE* DIM3, DIM_TYPE* DIM4,\n                      DATA_TYPE** ARGOUTVIEWM_FARRAY4)\n */\n%typemap(in,numinputs=0)\n  (DIM_TYPE* DIM1    , DIM_TYPE* DIM2    , DIM_TYPE* DIM3    , DIM_TYPE* DIM4    , DATA_TYPE** ARGOUTVIEWM_FARRAY4)\n  (DIM_TYPE dim1_temp, DIM_TYPE dim2_temp, DIM_TYPE dim3_temp, DIM_TYPE dim4_temp, DATA_TYPE* data_temp = NULL    )\n{\n  $1 = &dim1_temp;\n  $2 = &dim2_temp;\n  $3 = &dim3_temp;\n  $4 = &dim4_temp;\n  $5 = &data_temp;\n}\n%typemap(argout,\n         fragment=\"NumPy_Backward_Compatibility,NumPy_Array_Requirements,NumPy_Utilities\")\n  (DIM_TYPE* DIM1, DIM_TYPE* DIM2, DIM_TYPE* DIM3, DIM_TYPE* DIM4, DATA_TYPE** ARGOUTVIEWM_FARRAY4)\n{\n  npy_intp dims[4] = { *$1, *$2, *$3 , *$4 };\n  PyObject* obj = PyArray_SimpleNewFromData(4, dims, DATA_TYPECODE, (void*)(*$5));\n  PyArrayObject* array = (PyArrayObject*) obj;\n\n  if (!array || !require_fortran(array)) SWIG_fail;\n\n%#ifdef SWIGPY_USE_CAPSULE\n    PyObject* cap = PyCapsule_New((void*)(*$1), SWIGPY_CAPSULE_NAME, free_cap);\n%#else\n    PyObject* cap = PyCObject_FromVoidPtr((void*)(*$1), free);\n%#endif\n\n%#if NPY_API_VERSION < 0x00000007\n  PyArray_BASE(array) = cap;\n%#else\n  PyArray_SetBaseObject(array,cap);\n%#endif\n\n  $result = SWIG_Python_AppendOutput($result,obj);\n}\n\n/* Typemap suite for (DATA_TYPE** ARGOUTVIEWM_ARRAY4, DIM_TYPE* DIM1, DIM_TYPE* DIM2,\n                      DIM_TYPE* DIM3, DIM_TYPE* DIM4)\n */\n%typemap(in,numinputs=0)\n  (DATA_TYPE** ARGOUTVIEWM_ARRAY4, DIM_TYPE* DIM1    , DIM_TYPE* DIM2    , DIM_TYPE* DIM3    , DIM_TYPE* DIM4    )\n  (DATA_TYPE* data_temp = NULL   , DIM_TYPE dim1_temp, DIM_TYPE dim2_temp, DIM_TYPE dim3_temp, DIM_TYPE dim4_temp)\n{\n  $1 = &data_temp;\n  $2 = &dim1_temp;\n  $3 = &dim2_temp;\n  $4 = &dim3_temp;\n  $5 = &dim4_temp;\n}\n%typemap(argout,\n         fragment=\"NumPy_Backward_Compatibility,NumPy_Utilities\")\n  (DATA_TYPE** ARGOUTVIEWM_ARRAY4, DIM_TYPE* DIM1, DIM_TYPE* DIM2, DIM_TYPE* DIM3, DIM_TYPE* DIM4)\n{\n  npy_intp dims[4] = { *$2, *$3, *$4 , *$5 };\n  PyObject* obj = PyArray_SimpleNewFromData(4, dims, DATA_TYPECODE, (void*)(*$1));\n  PyArrayObject* array = (PyArrayObject*) obj;\n\n  if (!array) SWIG_fail;\n\n%#ifdef SWIGPY_USE_CAPSULE\n    PyObject* cap = PyCapsule_New((void*)(*$1), SWIGPY_CAPSULE_NAME, free_cap);\n%#else\n    PyObject* cap = PyCObject_FromVoidPtr((void*)(*$1), free);\n%#endif\n\n%#if NPY_API_VERSION < 0x00000007\n  PyArray_BASE(array) = cap;\n%#else\n  PyArray_SetBaseObject(array,cap);\n%#endif\n\n  $result = SWIG_Python_AppendOutput($result,obj);\n}\n\n/* Typemap suite for (DIM_TYPE* DIM1, DIM_TYPE* DIM2, DIM_TYPE* DIM3, DIM_TYPE* DIM4,\n                      DATA_TYPE** ARGOUTVIEWM_ARRAY4)\n */\n%typemap(in,numinputs=0)\n  (DIM_TYPE* DIM1    , DIM_TYPE* DIM2    , DIM_TYPE* DIM3    , DIM_TYPE* DIM4    , DATA_TYPE** ARGOUTVIEWM_ARRAY4)\n  (DIM_TYPE dim1_temp, DIM_TYPE dim2_temp, DIM_TYPE dim3_temp, DIM_TYPE dim4_temp, DATA_TYPE* data_temp = NULL   )\n{\n  $1 = &dim1_temp;\n  $2 = &dim2_temp;\n  $3 = &dim3_temp;\n  $4 = &dim4_temp;\n  $5 = &data_temp;\n}\n%typemap(argout,\n         fragment=\"NumPy_Backward_Compatibility,NumPy_Utilities\")\n  (DIM_TYPE* DIM1, DIM_TYPE* DIM2, DIM_TYPE* DIM3, DIM_TYPE* DIM4, DATA_TYPE** ARGOUTVIEWM_ARRAY4)\n{\n  npy_intp dims[4] = { *$1, *$2, *$3 , *$4 };\n  PyObject* obj = PyArray_SimpleNewFromData(4, dims, DATA_TYPECODE, (void*)(*$5));\n  PyArrayObject* array = (PyArrayObject*) obj;\n\n  if (!array) SWIG_fail;\n\n%#ifdef SWIGPY_USE_CAPSULE\n    PyObject* cap = PyCapsule_New((void*)(*$1), SWIGPY_CAPSULE_NAME, free_cap);\n%#else\n    PyObject* cap = PyCObject_FromVoidPtr((void*)(*$1), free);\n%#endif\n\n%#if NPY_API_VERSION < 0x00000007\n  PyArray_BASE(array) = cap;\n%#else\n  PyArray_SetBaseObject(array,cap);\n%#endif\n\n  $result = SWIG_Python_AppendOutput($result,obj);\n}\n\n/* Typemap suite for (DATA_TYPE** ARGOUTVIEWM_FARRAY4, DIM_TYPE* DIM1, DIM_TYPE* DIM2,\n                      DIM_TYPE* DIM3, DIM_TYPE* DIM4)\n */\n%typemap(in,numinputs=0)\n  (DATA_TYPE** ARGOUTVIEWM_FARRAY4, DIM_TYPE* DIM1    , DIM_TYPE* DIM2    , DIM_TYPE* DIM3    , DIM_TYPE* DIM4    )\n  (DATA_TYPE* data_temp = NULL    , DIM_TYPE dim1_temp, DIM_TYPE dim2_temp, DIM_TYPE dim3_temp, DIM_TYPE dim4_temp)\n{\n  $1 = &data_temp;\n  $2 = &dim1_temp;\n  $3 = &dim2_temp;\n  $4 = &dim3_temp;\n  $5 = &dim4_temp;\n}\n%typemap(argout,\n         fragment=\"NumPy_Backward_Compatibility,NumPy_Array_Requirements,NumPy_Utilities\")\n  (DATA_TYPE** ARGOUTVIEWM_FARRAY4, DIM_TYPE* DIM1, DIM_TYPE* DIM2, DIM_TYPE* DIM3, DIM_TYPE* DIM4)\n{\n  npy_intp dims[4] = { *$2, *$3, *$4 , *$5 };\n  PyObject* obj = PyArray_SimpleNewFromData(4, dims, DATA_TYPECODE, (void*)(*$1));\n  PyArrayObject* array = (PyArrayObject*) obj;\n\n  if (!array || !require_fortran(array)) SWIG_fail;\n\n%#ifdef SWIGPY_USE_CAPSULE\n    PyObject* cap = PyCapsule_New((void*)(*$1), SWIGPY_CAPSULE_NAME, free_cap);\n%#else\n    PyObject* cap = PyCObject_FromVoidPtr((void*)(*$1), free);\n%#endif\n\n%#if NPY_API_VERSION < 0x00000007\n  PyArray_BASE(array) = cap;\n%#else\n  PyArray_SetBaseObject(array,cap);\n%#endif\n\n  $result = SWIG_Python_AppendOutput($result,obj);\n}\n\n/* Typemap suite for (DIM_TYPE* DIM1, DIM_TYPE* DIM2, DIM_TYPE* DIM3, DIM_TYPE* DIM4,\n                      DATA_TYPE** ARGOUTVIEWM_FARRAY4)\n */\n%typemap(in,numinputs=0)\n  (DIM_TYPE* DIM1    , DIM_TYPE* DIM2    , DIM_TYPE* DIM3    , DIM_TYPE* DIM4    , DATA_TYPE** ARGOUTVIEWM_FARRAY4)\n  (DIM_TYPE dim1_temp, DIM_TYPE dim2_temp, DIM_TYPE dim3_temp, DIM_TYPE dim4_temp, DATA_TYPE* data_temp = NULL    )\n{\n  $1 = &dim1_temp;\n  $2 = &dim2_temp;\n  $3 = &dim3_temp;\n  $4 = &dim4_temp;\n  $5 = &data_temp;\n}\n%typemap(argout,\n         fragment=\"NumPy_Backward_Compatibility,NumPy_Array_Requirements,NumPy_Utilities\")\n  (DIM_TYPE* DIM1, DIM_TYPE* DIM2, DIM_TYPE* DIM3, DIM_TYPE* DIM4, DATA_TYPE** ARGOUTVIEWM_FARRAY4)\n{\n  npy_intp dims[4] = { *$1, *$2, *$3 , *$4 };\n  PyObject* obj = PyArray_SimpleNewFromData(4, dims, DATA_TYPECODE, (void*)(*$5));\n  PyArrayObject* array = (PyArrayObject*) obj;\n\n  if (!array || !require_fortran(array)) SWIG_fail;\n\n%#ifdef SWIGPY_USE_CAPSULE\n    PyObject* cap = PyCapsule_New((void*)(*$1), SWIGPY_CAPSULE_NAME, free_cap);\n%#else\n    PyObject* cap = PyCObject_FromVoidPtr((void*)(*$1), free);\n%#endif\n\n%#if NPY_API_VERSION < 0x00000007\n  PyArray_BASE(array) = cap;\n%#else\n  PyArray_SetBaseObject(array,cap);\n%#endif\n\n  $result = SWIG_Python_AppendOutput($result,obj);\n}\n\n/**************************************/\n/* In-Place Array Typemap - flattened */\n/**************************************/\n\n/* Typemap suite for (DATA_TYPE* INPLACE_ARRAY_FLAT, DIM_TYPE DIM_FLAT)\n */\n%typecheck(SWIG_TYPECHECK_DOUBLE_ARRAY,\n           fragment=\"NumPy_Macros\")\n  (DATA_TYPE* INPLACE_ARRAY_FLAT, DIM_TYPE DIM_FLAT)\n{\n  $1 = is_array($input) && PyArray_EquivTypenums(array_type($input),\n                                                 DATA_TYPECODE);\n}\n%typemap(in,\n         fragment=\"NumPy_Fragments\")\n  (DATA_TYPE* INPLACE_ARRAY_FLAT, DIM_TYPE DIM_FLAT)\n  (PyArrayObject* array=NULL, int i=1)\n{\n  array = obj_to_array_no_conversion($input, DATA_TYPECODE);\n  if (!array || !require_c_or_f_contiguous(array)\n      || !require_native(array)) SWIG_fail;\n  $1 = (DATA_TYPE*) array_data(array);\n  $2 = 1;\n  for (i=0; i < array_numdims(array); ++i) $2 *= array_size(array,i);\n}\n\n%enddef    /* %numpy_typemaps() macro */\n/* *************************************************************** */\n\n/* Concrete instances of the %numpy_typemaps() macro: Each invocation\n * below applies all of the typemaps above to the specified data type.\n */\n%numpy_typemaps(signed char       , NPY_BYTE     , int)\n%numpy_typemaps(unsigned char     , NPY_UBYTE    , int)\n%numpy_typemaps(short             , NPY_SHORT    , int)\n%numpy_typemaps(unsigned short    , NPY_USHORT   , int)\n%numpy_typemaps(int               , NPY_INT      , int)\n%numpy_typemaps(unsigned int      , NPY_UINT     , int)\n%numpy_typemaps(long              , NPY_LONG     , int)\n%numpy_typemaps(unsigned long     , NPY_ULONG    , int)\n%numpy_typemaps(long long         , NPY_LONGLONG , int)\n%numpy_typemaps(unsigned long long, NPY_ULONGLONG, int)\n%numpy_typemaps(float             , NPY_FLOAT    , int)\n%numpy_typemaps(double            , NPY_DOUBLE   , int)\n%numpy_typemaps(int8_t            , NPY_INT8     , int)\n%numpy_typemaps(int16_t           , NPY_INT16    , int)\n%numpy_typemaps(int32_t           , NPY_INT32    , int)\n%numpy_typemaps(int64_t           , NPY_INT64    , int)\n%numpy_typemaps(uint8_t           , NPY_UINT8    , int)\n%numpy_typemaps(uint16_t          , NPY_UINT16   , int)\n%numpy_typemaps(uint32_t          , NPY_UINT32   , int)\n%numpy_typemaps(uint64_t          , NPY_UINT64   , int)\n\n\n/* ***************************************************************\n * The follow macro expansion does not work, because C++ bool is 4\n * bytes and NPY_BOOL is 1 byte\n *\n *    %numpy_typemaps(bool, NPY_BOOL, int)\n */\n\n/* ***************************************************************\n * On my Mac, I get the following warning for this macro expansion:\n * 'swig/python detected a memory leak of type 'long double *', no destructor found.'\n *\n *    %numpy_typemaps(long double, NPY_LONGDOUBLE, int)\n */\n\n#ifdef __cplusplus\n\n%include <std_complex.i>\n\n%numpy_typemaps(std::complex<float>,  NPY_CFLOAT , int)\n%numpy_typemaps(std::complex<double>, NPY_CDOUBLE, int)\n\n#endif\n\n#endif /* SWIGPYTHON */\n"
  },
  {
    "path": "native_client/ctcdecode/output.h",
    "content": "#ifndef OUTPUT_H_\n#define OUTPUT_H_\n\n#include <vector>\n\n/* Struct for the beam search output, containing the tokens based on the vocabulary indices, and the timesteps\n * for each token in the beam search output\n */\nstruct Output {\n    double confidence;\n    std::vector<unsigned int> tokens;\n    std::vector<unsigned int> timesteps;\n};\n\n#endif  // OUTPUT_H_\n"
  },
  {
    "path": "native_client/ctcdecode/path_trie.cpp",
    "content": "#include \"path_trie.h\"\n\n#include <algorithm>\n#include <limits>\n#include <memory>\n#include <utility>\n#include <vector>\n\n#include \"decoder_utils.h\"\n\nPathTrie::PathTrie() {\n  log_prob_b_prev = -NUM_FLT_INF;\n  log_prob_nb_prev = -NUM_FLT_INF;\n  log_prob_b_cur = -NUM_FLT_INF;\n  log_prob_nb_cur = -NUM_FLT_INF;\n  log_prob_c = -NUM_FLT_INF;\n  score = -NUM_FLT_INF;\n\n  ROOT_ = -1;\n  character = ROOT_;\n  exists_ = true;\n  parent = nullptr;\n\n  dictionary_ = nullptr;\n  dictionary_state_ = 0;\n  has_dictionary_ = false;\n\n  matcher_ = nullptr;\n}\n\nPathTrie::~PathTrie() {\n  for (auto child : children_) {\n    delete child.second;\n  }\n}\n\nPathTrie* PathTrie::get_path_trie(unsigned int new_char, float cur_log_prob_c, bool reset) {\n  auto child = children_.begin();\n  for (; child != children_.end(); ++child) {\n    if (child->first == new_char) {\n      break;\n    }\n  }\n  if (child != children_.end()) {\n    if (!child->second->exists_) {\n      child->second->exists_ = true;\n      child->second->log_prob_b_prev = -NUM_FLT_INF;\n      child->second->log_prob_nb_prev = -NUM_FLT_INF;\n      child->second->log_prob_b_cur = -NUM_FLT_INF;\n      child->second->log_prob_nb_cur = -NUM_FLT_INF;\n    }\n    return child->second;\n  } else {\n    if (has_dictionary_) {\n      matcher_->SetState(dictionary_state_);\n      bool found = matcher_->Find(new_char + 1);\n      if (!found) {\n        // Adding this character causes word outside dictionary\n        auto FSTZERO = fst::TropicalWeight::Zero();\n        auto final_weight = dictionary_->Final(dictionary_state_);\n        bool is_final = (final_weight != FSTZERO);\n        if (is_final && reset) {\n          dictionary_state_ = dictionary_->Start();\n        }\n        return nullptr;\n      } else {\n        PathTrie* new_path = new PathTrie;\n        new_path->character = new_char;\n        new_path->parent = this;\n        new_path->dictionary_ = dictionary_;\n        new_path->has_dictionary_ = true;\n        new_path->matcher_ = matcher_;\n        new_path->log_prob_c = cur_log_prob_c;\n\n        // set spell checker state\n        // check to see if next state is final\n        auto FSTZERO = fst::TropicalWeight::Zero();\n        auto final_weight = dictionary_->Final(matcher_->Value().nextstate);\n        bool is_final = (final_weight != FSTZERO);\n        if (is_final && reset) {\n          // restart spell checker at the start state\n          new_path->dictionary_state_ = dictionary_->Start();\n        } else {\n          // go to next state\n          new_path->dictionary_state_ = matcher_->Value().nextstate;\n        }\n\n        children_.push_back(std::make_pair(new_char, new_path));\n        return new_path;\n      }\n    } else {\n      PathTrie* new_path = new PathTrie;\n      new_path->character = new_char;\n      new_path->parent = this;\n      new_path->log_prob_c = cur_log_prob_c;\n      children_.push_back(std::make_pair(new_char, new_path));\n      return new_path;\n    }\n  }\n}\n\nvoid PathTrie::get_path_vec(std::vector<unsigned int>& output) {\n  // Recursive call: recurse back until stop condition, then append data in\n  // correct order as we walk back down the stack in the lines below.\n  if (parent != nullptr) {\n    parent->get_path_vec(output);\n  }\n  if (character != ROOT_) {\n    output.push_back(character);\n  }\n}\n\nPathTrie* PathTrie::get_prev_grapheme(std::vector<unsigned int>& output,\n                                      const Alphabet& alphabet)\n{\n  PathTrie* stop = this;\n  if (character == ROOT_) {\n    return stop;\n  }\n  // Recursive call: recurse back until stop condition, then append data in\n  // correct order as we walk back down the stack in the lines below.\n  if (!byte_is_codepoint_boundary(alphabet.DecodeSingle(character)[0])) {\n    stop = parent->get_prev_grapheme(output, alphabet);\n  }\n  output.push_back(character);\n  return stop;\n}\n\nint PathTrie::distance_to_codepoint_boundary(unsigned char *first_byte,\n                                             const Alphabet& alphabet)\n{\n  if (byte_is_codepoint_boundary(alphabet.DecodeSingle(character)[0])) {\n    *first_byte = (unsigned char)character + 1;\n    return 1;\n  }\n  if (parent != nullptr && parent->character != ROOT_) {\n    return 1 + parent->distance_to_codepoint_boundary(first_byte, alphabet);\n  }\n  assert(false); // unreachable\n  return 0;\n}\n\nPathTrie* PathTrie::get_prev_word(std::vector<unsigned int>& output,\n                                  const Alphabet& alphabet)\n{\n  PathTrie* stop = this;\n  if (character == alphabet.GetSpaceLabel() || character == ROOT_) {\n    return stop;\n  }\n  // Recursive call: recurse back until stop condition, then append data in\n  // correct order as we walk back down the stack in the lines below.\n  if (parent != nullptr) {\n    stop = parent->get_prev_word(output, alphabet);\n  }\n  output.push_back(character);\n  return stop;\n}\n\nvoid PathTrie::iterate_to_vec(std::vector<PathTrie*>& output) {\n  // previous_timesteps might point to ancestors' timesteps\n  // therefore, children must be uptaded first\n  for (auto child : children_) {\n    child.second->iterate_to_vec(output);\n  }\n  if (exists_) {\n    log_prob_b_prev = log_prob_b_cur;\n    log_prob_nb_prev = log_prob_nb_cur;\n\n    log_prob_b_cur = -NUM_FLT_INF;\n    log_prob_nb_cur = -NUM_FLT_INF;\n\n    score = log_sum_exp(log_prob_b_prev, log_prob_nb_prev);\n\n    if (previous_timesteps != nullptr) {\n      timesteps = nullptr;\n      for (auto const& child : previous_timesteps->children) {\n        if (child->data == new_timestep) {\n            timesteps = child.get();\n            break;\n        }\n      }\n      if (timesteps == nullptr) {\n          timesteps = add_child(previous_timesteps, new_timestep);\n      }\n    }\n    previous_timesteps = nullptr;\n\n    output.push_back(this);\n  }\n}\n\nvoid PathTrie::remove() {\n  exists_ = false;\n\n  if (children_.size() == 0) {\n    for (auto child = parent->children_.begin(); child != parent->children_.end(); ++child) {\n      if (child->first == character) {\n        parent->children_.erase(child);\n        break;\n      }\n    }\n\n    if (parent->children_.size() == 0 && !parent->exists_) {\n      parent->remove();\n    }\n\n    delete this;\n  }\n}\n\nvoid PathTrie::set_dictionary(std::shared_ptr<PathTrie::FstType> dictionary) {\n  dictionary_ = dictionary;\n  dictionary_state_ = dictionary_->Start();\n  has_dictionary_ = true;\n}\n\nvoid PathTrie::set_matcher(std::shared_ptr<fst::SortedMatcher<FstType>> matcher) {\n  matcher_ = matcher;\n}\n\n#ifdef DEBUG\nvoid PathTrie::vec(std::vector<PathTrie*>& out) {\n  if (parent != nullptr) {\n    parent->vec(out);\n  }\n  out.push_back(this);\n}\n\nvoid PathTrie::print(const Alphabet& a) {\n  std::vector<PathTrie*> chain;\n  vec(chain);\n  std::string tr;\n  printf(\"characters:\\t \");\n  for (PathTrie* el : chain) {\n    printf(\"%X \", (unsigned char)(el->character));\n    if (el->character != ROOT_) {\n      tr.append(a.DecodeSingle(el->character));\n    }\n  }\n  printf(\"\\ntimesteps:\\t \");\n  for (unsigned int timestep : get_history(timesteps)) {\n    printf(\"%d \", timestep);\n  }\n  printf(\"\\n\");\n  printf(\"transcript:\\t %s\\n\", tr.c_str());\n}\n#endif // DEBUG\n"
  },
  {
    "path": "native_client/ctcdecode/path_trie.h",
    "content": "#ifndef PATH_TRIE_H\n#define PATH_TRIE_H\n\n#include <algorithm>\n#include <limits>\n#include <memory>\n#include <utility>\n#include <vector>\n\n#include \"fst/fstlib.h\"\n#include \"alphabet.h\"\n#include \"object_pool.h\"\n\n/* Tree structure with parent and children information\n * It is used to store the timesteps data for the PathTrie below\n */\ntemplate<class DataT>\nstruct TreeNode {\n    TreeNode<DataT>* parent;\n    std::vector<std::unique_ptr< TreeNode<DataT>, godefv::object_pool_deleter_t<TreeNode<DataT>> >> children;\n\n    DataT data;\n\n    TreeNode(TreeNode<DataT>* parent_, DataT const& data_): parent{parent_}, data{data_} {}\n};\n\n/* Creates a new TreeNode<NodeDataT> with given data as a child to the given node.\n * Returns a pointer to the created node. This pointer remains valid as long as the child is not destroyed.\n */\ntemplate<class NodeDataT, class ChildDataT>\nTreeNode<NodeDataT>* add_child(TreeNode<NodeDataT>* tree_node, ChildDataT&& data);\n\n/* Returns the sequence of tree node's data from the given root (exclusive) to the given tree_node (inclusive).\n * By default (if no root is provided), the full sequence from the root of the tree is returned.\n */\ntemplate<class DataT>\nstd::vector<DataT> get_history(TreeNode<DataT> const* tree_node, TreeNode<DataT> const* root = nullptr);\n\nusing TimestepTreeNode = TreeNode<unsigned int>;\n\n/* Trie tree for prefix storing and manipulating, with a dictionary in\n * finite-state transducer for spelling correction.\n */\nclass PathTrie {\npublic:\n  using FstType = fst::ConstFst<fst::StdArc>;\n\n  PathTrie();\n  ~PathTrie();\n\n  // get new prefix after appending new char\n  PathTrie* get_path_trie(unsigned int new_char, float log_prob_c, bool reset = true);\n\n  // get the prefix data in correct time order from root to current node\n  void get_path_vec(std::vector<unsigned int>& output);\n\n  // get the prefix data in correct time order from beginning of last grapheme to current node\n  PathTrie* get_prev_grapheme(std::vector<unsigned int>& output,\n                              const Alphabet& alphabet);\n\n  // get the distance from current node to the first codepoint boundary, and the byte value at the boundary\n  int distance_to_codepoint_boundary(unsigned char *first_byte, const Alphabet& alphabet);\n\n  // get the prefix data in correct time order from beginning of last word to current node\n  PathTrie* get_prev_word(std::vector<unsigned int>& output,\n                          const Alphabet& alphabet);\n\n  // update log probs\n  void iterate_to_vec(std::vector<PathTrie*>& output);\n\n  // set dictionary for FST\n  void set_dictionary(std::shared_ptr<FstType> dictionary);\n\n  void set_matcher(std::shared_ptr<fst::SortedMatcher<FstType>>);\n\n  bool is_empty() { return ROOT_ == character; }\n\n  // remove current path from root\n  void remove();\n\n#ifdef DEBUG\n  void vec(std::vector<PathTrie*>& out);\n  void print(const Alphabet& a);\n#endif // DEBUG\n\n  float log_prob_b_prev;\n  float log_prob_nb_prev;\n  float log_prob_b_cur;\n  float log_prob_nb_cur;\n  float log_prob_c;\n  float score;\n  float approx_ctc;\n  unsigned int character;\n  TimestepTreeNode* timesteps = nullptr;\n\n  // timestep temporary storage for each decoding step. \n  TimestepTreeNode* previous_timesteps = nullptr; \n  unsigned int new_timestep;\n\n  PathTrie* parent;\n\nprivate:\n  int ROOT_;\n  bool exists_;\n  bool has_dictionary_;\n\n  std::vector<std::pair<unsigned int, PathTrie*>> children_;\n\n  // pointer to dictionary of FST\n  std::shared_ptr<FstType> dictionary_;\n  FstType::StateId dictionary_state_;\n  std::shared_ptr<fst::SortedMatcher<FstType>> matcher_;\n};\n\n// TreeNode implementation\ntemplate<class NodeDataT, class ChildDataT>\nTreeNode<NodeDataT>* add_child(TreeNode<NodeDataT>* tree_node, ChildDataT&& data) {\n    static thread_local godefv::object_pool_t<TreeNode<NodeDataT>> tree_node_pool;\n    tree_node->children.push_back(tree_node_pool.make_unique(tree_node, std::forward<ChildDataT>(data)));\n    return tree_node->children.back().get();\n}\n\ntemplate<class DataT>\nvoid get_history_helper(TreeNode<DataT> const* tree_node, TreeNode<DataT> const* root, std::vector<DataT>* output) {\n    if (tree_node == root) return;\n    assert(tree_node != nullptr);\n    assert(tree_node->parent != tree_node);\n    get_history_helper(tree_node->parent, root, output);\n    output->push_back(tree_node->data);\n}\ntemplate<class DataT>\nstd::vector<DataT> get_history(TreeNode<DataT> const* tree_node, TreeNode<DataT> const* root) {\n    std::vector<DataT> output;\n    get_history_helper(tree_node, root, &output);\n    return output;\n}\n\n\n#endif  // PATH_TRIE_H\n"
  },
  {
    "path": "native_client/ctcdecode/scorer.cpp",
    "content": "#ifdef _MSC_VER\n  #include <stdlib.h>\n  #include <io.h>\n  #include <windows.h> \n\n  #define R_OK    4       /* Read permission.  */\n  #define W_OK    2       /* Write permission.  */ \n  #define F_OK    0       /* Existence.  */\n\n  #define access _access\n\n#else          /* _MSC_VER  */\n  #include <unistd.h>\n#endif\n\n#include \"scorer.h\"\n#include <iostream>\n#include <fstream>\n\n#include \"lm/config.hh\"\n#include \"lm/model.hh\"\n#include \"lm/state.hh\"\n#include \"util/string_piece.hh\"\n\n#include \"decoder_utils.h\"\n\nstatic const int32_t MAGIC = 'TRIE';\nstatic const int32_t FILE_VERSION = 6;\n\nint\nScorer::init(const std::string& lm_path,\n             const Alphabet& alphabet)\n{\n  set_alphabet(alphabet);\n  return load_lm(lm_path);\n}\n\nint\nScorer::init(const std::string& lm_path,\n             const std::string& alphabet_config_path)\n{\n  int err = alphabet_.init(alphabet_config_path.c_str());\n  if (err != 0) {\n    return err;\n  }\n  setup_char_map();\n  return load_lm(lm_path);\n}\n\nvoid\nScorer::set_alphabet(const Alphabet& alphabet)\n{\n  alphabet_ = alphabet;\n  setup_char_map();\n}\n\nvoid Scorer::setup_char_map()\n{\n  // (Re-)Initialize character map\n  char_map_.clear();\n\n  SPACE_ID_ = alphabet_.GetSpaceLabel();\n\n  for (int i = 0; i < alphabet_.GetSize(); i++) {\n    // The initial state of FST is state 0, hence the index of chars in\n    // the FST should start from 1 to avoid the conflict with the initial\n    // state, otherwise wrong decoding results would be given.\n    char_map_[alphabet_.DecodeSingle(i)] = i + 1;\n  }\n}\n\nint Scorer::load_lm(const std::string& lm_path)\n{\n  // Check if file is readable to avoid KenLM throwing an exception\n  const char* filename = lm_path.c_str();\n  if (access(filename, R_OK) != 0) {\n    return DS_ERR_SCORER_UNREADABLE;\n  }\n\n  // Check if the file format is valid to avoid KenLM throwing an exception\n  lm::ngram::ModelType model_type;\n  if (!lm::ngram::RecognizeBinary(filename, model_type)) {\n    return DS_ERR_SCORER_INVALID_LM;\n  }\n\n  // Load the LM\n  lm::ngram::Config config;\n  config.load_method = util::LoadMethod::LAZY;\n  language_model_.reset(lm::ngram::LoadVirtual(filename, config));\n  max_order_ = language_model_->Order();\n\n  uint64_t package_size;\n  {\n    util::scoped_fd fd(util::OpenReadOrThrow(filename));\n    package_size = util::SizeFile(fd.get());\n  }\n  uint64_t trie_offset = language_model_->GetEndOfSearchOffset();\n  if (package_size <= trie_offset) {\n    // File ends without a trie structure\n    return DS_ERR_SCORER_NO_TRIE;\n  }\n\n  // Read metadata and trie from file\n  std::ifstream fin(lm_path, std::ios::binary);\n  fin.seekg(trie_offset);\n  return load_trie(fin, lm_path);\n}\n\nint Scorer::load_trie(std::ifstream& fin, const std::string& file_path)\n{\n  int magic;\n  fin.read(reinterpret_cast<char*>(&magic), sizeof(magic));\n  if (magic != MAGIC) {\n    std::cerr << \"Error: Can't parse scorer file, invalid header. Try updating \"\n                 \"your scorer file.\" << std::endl;\n    return DS_ERR_SCORER_INVALID_TRIE;\n  }\n\n  int version;\n  fin.read(reinterpret_cast<char*>(&version), sizeof(version));\n  if (version != FILE_VERSION) {\n    std::cerr << \"Error: Scorer file version mismatch (\" << version\n              << \" instead of expected \" << FILE_VERSION\n              << \"). \";\n    if (version < FILE_VERSION) {\n      std::cerr << \"Update your scorer file.\";\n    } else {\n      std::cerr << \"Downgrade your scorer file or update your version of DeepSpeech.\";\n    }\n    std::cerr << std::endl;\n    return DS_ERR_SCORER_VERSION_MISMATCH;\n  }\n\n  fin.read(reinterpret_cast<char*>(&is_utf8_mode_), sizeof(is_utf8_mode_));\n\n  // Read hyperparameters from header\n  double alpha, beta;\n  fin.read(reinterpret_cast<char*>(&alpha), sizeof(alpha));\n  fin.read(reinterpret_cast<char*>(&beta), sizeof(beta));\n  reset_params(alpha, beta);\n\n  fst::FstReadOptions opt;\n  opt.mode = fst::FstReadOptions::MAP;\n  opt.source = file_path;\n  dictionary.reset(FstType::Read(fin, opt));\n  return DS_ERR_OK;\n}\n\nbool Scorer::save_dictionary(const std::string& path, bool append_instead_of_overwrite)\n{\n  std::ios::openmode om;\n  if (append_instead_of_overwrite) {\n    om = std::ios::in|std::ios::out|std::ios::binary|std::ios::ate;\n  } else {\n    om = std::ios::out|std::ios::binary;\n  }\n  std::fstream fout(path, om);\n  if (!fout ||fout.bad()) {\n    std::cerr << \"Error opening '\" << path << \"'\" << std::endl;\n    return false;\n  }\n  fout.write(reinterpret_cast<const char*>(&MAGIC), sizeof(MAGIC));\n  if (fout.bad()) {\n    std::cerr << \"Error writing MAGIC '\" << path << \"'\" << std::endl;\n    return false;\n  }\n  fout.write(reinterpret_cast<const char*>(&FILE_VERSION), sizeof(FILE_VERSION));\n  if (fout.bad()) {\n    std::cerr << \"Error writing FILE_VERSION '\" << path << \"'\" << std::endl;\n    return false;\n  }\n  fout.write(reinterpret_cast<const char*>(&is_utf8_mode_), sizeof(is_utf8_mode_));\n  if (fout.bad()) {\n    std::cerr << \"Error writing is_utf8_mode '\" << path << \"'\" << std::endl;\n    return false;\n  }\n  fout.write(reinterpret_cast<const char*>(&alpha), sizeof(alpha));\n  if (fout.bad()) {\n    std::cerr << \"Error writing alpha '\" << path << \"'\" << std::endl;\n    return false;\n  }\n  fout.write(reinterpret_cast<const char*>(&beta), sizeof(beta));\n  if (fout.bad()) {\n    std::cerr << \"Error writing beta '\" << path << \"'\" << std::endl;\n    return false;\n  }\n  fst::FstWriteOptions opt;\n  opt.align = true;\n  opt.source = path;\n  return dictionary->Write(fout, opt);\n}\n\nbool Scorer::is_scoring_boundary(PathTrie* prefix, size_t new_label)\n{\n  if (is_utf8_mode()) {\n    if (prefix->character == -1) {\n      return false;\n    }\n    unsigned char first_byte;\n    int distance_to_boundary = prefix->distance_to_codepoint_boundary(&first_byte, alphabet_);\n    int needed_bytes;\n    if ((first_byte >> 3) == 0x1E) {\n      needed_bytes = 4;\n    } else if ((first_byte >> 4) == 0x0E) {\n      needed_bytes = 3;\n    } else if ((first_byte >> 5) == 0x06) {\n      needed_bytes = 2;\n    } else if ((first_byte >> 7) == 0x00) {\n      needed_bytes = 1;\n    } else {\n      assert(false); // invalid byte sequence. should be unreachable, disallowed by vocabulary/trie\n      return false;\n    }\n    return distance_to_boundary == needed_bytes;\n  } else {\n    return new_label == SPACE_ID_;\n  }\n}\n\ndouble Scorer::get_log_cond_prob(const std::vector<std::string>& words,\n                                 bool bos,\n                                 bool eos)\n{\n  return get_log_cond_prob(words.begin(), words.end(), bos, eos);\n}\n\ndouble Scorer::get_log_cond_prob(const std::vector<std::string>::const_iterator& begin,\n                                 const std::vector<std::string>::const_iterator& end,\n                                 bool bos,\n                                 bool eos)\n{\n  const auto& vocab = language_model_->BaseVocabulary();\n  lm::ngram::State state_vec[2];\n  lm::ngram::State *in_state = &state_vec[0];\n  lm::ngram::State *out_state = &state_vec[1];\n\n  if (bos) {\n    language_model_->BeginSentenceWrite(in_state);\n  } else {\n    language_model_->NullContextWrite(in_state);\n  }\n\n  double cond_prob = 0.0;\n  for (auto it = begin; it != end; ++it) {\n    lm::WordIndex word_index = vocab.Index(*it);\n\n    // encounter OOV\n    if (word_index == lm::kUNK) {\n      return OOV_SCORE;\n    }\n\n    cond_prob = language_model_->BaseScore(in_state, word_index, out_state);\n    std::swap(in_state, out_state);\n  }\n\n  if (eos) {\n    cond_prob = language_model_->BaseScore(in_state, vocab.EndSentence(), out_state);\n  }\n\n  // return loge prob\n  return cond_prob/NUM_FLT_LOGE;\n}\n\nvoid Scorer::reset_params(float alpha, float beta)\n{\n  this->alpha = alpha;\n  this->beta = beta;\n}\n\nstd::vector<std::string> Scorer::split_labels_into_scored_units(const std::vector<unsigned int>& labels)\n{\n  if (labels.empty()) return {};\n\n  std::string s = alphabet_.Decode(labels);\n  std::vector<std::string> words;\n  if (is_utf8_mode_) {\n    words = split_into_codepoints(s);\n  } else {\n    words = split_str(s, \" \");\n  }\n  return words;\n}\n\nstd::vector<std::string> Scorer::make_ngram(PathTrie* prefix)\n{\n  std::vector<std::string> ngram;\n  PathTrie* current_node = prefix;\n  PathTrie* new_node = nullptr;\n\n  for (int order = 0; order < max_order_; order++) {\n    if (!current_node || current_node->character == -1) {\n      break;\n    }\n\n    std::vector<unsigned int> prefix_vec;\n\n    if (is_utf8_mode_) {\n      new_node = current_node->get_prev_grapheme(prefix_vec, alphabet_);\n    } else {\n      new_node = current_node->get_prev_word(prefix_vec, alphabet_);\n    }\n    current_node = new_node->parent;\n\n    // reconstruct word\n    std::string word = alphabet_.Decode(prefix_vec);\n    ngram.push_back(word);\n  }\n  std::reverse(ngram.begin(), ngram.end());\n  return ngram;\n}\n\nvoid Scorer::fill_dictionary(const std::unordered_set<std::string>& vocabulary)\n{\n  // ConstFst is immutable, so we need to use a MutableFst to create the trie,\n  // and then we convert to a ConstFst for the decoder and for storing on disk.\n  fst::StdVectorFst dictionary;\n  // For each unigram convert to ints and put in trie\n  for (const auto& word : vocabulary) {\n    if (word != START_TOKEN && word != UNK_TOKEN && word != END_TOKEN) {\n      add_word_to_dictionary(word, char_map_, is_utf8_mode_, SPACE_ID_ + 1, &dictionary);\n    }\n  }\n\n  /* Simplify FST\n\n   * This gets rid of \"epsilon\" transitions in the FST.\n   * These are transitions that don't require a string input to be taken.\n   * Getting rid of them is necessary to make the FST deterministic, but\n   * can greatly increase the size of the FST\n   */\n  fst::RmEpsilon(&dictionary);\n  std::unique_ptr<fst::StdVectorFst> new_dict(new fst::StdVectorFst);\n\n  /* This makes the FST deterministic, meaning for any string input there's\n   * only one possible state the FST could be in.  It is assumed our\n   * dictionary is deterministic when using it.\n   * (lest we'd have to check for multiple transitions at each state)\n   */\n  fst::Determinize(dictionary, new_dict.get());\n\n  /* Finds the simplest equivalent fst. This is unnecessary but decreases\n   * memory usage of the dictionary\n   */\n  fst::Minimize(new_dict.get());\n\n  // Now we convert the MutableFst to a ConstFst (Scorer::FstType) via its ctor\n  std::unique_ptr<FstType> converted(new FstType(*new_dict));\n  this->dictionary = std::move(converted);\n}\n"
  },
  {
    "path": "native_client/ctcdecode/scorer.h",
    "content": "#ifndef SCORER_H_\n#define SCORER_H_\n\n#include <memory>\n#include <string>\n#include <unordered_map>\n#include <unordered_set>\n#include <vector>\n\n#include \"lm/virtual_interface.hh\"\n#include \"lm/word_index.hh\"\n#include \"util/string_piece.hh\"\n\n#include \"path_trie.h\"\n#include \"alphabet.h\"\n#include \"deepspeech.h\"\n\nconst double OOV_SCORE = -1000.0;\nconst std::string START_TOKEN = \"<s>\";\nconst std::string UNK_TOKEN = \"<unk>\";\nconst std::string END_TOKEN = \"</s>\";\n\n/* External scorer to query score for n-gram or sentence, including language\n * model scoring and word insertion.\n *\n * Example:\n *     Scorer scorer(alpha, beta, \"path_of_language_model\");\n *     scorer.get_log_cond_prob({ \"WORD1\", \"WORD2\", \"WORD3\" });\n */\nclass Scorer {\npublic:\n  using FstType = PathTrie::FstType;\n\n  Scorer() = default;\n  ~Scorer() = default;\n\n  // disallow copying\n  Scorer(const Scorer&) = delete;\n  Scorer& operator=(const Scorer&) = delete;\n\n  int init(const std::string &lm_path,\n           const Alphabet &alphabet);\n\n  int init(const std::string &lm_path,\n           const std::string &alphabet_config_path);\n\n  double get_log_cond_prob(const std::vector<std::string> &words,\n                           bool bos = false,\n                           bool eos = false);\n\n  double get_log_cond_prob(const std::vector<std::string>::const_iterator &begin,\n                           const std::vector<std::string>::const_iterator &end,\n                           bool bos = false,\n                           bool eos = false);\n\n  // return the max order\n  size_t get_max_order() const { return max_order_; }\n\n  // return true if the language model is character based\n  bool is_utf8_mode() const { return is_utf8_mode_; }\n\n  // reset params alpha & beta\n  void reset_params(float alpha, float beta);\n\n  // force set UTF-8 mode, ignore value read from file\n  void set_utf8_mode(bool utf8) { is_utf8_mode_ = utf8; }\n\n  // make ngram for a given prefix\n  std::vector<std::string> make_ngram(PathTrie *prefix);\n\n  // trransform the labels in index to the vector of words (word based lm) or\n  // the vector of characters (character based lm)\n  std::vector<std::string> split_labels_into_scored_units(const std::vector<unsigned int> &labels);\n\n  void set_alphabet(const Alphabet& alphabet);\n\n  // save dictionary in file\n  bool save_dictionary(const std::string &path, bool append_instead_of_overwrite=false);\n\n  // return weather this step represents a boundary where beam scoring should happen\n  bool is_scoring_boundary(PathTrie* prefix, size_t new_label);\n\n  // fill dictionary FST from a vocabulary\n  void fill_dictionary(const std::unordered_set<std::string> &vocabulary);\n\n  // load language model from given path\n  int load_lm(const std::string &lm_path);\n\n  // language model weight\n  double alpha = 0.;\n  // word insertion weight\n  double beta = 0.;\n\n  // pointer to the dictionary of FST\n  std::unique_ptr<FstType> dictionary;\n\nprotected:\n  // necessary setup after setting alphabet\n  void setup_char_map();\n\n  int load_trie(std::ifstream& fin, const std::string& file_path);\n\nprivate:\n  std::unique_ptr<lm::base::Model> language_model_;\n  bool is_utf8_mode_ = true;\n  size_t max_order_ = 0;\n\n  int SPACE_ID_;\n  Alphabet alphabet_;\n  std::unordered_map<std::string, int> char_map_;\n};\n\n#endif  // SCORER_H_\n"
  },
  {
    "path": "native_client/ctcdecode/setup.cfg",
    "content": "# temp_build is two deep because SWIG does not clean relative paths when\n# building, so ../kenlm pollutes the source directory.\n\n[build_ext]\nbuild-lib=temp_build/temp_build\nbuild-temp=temp_build/temp_build\n\n[build_py]\nbuild-lib=temp_build/temp_build\n\n[bdist_wheel]\nbdist-dir=temp_build/temp_build\n\n[install_lib]\nbuild-dir=temp_build/temp_build\n\n"
  },
  {
    "path": "native_client/ctcdecode/setup.py",
    "content": "#!/usr/bin/env python\nfrom __future__ import absolute_import, division, print_function\n\nfrom distutils.command.build import build\nfrom setuptools import setup, Extension, distutils\n\nimport argparse\nimport multiprocessing.pool\nimport os\nimport platform\nimport sys\n\nfrom build_archive import *\n\ntry:\n    import numpy\n    try:\n        numpy_include = numpy.get_include()\n    except AttributeError:\n        numpy_include = numpy.get_numpy_include()\nexcept ImportError:\n    numpy_include = ''\n    assert 'NUMPY_INCLUDE' in os.environ\n\nnumpy_include = os.getenv('NUMPY_INCLUDE', numpy_include)\nnumpy_min_ver = os.getenv('NUMPY_DEP_VERSION', '')\n\nparser = argparse.ArgumentParser(description=__doc__)\nparser.add_argument(\n    \"--num_processes\",\n    default=1,\n    type=int,\n    help=\"Number of cpu processes to build package. (default: %(default)d)\")\nknown_args, unknown_args = parser.parse_known_args()\ndebug = '--debug' in unknown_args\n\n# reconstruct sys.argv to pass to setup below\nsys.argv = [sys.argv[0]] + unknown_args\n\ndef read(fname):\n    return open(os.path.join(os.path.dirname(__file__), fname)).read()\n\ndef maybe_rebuild(srcs, out_name, build_dir):\n    if not os.path.exists(out_name):\n        if not os.path.exists(build_dir):\n            os.makedirs(build_dir)\n\n        build_archive(srcs=srcs,\n                     out_name=out_name,\n                     build_dir=build_dir,\n                     num_parallel=known_args.num_processes,\n                     debug=debug)\n\nproject_version = read('../../training/deepspeech_training/VERSION').strip()\n\nbuild_dir = 'temp_build/temp_build'\n\nif sys.platform.startswith('win'):\n    archive_ext = 'lib'\nelse:\n    archive_ext = 'a'\n\nthird_party_build = 'third_party.{}'.format(archive_ext)\nctc_decoder_build = 'first_party.{}'.format(archive_ext)\n\n\nmaybe_rebuild(KENLM_FILES, third_party_build, build_dir)\nmaybe_rebuild(CTC_DECODER_FILES, ctc_decoder_build, build_dir)\n\ndecoder_module = Extension(\n    name='ds_ctcdecoder._swigwrapper',\n    sources=['swigwrapper.i'],\n    swig_opts=['-c++', '-extranative'],\n    language='c++',\n    include_dirs=INCLUDES + [numpy_include],\n    extra_compile_args=ARGS + (DBG_ARGS if debug else OPT_ARGS),\n    extra_link_args=[ctc_decoder_build, third_party_build],\n)\n\nclass BuildExtFirst(build):\n    sub_commands = [('build_ext', build.has_ext_modules),\n                    ('build_py', build.has_pure_modules),\n                    ('build_clib', build.has_c_libraries),\n                    ('build_scripts', build.has_scripts)]\n\nsetup(\n    name='ds_ctcdecoder',\n    version=project_version,\n    description=\"\"\"DS CTC decoder\"\"\",\n    cmdclass = {'build': BuildExtFirst},\n    ext_modules=[decoder_module],\n    package_dir = {'ds_ctcdecoder': '.'},\n    py_modules=['ds_ctcdecoder', 'ds_ctcdecoder.swigwrapper'],\n    install_requires = ['numpy%s' % numpy_min_ver],\n)\n"
  },
  {
    "path": "native_client/ctcdecode/swigwrapper.i",
    "content": "%module swigwrapper\n\n%{\n#include \"ctc_beam_search_decoder.h\"\n#define SWIG_FILE_WITH_INIT\n#define SWIG_PYTHON_STRICT_BYTE_CHAR\n#include \"workspace_status.h\"\n%}\n\n%include <pyabc.i>\n%include <std_string.i>\n%include <std_vector.i>\n%include <std_shared_ptr.i>\n%include <std_unordered_map.i>\n%include \"numpy.i\"\n\n%init %{\nimport_array();\n%}\n\nnamespace std {\n    %template(StringVector) vector<string>;\n    %template(UnsignedIntVector) vector<unsigned int>;\n    %template(OutputVector) vector<Output>;\n    %template(OutputVectorVector) vector<vector<Output>>;\n    %template(Map) unordered_map<string, float>;\n}\n\n%shared_ptr(Scorer);\n\n// Convert NumPy arrays to pointer+lengths\n%apply (double* IN_ARRAY2, int DIM1, int DIM2) {(const double *probs, int time_dim, int class_dim)};\n%apply (double* IN_ARRAY3, int DIM1, int DIM2, int DIM3) {(const double *probs, int batch_size, int time_dim, int class_dim)};\n%apply (int* IN_ARRAY1, int DIM1) {(const int *seq_lengths, int seq_lengths_size)};\n%apply (unsigned int* IN_ARRAY1, int DIM1) {(const unsigned int *input, int length)};\n\n%ignore Scorer::dictionary;\n\n%include \"../alphabet.h\"\n%include \"output.h\"\n%include \"scorer.h\"\n%include \"ctc_beam_search_decoder.h\"\n\n%constant const char* __version__ = ds_version();\n%constant const char* __git_version__ = ds_git_version();\n\n// Import only the error code enum definitions from deepspeech.h\n// We can't just do |%ignore \"\";| here because it affects this file globally (even\n// files %include'd above). That causes SWIG to lose destructor information and\n// leads to leaks of the wrapper objects.\n// Instead we ignore functions and classes (structs), which are the only other\n// things in deepspeech.h. If we add some new construct to deepspeech.h we need\n// to update the ignore rules here to avoid exposing unwanted APIs in the decoder\n// package.\n%rename(\"$ignore\", %$isfunction) \"\";\n%rename(\"$ignore\", %$isclass) \"\";\n%include \"../deepspeech.h\"\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/ThreadPool/COPYING",
    "content": "Copyright (c) 2012 Jakob Progsch, Václav Zeman\n\nThis software is provided 'as-is', without any express or implied\nwarranty. In no event will the authors be held liable for any damages\narising from the use of this software.\n\nPermission is granted to anyone to use this software for any purpose,\nincluding commercial applications, and to alter it and redistribute it\nfreely, subject to the following restrictions:\n\n   1. The origin of this software must not be misrepresented; you must not\n   claim that you wrote the original software. If you use this software\n   in a product, an acknowledgment in the product documentation would be\n   appreciated but is not required.\n\n   2. Altered source versions must be plainly marked as such, and must not be\n   misrepresented as being the original software.\n\n   3. This notice may not be removed or altered from any source\n   distribution.\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/ThreadPool/README.md",
    "content": "ThreadPool\n==========\n\nA simple C++11 Thread Pool implementation.\n\nBasic usage:\n```c++\n// create thread pool with 4 worker threads\nThreadPool pool(4);\n\n// enqueue and store future\nauto result = pool.enqueue([](int answer) { return answer; }, 42);\n\n// get result from future\nstd::cout << result.get() << std::endl;\n\n```\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/ThreadPool/ThreadPool.h",
    "content": "#ifndef THREAD_POOL_H\n#define THREAD_POOL_H\n\n#include <vector>\n#include <queue>\n#include <memory>\n#include <thread>\n#include <mutex>\n#include <condition_variable>\n#include <future>\n#include <functional>\n#include <stdexcept>\n\nclass ThreadPool {\npublic:\n    ThreadPool(size_t);\n    template<class F, class... Args>\n    auto enqueue(F&& f, Args&&... args) \n        -> std::future<typename std::result_of<F(Args...)>::type>;\n    ~ThreadPool();\nprivate:\n    // need to keep track of threads so we can join them\n    std::vector< std::thread > workers;\n    // the task queue\n    std::queue< std::function<void()> > tasks;\n    \n    // synchronization\n    std::mutex queue_mutex;\n    std::condition_variable condition;\n    bool stop;\n};\n \n// the constructor just launches some amount of workers\ninline ThreadPool::ThreadPool(size_t threads)\n    :   stop(false)\n{\n    for(size_t i = 0;i<threads;++i)\n        workers.emplace_back(\n            [this]\n            {\n                for(;;)\n                {\n                    std::function<void()> task;\n\n                    {\n                        std::unique_lock<std::mutex> lock(this->queue_mutex);\n                        this->condition.wait(lock,\n                            [this]{ return this->stop || !this->tasks.empty(); });\n                        if(this->stop && this->tasks.empty())\n                            return;\n                        task = std::move(this->tasks.front());\n                        this->tasks.pop();\n                    }\n\n                    task();\n                }\n            }\n        );\n}\n\n// add new work item to the pool\ntemplate<class F, class... Args>\nauto ThreadPool::enqueue(F&& f, Args&&... args) \n    -> std::future<typename std::result_of<F(Args...)>::type>\n{\n    using return_type = typename std::result_of<F(Args...)>::type;\n\n    auto task = std::make_shared< std::packaged_task<return_type()> >(\n            std::bind(std::forward<F>(f), std::forward<Args>(args)...)\n        );\n        \n    std::future<return_type> res = task->get_future();\n    {\n        std::unique_lock<std::mutex> lock(queue_mutex);\n\n        // don't allow enqueueing after stopping the pool\n        if(stop)\n            throw std::runtime_error(\"enqueue on stopped ThreadPool\");\n\n        tasks.emplace([task](){ (*task)(); });\n    }\n    condition.notify_one();\n    return res;\n}\n\n// the destructor joins all threads\ninline ThreadPool::~ThreadPool()\n{\n    {\n        std::unique_lock<std::mutex> lock(queue_mutex);\n        stop = true;\n    }\n    condition.notify_all();\n    for(std::thread &worker: workers)\n        worker.join();\n}\n\n#endif\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/ThreadPool/example.cpp",
    "content": "#include <iostream>\n#include <vector>\n#include <chrono>\n\n#include \"ThreadPool.h\"\n\nint main()\n{\n    \n    ThreadPool pool(4);\n    std::vector< std::future<int> > results;\n\n    for(int i = 0; i < 8; ++i) {\n        results.emplace_back(\n            pool.enqueue([i] {\n                std::cout << \"hello \" << i << std::endl;\n                std::this_thread::sleep_for(std::chrono::seconds(1));\n                std::cout << \"world \" << i << std::endl;\n                return i*i;\n            })\n        );\n    }\n\n    for(auto && result: results)\n        std::cout << result.get() << ' ';\n    std::cout << std::endl;\n    \n    return 0;\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/object_pool/README.mozilla",
    "content": "This code was imported from https://github.com/godefv/memory on September 17th 2020, commit 5ff1af8ee09ced04990b4863b2c02a8d07f4356a. It's licensed under \"CC0 1.0 Universal\" license.\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/object_pool/object_pool.h",
    "content": "#ifndef GODEFV_MEMORY_OBJECT_POOL_H\n#define GODEFV_MEMORY_OBJECT_POOL_H\n\n#include \"unique_ptr.h\"\n#include <memory>\n#include <vector>\n#include <array>\n\nnamespace godefv{\n\n// Forward declaration\ntemplate<class Object, template<class T> class Allocator = std::allocator, std::size_t ChunkSize = 1024>\nclass object_pool_t;\n\n//! Custom deleter to recycle the deleted pointers of the object_pool_t. \ntemplate<class Object, template<class T> class Allocator = std::allocator, std::size_t ChunkSize = 1024>\nstruct object_pool_deleter_t{\nprivate:\n\tobject_pool_t<Object, Allocator, ChunkSize>* object_pool_ptr;\npublic:\n\texplicit object_pool_deleter_t(decltype(object_pool_ptr) input_object_pool_ptr) :\n\t\tobject_pool_ptr(input_object_pool_ptr)\n\t{}\n\n\tvoid operator()(Object* object_ptr)\n\t{\n\t\tobject_pool_ptr->delete_object(object_ptr);\n\t}\n};\n\n//! Allocates instances of Object efficiently (constant time and log((maximum number of Objects used at the same time)/ChunkSize) calls to malloc in the whole lifetime of the object pool). \n//! When an instance returned by the object pool is destroyed, its allocated memory is recycled by the object pool. Defragmenting the object pool to free memory is not possible. \ntemplate<class Object, template<class T> class Allocator, std::size_t ChunkSize>\nclass object_pool_t{\n\t//! An object slot is an uninitialized memory space of the same size as Object. \n\t//! It is initially \"free\". It can then be \"used\" to construct an Object in place and the pointer to it is returned by the object pool. When the pointer is destroyed, the object slot is \"recycled\" and can be used again but it is not \"free\" anymore because \"free\" object slots are contiguous in memory.\n\tusing object_slot_t=std::array<char, sizeof(Object)>;\n\n\t//! To minimize calls to malloc, the object slots are allocated in chunks. \n\t//! For example, if ChunkSize=8, a chunk may look like this : |used|recycled|used|used|recycled|free|free|free|. In this example, if more than 5 new Object are now asked from the object pool, at least one new chunk of 8 object slots will be allocated.\n\tusing chunk_t=std::array<object_slot_t, ChunkSize>; \n\tAllocator<chunk_t> chunk_allocator; //!< This allocator can be used to have aligned memory if required.\n\tstd::vector<unique_ptr_t<chunk_t, decltype(chunk_allocator)>> memory_chunks; \n\n\t//! Recycled object slots are tracked using a stack of pointers to them. When an object slot is recycled, a pointer to it is pushed in constant time. When a new object is constructed, a recycled object slot can be found and poped in constant time.\n\tstd::vector<object_slot_t*> recycled_object_slots;\n\n\tobject_slot_t* free_object_slots_begin; \n\tobject_slot_t* free_object_slots_end; \n\n\t//! When a pointer provided by the ObjectPool is deleted, its memory is converted to an object slot to be recycled. \n\tvoid delete_object(Object* object_ptr){\n\t\tobject_ptr->~Object();\n\t\trecycled_object_slots.push_back(reinterpret_cast<object_slot_t*>(object_ptr));\n\t}\n\tfriend object_pool_deleter_t<Object, Allocator, ChunkSize>;\n\npublic:\n\tusing object_t = Object;\n\tusing deleter_t = object_pool_deleter_t<Object, Allocator, ChunkSize>;\n\tusing object_unique_ptr_t = std::unique_ptr<object_t, deleter_t>; //!< The type returned by the object pool.\n\n\tobject_pool_t(Allocator<chunk_t> const& allocator = Allocator<chunk_t>{}) :\n\t\tchunk_allocator{ allocator },\n\t\tfree_object_slots_begin{ free_object_slots_end } // At the begining, set the 2 iterators at the same value to simulate a full pool.\n\t{}\n\n\t//! Returns a unique pointer to an object_t using an unused object slot from the object pool. \n\ttemplate<class... Args> object_unique_ptr_t make_unique(Args&&... vars){\n\t\tauto construct_object_unique_ptr=[&](object_slot_t* object_slot){\n\t\t\treturn object_unique_ptr_t{ new (reinterpret_cast<object_t*>(object_slot)) object_t{ std::forward<Args>(vars)... } , deleter_t{ this } };\n\t\t};\n\n\t\t// If a recycled object slot is available, use it.\n\t\tif (!recycled_object_slots.empty())\n\t\t{\n\t\t\tauto object_slot = recycled_object_slots.back();\n\t\t\trecycled_object_slots.pop_back();\n\t\t\treturn construct_object_unique_ptr(object_slot);\n\t\t}\n\n\t\t// If the pool is full: add a new chunk.\n\t\tif (free_object_slots_begin == free_object_slots_end)\n\t\t{\n\t\t\tmemory_chunks.emplace_back(chunk_allocator);\n\t\t\tauto& new_chunk = memory_chunks.back();\n\t\t\tfree_object_slots_begin=new_chunk->data();\n\t\t\tfree_object_slots_end  =free_object_slots_begin+new_chunk->size();\n\t\t}\n\n\t\t// We know that there is now at least one free object slot, use it.\n\t\treturn construct_object_unique_ptr(free_object_slots_begin++);\n\t}\n\n\t//! Returns the total number of object slots (free, recycled, or used).\n\tstd::size_t capacity() const{\n\t\treturn memory_chunks.size()*ChunkSize;\n\t}\n\n\t//! Returns the number of currently used object slots.\n\tstd::size_t size() const{\n\t\treturn capacity() - static_cast<std::size_t>(free_object_slots_end-free_object_slots_begin) - recycled_object_slots.size();\n\t}\n};\n\n} /* namespace godefv */\n\n#endif /* GODEFV_MEMORY_OBJECT_POOL_H */\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/object_pool/unique_ptr.h",
    "content": "#ifndef GODEFV_MEMORY_ALLOCATED_UNIQUE_PTR_H\n#define GODEFV_MEMORY_ALLOCATED_UNIQUE_PTR_H\n\n#include <memory>\n\nnamespace godefv{\n\n//! A deleter to deallocate memory which have been allocated by the given allocator.\ntemplate<class Allocator> \nstruct allocator_deleter_t\n{\n\tallocator_deleter_t(Allocator const& allocator) :\n\t\tmAllocator{ allocator }\n\t{}\n\n\tvoid operator()(typename Allocator::value_type* ptr)\n\t{\n\t\tmAllocator.deallocate(ptr, 1);\n\t}\n\nprivate:\n\tAllocator mAllocator;\n};\n\n//! A smart pointer like std::unique_ptr but templated on an allocator instead of a deleter.\n//! The deleter is deduced from the given allocator.\ntemplate<class T, class Allocator = std::allocator<T>>\nstruct unique_ptr_t : public std::unique_ptr<T, allocator_deleter_t<Allocator>>\n{\n\tusing base_t = std::unique_ptr<T, allocator_deleter_t<Allocator>>;\n\n\tunique_ptr_t(Allocator allocator = Allocator{}) :\n\t\tbase_t{ allocator.allocate(1), allocator_deleter_t<Allocator>{ allocator } }\n\t{}\n};\n\n} // namespace godefv \n\n#endif // GODEFV_MEMORY_ALLOCATED_UNIQUE_PTR_H \n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/AUTHORS",
    "content": "Principal Contacts:\n\nCyril Allauzen     <allauzen@google.com>\nMichael Riley      <riley@google.com>\n\nContributors:\n\nThese contributions range from fundamental algorithmic contributions (e.g.,\nMehryar Mohri) to implementation of core components and extensions.\n\nTom Bagby\nDan Bikel\nKyle Gorman\nMartin Jansche\nBoulos Harb\nMehryar Mohri\nDan Povey\nKasturi Raghavan\nJacob Ratkiewicz\nJesse Rosenstock\nJohan Schalkwyk\nMasha Shugrina\nWojtek Skut\nJeffrey Sorensen\nRichard Sproat\nAnanda Theertha Suresh\nTerry Tai\nKe Wu\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/COPYING",
    "content": "Licensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use these files except in compliance with the License.\nYou may obtain a copy of the License at\n\n    http://www.apache.org/licenses/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n\nCopyright 2005-2018 Google, Inc.\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/INSTALL",
    "content": "Installation Instructions\n*************************\n\nCopyright (C) 1994, 1995, 1996, 1999, 2000, 2001, 2002, 2004, 2005,\n2006, 2007 Free Software Foundation, Inc.\n\nThis file is free documentation; the Free Software Foundation gives\nunlimited permission to copy, distribute and modify it.\n\nBasic Installation\n==================\n\nBriefly, the shell commands `./configure; make; make install' should\nconfigure, build, and install this package.  The following\nmore-detailed instructions are generic; see the `README' file for\ninstructions specific to this package.\n\n   The `configure' shell script attempts to guess correct values for\nvarious system-dependent variables used during compilation.  It uses\nthose values to create a `Makefile' in each directory of the package.\nIt may also create one or more `.h' files containing system-dependent\ndefinitions.  Finally, it creates a shell script `config.status' that\nyou can run in the future to recreate the current configuration, and a\nfile `config.log' containing compiler output (useful mainly for\ndebugging `configure').\n\n   It can also use an optional file (typically called `config.cache'\nand enabled with `--cache-file=config.cache' or simply `-C') that saves\nthe results of its tests to speed up reconfiguring.  Caching is\ndisabled by default to prevent problems with accidental use of stale\ncache files.\n\n   If you need to do unusual things to compile the package, please try\nto figure out how `configure' could check whether to do them, and mail\ndiffs or instructions to the address given in the `README' so they can\nbe considered for the next release.  If you are using the cache, and at\nsome point `config.cache' contains results you don't want to keep, you\nmay remove or edit it.\n\n   The file `configure.ac' (or `configure.in') is used to create\n`configure' by a program called `autoconf'.  You need `configure.ac' if\nyou want to change it or regenerate `configure' using a newer version\nof `autoconf'.\n\nThe simplest way to compile this package is:\n\n  1. `cd' to the directory containing the package's source code and type\n     `./configure' to configure the package for your system.\n\n     Running `configure' might take a while.  While running, it prints\n     some messages telling which features it is checking for.\n\n  2. Type `make' to compile the package.\n\n  3. Optionally, type `make check' to run any self-tests that come with\n     the package.\n\n  4. Type `make install' to install the programs and any data files and\n     documentation.\n\n  5. You can remove the program binaries and object files from the\n     source code directory by typing `make clean'.  To also remove the\n     files that `configure' created (so you can compile the package for\n     a different kind of computer), type `make distclean'.  There is\n     also a `make maintainer-clean' target, but that is intended mainly\n     for the package's developers.  If you use it, you may have to get\n     all sorts of other programs in order to regenerate files that came\n     with the distribution.\n\n  6. Often, you can also type `make uninstall' to remove the installed\n     files again.\n\nCompilers and Options\n=====================\n\nSome systems require unusual options for compilation or linking that the\n`configure' script does not know about.  Run `./configure --help' for\ndetails on some of the pertinent environment variables.\n\n   You can give `configure' initial values for configuration parameters\nby setting variables in the command line or in the environment.  Here\nis an example:\n\n     ./configure CC=c99 CFLAGS=-g LIBS=-lposix\n\n   *Note Defining Variables::, for more details.\n\nCompiling For Multiple Architectures\n====================================\n\nYou can compile the package for more than one kind of computer at the\nsame time, by placing the object files for each architecture in their\nown directory.  To do this, you can use GNU `make'.  `cd' to the\ndirectory where you want the object files and executables to go and run\nthe `configure' script.  `configure' automatically checks for the\nsource code in the directory that `configure' is in and in `..'.\n\n   With a non-GNU `make', it is safer to compile the package for one\narchitecture at a time in the source code directory.  After you have\ninstalled the package for one architecture, use `make distclean' before\nreconfiguring for another architecture.\n\nInstallation Names\n==================\n\nBy default, `make install' installs the package's commands under\n`/usr/local/bin', include files under `/usr/local/include', etc.  You\ncan specify an installation prefix other than `/usr/local' by giving\n`configure' the option `--prefix=PREFIX'.\n\n   You can specify separate installation prefixes for\narchitecture-specific files and architecture-independent files.  If you\npass the option `--exec-prefix=PREFIX' to `configure', the package uses\nPREFIX as the prefix for installing programs and libraries.\nDocumentation and other data files still use the regular prefix.\n\n   In addition, if you use an unusual directory layout you can give\noptions like `--bindir=DIR' to specify different values for particular\nkinds of files.  Run `configure --help' for a list of the directories\nyou can set and what kinds of files go in them.\n\n   If the package supports it, you can cause programs to be installed\nwith an extra prefix or suffix on their names by giving `configure' the\noption `--program-prefix=PREFIX' or `--program-suffix=SUFFIX'.\n\nOptional Features\n=================\n\nSome packages pay attention to `--enable-FEATURE' options to\n`configure', where FEATURE indicates an optional part of the package.\nThey may also pay attention to `--with-PACKAGE' options, where PACKAGE\nis something like `gnu-as' or `x' (for the X Window System).  The\n`README' should mention any `--enable-' and `--with-' options that the\npackage recognizes.\n\n   For packages that use the X Window System, `configure' can usually\nfind the X include and library files automatically, but if it doesn't,\nyou can use the `configure' options `--x-includes=DIR' and\n`--x-libraries=DIR' to specify their locations.\n\nSpecifying the System Type\n==========================\n\nThere may be some features `configure' cannot figure out automatically,\nbut needs to determine by the type of machine the package will run on.\nUsually, assuming the package is built to be run on the _same_\narchitectures, `configure' can figure that out, but if it prints a\nmessage saying it cannot guess the machine type, give it the\n`--build=TYPE' option.  TYPE can either be a short name for the system\ntype, such as `sun4', or a canonical name which has the form:\n\n     CPU-COMPANY-SYSTEM\n\nwhere SYSTEM can have one of these forms:\n\n     OS KERNEL-OS\n\n   See the file `config.sub' for the possible values of each field.  If\n`config.sub' isn't included in this package, then this package doesn't\nneed to know the machine type.\n\n   If you are _building_ compiler tools for cross-compiling, you should\nuse the option `--target=TYPE' to select the type of system they will\nproduce code for.\n\n   If you want to _use_ a cross compiler, that generates code for a\nplatform different from the build platform, you should specify the\n\"host\" platform (i.e., that on which the generated programs will\neventually be run) with `--host=TYPE'.\n\nSharing Defaults\n================\n\nIf you want to set default values for `configure' scripts to share, you\ncan create a site shell script called `config.site' that gives default\nvalues for variables like `CC', `cache_file', and `prefix'.\n`configure' looks for `PREFIX/share/config.site' if it exists, then\n`PREFIX/etc/config.site' if it exists.  Or, you can set the\n`CONFIG_SITE' environment variable to the location of the site script.\nA warning: not all `configure' scripts look for a site script.\n\nDefining Variables\n==================\n\nVariables not defined in a site shell script can be set in the\nenvironment passed to `configure'.  However, some packages may run\nconfigure again during the build, and the customized values of these\nvariables may be lost.  In order to avoid this problem, you should set\nthem in the `configure' command line, using `VAR=value'.  For example:\n\n     ./configure CC=/usr/local2/bin/gcc\n\ncauses the specified `gcc' to be used as the C compiler (unless it is\noverridden in the site shell script).\n\nUnfortunately, this technique does not work for `CONFIG_SHELL' due to\nan Autoconf bug.  Until the bug is fixed you can use this workaround:\n\n     CONFIG_SHELL=/bin/bash /bin/bash ./configure CONFIG_SHELL=/bin/bash\n\n`configure' Invocation\n======================\n\n`configure' recognizes the following options to control how it operates.\n\n`--help'\n`-h'\n     Print a summary of the options to `configure', and exit.\n\n`--version'\n`-V'\n     Print the version of Autoconf used to generate the `configure'\n     script, and exit.\n\n`--cache-file=FILE'\n     Enable the cache: use and save the results of the tests in FILE,\n     traditionally `config.cache'.  FILE defaults to `/dev/null' to\n     disable caching.\n\n`--config-cache'\n`-C'\n     Alias for `--cache-file=config.cache'.\n\n`--quiet'\n`--silent'\n`-q'\n     Do not print messages saying which checks are being made.  To\n     suppress all normal output, redirect it to `/dev/null' (any error\n     messages will still be shown).\n\n`--srcdir=DIR'\n     Look for the package's source code in directory DIR.  Usually\n     `configure' can determine that directory automatically.\n\n`configure' also accepts some other, not widely useful, options.  Run\n`configure --help' for more details.\n\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/Makefile.am",
    "content": "SUBDIRS = src\nACLOCAL_AMFLAGS = -I m4\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/Makefile.in",
    "content": "# Makefile.in generated by automake 1.14.1 from Makefile.am.\n# @configure_input@\n\n# Copyright (C) 1994-2013 Free Software Foundation, Inc.\n\n# This Makefile.in is free software; the Free Software Foundation\n# gives unlimited permission to copy and/or distribute it,\n# with or without modifications, as long as this notice is preserved.\n\n# This program is distributed in the hope that it will be useful,\n# but WITHOUT ANY WARRANTY, to the extent permitted by law; without\n# even the implied warranty of MERCHANTABILITY or FITNESS FOR A\n# PARTICULAR PURPOSE.\n\n@SET_MAKE@\nVPATH = @srcdir@\nam__is_gnu_make = test -n '$(MAKEFILE_LIST)' && test -n '$(MAKELEVEL)'\nam__make_running_with_option = \\\n  case $${target_option-} in \\\n      ?) ;; \\\n      *) echo \"am__make_running_with_option: internal error: invalid\" \\\n              \"target option '$${target_option-}' specified\" >&2; \\\n         exit 1;; \\\n  esac; \\\n  has_opt=no; \\\n  sane_makeflags=$$MAKEFLAGS; \\\n  if $(am__is_gnu_make); then \\\n    sane_makeflags=$$MFLAGS; \\\n  else \\\n    case $$MAKEFLAGS in \\\n      *\\\\[\\ \\\t]*) \\\n        bs=\\\\; \\\n        sane_makeflags=`printf '%s\\n' \"$$MAKEFLAGS\" \\\n          | sed \"s/$$bs$$bs[$$bs $$bs\t]*//g\"`;; \\\n    esac; \\\n  fi; \\\n  skip_next=no; \\\n  strip_trailopt () \\\n  { \\\n    flg=`printf '%s\\n' \"$$flg\" | sed \"s/$$1.*$$//\"`; \\\n  }; \\\n  for flg in $$sane_makeflags; do \\\n    test $$skip_next = yes && { skip_next=no; continue; }; \\\n    case $$flg in \\\n      *=*|--*) continue;; \\\n        -*I) strip_trailopt 'I'; skip_next=yes;; \\\n      -*I?*) strip_trailopt 'I';; \\\n        -*O) strip_trailopt 'O'; skip_next=yes;; \\\n      -*O?*) strip_trailopt 'O';; \\\n        -*l) strip_trailopt 'l'; skip_next=yes;; \\\n      -*l?*) strip_trailopt 'l';; \\\n      -[dEDm]) skip_next=yes;; \\\n      -[JT]) skip_next=yes;; \\\n    esac; \\\n    case $$flg in \\\n      *$$target_option*) has_opt=yes; break;; \\\n    esac; \\\n  done; \\\n  test $$has_opt = yes\nam__make_dryrun = (target_option=n; $(am__make_running_with_option))\nam__make_keepgoing = (target_option=k; $(am__make_running_with_option))\npkgdatadir = $(datadir)/@PACKAGE@\npkgincludedir = $(includedir)/@PACKAGE@\npkglibdir = $(libdir)/@PACKAGE@\npkglibexecdir = $(libexecdir)/@PACKAGE@\nam__cd = CDPATH=\"$${ZSH_VERSION+.}$(PATH_SEPARATOR)\" && cd\ninstall_sh_DATA = $(install_sh) -c -m 644\ninstall_sh_PROGRAM = $(install_sh) -c\ninstall_sh_SCRIPT = $(install_sh) -c\nINSTALL_HEADER = $(INSTALL_DATA)\ntransform = $(program_transform_name)\nNORMAL_INSTALL = :\nPRE_INSTALL = :\nPOST_INSTALL = :\nNORMAL_UNINSTALL = :\nPRE_UNINSTALL = :\nPOST_UNINSTALL = :\nbuild_triplet = @build@\nhost_triplet = @host@\nsubdir = .\nDIST_COMMON = $(srcdir)/Makefile.in $(srcdir)/Makefile.am \\\n\t$(top_srcdir)/configure $(am__configure_deps) \\\n\t$(srcdir)/config.h.in \\\n\t$(top_srcdir)/src/include/fst/config.h.in AUTHORS COPYING \\\n\tINSTALL NEWS README ar-lib compile config.guess config.sub \\\n\tinstall-sh missing ltmain.sh\nACLOCAL_M4 = $(top_srcdir)/aclocal.m4\nam__aclocal_m4_deps = $(top_srcdir)/m4/ac_python_devel.m4 \\\n\t$(top_srcdir)/m4/libtool.m4 $(top_srcdir)/m4/ltoptions.m4 \\\n\t$(top_srcdir)/m4/ltsugar.m4 $(top_srcdir)/m4/ltversion.m4 \\\n\t$(top_srcdir)/m4/lt~obsolete.m4 $(top_srcdir)/configure.ac\nam__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \\\n\t$(ACLOCAL_M4)\nam__CONFIG_DISTCLEAN_FILES = config.status config.cache config.log \\\n configure.lineno config.status.lineno\nmkinstalldirs = $(install_sh) -d\nCONFIG_HEADER = config.h $(top_builddir)/src/include/fst/config.h\nCONFIG_CLEAN_FILES =\nCONFIG_CLEAN_VPATH_FILES =\nAM_V_P = $(am__v_P_@AM_V@)\nam__v_P_ = $(am__v_P_@AM_DEFAULT_V@)\nam__v_P_0 = false\nam__v_P_1 = :\nAM_V_GEN = $(am__v_GEN_@AM_V@)\nam__v_GEN_ = $(am__v_GEN_@AM_DEFAULT_V@)\nam__v_GEN_0 = @echo \"  GEN     \" $@;\nam__v_GEN_1 = \nAM_V_at = $(am__v_at_@AM_V@)\nam__v_at_ = $(am__v_at_@AM_DEFAULT_V@)\nam__v_at_0 = @\nam__v_at_1 = \nSOURCES =\nDIST_SOURCES =\nRECURSIVE_TARGETS = all-recursive check-recursive cscopelist-recursive \\\n\tctags-recursive dvi-recursive html-recursive info-recursive \\\n\tinstall-data-recursive install-dvi-recursive \\\n\tinstall-exec-recursive install-html-recursive \\\n\tinstall-info-recursive install-pdf-recursive \\\n\tinstall-ps-recursive install-recursive installcheck-recursive \\\n\tinstalldirs-recursive pdf-recursive ps-recursive \\\n\ttags-recursive uninstall-recursive\nam__can_run_installinfo = \\\n  case $$AM_UPDATE_INFO_DIR in \\\n    n|no|NO) false;; \\\n    *) (install-info --version) >/dev/null 2>&1;; \\\n  esac\nRECURSIVE_CLEAN_TARGETS = mostlyclean-recursive clean-recursive\t\\\n  distclean-recursive maintainer-clean-recursive\nam__recursive_targets = \\\n  $(RECURSIVE_TARGETS) \\\n  $(RECURSIVE_CLEAN_TARGETS) \\\n  $(am__extra_recursive_targets)\nAM_RECURSIVE_TARGETS = $(am__recursive_targets:-recursive=) TAGS CTAGS \\\n\tcscope distdir dist dist-all distcheck\nam__tagged_files = $(HEADERS) $(SOURCES) $(TAGS_FILES) \\\n\t$(LISP)config.h.in\n# Read a list of newline-separated strings from the standard input,\n# and print each of them once, without duplicates.  Input order is\n# *not* preserved.\nam__uniquify_input = $(AWK) '\\\n  BEGIN { nonempty = 0; } \\\n  { items[$$0] = 1; nonempty = 1; } \\\n  END { if (nonempty) { for (i in items) print i; }; } \\\n'\n# Make sure the list of sources is unique.  This is necessary because,\n# e.g., the same source file might be shared among _SOURCES variables\n# for different programs/libraries.\nam__define_uniq_tagged_files = \\\n  list='$(am__tagged_files)'; \\\n  unique=`for i in $$list; do \\\n    if test -f \"$$i\"; then echo $$i; else echo $(srcdir)/$$i; fi; \\\n  done | $(am__uniquify_input)`\nETAGS = etags\nCTAGS = ctags\nCSCOPE = cscope\nDIST_SUBDIRS = $(SUBDIRS)\nDISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST)\ndistdir = $(PACKAGE)-$(VERSION)\ntop_distdir = $(distdir)\nam__remove_distdir = \\\n  if test -d \"$(distdir)\"; then \\\n    find \"$(distdir)\" -type d ! -perm -200 -exec chmod u+w {} ';' \\\n      && rm -rf \"$(distdir)\" \\\n      || { sleep 5 && rm -rf \"$(distdir)\"; }; \\\n  else :; fi\nam__post_remove_distdir = $(am__remove_distdir)\nam__relativize = \\\n  dir0=`pwd`; \\\n  sed_first='s,^\\([^/]*\\)/.*$$,\\1,'; \\\n  sed_rest='s,^[^/]*/*,,'; \\\n  sed_last='s,^.*/\\([^/]*\\)$$,\\1,'; \\\n  sed_butlast='s,/*[^/]*$$,,'; \\\n  while test -n \"$$dir1\"; do \\\n    first=`echo \"$$dir1\" | sed -e \"$$sed_first\"`; \\\n    if test \"$$first\" != \".\"; then \\\n      if test \"$$first\" = \"..\"; then \\\n        dir2=`echo \"$$dir0\" | sed -e \"$$sed_last\"`/\"$$dir2\"; \\\n        dir0=`echo \"$$dir0\" | sed -e \"$$sed_butlast\"`; \\\n      else \\\n        first2=`echo \"$$dir2\" | sed -e \"$$sed_first\"`; \\\n        if test \"$$first2\" = \"$$first\"; then \\\n          dir2=`echo \"$$dir2\" | sed -e \"$$sed_rest\"`; \\\n        else \\\n          dir2=\"../$$dir2\"; \\\n        fi; \\\n        dir0=\"$$dir0\"/\"$$first\"; \\\n      fi; \\\n    fi; \\\n    dir1=`echo \"$$dir1\" | sed -e \"$$sed_rest\"`; \\\n  done; \\\n  reldir=\"$$dir2\"\nDIST_ARCHIVES = $(distdir).tar.gz\nGZIP_ENV = --best\nDIST_TARGETS = dist-gzip\ndistuninstallcheck_listfiles = find . -type f -print\nam__distuninstallcheck_listfiles = $(distuninstallcheck_listfiles) \\\n  | sed 's|^\\./|$(prefix)/|' | grep -v '$(infodir)/dir$$'\ndistcleancheck_listfiles = find . -type f -print\nACLOCAL = @ACLOCAL@\nAMTAR = @AMTAR@\nAM_DEFAULT_VERBOSITY = @AM_DEFAULT_VERBOSITY@\nAR = @AR@\nAUTOCONF = @AUTOCONF@\nAUTOHEADER = @AUTOHEADER@\nAUTOMAKE = @AUTOMAKE@\nAWK = @AWK@\nCC = @CC@\nCCDEPMODE = @CCDEPMODE@\nCFLAGS = @CFLAGS@\nCPP = @CPP@\nCPPFLAGS = @CPPFLAGS@\nCXX = @CXX@\nCXXCPP = @CXXCPP@\nCXXDEPMODE = @CXXDEPMODE@\nCXXFLAGS = @CXXFLAGS@\nCYGPATH_W = @CYGPATH_W@\nDEFS = @DEFS@\nDEPDIR = @DEPDIR@\nDLLTOOL = @DLLTOOL@\nDL_LIBS = @DL_LIBS@\nDSYMUTIL = @DSYMUTIL@\nDUMPBIN = @DUMPBIN@\nECHO_C = @ECHO_C@\nECHO_N = @ECHO_N@\nECHO_T = @ECHO_T@\nEGREP = @EGREP@\nEXEEXT = @EXEEXT@\nFGREP = @FGREP@\nGREP = @GREP@\nINSTALL = @INSTALL@\nINSTALL_DATA = @INSTALL_DATA@\nINSTALL_PROGRAM = @INSTALL_PROGRAM@\nINSTALL_SCRIPT = @INSTALL_SCRIPT@\nINSTALL_STRIP_PROGRAM = @INSTALL_STRIP_PROGRAM@\nLD = @LD@\nLDFLAGS = @LDFLAGS@\nLIBOBJS = @LIBOBJS@\nLIBS = @LIBS@\nLIBTOOL = @LIBTOOL@\nLIPO = @LIPO@\nLN_S = @LN_S@\nLTLIBOBJS = @LTLIBOBJS@\nMAKEINFO = @MAKEINFO@\nMANIFEST_TOOL = @MANIFEST_TOOL@\nMKDIR_P = @MKDIR_P@\nNM = @NM@\nNMEDIT = @NMEDIT@\nOBJDUMP = @OBJDUMP@\nOBJEXT = @OBJEXT@\nOTOOL = @OTOOL@\nOTOOL64 = @OTOOL64@\nPACKAGE = @PACKAGE@\nPACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@\nPACKAGE_NAME = @PACKAGE_NAME@\nPACKAGE_STRING = @PACKAGE_STRING@\nPACKAGE_TARNAME = @PACKAGE_TARNAME@\nPACKAGE_URL = @PACKAGE_URL@\nPACKAGE_VERSION = @PACKAGE_VERSION@\nPATH_SEPARATOR = @PATH_SEPARATOR@\nPYTHON = @PYTHON@\nPYTHON_CPPFLAGS = @PYTHON_CPPFLAGS@\nPYTHON_EXEC_PREFIX = @PYTHON_EXEC_PREFIX@\nPYTHON_EXTRA_LDFLAGS = @PYTHON_EXTRA_LDFLAGS@\nPYTHON_EXTRA_LIBS = @PYTHON_EXTRA_LIBS@\nPYTHON_LDFLAGS = @PYTHON_LDFLAGS@\nPYTHON_PLATFORM = @PYTHON_PLATFORM@\nPYTHON_PREFIX = @PYTHON_PREFIX@\nPYTHON_SITE_PKG = @PYTHON_SITE_PKG@\nPYTHON_VERSION = @PYTHON_VERSION@\nRANLIB = @RANLIB@\nSED = @SED@\nSET_MAKE = @SET_MAKE@\nSHELL = @SHELL@\nSTRIP = @STRIP@\nVERSION = @VERSION@\nabs_builddir = @abs_builddir@\nabs_srcdir = @abs_srcdir@\nabs_top_builddir = @abs_top_builddir@\nabs_top_srcdir = @abs_top_srcdir@\nac_ct_AR = @ac_ct_AR@\nac_ct_CC = @ac_ct_CC@\nac_ct_CXX = @ac_ct_CXX@\nac_ct_DUMPBIN = @ac_ct_DUMPBIN@\nam__include = @am__include@\nam__leading_dot = @am__leading_dot@\nam__quote = @am__quote@\nam__tar = @am__tar@\nam__untar = @am__untar@\nbindir = @bindir@\nbuild = @build@\nbuild_alias = @build_alias@\nbuild_cpu = @build_cpu@\nbuild_os = @build_os@\nbuild_vendor = @build_vendor@\nbuilddir = @builddir@\ndatadir = @datadir@\ndatarootdir = @datarootdir@\ndocdir = @docdir@\ndvidir = @dvidir@\nexec_prefix = @exec_prefix@\nhost = @host@\nhost_alias = @host_alias@\nhost_cpu = @host_cpu@\nhost_os = @host_os@\nhost_vendor = @host_vendor@\nhtmldir = @htmldir@\nincludedir = @includedir@\ninfodir = @infodir@\ninstall_sh = @install_sh@\nlibdir = @libdir@\nlibexecdir = @libexecdir@\nlibfstdir = @libfstdir@\nlocaledir = @localedir@\nlocalstatedir = @localstatedir@\nmandir = @mandir@\nmkdir_p = @mkdir_p@\noldincludedir = @oldincludedir@\npdfdir = @pdfdir@\npkgpyexecdir = @pkgpyexecdir@\npkgpythondir = @pkgpythondir@\nprefix = @prefix@\nprogram_transform_name = @program_transform_name@\npsdir = @psdir@\npyexecdir = @pyexecdir@\npythondir = @pythondir@\nsbindir = @sbindir@\nsharedstatedir = @sharedstatedir@\nsrcdir = @srcdir@\nsysconfdir = @sysconfdir@\ntarget_alias = @target_alias@\ntop_build_prefix = @top_build_prefix@\ntop_builddir = @top_builddir@\ntop_srcdir = @top_srcdir@\nSUBDIRS = src\nACLOCAL_AMFLAGS = -I m4\nall: config.h\n\t$(MAKE) $(AM_MAKEFLAGS) all-recursive\n\n.SUFFIXES:\nam--refresh: Makefile\n\t@:\n$(srcdir)/Makefile.in:  $(srcdir)/Makefile.am  $(am__configure_deps)\n\t@for dep in $?; do \\\n\t  case '$(am__configure_deps)' in \\\n\t    *$$dep*) \\\n\t      echo ' cd $(srcdir) && $(AUTOMAKE) --foreign'; \\\n\t      $(am__cd) $(srcdir) && $(AUTOMAKE) --foreign \\\n\t\t&& exit 0; \\\n\t      exit 1;; \\\n\t  esac; \\\n\tdone; \\\n\techo ' cd $(top_srcdir) && $(AUTOMAKE) --foreign Makefile'; \\\n\t$(am__cd) $(top_srcdir) && \\\n\t  $(AUTOMAKE) --foreign Makefile\n.PRECIOUS: Makefile\nMakefile: $(srcdir)/Makefile.in $(top_builddir)/config.status\n\t@case '$?' in \\\n\t  *config.status*) \\\n\t    echo ' $(SHELL) ./config.status'; \\\n\t    $(SHELL) ./config.status;; \\\n\t  *) \\\n\t    echo ' cd $(top_builddir) && $(SHELL) ./config.status $@ $(am__depfiles_maybe)'; \\\n\t    cd $(top_builddir) && $(SHELL) ./config.status $@ $(am__depfiles_maybe);; \\\n\tesac;\n\n$(top_builddir)/config.status: $(top_srcdir)/configure $(CONFIG_STATUS_DEPENDENCIES)\n\t$(SHELL) ./config.status --recheck\n\n$(top_srcdir)/configure:  $(am__configure_deps)\n\t$(am__cd) $(srcdir) && $(AUTOCONF)\n$(ACLOCAL_M4):  $(am__aclocal_m4_deps)\n\t$(am__cd) $(srcdir) && $(ACLOCAL) $(ACLOCAL_AMFLAGS)\n$(am__aclocal_m4_deps):\n\nconfig.h: stamp-h1\n\t@test -f $@ || rm -f stamp-h1\n\t@test -f $@ || $(MAKE) $(AM_MAKEFLAGS) stamp-h1\n\nstamp-h1: $(srcdir)/config.h.in $(top_builddir)/config.status\n\t@rm -f stamp-h1\n\tcd $(top_builddir) && $(SHELL) ./config.status config.h\n$(srcdir)/config.h.in:  $(am__configure_deps) \n\t($(am__cd) $(top_srcdir) && $(AUTOHEADER))\n\trm -f stamp-h1\n\ttouch $@\n\nsrc/include/fst/config.h: src/include/fst/stamp-h2\n\t@test -f $@ || rm -f src/include/fst/stamp-h2\n\t@test -f $@ || $(MAKE) $(AM_MAKEFLAGS) src/include/fst/stamp-h2\n\nsrc/include/fst/stamp-h2: $(top_srcdir)/src/include/fst/config.h.in $(top_builddir)/config.status\n\t@rm -f src/include/fst/stamp-h2\n\tcd $(top_builddir) && $(SHELL) ./config.status src/include/fst/config.h\n\ndistclean-hdr:\n\t-rm -f config.h stamp-h1 src/include/fst/config.h src/include/fst/stamp-h2\n\nmostlyclean-libtool:\n\t-rm -f *.lo\n\nclean-libtool:\n\t-rm -rf .libs _libs\n\ndistclean-libtool:\n\t-rm -f libtool config.lt\n\n# This directory's subdirectories are mostly independent; you can cd\n# into them and run 'make' without going through this Makefile.\n# To change the values of 'make' variables: instead of editing Makefiles,\n# (1) if the variable is set in 'config.status', edit 'config.status'\n#     (which will cause the Makefiles to be regenerated when you run 'make');\n# (2) otherwise, pass the desired values on the 'make' command line.\n$(am__recursive_targets):\n\t@fail=; \\\n\tif $(am__make_keepgoing); then \\\n\t  failcom='fail=yes'; \\\n\telse \\\n\t  failcom='exit 1'; \\\n\tfi; \\\n\tdot_seen=no; \\\n\ttarget=`echo $@ | sed s/-recursive//`; \\\n\tcase \"$@\" in \\\n\t  distclean-* | maintainer-clean-*) list='$(DIST_SUBDIRS)' ;; \\\n\t  *) list='$(SUBDIRS)' ;; \\\n\tesac; \\\n\tfor subdir in $$list; do \\\n\t  echo \"Making $$target in $$subdir\"; \\\n\t  if test \"$$subdir\" = \".\"; then \\\n\t    dot_seen=yes; \\\n\t    local_target=\"$$target-am\"; \\\n\t  else \\\n\t    local_target=\"$$target\"; \\\n\t  fi; \\\n\t  ($(am__cd) $$subdir && $(MAKE) $(AM_MAKEFLAGS) $$local_target) \\\n\t  || eval $$failcom; \\\n\tdone; \\\n\tif test \"$$dot_seen\" = \"no\"; then \\\n\t  $(MAKE) $(AM_MAKEFLAGS) \"$$target-am\" || exit 1; \\\n\tfi; test -z \"$$fail\"\n\nID: $(am__tagged_files)\n\t$(am__define_uniq_tagged_files); mkid -fID $$unique\ntags: tags-recursive\nTAGS: tags\n\ntags-am: $(TAGS_DEPENDENCIES) $(am__tagged_files)\n\tset x; \\\n\there=`pwd`; \\\n\tif ($(ETAGS) --etags-include --version) >/dev/null 2>&1; then \\\n\t  include_option=--etags-include; \\\n\t  empty_fix=.; \\\n\telse \\\n\t  include_option=--include; \\\n\t  empty_fix=; \\\n\tfi; \\\n\tlist='$(SUBDIRS)'; for subdir in $$list; do \\\n\t  if test \"$$subdir\" = .; then :; else \\\n\t    test ! -f $$subdir/TAGS || \\\n\t      set \"$$@\" \"$$include_option=$$here/$$subdir/TAGS\"; \\\n\t  fi; \\\n\tdone; \\\n\t$(am__define_uniq_tagged_files); \\\n\tshift; \\\n\tif test -z \"$(ETAGS_ARGS)$$*$$unique\"; then :; else \\\n\t  test -n \"$$unique\" || unique=$$empty_fix; \\\n\t  if test $$# -gt 0; then \\\n\t    $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \\\n\t      \"$$@\" $$unique; \\\n\t  else \\\n\t    $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \\\n\t      $$unique; \\\n\t  fi; \\\n\tfi\nctags: ctags-recursive\n\nCTAGS: ctags\nctags-am: $(TAGS_DEPENDENCIES) $(am__tagged_files)\n\t$(am__define_uniq_tagged_files); \\\n\ttest -z \"$(CTAGS_ARGS)$$unique\" \\\n\t  || $(CTAGS) $(CTAGSFLAGS) $(AM_CTAGSFLAGS) $(CTAGS_ARGS) \\\n\t     $$unique\n\nGTAGS:\n\there=`$(am__cd) $(top_builddir) && pwd` \\\n\t  && $(am__cd) $(top_srcdir) \\\n\t  && gtags -i $(GTAGS_ARGS) \"$$here\"\ncscope: cscope.files\n\ttest ! -s cscope.files \\\n\t  || $(CSCOPE) -b -q $(AM_CSCOPEFLAGS) $(CSCOPEFLAGS) -i cscope.files $(CSCOPE_ARGS)\nclean-cscope:\n\t-rm -f cscope.files\ncscope.files: clean-cscope cscopelist\ncscopelist: cscopelist-recursive\n\ncscopelist-am: $(am__tagged_files)\n\tlist='$(am__tagged_files)'; \\\n\tcase \"$(srcdir)\" in \\\n\t  [\\\\/]* | ?:[\\\\/]*) sdir=\"$(srcdir)\" ;; \\\n\t  *) sdir=$(subdir)/$(srcdir) ;; \\\n\tesac; \\\n\tfor i in $$list; do \\\n\t  if test -f \"$$i\"; then \\\n\t    echo \"$(subdir)/$$i\"; \\\n\t  else \\\n\t    echo \"$$sdir/$$i\"; \\\n\t  fi; \\\n\tdone >> $(top_builddir)/cscope.files\n\ndistclean-tags:\n\t-rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags\n\t-rm -f cscope.out cscope.in.out cscope.po.out cscope.files\n\ndistdir: $(DISTFILES)\n\t$(am__remove_distdir)\n\ttest -d \"$(distdir)\" || mkdir \"$(distdir)\"\n\t@srcdirstrip=`echo \"$(srcdir)\" | sed 's/[].[^$$\\\\*]/\\\\\\\\&/g'`; \\\n\ttopsrcdirstrip=`echo \"$(top_srcdir)\" | sed 's/[].[^$$\\\\*]/\\\\\\\\&/g'`; \\\n\tlist='$(DISTFILES)'; \\\n\t  dist_files=`for file in $$list; do echo $$file; done | \\\n\t  sed -e \"s|^$$srcdirstrip/||;t\" \\\n\t      -e \"s|^$$topsrcdirstrip/|$(top_builddir)/|;t\"`; \\\n\tcase $$dist_files in \\\n\t  */*) $(MKDIR_P) `echo \"$$dist_files\" | \\\n\t\t\t   sed '/\\//!d;s|^|$(distdir)/|;s,/[^/]*$$,,' | \\\n\t\t\t   sort -u` ;; \\\n\tesac; \\\n\tfor file in $$dist_files; do \\\n\t  if test -f $$file || test -d $$file; then d=.; else d=$(srcdir); fi; \\\n\t  if test -d $$d/$$file; then \\\n\t    dir=`echo \"/$$file\" | sed -e 's,/[^/]*$$,,'`; \\\n\t    if test -d \"$(distdir)/$$file\"; then \\\n\t      find \"$(distdir)/$$file\" -type d ! -perm -700 -exec chmod u+rwx {} \\;; \\\n\t    fi; \\\n\t    if test -d $(srcdir)/$$file && test $$d != $(srcdir); then \\\n\t      cp -fpR $(srcdir)/$$file \"$(distdir)$$dir\" || exit 1; \\\n\t      find \"$(distdir)/$$file\" -type d ! -perm -700 -exec chmod u+rwx {} \\;; \\\n\t    fi; \\\n\t    cp -fpR $$d/$$file \"$(distdir)$$dir\" || exit 1; \\\n\t  else \\\n\t    test -f \"$(distdir)/$$file\" \\\n\t    || cp -p $$d/$$file \"$(distdir)/$$file\" \\\n\t    || exit 1; \\\n\t  fi; \\\n\tdone\n\t@list='$(DIST_SUBDIRS)'; for subdir in $$list; do \\\n\t  if test \"$$subdir\" = .; then :; else \\\n\t    $(am__make_dryrun) \\\n\t      || test -d \"$(distdir)/$$subdir\" \\\n\t      || $(MKDIR_P) \"$(distdir)/$$subdir\" \\\n\t      || exit 1; \\\n\t    dir1=$$subdir; dir2=\"$(distdir)/$$subdir\"; \\\n\t    $(am__relativize); \\\n\t    new_distdir=$$reldir; \\\n\t    dir1=$$subdir; dir2=\"$(top_distdir)\"; \\\n\t    $(am__relativize); \\\n\t    new_top_distdir=$$reldir; \\\n\t    echo \" (cd $$subdir && $(MAKE) $(AM_MAKEFLAGS) top_distdir=\"$$new_top_distdir\" distdir=\"$$new_distdir\" \\\\\"; \\\n\t    echo \"     am__remove_distdir=: am__skip_length_check=: am__skip_mode_fix=: distdir)\"; \\\n\t    ($(am__cd) $$subdir && \\\n\t      $(MAKE) $(AM_MAKEFLAGS) \\\n\t        top_distdir=\"$$new_top_distdir\" \\\n\t        distdir=\"$$new_distdir\" \\\n\t\tam__remove_distdir=: \\\n\t\tam__skip_length_check=: \\\n\t\tam__skip_mode_fix=: \\\n\t        distdir) \\\n\t      || exit 1; \\\n\t  fi; \\\n\tdone\n\t-test -n \"$(am__skip_mode_fix)\" \\\n\t|| find \"$(distdir)\" -type d ! -perm -755 \\\n\t\t-exec chmod u+rwx,go+rx {} \\; -o \\\n\t  ! -type d ! -perm -444 -links 1 -exec chmod a+r {} \\; -o \\\n\t  ! -type d ! -perm -400 -exec chmod a+r {} \\; -o \\\n\t  ! -type d ! -perm -444 -exec $(install_sh) -c -m a+r {} {} \\; \\\n\t|| chmod -R a+r \"$(distdir)\"\ndist-gzip: distdir\n\ttardir=$(distdir) && $(am__tar) | GZIP=$(GZIP_ENV) gzip -c >$(distdir).tar.gz\n\t$(am__post_remove_distdir)\n\ndist-bzip2: distdir\n\ttardir=$(distdir) && $(am__tar) | BZIP2=$${BZIP2--9} bzip2 -c >$(distdir).tar.bz2\n\t$(am__post_remove_distdir)\n\ndist-lzip: distdir\n\ttardir=$(distdir) && $(am__tar) | lzip -c $${LZIP_OPT--9} >$(distdir).tar.lz\n\t$(am__post_remove_distdir)\n\ndist-xz: distdir\n\ttardir=$(distdir) && $(am__tar) | XZ_OPT=$${XZ_OPT--e} xz -c >$(distdir).tar.xz\n\t$(am__post_remove_distdir)\n\ndist-tarZ: distdir\n\t@echo WARNING: \"Support for shar distribution archives is\" \\\n\t               \"deprecated.\" >&2\n\t@echo WARNING: \"It will be removed altogether in Automake 2.0\" >&2\n\ttardir=$(distdir) && $(am__tar) | compress -c >$(distdir).tar.Z\n\t$(am__post_remove_distdir)\n\ndist-shar: distdir\n\t@echo WARNING: \"Support for distribution archives compressed with\" \\\n\t\t       \"legacy program 'compress' is deprecated.\" >&2\n\t@echo WARNING: \"It will be removed altogether in Automake 2.0\" >&2\n\tshar $(distdir) | GZIP=$(GZIP_ENV) gzip -c >$(distdir).shar.gz\n\t$(am__post_remove_distdir)\n\ndist-zip: distdir\n\t-rm -f $(distdir).zip\n\tzip -rq $(distdir).zip $(distdir)\n\t$(am__post_remove_distdir)\n\ndist dist-all:\n\t$(MAKE) $(AM_MAKEFLAGS) $(DIST_TARGETS) am__post_remove_distdir='@:'\n\t$(am__post_remove_distdir)\n\n# This target untars the dist file and tries a VPATH configuration.  Then\n# it guarantees that the distribution is self-contained by making another\n# tarfile.\ndistcheck: dist\n\tcase '$(DIST_ARCHIVES)' in \\\n\t*.tar.gz*) \\\n\t  GZIP=$(GZIP_ENV) gzip -dc $(distdir).tar.gz | $(am__untar) ;;\\\n\t*.tar.bz2*) \\\n\t  bzip2 -dc $(distdir).tar.bz2 | $(am__untar) ;;\\\n\t*.tar.lz*) \\\n\t  lzip -dc $(distdir).tar.lz | $(am__untar) ;;\\\n\t*.tar.xz*) \\\n\t  xz -dc $(distdir).tar.xz | $(am__untar) ;;\\\n\t*.tar.Z*) \\\n\t  uncompress -c $(distdir).tar.Z | $(am__untar) ;;\\\n\t*.shar.gz*) \\\n\t  GZIP=$(GZIP_ENV) gzip -dc $(distdir).shar.gz | unshar ;;\\\n\t*.zip*) \\\n\t  unzip $(distdir).zip ;;\\\n\tesac\n\tchmod -R a-w $(distdir)\n\tchmod u+w $(distdir)\n\tmkdir $(distdir)/_build $(distdir)/_inst\n\tchmod a-w $(distdir)\n\ttest -d $(distdir)/_build || exit 0; \\\n\tdc_install_base=`$(am__cd) $(distdir)/_inst && pwd | sed -e 's,^[^:\\\\/]:[\\\\/],/,'` \\\n\t  && dc_destdir=\"$${TMPDIR-/tmp}/am-dc-$$$$/\" \\\n\t  && am__cwd=`pwd` \\\n\t  && $(am__cd) $(distdir)/_build \\\n\t  && ../configure \\\n\t    $(AM_DISTCHECK_CONFIGURE_FLAGS) \\\n\t    $(DISTCHECK_CONFIGURE_FLAGS) \\\n\t    --srcdir=.. --prefix=\"$$dc_install_base\" \\\n\t  && $(MAKE) $(AM_MAKEFLAGS) \\\n\t  && $(MAKE) $(AM_MAKEFLAGS) dvi \\\n\t  && $(MAKE) $(AM_MAKEFLAGS) check \\\n\t  && $(MAKE) $(AM_MAKEFLAGS) install \\\n\t  && $(MAKE) $(AM_MAKEFLAGS) installcheck \\\n\t  && $(MAKE) $(AM_MAKEFLAGS) uninstall \\\n\t  && $(MAKE) $(AM_MAKEFLAGS) distuninstallcheck_dir=\"$$dc_install_base\" \\\n\t        distuninstallcheck \\\n\t  && chmod -R a-w \"$$dc_install_base\" \\\n\t  && ({ \\\n\t       (cd ../.. && umask 077 && mkdir \"$$dc_destdir\") \\\n\t       && $(MAKE) $(AM_MAKEFLAGS) DESTDIR=\"$$dc_destdir\" install \\\n\t       && $(MAKE) $(AM_MAKEFLAGS) DESTDIR=\"$$dc_destdir\" uninstall \\\n\t       && $(MAKE) $(AM_MAKEFLAGS) DESTDIR=\"$$dc_destdir\" \\\n\t            distuninstallcheck_dir=\"$$dc_destdir\" distuninstallcheck; \\\n\t      } || { rm -rf \"$$dc_destdir\"; exit 1; }) \\\n\t  && rm -rf \"$$dc_destdir\" \\\n\t  && $(MAKE) $(AM_MAKEFLAGS) dist \\\n\t  && rm -rf $(DIST_ARCHIVES) \\\n\t  && $(MAKE) $(AM_MAKEFLAGS) distcleancheck \\\n\t  && cd \"$$am__cwd\" \\\n\t  || exit 1\n\t$(am__post_remove_distdir)\n\t@(echo \"$(distdir) archives ready for distribution: \"; \\\n\t  list='$(DIST_ARCHIVES)'; for i in $$list; do echo $$i; done) | \\\n\t  sed -e 1h -e 1s/./=/g -e 1p -e 1x -e '$$p' -e '$$x'\ndistuninstallcheck:\n\t@test -n '$(distuninstallcheck_dir)' || { \\\n\t  echo 'ERROR: trying to run $@ with an empty' \\\n\t       '$$(distuninstallcheck_dir)' >&2; \\\n\t  exit 1; \\\n\t}; \\\n\t$(am__cd) '$(distuninstallcheck_dir)' || { \\\n\t  echo 'ERROR: cannot chdir into $(distuninstallcheck_dir)' >&2; \\\n\t  exit 1; \\\n\t}; \\\n\ttest `$(am__distuninstallcheck_listfiles) | wc -l` -eq 0 \\\n\t   || { echo \"ERROR: files left after uninstall:\" ; \\\n\t        if test -n \"$(DESTDIR)\"; then \\\n\t          echo \"  (check DESTDIR support)\"; \\\n\t        fi ; \\\n\t        $(distuninstallcheck_listfiles) ; \\\n\t        exit 1; } >&2\ndistcleancheck: distclean\n\t@if test '$(srcdir)' = . ; then \\\n\t  echo \"ERROR: distcleancheck can only run from a VPATH build\" ; \\\n\t  exit 1 ; \\\n\tfi\n\t@test `$(distcleancheck_listfiles) | wc -l` -eq 0 \\\n\t  || { echo \"ERROR: files left in build directory after distclean:\" ; \\\n\t       $(distcleancheck_listfiles) ; \\\n\t       exit 1; } >&2\ncheck-am: all-am\ncheck: check-recursive\nall-am: Makefile config.h\ninstalldirs: installdirs-recursive\ninstalldirs-am:\ninstall: install-recursive\ninstall-exec: install-exec-recursive\ninstall-data: install-data-recursive\nuninstall: uninstall-recursive\n\ninstall-am: all-am\n\t@$(MAKE) $(AM_MAKEFLAGS) install-exec-am install-data-am\n\ninstallcheck: installcheck-recursive\ninstall-strip:\n\tif test -z '$(STRIP)'; then \\\n\t  $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" \\\n\t    install_sh_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" INSTALL_STRIP_FLAG=-s \\\n\t      install; \\\n\telse \\\n\t  $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" \\\n\t    install_sh_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" INSTALL_STRIP_FLAG=-s \\\n\t    \"INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'\" install; \\\n\tfi\nmostlyclean-generic:\n\nclean-generic:\n\ndistclean-generic:\n\t-test -z \"$(CONFIG_CLEAN_FILES)\" || rm -f $(CONFIG_CLEAN_FILES)\n\t-test . = \"$(srcdir)\" || test -z \"$(CONFIG_CLEAN_VPATH_FILES)\" || rm -f $(CONFIG_CLEAN_VPATH_FILES)\n\nmaintainer-clean-generic:\n\t@echo \"This command is intended for maintainers to use\"\n\t@echo \"it deletes files that may require special tools to rebuild.\"\nclean: clean-recursive\n\nclean-am: clean-generic clean-libtool mostlyclean-am\n\ndistclean: distclean-recursive\n\t-rm -f $(am__CONFIG_DISTCLEAN_FILES)\n\t-rm -f Makefile\ndistclean-am: clean-am distclean-generic distclean-hdr \\\n\tdistclean-libtool distclean-tags\n\ndvi: dvi-recursive\n\ndvi-am:\n\nhtml: html-recursive\n\nhtml-am:\n\ninfo: info-recursive\n\ninfo-am:\n\ninstall-data-am:\n\ninstall-dvi: install-dvi-recursive\n\ninstall-dvi-am:\n\ninstall-exec-am:\n\ninstall-html: install-html-recursive\n\ninstall-html-am:\n\ninstall-info: install-info-recursive\n\ninstall-info-am:\n\ninstall-man:\n\ninstall-pdf: install-pdf-recursive\n\ninstall-pdf-am:\n\ninstall-ps: install-ps-recursive\n\ninstall-ps-am:\n\ninstallcheck-am:\n\nmaintainer-clean: maintainer-clean-recursive\n\t-rm -f $(am__CONFIG_DISTCLEAN_FILES)\n\t-rm -rf $(top_srcdir)/autom4te.cache\n\t-rm -f Makefile\nmaintainer-clean-am: distclean-am maintainer-clean-generic\n\nmostlyclean: mostlyclean-recursive\n\nmostlyclean-am: mostlyclean-generic mostlyclean-libtool\n\npdf: pdf-recursive\n\npdf-am:\n\nps: ps-recursive\n\nps-am:\n\nuninstall-am:\n\n.MAKE: $(am__recursive_targets) all install-am install-strip\n\n.PHONY: $(am__recursive_targets) CTAGS GTAGS TAGS all all-am \\\n\tam--refresh check check-am clean clean-cscope clean-generic \\\n\tclean-libtool cscope cscopelist-am ctags ctags-am dist \\\n\tdist-all dist-bzip2 dist-gzip dist-lzip dist-shar dist-tarZ \\\n\tdist-xz dist-zip distcheck distclean distclean-generic \\\n\tdistclean-hdr distclean-libtool distclean-tags distcleancheck \\\n\tdistdir distuninstallcheck dvi dvi-am html html-am info \\\n\tinfo-am install install-am install-data install-data-am \\\n\tinstall-dvi install-dvi-am install-exec install-exec-am \\\n\tinstall-html install-html-am install-info install-info-am \\\n\tinstall-man install-pdf install-pdf-am install-ps \\\n\tinstall-ps-am install-strip installcheck installcheck-am \\\n\tinstalldirs installdirs-am maintainer-clean \\\n\tmaintainer-clean-generic mostlyclean mostlyclean-generic \\\n\tmostlyclean-libtool pdf pdf-am ps ps-am tags tags-am uninstall \\\n\tuninstall-am\n\n\n# Tell versions [3.59,3.63) of GNU make to not export all variables.\n# Otherwise a system limit (for SysV at least) may be exceeded.\n.NOEXPORT:\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/NEWS",
    "content": "OpenFst: Release 1.6\n    * The `first_path` option to ShortestPath is now optimal for A* (1.6.7)\n    * Renames SymbolTable::kNoSymbol to kNoSymbol (1.6.7)\n    * Exposes PowerMapper to the scripting API (1.6.7)\n    * Fixes linking of the special SOs (1.6.7)\n    * Fixes error handling in HashMatcher (1.6.6)\n    * Adds kShortestDelta for operations dependent on shortest-distance (1.6.6)\n    * Adds Python methods for (un)pickling and (de)serializing FSTs (1.6.6)\n    * Adds constructive variants of Invert and Project (1.6.6)\n    * Increases code sharing in MemoryPool/MemoryArena (1.6.6)\n    * Improves consistency of matcher FST ownership (1.6.6)\n    * Adds non-trivial A* estimator class (1.6.6)\n    * Prevents unreachable code generation in libfstscript (1.6.5)\n    * Adds move constructors for non-trivial weight types (1.6.5)\n    * Standardizes method names for tuple weight types (1.6.5)\n    * Eliminates undefined behavior in weight hashing (1.6.5)\n    * Optimizes binary search in SortedMatcher (1.6.5)\n    * Adds SetWeight (1.6.5)\n    * Fixes typing error in Python FAR reader (1.6.4)\n    * Removes restriction that Prune argument have commutative weights (1.6.3)\n    * Improves configuration of CompositeWeight readers and writers (1.6.3)\n    * Improves accuracy of ShortestDistance summation (1.6.3)\n    * SetFinal now \"moves\" its weight argument (1.6.3)\n    * Exposes ArcIterator and EncodeMapper flags in Python (1.6.3)\n    * Properly sets return codes in FST binaries (1.6.3)\n    * Eliminates StringWeight macros (1.6.3)\n    * Finalizes most virtual method overrides (1.6.2)\n    * Fixes missing includes of <fst/log.h> (1.6.1)\n    * Adds float format support to FST drawing (1.6.1)\n    * Extensive modernization for C++11 style (1.6.0)\n    * Many classes and constants moved into an internal namespace (1.6.0)\n    * Adds HashMatcher (1.6.0)\n    * Adds Member method to SymbolTable (1.6.0)\n    * Adds the \"special\" extension and the fstspecial binary; this is similar to\n      fstconvert but accepts arguments for specifying special labels (phi, rho,\n      and sigma) of FSTs (1.6.0)\n    * Exposes allow_negative_label option for Python symbol tables (1.6.0)\n\nOpenFst: Release 1.5\n    * Added p-subsequential determinization (1.5.0)\n    * Generalized epsilon normalization to non-functional case (1.5.0)\n    * Added general gallic (plus is union) semiring (1.5.0)\n    * Added FST compression extension (1.5.0)\n    * Added Python extension (1.5.0)\n    * Added multiple pushdown transducer (MPDT) support (1.5.0)\n    * Fixed Isomorphic function (1.5.0)\n    * Added final method to matchers (1.5.0)\n    * Fixed various compiler issues (1.5.0)\n    * Fixed missing Isomorphic components (1.5.0)\n    * Added UnionWeight (1.5.0)\n    * Added InputEpsilonMapper and OutputEpsilonMapper arc mappers (1.5.1)\n    * Added TrivialComposeFilter for more efficient composition when one\n      of the arguments is epsilon-free (1.5.1)\n    * Added properties bits kUnweightedCycles and kWeightedCycles (1.5.1)\n    * Added missing const qualification to (1.5.1):\n      - SymbolTableIterator access\n      - EncodeMapper writing to file\n      - EncodeMapper SymbolTable access\n    * Replaced internal custom reference-counting (RefCounter) with\n      C++11 smart pointers where possible, and fixed associated\n      reference-counting bugs (1.5.1)\n    * When calling DeleteStates on a MutableFst with a shared impl, the impl\n      is set to a new empty impl rather than copying and deleting (1.5.1)\n    * Prepended `Pdt` to the Expand libraries and classes in the PDT\n      extension, and prepended `MPdt` to the Expand libraries and classes\n      in the MPDT extension, so that both can be used in the same compilation\n      unit (1.5.1)\n    * Added option to PDT Replace for compiling a strongly-regular RTN into a\n      bounded-stack PDT (1.5.1)\n    * Improved symbol table support for PDT Replace, including automatic\n      generation of parentheses symbols (1.5.1)\n    * Improvements to scripting API (1.5.1):\n      - Added methods for FST access and mutation\n      - Added additional checks for arc/weight compatibility\n      - WeightClass::One and WeightClass::Zero now require a specified weight\n        type at time of construction\n      - Improved VectorFstClass constructors\n      - Added linear-time check for cyclic dependencies in Replace\n      - Added EncodeMapperClass, a template-free box for an EncodeMapper\n    * Improvements to the binaries (1.5.1):\n      - Fixed no-op --precision flag to fstdraw (1.5.1)\n      - Fixed no-op --file_list_input flag to farcreate (1.5.1)\n    * Improvements to the Python extension (1.5.1):\n      - Added methods for creating an empty mutable FST\n      - Added methods for FST access via state and arc iteration\n      - Added FST compilation from arclists (cf. fstcompile)\n      - Added FST printing and drawing\n      - Added FarReader and FarWriter classes.\n    * FarReader's GetFst method now returns a pointer (1.5.2)\n    * Fixed FSTERROR macro (1.5.2)\n    * Fixed build flags for dlopen (1.5.2)\n    * Consolidated Python extension into single module (1.5.2)\n    * Python add_arc now takes an Arc object (1.5.2)\n    * Adds optional minimization of non-deterministic FSTs (1.5.3)\n    * Mutation methods of the Python Fst object now support chaining (1.5.3)\n    * Scripting API and Python weight objects now support semiring arithmetic\n      (1.5.3)\n    * Adds RemoveSymbol method to SymbolTable (1.5.4)\n    * Prevents underflow when using LogProbArcSelector in random generation\n      (1.5.4)\n    * Makes random weight generators a single template class (1.5.4)\n    * Makes weight Properties constexpr where possible (1.5.4)\n    * Adds check for error when opening files when compiling strings into FARs\n      (1.5.4)\n    * Adds routines for parsing string flags to the scripting API (1.5.4)\n\nOpenFst: Release 1.4\n    * Port to C++11 (1.4.0)\n    * Disambiguate function added (1.4.0)\n    * Isomorphic function added (1.4.0)\n    * Matcher interface augmented with Priority method.\n    * Special matchers (rho/sigma/phi) can match special symbols\n      on both input FSTs in composition/intersection provided at each\n      state pair they only match one side (1.4.0)\n    * Added ExplicitMatcher to suppress implicit matches (e.g. epsilon\n      self-loops) (1.4.0)\n    * Linear{Tagger,Classifier}Fst extensions added (1.4.0).\n    * Generalized state-reachable to work when input is cyclic (so long as no\n      final state is in a cycle). This ensures label-reachable (and hence label\n      lookahead) works with cyclic input (1.4.0)\n    * Added Condense to build the condensation graph (SCCs condensed to single\n      states) of an FST (1.4.0).\n    * Added an option to Reverse to specify whether a super-initial state\n      should always be created (1.4.0).\n    * Fixed bugs in FirstCacheStore, PowerWeight, and StringCompiler (1.4.0).\n    * Changed SymbolTable to use faster data structure (1.4.0).\n    * Added 'min' disambiguation in determinizaton to keep only the minimum\n      output in a non-functional transducer when plus=min/max\n      (flag --disambiguate_output) (1.4.1)\n    * Compiler issues in linear-fst fixed (1.4.1)\n\nOpenFst: Release 1.3\n    * Support for non-fatal exits on errors: (1.3.1)\n      - Added FLAGS_fst_error_fatal: FST errors are\n        fatal if true (default); o.w. return objects flagged as bad:\n        e.g., FSTs - kError\n        prop. true, FST weights - not a Member().\n      - Added kError property bit signifying bad FST\n      - Added  NoWeight() method to FST weight requirements that returns\n        weight that is not a Member().\n    * Various improvements to the FAR extensions (1.3.1)\n      - a single FST is now a FAR type\n      - FLAGS_initial_symbols: Uses the symbol table from the\n        first FST in the archive for all entries\"\n      - Input/output to standard input/output for some FAR and arc types\n    * --with-icu configuration option no longer needed (1.3.1)\n    * Improved flags usage esp. if use SET_FLAGS not SetFlags/InitFst (1.3.2)\n    * Added 'fst' as possible far writer type (1.3.2)\n    * phi matcher can now accept 0 as the phi label (1.3.2)\n    * Added ngram-fst extension (1.3.2)\n    * Improved performance of PDT composition (1.3.3)\n    * Memory-map support (1.3.3)\n    * Fixed cross-FST serialization issues (1.3.3)\n    * Fixed NGramFst off-by-one issue (1.3.3)\n    * farextract now allows one to specify a list of comma-separated keys,\n      including key ranges (1.3.3)\n    * Fixed bug in PDT replace that could cause close paren IDs to collide\n      with open paren IDs (1.3.4)\n\nOpenFst: Release 1.2\n    * Added lookahead matching and filtering for faster composition\n    * Added EditFst for mutation of o.w. immutable FSTs\n    * Added script sub-namespace defining type FstClass, a non-templated\n      Fst<Arc> to hold the arc template type internally. This and FST\n      operations on it allow easier I/O and scripting at the cost of some\n      runtime dispatching.\n    * Added per-arc-iterator control of Fst caching.\n    * Added PowerWeight and Power Arc.\n    * Added SparsePowerWeight and SparsePowerArc (1.2.4)\n    * Added SignedLogWeight and SignedLogArc (1.2.4)\n    * Added ExpectationWeight and ExpectationArc (1.2.4)\n    * Added AStarQueue, PruneQueue and NaturalPruneQueue disciplines (1.2.6)\n    * Added Log64Weight and Log64Arc to FST library throughout, including \n      support throughout scripts/bins/dsos (1.2.8)\n    * Added delayed RandGenFst that outputs tree of paths weighted\n      by count (1.2.8)\n    * Added fstsymbols shell-level command\n    * Added total weight removal option to pushing\n    * Changed methods for symbol table mutation:\n      use MutableInputSymbols()/MutableOutputSymbols().\n    * Numerous efficiency improvements esp in composition, replace, and caching\n    * Made \"fstmap\" handle semiring conversion by adding \"to_std\", \"to_log\"\n      and \"to_log64\" as supported 'map_type' arguments (1.2.8).\n    * Made the destructive implementation of RmEpsilon skip over states\n      admitting no non-epsilon incoming transition (1.2.8).\n    * Fixed numerous bugs (1.2 through 1.2.9) including:\n      - improper types of some approximation deltas\n      - sub-optimal hashing functions\n      - issues in internal reuse of shortest distance\n      - hashing bug in FloatWeight\n      - bug in shortest path queue\n      - symbol table checksumming issues\n      - various C++ standards issues\n      - Visit() behavior when visitation aborted\n      - Decode() hash performance bug (1.2.1)\n      - EditFst::Copy(bool) method when the boolean parameter is true (1.2.7)\n      - SymbolTable memory leak in Invert() (1.2.8)\n      - Added escaping of \" and \\ in labels in fstdraw, needed for dot to\n        function properly (1.2.8)\n      - Fixed handling of final weight of start state in fstpush (1.2.8)\n      - Added FST_LL_FORMAT to fix 64-bit integer printf issues (1.2.9)\n      - Fixed missing <functional> includes (1.2.9)\n      - Fixed reused local variable names (1.2.9)\n      - Fixed passing string by reference in FstDraw args (1.2.9)\n    * Added extensions directories including:\n      - finite-state archive (FAR) utilities,\n        added stlist format supporting writing/reading to/from standard out/in\n        at the library-level (1.2.8)\n      - compact fsts\n      - lookahead fsts\n      - pushdown transducers (improved in 1.2.1 through 1.2.7).\n    * Added StateMap/StateMapFst; renamed Map/MapFst to ArcMap/ArcMapFst;\n      map/MapFst retained (but deprecated) (1.2.9)\n    * Deleted ArcSum() and ArcMerge; use StateMap w/ ArcSumMapper and\n      ArcUniqueMapper (1.2.9).\n    * Incremented version of ConstFst/CompactFsts to stop memory alignment\n      that fails on pipes. Made old version raises errors when read on\n      pipes (1.2.9).\n    * Improved determinize hash (1.2.9)\n    * Removed stdio uses (1.2.10)\n    * Fixed library ordering issues esp. with newer GNU build tools (1.2.10)\n\nOpenFst: Release 1.1\n    * Added compat.h to src/include/fst to fix missing defines\n    * Fixed bug in acyclic minimization that led to non-minimal\n      (but equivalent) results\n    * Fixed missing FST typedef in various matchers in matcher.h\n      so that they can be cascaded\n    * Opened file streams binary where appropriate\n\nOpenFst: Release 1.0 (Additions to beta version):\n    * Matcher class added for matching labels at FST states. Includes\n      special matchers for sigma (any), rho ('rest'), and phi ('fail')\n      labels.\n    * Composition generalized with arbitrary filters, matchers, and state\n      tables.\n    * Sequence and matching composition filters provided. (see compose.h,\n      compose-filter.h, matcher.h, state-table.h)\n    * Unique n-best (see shortest-path.h)\n    * Pruning in determinization and epsilon removal (see determinize.h,\n      rmepsilon.h)\n    * New Fst class:\n       * Compact Fsts for space-efficient representation (see compact-fst.h)\n    * New Weight classes:\n       * MinMax\n       * Lexicographic\n    * Miscellaneous bug fixes\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/README",
    "content": "OpenFst: Release 1.6.7.\n\nOpenFst is a library for constructing, combining, optimizing, and searching\nweighted finite-state transducers (FSTs).\n\nREQUIREMENTS:\n  This version is known to work under Linux using g++ (>= 4.7) and OS X using\n  XCode (>= 5). It is expected to work wherever adequate POSIX (dlopen,\n  ssize_t, basename), C99 (snprintf, strtoll, <stdint.h>), and C++11\n  (<unordered_set>, <unordered_map>, <forward_list>) support is available.\n\nINSTALLATION:\n  Follow the generic GNU build system instructions in ./INSTALL. We\n  recommend configuring with --enable-static=no for faster compiles.\n\n  Optional features:\n\n  --enable-bin             Enable fst::script and executables (def: yes)\n  --enable-compact-fsts    Enable CompactFst extensions (def: no)\n  --enable-compress        Enable compression extension (def: no)\n  --enable-const-fsts      Enable ConstFst extensions (def: no)\n  --enable-far             Enable FAR extensions (def: no)\n  --enable-grm             Enable all dependencies of OpenGrm (def: no)\n  --enable-linear-fsts     Enable LinearTagger/ClassifierFst extensions (def: no)\n  --enable-lookahead-fsts  Enable LookAheadFst extensions (def: no)\n  --enable-mpdt            Enable MPDT extensions (def: no)\n  --enable-ngram-fsts      Enable NGramFst extensions (def: no)\n  --enable-pdt             Enable PDT extensions (def: no)\n  --enable-python          Enable Python extension (def: no)\n  --enable-special         Enable special-matcher extensions (def: no)\n\n  Configuring with --enable-bin=no gives very fast compiles, but excludes the\n  command line utilities.\n\n  Configuring with --enable-python will attempt to install the Python module to\n  whichever site-packages (or dist-packages, on Debian or Ubuntu) is found\n  during configuration.\n\n  The flag --with-libfstdir specifies where FST extensions should be installed;\n  it defaults to ${libdir}/fst.\n\n  Compiling with -Wall -Wno-sign-compare under g++ should give no warnings from\n  this library.\n\n  If you encounter an error about loading shared objects when attempting to use\n  the library immediately after installation, (e.g, `...cannot open shared\n  object file...`) you may need to refresh your system's shared object cache.\n  On Linux, this is accomplished by invoking ldconfig; the corresponding command\n  on OS X is called update_dyld_shared_cache. Both of these require superuser\n  privileges (and so should be executed with sudo).\n\nUSAGE:\n  Assuming you've installed under the default /usr/local, the FST binaries are\n  found on /usr/local/bin.\n\n  To use in your own program, include <fst/fstlib.h> and compile with \n  -I/usr/local/include. The compiler must support C++11 (for g++ add the flag\n  -std=c++11). Link against /usr/local/lib/libfst.so and -ldl. Set your\n  LD_LIBRARY_PATH (or equivalent) to contain /usr/local/lib. The linking is,\n  by default, dynamic so that the Fst and Arc type DSO extensions can be used\n  correctly if desired. Any extensions will be found under /usr/local/lib/fst\n  or /usr/local/include/fst/extensions.\n\nDOCUMENTATION:\n  See www.openfst.org for general documentation.\n  See ./NEWS for updates since the last release.\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/aclocal.m4",
    "content": "# generated automatically by aclocal 1.14.1 -*- Autoconf -*-\n\n# Copyright (C) 1996-2013 Free Software Foundation, Inc.\n\n# This file is free software; the Free Software Foundation\n# gives unlimited permission to copy and/or distribute it,\n# with or without modifications, as long as this notice is preserved.\n\n# This program is distributed in the hope that it will be useful,\n# but WITHOUT ANY WARRANTY, to the extent permitted by law; without\n# even the implied warranty of MERCHANTABILITY or FITNESS FOR A\n# PARTICULAR PURPOSE.\n\nm4_ifndef([AC_CONFIG_MACRO_DIRS], [m4_defun([_AM_CONFIG_MACRO_DIRS], [])m4_defun([AC_CONFIG_MACRO_DIRS], [_AM_CONFIG_MACRO_DIRS($@)])])\nm4_ifndef([AC_AUTOCONF_VERSION],\n  [m4_copy([m4_PACKAGE_VERSION], [AC_AUTOCONF_VERSION])])dnl\nm4_if(m4_defn([AC_AUTOCONF_VERSION]), [2.69],,\n[m4_warning([this file was generated for autoconf 2.69.\nYou have another version of autoconf.  It may work, but is not guaranteed to.\nIf you have problems, you may need to regenerate the build system entirely.\nTo do so, use the procedure documented by the package, typically 'autoreconf'.])])\n\n# Copyright (C) 2002-2013 Free Software Foundation, Inc.\n#\n# This file is free software; the Free Software Foundation\n# gives unlimited permission to copy and/or distribute it,\n# with or without modifications, as long as this notice is preserved.\n\n# AM_AUTOMAKE_VERSION(VERSION)\n# ----------------------------\n# Automake X.Y traces this macro to ensure aclocal.m4 has been\n# generated from the m4 files accompanying Automake X.Y.\n# (This private macro should not be called outside this file.)\nAC_DEFUN([AM_AUTOMAKE_VERSION],\n[am__api_version='1.14'\ndnl Some users find AM_AUTOMAKE_VERSION and mistake it for a way to\ndnl require some minimum version.  Point them to the right macro.\nm4_if([$1], [1.14.1], [],\n      [AC_FATAL([Do not call $0, use AM_INIT_AUTOMAKE([$1]).])])dnl\n])\n\n# _AM_AUTOCONF_VERSION(VERSION)\n# -----------------------------\n# aclocal traces this macro to find the Autoconf version.\n# This is a private macro too.  Using m4_define simplifies\n# the logic in aclocal, which can simply ignore this definition.\nm4_define([_AM_AUTOCONF_VERSION], [])\n\n# AM_SET_CURRENT_AUTOMAKE_VERSION\n# -------------------------------\n# Call AM_AUTOMAKE_VERSION and AM_AUTOMAKE_VERSION so they can be traced.\n# This function is AC_REQUIREd by AM_INIT_AUTOMAKE.\nAC_DEFUN([AM_SET_CURRENT_AUTOMAKE_VERSION],\n[AM_AUTOMAKE_VERSION([1.14.1])dnl\nm4_ifndef([AC_AUTOCONF_VERSION],\n  [m4_copy([m4_PACKAGE_VERSION], [AC_AUTOCONF_VERSION])])dnl\n_AM_AUTOCONF_VERSION(m4_defn([AC_AUTOCONF_VERSION]))])\n\n# Copyright (C) 2011-2013 Free Software Foundation, Inc.\n#\n# This file is free software; the Free Software Foundation\n# gives unlimited permission to copy and/or distribute it,\n# with or without modifications, as long as this notice is preserved.\n\n# AM_PROG_AR([ACT-IF-FAIL])\n# -------------------------\n# Try to determine the archiver interface, and trigger the ar-lib wrapper\n# if it is needed.  If the detection of archiver interface fails, run\n# ACT-IF-FAIL (default is to abort configure with a proper error message).\nAC_DEFUN([AM_PROG_AR],\n[AC_BEFORE([$0], [LT_INIT])dnl\nAC_BEFORE([$0], [AC_PROG_LIBTOOL])dnl\nAC_REQUIRE([AM_AUX_DIR_EXPAND])dnl\nAC_REQUIRE_AUX_FILE([ar-lib])dnl\nAC_CHECK_TOOLS([AR], [ar lib \"link -lib\"], [false])\n: ${AR=ar}\n\nAC_CACHE_CHECK([the archiver ($AR) interface], [am_cv_ar_interface],\n  [AC_LANG_PUSH([C])\n   am_cv_ar_interface=ar\n   AC_COMPILE_IFELSE([AC_LANG_SOURCE([[int some_variable = 0;]])],\n     [am_ar_try='$AR cru libconftest.a conftest.$ac_objext >&AS_MESSAGE_LOG_FD'\n      AC_TRY_EVAL([am_ar_try])\n      if test \"$ac_status\" -eq 0; then\n        am_cv_ar_interface=ar\n      else\n        am_ar_try='$AR -NOLOGO -OUT:conftest.lib conftest.$ac_objext >&AS_MESSAGE_LOG_FD'\n        AC_TRY_EVAL([am_ar_try])\n        if test \"$ac_status\" -eq 0; then\n          am_cv_ar_interface=lib\n        else\n          am_cv_ar_interface=unknown\n        fi\n      fi\n      rm -f conftest.lib libconftest.a\n     ])\n   AC_LANG_POP([C])])\n\ncase $am_cv_ar_interface in\nar)\n  ;;\nlib)\n  # Microsoft lib, so override with the ar-lib wrapper script.\n  # FIXME: It is wrong to rewrite AR.\n  # But if we don't then we get into trouble of one sort or another.\n  # A longer-term fix would be to have automake use am__AR in this case,\n  # and then we could set am__AR=\"$am_aux_dir/ar-lib \\$(AR)\" or something\n  # similar.\n  AR=\"$am_aux_dir/ar-lib $AR\"\n  ;;\nunknown)\n  m4_default([$1],\n             [AC_MSG_ERROR([could not determine $AR interface])])\n  ;;\nesac\nAC_SUBST([AR])dnl\n])\n\n# AM_AUX_DIR_EXPAND                                         -*- Autoconf -*-\n\n# Copyright (C) 2001-2013 Free Software Foundation, Inc.\n#\n# This file is free software; the Free Software Foundation\n# gives unlimited permission to copy and/or distribute it,\n# with or without modifications, as long as this notice is preserved.\n\n# For projects using AC_CONFIG_AUX_DIR([foo]), Autoconf sets\n# $ac_aux_dir to '$srcdir/foo'.  In other projects, it is set to\n# '$srcdir', '$srcdir/..', or '$srcdir/../..'.\n#\n# Of course, Automake must honor this variable whenever it calls a\n# tool from the auxiliary directory.  The problem is that $srcdir (and\n# therefore $ac_aux_dir as well) can be either absolute or relative,\n# depending on how configure is run.  This is pretty annoying, since\n# it makes $ac_aux_dir quite unusable in subdirectories: in the top\n# source directory, any form will work fine, but in subdirectories a\n# relative path needs to be adjusted first.\n#\n# $ac_aux_dir/missing\n#    fails when called from a subdirectory if $ac_aux_dir is relative\n# $top_srcdir/$ac_aux_dir/missing\n#    fails if $ac_aux_dir is absolute,\n#    fails when called from a subdirectory in a VPATH build with\n#          a relative $ac_aux_dir\n#\n# The reason of the latter failure is that $top_srcdir and $ac_aux_dir\n# are both prefixed by $srcdir.  In an in-source build this is usually\n# harmless because $srcdir is '.', but things will broke when you\n# start a VPATH build or use an absolute $srcdir.\n#\n# So we could use something similar to $top_srcdir/$ac_aux_dir/missing,\n# iff we strip the leading $srcdir from $ac_aux_dir.  That would be:\n#   am_aux_dir='\\$(top_srcdir)/'`expr \"$ac_aux_dir\" : \"$srcdir//*\\(.*\\)\"`\n# and then we would define $MISSING as\n#   MISSING=\"\\${SHELL} $am_aux_dir/missing\"\n# This will work as long as MISSING is not called from configure, because\n# unfortunately $(top_srcdir) has no meaning in configure.\n# However there are other variables, like CC, which are often used in\n# configure, and could therefore not use this \"fixed\" $ac_aux_dir.\n#\n# Another solution, used here, is to always expand $ac_aux_dir to an\n# absolute PATH.  The drawback is that using absolute paths prevent a\n# configured tree to be moved without reconfiguration.\n\nAC_DEFUN([AM_AUX_DIR_EXPAND],\n[dnl Rely on autoconf to set up CDPATH properly.\nAC_PREREQ([2.50])dnl\n# expand $ac_aux_dir to an absolute path\nam_aux_dir=`cd $ac_aux_dir && pwd`\n])\n\n# AM_CONDITIONAL                                            -*- Autoconf -*-\n\n# Copyright (C) 1997-2013 Free Software Foundation, Inc.\n#\n# This file is free software; the Free Software Foundation\n# gives unlimited permission to copy and/or distribute it,\n# with or without modifications, as long as this notice is preserved.\n\n# AM_CONDITIONAL(NAME, SHELL-CONDITION)\n# -------------------------------------\n# Define a conditional.\nAC_DEFUN([AM_CONDITIONAL],\n[AC_PREREQ([2.52])dnl\n m4_if([$1], [TRUE],  [AC_FATAL([$0: invalid condition: $1])],\n       [$1], [FALSE], [AC_FATAL([$0: invalid condition: $1])])dnl\nAC_SUBST([$1_TRUE])dnl\nAC_SUBST([$1_FALSE])dnl\n_AM_SUBST_NOTMAKE([$1_TRUE])dnl\n_AM_SUBST_NOTMAKE([$1_FALSE])dnl\nm4_define([_AM_COND_VALUE_$1], [$2])dnl\nif $2; then\n  $1_TRUE=\n  $1_FALSE='#'\nelse\n  $1_TRUE='#'\n  $1_FALSE=\nfi\nAC_CONFIG_COMMANDS_PRE(\n[if test -z \"${$1_TRUE}\" && test -z \"${$1_FALSE}\"; then\n  AC_MSG_ERROR([[conditional \"$1\" was never defined.\nUsually this means the macro was only invoked conditionally.]])\nfi])])\n\n# Copyright (C) 1999-2013 Free Software Foundation, Inc.\n#\n# This file is free software; the Free Software Foundation\n# gives unlimited permission to copy and/or distribute it,\n# with or without modifications, as long as this notice is preserved.\n\n\n# There are a few dirty hacks below to avoid letting 'AC_PROG_CC' be\n# written in clear, in which case automake, when reading aclocal.m4,\n# will think it sees a *use*, and therefore will trigger all it's\n# C support machinery.  Also note that it means that autoscan, seeing\n# CC etc. in the Makefile, will ask for an AC_PROG_CC use...\n\n\n# _AM_DEPENDENCIES(NAME)\n# ----------------------\n# See how the compiler implements dependency checking.\n# NAME is \"CC\", \"CXX\", \"OBJC\", \"OBJCXX\", \"UPC\", or \"GJC\".\n# We try a few techniques and use that to set a single cache variable.\n#\n# We don't AC_REQUIRE the corresponding AC_PROG_CC since the latter was\n# modified to invoke _AM_DEPENDENCIES(CC); we would have a circular\n# dependency, and given that the user is not expected to run this macro,\n# just rely on AC_PROG_CC.\nAC_DEFUN([_AM_DEPENDENCIES],\n[AC_REQUIRE([AM_SET_DEPDIR])dnl\nAC_REQUIRE([AM_OUTPUT_DEPENDENCY_COMMANDS])dnl\nAC_REQUIRE([AM_MAKE_INCLUDE])dnl\nAC_REQUIRE([AM_DEP_TRACK])dnl\n\nm4_if([$1], [CC],   [depcc=\"$CC\"   am_compiler_list=],\n      [$1], [CXX],  [depcc=\"$CXX\"  am_compiler_list=],\n      [$1], [OBJC], [depcc=\"$OBJC\" am_compiler_list='gcc3 gcc'],\n      [$1], [OBJCXX], [depcc=\"$OBJCXX\" am_compiler_list='gcc3 gcc'],\n      [$1], [UPC],  [depcc=\"$UPC\"  am_compiler_list=],\n      [$1], [GCJ],  [depcc=\"$GCJ\"  am_compiler_list='gcc3 gcc'],\n                    [depcc=\"$$1\"   am_compiler_list=])\n\nAC_CACHE_CHECK([dependency style of $depcc],\n               [am_cv_$1_dependencies_compiler_type],\n[if test -z \"$AMDEP_TRUE\" && test -f \"$am_depcomp\"; then\n  # We make a subdir and do the tests there.  Otherwise we can end up\n  # making bogus files that we don't know about and never remove.  For\n  # instance it was reported that on HP-UX the gcc test will end up\n  # making a dummy file named 'D' -- because '-MD' means \"put the output\n  # in D\".\n  rm -rf conftest.dir\n  mkdir conftest.dir\n  # Copy depcomp to subdir because otherwise we won't find it if we're\n  # using a relative directory.\n  cp \"$am_depcomp\" conftest.dir\n  cd conftest.dir\n  # We will build objects and dependencies in a subdirectory because\n  # it helps to detect inapplicable dependency modes.  For instance\n  # both Tru64's cc and ICC support -MD to output dependencies as a\n  # side effect of compilation, but ICC will put the dependencies in\n  # the current directory while Tru64 will put them in the object\n  # directory.\n  mkdir sub\n\n  am_cv_$1_dependencies_compiler_type=none\n  if test \"$am_compiler_list\" = \"\"; then\n     am_compiler_list=`sed -n ['s/^#*\\([a-zA-Z0-9]*\\))$/\\1/p'] < ./depcomp`\n  fi\n  am__universal=false\n  m4_case([$1], [CC],\n    [case \" $depcc \" in #(\n     *\\ -arch\\ *\\ -arch\\ *) am__universal=true ;;\n     esac],\n    [CXX],\n    [case \" $depcc \" in #(\n     *\\ -arch\\ *\\ -arch\\ *) am__universal=true ;;\n     esac])\n\n  for depmode in $am_compiler_list; do\n    # Setup a source with many dependencies, because some compilers\n    # like to wrap large dependency lists on column 80 (with \\), and\n    # we should not choose a depcomp mode which is confused by this.\n    #\n    # We need to recreate these files for each test, as the compiler may\n    # overwrite some of them when testing with obscure command lines.\n    # This happens at least with the AIX C compiler.\n    : > sub/conftest.c\n    for i in 1 2 3 4 5 6; do\n      echo '#include \"conftst'$i'.h\"' >> sub/conftest.c\n      # Using \": > sub/conftst$i.h\" creates only sub/conftst1.h with\n      # Solaris 10 /bin/sh.\n      echo '/* dummy */' > sub/conftst$i.h\n    done\n    echo \"${am__include} ${am__quote}sub/conftest.Po${am__quote}\" > confmf\n\n    # We check with '-c' and '-o' for the sake of the \"dashmstdout\"\n    # mode.  It turns out that the SunPro C++ compiler does not properly\n    # handle '-M -o', and we need to detect this.  Also, some Intel\n    # versions had trouble with output in subdirs.\n    am__obj=sub/conftest.${OBJEXT-o}\n    am__minus_obj=\"-o $am__obj\"\n    case $depmode in\n    gcc)\n      # This depmode causes a compiler race in universal mode.\n      test \"$am__universal\" = false || continue\n      ;;\n    nosideeffect)\n      # After this tag, mechanisms are not by side-effect, so they'll\n      # only be used when explicitly requested.\n      if test \"x$enable_dependency_tracking\" = xyes; then\n\tcontinue\n      else\n\tbreak\n      fi\n      ;;\n    msvc7 | msvc7msys | msvisualcpp | msvcmsys)\n      # This compiler won't grok '-c -o', but also, the minuso test has\n      # not run yet.  These depmodes are late enough in the game, and\n      # so weak that their functioning should not be impacted.\n      am__obj=conftest.${OBJEXT-o}\n      am__minus_obj=\n      ;;\n    none) break ;;\n    esac\n    if depmode=$depmode \\\n       source=sub/conftest.c object=$am__obj \\\n       depfile=sub/conftest.Po tmpdepfile=sub/conftest.TPo \\\n       $SHELL ./depcomp $depcc -c $am__minus_obj sub/conftest.c \\\n         >/dev/null 2>conftest.err &&\n       grep sub/conftst1.h sub/conftest.Po > /dev/null 2>&1 &&\n       grep sub/conftst6.h sub/conftest.Po > /dev/null 2>&1 &&\n       grep $am__obj sub/conftest.Po > /dev/null 2>&1 &&\n       ${MAKE-make} -s -f confmf > /dev/null 2>&1; then\n      # icc doesn't choke on unknown options, it will just issue warnings\n      # or remarks (even with -Werror).  So we grep stderr for any message\n      # that says an option was ignored or not supported.\n      # When given -MP, icc 7.0 and 7.1 complain thusly:\n      #   icc: Command line warning: ignoring option '-M'; no argument required\n      # The diagnosis changed in icc 8.0:\n      #   icc: Command line remark: option '-MP' not supported\n      if (grep 'ignoring option' conftest.err ||\n          grep 'not supported' conftest.err) >/dev/null 2>&1; then :; else\n        am_cv_$1_dependencies_compiler_type=$depmode\n        break\n      fi\n    fi\n  done\n\n  cd ..\n  rm -rf conftest.dir\nelse\n  am_cv_$1_dependencies_compiler_type=none\nfi\n])\nAC_SUBST([$1DEPMODE], [depmode=$am_cv_$1_dependencies_compiler_type])\nAM_CONDITIONAL([am__fastdep$1], [\n  test \"x$enable_dependency_tracking\" != xno \\\n  && test \"$am_cv_$1_dependencies_compiler_type\" = gcc3])\n])\n\n\n# AM_SET_DEPDIR\n# -------------\n# Choose a directory name for dependency files.\n# This macro is AC_REQUIREd in _AM_DEPENDENCIES.\nAC_DEFUN([AM_SET_DEPDIR],\n[AC_REQUIRE([AM_SET_LEADING_DOT])dnl\nAC_SUBST([DEPDIR], [\"${am__leading_dot}deps\"])dnl\n])\n\n\n# AM_DEP_TRACK\n# ------------\nAC_DEFUN([AM_DEP_TRACK],\n[AC_ARG_ENABLE([dependency-tracking], [dnl\nAS_HELP_STRING(\n  [--enable-dependency-tracking],\n  [do not reject slow dependency extractors])\nAS_HELP_STRING(\n  [--disable-dependency-tracking],\n  [speeds up one-time build])])\nif test \"x$enable_dependency_tracking\" != xno; then\n  am_depcomp=\"$ac_aux_dir/depcomp\"\n  AMDEPBACKSLASH='\\'\n  am__nodep='_no'\nfi\nAM_CONDITIONAL([AMDEP], [test \"x$enable_dependency_tracking\" != xno])\nAC_SUBST([AMDEPBACKSLASH])dnl\n_AM_SUBST_NOTMAKE([AMDEPBACKSLASH])dnl\nAC_SUBST([am__nodep])dnl\n_AM_SUBST_NOTMAKE([am__nodep])dnl\n])\n\n# Generate code to set up dependency tracking.              -*- Autoconf -*-\n\n# Copyright (C) 1999-2013 Free Software Foundation, Inc.\n#\n# This file is free software; the Free Software Foundation\n# gives unlimited permission to copy and/or distribute it,\n# with or without modifications, as long as this notice is preserved.\n\n\n# _AM_OUTPUT_DEPENDENCY_COMMANDS\n# ------------------------------\nAC_DEFUN([_AM_OUTPUT_DEPENDENCY_COMMANDS],\n[{\n  # Older Autoconf quotes --file arguments for eval, but not when files\n  # are listed without --file.  Let's play safe and only enable the eval\n  # if we detect the quoting.\n  case $CONFIG_FILES in\n  *\\'*) eval set x \"$CONFIG_FILES\" ;;\n  *)   set x $CONFIG_FILES ;;\n  esac\n  shift\n  for mf\n  do\n    # Strip MF so we end up with the name of the file.\n    mf=`echo \"$mf\" | sed -e 's/:.*$//'`\n    # Check whether this is an Automake generated Makefile or not.\n    # We used to match only the files named 'Makefile.in', but\n    # some people rename them; so instead we look at the file content.\n    # Grep'ing the first line is not enough: some people post-process\n    # each Makefile.in and add a new line on top of each file to say so.\n    # Grep'ing the whole file is not good either: AIX grep has a line\n    # limit of 2048, but all sed's we know have understand at least 4000.\n    if sed -n 's,^#.*generated by automake.*,X,p' \"$mf\" | grep X >/dev/null 2>&1; then\n      dirpart=`AS_DIRNAME(\"$mf\")`\n    else\n      continue\n    fi\n    # Extract the definition of DEPDIR, am__include, and am__quote\n    # from the Makefile without running 'make'.\n    DEPDIR=`sed -n 's/^DEPDIR = //p' < \"$mf\"`\n    test -z \"$DEPDIR\" && continue\n    am__include=`sed -n 's/^am__include = //p' < \"$mf\"`\n    test -z \"$am__include\" && continue\n    am__quote=`sed -n 's/^am__quote = //p' < \"$mf\"`\n    # Find all dependency output files, they are included files with\n    # $(DEPDIR) in their names.  We invoke sed twice because it is the\n    # simplest approach to changing $(DEPDIR) to its actual value in the\n    # expansion.\n    for file in `sed -n \"\n      s/^$am__include $am__quote\\(.*(DEPDIR).*\\)$am__quote\"'$/\\1/p' <\"$mf\" | \\\n\t sed -e 's/\\$(DEPDIR)/'\"$DEPDIR\"'/g'`; do\n      # Make sure the directory exists.\n      test -f \"$dirpart/$file\" && continue\n      fdir=`AS_DIRNAME([\"$file\"])`\n      AS_MKDIR_P([$dirpart/$fdir])\n      # echo \"creating $dirpart/$file\"\n      echo '# dummy' > \"$dirpart/$file\"\n    done\n  done\n}\n])# _AM_OUTPUT_DEPENDENCY_COMMANDS\n\n\n# AM_OUTPUT_DEPENDENCY_COMMANDS\n# -----------------------------\n# This macro should only be invoked once -- use via AC_REQUIRE.\n#\n# This code is only required when automatic dependency tracking\n# is enabled.  FIXME.  This creates each '.P' file that we will\n# need in order to bootstrap the dependency handling code.\nAC_DEFUN([AM_OUTPUT_DEPENDENCY_COMMANDS],\n[AC_CONFIG_COMMANDS([depfiles],\n     [test x\"$AMDEP_TRUE\" != x\"\" || _AM_OUTPUT_DEPENDENCY_COMMANDS],\n     [AMDEP_TRUE=\"$AMDEP_TRUE\" ac_aux_dir=\"$ac_aux_dir\"])\n])\n\n# Do all the work for Automake.                             -*- Autoconf -*-\n\n# Copyright (C) 1996-2013 Free Software Foundation, Inc.\n#\n# This file is free software; the Free Software Foundation\n# gives unlimited permission to copy and/or distribute it,\n# with or without modifications, as long as this notice is preserved.\n\n# This macro actually does too much.  Some checks are only needed if\n# your package does certain things.  But this isn't really a big deal.\n\ndnl Redefine AC_PROG_CC to automatically invoke _AM_PROG_CC_C_O.\nm4_define([AC_PROG_CC],\nm4_defn([AC_PROG_CC])\n[_AM_PROG_CC_C_O\n])\n\n# AM_INIT_AUTOMAKE(PACKAGE, VERSION, [NO-DEFINE])\n# AM_INIT_AUTOMAKE([OPTIONS])\n# -----------------------------------------------\n# The call with PACKAGE and VERSION arguments is the old style\n# call (pre autoconf-2.50), which is being phased out.  PACKAGE\n# and VERSION should now be passed to AC_INIT and removed from\n# the call to AM_INIT_AUTOMAKE.\n# We support both call styles for the transition.  After\n# the next Automake release, Autoconf can make the AC_INIT\n# arguments mandatory, and then we can depend on a new Autoconf\n# release and drop the old call support.\nAC_DEFUN([AM_INIT_AUTOMAKE],\n[AC_PREREQ([2.65])dnl\ndnl Autoconf wants to disallow AM_ names.  We explicitly allow\ndnl the ones we care about.\nm4_pattern_allow([^AM_[A-Z]+FLAGS$])dnl\nAC_REQUIRE([AM_SET_CURRENT_AUTOMAKE_VERSION])dnl\nAC_REQUIRE([AC_PROG_INSTALL])dnl\nif test \"`cd $srcdir && pwd`\" != \"`pwd`\"; then\n  # Use -I$(srcdir) only when $(srcdir) != ., so that make's output\n  # is not polluted with repeated \"-I.\"\n  AC_SUBST([am__isrc], [' -I$(srcdir)'])_AM_SUBST_NOTMAKE([am__isrc])dnl\n  # test to see if srcdir already configured\n  if test -f $srcdir/config.status; then\n    AC_MSG_ERROR([source directory already configured; run \"make distclean\" there first])\n  fi\nfi\n\n# test whether we have cygpath\nif test -z \"$CYGPATH_W\"; then\n  if (cygpath --version) >/dev/null 2>/dev/null; then\n    CYGPATH_W='cygpath -w'\n  else\n    CYGPATH_W=echo\n  fi\nfi\nAC_SUBST([CYGPATH_W])\n\n# Define the identity of the package.\ndnl Distinguish between old-style and new-style calls.\nm4_ifval([$2],\n[AC_DIAGNOSE([obsolete],\n             [$0: two- and three-arguments forms are deprecated.])\nm4_ifval([$3], [_AM_SET_OPTION([no-define])])dnl\n AC_SUBST([PACKAGE], [$1])dnl\n AC_SUBST([VERSION], [$2])],\n[_AM_SET_OPTIONS([$1])dnl\ndnl Diagnose old-style AC_INIT with new-style AM_AUTOMAKE_INIT.\nm4_if(\n  m4_ifdef([AC_PACKAGE_NAME], [ok]):m4_ifdef([AC_PACKAGE_VERSION], [ok]),\n  [ok:ok],,\n  [m4_fatal([AC_INIT should be called with package and version arguments])])dnl\n AC_SUBST([PACKAGE], ['AC_PACKAGE_TARNAME'])dnl\n AC_SUBST([VERSION], ['AC_PACKAGE_VERSION'])])dnl\n\n_AM_IF_OPTION([no-define],,\n[AC_DEFINE_UNQUOTED([PACKAGE], [\"$PACKAGE\"], [Name of package])\n AC_DEFINE_UNQUOTED([VERSION], [\"$VERSION\"], [Version number of package])])dnl\n\n# Some tools Automake needs.\nAC_REQUIRE([AM_SANITY_CHECK])dnl\nAC_REQUIRE([AC_ARG_PROGRAM])dnl\nAM_MISSING_PROG([ACLOCAL], [aclocal-${am__api_version}])\nAM_MISSING_PROG([AUTOCONF], [autoconf])\nAM_MISSING_PROG([AUTOMAKE], [automake-${am__api_version}])\nAM_MISSING_PROG([AUTOHEADER], [autoheader])\nAM_MISSING_PROG([MAKEINFO], [makeinfo])\nAC_REQUIRE([AM_PROG_INSTALL_SH])dnl\nAC_REQUIRE([AM_PROG_INSTALL_STRIP])dnl\nAC_REQUIRE([AC_PROG_MKDIR_P])dnl\n# For better backward compatibility.  To be removed once Automake 1.9.x\n# dies out for good.  For more background, see:\n# <http://lists.gnu.org/archive/html/automake/2012-07/msg00001.html>\n# <http://lists.gnu.org/archive/html/automake/2012-07/msg00014.html>\nAC_SUBST([mkdir_p], ['$(MKDIR_P)'])\n# We need awk for the \"check\" target.  The system \"awk\" is bad on\n# some platforms.\nAC_REQUIRE([AC_PROG_AWK])dnl\nAC_REQUIRE([AC_PROG_MAKE_SET])dnl\nAC_REQUIRE([AM_SET_LEADING_DOT])dnl\n_AM_IF_OPTION([tar-ustar], [_AM_PROG_TAR([ustar])],\n\t      [_AM_IF_OPTION([tar-pax], [_AM_PROG_TAR([pax])],\n\t\t\t     [_AM_PROG_TAR([v7])])])\n_AM_IF_OPTION([no-dependencies],,\n[AC_PROVIDE_IFELSE([AC_PROG_CC],\n\t\t  [_AM_DEPENDENCIES([CC])],\n\t\t  [m4_define([AC_PROG_CC],\n\t\t\t     m4_defn([AC_PROG_CC])[_AM_DEPENDENCIES([CC])])])dnl\nAC_PROVIDE_IFELSE([AC_PROG_CXX],\n\t\t  [_AM_DEPENDENCIES([CXX])],\n\t\t  [m4_define([AC_PROG_CXX],\n\t\t\t     m4_defn([AC_PROG_CXX])[_AM_DEPENDENCIES([CXX])])])dnl\nAC_PROVIDE_IFELSE([AC_PROG_OBJC],\n\t\t  [_AM_DEPENDENCIES([OBJC])],\n\t\t  [m4_define([AC_PROG_OBJC],\n\t\t\t     m4_defn([AC_PROG_OBJC])[_AM_DEPENDENCIES([OBJC])])])dnl\nAC_PROVIDE_IFELSE([AC_PROG_OBJCXX],\n\t\t  [_AM_DEPENDENCIES([OBJCXX])],\n\t\t  [m4_define([AC_PROG_OBJCXX],\n\t\t\t     m4_defn([AC_PROG_OBJCXX])[_AM_DEPENDENCIES([OBJCXX])])])dnl\n])\nAC_REQUIRE([AM_SILENT_RULES])dnl\ndnl The testsuite driver may need to know about EXEEXT, so add the\ndnl 'am__EXEEXT' conditional if _AM_COMPILER_EXEEXT was seen.  This\ndnl macro is hooked onto _AC_COMPILER_EXEEXT early, see below.\nAC_CONFIG_COMMANDS_PRE(dnl\n[m4_provide_if([_AM_COMPILER_EXEEXT],\n  [AM_CONDITIONAL([am__EXEEXT], [test -n \"$EXEEXT\"])])])dnl\n\n# POSIX will say in a future version that running \"rm -f\" with no argument\n# is OK; and we want to be able to make that assumption in our Makefile\n# recipes.  So use an aggressive probe to check that the usage we want is\n# actually supported \"in the wild\" to an acceptable degree.\n# See automake bug#10828.\n# To make any issue more visible, cause the running configure to be aborted\n# by default if the 'rm' program in use doesn't match our expectations; the\n# user can still override this though.\nif rm -f && rm -fr && rm -rf; then : OK; else\n  cat >&2 <<'END'\nOops!\n\nYour 'rm' program seems unable to run without file operands specified\non the command line, even when the '-f' option is present.  This is contrary\nto the behaviour of most rm programs out there, and not conforming with\nthe upcoming POSIX standard: <http://austingroupbugs.net/view.php?id=542>\n\nPlease tell bug-automake@gnu.org about your system, including the value\nof your $PATH and any error possibly output before this message.  This\ncan help us improve future automake versions.\n\nEND\n  if test x\"$ACCEPT_INFERIOR_RM_PROGRAM\" = x\"yes\"; then\n    echo 'Configuration will proceed anyway, since you have set the' >&2\n    echo 'ACCEPT_INFERIOR_RM_PROGRAM variable to \"yes\"' >&2\n    echo >&2\n  else\n    cat >&2 <<'END'\nAborting the configuration process, to ensure you take notice of the issue.\n\nYou can download and install GNU coreutils to get an 'rm' implementation\nthat behaves properly: <http://www.gnu.org/software/coreutils/>.\n\nIf you want to complete the configuration process using your problematic\n'rm' anyway, export the environment variable ACCEPT_INFERIOR_RM_PROGRAM\nto \"yes\", and re-run configure.\n\nEND\n    AC_MSG_ERROR([Your 'rm' program is bad, sorry.])\n  fi\nfi])\n\ndnl Hook into '_AC_COMPILER_EXEEXT' early to learn its expansion.  Do not\ndnl add the conditional right here, as _AC_COMPILER_EXEEXT may be further\ndnl mangled by Autoconf and run in a shell conditional statement.\nm4_define([_AC_COMPILER_EXEEXT],\nm4_defn([_AC_COMPILER_EXEEXT])[m4_provide([_AM_COMPILER_EXEEXT])])\n\n# When config.status generates a header, we must update the stamp-h file.\n# This file resides in the same directory as the config header\n# that is generated.  The stamp files are numbered to have different names.\n\n# Autoconf calls _AC_AM_CONFIG_HEADER_HOOK (when defined) in the\n# loop where config.status creates the headers, so we can generate\n# our stamp files there.\nAC_DEFUN([_AC_AM_CONFIG_HEADER_HOOK],\n[# Compute $1's index in $config_headers.\n_am_arg=$1\n_am_stamp_count=1\nfor _am_header in $config_headers :; do\n  case $_am_header in\n    $_am_arg | $_am_arg:* )\n      break ;;\n    * )\n      _am_stamp_count=`expr $_am_stamp_count + 1` ;;\n  esac\ndone\necho \"timestamp for $_am_arg\" >`AS_DIRNAME([\"$_am_arg\"])`/stamp-h[]$_am_stamp_count])\n\n# Copyright (C) 2001-2013 Free Software Foundation, Inc.\n#\n# This file is free software; the Free Software Foundation\n# gives unlimited permission to copy and/or distribute it,\n# with or without modifications, as long as this notice is preserved.\n\n# AM_PROG_INSTALL_SH\n# ------------------\n# Define $install_sh.\nAC_DEFUN([AM_PROG_INSTALL_SH],\n[AC_REQUIRE([AM_AUX_DIR_EXPAND])dnl\nif test x\"${install_sh}\" != xset; then\n  case $am_aux_dir in\n  *\\ * | *\\\t*)\n    install_sh=\"\\${SHELL} '$am_aux_dir/install-sh'\" ;;\n  *)\n    install_sh=\"\\${SHELL} $am_aux_dir/install-sh\"\n  esac\nfi\nAC_SUBST([install_sh])])\n\n# Copyright (C) 2003-2013 Free Software Foundation, Inc.\n#\n# This file is free software; the Free Software Foundation\n# gives unlimited permission to copy and/or distribute it,\n# with or without modifications, as long as this notice is preserved.\n\n# Check whether the underlying file-system supports filenames\n# with a leading dot.  For instance MS-DOS doesn't.\nAC_DEFUN([AM_SET_LEADING_DOT],\n[rm -rf .tst 2>/dev/null\nmkdir .tst 2>/dev/null\nif test -d .tst; then\n  am__leading_dot=.\nelse\n  am__leading_dot=_\nfi\nrmdir .tst 2>/dev/null\nAC_SUBST([am__leading_dot])])\n\n# Check to see how 'make' treats includes.\t            -*- Autoconf -*-\n\n# Copyright (C) 2001-2013 Free Software Foundation, Inc.\n#\n# This file is free software; the Free Software Foundation\n# gives unlimited permission to copy and/or distribute it,\n# with or without modifications, as long as this notice is preserved.\n\n# AM_MAKE_INCLUDE()\n# -----------------\n# Check to see how make treats includes.\nAC_DEFUN([AM_MAKE_INCLUDE],\n[am_make=${MAKE-make}\ncat > confinc << 'END'\nam__doit:\n\t@echo this is the am__doit target\n.PHONY: am__doit\nEND\n# If we don't find an include directive, just comment out the code.\nAC_MSG_CHECKING([for style of include used by $am_make])\nam__include=\"#\"\nam__quote=\n_am_result=none\n# First try GNU make style include.\necho \"include confinc\" > confmf\n# Ignore all kinds of additional output from 'make'.\ncase `$am_make -s -f confmf 2> /dev/null` in #(\n*the\\ am__doit\\ target*)\n  am__include=include\n  am__quote=\n  _am_result=GNU\n  ;;\nesac\n# Now try BSD make style include.\nif test \"$am__include\" = \"#\"; then\n   echo '.include \"confinc\"' > confmf\n   case `$am_make -s -f confmf 2> /dev/null` in #(\n   *the\\ am__doit\\ target*)\n     am__include=.include\n     am__quote=\"\\\"\"\n     _am_result=BSD\n     ;;\n   esac\nfi\nAC_SUBST([am__include])\nAC_SUBST([am__quote])\nAC_MSG_RESULT([$_am_result])\nrm -f confinc confmf\n])\n\n# Fake the existence of programs that GNU maintainers use.  -*- Autoconf -*-\n\n# Copyright (C) 1997-2013 Free Software Foundation, Inc.\n#\n# This file is free software; the Free Software Foundation\n# gives unlimited permission to copy and/or distribute it,\n# with or without modifications, as long as this notice is preserved.\n\n# AM_MISSING_PROG(NAME, PROGRAM)\n# ------------------------------\nAC_DEFUN([AM_MISSING_PROG],\n[AC_REQUIRE([AM_MISSING_HAS_RUN])\n$1=${$1-\"${am_missing_run}$2\"}\nAC_SUBST($1)])\n\n# AM_MISSING_HAS_RUN\n# ------------------\n# Define MISSING if not defined so far and test if it is modern enough.\n# If it is, set am_missing_run to use it, otherwise, to nothing.\nAC_DEFUN([AM_MISSING_HAS_RUN],\n[AC_REQUIRE([AM_AUX_DIR_EXPAND])dnl\nAC_REQUIRE_AUX_FILE([missing])dnl\nif test x\"${MISSING+set}\" != xset; then\n  case $am_aux_dir in\n  *\\ * | *\\\t*)\n    MISSING=\"\\${SHELL} \\\"$am_aux_dir/missing\\\"\" ;;\n  *)\n    MISSING=\"\\${SHELL} $am_aux_dir/missing\" ;;\n  esac\nfi\n# Use eval to expand $SHELL\nif eval \"$MISSING --is-lightweight\"; then\n  am_missing_run=\"$MISSING \"\nelse\n  am_missing_run=\n  AC_MSG_WARN(['missing' script is too old or missing])\nfi\n])\n\n# Helper functions for option handling.                     -*- Autoconf -*-\n\n# Copyright (C) 2001-2013 Free Software Foundation, Inc.\n#\n# This file is free software; the Free Software Foundation\n# gives unlimited permission to copy and/or distribute it,\n# with or without modifications, as long as this notice is preserved.\n\n# _AM_MANGLE_OPTION(NAME)\n# -----------------------\nAC_DEFUN([_AM_MANGLE_OPTION],\n[[_AM_OPTION_]m4_bpatsubst($1, [[^a-zA-Z0-9_]], [_])])\n\n# _AM_SET_OPTION(NAME)\n# --------------------\n# Set option NAME.  Presently that only means defining a flag for this option.\nAC_DEFUN([_AM_SET_OPTION],\n[m4_define(_AM_MANGLE_OPTION([$1]), [1])])\n\n# _AM_SET_OPTIONS(OPTIONS)\n# ------------------------\n# OPTIONS is a space-separated list of Automake options.\nAC_DEFUN([_AM_SET_OPTIONS],\n[m4_foreach_w([_AM_Option], [$1], [_AM_SET_OPTION(_AM_Option)])])\n\n# _AM_IF_OPTION(OPTION, IF-SET, [IF-NOT-SET])\n# -------------------------------------------\n# Execute IF-SET if OPTION is set, IF-NOT-SET otherwise.\nAC_DEFUN([_AM_IF_OPTION],\n[m4_ifset(_AM_MANGLE_OPTION([$1]), [$2], [$3])])\n\n# Copyright (C) 1999-2013 Free Software Foundation, Inc.\n#\n# This file is free software; the Free Software Foundation\n# gives unlimited permission to copy and/or distribute it,\n# with or without modifications, as long as this notice is preserved.\n\n# _AM_PROG_CC_C_O\n# ---------------\n# Like AC_PROG_CC_C_O, but changed for automake.  We rewrite AC_PROG_CC\n# to automatically call this.\nAC_DEFUN([_AM_PROG_CC_C_O],\n[AC_REQUIRE([AM_AUX_DIR_EXPAND])dnl\nAC_REQUIRE_AUX_FILE([compile])dnl\nAC_LANG_PUSH([C])dnl\nAC_CACHE_CHECK(\n  [whether $CC understands -c and -o together],\n  [am_cv_prog_cc_c_o],\n  [AC_LANG_CONFTEST([AC_LANG_PROGRAM([])])\n  # Make sure it works both with $CC and with simple cc.\n  # Following AC_PROG_CC_C_O, we do the test twice because some\n  # compilers refuse to overwrite an existing .o file with -o,\n  # though they will create one.\n  am_cv_prog_cc_c_o=yes\n  for am_i in 1 2; do\n    if AM_RUN_LOG([$CC -c conftest.$ac_ext -o conftest2.$ac_objext]) \\\n         && test -f conftest2.$ac_objext; then\n      : OK\n    else\n      am_cv_prog_cc_c_o=no\n      break\n    fi\n  done\n  rm -f core conftest*\n  unset am_i])\nif test \"$am_cv_prog_cc_c_o\" != yes; then\n   # Losing compiler, so override with the script.\n   # FIXME: It is wrong to rewrite CC.\n   # But if we don't then we get into trouble of one sort or another.\n   # A longer-term fix would be to have automake use am__CC in this case,\n   # and then we could set am__CC=\"\\$(top_srcdir)/compile \\$(CC)\"\n   CC=\"$am_aux_dir/compile $CC\"\nfi\nAC_LANG_POP([C])])\n\n# For backward compatibility.\nAC_DEFUN_ONCE([AM_PROG_CC_C_O], [AC_REQUIRE([AC_PROG_CC])])\n\n# Copyright (C) 1999-2013 Free Software Foundation, Inc.\n#\n# This file is free software; the Free Software Foundation\n# gives unlimited permission to copy and/or distribute it,\n# with or without modifications, as long as this notice is preserved.\n\n\n# AM_PATH_PYTHON([MINIMUM-VERSION], [ACTION-IF-FOUND], [ACTION-IF-NOT-FOUND])\n# ---------------------------------------------------------------------------\n# Adds support for distributing Python modules and packages.  To\n# install modules, copy them to $(pythondir), using the python_PYTHON\n# automake variable.  To install a package with the same name as the\n# automake package, install to $(pkgpythondir), or use the\n# pkgpython_PYTHON automake variable.\n#\n# The variables $(pyexecdir) and $(pkgpyexecdir) are provided as\n# locations to install python extension modules (shared libraries).\n# Another macro is required to find the appropriate flags to compile\n# extension modules.\n#\n# If your package is configured with a different prefix to python,\n# users will have to add the install directory to the PYTHONPATH\n# environment variable, or create a .pth file (see the python\n# documentation for details).\n#\n# If the MINIMUM-VERSION argument is passed, AM_PATH_PYTHON will\n# cause an error if the version of python installed on the system\n# doesn't meet the requirement.  MINIMUM-VERSION should consist of\n# numbers and dots only.\nAC_DEFUN([AM_PATH_PYTHON],\n [\n  dnl Find a Python interpreter.  Python versions prior to 2.0 are not\n  dnl supported. (2.0 was released on October 16, 2000).\n  m4_define_default([_AM_PYTHON_INTERPRETER_LIST],\n[python python2 python3 python3.3 python3.2 python3.1 python3.0 python2.7 dnl\n python2.6 python2.5 python2.4 python2.3 python2.2 python2.1 python2.0])\n\n  AC_ARG_VAR([PYTHON], [the Python interpreter])\n\n  m4_if([$1],[],[\n    dnl No version check is needed.\n    # Find any Python interpreter.\n    if test -z \"$PYTHON\"; then\n      AC_PATH_PROGS([PYTHON], _AM_PYTHON_INTERPRETER_LIST, :)\n    fi\n    am_display_PYTHON=python\n  ], [\n    dnl A version check is needed.\n    if test -n \"$PYTHON\"; then\n      # If the user set $PYTHON, use it and don't search something else.\n      AC_MSG_CHECKING([whether $PYTHON version is >= $1])\n      AM_PYTHON_CHECK_VERSION([$PYTHON], [$1],\n\t\t\t      [AC_MSG_RESULT([yes])],\n\t\t\t      [AC_MSG_RESULT([no])\n\t\t\t       AC_MSG_ERROR([Python interpreter is too old])])\n      am_display_PYTHON=$PYTHON\n    else\n      # Otherwise, try each interpreter until we find one that satisfies\n      # VERSION.\n      AC_CACHE_CHECK([for a Python interpreter with version >= $1],\n\t[am_cv_pathless_PYTHON],[\n\tfor am_cv_pathless_PYTHON in _AM_PYTHON_INTERPRETER_LIST none; do\n\t  test \"$am_cv_pathless_PYTHON\" = none && break\n\t  AM_PYTHON_CHECK_VERSION([$am_cv_pathless_PYTHON], [$1], [break])\n\tdone])\n      # Set $PYTHON to the absolute path of $am_cv_pathless_PYTHON.\n      if test \"$am_cv_pathless_PYTHON\" = none; then\n\tPYTHON=:\n      else\n        AC_PATH_PROG([PYTHON], [$am_cv_pathless_PYTHON])\n      fi\n      am_display_PYTHON=$am_cv_pathless_PYTHON\n    fi\n  ])\n\n  if test \"$PYTHON\" = :; then\n  dnl Run any user-specified action, or abort.\n    m4_default([$3], [AC_MSG_ERROR([no suitable Python interpreter found])])\n  else\n\n  dnl Query Python for its version number.  Getting [:3] seems to be\n  dnl the best way to do this; it's what \"site.py\" does in the standard\n  dnl library.\n\n  AC_CACHE_CHECK([for $am_display_PYTHON version], [am_cv_python_version],\n    [am_cv_python_version=`$PYTHON -c \"import sys; sys.stdout.write(sys.version[[:3]])\"`])\n  AC_SUBST([PYTHON_VERSION], [$am_cv_python_version])\n\n  dnl Use the values of $prefix and $exec_prefix for the corresponding\n  dnl values of PYTHON_PREFIX and PYTHON_EXEC_PREFIX.  These are made\n  dnl distinct variables so they can be overridden if need be.  However,\n  dnl general consensus is that you shouldn't need this ability.\n\n  AC_SUBST([PYTHON_PREFIX], ['${prefix}'])\n  AC_SUBST([PYTHON_EXEC_PREFIX], ['${exec_prefix}'])\n\n  dnl At times (like when building shared libraries) you may want\n  dnl to know which OS platform Python thinks this is.\n\n  AC_CACHE_CHECK([for $am_display_PYTHON platform], [am_cv_python_platform],\n    [am_cv_python_platform=`$PYTHON -c \"import sys; sys.stdout.write(sys.platform)\"`])\n  AC_SUBST([PYTHON_PLATFORM], [$am_cv_python_platform])\n\n  # Just factor out some code duplication.\n  am_python_setup_sysconfig=\"\\\nimport sys\n# Prefer sysconfig over distutils.sysconfig, for better compatibility\n# with python 3.x.  See automake bug#10227.\ntry:\n    import sysconfig\nexcept ImportError:\n    can_use_sysconfig = 0\nelse:\n    can_use_sysconfig = 1\n# Can't use sysconfig in CPython 2.7, since it's broken in virtualenvs:\n# <https://github.com/pypa/virtualenv/issues/118>\ntry:\n    from platform import python_implementation\n    if python_implementation() == 'CPython' and sys.version[[:3]] == '2.7':\n        can_use_sysconfig = 0\nexcept ImportError:\n    pass\"\n\n  dnl Set up 4 directories:\n\n  dnl pythondir -- where to install python scripts.  This is the\n  dnl   site-packages directory, not the python standard library\n  dnl   directory like in previous automake betas.  This behavior\n  dnl   is more consistent with lispdir.m4 for example.\n  dnl Query distutils for this directory.\n  AC_CACHE_CHECK([for $am_display_PYTHON script directory],\n    [am_cv_python_pythondir],\n    [if test \"x$prefix\" = xNONE\n     then\n       am_py_prefix=$ac_default_prefix\n     else\n       am_py_prefix=$prefix\n     fi\n     am_cv_python_pythondir=`$PYTHON -c \"\n$am_python_setup_sysconfig\nif can_use_sysconfig:\n    sitedir = sysconfig.get_path('purelib', vars={'base':'$am_py_prefix'})\nelse:\n    from distutils import sysconfig\n    sitedir = sysconfig.get_python_lib(0, 0, prefix='$am_py_prefix')\nsys.stdout.write(sitedir)\"`\n     case $am_cv_python_pythondir in\n     $am_py_prefix*)\n       am__strip_prefix=`echo \"$am_py_prefix\" | sed 's|.|.|g'`\n       am_cv_python_pythondir=`echo \"$am_cv_python_pythondir\" | sed \"s,^$am__strip_prefix,$PYTHON_PREFIX,\"`\n       ;;\n     *)\n       case $am_py_prefix in\n         /usr|/System*) ;;\n         *)\n\t  am_cv_python_pythondir=$PYTHON_PREFIX/lib/python$PYTHON_VERSION/site-packages\n\t  ;;\n       esac\n       ;;\n     esac\n    ])\n  AC_SUBST([pythondir], [$am_cv_python_pythondir])\n\n  dnl pkgpythondir -- $PACKAGE directory under pythondir.  Was\n  dnl   PYTHON_SITE_PACKAGE in previous betas, but this naming is\n  dnl   more consistent with the rest of automake.\n\n  AC_SUBST([pkgpythondir], [\\${pythondir}/$PACKAGE])\n\n  dnl pyexecdir -- directory for installing python extension modules\n  dnl   (shared libraries)\n  dnl Query distutils for this directory.\n  AC_CACHE_CHECK([for $am_display_PYTHON extension module directory],\n    [am_cv_python_pyexecdir],\n    [if test \"x$exec_prefix\" = xNONE\n     then\n       am_py_exec_prefix=$am_py_prefix\n     else\n       am_py_exec_prefix=$exec_prefix\n     fi\n     am_cv_python_pyexecdir=`$PYTHON -c \"\n$am_python_setup_sysconfig\nif can_use_sysconfig:\n    sitedir = sysconfig.get_path('platlib', vars={'platbase':'$am_py_prefix'})\nelse:\n    from distutils import sysconfig\n    sitedir = sysconfig.get_python_lib(1, 0, prefix='$am_py_prefix')\nsys.stdout.write(sitedir)\"`\n     case $am_cv_python_pyexecdir in\n     $am_py_exec_prefix*)\n       am__strip_prefix=`echo \"$am_py_exec_prefix\" | sed 's|.|.|g'`\n       am_cv_python_pyexecdir=`echo \"$am_cv_python_pyexecdir\" | sed \"s,^$am__strip_prefix,$PYTHON_EXEC_PREFIX,\"`\n       ;;\n     *)\n       case $am_py_exec_prefix in\n         /usr|/System*) ;;\n         *)\n\t   am_cv_python_pyexecdir=$PYTHON_EXEC_PREFIX/lib/python$PYTHON_VERSION/site-packages\n\t   ;;\n       esac\n       ;;\n     esac\n    ])\n  AC_SUBST([pyexecdir], [$am_cv_python_pyexecdir])\n\n  dnl pkgpyexecdir -- $(pyexecdir)/$(PACKAGE)\n\n  AC_SUBST([pkgpyexecdir], [\\${pyexecdir}/$PACKAGE])\n\n  dnl Run any user-specified action.\n  $2\n  fi\n\n])\n\n\n# AM_PYTHON_CHECK_VERSION(PROG, VERSION, [ACTION-IF-TRUE], [ACTION-IF-FALSE])\n# ---------------------------------------------------------------------------\n# Run ACTION-IF-TRUE if the Python interpreter PROG has version >= VERSION.\n# Run ACTION-IF-FALSE otherwise.\n# This test uses sys.hexversion instead of the string equivalent (first\n# word of sys.version), in order to cope with versions such as 2.2c1.\n# This supports Python 2.0 or higher. (2.0 was released on October 16, 2000).\nAC_DEFUN([AM_PYTHON_CHECK_VERSION],\n [prog=\"import sys\n# split strings by '.' and convert to numeric.  Append some zeros\n# because we need at least 4 digits for the hex conversion.\n# map returns an iterator in Python 3.0 and a list in 2.x\nminver = list(map(int, '$2'.split('.'))) + [[0, 0, 0]]\nminverhex = 0\n# xrange is not present in Python 3.0 and range returns an iterator\nfor i in list(range(0, 4)): minverhex = (minverhex << 8) + minver[[i]]\nsys.exit(sys.hexversion < minverhex)\"\n  AS_IF([AM_RUN_LOG([$1 -c \"$prog\"])], [$3], [$4])])\n\n# Copyright (C) 2001-2013 Free Software Foundation, Inc.\n#\n# This file is free software; the Free Software Foundation\n# gives unlimited permission to copy and/or distribute it,\n# with or without modifications, as long as this notice is preserved.\n\n# AM_RUN_LOG(COMMAND)\n# -------------------\n# Run COMMAND, save the exit status in ac_status, and log it.\n# (This has been adapted from Autoconf's _AC_RUN_LOG macro.)\nAC_DEFUN([AM_RUN_LOG],\n[{ echo \"$as_me:$LINENO: $1\" >&AS_MESSAGE_LOG_FD\n   ($1) >&AS_MESSAGE_LOG_FD 2>&AS_MESSAGE_LOG_FD\n   ac_status=$?\n   echo \"$as_me:$LINENO: \\$? = $ac_status\" >&AS_MESSAGE_LOG_FD\n   (exit $ac_status); }])\n\n# Check to make sure that the build environment is sane.    -*- Autoconf -*-\n\n# Copyright (C) 1996-2013 Free Software Foundation, Inc.\n#\n# This file is free software; the Free Software Foundation\n# gives unlimited permission to copy and/or distribute it,\n# with or without modifications, as long as this notice is preserved.\n\n# AM_SANITY_CHECK\n# ---------------\nAC_DEFUN([AM_SANITY_CHECK],\n[AC_MSG_CHECKING([whether build environment is sane])\n# Reject unsafe characters in $srcdir or the absolute working directory\n# name.  Accept space and tab only in the latter.\nam_lf='\n'\ncase `pwd` in\n  *[[\\\\\\\"\\#\\$\\&\\'\\`$am_lf]]*)\n    AC_MSG_ERROR([unsafe absolute working directory name]);;\nesac\ncase $srcdir in\n  *[[\\\\\\\"\\#\\$\\&\\'\\`$am_lf\\ \\\t]]*)\n    AC_MSG_ERROR([unsafe srcdir value: '$srcdir']);;\nesac\n\n# Do 'set' in a subshell so we don't clobber the current shell's\n# arguments.  Must try -L first in case configure is actually a\n# symlink; some systems play weird games with the mod time of symlinks\n# (eg FreeBSD returns the mod time of the symlink's containing\n# directory).\nif (\n   am_has_slept=no\n   for am_try in 1 2; do\n     echo \"timestamp, slept: $am_has_slept\" > conftest.file\n     set X `ls -Lt \"$srcdir/configure\" conftest.file 2> /dev/null`\n     if test \"$[*]\" = \"X\"; then\n\t# -L didn't work.\n\tset X `ls -t \"$srcdir/configure\" conftest.file`\n     fi\n     if test \"$[*]\" != \"X $srcdir/configure conftest.file\" \\\n\t&& test \"$[*]\" != \"X conftest.file $srcdir/configure\"; then\n\n\t# If neither matched, then we have a broken ls.  This can happen\n\t# if, for instance, CONFIG_SHELL is bash and it inherits a\n\t# broken ls alias from the environment.  This has actually\n\t# happened.  Such a system could not be considered \"sane\".\n\tAC_MSG_ERROR([ls -t appears to fail.  Make sure there is not a broken\n  alias in your environment])\n     fi\n     if test \"$[2]\" = conftest.file || test $am_try -eq 2; then\n       break\n     fi\n     # Just in case.\n     sleep 1\n     am_has_slept=yes\n   done\n   test \"$[2]\" = conftest.file\n   )\nthen\n   # Ok.\n   :\nelse\n   AC_MSG_ERROR([newly created file is older than distributed files!\nCheck your system clock])\nfi\nAC_MSG_RESULT([yes])\n# If we didn't sleep, we still need to ensure time stamps of config.status and\n# generated files are strictly newer.\nam_sleep_pid=\nif grep 'slept: no' conftest.file >/dev/null 2>&1; then\n  ( sleep 1 ) &\n  am_sleep_pid=$!\nfi\nAC_CONFIG_COMMANDS_PRE(\n  [AC_MSG_CHECKING([that generated files are newer than configure])\n   if test -n \"$am_sleep_pid\"; then\n     # Hide warnings about reused PIDs.\n     wait $am_sleep_pid 2>/dev/null\n   fi\n   AC_MSG_RESULT([done])])\nrm -f conftest.file\n])\n\n# Copyright (C) 2009-2013 Free Software Foundation, Inc.\n#\n# This file is free software; the Free Software Foundation\n# gives unlimited permission to copy and/or distribute it,\n# with or without modifications, as long as this notice is preserved.\n\n# AM_SILENT_RULES([DEFAULT])\n# --------------------------\n# Enable less verbose build rules; with the default set to DEFAULT\n# (\"yes\" being less verbose, \"no\" or empty being verbose).\nAC_DEFUN([AM_SILENT_RULES],\n[AC_ARG_ENABLE([silent-rules], [dnl\nAS_HELP_STRING(\n  [--enable-silent-rules],\n  [less verbose build output (undo: \"make V=1\")])\nAS_HELP_STRING(\n  [--disable-silent-rules],\n  [verbose build output (undo: \"make V=0\")])dnl\n])\ncase $enable_silent_rules in @%:@ (((\n  yes) AM_DEFAULT_VERBOSITY=0;;\n   no) AM_DEFAULT_VERBOSITY=1;;\n    *) AM_DEFAULT_VERBOSITY=m4_if([$1], [yes], [0], [1]);;\nesac\ndnl\ndnl A few 'make' implementations (e.g., NonStop OS and NextStep)\ndnl do not support nested variable expansions.\ndnl See automake bug#9928 and bug#10237.\nam_make=${MAKE-make}\nAC_CACHE_CHECK([whether $am_make supports nested variables],\n   [am_cv_make_support_nested_variables],\n   [if AS_ECHO([['TRUE=$(BAR$(V))\nBAR0=false\nBAR1=true\nV=1\nam__doit:\n\t@$(TRUE)\n.PHONY: am__doit']]) | $am_make -f - >/dev/null 2>&1; then\n  am_cv_make_support_nested_variables=yes\nelse\n  am_cv_make_support_nested_variables=no\nfi])\nif test $am_cv_make_support_nested_variables = yes; then\n  dnl Using '$V' instead of '$(V)' breaks IRIX make.\n  AM_V='$(V)'\n  AM_DEFAULT_V='$(AM_DEFAULT_VERBOSITY)'\nelse\n  AM_V=$AM_DEFAULT_VERBOSITY\n  AM_DEFAULT_V=$AM_DEFAULT_VERBOSITY\nfi\nAC_SUBST([AM_V])dnl\nAM_SUBST_NOTMAKE([AM_V])dnl\nAC_SUBST([AM_DEFAULT_V])dnl\nAM_SUBST_NOTMAKE([AM_DEFAULT_V])dnl\nAC_SUBST([AM_DEFAULT_VERBOSITY])dnl\nAM_BACKSLASH='\\'\nAC_SUBST([AM_BACKSLASH])dnl\n_AM_SUBST_NOTMAKE([AM_BACKSLASH])dnl\n])\n\n# Copyright (C) 2001-2013 Free Software Foundation, Inc.\n#\n# This file is free software; the Free Software Foundation\n# gives unlimited permission to copy and/or distribute it,\n# with or without modifications, as long as this notice is preserved.\n\n# AM_PROG_INSTALL_STRIP\n# ---------------------\n# One issue with vendor 'install' (even GNU) is that you can't\n# specify the program used to strip binaries.  This is especially\n# annoying in cross-compiling environments, where the build's strip\n# is unlikely to handle the host's binaries.\n# Fortunately install-sh will honor a STRIPPROG variable, so we\n# always use install-sh in \"make install-strip\", and initialize\n# STRIPPROG with the value of the STRIP variable (set by the user).\nAC_DEFUN([AM_PROG_INSTALL_STRIP],\n[AC_REQUIRE([AM_PROG_INSTALL_SH])dnl\n# Installed binaries are usually stripped using 'strip' when the user\n# run \"make install-strip\".  However 'strip' might not be the right\n# tool to use in cross-compilation environments, therefore Automake\n# will honor the 'STRIP' environment variable to overrule this program.\ndnl Don't test for $cross_compiling = yes, because it might be 'maybe'.\nif test \"$cross_compiling\" != no; then\n  AC_CHECK_TOOL([STRIP], [strip], :)\nfi\nINSTALL_STRIP_PROGRAM=\"\\$(install_sh) -c -s\"\nAC_SUBST([INSTALL_STRIP_PROGRAM])])\n\n# Copyright (C) 2006-2013 Free Software Foundation, Inc.\n#\n# This file is free software; the Free Software Foundation\n# gives unlimited permission to copy and/or distribute it,\n# with or without modifications, as long as this notice is preserved.\n\n# _AM_SUBST_NOTMAKE(VARIABLE)\n# ---------------------------\n# Prevent Automake from outputting VARIABLE = @VARIABLE@ in Makefile.in.\n# This macro is traced by Automake.\nAC_DEFUN([_AM_SUBST_NOTMAKE])\n\n# AM_SUBST_NOTMAKE(VARIABLE)\n# --------------------------\n# Public sister of _AM_SUBST_NOTMAKE.\nAC_DEFUN([AM_SUBST_NOTMAKE], [_AM_SUBST_NOTMAKE($@)])\n\n# Check how to create a tarball.                            -*- Autoconf -*-\n\n# Copyright (C) 2004-2013 Free Software Foundation, Inc.\n#\n# This file is free software; the Free Software Foundation\n# gives unlimited permission to copy and/or distribute it,\n# with or without modifications, as long as this notice is preserved.\n\n# _AM_PROG_TAR(FORMAT)\n# --------------------\n# Check how to create a tarball in format FORMAT.\n# FORMAT should be one of 'v7', 'ustar', or 'pax'.\n#\n# Substitute a variable $(am__tar) that is a command\n# writing to stdout a FORMAT-tarball containing the directory\n# $tardir.\n#     tardir=directory && $(am__tar) > result.tar\n#\n# Substitute a variable $(am__untar) that extract such\n# a tarball read from stdin.\n#     $(am__untar) < result.tar\n#\nAC_DEFUN([_AM_PROG_TAR],\n[# Always define AMTAR for backward compatibility.  Yes, it's still used\n# in the wild :-(  We should find a proper way to deprecate it ...\nAC_SUBST([AMTAR], ['$${TAR-tar}'])\n\n# We'll loop over all known methods to create a tar archive until one works.\n_am_tools='gnutar m4_if([$1], [ustar], [plaintar]) pax cpio none'\n\nm4_if([$1], [v7],\n  [am__tar='$${TAR-tar} chof - \"$$tardir\"' am__untar='$${TAR-tar} xf -'],\n\n  [m4_case([$1],\n    [ustar],\n     [# The POSIX 1988 'ustar' format is defined with fixed-size fields.\n      # There is notably a 21 bits limit for the UID and the GID.  In fact,\n      # the 'pax' utility can hang on bigger UID/GID (see automake bug#8343\n      # and bug#13588).\n      am_max_uid=2097151 # 2^21 - 1\n      am_max_gid=$am_max_uid\n      # The $UID and $GID variables are not portable, so we need to resort\n      # to the POSIX-mandated id(1) utility.  Errors in the 'id' calls\n      # below are definitely unexpected, so allow the users to see them\n      # (that is, avoid stderr redirection).\n      am_uid=`id -u || echo unknown`\n      am_gid=`id -g || echo unknown`\n      AC_MSG_CHECKING([whether UID '$am_uid' is supported by ustar format])\n      if test $am_uid -le $am_max_uid; then\n         AC_MSG_RESULT([yes])\n      else\n         AC_MSG_RESULT([no])\n         _am_tools=none\n      fi\n      AC_MSG_CHECKING([whether GID '$am_gid' is supported by ustar format])\n      if test $am_gid -le $am_max_gid; then\n         AC_MSG_RESULT([yes])\n      else\n        AC_MSG_RESULT([no])\n        _am_tools=none\n      fi],\n\n  [pax],\n    [],\n\n  [m4_fatal([Unknown tar format])])\n\n  AC_MSG_CHECKING([how to create a $1 tar archive])\n\n  # Go ahead even if we have the value already cached.  We do so because we\n  # need to set the values for the 'am__tar' and 'am__untar' variables.\n  _am_tools=${am_cv_prog_tar_$1-$_am_tools}\n\n  for _am_tool in $_am_tools; do\n    case $_am_tool in\n    gnutar)\n      for _am_tar in tar gnutar gtar; do\n        AM_RUN_LOG([$_am_tar --version]) && break\n      done\n      am__tar=\"$_am_tar --format=m4_if([$1], [pax], [posix], [$1]) -chf - \"'\"$$tardir\"'\n      am__tar_=\"$_am_tar --format=m4_if([$1], [pax], [posix], [$1]) -chf - \"'\"$tardir\"'\n      am__untar=\"$_am_tar -xf -\"\n      ;;\n    plaintar)\n      # Must skip GNU tar: if it does not support --format= it doesn't create\n      # ustar tarball either.\n      (tar --version) >/dev/null 2>&1 && continue\n      am__tar='tar chf - \"$$tardir\"'\n      am__tar_='tar chf - \"$tardir\"'\n      am__untar='tar xf -'\n      ;;\n    pax)\n      am__tar='pax -L -x $1 -w \"$$tardir\"'\n      am__tar_='pax -L -x $1 -w \"$tardir\"'\n      am__untar='pax -r'\n      ;;\n    cpio)\n      am__tar='find \"$$tardir\" -print | cpio -o -H $1 -L'\n      am__tar_='find \"$tardir\" -print | cpio -o -H $1 -L'\n      am__untar='cpio -i -H $1 -d'\n      ;;\n    none)\n      am__tar=false\n      am__tar_=false\n      am__untar=false\n      ;;\n    esac\n\n    # If the value was cached, stop now.  We just wanted to have am__tar\n    # and am__untar set.\n    test -n \"${am_cv_prog_tar_$1}\" && break\n\n    # tar/untar a dummy directory, and stop if the command works.\n    rm -rf conftest.dir\n    mkdir conftest.dir\n    echo GrepMe > conftest.dir/file\n    AM_RUN_LOG([tardir=conftest.dir && eval $am__tar_ >conftest.tar])\n    rm -rf conftest.dir\n    if test -s conftest.tar; then\n      AM_RUN_LOG([$am__untar <conftest.tar])\n      AM_RUN_LOG([cat conftest.dir/file])\n      grep GrepMe conftest.dir/file >/dev/null 2>&1 && break\n    fi\n  done\n  rm -rf conftest.dir\n\n  AC_CACHE_VAL([am_cv_prog_tar_$1], [am_cv_prog_tar_$1=$_am_tool])\n  AC_MSG_RESULT([$am_cv_prog_tar_$1])])\n\nAC_SUBST([am__tar])\nAC_SUBST([am__untar])\n]) # _AM_PROG_TAR\n\nm4_include([m4/ac_python_devel.m4])\nm4_include([m4/libtool.m4])\nm4_include([m4/ltoptions.m4])\nm4_include([m4/ltsugar.m4])\nm4_include([m4/ltversion.m4])\nm4_include([m4/lt~obsolete.m4])\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/ar-lib",
    "content": "#! /bin/sh\n# Wrapper for Microsoft lib.exe\n\nme=ar-lib\nscriptversion=2012-03-01.08; # UTC\n\n# Copyright (C) 2010-2013 Free Software Foundation, Inc.\n# Written by Peter Rosin <peda@lysator.liu.se>.\n#\n# This program is free software; you can redistribute it and/or modify\n# it under the terms of the GNU General Public License as published by\n# the Free Software Foundation; either version 2, or (at your option)\n# any later version.\n#\n# This program is distributed in the hope that it will be useful,\n# but WITHOUT ANY WARRANTY; without even the implied warranty of\n# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n# GNU General Public License for more details.\n#\n# You should have received a copy of the GNU General Public License\n# along with this program.  If not, see <http://www.gnu.org/licenses/>.\n\n# As a special exception to the GNU General Public License, if you\n# distribute this file as part of a program that contains a\n# configuration script generated by Autoconf, you may include it under\n# the same distribution terms that you use for the rest of that program.\n\n# This file is maintained in Automake, please report\n# bugs to <bug-automake@gnu.org> or send patches to\n# <automake-patches@gnu.org>.\n\n\n# func_error message\nfunc_error ()\n{\n  echo \"$me: $1\" 1>&2\n  exit 1\n}\n\nfile_conv=\n\n# func_file_conv build_file\n# Convert a $build file to $host form and store it in $file\n# Currently only supports Windows hosts.\nfunc_file_conv ()\n{\n  file=$1\n  case $file in\n    / | /[!/]*) # absolute file, and not a UNC file\n      if test -z \"$file_conv\"; then\n\t# lazily determine how to convert abs files\n\tcase `uname -s` in\n\t  MINGW*)\n\t    file_conv=mingw\n\t    ;;\n\t  CYGWIN*)\n\t    file_conv=cygwin\n\t    ;;\n\t  *)\n\t    file_conv=wine\n\t    ;;\n\tesac\n      fi\n      case $file_conv in\n\tmingw)\n\t  file=`cmd //C echo \"$file \" | sed -e 's/\"\\(.*\\) \" *$/\\1/'`\n\t  ;;\n\tcygwin)\n\t  file=`cygpath -m \"$file\" || echo \"$file\"`\n\t  ;;\n\twine)\n\t  file=`winepath -w \"$file\" || echo \"$file\"`\n\t  ;;\n      esac\n      ;;\n  esac\n}\n\n# func_at_file at_file operation archive\n# Iterate over all members in AT_FILE performing OPERATION on ARCHIVE\n# for each of them.\n# When interpreting the content of the @FILE, do NOT use func_file_conv,\n# since the user would need to supply preconverted file names to\n# binutils ar, at least for MinGW.\nfunc_at_file ()\n{\n  operation=$2\n  archive=$3\n  at_file_contents=`cat \"$1\"`\n  eval set x \"$at_file_contents\"\n  shift\n\n  for member\n  do\n    $AR -NOLOGO $operation:\"$member\" \"$archive\" || exit $?\n  done\n}\n\ncase $1 in\n  '')\n     func_error \"no command.  Try '$0 --help' for more information.\"\n     ;;\n  -h | --h*)\n    cat <<EOF\nUsage: $me [--help] [--version] PROGRAM ACTION ARCHIVE [MEMBER...]\n\nMembers may be specified in a file named with @FILE.\nEOF\n    exit $?\n    ;;\n  -v | --v*)\n    echo \"$me, version $scriptversion\"\n    exit $?\n    ;;\nesac\n\nif test $# -lt 3; then\n  func_error \"you must specify a program, an action and an archive\"\nfi\n\nAR=$1\nshift\nwhile :\ndo\n  if test $# -lt 2; then\n    func_error \"you must specify a program, an action and an archive\"\n  fi\n  case $1 in\n    -lib | -LIB \\\n    | -ltcg | -LTCG \\\n    | -machine* | -MACHINE* \\\n    | -subsystem* | -SUBSYSTEM* \\\n    | -verbose | -VERBOSE \\\n    | -wx* | -WX* )\n      AR=\"$AR $1\"\n      shift\n      ;;\n    *)\n      action=$1\n      shift\n      break\n      ;;\n  esac\ndone\norig_archive=$1\nshift\nfunc_file_conv \"$orig_archive\"\narchive=$file\n\n# strip leading dash in $action\naction=${action#-}\n\ndelete=\nextract=\nlist=\nquick=\nreplace=\nindex=\ncreate=\n\nwhile test -n \"$action\"\ndo\n  case $action in\n    d*) delete=yes  ;;\n    x*) extract=yes ;;\n    t*) list=yes    ;;\n    q*) quick=yes   ;;\n    r*) replace=yes ;;\n    s*) index=yes   ;;\n    S*)             ;; # the index is always updated implicitly\n    c*) create=yes  ;;\n    u*)             ;; # TODO: don't ignore the update modifier\n    v*)             ;; # TODO: don't ignore the verbose modifier\n    *)\n      func_error \"unknown action specified\"\n      ;;\n  esac\n  action=${action#?}\ndone\n\ncase $delete$extract$list$quick$replace,$index in\n  yes,* | ,yes)\n    ;;\n  yesyes*)\n    func_error \"more than one action specified\"\n    ;;\n  *)\n    func_error \"no action specified\"\n    ;;\nesac\n\nif test -n \"$delete\"; then\n  if test ! -f \"$orig_archive\"; then\n    func_error \"archive not found\"\n  fi\n  for member\n  do\n    case $1 in\n      @*)\n        func_at_file \"${1#@}\" -REMOVE \"$archive\"\n        ;;\n      *)\n        func_file_conv \"$1\"\n        $AR -NOLOGO -REMOVE:\"$file\" \"$archive\" || exit $?\n        ;;\n    esac\n  done\n\nelif test -n \"$extract\"; then\n  if test ! -f \"$orig_archive\"; then\n    func_error \"archive not found\"\n  fi\n  if test $# -gt 0; then\n    for member\n    do\n      case $1 in\n        @*)\n          func_at_file \"${1#@}\" -EXTRACT \"$archive\"\n          ;;\n        *)\n          func_file_conv \"$1\"\n          $AR -NOLOGO -EXTRACT:\"$file\" \"$archive\" || exit $?\n          ;;\n      esac\n    done\n  else\n    $AR -NOLOGO -LIST \"$archive\" | sed -e 's/\\\\/\\\\\\\\/g' | while read member\n    do\n      $AR -NOLOGO -EXTRACT:\"$member\" \"$archive\" || exit $?\n    done\n  fi\n\nelif test -n \"$quick$replace\"; then\n  if test ! -f \"$orig_archive\"; then\n    if test -z \"$create\"; then\n      echo \"$me: creating $orig_archive\"\n    fi\n    orig_archive=\n  else\n    orig_archive=$archive\n  fi\n\n  for member\n  do\n    case $1 in\n    @*)\n      func_file_conv \"${1#@}\"\n      set x \"$@\" \"@$file\"\n      ;;\n    *)\n      func_file_conv \"$1\"\n      set x \"$@\" \"$file\"\n      ;;\n    esac\n    shift\n    shift\n  done\n\n  if test -n \"$orig_archive\"; then\n    $AR -NOLOGO -OUT:\"$archive\" \"$orig_archive\" \"$@\" || exit $?\n  else\n    $AR -NOLOGO -OUT:\"$archive\" \"$@\" || exit $?\n  fi\n\nelif test -n \"$list\"; then\n  if test ! -f \"$orig_archive\"; then\n    func_error \"archive not found\"\n  fi\n  $AR -NOLOGO -LIST \"$archive\" || exit $?\nfi\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/compile",
    "content": "#! /bin/sh\n# Wrapper for compilers which do not understand '-c -o'.\n\nscriptversion=2012-10-14.11; # UTC\n\n# Copyright (C) 1999-2013 Free Software Foundation, Inc.\n# Written by Tom Tromey <tromey@cygnus.com>.\n#\n# This program is free software; you can redistribute it and/or modify\n# it under the terms of the GNU General Public License as published by\n# the Free Software Foundation; either version 2, or (at your option)\n# any later version.\n#\n# This program is distributed in the hope that it will be useful,\n# but WITHOUT ANY WARRANTY; without even the implied warranty of\n# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n# GNU General Public License for more details.\n#\n# You should have received a copy of the GNU General Public License\n# along with this program.  If not, see <http://www.gnu.org/licenses/>.\n\n# As a special exception to the GNU General Public License, if you\n# distribute this file as part of a program that contains a\n# configuration script generated by Autoconf, you may include it under\n# the same distribution terms that you use for the rest of that program.\n\n# This file is maintained in Automake, please report\n# bugs to <bug-automake@gnu.org> or send patches to\n# <automake-patches@gnu.org>.\n\nnl='\n'\n\n# We need space, tab and new line, in precisely that order.  Quoting is\n# there to prevent tools from complaining about whitespace usage.\nIFS=\" \"\"\t$nl\"\n\nfile_conv=\n\n# func_file_conv build_file lazy\n# Convert a $build file to $host form and store it in $file\n# Currently only supports Windows hosts. If the determined conversion\n# type is listed in (the comma separated) LAZY, no conversion will\n# take place.\nfunc_file_conv ()\n{\n  file=$1\n  case $file in\n    / | /[!/]*) # absolute file, and not a UNC file\n      if test -z \"$file_conv\"; then\n\t# lazily determine how to convert abs files\n\tcase `uname -s` in\n\t  MINGW*)\n\t    file_conv=mingw\n\t    ;;\n\t  CYGWIN*)\n\t    file_conv=cygwin\n\t    ;;\n\t  *)\n\t    file_conv=wine\n\t    ;;\n\tesac\n      fi\n      case $file_conv/,$2, in\n\t*,$file_conv,*)\n\t  ;;\n\tmingw/*)\n\t  file=`cmd //C echo \"$file \" | sed -e 's/\"\\(.*\\) \" *$/\\1/'`\n\t  ;;\n\tcygwin/*)\n\t  file=`cygpath -m \"$file\" || echo \"$file\"`\n\t  ;;\n\twine/*)\n\t  file=`winepath -w \"$file\" || echo \"$file\"`\n\t  ;;\n      esac\n      ;;\n  esac\n}\n\n# func_cl_dashL linkdir\n# Make cl look for libraries in LINKDIR\nfunc_cl_dashL ()\n{\n  func_file_conv \"$1\"\n  if test -z \"$lib_path\"; then\n    lib_path=$file\n  else\n    lib_path=\"$lib_path;$file\"\n  fi\n  linker_opts=\"$linker_opts -LIBPATH:$file\"\n}\n\n# func_cl_dashl library\n# Do a library search-path lookup for cl\nfunc_cl_dashl ()\n{\n  lib=$1\n  found=no\n  save_IFS=$IFS\n  IFS=';'\n  for dir in $lib_path $LIB\n  do\n    IFS=$save_IFS\n    if $shared && test -f \"$dir/$lib.dll.lib\"; then\n      found=yes\n      lib=$dir/$lib.dll.lib\n      break\n    fi\n    if test -f \"$dir/$lib.lib\"; then\n      found=yes\n      lib=$dir/$lib.lib\n      break\n    fi\n    if test -f \"$dir/lib$lib.a\"; then\n      found=yes\n      lib=$dir/lib$lib.a\n      break\n    fi\n  done\n  IFS=$save_IFS\n\n  if test \"$found\" != yes; then\n    lib=$lib.lib\n  fi\n}\n\n# func_cl_wrapper cl arg...\n# Adjust compile command to suit cl\nfunc_cl_wrapper ()\n{\n  # Assume a capable shell\n  lib_path=\n  shared=:\n  linker_opts=\n  for arg\n  do\n    if test -n \"$eat\"; then\n      eat=\n    else\n      case $1 in\n\t-o)\n\t  # configure might choose to run compile as 'compile cc -o foo foo.c'.\n\t  eat=1\n\t  case $2 in\n\t    *.o | *.[oO][bB][jJ])\n\t      func_file_conv \"$2\"\n\t      set x \"$@\" -Fo\"$file\"\n\t      shift\n\t      ;;\n\t    *)\n\t      func_file_conv \"$2\"\n\t      set x \"$@\" -Fe\"$file\"\n\t      shift\n\t      ;;\n\t  esac\n\t  ;;\n\t-I)\n\t  eat=1\n\t  func_file_conv \"$2\" mingw\n\t  set x \"$@\" -I\"$file\"\n\t  shift\n\t  ;;\n\t-I*)\n\t  func_file_conv \"${1#-I}\" mingw\n\t  set x \"$@\" -I\"$file\"\n\t  shift\n\t  ;;\n\t-l)\n\t  eat=1\n\t  func_cl_dashl \"$2\"\n\t  set x \"$@\" \"$lib\"\n\t  shift\n\t  ;;\n\t-l*)\n\t  func_cl_dashl \"${1#-l}\"\n\t  set x \"$@\" \"$lib\"\n\t  shift\n\t  ;;\n\t-L)\n\t  eat=1\n\t  func_cl_dashL \"$2\"\n\t  ;;\n\t-L*)\n\t  func_cl_dashL \"${1#-L}\"\n\t  ;;\n\t-static)\n\t  shared=false\n\t  ;;\n\t-Wl,*)\n\t  arg=${1#-Wl,}\n\t  save_ifs=\"$IFS\"; IFS=','\n\t  for flag in $arg; do\n\t    IFS=\"$save_ifs\"\n\t    linker_opts=\"$linker_opts $flag\"\n\t  done\n\t  IFS=\"$save_ifs\"\n\t  ;;\n\t-Xlinker)\n\t  eat=1\n\t  linker_opts=\"$linker_opts $2\"\n\t  ;;\n\t-*)\n\t  set x \"$@\" \"$1\"\n\t  shift\n\t  ;;\n\t*.cc | *.CC | *.cxx | *.CXX | *.[cC]++)\n\t  func_file_conv \"$1\"\n\t  set x \"$@\" -Tp\"$file\"\n\t  shift\n\t  ;;\n\t*.c | *.cpp | *.CPP | *.lib | *.LIB | *.Lib | *.OBJ | *.obj | *.[oO])\n\t  func_file_conv \"$1\" mingw\n\t  set x \"$@\" \"$file\"\n\t  shift\n\t  ;;\n\t*)\n\t  set x \"$@\" \"$1\"\n\t  shift\n\t  ;;\n      esac\n    fi\n    shift\n  done\n  if test -n \"$linker_opts\"; then\n    linker_opts=\"-link$linker_opts\"\n  fi\n  exec \"$@\" $linker_opts\n  exit 1\n}\n\neat=\n\ncase $1 in\n  '')\n     echo \"$0: No command.  Try '$0 --help' for more information.\" 1>&2\n     exit 1;\n     ;;\n  -h | --h*)\n    cat <<\\EOF\nUsage: compile [--help] [--version] PROGRAM [ARGS]\n\nWrapper for compilers which do not understand '-c -o'.\nRemove '-o dest.o' from ARGS, run PROGRAM with the remaining\narguments, and rename the output as expected.\n\nIf you are trying to build a whole package this is not the\nright script to run: please start by reading the file 'INSTALL'.\n\nReport bugs to <bug-automake@gnu.org>.\nEOF\n    exit $?\n    ;;\n  -v | --v*)\n    echo \"compile $scriptversion\"\n    exit $?\n    ;;\n  cl | *[/\\\\]cl | cl.exe | *[/\\\\]cl.exe )\n    func_cl_wrapper \"$@\"      # Doesn't return...\n    ;;\nesac\n\nofile=\ncfile=\n\nfor arg\ndo\n  if test -n \"$eat\"; then\n    eat=\n  else\n    case $1 in\n      -o)\n\t# configure might choose to run compile as 'compile cc -o foo foo.c'.\n\t# So we strip '-o arg' only if arg is an object.\n\teat=1\n\tcase $2 in\n\t  *.o | *.obj)\n\t    ofile=$2\n\t    ;;\n\t  *)\n\t    set x \"$@\" -o \"$2\"\n\t    shift\n\t    ;;\n\tesac\n\t;;\n      *.c)\n\tcfile=$1\n\tset x \"$@\" \"$1\"\n\tshift\n\t;;\n      *)\n\tset x \"$@\" \"$1\"\n\tshift\n\t;;\n    esac\n  fi\n  shift\ndone\n\nif test -z \"$ofile\" || test -z \"$cfile\"; then\n  # If no '-o' option was seen then we might have been invoked from a\n  # pattern rule where we don't need one.  That is ok -- this is a\n  # normal compilation that the losing compiler can handle.  If no\n  # '.c' file was seen then we are probably linking.  That is also\n  # ok.\n  exec \"$@\"\nfi\n\n# Name of file we expect compiler to create.\ncofile=`echo \"$cfile\" | sed 's|^.*[\\\\/]||; s|^[a-zA-Z]:||; s/\\.c$/.o/'`\n\n# Create the lock directory.\n# Note: use '[/\\\\:.-]' here to ensure that we don't use the same name\n# that we are using for the .o file.  Also, base the name on the expected\n# object file name, since that is what matters with a parallel build.\nlockdir=`echo \"$cofile\" | sed -e 's|[/\\\\:.-]|_|g'`.d\nwhile true; do\n  if mkdir \"$lockdir\" >/dev/null 2>&1; then\n    break\n  fi\n  sleep 1\ndone\n# FIXME: race condition here if user kills between mkdir and trap.\ntrap \"rmdir '$lockdir'; exit 1\" 1 2 15\n\n# Run the compile.\n\"$@\"\nret=$?\n\nif test -f \"$cofile\"; then\n  test \"$cofile\" = \"$ofile\" || mv \"$cofile\" \"$ofile\"\nelif test -f \"${cofile}bj\"; then\n  test \"${cofile}bj\" = \"$ofile\" || mv \"${cofile}bj\" \"$ofile\"\nfi\n\nrmdir \"$lockdir\"\nexit $ret\n\n# Local Variables:\n# mode: shell-script\n# sh-indentation: 2\n# eval: (add-hook 'write-file-hooks 'time-stamp)\n# time-stamp-start: \"scriptversion=\"\n# time-stamp-format: \"%:y-%02m-%02d.%02H\"\n# time-stamp-time-zone: \"UTC\"\n# time-stamp-end: \"; # UTC\"\n# End:\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/config.guess",
    "content": "#! /bin/sh\n# Attempt to guess a canonical system name.\n#   Copyright 1992-2013 Free Software Foundation, Inc.\n\ntimestamp='2013-06-10'\n\n# This file is free software; you can redistribute it and/or modify it\n# under the terms of the GNU General Public License as published by\n# the Free Software Foundation; either version 3 of the License, or\n# (at your option) any later version.\n#\n# This program is distributed in the hope that it will be useful, but\n# WITHOUT ANY WARRANTY; without even the implied warranty of\n# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n# General Public License for more details.\n#\n# You should have received a copy of the GNU General Public License\n# along with this program; if not, see <http://www.gnu.org/licenses/>.\n#\n# As a special exception to the GNU General Public License, if you\n# distribute this file as part of a program that contains a\n# configuration script generated by Autoconf, you may include it under\n# the same distribution terms that you use for the rest of that\n# program.  This Exception is an additional permission under section 7\n# of the GNU General Public License, version 3 (\"GPLv3\").\n#\n# Originally written by Per Bothner.\n#\n# You can get the latest version of this script from:\n# http://git.savannah.gnu.org/gitweb/?p=config.git;a=blob_plain;f=config.guess;hb=HEAD\n#\n# Please send patches with a ChangeLog entry to config-patches@gnu.org.\n\n\nme=`echo \"$0\" | sed -e 's,.*/,,'`\n\nusage=\"\\\nUsage: $0 [OPTION]\n\nOutput the configuration name of the system \\`$me' is run on.\n\nOperation modes:\n  -h, --help         print this help, then exit\n  -t, --time-stamp   print date of last modification, then exit\n  -v, --version      print version number, then exit\n\nReport bugs and patches to <config-patches@gnu.org>.\"\n\nversion=\"\\\nGNU config.guess ($timestamp)\n\nOriginally written by Per Bothner.\nCopyright 1992-2013 Free Software Foundation, Inc.\n\nThis is free software; see the source for copying conditions.  There is NO\nwarranty; not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.\"\n\nhelp=\"\nTry \\`$me --help' for more information.\"\n\n# Parse command line\nwhile test $# -gt 0 ; do\n  case $1 in\n    --time-stamp | --time* | -t )\n       echo \"$timestamp\" ; exit ;;\n    --version | -v )\n       echo \"$version\" ; exit ;;\n    --help | --h* | -h )\n       echo \"$usage\"; exit ;;\n    -- )     # Stop option processing\n       shift; break ;;\n    - )\t# Use stdin as input.\n       break ;;\n    -* )\n       echo \"$me: invalid option $1$help\" >&2\n       exit 1 ;;\n    * )\n       break ;;\n  esac\ndone\n\nif test $# != 0; then\n  echo \"$me: too many arguments$help\" >&2\n  exit 1\nfi\n\ntrap 'exit 1' 1 2 15\n\n# CC_FOR_BUILD -- compiler used by this script. Note that the use of a\n# compiler to aid in system detection is discouraged as it requires\n# temporary files to be created and, as you can see below, it is a\n# headache to deal with in a portable fashion.\n\n# Historically, `CC_FOR_BUILD' used to be named `HOST_CC'. We still\n# use `HOST_CC' if defined, but it is deprecated.\n\n# Portable tmp directory creation inspired by the Autoconf team.\n\nset_cc_for_build='\ntrap \"exitcode=\\$?; (rm -f \\$tmpfiles 2>/dev/null; rmdir \\$tmp 2>/dev/null) && exit \\$exitcode\" 0 ;\ntrap \"rm -f \\$tmpfiles 2>/dev/null; rmdir \\$tmp 2>/dev/null; exit 1\" 1 2 13 15 ;\n: ${TMPDIR=/tmp} ;\n { tmp=`(umask 077 && mktemp -d \"$TMPDIR/cgXXXXXX\") 2>/dev/null` && test -n \"$tmp\" && test -d \"$tmp\" ; } ||\n { test -n \"$RANDOM\" && tmp=$TMPDIR/cg$$-$RANDOM && (umask 077 && mkdir $tmp) ; } ||\n { tmp=$TMPDIR/cg-$$ && (umask 077 && mkdir $tmp) && echo \"Warning: creating insecure temp directory\" >&2 ; } ||\n { echo \"$me: cannot create a temporary directory in $TMPDIR\" >&2 ; exit 1 ; } ;\ndummy=$tmp/dummy ;\ntmpfiles=\"$dummy.c $dummy.o $dummy.rel $dummy\" ;\ncase $CC_FOR_BUILD,$HOST_CC,$CC in\n ,,)    echo \"int x;\" > $dummy.c ;\n\tfor c in cc gcc c89 c99 ; do\n\t  if ($c -c -o $dummy.o $dummy.c) >/dev/null 2>&1 ; then\n\t     CC_FOR_BUILD=\"$c\"; break ;\n\t  fi ;\n\tdone ;\n\tif test x\"$CC_FOR_BUILD\" = x ; then\n\t  CC_FOR_BUILD=no_compiler_found ;\n\tfi\n\t;;\n ,,*)   CC_FOR_BUILD=$CC ;;\n ,*,*)  CC_FOR_BUILD=$HOST_CC ;;\nesac ; set_cc_for_build= ;'\n\n# This is needed to find uname on a Pyramid OSx when run in the BSD universe.\n# (ghazi@noc.rutgers.edu 1994-08-24)\nif (test -f /.attbin/uname) >/dev/null 2>&1 ; then\n\tPATH=$PATH:/.attbin ; export PATH\nfi\n\nUNAME_MACHINE=`(uname -m) 2>/dev/null` || UNAME_MACHINE=unknown\nUNAME_RELEASE=`(uname -r) 2>/dev/null` || UNAME_RELEASE=unknown\nUNAME_SYSTEM=`(uname -s) 2>/dev/null`  || UNAME_SYSTEM=unknown\nUNAME_VERSION=`(uname -v) 2>/dev/null` || UNAME_VERSION=unknown\n\ncase \"${UNAME_SYSTEM}\" in\nLinux|GNU|GNU/*)\n\t# If the system lacks a compiler, then just pick glibc.\n\t# We could probably try harder.\n\tLIBC=gnu\n\n\teval $set_cc_for_build\n\tcat <<-EOF > $dummy.c\n\t#include <features.h>\n\t#if defined(__UCLIBC__)\n\tLIBC=uclibc\n\t#elif defined(__dietlibc__)\n\tLIBC=dietlibc\n\t#else\n\tLIBC=gnu\n\t#endif\n\tEOF\n\teval `$CC_FOR_BUILD -E $dummy.c 2>/dev/null | grep '^LIBC'`\n\t;;\nesac\n\n# Note: order is significant - the case branches are not exclusive.\n\ncase \"${UNAME_MACHINE}:${UNAME_SYSTEM}:${UNAME_RELEASE}:${UNAME_VERSION}\" in\n    *:NetBSD:*:*)\n\t# NetBSD (nbsd) targets should (where applicable) match one or\n\t# more of the tuples: *-*-netbsdelf*, *-*-netbsdaout*,\n\t# *-*-netbsdecoff* and *-*-netbsd*.  For targets that recently\n\t# switched to ELF, *-*-netbsd* would select the old\n\t# object file format.  This provides both forward\n\t# compatibility and a consistent mechanism for selecting the\n\t# object file format.\n\t#\n\t# Note: NetBSD doesn't particularly care about the vendor\n\t# portion of the name.  We always set it to \"unknown\".\n\tsysctl=\"sysctl -n hw.machine_arch\"\n\tUNAME_MACHINE_ARCH=`(/sbin/$sysctl 2>/dev/null || \\\n\t    /usr/sbin/$sysctl 2>/dev/null || echo unknown)`\n\tcase \"${UNAME_MACHINE_ARCH}\" in\n\t    armeb) machine=armeb-unknown ;;\n\t    arm*) machine=arm-unknown ;;\n\t    sh3el) machine=shl-unknown ;;\n\t    sh3eb) machine=sh-unknown ;;\n\t    sh5el) machine=sh5le-unknown ;;\n\t    *) machine=${UNAME_MACHINE_ARCH}-unknown ;;\n\tesac\n\t# The Operating System including object format, if it has switched\n\t# to ELF recently, or will in the future.\n\tcase \"${UNAME_MACHINE_ARCH}\" in\n\t    arm*|i386|m68k|ns32k|sh3*|sparc|vax)\n\t\teval $set_cc_for_build\n\t\tif echo __ELF__ | $CC_FOR_BUILD -E - 2>/dev/null \\\n\t\t\t| grep -q __ELF__\n\t\tthen\n\t\t    # Once all utilities can be ECOFF (netbsdecoff) or a.out (netbsdaout).\n\t\t    # Return netbsd for either.  FIX?\n\t\t    os=netbsd\n\t\telse\n\t\t    os=netbsdelf\n\t\tfi\n\t\t;;\n\t    *)\n\t\tos=netbsd\n\t\t;;\n\tesac\n\t# The OS release\n\t# Debian GNU/NetBSD machines have a different userland, and\n\t# thus, need a distinct triplet. However, they do not need\n\t# kernel version information, so it can be replaced with a\n\t# suitable tag, in the style of linux-gnu.\n\tcase \"${UNAME_VERSION}\" in\n\t    Debian*)\n\t\trelease='-gnu'\n\t\t;;\n\t    *)\n\t\trelease=`echo ${UNAME_RELEASE}|sed -e 's/[-_].*/\\./'`\n\t\t;;\n\tesac\n\t# Since CPU_TYPE-MANUFACTURER-KERNEL-OPERATING_SYSTEM:\n\t# contains redundant information, the shorter form:\n\t# CPU_TYPE-MANUFACTURER-OPERATING_SYSTEM is used.\n\techo \"${machine}-${os}${release}\"\n\texit ;;\n    *:Bitrig:*:*)\n\tUNAME_MACHINE_ARCH=`arch | sed 's/Bitrig.//'`\n\techo ${UNAME_MACHINE_ARCH}-unknown-bitrig${UNAME_RELEASE}\n\texit ;;\n    *:OpenBSD:*:*)\n\tUNAME_MACHINE_ARCH=`arch | sed 's/OpenBSD.//'`\n\techo ${UNAME_MACHINE_ARCH}-unknown-openbsd${UNAME_RELEASE}\n\texit ;;\n    *:ekkoBSD:*:*)\n\techo ${UNAME_MACHINE}-unknown-ekkobsd${UNAME_RELEASE}\n\texit ;;\n    *:SolidBSD:*:*)\n\techo ${UNAME_MACHINE}-unknown-solidbsd${UNAME_RELEASE}\n\texit ;;\n    macppc:MirBSD:*:*)\n\techo powerpc-unknown-mirbsd${UNAME_RELEASE}\n\texit ;;\n    *:MirBSD:*:*)\n\techo ${UNAME_MACHINE}-unknown-mirbsd${UNAME_RELEASE}\n\texit ;;\n    alpha:OSF1:*:*)\n\tcase $UNAME_RELEASE in\n\t*4.0)\n\t\tUNAME_RELEASE=`/usr/sbin/sizer -v | awk '{print $3}'`\n\t\t;;\n\t*5.*)\n\t\tUNAME_RELEASE=`/usr/sbin/sizer -v | awk '{print $4}'`\n\t\t;;\n\tesac\n\t# According to Compaq, /usr/sbin/psrinfo has been available on\n\t# OSF/1 and Tru64 systems produced since 1995.  I hope that\n\t# covers most systems running today.  This code pipes the CPU\n\t# types through head -n 1, so we only detect the type of CPU 0.\n\tALPHA_CPU_TYPE=`/usr/sbin/psrinfo -v | sed -n -e 's/^  The alpha \\(.*\\) processor.*$/\\1/p' | head -n 1`\n\tcase \"$ALPHA_CPU_TYPE\" in\n\t    \"EV4 (21064)\")\n\t\tUNAME_MACHINE=\"alpha\" ;;\n\t    \"EV4.5 (21064)\")\n\t\tUNAME_MACHINE=\"alpha\" ;;\n\t    \"LCA4 (21066/21068)\")\n\t\tUNAME_MACHINE=\"alpha\" ;;\n\t    \"EV5 (21164)\")\n\t\tUNAME_MACHINE=\"alphaev5\" ;;\n\t    \"EV5.6 (21164A)\")\n\t\tUNAME_MACHINE=\"alphaev56\" ;;\n\t    \"EV5.6 (21164PC)\")\n\t\tUNAME_MACHINE=\"alphapca56\" ;;\n\t    \"EV5.7 (21164PC)\")\n\t\tUNAME_MACHINE=\"alphapca57\" ;;\n\t    \"EV6 (21264)\")\n\t\tUNAME_MACHINE=\"alphaev6\" ;;\n\t    \"EV6.7 (21264A)\")\n\t\tUNAME_MACHINE=\"alphaev67\" ;;\n\t    \"EV6.8CB (21264C)\")\n\t\tUNAME_MACHINE=\"alphaev68\" ;;\n\t    \"EV6.8AL (21264B)\")\n\t\tUNAME_MACHINE=\"alphaev68\" ;;\n\t    \"EV6.8CX (21264D)\")\n\t\tUNAME_MACHINE=\"alphaev68\" ;;\n\t    \"EV6.9A (21264/EV69A)\")\n\t\tUNAME_MACHINE=\"alphaev69\" ;;\n\t    \"EV7 (21364)\")\n\t\tUNAME_MACHINE=\"alphaev7\" ;;\n\t    \"EV7.9 (21364A)\")\n\t\tUNAME_MACHINE=\"alphaev79\" ;;\n\tesac\n\t# A Pn.n version is a patched version.\n\t# A Vn.n version is a released version.\n\t# A Tn.n version is a released field test version.\n\t# A Xn.n version is an unreleased experimental baselevel.\n\t# 1.2 uses \"1.2\" for uname -r.\n\techo ${UNAME_MACHINE}-dec-osf`echo ${UNAME_RELEASE} | sed -e 's/^[PVTX]//' | tr 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' 'abcdefghijklmnopqrstuvwxyz'`\n\t# Reset EXIT trap before exiting to avoid spurious non-zero exit code.\n\texitcode=$?\n\ttrap '' 0\n\texit $exitcode ;;\n    Alpha\\ *:Windows_NT*:*)\n\t# How do we know it's Interix rather than the generic POSIX subsystem?\n\t# Should we change UNAME_MACHINE based on the output of uname instead\n\t# of the specific Alpha model?\n\techo alpha-pc-interix\n\texit ;;\n    21064:Windows_NT:50:3)\n\techo alpha-dec-winnt3.5\n\texit ;;\n    Amiga*:UNIX_System_V:4.0:*)\n\techo m68k-unknown-sysv4\n\texit ;;\n    *:[Aa]miga[Oo][Ss]:*:*)\n\techo ${UNAME_MACHINE}-unknown-amigaos\n\texit ;;\n    *:[Mm]orph[Oo][Ss]:*:*)\n\techo ${UNAME_MACHINE}-unknown-morphos\n\texit ;;\n    *:OS/390:*:*)\n\techo i370-ibm-openedition\n\texit ;;\n    *:z/VM:*:*)\n\techo s390-ibm-zvmoe\n\texit ;;\n    *:OS400:*:*)\n\techo powerpc-ibm-os400\n\texit ;;\n    arm:RISC*:1.[012]*:*|arm:riscix:1.[012]*:*)\n\techo arm-acorn-riscix${UNAME_RELEASE}\n\texit ;;\n    arm*:riscos:*:*|arm*:RISCOS:*:*)\n\techo arm-unknown-riscos\n\texit ;;\n    SR2?01:HI-UX/MPP:*:* | SR8000:HI-UX/MPP:*:*)\n\techo hppa1.1-hitachi-hiuxmpp\n\texit ;;\n    Pyramid*:OSx*:*:* | MIS*:OSx*:*:* | MIS*:SMP_DC-OSx*:*:*)\n\t# akee@wpdis03.wpafb.af.mil (Earle F. Ake) contributed MIS and NILE.\n\tif test \"`(/bin/universe) 2>/dev/null`\" = att ; then\n\t\techo pyramid-pyramid-sysv3\n\telse\n\t\techo pyramid-pyramid-bsd\n\tfi\n\texit ;;\n    NILE*:*:*:dcosx)\n\techo pyramid-pyramid-svr4\n\texit ;;\n    DRS?6000:unix:4.0:6*)\n\techo sparc-icl-nx6\n\texit ;;\n    DRS?6000:UNIX_SV:4.2*:7* | DRS?6000:isis:4.2*:7*)\n\tcase `/usr/bin/uname -p` in\n\t    sparc) echo sparc-icl-nx7; exit ;;\n\tesac ;;\n    s390x:SunOS:*:*)\n\techo ${UNAME_MACHINE}-ibm-solaris2`echo ${UNAME_RELEASE}|sed -e 's/[^.]*//'`\n\texit ;;\n    sun4H:SunOS:5.*:*)\n\techo sparc-hal-solaris2`echo ${UNAME_RELEASE}|sed -e 's/[^.]*//'`\n\texit ;;\n    sun4*:SunOS:5.*:* | tadpole*:SunOS:5.*:*)\n\techo sparc-sun-solaris2`echo ${UNAME_RELEASE}|sed -e 's/[^.]*//'`\n\texit ;;\n    i86pc:AuroraUX:5.*:* | i86xen:AuroraUX:5.*:*)\n\techo i386-pc-auroraux${UNAME_RELEASE}\n\texit ;;\n    i86pc:SunOS:5.*:* | i86xen:SunOS:5.*:*)\n\teval $set_cc_for_build\n\tSUN_ARCH=\"i386\"\n\t# If there is a compiler, see if it is configured for 64-bit objects.\n\t# Note that the Sun cc does not turn __LP64__ into 1 like gcc does.\n\t# This test works for both compilers.\n\tif [ \"$CC_FOR_BUILD\" != 'no_compiler_found' ]; then\n\t    if (echo '#ifdef __amd64'; echo IS_64BIT_ARCH; echo '#endif') | \\\n\t\t(CCOPTS= $CC_FOR_BUILD -E - 2>/dev/null) | \\\n\t\tgrep IS_64BIT_ARCH >/dev/null\n\t    then\n\t\tSUN_ARCH=\"x86_64\"\n\t    fi\n\tfi\n\techo ${SUN_ARCH}-pc-solaris2`echo ${UNAME_RELEASE}|sed -e 's/[^.]*//'`\n\texit ;;\n    sun4*:SunOS:6*:*)\n\t# According to config.sub, this is the proper way to canonicalize\n\t# SunOS6.  Hard to guess exactly what SunOS6 will be like, but\n\t# it's likely to be more like Solaris than SunOS4.\n\techo sparc-sun-solaris3`echo ${UNAME_RELEASE}|sed -e 's/[^.]*//'`\n\texit ;;\n    sun4*:SunOS:*:*)\n\tcase \"`/usr/bin/arch -k`\" in\n\t    Series*|S4*)\n\t\tUNAME_RELEASE=`uname -v`\n\t\t;;\n\tesac\n\t# Japanese Language versions have a version number like `4.1.3-JL'.\n\techo sparc-sun-sunos`echo ${UNAME_RELEASE}|sed -e 's/-/_/'`\n\texit ;;\n    sun3*:SunOS:*:*)\n\techo m68k-sun-sunos${UNAME_RELEASE}\n\texit ;;\n    sun*:*:4.2BSD:*)\n\tUNAME_RELEASE=`(sed 1q /etc/motd | awk '{print substr($5,1,3)}') 2>/dev/null`\n\ttest \"x${UNAME_RELEASE}\" = \"x\" && UNAME_RELEASE=3\n\tcase \"`/bin/arch`\" in\n\t    sun3)\n\t\techo m68k-sun-sunos${UNAME_RELEASE}\n\t\t;;\n\t    sun4)\n\t\techo sparc-sun-sunos${UNAME_RELEASE}\n\t\t;;\n\tesac\n\texit ;;\n    aushp:SunOS:*:*)\n\techo sparc-auspex-sunos${UNAME_RELEASE}\n\texit ;;\n    # The situation for MiNT is a little confusing.  The machine name\n    # can be virtually everything (everything which is not\n    # \"atarist\" or \"atariste\" at least should have a processor\n    # > m68000).  The system name ranges from \"MiNT\" over \"FreeMiNT\"\n    # to the lowercase version \"mint\" (or \"freemint\").  Finally\n    # the system name \"TOS\" denotes a system which is actually not\n    # MiNT.  But MiNT is downward compatible to TOS, so this should\n    # be no problem.\n    atarist[e]:*MiNT:*:* | atarist[e]:*mint:*:* | atarist[e]:*TOS:*:*)\n\techo m68k-atari-mint${UNAME_RELEASE}\n\texit ;;\n    atari*:*MiNT:*:* | atari*:*mint:*:* | atarist[e]:*TOS:*:*)\n\techo m68k-atari-mint${UNAME_RELEASE}\n\texit ;;\n    *falcon*:*MiNT:*:* | *falcon*:*mint:*:* | *falcon*:*TOS:*:*)\n\techo m68k-atari-mint${UNAME_RELEASE}\n\texit ;;\n    milan*:*MiNT:*:* | milan*:*mint:*:* | *milan*:*TOS:*:*)\n\techo m68k-milan-mint${UNAME_RELEASE}\n\texit ;;\n    hades*:*MiNT:*:* | hades*:*mint:*:* | *hades*:*TOS:*:*)\n\techo m68k-hades-mint${UNAME_RELEASE}\n\texit ;;\n    *:*MiNT:*:* | *:*mint:*:* | *:*TOS:*:*)\n\techo m68k-unknown-mint${UNAME_RELEASE}\n\texit ;;\n    m68k:machten:*:*)\n\techo m68k-apple-machten${UNAME_RELEASE}\n\texit ;;\n    powerpc:machten:*:*)\n\techo powerpc-apple-machten${UNAME_RELEASE}\n\texit ;;\n    RISC*:Mach:*:*)\n\techo mips-dec-mach_bsd4.3\n\texit ;;\n    RISC*:ULTRIX:*:*)\n\techo mips-dec-ultrix${UNAME_RELEASE}\n\texit ;;\n    VAX*:ULTRIX*:*:*)\n\techo vax-dec-ultrix${UNAME_RELEASE}\n\texit ;;\n    2020:CLIX:*:* | 2430:CLIX:*:*)\n\techo clipper-intergraph-clix${UNAME_RELEASE}\n\texit ;;\n    mips:*:*:UMIPS | mips:*:*:RISCos)\n\teval $set_cc_for_build\n\tsed 's/^\t//' << EOF >$dummy.c\n#ifdef __cplusplus\n#include <stdio.h>  /* for printf() prototype */\n\tint main (int argc, char *argv[]) {\n#else\n\tint main (argc, argv) int argc; char *argv[]; {\n#endif\n\t#if defined (host_mips) && defined (MIPSEB)\n\t#if defined (SYSTYPE_SYSV)\n\t  printf (\"mips-mips-riscos%ssysv\\n\", argv[1]); exit (0);\n\t#endif\n\t#if defined (SYSTYPE_SVR4)\n\t  printf (\"mips-mips-riscos%ssvr4\\n\", argv[1]); exit (0);\n\t#endif\n\t#if defined (SYSTYPE_BSD43) || defined(SYSTYPE_BSD)\n\t  printf (\"mips-mips-riscos%sbsd\\n\", argv[1]); exit (0);\n\t#endif\n\t#endif\n\t  exit (-1);\n\t}\nEOF\n\t$CC_FOR_BUILD -o $dummy $dummy.c &&\n\t  dummyarg=`echo \"${UNAME_RELEASE}\" | sed -n 's/\\([0-9]*\\).*/\\1/p'` &&\n\t  SYSTEM_NAME=`$dummy $dummyarg` &&\n\t    { echo \"$SYSTEM_NAME\"; exit; }\n\techo mips-mips-riscos${UNAME_RELEASE}\n\texit ;;\n    Motorola:PowerMAX_OS:*:*)\n\techo powerpc-motorola-powermax\n\texit ;;\n    Motorola:*:4.3:PL8-*)\n\techo powerpc-harris-powermax\n\texit ;;\n    Night_Hawk:*:*:PowerMAX_OS | Synergy:PowerMAX_OS:*:*)\n\techo powerpc-harris-powermax\n\texit ;;\n    Night_Hawk:Power_UNIX:*:*)\n\techo powerpc-harris-powerunix\n\texit ;;\n    m88k:CX/UX:7*:*)\n\techo m88k-harris-cxux7\n\texit ;;\n    m88k:*:4*:R4*)\n\techo m88k-motorola-sysv4\n\texit ;;\n    m88k:*:3*:R3*)\n\techo m88k-motorola-sysv3\n\texit ;;\n    AViiON:dgux:*:*)\n\t# DG/UX returns AViiON for all architectures\n\tUNAME_PROCESSOR=`/usr/bin/uname -p`\n\tif [ $UNAME_PROCESSOR = mc88100 ] || [ $UNAME_PROCESSOR = mc88110 ]\n\tthen\n\t    if [ ${TARGET_BINARY_INTERFACE}x = m88kdguxelfx ] || \\\n\t       [ ${TARGET_BINARY_INTERFACE}x = x ]\n\t    then\n\t\techo m88k-dg-dgux${UNAME_RELEASE}\n\t    else\n\t\techo m88k-dg-dguxbcs${UNAME_RELEASE}\n\t    fi\n\telse\n\t    echo i586-dg-dgux${UNAME_RELEASE}\n\tfi\n\texit ;;\n    M88*:DolphinOS:*:*)\t# DolphinOS (SVR3)\n\techo m88k-dolphin-sysv3\n\texit ;;\n    M88*:*:R3*:*)\n\t# Delta 88k system running SVR3\n\techo m88k-motorola-sysv3\n\texit ;;\n    XD88*:*:*:*) # Tektronix XD88 system running UTekV (SVR3)\n\techo m88k-tektronix-sysv3\n\texit ;;\n    Tek43[0-9][0-9]:UTek:*:*) # Tektronix 4300 system running UTek (BSD)\n\techo m68k-tektronix-bsd\n\texit ;;\n    *:IRIX*:*:*)\n\techo mips-sgi-irix`echo ${UNAME_RELEASE}|sed -e 's/-/_/g'`\n\texit ;;\n    ????????:AIX?:[12].1:2)   # AIX 2.2.1 or AIX 2.1.1 is RT/PC AIX.\n\techo romp-ibm-aix     # uname -m gives an 8 hex-code CPU id\n\texit ;;               # Note that: echo \"'`uname -s`'\" gives 'AIX '\n    i*86:AIX:*:*)\n\techo i386-ibm-aix\n\texit ;;\n    ia64:AIX:*:*)\n\tif [ -x /usr/bin/oslevel ] ; then\n\t\tIBM_REV=`/usr/bin/oslevel`\n\telse\n\t\tIBM_REV=${UNAME_VERSION}.${UNAME_RELEASE}\n\tfi\n\techo ${UNAME_MACHINE}-ibm-aix${IBM_REV}\n\texit ;;\n    *:AIX:2:3)\n\tif grep bos325 /usr/include/stdio.h >/dev/null 2>&1; then\n\t\teval $set_cc_for_build\n\t\tsed 's/^\t\t//' << EOF >$dummy.c\n\t\t#include <sys/systemcfg.h>\n\n\t\tmain()\n\t\t\t{\n\t\t\tif (!__power_pc())\n\t\t\t\texit(1);\n\t\t\tputs(\"powerpc-ibm-aix3.2.5\");\n\t\t\texit(0);\n\t\t\t}\nEOF\n\t\tif $CC_FOR_BUILD -o $dummy $dummy.c && SYSTEM_NAME=`$dummy`\n\t\tthen\n\t\t\techo \"$SYSTEM_NAME\"\n\t\telse\n\t\t\techo rs6000-ibm-aix3.2.5\n\t\tfi\n\telif grep bos324 /usr/include/stdio.h >/dev/null 2>&1; then\n\t\techo rs6000-ibm-aix3.2.4\n\telse\n\t\techo rs6000-ibm-aix3.2\n\tfi\n\texit ;;\n    *:AIX:*:[4567])\n\tIBM_CPU_ID=`/usr/sbin/lsdev -C -c processor -S available | sed 1q | awk '{ print $1 }'`\n\tif /usr/sbin/lsattr -El ${IBM_CPU_ID} | grep ' POWER' >/dev/null 2>&1; then\n\t\tIBM_ARCH=rs6000\n\telse\n\t\tIBM_ARCH=powerpc\n\tfi\n\tif [ -x /usr/bin/oslevel ] ; then\n\t\tIBM_REV=`/usr/bin/oslevel`\n\telse\n\t\tIBM_REV=${UNAME_VERSION}.${UNAME_RELEASE}\n\tfi\n\techo ${IBM_ARCH}-ibm-aix${IBM_REV}\n\texit ;;\n    *:AIX:*:*)\n\techo rs6000-ibm-aix\n\texit ;;\n    ibmrt:4.4BSD:*|romp-ibm:BSD:*)\n\techo romp-ibm-bsd4.4\n\texit ;;\n    ibmrt:*BSD:*|romp-ibm:BSD:*)            # covers RT/PC BSD and\n\techo romp-ibm-bsd${UNAME_RELEASE}   # 4.3 with uname added to\n\texit ;;                             # report: romp-ibm BSD 4.3\n    *:BOSX:*:*)\n\techo rs6000-bull-bosx\n\texit ;;\n    DPX/2?00:B.O.S.:*:*)\n\techo m68k-bull-sysv3\n\texit ;;\n    9000/[34]??:4.3bsd:1.*:*)\n\techo m68k-hp-bsd\n\texit ;;\n    hp300:4.4BSD:*:* | 9000/[34]??:4.3bsd:2.*:*)\n\techo m68k-hp-bsd4.4\n\texit ;;\n    9000/[34678]??:HP-UX:*:*)\n\tHPUX_REV=`echo ${UNAME_RELEASE}|sed -e 's/[^.]*.[0B]*//'`\n\tcase \"${UNAME_MACHINE}\" in\n\t    9000/31? )            HP_ARCH=m68000 ;;\n\t    9000/[34]?? )         HP_ARCH=m68k ;;\n\t    9000/[678][0-9][0-9])\n\t\tif [ -x /usr/bin/getconf ]; then\n\t\t    sc_cpu_version=`/usr/bin/getconf SC_CPU_VERSION 2>/dev/null`\n\t\t    sc_kernel_bits=`/usr/bin/getconf SC_KERNEL_BITS 2>/dev/null`\n\t\t    case \"${sc_cpu_version}\" in\n\t\t      523) HP_ARCH=\"hppa1.0\" ;; # CPU_PA_RISC1_0\n\t\t      528) HP_ARCH=\"hppa1.1\" ;; # CPU_PA_RISC1_1\n\t\t      532)                      # CPU_PA_RISC2_0\n\t\t\tcase \"${sc_kernel_bits}\" in\n\t\t\t  32) HP_ARCH=\"hppa2.0n\" ;;\n\t\t\t  64) HP_ARCH=\"hppa2.0w\" ;;\n\t\t\t  '') HP_ARCH=\"hppa2.0\" ;;   # HP-UX 10.20\n\t\t\tesac ;;\n\t\t    esac\n\t\tfi\n\t\tif [ \"${HP_ARCH}\" = \"\" ]; then\n\t\t    eval $set_cc_for_build\n\t\t    sed 's/^\t\t//' << EOF >$dummy.c\n\n\t\t#define _HPUX_SOURCE\n\t\t#include <stdlib.h>\n\t\t#include <unistd.h>\n\n\t\tint main ()\n\t\t{\n\t\t#if defined(_SC_KERNEL_BITS)\n\t\t    long bits = sysconf(_SC_KERNEL_BITS);\n\t\t#endif\n\t\t    long cpu  = sysconf (_SC_CPU_VERSION);\n\n\t\t    switch (cpu)\n\t\t\t{\n\t\t\tcase CPU_PA_RISC1_0: puts (\"hppa1.0\"); break;\n\t\t\tcase CPU_PA_RISC1_1: puts (\"hppa1.1\"); break;\n\t\t\tcase CPU_PA_RISC2_0:\n\t\t#if defined(_SC_KERNEL_BITS)\n\t\t\t    switch (bits)\n\t\t\t\t{\n\t\t\t\tcase 64: puts (\"hppa2.0w\"); break;\n\t\t\t\tcase 32: puts (\"hppa2.0n\"); break;\n\t\t\t\tdefault: puts (\"hppa2.0\"); break;\n\t\t\t\t} break;\n\t\t#else  /* !defined(_SC_KERNEL_BITS) */\n\t\t\t    puts (\"hppa2.0\"); break;\n\t\t#endif\n\t\t\tdefault: puts (\"hppa1.0\"); break;\n\t\t\t}\n\t\t    exit (0);\n\t\t}\nEOF\n\t\t    (CCOPTS= $CC_FOR_BUILD -o $dummy $dummy.c 2>/dev/null) && HP_ARCH=`$dummy`\n\t\t    test -z \"$HP_ARCH\" && HP_ARCH=hppa\n\t\tfi ;;\n\tesac\n\tif [ ${HP_ARCH} = \"hppa2.0w\" ]\n\tthen\n\t    eval $set_cc_for_build\n\n\t    # hppa2.0w-hp-hpux* has a 64-bit kernel and a compiler generating\n\t    # 32-bit code.  hppa64-hp-hpux* has the same kernel and a compiler\n\t    # generating 64-bit code.  GNU and HP use different nomenclature:\n\t    #\n\t    # $ CC_FOR_BUILD=cc ./config.guess\n\t    # => hppa2.0w-hp-hpux11.23\n\t    # $ CC_FOR_BUILD=\"cc +DA2.0w\" ./config.guess\n\t    # => hppa64-hp-hpux11.23\n\n\t    if echo __LP64__ | (CCOPTS= $CC_FOR_BUILD -E - 2>/dev/null) |\n\t\tgrep -q __LP64__\n\t    then\n\t\tHP_ARCH=\"hppa2.0w\"\n\t    else\n\t\tHP_ARCH=\"hppa64\"\n\t    fi\n\tfi\n\techo ${HP_ARCH}-hp-hpux${HPUX_REV}\n\texit ;;\n    ia64:HP-UX:*:*)\n\tHPUX_REV=`echo ${UNAME_RELEASE}|sed -e 's/[^.]*.[0B]*//'`\n\techo ia64-hp-hpux${HPUX_REV}\n\texit ;;\n    3050*:HI-UX:*:*)\n\teval $set_cc_for_build\n\tsed 's/^\t//' << EOF >$dummy.c\n\t#include <unistd.h>\n\tint\n\tmain ()\n\t{\n\t  long cpu = sysconf (_SC_CPU_VERSION);\n\t  /* The order matters, because CPU_IS_HP_MC68K erroneously returns\n\t     true for CPU_PA_RISC1_0.  CPU_IS_PA_RISC returns correct\n\t     results, however.  */\n\t  if (CPU_IS_PA_RISC (cpu))\n\t    {\n\t      switch (cpu)\n\t\t{\n\t\t  case CPU_PA_RISC1_0: puts (\"hppa1.0-hitachi-hiuxwe2\"); break;\n\t\t  case CPU_PA_RISC1_1: puts (\"hppa1.1-hitachi-hiuxwe2\"); break;\n\t\t  case CPU_PA_RISC2_0: puts (\"hppa2.0-hitachi-hiuxwe2\"); break;\n\t\t  default: puts (\"hppa-hitachi-hiuxwe2\"); break;\n\t\t}\n\t    }\n\t  else if (CPU_IS_HP_MC68K (cpu))\n\t    puts (\"m68k-hitachi-hiuxwe2\");\n\t  else puts (\"unknown-hitachi-hiuxwe2\");\n\t  exit (0);\n\t}\nEOF\n\t$CC_FOR_BUILD -o $dummy $dummy.c && SYSTEM_NAME=`$dummy` &&\n\t\t{ echo \"$SYSTEM_NAME\"; exit; }\n\techo unknown-hitachi-hiuxwe2\n\texit ;;\n    9000/7??:4.3bsd:*:* | 9000/8?[79]:4.3bsd:*:* )\n\techo hppa1.1-hp-bsd\n\texit ;;\n    9000/8??:4.3bsd:*:*)\n\techo hppa1.0-hp-bsd\n\texit ;;\n    *9??*:MPE/iX:*:* | *3000*:MPE/iX:*:*)\n\techo hppa1.0-hp-mpeix\n\texit ;;\n    hp7??:OSF1:*:* | hp8?[79]:OSF1:*:* )\n\techo hppa1.1-hp-osf\n\texit ;;\n    hp8??:OSF1:*:*)\n\techo hppa1.0-hp-osf\n\texit ;;\n    i*86:OSF1:*:*)\n\tif [ -x /usr/sbin/sysversion ] ; then\n\t    echo ${UNAME_MACHINE}-unknown-osf1mk\n\telse\n\t    echo ${UNAME_MACHINE}-unknown-osf1\n\tfi\n\texit ;;\n    parisc*:Lites*:*:*)\n\techo hppa1.1-hp-lites\n\texit ;;\n    C1*:ConvexOS:*:* | convex:ConvexOS:C1*:*)\n\techo c1-convex-bsd\n\texit ;;\n    C2*:ConvexOS:*:* | convex:ConvexOS:C2*:*)\n\tif getsysinfo -f scalar_acc\n\tthen echo c32-convex-bsd\n\telse echo c2-convex-bsd\n\tfi\n\texit ;;\n    C34*:ConvexOS:*:* | convex:ConvexOS:C34*:*)\n\techo c34-convex-bsd\n\texit ;;\n    C38*:ConvexOS:*:* | convex:ConvexOS:C38*:*)\n\techo c38-convex-bsd\n\texit ;;\n    C4*:ConvexOS:*:* | convex:ConvexOS:C4*:*)\n\techo c4-convex-bsd\n\texit ;;\n    CRAY*Y-MP:*:*:*)\n\techo ymp-cray-unicos${UNAME_RELEASE} | sed -e 's/\\.[^.]*$/.X/'\n\texit ;;\n    CRAY*[A-Z]90:*:*:*)\n\techo ${UNAME_MACHINE}-cray-unicos${UNAME_RELEASE} \\\n\t| sed -e 's/CRAY.*\\([A-Z]90\\)/\\1/' \\\n\t      -e y/ABCDEFGHIJKLMNOPQRSTUVWXYZ/abcdefghijklmnopqrstuvwxyz/ \\\n\t      -e 's/\\.[^.]*$/.X/'\n\texit ;;\n    CRAY*TS:*:*:*)\n\techo t90-cray-unicos${UNAME_RELEASE} | sed -e 's/\\.[^.]*$/.X/'\n\texit ;;\n    CRAY*T3E:*:*:*)\n\techo alphaev5-cray-unicosmk${UNAME_RELEASE} | sed -e 's/\\.[^.]*$/.X/'\n\texit ;;\n    CRAY*SV1:*:*:*)\n\techo sv1-cray-unicos${UNAME_RELEASE} | sed -e 's/\\.[^.]*$/.X/'\n\texit ;;\n    *:UNICOS/mp:*:*)\n\techo craynv-cray-unicosmp${UNAME_RELEASE} | sed -e 's/\\.[^.]*$/.X/'\n\texit ;;\n    F30[01]:UNIX_System_V:*:* | F700:UNIX_System_V:*:*)\n\tFUJITSU_PROC=`uname -m | tr 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' 'abcdefghijklmnopqrstuvwxyz'`\n\tFUJITSU_SYS=`uname -p | tr 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' 'abcdefghijklmnopqrstuvwxyz' | sed -e 's/\\///'`\n\tFUJITSU_REL=`echo ${UNAME_RELEASE} | sed -e 's/ /_/'`\n\techo \"${FUJITSU_PROC}-fujitsu-${FUJITSU_SYS}${FUJITSU_REL}\"\n\texit ;;\n    5000:UNIX_System_V:4.*:*)\n\tFUJITSU_SYS=`uname -p | tr 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' 'abcdefghijklmnopqrstuvwxyz' | sed -e 's/\\///'`\n\tFUJITSU_REL=`echo ${UNAME_RELEASE} | tr 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' 'abcdefghijklmnopqrstuvwxyz' | sed -e 's/ /_/'`\n\techo \"sparc-fujitsu-${FUJITSU_SYS}${FUJITSU_REL}\"\n\texit ;;\n    i*86:BSD/386:*:* | i*86:BSD/OS:*:* | *:Ascend\\ Embedded/OS:*:*)\n\techo ${UNAME_MACHINE}-pc-bsdi${UNAME_RELEASE}\n\texit ;;\n    sparc*:BSD/OS:*:*)\n\techo sparc-unknown-bsdi${UNAME_RELEASE}\n\texit ;;\n    *:BSD/OS:*:*)\n\techo ${UNAME_MACHINE}-unknown-bsdi${UNAME_RELEASE}\n\texit ;;\n    *:FreeBSD:*:*)\n\tUNAME_PROCESSOR=`/usr/bin/uname -p`\n\tcase ${UNAME_PROCESSOR} in\n\t    amd64)\n\t\techo x86_64-unknown-freebsd`echo ${UNAME_RELEASE}|sed -e 's/[-(].*//'` ;;\n\t    *)\n\t\techo ${UNAME_PROCESSOR}-unknown-freebsd`echo ${UNAME_RELEASE}|sed -e 's/[-(].*//'` ;;\n\tesac\n\texit ;;\n    i*:CYGWIN*:*)\n\techo ${UNAME_MACHINE}-pc-cygwin\n\texit ;;\n    *:MINGW64*:*)\n\techo ${UNAME_MACHINE}-pc-mingw64\n\texit ;;\n    *:MINGW*:*)\n\techo ${UNAME_MACHINE}-pc-mingw32\n\texit ;;\n    i*:MSYS*:*)\n\techo ${UNAME_MACHINE}-pc-msys\n\texit ;;\n    i*:windows32*:*)\n\t# uname -m includes \"-pc\" on this system.\n\techo ${UNAME_MACHINE}-mingw32\n\texit ;;\n    i*:PW*:*)\n\techo ${UNAME_MACHINE}-pc-pw32\n\texit ;;\n    *:Interix*:*)\n\tcase ${UNAME_MACHINE} in\n\t    x86)\n\t\techo i586-pc-interix${UNAME_RELEASE}\n\t\texit ;;\n\t    authenticamd | genuineintel | EM64T)\n\t\techo x86_64-unknown-interix${UNAME_RELEASE}\n\t\texit ;;\n\t    IA64)\n\t\techo ia64-unknown-interix${UNAME_RELEASE}\n\t\texit ;;\n\tesac ;;\n    [345]86:Windows_95:* | [345]86:Windows_98:* | [345]86:Windows_NT:*)\n\techo i${UNAME_MACHINE}-pc-mks\n\texit ;;\n    8664:Windows_NT:*)\n\techo x86_64-pc-mks\n\texit ;;\n    i*:Windows_NT*:* | Pentium*:Windows_NT*:*)\n\t# How do we know it's Interix rather than the generic POSIX subsystem?\n\t# It also conflicts with pre-2.0 versions of AT&T UWIN. Should we\n\t# UNAME_MACHINE based on the output of uname instead of i386?\n\techo i586-pc-interix\n\texit ;;\n    i*:UWIN*:*)\n\techo ${UNAME_MACHINE}-pc-uwin\n\texit ;;\n    amd64:CYGWIN*:*:* | x86_64:CYGWIN*:*:*)\n\techo x86_64-unknown-cygwin\n\texit ;;\n    p*:CYGWIN*:*)\n\techo powerpcle-unknown-cygwin\n\texit ;;\n    prep*:SunOS:5.*:*)\n\techo powerpcle-unknown-solaris2`echo ${UNAME_RELEASE}|sed -e 's/[^.]*//'`\n\texit ;;\n    *:GNU:*:*)\n\t# the GNU system\n\techo `echo ${UNAME_MACHINE}|sed -e 's,[-/].*$,,'`-unknown-${LIBC}`echo ${UNAME_RELEASE}|sed -e 's,/.*$,,'`\n\texit ;;\n    *:GNU/*:*:*)\n\t# other systems with GNU libc and userland\n\techo ${UNAME_MACHINE}-unknown-`echo ${UNAME_SYSTEM} | sed 's,^[^/]*/,,' | tr '[A-Z]' '[a-z]'``echo ${UNAME_RELEASE}|sed -e 's/[-(].*//'`-${LIBC}\n\texit ;;\n    i*86:Minix:*:*)\n\techo ${UNAME_MACHINE}-pc-minix\n\texit ;;\n    aarch64:Linux:*:*)\n\techo ${UNAME_MACHINE}-unknown-linux-${LIBC}\n\texit ;;\n    aarch64_be:Linux:*:*)\n\tUNAME_MACHINE=aarch64_be\n\techo ${UNAME_MACHINE}-unknown-linux-${LIBC}\n\texit ;;\n    alpha:Linux:*:*)\n\tcase `sed -n '/^cpu model/s/^.*: \\(.*\\)/\\1/p' < /proc/cpuinfo` in\n\t  EV5)   UNAME_MACHINE=alphaev5 ;;\n\t  EV56)  UNAME_MACHINE=alphaev56 ;;\n\t  PCA56) UNAME_MACHINE=alphapca56 ;;\n\t  PCA57) UNAME_MACHINE=alphapca56 ;;\n\t  EV6)   UNAME_MACHINE=alphaev6 ;;\n\t  EV67)  UNAME_MACHINE=alphaev67 ;;\n\t  EV68*) UNAME_MACHINE=alphaev68 ;;\n\tesac\n\tobjdump --private-headers /bin/sh | grep -q ld.so.1\n\tif test \"$?\" = 0 ; then LIBC=\"gnulibc1\" ; fi\n\techo ${UNAME_MACHINE}-unknown-linux-${LIBC}\n\texit ;;\n    arc:Linux:*:* | arceb:Linux:*:*)\n\techo ${UNAME_MACHINE}-unknown-linux-${LIBC}\n\texit ;;\n    arm*:Linux:*:*)\n\teval $set_cc_for_build\n\tif echo __ARM_EABI__ | $CC_FOR_BUILD -E - 2>/dev/null \\\n\t    | grep -q __ARM_EABI__\n\tthen\n\t    echo ${UNAME_MACHINE}-unknown-linux-${LIBC}\n\telse\n\t    if echo __ARM_PCS_VFP | $CC_FOR_BUILD -E - 2>/dev/null \\\n\t\t| grep -q __ARM_PCS_VFP\n\t    then\n\t\techo ${UNAME_MACHINE}-unknown-linux-${LIBC}eabi\n\t    else\n\t\techo ${UNAME_MACHINE}-unknown-linux-${LIBC}eabihf\n\t    fi\n\tfi\n\texit ;;\n    avr32*:Linux:*:*)\n\techo ${UNAME_MACHINE}-unknown-linux-${LIBC}\n\texit ;;\n    cris:Linux:*:*)\n\techo ${UNAME_MACHINE}-axis-linux-${LIBC}\n\texit ;;\n    crisv32:Linux:*:*)\n\techo ${UNAME_MACHINE}-axis-linux-${LIBC}\n\texit ;;\n    frv:Linux:*:*)\n\techo ${UNAME_MACHINE}-unknown-linux-${LIBC}\n\texit ;;\n    hexagon:Linux:*:*)\n\techo ${UNAME_MACHINE}-unknown-linux-${LIBC}\n\texit ;;\n    i*86:Linux:*:*)\n\techo ${UNAME_MACHINE}-pc-linux-${LIBC}\n\texit ;;\n    ia64:Linux:*:*)\n\techo ${UNAME_MACHINE}-unknown-linux-${LIBC}\n\texit ;;\n    m32r*:Linux:*:*)\n\techo ${UNAME_MACHINE}-unknown-linux-${LIBC}\n\texit ;;\n    m68*:Linux:*:*)\n\techo ${UNAME_MACHINE}-unknown-linux-${LIBC}\n\texit ;;\n    mips:Linux:*:* | mips64:Linux:*:*)\n\teval $set_cc_for_build\n\tsed 's/^\t//' << EOF >$dummy.c\n\t#undef CPU\n\t#undef ${UNAME_MACHINE}\n\t#undef ${UNAME_MACHINE}el\n\t#if defined(__MIPSEL__) || defined(__MIPSEL) || defined(_MIPSEL) || defined(MIPSEL)\n\tCPU=${UNAME_MACHINE}el\n\t#else\n\t#if defined(__MIPSEB__) || defined(__MIPSEB) || defined(_MIPSEB) || defined(MIPSEB)\n\tCPU=${UNAME_MACHINE}\n\t#else\n\tCPU=\n\t#endif\n\t#endif\nEOF\n\teval `$CC_FOR_BUILD -E $dummy.c 2>/dev/null | grep '^CPU'`\n\ttest x\"${CPU}\" != x && { echo \"${CPU}-unknown-linux-${LIBC}\"; exit; }\n\t;;\n    or1k:Linux:*:*)\n\techo ${UNAME_MACHINE}-unknown-linux-${LIBC}\n\texit ;;\n    or32:Linux:*:*)\n\techo ${UNAME_MACHINE}-unknown-linux-${LIBC}\n\texit ;;\n    padre:Linux:*:*)\n\techo sparc-unknown-linux-${LIBC}\n\texit ;;\n    parisc64:Linux:*:* | hppa64:Linux:*:*)\n\techo hppa64-unknown-linux-${LIBC}\n\texit ;;\n    parisc:Linux:*:* | hppa:Linux:*:*)\n\t# Look for CPU level\n\tcase `grep '^cpu[^a-z]*:' /proc/cpuinfo 2>/dev/null | cut -d' ' -f2` in\n\t  PA7*) echo hppa1.1-unknown-linux-${LIBC} ;;\n\t  PA8*) echo hppa2.0-unknown-linux-${LIBC} ;;\n\t  *)    echo hppa-unknown-linux-${LIBC} ;;\n\tesac\n\texit ;;\n    ppc64:Linux:*:*)\n\techo powerpc64-unknown-linux-${LIBC}\n\texit ;;\n    ppc:Linux:*:*)\n\techo powerpc-unknown-linux-${LIBC}\n\texit ;;\n    ppc64le:Linux:*:*)\n\techo powerpc64le-unknown-linux-${LIBC}\n\texit ;;\n    ppcle:Linux:*:*)\n\techo powerpcle-unknown-linux-${LIBC}\n\texit ;;\n    s390:Linux:*:* | s390x:Linux:*:*)\n\techo ${UNAME_MACHINE}-ibm-linux-${LIBC}\n\texit ;;\n    sh64*:Linux:*:*)\n\techo ${UNAME_MACHINE}-unknown-linux-${LIBC}\n\texit ;;\n    sh*:Linux:*:*)\n\techo ${UNAME_MACHINE}-unknown-linux-${LIBC}\n\texit ;;\n    sparc:Linux:*:* | sparc64:Linux:*:*)\n\techo ${UNAME_MACHINE}-unknown-linux-${LIBC}\n\texit ;;\n    tile*:Linux:*:*)\n\techo ${UNAME_MACHINE}-unknown-linux-${LIBC}\n\texit ;;\n    vax:Linux:*:*)\n\techo ${UNAME_MACHINE}-dec-linux-${LIBC}\n\texit ;;\n    x86_64:Linux:*:*)\n\techo ${UNAME_MACHINE}-unknown-linux-${LIBC}\n\texit ;;\n    xtensa*:Linux:*:*)\n\techo ${UNAME_MACHINE}-unknown-linux-${LIBC}\n\texit ;;\n    i*86:DYNIX/ptx:4*:*)\n\t# ptx 4.0 does uname -s correctly, with DYNIX/ptx in there.\n\t# earlier versions are messed up and put the nodename in both\n\t# sysname and nodename.\n\techo i386-sequent-sysv4\n\texit ;;\n    i*86:UNIX_SV:4.2MP:2.*)\n\t# Unixware is an offshoot of SVR4, but it has its own version\n\t# number series starting with 2...\n\t# I am not positive that other SVR4 systems won't match this,\n\t# I just have to hope.  -- rms.\n\t# Use sysv4.2uw... so that sysv4* matches it.\n\techo ${UNAME_MACHINE}-pc-sysv4.2uw${UNAME_VERSION}\n\texit ;;\n    i*86:OS/2:*:*)\n\t# If we were able to find `uname', then EMX Unix compatibility\n\t# is probably installed.\n\techo ${UNAME_MACHINE}-pc-os2-emx\n\texit ;;\n    i*86:XTS-300:*:STOP)\n\techo ${UNAME_MACHINE}-unknown-stop\n\texit ;;\n    i*86:atheos:*:*)\n\techo ${UNAME_MACHINE}-unknown-atheos\n\texit ;;\n    i*86:syllable:*:*)\n\techo ${UNAME_MACHINE}-pc-syllable\n\texit ;;\n    i*86:LynxOS:2.*:* | i*86:LynxOS:3.[01]*:* | i*86:LynxOS:4.[02]*:*)\n\techo i386-unknown-lynxos${UNAME_RELEASE}\n\texit ;;\n    i*86:*DOS:*:*)\n\techo ${UNAME_MACHINE}-pc-msdosdjgpp\n\texit ;;\n    i*86:*:4.*:* | i*86:SYSTEM_V:4.*:*)\n\tUNAME_REL=`echo ${UNAME_RELEASE} | sed 's/\\/MP$//'`\n\tif grep Novell /usr/include/link.h >/dev/null 2>/dev/null; then\n\t\techo ${UNAME_MACHINE}-univel-sysv${UNAME_REL}\n\telse\n\t\techo ${UNAME_MACHINE}-pc-sysv${UNAME_REL}\n\tfi\n\texit ;;\n    i*86:*:5:[678]*)\n\t# UnixWare 7.x, OpenUNIX and OpenServer 6.\n\tcase `/bin/uname -X | grep \"^Machine\"` in\n\t    *486*)\t     UNAME_MACHINE=i486 ;;\n\t    *Pentium)\t     UNAME_MACHINE=i586 ;;\n\t    *Pent*|*Celeron) UNAME_MACHINE=i686 ;;\n\tesac\n\techo ${UNAME_MACHINE}-unknown-sysv${UNAME_RELEASE}${UNAME_SYSTEM}${UNAME_VERSION}\n\texit ;;\n    i*86:*:3.2:*)\n\tif test -f /usr/options/cb.name; then\n\t\tUNAME_REL=`sed -n 's/.*Version //p' </usr/options/cb.name`\n\t\techo ${UNAME_MACHINE}-pc-isc$UNAME_REL\n\telif /bin/uname -X 2>/dev/null >/dev/null ; then\n\t\tUNAME_REL=`(/bin/uname -X|grep Release|sed -e 's/.*= //')`\n\t\t(/bin/uname -X|grep i80486 >/dev/null) && UNAME_MACHINE=i486\n\t\t(/bin/uname -X|grep '^Machine.*Pentium' >/dev/null) \\\n\t\t\t&& UNAME_MACHINE=i586\n\t\t(/bin/uname -X|grep '^Machine.*Pent *II' >/dev/null) \\\n\t\t\t&& UNAME_MACHINE=i686\n\t\t(/bin/uname -X|grep '^Machine.*Pentium Pro' >/dev/null) \\\n\t\t\t&& UNAME_MACHINE=i686\n\t\techo ${UNAME_MACHINE}-pc-sco$UNAME_REL\n\telse\n\t\techo ${UNAME_MACHINE}-pc-sysv32\n\tfi\n\texit ;;\n    pc:*:*:*)\n\t# Left here for compatibility:\n\t# uname -m prints for DJGPP always 'pc', but it prints nothing about\n\t# the processor, so we play safe by assuming i586.\n\t# Note: whatever this is, it MUST be the same as what config.sub\n\t# prints for the \"djgpp\" host, or else GDB configury will decide that\n\t# this is a cross-build.\n\techo i586-pc-msdosdjgpp\n\texit ;;\n    Intel:Mach:3*:*)\n\techo i386-pc-mach3\n\texit ;;\n    paragon:*:*:*)\n\techo i860-intel-osf1\n\texit ;;\n    i860:*:4.*:*) # i860-SVR4\n\tif grep Stardent /usr/include/sys/uadmin.h >/dev/null 2>&1 ; then\n\t  echo i860-stardent-sysv${UNAME_RELEASE} # Stardent Vistra i860-SVR4\n\telse # Add other i860-SVR4 vendors below as they are discovered.\n\t  echo i860-unknown-sysv${UNAME_RELEASE}  # Unknown i860-SVR4\n\tfi\n\texit ;;\n    mini*:CTIX:SYS*5:*)\n\t# \"miniframe\"\n\techo m68010-convergent-sysv\n\texit ;;\n    mc68k:UNIX:SYSTEM5:3.51m)\n\techo m68k-convergent-sysv\n\texit ;;\n    M680?0:D-NIX:5.3:*)\n\techo m68k-diab-dnix\n\texit ;;\n    M68*:*:R3V[5678]*:*)\n\ttest -r /sysV68 && { echo 'm68k-motorola-sysv'; exit; } ;;\n    3[345]??:*:4.0:3.0 | 3[34]??A:*:4.0:3.0 | 3[34]??,*:*:4.0:3.0 | 3[34]??/*:*:4.0:3.0 | 4400:*:4.0:3.0 | 4850:*:4.0:3.0 | SKA40:*:4.0:3.0 | SDS2:*:4.0:3.0 | SHG2:*:4.0:3.0 | S7501*:*:4.0:3.0)\n\tOS_REL=''\n\ttest -r /etc/.relid \\\n\t&& OS_REL=.`sed -n 's/[^ ]* [^ ]* \\([0-9][0-9]\\).*/\\1/p' < /etc/.relid`\n\t/bin/uname -p 2>/dev/null | grep 86 >/dev/null \\\n\t  && { echo i486-ncr-sysv4.3${OS_REL}; exit; }\n\t/bin/uname -p 2>/dev/null | /bin/grep entium >/dev/null \\\n\t  && { echo i586-ncr-sysv4.3${OS_REL}; exit; } ;;\n    3[34]??:*:4.0:* | 3[34]??,*:*:4.0:*)\n\t/bin/uname -p 2>/dev/null | grep 86 >/dev/null \\\n\t  && { echo i486-ncr-sysv4; exit; } ;;\n    NCR*:*:4.2:* | MPRAS*:*:4.2:*)\n\tOS_REL='.3'\n\ttest -r /etc/.relid \\\n\t    && OS_REL=.`sed -n 's/[^ ]* [^ ]* \\([0-9][0-9]\\).*/\\1/p' < /etc/.relid`\n\t/bin/uname -p 2>/dev/null | grep 86 >/dev/null \\\n\t    && { echo i486-ncr-sysv4.3${OS_REL}; exit; }\n\t/bin/uname -p 2>/dev/null | /bin/grep entium >/dev/null \\\n\t    && { echo i586-ncr-sysv4.3${OS_REL}; exit; }\n\t/bin/uname -p 2>/dev/null | /bin/grep pteron >/dev/null \\\n\t    && { echo i586-ncr-sysv4.3${OS_REL}; exit; } ;;\n    m68*:LynxOS:2.*:* | m68*:LynxOS:3.0*:*)\n\techo m68k-unknown-lynxos${UNAME_RELEASE}\n\texit ;;\n    mc68030:UNIX_System_V:4.*:*)\n\techo m68k-atari-sysv4\n\texit ;;\n    TSUNAMI:LynxOS:2.*:*)\n\techo sparc-unknown-lynxos${UNAME_RELEASE}\n\texit ;;\n    rs6000:LynxOS:2.*:*)\n\techo rs6000-unknown-lynxos${UNAME_RELEASE}\n\texit ;;\n    PowerPC:LynxOS:2.*:* | PowerPC:LynxOS:3.[01]*:* | PowerPC:LynxOS:4.[02]*:*)\n\techo powerpc-unknown-lynxos${UNAME_RELEASE}\n\texit ;;\n    SM[BE]S:UNIX_SV:*:*)\n\techo mips-dde-sysv${UNAME_RELEASE}\n\texit ;;\n    RM*:ReliantUNIX-*:*:*)\n\techo mips-sni-sysv4\n\texit ;;\n    RM*:SINIX-*:*:*)\n\techo mips-sni-sysv4\n\texit ;;\n    *:SINIX-*:*:*)\n\tif uname -p 2>/dev/null >/dev/null ; then\n\t\tUNAME_MACHINE=`(uname -p) 2>/dev/null`\n\t\techo ${UNAME_MACHINE}-sni-sysv4\n\telse\n\t\techo ns32k-sni-sysv\n\tfi\n\texit ;;\n    PENTIUM:*:4.0*:*)\t# Unisys `ClearPath HMP IX 4000' SVR4/MP effort\n\t\t\t# says <Richard.M.Bartel@ccMail.Census.GOV>\n\techo i586-unisys-sysv4\n\texit ;;\n    *:UNIX_System_V:4*:FTX*)\n\t# From Gerald Hewes <hewes@openmarket.com>.\n\t# How about differentiating between stratus architectures? -djm\n\techo hppa1.1-stratus-sysv4\n\texit ;;\n    *:*:*:FTX*)\n\t# From seanf@swdc.stratus.com.\n\techo i860-stratus-sysv4\n\texit ;;\n    i*86:VOS:*:*)\n\t# From Paul.Green@stratus.com.\n\techo ${UNAME_MACHINE}-stratus-vos\n\texit ;;\n    *:VOS:*:*)\n\t# From Paul.Green@stratus.com.\n\techo hppa1.1-stratus-vos\n\texit ;;\n    mc68*:A/UX:*:*)\n\techo m68k-apple-aux${UNAME_RELEASE}\n\texit ;;\n    news*:NEWS-OS:6*:*)\n\techo mips-sony-newsos6\n\texit ;;\n    R[34]000:*System_V*:*:* | R4000:UNIX_SYSV:*:* | R*000:UNIX_SV:*:*)\n\tif [ -d /usr/nec ]; then\n\t\techo mips-nec-sysv${UNAME_RELEASE}\n\telse\n\t\techo mips-unknown-sysv${UNAME_RELEASE}\n\tfi\n\texit ;;\n    BeBox:BeOS:*:*)\t# BeOS running on hardware made by Be, PPC only.\n\techo powerpc-be-beos\n\texit ;;\n    BeMac:BeOS:*:*)\t# BeOS running on Mac or Mac clone, PPC only.\n\techo powerpc-apple-beos\n\texit ;;\n    BePC:BeOS:*:*)\t# BeOS running on Intel PC compatible.\n\techo i586-pc-beos\n\texit ;;\n    BePC:Haiku:*:*)\t# Haiku running on Intel PC compatible.\n\techo i586-pc-haiku\n\texit ;;\n    x86_64:Haiku:*:*)\n\techo x86_64-unknown-haiku\n\texit ;;\n    SX-4:SUPER-UX:*:*)\n\techo sx4-nec-superux${UNAME_RELEASE}\n\texit ;;\n    SX-5:SUPER-UX:*:*)\n\techo sx5-nec-superux${UNAME_RELEASE}\n\texit ;;\n    SX-6:SUPER-UX:*:*)\n\techo sx6-nec-superux${UNAME_RELEASE}\n\texit ;;\n    SX-7:SUPER-UX:*:*)\n\techo sx7-nec-superux${UNAME_RELEASE}\n\texit ;;\n    SX-8:SUPER-UX:*:*)\n\techo sx8-nec-superux${UNAME_RELEASE}\n\texit ;;\n    SX-8R:SUPER-UX:*:*)\n\techo sx8r-nec-superux${UNAME_RELEASE}\n\texit ;;\n    Power*:Rhapsody:*:*)\n\techo powerpc-apple-rhapsody${UNAME_RELEASE}\n\texit ;;\n    *:Rhapsody:*:*)\n\techo ${UNAME_MACHINE}-apple-rhapsody${UNAME_RELEASE}\n\texit ;;\n    *:Darwin:*:*)\n\tUNAME_PROCESSOR=`uname -p` || UNAME_PROCESSOR=unknown\n\teval $set_cc_for_build\n\tif test \"$UNAME_PROCESSOR\" = unknown ; then\n\t    UNAME_PROCESSOR=powerpc\n\tfi\n\tif [ \"$CC_FOR_BUILD\" != 'no_compiler_found' ]; then\n\t    if (echo '#ifdef __LP64__'; echo IS_64BIT_ARCH; echo '#endif') | \\\n\t\t(CCOPTS= $CC_FOR_BUILD -E - 2>/dev/null) | \\\n\t\tgrep IS_64BIT_ARCH >/dev/null\n\t    then\n\t\tcase $UNAME_PROCESSOR in\n\t\t    i386) UNAME_PROCESSOR=x86_64 ;;\n\t\t    powerpc) UNAME_PROCESSOR=powerpc64 ;;\n\t\tesac\n\t    fi\n\tfi\n\techo ${UNAME_PROCESSOR}-apple-darwin${UNAME_RELEASE}\n\texit ;;\n    *:procnto*:*:* | *:QNX:[0123456789]*:*)\n\tUNAME_PROCESSOR=`uname -p`\n\tif test \"$UNAME_PROCESSOR\" = \"x86\"; then\n\t\tUNAME_PROCESSOR=i386\n\t\tUNAME_MACHINE=pc\n\tfi\n\techo ${UNAME_PROCESSOR}-${UNAME_MACHINE}-nto-qnx${UNAME_RELEASE}\n\texit ;;\n    *:QNX:*:4*)\n\techo i386-pc-qnx\n\texit ;;\n    NEO-?:NONSTOP_KERNEL:*:*)\n\techo neo-tandem-nsk${UNAME_RELEASE}\n\texit ;;\n    NSE-*:NONSTOP_KERNEL:*:*)\n\techo nse-tandem-nsk${UNAME_RELEASE}\n\texit ;;\n    NSR-?:NONSTOP_KERNEL:*:*)\n\techo nsr-tandem-nsk${UNAME_RELEASE}\n\texit ;;\n    *:NonStop-UX:*:*)\n\techo mips-compaq-nonstopux\n\texit ;;\n    BS2000:POSIX*:*:*)\n\techo bs2000-siemens-sysv\n\texit ;;\n    DS/*:UNIX_System_V:*:*)\n\techo ${UNAME_MACHINE}-${UNAME_SYSTEM}-${UNAME_RELEASE}\n\texit ;;\n    *:Plan9:*:*)\n\t# \"uname -m\" is not consistent, so use $cputype instead. 386\n\t# is converted to i386 for consistency with other x86\n\t# operating systems.\n\tif test \"$cputype\" = \"386\"; then\n\t    UNAME_MACHINE=i386\n\telse\n\t    UNAME_MACHINE=\"$cputype\"\n\tfi\n\techo ${UNAME_MACHINE}-unknown-plan9\n\texit ;;\n    *:TOPS-10:*:*)\n\techo pdp10-unknown-tops10\n\texit ;;\n    *:TENEX:*:*)\n\techo pdp10-unknown-tenex\n\texit ;;\n    KS10:TOPS-20:*:* | KL10:TOPS-20:*:* | TYPE4:TOPS-20:*:*)\n\techo pdp10-dec-tops20\n\texit ;;\n    XKL-1:TOPS-20:*:* | TYPE5:TOPS-20:*:*)\n\techo pdp10-xkl-tops20\n\texit ;;\n    *:TOPS-20:*:*)\n\techo pdp10-unknown-tops20\n\texit ;;\n    *:ITS:*:*)\n\techo pdp10-unknown-its\n\texit ;;\n    SEI:*:*:SEIUX)\n\techo mips-sei-seiux${UNAME_RELEASE}\n\texit ;;\n    *:DragonFly:*:*)\n\techo ${UNAME_MACHINE}-unknown-dragonfly`echo ${UNAME_RELEASE}|sed -e 's/[-(].*//'`\n\texit ;;\n    *:*VMS:*:*)\n\tUNAME_MACHINE=`(uname -p) 2>/dev/null`\n\tcase \"${UNAME_MACHINE}\" in\n\t    A*) echo alpha-dec-vms ; exit ;;\n\t    I*) echo ia64-dec-vms ; exit ;;\n\t    V*) echo vax-dec-vms ; exit ;;\n\tesac ;;\n    *:XENIX:*:SysV)\n\techo i386-pc-xenix\n\texit ;;\n    i*86:skyos:*:*)\n\techo ${UNAME_MACHINE}-pc-skyos`echo ${UNAME_RELEASE}` | sed -e 's/ .*$//'\n\texit ;;\n    i*86:rdos:*:*)\n\techo ${UNAME_MACHINE}-pc-rdos\n\texit ;;\n    i*86:AROS:*:*)\n\techo ${UNAME_MACHINE}-pc-aros\n\texit ;;\n    x86_64:VMkernel:*:*)\n\techo ${UNAME_MACHINE}-unknown-esx\n\texit ;;\nesac\n\neval $set_cc_for_build\ncat >$dummy.c <<EOF\n#ifdef _SEQUENT_\n# include <sys/types.h>\n# include <sys/utsname.h>\n#endif\nmain ()\n{\n#if defined (sony)\n#if defined (MIPSEB)\n  /* BFD wants \"bsd\" instead of \"newsos\".  Perhaps BFD should be changed,\n     I don't know....  */\n  printf (\"mips-sony-bsd\\n\"); exit (0);\n#else\n#include <sys/param.h>\n  printf (\"m68k-sony-newsos%s\\n\",\n#ifdef NEWSOS4\n\t\"4\"\n#else\n\t\"\"\n#endif\n\t); exit (0);\n#endif\n#endif\n\n#if defined (__arm) && defined (__acorn) && defined (__unix)\n  printf (\"arm-acorn-riscix\\n\"); exit (0);\n#endif\n\n#if defined (hp300) && !defined (hpux)\n  printf (\"m68k-hp-bsd\\n\"); exit (0);\n#endif\n\n#if defined (NeXT)\n#if !defined (__ARCHITECTURE__)\n#define __ARCHITECTURE__ \"m68k\"\n#endif\n  int version;\n  version=`(hostinfo | sed -n 's/.*NeXT Mach \\([0-9]*\\).*/\\1/p') 2>/dev/null`;\n  if (version < 4)\n    printf (\"%s-next-nextstep%d\\n\", __ARCHITECTURE__, version);\n  else\n    printf (\"%s-next-openstep%d\\n\", __ARCHITECTURE__, version);\n  exit (0);\n#endif\n\n#if defined (MULTIMAX) || defined (n16)\n#if defined (UMAXV)\n  printf (\"ns32k-encore-sysv\\n\"); exit (0);\n#else\n#if defined (CMU)\n  printf (\"ns32k-encore-mach\\n\"); exit (0);\n#else\n  printf (\"ns32k-encore-bsd\\n\"); exit (0);\n#endif\n#endif\n#endif\n\n#if defined (__386BSD__)\n  printf (\"i386-pc-bsd\\n\"); exit (0);\n#endif\n\n#if defined (sequent)\n#if defined (i386)\n  printf (\"i386-sequent-dynix\\n\"); exit (0);\n#endif\n#if defined (ns32000)\n  printf (\"ns32k-sequent-dynix\\n\"); exit (0);\n#endif\n#endif\n\n#if defined (_SEQUENT_)\n    struct utsname un;\n\n    uname(&un);\n\n    if (strncmp(un.version, \"V2\", 2) == 0) {\n\tprintf (\"i386-sequent-ptx2\\n\"); exit (0);\n    }\n    if (strncmp(un.version, \"V1\", 2) == 0) { /* XXX is V1 correct? */\n\tprintf (\"i386-sequent-ptx1\\n\"); exit (0);\n    }\n    printf (\"i386-sequent-ptx\\n\"); exit (0);\n\n#endif\n\n#if defined (vax)\n# if !defined (ultrix)\n#  include <sys/param.h>\n#  if defined (BSD)\n#   if BSD == 43\n      printf (\"vax-dec-bsd4.3\\n\"); exit (0);\n#   else\n#    if BSD == 199006\n      printf (\"vax-dec-bsd4.3reno\\n\"); exit (0);\n#    else\n      printf (\"vax-dec-bsd\\n\"); exit (0);\n#    endif\n#   endif\n#  else\n    printf (\"vax-dec-bsd\\n\"); exit (0);\n#  endif\n# else\n    printf (\"vax-dec-ultrix\\n\"); exit (0);\n# endif\n#endif\n\n#if defined (alliant) && defined (i860)\n  printf (\"i860-alliant-bsd\\n\"); exit (0);\n#endif\n\n  exit (1);\n}\nEOF\n\n$CC_FOR_BUILD -o $dummy $dummy.c 2>/dev/null && SYSTEM_NAME=`$dummy` &&\n\t{ echo \"$SYSTEM_NAME\"; exit; }\n\n# Apollos put the system type in the environment.\n\ntest -d /usr/apollo && { echo ${ISP}-apollo-${SYSTYPE}; exit; }\n\n# Convex versions that predate uname can use getsysinfo(1)\n\nif [ -x /usr/convex/getsysinfo ]\nthen\n    case `getsysinfo -f cpu_type` in\n    c1*)\n\techo c1-convex-bsd\n\texit ;;\n    c2*)\n\tif getsysinfo -f scalar_acc\n\tthen echo c32-convex-bsd\n\telse echo c2-convex-bsd\n\tfi\n\texit ;;\n    c34*)\n\techo c34-convex-bsd\n\texit ;;\n    c38*)\n\techo c38-convex-bsd\n\texit ;;\n    c4*)\n\techo c4-convex-bsd\n\texit ;;\n    esac\nfi\n\ncat >&2 <<EOF\n$0: unable to guess system type\n\nThis script, last modified $timestamp, has failed to recognize\nthe operating system you are using. It is advised that you\ndownload the most up to date version of the config scripts from\n\n  http://git.savannah.gnu.org/gitweb/?p=config.git;a=blob_plain;f=config.guess;hb=HEAD\nand\n  http://git.savannah.gnu.org/gitweb/?p=config.git;a=blob_plain;f=config.sub;hb=HEAD\n\nIf the version you run ($0) is already up to date, please\nsend the following data and any information you think might be\npertinent to <config-patches@gnu.org> in order to provide the needed\ninformation to handle your system.\n\nconfig.guess timestamp = $timestamp\n\nuname -m = `(uname -m) 2>/dev/null || echo unknown`\nuname -r = `(uname -r) 2>/dev/null || echo unknown`\nuname -s = `(uname -s) 2>/dev/null || echo unknown`\nuname -v = `(uname -v) 2>/dev/null || echo unknown`\n\n/usr/bin/uname -p = `(/usr/bin/uname -p) 2>/dev/null`\n/bin/uname -X     = `(/bin/uname -X) 2>/dev/null`\n\nhostinfo               = `(hostinfo) 2>/dev/null`\n/bin/universe          = `(/bin/universe) 2>/dev/null`\n/usr/bin/arch -k       = `(/usr/bin/arch -k) 2>/dev/null`\n/bin/arch              = `(/bin/arch) 2>/dev/null`\n/usr/bin/oslevel       = `(/usr/bin/oslevel) 2>/dev/null`\n/usr/convex/getsysinfo = `(/usr/convex/getsysinfo) 2>/dev/null`\n\nUNAME_MACHINE = ${UNAME_MACHINE}\nUNAME_RELEASE = ${UNAME_RELEASE}\nUNAME_SYSTEM  = ${UNAME_SYSTEM}\nUNAME_VERSION = ${UNAME_VERSION}\nEOF\n\nexit 1\n\n# Local variables:\n# eval: (add-hook 'write-file-hooks 'time-stamp)\n# time-stamp-start: \"timestamp='\"\n# time-stamp-format: \"%:y-%02m-%02d\"\n# time-stamp-end: \"'\"\n# End:\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/config.h.in",
    "content": "/* config.h.in.  Generated from configure.ac by autoheader.  */\n\n/* Define to 1 if you have the <dlfcn.h> header file. */\n#undef HAVE_DLFCN_H\n\n/* Define to 1 if you have the <inttypes.h> header file. */\n#undef HAVE_INTTYPES_H\n\n/* Define to 1 if you have the <memory.h> header file. */\n#undef HAVE_MEMORY_H\n\n/* Define to 1 if you have the <stdint.h> header file. */\n#undef HAVE_STDINT_H\n\n/* Define to 1 if you have the <stdlib.h> header file. */\n#undef HAVE_STDLIB_H\n\n/* Define to 1 if you have the <strings.h> header file. */\n#undef HAVE_STRINGS_H\n\n/* Define to 1 if you have the <string.h> header file. */\n#undef HAVE_STRING_H\n\n/* Define to 1 if you have the <sys/stat.h> header file. */\n#undef HAVE_SYS_STAT_H\n\n/* Define to 1 if you have the <sys/types.h> header file. */\n#undef HAVE_SYS_TYPES_H\n\n/* Define to 1 if you have the <unistd.h> header file. */\n#undef HAVE_UNISTD_H\n\n/* Define to the sub-directory in which libtool stores uninstalled libraries.\n   */\n#undef LT_OBJDIR\n\n/* Name of package */\n#undef PACKAGE\n\n/* Define to the address where bug reports for this package should be sent. */\n#undef PACKAGE_BUGREPORT\n\n/* Define to the full name of this package. */\n#undef PACKAGE_NAME\n\n/* Define to the full name and version of this package. */\n#undef PACKAGE_STRING\n\n/* Define to the one symbol short name of this package. */\n#undef PACKAGE_TARNAME\n\n/* Define to the home page for this package. */\n#undef PACKAGE_URL\n\n/* Define to the version of this package. */\n#undef PACKAGE_VERSION\n\n/* Define to 1 if you have the ANSI C header files. */\n#undef STDC_HEADERS\n\n/* Version number of package */\n#undef VERSION\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/config.sub",
    "content": "#! /bin/sh\n# Configuration validation subroutine script.\n#   Copyright 1992-2013 Free Software Foundation, Inc.\n\ntimestamp='2013-08-10'\n\n# This file is free software; you can redistribute it and/or modify it\n# under the terms of the GNU General Public License as published by\n# the Free Software Foundation; either version 3 of the License, or\n# (at your option) any later version.\n#\n# This program is distributed in the hope that it will be useful, but\n# WITHOUT ANY WARRANTY; without even the implied warranty of\n# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n# General Public License for more details.\n#\n# You should have received a copy of the GNU General Public License\n# along with this program; if not, see <http://www.gnu.org/licenses/>.\n#\n# As a special exception to the GNU General Public License, if you\n# distribute this file as part of a program that contains a\n# configuration script generated by Autoconf, you may include it under\n# the same distribution terms that you use for the rest of that\n# program.  This Exception is an additional permission under section 7\n# of the GNU General Public License, version 3 (\"GPLv3\").\n\n\n# Please send patches with a ChangeLog entry to config-patches@gnu.org.\n#\n# Configuration subroutine to validate and canonicalize a configuration type.\n# Supply the specified configuration type as an argument.\n# If it is invalid, we print an error message on stderr and exit with code 1.\n# Otherwise, we print the canonical config type on stdout and succeed.\n\n# You can get the latest version of this script from:\n# http://git.savannah.gnu.org/gitweb/?p=config.git;a=blob_plain;f=config.sub;hb=HEAD\n\n# This file is supposed to be the same for all GNU packages\n# and recognize all the CPU types, system types and aliases\n# that are meaningful with *any* GNU software.\n# Each package is responsible for reporting which valid configurations\n# it does not support.  The user should be able to distinguish\n# a failure to support a valid configuration from a meaningless\n# configuration.\n\n# The goal of this file is to map all the various variations of a given\n# machine specification into a single specification in the form:\n#\tCPU_TYPE-MANUFACTURER-OPERATING_SYSTEM\n# or in some cases, the newer four-part form:\n#\tCPU_TYPE-MANUFACTURER-KERNEL-OPERATING_SYSTEM\n# It is wrong to echo any other type of specification.\n\nme=`echo \"$0\" | sed -e 's,.*/,,'`\n\nusage=\"\\\nUsage: $0 [OPTION] CPU-MFR-OPSYS\n       $0 [OPTION] ALIAS\n\nCanonicalize a configuration name.\n\nOperation modes:\n  -h, --help         print this help, then exit\n  -t, --time-stamp   print date of last modification, then exit\n  -v, --version      print version number, then exit\n\nReport bugs and patches to <config-patches@gnu.org>.\"\n\nversion=\"\\\nGNU config.sub ($timestamp)\n\nCopyright 1992-2013 Free Software Foundation, Inc.\n\nThis is free software; see the source for copying conditions.  There is NO\nwarranty; not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.\"\n\nhelp=\"\nTry \\`$me --help' for more information.\"\n\n# Parse command line\nwhile test $# -gt 0 ; do\n  case $1 in\n    --time-stamp | --time* | -t )\n       echo \"$timestamp\" ; exit ;;\n    --version | -v )\n       echo \"$version\" ; exit ;;\n    --help | --h* | -h )\n       echo \"$usage\"; exit ;;\n    -- )     # Stop option processing\n       shift; break ;;\n    - )\t# Use stdin as input.\n       break ;;\n    -* )\n       echo \"$me: invalid option $1$help\"\n       exit 1 ;;\n\n    *local*)\n       # First pass through any local machine types.\n       echo $1\n       exit ;;\n\n    * )\n       break ;;\n  esac\ndone\n\ncase $# in\n 0) echo \"$me: missing argument$help\" >&2\n    exit 1;;\n 1) ;;\n *) echo \"$me: too many arguments$help\" >&2\n    exit 1;;\nesac\n\n# Separate what the user gave into CPU-COMPANY and OS or KERNEL-OS (if any).\n# Here we must recognize all the valid KERNEL-OS combinations.\nmaybe_os=`echo $1 | sed 's/^\\(.*\\)-\\([^-]*-[^-]*\\)$/\\2/'`\ncase $maybe_os in\n  nto-qnx* | linux-gnu* | linux-android* | linux-dietlibc | linux-newlib* | \\\n  linux-musl* | linux-uclibc* | uclinux-uclibc* | uclinux-gnu* | kfreebsd*-gnu* | \\\n  knetbsd*-gnu* | netbsd*-gnu* | \\\n  kopensolaris*-gnu* | \\\n  storm-chaos* | os2-emx* | rtmk-nova*)\n    os=-$maybe_os\n    basic_machine=`echo $1 | sed 's/^\\(.*\\)-\\([^-]*-[^-]*\\)$/\\1/'`\n    ;;\n  android-linux)\n    os=-linux-android\n    basic_machine=`echo $1 | sed 's/^\\(.*\\)-\\([^-]*-[^-]*\\)$/\\1/'`-unknown\n    ;;\n  *)\n    basic_machine=`echo $1 | sed 's/-[^-]*$//'`\n    if [ $basic_machine != $1 ]\n    then os=`echo $1 | sed 's/.*-/-/'`\n    else os=; fi\n    ;;\nesac\n\n### Let's recognize common machines as not being operating systems so\n### that things like config.sub decstation-3100 work.  We also\n### recognize some manufacturers as not being operating systems, so we\n### can provide default operating systems below.\ncase $os in\n\t-sun*os*)\n\t\t# Prevent following clause from handling this invalid input.\n\t\t;;\n\t-dec* | -mips* | -sequent* | -encore* | -pc532* | -sgi* | -sony* | \\\n\t-att* | -7300* | -3300* | -delta* | -motorola* | -sun[234]* | \\\n\t-unicom* | -ibm* | -next | -hp | -isi* | -apollo | -altos* | \\\n\t-convergent* | -ncr* | -news | -32* | -3600* | -3100* | -hitachi* |\\\n\t-c[123]* | -convex* | -sun | -crds | -omron* | -dg | -ultra | -tti* | \\\n\t-harris | -dolphin | -highlevel | -gould | -cbm | -ns | -masscomp | \\\n\t-apple | -axis | -knuth | -cray | -microblaze*)\n\t\tos=\n\t\tbasic_machine=$1\n\t\t;;\n\t-bluegene*)\n\t\tos=-cnk\n\t\t;;\n\t-sim | -cisco | -oki | -wec | -winbond)\n\t\tos=\n\t\tbasic_machine=$1\n\t\t;;\n\t-scout)\n\t\t;;\n\t-wrs)\n\t\tos=-vxworks\n\t\tbasic_machine=$1\n\t\t;;\n\t-chorusos*)\n\t\tos=-chorusos\n\t\tbasic_machine=$1\n\t\t;;\n\t-chorusrdb)\n\t\tos=-chorusrdb\n\t\tbasic_machine=$1\n\t\t;;\n\t-hiux*)\n\t\tos=-hiuxwe2\n\t\t;;\n\t-sco6)\n\t\tos=-sco5v6\n\t\tbasic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'`\n\t\t;;\n\t-sco5)\n\t\tos=-sco3.2v5\n\t\tbasic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'`\n\t\t;;\n\t-sco4)\n\t\tos=-sco3.2v4\n\t\tbasic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'`\n\t\t;;\n\t-sco3.2.[4-9]*)\n\t\tos=`echo $os | sed -e 's/sco3.2./sco3.2v/'`\n\t\tbasic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'`\n\t\t;;\n\t-sco3.2v[4-9]*)\n\t\t# Don't forget version if it is 3.2v4 or newer.\n\t\tbasic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'`\n\t\t;;\n\t-sco5v6*)\n\t\t# Don't forget version if it is 3.2v4 or newer.\n\t\tbasic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'`\n\t\t;;\n\t-sco*)\n\t\tos=-sco3.2v2\n\t\tbasic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'`\n\t\t;;\n\t-udk*)\n\t\tbasic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'`\n\t\t;;\n\t-isc)\n\t\tos=-isc2.2\n\t\tbasic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'`\n\t\t;;\n\t-clix*)\n\t\tbasic_machine=clipper-intergraph\n\t\t;;\n\t-isc*)\n\t\tbasic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'`\n\t\t;;\n\t-lynx*178)\n\t\tos=-lynxos178\n\t\t;;\n\t-lynx*5)\n\t\tos=-lynxos5\n\t\t;;\n\t-lynx*)\n\t\tos=-lynxos\n\t\t;;\n\t-ptx*)\n\t\tbasic_machine=`echo $1 | sed -e 's/86-.*/86-sequent/'`\n\t\t;;\n\t-windowsnt*)\n\t\tos=`echo $os | sed -e 's/windowsnt/winnt/'`\n\t\t;;\n\t-psos*)\n\t\tos=-psos\n\t\t;;\n\t-mint | -mint[0-9]*)\n\t\tbasic_machine=m68k-atari\n\t\tos=-mint\n\t\t;;\nesac\n\n# Decode aliases for certain CPU-COMPANY combinations.\ncase $basic_machine in\n\t# Recognize the basic CPU types without company name.\n\t# Some are omitted here because they have special meanings below.\n\t1750a | 580 \\\n\t| a29k \\\n\t| aarch64 | aarch64_be \\\n\t| alpha | alphaev[4-8] | alphaev56 | alphaev6[78] | alphapca5[67] \\\n\t| alpha64 | alpha64ev[4-8] | alpha64ev56 | alpha64ev6[78] | alpha64pca5[67] \\\n\t| am33_2.0 \\\n\t| arc | arceb \\\n\t| arm | arm[bl]e | arme[lb] | armv[2-8] | armv[3-8][lb] | armv7[arm] \\\n\t| avr | avr32 \\\n\t| be32 | be64 \\\n\t| bfin \\\n\t| c4x | c8051 | clipper \\\n\t| d10v | d30v | dlx | dsp16xx \\\n\t| epiphany \\\n\t| fido | fr30 | frv \\\n\t| h8300 | h8500 | hppa | hppa1.[01] | hppa2.0 | hppa2.0[nw] | hppa64 \\\n\t| hexagon \\\n\t| i370 | i860 | i960 | ia64 \\\n\t| ip2k | iq2000 \\\n\t| le32 | le64 \\\n\t| lm32 \\\n\t| m32c | m32r | m32rle | m68000 | m68k | m88k \\\n\t| maxq | mb | microblaze | microblazeel | mcore | mep | metag \\\n\t| mips | mipsbe | mipseb | mipsel | mipsle \\\n\t| mips16 \\\n\t| mips64 | mips64el \\\n\t| mips64octeon | mips64octeonel \\\n\t| mips64orion | mips64orionel \\\n\t| mips64r5900 | mips64r5900el \\\n\t| mips64vr | mips64vrel \\\n\t| mips64vr4100 | mips64vr4100el \\\n\t| mips64vr4300 | mips64vr4300el \\\n\t| mips64vr5000 | mips64vr5000el \\\n\t| mips64vr5900 | mips64vr5900el \\\n\t| mipsisa32 | mipsisa32el \\\n\t| mipsisa32r2 | mipsisa32r2el \\\n\t| mipsisa64 | mipsisa64el \\\n\t| mipsisa64r2 | mipsisa64r2el \\\n\t| mipsisa64sb1 | mipsisa64sb1el \\\n\t| mipsisa64sr71k | mipsisa64sr71kel \\\n\t| mipsr5900 | mipsr5900el \\\n\t| mipstx39 | mipstx39el \\\n\t| mn10200 | mn10300 \\\n\t| moxie \\\n\t| mt \\\n\t| msp430 \\\n\t| nds32 | nds32le | nds32be \\\n\t| nios | nios2 | nios2eb | nios2el \\\n\t| ns16k | ns32k \\\n\t| open8 \\\n\t| or1k | or32 \\\n\t| pdp10 | pdp11 | pj | pjl \\\n\t| powerpc | powerpc64 | powerpc64le | powerpcle \\\n\t| pyramid \\\n\t| rl78 | rx \\\n\t| score \\\n\t| sh | sh[1234] | sh[24]a | sh[24]aeb | sh[23]e | sh[34]eb | sheb | shbe | shle | sh[1234]le | sh3ele \\\n\t| sh64 | sh64le \\\n\t| sparc | sparc64 | sparc64b | sparc64v | sparc86x | sparclet | sparclite \\\n\t| sparcv8 | sparcv9 | sparcv9b | sparcv9v \\\n\t| spu \\\n\t| tahoe | tic4x | tic54x | tic55x | tic6x | tic80 | tron \\\n\t| ubicom32 \\\n\t| v850 | v850e | v850e1 | v850e2 | v850es | v850e2v3 \\\n\t| we32k \\\n\t| x86 | xc16x | xstormy16 | xtensa \\\n\t| z8k | z80)\n\t\tbasic_machine=$basic_machine-unknown\n\t\t;;\n\tc54x)\n\t\tbasic_machine=tic54x-unknown\n\t\t;;\n\tc55x)\n\t\tbasic_machine=tic55x-unknown\n\t\t;;\n\tc6x)\n\t\tbasic_machine=tic6x-unknown\n\t\t;;\n\tm6811 | m68hc11 | m6812 | m68hc12 | m68hcs12x | picochip)\n\t\tbasic_machine=$basic_machine-unknown\n\t\tos=-none\n\t\t;;\n\tm88110 | m680[12346]0 | m683?2 | m68360 | m5200 | v70 | w65 | z8k)\n\t\t;;\n\tms1)\n\t\tbasic_machine=mt-unknown\n\t\t;;\n\n\tstrongarm | thumb | xscale)\n\t\tbasic_machine=arm-unknown\n\t\t;;\n\txgate)\n\t\tbasic_machine=$basic_machine-unknown\n\t\tos=-none\n\t\t;;\n\txscaleeb)\n\t\tbasic_machine=armeb-unknown\n\t\t;;\n\n\txscaleel)\n\t\tbasic_machine=armel-unknown\n\t\t;;\n\n\t# We use `pc' rather than `unknown'\n\t# because (1) that's what they normally are, and\n\t# (2) the word \"unknown\" tends to confuse beginning users.\n\ti*86 | x86_64)\n\t  basic_machine=$basic_machine-pc\n\t  ;;\n\t# Object if more than one company name word.\n\t*-*-*)\n\t\techo Invalid configuration \\`$1\\': machine \\`$basic_machine\\' not recognized 1>&2\n\t\texit 1\n\t\t;;\n\t# Recognize the basic CPU types with company name.\n\t580-* \\\n\t| a29k-* \\\n\t| aarch64-* | aarch64_be-* \\\n\t| alpha-* | alphaev[4-8]-* | alphaev56-* | alphaev6[78]-* \\\n\t| alpha64-* | alpha64ev[4-8]-* | alpha64ev56-* | alpha64ev6[78]-* \\\n\t| alphapca5[67]-* | alpha64pca5[67]-* | arc-* | arceb-* \\\n\t| arm-*  | armbe-* | armle-* | armeb-* | armv*-* \\\n\t| avr-* | avr32-* \\\n\t| be32-* | be64-* \\\n\t| bfin-* | bs2000-* \\\n\t| c[123]* | c30-* | [cjt]90-* | c4x-* \\\n\t| c8051-* | clipper-* | craynv-* | cydra-* \\\n\t| d10v-* | d30v-* | dlx-* \\\n\t| elxsi-* \\\n\t| f30[01]-* | f700-* | fido-* | fr30-* | frv-* | fx80-* \\\n\t| h8300-* | h8500-* \\\n\t| hppa-* | hppa1.[01]-* | hppa2.0-* | hppa2.0[nw]-* | hppa64-* \\\n\t| hexagon-* \\\n\t| i*86-* | i860-* | i960-* | ia64-* \\\n\t| ip2k-* | iq2000-* \\\n\t| le32-* | le64-* \\\n\t| lm32-* \\\n\t| m32c-* | m32r-* | m32rle-* \\\n\t| m68000-* | m680[012346]0-* | m68360-* | m683?2-* | m68k-* \\\n\t| m88110-* | m88k-* | maxq-* | mcore-* | metag-* \\\n\t| microblaze-* | microblazeel-* \\\n\t| mips-* | mipsbe-* | mipseb-* | mipsel-* | mipsle-* \\\n\t| mips16-* \\\n\t| mips64-* | mips64el-* \\\n\t| mips64octeon-* | mips64octeonel-* \\\n\t| mips64orion-* | mips64orionel-* \\\n\t| mips64r5900-* | mips64r5900el-* \\\n\t| mips64vr-* | mips64vrel-* \\\n\t| mips64vr4100-* | mips64vr4100el-* \\\n\t| mips64vr4300-* | mips64vr4300el-* \\\n\t| mips64vr5000-* | mips64vr5000el-* \\\n\t| mips64vr5900-* | mips64vr5900el-* \\\n\t| mipsisa32-* | mipsisa32el-* \\\n\t| mipsisa32r2-* | mipsisa32r2el-* \\\n\t| mipsisa64-* | mipsisa64el-* \\\n\t| mipsisa64r2-* | mipsisa64r2el-* \\\n\t| mipsisa64sb1-* | mipsisa64sb1el-* \\\n\t| mipsisa64sr71k-* | mipsisa64sr71kel-* \\\n\t| mipsr5900-* | mipsr5900el-* \\\n\t| mipstx39-* | mipstx39el-* \\\n\t| mmix-* \\\n\t| mt-* \\\n\t| msp430-* \\\n\t| nds32-* | nds32le-* | nds32be-* \\\n\t| nios-* | nios2-* | nios2eb-* | nios2el-* \\\n\t| none-* | np1-* | ns16k-* | ns32k-* \\\n\t| open8-* \\\n\t| orion-* \\\n\t| pdp10-* | pdp11-* | pj-* | pjl-* | pn-* | power-* \\\n\t| powerpc-* | powerpc64-* | powerpc64le-* | powerpcle-* \\\n\t| pyramid-* \\\n\t| rl78-* | romp-* | rs6000-* | rx-* \\\n\t| sh-* | sh[1234]-* | sh[24]a-* | sh[24]aeb-* | sh[23]e-* | sh[34]eb-* | sheb-* | shbe-* \\\n\t| shle-* | sh[1234]le-* | sh3ele-* | sh64-* | sh64le-* \\\n\t| sparc-* | sparc64-* | sparc64b-* | sparc64v-* | sparc86x-* | sparclet-* \\\n\t| sparclite-* \\\n\t| sparcv8-* | sparcv9-* | sparcv9b-* | sparcv9v-* | sv1-* | sx?-* \\\n\t| tahoe-* \\\n\t| tic30-* | tic4x-* | tic54x-* | tic55x-* | tic6x-* | tic80-* \\\n\t| tile*-* \\\n\t| tron-* \\\n\t| ubicom32-* \\\n\t| v850-* | v850e-* | v850e1-* | v850es-* | v850e2-* | v850e2v3-* \\\n\t| vax-* \\\n\t| we32k-* \\\n\t| x86-* | x86_64-* | xc16x-* | xps100-* \\\n\t| xstormy16-* | xtensa*-* \\\n\t| ymp-* \\\n\t| z8k-* | z80-*)\n\t\t;;\n\t# Recognize the basic CPU types without company name, with glob match.\n\txtensa*)\n\t\tbasic_machine=$basic_machine-unknown\n\t\t;;\n\t# Recognize the various machine names and aliases which stand\n\t# for a CPU type and a company and sometimes even an OS.\n\t386bsd)\n\t\tbasic_machine=i386-unknown\n\t\tos=-bsd\n\t\t;;\n\t3b1 | 7300 | 7300-att | att-7300 | pc7300 | safari | unixpc)\n\t\tbasic_machine=m68000-att\n\t\t;;\n\t3b*)\n\t\tbasic_machine=we32k-att\n\t\t;;\n\ta29khif)\n\t\tbasic_machine=a29k-amd\n\t\tos=-udi\n\t\t;;\n\tabacus)\n\t\tbasic_machine=abacus-unknown\n\t\t;;\n\tadobe68k)\n\t\tbasic_machine=m68010-adobe\n\t\tos=-scout\n\t\t;;\n\talliant | fx80)\n\t\tbasic_machine=fx80-alliant\n\t\t;;\n\taltos | altos3068)\n\t\tbasic_machine=m68k-altos\n\t\t;;\n\tam29k)\n\t\tbasic_machine=a29k-none\n\t\tos=-bsd\n\t\t;;\n\tamd64)\n\t\tbasic_machine=x86_64-pc\n\t\t;;\n\tamd64-*)\n\t\tbasic_machine=x86_64-`echo $basic_machine | sed 's/^[^-]*-//'`\n\t\t;;\n\tamdahl)\n\t\tbasic_machine=580-amdahl\n\t\tos=-sysv\n\t\t;;\n\tamiga | amiga-*)\n\t\tbasic_machine=m68k-unknown\n\t\t;;\n\tamigaos | amigados)\n\t\tbasic_machine=m68k-unknown\n\t\tos=-amigaos\n\t\t;;\n\tamigaunix | amix)\n\t\tbasic_machine=m68k-unknown\n\t\tos=-sysv4\n\t\t;;\n\tapollo68)\n\t\tbasic_machine=m68k-apollo\n\t\tos=-sysv\n\t\t;;\n\tapollo68bsd)\n\t\tbasic_machine=m68k-apollo\n\t\tos=-bsd\n\t\t;;\n\taros)\n\t\tbasic_machine=i386-pc\n\t\tos=-aros\n\t\t;;\n\taux)\n\t\tbasic_machine=m68k-apple\n\t\tos=-aux\n\t\t;;\n\tbalance)\n\t\tbasic_machine=ns32k-sequent\n\t\tos=-dynix\n\t\t;;\n\tblackfin)\n\t\tbasic_machine=bfin-unknown\n\t\tos=-linux\n\t\t;;\n\tblackfin-*)\n\t\tbasic_machine=bfin-`echo $basic_machine | sed 's/^[^-]*-//'`\n\t\tos=-linux\n\t\t;;\n\tbluegene*)\n\t\tbasic_machine=powerpc-ibm\n\t\tos=-cnk\n\t\t;;\n\tc54x-*)\n\t\tbasic_machine=tic54x-`echo $basic_machine | sed 's/^[^-]*-//'`\n\t\t;;\n\tc55x-*)\n\t\tbasic_machine=tic55x-`echo $basic_machine | sed 's/^[^-]*-//'`\n\t\t;;\n\tc6x-*)\n\t\tbasic_machine=tic6x-`echo $basic_machine | sed 's/^[^-]*-//'`\n\t\t;;\n\tc90)\n\t\tbasic_machine=c90-cray\n\t\tos=-unicos\n\t\t;;\n\tcegcc)\n\t\tbasic_machine=arm-unknown\n\t\tos=-cegcc\n\t\t;;\n\tconvex-c1)\n\t\tbasic_machine=c1-convex\n\t\tos=-bsd\n\t\t;;\n\tconvex-c2)\n\t\tbasic_machine=c2-convex\n\t\tos=-bsd\n\t\t;;\n\tconvex-c32)\n\t\tbasic_machine=c32-convex\n\t\tos=-bsd\n\t\t;;\n\tconvex-c34)\n\t\tbasic_machine=c34-convex\n\t\tos=-bsd\n\t\t;;\n\tconvex-c38)\n\t\tbasic_machine=c38-convex\n\t\tos=-bsd\n\t\t;;\n\tcray | j90)\n\t\tbasic_machine=j90-cray\n\t\tos=-unicos\n\t\t;;\n\tcraynv)\n\t\tbasic_machine=craynv-cray\n\t\tos=-unicosmp\n\t\t;;\n\tcr16 | cr16-*)\n\t\tbasic_machine=cr16-unknown\n\t\tos=-elf\n\t\t;;\n\tcrds | unos)\n\t\tbasic_machine=m68k-crds\n\t\t;;\n\tcrisv32 | crisv32-* | etraxfs*)\n\t\tbasic_machine=crisv32-axis\n\t\t;;\n\tcris | cris-* | etrax*)\n\t\tbasic_machine=cris-axis\n\t\t;;\n\tcrx)\n\t\tbasic_machine=crx-unknown\n\t\tos=-elf\n\t\t;;\n\tda30 | da30-*)\n\t\tbasic_machine=m68k-da30\n\t\t;;\n\tdecstation | decstation-3100 | pmax | pmax-* | pmin | dec3100 | decstatn)\n\t\tbasic_machine=mips-dec\n\t\t;;\n\tdecsystem10* | dec10*)\n\t\tbasic_machine=pdp10-dec\n\t\tos=-tops10\n\t\t;;\n\tdecsystem20* | dec20*)\n\t\tbasic_machine=pdp10-dec\n\t\tos=-tops20\n\t\t;;\n\tdelta | 3300 | motorola-3300 | motorola-delta \\\n\t      | 3300-motorola | delta-motorola)\n\t\tbasic_machine=m68k-motorola\n\t\t;;\n\tdelta88)\n\t\tbasic_machine=m88k-motorola\n\t\tos=-sysv3\n\t\t;;\n\tdicos)\n\t\tbasic_machine=i686-pc\n\t\tos=-dicos\n\t\t;;\n\tdjgpp)\n\t\tbasic_machine=i586-pc\n\t\tos=-msdosdjgpp\n\t\t;;\n\tdpx20 | dpx20-*)\n\t\tbasic_machine=rs6000-bull\n\t\tos=-bosx\n\t\t;;\n\tdpx2* | dpx2*-bull)\n\t\tbasic_machine=m68k-bull\n\t\tos=-sysv3\n\t\t;;\n\tebmon29k)\n\t\tbasic_machine=a29k-amd\n\t\tos=-ebmon\n\t\t;;\n\telxsi)\n\t\tbasic_machine=elxsi-elxsi\n\t\tos=-bsd\n\t\t;;\n\tencore | umax | mmax)\n\t\tbasic_machine=ns32k-encore\n\t\t;;\n\tes1800 | OSE68k | ose68k | ose | OSE)\n\t\tbasic_machine=m68k-ericsson\n\t\tos=-ose\n\t\t;;\n\tfx2800)\n\t\tbasic_machine=i860-alliant\n\t\t;;\n\tgenix)\n\t\tbasic_machine=ns32k-ns\n\t\t;;\n\tgmicro)\n\t\tbasic_machine=tron-gmicro\n\t\tos=-sysv\n\t\t;;\n\tgo32)\n\t\tbasic_machine=i386-pc\n\t\tos=-go32\n\t\t;;\n\th3050r* | hiux*)\n\t\tbasic_machine=hppa1.1-hitachi\n\t\tos=-hiuxwe2\n\t\t;;\n\th8300hms)\n\t\tbasic_machine=h8300-hitachi\n\t\tos=-hms\n\t\t;;\n\th8300xray)\n\t\tbasic_machine=h8300-hitachi\n\t\tos=-xray\n\t\t;;\n\th8500hms)\n\t\tbasic_machine=h8500-hitachi\n\t\tos=-hms\n\t\t;;\n\tharris)\n\t\tbasic_machine=m88k-harris\n\t\tos=-sysv3\n\t\t;;\n\thp300-*)\n\t\tbasic_machine=m68k-hp\n\t\t;;\n\thp300bsd)\n\t\tbasic_machine=m68k-hp\n\t\tos=-bsd\n\t\t;;\n\thp300hpux)\n\t\tbasic_machine=m68k-hp\n\t\tos=-hpux\n\t\t;;\n\thp3k9[0-9][0-9] | hp9[0-9][0-9])\n\t\tbasic_machine=hppa1.0-hp\n\t\t;;\n\thp9k2[0-9][0-9] | hp9k31[0-9])\n\t\tbasic_machine=m68000-hp\n\t\t;;\n\thp9k3[2-9][0-9])\n\t\tbasic_machine=m68k-hp\n\t\t;;\n\thp9k6[0-9][0-9] | hp6[0-9][0-9])\n\t\tbasic_machine=hppa1.0-hp\n\t\t;;\n\thp9k7[0-79][0-9] | hp7[0-79][0-9])\n\t\tbasic_machine=hppa1.1-hp\n\t\t;;\n\thp9k78[0-9] | hp78[0-9])\n\t\t# FIXME: really hppa2.0-hp\n\t\tbasic_machine=hppa1.1-hp\n\t\t;;\n\thp9k8[67]1 | hp8[67]1 | hp9k80[24] | hp80[24] | hp9k8[78]9 | hp8[78]9 | hp9k893 | hp893)\n\t\t# FIXME: really hppa2.0-hp\n\t\tbasic_machine=hppa1.1-hp\n\t\t;;\n\thp9k8[0-9][13679] | hp8[0-9][13679])\n\t\tbasic_machine=hppa1.1-hp\n\t\t;;\n\thp9k8[0-9][0-9] | hp8[0-9][0-9])\n\t\tbasic_machine=hppa1.0-hp\n\t\t;;\n\thppa-next)\n\t\tos=-nextstep3\n\t\t;;\n\thppaosf)\n\t\tbasic_machine=hppa1.1-hp\n\t\tos=-osf\n\t\t;;\n\thppro)\n\t\tbasic_machine=hppa1.1-hp\n\t\tos=-proelf\n\t\t;;\n\ti370-ibm* | ibm*)\n\t\tbasic_machine=i370-ibm\n\t\t;;\n\ti*86v32)\n\t\tbasic_machine=`echo $1 | sed -e 's/86.*/86-pc/'`\n\t\tos=-sysv32\n\t\t;;\n\ti*86v4*)\n\t\tbasic_machine=`echo $1 | sed -e 's/86.*/86-pc/'`\n\t\tos=-sysv4\n\t\t;;\n\ti*86v)\n\t\tbasic_machine=`echo $1 | sed -e 's/86.*/86-pc/'`\n\t\tos=-sysv\n\t\t;;\n\ti*86sol2)\n\t\tbasic_machine=`echo $1 | sed -e 's/86.*/86-pc/'`\n\t\tos=-solaris2\n\t\t;;\n\ti386mach)\n\t\tbasic_machine=i386-mach\n\t\tos=-mach\n\t\t;;\n\ti386-vsta | vsta)\n\t\tbasic_machine=i386-unknown\n\t\tos=-vsta\n\t\t;;\n\tiris | iris4d)\n\t\tbasic_machine=mips-sgi\n\t\tcase $os in\n\t\t    -irix*)\n\t\t\t;;\n\t\t    *)\n\t\t\tos=-irix4\n\t\t\t;;\n\t\tesac\n\t\t;;\n\tisi68 | isi)\n\t\tbasic_machine=m68k-isi\n\t\tos=-sysv\n\t\t;;\n\tm68knommu)\n\t\tbasic_machine=m68k-unknown\n\t\tos=-linux\n\t\t;;\n\tm68knommu-*)\n\t\tbasic_machine=m68k-`echo $basic_machine | sed 's/^[^-]*-//'`\n\t\tos=-linux\n\t\t;;\n\tm88k-omron*)\n\t\tbasic_machine=m88k-omron\n\t\t;;\n\tmagnum | m3230)\n\t\tbasic_machine=mips-mips\n\t\tos=-sysv\n\t\t;;\n\tmerlin)\n\t\tbasic_machine=ns32k-utek\n\t\tos=-sysv\n\t\t;;\n\tmicroblaze*)\n\t\tbasic_machine=microblaze-xilinx\n\t\t;;\n\tmingw64)\n\t\tbasic_machine=x86_64-pc\n\t\tos=-mingw64\n\t\t;;\n\tmingw32)\n\t\tbasic_machine=i686-pc\n\t\tos=-mingw32\n\t\t;;\n\tmingw32ce)\n\t\tbasic_machine=arm-unknown\n\t\tos=-mingw32ce\n\t\t;;\n\tminiframe)\n\t\tbasic_machine=m68000-convergent\n\t\t;;\n\t*mint | -mint[0-9]* | *MiNT | *MiNT[0-9]*)\n\t\tbasic_machine=m68k-atari\n\t\tos=-mint\n\t\t;;\n\tmips3*-*)\n\t\tbasic_machine=`echo $basic_machine | sed -e 's/mips3/mips64/'`\n\t\t;;\n\tmips3*)\n\t\tbasic_machine=`echo $basic_machine | sed -e 's/mips3/mips64/'`-unknown\n\t\t;;\n\tmonitor)\n\t\tbasic_machine=m68k-rom68k\n\t\tos=-coff\n\t\t;;\n\tmorphos)\n\t\tbasic_machine=powerpc-unknown\n\t\tos=-morphos\n\t\t;;\n\tmsdos)\n\t\tbasic_machine=i386-pc\n\t\tos=-msdos\n\t\t;;\n\tms1-*)\n\t\tbasic_machine=`echo $basic_machine | sed -e 's/ms1-/mt-/'`\n\t\t;;\n\tmsys)\n\t\tbasic_machine=i686-pc\n\t\tos=-msys\n\t\t;;\n\tmvs)\n\t\tbasic_machine=i370-ibm\n\t\tos=-mvs\n\t\t;;\n\tnacl)\n\t\tbasic_machine=le32-unknown\n\t\tos=-nacl\n\t\t;;\n\tncr3000)\n\t\tbasic_machine=i486-ncr\n\t\tos=-sysv4\n\t\t;;\n\tnetbsd386)\n\t\tbasic_machine=i386-unknown\n\t\tos=-netbsd\n\t\t;;\n\tnetwinder)\n\t\tbasic_machine=armv4l-rebel\n\t\tos=-linux\n\t\t;;\n\tnews | news700 | news800 | news900)\n\t\tbasic_machine=m68k-sony\n\t\tos=-newsos\n\t\t;;\n\tnews1000)\n\t\tbasic_machine=m68030-sony\n\t\tos=-newsos\n\t\t;;\n\tnews-3600 | risc-news)\n\t\tbasic_machine=mips-sony\n\t\tos=-newsos\n\t\t;;\n\tnecv70)\n\t\tbasic_machine=v70-nec\n\t\tos=-sysv\n\t\t;;\n\tnext | m*-next )\n\t\tbasic_machine=m68k-next\n\t\tcase $os in\n\t\t    -nextstep* )\n\t\t\t;;\n\t\t    -ns2*)\n\t\t      os=-nextstep2\n\t\t\t;;\n\t\t    *)\n\t\t      os=-nextstep3\n\t\t\t;;\n\t\tesac\n\t\t;;\n\tnh3000)\n\t\tbasic_machine=m68k-harris\n\t\tos=-cxux\n\t\t;;\n\tnh[45]000)\n\t\tbasic_machine=m88k-harris\n\t\tos=-cxux\n\t\t;;\n\tnindy960)\n\t\tbasic_machine=i960-intel\n\t\tos=-nindy\n\t\t;;\n\tmon960)\n\t\tbasic_machine=i960-intel\n\t\tos=-mon960\n\t\t;;\n\tnonstopux)\n\t\tbasic_machine=mips-compaq\n\t\tos=-nonstopux\n\t\t;;\n\tnp1)\n\t\tbasic_machine=np1-gould\n\t\t;;\n\tneo-tandem)\n\t\tbasic_machine=neo-tandem\n\t\t;;\n\tnse-tandem)\n\t\tbasic_machine=nse-tandem\n\t\t;;\n\tnsr-tandem)\n\t\tbasic_machine=nsr-tandem\n\t\t;;\n\top50n-* | op60c-*)\n\t\tbasic_machine=hppa1.1-oki\n\t\tos=-proelf\n\t\t;;\n\topenrisc | openrisc-*)\n\t\tbasic_machine=or32-unknown\n\t\t;;\n\tos400)\n\t\tbasic_machine=powerpc-ibm\n\t\tos=-os400\n\t\t;;\n\tOSE68000 | ose68000)\n\t\tbasic_machine=m68000-ericsson\n\t\tos=-ose\n\t\t;;\n\tos68k)\n\t\tbasic_machine=m68k-none\n\t\tos=-os68k\n\t\t;;\n\tpa-hitachi)\n\t\tbasic_machine=hppa1.1-hitachi\n\t\tos=-hiuxwe2\n\t\t;;\n\tparagon)\n\t\tbasic_machine=i860-intel\n\t\tos=-osf\n\t\t;;\n\tparisc)\n\t\tbasic_machine=hppa-unknown\n\t\tos=-linux\n\t\t;;\n\tparisc-*)\n\t\tbasic_machine=hppa-`echo $basic_machine | sed 's/^[^-]*-//'`\n\t\tos=-linux\n\t\t;;\n\tpbd)\n\t\tbasic_machine=sparc-tti\n\t\t;;\n\tpbb)\n\t\tbasic_machine=m68k-tti\n\t\t;;\n\tpc532 | pc532-*)\n\t\tbasic_machine=ns32k-pc532\n\t\t;;\n\tpc98)\n\t\tbasic_machine=i386-pc\n\t\t;;\n\tpc98-*)\n\t\tbasic_machine=i386-`echo $basic_machine | sed 's/^[^-]*-//'`\n\t\t;;\n\tpentium | p5 | k5 | k6 | nexgen | viac3)\n\t\tbasic_machine=i586-pc\n\t\t;;\n\tpentiumpro | p6 | 6x86 | athlon | athlon_*)\n\t\tbasic_machine=i686-pc\n\t\t;;\n\tpentiumii | pentium2 | pentiumiii | pentium3)\n\t\tbasic_machine=i686-pc\n\t\t;;\n\tpentium4)\n\t\tbasic_machine=i786-pc\n\t\t;;\n\tpentium-* | p5-* | k5-* | k6-* | nexgen-* | viac3-*)\n\t\tbasic_machine=i586-`echo $basic_machine | sed 's/^[^-]*-//'`\n\t\t;;\n\tpentiumpro-* | p6-* | 6x86-* | athlon-*)\n\t\tbasic_machine=i686-`echo $basic_machine | sed 's/^[^-]*-//'`\n\t\t;;\n\tpentiumii-* | pentium2-* | pentiumiii-* | pentium3-*)\n\t\tbasic_machine=i686-`echo $basic_machine | sed 's/^[^-]*-//'`\n\t\t;;\n\tpentium4-*)\n\t\tbasic_machine=i786-`echo $basic_machine | sed 's/^[^-]*-//'`\n\t\t;;\n\tpn)\n\t\tbasic_machine=pn-gould\n\t\t;;\n\tpower)\tbasic_machine=power-ibm\n\t\t;;\n\tppc | ppcbe)\tbasic_machine=powerpc-unknown\n\t\t;;\n\tppc-* | ppcbe-*)\n\t\tbasic_machine=powerpc-`echo $basic_machine | sed 's/^[^-]*-//'`\n\t\t;;\n\tppcle | powerpclittle | ppc-le | powerpc-little)\n\t\tbasic_machine=powerpcle-unknown\n\t\t;;\n\tppcle-* | powerpclittle-*)\n\t\tbasic_machine=powerpcle-`echo $basic_machine | sed 's/^[^-]*-//'`\n\t\t;;\n\tppc64)\tbasic_machine=powerpc64-unknown\n\t\t;;\n\tppc64-*) basic_machine=powerpc64-`echo $basic_machine | sed 's/^[^-]*-//'`\n\t\t;;\n\tppc64le | powerpc64little | ppc64-le | powerpc64-little)\n\t\tbasic_machine=powerpc64le-unknown\n\t\t;;\n\tppc64le-* | powerpc64little-*)\n\t\tbasic_machine=powerpc64le-`echo $basic_machine | sed 's/^[^-]*-//'`\n\t\t;;\n\tps2)\n\t\tbasic_machine=i386-ibm\n\t\t;;\n\tpw32)\n\t\tbasic_machine=i586-unknown\n\t\tos=-pw32\n\t\t;;\n\trdos | rdos64)\n\t\tbasic_machine=x86_64-pc\n\t\tos=-rdos\n\t\t;;\n\trdos32)\n\t\tbasic_machine=i386-pc\n\t\tos=-rdos\n\t\t;;\n\trom68k)\n\t\tbasic_machine=m68k-rom68k\n\t\tos=-coff\n\t\t;;\n\trm[46]00)\n\t\tbasic_machine=mips-siemens\n\t\t;;\n\trtpc | rtpc-*)\n\t\tbasic_machine=romp-ibm\n\t\t;;\n\ts390 | s390-*)\n\t\tbasic_machine=s390-ibm\n\t\t;;\n\ts390x | s390x-*)\n\t\tbasic_machine=s390x-ibm\n\t\t;;\n\tsa29200)\n\t\tbasic_machine=a29k-amd\n\t\tos=-udi\n\t\t;;\n\tsb1)\n\t\tbasic_machine=mipsisa64sb1-unknown\n\t\t;;\n\tsb1el)\n\t\tbasic_machine=mipsisa64sb1el-unknown\n\t\t;;\n\tsde)\n\t\tbasic_machine=mipsisa32-sde\n\t\tos=-elf\n\t\t;;\n\tsei)\n\t\tbasic_machine=mips-sei\n\t\tos=-seiux\n\t\t;;\n\tsequent)\n\t\tbasic_machine=i386-sequent\n\t\t;;\n\tsh)\n\t\tbasic_machine=sh-hitachi\n\t\tos=-hms\n\t\t;;\n\tsh5el)\n\t\tbasic_machine=sh5le-unknown\n\t\t;;\n\tsh64)\n\t\tbasic_machine=sh64-unknown\n\t\t;;\n\tsparclite-wrs | simso-wrs)\n\t\tbasic_machine=sparclite-wrs\n\t\tos=-vxworks\n\t\t;;\n\tsps7)\n\t\tbasic_machine=m68k-bull\n\t\tos=-sysv2\n\t\t;;\n\tspur)\n\t\tbasic_machine=spur-unknown\n\t\t;;\n\tst2000)\n\t\tbasic_machine=m68k-tandem\n\t\t;;\n\tstratus)\n\t\tbasic_machine=i860-stratus\n\t\tos=-sysv4\n\t\t;;\n\tstrongarm-* | thumb-*)\n\t\tbasic_machine=arm-`echo $basic_machine | sed 's/^[^-]*-//'`\n\t\t;;\n\tsun2)\n\t\tbasic_machine=m68000-sun\n\t\t;;\n\tsun2os3)\n\t\tbasic_machine=m68000-sun\n\t\tos=-sunos3\n\t\t;;\n\tsun2os4)\n\t\tbasic_machine=m68000-sun\n\t\tos=-sunos4\n\t\t;;\n\tsun3os3)\n\t\tbasic_machine=m68k-sun\n\t\tos=-sunos3\n\t\t;;\n\tsun3os4)\n\t\tbasic_machine=m68k-sun\n\t\tos=-sunos4\n\t\t;;\n\tsun4os3)\n\t\tbasic_machine=sparc-sun\n\t\tos=-sunos3\n\t\t;;\n\tsun4os4)\n\t\tbasic_machine=sparc-sun\n\t\tos=-sunos4\n\t\t;;\n\tsun4sol2)\n\t\tbasic_machine=sparc-sun\n\t\tos=-solaris2\n\t\t;;\n\tsun3 | sun3-*)\n\t\tbasic_machine=m68k-sun\n\t\t;;\n\tsun4)\n\t\tbasic_machine=sparc-sun\n\t\t;;\n\tsun386 | sun386i | roadrunner)\n\t\tbasic_machine=i386-sun\n\t\t;;\n\tsv1)\n\t\tbasic_machine=sv1-cray\n\t\tos=-unicos\n\t\t;;\n\tsymmetry)\n\t\tbasic_machine=i386-sequent\n\t\tos=-dynix\n\t\t;;\n\tt3e)\n\t\tbasic_machine=alphaev5-cray\n\t\tos=-unicos\n\t\t;;\n\tt90)\n\t\tbasic_machine=t90-cray\n\t\tos=-unicos\n\t\t;;\n\ttile*)\n\t\tbasic_machine=$basic_machine-unknown\n\t\tos=-linux-gnu\n\t\t;;\n\ttx39)\n\t\tbasic_machine=mipstx39-unknown\n\t\t;;\n\ttx39el)\n\t\tbasic_machine=mipstx39el-unknown\n\t\t;;\n\ttoad1)\n\t\tbasic_machine=pdp10-xkl\n\t\tos=-tops20\n\t\t;;\n\ttower | tower-32)\n\t\tbasic_machine=m68k-ncr\n\t\t;;\n\ttpf)\n\t\tbasic_machine=s390x-ibm\n\t\tos=-tpf\n\t\t;;\n\tudi29k)\n\t\tbasic_machine=a29k-amd\n\t\tos=-udi\n\t\t;;\n\tultra3)\n\t\tbasic_machine=a29k-nyu\n\t\tos=-sym1\n\t\t;;\n\tv810 | necv810)\n\t\tbasic_machine=v810-nec\n\t\tos=-none\n\t\t;;\n\tvaxv)\n\t\tbasic_machine=vax-dec\n\t\tos=-sysv\n\t\t;;\n\tvms)\n\t\tbasic_machine=vax-dec\n\t\tos=-vms\n\t\t;;\n\tvpp*|vx|vx-*)\n\t\tbasic_machine=f301-fujitsu\n\t\t;;\n\tvxworks960)\n\t\tbasic_machine=i960-wrs\n\t\tos=-vxworks\n\t\t;;\n\tvxworks68)\n\t\tbasic_machine=m68k-wrs\n\t\tos=-vxworks\n\t\t;;\n\tvxworks29k)\n\t\tbasic_machine=a29k-wrs\n\t\tos=-vxworks\n\t\t;;\n\tw65*)\n\t\tbasic_machine=w65-wdc\n\t\tos=-none\n\t\t;;\n\tw89k-*)\n\t\tbasic_machine=hppa1.1-winbond\n\t\tos=-proelf\n\t\t;;\n\txbox)\n\t\tbasic_machine=i686-pc\n\t\tos=-mingw32\n\t\t;;\n\txps | xps100)\n\t\tbasic_machine=xps100-honeywell\n\t\t;;\n\txscale-* | xscalee[bl]-*)\n\t\tbasic_machine=`echo $basic_machine | sed 's/^xscale/arm/'`\n\t\t;;\n\tymp)\n\t\tbasic_machine=ymp-cray\n\t\tos=-unicos\n\t\t;;\n\tz8k-*-coff)\n\t\tbasic_machine=z8k-unknown\n\t\tos=-sim\n\t\t;;\n\tz80-*-coff)\n\t\tbasic_machine=z80-unknown\n\t\tos=-sim\n\t\t;;\n\tnone)\n\t\tbasic_machine=none-none\n\t\tos=-none\n\t\t;;\n\n# Here we handle the default manufacturer of certain CPU types.  It is in\n# some cases the only manufacturer, in others, it is the most popular.\n\tw89k)\n\t\tbasic_machine=hppa1.1-winbond\n\t\t;;\n\top50n)\n\t\tbasic_machine=hppa1.1-oki\n\t\t;;\n\top60c)\n\t\tbasic_machine=hppa1.1-oki\n\t\t;;\n\tromp)\n\t\tbasic_machine=romp-ibm\n\t\t;;\n\tmmix)\n\t\tbasic_machine=mmix-knuth\n\t\t;;\n\trs6000)\n\t\tbasic_machine=rs6000-ibm\n\t\t;;\n\tvax)\n\t\tbasic_machine=vax-dec\n\t\t;;\n\tpdp10)\n\t\t# there are many clones, so DEC is not a safe bet\n\t\tbasic_machine=pdp10-unknown\n\t\t;;\n\tpdp11)\n\t\tbasic_machine=pdp11-dec\n\t\t;;\n\twe32k)\n\t\tbasic_machine=we32k-att\n\t\t;;\n\tsh[1234] | sh[24]a | sh[24]aeb | sh[34]eb | sh[1234]le | sh[23]ele)\n\t\tbasic_machine=sh-unknown\n\t\t;;\n\tsparc | sparcv8 | sparcv9 | sparcv9b | sparcv9v)\n\t\tbasic_machine=sparc-sun\n\t\t;;\n\tcydra)\n\t\tbasic_machine=cydra-cydrome\n\t\t;;\n\torion)\n\t\tbasic_machine=orion-highlevel\n\t\t;;\n\torion105)\n\t\tbasic_machine=clipper-highlevel\n\t\t;;\n\tmac | mpw | mac-mpw)\n\t\tbasic_machine=m68k-apple\n\t\t;;\n\tpmac | pmac-mpw)\n\t\tbasic_machine=powerpc-apple\n\t\t;;\n\t*-unknown)\n\t\t# Make sure to match an already-canonicalized machine name.\n\t\t;;\n\t*)\n\t\techo Invalid configuration \\`$1\\': machine \\`$basic_machine\\' not recognized 1>&2\n\t\texit 1\n\t\t;;\nesac\n\n# Here we canonicalize certain aliases for manufacturers.\ncase $basic_machine in\n\t*-digital*)\n\t\tbasic_machine=`echo $basic_machine | sed 's/digital.*/dec/'`\n\t\t;;\n\t*-commodore*)\n\t\tbasic_machine=`echo $basic_machine | sed 's/commodore.*/cbm/'`\n\t\t;;\n\t*)\n\t\t;;\nesac\n\n# Decode manufacturer-specific aliases for certain operating systems.\n\nif [ x\"$os\" != x\"\" ]\nthen\ncase $os in\n\t# First match some system type aliases\n\t# that might get confused with valid system types.\n\t# -solaris* is a basic system type, with this one exception.\n\t-auroraux)\n\t\tos=-auroraux\n\t\t;;\n\t-solaris1 | -solaris1.*)\n\t\tos=`echo $os | sed -e 's|solaris1|sunos4|'`\n\t\t;;\n\t-solaris)\n\t\tos=-solaris2\n\t\t;;\n\t-svr4*)\n\t\tos=-sysv4\n\t\t;;\n\t-unixware*)\n\t\tos=-sysv4.2uw\n\t\t;;\n\t-gnu/linux*)\n\t\tos=`echo $os | sed -e 's|gnu/linux|linux-gnu|'`\n\t\t;;\n\t# First accept the basic system types.\n\t# The portable systems comes first.\n\t# Each alternative MUST END IN A *, to match a version number.\n\t# -sysv* is not here because it comes later, after sysvr4.\n\t-gnu* | -bsd* | -mach* | -minix* | -genix* | -ultrix* | -irix* \\\n\t      | -*vms* | -sco* | -esix* | -isc* | -aix* | -cnk* | -sunos | -sunos[34]*\\\n\t      | -hpux* | -unos* | -osf* | -luna* | -dgux* | -auroraux* | -solaris* \\\n\t      | -sym* | -kopensolaris* | -plan9* \\\n\t      | -amigaos* | -amigados* | -msdos* | -newsos* | -unicos* | -aof* \\\n\t      | -aos* | -aros* \\\n\t      | -nindy* | -vxsim* | -vxworks* | -ebmon* | -hms* | -mvs* \\\n\t      | -clix* | -riscos* | -uniplus* | -iris* | -rtu* | -xenix* \\\n\t      | -hiux* | -386bsd* | -knetbsd* | -mirbsd* | -netbsd* \\\n\t      | -bitrig* | -openbsd* | -solidbsd* \\\n\t      | -ekkobsd* | -kfreebsd* | -freebsd* | -riscix* | -lynxos* \\\n\t      | -bosx* | -nextstep* | -cxux* | -aout* | -elf* | -oabi* \\\n\t      | -ptx* | -coff* | -ecoff* | -winnt* | -domain* | -vsta* \\\n\t      | -udi* | -eabi* | -lites* | -ieee* | -go32* | -aux* \\\n\t      | -chorusos* | -chorusrdb* | -cegcc* \\\n\t      | -cygwin* | -msys* | -pe* | -psos* | -moss* | -proelf* | -rtems* \\\n\t      | -mingw32* | -mingw64* | -linux-gnu* | -linux-android* \\\n\t      | -linux-newlib* | -linux-musl* | -linux-uclibc* \\\n\t      | -uxpv* | -beos* | -mpeix* | -udk* \\\n\t      | -interix* | -uwin* | -mks* | -rhapsody* | -darwin* | -opened* \\\n\t      | -openstep* | -oskit* | -conix* | -pw32* | -nonstopux* \\\n\t      | -storm-chaos* | -tops10* | -tenex* | -tops20* | -its* \\\n\t      | -os2* | -vos* | -palmos* | -uclinux* | -nucleus* \\\n\t      | -morphos* | -superux* | -rtmk* | -rtmk-nova* | -windiss* \\\n\t      | -powermax* | -dnix* | -nx6 | -nx7 | -sei* | -dragonfly* \\\n\t      | -skyos* | -haiku* | -rdos* | -toppers* | -drops* | -es*)\n\t# Remember, each alternative MUST END IN *, to match a version number.\n\t\t;;\n\t-qnx*)\n\t\tcase $basic_machine in\n\t\t    x86-* | i*86-*)\n\t\t\t;;\n\t\t    *)\n\t\t\tos=-nto$os\n\t\t\t;;\n\t\tesac\n\t\t;;\n\t-nto-qnx*)\n\t\t;;\n\t-nto*)\n\t\tos=`echo $os | sed -e 's|nto|nto-qnx|'`\n\t\t;;\n\t-sim | -es1800* | -hms* | -xray | -os68k* | -none* | -v88r* \\\n\t      | -windows* | -osx | -abug | -netware* | -os9* | -beos* | -haiku* \\\n\t      | -macos* | -mpw* | -magic* | -mmixware* | -mon960* | -lnews*)\n\t\t;;\n\t-mac*)\n\t\tos=`echo $os | sed -e 's|mac|macos|'`\n\t\t;;\n\t-linux-dietlibc)\n\t\tos=-linux-dietlibc\n\t\t;;\n\t-linux*)\n\t\tos=`echo $os | sed -e 's|linux|linux-gnu|'`\n\t\t;;\n\t-sunos5*)\n\t\tos=`echo $os | sed -e 's|sunos5|solaris2|'`\n\t\t;;\n\t-sunos6*)\n\t\tos=`echo $os | sed -e 's|sunos6|solaris3|'`\n\t\t;;\n\t-opened*)\n\t\tos=-openedition\n\t\t;;\n\t-os400*)\n\t\tos=-os400\n\t\t;;\n\t-wince*)\n\t\tos=-wince\n\t\t;;\n\t-osfrose*)\n\t\tos=-osfrose\n\t\t;;\n\t-osf*)\n\t\tos=-osf\n\t\t;;\n\t-utek*)\n\t\tos=-bsd\n\t\t;;\n\t-dynix*)\n\t\tos=-bsd\n\t\t;;\n\t-acis*)\n\t\tos=-aos\n\t\t;;\n\t-atheos*)\n\t\tos=-atheos\n\t\t;;\n\t-syllable*)\n\t\tos=-syllable\n\t\t;;\n\t-386bsd)\n\t\tos=-bsd\n\t\t;;\n\t-ctix* | -uts*)\n\t\tos=-sysv\n\t\t;;\n\t-nova*)\n\t\tos=-rtmk-nova\n\t\t;;\n\t-ns2 )\n\t\tos=-nextstep2\n\t\t;;\n\t-nsk*)\n\t\tos=-nsk\n\t\t;;\n\t# Preserve the version number of sinix5.\n\t-sinix5.*)\n\t\tos=`echo $os | sed -e 's|sinix|sysv|'`\n\t\t;;\n\t-sinix*)\n\t\tos=-sysv4\n\t\t;;\n\t-tpf*)\n\t\tos=-tpf\n\t\t;;\n\t-triton*)\n\t\tos=-sysv3\n\t\t;;\n\t-oss*)\n\t\tos=-sysv3\n\t\t;;\n\t-svr4)\n\t\tos=-sysv4\n\t\t;;\n\t-svr3)\n\t\tos=-sysv3\n\t\t;;\n\t-sysvr4)\n\t\tos=-sysv4\n\t\t;;\n\t# This must come after -sysvr4.\n\t-sysv*)\n\t\t;;\n\t-ose*)\n\t\tos=-ose\n\t\t;;\n\t-es1800*)\n\t\tos=-ose\n\t\t;;\n\t-xenix)\n\t\tos=-xenix\n\t\t;;\n\t-*mint | -mint[0-9]* | -*MiNT | -MiNT[0-9]*)\n\t\tos=-mint\n\t\t;;\n\t-aros*)\n\t\tos=-aros\n\t\t;;\n\t-zvmoe)\n\t\tos=-zvmoe\n\t\t;;\n\t-dicos*)\n\t\tos=-dicos\n\t\t;;\n\t-nacl*)\n\t\t;;\n\t-none)\n\t\t;;\n\t*)\n\t\t# Get rid of the `-' at the beginning of $os.\n\t\tos=`echo $os | sed 's/[^-]*-//'`\n\t\techo Invalid configuration \\`$1\\': system \\`$os\\' not recognized 1>&2\n\t\texit 1\n\t\t;;\nesac\nelse\n\n# Here we handle the default operating systems that come with various machines.\n# The value should be what the vendor currently ships out the door with their\n# machine or put another way, the most popular os provided with the machine.\n\n# Note that if you're going to try to match \"-MANUFACTURER\" here (say,\n# \"-sun\"), then you have to tell the case statement up towards the top\n# that MANUFACTURER isn't an operating system.  Otherwise, code above\n# will signal an error saying that MANUFACTURER isn't an operating\n# system, and we'll never get to this point.\n\ncase $basic_machine in\n\tscore-*)\n\t\tos=-elf\n\t\t;;\n\tspu-*)\n\t\tos=-elf\n\t\t;;\n\t*-acorn)\n\t\tos=-riscix1.2\n\t\t;;\n\tarm*-rebel)\n\t\tos=-linux\n\t\t;;\n\tarm*-semi)\n\t\tos=-aout\n\t\t;;\n\tc4x-* | tic4x-*)\n\t\tos=-coff\n\t\t;;\n\tc8051-*)\n\t\tos=-elf\n\t\t;;\n\thexagon-*)\n\t\tos=-elf\n\t\t;;\n\ttic54x-*)\n\t\tos=-coff\n\t\t;;\n\ttic55x-*)\n\t\tos=-coff\n\t\t;;\n\ttic6x-*)\n\t\tos=-coff\n\t\t;;\n\t# This must come before the *-dec entry.\n\tpdp10-*)\n\t\tos=-tops20\n\t\t;;\n\tpdp11-*)\n\t\tos=-none\n\t\t;;\n\t*-dec | vax-*)\n\t\tos=-ultrix4.2\n\t\t;;\n\tm68*-apollo)\n\t\tos=-domain\n\t\t;;\n\ti386-sun)\n\t\tos=-sunos4.0.2\n\t\t;;\n\tm68000-sun)\n\t\tos=-sunos3\n\t\t;;\n\tm68*-cisco)\n\t\tos=-aout\n\t\t;;\n\tmep-*)\n\t\tos=-elf\n\t\t;;\n\tmips*-cisco)\n\t\tos=-elf\n\t\t;;\n\tmips*-*)\n\t\tos=-elf\n\t\t;;\n\tor1k-*)\n\t\tos=-elf\n\t\t;;\n\tor32-*)\n\t\tos=-coff\n\t\t;;\n\t*-tti)\t# must be before sparc entry or we get the wrong os.\n\t\tos=-sysv3\n\t\t;;\n\tsparc-* | *-sun)\n\t\tos=-sunos4.1.1\n\t\t;;\n\t*-be)\n\t\tos=-beos\n\t\t;;\n\t*-haiku)\n\t\tos=-haiku\n\t\t;;\n\t*-ibm)\n\t\tos=-aix\n\t\t;;\n\t*-knuth)\n\t\tos=-mmixware\n\t\t;;\n\t*-wec)\n\t\tos=-proelf\n\t\t;;\n\t*-winbond)\n\t\tos=-proelf\n\t\t;;\n\t*-oki)\n\t\tos=-proelf\n\t\t;;\n\t*-hp)\n\t\tos=-hpux\n\t\t;;\n\t*-hitachi)\n\t\tos=-hiux\n\t\t;;\n\ti860-* | *-att | *-ncr | *-altos | *-motorola | *-convergent)\n\t\tos=-sysv\n\t\t;;\n\t*-cbm)\n\t\tos=-amigaos\n\t\t;;\n\t*-dg)\n\t\tos=-dgux\n\t\t;;\n\t*-dolphin)\n\t\tos=-sysv3\n\t\t;;\n\tm68k-ccur)\n\t\tos=-rtu\n\t\t;;\n\tm88k-omron*)\n\t\tos=-luna\n\t\t;;\n\t*-next )\n\t\tos=-nextstep\n\t\t;;\n\t*-sequent)\n\t\tos=-ptx\n\t\t;;\n\t*-crds)\n\t\tos=-unos\n\t\t;;\n\t*-ns)\n\t\tos=-genix\n\t\t;;\n\ti370-*)\n\t\tos=-mvs\n\t\t;;\n\t*-next)\n\t\tos=-nextstep3\n\t\t;;\n\t*-gould)\n\t\tos=-sysv\n\t\t;;\n\t*-highlevel)\n\t\tos=-bsd\n\t\t;;\n\t*-encore)\n\t\tos=-bsd\n\t\t;;\n\t*-sgi)\n\t\tos=-irix\n\t\t;;\n\t*-siemens)\n\t\tos=-sysv4\n\t\t;;\n\t*-masscomp)\n\t\tos=-rtu\n\t\t;;\n\tf30[01]-fujitsu | f700-fujitsu)\n\t\tos=-uxpv\n\t\t;;\n\t*-rom68k)\n\t\tos=-coff\n\t\t;;\n\t*-*bug)\n\t\tos=-coff\n\t\t;;\n\t*-apple)\n\t\tos=-macos\n\t\t;;\n\t*-atari*)\n\t\tos=-mint\n\t\t;;\n\t*)\n\t\tos=-none\n\t\t;;\nesac\nfi\n\n# Here we handle the case where we know the os, and the CPU type, but not the\n# manufacturer.  We pick the logical manufacturer.\nvendor=unknown\ncase $basic_machine in\n\t*-unknown)\n\t\tcase $os in\n\t\t\t-riscix*)\n\t\t\t\tvendor=acorn\n\t\t\t\t;;\n\t\t\t-sunos*)\n\t\t\t\tvendor=sun\n\t\t\t\t;;\n\t\t\t-cnk*|-aix*)\n\t\t\t\tvendor=ibm\n\t\t\t\t;;\n\t\t\t-beos*)\n\t\t\t\tvendor=be\n\t\t\t\t;;\n\t\t\t-hpux*)\n\t\t\t\tvendor=hp\n\t\t\t\t;;\n\t\t\t-mpeix*)\n\t\t\t\tvendor=hp\n\t\t\t\t;;\n\t\t\t-hiux*)\n\t\t\t\tvendor=hitachi\n\t\t\t\t;;\n\t\t\t-unos*)\n\t\t\t\tvendor=crds\n\t\t\t\t;;\n\t\t\t-dgux*)\n\t\t\t\tvendor=dg\n\t\t\t\t;;\n\t\t\t-luna*)\n\t\t\t\tvendor=omron\n\t\t\t\t;;\n\t\t\t-genix*)\n\t\t\t\tvendor=ns\n\t\t\t\t;;\n\t\t\t-mvs* | -opened*)\n\t\t\t\tvendor=ibm\n\t\t\t\t;;\n\t\t\t-os400*)\n\t\t\t\tvendor=ibm\n\t\t\t\t;;\n\t\t\t-ptx*)\n\t\t\t\tvendor=sequent\n\t\t\t\t;;\n\t\t\t-tpf*)\n\t\t\t\tvendor=ibm\n\t\t\t\t;;\n\t\t\t-vxsim* | -vxworks* | -windiss*)\n\t\t\t\tvendor=wrs\n\t\t\t\t;;\n\t\t\t-aux*)\n\t\t\t\tvendor=apple\n\t\t\t\t;;\n\t\t\t-hms*)\n\t\t\t\tvendor=hitachi\n\t\t\t\t;;\n\t\t\t-mpw* | -macos*)\n\t\t\t\tvendor=apple\n\t\t\t\t;;\n\t\t\t-*mint | -mint[0-9]* | -*MiNT | -MiNT[0-9]*)\n\t\t\t\tvendor=atari\n\t\t\t\t;;\n\t\t\t-vos*)\n\t\t\t\tvendor=stratus\n\t\t\t\t;;\n\t\tesac\n\t\tbasic_machine=`echo $basic_machine | sed \"s/unknown/$vendor/\"`\n\t\t;;\nesac\n\necho $basic_machine$os\nexit\n\n# Local variables:\n# eval: (add-hook 'write-file-hooks 'time-stamp)\n# time-stamp-start: \"timestamp='\"\n# time-stamp-format: \"%:y-%02m-%02d\"\n# time-stamp-end: \"'\"\n# End:\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/configure",
    "content": "#! /bin/sh\n# Guess values for system-dependent variables and create Makefiles.\n# Generated by GNU Autoconf 2.69 for OpenFst 1.6.7.\n#\n# Report bugs to <help@www.openfst.org>.\n#\n#\n# Copyright (C) 1992-1996, 1998-2012 Free Software Foundation, Inc.\n#\n#\n# This configure script is free software; the Free Software Foundation\n# gives unlimited permission to copy, distribute and modify it.\n## -------------------- ##\n## M4sh Initialization. ##\n## -------------------- ##\n\n# Be more Bourne compatible\nDUALCASE=1; export DUALCASE # for MKS sh\nif test -n \"${ZSH_VERSION+set}\" && (emulate sh) >/dev/null 2>&1; then :\n  emulate sh\n  NULLCMD=:\n  # Pre-4.2 versions of Zsh do word splitting on ${1+\"$@\"}, which\n  # is contrary to our usage.  Disable this feature.\n  alias -g '${1+\"$@\"}'='\"$@\"'\n  setopt NO_GLOB_SUBST\nelse\n  case `(set -o) 2>/dev/null` in #(\n  *posix*) :\n    set -o posix ;; #(\n  *) :\n     ;;\nesac\nfi\n\n\nas_nl='\n'\nexport as_nl\n# Printing a long string crashes Solaris 7 /usr/bin/printf.\nas_echo='\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\'\nas_echo=$as_echo$as_echo$as_echo$as_echo$as_echo\nas_echo=$as_echo$as_echo$as_echo$as_echo$as_echo$as_echo\n# Prefer a ksh shell builtin over an external printf program on Solaris,\n# but without wasting forks for bash or zsh.\nif test -z \"$BASH_VERSION$ZSH_VERSION\" \\\n    && (test \"X`print -r -- $as_echo`\" = \"X$as_echo\") 2>/dev/null; then\n  as_echo='print -r --'\n  as_echo_n='print -rn --'\nelif (test \"X`printf %s $as_echo`\" = \"X$as_echo\") 2>/dev/null; then\n  as_echo='printf %s\\n'\n  as_echo_n='printf %s'\nelse\n  if test \"X`(/usr/ucb/echo -n -n $as_echo) 2>/dev/null`\" = \"X-n $as_echo\"; then\n    as_echo_body='eval /usr/ucb/echo -n \"$1$as_nl\"'\n    as_echo_n='/usr/ucb/echo -n'\n  else\n    as_echo_body='eval expr \"X$1\" : \"X\\\\(.*\\\\)\"'\n    as_echo_n_body='eval\n      arg=$1;\n      case $arg in #(\n      *\"$as_nl\"*)\n\texpr \"X$arg\" : \"X\\\\(.*\\\\)$as_nl\";\n\targ=`expr \"X$arg\" : \".*$as_nl\\\\(.*\\\\)\"`;;\n      esac;\n      expr \"X$arg\" : \"X\\\\(.*\\\\)\" | tr -d \"$as_nl\"\n    '\n    export as_echo_n_body\n    as_echo_n='sh -c $as_echo_n_body as_echo'\n  fi\n  export as_echo_body\n  as_echo='sh -c $as_echo_body as_echo'\nfi\n\n# The user is always right.\nif test \"${PATH_SEPARATOR+set}\" != set; then\n  PATH_SEPARATOR=:\n  (PATH='/bin;/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 && {\n    (PATH='/bin:/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 ||\n      PATH_SEPARATOR=';'\n  }\nfi\n\n\n# IFS\n# We need space, tab and new line, in precisely that order.  Quoting is\n# there to prevent editors from complaining about space-tab.\n# (If _AS_PATH_WALK were called with IFS unset, it would disable word\n# splitting by setting IFS to empty value.)\nIFS=\" \"\"\t$as_nl\"\n\n# Find who we are.  Look in the path if we contain no directory separator.\nas_myself=\ncase $0 in #((\n  *[\\\\/]* ) as_myself=$0 ;;\n  *) as_save_IFS=$IFS; IFS=$PATH_SEPARATOR\nfor as_dir in $PATH\ndo\n  IFS=$as_save_IFS\n  test -z \"$as_dir\" && as_dir=.\n    test -r \"$as_dir/$0\" && as_myself=$as_dir/$0 && break\n  done\nIFS=$as_save_IFS\n\n     ;;\nesac\n# We did not find ourselves, most probably we were run as `sh COMMAND'\n# in which case we are not to be found in the path.\nif test \"x$as_myself\" = x; then\n  as_myself=$0\nfi\nif test ! -f \"$as_myself\"; then\n  $as_echo \"$as_myself: error: cannot find myself; rerun with an absolute file name\" >&2\n  exit 1\nfi\n\n# Unset variables that we do not need and which cause bugs (e.g. in\n# pre-3.0 UWIN ksh).  But do not cause bugs in bash 2.01; the \"|| exit 1\"\n# suppresses any \"Segmentation fault\" message there.  '((' could\n# trigger a bug in pdksh 5.2.14.\nfor as_var in BASH_ENV ENV MAIL MAILPATH\ndo eval test x\\${$as_var+set} = xset \\\n  && ( (unset $as_var) || exit 1) >/dev/null 2>&1 && unset $as_var || :\ndone\nPS1='$ '\nPS2='> '\nPS4='+ '\n\n# NLS nuisances.\nLC_ALL=C\nexport LC_ALL\nLANGUAGE=C\nexport LANGUAGE\n\n# CDPATH.\n(unset CDPATH) >/dev/null 2>&1 && unset CDPATH\n\n# Use a proper internal environment variable to ensure we don't fall\n  # into an infinite loop, continuously re-executing ourselves.\n  if test x\"${_as_can_reexec}\" != xno && test \"x$CONFIG_SHELL\" != x; then\n    _as_can_reexec=no; export _as_can_reexec;\n    # We cannot yet assume a decent shell, so we have to provide a\n# neutralization value for shells without unset; and this also\n# works around shells that cannot unset nonexistent variables.\n# Preserve -v and -x to the replacement shell.\nBASH_ENV=/dev/null\nENV=/dev/null\n(unset BASH_ENV) >/dev/null 2>&1 && unset BASH_ENV ENV\ncase $- in # ((((\n  *v*x* | *x*v* ) as_opts=-vx ;;\n  *v* ) as_opts=-v ;;\n  *x* ) as_opts=-x ;;\n  * ) as_opts= ;;\nesac\nexec $CONFIG_SHELL $as_opts \"$as_myself\" ${1+\"$@\"}\n# Admittedly, this is quite paranoid, since all the known shells bail\n# out after a failed `exec'.\n$as_echo \"$0: could not re-execute with $CONFIG_SHELL\" >&2\nas_fn_exit 255\n  fi\n  # We don't want this to propagate to other subprocesses.\n          { _as_can_reexec=; unset _as_can_reexec;}\nif test \"x$CONFIG_SHELL\" = x; then\n  as_bourne_compatible=\"if test -n \\\"\\${ZSH_VERSION+set}\\\" && (emulate sh) >/dev/null 2>&1; then :\n  emulate sh\n  NULLCMD=:\n  # Pre-4.2 versions of Zsh do word splitting on \\${1+\\\"\\$@\\\"}, which\n  # is contrary to our usage.  Disable this feature.\n  alias -g '\\${1+\\\"\\$@\\\"}'='\\\"\\$@\\\"'\n  setopt NO_GLOB_SUBST\nelse\n  case \\`(set -o) 2>/dev/null\\` in #(\n  *posix*) :\n    set -o posix ;; #(\n  *) :\n     ;;\nesac\nfi\n\"\n  as_required=\"as_fn_return () { (exit \\$1); }\nas_fn_success () { as_fn_return 0; }\nas_fn_failure () { as_fn_return 1; }\nas_fn_ret_success () { return 0; }\nas_fn_ret_failure () { return 1; }\n\nexitcode=0\nas_fn_success || { exitcode=1; echo as_fn_success failed.; }\nas_fn_failure && { exitcode=1; echo as_fn_failure succeeded.; }\nas_fn_ret_success || { exitcode=1; echo as_fn_ret_success failed.; }\nas_fn_ret_failure && { exitcode=1; echo as_fn_ret_failure succeeded.; }\nif ( set x; as_fn_ret_success y && test x = \\\"\\$1\\\" ); then :\n\nelse\n  exitcode=1; echo positional parameters were not saved.\nfi\ntest x\\$exitcode = x0 || exit 1\ntest -x / || exit 1\"\n  as_suggested=\"  as_lineno_1=\";as_suggested=$as_suggested$LINENO;as_suggested=$as_suggested\" as_lineno_1a=\\$LINENO\n  as_lineno_2=\";as_suggested=$as_suggested$LINENO;as_suggested=$as_suggested\" as_lineno_2a=\\$LINENO\n  eval 'test \\\"x\\$as_lineno_1'\\$as_run'\\\" != \\\"x\\$as_lineno_2'\\$as_run'\\\" &&\n  test \\\"x\\`expr \\$as_lineno_1'\\$as_run' + 1\\`\\\" = \\\"x\\$as_lineno_2'\\$as_run'\\\"' || exit 1\n\n  test -n \\\"\\${ZSH_VERSION+set}\\${BASH_VERSION+set}\\\" || (\n    ECHO='\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\'\n    ECHO=\\$ECHO\\$ECHO\\$ECHO\\$ECHO\\$ECHO\n    ECHO=\\$ECHO\\$ECHO\\$ECHO\\$ECHO\\$ECHO\\$ECHO\n    PATH=/empty FPATH=/empty; export PATH FPATH\n    test \\\"X\\`printf %s \\$ECHO\\`\\\" = \\\"X\\$ECHO\\\" \\\\\n      || test \\\"X\\`print -r -- \\$ECHO\\`\\\" = \\\"X\\$ECHO\\\" ) || exit 1\ntest \\$(( 1 + 1 )) = 2 || exit 1\"\n  if (eval \"$as_required\") 2>/dev/null; then :\n  as_have_required=yes\nelse\n  as_have_required=no\nfi\n  if test x$as_have_required = xyes && (eval \"$as_suggested\") 2>/dev/null; then :\n\nelse\n  as_save_IFS=$IFS; IFS=$PATH_SEPARATOR\nas_found=false\nfor as_dir in /bin$PATH_SEPARATOR/usr/bin$PATH_SEPARATOR$PATH\ndo\n  IFS=$as_save_IFS\n  test -z \"$as_dir\" && as_dir=.\n  as_found=:\n  case $as_dir in #(\n\t /*)\n\t   for as_base in sh bash ksh sh5; do\n\t     # Try only shells that exist, to save several forks.\n\t     as_shell=$as_dir/$as_base\n\t     if { test -f \"$as_shell\" || test -f \"$as_shell.exe\"; } &&\n\t\t    { $as_echo \"$as_bourne_compatible\"\"$as_required\" | as_run=a \"$as_shell\"; } 2>/dev/null; then :\n  CONFIG_SHELL=$as_shell as_have_required=yes\n\t\t   if { $as_echo \"$as_bourne_compatible\"\"$as_suggested\" | as_run=a \"$as_shell\"; } 2>/dev/null; then :\n  break 2\nfi\nfi\n\t   done;;\n       esac\n  as_found=false\ndone\n$as_found || { if { test -f \"$SHELL\" || test -f \"$SHELL.exe\"; } &&\n\t      { $as_echo \"$as_bourne_compatible\"\"$as_required\" | as_run=a \"$SHELL\"; } 2>/dev/null; then :\n  CONFIG_SHELL=$SHELL as_have_required=yes\nfi; }\nIFS=$as_save_IFS\n\n\n      if test \"x$CONFIG_SHELL\" != x; then :\n  export CONFIG_SHELL\n             # We cannot yet assume a decent shell, so we have to provide a\n# neutralization value for shells without unset; and this also\n# works around shells that cannot unset nonexistent variables.\n# Preserve -v and -x to the replacement shell.\nBASH_ENV=/dev/null\nENV=/dev/null\n(unset BASH_ENV) >/dev/null 2>&1 && unset BASH_ENV ENV\ncase $- in # ((((\n  *v*x* | *x*v* ) as_opts=-vx ;;\n  *v* ) as_opts=-v ;;\n  *x* ) as_opts=-x ;;\n  * ) as_opts= ;;\nesac\nexec $CONFIG_SHELL $as_opts \"$as_myself\" ${1+\"$@\"}\n# Admittedly, this is quite paranoid, since all the known shells bail\n# out after a failed `exec'.\n$as_echo \"$0: could not re-execute with $CONFIG_SHELL\" >&2\nexit 255\nfi\n\n    if test x$as_have_required = xno; then :\n  $as_echo \"$0: This script requires a shell more modern than all\"\n  $as_echo \"$0: the shells that I found on your system.\"\n  if test x${ZSH_VERSION+set} = xset ; then\n    $as_echo \"$0: In particular, zsh $ZSH_VERSION has bugs and should\"\n    $as_echo \"$0: be upgraded to zsh 4.3.4 or later.\"\n  else\n    $as_echo \"$0: Please tell bug-autoconf@gnu.org and\n$0: help@www.openfst.org about your system, including any\n$0: error possibly output before this message. Then install\n$0: a modern shell, or manually run the script under such a\n$0: shell if you do have one.\"\n  fi\n  exit 1\nfi\nfi\nfi\nSHELL=${CONFIG_SHELL-/bin/sh}\nexport SHELL\n# Unset more variables known to interfere with behavior of common tools.\nCLICOLOR_FORCE= GREP_OPTIONS=\nunset CLICOLOR_FORCE GREP_OPTIONS\n\n## --------------------- ##\n## M4sh Shell Functions. ##\n## --------------------- ##\n# as_fn_unset VAR\n# ---------------\n# Portably unset VAR.\nas_fn_unset ()\n{\n  { eval $1=; unset $1;}\n}\nas_unset=as_fn_unset\n\n# as_fn_set_status STATUS\n# -----------------------\n# Set $? to STATUS, without forking.\nas_fn_set_status ()\n{\n  return $1\n} # as_fn_set_status\n\n# as_fn_exit STATUS\n# -----------------\n# Exit the shell with STATUS, even in a \"trap 0\" or \"set -e\" context.\nas_fn_exit ()\n{\n  set +e\n  as_fn_set_status $1\n  exit $1\n} # as_fn_exit\n\n# as_fn_mkdir_p\n# -------------\n# Create \"$as_dir\" as a directory, including parents if necessary.\nas_fn_mkdir_p ()\n{\n\n  case $as_dir in #(\n  -*) as_dir=./$as_dir;;\n  esac\n  test -d \"$as_dir\" || eval $as_mkdir_p || {\n    as_dirs=\n    while :; do\n      case $as_dir in #(\n      *\\'*) as_qdir=`$as_echo \"$as_dir\" | sed \"s/'/'\\\\\\\\\\\\\\\\''/g\"`;; #'(\n      *) as_qdir=$as_dir;;\n      esac\n      as_dirs=\"'$as_qdir' $as_dirs\"\n      as_dir=`$as_dirname -- \"$as_dir\" ||\n$as_expr X\"$as_dir\" : 'X\\(.*[^/]\\)//*[^/][^/]*/*$' \\| \\\n\t X\"$as_dir\" : 'X\\(//\\)[^/]' \\| \\\n\t X\"$as_dir\" : 'X\\(//\\)$' \\| \\\n\t X\"$as_dir\" : 'X\\(/\\)' \\| . 2>/dev/null ||\n$as_echo X\"$as_dir\" |\n    sed '/^X\\(.*[^/]\\)\\/\\/*[^/][^/]*\\/*$/{\n\t    s//\\1/\n\t    q\n\t  }\n\t  /^X\\(\\/\\/\\)[^/].*/{\n\t    s//\\1/\n\t    q\n\t  }\n\t  /^X\\(\\/\\/\\)$/{\n\t    s//\\1/\n\t    q\n\t  }\n\t  /^X\\(\\/\\).*/{\n\t    s//\\1/\n\t    q\n\t  }\n\t  s/.*/./; q'`\n      test -d \"$as_dir\" && break\n    done\n    test -z \"$as_dirs\" || eval \"mkdir $as_dirs\"\n  } || test -d \"$as_dir\" || as_fn_error $? \"cannot create directory $as_dir\"\n\n\n} # as_fn_mkdir_p\n\n# as_fn_executable_p FILE\n# -----------------------\n# Test if FILE is an executable regular file.\nas_fn_executable_p ()\n{\n  test -f \"$1\" && test -x \"$1\"\n} # as_fn_executable_p\n# as_fn_append VAR VALUE\n# ----------------------\n# Append the text in VALUE to the end of the definition contained in VAR. Take\n# advantage of any shell optimizations that allow amortized linear growth over\n# repeated appends, instead of the typical quadratic growth present in naive\n# implementations.\nif (eval \"as_var=1; as_var+=2; test x\\$as_var = x12\") 2>/dev/null; then :\n  eval 'as_fn_append ()\n  {\n    eval $1+=\\$2\n  }'\nelse\n  as_fn_append ()\n  {\n    eval $1=\\$$1\\$2\n  }\nfi # as_fn_append\n\n# as_fn_arith ARG...\n# ------------------\n# Perform arithmetic evaluation on the ARGs, and store the result in the\n# global $as_val. Take advantage of shells that can avoid forks. The arguments\n# must be portable across $(()) and expr.\nif (eval \"test \\$(( 1 + 1 )) = 2\") 2>/dev/null; then :\n  eval 'as_fn_arith ()\n  {\n    as_val=$(( $* ))\n  }'\nelse\n  as_fn_arith ()\n  {\n    as_val=`expr \"$@\" || test $? -eq 1`\n  }\nfi # as_fn_arith\n\n\n# as_fn_error STATUS ERROR [LINENO LOG_FD]\n# ----------------------------------------\n# Output \"`basename $0`: error: ERROR\" to stderr. If LINENO and LOG_FD are\n# provided, also output the error to LOG_FD, referencing LINENO. Then exit the\n# script with STATUS, using 1 if that was 0.\nas_fn_error ()\n{\n  as_status=$1; test $as_status -eq 0 && as_status=1\n  if test \"$4\"; then\n    as_lineno=${as_lineno-\"$3\"} as_lineno_stack=as_lineno_stack=$as_lineno_stack\n    $as_echo \"$as_me:${as_lineno-$LINENO}: error: $2\" >&$4\n  fi\n  $as_echo \"$as_me: error: $2\" >&2\n  as_fn_exit $as_status\n} # as_fn_error\n\nif expr a : '\\(a\\)' >/dev/null 2>&1 &&\n   test \"X`expr 00001 : '.*\\(...\\)'`\" = X001; then\n  as_expr=expr\nelse\n  as_expr=false\nfi\n\nif (basename -- /) >/dev/null 2>&1 && test \"X`basename -- / 2>&1`\" = \"X/\"; then\n  as_basename=basename\nelse\n  as_basename=false\nfi\n\nif (as_dir=`dirname -- /` && test \"X$as_dir\" = X/) >/dev/null 2>&1; then\n  as_dirname=dirname\nelse\n  as_dirname=false\nfi\n\nas_me=`$as_basename -- \"$0\" ||\n$as_expr X/\"$0\" : '.*/\\([^/][^/]*\\)/*$' \\| \\\n\t X\"$0\" : 'X\\(//\\)$' \\| \\\n\t X\"$0\" : 'X\\(/\\)' \\| . 2>/dev/null ||\n$as_echo X/\"$0\" |\n    sed '/^.*\\/\\([^/][^/]*\\)\\/*$/{\n\t    s//\\1/\n\t    q\n\t  }\n\t  /^X\\/\\(\\/\\/\\)$/{\n\t    s//\\1/\n\t    q\n\t  }\n\t  /^X\\/\\(\\/\\).*/{\n\t    s//\\1/\n\t    q\n\t  }\n\t  s/.*/./; q'`\n\n# Avoid depending upon Character Ranges.\nas_cr_letters='abcdefghijklmnopqrstuvwxyz'\nas_cr_LETTERS='ABCDEFGHIJKLMNOPQRSTUVWXYZ'\nas_cr_Letters=$as_cr_letters$as_cr_LETTERS\nas_cr_digits='0123456789'\nas_cr_alnum=$as_cr_Letters$as_cr_digits\n\n\n  as_lineno_1=$LINENO as_lineno_1a=$LINENO\n  as_lineno_2=$LINENO as_lineno_2a=$LINENO\n  eval 'test \"x$as_lineno_1'$as_run'\" != \"x$as_lineno_2'$as_run'\" &&\n  test \"x`expr $as_lineno_1'$as_run' + 1`\" = \"x$as_lineno_2'$as_run'\"' || {\n  # Blame Lee E. McMahon (1931-1989) for sed's syntax.  :-)\n  sed -n '\n    p\n    /[$]LINENO/=\n  ' <$as_myself |\n    sed '\n      s/[$]LINENO.*/&-/\n      t lineno\n      b\n      :lineno\n      N\n      :loop\n      s/[$]LINENO\\([^'$as_cr_alnum'_].*\\n\\)\\(.*\\)/\\2\\1\\2/\n      t loop\n      s/-\\n.*//\n    ' >$as_me.lineno &&\n  chmod +x \"$as_me.lineno\" ||\n    { $as_echo \"$as_me: error: cannot create $as_me.lineno; rerun with a POSIX shell\" >&2; as_fn_exit 1; }\n\n  # If we had to re-execute with $CONFIG_SHELL, we're ensured to have\n  # already done that, so ensure we don't try to do so again and fall\n  # in an infinite loop.  This has already happened in practice.\n  _as_can_reexec=no; export _as_can_reexec\n  # Don't try to exec as it changes $[0], causing all sort of problems\n  # (the dirname of $[0] is not the place where we might find the\n  # original and so on.  Autoconf is especially sensitive to this).\n  . \"./$as_me.lineno\"\n  # Exit status is that of the last command.\n  exit\n}\n\nECHO_C= ECHO_N= ECHO_T=\ncase `echo -n x` in #(((((\n-n*)\n  case `echo 'xy\\c'` in\n  *c*) ECHO_T='\t';;\t# ECHO_T is single tab character.\n  xy)  ECHO_C='\\c';;\n  *)   echo `echo ksh88 bug on AIX 6.1` > /dev/null\n       ECHO_T='\t';;\n  esac;;\n*)\n  ECHO_N='-n';;\nesac\n\nrm -f conf$$ conf$$.exe conf$$.file\nif test -d conf$$.dir; then\n  rm -f conf$$.dir/conf$$.file\nelse\n  rm -f conf$$.dir\n  mkdir conf$$.dir 2>/dev/null\nfi\nif (echo >conf$$.file) 2>/dev/null; then\n  if ln -s conf$$.file conf$$ 2>/dev/null; then\n    as_ln_s='ln -s'\n    # ... but there are two gotchas:\n    # 1) On MSYS, both `ln -s file dir' and `ln file dir' fail.\n    # 2) DJGPP < 2.04 has no symlinks; `ln -s' creates a wrapper executable.\n    # In both cases, we have to default to `cp -pR'.\n    ln -s conf$$.file conf$$.dir 2>/dev/null && test ! -f conf$$.exe ||\n      as_ln_s='cp -pR'\n  elif ln conf$$.file conf$$ 2>/dev/null; then\n    as_ln_s=ln\n  else\n    as_ln_s='cp -pR'\n  fi\nelse\n  as_ln_s='cp -pR'\nfi\nrm -f conf$$ conf$$.exe conf$$.dir/conf$$.file conf$$.file\nrmdir conf$$.dir 2>/dev/null\n\nif mkdir -p . 2>/dev/null; then\n  as_mkdir_p='mkdir -p \"$as_dir\"'\nelse\n  test -d ./-p && rmdir ./-p\n  as_mkdir_p=false\nfi\n\nas_test_x='test -x'\nas_executable_p=as_fn_executable_p\n\n# Sed expression to map a string onto a valid CPP name.\nas_tr_cpp=\"eval sed 'y%*$as_cr_letters%P$as_cr_LETTERS%;s%[^_$as_cr_alnum]%_%g'\"\n\n# Sed expression to map a string onto a valid variable name.\nas_tr_sh=\"eval sed 'y%*+%pp%;s%[^_$as_cr_alnum]%_%g'\"\n\nSHELL=${CONFIG_SHELL-/bin/sh}\n\n\ntest -n \"$DJDIR\" || exec 7<&0 </dev/null\nexec 6>&1\n\n# Name of the host.\n# hostname on some systems (SVR3.2, old GNU/Linux) returns a bogus exit status,\n# so uname gets run too.\nac_hostname=`(hostname || uname -n) 2>/dev/null | sed 1q`\n\n#\n# Initializations.\n#\nac_default_prefix=/usr/local\nac_clean_files=\nac_config_libobj_dir=.\nLIBOBJS=\ncross_compiling=no\nsubdirs=\nMFLAGS=\nMAKEFLAGS=\n\n# Identity of this package.\nPACKAGE_NAME='OpenFst'\nPACKAGE_TARNAME='openfst'\nPACKAGE_VERSION='1.6.7'\nPACKAGE_STRING='OpenFst 1.6.7'\nPACKAGE_BUGREPORT='help@www.openfst.org'\nPACKAGE_URL=''\n\n# Factoring default headers for most tests.\nac_includes_default=\"\\\n#include <stdio.h>\n#ifdef HAVE_SYS_TYPES_H\n# include <sys/types.h>\n#endif\n#ifdef HAVE_SYS_STAT_H\n# include <sys/stat.h>\n#endif\n#ifdef STDC_HEADERS\n# include <stdlib.h>\n# include <stddef.h>\n#else\n# ifdef HAVE_STDLIB_H\n#  include <stdlib.h>\n# endif\n#endif\n#ifdef HAVE_STRING_H\n# if !defined STDC_HEADERS && defined HAVE_MEMORY_H\n#  include <memory.h>\n# endif\n# include <string.h>\n#endif\n#ifdef HAVE_STRINGS_H\n# include <strings.h>\n#endif\n#ifdef HAVE_INTTYPES_H\n# include <inttypes.h>\n#endif\n#ifdef HAVE_STDINT_H\n# include <stdint.h>\n#endif\n#ifdef HAVE_UNISTD_H\n# include <unistd.h>\n#endif\"\n\nac_unique_file=\"src/lib/fst.cc\"\nac_subst_vars='am__EXEEXT_FALSE\nam__EXEEXT_TRUE\nLTLIBOBJS\nLIBOBJS\nDL_LIBS\nlibfstdir\nHAVE_GRM_FALSE\nHAVE_GRM_TRUE\nHAVE_SCRIPT_FALSE\nHAVE_SCRIPT_TRUE\nHAVE_BIN_FALSE\nHAVE_BIN_TRUE\nHAVE_SPECIAL_FALSE\nHAVE_SPECIAL_TRUE\nPYTHON_EXTRA_LDFLAGS\nPYTHON_EXTRA_LIBS\nPYTHON_SITE_PKG\nPYTHON_LDFLAGS\nPYTHON_CPPFLAGS\npkgpyexecdir\npyexecdir\npkgpythondir\npythondir\nPYTHON_PLATFORM\nPYTHON_EXEC_PREFIX\nPYTHON_PREFIX\nPYTHON_VERSION\nPYTHON\nHAVE_PYTHON_FALSE\nHAVE_PYTHON_TRUE\nHAVE_PDT_FALSE\nHAVE_PDT_TRUE\nHAVE_NGRAM_FALSE\nHAVE_NGRAM_TRUE\nHAVE_MPDT_FALSE\nHAVE_MPDT_TRUE\nHAVE_LOOKAHEAD_FALSE\nHAVE_LOOKAHEAD_TRUE\nHAVE_LINEAR_FALSE\nHAVE_LINEAR_TRUE\nHAVE_FAR_FALSE\nHAVE_FAR_TRUE\nHAVE_CONST_FALSE\nHAVE_CONST_TRUE\nHAVE_COMPRESS_FALSE\nHAVE_COMPRESS_TRUE\nHAVE_COMPACT_FALSE\nHAVE_COMPACT_TRUE\nCXXCPP\nCPP\nOTOOL64\nOTOOL\nLIPO\nNMEDIT\nDSYMUTIL\nMANIFEST_TOOL\nRANLIB\nDLLTOOL\nOBJDUMP\nLN_S\nNM\nac_ct_DUMPBIN\nDUMPBIN\nLD\nFGREP\nEGREP\nGREP\nSED\nhost_os\nhost_vendor\nhost_cpu\nhost\nbuild_os\nbuild_vendor\nbuild_cpu\nbuild\nLIBTOOL\nam__fastdepCXX_FALSE\nam__fastdepCXX_TRUE\nCXXDEPMODE\nac_ct_CXX\nCXXFLAGS\nCXX\nam__fastdepCC_FALSE\nam__fastdepCC_TRUE\nCCDEPMODE\nam__nodep\nAMDEPBACKSLASH\nAMDEP_FALSE\nAMDEP_TRUE\nam__quote\nam__include\nDEPDIR\nOBJEXT\nEXEEXT\nac_ct_CC\nCPPFLAGS\nLDFLAGS\nCFLAGS\nCC\nac_ct_AR\nAR\nAM_BACKSLASH\nAM_DEFAULT_VERBOSITY\nAM_DEFAULT_V\nAM_V\nam__untar\nam__tar\nAMTAR\nam__leading_dot\nSET_MAKE\nAWK\nmkdir_p\nMKDIR_P\nINSTALL_STRIP_PROGRAM\nSTRIP\ninstall_sh\nMAKEINFO\nAUTOHEADER\nAUTOMAKE\nAUTOCONF\nACLOCAL\nVERSION\nPACKAGE\nCYGPATH_W\nam__isrc\nINSTALL_DATA\nINSTALL_SCRIPT\nINSTALL_PROGRAM\ntarget_alias\nhost_alias\nbuild_alias\nLIBS\nECHO_T\nECHO_N\nECHO_C\nDEFS\nmandir\nlocaledir\nlibdir\npsdir\npdfdir\ndvidir\nhtmldir\ninfodir\ndocdir\noldincludedir\nincludedir\nlocalstatedir\nsharedstatedir\nsysconfdir\ndatadir\ndatarootdir\nlibexecdir\nsbindir\nbindir\nprogram_transform_name\nprefix\nexec_prefix\nPACKAGE_URL\nPACKAGE_BUGREPORT\nPACKAGE_STRING\nPACKAGE_VERSION\nPACKAGE_TARNAME\nPACKAGE_NAME\nPATH_SEPARATOR\nSHELL'\nac_subst_files=''\nac_user_opts='\nenable_option_checking\nenable_silent_rules\nenable_dependency_tracking\nenable_static\nenable_shared\nwith_pic\nenable_fast_install\nwith_gnu_ld\nwith_sysroot\nenable_libtool_lock\nenable_compact_fsts\nenable_compress\nenable_const_fsts\nenable_far\nenable_linear_fsts\nenable_lookahead_fsts\nenable_mpdt\nenable_ngram_fsts\nenable_pdt\nenable_python\nenable_special\nenable_bin\nenable_grm\nwith_libfstdir\n'\n      ac_precious_vars='build_alias\nhost_alias\ntarget_alias\nCC\nCFLAGS\nLDFLAGS\nLIBS\nCPPFLAGS\nCXX\nCXXFLAGS\nCCC\nCPP\nCXXCPP\nPYTHON\nPYTHON_VERSION'\n\n\n# Initialize some variables set by options.\nac_init_help=\nac_init_version=false\nac_unrecognized_opts=\nac_unrecognized_sep=\n# The variables have the same names as the options, with\n# dashes changed to underlines.\ncache_file=/dev/null\nexec_prefix=NONE\nno_create=\nno_recursion=\nprefix=NONE\nprogram_prefix=NONE\nprogram_suffix=NONE\nprogram_transform_name=s,x,x,\nsilent=\nsite=\nsrcdir=\nverbose=\nx_includes=NONE\nx_libraries=NONE\n\n# Installation directory options.\n# These are left unexpanded so users can \"make install exec_prefix=/foo\"\n# and all the variables that are supposed to be based on exec_prefix\n# by default will actually change.\n# Use braces instead of parens because sh, perl, etc. also accept them.\n# (The list follows the same order as the GNU Coding Standards.)\nbindir='${exec_prefix}/bin'\nsbindir='${exec_prefix}/sbin'\nlibexecdir='${exec_prefix}/libexec'\ndatarootdir='${prefix}/share'\ndatadir='${datarootdir}'\nsysconfdir='${prefix}/etc'\nsharedstatedir='${prefix}/com'\nlocalstatedir='${prefix}/var'\nincludedir='${prefix}/include'\noldincludedir='/usr/include'\ndocdir='${datarootdir}/doc/${PACKAGE_TARNAME}'\ninfodir='${datarootdir}/info'\nhtmldir='${docdir}'\ndvidir='${docdir}'\npdfdir='${docdir}'\npsdir='${docdir}'\nlibdir='${exec_prefix}/lib'\nlocaledir='${datarootdir}/locale'\nmandir='${datarootdir}/man'\n\nac_prev=\nac_dashdash=\nfor ac_option\ndo\n  # If the previous option needs an argument, assign it.\n  if test -n \"$ac_prev\"; then\n    eval $ac_prev=\\$ac_option\n    ac_prev=\n    continue\n  fi\n\n  case $ac_option in\n  *=?*) ac_optarg=`expr \"X$ac_option\" : '[^=]*=\\(.*\\)'` ;;\n  *=)   ac_optarg= ;;\n  *)    ac_optarg=yes ;;\n  esac\n\n  # Accept the important Cygnus configure options, so we can diagnose typos.\n\n  case $ac_dashdash$ac_option in\n  --)\n    ac_dashdash=yes ;;\n\n  -bindir | --bindir | --bindi | --bind | --bin | --bi)\n    ac_prev=bindir ;;\n  -bindir=* | --bindir=* | --bindi=* | --bind=* | --bin=* | --bi=*)\n    bindir=$ac_optarg ;;\n\n  -build | --build | --buil | --bui | --bu)\n    ac_prev=build_alias ;;\n  -build=* | --build=* | --buil=* | --bui=* | --bu=*)\n    build_alias=$ac_optarg ;;\n\n  -cache-file | --cache-file | --cache-fil | --cache-fi \\\n  | --cache-f | --cache- | --cache | --cach | --cac | --ca | --c)\n    ac_prev=cache_file ;;\n  -cache-file=* | --cache-file=* | --cache-fil=* | --cache-fi=* \\\n  | --cache-f=* | --cache-=* | --cache=* | --cach=* | --cac=* | --ca=* | --c=*)\n    cache_file=$ac_optarg ;;\n\n  --config-cache | -C)\n    cache_file=config.cache ;;\n\n  -datadir | --datadir | --datadi | --datad)\n    ac_prev=datadir ;;\n  -datadir=* | --datadir=* | --datadi=* | --datad=*)\n    datadir=$ac_optarg ;;\n\n  -datarootdir | --datarootdir | --datarootdi | --datarootd | --dataroot \\\n  | --dataroo | --dataro | --datar)\n    ac_prev=datarootdir ;;\n  -datarootdir=* | --datarootdir=* | --datarootdi=* | --datarootd=* \\\n  | --dataroot=* | --dataroo=* | --dataro=* | --datar=*)\n    datarootdir=$ac_optarg ;;\n\n  -disable-* | --disable-*)\n    ac_useropt=`expr \"x$ac_option\" : 'x-*disable-\\(.*\\)'`\n    # Reject names that are not valid shell variable names.\n    expr \"x$ac_useropt\" : \".*[^-+._$as_cr_alnum]\" >/dev/null &&\n      as_fn_error $? \"invalid feature name: $ac_useropt\"\n    ac_useropt_orig=$ac_useropt\n    ac_useropt=`$as_echo \"$ac_useropt\" | sed 's/[-+.]/_/g'`\n    case $ac_user_opts in\n      *\"\n\"enable_$ac_useropt\"\n\"*) ;;\n      *) ac_unrecognized_opts=\"$ac_unrecognized_opts$ac_unrecognized_sep--disable-$ac_useropt_orig\"\n\t ac_unrecognized_sep=', ';;\n    esac\n    eval enable_$ac_useropt=no ;;\n\n  -docdir | --docdir | --docdi | --doc | --do)\n    ac_prev=docdir ;;\n  -docdir=* | --docdir=* | --docdi=* | --doc=* | --do=*)\n    docdir=$ac_optarg ;;\n\n  -dvidir | --dvidir | --dvidi | --dvid | --dvi | --dv)\n    ac_prev=dvidir ;;\n  -dvidir=* | --dvidir=* | --dvidi=* | --dvid=* | --dvi=* | --dv=*)\n    dvidir=$ac_optarg ;;\n\n  -enable-* | --enable-*)\n    ac_useropt=`expr \"x$ac_option\" : 'x-*enable-\\([^=]*\\)'`\n    # Reject names that are not valid shell variable names.\n    expr \"x$ac_useropt\" : \".*[^-+._$as_cr_alnum]\" >/dev/null &&\n      as_fn_error $? \"invalid feature name: $ac_useropt\"\n    ac_useropt_orig=$ac_useropt\n    ac_useropt=`$as_echo \"$ac_useropt\" | sed 's/[-+.]/_/g'`\n    case $ac_user_opts in\n      *\"\n\"enable_$ac_useropt\"\n\"*) ;;\n      *) ac_unrecognized_opts=\"$ac_unrecognized_opts$ac_unrecognized_sep--enable-$ac_useropt_orig\"\n\t ac_unrecognized_sep=', ';;\n    esac\n    eval enable_$ac_useropt=\\$ac_optarg ;;\n\n  -exec-prefix | --exec_prefix | --exec-prefix | --exec-prefi \\\n  | --exec-pref | --exec-pre | --exec-pr | --exec-p | --exec- \\\n  | --exec | --exe | --ex)\n    ac_prev=exec_prefix ;;\n  -exec-prefix=* | --exec_prefix=* | --exec-prefix=* | --exec-prefi=* \\\n  | --exec-pref=* | --exec-pre=* | --exec-pr=* | --exec-p=* | --exec-=* \\\n  | --exec=* | --exe=* | --ex=*)\n    exec_prefix=$ac_optarg ;;\n\n  -gas | --gas | --ga | --g)\n    # Obsolete; use --with-gas.\n    with_gas=yes ;;\n\n  -help | --help | --hel | --he | -h)\n    ac_init_help=long ;;\n  -help=r* | --help=r* | --hel=r* | --he=r* | -hr*)\n    ac_init_help=recursive ;;\n  -help=s* | --help=s* | --hel=s* | --he=s* | -hs*)\n    ac_init_help=short ;;\n\n  -host | --host | --hos | --ho)\n    ac_prev=host_alias ;;\n  -host=* | --host=* | --hos=* | --ho=*)\n    host_alias=$ac_optarg ;;\n\n  -htmldir | --htmldir | --htmldi | --htmld | --html | --htm | --ht)\n    ac_prev=htmldir ;;\n  -htmldir=* | --htmldir=* | --htmldi=* | --htmld=* | --html=* | --htm=* \\\n  | --ht=*)\n    htmldir=$ac_optarg ;;\n\n  -includedir | --includedir | --includedi | --included | --include \\\n  | --includ | --inclu | --incl | --inc)\n    ac_prev=includedir ;;\n  -includedir=* | --includedir=* | --includedi=* | --included=* | --include=* \\\n  | --includ=* | --inclu=* | --incl=* | --inc=*)\n    includedir=$ac_optarg ;;\n\n  -infodir | --infodir | --infodi | --infod | --info | --inf)\n    ac_prev=infodir ;;\n  -infodir=* | --infodir=* | --infodi=* | --infod=* | --info=* | --inf=*)\n    infodir=$ac_optarg ;;\n\n  -libdir | --libdir | --libdi | --libd)\n    ac_prev=libdir ;;\n  -libdir=* | --libdir=* | --libdi=* | --libd=*)\n    libdir=$ac_optarg ;;\n\n  -libexecdir | --libexecdir | --libexecdi | --libexecd | --libexec \\\n  | --libexe | --libex | --libe)\n    ac_prev=libexecdir ;;\n  -libexecdir=* | --libexecdir=* | --libexecdi=* | --libexecd=* | --libexec=* \\\n  | --libexe=* | --libex=* | --libe=*)\n    libexecdir=$ac_optarg ;;\n\n  -localedir | --localedir | --localedi | --localed | --locale)\n    ac_prev=localedir ;;\n  -localedir=* | --localedir=* | --localedi=* | --localed=* | --locale=*)\n    localedir=$ac_optarg ;;\n\n  -localstatedir | --localstatedir | --localstatedi | --localstated \\\n  | --localstate | --localstat | --localsta | --localst | --locals)\n    ac_prev=localstatedir ;;\n  -localstatedir=* | --localstatedir=* | --localstatedi=* | --localstated=* \\\n  | --localstate=* | --localstat=* | --localsta=* | --localst=* | --locals=*)\n    localstatedir=$ac_optarg ;;\n\n  -mandir | --mandir | --mandi | --mand | --man | --ma | --m)\n    ac_prev=mandir ;;\n  -mandir=* | --mandir=* | --mandi=* | --mand=* | --man=* | --ma=* | --m=*)\n    mandir=$ac_optarg ;;\n\n  -nfp | --nfp | --nf)\n    # Obsolete; use --without-fp.\n    with_fp=no ;;\n\n  -no-create | --no-create | --no-creat | --no-crea | --no-cre \\\n  | --no-cr | --no-c | -n)\n    no_create=yes ;;\n\n  -no-recursion | --no-recursion | --no-recursio | --no-recursi \\\n  | --no-recurs | --no-recur | --no-recu | --no-rec | --no-re | --no-r)\n    no_recursion=yes ;;\n\n  -oldincludedir | --oldincludedir | --oldincludedi | --oldincluded \\\n  | --oldinclude | --oldinclud | --oldinclu | --oldincl | --oldinc \\\n  | --oldin | --oldi | --old | --ol | --o)\n    ac_prev=oldincludedir ;;\n  -oldincludedir=* | --oldincludedir=* | --oldincludedi=* | --oldincluded=* \\\n  | --oldinclude=* | --oldinclud=* | --oldinclu=* | --oldincl=* | --oldinc=* \\\n  | --oldin=* | --oldi=* | --old=* | --ol=* | --o=*)\n    oldincludedir=$ac_optarg ;;\n\n  -prefix | --prefix | --prefi | --pref | --pre | --pr | --p)\n    ac_prev=prefix ;;\n  -prefix=* | --prefix=* | --prefi=* | --pref=* | --pre=* | --pr=* | --p=*)\n    prefix=$ac_optarg ;;\n\n  -program-prefix | --program-prefix | --program-prefi | --program-pref \\\n  | --program-pre | --program-pr | --program-p)\n    ac_prev=program_prefix ;;\n  -program-prefix=* | --program-prefix=* | --program-prefi=* \\\n  | --program-pref=* | --program-pre=* | --program-pr=* | --program-p=*)\n    program_prefix=$ac_optarg ;;\n\n  -program-suffix | --program-suffix | --program-suffi | --program-suff \\\n  | --program-suf | --program-su | --program-s)\n    ac_prev=program_suffix ;;\n  -program-suffix=* | --program-suffix=* | --program-suffi=* \\\n  | --program-suff=* | --program-suf=* | --program-su=* | --program-s=*)\n    program_suffix=$ac_optarg ;;\n\n  -program-transform-name | --program-transform-name \\\n  | --program-transform-nam | --program-transform-na \\\n  | --program-transform-n | --program-transform- \\\n  | --program-transform | --program-transfor \\\n  | --program-transfo | --program-transf \\\n  | --program-trans | --program-tran \\\n  | --progr-tra | --program-tr | --program-t)\n    ac_prev=program_transform_name ;;\n  -program-transform-name=* | --program-transform-name=* \\\n  | --program-transform-nam=* | --program-transform-na=* \\\n  | --program-transform-n=* | --program-transform-=* \\\n  | --program-transform=* | --program-transfor=* \\\n  | --program-transfo=* | --program-transf=* \\\n  | --program-trans=* | --program-tran=* \\\n  | --progr-tra=* | --program-tr=* | --program-t=*)\n    program_transform_name=$ac_optarg ;;\n\n  -pdfdir | --pdfdir | --pdfdi | --pdfd | --pdf | --pd)\n    ac_prev=pdfdir ;;\n  -pdfdir=* | --pdfdir=* | --pdfdi=* | --pdfd=* | --pdf=* | --pd=*)\n    pdfdir=$ac_optarg ;;\n\n  -psdir | --psdir | --psdi | --psd | --ps)\n    ac_prev=psdir ;;\n  -psdir=* | --psdir=* | --psdi=* | --psd=* | --ps=*)\n    psdir=$ac_optarg ;;\n\n  -q | -quiet | --quiet | --quie | --qui | --qu | --q \\\n  | -silent | --silent | --silen | --sile | --sil)\n    silent=yes ;;\n\n  -sbindir | --sbindir | --sbindi | --sbind | --sbin | --sbi | --sb)\n    ac_prev=sbindir ;;\n  -sbindir=* | --sbindir=* | --sbindi=* | --sbind=* | --sbin=* \\\n  | --sbi=* | --sb=*)\n    sbindir=$ac_optarg ;;\n\n  -sharedstatedir | --sharedstatedir | --sharedstatedi \\\n  | --sharedstated | --sharedstate | --sharedstat | --sharedsta \\\n  | --sharedst | --shareds | --shared | --share | --shar \\\n  | --sha | --sh)\n    ac_prev=sharedstatedir ;;\n  -sharedstatedir=* | --sharedstatedir=* | --sharedstatedi=* \\\n  | --sharedstated=* | --sharedstate=* | --sharedstat=* | --sharedsta=* \\\n  | --sharedst=* | --shareds=* | --shared=* | --share=* | --shar=* \\\n  | --sha=* | --sh=*)\n    sharedstatedir=$ac_optarg ;;\n\n  -site | --site | --sit)\n    ac_prev=site ;;\n  -site=* | --site=* | --sit=*)\n    site=$ac_optarg ;;\n\n  -srcdir | --srcdir | --srcdi | --srcd | --src | --sr)\n    ac_prev=srcdir ;;\n  -srcdir=* | --srcdir=* | --srcdi=* | --srcd=* | --src=* | --sr=*)\n    srcdir=$ac_optarg ;;\n\n  -sysconfdir | --sysconfdir | --sysconfdi | --sysconfd | --sysconf \\\n  | --syscon | --sysco | --sysc | --sys | --sy)\n    ac_prev=sysconfdir ;;\n  -sysconfdir=* | --sysconfdir=* | --sysconfdi=* | --sysconfd=* | --sysconf=* \\\n  | --syscon=* | --sysco=* | --sysc=* | --sys=* | --sy=*)\n    sysconfdir=$ac_optarg ;;\n\n  -target | --target | --targe | --targ | --tar | --ta | --t)\n    ac_prev=target_alias ;;\n  -target=* | --target=* | --targe=* | --targ=* | --tar=* | --ta=* | --t=*)\n    target_alias=$ac_optarg ;;\n\n  -v | -verbose | --verbose | --verbos | --verbo | --verb)\n    verbose=yes ;;\n\n  -version | --version | --versio | --versi | --vers | -V)\n    ac_init_version=: ;;\n\n  -with-* | --with-*)\n    ac_useropt=`expr \"x$ac_option\" : 'x-*with-\\([^=]*\\)'`\n    # Reject names that are not valid shell variable names.\n    expr \"x$ac_useropt\" : \".*[^-+._$as_cr_alnum]\" >/dev/null &&\n      as_fn_error $? \"invalid package name: $ac_useropt\"\n    ac_useropt_orig=$ac_useropt\n    ac_useropt=`$as_echo \"$ac_useropt\" | sed 's/[-+.]/_/g'`\n    case $ac_user_opts in\n      *\"\n\"with_$ac_useropt\"\n\"*) ;;\n      *) ac_unrecognized_opts=\"$ac_unrecognized_opts$ac_unrecognized_sep--with-$ac_useropt_orig\"\n\t ac_unrecognized_sep=', ';;\n    esac\n    eval with_$ac_useropt=\\$ac_optarg ;;\n\n  -without-* | --without-*)\n    ac_useropt=`expr \"x$ac_option\" : 'x-*without-\\(.*\\)'`\n    # Reject names that are not valid shell variable names.\n    expr \"x$ac_useropt\" : \".*[^-+._$as_cr_alnum]\" >/dev/null &&\n      as_fn_error $? \"invalid package name: $ac_useropt\"\n    ac_useropt_orig=$ac_useropt\n    ac_useropt=`$as_echo \"$ac_useropt\" | sed 's/[-+.]/_/g'`\n    case $ac_user_opts in\n      *\"\n\"with_$ac_useropt\"\n\"*) ;;\n      *) ac_unrecognized_opts=\"$ac_unrecognized_opts$ac_unrecognized_sep--without-$ac_useropt_orig\"\n\t ac_unrecognized_sep=', ';;\n    esac\n    eval with_$ac_useropt=no ;;\n\n  --x)\n    # Obsolete; use --with-x.\n    with_x=yes ;;\n\n  -x-includes | --x-includes | --x-include | --x-includ | --x-inclu \\\n  | --x-incl | --x-inc | --x-in | --x-i)\n    ac_prev=x_includes ;;\n  -x-includes=* | --x-includes=* | --x-include=* | --x-includ=* | --x-inclu=* \\\n  | --x-incl=* | --x-inc=* | --x-in=* | --x-i=*)\n    x_includes=$ac_optarg ;;\n\n  -x-libraries | --x-libraries | --x-librarie | --x-librari \\\n  | --x-librar | --x-libra | --x-libr | --x-lib | --x-li | --x-l)\n    ac_prev=x_libraries ;;\n  -x-libraries=* | --x-libraries=* | --x-librarie=* | --x-librari=* \\\n  | --x-librar=* | --x-libra=* | --x-libr=* | --x-lib=* | --x-li=* | --x-l=*)\n    x_libraries=$ac_optarg ;;\n\n  -*) as_fn_error $? \"unrecognized option: \\`$ac_option'\nTry \\`$0 --help' for more information\"\n    ;;\n\n  *=*)\n    ac_envvar=`expr \"x$ac_option\" : 'x\\([^=]*\\)='`\n    # Reject names that are not valid shell variable names.\n    case $ac_envvar in #(\n      '' | [0-9]* | *[!_$as_cr_alnum]* )\n      as_fn_error $? \"invalid variable name: \\`$ac_envvar'\" ;;\n    esac\n    eval $ac_envvar=\\$ac_optarg\n    export $ac_envvar ;;\n\n  *)\n    # FIXME: should be removed in autoconf 3.0.\n    $as_echo \"$as_me: WARNING: you should use --build, --host, --target\" >&2\n    expr \"x$ac_option\" : \".*[^-._$as_cr_alnum]\" >/dev/null &&\n      $as_echo \"$as_me: WARNING: invalid host type: $ac_option\" >&2\n    : \"${build_alias=$ac_option} ${host_alias=$ac_option} ${target_alias=$ac_option}\"\n    ;;\n\n  esac\ndone\n\nif test -n \"$ac_prev\"; then\n  ac_option=--`echo $ac_prev | sed 's/_/-/g'`\n  as_fn_error $? \"missing argument to $ac_option\"\nfi\n\nif test -n \"$ac_unrecognized_opts\"; then\n  case $enable_option_checking in\n    no) ;;\n    fatal) as_fn_error $? \"unrecognized options: $ac_unrecognized_opts\" ;;\n    *)     $as_echo \"$as_me: WARNING: unrecognized options: $ac_unrecognized_opts\" >&2 ;;\n  esac\nfi\n\n# Check all directory arguments for consistency.\nfor ac_var in\texec_prefix prefix bindir sbindir libexecdir datarootdir \\\n\t\tdatadir sysconfdir sharedstatedir localstatedir includedir \\\n\t\toldincludedir docdir infodir htmldir dvidir pdfdir psdir \\\n\t\tlibdir localedir mandir\ndo\n  eval ac_val=\\$$ac_var\n  # Remove trailing slashes.\n  case $ac_val in\n    */ )\n      ac_val=`expr \"X$ac_val\" : 'X\\(.*[^/]\\)' \\| \"X$ac_val\" : 'X\\(.*\\)'`\n      eval $ac_var=\\$ac_val;;\n  esac\n  # Be sure to have absolute directory names.\n  case $ac_val in\n    [\\\\/$]* | ?:[\\\\/]* )  continue;;\n    NONE | '' ) case $ac_var in *prefix ) continue;; esac;;\n  esac\n  as_fn_error $? \"expected an absolute directory name for --$ac_var: $ac_val\"\ndone\n\n# There might be people who depend on the old broken behavior: `$host'\n# used to hold the argument of --host etc.\n# FIXME: To remove some day.\nbuild=$build_alias\nhost=$host_alias\ntarget=$target_alias\n\n# FIXME: To remove some day.\nif test \"x$host_alias\" != x; then\n  if test \"x$build_alias\" = x; then\n    cross_compiling=maybe\n  elif test \"x$build_alias\" != \"x$host_alias\"; then\n    cross_compiling=yes\n  fi\nfi\n\nac_tool_prefix=\ntest -n \"$host_alias\" && ac_tool_prefix=$host_alias-\n\ntest \"$silent\" = yes && exec 6>/dev/null\n\n\nac_pwd=`pwd` && test -n \"$ac_pwd\" &&\nac_ls_di=`ls -di .` &&\nac_pwd_ls_di=`cd \"$ac_pwd\" && ls -di .` ||\n  as_fn_error $? \"working directory cannot be determined\"\ntest \"X$ac_ls_di\" = \"X$ac_pwd_ls_di\" ||\n  as_fn_error $? \"pwd does not report name of working directory\"\n\n\n# Find the source files, if location was not specified.\nif test -z \"$srcdir\"; then\n  ac_srcdir_defaulted=yes\n  # Try the directory containing this script, then the parent directory.\n  ac_confdir=`$as_dirname -- \"$as_myself\" ||\n$as_expr X\"$as_myself\" : 'X\\(.*[^/]\\)//*[^/][^/]*/*$' \\| \\\n\t X\"$as_myself\" : 'X\\(//\\)[^/]' \\| \\\n\t X\"$as_myself\" : 'X\\(//\\)$' \\| \\\n\t X\"$as_myself\" : 'X\\(/\\)' \\| . 2>/dev/null ||\n$as_echo X\"$as_myself\" |\n    sed '/^X\\(.*[^/]\\)\\/\\/*[^/][^/]*\\/*$/{\n\t    s//\\1/\n\t    q\n\t  }\n\t  /^X\\(\\/\\/\\)[^/].*/{\n\t    s//\\1/\n\t    q\n\t  }\n\t  /^X\\(\\/\\/\\)$/{\n\t    s//\\1/\n\t    q\n\t  }\n\t  /^X\\(\\/\\).*/{\n\t    s//\\1/\n\t    q\n\t  }\n\t  s/.*/./; q'`\n  srcdir=$ac_confdir\n  if test ! -r \"$srcdir/$ac_unique_file\"; then\n    srcdir=..\n  fi\nelse\n  ac_srcdir_defaulted=no\nfi\nif test ! -r \"$srcdir/$ac_unique_file\"; then\n  test \"$ac_srcdir_defaulted\" = yes && srcdir=\"$ac_confdir or ..\"\n  as_fn_error $? \"cannot find sources ($ac_unique_file) in $srcdir\"\nfi\nac_msg=\"sources are in $srcdir, but \\`cd $srcdir' does not work\"\nac_abs_confdir=`(\n\tcd \"$srcdir\" && test -r \"./$ac_unique_file\" || as_fn_error $? \"$ac_msg\"\n\tpwd)`\n# When building in place, set srcdir=.\nif test \"$ac_abs_confdir\" = \"$ac_pwd\"; then\n  srcdir=.\nfi\n# Remove unnecessary trailing slashes from srcdir.\n# Double slashes in file names in object file debugging info\n# mess up M-x gdb in Emacs.\ncase $srcdir in\n*/) srcdir=`expr \"X$srcdir\" : 'X\\(.*[^/]\\)' \\| \"X$srcdir\" : 'X\\(.*\\)'`;;\nesac\nfor ac_var in $ac_precious_vars; do\n  eval ac_env_${ac_var}_set=\\${${ac_var}+set}\n  eval ac_env_${ac_var}_value=\\$${ac_var}\n  eval ac_cv_env_${ac_var}_set=\\${${ac_var}+set}\n  eval ac_cv_env_${ac_var}_value=\\$${ac_var}\ndone\n\n#\n# Report the --help message.\n#\nif test \"$ac_init_help\" = \"long\"; then\n  # Omit some internal or obsolete options to make the list less imposing.\n  # This message is too long to be a string in the A/UX 3.1 sh.\n  cat <<_ACEOF\n\\`configure' configures OpenFst 1.6.7 to adapt to many kinds of systems.\n\nUsage: $0 [OPTION]... [VAR=VALUE]...\n\nTo assign environment variables (e.g., CC, CFLAGS...), specify them as\nVAR=VALUE.  See below for descriptions of some of the useful variables.\n\nDefaults for the options are specified in brackets.\n\nConfiguration:\n  -h, --help              display this help and exit\n      --help=short        display options specific to this package\n      --help=recursive    display the short help of all the included packages\n  -V, --version           display version information and exit\n  -q, --quiet, --silent   do not print \\`checking ...' messages\n      --cache-file=FILE   cache test results in FILE [disabled]\n  -C, --config-cache      alias for \\`--cache-file=config.cache'\n  -n, --no-create         do not create output files\n      --srcdir=DIR        find the sources in DIR [configure dir or \\`..']\n\nInstallation directories:\n  --prefix=PREFIX         install architecture-independent files in PREFIX\n                          [$ac_default_prefix]\n  --exec-prefix=EPREFIX   install architecture-dependent files in EPREFIX\n                          [PREFIX]\n\nBy default, \\`make install' will install all the files in\n\\`$ac_default_prefix/bin', \\`$ac_default_prefix/lib' etc.  You can specify\nan installation prefix other than \\`$ac_default_prefix' using \\`--prefix',\nfor instance \\`--prefix=\\$HOME'.\n\nFor better control, use the options below.\n\nFine tuning of the installation directories:\n  --bindir=DIR            user executables [EPREFIX/bin]\n  --sbindir=DIR           system admin executables [EPREFIX/sbin]\n  --libexecdir=DIR        program executables [EPREFIX/libexec]\n  --sysconfdir=DIR        read-only single-machine data [PREFIX/etc]\n  --sharedstatedir=DIR    modifiable architecture-independent data [PREFIX/com]\n  --localstatedir=DIR     modifiable single-machine data [PREFIX/var]\n  --libdir=DIR            object code libraries [EPREFIX/lib]\n  --includedir=DIR        C header files [PREFIX/include]\n  --oldincludedir=DIR     C header files for non-gcc [/usr/include]\n  --datarootdir=DIR       read-only arch.-independent data root [PREFIX/share]\n  --datadir=DIR           read-only architecture-independent data [DATAROOTDIR]\n  --infodir=DIR           info documentation [DATAROOTDIR/info]\n  --localedir=DIR         locale-dependent data [DATAROOTDIR/locale]\n  --mandir=DIR            man documentation [DATAROOTDIR/man]\n  --docdir=DIR            documentation root [DATAROOTDIR/doc/openfst]\n  --htmldir=DIR           html documentation [DOCDIR]\n  --dvidir=DIR            dvi documentation [DOCDIR]\n  --pdfdir=DIR            pdf documentation [DOCDIR]\n  --psdir=DIR             ps documentation [DOCDIR]\n_ACEOF\n\n  cat <<\\_ACEOF\n\nProgram names:\n  --program-prefix=PREFIX            prepend PREFIX to installed program names\n  --program-suffix=SUFFIX            append SUFFIX to installed program names\n  --program-transform-name=PROGRAM   run sed PROGRAM on installed program names\n\nSystem types:\n  --build=BUILD     configure for building on BUILD [guessed]\n  --host=HOST       cross-compile to build programs to run on HOST [BUILD]\n_ACEOF\nfi\n\nif test -n \"$ac_init_help\"; then\n  case $ac_init_help in\n     short | recursive ) echo \"Configuration of OpenFst 1.6.7:\";;\n   esac\n  cat <<\\_ACEOF\n\nOptional Features:\n  --disable-option-checking  ignore unrecognized --enable/--with options\n  --disable-FEATURE       do not include FEATURE (same as --enable-FEATURE=no)\n  --enable-FEATURE[=ARG]  include FEATURE [ARG=yes]\n  --enable-silent-rules   less verbose build output (undo: \"make V=1\")\n  --disable-silent-rules  verbose build output (undo: \"make V=0\")\n  --enable-dependency-tracking\n                          do not reject slow dependency extractors\n  --disable-dependency-tracking\n                          speeds up one-time build\n  --enable-static[=PKGS]  build static libraries [default=no]\n  --enable-shared[=PKGS]  build shared libraries [default=yes]\n  --enable-fast-install[=PKGS]\n                          optimize for fast installation [default=yes]\n  --disable-libtool-lock  avoid locking (might break parallel builds)\n  --enable-compact-fsts   enable CompactFst extensions\n  --enable-compress       enable compression extension\n  --enable-const-fsts     enable ConstFst extensions\n  --enable-far            enable FAR extensions\n  --enable-linear-fsts    enable LinearTagger/ClassifierFst extensions\n  --enable-lookahead-fsts enable LookAheadFst extensions\n  --enable-mpdt           enable MPDT extensions\n  --enable-ngram-fsts     enable NGramFst extension\n  --enable-pdt            enable PDT extensions\n  --enable-python         enable Python extensions\n  --enable-special        enable special-matcher extensions\n  --enable-bin            enable fst::script and command-line binaries\n  --enable-grm            enable all dependencies of OpenGrm\n\nOptional Packages:\n  --with-PACKAGE[=ARG]    use PACKAGE [ARG=yes]\n  --without-PACKAGE       do not use PACKAGE (same as --with-PACKAGE=no)\n  --with-pic[=PKGS]       try to use only PIC/non-PIC objects [default=use\n                          both]\n  --with-gnu-ld           assume the C compiler uses GNU ld [default=no]\n  --with-sysroot=DIR Search for dependent libraries within DIR\n                        (or the compiler's sysroot if not specified).\n--with-libfstdir=DIR fst dynamic extensions [LIBDIR/fst]\n\nSome influential environment variables:\n  CC          C compiler command\n  CFLAGS      C compiler flags\n  LDFLAGS     linker flags, e.g. -L<lib dir> if you have libraries in a\n              nonstandard directory <lib dir>\n  LIBS        libraries to pass to the linker, e.g. -l<library>\n  CPPFLAGS    (Objective) C/C++ preprocessor flags, e.g. -I<include dir> if\n              you have headers in a nonstandard directory <include dir>\n  CXX         C++ compiler command\n  CXXFLAGS    C++ compiler flags\n  CPP         C preprocessor\n  CXXCPP      C++ preprocessor\n  PYTHON      the Python interpreter\n  PYTHON_VERSION\n              The installed Python version to use, for example '2.3'. This\n              string will be appended to the Python interpreter canonical\n              name.\n\nUse these variables to override the choices made by `configure' or to help\nit to find libraries and programs with nonstandard names/locations.\n\nReport bugs to <help@www.openfst.org>.\n_ACEOF\nac_status=$?\nfi\n\nif test \"$ac_init_help\" = \"recursive\"; then\n  # If there are subdirs, report their specific --help.\n  for ac_dir in : $ac_subdirs_all; do test \"x$ac_dir\" = x: && continue\n    test -d \"$ac_dir\" ||\n      { cd \"$srcdir\" && ac_pwd=`pwd` && srcdir=. && test -d \"$ac_dir\"; } ||\n      continue\n    ac_builddir=.\n\ncase \"$ac_dir\" in\n.) ac_dir_suffix= ac_top_builddir_sub=. ac_top_build_prefix= ;;\n*)\n  ac_dir_suffix=/`$as_echo \"$ac_dir\" | sed 's|^\\.[\\\\/]||'`\n  # A \"..\" for each directory in $ac_dir_suffix.\n  ac_top_builddir_sub=`$as_echo \"$ac_dir_suffix\" | sed 's|/[^\\\\/]*|/..|g;s|/||'`\n  case $ac_top_builddir_sub in\n  \"\") ac_top_builddir_sub=. ac_top_build_prefix= ;;\n  *)  ac_top_build_prefix=$ac_top_builddir_sub/ ;;\n  esac ;;\nesac\nac_abs_top_builddir=$ac_pwd\nac_abs_builddir=$ac_pwd$ac_dir_suffix\n# for backward compatibility:\nac_top_builddir=$ac_top_build_prefix\n\ncase $srcdir in\n  .)  # We are building in place.\n    ac_srcdir=.\n    ac_top_srcdir=$ac_top_builddir_sub\n    ac_abs_top_srcdir=$ac_pwd ;;\n  [\\\\/]* | ?:[\\\\/]* )  # Absolute name.\n    ac_srcdir=$srcdir$ac_dir_suffix;\n    ac_top_srcdir=$srcdir\n    ac_abs_top_srcdir=$srcdir ;;\n  *) # Relative name.\n    ac_srcdir=$ac_top_build_prefix$srcdir$ac_dir_suffix\n    ac_top_srcdir=$ac_top_build_prefix$srcdir\n    ac_abs_top_srcdir=$ac_pwd/$srcdir ;;\nesac\nac_abs_srcdir=$ac_abs_top_srcdir$ac_dir_suffix\n\n    cd \"$ac_dir\" || { ac_status=$?; continue; }\n    # Check for guested configure.\n    if test -f \"$ac_srcdir/configure.gnu\"; then\n      echo &&\n      $SHELL \"$ac_srcdir/configure.gnu\" --help=recursive\n    elif test -f \"$ac_srcdir/configure\"; then\n      echo &&\n      $SHELL \"$ac_srcdir/configure\" --help=recursive\n    else\n      $as_echo \"$as_me: WARNING: no configuration information is in $ac_dir\" >&2\n    fi || ac_status=$?\n    cd \"$ac_pwd\" || { ac_status=$?; break; }\n  done\nfi\n\ntest -n \"$ac_init_help\" && exit $ac_status\nif $ac_init_version; then\n  cat <<\\_ACEOF\nOpenFst configure 1.6.7\ngenerated by GNU Autoconf 2.69\n\nCopyright (C) 2012 Free Software Foundation, Inc.\nThis configure script is free software; the Free Software Foundation\ngives unlimited permission to copy, distribute and modify it.\n_ACEOF\n  exit\nfi\n\n## ------------------------ ##\n## Autoconf initialization. ##\n## ------------------------ ##\n\n# ac_fn_c_try_compile LINENO\n# --------------------------\n# Try to compile conftest.$ac_ext, and return whether this succeeded.\nac_fn_c_try_compile ()\n{\n  as_lineno=${as_lineno-\"$1\"} as_lineno_stack=as_lineno_stack=$as_lineno_stack\n  rm -f conftest.$ac_objext\n  if { { ac_try=\"$ac_compile\"\ncase \"(($ac_try\" in\n  *\\\"* | *\\`* | *\\\\*) ac_try_echo=\\$ac_try;;\n  *) ac_try_echo=$ac_try;;\nesac\neval ac_try_echo=\"\\\"\\$as_me:${as_lineno-$LINENO}: $ac_try_echo\\\"\"\n$as_echo \"$ac_try_echo\"; } >&5\n  (eval \"$ac_compile\") 2>conftest.err\n  ac_status=$?\n  if test -s conftest.err; then\n    grep -v '^ *+' conftest.err >conftest.er1\n    cat conftest.er1 >&5\n    mv -f conftest.er1 conftest.err\n  fi\n  $as_echo \"$as_me:${as_lineno-$LINENO}: \\$? = $ac_status\" >&5\n  test $ac_status = 0; } && {\n\t test -z \"$ac_c_werror_flag\" ||\n\t test ! -s conftest.err\n       } && test -s conftest.$ac_objext; then :\n  ac_retval=0\nelse\n  $as_echo \"$as_me: failed program was:\" >&5\nsed 's/^/| /' conftest.$ac_ext >&5\n\n\tac_retval=1\nfi\n  eval $as_lineno_stack; ${as_lineno_stack:+:} unset as_lineno\n  as_fn_set_status $ac_retval\n\n} # ac_fn_c_try_compile\n\n# ac_fn_cxx_try_compile LINENO\n# ----------------------------\n# Try to compile conftest.$ac_ext, and return whether this succeeded.\nac_fn_cxx_try_compile ()\n{\n  as_lineno=${as_lineno-\"$1\"} as_lineno_stack=as_lineno_stack=$as_lineno_stack\n  rm -f conftest.$ac_objext\n  if { { ac_try=\"$ac_compile\"\ncase \"(($ac_try\" in\n  *\\\"* | *\\`* | *\\\\*) ac_try_echo=\\$ac_try;;\n  *) ac_try_echo=$ac_try;;\nesac\neval ac_try_echo=\"\\\"\\$as_me:${as_lineno-$LINENO}: $ac_try_echo\\\"\"\n$as_echo \"$ac_try_echo\"; } >&5\n  (eval \"$ac_compile\") 2>conftest.err\n  ac_status=$?\n  if test -s conftest.err; then\n    grep -v '^ *+' conftest.err >conftest.er1\n    cat conftest.er1 >&5\n    mv -f conftest.er1 conftest.err\n  fi\n  $as_echo \"$as_me:${as_lineno-$LINENO}: \\$? = $ac_status\" >&5\n  test $ac_status = 0; } && {\n\t test -z \"$ac_cxx_werror_flag\" ||\n\t test ! -s conftest.err\n       } && test -s conftest.$ac_objext; then :\n  ac_retval=0\nelse\n  $as_echo \"$as_me: failed program was:\" >&5\nsed 's/^/| /' conftest.$ac_ext >&5\n\n\tac_retval=1\nfi\n  eval $as_lineno_stack; ${as_lineno_stack:+:} unset as_lineno\n  as_fn_set_status $ac_retval\n\n} # ac_fn_cxx_try_compile\n\n# ac_fn_c_try_link LINENO\n# -----------------------\n# Try to link conftest.$ac_ext, and return whether this succeeded.\nac_fn_c_try_link ()\n{\n  as_lineno=${as_lineno-\"$1\"} as_lineno_stack=as_lineno_stack=$as_lineno_stack\n  rm -f conftest.$ac_objext conftest$ac_exeext\n  if { { ac_try=\"$ac_link\"\ncase \"(($ac_try\" in\n  *\\\"* | *\\`* | *\\\\*) ac_try_echo=\\$ac_try;;\n  *) ac_try_echo=$ac_try;;\nesac\neval ac_try_echo=\"\\\"\\$as_me:${as_lineno-$LINENO}: $ac_try_echo\\\"\"\n$as_echo \"$ac_try_echo\"; } >&5\n  (eval \"$ac_link\") 2>conftest.err\n  ac_status=$?\n  if test -s conftest.err; then\n    grep -v '^ *+' conftest.err >conftest.er1\n    cat conftest.er1 >&5\n    mv -f conftest.er1 conftest.err\n  fi\n  $as_echo \"$as_me:${as_lineno-$LINENO}: \\$? = $ac_status\" >&5\n  test $ac_status = 0; } && {\n\t test -z \"$ac_c_werror_flag\" ||\n\t test ! -s conftest.err\n       } && test -s conftest$ac_exeext && {\n\t test \"$cross_compiling\" = yes ||\n\t test -x conftest$ac_exeext\n       }; then :\n  ac_retval=0\nelse\n  $as_echo \"$as_me: failed program was:\" >&5\nsed 's/^/| /' conftest.$ac_ext >&5\n\n\tac_retval=1\nfi\n  # Delete the IPA/IPO (Inter Procedural Analysis/Optimization) information\n  # created by the PGI compiler (conftest_ipa8_conftest.oo), as it would\n  # interfere with the next link command; also delete a directory that is\n  # left behind by Apple's compiler.  We do this before executing the actions.\n  rm -rf conftest.dSYM conftest_ipa8_conftest.oo\n  eval $as_lineno_stack; ${as_lineno_stack:+:} unset as_lineno\n  as_fn_set_status $ac_retval\n\n} # ac_fn_c_try_link\n\n# ac_fn_c_check_header_compile LINENO HEADER VAR INCLUDES\n# -------------------------------------------------------\n# Tests whether HEADER exists and can be compiled using the include files in\n# INCLUDES, setting the cache variable VAR accordingly.\nac_fn_c_check_header_compile ()\n{\n  as_lineno=${as_lineno-\"$1\"} as_lineno_stack=as_lineno_stack=$as_lineno_stack\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: checking for $2\" >&5\n$as_echo_n \"checking for $2... \" >&6; }\nif eval \\${$3+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  cat confdefs.h - <<_ACEOF >conftest.$ac_ext\n/* end confdefs.h.  */\n$4\n#include <$2>\n_ACEOF\nif ac_fn_c_try_compile \"$LINENO\"; then :\n  eval \"$3=yes\"\nelse\n  eval \"$3=no\"\nfi\nrm -f core conftest.err conftest.$ac_objext conftest.$ac_ext\nfi\neval ac_res=\\$$3\n\t       { $as_echo \"$as_me:${as_lineno-$LINENO}: result: $ac_res\" >&5\n$as_echo \"$ac_res\" >&6; }\n  eval $as_lineno_stack; ${as_lineno_stack:+:} unset as_lineno\n\n} # ac_fn_c_check_header_compile\n\n# ac_fn_c_try_cpp LINENO\n# ----------------------\n# Try to preprocess conftest.$ac_ext, and return whether this succeeded.\nac_fn_c_try_cpp ()\n{\n  as_lineno=${as_lineno-\"$1\"} as_lineno_stack=as_lineno_stack=$as_lineno_stack\n  if { { ac_try=\"$ac_cpp conftest.$ac_ext\"\ncase \"(($ac_try\" in\n  *\\\"* | *\\`* | *\\\\*) ac_try_echo=\\$ac_try;;\n  *) ac_try_echo=$ac_try;;\nesac\neval ac_try_echo=\"\\\"\\$as_me:${as_lineno-$LINENO}: $ac_try_echo\\\"\"\n$as_echo \"$ac_try_echo\"; } >&5\n  (eval \"$ac_cpp conftest.$ac_ext\") 2>conftest.err\n  ac_status=$?\n  if test -s conftest.err; then\n    grep -v '^ *+' conftest.err >conftest.er1\n    cat conftest.er1 >&5\n    mv -f conftest.er1 conftest.err\n  fi\n  $as_echo \"$as_me:${as_lineno-$LINENO}: \\$? = $ac_status\" >&5\n  test $ac_status = 0; } > conftest.i && {\n\t test -z \"$ac_c_preproc_warn_flag$ac_c_werror_flag\" ||\n\t test ! -s conftest.err\n       }; then :\n  ac_retval=0\nelse\n  $as_echo \"$as_me: failed program was:\" >&5\nsed 's/^/| /' conftest.$ac_ext >&5\n\n    ac_retval=1\nfi\n  eval $as_lineno_stack; ${as_lineno_stack:+:} unset as_lineno\n  as_fn_set_status $ac_retval\n\n} # ac_fn_c_try_cpp\n\n# ac_fn_c_try_run LINENO\n# ----------------------\n# Try to link conftest.$ac_ext, and return whether this succeeded. Assumes\n# that executables *can* be run.\nac_fn_c_try_run ()\n{\n  as_lineno=${as_lineno-\"$1\"} as_lineno_stack=as_lineno_stack=$as_lineno_stack\n  if { { ac_try=\"$ac_link\"\ncase \"(($ac_try\" in\n  *\\\"* | *\\`* | *\\\\*) ac_try_echo=\\$ac_try;;\n  *) ac_try_echo=$ac_try;;\nesac\neval ac_try_echo=\"\\\"\\$as_me:${as_lineno-$LINENO}: $ac_try_echo\\\"\"\n$as_echo \"$ac_try_echo\"; } >&5\n  (eval \"$ac_link\") 2>&5\n  ac_status=$?\n  $as_echo \"$as_me:${as_lineno-$LINENO}: \\$? = $ac_status\" >&5\n  test $ac_status = 0; } && { ac_try='./conftest$ac_exeext'\n  { { case \"(($ac_try\" in\n  *\\\"* | *\\`* | *\\\\*) ac_try_echo=\\$ac_try;;\n  *) ac_try_echo=$ac_try;;\nesac\neval ac_try_echo=\"\\\"\\$as_me:${as_lineno-$LINENO}: $ac_try_echo\\\"\"\n$as_echo \"$ac_try_echo\"; } >&5\n  (eval \"$ac_try\") 2>&5\n  ac_status=$?\n  $as_echo \"$as_me:${as_lineno-$LINENO}: \\$? = $ac_status\" >&5\n  test $ac_status = 0; }; }; then :\n  ac_retval=0\nelse\n  $as_echo \"$as_me: program exited with status $ac_status\" >&5\n       $as_echo \"$as_me: failed program was:\" >&5\nsed 's/^/| /' conftest.$ac_ext >&5\n\n       ac_retval=$ac_status\nfi\n  rm -rf conftest.dSYM conftest_ipa8_conftest.oo\n  eval $as_lineno_stack; ${as_lineno_stack:+:} unset as_lineno\n  as_fn_set_status $ac_retval\n\n} # ac_fn_c_try_run\n\n# ac_fn_c_check_func LINENO FUNC VAR\n# ----------------------------------\n# Tests whether FUNC exists, setting the cache variable VAR accordingly\nac_fn_c_check_func ()\n{\n  as_lineno=${as_lineno-\"$1\"} as_lineno_stack=as_lineno_stack=$as_lineno_stack\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: checking for $2\" >&5\n$as_echo_n \"checking for $2... \" >&6; }\nif eval \\${$3+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  cat confdefs.h - <<_ACEOF >conftest.$ac_ext\n/* end confdefs.h.  */\n/* Define $2 to an innocuous variant, in case <limits.h> declares $2.\n   For example, HP-UX 11i <limits.h> declares gettimeofday.  */\n#define $2 innocuous_$2\n\n/* System header to define __stub macros and hopefully few prototypes,\n    which can conflict with char $2 (); below.\n    Prefer <limits.h> to <assert.h> if __STDC__ is defined, since\n    <limits.h> exists even on freestanding compilers.  */\n\n#ifdef __STDC__\n# include <limits.h>\n#else\n# include <assert.h>\n#endif\n\n#undef $2\n\n/* Override any GCC internal prototype to avoid an error.\n   Use char because int might match the return type of a GCC\n   builtin and then its argument prototype would still apply.  */\n#ifdef __cplusplus\nextern \"C\"\n#endif\nchar $2 ();\n/* The GNU C library defines this for functions which it implements\n    to always fail with ENOSYS.  Some functions are actually named\n    something starting with __ and the normal name is an alias.  */\n#if defined __stub_$2 || defined __stub___$2\nchoke me\n#endif\n\nint\nmain ()\n{\nreturn $2 ();\n  ;\n  return 0;\n}\n_ACEOF\nif ac_fn_c_try_link \"$LINENO\"; then :\n  eval \"$3=yes\"\nelse\n  eval \"$3=no\"\nfi\nrm -f core conftest.err conftest.$ac_objext \\\n    conftest$ac_exeext conftest.$ac_ext\nfi\neval ac_res=\\$$3\n\t       { $as_echo \"$as_me:${as_lineno-$LINENO}: result: $ac_res\" >&5\n$as_echo \"$ac_res\" >&6; }\n  eval $as_lineno_stack; ${as_lineno_stack:+:} unset as_lineno\n\n} # ac_fn_c_check_func\n\n# ac_fn_cxx_try_cpp LINENO\n# ------------------------\n# Try to preprocess conftest.$ac_ext, and return whether this succeeded.\nac_fn_cxx_try_cpp ()\n{\n  as_lineno=${as_lineno-\"$1\"} as_lineno_stack=as_lineno_stack=$as_lineno_stack\n  if { { ac_try=\"$ac_cpp conftest.$ac_ext\"\ncase \"(($ac_try\" in\n  *\\\"* | *\\`* | *\\\\*) ac_try_echo=\\$ac_try;;\n  *) ac_try_echo=$ac_try;;\nesac\neval ac_try_echo=\"\\\"\\$as_me:${as_lineno-$LINENO}: $ac_try_echo\\\"\"\n$as_echo \"$ac_try_echo\"; } >&5\n  (eval \"$ac_cpp conftest.$ac_ext\") 2>conftest.err\n  ac_status=$?\n  if test -s conftest.err; then\n    grep -v '^ *+' conftest.err >conftest.er1\n    cat conftest.er1 >&5\n    mv -f conftest.er1 conftest.err\n  fi\n  $as_echo \"$as_me:${as_lineno-$LINENO}: \\$? = $ac_status\" >&5\n  test $ac_status = 0; } > conftest.i && {\n\t test -z \"$ac_cxx_preproc_warn_flag$ac_cxx_werror_flag\" ||\n\t test ! -s conftest.err\n       }; then :\n  ac_retval=0\nelse\n  $as_echo \"$as_me: failed program was:\" >&5\nsed 's/^/| /' conftest.$ac_ext >&5\n\n    ac_retval=1\nfi\n  eval $as_lineno_stack; ${as_lineno_stack:+:} unset as_lineno\n  as_fn_set_status $ac_retval\n\n} # ac_fn_cxx_try_cpp\n\n# ac_fn_cxx_try_link LINENO\n# -------------------------\n# Try to link conftest.$ac_ext, and return whether this succeeded.\nac_fn_cxx_try_link ()\n{\n  as_lineno=${as_lineno-\"$1\"} as_lineno_stack=as_lineno_stack=$as_lineno_stack\n  rm -f conftest.$ac_objext conftest$ac_exeext\n  if { { ac_try=\"$ac_link\"\ncase \"(($ac_try\" in\n  *\\\"* | *\\`* | *\\\\*) ac_try_echo=\\$ac_try;;\n  *) ac_try_echo=$ac_try;;\nesac\neval ac_try_echo=\"\\\"\\$as_me:${as_lineno-$LINENO}: $ac_try_echo\\\"\"\n$as_echo \"$ac_try_echo\"; } >&5\n  (eval \"$ac_link\") 2>conftest.err\n  ac_status=$?\n  if test -s conftest.err; then\n    grep -v '^ *+' conftest.err >conftest.er1\n    cat conftest.er1 >&5\n    mv -f conftest.er1 conftest.err\n  fi\n  $as_echo \"$as_me:${as_lineno-$LINENO}: \\$? = $ac_status\" >&5\n  test $ac_status = 0; } && {\n\t test -z \"$ac_cxx_werror_flag\" ||\n\t test ! -s conftest.err\n       } && test -s conftest$ac_exeext && {\n\t test \"$cross_compiling\" = yes ||\n\t test -x conftest$ac_exeext\n       }; then :\n  ac_retval=0\nelse\n  $as_echo \"$as_me: failed program was:\" >&5\nsed 's/^/| /' conftest.$ac_ext >&5\n\n\tac_retval=1\nfi\n  # Delete the IPA/IPO (Inter Procedural Analysis/Optimization) information\n  # created by the PGI compiler (conftest_ipa8_conftest.oo), as it would\n  # interfere with the next link command; also delete a directory that is\n  # left behind by Apple's compiler.  We do this before executing the actions.\n  rm -rf conftest.dSYM conftest_ipa8_conftest.oo\n  eval $as_lineno_stack; ${as_lineno_stack:+:} unset as_lineno\n  as_fn_set_status $ac_retval\n\n} # ac_fn_cxx_try_link\ncat >config.log <<_ACEOF\nThis file contains any messages produced by compilers while\nrunning configure, to aid debugging if configure makes a mistake.\n\nIt was created by OpenFst $as_me 1.6.7, which was\ngenerated by GNU Autoconf 2.69.  Invocation command line was\n\n  $ $0 $@\n\n_ACEOF\nexec 5>>config.log\n{\ncat <<_ASUNAME\n## --------- ##\n## Platform. ##\n## --------- ##\n\nhostname = `(hostname || uname -n) 2>/dev/null | sed 1q`\nuname -m = `(uname -m) 2>/dev/null || echo unknown`\nuname -r = `(uname -r) 2>/dev/null || echo unknown`\nuname -s = `(uname -s) 2>/dev/null || echo unknown`\nuname -v = `(uname -v) 2>/dev/null || echo unknown`\n\n/usr/bin/uname -p = `(/usr/bin/uname -p) 2>/dev/null || echo unknown`\n/bin/uname -X     = `(/bin/uname -X) 2>/dev/null     || echo unknown`\n\n/bin/arch              = `(/bin/arch) 2>/dev/null              || echo unknown`\n/usr/bin/arch -k       = `(/usr/bin/arch -k) 2>/dev/null       || echo unknown`\n/usr/convex/getsysinfo = `(/usr/convex/getsysinfo) 2>/dev/null || echo unknown`\n/usr/bin/hostinfo      = `(/usr/bin/hostinfo) 2>/dev/null      || echo unknown`\n/bin/machine           = `(/bin/machine) 2>/dev/null           || echo unknown`\n/usr/bin/oslevel       = `(/usr/bin/oslevel) 2>/dev/null       || echo unknown`\n/bin/universe          = `(/bin/universe) 2>/dev/null          || echo unknown`\n\n_ASUNAME\n\nas_save_IFS=$IFS; IFS=$PATH_SEPARATOR\nfor as_dir in $PATH\ndo\n  IFS=$as_save_IFS\n  test -z \"$as_dir\" && as_dir=.\n    $as_echo \"PATH: $as_dir\"\n  done\nIFS=$as_save_IFS\n\n} >&5\n\ncat >&5 <<_ACEOF\n\n\n## ----------- ##\n## Core tests. ##\n## ----------- ##\n\n_ACEOF\n\n\n# Keep a trace of the command line.\n# Strip out --no-create and --no-recursion so they do not pile up.\n# Strip out --silent because we don't want to record it for future runs.\n# Also quote any args containing shell meta-characters.\n# Make two passes to allow for proper duplicate-argument suppression.\nac_configure_args=\nac_configure_args0=\nac_configure_args1=\nac_must_keep_next=false\nfor ac_pass in 1 2\ndo\n  for ac_arg\n  do\n    case $ac_arg in\n    -no-create | --no-c* | -n | -no-recursion | --no-r*) continue ;;\n    -q | -quiet | --quiet | --quie | --qui | --qu | --q \\\n    | -silent | --silent | --silen | --sile | --sil)\n      continue ;;\n    *\\'*)\n      ac_arg=`$as_echo \"$ac_arg\" | sed \"s/'/'\\\\\\\\\\\\\\\\''/g\"` ;;\n    esac\n    case $ac_pass in\n    1) as_fn_append ac_configure_args0 \" '$ac_arg'\" ;;\n    2)\n      as_fn_append ac_configure_args1 \" '$ac_arg'\"\n      if test $ac_must_keep_next = true; then\n\tac_must_keep_next=false # Got value, back to normal.\n      else\n\tcase $ac_arg in\n\t  *=* | --config-cache | -C | -disable-* | --disable-* \\\n\t  | -enable-* | --enable-* | -gas | --g* | -nfp | --nf* \\\n\t  | -q | -quiet | --q* | -silent | --sil* | -v | -verb* \\\n\t  | -with-* | --with-* | -without-* | --without-* | --x)\n\t    case \"$ac_configure_args0 \" in\n\t      \"$ac_configure_args1\"*\" '$ac_arg' \"* ) continue ;;\n\t    esac\n\t    ;;\n\t  -* ) ac_must_keep_next=true ;;\n\tesac\n      fi\n      as_fn_append ac_configure_args \" '$ac_arg'\"\n      ;;\n    esac\n  done\ndone\n{ ac_configure_args0=; unset ac_configure_args0;}\n{ ac_configure_args1=; unset ac_configure_args1;}\n\n# When interrupted or exit'd, cleanup temporary files, and complete\n# config.log.  We remove comments because anyway the quotes in there\n# would cause problems or look ugly.\n# WARNING: Use '\\'' to represent an apostrophe within the trap.\n# WARNING: Do not start the trap code with a newline, due to a FreeBSD 4.0 bug.\ntrap 'exit_status=$?\n  # Save into config.log some information that might help in debugging.\n  {\n    echo\n\n    $as_echo \"## ---------------- ##\n## Cache variables. ##\n## ---------------- ##\"\n    echo\n    # The following way of writing the cache mishandles newlines in values,\n(\n  for ac_var in `(set) 2>&1 | sed -n '\\''s/^\\([a-zA-Z_][a-zA-Z0-9_]*\\)=.*/\\1/p'\\''`; do\n    eval ac_val=\\$$ac_var\n    case $ac_val in #(\n    *${as_nl}*)\n      case $ac_var in #(\n      *_cv_*) { $as_echo \"$as_me:${as_lineno-$LINENO}: WARNING: cache variable $ac_var contains a newline\" >&5\n$as_echo \"$as_me: WARNING: cache variable $ac_var contains a newline\" >&2;} ;;\n      esac\n      case $ac_var in #(\n      _ | IFS | as_nl) ;; #(\n      BASH_ARGV | BASH_SOURCE) eval $ac_var= ;; #(\n      *) { eval $ac_var=; unset $ac_var;} ;;\n      esac ;;\n    esac\n  done\n  (set) 2>&1 |\n    case $as_nl`(ac_space='\\'' '\\''; set) 2>&1` in #(\n    *${as_nl}ac_space=\\ *)\n      sed -n \\\n\t\"s/'\\''/'\\''\\\\\\\\'\\'''\\''/g;\n\t  s/^\\\\([_$as_cr_alnum]*_cv_[_$as_cr_alnum]*\\\\)=\\\\(.*\\\\)/\\\\1='\\''\\\\2'\\''/p\"\n      ;; #(\n    *)\n      sed -n \"/^[_$as_cr_alnum]*_cv_[_$as_cr_alnum]*=/p\"\n      ;;\n    esac |\n    sort\n)\n    echo\n\n    $as_echo \"## ----------------- ##\n## Output variables. ##\n## ----------------- ##\"\n    echo\n    for ac_var in $ac_subst_vars\n    do\n      eval ac_val=\\$$ac_var\n      case $ac_val in\n      *\\'\\''*) ac_val=`$as_echo \"$ac_val\" | sed \"s/'\\''/'\\''\\\\\\\\\\\\\\\\'\\'''\\''/g\"`;;\n      esac\n      $as_echo \"$ac_var='\\''$ac_val'\\''\"\n    done | sort\n    echo\n\n    if test -n \"$ac_subst_files\"; then\n      $as_echo \"## ------------------- ##\n## File substitutions. ##\n## ------------------- ##\"\n      echo\n      for ac_var in $ac_subst_files\n      do\n\teval ac_val=\\$$ac_var\n\tcase $ac_val in\n\t*\\'\\''*) ac_val=`$as_echo \"$ac_val\" | sed \"s/'\\''/'\\''\\\\\\\\\\\\\\\\'\\'''\\''/g\"`;;\n\tesac\n\t$as_echo \"$ac_var='\\''$ac_val'\\''\"\n      done | sort\n      echo\n    fi\n\n    if test -s confdefs.h; then\n      $as_echo \"## ----------- ##\n## confdefs.h. ##\n## ----------- ##\"\n      echo\n      cat confdefs.h\n      echo\n    fi\n    test \"$ac_signal\" != 0 &&\n      $as_echo \"$as_me: caught signal $ac_signal\"\n    $as_echo \"$as_me: exit $exit_status\"\n  } >&5\n  rm -f core *.core core.conftest.* &&\n    rm -f -r conftest* confdefs* conf$$* $ac_clean_files &&\n    exit $exit_status\n' 0\nfor ac_signal in 1 2 13 15; do\n  trap 'ac_signal='$ac_signal'; as_fn_exit 1' $ac_signal\ndone\nac_signal=0\n\n# confdefs.h avoids OS command line length limits that DEFS can exceed.\nrm -f -r conftest* confdefs.h\n\n$as_echo \"/* confdefs.h */\" > confdefs.h\n\n# Predefined preprocessor variables.\n\ncat >>confdefs.h <<_ACEOF\n#define PACKAGE_NAME \"$PACKAGE_NAME\"\n_ACEOF\n\ncat >>confdefs.h <<_ACEOF\n#define PACKAGE_TARNAME \"$PACKAGE_TARNAME\"\n_ACEOF\n\ncat >>confdefs.h <<_ACEOF\n#define PACKAGE_VERSION \"$PACKAGE_VERSION\"\n_ACEOF\n\ncat >>confdefs.h <<_ACEOF\n#define PACKAGE_STRING \"$PACKAGE_STRING\"\n_ACEOF\n\ncat >>confdefs.h <<_ACEOF\n#define PACKAGE_BUGREPORT \"$PACKAGE_BUGREPORT\"\n_ACEOF\n\ncat >>confdefs.h <<_ACEOF\n#define PACKAGE_URL \"$PACKAGE_URL\"\n_ACEOF\n\n\n# Let the site file select an alternate cache file if it wants to.\n# Prefer an explicitly selected file to automatically selected ones.\nac_site_file1=NONE\nac_site_file2=NONE\nif test -n \"$CONFIG_SITE\"; then\n  # We do not want a PATH search for config.site.\n  case $CONFIG_SITE in #((\n    -*)  ac_site_file1=./$CONFIG_SITE;;\n    */*) ac_site_file1=$CONFIG_SITE;;\n    *)   ac_site_file1=./$CONFIG_SITE;;\n  esac\nelif test \"x$prefix\" != xNONE; then\n  ac_site_file1=$prefix/share/config.site\n  ac_site_file2=$prefix/etc/config.site\nelse\n  ac_site_file1=$ac_default_prefix/share/config.site\n  ac_site_file2=$ac_default_prefix/etc/config.site\nfi\nfor ac_site_file in \"$ac_site_file1\" \"$ac_site_file2\"\ndo\n  test \"x$ac_site_file\" = xNONE && continue\n  if test /dev/null != \"$ac_site_file\" && test -r \"$ac_site_file\"; then\n    { $as_echo \"$as_me:${as_lineno-$LINENO}: loading site script $ac_site_file\" >&5\n$as_echo \"$as_me: loading site script $ac_site_file\" >&6;}\n    sed 's/^/| /' \"$ac_site_file\" >&5\n    . \"$ac_site_file\" \\\n      || { { $as_echo \"$as_me:${as_lineno-$LINENO}: error: in \\`$ac_pwd':\" >&5\n$as_echo \"$as_me: error: in \\`$ac_pwd':\" >&2;}\nas_fn_error $? \"failed to load site script $ac_site_file\nSee \\`config.log' for more details\" \"$LINENO\" 5; }\n  fi\ndone\n\nif test -r \"$cache_file\"; then\n  # Some versions of bash will fail to source /dev/null (special files\n  # actually), so we avoid doing that.  DJGPP emulates it as a regular file.\n  if test /dev/null != \"$cache_file\" && test -f \"$cache_file\"; then\n    { $as_echo \"$as_me:${as_lineno-$LINENO}: loading cache $cache_file\" >&5\n$as_echo \"$as_me: loading cache $cache_file\" >&6;}\n    case $cache_file in\n      [\\\\/]* | ?:[\\\\/]* ) . \"$cache_file\";;\n      *)                      . \"./$cache_file\";;\n    esac\n  fi\nelse\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: creating cache $cache_file\" >&5\n$as_echo \"$as_me: creating cache $cache_file\" >&6;}\n  >$cache_file\nfi\n\n# Check that the precious variables saved in the cache have kept the same\n# value.\nac_cache_corrupted=false\nfor ac_var in $ac_precious_vars; do\n  eval ac_old_set=\\$ac_cv_env_${ac_var}_set\n  eval ac_new_set=\\$ac_env_${ac_var}_set\n  eval ac_old_val=\\$ac_cv_env_${ac_var}_value\n  eval ac_new_val=\\$ac_env_${ac_var}_value\n  case $ac_old_set,$ac_new_set in\n    set,)\n      { $as_echo \"$as_me:${as_lineno-$LINENO}: error: \\`$ac_var' was set to \\`$ac_old_val' in the previous run\" >&5\n$as_echo \"$as_me: error: \\`$ac_var' was set to \\`$ac_old_val' in the previous run\" >&2;}\n      ac_cache_corrupted=: ;;\n    ,set)\n      { $as_echo \"$as_me:${as_lineno-$LINENO}: error: \\`$ac_var' was not set in the previous run\" >&5\n$as_echo \"$as_me: error: \\`$ac_var' was not set in the previous run\" >&2;}\n      ac_cache_corrupted=: ;;\n    ,);;\n    *)\n      if test \"x$ac_old_val\" != \"x$ac_new_val\"; then\n\t# differences in whitespace do not lead to failure.\n\tac_old_val_w=`echo x $ac_old_val`\n\tac_new_val_w=`echo x $ac_new_val`\n\tif test \"$ac_old_val_w\" != \"$ac_new_val_w\"; then\n\t  { $as_echo \"$as_me:${as_lineno-$LINENO}: error: \\`$ac_var' has changed since the previous run:\" >&5\n$as_echo \"$as_me: error: \\`$ac_var' has changed since the previous run:\" >&2;}\n\t  ac_cache_corrupted=:\n\telse\n\t  { $as_echo \"$as_me:${as_lineno-$LINENO}: warning: ignoring whitespace changes in \\`$ac_var' since the previous run:\" >&5\n$as_echo \"$as_me: warning: ignoring whitespace changes in \\`$ac_var' since the previous run:\" >&2;}\n\t  eval $ac_var=\\$ac_old_val\n\tfi\n\t{ $as_echo \"$as_me:${as_lineno-$LINENO}:   former value:  \\`$ac_old_val'\" >&5\n$as_echo \"$as_me:   former value:  \\`$ac_old_val'\" >&2;}\n\t{ $as_echo \"$as_me:${as_lineno-$LINENO}:   current value: \\`$ac_new_val'\" >&5\n$as_echo \"$as_me:   current value: \\`$ac_new_val'\" >&2;}\n      fi;;\n  esac\n  # Pass precious variables to config.status.\n  if test \"$ac_new_set\" = set; then\n    case $ac_new_val in\n    *\\'*) ac_arg=$ac_var=`$as_echo \"$ac_new_val\" | sed \"s/'/'\\\\\\\\\\\\\\\\''/g\"` ;;\n    *) ac_arg=$ac_var=$ac_new_val ;;\n    esac\n    case \" $ac_configure_args \" in\n      *\" '$ac_arg' \"*) ;; # Avoid dups.  Use of quotes ensures accuracy.\n      *) as_fn_append ac_configure_args \" '$ac_arg'\" ;;\n    esac\n  fi\ndone\nif $ac_cache_corrupted; then\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: error: in \\`$ac_pwd':\" >&5\n$as_echo \"$as_me: error: in \\`$ac_pwd':\" >&2;}\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: error: changes in the environment can compromise the build\" >&5\n$as_echo \"$as_me: error: changes in the environment can compromise the build\" >&2;}\n  as_fn_error $? \"run \\`make distclean' and/or \\`rm $cache_file' and start over\" \"$LINENO\" 5\nfi\n## -------------------- ##\n## Main body of script. ##\n## -------------------- ##\n\nac_ext=c\nac_cpp='$CPP $CPPFLAGS'\nac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5'\nac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5'\nac_compiler_gnu=$ac_cv_c_compiler_gnu\n\n\nam__api_version='1.14'\n\nac_aux_dir=\nfor ac_dir in \"$srcdir\" \"$srcdir/..\" \"$srcdir/../..\"; do\n  if test -f \"$ac_dir/install-sh\"; then\n    ac_aux_dir=$ac_dir\n    ac_install_sh=\"$ac_aux_dir/install-sh -c\"\n    break\n  elif test -f \"$ac_dir/install.sh\"; then\n    ac_aux_dir=$ac_dir\n    ac_install_sh=\"$ac_aux_dir/install.sh -c\"\n    break\n  elif test -f \"$ac_dir/shtool\"; then\n    ac_aux_dir=$ac_dir\n    ac_install_sh=\"$ac_aux_dir/shtool install -c\"\n    break\n  fi\ndone\nif test -z \"$ac_aux_dir\"; then\n  as_fn_error $? \"cannot find install-sh, install.sh, or shtool in \\\"$srcdir\\\" \\\"$srcdir/..\\\" \\\"$srcdir/../..\\\"\" \"$LINENO\" 5\nfi\n\n# These three variables are undocumented and unsupported,\n# and are intended to be withdrawn in a future Autoconf release.\n# They can cause serious problems if a builder's source tree is in a directory\n# whose full name contains unusual characters.\nac_config_guess=\"$SHELL $ac_aux_dir/config.guess\"  # Please don't use this var.\nac_config_sub=\"$SHELL $ac_aux_dir/config.sub\"  # Please don't use this var.\nac_configure=\"$SHELL $ac_aux_dir/configure\"  # Please don't use this var.\n\n\n# Find a good install program.  We prefer a C program (faster),\n# so one script is as good as another.  But avoid the broken or\n# incompatible versions:\n# SysV /etc/install, /usr/sbin/install\n# SunOS /usr/etc/install\n# IRIX /sbin/install\n# AIX /bin/install\n# AmigaOS /C/install, which installs bootblocks on floppy discs\n# AIX 4 /usr/bin/installbsd, which doesn't work without a -g flag\n# AFS /usr/afsws/bin/install, which mishandles nonexistent args\n# SVR4 /usr/ucb/install, which tries to use the nonexistent group \"staff\"\n# OS/2's system install, which has a completely different semantic\n# ./install, which can be erroneously created by make from ./install.sh.\n# Reject install programs that cannot install multiple files.\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for a BSD-compatible install\" >&5\n$as_echo_n \"checking for a BSD-compatible install... \" >&6; }\nif test -z \"$INSTALL\"; then\nif ${ac_cv_path_install+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  as_save_IFS=$IFS; IFS=$PATH_SEPARATOR\nfor as_dir in $PATH\ndo\n  IFS=$as_save_IFS\n  test -z \"$as_dir\" && as_dir=.\n    # Account for people who put trailing slashes in PATH elements.\ncase $as_dir/ in #((\n  ./ | .// | /[cC]/* | \\\n  /etc/* | /usr/sbin/* | /usr/etc/* | /sbin/* | /usr/afsws/bin/* | \\\n  ?:[\\\\/]os2[\\\\/]install[\\\\/]* | ?:[\\\\/]OS2[\\\\/]INSTALL[\\\\/]* | \\\n  /usr/ucb/* ) ;;\n  *)\n    # OSF1 and SCO ODT 3.0 have their own names for install.\n    # Don't use installbsd from OSF since it installs stuff as root\n    # by default.\n    for ac_prog in ginstall scoinst install; do\n      for ac_exec_ext in '' $ac_executable_extensions; do\n\tif as_fn_executable_p \"$as_dir/$ac_prog$ac_exec_ext\"; then\n\t  if test $ac_prog = install &&\n\t    grep dspmsg \"$as_dir/$ac_prog$ac_exec_ext\" >/dev/null 2>&1; then\n\t    # AIX install.  It has an incompatible calling convention.\n\t    :\n\t  elif test $ac_prog = install &&\n\t    grep pwplus \"$as_dir/$ac_prog$ac_exec_ext\" >/dev/null 2>&1; then\n\t    # program-specific install script used by HP pwplus--don't use.\n\t    :\n\t  else\n\t    rm -rf conftest.one conftest.two conftest.dir\n\t    echo one > conftest.one\n\t    echo two > conftest.two\n\t    mkdir conftest.dir\n\t    if \"$as_dir/$ac_prog$ac_exec_ext\" -c conftest.one conftest.two \"`pwd`/conftest.dir\" &&\n\t      test -s conftest.one && test -s conftest.two &&\n\t      test -s conftest.dir/conftest.one &&\n\t      test -s conftest.dir/conftest.two\n\t    then\n\t      ac_cv_path_install=\"$as_dir/$ac_prog$ac_exec_ext -c\"\n\t      break 3\n\t    fi\n\t  fi\n\tfi\n      done\n    done\n    ;;\nesac\n\n  done\nIFS=$as_save_IFS\n\nrm -rf conftest.one conftest.two conftest.dir\n\nfi\n  if test \"${ac_cv_path_install+set}\" = set; then\n    INSTALL=$ac_cv_path_install\n  else\n    # As a last resort, use the slow shell script.  Don't cache a\n    # value for INSTALL within a source directory, because that will\n    # break other packages using the cache if that directory is\n    # removed, or if the value is a relative name.\n    INSTALL=$ac_install_sh\n  fi\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $INSTALL\" >&5\n$as_echo \"$INSTALL\" >&6; }\n\n# Use test -z because SunOS4 sh mishandles braces in ${var-val}.\n# It thinks the first close brace ends the variable substitution.\ntest -z \"$INSTALL_PROGRAM\" && INSTALL_PROGRAM='${INSTALL}'\n\ntest -z \"$INSTALL_SCRIPT\" && INSTALL_SCRIPT='${INSTALL}'\n\ntest -z \"$INSTALL_DATA\" && INSTALL_DATA='${INSTALL} -m 644'\n\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking whether build environment is sane\" >&5\n$as_echo_n \"checking whether build environment is sane... \" >&6; }\n# Reject unsafe characters in $srcdir or the absolute working directory\n# name.  Accept space and tab only in the latter.\nam_lf='\n'\ncase `pwd` in\n  *[\\\\\\\"\\#\\$\\&\\'\\`$am_lf]*)\n    as_fn_error $? \"unsafe absolute working directory name\" \"$LINENO\" 5;;\nesac\ncase $srcdir in\n  *[\\\\\\\"\\#\\$\\&\\'\\`$am_lf\\ \\\t]*)\n    as_fn_error $? \"unsafe srcdir value: '$srcdir'\" \"$LINENO\" 5;;\nesac\n\n# Do 'set' in a subshell so we don't clobber the current shell's\n# arguments.  Must try -L first in case configure is actually a\n# symlink; some systems play weird games with the mod time of symlinks\n# (eg FreeBSD returns the mod time of the symlink's containing\n# directory).\nif (\n   am_has_slept=no\n   for am_try in 1 2; do\n     echo \"timestamp, slept: $am_has_slept\" > conftest.file\n     set X `ls -Lt \"$srcdir/configure\" conftest.file 2> /dev/null`\n     if test \"$*\" = \"X\"; then\n\t# -L didn't work.\n\tset X `ls -t \"$srcdir/configure\" conftest.file`\n     fi\n     if test \"$*\" != \"X $srcdir/configure conftest.file\" \\\n\t&& test \"$*\" != \"X conftest.file $srcdir/configure\"; then\n\n\t# If neither matched, then we have a broken ls.  This can happen\n\t# if, for instance, CONFIG_SHELL is bash and it inherits a\n\t# broken ls alias from the environment.  This has actually\n\t# happened.  Such a system could not be considered \"sane\".\n\tas_fn_error $? \"ls -t appears to fail.  Make sure there is not a broken\n  alias in your environment\" \"$LINENO\" 5\n     fi\n     if test \"$2\" = conftest.file || test $am_try -eq 2; then\n       break\n     fi\n     # Just in case.\n     sleep 1\n     am_has_slept=yes\n   done\n   test \"$2\" = conftest.file\n   )\nthen\n   # Ok.\n   :\nelse\n   as_fn_error $? \"newly created file is older than distributed files!\nCheck your system clock\" \"$LINENO\" 5\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: yes\" >&5\n$as_echo \"yes\" >&6; }\n# If we didn't sleep, we still need to ensure time stamps of config.status and\n# generated files are strictly newer.\nam_sleep_pid=\nif grep 'slept: no' conftest.file >/dev/null 2>&1; then\n  ( sleep 1 ) &\n  am_sleep_pid=$!\nfi\n\nrm -f conftest.file\n\ntest \"$program_prefix\" != NONE &&\n  program_transform_name=\"s&^&$program_prefix&;$program_transform_name\"\n# Use a double $ so make ignores it.\ntest \"$program_suffix\" != NONE &&\n  program_transform_name=\"s&\\$&$program_suffix&;$program_transform_name\"\n# Double any \\ or $.\n# By default was `s,x,x', remove it if useless.\nac_script='s/[\\\\$]/&&/g;s/;s,x,x,$//'\nprogram_transform_name=`$as_echo \"$program_transform_name\" | sed \"$ac_script\"`\n\n# expand $ac_aux_dir to an absolute path\nam_aux_dir=`cd $ac_aux_dir && pwd`\n\nif test x\"${MISSING+set}\" != xset; then\n  case $am_aux_dir in\n  *\\ * | *\\\t*)\n    MISSING=\"\\${SHELL} \\\"$am_aux_dir/missing\\\"\" ;;\n  *)\n    MISSING=\"\\${SHELL} $am_aux_dir/missing\" ;;\n  esac\nfi\n# Use eval to expand $SHELL\nif eval \"$MISSING --is-lightweight\"; then\n  am_missing_run=\"$MISSING \"\nelse\n  am_missing_run=\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: WARNING: 'missing' script is too old or missing\" >&5\n$as_echo \"$as_me: WARNING: 'missing' script is too old or missing\" >&2;}\nfi\n\nif test x\"${install_sh}\" != xset; then\n  case $am_aux_dir in\n  *\\ * | *\\\t*)\n    install_sh=\"\\${SHELL} '$am_aux_dir/install-sh'\" ;;\n  *)\n    install_sh=\"\\${SHELL} $am_aux_dir/install-sh\"\n  esac\nfi\n\n# Installed binaries are usually stripped using 'strip' when the user\n# run \"make install-strip\".  However 'strip' might not be the right\n# tool to use in cross-compilation environments, therefore Automake\n# will honor the 'STRIP' environment variable to overrule this program.\nif test \"$cross_compiling\" != no; then\n  if test -n \"$ac_tool_prefix\"; then\n  # Extract the first word of \"${ac_tool_prefix}strip\", so it can be a program name with args.\nset dummy ${ac_tool_prefix}strip; ac_word=$2\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for $ac_word\" >&5\n$as_echo_n \"checking for $ac_word... \" >&6; }\nif ${ac_cv_prog_STRIP+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  if test -n \"$STRIP\"; then\n  ac_cv_prog_STRIP=\"$STRIP\" # Let the user override the test.\nelse\nas_save_IFS=$IFS; IFS=$PATH_SEPARATOR\nfor as_dir in $PATH\ndo\n  IFS=$as_save_IFS\n  test -z \"$as_dir\" && as_dir=.\n    for ac_exec_ext in '' $ac_executable_extensions; do\n  if as_fn_executable_p \"$as_dir/$ac_word$ac_exec_ext\"; then\n    ac_cv_prog_STRIP=\"${ac_tool_prefix}strip\"\n    $as_echo \"$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext\" >&5\n    break 2\n  fi\ndone\n  done\nIFS=$as_save_IFS\n\nfi\nfi\nSTRIP=$ac_cv_prog_STRIP\nif test -n \"$STRIP\"; then\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: $STRIP\" >&5\n$as_echo \"$STRIP\" >&6; }\nelse\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: no\" >&5\n$as_echo \"no\" >&6; }\nfi\n\n\nfi\nif test -z \"$ac_cv_prog_STRIP\"; then\n  ac_ct_STRIP=$STRIP\n  # Extract the first word of \"strip\", so it can be a program name with args.\nset dummy strip; ac_word=$2\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for $ac_word\" >&5\n$as_echo_n \"checking for $ac_word... \" >&6; }\nif ${ac_cv_prog_ac_ct_STRIP+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  if test -n \"$ac_ct_STRIP\"; then\n  ac_cv_prog_ac_ct_STRIP=\"$ac_ct_STRIP\" # Let the user override the test.\nelse\nas_save_IFS=$IFS; IFS=$PATH_SEPARATOR\nfor as_dir in $PATH\ndo\n  IFS=$as_save_IFS\n  test -z \"$as_dir\" && as_dir=.\n    for ac_exec_ext in '' $ac_executable_extensions; do\n  if as_fn_executable_p \"$as_dir/$ac_word$ac_exec_ext\"; then\n    ac_cv_prog_ac_ct_STRIP=\"strip\"\n    $as_echo \"$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext\" >&5\n    break 2\n  fi\ndone\n  done\nIFS=$as_save_IFS\n\nfi\nfi\nac_ct_STRIP=$ac_cv_prog_ac_ct_STRIP\nif test -n \"$ac_ct_STRIP\"; then\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: $ac_ct_STRIP\" >&5\n$as_echo \"$ac_ct_STRIP\" >&6; }\nelse\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: no\" >&5\n$as_echo \"no\" >&6; }\nfi\n\n  if test \"x$ac_ct_STRIP\" = x; then\n    STRIP=\":\"\n  else\n    case $cross_compiling:$ac_tool_warned in\nyes:)\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet\" >&5\n$as_echo \"$as_me: WARNING: using cross tools not prefixed with host triplet\" >&2;}\nac_tool_warned=yes ;;\nesac\n    STRIP=$ac_ct_STRIP\n  fi\nelse\n  STRIP=\"$ac_cv_prog_STRIP\"\nfi\n\nfi\nINSTALL_STRIP_PROGRAM=\"\\$(install_sh) -c -s\"\n\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for a thread-safe mkdir -p\" >&5\n$as_echo_n \"checking for a thread-safe mkdir -p... \" >&6; }\nif test -z \"$MKDIR_P\"; then\n  if ${ac_cv_path_mkdir+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  as_save_IFS=$IFS; IFS=$PATH_SEPARATOR\nfor as_dir in $PATH$PATH_SEPARATOR/opt/sfw/bin\ndo\n  IFS=$as_save_IFS\n  test -z \"$as_dir\" && as_dir=.\n    for ac_prog in mkdir gmkdir; do\n\t for ac_exec_ext in '' $ac_executable_extensions; do\n\t   as_fn_executable_p \"$as_dir/$ac_prog$ac_exec_ext\" || continue\n\t   case `\"$as_dir/$ac_prog$ac_exec_ext\" --version 2>&1` in #(\n\t     'mkdir (GNU coreutils) '* | \\\n\t     'mkdir (coreutils) '* | \\\n\t     'mkdir (fileutils) '4.1*)\n\t       ac_cv_path_mkdir=$as_dir/$ac_prog$ac_exec_ext\n\t       break 3;;\n\t   esac\n\t done\n       done\n  done\nIFS=$as_save_IFS\n\nfi\n\n  test -d ./--version && rmdir ./--version\n  if test \"${ac_cv_path_mkdir+set}\" = set; then\n    MKDIR_P=\"$ac_cv_path_mkdir -p\"\n  else\n    # As a last resort, use the slow shell script.  Don't cache a\n    # value for MKDIR_P within a source directory, because that will\n    # break other packages using the cache if that directory is\n    # removed, or if the value is a relative name.\n    MKDIR_P=\"$ac_install_sh -d\"\n  fi\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $MKDIR_P\" >&5\n$as_echo \"$MKDIR_P\" >&6; }\n\nfor ac_prog in gawk mawk nawk awk\ndo\n  # Extract the first word of \"$ac_prog\", so it can be a program name with args.\nset dummy $ac_prog; ac_word=$2\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for $ac_word\" >&5\n$as_echo_n \"checking for $ac_word... \" >&6; }\nif ${ac_cv_prog_AWK+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  if test -n \"$AWK\"; then\n  ac_cv_prog_AWK=\"$AWK\" # Let the user override the test.\nelse\nas_save_IFS=$IFS; IFS=$PATH_SEPARATOR\nfor as_dir in $PATH\ndo\n  IFS=$as_save_IFS\n  test -z \"$as_dir\" && as_dir=.\n    for ac_exec_ext in '' $ac_executable_extensions; do\n  if as_fn_executable_p \"$as_dir/$ac_word$ac_exec_ext\"; then\n    ac_cv_prog_AWK=\"$ac_prog\"\n    $as_echo \"$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext\" >&5\n    break 2\n  fi\ndone\n  done\nIFS=$as_save_IFS\n\nfi\nfi\nAWK=$ac_cv_prog_AWK\nif test -n \"$AWK\"; then\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: $AWK\" >&5\n$as_echo \"$AWK\" >&6; }\nelse\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: no\" >&5\n$as_echo \"no\" >&6; }\nfi\n\n\n  test -n \"$AWK\" && break\ndone\n\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking whether ${MAKE-make} sets \\$(MAKE)\" >&5\n$as_echo_n \"checking whether ${MAKE-make} sets \\$(MAKE)... \" >&6; }\nset x ${MAKE-make}\nac_make=`$as_echo \"$2\" | sed 's/+/p/g; s/[^a-zA-Z0-9_]/_/g'`\nif eval \\${ac_cv_prog_make_${ac_make}_set+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  cat >conftest.make <<\\_ACEOF\nSHELL = /bin/sh\nall:\n\t@echo '@@@%%%=$(MAKE)=@@@%%%'\n_ACEOF\n# GNU make sometimes prints \"make[1]: Entering ...\", which would confuse us.\ncase `${MAKE-make} -f conftest.make 2>/dev/null` in\n  *@@@%%%=?*=@@@%%%*)\n    eval ac_cv_prog_make_${ac_make}_set=yes;;\n  *)\n    eval ac_cv_prog_make_${ac_make}_set=no;;\nesac\nrm -f conftest.make\nfi\nif eval test \\$ac_cv_prog_make_${ac_make}_set = yes; then\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: yes\" >&5\n$as_echo \"yes\" >&6; }\n  SET_MAKE=\nelse\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: no\" >&5\n$as_echo \"no\" >&6; }\n  SET_MAKE=\"MAKE=${MAKE-make}\"\nfi\n\nrm -rf .tst 2>/dev/null\nmkdir .tst 2>/dev/null\nif test -d .tst; then\n  am__leading_dot=.\nelse\n  am__leading_dot=_\nfi\nrmdir .tst 2>/dev/null\n\n# Check whether --enable-silent-rules was given.\nif test \"${enable_silent_rules+set}\" = set; then :\n  enableval=$enable_silent_rules;\nfi\n\ncase $enable_silent_rules in # (((\n  yes) AM_DEFAULT_VERBOSITY=0;;\n   no) AM_DEFAULT_VERBOSITY=1;;\n    *) AM_DEFAULT_VERBOSITY=1;;\nesac\nam_make=${MAKE-make}\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking whether $am_make supports nested variables\" >&5\n$as_echo_n \"checking whether $am_make supports nested variables... \" >&6; }\nif ${am_cv_make_support_nested_variables+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  if $as_echo 'TRUE=$(BAR$(V))\nBAR0=false\nBAR1=true\nV=1\nam__doit:\n\t@$(TRUE)\n.PHONY: am__doit' | $am_make -f - >/dev/null 2>&1; then\n  am_cv_make_support_nested_variables=yes\nelse\n  am_cv_make_support_nested_variables=no\nfi\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $am_cv_make_support_nested_variables\" >&5\n$as_echo \"$am_cv_make_support_nested_variables\" >&6; }\nif test $am_cv_make_support_nested_variables = yes; then\n    AM_V='$(V)'\n  AM_DEFAULT_V='$(AM_DEFAULT_VERBOSITY)'\nelse\n  AM_V=$AM_DEFAULT_VERBOSITY\n  AM_DEFAULT_V=$AM_DEFAULT_VERBOSITY\nfi\nAM_BACKSLASH='\\'\n\nif test \"`cd $srcdir && pwd`\" != \"`pwd`\"; then\n  # Use -I$(srcdir) only when $(srcdir) != ., so that make's output\n  # is not polluted with repeated \"-I.\"\n  am__isrc=' -I$(srcdir)'\n  # test to see if srcdir already configured\n  if test -f $srcdir/config.status; then\n    as_fn_error $? \"source directory already configured; run \\\"make distclean\\\" there first\" \"$LINENO\" 5\n  fi\nfi\n\n# test whether we have cygpath\nif test -z \"$CYGPATH_W\"; then\n  if (cygpath --version) >/dev/null 2>/dev/null; then\n    CYGPATH_W='cygpath -w'\n  else\n    CYGPATH_W=echo\n  fi\nfi\n\n\n# Define the identity of the package.\n PACKAGE='openfst'\n VERSION='1.6.7'\n\n\ncat >>confdefs.h <<_ACEOF\n#define PACKAGE \"$PACKAGE\"\n_ACEOF\n\n\ncat >>confdefs.h <<_ACEOF\n#define VERSION \"$VERSION\"\n_ACEOF\n\n# Some tools Automake needs.\n\nACLOCAL=${ACLOCAL-\"${am_missing_run}aclocal-${am__api_version}\"}\n\n\nAUTOCONF=${AUTOCONF-\"${am_missing_run}autoconf\"}\n\n\nAUTOMAKE=${AUTOMAKE-\"${am_missing_run}automake-${am__api_version}\"}\n\n\nAUTOHEADER=${AUTOHEADER-\"${am_missing_run}autoheader\"}\n\n\nMAKEINFO=${MAKEINFO-\"${am_missing_run}makeinfo\"}\n\n# For better backward compatibility.  To be removed once Automake 1.9.x\n# dies out for good.  For more background, see:\n# <http://lists.gnu.org/archive/html/automake/2012-07/msg00001.html>\n# <http://lists.gnu.org/archive/html/automake/2012-07/msg00014.html>\nmkdir_p='$(MKDIR_P)'\n\n# We need awk for the \"check\" target.  The system \"awk\" is bad on\n# some platforms.\n# Always define AMTAR for backward compatibility.  Yes, it's still used\n# in the wild :-(  We should find a proper way to deprecate it ...\nAMTAR='$${TAR-tar}'\n\n\n# We'll loop over all known methods to create a tar archive until one works.\n_am_tools='gnutar  pax cpio none'\n\nam__tar='$${TAR-tar} chof - \"$$tardir\"' am__untar='$${TAR-tar} xf -'\n\n\n\n\n\n\n# POSIX will say in a future version that running \"rm -f\" with no argument\n# is OK; and we want to be able to make that assumption in our Makefile\n# recipes.  So use an aggressive probe to check that the usage we want is\n# actually supported \"in the wild\" to an acceptable degree.\n# See automake bug#10828.\n# To make any issue more visible, cause the running configure to be aborted\n# by default if the 'rm' program in use doesn't match our expectations; the\n# user can still override this though.\nif rm -f && rm -fr && rm -rf; then : OK; else\n  cat >&2 <<'END'\nOops!\n\nYour 'rm' program seems unable to run without file operands specified\non the command line, even when the '-f' option is present.  This is contrary\nto the behaviour of most rm programs out there, and not conforming with\nthe upcoming POSIX standard: <http://austingroupbugs.net/view.php?id=542>\n\nPlease tell bug-automake@gnu.org about your system, including the value\nof your $PATH and any error possibly output before this message.  This\ncan help us improve future automake versions.\n\nEND\n  if test x\"$ACCEPT_INFERIOR_RM_PROGRAM\" = x\"yes\"; then\n    echo 'Configuration will proceed anyway, since you have set the' >&2\n    echo 'ACCEPT_INFERIOR_RM_PROGRAM variable to \"yes\"' >&2\n    echo >&2\n  else\n    cat >&2 <<'END'\nAborting the configuration process, to ensure you take notice of the issue.\n\nYou can download and install GNU coreutils to get an 'rm' implementation\nthat behaves properly: <http://www.gnu.org/software/coreutils/>.\n\nIf you want to complete the configuration process using your problematic\n'rm' anyway, export the environment variable ACCEPT_INFERIOR_RM_PROGRAM\nto \"yes\", and re-run configure.\n\nEND\n    as_fn_error $? \"Your 'rm' program is bad, sorry.\" \"$LINENO\" 5\n  fi\nfi\nDEPDIR=\"${am__leading_dot}deps\"\n\nac_config_commands=\"$ac_config_commands depfiles\"\n\n\nam_make=${MAKE-make}\ncat > confinc << 'END'\nam__doit:\n\t@echo this is the am__doit target\n.PHONY: am__doit\nEND\n# If we don't find an include directive, just comment out the code.\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for style of include used by $am_make\" >&5\n$as_echo_n \"checking for style of include used by $am_make... \" >&6; }\nam__include=\"#\"\nam__quote=\n_am_result=none\n# First try GNU make style include.\necho \"include confinc\" > confmf\n# Ignore all kinds of additional output from 'make'.\ncase `$am_make -s -f confmf 2> /dev/null` in #(\n*the\\ am__doit\\ target*)\n  am__include=include\n  am__quote=\n  _am_result=GNU\n  ;;\nesac\n# Now try BSD make style include.\nif test \"$am__include\" = \"#\"; then\n   echo '.include \"confinc\"' > confmf\n   case `$am_make -s -f confmf 2> /dev/null` in #(\n   *the\\ am__doit\\ target*)\n     am__include=.include\n     am__quote=\"\\\"\"\n     _am_result=BSD\n     ;;\n   esac\nfi\n\n\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $_am_result\" >&5\n$as_echo \"$_am_result\" >&6; }\nrm -f confinc confmf\n\n# Check whether --enable-dependency-tracking was given.\nif test \"${enable_dependency_tracking+set}\" = set; then :\n  enableval=$enable_dependency_tracking;\nfi\n\nif test \"x$enable_dependency_tracking\" != xno; then\n  am_depcomp=\"$ac_aux_dir/depcomp\"\n  AMDEPBACKSLASH='\\'\n  am__nodep='_no'\nfi\n if test \"x$enable_dependency_tracking\" != xno; then\n  AMDEP_TRUE=\n  AMDEP_FALSE='#'\nelse\n  AMDEP_TRUE='#'\n  AMDEP_FALSE=\nfi\n\n\nac_ext=c\nac_cpp='$CPP $CPPFLAGS'\nac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5'\nac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5'\nac_compiler_gnu=$ac_cv_c_compiler_gnu\nif test -n \"$ac_tool_prefix\"; then\n  # Extract the first word of \"${ac_tool_prefix}gcc\", so it can be a program name with args.\nset dummy ${ac_tool_prefix}gcc; ac_word=$2\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for $ac_word\" >&5\n$as_echo_n \"checking for $ac_word... \" >&6; }\nif ${ac_cv_prog_CC+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  if test -n \"$CC\"; then\n  ac_cv_prog_CC=\"$CC\" # Let the user override the test.\nelse\nas_save_IFS=$IFS; IFS=$PATH_SEPARATOR\nfor as_dir in $PATH\ndo\n  IFS=$as_save_IFS\n  test -z \"$as_dir\" && as_dir=.\n    for ac_exec_ext in '' $ac_executable_extensions; do\n  if as_fn_executable_p \"$as_dir/$ac_word$ac_exec_ext\"; then\n    ac_cv_prog_CC=\"${ac_tool_prefix}gcc\"\n    $as_echo \"$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext\" >&5\n    break 2\n  fi\ndone\n  done\nIFS=$as_save_IFS\n\nfi\nfi\nCC=$ac_cv_prog_CC\nif test -n \"$CC\"; then\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: $CC\" >&5\n$as_echo \"$CC\" >&6; }\nelse\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: no\" >&5\n$as_echo \"no\" >&6; }\nfi\n\n\nfi\nif test -z \"$ac_cv_prog_CC\"; then\n  ac_ct_CC=$CC\n  # Extract the first word of \"gcc\", so it can be a program name with args.\nset dummy gcc; ac_word=$2\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for $ac_word\" >&5\n$as_echo_n \"checking for $ac_word... \" >&6; }\nif ${ac_cv_prog_ac_ct_CC+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  if test -n \"$ac_ct_CC\"; then\n  ac_cv_prog_ac_ct_CC=\"$ac_ct_CC\" # Let the user override the test.\nelse\nas_save_IFS=$IFS; IFS=$PATH_SEPARATOR\nfor as_dir in $PATH\ndo\n  IFS=$as_save_IFS\n  test -z \"$as_dir\" && as_dir=.\n    for ac_exec_ext in '' $ac_executable_extensions; do\n  if as_fn_executable_p \"$as_dir/$ac_word$ac_exec_ext\"; then\n    ac_cv_prog_ac_ct_CC=\"gcc\"\n    $as_echo \"$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext\" >&5\n    break 2\n  fi\ndone\n  done\nIFS=$as_save_IFS\n\nfi\nfi\nac_ct_CC=$ac_cv_prog_ac_ct_CC\nif test -n \"$ac_ct_CC\"; then\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: $ac_ct_CC\" >&5\n$as_echo \"$ac_ct_CC\" >&6; }\nelse\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: no\" >&5\n$as_echo \"no\" >&6; }\nfi\n\n  if test \"x$ac_ct_CC\" = x; then\n    CC=\"\"\n  else\n    case $cross_compiling:$ac_tool_warned in\nyes:)\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet\" >&5\n$as_echo \"$as_me: WARNING: using cross tools not prefixed with host triplet\" >&2;}\nac_tool_warned=yes ;;\nesac\n    CC=$ac_ct_CC\n  fi\nelse\n  CC=\"$ac_cv_prog_CC\"\nfi\n\nif test -z \"$CC\"; then\n          if test -n \"$ac_tool_prefix\"; then\n    # Extract the first word of \"${ac_tool_prefix}cc\", so it can be a program name with args.\nset dummy ${ac_tool_prefix}cc; ac_word=$2\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for $ac_word\" >&5\n$as_echo_n \"checking for $ac_word... \" >&6; }\nif ${ac_cv_prog_CC+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  if test -n \"$CC\"; then\n  ac_cv_prog_CC=\"$CC\" # Let the user override the test.\nelse\nas_save_IFS=$IFS; IFS=$PATH_SEPARATOR\nfor as_dir in $PATH\ndo\n  IFS=$as_save_IFS\n  test -z \"$as_dir\" && as_dir=.\n    for ac_exec_ext in '' $ac_executable_extensions; do\n  if as_fn_executable_p \"$as_dir/$ac_word$ac_exec_ext\"; then\n    ac_cv_prog_CC=\"${ac_tool_prefix}cc\"\n    $as_echo \"$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext\" >&5\n    break 2\n  fi\ndone\n  done\nIFS=$as_save_IFS\n\nfi\nfi\nCC=$ac_cv_prog_CC\nif test -n \"$CC\"; then\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: $CC\" >&5\n$as_echo \"$CC\" >&6; }\nelse\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: no\" >&5\n$as_echo \"no\" >&6; }\nfi\n\n\n  fi\nfi\nif test -z \"$CC\"; then\n  # Extract the first word of \"cc\", so it can be a program name with args.\nset dummy cc; ac_word=$2\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for $ac_word\" >&5\n$as_echo_n \"checking for $ac_word... \" >&6; }\nif ${ac_cv_prog_CC+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  if test -n \"$CC\"; then\n  ac_cv_prog_CC=\"$CC\" # Let the user override the test.\nelse\n  ac_prog_rejected=no\nas_save_IFS=$IFS; IFS=$PATH_SEPARATOR\nfor as_dir in $PATH\ndo\n  IFS=$as_save_IFS\n  test -z \"$as_dir\" && as_dir=.\n    for ac_exec_ext in '' $ac_executable_extensions; do\n  if as_fn_executable_p \"$as_dir/$ac_word$ac_exec_ext\"; then\n    if test \"$as_dir/$ac_word$ac_exec_ext\" = \"/usr/ucb/cc\"; then\n       ac_prog_rejected=yes\n       continue\n     fi\n    ac_cv_prog_CC=\"cc\"\n    $as_echo \"$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext\" >&5\n    break 2\n  fi\ndone\n  done\nIFS=$as_save_IFS\n\nif test $ac_prog_rejected = yes; then\n  # We found a bogon in the path, so make sure we never use it.\n  set dummy $ac_cv_prog_CC\n  shift\n  if test $# != 0; then\n    # We chose a different compiler from the bogus one.\n    # However, it has the same basename, so the bogon will be chosen\n    # first if we set CC to just the basename; use the full file name.\n    shift\n    ac_cv_prog_CC=\"$as_dir/$ac_word${1+' '}$@\"\n  fi\nfi\nfi\nfi\nCC=$ac_cv_prog_CC\nif test -n \"$CC\"; then\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: $CC\" >&5\n$as_echo \"$CC\" >&6; }\nelse\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: no\" >&5\n$as_echo \"no\" >&6; }\nfi\n\n\nfi\nif test -z \"$CC\"; then\n  if test -n \"$ac_tool_prefix\"; then\n  for ac_prog in cl.exe\n  do\n    # Extract the first word of \"$ac_tool_prefix$ac_prog\", so it can be a program name with args.\nset dummy $ac_tool_prefix$ac_prog; ac_word=$2\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for $ac_word\" >&5\n$as_echo_n \"checking for $ac_word... \" >&6; }\nif ${ac_cv_prog_CC+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  if test -n \"$CC\"; then\n  ac_cv_prog_CC=\"$CC\" # Let the user override the test.\nelse\nas_save_IFS=$IFS; IFS=$PATH_SEPARATOR\nfor as_dir in $PATH\ndo\n  IFS=$as_save_IFS\n  test -z \"$as_dir\" && as_dir=.\n    for ac_exec_ext in '' $ac_executable_extensions; do\n  if as_fn_executable_p \"$as_dir/$ac_word$ac_exec_ext\"; then\n    ac_cv_prog_CC=\"$ac_tool_prefix$ac_prog\"\n    $as_echo \"$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext\" >&5\n    break 2\n  fi\ndone\n  done\nIFS=$as_save_IFS\n\nfi\nfi\nCC=$ac_cv_prog_CC\nif test -n \"$CC\"; then\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: $CC\" >&5\n$as_echo \"$CC\" >&6; }\nelse\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: no\" >&5\n$as_echo \"no\" >&6; }\nfi\n\n\n    test -n \"$CC\" && break\n  done\nfi\nif test -z \"$CC\"; then\n  ac_ct_CC=$CC\n  for ac_prog in cl.exe\ndo\n  # Extract the first word of \"$ac_prog\", so it can be a program name with args.\nset dummy $ac_prog; ac_word=$2\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for $ac_word\" >&5\n$as_echo_n \"checking for $ac_word... \" >&6; }\nif ${ac_cv_prog_ac_ct_CC+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  if test -n \"$ac_ct_CC\"; then\n  ac_cv_prog_ac_ct_CC=\"$ac_ct_CC\" # Let the user override the test.\nelse\nas_save_IFS=$IFS; IFS=$PATH_SEPARATOR\nfor as_dir in $PATH\ndo\n  IFS=$as_save_IFS\n  test -z \"$as_dir\" && as_dir=.\n    for ac_exec_ext in '' $ac_executable_extensions; do\n  if as_fn_executable_p \"$as_dir/$ac_word$ac_exec_ext\"; then\n    ac_cv_prog_ac_ct_CC=\"$ac_prog\"\n    $as_echo \"$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext\" >&5\n    break 2\n  fi\ndone\n  done\nIFS=$as_save_IFS\n\nfi\nfi\nac_ct_CC=$ac_cv_prog_ac_ct_CC\nif test -n \"$ac_ct_CC\"; then\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: $ac_ct_CC\" >&5\n$as_echo \"$ac_ct_CC\" >&6; }\nelse\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: no\" >&5\n$as_echo \"no\" >&6; }\nfi\n\n\n  test -n \"$ac_ct_CC\" && break\ndone\n\n  if test \"x$ac_ct_CC\" = x; then\n    CC=\"\"\n  else\n    case $cross_compiling:$ac_tool_warned in\nyes:)\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet\" >&5\n$as_echo \"$as_me: WARNING: using cross tools not prefixed with host triplet\" >&2;}\nac_tool_warned=yes ;;\nesac\n    CC=$ac_ct_CC\n  fi\nfi\n\nfi\n\n\ntest -z \"$CC\" && { { $as_echo \"$as_me:${as_lineno-$LINENO}: error: in \\`$ac_pwd':\" >&5\n$as_echo \"$as_me: error: in \\`$ac_pwd':\" >&2;}\nas_fn_error $? \"no acceptable C compiler found in \\$PATH\nSee \\`config.log' for more details\" \"$LINENO\" 5; }\n\n# Provide some information about the compiler.\n$as_echo \"$as_me:${as_lineno-$LINENO}: checking for C compiler version\" >&5\nset X $ac_compile\nac_compiler=$2\nfor ac_option in --version -v -V -qversion; do\n  { { ac_try=\"$ac_compiler $ac_option >&5\"\ncase \"(($ac_try\" in\n  *\\\"* | *\\`* | *\\\\*) ac_try_echo=\\$ac_try;;\n  *) ac_try_echo=$ac_try;;\nesac\neval ac_try_echo=\"\\\"\\$as_me:${as_lineno-$LINENO}: $ac_try_echo\\\"\"\n$as_echo \"$ac_try_echo\"; } >&5\n  (eval \"$ac_compiler $ac_option >&5\") 2>conftest.err\n  ac_status=$?\n  if test -s conftest.err; then\n    sed '10a\\\n... rest of stderr output deleted ...\n         10q' conftest.err >conftest.er1\n    cat conftest.er1 >&5\n  fi\n  rm -f conftest.er1 conftest.err\n  $as_echo \"$as_me:${as_lineno-$LINENO}: \\$? = $ac_status\" >&5\n  test $ac_status = 0; }\ndone\n\ncat confdefs.h - <<_ACEOF >conftest.$ac_ext\n/* end confdefs.h.  */\n\nint\nmain ()\n{\n\n  ;\n  return 0;\n}\n_ACEOF\nac_clean_files_save=$ac_clean_files\nac_clean_files=\"$ac_clean_files a.out a.out.dSYM a.exe b.out\"\n# Try to create an executable without -o first, disregard a.out.\n# It will help us diagnose broken compilers, and finding out an intuition\n# of exeext.\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking whether the C compiler works\" >&5\n$as_echo_n \"checking whether the C compiler works... \" >&6; }\nac_link_default=`$as_echo \"$ac_link\" | sed 's/ -o *conftest[^ ]*//'`\n\n# The possible output files:\nac_files=\"a.out conftest.exe conftest a.exe a_out.exe b.out conftest.*\"\n\nac_rmfiles=\nfor ac_file in $ac_files\ndo\n  case $ac_file in\n    *.$ac_ext | *.xcoff | *.tds | *.d | *.pdb | *.xSYM | *.bb | *.bbg | *.map | *.inf | *.dSYM | *.o | *.obj ) ;;\n    * ) ac_rmfiles=\"$ac_rmfiles $ac_file\";;\n  esac\ndone\nrm -f $ac_rmfiles\n\nif { { ac_try=\"$ac_link_default\"\ncase \"(($ac_try\" in\n  *\\\"* | *\\`* | *\\\\*) ac_try_echo=\\$ac_try;;\n  *) ac_try_echo=$ac_try;;\nesac\neval ac_try_echo=\"\\\"\\$as_me:${as_lineno-$LINENO}: $ac_try_echo\\\"\"\n$as_echo \"$ac_try_echo\"; } >&5\n  (eval \"$ac_link_default\") 2>&5\n  ac_status=$?\n  $as_echo \"$as_me:${as_lineno-$LINENO}: \\$? = $ac_status\" >&5\n  test $ac_status = 0; }; then :\n  # Autoconf-2.13 could set the ac_cv_exeext variable to `no'.\n# So ignore a value of `no', otherwise this would lead to `EXEEXT = no'\n# in a Makefile.  We should not override ac_cv_exeext if it was cached,\n# so that the user can short-circuit this test for compilers unknown to\n# Autoconf.\nfor ac_file in $ac_files ''\ndo\n  test -f \"$ac_file\" || continue\n  case $ac_file in\n    *.$ac_ext | *.xcoff | *.tds | *.d | *.pdb | *.xSYM | *.bb | *.bbg | *.map | *.inf | *.dSYM | *.o | *.obj )\n\t;;\n    [ab].out )\n\t# We found the default executable, but exeext='' is most\n\t# certainly right.\n\tbreak;;\n    *.* )\n\tif test \"${ac_cv_exeext+set}\" = set && test \"$ac_cv_exeext\" != no;\n\tthen :; else\n\t   ac_cv_exeext=`expr \"$ac_file\" : '[^.]*\\(\\..*\\)'`\n\tfi\n\t# We set ac_cv_exeext here because the later test for it is not\n\t# safe: cross compilers may not add the suffix if given an `-o'\n\t# argument, so we may need to know it at that point already.\n\t# Even if this section looks crufty: it has the advantage of\n\t# actually working.\n\tbreak;;\n    * )\n\tbreak;;\n  esac\ndone\ntest \"$ac_cv_exeext\" = no && ac_cv_exeext=\n\nelse\n  ac_file=''\nfi\nif test -z \"$ac_file\"; then :\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: no\" >&5\n$as_echo \"no\" >&6; }\n$as_echo \"$as_me: failed program was:\" >&5\nsed 's/^/| /' conftest.$ac_ext >&5\n\n{ { $as_echo \"$as_me:${as_lineno-$LINENO}: error: in \\`$ac_pwd':\" >&5\n$as_echo \"$as_me: error: in \\`$ac_pwd':\" >&2;}\nas_fn_error 77 \"C compiler cannot create executables\nSee \\`config.log' for more details\" \"$LINENO\" 5; }\nelse\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: yes\" >&5\n$as_echo \"yes\" >&6; }\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for C compiler default output file name\" >&5\n$as_echo_n \"checking for C compiler default output file name... \" >&6; }\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $ac_file\" >&5\n$as_echo \"$ac_file\" >&6; }\nac_exeext=$ac_cv_exeext\n\nrm -f -r a.out a.out.dSYM a.exe conftest$ac_cv_exeext b.out\nac_clean_files=$ac_clean_files_save\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for suffix of executables\" >&5\n$as_echo_n \"checking for suffix of executables... \" >&6; }\nif { { ac_try=\"$ac_link\"\ncase \"(($ac_try\" in\n  *\\\"* | *\\`* | *\\\\*) ac_try_echo=\\$ac_try;;\n  *) ac_try_echo=$ac_try;;\nesac\neval ac_try_echo=\"\\\"\\$as_me:${as_lineno-$LINENO}: $ac_try_echo\\\"\"\n$as_echo \"$ac_try_echo\"; } >&5\n  (eval \"$ac_link\") 2>&5\n  ac_status=$?\n  $as_echo \"$as_me:${as_lineno-$LINENO}: \\$? = $ac_status\" >&5\n  test $ac_status = 0; }; then :\n  # If both `conftest.exe' and `conftest' are `present' (well, observable)\n# catch `conftest.exe'.  For instance with Cygwin, `ls conftest' will\n# work properly (i.e., refer to `conftest.exe'), while it won't with\n# `rm'.\nfor ac_file in conftest.exe conftest conftest.*; do\n  test -f \"$ac_file\" || continue\n  case $ac_file in\n    *.$ac_ext | *.xcoff | *.tds | *.d | *.pdb | *.xSYM | *.bb | *.bbg | *.map | *.inf | *.dSYM | *.o | *.obj ) ;;\n    *.* ) ac_cv_exeext=`expr \"$ac_file\" : '[^.]*\\(\\..*\\)'`\n\t  break;;\n    * ) break;;\n  esac\ndone\nelse\n  { { $as_echo \"$as_me:${as_lineno-$LINENO}: error: in \\`$ac_pwd':\" >&5\n$as_echo \"$as_me: error: in \\`$ac_pwd':\" >&2;}\nas_fn_error $? \"cannot compute suffix of executables: cannot compile and link\nSee \\`config.log' for more details\" \"$LINENO\" 5; }\nfi\nrm -f conftest conftest$ac_cv_exeext\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $ac_cv_exeext\" >&5\n$as_echo \"$ac_cv_exeext\" >&6; }\n\nrm -f conftest.$ac_ext\nEXEEXT=$ac_cv_exeext\nac_exeext=$EXEEXT\ncat confdefs.h - <<_ACEOF >conftest.$ac_ext\n/* end confdefs.h.  */\n#include <stdio.h>\nint\nmain ()\n{\nFILE *f = fopen (\"conftest.out\", \"w\");\n return ferror (f) || fclose (f) != 0;\n\n  ;\n  return 0;\n}\n_ACEOF\nac_clean_files=\"$ac_clean_files conftest.out\"\n# Check that the compiler produces executables we can run.  If not, either\n# the compiler is broken, or we cross compile.\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking whether we are cross compiling\" >&5\n$as_echo_n \"checking whether we are cross compiling... \" >&6; }\nif test \"$cross_compiling\" != yes; then\n  { { ac_try=\"$ac_link\"\ncase \"(($ac_try\" in\n  *\\\"* | *\\`* | *\\\\*) ac_try_echo=\\$ac_try;;\n  *) ac_try_echo=$ac_try;;\nesac\neval ac_try_echo=\"\\\"\\$as_me:${as_lineno-$LINENO}: $ac_try_echo\\\"\"\n$as_echo \"$ac_try_echo\"; } >&5\n  (eval \"$ac_link\") 2>&5\n  ac_status=$?\n  $as_echo \"$as_me:${as_lineno-$LINENO}: \\$? = $ac_status\" >&5\n  test $ac_status = 0; }\n  if { ac_try='./conftest$ac_cv_exeext'\n  { { case \"(($ac_try\" in\n  *\\\"* | *\\`* | *\\\\*) ac_try_echo=\\$ac_try;;\n  *) ac_try_echo=$ac_try;;\nesac\neval ac_try_echo=\"\\\"\\$as_me:${as_lineno-$LINENO}: $ac_try_echo\\\"\"\n$as_echo \"$ac_try_echo\"; } >&5\n  (eval \"$ac_try\") 2>&5\n  ac_status=$?\n  $as_echo \"$as_me:${as_lineno-$LINENO}: \\$? = $ac_status\" >&5\n  test $ac_status = 0; }; }; then\n    cross_compiling=no\n  else\n    if test \"$cross_compiling\" = maybe; then\n\tcross_compiling=yes\n    else\n\t{ { $as_echo \"$as_me:${as_lineno-$LINENO}: error: in \\`$ac_pwd':\" >&5\n$as_echo \"$as_me: error: in \\`$ac_pwd':\" >&2;}\nas_fn_error $? \"cannot run C compiled programs.\nIf you meant to cross compile, use \\`--host'.\nSee \\`config.log' for more details\" \"$LINENO\" 5; }\n    fi\n  fi\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $cross_compiling\" >&5\n$as_echo \"$cross_compiling\" >&6; }\n\nrm -f conftest.$ac_ext conftest$ac_cv_exeext conftest.out\nac_clean_files=$ac_clean_files_save\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for suffix of object files\" >&5\n$as_echo_n \"checking for suffix of object files... \" >&6; }\nif ${ac_cv_objext+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  cat confdefs.h - <<_ACEOF >conftest.$ac_ext\n/* end confdefs.h.  */\n\nint\nmain ()\n{\n\n  ;\n  return 0;\n}\n_ACEOF\nrm -f conftest.o conftest.obj\nif { { ac_try=\"$ac_compile\"\ncase \"(($ac_try\" in\n  *\\\"* | *\\`* | *\\\\*) ac_try_echo=\\$ac_try;;\n  *) ac_try_echo=$ac_try;;\nesac\neval ac_try_echo=\"\\\"\\$as_me:${as_lineno-$LINENO}: $ac_try_echo\\\"\"\n$as_echo \"$ac_try_echo\"; } >&5\n  (eval \"$ac_compile\") 2>&5\n  ac_status=$?\n  $as_echo \"$as_me:${as_lineno-$LINENO}: \\$? = $ac_status\" >&5\n  test $ac_status = 0; }; then :\n  for ac_file in conftest.o conftest.obj conftest.*; do\n  test -f \"$ac_file\" || continue;\n  case $ac_file in\n    *.$ac_ext | *.xcoff | *.tds | *.d | *.pdb | *.xSYM | *.bb | *.bbg | *.map | *.inf | *.dSYM ) ;;\n    *) ac_cv_objext=`expr \"$ac_file\" : '.*\\.\\(.*\\)'`\n       break;;\n  esac\ndone\nelse\n  $as_echo \"$as_me: failed program was:\" >&5\nsed 's/^/| /' conftest.$ac_ext >&5\n\n{ { $as_echo \"$as_me:${as_lineno-$LINENO}: error: in \\`$ac_pwd':\" >&5\n$as_echo \"$as_me: error: in \\`$ac_pwd':\" >&2;}\nas_fn_error $? \"cannot compute suffix of object files: cannot compile\nSee \\`config.log' for more details\" \"$LINENO\" 5; }\nfi\nrm -f conftest.$ac_cv_objext conftest.$ac_ext\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $ac_cv_objext\" >&5\n$as_echo \"$ac_cv_objext\" >&6; }\nOBJEXT=$ac_cv_objext\nac_objext=$OBJEXT\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking whether we are using the GNU C compiler\" >&5\n$as_echo_n \"checking whether we are using the GNU C compiler... \" >&6; }\nif ${ac_cv_c_compiler_gnu+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  cat confdefs.h - <<_ACEOF >conftest.$ac_ext\n/* end confdefs.h.  */\n\nint\nmain ()\n{\n#ifndef __GNUC__\n       choke me\n#endif\n\n  ;\n  return 0;\n}\n_ACEOF\nif ac_fn_c_try_compile \"$LINENO\"; then :\n  ac_compiler_gnu=yes\nelse\n  ac_compiler_gnu=no\nfi\nrm -f core conftest.err conftest.$ac_objext conftest.$ac_ext\nac_cv_c_compiler_gnu=$ac_compiler_gnu\n\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $ac_cv_c_compiler_gnu\" >&5\n$as_echo \"$ac_cv_c_compiler_gnu\" >&6; }\nif test $ac_compiler_gnu = yes; then\n  GCC=yes\nelse\n  GCC=\nfi\nac_test_CFLAGS=${CFLAGS+set}\nac_save_CFLAGS=$CFLAGS\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking whether $CC accepts -g\" >&5\n$as_echo_n \"checking whether $CC accepts -g... \" >&6; }\nif ${ac_cv_prog_cc_g+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  ac_save_c_werror_flag=$ac_c_werror_flag\n   ac_c_werror_flag=yes\n   ac_cv_prog_cc_g=no\n   CFLAGS=\"-g\"\n   cat confdefs.h - <<_ACEOF >conftest.$ac_ext\n/* end confdefs.h.  */\n\nint\nmain ()\n{\n\n  ;\n  return 0;\n}\n_ACEOF\nif ac_fn_c_try_compile \"$LINENO\"; then :\n  ac_cv_prog_cc_g=yes\nelse\n  CFLAGS=\"\"\n      cat confdefs.h - <<_ACEOF >conftest.$ac_ext\n/* end confdefs.h.  */\n\nint\nmain ()\n{\n\n  ;\n  return 0;\n}\n_ACEOF\nif ac_fn_c_try_compile \"$LINENO\"; then :\n\nelse\n  ac_c_werror_flag=$ac_save_c_werror_flag\n\t CFLAGS=\"-g\"\n\t cat confdefs.h - <<_ACEOF >conftest.$ac_ext\n/* end confdefs.h.  */\n\nint\nmain ()\n{\n\n  ;\n  return 0;\n}\n_ACEOF\nif ac_fn_c_try_compile \"$LINENO\"; then :\n  ac_cv_prog_cc_g=yes\nfi\nrm -f core conftest.err conftest.$ac_objext conftest.$ac_ext\nfi\nrm -f core conftest.err conftest.$ac_objext conftest.$ac_ext\nfi\nrm -f core conftest.err conftest.$ac_objext conftest.$ac_ext\n   ac_c_werror_flag=$ac_save_c_werror_flag\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $ac_cv_prog_cc_g\" >&5\n$as_echo \"$ac_cv_prog_cc_g\" >&6; }\nif test \"$ac_test_CFLAGS\" = set; then\n  CFLAGS=$ac_save_CFLAGS\nelif test $ac_cv_prog_cc_g = yes; then\n  if test \"$GCC\" = yes; then\n    CFLAGS=\"-g -O2\"\n  else\n    CFLAGS=\"-g\"\n  fi\nelse\n  if test \"$GCC\" = yes; then\n    CFLAGS=\"-O2\"\n  else\n    CFLAGS=\n  fi\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for $CC option to accept ISO C89\" >&5\n$as_echo_n \"checking for $CC option to accept ISO C89... \" >&6; }\nif ${ac_cv_prog_cc_c89+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  ac_cv_prog_cc_c89=no\nac_save_CC=$CC\ncat confdefs.h - <<_ACEOF >conftest.$ac_ext\n/* end confdefs.h.  */\n#include <stdarg.h>\n#include <stdio.h>\nstruct stat;\n/* Most of the following tests are stolen from RCS 5.7's src/conf.sh.  */\nstruct buf { int x; };\nFILE * (*rcsopen) (struct buf *, struct stat *, int);\nstatic char *e (p, i)\n     char **p;\n     int i;\n{\n  return p[i];\n}\nstatic char *f (char * (*g) (char **, int), char **p, ...)\n{\n  char *s;\n  va_list v;\n  va_start (v,p);\n  s = g (p, va_arg (v,int));\n  va_end (v);\n  return s;\n}\n\n/* OSF 4.0 Compaq cc is some sort of almost-ANSI by default.  It has\n   function prototypes and stuff, but not '\\xHH' hex character constants.\n   These don't provoke an error unfortunately, instead are silently treated\n   as 'x'.  The following induces an error, until -std is added to get\n   proper ANSI mode.  Curiously '\\x00'!='x' always comes out true, for an\n   array size at least.  It's necessary to write '\\x00'==0 to get something\n   that's true only with -std.  */\nint osf4_cc_array ['\\x00' == 0 ? 1 : -1];\n\n/* IBM C 6 for AIX is almost-ANSI by default, but it replaces macro parameters\n   inside strings and character constants.  */\n#define FOO(x) 'x'\nint xlc6_cc_array[FOO(a) == 'x' ? 1 : -1];\n\nint test (int i, double x);\nstruct s1 {int (*f) (int a);};\nstruct s2 {int (*f) (double a);};\nint pairnames (int, char **, FILE *(*)(struct buf *, struct stat *, int), int, int);\nint argc;\nchar **argv;\nint\nmain ()\n{\nreturn f (e, argv, 0) != argv[0]  ||  f (e, argv, 1) != argv[1];\n  ;\n  return 0;\n}\n_ACEOF\nfor ac_arg in '' -qlanglvl=extc89 -qlanglvl=ansi -std \\\n\t-Ae \"-Aa -D_HPUX_SOURCE\" \"-Xc -D__EXTENSIONS__\"\ndo\n  CC=\"$ac_save_CC $ac_arg\"\n  if ac_fn_c_try_compile \"$LINENO\"; then :\n  ac_cv_prog_cc_c89=$ac_arg\nfi\nrm -f core conftest.err conftest.$ac_objext\n  test \"x$ac_cv_prog_cc_c89\" != \"xno\" && break\ndone\nrm -f conftest.$ac_ext\nCC=$ac_save_CC\n\nfi\n# AC_CACHE_VAL\ncase \"x$ac_cv_prog_cc_c89\" in\n  x)\n    { $as_echo \"$as_me:${as_lineno-$LINENO}: result: none needed\" >&5\n$as_echo \"none needed\" >&6; } ;;\n  xno)\n    { $as_echo \"$as_me:${as_lineno-$LINENO}: result: unsupported\" >&5\n$as_echo \"unsupported\" >&6; } ;;\n  *)\n    CC=\"$CC $ac_cv_prog_cc_c89\"\n    { $as_echo \"$as_me:${as_lineno-$LINENO}: result: $ac_cv_prog_cc_c89\" >&5\n$as_echo \"$ac_cv_prog_cc_c89\" >&6; } ;;\nesac\nif test \"x$ac_cv_prog_cc_c89\" != xno; then :\n\nfi\n\nac_ext=c\nac_cpp='$CPP $CPPFLAGS'\nac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5'\nac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5'\nac_compiler_gnu=$ac_cv_c_compiler_gnu\n\nac_ext=c\nac_cpp='$CPP $CPPFLAGS'\nac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5'\nac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5'\nac_compiler_gnu=$ac_cv_c_compiler_gnu\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking whether $CC understands -c and -o together\" >&5\n$as_echo_n \"checking whether $CC understands -c and -o together... \" >&6; }\nif ${am_cv_prog_cc_c_o+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  cat confdefs.h - <<_ACEOF >conftest.$ac_ext\n/* end confdefs.h.  */\n\nint\nmain ()\n{\n\n  ;\n  return 0;\n}\n_ACEOF\n  # Make sure it works both with $CC and with simple cc.\n  # Following AC_PROG_CC_C_O, we do the test twice because some\n  # compilers refuse to overwrite an existing .o file with -o,\n  # though they will create one.\n  am_cv_prog_cc_c_o=yes\n  for am_i in 1 2; do\n    if { echo \"$as_me:$LINENO: $CC -c conftest.$ac_ext -o conftest2.$ac_objext\" >&5\n   ($CC -c conftest.$ac_ext -o conftest2.$ac_objext) >&5 2>&5\n   ac_status=$?\n   echo \"$as_me:$LINENO: \\$? = $ac_status\" >&5\n   (exit $ac_status); } \\\n         && test -f conftest2.$ac_objext; then\n      : OK\n    else\n      am_cv_prog_cc_c_o=no\n      break\n    fi\n  done\n  rm -f core conftest*\n  unset am_i\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $am_cv_prog_cc_c_o\" >&5\n$as_echo \"$am_cv_prog_cc_c_o\" >&6; }\nif test \"$am_cv_prog_cc_c_o\" != yes; then\n   # Losing compiler, so override with the script.\n   # FIXME: It is wrong to rewrite CC.\n   # But if we don't then we get into trouble of one sort or another.\n   # A longer-term fix would be to have automake use am__CC in this case,\n   # and then we could set am__CC=\"\\$(top_srcdir)/compile \\$(CC)\"\n   CC=\"$am_aux_dir/compile $CC\"\nfi\nac_ext=c\nac_cpp='$CPP $CPPFLAGS'\nac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5'\nac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5'\nac_compiler_gnu=$ac_cv_c_compiler_gnu\n\n\ndepcc=\"$CC\"   am_compiler_list=\n\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking dependency style of $depcc\" >&5\n$as_echo_n \"checking dependency style of $depcc... \" >&6; }\nif ${am_cv_CC_dependencies_compiler_type+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  if test -z \"$AMDEP_TRUE\" && test -f \"$am_depcomp\"; then\n  # We make a subdir and do the tests there.  Otherwise we can end up\n  # making bogus files that we don't know about and never remove.  For\n  # instance it was reported that on HP-UX the gcc test will end up\n  # making a dummy file named 'D' -- because '-MD' means \"put the output\n  # in D\".\n  rm -rf conftest.dir\n  mkdir conftest.dir\n  # Copy depcomp to subdir because otherwise we won't find it if we're\n  # using a relative directory.\n  cp \"$am_depcomp\" conftest.dir\n  cd conftest.dir\n  # We will build objects and dependencies in a subdirectory because\n  # it helps to detect inapplicable dependency modes.  For instance\n  # both Tru64's cc and ICC support -MD to output dependencies as a\n  # side effect of compilation, but ICC will put the dependencies in\n  # the current directory while Tru64 will put them in the object\n  # directory.\n  mkdir sub\n\n  am_cv_CC_dependencies_compiler_type=none\n  if test \"$am_compiler_list\" = \"\"; then\n     am_compiler_list=`sed -n 's/^#*\\([a-zA-Z0-9]*\\))$/\\1/p' < ./depcomp`\n  fi\n  am__universal=false\n  case \" $depcc \" in #(\n     *\\ -arch\\ *\\ -arch\\ *) am__universal=true ;;\n     esac\n\n  for depmode in $am_compiler_list; do\n    # Setup a source with many dependencies, because some compilers\n    # like to wrap large dependency lists on column 80 (with \\), and\n    # we should not choose a depcomp mode which is confused by this.\n    #\n    # We need to recreate these files for each test, as the compiler may\n    # overwrite some of them when testing with obscure command lines.\n    # This happens at least with the AIX C compiler.\n    : > sub/conftest.c\n    for i in 1 2 3 4 5 6; do\n      echo '#include \"conftst'$i'.h\"' >> sub/conftest.c\n      # Using \": > sub/conftst$i.h\" creates only sub/conftst1.h with\n      # Solaris 10 /bin/sh.\n      echo '/* dummy */' > sub/conftst$i.h\n    done\n    echo \"${am__include} ${am__quote}sub/conftest.Po${am__quote}\" > confmf\n\n    # We check with '-c' and '-o' for the sake of the \"dashmstdout\"\n    # mode.  It turns out that the SunPro C++ compiler does not properly\n    # handle '-M -o', and we need to detect this.  Also, some Intel\n    # versions had trouble with output in subdirs.\n    am__obj=sub/conftest.${OBJEXT-o}\n    am__minus_obj=\"-o $am__obj\"\n    case $depmode in\n    gcc)\n      # This depmode causes a compiler race in universal mode.\n      test \"$am__universal\" = false || continue\n      ;;\n    nosideeffect)\n      # After this tag, mechanisms are not by side-effect, so they'll\n      # only be used when explicitly requested.\n      if test \"x$enable_dependency_tracking\" = xyes; then\n\tcontinue\n      else\n\tbreak\n      fi\n      ;;\n    msvc7 | msvc7msys | msvisualcpp | msvcmsys)\n      # This compiler won't grok '-c -o', but also, the minuso test has\n      # not run yet.  These depmodes are late enough in the game, and\n      # so weak that their functioning should not be impacted.\n      am__obj=conftest.${OBJEXT-o}\n      am__minus_obj=\n      ;;\n    none) break ;;\n    esac\n    if depmode=$depmode \\\n       source=sub/conftest.c object=$am__obj \\\n       depfile=sub/conftest.Po tmpdepfile=sub/conftest.TPo \\\n       $SHELL ./depcomp $depcc -c $am__minus_obj sub/conftest.c \\\n         >/dev/null 2>conftest.err &&\n       grep sub/conftst1.h sub/conftest.Po > /dev/null 2>&1 &&\n       grep sub/conftst6.h sub/conftest.Po > /dev/null 2>&1 &&\n       grep $am__obj sub/conftest.Po > /dev/null 2>&1 &&\n       ${MAKE-make} -s -f confmf > /dev/null 2>&1; then\n      # icc doesn't choke on unknown options, it will just issue warnings\n      # or remarks (even with -Werror).  So we grep stderr for any message\n      # that says an option was ignored or not supported.\n      # When given -MP, icc 7.0 and 7.1 complain thusly:\n      #   icc: Command line warning: ignoring option '-M'; no argument required\n      # The diagnosis changed in icc 8.0:\n      #   icc: Command line remark: option '-MP' not supported\n      if (grep 'ignoring option' conftest.err ||\n          grep 'not supported' conftest.err) >/dev/null 2>&1; then :; else\n        am_cv_CC_dependencies_compiler_type=$depmode\n        break\n      fi\n    fi\n  done\n\n  cd ..\n  rm -rf conftest.dir\nelse\n  am_cv_CC_dependencies_compiler_type=none\nfi\n\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $am_cv_CC_dependencies_compiler_type\" >&5\n$as_echo \"$am_cv_CC_dependencies_compiler_type\" >&6; }\nCCDEPMODE=depmode=$am_cv_CC_dependencies_compiler_type\n\n if\n  test \"x$enable_dependency_tracking\" != xno \\\n  && test \"$am_cv_CC_dependencies_compiler_type\" = gcc3; then\n  am__fastdepCC_TRUE=\n  am__fastdepCC_FALSE='#'\nelse\n  am__fastdepCC_TRUE='#'\n  am__fastdepCC_FALSE=\nfi\n\n\n\nif test -n \"$ac_tool_prefix\"; then\n  for ac_prog in ar lib \"link -lib\"\n  do\n    # Extract the first word of \"$ac_tool_prefix$ac_prog\", so it can be a program name with args.\nset dummy $ac_tool_prefix$ac_prog; ac_word=$2\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for $ac_word\" >&5\n$as_echo_n \"checking for $ac_word... \" >&6; }\nif ${ac_cv_prog_AR+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  if test -n \"$AR\"; then\n  ac_cv_prog_AR=\"$AR\" # Let the user override the test.\nelse\nas_save_IFS=$IFS; IFS=$PATH_SEPARATOR\nfor as_dir in $PATH\ndo\n  IFS=$as_save_IFS\n  test -z \"$as_dir\" && as_dir=.\n    for ac_exec_ext in '' $ac_executable_extensions; do\n  if as_fn_executable_p \"$as_dir/$ac_word$ac_exec_ext\"; then\n    ac_cv_prog_AR=\"$ac_tool_prefix$ac_prog\"\n    $as_echo \"$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext\" >&5\n    break 2\n  fi\ndone\n  done\nIFS=$as_save_IFS\n\nfi\nfi\nAR=$ac_cv_prog_AR\nif test -n \"$AR\"; then\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: $AR\" >&5\n$as_echo \"$AR\" >&6; }\nelse\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: no\" >&5\n$as_echo \"no\" >&6; }\nfi\n\n\n    test -n \"$AR\" && break\n  done\nfi\nif test -z \"$AR\"; then\n  ac_ct_AR=$AR\n  for ac_prog in ar lib \"link -lib\"\ndo\n  # Extract the first word of \"$ac_prog\", so it can be a program name with args.\nset dummy $ac_prog; ac_word=$2\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for $ac_word\" >&5\n$as_echo_n \"checking for $ac_word... \" >&6; }\nif ${ac_cv_prog_ac_ct_AR+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  if test -n \"$ac_ct_AR\"; then\n  ac_cv_prog_ac_ct_AR=\"$ac_ct_AR\" # Let the user override the test.\nelse\nas_save_IFS=$IFS; IFS=$PATH_SEPARATOR\nfor as_dir in $PATH\ndo\n  IFS=$as_save_IFS\n  test -z \"$as_dir\" && as_dir=.\n    for ac_exec_ext in '' $ac_executable_extensions; do\n  if as_fn_executable_p \"$as_dir/$ac_word$ac_exec_ext\"; then\n    ac_cv_prog_ac_ct_AR=\"$ac_prog\"\n    $as_echo \"$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext\" >&5\n    break 2\n  fi\ndone\n  done\nIFS=$as_save_IFS\n\nfi\nfi\nac_ct_AR=$ac_cv_prog_ac_ct_AR\nif test -n \"$ac_ct_AR\"; then\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: $ac_ct_AR\" >&5\n$as_echo \"$ac_ct_AR\" >&6; }\nelse\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: no\" >&5\n$as_echo \"no\" >&6; }\nfi\n\n\n  test -n \"$ac_ct_AR\" && break\ndone\n\n  if test \"x$ac_ct_AR\" = x; then\n    AR=\"false\"\n  else\n    case $cross_compiling:$ac_tool_warned in\nyes:)\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet\" >&5\n$as_echo \"$as_me: WARNING: using cross tools not prefixed with host triplet\" >&2;}\nac_tool_warned=yes ;;\nesac\n    AR=$ac_ct_AR\n  fi\nfi\n\n: ${AR=ar}\n\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking the archiver ($AR) interface\" >&5\n$as_echo_n \"checking the archiver ($AR) interface... \" >&6; }\nif ${am_cv_ar_interface+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  ac_ext=c\nac_cpp='$CPP $CPPFLAGS'\nac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5'\nac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5'\nac_compiler_gnu=$ac_cv_c_compiler_gnu\n\n   am_cv_ar_interface=ar\n   cat confdefs.h - <<_ACEOF >conftest.$ac_ext\n/* end confdefs.h.  */\nint some_variable = 0;\n_ACEOF\nif ac_fn_c_try_compile \"$LINENO\"; then :\n  am_ar_try='$AR cru libconftest.a conftest.$ac_objext >&5'\n      { { eval echo \"\\\"\\$as_me\\\":${as_lineno-$LINENO}: \\\"$am_ar_try\\\"\"; } >&5\n  (eval $am_ar_try) 2>&5\n  ac_status=$?\n  $as_echo \"$as_me:${as_lineno-$LINENO}: \\$? = $ac_status\" >&5\n  test $ac_status = 0; }\n      if test \"$ac_status\" -eq 0; then\n        am_cv_ar_interface=ar\n      else\n        am_ar_try='$AR -NOLOGO -OUT:conftest.lib conftest.$ac_objext >&5'\n        { { eval echo \"\\\"\\$as_me\\\":${as_lineno-$LINENO}: \\\"$am_ar_try\\\"\"; } >&5\n  (eval $am_ar_try) 2>&5\n  ac_status=$?\n  $as_echo \"$as_me:${as_lineno-$LINENO}: \\$? = $ac_status\" >&5\n  test $ac_status = 0; }\n        if test \"$ac_status\" -eq 0; then\n          am_cv_ar_interface=lib\n        else\n          am_cv_ar_interface=unknown\n        fi\n      fi\n      rm -f conftest.lib libconftest.a\n\nfi\nrm -f core conftest.err conftest.$ac_objext conftest.$ac_ext\n   ac_ext=c\nac_cpp='$CPP $CPPFLAGS'\nac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5'\nac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5'\nac_compiler_gnu=$ac_cv_c_compiler_gnu\n\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $am_cv_ar_interface\" >&5\n$as_echo \"$am_cv_ar_interface\" >&6; }\n\ncase $am_cv_ar_interface in\nar)\n  ;;\nlib)\n  # Microsoft lib, so override with the ar-lib wrapper script.\n  # FIXME: It is wrong to rewrite AR.\n  # But if we don't then we get into trouble of one sort or another.\n  # A longer-term fix would be to have automake use am__AR in this case,\n  # and then we could set am__AR=\"$am_aux_dir/ar-lib \\$(AR)\" or something\n  # similar.\n  AR=\"$am_aux_dir/ar-lib $AR\"\n  ;;\nunknown)\n  as_fn_error $? \"could not determine $AR interface\" \"$LINENO\" 5\n  ;;\nesac\n\n\n# OpenFst does not throw exceptions, so we do not generate exception handling\n# code. However, users are free to re-enable exception handling.\n# OpenFst assumes char is unsigned; -fsigned-char is likely unsafe.\nCPPFLAGS=\"$CPPFLAGS -fno-exceptions -funsigned-char\"\nCXXFLAGS=\"$CXXFLAGS -std=c++11\"\n\nac_ext=cpp\nac_cpp='$CXXCPP $CPPFLAGS'\nac_compile='$CXX -c $CXXFLAGS $CPPFLAGS conftest.$ac_ext >&5'\nac_link='$CXX -o conftest$ac_exeext $CXXFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5'\nac_compiler_gnu=$ac_cv_cxx_compiler_gnu\nif test -z \"$CXX\"; then\n  if test -n \"$CCC\"; then\n    CXX=$CCC\n  else\n    if test -n \"$ac_tool_prefix\"; then\n  for ac_prog in g++ c++ gpp aCC CC cxx cc++ cl.exe FCC KCC RCC xlC_r xlC\n  do\n    # Extract the first word of \"$ac_tool_prefix$ac_prog\", so it can be a program name with args.\nset dummy $ac_tool_prefix$ac_prog; ac_word=$2\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for $ac_word\" >&5\n$as_echo_n \"checking for $ac_word... \" >&6; }\nif ${ac_cv_prog_CXX+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  if test -n \"$CXX\"; then\n  ac_cv_prog_CXX=\"$CXX\" # Let the user override the test.\nelse\nas_save_IFS=$IFS; IFS=$PATH_SEPARATOR\nfor as_dir in $PATH\ndo\n  IFS=$as_save_IFS\n  test -z \"$as_dir\" && as_dir=.\n    for ac_exec_ext in '' $ac_executable_extensions; do\n  if as_fn_executable_p \"$as_dir/$ac_word$ac_exec_ext\"; then\n    ac_cv_prog_CXX=\"$ac_tool_prefix$ac_prog\"\n    $as_echo \"$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext\" >&5\n    break 2\n  fi\ndone\n  done\nIFS=$as_save_IFS\n\nfi\nfi\nCXX=$ac_cv_prog_CXX\nif test -n \"$CXX\"; then\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: $CXX\" >&5\n$as_echo \"$CXX\" >&6; }\nelse\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: no\" >&5\n$as_echo \"no\" >&6; }\nfi\n\n\n    test -n \"$CXX\" && break\n  done\nfi\nif test -z \"$CXX\"; then\n  ac_ct_CXX=$CXX\n  for ac_prog in g++ c++ gpp aCC CC cxx cc++ cl.exe FCC KCC RCC xlC_r xlC\ndo\n  # Extract the first word of \"$ac_prog\", so it can be a program name with args.\nset dummy $ac_prog; ac_word=$2\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for $ac_word\" >&5\n$as_echo_n \"checking for $ac_word... \" >&6; }\nif ${ac_cv_prog_ac_ct_CXX+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  if test -n \"$ac_ct_CXX\"; then\n  ac_cv_prog_ac_ct_CXX=\"$ac_ct_CXX\" # Let the user override the test.\nelse\nas_save_IFS=$IFS; IFS=$PATH_SEPARATOR\nfor as_dir in $PATH\ndo\n  IFS=$as_save_IFS\n  test -z \"$as_dir\" && as_dir=.\n    for ac_exec_ext in '' $ac_executable_extensions; do\n  if as_fn_executable_p \"$as_dir/$ac_word$ac_exec_ext\"; then\n    ac_cv_prog_ac_ct_CXX=\"$ac_prog\"\n    $as_echo \"$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext\" >&5\n    break 2\n  fi\ndone\n  done\nIFS=$as_save_IFS\n\nfi\nfi\nac_ct_CXX=$ac_cv_prog_ac_ct_CXX\nif test -n \"$ac_ct_CXX\"; then\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: $ac_ct_CXX\" >&5\n$as_echo \"$ac_ct_CXX\" >&6; }\nelse\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: no\" >&5\n$as_echo \"no\" >&6; }\nfi\n\n\n  test -n \"$ac_ct_CXX\" && break\ndone\n\n  if test \"x$ac_ct_CXX\" = x; then\n    CXX=\"g++\"\n  else\n    case $cross_compiling:$ac_tool_warned in\nyes:)\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet\" >&5\n$as_echo \"$as_me: WARNING: using cross tools not prefixed with host triplet\" >&2;}\nac_tool_warned=yes ;;\nesac\n    CXX=$ac_ct_CXX\n  fi\nfi\n\n  fi\nfi\n# Provide some information about the compiler.\n$as_echo \"$as_me:${as_lineno-$LINENO}: checking for C++ compiler version\" >&5\nset X $ac_compile\nac_compiler=$2\nfor ac_option in --version -v -V -qversion; do\n  { { ac_try=\"$ac_compiler $ac_option >&5\"\ncase \"(($ac_try\" in\n  *\\\"* | *\\`* | *\\\\*) ac_try_echo=\\$ac_try;;\n  *) ac_try_echo=$ac_try;;\nesac\neval ac_try_echo=\"\\\"\\$as_me:${as_lineno-$LINENO}: $ac_try_echo\\\"\"\n$as_echo \"$ac_try_echo\"; } >&5\n  (eval \"$ac_compiler $ac_option >&5\") 2>conftest.err\n  ac_status=$?\n  if test -s conftest.err; then\n    sed '10a\\\n... rest of stderr output deleted ...\n         10q' conftest.err >conftest.er1\n    cat conftest.er1 >&5\n  fi\n  rm -f conftest.er1 conftest.err\n  $as_echo \"$as_me:${as_lineno-$LINENO}: \\$? = $ac_status\" >&5\n  test $ac_status = 0; }\ndone\n\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking whether we are using the GNU C++ compiler\" >&5\n$as_echo_n \"checking whether we are using the GNU C++ compiler... \" >&6; }\nif ${ac_cv_cxx_compiler_gnu+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  cat confdefs.h - <<_ACEOF >conftest.$ac_ext\n/* end confdefs.h.  */\n\nint\nmain ()\n{\n#ifndef __GNUC__\n       choke me\n#endif\n\n  ;\n  return 0;\n}\n_ACEOF\nif ac_fn_cxx_try_compile \"$LINENO\"; then :\n  ac_compiler_gnu=yes\nelse\n  ac_compiler_gnu=no\nfi\nrm -f core conftest.err conftest.$ac_objext conftest.$ac_ext\nac_cv_cxx_compiler_gnu=$ac_compiler_gnu\n\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $ac_cv_cxx_compiler_gnu\" >&5\n$as_echo \"$ac_cv_cxx_compiler_gnu\" >&6; }\nif test $ac_compiler_gnu = yes; then\n  GXX=yes\nelse\n  GXX=\nfi\nac_test_CXXFLAGS=${CXXFLAGS+set}\nac_save_CXXFLAGS=$CXXFLAGS\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking whether $CXX accepts -g\" >&5\n$as_echo_n \"checking whether $CXX accepts -g... \" >&6; }\nif ${ac_cv_prog_cxx_g+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  ac_save_cxx_werror_flag=$ac_cxx_werror_flag\n   ac_cxx_werror_flag=yes\n   ac_cv_prog_cxx_g=no\n   CXXFLAGS=\"-g\"\n   cat confdefs.h - <<_ACEOF >conftest.$ac_ext\n/* end confdefs.h.  */\n\nint\nmain ()\n{\n\n  ;\n  return 0;\n}\n_ACEOF\nif ac_fn_cxx_try_compile \"$LINENO\"; then :\n  ac_cv_prog_cxx_g=yes\nelse\n  CXXFLAGS=\"\"\n      cat confdefs.h - <<_ACEOF >conftest.$ac_ext\n/* end confdefs.h.  */\n\nint\nmain ()\n{\n\n  ;\n  return 0;\n}\n_ACEOF\nif ac_fn_cxx_try_compile \"$LINENO\"; then :\n\nelse\n  ac_cxx_werror_flag=$ac_save_cxx_werror_flag\n\t CXXFLAGS=\"-g\"\n\t cat confdefs.h - <<_ACEOF >conftest.$ac_ext\n/* end confdefs.h.  */\n\nint\nmain ()\n{\n\n  ;\n  return 0;\n}\n_ACEOF\nif ac_fn_cxx_try_compile \"$LINENO\"; then :\n  ac_cv_prog_cxx_g=yes\nfi\nrm -f core conftest.err conftest.$ac_objext conftest.$ac_ext\nfi\nrm -f core conftest.err conftest.$ac_objext conftest.$ac_ext\nfi\nrm -f core conftest.err conftest.$ac_objext conftest.$ac_ext\n   ac_cxx_werror_flag=$ac_save_cxx_werror_flag\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $ac_cv_prog_cxx_g\" >&5\n$as_echo \"$ac_cv_prog_cxx_g\" >&6; }\nif test \"$ac_test_CXXFLAGS\" = set; then\n  CXXFLAGS=$ac_save_CXXFLAGS\nelif test $ac_cv_prog_cxx_g = yes; then\n  if test \"$GXX\" = yes; then\n    CXXFLAGS=\"-g -O2\"\n  else\n    CXXFLAGS=\"-g\"\n  fi\nelse\n  if test \"$GXX\" = yes; then\n    CXXFLAGS=\"-O2\"\n  else\n    CXXFLAGS=\n  fi\nfi\nac_ext=c\nac_cpp='$CPP $CPPFLAGS'\nac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5'\nac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5'\nac_compiler_gnu=$ac_cv_c_compiler_gnu\n\ndepcc=\"$CXX\"  am_compiler_list=\n\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking dependency style of $depcc\" >&5\n$as_echo_n \"checking dependency style of $depcc... \" >&6; }\nif ${am_cv_CXX_dependencies_compiler_type+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  if test -z \"$AMDEP_TRUE\" && test -f \"$am_depcomp\"; then\n  # We make a subdir and do the tests there.  Otherwise we can end up\n  # making bogus files that we don't know about and never remove.  For\n  # instance it was reported that on HP-UX the gcc test will end up\n  # making a dummy file named 'D' -- because '-MD' means \"put the output\n  # in D\".\n  rm -rf conftest.dir\n  mkdir conftest.dir\n  # Copy depcomp to subdir because otherwise we won't find it if we're\n  # using a relative directory.\n  cp \"$am_depcomp\" conftest.dir\n  cd conftest.dir\n  # We will build objects and dependencies in a subdirectory because\n  # it helps to detect inapplicable dependency modes.  For instance\n  # both Tru64's cc and ICC support -MD to output dependencies as a\n  # side effect of compilation, but ICC will put the dependencies in\n  # the current directory while Tru64 will put them in the object\n  # directory.\n  mkdir sub\n\n  am_cv_CXX_dependencies_compiler_type=none\n  if test \"$am_compiler_list\" = \"\"; then\n     am_compiler_list=`sed -n 's/^#*\\([a-zA-Z0-9]*\\))$/\\1/p' < ./depcomp`\n  fi\n  am__universal=false\n  case \" $depcc \" in #(\n     *\\ -arch\\ *\\ -arch\\ *) am__universal=true ;;\n     esac\n\n  for depmode in $am_compiler_list; do\n    # Setup a source with many dependencies, because some compilers\n    # like to wrap large dependency lists on column 80 (with \\), and\n    # we should not choose a depcomp mode which is confused by this.\n    #\n    # We need to recreate these files for each test, as the compiler may\n    # overwrite some of them when testing with obscure command lines.\n    # This happens at least with the AIX C compiler.\n    : > sub/conftest.c\n    for i in 1 2 3 4 5 6; do\n      echo '#include \"conftst'$i'.h\"' >> sub/conftest.c\n      # Using \": > sub/conftst$i.h\" creates only sub/conftst1.h with\n      # Solaris 10 /bin/sh.\n      echo '/* dummy */' > sub/conftst$i.h\n    done\n    echo \"${am__include} ${am__quote}sub/conftest.Po${am__quote}\" > confmf\n\n    # We check with '-c' and '-o' for the sake of the \"dashmstdout\"\n    # mode.  It turns out that the SunPro C++ compiler does not properly\n    # handle '-M -o', and we need to detect this.  Also, some Intel\n    # versions had trouble with output in subdirs.\n    am__obj=sub/conftest.${OBJEXT-o}\n    am__minus_obj=\"-o $am__obj\"\n    case $depmode in\n    gcc)\n      # This depmode causes a compiler race in universal mode.\n      test \"$am__universal\" = false || continue\n      ;;\n    nosideeffect)\n      # After this tag, mechanisms are not by side-effect, so they'll\n      # only be used when explicitly requested.\n      if test \"x$enable_dependency_tracking\" = xyes; then\n\tcontinue\n      else\n\tbreak\n      fi\n      ;;\n    msvc7 | msvc7msys | msvisualcpp | msvcmsys)\n      # This compiler won't grok '-c -o', but also, the minuso test has\n      # not run yet.  These depmodes are late enough in the game, and\n      # so weak that their functioning should not be impacted.\n      am__obj=conftest.${OBJEXT-o}\n      am__minus_obj=\n      ;;\n    none) break ;;\n    esac\n    if depmode=$depmode \\\n       source=sub/conftest.c object=$am__obj \\\n       depfile=sub/conftest.Po tmpdepfile=sub/conftest.TPo \\\n       $SHELL ./depcomp $depcc -c $am__minus_obj sub/conftest.c \\\n         >/dev/null 2>conftest.err &&\n       grep sub/conftst1.h sub/conftest.Po > /dev/null 2>&1 &&\n       grep sub/conftst6.h sub/conftest.Po > /dev/null 2>&1 &&\n       grep $am__obj sub/conftest.Po > /dev/null 2>&1 &&\n       ${MAKE-make} -s -f confmf > /dev/null 2>&1; then\n      # icc doesn't choke on unknown options, it will just issue warnings\n      # or remarks (even with -Werror).  So we grep stderr for any message\n      # that says an option was ignored or not supported.\n      # When given -MP, icc 7.0 and 7.1 complain thusly:\n      #   icc: Command line warning: ignoring option '-M'; no argument required\n      # The diagnosis changed in icc 8.0:\n      #   icc: Command line remark: option '-MP' not supported\n      if (grep 'ignoring option' conftest.err ||\n          grep 'not supported' conftest.err) >/dev/null 2>&1; then :; else\n        am_cv_CXX_dependencies_compiler_type=$depmode\n        break\n      fi\n    fi\n  done\n\n  cd ..\n  rm -rf conftest.dir\nelse\n  am_cv_CXX_dependencies_compiler_type=none\nfi\n\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $am_cv_CXX_dependencies_compiler_type\" >&5\n$as_echo \"$am_cv_CXX_dependencies_compiler_type\" >&6; }\nCXXDEPMODE=depmode=$am_cv_CXX_dependencies_compiler_type\n\n if\n  test \"x$enable_dependency_tracking\" != xno \\\n  && test \"$am_cv_CXX_dependencies_compiler_type\" = gcc3; then\n  am__fastdepCXX_TRUE=\n  am__fastdepCXX_FALSE='#'\nelse\n  am__fastdepCXX_TRUE='#'\n  am__fastdepCXX_FALSE=\nfi\n\n\n# Check whether --enable-static was given.\nif test \"${enable_static+set}\" = set; then :\n  enableval=$enable_static; p=${PACKAGE-default}\n    case $enableval in\n    yes) enable_static=yes ;;\n    no) enable_static=no ;;\n    *)\n     enable_static=no\n      # Look at the argument we got.  We use all the common list separators.\n      lt_save_ifs=\"$IFS\"; IFS=\"${IFS}$PATH_SEPARATOR,\"\n      for pkg in $enableval; do\n\tIFS=\"$lt_save_ifs\"\n\tif test \"X$pkg\" = \"X$p\"; then\n\t  enable_static=yes\n\tfi\n      done\n      IFS=\"$lt_save_ifs\"\n      ;;\n    esac\nelse\n  enable_static=no\nfi\n\n\n\n\n\n\n\n\n\ncase `pwd` in\n  *\\ * | *\\\t*)\n    { $as_echo \"$as_me:${as_lineno-$LINENO}: WARNING: Libtool does not cope well with whitespace in \\`pwd\\`\" >&5\n$as_echo \"$as_me: WARNING: Libtool does not cope well with whitespace in \\`pwd\\`\" >&2;} ;;\nesac\n\n\n\nmacro_version='2.4.2'\nmacro_revision='1.3337'\n\n\n\n\n\n\n\n\n\n\n\n\n\nltmain=\"$ac_aux_dir/ltmain.sh\"\n\n# Make sure we can run config.sub.\n$SHELL \"$ac_aux_dir/config.sub\" sun4 >/dev/null 2>&1 ||\n  as_fn_error $? \"cannot run $SHELL $ac_aux_dir/config.sub\" \"$LINENO\" 5\n\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking build system type\" >&5\n$as_echo_n \"checking build system type... \" >&6; }\nif ${ac_cv_build+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  ac_build_alias=$build_alias\ntest \"x$ac_build_alias\" = x &&\n  ac_build_alias=`$SHELL \"$ac_aux_dir/config.guess\"`\ntest \"x$ac_build_alias\" = x &&\n  as_fn_error $? \"cannot guess build type; you must specify one\" \"$LINENO\" 5\nac_cv_build=`$SHELL \"$ac_aux_dir/config.sub\" $ac_build_alias` ||\n  as_fn_error $? \"$SHELL $ac_aux_dir/config.sub $ac_build_alias failed\" \"$LINENO\" 5\n\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $ac_cv_build\" >&5\n$as_echo \"$ac_cv_build\" >&6; }\ncase $ac_cv_build in\n*-*-*) ;;\n*) as_fn_error $? \"invalid value of canonical build\" \"$LINENO\" 5;;\nesac\nbuild=$ac_cv_build\nac_save_IFS=$IFS; IFS='-'\nset x $ac_cv_build\nshift\nbuild_cpu=$1\nbuild_vendor=$2\nshift; shift\n# Remember, the first character of IFS is used to create $*,\n# except with old shells:\nbuild_os=$*\nIFS=$ac_save_IFS\ncase $build_os in *\\ *) build_os=`echo \"$build_os\" | sed 's/ /-/g'`;; esac\n\n\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking host system type\" >&5\n$as_echo_n \"checking host system type... \" >&6; }\nif ${ac_cv_host+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  if test \"x$host_alias\" = x; then\n  ac_cv_host=$ac_cv_build\nelse\n  ac_cv_host=`$SHELL \"$ac_aux_dir/config.sub\" $host_alias` ||\n    as_fn_error $? \"$SHELL $ac_aux_dir/config.sub $host_alias failed\" \"$LINENO\" 5\nfi\n\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $ac_cv_host\" >&5\n$as_echo \"$ac_cv_host\" >&6; }\ncase $ac_cv_host in\n*-*-*) ;;\n*) as_fn_error $? \"invalid value of canonical host\" \"$LINENO\" 5;;\nesac\nhost=$ac_cv_host\nac_save_IFS=$IFS; IFS='-'\nset x $ac_cv_host\nshift\nhost_cpu=$1\nhost_vendor=$2\nshift; shift\n# Remember, the first character of IFS is used to create $*,\n# except with old shells:\nhost_os=$*\nIFS=$ac_save_IFS\ncase $host_os in *\\ *) host_os=`echo \"$host_os\" | sed 's/ /-/g'`;; esac\n\n\n# Backslashify metacharacters that are still active within\n# double-quoted strings.\nsed_quote_subst='s/\\([\"`$\\\\]\\)/\\\\\\1/g'\n\n# Same as above, but do not quote variable references.\ndouble_quote_subst='s/\\([\"`\\\\]\\)/\\\\\\1/g'\n\n# Sed substitution to delay expansion of an escaped shell variable in a\n# double_quote_subst'ed string.\ndelay_variable_subst='s/\\\\\\\\\\\\\\\\\\\\\\$/\\\\\\\\\\\\$/g'\n\n# Sed substitution to delay expansion of an escaped single quote.\ndelay_single_quote_subst='s/'\\''/'\\'\\\\\\\\\\\\\\'\\''/g'\n\n# Sed substitution to avoid accidental globbing in evaled expressions\nno_glob_subst='s/\\*/\\\\\\*/g'\n\nECHO='\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\'\nECHO=$ECHO$ECHO$ECHO$ECHO$ECHO\nECHO=$ECHO$ECHO$ECHO$ECHO$ECHO$ECHO\n\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking how to print strings\" >&5\n$as_echo_n \"checking how to print strings... \" >&6; }\n# Test print first, because it will be a builtin if present.\nif test \"X`( print -r -- -n ) 2>/dev/null`\" = X-n && \\\n   test \"X`print -r -- $ECHO 2>/dev/null`\" = \"X$ECHO\"; then\n  ECHO='print -r --'\nelif test \"X`printf %s $ECHO 2>/dev/null`\" = \"X$ECHO\"; then\n  ECHO='printf %s\\n'\nelse\n  # Use this function as a fallback that always works.\n  func_fallback_echo ()\n  {\n    eval 'cat <<_LTECHO_EOF\n$1\n_LTECHO_EOF'\n  }\n  ECHO='func_fallback_echo'\nfi\n\n# func_echo_all arg...\n# Invoke $ECHO with all args, space-separated.\nfunc_echo_all ()\n{\n    $ECHO \"\"\n}\n\ncase \"$ECHO\" in\n  printf*) { $as_echo \"$as_me:${as_lineno-$LINENO}: result: printf\" >&5\n$as_echo \"printf\" >&6; } ;;\n  print*) { $as_echo \"$as_me:${as_lineno-$LINENO}: result: print -r\" >&5\n$as_echo \"print -r\" >&6; } ;;\n  *) { $as_echo \"$as_me:${as_lineno-$LINENO}: result: cat\" >&5\n$as_echo \"cat\" >&6; } ;;\nesac\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for a sed that does not truncate output\" >&5\n$as_echo_n \"checking for a sed that does not truncate output... \" >&6; }\nif ${ac_cv_path_SED+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n            ac_script=s/aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa/bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb/\n     for ac_i in 1 2 3 4 5 6 7; do\n       ac_script=\"$ac_script$as_nl$ac_script\"\n     done\n     echo \"$ac_script\" 2>/dev/null | sed 99q >conftest.sed\n     { ac_script=; unset ac_script;}\n     if test -z \"$SED\"; then\n  ac_path_SED_found=false\n  # Loop through the user's path and test for each of PROGNAME-LIST\n  as_save_IFS=$IFS; IFS=$PATH_SEPARATOR\nfor as_dir in $PATH\ndo\n  IFS=$as_save_IFS\n  test -z \"$as_dir\" && as_dir=.\n    for ac_prog in sed gsed; do\n    for ac_exec_ext in '' $ac_executable_extensions; do\n      ac_path_SED=\"$as_dir/$ac_prog$ac_exec_ext\"\n      as_fn_executable_p \"$ac_path_SED\" || continue\n# Check for GNU ac_path_SED and select it if it is found.\n  # Check for GNU $ac_path_SED\ncase `\"$ac_path_SED\" --version 2>&1` in\n*GNU*)\n  ac_cv_path_SED=\"$ac_path_SED\" ac_path_SED_found=:;;\n*)\n  ac_count=0\n  $as_echo_n 0123456789 >\"conftest.in\"\n  while :\n  do\n    cat \"conftest.in\" \"conftest.in\" >\"conftest.tmp\"\n    mv \"conftest.tmp\" \"conftest.in\"\n    cp \"conftest.in\" \"conftest.nl\"\n    $as_echo '' >> \"conftest.nl\"\n    \"$ac_path_SED\" -f conftest.sed < \"conftest.nl\" >\"conftest.out\" 2>/dev/null || break\n    diff \"conftest.out\" \"conftest.nl\" >/dev/null 2>&1 || break\n    as_fn_arith $ac_count + 1 && ac_count=$as_val\n    if test $ac_count -gt ${ac_path_SED_max-0}; then\n      # Best one so far, save it but keep looking for a better one\n      ac_cv_path_SED=\"$ac_path_SED\"\n      ac_path_SED_max=$ac_count\n    fi\n    # 10*(2^10) chars as input seems more than enough\n    test $ac_count -gt 10 && break\n  done\n  rm -f conftest.in conftest.tmp conftest.nl conftest.out;;\nesac\n\n      $ac_path_SED_found && break 3\n    done\n  done\n  done\nIFS=$as_save_IFS\n  if test -z \"$ac_cv_path_SED\"; then\n    as_fn_error $? \"no acceptable sed could be found in \\$PATH\" \"$LINENO\" 5\n  fi\nelse\n  ac_cv_path_SED=$SED\nfi\n\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $ac_cv_path_SED\" >&5\n$as_echo \"$ac_cv_path_SED\" >&6; }\n SED=\"$ac_cv_path_SED\"\n  rm -f conftest.sed\n\ntest -z \"$SED\" && SED=sed\nXsed=\"$SED -e 1s/^X//\"\n\n\n\n\n\n\n\n\n\n\n\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for grep that handles long lines and -e\" >&5\n$as_echo_n \"checking for grep that handles long lines and -e... \" >&6; }\nif ${ac_cv_path_GREP+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  if test -z \"$GREP\"; then\n  ac_path_GREP_found=false\n  # Loop through the user's path and test for each of PROGNAME-LIST\n  as_save_IFS=$IFS; IFS=$PATH_SEPARATOR\nfor as_dir in $PATH$PATH_SEPARATOR/usr/xpg4/bin\ndo\n  IFS=$as_save_IFS\n  test -z \"$as_dir\" && as_dir=.\n    for ac_prog in grep ggrep; do\n    for ac_exec_ext in '' $ac_executable_extensions; do\n      ac_path_GREP=\"$as_dir/$ac_prog$ac_exec_ext\"\n      as_fn_executable_p \"$ac_path_GREP\" || continue\n# Check for GNU ac_path_GREP and select it if it is found.\n  # Check for GNU $ac_path_GREP\ncase `\"$ac_path_GREP\" --version 2>&1` in\n*GNU*)\n  ac_cv_path_GREP=\"$ac_path_GREP\" ac_path_GREP_found=:;;\n*)\n  ac_count=0\n  $as_echo_n 0123456789 >\"conftest.in\"\n  while :\n  do\n    cat \"conftest.in\" \"conftest.in\" >\"conftest.tmp\"\n    mv \"conftest.tmp\" \"conftest.in\"\n    cp \"conftest.in\" \"conftest.nl\"\n    $as_echo 'GREP' >> \"conftest.nl\"\n    \"$ac_path_GREP\" -e 'GREP$' -e '-(cannot match)-' < \"conftest.nl\" >\"conftest.out\" 2>/dev/null || break\n    diff \"conftest.out\" \"conftest.nl\" >/dev/null 2>&1 || break\n    as_fn_arith $ac_count + 1 && ac_count=$as_val\n    if test $ac_count -gt ${ac_path_GREP_max-0}; then\n      # Best one so far, save it but keep looking for a better one\n      ac_cv_path_GREP=\"$ac_path_GREP\"\n      ac_path_GREP_max=$ac_count\n    fi\n    # 10*(2^10) chars as input seems more than enough\n    test $ac_count -gt 10 && break\n  done\n  rm -f conftest.in conftest.tmp conftest.nl conftest.out;;\nesac\n\n      $ac_path_GREP_found && break 3\n    done\n  done\n  done\nIFS=$as_save_IFS\n  if test -z \"$ac_cv_path_GREP\"; then\n    as_fn_error $? \"no acceptable grep could be found in $PATH$PATH_SEPARATOR/usr/xpg4/bin\" \"$LINENO\" 5\n  fi\nelse\n  ac_cv_path_GREP=$GREP\nfi\n\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $ac_cv_path_GREP\" >&5\n$as_echo \"$ac_cv_path_GREP\" >&6; }\n GREP=\"$ac_cv_path_GREP\"\n\n\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for egrep\" >&5\n$as_echo_n \"checking for egrep... \" >&6; }\nif ${ac_cv_path_EGREP+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  if echo a | $GREP -E '(a|b)' >/dev/null 2>&1\n   then ac_cv_path_EGREP=\"$GREP -E\"\n   else\n     if test -z \"$EGREP\"; then\n  ac_path_EGREP_found=false\n  # Loop through the user's path and test for each of PROGNAME-LIST\n  as_save_IFS=$IFS; IFS=$PATH_SEPARATOR\nfor as_dir in $PATH$PATH_SEPARATOR/usr/xpg4/bin\ndo\n  IFS=$as_save_IFS\n  test -z \"$as_dir\" && as_dir=.\n    for ac_prog in egrep; do\n    for ac_exec_ext in '' $ac_executable_extensions; do\n      ac_path_EGREP=\"$as_dir/$ac_prog$ac_exec_ext\"\n      as_fn_executable_p \"$ac_path_EGREP\" || continue\n# Check for GNU ac_path_EGREP and select it if it is found.\n  # Check for GNU $ac_path_EGREP\ncase `\"$ac_path_EGREP\" --version 2>&1` in\n*GNU*)\n  ac_cv_path_EGREP=\"$ac_path_EGREP\" ac_path_EGREP_found=:;;\n*)\n  ac_count=0\n  $as_echo_n 0123456789 >\"conftest.in\"\n  while :\n  do\n    cat \"conftest.in\" \"conftest.in\" >\"conftest.tmp\"\n    mv \"conftest.tmp\" \"conftest.in\"\n    cp \"conftest.in\" \"conftest.nl\"\n    $as_echo 'EGREP' >> \"conftest.nl\"\n    \"$ac_path_EGREP\" 'EGREP$' < \"conftest.nl\" >\"conftest.out\" 2>/dev/null || break\n    diff \"conftest.out\" \"conftest.nl\" >/dev/null 2>&1 || break\n    as_fn_arith $ac_count + 1 && ac_count=$as_val\n    if test $ac_count -gt ${ac_path_EGREP_max-0}; then\n      # Best one so far, save it but keep looking for a better one\n      ac_cv_path_EGREP=\"$ac_path_EGREP\"\n      ac_path_EGREP_max=$ac_count\n    fi\n    # 10*(2^10) chars as input seems more than enough\n    test $ac_count -gt 10 && break\n  done\n  rm -f conftest.in conftest.tmp conftest.nl conftest.out;;\nesac\n\n      $ac_path_EGREP_found && break 3\n    done\n  done\n  done\nIFS=$as_save_IFS\n  if test -z \"$ac_cv_path_EGREP\"; then\n    as_fn_error $? \"no acceptable egrep could be found in $PATH$PATH_SEPARATOR/usr/xpg4/bin\" \"$LINENO\" 5\n  fi\nelse\n  ac_cv_path_EGREP=$EGREP\nfi\n\n   fi\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $ac_cv_path_EGREP\" >&5\n$as_echo \"$ac_cv_path_EGREP\" >&6; }\n EGREP=\"$ac_cv_path_EGREP\"\n\n\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for fgrep\" >&5\n$as_echo_n \"checking for fgrep... \" >&6; }\nif ${ac_cv_path_FGREP+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  if echo 'ab*c' | $GREP -F 'ab*c' >/dev/null 2>&1\n   then ac_cv_path_FGREP=\"$GREP -F\"\n   else\n     if test -z \"$FGREP\"; then\n  ac_path_FGREP_found=false\n  # Loop through the user's path and test for each of PROGNAME-LIST\n  as_save_IFS=$IFS; IFS=$PATH_SEPARATOR\nfor as_dir in $PATH$PATH_SEPARATOR/usr/xpg4/bin\ndo\n  IFS=$as_save_IFS\n  test -z \"$as_dir\" && as_dir=.\n    for ac_prog in fgrep; do\n    for ac_exec_ext in '' $ac_executable_extensions; do\n      ac_path_FGREP=\"$as_dir/$ac_prog$ac_exec_ext\"\n      as_fn_executable_p \"$ac_path_FGREP\" || continue\n# Check for GNU ac_path_FGREP and select it if it is found.\n  # Check for GNU $ac_path_FGREP\ncase `\"$ac_path_FGREP\" --version 2>&1` in\n*GNU*)\n  ac_cv_path_FGREP=\"$ac_path_FGREP\" ac_path_FGREP_found=:;;\n*)\n  ac_count=0\n  $as_echo_n 0123456789 >\"conftest.in\"\n  while :\n  do\n    cat \"conftest.in\" \"conftest.in\" >\"conftest.tmp\"\n    mv \"conftest.tmp\" \"conftest.in\"\n    cp \"conftest.in\" \"conftest.nl\"\n    $as_echo 'FGREP' >> \"conftest.nl\"\n    \"$ac_path_FGREP\" FGREP < \"conftest.nl\" >\"conftest.out\" 2>/dev/null || break\n    diff \"conftest.out\" \"conftest.nl\" >/dev/null 2>&1 || break\n    as_fn_arith $ac_count + 1 && ac_count=$as_val\n    if test $ac_count -gt ${ac_path_FGREP_max-0}; then\n      # Best one so far, save it but keep looking for a better one\n      ac_cv_path_FGREP=\"$ac_path_FGREP\"\n      ac_path_FGREP_max=$ac_count\n    fi\n    # 10*(2^10) chars as input seems more than enough\n    test $ac_count -gt 10 && break\n  done\n  rm -f conftest.in conftest.tmp conftest.nl conftest.out;;\nesac\n\n      $ac_path_FGREP_found && break 3\n    done\n  done\n  done\nIFS=$as_save_IFS\n  if test -z \"$ac_cv_path_FGREP\"; then\n    as_fn_error $? \"no acceptable fgrep could be found in $PATH$PATH_SEPARATOR/usr/xpg4/bin\" \"$LINENO\" 5\n  fi\nelse\n  ac_cv_path_FGREP=$FGREP\nfi\n\n   fi\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $ac_cv_path_FGREP\" >&5\n$as_echo \"$ac_cv_path_FGREP\" >&6; }\n FGREP=\"$ac_cv_path_FGREP\"\n\n\ntest -z \"$GREP\" && GREP=grep\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n# Check whether --with-gnu-ld was given.\nif test \"${with_gnu_ld+set}\" = set; then :\n  withval=$with_gnu_ld; test \"$withval\" = no || with_gnu_ld=yes\nelse\n  with_gnu_ld=no\nfi\n\nac_prog=ld\nif test \"$GCC\" = yes; then\n  # Check if gcc -print-prog-name=ld gives a path.\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: checking for ld used by $CC\" >&5\n$as_echo_n \"checking for ld used by $CC... \" >&6; }\n  case $host in\n  *-*-mingw*)\n    # gcc leaves a trailing carriage return which upsets mingw\n    ac_prog=`($CC -print-prog-name=ld) 2>&5 | tr -d '\\015'` ;;\n  *)\n    ac_prog=`($CC -print-prog-name=ld) 2>&5` ;;\n  esac\n  case $ac_prog in\n    # Accept absolute paths.\n    [\\\\/]* | ?:[\\\\/]*)\n      re_direlt='/[^/][^/]*/\\.\\./'\n      # Canonicalize the pathname of ld\n      ac_prog=`$ECHO \"$ac_prog\"| $SED 's%\\\\\\\\%/%g'`\n      while $ECHO \"$ac_prog\" | $GREP \"$re_direlt\" > /dev/null 2>&1; do\n\tac_prog=`$ECHO $ac_prog| $SED \"s%$re_direlt%/%\"`\n      done\n      test -z \"$LD\" && LD=\"$ac_prog\"\n      ;;\n  \"\")\n    # If it fails, then pretend we aren't using GCC.\n    ac_prog=ld\n    ;;\n  *)\n    # If it is relative, then search for the first ld in PATH.\n    with_gnu_ld=unknown\n    ;;\n  esac\nelif test \"$with_gnu_ld\" = yes; then\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: checking for GNU ld\" >&5\n$as_echo_n \"checking for GNU ld... \" >&6; }\nelse\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: checking for non-GNU ld\" >&5\n$as_echo_n \"checking for non-GNU ld... \" >&6; }\nfi\nif ${lt_cv_path_LD+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  if test -z \"$LD\"; then\n  lt_save_ifs=\"$IFS\"; IFS=$PATH_SEPARATOR\n  for ac_dir in $PATH; do\n    IFS=\"$lt_save_ifs\"\n    test -z \"$ac_dir\" && ac_dir=.\n    if test -f \"$ac_dir/$ac_prog\" || test -f \"$ac_dir/$ac_prog$ac_exeext\"; then\n      lt_cv_path_LD=\"$ac_dir/$ac_prog\"\n      # Check to see if the program is GNU ld.  I'd rather use --version,\n      # but apparently some variants of GNU ld only accept -v.\n      # Break only if it was the GNU/non-GNU ld that we prefer.\n      case `\"$lt_cv_path_LD\" -v 2>&1 </dev/null` in\n      *GNU* | *'with BFD'*)\n\ttest \"$with_gnu_ld\" != no && break\n\t;;\n      *)\n\ttest \"$with_gnu_ld\" != yes && break\n\t;;\n      esac\n    fi\n  done\n  IFS=\"$lt_save_ifs\"\nelse\n  lt_cv_path_LD=\"$LD\" # Let the user override the test with a path.\nfi\nfi\n\nLD=\"$lt_cv_path_LD\"\nif test -n \"$LD\"; then\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: $LD\" >&5\n$as_echo \"$LD\" >&6; }\nelse\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: no\" >&5\n$as_echo \"no\" >&6; }\nfi\ntest -z \"$LD\" && as_fn_error $? \"no acceptable ld found in \\$PATH\" \"$LINENO\" 5\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking if the linker ($LD) is GNU ld\" >&5\n$as_echo_n \"checking if the linker ($LD) is GNU ld... \" >&6; }\nif ${lt_cv_prog_gnu_ld+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  # I'd rather use --version here, but apparently some GNU lds only accept -v.\ncase `$LD -v 2>&1 </dev/null` in\n*GNU* | *'with BFD'*)\n  lt_cv_prog_gnu_ld=yes\n  ;;\n*)\n  lt_cv_prog_gnu_ld=no\n  ;;\nesac\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $lt_cv_prog_gnu_ld\" >&5\n$as_echo \"$lt_cv_prog_gnu_ld\" >&6; }\nwith_gnu_ld=$lt_cv_prog_gnu_ld\n\n\n\n\n\n\n\n\n\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for BSD- or MS-compatible name lister (nm)\" >&5\n$as_echo_n \"checking for BSD- or MS-compatible name lister (nm)... \" >&6; }\nif ${lt_cv_path_NM+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  if test -n \"$NM\"; then\n  # Let the user override the test.\n  lt_cv_path_NM=\"$NM\"\nelse\n  lt_nm_to_check=\"${ac_tool_prefix}nm\"\n  if test -n \"$ac_tool_prefix\" && test \"$build\" = \"$host\"; then\n    lt_nm_to_check=\"$lt_nm_to_check nm\"\n  fi\n  for lt_tmp_nm in $lt_nm_to_check; do\n    lt_save_ifs=\"$IFS\"; IFS=$PATH_SEPARATOR\n    for ac_dir in $PATH /usr/ccs/bin/elf /usr/ccs/bin /usr/ucb /bin; do\n      IFS=\"$lt_save_ifs\"\n      test -z \"$ac_dir\" && ac_dir=.\n      tmp_nm=\"$ac_dir/$lt_tmp_nm\"\n      if test -f \"$tmp_nm\" || test -f \"$tmp_nm$ac_exeext\" ; then\n\t# Check to see if the nm accepts a BSD-compat flag.\n\t# Adding the `sed 1q' prevents false positives on HP-UX, which says:\n\t#   nm: unknown option \"B\" ignored\n\t# Tru64's nm complains that /dev/null is an invalid object file\n\tcase `\"$tmp_nm\" -B /dev/null 2>&1 | sed '1q'` in\n\t*/dev/null* | *'Invalid file or object type'*)\n\t  lt_cv_path_NM=\"$tmp_nm -B\"\n\t  break\n\t  ;;\n\t*)\n\t  case `\"$tmp_nm\" -p /dev/null 2>&1 | sed '1q'` in\n\t  */dev/null*)\n\t    lt_cv_path_NM=\"$tmp_nm -p\"\n\t    break\n\t    ;;\n\t  *)\n\t    lt_cv_path_NM=${lt_cv_path_NM=\"$tmp_nm\"} # keep the first match, but\n\t    continue # so that we can try to find one that supports BSD flags\n\t    ;;\n\t  esac\n\t  ;;\n\tesac\n      fi\n    done\n    IFS=\"$lt_save_ifs\"\n  done\n  : ${lt_cv_path_NM=no}\nfi\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $lt_cv_path_NM\" >&5\n$as_echo \"$lt_cv_path_NM\" >&6; }\nif test \"$lt_cv_path_NM\" != \"no\"; then\n  NM=\"$lt_cv_path_NM\"\nelse\n  # Didn't find any BSD compatible name lister, look for dumpbin.\n  if test -n \"$DUMPBIN\"; then :\n    # Let the user override the test.\n  else\n    if test -n \"$ac_tool_prefix\"; then\n  for ac_prog in dumpbin \"link -dump\"\n  do\n    # Extract the first word of \"$ac_tool_prefix$ac_prog\", so it can be a program name with args.\nset dummy $ac_tool_prefix$ac_prog; ac_word=$2\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for $ac_word\" >&5\n$as_echo_n \"checking for $ac_word... \" >&6; }\nif ${ac_cv_prog_DUMPBIN+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  if test -n \"$DUMPBIN\"; then\n  ac_cv_prog_DUMPBIN=\"$DUMPBIN\" # Let the user override the test.\nelse\nas_save_IFS=$IFS; IFS=$PATH_SEPARATOR\nfor as_dir in $PATH\ndo\n  IFS=$as_save_IFS\n  test -z \"$as_dir\" && as_dir=.\n    for ac_exec_ext in '' $ac_executable_extensions; do\n  if as_fn_executable_p \"$as_dir/$ac_word$ac_exec_ext\"; then\n    ac_cv_prog_DUMPBIN=\"$ac_tool_prefix$ac_prog\"\n    $as_echo \"$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext\" >&5\n    break 2\n  fi\ndone\n  done\nIFS=$as_save_IFS\n\nfi\nfi\nDUMPBIN=$ac_cv_prog_DUMPBIN\nif test -n \"$DUMPBIN\"; then\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: $DUMPBIN\" >&5\n$as_echo \"$DUMPBIN\" >&6; }\nelse\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: no\" >&5\n$as_echo \"no\" >&6; }\nfi\n\n\n    test -n \"$DUMPBIN\" && break\n  done\nfi\nif test -z \"$DUMPBIN\"; then\n  ac_ct_DUMPBIN=$DUMPBIN\n  for ac_prog in dumpbin \"link -dump\"\ndo\n  # Extract the first word of \"$ac_prog\", so it can be a program name with args.\nset dummy $ac_prog; ac_word=$2\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for $ac_word\" >&5\n$as_echo_n \"checking for $ac_word... \" >&6; }\nif ${ac_cv_prog_ac_ct_DUMPBIN+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  if test -n \"$ac_ct_DUMPBIN\"; then\n  ac_cv_prog_ac_ct_DUMPBIN=\"$ac_ct_DUMPBIN\" # Let the user override the test.\nelse\nas_save_IFS=$IFS; IFS=$PATH_SEPARATOR\nfor as_dir in $PATH\ndo\n  IFS=$as_save_IFS\n  test -z \"$as_dir\" && as_dir=.\n    for ac_exec_ext in '' $ac_executable_extensions; do\n  if as_fn_executable_p \"$as_dir/$ac_word$ac_exec_ext\"; then\n    ac_cv_prog_ac_ct_DUMPBIN=\"$ac_prog\"\n    $as_echo \"$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext\" >&5\n    break 2\n  fi\ndone\n  done\nIFS=$as_save_IFS\n\nfi\nfi\nac_ct_DUMPBIN=$ac_cv_prog_ac_ct_DUMPBIN\nif test -n \"$ac_ct_DUMPBIN\"; then\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: $ac_ct_DUMPBIN\" >&5\n$as_echo \"$ac_ct_DUMPBIN\" >&6; }\nelse\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: no\" >&5\n$as_echo \"no\" >&6; }\nfi\n\n\n  test -n \"$ac_ct_DUMPBIN\" && break\ndone\n\n  if test \"x$ac_ct_DUMPBIN\" = x; then\n    DUMPBIN=\":\"\n  else\n    case $cross_compiling:$ac_tool_warned in\nyes:)\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet\" >&5\n$as_echo \"$as_me: WARNING: using cross tools not prefixed with host triplet\" >&2;}\nac_tool_warned=yes ;;\nesac\n    DUMPBIN=$ac_ct_DUMPBIN\n  fi\nfi\n\n    case `$DUMPBIN -symbols /dev/null 2>&1 | sed '1q'` in\n    *COFF*)\n      DUMPBIN=\"$DUMPBIN -symbols\"\n      ;;\n    *)\n      DUMPBIN=:\n      ;;\n    esac\n  fi\n\n  if test \"$DUMPBIN\" != \":\"; then\n    NM=\"$DUMPBIN\"\n  fi\nfi\ntest -z \"$NM\" && NM=nm\n\n\n\n\n\n\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking the name lister ($NM) interface\" >&5\n$as_echo_n \"checking the name lister ($NM) interface... \" >&6; }\nif ${lt_cv_nm_interface+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  lt_cv_nm_interface=\"BSD nm\"\n  echo \"int some_variable = 0;\" > conftest.$ac_ext\n  (eval echo \"\\\"\\$as_me:$LINENO: $ac_compile\\\"\" >&5)\n  (eval \"$ac_compile\" 2>conftest.err)\n  cat conftest.err >&5\n  (eval echo \"\\\"\\$as_me:$LINENO: $NM \\\\\\\"conftest.$ac_objext\\\\\\\"\\\"\" >&5)\n  (eval \"$NM \\\"conftest.$ac_objext\\\"\" 2>conftest.err > conftest.out)\n  cat conftest.err >&5\n  (eval echo \"\\\"\\$as_me:$LINENO: output\\\"\" >&5)\n  cat conftest.out >&5\n  if $GREP 'External.*some_variable' conftest.out > /dev/null; then\n    lt_cv_nm_interface=\"MS dumpbin\"\n  fi\n  rm -f conftest*\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $lt_cv_nm_interface\" >&5\n$as_echo \"$lt_cv_nm_interface\" >&6; }\n\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking whether ln -s works\" >&5\n$as_echo_n \"checking whether ln -s works... \" >&6; }\nLN_S=$as_ln_s\nif test \"$LN_S\" = \"ln -s\"; then\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: yes\" >&5\n$as_echo \"yes\" >&6; }\nelse\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: no, using $LN_S\" >&5\n$as_echo \"no, using $LN_S\" >&6; }\nfi\n\n# find the maximum length of command line arguments\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking the maximum length of command line arguments\" >&5\n$as_echo_n \"checking the maximum length of command line arguments... \" >&6; }\nif ${lt_cv_sys_max_cmd_len+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n    i=0\n  teststring=\"ABCD\"\n\n  case $build_os in\n  msdosdjgpp*)\n    # On DJGPP, this test can blow up pretty badly due to problems in libc\n    # (any single argument exceeding 2000 bytes causes a buffer overrun\n    # during glob expansion).  Even if it were fixed, the result of this\n    # check would be larger than it should be.\n    lt_cv_sys_max_cmd_len=12288;    # 12K is about right\n    ;;\n\n  gnu*)\n    # Under GNU Hurd, this test is not required because there is\n    # no limit to the length of command line arguments.\n    # Libtool will interpret -1 as no limit whatsoever\n    lt_cv_sys_max_cmd_len=-1;\n    ;;\n\n  cygwin* | mingw* | cegcc*)\n    # On Win9x/ME, this test blows up -- it succeeds, but takes\n    # about 5 minutes as the teststring grows exponentially.\n    # Worse, since 9x/ME are not pre-emptively multitasking,\n    # you end up with a \"frozen\" computer, even though with patience\n    # the test eventually succeeds (with a max line length of 256k).\n    # Instead, let's just punt: use the minimum linelength reported by\n    # all of the supported platforms: 8192 (on NT/2K/XP).\n    lt_cv_sys_max_cmd_len=8192;\n    ;;\n\n  mint*)\n    # On MiNT this can take a long time and run out of memory.\n    lt_cv_sys_max_cmd_len=8192;\n    ;;\n\n  amigaos*)\n    # On AmigaOS with pdksh, this test takes hours, literally.\n    # So we just punt and use a minimum line length of 8192.\n    lt_cv_sys_max_cmd_len=8192;\n    ;;\n\n  netbsd* | freebsd* | openbsd* | darwin* | dragonfly*)\n    # This has been around since 386BSD, at least.  Likely further.\n    if test -x /sbin/sysctl; then\n      lt_cv_sys_max_cmd_len=`/sbin/sysctl -n kern.argmax`\n    elif test -x /usr/sbin/sysctl; then\n      lt_cv_sys_max_cmd_len=`/usr/sbin/sysctl -n kern.argmax`\n    else\n      lt_cv_sys_max_cmd_len=65536\t# usable default for all BSDs\n    fi\n    # And add a safety zone\n    lt_cv_sys_max_cmd_len=`expr $lt_cv_sys_max_cmd_len \\/ 4`\n    lt_cv_sys_max_cmd_len=`expr $lt_cv_sys_max_cmd_len \\* 3`\n    ;;\n\n  interix*)\n    # We know the value 262144 and hardcode it with a safety zone (like BSD)\n    lt_cv_sys_max_cmd_len=196608\n    ;;\n\n  os2*)\n    # The test takes a long time on OS/2.\n    lt_cv_sys_max_cmd_len=8192\n    ;;\n\n  osf*)\n    # Dr. Hans Ekkehard Plesser reports seeing a kernel panic running configure\n    # due to this test when exec_disable_arg_limit is 1 on Tru64. It is not\n    # nice to cause kernel panics so lets avoid the loop below.\n    # First set a reasonable default.\n    lt_cv_sys_max_cmd_len=16384\n    #\n    if test -x /sbin/sysconfig; then\n      case `/sbin/sysconfig -q proc exec_disable_arg_limit` in\n        *1*) lt_cv_sys_max_cmd_len=-1 ;;\n      esac\n    fi\n    ;;\n  sco3.2v5*)\n    lt_cv_sys_max_cmd_len=102400\n    ;;\n  sysv5* | sco5v6* | sysv4.2uw2*)\n    kargmax=`grep ARG_MAX /etc/conf/cf.d/stune 2>/dev/null`\n    if test -n \"$kargmax\"; then\n      lt_cv_sys_max_cmd_len=`echo $kargmax | sed 's/.*[\t ]//'`\n    else\n      lt_cv_sys_max_cmd_len=32768\n    fi\n    ;;\n  *)\n    lt_cv_sys_max_cmd_len=`(getconf ARG_MAX) 2> /dev/null`\n    if test -n \"$lt_cv_sys_max_cmd_len\" && \\\n\ttest undefined != \"$lt_cv_sys_max_cmd_len\"; then\n      lt_cv_sys_max_cmd_len=`expr $lt_cv_sys_max_cmd_len \\/ 4`\n      lt_cv_sys_max_cmd_len=`expr $lt_cv_sys_max_cmd_len \\* 3`\n    else\n      # Make teststring a little bigger before we do anything with it.\n      # a 1K string should be a reasonable start.\n      for i in 1 2 3 4 5 6 7 8 ; do\n        teststring=$teststring$teststring\n      done\n      SHELL=${SHELL-${CONFIG_SHELL-/bin/sh}}\n      # If test is not a shell built-in, we'll probably end up computing a\n      # maximum length that is only half of the actual maximum length, but\n      # we can't tell.\n      while { test \"X\"`env echo \"$teststring$teststring\" 2>/dev/null` \\\n\t         = \"X$teststring$teststring\"; } >/dev/null 2>&1 &&\n\t      test $i != 17 # 1/2 MB should be enough\n      do\n        i=`expr $i + 1`\n        teststring=$teststring$teststring\n      done\n      # Only check the string length outside the loop.\n      lt_cv_sys_max_cmd_len=`expr \"X$teststring\" : \".*\" 2>&1`\n      teststring=\n      # Add a significant safety factor because C++ compilers can tack on\n      # massive amounts of additional arguments before passing them to the\n      # linker.  It appears as though 1/2 is a usable value.\n      lt_cv_sys_max_cmd_len=`expr $lt_cv_sys_max_cmd_len \\/ 2`\n    fi\n    ;;\n  esac\n\nfi\n\nif test -n $lt_cv_sys_max_cmd_len ; then\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: $lt_cv_sys_max_cmd_len\" >&5\n$as_echo \"$lt_cv_sys_max_cmd_len\" >&6; }\nelse\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: none\" >&5\n$as_echo \"none\" >&6; }\nfi\nmax_cmd_len=$lt_cv_sys_max_cmd_len\n\n\n\n\n\n\n: ${CP=\"cp -f\"}\n: ${MV=\"mv -f\"}\n: ${RM=\"rm -f\"}\n\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking whether the shell understands some XSI constructs\" >&5\n$as_echo_n \"checking whether the shell understands some XSI constructs... \" >&6; }\n# Try some XSI features\nxsi_shell=no\n( _lt_dummy=\"a/b/c\"\n  test \"${_lt_dummy##*/},${_lt_dummy%/*},${_lt_dummy#??}\"${_lt_dummy%\"$_lt_dummy\"}, \\\n      = c,a/b,b/c, \\\n    && eval 'test $(( 1 + 1 )) -eq 2 \\\n    && test \"${#_lt_dummy}\" -eq 5' ) >/dev/null 2>&1 \\\n  && xsi_shell=yes\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $xsi_shell\" >&5\n$as_echo \"$xsi_shell\" >&6; }\n\n\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking whether the shell understands \\\"+=\\\"\" >&5\n$as_echo_n \"checking whether the shell understands \\\"+=\\\"... \" >&6; }\nlt_shell_append=no\n( foo=bar; set foo baz; eval \"$1+=\\$2\" && test \"$foo\" = barbaz ) \\\n    >/dev/null 2>&1 \\\n  && lt_shell_append=yes\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $lt_shell_append\" >&5\n$as_echo \"$lt_shell_append\" >&6; }\n\n\nif ( (MAIL=60; unset MAIL) || exit) >/dev/null 2>&1; then\n  lt_unset=unset\nelse\n  lt_unset=false\nfi\n\n\n\n\n\n# test EBCDIC or ASCII\ncase `echo X|tr X '\\101'` in\n A) # ASCII based system\n    # \\n is not interpreted correctly by Solaris 8 /usr/ucb/tr\n  lt_SP2NL='tr \\040 \\012'\n  lt_NL2SP='tr \\015\\012 \\040\\040'\n  ;;\n *) # EBCDIC based system\n  lt_SP2NL='tr \\100 \\n'\n  lt_NL2SP='tr \\r\\n \\100\\100'\n  ;;\nesac\n\n\n\n\n\n\n\n\n\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking how to convert $build file names to $host format\" >&5\n$as_echo_n \"checking how to convert $build file names to $host format... \" >&6; }\nif ${lt_cv_to_host_file_cmd+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  case $host in\n  *-*-mingw* )\n    case $build in\n      *-*-mingw* ) # actually msys\n        lt_cv_to_host_file_cmd=func_convert_file_msys_to_w32\n        ;;\n      *-*-cygwin* )\n        lt_cv_to_host_file_cmd=func_convert_file_cygwin_to_w32\n        ;;\n      * ) # otherwise, assume *nix\n        lt_cv_to_host_file_cmd=func_convert_file_nix_to_w32\n        ;;\n    esac\n    ;;\n  *-*-cygwin* )\n    case $build in\n      *-*-mingw* ) # actually msys\n        lt_cv_to_host_file_cmd=func_convert_file_msys_to_cygwin\n        ;;\n      *-*-cygwin* )\n        lt_cv_to_host_file_cmd=func_convert_file_noop\n        ;;\n      * ) # otherwise, assume *nix\n        lt_cv_to_host_file_cmd=func_convert_file_nix_to_cygwin\n        ;;\n    esac\n    ;;\n  * ) # unhandled hosts (and \"normal\" native builds)\n    lt_cv_to_host_file_cmd=func_convert_file_noop\n    ;;\nesac\n\nfi\n\nto_host_file_cmd=$lt_cv_to_host_file_cmd\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $lt_cv_to_host_file_cmd\" >&5\n$as_echo \"$lt_cv_to_host_file_cmd\" >&6; }\n\n\n\n\n\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking how to convert $build file names to toolchain format\" >&5\n$as_echo_n \"checking how to convert $build file names to toolchain format... \" >&6; }\nif ${lt_cv_to_tool_file_cmd+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  #assume ordinary cross tools, or native build.\nlt_cv_to_tool_file_cmd=func_convert_file_noop\ncase $host in\n  *-*-mingw* )\n    case $build in\n      *-*-mingw* ) # actually msys\n        lt_cv_to_tool_file_cmd=func_convert_file_msys_to_w32\n        ;;\n    esac\n    ;;\nesac\n\nfi\n\nto_tool_file_cmd=$lt_cv_to_tool_file_cmd\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $lt_cv_to_tool_file_cmd\" >&5\n$as_echo \"$lt_cv_to_tool_file_cmd\" >&6; }\n\n\n\n\n\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for $LD option to reload object files\" >&5\n$as_echo_n \"checking for $LD option to reload object files... \" >&6; }\nif ${lt_cv_ld_reload_flag+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  lt_cv_ld_reload_flag='-r'\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $lt_cv_ld_reload_flag\" >&5\n$as_echo \"$lt_cv_ld_reload_flag\" >&6; }\nreload_flag=$lt_cv_ld_reload_flag\ncase $reload_flag in\n\"\" | \" \"*) ;;\n*) reload_flag=\" $reload_flag\" ;;\nesac\nreload_cmds='$LD$reload_flag -o $output$reload_objs'\ncase $host_os in\n  cygwin* | mingw* | pw32* | cegcc*)\n    if test \"$GCC\" != yes; then\n      reload_cmds=false\n    fi\n    ;;\n  darwin*)\n    if test \"$GCC\" = yes; then\n      reload_cmds='$LTCC $LTCFLAGS -nostdlib ${wl}-r -o $output$reload_objs'\n    else\n      reload_cmds='$LD$reload_flag -o $output$reload_objs'\n    fi\n    ;;\nesac\n\n\n\n\n\n\n\n\n\nif test -n \"$ac_tool_prefix\"; then\n  # Extract the first word of \"${ac_tool_prefix}objdump\", so it can be a program name with args.\nset dummy ${ac_tool_prefix}objdump; ac_word=$2\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for $ac_word\" >&5\n$as_echo_n \"checking for $ac_word... \" >&6; }\nif ${ac_cv_prog_OBJDUMP+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  if test -n \"$OBJDUMP\"; then\n  ac_cv_prog_OBJDUMP=\"$OBJDUMP\" # Let the user override the test.\nelse\nas_save_IFS=$IFS; IFS=$PATH_SEPARATOR\nfor as_dir in $PATH\ndo\n  IFS=$as_save_IFS\n  test -z \"$as_dir\" && as_dir=.\n    for ac_exec_ext in '' $ac_executable_extensions; do\n  if as_fn_executable_p \"$as_dir/$ac_word$ac_exec_ext\"; then\n    ac_cv_prog_OBJDUMP=\"${ac_tool_prefix}objdump\"\n    $as_echo \"$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext\" >&5\n    break 2\n  fi\ndone\n  done\nIFS=$as_save_IFS\n\nfi\nfi\nOBJDUMP=$ac_cv_prog_OBJDUMP\nif test -n \"$OBJDUMP\"; then\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: $OBJDUMP\" >&5\n$as_echo \"$OBJDUMP\" >&6; }\nelse\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: no\" >&5\n$as_echo \"no\" >&6; }\nfi\n\n\nfi\nif test -z \"$ac_cv_prog_OBJDUMP\"; then\n  ac_ct_OBJDUMP=$OBJDUMP\n  # Extract the first word of \"objdump\", so it can be a program name with args.\nset dummy objdump; ac_word=$2\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for $ac_word\" >&5\n$as_echo_n \"checking for $ac_word... \" >&6; }\nif ${ac_cv_prog_ac_ct_OBJDUMP+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  if test -n \"$ac_ct_OBJDUMP\"; then\n  ac_cv_prog_ac_ct_OBJDUMP=\"$ac_ct_OBJDUMP\" # Let the user override the test.\nelse\nas_save_IFS=$IFS; IFS=$PATH_SEPARATOR\nfor as_dir in $PATH\ndo\n  IFS=$as_save_IFS\n  test -z \"$as_dir\" && as_dir=.\n    for ac_exec_ext in '' $ac_executable_extensions; do\n  if as_fn_executable_p \"$as_dir/$ac_word$ac_exec_ext\"; then\n    ac_cv_prog_ac_ct_OBJDUMP=\"objdump\"\n    $as_echo \"$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext\" >&5\n    break 2\n  fi\ndone\n  done\nIFS=$as_save_IFS\n\nfi\nfi\nac_ct_OBJDUMP=$ac_cv_prog_ac_ct_OBJDUMP\nif test -n \"$ac_ct_OBJDUMP\"; then\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: $ac_ct_OBJDUMP\" >&5\n$as_echo \"$ac_ct_OBJDUMP\" >&6; }\nelse\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: no\" >&5\n$as_echo \"no\" >&6; }\nfi\n\n  if test \"x$ac_ct_OBJDUMP\" = x; then\n    OBJDUMP=\"false\"\n  else\n    case $cross_compiling:$ac_tool_warned in\nyes:)\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet\" >&5\n$as_echo \"$as_me: WARNING: using cross tools not prefixed with host triplet\" >&2;}\nac_tool_warned=yes ;;\nesac\n    OBJDUMP=$ac_ct_OBJDUMP\n  fi\nelse\n  OBJDUMP=\"$ac_cv_prog_OBJDUMP\"\nfi\n\ntest -z \"$OBJDUMP\" && OBJDUMP=objdump\n\n\n\n\n\n\n\n\n\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking how to recognize dependent libraries\" >&5\n$as_echo_n \"checking how to recognize dependent libraries... \" >&6; }\nif ${lt_cv_deplibs_check_method+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  lt_cv_file_magic_cmd='$MAGIC_CMD'\nlt_cv_file_magic_test_file=\nlt_cv_deplibs_check_method='unknown'\n# Need to set the preceding variable on all platforms that support\n# interlibrary dependencies.\n# 'none' -- dependencies not supported.\n# `unknown' -- same as none, but documents that we really don't know.\n# 'pass_all' -- all dependencies passed with no checks.\n# 'test_compile' -- check by making test program.\n# 'file_magic [[regex]]' -- check by looking for files in library path\n# which responds to the $file_magic_cmd with a given extended regex.\n# If you have `file' or equivalent on your system and you're not sure\n# whether `pass_all' will *always* work, you probably want this one.\n\ncase $host_os in\naix[4-9]*)\n  lt_cv_deplibs_check_method=pass_all\n  ;;\n\nbeos*)\n  lt_cv_deplibs_check_method=pass_all\n  ;;\n\nbsdi[45]*)\n  lt_cv_deplibs_check_method='file_magic ELF [0-9][0-9]*-bit [ML]SB (shared object|dynamic lib)'\n  lt_cv_file_magic_cmd='/usr/bin/file -L'\n  lt_cv_file_magic_test_file=/shlib/libc.so\n  ;;\n\ncygwin*)\n  # func_win32_libid is a shell function defined in ltmain.sh\n  lt_cv_deplibs_check_method='file_magic ^x86 archive import|^x86 DLL'\n  lt_cv_file_magic_cmd='func_win32_libid'\n  ;;\n\nmingw* | pw32*)\n  # Base MSYS/MinGW do not provide the 'file' command needed by\n  # func_win32_libid shell function, so use a weaker test based on 'objdump',\n  # unless we find 'file', for example because we are cross-compiling.\n  # func_win32_libid assumes BSD nm, so disallow it if using MS dumpbin.\n  if ( test \"$lt_cv_nm_interface\" = \"BSD nm\" && file / ) >/dev/null 2>&1; then\n    lt_cv_deplibs_check_method='file_magic ^x86 archive import|^x86 DLL'\n    lt_cv_file_magic_cmd='func_win32_libid'\n  else\n    # Keep this pattern in sync with the one in func_win32_libid.\n    lt_cv_deplibs_check_method='file_magic file format (pei*-i386(.*architecture: i386)?|pe-arm-wince|pe-x86-64)'\n    lt_cv_file_magic_cmd='$OBJDUMP -f'\n  fi\n  ;;\n\ncegcc*)\n  # use the weaker test based on 'objdump'. See mingw*.\n  lt_cv_deplibs_check_method='file_magic file format pe-arm-.*little(.*architecture: arm)?'\n  lt_cv_file_magic_cmd='$OBJDUMP -f'\n  ;;\n\ndarwin* | rhapsody*)\n  lt_cv_deplibs_check_method=pass_all\n  ;;\n\nfreebsd* | dragonfly*)\n  if echo __ELF__ | $CC -E - | $GREP __ELF__ > /dev/null; then\n    case $host_cpu in\n    i*86 )\n      # Not sure whether the presence of OpenBSD here was a mistake.\n      # Let's accept both of them until this is cleared up.\n      lt_cv_deplibs_check_method='file_magic (FreeBSD|OpenBSD|DragonFly)/i[3-9]86 (compact )?demand paged shared library'\n      lt_cv_file_magic_cmd=/usr/bin/file\n      lt_cv_file_magic_test_file=`echo /usr/lib/libc.so.*`\n      ;;\n    esac\n  else\n    lt_cv_deplibs_check_method=pass_all\n  fi\n  ;;\n\nhaiku*)\n  lt_cv_deplibs_check_method=pass_all\n  ;;\n\nhpux10.20* | hpux11*)\n  lt_cv_file_magic_cmd=/usr/bin/file\n  case $host_cpu in\n  ia64*)\n    lt_cv_deplibs_check_method='file_magic (s[0-9][0-9][0-9]|ELF-[0-9][0-9]) shared object file - IA64'\n    lt_cv_file_magic_test_file=/usr/lib/hpux32/libc.so\n    ;;\n  hppa*64*)\n    lt_cv_deplibs_check_method='file_magic (s[0-9][0-9][0-9]|ELF[ -][0-9][0-9])(-bit)?( [LM]SB)? shared object( file)?[, -]* PA-RISC [0-9]\\.[0-9]'\n    lt_cv_file_magic_test_file=/usr/lib/pa20_64/libc.sl\n    ;;\n  *)\n    lt_cv_deplibs_check_method='file_magic (s[0-9][0-9][0-9]|PA-RISC[0-9]\\.[0-9]) shared library'\n    lt_cv_file_magic_test_file=/usr/lib/libc.sl\n    ;;\n  esac\n  ;;\n\ninterix[3-9]*)\n  # PIC code is broken on Interix 3.x, that's why |\\.a not |_pic\\.a here\n  lt_cv_deplibs_check_method='match_pattern /lib[^/]+(\\.so|\\.a)$'\n  ;;\n\nirix5* | irix6* | nonstopux*)\n  case $LD in\n  *-32|*\"-32 \") libmagic=32-bit;;\n  *-n32|*\"-n32 \") libmagic=N32;;\n  *-64|*\"-64 \") libmagic=64-bit;;\n  *) libmagic=never-match;;\n  esac\n  lt_cv_deplibs_check_method=pass_all\n  ;;\n\n# This must be glibc/ELF.\nlinux* | k*bsd*-gnu | kopensolaris*-gnu | gnu*)\n  lt_cv_deplibs_check_method=pass_all\n  ;;\n\nnetbsd* | netbsdelf*-gnu)\n  if echo __ELF__ | $CC -E - | $GREP __ELF__ > /dev/null; then\n    lt_cv_deplibs_check_method='match_pattern /lib[^/]+(\\.so\\.[0-9]+\\.[0-9]+|_pic\\.a)$'\n  else\n    lt_cv_deplibs_check_method='match_pattern /lib[^/]+(\\.so|_pic\\.a)$'\n  fi\n  ;;\n\nnewos6*)\n  lt_cv_deplibs_check_method='file_magic ELF [0-9][0-9]*-bit [ML]SB (executable|dynamic lib)'\n  lt_cv_file_magic_cmd=/usr/bin/file\n  lt_cv_file_magic_test_file=/usr/lib/libnls.so\n  ;;\n\n*nto* | *qnx*)\n  lt_cv_deplibs_check_method=pass_all\n  ;;\n\nopenbsd*)\n  if test -z \"`echo __ELF__ | $CC -E - | $GREP __ELF__`\" || test \"$host_os-$host_cpu\" = \"openbsd2.8-powerpc\"; then\n    lt_cv_deplibs_check_method='match_pattern /lib[^/]+(\\.so\\.[0-9]+\\.[0-9]+|\\.so|_pic\\.a)$'\n  else\n    lt_cv_deplibs_check_method='match_pattern /lib[^/]+(\\.so\\.[0-9]+\\.[0-9]+|_pic\\.a)$'\n  fi\n  ;;\n\nosf3* | osf4* | osf5*)\n  lt_cv_deplibs_check_method=pass_all\n  ;;\n\nrdos*)\n  lt_cv_deplibs_check_method=pass_all\n  ;;\n\nsolaris*)\n  lt_cv_deplibs_check_method=pass_all\n  ;;\n\nsysv5* | sco3.2v5* | sco5v6* | unixware* | OpenUNIX* | sysv4*uw2*)\n  lt_cv_deplibs_check_method=pass_all\n  ;;\n\nsysv4 | sysv4.3*)\n  case $host_vendor in\n  motorola)\n    lt_cv_deplibs_check_method='file_magic ELF [0-9][0-9]*-bit [ML]SB (shared object|dynamic lib) M[0-9][0-9]* Version [0-9]'\n    lt_cv_file_magic_test_file=`echo /usr/lib/libc.so*`\n    ;;\n  ncr)\n    lt_cv_deplibs_check_method=pass_all\n    ;;\n  sequent)\n    lt_cv_file_magic_cmd='/bin/file'\n    lt_cv_deplibs_check_method='file_magic ELF [0-9][0-9]*-bit [LM]SB (shared object|dynamic lib )'\n    ;;\n  sni)\n    lt_cv_file_magic_cmd='/bin/file'\n    lt_cv_deplibs_check_method=\"file_magic ELF [0-9][0-9]*-bit [LM]SB dynamic lib\"\n    lt_cv_file_magic_test_file=/lib/libc.so\n    ;;\n  siemens)\n    lt_cv_deplibs_check_method=pass_all\n    ;;\n  pc)\n    lt_cv_deplibs_check_method=pass_all\n    ;;\n  esac\n  ;;\n\ntpf*)\n  lt_cv_deplibs_check_method=pass_all\n  ;;\nesac\n\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $lt_cv_deplibs_check_method\" >&5\n$as_echo \"$lt_cv_deplibs_check_method\" >&6; }\n\nfile_magic_glob=\nwant_nocaseglob=no\nif test \"$build\" = \"$host\"; then\n  case $host_os in\n  mingw* | pw32*)\n    if ( shopt | grep nocaseglob ) >/dev/null 2>&1; then\n      want_nocaseglob=yes\n    else\n      file_magic_glob=`echo aAbBcCdDeEfFgGhHiIjJkKlLmMnNoOpPqQrRsStTuUvVwWxXyYzZ | $SED -e \"s/\\(..\\)/s\\/[\\1]\\/[\\1]\\/g;/g\"`\n    fi\n    ;;\n  esac\nfi\n\nfile_magic_cmd=$lt_cv_file_magic_cmd\ndeplibs_check_method=$lt_cv_deplibs_check_method\ntest -z \"$deplibs_check_method\" && deplibs_check_method=unknown\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\nif test -n \"$ac_tool_prefix\"; then\n  # Extract the first word of \"${ac_tool_prefix}dlltool\", so it can be a program name with args.\nset dummy ${ac_tool_prefix}dlltool; ac_word=$2\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for $ac_word\" >&5\n$as_echo_n \"checking for $ac_word... \" >&6; }\nif ${ac_cv_prog_DLLTOOL+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  if test -n \"$DLLTOOL\"; then\n  ac_cv_prog_DLLTOOL=\"$DLLTOOL\" # Let the user override the test.\nelse\nas_save_IFS=$IFS; IFS=$PATH_SEPARATOR\nfor as_dir in $PATH\ndo\n  IFS=$as_save_IFS\n  test -z \"$as_dir\" && as_dir=.\n    for ac_exec_ext in '' $ac_executable_extensions; do\n  if as_fn_executable_p \"$as_dir/$ac_word$ac_exec_ext\"; then\n    ac_cv_prog_DLLTOOL=\"${ac_tool_prefix}dlltool\"\n    $as_echo \"$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext\" >&5\n    break 2\n  fi\ndone\n  done\nIFS=$as_save_IFS\n\nfi\nfi\nDLLTOOL=$ac_cv_prog_DLLTOOL\nif test -n \"$DLLTOOL\"; then\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: $DLLTOOL\" >&5\n$as_echo \"$DLLTOOL\" >&6; }\nelse\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: no\" >&5\n$as_echo \"no\" >&6; }\nfi\n\n\nfi\nif test -z \"$ac_cv_prog_DLLTOOL\"; then\n  ac_ct_DLLTOOL=$DLLTOOL\n  # Extract the first word of \"dlltool\", so it can be a program name with args.\nset dummy dlltool; ac_word=$2\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for $ac_word\" >&5\n$as_echo_n \"checking for $ac_word... \" >&6; }\nif ${ac_cv_prog_ac_ct_DLLTOOL+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  if test -n \"$ac_ct_DLLTOOL\"; then\n  ac_cv_prog_ac_ct_DLLTOOL=\"$ac_ct_DLLTOOL\" # Let the user override the test.\nelse\nas_save_IFS=$IFS; IFS=$PATH_SEPARATOR\nfor as_dir in $PATH\ndo\n  IFS=$as_save_IFS\n  test -z \"$as_dir\" && as_dir=.\n    for ac_exec_ext in '' $ac_executable_extensions; do\n  if as_fn_executable_p \"$as_dir/$ac_word$ac_exec_ext\"; then\n    ac_cv_prog_ac_ct_DLLTOOL=\"dlltool\"\n    $as_echo \"$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext\" >&5\n    break 2\n  fi\ndone\n  done\nIFS=$as_save_IFS\n\nfi\nfi\nac_ct_DLLTOOL=$ac_cv_prog_ac_ct_DLLTOOL\nif test -n \"$ac_ct_DLLTOOL\"; then\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: $ac_ct_DLLTOOL\" >&5\n$as_echo \"$ac_ct_DLLTOOL\" >&6; }\nelse\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: no\" >&5\n$as_echo \"no\" >&6; }\nfi\n\n  if test \"x$ac_ct_DLLTOOL\" = x; then\n    DLLTOOL=\"false\"\n  else\n    case $cross_compiling:$ac_tool_warned in\nyes:)\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet\" >&5\n$as_echo \"$as_me: WARNING: using cross tools not prefixed with host triplet\" >&2;}\nac_tool_warned=yes ;;\nesac\n    DLLTOOL=$ac_ct_DLLTOOL\n  fi\nelse\n  DLLTOOL=\"$ac_cv_prog_DLLTOOL\"\nfi\n\ntest -z \"$DLLTOOL\" && DLLTOOL=dlltool\n\n\n\n\n\n\n\n\n\n\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking how to associate runtime and link libraries\" >&5\n$as_echo_n \"checking how to associate runtime and link libraries... \" >&6; }\nif ${lt_cv_sharedlib_from_linklib_cmd+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  lt_cv_sharedlib_from_linklib_cmd='unknown'\n\ncase $host_os in\ncygwin* | mingw* | pw32* | cegcc*)\n  # two different shell functions defined in ltmain.sh\n  # decide which to use based on capabilities of $DLLTOOL\n  case `$DLLTOOL --help 2>&1` in\n  *--identify-strict*)\n    lt_cv_sharedlib_from_linklib_cmd=func_cygming_dll_for_implib\n    ;;\n  *)\n    lt_cv_sharedlib_from_linklib_cmd=func_cygming_dll_for_implib_fallback\n    ;;\n  esac\n  ;;\n*)\n  # fallback: assume linklib IS sharedlib\n  lt_cv_sharedlib_from_linklib_cmd=\"$ECHO\"\n  ;;\nesac\n\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $lt_cv_sharedlib_from_linklib_cmd\" >&5\n$as_echo \"$lt_cv_sharedlib_from_linklib_cmd\" >&6; }\nsharedlib_from_linklib_cmd=$lt_cv_sharedlib_from_linklib_cmd\ntest -z \"$sharedlib_from_linklib_cmd\" && sharedlib_from_linklib_cmd=$ECHO\n\n\n\n\n\n\n\nif test -n \"$ac_tool_prefix\"; then\n  for ac_prog in ar\n  do\n    # Extract the first word of \"$ac_tool_prefix$ac_prog\", so it can be a program name with args.\nset dummy $ac_tool_prefix$ac_prog; ac_word=$2\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for $ac_word\" >&5\n$as_echo_n \"checking for $ac_word... \" >&6; }\nif ${ac_cv_prog_AR+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  if test -n \"$AR\"; then\n  ac_cv_prog_AR=\"$AR\" # Let the user override the test.\nelse\nas_save_IFS=$IFS; IFS=$PATH_SEPARATOR\nfor as_dir in $PATH\ndo\n  IFS=$as_save_IFS\n  test -z \"$as_dir\" && as_dir=.\n    for ac_exec_ext in '' $ac_executable_extensions; do\n  if as_fn_executable_p \"$as_dir/$ac_word$ac_exec_ext\"; then\n    ac_cv_prog_AR=\"$ac_tool_prefix$ac_prog\"\n    $as_echo \"$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext\" >&5\n    break 2\n  fi\ndone\n  done\nIFS=$as_save_IFS\n\nfi\nfi\nAR=$ac_cv_prog_AR\nif test -n \"$AR\"; then\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: $AR\" >&5\n$as_echo \"$AR\" >&6; }\nelse\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: no\" >&5\n$as_echo \"no\" >&6; }\nfi\n\n\n    test -n \"$AR\" && break\n  done\nfi\nif test -z \"$AR\"; then\n  ac_ct_AR=$AR\n  for ac_prog in ar\ndo\n  # Extract the first word of \"$ac_prog\", so it can be a program name with args.\nset dummy $ac_prog; ac_word=$2\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for $ac_word\" >&5\n$as_echo_n \"checking for $ac_word... \" >&6; }\nif ${ac_cv_prog_ac_ct_AR+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  if test -n \"$ac_ct_AR\"; then\n  ac_cv_prog_ac_ct_AR=\"$ac_ct_AR\" # Let the user override the test.\nelse\nas_save_IFS=$IFS; IFS=$PATH_SEPARATOR\nfor as_dir in $PATH\ndo\n  IFS=$as_save_IFS\n  test -z \"$as_dir\" && as_dir=.\n    for ac_exec_ext in '' $ac_executable_extensions; do\n  if as_fn_executable_p \"$as_dir/$ac_word$ac_exec_ext\"; then\n    ac_cv_prog_ac_ct_AR=\"$ac_prog\"\n    $as_echo \"$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext\" >&5\n    break 2\n  fi\ndone\n  done\nIFS=$as_save_IFS\n\nfi\nfi\nac_ct_AR=$ac_cv_prog_ac_ct_AR\nif test -n \"$ac_ct_AR\"; then\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: $ac_ct_AR\" >&5\n$as_echo \"$ac_ct_AR\" >&6; }\nelse\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: no\" >&5\n$as_echo \"no\" >&6; }\nfi\n\n\n  test -n \"$ac_ct_AR\" && break\ndone\n\n  if test \"x$ac_ct_AR\" = x; then\n    AR=\"false\"\n  else\n    case $cross_compiling:$ac_tool_warned in\nyes:)\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet\" >&5\n$as_echo \"$as_me: WARNING: using cross tools not prefixed with host triplet\" >&2;}\nac_tool_warned=yes ;;\nesac\n    AR=$ac_ct_AR\n  fi\nfi\n\n: ${AR=ar}\n: ${AR_FLAGS=cru}\n\n\n\n\n\n\n\n\n\n\n\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for archiver @FILE support\" >&5\n$as_echo_n \"checking for archiver @FILE support... \" >&6; }\nif ${lt_cv_ar_at_file+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  lt_cv_ar_at_file=no\n   cat confdefs.h - <<_ACEOF >conftest.$ac_ext\n/* end confdefs.h.  */\n\nint\nmain ()\n{\n\n  ;\n  return 0;\n}\n_ACEOF\nif ac_fn_c_try_compile \"$LINENO\"; then :\n  echo conftest.$ac_objext > conftest.lst\n      lt_ar_try='$AR $AR_FLAGS libconftest.a @conftest.lst >&5'\n      { { eval echo \"\\\"\\$as_me\\\":${as_lineno-$LINENO}: \\\"$lt_ar_try\\\"\"; } >&5\n  (eval $lt_ar_try) 2>&5\n  ac_status=$?\n  $as_echo \"$as_me:${as_lineno-$LINENO}: \\$? = $ac_status\" >&5\n  test $ac_status = 0; }\n      if test \"$ac_status\" -eq 0; then\n\t# Ensure the archiver fails upon bogus file names.\n\trm -f conftest.$ac_objext libconftest.a\n\t{ { eval echo \"\\\"\\$as_me\\\":${as_lineno-$LINENO}: \\\"$lt_ar_try\\\"\"; } >&5\n  (eval $lt_ar_try) 2>&5\n  ac_status=$?\n  $as_echo \"$as_me:${as_lineno-$LINENO}: \\$? = $ac_status\" >&5\n  test $ac_status = 0; }\n\tif test \"$ac_status\" -ne 0; then\n          lt_cv_ar_at_file=@\n        fi\n      fi\n      rm -f conftest.* libconftest.a\n\nfi\nrm -f core conftest.err conftest.$ac_objext conftest.$ac_ext\n\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $lt_cv_ar_at_file\" >&5\n$as_echo \"$lt_cv_ar_at_file\" >&6; }\n\nif test \"x$lt_cv_ar_at_file\" = xno; then\n  archiver_list_spec=\nelse\n  archiver_list_spec=$lt_cv_ar_at_file\nfi\n\n\n\n\n\n\n\nif test -n \"$ac_tool_prefix\"; then\n  # Extract the first word of \"${ac_tool_prefix}strip\", so it can be a program name with args.\nset dummy ${ac_tool_prefix}strip; ac_word=$2\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for $ac_word\" >&5\n$as_echo_n \"checking for $ac_word... \" >&6; }\nif ${ac_cv_prog_STRIP+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  if test -n \"$STRIP\"; then\n  ac_cv_prog_STRIP=\"$STRIP\" # Let the user override the test.\nelse\nas_save_IFS=$IFS; IFS=$PATH_SEPARATOR\nfor as_dir in $PATH\ndo\n  IFS=$as_save_IFS\n  test -z \"$as_dir\" && as_dir=.\n    for ac_exec_ext in '' $ac_executable_extensions; do\n  if as_fn_executable_p \"$as_dir/$ac_word$ac_exec_ext\"; then\n    ac_cv_prog_STRIP=\"${ac_tool_prefix}strip\"\n    $as_echo \"$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext\" >&5\n    break 2\n  fi\ndone\n  done\nIFS=$as_save_IFS\n\nfi\nfi\nSTRIP=$ac_cv_prog_STRIP\nif test -n \"$STRIP\"; then\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: $STRIP\" >&5\n$as_echo \"$STRIP\" >&6; }\nelse\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: no\" >&5\n$as_echo \"no\" >&6; }\nfi\n\n\nfi\nif test -z \"$ac_cv_prog_STRIP\"; then\n  ac_ct_STRIP=$STRIP\n  # Extract the first word of \"strip\", so it can be a program name with args.\nset dummy strip; ac_word=$2\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for $ac_word\" >&5\n$as_echo_n \"checking for $ac_word... \" >&6; }\nif ${ac_cv_prog_ac_ct_STRIP+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  if test -n \"$ac_ct_STRIP\"; then\n  ac_cv_prog_ac_ct_STRIP=\"$ac_ct_STRIP\" # Let the user override the test.\nelse\nas_save_IFS=$IFS; IFS=$PATH_SEPARATOR\nfor as_dir in $PATH\ndo\n  IFS=$as_save_IFS\n  test -z \"$as_dir\" && as_dir=.\n    for ac_exec_ext in '' $ac_executable_extensions; do\n  if as_fn_executable_p \"$as_dir/$ac_word$ac_exec_ext\"; then\n    ac_cv_prog_ac_ct_STRIP=\"strip\"\n    $as_echo \"$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext\" >&5\n    break 2\n  fi\ndone\n  done\nIFS=$as_save_IFS\n\nfi\nfi\nac_ct_STRIP=$ac_cv_prog_ac_ct_STRIP\nif test -n \"$ac_ct_STRIP\"; then\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: $ac_ct_STRIP\" >&5\n$as_echo \"$ac_ct_STRIP\" >&6; }\nelse\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: no\" >&5\n$as_echo \"no\" >&6; }\nfi\n\n  if test \"x$ac_ct_STRIP\" = x; then\n    STRIP=\":\"\n  else\n    case $cross_compiling:$ac_tool_warned in\nyes:)\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet\" >&5\n$as_echo \"$as_me: WARNING: using cross tools not prefixed with host triplet\" >&2;}\nac_tool_warned=yes ;;\nesac\n    STRIP=$ac_ct_STRIP\n  fi\nelse\n  STRIP=\"$ac_cv_prog_STRIP\"\nfi\n\ntest -z \"$STRIP\" && STRIP=:\n\n\n\n\n\n\nif test -n \"$ac_tool_prefix\"; then\n  # Extract the first word of \"${ac_tool_prefix}ranlib\", so it can be a program name with args.\nset dummy ${ac_tool_prefix}ranlib; ac_word=$2\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for $ac_word\" >&5\n$as_echo_n \"checking for $ac_word... \" >&6; }\nif ${ac_cv_prog_RANLIB+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  if test -n \"$RANLIB\"; then\n  ac_cv_prog_RANLIB=\"$RANLIB\" # Let the user override the test.\nelse\nas_save_IFS=$IFS; IFS=$PATH_SEPARATOR\nfor as_dir in $PATH\ndo\n  IFS=$as_save_IFS\n  test -z \"$as_dir\" && as_dir=.\n    for ac_exec_ext in '' $ac_executable_extensions; do\n  if as_fn_executable_p \"$as_dir/$ac_word$ac_exec_ext\"; then\n    ac_cv_prog_RANLIB=\"${ac_tool_prefix}ranlib\"\n    $as_echo \"$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext\" >&5\n    break 2\n  fi\ndone\n  done\nIFS=$as_save_IFS\n\nfi\nfi\nRANLIB=$ac_cv_prog_RANLIB\nif test -n \"$RANLIB\"; then\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: $RANLIB\" >&5\n$as_echo \"$RANLIB\" >&6; }\nelse\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: no\" >&5\n$as_echo \"no\" >&6; }\nfi\n\n\nfi\nif test -z \"$ac_cv_prog_RANLIB\"; then\n  ac_ct_RANLIB=$RANLIB\n  # Extract the first word of \"ranlib\", so it can be a program name with args.\nset dummy ranlib; ac_word=$2\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for $ac_word\" >&5\n$as_echo_n \"checking for $ac_word... \" >&6; }\nif ${ac_cv_prog_ac_ct_RANLIB+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  if test -n \"$ac_ct_RANLIB\"; then\n  ac_cv_prog_ac_ct_RANLIB=\"$ac_ct_RANLIB\" # Let the user override the test.\nelse\nas_save_IFS=$IFS; IFS=$PATH_SEPARATOR\nfor as_dir in $PATH\ndo\n  IFS=$as_save_IFS\n  test -z \"$as_dir\" && as_dir=.\n    for ac_exec_ext in '' $ac_executable_extensions; do\n  if as_fn_executable_p \"$as_dir/$ac_word$ac_exec_ext\"; then\n    ac_cv_prog_ac_ct_RANLIB=\"ranlib\"\n    $as_echo \"$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext\" >&5\n    break 2\n  fi\ndone\n  done\nIFS=$as_save_IFS\n\nfi\nfi\nac_ct_RANLIB=$ac_cv_prog_ac_ct_RANLIB\nif test -n \"$ac_ct_RANLIB\"; then\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: $ac_ct_RANLIB\" >&5\n$as_echo \"$ac_ct_RANLIB\" >&6; }\nelse\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: no\" >&5\n$as_echo \"no\" >&6; }\nfi\n\n  if test \"x$ac_ct_RANLIB\" = x; then\n    RANLIB=\":\"\n  else\n    case $cross_compiling:$ac_tool_warned in\nyes:)\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet\" >&5\n$as_echo \"$as_me: WARNING: using cross tools not prefixed with host triplet\" >&2;}\nac_tool_warned=yes ;;\nesac\n    RANLIB=$ac_ct_RANLIB\n  fi\nelse\n  RANLIB=\"$ac_cv_prog_RANLIB\"\nfi\n\ntest -z \"$RANLIB\" && RANLIB=:\n\n\n\n\n\n\n# Determine commands to create old-style static archives.\nold_archive_cmds='$AR $AR_FLAGS $oldlib$oldobjs'\nold_postinstall_cmds='chmod 644 $oldlib'\nold_postuninstall_cmds=\n\nif test -n \"$RANLIB\"; then\n  case $host_os in\n  openbsd*)\n    old_postinstall_cmds=\"$old_postinstall_cmds~\\$RANLIB -t \\$tool_oldlib\"\n    ;;\n  *)\n    old_postinstall_cmds=\"$old_postinstall_cmds~\\$RANLIB \\$tool_oldlib\"\n    ;;\n  esac\n  old_archive_cmds=\"$old_archive_cmds~\\$RANLIB \\$tool_oldlib\"\nfi\n\ncase $host_os in\n  darwin*)\n    lock_old_archive_extraction=yes ;;\n  *)\n    lock_old_archive_extraction=no ;;\nesac\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n# If no C compiler was specified, use CC.\nLTCC=${LTCC-\"$CC\"}\n\n# If no C compiler flags were specified, use CFLAGS.\nLTCFLAGS=${LTCFLAGS-\"$CFLAGS\"}\n\n# Allow CC to be a program name with arguments.\ncompiler=$CC\n\n\n# Check for command to grab the raw symbol name followed by C symbol from nm.\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking command to parse $NM output from $compiler object\" >&5\n$as_echo_n \"checking command to parse $NM output from $compiler object... \" >&6; }\nif ${lt_cv_sys_global_symbol_pipe+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n\n# These are sane defaults that work on at least a few old systems.\n# [They come from Ultrix.  What could be older than Ultrix?!! ;)]\n\n# Character class describing NM global symbol codes.\nsymcode='[BCDEGRST]'\n\n# Regexp to match symbols that can be accessed directly from C.\nsympat='\\([_A-Za-z][_A-Za-z0-9]*\\)'\n\n# Define system-specific variables.\ncase $host_os in\naix*)\n  symcode='[BCDT]'\n  ;;\ncygwin* | mingw* | pw32* | cegcc*)\n  symcode='[ABCDGISTW]'\n  ;;\nhpux*)\n  if test \"$host_cpu\" = ia64; then\n    symcode='[ABCDEGRST]'\n  fi\n  ;;\nirix* | nonstopux*)\n  symcode='[BCDEGRST]'\n  ;;\nosf*)\n  symcode='[BCDEGQRST]'\n  ;;\nsolaris*)\n  symcode='[BDRT]'\n  ;;\nsco3.2v5*)\n  symcode='[DT]'\n  ;;\nsysv4.2uw2*)\n  symcode='[DT]'\n  ;;\nsysv5* | sco5v6* | unixware* | OpenUNIX*)\n  symcode='[ABDT]'\n  ;;\nsysv4)\n  symcode='[DFNSTU]'\n  ;;\nesac\n\n# If we're using GNU nm, then use its standard symbol codes.\ncase `$NM -V 2>&1` in\n*GNU* | *'with BFD'*)\n  symcode='[ABCDGIRSTW]' ;;\nesac\n\n# Transform an extracted symbol line into a proper C declaration.\n# Some systems (esp. on ia64) link data and code symbols differently,\n# so use this general approach.\nlt_cv_sys_global_symbol_to_cdecl=\"sed -n -e 's/^T .* \\(.*\\)$/extern int \\1();/p' -e 's/^$symcode* .* \\(.*\\)$/extern char \\1;/p'\"\n\n# Transform an extracted symbol line into symbol name and symbol address\nlt_cv_sys_global_symbol_to_c_name_address=\"sed -n -e 's/^: \\([^ ]*\\)[ ]*$/  {\\\\\\\"\\1\\\\\\\", (void *) 0},/p' -e 's/^$symcode* \\([^ ]*\\) \\([^ ]*\\)$/  {\\\"\\2\\\", (void *) \\&\\2},/p'\"\nlt_cv_sys_global_symbol_to_c_name_address_lib_prefix=\"sed -n -e 's/^: \\([^ ]*\\)[ ]*$/  {\\\\\\\"\\1\\\\\\\", (void *) 0},/p' -e 's/^$symcode* \\([^ ]*\\) \\(lib[^ ]*\\)$/  {\\\"\\2\\\", (void *) \\&\\2},/p' -e 's/^$symcode* \\([^ ]*\\) \\([^ ]*\\)$/  {\\\"lib\\2\\\", (void *) \\&\\2},/p'\"\n\n# Handle CRLF in mingw tool chain\nopt_cr=\ncase $build_os in\nmingw*)\n  opt_cr=`$ECHO 'x\\{0,1\\}' | tr x '\\015'` # option cr in regexp\n  ;;\nesac\n\n# Try without a prefix underscore, then with it.\nfor ac_symprfx in \"\" \"_\"; do\n\n  # Transform symcode, sympat, and symprfx into a raw symbol and a C symbol.\n  symxfrm=\"\\\\1 $ac_symprfx\\\\2 \\\\2\"\n\n  # Write the raw and C identifiers.\n  if test \"$lt_cv_nm_interface\" = \"MS dumpbin\"; then\n    # Fake it for dumpbin and say T for any non-static function\n    # and D for any global variable.\n    # Also find C++ and __fastcall symbols from MSVC++,\n    # which start with @ or ?.\n    lt_cv_sys_global_symbol_pipe=\"$AWK '\"\\\n\"     {last_section=section; section=\\$ 3};\"\\\n\"     /^COFF SYMBOL TABLE/{for(i in hide) delete hide[i]};\"\\\n\"     /Section length .*#relocs.*(pick any)/{hide[last_section]=1};\"\\\n\"     \\$ 0!~/External *\\|/{next};\"\\\n\"     / 0+ UNDEF /{next}; / UNDEF \\([^|]\\)*()/{next};\"\\\n\"     {if(hide[section]) next};\"\\\n\"     {f=0}; \\$ 0~/\\(\\).*\\|/{f=1}; {printf f ? \\\"T \\\" : \\\"D \\\"};\"\\\n\"     {split(\\$ 0, a, /\\||\\r/); split(a[2], s)};\"\\\n\"     s[1]~/^[@?]/{print s[1], s[1]; next};\"\\\n\"     s[1]~prfx {split(s[1],t,\\\"@\\\"); print t[1], substr(t[1],length(prfx))}\"\\\n\"     ' prfx=^$ac_symprfx\"\n  else\n    lt_cv_sys_global_symbol_pipe=\"sed -n -e 's/^.*[\t ]\\($symcode$symcode*\\)[\t ][\t ]*$ac_symprfx$sympat$opt_cr$/$symxfrm/p'\"\n  fi\n  lt_cv_sys_global_symbol_pipe=\"$lt_cv_sys_global_symbol_pipe | sed '/ __gnu_lto/d'\"\n\n  # Check to see that the pipe works correctly.\n  pipe_works=no\n\n  rm -f conftest*\n  cat > conftest.$ac_ext <<_LT_EOF\n#ifdef __cplusplus\nextern \"C\" {\n#endif\nchar nm_test_var;\nvoid nm_test_func(void);\nvoid nm_test_func(void){}\n#ifdef __cplusplus\n}\n#endif\nint main(){nm_test_var='a';nm_test_func();return(0);}\n_LT_EOF\n\n  if { { eval echo \"\\\"\\$as_me\\\":${as_lineno-$LINENO}: \\\"$ac_compile\\\"\"; } >&5\n  (eval $ac_compile) 2>&5\n  ac_status=$?\n  $as_echo \"$as_me:${as_lineno-$LINENO}: \\$? = $ac_status\" >&5\n  test $ac_status = 0; }; then\n    # Now try to grab the symbols.\n    nlist=conftest.nm\n    if { { eval echo \"\\\"\\$as_me\\\":${as_lineno-$LINENO}: \\\"$NM conftest.$ac_objext \\| \"$lt_cv_sys_global_symbol_pipe\" \\> $nlist\\\"\"; } >&5\n  (eval $NM conftest.$ac_objext \\| \"$lt_cv_sys_global_symbol_pipe\" \\> $nlist) 2>&5\n  ac_status=$?\n  $as_echo \"$as_me:${as_lineno-$LINENO}: \\$? = $ac_status\" >&5\n  test $ac_status = 0; } && test -s \"$nlist\"; then\n      # Try sorting and uniquifying the output.\n      if sort \"$nlist\" | uniq > \"$nlist\"T; then\n\tmv -f \"$nlist\"T \"$nlist\"\n      else\n\trm -f \"$nlist\"T\n      fi\n\n      # Make sure that we snagged all the symbols we need.\n      if $GREP ' nm_test_var$' \"$nlist\" >/dev/null; then\n\tif $GREP ' nm_test_func$' \"$nlist\" >/dev/null; then\n\t  cat <<_LT_EOF > conftest.$ac_ext\n/* Keep this code in sync between libtool.m4, ltmain, lt_system.h, and tests.  */\n#if defined(_WIN32) || defined(__CYGWIN__) || defined(_WIN32_WCE)\n/* DATA imports from DLLs on WIN32 con't be const, because runtime\n   relocations are performed -- see ld's documentation on pseudo-relocs.  */\n# define LT_DLSYM_CONST\n#elif defined(__osf__)\n/* This system does not cope well with relocations in const data.  */\n# define LT_DLSYM_CONST\n#else\n# define LT_DLSYM_CONST const\n#endif\n\n#ifdef __cplusplus\nextern \"C\" {\n#endif\n\n_LT_EOF\n\t  # Now generate the symbol file.\n\t  eval \"$lt_cv_sys_global_symbol_to_cdecl\"' < \"$nlist\" | $GREP -v main >> conftest.$ac_ext'\n\n\t  cat <<_LT_EOF >> conftest.$ac_ext\n\n/* The mapping between symbol names and symbols.  */\nLT_DLSYM_CONST struct {\n  const char *name;\n  void       *address;\n}\nlt__PROGRAM__LTX_preloaded_symbols[] =\n{\n  { \"@PROGRAM@\", (void *) 0 },\n_LT_EOF\n\t  $SED \"s/^$symcode$symcode* \\(.*\\) \\(.*\\)$/  {\\\"\\2\\\", (void *) \\&\\2},/\" < \"$nlist\" | $GREP -v main >> conftest.$ac_ext\n\t  cat <<\\_LT_EOF >> conftest.$ac_ext\n  {0, (void *) 0}\n};\n\n/* This works around a problem in FreeBSD linker */\n#ifdef FREEBSD_WORKAROUND\nstatic const void *lt_preloaded_setup() {\n  return lt__PROGRAM__LTX_preloaded_symbols;\n}\n#endif\n\n#ifdef __cplusplus\n}\n#endif\n_LT_EOF\n\t  # Now try linking the two files.\n\t  mv conftest.$ac_objext conftstm.$ac_objext\n\t  lt_globsym_save_LIBS=$LIBS\n\t  lt_globsym_save_CFLAGS=$CFLAGS\n\t  LIBS=\"conftstm.$ac_objext\"\n\t  CFLAGS=\"$CFLAGS$lt_prog_compiler_no_builtin_flag\"\n\t  if { { eval echo \"\\\"\\$as_me\\\":${as_lineno-$LINENO}: \\\"$ac_link\\\"\"; } >&5\n  (eval $ac_link) 2>&5\n  ac_status=$?\n  $as_echo \"$as_me:${as_lineno-$LINENO}: \\$? = $ac_status\" >&5\n  test $ac_status = 0; } && test -s conftest${ac_exeext}; then\n\t    pipe_works=yes\n\t  fi\n\t  LIBS=$lt_globsym_save_LIBS\n\t  CFLAGS=$lt_globsym_save_CFLAGS\n\telse\n\t  echo \"cannot find nm_test_func in $nlist\" >&5\n\tfi\n      else\n\techo \"cannot find nm_test_var in $nlist\" >&5\n      fi\n    else\n      echo \"cannot run $lt_cv_sys_global_symbol_pipe\" >&5\n    fi\n  else\n    echo \"$progname: failed program was:\" >&5\n    cat conftest.$ac_ext >&5\n  fi\n  rm -rf conftest* conftst*\n\n  # Do not use the global_symbol_pipe unless it works.\n  if test \"$pipe_works\" = yes; then\n    break\n  else\n    lt_cv_sys_global_symbol_pipe=\n  fi\ndone\n\nfi\n\nif test -z \"$lt_cv_sys_global_symbol_pipe\"; then\n  lt_cv_sys_global_symbol_to_cdecl=\nfi\nif test -z \"$lt_cv_sys_global_symbol_pipe$lt_cv_sys_global_symbol_to_cdecl\"; then\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: failed\" >&5\n$as_echo \"failed\" >&6; }\nelse\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: ok\" >&5\n$as_echo \"ok\" >&6; }\nfi\n\n# Response file support.\nif test \"$lt_cv_nm_interface\" = \"MS dumpbin\"; then\n  nm_file_list_spec='@'\nelif $NM --help 2>/dev/null | grep '[@]FILE' >/dev/null; then\n  nm_file_list_spec='@'\nfi\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for sysroot\" >&5\n$as_echo_n \"checking for sysroot... \" >&6; }\n\n# Check whether --with-sysroot was given.\nif test \"${with_sysroot+set}\" = set; then :\n  withval=$with_sysroot;\nelse\n  with_sysroot=no\nfi\n\n\nlt_sysroot=\ncase ${with_sysroot} in #(\n yes)\n   if test \"$GCC\" = yes; then\n     lt_sysroot=`$CC --print-sysroot 2>/dev/null`\n   fi\n   ;; #(\n /*)\n   lt_sysroot=`echo \"$with_sysroot\" | sed -e \"$sed_quote_subst\"`\n   ;; #(\n no|'')\n   ;; #(\n *)\n   { $as_echo \"$as_me:${as_lineno-$LINENO}: result: ${with_sysroot}\" >&5\n$as_echo \"${with_sysroot}\" >&6; }\n   as_fn_error $? \"The sysroot must be an absolute path.\" \"$LINENO\" 5\n   ;;\nesac\n\n { $as_echo \"$as_me:${as_lineno-$LINENO}: result: ${lt_sysroot:-no}\" >&5\n$as_echo \"${lt_sysroot:-no}\" >&6; }\n\n\n\n\n\n# Check whether --enable-libtool-lock was given.\nif test \"${enable_libtool_lock+set}\" = set; then :\n  enableval=$enable_libtool_lock;\nfi\n\ntest \"x$enable_libtool_lock\" != xno && enable_libtool_lock=yes\n\n# Some flags need to be propagated to the compiler or linker for good\n# libtool support.\ncase $host in\nia64-*-hpux*)\n  # Find out which ABI we are using.\n  echo 'int i;' > conftest.$ac_ext\n  if { { eval echo \"\\\"\\$as_me\\\":${as_lineno-$LINENO}: \\\"$ac_compile\\\"\"; } >&5\n  (eval $ac_compile) 2>&5\n  ac_status=$?\n  $as_echo \"$as_me:${as_lineno-$LINENO}: \\$? = $ac_status\" >&5\n  test $ac_status = 0; }; then\n    case `/usr/bin/file conftest.$ac_objext` in\n      *ELF-32*)\n\tHPUX_IA64_MODE=\"32\"\n\t;;\n      *ELF-64*)\n\tHPUX_IA64_MODE=\"64\"\n\t;;\n    esac\n  fi\n  rm -rf conftest*\n  ;;\n*-*-irix6*)\n  # Find out which ABI we are using.\n  echo '#line '$LINENO' \"configure\"' > conftest.$ac_ext\n  if { { eval echo \"\\\"\\$as_me\\\":${as_lineno-$LINENO}: \\\"$ac_compile\\\"\"; } >&5\n  (eval $ac_compile) 2>&5\n  ac_status=$?\n  $as_echo \"$as_me:${as_lineno-$LINENO}: \\$? = $ac_status\" >&5\n  test $ac_status = 0; }; then\n    if test \"$lt_cv_prog_gnu_ld\" = yes; then\n      case `/usr/bin/file conftest.$ac_objext` in\n\t*32-bit*)\n\t  LD=\"${LD-ld} -melf32bsmip\"\n\t  ;;\n\t*N32*)\n\t  LD=\"${LD-ld} -melf32bmipn32\"\n\t  ;;\n\t*64-bit*)\n\t  LD=\"${LD-ld} -melf64bmip\"\n\t;;\n      esac\n    else\n      case `/usr/bin/file conftest.$ac_objext` in\n\t*32-bit*)\n\t  LD=\"${LD-ld} -32\"\n\t  ;;\n\t*N32*)\n\t  LD=\"${LD-ld} -n32\"\n\t  ;;\n\t*64-bit*)\n\t  LD=\"${LD-ld} -64\"\n\t  ;;\n      esac\n    fi\n  fi\n  rm -rf conftest*\n  ;;\n\nx86_64-*kfreebsd*-gnu|x86_64-*linux*|powerpc*-*linux*| \\\ns390*-*linux*|s390*-*tpf*|sparc*-*linux*)\n  # Find out which ABI we are using.\n  echo 'int i;' > conftest.$ac_ext\n  if { { eval echo \"\\\"\\$as_me\\\":${as_lineno-$LINENO}: \\\"$ac_compile\\\"\"; } >&5\n  (eval $ac_compile) 2>&5\n  ac_status=$?\n  $as_echo \"$as_me:${as_lineno-$LINENO}: \\$? = $ac_status\" >&5\n  test $ac_status = 0; }; then\n    case `/usr/bin/file conftest.o` in\n      *32-bit*)\n\tcase $host in\n\t  x86_64-*kfreebsd*-gnu)\n\t    LD=\"${LD-ld} -m elf_i386_fbsd\"\n\t    ;;\n\t  x86_64-*linux*)\n\t    case `/usr/bin/file conftest.o` in\n\t      *x86-64*)\n\t\tLD=\"${LD-ld} -m elf32_x86_64\"\n\t\t;;\n\t      *)\n\t\tLD=\"${LD-ld} -m elf_i386\"\n\t\t;;\n\t    esac\n\t    ;;\n\t  powerpc64le-*)\n\t    LD=\"${LD-ld} -m elf32lppclinux\"\n\t    ;;\n\t  powerpc64-*)\n\t    LD=\"${LD-ld} -m elf32ppclinux\"\n\t    ;;\n\t  s390x-*linux*)\n\t    LD=\"${LD-ld} -m elf_s390\"\n\t    ;;\n\t  sparc64-*linux*)\n\t    LD=\"${LD-ld} -m elf32_sparc\"\n\t    ;;\n\tesac\n\t;;\n      *64-bit*)\n\tcase $host in\n\t  x86_64-*kfreebsd*-gnu)\n\t    LD=\"${LD-ld} -m elf_x86_64_fbsd\"\n\t    ;;\n\t  x86_64-*linux*)\n\t    LD=\"${LD-ld} -m elf_x86_64\"\n\t    ;;\n\t  powerpcle-*)\n\t    LD=\"${LD-ld} -m elf64lppc\"\n\t    ;;\n\t  powerpc-*)\n\t    LD=\"${LD-ld} -m elf64ppc\"\n\t    ;;\n\t  s390*-*linux*|s390*-*tpf*)\n\t    LD=\"${LD-ld} -m elf64_s390\"\n\t    ;;\n\t  sparc*-*linux*)\n\t    LD=\"${LD-ld} -m elf64_sparc\"\n\t    ;;\n\tesac\n\t;;\n    esac\n  fi\n  rm -rf conftest*\n  ;;\n\n*-*-sco3.2v5*)\n  # On SCO OpenServer 5, we need -belf to get full-featured binaries.\n  SAVE_CFLAGS=\"$CFLAGS\"\n  CFLAGS=\"$CFLAGS -belf\"\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: checking whether the C compiler needs -belf\" >&5\n$as_echo_n \"checking whether the C compiler needs -belf... \" >&6; }\nif ${lt_cv_cc_needs_belf+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  ac_ext=c\nac_cpp='$CPP $CPPFLAGS'\nac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5'\nac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5'\nac_compiler_gnu=$ac_cv_c_compiler_gnu\n\n     cat confdefs.h - <<_ACEOF >conftest.$ac_ext\n/* end confdefs.h.  */\n\nint\nmain ()\n{\n\n  ;\n  return 0;\n}\n_ACEOF\nif ac_fn_c_try_link \"$LINENO\"; then :\n  lt_cv_cc_needs_belf=yes\nelse\n  lt_cv_cc_needs_belf=no\nfi\nrm -f core conftest.err conftest.$ac_objext \\\n    conftest$ac_exeext conftest.$ac_ext\n     ac_ext=c\nac_cpp='$CPP $CPPFLAGS'\nac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5'\nac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5'\nac_compiler_gnu=$ac_cv_c_compiler_gnu\n\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $lt_cv_cc_needs_belf\" >&5\n$as_echo \"$lt_cv_cc_needs_belf\" >&6; }\n  if test x\"$lt_cv_cc_needs_belf\" != x\"yes\"; then\n    # this is probably gcc 2.8.0, egcs 1.0 or newer; no need for -belf\n    CFLAGS=\"$SAVE_CFLAGS\"\n  fi\n  ;;\n*-*solaris*)\n  # Find out which ABI we are using.\n  echo 'int i;' > conftest.$ac_ext\n  if { { eval echo \"\\\"\\$as_me\\\":${as_lineno-$LINENO}: \\\"$ac_compile\\\"\"; } >&5\n  (eval $ac_compile) 2>&5\n  ac_status=$?\n  $as_echo \"$as_me:${as_lineno-$LINENO}: \\$? = $ac_status\" >&5\n  test $ac_status = 0; }; then\n    case `/usr/bin/file conftest.o` in\n    *64-bit*)\n      case $lt_cv_prog_gnu_ld in\n      yes*)\n        case $host in\n        i?86-*-solaris*)\n          LD=\"${LD-ld} -m elf_x86_64\"\n          ;;\n        sparc*-*-solaris*)\n          LD=\"${LD-ld} -m elf64_sparc\"\n          ;;\n        esac\n        # GNU ld 2.21 introduced _sol2 emulations.  Use them if available.\n        if ${LD-ld} -V | grep _sol2 >/dev/null 2>&1; then\n          LD=\"${LD-ld}_sol2\"\n        fi\n        ;;\n      *)\n\tif ${LD-ld} -64 -r -o conftest2.o conftest.o >/dev/null 2>&1; then\n\t  LD=\"${LD-ld} -64\"\n\tfi\n\t;;\n      esac\n      ;;\n    esac\n  fi\n  rm -rf conftest*\n  ;;\nesac\n\nneed_locks=\"$enable_libtool_lock\"\n\nif test -n \"$ac_tool_prefix\"; then\n  # Extract the first word of \"${ac_tool_prefix}mt\", so it can be a program name with args.\nset dummy ${ac_tool_prefix}mt; ac_word=$2\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for $ac_word\" >&5\n$as_echo_n \"checking for $ac_word... \" >&6; }\nif ${ac_cv_prog_MANIFEST_TOOL+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  if test -n \"$MANIFEST_TOOL\"; then\n  ac_cv_prog_MANIFEST_TOOL=\"$MANIFEST_TOOL\" # Let the user override the test.\nelse\nas_save_IFS=$IFS; IFS=$PATH_SEPARATOR\nfor as_dir in $PATH\ndo\n  IFS=$as_save_IFS\n  test -z \"$as_dir\" && as_dir=.\n    for ac_exec_ext in '' $ac_executable_extensions; do\n  if as_fn_executable_p \"$as_dir/$ac_word$ac_exec_ext\"; then\n    ac_cv_prog_MANIFEST_TOOL=\"${ac_tool_prefix}mt\"\n    $as_echo \"$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext\" >&5\n    break 2\n  fi\ndone\n  done\nIFS=$as_save_IFS\n\nfi\nfi\nMANIFEST_TOOL=$ac_cv_prog_MANIFEST_TOOL\nif test -n \"$MANIFEST_TOOL\"; then\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: $MANIFEST_TOOL\" >&5\n$as_echo \"$MANIFEST_TOOL\" >&6; }\nelse\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: no\" >&5\n$as_echo \"no\" >&6; }\nfi\n\n\nfi\nif test -z \"$ac_cv_prog_MANIFEST_TOOL\"; then\n  ac_ct_MANIFEST_TOOL=$MANIFEST_TOOL\n  # Extract the first word of \"mt\", so it can be a program name with args.\nset dummy mt; ac_word=$2\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for $ac_word\" >&5\n$as_echo_n \"checking for $ac_word... \" >&6; }\nif ${ac_cv_prog_ac_ct_MANIFEST_TOOL+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  if test -n \"$ac_ct_MANIFEST_TOOL\"; then\n  ac_cv_prog_ac_ct_MANIFEST_TOOL=\"$ac_ct_MANIFEST_TOOL\" # Let the user override the test.\nelse\nas_save_IFS=$IFS; IFS=$PATH_SEPARATOR\nfor as_dir in $PATH\ndo\n  IFS=$as_save_IFS\n  test -z \"$as_dir\" && as_dir=.\n    for ac_exec_ext in '' $ac_executable_extensions; do\n  if as_fn_executable_p \"$as_dir/$ac_word$ac_exec_ext\"; then\n    ac_cv_prog_ac_ct_MANIFEST_TOOL=\"mt\"\n    $as_echo \"$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext\" >&5\n    break 2\n  fi\ndone\n  done\nIFS=$as_save_IFS\n\nfi\nfi\nac_ct_MANIFEST_TOOL=$ac_cv_prog_ac_ct_MANIFEST_TOOL\nif test -n \"$ac_ct_MANIFEST_TOOL\"; then\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: $ac_ct_MANIFEST_TOOL\" >&5\n$as_echo \"$ac_ct_MANIFEST_TOOL\" >&6; }\nelse\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: no\" >&5\n$as_echo \"no\" >&6; }\nfi\n\n  if test \"x$ac_ct_MANIFEST_TOOL\" = x; then\n    MANIFEST_TOOL=\":\"\n  else\n    case $cross_compiling:$ac_tool_warned in\nyes:)\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet\" >&5\n$as_echo \"$as_me: WARNING: using cross tools not prefixed with host triplet\" >&2;}\nac_tool_warned=yes ;;\nesac\n    MANIFEST_TOOL=$ac_ct_MANIFEST_TOOL\n  fi\nelse\n  MANIFEST_TOOL=\"$ac_cv_prog_MANIFEST_TOOL\"\nfi\n\ntest -z \"$MANIFEST_TOOL\" && MANIFEST_TOOL=mt\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking if $MANIFEST_TOOL is a manifest tool\" >&5\n$as_echo_n \"checking if $MANIFEST_TOOL is a manifest tool... \" >&6; }\nif ${lt_cv_path_mainfest_tool+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  lt_cv_path_mainfest_tool=no\n  echo \"$as_me:$LINENO: $MANIFEST_TOOL '-?'\" >&5\n  $MANIFEST_TOOL '-?' 2>conftest.err > conftest.out\n  cat conftest.err >&5\n  if $GREP 'Manifest Tool' conftest.out > /dev/null; then\n    lt_cv_path_mainfest_tool=yes\n  fi\n  rm -f conftest*\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $lt_cv_path_mainfest_tool\" >&5\n$as_echo \"$lt_cv_path_mainfest_tool\" >&6; }\nif test \"x$lt_cv_path_mainfest_tool\" != xyes; then\n  MANIFEST_TOOL=:\nfi\n\n\n\n\n\n\n  case $host_os in\n    rhapsody* | darwin*)\n    if test -n \"$ac_tool_prefix\"; then\n  # Extract the first word of \"${ac_tool_prefix}dsymutil\", so it can be a program name with args.\nset dummy ${ac_tool_prefix}dsymutil; ac_word=$2\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for $ac_word\" >&5\n$as_echo_n \"checking for $ac_word... \" >&6; }\nif ${ac_cv_prog_DSYMUTIL+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  if test -n \"$DSYMUTIL\"; then\n  ac_cv_prog_DSYMUTIL=\"$DSYMUTIL\" # Let the user override the test.\nelse\nas_save_IFS=$IFS; IFS=$PATH_SEPARATOR\nfor as_dir in $PATH\ndo\n  IFS=$as_save_IFS\n  test -z \"$as_dir\" && as_dir=.\n    for ac_exec_ext in '' $ac_executable_extensions; do\n  if as_fn_executable_p \"$as_dir/$ac_word$ac_exec_ext\"; then\n    ac_cv_prog_DSYMUTIL=\"${ac_tool_prefix}dsymutil\"\n    $as_echo \"$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext\" >&5\n    break 2\n  fi\ndone\n  done\nIFS=$as_save_IFS\n\nfi\nfi\nDSYMUTIL=$ac_cv_prog_DSYMUTIL\nif test -n \"$DSYMUTIL\"; then\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: $DSYMUTIL\" >&5\n$as_echo \"$DSYMUTIL\" >&6; }\nelse\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: no\" >&5\n$as_echo \"no\" >&6; }\nfi\n\n\nfi\nif test -z \"$ac_cv_prog_DSYMUTIL\"; then\n  ac_ct_DSYMUTIL=$DSYMUTIL\n  # Extract the first word of \"dsymutil\", so it can be a program name with args.\nset dummy dsymutil; ac_word=$2\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for $ac_word\" >&5\n$as_echo_n \"checking for $ac_word... \" >&6; }\nif ${ac_cv_prog_ac_ct_DSYMUTIL+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  if test -n \"$ac_ct_DSYMUTIL\"; then\n  ac_cv_prog_ac_ct_DSYMUTIL=\"$ac_ct_DSYMUTIL\" # Let the user override the test.\nelse\nas_save_IFS=$IFS; IFS=$PATH_SEPARATOR\nfor as_dir in $PATH\ndo\n  IFS=$as_save_IFS\n  test -z \"$as_dir\" && as_dir=.\n    for ac_exec_ext in '' $ac_executable_extensions; do\n  if as_fn_executable_p \"$as_dir/$ac_word$ac_exec_ext\"; then\n    ac_cv_prog_ac_ct_DSYMUTIL=\"dsymutil\"\n    $as_echo \"$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext\" >&5\n    break 2\n  fi\ndone\n  done\nIFS=$as_save_IFS\n\nfi\nfi\nac_ct_DSYMUTIL=$ac_cv_prog_ac_ct_DSYMUTIL\nif test -n \"$ac_ct_DSYMUTIL\"; then\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: $ac_ct_DSYMUTIL\" >&5\n$as_echo \"$ac_ct_DSYMUTIL\" >&6; }\nelse\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: no\" >&5\n$as_echo \"no\" >&6; }\nfi\n\n  if test \"x$ac_ct_DSYMUTIL\" = x; then\n    DSYMUTIL=\":\"\n  else\n    case $cross_compiling:$ac_tool_warned in\nyes:)\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet\" >&5\n$as_echo \"$as_me: WARNING: using cross tools not prefixed with host triplet\" >&2;}\nac_tool_warned=yes ;;\nesac\n    DSYMUTIL=$ac_ct_DSYMUTIL\n  fi\nelse\n  DSYMUTIL=\"$ac_cv_prog_DSYMUTIL\"\nfi\n\n    if test -n \"$ac_tool_prefix\"; then\n  # Extract the first word of \"${ac_tool_prefix}nmedit\", so it can be a program name with args.\nset dummy ${ac_tool_prefix}nmedit; ac_word=$2\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for $ac_word\" >&5\n$as_echo_n \"checking for $ac_word... \" >&6; }\nif ${ac_cv_prog_NMEDIT+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  if test -n \"$NMEDIT\"; then\n  ac_cv_prog_NMEDIT=\"$NMEDIT\" # Let the user override the test.\nelse\nas_save_IFS=$IFS; IFS=$PATH_SEPARATOR\nfor as_dir in $PATH\ndo\n  IFS=$as_save_IFS\n  test -z \"$as_dir\" && as_dir=.\n    for ac_exec_ext in '' $ac_executable_extensions; do\n  if as_fn_executable_p \"$as_dir/$ac_word$ac_exec_ext\"; then\n    ac_cv_prog_NMEDIT=\"${ac_tool_prefix}nmedit\"\n    $as_echo \"$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext\" >&5\n    break 2\n  fi\ndone\n  done\nIFS=$as_save_IFS\n\nfi\nfi\nNMEDIT=$ac_cv_prog_NMEDIT\nif test -n \"$NMEDIT\"; then\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: $NMEDIT\" >&5\n$as_echo \"$NMEDIT\" >&6; }\nelse\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: no\" >&5\n$as_echo \"no\" >&6; }\nfi\n\n\nfi\nif test -z \"$ac_cv_prog_NMEDIT\"; then\n  ac_ct_NMEDIT=$NMEDIT\n  # Extract the first word of \"nmedit\", so it can be a program name with args.\nset dummy nmedit; ac_word=$2\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for $ac_word\" >&5\n$as_echo_n \"checking for $ac_word... \" >&6; }\nif ${ac_cv_prog_ac_ct_NMEDIT+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  if test -n \"$ac_ct_NMEDIT\"; then\n  ac_cv_prog_ac_ct_NMEDIT=\"$ac_ct_NMEDIT\" # Let the user override the test.\nelse\nas_save_IFS=$IFS; IFS=$PATH_SEPARATOR\nfor as_dir in $PATH\ndo\n  IFS=$as_save_IFS\n  test -z \"$as_dir\" && as_dir=.\n    for ac_exec_ext in '' $ac_executable_extensions; do\n  if as_fn_executable_p \"$as_dir/$ac_word$ac_exec_ext\"; then\n    ac_cv_prog_ac_ct_NMEDIT=\"nmedit\"\n    $as_echo \"$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext\" >&5\n    break 2\n  fi\ndone\n  done\nIFS=$as_save_IFS\n\nfi\nfi\nac_ct_NMEDIT=$ac_cv_prog_ac_ct_NMEDIT\nif test -n \"$ac_ct_NMEDIT\"; then\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: $ac_ct_NMEDIT\" >&5\n$as_echo \"$ac_ct_NMEDIT\" >&6; }\nelse\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: no\" >&5\n$as_echo \"no\" >&6; }\nfi\n\n  if test \"x$ac_ct_NMEDIT\" = x; then\n    NMEDIT=\":\"\n  else\n    case $cross_compiling:$ac_tool_warned in\nyes:)\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet\" >&5\n$as_echo \"$as_me: WARNING: using cross tools not prefixed with host triplet\" >&2;}\nac_tool_warned=yes ;;\nesac\n    NMEDIT=$ac_ct_NMEDIT\n  fi\nelse\n  NMEDIT=\"$ac_cv_prog_NMEDIT\"\nfi\n\n    if test -n \"$ac_tool_prefix\"; then\n  # Extract the first word of \"${ac_tool_prefix}lipo\", so it can be a program name with args.\nset dummy ${ac_tool_prefix}lipo; ac_word=$2\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for $ac_word\" >&5\n$as_echo_n \"checking for $ac_word... \" >&6; }\nif ${ac_cv_prog_LIPO+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  if test -n \"$LIPO\"; then\n  ac_cv_prog_LIPO=\"$LIPO\" # Let the user override the test.\nelse\nas_save_IFS=$IFS; IFS=$PATH_SEPARATOR\nfor as_dir in $PATH\ndo\n  IFS=$as_save_IFS\n  test -z \"$as_dir\" && as_dir=.\n    for ac_exec_ext in '' $ac_executable_extensions; do\n  if as_fn_executable_p \"$as_dir/$ac_word$ac_exec_ext\"; then\n    ac_cv_prog_LIPO=\"${ac_tool_prefix}lipo\"\n    $as_echo \"$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext\" >&5\n    break 2\n  fi\ndone\n  done\nIFS=$as_save_IFS\n\nfi\nfi\nLIPO=$ac_cv_prog_LIPO\nif test -n \"$LIPO\"; then\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: $LIPO\" >&5\n$as_echo \"$LIPO\" >&6; }\nelse\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: no\" >&5\n$as_echo \"no\" >&6; }\nfi\n\n\nfi\nif test -z \"$ac_cv_prog_LIPO\"; then\n  ac_ct_LIPO=$LIPO\n  # Extract the first word of \"lipo\", so it can be a program name with args.\nset dummy lipo; ac_word=$2\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for $ac_word\" >&5\n$as_echo_n \"checking for $ac_word... \" >&6; }\nif ${ac_cv_prog_ac_ct_LIPO+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  if test -n \"$ac_ct_LIPO\"; then\n  ac_cv_prog_ac_ct_LIPO=\"$ac_ct_LIPO\" # Let the user override the test.\nelse\nas_save_IFS=$IFS; IFS=$PATH_SEPARATOR\nfor as_dir in $PATH\ndo\n  IFS=$as_save_IFS\n  test -z \"$as_dir\" && as_dir=.\n    for ac_exec_ext in '' $ac_executable_extensions; do\n  if as_fn_executable_p \"$as_dir/$ac_word$ac_exec_ext\"; then\n    ac_cv_prog_ac_ct_LIPO=\"lipo\"\n    $as_echo \"$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext\" >&5\n    break 2\n  fi\ndone\n  done\nIFS=$as_save_IFS\n\nfi\nfi\nac_ct_LIPO=$ac_cv_prog_ac_ct_LIPO\nif test -n \"$ac_ct_LIPO\"; then\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: $ac_ct_LIPO\" >&5\n$as_echo \"$ac_ct_LIPO\" >&6; }\nelse\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: no\" >&5\n$as_echo \"no\" >&6; }\nfi\n\n  if test \"x$ac_ct_LIPO\" = x; then\n    LIPO=\":\"\n  else\n    case $cross_compiling:$ac_tool_warned in\nyes:)\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet\" >&5\n$as_echo \"$as_me: WARNING: using cross tools not prefixed with host triplet\" >&2;}\nac_tool_warned=yes ;;\nesac\n    LIPO=$ac_ct_LIPO\n  fi\nelse\n  LIPO=\"$ac_cv_prog_LIPO\"\nfi\n\n    if test -n \"$ac_tool_prefix\"; then\n  # Extract the first word of \"${ac_tool_prefix}otool\", so it can be a program name with args.\nset dummy ${ac_tool_prefix}otool; ac_word=$2\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for $ac_word\" >&5\n$as_echo_n \"checking for $ac_word... \" >&6; }\nif ${ac_cv_prog_OTOOL+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  if test -n \"$OTOOL\"; then\n  ac_cv_prog_OTOOL=\"$OTOOL\" # Let the user override the test.\nelse\nas_save_IFS=$IFS; IFS=$PATH_SEPARATOR\nfor as_dir in $PATH\ndo\n  IFS=$as_save_IFS\n  test -z \"$as_dir\" && as_dir=.\n    for ac_exec_ext in '' $ac_executable_extensions; do\n  if as_fn_executable_p \"$as_dir/$ac_word$ac_exec_ext\"; then\n    ac_cv_prog_OTOOL=\"${ac_tool_prefix}otool\"\n    $as_echo \"$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext\" >&5\n    break 2\n  fi\ndone\n  done\nIFS=$as_save_IFS\n\nfi\nfi\nOTOOL=$ac_cv_prog_OTOOL\nif test -n \"$OTOOL\"; then\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: $OTOOL\" >&5\n$as_echo \"$OTOOL\" >&6; }\nelse\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: no\" >&5\n$as_echo \"no\" >&6; }\nfi\n\n\nfi\nif test -z \"$ac_cv_prog_OTOOL\"; then\n  ac_ct_OTOOL=$OTOOL\n  # Extract the first word of \"otool\", so it can be a program name with args.\nset dummy otool; ac_word=$2\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for $ac_word\" >&5\n$as_echo_n \"checking for $ac_word... \" >&6; }\nif ${ac_cv_prog_ac_ct_OTOOL+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  if test -n \"$ac_ct_OTOOL\"; then\n  ac_cv_prog_ac_ct_OTOOL=\"$ac_ct_OTOOL\" # Let the user override the test.\nelse\nas_save_IFS=$IFS; IFS=$PATH_SEPARATOR\nfor as_dir in $PATH\ndo\n  IFS=$as_save_IFS\n  test -z \"$as_dir\" && as_dir=.\n    for ac_exec_ext in '' $ac_executable_extensions; do\n  if as_fn_executable_p \"$as_dir/$ac_word$ac_exec_ext\"; then\n    ac_cv_prog_ac_ct_OTOOL=\"otool\"\n    $as_echo \"$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext\" >&5\n    break 2\n  fi\ndone\n  done\nIFS=$as_save_IFS\n\nfi\nfi\nac_ct_OTOOL=$ac_cv_prog_ac_ct_OTOOL\nif test -n \"$ac_ct_OTOOL\"; then\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: $ac_ct_OTOOL\" >&5\n$as_echo \"$ac_ct_OTOOL\" >&6; }\nelse\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: no\" >&5\n$as_echo \"no\" >&6; }\nfi\n\n  if test \"x$ac_ct_OTOOL\" = x; then\n    OTOOL=\":\"\n  else\n    case $cross_compiling:$ac_tool_warned in\nyes:)\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet\" >&5\n$as_echo \"$as_me: WARNING: using cross tools not prefixed with host triplet\" >&2;}\nac_tool_warned=yes ;;\nesac\n    OTOOL=$ac_ct_OTOOL\n  fi\nelse\n  OTOOL=\"$ac_cv_prog_OTOOL\"\nfi\n\n    if test -n \"$ac_tool_prefix\"; then\n  # Extract the first word of \"${ac_tool_prefix}otool64\", so it can be a program name with args.\nset dummy ${ac_tool_prefix}otool64; ac_word=$2\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for $ac_word\" >&5\n$as_echo_n \"checking for $ac_word... \" >&6; }\nif ${ac_cv_prog_OTOOL64+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  if test -n \"$OTOOL64\"; then\n  ac_cv_prog_OTOOL64=\"$OTOOL64\" # Let the user override the test.\nelse\nas_save_IFS=$IFS; IFS=$PATH_SEPARATOR\nfor as_dir in $PATH\ndo\n  IFS=$as_save_IFS\n  test -z \"$as_dir\" && as_dir=.\n    for ac_exec_ext in '' $ac_executable_extensions; do\n  if as_fn_executable_p \"$as_dir/$ac_word$ac_exec_ext\"; then\n    ac_cv_prog_OTOOL64=\"${ac_tool_prefix}otool64\"\n    $as_echo \"$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext\" >&5\n    break 2\n  fi\ndone\n  done\nIFS=$as_save_IFS\n\nfi\nfi\nOTOOL64=$ac_cv_prog_OTOOL64\nif test -n \"$OTOOL64\"; then\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: $OTOOL64\" >&5\n$as_echo \"$OTOOL64\" >&6; }\nelse\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: no\" >&5\n$as_echo \"no\" >&6; }\nfi\n\n\nfi\nif test -z \"$ac_cv_prog_OTOOL64\"; then\n  ac_ct_OTOOL64=$OTOOL64\n  # Extract the first word of \"otool64\", so it can be a program name with args.\nset dummy otool64; ac_word=$2\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for $ac_word\" >&5\n$as_echo_n \"checking for $ac_word... \" >&6; }\nif ${ac_cv_prog_ac_ct_OTOOL64+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  if test -n \"$ac_ct_OTOOL64\"; then\n  ac_cv_prog_ac_ct_OTOOL64=\"$ac_ct_OTOOL64\" # Let the user override the test.\nelse\nas_save_IFS=$IFS; IFS=$PATH_SEPARATOR\nfor as_dir in $PATH\ndo\n  IFS=$as_save_IFS\n  test -z \"$as_dir\" && as_dir=.\n    for ac_exec_ext in '' $ac_executable_extensions; do\n  if as_fn_executable_p \"$as_dir/$ac_word$ac_exec_ext\"; then\n    ac_cv_prog_ac_ct_OTOOL64=\"otool64\"\n    $as_echo \"$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext\" >&5\n    break 2\n  fi\ndone\n  done\nIFS=$as_save_IFS\n\nfi\nfi\nac_ct_OTOOL64=$ac_cv_prog_ac_ct_OTOOL64\nif test -n \"$ac_ct_OTOOL64\"; then\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: $ac_ct_OTOOL64\" >&5\n$as_echo \"$ac_ct_OTOOL64\" >&6; }\nelse\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: no\" >&5\n$as_echo \"no\" >&6; }\nfi\n\n  if test \"x$ac_ct_OTOOL64\" = x; then\n    OTOOL64=\":\"\n  else\n    case $cross_compiling:$ac_tool_warned in\nyes:)\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet\" >&5\n$as_echo \"$as_me: WARNING: using cross tools not prefixed with host triplet\" >&2;}\nac_tool_warned=yes ;;\nesac\n    OTOOL64=$ac_ct_OTOOL64\n  fi\nelse\n  OTOOL64=\"$ac_cv_prog_OTOOL64\"\nfi\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n    { $as_echo \"$as_me:${as_lineno-$LINENO}: checking for -single_module linker flag\" >&5\n$as_echo_n \"checking for -single_module linker flag... \" >&6; }\nif ${lt_cv_apple_cc_single_mod+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  lt_cv_apple_cc_single_mod=no\n      if test -z \"${LT_MULTI_MODULE}\"; then\n\t# By default we will add the -single_module flag. You can override\n\t# by either setting the environment variable LT_MULTI_MODULE\n\t# non-empty at configure time, or by adding -multi_module to the\n\t# link flags.\n\trm -rf libconftest.dylib*\n\techo \"int foo(void){return 1;}\" > conftest.c\n\techo \"$LTCC $LTCFLAGS $LDFLAGS -o libconftest.dylib \\\n-dynamiclib -Wl,-single_module conftest.c\" >&5\n\t$LTCC $LTCFLAGS $LDFLAGS -o libconftest.dylib \\\n\t  -dynamiclib -Wl,-single_module conftest.c 2>conftest.err\n        _lt_result=$?\n\t# If there is a non-empty error log, and \"single_module\"\n\t# appears in it, assume the flag caused a linker warning\n        if test -s conftest.err && $GREP single_module conftest.err; then\n\t  cat conftest.err >&5\n\t# Otherwise, if the output was created with a 0 exit code from\n\t# the compiler, it worked.\n\telif test -f libconftest.dylib && test $_lt_result -eq 0; then\n\t  lt_cv_apple_cc_single_mod=yes\n\telse\n\t  cat conftest.err >&5\n\tfi\n\trm -rf libconftest.dylib*\n\trm -f conftest.*\n      fi\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $lt_cv_apple_cc_single_mod\" >&5\n$as_echo \"$lt_cv_apple_cc_single_mod\" >&6; }\n\n    { $as_echo \"$as_me:${as_lineno-$LINENO}: checking for -exported_symbols_list linker flag\" >&5\n$as_echo_n \"checking for -exported_symbols_list linker flag... \" >&6; }\nif ${lt_cv_ld_exported_symbols_list+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  lt_cv_ld_exported_symbols_list=no\n      save_LDFLAGS=$LDFLAGS\n      echo \"_main\" > conftest.sym\n      LDFLAGS=\"$LDFLAGS -Wl,-exported_symbols_list,conftest.sym\"\n      cat confdefs.h - <<_ACEOF >conftest.$ac_ext\n/* end confdefs.h.  */\n\nint\nmain ()\n{\n\n  ;\n  return 0;\n}\n_ACEOF\nif ac_fn_c_try_link \"$LINENO\"; then :\n  lt_cv_ld_exported_symbols_list=yes\nelse\n  lt_cv_ld_exported_symbols_list=no\nfi\nrm -f core conftest.err conftest.$ac_objext \\\n    conftest$ac_exeext conftest.$ac_ext\n\tLDFLAGS=\"$save_LDFLAGS\"\n\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $lt_cv_ld_exported_symbols_list\" >&5\n$as_echo \"$lt_cv_ld_exported_symbols_list\" >&6; }\n\n    { $as_echo \"$as_me:${as_lineno-$LINENO}: checking for -force_load linker flag\" >&5\n$as_echo_n \"checking for -force_load linker flag... \" >&6; }\nif ${lt_cv_ld_force_load+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  lt_cv_ld_force_load=no\n      cat > conftest.c << _LT_EOF\nint forced_loaded() { return 2;}\n_LT_EOF\n      echo \"$LTCC $LTCFLAGS -c -o conftest.o conftest.c\" >&5\n      $LTCC $LTCFLAGS -c -o conftest.o conftest.c 2>&5\n      echo \"$AR cru libconftest.a conftest.o\" >&5\n      $AR cru libconftest.a conftest.o 2>&5\n      echo \"$RANLIB libconftest.a\" >&5\n      $RANLIB libconftest.a 2>&5\n      cat > conftest.c << _LT_EOF\nint main() { return 0;}\n_LT_EOF\n      echo \"$LTCC $LTCFLAGS $LDFLAGS -o conftest conftest.c -Wl,-force_load,./libconftest.a\" >&5\n      $LTCC $LTCFLAGS $LDFLAGS -o conftest conftest.c -Wl,-force_load,./libconftest.a 2>conftest.err\n      _lt_result=$?\n      if test -s conftest.err && $GREP force_load conftest.err; then\n\tcat conftest.err >&5\n      elif test -f conftest && test $_lt_result -eq 0 && $GREP forced_load conftest >/dev/null 2>&1 ; then\n\tlt_cv_ld_force_load=yes\n      else\n\tcat conftest.err >&5\n      fi\n        rm -f conftest.err libconftest.a conftest conftest.c\n        rm -rf conftest.dSYM\n\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $lt_cv_ld_force_load\" >&5\n$as_echo \"$lt_cv_ld_force_load\" >&6; }\n    case $host_os in\n    rhapsody* | darwin1.[012])\n      _lt_dar_allow_undefined='${wl}-undefined ${wl}suppress' ;;\n    darwin1.*)\n      _lt_dar_allow_undefined='${wl}-flat_namespace ${wl}-undefined ${wl}suppress' ;;\n    darwin*) # darwin 5.x on\n      # if running on 10.5 or later, the deployment target defaults\n      # to the OS version, if on x86, and 10.4, the deployment\n      # target defaults to 10.4. Don't you love it?\n      case ${MACOSX_DEPLOYMENT_TARGET-10.0},$host in\n\t10.0,*86*-darwin8*|10.0,*-darwin[91]*)\n\t  _lt_dar_allow_undefined='${wl}-undefined ${wl}dynamic_lookup' ;;\n\t10.[012]*)\n\t  _lt_dar_allow_undefined='${wl}-flat_namespace ${wl}-undefined ${wl}suppress' ;;\n\t10.*)\n\t  _lt_dar_allow_undefined='${wl}-undefined ${wl}dynamic_lookup' ;;\n      esac\n    ;;\n  esac\n    if test \"$lt_cv_apple_cc_single_mod\" = \"yes\"; then\n      _lt_dar_single_mod='$single_module'\n    fi\n    if test \"$lt_cv_ld_exported_symbols_list\" = \"yes\"; then\n      _lt_dar_export_syms=' ${wl}-exported_symbols_list,$output_objdir/${libname}-symbols.expsym'\n    else\n      _lt_dar_export_syms='~$NMEDIT -s $output_objdir/${libname}-symbols.expsym ${lib}'\n    fi\n    if test \"$DSYMUTIL\" != \":\" && test \"$lt_cv_ld_force_load\" = \"no\"; then\n      _lt_dsymutil='~$DSYMUTIL $lib || :'\n    else\n      _lt_dsymutil=\n    fi\n    ;;\n  esac\n\nac_ext=c\nac_cpp='$CPP $CPPFLAGS'\nac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5'\nac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5'\nac_compiler_gnu=$ac_cv_c_compiler_gnu\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking how to run the C preprocessor\" >&5\n$as_echo_n \"checking how to run the C preprocessor... \" >&6; }\n# On Suns, sometimes $CPP names a directory.\nif test -n \"$CPP\" && test -d \"$CPP\"; then\n  CPP=\nfi\nif test -z \"$CPP\"; then\n  if ${ac_cv_prog_CPP+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n      # Double quotes because CPP needs to be expanded\n    for CPP in \"$CC -E\" \"$CC -E -traditional-cpp\" \"/lib/cpp\"\n    do\n      ac_preproc_ok=false\nfor ac_c_preproc_warn_flag in '' yes\ndo\n  # Use a header file that comes with gcc, so configuring glibc\n  # with a fresh cross-compiler works.\n  # Prefer <limits.h> to <assert.h> if __STDC__ is defined, since\n  # <limits.h> exists even on freestanding compilers.\n  # On the NeXT, cc -E runs the code through the compiler's parser,\n  # not just through cpp. \"Syntax error\" is here to catch this case.\n  cat confdefs.h - <<_ACEOF >conftest.$ac_ext\n/* end confdefs.h.  */\n#ifdef __STDC__\n# include <limits.h>\n#else\n# include <assert.h>\n#endif\n\t\t     Syntax error\n_ACEOF\nif ac_fn_c_try_cpp \"$LINENO\"; then :\n\nelse\n  # Broken: fails on valid input.\ncontinue\nfi\nrm -f conftest.err conftest.i conftest.$ac_ext\n\n  # OK, works on sane cases.  Now check whether nonexistent headers\n  # can be detected and how.\n  cat confdefs.h - <<_ACEOF >conftest.$ac_ext\n/* end confdefs.h.  */\n#include <ac_nonexistent.h>\n_ACEOF\nif ac_fn_c_try_cpp \"$LINENO\"; then :\n  # Broken: success on invalid input.\ncontinue\nelse\n  # Passes both tests.\nac_preproc_ok=:\nbreak\nfi\nrm -f conftest.err conftest.i conftest.$ac_ext\n\ndone\n# Because of `break', _AC_PREPROC_IFELSE's cleaning code was skipped.\nrm -f conftest.i conftest.err conftest.$ac_ext\nif $ac_preproc_ok; then :\n  break\nfi\n\n    done\n    ac_cv_prog_CPP=$CPP\n\nfi\n  CPP=$ac_cv_prog_CPP\nelse\n  ac_cv_prog_CPP=$CPP\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $CPP\" >&5\n$as_echo \"$CPP\" >&6; }\nac_preproc_ok=false\nfor ac_c_preproc_warn_flag in '' yes\ndo\n  # Use a header file that comes with gcc, so configuring glibc\n  # with a fresh cross-compiler works.\n  # Prefer <limits.h> to <assert.h> if __STDC__ is defined, since\n  # <limits.h> exists even on freestanding compilers.\n  # On the NeXT, cc -E runs the code through the compiler's parser,\n  # not just through cpp. \"Syntax error\" is here to catch this case.\n  cat confdefs.h - <<_ACEOF >conftest.$ac_ext\n/* end confdefs.h.  */\n#ifdef __STDC__\n# include <limits.h>\n#else\n# include <assert.h>\n#endif\n\t\t     Syntax error\n_ACEOF\nif ac_fn_c_try_cpp \"$LINENO\"; then :\n\nelse\n  # Broken: fails on valid input.\ncontinue\nfi\nrm -f conftest.err conftest.i conftest.$ac_ext\n\n  # OK, works on sane cases.  Now check whether nonexistent headers\n  # can be detected and how.\n  cat confdefs.h - <<_ACEOF >conftest.$ac_ext\n/* end confdefs.h.  */\n#include <ac_nonexistent.h>\n_ACEOF\nif ac_fn_c_try_cpp \"$LINENO\"; then :\n  # Broken: success on invalid input.\ncontinue\nelse\n  # Passes both tests.\nac_preproc_ok=:\nbreak\nfi\nrm -f conftest.err conftest.i conftest.$ac_ext\n\ndone\n# Because of `break', _AC_PREPROC_IFELSE's cleaning code was skipped.\nrm -f conftest.i conftest.err conftest.$ac_ext\nif $ac_preproc_ok; then :\n\nelse\n  { { $as_echo \"$as_me:${as_lineno-$LINENO}: error: in \\`$ac_pwd':\" >&5\n$as_echo \"$as_me: error: in \\`$ac_pwd':\" >&2;}\nas_fn_error $? \"C preprocessor \\\"$CPP\\\" fails sanity check\nSee \\`config.log' for more details\" \"$LINENO\" 5; }\nfi\n\nac_ext=c\nac_cpp='$CPP $CPPFLAGS'\nac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5'\nac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5'\nac_compiler_gnu=$ac_cv_c_compiler_gnu\n\n\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for ANSI C header files\" >&5\n$as_echo_n \"checking for ANSI C header files... \" >&6; }\nif ${ac_cv_header_stdc+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  cat confdefs.h - <<_ACEOF >conftest.$ac_ext\n/* end confdefs.h.  */\n#include <stdlib.h>\n#include <stdarg.h>\n#include <string.h>\n#include <float.h>\n\nint\nmain ()\n{\n\n  ;\n  return 0;\n}\n_ACEOF\nif ac_fn_c_try_compile \"$LINENO\"; then :\n  ac_cv_header_stdc=yes\nelse\n  ac_cv_header_stdc=no\nfi\nrm -f core conftest.err conftest.$ac_objext conftest.$ac_ext\n\nif test $ac_cv_header_stdc = yes; then\n  # SunOS 4.x string.h does not declare mem*, contrary to ANSI.\n  cat confdefs.h - <<_ACEOF >conftest.$ac_ext\n/* end confdefs.h.  */\n#include <string.h>\n\n_ACEOF\nif (eval \"$ac_cpp conftest.$ac_ext\") 2>&5 |\n  $EGREP \"memchr\" >/dev/null 2>&1; then :\n\nelse\n  ac_cv_header_stdc=no\nfi\nrm -f conftest*\n\nfi\n\nif test $ac_cv_header_stdc = yes; then\n  # ISC 2.0.2 stdlib.h does not declare free, contrary to ANSI.\n  cat confdefs.h - <<_ACEOF >conftest.$ac_ext\n/* end confdefs.h.  */\n#include <stdlib.h>\n\n_ACEOF\nif (eval \"$ac_cpp conftest.$ac_ext\") 2>&5 |\n  $EGREP \"free\" >/dev/null 2>&1; then :\n\nelse\n  ac_cv_header_stdc=no\nfi\nrm -f conftest*\n\nfi\n\nif test $ac_cv_header_stdc = yes; then\n  # /bin/cc in Irix-4.0.5 gets non-ANSI ctype macros unless using -ansi.\n  if test \"$cross_compiling\" = yes; then :\n  :\nelse\n  cat confdefs.h - <<_ACEOF >conftest.$ac_ext\n/* end confdefs.h.  */\n#include <ctype.h>\n#include <stdlib.h>\n#if ((' ' & 0x0FF) == 0x020)\n# define ISLOWER(c) ('a' <= (c) && (c) <= 'z')\n# define TOUPPER(c) (ISLOWER(c) ? 'A' + ((c) - 'a') : (c))\n#else\n# define ISLOWER(c) \\\n\t\t   (('a' <= (c) && (c) <= 'i') \\\n\t\t     || ('j' <= (c) && (c) <= 'r') \\\n\t\t     || ('s' <= (c) && (c) <= 'z'))\n# define TOUPPER(c) (ISLOWER(c) ? ((c) | 0x40) : (c))\n#endif\n\n#define XOR(e, f) (((e) && !(f)) || (!(e) && (f)))\nint\nmain ()\n{\n  int i;\n  for (i = 0; i < 256; i++)\n    if (XOR (islower (i), ISLOWER (i))\n\t|| toupper (i) != TOUPPER (i))\n      return 2;\n  return 0;\n}\n_ACEOF\nif ac_fn_c_try_run \"$LINENO\"; then :\n\nelse\n  ac_cv_header_stdc=no\nfi\nrm -f core *.core core.conftest.* gmon.out bb.out conftest$ac_exeext \\\n  conftest.$ac_objext conftest.beam conftest.$ac_ext\nfi\n\nfi\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $ac_cv_header_stdc\" >&5\n$as_echo \"$ac_cv_header_stdc\" >&6; }\nif test $ac_cv_header_stdc = yes; then\n\n$as_echo \"#define STDC_HEADERS 1\" >>confdefs.h\n\nfi\n\n# On IRIX 5.3, sys/types and inttypes.h are conflicting.\nfor ac_header in sys/types.h sys/stat.h stdlib.h string.h memory.h strings.h \\\n\t\t  inttypes.h stdint.h unistd.h\ndo :\n  as_ac_Header=`$as_echo \"ac_cv_header_$ac_header\" | $as_tr_sh`\nac_fn_c_check_header_compile \"$LINENO\" \"$ac_header\" \"$as_ac_Header\" \"$ac_includes_default\n\"\nif eval test \\\"x\\$\"$as_ac_Header\"\\\" = x\"yes\"; then :\n  cat >>confdefs.h <<_ACEOF\n#define `$as_echo \"HAVE_$ac_header\" | $as_tr_cpp` 1\n_ACEOF\n\nfi\n\ndone\n\n\nfor ac_header in dlfcn.h\ndo :\n  ac_fn_c_check_header_compile \"$LINENO\" \"dlfcn.h\" \"ac_cv_header_dlfcn_h\" \"$ac_includes_default\n\"\nif test \"x$ac_cv_header_dlfcn_h\" = xyes; then :\n  cat >>confdefs.h <<_ACEOF\n#define HAVE_DLFCN_H 1\n_ACEOF\n\nfi\n\ndone\n\n\n\n\nfunc_stripname_cnf ()\n{\n  case ${2} in\n  .*) func_stripname_result=`$ECHO \"${3}\" | $SED \"s%^${1}%%; s%\\\\\\\\${2}\\$%%\"`;;\n  *)  func_stripname_result=`$ECHO \"${3}\" | $SED \"s%^${1}%%; s%${2}\\$%%\"`;;\n  esac\n} # func_stripname_cnf\n\n\n\n\n\n# Set options\n\n\n\n        enable_dlopen=no\n\n\n  enable_win32_dll=no\n\n\n            # Check whether --enable-shared was given.\nif test \"${enable_shared+set}\" = set; then :\n  enableval=$enable_shared; p=${PACKAGE-default}\n    case $enableval in\n    yes) enable_shared=yes ;;\n    no) enable_shared=no ;;\n    *)\n      enable_shared=no\n      # Look at the argument we got.  We use all the common list separators.\n      lt_save_ifs=\"$IFS\"; IFS=\"${IFS}$PATH_SEPARATOR,\"\n      for pkg in $enableval; do\n\tIFS=\"$lt_save_ifs\"\n\tif test \"X$pkg\" = \"X$p\"; then\n\t  enable_shared=yes\n\tfi\n      done\n      IFS=\"$lt_save_ifs\"\n      ;;\n    esac\nelse\n  enable_shared=yes\nfi\n\n\n\n\n\n\n\n\n\n\n\n# Check whether --with-pic was given.\nif test \"${with_pic+set}\" = set; then :\n  withval=$with_pic; lt_p=${PACKAGE-default}\n    case $withval in\n    yes|no) pic_mode=$withval ;;\n    *)\n      pic_mode=default\n      # Look at the argument we got.  We use all the common list separators.\n      lt_save_ifs=\"$IFS\"; IFS=\"${IFS}$PATH_SEPARATOR,\"\n      for lt_pkg in $withval; do\n\tIFS=\"$lt_save_ifs\"\n\tif test \"X$lt_pkg\" = \"X$lt_p\"; then\n\t  pic_mode=yes\n\tfi\n      done\n      IFS=\"$lt_save_ifs\"\n      ;;\n    esac\nelse\n  pic_mode=default\nfi\n\n\ntest -z \"$pic_mode\" && pic_mode=default\n\n\n\n\n\n\n\n  # Check whether --enable-fast-install was given.\nif test \"${enable_fast_install+set}\" = set; then :\n  enableval=$enable_fast_install; p=${PACKAGE-default}\n    case $enableval in\n    yes) enable_fast_install=yes ;;\n    no) enable_fast_install=no ;;\n    *)\n      enable_fast_install=no\n      # Look at the argument we got.  We use all the common list separators.\n      lt_save_ifs=\"$IFS\"; IFS=\"${IFS}$PATH_SEPARATOR,\"\n      for pkg in $enableval; do\n\tIFS=\"$lt_save_ifs\"\n\tif test \"X$pkg\" = \"X$p\"; then\n\t  enable_fast_install=yes\n\tfi\n      done\n      IFS=\"$lt_save_ifs\"\n      ;;\n    esac\nelse\n  enable_fast_install=yes\nfi\n\n\n\n\n\n\n\n\n\n\n\n# This can be used to rebuild libtool when needed\nLIBTOOL_DEPS=\"$ltmain\"\n\n# Always use our own libtool.\nLIBTOOL='$(SHELL) $(top_builddir)/libtool'\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\ntest -z \"$LN_S\" && LN_S=\"ln -s\"\n\n\n\n\n\n\n\n\n\n\n\n\n\n\nif test -n \"${ZSH_VERSION+set}\" ; then\n   setopt NO_GLOB_SUBST\nfi\n\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for objdir\" >&5\n$as_echo_n \"checking for objdir... \" >&6; }\nif ${lt_cv_objdir+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  rm -f .libs 2>/dev/null\nmkdir .libs 2>/dev/null\nif test -d .libs; then\n  lt_cv_objdir=.libs\nelse\n  # MS-DOS does not allow filenames that begin with a dot.\n  lt_cv_objdir=_libs\nfi\nrmdir .libs 2>/dev/null\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $lt_cv_objdir\" >&5\n$as_echo \"$lt_cv_objdir\" >&6; }\nobjdir=$lt_cv_objdir\n\n\n\n\n\ncat >>confdefs.h <<_ACEOF\n#define LT_OBJDIR \"$lt_cv_objdir/\"\n_ACEOF\n\n\n\n\ncase $host_os in\naix3*)\n  # AIX sometimes has problems with the GCC collect2 program.  For some\n  # reason, if we set the COLLECT_NAMES environment variable, the problems\n  # vanish in a puff of smoke.\n  if test \"X${COLLECT_NAMES+set}\" != Xset; then\n    COLLECT_NAMES=\n    export COLLECT_NAMES\n  fi\n  ;;\nesac\n\n# Global variables:\nofile=libtool\ncan_build_shared=yes\n\n# All known linkers require a `.a' archive for static linking (except MSVC,\n# which needs '.lib').\nlibext=a\n\nwith_gnu_ld=\"$lt_cv_prog_gnu_ld\"\n\nold_CC=\"$CC\"\nold_CFLAGS=\"$CFLAGS\"\n\n# Set sane defaults for various variables\ntest -z \"$CC\" && CC=cc\ntest -z \"$LTCC\" && LTCC=$CC\ntest -z \"$LTCFLAGS\" && LTCFLAGS=$CFLAGS\ntest -z \"$LD\" && LD=ld\ntest -z \"$ac_objext\" && ac_objext=o\n\nfor cc_temp in $compiler\"\"; do\n  case $cc_temp in\n    compile | *[\\\\/]compile | ccache | *[\\\\/]ccache ) ;;\n    distcc | *[\\\\/]distcc | purify | *[\\\\/]purify ) ;;\n    \\-*) ;;\n    *) break;;\n  esac\ndone\ncc_basename=`$ECHO \"$cc_temp\" | $SED \"s%.*/%%; s%^$host_alias-%%\"`\n\n\n# Only perform the check for file, if the check method requires it\ntest -z \"$MAGIC_CMD\" && MAGIC_CMD=file\ncase $deplibs_check_method in\nfile_magic*)\n  if test \"$file_magic_cmd\" = '$MAGIC_CMD'; then\n    { $as_echo \"$as_me:${as_lineno-$LINENO}: checking for ${ac_tool_prefix}file\" >&5\n$as_echo_n \"checking for ${ac_tool_prefix}file... \" >&6; }\nif ${lt_cv_path_MAGIC_CMD+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  case $MAGIC_CMD in\n[\\\\/*] |  ?:[\\\\/]*)\n  lt_cv_path_MAGIC_CMD=\"$MAGIC_CMD\" # Let the user override the test with a path.\n  ;;\n*)\n  lt_save_MAGIC_CMD=\"$MAGIC_CMD\"\n  lt_save_ifs=\"$IFS\"; IFS=$PATH_SEPARATOR\n  ac_dummy=\"/usr/bin$PATH_SEPARATOR$PATH\"\n  for ac_dir in $ac_dummy; do\n    IFS=\"$lt_save_ifs\"\n    test -z \"$ac_dir\" && ac_dir=.\n    if test -f $ac_dir/${ac_tool_prefix}file; then\n      lt_cv_path_MAGIC_CMD=\"$ac_dir/${ac_tool_prefix}file\"\n      if test -n \"$file_magic_test_file\"; then\n\tcase $deplibs_check_method in\n\t\"file_magic \"*)\n\t  file_magic_regex=`expr \"$deplibs_check_method\" : \"file_magic \\(.*\\)\"`\n\t  MAGIC_CMD=\"$lt_cv_path_MAGIC_CMD\"\n\t  if eval $file_magic_cmd \\$file_magic_test_file 2> /dev/null |\n\t    $EGREP \"$file_magic_regex\" > /dev/null; then\n\t    :\n\t  else\n\t    cat <<_LT_EOF 1>&2\n\n*** Warning: the command libtool uses to detect shared libraries,\n*** $file_magic_cmd, produces output that libtool cannot recognize.\n*** The result is that libtool may fail to recognize shared libraries\n*** as such.  This will affect the creation of libtool libraries that\n*** depend on shared libraries, but programs linked with such libtool\n*** libraries will work regardless of this problem.  Nevertheless, you\n*** may want to report the problem to your system manager and/or to\n*** bug-libtool@gnu.org\n\n_LT_EOF\n\t  fi ;;\n\tesac\n      fi\n      break\n    fi\n  done\n  IFS=\"$lt_save_ifs\"\n  MAGIC_CMD=\"$lt_save_MAGIC_CMD\"\n  ;;\nesac\nfi\n\nMAGIC_CMD=\"$lt_cv_path_MAGIC_CMD\"\nif test -n \"$MAGIC_CMD\"; then\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: $MAGIC_CMD\" >&5\n$as_echo \"$MAGIC_CMD\" >&6; }\nelse\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: no\" >&5\n$as_echo \"no\" >&6; }\nfi\n\n\n\n\n\nif test -z \"$lt_cv_path_MAGIC_CMD\"; then\n  if test -n \"$ac_tool_prefix\"; then\n    { $as_echo \"$as_me:${as_lineno-$LINENO}: checking for file\" >&5\n$as_echo_n \"checking for file... \" >&6; }\nif ${lt_cv_path_MAGIC_CMD+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  case $MAGIC_CMD in\n[\\\\/*] |  ?:[\\\\/]*)\n  lt_cv_path_MAGIC_CMD=\"$MAGIC_CMD\" # Let the user override the test with a path.\n  ;;\n*)\n  lt_save_MAGIC_CMD=\"$MAGIC_CMD\"\n  lt_save_ifs=\"$IFS\"; IFS=$PATH_SEPARATOR\n  ac_dummy=\"/usr/bin$PATH_SEPARATOR$PATH\"\n  for ac_dir in $ac_dummy; do\n    IFS=\"$lt_save_ifs\"\n    test -z \"$ac_dir\" && ac_dir=.\n    if test -f $ac_dir/file; then\n      lt_cv_path_MAGIC_CMD=\"$ac_dir/file\"\n      if test -n \"$file_magic_test_file\"; then\n\tcase $deplibs_check_method in\n\t\"file_magic \"*)\n\t  file_magic_regex=`expr \"$deplibs_check_method\" : \"file_magic \\(.*\\)\"`\n\t  MAGIC_CMD=\"$lt_cv_path_MAGIC_CMD\"\n\t  if eval $file_magic_cmd \\$file_magic_test_file 2> /dev/null |\n\t    $EGREP \"$file_magic_regex\" > /dev/null; then\n\t    :\n\t  else\n\t    cat <<_LT_EOF 1>&2\n\n*** Warning: the command libtool uses to detect shared libraries,\n*** $file_magic_cmd, produces output that libtool cannot recognize.\n*** The result is that libtool may fail to recognize shared libraries\n*** as such.  This will affect the creation of libtool libraries that\n*** depend on shared libraries, but programs linked with such libtool\n*** libraries will work regardless of this problem.  Nevertheless, you\n*** may want to report the problem to your system manager and/or to\n*** bug-libtool@gnu.org\n\n_LT_EOF\n\t  fi ;;\n\tesac\n      fi\n      break\n    fi\n  done\n  IFS=\"$lt_save_ifs\"\n  MAGIC_CMD=\"$lt_save_MAGIC_CMD\"\n  ;;\nesac\nfi\n\nMAGIC_CMD=\"$lt_cv_path_MAGIC_CMD\"\nif test -n \"$MAGIC_CMD\"; then\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: $MAGIC_CMD\" >&5\n$as_echo \"$MAGIC_CMD\" >&6; }\nelse\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: no\" >&5\n$as_echo \"no\" >&6; }\nfi\n\n\n  else\n    MAGIC_CMD=:\n  fi\nfi\n\n  fi\n  ;;\nesac\n\n# Use C for the default configuration in the libtool script\n\nlt_save_CC=\"$CC\"\nac_ext=c\nac_cpp='$CPP $CPPFLAGS'\nac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5'\nac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5'\nac_compiler_gnu=$ac_cv_c_compiler_gnu\n\n\n# Source file extension for C test sources.\nac_ext=c\n\n# Object file extension for compiled C test sources.\nobjext=o\nobjext=$objext\n\n# Code to be used in simple compile tests\nlt_simple_compile_test_code=\"int some_variable = 0;\"\n\n# Code to be used in simple link tests\nlt_simple_link_test_code='int main(){return(0);}'\n\n\n\n\n\n\n\n# If no C compiler was specified, use CC.\nLTCC=${LTCC-\"$CC\"}\n\n# If no C compiler flags were specified, use CFLAGS.\nLTCFLAGS=${LTCFLAGS-\"$CFLAGS\"}\n\n# Allow CC to be a program name with arguments.\ncompiler=$CC\n\n# Save the default compiler, since it gets overwritten when the other\n# tags are being tested, and _LT_TAGVAR(compiler, []) is a NOP.\ncompiler_DEFAULT=$CC\n\n# save warnings/boilerplate of simple test code\nac_outfile=conftest.$ac_objext\necho \"$lt_simple_compile_test_code\" >conftest.$ac_ext\neval \"$ac_compile\" 2>&1 >/dev/null | $SED '/^$/d; /^ *+/d' >conftest.err\n_lt_compiler_boilerplate=`cat conftest.err`\n$RM conftest*\n\nac_outfile=conftest.$ac_objext\necho \"$lt_simple_link_test_code\" >conftest.$ac_ext\neval \"$ac_link\" 2>&1 >/dev/null | $SED '/^$/d; /^ *+/d' >conftest.err\n_lt_linker_boilerplate=`cat conftest.err`\n$RM -r conftest*\n\n\n## CAVEAT EMPTOR:\n## There is no encapsulation within the following macros, do not change\n## the running order or otherwise move them around unless you know exactly\n## what you are doing...\nif test -n \"$compiler\"; then\n\nlt_prog_compiler_no_builtin_flag=\n\nif test \"$GCC\" = yes; then\n  case $cc_basename in\n  nvcc*)\n    lt_prog_compiler_no_builtin_flag=' -Xcompiler -fno-builtin' ;;\n  *)\n    lt_prog_compiler_no_builtin_flag=' -fno-builtin' ;;\n  esac\n\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: checking if $compiler supports -fno-rtti -fno-exceptions\" >&5\n$as_echo_n \"checking if $compiler supports -fno-rtti -fno-exceptions... \" >&6; }\nif ${lt_cv_prog_compiler_rtti_exceptions+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  lt_cv_prog_compiler_rtti_exceptions=no\n   ac_outfile=conftest.$ac_objext\n   echo \"$lt_simple_compile_test_code\" > conftest.$ac_ext\n   lt_compiler_flag=\"-fno-rtti -fno-exceptions\"\n   # Insert the option either (1) after the last *FLAGS variable, or\n   # (2) before a word containing \"conftest.\", or (3) at the end.\n   # Note that $ac_compile itself does not contain backslashes and begins\n   # with a dollar sign (not a hyphen), so the echo should work correctly.\n   # The option is referenced via a variable to avoid confusing sed.\n   lt_compile=`echo \"$ac_compile\" | $SED \\\n   -e 's:.*FLAGS}\\{0,1\\} :&$lt_compiler_flag :; t' \\\n   -e 's: [^ ]*conftest\\.: $lt_compiler_flag&:; t' \\\n   -e 's:$: $lt_compiler_flag:'`\n   (eval echo \"\\\"\\$as_me:$LINENO: $lt_compile\\\"\" >&5)\n   (eval \"$lt_compile\" 2>conftest.err)\n   ac_status=$?\n   cat conftest.err >&5\n   echo \"$as_me:$LINENO: \\$? = $ac_status\" >&5\n   if (exit $ac_status) && test -s \"$ac_outfile\"; then\n     # The compiler can only warn and ignore the option if not recognized\n     # So say no if there are warnings other than the usual output.\n     $ECHO \"$_lt_compiler_boilerplate\" | $SED '/^$/d' >conftest.exp\n     $SED '/^$/d; /^ *+/d' conftest.err >conftest.er2\n     if test ! -s conftest.er2 || diff conftest.exp conftest.er2 >/dev/null; then\n       lt_cv_prog_compiler_rtti_exceptions=yes\n     fi\n   fi\n   $RM conftest*\n\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $lt_cv_prog_compiler_rtti_exceptions\" >&5\n$as_echo \"$lt_cv_prog_compiler_rtti_exceptions\" >&6; }\n\nif test x\"$lt_cv_prog_compiler_rtti_exceptions\" = xyes; then\n    lt_prog_compiler_no_builtin_flag=\"$lt_prog_compiler_no_builtin_flag -fno-rtti -fno-exceptions\"\nelse\n    :\nfi\n\nfi\n\n\n\n\n\n\n  lt_prog_compiler_wl=\nlt_prog_compiler_pic=\nlt_prog_compiler_static=\n\n\n  if test \"$GCC\" = yes; then\n    lt_prog_compiler_wl='-Wl,'\n    lt_prog_compiler_static='-static'\n\n    case $host_os in\n      aix*)\n      # All AIX code is PIC.\n      if test \"$host_cpu\" = ia64; then\n\t# AIX 5 now supports IA64 processor\n\tlt_prog_compiler_static='-Bstatic'\n      fi\n      ;;\n\n    amigaos*)\n      case $host_cpu in\n      powerpc)\n            # see comment about AmigaOS4 .so support\n            lt_prog_compiler_pic='-fPIC'\n        ;;\n      m68k)\n            # FIXME: we need at least 68020 code to build shared libraries, but\n            # adding the `-m68020' flag to GCC prevents building anything better,\n            # like `-m68040'.\n            lt_prog_compiler_pic='-m68020 -resident32 -malways-restore-a4'\n        ;;\n      esac\n      ;;\n\n    beos* | irix5* | irix6* | nonstopux* | osf3* | osf4* | osf5*)\n      # PIC is the default for these OSes.\n      ;;\n\n    mingw* | cygwin* | pw32* | os2* | cegcc*)\n      # This hack is so that the source file can tell whether it is being\n      # built for inclusion in a dll (and should export symbols for example).\n      # Although the cygwin gcc ignores -fPIC, still need this for old-style\n      # (--disable-auto-import) libraries\n      lt_prog_compiler_pic='-DDLL_EXPORT'\n      ;;\n\n    darwin* | rhapsody*)\n      # PIC is the default on this platform\n      # Common symbols not allowed in MH_DYLIB files\n      lt_prog_compiler_pic='-fno-common'\n      ;;\n\n    haiku*)\n      # PIC is the default for Haiku.\n      # The \"-static\" flag exists, but is broken.\n      lt_prog_compiler_static=\n      ;;\n\n    hpux*)\n      # PIC is the default for 64-bit PA HP-UX, but not for 32-bit\n      # PA HP-UX.  On IA64 HP-UX, PIC is the default but the pic flag\n      # sets the default TLS model and affects inlining.\n      case $host_cpu in\n      hppa*64*)\n\t# +Z the default\n\t;;\n      *)\n\tlt_prog_compiler_pic='-fPIC'\n\t;;\n      esac\n      ;;\n\n    interix[3-9]*)\n      # Interix 3.x gcc -fpic/-fPIC options generate broken code.\n      # Instead, we relocate shared libraries at runtime.\n      ;;\n\n    msdosdjgpp*)\n      # Just because we use GCC doesn't mean we suddenly get shared libraries\n      # on systems that don't support them.\n      lt_prog_compiler_can_build_shared=no\n      enable_shared=no\n      ;;\n\n    *nto* | *qnx*)\n      # QNX uses GNU C++, but need to define -shared option too, otherwise\n      # it will coredump.\n      lt_prog_compiler_pic='-fPIC -shared'\n      ;;\n\n    sysv4*MP*)\n      if test -d /usr/nec; then\n\tlt_prog_compiler_pic=-Kconform_pic\n      fi\n      ;;\n\n    *)\n      lt_prog_compiler_pic='-fPIC'\n      ;;\n    esac\n\n    case $cc_basename in\n    nvcc*) # Cuda Compiler Driver 2.2\n      lt_prog_compiler_wl='-Xlinker '\n      if test -n \"$lt_prog_compiler_pic\"; then\n        lt_prog_compiler_pic=\"-Xcompiler $lt_prog_compiler_pic\"\n      fi\n      ;;\n    esac\n  else\n    # PORTME Check for flag to pass linker flags through the system compiler.\n    case $host_os in\n    aix*)\n      lt_prog_compiler_wl='-Wl,'\n      if test \"$host_cpu\" = ia64; then\n\t# AIX 5 now supports IA64 processor\n\tlt_prog_compiler_static='-Bstatic'\n      else\n\tlt_prog_compiler_static='-bnso -bI:/lib/syscalls.exp'\n      fi\n      ;;\n\n    mingw* | cygwin* | pw32* | os2* | cegcc*)\n      # This hack is so that the source file can tell whether it is being\n      # built for inclusion in a dll (and should export symbols for example).\n      lt_prog_compiler_pic='-DDLL_EXPORT'\n      ;;\n\n    hpux9* | hpux10* | hpux11*)\n      lt_prog_compiler_wl='-Wl,'\n      # PIC is the default for IA64 HP-UX and 64-bit HP-UX, but\n      # not for PA HP-UX.\n      case $host_cpu in\n      hppa*64*|ia64*)\n\t# +Z the default\n\t;;\n      *)\n\tlt_prog_compiler_pic='+Z'\n\t;;\n      esac\n      # Is there a better lt_prog_compiler_static that works with the bundled CC?\n      lt_prog_compiler_static='${wl}-a ${wl}archive'\n      ;;\n\n    irix5* | irix6* | nonstopux*)\n      lt_prog_compiler_wl='-Wl,'\n      # PIC (with -KPIC) is the default.\n      lt_prog_compiler_static='-non_shared'\n      ;;\n\n    linux* | k*bsd*-gnu | kopensolaris*-gnu | gnu*)\n      case $cc_basename in\n      # old Intel for x86_64 which still supported -KPIC.\n      ecc*)\n\tlt_prog_compiler_wl='-Wl,'\n\tlt_prog_compiler_pic='-KPIC'\n\tlt_prog_compiler_static='-static'\n        ;;\n      # icc used to be incompatible with GCC.\n      # ICC 10 doesn't accept -KPIC any more.\n      icc* | ifort*)\n\tlt_prog_compiler_wl='-Wl,'\n\tlt_prog_compiler_pic='-fPIC'\n\tlt_prog_compiler_static='-static'\n        ;;\n      # Lahey Fortran 8.1.\n      lf95*)\n\tlt_prog_compiler_wl='-Wl,'\n\tlt_prog_compiler_pic='--shared'\n\tlt_prog_compiler_static='--static'\n\t;;\n      nagfor*)\n\t# NAG Fortran compiler\n\tlt_prog_compiler_wl='-Wl,-Wl,,'\n\tlt_prog_compiler_pic='-PIC'\n\tlt_prog_compiler_static='-Bstatic'\n\t;;\n      pgcc* | pgf77* | pgf90* | pgf95* | pgfortran*)\n        # Portland Group compilers (*not* the Pentium gcc compiler,\n\t# which looks to be a dead project)\n\tlt_prog_compiler_wl='-Wl,'\n\tlt_prog_compiler_pic='-fpic'\n\tlt_prog_compiler_static='-Bstatic'\n        ;;\n      ccc*)\n        lt_prog_compiler_wl='-Wl,'\n        # All Alpha code is PIC.\n        lt_prog_compiler_static='-non_shared'\n        ;;\n      xl* | bgxl* | bgf* | mpixl*)\n\t# IBM XL C 8.0/Fortran 10.1, 11.1 on PPC and BlueGene\n\tlt_prog_compiler_wl='-Wl,'\n\tlt_prog_compiler_pic='-qpic'\n\tlt_prog_compiler_static='-qstaticlink'\n\t;;\n      *)\n\tcase `$CC -V 2>&1 | sed 5q` in\n\t*Sun\\ Ceres\\ Fortran* | *Sun*Fortran*\\ [1-7].* | *Sun*Fortran*\\ 8.[0-3]*)\n\t  # Sun Fortran 8.3 passes all unrecognized flags to the linker\n\t  lt_prog_compiler_pic='-KPIC'\n\t  lt_prog_compiler_static='-Bstatic'\n\t  lt_prog_compiler_wl=''\n\t  ;;\n\t*Sun\\ F* | *Sun*Fortran*)\n\t  lt_prog_compiler_pic='-KPIC'\n\t  lt_prog_compiler_static='-Bstatic'\n\t  lt_prog_compiler_wl='-Qoption ld '\n\t  ;;\n\t*Sun\\ C*)\n\t  # Sun C 5.9\n\t  lt_prog_compiler_pic='-KPIC'\n\t  lt_prog_compiler_static='-Bstatic'\n\t  lt_prog_compiler_wl='-Wl,'\n\t  ;;\n        *Intel*\\ [CF]*Compiler*)\n\t  lt_prog_compiler_wl='-Wl,'\n\t  lt_prog_compiler_pic='-fPIC'\n\t  lt_prog_compiler_static='-static'\n\t  ;;\n\t*Portland\\ Group*)\n\t  lt_prog_compiler_wl='-Wl,'\n\t  lt_prog_compiler_pic='-fpic'\n\t  lt_prog_compiler_static='-Bstatic'\n\t  ;;\n\tesac\n\t;;\n      esac\n      ;;\n\n    newsos6)\n      lt_prog_compiler_pic='-KPIC'\n      lt_prog_compiler_static='-Bstatic'\n      ;;\n\n    *nto* | *qnx*)\n      # QNX uses GNU C++, but need to define -shared option too, otherwise\n      # it will coredump.\n      lt_prog_compiler_pic='-fPIC -shared'\n      ;;\n\n    osf3* | osf4* | osf5*)\n      lt_prog_compiler_wl='-Wl,'\n      # All OSF/1 code is PIC.\n      lt_prog_compiler_static='-non_shared'\n      ;;\n\n    rdos*)\n      lt_prog_compiler_static='-non_shared'\n      ;;\n\n    solaris*)\n      lt_prog_compiler_pic='-KPIC'\n      lt_prog_compiler_static='-Bstatic'\n      case $cc_basename in\n      f77* | f90* | f95* | sunf77* | sunf90* | sunf95*)\n\tlt_prog_compiler_wl='-Qoption ld ';;\n      *)\n\tlt_prog_compiler_wl='-Wl,';;\n      esac\n      ;;\n\n    sunos4*)\n      lt_prog_compiler_wl='-Qoption ld '\n      lt_prog_compiler_pic='-PIC'\n      lt_prog_compiler_static='-Bstatic'\n      ;;\n\n    sysv4 | sysv4.2uw2* | sysv4.3*)\n      lt_prog_compiler_wl='-Wl,'\n      lt_prog_compiler_pic='-KPIC'\n      lt_prog_compiler_static='-Bstatic'\n      ;;\n\n    sysv4*MP*)\n      if test -d /usr/nec ;then\n\tlt_prog_compiler_pic='-Kconform_pic'\n\tlt_prog_compiler_static='-Bstatic'\n      fi\n      ;;\n\n    sysv5* | unixware* | sco3.2v5* | sco5v6* | OpenUNIX*)\n      lt_prog_compiler_wl='-Wl,'\n      lt_prog_compiler_pic='-KPIC'\n      lt_prog_compiler_static='-Bstatic'\n      ;;\n\n    unicos*)\n      lt_prog_compiler_wl='-Wl,'\n      lt_prog_compiler_can_build_shared=no\n      ;;\n\n    uts4*)\n      lt_prog_compiler_pic='-pic'\n      lt_prog_compiler_static='-Bstatic'\n      ;;\n\n    *)\n      lt_prog_compiler_can_build_shared=no\n      ;;\n    esac\n  fi\n\ncase $host_os in\n  # For platforms which do not support PIC, -DPIC is meaningless:\n  *djgpp*)\n    lt_prog_compiler_pic=\n    ;;\n  *)\n    lt_prog_compiler_pic=\"$lt_prog_compiler_pic -DPIC\"\n    ;;\nesac\n\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for $compiler option to produce PIC\" >&5\n$as_echo_n \"checking for $compiler option to produce PIC... \" >&6; }\nif ${lt_cv_prog_compiler_pic+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  lt_cv_prog_compiler_pic=$lt_prog_compiler_pic\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $lt_cv_prog_compiler_pic\" >&5\n$as_echo \"$lt_cv_prog_compiler_pic\" >&6; }\nlt_prog_compiler_pic=$lt_cv_prog_compiler_pic\n\n#\n# Check to make sure the PIC flag actually works.\n#\nif test -n \"$lt_prog_compiler_pic\"; then\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: checking if $compiler PIC flag $lt_prog_compiler_pic works\" >&5\n$as_echo_n \"checking if $compiler PIC flag $lt_prog_compiler_pic works... \" >&6; }\nif ${lt_cv_prog_compiler_pic_works+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  lt_cv_prog_compiler_pic_works=no\n   ac_outfile=conftest.$ac_objext\n   echo \"$lt_simple_compile_test_code\" > conftest.$ac_ext\n   lt_compiler_flag=\"$lt_prog_compiler_pic -DPIC\"\n   # Insert the option either (1) after the last *FLAGS variable, or\n   # (2) before a word containing \"conftest.\", or (3) at the end.\n   # Note that $ac_compile itself does not contain backslashes and begins\n   # with a dollar sign (not a hyphen), so the echo should work correctly.\n   # The option is referenced via a variable to avoid confusing sed.\n   lt_compile=`echo \"$ac_compile\" | $SED \\\n   -e 's:.*FLAGS}\\{0,1\\} :&$lt_compiler_flag :; t' \\\n   -e 's: [^ ]*conftest\\.: $lt_compiler_flag&:; t' \\\n   -e 's:$: $lt_compiler_flag:'`\n   (eval echo \"\\\"\\$as_me:$LINENO: $lt_compile\\\"\" >&5)\n   (eval \"$lt_compile\" 2>conftest.err)\n   ac_status=$?\n   cat conftest.err >&5\n   echo \"$as_me:$LINENO: \\$? = $ac_status\" >&5\n   if (exit $ac_status) && test -s \"$ac_outfile\"; then\n     # The compiler can only warn and ignore the option if not recognized\n     # So say no if there are warnings other than the usual output.\n     $ECHO \"$_lt_compiler_boilerplate\" | $SED '/^$/d' >conftest.exp\n     $SED '/^$/d; /^ *+/d' conftest.err >conftest.er2\n     if test ! -s conftest.er2 || diff conftest.exp conftest.er2 >/dev/null; then\n       lt_cv_prog_compiler_pic_works=yes\n     fi\n   fi\n   $RM conftest*\n\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $lt_cv_prog_compiler_pic_works\" >&5\n$as_echo \"$lt_cv_prog_compiler_pic_works\" >&6; }\n\nif test x\"$lt_cv_prog_compiler_pic_works\" = xyes; then\n    case $lt_prog_compiler_pic in\n     \"\" | \" \"*) ;;\n     *) lt_prog_compiler_pic=\" $lt_prog_compiler_pic\" ;;\n     esac\nelse\n    lt_prog_compiler_pic=\n     lt_prog_compiler_can_build_shared=no\nfi\n\nfi\n\n\n\n\n\n\n\n\n\n\n\n#\n# Check to make sure the static flag actually works.\n#\nwl=$lt_prog_compiler_wl eval lt_tmp_static_flag=\\\"$lt_prog_compiler_static\\\"\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking if $compiler static flag $lt_tmp_static_flag works\" >&5\n$as_echo_n \"checking if $compiler static flag $lt_tmp_static_flag works... \" >&6; }\nif ${lt_cv_prog_compiler_static_works+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  lt_cv_prog_compiler_static_works=no\n   save_LDFLAGS=\"$LDFLAGS\"\n   LDFLAGS=\"$LDFLAGS $lt_tmp_static_flag\"\n   echo \"$lt_simple_link_test_code\" > conftest.$ac_ext\n   if (eval $ac_link 2>conftest.err) && test -s conftest$ac_exeext; then\n     # The linker can only warn and ignore the option if not recognized\n     # So say no if there are warnings\n     if test -s conftest.err; then\n       # Append any errors to the config.log.\n       cat conftest.err 1>&5\n       $ECHO \"$_lt_linker_boilerplate\" | $SED '/^$/d' > conftest.exp\n       $SED '/^$/d; /^ *+/d' conftest.err >conftest.er2\n       if diff conftest.exp conftest.er2 >/dev/null; then\n         lt_cv_prog_compiler_static_works=yes\n       fi\n     else\n       lt_cv_prog_compiler_static_works=yes\n     fi\n   fi\n   $RM -r conftest*\n   LDFLAGS=\"$save_LDFLAGS\"\n\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $lt_cv_prog_compiler_static_works\" >&5\n$as_echo \"$lt_cv_prog_compiler_static_works\" >&6; }\n\nif test x\"$lt_cv_prog_compiler_static_works\" = xyes; then\n    :\nelse\n    lt_prog_compiler_static=\nfi\n\n\n\n\n\n\n\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: checking if $compiler supports -c -o file.$ac_objext\" >&5\n$as_echo_n \"checking if $compiler supports -c -o file.$ac_objext... \" >&6; }\nif ${lt_cv_prog_compiler_c_o+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  lt_cv_prog_compiler_c_o=no\n   $RM -r conftest 2>/dev/null\n   mkdir conftest\n   cd conftest\n   mkdir out\n   echo \"$lt_simple_compile_test_code\" > conftest.$ac_ext\n\n   lt_compiler_flag=\"-o out/conftest2.$ac_objext\"\n   # Insert the option either (1) after the last *FLAGS variable, or\n   # (2) before a word containing \"conftest.\", or (3) at the end.\n   # Note that $ac_compile itself does not contain backslashes and begins\n   # with a dollar sign (not a hyphen), so the echo should work correctly.\n   lt_compile=`echo \"$ac_compile\" | $SED \\\n   -e 's:.*FLAGS}\\{0,1\\} :&$lt_compiler_flag :; t' \\\n   -e 's: [^ ]*conftest\\.: $lt_compiler_flag&:; t' \\\n   -e 's:$: $lt_compiler_flag:'`\n   (eval echo \"\\\"\\$as_me:$LINENO: $lt_compile\\\"\" >&5)\n   (eval \"$lt_compile\" 2>out/conftest.err)\n   ac_status=$?\n   cat out/conftest.err >&5\n   echo \"$as_me:$LINENO: \\$? = $ac_status\" >&5\n   if (exit $ac_status) && test -s out/conftest2.$ac_objext\n   then\n     # The compiler can only warn and ignore the option if not recognized\n     # So say no if there are warnings\n     $ECHO \"$_lt_compiler_boilerplate\" | $SED '/^$/d' > out/conftest.exp\n     $SED '/^$/d; /^ *+/d' out/conftest.err >out/conftest.er2\n     if test ! -s out/conftest.er2 || diff out/conftest.exp out/conftest.er2 >/dev/null; then\n       lt_cv_prog_compiler_c_o=yes\n     fi\n   fi\n   chmod u+w . 2>&5\n   $RM conftest*\n   # SGI C++ compiler will create directory out/ii_files/ for\n   # template instantiation\n   test -d out/ii_files && $RM out/ii_files/* && rmdir out/ii_files\n   $RM out/* && rmdir out\n   cd ..\n   $RM -r conftest\n   $RM conftest*\n\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $lt_cv_prog_compiler_c_o\" >&5\n$as_echo \"$lt_cv_prog_compiler_c_o\" >&6; }\n\n\n\n\n\n\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: checking if $compiler supports -c -o file.$ac_objext\" >&5\n$as_echo_n \"checking if $compiler supports -c -o file.$ac_objext... \" >&6; }\nif ${lt_cv_prog_compiler_c_o+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  lt_cv_prog_compiler_c_o=no\n   $RM -r conftest 2>/dev/null\n   mkdir conftest\n   cd conftest\n   mkdir out\n   echo \"$lt_simple_compile_test_code\" > conftest.$ac_ext\n\n   lt_compiler_flag=\"-o out/conftest2.$ac_objext\"\n   # Insert the option either (1) after the last *FLAGS variable, or\n   # (2) before a word containing \"conftest.\", or (3) at the end.\n   # Note that $ac_compile itself does not contain backslashes and begins\n   # with a dollar sign (not a hyphen), so the echo should work correctly.\n   lt_compile=`echo \"$ac_compile\" | $SED \\\n   -e 's:.*FLAGS}\\{0,1\\} :&$lt_compiler_flag :; t' \\\n   -e 's: [^ ]*conftest\\.: $lt_compiler_flag&:; t' \\\n   -e 's:$: $lt_compiler_flag:'`\n   (eval echo \"\\\"\\$as_me:$LINENO: $lt_compile\\\"\" >&5)\n   (eval \"$lt_compile\" 2>out/conftest.err)\n   ac_status=$?\n   cat out/conftest.err >&5\n   echo \"$as_me:$LINENO: \\$? = $ac_status\" >&5\n   if (exit $ac_status) && test -s out/conftest2.$ac_objext\n   then\n     # The compiler can only warn and ignore the option if not recognized\n     # So say no if there are warnings\n     $ECHO \"$_lt_compiler_boilerplate\" | $SED '/^$/d' > out/conftest.exp\n     $SED '/^$/d; /^ *+/d' out/conftest.err >out/conftest.er2\n     if test ! -s out/conftest.er2 || diff out/conftest.exp out/conftest.er2 >/dev/null; then\n       lt_cv_prog_compiler_c_o=yes\n     fi\n   fi\n   chmod u+w . 2>&5\n   $RM conftest*\n   # SGI C++ compiler will create directory out/ii_files/ for\n   # template instantiation\n   test -d out/ii_files && $RM out/ii_files/* && rmdir out/ii_files\n   $RM out/* && rmdir out\n   cd ..\n   $RM -r conftest\n   $RM conftest*\n\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $lt_cv_prog_compiler_c_o\" >&5\n$as_echo \"$lt_cv_prog_compiler_c_o\" >&6; }\n\n\n\n\nhard_links=\"nottested\"\nif test \"$lt_cv_prog_compiler_c_o\" = no && test \"$need_locks\" != no; then\n  # do not overwrite the value of need_locks provided by the user\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: checking if we can lock with hard links\" >&5\n$as_echo_n \"checking if we can lock with hard links... \" >&6; }\n  hard_links=yes\n  $RM conftest*\n  ln conftest.a conftest.b 2>/dev/null && hard_links=no\n  touch conftest.a\n  ln conftest.a conftest.b 2>&5 || hard_links=no\n  ln conftest.a conftest.b 2>/dev/null && hard_links=no\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: $hard_links\" >&5\n$as_echo \"$hard_links\" >&6; }\n  if test \"$hard_links\" = no; then\n    { $as_echo \"$as_me:${as_lineno-$LINENO}: WARNING: \\`$CC' does not support \\`-c -o', so \\`make -j' may be unsafe\" >&5\n$as_echo \"$as_me: WARNING: \\`$CC' does not support \\`-c -o', so \\`make -j' may be unsafe\" >&2;}\n    need_locks=warn\n  fi\nelse\n  need_locks=no\nfi\n\n\n\n\n\n\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: checking whether the $compiler linker ($LD) supports shared libraries\" >&5\n$as_echo_n \"checking whether the $compiler linker ($LD) supports shared libraries... \" >&6; }\n\n  runpath_var=\n  allow_undefined_flag=\n  always_export_symbols=no\n  archive_cmds=\n  archive_expsym_cmds=\n  compiler_needs_object=no\n  enable_shared_with_static_runtimes=no\n  export_dynamic_flag_spec=\n  export_symbols_cmds='$NM $libobjs $convenience | $global_symbol_pipe | $SED '\\''s/.* //'\\'' | sort | uniq > $export_symbols'\n  hardcode_automatic=no\n  hardcode_direct=no\n  hardcode_direct_absolute=no\n  hardcode_libdir_flag_spec=\n  hardcode_libdir_separator=\n  hardcode_minus_L=no\n  hardcode_shlibpath_var=unsupported\n  inherit_rpath=no\n  link_all_deplibs=unknown\n  module_cmds=\n  module_expsym_cmds=\n  old_archive_from_new_cmds=\n  old_archive_from_expsyms_cmds=\n  thread_safe_flag_spec=\n  whole_archive_flag_spec=\n  # include_expsyms should be a list of space-separated symbols to be *always*\n  # included in the symbol list\n  include_expsyms=\n  # exclude_expsyms can be an extended regexp of symbols to exclude\n  # it will be wrapped by ` (' and `)$', so one must not match beginning or\n  # end of line.  Example: `a|bc|.*d.*' will exclude the symbols `a' and `bc',\n  # as well as any symbol that contains `d'.\n  exclude_expsyms='_GLOBAL_OFFSET_TABLE_|_GLOBAL__F[ID]_.*'\n  # Although _GLOBAL_OFFSET_TABLE_ is a valid symbol C name, most a.out\n  # platforms (ab)use it in PIC code, but their linkers get confused if\n  # the symbol is explicitly referenced.  Since portable code cannot\n  # rely on this symbol name, it's probably fine to never include it in\n  # preloaded symbol tables.\n  # Exclude shared library initialization/finalization symbols.\n  extract_expsyms_cmds=\n\n  case $host_os in\n  cygwin* | mingw* | pw32* | cegcc*)\n    # FIXME: the MSVC++ port hasn't been tested in a loooong time\n    # When not using gcc, we currently assume that we are using\n    # Microsoft Visual C++.\n    if test \"$GCC\" != yes; then\n      with_gnu_ld=no\n    fi\n    ;;\n  interix*)\n    # we just hope/assume this is gcc and not c89 (= MSVC++)\n    with_gnu_ld=yes\n    ;;\n  openbsd*)\n    with_gnu_ld=no\n    ;;\n  linux* | k*bsd*-gnu | gnu*)\n    link_all_deplibs=no\n    ;;\n  esac\n\n  ld_shlibs=yes\n\n  # On some targets, GNU ld is compatible enough with the native linker\n  # that we're better off using the native interface for both.\n  lt_use_gnu_ld_interface=no\n  if test \"$with_gnu_ld\" = yes; then\n    case $host_os in\n      aix*)\n\t# The AIX port of GNU ld has always aspired to compatibility\n\t# with the native linker.  However, as the warning in the GNU ld\n\t# block says, versions before 2.19.5* couldn't really create working\n\t# shared libraries, regardless of the interface used.\n\tcase `$LD -v 2>&1` in\n\t  *\\ \\(GNU\\ Binutils\\)\\ 2.19.5*) ;;\n\t  *\\ \\(GNU\\ Binutils\\)\\ 2.[2-9]*) ;;\n\t  *\\ \\(GNU\\ Binutils\\)\\ [3-9]*) ;;\n\t  *)\n\t    lt_use_gnu_ld_interface=yes\n\t    ;;\n\tesac\n\t;;\n      *)\n\tlt_use_gnu_ld_interface=yes\n\t;;\n    esac\n  fi\n\n  if test \"$lt_use_gnu_ld_interface\" = yes; then\n    # If archive_cmds runs LD, not CC, wlarc should be empty\n    wlarc='${wl}'\n\n    # Set some defaults for GNU ld with shared library support. These\n    # are reset later if shared libraries are not supported. Putting them\n    # here allows them to be overridden if necessary.\n    runpath_var=LD_RUN_PATH\n    hardcode_libdir_flag_spec='${wl}-rpath ${wl}$libdir'\n    export_dynamic_flag_spec='${wl}--export-dynamic'\n    # ancient GNU ld didn't support --whole-archive et. al.\n    if $LD --help 2>&1 | $GREP 'no-whole-archive' > /dev/null; then\n      whole_archive_flag_spec=\"$wlarc\"'--whole-archive$convenience '\"$wlarc\"'--no-whole-archive'\n    else\n      whole_archive_flag_spec=\n    fi\n    supports_anon_versioning=no\n    case `$LD -v 2>&1` in\n      *GNU\\ gold*) supports_anon_versioning=yes ;;\n      *\\ [01].* | *\\ 2.[0-9].* | *\\ 2.10.*) ;; # catch versions < 2.11\n      *\\ 2.11.93.0.2\\ *) supports_anon_versioning=yes ;; # RH7.3 ...\n      *\\ 2.11.92.0.12\\ *) supports_anon_versioning=yes ;; # Mandrake 8.2 ...\n      *\\ 2.11.*) ;; # other 2.11 versions\n      *) supports_anon_versioning=yes ;;\n    esac\n\n    # See if GNU ld supports shared libraries.\n    case $host_os in\n    aix[3-9]*)\n      # On AIX/PPC, the GNU linker is very broken\n      if test \"$host_cpu\" != ia64; then\n\tld_shlibs=no\n\tcat <<_LT_EOF 1>&2\n\n*** Warning: the GNU linker, at least up to release 2.19, is reported\n*** to be unable to reliably create shared libraries on AIX.\n*** Therefore, libtool is disabling shared libraries support.  If you\n*** really care for shared libraries, you may want to install binutils\n*** 2.20 or above, or modify your PATH so that a non-GNU linker is found.\n*** You will then need to restart the configuration process.\n\n_LT_EOF\n      fi\n      ;;\n\n    amigaos*)\n      case $host_cpu in\n      powerpc)\n            # see comment about AmigaOS4 .so support\n            archive_cmds='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib'\n            archive_expsym_cmds=''\n        ;;\n      m68k)\n            archive_cmds='$RM $output_objdir/a2ixlibrary.data~$ECHO \"#define NAME $libname\" > $output_objdir/a2ixlibrary.data~$ECHO \"#define LIBRARY_ID 1\" >> $output_objdir/a2ixlibrary.data~$ECHO \"#define VERSION $major\" >> $output_objdir/a2ixlibrary.data~$ECHO \"#define REVISION $revision\" >> $output_objdir/a2ixlibrary.data~$AR $AR_FLAGS $lib $libobjs~$RANLIB $lib~(cd $output_objdir && a2ixlibrary -32)'\n            hardcode_libdir_flag_spec='-L$libdir'\n            hardcode_minus_L=yes\n        ;;\n      esac\n      ;;\n\n    beos*)\n      if $LD --help 2>&1 | $GREP ': supported targets:.* elf' > /dev/null; then\n\tallow_undefined_flag=unsupported\n\t# Joseph Beckenbach <jrb3@best.com> says some releases of gcc\n\t# support --undefined.  This deserves some investigation.  FIXME\n\tarchive_cmds='$CC -nostart $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib'\n      else\n\tld_shlibs=no\n      fi\n      ;;\n\n    cygwin* | mingw* | pw32* | cegcc*)\n      # _LT_TAGVAR(hardcode_libdir_flag_spec, ) is actually meaningless,\n      # as there is no search path for DLLs.\n      hardcode_libdir_flag_spec='-L$libdir'\n      export_dynamic_flag_spec='${wl}--export-all-symbols'\n      allow_undefined_flag=unsupported\n      always_export_symbols=no\n      enable_shared_with_static_runtimes=yes\n      export_symbols_cmds='$NM $libobjs $convenience | $global_symbol_pipe | $SED -e '\\''/^[BCDGRS][ ]/s/.*[ ]\\([^ ]*\\)/\\1 DATA/;s/^.*[ ]__nm__\\([^ ]*\\)[ ][^ ]*/\\1 DATA/;/^I[ ]/d;/^[AITW][ ]/s/.* //'\\'' | sort | uniq > $export_symbols'\n      exclude_expsyms='[_]+GLOBAL_OFFSET_TABLE_|[_]+GLOBAL__[FID]_.*|[_]+head_[A-Za-z0-9_]+_dll|[A-Za-z0-9_]+_dll_iname'\n\n      if $LD --help 2>&1 | $GREP 'auto-import' > /dev/null; then\n        archive_cmds='$CC -shared $libobjs $deplibs $compiler_flags -o $output_objdir/$soname ${wl}--enable-auto-image-base -Xlinker --out-implib -Xlinker $lib'\n\t# If the export-symbols file already is a .def file (1st line\n\t# is EXPORTS), use it as is; otherwise, prepend...\n\tarchive_expsym_cmds='if test \"x`$SED 1q $export_symbols`\" = xEXPORTS; then\n\t  cp $export_symbols $output_objdir/$soname.def;\n\telse\n\t  echo EXPORTS > $output_objdir/$soname.def;\n\t  cat $export_symbols >> $output_objdir/$soname.def;\n\tfi~\n\t$CC -shared $output_objdir/$soname.def $libobjs $deplibs $compiler_flags -o $output_objdir/$soname ${wl}--enable-auto-image-base -Xlinker --out-implib -Xlinker $lib'\n      else\n\tld_shlibs=no\n      fi\n      ;;\n\n    haiku*)\n      archive_cmds='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib'\n      link_all_deplibs=yes\n      ;;\n\n    interix[3-9]*)\n      hardcode_direct=no\n      hardcode_shlibpath_var=no\n      hardcode_libdir_flag_spec='${wl}-rpath,$libdir'\n      export_dynamic_flag_spec='${wl}-E'\n      # Hack: On Interix 3.x, we cannot compile PIC because of a broken gcc.\n      # Instead, shared libraries are loaded at an image base (0x10000000 by\n      # default) and relocated if they conflict, which is a slow very memory\n      # consuming and fragmenting process.  To avoid this, we pick a random,\n      # 256 KiB-aligned image base between 0x50000000 and 0x6FFC0000 at link\n      # time.  Moving up from 0x10000000 also allows more sbrk(2) space.\n      archive_cmds='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-h,$soname ${wl}--image-base,`expr ${RANDOM-$$} % 4096 / 2 \\* 262144 + 1342177280` -o $lib'\n      archive_expsym_cmds='sed \"s,^,_,\" $export_symbols >$output_objdir/$soname.expsym~$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-h,$soname ${wl}--retain-symbols-file,$output_objdir/$soname.expsym ${wl}--image-base,`expr ${RANDOM-$$} % 4096 / 2 \\* 262144 + 1342177280` -o $lib'\n      ;;\n\n    gnu* | linux* | tpf* | k*bsd*-gnu | kopensolaris*-gnu)\n      tmp_diet=no\n      if test \"$host_os\" = linux-dietlibc; then\n\tcase $cc_basename in\n\t  diet\\ *) tmp_diet=yes;;\t# linux-dietlibc with static linking (!diet-dyn)\n\tesac\n      fi\n      if $LD --help 2>&1 | $EGREP ': supported targets:.* elf' > /dev/null \\\n\t && test \"$tmp_diet\" = no\n      then\n\ttmp_addflag=' $pic_flag'\n\ttmp_sharedflag='-shared'\n\tcase $cc_basename,$host_cpu in\n        pgcc*)\t\t\t\t# Portland Group C compiler\n\t  whole_archive_flag_spec='${wl}--whole-archive`for conv in $convenience\\\"\\\"; do test  -n \\\"$conv\\\" && new_convenience=\\\"$new_convenience,$conv\\\"; done; func_echo_all \\\"$new_convenience\\\"` ${wl}--no-whole-archive'\n\t  tmp_addflag=' $pic_flag'\n\t  ;;\n\tpgf77* | pgf90* | pgf95* | pgfortran*)\n\t\t\t\t\t# Portland Group f77 and f90 compilers\n\t  whole_archive_flag_spec='${wl}--whole-archive`for conv in $convenience\\\"\\\"; do test  -n \\\"$conv\\\" && new_convenience=\\\"$new_convenience,$conv\\\"; done; func_echo_all \\\"$new_convenience\\\"` ${wl}--no-whole-archive'\n\t  tmp_addflag=' $pic_flag -Mnomain' ;;\n\tecc*,ia64* | icc*,ia64*)\t# Intel C compiler on ia64\n\t  tmp_addflag=' -i_dynamic' ;;\n\tefc*,ia64* | ifort*,ia64*)\t# Intel Fortran compiler on ia64\n\t  tmp_addflag=' -i_dynamic -nofor_main' ;;\n\tifc* | ifort*)\t\t\t# Intel Fortran compiler\n\t  tmp_addflag=' -nofor_main' ;;\n\tlf95*)\t\t\t\t# Lahey Fortran 8.1\n\t  whole_archive_flag_spec=\n\t  tmp_sharedflag='--shared' ;;\n\txl[cC]* | bgxl[cC]* | mpixl[cC]*) # IBM XL C 8.0 on PPC (deal with xlf below)\n\t  tmp_sharedflag='-qmkshrobj'\n\t  tmp_addflag= ;;\n\tnvcc*)\t# Cuda Compiler Driver 2.2\n\t  whole_archive_flag_spec='${wl}--whole-archive`for conv in $convenience\\\"\\\"; do test  -n \\\"$conv\\\" && new_convenience=\\\"$new_convenience,$conv\\\"; done; func_echo_all \\\"$new_convenience\\\"` ${wl}--no-whole-archive'\n\t  compiler_needs_object=yes\n\t  ;;\n\tesac\n\tcase `$CC -V 2>&1 | sed 5q` in\n\t*Sun\\ C*)\t\t\t# Sun C 5.9\n\t  whole_archive_flag_spec='${wl}--whole-archive`new_convenience=; for conv in $convenience\\\"\\\"; do test -z \\\"$conv\\\" || new_convenience=\\\"$new_convenience,$conv\\\"; done; func_echo_all \\\"$new_convenience\\\"` ${wl}--no-whole-archive'\n\t  compiler_needs_object=yes\n\t  tmp_sharedflag='-G' ;;\n\t*Sun\\ F*)\t\t\t# Sun Fortran 8.3\n\t  tmp_sharedflag='-G' ;;\n\tesac\n\tarchive_cmds='$CC '\"$tmp_sharedflag\"\"$tmp_addflag\"' $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib'\n\n        if test \"x$supports_anon_versioning\" = xyes; then\n          archive_expsym_cmds='echo \"{ global:\" > $output_objdir/$libname.ver~\n\t    cat $export_symbols | sed -e \"s/\\(.*\\)/\\1;/\" >> $output_objdir/$libname.ver~\n\t    echo \"local: *; };\" >> $output_objdir/$libname.ver~\n\t    $CC '\"$tmp_sharedflag\"\"$tmp_addflag\"' $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-version-script ${wl}$output_objdir/$libname.ver -o $lib'\n        fi\n\n\tcase $cc_basename in\n\txlf* | bgf* | bgxlf* | mpixlf*)\n\t  # IBM XL Fortran 10.1 on PPC cannot create shared libs itself\n\t  whole_archive_flag_spec='--whole-archive$convenience --no-whole-archive'\n\t  hardcode_libdir_flag_spec='${wl}-rpath ${wl}$libdir'\n\t  archive_cmds='$LD -shared $libobjs $deplibs $linker_flags -soname $soname -o $lib'\n\t  if test \"x$supports_anon_versioning\" = xyes; then\n\t    archive_expsym_cmds='echo \"{ global:\" > $output_objdir/$libname.ver~\n\t      cat $export_symbols | sed -e \"s/\\(.*\\)/\\1;/\" >> $output_objdir/$libname.ver~\n\t      echo \"local: *; };\" >> $output_objdir/$libname.ver~\n\t      $LD -shared $libobjs $deplibs $linker_flags -soname $soname -version-script $output_objdir/$libname.ver -o $lib'\n\t  fi\n\t  ;;\n\tesac\n      else\n        ld_shlibs=no\n      fi\n      ;;\n\n    netbsd* | netbsdelf*-gnu)\n      if echo __ELF__ | $CC -E - | $GREP __ELF__ >/dev/null; then\n\tarchive_cmds='$LD -Bshareable $libobjs $deplibs $linker_flags -o $lib'\n\twlarc=\n      else\n\tarchive_cmds='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib'\n\tarchive_expsym_cmds='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib'\n      fi\n      ;;\n\n    solaris*)\n      if $LD -v 2>&1 | $GREP 'BFD 2\\.8' > /dev/null; then\n\tld_shlibs=no\n\tcat <<_LT_EOF 1>&2\n\n*** Warning: The releases 2.8.* of the GNU linker cannot reliably\n*** create shared libraries on Solaris systems.  Therefore, libtool\n*** is disabling shared libraries support.  We urge you to upgrade GNU\n*** binutils to release 2.9.1 or newer.  Another option is to modify\n*** your PATH or compiler configuration so that the native linker is\n*** used, and then restart.\n\n_LT_EOF\n      elif $LD --help 2>&1 | $GREP ': supported targets:.* elf' > /dev/null; then\n\tarchive_cmds='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib'\n\tarchive_expsym_cmds='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib'\n      else\n\tld_shlibs=no\n      fi\n      ;;\n\n    sysv5* | sco3.2v5* | sco5v6* | unixware* | OpenUNIX*)\n      case `$LD -v 2>&1` in\n        *\\ [01].* | *\\ 2.[0-9].* | *\\ 2.1[0-5].*)\n\tld_shlibs=no\n\tcat <<_LT_EOF 1>&2\n\n*** Warning: Releases of the GNU linker prior to 2.16.91.0.3 can not\n*** reliably create shared libraries on SCO systems.  Therefore, libtool\n*** is disabling shared libraries support.  We urge you to upgrade GNU\n*** binutils to release 2.16.91.0.3 or newer.  Another option is to modify\n*** your PATH or compiler configuration so that the native linker is\n*** used, and then restart.\n\n_LT_EOF\n\t;;\n\t*)\n\t  # For security reasons, it is highly recommended that you always\n\t  # use absolute paths for naming shared libraries, and exclude the\n\t  # DT_RUNPATH tag from executables and libraries.  But doing so\n\t  # requires that you compile everything twice, which is a pain.\n\t  if $LD --help 2>&1 | $GREP ': supported targets:.* elf' > /dev/null; then\n\t    hardcode_libdir_flag_spec='${wl}-rpath ${wl}$libdir'\n\t    archive_cmds='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib'\n\t    archive_expsym_cmds='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib'\n\t  else\n\t    ld_shlibs=no\n\t  fi\n\t;;\n      esac\n      ;;\n\n    sunos4*)\n      archive_cmds='$LD -assert pure-text -Bshareable -o $lib $libobjs $deplibs $linker_flags'\n      wlarc=\n      hardcode_direct=yes\n      hardcode_shlibpath_var=no\n      ;;\n\n    *)\n      if $LD --help 2>&1 | $GREP ': supported targets:.* elf' > /dev/null; then\n\tarchive_cmds='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib'\n\tarchive_expsym_cmds='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib'\n      else\n\tld_shlibs=no\n      fi\n      ;;\n    esac\n\n    if test \"$ld_shlibs\" = no; then\n      runpath_var=\n      hardcode_libdir_flag_spec=\n      export_dynamic_flag_spec=\n      whole_archive_flag_spec=\n    fi\n  else\n    # PORTME fill in a description of your system's linker (not GNU ld)\n    case $host_os in\n    aix3*)\n      allow_undefined_flag=unsupported\n      always_export_symbols=yes\n      archive_expsym_cmds='$LD -o $output_objdir/$soname $libobjs $deplibs $linker_flags -bE:$export_symbols -T512 -H512 -bM:SRE~$AR $AR_FLAGS $lib $output_objdir/$soname'\n      # Note: this linker hardcodes the directories in LIBPATH if there\n      # are no directories specified by -L.\n      hardcode_minus_L=yes\n      if test \"$GCC\" = yes && test -z \"$lt_prog_compiler_static\"; then\n\t# Neither direct hardcoding nor static linking is supported with a\n\t# broken collect2.\n\thardcode_direct=unsupported\n      fi\n      ;;\n\n    aix[4-9]*)\n      if test \"$host_cpu\" = ia64; then\n\t# On IA64, the linker does run time linking by default, so we don't\n\t# have to do anything special.\n\taix_use_runtimelinking=no\n\texp_sym_flag='-Bexport'\n\tno_entry_flag=\"\"\n      else\n\t# If we're using GNU nm, then we don't want the \"-C\" option.\n\t# -C means demangle to AIX nm, but means don't demangle with GNU nm\n\t# Also, AIX nm treats weak defined symbols like other global\n\t# defined symbols, whereas GNU nm marks them as \"W\".\n\tif $NM -V 2>&1 | $GREP 'GNU' > /dev/null; then\n\t  export_symbols_cmds='$NM -Bpg $libobjs $convenience | awk '\\''{ if (((\\$ 2 == \"T\") || (\\$ 2 == \"D\") || (\\$ 2 == \"B\") || (\\$ 2 == \"W\")) && (substr(\\$ 3,1,1) != \".\")) { print \\$ 3 } }'\\'' | sort -u > $export_symbols'\n\telse\n\t  export_symbols_cmds='$NM -BCpg $libobjs $convenience | awk '\\''{ if (((\\$ 2 == \"T\") || (\\$ 2 == \"D\") || (\\$ 2 == \"B\")) && (substr(\\$ 3,1,1) != \".\")) { print \\$ 3 } }'\\'' | sort -u > $export_symbols'\n\tfi\n\taix_use_runtimelinking=no\n\n\t# Test if we are trying to use run time linking or normal\n\t# AIX style linking. If -brtl is somewhere in LDFLAGS, we\n\t# need to do runtime linking.\n\tcase $host_os in aix4.[23]|aix4.[23].*|aix[5-9]*)\n\t  for ld_flag in $LDFLAGS; do\n\t  if (test $ld_flag = \"-brtl\" || test $ld_flag = \"-Wl,-brtl\"); then\n\t    aix_use_runtimelinking=yes\n\t    break\n\t  fi\n\t  done\n\t  ;;\n\tesac\n\n\texp_sym_flag='-bexport'\n\tno_entry_flag='-bnoentry'\n      fi\n\n      # When large executables or shared objects are built, AIX ld can\n      # have problems creating the table of contents.  If linking a library\n      # or program results in \"error TOC overflow\" add -mminimal-toc to\n      # CXXFLAGS/CFLAGS for g++/gcc.  In the cases where that is not\n      # enough to fix the problem, add -Wl,-bbigtoc to LDFLAGS.\n\n      archive_cmds=''\n      hardcode_direct=yes\n      hardcode_direct_absolute=yes\n      hardcode_libdir_separator=':'\n      link_all_deplibs=yes\n      file_list_spec='${wl}-f,'\n\n      if test \"$GCC\" = yes; then\n\tcase $host_os in aix4.[012]|aix4.[012].*)\n\t# We only want to do this on AIX 4.2 and lower, the check\n\t# below for broken collect2 doesn't work under 4.3+\n\t  collect2name=`${CC} -print-prog-name=collect2`\n\t  if test -f \"$collect2name\" &&\n\t   strings \"$collect2name\" | $GREP resolve_lib_name >/dev/null\n\t  then\n\t  # We have reworked collect2\n\t  :\n\t  else\n\t  # We have old collect2\n\t  hardcode_direct=unsupported\n\t  # It fails to find uninstalled libraries when the uninstalled\n\t  # path is not listed in the libpath.  Setting hardcode_minus_L\n\t  # to unsupported forces relinking\n\t  hardcode_minus_L=yes\n\t  hardcode_libdir_flag_spec='-L$libdir'\n\t  hardcode_libdir_separator=\n\t  fi\n\t  ;;\n\tesac\n\tshared_flag='-shared'\n\tif test \"$aix_use_runtimelinking\" = yes; then\n\t  shared_flag=\"$shared_flag \"'${wl}-G'\n\tfi\n\tlink_all_deplibs=no\n      else\n\t# not using gcc\n\tif test \"$host_cpu\" = ia64; then\n\t# VisualAge C++, Version 5.5 for AIX 5L for IA-64, Beta 3 Release\n\t# chokes on -Wl,-G. The following line is correct:\n\t  shared_flag='-G'\n\telse\n\t  if test \"$aix_use_runtimelinking\" = yes; then\n\t    shared_flag='${wl}-G'\n\t  else\n\t    shared_flag='${wl}-bM:SRE'\n\t  fi\n\tfi\n      fi\n\n      export_dynamic_flag_spec='${wl}-bexpall'\n      # It seems that -bexpall does not export symbols beginning with\n      # underscore (_), so it is better to generate a list of symbols to export.\n      always_export_symbols=yes\n      if test \"$aix_use_runtimelinking\" = yes; then\n\t# Warning - without using the other runtime loading flags (-brtl),\n\t# -berok will link without error, but may produce a broken library.\n\tallow_undefined_flag='-berok'\n        # Determine the default libpath from the value encoded in an\n        # empty executable.\n        if test \"${lt_cv_aix_libpath+set}\" = set; then\n  aix_libpath=$lt_cv_aix_libpath\nelse\n  if ${lt_cv_aix_libpath_+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  cat confdefs.h - <<_ACEOF >conftest.$ac_ext\n/* end confdefs.h.  */\n\nint\nmain ()\n{\n\n  ;\n  return 0;\n}\n_ACEOF\nif ac_fn_c_try_link \"$LINENO\"; then :\n\n  lt_aix_libpath_sed='\n      /Import File Strings/,/^$/ {\n\t  /^0/ {\n\t      s/^0  *\\([^ ]*\\) *$/\\1/\n\t      p\n\t  }\n      }'\n  lt_cv_aix_libpath_=`dump -H conftest$ac_exeext 2>/dev/null | $SED -n -e \"$lt_aix_libpath_sed\"`\n  # Check for a 64-bit object if we didn't find anything.\n  if test -z \"$lt_cv_aix_libpath_\"; then\n    lt_cv_aix_libpath_=`dump -HX64 conftest$ac_exeext 2>/dev/null | $SED -n -e \"$lt_aix_libpath_sed\"`\n  fi\nfi\nrm -f core conftest.err conftest.$ac_objext \\\n    conftest$ac_exeext conftest.$ac_ext\n  if test -z \"$lt_cv_aix_libpath_\"; then\n    lt_cv_aix_libpath_=\"/usr/lib:/lib\"\n  fi\n\nfi\n\n  aix_libpath=$lt_cv_aix_libpath_\nfi\n\n        hardcode_libdir_flag_spec='${wl}-blibpath:$libdir:'\"$aix_libpath\"\n        archive_expsym_cmds='$CC -o $output_objdir/$soname $libobjs $deplibs '\"\\${wl}$no_entry_flag\"' $compiler_flags `if test \"x${allow_undefined_flag}\" != \"x\"; then func_echo_all \"${wl}${allow_undefined_flag}\"; else :; fi` '\"\\${wl}$exp_sym_flag:\\$export_symbols $shared_flag\"\n      else\n\tif test \"$host_cpu\" = ia64; then\n\t  hardcode_libdir_flag_spec='${wl}-R $libdir:/usr/lib:/lib'\n\t  allow_undefined_flag=\"-z nodefs\"\n\t  archive_expsym_cmds=\"\\$CC $shared_flag\"' -o $output_objdir/$soname $libobjs $deplibs '\"\\${wl}$no_entry_flag\"' $compiler_flags ${wl}${allow_undefined_flag} '\"\\${wl}$exp_sym_flag:\\$export_symbols\"\n\telse\n\t # Determine the default libpath from the value encoded in an\n\t # empty executable.\n\t if test \"${lt_cv_aix_libpath+set}\" = set; then\n  aix_libpath=$lt_cv_aix_libpath\nelse\n  if ${lt_cv_aix_libpath_+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  cat confdefs.h - <<_ACEOF >conftest.$ac_ext\n/* end confdefs.h.  */\n\nint\nmain ()\n{\n\n  ;\n  return 0;\n}\n_ACEOF\nif ac_fn_c_try_link \"$LINENO\"; then :\n\n  lt_aix_libpath_sed='\n      /Import File Strings/,/^$/ {\n\t  /^0/ {\n\t      s/^0  *\\([^ ]*\\) *$/\\1/\n\t      p\n\t  }\n      }'\n  lt_cv_aix_libpath_=`dump -H conftest$ac_exeext 2>/dev/null | $SED -n -e \"$lt_aix_libpath_sed\"`\n  # Check for a 64-bit object if we didn't find anything.\n  if test -z \"$lt_cv_aix_libpath_\"; then\n    lt_cv_aix_libpath_=`dump -HX64 conftest$ac_exeext 2>/dev/null | $SED -n -e \"$lt_aix_libpath_sed\"`\n  fi\nfi\nrm -f core conftest.err conftest.$ac_objext \\\n    conftest$ac_exeext conftest.$ac_ext\n  if test -z \"$lt_cv_aix_libpath_\"; then\n    lt_cv_aix_libpath_=\"/usr/lib:/lib\"\n  fi\n\nfi\n\n  aix_libpath=$lt_cv_aix_libpath_\nfi\n\n\t hardcode_libdir_flag_spec='${wl}-blibpath:$libdir:'\"$aix_libpath\"\n\t  # Warning - without using the other run time loading flags,\n\t  # -berok will link without error, but may produce a broken library.\n\t  no_undefined_flag=' ${wl}-bernotok'\n\t  allow_undefined_flag=' ${wl}-berok'\n\t  if test \"$with_gnu_ld\" = yes; then\n\t    # We only use this code for GNU lds that support --whole-archive.\n\t    whole_archive_flag_spec='${wl}--whole-archive$convenience ${wl}--no-whole-archive'\n\t  else\n\t    # Exported symbols can be pulled into shared objects from archives\n\t    whole_archive_flag_spec='$convenience'\n\t  fi\n\t  archive_cmds_need_lc=yes\n\t  # This is similar to how AIX traditionally builds its shared libraries.\n\t  archive_expsym_cmds=\"\\$CC $shared_flag\"' -o $output_objdir/$soname $libobjs $deplibs ${wl}-bnoentry $compiler_flags ${wl}-bE:$export_symbols${allow_undefined_flag}~$AR $AR_FLAGS $output_objdir/$libname$release.a $output_objdir/$soname'\n\tfi\n      fi\n      ;;\n\n    amigaos*)\n      case $host_cpu in\n      powerpc)\n            # see comment about AmigaOS4 .so support\n            archive_cmds='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib'\n            archive_expsym_cmds=''\n        ;;\n      m68k)\n            archive_cmds='$RM $output_objdir/a2ixlibrary.data~$ECHO \"#define NAME $libname\" > $output_objdir/a2ixlibrary.data~$ECHO \"#define LIBRARY_ID 1\" >> $output_objdir/a2ixlibrary.data~$ECHO \"#define VERSION $major\" >> $output_objdir/a2ixlibrary.data~$ECHO \"#define REVISION $revision\" >> $output_objdir/a2ixlibrary.data~$AR $AR_FLAGS $lib $libobjs~$RANLIB $lib~(cd $output_objdir && a2ixlibrary -32)'\n            hardcode_libdir_flag_spec='-L$libdir'\n            hardcode_minus_L=yes\n        ;;\n      esac\n      ;;\n\n    bsdi[45]*)\n      export_dynamic_flag_spec=-rdynamic\n      ;;\n\n    cygwin* | mingw* | pw32* | cegcc*)\n      # When not using gcc, we currently assume that we are using\n      # Microsoft Visual C++.\n      # hardcode_libdir_flag_spec is actually meaningless, as there is\n      # no search path for DLLs.\n      case $cc_basename in\n      cl*)\n\t# Native MSVC\n\thardcode_libdir_flag_spec=' '\n\tallow_undefined_flag=unsupported\n\talways_export_symbols=yes\n\tfile_list_spec='@'\n\t# Tell ltmain to make .lib files, not .a files.\n\tlibext=lib\n\t# Tell ltmain to make .dll files, not .so files.\n\tshrext_cmds=\".dll\"\n\t# FIXME: Setting linknames here is a bad hack.\n\tarchive_cmds='$CC -o $output_objdir/$soname $libobjs $compiler_flags $deplibs -Wl,-dll~linknames='\n\tarchive_expsym_cmds='if test \"x`$SED 1q $export_symbols`\" = xEXPORTS; then\n\t    sed -n -e 's/\\\\\\\\\\\\\\(.*\\\\\\\\\\\\\\)/-link\\\\\\ -EXPORT:\\\\\\\\\\\\\\1/' -e '1\\\\\\!p' < $export_symbols > $output_objdir/$soname.exp;\n\t  else\n\t    sed -e 's/\\\\\\\\\\\\\\(.*\\\\\\\\\\\\\\)/-link\\\\\\ -EXPORT:\\\\\\\\\\\\\\1/' < $export_symbols > $output_objdir/$soname.exp;\n\t  fi~\n\t  $CC -o $tool_output_objdir$soname $libobjs $compiler_flags $deplibs \"@$tool_output_objdir$soname.exp\" -Wl,-DLL,-IMPLIB:\"$tool_output_objdir$libname.dll.lib\"~\n\t  linknames='\n\t# The linker will not automatically build a static lib if we build a DLL.\n\t# _LT_TAGVAR(old_archive_from_new_cmds, )='true'\n\tenable_shared_with_static_runtimes=yes\n\texclude_expsyms='_NULL_IMPORT_DESCRIPTOR|_IMPORT_DESCRIPTOR_.*'\n\texport_symbols_cmds='$NM $libobjs $convenience | $global_symbol_pipe | $SED -e '\\''/^[BCDGRS][ ]/s/.*[ ]\\([^ ]*\\)/\\1,DATA/'\\'' | $SED -e '\\''/^[AITW][ ]/s/.*[ ]//'\\'' | sort | uniq > $export_symbols'\n\t# Don't use ranlib\n\told_postinstall_cmds='chmod 644 $oldlib'\n\tpostlink_cmds='lt_outputfile=\"@OUTPUT@\"~\n\t  lt_tool_outputfile=\"@TOOL_OUTPUT@\"~\n\t  case $lt_outputfile in\n\t    *.exe|*.EXE) ;;\n\t    *)\n\t      lt_outputfile=\"$lt_outputfile.exe\"\n\t      lt_tool_outputfile=\"$lt_tool_outputfile.exe\"\n\t      ;;\n\t  esac~\n\t  if test \"$MANIFEST_TOOL\" != \":\" && test -f \"$lt_outputfile.manifest\"; then\n\t    $MANIFEST_TOOL -manifest \"$lt_tool_outputfile.manifest\" -outputresource:\"$lt_tool_outputfile\" || exit 1;\n\t    $RM \"$lt_outputfile.manifest\";\n\t  fi'\n\t;;\n      *)\n\t# Assume MSVC wrapper\n\thardcode_libdir_flag_spec=' '\n\tallow_undefined_flag=unsupported\n\t# Tell ltmain to make .lib files, not .a files.\n\tlibext=lib\n\t# Tell ltmain to make .dll files, not .so files.\n\tshrext_cmds=\".dll\"\n\t# FIXME: Setting linknames here is a bad hack.\n\tarchive_cmds='$CC -o $lib $libobjs $compiler_flags `func_echo_all \"$deplibs\" | $SED '\\''s/ -lc$//'\\''` -link -dll~linknames='\n\t# The linker will automatically build a .lib file if we build a DLL.\n\told_archive_from_new_cmds='true'\n\t# FIXME: Should let the user specify the lib program.\n\told_archive_cmds='lib -OUT:$oldlib$oldobjs$old_deplibs'\n\tenable_shared_with_static_runtimes=yes\n\t;;\n      esac\n      ;;\n\n    darwin* | rhapsody*)\n\n\n  archive_cmds_need_lc=no\n  hardcode_direct=no\n  hardcode_automatic=yes\n  hardcode_shlibpath_var=unsupported\n  if test \"$lt_cv_ld_force_load\" = \"yes\"; then\n    whole_archive_flag_spec='`for conv in $convenience\\\"\\\"; do test  -n \\\"$conv\\\" && new_convenience=\\\"$new_convenience ${wl}-force_load,$conv\\\"; done; func_echo_all \\\"$new_convenience\\\"`'\n\n  else\n    whole_archive_flag_spec=''\n  fi\n  link_all_deplibs=yes\n  allow_undefined_flag=\"$_lt_dar_allow_undefined\"\n  case $cc_basename in\n     ifort*) _lt_dar_can_shared=yes ;;\n     *) _lt_dar_can_shared=$GCC ;;\n  esac\n  if test \"$_lt_dar_can_shared\" = \"yes\"; then\n    output_verbose_link_cmd=func_echo_all\n    archive_cmds=\"\\$CC -dynamiclib \\$allow_undefined_flag -o \\$lib \\$libobjs \\$deplibs \\$compiler_flags -install_name \\$rpath/\\$soname \\$verstring $_lt_dar_single_mod${_lt_dsymutil}\"\n    module_cmds=\"\\$CC \\$allow_undefined_flag -o \\$lib -bundle \\$libobjs \\$deplibs \\$compiler_flags${_lt_dsymutil}\"\n    archive_expsym_cmds=\"sed 's,^,_,' < \\$export_symbols > \\$output_objdir/\\${libname}-symbols.expsym~\\$CC -dynamiclib \\$allow_undefined_flag -o \\$lib \\$libobjs \\$deplibs \\$compiler_flags -install_name \\$rpath/\\$soname \\$verstring ${_lt_dar_single_mod}${_lt_dar_export_syms}${_lt_dsymutil}\"\n    module_expsym_cmds=\"sed -e 's,^,_,' < \\$export_symbols > \\$output_objdir/\\${libname}-symbols.expsym~\\$CC \\$allow_undefined_flag -o \\$lib -bundle \\$libobjs \\$deplibs \\$compiler_flags${_lt_dar_export_syms}${_lt_dsymutil}\"\n\n  else\n  ld_shlibs=no\n  fi\n\n      ;;\n\n    dgux*)\n      archive_cmds='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags'\n      hardcode_libdir_flag_spec='-L$libdir'\n      hardcode_shlibpath_var=no\n      ;;\n\n    # FreeBSD 2.2.[012] allows us to include c++rt0.o to get C++ constructor\n    # support.  Future versions do this automatically, but an explicit c++rt0.o\n    # does not break anything, and helps significantly (at the cost of a little\n    # extra space).\n    freebsd2.2*)\n      archive_cmds='$LD -Bshareable -o $lib $libobjs $deplibs $linker_flags /usr/lib/c++rt0.o'\n      hardcode_libdir_flag_spec='-R$libdir'\n      hardcode_direct=yes\n      hardcode_shlibpath_var=no\n      ;;\n\n    # Unfortunately, older versions of FreeBSD 2 do not have this feature.\n    freebsd2.*)\n      archive_cmds='$LD -Bshareable -o $lib $libobjs $deplibs $linker_flags'\n      hardcode_direct=yes\n      hardcode_minus_L=yes\n      hardcode_shlibpath_var=no\n      ;;\n\n    # FreeBSD 3 and greater uses gcc -shared to do shared libraries.\n    freebsd* | dragonfly*)\n      archive_cmds='$CC -shared $pic_flag -o $lib $libobjs $deplibs $compiler_flags'\n      hardcode_libdir_flag_spec='-R$libdir'\n      hardcode_direct=yes\n      hardcode_shlibpath_var=no\n      ;;\n\n    hpux9*)\n      if test \"$GCC\" = yes; then\n\tarchive_cmds='$RM $output_objdir/$soname~$CC -shared $pic_flag ${wl}+b ${wl}$install_libdir -o $output_objdir/$soname $libobjs $deplibs $compiler_flags~test $output_objdir/$soname = $lib || mv $output_objdir/$soname $lib'\n      else\n\tarchive_cmds='$RM $output_objdir/$soname~$LD -b +b $install_libdir -o $output_objdir/$soname $libobjs $deplibs $linker_flags~test $output_objdir/$soname = $lib || mv $output_objdir/$soname $lib'\n      fi\n      hardcode_libdir_flag_spec='${wl}+b ${wl}$libdir'\n      hardcode_libdir_separator=:\n      hardcode_direct=yes\n\n      # hardcode_minus_L: Not really in the search PATH,\n      # but as the default location of the library.\n      hardcode_minus_L=yes\n      export_dynamic_flag_spec='${wl}-E'\n      ;;\n\n    hpux10*)\n      if test \"$GCC\" = yes && test \"$with_gnu_ld\" = no; then\n\tarchive_cmds='$CC -shared $pic_flag ${wl}+h ${wl}$soname ${wl}+b ${wl}$install_libdir -o $lib $libobjs $deplibs $compiler_flags'\n      else\n\tarchive_cmds='$LD -b +h $soname +b $install_libdir -o $lib $libobjs $deplibs $linker_flags'\n      fi\n      if test \"$with_gnu_ld\" = no; then\n\thardcode_libdir_flag_spec='${wl}+b ${wl}$libdir'\n\thardcode_libdir_separator=:\n\thardcode_direct=yes\n\thardcode_direct_absolute=yes\n\texport_dynamic_flag_spec='${wl}-E'\n\t# hardcode_minus_L: Not really in the search PATH,\n\t# but as the default location of the library.\n\thardcode_minus_L=yes\n      fi\n      ;;\n\n    hpux11*)\n      if test \"$GCC\" = yes && test \"$with_gnu_ld\" = no; then\n\tcase $host_cpu in\n\thppa*64*)\n\t  archive_cmds='$CC -shared ${wl}+h ${wl}$soname -o $lib $libobjs $deplibs $compiler_flags'\n\t  ;;\n\tia64*)\n\t  archive_cmds='$CC -shared $pic_flag ${wl}+h ${wl}$soname ${wl}+nodefaultrpath -o $lib $libobjs $deplibs $compiler_flags'\n\t  ;;\n\t*)\n\t  archive_cmds='$CC -shared $pic_flag ${wl}+h ${wl}$soname ${wl}+b ${wl}$install_libdir -o $lib $libobjs $deplibs $compiler_flags'\n\t  ;;\n\tesac\n      else\n\tcase $host_cpu in\n\thppa*64*)\n\t  archive_cmds='$CC -b ${wl}+h ${wl}$soname -o $lib $libobjs $deplibs $compiler_flags'\n\t  ;;\n\tia64*)\n\t  archive_cmds='$CC -b ${wl}+h ${wl}$soname ${wl}+nodefaultrpath -o $lib $libobjs $deplibs $compiler_flags'\n\t  ;;\n\t*)\n\n\t  # Older versions of the 11.00 compiler do not understand -b yet\n\t  # (HP92453-01 A.11.01.20 doesn't, HP92453-01 B.11.X.35175-35176.GP does)\n\t  { $as_echo \"$as_me:${as_lineno-$LINENO}: checking if $CC understands -b\" >&5\n$as_echo_n \"checking if $CC understands -b... \" >&6; }\nif ${lt_cv_prog_compiler__b+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  lt_cv_prog_compiler__b=no\n   save_LDFLAGS=\"$LDFLAGS\"\n   LDFLAGS=\"$LDFLAGS -b\"\n   echo \"$lt_simple_link_test_code\" > conftest.$ac_ext\n   if (eval $ac_link 2>conftest.err) && test -s conftest$ac_exeext; then\n     # The linker can only warn and ignore the option if not recognized\n     # So say no if there are warnings\n     if test -s conftest.err; then\n       # Append any errors to the config.log.\n       cat conftest.err 1>&5\n       $ECHO \"$_lt_linker_boilerplate\" | $SED '/^$/d' > conftest.exp\n       $SED '/^$/d; /^ *+/d' conftest.err >conftest.er2\n       if diff conftest.exp conftest.er2 >/dev/null; then\n         lt_cv_prog_compiler__b=yes\n       fi\n     else\n       lt_cv_prog_compiler__b=yes\n     fi\n   fi\n   $RM -r conftest*\n   LDFLAGS=\"$save_LDFLAGS\"\n\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $lt_cv_prog_compiler__b\" >&5\n$as_echo \"$lt_cv_prog_compiler__b\" >&6; }\n\nif test x\"$lt_cv_prog_compiler__b\" = xyes; then\n    archive_cmds='$CC -b ${wl}+h ${wl}$soname ${wl}+b ${wl}$install_libdir -o $lib $libobjs $deplibs $compiler_flags'\nelse\n    archive_cmds='$LD -b +h $soname +b $install_libdir -o $lib $libobjs $deplibs $linker_flags'\nfi\n\n\t  ;;\n\tesac\n      fi\n      if test \"$with_gnu_ld\" = no; then\n\thardcode_libdir_flag_spec='${wl}+b ${wl}$libdir'\n\thardcode_libdir_separator=:\n\n\tcase $host_cpu in\n\thppa*64*|ia64*)\n\t  hardcode_direct=no\n\t  hardcode_shlibpath_var=no\n\t  ;;\n\t*)\n\t  hardcode_direct=yes\n\t  hardcode_direct_absolute=yes\n\t  export_dynamic_flag_spec='${wl}-E'\n\n\t  # hardcode_minus_L: Not really in the search PATH,\n\t  # but as the default location of the library.\n\t  hardcode_minus_L=yes\n\t  ;;\n\tesac\n      fi\n      ;;\n\n    irix5* | irix6* | nonstopux*)\n      if test \"$GCC\" = yes; then\n\tarchive_cmds='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-soname ${wl}$soname `test -n \"$verstring\" && func_echo_all \"${wl}-set_version ${wl}$verstring\"` ${wl}-update_registry ${wl}${output_objdir}/so_locations -o $lib'\n\t# Try to use the -exported_symbol ld option, if it does not\n\t# work, assume that -exports_file does not work either and\n\t# implicitly export all symbols.\n\t# This should be the same for all languages, so no per-tag cache variable.\n\t{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking whether the $host_os linker accepts -exported_symbol\" >&5\n$as_echo_n \"checking whether the $host_os linker accepts -exported_symbol... \" >&6; }\nif ${lt_cv_irix_exported_symbol+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  save_LDFLAGS=\"$LDFLAGS\"\n\t   LDFLAGS=\"$LDFLAGS -shared ${wl}-exported_symbol ${wl}foo ${wl}-update_registry ${wl}/dev/null\"\n\t   cat confdefs.h - <<_ACEOF >conftest.$ac_ext\n/* end confdefs.h.  */\nint foo (void) { return 0; }\n_ACEOF\nif ac_fn_c_try_link \"$LINENO\"; then :\n  lt_cv_irix_exported_symbol=yes\nelse\n  lt_cv_irix_exported_symbol=no\nfi\nrm -f core conftest.err conftest.$ac_objext \\\n    conftest$ac_exeext conftest.$ac_ext\n           LDFLAGS=\"$save_LDFLAGS\"\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $lt_cv_irix_exported_symbol\" >&5\n$as_echo \"$lt_cv_irix_exported_symbol\" >&6; }\n\tif test \"$lt_cv_irix_exported_symbol\" = yes; then\n          archive_expsym_cmds='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-soname ${wl}$soname `test -n \"$verstring\" && func_echo_all \"${wl}-set_version ${wl}$verstring\"` ${wl}-update_registry ${wl}${output_objdir}/so_locations ${wl}-exports_file ${wl}$export_symbols -o $lib'\n\tfi\n      else\n\tarchive_cmds='$CC -shared $libobjs $deplibs $compiler_flags -soname $soname `test -n \"$verstring\" && func_echo_all \"-set_version $verstring\"` -update_registry ${output_objdir}/so_locations -o $lib'\n\tarchive_expsym_cmds='$CC -shared $libobjs $deplibs $compiler_flags -soname $soname `test -n \"$verstring\" && func_echo_all \"-set_version $verstring\"` -update_registry ${output_objdir}/so_locations -exports_file $export_symbols -o $lib'\n      fi\n      archive_cmds_need_lc='no'\n      hardcode_libdir_flag_spec='${wl}-rpath ${wl}$libdir'\n      hardcode_libdir_separator=:\n      inherit_rpath=yes\n      link_all_deplibs=yes\n      ;;\n\n    netbsd* | netbsdelf*-gnu)\n      if echo __ELF__ | $CC -E - | $GREP __ELF__ >/dev/null; then\n\tarchive_cmds='$LD -Bshareable -o $lib $libobjs $deplibs $linker_flags'  # a.out\n      else\n\tarchive_cmds='$LD -shared -o $lib $libobjs $deplibs $linker_flags'      # ELF\n      fi\n      hardcode_libdir_flag_spec='-R$libdir'\n      hardcode_direct=yes\n      hardcode_shlibpath_var=no\n      ;;\n\n    newsos6)\n      archive_cmds='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags'\n      hardcode_direct=yes\n      hardcode_libdir_flag_spec='${wl}-rpath ${wl}$libdir'\n      hardcode_libdir_separator=:\n      hardcode_shlibpath_var=no\n      ;;\n\n    *nto* | *qnx*)\n      ;;\n\n    openbsd*)\n      if test -f /usr/libexec/ld.so; then\n\thardcode_direct=yes\n\thardcode_shlibpath_var=no\n\thardcode_direct_absolute=yes\n\tif test -z \"`echo __ELF__ | $CC -E - | $GREP __ELF__`\" || test \"$host_os-$host_cpu\" = \"openbsd2.8-powerpc\"; then\n\t  archive_cmds='$CC -shared $pic_flag -o $lib $libobjs $deplibs $compiler_flags'\n\t  archive_expsym_cmds='$CC -shared $pic_flag -o $lib $libobjs $deplibs $compiler_flags ${wl}-retain-symbols-file,$export_symbols'\n\t  hardcode_libdir_flag_spec='${wl}-rpath,$libdir'\n\t  export_dynamic_flag_spec='${wl}-E'\n\telse\n\t  case $host_os in\n\t   openbsd[01].* | openbsd2.[0-7] | openbsd2.[0-7].*)\n\t     archive_cmds='$LD -Bshareable -o $lib $libobjs $deplibs $linker_flags'\n\t     hardcode_libdir_flag_spec='-R$libdir'\n\t     ;;\n\t   *)\n\t     archive_cmds='$CC -shared $pic_flag -o $lib $libobjs $deplibs $compiler_flags'\n\t     hardcode_libdir_flag_spec='${wl}-rpath,$libdir'\n\t     ;;\n\t  esac\n\tfi\n      else\n\tld_shlibs=no\n      fi\n      ;;\n\n    os2*)\n      hardcode_libdir_flag_spec='-L$libdir'\n      hardcode_minus_L=yes\n      allow_undefined_flag=unsupported\n      archive_cmds='$ECHO \"LIBRARY $libname INITINSTANCE\" > $output_objdir/$libname.def~$ECHO \"DESCRIPTION \\\"$libname\\\"\" >> $output_objdir/$libname.def~echo DATA >> $output_objdir/$libname.def~echo \" SINGLE NONSHARED\" >> $output_objdir/$libname.def~echo EXPORTS >> $output_objdir/$libname.def~emxexp $libobjs >> $output_objdir/$libname.def~$CC -Zdll -Zcrtdll -o $lib $libobjs $deplibs $compiler_flags $output_objdir/$libname.def'\n      old_archive_from_new_cmds='emximp -o $output_objdir/$libname.a $output_objdir/$libname.def'\n      ;;\n\n    osf3*)\n      if test \"$GCC\" = yes; then\n\tallow_undefined_flag=' ${wl}-expect_unresolved ${wl}\\*'\n\tarchive_cmds='$CC -shared${allow_undefined_flag} $libobjs $deplibs $compiler_flags ${wl}-soname ${wl}$soname `test -n \"$verstring\" && func_echo_all \"${wl}-set_version ${wl}$verstring\"` ${wl}-update_registry ${wl}${output_objdir}/so_locations -o $lib'\n      else\n\tallow_undefined_flag=' -expect_unresolved \\*'\n\tarchive_cmds='$CC -shared${allow_undefined_flag} $libobjs $deplibs $compiler_flags -soname $soname `test -n \"$verstring\" && func_echo_all \"-set_version $verstring\"` -update_registry ${output_objdir}/so_locations -o $lib'\n      fi\n      archive_cmds_need_lc='no'\n      hardcode_libdir_flag_spec='${wl}-rpath ${wl}$libdir'\n      hardcode_libdir_separator=:\n      ;;\n\n    osf4* | osf5*)\t# as osf3* with the addition of -msym flag\n      if test \"$GCC\" = yes; then\n\tallow_undefined_flag=' ${wl}-expect_unresolved ${wl}\\*'\n\tarchive_cmds='$CC -shared${allow_undefined_flag} $pic_flag $libobjs $deplibs $compiler_flags ${wl}-msym ${wl}-soname ${wl}$soname `test -n \"$verstring\" && func_echo_all \"${wl}-set_version ${wl}$verstring\"` ${wl}-update_registry ${wl}${output_objdir}/so_locations -o $lib'\n\thardcode_libdir_flag_spec='${wl}-rpath ${wl}$libdir'\n      else\n\tallow_undefined_flag=' -expect_unresolved \\*'\n\tarchive_cmds='$CC -shared${allow_undefined_flag} $libobjs $deplibs $compiler_flags -msym -soname $soname `test -n \"$verstring\" && func_echo_all \"-set_version $verstring\"` -update_registry ${output_objdir}/so_locations -o $lib'\n\tarchive_expsym_cmds='for i in `cat $export_symbols`; do printf \"%s %s\\\\n\" -exported_symbol \"\\$i\" >> $lib.exp; done; printf \"%s\\\\n\" \"-hidden\">> $lib.exp~\n\t$CC -shared${allow_undefined_flag} ${wl}-input ${wl}$lib.exp $compiler_flags $libobjs $deplibs -soname $soname `test -n \"$verstring\" && $ECHO \"-set_version $verstring\"` -update_registry ${output_objdir}/so_locations -o $lib~$RM $lib.exp'\n\n\t# Both c and cxx compiler support -rpath directly\n\thardcode_libdir_flag_spec='-rpath $libdir'\n      fi\n      archive_cmds_need_lc='no'\n      hardcode_libdir_separator=:\n      ;;\n\n    solaris*)\n      no_undefined_flag=' -z defs'\n      if test \"$GCC\" = yes; then\n\twlarc='${wl}'\n\tarchive_cmds='$CC -shared $pic_flag ${wl}-z ${wl}text ${wl}-h ${wl}$soname -o $lib $libobjs $deplibs $compiler_flags'\n\tarchive_expsym_cmds='echo \"{ global:\" > $lib.exp~cat $export_symbols | $SED -e \"s/\\(.*\\)/\\1;/\" >> $lib.exp~echo \"local: *; };\" >> $lib.exp~\n\t  $CC -shared $pic_flag ${wl}-z ${wl}text ${wl}-M ${wl}$lib.exp ${wl}-h ${wl}$soname -o $lib $libobjs $deplibs $compiler_flags~$RM $lib.exp'\n      else\n\tcase `$CC -V 2>&1` in\n\t*\"Compilers 5.0\"*)\n\t  wlarc=''\n\t  archive_cmds='$LD -G${allow_undefined_flag} -h $soname -o $lib $libobjs $deplibs $linker_flags'\n\t  archive_expsym_cmds='echo \"{ global:\" > $lib.exp~cat $export_symbols | $SED -e \"s/\\(.*\\)/\\1;/\" >> $lib.exp~echo \"local: *; };\" >> $lib.exp~\n\t  $LD -G${allow_undefined_flag} -M $lib.exp -h $soname -o $lib $libobjs $deplibs $linker_flags~$RM $lib.exp'\n\t  ;;\n\t*)\n\t  wlarc='${wl}'\n\t  archive_cmds='$CC -G${allow_undefined_flag} -h $soname -o $lib $libobjs $deplibs $compiler_flags'\n\t  archive_expsym_cmds='echo \"{ global:\" > $lib.exp~cat $export_symbols | $SED -e \"s/\\(.*\\)/\\1;/\" >> $lib.exp~echo \"local: *; };\" >> $lib.exp~\n\t  $CC -G${allow_undefined_flag} -M $lib.exp -h $soname -o $lib $libobjs $deplibs $compiler_flags~$RM $lib.exp'\n\t  ;;\n\tesac\n      fi\n      hardcode_libdir_flag_spec='-R$libdir'\n      hardcode_shlibpath_var=no\n      case $host_os in\n      solaris2.[0-5] | solaris2.[0-5].*) ;;\n      *)\n\t# The compiler driver will combine and reorder linker options,\n\t# but understands `-z linker_flag'.  GCC discards it without `$wl',\n\t# but is careful enough not to reorder.\n\t# Supported since Solaris 2.6 (maybe 2.5.1?)\n\tif test \"$GCC\" = yes; then\n\t  whole_archive_flag_spec='${wl}-z ${wl}allextract$convenience ${wl}-z ${wl}defaultextract'\n\telse\n\t  whole_archive_flag_spec='-z allextract$convenience -z defaultextract'\n\tfi\n\t;;\n      esac\n      link_all_deplibs=yes\n      ;;\n\n    sunos4*)\n      if test \"x$host_vendor\" = xsequent; then\n\t# Use $CC to link under sequent, because it throws in some extra .o\n\t# files that make .init and .fini sections work.\n\tarchive_cmds='$CC -G ${wl}-h $soname -o $lib $libobjs $deplibs $compiler_flags'\n      else\n\tarchive_cmds='$LD -assert pure-text -Bstatic -o $lib $libobjs $deplibs $linker_flags'\n      fi\n      hardcode_libdir_flag_spec='-L$libdir'\n      hardcode_direct=yes\n      hardcode_minus_L=yes\n      hardcode_shlibpath_var=no\n      ;;\n\n    sysv4)\n      case $host_vendor in\n\tsni)\n\t  archive_cmds='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags'\n\t  hardcode_direct=yes # is this really true???\n\t;;\n\tsiemens)\n\t  ## LD is ld it makes a PLAMLIB\n\t  ## CC just makes a GrossModule.\n\t  archive_cmds='$LD -G -o $lib $libobjs $deplibs $linker_flags'\n\t  reload_cmds='$CC -r -o $output$reload_objs'\n\t  hardcode_direct=no\n        ;;\n\tmotorola)\n\t  archive_cmds='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags'\n\t  hardcode_direct=no #Motorola manual says yes, but my tests say they lie\n\t;;\n      esac\n      runpath_var='LD_RUN_PATH'\n      hardcode_shlibpath_var=no\n      ;;\n\n    sysv4.3*)\n      archive_cmds='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags'\n      hardcode_shlibpath_var=no\n      export_dynamic_flag_spec='-Bexport'\n      ;;\n\n    sysv4*MP*)\n      if test -d /usr/nec; then\n\tarchive_cmds='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags'\n\thardcode_shlibpath_var=no\n\trunpath_var=LD_RUN_PATH\n\thardcode_runpath_var=yes\n\tld_shlibs=yes\n      fi\n      ;;\n\n    sysv4*uw2* | sysv5OpenUNIX* | sysv5UnixWare7.[01].[10]* | unixware7* | sco3.2v5.0.[024]*)\n      no_undefined_flag='${wl}-z,text'\n      archive_cmds_need_lc=no\n      hardcode_shlibpath_var=no\n      runpath_var='LD_RUN_PATH'\n\n      if test \"$GCC\" = yes; then\n\tarchive_cmds='$CC -shared ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags'\n\tarchive_expsym_cmds='$CC -shared ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags'\n      else\n\tarchive_cmds='$CC -G ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags'\n\tarchive_expsym_cmds='$CC -G ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags'\n      fi\n      ;;\n\n    sysv5* | sco3.2v5* | sco5v6*)\n      # Note: We can NOT use -z defs as we might desire, because we do not\n      # link with -lc, and that would cause any symbols used from libc to\n      # always be unresolved, which means just about no library would\n      # ever link correctly.  If we're not using GNU ld we use -z text\n      # though, which does catch some bad symbols but isn't as heavy-handed\n      # as -z defs.\n      no_undefined_flag='${wl}-z,text'\n      allow_undefined_flag='${wl}-z,nodefs'\n      archive_cmds_need_lc=no\n      hardcode_shlibpath_var=no\n      hardcode_libdir_flag_spec='${wl}-R,$libdir'\n      hardcode_libdir_separator=':'\n      link_all_deplibs=yes\n      export_dynamic_flag_spec='${wl}-Bexport'\n      runpath_var='LD_RUN_PATH'\n\n      if test \"$GCC\" = yes; then\n\tarchive_cmds='$CC -shared ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags'\n\tarchive_expsym_cmds='$CC -shared ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags'\n      else\n\tarchive_cmds='$CC -G ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags'\n\tarchive_expsym_cmds='$CC -G ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags'\n      fi\n      ;;\n\n    uts4*)\n      archive_cmds='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags'\n      hardcode_libdir_flag_spec='-L$libdir'\n      hardcode_shlibpath_var=no\n      ;;\n\n    *)\n      ld_shlibs=no\n      ;;\n    esac\n\n    if test x$host_vendor = xsni; then\n      case $host in\n      sysv4 | sysv4.2uw2* | sysv4.3* | sysv5*)\n\texport_dynamic_flag_spec='${wl}-Blargedynsym'\n\t;;\n      esac\n    fi\n  fi\n\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $ld_shlibs\" >&5\n$as_echo \"$ld_shlibs\" >&6; }\ntest \"$ld_shlibs\" = no && can_build_shared=no\n\nwith_gnu_ld=$with_gnu_ld\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n#\n# Do we need to explicitly link libc?\n#\ncase \"x$archive_cmds_need_lc\" in\nx|xyes)\n  # Assume -lc should be added\n  archive_cmds_need_lc=yes\n\n  if test \"$enable_shared\" = yes && test \"$GCC\" = yes; then\n    case $archive_cmds in\n    *'~'*)\n      # FIXME: we may have to deal with multi-command sequences.\n      ;;\n    '$CC '*)\n      # Test whether the compiler implicitly links with -lc since on some\n      # systems, -lgcc has to come before -lc. If gcc already passes -lc\n      # to ld, don't add -lc before -lgcc.\n      { $as_echo \"$as_me:${as_lineno-$LINENO}: checking whether -lc should be explicitly linked in\" >&5\n$as_echo_n \"checking whether -lc should be explicitly linked in... \" >&6; }\nif ${lt_cv_archive_cmds_need_lc+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  $RM conftest*\n\techo \"$lt_simple_compile_test_code\" > conftest.$ac_ext\n\n\tif { { eval echo \"\\\"\\$as_me\\\":${as_lineno-$LINENO}: \\\"$ac_compile\\\"\"; } >&5\n  (eval $ac_compile) 2>&5\n  ac_status=$?\n  $as_echo \"$as_me:${as_lineno-$LINENO}: \\$? = $ac_status\" >&5\n  test $ac_status = 0; } 2>conftest.err; then\n\t  soname=conftest\n\t  lib=conftest\n\t  libobjs=conftest.$ac_objext\n\t  deplibs=\n\t  wl=$lt_prog_compiler_wl\n\t  pic_flag=$lt_prog_compiler_pic\n\t  compiler_flags=-v\n\t  linker_flags=-v\n\t  verstring=\n\t  output_objdir=.\n\t  libname=conftest\n\t  lt_save_allow_undefined_flag=$allow_undefined_flag\n\t  allow_undefined_flag=\n\t  if { { eval echo \"\\\"\\$as_me\\\":${as_lineno-$LINENO}: \\\"$archive_cmds 2\\>\\&1 \\| $GREP \\\" -lc \\\" \\>/dev/null 2\\>\\&1\\\"\"; } >&5\n  (eval $archive_cmds 2\\>\\&1 \\| $GREP \\\" -lc \\\" \\>/dev/null 2\\>\\&1) 2>&5\n  ac_status=$?\n  $as_echo \"$as_me:${as_lineno-$LINENO}: \\$? = $ac_status\" >&5\n  test $ac_status = 0; }\n\t  then\n\t    lt_cv_archive_cmds_need_lc=no\n\t  else\n\t    lt_cv_archive_cmds_need_lc=yes\n\t  fi\n\t  allow_undefined_flag=$lt_save_allow_undefined_flag\n\telse\n\t  cat conftest.err 1>&5\n\tfi\n\t$RM conftest*\n\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $lt_cv_archive_cmds_need_lc\" >&5\n$as_echo \"$lt_cv_archive_cmds_need_lc\" >&6; }\n      archive_cmds_need_lc=$lt_cv_archive_cmds_need_lc\n      ;;\n    esac\n  fi\n  ;;\nesac\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: checking dynamic linker characteristics\" >&5\n$as_echo_n \"checking dynamic linker characteristics... \" >&6; }\n\nif test \"$GCC\" = yes; then\n  case $host_os in\n    darwin*) lt_awk_arg=\"/^libraries:/,/LR/\" ;;\n    *) lt_awk_arg=\"/^libraries:/\" ;;\n  esac\n  case $host_os in\n    mingw* | cegcc*) lt_sed_strip_eq=\"s,=\\([A-Za-z]:\\),\\1,g\" ;;\n    *) lt_sed_strip_eq=\"s,=/,/,g\" ;;\n  esac\n  lt_search_path_spec=`$CC -print-search-dirs | awk $lt_awk_arg | $SED -e \"s/^libraries://\" -e $lt_sed_strip_eq`\n  case $lt_search_path_spec in\n  *\\;*)\n    # if the path contains \";\" then we assume it to be the separator\n    # otherwise default to the standard path separator (i.e. \":\") - it is\n    # assumed that no part of a normal pathname contains \";\" but that should\n    # okay in the real world where \";\" in dirpaths is itself problematic.\n    lt_search_path_spec=`$ECHO \"$lt_search_path_spec\" | $SED 's/;/ /g'`\n    ;;\n  *)\n    lt_search_path_spec=`$ECHO \"$lt_search_path_spec\" | $SED \"s/$PATH_SEPARATOR/ /g\"`\n    ;;\n  esac\n  # Ok, now we have the path, separated by spaces, we can step through it\n  # and add multilib dir if necessary.\n  lt_tmp_lt_search_path_spec=\n  lt_multi_os_dir=`$CC $CPPFLAGS $CFLAGS $LDFLAGS -print-multi-os-directory 2>/dev/null`\n  for lt_sys_path in $lt_search_path_spec; do\n    if test -d \"$lt_sys_path/$lt_multi_os_dir\"; then\n      lt_tmp_lt_search_path_spec=\"$lt_tmp_lt_search_path_spec $lt_sys_path/$lt_multi_os_dir\"\n    else\n      test -d \"$lt_sys_path\" && \\\n\tlt_tmp_lt_search_path_spec=\"$lt_tmp_lt_search_path_spec $lt_sys_path\"\n    fi\n  done\n  lt_search_path_spec=`$ECHO \"$lt_tmp_lt_search_path_spec\" | awk '\nBEGIN {RS=\" \"; FS=\"/|\\n\";} {\n  lt_foo=\"\";\n  lt_count=0;\n  for (lt_i = NF; lt_i > 0; lt_i--) {\n    if ($lt_i != \"\" && $lt_i != \".\") {\n      if ($lt_i == \"..\") {\n        lt_count++;\n      } else {\n        if (lt_count == 0) {\n          lt_foo=\"/\" $lt_i lt_foo;\n        } else {\n          lt_count--;\n        }\n      }\n    }\n  }\n  if (lt_foo != \"\") { lt_freq[lt_foo]++; }\n  if (lt_freq[lt_foo] == 1) { print lt_foo; }\n}'`\n  # AWK program above erroneously prepends '/' to C:/dos/paths\n  # for these hosts.\n  case $host_os in\n    mingw* | cegcc*) lt_search_path_spec=`$ECHO \"$lt_search_path_spec\" |\\\n      $SED 's,/\\([A-Za-z]:\\),\\1,g'` ;;\n  esac\n  sys_lib_search_path_spec=`$ECHO \"$lt_search_path_spec\" | $lt_NL2SP`\nelse\n  sys_lib_search_path_spec=\"/lib /usr/lib /usr/local/lib\"\nfi\nlibrary_names_spec=\nlibname_spec='lib$name'\nsoname_spec=\nshrext_cmds=\".so\"\npostinstall_cmds=\npostuninstall_cmds=\nfinish_cmds=\nfinish_eval=\nshlibpath_var=\nshlibpath_overrides_runpath=unknown\nversion_type=none\ndynamic_linker=\"$host_os ld.so\"\nsys_lib_dlsearch_path_spec=\"/lib /usr/lib\"\nneed_lib_prefix=unknown\nhardcode_into_libs=no\n\n# when you set need_version to no, make sure it does not cause -set_version\n# flags to be left without arguments\nneed_version=unknown\n\ncase $host_os in\naix3*)\n  version_type=linux # correct to gnu/linux during the next big refactor\n  library_names_spec='${libname}${release}${shared_ext}$versuffix $libname.a'\n  shlibpath_var=LIBPATH\n\n  # AIX 3 has no versioning support, so we append a major version to the name.\n  soname_spec='${libname}${release}${shared_ext}$major'\n  ;;\n\naix[4-9]*)\n  version_type=linux # correct to gnu/linux during the next big refactor\n  need_lib_prefix=no\n  need_version=no\n  hardcode_into_libs=yes\n  if test \"$host_cpu\" = ia64; then\n    # AIX 5 supports IA64\n    library_names_spec='${libname}${release}${shared_ext}$major ${libname}${release}${shared_ext}$versuffix $libname${shared_ext}'\n    shlibpath_var=LD_LIBRARY_PATH\n  else\n    # With GCC up to 2.95.x, collect2 would create an import file\n    # for dependence libraries.  The import file would start with\n    # the line `#! .'.  This would cause the generated library to\n    # depend on `.', always an invalid library.  This was fixed in\n    # development snapshots of GCC prior to 3.0.\n    case $host_os in\n      aix4 | aix4.[01] | aix4.[01].*)\n      if { echo '#if __GNUC__ > 2 || (__GNUC__ == 2 && __GNUC_MINOR__ >= 97)'\n\t   echo ' yes '\n\t   echo '#endif'; } | ${CC} -E - | $GREP yes > /dev/null; then\n\t:\n      else\n\tcan_build_shared=no\n      fi\n      ;;\n    esac\n    # AIX (on Power*) has no versioning support, so currently we can not hardcode correct\n    # soname into executable. Probably we can add versioning support to\n    # collect2, so additional links can be useful in future.\n    if test \"$aix_use_runtimelinking\" = yes; then\n      # If using run time linking (on AIX 4.2 or later) use lib<name>.so\n      # instead of lib<name>.a to let people know that these are not\n      # typical AIX shared libraries.\n      library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'\n    else\n      # We preserve .a as extension for shared libraries through AIX4.2\n      # and later when we are not doing run time linking.\n      library_names_spec='${libname}${release}.a $libname.a'\n      soname_spec='${libname}${release}${shared_ext}$major'\n    fi\n    shlibpath_var=LIBPATH\n  fi\n  ;;\n\namigaos*)\n  case $host_cpu in\n  powerpc)\n    # Since July 2007 AmigaOS4 officially supports .so libraries.\n    # When compiling the executable, add -use-dynld -Lsobjs: to the compileline.\n    library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'\n    ;;\n  m68k)\n    library_names_spec='$libname.ixlibrary $libname.a'\n    # Create ${libname}_ixlibrary.a entries in /sys/libs.\n    finish_eval='for lib in `ls $libdir/*.ixlibrary 2>/dev/null`; do libname=`func_echo_all \"$lib\" | $SED '\\''s%^.*/\\([^/]*\\)\\.ixlibrary$%\\1%'\\''`; test $RM /sys/libs/${libname}_ixlibrary.a; $show \"cd /sys/libs && $LN_S $lib ${libname}_ixlibrary.a\"; cd /sys/libs && $LN_S $lib ${libname}_ixlibrary.a || exit 1; done'\n    ;;\n  esac\n  ;;\n\nbeos*)\n  library_names_spec='${libname}${shared_ext}'\n  dynamic_linker=\"$host_os ld.so\"\n  shlibpath_var=LIBRARY_PATH\n  ;;\n\nbsdi[45]*)\n  version_type=linux # correct to gnu/linux during the next big refactor\n  need_version=no\n  library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'\n  soname_spec='${libname}${release}${shared_ext}$major'\n  finish_cmds='PATH=\"\\$PATH:/sbin\" ldconfig $libdir'\n  shlibpath_var=LD_LIBRARY_PATH\n  sys_lib_search_path_spec=\"/shlib /usr/lib /usr/X11/lib /usr/contrib/lib /lib /usr/local/lib\"\n  sys_lib_dlsearch_path_spec=\"/shlib /usr/lib /usr/local/lib\"\n  # the default ld.so.conf also contains /usr/contrib/lib and\n  # /usr/X11R6/lib (/usr/X11 is a link to /usr/X11R6), but let us allow\n  # libtool to hard-code these into programs\n  ;;\n\ncygwin* | mingw* | pw32* | cegcc*)\n  version_type=windows\n  shrext_cmds=\".dll\"\n  need_version=no\n  need_lib_prefix=no\n\n  case $GCC,$cc_basename in\n  yes,*)\n    # gcc\n    library_names_spec='$libname.dll.a'\n    # DLL is installed to $(libdir)/../bin by postinstall_cmds\n    postinstall_cmds='base_file=`basename \\${file}`~\n      dlpath=`$SHELL 2>&1 -c '\\''. $dir/'\\''\\${base_file}'\\''i; echo \\$dlname'\\''`~\n      dldir=$destdir/`dirname \\$dlpath`~\n      test -d \\$dldir || mkdir -p \\$dldir~\n      $install_prog $dir/$dlname \\$dldir/$dlname~\n      chmod a+x \\$dldir/$dlname~\n      if test -n '\\''$stripme'\\'' && test -n '\\''$striplib'\\''; then\n        eval '\\''$striplib \\$dldir/$dlname'\\'' || exit \\$?;\n      fi'\n    postuninstall_cmds='dldll=`$SHELL 2>&1 -c '\\''. $file; echo \\$dlname'\\''`~\n      dlpath=$dir/\\$dldll~\n       $RM \\$dlpath'\n    shlibpath_overrides_runpath=yes\n\n    case $host_os in\n    cygwin*)\n      # Cygwin DLLs use 'cyg' prefix rather than 'lib'\n      soname_spec='`echo ${libname} | sed -e 's/^lib/cyg/'``echo ${release} | $SED -e 's/[.]/-/g'`${versuffix}${shared_ext}'\n\n      sys_lib_search_path_spec=\"$sys_lib_search_path_spec /usr/lib/w32api\"\n      ;;\n    mingw* | cegcc*)\n      # MinGW DLLs use traditional 'lib' prefix\n      soname_spec='${libname}`echo ${release} | $SED -e 's/[.]/-/g'`${versuffix}${shared_ext}'\n      ;;\n    pw32*)\n      # pw32 DLLs use 'pw' prefix rather than 'lib'\n      library_names_spec='`echo ${libname} | sed -e 's/^lib/pw/'``echo ${release} | $SED -e 's/[.]/-/g'`${versuffix}${shared_ext}'\n      ;;\n    esac\n    dynamic_linker='Win32 ld.exe'\n    ;;\n\n  *,cl*)\n    # Native MSVC\n    libname_spec='$name'\n    soname_spec='${libname}`echo ${release} | $SED -e 's/[.]/-/g'`${versuffix}${shared_ext}'\n    library_names_spec='${libname}.dll.lib'\n\n    case $build_os in\n    mingw*)\n      sys_lib_search_path_spec=\n      lt_save_ifs=$IFS\n      IFS=';'\n      for lt_path in $LIB\n      do\n        IFS=$lt_save_ifs\n        # Let DOS variable expansion print the short 8.3 style file name.\n        lt_path=`cd \"$lt_path\" 2>/dev/null && cmd //C \"for %i in (\".\") do @echo %~si\"`\n        sys_lib_search_path_spec=\"$sys_lib_search_path_spec $lt_path\"\n      done\n      IFS=$lt_save_ifs\n      # Convert to MSYS style.\n      sys_lib_search_path_spec=`$ECHO \"$sys_lib_search_path_spec\" | sed -e 's|\\\\\\\\|/|g' -e 's| \\\\([a-zA-Z]\\\\):| /\\\\1|g' -e 's|^ ||'`\n      ;;\n    cygwin*)\n      # Convert to unix form, then to dos form, then back to unix form\n      # but this time dos style (no spaces!) so that the unix form looks\n      # like /cygdrive/c/PROGRA~1:/cygdr...\n      sys_lib_search_path_spec=`cygpath --path --unix \"$LIB\"`\n      sys_lib_search_path_spec=`cygpath --path --dos \"$sys_lib_search_path_spec\" 2>/dev/null`\n      sys_lib_search_path_spec=`cygpath --path --unix \"$sys_lib_search_path_spec\" | $SED -e \"s/$PATH_SEPARATOR/ /g\"`\n      ;;\n    *)\n      sys_lib_search_path_spec=\"$LIB\"\n      if $ECHO \"$sys_lib_search_path_spec\" | $GREP ';[c-zC-Z]:/' >/dev/null; then\n        # It is most probably a Windows format PATH.\n        sys_lib_search_path_spec=`$ECHO \"$sys_lib_search_path_spec\" | $SED -e 's/;/ /g'`\n      else\n        sys_lib_search_path_spec=`$ECHO \"$sys_lib_search_path_spec\" | $SED -e \"s/$PATH_SEPARATOR/ /g\"`\n      fi\n      # FIXME: find the short name or the path components, as spaces are\n      # common. (e.g. \"Program Files\" -> \"PROGRA~1\")\n      ;;\n    esac\n\n    # DLL is installed to $(libdir)/../bin by postinstall_cmds\n    postinstall_cmds='base_file=`basename \\${file}`~\n      dlpath=`$SHELL 2>&1 -c '\\''. $dir/'\\''\\${base_file}'\\''i; echo \\$dlname'\\''`~\n      dldir=$destdir/`dirname \\$dlpath`~\n      test -d \\$dldir || mkdir -p \\$dldir~\n      $install_prog $dir/$dlname \\$dldir/$dlname'\n    postuninstall_cmds='dldll=`$SHELL 2>&1 -c '\\''. $file; echo \\$dlname'\\''`~\n      dlpath=$dir/\\$dldll~\n       $RM \\$dlpath'\n    shlibpath_overrides_runpath=yes\n    dynamic_linker='Win32 link.exe'\n    ;;\n\n  *)\n    # Assume MSVC wrapper\n    library_names_spec='${libname}`echo ${release} | $SED -e 's/[.]/-/g'`${versuffix}${shared_ext} $libname.lib'\n    dynamic_linker='Win32 ld.exe'\n    ;;\n  esac\n  # FIXME: first we should search . and the directory the executable is in\n  shlibpath_var=PATH\n  ;;\n\ndarwin* | rhapsody*)\n  dynamic_linker=\"$host_os dyld\"\n  version_type=darwin\n  need_lib_prefix=no\n  need_version=no\n  library_names_spec='${libname}${release}${major}$shared_ext ${libname}$shared_ext'\n  soname_spec='${libname}${release}${major}$shared_ext'\n  shlibpath_overrides_runpath=yes\n  shlibpath_var=DYLD_LIBRARY_PATH\n  shrext_cmds='`test .$module = .yes && echo .so || echo .dylib`'\n\n  sys_lib_search_path_spec=\"$sys_lib_search_path_spec /usr/local/lib\"\n  sys_lib_dlsearch_path_spec='/usr/local/lib /lib /usr/lib'\n  ;;\n\ndgux*)\n  version_type=linux # correct to gnu/linux during the next big refactor\n  need_lib_prefix=no\n  need_version=no\n  library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname$shared_ext'\n  soname_spec='${libname}${release}${shared_ext}$major'\n  shlibpath_var=LD_LIBRARY_PATH\n  ;;\n\nfreebsd* | dragonfly*)\n  # DragonFly does not have aout.  When/if they implement a new\n  # versioning mechanism, adjust this.\n  if test -x /usr/bin/objformat; then\n    objformat=`/usr/bin/objformat`\n  else\n    case $host_os in\n    freebsd[23].*) objformat=aout ;;\n    *) objformat=elf ;;\n    esac\n  fi\n  version_type=freebsd-$objformat\n  case $version_type in\n    freebsd-elf*)\n      library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext} $libname${shared_ext}'\n      need_version=no\n      need_lib_prefix=no\n      ;;\n    freebsd-*)\n      library_names_spec='${libname}${release}${shared_ext}$versuffix $libname${shared_ext}$versuffix'\n      need_version=yes\n      ;;\n  esac\n  shlibpath_var=LD_LIBRARY_PATH\n  case $host_os in\n  freebsd2.*)\n    shlibpath_overrides_runpath=yes\n    ;;\n  freebsd3.[01]* | freebsdelf3.[01]*)\n    shlibpath_overrides_runpath=yes\n    hardcode_into_libs=yes\n    ;;\n  freebsd3.[2-9]* | freebsdelf3.[2-9]* | \\\n  freebsd4.[0-5] | freebsdelf4.[0-5] | freebsd4.1.1 | freebsdelf4.1.1)\n    shlibpath_overrides_runpath=no\n    hardcode_into_libs=yes\n    ;;\n  *) # from 4.6 on, and DragonFly\n    shlibpath_overrides_runpath=yes\n    hardcode_into_libs=yes\n    ;;\n  esac\n  ;;\n\nhaiku*)\n  version_type=linux # correct to gnu/linux during the next big refactor\n  need_lib_prefix=no\n  need_version=no\n  dynamic_linker=\"$host_os runtime_loader\"\n  library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}${major} ${libname}${shared_ext}'\n  soname_spec='${libname}${release}${shared_ext}$major'\n  shlibpath_var=LIBRARY_PATH\n  shlibpath_overrides_runpath=yes\n  sys_lib_dlsearch_path_spec='/boot/home/config/lib /boot/common/lib /boot/system/lib'\n  hardcode_into_libs=yes\n  ;;\n\nhpux9* | hpux10* | hpux11*)\n  # Give a soname corresponding to the major version so that dld.sl refuses to\n  # link against other versions.\n  version_type=sunos\n  need_lib_prefix=no\n  need_version=no\n  case $host_cpu in\n  ia64*)\n    shrext_cmds='.so'\n    hardcode_into_libs=yes\n    dynamic_linker=\"$host_os dld.so\"\n    shlibpath_var=LD_LIBRARY_PATH\n    shlibpath_overrides_runpath=yes # Unless +noenvvar is specified.\n    library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'\n    soname_spec='${libname}${release}${shared_ext}$major'\n    if test \"X$HPUX_IA64_MODE\" = X32; then\n      sys_lib_search_path_spec=\"/usr/lib/hpux32 /usr/local/lib/hpux32 /usr/local/lib\"\n    else\n      sys_lib_search_path_spec=\"/usr/lib/hpux64 /usr/local/lib/hpux64\"\n    fi\n    sys_lib_dlsearch_path_spec=$sys_lib_search_path_spec\n    ;;\n  hppa*64*)\n    shrext_cmds='.sl'\n    hardcode_into_libs=yes\n    dynamic_linker=\"$host_os dld.sl\"\n    shlibpath_var=LD_LIBRARY_PATH # How should we handle SHLIB_PATH\n    shlibpath_overrides_runpath=yes # Unless +noenvvar is specified.\n    library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'\n    soname_spec='${libname}${release}${shared_ext}$major'\n    sys_lib_search_path_spec=\"/usr/lib/pa20_64 /usr/ccs/lib/pa20_64\"\n    sys_lib_dlsearch_path_spec=$sys_lib_search_path_spec\n    ;;\n  *)\n    shrext_cmds='.sl'\n    dynamic_linker=\"$host_os dld.sl\"\n    shlibpath_var=SHLIB_PATH\n    shlibpath_overrides_runpath=no # +s is required to enable SHLIB_PATH\n    library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'\n    soname_spec='${libname}${release}${shared_ext}$major'\n    ;;\n  esac\n  # HP-UX runs *really* slowly unless shared libraries are mode 555, ...\n  postinstall_cmds='chmod 555 $lib'\n  # or fails outright, so override atomically:\n  install_override_mode=555\n  ;;\n\ninterix[3-9]*)\n  version_type=linux # correct to gnu/linux during the next big refactor\n  need_lib_prefix=no\n  need_version=no\n  library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${shared_ext}'\n  soname_spec='${libname}${release}${shared_ext}$major'\n  dynamic_linker='Interix 3.x ld.so.1 (PE, like ELF)'\n  shlibpath_var=LD_LIBRARY_PATH\n  shlibpath_overrides_runpath=no\n  hardcode_into_libs=yes\n  ;;\n\nirix5* | irix6* | nonstopux*)\n  case $host_os in\n    nonstopux*) version_type=nonstopux ;;\n    *)\n\tif test \"$lt_cv_prog_gnu_ld\" = yes; then\n\t\tversion_type=linux # correct to gnu/linux during the next big refactor\n\telse\n\t\tversion_type=irix\n\tfi ;;\n  esac\n  need_lib_prefix=no\n  need_version=no\n  soname_spec='${libname}${release}${shared_ext}$major'\n  library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${release}${shared_ext} $libname${shared_ext}'\n  case $host_os in\n  irix5* | nonstopux*)\n    libsuff= shlibsuff=\n    ;;\n  *)\n    case $LD in # libtool.m4 will add one of these switches to LD\n    *-32|*\"-32 \"|*-melf32bsmip|*\"-melf32bsmip \")\n      libsuff= shlibsuff= libmagic=32-bit;;\n    *-n32|*\"-n32 \"|*-melf32bmipn32|*\"-melf32bmipn32 \")\n      libsuff=32 shlibsuff=N32 libmagic=N32;;\n    *-64|*\"-64 \"|*-melf64bmip|*\"-melf64bmip \")\n      libsuff=64 shlibsuff=64 libmagic=64-bit;;\n    *) libsuff= shlibsuff= libmagic=never-match;;\n    esac\n    ;;\n  esac\n  shlibpath_var=LD_LIBRARY${shlibsuff}_PATH\n  shlibpath_overrides_runpath=no\n  sys_lib_search_path_spec=\"/usr/lib${libsuff} /lib${libsuff} /usr/local/lib${libsuff}\"\n  sys_lib_dlsearch_path_spec=\"/usr/lib${libsuff} /lib${libsuff}\"\n  hardcode_into_libs=yes\n  ;;\n\n# No shared lib support for Linux oldld, aout, or coff.\nlinux*oldld* | linux*aout* | linux*coff*)\n  dynamic_linker=no\n  ;;\n\n# This must be glibc/ELF.\nlinux* | k*bsd*-gnu | kopensolaris*-gnu | gnu*)\n  version_type=linux # correct to gnu/linux during the next big refactor\n  need_lib_prefix=no\n  need_version=no\n  library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'\n  soname_spec='${libname}${release}${shared_ext}$major'\n  finish_cmds='PATH=\"\\$PATH:/sbin\" ldconfig -n $libdir'\n  shlibpath_var=LD_LIBRARY_PATH\n  shlibpath_overrides_runpath=no\n\n  # Some binutils ld are patched to set DT_RUNPATH\n  if ${lt_cv_shlibpath_overrides_runpath+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  lt_cv_shlibpath_overrides_runpath=no\n    save_LDFLAGS=$LDFLAGS\n    save_libdir=$libdir\n    eval \"libdir=/foo; wl=\\\"$lt_prog_compiler_wl\\\"; \\\n\t LDFLAGS=\\\"\\$LDFLAGS $hardcode_libdir_flag_spec\\\"\"\n    cat confdefs.h - <<_ACEOF >conftest.$ac_ext\n/* end confdefs.h.  */\n\nint\nmain ()\n{\n\n  ;\n  return 0;\n}\n_ACEOF\nif ac_fn_c_try_link \"$LINENO\"; then :\n  if  ($OBJDUMP -p conftest$ac_exeext) 2>/dev/null | grep \"RUNPATH.*$libdir\" >/dev/null; then :\n  lt_cv_shlibpath_overrides_runpath=yes\nfi\nfi\nrm -f core conftest.err conftest.$ac_objext \\\n    conftest$ac_exeext conftest.$ac_ext\n    LDFLAGS=$save_LDFLAGS\n    libdir=$save_libdir\n\nfi\n\n  shlibpath_overrides_runpath=$lt_cv_shlibpath_overrides_runpath\n\n  # This implies no fast_install, which is unacceptable.\n  # Some rework will be needed to allow for fast_install\n  # before this can be enabled.\n  hardcode_into_libs=yes\n\n  # Append ld.so.conf contents to the search path\n  if test -f /etc/ld.so.conf; then\n    lt_ld_extra=`awk '/^include / { system(sprintf(\"cd /etc; cat %s 2>/dev/null\", \\$2)); skip = 1; } { if (!skip) print \\$0; skip = 0; }' < /etc/ld.so.conf | $SED -e 's/#.*//;/^[\t ]*hwcap[\t ]/d;s/[:,\t]/ /g;s/=[^=]*$//;s/=[^= ]* / /g;s/\"//g;/^$/d' | tr '\\n' ' '`\n    sys_lib_dlsearch_path_spec=\"/lib /usr/lib $lt_ld_extra\"\n  fi\n\n  # We used to test for /lib/ld.so.1 and disable shared libraries on\n  # powerpc, because MkLinux only supported shared libraries with the\n  # GNU dynamic linker.  Since this was broken with cross compilers,\n  # most powerpc-linux boxes support dynamic linking these days and\n  # people can always --disable-shared, the test was removed, and we\n  # assume the GNU/Linux dynamic linker is in use.\n  dynamic_linker='GNU/Linux ld.so'\n  ;;\n\nnetbsdelf*-gnu)\n  version_type=linux\n  need_lib_prefix=no\n  need_version=no\n  library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${shared_ext}'\n  soname_spec='${libname}${release}${shared_ext}$major'\n  shlibpath_var=LD_LIBRARY_PATH\n  shlibpath_overrides_runpath=no\n  hardcode_into_libs=yes\n  dynamic_linker='NetBSD ld.elf_so'\n  ;;\n\nnetbsd*)\n  version_type=sunos\n  need_lib_prefix=no\n  need_version=no\n  if echo __ELF__ | $CC -E - | $GREP __ELF__ >/dev/null; then\n    library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${shared_ext}$versuffix'\n    finish_cmds='PATH=\"\\$PATH:/sbin\" ldconfig -m $libdir'\n    dynamic_linker='NetBSD (a.out) ld.so'\n  else\n    library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${shared_ext}'\n    soname_spec='${libname}${release}${shared_ext}$major'\n    dynamic_linker='NetBSD ld.elf_so'\n  fi\n  shlibpath_var=LD_LIBRARY_PATH\n  shlibpath_overrides_runpath=yes\n  hardcode_into_libs=yes\n  ;;\n\nnewsos6)\n  version_type=linux # correct to gnu/linux during the next big refactor\n  library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'\n  shlibpath_var=LD_LIBRARY_PATH\n  shlibpath_overrides_runpath=yes\n  ;;\n\n*nto* | *qnx*)\n  version_type=qnx\n  need_lib_prefix=no\n  need_version=no\n  library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'\n  soname_spec='${libname}${release}${shared_ext}$major'\n  shlibpath_var=LD_LIBRARY_PATH\n  shlibpath_overrides_runpath=no\n  hardcode_into_libs=yes\n  dynamic_linker='ldqnx.so'\n  ;;\n\nopenbsd*)\n  version_type=sunos\n  sys_lib_dlsearch_path_spec=\"/usr/lib\"\n  need_lib_prefix=no\n  # Some older versions of OpenBSD (3.3 at least) *do* need versioned libs.\n  case $host_os in\n    openbsd3.3 | openbsd3.3.*)\tneed_version=yes ;;\n    *)\t\t\t\tneed_version=no  ;;\n  esac\n  library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${shared_ext}$versuffix'\n  finish_cmds='PATH=\"\\$PATH:/sbin\" ldconfig -m $libdir'\n  shlibpath_var=LD_LIBRARY_PATH\n  if test -z \"`echo __ELF__ | $CC -E - | $GREP __ELF__`\" || test \"$host_os-$host_cpu\" = \"openbsd2.8-powerpc\"; then\n    case $host_os in\n      openbsd2.[89] | openbsd2.[89].*)\n\tshlibpath_overrides_runpath=no\n\t;;\n      *)\n\tshlibpath_overrides_runpath=yes\n\t;;\n      esac\n  else\n    shlibpath_overrides_runpath=yes\n  fi\n  ;;\n\nos2*)\n  libname_spec='$name'\n  shrext_cmds=\".dll\"\n  need_lib_prefix=no\n  library_names_spec='$libname${shared_ext} $libname.a'\n  dynamic_linker='OS/2 ld.exe'\n  shlibpath_var=LIBPATH\n  ;;\n\nosf3* | osf4* | osf5*)\n  version_type=osf\n  need_lib_prefix=no\n  need_version=no\n  soname_spec='${libname}${release}${shared_ext}$major'\n  library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'\n  shlibpath_var=LD_LIBRARY_PATH\n  sys_lib_search_path_spec=\"/usr/shlib /usr/ccs/lib /usr/lib/cmplrs/cc /usr/lib /usr/local/lib /var/shlib\"\n  sys_lib_dlsearch_path_spec=\"$sys_lib_search_path_spec\"\n  ;;\n\nrdos*)\n  dynamic_linker=no\n  ;;\n\nsolaris*)\n  version_type=linux # correct to gnu/linux during the next big refactor\n  need_lib_prefix=no\n  need_version=no\n  library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'\n  soname_spec='${libname}${release}${shared_ext}$major'\n  shlibpath_var=LD_LIBRARY_PATH\n  shlibpath_overrides_runpath=yes\n  hardcode_into_libs=yes\n  # ldd complains unless libraries are executable\n  postinstall_cmds='chmod +x $lib'\n  ;;\n\nsunos4*)\n  version_type=sunos\n  library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${shared_ext}$versuffix'\n  finish_cmds='PATH=\"\\$PATH:/usr/etc\" ldconfig $libdir'\n  shlibpath_var=LD_LIBRARY_PATH\n  shlibpath_overrides_runpath=yes\n  if test \"$with_gnu_ld\" = yes; then\n    need_lib_prefix=no\n  fi\n  need_version=yes\n  ;;\n\nsysv4 | sysv4.3*)\n  version_type=linux # correct to gnu/linux during the next big refactor\n  library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'\n  soname_spec='${libname}${release}${shared_ext}$major'\n  shlibpath_var=LD_LIBRARY_PATH\n  case $host_vendor in\n    sni)\n      shlibpath_overrides_runpath=no\n      need_lib_prefix=no\n      runpath_var=LD_RUN_PATH\n      ;;\n    siemens)\n      need_lib_prefix=no\n      ;;\n    motorola)\n      need_lib_prefix=no\n      need_version=no\n      shlibpath_overrides_runpath=no\n      sys_lib_search_path_spec='/lib /usr/lib /usr/ccs/lib'\n      ;;\n  esac\n  ;;\n\nsysv4*MP*)\n  if test -d /usr/nec ;then\n    version_type=linux # correct to gnu/linux during the next big refactor\n    library_names_spec='$libname${shared_ext}.$versuffix $libname${shared_ext}.$major $libname${shared_ext}'\n    soname_spec='$libname${shared_ext}.$major'\n    shlibpath_var=LD_LIBRARY_PATH\n  fi\n  ;;\n\nsysv5* | sco3.2v5* | sco5v6* | unixware* | OpenUNIX* | sysv4*uw2*)\n  version_type=freebsd-elf\n  need_lib_prefix=no\n  need_version=no\n  library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext} $libname${shared_ext}'\n  soname_spec='${libname}${release}${shared_ext}$major'\n  shlibpath_var=LD_LIBRARY_PATH\n  shlibpath_overrides_runpath=yes\n  hardcode_into_libs=yes\n  if test \"$with_gnu_ld\" = yes; then\n    sys_lib_search_path_spec='/usr/local/lib /usr/gnu/lib /usr/ccs/lib /usr/lib /lib'\n  else\n    sys_lib_search_path_spec='/usr/ccs/lib /usr/lib'\n    case $host_os in\n      sco3.2v5*)\n        sys_lib_search_path_spec=\"$sys_lib_search_path_spec /lib\"\n\t;;\n    esac\n  fi\n  sys_lib_dlsearch_path_spec='/usr/lib'\n  ;;\n\ntpf*)\n  # TPF is a cross-target only.  Preferred cross-host = GNU/Linux.\n  version_type=linux # correct to gnu/linux during the next big refactor\n  need_lib_prefix=no\n  need_version=no\n  library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'\n  shlibpath_var=LD_LIBRARY_PATH\n  shlibpath_overrides_runpath=no\n  hardcode_into_libs=yes\n  ;;\n\nuts4*)\n  version_type=linux # correct to gnu/linux during the next big refactor\n  library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'\n  soname_spec='${libname}${release}${shared_ext}$major'\n  shlibpath_var=LD_LIBRARY_PATH\n  ;;\n\n*)\n  dynamic_linker=no\n  ;;\nesac\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $dynamic_linker\" >&5\n$as_echo \"$dynamic_linker\" >&6; }\ntest \"$dynamic_linker\" = no && can_build_shared=no\n\nvariables_saved_for_relink=\"PATH $shlibpath_var $runpath_var\"\nif test \"$GCC\" = yes; then\n  variables_saved_for_relink=\"$variables_saved_for_relink GCC_EXEC_PREFIX COMPILER_PATH LIBRARY_PATH\"\nfi\n\nif test \"${lt_cv_sys_lib_search_path_spec+set}\" = set; then\n  sys_lib_search_path_spec=\"$lt_cv_sys_lib_search_path_spec\"\nfi\nif test \"${lt_cv_sys_lib_dlsearch_path_spec+set}\" = set; then\n  sys_lib_dlsearch_path_spec=\"$lt_cv_sys_lib_dlsearch_path_spec\"\nfi\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: checking how to hardcode library paths into programs\" >&5\n$as_echo_n \"checking how to hardcode library paths into programs... \" >&6; }\nhardcode_action=\nif test -n \"$hardcode_libdir_flag_spec\" ||\n   test -n \"$runpath_var\" ||\n   test \"X$hardcode_automatic\" = \"Xyes\" ; then\n\n  # We can hardcode non-existent directories.\n  if test \"$hardcode_direct\" != no &&\n     # If the only mechanism to avoid hardcoding is shlibpath_var, we\n     # have to relink, otherwise we might link with an installed library\n     # when we should be linking with a yet-to-be-installed one\n     ## test \"$_LT_TAGVAR(hardcode_shlibpath_var, )\" != no &&\n     test \"$hardcode_minus_L\" != no; then\n    # Linking always hardcodes the temporary library directory.\n    hardcode_action=relink\n  else\n    # We can link without hardcoding, and we can hardcode nonexisting dirs.\n    hardcode_action=immediate\n  fi\nelse\n  # We cannot hardcode anything, or else we can only hardcode existing\n  # directories.\n  hardcode_action=unsupported\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $hardcode_action\" >&5\n$as_echo \"$hardcode_action\" >&6; }\n\nif test \"$hardcode_action\" = relink ||\n   test \"$inherit_rpath\" = yes; then\n  # Fast installation is not supported\n  enable_fast_install=no\nelif test \"$shlibpath_overrides_runpath\" = yes ||\n     test \"$enable_shared\" = no; then\n  # Fast installation is not necessary\n  enable_fast_install=needless\nfi\n\n\n\n\n\n\n  if test \"x$enable_dlopen\" != xyes; then\n  enable_dlopen=unknown\n  enable_dlopen_self=unknown\n  enable_dlopen_self_static=unknown\nelse\n  lt_cv_dlopen=no\n  lt_cv_dlopen_libs=\n\n  case $host_os in\n  beos*)\n    lt_cv_dlopen=\"load_add_on\"\n    lt_cv_dlopen_libs=\n    lt_cv_dlopen_self=yes\n    ;;\n\n  mingw* | pw32* | cegcc*)\n    lt_cv_dlopen=\"LoadLibrary\"\n    lt_cv_dlopen_libs=\n    ;;\n\n  cygwin*)\n    lt_cv_dlopen=\"dlopen\"\n    lt_cv_dlopen_libs=\n    ;;\n\n  darwin*)\n  # if libdl is installed we need to link against it\n    { $as_echo \"$as_me:${as_lineno-$LINENO}: checking for dlopen in -ldl\" >&5\n$as_echo_n \"checking for dlopen in -ldl... \" >&6; }\nif ${ac_cv_lib_dl_dlopen+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  ac_check_lib_save_LIBS=$LIBS\nLIBS=\"-ldl  $LIBS\"\ncat confdefs.h - <<_ACEOF >conftest.$ac_ext\n/* end confdefs.h.  */\n\n/* Override any GCC internal prototype to avoid an error.\n   Use char because int might match the return type of a GCC\n   builtin and then its argument prototype would still apply.  */\n#ifdef __cplusplus\nextern \"C\"\n#endif\nchar dlopen ();\nint\nmain ()\n{\nreturn dlopen ();\n  ;\n  return 0;\n}\n_ACEOF\nif ac_fn_c_try_link \"$LINENO\"; then :\n  ac_cv_lib_dl_dlopen=yes\nelse\n  ac_cv_lib_dl_dlopen=no\nfi\nrm -f core conftest.err conftest.$ac_objext \\\n    conftest$ac_exeext conftest.$ac_ext\nLIBS=$ac_check_lib_save_LIBS\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_dl_dlopen\" >&5\n$as_echo \"$ac_cv_lib_dl_dlopen\" >&6; }\nif test \"x$ac_cv_lib_dl_dlopen\" = xyes; then :\n  lt_cv_dlopen=\"dlopen\" lt_cv_dlopen_libs=\"-ldl\"\nelse\n\n    lt_cv_dlopen=\"dyld\"\n    lt_cv_dlopen_libs=\n    lt_cv_dlopen_self=yes\n\nfi\n\n    ;;\n\n  *)\n    ac_fn_c_check_func \"$LINENO\" \"shl_load\" \"ac_cv_func_shl_load\"\nif test \"x$ac_cv_func_shl_load\" = xyes; then :\n  lt_cv_dlopen=\"shl_load\"\nelse\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: checking for shl_load in -ldld\" >&5\n$as_echo_n \"checking for shl_load in -ldld... \" >&6; }\nif ${ac_cv_lib_dld_shl_load+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  ac_check_lib_save_LIBS=$LIBS\nLIBS=\"-ldld  $LIBS\"\ncat confdefs.h - <<_ACEOF >conftest.$ac_ext\n/* end confdefs.h.  */\n\n/* Override any GCC internal prototype to avoid an error.\n   Use char because int might match the return type of a GCC\n   builtin and then its argument prototype would still apply.  */\n#ifdef __cplusplus\nextern \"C\"\n#endif\nchar shl_load ();\nint\nmain ()\n{\nreturn shl_load ();\n  ;\n  return 0;\n}\n_ACEOF\nif ac_fn_c_try_link \"$LINENO\"; then :\n  ac_cv_lib_dld_shl_load=yes\nelse\n  ac_cv_lib_dld_shl_load=no\nfi\nrm -f core conftest.err conftest.$ac_objext \\\n    conftest$ac_exeext conftest.$ac_ext\nLIBS=$ac_check_lib_save_LIBS\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_dld_shl_load\" >&5\n$as_echo \"$ac_cv_lib_dld_shl_load\" >&6; }\nif test \"x$ac_cv_lib_dld_shl_load\" = xyes; then :\n  lt_cv_dlopen=\"shl_load\" lt_cv_dlopen_libs=\"-ldld\"\nelse\n  ac_fn_c_check_func \"$LINENO\" \"dlopen\" \"ac_cv_func_dlopen\"\nif test \"x$ac_cv_func_dlopen\" = xyes; then :\n  lt_cv_dlopen=\"dlopen\"\nelse\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: checking for dlopen in -ldl\" >&5\n$as_echo_n \"checking for dlopen in -ldl... \" >&6; }\nif ${ac_cv_lib_dl_dlopen+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  ac_check_lib_save_LIBS=$LIBS\nLIBS=\"-ldl  $LIBS\"\ncat confdefs.h - <<_ACEOF >conftest.$ac_ext\n/* end confdefs.h.  */\n\n/* Override any GCC internal prototype to avoid an error.\n   Use char because int might match the return type of a GCC\n   builtin and then its argument prototype would still apply.  */\n#ifdef __cplusplus\nextern \"C\"\n#endif\nchar dlopen ();\nint\nmain ()\n{\nreturn dlopen ();\n  ;\n  return 0;\n}\n_ACEOF\nif ac_fn_c_try_link \"$LINENO\"; then :\n  ac_cv_lib_dl_dlopen=yes\nelse\n  ac_cv_lib_dl_dlopen=no\nfi\nrm -f core conftest.err conftest.$ac_objext \\\n    conftest$ac_exeext conftest.$ac_ext\nLIBS=$ac_check_lib_save_LIBS\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_dl_dlopen\" >&5\n$as_echo \"$ac_cv_lib_dl_dlopen\" >&6; }\nif test \"x$ac_cv_lib_dl_dlopen\" = xyes; then :\n  lt_cv_dlopen=\"dlopen\" lt_cv_dlopen_libs=\"-ldl\"\nelse\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: checking for dlopen in -lsvld\" >&5\n$as_echo_n \"checking for dlopen in -lsvld... \" >&6; }\nif ${ac_cv_lib_svld_dlopen+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  ac_check_lib_save_LIBS=$LIBS\nLIBS=\"-lsvld  $LIBS\"\ncat confdefs.h - <<_ACEOF >conftest.$ac_ext\n/* end confdefs.h.  */\n\n/* Override any GCC internal prototype to avoid an error.\n   Use char because int might match the return type of a GCC\n   builtin and then its argument prototype would still apply.  */\n#ifdef __cplusplus\nextern \"C\"\n#endif\nchar dlopen ();\nint\nmain ()\n{\nreturn dlopen ();\n  ;\n  return 0;\n}\n_ACEOF\nif ac_fn_c_try_link \"$LINENO\"; then :\n  ac_cv_lib_svld_dlopen=yes\nelse\n  ac_cv_lib_svld_dlopen=no\nfi\nrm -f core conftest.err conftest.$ac_objext \\\n    conftest$ac_exeext conftest.$ac_ext\nLIBS=$ac_check_lib_save_LIBS\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_svld_dlopen\" >&5\n$as_echo \"$ac_cv_lib_svld_dlopen\" >&6; }\nif test \"x$ac_cv_lib_svld_dlopen\" = xyes; then :\n  lt_cv_dlopen=\"dlopen\" lt_cv_dlopen_libs=\"-lsvld\"\nelse\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: checking for dld_link in -ldld\" >&5\n$as_echo_n \"checking for dld_link in -ldld... \" >&6; }\nif ${ac_cv_lib_dld_dld_link+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  ac_check_lib_save_LIBS=$LIBS\nLIBS=\"-ldld  $LIBS\"\ncat confdefs.h - <<_ACEOF >conftest.$ac_ext\n/* end confdefs.h.  */\n\n/* Override any GCC internal prototype to avoid an error.\n   Use char because int might match the return type of a GCC\n   builtin and then its argument prototype would still apply.  */\n#ifdef __cplusplus\nextern \"C\"\n#endif\nchar dld_link ();\nint\nmain ()\n{\nreturn dld_link ();\n  ;\n  return 0;\n}\n_ACEOF\nif ac_fn_c_try_link \"$LINENO\"; then :\n  ac_cv_lib_dld_dld_link=yes\nelse\n  ac_cv_lib_dld_dld_link=no\nfi\nrm -f core conftest.err conftest.$ac_objext \\\n    conftest$ac_exeext conftest.$ac_ext\nLIBS=$ac_check_lib_save_LIBS\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_dld_dld_link\" >&5\n$as_echo \"$ac_cv_lib_dld_dld_link\" >&6; }\nif test \"x$ac_cv_lib_dld_dld_link\" = xyes; then :\n  lt_cv_dlopen=\"dld_link\" lt_cv_dlopen_libs=\"-ldld\"\nfi\n\n\nfi\n\n\nfi\n\n\nfi\n\n\nfi\n\n\nfi\n\n    ;;\n  esac\n\n  if test \"x$lt_cv_dlopen\" != xno; then\n    enable_dlopen=yes\n  else\n    enable_dlopen=no\n  fi\n\n  case $lt_cv_dlopen in\n  dlopen)\n    save_CPPFLAGS=\"$CPPFLAGS\"\n    test \"x$ac_cv_header_dlfcn_h\" = xyes && CPPFLAGS=\"$CPPFLAGS -DHAVE_DLFCN_H\"\n\n    save_LDFLAGS=\"$LDFLAGS\"\n    wl=$lt_prog_compiler_wl eval LDFLAGS=\\\"\\$LDFLAGS $export_dynamic_flag_spec\\\"\n\n    save_LIBS=\"$LIBS\"\n    LIBS=\"$lt_cv_dlopen_libs $LIBS\"\n\n    { $as_echo \"$as_me:${as_lineno-$LINENO}: checking whether a program can dlopen itself\" >&5\n$as_echo_n \"checking whether a program can dlopen itself... \" >&6; }\nif ${lt_cv_dlopen_self+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  \t  if test \"$cross_compiling\" = yes; then :\n  lt_cv_dlopen_self=cross\nelse\n  lt_dlunknown=0; lt_dlno_uscore=1; lt_dlneed_uscore=2\n  lt_status=$lt_dlunknown\n  cat > conftest.$ac_ext <<_LT_EOF\n#line $LINENO \"configure\"\n#include \"confdefs.h\"\n\n#if HAVE_DLFCN_H\n#include <dlfcn.h>\n#endif\n\n#include <stdio.h>\n\n#ifdef RTLD_GLOBAL\n#  define LT_DLGLOBAL\t\tRTLD_GLOBAL\n#else\n#  ifdef DL_GLOBAL\n#    define LT_DLGLOBAL\t\tDL_GLOBAL\n#  else\n#    define LT_DLGLOBAL\t\t0\n#  endif\n#endif\n\n/* We may have to define LT_DLLAZY_OR_NOW in the command line if we\n   find out it does not work in some platform. */\n#ifndef LT_DLLAZY_OR_NOW\n#  ifdef RTLD_LAZY\n#    define LT_DLLAZY_OR_NOW\t\tRTLD_LAZY\n#  else\n#    ifdef DL_LAZY\n#      define LT_DLLAZY_OR_NOW\t\tDL_LAZY\n#    else\n#      ifdef RTLD_NOW\n#        define LT_DLLAZY_OR_NOW\tRTLD_NOW\n#      else\n#        ifdef DL_NOW\n#          define LT_DLLAZY_OR_NOW\tDL_NOW\n#        else\n#          define LT_DLLAZY_OR_NOW\t0\n#        endif\n#      endif\n#    endif\n#  endif\n#endif\n\n/* When -fvisbility=hidden is used, assume the code has been annotated\n   correspondingly for the symbols needed.  */\n#if defined(__GNUC__) && (((__GNUC__ == 3) && (__GNUC_MINOR__ >= 3)) || (__GNUC__ > 3))\nint fnord () __attribute__((visibility(\"default\")));\n#endif\n\nint fnord () { return 42; }\nint main ()\n{\n  void *self = dlopen (0, LT_DLGLOBAL|LT_DLLAZY_OR_NOW);\n  int status = $lt_dlunknown;\n\n  if (self)\n    {\n      if (dlsym (self,\"fnord\"))       status = $lt_dlno_uscore;\n      else\n        {\n\t  if (dlsym( self,\"_fnord\"))  status = $lt_dlneed_uscore;\n          else puts (dlerror ());\n\t}\n      /* dlclose (self); */\n    }\n  else\n    puts (dlerror ());\n\n  return status;\n}\n_LT_EOF\n  if { { eval echo \"\\\"\\$as_me\\\":${as_lineno-$LINENO}: \\\"$ac_link\\\"\"; } >&5\n  (eval $ac_link) 2>&5\n  ac_status=$?\n  $as_echo \"$as_me:${as_lineno-$LINENO}: \\$? = $ac_status\" >&5\n  test $ac_status = 0; } && test -s conftest${ac_exeext} 2>/dev/null; then\n    (./conftest; exit; ) >&5 2>/dev/null\n    lt_status=$?\n    case x$lt_status in\n      x$lt_dlno_uscore) lt_cv_dlopen_self=yes ;;\n      x$lt_dlneed_uscore) lt_cv_dlopen_self=yes ;;\n      x$lt_dlunknown|x*) lt_cv_dlopen_self=no ;;\n    esac\n  else :\n    # compilation failed\n    lt_cv_dlopen_self=no\n  fi\nfi\nrm -fr conftest*\n\n\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $lt_cv_dlopen_self\" >&5\n$as_echo \"$lt_cv_dlopen_self\" >&6; }\n\n    if test \"x$lt_cv_dlopen_self\" = xyes; then\n      wl=$lt_prog_compiler_wl eval LDFLAGS=\\\"\\$LDFLAGS $lt_prog_compiler_static\\\"\n      { $as_echo \"$as_me:${as_lineno-$LINENO}: checking whether a statically linked program can dlopen itself\" >&5\n$as_echo_n \"checking whether a statically linked program can dlopen itself... \" >&6; }\nif ${lt_cv_dlopen_self_static+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  \t  if test \"$cross_compiling\" = yes; then :\n  lt_cv_dlopen_self_static=cross\nelse\n  lt_dlunknown=0; lt_dlno_uscore=1; lt_dlneed_uscore=2\n  lt_status=$lt_dlunknown\n  cat > conftest.$ac_ext <<_LT_EOF\n#line $LINENO \"configure\"\n#include \"confdefs.h\"\n\n#if HAVE_DLFCN_H\n#include <dlfcn.h>\n#endif\n\n#include <stdio.h>\n\n#ifdef RTLD_GLOBAL\n#  define LT_DLGLOBAL\t\tRTLD_GLOBAL\n#else\n#  ifdef DL_GLOBAL\n#    define LT_DLGLOBAL\t\tDL_GLOBAL\n#  else\n#    define LT_DLGLOBAL\t\t0\n#  endif\n#endif\n\n/* We may have to define LT_DLLAZY_OR_NOW in the command line if we\n   find out it does not work in some platform. */\n#ifndef LT_DLLAZY_OR_NOW\n#  ifdef RTLD_LAZY\n#    define LT_DLLAZY_OR_NOW\t\tRTLD_LAZY\n#  else\n#    ifdef DL_LAZY\n#      define LT_DLLAZY_OR_NOW\t\tDL_LAZY\n#    else\n#      ifdef RTLD_NOW\n#        define LT_DLLAZY_OR_NOW\tRTLD_NOW\n#      else\n#        ifdef DL_NOW\n#          define LT_DLLAZY_OR_NOW\tDL_NOW\n#        else\n#          define LT_DLLAZY_OR_NOW\t0\n#        endif\n#      endif\n#    endif\n#  endif\n#endif\n\n/* When -fvisbility=hidden is used, assume the code has been annotated\n   correspondingly for the symbols needed.  */\n#if defined(__GNUC__) && (((__GNUC__ == 3) && (__GNUC_MINOR__ >= 3)) || (__GNUC__ > 3))\nint fnord () __attribute__((visibility(\"default\")));\n#endif\n\nint fnord () { return 42; }\nint main ()\n{\n  void *self = dlopen (0, LT_DLGLOBAL|LT_DLLAZY_OR_NOW);\n  int status = $lt_dlunknown;\n\n  if (self)\n    {\n      if (dlsym (self,\"fnord\"))       status = $lt_dlno_uscore;\n      else\n        {\n\t  if (dlsym( self,\"_fnord\"))  status = $lt_dlneed_uscore;\n          else puts (dlerror ());\n\t}\n      /* dlclose (self); */\n    }\n  else\n    puts (dlerror ());\n\n  return status;\n}\n_LT_EOF\n  if { { eval echo \"\\\"\\$as_me\\\":${as_lineno-$LINENO}: \\\"$ac_link\\\"\"; } >&5\n  (eval $ac_link) 2>&5\n  ac_status=$?\n  $as_echo \"$as_me:${as_lineno-$LINENO}: \\$? = $ac_status\" >&5\n  test $ac_status = 0; } && test -s conftest${ac_exeext} 2>/dev/null; then\n    (./conftest; exit; ) >&5 2>/dev/null\n    lt_status=$?\n    case x$lt_status in\n      x$lt_dlno_uscore) lt_cv_dlopen_self_static=yes ;;\n      x$lt_dlneed_uscore) lt_cv_dlopen_self_static=yes ;;\n      x$lt_dlunknown|x*) lt_cv_dlopen_self_static=no ;;\n    esac\n  else :\n    # compilation failed\n    lt_cv_dlopen_self_static=no\n  fi\nfi\nrm -fr conftest*\n\n\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $lt_cv_dlopen_self_static\" >&5\n$as_echo \"$lt_cv_dlopen_self_static\" >&6; }\n    fi\n\n    CPPFLAGS=\"$save_CPPFLAGS\"\n    LDFLAGS=\"$save_LDFLAGS\"\n    LIBS=\"$save_LIBS\"\n    ;;\n  esac\n\n  case $lt_cv_dlopen_self in\n  yes|no) enable_dlopen_self=$lt_cv_dlopen_self ;;\n  *) enable_dlopen_self=unknown ;;\n  esac\n\n  case $lt_cv_dlopen_self_static in\n  yes|no) enable_dlopen_self_static=$lt_cv_dlopen_self_static ;;\n  *) enable_dlopen_self_static=unknown ;;\n  esac\nfi\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\nstriplib=\nold_striplib=\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking whether stripping libraries is possible\" >&5\n$as_echo_n \"checking whether stripping libraries is possible... \" >&6; }\nif test -n \"$STRIP\" && $STRIP -V 2>&1 | $GREP \"GNU strip\" >/dev/null; then\n  test -z \"$old_striplib\" && old_striplib=\"$STRIP --strip-debug\"\n  test -z \"$striplib\" && striplib=\"$STRIP --strip-unneeded\"\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: yes\" >&5\n$as_echo \"yes\" >&6; }\nelse\n# FIXME - insert some real tests, host_os isn't really good enough\n  case $host_os in\n  darwin*)\n    if test -n \"$STRIP\" ; then\n      striplib=\"$STRIP -x\"\n      old_striplib=\"$STRIP -S\"\n      { $as_echo \"$as_me:${as_lineno-$LINENO}: result: yes\" >&5\n$as_echo \"yes\" >&6; }\n    else\n      { $as_echo \"$as_me:${as_lineno-$LINENO}: result: no\" >&5\n$as_echo \"no\" >&6; }\n    fi\n    ;;\n  *)\n    { $as_echo \"$as_me:${as_lineno-$LINENO}: result: no\" >&5\n$as_echo \"no\" >&6; }\n    ;;\n  esac\nfi\n\n\n\n\n\n\n\n\n\n\n\n\n  # Report which library types will actually be built\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: checking if libtool supports shared libraries\" >&5\n$as_echo_n \"checking if libtool supports shared libraries... \" >&6; }\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: $can_build_shared\" >&5\n$as_echo \"$can_build_shared\" >&6; }\n\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: checking whether to build shared libraries\" >&5\n$as_echo_n \"checking whether to build shared libraries... \" >&6; }\n  test \"$can_build_shared\" = \"no\" && enable_shared=no\n\n  # On AIX, shared libraries and static libraries use the same namespace, and\n  # are all built from PIC.\n  case $host_os in\n  aix3*)\n    test \"$enable_shared\" = yes && enable_static=no\n    if test -n \"$RANLIB\"; then\n      archive_cmds=\"$archive_cmds~\\$RANLIB \\$lib\"\n      postinstall_cmds='$RANLIB $lib'\n    fi\n    ;;\n\n  aix[4-9]*)\n    if test \"$host_cpu\" != ia64 && test \"$aix_use_runtimelinking\" = no ; then\n      test \"$enable_shared\" = yes && enable_static=no\n    fi\n    ;;\n  esac\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: $enable_shared\" >&5\n$as_echo \"$enable_shared\" >&6; }\n\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: checking whether to build static libraries\" >&5\n$as_echo_n \"checking whether to build static libraries... \" >&6; }\n  # Make sure either enable_shared or enable_static is yes.\n  test \"$enable_shared\" = yes || enable_static=yes\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: $enable_static\" >&5\n$as_echo \"$enable_static\" >&6; }\n\n\n\n\nfi\nac_ext=c\nac_cpp='$CPP $CPPFLAGS'\nac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5'\nac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5'\nac_compiler_gnu=$ac_cv_c_compiler_gnu\n\nCC=\"$lt_save_CC\"\n\n      if test -n \"$CXX\" && ( test \"X$CXX\" != \"Xno\" &&\n    ( (test \"X$CXX\" = \"Xg++\" && `g++ -v >/dev/null 2>&1` ) ||\n    (test \"X$CXX\" != \"Xg++\"))) ; then\n  ac_ext=cpp\nac_cpp='$CXXCPP $CPPFLAGS'\nac_compile='$CXX -c $CXXFLAGS $CPPFLAGS conftest.$ac_ext >&5'\nac_link='$CXX -o conftest$ac_exeext $CXXFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5'\nac_compiler_gnu=$ac_cv_cxx_compiler_gnu\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking how to run the C++ preprocessor\" >&5\n$as_echo_n \"checking how to run the C++ preprocessor... \" >&6; }\nif test -z \"$CXXCPP\"; then\n  if ${ac_cv_prog_CXXCPP+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n      # Double quotes because CXXCPP needs to be expanded\n    for CXXCPP in \"$CXX -E\" \"/lib/cpp\"\n    do\n      ac_preproc_ok=false\nfor ac_cxx_preproc_warn_flag in '' yes\ndo\n  # Use a header file that comes with gcc, so configuring glibc\n  # with a fresh cross-compiler works.\n  # Prefer <limits.h> to <assert.h> if __STDC__ is defined, since\n  # <limits.h> exists even on freestanding compilers.\n  # On the NeXT, cc -E runs the code through the compiler's parser,\n  # not just through cpp. \"Syntax error\" is here to catch this case.\n  cat confdefs.h - <<_ACEOF >conftest.$ac_ext\n/* end confdefs.h.  */\n#ifdef __STDC__\n# include <limits.h>\n#else\n# include <assert.h>\n#endif\n\t\t     Syntax error\n_ACEOF\nif ac_fn_cxx_try_cpp \"$LINENO\"; then :\n\nelse\n  # Broken: fails on valid input.\ncontinue\nfi\nrm -f conftest.err conftest.i conftest.$ac_ext\n\n  # OK, works on sane cases.  Now check whether nonexistent headers\n  # can be detected and how.\n  cat confdefs.h - <<_ACEOF >conftest.$ac_ext\n/* end confdefs.h.  */\n#include <ac_nonexistent.h>\n_ACEOF\nif ac_fn_cxx_try_cpp \"$LINENO\"; then :\n  # Broken: success on invalid input.\ncontinue\nelse\n  # Passes both tests.\nac_preproc_ok=:\nbreak\nfi\nrm -f conftest.err conftest.i conftest.$ac_ext\n\ndone\n# Because of `break', _AC_PREPROC_IFELSE's cleaning code was skipped.\nrm -f conftest.i conftest.err conftest.$ac_ext\nif $ac_preproc_ok; then :\n  break\nfi\n\n    done\n    ac_cv_prog_CXXCPP=$CXXCPP\n\nfi\n  CXXCPP=$ac_cv_prog_CXXCPP\nelse\n  ac_cv_prog_CXXCPP=$CXXCPP\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $CXXCPP\" >&5\n$as_echo \"$CXXCPP\" >&6; }\nac_preproc_ok=false\nfor ac_cxx_preproc_warn_flag in '' yes\ndo\n  # Use a header file that comes with gcc, so configuring glibc\n  # with a fresh cross-compiler works.\n  # Prefer <limits.h> to <assert.h> if __STDC__ is defined, since\n  # <limits.h> exists even on freestanding compilers.\n  # On the NeXT, cc -E runs the code through the compiler's parser,\n  # not just through cpp. \"Syntax error\" is here to catch this case.\n  cat confdefs.h - <<_ACEOF >conftest.$ac_ext\n/* end confdefs.h.  */\n#ifdef __STDC__\n# include <limits.h>\n#else\n# include <assert.h>\n#endif\n\t\t     Syntax error\n_ACEOF\nif ac_fn_cxx_try_cpp \"$LINENO\"; then :\n\nelse\n  # Broken: fails on valid input.\ncontinue\nfi\nrm -f conftest.err conftest.i conftest.$ac_ext\n\n  # OK, works on sane cases.  Now check whether nonexistent headers\n  # can be detected and how.\n  cat confdefs.h - <<_ACEOF >conftest.$ac_ext\n/* end confdefs.h.  */\n#include <ac_nonexistent.h>\n_ACEOF\nif ac_fn_cxx_try_cpp \"$LINENO\"; then :\n  # Broken: success on invalid input.\ncontinue\nelse\n  # Passes both tests.\nac_preproc_ok=:\nbreak\nfi\nrm -f conftest.err conftest.i conftest.$ac_ext\n\ndone\n# Because of `break', _AC_PREPROC_IFELSE's cleaning code was skipped.\nrm -f conftest.i conftest.err conftest.$ac_ext\nif $ac_preproc_ok; then :\n\nelse\n  { { $as_echo \"$as_me:${as_lineno-$LINENO}: error: in \\`$ac_pwd':\" >&5\n$as_echo \"$as_me: error: in \\`$ac_pwd':\" >&2;}\nas_fn_error $? \"C++ preprocessor \\\"$CXXCPP\\\" fails sanity check\nSee \\`config.log' for more details\" \"$LINENO\" 5; }\nfi\n\nac_ext=c\nac_cpp='$CPP $CPPFLAGS'\nac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5'\nac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5'\nac_compiler_gnu=$ac_cv_c_compiler_gnu\n\nelse\n  _lt_caught_CXX_error=yes\nfi\n\nac_ext=cpp\nac_cpp='$CXXCPP $CPPFLAGS'\nac_compile='$CXX -c $CXXFLAGS $CPPFLAGS conftest.$ac_ext >&5'\nac_link='$CXX -o conftest$ac_exeext $CXXFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5'\nac_compiler_gnu=$ac_cv_cxx_compiler_gnu\n\narchive_cmds_need_lc_CXX=no\nallow_undefined_flag_CXX=\nalways_export_symbols_CXX=no\narchive_expsym_cmds_CXX=\ncompiler_needs_object_CXX=no\nexport_dynamic_flag_spec_CXX=\nhardcode_direct_CXX=no\nhardcode_direct_absolute_CXX=no\nhardcode_libdir_flag_spec_CXX=\nhardcode_libdir_separator_CXX=\nhardcode_minus_L_CXX=no\nhardcode_shlibpath_var_CXX=unsupported\nhardcode_automatic_CXX=no\ninherit_rpath_CXX=no\nmodule_cmds_CXX=\nmodule_expsym_cmds_CXX=\nlink_all_deplibs_CXX=unknown\nold_archive_cmds_CXX=$old_archive_cmds\nreload_flag_CXX=$reload_flag\nreload_cmds_CXX=$reload_cmds\nno_undefined_flag_CXX=\nwhole_archive_flag_spec_CXX=\nenable_shared_with_static_runtimes_CXX=no\n\n# Source file extension for C++ test sources.\nac_ext=cpp\n\n# Object file extension for compiled C++ test sources.\nobjext=o\nobjext_CXX=$objext\n\n# No sense in running all these tests if we already determined that\n# the CXX compiler isn't working.  Some variables (like enable_shared)\n# are currently assumed to apply to all compilers on this platform,\n# and will be corrupted by setting them based on a non-working compiler.\nif test \"$_lt_caught_CXX_error\" != yes; then\n  # Code to be used in simple compile tests\n  lt_simple_compile_test_code=\"int some_variable = 0;\"\n\n  # Code to be used in simple link tests\n  lt_simple_link_test_code='int main(int, char *[]) { return(0); }'\n\n  # ltmain only uses $CC for tagged configurations so make sure $CC is set.\n\n\n\n\n\n\n# If no C compiler was specified, use CC.\nLTCC=${LTCC-\"$CC\"}\n\n# If no C compiler flags were specified, use CFLAGS.\nLTCFLAGS=${LTCFLAGS-\"$CFLAGS\"}\n\n# Allow CC to be a program name with arguments.\ncompiler=$CC\n\n\n  # save warnings/boilerplate of simple test code\n  ac_outfile=conftest.$ac_objext\necho \"$lt_simple_compile_test_code\" >conftest.$ac_ext\neval \"$ac_compile\" 2>&1 >/dev/null | $SED '/^$/d; /^ *+/d' >conftest.err\n_lt_compiler_boilerplate=`cat conftest.err`\n$RM conftest*\n\n  ac_outfile=conftest.$ac_objext\necho \"$lt_simple_link_test_code\" >conftest.$ac_ext\neval \"$ac_link\" 2>&1 >/dev/null | $SED '/^$/d; /^ *+/d' >conftest.err\n_lt_linker_boilerplate=`cat conftest.err`\n$RM -r conftest*\n\n\n  # Allow CC to be a program name with arguments.\n  lt_save_CC=$CC\n  lt_save_CFLAGS=$CFLAGS\n  lt_save_LD=$LD\n  lt_save_GCC=$GCC\n  GCC=$GXX\n  lt_save_with_gnu_ld=$with_gnu_ld\n  lt_save_path_LD=$lt_cv_path_LD\n  if test -n \"${lt_cv_prog_gnu_ldcxx+set}\"; then\n    lt_cv_prog_gnu_ld=$lt_cv_prog_gnu_ldcxx\n  else\n    $as_unset lt_cv_prog_gnu_ld\n  fi\n  if test -n \"${lt_cv_path_LDCXX+set}\"; then\n    lt_cv_path_LD=$lt_cv_path_LDCXX\n  else\n    $as_unset lt_cv_path_LD\n  fi\n  test -z \"${LDCXX+set}\" || LD=$LDCXX\n  CC=${CXX-\"c++\"}\n  CFLAGS=$CXXFLAGS\n  compiler=$CC\n  compiler_CXX=$CC\n  for cc_temp in $compiler\"\"; do\n  case $cc_temp in\n    compile | *[\\\\/]compile | ccache | *[\\\\/]ccache ) ;;\n    distcc | *[\\\\/]distcc | purify | *[\\\\/]purify ) ;;\n    \\-*) ;;\n    *) break;;\n  esac\ndone\ncc_basename=`$ECHO \"$cc_temp\" | $SED \"s%.*/%%; s%^$host_alias-%%\"`\n\n\n  if test -n \"$compiler\"; then\n    # We don't want -fno-exception when compiling C++ code, so set the\n    # no_builtin_flag separately\n    if test \"$GXX\" = yes; then\n      lt_prog_compiler_no_builtin_flag_CXX=' -fno-builtin'\n    else\n      lt_prog_compiler_no_builtin_flag_CXX=\n    fi\n\n    if test \"$GXX\" = yes; then\n      # Set up default GNU C++ configuration\n\n\n\n# Check whether --with-gnu-ld was given.\nif test \"${with_gnu_ld+set}\" = set; then :\n  withval=$with_gnu_ld; test \"$withval\" = no || with_gnu_ld=yes\nelse\n  with_gnu_ld=no\nfi\n\nac_prog=ld\nif test \"$GCC\" = yes; then\n  # Check if gcc -print-prog-name=ld gives a path.\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: checking for ld used by $CC\" >&5\n$as_echo_n \"checking for ld used by $CC... \" >&6; }\n  case $host in\n  *-*-mingw*)\n    # gcc leaves a trailing carriage return which upsets mingw\n    ac_prog=`($CC -print-prog-name=ld) 2>&5 | tr -d '\\015'` ;;\n  *)\n    ac_prog=`($CC -print-prog-name=ld) 2>&5` ;;\n  esac\n  case $ac_prog in\n    # Accept absolute paths.\n    [\\\\/]* | ?:[\\\\/]*)\n      re_direlt='/[^/][^/]*/\\.\\./'\n      # Canonicalize the pathname of ld\n      ac_prog=`$ECHO \"$ac_prog\"| $SED 's%\\\\\\\\%/%g'`\n      while $ECHO \"$ac_prog\" | $GREP \"$re_direlt\" > /dev/null 2>&1; do\n\tac_prog=`$ECHO $ac_prog| $SED \"s%$re_direlt%/%\"`\n      done\n      test -z \"$LD\" && LD=\"$ac_prog\"\n      ;;\n  \"\")\n    # If it fails, then pretend we aren't using GCC.\n    ac_prog=ld\n    ;;\n  *)\n    # If it is relative, then search for the first ld in PATH.\n    with_gnu_ld=unknown\n    ;;\n  esac\nelif test \"$with_gnu_ld\" = yes; then\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: checking for GNU ld\" >&5\n$as_echo_n \"checking for GNU ld... \" >&6; }\nelse\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: checking for non-GNU ld\" >&5\n$as_echo_n \"checking for non-GNU ld... \" >&6; }\nfi\nif ${lt_cv_path_LD+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  if test -z \"$LD\"; then\n  lt_save_ifs=\"$IFS\"; IFS=$PATH_SEPARATOR\n  for ac_dir in $PATH; do\n    IFS=\"$lt_save_ifs\"\n    test -z \"$ac_dir\" && ac_dir=.\n    if test -f \"$ac_dir/$ac_prog\" || test -f \"$ac_dir/$ac_prog$ac_exeext\"; then\n      lt_cv_path_LD=\"$ac_dir/$ac_prog\"\n      # Check to see if the program is GNU ld.  I'd rather use --version,\n      # but apparently some variants of GNU ld only accept -v.\n      # Break only if it was the GNU/non-GNU ld that we prefer.\n      case `\"$lt_cv_path_LD\" -v 2>&1 </dev/null` in\n      *GNU* | *'with BFD'*)\n\ttest \"$with_gnu_ld\" != no && break\n\t;;\n      *)\n\ttest \"$with_gnu_ld\" != yes && break\n\t;;\n      esac\n    fi\n  done\n  IFS=\"$lt_save_ifs\"\nelse\n  lt_cv_path_LD=\"$LD\" # Let the user override the test with a path.\nfi\nfi\n\nLD=\"$lt_cv_path_LD\"\nif test -n \"$LD\"; then\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: $LD\" >&5\n$as_echo \"$LD\" >&6; }\nelse\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: no\" >&5\n$as_echo \"no\" >&6; }\nfi\ntest -z \"$LD\" && as_fn_error $? \"no acceptable ld found in \\$PATH\" \"$LINENO\" 5\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking if the linker ($LD) is GNU ld\" >&5\n$as_echo_n \"checking if the linker ($LD) is GNU ld... \" >&6; }\nif ${lt_cv_prog_gnu_ld+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  # I'd rather use --version here, but apparently some GNU lds only accept -v.\ncase `$LD -v 2>&1 </dev/null` in\n*GNU* | *'with BFD'*)\n  lt_cv_prog_gnu_ld=yes\n  ;;\n*)\n  lt_cv_prog_gnu_ld=no\n  ;;\nesac\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $lt_cv_prog_gnu_ld\" >&5\n$as_echo \"$lt_cv_prog_gnu_ld\" >&6; }\nwith_gnu_ld=$lt_cv_prog_gnu_ld\n\n\n\n\n\n\n\n      # Check if GNU C++ uses GNU ld as the underlying linker, since the\n      # archiving commands below assume that GNU ld is being used.\n      if test \"$with_gnu_ld\" = yes; then\n        archive_cmds_CXX='$CC $pic_flag -shared -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $wl$soname -o $lib'\n        archive_expsym_cmds_CXX='$CC $pic_flag -shared -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib'\n\n        hardcode_libdir_flag_spec_CXX='${wl}-rpath ${wl}$libdir'\n        export_dynamic_flag_spec_CXX='${wl}--export-dynamic'\n\n        # If archive_cmds runs LD, not CC, wlarc should be empty\n        # XXX I think wlarc can be eliminated in ltcf-cxx, but I need to\n        #     investigate it a little bit more. (MM)\n        wlarc='${wl}'\n\n        # ancient GNU ld didn't support --whole-archive et. al.\n        if eval \"`$CC -print-prog-name=ld` --help 2>&1\" |\n\t  $GREP 'no-whole-archive' > /dev/null; then\n          whole_archive_flag_spec_CXX=\"$wlarc\"'--whole-archive$convenience '\"$wlarc\"'--no-whole-archive'\n        else\n          whole_archive_flag_spec_CXX=\n        fi\n      else\n        with_gnu_ld=no\n        wlarc=\n\n        # A generic and very simple default shared library creation\n        # command for GNU C++ for the case where it uses the native\n        # linker, instead of GNU ld.  If possible, this setting should\n        # overridden to take advantage of the native linker features on\n        # the platform it is being used on.\n        archive_cmds_CXX='$CC -shared -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -o $lib'\n      fi\n\n      # Commands to make compiler produce verbose output that lists\n      # what \"hidden\" libraries, object files and flags are used when\n      # linking a shared library.\n      output_verbose_link_cmd='$CC -shared $CFLAGS -v conftest.$objext 2>&1 | $GREP -v \"^Configured with:\" | $GREP \"\\-L\"'\n\n    else\n      GXX=no\n      with_gnu_ld=no\n      wlarc=\n    fi\n\n    # PORTME: fill in a description of your system's C++ link characteristics\n    { $as_echo \"$as_me:${as_lineno-$LINENO}: checking whether the $compiler linker ($LD) supports shared libraries\" >&5\n$as_echo_n \"checking whether the $compiler linker ($LD) supports shared libraries... \" >&6; }\n    ld_shlibs_CXX=yes\n    case $host_os in\n      aix3*)\n        # FIXME: insert proper C++ library support\n        ld_shlibs_CXX=no\n        ;;\n      aix[4-9]*)\n        if test \"$host_cpu\" = ia64; then\n          # On IA64, the linker does run time linking by default, so we don't\n          # have to do anything special.\n          aix_use_runtimelinking=no\n          exp_sym_flag='-Bexport'\n          no_entry_flag=\"\"\n        else\n          aix_use_runtimelinking=no\n\n          # Test if we are trying to use run time linking or normal\n          # AIX style linking. If -brtl is somewhere in LDFLAGS, we\n          # need to do runtime linking.\n          case $host_os in aix4.[23]|aix4.[23].*|aix[5-9]*)\n\t    for ld_flag in $LDFLAGS; do\n\t      case $ld_flag in\n\t      *-brtl*)\n\t        aix_use_runtimelinking=yes\n\t        break\n\t        ;;\n\t      esac\n\t    done\n\t    ;;\n          esac\n\n          exp_sym_flag='-bexport'\n          no_entry_flag='-bnoentry'\n        fi\n\n        # When large executables or shared objects are built, AIX ld can\n        # have problems creating the table of contents.  If linking a library\n        # or program results in \"error TOC overflow\" add -mminimal-toc to\n        # CXXFLAGS/CFLAGS for g++/gcc.  In the cases where that is not\n        # enough to fix the problem, add -Wl,-bbigtoc to LDFLAGS.\n\n        archive_cmds_CXX=''\n        hardcode_direct_CXX=yes\n        hardcode_direct_absolute_CXX=yes\n        hardcode_libdir_separator_CXX=':'\n        link_all_deplibs_CXX=yes\n        file_list_spec_CXX='${wl}-f,'\n\n        if test \"$GXX\" = yes; then\n          case $host_os in aix4.[012]|aix4.[012].*)\n          # We only want to do this on AIX 4.2 and lower, the check\n          # below for broken collect2 doesn't work under 4.3+\n\t  collect2name=`${CC} -print-prog-name=collect2`\n\t  if test -f \"$collect2name\" &&\n\t     strings \"$collect2name\" | $GREP resolve_lib_name >/dev/null\n\t  then\n\t    # We have reworked collect2\n\t    :\n\t  else\n\t    # We have old collect2\n\t    hardcode_direct_CXX=unsupported\n\t    # It fails to find uninstalled libraries when the uninstalled\n\t    # path is not listed in the libpath.  Setting hardcode_minus_L\n\t    # to unsupported forces relinking\n\t    hardcode_minus_L_CXX=yes\n\t    hardcode_libdir_flag_spec_CXX='-L$libdir'\n\t    hardcode_libdir_separator_CXX=\n\t  fi\n          esac\n          shared_flag='-shared'\n\t  if test \"$aix_use_runtimelinking\" = yes; then\n\t    shared_flag=\"$shared_flag \"'${wl}-G'\n\t  fi\n        else\n          # not using gcc\n          if test \"$host_cpu\" = ia64; then\n\t  # VisualAge C++, Version 5.5 for AIX 5L for IA-64, Beta 3 Release\n\t  # chokes on -Wl,-G. The following line is correct:\n\t  shared_flag='-G'\n          else\n\t    if test \"$aix_use_runtimelinking\" = yes; then\n\t      shared_flag='${wl}-G'\n\t    else\n\t      shared_flag='${wl}-bM:SRE'\n\t    fi\n          fi\n        fi\n\n        export_dynamic_flag_spec_CXX='${wl}-bexpall'\n        # It seems that -bexpall does not export symbols beginning with\n        # underscore (_), so it is better to generate a list of symbols to\n\t# export.\n        always_export_symbols_CXX=yes\n        if test \"$aix_use_runtimelinking\" = yes; then\n          # Warning - without using the other runtime loading flags (-brtl),\n          # -berok will link without error, but may produce a broken library.\n          allow_undefined_flag_CXX='-berok'\n          # Determine the default libpath from the value encoded in an empty\n          # executable.\n          if test \"${lt_cv_aix_libpath+set}\" = set; then\n  aix_libpath=$lt_cv_aix_libpath\nelse\n  if ${lt_cv_aix_libpath__CXX+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  cat confdefs.h - <<_ACEOF >conftest.$ac_ext\n/* end confdefs.h.  */\n\nint\nmain ()\n{\n\n  ;\n  return 0;\n}\n_ACEOF\nif ac_fn_cxx_try_link \"$LINENO\"; then :\n\n  lt_aix_libpath_sed='\n      /Import File Strings/,/^$/ {\n\t  /^0/ {\n\t      s/^0  *\\([^ ]*\\) *$/\\1/\n\t      p\n\t  }\n      }'\n  lt_cv_aix_libpath__CXX=`dump -H conftest$ac_exeext 2>/dev/null | $SED -n -e \"$lt_aix_libpath_sed\"`\n  # Check for a 64-bit object if we didn't find anything.\n  if test -z \"$lt_cv_aix_libpath__CXX\"; then\n    lt_cv_aix_libpath__CXX=`dump -HX64 conftest$ac_exeext 2>/dev/null | $SED -n -e \"$lt_aix_libpath_sed\"`\n  fi\nfi\nrm -f core conftest.err conftest.$ac_objext \\\n    conftest$ac_exeext conftest.$ac_ext\n  if test -z \"$lt_cv_aix_libpath__CXX\"; then\n    lt_cv_aix_libpath__CXX=\"/usr/lib:/lib\"\n  fi\n\nfi\n\n  aix_libpath=$lt_cv_aix_libpath__CXX\nfi\n\n          hardcode_libdir_flag_spec_CXX='${wl}-blibpath:$libdir:'\"$aix_libpath\"\n\n          archive_expsym_cmds_CXX='$CC -o $output_objdir/$soname $libobjs $deplibs '\"\\${wl}$no_entry_flag\"' $compiler_flags `if test \"x${allow_undefined_flag}\" != \"x\"; then func_echo_all \"${wl}${allow_undefined_flag}\"; else :; fi` '\"\\${wl}$exp_sym_flag:\\$export_symbols $shared_flag\"\n        else\n          if test \"$host_cpu\" = ia64; then\n\t    hardcode_libdir_flag_spec_CXX='${wl}-R $libdir:/usr/lib:/lib'\n\t    allow_undefined_flag_CXX=\"-z nodefs\"\n\t    archive_expsym_cmds_CXX=\"\\$CC $shared_flag\"' -o $output_objdir/$soname $libobjs $deplibs '\"\\${wl}$no_entry_flag\"' $compiler_flags ${wl}${allow_undefined_flag} '\"\\${wl}$exp_sym_flag:\\$export_symbols\"\n          else\n\t    # Determine the default libpath from the value encoded in an\n\t    # empty executable.\n\t    if test \"${lt_cv_aix_libpath+set}\" = set; then\n  aix_libpath=$lt_cv_aix_libpath\nelse\n  if ${lt_cv_aix_libpath__CXX+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  cat confdefs.h - <<_ACEOF >conftest.$ac_ext\n/* end confdefs.h.  */\n\nint\nmain ()\n{\n\n  ;\n  return 0;\n}\n_ACEOF\nif ac_fn_cxx_try_link \"$LINENO\"; then :\n\n  lt_aix_libpath_sed='\n      /Import File Strings/,/^$/ {\n\t  /^0/ {\n\t      s/^0  *\\([^ ]*\\) *$/\\1/\n\t      p\n\t  }\n      }'\n  lt_cv_aix_libpath__CXX=`dump -H conftest$ac_exeext 2>/dev/null | $SED -n -e \"$lt_aix_libpath_sed\"`\n  # Check for a 64-bit object if we didn't find anything.\n  if test -z \"$lt_cv_aix_libpath__CXX\"; then\n    lt_cv_aix_libpath__CXX=`dump -HX64 conftest$ac_exeext 2>/dev/null | $SED -n -e \"$lt_aix_libpath_sed\"`\n  fi\nfi\nrm -f core conftest.err conftest.$ac_objext \\\n    conftest$ac_exeext conftest.$ac_ext\n  if test -z \"$lt_cv_aix_libpath__CXX\"; then\n    lt_cv_aix_libpath__CXX=\"/usr/lib:/lib\"\n  fi\n\nfi\n\n  aix_libpath=$lt_cv_aix_libpath__CXX\nfi\n\n\t    hardcode_libdir_flag_spec_CXX='${wl}-blibpath:$libdir:'\"$aix_libpath\"\n\t    # Warning - without using the other run time loading flags,\n\t    # -berok will link without error, but may produce a broken library.\n\t    no_undefined_flag_CXX=' ${wl}-bernotok'\n\t    allow_undefined_flag_CXX=' ${wl}-berok'\n\t    if test \"$with_gnu_ld\" = yes; then\n\t      # We only use this code for GNU lds that support --whole-archive.\n\t      whole_archive_flag_spec_CXX='${wl}--whole-archive$convenience ${wl}--no-whole-archive'\n\t    else\n\t      # Exported symbols can be pulled into shared objects from archives\n\t      whole_archive_flag_spec_CXX='$convenience'\n\t    fi\n\t    archive_cmds_need_lc_CXX=yes\n\t    # This is similar to how AIX traditionally builds its shared\n\t    # libraries.\n\t    archive_expsym_cmds_CXX=\"\\$CC $shared_flag\"' -o $output_objdir/$soname $libobjs $deplibs ${wl}-bnoentry $compiler_flags ${wl}-bE:$export_symbols${allow_undefined_flag}~$AR $AR_FLAGS $output_objdir/$libname$release.a $output_objdir/$soname'\n          fi\n        fi\n        ;;\n\n      beos*)\n\tif $LD --help 2>&1 | $GREP ': supported targets:.* elf' > /dev/null; then\n\t  allow_undefined_flag_CXX=unsupported\n\t  # Joseph Beckenbach <jrb3@best.com> says some releases of gcc\n\t  # support --undefined.  This deserves some investigation.  FIXME\n\t  archive_cmds_CXX='$CC -nostart $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib'\n\telse\n\t  ld_shlibs_CXX=no\n\tfi\n\t;;\n\n      chorus*)\n        case $cc_basename in\n          *)\n\t  # FIXME: insert proper C++ library support\n\t  ld_shlibs_CXX=no\n\t  ;;\n        esac\n        ;;\n\n      cygwin* | mingw* | pw32* | cegcc*)\n\tcase $GXX,$cc_basename in\n\t,cl* | no,cl*)\n\t  # Native MSVC\n\t  # hardcode_libdir_flag_spec is actually meaningless, as there is\n\t  # no search path for DLLs.\n\t  hardcode_libdir_flag_spec_CXX=' '\n\t  allow_undefined_flag_CXX=unsupported\n\t  always_export_symbols_CXX=yes\n\t  file_list_spec_CXX='@'\n\t  # Tell ltmain to make .lib files, not .a files.\n\t  libext=lib\n\t  # Tell ltmain to make .dll files, not .so files.\n\t  shrext_cmds=\".dll\"\n\t  # FIXME: Setting linknames here is a bad hack.\n\t  archive_cmds_CXX='$CC -o $output_objdir/$soname $libobjs $compiler_flags $deplibs -Wl,-dll~linknames='\n\t  archive_expsym_cmds_CXX='if test \"x`$SED 1q $export_symbols`\" = xEXPORTS; then\n\t      $SED -n -e 's/\\\\\\\\\\\\\\(.*\\\\\\\\\\\\\\)/-link\\\\\\ -EXPORT:\\\\\\\\\\\\\\1/' -e '1\\\\\\!p' < $export_symbols > $output_objdir/$soname.exp;\n\t    else\n\t      $SED -e 's/\\\\\\\\\\\\\\(.*\\\\\\\\\\\\\\)/-link\\\\\\ -EXPORT:\\\\\\\\\\\\\\1/' < $export_symbols > $output_objdir/$soname.exp;\n\t    fi~\n\t    $CC -o $tool_output_objdir$soname $libobjs $compiler_flags $deplibs \"@$tool_output_objdir$soname.exp\" -Wl,-DLL,-IMPLIB:\"$tool_output_objdir$libname.dll.lib\"~\n\t    linknames='\n\t  # The linker will not automatically build a static lib if we build a DLL.\n\t  # _LT_TAGVAR(old_archive_from_new_cmds, CXX)='true'\n\t  enable_shared_with_static_runtimes_CXX=yes\n\t  # Don't use ranlib\n\t  old_postinstall_cmds_CXX='chmod 644 $oldlib'\n\t  postlink_cmds_CXX='lt_outputfile=\"@OUTPUT@\"~\n\t    lt_tool_outputfile=\"@TOOL_OUTPUT@\"~\n\t    case $lt_outputfile in\n\t      *.exe|*.EXE) ;;\n\t      *)\n\t\tlt_outputfile=\"$lt_outputfile.exe\"\n\t\tlt_tool_outputfile=\"$lt_tool_outputfile.exe\"\n\t\t;;\n\t    esac~\n\t    func_to_tool_file \"$lt_outputfile\"~\n\t    if test \"$MANIFEST_TOOL\" != \":\" && test -f \"$lt_outputfile.manifest\"; then\n\t      $MANIFEST_TOOL -manifest \"$lt_tool_outputfile.manifest\" -outputresource:\"$lt_tool_outputfile\" || exit 1;\n\t      $RM \"$lt_outputfile.manifest\";\n\t    fi'\n\t  ;;\n\t*)\n\t  # g++\n\t  # _LT_TAGVAR(hardcode_libdir_flag_spec, CXX) is actually meaningless,\n\t  # as there is no search path for DLLs.\n\t  hardcode_libdir_flag_spec_CXX='-L$libdir'\n\t  export_dynamic_flag_spec_CXX='${wl}--export-all-symbols'\n\t  allow_undefined_flag_CXX=unsupported\n\t  always_export_symbols_CXX=no\n\t  enable_shared_with_static_runtimes_CXX=yes\n\n\t  if $LD --help 2>&1 | $GREP 'auto-import' > /dev/null; then\n\t    archive_cmds_CXX='$CC -shared -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -o $output_objdir/$soname ${wl}--enable-auto-image-base -Xlinker --out-implib -Xlinker $lib'\n\t    # If the export-symbols file already is a .def file (1st line\n\t    # is EXPORTS), use it as is; otherwise, prepend...\n\t    archive_expsym_cmds_CXX='if test \"x`$SED 1q $export_symbols`\" = xEXPORTS; then\n\t      cp $export_symbols $output_objdir/$soname.def;\n\t    else\n\t      echo EXPORTS > $output_objdir/$soname.def;\n\t      cat $export_symbols >> $output_objdir/$soname.def;\n\t    fi~\n\t    $CC -shared -nostdlib $output_objdir/$soname.def $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -o $output_objdir/$soname ${wl}--enable-auto-image-base -Xlinker --out-implib -Xlinker $lib'\n\t  else\n\t    ld_shlibs_CXX=no\n\t  fi\n\t  ;;\n\tesac\n\t;;\n      darwin* | rhapsody*)\n\n\n  archive_cmds_need_lc_CXX=no\n  hardcode_direct_CXX=no\n  hardcode_automatic_CXX=yes\n  hardcode_shlibpath_var_CXX=unsupported\n  if test \"$lt_cv_ld_force_load\" = \"yes\"; then\n    whole_archive_flag_spec_CXX='`for conv in $convenience\\\"\\\"; do test  -n \\\"$conv\\\" && new_convenience=\\\"$new_convenience ${wl}-force_load,$conv\\\"; done; func_echo_all \\\"$new_convenience\\\"`'\n\n  else\n    whole_archive_flag_spec_CXX=''\n  fi\n  link_all_deplibs_CXX=yes\n  allow_undefined_flag_CXX=\"$_lt_dar_allow_undefined\"\n  case $cc_basename in\n     ifort*) _lt_dar_can_shared=yes ;;\n     *) _lt_dar_can_shared=$GCC ;;\n  esac\n  if test \"$_lt_dar_can_shared\" = \"yes\"; then\n    output_verbose_link_cmd=func_echo_all\n    archive_cmds_CXX=\"\\$CC -dynamiclib \\$allow_undefined_flag -o \\$lib \\$libobjs \\$deplibs \\$compiler_flags -install_name \\$rpath/\\$soname \\$verstring $_lt_dar_single_mod${_lt_dsymutil}\"\n    module_cmds_CXX=\"\\$CC \\$allow_undefined_flag -o \\$lib -bundle \\$libobjs \\$deplibs \\$compiler_flags${_lt_dsymutil}\"\n    archive_expsym_cmds_CXX=\"sed 's,^,_,' < \\$export_symbols > \\$output_objdir/\\${libname}-symbols.expsym~\\$CC -dynamiclib \\$allow_undefined_flag -o \\$lib \\$libobjs \\$deplibs \\$compiler_flags -install_name \\$rpath/\\$soname \\$verstring ${_lt_dar_single_mod}${_lt_dar_export_syms}${_lt_dsymutil}\"\n    module_expsym_cmds_CXX=\"sed -e 's,^,_,' < \\$export_symbols > \\$output_objdir/\\${libname}-symbols.expsym~\\$CC \\$allow_undefined_flag -o \\$lib -bundle \\$libobjs \\$deplibs \\$compiler_flags${_lt_dar_export_syms}${_lt_dsymutil}\"\n       if test \"$lt_cv_apple_cc_single_mod\" != \"yes\"; then\n      archive_cmds_CXX=\"\\$CC -r -keep_private_externs -nostdlib -o \\${lib}-master.o \\$libobjs~\\$CC -dynamiclib \\$allow_undefined_flag -o \\$lib \\${lib}-master.o \\$deplibs \\$compiler_flags -install_name \\$rpath/\\$soname \\$verstring${_lt_dsymutil}\"\n      archive_expsym_cmds_CXX=\"sed 's,^,_,' < \\$export_symbols > \\$output_objdir/\\${libname}-symbols.expsym~\\$CC -r -keep_private_externs -nostdlib -o \\${lib}-master.o \\$libobjs~\\$CC -dynamiclib \\$allow_undefined_flag -o \\$lib \\${lib}-master.o \\$deplibs \\$compiler_flags -install_name \\$rpath/\\$soname \\$verstring${_lt_dar_export_syms}${_lt_dsymutil}\"\n    fi\n\n  else\n  ld_shlibs_CXX=no\n  fi\n\n\t;;\n\n      dgux*)\n        case $cc_basename in\n          ec++*)\n\t    # FIXME: insert proper C++ library support\n\t    ld_shlibs_CXX=no\n\t    ;;\n          ghcx*)\n\t    # Green Hills C++ Compiler\n\t    # FIXME: insert proper C++ library support\n\t    ld_shlibs_CXX=no\n\t    ;;\n          *)\n\t    # FIXME: insert proper C++ library support\n\t    ld_shlibs_CXX=no\n\t    ;;\n        esac\n        ;;\n\n      freebsd2.*)\n        # C++ shared libraries reported to be fairly broken before\n\t# switch to ELF\n        ld_shlibs_CXX=no\n        ;;\n\n      freebsd-elf*)\n        archive_cmds_need_lc_CXX=no\n        ;;\n\n      freebsd* | dragonfly*)\n        # FreeBSD 3 and later use GNU C++ and GNU ld with standard ELF\n        # conventions\n        ld_shlibs_CXX=yes\n        ;;\n\n      haiku*)\n        archive_cmds_CXX='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib'\n        link_all_deplibs_CXX=yes\n        ;;\n\n      hpux9*)\n        hardcode_libdir_flag_spec_CXX='${wl}+b ${wl}$libdir'\n        hardcode_libdir_separator_CXX=:\n        export_dynamic_flag_spec_CXX='${wl}-E'\n        hardcode_direct_CXX=yes\n        hardcode_minus_L_CXX=yes # Not in the search PATH,\n\t\t\t\t             # but as the default\n\t\t\t\t             # location of the library.\n\n        case $cc_basename in\n          CC*)\n            # FIXME: insert proper C++ library support\n            ld_shlibs_CXX=no\n            ;;\n          aCC*)\n            archive_cmds_CXX='$RM $output_objdir/$soname~$CC -b ${wl}+b ${wl}$install_libdir -o $output_objdir/$soname $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags~test $output_objdir/$soname = $lib || mv $output_objdir/$soname $lib'\n            # Commands to make compiler produce verbose output that lists\n            # what \"hidden\" libraries, object files and flags are used when\n            # linking a shared library.\n            #\n            # There doesn't appear to be a way to prevent this compiler from\n            # explicitly linking system object files so we need to strip them\n            # from the output so that they don't get included in the library\n            # dependencies.\n            output_verbose_link_cmd='templist=`($CC -b $CFLAGS -v conftest.$objext 2>&1) | $EGREP \"\\-L\"`; list=\"\"; for z in $templist; do case $z in conftest.$objext) list=\"$list $z\";; *.$objext);; *) list=\"$list $z\";;esac; done; func_echo_all \"$list\"'\n            ;;\n          *)\n            if test \"$GXX\" = yes; then\n              archive_cmds_CXX='$RM $output_objdir/$soname~$CC -shared -nostdlib $pic_flag ${wl}+b ${wl}$install_libdir -o $output_objdir/$soname $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags~test $output_objdir/$soname = $lib || mv $output_objdir/$soname $lib'\n            else\n              # FIXME: insert proper C++ library support\n              ld_shlibs_CXX=no\n            fi\n            ;;\n        esac\n        ;;\n\n      hpux10*|hpux11*)\n        if test $with_gnu_ld = no; then\n\t  hardcode_libdir_flag_spec_CXX='${wl}+b ${wl}$libdir'\n\t  hardcode_libdir_separator_CXX=:\n\n          case $host_cpu in\n            hppa*64*|ia64*)\n              ;;\n            *)\n\t      export_dynamic_flag_spec_CXX='${wl}-E'\n              ;;\n          esac\n        fi\n        case $host_cpu in\n          hppa*64*|ia64*)\n            hardcode_direct_CXX=no\n            hardcode_shlibpath_var_CXX=no\n            ;;\n          *)\n            hardcode_direct_CXX=yes\n            hardcode_direct_absolute_CXX=yes\n            hardcode_minus_L_CXX=yes # Not in the search PATH,\n\t\t\t\t\t         # but as the default\n\t\t\t\t\t         # location of the library.\n            ;;\n        esac\n\n        case $cc_basename in\n          CC*)\n\t    # FIXME: insert proper C++ library support\n\t    ld_shlibs_CXX=no\n\t    ;;\n          aCC*)\n\t    case $host_cpu in\n\t      hppa*64*)\n\t        archive_cmds_CXX='$CC -b ${wl}+h ${wl}$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags'\n\t        ;;\n\t      ia64*)\n\t        archive_cmds_CXX='$CC -b ${wl}+h ${wl}$soname ${wl}+nodefaultrpath -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags'\n\t        ;;\n\t      *)\n\t        archive_cmds_CXX='$CC -b ${wl}+h ${wl}$soname ${wl}+b ${wl}$install_libdir -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags'\n\t        ;;\n\t    esac\n\t    # Commands to make compiler produce verbose output that lists\n\t    # what \"hidden\" libraries, object files and flags are used when\n\t    # linking a shared library.\n\t    #\n\t    # There doesn't appear to be a way to prevent this compiler from\n\t    # explicitly linking system object files so we need to strip them\n\t    # from the output so that they don't get included in the library\n\t    # dependencies.\n\t    output_verbose_link_cmd='templist=`($CC -b $CFLAGS -v conftest.$objext 2>&1) | $GREP \"\\-L\"`; list=\"\"; for z in $templist; do case $z in conftest.$objext) list=\"$list $z\";; *.$objext);; *) list=\"$list $z\";;esac; done; func_echo_all \"$list\"'\n\t    ;;\n          *)\n\t    if test \"$GXX\" = yes; then\n\t      if test $with_gnu_ld = no; then\n\t        case $host_cpu in\n\t          hppa*64*)\n\t            archive_cmds_CXX='$CC -shared -nostdlib -fPIC ${wl}+h ${wl}$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags'\n\t            ;;\n\t          ia64*)\n\t            archive_cmds_CXX='$CC -shared -nostdlib $pic_flag ${wl}+h ${wl}$soname ${wl}+nodefaultrpath -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags'\n\t            ;;\n\t          *)\n\t            archive_cmds_CXX='$CC -shared -nostdlib $pic_flag ${wl}+h ${wl}$soname ${wl}+b ${wl}$install_libdir -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags'\n\t            ;;\n\t        esac\n\t      fi\n\t    else\n\t      # FIXME: insert proper C++ library support\n\t      ld_shlibs_CXX=no\n\t    fi\n\t    ;;\n        esac\n        ;;\n\n      interix[3-9]*)\n\thardcode_direct_CXX=no\n\thardcode_shlibpath_var_CXX=no\n\thardcode_libdir_flag_spec_CXX='${wl}-rpath,$libdir'\n\texport_dynamic_flag_spec_CXX='${wl}-E'\n\t# Hack: On Interix 3.x, we cannot compile PIC because of a broken gcc.\n\t# Instead, shared libraries are loaded at an image base (0x10000000 by\n\t# default) and relocated if they conflict, which is a slow very memory\n\t# consuming and fragmenting process.  To avoid this, we pick a random,\n\t# 256 KiB-aligned image base between 0x50000000 and 0x6FFC0000 at link\n\t# time.  Moving up from 0x10000000 also allows more sbrk(2) space.\n\tarchive_cmds_CXX='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-h,$soname ${wl}--image-base,`expr ${RANDOM-$$} % 4096 / 2 \\* 262144 + 1342177280` -o $lib'\n\tarchive_expsym_cmds_CXX='sed \"s,^,_,\" $export_symbols >$output_objdir/$soname.expsym~$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-h,$soname ${wl}--retain-symbols-file,$output_objdir/$soname.expsym ${wl}--image-base,`expr ${RANDOM-$$} % 4096 / 2 \\* 262144 + 1342177280` -o $lib'\n\t;;\n      irix5* | irix6*)\n        case $cc_basename in\n          CC*)\n\t    # SGI C++\n\t    archive_cmds_CXX='$CC -shared -all -multigot $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -soname $soname `test -n \"$verstring\" && func_echo_all \"-set_version $verstring\"` -update_registry ${output_objdir}/so_locations -o $lib'\n\n\t    # Archives containing C++ object files must be created using\n\t    # \"CC -ar\", where \"CC\" is the IRIX C++ compiler.  This is\n\t    # necessary to make sure instantiated templates are included\n\t    # in the archive.\n\t    old_archive_cmds_CXX='$CC -ar -WR,-u -o $oldlib $oldobjs'\n\t    ;;\n          *)\n\t    if test \"$GXX\" = yes; then\n\t      if test \"$with_gnu_ld\" = no; then\n\t        archive_cmds_CXX='$CC -shared $pic_flag -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname ${wl}$soname `test -n \"$verstring\" && func_echo_all \"${wl}-set_version ${wl}$verstring\"` ${wl}-update_registry ${wl}${output_objdir}/so_locations -o $lib'\n\t      else\n\t        archive_cmds_CXX='$CC -shared $pic_flag -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname ${wl}$soname `test -n \"$verstring\" && func_echo_all \"${wl}-set_version ${wl}$verstring\"` -o $lib'\n\t      fi\n\t    fi\n\t    link_all_deplibs_CXX=yes\n\t    ;;\n        esac\n        hardcode_libdir_flag_spec_CXX='${wl}-rpath ${wl}$libdir'\n        hardcode_libdir_separator_CXX=:\n        inherit_rpath_CXX=yes\n        ;;\n\n      linux* | k*bsd*-gnu | kopensolaris*-gnu | gnu*)\n        case $cc_basename in\n          KCC*)\n\t    # Kuck and Associates, Inc. (KAI) C++ Compiler\n\n\t    # KCC will only create a shared library if the output file\n\t    # ends with \".so\" (or \".sl\" for HP-UX), so rename the library\n\t    # to its proper name (with version) after linking.\n\t    archive_cmds_CXX='tempext=`echo $shared_ext | $SED -e '\\''s/\\([^()0-9A-Za-z{}]\\)/\\\\\\\\\\1/g'\\''`; templib=`echo $lib | $SED -e \"s/\\${tempext}\\..*/.so/\"`; $CC $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags --soname $soname -o \\$templib; mv \\$templib $lib'\n\t    archive_expsym_cmds_CXX='tempext=`echo $shared_ext | $SED -e '\\''s/\\([^()0-9A-Za-z{}]\\)/\\\\\\\\\\1/g'\\''`; templib=`echo $lib | $SED -e \"s/\\${tempext}\\..*/.so/\"`; $CC $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags --soname $soname -o \\$templib ${wl}-retain-symbols-file,$export_symbols; mv \\$templib $lib'\n\t    # Commands to make compiler produce verbose output that lists\n\t    # what \"hidden\" libraries, object files and flags are used when\n\t    # linking a shared library.\n\t    #\n\t    # There doesn't appear to be a way to prevent this compiler from\n\t    # explicitly linking system object files so we need to strip them\n\t    # from the output so that they don't get included in the library\n\t    # dependencies.\n\t    output_verbose_link_cmd='templist=`$CC $CFLAGS -v conftest.$objext -o libconftest$shared_ext 2>&1 | $GREP \"ld\"`; rm -f libconftest$shared_ext; list=\"\"; for z in $templist; do case $z in conftest.$objext) list=\"$list $z\";; *.$objext);; *) list=\"$list $z\";;esac; done; func_echo_all \"$list\"'\n\n\t    hardcode_libdir_flag_spec_CXX='${wl}-rpath,$libdir'\n\t    export_dynamic_flag_spec_CXX='${wl}--export-dynamic'\n\n\t    # Archives containing C++ object files must be created using\n\t    # \"CC -Bstatic\", where \"CC\" is the KAI C++ compiler.\n\t    old_archive_cmds_CXX='$CC -Bstatic -o $oldlib $oldobjs'\n\t    ;;\n\t  icpc* | ecpc* )\n\t    # Intel C++\n\t    with_gnu_ld=yes\n\t    # version 8.0 and above of icpc choke on multiply defined symbols\n\t    # if we add $predep_objects and $postdep_objects, however 7.1 and\n\t    # earlier do not add the objects themselves.\n\t    case `$CC -V 2>&1` in\n\t      *\"Version 7.\"*)\n\t        archive_cmds_CXX='$CC -shared $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $wl$soname -o $lib'\n\t\tarchive_expsym_cmds_CXX='$CC -shared $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib'\n\t\t;;\n\t      *)  # Version 8.0 or newer\n\t        tmp_idyn=\n\t        case $host_cpu in\n\t\t  ia64*) tmp_idyn=' -i_dynamic';;\n\t\tesac\n\t        archive_cmds_CXX='$CC -shared'\"$tmp_idyn\"' $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib'\n\t\tarchive_expsym_cmds_CXX='$CC -shared'\"$tmp_idyn\"' $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib'\n\t\t;;\n\t    esac\n\t    archive_cmds_need_lc_CXX=no\n\t    hardcode_libdir_flag_spec_CXX='${wl}-rpath,$libdir'\n\t    export_dynamic_flag_spec_CXX='${wl}--export-dynamic'\n\t    whole_archive_flag_spec_CXX='${wl}--whole-archive$convenience ${wl}--no-whole-archive'\n\t    ;;\n          pgCC* | pgcpp*)\n            # Portland Group C++ compiler\n\t    case `$CC -V` in\n\t    *pgCC\\ [1-5].* | *pgcpp\\ [1-5].*)\n\t      prelink_cmds_CXX='tpldir=Template.dir~\n\t\trm -rf $tpldir~\n\t\t$CC --prelink_objects --instantiation_dir $tpldir $objs $libobjs $compile_deplibs~\n\t\tcompile_command=\"$compile_command `find $tpldir -name \\*.o | sort | $NL2SP`\"'\n\t      old_archive_cmds_CXX='tpldir=Template.dir~\n\t\trm -rf $tpldir~\n\t\t$CC --prelink_objects --instantiation_dir $tpldir $oldobjs$old_deplibs~\n\t\t$AR $AR_FLAGS $oldlib$oldobjs$old_deplibs `find $tpldir -name \\*.o | sort | $NL2SP`~\n\t\t$RANLIB $oldlib'\n\t      archive_cmds_CXX='tpldir=Template.dir~\n\t\trm -rf $tpldir~\n\t\t$CC --prelink_objects --instantiation_dir $tpldir $predep_objects $libobjs $deplibs $convenience $postdep_objects~\n\t\t$CC -shared $pic_flag $predep_objects $libobjs $deplibs `find $tpldir -name \\*.o | sort | $NL2SP` $postdep_objects $compiler_flags ${wl}-soname ${wl}$soname -o $lib'\n\t      archive_expsym_cmds_CXX='tpldir=Template.dir~\n\t\trm -rf $tpldir~\n\t\t$CC --prelink_objects --instantiation_dir $tpldir $predep_objects $libobjs $deplibs $convenience $postdep_objects~\n\t\t$CC -shared $pic_flag $predep_objects $libobjs $deplibs `find $tpldir -name \\*.o | sort | $NL2SP` $postdep_objects $compiler_flags ${wl}-soname ${wl}$soname ${wl}-retain-symbols-file ${wl}$export_symbols -o $lib'\n\t      ;;\n\t    *) # Version 6 and above use weak symbols\n\t      archive_cmds_CXX='$CC -shared $pic_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname ${wl}$soname -o $lib'\n\t      archive_expsym_cmds_CXX='$CC -shared $pic_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname ${wl}$soname ${wl}-retain-symbols-file ${wl}$export_symbols -o $lib'\n\t      ;;\n\t    esac\n\n\t    hardcode_libdir_flag_spec_CXX='${wl}--rpath ${wl}$libdir'\n\t    export_dynamic_flag_spec_CXX='${wl}--export-dynamic'\n\t    whole_archive_flag_spec_CXX='${wl}--whole-archive`for conv in $convenience\\\"\\\"; do test  -n \\\"$conv\\\" && new_convenience=\\\"$new_convenience,$conv\\\"; done; func_echo_all \\\"$new_convenience\\\"` ${wl}--no-whole-archive'\n            ;;\n\t  cxx*)\n\t    # Compaq C++\n\t    archive_cmds_CXX='$CC -shared $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $wl$soname -o $lib'\n\t    archive_expsym_cmds_CXX='$CC -shared $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $wl$soname  -o $lib ${wl}-retain-symbols-file $wl$export_symbols'\n\n\t    runpath_var=LD_RUN_PATH\n\t    hardcode_libdir_flag_spec_CXX='-rpath $libdir'\n\t    hardcode_libdir_separator_CXX=:\n\n\t    # Commands to make compiler produce verbose output that lists\n\t    # what \"hidden\" libraries, object files and flags are used when\n\t    # linking a shared library.\n\t    #\n\t    # There doesn't appear to be a way to prevent this compiler from\n\t    # explicitly linking system object files so we need to strip them\n\t    # from the output so that they don't get included in the library\n\t    # dependencies.\n\t    output_verbose_link_cmd='templist=`$CC -shared $CFLAGS -v conftest.$objext 2>&1 | $GREP \"ld\"`; templist=`func_echo_all \"$templist\" | $SED \"s/\\(^.*ld.*\\)\\( .*ld .*$\\)/\\1/\"`; list=\"\"; for z in $templist; do case $z in conftest.$objext) list=\"$list $z\";; *.$objext);; *) list=\"$list $z\";;esac; done; func_echo_all \"X$list\" | $Xsed'\n\t    ;;\n\t  xl* | mpixl* | bgxl*)\n\t    # IBM XL 8.0 on PPC, with GNU ld\n\t    hardcode_libdir_flag_spec_CXX='${wl}-rpath ${wl}$libdir'\n\t    export_dynamic_flag_spec_CXX='${wl}--export-dynamic'\n\t    archive_cmds_CXX='$CC -qmkshrobj $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib'\n\t    if test \"x$supports_anon_versioning\" = xyes; then\n\t      archive_expsym_cmds_CXX='echo \"{ global:\" > $output_objdir/$libname.ver~\n\t\tcat $export_symbols | sed -e \"s/\\(.*\\)/\\1;/\" >> $output_objdir/$libname.ver~\n\t\techo \"local: *; };\" >> $output_objdir/$libname.ver~\n\t\t$CC -qmkshrobj $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-version-script ${wl}$output_objdir/$libname.ver -o $lib'\n\t    fi\n\t    ;;\n\t  *)\n\t    case `$CC -V 2>&1 | sed 5q` in\n\t    *Sun\\ C*)\n\t      # Sun C++ 5.9\n\t      no_undefined_flag_CXX=' -zdefs'\n\t      archive_cmds_CXX='$CC -G${allow_undefined_flag} -h$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags'\n\t      archive_expsym_cmds_CXX='$CC -G${allow_undefined_flag} -h$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-retain-symbols-file ${wl}$export_symbols'\n\t      hardcode_libdir_flag_spec_CXX='-R$libdir'\n\t      whole_archive_flag_spec_CXX='${wl}--whole-archive`new_convenience=; for conv in $convenience\\\"\\\"; do test -z \\\"$conv\\\" || new_convenience=\\\"$new_convenience,$conv\\\"; done; func_echo_all \\\"$new_convenience\\\"` ${wl}--no-whole-archive'\n\t      compiler_needs_object_CXX=yes\n\n\t      # Not sure whether something based on\n\t      # $CC $CFLAGS -v conftest.$objext -o libconftest$shared_ext 2>&1\n\t      # would be better.\n\t      output_verbose_link_cmd='func_echo_all'\n\n\t      # Archives containing C++ object files must be created using\n\t      # \"CC -xar\", where \"CC\" is the Sun C++ compiler.  This is\n\t      # necessary to make sure instantiated templates are included\n\t      # in the archive.\n\t      old_archive_cmds_CXX='$CC -xar -o $oldlib $oldobjs'\n\t      ;;\n\t    esac\n\t    ;;\n\tesac\n\t;;\n\n      lynxos*)\n        # FIXME: insert proper C++ library support\n\tld_shlibs_CXX=no\n\t;;\n\n      m88k*)\n        # FIXME: insert proper C++ library support\n        ld_shlibs_CXX=no\n\t;;\n\n      mvs*)\n        case $cc_basename in\n          cxx*)\n\t    # FIXME: insert proper C++ library support\n\t    ld_shlibs_CXX=no\n\t    ;;\n\t  *)\n\t    # FIXME: insert proper C++ library support\n\t    ld_shlibs_CXX=no\n\t    ;;\n\tesac\n\t;;\n\n      netbsd*)\n        if echo __ELF__ | $CC -E - | $GREP __ELF__ >/dev/null; then\n\t  archive_cmds_CXX='$LD -Bshareable  -o $lib $predep_objects $libobjs $deplibs $postdep_objects $linker_flags'\n\t  wlarc=\n\t  hardcode_libdir_flag_spec_CXX='-R$libdir'\n\t  hardcode_direct_CXX=yes\n\t  hardcode_shlibpath_var_CXX=no\n\tfi\n\t# Workaround some broken pre-1.5 toolchains\n\toutput_verbose_link_cmd='$CC -shared $CFLAGS -v conftest.$objext 2>&1 | $GREP conftest.$objext | $SED -e \"s:-lgcc -lc -lgcc::\"'\n\t;;\n\n      *nto* | *qnx*)\n        ld_shlibs_CXX=yes\n\t;;\n\n      openbsd2*)\n        # C++ shared libraries are fairly broken\n\tld_shlibs_CXX=no\n\t;;\n\n      openbsd*)\n\tif test -f /usr/libexec/ld.so; then\n\t  hardcode_direct_CXX=yes\n\t  hardcode_shlibpath_var_CXX=no\n\t  hardcode_direct_absolute_CXX=yes\n\t  archive_cmds_CXX='$CC -shared $pic_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -o $lib'\n\t  hardcode_libdir_flag_spec_CXX='${wl}-rpath,$libdir'\n\t  if test -z \"`echo __ELF__ | $CC -E - | grep __ELF__`\" || test \"$host_os-$host_cpu\" = \"openbsd2.8-powerpc\"; then\n\t    archive_expsym_cmds_CXX='$CC -shared $pic_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-retain-symbols-file,$export_symbols -o $lib'\n\t    export_dynamic_flag_spec_CXX='${wl}-E'\n\t    whole_archive_flag_spec_CXX=\"$wlarc\"'--whole-archive$convenience '\"$wlarc\"'--no-whole-archive'\n\t  fi\n\t  output_verbose_link_cmd=func_echo_all\n\telse\n\t  ld_shlibs_CXX=no\n\tfi\n\t;;\n\n      osf3* | osf4* | osf5*)\n        case $cc_basename in\n          KCC*)\n\t    # Kuck and Associates, Inc. (KAI) C++ Compiler\n\n\t    # KCC will only create a shared library if the output file\n\t    # ends with \".so\" (or \".sl\" for HP-UX), so rename the library\n\t    # to its proper name (with version) after linking.\n\t    archive_cmds_CXX='tempext=`echo $shared_ext | $SED -e '\\''s/\\([^()0-9A-Za-z{}]\\)/\\\\\\\\\\1/g'\\''`; templib=`echo \"$lib\" | $SED -e \"s/\\${tempext}\\..*/.so/\"`; $CC $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags --soname $soname -o \\$templib; mv \\$templib $lib'\n\n\t    hardcode_libdir_flag_spec_CXX='${wl}-rpath,$libdir'\n\t    hardcode_libdir_separator_CXX=:\n\n\t    # Archives containing C++ object files must be created using\n\t    # the KAI C++ compiler.\n\t    case $host in\n\t      osf3*) old_archive_cmds_CXX='$CC -Bstatic -o $oldlib $oldobjs' ;;\n\t      *) old_archive_cmds_CXX='$CC -o $oldlib $oldobjs' ;;\n\t    esac\n\t    ;;\n          RCC*)\n\t    # Rational C++ 2.4.1\n\t    # FIXME: insert proper C++ library support\n\t    ld_shlibs_CXX=no\n\t    ;;\n          cxx*)\n\t    case $host in\n\t      osf3*)\n\t        allow_undefined_flag_CXX=' ${wl}-expect_unresolved ${wl}\\*'\n\t        archive_cmds_CXX='$CC -shared${allow_undefined_flag} $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $soname `test -n \"$verstring\" && func_echo_all \"${wl}-set_version $verstring\"` -update_registry ${output_objdir}/so_locations -o $lib'\n\t        hardcode_libdir_flag_spec_CXX='${wl}-rpath ${wl}$libdir'\n\t\t;;\n\t      *)\n\t        allow_undefined_flag_CXX=' -expect_unresolved \\*'\n\t        archive_cmds_CXX='$CC -shared${allow_undefined_flag} $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -msym -soname $soname `test -n \"$verstring\" && func_echo_all \"-set_version $verstring\"` -update_registry ${output_objdir}/so_locations -o $lib'\n\t        archive_expsym_cmds_CXX='for i in `cat $export_symbols`; do printf \"%s %s\\\\n\" -exported_symbol \"\\$i\" >> $lib.exp; done~\n\t          echo \"-hidden\">> $lib.exp~\n\t          $CC -shared$allow_undefined_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -msym -soname $soname ${wl}-input ${wl}$lib.exp  `test -n \"$verstring\" && $ECHO \"-set_version $verstring\"` -update_registry ${output_objdir}/so_locations -o $lib~\n\t          $RM $lib.exp'\n\t        hardcode_libdir_flag_spec_CXX='-rpath $libdir'\n\t\t;;\n\t    esac\n\n\t    hardcode_libdir_separator_CXX=:\n\n\t    # Commands to make compiler produce verbose output that lists\n\t    # what \"hidden\" libraries, object files and flags are used when\n\t    # linking a shared library.\n\t    #\n\t    # There doesn't appear to be a way to prevent this compiler from\n\t    # explicitly linking system object files so we need to strip them\n\t    # from the output so that they don't get included in the library\n\t    # dependencies.\n\t    output_verbose_link_cmd='templist=`$CC -shared $CFLAGS -v conftest.$objext 2>&1 | $GREP \"ld\" | $GREP -v \"ld:\"`; templist=`func_echo_all \"$templist\" | $SED \"s/\\(^.*ld.*\\)\\( .*ld.*$\\)/\\1/\"`; list=\"\"; for z in $templist; do case $z in conftest.$objext) list=\"$list $z\";; *.$objext);; *) list=\"$list $z\";;esac; done; func_echo_all \"$list\"'\n\t    ;;\n\t  *)\n\t    if test \"$GXX\" = yes && test \"$with_gnu_ld\" = no; then\n\t      allow_undefined_flag_CXX=' ${wl}-expect_unresolved ${wl}\\*'\n\t      case $host in\n\t        osf3*)\n\t          archive_cmds_CXX='$CC -shared -nostdlib ${allow_undefined_flag} $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname ${wl}$soname `test -n \"$verstring\" && func_echo_all \"${wl}-set_version ${wl}$verstring\"` ${wl}-update_registry ${wl}${output_objdir}/so_locations -o $lib'\n\t\t  ;;\n\t        *)\n\t          archive_cmds_CXX='$CC -shared $pic_flag -nostdlib ${allow_undefined_flag} $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-msym ${wl}-soname ${wl}$soname `test -n \"$verstring\" && func_echo_all \"${wl}-set_version ${wl}$verstring\"` ${wl}-update_registry ${wl}${output_objdir}/so_locations -o $lib'\n\t\t  ;;\n\t      esac\n\n\t      hardcode_libdir_flag_spec_CXX='${wl}-rpath ${wl}$libdir'\n\t      hardcode_libdir_separator_CXX=:\n\n\t      # Commands to make compiler produce verbose output that lists\n\t      # what \"hidden\" libraries, object files and flags are used when\n\t      # linking a shared library.\n\t      output_verbose_link_cmd='$CC -shared $CFLAGS -v conftest.$objext 2>&1 | $GREP -v \"^Configured with:\" | $GREP \"\\-L\"'\n\n\t    else\n\t      # FIXME: insert proper C++ library support\n\t      ld_shlibs_CXX=no\n\t    fi\n\t    ;;\n        esac\n        ;;\n\n      psos*)\n        # FIXME: insert proper C++ library support\n        ld_shlibs_CXX=no\n        ;;\n\n      sunos4*)\n        case $cc_basename in\n          CC*)\n\t    # Sun C++ 4.x\n\t    # FIXME: insert proper C++ library support\n\t    ld_shlibs_CXX=no\n\t    ;;\n          lcc*)\n\t    # Lucid\n\t    # FIXME: insert proper C++ library support\n\t    ld_shlibs_CXX=no\n\t    ;;\n          *)\n\t    # FIXME: insert proper C++ library support\n\t    ld_shlibs_CXX=no\n\t    ;;\n        esac\n        ;;\n\n      solaris*)\n        case $cc_basename in\n          CC* | sunCC*)\n\t    # Sun C++ 4.2, 5.x and Centerline C++\n            archive_cmds_need_lc_CXX=yes\n\t    no_undefined_flag_CXX=' -zdefs'\n\t    archive_cmds_CXX='$CC -G${allow_undefined_flag}  -h$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags'\n\t    archive_expsym_cmds_CXX='echo \"{ global:\" > $lib.exp~cat $export_symbols | $SED -e \"s/\\(.*\\)/\\1;/\" >> $lib.exp~echo \"local: *; };\" >> $lib.exp~\n\t      $CC -G${allow_undefined_flag} ${wl}-M ${wl}$lib.exp -h$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags~$RM $lib.exp'\n\n\t    hardcode_libdir_flag_spec_CXX='-R$libdir'\n\t    hardcode_shlibpath_var_CXX=no\n\t    case $host_os in\n\t      solaris2.[0-5] | solaris2.[0-5].*) ;;\n\t      *)\n\t\t# The compiler driver will combine and reorder linker options,\n\t\t# but understands `-z linker_flag'.\n\t        # Supported since Solaris 2.6 (maybe 2.5.1?)\n\t\twhole_archive_flag_spec_CXX='-z allextract$convenience -z defaultextract'\n\t        ;;\n\t    esac\n\t    link_all_deplibs_CXX=yes\n\n\t    output_verbose_link_cmd='func_echo_all'\n\n\t    # Archives containing C++ object files must be created using\n\t    # \"CC -xar\", where \"CC\" is the Sun C++ compiler.  This is\n\t    # necessary to make sure instantiated templates are included\n\t    # in the archive.\n\t    old_archive_cmds_CXX='$CC -xar -o $oldlib $oldobjs'\n\t    ;;\n          gcx*)\n\t    # Green Hills C++ Compiler\n\t    archive_cmds_CXX='$CC -shared $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-h $wl$soname -o $lib'\n\n\t    # The C++ compiler must be used to create the archive.\n\t    old_archive_cmds_CXX='$CC $LDFLAGS -archive -o $oldlib $oldobjs'\n\t    ;;\n          *)\n\t    # GNU C++ compiler with Solaris linker\n\t    if test \"$GXX\" = yes && test \"$with_gnu_ld\" = no; then\n\t      no_undefined_flag_CXX=' ${wl}-z ${wl}defs'\n\t      if $CC --version | $GREP -v '^2\\.7' > /dev/null; then\n\t        archive_cmds_CXX='$CC -shared $pic_flag -nostdlib $LDFLAGS $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-h $wl$soname -o $lib'\n\t        archive_expsym_cmds_CXX='echo \"{ global:\" > $lib.exp~cat $export_symbols | $SED -e \"s/\\(.*\\)/\\1;/\" >> $lib.exp~echo \"local: *; };\" >> $lib.exp~\n\t\t  $CC -shared $pic_flag -nostdlib ${wl}-M $wl$lib.exp -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags~$RM $lib.exp'\n\n\t        # Commands to make compiler produce verbose output that lists\n\t        # what \"hidden\" libraries, object files and flags are used when\n\t        # linking a shared library.\n\t        output_verbose_link_cmd='$CC -shared $CFLAGS -v conftest.$objext 2>&1 | $GREP -v \"^Configured with:\" | $GREP \"\\-L\"'\n\t      else\n\t        # g++ 2.7 appears to require `-G' NOT `-shared' on this\n\t        # platform.\n\t        archive_cmds_CXX='$CC -G -nostdlib $LDFLAGS $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-h $wl$soname -o $lib'\n\t        archive_expsym_cmds_CXX='echo \"{ global:\" > $lib.exp~cat $export_symbols | $SED -e \"s/\\(.*\\)/\\1;/\" >> $lib.exp~echo \"local: *; };\" >> $lib.exp~\n\t\t  $CC -G -nostdlib ${wl}-M $wl$lib.exp -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags~$RM $lib.exp'\n\n\t        # Commands to make compiler produce verbose output that lists\n\t        # what \"hidden\" libraries, object files and flags are used when\n\t        # linking a shared library.\n\t        output_verbose_link_cmd='$CC -G $CFLAGS -v conftest.$objext 2>&1 | $GREP -v \"^Configured with:\" | $GREP \"\\-L\"'\n\t      fi\n\n\t      hardcode_libdir_flag_spec_CXX='${wl}-R $wl$libdir'\n\t      case $host_os in\n\t\tsolaris2.[0-5] | solaris2.[0-5].*) ;;\n\t\t*)\n\t\t  whole_archive_flag_spec_CXX='${wl}-z ${wl}allextract$convenience ${wl}-z ${wl}defaultextract'\n\t\t  ;;\n\t      esac\n\t    fi\n\t    ;;\n        esac\n        ;;\n\n    sysv4*uw2* | sysv5OpenUNIX* | sysv5UnixWare7.[01].[10]* | unixware7* | sco3.2v5.0.[024]*)\n      no_undefined_flag_CXX='${wl}-z,text'\n      archive_cmds_need_lc_CXX=no\n      hardcode_shlibpath_var_CXX=no\n      runpath_var='LD_RUN_PATH'\n\n      case $cc_basename in\n        CC*)\n\t  archive_cmds_CXX='$CC -G ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags'\n\t  archive_expsym_cmds_CXX='$CC -G ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags'\n\t  ;;\n\t*)\n\t  archive_cmds_CXX='$CC -shared ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags'\n\t  archive_expsym_cmds_CXX='$CC -shared ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags'\n\t  ;;\n      esac\n      ;;\n\n      sysv5* | sco3.2v5* | sco5v6*)\n\t# Note: We can NOT use -z defs as we might desire, because we do not\n\t# link with -lc, and that would cause any symbols used from libc to\n\t# always be unresolved, which means just about no library would\n\t# ever link correctly.  If we're not using GNU ld we use -z text\n\t# though, which does catch some bad symbols but isn't as heavy-handed\n\t# as -z defs.\n\tno_undefined_flag_CXX='${wl}-z,text'\n\tallow_undefined_flag_CXX='${wl}-z,nodefs'\n\tarchive_cmds_need_lc_CXX=no\n\thardcode_shlibpath_var_CXX=no\n\thardcode_libdir_flag_spec_CXX='${wl}-R,$libdir'\n\thardcode_libdir_separator_CXX=':'\n\tlink_all_deplibs_CXX=yes\n\texport_dynamic_flag_spec_CXX='${wl}-Bexport'\n\trunpath_var='LD_RUN_PATH'\n\n\tcase $cc_basename in\n          CC*)\n\t    archive_cmds_CXX='$CC -G ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags'\n\t    archive_expsym_cmds_CXX='$CC -G ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags'\n\t    old_archive_cmds_CXX='$CC -Tprelink_objects $oldobjs~\n\t      '\"$old_archive_cmds_CXX\"\n\t    reload_cmds_CXX='$CC -Tprelink_objects $reload_objs~\n\t      '\"$reload_cmds_CXX\"\n\t    ;;\n\t  *)\n\t    archive_cmds_CXX='$CC -shared ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags'\n\t    archive_expsym_cmds_CXX='$CC -shared ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags'\n\t    ;;\n\tesac\n      ;;\n\n      tandem*)\n        case $cc_basename in\n          NCC*)\n\t    # NonStop-UX NCC 3.20\n\t    # FIXME: insert proper C++ library support\n\t    ld_shlibs_CXX=no\n\t    ;;\n          *)\n\t    # FIXME: insert proper C++ library support\n\t    ld_shlibs_CXX=no\n\t    ;;\n        esac\n        ;;\n\n      vxworks*)\n        # FIXME: insert proper C++ library support\n        ld_shlibs_CXX=no\n        ;;\n\n      *)\n        # FIXME: insert proper C++ library support\n        ld_shlibs_CXX=no\n        ;;\n    esac\n\n    { $as_echo \"$as_me:${as_lineno-$LINENO}: result: $ld_shlibs_CXX\" >&5\n$as_echo \"$ld_shlibs_CXX\" >&6; }\n    test \"$ld_shlibs_CXX\" = no && can_build_shared=no\n\n    GCC_CXX=\"$GXX\"\n    LD_CXX=\"$LD\"\n\n    ## CAVEAT EMPTOR:\n    ## There is no encapsulation within the following macros, do not change\n    ## the running order or otherwise move them around unless you know exactly\n    ## what you are doing...\n    # Dependencies to place before and after the object being linked:\npredep_objects_CXX=\npostdep_objects_CXX=\npredeps_CXX=\npostdeps_CXX=\ncompiler_lib_search_path_CXX=\n\ncat > conftest.$ac_ext <<_LT_EOF\nclass Foo\n{\npublic:\n  Foo (void) { a = 0; }\nprivate:\n  int a;\n};\n_LT_EOF\n\n\n_lt_libdeps_save_CFLAGS=$CFLAGS\ncase \"$CC $CFLAGS \" in #(\n*\\ -flto*\\ *) CFLAGS=\"$CFLAGS -fno-lto\" ;;\n*\\ -fwhopr*\\ *) CFLAGS=\"$CFLAGS -fno-whopr\" ;;\n*\\ -fuse-linker-plugin*\\ *) CFLAGS=\"$CFLAGS -fno-use-linker-plugin\" ;;\nesac\n\nif { { eval echo \"\\\"\\$as_me\\\":${as_lineno-$LINENO}: \\\"$ac_compile\\\"\"; } >&5\n  (eval $ac_compile) 2>&5\n  ac_status=$?\n  $as_echo \"$as_me:${as_lineno-$LINENO}: \\$? = $ac_status\" >&5\n  test $ac_status = 0; }; then\n  # Parse the compiler output and extract the necessary\n  # objects, libraries and library flags.\n\n  # Sentinel used to keep track of whether or not we are before\n  # the conftest object file.\n  pre_test_object_deps_done=no\n\n  for p in `eval \"$output_verbose_link_cmd\"`; do\n    case ${prev}${p} in\n\n    -L* | -R* | -l*)\n       # Some compilers place space between \"-{L,R}\" and the path.\n       # Remove the space.\n       if test $p = \"-L\" ||\n          test $p = \"-R\"; then\n\t prev=$p\n\t continue\n       fi\n\n       # Expand the sysroot to ease extracting the directories later.\n       if test -z \"$prev\"; then\n         case $p in\n         -L*) func_stripname_cnf '-L' '' \"$p\"; prev=-L; p=$func_stripname_result ;;\n         -R*) func_stripname_cnf '-R' '' \"$p\"; prev=-R; p=$func_stripname_result ;;\n         -l*) func_stripname_cnf '-l' '' \"$p\"; prev=-l; p=$func_stripname_result ;;\n         esac\n       fi\n       case $p in\n       =*) func_stripname_cnf '=' '' \"$p\"; p=$lt_sysroot$func_stripname_result ;;\n       esac\n       if test \"$pre_test_object_deps_done\" = no; then\n\t case ${prev} in\n\t -L | -R)\n\t   # Internal compiler library paths should come after those\n\t   # provided the user.  The postdeps already come after the\n\t   # user supplied libs so there is no need to process them.\n\t   if test -z \"$compiler_lib_search_path_CXX\"; then\n\t     compiler_lib_search_path_CXX=\"${prev}${p}\"\n\t   else\n\t     compiler_lib_search_path_CXX=\"${compiler_lib_search_path_CXX} ${prev}${p}\"\n\t   fi\n\t   ;;\n\t # The \"-l\" case would never come before the object being\n\t # linked, so don't bother handling this case.\n\t esac\n       else\n\t if test -z \"$postdeps_CXX\"; then\n\t   postdeps_CXX=\"${prev}${p}\"\n\t else\n\t   postdeps_CXX=\"${postdeps_CXX} ${prev}${p}\"\n\t fi\n       fi\n       prev=\n       ;;\n\n    *.lto.$objext) ;; # Ignore GCC LTO objects\n    *.$objext)\n       # This assumes that the test object file only shows up\n       # once in the compiler output.\n       if test \"$p\" = \"conftest.$objext\"; then\n\t pre_test_object_deps_done=yes\n\t continue\n       fi\n\n       if test \"$pre_test_object_deps_done\" = no; then\n\t if test -z \"$predep_objects_CXX\"; then\n\t   predep_objects_CXX=\"$p\"\n\t else\n\t   predep_objects_CXX=\"$predep_objects_CXX $p\"\n\t fi\n       else\n\t if test -z \"$postdep_objects_CXX\"; then\n\t   postdep_objects_CXX=\"$p\"\n\t else\n\t   postdep_objects_CXX=\"$postdep_objects_CXX $p\"\n\t fi\n       fi\n       ;;\n\n    *) ;; # Ignore the rest.\n\n    esac\n  done\n\n  # Clean up.\n  rm -f a.out a.exe\nelse\n  echo \"libtool.m4: error: problem compiling CXX test program\"\nfi\n\n$RM -f confest.$objext\nCFLAGS=$_lt_libdeps_save_CFLAGS\n\n# PORTME: override above test on systems where it is broken\ncase $host_os in\ninterix[3-9]*)\n  # Interix 3.5 installs completely hosed .la files for C++, so rather than\n  # hack all around it, let's just trust \"g++\" to DTRT.\n  predep_objects_CXX=\n  postdep_objects_CXX=\n  postdeps_CXX=\n  ;;\n\nlinux*)\n  case `$CC -V 2>&1 | sed 5q` in\n  *Sun\\ C*)\n    # Sun C++ 5.9\n\n    # The more standards-conforming stlport4 library is\n    # incompatible with the Cstd library. Avoid specifying\n    # it if it's in CXXFLAGS. Ignore libCrun as\n    # -library=stlport4 depends on it.\n    case \" $CXX $CXXFLAGS \" in\n    *\" -library=stlport4 \"*)\n      solaris_use_stlport4=yes\n      ;;\n    esac\n\n    if test \"$solaris_use_stlport4\" != yes; then\n      postdeps_CXX='-library=Cstd -library=Crun'\n    fi\n    ;;\n  esac\n  ;;\n\nsolaris*)\n  case $cc_basename in\n  CC* | sunCC*)\n    # The more standards-conforming stlport4 library is\n    # incompatible with the Cstd library. Avoid specifying\n    # it if it's in CXXFLAGS. Ignore libCrun as\n    # -library=stlport4 depends on it.\n    case \" $CXX $CXXFLAGS \" in\n    *\" -library=stlport4 \"*)\n      solaris_use_stlport4=yes\n      ;;\n    esac\n\n    # Adding this requires a known-good setup of shared libraries for\n    # Sun compiler versions before 5.6, else PIC objects from an old\n    # archive will be linked into the output, leading to subtle bugs.\n    if test \"$solaris_use_stlport4\" != yes; then\n      postdeps_CXX='-library=Cstd -library=Crun'\n    fi\n    ;;\n  esac\n  ;;\nesac\n\n\ncase \" $postdeps_CXX \" in\n*\" -lc \"*) archive_cmds_need_lc_CXX=no ;;\nesac\n compiler_lib_search_dirs_CXX=\nif test -n \"${compiler_lib_search_path_CXX}\"; then\n compiler_lib_search_dirs_CXX=`echo \" ${compiler_lib_search_path_CXX}\" | ${SED} -e 's! -L! !g' -e 's!^ !!'`\nfi\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n    lt_prog_compiler_wl_CXX=\nlt_prog_compiler_pic_CXX=\nlt_prog_compiler_static_CXX=\n\n\n  # C++ specific cases for pic, static, wl, etc.\n  if test \"$GXX\" = yes; then\n    lt_prog_compiler_wl_CXX='-Wl,'\n    lt_prog_compiler_static_CXX='-static'\n\n    case $host_os in\n    aix*)\n      # All AIX code is PIC.\n      if test \"$host_cpu\" = ia64; then\n\t# AIX 5 now supports IA64 processor\n\tlt_prog_compiler_static_CXX='-Bstatic'\n      fi\n      ;;\n\n    amigaos*)\n      case $host_cpu in\n      powerpc)\n            # see comment about AmigaOS4 .so support\n            lt_prog_compiler_pic_CXX='-fPIC'\n        ;;\n      m68k)\n            # FIXME: we need at least 68020 code to build shared libraries, but\n            # adding the `-m68020' flag to GCC prevents building anything better,\n            # like `-m68040'.\n            lt_prog_compiler_pic_CXX='-m68020 -resident32 -malways-restore-a4'\n        ;;\n      esac\n      ;;\n\n    beos* | irix5* | irix6* | nonstopux* | osf3* | osf4* | osf5*)\n      # PIC is the default for these OSes.\n      ;;\n    mingw* | cygwin* | os2* | pw32* | cegcc*)\n      # This hack is so that the source file can tell whether it is being\n      # built for inclusion in a dll (and should export symbols for example).\n      # Although the cygwin gcc ignores -fPIC, still need this for old-style\n      # (--disable-auto-import) libraries\n      lt_prog_compiler_pic_CXX='-DDLL_EXPORT'\n      ;;\n    darwin* | rhapsody*)\n      # PIC is the default on this platform\n      # Common symbols not allowed in MH_DYLIB files\n      lt_prog_compiler_pic_CXX='-fno-common'\n      ;;\n    *djgpp*)\n      # DJGPP does not support shared libraries at all\n      lt_prog_compiler_pic_CXX=\n      ;;\n    haiku*)\n      # PIC is the default for Haiku.\n      # The \"-static\" flag exists, but is broken.\n      lt_prog_compiler_static_CXX=\n      ;;\n    interix[3-9]*)\n      # Interix 3.x gcc -fpic/-fPIC options generate broken code.\n      # Instead, we relocate shared libraries at runtime.\n      ;;\n    sysv4*MP*)\n      if test -d /usr/nec; then\n\tlt_prog_compiler_pic_CXX=-Kconform_pic\n      fi\n      ;;\n    hpux*)\n      # PIC is the default for 64-bit PA HP-UX, but not for 32-bit\n      # PA HP-UX.  On IA64 HP-UX, PIC is the default but the pic flag\n      # sets the default TLS model and affects inlining.\n      case $host_cpu in\n      hppa*64*)\n\t;;\n      *)\n\tlt_prog_compiler_pic_CXX='-fPIC'\n\t;;\n      esac\n      ;;\n    *qnx* | *nto*)\n      # QNX uses GNU C++, but need to define -shared option too, otherwise\n      # it will coredump.\n      lt_prog_compiler_pic_CXX='-fPIC -shared'\n      ;;\n    *)\n      lt_prog_compiler_pic_CXX='-fPIC'\n      ;;\n    esac\n  else\n    case $host_os in\n      aix[4-9]*)\n\t# All AIX code is PIC.\n\tif test \"$host_cpu\" = ia64; then\n\t  # AIX 5 now supports IA64 processor\n\t  lt_prog_compiler_static_CXX='-Bstatic'\n\telse\n\t  lt_prog_compiler_static_CXX='-bnso -bI:/lib/syscalls.exp'\n\tfi\n\t;;\n      chorus*)\n\tcase $cc_basename in\n\tcxch68*)\n\t  # Green Hills C++ Compiler\n\t  # _LT_TAGVAR(lt_prog_compiler_static, CXX)=\"--no_auto_instantiation -u __main -u __premain -u _abort -r $COOL_DIR/lib/libOrb.a $MVME_DIR/lib/CC/libC.a $MVME_DIR/lib/classix/libcx.s.a\"\n\t  ;;\n\tesac\n\t;;\n      mingw* | cygwin* | os2* | pw32* | cegcc*)\n\t# This hack is so that the source file can tell whether it is being\n\t# built for inclusion in a dll (and should export symbols for example).\n\tlt_prog_compiler_pic_CXX='-DDLL_EXPORT'\n\t;;\n      dgux*)\n\tcase $cc_basename in\n\t  ec++*)\n\t    lt_prog_compiler_pic_CXX='-KPIC'\n\t    ;;\n\t  ghcx*)\n\t    # Green Hills C++ Compiler\n\t    lt_prog_compiler_pic_CXX='-pic'\n\t    ;;\n\t  *)\n\t    ;;\n\tesac\n\t;;\n      freebsd* | dragonfly*)\n\t# FreeBSD uses GNU C++\n\t;;\n      hpux9* | hpux10* | hpux11*)\n\tcase $cc_basename in\n\t  CC*)\n\t    lt_prog_compiler_wl_CXX='-Wl,'\n\t    lt_prog_compiler_static_CXX='${wl}-a ${wl}archive'\n\t    if test \"$host_cpu\" != ia64; then\n\t      lt_prog_compiler_pic_CXX='+Z'\n\t    fi\n\t    ;;\n\t  aCC*)\n\t    lt_prog_compiler_wl_CXX='-Wl,'\n\t    lt_prog_compiler_static_CXX='${wl}-a ${wl}archive'\n\t    case $host_cpu in\n\t    hppa*64*|ia64*)\n\t      # +Z the default\n\t      ;;\n\t    *)\n\t      lt_prog_compiler_pic_CXX='+Z'\n\t      ;;\n\t    esac\n\t    ;;\n\t  *)\n\t    ;;\n\tesac\n\t;;\n      interix*)\n\t# This is c89, which is MS Visual C++ (no shared libs)\n\t# Anyone wants to do a port?\n\t;;\n      irix5* | irix6* | nonstopux*)\n\tcase $cc_basename in\n\t  CC*)\n\t    lt_prog_compiler_wl_CXX='-Wl,'\n\t    lt_prog_compiler_static_CXX='-non_shared'\n\t    # CC pic flag -KPIC is the default.\n\t    ;;\n\t  *)\n\t    ;;\n\tesac\n\t;;\n      linux* | k*bsd*-gnu | kopensolaris*-gnu | gnu*)\n\tcase $cc_basename in\n\t  KCC*)\n\t    # KAI C++ Compiler\n\t    lt_prog_compiler_wl_CXX='--backend -Wl,'\n\t    lt_prog_compiler_pic_CXX='-fPIC'\n\t    ;;\n\t  ecpc* )\n\t    # old Intel C++ for x86_64 which still supported -KPIC.\n\t    lt_prog_compiler_wl_CXX='-Wl,'\n\t    lt_prog_compiler_pic_CXX='-KPIC'\n\t    lt_prog_compiler_static_CXX='-static'\n\t    ;;\n\t  icpc* )\n\t    # Intel C++, used to be incompatible with GCC.\n\t    # ICC 10 doesn't accept -KPIC any more.\n\t    lt_prog_compiler_wl_CXX='-Wl,'\n\t    lt_prog_compiler_pic_CXX='-fPIC'\n\t    lt_prog_compiler_static_CXX='-static'\n\t    ;;\n\t  pgCC* | pgcpp*)\n\t    # Portland Group C++ compiler\n\t    lt_prog_compiler_wl_CXX='-Wl,'\n\t    lt_prog_compiler_pic_CXX='-fpic'\n\t    lt_prog_compiler_static_CXX='-Bstatic'\n\t    ;;\n\t  cxx*)\n\t    # Compaq C++\n\t    # Make sure the PIC flag is empty.  It appears that all Alpha\n\t    # Linux and Compaq Tru64 Unix objects are PIC.\n\t    lt_prog_compiler_pic_CXX=\n\t    lt_prog_compiler_static_CXX='-non_shared'\n\t    ;;\n\t  xlc* | xlC* | bgxl[cC]* | mpixl[cC]*)\n\t    # IBM XL 8.0, 9.0 on PPC and BlueGene\n\t    lt_prog_compiler_wl_CXX='-Wl,'\n\t    lt_prog_compiler_pic_CXX='-qpic'\n\t    lt_prog_compiler_static_CXX='-qstaticlink'\n\t    ;;\n\t  *)\n\t    case `$CC -V 2>&1 | sed 5q` in\n\t    *Sun\\ C*)\n\t      # Sun C++ 5.9\n\t      lt_prog_compiler_pic_CXX='-KPIC'\n\t      lt_prog_compiler_static_CXX='-Bstatic'\n\t      lt_prog_compiler_wl_CXX='-Qoption ld '\n\t      ;;\n\t    esac\n\t    ;;\n\tesac\n\t;;\n      lynxos*)\n\t;;\n      m88k*)\n\t;;\n      mvs*)\n\tcase $cc_basename in\n\t  cxx*)\n\t    lt_prog_compiler_pic_CXX='-W c,exportall'\n\t    ;;\n\t  *)\n\t    ;;\n\tesac\n\t;;\n      netbsd* | netbsdelf*-gnu)\n\t;;\n      *qnx* | *nto*)\n        # QNX uses GNU C++, but need to define -shared option too, otherwise\n        # it will coredump.\n        lt_prog_compiler_pic_CXX='-fPIC -shared'\n        ;;\n      osf3* | osf4* | osf5*)\n\tcase $cc_basename in\n\t  KCC*)\n\t    lt_prog_compiler_wl_CXX='--backend -Wl,'\n\t    ;;\n\t  RCC*)\n\t    # Rational C++ 2.4.1\n\t    lt_prog_compiler_pic_CXX='-pic'\n\t    ;;\n\t  cxx*)\n\t    # Digital/Compaq C++\n\t    lt_prog_compiler_wl_CXX='-Wl,'\n\t    # Make sure the PIC flag is empty.  It appears that all Alpha\n\t    # Linux and Compaq Tru64 Unix objects are PIC.\n\t    lt_prog_compiler_pic_CXX=\n\t    lt_prog_compiler_static_CXX='-non_shared'\n\t    ;;\n\t  *)\n\t    ;;\n\tesac\n\t;;\n      psos*)\n\t;;\n      solaris*)\n\tcase $cc_basename in\n\t  CC* | sunCC*)\n\t    # Sun C++ 4.2, 5.x and Centerline C++\n\t    lt_prog_compiler_pic_CXX='-KPIC'\n\t    lt_prog_compiler_static_CXX='-Bstatic'\n\t    lt_prog_compiler_wl_CXX='-Qoption ld '\n\t    ;;\n\t  gcx*)\n\t    # Green Hills C++ Compiler\n\t    lt_prog_compiler_pic_CXX='-PIC'\n\t    ;;\n\t  *)\n\t    ;;\n\tesac\n\t;;\n      sunos4*)\n\tcase $cc_basename in\n\t  CC*)\n\t    # Sun C++ 4.x\n\t    lt_prog_compiler_pic_CXX='-pic'\n\t    lt_prog_compiler_static_CXX='-Bstatic'\n\t    ;;\n\t  lcc*)\n\t    # Lucid\n\t    lt_prog_compiler_pic_CXX='-pic'\n\t    ;;\n\t  *)\n\t    ;;\n\tesac\n\t;;\n      sysv5* | unixware* | sco3.2v5* | sco5v6* | OpenUNIX*)\n\tcase $cc_basename in\n\t  CC*)\n\t    lt_prog_compiler_wl_CXX='-Wl,'\n\t    lt_prog_compiler_pic_CXX='-KPIC'\n\t    lt_prog_compiler_static_CXX='-Bstatic'\n\t    ;;\n\tesac\n\t;;\n      tandem*)\n\tcase $cc_basename in\n\t  NCC*)\n\t    # NonStop-UX NCC 3.20\n\t    lt_prog_compiler_pic_CXX='-KPIC'\n\t    ;;\n\t  *)\n\t    ;;\n\tesac\n\t;;\n      vxworks*)\n\t;;\n      *)\n\tlt_prog_compiler_can_build_shared_CXX=no\n\t;;\n    esac\n  fi\n\ncase $host_os in\n  # For platforms which do not support PIC, -DPIC is meaningless:\n  *djgpp*)\n    lt_prog_compiler_pic_CXX=\n    ;;\n  *)\n    lt_prog_compiler_pic_CXX=\"$lt_prog_compiler_pic_CXX -DPIC\"\n    ;;\nesac\n\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for $compiler option to produce PIC\" >&5\n$as_echo_n \"checking for $compiler option to produce PIC... \" >&6; }\nif ${lt_cv_prog_compiler_pic_CXX+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  lt_cv_prog_compiler_pic_CXX=$lt_prog_compiler_pic_CXX\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $lt_cv_prog_compiler_pic_CXX\" >&5\n$as_echo \"$lt_cv_prog_compiler_pic_CXX\" >&6; }\nlt_prog_compiler_pic_CXX=$lt_cv_prog_compiler_pic_CXX\n\n#\n# Check to make sure the PIC flag actually works.\n#\nif test -n \"$lt_prog_compiler_pic_CXX\"; then\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: checking if $compiler PIC flag $lt_prog_compiler_pic_CXX works\" >&5\n$as_echo_n \"checking if $compiler PIC flag $lt_prog_compiler_pic_CXX works... \" >&6; }\nif ${lt_cv_prog_compiler_pic_works_CXX+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  lt_cv_prog_compiler_pic_works_CXX=no\n   ac_outfile=conftest.$ac_objext\n   echo \"$lt_simple_compile_test_code\" > conftest.$ac_ext\n   lt_compiler_flag=\"$lt_prog_compiler_pic_CXX -DPIC\"\n   # Insert the option either (1) after the last *FLAGS variable, or\n   # (2) before a word containing \"conftest.\", or (3) at the end.\n   # Note that $ac_compile itself does not contain backslashes and begins\n   # with a dollar sign (not a hyphen), so the echo should work correctly.\n   # The option is referenced via a variable to avoid confusing sed.\n   lt_compile=`echo \"$ac_compile\" | $SED \\\n   -e 's:.*FLAGS}\\{0,1\\} :&$lt_compiler_flag :; t' \\\n   -e 's: [^ ]*conftest\\.: $lt_compiler_flag&:; t' \\\n   -e 's:$: $lt_compiler_flag:'`\n   (eval echo \"\\\"\\$as_me:$LINENO: $lt_compile\\\"\" >&5)\n   (eval \"$lt_compile\" 2>conftest.err)\n   ac_status=$?\n   cat conftest.err >&5\n   echo \"$as_me:$LINENO: \\$? = $ac_status\" >&5\n   if (exit $ac_status) && test -s \"$ac_outfile\"; then\n     # The compiler can only warn and ignore the option if not recognized\n     # So say no if there are warnings other than the usual output.\n     $ECHO \"$_lt_compiler_boilerplate\" | $SED '/^$/d' >conftest.exp\n     $SED '/^$/d; /^ *+/d' conftest.err >conftest.er2\n     if test ! -s conftest.er2 || diff conftest.exp conftest.er2 >/dev/null; then\n       lt_cv_prog_compiler_pic_works_CXX=yes\n     fi\n   fi\n   $RM conftest*\n\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $lt_cv_prog_compiler_pic_works_CXX\" >&5\n$as_echo \"$lt_cv_prog_compiler_pic_works_CXX\" >&6; }\n\nif test x\"$lt_cv_prog_compiler_pic_works_CXX\" = xyes; then\n    case $lt_prog_compiler_pic_CXX in\n     \"\" | \" \"*) ;;\n     *) lt_prog_compiler_pic_CXX=\" $lt_prog_compiler_pic_CXX\" ;;\n     esac\nelse\n    lt_prog_compiler_pic_CXX=\n     lt_prog_compiler_can_build_shared_CXX=no\nfi\n\nfi\n\n\n\n\n\n#\n# Check to make sure the static flag actually works.\n#\nwl=$lt_prog_compiler_wl_CXX eval lt_tmp_static_flag=\\\"$lt_prog_compiler_static_CXX\\\"\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking if $compiler static flag $lt_tmp_static_flag works\" >&5\n$as_echo_n \"checking if $compiler static flag $lt_tmp_static_flag works... \" >&6; }\nif ${lt_cv_prog_compiler_static_works_CXX+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  lt_cv_prog_compiler_static_works_CXX=no\n   save_LDFLAGS=\"$LDFLAGS\"\n   LDFLAGS=\"$LDFLAGS $lt_tmp_static_flag\"\n   echo \"$lt_simple_link_test_code\" > conftest.$ac_ext\n   if (eval $ac_link 2>conftest.err) && test -s conftest$ac_exeext; then\n     # The linker can only warn and ignore the option if not recognized\n     # So say no if there are warnings\n     if test -s conftest.err; then\n       # Append any errors to the config.log.\n       cat conftest.err 1>&5\n       $ECHO \"$_lt_linker_boilerplate\" | $SED '/^$/d' > conftest.exp\n       $SED '/^$/d; /^ *+/d' conftest.err >conftest.er2\n       if diff conftest.exp conftest.er2 >/dev/null; then\n         lt_cv_prog_compiler_static_works_CXX=yes\n       fi\n     else\n       lt_cv_prog_compiler_static_works_CXX=yes\n     fi\n   fi\n   $RM -r conftest*\n   LDFLAGS=\"$save_LDFLAGS\"\n\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $lt_cv_prog_compiler_static_works_CXX\" >&5\n$as_echo \"$lt_cv_prog_compiler_static_works_CXX\" >&6; }\n\nif test x\"$lt_cv_prog_compiler_static_works_CXX\" = xyes; then\n    :\nelse\n    lt_prog_compiler_static_CXX=\nfi\n\n\n\n\n    { $as_echo \"$as_me:${as_lineno-$LINENO}: checking if $compiler supports -c -o file.$ac_objext\" >&5\n$as_echo_n \"checking if $compiler supports -c -o file.$ac_objext... \" >&6; }\nif ${lt_cv_prog_compiler_c_o_CXX+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  lt_cv_prog_compiler_c_o_CXX=no\n   $RM -r conftest 2>/dev/null\n   mkdir conftest\n   cd conftest\n   mkdir out\n   echo \"$lt_simple_compile_test_code\" > conftest.$ac_ext\n\n   lt_compiler_flag=\"-o out/conftest2.$ac_objext\"\n   # Insert the option either (1) after the last *FLAGS variable, or\n   # (2) before a word containing \"conftest.\", or (3) at the end.\n   # Note that $ac_compile itself does not contain backslashes and begins\n   # with a dollar sign (not a hyphen), so the echo should work correctly.\n   lt_compile=`echo \"$ac_compile\" | $SED \\\n   -e 's:.*FLAGS}\\{0,1\\} :&$lt_compiler_flag :; t' \\\n   -e 's: [^ ]*conftest\\.: $lt_compiler_flag&:; t' \\\n   -e 's:$: $lt_compiler_flag:'`\n   (eval echo \"\\\"\\$as_me:$LINENO: $lt_compile\\\"\" >&5)\n   (eval \"$lt_compile\" 2>out/conftest.err)\n   ac_status=$?\n   cat out/conftest.err >&5\n   echo \"$as_me:$LINENO: \\$? = $ac_status\" >&5\n   if (exit $ac_status) && test -s out/conftest2.$ac_objext\n   then\n     # The compiler can only warn and ignore the option if not recognized\n     # So say no if there are warnings\n     $ECHO \"$_lt_compiler_boilerplate\" | $SED '/^$/d' > out/conftest.exp\n     $SED '/^$/d; /^ *+/d' out/conftest.err >out/conftest.er2\n     if test ! -s out/conftest.er2 || diff out/conftest.exp out/conftest.er2 >/dev/null; then\n       lt_cv_prog_compiler_c_o_CXX=yes\n     fi\n   fi\n   chmod u+w . 2>&5\n   $RM conftest*\n   # SGI C++ compiler will create directory out/ii_files/ for\n   # template instantiation\n   test -d out/ii_files && $RM out/ii_files/* && rmdir out/ii_files\n   $RM out/* && rmdir out\n   cd ..\n   $RM -r conftest\n   $RM conftest*\n\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $lt_cv_prog_compiler_c_o_CXX\" >&5\n$as_echo \"$lt_cv_prog_compiler_c_o_CXX\" >&6; }\n\n\n\n    { $as_echo \"$as_me:${as_lineno-$LINENO}: checking if $compiler supports -c -o file.$ac_objext\" >&5\n$as_echo_n \"checking if $compiler supports -c -o file.$ac_objext... \" >&6; }\nif ${lt_cv_prog_compiler_c_o_CXX+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  lt_cv_prog_compiler_c_o_CXX=no\n   $RM -r conftest 2>/dev/null\n   mkdir conftest\n   cd conftest\n   mkdir out\n   echo \"$lt_simple_compile_test_code\" > conftest.$ac_ext\n\n   lt_compiler_flag=\"-o out/conftest2.$ac_objext\"\n   # Insert the option either (1) after the last *FLAGS variable, or\n   # (2) before a word containing \"conftest.\", or (3) at the end.\n   # Note that $ac_compile itself does not contain backslashes and begins\n   # with a dollar sign (not a hyphen), so the echo should work correctly.\n   lt_compile=`echo \"$ac_compile\" | $SED \\\n   -e 's:.*FLAGS}\\{0,1\\} :&$lt_compiler_flag :; t' \\\n   -e 's: [^ ]*conftest\\.: $lt_compiler_flag&:; t' \\\n   -e 's:$: $lt_compiler_flag:'`\n   (eval echo \"\\\"\\$as_me:$LINENO: $lt_compile\\\"\" >&5)\n   (eval \"$lt_compile\" 2>out/conftest.err)\n   ac_status=$?\n   cat out/conftest.err >&5\n   echo \"$as_me:$LINENO: \\$? = $ac_status\" >&5\n   if (exit $ac_status) && test -s out/conftest2.$ac_objext\n   then\n     # The compiler can only warn and ignore the option if not recognized\n     # So say no if there are warnings\n     $ECHO \"$_lt_compiler_boilerplate\" | $SED '/^$/d' > out/conftest.exp\n     $SED '/^$/d; /^ *+/d' out/conftest.err >out/conftest.er2\n     if test ! -s out/conftest.er2 || diff out/conftest.exp out/conftest.er2 >/dev/null; then\n       lt_cv_prog_compiler_c_o_CXX=yes\n     fi\n   fi\n   chmod u+w . 2>&5\n   $RM conftest*\n   # SGI C++ compiler will create directory out/ii_files/ for\n   # template instantiation\n   test -d out/ii_files && $RM out/ii_files/* && rmdir out/ii_files\n   $RM out/* && rmdir out\n   cd ..\n   $RM -r conftest\n   $RM conftest*\n\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $lt_cv_prog_compiler_c_o_CXX\" >&5\n$as_echo \"$lt_cv_prog_compiler_c_o_CXX\" >&6; }\n\n\n\n\nhard_links=\"nottested\"\nif test \"$lt_cv_prog_compiler_c_o_CXX\" = no && test \"$need_locks\" != no; then\n  # do not overwrite the value of need_locks provided by the user\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: checking if we can lock with hard links\" >&5\n$as_echo_n \"checking if we can lock with hard links... \" >&6; }\n  hard_links=yes\n  $RM conftest*\n  ln conftest.a conftest.b 2>/dev/null && hard_links=no\n  touch conftest.a\n  ln conftest.a conftest.b 2>&5 || hard_links=no\n  ln conftest.a conftest.b 2>/dev/null && hard_links=no\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: $hard_links\" >&5\n$as_echo \"$hard_links\" >&6; }\n  if test \"$hard_links\" = no; then\n    { $as_echo \"$as_me:${as_lineno-$LINENO}: WARNING: \\`$CC' does not support \\`-c -o', so \\`make -j' may be unsafe\" >&5\n$as_echo \"$as_me: WARNING: \\`$CC' does not support \\`-c -o', so \\`make -j' may be unsafe\" >&2;}\n    need_locks=warn\n  fi\nelse\n  need_locks=no\nfi\n\n\n\n    { $as_echo \"$as_me:${as_lineno-$LINENO}: checking whether the $compiler linker ($LD) supports shared libraries\" >&5\n$as_echo_n \"checking whether the $compiler linker ($LD) supports shared libraries... \" >&6; }\n\n  export_symbols_cmds_CXX='$NM $libobjs $convenience | $global_symbol_pipe | $SED '\\''s/.* //'\\'' | sort | uniq > $export_symbols'\n  exclude_expsyms_CXX='_GLOBAL_OFFSET_TABLE_|_GLOBAL__F[ID]_.*'\n  case $host_os in\n  aix[4-9]*)\n    # If we're using GNU nm, then we don't want the \"-C\" option.\n    # -C means demangle to AIX nm, but means don't demangle with GNU nm\n    # Also, AIX nm treats weak defined symbols like other global defined\n    # symbols, whereas GNU nm marks them as \"W\".\n    if $NM -V 2>&1 | $GREP 'GNU' > /dev/null; then\n      export_symbols_cmds_CXX='$NM -Bpg $libobjs $convenience | awk '\\''{ if (((\\$ 2 == \"T\") || (\\$ 2 == \"D\") || (\\$ 2 == \"B\") || (\\$ 2 == \"W\")) && (substr(\\$ 3,1,1) != \".\")) { print \\$ 3 } }'\\'' | sort -u > $export_symbols'\n    else\n      export_symbols_cmds_CXX='$NM -BCpg $libobjs $convenience | awk '\\''{ if (((\\$ 2 == \"T\") || (\\$ 2 == \"D\") || (\\$ 2 == \"B\")) && (substr(\\$ 3,1,1) != \".\")) { print \\$ 3 } }'\\'' | sort -u > $export_symbols'\n    fi\n    ;;\n  pw32*)\n    export_symbols_cmds_CXX=\"$ltdll_cmds\"\n    ;;\n  cygwin* | mingw* | cegcc*)\n    case $cc_basename in\n    cl*)\n      exclude_expsyms_CXX='_NULL_IMPORT_DESCRIPTOR|_IMPORT_DESCRIPTOR_.*'\n      ;;\n    *)\n      export_symbols_cmds_CXX='$NM $libobjs $convenience | $global_symbol_pipe | $SED -e '\\''/^[BCDGRS][ ]/s/.*[ ]\\([^ ]*\\)/\\1 DATA/;s/^.*[ ]__nm__\\([^ ]*\\)[ ][^ ]*/\\1 DATA/;/^I[ ]/d;/^[AITW][ ]/s/.* //'\\'' | sort | uniq > $export_symbols'\n      exclude_expsyms_CXX='[_]+GLOBAL_OFFSET_TABLE_|[_]+GLOBAL__[FID]_.*|[_]+head_[A-Za-z0-9_]+_dll|[A-Za-z0-9_]+_dll_iname'\n      ;;\n    esac\n    ;;\n  linux* | k*bsd*-gnu | gnu*)\n    link_all_deplibs_CXX=no\n    ;;\n  *)\n    export_symbols_cmds_CXX='$NM $libobjs $convenience | $global_symbol_pipe | $SED '\\''s/.* //'\\'' | sort | uniq > $export_symbols'\n    ;;\n  esac\n\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $ld_shlibs_CXX\" >&5\n$as_echo \"$ld_shlibs_CXX\" >&6; }\ntest \"$ld_shlibs_CXX\" = no && can_build_shared=no\n\nwith_gnu_ld_CXX=$with_gnu_ld\n\n\n\n\n\n\n#\n# Do we need to explicitly link libc?\n#\ncase \"x$archive_cmds_need_lc_CXX\" in\nx|xyes)\n  # Assume -lc should be added\n  archive_cmds_need_lc_CXX=yes\n\n  if test \"$enable_shared\" = yes && test \"$GCC\" = yes; then\n    case $archive_cmds_CXX in\n    *'~'*)\n      # FIXME: we may have to deal with multi-command sequences.\n      ;;\n    '$CC '*)\n      # Test whether the compiler implicitly links with -lc since on some\n      # systems, -lgcc has to come before -lc. If gcc already passes -lc\n      # to ld, don't add -lc before -lgcc.\n      { $as_echo \"$as_me:${as_lineno-$LINENO}: checking whether -lc should be explicitly linked in\" >&5\n$as_echo_n \"checking whether -lc should be explicitly linked in... \" >&6; }\nif ${lt_cv_archive_cmds_need_lc_CXX+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  $RM conftest*\n\techo \"$lt_simple_compile_test_code\" > conftest.$ac_ext\n\n\tif { { eval echo \"\\\"\\$as_me\\\":${as_lineno-$LINENO}: \\\"$ac_compile\\\"\"; } >&5\n  (eval $ac_compile) 2>&5\n  ac_status=$?\n  $as_echo \"$as_me:${as_lineno-$LINENO}: \\$? = $ac_status\" >&5\n  test $ac_status = 0; } 2>conftest.err; then\n\t  soname=conftest\n\t  lib=conftest\n\t  libobjs=conftest.$ac_objext\n\t  deplibs=\n\t  wl=$lt_prog_compiler_wl_CXX\n\t  pic_flag=$lt_prog_compiler_pic_CXX\n\t  compiler_flags=-v\n\t  linker_flags=-v\n\t  verstring=\n\t  output_objdir=.\n\t  libname=conftest\n\t  lt_save_allow_undefined_flag=$allow_undefined_flag_CXX\n\t  allow_undefined_flag_CXX=\n\t  if { { eval echo \"\\\"\\$as_me\\\":${as_lineno-$LINENO}: \\\"$archive_cmds_CXX 2\\>\\&1 \\| $GREP \\\" -lc \\\" \\>/dev/null 2\\>\\&1\\\"\"; } >&5\n  (eval $archive_cmds_CXX 2\\>\\&1 \\| $GREP \\\" -lc \\\" \\>/dev/null 2\\>\\&1) 2>&5\n  ac_status=$?\n  $as_echo \"$as_me:${as_lineno-$LINENO}: \\$? = $ac_status\" >&5\n  test $ac_status = 0; }\n\t  then\n\t    lt_cv_archive_cmds_need_lc_CXX=no\n\t  else\n\t    lt_cv_archive_cmds_need_lc_CXX=yes\n\t  fi\n\t  allow_undefined_flag_CXX=$lt_save_allow_undefined_flag\n\telse\n\t  cat conftest.err 1>&5\n\tfi\n\t$RM conftest*\n\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $lt_cv_archive_cmds_need_lc_CXX\" >&5\n$as_echo \"$lt_cv_archive_cmds_need_lc_CXX\" >&6; }\n      archive_cmds_need_lc_CXX=$lt_cv_archive_cmds_need_lc_CXX\n      ;;\n    esac\n  fi\n  ;;\nesac\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n    { $as_echo \"$as_me:${as_lineno-$LINENO}: checking dynamic linker characteristics\" >&5\n$as_echo_n \"checking dynamic linker characteristics... \" >&6; }\n\nlibrary_names_spec=\nlibname_spec='lib$name'\nsoname_spec=\nshrext_cmds=\".so\"\npostinstall_cmds=\npostuninstall_cmds=\nfinish_cmds=\nfinish_eval=\nshlibpath_var=\nshlibpath_overrides_runpath=unknown\nversion_type=none\ndynamic_linker=\"$host_os ld.so\"\nsys_lib_dlsearch_path_spec=\"/lib /usr/lib\"\nneed_lib_prefix=unknown\nhardcode_into_libs=no\n\n# when you set need_version to no, make sure it does not cause -set_version\n# flags to be left without arguments\nneed_version=unknown\n\ncase $host_os in\naix3*)\n  version_type=linux # correct to gnu/linux during the next big refactor\n  library_names_spec='${libname}${release}${shared_ext}$versuffix $libname.a'\n  shlibpath_var=LIBPATH\n\n  # AIX 3 has no versioning support, so we append a major version to the name.\n  soname_spec='${libname}${release}${shared_ext}$major'\n  ;;\n\naix[4-9]*)\n  version_type=linux # correct to gnu/linux during the next big refactor\n  need_lib_prefix=no\n  need_version=no\n  hardcode_into_libs=yes\n  if test \"$host_cpu\" = ia64; then\n    # AIX 5 supports IA64\n    library_names_spec='${libname}${release}${shared_ext}$major ${libname}${release}${shared_ext}$versuffix $libname${shared_ext}'\n    shlibpath_var=LD_LIBRARY_PATH\n  else\n    # With GCC up to 2.95.x, collect2 would create an import file\n    # for dependence libraries.  The import file would start with\n    # the line `#! .'.  This would cause the generated library to\n    # depend on `.', always an invalid library.  This was fixed in\n    # development snapshots of GCC prior to 3.0.\n    case $host_os in\n      aix4 | aix4.[01] | aix4.[01].*)\n      if { echo '#if __GNUC__ > 2 || (__GNUC__ == 2 && __GNUC_MINOR__ >= 97)'\n\t   echo ' yes '\n\t   echo '#endif'; } | ${CC} -E - | $GREP yes > /dev/null; then\n\t:\n      else\n\tcan_build_shared=no\n      fi\n      ;;\n    esac\n    # AIX (on Power*) has no versioning support, so currently we can not hardcode correct\n    # soname into executable. Probably we can add versioning support to\n    # collect2, so additional links can be useful in future.\n    if test \"$aix_use_runtimelinking\" = yes; then\n      # If using run time linking (on AIX 4.2 or later) use lib<name>.so\n      # instead of lib<name>.a to let people know that these are not\n      # typical AIX shared libraries.\n      library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'\n    else\n      # We preserve .a as extension for shared libraries through AIX4.2\n      # and later when we are not doing run time linking.\n      library_names_spec='${libname}${release}.a $libname.a'\n      soname_spec='${libname}${release}${shared_ext}$major'\n    fi\n    shlibpath_var=LIBPATH\n  fi\n  ;;\n\namigaos*)\n  case $host_cpu in\n  powerpc)\n    # Since July 2007 AmigaOS4 officially supports .so libraries.\n    # When compiling the executable, add -use-dynld -Lsobjs: to the compileline.\n    library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'\n    ;;\n  m68k)\n    library_names_spec='$libname.ixlibrary $libname.a'\n    # Create ${libname}_ixlibrary.a entries in /sys/libs.\n    finish_eval='for lib in `ls $libdir/*.ixlibrary 2>/dev/null`; do libname=`func_echo_all \"$lib\" | $SED '\\''s%^.*/\\([^/]*\\)\\.ixlibrary$%\\1%'\\''`; test $RM /sys/libs/${libname}_ixlibrary.a; $show \"cd /sys/libs && $LN_S $lib ${libname}_ixlibrary.a\"; cd /sys/libs && $LN_S $lib ${libname}_ixlibrary.a || exit 1; done'\n    ;;\n  esac\n  ;;\n\nbeos*)\n  library_names_spec='${libname}${shared_ext}'\n  dynamic_linker=\"$host_os ld.so\"\n  shlibpath_var=LIBRARY_PATH\n  ;;\n\nbsdi[45]*)\n  version_type=linux # correct to gnu/linux during the next big refactor\n  need_version=no\n  library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'\n  soname_spec='${libname}${release}${shared_ext}$major'\n  finish_cmds='PATH=\"\\$PATH:/sbin\" ldconfig $libdir'\n  shlibpath_var=LD_LIBRARY_PATH\n  sys_lib_search_path_spec=\"/shlib /usr/lib /usr/X11/lib /usr/contrib/lib /lib /usr/local/lib\"\n  sys_lib_dlsearch_path_spec=\"/shlib /usr/lib /usr/local/lib\"\n  # the default ld.so.conf also contains /usr/contrib/lib and\n  # /usr/X11R6/lib (/usr/X11 is a link to /usr/X11R6), but let us allow\n  # libtool to hard-code these into programs\n  ;;\n\ncygwin* | mingw* | pw32* | cegcc*)\n  version_type=windows\n  shrext_cmds=\".dll\"\n  need_version=no\n  need_lib_prefix=no\n\n  case $GCC,$cc_basename in\n  yes,*)\n    # gcc\n    library_names_spec='$libname.dll.a'\n    # DLL is installed to $(libdir)/../bin by postinstall_cmds\n    postinstall_cmds='base_file=`basename \\${file}`~\n      dlpath=`$SHELL 2>&1 -c '\\''. $dir/'\\''\\${base_file}'\\''i; echo \\$dlname'\\''`~\n      dldir=$destdir/`dirname \\$dlpath`~\n      test -d \\$dldir || mkdir -p \\$dldir~\n      $install_prog $dir/$dlname \\$dldir/$dlname~\n      chmod a+x \\$dldir/$dlname~\n      if test -n '\\''$stripme'\\'' && test -n '\\''$striplib'\\''; then\n        eval '\\''$striplib \\$dldir/$dlname'\\'' || exit \\$?;\n      fi'\n    postuninstall_cmds='dldll=`$SHELL 2>&1 -c '\\''. $file; echo \\$dlname'\\''`~\n      dlpath=$dir/\\$dldll~\n       $RM \\$dlpath'\n    shlibpath_overrides_runpath=yes\n\n    case $host_os in\n    cygwin*)\n      # Cygwin DLLs use 'cyg' prefix rather than 'lib'\n      soname_spec='`echo ${libname} | sed -e 's/^lib/cyg/'``echo ${release} | $SED -e 's/[.]/-/g'`${versuffix}${shared_ext}'\n\n      ;;\n    mingw* | cegcc*)\n      # MinGW DLLs use traditional 'lib' prefix\n      soname_spec='${libname}`echo ${release} | $SED -e 's/[.]/-/g'`${versuffix}${shared_ext}'\n      ;;\n    pw32*)\n      # pw32 DLLs use 'pw' prefix rather than 'lib'\n      library_names_spec='`echo ${libname} | sed -e 's/^lib/pw/'``echo ${release} | $SED -e 's/[.]/-/g'`${versuffix}${shared_ext}'\n      ;;\n    esac\n    dynamic_linker='Win32 ld.exe'\n    ;;\n\n  *,cl*)\n    # Native MSVC\n    libname_spec='$name'\n    soname_spec='${libname}`echo ${release} | $SED -e 's/[.]/-/g'`${versuffix}${shared_ext}'\n    library_names_spec='${libname}.dll.lib'\n\n    case $build_os in\n    mingw*)\n      sys_lib_search_path_spec=\n      lt_save_ifs=$IFS\n      IFS=';'\n      for lt_path in $LIB\n      do\n        IFS=$lt_save_ifs\n        # Let DOS variable expansion print the short 8.3 style file name.\n        lt_path=`cd \"$lt_path\" 2>/dev/null && cmd //C \"for %i in (\".\") do @echo %~si\"`\n        sys_lib_search_path_spec=\"$sys_lib_search_path_spec $lt_path\"\n      done\n      IFS=$lt_save_ifs\n      # Convert to MSYS style.\n      sys_lib_search_path_spec=`$ECHO \"$sys_lib_search_path_spec\" | sed -e 's|\\\\\\\\|/|g' -e 's| \\\\([a-zA-Z]\\\\):| /\\\\1|g' -e 's|^ ||'`\n      ;;\n    cygwin*)\n      # Convert to unix form, then to dos form, then back to unix form\n      # but this time dos style (no spaces!) so that the unix form looks\n      # like /cygdrive/c/PROGRA~1:/cygdr...\n      sys_lib_search_path_spec=`cygpath --path --unix \"$LIB\"`\n      sys_lib_search_path_spec=`cygpath --path --dos \"$sys_lib_search_path_spec\" 2>/dev/null`\n      sys_lib_search_path_spec=`cygpath --path --unix \"$sys_lib_search_path_spec\" | $SED -e \"s/$PATH_SEPARATOR/ /g\"`\n      ;;\n    *)\n      sys_lib_search_path_spec=\"$LIB\"\n      if $ECHO \"$sys_lib_search_path_spec\" | $GREP ';[c-zC-Z]:/' >/dev/null; then\n        # It is most probably a Windows format PATH.\n        sys_lib_search_path_spec=`$ECHO \"$sys_lib_search_path_spec\" | $SED -e 's/;/ /g'`\n      else\n        sys_lib_search_path_spec=`$ECHO \"$sys_lib_search_path_spec\" | $SED -e \"s/$PATH_SEPARATOR/ /g\"`\n      fi\n      # FIXME: find the short name or the path components, as spaces are\n      # common. (e.g. \"Program Files\" -> \"PROGRA~1\")\n      ;;\n    esac\n\n    # DLL is installed to $(libdir)/../bin by postinstall_cmds\n    postinstall_cmds='base_file=`basename \\${file}`~\n      dlpath=`$SHELL 2>&1 -c '\\''. $dir/'\\''\\${base_file}'\\''i; echo \\$dlname'\\''`~\n      dldir=$destdir/`dirname \\$dlpath`~\n      test -d \\$dldir || mkdir -p \\$dldir~\n      $install_prog $dir/$dlname \\$dldir/$dlname'\n    postuninstall_cmds='dldll=`$SHELL 2>&1 -c '\\''. $file; echo \\$dlname'\\''`~\n      dlpath=$dir/\\$dldll~\n       $RM \\$dlpath'\n    shlibpath_overrides_runpath=yes\n    dynamic_linker='Win32 link.exe'\n    ;;\n\n  *)\n    # Assume MSVC wrapper\n    library_names_spec='${libname}`echo ${release} | $SED -e 's/[.]/-/g'`${versuffix}${shared_ext} $libname.lib'\n    dynamic_linker='Win32 ld.exe'\n    ;;\n  esac\n  # FIXME: first we should search . and the directory the executable is in\n  shlibpath_var=PATH\n  ;;\n\ndarwin* | rhapsody*)\n  dynamic_linker=\"$host_os dyld\"\n  version_type=darwin\n  need_lib_prefix=no\n  need_version=no\n  library_names_spec='${libname}${release}${major}$shared_ext ${libname}$shared_ext'\n  soname_spec='${libname}${release}${major}$shared_ext'\n  shlibpath_overrides_runpath=yes\n  shlibpath_var=DYLD_LIBRARY_PATH\n  shrext_cmds='`test .$module = .yes && echo .so || echo .dylib`'\n\n  sys_lib_dlsearch_path_spec='/usr/local/lib /lib /usr/lib'\n  ;;\n\ndgux*)\n  version_type=linux # correct to gnu/linux during the next big refactor\n  need_lib_prefix=no\n  need_version=no\n  library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname$shared_ext'\n  soname_spec='${libname}${release}${shared_ext}$major'\n  shlibpath_var=LD_LIBRARY_PATH\n  ;;\n\nfreebsd* | dragonfly*)\n  # DragonFly does not have aout.  When/if they implement a new\n  # versioning mechanism, adjust this.\n  if test -x /usr/bin/objformat; then\n    objformat=`/usr/bin/objformat`\n  else\n    case $host_os in\n    freebsd[23].*) objformat=aout ;;\n    *) objformat=elf ;;\n    esac\n  fi\n  version_type=freebsd-$objformat\n  case $version_type in\n    freebsd-elf*)\n      library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext} $libname${shared_ext}'\n      need_version=no\n      need_lib_prefix=no\n      ;;\n    freebsd-*)\n      library_names_spec='${libname}${release}${shared_ext}$versuffix $libname${shared_ext}$versuffix'\n      need_version=yes\n      ;;\n  esac\n  shlibpath_var=LD_LIBRARY_PATH\n  case $host_os in\n  freebsd2.*)\n    shlibpath_overrides_runpath=yes\n    ;;\n  freebsd3.[01]* | freebsdelf3.[01]*)\n    shlibpath_overrides_runpath=yes\n    hardcode_into_libs=yes\n    ;;\n  freebsd3.[2-9]* | freebsdelf3.[2-9]* | \\\n  freebsd4.[0-5] | freebsdelf4.[0-5] | freebsd4.1.1 | freebsdelf4.1.1)\n    shlibpath_overrides_runpath=no\n    hardcode_into_libs=yes\n    ;;\n  *) # from 4.6 on, and DragonFly\n    shlibpath_overrides_runpath=yes\n    hardcode_into_libs=yes\n    ;;\n  esac\n  ;;\n\nhaiku*)\n  version_type=linux # correct to gnu/linux during the next big refactor\n  need_lib_prefix=no\n  need_version=no\n  dynamic_linker=\"$host_os runtime_loader\"\n  library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}${major} ${libname}${shared_ext}'\n  soname_spec='${libname}${release}${shared_ext}$major'\n  shlibpath_var=LIBRARY_PATH\n  shlibpath_overrides_runpath=yes\n  sys_lib_dlsearch_path_spec='/boot/home/config/lib /boot/common/lib /boot/system/lib'\n  hardcode_into_libs=yes\n  ;;\n\nhpux9* | hpux10* | hpux11*)\n  # Give a soname corresponding to the major version so that dld.sl refuses to\n  # link against other versions.\n  version_type=sunos\n  need_lib_prefix=no\n  need_version=no\n  case $host_cpu in\n  ia64*)\n    shrext_cmds='.so'\n    hardcode_into_libs=yes\n    dynamic_linker=\"$host_os dld.so\"\n    shlibpath_var=LD_LIBRARY_PATH\n    shlibpath_overrides_runpath=yes # Unless +noenvvar is specified.\n    library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'\n    soname_spec='${libname}${release}${shared_ext}$major'\n    if test \"X$HPUX_IA64_MODE\" = X32; then\n      sys_lib_search_path_spec=\"/usr/lib/hpux32 /usr/local/lib/hpux32 /usr/local/lib\"\n    else\n      sys_lib_search_path_spec=\"/usr/lib/hpux64 /usr/local/lib/hpux64\"\n    fi\n    sys_lib_dlsearch_path_spec=$sys_lib_search_path_spec\n    ;;\n  hppa*64*)\n    shrext_cmds='.sl'\n    hardcode_into_libs=yes\n    dynamic_linker=\"$host_os dld.sl\"\n    shlibpath_var=LD_LIBRARY_PATH # How should we handle SHLIB_PATH\n    shlibpath_overrides_runpath=yes # Unless +noenvvar is specified.\n    library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'\n    soname_spec='${libname}${release}${shared_ext}$major'\n    sys_lib_search_path_spec=\"/usr/lib/pa20_64 /usr/ccs/lib/pa20_64\"\n    sys_lib_dlsearch_path_spec=$sys_lib_search_path_spec\n    ;;\n  *)\n    shrext_cmds='.sl'\n    dynamic_linker=\"$host_os dld.sl\"\n    shlibpath_var=SHLIB_PATH\n    shlibpath_overrides_runpath=no # +s is required to enable SHLIB_PATH\n    library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'\n    soname_spec='${libname}${release}${shared_ext}$major'\n    ;;\n  esac\n  # HP-UX runs *really* slowly unless shared libraries are mode 555, ...\n  postinstall_cmds='chmod 555 $lib'\n  # or fails outright, so override atomically:\n  install_override_mode=555\n  ;;\n\ninterix[3-9]*)\n  version_type=linux # correct to gnu/linux during the next big refactor\n  need_lib_prefix=no\n  need_version=no\n  library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${shared_ext}'\n  soname_spec='${libname}${release}${shared_ext}$major'\n  dynamic_linker='Interix 3.x ld.so.1 (PE, like ELF)'\n  shlibpath_var=LD_LIBRARY_PATH\n  shlibpath_overrides_runpath=no\n  hardcode_into_libs=yes\n  ;;\n\nirix5* | irix6* | nonstopux*)\n  case $host_os in\n    nonstopux*) version_type=nonstopux ;;\n    *)\n\tif test \"$lt_cv_prog_gnu_ld\" = yes; then\n\t\tversion_type=linux # correct to gnu/linux during the next big refactor\n\telse\n\t\tversion_type=irix\n\tfi ;;\n  esac\n  need_lib_prefix=no\n  need_version=no\n  soname_spec='${libname}${release}${shared_ext}$major'\n  library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${release}${shared_ext} $libname${shared_ext}'\n  case $host_os in\n  irix5* | nonstopux*)\n    libsuff= shlibsuff=\n    ;;\n  *)\n    case $LD in # libtool.m4 will add one of these switches to LD\n    *-32|*\"-32 \"|*-melf32bsmip|*\"-melf32bsmip \")\n      libsuff= shlibsuff= libmagic=32-bit;;\n    *-n32|*\"-n32 \"|*-melf32bmipn32|*\"-melf32bmipn32 \")\n      libsuff=32 shlibsuff=N32 libmagic=N32;;\n    *-64|*\"-64 \"|*-melf64bmip|*\"-melf64bmip \")\n      libsuff=64 shlibsuff=64 libmagic=64-bit;;\n    *) libsuff= shlibsuff= libmagic=never-match;;\n    esac\n    ;;\n  esac\n  shlibpath_var=LD_LIBRARY${shlibsuff}_PATH\n  shlibpath_overrides_runpath=no\n  sys_lib_search_path_spec=\"/usr/lib${libsuff} /lib${libsuff} /usr/local/lib${libsuff}\"\n  sys_lib_dlsearch_path_spec=\"/usr/lib${libsuff} /lib${libsuff}\"\n  hardcode_into_libs=yes\n  ;;\n\n# No shared lib support for Linux oldld, aout, or coff.\nlinux*oldld* | linux*aout* | linux*coff*)\n  dynamic_linker=no\n  ;;\n\n# This must be glibc/ELF.\nlinux* | k*bsd*-gnu | kopensolaris*-gnu | gnu*)\n  version_type=linux # correct to gnu/linux during the next big refactor\n  need_lib_prefix=no\n  need_version=no\n  library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'\n  soname_spec='${libname}${release}${shared_ext}$major'\n  finish_cmds='PATH=\"\\$PATH:/sbin\" ldconfig -n $libdir'\n  shlibpath_var=LD_LIBRARY_PATH\n  shlibpath_overrides_runpath=no\n\n  # Some binutils ld are patched to set DT_RUNPATH\n  if ${lt_cv_shlibpath_overrides_runpath+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  lt_cv_shlibpath_overrides_runpath=no\n    save_LDFLAGS=$LDFLAGS\n    save_libdir=$libdir\n    eval \"libdir=/foo; wl=\\\"$lt_prog_compiler_wl_CXX\\\"; \\\n\t LDFLAGS=\\\"\\$LDFLAGS $hardcode_libdir_flag_spec_CXX\\\"\"\n    cat confdefs.h - <<_ACEOF >conftest.$ac_ext\n/* end confdefs.h.  */\n\nint\nmain ()\n{\n\n  ;\n  return 0;\n}\n_ACEOF\nif ac_fn_cxx_try_link \"$LINENO\"; then :\n  if  ($OBJDUMP -p conftest$ac_exeext) 2>/dev/null | grep \"RUNPATH.*$libdir\" >/dev/null; then :\n  lt_cv_shlibpath_overrides_runpath=yes\nfi\nfi\nrm -f core conftest.err conftest.$ac_objext \\\n    conftest$ac_exeext conftest.$ac_ext\n    LDFLAGS=$save_LDFLAGS\n    libdir=$save_libdir\n\nfi\n\n  shlibpath_overrides_runpath=$lt_cv_shlibpath_overrides_runpath\n\n  # This implies no fast_install, which is unacceptable.\n  # Some rework will be needed to allow for fast_install\n  # before this can be enabled.\n  hardcode_into_libs=yes\n\n  # Append ld.so.conf contents to the search path\n  if test -f /etc/ld.so.conf; then\n    lt_ld_extra=`awk '/^include / { system(sprintf(\"cd /etc; cat %s 2>/dev/null\", \\$2)); skip = 1; } { if (!skip) print \\$0; skip = 0; }' < /etc/ld.so.conf | $SED -e 's/#.*//;/^[\t ]*hwcap[\t ]/d;s/[:,\t]/ /g;s/=[^=]*$//;s/=[^= ]* / /g;s/\"//g;/^$/d' | tr '\\n' ' '`\n    sys_lib_dlsearch_path_spec=\"/lib /usr/lib $lt_ld_extra\"\n  fi\n\n  # We used to test for /lib/ld.so.1 and disable shared libraries on\n  # powerpc, because MkLinux only supported shared libraries with the\n  # GNU dynamic linker.  Since this was broken with cross compilers,\n  # most powerpc-linux boxes support dynamic linking these days and\n  # people can always --disable-shared, the test was removed, and we\n  # assume the GNU/Linux dynamic linker is in use.\n  dynamic_linker='GNU/Linux ld.so'\n  ;;\n\nnetbsdelf*-gnu)\n  version_type=linux\n  need_lib_prefix=no\n  need_version=no\n  library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${shared_ext}'\n  soname_spec='${libname}${release}${shared_ext}$major'\n  shlibpath_var=LD_LIBRARY_PATH\n  shlibpath_overrides_runpath=no\n  hardcode_into_libs=yes\n  dynamic_linker='NetBSD ld.elf_so'\n  ;;\n\nnetbsd*)\n  version_type=sunos\n  need_lib_prefix=no\n  need_version=no\n  if echo __ELF__ | $CC -E - | $GREP __ELF__ >/dev/null; then\n    library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${shared_ext}$versuffix'\n    finish_cmds='PATH=\"\\$PATH:/sbin\" ldconfig -m $libdir'\n    dynamic_linker='NetBSD (a.out) ld.so'\n  else\n    library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${shared_ext}'\n    soname_spec='${libname}${release}${shared_ext}$major'\n    dynamic_linker='NetBSD ld.elf_so'\n  fi\n  shlibpath_var=LD_LIBRARY_PATH\n  shlibpath_overrides_runpath=yes\n  hardcode_into_libs=yes\n  ;;\n\nnewsos6)\n  version_type=linux # correct to gnu/linux during the next big refactor\n  library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'\n  shlibpath_var=LD_LIBRARY_PATH\n  shlibpath_overrides_runpath=yes\n  ;;\n\n*nto* | *qnx*)\n  version_type=qnx\n  need_lib_prefix=no\n  need_version=no\n  library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'\n  soname_spec='${libname}${release}${shared_ext}$major'\n  shlibpath_var=LD_LIBRARY_PATH\n  shlibpath_overrides_runpath=no\n  hardcode_into_libs=yes\n  dynamic_linker='ldqnx.so'\n  ;;\n\nopenbsd*)\n  version_type=sunos\n  sys_lib_dlsearch_path_spec=\"/usr/lib\"\n  need_lib_prefix=no\n  # Some older versions of OpenBSD (3.3 at least) *do* need versioned libs.\n  case $host_os in\n    openbsd3.3 | openbsd3.3.*)\tneed_version=yes ;;\n    *)\t\t\t\tneed_version=no  ;;\n  esac\n  library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${shared_ext}$versuffix'\n  finish_cmds='PATH=\"\\$PATH:/sbin\" ldconfig -m $libdir'\n  shlibpath_var=LD_LIBRARY_PATH\n  if test -z \"`echo __ELF__ | $CC -E - | $GREP __ELF__`\" || test \"$host_os-$host_cpu\" = \"openbsd2.8-powerpc\"; then\n    case $host_os in\n      openbsd2.[89] | openbsd2.[89].*)\n\tshlibpath_overrides_runpath=no\n\t;;\n      *)\n\tshlibpath_overrides_runpath=yes\n\t;;\n      esac\n  else\n    shlibpath_overrides_runpath=yes\n  fi\n  ;;\n\nos2*)\n  libname_spec='$name'\n  shrext_cmds=\".dll\"\n  need_lib_prefix=no\n  library_names_spec='$libname${shared_ext} $libname.a'\n  dynamic_linker='OS/2 ld.exe'\n  shlibpath_var=LIBPATH\n  ;;\n\nosf3* | osf4* | osf5*)\n  version_type=osf\n  need_lib_prefix=no\n  need_version=no\n  soname_spec='${libname}${release}${shared_ext}$major'\n  library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'\n  shlibpath_var=LD_LIBRARY_PATH\n  sys_lib_search_path_spec=\"/usr/shlib /usr/ccs/lib /usr/lib/cmplrs/cc /usr/lib /usr/local/lib /var/shlib\"\n  sys_lib_dlsearch_path_spec=\"$sys_lib_search_path_spec\"\n  ;;\n\nrdos*)\n  dynamic_linker=no\n  ;;\n\nsolaris*)\n  version_type=linux # correct to gnu/linux during the next big refactor\n  need_lib_prefix=no\n  need_version=no\n  library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'\n  soname_spec='${libname}${release}${shared_ext}$major'\n  shlibpath_var=LD_LIBRARY_PATH\n  shlibpath_overrides_runpath=yes\n  hardcode_into_libs=yes\n  # ldd complains unless libraries are executable\n  postinstall_cmds='chmod +x $lib'\n  ;;\n\nsunos4*)\n  version_type=sunos\n  library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${shared_ext}$versuffix'\n  finish_cmds='PATH=\"\\$PATH:/usr/etc\" ldconfig $libdir'\n  shlibpath_var=LD_LIBRARY_PATH\n  shlibpath_overrides_runpath=yes\n  if test \"$with_gnu_ld\" = yes; then\n    need_lib_prefix=no\n  fi\n  need_version=yes\n  ;;\n\nsysv4 | sysv4.3*)\n  version_type=linux # correct to gnu/linux during the next big refactor\n  library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'\n  soname_spec='${libname}${release}${shared_ext}$major'\n  shlibpath_var=LD_LIBRARY_PATH\n  case $host_vendor in\n    sni)\n      shlibpath_overrides_runpath=no\n      need_lib_prefix=no\n      runpath_var=LD_RUN_PATH\n      ;;\n    siemens)\n      need_lib_prefix=no\n      ;;\n    motorola)\n      need_lib_prefix=no\n      need_version=no\n      shlibpath_overrides_runpath=no\n      sys_lib_search_path_spec='/lib /usr/lib /usr/ccs/lib'\n      ;;\n  esac\n  ;;\n\nsysv4*MP*)\n  if test -d /usr/nec ;then\n    version_type=linux # correct to gnu/linux during the next big refactor\n    library_names_spec='$libname${shared_ext}.$versuffix $libname${shared_ext}.$major $libname${shared_ext}'\n    soname_spec='$libname${shared_ext}.$major'\n    shlibpath_var=LD_LIBRARY_PATH\n  fi\n  ;;\n\nsysv5* | sco3.2v5* | sco5v6* | unixware* | OpenUNIX* | sysv4*uw2*)\n  version_type=freebsd-elf\n  need_lib_prefix=no\n  need_version=no\n  library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext} $libname${shared_ext}'\n  soname_spec='${libname}${release}${shared_ext}$major'\n  shlibpath_var=LD_LIBRARY_PATH\n  shlibpath_overrides_runpath=yes\n  hardcode_into_libs=yes\n  if test \"$with_gnu_ld\" = yes; then\n    sys_lib_search_path_spec='/usr/local/lib /usr/gnu/lib /usr/ccs/lib /usr/lib /lib'\n  else\n    sys_lib_search_path_spec='/usr/ccs/lib /usr/lib'\n    case $host_os in\n      sco3.2v5*)\n        sys_lib_search_path_spec=\"$sys_lib_search_path_spec /lib\"\n\t;;\n    esac\n  fi\n  sys_lib_dlsearch_path_spec='/usr/lib'\n  ;;\n\ntpf*)\n  # TPF is a cross-target only.  Preferred cross-host = GNU/Linux.\n  version_type=linux # correct to gnu/linux during the next big refactor\n  need_lib_prefix=no\n  need_version=no\n  library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'\n  shlibpath_var=LD_LIBRARY_PATH\n  shlibpath_overrides_runpath=no\n  hardcode_into_libs=yes\n  ;;\n\nuts4*)\n  version_type=linux # correct to gnu/linux during the next big refactor\n  library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'\n  soname_spec='${libname}${release}${shared_ext}$major'\n  shlibpath_var=LD_LIBRARY_PATH\n  ;;\n\n*)\n  dynamic_linker=no\n  ;;\nesac\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $dynamic_linker\" >&5\n$as_echo \"$dynamic_linker\" >&6; }\ntest \"$dynamic_linker\" = no && can_build_shared=no\n\nvariables_saved_for_relink=\"PATH $shlibpath_var $runpath_var\"\nif test \"$GCC\" = yes; then\n  variables_saved_for_relink=\"$variables_saved_for_relink GCC_EXEC_PREFIX COMPILER_PATH LIBRARY_PATH\"\nfi\n\nif test \"${lt_cv_sys_lib_search_path_spec+set}\" = set; then\n  sys_lib_search_path_spec=\"$lt_cv_sys_lib_search_path_spec\"\nfi\nif test \"${lt_cv_sys_lib_dlsearch_path_spec+set}\" = set; then\n  sys_lib_dlsearch_path_spec=\"$lt_cv_sys_lib_dlsearch_path_spec\"\nfi\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n    { $as_echo \"$as_me:${as_lineno-$LINENO}: checking how to hardcode library paths into programs\" >&5\n$as_echo_n \"checking how to hardcode library paths into programs... \" >&6; }\nhardcode_action_CXX=\nif test -n \"$hardcode_libdir_flag_spec_CXX\" ||\n   test -n \"$runpath_var_CXX\" ||\n   test \"X$hardcode_automatic_CXX\" = \"Xyes\" ; then\n\n  # We can hardcode non-existent directories.\n  if test \"$hardcode_direct_CXX\" != no &&\n     # If the only mechanism to avoid hardcoding is shlibpath_var, we\n     # have to relink, otherwise we might link with an installed library\n     # when we should be linking with a yet-to-be-installed one\n     ## test \"$_LT_TAGVAR(hardcode_shlibpath_var, CXX)\" != no &&\n     test \"$hardcode_minus_L_CXX\" != no; then\n    # Linking always hardcodes the temporary library directory.\n    hardcode_action_CXX=relink\n  else\n    # We can link without hardcoding, and we can hardcode nonexisting dirs.\n    hardcode_action_CXX=immediate\n  fi\nelse\n  # We cannot hardcode anything, or else we can only hardcode existing\n  # directories.\n  hardcode_action_CXX=unsupported\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $hardcode_action_CXX\" >&5\n$as_echo \"$hardcode_action_CXX\" >&6; }\n\nif test \"$hardcode_action_CXX\" = relink ||\n   test \"$inherit_rpath_CXX\" = yes; then\n  # Fast installation is not supported\n  enable_fast_install=no\nelif test \"$shlibpath_overrides_runpath\" = yes ||\n     test \"$enable_shared\" = no; then\n  # Fast installation is not necessary\n  enable_fast_install=needless\nfi\n\n\n\n\n\n\n\n  fi # test -n \"$compiler\"\n\n  CC=$lt_save_CC\n  CFLAGS=$lt_save_CFLAGS\n  LDCXX=$LD\n  LD=$lt_save_LD\n  GCC=$lt_save_GCC\n  with_gnu_ld=$lt_save_with_gnu_ld\n  lt_cv_path_LDCXX=$lt_cv_path_LD\n  lt_cv_path_LD=$lt_save_path_LD\n  lt_cv_prog_gnu_ldcxx=$lt_cv_prog_gnu_ld\n  lt_cv_prog_gnu_ld=$lt_save_with_gnu_ld\nfi # test \"$_lt_caught_CXX_error\" != yes\n\nac_ext=c\nac_cpp='$CPP $CPPFLAGS'\nac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5'\nac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5'\nac_compiler_gnu=$ac_cv_c_compiler_gnu\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n        ac_config_commands=\"$ac_config_commands libtool\"\n\n\n\n\n# Only expand once:\n\n\n\nac_config_headers=\"$ac_config_headers config.h src/include/fst/config.h\"\n\n\nac_config_files=\"$ac_config_files Makefile src/Makefile src/include/Makefile src/lib/Makefile src/bin/Makefile src/test/Makefile src/extensions/Makefile src/extensions/compact/Makefile src/extensions/compress/Makefile src/extensions/const/Makefile src/extensions/far/Makefile src/extensions/linear/Makefile src/extensions/lookahead/Makefile src/extensions/mpdt/Makefile src/extensions/ngram/Makefile src/extensions/pdt/Makefile src/extensions/python/Makefile src/extensions/special/Makefile src/script/Makefile\"\n\n\nac_ext=cpp\nac_cpp='$CXXCPP $CPPFLAGS'\nac_compile='$CXX -c $CXXFLAGS $CPPFLAGS conftest.$ac_ext >&5'\nac_link='$CXX -o conftest$ac_exeext $CXXFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5'\nac_compiler_gnu=$ac_cv_cxx_compiler_gnu\n\n\n# Check whether --enable-compact-fsts was given.\nif test \"${enable_compact_fsts+set}\" = set; then :\n  enableval=$enable_compact_fsts;\nelse\n  enable_compact_fsts=no\nfi\n\n if test \"x$enable_compact_fsts\" != xno; then\n  HAVE_COMPACT_TRUE=\n  HAVE_COMPACT_FALSE='#'\nelse\n  HAVE_COMPACT_TRUE='#'\n  HAVE_COMPACT_FALSE=\nfi\n\n\n# Check whether --enable-compress was given.\nif test \"${enable_compress+set}\" = set; then :\n  enableval=$enable_compress;\nelse\n  enable_compress=no\nfi\n\n if test \"x$enable_compress\" != xno; then\n  HAVE_COMPRESS_TRUE=\n  HAVE_COMPRESS_FALSE='#'\nelse\n  HAVE_COMPRESS_TRUE='#'\n  HAVE_COMPRESS_FALSE=\nfi\n\n\n# Check whether --enable-const-fsts was given.\nif test \"${enable_const_fsts+set}\" = set; then :\n  enableval=$enable_const_fsts;\nelse\n  enable_const_fsts=no\nfi\n\n if test \"x$enable_const_fsts\" != xno; then\n  HAVE_CONST_TRUE=\n  HAVE_CONST_FALSE='#'\nelse\n  HAVE_CONST_TRUE='#'\n  HAVE_CONST_FALSE=\nfi\n\n\n# Check whether --enable-far was given.\nif test \"${enable_far+set}\" = set; then :\n  enableval=$enable_far;\nelse\n  enable_far=no\nfi\n\n if test \"x$enable_far\" != xno; then\n  HAVE_FAR_TRUE=\n  HAVE_FAR_FALSE='#'\nelse\n  HAVE_FAR_TRUE='#'\n  HAVE_FAR_FALSE=\nfi\n\n\n# Check whether --enable-linear-fsts was given.\nif test \"${enable_linear_fsts+set}\" = set; then :\n  enableval=$enable_linear_fsts;\nelse\n  enable_linear_fsts=no\nfi\n\n if test \"x$enable_linear_fsts\" != xno; then\n  HAVE_LINEAR_TRUE=\n  HAVE_LINEAR_FALSE='#'\nelse\n  HAVE_LINEAR_TRUE='#'\n  HAVE_LINEAR_FALSE=\nfi\n\n\n# Check whether --enable-lookahead-fsts was given.\nif test \"${enable_lookahead_fsts+set}\" = set; then :\n  enableval=$enable_lookahead_fsts;\nelse\n  enable_lookahead_fsts=no\nfi\n\n if test \"x$enable_lookahead_fsts\" != xno; then\n  HAVE_LOOKAHEAD_TRUE=\n  HAVE_LOOKAHEAD_FALSE='#'\nelse\n  HAVE_LOOKAHEAD_TRUE='#'\n  HAVE_LOOKAHEAD_FALSE=\nfi\n\n\n# Check whether --enable-mpdt was given.\nif test \"${enable_mpdt+set}\" = set; then :\n  enableval=$enable_mpdt;\nelse\n  enable_mpdt=no\nfi\n\n if test \"x$enable_mpdt\" != xno; then\n  HAVE_MPDT_TRUE=\n  HAVE_MPDT_FALSE='#'\nelse\n  HAVE_MPDT_TRUE='#'\n  HAVE_MPDT_FALSE=\nfi\n\n\n# Check whether --enable-ngram-fsts was given.\nif test \"${enable_ngram_fsts+set}\" = set; then :\n  enableval=$enable_ngram_fsts;\nelse\n  enable_ngram_fsts=no\nfi\n\n if test \"x$enable_ngram_fsts\" != xno; then\n  HAVE_NGRAM_TRUE=\n  HAVE_NGRAM_FALSE='#'\nelse\n  HAVE_NGRAM_TRUE='#'\n  HAVE_NGRAM_FALSE=\nfi\n\n\n# Check whether --enable-pdt was given.\nif test \"${enable_pdt+set}\" = set; then :\n  enableval=$enable_pdt;\nelse\n  enable_pdt=no\nfi\n\n if test \"x$enable_pdt\" != xno; then\n  HAVE_PDT_TRUE=\n  HAVE_PDT_FALSE='#'\nelse\n  HAVE_PDT_TRUE='#'\n  HAVE_PDT_FALSE=\nfi\n\n\n# Check whether --enable-python was given.\nif test \"${enable_python+set}\" = set; then :\n  enableval=$enable_python;\nelse\n  enable_python=no\nfi\n\n if test \"x$enable_python\" != xno; then\n  HAVE_PYTHON_TRUE=\n  HAVE_PYTHON_FALSE='#'\nelse\n  HAVE_PYTHON_TRUE='#'\n  HAVE_PYTHON_FALSE=\nfi\n\nif test \"x$enable_python\" != xno; then\n\n\n\n\n\n\n        if test -n \"$PYTHON\"; then\n      # If the user set $PYTHON, use it and don't search something else.\n      { $as_echo \"$as_me:${as_lineno-$LINENO}: checking whether $PYTHON version is >= 2.7\" >&5\n$as_echo_n \"checking whether $PYTHON version is >= 2.7... \" >&6; }\n      prog=\"import sys\n# split strings by '.' and convert to numeric.  Append some zeros\n# because we need at least 4 digits for the hex conversion.\n# map returns an iterator in Python 3.0 and a list in 2.x\nminver = list(map(int, '2.7'.split('.'))) + [0, 0, 0]\nminverhex = 0\n# xrange is not present in Python 3.0 and range returns an iterator\nfor i in list(range(0, 4)): minverhex = (minverhex << 8) + minver[i]\nsys.exit(sys.hexversion < minverhex)\"\n  if { echo \"$as_me:$LINENO: $PYTHON -c \"$prog\"\" >&5\n   ($PYTHON -c \"$prog\") >&5 2>&5\n   ac_status=$?\n   echo \"$as_me:$LINENO: \\$? = $ac_status\" >&5\n   (exit $ac_status); }; then :\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: yes\" >&5\n$as_echo \"yes\" >&6; }\nelse\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: no\" >&5\n$as_echo \"no\" >&6; }\n\t\t\t       as_fn_error $? \"Python interpreter is too old\" \"$LINENO\" 5\nfi\n      am_display_PYTHON=$PYTHON\n    else\n      # Otherwise, try each interpreter until we find one that satisfies\n      # VERSION.\n      { $as_echo \"$as_me:${as_lineno-$LINENO}: checking for a Python interpreter with version >= 2.7\" >&5\n$as_echo_n \"checking for a Python interpreter with version >= 2.7... \" >&6; }\nif ${am_cv_pathless_PYTHON+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n\n\tfor am_cv_pathless_PYTHON in python python2 python3 python3.3 python3.2 python3.1 python3.0 python2.7  python2.6 python2.5 python2.4 python2.3 python2.2 python2.1 python2.0 none; do\n\t  test \"$am_cv_pathless_PYTHON\" = none && break\n\t  prog=\"import sys\n# split strings by '.' and convert to numeric.  Append some zeros\n# because we need at least 4 digits for the hex conversion.\n# map returns an iterator in Python 3.0 and a list in 2.x\nminver = list(map(int, '2.7'.split('.'))) + [0, 0, 0]\nminverhex = 0\n# xrange is not present in Python 3.0 and range returns an iterator\nfor i in list(range(0, 4)): minverhex = (minverhex << 8) + minver[i]\nsys.exit(sys.hexversion < minverhex)\"\n  if { echo \"$as_me:$LINENO: $am_cv_pathless_PYTHON -c \"$prog\"\" >&5\n   ($am_cv_pathless_PYTHON -c \"$prog\") >&5 2>&5\n   ac_status=$?\n   echo \"$as_me:$LINENO: \\$? = $ac_status\" >&5\n   (exit $ac_status); }; then :\n  break\nfi\n\tdone\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $am_cv_pathless_PYTHON\" >&5\n$as_echo \"$am_cv_pathless_PYTHON\" >&6; }\n      # Set $PYTHON to the absolute path of $am_cv_pathless_PYTHON.\n      if test \"$am_cv_pathless_PYTHON\" = none; then\n\tPYTHON=:\n      else\n        # Extract the first word of \"$am_cv_pathless_PYTHON\", so it can be a program name with args.\nset dummy $am_cv_pathless_PYTHON; ac_word=$2\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for $ac_word\" >&5\n$as_echo_n \"checking for $ac_word... \" >&6; }\nif ${ac_cv_path_PYTHON+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  case $PYTHON in\n  [\\\\/]* | ?:[\\\\/]*)\n  ac_cv_path_PYTHON=\"$PYTHON\" # Let the user override the test with a path.\n  ;;\n  *)\n  as_save_IFS=$IFS; IFS=$PATH_SEPARATOR\nfor as_dir in $PATH\ndo\n  IFS=$as_save_IFS\n  test -z \"$as_dir\" && as_dir=.\n    for ac_exec_ext in '' $ac_executable_extensions; do\n  if as_fn_executable_p \"$as_dir/$ac_word$ac_exec_ext\"; then\n    ac_cv_path_PYTHON=\"$as_dir/$ac_word$ac_exec_ext\"\n    $as_echo \"$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext\" >&5\n    break 2\n  fi\ndone\n  done\nIFS=$as_save_IFS\n\n  ;;\nesac\nfi\nPYTHON=$ac_cv_path_PYTHON\nif test -n \"$PYTHON\"; then\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: $PYTHON\" >&5\n$as_echo \"$PYTHON\" >&6; }\nelse\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: no\" >&5\n$as_echo \"no\" >&6; }\nfi\n\n\n      fi\n      am_display_PYTHON=$am_cv_pathless_PYTHON\n    fi\n\n\n  if test \"$PYTHON\" = :; then\n      as_fn_error $? \"no suitable Python interpreter found\" \"$LINENO\" 5\n  else\n\n\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: checking for $am_display_PYTHON version\" >&5\n$as_echo_n \"checking for $am_display_PYTHON version... \" >&6; }\nif ${am_cv_python_version+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  am_cv_python_version=`$PYTHON -c \"import sys; sys.stdout.write(sys.version[:3])\"`\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $am_cv_python_version\" >&5\n$as_echo \"$am_cv_python_version\" >&6; }\n  PYTHON_VERSION=$am_cv_python_version\n\n\n\n  PYTHON_PREFIX='${prefix}'\n\n  PYTHON_EXEC_PREFIX='${exec_prefix}'\n\n\n\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: checking for $am_display_PYTHON platform\" >&5\n$as_echo_n \"checking for $am_display_PYTHON platform... \" >&6; }\nif ${am_cv_python_platform+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  am_cv_python_platform=`$PYTHON -c \"import sys; sys.stdout.write(sys.platform)\"`\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $am_cv_python_platform\" >&5\n$as_echo \"$am_cv_python_platform\" >&6; }\n  PYTHON_PLATFORM=$am_cv_python_platform\n\n\n  # Just factor out some code duplication.\n  am_python_setup_sysconfig=\"\\\nimport sys\n# Prefer sysconfig over distutils.sysconfig, for better compatibility\n# with python 3.x.  See automake bug#10227.\ntry:\n    import sysconfig\nexcept ImportError:\n    can_use_sysconfig = 0\nelse:\n    can_use_sysconfig = 1\n# Can't use sysconfig in CPython 2.7, since it's broken in virtualenvs:\n# <https://github.com/pypa/virtualenv/issues/118>\ntry:\n    from platform import python_implementation\n    if python_implementation() == 'CPython' and sys.version[:3] == '2.7':\n        can_use_sysconfig = 0\nexcept ImportError:\n    pass\"\n\n\n            { $as_echo \"$as_me:${as_lineno-$LINENO}: checking for $am_display_PYTHON script directory\" >&5\n$as_echo_n \"checking for $am_display_PYTHON script directory... \" >&6; }\nif ${am_cv_python_pythondir+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  if test \"x$prefix\" = xNONE\n     then\n       am_py_prefix=$ac_default_prefix\n     else\n       am_py_prefix=$prefix\n     fi\n     am_cv_python_pythondir=`$PYTHON -c \"\n$am_python_setup_sysconfig\nif can_use_sysconfig:\n    sitedir = sysconfig.get_path('purelib', vars={'base':'$am_py_prefix'})\nelse:\n    from distutils import sysconfig\n    sitedir = sysconfig.get_python_lib(0, 0, prefix='$am_py_prefix')\nsys.stdout.write(sitedir)\"`\n     case $am_cv_python_pythondir in\n     $am_py_prefix*)\n       am__strip_prefix=`echo \"$am_py_prefix\" | sed 's|.|.|g'`\n       am_cv_python_pythondir=`echo \"$am_cv_python_pythondir\" | sed \"s,^$am__strip_prefix,$PYTHON_PREFIX,\"`\n       ;;\n     *)\n       case $am_py_prefix in\n         /usr|/System*) ;;\n         *)\n\t  am_cv_python_pythondir=$PYTHON_PREFIX/lib/python$PYTHON_VERSION/site-packages\n\t  ;;\n       esac\n       ;;\n     esac\n\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $am_cv_python_pythondir\" >&5\n$as_echo \"$am_cv_python_pythondir\" >&6; }\n  pythondir=$am_cv_python_pythondir\n\n\n\n  pkgpythondir=\\${pythondir}/$PACKAGE\n\n\n        { $as_echo \"$as_me:${as_lineno-$LINENO}: checking for $am_display_PYTHON extension module directory\" >&5\n$as_echo_n \"checking for $am_display_PYTHON extension module directory... \" >&6; }\nif ${am_cv_python_pyexecdir+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  if test \"x$exec_prefix\" = xNONE\n     then\n       am_py_exec_prefix=$am_py_prefix\n     else\n       am_py_exec_prefix=$exec_prefix\n     fi\n     am_cv_python_pyexecdir=`$PYTHON -c \"\n$am_python_setup_sysconfig\nif can_use_sysconfig:\n    sitedir = sysconfig.get_path('platlib', vars={'platbase':'$am_py_prefix'})\nelse:\n    from distutils import sysconfig\n    sitedir = sysconfig.get_python_lib(1, 0, prefix='$am_py_prefix')\nsys.stdout.write(sitedir)\"`\n     case $am_cv_python_pyexecdir in\n     $am_py_exec_prefix*)\n       am__strip_prefix=`echo \"$am_py_exec_prefix\" | sed 's|.|.|g'`\n       am_cv_python_pyexecdir=`echo \"$am_cv_python_pyexecdir\" | sed \"s,^$am__strip_prefix,$PYTHON_EXEC_PREFIX,\"`\n       ;;\n     *)\n       case $am_py_exec_prefix in\n         /usr|/System*) ;;\n         *)\n\t   am_cv_python_pyexecdir=$PYTHON_EXEC_PREFIX/lib/python$PYTHON_VERSION/site-packages\n\t   ;;\n       esac\n       ;;\n     esac\n\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $am_cv_python_pyexecdir\" >&5\n$as_echo \"$am_cv_python_pyexecdir\" >&6; }\n  pyexecdir=$am_cv_python_pyexecdir\n\n\n\n  pkgpyexecdir=\\${pyexecdir}/$PACKAGE\n\n\n\n  fi\n\n\n\n\t#\n\t# Allow the use of a (user set) custom python version\n\t#\n\n\n\t# Extract the first word of \"python[$PYTHON_VERSION]\", so it can be a program name with args.\nset dummy python$PYTHON_VERSION; ac_word=$2\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for $ac_word\" >&5\n$as_echo_n \"checking for $ac_word... \" >&6; }\nif ${ac_cv_path_PYTHON+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  case $PYTHON in\n  [\\\\/]* | ?:[\\\\/]*)\n  ac_cv_path_PYTHON=\"$PYTHON\" # Let the user override the test with a path.\n  ;;\n  *)\n  as_save_IFS=$IFS; IFS=$PATH_SEPARATOR\nfor as_dir in $PATH\ndo\n  IFS=$as_save_IFS\n  test -z \"$as_dir\" && as_dir=.\n    for ac_exec_ext in '' $ac_executable_extensions; do\n  if as_fn_executable_p \"$as_dir/$ac_word$ac_exec_ext\"; then\n    ac_cv_path_PYTHON=\"$as_dir/$ac_word$ac_exec_ext\"\n    $as_echo \"$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext\" >&5\n    break 2\n  fi\ndone\n  done\nIFS=$as_save_IFS\n\n  ;;\nesac\nfi\nPYTHON=$ac_cv_path_PYTHON\nif test -n \"$PYTHON\"; then\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: $PYTHON\" >&5\n$as_echo \"$PYTHON\" >&6; }\nelse\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: no\" >&5\n$as_echo \"no\" >&6; }\nfi\n\n\n\tif test -z \"$PYTHON\"; then\n\t   as_fn_error $? \"Cannot find python$PYTHON_VERSION in your system path\" \"$LINENO\" 5\n\t   PYTHON_VERSION=\"\"\n\tfi\n\n\t#\n\t# Check for a version of Python >= 2.1.0\n\t#\n\t{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for a version of Python >= '2.1.0'\" >&5\n$as_echo_n \"checking for a version of Python >= '2.1.0'... \" >&6; }\n\tac_supports_python_ver=`$PYTHON -c \"import sys, string; \\\n\t\tver = string.split(sys.version)[0]; \\\n\t\tprint ver >= '2.1.0'\"`\n\tif test \"$ac_supports_python_ver\" != \"True\"; then\n\t\tif test -z \"$PYTHON_NOVERSIONCHECK\"; then\n\t\t\t{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: no\" >&5\n$as_echo \"no\" >&6; }\n\t\t\t{ { $as_echo \"$as_me:${as_lineno-$LINENO}: error: in \\`$ac_pwd':\" >&5\n$as_echo \"$as_me: error: in \\`$ac_pwd':\" >&2;}\nas_fn_error $? \"\nThis version of the AC_PYTHON_DEVEL macro\ndoesn't work properly with versions of Python before\n2.1.0. You may need to re-run configure, setting the\nvariables PYTHON_CPPFLAGS, PYTHON_LDFLAGS, PYTHON_SITE_PKG,\nPYTHON_EXTRA_LIBS and PYTHON_EXTRA_LDFLAGS by hand.\nMoreover, to disable this check, set PYTHON_NOVERSIONCHECK\nto something else than an empty string.\n\nSee \\`config.log' for more details\" \"$LINENO\" 5; }\n\t\telse\n\t\t\t{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: skip at user request\" >&5\n$as_echo \"skip at user request\" >&6; }\n\t\tfi\n\telse\n\t\t{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: yes\" >&5\n$as_echo \"yes\" >&6; }\n\tfi\n\n\t#\n\t# if the macro parameter ``version'' is set, honour it\n\t#\n\tif test -n \">= '2.7'\"; then\n\t\t{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for a version of Python >= '2.7'\" >&5\n$as_echo_n \"checking for a version of Python >= '2.7'... \" >&6; }\n\t\tac_supports_python_ver=`$PYTHON -c \"import sys, string; \\\n\t\t\tver = string.split(sys.version)[0]; \\\n\t\t\tprint ver >= '2.7'\"`\n\t\tif test \"$ac_supports_python_ver\" = \"True\"; then\n\t   \t   { $as_echo \"$as_me:${as_lineno-$LINENO}: result: yes\" >&5\n$as_echo \"yes\" >&6; }\n\t\telse\n\t\t\t{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: no\" >&5\n$as_echo \"no\" >&6; }\n\t\t\tas_fn_error $? \"this package requires Python >= '2.7'.\nIf you have it installed, but it isn't the default Python\ninterpreter in your system path, please pass the PYTHON_VERSION\nvariable to configure. See \\`\\`configure --help'' for reference.\n\" \"$LINENO\" 5\n\t\t\tPYTHON_VERSION=\"\"\n\t\tfi\n\tfi\n\n\t#\n\t# Check if you have distutils, else fail\n\t#\n\t{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for the distutils Python package\" >&5\n$as_echo_n \"checking for the distutils Python package... \" >&6; }\n\tac_distutils_result=`$PYTHON -c \"import distutils\" 2>&1`\n\tif test -z \"$ac_distutils_result\"; then\n\t\t{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: yes\" >&5\n$as_echo \"yes\" >&6; }\n\telse\n\t\t{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: no\" >&5\n$as_echo \"no\" >&6; }\n\t\tas_fn_error $? \"cannot import Python module \\\"distutils\\\".\nPlease check your Python installation. The error was:\n$ac_distutils_result\" \"$LINENO\" 5\n\t\tPYTHON_VERSION=\"\"\n\tfi\n\n\t#\n\t# Check for Python include path\n\t#\n\t{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for Python include path\" >&5\n$as_echo_n \"checking for Python include path... \" >&6; }\n\tif test -z \"$PYTHON_CPPFLAGS\"; then\n\t\tpython_path=`$PYTHON -c \"import distutils.sysconfig; \\\n           \t\tprint distutils.sysconfig.get_python_inc();\"`\n\t\tif test -n \"${python_path}\"; then\n\t\t   \tpython_path=\"-I$python_path\"\n\t\tfi\n\t\tPYTHON_CPPFLAGS=$python_path\n\tfi\n\t{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $PYTHON_CPPFLAGS\" >&5\n$as_echo \"$PYTHON_CPPFLAGS\" >&6; }\n\n\n\t#\n\t# Check for Python library path\n\t#\n\t{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for Python library path\" >&5\n$as_echo_n \"checking for Python library path... \" >&6; }\n\tif test -z \"$PYTHON_LDFLAGS\"; then\n\t\t# (makes two attempts to ensure we've got a version number\n\t\t# from the interpreter)\n\t\tpy_version=`$PYTHON -c \"from distutils.sysconfig import *; \\\n\t\t\tfrom string import join; \\\n\t\t\tprint join(get_config_vars('VERSION'))\"`\n\t\tif test \"$py_version\" == \"None\"; then\n\t\t\tif test -n \"$PYTHON_VERSION\"; then\n\t\t\t\tpy_version=$PYTHON_VERSION\n\t\t\telse\n\t\t\t\tpy_version=`$PYTHON -c \"import sys; \\\n\t\t\t\t\tprint sys.version[:3]\"`\n\t\t\tfi\n\t\tfi\n\n\t\tPYTHON_LDFLAGS=`$PYTHON -c \"from distutils.sysconfig import *; \\\n\t\t\tfrom string import join; \\\n\t\t\tprint '-L' + get_python_lib(0,1), \\\n\t\t      \t'-lpython';\"`$py_version\n\tfi\n\t{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $PYTHON_LDFLAGS\" >&5\n$as_echo \"$PYTHON_LDFLAGS\" >&6; }\n\n\n\t#\n\t# Check for site packages\n\t#\n\t{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for Python site-packages path\" >&5\n$as_echo_n \"checking for Python site-packages path... \" >&6; }\n\tif test -z \"$PYTHON_SITE_PKG\"; then\n\t\tPYTHON_SITE_PKG=`$PYTHON -c \"import distutils.sysconfig; \\\n\t\t        print distutils.sysconfig.get_python_lib(0,0);\"`\n\tfi\n\t{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $PYTHON_SITE_PKG\" >&5\n$as_echo \"$PYTHON_SITE_PKG\" >&6; }\n\n\n\t#\n\t# libraries which must be linked in when embedding\n\t#\n\t{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking python extra libraries\" >&5\n$as_echo_n \"checking python extra libraries... \" >&6; }\n\tif test -z \"$PYTHON_EXTRA_LIBS\"; then\n\t   PYTHON_EXTRA_LIBS=`$PYTHON -c \"import distutils.sysconfig; \\\n                conf = distutils.sysconfig.get_config_var; \\\n                print conf('LOCALMODLIBS'), conf('LIBS')\"`\n\tfi\n\t{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $PYTHON_EXTRA_LIBS\" >&5\n$as_echo \"$PYTHON_EXTRA_LIBS\" >&6; }\n\n\n\t#\n\t# linking flags needed when embedding\n\t#\n\t{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking python extra linking flags\" >&5\n$as_echo_n \"checking python extra linking flags... \" >&6; }\n\tif test -z \"$PYTHON_EXTRA_LDFLAGS\"; then\n\t\tPYTHON_EXTRA_LDFLAGS=`$PYTHON -c \"import distutils.sysconfig; \\\n\t\t\tconf = distutils.sysconfig.get_config_var; \\\n\t\t\tprint conf('LINKFORSHARED')\"`\n\tfi\n\t{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $PYTHON_EXTRA_LDFLAGS\" >&5\n$as_echo \"$PYTHON_EXTRA_LDFLAGS\" >&6; }\n\n\n\t#\n\t# final check to see if everything compiles alright\n\t#\n\t{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking consistency of all components of python development environment\" >&5\n$as_echo_n \"checking consistency of all components of python development environment... \" >&6; }\n\tac_ext=c\nac_cpp='$CPP $CPPFLAGS'\nac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5'\nac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5'\nac_compiler_gnu=$ac_cv_c_compiler_gnu\n\n\t# save current global flags\n\tLIBS=\"$ac_save_LIBS $PYTHON_LDFLAGS\"\n\tCPPFLAGS=\"$ac_save_CPPFLAGS $PYTHON_CPPFLAGS\"\n\tcat confdefs.h - <<_ACEOF >conftest.$ac_ext\n/* end confdefs.h.  */\n\n\t\t#include <Python.h>\n\nint\nmain ()\n{\n\n\t\tPy_Initialize();\n\n  ;\n  return 0;\n}\n_ACEOF\nif ac_fn_c_try_link \"$LINENO\"; then :\n  pythonexists=yes\nelse\n  pythonexists=no\nfi\nrm -f core conftest.err conftest.$ac_objext \\\n    conftest$ac_exeext conftest.$ac_ext\n\n\t{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $pythonexists\" >&5\n$as_echo \"$pythonexists\" >&6; }\n\n        if test ! \"$pythonexists\" = \"yes\"; then\n\t   as_fn_error $? \"\n  Could not link test program to Python. Maybe the main Python library has been\n  installed in some non-standard library path. If so, pass it to configure,\n  via the LDFLAGS environment variable.\n  Example: ./configure LDFLAGS=\\\"-L/usr/non-standard-path/python/lib\\\"\n  ============================================================================\n   ERROR!\n   You probably have to install the development version of the Python package\n   for your distribution.  The exact name of this package varies among them.\n  ============================================================================\n\t   \" \"$LINENO\" 5\n\t  PYTHON_VERSION=\"\"\n\tfi\n\tac_ext=cpp\nac_cpp='$CXXCPP $CPPFLAGS'\nac_compile='$CXX -c $CXXFLAGS $CPPFLAGS conftest.$ac_ext >&5'\nac_link='$CXX -o conftest$ac_exeext $CXXFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5'\nac_compiler_gnu=$ac_cv_cxx_compiler_gnu\n\n\t# turn back to default flags\n\tCPPFLAGS=\"$ac_save_CPPFLAGS\"\n\tLIBS=\"$ac_save_LIBS\"\n\n\t#\n\t# all done!\n\t#\n\nfi\n\n# Check whether --enable-special was given.\nif test \"${enable_special+set}\" = set; then :\n  enableval=$enable_special;\nelse\n  enable_special=no\nfi\n\n if test \"x$enable_special\" != xno; then\n  HAVE_SPECIAL_TRUE=\n  HAVE_SPECIAL_FALSE='#'\nelse\n  HAVE_SPECIAL_TRUE='#'\n  HAVE_SPECIAL_FALSE=\nfi\n\n\n# --enable-bin enables script and bin \"extensions\".\n# Check whether --enable-bin was given.\nif test \"${enable_bin+set}\" = set; then :\n  enableval=$enable_bin;\nelse\n  enable_bin=yes\nfi\n\n if test \"x$enable_bin\" != xno; then\n  HAVE_BIN_TRUE=\n  HAVE_BIN_FALSE='#'\nelse\n  HAVE_BIN_TRUE='#'\n  HAVE_BIN_FALSE=\nfi\n\n if test \"x$enable_bin\" != xno; then\n  HAVE_SCRIPT_TRUE=\n  HAVE_SCRIPT_FALSE='#'\nelse\n  HAVE_SCRIPT_TRUE='#'\n  HAVE_SCRIPT_FALSE=\nfi\n\n\n# --enable-grm enables dependencies of OpenGrm: far, mpdt, and pdt.\n# Check whether --enable-grm was given.\nif test \"${enable_grm+set}\" = set; then :\n  enableval=$enable_grm;\nelse\n  enable_grm=no\nfi\n\n if test \"x$enable_grm\" != xno; then\n  HAVE_GRM_TRUE=\n  HAVE_GRM_FALSE='#'\nelse\n  HAVE_GRM_TRUE='#'\n  HAVE_GRM_FALSE=\nfi\n\n\n\n# Check whether --with-libfstdir was given.\nif test \"${with_libfstdir+set}\" = set; then :\n  withval=$with_libfstdir;\nelse\n  with_libfstdir=${libdir}/fst\nfi\n\n\nlibfstdir=$with_libfstdir\n\n\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for dlopen in -ldl\" >&5\n$as_echo_n \"checking for dlopen in -ldl... \" >&6; }\nif ${ac_cv_lib_dl_dlopen+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  ac_check_lib_save_LIBS=$LIBS\nLIBS=\"-ldl  $LIBS\"\ncat confdefs.h - <<_ACEOF >conftest.$ac_ext\n/* end confdefs.h.  */\n\n/* Override any GCC internal prototype to avoid an error.\n   Use char because int might match the return type of a GCC\n   builtin and then its argument prototype would still apply.  */\n#ifdef __cplusplus\nextern \"C\"\n#endif\nchar dlopen ();\nint\nmain ()\n{\nreturn dlopen ();\n  ;\n  return 0;\n}\n_ACEOF\nif ac_fn_cxx_try_link \"$LINENO\"; then :\n  ac_cv_lib_dl_dlopen=yes\nelse\n  ac_cv_lib_dl_dlopen=no\nfi\nrm -f core conftest.err conftest.$ac_objext \\\n    conftest$ac_exeext conftest.$ac_ext\nLIBS=$ac_check_lib_save_LIBS\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_dl_dlopen\" >&5\n$as_echo \"$ac_cv_lib_dl_dlopen\" >&6; }\nif test \"x$ac_cv_lib_dl_dlopen\" = xyes; then :\n  DL_LIBS=-ldl\nfi\n\n\n\ncat >confcache <<\\_ACEOF\n# This file is a shell script that caches the results of configure\n# tests run on this system so they can be shared between configure\n# scripts and configure runs, see configure's option --config-cache.\n# It is not useful on other systems.  If it contains results you don't\n# want to keep, you may remove or edit it.\n#\n# config.status only pays attention to the cache file if you give it\n# the --recheck option to rerun configure.\n#\n# `ac_cv_env_foo' variables (set or unset) will be overridden when\n# loading this file, other *unset* `ac_cv_foo' will be assigned the\n# following values.\n\n_ACEOF\n\n# The following way of writing the cache mishandles newlines in values,\n# but we know of no workaround that is simple, portable, and efficient.\n# So, we kill variables containing newlines.\n# Ultrix sh set writes to stderr and can't be redirected directly,\n# and sets the high bit in the cache file unless we assign to the vars.\n(\n  for ac_var in `(set) 2>&1 | sed -n 's/^\\([a-zA-Z_][a-zA-Z0-9_]*\\)=.*/\\1/p'`; do\n    eval ac_val=\\$$ac_var\n    case $ac_val in #(\n    *${as_nl}*)\n      case $ac_var in #(\n      *_cv_*) { $as_echo \"$as_me:${as_lineno-$LINENO}: WARNING: cache variable $ac_var contains a newline\" >&5\n$as_echo \"$as_me: WARNING: cache variable $ac_var contains a newline\" >&2;} ;;\n      esac\n      case $ac_var in #(\n      _ | IFS | as_nl) ;; #(\n      BASH_ARGV | BASH_SOURCE) eval $ac_var= ;; #(\n      *) { eval $ac_var=; unset $ac_var;} ;;\n      esac ;;\n    esac\n  done\n\n  (set) 2>&1 |\n    case $as_nl`(ac_space=' '; set) 2>&1` in #(\n    *${as_nl}ac_space=\\ *)\n      # `set' does not quote correctly, so add quotes: double-quote\n      # substitution turns \\\\\\\\ into \\\\, and sed turns \\\\ into \\.\n      sed -n \\\n\t\"s/'/'\\\\\\\\''/g;\n\t  s/^\\\\([_$as_cr_alnum]*_cv_[_$as_cr_alnum]*\\\\)=\\\\(.*\\\\)/\\\\1='\\\\2'/p\"\n      ;; #(\n    *)\n      # `set' quotes correctly as required by POSIX, so do not add quotes.\n      sed -n \"/^[_$as_cr_alnum]*_cv_[_$as_cr_alnum]*=/p\"\n      ;;\n    esac |\n    sort\n) |\n  sed '\n     /^ac_cv_env_/b end\n     t clear\n     :clear\n     s/^\\([^=]*\\)=\\(.*[{}].*\\)$/test \"${\\1+set}\" = set || &/\n     t end\n     s/^\\([^=]*\\)=\\(.*\\)$/\\1=${\\1=\\2}/\n     :end' >>confcache\nif diff \"$cache_file\" confcache >/dev/null 2>&1; then :; else\n  if test -w \"$cache_file\"; then\n    if test \"x$cache_file\" != \"x/dev/null\"; then\n      { $as_echo \"$as_me:${as_lineno-$LINENO}: updating cache $cache_file\" >&5\n$as_echo \"$as_me: updating cache $cache_file\" >&6;}\n      if test ! -f \"$cache_file\" || test -h \"$cache_file\"; then\n\tcat confcache >\"$cache_file\"\n      else\n        case $cache_file in #(\n        */* | ?:*)\n\t  mv -f confcache \"$cache_file\"$$ &&\n\t  mv -f \"$cache_file\"$$ \"$cache_file\" ;; #(\n        *)\n\t  mv -f confcache \"$cache_file\" ;;\n\tesac\n      fi\n    fi\n  else\n    { $as_echo \"$as_me:${as_lineno-$LINENO}: not updating unwritable cache $cache_file\" >&5\n$as_echo \"$as_me: not updating unwritable cache $cache_file\" >&6;}\n  fi\nfi\nrm -f confcache\n\ntest \"x$prefix\" = xNONE && prefix=$ac_default_prefix\n# Let make expand exec_prefix.\ntest \"x$exec_prefix\" = xNONE && exec_prefix='${prefix}'\n\nDEFS=-DHAVE_CONFIG_H\n\nac_libobjs=\nac_ltlibobjs=\nU=\nfor ac_i in : $LIBOBJS; do test \"x$ac_i\" = x: && continue\n  # 1. Remove the extension, and $U if already installed.\n  ac_script='s/\\$U\\././;s/\\.o$//;s/\\.obj$//'\n  ac_i=`$as_echo \"$ac_i\" | sed \"$ac_script\"`\n  # 2. Prepend LIBOBJDIR.  When used with automake>=1.10 LIBOBJDIR\n  #    will be set to the directory where LIBOBJS objects are built.\n  as_fn_append ac_libobjs \" \\${LIBOBJDIR}$ac_i\\$U.$ac_objext\"\n  as_fn_append ac_ltlibobjs \" \\${LIBOBJDIR}$ac_i\"'$U.lo'\ndone\nLIBOBJS=$ac_libobjs\n\nLTLIBOBJS=$ac_ltlibobjs\n\n\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking that generated files are newer than configure\" >&5\n$as_echo_n \"checking that generated files are newer than configure... \" >&6; }\n   if test -n \"$am_sleep_pid\"; then\n     # Hide warnings about reused PIDs.\n     wait $am_sleep_pid 2>/dev/null\n   fi\n   { $as_echo \"$as_me:${as_lineno-$LINENO}: result: done\" >&5\n$as_echo \"done\" >&6; }\n if test -n \"$EXEEXT\"; then\n  am__EXEEXT_TRUE=\n  am__EXEEXT_FALSE='#'\nelse\n  am__EXEEXT_TRUE='#'\n  am__EXEEXT_FALSE=\nfi\n\nif test -z \"${AMDEP_TRUE}\" && test -z \"${AMDEP_FALSE}\"; then\n  as_fn_error $? \"conditional \\\"AMDEP\\\" was never defined.\nUsually this means the macro was only invoked conditionally.\" \"$LINENO\" 5\nfi\nif test -z \"${am__fastdepCC_TRUE}\" && test -z \"${am__fastdepCC_FALSE}\"; then\n  as_fn_error $? \"conditional \\\"am__fastdepCC\\\" was never defined.\nUsually this means the macro was only invoked conditionally.\" \"$LINENO\" 5\nfi\nif test -z \"${am__fastdepCXX_TRUE}\" && test -z \"${am__fastdepCXX_FALSE}\"; then\n  as_fn_error $? \"conditional \\\"am__fastdepCXX\\\" was never defined.\nUsually this means the macro was only invoked conditionally.\" \"$LINENO\" 5\nfi\nif test -z \"${HAVE_COMPACT_TRUE}\" && test -z \"${HAVE_COMPACT_FALSE}\"; then\n  as_fn_error $? \"conditional \\\"HAVE_COMPACT\\\" was never defined.\nUsually this means the macro was only invoked conditionally.\" \"$LINENO\" 5\nfi\nif test -z \"${HAVE_COMPRESS_TRUE}\" && test -z \"${HAVE_COMPRESS_FALSE}\"; then\n  as_fn_error $? \"conditional \\\"HAVE_COMPRESS\\\" was never defined.\nUsually this means the macro was only invoked conditionally.\" \"$LINENO\" 5\nfi\nif test -z \"${HAVE_CONST_TRUE}\" && test -z \"${HAVE_CONST_FALSE}\"; then\n  as_fn_error $? \"conditional \\\"HAVE_CONST\\\" was never defined.\nUsually this means the macro was only invoked conditionally.\" \"$LINENO\" 5\nfi\nif test -z \"${HAVE_FAR_TRUE}\" && test -z \"${HAVE_FAR_FALSE}\"; then\n  as_fn_error $? \"conditional \\\"HAVE_FAR\\\" was never defined.\nUsually this means the macro was only invoked conditionally.\" \"$LINENO\" 5\nfi\nif test -z \"${HAVE_LINEAR_TRUE}\" && test -z \"${HAVE_LINEAR_FALSE}\"; then\n  as_fn_error $? \"conditional \\\"HAVE_LINEAR\\\" was never defined.\nUsually this means the macro was only invoked conditionally.\" \"$LINENO\" 5\nfi\nif test -z \"${HAVE_LOOKAHEAD_TRUE}\" && test -z \"${HAVE_LOOKAHEAD_FALSE}\"; then\n  as_fn_error $? \"conditional \\\"HAVE_LOOKAHEAD\\\" was never defined.\nUsually this means the macro was only invoked conditionally.\" \"$LINENO\" 5\nfi\nif test -z \"${HAVE_MPDT_TRUE}\" && test -z \"${HAVE_MPDT_FALSE}\"; then\n  as_fn_error $? \"conditional \\\"HAVE_MPDT\\\" was never defined.\nUsually this means the macro was only invoked conditionally.\" \"$LINENO\" 5\nfi\nif test -z \"${HAVE_NGRAM_TRUE}\" && test -z \"${HAVE_NGRAM_FALSE}\"; then\n  as_fn_error $? \"conditional \\\"HAVE_NGRAM\\\" was never defined.\nUsually this means the macro was only invoked conditionally.\" \"$LINENO\" 5\nfi\nif test -z \"${HAVE_PDT_TRUE}\" && test -z \"${HAVE_PDT_FALSE}\"; then\n  as_fn_error $? \"conditional \\\"HAVE_PDT\\\" was never defined.\nUsually this means the macro was only invoked conditionally.\" \"$LINENO\" 5\nfi\nif test -z \"${HAVE_PYTHON_TRUE}\" && test -z \"${HAVE_PYTHON_FALSE}\"; then\n  as_fn_error $? \"conditional \\\"HAVE_PYTHON\\\" was never defined.\nUsually this means the macro was only invoked conditionally.\" \"$LINENO\" 5\nfi\nif test -z \"${HAVE_SPECIAL_TRUE}\" && test -z \"${HAVE_SPECIAL_FALSE}\"; then\n  as_fn_error $? \"conditional \\\"HAVE_SPECIAL\\\" was never defined.\nUsually this means the macro was only invoked conditionally.\" \"$LINENO\" 5\nfi\nif test -z \"${HAVE_BIN_TRUE}\" && test -z \"${HAVE_BIN_FALSE}\"; then\n  as_fn_error $? \"conditional \\\"HAVE_BIN\\\" was never defined.\nUsually this means the macro was only invoked conditionally.\" \"$LINENO\" 5\nfi\nif test -z \"${HAVE_SCRIPT_TRUE}\" && test -z \"${HAVE_SCRIPT_FALSE}\"; then\n  as_fn_error $? \"conditional \\\"HAVE_SCRIPT\\\" was never defined.\nUsually this means the macro was only invoked conditionally.\" \"$LINENO\" 5\nfi\nif test -z \"${HAVE_GRM_TRUE}\" && test -z \"${HAVE_GRM_FALSE}\"; then\n  as_fn_error $? \"conditional \\\"HAVE_GRM\\\" was never defined.\nUsually this means the macro was only invoked conditionally.\" \"$LINENO\" 5\nfi\n\n: \"${CONFIG_STATUS=./config.status}\"\nac_write_fail=0\nac_clean_files_save=$ac_clean_files\nac_clean_files=\"$ac_clean_files $CONFIG_STATUS\"\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: creating $CONFIG_STATUS\" >&5\n$as_echo \"$as_me: creating $CONFIG_STATUS\" >&6;}\nas_write_fail=0\ncat >$CONFIG_STATUS <<_ASEOF || as_write_fail=1\n#! $SHELL\n# Generated by $as_me.\n# Run this file to recreate the current configuration.\n# Compiler output produced by configure, useful for debugging\n# configure, is in config.log if it exists.\n\ndebug=false\nac_cs_recheck=false\nac_cs_silent=false\n\nSHELL=\\${CONFIG_SHELL-$SHELL}\nexport SHELL\n_ASEOF\ncat >>$CONFIG_STATUS <<\\_ASEOF || as_write_fail=1\n## -------------------- ##\n## M4sh Initialization. ##\n## -------------------- ##\n\n# Be more Bourne compatible\nDUALCASE=1; export DUALCASE # for MKS sh\nif test -n \"${ZSH_VERSION+set}\" && (emulate sh) >/dev/null 2>&1; then :\n  emulate sh\n  NULLCMD=:\n  # Pre-4.2 versions of Zsh do word splitting on ${1+\"$@\"}, which\n  # is contrary to our usage.  Disable this feature.\n  alias -g '${1+\"$@\"}'='\"$@\"'\n  setopt NO_GLOB_SUBST\nelse\n  case `(set -o) 2>/dev/null` in #(\n  *posix*) :\n    set -o posix ;; #(\n  *) :\n     ;;\nesac\nfi\n\n\nas_nl='\n'\nexport as_nl\n# Printing a long string crashes Solaris 7 /usr/bin/printf.\nas_echo='\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\'\nas_echo=$as_echo$as_echo$as_echo$as_echo$as_echo\nas_echo=$as_echo$as_echo$as_echo$as_echo$as_echo$as_echo\n# Prefer a ksh shell builtin over an external printf program on Solaris,\n# but without wasting forks for bash or zsh.\nif test -z \"$BASH_VERSION$ZSH_VERSION\" \\\n    && (test \"X`print -r -- $as_echo`\" = \"X$as_echo\") 2>/dev/null; then\n  as_echo='print -r --'\n  as_echo_n='print -rn --'\nelif (test \"X`printf %s $as_echo`\" = \"X$as_echo\") 2>/dev/null; then\n  as_echo='printf %s\\n'\n  as_echo_n='printf %s'\nelse\n  if test \"X`(/usr/ucb/echo -n -n $as_echo) 2>/dev/null`\" = \"X-n $as_echo\"; then\n    as_echo_body='eval /usr/ucb/echo -n \"$1$as_nl\"'\n    as_echo_n='/usr/ucb/echo -n'\n  else\n    as_echo_body='eval expr \"X$1\" : \"X\\\\(.*\\\\)\"'\n    as_echo_n_body='eval\n      arg=$1;\n      case $arg in #(\n      *\"$as_nl\"*)\n\texpr \"X$arg\" : \"X\\\\(.*\\\\)$as_nl\";\n\targ=`expr \"X$arg\" : \".*$as_nl\\\\(.*\\\\)\"`;;\n      esac;\n      expr \"X$arg\" : \"X\\\\(.*\\\\)\" | tr -d \"$as_nl\"\n    '\n    export as_echo_n_body\n    as_echo_n='sh -c $as_echo_n_body as_echo'\n  fi\n  export as_echo_body\n  as_echo='sh -c $as_echo_body as_echo'\nfi\n\n# The user is always right.\nif test \"${PATH_SEPARATOR+set}\" != set; then\n  PATH_SEPARATOR=:\n  (PATH='/bin;/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 && {\n    (PATH='/bin:/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 ||\n      PATH_SEPARATOR=';'\n  }\nfi\n\n\n# IFS\n# We need space, tab and new line, in precisely that order.  Quoting is\n# there to prevent editors from complaining about space-tab.\n# (If _AS_PATH_WALK were called with IFS unset, it would disable word\n# splitting by setting IFS to empty value.)\nIFS=\" \"\"\t$as_nl\"\n\n# Find who we are.  Look in the path if we contain no directory separator.\nas_myself=\ncase $0 in #((\n  *[\\\\/]* ) as_myself=$0 ;;\n  *) as_save_IFS=$IFS; IFS=$PATH_SEPARATOR\nfor as_dir in $PATH\ndo\n  IFS=$as_save_IFS\n  test -z \"$as_dir\" && as_dir=.\n    test -r \"$as_dir/$0\" && as_myself=$as_dir/$0 && break\n  done\nIFS=$as_save_IFS\n\n     ;;\nesac\n# We did not find ourselves, most probably we were run as `sh COMMAND'\n# in which case we are not to be found in the path.\nif test \"x$as_myself\" = x; then\n  as_myself=$0\nfi\nif test ! -f \"$as_myself\"; then\n  $as_echo \"$as_myself: error: cannot find myself; rerun with an absolute file name\" >&2\n  exit 1\nfi\n\n# Unset variables that we do not need and which cause bugs (e.g. in\n# pre-3.0 UWIN ksh).  But do not cause bugs in bash 2.01; the \"|| exit 1\"\n# suppresses any \"Segmentation fault\" message there.  '((' could\n# trigger a bug in pdksh 5.2.14.\nfor as_var in BASH_ENV ENV MAIL MAILPATH\ndo eval test x\\${$as_var+set} = xset \\\n  && ( (unset $as_var) || exit 1) >/dev/null 2>&1 && unset $as_var || :\ndone\nPS1='$ '\nPS2='> '\nPS4='+ '\n\n# NLS nuisances.\nLC_ALL=C\nexport LC_ALL\nLANGUAGE=C\nexport LANGUAGE\n\n# CDPATH.\n(unset CDPATH) >/dev/null 2>&1 && unset CDPATH\n\n\n# as_fn_error STATUS ERROR [LINENO LOG_FD]\n# ----------------------------------------\n# Output \"`basename $0`: error: ERROR\" to stderr. If LINENO and LOG_FD are\n# provided, also output the error to LOG_FD, referencing LINENO. Then exit the\n# script with STATUS, using 1 if that was 0.\nas_fn_error ()\n{\n  as_status=$1; test $as_status -eq 0 && as_status=1\n  if test \"$4\"; then\n    as_lineno=${as_lineno-\"$3\"} as_lineno_stack=as_lineno_stack=$as_lineno_stack\n    $as_echo \"$as_me:${as_lineno-$LINENO}: error: $2\" >&$4\n  fi\n  $as_echo \"$as_me: error: $2\" >&2\n  as_fn_exit $as_status\n} # as_fn_error\n\n\n# as_fn_set_status STATUS\n# -----------------------\n# Set $? to STATUS, without forking.\nas_fn_set_status ()\n{\n  return $1\n} # as_fn_set_status\n\n# as_fn_exit STATUS\n# -----------------\n# Exit the shell with STATUS, even in a \"trap 0\" or \"set -e\" context.\nas_fn_exit ()\n{\n  set +e\n  as_fn_set_status $1\n  exit $1\n} # as_fn_exit\n\n# as_fn_unset VAR\n# ---------------\n# Portably unset VAR.\nas_fn_unset ()\n{\n  { eval $1=; unset $1;}\n}\nas_unset=as_fn_unset\n# as_fn_append VAR VALUE\n# ----------------------\n# Append the text in VALUE to the end of the definition contained in VAR. Take\n# advantage of any shell optimizations that allow amortized linear growth over\n# repeated appends, instead of the typical quadratic growth present in naive\n# implementations.\nif (eval \"as_var=1; as_var+=2; test x\\$as_var = x12\") 2>/dev/null; then :\n  eval 'as_fn_append ()\n  {\n    eval $1+=\\$2\n  }'\nelse\n  as_fn_append ()\n  {\n    eval $1=\\$$1\\$2\n  }\nfi # as_fn_append\n\n# as_fn_arith ARG...\n# ------------------\n# Perform arithmetic evaluation on the ARGs, and store the result in the\n# global $as_val. Take advantage of shells that can avoid forks. The arguments\n# must be portable across $(()) and expr.\nif (eval \"test \\$(( 1 + 1 )) = 2\") 2>/dev/null; then :\n  eval 'as_fn_arith ()\n  {\n    as_val=$(( $* ))\n  }'\nelse\n  as_fn_arith ()\n  {\n    as_val=`expr \"$@\" || test $? -eq 1`\n  }\nfi # as_fn_arith\n\n\nif expr a : '\\(a\\)' >/dev/null 2>&1 &&\n   test \"X`expr 00001 : '.*\\(...\\)'`\" = X001; then\n  as_expr=expr\nelse\n  as_expr=false\nfi\n\nif (basename -- /) >/dev/null 2>&1 && test \"X`basename -- / 2>&1`\" = \"X/\"; then\n  as_basename=basename\nelse\n  as_basename=false\nfi\n\nif (as_dir=`dirname -- /` && test \"X$as_dir\" = X/) >/dev/null 2>&1; then\n  as_dirname=dirname\nelse\n  as_dirname=false\nfi\n\nas_me=`$as_basename -- \"$0\" ||\n$as_expr X/\"$0\" : '.*/\\([^/][^/]*\\)/*$' \\| \\\n\t X\"$0\" : 'X\\(//\\)$' \\| \\\n\t X\"$0\" : 'X\\(/\\)' \\| . 2>/dev/null ||\n$as_echo X/\"$0\" |\n    sed '/^.*\\/\\([^/][^/]*\\)\\/*$/{\n\t    s//\\1/\n\t    q\n\t  }\n\t  /^X\\/\\(\\/\\/\\)$/{\n\t    s//\\1/\n\t    q\n\t  }\n\t  /^X\\/\\(\\/\\).*/{\n\t    s//\\1/\n\t    q\n\t  }\n\t  s/.*/./; q'`\n\n# Avoid depending upon Character Ranges.\nas_cr_letters='abcdefghijklmnopqrstuvwxyz'\nas_cr_LETTERS='ABCDEFGHIJKLMNOPQRSTUVWXYZ'\nas_cr_Letters=$as_cr_letters$as_cr_LETTERS\nas_cr_digits='0123456789'\nas_cr_alnum=$as_cr_Letters$as_cr_digits\n\nECHO_C= ECHO_N= ECHO_T=\ncase `echo -n x` in #(((((\n-n*)\n  case `echo 'xy\\c'` in\n  *c*) ECHO_T='\t';;\t# ECHO_T is single tab character.\n  xy)  ECHO_C='\\c';;\n  *)   echo `echo ksh88 bug on AIX 6.1` > /dev/null\n       ECHO_T='\t';;\n  esac;;\n*)\n  ECHO_N='-n';;\nesac\n\nrm -f conf$$ conf$$.exe conf$$.file\nif test -d conf$$.dir; then\n  rm -f conf$$.dir/conf$$.file\nelse\n  rm -f conf$$.dir\n  mkdir conf$$.dir 2>/dev/null\nfi\nif (echo >conf$$.file) 2>/dev/null; then\n  if ln -s conf$$.file conf$$ 2>/dev/null; then\n    as_ln_s='ln -s'\n    # ... but there are two gotchas:\n    # 1) On MSYS, both `ln -s file dir' and `ln file dir' fail.\n    # 2) DJGPP < 2.04 has no symlinks; `ln -s' creates a wrapper executable.\n    # In both cases, we have to default to `cp -pR'.\n    ln -s conf$$.file conf$$.dir 2>/dev/null && test ! -f conf$$.exe ||\n      as_ln_s='cp -pR'\n  elif ln conf$$.file conf$$ 2>/dev/null; then\n    as_ln_s=ln\n  else\n    as_ln_s='cp -pR'\n  fi\nelse\n  as_ln_s='cp -pR'\nfi\nrm -f conf$$ conf$$.exe conf$$.dir/conf$$.file conf$$.file\nrmdir conf$$.dir 2>/dev/null\n\n\n# as_fn_mkdir_p\n# -------------\n# Create \"$as_dir\" as a directory, including parents if necessary.\nas_fn_mkdir_p ()\n{\n\n  case $as_dir in #(\n  -*) as_dir=./$as_dir;;\n  esac\n  test -d \"$as_dir\" || eval $as_mkdir_p || {\n    as_dirs=\n    while :; do\n      case $as_dir in #(\n      *\\'*) as_qdir=`$as_echo \"$as_dir\" | sed \"s/'/'\\\\\\\\\\\\\\\\''/g\"`;; #'(\n      *) as_qdir=$as_dir;;\n      esac\n      as_dirs=\"'$as_qdir' $as_dirs\"\n      as_dir=`$as_dirname -- \"$as_dir\" ||\n$as_expr X\"$as_dir\" : 'X\\(.*[^/]\\)//*[^/][^/]*/*$' \\| \\\n\t X\"$as_dir\" : 'X\\(//\\)[^/]' \\| \\\n\t X\"$as_dir\" : 'X\\(//\\)$' \\| \\\n\t X\"$as_dir\" : 'X\\(/\\)' \\| . 2>/dev/null ||\n$as_echo X\"$as_dir\" |\n    sed '/^X\\(.*[^/]\\)\\/\\/*[^/][^/]*\\/*$/{\n\t    s//\\1/\n\t    q\n\t  }\n\t  /^X\\(\\/\\/\\)[^/].*/{\n\t    s//\\1/\n\t    q\n\t  }\n\t  /^X\\(\\/\\/\\)$/{\n\t    s//\\1/\n\t    q\n\t  }\n\t  /^X\\(\\/\\).*/{\n\t    s//\\1/\n\t    q\n\t  }\n\t  s/.*/./; q'`\n      test -d \"$as_dir\" && break\n    done\n    test -z \"$as_dirs\" || eval \"mkdir $as_dirs\"\n  } || test -d \"$as_dir\" || as_fn_error $? \"cannot create directory $as_dir\"\n\n\n} # as_fn_mkdir_p\nif mkdir -p . 2>/dev/null; then\n  as_mkdir_p='mkdir -p \"$as_dir\"'\nelse\n  test -d ./-p && rmdir ./-p\n  as_mkdir_p=false\nfi\n\n\n# as_fn_executable_p FILE\n# -----------------------\n# Test if FILE is an executable regular file.\nas_fn_executable_p ()\n{\n  test -f \"$1\" && test -x \"$1\"\n} # as_fn_executable_p\nas_test_x='test -x'\nas_executable_p=as_fn_executable_p\n\n# Sed expression to map a string onto a valid CPP name.\nas_tr_cpp=\"eval sed 'y%*$as_cr_letters%P$as_cr_LETTERS%;s%[^_$as_cr_alnum]%_%g'\"\n\n# Sed expression to map a string onto a valid variable name.\nas_tr_sh=\"eval sed 'y%*+%pp%;s%[^_$as_cr_alnum]%_%g'\"\n\n\nexec 6>&1\n## ----------------------------------- ##\n## Main body of $CONFIG_STATUS script. ##\n## ----------------------------------- ##\n_ASEOF\ntest $as_write_fail = 0 && chmod +x $CONFIG_STATUS || ac_write_fail=1\n\ncat >>$CONFIG_STATUS <<\\_ACEOF || ac_write_fail=1\n# Save the log message, to keep $0 and so on meaningful, and to\n# report actual input values of CONFIG_FILES etc. instead of their\n# values after options handling.\nac_log=\"\nThis file was extended by OpenFst $as_me 1.6.7, which was\ngenerated by GNU Autoconf 2.69.  Invocation command line was\n\n  CONFIG_FILES    = $CONFIG_FILES\n  CONFIG_HEADERS  = $CONFIG_HEADERS\n  CONFIG_LINKS    = $CONFIG_LINKS\n  CONFIG_COMMANDS = $CONFIG_COMMANDS\n  $ $0 $@\n\non `(hostname || uname -n) 2>/dev/null | sed 1q`\n\"\n\n_ACEOF\n\ncase $ac_config_files in *\"\n\"*) set x $ac_config_files; shift; ac_config_files=$*;;\nesac\n\ncase $ac_config_headers in *\"\n\"*) set x $ac_config_headers; shift; ac_config_headers=$*;;\nesac\n\n\ncat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1\n# Files that config.status was made for.\nconfig_files=\"$ac_config_files\"\nconfig_headers=\"$ac_config_headers\"\nconfig_commands=\"$ac_config_commands\"\n\n_ACEOF\n\ncat >>$CONFIG_STATUS <<\\_ACEOF || ac_write_fail=1\nac_cs_usage=\"\\\n\\`$as_me' instantiates files and other configuration actions\nfrom templates according to the current configuration.  Unless the files\nand actions are specified as TAGs, all are instantiated by default.\n\nUsage: $0 [OPTION]... [TAG]...\n\n  -h, --help       print this help, then exit\n  -V, --version    print version number and configuration settings, then exit\n      --config     print configuration, then exit\n  -q, --quiet, --silent\n                   do not print progress messages\n  -d, --debug      don't remove temporary files\n      --recheck    update $as_me by reconfiguring in the same conditions\n      --file=FILE[:TEMPLATE]\n                   instantiate the configuration file FILE\n      --header=FILE[:TEMPLATE]\n                   instantiate the configuration header FILE\n\nConfiguration files:\n$config_files\n\nConfiguration headers:\n$config_headers\n\nConfiguration commands:\n$config_commands\n\nReport bugs to <help@www.openfst.org>.\"\n\n_ACEOF\ncat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1\nac_cs_config=\"`$as_echo \"$ac_configure_args\" | sed 's/^ //; s/[\\\\\"\"\\`\\$]/\\\\\\\\&/g'`\"\nac_cs_version=\"\\\\\nOpenFst config.status 1.6.7\nconfigured by $0, generated by GNU Autoconf 2.69,\n  with options \\\\\"\\$ac_cs_config\\\\\"\n\nCopyright (C) 2012 Free Software Foundation, Inc.\nThis config.status script is free software; the Free Software Foundation\ngives unlimited permission to copy, distribute and modify it.\"\n\nac_pwd='$ac_pwd'\nsrcdir='$srcdir'\nINSTALL='$INSTALL'\nMKDIR_P='$MKDIR_P'\nAWK='$AWK'\ntest -n \"\\$AWK\" || AWK=awk\n_ACEOF\n\ncat >>$CONFIG_STATUS <<\\_ACEOF || ac_write_fail=1\n# The default lists apply if the user does not specify any file.\nac_need_defaults=:\nwhile test $# != 0\ndo\n  case $1 in\n  --*=?*)\n    ac_option=`expr \"X$1\" : 'X\\([^=]*\\)='`\n    ac_optarg=`expr \"X$1\" : 'X[^=]*=\\(.*\\)'`\n    ac_shift=:\n    ;;\n  --*=)\n    ac_option=`expr \"X$1\" : 'X\\([^=]*\\)='`\n    ac_optarg=\n    ac_shift=:\n    ;;\n  *)\n    ac_option=$1\n    ac_optarg=$2\n    ac_shift=shift\n    ;;\n  esac\n\n  case $ac_option in\n  # Handling of the options.\n  -recheck | --recheck | --rechec | --reche | --rech | --rec | --re | --r)\n    ac_cs_recheck=: ;;\n  --version | --versio | --versi | --vers | --ver | --ve | --v | -V )\n    $as_echo \"$ac_cs_version\"; exit ;;\n  --config | --confi | --conf | --con | --co | --c )\n    $as_echo \"$ac_cs_config\"; exit ;;\n  --debug | --debu | --deb | --de | --d | -d )\n    debug=: ;;\n  --file | --fil | --fi | --f )\n    $ac_shift\n    case $ac_optarg in\n    *\\'*) ac_optarg=`$as_echo \"$ac_optarg\" | sed \"s/'/'\\\\\\\\\\\\\\\\''/g\"` ;;\n    '') as_fn_error $? \"missing file argument\" ;;\n    esac\n    as_fn_append CONFIG_FILES \" '$ac_optarg'\"\n    ac_need_defaults=false;;\n  --header | --heade | --head | --hea )\n    $ac_shift\n    case $ac_optarg in\n    *\\'*) ac_optarg=`$as_echo \"$ac_optarg\" | sed \"s/'/'\\\\\\\\\\\\\\\\''/g\"` ;;\n    esac\n    as_fn_append CONFIG_HEADERS \" '$ac_optarg'\"\n    ac_need_defaults=false;;\n  --he | --h)\n    # Conflict between --help and --header\n    as_fn_error $? \"ambiguous option: \\`$1'\nTry \\`$0 --help' for more information.\";;\n  --help | --hel | -h )\n    $as_echo \"$ac_cs_usage\"; exit ;;\n  -q | -quiet | --quiet | --quie | --qui | --qu | --q \\\n  | -silent | --silent | --silen | --sile | --sil | --si | --s)\n    ac_cs_silent=: ;;\n\n  # This is an error.\n  -*) as_fn_error $? \"unrecognized option: \\`$1'\nTry \\`$0 --help' for more information.\" ;;\n\n  *) as_fn_append ac_config_targets \" $1\"\n     ac_need_defaults=false ;;\n\n  esac\n  shift\ndone\n\nac_configure_extra_args=\n\nif $ac_cs_silent; then\n  exec 6>/dev/null\n  ac_configure_extra_args=\"$ac_configure_extra_args --silent\"\nfi\n\n_ACEOF\ncat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1\nif \\$ac_cs_recheck; then\n  set X $SHELL '$0' $ac_configure_args \\$ac_configure_extra_args --no-create --no-recursion\n  shift\n  \\$as_echo \"running CONFIG_SHELL=$SHELL \\$*\" >&6\n  CONFIG_SHELL='$SHELL'\n  export CONFIG_SHELL\n  exec \"\\$@\"\nfi\n\n_ACEOF\ncat >>$CONFIG_STATUS <<\\_ACEOF || ac_write_fail=1\nexec 5>>config.log\n{\n  echo\n  sed 'h;s/./-/g;s/^.../## /;s/...$/ ##/;p;x;p;x' <<_ASBOX\n## Running $as_me. ##\n_ASBOX\n  $as_echo \"$ac_log\"\n} >&5\n\n_ACEOF\ncat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1\n#\n# INIT-COMMANDS\n#\nAMDEP_TRUE=\"$AMDEP_TRUE\" ac_aux_dir=\"$ac_aux_dir\"\n\n\n# The HP-UX ksh and POSIX shell print the target directory to stdout\n# if CDPATH is set.\n(unset CDPATH) >/dev/null 2>&1 && unset CDPATH\n\nsed_quote_subst='$sed_quote_subst'\ndouble_quote_subst='$double_quote_subst'\ndelay_variable_subst='$delay_variable_subst'\nenable_static='`$ECHO \"$enable_static\" | $SED \"$delay_single_quote_subst\"`'\nmacro_version='`$ECHO \"$macro_version\" | $SED \"$delay_single_quote_subst\"`'\nmacro_revision='`$ECHO \"$macro_revision\" | $SED \"$delay_single_quote_subst\"`'\nenable_shared='`$ECHO \"$enable_shared\" | $SED \"$delay_single_quote_subst\"`'\npic_mode='`$ECHO \"$pic_mode\" | $SED \"$delay_single_quote_subst\"`'\nenable_fast_install='`$ECHO \"$enable_fast_install\" | $SED \"$delay_single_quote_subst\"`'\nSHELL='`$ECHO \"$SHELL\" | $SED \"$delay_single_quote_subst\"`'\nECHO='`$ECHO \"$ECHO\" | $SED \"$delay_single_quote_subst\"`'\nPATH_SEPARATOR='`$ECHO \"$PATH_SEPARATOR\" | $SED \"$delay_single_quote_subst\"`'\nhost_alias='`$ECHO \"$host_alias\" | $SED \"$delay_single_quote_subst\"`'\nhost='`$ECHO \"$host\" | $SED \"$delay_single_quote_subst\"`'\nhost_os='`$ECHO \"$host_os\" | $SED \"$delay_single_quote_subst\"`'\nbuild_alias='`$ECHO \"$build_alias\" | $SED \"$delay_single_quote_subst\"`'\nbuild='`$ECHO \"$build\" | $SED \"$delay_single_quote_subst\"`'\nbuild_os='`$ECHO \"$build_os\" | $SED \"$delay_single_quote_subst\"`'\nSED='`$ECHO \"$SED\" | $SED \"$delay_single_quote_subst\"`'\nXsed='`$ECHO \"$Xsed\" | $SED \"$delay_single_quote_subst\"`'\nGREP='`$ECHO \"$GREP\" | $SED \"$delay_single_quote_subst\"`'\nEGREP='`$ECHO \"$EGREP\" | $SED \"$delay_single_quote_subst\"`'\nFGREP='`$ECHO \"$FGREP\" | $SED \"$delay_single_quote_subst\"`'\nLD='`$ECHO \"$LD\" | $SED \"$delay_single_quote_subst\"`'\nNM='`$ECHO \"$NM\" | $SED \"$delay_single_quote_subst\"`'\nLN_S='`$ECHO \"$LN_S\" | $SED \"$delay_single_quote_subst\"`'\nmax_cmd_len='`$ECHO \"$max_cmd_len\" | $SED \"$delay_single_quote_subst\"`'\nac_objext='`$ECHO \"$ac_objext\" | $SED \"$delay_single_quote_subst\"`'\nexeext='`$ECHO \"$exeext\" | $SED \"$delay_single_quote_subst\"`'\nlt_unset='`$ECHO \"$lt_unset\" | $SED \"$delay_single_quote_subst\"`'\nlt_SP2NL='`$ECHO \"$lt_SP2NL\" | $SED \"$delay_single_quote_subst\"`'\nlt_NL2SP='`$ECHO \"$lt_NL2SP\" | $SED \"$delay_single_quote_subst\"`'\nlt_cv_to_host_file_cmd='`$ECHO \"$lt_cv_to_host_file_cmd\" | $SED \"$delay_single_quote_subst\"`'\nlt_cv_to_tool_file_cmd='`$ECHO \"$lt_cv_to_tool_file_cmd\" | $SED \"$delay_single_quote_subst\"`'\nreload_flag='`$ECHO \"$reload_flag\" | $SED \"$delay_single_quote_subst\"`'\nreload_cmds='`$ECHO \"$reload_cmds\" | $SED \"$delay_single_quote_subst\"`'\nOBJDUMP='`$ECHO \"$OBJDUMP\" | $SED \"$delay_single_quote_subst\"`'\ndeplibs_check_method='`$ECHO \"$deplibs_check_method\" | $SED \"$delay_single_quote_subst\"`'\nfile_magic_cmd='`$ECHO \"$file_magic_cmd\" | $SED \"$delay_single_quote_subst\"`'\nfile_magic_glob='`$ECHO \"$file_magic_glob\" | $SED \"$delay_single_quote_subst\"`'\nwant_nocaseglob='`$ECHO \"$want_nocaseglob\" | $SED \"$delay_single_quote_subst\"`'\nDLLTOOL='`$ECHO \"$DLLTOOL\" | $SED \"$delay_single_quote_subst\"`'\nsharedlib_from_linklib_cmd='`$ECHO \"$sharedlib_from_linklib_cmd\" | $SED \"$delay_single_quote_subst\"`'\nAR='`$ECHO \"$AR\" | $SED \"$delay_single_quote_subst\"`'\nAR_FLAGS='`$ECHO \"$AR_FLAGS\" | $SED \"$delay_single_quote_subst\"`'\narchiver_list_spec='`$ECHO \"$archiver_list_spec\" | $SED \"$delay_single_quote_subst\"`'\nSTRIP='`$ECHO \"$STRIP\" | $SED \"$delay_single_quote_subst\"`'\nRANLIB='`$ECHO \"$RANLIB\" | $SED \"$delay_single_quote_subst\"`'\nold_postinstall_cmds='`$ECHO \"$old_postinstall_cmds\" | $SED \"$delay_single_quote_subst\"`'\nold_postuninstall_cmds='`$ECHO \"$old_postuninstall_cmds\" | $SED \"$delay_single_quote_subst\"`'\nold_archive_cmds='`$ECHO \"$old_archive_cmds\" | $SED \"$delay_single_quote_subst\"`'\nlock_old_archive_extraction='`$ECHO \"$lock_old_archive_extraction\" | $SED \"$delay_single_quote_subst\"`'\nCC='`$ECHO \"$CC\" | $SED \"$delay_single_quote_subst\"`'\nCFLAGS='`$ECHO \"$CFLAGS\" | $SED \"$delay_single_quote_subst\"`'\ncompiler='`$ECHO \"$compiler\" | $SED \"$delay_single_quote_subst\"`'\nGCC='`$ECHO \"$GCC\" | $SED \"$delay_single_quote_subst\"`'\nlt_cv_sys_global_symbol_pipe='`$ECHO \"$lt_cv_sys_global_symbol_pipe\" | $SED \"$delay_single_quote_subst\"`'\nlt_cv_sys_global_symbol_to_cdecl='`$ECHO \"$lt_cv_sys_global_symbol_to_cdecl\" | $SED \"$delay_single_quote_subst\"`'\nlt_cv_sys_global_symbol_to_c_name_address='`$ECHO \"$lt_cv_sys_global_symbol_to_c_name_address\" | $SED \"$delay_single_quote_subst\"`'\nlt_cv_sys_global_symbol_to_c_name_address_lib_prefix='`$ECHO \"$lt_cv_sys_global_symbol_to_c_name_address_lib_prefix\" | $SED \"$delay_single_quote_subst\"`'\nnm_file_list_spec='`$ECHO \"$nm_file_list_spec\" | $SED \"$delay_single_quote_subst\"`'\nlt_sysroot='`$ECHO \"$lt_sysroot\" | $SED \"$delay_single_quote_subst\"`'\nobjdir='`$ECHO \"$objdir\" | $SED \"$delay_single_quote_subst\"`'\nMAGIC_CMD='`$ECHO \"$MAGIC_CMD\" | $SED \"$delay_single_quote_subst\"`'\nlt_prog_compiler_no_builtin_flag='`$ECHO \"$lt_prog_compiler_no_builtin_flag\" | $SED \"$delay_single_quote_subst\"`'\nlt_prog_compiler_pic='`$ECHO \"$lt_prog_compiler_pic\" | $SED \"$delay_single_quote_subst\"`'\nlt_prog_compiler_wl='`$ECHO \"$lt_prog_compiler_wl\" | $SED \"$delay_single_quote_subst\"`'\nlt_prog_compiler_static='`$ECHO \"$lt_prog_compiler_static\" | $SED \"$delay_single_quote_subst\"`'\nlt_cv_prog_compiler_c_o='`$ECHO \"$lt_cv_prog_compiler_c_o\" | $SED \"$delay_single_quote_subst\"`'\nneed_locks='`$ECHO \"$need_locks\" | $SED \"$delay_single_quote_subst\"`'\nMANIFEST_TOOL='`$ECHO \"$MANIFEST_TOOL\" | $SED \"$delay_single_quote_subst\"`'\nDSYMUTIL='`$ECHO \"$DSYMUTIL\" | $SED \"$delay_single_quote_subst\"`'\nNMEDIT='`$ECHO \"$NMEDIT\" | $SED \"$delay_single_quote_subst\"`'\nLIPO='`$ECHO \"$LIPO\" | $SED \"$delay_single_quote_subst\"`'\nOTOOL='`$ECHO \"$OTOOL\" | $SED \"$delay_single_quote_subst\"`'\nOTOOL64='`$ECHO \"$OTOOL64\" | $SED \"$delay_single_quote_subst\"`'\nlibext='`$ECHO \"$libext\" | $SED \"$delay_single_quote_subst\"`'\nshrext_cmds='`$ECHO \"$shrext_cmds\" | $SED \"$delay_single_quote_subst\"`'\nextract_expsyms_cmds='`$ECHO \"$extract_expsyms_cmds\" | $SED \"$delay_single_quote_subst\"`'\narchive_cmds_need_lc='`$ECHO \"$archive_cmds_need_lc\" | $SED \"$delay_single_quote_subst\"`'\nenable_shared_with_static_runtimes='`$ECHO \"$enable_shared_with_static_runtimes\" | $SED \"$delay_single_quote_subst\"`'\nexport_dynamic_flag_spec='`$ECHO \"$export_dynamic_flag_spec\" | $SED \"$delay_single_quote_subst\"`'\nwhole_archive_flag_spec='`$ECHO \"$whole_archive_flag_spec\" | $SED \"$delay_single_quote_subst\"`'\ncompiler_needs_object='`$ECHO \"$compiler_needs_object\" | $SED \"$delay_single_quote_subst\"`'\nold_archive_from_new_cmds='`$ECHO \"$old_archive_from_new_cmds\" | $SED \"$delay_single_quote_subst\"`'\nold_archive_from_expsyms_cmds='`$ECHO \"$old_archive_from_expsyms_cmds\" | $SED \"$delay_single_quote_subst\"`'\narchive_cmds='`$ECHO \"$archive_cmds\" | $SED \"$delay_single_quote_subst\"`'\narchive_expsym_cmds='`$ECHO \"$archive_expsym_cmds\" | $SED \"$delay_single_quote_subst\"`'\nmodule_cmds='`$ECHO \"$module_cmds\" | $SED \"$delay_single_quote_subst\"`'\nmodule_expsym_cmds='`$ECHO \"$module_expsym_cmds\" | $SED \"$delay_single_quote_subst\"`'\nwith_gnu_ld='`$ECHO \"$with_gnu_ld\" | $SED \"$delay_single_quote_subst\"`'\nallow_undefined_flag='`$ECHO \"$allow_undefined_flag\" | $SED \"$delay_single_quote_subst\"`'\nno_undefined_flag='`$ECHO \"$no_undefined_flag\" | $SED \"$delay_single_quote_subst\"`'\nhardcode_libdir_flag_spec='`$ECHO \"$hardcode_libdir_flag_spec\" | $SED \"$delay_single_quote_subst\"`'\nhardcode_libdir_separator='`$ECHO \"$hardcode_libdir_separator\" | $SED \"$delay_single_quote_subst\"`'\nhardcode_direct='`$ECHO \"$hardcode_direct\" | $SED \"$delay_single_quote_subst\"`'\nhardcode_direct_absolute='`$ECHO \"$hardcode_direct_absolute\" | $SED \"$delay_single_quote_subst\"`'\nhardcode_minus_L='`$ECHO \"$hardcode_minus_L\" | $SED \"$delay_single_quote_subst\"`'\nhardcode_shlibpath_var='`$ECHO \"$hardcode_shlibpath_var\" | $SED \"$delay_single_quote_subst\"`'\nhardcode_automatic='`$ECHO \"$hardcode_automatic\" | $SED \"$delay_single_quote_subst\"`'\ninherit_rpath='`$ECHO \"$inherit_rpath\" | $SED \"$delay_single_quote_subst\"`'\nlink_all_deplibs='`$ECHO \"$link_all_deplibs\" | $SED \"$delay_single_quote_subst\"`'\nalways_export_symbols='`$ECHO \"$always_export_symbols\" | $SED \"$delay_single_quote_subst\"`'\nexport_symbols_cmds='`$ECHO \"$export_symbols_cmds\" | $SED \"$delay_single_quote_subst\"`'\nexclude_expsyms='`$ECHO \"$exclude_expsyms\" | $SED \"$delay_single_quote_subst\"`'\ninclude_expsyms='`$ECHO \"$include_expsyms\" | $SED \"$delay_single_quote_subst\"`'\nprelink_cmds='`$ECHO \"$prelink_cmds\" | $SED \"$delay_single_quote_subst\"`'\npostlink_cmds='`$ECHO \"$postlink_cmds\" | $SED \"$delay_single_quote_subst\"`'\nfile_list_spec='`$ECHO \"$file_list_spec\" | $SED \"$delay_single_quote_subst\"`'\nvariables_saved_for_relink='`$ECHO \"$variables_saved_for_relink\" | $SED \"$delay_single_quote_subst\"`'\nneed_lib_prefix='`$ECHO \"$need_lib_prefix\" | $SED \"$delay_single_quote_subst\"`'\nneed_version='`$ECHO \"$need_version\" | $SED \"$delay_single_quote_subst\"`'\nversion_type='`$ECHO \"$version_type\" | $SED \"$delay_single_quote_subst\"`'\nrunpath_var='`$ECHO \"$runpath_var\" | $SED \"$delay_single_quote_subst\"`'\nshlibpath_var='`$ECHO \"$shlibpath_var\" | $SED \"$delay_single_quote_subst\"`'\nshlibpath_overrides_runpath='`$ECHO \"$shlibpath_overrides_runpath\" | $SED \"$delay_single_quote_subst\"`'\nlibname_spec='`$ECHO \"$libname_spec\" | $SED \"$delay_single_quote_subst\"`'\nlibrary_names_spec='`$ECHO \"$library_names_spec\" | $SED \"$delay_single_quote_subst\"`'\nsoname_spec='`$ECHO \"$soname_spec\" | $SED \"$delay_single_quote_subst\"`'\ninstall_override_mode='`$ECHO \"$install_override_mode\" | $SED \"$delay_single_quote_subst\"`'\npostinstall_cmds='`$ECHO \"$postinstall_cmds\" | $SED \"$delay_single_quote_subst\"`'\npostuninstall_cmds='`$ECHO \"$postuninstall_cmds\" | $SED \"$delay_single_quote_subst\"`'\nfinish_cmds='`$ECHO \"$finish_cmds\" | $SED \"$delay_single_quote_subst\"`'\nfinish_eval='`$ECHO \"$finish_eval\" | $SED \"$delay_single_quote_subst\"`'\nhardcode_into_libs='`$ECHO \"$hardcode_into_libs\" | $SED \"$delay_single_quote_subst\"`'\nsys_lib_search_path_spec='`$ECHO \"$sys_lib_search_path_spec\" | $SED \"$delay_single_quote_subst\"`'\nsys_lib_dlsearch_path_spec='`$ECHO \"$sys_lib_dlsearch_path_spec\" | $SED \"$delay_single_quote_subst\"`'\nhardcode_action='`$ECHO \"$hardcode_action\" | $SED \"$delay_single_quote_subst\"`'\nenable_dlopen='`$ECHO \"$enable_dlopen\" | $SED \"$delay_single_quote_subst\"`'\nenable_dlopen_self='`$ECHO \"$enable_dlopen_self\" | $SED \"$delay_single_quote_subst\"`'\nenable_dlopen_self_static='`$ECHO \"$enable_dlopen_self_static\" | $SED \"$delay_single_quote_subst\"`'\nold_striplib='`$ECHO \"$old_striplib\" | $SED \"$delay_single_quote_subst\"`'\nstriplib='`$ECHO \"$striplib\" | $SED \"$delay_single_quote_subst\"`'\ncompiler_lib_search_dirs='`$ECHO \"$compiler_lib_search_dirs\" | $SED \"$delay_single_quote_subst\"`'\npredep_objects='`$ECHO \"$predep_objects\" | $SED \"$delay_single_quote_subst\"`'\npostdep_objects='`$ECHO \"$postdep_objects\" | $SED \"$delay_single_quote_subst\"`'\npredeps='`$ECHO \"$predeps\" | $SED \"$delay_single_quote_subst\"`'\npostdeps='`$ECHO \"$postdeps\" | $SED \"$delay_single_quote_subst\"`'\ncompiler_lib_search_path='`$ECHO \"$compiler_lib_search_path\" | $SED \"$delay_single_quote_subst\"`'\nLD_CXX='`$ECHO \"$LD_CXX\" | $SED \"$delay_single_quote_subst\"`'\nreload_flag_CXX='`$ECHO \"$reload_flag_CXX\" | $SED \"$delay_single_quote_subst\"`'\nreload_cmds_CXX='`$ECHO \"$reload_cmds_CXX\" | $SED \"$delay_single_quote_subst\"`'\nold_archive_cmds_CXX='`$ECHO \"$old_archive_cmds_CXX\" | $SED \"$delay_single_quote_subst\"`'\ncompiler_CXX='`$ECHO \"$compiler_CXX\" | $SED \"$delay_single_quote_subst\"`'\nGCC_CXX='`$ECHO \"$GCC_CXX\" | $SED \"$delay_single_quote_subst\"`'\nlt_prog_compiler_no_builtin_flag_CXX='`$ECHO \"$lt_prog_compiler_no_builtin_flag_CXX\" | $SED \"$delay_single_quote_subst\"`'\nlt_prog_compiler_pic_CXX='`$ECHO \"$lt_prog_compiler_pic_CXX\" | $SED \"$delay_single_quote_subst\"`'\nlt_prog_compiler_wl_CXX='`$ECHO \"$lt_prog_compiler_wl_CXX\" | $SED \"$delay_single_quote_subst\"`'\nlt_prog_compiler_static_CXX='`$ECHO \"$lt_prog_compiler_static_CXX\" | $SED \"$delay_single_quote_subst\"`'\nlt_cv_prog_compiler_c_o_CXX='`$ECHO \"$lt_cv_prog_compiler_c_o_CXX\" | $SED \"$delay_single_quote_subst\"`'\narchive_cmds_need_lc_CXX='`$ECHO \"$archive_cmds_need_lc_CXX\" | $SED \"$delay_single_quote_subst\"`'\nenable_shared_with_static_runtimes_CXX='`$ECHO \"$enable_shared_with_static_runtimes_CXX\" | $SED \"$delay_single_quote_subst\"`'\nexport_dynamic_flag_spec_CXX='`$ECHO \"$export_dynamic_flag_spec_CXX\" | $SED \"$delay_single_quote_subst\"`'\nwhole_archive_flag_spec_CXX='`$ECHO \"$whole_archive_flag_spec_CXX\" | $SED \"$delay_single_quote_subst\"`'\ncompiler_needs_object_CXX='`$ECHO \"$compiler_needs_object_CXX\" | $SED \"$delay_single_quote_subst\"`'\nold_archive_from_new_cmds_CXX='`$ECHO \"$old_archive_from_new_cmds_CXX\" | $SED \"$delay_single_quote_subst\"`'\nold_archive_from_expsyms_cmds_CXX='`$ECHO \"$old_archive_from_expsyms_cmds_CXX\" | $SED \"$delay_single_quote_subst\"`'\narchive_cmds_CXX='`$ECHO \"$archive_cmds_CXX\" | $SED \"$delay_single_quote_subst\"`'\narchive_expsym_cmds_CXX='`$ECHO \"$archive_expsym_cmds_CXX\" | $SED \"$delay_single_quote_subst\"`'\nmodule_cmds_CXX='`$ECHO \"$module_cmds_CXX\" | $SED \"$delay_single_quote_subst\"`'\nmodule_expsym_cmds_CXX='`$ECHO \"$module_expsym_cmds_CXX\" | $SED \"$delay_single_quote_subst\"`'\nwith_gnu_ld_CXX='`$ECHO \"$with_gnu_ld_CXX\" | $SED \"$delay_single_quote_subst\"`'\nallow_undefined_flag_CXX='`$ECHO \"$allow_undefined_flag_CXX\" | $SED \"$delay_single_quote_subst\"`'\nno_undefined_flag_CXX='`$ECHO \"$no_undefined_flag_CXX\" | $SED \"$delay_single_quote_subst\"`'\nhardcode_libdir_flag_spec_CXX='`$ECHO \"$hardcode_libdir_flag_spec_CXX\" | $SED \"$delay_single_quote_subst\"`'\nhardcode_libdir_separator_CXX='`$ECHO \"$hardcode_libdir_separator_CXX\" | $SED \"$delay_single_quote_subst\"`'\nhardcode_direct_CXX='`$ECHO \"$hardcode_direct_CXX\" | $SED \"$delay_single_quote_subst\"`'\nhardcode_direct_absolute_CXX='`$ECHO \"$hardcode_direct_absolute_CXX\" | $SED \"$delay_single_quote_subst\"`'\nhardcode_minus_L_CXX='`$ECHO \"$hardcode_minus_L_CXX\" | $SED \"$delay_single_quote_subst\"`'\nhardcode_shlibpath_var_CXX='`$ECHO \"$hardcode_shlibpath_var_CXX\" | $SED \"$delay_single_quote_subst\"`'\nhardcode_automatic_CXX='`$ECHO \"$hardcode_automatic_CXX\" | $SED \"$delay_single_quote_subst\"`'\ninherit_rpath_CXX='`$ECHO \"$inherit_rpath_CXX\" | $SED \"$delay_single_quote_subst\"`'\nlink_all_deplibs_CXX='`$ECHO \"$link_all_deplibs_CXX\" | $SED \"$delay_single_quote_subst\"`'\nalways_export_symbols_CXX='`$ECHO \"$always_export_symbols_CXX\" | $SED \"$delay_single_quote_subst\"`'\nexport_symbols_cmds_CXX='`$ECHO \"$export_symbols_cmds_CXX\" | $SED \"$delay_single_quote_subst\"`'\nexclude_expsyms_CXX='`$ECHO \"$exclude_expsyms_CXX\" | $SED \"$delay_single_quote_subst\"`'\ninclude_expsyms_CXX='`$ECHO \"$include_expsyms_CXX\" | $SED \"$delay_single_quote_subst\"`'\nprelink_cmds_CXX='`$ECHO \"$prelink_cmds_CXX\" | $SED \"$delay_single_quote_subst\"`'\npostlink_cmds_CXX='`$ECHO \"$postlink_cmds_CXX\" | $SED \"$delay_single_quote_subst\"`'\nfile_list_spec_CXX='`$ECHO \"$file_list_spec_CXX\" | $SED \"$delay_single_quote_subst\"`'\nhardcode_action_CXX='`$ECHO \"$hardcode_action_CXX\" | $SED \"$delay_single_quote_subst\"`'\ncompiler_lib_search_dirs_CXX='`$ECHO \"$compiler_lib_search_dirs_CXX\" | $SED \"$delay_single_quote_subst\"`'\npredep_objects_CXX='`$ECHO \"$predep_objects_CXX\" | $SED \"$delay_single_quote_subst\"`'\npostdep_objects_CXX='`$ECHO \"$postdep_objects_CXX\" | $SED \"$delay_single_quote_subst\"`'\npredeps_CXX='`$ECHO \"$predeps_CXX\" | $SED \"$delay_single_quote_subst\"`'\npostdeps_CXX='`$ECHO \"$postdeps_CXX\" | $SED \"$delay_single_quote_subst\"`'\ncompiler_lib_search_path_CXX='`$ECHO \"$compiler_lib_search_path_CXX\" | $SED \"$delay_single_quote_subst\"`'\n\nLTCC='$LTCC'\nLTCFLAGS='$LTCFLAGS'\ncompiler='$compiler_DEFAULT'\n\n# A function that is used when there is no print builtin or printf.\nfunc_fallback_echo ()\n{\n  eval 'cat <<_LTECHO_EOF\n\\$1\n_LTECHO_EOF'\n}\n\n# Quote evaled strings.\nfor var in SHELL \\\nECHO \\\nPATH_SEPARATOR \\\nSED \\\nGREP \\\nEGREP \\\nFGREP \\\nLD \\\nNM \\\nLN_S \\\nlt_SP2NL \\\nlt_NL2SP \\\nreload_flag \\\nOBJDUMP \\\ndeplibs_check_method \\\nfile_magic_cmd \\\nfile_magic_glob \\\nwant_nocaseglob \\\nDLLTOOL \\\nsharedlib_from_linklib_cmd \\\nAR \\\nAR_FLAGS \\\narchiver_list_spec \\\nSTRIP \\\nRANLIB \\\nCC \\\nCFLAGS \\\ncompiler \\\nlt_cv_sys_global_symbol_pipe \\\nlt_cv_sys_global_symbol_to_cdecl \\\nlt_cv_sys_global_symbol_to_c_name_address \\\nlt_cv_sys_global_symbol_to_c_name_address_lib_prefix \\\nnm_file_list_spec \\\nlt_prog_compiler_no_builtin_flag \\\nlt_prog_compiler_pic \\\nlt_prog_compiler_wl \\\nlt_prog_compiler_static \\\nlt_cv_prog_compiler_c_o \\\nneed_locks \\\nMANIFEST_TOOL \\\nDSYMUTIL \\\nNMEDIT \\\nLIPO \\\nOTOOL \\\nOTOOL64 \\\nshrext_cmds \\\nexport_dynamic_flag_spec \\\nwhole_archive_flag_spec \\\ncompiler_needs_object \\\nwith_gnu_ld \\\nallow_undefined_flag \\\nno_undefined_flag \\\nhardcode_libdir_flag_spec \\\nhardcode_libdir_separator \\\nexclude_expsyms \\\ninclude_expsyms \\\nfile_list_spec \\\nvariables_saved_for_relink \\\nlibname_spec \\\nlibrary_names_spec \\\nsoname_spec \\\ninstall_override_mode \\\nfinish_eval \\\nold_striplib \\\nstriplib \\\ncompiler_lib_search_dirs \\\npredep_objects \\\npostdep_objects \\\npredeps \\\npostdeps \\\ncompiler_lib_search_path \\\nLD_CXX \\\nreload_flag_CXX \\\ncompiler_CXX \\\nlt_prog_compiler_no_builtin_flag_CXX \\\nlt_prog_compiler_pic_CXX \\\nlt_prog_compiler_wl_CXX \\\nlt_prog_compiler_static_CXX \\\nlt_cv_prog_compiler_c_o_CXX \\\nexport_dynamic_flag_spec_CXX \\\nwhole_archive_flag_spec_CXX \\\ncompiler_needs_object_CXX \\\nwith_gnu_ld_CXX \\\nallow_undefined_flag_CXX \\\nno_undefined_flag_CXX \\\nhardcode_libdir_flag_spec_CXX \\\nhardcode_libdir_separator_CXX \\\nexclude_expsyms_CXX \\\ninclude_expsyms_CXX \\\nfile_list_spec_CXX \\\ncompiler_lib_search_dirs_CXX \\\npredep_objects_CXX \\\npostdep_objects_CXX \\\npredeps_CXX \\\npostdeps_CXX \\\ncompiler_lib_search_path_CXX; do\n    case \\`eval \\\\\\\\\\$ECHO \\\\\\\\\"\"\\\\\\\\\\$\\$var\"\\\\\\\\\"\\` in\n    *[\\\\\\\\\\\\\\`\\\\\"\\\\\\$]*)\n      eval \"lt_\\$var=\\\\\\\\\\\\\"\\\\\\`\\\\\\$ECHO \\\\\"\\\\\\$\\$var\\\\\" | \\\\\\$SED \\\\\"\\\\\\$sed_quote_subst\\\\\"\\\\\\`\\\\\\\\\\\\\"\"\n      ;;\n    *)\n      eval \"lt_\\$var=\\\\\\\\\\\\\"\\\\\\$\\$var\\\\\\\\\\\\\"\"\n      ;;\n    esac\ndone\n\n# Double-quote double-evaled strings.\nfor var in reload_cmds \\\nold_postinstall_cmds \\\nold_postuninstall_cmds \\\nold_archive_cmds \\\nextract_expsyms_cmds \\\nold_archive_from_new_cmds \\\nold_archive_from_expsyms_cmds \\\narchive_cmds \\\narchive_expsym_cmds \\\nmodule_cmds \\\nmodule_expsym_cmds \\\nexport_symbols_cmds \\\nprelink_cmds \\\npostlink_cmds \\\npostinstall_cmds \\\npostuninstall_cmds \\\nfinish_cmds \\\nsys_lib_search_path_spec \\\nsys_lib_dlsearch_path_spec \\\nreload_cmds_CXX \\\nold_archive_cmds_CXX \\\nold_archive_from_new_cmds_CXX \\\nold_archive_from_expsyms_cmds_CXX \\\narchive_cmds_CXX \\\narchive_expsym_cmds_CXX \\\nmodule_cmds_CXX \\\nmodule_expsym_cmds_CXX \\\nexport_symbols_cmds_CXX \\\nprelink_cmds_CXX \\\npostlink_cmds_CXX; do\n    case \\`eval \\\\\\\\\\$ECHO \\\\\\\\\"\"\\\\\\\\\\$\\$var\"\\\\\\\\\"\\` in\n    *[\\\\\\\\\\\\\\`\\\\\"\\\\\\$]*)\n      eval \"lt_\\$var=\\\\\\\\\\\\\"\\\\\\`\\\\\\$ECHO \\\\\"\\\\\\$\\$var\\\\\" | \\\\\\$SED -e \\\\\"\\\\\\$double_quote_subst\\\\\" -e \\\\\"\\\\\\$sed_quote_subst\\\\\" -e \\\\\"\\\\\\$delay_variable_subst\\\\\"\\\\\\`\\\\\\\\\\\\\"\"\n      ;;\n    *)\n      eval \"lt_\\$var=\\\\\\\\\\\\\"\\\\\\$\\$var\\\\\\\\\\\\\"\"\n      ;;\n    esac\ndone\n\nac_aux_dir='$ac_aux_dir'\nxsi_shell='$xsi_shell'\nlt_shell_append='$lt_shell_append'\n\n# See if we are running on zsh, and set the options which allow our\n# commands through without removal of \\ escapes INIT.\nif test -n \"\\${ZSH_VERSION+set}\" ; then\n   setopt NO_GLOB_SUBST\nfi\n\n\n    PACKAGE='$PACKAGE'\n    VERSION='$VERSION'\n    TIMESTAMP='$TIMESTAMP'\n    RM='$RM'\n    ofile='$ofile'\n\n\n\n\n\n\n_ACEOF\n\ncat >>$CONFIG_STATUS <<\\_ACEOF || ac_write_fail=1\n\n# Handling of arguments.\nfor ac_config_target in $ac_config_targets\ndo\n  case $ac_config_target in\n    \"depfiles\") CONFIG_COMMANDS=\"$CONFIG_COMMANDS depfiles\" ;;\n    \"libtool\") CONFIG_COMMANDS=\"$CONFIG_COMMANDS libtool\" ;;\n    \"config.h\") CONFIG_HEADERS=\"$CONFIG_HEADERS config.h\" ;;\n    \"src/include/fst/config.h\") CONFIG_HEADERS=\"$CONFIG_HEADERS src/include/fst/config.h\" ;;\n    \"Makefile\") CONFIG_FILES=\"$CONFIG_FILES Makefile\" ;;\n    \"src/Makefile\") CONFIG_FILES=\"$CONFIG_FILES src/Makefile\" ;;\n    \"src/include/Makefile\") CONFIG_FILES=\"$CONFIG_FILES src/include/Makefile\" ;;\n    \"src/lib/Makefile\") CONFIG_FILES=\"$CONFIG_FILES src/lib/Makefile\" ;;\n    \"src/bin/Makefile\") CONFIG_FILES=\"$CONFIG_FILES src/bin/Makefile\" ;;\n    \"src/test/Makefile\") CONFIG_FILES=\"$CONFIG_FILES src/test/Makefile\" ;;\n    \"src/extensions/Makefile\") CONFIG_FILES=\"$CONFIG_FILES src/extensions/Makefile\" ;;\n    \"src/extensions/compact/Makefile\") CONFIG_FILES=\"$CONFIG_FILES src/extensions/compact/Makefile\" ;;\n    \"src/extensions/compress/Makefile\") CONFIG_FILES=\"$CONFIG_FILES src/extensions/compress/Makefile\" ;;\n    \"src/extensions/const/Makefile\") CONFIG_FILES=\"$CONFIG_FILES src/extensions/const/Makefile\" ;;\n    \"src/extensions/far/Makefile\") CONFIG_FILES=\"$CONFIG_FILES src/extensions/far/Makefile\" ;;\n    \"src/extensions/linear/Makefile\") CONFIG_FILES=\"$CONFIG_FILES src/extensions/linear/Makefile\" ;;\n    \"src/extensions/lookahead/Makefile\") CONFIG_FILES=\"$CONFIG_FILES src/extensions/lookahead/Makefile\" ;;\n    \"src/extensions/mpdt/Makefile\") CONFIG_FILES=\"$CONFIG_FILES src/extensions/mpdt/Makefile\" ;;\n    \"src/extensions/ngram/Makefile\") CONFIG_FILES=\"$CONFIG_FILES src/extensions/ngram/Makefile\" ;;\n    \"src/extensions/pdt/Makefile\") CONFIG_FILES=\"$CONFIG_FILES src/extensions/pdt/Makefile\" ;;\n    \"src/extensions/python/Makefile\") CONFIG_FILES=\"$CONFIG_FILES src/extensions/python/Makefile\" ;;\n    \"src/extensions/special/Makefile\") CONFIG_FILES=\"$CONFIG_FILES src/extensions/special/Makefile\" ;;\n    \"src/script/Makefile\") CONFIG_FILES=\"$CONFIG_FILES src/script/Makefile\" ;;\n\n  *) as_fn_error $? \"invalid argument: \\`$ac_config_target'\" \"$LINENO\" 5;;\n  esac\ndone\n\n\n# If the user did not use the arguments to specify the items to instantiate,\n# then the envvar interface is used.  Set only those that are not.\n# We use the long form for the default assignment because of an extremely\n# bizarre bug on SunOS 4.1.3.\nif $ac_need_defaults; then\n  test \"${CONFIG_FILES+set}\" = set || CONFIG_FILES=$config_files\n  test \"${CONFIG_HEADERS+set}\" = set || CONFIG_HEADERS=$config_headers\n  test \"${CONFIG_COMMANDS+set}\" = set || CONFIG_COMMANDS=$config_commands\nfi\n\n# Have a temporary directory for convenience.  Make it in the build tree\n# simply because there is no reason against having it here, and in addition,\n# creating and moving files from /tmp can sometimes cause problems.\n# Hook for its removal unless debugging.\n# Note that there is a small window in which the directory will not be cleaned:\n# after its creation but before its name has been assigned to `$tmp'.\n$debug ||\n{\n  tmp= ac_tmp=\n  trap 'exit_status=$?\n  : \"${ac_tmp:=$tmp}\"\n  { test ! -d \"$ac_tmp\" || rm -fr \"$ac_tmp\"; } && exit $exit_status\n' 0\n  trap 'as_fn_exit 1' 1 2 13 15\n}\n# Create a (secure) tmp directory for tmp files.\n\n{\n  tmp=`(umask 077 && mktemp -d \"./confXXXXXX\") 2>/dev/null` &&\n  test -d \"$tmp\"\n}  ||\n{\n  tmp=./conf$$-$RANDOM\n  (umask 077 && mkdir \"$tmp\")\n} || as_fn_error $? \"cannot create a temporary directory in .\" \"$LINENO\" 5\nac_tmp=$tmp\n\n# Set up the scripts for CONFIG_FILES section.\n# No need to generate them if there are no CONFIG_FILES.\n# This happens for instance with `./config.status config.h'.\nif test -n \"$CONFIG_FILES\"; then\n\n\nac_cr=`echo X | tr X '\\015'`\n# On cygwin, bash can eat \\r inside `` if the user requested igncr.\n# But we know of no other shell where ac_cr would be empty at this\n# point, so we can use a bashism as a fallback.\nif test \"x$ac_cr\" = x; then\n  eval ac_cr=\\$\\'\\\\r\\'\nfi\nac_cs_awk_cr=`$AWK 'BEGIN { print \"a\\rb\" }' </dev/null 2>/dev/null`\nif test \"$ac_cs_awk_cr\" = \"a${ac_cr}b\"; then\n  ac_cs_awk_cr='\\\\r'\nelse\n  ac_cs_awk_cr=$ac_cr\nfi\n\necho 'BEGIN {' >\"$ac_tmp/subs1.awk\" &&\n_ACEOF\n\n\n{\n  echo \"cat >conf$$subs.awk <<_ACEOF\" &&\n  echo \"$ac_subst_vars\" | sed 's/.*/&!$&$ac_delim/' &&\n  echo \"_ACEOF\"\n} >conf$$subs.sh ||\n  as_fn_error $? \"could not make $CONFIG_STATUS\" \"$LINENO\" 5\nac_delim_num=`echo \"$ac_subst_vars\" | grep -c '^'`\nac_delim='%!_!# '\nfor ac_last_try in false false false false false :; do\n  . ./conf$$subs.sh ||\n    as_fn_error $? \"could not make $CONFIG_STATUS\" \"$LINENO\" 5\n\n  ac_delim_n=`sed -n \"s/.*$ac_delim\\$/X/p\" conf$$subs.awk | grep -c X`\n  if test $ac_delim_n = $ac_delim_num; then\n    break\n  elif $ac_last_try; then\n    as_fn_error $? \"could not make $CONFIG_STATUS\" \"$LINENO\" 5\n  else\n    ac_delim=\"$ac_delim!$ac_delim _$ac_delim!! \"\n  fi\ndone\nrm -f conf$$subs.sh\n\ncat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1\ncat >>\"\\$ac_tmp/subs1.awk\" <<\\\\_ACAWK &&\n_ACEOF\nsed -n '\nh\ns/^/S[\"/; s/!.*/\"]=/\np\ng\ns/^[^!]*!//\n:repl\nt repl\ns/'\"$ac_delim\"'$//\nt delim\n:nl\nh\ns/\\(.\\{148\\}\\)..*/\\1/\nt more1\ns/[\"\\\\]/\\\\&/g; s/^/\"/; s/$/\\\\n\"\\\\/\np\nn\nb repl\n:more1\ns/[\"\\\\]/\\\\&/g; s/^/\"/; s/$/\"\\\\/\np\ng\ns/.\\{148\\}//\nt nl\n:delim\nh\ns/\\(.\\{148\\}\\)..*/\\1/\nt more2\ns/[\"\\\\]/\\\\&/g; s/^/\"/; s/$/\"/\np\nb\n:more2\ns/[\"\\\\]/\\\\&/g; s/^/\"/; s/$/\"\\\\/\np\ng\ns/.\\{148\\}//\nt delim\n' <conf$$subs.awk | sed '\n/^[^\"\"]/{\n  N\n  s/\\n//\n}\n' >>$CONFIG_STATUS || ac_write_fail=1\nrm -f conf$$subs.awk\ncat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1\n_ACAWK\ncat >>\"\\$ac_tmp/subs1.awk\" <<_ACAWK &&\n  for (key in S) S_is_set[key] = 1\n  FS = \"\u0007\"\n\n}\n{\n  line = $ 0\n  nfields = split(line, field, \"@\")\n  substed = 0\n  len = length(field[1])\n  for (i = 2; i < nfields; i++) {\n    key = field[i]\n    keylen = length(key)\n    if (S_is_set[key]) {\n      value = S[key]\n      line = substr(line, 1, len) \"\" value \"\" substr(line, len + keylen + 3)\n      len += length(value) + length(field[++i])\n      substed = 1\n    } else\n      len += 1 + keylen\n  }\n\n  print line\n}\n\n_ACAWK\n_ACEOF\ncat >>$CONFIG_STATUS <<\\_ACEOF || ac_write_fail=1\nif sed \"s/$ac_cr//\" < /dev/null > /dev/null 2>&1; then\n  sed \"s/$ac_cr\\$//; s/$ac_cr/$ac_cs_awk_cr/g\"\nelse\n  cat\nfi < \"$ac_tmp/subs1.awk\" > \"$ac_tmp/subs.awk\" \\\n  || as_fn_error $? \"could not setup config files machinery\" \"$LINENO\" 5\n_ACEOF\n\n# VPATH may cause trouble with some makes, so we remove sole $(srcdir),\n# ${srcdir} and @srcdir@ entries from VPATH if srcdir is \".\", strip leading and\n# trailing colons and then remove the whole line if VPATH becomes empty\n# (actually we leave an empty line to preserve line numbers).\nif test \"x$srcdir\" = x.; then\n  ac_vpsub='/^[\t ]*VPATH[\t ]*=[\t ]*/{\nh\ns///\ns/^/:/\ns/[\t ]*$/:/\ns/:\\$(srcdir):/:/g\ns/:\\${srcdir}:/:/g\ns/:@srcdir@:/:/g\ns/^:*//\ns/:*$//\nx\ns/\\(=[\t ]*\\).*/\\1/\nG\ns/\\n//\ns/^[^=]*=[\t ]*$//\n}'\nfi\n\ncat >>$CONFIG_STATUS <<\\_ACEOF || ac_write_fail=1\nfi # test -n \"$CONFIG_FILES\"\n\n# Set up the scripts for CONFIG_HEADERS section.\n# No need to generate them if there are no CONFIG_HEADERS.\n# This happens for instance with `./config.status Makefile'.\nif test -n \"$CONFIG_HEADERS\"; then\ncat >\"$ac_tmp/defines.awk\" <<\\_ACAWK ||\nBEGIN {\n_ACEOF\n\n# Transform confdefs.h into an awk script `defines.awk', embedded as\n# here-document in config.status, that substitutes the proper values into\n# config.h.in to produce config.h.\n\n# Create a delimiter string that does not exist in confdefs.h, to ease\n# handling of long lines.\nac_delim='%!_!# '\nfor ac_last_try in false false :; do\n  ac_tt=`sed -n \"/$ac_delim/p\" confdefs.h`\n  if test -z \"$ac_tt\"; then\n    break\n  elif $ac_last_try; then\n    as_fn_error $? \"could not make $CONFIG_HEADERS\" \"$LINENO\" 5\n  else\n    ac_delim=\"$ac_delim!$ac_delim _$ac_delim!! \"\n  fi\ndone\n\n# For the awk script, D is an array of macro values keyed by name,\n# likewise P contains macro parameters if any.  Preserve backslash\n# newline sequences.\n\nac_word_re=[_$as_cr_Letters][_$as_cr_alnum]*\nsed -n '\ns/.\\{148\\}/&'\"$ac_delim\"'/g\nt rset\n:rset\ns/^[\t ]*#[\t ]*define[\t ][\t ]*/ /\nt def\nd\n:def\ns/\\\\$//\nt bsnl\ns/[\"\\\\]/\\\\&/g\ns/^ \\('\"$ac_word_re\"'\\)\\(([^()]*)\\)[\t ]*\\(.*\\)/P[\"\\1\"]=\"\\2\"\\\nD[\"\\1\"]=\" \\3\"/p\ns/^ \\('\"$ac_word_re\"'\\)[\t ]*\\(.*\\)/D[\"\\1\"]=\" \\2\"/p\nd\n:bsnl\ns/[\"\\\\]/\\\\&/g\ns/^ \\('\"$ac_word_re\"'\\)\\(([^()]*)\\)[\t ]*\\(.*\\)/P[\"\\1\"]=\"\\2\"\\\nD[\"\\1\"]=\" \\3\\\\\\\\\\\\n\"\\\\/p\nt cont\ns/^ \\('\"$ac_word_re\"'\\)[\t ]*\\(.*\\)/D[\"\\1\"]=\" \\2\\\\\\\\\\\\n\"\\\\/p\nt cont\nd\n:cont\nn\ns/.\\{148\\}/&'\"$ac_delim\"'/g\nt clear\n:clear\ns/\\\\$//\nt bsnlc\ns/[\"\\\\]/\\\\&/g; s/^/\"/; s/$/\"/p\nd\n:bsnlc\ns/[\"\\\\]/\\\\&/g; s/^/\"/; s/$/\\\\\\\\\\\\n\"\\\\/p\nb cont\n' <confdefs.h | sed '\ns/'\"$ac_delim\"'/\"\\\\\\\n\"/g' >>$CONFIG_STATUS || ac_write_fail=1\n\ncat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1\n  for (key in D) D_is_set[key] = 1\n  FS = \"\u0007\"\n}\n/^[\\t ]*#[\\t ]*(define|undef)[\\t ]+$ac_word_re([\\t (]|\\$)/ {\n  line = \\$ 0\n  split(line, arg, \" \")\n  if (arg[1] == \"#\") {\n    defundef = arg[2]\n    mac1 = arg[3]\n  } else {\n    defundef = substr(arg[1], 2)\n    mac1 = arg[2]\n  }\n  split(mac1, mac2, \"(\") #)\n  macro = mac2[1]\n  prefix = substr(line, 1, index(line, defundef) - 1)\n  if (D_is_set[macro]) {\n    # Preserve the white space surrounding the \"#\".\n    print prefix \"define\", macro P[macro] D[macro]\n    next\n  } else {\n    # Replace #undef with comments.  This is necessary, for example,\n    # in the case of _POSIX_SOURCE, which is predefined and required\n    # on some systems where configure will not decide to define it.\n    if (defundef == \"undef\") {\n      print \"/*\", prefix defundef, macro, \"*/\"\n      next\n    }\n  }\n}\n{ print }\n_ACAWK\n_ACEOF\ncat >>$CONFIG_STATUS <<\\_ACEOF || ac_write_fail=1\n  as_fn_error $? \"could not setup config headers machinery\" \"$LINENO\" 5\nfi # test -n \"$CONFIG_HEADERS\"\n\n\neval set X \"  :F $CONFIG_FILES  :H $CONFIG_HEADERS    :C $CONFIG_COMMANDS\"\nshift\nfor ac_tag\ndo\n  case $ac_tag in\n  :[FHLC]) ac_mode=$ac_tag; continue;;\n  esac\n  case $ac_mode$ac_tag in\n  :[FHL]*:*);;\n  :L* | :C*:*) as_fn_error $? \"invalid tag \\`$ac_tag'\" \"$LINENO\" 5;;\n  :[FH]-) ac_tag=-:-;;\n  :[FH]*) ac_tag=$ac_tag:$ac_tag.in;;\n  esac\n  ac_save_IFS=$IFS\n  IFS=:\n  set x $ac_tag\n  IFS=$ac_save_IFS\n  shift\n  ac_file=$1\n  shift\n\n  case $ac_mode in\n  :L) ac_source=$1;;\n  :[FH])\n    ac_file_inputs=\n    for ac_f\n    do\n      case $ac_f in\n      -) ac_f=\"$ac_tmp/stdin\";;\n      *) # Look for the file first in the build tree, then in the source tree\n\t # (if the path is not absolute).  The absolute path cannot be DOS-style,\n\t # because $ac_f cannot contain `:'.\n\t test -f \"$ac_f\" ||\n\t   case $ac_f in\n\t   [\\\\/$]*) false;;\n\t   *) test -f \"$srcdir/$ac_f\" && ac_f=\"$srcdir/$ac_f\";;\n\t   esac ||\n\t   as_fn_error 1 \"cannot find input file: \\`$ac_f'\" \"$LINENO\" 5;;\n      esac\n      case $ac_f in *\\'*) ac_f=`$as_echo \"$ac_f\" | sed \"s/'/'\\\\\\\\\\\\\\\\''/g\"`;; esac\n      as_fn_append ac_file_inputs \" '$ac_f'\"\n    done\n\n    # Let's still pretend it is `configure' which instantiates (i.e., don't\n    # use $as_me), people would be surprised to read:\n    #    /* config.h.  Generated by config.status.  */\n    configure_input='Generated from '`\n\t  $as_echo \"$*\" | sed 's|^[^:]*/||;s|:[^:]*/|, |g'\n\t`' by configure.'\n    if test x\"$ac_file\" != x-; then\n      configure_input=\"$ac_file.  $configure_input\"\n      { $as_echo \"$as_me:${as_lineno-$LINENO}: creating $ac_file\" >&5\n$as_echo \"$as_me: creating $ac_file\" >&6;}\n    fi\n    # Neutralize special characters interpreted by sed in replacement strings.\n    case $configure_input in #(\n    *\\&* | *\\|* | *\\\\* )\n       ac_sed_conf_input=`$as_echo \"$configure_input\" |\n       sed 's/[\\\\\\\\&|]/\\\\\\\\&/g'`;; #(\n    *) ac_sed_conf_input=$configure_input;;\n    esac\n\n    case $ac_tag in\n    *:-:* | *:-) cat >\"$ac_tmp/stdin\" \\\n      || as_fn_error $? \"could not create $ac_file\" \"$LINENO\" 5 ;;\n    esac\n    ;;\n  esac\n\n  ac_dir=`$as_dirname -- \"$ac_file\" ||\n$as_expr X\"$ac_file\" : 'X\\(.*[^/]\\)//*[^/][^/]*/*$' \\| \\\n\t X\"$ac_file\" : 'X\\(//\\)[^/]' \\| \\\n\t X\"$ac_file\" : 'X\\(//\\)$' \\| \\\n\t X\"$ac_file\" : 'X\\(/\\)' \\| . 2>/dev/null ||\n$as_echo X\"$ac_file\" |\n    sed '/^X\\(.*[^/]\\)\\/\\/*[^/][^/]*\\/*$/{\n\t    s//\\1/\n\t    q\n\t  }\n\t  /^X\\(\\/\\/\\)[^/].*/{\n\t    s//\\1/\n\t    q\n\t  }\n\t  /^X\\(\\/\\/\\)$/{\n\t    s//\\1/\n\t    q\n\t  }\n\t  /^X\\(\\/\\).*/{\n\t    s//\\1/\n\t    q\n\t  }\n\t  s/.*/./; q'`\n  as_dir=\"$ac_dir\"; as_fn_mkdir_p\n  ac_builddir=.\n\ncase \"$ac_dir\" in\n.) ac_dir_suffix= ac_top_builddir_sub=. ac_top_build_prefix= ;;\n*)\n  ac_dir_suffix=/`$as_echo \"$ac_dir\" | sed 's|^\\.[\\\\/]||'`\n  # A \"..\" for each directory in $ac_dir_suffix.\n  ac_top_builddir_sub=`$as_echo \"$ac_dir_suffix\" | sed 's|/[^\\\\/]*|/..|g;s|/||'`\n  case $ac_top_builddir_sub in\n  \"\") ac_top_builddir_sub=. ac_top_build_prefix= ;;\n  *)  ac_top_build_prefix=$ac_top_builddir_sub/ ;;\n  esac ;;\nesac\nac_abs_top_builddir=$ac_pwd\nac_abs_builddir=$ac_pwd$ac_dir_suffix\n# for backward compatibility:\nac_top_builddir=$ac_top_build_prefix\n\ncase $srcdir in\n  .)  # We are building in place.\n    ac_srcdir=.\n    ac_top_srcdir=$ac_top_builddir_sub\n    ac_abs_top_srcdir=$ac_pwd ;;\n  [\\\\/]* | ?:[\\\\/]* )  # Absolute name.\n    ac_srcdir=$srcdir$ac_dir_suffix;\n    ac_top_srcdir=$srcdir\n    ac_abs_top_srcdir=$srcdir ;;\n  *) # Relative name.\n    ac_srcdir=$ac_top_build_prefix$srcdir$ac_dir_suffix\n    ac_top_srcdir=$ac_top_build_prefix$srcdir\n    ac_abs_top_srcdir=$ac_pwd/$srcdir ;;\nesac\nac_abs_srcdir=$ac_abs_top_srcdir$ac_dir_suffix\n\n\n  case $ac_mode in\n  :F)\n  #\n  # CONFIG_FILE\n  #\n\n  case $INSTALL in\n  [\\\\/$]* | ?:[\\\\/]* ) ac_INSTALL=$INSTALL ;;\n  *) ac_INSTALL=$ac_top_build_prefix$INSTALL ;;\n  esac\n  ac_MKDIR_P=$MKDIR_P\n  case $MKDIR_P in\n  [\\\\/$]* | ?:[\\\\/]* ) ;;\n  */*) ac_MKDIR_P=$ac_top_build_prefix$MKDIR_P ;;\n  esac\n_ACEOF\n\ncat >>$CONFIG_STATUS <<\\_ACEOF || ac_write_fail=1\n# If the template does not know about datarootdir, expand it.\n# FIXME: This hack should be removed a few years after 2.60.\nac_datarootdir_hack=; ac_datarootdir_seen=\nac_sed_dataroot='\n/datarootdir/ {\n  p\n  q\n}\n/@datadir@/p\n/@docdir@/p\n/@infodir@/p\n/@localedir@/p\n/@mandir@/p'\ncase `eval \"sed -n \\\"\\$ac_sed_dataroot\\\" $ac_file_inputs\"` in\n*datarootdir*) ac_datarootdir_seen=yes;;\n*@datadir@*|*@docdir@*|*@infodir@*|*@localedir@*|*@mandir@*)\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: WARNING: $ac_file_inputs seems to ignore the --datarootdir setting\" >&5\n$as_echo \"$as_me: WARNING: $ac_file_inputs seems to ignore the --datarootdir setting\" >&2;}\n_ACEOF\ncat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1\n  ac_datarootdir_hack='\n  s&@datadir@&$datadir&g\n  s&@docdir@&$docdir&g\n  s&@infodir@&$infodir&g\n  s&@localedir@&$localedir&g\n  s&@mandir@&$mandir&g\n  s&\\\\\\${datarootdir}&$datarootdir&g' ;;\nesac\n_ACEOF\n\n# Neutralize VPATH when `$srcdir' = `.'.\n# Shell code in configure.ac might set extrasub.\n# FIXME: do we really want to maintain this feature?\ncat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1\nac_sed_extra=\"$ac_vpsub\n$extrasub\n_ACEOF\ncat >>$CONFIG_STATUS <<\\_ACEOF || ac_write_fail=1\n:t\n/@[a-zA-Z_][a-zA-Z_0-9]*@/!b\ns|@configure_input@|$ac_sed_conf_input|;t t\ns&@top_builddir@&$ac_top_builddir_sub&;t t\ns&@top_build_prefix@&$ac_top_build_prefix&;t t\ns&@srcdir@&$ac_srcdir&;t t\ns&@abs_srcdir@&$ac_abs_srcdir&;t t\ns&@top_srcdir@&$ac_top_srcdir&;t t\ns&@abs_top_srcdir@&$ac_abs_top_srcdir&;t t\ns&@builddir@&$ac_builddir&;t t\ns&@abs_builddir@&$ac_abs_builddir&;t t\ns&@abs_top_builddir@&$ac_abs_top_builddir&;t t\ns&@INSTALL@&$ac_INSTALL&;t t\ns&@MKDIR_P@&$ac_MKDIR_P&;t t\n$ac_datarootdir_hack\n\"\neval sed \\\"\\$ac_sed_extra\\\" \"$ac_file_inputs\" | $AWK -f \"$ac_tmp/subs.awk\" \\\n  >$ac_tmp/out || as_fn_error $? \"could not create $ac_file\" \"$LINENO\" 5\n\ntest -z \"$ac_datarootdir_hack$ac_datarootdir_seen\" &&\n  { ac_out=`sed -n '/\\${datarootdir}/p' \"$ac_tmp/out\"`; test -n \"$ac_out\"; } &&\n  { ac_out=`sed -n '/^[\t ]*datarootdir[\t ]*:*=/p' \\\n      \"$ac_tmp/out\"`; test -z \"$ac_out\"; } &&\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: WARNING: $ac_file contains a reference to the variable \\`datarootdir'\nwhich seems to be undefined.  Please make sure it is defined\" >&5\n$as_echo \"$as_me: WARNING: $ac_file contains a reference to the variable \\`datarootdir'\nwhich seems to be undefined.  Please make sure it is defined\" >&2;}\n\n  rm -f \"$ac_tmp/stdin\"\n  case $ac_file in\n  -) cat \"$ac_tmp/out\" && rm -f \"$ac_tmp/out\";;\n  *) rm -f \"$ac_file\" && mv \"$ac_tmp/out\" \"$ac_file\";;\n  esac \\\n  || as_fn_error $? \"could not create $ac_file\" \"$LINENO\" 5\n ;;\n  :H)\n  #\n  # CONFIG_HEADER\n  #\n  if test x\"$ac_file\" != x-; then\n    {\n      $as_echo \"/* $configure_input  */\" \\\n      && eval '$AWK -f \"$ac_tmp/defines.awk\"' \"$ac_file_inputs\"\n    } >\"$ac_tmp/config.h\" \\\n      || as_fn_error $? \"could not create $ac_file\" \"$LINENO\" 5\n    if diff \"$ac_file\" \"$ac_tmp/config.h\" >/dev/null 2>&1; then\n      { $as_echo \"$as_me:${as_lineno-$LINENO}: $ac_file is unchanged\" >&5\n$as_echo \"$as_me: $ac_file is unchanged\" >&6;}\n    else\n      rm -f \"$ac_file\"\n      mv \"$ac_tmp/config.h\" \"$ac_file\" \\\n\t|| as_fn_error $? \"could not create $ac_file\" \"$LINENO\" 5\n    fi\n  else\n    $as_echo \"/* $configure_input  */\" \\\n      && eval '$AWK -f \"$ac_tmp/defines.awk\"' \"$ac_file_inputs\" \\\n      || as_fn_error $? \"could not create -\" \"$LINENO\" 5\n  fi\n# Compute \"$ac_file\"'s index in $config_headers.\n_am_arg=\"$ac_file\"\n_am_stamp_count=1\nfor _am_header in $config_headers :; do\n  case $_am_header in\n    $_am_arg | $_am_arg:* )\n      break ;;\n    * )\n      _am_stamp_count=`expr $_am_stamp_count + 1` ;;\n  esac\ndone\necho \"timestamp for $_am_arg\" >`$as_dirname -- \"$_am_arg\" ||\n$as_expr X\"$_am_arg\" : 'X\\(.*[^/]\\)//*[^/][^/]*/*$' \\| \\\n\t X\"$_am_arg\" : 'X\\(//\\)[^/]' \\| \\\n\t X\"$_am_arg\" : 'X\\(//\\)$' \\| \\\n\t X\"$_am_arg\" : 'X\\(/\\)' \\| . 2>/dev/null ||\n$as_echo X\"$_am_arg\" |\n    sed '/^X\\(.*[^/]\\)\\/\\/*[^/][^/]*\\/*$/{\n\t    s//\\1/\n\t    q\n\t  }\n\t  /^X\\(\\/\\/\\)[^/].*/{\n\t    s//\\1/\n\t    q\n\t  }\n\t  /^X\\(\\/\\/\\)$/{\n\t    s//\\1/\n\t    q\n\t  }\n\t  /^X\\(\\/\\).*/{\n\t    s//\\1/\n\t    q\n\t  }\n\t  s/.*/./; q'`/stamp-h$_am_stamp_count\n ;;\n\n  :C)  { $as_echo \"$as_me:${as_lineno-$LINENO}: executing $ac_file commands\" >&5\n$as_echo \"$as_me: executing $ac_file commands\" >&6;}\n ;;\n  esac\n\n\n  case $ac_file$ac_mode in\n    \"depfiles\":C) test x\"$AMDEP_TRUE\" != x\"\" || {\n  # Older Autoconf quotes --file arguments for eval, but not when files\n  # are listed without --file.  Let's play safe and only enable the eval\n  # if we detect the quoting.\n  case $CONFIG_FILES in\n  *\\'*) eval set x \"$CONFIG_FILES\" ;;\n  *)   set x $CONFIG_FILES ;;\n  esac\n  shift\n  for mf\n  do\n    # Strip MF so we end up with the name of the file.\n    mf=`echo \"$mf\" | sed -e 's/:.*$//'`\n    # Check whether this is an Automake generated Makefile or not.\n    # We used to match only the files named 'Makefile.in', but\n    # some people rename them; so instead we look at the file content.\n    # Grep'ing the first line is not enough: some people post-process\n    # each Makefile.in and add a new line on top of each file to say so.\n    # Grep'ing the whole file is not good either: AIX grep has a line\n    # limit of 2048, but all sed's we know have understand at least 4000.\n    if sed -n 's,^#.*generated by automake.*,X,p' \"$mf\" | grep X >/dev/null 2>&1; then\n      dirpart=`$as_dirname -- \"$mf\" ||\n$as_expr X\"$mf\" : 'X\\(.*[^/]\\)//*[^/][^/]*/*$' \\| \\\n\t X\"$mf\" : 'X\\(//\\)[^/]' \\| \\\n\t X\"$mf\" : 'X\\(//\\)$' \\| \\\n\t X\"$mf\" : 'X\\(/\\)' \\| . 2>/dev/null ||\n$as_echo X\"$mf\" |\n    sed '/^X\\(.*[^/]\\)\\/\\/*[^/][^/]*\\/*$/{\n\t    s//\\1/\n\t    q\n\t  }\n\t  /^X\\(\\/\\/\\)[^/].*/{\n\t    s//\\1/\n\t    q\n\t  }\n\t  /^X\\(\\/\\/\\)$/{\n\t    s//\\1/\n\t    q\n\t  }\n\t  /^X\\(\\/\\).*/{\n\t    s//\\1/\n\t    q\n\t  }\n\t  s/.*/./; q'`\n    else\n      continue\n    fi\n    # Extract the definition of DEPDIR, am__include, and am__quote\n    # from the Makefile without running 'make'.\n    DEPDIR=`sed -n 's/^DEPDIR = //p' < \"$mf\"`\n    test -z \"$DEPDIR\" && continue\n    am__include=`sed -n 's/^am__include = //p' < \"$mf\"`\n    test -z \"$am__include\" && continue\n    am__quote=`sed -n 's/^am__quote = //p' < \"$mf\"`\n    # Find all dependency output files, they are included files with\n    # $(DEPDIR) in their names.  We invoke sed twice because it is the\n    # simplest approach to changing $(DEPDIR) to its actual value in the\n    # expansion.\n    for file in `sed -n \"\n      s/^$am__include $am__quote\\(.*(DEPDIR).*\\)$am__quote\"'$/\\1/p' <\"$mf\" | \\\n\t sed -e 's/\\$(DEPDIR)/'\"$DEPDIR\"'/g'`; do\n      # Make sure the directory exists.\n      test -f \"$dirpart/$file\" && continue\n      fdir=`$as_dirname -- \"$file\" ||\n$as_expr X\"$file\" : 'X\\(.*[^/]\\)//*[^/][^/]*/*$' \\| \\\n\t X\"$file\" : 'X\\(//\\)[^/]' \\| \\\n\t X\"$file\" : 'X\\(//\\)$' \\| \\\n\t X\"$file\" : 'X\\(/\\)' \\| . 2>/dev/null ||\n$as_echo X\"$file\" |\n    sed '/^X\\(.*[^/]\\)\\/\\/*[^/][^/]*\\/*$/{\n\t    s//\\1/\n\t    q\n\t  }\n\t  /^X\\(\\/\\/\\)[^/].*/{\n\t    s//\\1/\n\t    q\n\t  }\n\t  /^X\\(\\/\\/\\)$/{\n\t    s//\\1/\n\t    q\n\t  }\n\t  /^X\\(\\/\\).*/{\n\t    s//\\1/\n\t    q\n\t  }\n\t  s/.*/./; q'`\n      as_dir=$dirpart/$fdir; as_fn_mkdir_p\n      # echo \"creating $dirpart/$file\"\n      echo '# dummy' > \"$dirpart/$file\"\n    done\n  done\n}\n ;;\n    \"libtool\":C)\n\n    # See if we are running on zsh, and set the options which allow our\n    # commands through without removal of \\ escapes.\n    if test -n \"${ZSH_VERSION+set}\" ; then\n      setopt NO_GLOB_SUBST\n    fi\n\n    cfgfile=\"${ofile}T\"\n    trap \"$RM \\\"$cfgfile\\\"; exit 1\" 1 2 15\n    $RM \"$cfgfile\"\n\n    cat <<_LT_EOF >> \"$cfgfile\"\n#! $SHELL\n\n# `$ECHO \"$ofile\" | sed 's%^.*/%%'` - Provide generalized library-building support services.\n# Generated automatically by $as_me ($PACKAGE$TIMESTAMP) $VERSION\n# Libtool was configured on host `(hostname || uname -n) 2>/dev/null | sed 1q`:\n# NOTE: Changes made to this file will be lost: look at ltmain.sh.\n#\n#   Copyright (C) 1996, 1997, 1998, 1999, 2000, 2001, 2003, 2004, 2005,\n#                 2006, 2007, 2008, 2009, 2010, 2011 Free Software\n#                 Foundation, Inc.\n#   Written by Gordon Matzigkeit, 1996\n#\n#   This file is part of GNU Libtool.\n#\n# GNU Libtool is free software; you can redistribute it and/or\n# modify it under the terms of the GNU General Public License as\n# published by the Free Software Foundation; either version 2 of\n# the License, or (at your option) any later version.\n#\n# As a special exception to the GNU General Public License,\n# if you distribute this file as part of a program or library that\n# is built using GNU Libtool, you may include this file under the\n# same distribution terms that you use for the rest of that program.\n#\n# GNU Libtool is distributed in the hope that it will be useful,\n# but WITHOUT ANY WARRANTY; without even the implied warranty of\n# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n# GNU General Public License for more details.\n#\n# You should have received a copy of the GNU General Public License\n# along with GNU Libtool; see the file COPYING.  If not, a copy\n# can be downloaded from http://www.gnu.org/licenses/gpl.html, or\n# obtained by writing to the Free Software Foundation, Inc.,\n# 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.\n\n\n# The names of the tagged configurations supported by this script.\navailable_tags=\"CXX \"\n\n# ### BEGIN LIBTOOL CONFIG\n\n# Whether or not to build static libraries.\nbuild_old_libs=$enable_static\n\n# Which release of libtool.m4 was used?\nmacro_version=$macro_version\nmacro_revision=$macro_revision\n\n# Whether or not to build shared libraries.\nbuild_libtool_libs=$enable_shared\n\n# What type of objects to build.\npic_mode=$pic_mode\n\n# Whether or not to optimize for fast installation.\nfast_install=$enable_fast_install\n\n# Shell to use when invoking shell scripts.\nSHELL=$lt_SHELL\n\n# An echo program that protects backslashes.\nECHO=$lt_ECHO\n\n# The PATH separator for the build system.\nPATH_SEPARATOR=$lt_PATH_SEPARATOR\n\n# The host system.\nhost_alias=$host_alias\nhost=$host\nhost_os=$host_os\n\n# The build system.\nbuild_alias=$build_alias\nbuild=$build\nbuild_os=$build_os\n\n# A sed program that does not truncate output.\nSED=$lt_SED\n\n# Sed that helps us avoid accidentally triggering echo(1) options like -n.\nXsed=\"\\$SED -e 1s/^X//\"\n\n# A grep program that handles long lines.\nGREP=$lt_GREP\n\n# An ERE matcher.\nEGREP=$lt_EGREP\n\n# A literal string matcher.\nFGREP=$lt_FGREP\n\n# A BSD- or MS-compatible name lister.\nNM=$lt_NM\n\n# Whether we need soft or hard links.\nLN_S=$lt_LN_S\n\n# What is the maximum length of a command?\nmax_cmd_len=$max_cmd_len\n\n# Object file suffix (normally \"o\").\nobjext=$ac_objext\n\n# Executable file suffix (normally \"\").\nexeext=$exeext\n\n# whether the shell understands \"unset\".\nlt_unset=$lt_unset\n\n# turn spaces into newlines.\nSP2NL=$lt_lt_SP2NL\n\n# turn newlines into spaces.\nNL2SP=$lt_lt_NL2SP\n\n# convert \\$build file names to \\$host format.\nto_host_file_cmd=$lt_cv_to_host_file_cmd\n\n# convert \\$build files to toolchain format.\nto_tool_file_cmd=$lt_cv_to_tool_file_cmd\n\n# An object symbol dumper.\nOBJDUMP=$lt_OBJDUMP\n\n# Method to check whether dependent libraries are shared objects.\ndeplibs_check_method=$lt_deplibs_check_method\n\n# Command to use when deplibs_check_method = \"file_magic\".\nfile_magic_cmd=$lt_file_magic_cmd\n\n# How to find potential files when deplibs_check_method = \"file_magic\".\nfile_magic_glob=$lt_file_magic_glob\n\n# Find potential files using nocaseglob when deplibs_check_method = \"file_magic\".\nwant_nocaseglob=$lt_want_nocaseglob\n\n# DLL creation program.\nDLLTOOL=$lt_DLLTOOL\n\n# Command to associate shared and link libraries.\nsharedlib_from_linklib_cmd=$lt_sharedlib_from_linklib_cmd\n\n# The archiver.\nAR=$lt_AR\n\n# Flags to create an archive.\nAR_FLAGS=$lt_AR_FLAGS\n\n# How to feed a file listing to the archiver.\narchiver_list_spec=$lt_archiver_list_spec\n\n# A symbol stripping program.\nSTRIP=$lt_STRIP\n\n# Commands used to install an old-style archive.\nRANLIB=$lt_RANLIB\nold_postinstall_cmds=$lt_old_postinstall_cmds\nold_postuninstall_cmds=$lt_old_postuninstall_cmds\n\n# Whether to use a lock for old archive extraction.\nlock_old_archive_extraction=$lock_old_archive_extraction\n\n# A C compiler.\nLTCC=$lt_CC\n\n# LTCC compiler flags.\nLTCFLAGS=$lt_CFLAGS\n\n# Take the output of nm and produce a listing of raw symbols and C names.\nglobal_symbol_pipe=$lt_lt_cv_sys_global_symbol_pipe\n\n# Transform the output of nm in a proper C declaration.\nglobal_symbol_to_cdecl=$lt_lt_cv_sys_global_symbol_to_cdecl\n\n# Transform the output of nm in a C name address pair.\nglobal_symbol_to_c_name_address=$lt_lt_cv_sys_global_symbol_to_c_name_address\n\n# Transform the output of nm in a C name address pair when lib prefix is needed.\nglobal_symbol_to_c_name_address_lib_prefix=$lt_lt_cv_sys_global_symbol_to_c_name_address_lib_prefix\n\n# Specify filename containing input files for \\$NM.\nnm_file_list_spec=$lt_nm_file_list_spec\n\n# The root where to search for dependent libraries,and in which our libraries should be installed.\nlt_sysroot=$lt_sysroot\n\n# The name of the directory that contains temporary libtool files.\nobjdir=$objdir\n\n# Used to examine libraries when file_magic_cmd begins with \"file\".\nMAGIC_CMD=$MAGIC_CMD\n\n# Must we lock files when doing compilation?\nneed_locks=$lt_need_locks\n\n# Manifest tool.\nMANIFEST_TOOL=$lt_MANIFEST_TOOL\n\n# Tool to manipulate archived DWARF debug symbol files on Mac OS X.\nDSYMUTIL=$lt_DSYMUTIL\n\n# Tool to change global to local symbols on Mac OS X.\nNMEDIT=$lt_NMEDIT\n\n# Tool to manipulate fat objects and archives on Mac OS X.\nLIPO=$lt_LIPO\n\n# ldd/readelf like tool for Mach-O binaries on Mac OS X.\nOTOOL=$lt_OTOOL\n\n# ldd/readelf like tool for 64 bit Mach-O binaries on Mac OS X 10.4.\nOTOOL64=$lt_OTOOL64\n\n# Old archive suffix (normally \"a\").\nlibext=$libext\n\n# Shared library suffix (normally \".so\").\nshrext_cmds=$lt_shrext_cmds\n\n# The commands to extract the exported symbol list from a shared archive.\nextract_expsyms_cmds=$lt_extract_expsyms_cmds\n\n# Variables whose values should be saved in libtool wrapper scripts and\n# restored at link time.\nvariables_saved_for_relink=$lt_variables_saved_for_relink\n\n# Do we need the \"lib\" prefix for modules?\nneed_lib_prefix=$need_lib_prefix\n\n# Do we need a version for libraries?\nneed_version=$need_version\n\n# Library versioning type.\nversion_type=$version_type\n\n# Shared library runtime path variable.\nrunpath_var=$runpath_var\n\n# Shared library path variable.\nshlibpath_var=$shlibpath_var\n\n# Is shlibpath searched before the hard-coded library search path?\nshlibpath_overrides_runpath=$shlibpath_overrides_runpath\n\n# Format of library name prefix.\nlibname_spec=$lt_libname_spec\n\n# List of archive names.  First name is the real one, the rest are links.\n# The last name is the one that the linker finds with -lNAME\nlibrary_names_spec=$lt_library_names_spec\n\n# The coded name of the library, if different from the real name.\nsoname_spec=$lt_soname_spec\n\n# Permission mode override for installation of shared libraries.\ninstall_override_mode=$lt_install_override_mode\n\n# Command to use after installation of a shared archive.\npostinstall_cmds=$lt_postinstall_cmds\n\n# Command to use after uninstallation of a shared archive.\npostuninstall_cmds=$lt_postuninstall_cmds\n\n# Commands used to finish a libtool library installation in a directory.\nfinish_cmds=$lt_finish_cmds\n\n# As \"finish_cmds\", except a single script fragment to be evaled but\n# not shown.\nfinish_eval=$lt_finish_eval\n\n# Whether we should hardcode library paths into libraries.\nhardcode_into_libs=$hardcode_into_libs\n\n# Compile-time system search path for libraries.\nsys_lib_search_path_spec=$lt_sys_lib_search_path_spec\n\n# Run-time system search path for libraries.\nsys_lib_dlsearch_path_spec=$lt_sys_lib_dlsearch_path_spec\n\n# Whether dlopen is supported.\ndlopen_support=$enable_dlopen\n\n# Whether dlopen of programs is supported.\ndlopen_self=$enable_dlopen_self\n\n# Whether dlopen of statically linked programs is supported.\ndlopen_self_static=$enable_dlopen_self_static\n\n# Commands to strip libraries.\nold_striplib=$lt_old_striplib\nstriplib=$lt_striplib\n\n\n# The linker used to build libraries.\nLD=$lt_LD\n\n# How to create reloadable object files.\nreload_flag=$lt_reload_flag\nreload_cmds=$lt_reload_cmds\n\n# Commands used to build an old-style archive.\nold_archive_cmds=$lt_old_archive_cmds\n\n# A language specific compiler.\nCC=$lt_compiler\n\n# Is the compiler the GNU compiler?\nwith_gcc=$GCC\n\n# Compiler flag to turn off builtin functions.\nno_builtin_flag=$lt_lt_prog_compiler_no_builtin_flag\n\n# Additional compiler flags for building library objects.\npic_flag=$lt_lt_prog_compiler_pic\n\n# How to pass a linker flag through the compiler.\nwl=$lt_lt_prog_compiler_wl\n\n# Compiler flag to prevent dynamic linking.\nlink_static_flag=$lt_lt_prog_compiler_static\n\n# Does compiler simultaneously support -c and -o options?\ncompiler_c_o=$lt_lt_cv_prog_compiler_c_o\n\n# Whether or not to add -lc for building shared libraries.\nbuild_libtool_need_lc=$archive_cmds_need_lc\n\n# Whether or not to disallow shared libs when runtime libs are static.\nallow_libtool_libs_with_static_runtimes=$enable_shared_with_static_runtimes\n\n# Compiler flag to allow reflexive dlopens.\nexport_dynamic_flag_spec=$lt_export_dynamic_flag_spec\n\n# Compiler flag to generate shared objects directly from archives.\nwhole_archive_flag_spec=$lt_whole_archive_flag_spec\n\n# Whether the compiler copes with passing no objects directly.\ncompiler_needs_object=$lt_compiler_needs_object\n\n# Create an old-style archive from a shared archive.\nold_archive_from_new_cmds=$lt_old_archive_from_new_cmds\n\n# Create a temporary old-style archive to link instead of a shared archive.\nold_archive_from_expsyms_cmds=$lt_old_archive_from_expsyms_cmds\n\n# Commands used to build a shared archive.\narchive_cmds=$lt_archive_cmds\narchive_expsym_cmds=$lt_archive_expsym_cmds\n\n# Commands used to build a loadable module if different from building\n# a shared archive.\nmodule_cmds=$lt_module_cmds\nmodule_expsym_cmds=$lt_module_expsym_cmds\n\n# Whether we are building with GNU ld or not.\nwith_gnu_ld=$lt_with_gnu_ld\n\n# Flag that allows shared libraries with undefined symbols to be built.\nallow_undefined_flag=$lt_allow_undefined_flag\n\n# Flag that enforces no undefined symbols.\nno_undefined_flag=$lt_no_undefined_flag\n\n# Flag to hardcode \\$libdir into a binary during linking.\n# This must work even if \\$libdir does not exist\nhardcode_libdir_flag_spec=$lt_hardcode_libdir_flag_spec\n\n# Whether we need a single \"-rpath\" flag with a separated argument.\nhardcode_libdir_separator=$lt_hardcode_libdir_separator\n\n# Set to \"yes\" if using DIR/libNAME\\${shared_ext} during linking hardcodes\n# DIR into the resulting binary.\nhardcode_direct=$hardcode_direct\n\n# Set to \"yes\" if using DIR/libNAME\\${shared_ext} during linking hardcodes\n# DIR into the resulting binary and the resulting library dependency is\n# \"absolute\",i.e impossible to change by setting \\${shlibpath_var} if the\n# library is relocated.\nhardcode_direct_absolute=$hardcode_direct_absolute\n\n# Set to \"yes\" if using the -LDIR flag during linking hardcodes DIR\n# into the resulting binary.\nhardcode_minus_L=$hardcode_minus_L\n\n# Set to \"yes\" if using SHLIBPATH_VAR=DIR during linking hardcodes DIR\n# into the resulting binary.\nhardcode_shlibpath_var=$hardcode_shlibpath_var\n\n# Set to \"yes\" if building a shared library automatically hardcodes DIR\n# into the library and all subsequent libraries and executables linked\n# against it.\nhardcode_automatic=$hardcode_automatic\n\n# Set to yes if linker adds runtime paths of dependent libraries\n# to runtime path list.\ninherit_rpath=$inherit_rpath\n\n# Whether libtool must link a program against all its dependency libraries.\nlink_all_deplibs=$link_all_deplibs\n\n# Set to \"yes\" if exported symbols are required.\nalways_export_symbols=$always_export_symbols\n\n# The commands to list exported symbols.\nexport_symbols_cmds=$lt_export_symbols_cmds\n\n# Symbols that should not be listed in the preloaded symbols.\nexclude_expsyms=$lt_exclude_expsyms\n\n# Symbols that must always be exported.\ninclude_expsyms=$lt_include_expsyms\n\n# Commands necessary for linking programs (against libraries) with templates.\nprelink_cmds=$lt_prelink_cmds\n\n# Commands necessary for finishing linking programs.\npostlink_cmds=$lt_postlink_cmds\n\n# Specify filename containing input files.\nfile_list_spec=$lt_file_list_spec\n\n# How to hardcode a shared library path into an executable.\nhardcode_action=$hardcode_action\n\n# The directories searched by this compiler when creating a shared library.\ncompiler_lib_search_dirs=$lt_compiler_lib_search_dirs\n\n# Dependencies to place before and after the objects being linked to\n# create a shared library.\npredep_objects=$lt_predep_objects\npostdep_objects=$lt_postdep_objects\npredeps=$lt_predeps\npostdeps=$lt_postdeps\n\n# The library search path used internally by the compiler when linking\n# a shared library.\ncompiler_lib_search_path=$lt_compiler_lib_search_path\n\n# ### END LIBTOOL CONFIG\n\n_LT_EOF\n\n  case $host_os in\n  aix3*)\n    cat <<\\_LT_EOF >> \"$cfgfile\"\n# AIX sometimes has problems with the GCC collect2 program.  For some\n# reason, if we set the COLLECT_NAMES environment variable, the problems\n# vanish in a puff of smoke.\nif test \"X${COLLECT_NAMES+set}\" != Xset; then\n  COLLECT_NAMES=\n  export COLLECT_NAMES\nfi\n_LT_EOF\n    ;;\n  esac\n\n\nltmain=\"$ac_aux_dir/ltmain.sh\"\n\n\n  # We use sed instead of cat because bash on DJGPP gets confused if\n  # if finds mixed CR/LF and LF-only lines.  Since sed operates in\n  # text mode, it properly converts lines to CR/LF.  This bash problem\n  # is reportedly fixed, but why not run on old versions too?\n  sed '$q' \"$ltmain\" >> \"$cfgfile\" \\\n     || (rm -f \"$cfgfile\"; exit 1)\n\n  if test x\"$xsi_shell\" = xyes; then\n  sed -e '/^func_dirname ()$/,/^} # func_dirname /c\\\nfunc_dirname ()\\\n{\\\n\\    case ${1} in\\\n\\      */*) func_dirname_result=\"${1%/*}${2}\" ;;\\\n\\      *  ) func_dirname_result=\"${3}\" ;;\\\n\\    esac\\\n} # Extended-shell func_dirname implementation' \"$cfgfile\" > $cfgfile.tmp \\\n  && mv -f \"$cfgfile.tmp\" \"$cfgfile\" \\\n    || (rm -f \"$cfgfile\" && cp \"$cfgfile.tmp\" \"$cfgfile\" && rm -f \"$cfgfile.tmp\")\ntest 0 -eq $? || _lt_function_replace_fail=:\n\n\n  sed -e '/^func_basename ()$/,/^} # func_basename /c\\\nfunc_basename ()\\\n{\\\n\\    func_basename_result=\"${1##*/}\"\\\n} # Extended-shell func_basename implementation' \"$cfgfile\" > $cfgfile.tmp \\\n  && mv -f \"$cfgfile.tmp\" \"$cfgfile\" \\\n    || (rm -f \"$cfgfile\" && cp \"$cfgfile.tmp\" \"$cfgfile\" && rm -f \"$cfgfile.tmp\")\ntest 0 -eq $? || _lt_function_replace_fail=:\n\n\n  sed -e '/^func_dirname_and_basename ()$/,/^} # func_dirname_and_basename /c\\\nfunc_dirname_and_basename ()\\\n{\\\n\\    case ${1} in\\\n\\      */*) func_dirname_result=\"${1%/*}${2}\" ;;\\\n\\      *  ) func_dirname_result=\"${3}\" ;;\\\n\\    esac\\\n\\    func_basename_result=\"${1##*/}\"\\\n} # Extended-shell func_dirname_and_basename implementation' \"$cfgfile\" > $cfgfile.tmp \\\n  && mv -f \"$cfgfile.tmp\" \"$cfgfile\" \\\n    || (rm -f \"$cfgfile\" && cp \"$cfgfile.tmp\" \"$cfgfile\" && rm -f \"$cfgfile.tmp\")\ntest 0 -eq $? || _lt_function_replace_fail=:\n\n\n  sed -e '/^func_stripname ()$/,/^} # func_stripname /c\\\nfunc_stripname ()\\\n{\\\n\\    # pdksh 5.2.14 does not do ${X%$Y} correctly if both X and Y are\\\n\\    # positional parameters, so assign one to ordinary parameter first.\\\n\\    func_stripname_result=${3}\\\n\\    func_stripname_result=${func_stripname_result#\"${1}\"}\\\n\\    func_stripname_result=${func_stripname_result%\"${2}\"}\\\n} # Extended-shell func_stripname implementation' \"$cfgfile\" > $cfgfile.tmp \\\n  && mv -f \"$cfgfile.tmp\" \"$cfgfile\" \\\n    || (rm -f \"$cfgfile\" && cp \"$cfgfile.tmp\" \"$cfgfile\" && rm -f \"$cfgfile.tmp\")\ntest 0 -eq $? || _lt_function_replace_fail=:\n\n\n  sed -e '/^func_split_long_opt ()$/,/^} # func_split_long_opt /c\\\nfunc_split_long_opt ()\\\n{\\\n\\    func_split_long_opt_name=${1%%=*}\\\n\\    func_split_long_opt_arg=${1#*=}\\\n} # Extended-shell func_split_long_opt implementation' \"$cfgfile\" > $cfgfile.tmp \\\n  && mv -f \"$cfgfile.tmp\" \"$cfgfile\" \\\n    || (rm -f \"$cfgfile\" && cp \"$cfgfile.tmp\" \"$cfgfile\" && rm -f \"$cfgfile.tmp\")\ntest 0 -eq $? || _lt_function_replace_fail=:\n\n\n  sed -e '/^func_split_short_opt ()$/,/^} # func_split_short_opt /c\\\nfunc_split_short_opt ()\\\n{\\\n\\    func_split_short_opt_arg=${1#??}\\\n\\    func_split_short_opt_name=${1%\"$func_split_short_opt_arg\"}\\\n} # Extended-shell func_split_short_opt implementation' \"$cfgfile\" > $cfgfile.tmp \\\n  && mv -f \"$cfgfile.tmp\" \"$cfgfile\" \\\n    || (rm -f \"$cfgfile\" && cp \"$cfgfile.tmp\" \"$cfgfile\" && rm -f \"$cfgfile.tmp\")\ntest 0 -eq $? || _lt_function_replace_fail=:\n\n\n  sed -e '/^func_lo2o ()$/,/^} # func_lo2o /c\\\nfunc_lo2o ()\\\n{\\\n\\    case ${1} in\\\n\\      *.lo) func_lo2o_result=${1%.lo}.${objext} ;;\\\n\\      *)    func_lo2o_result=${1} ;;\\\n\\    esac\\\n} # Extended-shell func_lo2o implementation' \"$cfgfile\" > $cfgfile.tmp \\\n  && mv -f \"$cfgfile.tmp\" \"$cfgfile\" \\\n    || (rm -f \"$cfgfile\" && cp \"$cfgfile.tmp\" \"$cfgfile\" && rm -f \"$cfgfile.tmp\")\ntest 0 -eq $? || _lt_function_replace_fail=:\n\n\n  sed -e '/^func_xform ()$/,/^} # func_xform /c\\\nfunc_xform ()\\\n{\\\n    func_xform_result=${1%.*}.lo\\\n} # Extended-shell func_xform implementation' \"$cfgfile\" > $cfgfile.tmp \\\n  && mv -f \"$cfgfile.tmp\" \"$cfgfile\" \\\n    || (rm -f \"$cfgfile\" && cp \"$cfgfile.tmp\" \"$cfgfile\" && rm -f \"$cfgfile.tmp\")\ntest 0 -eq $? || _lt_function_replace_fail=:\n\n\n  sed -e '/^func_arith ()$/,/^} # func_arith /c\\\nfunc_arith ()\\\n{\\\n    func_arith_result=$(( $* ))\\\n} # Extended-shell func_arith implementation' \"$cfgfile\" > $cfgfile.tmp \\\n  && mv -f \"$cfgfile.tmp\" \"$cfgfile\" \\\n    || (rm -f \"$cfgfile\" && cp \"$cfgfile.tmp\" \"$cfgfile\" && rm -f \"$cfgfile.tmp\")\ntest 0 -eq $? || _lt_function_replace_fail=:\n\n\n  sed -e '/^func_len ()$/,/^} # func_len /c\\\nfunc_len ()\\\n{\\\n    func_len_result=${#1}\\\n} # Extended-shell func_len implementation' \"$cfgfile\" > $cfgfile.tmp \\\n  && mv -f \"$cfgfile.tmp\" \"$cfgfile\" \\\n    || (rm -f \"$cfgfile\" && cp \"$cfgfile.tmp\" \"$cfgfile\" && rm -f \"$cfgfile.tmp\")\ntest 0 -eq $? || _lt_function_replace_fail=:\n\nfi\n\nif test x\"$lt_shell_append\" = xyes; then\n  sed -e '/^func_append ()$/,/^} # func_append /c\\\nfunc_append ()\\\n{\\\n    eval \"${1}+=\\\\${2}\"\\\n} # Extended-shell func_append implementation' \"$cfgfile\" > $cfgfile.tmp \\\n  && mv -f \"$cfgfile.tmp\" \"$cfgfile\" \\\n    || (rm -f \"$cfgfile\" && cp \"$cfgfile.tmp\" \"$cfgfile\" && rm -f \"$cfgfile.tmp\")\ntest 0 -eq $? || _lt_function_replace_fail=:\n\n\n  sed -e '/^func_append_quoted ()$/,/^} # func_append_quoted /c\\\nfunc_append_quoted ()\\\n{\\\n\\    func_quote_for_eval \"${2}\"\\\n\\    eval \"${1}+=\\\\\\\\ \\\\$func_quote_for_eval_result\"\\\n} # Extended-shell func_append_quoted implementation' \"$cfgfile\" > $cfgfile.tmp \\\n  && mv -f \"$cfgfile.tmp\" \"$cfgfile\" \\\n    || (rm -f \"$cfgfile\" && cp \"$cfgfile.tmp\" \"$cfgfile\" && rm -f \"$cfgfile.tmp\")\ntest 0 -eq $? || _lt_function_replace_fail=:\n\n\n  # Save a `func_append' function call where possible by direct use of '+='\n  sed -e 's%func_append \\([a-zA-Z_]\\{1,\\}\\) \"%\\1+=\"%g' $cfgfile > $cfgfile.tmp \\\n    && mv -f \"$cfgfile.tmp\" \"$cfgfile\" \\\n      || (rm -f \"$cfgfile\" && cp \"$cfgfile.tmp\" \"$cfgfile\" && rm -f \"$cfgfile.tmp\")\n  test 0 -eq $? || _lt_function_replace_fail=:\nelse\n  # Save a `func_append' function call even when '+=' is not available\n  sed -e 's%func_append \\([a-zA-Z_]\\{1,\\}\\) \"%\\1=\"$\\1%g' $cfgfile > $cfgfile.tmp \\\n    && mv -f \"$cfgfile.tmp\" \"$cfgfile\" \\\n      || (rm -f \"$cfgfile\" && cp \"$cfgfile.tmp\" \"$cfgfile\" && rm -f \"$cfgfile.tmp\")\n  test 0 -eq $? || _lt_function_replace_fail=:\nfi\n\nif test x\"$_lt_function_replace_fail\" = x\":\"; then\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: WARNING: Unable to substitute extended shell functions in $ofile\" >&5\n$as_echo \"$as_me: WARNING: Unable to substitute extended shell functions in $ofile\" >&2;}\nfi\n\n\n   mv -f \"$cfgfile\" \"$ofile\" ||\n    (rm -f \"$ofile\" && cp \"$cfgfile\" \"$ofile\" && rm -f \"$cfgfile\")\n  chmod +x \"$ofile\"\n\n\n    cat <<_LT_EOF >> \"$ofile\"\n\n# ### BEGIN LIBTOOL TAG CONFIG: CXX\n\n# The linker used to build libraries.\nLD=$lt_LD_CXX\n\n# How to create reloadable object files.\nreload_flag=$lt_reload_flag_CXX\nreload_cmds=$lt_reload_cmds_CXX\n\n# Commands used to build an old-style archive.\nold_archive_cmds=$lt_old_archive_cmds_CXX\n\n# A language specific compiler.\nCC=$lt_compiler_CXX\n\n# Is the compiler the GNU compiler?\nwith_gcc=$GCC_CXX\n\n# Compiler flag to turn off builtin functions.\nno_builtin_flag=$lt_lt_prog_compiler_no_builtin_flag_CXX\n\n# Additional compiler flags for building library objects.\npic_flag=$lt_lt_prog_compiler_pic_CXX\n\n# How to pass a linker flag through the compiler.\nwl=$lt_lt_prog_compiler_wl_CXX\n\n# Compiler flag to prevent dynamic linking.\nlink_static_flag=$lt_lt_prog_compiler_static_CXX\n\n# Does compiler simultaneously support -c and -o options?\ncompiler_c_o=$lt_lt_cv_prog_compiler_c_o_CXX\n\n# Whether or not to add -lc for building shared libraries.\nbuild_libtool_need_lc=$archive_cmds_need_lc_CXX\n\n# Whether or not to disallow shared libs when runtime libs are static.\nallow_libtool_libs_with_static_runtimes=$enable_shared_with_static_runtimes_CXX\n\n# Compiler flag to allow reflexive dlopens.\nexport_dynamic_flag_spec=$lt_export_dynamic_flag_spec_CXX\n\n# Compiler flag to generate shared objects directly from archives.\nwhole_archive_flag_spec=$lt_whole_archive_flag_spec_CXX\n\n# Whether the compiler copes with passing no objects directly.\ncompiler_needs_object=$lt_compiler_needs_object_CXX\n\n# Create an old-style archive from a shared archive.\nold_archive_from_new_cmds=$lt_old_archive_from_new_cmds_CXX\n\n# Create a temporary old-style archive to link instead of a shared archive.\nold_archive_from_expsyms_cmds=$lt_old_archive_from_expsyms_cmds_CXX\n\n# Commands used to build a shared archive.\narchive_cmds=$lt_archive_cmds_CXX\narchive_expsym_cmds=$lt_archive_expsym_cmds_CXX\n\n# Commands used to build a loadable module if different from building\n# a shared archive.\nmodule_cmds=$lt_module_cmds_CXX\nmodule_expsym_cmds=$lt_module_expsym_cmds_CXX\n\n# Whether we are building with GNU ld or not.\nwith_gnu_ld=$lt_with_gnu_ld_CXX\n\n# Flag that allows shared libraries with undefined symbols to be built.\nallow_undefined_flag=$lt_allow_undefined_flag_CXX\n\n# Flag that enforces no undefined symbols.\nno_undefined_flag=$lt_no_undefined_flag_CXX\n\n# Flag to hardcode \\$libdir into a binary during linking.\n# This must work even if \\$libdir does not exist\nhardcode_libdir_flag_spec=$lt_hardcode_libdir_flag_spec_CXX\n\n# Whether we need a single \"-rpath\" flag with a separated argument.\nhardcode_libdir_separator=$lt_hardcode_libdir_separator_CXX\n\n# Set to \"yes\" if using DIR/libNAME\\${shared_ext} during linking hardcodes\n# DIR into the resulting binary.\nhardcode_direct=$hardcode_direct_CXX\n\n# Set to \"yes\" if using DIR/libNAME\\${shared_ext} during linking hardcodes\n# DIR into the resulting binary and the resulting library dependency is\n# \"absolute\",i.e impossible to change by setting \\${shlibpath_var} if the\n# library is relocated.\nhardcode_direct_absolute=$hardcode_direct_absolute_CXX\n\n# Set to \"yes\" if using the -LDIR flag during linking hardcodes DIR\n# into the resulting binary.\nhardcode_minus_L=$hardcode_minus_L_CXX\n\n# Set to \"yes\" if using SHLIBPATH_VAR=DIR during linking hardcodes DIR\n# into the resulting binary.\nhardcode_shlibpath_var=$hardcode_shlibpath_var_CXX\n\n# Set to \"yes\" if building a shared library automatically hardcodes DIR\n# into the library and all subsequent libraries and executables linked\n# against it.\nhardcode_automatic=$hardcode_automatic_CXX\n\n# Set to yes if linker adds runtime paths of dependent libraries\n# to runtime path list.\ninherit_rpath=$inherit_rpath_CXX\n\n# Whether libtool must link a program against all its dependency libraries.\nlink_all_deplibs=$link_all_deplibs_CXX\n\n# Set to \"yes\" if exported symbols are required.\nalways_export_symbols=$always_export_symbols_CXX\n\n# The commands to list exported symbols.\nexport_symbols_cmds=$lt_export_symbols_cmds_CXX\n\n# Symbols that should not be listed in the preloaded symbols.\nexclude_expsyms=$lt_exclude_expsyms_CXX\n\n# Symbols that must always be exported.\ninclude_expsyms=$lt_include_expsyms_CXX\n\n# Commands necessary for linking programs (against libraries) with templates.\nprelink_cmds=$lt_prelink_cmds_CXX\n\n# Commands necessary for finishing linking programs.\npostlink_cmds=$lt_postlink_cmds_CXX\n\n# Specify filename containing input files.\nfile_list_spec=$lt_file_list_spec_CXX\n\n# How to hardcode a shared library path into an executable.\nhardcode_action=$hardcode_action_CXX\n\n# The directories searched by this compiler when creating a shared library.\ncompiler_lib_search_dirs=$lt_compiler_lib_search_dirs_CXX\n\n# Dependencies to place before and after the objects being linked to\n# create a shared library.\npredep_objects=$lt_predep_objects_CXX\npostdep_objects=$lt_postdep_objects_CXX\npredeps=$lt_predeps_CXX\npostdeps=$lt_postdeps_CXX\n\n# The library search path used internally by the compiler when linking\n# a shared library.\ncompiler_lib_search_path=$lt_compiler_lib_search_path_CXX\n\n# ### END LIBTOOL TAG CONFIG: CXX\n_LT_EOF\n\n ;;\n\n  esac\ndone # for ac_tag\n\n\nas_fn_exit 0\n_ACEOF\nac_clean_files=$ac_clean_files_save\n\ntest $ac_write_fail = 0 ||\n  as_fn_error $? \"write failure creating $CONFIG_STATUS\" \"$LINENO\" 5\n\n\n# configure is writing to config.log, and then calls config.status.\n# config.status does its own redirection, appending to config.log.\n# Unfortunately, on DOS this fails, as config.log is still kept open\n# by configure, so config.status won't be able to write to it; its\n# output is simply discarded.  So we exec the FD to /dev/null,\n# effectively closing config.log, so it can be properly (re)opened and\n# appended to by config.status.  When coming back to configure, we\n# need to make the FD available again.\nif test \"$no_create\" != yes; then\n  ac_cs_success=:\n  ac_config_status_args=\n  test \"$silent\" = yes &&\n    ac_config_status_args=\"$ac_config_status_args --quiet\"\n  exec 5>/dev/null\n  $SHELL $CONFIG_STATUS $ac_config_status_args || ac_cs_success=false\n  exec 5>>config.log\n  # Use ||, not &&, to avoid exiting from the if with $? = 1, which\n  # would make configure fail if this is the last instruction.\n  $ac_cs_success || as_fn_exit 1\nfi\nif test -n \"$ac_unrecognized_opts\" && test \"$enable_option_checking\" != no; then\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: WARNING: unrecognized options: $ac_unrecognized_opts\" >&5\n$as_echo \"$as_me: WARNING: unrecognized options: $ac_unrecognized_opts\" >&2;}\nfi\n\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/configure.ac",
    "content": "AC_INIT([OpenFst], [1.6.7], [help@www.openfst.org])\nAM_INIT_AUTOMAKE([foreign nostdinc -Wall -Werror subdir-objects])\nAM_PROG_AR\n\n# OpenFst does not throw exceptions, so we do not generate exception handling\n# code. However, users are free to re-enable exception handling.\n# OpenFst assumes char is unsigned; -fsigned-char is likely unsafe.\nCPPFLAGS=\"$CPPFLAGS -fno-exceptions -funsigned-char\"\nCXXFLAGS=\"$CXXFLAGS -std=c++11\"\n\nAC_PROG_CXX\nAC_DISABLE_STATIC\nAC_PROG_LIBTOOL\n\nAC_CONFIG_HEADERS([config.h src/include/fst/config.h])\nAC_CONFIG_SRCDIR([src/lib/fst.cc])\nAC_CONFIG_FILES([\n  Makefile\n  src/Makefile\n  src/include/Makefile\n  src/lib/Makefile\n  src/bin/Makefile\n  src/test/Makefile\n  src/extensions/Makefile\n  src/extensions/compact/Makefile\n  src/extensions/compress/Makefile\n  src/extensions/const/Makefile\n  src/extensions/far/Makefile\n  src/extensions/linear/Makefile\n  src/extensions/lookahead/Makefile\n  src/extensions/mpdt/Makefile\n  src/extensions/ngram/Makefile\n  src/extensions/pdt/Makefile\n  src/extensions/python/Makefile\n  src/extensions/special/Makefile\n  src/script/Makefile\n])\nAC_CONFIG_MACRO_DIR([m4])\nAC_LANG([C++])\n\nAC_ARG_ENABLE([compact-fsts],\n              [AS_HELP_STRING([--enable-compact-fsts],\n              [enable CompactFst extensions])],\n              [],\n              [enable_compact_fsts=no])\nAM_CONDITIONAL([HAVE_COMPACT], [test \"x$enable_compact_fsts\" != xno])\n\nAC_ARG_ENABLE([compress],\n              [AS_HELP_STRING([--enable-compress],\n              [enable compression extension])],\n              [],\n              [enable_compress=no])\nAM_CONDITIONAL([HAVE_COMPRESS], [test \"x$enable_compress\" != xno])\n\nAC_ARG_ENABLE([const-fsts],\n              [AS_HELP_STRING([--enable-const-fsts],\n              [enable ConstFst extensions])],\n              [],\n              [enable_const_fsts=no])\nAM_CONDITIONAL([HAVE_CONST], [test \"x$enable_const_fsts\" != xno])\n\nAC_ARG_ENABLE([far],\n              [AS_HELP_STRING([--enable-far], [enable FAR extensions])],\n              [],\n              [enable_far=no])\nAM_CONDITIONAL([HAVE_FAR], [test \"x$enable_far\" != xno])\n\nAC_ARG_ENABLE([linear-fsts],\n              [AS_HELP_STRING([--enable-linear-fsts],\n              [enable LinearTagger/ClassifierFst extensions])],\n              [],\n              [enable_linear_fsts=no])\nAM_CONDITIONAL([HAVE_LINEAR], [test \"x$enable_linear_fsts\" != xno])\n\nAC_ARG_ENABLE([lookahead-fsts],\n              [AS_HELP_STRING([--enable-lookahead-fsts],\n              [enable LookAheadFst extensions])],\n              [],\n              [enable_lookahead_fsts=no])\nAM_CONDITIONAL([HAVE_LOOKAHEAD], [test \"x$enable_lookahead_fsts\" != xno])\n\nAC_ARG_ENABLE([mpdt],\n              [AS_HELP_STRING([--enable-mpdt],\n              [enable MPDT extensions])],\n              [],\n              [enable_mpdt=no])\nAM_CONDITIONAL([HAVE_MPDT], [test \"x$enable_mpdt\" != xno])\n\nAC_ARG_ENABLE([ngram-fsts],\n              [AS_HELP_STRING([--enable-ngram-fsts],\n              [enable NGramFst extension])],\n              [],\n              [enable_ngram_fsts=no])\nAM_CONDITIONAL([HAVE_NGRAM], [test \"x$enable_ngram_fsts\" != xno])\n\nAC_ARG_ENABLE([pdt],\n              [AS_HELP_STRING([--enable-pdt],\n              [enable PDT extensions])],\n              [],\n              [enable_pdt=no])\nAM_CONDITIONAL([HAVE_PDT], [test \"x$enable_pdt\" != xno])\n\nAC_ARG_ENABLE([python],\n              [AS_HELP_STRING([--enable-python],\n              [enable Python extensions])],\n              [],\n              [enable_python=no])\nAM_CONDITIONAL([HAVE_PYTHON], [test \"x$enable_python\" != xno])\nif test \"x$enable_python\" != xno; then\n  AM_PATH_PYTHON(2.7)\n  AC_PYTHON_DEVEL([>= '2.7'])\nfi\n\nAC_ARG_ENABLE([special],\n              [AS_HELP_STRING([--enable-special],\n              [enable special-matcher extensions])],\n              [],\n              [enable_special=no])\nAM_CONDITIONAL([HAVE_SPECIAL], [test \"x$enable_special\" != xno])\n\n# --enable-bin enables script and bin \"extensions\".\nAC_ARG_ENABLE([bin],\n              [AS_HELP_STRING([--enable-bin],\n              [enable fst::script and command-line binaries])],\n              [],\n              [enable_bin=yes])\nAM_CONDITIONAL([HAVE_BIN], [test \"x$enable_bin\" != xno])\nAM_CONDITIONAL([HAVE_SCRIPT], [test \"x$enable_bin\" != xno])\n\n# --enable-grm enables dependencies of OpenGrm: far, mpdt, and pdt.\nAC_ARG_ENABLE([grm],\n              [AS_HELP_STRING([--enable-grm],\n              [enable all dependencies of OpenGrm])],\n              [],\n              [enable_grm=no])\nAM_CONDITIONAL([HAVE_GRM], [test \"x$enable_grm\" != xno])\n\nAC_ARG_WITH([libfstdir],\n[--with-libfstdir[=DIR] fst dynamic extensions [[LIBDIR/fst]]],\n[], [with_libfstdir=[${libdir}/fst]])\n\nAC_SUBST([libfstdir], $with_libfstdir)\n\nAC_CHECK_LIB([dl], dlopen, [DL_LIBS=-ldl])\nAC_SUBST([DL_LIBS])\n\nAC_OUTPUT\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/depcomp",
    "content": "#! /bin/sh\n# depcomp - compile a program generating dependencies as side-effects\n\nscriptversion=2013-05-30.07; # UTC\n\n# Copyright (C) 1999-2013 Free Software Foundation, Inc.\n\n# This program is free software; you can redistribute it and/or modify\n# it under the terms of the GNU General Public License as published by\n# the Free Software Foundation; either version 2, or (at your option)\n# any later version.\n\n# This program is distributed in the hope that it will be useful,\n# but WITHOUT ANY WARRANTY; without even the implied warranty of\n# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n# GNU General Public License for more details.\n\n# You should have received a copy of the GNU General Public License\n# along with this program.  If not, see <http://www.gnu.org/licenses/>.\n\n# As a special exception to the GNU General Public License, if you\n# distribute this file as part of a program that contains a\n# configuration script generated by Autoconf, you may include it under\n# the same distribution terms that you use for the rest of that program.\n\n# Originally written by Alexandre Oliva <oliva@dcc.unicamp.br>.\n\ncase $1 in\n  '')\n    echo \"$0: No command.  Try '$0 --help' for more information.\" 1>&2\n    exit 1;\n    ;;\n  -h | --h*)\n    cat <<\\EOF\nUsage: depcomp [--help] [--version] PROGRAM [ARGS]\n\nRun PROGRAMS ARGS to compile a file, generating dependencies\nas side-effects.\n\nEnvironment variables:\n  depmode     Dependency tracking mode.\n  source      Source file read by 'PROGRAMS ARGS'.\n  object      Object file output by 'PROGRAMS ARGS'.\n  DEPDIR      directory where to store dependencies.\n  depfile     Dependency file to output.\n  tmpdepfile  Temporary file to use when outputting dependencies.\n  libtool     Whether libtool is used (yes/no).\n\nReport bugs to <bug-automake@gnu.org>.\nEOF\n    exit $?\n    ;;\n  -v | --v*)\n    echo \"depcomp $scriptversion\"\n    exit $?\n    ;;\nesac\n\n# Get the directory component of the given path, and save it in the\n# global variables '$dir'.  Note that this directory component will\n# be either empty or ending with a '/' character.  This is deliberate.\nset_dir_from ()\n{\n  case $1 in\n    */*) dir=`echo \"$1\" | sed -e 's|/[^/]*$|/|'`;;\n      *) dir=;;\n  esac\n}\n\n# Get the suffix-stripped basename of the given path, and save it the\n# global variable '$base'.\nset_base_from ()\n{\n  base=`echo \"$1\" | sed -e 's|^.*/||' -e 's/\\.[^.]*$//'`\n}\n\n# If no dependency file was actually created by the compiler invocation,\n# we still have to create a dummy depfile, to avoid errors with the\n# Makefile \"include basename.Plo\" scheme.\nmake_dummy_depfile ()\n{\n  echo \"#dummy\" > \"$depfile\"\n}\n\n# Factor out some common post-processing of the generated depfile.\n# Requires the auxiliary global variable '$tmpdepfile' to be set.\naix_post_process_depfile ()\n{\n  # If the compiler actually managed to produce a dependency file,\n  # post-process it.\n  if test -f \"$tmpdepfile\"; then\n    # Each line is of the form 'foo.o: dependency.h'.\n    # Do two passes, one to just change these to\n    #   $object: dependency.h\n    # and one to simply output\n    #   dependency.h:\n    # which is needed to avoid the deleted-header problem.\n    { sed -e \"s,^.*\\.[$lower]*:,$object:,\" < \"$tmpdepfile\"\n      sed -e \"s,^.*\\.[$lower]*:[$tab ]*,,\" -e 's,$,:,' < \"$tmpdepfile\"\n    } > \"$depfile\"\n    rm -f \"$tmpdepfile\"\n  else\n    make_dummy_depfile\n  fi\n}\n\n# A tabulation character.\ntab='\t'\n# A newline character.\nnl='\n'\n# Character ranges might be problematic outside the C locale.\n# These definitions help.\nupper=ABCDEFGHIJKLMNOPQRSTUVWXYZ\nlower=abcdefghijklmnopqrstuvwxyz\ndigits=0123456789\nalpha=${upper}${lower}\n\nif test -z \"$depmode\" || test -z \"$source\" || test -z \"$object\"; then\n  echo \"depcomp: Variables source, object and depmode must be set\" 1>&2\n  exit 1\nfi\n\n# Dependencies for sub/bar.o or sub/bar.obj go into sub/.deps/bar.Po.\ndepfile=${depfile-`echo \"$object\" |\n  sed 's|[^\\\\/]*$|'${DEPDIR-.deps}'/&|;s|\\.\\([^.]*\\)$|.P\\1|;s|Pobj$|Po|'`}\ntmpdepfile=${tmpdepfile-`echo \"$depfile\" | sed 's/\\.\\([^.]*\\)$/.T\\1/'`}\n\nrm -f \"$tmpdepfile\"\n\n# Avoid interferences from the environment.\ngccflag= dashmflag=\n\n# Some modes work just like other modes, but use different flags.  We\n# parameterize here, but still list the modes in the big case below,\n# to make depend.m4 easier to write.  Note that we *cannot* use a case\n# here, because this file can only contain one case statement.\nif test \"$depmode\" = hp; then\n  # HP compiler uses -M and no extra arg.\n  gccflag=-M\n  depmode=gcc\nfi\n\nif test \"$depmode\" = dashXmstdout; then\n  # This is just like dashmstdout with a different argument.\n  dashmflag=-xM\n  depmode=dashmstdout\nfi\n\ncygpath_u=\"cygpath -u -f -\"\nif test \"$depmode\" = msvcmsys; then\n  # This is just like msvisualcpp but w/o cygpath translation.\n  # Just convert the backslash-escaped backslashes to single forward\n  # slashes to satisfy depend.m4\n  cygpath_u='sed s,\\\\\\\\,/,g'\n  depmode=msvisualcpp\nfi\n\nif test \"$depmode\" = msvc7msys; then\n  # This is just like msvc7 but w/o cygpath translation.\n  # Just convert the backslash-escaped backslashes to single forward\n  # slashes to satisfy depend.m4\n  cygpath_u='sed s,\\\\\\\\,/,g'\n  depmode=msvc7\nfi\n\nif test \"$depmode\" = xlc; then\n  # IBM C/C++ Compilers xlc/xlC can output gcc-like dependency information.\n  gccflag=-qmakedep=gcc,-MF\n  depmode=gcc\nfi\n\ncase \"$depmode\" in\ngcc3)\n## gcc 3 implements dependency tracking that does exactly what\n## we want.  Yay!  Note: for some reason libtool 1.4 doesn't like\n## it if -MD -MP comes after the -MF stuff.  Hmm.\n## Unfortunately, FreeBSD c89 acceptance of flags depends upon\n## the command line argument order; so add the flags where they\n## appear in depend2.am.  Note that the slowdown incurred here\n## affects only configure: in makefiles, %FASTDEP% shortcuts this.\n  for arg\n  do\n    case $arg in\n    -c) set fnord \"$@\" -MT \"$object\" -MD -MP -MF \"$tmpdepfile\" \"$arg\" ;;\n    *)  set fnord \"$@\" \"$arg\" ;;\n    esac\n    shift # fnord\n    shift # $arg\n  done\n  \"$@\"\n  stat=$?\n  if test $stat -ne 0; then\n    rm -f \"$tmpdepfile\"\n    exit $stat\n  fi\n  mv \"$tmpdepfile\" \"$depfile\"\n  ;;\n\ngcc)\n## Note that this doesn't just cater to obsosete pre-3.x GCC compilers.\n## but also to in-use compilers like IMB xlc/xlC and the HP C compiler.\n## (see the conditional assignment to $gccflag above).\n## There are various ways to get dependency output from gcc.  Here's\n## why we pick this rather obscure method:\n## - Don't want to use -MD because we'd like the dependencies to end\n##   up in a subdir.  Having to rename by hand is ugly.\n##   (We might end up doing this anyway to support other compilers.)\n## - The DEPENDENCIES_OUTPUT environment variable makes gcc act like\n##   -MM, not -M (despite what the docs say).  Also, it might not be\n##   supported by the other compilers which use the 'gcc' depmode.\n## - Using -M directly means running the compiler twice (even worse\n##   than renaming).\n  if test -z \"$gccflag\"; then\n    gccflag=-MD,\n  fi\n  \"$@\" -Wp,\"$gccflag$tmpdepfile\"\n  stat=$?\n  if test $stat -ne 0; then\n    rm -f \"$tmpdepfile\"\n    exit $stat\n  fi\n  rm -f \"$depfile\"\n  echo \"$object : \\\\\" > \"$depfile\"\n  # The second -e expression handles DOS-style file names with drive\n  # letters.\n  sed -e 's/^[^:]*: / /' \\\n      -e 's/^['$alpha']:\\/[^:]*: / /' < \"$tmpdepfile\" >> \"$depfile\"\n## This next piece of magic avoids the \"deleted header file\" problem.\n## The problem is that when a header file which appears in a .P file\n## is deleted, the dependency causes make to die (because there is\n## typically no way to rebuild the header).  We avoid this by adding\n## dummy dependencies for each header file.  Too bad gcc doesn't do\n## this for us directly.\n## Some versions of gcc put a space before the ':'.  On the theory\n## that the space means something, we add a space to the output as\n## well.  hp depmode also adds that space, but also prefixes the VPATH\n## to the object.  Take care to not repeat it in the output.\n## Some versions of the HPUX 10.20 sed can't process this invocation\n## correctly.  Breaking it into two sed invocations is a workaround.\n  tr ' ' \"$nl\" < \"$tmpdepfile\" \\\n    | sed -e 's/^\\\\$//' -e '/^$/d' -e \"s|.*$object$||\" -e '/:$/d' \\\n    | sed -e 's/$/ :/' >> \"$depfile\"\n  rm -f \"$tmpdepfile\"\n  ;;\n\nhp)\n  # This case exists only to let depend.m4 do its work.  It works by\n  # looking at the text of this script.  This case will never be run,\n  # since it is checked for above.\n  exit 1\n  ;;\n\nsgi)\n  if test \"$libtool\" = yes; then\n    \"$@\" \"-Wp,-MDupdate,$tmpdepfile\"\n  else\n    \"$@\" -MDupdate \"$tmpdepfile\"\n  fi\n  stat=$?\n  if test $stat -ne 0; then\n    rm -f \"$tmpdepfile\"\n    exit $stat\n  fi\n  rm -f \"$depfile\"\n\n  if test -f \"$tmpdepfile\"; then  # yes, the sourcefile depend on other files\n    echo \"$object : \\\\\" > \"$depfile\"\n    # Clip off the initial element (the dependent).  Don't try to be\n    # clever and replace this with sed code, as IRIX sed won't handle\n    # lines with more than a fixed number of characters (4096 in\n    # IRIX 6.2 sed, 8192 in IRIX 6.5).  We also remove comment lines;\n    # the IRIX cc adds comments like '#:fec' to the end of the\n    # dependency line.\n    tr ' ' \"$nl\" < \"$tmpdepfile\" \\\n      | sed -e 's/^.*\\.o://' -e 's/#.*$//' -e '/^$/ d' \\\n      | tr \"$nl\" ' ' >> \"$depfile\"\n    echo >> \"$depfile\"\n    # The second pass generates a dummy entry for each header file.\n    tr ' ' \"$nl\" < \"$tmpdepfile\" \\\n      | sed -e 's/^.*\\.o://' -e 's/#.*$//' -e '/^$/ d' -e 's/$/:/' \\\n      >> \"$depfile\"\n  else\n    make_dummy_depfile\n  fi\n  rm -f \"$tmpdepfile\"\n  ;;\n\nxlc)\n  # This case exists only to let depend.m4 do its work.  It works by\n  # looking at the text of this script.  This case will never be run,\n  # since it is checked for above.\n  exit 1\n  ;;\n\naix)\n  # The C for AIX Compiler uses -M and outputs the dependencies\n  # in a .u file.  In older versions, this file always lives in the\n  # current directory.  Also, the AIX compiler puts '$object:' at the\n  # start of each line; $object doesn't have directory information.\n  # Version 6 uses the directory in both cases.\n  set_dir_from \"$object\"\n  set_base_from \"$object\"\n  if test \"$libtool\" = yes; then\n    tmpdepfile1=$dir$base.u\n    tmpdepfile2=$base.u\n    tmpdepfile3=$dir.libs/$base.u\n    \"$@\" -Wc,-M\n  else\n    tmpdepfile1=$dir$base.u\n    tmpdepfile2=$dir$base.u\n    tmpdepfile3=$dir$base.u\n    \"$@\" -M\n  fi\n  stat=$?\n  if test $stat -ne 0; then\n    rm -f \"$tmpdepfile1\" \"$tmpdepfile2\" \"$tmpdepfile3\"\n    exit $stat\n  fi\n\n  for tmpdepfile in \"$tmpdepfile1\" \"$tmpdepfile2\" \"$tmpdepfile3\"\n  do\n    test -f \"$tmpdepfile\" && break\n  done\n  aix_post_process_depfile\n  ;;\n\ntcc)\n  # tcc (Tiny C Compiler) understand '-MD -MF file' since version 0.9.26\n  # FIXME: That version still under development at the moment of writing.\n  #        Make that this statement remains true also for stable, released\n  #        versions.\n  # It will wrap lines (doesn't matter whether long or short) with a\n  # trailing '\\', as in:\n  #\n  #   foo.o : \\\n  #    foo.c \\\n  #    foo.h \\\n  #\n  # It will put a trailing '\\' even on the last line, and will use leading\n  # spaces rather than leading tabs (at least since its commit 0394caf7\n  # \"Emit spaces for -MD\").\n  \"$@\" -MD -MF \"$tmpdepfile\"\n  stat=$?\n  if test $stat -ne 0; then\n    rm -f \"$tmpdepfile\"\n    exit $stat\n  fi\n  rm -f \"$depfile\"\n  # Each non-empty line is of the form 'foo.o : \\' or ' dep.h \\'.\n  # We have to change lines of the first kind to '$object: \\'.\n  sed -e \"s|.*:|$object :|\" < \"$tmpdepfile\" > \"$depfile\"\n  # And for each line of the second kind, we have to emit a 'dep.h:'\n  # dummy dependency, to avoid the deleted-header problem.\n  sed -n -e 's|^  *\\(.*\\) *\\\\$|\\1:|p' < \"$tmpdepfile\" >> \"$depfile\"\n  rm -f \"$tmpdepfile\"\n  ;;\n\n## The order of this option in the case statement is important, since the\n## shell code in configure will try each of these formats in the order\n## listed in this file.  A plain '-MD' option would be understood by many\n## compilers, so we must ensure this comes after the gcc and icc options.\npgcc)\n  # Portland's C compiler understands '-MD'.\n  # Will always output deps to 'file.d' where file is the root name of the\n  # source file under compilation, even if file resides in a subdirectory.\n  # The object file name does not affect the name of the '.d' file.\n  # pgcc 10.2 will output\n  #    foo.o: sub/foo.c sub/foo.h\n  # and will wrap long lines using '\\' :\n  #    foo.o: sub/foo.c ... \\\n  #     sub/foo.h ... \\\n  #     ...\n  set_dir_from \"$object\"\n  # Use the source, not the object, to determine the base name, since\n  # that's sadly what pgcc will do too.\n  set_base_from \"$source\"\n  tmpdepfile=$base.d\n\n  # For projects that build the same source file twice into different object\n  # files, the pgcc approach of using the *source* file root name can cause\n  # problems in parallel builds.  Use a locking strategy to avoid stomping on\n  # the same $tmpdepfile.\n  lockdir=$base.d-lock\n  trap \"\n    echo '$0: caught signal, cleaning up...' >&2\n    rmdir '$lockdir'\n    exit 1\n  \" 1 2 13 15\n  numtries=100\n  i=$numtries\n  while test $i -gt 0; do\n    # mkdir is a portable test-and-set.\n    if mkdir \"$lockdir\" 2>/dev/null; then\n      # This process acquired the lock.\n      \"$@\" -MD\n      stat=$?\n      # Release the lock.\n      rmdir \"$lockdir\"\n      break\n    else\n      # If the lock is being held by a different process, wait\n      # until the winning process is done or we timeout.\n      while test -d \"$lockdir\" && test $i -gt 0; do\n        sleep 1\n        i=`expr $i - 1`\n      done\n    fi\n    i=`expr $i - 1`\n  done\n  trap - 1 2 13 15\n  if test $i -le 0; then\n    echo \"$0: failed to acquire lock after $numtries attempts\" >&2\n    echo \"$0: check lockdir '$lockdir'\" >&2\n    exit 1\n  fi\n\n  if test $stat -ne 0; then\n    rm -f \"$tmpdepfile\"\n    exit $stat\n  fi\n  rm -f \"$depfile\"\n  # Each line is of the form `foo.o: dependent.h',\n  # or `foo.o: dep1.h dep2.h \\', or ` dep3.h dep4.h \\'.\n  # Do two passes, one to just change these to\n  # `$object: dependent.h' and one to simply `dependent.h:'.\n  sed \"s,^[^:]*:,$object :,\" < \"$tmpdepfile\" > \"$depfile\"\n  # Some versions of the HPUX 10.20 sed can't process this invocation\n  # correctly.  Breaking it into two sed invocations is a workaround.\n  sed 's,^[^:]*: \\(.*\\)$,\\1,;s/^\\\\$//;/^$/d;/:$/d' < \"$tmpdepfile\" \\\n    | sed -e 's/$/ :/' >> \"$depfile\"\n  rm -f \"$tmpdepfile\"\n  ;;\n\nhp2)\n  # The \"hp\" stanza above does not work with aCC (C++) and HP's ia64\n  # compilers, which have integrated preprocessors.  The correct option\n  # to use with these is +Maked; it writes dependencies to a file named\n  # 'foo.d', which lands next to the object file, wherever that\n  # happens to be.\n  # Much of this is similar to the tru64 case; see comments there.\n  set_dir_from  \"$object\"\n  set_base_from \"$object\"\n  if test \"$libtool\" = yes; then\n    tmpdepfile1=$dir$base.d\n    tmpdepfile2=$dir.libs/$base.d\n    \"$@\" -Wc,+Maked\n  else\n    tmpdepfile1=$dir$base.d\n    tmpdepfile2=$dir$base.d\n    \"$@\" +Maked\n  fi\n  stat=$?\n  if test $stat -ne 0; then\n     rm -f \"$tmpdepfile1\" \"$tmpdepfile2\"\n     exit $stat\n  fi\n\n  for tmpdepfile in \"$tmpdepfile1\" \"$tmpdepfile2\"\n  do\n    test -f \"$tmpdepfile\" && break\n  done\n  if test -f \"$tmpdepfile\"; then\n    sed -e \"s,^.*\\.[$lower]*:,$object:,\" \"$tmpdepfile\" > \"$depfile\"\n    # Add 'dependent.h:' lines.\n    sed -ne '2,${\n               s/^ *//\n               s/ \\\\*$//\n               s/$/:/\n               p\n             }' \"$tmpdepfile\" >> \"$depfile\"\n  else\n    make_dummy_depfile\n  fi\n  rm -f \"$tmpdepfile\" \"$tmpdepfile2\"\n  ;;\n\ntru64)\n  # The Tru64 compiler uses -MD to generate dependencies as a side\n  # effect.  'cc -MD -o foo.o ...' puts the dependencies into 'foo.o.d'.\n  # At least on Alpha/Redhat 6.1, Compaq CCC V6.2-504 seems to put\n  # dependencies in 'foo.d' instead, so we check for that too.\n  # Subdirectories are respected.\n  set_dir_from  \"$object\"\n  set_base_from \"$object\"\n\n  if test \"$libtool\" = yes; then\n    # Libtool generates 2 separate objects for the 2 libraries.  These\n    # two compilations output dependencies in $dir.libs/$base.o.d and\n    # in $dir$base.o.d.  We have to check for both files, because\n    # one of the two compilations can be disabled.  We should prefer\n    # $dir$base.o.d over $dir.libs/$base.o.d because the latter is\n    # automatically cleaned when .libs/ is deleted, while ignoring\n    # the former would cause a distcleancheck panic.\n    tmpdepfile1=$dir$base.o.d          # libtool 1.5\n    tmpdepfile2=$dir.libs/$base.o.d    # Likewise.\n    tmpdepfile3=$dir.libs/$base.d      # Compaq CCC V6.2-504\n    \"$@\" -Wc,-MD\n  else\n    tmpdepfile1=$dir$base.d\n    tmpdepfile2=$dir$base.d\n    tmpdepfile3=$dir$base.d\n    \"$@\" -MD\n  fi\n\n  stat=$?\n  if test $stat -ne 0; then\n    rm -f \"$tmpdepfile1\" \"$tmpdepfile2\" \"$tmpdepfile3\"\n    exit $stat\n  fi\n\n  for tmpdepfile in \"$tmpdepfile1\" \"$tmpdepfile2\" \"$tmpdepfile3\"\n  do\n    test -f \"$tmpdepfile\" && break\n  done\n  # Same post-processing that is required for AIX mode.\n  aix_post_process_depfile\n  ;;\n\nmsvc7)\n  if test \"$libtool\" = yes; then\n    showIncludes=-Wc,-showIncludes\n  else\n    showIncludes=-showIncludes\n  fi\n  \"$@\" $showIncludes > \"$tmpdepfile\"\n  stat=$?\n  grep -v '^Note: including file: ' \"$tmpdepfile\"\n  if test $stat -ne 0; then\n    rm -f \"$tmpdepfile\"\n    exit $stat\n  fi\n  rm -f \"$depfile\"\n  echo \"$object : \\\\\" > \"$depfile\"\n  # The first sed program below extracts the file names and escapes\n  # backslashes for cygpath.  The second sed program outputs the file\n  # name when reading, but also accumulates all include files in the\n  # hold buffer in order to output them again at the end.  This only\n  # works with sed implementations that can handle large buffers.\n  sed < \"$tmpdepfile\" -n '\n/^Note: including file:  *\\(.*\\)/ {\n  s//\\1/\n  s/\\\\/\\\\\\\\/g\n  p\n}' | $cygpath_u | sort -u | sed -n '\ns/ /\\\\ /g\ns/\\(.*\\)/'\"$tab\"'\\1 \\\\/p\ns/.\\(.*\\) \\\\/\\1:/\nH\n$ {\n  s/.*/'\"$tab\"'/\n  G\n  p\n}' >> \"$depfile\"\n  echo >> \"$depfile\" # make sure the fragment doesn't end with a backslash\n  rm -f \"$tmpdepfile\"\n  ;;\n\nmsvc7msys)\n  # This case exists only to let depend.m4 do its work.  It works by\n  # looking at the text of this script.  This case will never be run,\n  # since it is checked for above.\n  exit 1\n  ;;\n\n#nosideeffect)\n  # This comment above is used by automake to tell side-effect\n  # dependency tracking mechanisms from slower ones.\n\ndashmstdout)\n  # Important note: in order to support this mode, a compiler *must*\n  # always write the preprocessed file to stdout, regardless of -o.\n  \"$@\" || exit $?\n\n  # Remove the call to Libtool.\n  if test \"$libtool\" = yes; then\n    while test \"X$1\" != 'X--mode=compile'; do\n      shift\n    done\n    shift\n  fi\n\n  # Remove '-o $object'.\n  IFS=\" \"\n  for arg\n  do\n    case $arg in\n    -o)\n      shift\n      ;;\n    $object)\n      shift\n      ;;\n    *)\n      set fnord \"$@\" \"$arg\"\n      shift # fnord\n      shift # $arg\n      ;;\n    esac\n  done\n\n  test -z \"$dashmflag\" && dashmflag=-M\n  # Require at least two characters before searching for ':'\n  # in the target name.  This is to cope with DOS-style filenames:\n  # a dependency such as 'c:/foo/bar' could be seen as target 'c' otherwise.\n  \"$@\" $dashmflag |\n    sed \"s|^[$tab ]*[^:$tab ][^:][^:]*:[$tab ]*|$object: |\" > \"$tmpdepfile\"\n  rm -f \"$depfile\"\n  cat < \"$tmpdepfile\" > \"$depfile\"\n  # Some versions of the HPUX 10.20 sed can't process this sed invocation\n  # correctly.  Breaking it into two sed invocations is a workaround.\n  tr ' ' \"$nl\" < \"$tmpdepfile\" \\\n    | sed -e 's/^\\\\$//' -e '/^$/d' -e '/:$/d' \\\n    | sed -e 's/$/ :/' >> \"$depfile\"\n  rm -f \"$tmpdepfile\"\n  ;;\n\ndashXmstdout)\n  # This case only exists to satisfy depend.m4.  It is never actually\n  # run, as this mode is specially recognized in the preamble.\n  exit 1\n  ;;\n\nmakedepend)\n  \"$@\" || exit $?\n  # Remove any Libtool call\n  if test \"$libtool\" = yes; then\n    while test \"X$1\" != 'X--mode=compile'; do\n      shift\n    done\n    shift\n  fi\n  # X makedepend\n  shift\n  cleared=no eat=no\n  for arg\n  do\n    case $cleared in\n    no)\n      set \"\"; shift\n      cleared=yes ;;\n    esac\n    if test $eat = yes; then\n      eat=no\n      continue\n    fi\n    case \"$arg\" in\n    -D*|-I*)\n      set fnord \"$@\" \"$arg\"; shift ;;\n    # Strip any option that makedepend may not understand.  Remove\n    # the object too, otherwise makedepend will parse it as a source file.\n    -arch)\n      eat=yes ;;\n    -*|$object)\n      ;;\n    *)\n      set fnord \"$@\" \"$arg\"; shift ;;\n    esac\n  done\n  obj_suffix=`echo \"$object\" | sed 's/^.*\\././'`\n  touch \"$tmpdepfile\"\n  ${MAKEDEPEND-makedepend} -o\"$obj_suffix\" -f\"$tmpdepfile\" \"$@\"\n  rm -f \"$depfile\"\n  # makedepend may prepend the VPATH from the source file name to the object.\n  # No need to regex-escape $object, excess matching of '.' is harmless.\n  sed \"s|^.*\\($object *:\\)|\\1|\" \"$tmpdepfile\" > \"$depfile\"\n  # Some versions of the HPUX 10.20 sed can't process the last invocation\n  # correctly.  Breaking it into two sed invocations is a workaround.\n  sed '1,2d' \"$tmpdepfile\" \\\n    | tr ' ' \"$nl\" \\\n    | sed -e 's/^\\\\$//' -e '/^$/d' -e '/:$/d' \\\n    | sed -e 's/$/ :/' >> \"$depfile\"\n  rm -f \"$tmpdepfile\" \"$tmpdepfile\".bak\n  ;;\n\ncpp)\n  # Important note: in order to support this mode, a compiler *must*\n  # always write the preprocessed file to stdout.\n  \"$@\" || exit $?\n\n  # Remove the call to Libtool.\n  if test \"$libtool\" = yes; then\n    while test \"X$1\" != 'X--mode=compile'; do\n      shift\n    done\n    shift\n  fi\n\n  # Remove '-o $object'.\n  IFS=\" \"\n  for arg\n  do\n    case $arg in\n    -o)\n      shift\n      ;;\n    $object)\n      shift\n      ;;\n    *)\n      set fnord \"$@\" \"$arg\"\n      shift # fnord\n      shift # $arg\n      ;;\n    esac\n  done\n\n  \"$@\" -E \\\n    | sed -n -e '/^# [0-9][0-9]* \"\\([^\"]*\\)\".*/ s:: \\1 \\\\:p' \\\n             -e '/^#line [0-9][0-9]* \"\\([^\"]*\\)\".*/ s:: \\1 \\\\:p' \\\n    | sed '$ s: \\\\$::' > \"$tmpdepfile\"\n  rm -f \"$depfile\"\n  echo \"$object : \\\\\" > \"$depfile\"\n  cat < \"$tmpdepfile\" >> \"$depfile\"\n  sed < \"$tmpdepfile\" '/^$/d;s/^ //;s/ \\\\$//;s/$/ :/' >> \"$depfile\"\n  rm -f \"$tmpdepfile\"\n  ;;\n\nmsvisualcpp)\n  # Important note: in order to support this mode, a compiler *must*\n  # always write the preprocessed file to stdout.\n  \"$@\" || exit $?\n\n  # Remove the call to Libtool.\n  if test \"$libtool\" = yes; then\n    while test \"X$1\" != 'X--mode=compile'; do\n      shift\n    done\n    shift\n  fi\n\n  IFS=\" \"\n  for arg\n  do\n    case \"$arg\" in\n    -o)\n      shift\n      ;;\n    $object)\n      shift\n      ;;\n    \"-Gm\"|\"/Gm\"|\"-Gi\"|\"/Gi\"|\"-ZI\"|\"/ZI\")\n        set fnord \"$@\"\n        shift\n        shift\n        ;;\n    *)\n        set fnord \"$@\" \"$arg\"\n        shift\n        shift\n        ;;\n    esac\n  done\n  \"$@\" -E 2>/dev/null |\n  sed -n '/^#line [0-9][0-9]* \"\\([^\"]*\\)\"/ s::\\1:p' | $cygpath_u | sort -u > \"$tmpdepfile\"\n  rm -f \"$depfile\"\n  echo \"$object : \\\\\" > \"$depfile\"\n  sed < \"$tmpdepfile\" -n -e 's% %\\\\ %g' -e '/^\\(.*\\)$/ s::'\"$tab\"'\\1 \\\\:p' >> \"$depfile\"\n  echo \"$tab\" >> \"$depfile\"\n  sed < \"$tmpdepfile\" -n -e 's% %\\\\ %g' -e '/^\\(.*\\)$/ s::\\1\\::p' >> \"$depfile\"\n  rm -f \"$tmpdepfile\"\n  ;;\n\nmsvcmsys)\n  # This case exists only to let depend.m4 do its work.  It works by\n  # looking at the text of this script.  This case will never be run,\n  # since it is checked for above.\n  exit 1\n  ;;\n\nnone)\n  exec \"$@\"\n  ;;\n\n*)\n  echo \"Unknown depmode $depmode\" 1>&2\n  exit 1\n  ;;\nesac\n\nexit 0\n\n# Local Variables:\n# mode: shell-script\n# sh-indentation: 2\n# eval: (add-hook 'write-file-hooks 'time-stamp)\n# time-stamp-start: \"scriptversion=\"\n# time-stamp-format: \"%:y-%02m-%02d.%02H\"\n# time-stamp-time-zone: \"UTC\"\n# time-stamp-end: \"; # UTC\"\n# End:\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/install-sh",
    "content": "#!/bin/sh\n# install - install a program, script, or datafile\n\nscriptversion=2011-11-20.07; # UTC\n\n# This originates from X11R5 (mit/util/scripts/install.sh), which was\n# later released in X11R6 (xc/config/util/install.sh) with the\n# following copyright and license.\n#\n# Copyright (C) 1994 X Consortium\n#\n# Permission is hereby granted, free of charge, to any person obtaining a copy\n# of this software and associated documentation files (the \"Software\"), to\n# deal in the Software without restriction, including without limitation the\n# rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n# sell copies of the Software, and to permit persons to whom the Software is\n# furnished to do so, subject to the following conditions:\n#\n# The above copyright notice and this permission notice shall be included in\n# all copies or substantial portions of the Software.\n#\n# THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n# IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n# FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.  IN NO EVENT SHALL THE\n# X CONSORTIUM BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN\n# AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNEC-\n# TION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n#\n# Except as contained in this notice, the name of the X Consortium shall not\n# be used in advertising or otherwise to promote the sale, use or other deal-\n# ings in this Software without prior written authorization from the X Consor-\n# tium.\n#\n#\n# FSF changes to this file are in the public domain.\n#\n# Calling this script install-sh is preferred over install.sh, to prevent\n# 'make' implicit rules from creating a file called install from it\n# when there is no Makefile.\n#\n# This script is compatible with the BSD install script, but was written\n# from scratch.\n\nnl='\n'\nIFS=\" \"\"\t$nl\"\n\n# set DOITPROG to echo to test this script\n\n# Don't use :- since 4.3BSD and earlier shells don't like it.\ndoit=${DOITPROG-}\nif test -z \"$doit\"; then\n  doit_exec=exec\nelse\n  doit_exec=$doit\nfi\n\n# Put in absolute file names if you don't have them in your path;\n# or use environment vars.\n\nchgrpprog=${CHGRPPROG-chgrp}\nchmodprog=${CHMODPROG-chmod}\nchownprog=${CHOWNPROG-chown}\ncmpprog=${CMPPROG-cmp}\ncpprog=${CPPROG-cp}\nmkdirprog=${MKDIRPROG-mkdir}\nmvprog=${MVPROG-mv}\nrmprog=${RMPROG-rm}\nstripprog=${STRIPPROG-strip}\n\nposix_glob='?'\ninitialize_posix_glob='\n  test \"$posix_glob\" != \"?\" || {\n    if (set -f) 2>/dev/null; then\n      posix_glob=\n    else\n      posix_glob=:\n    fi\n  }\n'\n\nposix_mkdir=\n\n# Desired mode of installed file.\nmode=0755\n\nchgrpcmd=\nchmodcmd=$chmodprog\nchowncmd=\nmvcmd=$mvprog\nrmcmd=\"$rmprog -f\"\nstripcmd=\n\nsrc=\ndst=\ndir_arg=\ndst_arg=\n\ncopy_on_change=false\nno_target_directory=\n\nusage=\"\\\nUsage: $0 [OPTION]... [-T] SRCFILE DSTFILE\n   or: $0 [OPTION]... SRCFILES... DIRECTORY\n   or: $0 [OPTION]... -t DIRECTORY SRCFILES...\n   or: $0 [OPTION]... -d DIRECTORIES...\n\nIn the 1st form, copy SRCFILE to DSTFILE.\nIn the 2nd and 3rd, copy all SRCFILES to DIRECTORY.\nIn the 4th, create DIRECTORIES.\n\nOptions:\n     --help     display this help and exit.\n     --version  display version info and exit.\n\n  -c            (ignored)\n  -C            install only if different (preserve the last data modification time)\n  -d            create directories instead of installing files.\n  -g GROUP      $chgrpprog installed files to GROUP.\n  -m MODE       $chmodprog installed files to MODE.\n  -o USER       $chownprog installed files to USER.\n  -s            $stripprog installed files.\n  -t DIRECTORY  install into DIRECTORY.\n  -T            report an error if DSTFILE is a directory.\n\nEnvironment variables override the default commands:\n  CHGRPPROG CHMODPROG CHOWNPROG CMPPROG CPPROG MKDIRPROG MVPROG\n  RMPROG STRIPPROG\n\"\n\nwhile test $# -ne 0; do\n  case $1 in\n    -c) ;;\n\n    -C) copy_on_change=true;;\n\n    -d) dir_arg=true;;\n\n    -g) chgrpcmd=\"$chgrpprog $2\"\n\tshift;;\n\n    --help) echo \"$usage\"; exit $?;;\n\n    -m) mode=$2\n\tcase $mode in\n\t  *' '* | *'\t'* | *'\n'*\t  | *'*'* | *'?'* | *'['*)\n\t    echo \"$0: invalid mode: $mode\" >&2\n\t    exit 1;;\n\tesac\n\tshift;;\n\n    -o) chowncmd=\"$chownprog $2\"\n\tshift;;\n\n    -s) stripcmd=$stripprog;;\n\n    -t) dst_arg=$2\n\t# Protect names problematic for 'test' and other utilities.\n\tcase $dst_arg in\n\t  -* | [=\\(\\)!]) dst_arg=./$dst_arg;;\n\tesac\n\tshift;;\n\n    -T) no_target_directory=true;;\n\n    --version) echo \"$0 $scriptversion\"; exit $?;;\n\n    --)\tshift\n\tbreak;;\n\n    -*)\techo \"$0: invalid option: $1\" >&2\n\texit 1;;\n\n    *)  break;;\n  esac\n  shift\ndone\n\nif test $# -ne 0 && test -z \"$dir_arg$dst_arg\"; then\n  # When -d is used, all remaining arguments are directories to create.\n  # When -t is used, the destination is already specified.\n  # Otherwise, the last argument is the destination.  Remove it from $@.\n  for arg\n  do\n    if test -n \"$dst_arg\"; then\n      # $@ is not empty: it contains at least $arg.\n      set fnord \"$@\" \"$dst_arg\"\n      shift # fnord\n    fi\n    shift # arg\n    dst_arg=$arg\n    # Protect names problematic for 'test' and other utilities.\n    case $dst_arg in\n      -* | [=\\(\\)!]) dst_arg=./$dst_arg;;\n    esac\n  done\nfi\n\nif test $# -eq 0; then\n  if test -z \"$dir_arg\"; then\n    echo \"$0: no input file specified.\" >&2\n    exit 1\n  fi\n  # It's OK to call 'install-sh -d' without argument.\n  # This can happen when creating conditional directories.\n  exit 0\nfi\n\nif test -z \"$dir_arg\"; then\n  do_exit='(exit $ret); exit $ret'\n  trap \"ret=129; $do_exit\" 1\n  trap \"ret=130; $do_exit\" 2\n  trap \"ret=141; $do_exit\" 13\n  trap \"ret=143; $do_exit\" 15\n\n  # Set umask so as not to create temps with too-generous modes.\n  # However, 'strip' requires both read and write access to temps.\n  case $mode in\n    # Optimize common cases.\n    *644) cp_umask=133;;\n    *755) cp_umask=22;;\n\n    *[0-7])\n      if test -z \"$stripcmd\"; then\n\tu_plus_rw=\n      else\n\tu_plus_rw='% 200'\n      fi\n      cp_umask=`expr '(' 777 - $mode % 1000 ')' $u_plus_rw`;;\n    *)\n      if test -z \"$stripcmd\"; then\n\tu_plus_rw=\n      else\n\tu_plus_rw=,u+rw\n      fi\n      cp_umask=$mode$u_plus_rw;;\n  esac\nfi\n\nfor src\ndo\n  # Protect names problematic for 'test' and other utilities.\n  case $src in\n    -* | [=\\(\\)!]) src=./$src;;\n  esac\n\n  if test -n \"$dir_arg\"; then\n    dst=$src\n    dstdir=$dst\n    test -d \"$dstdir\"\n    dstdir_status=$?\n  else\n\n    # Waiting for this to be detected by the \"$cpprog $src $dsttmp\" command\n    # might cause directories to be created, which would be especially bad\n    # if $src (and thus $dsttmp) contains '*'.\n    if test ! -f \"$src\" && test ! -d \"$src\"; then\n      echo \"$0: $src does not exist.\" >&2\n      exit 1\n    fi\n\n    if test -z \"$dst_arg\"; then\n      echo \"$0: no destination specified.\" >&2\n      exit 1\n    fi\n    dst=$dst_arg\n\n    # If destination is a directory, append the input filename; won't work\n    # if double slashes aren't ignored.\n    if test -d \"$dst\"; then\n      if test -n \"$no_target_directory\"; then\n\techo \"$0: $dst_arg: Is a directory\" >&2\n\texit 1\n      fi\n      dstdir=$dst\n      dst=$dstdir/`basename \"$src\"`\n      dstdir_status=0\n    else\n      # Prefer dirname, but fall back on a substitute if dirname fails.\n      dstdir=`\n\t(dirname \"$dst\") 2>/dev/null ||\n\texpr X\"$dst\" : 'X\\(.*[^/]\\)//*[^/][^/]*/*$' \\| \\\n\t     X\"$dst\" : 'X\\(//\\)[^/]' \\| \\\n\t     X\"$dst\" : 'X\\(//\\)$' \\| \\\n\t     X\"$dst\" : 'X\\(/\\)' \\| . 2>/dev/null ||\n\techo X\"$dst\" |\n\t    sed '/^X\\(.*[^/]\\)\\/\\/*[^/][^/]*\\/*$/{\n\t\t   s//\\1/\n\t\t   q\n\t\t }\n\t\t /^X\\(\\/\\/\\)[^/].*/{\n\t\t   s//\\1/\n\t\t   q\n\t\t }\n\t\t /^X\\(\\/\\/\\)$/{\n\t\t   s//\\1/\n\t\t   q\n\t\t }\n\t\t /^X\\(\\/\\).*/{\n\t\t   s//\\1/\n\t\t   q\n\t\t }\n\t\t s/.*/./; q'\n      `\n\n      test -d \"$dstdir\"\n      dstdir_status=$?\n    fi\n  fi\n\n  obsolete_mkdir_used=false\n\n  if test $dstdir_status != 0; then\n    case $posix_mkdir in\n      '')\n\t# Create intermediate dirs using mode 755 as modified by the umask.\n\t# This is like FreeBSD 'install' as of 1997-10-28.\n\tumask=`umask`\n\tcase $stripcmd.$umask in\n\t  # Optimize common cases.\n\t  *[2367][2367]) mkdir_umask=$umask;;\n\t  .*0[02][02] | .[02][02] | .[02]) mkdir_umask=22;;\n\n\t  *[0-7])\n\t    mkdir_umask=`expr $umask + 22 \\\n\t      - $umask % 100 % 40 + $umask % 20 \\\n\t      - $umask % 10 % 4 + $umask % 2\n\t    `;;\n\t  *) mkdir_umask=$umask,go-w;;\n\tesac\n\n\t# With -d, create the new directory with the user-specified mode.\n\t# Otherwise, rely on $mkdir_umask.\n\tif test -n \"$dir_arg\"; then\n\t  mkdir_mode=-m$mode\n\telse\n\t  mkdir_mode=\n\tfi\n\n\tposix_mkdir=false\n\tcase $umask in\n\t  *[123567][0-7][0-7])\n\t    # POSIX mkdir -p sets u+wx bits regardless of umask, which\n\t    # is incompatible with FreeBSD 'install' when (umask & 300) != 0.\n\t    ;;\n\t  *)\n\t    tmpdir=${TMPDIR-/tmp}/ins$RANDOM-$$\n\t    trap 'ret=$?; rmdir \"$tmpdir/d\" \"$tmpdir\" 2>/dev/null; exit $ret' 0\n\n\t    if (umask $mkdir_umask &&\n\t\texec $mkdirprog $mkdir_mode -p -- \"$tmpdir/d\") >/dev/null 2>&1\n\t    then\n\t      if test -z \"$dir_arg\" || {\n\t\t   # Check for POSIX incompatibilities with -m.\n\t\t   # HP-UX 11.23 and IRIX 6.5 mkdir -m -p sets group- or\n\t\t   # other-writable bit of parent directory when it shouldn't.\n\t\t   # FreeBSD 6.1 mkdir -m -p sets mode of existing directory.\n\t\t   ls_ld_tmpdir=`ls -ld \"$tmpdir\"`\n\t\t   case $ls_ld_tmpdir in\n\t\t     d????-?r-*) different_mode=700;;\n\t\t     d????-?--*) different_mode=755;;\n\t\t     *) false;;\n\t\t   esac &&\n\t\t   $mkdirprog -m$different_mode -p -- \"$tmpdir\" && {\n\t\t     ls_ld_tmpdir_1=`ls -ld \"$tmpdir\"`\n\t\t     test \"$ls_ld_tmpdir\" = \"$ls_ld_tmpdir_1\"\n\t\t   }\n\t\t }\n\t      then posix_mkdir=:\n\t      fi\n\t      rmdir \"$tmpdir/d\" \"$tmpdir\"\n\t    else\n\t      # Remove any dirs left behind by ancient mkdir implementations.\n\t      rmdir ./$mkdir_mode ./-p ./-- 2>/dev/null\n\t    fi\n\t    trap '' 0;;\n\tesac;;\n    esac\n\n    if\n      $posix_mkdir && (\n\tumask $mkdir_umask &&\n\t$doit_exec $mkdirprog $mkdir_mode -p -- \"$dstdir\"\n      )\n    then :\n    else\n\n      # The umask is ridiculous, or mkdir does not conform to POSIX,\n      # or it failed possibly due to a race condition.  Create the\n      # directory the slow way, step by step, checking for races as we go.\n\n      case $dstdir in\n\t/*) prefix='/';;\n\t[-=\\(\\)!]*) prefix='./';;\n\t*)  prefix='';;\n      esac\n\n      eval \"$initialize_posix_glob\"\n\n      oIFS=$IFS\n      IFS=/\n      $posix_glob set -f\n      set fnord $dstdir\n      shift\n      $posix_glob set +f\n      IFS=$oIFS\n\n      prefixes=\n\n      for d\n      do\n\ttest X\"$d\" = X && continue\n\n\tprefix=$prefix$d\n\tif test -d \"$prefix\"; then\n\t  prefixes=\n\telse\n\t  if $posix_mkdir; then\n\t    (umask=$mkdir_umask &&\n\t     $doit_exec $mkdirprog $mkdir_mode -p -- \"$dstdir\") && break\n\t    # Don't fail if two instances are running concurrently.\n\t    test -d \"$prefix\" || exit 1\n\t  else\n\t    case $prefix in\n\t      *\\'*) qprefix=`echo \"$prefix\" | sed \"s/'/'\\\\\\\\\\\\\\\\''/g\"`;;\n\t      *) qprefix=$prefix;;\n\t    esac\n\t    prefixes=\"$prefixes '$qprefix'\"\n\t  fi\n\tfi\n\tprefix=$prefix/\n      done\n\n      if test -n \"$prefixes\"; then\n\t# Don't fail if two instances are running concurrently.\n\t(umask $mkdir_umask &&\n\t eval \"\\$doit_exec \\$mkdirprog $prefixes\") ||\n\t  test -d \"$dstdir\" || exit 1\n\tobsolete_mkdir_used=true\n      fi\n    fi\n  fi\n\n  if test -n \"$dir_arg\"; then\n    { test -z \"$chowncmd\" || $doit $chowncmd \"$dst\"; } &&\n    { test -z \"$chgrpcmd\" || $doit $chgrpcmd \"$dst\"; } &&\n    { test \"$obsolete_mkdir_used$chowncmd$chgrpcmd\" = false ||\n      test -z \"$chmodcmd\" || $doit $chmodcmd $mode \"$dst\"; } || exit 1\n  else\n\n    # Make a couple of temp file names in the proper directory.\n    dsttmp=$dstdir/_inst.$$_\n    rmtmp=$dstdir/_rm.$$_\n\n    # Trap to clean up those temp files at exit.\n    trap 'ret=$?; rm -f \"$dsttmp\" \"$rmtmp\" && exit $ret' 0\n\n    # Copy the file name to the temp name.\n    (umask $cp_umask && $doit_exec $cpprog \"$src\" \"$dsttmp\") &&\n\n    # and set any options; do chmod last to preserve setuid bits.\n    #\n    # If any of these fail, we abort the whole thing.  If we want to\n    # ignore errors from any of these, just make sure not to ignore\n    # errors from the above \"$doit $cpprog $src $dsttmp\" command.\n    #\n    { test -z \"$chowncmd\" || $doit $chowncmd \"$dsttmp\"; } &&\n    { test -z \"$chgrpcmd\" || $doit $chgrpcmd \"$dsttmp\"; } &&\n    { test -z \"$stripcmd\" || $doit $stripcmd \"$dsttmp\"; } &&\n    { test -z \"$chmodcmd\" || $doit $chmodcmd $mode \"$dsttmp\"; } &&\n\n    # If -C, don't bother to copy if it wouldn't change the file.\n    if $copy_on_change &&\n       old=`LC_ALL=C ls -dlL \"$dst\"\t2>/dev/null` &&\n       new=`LC_ALL=C ls -dlL \"$dsttmp\"\t2>/dev/null` &&\n\n       eval \"$initialize_posix_glob\" &&\n       $posix_glob set -f &&\n       set X $old && old=:$2:$4:$5:$6 &&\n       set X $new && new=:$2:$4:$5:$6 &&\n       $posix_glob set +f &&\n\n       test \"$old\" = \"$new\" &&\n       $cmpprog \"$dst\" \"$dsttmp\" >/dev/null 2>&1\n    then\n      rm -f \"$dsttmp\"\n    else\n      # Rename the file to the real destination.\n      $doit $mvcmd -f \"$dsttmp\" \"$dst\" 2>/dev/null ||\n\n      # The rename failed, perhaps because mv can't rename something else\n      # to itself, or perhaps because mv is so ancient that it does not\n      # support -f.\n      {\n\t# Now remove or move aside any old file at destination location.\n\t# We try this two ways since rm can't unlink itself on some\n\t# systems and the destination file might be busy for other\n\t# reasons.  In this case, the final cleanup might fail but the new\n\t# file should still install successfully.\n\t{\n\t  test ! -f \"$dst\" ||\n\t  $doit $rmcmd -f \"$dst\" 2>/dev/null ||\n\t  { $doit $mvcmd -f \"$dst\" \"$rmtmp\" 2>/dev/null &&\n\t    { $doit $rmcmd -f \"$rmtmp\" 2>/dev/null; :; }\n\t  } ||\n\t  { echo \"$0: cannot unlink or rename $dst\" >&2\n\t    (exit 1); exit 1\n\t  }\n\t} &&\n\n\t# Now rename the file to the real destination.\n\t$doit $mvcmd \"$dsttmp\" \"$dst\"\n      }\n    fi || exit 1\n\n    trap '' 0\n  fi\ndone\n\n# Local variables:\n# eval: (add-hook 'write-file-hooks 'time-stamp)\n# time-stamp-start: \"scriptversion=\"\n# time-stamp-format: \"%:y-%02m-%02d.%02H\"\n# time-stamp-time-zone: \"UTC\"\n# time-stamp-end: \"; # UTC\"\n# End:\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/ltmain.sh",
    "content": "\n# libtool (GNU libtool) 2.4.2\n# Written by Gordon Matzigkeit <gord@gnu.ai.mit.edu>, 1996\n\n# Copyright (C) 1996, 1997, 1998, 1999, 2000, 2001, 2003, 2004, 2005, 2006,\n# 2007, 2008, 2009, 2010, 2011 Free Software Foundation, Inc.\n# This is free software; see the source for copying conditions.  There is NO\n# warranty; not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.\n\n# GNU Libtool is free software; you can redistribute it and/or modify\n# it under the terms of the GNU General Public License as published by\n# the Free Software Foundation; either version 2 of the License, or\n# (at your option) any later version.\n#\n# As a special exception to the GNU General Public License,\n# if you distribute this file as part of a program or library that\n# is built using GNU Libtool, you may include this file under the\n# same distribution terms that you use for the rest of that program.\n#\n# GNU Libtool is distributed in the hope that it will be useful, but\n# WITHOUT ANY WARRANTY; without even the implied warranty of\n# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n# General Public License for more details.\n#\n# You should have received a copy of the GNU General Public License\n# along with GNU Libtool; see the file COPYING.  If not, a copy\n# can be downloaded from http://www.gnu.org/licenses/gpl.html,\n# or obtained by writing to the Free Software Foundation, Inc.,\n# 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.\n\n# Usage: $progname [OPTION]... [MODE-ARG]...\n#\n# Provide generalized library-building support services.\n#\n#       --config             show all configuration variables\n#       --debug              enable verbose shell tracing\n#   -n, --dry-run            display commands without modifying any files\n#       --features           display basic configuration information and exit\n#       --mode=MODE          use operation mode MODE\n#       --preserve-dup-deps  don't remove duplicate dependency libraries\n#       --quiet, --silent    don't print informational messages\n#       --no-quiet, --no-silent\n#                            print informational messages (default)\n#       --no-warn            don't display warning messages\n#       --tag=TAG            use configuration variables from tag TAG\n#   -v, --verbose            print more informational messages than default\n#       --no-verbose         don't print the extra informational messages\n#       --version            print version information\n#   -h, --help, --help-all   print short, long, or detailed help message\n#\n# MODE must be one of the following:\n#\n#         clean              remove files from the build directory\n#         compile            compile a source file into a libtool object\n#         execute            automatically set library path, then run a program\n#         finish             complete the installation of libtool libraries\n#         install            install libraries or executables\n#         link               create a library or an executable\n#         uninstall          remove libraries from an installed directory\n#\n# MODE-ARGS vary depending on the MODE.  When passed as first option,\n# `--mode=MODE' may be abbreviated as `MODE' or a unique abbreviation of that.\n# Try `$progname --help --mode=MODE' for a more detailed description of MODE.\n#\n# When reporting a bug, please describe a test case to reproduce it and\n# include the following information:\n#\n#         host-triplet:\t$host\n#         shell:\t\t$SHELL\n#         compiler:\t\t$LTCC\n#         compiler flags:\t\t$LTCFLAGS\n#         linker:\t\t$LD (gnu? $with_gnu_ld)\n#         $progname:\t(GNU libtool) 2.4.2 Debian-2.4.2-1.7ubuntu1\n#         automake:\t$automake_version\n#         autoconf:\t$autoconf_version\n#\n# Report bugs to <bug-libtool@gnu.org>.\n# GNU libtool home page: <http://www.gnu.org/software/libtool/>.\n# General help using GNU software: <http://www.gnu.org/gethelp/>.\n\nPROGRAM=libtool\nPACKAGE=libtool\nVERSION=\"2.4.2 Debian-2.4.2-1.7ubuntu1\"\nTIMESTAMP=\"\"\npackage_revision=1.3337\n\n# Be Bourne compatible\nif test -n \"${ZSH_VERSION+set}\" && (emulate sh) >/dev/null 2>&1; then\n  emulate sh\n  NULLCMD=:\n  # Zsh 3.x and 4.x performs word splitting on ${1+\"$@\"}, which\n  # is contrary to our usage.  Disable this feature.\n  alias -g '${1+\"$@\"}'='\"$@\"'\n  setopt NO_GLOB_SUBST\nelse\n  case `(set -o) 2>/dev/null` in *posix*) set -o posix;; esac\nfi\nBIN_SH=xpg4; export BIN_SH # for Tru64\nDUALCASE=1; export DUALCASE # for MKS sh\n\n# A function that is used when there is no print builtin or printf.\nfunc_fallback_echo ()\n{\n  eval 'cat <<_LTECHO_EOF\n$1\n_LTECHO_EOF'\n}\n\n# NLS nuisances: We save the old values to restore during execute mode.\nlt_user_locale=\nlt_safe_locale=\nfor lt_var in LANG LANGUAGE LC_ALL LC_CTYPE LC_COLLATE LC_MESSAGES\ndo\n  eval \"if test \\\"\\${$lt_var+set}\\\" = set; then\n          save_$lt_var=\\$$lt_var\n          $lt_var=C\n\t  export $lt_var\n\t  lt_user_locale=\\\"$lt_var=\\\\\\$save_\\$lt_var; \\$lt_user_locale\\\"\n\t  lt_safe_locale=\\\"$lt_var=C; \\$lt_safe_locale\\\"\n\tfi\"\ndone\nLC_ALL=C\nLANGUAGE=C\nexport LANGUAGE LC_ALL\n\n$lt_unset CDPATH\n\n\n# Work around backward compatibility issue on IRIX 6.5. On IRIX 6.4+, sh\n# is ksh but when the shell is invoked as \"sh\" and the current value of\n# the _XPG environment variable is not equal to 1 (one), the special\n# positional parameter $0, within a function call, is the name of the\n# function.\nprogpath=\"$0\"\n\n\n\n: ${CP=\"cp -f\"}\ntest \"${ECHO+set}\" = set || ECHO=${as_echo-'printf %s\\n'}\n: ${MAKE=\"make\"}\n: ${MKDIR=\"mkdir\"}\n: ${MV=\"mv -f\"}\n: ${RM=\"rm -f\"}\n: ${SHELL=\"${CONFIG_SHELL-/bin/sh}\"}\n: ${Xsed=\"$SED -e 1s/^X//\"}\n\n# Global variables:\nEXIT_SUCCESS=0\nEXIT_FAILURE=1\nEXIT_MISMATCH=63  # $? = 63 is used to indicate version mismatch to missing.\nEXIT_SKIP=77\t  # $? = 77 is used to indicate a skipped test to automake.\n\nexit_status=$EXIT_SUCCESS\n\n# Make sure IFS has a sensible default\nlt_nl='\n'\nIFS=\" \t$lt_nl\"\n\ndirname=\"s,/[^/]*$,,\"\nbasename=\"s,^.*/,,\"\n\n# func_dirname file append nondir_replacement\n# Compute the dirname of FILE.  If nonempty, add APPEND to the result,\n# otherwise set result to NONDIR_REPLACEMENT.\nfunc_dirname ()\n{\n    func_dirname_result=`$ECHO \"${1}\" | $SED \"$dirname\"`\n    if test \"X$func_dirname_result\" = \"X${1}\"; then\n      func_dirname_result=\"${3}\"\n    else\n      func_dirname_result=\"$func_dirname_result${2}\"\n    fi\n} # func_dirname may be replaced by extended shell implementation\n\n\n# func_basename file\nfunc_basename ()\n{\n    func_basename_result=`$ECHO \"${1}\" | $SED \"$basename\"`\n} # func_basename may be replaced by extended shell implementation\n\n\n# func_dirname_and_basename file append nondir_replacement\n# perform func_basename and func_dirname in a single function\n# call:\n#   dirname:  Compute the dirname of FILE.  If nonempty,\n#             add APPEND to the result, otherwise set result\n#             to NONDIR_REPLACEMENT.\n#             value returned in \"$func_dirname_result\"\n#   basename: Compute filename of FILE.\n#             value retuned in \"$func_basename_result\"\n# Implementation must be kept synchronized with func_dirname\n# and func_basename. For efficiency, we do not delegate to\n# those functions but instead duplicate the functionality here.\nfunc_dirname_and_basename ()\n{\n    # Extract subdirectory from the argument.\n    func_dirname_result=`$ECHO \"${1}\" | $SED -e \"$dirname\"`\n    if test \"X$func_dirname_result\" = \"X${1}\"; then\n      func_dirname_result=\"${3}\"\n    else\n      func_dirname_result=\"$func_dirname_result${2}\"\n    fi\n    func_basename_result=`$ECHO \"${1}\" | $SED -e \"$basename\"`\n} # func_dirname_and_basename may be replaced by extended shell implementation\n\n\n# func_stripname prefix suffix name\n# strip PREFIX and SUFFIX off of NAME.\n# PREFIX and SUFFIX must not contain globbing or regex special\n# characters, hashes, percent signs, but SUFFIX may contain a leading\n# dot (in which case that matches only a dot).\n# func_strip_suffix prefix name\nfunc_stripname ()\n{\n    case ${2} in\n      .*) func_stripname_result=`$ECHO \"${3}\" | $SED \"s%^${1}%%; s%\\\\\\\\${2}\\$%%\"`;;\n      *)  func_stripname_result=`$ECHO \"${3}\" | $SED \"s%^${1}%%; s%${2}\\$%%\"`;;\n    esac\n} # func_stripname may be replaced by extended shell implementation\n\n\n# These SED scripts presuppose an absolute path with a trailing slash.\npathcar='s,^/\\([^/]*\\).*$,\\1,'\npathcdr='s,^/[^/]*,,'\nremovedotparts=':dotsl\n\t\ts@/\\./@/@g\n\t\tt dotsl\n\t\ts,/\\.$,/,'\ncollapseslashes='s@/\\{1,\\}@/@g'\nfinalslash='s,/*$,/,'\n\n# func_normal_abspath PATH\n# Remove doubled-up and trailing slashes, \".\" path components,\n# and cancel out any \"..\" path components in PATH after making\n# it an absolute path.\n#             value returned in \"$func_normal_abspath_result\"\nfunc_normal_abspath ()\n{\n  # Start from root dir and reassemble the path.\n  func_normal_abspath_result=\n  func_normal_abspath_tpath=$1\n  func_normal_abspath_altnamespace=\n  case $func_normal_abspath_tpath in\n    \"\")\n      # Empty path, that just means $cwd.\n      func_stripname '' '/' \"`pwd`\"\n      func_normal_abspath_result=$func_stripname_result\n      return\n    ;;\n    # The next three entries are used to spot a run of precisely\n    # two leading slashes without using negated character classes;\n    # we take advantage of case's first-match behaviour.\n    ///*)\n      # Unusual form of absolute path, do nothing.\n    ;;\n    //*)\n      # Not necessarily an ordinary path; POSIX reserves leading '//'\n      # and for example Cygwin uses it to access remote file shares\n      # over CIFS/SMB, so we conserve a leading double slash if found.\n      func_normal_abspath_altnamespace=/\n    ;;\n    /*)\n      # Absolute path, do nothing.\n    ;;\n    *)\n      # Relative path, prepend $cwd.\n      func_normal_abspath_tpath=`pwd`/$func_normal_abspath_tpath\n    ;;\n  esac\n  # Cancel out all the simple stuff to save iterations.  We also want\n  # the path to end with a slash for ease of parsing, so make sure\n  # there is one (and only one) here.\n  func_normal_abspath_tpath=`$ECHO \"$func_normal_abspath_tpath\" | $SED \\\n        -e \"$removedotparts\" -e \"$collapseslashes\" -e \"$finalslash\"`\n  while :; do\n    # Processed it all yet?\n    if test \"$func_normal_abspath_tpath\" = / ; then\n      # If we ascended to the root using \"..\" the result may be empty now.\n      if test -z \"$func_normal_abspath_result\" ; then\n        func_normal_abspath_result=/\n      fi\n      break\n    fi\n    func_normal_abspath_tcomponent=`$ECHO \"$func_normal_abspath_tpath\" | $SED \\\n        -e \"$pathcar\"`\n    func_normal_abspath_tpath=`$ECHO \"$func_normal_abspath_tpath\" | $SED \\\n        -e \"$pathcdr\"`\n    # Figure out what to do with it\n    case $func_normal_abspath_tcomponent in\n      \"\")\n        # Trailing empty path component, ignore it.\n      ;;\n      ..)\n        # Parent dir; strip last assembled component from result.\n        func_dirname \"$func_normal_abspath_result\"\n        func_normal_abspath_result=$func_dirname_result\n      ;;\n      *)\n        # Actual path component, append it.\n        func_normal_abspath_result=$func_normal_abspath_result/$func_normal_abspath_tcomponent\n      ;;\n    esac\n  done\n  # Restore leading double-slash if one was found on entry.\n  func_normal_abspath_result=$func_normal_abspath_altnamespace$func_normal_abspath_result\n}\n\n# func_relative_path SRCDIR DSTDIR\n# generates a relative path from SRCDIR to DSTDIR, with a trailing\n# slash if non-empty, suitable for immediately appending a filename\n# without needing to append a separator.\n#             value returned in \"$func_relative_path_result\"\nfunc_relative_path ()\n{\n  func_relative_path_result=\n  func_normal_abspath \"$1\"\n  func_relative_path_tlibdir=$func_normal_abspath_result\n  func_normal_abspath \"$2\"\n  func_relative_path_tbindir=$func_normal_abspath_result\n\n  # Ascend the tree starting from libdir\n  while :; do\n    # check if we have found a prefix of bindir\n    case $func_relative_path_tbindir in\n      $func_relative_path_tlibdir)\n        # found an exact match\n        func_relative_path_tcancelled=\n        break\n        ;;\n      $func_relative_path_tlibdir*)\n        # found a matching prefix\n        func_stripname \"$func_relative_path_tlibdir\" '' \"$func_relative_path_tbindir\"\n        func_relative_path_tcancelled=$func_stripname_result\n        if test -z \"$func_relative_path_result\"; then\n          func_relative_path_result=.\n        fi\n        break\n        ;;\n      *)\n        func_dirname $func_relative_path_tlibdir\n        func_relative_path_tlibdir=${func_dirname_result}\n        if test \"x$func_relative_path_tlibdir\" = x ; then\n          # Have to descend all the way to the root!\n          func_relative_path_result=../$func_relative_path_result\n          func_relative_path_tcancelled=$func_relative_path_tbindir\n          break\n        fi\n        func_relative_path_result=../$func_relative_path_result\n        ;;\n    esac\n  done\n\n  # Now calculate path; take care to avoid doubling-up slashes.\n  func_stripname '' '/' \"$func_relative_path_result\"\n  func_relative_path_result=$func_stripname_result\n  func_stripname '/' '/' \"$func_relative_path_tcancelled\"\n  if test \"x$func_stripname_result\" != x ; then\n    func_relative_path_result=${func_relative_path_result}/${func_stripname_result}\n  fi\n\n  # Normalisation. If bindir is libdir, return empty string,\n  # else relative path ending with a slash; either way, target\n  # file name can be directly appended.\n  if test ! -z \"$func_relative_path_result\"; then\n    func_stripname './' '' \"$func_relative_path_result/\"\n    func_relative_path_result=$func_stripname_result\n  fi\n}\n\n# The name of this program:\nfunc_dirname_and_basename \"$progpath\"\nprogname=$func_basename_result\n\n# Make sure we have an absolute path for reexecution:\ncase $progpath in\n  [\\\\/]*|[A-Za-z]:\\\\*) ;;\n  *[\\\\/]*)\n     progdir=$func_dirname_result\n     progdir=`cd \"$progdir\" && pwd`\n     progpath=\"$progdir/$progname\"\n     ;;\n  *)\n     save_IFS=\"$IFS\"\n     IFS=${PATH_SEPARATOR-:}\n     for progdir in $PATH; do\n       IFS=\"$save_IFS\"\n       test -x \"$progdir/$progname\" && break\n     done\n     IFS=\"$save_IFS\"\n     test -n \"$progdir\" || progdir=`pwd`\n     progpath=\"$progdir/$progname\"\n     ;;\nesac\n\n# Sed substitution that helps us do robust quoting.  It backslashifies\n# metacharacters that are still active within double-quoted strings.\nXsed=\"${SED}\"' -e 1s/^X//'\nsed_quote_subst='s/\\([`\"$\\\\]\\)/\\\\\\1/g'\n\n# Same as above, but do not quote variable references.\ndouble_quote_subst='s/\\([\"`\\\\]\\)/\\\\\\1/g'\n\n# Sed substitution that turns a string into a regex matching for the\n# string literally.\nsed_make_literal_regex='s,[].[^$\\\\*\\/],\\\\&,g'\n\n# Sed substitution that converts a w32 file name or path\n# which contains forward slashes, into one that contains\n# (escaped) backslashes.  A very naive implementation.\nlt_sed_naive_backslashify='s|\\\\\\\\*|\\\\|g;s|/|\\\\|g;s|\\\\|\\\\\\\\|g'\n\n# Re-`\\' parameter expansions in output of double_quote_subst that were\n# `\\'-ed in input to the same.  If an odd number of `\\' preceded a '$'\n# in input to double_quote_subst, that '$' was protected from expansion.\n# Since each input `\\' is now two `\\'s, look for any number of runs of\n# four `\\'s followed by two `\\'s and then a '$'.  `\\' that '$'.\nbs='\\\\'\nbs2='\\\\\\\\'\nbs4='\\\\\\\\\\\\\\\\'\ndollar='\\$'\nsed_double_backslash=\"\\\n  s/$bs4/&\\\\\n/g\n  s/^$bs2$dollar/$bs&/\n  s/\\\\([^$bs]\\\\)$bs2$dollar/\\\\1$bs2$bs$dollar/g\n  s/\\n//g\"\n\n# Standard options:\nopt_dry_run=false\nopt_help=false\nopt_quiet=false\nopt_verbose=false\nopt_warning=:\n\n# func_echo arg...\n# Echo program name prefixed message, along with the current mode\n# name if it has been set yet.\nfunc_echo ()\n{\n    $ECHO \"$progname: ${opt_mode+$opt_mode: }$*\"\n}\n\n# func_verbose arg...\n# Echo program name prefixed message in verbose mode only.\nfunc_verbose ()\n{\n    $opt_verbose && func_echo ${1+\"$@\"}\n\n    # A bug in bash halts the script if the last line of a function\n    # fails when set -e is in force, so we need another command to\n    # work around that:\n    :\n}\n\n# func_echo_all arg...\n# Invoke $ECHO with all args, space-separated.\nfunc_echo_all ()\n{\n    $ECHO \"$*\"\n}\n\n# func_error arg...\n# Echo program name prefixed message to standard error.\nfunc_error ()\n{\n    $ECHO \"$progname: ${opt_mode+$opt_mode: }\"${1+\"$@\"} 1>&2\n}\n\n# func_warning arg...\n# Echo program name prefixed warning message to standard error.\nfunc_warning ()\n{\n    $opt_warning && $ECHO \"$progname: ${opt_mode+$opt_mode: }warning: \"${1+\"$@\"} 1>&2\n\n    # bash bug again:\n    :\n}\n\n# func_fatal_error arg...\n# Echo program name prefixed message to standard error, and exit.\nfunc_fatal_error ()\n{\n    func_error ${1+\"$@\"}\n    exit $EXIT_FAILURE\n}\n\n# func_fatal_help arg...\n# Echo program name prefixed message to standard error, followed by\n# a help hint, and exit.\nfunc_fatal_help ()\n{\n    func_error ${1+\"$@\"}\n    func_fatal_error \"$help\"\n}\nhelp=\"Try \\`$progname --help' for more information.\"  ## default\n\n\n# func_grep expression filename\n# Check whether EXPRESSION matches any line of FILENAME, without output.\nfunc_grep ()\n{\n    $GREP \"$1\" \"$2\" >/dev/null 2>&1\n}\n\n\n# func_mkdir_p directory-path\n# Make sure the entire path to DIRECTORY-PATH is available.\nfunc_mkdir_p ()\n{\n    my_directory_path=\"$1\"\n    my_dir_list=\n\n    if test -n \"$my_directory_path\" && test \"$opt_dry_run\" != \":\"; then\n\n      # Protect directory names starting with `-'\n      case $my_directory_path in\n        -*) my_directory_path=\"./$my_directory_path\" ;;\n      esac\n\n      # While some portion of DIR does not yet exist...\n      while test ! -d \"$my_directory_path\"; do\n        # ...make a list in topmost first order.  Use a colon delimited\n\t# list incase some portion of path contains whitespace.\n        my_dir_list=\"$my_directory_path:$my_dir_list\"\n\n        # If the last portion added has no slash in it, the list is done\n        case $my_directory_path in */*) ;; *) break ;; esac\n\n        # ...otherwise throw away the child directory and loop\n        my_directory_path=`$ECHO \"$my_directory_path\" | $SED -e \"$dirname\"`\n      done\n      my_dir_list=`$ECHO \"$my_dir_list\" | $SED 's,:*$,,'`\n\n      save_mkdir_p_IFS=\"$IFS\"; IFS=':'\n      for my_dir in $my_dir_list; do\n\tIFS=\"$save_mkdir_p_IFS\"\n        # mkdir can fail with a `File exist' error if two processes\n        # try to create one of the directories concurrently.  Don't\n        # stop in that case!\n        $MKDIR \"$my_dir\" 2>/dev/null || :\n      done\n      IFS=\"$save_mkdir_p_IFS\"\n\n      # Bail out if we (or some other process) failed to create a directory.\n      test -d \"$my_directory_path\" || \\\n        func_fatal_error \"Failed to create \\`$1'\"\n    fi\n}\n\n\n# func_mktempdir [string]\n# Make a temporary directory that won't clash with other running\n# libtool processes, and avoids race conditions if possible.  If\n# given, STRING is the basename for that directory.\nfunc_mktempdir ()\n{\n    my_template=\"${TMPDIR-/tmp}/${1-$progname}\"\n\n    if test \"$opt_dry_run\" = \":\"; then\n      # Return a directory name, but don't create it in dry-run mode\n      my_tmpdir=\"${my_template}-$$\"\n    else\n\n      # If mktemp works, use that first and foremost\n      my_tmpdir=`mktemp -d \"${my_template}-XXXXXXXX\" 2>/dev/null`\n\n      if test ! -d \"$my_tmpdir\"; then\n        # Failing that, at least try and use $RANDOM to avoid a race\n        my_tmpdir=\"${my_template}-${RANDOM-0}$$\"\n\n        save_mktempdir_umask=`umask`\n        umask 0077\n        $MKDIR \"$my_tmpdir\"\n        umask $save_mktempdir_umask\n      fi\n\n      # If we're not in dry-run mode, bomb out on failure\n      test -d \"$my_tmpdir\" || \\\n        func_fatal_error \"cannot create temporary directory \\`$my_tmpdir'\"\n    fi\n\n    $ECHO \"$my_tmpdir\"\n}\n\n\n# func_quote_for_eval arg\n# Aesthetically quote ARG to be evaled later.\n# This function returns two values: FUNC_QUOTE_FOR_EVAL_RESULT\n# is double-quoted, suitable for a subsequent eval, whereas\n# FUNC_QUOTE_FOR_EVAL_UNQUOTED_RESULT has merely all characters\n# which are still active within double quotes backslashified.\nfunc_quote_for_eval ()\n{\n    case $1 in\n      *[\\\\\\`\\\"\\$]*)\n\tfunc_quote_for_eval_unquoted_result=`$ECHO \"$1\" | $SED \"$sed_quote_subst\"` ;;\n      *)\n        func_quote_for_eval_unquoted_result=\"$1\" ;;\n    esac\n\n    case $func_quote_for_eval_unquoted_result in\n      # Double-quote args containing shell metacharacters to delay\n      # word splitting, command substitution and and variable\n      # expansion for a subsequent eval.\n      # Many Bourne shells cannot handle close brackets correctly\n      # in scan sets, so we specify it separately.\n      *[\\[\\~\\#\\^\\&\\*\\(\\)\\{\\}\\|\\;\\<\\>\\?\\'\\ \\\t]*|*]*|\"\")\n        func_quote_for_eval_result=\"\\\"$func_quote_for_eval_unquoted_result\\\"\"\n        ;;\n      *)\n        func_quote_for_eval_result=\"$func_quote_for_eval_unquoted_result\"\n    esac\n}\n\n\n# func_quote_for_expand arg\n# Aesthetically quote ARG to be evaled later; same as above,\n# but do not quote variable references.\nfunc_quote_for_expand ()\n{\n    case $1 in\n      *[\\\\\\`\\\"]*)\n\tmy_arg=`$ECHO \"$1\" | $SED \\\n\t    -e \"$double_quote_subst\" -e \"$sed_double_backslash\"` ;;\n      *)\n        my_arg=\"$1\" ;;\n    esac\n\n    case $my_arg in\n      # Double-quote args containing shell metacharacters to delay\n      # word splitting and command substitution for a subsequent eval.\n      # Many Bourne shells cannot handle close brackets correctly\n      # in scan sets, so we specify it separately.\n      *[\\[\\~\\#\\^\\&\\*\\(\\)\\{\\}\\|\\;\\<\\>\\?\\'\\ \\\t]*|*]*|\"\")\n        my_arg=\"\\\"$my_arg\\\"\"\n        ;;\n    esac\n\n    func_quote_for_expand_result=\"$my_arg\"\n}\n\n\n# func_show_eval cmd [fail_exp]\n# Unless opt_silent is true, then output CMD.  Then, if opt_dryrun is\n# not true, evaluate CMD.  If the evaluation of CMD fails, and FAIL_EXP\n# is given, then evaluate it.\nfunc_show_eval ()\n{\n    my_cmd=\"$1\"\n    my_fail_exp=\"${2-:}\"\n\n    ${opt_silent-false} || {\n      func_quote_for_expand \"$my_cmd\"\n      eval \"func_echo $func_quote_for_expand_result\"\n    }\n\n    if ${opt_dry_run-false}; then :; else\n      eval \"$my_cmd\"\n      my_status=$?\n      if test \"$my_status\" -eq 0; then :; else\n\teval \"(exit $my_status); $my_fail_exp\"\n      fi\n    fi\n}\n\n\n# func_show_eval_locale cmd [fail_exp]\n# Unless opt_silent is true, then output CMD.  Then, if opt_dryrun is\n# not true, evaluate CMD.  If the evaluation of CMD fails, and FAIL_EXP\n# is given, then evaluate it.  Use the saved locale for evaluation.\nfunc_show_eval_locale ()\n{\n    my_cmd=\"$1\"\n    my_fail_exp=\"${2-:}\"\n\n    ${opt_silent-false} || {\n      func_quote_for_expand \"$my_cmd\"\n      eval \"func_echo $func_quote_for_expand_result\"\n    }\n\n    if ${opt_dry_run-false}; then :; else\n      eval \"$lt_user_locale\n\t    $my_cmd\"\n      my_status=$?\n      eval \"$lt_safe_locale\"\n      if test \"$my_status\" -eq 0; then :; else\n\teval \"(exit $my_status); $my_fail_exp\"\n      fi\n    fi\n}\n\n# func_tr_sh\n# Turn $1 into a string suitable for a shell variable name.\n# Result is stored in $func_tr_sh_result.  All characters\n# not in the set a-zA-Z0-9_ are replaced with '_'. Further,\n# if $1 begins with a digit, a '_' is prepended as well.\nfunc_tr_sh ()\n{\n  case $1 in\n  [0-9]* | *[!a-zA-Z0-9_]*)\n    func_tr_sh_result=`$ECHO \"$1\" | $SED 's/^\\([0-9]\\)/_\\1/; s/[^a-zA-Z0-9_]/_/g'`\n    ;;\n  * )\n    func_tr_sh_result=$1\n    ;;\n  esac\n}\n\n\n# func_version\n# Echo version message to standard output and exit.\nfunc_version ()\n{\n    $opt_debug\n\n    $SED -n '/(C)/!b go\n\t:more\n\t/\\./!{\n\t  N\n\t  s/\\n# / /\n\t  b more\n\t}\n\t:go\n\t/^# '$PROGRAM' (GNU /,/# warranty; / {\n        s/^# //\n\ts/^# *$//\n        s/\\((C)\\)[ 0-9,-]*\\( [1-9][0-9]*\\)/\\1\\2/\n        p\n     }' < \"$progpath\"\n     exit $?\n}\n\n# func_usage\n# Echo short help message to standard output and exit.\nfunc_usage ()\n{\n    $opt_debug\n\n    $SED -n '/^# Usage:/,/^#  *.*--help/ {\n        s/^# //\n\ts/^# *$//\n\ts/\\$progname/'$progname'/\n\tp\n    }' < \"$progpath\"\n    echo\n    $ECHO \"run \\`$progname --help | more' for full usage\"\n    exit $?\n}\n\n# func_help [NOEXIT]\n# Echo long help message to standard output and exit,\n# unless 'noexit' is passed as argument.\nfunc_help ()\n{\n    $opt_debug\n\n    $SED -n '/^# Usage:/,/# Report bugs to/ {\n\t:print\n        s/^# //\n\ts/^# *$//\n\ts*\\$progname*'$progname'*\n\ts*\\$host*'\"$host\"'*\n\ts*\\$SHELL*'\"$SHELL\"'*\n\ts*\\$LTCC*'\"$LTCC\"'*\n\ts*\\$LTCFLAGS*'\"$LTCFLAGS\"'*\n\ts*\\$LD*'\"$LD\"'*\n\ts/\\$with_gnu_ld/'\"$with_gnu_ld\"'/\n\ts/\\$automake_version/'\"`(${AUTOMAKE-automake} --version) 2>/dev/null |$SED 1q`\"'/\n\ts/\\$autoconf_version/'\"`(${AUTOCONF-autoconf} --version) 2>/dev/null |$SED 1q`\"'/\n\tp\n\td\n     }\n     /^# .* home page:/b print\n     /^# General help using/b print\n     ' < \"$progpath\"\n    ret=$?\n    if test -z \"$1\"; then\n      exit $ret\n    fi\n}\n\n# func_missing_arg argname\n# Echo program name prefixed message to standard error and set global\n# exit_cmd.\nfunc_missing_arg ()\n{\n    $opt_debug\n\n    func_error \"missing argument for $1.\"\n    exit_cmd=exit\n}\n\n\n# func_split_short_opt shortopt\n# Set func_split_short_opt_name and func_split_short_opt_arg shell\n# variables after splitting SHORTOPT after the 2nd character.\nfunc_split_short_opt ()\n{\n    my_sed_short_opt='1s/^\\(..\\).*$/\\1/;q'\n    my_sed_short_rest='1s/^..\\(.*\\)$/\\1/;q'\n\n    func_split_short_opt_name=`$ECHO \"$1\" | $SED \"$my_sed_short_opt\"`\n    func_split_short_opt_arg=`$ECHO \"$1\" | $SED \"$my_sed_short_rest\"`\n} # func_split_short_opt may be replaced by extended shell implementation\n\n\n# func_split_long_opt longopt\n# Set func_split_long_opt_name and func_split_long_opt_arg shell\n# variables after splitting LONGOPT at the `=' sign.\nfunc_split_long_opt ()\n{\n    my_sed_long_opt='1s/^\\(--[^=]*\\)=.*/\\1/;q'\n    my_sed_long_arg='1s/^--[^=]*=//'\n\n    func_split_long_opt_name=`$ECHO \"$1\" | $SED \"$my_sed_long_opt\"`\n    func_split_long_opt_arg=`$ECHO \"$1\" | $SED \"$my_sed_long_arg\"`\n} # func_split_long_opt may be replaced by extended shell implementation\n\nexit_cmd=:\n\n\n\n\n\nmagic=\"%%%MAGIC variable%%%\"\nmagic_exe=\"%%%MAGIC EXE variable%%%\"\n\n# Global variables.\nnonopt=\npreserve_args=\nlo2o=\"s/\\\\.lo\\$/.${objext}/\"\no2lo=\"s/\\\\.${objext}\\$/.lo/\"\nextracted_archives=\nextracted_serial=0\n\n# If this variable is set in any of the actions, the command in it\n# will be execed at the end.  This prevents here-documents from being\n# left over by shells.\nexec_cmd=\n\n# func_append var value\n# Append VALUE to the end of shell variable VAR.\nfunc_append ()\n{\n    eval \"${1}=\\$${1}\\${2}\"\n} # func_append may be replaced by extended shell implementation\n\n# func_append_quoted var value\n# Quote VALUE and append to the end of shell variable VAR, separated\n# by a space.\nfunc_append_quoted ()\n{\n    func_quote_for_eval \"${2}\"\n    eval \"${1}=\\$${1}\\\\ \\$func_quote_for_eval_result\"\n} # func_append_quoted may be replaced by extended shell implementation\n\n\n# func_arith arithmetic-term...\nfunc_arith ()\n{\n    func_arith_result=`expr \"${@}\"`\n} # func_arith may be replaced by extended shell implementation\n\n\n# func_len string\n# STRING may not start with a hyphen.\nfunc_len ()\n{\n    func_len_result=`expr \"${1}\" : \".*\" 2>/dev/null || echo $max_cmd_len`\n} # func_len may be replaced by extended shell implementation\n\n\n# func_lo2o object\nfunc_lo2o ()\n{\n    func_lo2o_result=`$ECHO \"${1}\" | $SED \"$lo2o\"`\n} # func_lo2o may be replaced by extended shell implementation\n\n\n# func_xform libobj-or-source\nfunc_xform ()\n{\n    func_xform_result=`$ECHO \"${1}\" | $SED 's/\\.[^.]*$/.lo/'`\n} # func_xform may be replaced by extended shell implementation\n\n\n# func_fatal_configuration arg...\n# Echo program name prefixed message to standard error, followed by\n# a configuration failure hint, and exit.\nfunc_fatal_configuration ()\n{\n    func_error ${1+\"$@\"}\n    func_error \"See the $PACKAGE documentation for more information.\"\n    func_fatal_error \"Fatal configuration error.\"\n}\n\n\n# func_config\n# Display the configuration for all the tags in this script.\nfunc_config ()\n{\n    re_begincf='^# ### BEGIN LIBTOOL'\n    re_endcf='^# ### END LIBTOOL'\n\n    # Default configuration.\n    $SED \"1,/$re_begincf CONFIG/d;/$re_endcf CONFIG/,\\$d\" < \"$progpath\"\n\n    # Now print the configurations for the tags.\n    for tagname in $taglist; do\n      $SED -n \"/$re_begincf TAG CONFIG: $tagname\\$/,/$re_endcf TAG CONFIG: $tagname\\$/p\" < \"$progpath\"\n    done\n\n    exit $?\n}\n\n# func_features\n# Display the features supported by this script.\nfunc_features ()\n{\n    echo \"host: $host\"\n    if test \"$build_libtool_libs\" = yes; then\n      echo \"enable shared libraries\"\n    else\n      echo \"disable shared libraries\"\n    fi\n    if test \"$build_old_libs\" = yes; then\n      echo \"enable static libraries\"\n    else\n      echo \"disable static libraries\"\n    fi\n\n    exit $?\n}\n\n# func_enable_tag tagname\n# Verify that TAGNAME is valid, and either flag an error and exit, or\n# enable the TAGNAME tag.  We also add TAGNAME to the global $taglist\n# variable here.\nfunc_enable_tag ()\n{\n  # Global variable:\n  tagname=\"$1\"\n\n  re_begincf=\"^# ### BEGIN LIBTOOL TAG CONFIG: $tagname\\$\"\n  re_endcf=\"^# ### END LIBTOOL TAG CONFIG: $tagname\\$\"\n  sed_extractcf=\"/$re_begincf/,/$re_endcf/p\"\n\n  # Validate tagname.\n  case $tagname in\n    *[!-_A-Za-z0-9,/]*)\n      func_fatal_error \"invalid tag name: $tagname\"\n      ;;\n  esac\n\n  # Don't test for the \"default\" C tag, as we know it's\n  # there but not specially marked.\n  case $tagname in\n    CC) ;;\n    *)\n      if $GREP \"$re_begincf\" \"$progpath\" >/dev/null 2>&1; then\n\ttaglist=\"$taglist $tagname\"\n\n\t# Evaluate the configuration.  Be careful to quote the path\n\t# and the sed script, to avoid splitting on whitespace, but\n\t# also don't use non-portable quotes within backquotes within\n\t# quotes we have to do it in 2 steps:\n\textractedcf=`$SED -n -e \"$sed_extractcf\" < \"$progpath\"`\n\teval \"$extractedcf\"\n      else\n\tfunc_error \"ignoring unknown tag $tagname\"\n      fi\n      ;;\n  esac\n}\n\n# func_check_version_match\n# Ensure that we are using m4 macros, and libtool script from the same\n# release of libtool.\nfunc_check_version_match ()\n{\n  if test \"$package_revision\" != \"$macro_revision\"; then\n    if test \"$VERSION\" != \"$macro_version\"; then\n      if test -z \"$macro_version\"; then\n        cat >&2 <<_LT_EOF\n$progname: Version mismatch error.  This is $PACKAGE $VERSION, but the\n$progname: definition of this LT_INIT comes from an older release.\n$progname: You should recreate aclocal.m4 with macros from $PACKAGE $VERSION\n$progname: and run autoconf again.\n_LT_EOF\n      else\n        cat >&2 <<_LT_EOF\n$progname: Version mismatch error.  This is $PACKAGE $VERSION, but the\n$progname: definition of this LT_INIT comes from $PACKAGE $macro_version.\n$progname: You should recreate aclocal.m4 with macros from $PACKAGE $VERSION\n$progname: and run autoconf again.\n_LT_EOF\n      fi\n    else\n      cat >&2 <<_LT_EOF\n$progname: Version mismatch error.  This is $PACKAGE $VERSION, revision $package_revision,\n$progname: but the definition of this LT_INIT comes from revision $macro_revision.\n$progname: You should recreate aclocal.m4 with macros from revision $package_revision\n$progname: of $PACKAGE $VERSION and run autoconf again.\n_LT_EOF\n    fi\n\n    exit $EXIT_MISMATCH\n  fi\n}\n\n\n# Shorthand for --mode=foo, only valid as the first argument\ncase $1 in\nclean|clea|cle|cl)\n  shift; set dummy --mode clean ${1+\"$@\"}; shift\n  ;;\ncompile|compil|compi|comp|com|co|c)\n  shift; set dummy --mode compile ${1+\"$@\"}; shift\n  ;;\nexecute|execut|execu|exec|exe|ex|e)\n  shift; set dummy --mode execute ${1+\"$@\"}; shift\n  ;;\nfinish|finis|fini|fin|fi|f)\n  shift; set dummy --mode finish ${1+\"$@\"}; shift\n  ;;\ninstall|instal|insta|inst|ins|in|i)\n  shift; set dummy --mode install ${1+\"$@\"}; shift\n  ;;\nlink|lin|li|l)\n  shift; set dummy --mode link ${1+\"$@\"}; shift\n  ;;\nuninstall|uninstal|uninsta|uninst|unins|unin|uni|un|u)\n  shift; set dummy --mode uninstall ${1+\"$@\"}; shift\n  ;;\nesac\n\n\n\n# Option defaults:\nopt_debug=:\nopt_dry_run=false\nopt_config=false\nopt_preserve_dup_deps=false\nopt_features=false\nopt_finish=false\nopt_help=false\nopt_help_all=false\nopt_silent=:\nopt_warning=:\nopt_verbose=:\nopt_silent=false\nopt_verbose=false\n\n\n# Parse options once, thoroughly.  This comes as soon as possible in the\n# script to make things like `--version' happen as quickly as we can.\n{\n  # this just eases exit handling\n  while test $# -gt 0; do\n    opt=\"$1\"\n    shift\n    case $opt in\n      --debug|-x)\topt_debug='set -x'\n\t\t\tfunc_echo \"enabling shell trace mode\"\n\t\t\t$opt_debug\n\t\t\t;;\n      --dry-run|--dryrun|-n)\n\t\t\topt_dry_run=:\n\t\t\t;;\n      --config)\n\t\t\topt_config=:\nfunc_config\n\t\t\t;;\n      --dlopen|-dlopen)\n\t\t\toptarg=\"$1\"\n\t\t\topt_dlopen=\"${opt_dlopen+$opt_dlopen\n}$optarg\"\n\t\t\tshift\n\t\t\t;;\n      --preserve-dup-deps)\n\t\t\topt_preserve_dup_deps=:\n\t\t\t;;\n      --features)\n\t\t\topt_features=:\nfunc_features\n\t\t\t;;\n      --finish)\n\t\t\topt_finish=:\nset dummy --mode finish ${1+\"$@\"}; shift\n\t\t\t;;\n      --help)\n\t\t\topt_help=:\n\t\t\t;;\n      --help-all)\n\t\t\topt_help_all=:\nopt_help=': help-all'\n\t\t\t;;\n      --mode)\n\t\t\ttest $# = 0 && func_missing_arg $opt && break\n\t\t\toptarg=\"$1\"\n\t\t\topt_mode=\"$optarg\"\ncase $optarg in\n  # Valid mode arguments:\n  clean|compile|execute|finish|install|link|relink|uninstall) ;;\n\n  # Catch anything else as an error\n  *) func_error \"invalid argument for $opt\"\n     exit_cmd=exit\n     break\n     ;;\nesac\n\t\t\tshift\n\t\t\t;;\n      --no-silent|--no-quiet)\n\t\t\topt_silent=false\nfunc_append preserve_args \" $opt\"\n\t\t\t;;\n      --no-warning|--no-warn)\n\t\t\topt_warning=false\nfunc_append preserve_args \" $opt\"\n\t\t\t;;\n      --no-verbose)\n\t\t\topt_verbose=false\nfunc_append preserve_args \" $opt\"\n\t\t\t;;\n      --silent|--quiet)\n\t\t\topt_silent=:\nfunc_append preserve_args \" $opt\"\n        opt_verbose=false\n\t\t\t;;\n      --verbose|-v)\n\t\t\topt_verbose=:\nfunc_append preserve_args \" $opt\"\nopt_silent=false\n\t\t\t;;\n      --tag)\n\t\t\ttest $# = 0 && func_missing_arg $opt && break\n\t\t\toptarg=\"$1\"\n\t\t\topt_tag=\"$optarg\"\nfunc_append preserve_args \" $opt $optarg\"\nfunc_enable_tag \"$optarg\"\n\t\t\tshift\n\t\t\t;;\n\n      -\\?|-h)\t\tfunc_usage\t\t\t\t;;\n      --help)\t\tfunc_help\t\t\t\t;;\n      --version)\tfunc_version\t\t\t\t;;\n\n      # Separate optargs to long options:\n      --*=*)\n\t\t\tfunc_split_long_opt \"$opt\"\n\t\t\tset dummy \"$func_split_long_opt_name\" \"$func_split_long_opt_arg\" ${1+\"$@\"}\n\t\t\tshift\n\t\t\t;;\n\n      # Separate non-argument short options:\n      -\\?*|-h*|-n*|-v*)\n\t\t\tfunc_split_short_opt \"$opt\"\n\t\t\tset dummy \"$func_split_short_opt_name\" \"-$func_split_short_opt_arg\" ${1+\"$@\"}\n\t\t\tshift\n\t\t\t;;\n\n      --)\t\tbreak\t\t\t\t\t;;\n      -*)\t\tfunc_fatal_help \"unrecognized option \\`$opt'\" ;;\n      *)\t\tset dummy \"$opt\" ${1+\"$@\"};\tshift; break  ;;\n    esac\n  done\n\n  # Validate options:\n\n  # save first non-option argument\n  if test \"$#\" -gt 0; then\n    nonopt=\"$opt\"\n    shift\n  fi\n\n  # preserve --debug\n  test \"$opt_debug\" = : || func_append preserve_args \" --debug\"\n\n  case $host in\n    *cygwin* | *mingw* | *pw32* | *cegcc*)\n      # don't eliminate duplications in $postdeps and $predeps\n      opt_duplicate_compiler_generated_deps=:\n      ;;\n    *)\n      opt_duplicate_compiler_generated_deps=$opt_preserve_dup_deps\n      ;;\n  esac\n\n  $opt_help || {\n    # Sanity checks first:\n    func_check_version_match\n\n    if test \"$build_libtool_libs\" != yes && test \"$build_old_libs\" != yes; then\n      func_fatal_configuration \"not configured to build any kind of library\"\n    fi\n\n    # Darwin sucks\n    eval std_shrext=\\\"$shrext_cmds\\\"\n\n    # Only execute mode is allowed to have -dlopen flags.\n    if test -n \"$opt_dlopen\" && test \"$opt_mode\" != execute; then\n      func_error \"unrecognized option \\`-dlopen'\"\n      $ECHO \"$help\" 1>&2\n      exit $EXIT_FAILURE\n    fi\n\n    # Change the help message to a mode-specific one.\n    generic_help=\"$help\"\n    help=\"Try \\`$progname --help --mode=$opt_mode' for more information.\"\n  }\n\n\n  # Bail if the options were screwed\n  $exit_cmd $EXIT_FAILURE\n}\n\n\n\n\n## ----------- ##\n##    Main.    ##\n## ----------- ##\n\n# func_lalib_p file\n# True iff FILE is a libtool `.la' library or `.lo' object file.\n# This function is only a basic sanity check; it will hardly flush out\n# determined imposters.\nfunc_lalib_p ()\n{\n    test -f \"$1\" &&\n      $SED -e 4q \"$1\" 2>/dev/null \\\n        | $GREP \"^# Generated by .*$PACKAGE\" > /dev/null 2>&1\n}\n\n# func_lalib_unsafe_p file\n# True iff FILE is a libtool `.la' library or `.lo' object file.\n# This function implements the same check as func_lalib_p without\n# resorting to external programs.  To this end, it redirects stdin and\n# closes it afterwards, without saving the original file descriptor.\n# As a safety measure, use it only where a negative result would be\n# fatal anyway.  Works if `file' does not exist.\nfunc_lalib_unsafe_p ()\n{\n    lalib_p=no\n    if test -f \"$1\" && test -r \"$1\" && exec 5<&0 <\"$1\"; then\n\tfor lalib_p_l in 1 2 3 4\n\tdo\n\t    read lalib_p_line\n\t    case \"$lalib_p_line\" in\n\t\t\\#\\ Generated\\ by\\ *$PACKAGE* ) lalib_p=yes; break;;\n\t    esac\n\tdone\n\texec 0<&5 5<&-\n    fi\n    test \"$lalib_p\" = yes\n}\n\n# func_ltwrapper_script_p file\n# True iff FILE is a libtool wrapper script\n# This function is only a basic sanity check; it will hardly flush out\n# determined imposters.\nfunc_ltwrapper_script_p ()\n{\n    func_lalib_p \"$1\"\n}\n\n# func_ltwrapper_executable_p file\n# True iff FILE is a libtool wrapper executable\n# This function is only a basic sanity check; it will hardly flush out\n# determined imposters.\nfunc_ltwrapper_executable_p ()\n{\n    func_ltwrapper_exec_suffix=\n    case $1 in\n    *.exe) ;;\n    *) func_ltwrapper_exec_suffix=.exe ;;\n    esac\n    $GREP \"$magic_exe\" \"$1$func_ltwrapper_exec_suffix\" >/dev/null 2>&1\n}\n\n# func_ltwrapper_scriptname file\n# Assumes file is an ltwrapper_executable\n# uses $file to determine the appropriate filename for a\n# temporary ltwrapper_script.\nfunc_ltwrapper_scriptname ()\n{\n    func_dirname_and_basename \"$1\" \"\" \".\"\n    func_stripname '' '.exe' \"$func_basename_result\"\n    func_ltwrapper_scriptname_result=\"$func_dirname_result/$objdir/${func_stripname_result}_ltshwrapper\"\n}\n\n# func_ltwrapper_p file\n# True iff FILE is a libtool wrapper script or wrapper executable\n# This function is only a basic sanity check; it will hardly flush out\n# determined imposters.\nfunc_ltwrapper_p ()\n{\n    func_ltwrapper_script_p \"$1\" || func_ltwrapper_executable_p \"$1\"\n}\n\n\n# func_execute_cmds commands fail_cmd\n# Execute tilde-delimited COMMANDS.\n# If FAIL_CMD is given, eval that upon failure.\n# FAIL_CMD may read-access the current command in variable CMD!\nfunc_execute_cmds ()\n{\n    $opt_debug\n    save_ifs=$IFS; IFS='~'\n    for cmd in $1; do\n      IFS=$save_ifs\n      eval cmd=\\\"$cmd\\\"\n      func_show_eval \"$cmd\" \"${2-:}\"\n    done\n    IFS=$save_ifs\n}\n\n\n# func_source file\n# Source FILE, adding directory component if necessary.\n# Note that it is not necessary on cygwin/mingw to append a dot to\n# FILE even if both FILE and FILE.exe exist: automatic-append-.exe\n# behavior happens only for exec(3), not for open(2)!  Also, sourcing\n# `FILE.' does not work on cygwin managed mounts.\nfunc_source ()\n{\n    $opt_debug\n    case $1 in\n    */* | *\\\\*)\t. \"$1\" ;;\n    *)\t\t. \"./$1\" ;;\n    esac\n}\n\n\n# func_resolve_sysroot PATH\n# Replace a leading = in PATH with a sysroot.  Store the result into\n# func_resolve_sysroot_result\nfunc_resolve_sysroot ()\n{\n  func_resolve_sysroot_result=$1\n  case $func_resolve_sysroot_result in\n  =*)\n    func_stripname '=' '' \"$func_resolve_sysroot_result\"\n    func_resolve_sysroot_result=$lt_sysroot$func_stripname_result\n    ;;\n  esac\n}\n\n# func_replace_sysroot PATH\n# If PATH begins with the sysroot, replace it with = and\n# store the result into func_replace_sysroot_result.\nfunc_replace_sysroot ()\n{\n  case \"$lt_sysroot:$1\" in\n  ?*:\"$lt_sysroot\"*)\n    func_stripname \"$lt_sysroot\" '' \"$1\"\n    func_replace_sysroot_result=\"=$func_stripname_result\"\n    ;;\n  *)\n    # Including no sysroot.\n    func_replace_sysroot_result=$1\n    ;;\n  esac\n}\n\n# func_infer_tag arg\n# Infer tagged configuration to use if any are available and\n# if one wasn't chosen via the \"--tag\" command line option.\n# Only attempt this if the compiler in the base compile\n# command doesn't match the default compiler.\n# arg is usually of the form 'gcc ...'\nfunc_infer_tag ()\n{\n    $opt_debug\n    if test -n \"$available_tags\" && test -z \"$tagname\"; then\n      CC_quoted=\n      for arg in $CC; do\n\tfunc_append_quoted CC_quoted \"$arg\"\n      done\n      CC_expanded=`func_echo_all $CC`\n      CC_quoted_expanded=`func_echo_all $CC_quoted`\n      case $@ in\n      # Blanks in the command may have been stripped by the calling shell,\n      # but not from the CC environment variable when configure was run.\n      \" $CC \"* | \"$CC \"* | \" $CC_expanded \"* | \"$CC_expanded \"* | \\\n      \" $CC_quoted\"* | \"$CC_quoted \"* | \" $CC_quoted_expanded \"* | \"$CC_quoted_expanded \"*) ;;\n      # Blanks at the start of $base_compile will cause this to fail\n      # if we don't check for them as well.\n      *)\n\tfor z in $available_tags; do\n\t  if $GREP \"^# ### BEGIN LIBTOOL TAG CONFIG: $z$\" < \"$progpath\" > /dev/null; then\n\t    # Evaluate the configuration.\n\t    eval \"`${SED} -n -e '/^# ### BEGIN LIBTOOL TAG CONFIG: '$z'$/,/^# ### END LIBTOOL TAG CONFIG: '$z'$/p' < $progpath`\"\n\t    CC_quoted=\n\t    for arg in $CC; do\n\t      # Double-quote args containing other shell metacharacters.\n\t      func_append_quoted CC_quoted \"$arg\"\n\t    done\n\t    CC_expanded=`func_echo_all $CC`\n\t    CC_quoted_expanded=`func_echo_all $CC_quoted`\n\t    case \"$@ \" in\n\t    \" $CC \"* | \"$CC \"* | \" $CC_expanded \"* | \"$CC_expanded \"* | \\\n\t    \" $CC_quoted\"* | \"$CC_quoted \"* | \" $CC_quoted_expanded \"* | \"$CC_quoted_expanded \"*)\n\t      # The compiler in the base compile command matches\n\t      # the one in the tagged configuration.\n\t      # Assume this is the tagged configuration we want.\n\t      tagname=$z\n\t      break\n\t      ;;\n\t    esac\n\t  fi\n\tdone\n\t# If $tagname still isn't set, then no tagged configuration\n\t# was found and let the user know that the \"--tag\" command\n\t# line option must be used.\n\tif test -z \"$tagname\"; then\n\t  func_echo \"unable to infer tagged configuration\"\n\t  func_fatal_error \"specify a tag with \\`--tag'\"\n#\telse\n#\t  func_verbose \"using $tagname tagged configuration\"\n\tfi\n\t;;\n      esac\n    fi\n}\n\n\n\n# func_write_libtool_object output_name pic_name nonpic_name\n# Create a libtool object file (analogous to a \".la\" file),\n# but don't create it if we're doing a dry run.\nfunc_write_libtool_object ()\n{\n    write_libobj=${1}\n    if test \"$build_libtool_libs\" = yes; then\n      write_lobj=\\'${2}\\'\n    else\n      write_lobj=none\n    fi\n\n    if test \"$build_old_libs\" = yes; then\n      write_oldobj=\\'${3}\\'\n    else\n      write_oldobj=none\n    fi\n\n    $opt_dry_run || {\n      cat >${write_libobj}T <<EOF\n# $write_libobj - a libtool object file\n# Generated by $PROGRAM (GNU $PACKAGE$TIMESTAMP) $VERSION\n#\n# Please DO NOT delete this file!\n# It is necessary for linking the library.\n\n# Name of the PIC object.\npic_object=$write_lobj\n\n# Name of the non-PIC object\nnon_pic_object=$write_oldobj\n\nEOF\n      $MV \"${write_libobj}T\" \"${write_libobj}\"\n    }\n}\n\n\n##################################################\n# FILE NAME AND PATH CONVERSION HELPER FUNCTIONS #\n##################################################\n\n# func_convert_core_file_wine_to_w32 ARG\n# Helper function used by file name conversion functions when $build is *nix,\n# and $host is mingw, cygwin, or some other w32 environment. Relies on a\n# correctly configured wine environment available, with the winepath program\n# in $build's $PATH.\n#\n# ARG is the $build file name to be converted to w32 format.\n# Result is available in $func_convert_core_file_wine_to_w32_result, and will\n# be empty on error (or when ARG is empty)\nfunc_convert_core_file_wine_to_w32 ()\n{\n  $opt_debug\n  func_convert_core_file_wine_to_w32_result=\"$1\"\n  if test -n \"$1\"; then\n    # Unfortunately, winepath does not exit with a non-zero error code, so we\n    # are forced to check the contents of stdout. On the other hand, if the\n    # command is not found, the shell will set an exit code of 127 and print\n    # *an error message* to stdout. So we must check for both error code of\n    # zero AND non-empty stdout, which explains the odd construction:\n    func_convert_core_file_wine_to_w32_tmp=`winepath -w \"$1\" 2>/dev/null`\n    if test \"$?\" -eq 0 && test -n \"${func_convert_core_file_wine_to_w32_tmp}\"; then\n      func_convert_core_file_wine_to_w32_result=`$ECHO \"$func_convert_core_file_wine_to_w32_tmp\" |\n        $SED -e \"$lt_sed_naive_backslashify\"`\n    else\n      func_convert_core_file_wine_to_w32_result=\n    fi\n  fi\n}\n# end: func_convert_core_file_wine_to_w32\n\n\n# func_convert_core_path_wine_to_w32 ARG\n# Helper function used by path conversion functions when $build is *nix, and\n# $host is mingw, cygwin, or some other w32 environment. Relies on a correctly\n# configured wine environment available, with the winepath program in $build's\n# $PATH. Assumes ARG has no leading or trailing path separator characters.\n#\n# ARG is path to be converted from $build format to win32.\n# Result is available in $func_convert_core_path_wine_to_w32_result.\n# Unconvertible file (directory) names in ARG are skipped; if no directory names\n# are convertible, then the result may be empty.\nfunc_convert_core_path_wine_to_w32 ()\n{\n  $opt_debug\n  # unfortunately, winepath doesn't convert paths, only file names\n  func_convert_core_path_wine_to_w32_result=\"\"\n  if test -n \"$1\"; then\n    oldIFS=$IFS\n    IFS=:\n    for func_convert_core_path_wine_to_w32_f in $1; do\n      IFS=$oldIFS\n      func_convert_core_file_wine_to_w32 \"$func_convert_core_path_wine_to_w32_f\"\n      if test -n \"$func_convert_core_file_wine_to_w32_result\" ; then\n        if test -z \"$func_convert_core_path_wine_to_w32_result\"; then\n          func_convert_core_path_wine_to_w32_result=\"$func_convert_core_file_wine_to_w32_result\"\n        else\n          func_append func_convert_core_path_wine_to_w32_result \";$func_convert_core_file_wine_to_w32_result\"\n        fi\n      fi\n    done\n    IFS=$oldIFS\n  fi\n}\n# end: func_convert_core_path_wine_to_w32\n\n\n# func_cygpath ARGS...\n# Wrapper around calling the cygpath program via LT_CYGPATH. This is used when\n# when (1) $build is *nix and Cygwin is hosted via a wine environment; or (2)\n# $build is MSYS and $host is Cygwin, or (3) $build is Cygwin. In case (1) or\n# (2), returns the Cygwin file name or path in func_cygpath_result (input\n# file name or path is assumed to be in w32 format, as previously converted\n# from $build's *nix or MSYS format). In case (3), returns the w32 file name\n# or path in func_cygpath_result (input file name or path is assumed to be in\n# Cygwin format). Returns an empty string on error.\n#\n# ARGS are passed to cygpath, with the last one being the file name or path to\n# be converted.\n#\n# Specify the absolute *nix (or w32) name to cygpath in the LT_CYGPATH\n# environment variable; do not put it in $PATH.\nfunc_cygpath ()\n{\n  $opt_debug\n  if test -n \"$LT_CYGPATH\" && test -f \"$LT_CYGPATH\"; then\n    func_cygpath_result=`$LT_CYGPATH \"$@\" 2>/dev/null`\n    if test \"$?\" -ne 0; then\n      # on failure, ensure result is empty\n      func_cygpath_result=\n    fi\n  else\n    func_cygpath_result=\n    func_error \"LT_CYGPATH is empty or specifies non-existent file: \\`$LT_CYGPATH'\"\n  fi\n}\n#end: func_cygpath\n\n\n# func_convert_core_msys_to_w32 ARG\n# Convert file name or path ARG from MSYS format to w32 format.  Return\n# result in func_convert_core_msys_to_w32_result.\nfunc_convert_core_msys_to_w32 ()\n{\n  $opt_debug\n  # awkward: cmd appends spaces to result\n  func_convert_core_msys_to_w32_result=`( cmd //c echo \"$1\" ) 2>/dev/null |\n    $SED -e 's/[ ]*$//' -e \"$lt_sed_naive_backslashify\"`\n}\n#end: func_convert_core_msys_to_w32\n\n\n# func_convert_file_check ARG1 ARG2\n# Verify that ARG1 (a file name in $build format) was converted to $host\n# format in ARG2. Otherwise, emit an error message, but continue (resetting\n# func_to_host_file_result to ARG1).\nfunc_convert_file_check ()\n{\n  $opt_debug\n  if test -z \"$2\" && test -n \"$1\" ; then\n    func_error \"Could not determine host file name corresponding to\"\n    func_error \"  \\`$1'\"\n    func_error \"Continuing, but uninstalled executables may not work.\"\n    # Fallback:\n    func_to_host_file_result=\"$1\"\n  fi\n}\n# end func_convert_file_check\n\n\n# func_convert_path_check FROM_PATHSEP TO_PATHSEP FROM_PATH TO_PATH\n# Verify that FROM_PATH (a path in $build format) was converted to $host\n# format in TO_PATH. Otherwise, emit an error message, but continue, resetting\n# func_to_host_file_result to a simplistic fallback value (see below).\nfunc_convert_path_check ()\n{\n  $opt_debug\n  if test -z \"$4\" && test -n \"$3\"; then\n    func_error \"Could not determine the host path corresponding to\"\n    func_error \"  \\`$3'\"\n    func_error \"Continuing, but uninstalled executables may not work.\"\n    # Fallback.  This is a deliberately simplistic \"conversion\" and\n    # should not be \"improved\".  See libtool.info.\n    if test \"x$1\" != \"x$2\"; then\n      lt_replace_pathsep_chars=\"s|$1|$2|g\"\n      func_to_host_path_result=`echo \"$3\" |\n        $SED -e \"$lt_replace_pathsep_chars\"`\n    else\n      func_to_host_path_result=\"$3\"\n    fi\n  fi\n}\n# end func_convert_path_check\n\n\n# func_convert_path_front_back_pathsep FRONTPAT BACKPAT REPL ORIG\n# Modifies func_to_host_path_result by prepending REPL if ORIG matches FRONTPAT\n# and appending REPL if ORIG matches BACKPAT.\nfunc_convert_path_front_back_pathsep ()\n{\n  $opt_debug\n  case $4 in\n  $1 ) func_to_host_path_result=\"$3$func_to_host_path_result\"\n    ;;\n  esac\n  case $4 in\n  $2 ) func_append func_to_host_path_result \"$3\"\n    ;;\n  esac\n}\n# end func_convert_path_front_back_pathsep\n\n\n##################################################\n# $build to $host FILE NAME CONVERSION FUNCTIONS #\n##################################################\n# invoked via `$to_host_file_cmd ARG'\n#\n# In each case, ARG is the path to be converted from $build to $host format.\n# Result will be available in $func_to_host_file_result.\n\n\n# func_to_host_file ARG\n# Converts the file name ARG from $build format to $host format. Return result\n# in func_to_host_file_result.\nfunc_to_host_file ()\n{\n  $opt_debug\n  $to_host_file_cmd \"$1\"\n}\n# end func_to_host_file\n\n\n# func_to_tool_file ARG LAZY\n# converts the file name ARG from $build format to toolchain format. Return\n# result in func_to_tool_file_result.  If the conversion in use is listed\n# in (the comma separated) LAZY, no conversion takes place.\nfunc_to_tool_file ()\n{\n  $opt_debug\n  case ,$2, in\n    *,\"$to_tool_file_cmd\",*)\n      func_to_tool_file_result=$1\n      ;;\n    *)\n      $to_tool_file_cmd \"$1\"\n      func_to_tool_file_result=$func_to_host_file_result\n      ;;\n  esac\n}\n# end func_to_tool_file\n\n\n# func_convert_file_noop ARG\n# Copy ARG to func_to_host_file_result.\nfunc_convert_file_noop ()\n{\n  func_to_host_file_result=\"$1\"\n}\n# end func_convert_file_noop\n\n\n# func_convert_file_msys_to_w32 ARG\n# Convert file name ARG from (mingw) MSYS to (mingw) w32 format; automatic\n# conversion to w32 is not available inside the cwrapper.  Returns result in\n# func_to_host_file_result.\nfunc_convert_file_msys_to_w32 ()\n{\n  $opt_debug\n  func_to_host_file_result=\"$1\"\n  if test -n \"$1\"; then\n    func_convert_core_msys_to_w32 \"$1\"\n    func_to_host_file_result=\"$func_convert_core_msys_to_w32_result\"\n  fi\n  func_convert_file_check \"$1\" \"$func_to_host_file_result\"\n}\n# end func_convert_file_msys_to_w32\n\n\n# func_convert_file_cygwin_to_w32 ARG\n# Convert file name ARG from Cygwin to w32 format.  Returns result in\n# func_to_host_file_result.\nfunc_convert_file_cygwin_to_w32 ()\n{\n  $opt_debug\n  func_to_host_file_result=\"$1\"\n  if test -n \"$1\"; then\n    # because $build is cygwin, we call \"the\" cygpath in $PATH; no need to use\n    # LT_CYGPATH in this case.\n    func_to_host_file_result=`cygpath -m \"$1\"`\n  fi\n  func_convert_file_check \"$1\" \"$func_to_host_file_result\"\n}\n# end func_convert_file_cygwin_to_w32\n\n\n# func_convert_file_nix_to_w32 ARG\n# Convert file name ARG from *nix to w32 format.  Requires a wine environment\n# and a working winepath. Returns result in func_to_host_file_result.\nfunc_convert_file_nix_to_w32 ()\n{\n  $opt_debug\n  func_to_host_file_result=\"$1\"\n  if test -n \"$1\"; then\n    func_convert_core_file_wine_to_w32 \"$1\"\n    func_to_host_file_result=\"$func_convert_core_file_wine_to_w32_result\"\n  fi\n  func_convert_file_check \"$1\" \"$func_to_host_file_result\"\n}\n# end func_convert_file_nix_to_w32\n\n\n# func_convert_file_msys_to_cygwin ARG\n# Convert file name ARG from MSYS to Cygwin format.  Requires LT_CYGPATH set.\n# Returns result in func_to_host_file_result.\nfunc_convert_file_msys_to_cygwin ()\n{\n  $opt_debug\n  func_to_host_file_result=\"$1\"\n  if test -n \"$1\"; then\n    func_convert_core_msys_to_w32 \"$1\"\n    func_cygpath -u \"$func_convert_core_msys_to_w32_result\"\n    func_to_host_file_result=\"$func_cygpath_result\"\n  fi\n  func_convert_file_check \"$1\" \"$func_to_host_file_result\"\n}\n# end func_convert_file_msys_to_cygwin\n\n\n# func_convert_file_nix_to_cygwin ARG\n# Convert file name ARG from *nix to Cygwin format.  Requires Cygwin installed\n# in a wine environment, working winepath, and LT_CYGPATH set.  Returns result\n# in func_to_host_file_result.\nfunc_convert_file_nix_to_cygwin ()\n{\n  $opt_debug\n  func_to_host_file_result=\"$1\"\n  if test -n \"$1\"; then\n    # convert from *nix to w32, then use cygpath to convert from w32 to cygwin.\n    func_convert_core_file_wine_to_w32 \"$1\"\n    func_cygpath -u \"$func_convert_core_file_wine_to_w32_result\"\n    func_to_host_file_result=\"$func_cygpath_result\"\n  fi\n  func_convert_file_check \"$1\" \"$func_to_host_file_result\"\n}\n# end func_convert_file_nix_to_cygwin\n\n\n#############################################\n# $build to $host PATH CONVERSION FUNCTIONS #\n#############################################\n# invoked via `$to_host_path_cmd ARG'\n#\n# In each case, ARG is the path to be converted from $build to $host format.\n# The result will be available in $func_to_host_path_result.\n#\n# Path separators are also converted from $build format to $host format.  If\n# ARG begins or ends with a path separator character, it is preserved (but\n# converted to $host format) on output.\n#\n# All path conversion functions are named using the following convention:\n#   file name conversion function    : func_convert_file_X_to_Y ()\n#   path conversion function         : func_convert_path_X_to_Y ()\n# where, for any given $build/$host combination the 'X_to_Y' value is the\n# same.  If conversion functions are added for new $build/$host combinations,\n# the two new functions must follow this pattern, or func_init_to_host_path_cmd\n# will break.\n\n\n# func_init_to_host_path_cmd\n# Ensures that function \"pointer\" variable $to_host_path_cmd is set to the\n# appropriate value, based on the value of $to_host_file_cmd.\nto_host_path_cmd=\nfunc_init_to_host_path_cmd ()\n{\n  $opt_debug\n  if test -z \"$to_host_path_cmd\"; then\n    func_stripname 'func_convert_file_' '' \"$to_host_file_cmd\"\n    to_host_path_cmd=\"func_convert_path_${func_stripname_result}\"\n  fi\n}\n\n\n# func_to_host_path ARG\n# Converts the path ARG from $build format to $host format. Return result\n# in func_to_host_path_result.\nfunc_to_host_path ()\n{\n  $opt_debug\n  func_init_to_host_path_cmd\n  $to_host_path_cmd \"$1\"\n}\n# end func_to_host_path\n\n\n# func_convert_path_noop ARG\n# Copy ARG to func_to_host_path_result.\nfunc_convert_path_noop ()\n{\n  func_to_host_path_result=\"$1\"\n}\n# end func_convert_path_noop\n\n\n# func_convert_path_msys_to_w32 ARG\n# Convert path ARG from (mingw) MSYS to (mingw) w32 format; automatic\n# conversion to w32 is not available inside the cwrapper.  Returns result in\n# func_to_host_path_result.\nfunc_convert_path_msys_to_w32 ()\n{\n  $opt_debug\n  func_to_host_path_result=\"$1\"\n  if test -n \"$1\"; then\n    # Remove leading and trailing path separator characters from ARG.  MSYS\n    # behavior is inconsistent here; cygpath turns them into '.;' and ';.';\n    # and winepath ignores them completely.\n    func_stripname : : \"$1\"\n    func_to_host_path_tmp1=$func_stripname_result\n    func_convert_core_msys_to_w32 \"$func_to_host_path_tmp1\"\n    func_to_host_path_result=\"$func_convert_core_msys_to_w32_result\"\n    func_convert_path_check : \";\" \\\n      \"$func_to_host_path_tmp1\" \"$func_to_host_path_result\"\n    func_convert_path_front_back_pathsep \":*\" \"*:\" \";\" \"$1\"\n  fi\n}\n# end func_convert_path_msys_to_w32\n\n\n# func_convert_path_cygwin_to_w32 ARG\n# Convert path ARG from Cygwin to w32 format.  Returns result in\n# func_to_host_file_result.\nfunc_convert_path_cygwin_to_w32 ()\n{\n  $opt_debug\n  func_to_host_path_result=\"$1\"\n  if test -n \"$1\"; then\n    # See func_convert_path_msys_to_w32:\n    func_stripname : : \"$1\"\n    func_to_host_path_tmp1=$func_stripname_result\n    func_to_host_path_result=`cygpath -m -p \"$func_to_host_path_tmp1\"`\n    func_convert_path_check : \";\" \\\n      \"$func_to_host_path_tmp1\" \"$func_to_host_path_result\"\n    func_convert_path_front_back_pathsep \":*\" \"*:\" \";\" \"$1\"\n  fi\n}\n# end func_convert_path_cygwin_to_w32\n\n\n# func_convert_path_nix_to_w32 ARG\n# Convert path ARG from *nix to w32 format.  Requires a wine environment and\n# a working winepath.  Returns result in func_to_host_file_result.\nfunc_convert_path_nix_to_w32 ()\n{\n  $opt_debug\n  func_to_host_path_result=\"$1\"\n  if test -n \"$1\"; then\n    # See func_convert_path_msys_to_w32:\n    func_stripname : : \"$1\"\n    func_to_host_path_tmp1=$func_stripname_result\n    func_convert_core_path_wine_to_w32 \"$func_to_host_path_tmp1\"\n    func_to_host_path_result=\"$func_convert_core_path_wine_to_w32_result\"\n    func_convert_path_check : \";\" \\\n      \"$func_to_host_path_tmp1\" \"$func_to_host_path_result\"\n    func_convert_path_front_back_pathsep \":*\" \"*:\" \";\" \"$1\"\n  fi\n}\n# end func_convert_path_nix_to_w32\n\n\n# func_convert_path_msys_to_cygwin ARG\n# Convert path ARG from MSYS to Cygwin format.  Requires LT_CYGPATH set.\n# Returns result in func_to_host_file_result.\nfunc_convert_path_msys_to_cygwin ()\n{\n  $opt_debug\n  func_to_host_path_result=\"$1\"\n  if test -n \"$1\"; then\n    # See func_convert_path_msys_to_w32:\n    func_stripname : : \"$1\"\n    func_to_host_path_tmp1=$func_stripname_result\n    func_convert_core_msys_to_w32 \"$func_to_host_path_tmp1\"\n    func_cygpath -u -p \"$func_convert_core_msys_to_w32_result\"\n    func_to_host_path_result=\"$func_cygpath_result\"\n    func_convert_path_check : : \\\n      \"$func_to_host_path_tmp1\" \"$func_to_host_path_result\"\n    func_convert_path_front_back_pathsep \":*\" \"*:\" : \"$1\"\n  fi\n}\n# end func_convert_path_msys_to_cygwin\n\n\n# func_convert_path_nix_to_cygwin ARG\n# Convert path ARG from *nix to Cygwin format.  Requires Cygwin installed in a\n# a wine environment, working winepath, and LT_CYGPATH set.  Returns result in\n# func_to_host_file_result.\nfunc_convert_path_nix_to_cygwin ()\n{\n  $opt_debug\n  func_to_host_path_result=\"$1\"\n  if test -n \"$1\"; then\n    # Remove leading and trailing path separator characters from\n    # ARG. msys behavior is inconsistent here, cygpath turns them\n    # into '.;' and ';.', and winepath ignores them completely.\n    func_stripname : : \"$1\"\n    func_to_host_path_tmp1=$func_stripname_result\n    func_convert_core_path_wine_to_w32 \"$func_to_host_path_tmp1\"\n    func_cygpath -u -p \"$func_convert_core_path_wine_to_w32_result\"\n    func_to_host_path_result=\"$func_cygpath_result\"\n    func_convert_path_check : : \\\n      \"$func_to_host_path_tmp1\" \"$func_to_host_path_result\"\n    func_convert_path_front_back_pathsep \":*\" \"*:\" : \"$1\"\n  fi\n}\n# end func_convert_path_nix_to_cygwin\n\n\n# func_mode_compile arg...\nfunc_mode_compile ()\n{\n    $opt_debug\n    # Get the compilation command and the source file.\n    base_compile=\n    srcfile=\"$nonopt\"  #  always keep a non-empty value in \"srcfile\"\n    suppress_opt=yes\n    suppress_output=\n    arg_mode=normal\n    libobj=\n    later=\n    pie_flag=\n\n    for arg\n    do\n      case $arg_mode in\n      arg  )\n\t# do not \"continue\".  Instead, add this to base_compile\n\tlastarg=\"$arg\"\n\targ_mode=normal\n\t;;\n\n      target )\n\tlibobj=\"$arg\"\n\targ_mode=normal\n\tcontinue\n\t;;\n\n      normal )\n\t# Accept any command-line options.\n\tcase $arg in\n\t-o)\n\t  test -n \"$libobj\" && \\\n\t    func_fatal_error \"you cannot specify \\`-o' more than once\"\n\t  arg_mode=target\n\t  continue\n\t  ;;\n\n\t-pie | -fpie | -fPIE)\n          func_append pie_flag \" $arg\"\n\t  continue\n\t  ;;\n\n\t-shared | -static | -prefer-pic | -prefer-non-pic)\n\t  func_append later \" $arg\"\n\t  continue\n\t  ;;\n\n\t-no-suppress)\n\t  suppress_opt=no\n\t  continue\n\t  ;;\n\n\t-Xcompiler)\n\t  arg_mode=arg  #  the next one goes into the \"base_compile\" arg list\n\t  continue      #  The current \"srcfile\" will either be retained or\n\t  ;;            #  replaced later.  I would guess that would be a bug.\n\n\t-Wc,*)\n\t  func_stripname '-Wc,' '' \"$arg\"\n\t  args=$func_stripname_result\n\t  lastarg=\n\t  save_ifs=\"$IFS\"; IFS=','\n\t  for arg in $args; do\n\t    IFS=\"$save_ifs\"\n\t    func_append_quoted lastarg \"$arg\"\n\t  done\n\t  IFS=\"$save_ifs\"\n\t  func_stripname ' ' '' \"$lastarg\"\n\t  lastarg=$func_stripname_result\n\n\t  # Add the arguments to base_compile.\n\t  func_append base_compile \" $lastarg\"\n\t  continue\n\t  ;;\n\n\t*)\n\t  # Accept the current argument as the source file.\n\t  # The previous \"srcfile\" becomes the current argument.\n\t  #\n\t  lastarg=\"$srcfile\"\n\t  srcfile=\"$arg\"\n\t  ;;\n\tesac  #  case $arg\n\t;;\n      esac    #  case $arg_mode\n\n      # Aesthetically quote the previous argument.\n      func_append_quoted base_compile \"$lastarg\"\n    done # for arg\n\n    case $arg_mode in\n    arg)\n      func_fatal_error \"you must specify an argument for -Xcompile\"\n      ;;\n    target)\n      func_fatal_error \"you must specify a target with \\`-o'\"\n      ;;\n    *)\n      # Get the name of the library object.\n      test -z \"$libobj\" && {\n\tfunc_basename \"$srcfile\"\n\tlibobj=\"$func_basename_result\"\n      }\n      ;;\n    esac\n\n    # Recognize several different file suffixes.\n    # If the user specifies -o file.o, it is replaced with file.lo\n    case $libobj in\n    *.[cCFSifmso] | \\\n    *.ada | *.adb | *.ads | *.asm | \\\n    *.c++ | *.cc | *.ii | *.class | *.cpp | *.cxx | \\\n    *.[fF][09]? | *.for | *.java | *.go | *.obj | *.sx | *.cu | *.cup)\n      func_xform \"$libobj\"\n      libobj=$func_xform_result\n      ;;\n    esac\n\n    case $libobj in\n    *.lo) func_lo2o \"$libobj\"; obj=$func_lo2o_result ;;\n    *)\n      func_fatal_error \"cannot determine name of library object from \\`$libobj'\"\n      ;;\n    esac\n\n    func_infer_tag $base_compile\n\n    for arg in $later; do\n      case $arg in\n      -shared)\n\ttest \"$build_libtool_libs\" != yes && \\\n\t  func_fatal_configuration \"can not build a shared library\"\n\tbuild_old_libs=no\n\tcontinue\n\t;;\n\n      -static)\n\tbuild_libtool_libs=no\n\tbuild_old_libs=yes\n\tcontinue\n\t;;\n\n      -prefer-pic)\n\tpic_mode=yes\n\tcontinue\n\t;;\n\n      -prefer-non-pic)\n\tpic_mode=no\n\tcontinue\n\t;;\n      esac\n    done\n\n    func_quote_for_eval \"$libobj\"\n    test \"X$libobj\" != \"X$func_quote_for_eval_result\" \\\n      && $ECHO \"X$libobj\" | $GREP '[]~#^*{};<>?\"'\"'\"'\t &()|`$[]' \\\n      && func_warning \"libobj name \\`$libobj' may not contain shell special characters.\"\n    func_dirname_and_basename \"$obj\" \"/\" \"\"\n    objname=\"$func_basename_result\"\n    xdir=\"$func_dirname_result\"\n    lobj=${xdir}$objdir/$objname\n\n    test -z \"$base_compile\" && \\\n      func_fatal_help \"you must specify a compilation command\"\n\n    # Delete any leftover library objects.\n    if test \"$build_old_libs\" = yes; then\n      removelist=\"$obj $lobj $libobj ${libobj}T\"\n    else\n      removelist=\"$lobj $libobj ${libobj}T\"\n    fi\n\n    # On Cygwin there's no \"real\" PIC flag so we must build both object types\n    case $host_os in\n    cygwin* | mingw* | pw32* | os2* | cegcc*)\n      pic_mode=default\n      ;;\n    esac\n    if test \"$pic_mode\" = no && test \"$deplibs_check_method\" != pass_all; then\n      # non-PIC code in shared libraries is not supported\n      pic_mode=default\n    fi\n\n    # Calculate the filename of the output object if compiler does\n    # not support -o with -c\n    if test \"$compiler_c_o\" = no; then\n      output_obj=`$ECHO \"$srcfile\" | $SED 's%^.*/%%; s%\\.[^.]*$%%'`.${objext}\n      lockfile=\"$output_obj.lock\"\n    else\n      output_obj=\n      need_locks=no\n      lockfile=\n    fi\n\n    # Lock this critical section if it is needed\n    # We use this script file to make the link, it avoids creating a new file\n    if test \"$need_locks\" = yes; then\n      until $opt_dry_run || ln \"$progpath\" \"$lockfile\" 2>/dev/null; do\n\tfunc_echo \"Waiting for $lockfile to be removed\"\n\tsleep 2\n      done\n    elif test \"$need_locks\" = warn; then\n      if test -f \"$lockfile\"; then\n\t$ECHO \"\\\n*** ERROR, $lockfile exists and contains:\n`cat $lockfile 2>/dev/null`\n\nThis indicates that another process is trying to use the same\ntemporary object file, and libtool could not work around it because\nyour compiler does not support \\`-c' and \\`-o' together.  If you\nrepeat this compilation, it may succeed, by chance, but you had better\navoid parallel builds (make -j) in this platform, or get a better\ncompiler.\"\n\n\t$opt_dry_run || $RM $removelist\n\texit $EXIT_FAILURE\n      fi\n      func_append removelist \" $output_obj\"\n      $ECHO \"$srcfile\" > \"$lockfile\"\n    fi\n\n    $opt_dry_run || $RM $removelist\n    func_append removelist \" $lockfile\"\n    trap '$opt_dry_run || $RM $removelist; exit $EXIT_FAILURE' 1 2 15\n\n    func_to_tool_file \"$srcfile\" func_convert_file_msys_to_w32\n    srcfile=$func_to_tool_file_result\n    func_quote_for_eval \"$srcfile\"\n    qsrcfile=$func_quote_for_eval_result\n\n    # Only build a PIC object if we are building libtool libraries.\n    if test \"$build_libtool_libs\" = yes; then\n      # Without this assignment, base_compile gets emptied.\n      fbsd_hideous_sh_bug=$base_compile\n\n      if test \"$pic_mode\" != no; then\n\tcommand=\"$base_compile $qsrcfile $pic_flag\"\n      else\n\t# Don't build PIC code\n\tcommand=\"$base_compile $qsrcfile\"\n      fi\n\n      func_mkdir_p \"$xdir$objdir\"\n\n      if test -z \"$output_obj\"; then\n\t# Place PIC objects in $objdir\n\tfunc_append command \" -o $lobj\"\n      fi\n\n      func_show_eval_locale \"$command\"\t\\\n          'test -n \"$output_obj\" && $RM $removelist; exit $EXIT_FAILURE'\n\n      if test \"$need_locks\" = warn &&\n\t test \"X`cat $lockfile 2>/dev/null`\" != \"X$srcfile\"; then\n\t$ECHO \"\\\n*** ERROR, $lockfile contains:\n`cat $lockfile 2>/dev/null`\n\nbut it should contain:\n$srcfile\n\nThis indicates that another process is trying to use the same\ntemporary object file, and libtool could not work around it because\nyour compiler does not support \\`-c' and \\`-o' together.  If you\nrepeat this compilation, it may succeed, by chance, but you had better\navoid parallel builds (make -j) in this platform, or get a better\ncompiler.\"\n\n\t$opt_dry_run || $RM $removelist\n\texit $EXIT_FAILURE\n      fi\n\n      # Just move the object if needed, then go on to compile the next one\n      if test -n \"$output_obj\" && test \"X$output_obj\" != \"X$lobj\"; then\n\tfunc_show_eval '$MV \"$output_obj\" \"$lobj\"' \\\n\t  'error=$?; $opt_dry_run || $RM $removelist; exit $error'\n      fi\n\n      # Allow error messages only from the first compilation.\n      if test \"$suppress_opt\" = yes; then\n\tsuppress_output=' >/dev/null 2>&1'\n      fi\n    fi\n\n    # Only build a position-dependent object if we build old libraries.\n    if test \"$build_old_libs\" = yes; then\n      if test \"$pic_mode\" != yes; then\n\t# Don't build PIC code\n\tcommand=\"$base_compile $qsrcfile$pie_flag\"\n      else\n\tcommand=\"$base_compile $qsrcfile $pic_flag\"\n      fi\n      if test \"$compiler_c_o\" = yes; then\n\tfunc_append command \" -o $obj\"\n      fi\n\n      # Suppress compiler output if we already did a PIC compilation.\n      func_append command \"$suppress_output\"\n      func_show_eval_locale \"$command\" \\\n        '$opt_dry_run || $RM $removelist; exit $EXIT_FAILURE'\n\n      if test \"$need_locks\" = warn &&\n\t test \"X`cat $lockfile 2>/dev/null`\" != \"X$srcfile\"; then\n\t$ECHO \"\\\n*** ERROR, $lockfile contains:\n`cat $lockfile 2>/dev/null`\n\nbut it should contain:\n$srcfile\n\nThis indicates that another process is trying to use the same\ntemporary object file, and libtool could not work around it because\nyour compiler does not support \\`-c' and \\`-o' together.  If you\nrepeat this compilation, it may succeed, by chance, but you had better\navoid parallel builds (make -j) in this platform, or get a better\ncompiler.\"\n\n\t$opt_dry_run || $RM $removelist\n\texit $EXIT_FAILURE\n      fi\n\n      # Just move the object if needed\n      if test -n \"$output_obj\" && test \"X$output_obj\" != \"X$obj\"; then\n\tfunc_show_eval '$MV \"$output_obj\" \"$obj\"' \\\n\t  'error=$?; $opt_dry_run || $RM $removelist; exit $error'\n      fi\n    fi\n\n    $opt_dry_run || {\n      func_write_libtool_object \"$libobj\" \"$objdir/$objname\" \"$objname\"\n\n      # Unlock the critical section if it was locked\n      if test \"$need_locks\" != no; then\n\tremovelist=$lockfile\n        $RM \"$lockfile\"\n      fi\n    }\n\n    exit $EXIT_SUCCESS\n}\n\n$opt_help || {\n  test \"$opt_mode\" = compile && func_mode_compile ${1+\"$@\"}\n}\n\nfunc_mode_help ()\n{\n    # We need to display help for each of the modes.\n    case $opt_mode in\n      \"\")\n        # Generic help is extracted from the usage comments\n        # at the start of this file.\n        func_help\n        ;;\n\n      clean)\n        $ECHO \\\n\"Usage: $progname [OPTION]... --mode=clean RM [RM-OPTION]... FILE...\n\nRemove files from the build directory.\n\nRM is the name of the program to use to delete files associated with each FILE\n(typically \\`/bin/rm').  RM-OPTIONS are options (such as \\`-f') to be passed\nto RM.\n\nIf FILE is a libtool library, object or program, all the files associated\nwith it are deleted. Otherwise, only FILE itself is deleted using RM.\"\n        ;;\n\n      compile)\n      $ECHO \\\n\"Usage: $progname [OPTION]... --mode=compile COMPILE-COMMAND... SOURCEFILE\n\nCompile a source file into a libtool library object.\n\nThis mode accepts the following additional options:\n\n  -o OUTPUT-FILE    set the output file name to OUTPUT-FILE\n  -no-suppress      do not suppress compiler output for multiple passes\n  -prefer-pic       try to build PIC objects only\n  -prefer-non-pic   try to build non-PIC objects only\n  -shared           do not build a \\`.o' file suitable for static linking\n  -static           only build a \\`.o' file suitable for static linking\n  -Wc,FLAG          pass FLAG directly to the compiler\n\nCOMPILE-COMMAND is a command to be used in creating a \\`standard' object file\nfrom the given SOURCEFILE.\n\nThe output file name is determined by removing the directory component from\nSOURCEFILE, then substituting the C source code suffix \\`.c' with the\nlibrary object suffix, \\`.lo'.\"\n        ;;\n\n      execute)\n        $ECHO \\\n\"Usage: $progname [OPTION]... --mode=execute COMMAND [ARGS]...\n\nAutomatically set library path, then run a program.\n\nThis mode accepts the following additional options:\n\n  -dlopen FILE      add the directory containing FILE to the library path\n\nThis mode sets the library path environment variable according to \\`-dlopen'\nflags.\n\nIf any of the ARGS are libtool executable wrappers, then they are translated\ninto their corresponding uninstalled binary, and any of their required library\ndirectories are added to the library path.\n\nThen, COMMAND is executed, with ARGS as arguments.\"\n        ;;\n\n      finish)\n        $ECHO \\\n\"Usage: $progname [OPTION]... --mode=finish [LIBDIR]...\n\nComplete the installation of libtool libraries.\n\nEach LIBDIR is a directory that contains libtool libraries.\n\nThe commands that this mode executes may require superuser privileges.  Use\nthe \\`--dry-run' option if you just want to see what would be executed.\"\n        ;;\n\n      install)\n        $ECHO \\\n\"Usage: $progname [OPTION]... --mode=install INSTALL-COMMAND...\n\nInstall executables or libraries.\n\nINSTALL-COMMAND is the installation command.  The first component should be\neither the \\`install' or \\`cp' program.\n\nThe following components of INSTALL-COMMAND are treated specially:\n\n  -inst-prefix-dir PREFIX-DIR  Use PREFIX-DIR as a staging area for installation\n\nThe rest of the components are interpreted as arguments to that command (only\nBSD-compatible install options are recognized).\"\n        ;;\n\n      link)\n        $ECHO \\\n\"Usage: $progname [OPTION]... --mode=link LINK-COMMAND...\n\nLink object files or libraries together to form another library, or to\ncreate an executable program.\n\nLINK-COMMAND is a command using the C compiler that you would use to create\na program from several object files.\n\nThe following components of LINK-COMMAND are treated specially:\n\n  -all-static       do not do any dynamic linking at all\n  -avoid-version    do not add a version suffix if possible\n  -bindir BINDIR    specify path to binaries directory (for systems where\n                    libraries must be found in the PATH setting at runtime)\n  -dlopen FILE      \\`-dlpreopen' FILE if it cannot be dlopened at runtime\n  -dlpreopen FILE   link in FILE and add its symbols to lt_preloaded_symbols\n  -export-dynamic   allow symbols from OUTPUT-FILE to be resolved with dlsym(3)\n  -export-symbols SYMFILE\n                    try to export only the symbols listed in SYMFILE\n  -export-symbols-regex REGEX\n                    try to export only the symbols matching REGEX\n  -LLIBDIR          search LIBDIR for required installed libraries\n  -lNAME            OUTPUT-FILE requires the installed library libNAME\n  -module           build a library that can dlopened\n  -no-fast-install  disable the fast-install mode\n  -no-install       link a not-installable executable\n  -no-undefined     declare that a library does not refer to external symbols\n  -o OUTPUT-FILE    create OUTPUT-FILE from the specified objects\n  -objectlist FILE  Use a list of object files found in FILE to specify objects\n  -precious-files-regex REGEX\n                    don't remove output files matching REGEX\n  -release RELEASE  specify package release information\n  -rpath LIBDIR     the created library will eventually be installed in LIBDIR\n  -R[ ]LIBDIR       add LIBDIR to the runtime path of programs and libraries\n  -shared           only do dynamic linking of libtool libraries\n  -shrext SUFFIX    override the standard shared library file extension\n  -static           do not do any dynamic linking of uninstalled libtool libraries\n  -static-libtool-libs\n                    do not do any dynamic linking of libtool libraries\n  -version-info CURRENT[:REVISION[:AGE]]\n                    specify library version info [each variable defaults to 0]\n  -weak LIBNAME     declare that the target provides the LIBNAME interface\n  -Wc,FLAG\n  -Xcompiler FLAG   pass linker-specific FLAG directly to the compiler\n  -Wl,FLAG\n  -Xlinker FLAG     pass linker-specific FLAG directly to the linker\n  -XCClinker FLAG   pass link-specific FLAG to the compiler driver (CC)\n\nAll other options (arguments beginning with \\`-') are ignored.\n\nEvery other argument is treated as a filename.  Files ending in \\`.la' are\ntreated as uninstalled libtool libraries, other files are standard or library\nobject files.\n\nIf the OUTPUT-FILE ends in \\`.la', then a libtool library is created,\nonly library objects (\\`.lo' files) may be specified, and \\`-rpath' is\nrequired, except when creating a convenience library.\n\nIf OUTPUT-FILE ends in \\`.a' or \\`.lib', then a standard library is created\nusing \\`ar' and \\`ranlib', or on Windows using \\`lib'.\n\nIf OUTPUT-FILE ends in \\`.lo' or \\`.${objext}', then a reloadable object file\nis created, otherwise an executable program is created.\"\n        ;;\n\n      uninstall)\n        $ECHO \\\n\"Usage: $progname [OPTION]... --mode=uninstall RM [RM-OPTION]... FILE...\n\nRemove libraries from an installation directory.\n\nRM is the name of the program to use to delete files associated with each FILE\n(typically \\`/bin/rm').  RM-OPTIONS are options (such as \\`-f') to be passed\nto RM.\n\nIf FILE is a libtool library, all the files associated with it are deleted.\nOtherwise, only FILE itself is deleted using RM.\"\n        ;;\n\n      *)\n        func_fatal_help \"invalid operation mode \\`$opt_mode'\"\n        ;;\n    esac\n\n    echo\n    $ECHO \"Try \\`$progname --help' for more information about other modes.\"\n}\n\n# Now that we've collected a possible --mode arg, show help if necessary\nif $opt_help; then\n  if test \"$opt_help\" = :; then\n    func_mode_help\n  else\n    {\n      func_help noexit\n      for opt_mode in compile link execute install finish uninstall clean; do\n\tfunc_mode_help\n      done\n    } | sed -n '1p; 2,$s/^Usage:/  or: /p'\n    {\n      func_help noexit\n      for opt_mode in compile link execute install finish uninstall clean; do\n\techo\n\tfunc_mode_help\n      done\n    } |\n    sed '1d\n      /^When reporting/,/^Report/{\n\tH\n\td\n      }\n      $x\n      /information about other modes/d\n      /more detailed .*MODE/d\n      s/^Usage:.*--mode=\\([^ ]*\\) .*/Description of \\1 mode:/'\n  fi\n  exit $?\nfi\n\n\n# func_mode_execute arg...\nfunc_mode_execute ()\n{\n    $opt_debug\n    # The first argument is the command name.\n    cmd=\"$nonopt\"\n    test -z \"$cmd\" && \\\n      func_fatal_help \"you must specify a COMMAND\"\n\n    # Handle -dlopen flags immediately.\n    for file in $opt_dlopen; do\n      test -f \"$file\" \\\n\t|| func_fatal_help \"\\`$file' is not a file\"\n\n      dir=\n      case $file in\n      *.la)\n\tfunc_resolve_sysroot \"$file\"\n\tfile=$func_resolve_sysroot_result\n\n\t# Check to see that this really is a libtool archive.\n\tfunc_lalib_unsafe_p \"$file\" \\\n\t  || func_fatal_help \"\\`$lib' is not a valid libtool archive\"\n\n\t# Read the libtool library.\n\tdlname=\n\tlibrary_names=\n\tfunc_source \"$file\"\n\n\t# Skip this library if it cannot be dlopened.\n\tif test -z \"$dlname\"; then\n\t  # Warn if it was a shared library.\n\t  test -n \"$library_names\" && \\\n\t    func_warning \"\\`$file' was not linked with \\`-export-dynamic'\"\n\t  continue\n\tfi\n\n\tfunc_dirname \"$file\" \"\" \".\"\n\tdir=\"$func_dirname_result\"\n\n\tif test -f \"$dir/$objdir/$dlname\"; then\n\t  func_append dir \"/$objdir\"\n\telse\n\t  if test ! -f \"$dir/$dlname\"; then\n\t    func_fatal_error \"cannot find \\`$dlname' in \\`$dir' or \\`$dir/$objdir'\"\n\t  fi\n\tfi\n\t;;\n\n      *.lo)\n\t# Just add the directory containing the .lo file.\n\tfunc_dirname \"$file\" \"\" \".\"\n\tdir=\"$func_dirname_result\"\n\t;;\n\n      *)\n\tfunc_warning \"\\`-dlopen' is ignored for non-libtool libraries and objects\"\n\tcontinue\n\t;;\n      esac\n\n      # Get the absolute pathname.\n      absdir=`cd \"$dir\" && pwd`\n      test -n \"$absdir\" && dir=\"$absdir\"\n\n      # Now add the directory to shlibpath_var.\n      if eval \"test -z \\\"\\$$shlibpath_var\\\"\"; then\n\teval \"$shlibpath_var=\\\"\\$dir\\\"\"\n      else\n\teval \"$shlibpath_var=\\\"\\$dir:\\$$shlibpath_var\\\"\"\n      fi\n    done\n\n    # This variable tells wrapper scripts just to set shlibpath_var\n    # rather than running their programs.\n    libtool_execute_magic=\"$magic\"\n\n    # Check if any of the arguments is a wrapper script.\n    args=\n    for file\n    do\n      case $file in\n      -* | *.la | *.lo ) ;;\n      *)\n\t# Do a test to see if this is really a libtool program.\n\tif func_ltwrapper_script_p \"$file\"; then\n\t  func_source \"$file\"\n\t  # Transform arg to wrapped name.\n\t  file=\"$progdir/$program\"\n\telif func_ltwrapper_executable_p \"$file\"; then\n\t  func_ltwrapper_scriptname \"$file\"\n\t  func_source \"$func_ltwrapper_scriptname_result\"\n\t  # Transform arg to wrapped name.\n\t  file=\"$progdir/$program\"\n\tfi\n\t;;\n      esac\n      # Quote arguments (to preserve shell metacharacters).\n      func_append_quoted args \"$file\"\n    done\n\n    if test \"X$opt_dry_run\" = Xfalse; then\n      if test -n \"$shlibpath_var\"; then\n\t# Export the shlibpath_var.\n\teval \"export $shlibpath_var\"\n      fi\n\n      # Restore saved environment variables\n      for lt_var in LANG LANGUAGE LC_ALL LC_CTYPE LC_COLLATE LC_MESSAGES\n      do\n\teval \"if test \\\"\\${save_$lt_var+set}\\\" = set; then\n                $lt_var=\\$save_$lt_var; export $lt_var\n\t      else\n\t\t$lt_unset $lt_var\n\t      fi\"\n      done\n\n      # Now prepare to actually exec the command.\n      exec_cmd=\"\\$cmd$args\"\n    else\n      # Display what would be done.\n      if test -n \"$shlibpath_var\"; then\n\teval \"\\$ECHO \\\"\\$shlibpath_var=\\$$shlibpath_var\\\"\"\n\techo \"export $shlibpath_var\"\n      fi\n      $ECHO \"$cmd$args\"\n      exit $EXIT_SUCCESS\n    fi\n}\n\ntest \"$opt_mode\" = execute && func_mode_execute ${1+\"$@\"}\n\n\n# func_mode_finish arg...\nfunc_mode_finish ()\n{\n    $opt_debug\n    libs=\n    libdirs=\n    admincmds=\n\n    for opt in \"$nonopt\" ${1+\"$@\"}\n    do\n      if test -d \"$opt\"; then\n\tfunc_append libdirs \" $opt\"\n\n      elif test -f \"$opt\"; then\n\tif func_lalib_unsafe_p \"$opt\"; then\n\t  func_append libs \" $opt\"\n\telse\n\t  func_warning \"\\`$opt' is not a valid libtool archive\"\n\tfi\n\n      else\n\tfunc_fatal_error \"invalid argument \\`$opt'\"\n      fi\n    done\n\n    if test -n \"$libs\"; then\n      if test -n \"$lt_sysroot\"; then\n        sysroot_regex=`$ECHO \"$lt_sysroot\" | $SED \"$sed_make_literal_regex\"`\n        sysroot_cmd=\"s/\\([ ']\\)$sysroot_regex/\\1/g;\"\n      else\n        sysroot_cmd=\n      fi\n\n      # Remove sysroot references\n      if $opt_dry_run; then\n        for lib in $libs; do\n          echo \"removing references to $lt_sysroot and \\`=' prefixes from $lib\"\n        done\n      else\n        tmpdir=`func_mktempdir`\n        for lib in $libs; do\n\t  sed -e \"${sysroot_cmd} s/\\([ ']-[LR]\\)=/\\1/g; s/\\([ ']\\)=/\\1/g\" $lib \\\n\t    > $tmpdir/tmp-la\n\t  mv -f $tmpdir/tmp-la $lib\n\tdone\n        ${RM}r \"$tmpdir\"\n      fi\n    fi\n\n    if test -n \"$finish_cmds$finish_eval\" && test -n \"$libdirs\"; then\n      for libdir in $libdirs; do\n\tif test -n \"$finish_cmds\"; then\n\t  # Do each command in the finish commands.\n\t  func_execute_cmds \"$finish_cmds\" 'admincmds=\"$admincmds\n'\"$cmd\"'\"'\n\tfi\n\tif test -n \"$finish_eval\"; then\n\t  # Do the single finish_eval.\n\t  eval cmds=\\\"$finish_eval\\\"\n\t  $opt_dry_run || eval \"$cmds\" || func_append admincmds \"\n       $cmds\"\n\tfi\n      done\n    fi\n\n    # Exit here if they wanted silent mode.\n    $opt_silent && exit $EXIT_SUCCESS\n\n    if test -n \"$finish_cmds$finish_eval\" && test -n \"$libdirs\"; then\n      echo \"----------------------------------------------------------------------\"\n      echo \"Libraries have been installed in:\"\n      for libdir in $libdirs; do\n\t$ECHO \"   $libdir\"\n      done\n      echo\n      echo \"If you ever happen to want to link against installed libraries\"\n      echo \"in a given directory, LIBDIR, you must either use libtool, and\"\n      echo \"specify the full pathname of the library, or use the \\`-LLIBDIR'\"\n      echo \"flag during linking and do at least one of the following:\"\n      if test -n \"$shlibpath_var\"; then\n\techo \"   - add LIBDIR to the \\`$shlibpath_var' environment variable\"\n\techo \"     during execution\"\n      fi\n      if test -n \"$runpath_var\"; then\n\techo \"   - add LIBDIR to the \\`$runpath_var' environment variable\"\n\techo \"     during linking\"\n      fi\n      if test -n \"$hardcode_libdir_flag_spec\"; then\n\tlibdir=LIBDIR\n\teval flag=\\\"$hardcode_libdir_flag_spec\\\"\n\n\t$ECHO \"   - use the \\`$flag' linker flag\"\n      fi\n      if test -n \"$admincmds\"; then\n\t$ECHO \"   - have your system administrator run these commands:$admincmds\"\n      fi\n      if test -f /etc/ld.so.conf; then\n\techo \"   - have your system administrator add LIBDIR to \\`/etc/ld.so.conf'\"\n      fi\n      echo\n\n      echo \"See any operating system documentation about shared libraries for\"\n      case $host in\n\tsolaris2.[6789]|solaris2.1[0-9])\n\t  echo \"more information, such as the ld(1), crle(1) and ld.so(8) manual\"\n\t  echo \"pages.\"\n\t  ;;\n\t*)\n\t  echo \"more information, such as the ld(1) and ld.so(8) manual pages.\"\n\t  ;;\n      esac\n      echo \"----------------------------------------------------------------------\"\n    fi\n    exit $EXIT_SUCCESS\n}\n\ntest \"$opt_mode\" = finish && func_mode_finish ${1+\"$@\"}\n\n\n# func_mode_install arg...\nfunc_mode_install ()\n{\n    $opt_debug\n    # There may be an optional sh(1) argument at the beginning of\n    # install_prog (especially on Windows NT).\n    if test \"$nonopt\" = \"$SHELL\" || test \"$nonopt\" = /bin/sh ||\n       # Allow the use of GNU shtool's install command.\n       case $nonopt in *shtool*) :;; *) false;; esac; then\n      # Aesthetically quote it.\n      func_quote_for_eval \"$nonopt\"\n      install_prog=\"$func_quote_for_eval_result \"\n      arg=$1\n      shift\n    else\n      install_prog=\n      arg=$nonopt\n    fi\n\n    # The real first argument should be the name of the installation program.\n    # Aesthetically quote it.\n    func_quote_for_eval \"$arg\"\n    func_append install_prog \"$func_quote_for_eval_result\"\n    install_shared_prog=$install_prog\n    case \" $install_prog \" in\n      *[\\\\\\ /]cp\\ *) install_cp=: ;;\n      *) install_cp=false ;;\n    esac\n\n    # We need to accept at least all the BSD install flags.\n    dest=\n    files=\n    opts=\n    prev=\n    install_type=\n    isdir=no\n    stripme=\n    no_mode=:\n    for arg\n    do\n      arg2=\n      if test -n \"$dest\"; then\n\tfunc_append files \" $dest\"\n\tdest=$arg\n\tcontinue\n      fi\n\n      case $arg in\n      -d) isdir=yes ;;\n      -f)\n\tif $install_cp; then :; else\n\t  prev=$arg\n\tfi\n\t;;\n      -g | -m | -o)\n\tprev=$arg\n\t;;\n      -s)\n\tstripme=\" -s\"\n\tcontinue\n\t;;\n      -*)\n\t;;\n      *)\n\t# If the previous option needed an argument, then skip it.\n\tif test -n \"$prev\"; then\n\t  if test \"x$prev\" = x-m && test -n \"$install_override_mode\"; then\n\t    arg2=$install_override_mode\n\t    no_mode=false\n\t  fi\n\t  prev=\n\telse\n\t  dest=$arg\n\t  continue\n\tfi\n\t;;\n      esac\n\n      # Aesthetically quote the argument.\n      func_quote_for_eval \"$arg\"\n      func_append install_prog \" $func_quote_for_eval_result\"\n      if test -n \"$arg2\"; then\n\tfunc_quote_for_eval \"$arg2\"\n      fi\n      func_append install_shared_prog \" $func_quote_for_eval_result\"\n    done\n\n    test -z \"$install_prog\" && \\\n      func_fatal_help \"you must specify an install program\"\n\n    test -n \"$prev\" && \\\n      func_fatal_help \"the \\`$prev' option requires an argument\"\n\n    if test -n \"$install_override_mode\" && $no_mode; then\n      if $install_cp; then :; else\n\tfunc_quote_for_eval \"$install_override_mode\"\n\tfunc_append install_shared_prog \" -m $func_quote_for_eval_result\"\n      fi\n    fi\n\n    if test -z \"$files\"; then\n      if test -z \"$dest\"; then\n\tfunc_fatal_help \"no file or destination specified\"\n      else\n\tfunc_fatal_help \"you must specify a destination\"\n      fi\n    fi\n\n    # Strip any trailing slash from the destination.\n    func_stripname '' '/' \"$dest\"\n    dest=$func_stripname_result\n\n    # Check to see that the destination is a directory.\n    test -d \"$dest\" && isdir=yes\n    if test \"$isdir\" = yes; then\n      destdir=\"$dest\"\n      destname=\n    else\n      func_dirname_and_basename \"$dest\" \"\" \".\"\n      destdir=\"$func_dirname_result\"\n      destname=\"$func_basename_result\"\n\n      # Not a directory, so check to see that there is only one file specified.\n      set dummy $files; shift\n      test \"$#\" -gt 1 && \\\n\tfunc_fatal_help \"\\`$dest' is not a directory\"\n    fi\n    case $destdir in\n    [\\\\/]* | [A-Za-z]:[\\\\/]*) ;;\n    *)\n      for file in $files; do\n\tcase $file in\n\t*.lo) ;;\n\t*)\n\t  func_fatal_help \"\\`$destdir' must be an absolute directory name\"\n\t  ;;\n\tesac\n      done\n      ;;\n    esac\n\n    # This variable tells wrapper scripts just to set variables rather\n    # than running their programs.\n    libtool_install_magic=\"$magic\"\n\n    staticlibs=\n    future_libdirs=\n    current_libdirs=\n    for file in $files; do\n\n      # Do each installation.\n      case $file in\n      *.$libext)\n\t# Do the static libraries later.\n\tfunc_append staticlibs \" $file\"\n\t;;\n\n      *.la)\n\tfunc_resolve_sysroot \"$file\"\n\tfile=$func_resolve_sysroot_result\n\n\t# Check to see that this really is a libtool archive.\n\tfunc_lalib_unsafe_p \"$file\" \\\n\t  || func_fatal_help \"\\`$file' is not a valid libtool archive\"\n\n\tlibrary_names=\n\told_library=\n\trelink_command=\n\tfunc_source \"$file\"\n\n\t# Add the libdir to current_libdirs if it is the destination.\n\tif test \"X$destdir\" = \"X$libdir\"; then\n\t  case \"$current_libdirs \" in\n\t  *\" $libdir \"*) ;;\n\t  *) func_append current_libdirs \" $libdir\" ;;\n\t  esac\n\telse\n\t  # Note the libdir as a future libdir.\n\t  case \"$future_libdirs \" in\n\t  *\" $libdir \"*) ;;\n\t  *) func_append future_libdirs \" $libdir\" ;;\n\t  esac\n\tfi\n\n\tfunc_dirname \"$file\" \"/\" \"\"\n\tdir=\"$func_dirname_result\"\n\tfunc_append dir \"$objdir\"\n\n\tif test -n \"$relink_command\"; then\n\t  # Determine the prefix the user has applied to our future dir.\n\t  inst_prefix_dir=`$ECHO \"$destdir\" | $SED -e \"s%$libdir\\$%%\"`\n\n\t  # Don't allow the user to place us outside of our expected\n\t  # location b/c this prevents finding dependent libraries that\n\t  # are installed to the same prefix.\n\t  # At present, this check doesn't affect windows .dll's that\n\t  # are installed into $libdir/../bin (currently, that works fine)\n\t  # but it's something to keep an eye on.\n\t  test \"$inst_prefix_dir\" = \"$destdir\" && \\\n\t    func_fatal_error \"error: cannot install \\`$file' to a directory not ending in $libdir\"\n\n\t  if test -n \"$inst_prefix_dir\"; then\n\t    # Stick the inst_prefix_dir data into the link command.\n\t    relink_command=`$ECHO \"$relink_command\" | $SED \"s%@inst_prefix_dir@%-inst-prefix-dir $inst_prefix_dir%\"`\n\t  else\n\t    relink_command=`$ECHO \"$relink_command\" | $SED \"s%@inst_prefix_dir@%%\"`\n\t  fi\n\n\t  func_warning \"relinking \\`$file'\"\n\t  func_show_eval \"$relink_command\" \\\n\t    'func_fatal_error \"error: relink \\`$file'\\'' with the above command before installing it\"'\n\tfi\n\n\t# See the names of the shared library.\n\tset dummy $library_names; shift\n\tif test -n \"$1\"; then\n\t  realname=\"$1\"\n\t  shift\n\n\t  srcname=\"$realname\"\n\t  test -n \"$relink_command\" && srcname=\"$realname\"T\n\n\t  # Install the shared library and build the symlinks.\n\t  func_show_eval \"$install_shared_prog $dir/$srcname $destdir/$realname\" \\\n\t      'exit $?'\n\t  tstripme=\"$stripme\"\n\t  case $host_os in\n\t  cygwin* | mingw* | pw32* | cegcc*)\n\t    case $realname in\n\t    *.dll.a)\n\t      tstripme=\"\"\n\t      ;;\n\t    esac\n\t    ;;\n\t  esac\n\t  if test -n \"$tstripme\" && test -n \"$striplib\"; then\n\t    func_show_eval \"$striplib $destdir/$realname\" 'exit $?'\n\t  fi\n\n\t  if test \"$#\" -gt 0; then\n\t    # Delete the old symlinks, and create new ones.\n\t    # Try `ln -sf' first, because the `ln' binary might depend on\n\t    # the symlink we replace!  Solaris /bin/ln does not understand -f,\n\t    # so we also need to try rm && ln -s.\n\t    for linkname\n\t    do\n\t      test \"$linkname\" != \"$realname\" \\\n\t\t&& func_show_eval \"(cd $destdir && { $LN_S -f $realname $linkname || { $RM $linkname && $LN_S $realname $linkname; }; })\"\n\t    done\n\t  fi\n\n\t  # Do each command in the postinstall commands.\n\t  lib=\"$destdir/$realname\"\n\t  func_execute_cmds \"$postinstall_cmds\" 'exit $?'\n\tfi\n\n\t# Install the pseudo-library for information purposes.\n\tfunc_basename \"$file\"\n\tname=\"$func_basename_result\"\n\tinstname=\"$dir/$name\"i\n\tfunc_show_eval \"$install_prog $instname $destdir/$name\" 'exit $?'\n\n\t# Maybe install the static library, too.\n\ttest -n \"$old_library\" && func_append staticlibs \" $dir/$old_library\"\n\t;;\n\n      *.lo)\n\t# Install (i.e. copy) a libtool object.\n\n\t# Figure out destination file name, if it wasn't already specified.\n\tif test -n \"$destname\"; then\n\t  destfile=\"$destdir/$destname\"\n\telse\n\t  func_basename \"$file\"\n\t  destfile=\"$func_basename_result\"\n\t  destfile=\"$destdir/$destfile\"\n\tfi\n\n\t# Deduce the name of the destination old-style object file.\n\tcase $destfile in\n\t*.lo)\n\t  func_lo2o \"$destfile\"\n\t  staticdest=$func_lo2o_result\n\t  ;;\n\t*.$objext)\n\t  staticdest=\"$destfile\"\n\t  destfile=\n\t  ;;\n\t*)\n\t  func_fatal_help \"cannot copy a libtool object to \\`$destfile'\"\n\t  ;;\n\tesac\n\n\t# Install the libtool object if requested.\n\ttest -n \"$destfile\" && \\\n\t  func_show_eval \"$install_prog $file $destfile\" 'exit $?'\n\n\t# Install the old object if enabled.\n\tif test \"$build_old_libs\" = yes; then\n\t  # Deduce the name of the old-style object file.\n\t  func_lo2o \"$file\"\n\t  staticobj=$func_lo2o_result\n\t  func_show_eval \"$install_prog \\$staticobj \\$staticdest\" 'exit $?'\n\tfi\n\texit $EXIT_SUCCESS\n\t;;\n\n      *)\n\t# Figure out destination file name, if it wasn't already specified.\n\tif test -n \"$destname\"; then\n\t  destfile=\"$destdir/$destname\"\n\telse\n\t  func_basename \"$file\"\n\t  destfile=\"$func_basename_result\"\n\t  destfile=\"$destdir/$destfile\"\n\tfi\n\n\t# If the file is missing, and there is a .exe on the end, strip it\n\t# because it is most likely a libtool script we actually want to\n\t# install\n\tstripped_ext=\"\"\n\tcase $file in\n\t  *.exe)\n\t    if test ! -f \"$file\"; then\n\t      func_stripname '' '.exe' \"$file\"\n\t      file=$func_stripname_result\n\t      stripped_ext=\".exe\"\n\t    fi\n\t    ;;\n\tesac\n\n\t# Do a test to see if this is really a libtool program.\n\tcase $host in\n\t*cygwin* | *mingw*)\n\t    if func_ltwrapper_executable_p \"$file\"; then\n\t      func_ltwrapper_scriptname \"$file\"\n\t      wrapper=$func_ltwrapper_scriptname_result\n\t    else\n\t      func_stripname '' '.exe' \"$file\"\n\t      wrapper=$func_stripname_result\n\t    fi\n\t    ;;\n\t*)\n\t    wrapper=$file\n\t    ;;\n\tesac\n\tif func_ltwrapper_script_p \"$wrapper\"; then\n\t  notinst_deplibs=\n\t  relink_command=\n\n\t  func_source \"$wrapper\"\n\n\t  # Check the variables that should have been set.\n\t  test -z \"$generated_by_libtool_version\" && \\\n\t    func_fatal_error \"invalid libtool wrapper script \\`$wrapper'\"\n\n\t  finalize=yes\n\t  for lib in $notinst_deplibs; do\n\t    # Check to see that each library is installed.\n\t    libdir=\n\t    if test -f \"$lib\"; then\n\t      func_source \"$lib\"\n\t    fi\n\t    libfile=\"$libdir/\"`$ECHO \"$lib\" | $SED 's%^.*/%%g'` ### testsuite: skip nested quoting test\n\t    if test -n \"$libdir\" && test ! -f \"$libfile\"; then\n\t      func_warning \"\\`$lib' has not been installed in \\`$libdir'\"\n\t      finalize=no\n\t    fi\n\t  done\n\n\t  relink_command=\n\t  func_source \"$wrapper\"\n\n\t  outputname=\n\t  if test \"$fast_install\" = no && test -n \"$relink_command\"; then\n\t    $opt_dry_run || {\n\t      if test \"$finalize\" = yes; then\n\t        tmpdir=`func_mktempdir`\n\t\tfunc_basename \"$file$stripped_ext\"\n\t\tfile=\"$func_basename_result\"\n\t        outputname=\"$tmpdir/$file\"\n\t        # Replace the output file specification.\n\t        relink_command=`$ECHO \"$relink_command\" | $SED 's%@OUTPUT@%'\"$outputname\"'%g'`\n\n\t        $opt_silent || {\n\t          func_quote_for_expand \"$relink_command\"\n\t\t  eval \"func_echo $func_quote_for_expand_result\"\n\t        }\n\t        if eval \"$relink_command\"; then :\n\t          else\n\t\t  func_error \"error: relink \\`$file' with the above command before installing it\"\n\t\t  $opt_dry_run || ${RM}r \"$tmpdir\"\n\t\t  continue\n\t        fi\n\t        file=\"$outputname\"\n\t      else\n\t        func_warning \"cannot relink \\`$file'\"\n\t      fi\n\t    }\n\t  else\n\t    # Install the binary that we compiled earlier.\n\t    file=`$ECHO \"$file$stripped_ext\" | $SED \"s%\\([^/]*\\)$%$objdir/\\1%\"`\n\t  fi\n\tfi\n\n\t# remove .exe since cygwin /usr/bin/install will append another\n\t# one anyway\n\tcase $install_prog,$host in\n\t*/usr/bin/install*,*cygwin*)\n\t  case $file:$destfile in\n\t  *.exe:*.exe)\n\t    # this is ok\n\t    ;;\n\t  *.exe:*)\n\t    destfile=$destfile.exe\n\t    ;;\n\t  *:*.exe)\n\t    func_stripname '' '.exe' \"$destfile\"\n\t    destfile=$func_stripname_result\n\t    ;;\n\t  esac\n\t  ;;\n\tesac\n\tfunc_show_eval \"$install_prog\\$stripme \\$file \\$destfile\" 'exit $?'\n\t$opt_dry_run || if test -n \"$outputname\"; then\n\t  ${RM}r \"$tmpdir\"\n\tfi\n\t;;\n      esac\n    done\n\n    for file in $staticlibs; do\n      func_basename \"$file\"\n      name=\"$func_basename_result\"\n\n      # Set up the ranlib parameters.\n      oldlib=\"$destdir/$name\"\n      func_to_tool_file \"$oldlib\" func_convert_file_msys_to_w32\n      tool_oldlib=$func_to_tool_file_result\n\n      func_show_eval \"$install_prog \\$file \\$oldlib\" 'exit $?'\n\n      if test -n \"$stripme\" && test -n \"$old_striplib\"; then\n\tfunc_show_eval \"$old_striplib $tool_oldlib\" 'exit $?'\n      fi\n\n      # Do each command in the postinstall commands.\n      func_execute_cmds \"$old_postinstall_cmds\" 'exit $?'\n    done\n\n    test -n \"$future_libdirs\" && \\\n      func_warning \"remember to run \\`$progname --finish$future_libdirs'\"\n\n    if test -n \"$current_libdirs\"; then\n      # Maybe just do a dry run.\n      $opt_dry_run && current_libdirs=\" -n$current_libdirs\"\n      exec_cmd='$SHELL $progpath $preserve_args --finish$current_libdirs'\n    else\n      exit $EXIT_SUCCESS\n    fi\n}\n\ntest \"$opt_mode\" = install && func_mode_install ${1+\"$@\"}\n\n\n# func_generate_dlsyms outputname originator pic_p\n# Extract symbols from dlprefiles and create ${outputname}S.o with\n# a dlpreopen symbol table.\nfunc_generate_dlsyms ()\n{\n    $opt_debug\n    my_outputname=\"$1\"\n    my_originator=\"$2\"\n    my_pic_p=\"${3-no}\"\n    my_prefix=`$ECHO \"$my_originator\" | sed 's%[^a-zA-Z0-9]%_%g'`\n    my_dlsyms=\n\n    if test -n \"$dlfiles$dlprefiles\" || test \"$dlself\" != no; then\n      if test -n \"$NM\" && test -n \"$global_symbol_pipe\"; then\n\tmy_dlsyms=\"${my_outputname}S.c\"\n      else\n\tfunc_error \"not configured to extract global symbols from dlpreopened files\"\n      fi\n    fi\n\n    if test -n \"$my_dlsyms\"; then\n      case $my_dlsyms in\n      \"\") ;;\n      *.c)\n\t# Discover the nlist of each of the dlfiles.\n\tnlist=\"$output_objdir/${my_outputname}.nm\"\n\n\tfunc_show_eval \"$RM $nlist ${nlist}S ${nlist}T\"\n\n\t# Parse the name list into a source file.\n\tfunc_verbose \"creating $output_objdir/$my_dlsyms\"\n\n\t$opt_dry_run || $ECHO > \"$output_objdir/$my_dlsyms\" \"\\\n/* $my_dlsyms - symbol resolution table for \\`$my_outputname' dlsym emulation. */\n/* Generated by $PROGRAM (GNU $PACKAGE$TIMESTAMP) $VERSION */\n\n#ifdef __cplusplus\nextern \\\"C\\\" {\n#endif\n\n#if defined(__GNUC__) && (((__GNUC__ == 4) && (__GNUC_MINOR__ >= 4)) || (__GNUC__ > 4))\n#pragma GCC diagnostic ignored \\\"-Wstrict-prototypes\\\"\n#endif\n\n/* Keep this code in sync between libtool.m4, ltmain, lt_system.h, and tests.  */\n#if defined(_WIN32) || defined(__CYGWIN__) || defined(_WIN32_WCE)\n/* DATA imports from DLLs on WIN32 con't be const, because runtime\n   relocations are performed -- see ld's documentation on pseudo-relocs.  */\n# define LT_DLSYM_CONST\n#elif defined(__osf__)\n/* This system does not cope well with relocations in const data.  */\n# define LT_DLSYM_CONST\n#else\n# define LT_DLSYM_CONST const\n#endif\n\n/* External symbol declarations for the compiler. */\\\n\"\n\n\tif test \"$dlself\" = yes; then\n\t  func_verbose \"generating symbol list for \\`$output'\"\n\n\t  $opt_dry_run || echo ': @PROGRAM@ ' > \"$nlist\"\n\n\t  # Add our own program objects to the symbol list.\n\t  progfiles=`$ECHO \"$objs$old_deplibs\" | $SP2NL | $SED \"$lo2o\" | $NL2SP`\n\t  for progfile in $progfiles; do\n\t    func_to_tool_file \"$progfile\" func_convert_file_msys_to_w32\n\t    func_verbose \"extracting global C symbols from \\`$func_to_tool_file_result'\"\n\t    $opt_dry_run || eval \"$NM $func_to_tool_file_result | $global_symbol_pipe >> '$nlist'\"\n\t  done\n\n\t  if test -n \"$exclude_expsyms\"; then\n\t    $opt_dry_run || {\n\t      eval '$EGREP -v \" ($exclude_expsyms)$\" \"$nlist\" > \"$nlist\"T'\n\t      eval '$MV \"$nlist\"T \"$nlist\"'\n\t    }\n\t  fi\n\n\t  if test -n \"$export_symbols_regex\"; then\n\t    $opt_dry_run || {\n\t      eval '$EGREP -e \"$export_symbols_regex\" \"$nlist\" > \"$nlist\"T'\n\t      eval '$MV \"$nlist\"T \"$nlist\"'\n\t    }\n\t  fi\n\n\t  # Prepare the list of exported symbols\n\t  if test -z \"$export_symbols\"; then\n\t    export_symbols=\"$output_objdir/$outputname.exp\"\n\t    $opt_dry_run || {\n\t      $RM $export_symbols\n\t      eval \"${SED} -n -e '/^: @PROGRAM@ $/d' -e 's/^.* \\(.*\\)$/\\1/p' \"'< \"$nlist\" > \"$export_symbols\"'\n\t      case $host in\n\t      *cygwin* | *mingw* | *cegcc* )\n                eval \"echo EXPORTS \"'> \"$output_objdir/$outputname.def\"'\n                eval 'cat \"$export_symbols\" >> \"$output_objdir/$outputname.def\"'\n\t        ;;\n\t      esac\n\t    }\n\t  else\n\t    $opt_dry_run || {\n\t      eval \"${SED} -e 's/\\([].[*^$]\\)/\\\\\\\\\\1/g' -e 's/^/ /' -e 's/$/$/'\"' < \"$export_symbols\" > \"$output_objdir/$outputname.exp\"'\n\t      eval '$GREP -f \"$output_objdir/$outputname.exp\" < \"$nlist\" > \"$nlist\"T'\n\t      eval '$MV \"$nlist\"T \"$nlist\"'\n\t      case $host in\n\t        *cygwin* | *mingw* | *cegcc* )\n\t          eval \"echo EXPORTS \"'> \"$output_objdir/$outputname.def\"'\n\t          eval 'cat \"$nlist\" >> \"$output_objdir/$outputname.def\"'\n\t          ;;\n\t      esac\n\t    }\n\t  fi\n\tfi\n\n\tfor dlprefile in $dlprefiles; do\n\t  func_verbose \"extracting global C symbols from \\`$dlprefile'\"\n\t  func_basename \"$dlprefile\"\n\t  name=\"$func_basename_result\"\n          case $host in\n\t    *cygwin* | *mingw* | *cegcc* )\n\t      # if an import library, we need to obtain dlname\n\t      if func_win32_import_lib_p \"$dlprefile\"; then\n\t        func_tr_sh \"$dlprefile\"\n\t        eval \"curr_lafile=\\$libfile_$func_tr_sh_result\"\n\t        dlprefile_dlbasename=\"\"\n\t        if test -n \"$curr_lafile\" && func_lalib_p \"$curr_lafile\"; then\n\t          # Use subshell, to avoid clobbering current variable values\n\t          dlprefile_dlname=`source \"$curr_lafile\" && echo \"$dlname\"`\n\t          if test -n \"$dlprefile_dlname\" ; then\n\t            func_basename \"$dlprefile_dlname\"\n\t            dlprefile_dlbasename=\"$func_basename_result\"\n\t          else\n\t            # no lafile. user explicitly requested -dlpreopen <import library>.\n\t            $sharedlib_from_linklib_cmd \"$dlprefile\"\n\t            dlprefile_dlbasename=$sharedlib_from_linklib_result\n\t          fi\n\t        fi\n\t        $opt_dry_run || {\n\t          if test -n \"$dlprefile_dlbasename\" ; then\n\t            eval '$ECHO \": $dlprefile_dlbasename\" >> \"$nlist\"'\n\t          else\n\t            func_warning \"Could not compute DLL name from $name\"\n\t            eval '$ECHO \": $name \" >> \"$nlist\"'\n\t          fi\n\t          func_to_tool_file \"$dlprefile\" func_convert_file_msys_to_w32\n\t          eval \"$NM \\\"$func_to_tool_file_result\\\" 2>/dev/null | $global_symbol_pipe |\n\t            $SED -e '/I __imp/d' -e 's/I __nm_/D /;s/_nm__//' >> '$nlist'\"\n\t        }\n\t      else # not an import lib\n\t        $opt_dry_run || {\n\t          eval '$ECHO \": $name \" >> \"$nlist\"'\n\t          func_to_tool_file \"$dlprefile\" func_convert_file_msys_to_w32\n\t          eval \"$NM \\\"$func_to_tool_file_result\\\" 2>/dev/null | $global_symbol_pipe >> '$nlist'\"\n\t        }\n\t      fi\n\t    ;;\n\t    *)\n\t      $opt_dry_run || {\n\t        eval '$ECHO \": $name \" >> \"$nlist\"'\n\t        func_to_tool_file \"$dlprefile\" func_convert_file_msys_to_w32\n\t        eval \"$NM \\\"$func_to_tool_file_result\\\" 2>/dev/null | $global_symbol_pipe >> '$nlist'\"\n\t      }\n\t    ;;\n          esac\n\tdone\n\n\t$opt_dry_run || {\n\t  # Make sure we have at least an empty file.\n\t  test -f \"$nlist\" || : > \"$nlist\"\n\n\t  if test -n \"$exclude_expsyms\"; then\n\t    $EGREP -v \" ($exclude_expsyms)$\" \"$nlist\" > \"$nlist\"T\n\t    $MV \"$nlist\"T \"$nlist\"\n\t  fi\n\n\t  # Try sorting and uniquifying the output.\n\t  if $GREP -v \"^: \" < \"$nlist\" |\n\t      if sort -k 3 </dev/null >/dev/null 2>&1; then\n\t\tsort -k 3\n\t      else\n\t\tsort +2\n\t      fi |\n\t      uniq > \"$nlist\"S; then\n\t    :\n\t  else\n\t    $GREP -v \"^: \" < \"$nlist\" > \"$nlist\"S\n\t  fi\n\n\t  if test -f \"$nlist\"S; then\n\t    eval \"$global_symbol_to_cdecl\"' < \"$nlist\"S >> \"$output_objdir/$my_dlsyms\"'\n\t  else\n\t    echo '/* NONE */' >> \"$output_objdir/$my_dlsyms\"\n\t  fi\n\n\t  echo >> \"$output_objdir/$my_dlsyms\" \"\\\n\n/* The mapping between symbol names and symbols.  */\ntypedef struct {\n  const char *name;\n  void *address;\n} lt_dlsymlist;\nextern LT_DLSYM_CONST lt_dlsymlist\nlt_${my_prefix}_LTX_preloaded_symbols[];\nLT_DLSYM_CONST lt_dlsymlist\nlt_${my_prefix}_LTX_preloaded_symbols[] =\n{\\\n  { \\\"$my_originator\\\", (void *) 0 },\"\n\n\t  case $need_lib_prefix in\n\t  no)\n\t    eval \"$global_symbol_to_c_name_address\" < \"$nlist\" >> \"$output_objdir/$my_dlsyms\"\n\t    ;;\n\t  *)\n\t    eval \"$global_symbol_to_c_name_address_lib_prefix\" < \"$nlist\" >> \"$output_objdir/$my_dlsyms\"\n\t    ;;\n\t  esac\n\t  echo >> \"$output_objdir/$my_dlsyms\" \"\\\n  {0, (void *) 0}\n};\n\n/* This works around a problem in FreeBSD linker */\n#ifdef FREEBSD_WORKAROUND\nstatic const void *lt_preloaded_setup() {\n  return lt_${my_prefix}_LTX_preloaded_symbols;\n}\n#endif\n\n#ifdef __cplusplus\n}\n#endif\\\n\"\n\t} # !$opt_dry_run\n\n\tpic_flag_for_symtable=\n\tcase \"$compile_command \" in\n\t*\" -static \"*) ;;\n\t*)\n\t  case $host in\n\t  # compiling the symbol table file with pic_flag works around\n\t  # a FreeBSD bug that causes programs to crash when -lm is\n\t  # linked before any other PIC object.  But we must not use\n\t  # pic_flag when linking with -static.  The problem exists in\n\t  # FreeBSD 2.2.6 and is fixed in FreeBSD 3.1.\n\t  *-*-freebsd2.*|*-*-freebsd3.0*|*-*-freebsdelf3.0*)\n\t    pic_flag_for_symtable=\" $pic_flag -DFREEBSD_WORKAROUND\" ;;\n\t  *-*-hpux*)\n\t    pic_flag_for_symtable=\" $pic_flag\"  ;;\n\t  *)\n\t    if test \"X$my_pic_p\" != Xno; then\n\t      pic_flag_for_symtable=\" $pic_flag\"\n\t    fi\n\t    ;;\n\t  esac\n\t  ;;\n\tesac\n\tsymtab_cflags=\n\tfor arg in $LTCFLAGS; do\n\t  case $arg in\n\t  -pie | -fpie | -fPIE) ;;\n\t  *) func_append symtab_cflags \" $arg\" ;;\n\t  esac\n\tdone\n\n\t# Now compile the dynamic symbol file.\n\tfunc_show_eval '(cd $output_objdir && $LTCC$symtab_cflags -c$no_builtin_flag$pic_flag_for_symtable \"$my_dlsyms\")' 'exit $?'\n\n\t# Clean up the generated files.\n\tfunc_show_eval '$RM \"$output_objdir/$my_dlsyms\" \"$nlist\" \"${nlist}S\" \"${nlist}T\"'\n\n\t# Transform the symbol file into the correct name.\n\tsymfileobj=\"$output_objdir/${my_outputname}S.$objext\"\n\tcase $host in\n\t*cygwin* | *mingw* | *cegcc* )\n\t  if test -f \"$output_objdir/$my_outputname.def\"; then\n\t    compile_command=`$ECHO \"$compile_command\" | $SED \"s%@SYMFILE@%$output_objdir/$my_outputname.def $symfileobj%\"`\n\t    finalize_command=`$ECHO \"$finalize_command\" | $SED \"s%@SYMFILE@%$output_objdir/$my_outputname.def $symfileobj%\"`\n\t  else\n\t    compile_command=`$ECHO \"$compile_command\" | $SED \"s%@SYMFILE@%$symfileobj%\"`\n\t    finalize_command=`$ECHO \"$finalize_command\" | $SED \"s%@SYMFILE@%$symfileobj%\"`\n\t  fi\n\t  ;;\n\t*)\n\t  compile_command=`$ECHO \"$compile_command\" | $SED \"s%@SYMFILE@%$symfileobj%\"`\n\t  finalize_command=`$ECHO \"$finalize_command\" | $SED \"s%@SYMFILE@%$symfileobj%\"`\n\t  ;;\n\tesac\n\t;;\n      *)\n\tfunc_fatal_error \"unknown suffix for \\`$my_dlsyms'\"\n\t;;\n      esac\n    else\n      # We keep going just in case the user didn't refer to\n      # lt_preloaded_symbols.  The linker will fail if global_symbol_pipe\n      # really was required.\n\n      # Nullify the symbol file.\n      compile_command=`$ECHO \"$compile_command\" | $SED \"s% @SYMFILE@%%\"`\n      finalize_command=`$ECHO \"$finalize_command\" | $SED \"s% @SYMFILE@%%\"`\n    fi\n}\n\n# func_win32_libid arg\n# return the library type of file 'arg'\n#\n# Need a lot of goo to handle *both* DLLs and import libs\n# Has to be a shell function in order to 'eat' the argument\n# that is supplied when $file_magic_command is called.\n# Despite the name, also deal with 64 bit binaries.\nfunc_win32_libid ()\n{\n  $opt_debug\n  win32_libid_type=\"unknown\"\n  win32_fileres=`file -L $1 2>/dev/null`\n  case $win32_fileres in\n  *ar\\ archive\\ import\\ library*) # definitely import\n    win32_libid_type=\"x86 archive import\"\n    ;;\n  *ar\\ archive*) # could be an import, or static\n    # Keep the egrep pattern in sync with the one in _LT_CHECK_MAGIC_METHOD.\n    if eval $OBJDUMP -f $1 | $SED -e '10q' 2>/dev/null |\n       $EGREP 'file format (pei*-i386(.*architecture: i386)?|pe-arm-wince|pe-x86-64)' >/dev/null; then\n      func_to_tool_file \"$1\" func_convert_file_msys_to_w32\n      win32_nmres=`eval $NM -f posix -A \\\"$func_to_tool_file_result\\\" |\n\t$SED -n -e '\n\t    1,100{\n\t\t/ I /{\n\t\t    s,.*,import,\n\t\t    p\n\t\t    q\n\t\t}\n\t    }'`\n      case $win32_nmres in\n      import*)  win32_libid_type=\"x86 archive import\";;\n      *)        win32_libid_type=\"x86 archive static\";;\n      esac\n    fi\n    ;;\n  *DLL*)\n    win32_libid_type=\"x86 DLL\"\n    ;;\n  *executable*) # but shell scripts are \"executable\" too...\n    case $win32_fileres in\n    *MS\\ Windows\\ PE\\ Intel*)\n      win32_libid_type=\"x86 DLL\"\n      ;;\n    esac\n    ;;\n  esac\n  $ECHO \"$win32_libid_type\"\n}\n\n# func_cygming_dll_for_implib ARG\n#\n# Platform-specific function to extract the\n# name of the DLL associated with the specified\n# import library ARG.\n# Invoked by eval'ing the libtool variable\n#    $sharedlib_from_linklib_cmd\n# Result is available in the variable\n#    $sharedlib_from_linklib_result\nfunc_cygming_dll_for_implib ()\n{\n  $opt_debug\n  sharedlib_from_linklib_result=`$DLLTOOL --identify-strict --identify \"$1\"`\n}\n\n# func_cygming_dll_for_implib_fallback_core SECTION_NAME LIBNAMEs\n#\n# The is the core of a fallback implementation of a\n# platform-specific function to extract the name of the\n# DLL associated with the specified import library LIBNAME.\n#\n# SECTION_NAME is either .idata$6 or .idata$7, depending\n# on the platform and compiler that created the implib.\n#\n# Echos the name of the DLL associated with the\n# specified import library.\nfunc_cygming_dll_for_implib_fallback_core ()\n{\n  $opt_debug\n  match_literal=`$ECHO \"$1\" | $SED \"$sed_make_literal_regex\"`\n  $OBJDUMP -s --section \"$1\" \"$2\" 2>/dev/null |\n    $SED '/^Contents of section '\"$match_literal\"':/{\n      # Place marker at beginning of archive member dllname section\n      s/.*/====MARK====/\n      p\n      d\n    }\n    # These lines can sometimes be longer than 43 characters, but\n    # are always uninteresting\n    /:[\t ]*file format pe[i]\\{,1\\}-/d\n    /^In archive [^:]*:/d\n    # Ensure marker is printed\n    /^====MARK====/p\n    # Remove all lines with less than 43 characters\n    /^.\\{43\\}/!d\n    # From remaining lines, remove first 43 characters\n    s/^.\\{43\\}//' |\n    $SED -n '\n      # Join marker and all lines until next marker into a single line\n      /^====MARK====/ b para\n      H\n      $ b para\n      b\n      :para\n      x\n      s/\\n//g\n      # Remove the marker\n      s/^====MARK====//\n      # Remove trailing dots and whitespace\n      s/[\\. \\t]*$//\n      # Print\n      /./p' |\n    # we now have a list, one entry per line, of the stringified\n    # contents of the appropriate section of all members of the\n    # archive which possess that section. Heuristic: eliminate\n    # all those which have a first or second character that is\n    # a '.' (that is, objdump's representation of an unprintable\n    # character.) This should work for all archives with less than\n    # 0x302f exports -- but will fail for DLLs whose name actually\n    # begins with a literal '.' or a single character followed by\n    # a '.'.\n    #\n    # Of those that remain, print the first one.\n    $SED -e '/^\\./d;/^.\\./d;q'\n}\n\n# func_cygming_gnu_implib_p ARG\n# This predicate returns with zero status (TRUE) if\n# ARG is a GNU/binutils-style import library. Returns\n# with nonzero status (FALSE) otherwise.\nfunc_cygming_gnu_implib_p ()\n{\n  $opt_debug\n  func_to_tool_file \"$1\" func_convert_file_msys_to_w32\n  func_cygming_gnu_implib_tmp=`$NM \"$func_to_tool_file_result\" | eval \"$global_symbol_pipe\" | $EGREP ' (_head_[A-Za-z0-9_]+_[ad]l*|[A-Za-z0-9_]+_[ad]l*_iname)$'`\n  test -n \"$func_cygming_gnu_implib_tmp\"\n}\n\n# func_cygming_ms_implib_p ARG\n# This predicate returns with zero status (TRUE) if\n# ARG is an MS-style import library. Returns\n# with nonzero status (FALSE) otherwise.\nfunc_cygming_ms_implib_p ()\n{\n  $opt_debug\n  func_to_tool_file \"$1\" func_convert_file_msys_to_w32\n  func_cygming_ms_implib_tmp=`$NM \"$func_to_tool_file_result\" | eval \"$global_symbol_pipe\" | $GREP '_NULL_IMPORT_DESCRIPTOR'`\n  test -n \"$func_cygming_ms_implib_tmp\"\n}\n\n# func_cygming_dll_for_implib_fallback ARG\n# Platform-specific function to extract the\n# name of the DLL associated with the specified\n# import library ARG.\n#\n# This fallback implementation is for use when $DLLTOOL\n# does not support the --identify-strict option.\n# Invoked by eval'ing the libtool variable\n#    $sharedlib_from_linklib_cmd\n# Result is available in the variable\n#    $sharedlib_from_linklib_result\nfunc_cygming_dll_for_implib_fallback ()\n{\n  $opt_debug\n  if func_cygming_gnu_implib_p \"$1\" ; then\n    # binutils import library\n    sharedlib_from_linklib_result=`func_cygming_dll_for_implib_fallback_core '.idata$7' \"$1\"`\n  elif func_cygming_ms_implib_p \"$1\" ; then\n    # ms-generated import library\n    sharedlib_from_linklib_result=`func_cygming_dll_for_implib_fallback_core '.idata$6' \"$1\"`\n  else\n    # unknown\n    sharedlib_from_linklib_result=\"\"\n  fi\n}\n\n\n# func_extract_an_archive dir oldlib\nfunc_extract_an_archive ()\n{\n    $opt_debug\n    f_ex_an_ar_dir=\"$1\"; shift\n    f_ex_an_ar_oldlib=\"$1\"\n    if test \"$lock_old_archive_extraction\" = yes; then\n      lockfile=$f_ex_an_ar_oldlib.lock\n      until $opt_dry_run || ln \"$progpath\" \"$lockfile\" 2>/dev/null; do\n\tfunc_echo \"Waiting for $lockfile to be removed\"\n\tsleep 2\n      done\n    fi\n    func_show_eval \"(cd \\$f_ex_an_ar_dir && $AR x \\\"\\$f_ex_an_ar_oldlib\\\")\" \\\n\t\t   'stat=$?; rm -f \"$lockfile\"; exit $stat'\n    if test \"$lock_old_archive_extraction\" = yes; then\n      $opt_dry_run || rm -f \"$lockfile\"\n    fi\n    if ($AR t \"$f_ex_an_ar_oldlib\" | sort | sort -uc >/dev/null 2>&1); then\n     :\n    else\n      func_fatal_error \"object name conflicts in archive: $f_ex_an_ar_dir/$f_ex_an_ar_oldlib\"\n    fi\n}\n\n\n# func_extract_archives gentop oldlib ...\nfunc_extract_archives ()\n{\n    $opt_debug\n    my_gentop=\"$1\"; shift\n    my_oldlibs=${1+\"$@\"}\n    my_oldobjs=\"\"\n    my_xlib=\"\"\n    my_xabs=\"\"\n    my_xdir=\"\"\n\n    for my_xlib in $my_oldlibs; do\n      # Extract the objects.\n      case $my_xlib in\n\t[\\\\/]* | [A-Za-z]:[\\\\/]*) my_xabs=\"$my_xlib\" ;;\n\t*) my_xabs=`pwd`\"/$my_xlib\" ;;\n      esac\n      func_basename \"$my_xlib\"\n      my_xlib=\"$func_basename_result\"\n      my_xlib_u=$my_xlib\n      while :; do\n        case \" $extracted_archives \" in\n\t*\" $my_xlib_u \"*)\n\t  func_arith $extracted_serial + 1\n\t  extracted_serial=$func_arith_result\n\t  my_xlib_u=lt$extracted_serial-$my_xlib ;;\n\t*) break ;;\n\tesac\n      done\n      extracted_archives=\"$extracted_archives $my_xlib_u\"\n      my_xdir=\"$my_gentop/$my_xlib_u\"\n\n      func_mkdir_p \"$my_xdir\"\n\n      case $host in\n      *-darwin*)\n\tfunc_verbose \"Extracting $my_xabs\"\n\t# Do not bother doing anything if just a dry run\n\t$opt_dry_run || {\n\t  darwin_orig_dir=`pwd`\n\t  cd $my_xdir || exit $?\n\t  darwin_archive=$my_xabs\n\t  darwin_curdir=`pwd`\n\t  darwin_base_archive=`basename \"$darwin_archive\"`\n\t  darwin_arches=`$LIPO -info \"$darwin_archive\" 2>/dev/null | $GREP Architectures 2>/dev/null || true`\n\t  if test -n \"$darwin_arches\"; then\n\t    darwin_arches=`$ECHO \"$darwin_arches\" | $SED -e 's/.*are://'`\n\t    darwin_arch=\n\t    func_verbose \"$darwin_base_archive has multiple architectures $darwin_arches\"\n\t    for darwin_arch in  $darwin_arches ; do\n\t      func_mkdir_p \"unfat-$$/${darwin_base_archive}-${darwin_arch}\"\n\t      $LIPO -thin $darwin_arch -output \"unfat-$$/${darwin_base_archive}-${darwin_arch}/${darwin_base_archive}\" \"${darwin_archive}\"\n\t      cd \"unfat-$$/${darwin_base_archive}-${darwin_arch}\"\n\t      func_extract_an_archive \"`pwd`\" \"${darwin_base_archive}\"\n\t      cd \"$darwin_curdir\"\n\t      $RM \"unfat-$$/${darwin_base_archive}-${darwin_arch}/${darwin_base_archive}\"\n\t    done # $darwin_arches\n            ## Okay now we've a bunch of thin objects, gotta fatten them up :)\n\t    darwin_filelist=`find unfat-$$ -type f -name \\*.o -print -o -name \\*.lo -print | $SED -e \"$basename\" | sort -u`\n\t    darwin_file=\n\t    darwin_files=\n\t    for darwin_file in $darwin_filelist; do\n\t      darwin_files=`find unfat-$$ -name $darwin_file -print | sort | $NL2SP`\n\t      $LIPO -create -output \"$darwin_file\" $darwin_files\n\t    done # $darwin_filelist\n\t    $RM -rf unfat-$$\n\t    cd \"$darwin_orig_dir\"\n\t  else\n\t    cd $darwin_orig_dir\n\t    func_extract_an_archive \"$my_xdir\" \"$my_xabs\"\n\t  fi # $darwin_arches\n\t} # !$opt_dry_run\n\t;;\n      *)\n        func_extract_an_archive \"$my_xdir\" \"$my_xabs\"\n\t;;\n      esac\n      my_oldobjs=\"$my_oldobjs \"`find $my_xdir -name \\*.$objext -print -o -name \\*.lo -print | sort | $NL2SP`\n    done\n\n    func_extract_archives_result=\"$my_oldobjs\"\n}\n\n\n# func_emit_wrapper [arg=no]\n#\n# Emit a libtool wrapper script on stdout.\n# Don't directly open a file because we may want to\n# incorporate the script contents within a cygwin/mingw\n# wrapper executable.  Must ONLY be called from within\n# func_mode_link because it depends on a number of variables\n# set therein.\n#\n# ARG is the value that the WRAPPER_SCRIPT_BELONGS_IN_OBJDIR\n# variable will take.  If 'yes', then the emitted script\n# will assume that the directory in which it is stored is\n# the $objdir directory.  This is a cygwin/mingw-specific\n# behavior.\nfunc_emit_wrapper ()\n{\n\tfunc_emit_wrapper_arg1=${1-no}\n\n\t$ECHO \"\\\n#! $SHELL\n\n# $output - temporary wrapper script for $objdir/$outputname\n# Generated by $PROGRAM (GNU $PACKAGE$TIMESTAMP) $VERSION\n#\n# The $output program cannot be directly executed until all the libtool\n# libraries that it depends on are installed.\n#\n# This wrapper script should never be moved out of the build directory.\n# If it is, it will not operate correctly.\n\n# Sed substitution that helps us do robust quoting.  It backslashifies\n# metacharacters that are still active within double-quoted strings.\nsed_quote_subst='$sed_quote_subst'\n\n# Be Bourne compatible\nif test -n \\\"\\${ZSH_VERSION+set}\\\" && (emulate sh) >/dev/null 2>&1; then\n  emulate sh\n  NULLCMD=:\n  # Zsh 3.x and 4.x performs word splitting on \\${1+\\\"\\$@\\\"}, which\n  # is contrary to our usage.  Disable this feature.\n  alias -g '\\${1+\\\"\\$@\\\"}'='\\\"\\$@\\\"'\n  setopt NO_GLOB_SUBST\nelse\n  case \\`(set -o) 2>/dev/null\\` in *posix*) set -o posix;; esac\nfi\nBIN_SH=xpg4; export BIN_SH # for Tru64\nDUALCASE=1; export DUALCASE # for MKS sh\n\n# The HP-UX ksh and POSIX shell print the target directory to stdout\n# if CDPATH is set.\n(unset CDPATH) >/dev/null 2>&1 && unset CDPATH\n\nrelink_command=\\\"$relink_command\\\"\n\n# This environment variable determines our operation mode.\nif test \\\"\\$libtool_install_magic\\\" = \\\"$magic\\\"; then\n  # install mode needs the following variables:\n  generated_by_libtool_version='$macro_version'\n  notinst_deplibs='$notinst_deplibs'\nelse\n  # When we are sourced in execute mode, \\$file and \\$ECHO are already set.\n  if test \\\"\\$libtool_execute_magic\\\" != \\\"$magic\\\"; then\n    file=\\\"\\$0\\\"\"\n\n    qECHO=`$ECHO \"$ECHO\" | $SED \"$sed_quote_subst\"`\n    $ECHO \"\\\n\n# A function that is used when there is no print builtin or printf.\nfunc_fallback_echo ()\n{\n  eval 'cat <<_LTECHO_EOF\n\\$1\n_LTECHO_EOF'\n}\n    ECHO=\\\"$qECHO\\\"\n  fi\n\n# Very basic option parsing. These options are (a) specific to\n# the libtool wrapper, (b) are identical between the wrapper\n# /script/ and the wrapper /executable/ which is used only on\n# windows platforms, and (c) all begin with the string \"--lt-\"\n# (application programs are unlikely to have options which match\n# this pattern).\n#\n# There are only two supported options: --lt-debug and\n# --lt-dump-script. There is, deliberately, no --lt-help.\n#\n# The first argument to this parsing function should be the\n# script's $0 value, followed by \"$@\".\nlt_option_debug=\nfunc_parse_lt_options ()\n{\n  lt_script_arg0=\\$0\n  shift\n  for lt_opt\n  do\n    case \\\"\\$lt_opt\\\" in\n    --lt-debug) lt_option_debug=1 ;;\n    --lt-dump-script)\n        lt_dump_D=\\`\\$ECHO \\\"X\\$lt_script_arg0\\\" | $SED -e 's/^X//' -e 's%/[^/]*$%%'\\`\n        test \\\"X\\$lt_dump_D\\\" = \\\"X\\$lt_script_arg0\\\" && lt_dump_D=.\n        lt_dump_F=\\`\\$ECHO \\\"X\\$lt_script_arg0\\\" | $SED -e 's/^X//' -e 's%^.*/%%'\\`\n        cat \\\"\\$lt_dump_D/\\$lt_dump_F\\\"\n        exit 0\n      ;;\n    --lt-*)\n        \\$ECHO \\\"Unrecognized --lt- option: '\\$lt_opt'\\\" 1>&2\n        exit 1\n      ;;\n    esac\n  done\n\n  # Print the debug banner immediately:\n  if test -n \\\"\\$lt_option_debug\\\"; then\n    echo \\\"${outputname}:${output}:\\${LINENO}: libtool wrapper (GNU $PACKAGE$TIMESTAMP) $VERSION\\\" 1>&2\n  fi\n}\n\n# Used when --lt-debug. Prints its arguments to stdout\n# (redirection is the responsibility of the caller)\nfunc_lt_dump_args ()\n{\n  lt_dump_args_N=1;\n  for lt_arg\n  do\n    \\$ECHO \\\"${outputname}:${output}:\\${LINENO}: newargv[\\$lt_dump_args_N]: \\$lt_arg\\\"\n    lt_dump_args_N=\\`expr \\$lt_dump_args_N + 1\\`\n  done\n}\n\n# Core function for launching the target application\nfunc_exec_program_core ()\n{\n\"\n  case $host in\n  # Backslashes separate directories on plain windows\n  *-*-mingw | *-*-os2* | *-cegcc*)\n    $ECHO \"\\\n      if test -n \\\"\\$lt_option_debug\\\"; then\n        \\$ECHO \\\"${outputname}:${output}:\\${LINENO}: newargv[0]: \\$progdir\\\\\\\\\\$program\\\" 1>&2\n        func_lt_dump_args \\${1+\\\"\\$@\\\"} 1>&2\n      fi\n      exec \\\"\\$progdir\\\\\\\\\\$program\\\" \\${1+\\\"\\$@\\\"}\n\"\n    ;;\n\n  *)\n    $ECHO \"\\\n      if test -n \\\"\\$lt_option_debug\\\"; then\n        \\$ECHO \\\"${outputname}:${output}:\\${LINENO}: newargv[0]: \\$progdir/\\$program\\\" 1>&2\n        func_lt_dump_args \\${1+\\\"\\$@\\\"} 1>&2\n      fi\n      exec \\\"\\$progdir/\\$program\\\" \\${1+\\\"\\$@\\\"}\n\"\n    ;;\n  esac\n  $ECHO \"\\\n      \\$ECHO \\\"\\$0: cannot exec \\$program \\$*\\\" 1>&2\n      exit 1\n}\n\n# A function to encapsulate launching the target application\n# Strips options in the --lt-* namespace from \\$@ and\n# launches target application with the remaining arguments.\nfunc_exec_program ()\n{\n  case \\\" \\$* \\\" in\n  *\\\\ --lt-*)\n    for lt_wr_arg\n    do\n      case \\$lt_wr_arg in\n      --lt-*) ;;\n      *) set x \\\"\\$@\\\" \\\"\\$lt_wr_arg\\\"; shift;;\n      esac\n      shift\n    done ;;\n  esac\n  func_exec_program_core \\${1+\\\"\\$@\\\"}\n}\n\n  # Parse options\n  func_parse_lt_options \\\"\\$0\\\" \\${1+\\\"\\$@\\\"}\n\n  # Find the directory that this script lives in.\n  thisdir=\\`\\$ECHO \\\"\\$file\\\" | $SED 's%/[^/]*$%%'\\`\n  test \\\"x\\$thisdir\\\" = \\\"x\\$file\\\" && thisdir=.\n\n  # Follow symbolic links until we get to the real thisdir.\n  file=\\`ls -ld \\\"\\$file\\\" | $SED -n 's/.*-> //p'\\`\n  while test -n \\\"\\$file\\\"; do\n    destdir=\\`\\$ECHO \\\"\\$file\\\" | $SED 's%/[^/]*\\$%%'\\`\n\n    # If there was a directory component, then change thisdir.\n    if test \\\"x\\$destdir\\\" != \\\"x\\$file\\\"; then\n      case \\\"\\$destdir\\\" in\n      [\\\\\\\\/]* | [A-Za-z]:[\\\\\\\\/]*) thisdir=\\\"\\$destdir\\\" ;;\n      *) thisdir=\\\"\\$thisdir/\\$destdir\\\" ;;\n      esac\n    fi\n\n    file=\\`\\$ECHO \\\"\\$file\\\" | $SED 's%^.*/%%'\\`\n    file=\\`ls -ld \\\"\\$thisdir/\\$file\\\" | $SED -n 's/.*-> //p'\\`\n  done\n\n  # Usually 'no', except on cygwin/mingw when embedded into\n  # the cwrapper.\n  WRAPPER_SCRIPT_BELONGS_IN_OBJDIR=$func_emit_wrapper_arg1\n  if test \\\"\\$WRAPPER_SCRIPT_BELONGS_IN_OBJDIR\\\" = \\\"yes\\\"; then\n    # special case for '.'\n    if test \\\"\\$thisdir\\\" = \\\".\\\"; then\n      thisdir=\\`pwd\\`\n    fi\n    # remove .libs from thisdir\n    case \\\"\\$thisdir\\\" in\n    *[\\\\\\\\/]$objdir ) thisdir=\\`\\$ECHO \\\"\\$thisdir\\\" | $SED 's%[\\\\\\\\/][^\\\\\\\\/]*$%%'\\` ;;\n    $objdir )   thisdir=. ;;\n    esac\n  fi\n\n  # Try to get the absolute directory name.\n  absdir=\\`cd \\\"\\$thisdir\\\" && pwd\\`\n  test -n \\\"\\$absdir\\\" && thisdir=\\\"\\$absdir\\\"\n\"\n\n\tif test \"$fast_install\" = yes; then\n\t  $ECHO \"\\\n  program=lt-'$outputname'$exeext\n  progdir=\\\"\\$thisdir/$objdir\\\"\n\n  if test ! -f \\\"\\$progdir/\\$program\\\" ||\n     { file=\\`ls -1dt \\\"\\$progdir/\\$program\\\" \\\"\\$progdir/../\\$program\\\" 2>/dev/null | ${SED} 1q\\`; \\\\\n       test \\\"X\\$file\\\" != \\\"X\\$progdir/\\$program\\\"; }; then\n\n    file=\\\"\\$\\$-\\$program\\\"\n\n    if test ! -d \\\"\\$progdir\\\"; then\n      $MKDIR \\\"\\$progdir\\\"\n    else\n      $RM \\\"\\$progdir/\\$file\\\"\n    fi\"\n\n\t  $ECHO \"\\\n\n    # relink executable if necessary\n    if test -n \\\"\\$relink_command\\\"; then\n      if relink_command_output=\\`eval \\$relink_command 2>&1\\`; then :\n      else\n\t$ECHO \\\"\\$relink_command_output\\\" >&2\n\t$RM \\\"\\$progdir/\\$file\\\"\n\texit 1\n      fi\n    fi\n\n    $MV \\\"\\$progdir/\\$file\\\" \\\"\\$progdir/\\$program\\\" 2>/dev/null ||\n    { $RM \\\"\\$progdir/\\$program\\\";\n      $MV \\\"\\$progdir/\\$file\\\" \\\"\\$progdir/\\$program\\\"; }\n    $RM \\\"\\$progdir/\\$file\\\"\n  fi\"\n\telse\n\t  $ECHO \"\\\n  program='$outputname'\n  progdir=\\\"\\$thisdir/$objdir\\\"\n\"\n\tfi\n\n\t$ECHO \"\\\n\n  if test -f \\\"\\$progdir/\\$program\\\"; then\"\n\n\t# fixup the dll searchpath if we need to.\n\t#\n\t# Fix the DLL searchpath if we need to.  Do this before prepending\n\t# to shlibpath, because on Windows, both are PATH and uninstalled\n\t# libraries must come first.\n\tif test -n \"$dllsearchpath\"; then\n\t  $ECHO \"\\\n    # Add the dll search path components to the executable PATH\n    PATH=$dllsearchpath:\\$PATH\n\"\n\tfi\n\n\t# Export our shlibpath_var if we have one.\n\tif test \"$shlibpath_overrides_runpath\" = yes && test -n \"$shlibpath_var\" && test -n \"$temp_rpath\"; then\n\t  $ECHO \"\\\n    # Add our own library path to $shlibpath_var\n    $shlibpath_var=\\\"$temp_rpath\\$$shlibpath_var\\\"\n\n    # Some systems cannot cope with colon-terminated $shlibpath_var\n    # The second colon is a workaround for a bug in BeOS R4 sed\n    $shlibpath_var=\\`\\$ECHO \\\"\\$$shlibpath_var\\\" | $SED 's/::*\\$//'\\`\n\n    export $shlibpath_var\n\"\n\tfi\n\n\t$ECHO \"\\\n    if test \\\"\\$libtool_execute_magic\\\" != \\\"$magic\\\"; then\n      # Run the actual program with our arguments.\n      func_exec_program \\${1+\\\"\\$@\\\"}\n    fi\n  else\n    # The program doesn't exist.\n    \\$ECHO \\\"\\$0: error: \\\\\\`\\$progdir/\\$program' does not exist\\\" 1>&2\n    \\$ECHO \\\"This script is just a wrapper for \\$program.\\\" 1>&2\n    \\$ECHO \\\"See the $PACKAGE documentation for more information.\\\" 1>&2\n    exit 1\n  fi\nfi\\\n\"\n}\n\n\n# func_emit_cwrapperexe_src\n# emit the source code for a wrapper executable on stdout\n# Must ONLY be called from within func_mode_link because\n# it depends on a number of variable set therein.\nfunc_emit_cwrapperexe_src ()\n{\n\tcat <<EOF\n\n/* $cwrappersource - temporary wrapper executable for $objdir/$outputname\n   Generated by $PROGRAM (GNU $PACKAGE$TIMESTAMP) $VERSION\n\n   The $output program cannot be directly executed until all the libtool\n   libraries that it depends on are installed.\n\n   This wrapper executable should never be moved out of the build directory.\n   If it is, it will not operate correctly.\n*/\nEOF\n\t    cat <<\"EOF\"\n#ifdef _MSC_VER\n# define _CRT_SECURE_NO_DEPRECATE 1\n#endif\n#include <stdio.h>\n#include <stdlib.h>\n#ifdef _MSC_VER\n# include <direct.h>\n# include <process.h>\n# include <io.h>\n#else\n# include <unistd.h>\n# include <stdint.h>\n# ifdef __CYGWIN__\n#  include <io.h>\n# endif\n#endif\n#include <malloc.h>\n#include <stdarg.h>\n#include <assert.h>\n#include <string.h>\n#include <ctype.h>\n#include <errno.h>\n#include <fcntl.h>\n#include <sys/stat.h>\n\n/* declarations of non-ANSI functions */\n#if defined(__MINGW32__)\n# ifdef __STRICT_ANSI__\nint _putenv (const char *);\n# endif\n#elif defined(__CYGWIN__)\n# ifdef __STRICT_ANSI__\nchar *realpath (const char *, char *);\nint putenv (char *);\nint setenv (const char *, const char *, int);\n# endif\n/* #elif defined (other platforms) ... */\n#endif\n\n/* portability defines, excluding path handling macros */\n#if defined(_MSC_VER)\n# define setmode _setmode\n# define stat    _stat\n# define chmod   _chmod\n# define getcwd  _getcwd\n# define putenv  _putenv\n# define S_IXUSR _S_IEXEC\n# ifndef _INTPTR_T_DEFINED\n#  define _INTPTR_T_DEFINED\n#  define intptr_t int\n# endif\n#elif defined(__MINGW32__)\n# define setmode _setmode\n# define stat    _stat\n# define chmod   _chmod\n# define getcwd  _getcwd\n# define putenv  _putenv\n#elif defined(__CYGWIN__)\n# define HAVE_SETENV\n# define FOPEN_WB \"wb\"\n/* #elif defined (other platforms) ... */\n#endif\n\n#if defined(PATH_MAX)\n# define LT_PATHMAX PATH_MAX\n#elif defined(MAXPATHLEN)\n# define LT_PATHMAX MAXPATHLEN\n#else\n# define LT_PATHMAX 1024\n#endif\n\n#ifndef S_IXOTH\n# define S_IXOTH 0\n#endif\n#ifndef S_IXGRP\n# define S_IXGRP 0\n#endif\n\n/* path handling portability macros */\n#ifndef DIR_SEPARATOR\n# define DIR_SEPARATOR '/'\n# define PATH_SEPARATOR ':'\n#endif\n\n#if defined (_WIN32) || defined (__MSDOS__) || defined (__DJGPP__) || \\\n  defined (__OS2__)\n# define HAVE_DOS_BASED_FILE_SYSTEM\n# define FOPEN_WB \"wb\"\n# ifndef DIR_SEPARATOR_2\n#  define DIR_SEPARATOR_2 '\\\\'\n# endif\n# ifndef PATH_SEPARATOR_2\n#  define PATH_SEPARATOR_2 ';'\n# endif\n#endif\n\n#ifndef DIR_SEPARATOR_2\n# define IS_DIR_SEPARATOR(ch) ((ch) == DIR_SEPARATOR)\n#else /* DIR_SEPARATOR_2 */\n# define IS_DIR_SEPARATOR(ch) \\\n\t(((ch) == DIR_SEPARATOR) || ((ch) == DIR_SEPARATOR_2))\n#endif /* DIR_SEPARATOR_2 */\n\n#ifndef PATH_SEPARATOR_2\n# define IS_PATH_SEPARATOR(ch) ((ch) == PATH_SEPARATOR)\n#else /* PATH_SEPARATOR_2 */\n# define IS_PATH_SEPARATOR(ch) ((ch) == PATH_SEPARATOR_2)\n#endif /* PATH_SEPARATOR_2 */\n\n#ifndef FOPEN_WB\n# define FOPEN_WB \"w\"\n#endif\n#ifndef _O_BINARY\n# define _O_BINARY 0\n#endif\n\n#define XMALLOC(type, num)      ((type *) xmalloc ((num) * sizeof(type)))\n#define XFREE(stale) do { \\\n  if (stale) { free ((void *) stale); stale = 0; } \\\n} while (0)\n\n#if defined(LT_DEBUGWRAPPER)\nstatic int lt_debug = 1;\n#else\nstatic int lt_debug = 0;\n#endif\n\nconst char *program_name = \"libtool-wrapper\"; /* in case xstrdup fails */\n\nvoid *xmalloc (size_t num);\nchar *xstrdup (const char *string);\nconst char *base_name (const char *name);\nchar *find_executable (const char *wrapper);\nchar *chase_symlinks (const char *pathspec);\nint make_executable (const char *path);\nint check_executable (const char *path);\nchar *strendzap (char *str, const char *pat);\nvoid lt_debugprintf (const char *file, int line, const char *fmt, ...);\nvoid lt_fatal (const char *file, int line, const char *message, ...);\nstatic const char *nonnull (const char *s);\nstatic const char *nonempty (const char *s);\nvoid lt_setenv (const char *name, const char *value);\nchar *lt_extend_str (const char *orig_value, const char *add, int to_end);\nvoid lt_update_exe_path (const char *name, const char *value);\nvoid lt_update_lib_path (const char *name, const char *value);\nchar **prepare_spawn (char **argv);\nvoid lt_dump_script (FILE *f);\nEOF\n\n\t    cat <<EOF\nvolatile const char * MAGIC_EXE = \"$magic_exe\";\nconst char * LIB_PATH_VARNAME = \"$shlibpath_var\";\nEOF\n\n\t    if test \"$shlibpath_overrides_runpath\" = yes && test -n \"$shlibpath_var\" && test -n \"$temp_rpath\"; then\n              func_to_host_path \"$temp_rpath\"\n\t      cat <<EOF\nconst char * LIB_PATH_VALUE   = \"$func_to_host_path_result\";\nEOF\n\t    else\n\t      cat <<\"EOF\"\nconst char * LIB_PATH_VALUE   = \"\";\nEOF\n\t    fi\n\n\t    if test -n \"$dllsearchpath\"; then\n              func_to_host_path \"$dllsearchpath:\"\n\t      cat <<EOF\nconst char * EXE_PATH_VARNAME = \"PATH\";\nconst char * EXE_PATH_VALUE   = \"$func_to_host_path_result\";\nEOF\n\t    else\n\t      cat <<\"EOF\"\nconst char * EXE_PATH_VARNAME = \"\";\nconst char * EXE_PATH_VALUE   = \"\";\nEOF\n\t    fi\n\n\t    if test \"$fast_install\" = yes; then\n\t      cat <<EOF\nconst char * TARGET_PROGRAM_NAME = \"lt-$outputname\"; /* hopefully, no .exe */\nEOF\n\t    else\n\t      cat <<EOF\nconst char * TARGET_PROGRAM_NAME = \"$outputname\"; /* hopefully, no .exe */\nEOF\n\t    fi\n\n\n\t    cat <<\"EOF\"\n\n#define LTWRAPPER_OPTION_PREFIX         \"--lt-\"\n\nstatic const char *ltwrapper_option_prefix = LTWRAPPER_OPTION_PREFIX;\nstatic const char *dumpscript_opt       = LTWRAPPER_OPTION_PREFIX \"dump-script\";\nstatic const char *debug_opt            = LTWRAPPER_OPTION_PREFIX \"debug\";\n\nint\nmain (int argc, char *argv[])\n{\n  char **newargz;\n  int  newargc;\n  char *tmp_pathspec;\n  char *actual_cwrapper_path;\n  char *actual_cwrapper_name;\n  char *target_name;\n  char *lt_argv_zero;\n  intptr_t rval = 127;\n\n  int i;\n\n  program_name = (char *) xstrdup (base_name (argv[0]));\n  newargz = XMALLOC (char *, argc + 1);\n\n  /* very simple arg parsing; don't want to rely on getopt\n   * also, copy all non cwrapper options to newargz, except\n   * argz[0], which is handled differently\n   */\n  newargc=0;\n  for (i = 1; i < argc; i++)\n    {\n      if (strcmp (argv[i], dumpscript_opt) == 0)\n\t{\nEOF\n\t    case \"$host\" in\n\t      *mingw* | *cygwin* )\n\t\t# make stdout use \"unix\" line endings\n\t\techo \"          setmode(1,_O_BINARY);\"\n\t\t;;\n\t      esac\n\n\t    cat <<\"EOF\"\n\t  lt_dump_script (stdout);\n\t  return 0;\n\t}\n      if (strcmp (argv[i], debug_opt) == 0)\n\t{\n          lt_debug = 1;\n          continue;\n\t}\n      if (strcmp (argv[i], ltwrapper_option_prefix) == 0)\n        {\n          /* however, if there is an option in the LTWRAPPER_OPTION_PREFIX\n             namespace, but it is not one of the ones we know about and\n             have already dealt with, above (inluding dump-script), then\n             report an error. Otherwise, targets might begin to believe\n             they are allowed to use options in the LTWRAPPER_OPTION_PREFIX\n             namespace. The first time any user complains about this, we'll\n             need to make LTWRAPPER_OPTION_PREFIX a configure-time option\n             or a configure.ac-settable value.\n           */\n          lt_fatal (__FILE__, __LINE__,\n\t\t    \"unrecognized %s option: '%s'\",\n                    ltwrapper_option_prefix, argv[i]);\n        }\n      /* otherwise ... */\n      newargz[++newargc] = xstrdup (argv[i]);\n    }\n  newargz[++newargc] = NULL;\n\nEOF\n\t    cat <<EOF\n  /* The GNU banner must be the first non-error debug message */\n  lt_debugprintf (__FILE__, __LINE__, \"libtool wrapper (GNU $PACKAGE$TIMESTAMP) $VERSION\\n\");\nEOF\n\t    cat <<\"EOF\"\n  lt_debugprintf (__FILE__, __LINE__, \"(main) argv[0]: %s\\n\", argv[0]);\n  lt_debugprintf (__FILE__, __LINE__, \"(main) program_name: %s\\n\", program_name);\n\n  tmp_pathspec = find_executable (argv[0]);\n  if (tmp_pathspec == NULL)\n    lt_fatal (__FILE__, __LINE__, \"couldn't find %s\", argv[0]);\n  lt_debugprintf (__FILE__, __LINE__,\n                  \"(main) found exe (before symlink chase) at: %s\\n\",\n\t\t  tmp_pathspec);\n\n  actual_cwrapper_path = chase_symlinks (tmp_pathspec);\n  lt_debugprintf (__FILE__, __LINE__,\n                  \"(main) found exe (after symlink chase) at: %s\\n\",\n\t\t  actual_cwrapper_path);\n  XFREE (tmp_pathspec);\n\n  actual_cwrapper_name = xstrdup (base_name (actual_cwrapper_path));\n  strendzap (actual_cwrapper_path, actual_cwrapper_name);\n\n  /* wrapper name transforms */\n  strendzap (actual_cwrapper_name, \".exe\");\n  tmp_pathspec = lt_extend_str (actual_cwrapper_name, \".exe\", 1);\n  XFREE (actual_cwrapper_name);\n  actual_cwrapper_name = tmp_pathspec;\n  tmp_pathspec = 0;\n\n  /* target_name transforms -- use actual target program name; might have lt- prefix */\n  target_name = xstrdup (base_name (TARGET_PROGRAM_NAME));\n  strendzap (target_name, \".exe\");\n  tmp_pathspec = lt_extend_str (target_name, \".exe\", 1);\n  XFREE (target_name);\n  target_name = tmp_pathspec;\n  tmp_pathspec = 0;\n\n  lt_debugprintf (__FILE__, __LINE__,\n\t\t  \"(main) libtool target name: %s\\n\",\n\t\t  target_name);\nEOF\n\n\t    cat <<EOF\n  newargz[0] =\n    XMALLOC (char, (strlen (actual_cwrapper_path) +\n\t\t    strlen (\"$objdir\") + 1 + strlen (actual_cwrapper_name) + 1));\n  strcpy (newargz[0], actual_cwrapper_path);\n  strcat (newargz[0], \"$objdir\");\n  strcat (newargz[0], \"/\");\nEOF\n\n\t    cat <<\"EOF\"\n  /* stop here, and copy so we don't have to do this twice */\n  tmp_pathspec = xstrdup (newargz[0]);\n\n  /* do NOT want the lt- prefix here, so use actual_cwrapper_name */\n  strcat (newargz[0], actual_cwrapper_name);\n\n  /* DO want the lt- prefix here if it exists, so use target_name */\n  lt_argv_zero = lt_extend_str (tmp_pathspec, target_name, 1);\n  XFREE (tmp_pathspec);\n  tmp_pathspec = NULL;\nEOF\n\n\t    case $host_os in\n\t      mingw*)\n\t    cat <<\"EOF\"\n  {\n    char* p;\n    while ((p = strchr (newargz[0], '\\\\')) != NULL)\n      {\n\t*p = '/';\n      }\n    while ((p = strchr (lt_argv_zero, '\\\\')) != NULL)\n      {\n\t*p = '/';\n      }\n  }\nEOF\n\t    ;;\n\t    esac\n\n\t    cat <<\"EOF\"\n  XFREE (target_name);\n  XFREE (actual_cwrapper_path);\n  XFREE (actual_cwrapper_name);\n\n  lt_setenv (\"BIN_SH\", \"xpg4\"); /* for Tru64 */\n  lt_setenv (\"DUALCASE\", \"1\");  /* for MSK sh */\n  /* Update the DLL searchpath.  EXE_PATH_VALUE ($dllsearchpath) must\n     be prepended before (that is, appear after) LIB_PATH_VALUE ($temp_rpath)\n     because on Windows, both *_VARNAMEs are PATH but uninstalled\n     libraries must come first. */\n  lt_update_exe_path (EXE_PATH_VARNAME, EXE_PATH_VALUE);\n  lt_update_lib_path (LIB_PATH_VARNAME, LIB_PATH_VALUE);\n\n  lt_debugprintf (__FILE__, __LINE__, \"(main) lt_argv_zero: %s\\n\",\n\t\t  nonnull (lt_argv_zero));\n  for (i = 0; i < newargc; i++)\n    {\n      lt_debugprintf (__FILE__, __LINE__, \"(main) newargz[%d]: %s\\n\",\n\t\t      i, nonnull (newargz[i]));\n    }\n\nEOF\n\n\t    case $host_os in\n\t      mingw*)\n\t\tcat <<\"EOF\"\n  /* execv doesn't actually work on mingw as expected on unix */\n  newargz = prepare_spawn (newargz);\n  rval = _spawnv (_P_WAIT, lt_argv_zero, (const char * const *) newargz);\n  if (rval == -1)\n    {\n      /* failed to start process */\n      lt_debugprintf (__FILE__, __LINE__,\n\t\t      \"(main) failed to launch target \\\"%s\\\": %s\\n\",\n\t\t      lt_argv_zero, nonnull (strerror (errno)));\n      return 127;\n    }\n  return rval;\nEOF\n\t\t;;\n\t      *)\n\t\tcat <<\"EOF\"\n  execv (lt_argv_zero, newargz);\n  return rval; /* =127, but avoids unused variable warning */\nEOF\n\t\t;;\n\t    esac\n\n\t    cat <<\"EOF\"\n}\n\nvoid *\nxmalloc (size_t num)\n{\n  void *p = (void *) malloc (num);\n  if (!p)\n    lt_fatal (__FILE__, __LINE__, \"memory exhausted\");\n\n  return p;\n}\n\nchar *\nxstrdup (const char *string)\n{\n  return string ? strcpy ((char *) xmalloc (strlen (string) + 1),\n\t\t\t  string) : NULL;\n}\n\nconst char *\nbase_name (const char *name)\n{\n  const char *base;\n\n#if defined (HAVE_DOS_BASED_FILE_SYSTEM)\n  /* Skip over the disk name in MSDOS pathnames. */\n  if (isalpha ((unsigned char) name[0]) && name[1] == ':')\n    name += 2;\n#endif\n\n  for (base = name; *name; name++)\n    if (IS_DIR_SEPARATOR (*name))\n      base = name + 1;\n  return base;\n}\n\nint\ncheck_executable (const char *path)\n{\n  struct stat st;\n\n  lt_debugprintf (__FILE__, __LINE__, \"(check_executable): %s\\n\",\n                  nonempty (path));\n  if ((!path) || (!*path))\n    return 0;\n\n  if ((stat (path, &st) >= 0)\n      && (st.st_mode & (S_IXUSR | S_IXGRP | S_IXOTH)))\n    return 1;\n  else\n    return 0;\n}\n\nint\nmake_executable (const char *path)\n{\n  int rval = 0;\n  struct stat st;\n\n  lt_debugprintf (__FILE__, __LINE__, \"(make_executable): %s\\n\",\n                  nonempty (path));\n  if ((!path) || (!*path))\n    return 0;\n\n  if (stat (path, &st) >= 0)\n    {\n      rval = chmod (path, st.st_mode | S_IXOTH | S_IXGRP | S_IXUSR);\n    }\n  return rval;\n}\n\n/* Searches for the full path of the wrapper.  Returns\n   newly allocated full path name if found, NULL otherwise\n   Does not chase symlinks, even on platforms that support them.\n*/\nchar *\nfind_executable (const char *wrapper)\n{\n  int has_slash = 0;\n  const char *p;\n  const char *p_next;\n  /* static buffer for getcwd */\n  char tmp[LT_PATHMAX + 1];\n  int tmp_len;\n  char *concat_name;\n\n  lt_debugprintf (__FILE__, __LINE__, \"(find_executable): %s\\n\",\n                  nonempty (wrapper));\n\n  if ((wrapper == NULL) || (*wrapper == '\\0'))\n    return NULL;\n\n  /* Absolute path? */\n#if defined (HAVE_DOS_BASED_FILE_SYSTEM)\n  if (isalpha ((unsigned char) wrapper[0]) && wrapper[1] == ':')\n    {\n      concat_name = xstrdup (wrapper);\n      if (check_executable (concat_name))\n\treturn concat_name;\n      XFREE (concat_name);\n    }\n  else\n    {\n#endif\n      if (IS_DIR_SEPARATOR (wrapper[0]))\n\t{\n\t  concat_name = xstrdup (wrapper);\n\t  if (check_executable (concat_name))\n\t    return concat_name;\n\t  XFREE (concat_name);\n\t}\n#if defined (HAVE_DOS_BASED_FILE_SYSTEM)\n    }\n#endif\n\n  for (p = wrapper; *p; p++)\n    if (*p == '/')\n      {\n\thas_slash = 1;\n\tbreak;\n      }\n  if (!has_slash)\n    {\n      /* no slashes; search PATH */\n      const char *path = getenv (\"PATH\");\n      if (path != NULL)\n\t{\n\t  for (p = path; *p; p = p_next)\n\t    {\n\t      const char *q;\n\t      size_t p_len;\n\t      for (q = p; *q; q++)\n\t\tif (IS_PATH_SEPARATOR (*q))\n\t\t  break;\n\t      p_len = q - p;\n\t      p_next = (*q == '\\0' ? q : q + 1);\n\t      if (p_len == 0)\n\t\t{\n\t\t  /* empty path: current directory */\n\t\t  if (getcwd (tmp, LT_PATHMAX) == NULL)\n\t\t    lt_fatal (__FILE__, __LINE__, \"getcwd failed: %s\",\n                              nonnull (strerror (errno)));\n\t\t  tmp_len = strlen (tmp);\n\t\t  concat_name =\n\t\t    XMALLOC (char, tmp_len + 1 + strlen (wrapper) + 1);\n\t\t  memcpy (concat_name, tmp, tmp_len);\n\t\t  concat_name[tmp_len] = '/';\n\t\t  strcpy (concat_name + tmp_len + 1, wrapper);\n\t\t}\n\t      else\n\t\t{\n\t\t  concat_name =\n\t\t    XMALLOC (char, p_len + 1 + strlen (wrapper) + 1);\n\t\t  memcpy (concat_name, p, p_len);\n\t\t  concat_name[p_len] = '/';\n\t\t  strcpy (concat_name + p_len + 1, wrapper);\n\t\t}\n\t      if (check_executable (concat_name))\n\t\treturn concat_name;\n\t      XFREE (concat_name);\n\t    }\n\t}\n      /* not found in PATH; assume curdir */\n    }\n  /* Relative path | not found in path: prepend cwd */\n  if (getcwd (tmp, LT_PATHMAX) == NULL)\n    lt_fatal (__FILE__, __LINE__, \"getcwd failed: %s\",\n              nonnull (strerror (errno)));\n  tmp_len = strlen (tmp);\n  concat_name = XMALLOC (char, tmp_len + 1 + strlen (wrapper) + 1);\n  memcpy (concat_name, tmp, tmp_len);\n  concat_name[tmp_len] = '/';\n  strcpy (concat_name + tmp_len + 1, wrapper);\n\n  if (check_executable (concat_name))\n    return concat_name;\n  XFREE (concat_name);\n  return NULL;\n}\n\nchar *\nchase_symlinks (const char *pathspec)\n{\n#ifndef S_ISLNK\n  return xstrdup (pathspec);\n#else\n  char buf[LT_PATHMAX];\n  struct stat s;\n  char *tmp_pathspec = xstrdup (pathspec);\n  char *p;\n  int has_symlinks = 0;\n  while (strlen (tmp_pathspec) && !has_symlinks)\n    {\n      lt_debugprintf (__FILE__, __LINE__,\n\t\t      \"checking path component for symlinks: %s\\n\",\n\t\t      tmp_pathspec);\n      if (lstat (tmp_pathspec, &s) == 0)\n\t{\n\t  if (S_ISLNK (s.st_mode) != 0)\n\t    {\n\t      has_symlinks = 1;\n\t      break;\n\t    }\n\n\t  /* search backwards for last DIR_SEPARATOR */\n\t  p = tmp_pathspec + strlen (tmp_pathspec) - 1;\n\t  while ((p > tmp_pathspec) && (!IS_DIR_SEPARATOR (*p)))\n\t    p--;\n\t  if ((p == tmp_pathspec) && (!IS_DIR_SEPARATOR (*p)))\n\t    {\n\t      /* no more DIR_SEPARATORS left */\n\t      break;\n\t    }\n\t  *p = '\\0';\n\t}\n      else\n\t{\n\t  lt_fatal (__FILE__, __LINE__,\n\t\t    \"error accessing file \\\"%s\\\": %s\",\n\t\t    tmp_pathspec, nonnull (strerror (errno)));\n\t}\n    }\n  XFREE (tmp_pathspec);\n\n  if (!has_symlinks)\n    {\n      return xstrdup (pathspec);\n    }\n\n  tmp_pathspec = realpath (pathspec, buf);\n  if (tmp_pathspec == 0)\n    {\n      lt_fatal (__FILE__, __LINE__,\n\t\t\"could not follow symlinks for %s\", pathspec);\n    }\n  return xstrdup (tmp_pathspec);\n#endif\n}\n\nchar *\nstrendzap (char *str, const char *pat)\n{\n  size_t len, patlen;\n\n  assert (str != NULL);\n  assert (pat != NULL);\n\n  len = strlen (str);\n  patlen = strlen (pat);\n\n  if (patlen <= len)\n    {\n      str += len - patlen;\n      if (strcmp (str, pat) == 0)\n\t*str = '\\0';\n    }\n  return str;\n}\n\nvoid\nlt_debugprintf (const char *file, int line, const char *fmt, ...)\n{\n  va_list args;\n  if (lt_debug)\n    {\n      (void) fprintf (stderr, \"%s:%s:%d: \", program_name, file, line);\n      va_start (args, fmt);\n      (void) vfprintf (stderr, fmt, args);\n      va_end (args);\n    }\n}\n\nstatic void\nlt_error_core (int exit_status, const char *file,\n\t       int line, const char *mode,\n\t       const char *message, va_list ap)\n{\n  fprintf (stderr, \"%s:%s:%d: %s: \", program_name, file, line, mode);\n  vfprintf (stderr, message, ap);\n  fprintf (stderr, \".\\n\");\n\n  if (exit_status >= 0)\n    exit (exit_status);\n}\n\nvoid\nlt_fatal (const char *file, int line, const char *message, ...)\n{\n  va_list ap;\n  va_start (ap, message);\n  lt_error_core (EXIT_FAILURE, file, line, \"FATAL\", message, ap);\n  va_end (ap);\n}\n\nstatic const char *\nnonnull (const char *s)\n{\n  return s ? s : \"(null)\";\n}\n\nstatic const char *\nnonempty (const char *s)\n{\n  return (s && !*s) ? \"(empty)\" : nonnull (s);\n}\n\nvoid\nlt_setenv (const char *name, const char *value)\n{\n  lt_debugprintf (__FILE__, __LINE__,\n\t\t  \"(lt_setenv) setting '%s' to '%s'\\n\",\n                  nonnull (name), nonnull (value));\n  {\n#ifdef HAVE_SETENV\n    /* always make a copy, for consistency with !HAVE_SETENV */\n    char *str = xstrdup (value);\n    setenv (name, str, 1);\n#else\n    int len = strlen (name) + 1 + strlen (value) + 1;\n    char *str = XMALLOC (char, len);\n    sprintf (str, \"%s=%s\", name, value);\n    if (putenv (str) != EXIT_SUCCESS)\n      {\n        XFREE (str);\n      }\n#endif\n  }\n}\n\nchar *\nlt_extend_str (const char *orig_value, const char *add, int to_end)\n{\n  char *new_value;\n  if (orig_value && *orig_value)\n    {\n      int orig_value_len = strlen (orig_value);\n      int add_len = strlen (add);\n      new_value = XMALLOC (char, add_len + orig_value_len + 1);\n      if (to_end)\n        {\n          strcpy (new_value, orig_value);\n          strcpy (new_value + orig_value_len, add);\n        }\n      else\n        {\n          strcpy (new_value, add);\n          strcpy (new_value + add_len, orig_value);\n        }\n    }\n  else\n    {\n      new_value = xstrdup (add);\n    }\n  return new_value;\n}\n\nvoid\nlt_update_exe_path (const char *name, const char *value)\n{\n  lt_debugprintf (__FILE__, __LINE__,\n\t\t  \"(lt_update_exe_path) modifying '%s' by prepending '%s'\\n\",\n                  nonnull (name), nonnull (value));\n\n  if (name && *name && value && *value)\n    {\n      char *new_value = lt_extend_str (getenv (name), value, 0);\n      /* some systems can't cope with a ':'-terminated path #' */\n      int len = strlen (new_value);\n      while (((len = strlen (new_value)) > 0) && IS_PATH_SEPARATOR (new_value[len-1]))\n        {\n          new_value[len-1] = '\\0';\n        }\n      lt_setenv (name, new_value);\n      XFREE (new_value);\n    }\n}\n\nvoid\nlt_update_lib_path (const char *name, const char *value)\n{\n  lt_debugprintf (__FILE__, __LINE__,\n\t\t  \"(lt_update_lib_path) modifying '%s' by prepending '%s'\\n\",\n                  nonnull (name), nonnull (value));\n\n  if (name && *name && value && *value)\n    {\n      char *new_value = lt_extend_str (getenv (name), value, 0);\n      lt_setenv (name, new_value);\n      XFREE (new_value);\n    }\n}\n\nEOF\n\t    case $host_os in\n\t      mingw*)\n\t\tcat <<\"EOF\"\n\n/* Prepares an argument vector before calling spawn().\n   Note that spawn() does not by itself call the command interpreter\n     (getenv (\"COMSPEC\") != NULL ? getenv (\"COMSPEC\") :\n      ({ OSVERSIONINFO v; v.dwOSVersionInfoSize = sizeof(OSVERSIONINFO);\n         GetVersionEx(&v);\n         v.dwPlatformId == VER_PLATFORM_WIN32_NT;\n      }) ? \"cmd.exe\" : \"command.com\").\n   Instead it simply concatenates the arguments, separated by ' ', and calls\n   CreateProcess().  We must quote the arguments since Win32 CreateProcess()\n   interprets characters like ' ', '\\t', '\\\\', '\"' (but not '<' and '>') in a\n   special way:\n   - Space and tab are interpreted as delimiters. They are not treated as\n     delimiters if they are surrounded by double quotes: \"...\".\n   - Unescaped double quotes are removed from the input. Their only effect is\n     that within double quotes, space and tab are treated like normal\n     characters.\n   - Backslashes not followed by double quotes are not special.\n   - But 2*n+1 backslashes followed by a double quote become\n     n backslashes followed by a double quote (n >= 0):\n       \\\" -> \"\n       \\\\\\\" -> \\\"\n       \\\\\\\\\\\" -> \\\\\"\n */\n#define SHELL_SPECIAL_CHARS \"\\\"\\\\ \\001\\002\\003\\004\\005\\006\\007\\010\\011\\012\\013\\014\\015\\016\\017\\020\\021\\022\\023\\024\\025\\026\\027\\030\\031\\032\\033\\034\\035\\036\\037\"\n#define SHELL_SPACE_CHARS \" \\001\\002\\003\\004\\005\\006\\007\\010\\011\\012\\013\\014\\015\\016\\017\\020\\021\\022\\023\\024\\025\\026\\027\\030\\031\\032\\033\\034\\035\\036\\037\"\nchar **\nprepare_spawn (char **argv)\n{\n  size_t argc;\n  char **new_argv;\n  size_t i;\n\n  /* Count number of arguments.  */\n  for (argc = 0; argv[argc] != NULL; argc++)\n    ;\n\n  /* Allocate new argument vector.  */\n  new_argv = XMALLOC (char *, argc + 1);\n\n  /* Put quoted arguments into the new argument vector.  */\n  for (i = 0; i < argc; i++)\n    {\n      const char *string = argv[i];\n\n      if (string[0] == '\\0')\n\tnew_argv[i] = xstrdup (\"\\\"\\\"\");\n      else if (strpbrk (string, SHELL_SPECIAL_CHARS) != NULL)\n\t{\n\t  int quote_around = (strpbrk (string, SHELL_SPACE_CHARS) != NULL);\n\t  size_t length;\n\t  unsigned int backslashes;\n\t  const char *s;\n\t  char *quoted_string;\n\t  char *p;\n\n\t  length = 0;\n\t  backslashes = 0;\n\t  if (quote_around)\n\t    length++;\n\t  for (s = string; *s != '\\0'; s++)\n\t    {\n\t      char c = *s;\n\t      if (c == '\"')\n\t\tlength += backslashes + 1;\n\t      length++;\n\t      if (c == '\\\\')\n\t\tbackslashes++;\n\t      else\n\t\tbackslashes = 0;\n\t    }\n\t  if (quote_around)\n\t    length += backslashes + 1;\n\n\t  quoted_string = XMALLOC (char, length + 1);\n\n\t  p = quoted_string;\n\t  backslashes = 0;\n\t  if (quote_around)\n\t    *p++ = '\"';\n\t  for (s = string; *s != '\\0'; s++)\n\t    {\n\t      char c = *s;\n\t      if (c == '\"')\n\t\t{\n\t\t  unsigned int j;\n\t\t  for (j = backslashes + 1; j > 0; j--)\n\t\t    *p++ = '\\\\';\n\t\t}\n\t      *p++ = c;\n\t      if (c == '\\\\')\n\t\tbackslashes++;\n\t      else\n\t\tbackslashes = 0;\n\t    }\n\t  if (quote_around)\n\t    {\n\t      unsigned int j;\n\t      for (j = backslashes; j > 0; j--)\n\t\t*p++ = '\\\\';\n\t      *p++ = '\"';\n\t    }\n\t  *p = '\\0';\n\n\t  new_argv[i] = quoted_string;\n\t}\n      else\n\tnew_argv[i] = (char *) string;\n    }\n  new_argv[argc] = NULL;\n\n  return new_argv;\n}\nEOF\n\t\t;;\n\t    esac\n\n            cat <<\"EOF\"\nvoid lt_dump_script (FILE* f)\n{\nEOF\n\t    func_emit_wrapper yes |\n\t      $SED -n -e '\ns/^\\(.\\{79\\}\\)\\(..*\\)/\\1\\\n\\2/\nh\ns/\\([\\\\\"]\\)/\\\\\\1/g\ns/$/\\\\n/\ns/\\([^\\n]*\\).*/  fputs (\"\\1\", f);/p\ng\nD'\n            cat <<\"EOF\"\n}\nEOF\n}\n# end: func_emit_cwrapperexe_src\n\n# func_win32_import_lib_p ARG\n# True if ARG is an import lib, as indicated by $file_magic_cmd\nfunc_win32_import_lib_p ()\n{\n    $opt_debug\n    case `eval $file_magic_cmd \\\"\\$1\\\" 2>/dev/null | $SED -e 10q` in\n    *import*) : ;;\n    *) false ;;\n    esac\n}\n\n# func_mode_link arg...\nfunc_mode_link ()\n{\n    $opt_debug\n    case $host in\n    *-*-cygwin* | *-*-mingw* | *-*-pw32* | *-*-os2* | *-cegcc*)\n      # It is impossible to link a dll without this setting, and\n      # we shouldn't force the makefile maintainer to figure out\n      # which system we are compiling for in order to pass an extra\n      # flag for every libtool invocation.\n      # allow_undefined=no\n\n      # FIXME: Unfortunately, there are problems with the above when trying\n      # to make a dll which has undefined symbols, in which case not\n      # even a static library is built.  For now, we need to specify\n      # -no-undefined on the libtool link line when we can be certain\n      # that all symbols are satisfied, otherwise we get a static library.\n      allow_undefined=yes\n      ;;\n    *)\n      allow_undefined=yes\n      ;;\n    esac\n    libtool_args=$nonopt\n    base_compile=\"$nonopt $@\"\n    compile_command=$nonopt\n    finalize_command=$nonopt\n\n    compile_rpath=\n    finalize_rpath=\n    compile_shlibpath=\n    finalize_shlibpath=\n    convenience=\n    old_convenience=\n    deplibs=\n    old_deplibs=\n    compiler_flags=\n    linker_flags=\n    dllsearchpath=\n    lib_search_path=`pwd`\n    inst_prefix_dir=\n    new_inherited_linker_flags=\n\n    avoid_version=no\n    bindir=\n    dlfiles=\n    dlprefiles=\n    dlself=no\n    export_dynamic=no\n    export_symbols=\n    export_symbols_regex=\n    generated=\n    libobjs=\n    ltlibs=\n    module=no\n    no_install=no\n    objs=\n    non_pic_objects=\n    precious_files_regex=\n    prefer_static_libs=no\n    preload=no\n    prev=\n    prevarg=\n    release=\n    rpath=\n    xrpath=\n    perm_rpath=\n    temp_rpath=\n    thread_safe=no\n    vinfo=\n    vinfo_number=no\n    weak_libs=\n    single_module=\"${wl}-single_module\"\n    func_infer_tag $base_compile\n\n    # We need to know -static, to get the right output filenames.\n    for arg\n    do\n      case $arg in\n      -shared)\n\ttest \"$build_libtool_libs\" != yes && \\\n\t  func_fatal_configuration \"can not build a shared library\"\n\tbuild_old_libs=no\n\tbreak\n\t;;\n      -all-static | -static | -static-libtool-libs)\n\tcase $arg in\n\t-all-static)\n\t  if test \"$build_libtool_libs\" = yes && test -z \"$link_static_flag\"; then\n\t    func_warning \"complete static linking is impossible in this configuration\"\n\t  fi\n\t  if test -n \"$link_static_flag\"; then\n\t    dlopen_self=$dlopen_self_static\n\t  fi\n\t  prefer_static_libs=yes\n\t  ;;\n\t-static)\n\t  if test -z \"$pic_flag\" && test -n \"$link_static_flag\"; then\n\t    dlopen_self=$dlopen_self_static\n\t  fi\n\t  prefer_static_libs=built\n\t  ;;\n\t-static-libtool-libs)\n\t  if test -z \"$pic_flag\" && test -n \"$link_static_flag\"; then\n\t    dlopen_self=$dlopen_self_static\n\t  fi\n\t  prefer_static_libs=yes\n\t  ;;\n\tesac\n\tbuild_libtool_libs=no\n\tbuild_old_libs=yes\n\tbreak\n\t;;\n      esac\n    done\n\n    # See if our shared archives depend on static archives.\n    test -n \"$old_archive_from_new_cmds\" && build_old_libs=yes\n\n    # Go through the arguments, transforming them on the way.\n    while test \"$#\" -gt 0; do\n      arg=\"$1\"\n      shift\n      func_quote_for_eval \"$arg\"\n      qarg=$func_quote_for_eval_unquoted_result\n      func_append libtool_args \" $func_quote_for_eval_result\"\n\n      # If the previous option needs an argument, assign it.\n      if test -n \"$prev\"; then\n\tcase $prev in\n\toutput)\n\t  func_append compile_command \" @OUTPUT@\"\n\t  func_append finalize_command \" @OUTPUT@\"\n\t  ;;\n\tesac\n\n\tcase $prev in\n\tbindir)\n\t  bindir=\"$arg\"\n\t  prev=\n\t  continue\n\t  ;;\n\tdlfiles|dlprefiles)\n\t  if test \"$preload\" = no; then\n\t    # Add the symbol object into the linking commands.\n\t    func_append compile_command \" @SYMFILE@\"\n\t    func_append finalize_command \" @SYMFILE@\"\n\t    preload=yes\n\t  fi\n\t  case $arg in\n\t  *.la | *.lo) ;;  # We handle these cases below.\n\t  force)\n\t    if test \"$dlself\" = no; then\n\t      dlself=needless\n\t      export_dynamic=yes\n\t    fi\n\t    prev=\n\t    continue\n\t    ;;\n\t  self)\n\t    if test \"$prev\" = dlprefiles; then\n\t      dlself=yes\n\t    elif test \"$prev\" = dlfiles && test \"$dlopen_self\" != yes; then\n\t      dlself=yes\n\t    else\n\t      dlself=needless\n\t      export_dynamic=yes\n\t    fi\n\t    prev=\n\t    continue\n\t    ;;\n\t  *)\n\t    if test \"$prev\" = dlfiles; then\n\t      func_append dlfiles \" $arg\"\n\t    else\n\t      func_append dlprefiles \" $arg\"\n\t    fi\n\t    prev=\n\t    continue\n\t    ;;\n\t  esac\n\t  ;;\n\texpsyms)\n\t  export_symbols=\"$arg\"\n\t  test -f \"$arg\" \\\n\t    || func_fatal_error \"symbol file \\`$arg' does not exist\"\n\t  prev=\n\t  continue\n\t  ;;\n\texpsyms_regex)\n\t  export_symbols_regex=\"$arg\"\n\t  prev=\n\t  continue\n\t  ;;\n\tframework)\n\t  case $host in\n\t    *-*-darwin*)\n\t      case \"$deplibs \" in\n\t\t*\" $qarg.ltframework \"*) ;;\n\t\t*) func_append deplibs \" $qarg.ltframework\" # this is fixed later\n\t\t   ;;\n\t      esac\n\t      ;;\n\t  esac\n\t  prev=\n\t  continue\n\t  ;;\n\tinst_prefix)\n\t  inst_prefix_dir=\"$arg\"\n\t  prev=\n\t  continue\n\t  ;;\n\tobjectlist)\n\t  if test -f \"$arg\"; then\n\t    save_arg=$arg\n\t    moreargs=\n\t    for fil in `cat \"$save_arg\"`\n\t    do\n#\t      func_append moreargs \" $fil\"\n\t      arg=$fil\n\t      # A libtool-controlled object.\n\n\t      # Check to see that this really is a libtool object.\n\t      if func_lalib_unsafe_p \"$arg\"; then\n\t\tpic_object=\n\t\tnon_pic_object=\n\n\t\t# Read the .lo file\n\t\tfunc_source \"$arg\"\n\n\t\tif test -z \"$pic_object\" ||\n\t\t   test -z \"$non_pic_object\" ||\n\t\t   test \"$pic_object\" = none &&\n\t\t   test \"$non_pic_object\" = none; then\n\t\t  func_fatal_error \"cannot find name of object for \\`$arg'\"\n\t\tfi\n\n\t\t# Extract subdirectory from the argument.\n\t\tfunc_dirname \"$arg\" \"/\" \"\"\n\t\txdir=\"$func_dirname_result\"\n\n\t\tif test \"$pic_object\" != none; then\n\t\t  # Prepend the subdirectory the object is found in.\n\t\t  pic_object=\"$xdir$pic_object\"\n\n\t\t  if test \"$prev\" = dlfiles; then\n\t\t    if test \"$build_libtool_libs\" = yes && test \"$dlopen_support\" = yes; then\n\t\t      func_append dlfiles \" $pic_object\"\n\t\t      prev=\n\t\t      continue\n\t\t    else\n\t\t      # If libtool objects are unsupported, then we need to preload.\n\t\t      prev=dlprefiles\n\t\t    fi\n\t\t  fi\n\n\t\t  # CHECK ME:  I think I busted this.  -Ossama\n\t\t  if test \"$prev\" = dlprefiles; then\n\t\t    # Preload the old-style object.\n\t\t    func_append dlprefiles \" $pic_object\"\n\t\t    prev=\n\t\t  fi\n\n\t\t  # A PIC object.\n\t\t  func_append libobjs \" $pic_object\"\n\t\t  arg=\"$pic_object\"\n\t\tfi\n\n\t\t# Non-PIC object.\n\t\tif test \"$non_pic_object\" != none; then\n\t\t  # Prepend the subdirectory the object is found in.\n\t\t  non_pic_object=\"$xdir$non_pic_object\"\n\n\t\t  # A standard non-PIC object\n\t\t  func_append non_pic_objects \" $non_pic_object\"\n\t\t  if test -z \"$pic_object\" || test \"$pic_object\" = none ; then\n\t\t    arg=\"$non_pic_object\"\n\t\t  fi\n\t\telse\n\t\t  # If the PIC object exists, use it instead.\n\t\t  # $xdir was prepended to $pic_object above.\n\t\t  non_pic_object=\"$pic_object\"\n\t\t  func_append non_pic_objects \" $non_pic_object\"\n\t\tfi\n\t      else\n\t\t# Only an error if not doing a dry-run.\n\t\tif $opt_dry_run; then\n\t\t  # Extract subdirectory from the argument.\n\t\t  func_dirname \"$arg\" \"/\" \"\"\n\t\t  xdir=\"$func_dirname_result\"\n\n\t\t  func_lo2o \"$arg\"\n\t\t  pic_object=$xdir$objdir/$func_lo2o_result\n\t\t  non_pic_object=$xdir$func_lo2o_result\n\t\t  func_append libobjs \" $pic_object\"\n\t\t  func_append non_pic_objects \" $non_pic_object\"\n\t        else\n\t\t  func_fatal_error \"\\`$arg' is not a valid libtool object\"\n\t\tfi\n\t      fi\n\t    done\n\t  else\n\t    func_fatal_error \"link input file \\`$arg' does not exist\"\n\t  fi\n\t  arg=$save_arg\n\t  prev=\n\t  continue\n\t  ;;\n\tprecious_regex)\n\t  precious_files_regex=\"$arg\"\n\t  prev=\n\t  continue\n\t  ;;\n\trelease)\n\t  release=\"-$arg\"\n\t  prev=\n\t  continue\n\t  ;;\n\trpath | xrpath)\n\t  # We need an absolute path.\n\t  case $arg in\n\t  [\\\\/]* | [A-Za-z]:[\\\\/]*) ;;\n\t  *)\n\t    func_fatal_error \"only absolute run-paths are allowed\"\n\t    ;;\n\t  esac\n\t  if test \"$prev\" = rpath; then\n\t    case \"$rpath \" in\n\t    *\" $arg \"*) ;;\n\t    *) func_append rpath \" $arg\" ;;\n\t    esac\n\t  else\n\t    case \"$xrpath \" in\n\t    *\" $arg \"*) ;;\n\t    *) func_append xrpath \" $arg\" ;;\n\t    esac\n\t  fi\n\t  prev=\n\t  continue\n\t  ;;\n\tshrext)\n\t  shrext_cmds=\"$arg\"\n\t  prev=\n\t  continue\n\t  ;;\n\tweak)\n\t  func_append weak_libs \" $arg\"\n\t  prev=\n\t  continue\n\t  ;;\n\txcclinker)\n\t  func_append linker_flags \" $qarg\"\n\t  func_append compiler_flags \" $qarg\"\n\t  prev=\n\t  func_append compile_command \" $qarg\"\n\t  func_append finalize_command \" $qarg\"\n\t  continue\n\t  ;;\n\txcompiler)\n\t  func_append compiler_flags \" $qarg\"\n\t  prev=\n\t  func_append compile_command \" $qarg\"\n\t  func_append finalize_command \" $qarg\"\n\t  continue\n\t  ;;\n\txlinker)\n\t  func_append linker_flags \" $qarg\"\n\t  func_append compiler_flags \" $wl$qarg\"\n\t  prev=\n\t  func_append compile_command \" $wl$qarg\"\n\t  func_append finalize_command \" $wl$qarg\"\n\t  continue\n\t  ;;\n\t*)\n\t  eval \"$prev=\\\"\\$arg\\\"\"\n\t  prev=\n\t  continue\n\t  ;;\n\tesac\n      fi # test -n \"$prev\"\n\n      prevarg=\"$arg\"\n\n      case $arg in\n      -all-static)\n\tif test -n \"$link_static_flag\"; then\n\t  # See comment for -static flag below, for more details.\n\t  func_append compile_command \" $link_static_flag\"\n\t  func_append finalize_command \" $link_static_flag\"\n\tfi\n\tcontinue\n\t;;\n\n      -allow-undefined)\n\t# FIXME: remove this flag sometime in the future.\n\tfunc_fatal_error \"\\`-allow-undefined' must not be used because it is the default\"\n\t;;\n\n      -avoid-version)\n\tavoid_version=yes\n\tcontinue\n\t;;\n\n      -bindir)\n\tprev=bindir\n\tcontinue\n\t;;\n\n      -dlopen)\n\tprev=dlfiles\n\tcontinue\n\t;;\n\n      -dlpreopen)\n\tprev=dlprefiles\n\tcontinue\n\t;;\n\n      -export-dynamic)\n\texport_dynamic=yes\n\tcontinue\n\t;;\n\n      -export-symbols | -export-symbols-regex)\n\tif test -n \"$export_symbols\" || test -n \"$export_symbols_regex\"; then\n\t  func_fatal_error \"more than one -exported-symbols argument is not allowed\"\n\tfi\n\tif test \"X$arg\" = \"X-export-symbols\"; then\n\t  prev=expsyms\n\telse\n\t  prev=expsyms_regex\n\tfi\n\tcontinue\n\t;;\n\n      -framework)\n\tprev=framework\n\tcontinue\n\t;;\n\n      -inst-prefix-dir)\n\tprev=inst_prefix\n\tcontinue\n\t;;\n\n      # The native IRIX linker understands -LANG:*, -LIST:* and -LNO:*\n      # so, if we see these flags be careful not to treat them like -L\n      -L[A-Z][A-Z]*:*)\n\tcase $with_gcc/$host in\n\tno/*-*-irix* | /*-*-irix*)\n\t  func_append compile_command \" $arg\"\n\t  func_append finalize_command \" $arg\"\n\t  ;;\n\tesac\n\tcontinue\n\t;;\n\n      -L*)\n\tfunc_stripname \"-L\" '' \"$arg\"\n\tif test -z \"$func_stripname_result\"; then\n\t  if test \"$#\" -gt 0; then\n\t    func_fatal_error \"require no space between \\`-L' and \\`$1'\"\n\t  else\n\t    func_fatal_error \"need path for \\`-L' option\"\n\t  fi\n\tfi\n\tfunc_resolve_sysroot \"$func_stripname_result\"\n\tdir=$func_resolve_sysroot_result\n\t# We need an absolute path.\n\tcase $dir in\n\t[\\\\/]* | [A-Za-z]:[\\\\/]*) ;;\n\t*)\n\t  absdir=`cd \"$dir\" && pwd`\n\t  test -z \"$absdir\" && \\\n\t    func_fatal_error \"cannot determine absolute directory name of \\`$dir'\"\n\t  dir=\"$absdir\"\n\t  ;;\n\tesac\n\tcase \"$deplibs \" in\n\t*\" -L$dir \"* | *\" $arg \"*)\n\t  # Will only happen for absolute or sysroot arguments\n\t  ;;\n\t*)\n\t  # Preserve sysroot, but never include relative directories\n\t  case $dir in\n\t    [\\\\/]* | [A-Za-z]:[\\\\/]* | =*) func_append deplibs \" $arg\" ;;\n\t    *) func_append deplibs \" -L$dir\" ;;\n\t  esac\n\t  func_append lib_search_path \" $dir\"\n\t  ;;\n\tesac\n\tcase $host in\n\t*-*-cygwin* | *-*-mingw* | *-*-pw32* | *-*-os2* | *-cegcc*)\n\t  testbindir=`$ECHO \"$dir\" | $SED 's*/lib$*/bin*'`\n\t  case :$dllsearchpath: in\n\t  *\":$dir:\"*) ;;\n\t  ::) dllsearchpath=$dir;;\n\t  *) func_append dllsearchpath \":$dir\";;\n\t  esac\n\t  case :$dllsearchpath: in\n\t  *\":$testbindir:\"*) ;;\n\t  ::) dllsearchpath=$testbindir;;\n\t  *) func_append dllsearchpath \":$testbindir\";;\n\t  esac\n\t  ;;\n\tesac\n\tcontinue\n\t;;\n\n      -l*)\n\tif test \"X$arg\" = \"X-lc\" || test \"X$arg\" = \"X-lm\"; then\n\t  case $host in\n\t  *-*-cygwin* | *-*-mingw* | *-*-pw32* | *-*-beos* | *-cegcc* | *-*-haiku*)\n\t    # These systems don't actually have a C or math library (as such)\n\t    continue\n\t    ;;\n\t  *-*-os2*)\n\t    # These systems don't actually have a C library (as such)\n\t    test \"X$arg\" = \"X-lc\" && continue\n\t    ;;\n\t  *-*-openbsd* | *-*-freebsd* | *-*-dragonfly*)\n\t    # Do not include libc due to us having libc/libc_r.\n\t    test \"X$arg\" = \"X-lc\" && continue\n\t    ;;\n\t  *-*-rhapsody* | *-*-darwin1.[012])\n\t    # Rhapsody C and math libraries are in the System framework\n\t    func_append deplibs \" System.ltframework\"\n\t    continue\n\t    ;;\n\t  *-*-sco3.2v5* | *-*-sco5v6*)\n\t    # Causes problems with __ctype\n\t    test \"X$arg\" = \"X-lc\" && continue\n\t    ;;\n\t  *-*-sysv4.2uw2* | *-*-sysv5* | *-*-unixware* | *-*-OpenUNIX*)\n\t    # Compiler inserts libc in the correct place for threads to work\n\t    test \"X$arg\" = \"X-lc\" && continue\n\t    ;;\n\t  esac\n\telif test \"X$arg\" = \"X-lc_r\"; then\n\t case $host in\n\t *-*-openbsd* | *-*-freebsd* | *-*-dragonfly*)\n\t   # Do not include libc_r directly, use -pthread flag.\n\t   continue\n\t   ;;\n\t esac\n\tfi\n\tfunc_append deplibs \" $arg\"\n\tcontinue\n\t;;\n\n      -module)\n\tmodule=yes\n\tcontinue\n\t;;\n\n      # Tru64 UNIX uses -model [arg] to determine the layout of C++\n      # classes, name mangling, and exception handling.\n      # Darwin uses the -arch flag to determine output architecture.\n      -model|-arch|-isysroot|--sysroot)\n\tfunc_append compiler_flags \" $arg\"\n\tfunc_append compile_command \" $arg\"\n\tfunc_append finalize_command \" $arg\"\n\tprev=xcompiler\n\tcontinue\n\t;;\n\n      -mt|-mthreads|-kthread|-Kthread|-pthread|-pthreads|--thread-safe \\\n      |-threads|-fopenmp|-openmp|-mp|-xopenmp|-omp|-qsmp=*)\n\tfunc_append compiler_flags \" $arg\"\n\tfunc_append compile_command \" $arg\"\n\tfunc_append finalize_command \" $arg\"\n\tcase \"$new_inherited_linker_flags \" in\n\t    *\" $arg \"*) ;;\n\t    * ) func_append new_inherited_linker_flags \" $arg\" ;;\n\tesac\n\tcontinue\n\t;;\n\n      -multi_module)\n\tsingle_module=\"${wl}-multi_module\"\n\tcontinue\n\t;;\n\n      -no-fast-install)\n\tfast_install=no\n\tcontinue\n\t;;\n\n      -no-install)\n\tcase $host in\n\t*-*-cygwin* | *-*-mingw* | *-*-pw32* | *-*-os2* | *-*-darwin* | *-cegcc*)\n\t  # The PATH hackery in wrapper scripts is required on Windows\n\t  # and Darwin in order for the loader to find any dlls it needs.\n\t  func_warning \"\\`-no-install' is ignored for $host\"\n\t  func_warning \"assuming \\`-no-fast-install' instead\"\n\t  fast_install=no\n\t  ;;\n\t*) no_install=yes ;;\n\tesac\n\tcontinue\n\t;;\n\n      -no-undefined)\n\tallow_undefined=no\n\tcontinue\n\t;;\n\n      -objectlist)\n\tprev=objectlist\n\tcontinue\n\t;;\n\n      -o) prev=output ;;\n\n      -precious-files-regex)\n\tprev=precious_regex\n\tcontinue\n\t;;\n\n      -release)\n\tprev=release\n\tcontinue\n\t;;\n\n      -rpath)\n\tprev=rpath\n\tcontinue\n\t;;\n\n      -R)\n\tprev=xrpath\n\tcontinue\n\t;;\n\n      -R*)\n\tfunc_stripname '-R' '' \"$arg\"\n\tdir=$func_stripname_result\n\t# We need an absolute path.\n\tcase $dir in\n\t[\\\\/]* | [A-Za-z]:[\\\\/]*) ;;\n\t=*)\n\t  func_stripname '=' '' \"$dir\"\n\t  dir=$lt_sysroot$func_stripname_result\n\t  ;;\n\t*)\n\t  func_fatal_error \"only absolute run-paths are allowed\"\n\t  ;;\n\tesac\n\tcase \"$xrpath \" in\n\t*\" $dir \"*) ;;\n\t*) func_append xrpath \" $dir\" ;;\n\tesac\n\tcontinue\n\t;;\n\n      -shared)\n\t# The effects of -shared are defined in a previous loop.\n\tcontinue\n\t;;\n\n      -shrext)\n\tprev=shrext\n\tcontinue\n\t;;\n\n      -static | -static-libtool-libs)\n\t# The effects of -static are defined in a previous loop.\n\t# We used to do the same as -all-static on platforms that\n\t# didn't have a PIC flag, but the assumption that the effects\n\t# would be equivalent was wrong.  It would break on at least\n\t# Digital Unix and AIX.\n\tcontinue\n\t;;\n\n      -thread-safe)\n\tthread_safe=yes\n\tcontinue\n\t;;\n\n      -version-info)\n\tprev=vinfo\n\tcontinue\n\t;;\n\n      -version-number)\n\tprev=vinfo\n\tvinfo_number=yes\n\tcontinue\n\t;;\n\n      -weak)\n        prev=weak\n\tcontinue\n\t;;\n\n      -Wc,*)\n\tfunc_stripname '-Wc,' '' \"$arg\"\n\targs=$func_stripname_result\n\targ=\n\tsave_ifs=\"$IFS\"; IFS=','\n\tfor flag in $args; do\n\t  IFS=\"$save_ifs\"\n          func_quote_for_eval \"$flag\"\n\t  func_append arg \" $func_quote_for_eval_result\"\n\t  func_append compiler_flags \" $func_quote_for_eval_result\"\n\tdone\n\tIFS=\"$save_ifs\"\n\tfunc_stripname ' ' '' \"$arg\"\n\targ=$func_stripname_result\n\t;;\n\n      -Wl,*)\n\tfunc_stripname '-Wl,' '' \"$arg\"\n\targs=$func_stripname_result\n\targ=\n\tsave_ifs=\"$IFS\"; IFS=','\n\tfor flag in $args; do\n\t  IFS=\"$save_ifs\"\n          func_quote_for_eval \"$flag\"\n\t  func_append arg \" $wl$func_quote_for_eval_result\"\n\t  func_append compiler_flags \" $wl$func_quote_for_eval_result\"\n\t  func_append linker_flags \" $func_quote_for_eval_result\"\n\tdone\n\tIFS=\"$save_ifs\"\n\tfunc_stripname ' ' '' \"$arg\"\n\targ=$func_stripname_result\n\t;;\n\n      -Xcompiler)\n\tprev=xcompiler\n\tcontinue\n\t;;\n\n      -Xlinker)\n\tprev=xlinker\n\tcontinue\n\t;;\n\n      -XCClinker)\n\tprev=xcclinker\n\tcontinue\n\t;;\n\n      # -msg_* for osf cc\n      -msg_*)\n\tfunc_quote_for_eval \"$arg\"\n\targ=\"$func_quote_for_eval_result\"\n\t;;\n\n      # Flags to be passed through unchanged, with rationale:\n      # -64, -mips[0-9]      enable 64-bit mode for the SGI compiler\n      # -r[0-9][0-9]*        specify processor for the SGI compiler\n      # -xarch=*, -xtarget=* enable 64-bit mode for the Sun compiler\n      # +DA*, +DD*           enable 64-bit mode for the HP compiler\n      # -q*                  compiler args for the IBM compiler\n      # -m*, -t[45]*, -txscale* architecture-specific flags for GCC\n      # -F/path              path to uninstalled frameworks, gcc on darwin\n      # -p, -pg, --coverage, -fprofile-*  profiling flags for GCC\n      # @file                GCC response files\n      # -tp=*                Portland pgcc target processor selection\n      # --sysroot=*          for sysroot support\n      # -O*, -flto*, -fwhopr*, -fuse-linker-plugin GCC link-time optimization\n      -64|-mips[0-9]|-r[0-9][0-9]*|-xarch=*|-xtarget=*|+DA*|+DD*|-q*|-m*| \\\n      -t[45]*|-txscale*|-p|-pg|--coverage|-fprofile-*|-F*|@*|-tp=*|--sysroot=*| \\\n      -O*|-flto*|-fwhopr*|-fuse-linker-plugin)\n        func_quote_for_eval \"$arg\"\n\targ=\"$func_quote_for_eval_result\"\n        func_append compile_command \" $arg\"\n        func_append finalize_command \" $arg\"\n        func_append compiler_flags \" $arg\"\n        continue\n        ;;\n\n      # Some other compiler flag.\n      -* | +*)\n        func_quote_for_eval \"$arg\"\n\targ=\"$func_quote_for_eval_result\"\n\t;;\n\n      *.$objext)\n\t# A standard object.\n\tfunc_append objs \" $arg\"\n\t;;\n\n      *.lo)\n\t# A libtool-controlled object.\n\n\t# Check to see that this really is a libtool object.\n\tif func_lalib_unsafe_p \"$arg\"; then\n\t  pic_object=\n\t  non_pic_object=\n\n\t  # Read the .lo file\n\t  func_source \"$arg\"\n\n\t  if test -z \"$pic_object\" ||\n\t     test -z \"$non_pic_object\" ||\n\t     test \"$pic_object\" = none &&\n\t     test \"$non_pic_object\" = none; then\n\t    func_fatal_error \"cannot find name of object for \\`$arg'\"\n\t  fi\n\n\t  # Extract subdirectory from the argument.\n\t  func_dirname \"$arg\" \"/\" \"\"\n\t  xdir=\"$func_dirname_result\"\n\n\t  if test \"$pic_object\" != none; then\n\t    # Prepend the subdirectory the object is found in.\n\t    pic_object=\"$xdir$pic_object\"\n\n\t    if test \"$prev\" = dlfiles; then\n\t      if test \"$build_libtool_libs\" = yes && test \"$dlopen_support\" = yes; then\n\t\tfunc_append dlfiles \" $pic_object\"\n\t\tprev=\n\t\tcontinue\n\t      else\n\t\t# If libtool objects are unsupported, then we need to preload.\n\t\tprev=dlprefiles\n\t      fi\n\t    fi\n\n\t    # CHECK ME:  I think I busted this.  -Ossama\n\t    if test \"$prev\" = dlprefiles; then\n\t      # Preload the old-style object.\n\t      func_append dlprefiles \" $pic_object\"\n\t      prev=\n\t    fi\n\n\t    # A PIC object.\n\t    func_append libobjs \" $pic_object\"\n\t    arg=\"$pic_object\"\n\t  fi\n\n\t  # Non-PIC object.\n\t  if test \"$non_pic_object\" != none; then\n\t    # Prepend the subdirectory the object is found in.\n\t    non_pic_object=\"$xdir$non_pic_object\"\n\n\t    # A standard non-PIC object\n\t    func_append non_pic_objects \" $non_pic_object\"\n\t    if test -z \"$pic_object\" || test \"$pic_object\" = none ; then\n\t      arg=\"$non_pic_object\"\n\t    fi\n\t  else\n\t    # If the PIC object exists, use it instead.\n\t    # $xdir was prepended to $pic_object above.\n\t    non_pic_object=\"$pic_object\"\n\t    func_append non_pic_objects \" $non_pic_object\"\n\t  fi\n\telse\n\t  # Only an error if not doing a dry-run.\n\t  if $opt_dry_run; then\n\t    # Extract subdirectory from the argument.\n\t    func_dirname \"$arg\" \"/\" \"\"\n\t    xdir=\"$func_dirname_result\"\n\n\t    func_lo2o \"$arg\"\n\t    pic_object=$xdir$objdir/$func_lo2o_result\n\t    non_pic_object=$xdir$func_lo2o_result\n\t    func_append libobjs \" $pic_object\"\n\t    func_append non_pic_objects \" $non_pic_object\"\n\t  else\n\t    func_fatal_error \"\\`$arg' is not a valid libtool object\"\n\t  fi\n\tfi\n\t;;\n\n      *.$libext)\n\t# An archive.\n\tfunc_append deplibs \" $arg\"\n\tfunc_append old_deplibs \" $arg\"\n\tcontinue\n\t;;\n\n      *.la)\n\t# A libtool-controlled library.\n\n\tfunc_resolve_sysroot \"$arg\"\n\tif test \"$prev\" = dlfiles; then\n\t  # This library was specified with -dlopen.\n\t  func_append dlfiles \" $func_resolve_sysroot_result\"\n\t  prev=\n\telif test \"$prev\" = dlprefiles; then\n\t  # The library was specified with -dlpreopen.\n\t  func_append dlprefiles \" $func_resolve_sysroot_result\"\n\t  prev=\n\telse\n\t  func_append deplibs \" $func_resolve_sysroot_result\"\n\tfi\n\tcontinue\n\t;;\n\n      # Some other compiler argument.\n      *)\n\t# Unknown arguments in both finalize_command and compile_command need\n\t# to be aesthetically quoted because they are evaled later.\n\tfunc_quote_for_eval \"$arg\"\n\targ=\"$func_quote_for_eval_result\"\n\t;;\n      esac # arg\n\n      # Now actually substitute the argument into the commands.\n      if test -n \"$arg\"; then\n\tfunc_append compile_command \" $arg\"\n\tfunc_append finalize_command \" $arg\"\n      fi\n    done # argument parsing loop\n\n    test -n \"$prev\" && \\\n      func_fatal_help \"the \\`$prevarg' option requires an argument\"\n\n    if test \"$export_dynamic\" = yes && test -n \"$export_dynamic_flag_spec\"; then\n      eval arg=\\\"$export_dynamic_flag_spec\\\"\n      func_append compile_command \" $arg\"\n      func_append finalize_command \" $arg\"\n    fi\n\n    oldlibs=\n    # calculate the name of the file, without its directory\n    func_basename \"$output\"\n    outputname=\"$func_basename_result\"\n    libobjs_save=\"$libobjs\"\n\n    if test -n \"$shlibpath_var\"; then\n      # get the directories listed in $shlibpath_var\n      eval shlib_search_path=\\`\\$ECHO \\\"\\${$shlibpath_var}\\\" \\| \\$SED \\'s/:/ /g\\'\\`\n    else\n      shlib_search_path=\n    fi\n    eval sys_lib_search_path=\\\"$sys_lib_search_path_spec\\\"\n    eval sys_lib_dlsearch_path=\\\"$sys_lib_dlsearch_path_spec\\\"\n\n    func_dirname \"$output\" \"/\" \"\"\n    output_objdir=\"$func_dirname_result$objdir\"\n    func_to_tool_file \"$output_objdir/\"\n    tool_output_objdir=$func_to_tool_file_result\n    # Create the object directory.\n    func_mkdir_p \"$output_objdir\"\n\n    # Determine the type of output\n    case $output in\n    \"\")\n      func_fatal_help \"you must specify an output file\"\n      ;;\n    *.$libext) linkmode=oldlib ;;\n    *.lo | *.$objext) linkmode=obj ;;\n    *.la) linkmode=lib ;;\n    *) linkmode=prog ;; # Anything else should be a program.\n    esac\n\n    specialdeplibs=\n\n    libs=\n    # Find all interdependent deplibs by searching for libraries\n    # that are linked more than once (e.g. -la -lb -la)\n    for deplib in $deplibs; do\n      if $opt_preserve_dup_deps ; then\n\tcase \"$libs \" in\n\t*\" $deplib \"*) func_append specialdeplibs \" $deplib\" ;;\n\tesac\n      fi\n      func_append libs \" $deplib\"\n    done\n\n    if test \"$linkmode\" = lib; then\n      libs=\"$predeps $libs $compiler_lib_search_path $postdeps\"\n\n      # Compute libraries that are listed more than once in $predeps\n      # $postdeps and mark them as special (i.e., whose duplicates are\n      # not to be eliminated).\n      pre_post_deps=\n      if $opt_duplicate_compiler_generated_deps; then\n\tfor pre_post_dep in $predeps $postdeps; do\n\t  case \"$pre_post_deps \" in\n\t  *\" $pre_post_dep \"*) func_append specialdeplibs \" $pre_post_deps\" ;;\n\t  esac\n\t  func_append pre_post_deps \" $pre_post_dep\"\n\tdone\n      fi\n      pre_post_deps=\n    fi\n\n    deplibs=\n    newdependency_libs=\n    newlib_search_path=\n    need_relink=no # whether we're linking any uninstalled libtool libraries\n    notinst_deplibs= # not-installed libtool libraries\n    notinst_path= # paths that contain not-installed libtool libraries\n\n    case $linkmode in\n    lib)\n\tpasses=\"conv dlpreopen link\"\n\tfor file in $dlfiles $dlprefiles; do\n\t  case $file in\n\t  *.la) ;;\n\t  *)\n\t    func_fatal_help \"libraries can \\`-dlopen' only libtool libraries: $file\"\n\t    ;;\n\t  esac\n\tdone\n\t;;\n    prog)\n\tcompile_deplibs=\n\tfinalize_deplibs=\n\talldeplibs=no\n\tnewdlfiles=\n\tnewdlprefiles=\n\tpasses=\"conv scan dlopen dlpreopen link\"\n\t;;\n    *)  passes=\"conv\"\n\t;;\n    esac\n\n    for pass in $passes; do\n      # The preopen pass in lib mode reverses $deplibs; put it back here\n      # so that -L comes before libs that need it for instance...\n      if test \"$linkmode,$pass\" = \"lib,link\"; then\n\t## FIXME: Find the place where the list is rebuilt in the wrong\n\t##        order, and fix it there properly\n        tmp_deplibs=\n\tfor deplib in $deplibs; do\n\t  tmp_deplibs=\"$deplib $tmp_deplibs\"\n\tdone\n\tdeplibs=\"$tmp_deplibs\"\n      fi\n\n      if test \"$linkmode,$pass\" = \"lib,link\" ||\n\t test \"$linkmode,$pass\" = \"prog,scan\"; then\n\tlibs=\"$deplibs\"\n\tdeplibs=\n      fi\n      if test \"$linkmode\" = prog; then\n\tcase $pass in\n\tdlopen) libs=\"$dlfiles\" ;;\n\tdlpreopen) libs=\"$dlprefiles\" ;;\n\tlink)\n\t  libs=\"$deplibs %DEPLIBS%\"\n\t  test \"X$link_all_deplibs\" != Xno && libs=\"$libs $dependency_libs\"\n\t  ;;\n\tesac\n      fi\n      if test \"$linkmode,$pass\" = \"lib,dlpreopen\"; then\n\t# Collect and forward deplibs of preopened libtool libs\n\tfor lib in $dlprefiles; do\n\t  # Ignore non-libtool-libs\n\t  dependency_libs=\n\t  func_resolve_sysroot \"$lib\"\n\t  case $lib in\n\t  *.la)\tfunc_source \"$func_resolve_sysroot_result\" ;;\n\t  esac\n\n\t  # Collect preopened libtool deplibs, except any this library\n\t  # has declared as weak libs\n\t  for deplib in $dependency_libs; do\n\t    func_basename \"$deplib\"\n            deplib_base=$func_basename_result\n\t    case \" $weak_libs \" in\n\t    *\" $deplib_base \"*) ;;\n\t    *) func_append deplibs \" $deplib\" ;;\n\t    esac\n\t  done\n\tdone\n\tlibs=\"$dlprefiles\"\n      fi\n      if test \"$pass\" = dlopen; then\n\t# Collect dlpreopened libraries\n\tsave_deplibs=\"$deplibs\"\n\tdeplibs=\n      fi\n\n      for deplib in $libs; do\n\tlib=\n\tfound=no\n\tcase $deplib in\n\t-mt|-mthreads|-kthread|-Kthread|-pthread|-pthreads|--thread-safe \\\n        |-threads|-fopenmp|-openmp|-mp|-xopenmp|-omp|-qsmp=*)\n\t  if test \"$linkmode,$pass\" = \"prog,link\"; then\n\t    compile_deplibs=\"$deplib $compile_deplibs\"\n\t    finalize_deplibs=\"$deplib $finalize_deplibs\"\n\t  else\n\t    func_append compiler_flags \" $deplib\"\n\t    if test \"$linkmode\" = lib ; then\n\t\tcase \"$new_inherited_linker_flags \" in\n\t\t    *\" $deplib \"*) ;;\n\t\t    * ) func_append new_inherited_linker_flags \" $deplib\" ;;\n\t\tesac\n\t    fi\n\t  fi\n\t  continue\n\t  ;;\n\t-l*)\n\t  if test \"$linkmode\" != lib && test \"$linkmode\" != prog; then\n\t    func_warning \"\\`-l' is ignored for archives/objects\"\n\t    continue\n\t  fi\n\t  func_stripname '-l' '' \"$deplib\"\n\t  name=$func_stripname_result\n\t  if test \"$linkmode\" = lib; then\n\t    searchdirs=\"$newlib_search_path $lib_search_path $compiler_lib_search_dirs $sys_lib_search_path $shlib_search_path\"\n\t  else\n\t    searchdirs=\"$newlib_search_path $lib_search_path $sys_lib_search_path $shlib_search_path\"\n\t  fi\n\t  for searchdir in $searchdirs; do\n\t    for search_ext in .la $std_shrext .so .a; do\n\t      # Search the libtool library\n\t      lib=\"$searchdir/lib${name}${search_ext}\"\n\t      if test -f \"$lib\"; then\n\t\tif test \"$search_ext\" = \".la\"; then\n\t\t  found=yes\n\t\telse\n\t\t  found=no\n\t\tfi\n\t\tbreak 2\n\t      fi\n\t    done\n\t  done\n\t  if test \"$found\" != yes; then\n\t    # deplib doesn't seem to be a libtool library\n\t    if test \"$linkmode,$pass\" = \"prog,link\"; then\n\t      compile_deplibs=\"$deplib $compile_deplibs\"\n\t      finalize_deplibs=\"$deplib $finalize_deplibs\"\n\t    else\n\t      deplibs=\"$deplib $deplibs\"\n\t      test \"$linkmode\" = lib && newdependency_libs=\"$deplib $newdependency_libs\"\n\t    fi\n\t    continue\n\t  else # deplib is a libtool library\n\t    # If $allow_libtool_libs_with_static_runtimes && $deplib is a stdlib,\n\t    # We need to do some special things here, and not later.\n\t    if test \"X$allow_libtool_libs_with_static_runtimes\" = \"Xyes\" ; then\n\t      case \" $predeps $postdeps \" in\n\t      *\" $deplib \"*)\n\t\tif func_lalib_p \"$lib\"; then\n\t\t  library_names=\n\t\t  old_library=\n\t\t  func_source \"$lib\"\n\t\t  for l in $old_library $library_names; do\n\t\t    ll=\"$l\"\n\t\t  done\n\t\t  if test \"X$ll\" = \"X$old_library\" ; then # only static version available\n\t\t    found=no\n\t\t    func_dirname \"$lib\" \"\" \".\"\n\t\t    ladir=\"$func_dirname_result\"\n\t\t    lib=$ladir/$old_library\n\t\t    if test \"$linkmode,$pass\" = \"prog,link\"; then\n\t\t      compile_deplibs=\"$deplib $compile_deplibs\"\n\t\t      finalize_deplibs=\"$deplib $finalize_deplibs\"\n\t\t    else\n\t\t      deplibs=\"$deplib $deplibs\"\n\t\t      test \"$linkmode\" = lib && newdependency_libs=\"$deplib $newdependency_libs\"\n\t\t    fi\n\t\t    continue\n\t\t  fi\n\t\tfi\n\t\t;;\n\t      *) ;;\n\t      esac\n\t    fi\n\t  fi\n\t  ;; # -l\n\t*.ltframework)\n\t  if test \"$linkmode,$pass\" = \"prog,link\"; then\n\t    compile_deplibs=\"$deplib $compile_deplibs\"\n\t    finalize_deplibs=\"$deplib $finalize_deplibs\"\n\t  else\n\t    deplibs=\"$deplib $deplibs\"\n\t    if test \"$linkmode\" = lib ; then\n\t\tcase \"$new_inherited_linker_flags \" in\n\t\t    *\" $deplib \"*) ;;\n\t\t    * ) func_append new_inherited_linker_flags \" $deplib\" ;;\n\t\tesac\n\t    fi\n\t  fi\n\t  continue\n\t  ;;\n\t-L*)\n\t  case $linkmode in\n\t  lib)\n\t    deplibs=\"$deplib $deplibs\"\n\t    test \"$pass\" = conv && continue\n\t    newdependency_libs=\"$deplib $newdependency_libs\"\n\t    func_stripname '-L' '' \"$deplib\"\n\t    func_resolve_sysroot \"$func_stripname_result\"\n\t    func_append newlib_search_path \" $func_resolve_sysroot_result\"\n\t    ;;\n\t  prog)\n\t    if test \"$pass\" = conv; then\n\t      deplibs=\"$deplib $deplibs\"\n\t      continue\n\t    fi\n\t    if test \"$pass\" = scan; then\n\t      deplibs=\"$deplib $deplibs\"\n\t    else\n\t      compile_deplibs=\"$deplib $compile_deplibs\"\n\t      finalize_deplibs=\"$deplib $finalize_deplibs\"\n\t    fi\n\t    func_stripname '-L' '' \"$deplib\"\n\t    func_resolve_sysroot \"$func_stripname_result\"\n\t    func_append newlib_search_path \" $func_resolve_sysroot_result\"\n\t    ;;\n\t  *)\n\t    func_warning \"\\`-L' is ignored for archives/objects\"\n\t    ;;\n\t  esac # linkmode\n\t  continue\n\t  ;; # -L\n\t-R*)\n\t  if test \"$pass\" = link; then\n\t    func_stripname '-R' '' \"$deplib\"\n\t    func_resolve_sysroot \"$func_stripname_result\"\n\t    dir=$func_resolve_sysroot_result\n\t    # Make sure the xrpath contains only unique directories.\n\t    case \"$xrpath \" in\n\t    *\" $dir \"*) ;;\n\t    *) func_append xrpath \" $dir\" ;;\n\t    esac\n\t  fi\n\t  deplibs=\"$deplib $deplibs\"\n\t  continue\n\t  ;;\n\t*.la)\n\t  func_resolve_sysroot \"$deplib\"\n\t  lib=$func_resolve_sysroot_result\n\t  ;;\n\t*.$libext)\n\t  if test \"$pass\" = conv; then\n\t    deplibs=\"$deplib $deplibs\"\n\t    continue\n\t  fi\n\t  case $linkmode in\n\t  lib)\n\t    # Linking convenience modules into shared libraries is allowed,\n\t    # but linking other static libraries is non-portable.\n\t    case \" $dlpreconveniencelibs \" in\n\t    *\" $deplib \"*) ;;\n\t    *)\n\t      valid_a_lib=no\n\t      case $deplibs_check_method in\n\t\tmatch_pattern*)\n\t\t  set dummy $deplibs_check_method; shift\n\t\t  match_pattern_regex=`expr \"$deplibs_check_method\" : \"$1 \\(.*\\)\"`\n\t\t  if eval \"\\$ECHO \\\"$deplib\\\"\" 2>/dev/null | $SED 10q \\\n\t\t    | $EGREP \"$match_pattern_regex\" > /dev/null; then\n\t\t    valid_a_lib=yes\n\t\t  fi\n\t\t;;\n\t\tpass_all)\n\t\t  valid_a_lib=yes\n\t\t;;\n\t      esac\n\t      if test \"$valid_a_lib\" != yes; then\n\t\techo\n\t\t$ECHO \"*** Warning: Trying to link with static lib archive $deplib.\"\n\t\techo \"*** I have the capability to make that library automatically link in when\"\n\t\techo \"*** you link to this library.  But I can only do this if you have a\"\n\t\techo \"*** shared version of the library, which you do not appear to have\"\n\t\techo \"*** because the file extensions .$libext of this argument makes me believe\"\n\t\techo \"*** that it is just a static archive that I should not use here.\"\n\t      else\n\t\techo\n\t\t$ECHO \"*** Warning: Linking the shared library $output against the\"\n\t\t$ECHO \"*** static library $deplib is not portable!\"\n\t\tdeplibs=\"$deplib $deplibs\"\n\t      fi\n\t      ;;\n\t    esac\n\t    continue\n\t    ;;\n\t  prog)\n\t    if test \"$pass\" != link; then\n\t      deplibs=\"$deplib $deplibs\"\n\t    else\n\t      compile_deplibs=\"$deplib $compile_deplibs\"\n\t      finalize_deplibs=\"$deplib $finalize_deplibs\"\n\t    fi\n\t    continue\n\t    ;;\n\t  esac # linkmode\n\t  ;; # *.$libext\n\t*.lo | *.$objext)\n\t  if test \"$pass\" = conv; then\n\t    deplibs=\"$deplib $deplibs\"\n\t  elif test \"$linkmode\" = prog; then\n\t    if test \"$pass\" = dlpreopen || test \"$dlopen_support\" != yes || test \"$build_libtool_libs\" = no; then\n\t      # If there is no dlopen support or we're linking statically,\n\t      # we need to preload.\n\t      func_append newdlprefiles \" $deplib\"\n\t      compile_deplibs=\"$deplib $compile_deplibs\"\n\t      finalize_deplibs=\"$deplib $finalize_deplibs\"\n\t    else\n\t      func_append newdlfiles \" $deplib\"\n\t    fi\n\t  fi\n\t  continue\n\t  ;;\n\t%DEPLIBS%)\n\t  alldeplibs=yes\n\t  continue\n\t  ;;\n\tesac # case $deplib\n\n\tif test \"$found\" = yes || test -f \"$lib\"; then :\n\telse\n\t  func_fatal_error \"cannot find the library \\`$lib' or unhandled argument \\`$deplib'\"\n\tfi\n\n\t# Check to see that this really is a libtool archive.\n\tfunc_lalib_unsafe_p \"$lib\" \\\n\t  || func_fatal_error \"\\`$lib' is not a valid libtool archive\"\n\n\tfunc_dirname \"$lib\" \"\" \".\"\n\tladir=\"$func_dirname_result\"\n\n\tdlname=\n\tdlopen=\n\tdlpreopen=\n\tlibdir=\n\tlibrary_names=\n\told_library=\n\tinherited_linker_flags=\n\t# If the library was installed with an old release of libtool,\n\t# it will not redefine variables installed, or shouldnotlink\n\tinstalled=yes\n\tshouldnotlink=no\n\tavoidtemprpath=\n\n\n\t# Read the .la file\n\tfunc_source \"$lib\"\n\n\t# Convert \"-framework foo\" to \"foo.ltframework\"\n\tif test -n \"$inherited_linker_flags\"; then\n\t  tmp_inherited_linker_flags=`$ECHO \"$inherited_linker_flags\" | $SED 's/-framework \\([^ $]*\\)/\\1.ltframework/g'`\n\t  for tmp_inherited_linker_flag in $tmp_inherited_linker_flags; do\n\t    case \" $new_inherited_linker_flags \" in\n\t      *\" $tmp_inherited_linker_flag \"*) ;;\n\t      *) func_append new_inherited_linker_flags \" $tmp_inherited_linker_flag\";;\n\t    esac\n\t  done\n\tfi\n\tdependency_libs=`$ECHO \" $dependency_libs\" | $SED 's% \\([^ $]*\\).ltframework% -framework \\1%g'`\n\tif test \"$linkmode,$pass\" = \"lib,link\" ||\n\t   test \"$linkmode,$pass\" = \"prog,scan\" ||\n\t   { test \"$linkmode\" != prog && test \"$linkmode\" != lib; }; then\n\t  test -n \"$dlopen\" && func_append dlfiles \" $dlopen\"\n\t  test -n \"$dlpreopen\" && func_append dlprefiles \" $dlpreopen\"\n\tfi\n\n\tif test \"$pass\" = conv; then\n\t  # Only check for convenience libraries\n\t  deplibs=\"$lib $deplibs\"\n\t  if test -z \"$libdir\"; then\n\t    if test -z \"$old_library\"; then\n\t      func_fatal_error \"cannot find name of link library for \\`$lib'\"\n\t    fi\n\t    # It is a libtool convenience library, so add in its objects.\n\t    func_append convenience \" $ladir/$objdir/$old_library\"\n\t    func_append old_convenience \" $ladir/$objdir/$old_library\"\n\t    tmp_libs=\n\t    for deplib in $dependency_libs; do\n\t      deplibs=\"$deplib $deplibs\"\n\t      if $opt_preserve_dup_deps ; then\n\t\tcase \"$tmp_libs \" in\n\t\t*\" $deplib \"*) func_append specialdeplibs \" $deplib\" ;;\n\t\tesac\n\t      fi\n\t      func_append tmp_libs \" $deplib\"\n\t    done\n\t  elif test \"$linkmode\" != prog && test \"$linkmode\" != lib; then\n\t    func_fatal_error \"\\`$lib' is not a convenience library\"\n\t  fi\n\t  continue\n\tfi # $pass = conv\n\n\n\t# Get the name of the library we link against.\n\tlinklib=\n\tif test -n \"$old_library\" &&\n\t   { test \"$prefer_static_libs\" = yes ||\n\t     test \"$prefer_static_libs,$installed\" = \"built,no\"; }; then\n\t  linklib=$old_library\n\telse\n\t  for l in $old_library $library_names; do\n\t    linklib=\"$l\"\n\t  done\n\tfi\n\tif test -z \"$linklib\"; then\n\t  func_fatal_error \"cannot find name of link library for \\`$lib'\"\n\tfi\n\n\t# This library was specified with -dlopen.\n\tif test \"$pass\" = dlopen; then\n\t  if test -z \"$libdir\"; then\n\t    func_fatal_error \"cannot -dlopen a convenience library: \\`$lib'\"\n\t  fi\n\t  if test -z \"$dlname\" ||\n\t     test \"$dlopen_support\" != yes ||\n\t     test \"$build_libtool_libs\" = no; then\n\t    # If there is no dlname, no dlopen support or we're linking\n\t    # statically, we need to preload.  We also need to preload any\n\t    # dependent libraries so libltdl's deplib preloader doesn't\n\t    # bomb out in the load deplibs phase.\n\t    func_append dlprefiles \" $lib $dependency_libs\"\n\t  else\n\t    func_append newdlfiles \" $lib\"\n\t  fi\n\t  continue\n\tfi # $pass = dlopen\n\n\t# We need an absolute path.\n\tcase $ladir in\n\t[\\\\/]* | [A-Za-z]:[\\\\/]*) abs_ladir=\"$ladir\" ;;\n\t*)\n\t  abs_ladir=`cd \"$ladir\" && pwd`\n\t  if test -z \"$abs_ladir\"; then\n\t    func_warning \"cannot determine absolute directory name of \\`$ladir'\"\n\t    func_warning \"passing it literally to the linker, although it might fail\"\n\t    abs_ladir=\"$ladir\"\n\t  fi\n\t  ;;\n\tesac\n\tfunc_basename \"$lib\"\n\tlaname=\"$func_basename_result\"\n\n\t# Find the relevant object directory and library name.\n\tif test \"X$installed\" = Xyes; then\n\t  if test ! -f \"$lt_sysroot$libdir/$linklib\" && test -f \"$abs_ladir/$linklib\"; then\n\t    func_warning \"library \\`$lib' was moved.\"\n\t    dir=\"$ladir\"\n\t    absdir=\"$abs_ladir\"\n\t    libdir=\"$abs_ladir\"\n\t  else\n\t    dir=\"$lt_sysroot$libdir\"\n\t    absdir=\"$lt_sysroot$libdir\"\n\t  fi\n\t  test \"X$hardcode_automatic\" = Xyes && avoidtemprpath=yes\n\telse\n\t  if test ! -f \"$ladir/$objdir/$linklib\" && test -f \"$abs_ladir/$linklib\"; then\n\t    dir=\"$ladir\"\n\t    absdir=\"$abs_ladir\"\n\t    # Remove this search path later\n\t    func_append notinst_path \" $abs_ladir\"\n\t  else\n\t    dir=\"$ladir/$objdir\"\n\t    absdir=\"$abs_ladir/$objdir\"\n\t    # Remove this search path later\n\t    func_append notinst_path \" $abs_ladir\"\n\t  fi\n\tfi # $installed = yes\n\tfunc_stripname 'lib' '.la' \"$laname\"\n\tname=$func_stripname_result\n\n\t# This library was specified with -dlpreopen.\n\tif test \"$pass\" = dlpreopen; then\n\t  if test -z \"$libdir\" && test \"$linkmode\" = prog; then\n\t    func_fatal_error \"only libraries may -dlpreopen a convenience library: \\`$lib'\"\n\t  fi\n\t  case \"$host\" in\n\t    # special handling for platforms with PE-DLLs.\n\t    *cygwin* | *mingw* | *cegcc* )\n\t      # Linker will automatically link against shared library if both\n\t      # static and shared are present.  Therefore, ensure we extract\n\t      # symbols from the import library if a shared library is present\n\t      # (otherwise, the dlopen module name will be incorrect).  We do\n\t      # this by putting the import library name into $newdlprefiles.\n\t      # We recover the dlopen module name by 'saving' the la file\n\t      # name in a special purpose variable, and (later) extracting the\n\t      # dlname from the la file.\n\t      if test -n \"$dlname\"; then\n\t        func_tr_sh \"$dir/$linklib\"\n\t        eval \"libfile_$func_tr_sh_result=\\$abs_ladir/\\$laname\"\n\t        func_append newdlprefiles \" $dir/$linklib\"\n\t      else\n\t        func_append newdlprefiles \" $dir/$old_library\"\n\t        # Keep a list of preopened convenience libraries to check\n\t        # that they are being used correctly in the link pass.\n\t        test -z \"$libdir\" && \\\n\t          func_append dlpreconveniencelibs \" $dir/$old_library\"\n\t      fi\n\t    ;;\n\t    * )\n\t      # Prefer using a static library (so that no silly _DYNAMIC symbols\n\t      # are required to link).\n\t      if test -n \"$old_library\"; then\n\t        func_append newdlprefiles \" $dir/$old_library\"\n\t        # Keep a list of preopened convenience libraries to check\n\t        # that they are being used correctly in the link pass.\n\t        test -z \"$libdir\" && \\\n\t          func_append dlpreconveniencelibs \" $dir/$old_library\"\n\t      # Otherwise, use the dlname, so that lt_dlopen finds it.\n\t      elif test -n \"$dlname\"; then\n\t        func_append newdlprefiles \" $dir/$dlname\"\n\t      else\n\t        func_append newdlprefiles \" $dir/$linklib\"\n\t      fi\n\t    ;;\n\t  esac\n\tfi # $pass = dlpreopen\n\n\tif test -z \"$libdir\"; then\n\t  # Link the convenience library\n\t  if test \"$linkmode\" = lib; then\n\t    deplibs=\"$dir/$old_library $deplibs\"\n\t  elif test \"$linkmode,$pass\" = \"prog,link\"; then\n\t    compile_deplibs=\"$dir/$old_library $compile_deplibs\"\n\t    finalize_deplibs=\"$dir/$old_library $finalize_deplibs\"\n\t  else\n\t    deplibs=\"$lib $deplibs\" # used for prog,scan pass\n\t  fi\n\t  continue\n\tfi\n\n\n\tif test \"$linkmode\" = prog && test \"$pass\" != link; then\n\t  func_append newlib_search_path \" $ladir\"\n\t  deplibs=\"$lib $deplibs\"\n\n\t  linkalldeplibs=no\n\t  if test \"$link_all_deplibs\" != no || test -z \"$library_names\" ||\n\t     test \"$build_libtool_libs\" = no; then\n\t    linkalldeplibs=yes\n\t  fi\n\n\t  tmp_libs=\n\t  for deplib in $dependency_libs; do\n\t    case $deplib in\n\t    -L*) func_stripname '-L' '' \"$deplib\"\n\t         func_resolve_sysroot \"$func_stripname_result\"\n\t         func_append newlib_search_path \" $func_resolve_sysroot_result\"\n\t\t ;;\n\t    esac\n\t    # Need to link against all dependency_libs?\n\t    if test \"$linkalldeplibs\" = yes; then\n\t      deplibs=\"$deplib $deplibs\"\n\t    else\n\t      # Need to hardcode shared library paths\n\t      # or/and link against static libraries\n\t      newdependency_libs=\"$deplib $newdependency_libs\"\n\t    fi\n\t    if $opt_preserve_dup_deps ; then\n\t      case \"$tmp_libs \" in\n\t      *\" $deplib \"*) func_append specialdeplibs \" $deplib\" ;;\n\t      esac\n\t    fi\n\t    func_append tmp_libs \" $deplib\"\n\t  done # for deplib\n\t  continue\n\tfi # $linkmode = prog...\n\n\tif test \"$linkmode,$pass\" = \"prog,link\"; then\n\t  if test -n \"$library_names\" &&\n\t     { { test \"$prefer_static_libs\" = no ||\n\t         test \"$prefer_static_libs,$installed\" = \"built,yes\"; } ||\n\t       test -z \"$old_library\"; }; then\n\t    # We need to hardcode the library path\n\t    if test -n \"$shlibpath_var\" && test -z \"$avoidtemprpath\" ; then\n\t      # Make sure the rpath contains only unique directories.\n\t      case \"$temp_rpath:\" in\n\t      *\"$absdir:\"*) ;;\n\t      *) func_append temp_rpath \"$absdir:\" ;;\n\t      esac\n\t    fi\n\n\t    # Hardcode the library path.\n\t    # Skip directories that are in the system default run-time\n\t    # search path.\n\t    case \" $sys_lib_dlsearch_path \" in\n\t    *\" $absdir \"*) ;;\n\t    *)\n\t      case \"$compile_rpath \" in\n\t      *\" $absdir \"*) ;;\n\t      *) func_append compile_rpath \" $absdir\" ;;\n\t      esac\n\t      ;;\n\t    esac\n\t    case \" $sys_lib_dlsearch_path \" in\n\t    *\" $libdir \"*) ;;\n\t    *)\n\t      case \"$finalize_rpath \" in\n\t      *\" $libdir \"*) ;;\n\t      *) func_append finalize_rpath \" $libdir\" ;;\n\t      esac\n\t      ;;\n\t    esac\n\t  fi # $linkmode,$pass = prog,link...\n\n\t  if test \"$alldeplibs\" = yes &&\n\t     { test \"$deplibs_check_method\" = pass_all ||\n\t       { test \"$build_libtool_libs\" = yes &&\n\t\t test -n \"$library_names\"; }; }; then\n\t    # We only need to search for static libraries\n\t    continue\n\t  fi\n\tfi\n\n\tlink_static=no # Whether the deplib will be linked statically\n\tuse_static_libs=$prefer_static_libs\n\tif test \"$use_static_libs\" = built && test \"$installed\" = yes; then\n\t  use_static_libs=no\n\tfi\n\tif test -n \"$library_names\" &&\n\t   { test \"$use_static_libs\" = no || test -z \"$old_library\"; }; then\n\t  case $host in\n\t  *cygwin* | *mingw* | *cegcc*)\n\t      # No point in relinking DLLs because paths are not encoded\n\t      func_append notinst_deplibs \" $lib\"\n\t      need_relink=no\n\t    ;;\n\t  *)\n\t    if test \"$installed\" = no; then\n\t      func_append notinst_deplibs \" $lib\"\n\t      need_relink=yes\n\t    fi\n\t    ;;\n\t  esac\n\t  # This is a shared library\n\n\t  # Warn about portability, can't link against -module's on some\n\t  # systems (darwin).  Don't bleat about dlopened modules though!\n\t  dlopenmodule=\"\"\n\t  for dlpremoduletest in $dlprefiles; do\n\t    if test \"X$dlpremoduletest\" = \"X$lib\"; then\n\t      dlopenmodule=\"$dlpremoduletest\"\n\t      break\n\t    fi\n\t  done\n\t  if test -z \"$dlopenmodule\" && test \"$shouldnotlink\" = yes && test \"$pass\" = link; then\n\t    echo\n\t    if test \"$linkmode\" = prog; then\n\t      $ECHO \"*** Warning: Linking the executable $output against the loadable module\"\n\t    else\n\t      $ECHO \"*** Warning: Linking the shared library $output against the loadable module\"\n\t    fi\n\t    $ECHO \"*** $linklib is not portable!\"\n\t  fi\n\t  if test \"$linkmode\" = lib &&\n\t     test \"$hardcode_into_libs\" = yes; then\n\t    # Hardcode the library path.\n\t    # Skip directories that are in the system default run-time\n\t    # search path.\n\t    case \" $sys_lib_dlsearch_path \" in\n\t    *\" $absdir \"*) ;;\n\t    *)\n\t      case \"$compile_rpath \" in\n\t      *\" $absdir \"*) ;;\n\t      *) func_append compile_rpath \" $absdir\" ;;\n\t      esac\n\t      ;;\n\t    esac\n\t    case \" $sys_lib_dlsearch_path \" in\n\t    *\" $libdir \"*) ;;\n\t    *)\n\t      case \"$finalize_rpath \" in\n\t      *\" $libdir \"*) ;;\n\t      *) func_append finalize_rpath \" $libdir\" ;;\n\t      esac\n\t      ;;\n\t    esac\n\t  fi\n\n\t  if test -n \"$old_archive_from_expsyms_cmds\"; then\n\t    # figure out the soname\n\t    set dummy $library_names\n\t    shift\n\t    realname=\"$1\"\n\t    shift\n\t    libname=`eval \"\\\\$ECHO \\\"$libname_spec\\\"\"`\n\t    # use dlname if we got it. it's perfectly good, no?\n\t    if test -n \"$dlname\"; then\n\t      soname=\"$dlname\"\n\t    elif test -n \"$soname_spec\"; then\n\t      # bleh windows\n\t      case $host in\n\t      *cygwin* | mingw* | *cegcc*)\n\t        func_arith $current - $age\n\t\tmajor=$func_arith_result\n\t\tversuffix=\"-$major\"\n\t\t;;\n\t      esac\n\t      eval soname=\\\"$soname_spec\\\"\n\t    else\n\t      soname=\"$realname\"\n\t    fi\n\n\t    # Make a new name for the extract_expsyms_cmds to use\n\t    soroot=\"$soname\"\n\t    func_basename \"$soroot\"\n\t    soname=\"$func_basename_result\"\n\t    func_stripname 'lib' '.dll' \"$soname\"\n\t    newlib=libimp-$func_stripname_result.a\n\n\t    # If the library has no export list, then create one now\n\t    if test -f \"$output_objdir/$soname-def\"; then :\n\t    else\n\t      func_verbose \"extracting exported symbol list from \\`$soname'\"\n\t      func_execute_cmds \"$extract_expsyms_cmds\" 'exit $?'\n\t    fi\n\n\t    # Create $newlib\n\t    if test -f \"$output_objdir/$newlib\"; then :; else\n\t      func_verbose \"generating import library for \\`$soname'\"\n\t      func_execute_cmds \"$old_archive_from_expsyms_cmds\" 'exit $?'\n\t    fi\n\t    # make sure the library variables are pointing to the new library\n\t    dir=$output_objdir\n\t    linklib=$newlib\n\t  fi # test -n \"$old_archive_from_expsyms_cmds\"\n\n\t  if test \"$linkmode\" = prog || test \"$opt_mode\" != relink; then\n\t    add_shlibpath=\n\t    add_dir=\n\t    add=\n\t    lib_linked=yes\n\t    case $hardcode_action in\n\t    immediate | unsupported)\n\t      if test \"$hardcode_direct\" = no; then\n\t\tadd=\"$dir/$linklib\"\n\t\tcase $host in\n\t\t  *-*-sco3.2v5.0.[024]*) add_dir=\"-L$dir\" ;;\n\t\t  *-*-sysv4*uw2*) add_dir=\"-L$dir\" ;;\n\t\t  *-*-sysv5OpenUNIX* | *-*-sysv5UnixWare7.[01].[10]* | \\\n\t\t    *-*-unixware7*) add_dir=\"-L$dir\" ;;\n\t\t  *-*-darwin* )\n\t\t    # if the lib is a (non-dlopened) module then we can not\n\t\t    # link against it, someone is ignoring the earlier warnings\n\t\t    if /usr/bin/file -L $add 2> /dev/null |\n\t\t\t $GREP \": [^:]* bundle\" >/dev/null ; then\n\t\t      if test \"X$dlopenmodule\" != \"X$lib\"; then\n\t\t\t$ECHO \"*** Warning: lib $linklib is a module, not a shared library\"\n\t\t\tif test -z \"$old_library\" ; then\n\t\t\t  echo\n\t\t\t  echo \"*** And there doesn't seem to be a static archive available\"\n\t\t\t  echo \"*** The link will probably fail, sorry\"\n\t\t\telse\n\t\t\t  add=\"$dir/$old_library\"\n\t\t\tfi\n\t\t      elif test -n \"$old_library\"; then\n\t\t\tadd=\"$dir/$old_library\"\n\t\t      fi\n\t\t    fi\n\t\tesac\n\t      elif test \"$hardcode_minus_L\" = no; then\n\t\tcase $host in\n\t\t*-*-sunos*) add_shlibpath=\"$dir\" ;;\n\t\tesac\n\t\tadd_dir=\"-L$dir\"\n\t\tadd=\"-l$name\"\n\t      elif test \"$hardcode_shlibpath_var\" = no; then\n\t\tadd_shlibpath=\"$dir\"\n\t\tadd=\"-l$name\"\n\t      else\n\t\tlib_linked=no\n\t      fi\n\t      ;;\n\t    relink)\n\t      if test \"$hardcode_direct\" = yes &&\n\t         test \"$hardcode_direct_absolute\" = no; then\n\t\tadd=\"$dir/$linklib\"\n\t      elif test \"$hardcode_minus_L\" = yes; then\n\t\tadd_dir=\"-L$absdir\"\n\t\t# Try looking first in the location we're being installed to.\n\t\tif test -n \"$inst_prefix_dir\"; then\n\t\t  case $libdir in\n\t\t    [\\\\/]*)\n\t\t      func_append add_dir \" -L$inst_prefix_dir$libdir\"\n\t\t      ;;\n\t\t  esac\n\t\tfi\n\t\tadd=\"-l$name\"\n\t      elif test \"$hardcode_shlibpath_var\" = yes; then\n\t\tadd_shlibpath=\"$dir\"\n\t\tadd=\"-l$name\"\n\t      else\n\t\tlib_linked=no\n\t      fi\n\t      ;;\n\t    *) lib_linked=no ;;\n\t    esac\n\n\t    if test \"$lib_linked\" != yes; then\n\t      func_fatal_configuration \"unsupported hardcode properties\"\n\t    fi\n\n\t    if test -n \"$add_shlibpath\"; then\n\t      case :$compile_shlibpath: in\n\t      *\":$add_shlibpath:\"*) ;;\n\t      *) func_append compile_shlibpath \"$add_shlibpath:\" ;;\n\t      esac\n\t    fi\n\t    if test \"$linkmode\" = prog; then\n\t      test -n \"$add_dir\" && compile_deplibs=\"$add_dir $compile_deplibs\"\n\t      test -n \"$add\" && compile_deplibs=\"$add $compile_deplibs\"\n\t    else\n\t      test -n \"$add_dir\" && deplibs=\"$add_dir $deplibs\"\n\t      test -n \"$add\" && deplibs=\"$add $deplibs\"\n\t      if test \"$hardcode_direct\" != yes &&\n\t\t test \"$hardcode_minus_L\" != yes &&\n\t\t test \"$hardcode_shlibpath_var\" = yes; then\n\t\tcase :$finalize_shlibpath: in\n\t\t*\":$libdir:\"*) ;;\n\t\t*) func_append finalize_shlibpath \"$libdir:\" ;;\n\t\tesac\n\t      fi\n\t    fi\n\t  fi\n\n\t  if test \"$linkmode\" = prog || test \"$opt_mode\" = relink; then\n\t    add_shlibpath=\n\t    add_dir=\n\t    add=\n\t    # Finalize command for both is simple: just hardcode it.\n\t    if test \"$hardcode_direct\" = yes &&\n\t       test \"$hardcode_direct_absolute\" = no; then\n\t      add=\"$libdir/$linklib\"\n\t    elif test \"$hardcode_minus_L\" = yes; then\n\t      add_dir=\"-L$libdir\"\n\t      add=\"-l$name\"\n\t    elif test \"$hardcode_shlibpath_var\" = yes; then\n\t      case :$finalize_shlibpath: in\n\t      *\":$libdir:\"*) ;;\n\t      *) func_append finalize_shlibpath \"$libdir:\" ;;\n\t      esac\n\t      add=\"-l$name\"\n\t    elif test \"$hardcode_automatic\" = yes; then\n\t      if test -n \"$inst_prefix_dir\" &&\n\t\t test -f \"$inst_prefix_dir$libdir/$linklib\" ; then\n\t\tadd=\"$inst_prefix_dir$libdir/$linklib\"\n\t      else\n\t\tadd=\"$libdir/$linklib\"\n\t      fi\n\t    else\n\t      # We cannot seem to hardcode it, guess we'll fake it.\n\t      add_dir=\"-L$libdir\"\n\t      # Try looking first in the location we're being installed to.\n\t      if test -n \"$inst_prefix_dir\"; then\n\t\tcase $libdir in\n\t\t  [\\\\/]*)\n\t\t    func_append add_dir \" -L$inst_prefix_dir$libdir\"\n\t\t    ;;\n\t\tesac\n\t      fi\n\t      add=\"-l$name\"\n\t    fi\n\n\t    if test \"$linkmode\" = prog; then\n\t      test -n \"$add_dir\" && finalize_deplibs=\"$add_dir $finalize_deplibs\"\n\t      test -n \"$add\" && finalize_deplibs=\"$add $finalize_deplibs\"\n\t    else\n\t      test -n \"$add_dir\" && deplibs=\"$add_dir $deplibs\"\n\t      test -n \"$add\" && deplibs=\"$add $deplibs\"\n\t    fi\n\t  fi\n\telif test \"$linkmode\" = prog; then\n\t  # Here we assume that one of hardcode_direct or hardcode_minus_L\n\t  # is not unsupported.  This is valid on all known static and\n\t  # shared platforms.\n\t  if test \"$hardcode_direct\" != unsupported; then\n\t    test -n \"$old_library\" && linklib=\"$old_library\"\n\t    compile_deplibs=\"$dir/$linklib $compile_deplibs\"\n\t    finalize_deplibs=\"$dir/$linklib $finalize_deplibs\"\n\t  else\n\t    compile_deplibs=\"-l$name -L$dir $compile_deplibs\"\n\t    finalize_deplibs=\"-l$name -L$dir $finalize_deplibs\"\n\t  fi\n\telif test \"$build_libtool_libs\" = yes; then\n\t  # Not a shared library\n\t  if test \"$deplibs_check_method\" != pass_all; then\n\t    # We're trying link a shared library against a static one\n\t    # but the system doesn't support it.\n\n\t    # Just print a warning and add the library to dependency_libs so\n\t    # that the program can be linked against the static library.\n\t    echo\n\t    $ECHO \"*** Warning: This system can not link to static lib archive $lib.\"\n\t    echo \"*** I have the capability to make that library automatically link in when\"\n\t    echo \"*** you link to this library.  But I can only do this if you have a\"\n\t    echo \"*** shared version of the library, which you do not appear to have.\"\n\t    if test \"$module\" = yes; then\n\t      echo \"*** But as you try to build a module library, libtool will still create \"\n\t      echo \"*** a static module, that should work as long as the dlopening application\"\n\t      echo \"*** is linked with the -dlopen flag to resolve symbols at runtime.\"\n\t      if test -z \"$global_symbol_pipe\"; then\n\t\techo\n\t\techo \"*** However, this would only work if libtool was able to extract symbol\"\n\t\techo \"*** lists from a program, using \\`nm' or equivalent, but libtool could\"\n\t\techo \"*** not find such a program.  So, this module is probably useless.\"\n\t\techo \"*** \\`nm' from GNU binutils and a full rebuild may help.\"\n\t      fi\n\t      if test \"$build_old_libs\" = no; then\n\t\tbuild_libtool_libs=module\n\t\tbuild_old_libs=yes\n\t      else\n\t\tbuild_libtool_libs=no\n\t      fi\n\t    fi\n\t  else\n\t    deplibs=\"$dir/$old_library $deplibs\"\n\t    link_static=yes\n\t  fi\n\tfi # link shared/static library?\n\n\tif test \"$linkmode\" = lib; then\n\t  if test -n \"$dependency_libs\" &&\n\t     { test \"$hardcode_into_libs\" != yes ||\n\t       test \"$build_old_libs\" = yes ||\n\t       test \"$link_static\" = yes; }; then\n\t    # Extract -R from dependency_libs\n\t    temp_deplibs=\n\t    for libdir in $dependency_libs; do\n\t      case $libdir in\n\t      -R*) func_stripname '-R' '' \"$libdir\"\n\t           temp_xrpath=$func_stripname_result\n\t\t   case \" $xrpath \" in\n\t\t   *\" $temp_xrpath \"*) ;;\n\t\t   *) func_append xrpath \" $temp_xrpath\";;\n\t\t   esac;;\n\t      *) func_append temp_deplibs \" $libdir\";;\n\t      esac\n\t    done\n\t    dependency_libs=\"$temp_deplibs\"\n\t  fi\n\n\t  func_append newlib_search_path \" $absdir\"\n\t  # Link against this library\n\t  test \"$link_static\" = no && newdependency_libs=\"$abs_ladir/$laname $newdependency_libs\"\n\t  # ... and its dependency_libs\n\t  tmp_libs=\n\t  for deplib in $dependency_libs; do\n\t    newdependency_libs=\"$deplib $newdependency_libs\"\n\t    case $deplib in\n              -L*) func_stripname '-L' '' \"$deplib\"\n                   func_resolve_sysroot \"$func_stripname_result\";;\n              *) func_resolve_sysroot \"$deplib\" ;;\n            esac\n\t    if $opt_preserve_dup_deps ; then\n\t      case \"$tmp_libs \" in\n\t      *\" $func_resolve_sysroot_result \"*)\n                func_append specialdeplibs \" $func_resolve_sysroot_result\" ;;\n\t      esac\n\t    fi\n\t    func_append tmp_libs \" $func_resolve_sysroot_result\"\n\t  done\n\n\t  if test \"$link_all_deplibs\" != no; then\n\t    # Add the search paths of all dependency libraries\n\t    for deplib in $dependency_libs; do\n\t      path=\n\t      case $deplib in\n\t      -L*) path=\"$deplib\" ;;\n\t      *.la)\n\t        func_resolve_sysroot \"$deplib\"\n\t        deplib=$func_resolve_sysroot_result\n\t        func_dirname \"$deplib\" \"\" \".\"\n\t\tdir=$func_dirname_result\n\t\t# We need an absolute path.\n\t\tcase $dir in\n\t\t[\\\\/]* | [A-Za-z]:[\\\\/]*) absdir=\"$dir\" ;;\n\t\t*)\n\t\t  absdir=`cd \"$dir\" && pwd`\n\t\t  if test -z \"$absdir\"; then\n\t\t    func_warning \"cannot determine absolute directory name of \\`$dir'\"\n\t\t    absdir=\"$dir\"\n\t\t  fi\n\t\t  ;;\n\t\tesac\n\t\tif $GREP \"^installed=no\" $deplib > /dev/null; then\n\t\tcase $host in\n\t\t*-*-darwin*)\n\t\t  depdepl=\n\t\t  eval deplibrary_names=`${SED} -n -e 's/^library_names=\\(.*\\)$/\\1/p' $deplib`\n\t\t  if test -n \"$deplibrary_names\" ; then\n\t\t    for tmp in $deplibrary_names ; do\n\t\t      depdepl=$tmp\n\t\t    done\n\t\t    if test -f \"$absdir/$objdir/$depdepl\" ; then\n\t\t      depdepl=\"$absdir/$objdir/$depdepl\"\n\t\t      darwin_install_name=`${OTOOL} -L $depdepl | awk '{if (NR == 2) {print $1;exit}}'`\n                      if test -z \"$darwin_install_name\"; then\n                          darwin_install_name=`${OTOOL64} -L $depdepl  | awk '{if (NR == 2) {print $1;exit}}'`\n                      fi\n\t\t      func_append compiler_flags \" ${wl}-dylib_file ${wl}${darwin_install_name}:${depdepl}\"\n\t\t      func_append linker_flags \" -dylib_file ${darwin_install_name}:${depdepl}\"\n\t\t      path=\n\t\t    fi\n\t\t  fi\n\t\t  ;;\n\t\t*)\n\t\t  path=\"-L$absdir/$objdir\"\n\t\t  ;;\n\t\tesac\n\t\telse\n\t\t  eval libdir=`${SED} -n -e 's/^libdir=\\(.*\\)$/\\1/p' $deplib`\n\t\t  test -z \"$libdir\" && \\\n\t\t    func_fatal_error \"\\`$deplib' is not a valid libtool archive\"\n\t\t  test \"$absdir\" != \"$libdir\" && \\\n\t\t    func_warning \"\\`$deplib' seems to be moved\"\n\n\t\t  path=\"-L$absdir\"\n\t\tfi\n\t\t;;\n\t      esac\n\t      case \" $deplibs \" in\n\t      *\" $path \"*) ;;\n\t      *) deplibs=\"$path $deplibs\" ;;\n\t      esac\n\t    done\n\t  fi # link_all_deplibs != no\n\tfi # linkmode = lib\n      done # for deplib in $libs\n      if test \"$pass\" = link; then\n\tif test \"$linkmode\" = \"prog\"; then\n\t  compile_deplibs=\"$new_inherited_linker_flags $compile_deplibs\"\n\t  finalize_deplibs=\"$new_inherited_linker_flags $finalize_deplibs\"\n\telse\n\t  compiler_flags=\"$compiler_flags \"`$ECHO \" $new_inherited_linker_flags\" | $SED 's% \\([^ $]*\\).ltframework% -framework \\1%g'`\n\tfi\n      fi\n      dependency_libs=\"$newdependency_libs\"\n      if test \"$pass\" = dlpreopen; then\n\t# Link the dlpreopened libraries before other libraries\n\tfor deplib in $save_deplibs; do\n\t  deplibs=\"$deplib $deplibs\"\n\tdone\n      fi\n      if test \"$pass\" != dlopen; then\n\tif test \"$pass\" != conv; then\n\t  # Make sure lib_search_path contains only unique directories.\n\t  lib_search_path=\n\t  for dir in $newlib_search_path; do\n\t    case \"$lib_search_path \" in\n\t    *\" $dir \"*) ;;\n\t    *) func_append lib_search_path \" $dir\" ;;\n\t    esac\n\t  done\n\t  newlib_search_path=\n\tfi\n\n\tif test \"$linkmode,$pass\" != \"prog,link\"; then\n\t  vars=\"deplibs\"\n\telse\n\t  vars=\"compile_deplibs finalize_deplibs\"\n\tfi\n\tfor var in $vars dependency_libs; do\n\t  # Add libraries to $var in reverse order\n\t  eval tmp_libs=\\\"\\$$var\\\"\n\t  new_libs=\n\t  for deplib in $tmp_libs; do\n\t    # FIXME: Pedantically, this is the right thing to do, so\n\t    #        that some nasty dependency loop isn't accidentally\n\t    #        broken:\n\t    #new_libs=\"$deplib $new_libs\"\n\t    # Pragmatically, this seems to cause very few problems in\n\t    # practice:\n\t    case $deplib in\n\t    -L*) new_libs=\"$deplib $new_libs\" ;;\n\t    -R*) ;;\n\t    *)\n\t      # And here is the reason: when a library appears more\n\t      # than once as an explicit dependence of a library, or\n\t      # is implicitly linked in more than once by the\n\t      # compiler, it is considered special, and multiple\n\t      # occurrences thereof are not removed.  Compare this\n\t      # with having the same library being listed as a\n\t      # dependency of multiple other libraries: in this case,\n\t      # we know (pedantically, we assume) the library does not\n\t      # need to be listed more than once, so we keep only the\n\t      # last copy.  This is not always right, but it is rare\n\t      # enough that we require users that really mean to play\n\t      # such unportable linking tricks to link the library\n\t      # using -Wl,-lname, so that libtool does not consider it\n\t      # for duplicate removal.\n\t      case \" $specialdeplibs \" in\n\t      *\" $deplib \"*) new_libs=\"$deplib $new_libs\" ;;\n\t      *)\n\t\tcase \" $new_libs \" in\n\t\t*\" $deplib \"*) ;;\n\t\t*) new_libs=\"$deplib $new_libs\" ;;\n\t\tesac\n\t\t;;\n\t      esac\n\t      ;;\n\t    esac\n\t  done\n\t  tmp_libs=\n\t  for deplib in $new_libs; do\n\t    case $deplib in\n\t    -L*)\n\t      case \" $tmp_libs \" in\n\t      *\" $deplib \"*) ;;\n\t      *) func_append tmp_libs \" $deplib\" ;;\n\t      esac\n\t      ;;\n\t    *) func_append tmp_libs \" $deplib\" ;;\n\t    esac\n\t  done\n\t  eval $var=\\\"$tmp_libs\\\"\n\tdone # for var\n      fi\n      # Last step: remove runtime libs from dependency_libs\n      # (they stay in deplibs)\n      tmp_libs=\n      for i in $dependency_libs ; do\n\tcase \" $predeps $postdeps $compiler_lib_search_path \" in\n\t*\" $i \"*)\n\t  i=\"\"\n\t  ;;\n\tesac\n\tif test -n \"$i\" ; then\n\t  func_append tmp_libs \" $i\"\n\tfi\n      done\n      dependency_libs=$tmp_libs\n    done # for pass\n    if test \"$linkmode\" = prog; then\n      dlfiles=\"$newdlfiles\"\n    fi\n    if test \"$linkmode\" = prog || test \"$linkmode\" = lib; then\n      dlprefiles=\"$newdlprefiles\"\n    fi\n\n    case $linkmode in\n    oldlib)\n      if test -n \"$dlfiles$dlprefiles\" || test \"$dlself\" != no; then\n\tfunc_warning \"\\`-dlopen' is ignored for archives\"\n      fi\n\n      case \" $deplibs\" in\n      *\\ -l* | *\\ -L*)\n\tfunc_warning \"\\`-l' and \\`-L' are ignored for archives\" ;;\n      esac\n\n      test -n \"$rpath\" && \\\n\tfunc_warning \"\\`-rpath' is ignored for archives\"\n\n      test -n \"$xrpath\" && \\\n\tfunc_warning \"\\`-R' is ignored for archives\"\n\n      test -n \"$vinfo\" && \\\n\tfunc_warning \"\\`-version-info/-version-number' is ignored for archives\"\n\n      test -n \"$release\" && \\\n\tfunc_warning \"\\`-release' is ignored for archives\"\n\n      test -n \"$export_symbols$export_symbols_regex\" && \\\n\tfunc_warning \"\\`-export-symbols' is ignored for archives\"\n\n      # Now set the variables for building old libraries.\n      build_libtool_libs=no\n      oldlibs=\"$output\"\n      func_append objs \"$old_deplibs\"\n      ;;\n\n    lib)\n      # Make sure we only generate libraries of the form `libNAME.la'.\n      case $outputname in\n      lib*)\n\tfunc_stripname 'lib' '.la' \"$outputname\"\n\tname=$func_stripname_result\n\teval shared_ext=\\\"$shrext_cmds\\\"\n\teval libname=\\\"$libname_spec\\\"\n\t;;\n      *)\n\ttest \"$module\" = no && \\\n\t  func_fatal_help \"libtool library \\`$output' must begin with \\`lib'\"\n\n\tif test \"$need_lib_prefix\" != no; then\n\t  # Add the \"lib\" prefix for modules if required\n\t  func_stripname '' '.la' \"$outputname\"\n\t  name=$func_stripname_result\n\t  eval shared_ext=\\\"$shrext_cmds\\\"\n\t  eval libname=\\\"$libname_spec\\\"\n\telse\n\t  func_stripname '' '.la' \"$outputname\"\n\t  libname=$func_stripname_result\n\tfi\n\t;;\n      esac\n\n      if test -n \"$objs\"; then\n\tif test \"$deplibs_check_method\" != pass_all; then\n\t  func_fatal_error \"cannot build libtool library \\`$output' from non-libtool objects on this host:$objs\"\n\telse\n\t  echo\n\t  $ECHO \"*** Warning: Linking the shared library $output against the non-libtool\"\n\t  $ECHO \"*** objects $objs is not portable!\"\n\t  func_append libobjs \" $objs\"\n\tfi\n      fi\n\n      test \"$dlself\" != no && \\\n\tfunc_warning \"\\`-dlopen self' is ignored for libtool libraries\"\n\n      set dummy $rpath\n      shift\n      test \"$#\" -gt 1 && \\\n\tfunc_warning \"ignoring multiple \\`-rpath's for a libtool library\"\n\n      install_libdir=\"$1\"\n\n      oldlibs=\n      if test -z \"$rpath\"; then\n\tif test \"$build_libtool_libs\" = yes; then\n\t  # Building a libtool convenience library.\n\t  # Some compilers have problems with a `.al' extension so\n\t  # convenience libraries should have the same extension an\n\t  # archive normally would.\n\t  oldlibs=\"$output_objdir/$libname.$libext $oldlibs\"\n\t  build_libtool_libs=convenience\n\t  build_old_libs=yes\n\tfi\n\n\ttest -n \"$vinfo\" && \\\n\t  func_warning \"\\`-version-info/-version-number' is ignored for convenience libraries\"\n\n\ttest -n \"$release\" && \\\n\t  func_warning \"\\`-release' is ignored for convenience libraries\"\n      else\n\n\t# Parse the version information argument.\n\tsave_ifs=\"$IFS\"; IFS=':'\n\tset dummy $vinfo 0 0 0\n\tshift\n\tIFS=\"$save_ifs\"\n\n\ttest -n \"$7\" && \\\n\t  func_fatal_help \"too many parameters to \\`-version-info'\"\n\n\t# convert absolute version numbers to libtool ages\n\t# this retains compatibility with .la files and attempts\n\t# to make the code below a bit more comprehensible\n\n\tcase $vinfo_number in\n\tyes)\n\t  number_major=\"$1\"\n\t  number_minor=\"$2\"\n\t  number_revision=\"$3\"\n\t  #\n\t  # There are really only two kinds -- those that\n\t  # use the current revision as the major version\n\t  # and those that subtract age and use age as\n\t  # a minor version.  But, then there is irix\n\t  # which has an extra 1 added just for fun\n\t  #\n\t  case $version_type in\n\t  # correct linux to gnu/linux during the next big refactor\n\t  darwin|linux|osf|windows|none)\n\t    func_arith $number_major + $number_minor\n\t    current=$func_arith_result\n\t    age=\"$number_minor\"\n\t    revision=\"$number_revision\"\n\t    ;;\n\t  freebsd-aout|freebsd-elf|qnx|sunos)\n\t    current=\"$number_major\"\n\t    revision=\"$number_minor\"\n\t    age=\"0\"\n\t    ;;\n\t  irix|nonstopux)\n\t    func_arith $number_major + $number_minor\n\t    current=$func_arith_result\n\t    age=\"$number_minor\"\n\t    revision=\"$number_minor\"\n\t    lt_irix_increment=no\n\t    ;;\n\t  *)\n\t    func_fatal_configuration \"$modename: unknown library version type \\`$version_type'\"\n\t    ;;\n\t  esac\n\t  ;;\n\tno)\n\t  current=\"$1\"\n\t  revision=\"$2\"\n\t  age=\"$3\"\n\t  ;;\n\tesac\n\n\t# Check that each of the things are valid numbers.\n\tcase $current in\n\t0|[1-9]|[1-9][0-9]|[1-9][0-9][0-9]|[1-9][0-9][0-9][0-9]|[1-9][0-9][0-9][0-9][0-9]) ;;\n\t*)\n\t  func_error \"CURRENT \\`$current' must be a nonnegative integer\"\n\t  func_fatal_error \"\\`$vinfo' is not valid version information\"\n\t  ;;\n\tesac\n\n\tcase $revision in\n\t0|[1-9]|[1-9][0-9]|[1-9][0-9][0-9]|[1-9][0-9][0-9][0-9]|[1-9][0-9][0-9][0-9][0-9]) ;;\n\t*)\n\t  func_error \"REVISION \\`$revision' must be a nonnegative integer\"\n\t  func_fatal_error \"\\`$vinfo' is not valid version information\"\n\t  ;;\n\tesac\n\n\tcase $age in\n\t0|[1-9]|[1-9][0-9]|[1-9][0-9][0-9]|[1-9][0-9][0-9][0-9]|[1-9][0-9][0-9][0-9][0-9]) ;;\n\t*)\n\t  func_error \"AGE \\`$age' must be a nonnegative integer\"\n\t  func_fatal_error \"\\`$vinfo' is not valid version information\"\n\t  ;;\n\tesac\n\n\tif test \"$age\" -gt \"$current\"; then\n\t  func_error \"AGE \\`$age' is greater than the current interface number \\`$current'\"\n\t  func_fatal_error \"\\`$vinfo' is not valid version information\"\n\tfi\n\n\t# Calculate the version variables.\n\tmajor=\n\tversuffix=\n\tverstring=\n\tcase $version_type in\n\tnone) ;;\n\n\tdarwin)\n\t  # Like Linux, but with the current version available in\n\t  # verstring for coding it into the library header\n\t  func_arith $current - $age\n\t  major=.$func_arith_result\n\t  versuffix=\"$major.$age.$revision\"\n\t  # Darwin ld doesn't like 0 for these options...\n\t  func_arith $current + 1\n\t  minor_current=$func_arith_result\n\t  xlcverstring=\"${wl}-compatibility_version ${wl}$minor_current ${wl}-current_version ${wl}$minor_current.$revision\"\n\t  verstring=\"-compatibility_version $minor_current -current_version $minor_current.$revision\"\n\t  ;;\n\n\tfreebsd-aout)\n\t  major=\".$current\"\n\t  versuffix=\".$current.$revision\";\n\t  ;;\n\n\tfreebsd-elf)\n\t  major=\".$current\"\n\t  versuffix=\".$current\"\n\t  ;;\n\n\tirix | nonstopux)\n\t  if test \"X$lt_irix_increment\" = \"Xno\"; then\n\t    func_arith $current - $age\n\t  else\n\t    func_arith $current - $age + 1\n\t  fi\n\t  major=$func_arith_result\n\n\t  case $version_type in\n\t    nonstopux) verstring_prefix=nonstopux ;;\n\t    *)         verstring_prefix=sgi ;;\n\t  esac\n\t  verstring=\"$verstring_prefix$major.$revision\"\n\n\t  # Add in all the interfaces that we are compatible with.\n\t  loop=$revision\n\t  while test \"$loop\" -ne 0; do\n\t    func_arith $revision - $loop\n\t    iface=$func_arith_result\n\t    func_arith $loop - 1\n\t    loop=$func_arith_result\n\t    verstring=\"$verstring_prefix$major.$iface:$verstring\"\n\t  done\n\n\t  # Before this point, $major must not contain `.'.\n\t  major=.$major\n\t  versuffix=\"$major.$revision\"\n\t  ;;\n\n\tlinux) # correct to gnu/linux during the next big refactor\n\t  func_arith $current - $age\n\t  major=.$func_arith_result\n\t  versuffix=\"$major.$age.$revision\"\n\t  ;;\n\n\tosf)\n\t  func_arith $current - $age\n\t  major=.$func_arith_result\n\t  versuffix=\".$current.$age.$revision\"\n\t  verstring=\"$current.$age.$revision\"\n\n\t  # Add in all the interfaces that we are compatible with.\n\t  loop=$age\n\t  while test \"$loop\" -ne 0; do\n\t    func_arith $current - $loop\n\t    iface=$func_arith_result\n\t    func_arith $loop - 1\n\t    loop=$func_arith_result\n\t    verstring=\"$verstring:${iface}.0\"\n\t  done\n\n\t  # Make executables depend on our current version.\n\t  func_append verstring \":${current}.0\"\n\t  ;;\n\n\tqnx)\n\t  major=\".$current\"\n\t  versuffix=\".$current\"\n\t  ;;\n\n\tsunos)\n\t  major=\".$current\"\n\t  versuffix=\".$current.$revision\"\n\t  ;;\n\n\twindows)\n\t  # Use '-' rather than '.', since we only want one\n\t  # extension on DOS 8.3 filesystems.\n\t  func_arith $current - $age\n\t  major=$func_arith_result\n\t  versuffix=\"-$major\"\n\t  ;;\n\n\t*)\n\t  func_fatal_configuration \"unknown library version type \\`$version_type'\"\n\t  ;;\n\tesac\n\n\t# Clear the version info if we defaulted, and they specified a release.\n\tif test -z \"$vinfo\" && test -n \"$release\"; then\n\t  major=\n\t  case $version_type in\n\t  darwin)\n\t    # we can't check for \"0.0\" in archive_cmds due to quoting\n\t    # problems, so we reset it completely\n\t    verstring=\n\t    ;;\n\t  *)\n\t    verstring=\"0.0\"\n\t    ;;\n\t  esac\n\t  if test \"$need_version\" = no; then\n\t    versuffix=\n\t  else\n\t    versuffix=\".0.0\"\n\t  fi\n\tfi\n\n\t# Remove version info from name if versioning should be avoided\n\tif test \"$avoid_version\" = yes && test \"$need_version\" = no; then\n\t  major=\n\t  versuffix=\n\t  verstring=\"\"\n\tfi\n\n\t# Check to see if the archive will have undefined symbols.\n\tif test \"$allow_undefined\" = yes; then\n\t  if test \"$allow_undefined_flag\" = unsupported; then\n\t    func_warning \"undefined symbols not allowed in $host shared libraries\"\n\t    build_libtool_libs=no\n\t    build_old_libs=yes\n\t  fi\n\telse\n\t  # Don't allow undefined symbols.\n\t  allow_undefined_flag=\"$no_undefined_flag\"\n\tfi\n\n      fi\n\n      func_generate_dlsyms \"$libname\" \"$libname\" \"yes\"\n      func_append libobjs \" $symfileobj\"\n      test \"X$libobjs\" = \"X \" && libobjs=\n\n      if test \"$opt_mode\" != relink; then\n\t# Remove our outputs, but don't remove object files since they\n\t# may have been created when compiling PIC objects.\n\tremovelist=\n\ttempremovelist=`$ECHO \"$output_objdir/*\"`\n\tfor p in $tempremovelist; do\n\t  case $p in\n\t    *.$objext | *.gcno)\n\t       ;;\n\t    $output_objdir/$outputname | $output_objdir/$libname.* | $output_objdir/${libname}${release}.*)\n\t       if test \"X$precious_files_regex\" != \"X\"; then\n\t\t if $ECHO \"$p\" | $EGREP -e \"$precious_files_regex\" >/dev/null 2>&1\n\t\t then\n\t\t   continue\n\t\t fi\n\t       fi\n\t       func_append removelist \" $p\"\n\t       ;;\n\t    *) ;;\n\t  esac\n\tdone\n\ttest -n \"$removelist\" && \\\n\t  func_show_eval \"${RM}r \\$removelist\"\n      fi\n\n      # Now set the variables for building old libraries.\n      if test \"$build_old_libs\" = yes && test \"$build_libtool_libs\" != convenience ; then\n\tfunc_append oldlibs \" $output_objdir/$libname.$libext\"\n\n\t# Transform .lo files to .o files.\n\toldobjs=\"$objs \"`$ECHO \"$libobjs\" | $SP2NL | $SED \"/\\.${libext}$/d; $lo2o\" | $NL2SP`\n      fi\n\n      # Eliminate all temporary directories.\n      #for path in $notinst_path; do\n      #\tlib_search_path=`$ECHO \"$lib_search_path \" | $SED \"s% $path % %g\"`\n      #\tdeplibs=`$ECHO \"$deplibs \" | $SED \"s% -L$path % %g\"`\n      #\tdependency_libs=`$ECHO \"$dependency_libs \" | $SED \"s% -L$path % %g\"`\n      #done\n\n      if test -n \"$xrpath\"; then\n\t# If the user specified any rpath flags, then add them.\n\ttemp_xrpath=\n\tfor libdir in $xrpath; do\n\t  func_replace_sysroot \"$libdir\"\n\t  func_append temp_xrpath \" -R$func_replace_sysroot_result\"\n\t  case \"$finalize_rpath \" in\n\t  *\" $libdir \"*) ;;\n\t  *) func_append finalize_rpath \" $libdir\" ;;\n\t  esac\n\tdone\n\tif test \"$hardcode_into_libs\" != yes || test \"$build_old_libs\" = yes; then\n\t  dependency_libs=\"$temp_xrpath $dependency_libs\"\n\tfi\n      fi\n\n      # Make sure dlfiles contains only unique files that won't be dlpreopened\n      old_dlfiles=\"$dlfiles\"\n      dlfiles=\n      for lib in $old_dlfiles; do\n\tcase \" $dlprefiles $dlfiles \" in\n\t*\" $lib \"*) ;;\n\t*) func_append dlfiles \" $lib\" ;;\n\tesac\n      done\n\n      # Make sure dlprefiles contains only unique files\n      old_dlprefiles=\"$dlprefiles\"\n      dlprefiles=\n      for lib in $old_dlprefiles; do\n\tcase \"$dlprefiles \" in\n\t*\" $lib \"*) ;;\n\t*) func_append dlprefiles \" $lib\" ;;\n\tesac\n      done\n\n      if test \"$build_libtool_libs\" = yes; then\n\tif test -n \"$rpath\"; then\n\t  case $host in\n\t  *-*-cygwin* | *-*-mingw* | *-*-pw32* | *-*-os2* | *-*-beos* | *-cegcc* | *-*-haiku*)\n\t    # these systems don't actually have a c library (as such)!\n\t    ;;\n\t  *-*-rhapsody* | *-*-darwin1.[012])\n\t    # Rhapsody C library is in the System framework\n\t    func_append deplibs \" System.ltframework\"\n\t    ;;\n\t  *-*-netbsd*)\n\t    # Don't link with libc until the a.out ld.so is fixed.\n\t    ;;\n\t  *-*-openbsd* | *-*-freebsd* | *-*-dragonfly*)\n\t    # Do not include libc due to us having libc/libc_r.\n\t    ;;\n\t  *-*-sco3.2v5* | *-*-sco5v6*)\n\t    # Causes problems with __ctype\n\t    ;;\n\t  *-*-sysv4.2uw2* | *-*-sysv5* | *-*-unixware* | *-*-OpenUNIX*)\n\t    # Compiler inserts libc in the correct place for threads to work\n\t    ;;\n\t  *)\n\t    # Add libc to deplibs on all other systems if necessary.\n\t    if test \"$build_libtool_need_lc\" = \"yes\"; then\n\t      func_append deplibs \" -lc\"\n\t    fi\n\t    ;;\n\t  esac\n\tfi\n\n\t# Transform deplibs into only deplibs that can be linked in shared.\n\tname_save=$name\n\tlibname_save=$libname\n\trelease_save=$release\n\tversuffix_save=$versuffix\n\tmajor_save=$major\n\t# I'm not sure if I'm treating the release correctly.  I think\n\t# release should show up in the -l (ie -lgmp5) so we don't want to\n\t# add it in twice.  Is that correct?\n\trelease=\"\"\n\tversuffix=\"\"\n\tmajor=\"\"\n\tnewdeplibs=\n\tdroppeddeps=no\n\tcase $deplibs_check_method in\n\tpass_all)\n\t  # Don't check for shared/static.  Everything works.\n\t  # This might be a little naive.  We might want to check\n\t  # whether the library exists or not.  But this is on\n\t  # osf3 & osf4 and I'm not really sure... Just\n\t  # implementing what was already the behavior.\n\t  newdeplibs=$deplibs\n\t  ;;\n\ttest_compile)\n\t  # This code stresses the \"libraries are programs\" paradigm to its\n\t  # limits. Maybe even breaks it.  We compile a program, linking it\n\t  # against the deplibs as a proxy for the library.  Then we can check\n\t  # whether they linked in statically or dynamically with ldd.\n\t  $opt_dry_run || $RM conftest.c\n\t  cat > conftest.c <<EOF\n\t  int main() { return 0; }\nEOF\n\t  $opt_dry_run || $RM conftest\n\t  if $LTCC $LTCFLAGS -o conftest conftest.c $deplibs; then\n\t    ldd_output=`ldd conftest`\n\t    for i in $deplibs; do\n\t      case $i in\n\t      -l*)\n\t\tfunc_stripname -l '' \"$i\"\n\t\tname=$func_stripname_result\n\t\tif test \"X$allow_libtool_libs_with_static_runtimes\" = \"Xyes\" ; then\n\t\t  case \" $predeps $postdeps \" in\n\t\t  *\" $i \"*)\n\t\t    func_append newdeplibs \" $i\"\n\t\t    i=\"\"\n\t\t    ;;\n\t\t  esac\n\t\tfi\n\t\tif test -n \"$i\" ; then\n\t\t  libname=`eval \"\\\\$ECHO \\\"$libname_spec\\\"\"`\n\t\t  deplib_matches=`eval \"\\\\$ECHO \\\"$library_names_spec\\\"\"`\n\t\t  set dummy $deplib_matches; shift\n\t\t  deplib_match=$1\n\t\t  if test `expr \"$ldd_output\" : \".*$deplib_match\"` -ne 0 ; then\n\t\t    func_append newdeplibs \" $i\"\n\t\t  else\n\t\t    droppeddeps=yes\n\t\t    echo\n\t\t    $ECHO \"*** Warning: dynamic linker does not accept needed library $i.\"\n\t\t    echo \"*** I have the capability to make that library automatically link in when\"\n\t\t    echo \"*** you link to this library.  But I can only do this if you have a\"\n\t\t    echo \"*** shared version of the library, which I believe you do not have\"\n\t\t    echo \"*** because a test_compile did reveal that the linker did not use it for\"\n\t\t    echo \"*** its dynamic dependency list that programs get resolved with at runtime.\"\n\t\t  fi\n\t\tfi\n\t\t;;\n\t      *)\n\t\tfunc_append newdeplibs \" $i\"\n\t\t;;\n\t      esac\n\t    done\n\t  else\n\t    # Error occurred in the first compile.  Let's try to salvage\n\t    # the situation: Compile a separate program for each library.\n\t    for i in $deplibs; do\n\t      case $i in\n\t      -l*)\n\t\tfunc_stripname -l '' \"$i\"\n\t\tname=$func_stripname_result\n\t\t$opt_dry_run || $RM conftest\n\t\tif $LTCC $LTCFLAGS -o conftest conftest.c $i; then\n\t\t  ldd_output=`ldd conftest`\n\t\t  if test \"X$allow_libtool_libs_with_static_runtimes\" = \"Xyes\" ; then\n\t\t    case \" $predeps $postdeps \" in\n\t\t    *\" $i \"*)\n\t\t      func_append newdeplibs \" $i\"\n\t\t      i=\"\"\n\t\t      ;;\n\t\t    esac\n\t\t  fi\n\t\t  if test -n \"$i\" ; then\n\t\t    libname=`eval \"\\\\$ECHO \\\"$libname_spec\\\"\"`\n\t\t    deplib_matches=`eval \"\\\\$ECHO \\\"$library_names_spec\\\"\"`\n\t\t    set dummy $deplib_matches; shift\n\t\t    deplib_match=$1\n\t\t    if test `expr \"$ldd_output\" : \".*$deplib_match\"` -ne 0 ; then\n\t\t      func_append newdeplibs \" $i\"\n\t\t    else\n\t\t      droppeddeps=yes\n\t\t      echo\n\t\t      $ECHO \"*** Warning: dynamic linker does not accept needed library $i.\"\n\t\t      echo \"*** I have the capability to make that library automatically link in when\"\n\t\t      echo \"*** you link to this library.  But I can only do this if you have a\"\n\t\t      echo \"*** shared version of the library, which you do not appear to have\"\n\t\t      echo \"*** because a test_compile did reveal that the linker did not use this one\"\n\t\t      echo \"*** as a dynamic dependency that programs can get resolved with at runtime.\"\n\t\t    fi\n\t\t  fi\n\t\telse\n\t\t  droppeddeps=yes\n\t\t  echo\n\t\t  $ECHO \"*** Warning!  Library $i is needed by this library but I was not able to\"\n\t\t  echo \"*** make it link in!  You will probably need to install it or some\"\n\t\t  echo \"*** library that it depends on before this library will be fully\"\n\t\t  echo \"*** functional.  Installing it before continuing would be even better.\"\n\t\tfi\n\t\t;;\n\t      *)\n\t\tfunc_append newdeplibs \" $i\"\n\t\t;;\n\t      esac\n\t    done\n\t  fi\n\t  ;;\n\tfile_magic*)\n\t  set dummy $deplibs_check_method; shift\n\t  file_magic_regex=`expr \"$deplibs_check_method\" : \"$1 \\(.*\\)\"`\n\t  for a_deplib in $deplibs; do\n\t    case $a_deplib in\n\t    -l*)\n\t      func_stripname -l '' \"$a_deplib\"\n\t      name=$func_stripname_result\n\t      if test \"X$allow_libtool_libs_with_static_runtimes\" = \"Xyes\" ; then\n\t\tcase \" $predeps $postdeps \" in\n\t\t*\" $a_deplib \"*)\n\t\t  func_append newdeplibs \" $a_deplib\"\n\t\t  a_deplib=\"\"\n\t\t  ;;\n\t\tesac\n\t      fi\n\t      if test -n \"$a_deplib\" ; then\n\t\tlibname=`eval \"\\\\$ECHO \\\"$libname_spec\\\"\"`\n\t\tif test -n \"$file_magic_glob\"; then\n\t\t  libnameglob=`func_echo_all \"$libname\" | $SED -e $file_magic_glob`\n\t\telse\n\t\t  libnameglob=$libname\n\t\tfi\n\t\ttest \"$want_nocaseglob\" = yes && nocaseglob=`shopt -p nocaseglob`\n\t\tfor i in $lib_search_path $sys_lib_search_path $shlib_search_path; do\n\t\t  if test \"$want_nocaseglob\" = yes; then\n\t\t    shopt -s nocaseglob\n\t\t    potential_libs=`ls $i/$libnameglob[.-]* 2>/dev/null`\n\t\t    $nocaseglob\n\t\t  else\n\t\t    potential_libs=`ls $i/$libnameglob[.-]* 2>/dev/null`\n\t\t  fi\n\t\t  for potent_lib in $potential_libs; do\n\t\t      # Follow soft links.\n\t\t      if ls -lLd \"$potent_lib\" 2>/dev/null |\n\t\t\t $GREP \" -> \" >/dev/null; then\n\t\t\tcontinue\n\t\t      fi\n\t\t      # The statement above tries to avoid entering an\n\t\t      # endless loop below, in case of cyclic links.\n\t\t      # We might still enter an endless loop, since a link\n\t\t      # loop can be closed while we follow links,\n\t\t      # but so what?\n\t\t      potlib=\"$potent_lib\"\n\t\t      while test -h \"$potlib\" 2>/dev/null; do\n\t\t\tpotliblink=`ls -ld $potlib | ${SED} 's/.* -> //'`\n\t\t\tcase $potliblink in\n\t\t\t[\\\\/]* | [A-Za-z]:[\\\\/]*) potlib=\"$potliblink\";;\n\t\t\t*) potlib=`$ECHO \"$potlib\" | $SED 's,[^/]*$,,'`\"$potliblink\";;\n\t\t\tesac\n\t\t      done\n\t\t      if eval $file_magic_cmd \\\"\\$potlib\\\" 2>/dev/null |\n\t\t\t $SED -e 10q |\n\t\t\t $EGREP \"$file_magic_regex\" > /dev/null; then\n\t\t\tfunc_append newdeplibs \" $a_deplib\"\n\t\t\ta_deplib=\"\"\n\t\t\tbreak 2\n\t\t      fi\n\t\t  done\n\t\tdone\n\t      fi\n\t      if test -n \"$a_deplib\" ; then\n\t\tdroppeddeps=yes\n\t\techo\n\t\t$ECHO \"*** Warning: linker path does not have real file for library $a_deplib.\"\n\t\techo \"*** I have the capability to make that library automatically link in when\"\n\t\techo \"*** you link to this library.  But I can only do this if you have a\"\n\t\techo \"*** shared version of the library, which you do not appear to have\"\n\t\techo \"*** because I did check the linker path looking for a file starting\"\n\t\tif test -z \"$potlib\" ; then\n\t\t  $ECHO \"*** with $libname but no candidates were found. (...for file magic test)\"\n\t\telse\n\t\t  $ECHO \"*** with $libname and none of the candidates passed a file format test\"\n\t\t  $ECHO \"*** using a file magic. Last file checked: $potlib\"\n\t\tfi\n\t      fi\n\t      ;;\n\t    *)\n\t      # Add a -L argument.\n\t      func_append newdeplibs \" $a_deplib\"\n\t      ;;\n\t    esac\n\t  done # Gone through all deplibs.\n\t  ;;\n\tmatch_pattern*)\n\t  set dummy $deplibs_check_method; shift\n\t  match_pattern_regex=`expr \"$deplibs_check_method\" : \"$1 \\(.*\\)\"`\n\t  for a_deplib in $deplibs; do\n\t    case $a_deplib in\n\t    -l*)\n\t      func_stripname -l '' \"$a_deplib\"\n\t      name=$func_stripname_result\n\t      if test \"X$allow_libtool_libs_with_static_runtimes\" = \"Xyes\" ; then\n\t\tcase \" $predeps $postdeps \" in\n\t\t*\" $a_deplib \"*)\n\t\t  func_append newdeplibs \" $a_deplib\"\n\t\t  a_deplib=\"\"\n\t\t  ;;\n\t\tesac\n\t      fi\n\t      if test -n \"$a_deplib\" ; then\n\t\tlibname=`eval \"\\\\$ECHO \\\"$libname_spec\\\"\"`\n\t\tfor i in $lib_search_path $sys_lib_search_path $shlib_search_path; do\n\t\t  potential_libs=`ls $i/$libname[.-]* 2>/dev/null`\n\t\t  for potent_lib in $potential_libs; do\n\t\t    potlib=\"$potent_lib\" # see symlink-check above in file_magic test\n\t\t    if eval \"\\$ECHO \\\"$potent_lib\\\"\" 2>/dev/null | $SED 10q | \\\n\t\t       $EGREP \"$match_pattern_regex\" > /dev/null; then\n\t\t      func_append newdeplibs \" $a_deplib\"\n\t\t      a_deplib=\"\"\n\t\t      break 2\n\t\t    fi\n\t\t  done\n\t\tdone\n\t      fi\n\t      if test -n \"$a_deplib\" ; then\n\t\tdroppeddeps=yes\n\t\techo\n\t\t$ECHO \"*** Warning: linker path does not have real file for library $a_deplib.\"\n\t\techo \"*** I have the capability to make that library automatically link in when\"\n\t\techo \"*** you link to this library.  But I can only do this if you have a\"\n\t\techo \"*** shared version of the library, which you do not appear to have\"\n\t\techo \"*** because I did check the linker path looking for a file starting\"\n\t\tif test -z \"$potlib\" ; then\n\t\t  $ECHO \"*** with $libname but no candidates were found. (...for regex pattern test)\"\n\t\telse\n\t\t  $ECHO \"*** with $libname and none of the candidates passed a file format test\"\n\t\t  $ECHO \"*** using a regex pattern. Last file checked: $potlib\"\n\t\tfi\n\t      fi\n\t      ;;\n\t    *)\n\t      # Add a -L argument.\n\t      func_append newdeplibs \" $a_deplib\"\n\t      ;;\n\t    esac\n\t  done # Gone through all deplibs.\n\t  ;;\n\tnone | unknown | *)\n\t  newdeplibs=\"\"\n\t  tmp_deplibs=`$ECHO \" $deplibs\" | $SED 's/ -lc$//; s/ -[LR][^ ]*//g'`\n\t  if test \"X$allow_libtool_libs_with_static_runtimes\" = \"Xyes\" ; then\n\t    for i in $predeps $postdeps ; do\n\t      # can't use Xsed below, because $i might contain '/'\n\t      tmp_deplibs=`$ECHO \" $tmp_deplibs\" | $SED \"s,$i,,\"`\n\t    done\n\t  fi\n\t  case $tmp_deplibs in\n\t  *[!\\\t\\ ]*)\n\t    echo\n\t    if test \"X$deplibs_check_method\" = \"Xnone\"; then\n\t      echo \"*** Warning: inter-library dependencies are not supported in this platform.\"\n\t    else\n\t      echo \"*** Warning: inter-library dependencies are not known to be supported.\"\n\t    fi\n\t    echo \"*** All declared inter-library dependencies are being dropped.\"\n\t    droppeddeps=yes\n\t    ;;\n\t  esac\n\t  ;;\n\tesac\n\tversuffix=$versuffix_save\n\tmajor=$major_save\n\trelease=$release_save\n\tlibname=$libname_save\n\tname=$name_save\n\n\tcase $host in\n\t*-*-rhapsody* | *-*-darwin1.[012])\n\t  # On Rhapsody replace the C library with the System framework\n\t  newdeplibs=`$ECHO \" $newdeplibs\" | $SED 's/ -lc / System.ltframework /'`\n\t  ;;\n\tesac\n\n\tif test \"$droppeddeps\" = yes; then\n\t  if test \"$module\" = yes; then\n\t    echo\n\t    echo \"*** Warning: libtool could not satisfy all declared inter-library\"\n\t    $ECHO \"*** dependencies of module $libname.  Therefore, libtool will create\"\n\t    echo \"*** a static module, that should work as long as the dlopening\"\n\t    echo \"*** application is linked with the -dlopen flag.\"\n\t    if test -z \"$global_symbol_pipe\"; then\n\t      echo\n\t      echo \"*** However, this would only work if libtool was able to extract symbol\"\n\t      echo \"*** lists from a program, using \\`nm' or equivalent, but libtool could\"\n\t      echo \"*** not find such a program.  So, this module is probably useless.\"\n\t      echo \"*** \\`nm' from GNU binutils and a full rebuild may help.\"\n\t    fi\n\t    if test \"$build_old_libs\" = no; then\n\t      oldlibs=\"$output_objdir/$libname.$libext\"\n\t      build_libtool_libs=module\n\t      build_old_libs=yes\n\t    else\n\t      build_libtool_libs=no\n\t    fi\n\t  else\n\t    echo \"*** The inter-library dependencies that have been dropped here will be\"\n\t    echo \"*** automatically added whenever a program is linked with this library\"\n\t    echo \"*** or is declared to -dlopen it.\"\n\n\t    if test \"$allow_undefined\" = no; then\n\t      echo\n\t      echo \"*** Since this library must not contain undefined symbols,\"\n\t      echo \"*** because either the platform does not support them or\"\n\t      echo \"*** it was explicitly requested with -no-undefined,\"\n\t      echo \"*** libtool will only create a static version of it.\"\n\t      if test \"$build_old_libs\" = no; then\n\t\toldlibs=\"$output_objdir/$libname.$libext\"\n\t\tbuild_libtool_libs=module\n\t\tbuild_old_libs=yes\n\t      else\n\t\tbuild_libtool_libs=no\n\t      fi\n\t    fi\n\t  fi\n\tfi\n\t# Done checking deplibs!\n\tdeplibs=$newdeplibs\n      fi\n      # Time to change all our \"foo.ltframework\" stuff back to \"-framework foo\"\n      case $host in\n\t*-*-darwin*)\n\t  newdeplibs=`$ECHO \" $newdeplibs\" | $SED 's% \\([^ $]*\\).ltframework% -framework \\1%g'`\n\t  new_inherited_linker_flags=`$ECHO \" $new_inherited_linker_flags\" | $SED 's% \\([^ $]*\\).ltframework% -framework \\1%g'`\n\t  deplibs=`$ECHO \" $deplibs\" | $SED 's% \\([^ $]*\\).ltframework% -framework \\1%g'`\n\t  ;;\n      esac\n\n      # move library search paths that coincide with paths to not yet\n      # installed libraries to the beginning of the library search list\n      new_libs=\n      for path in $notinst_path; do\n\tcase \" $new_libs \" in\n\t*\" -L$path/$objdir \"*) ;;\n\t*)\n\t  case \" $deplibs \" in\n\t  *\" -L$path/$objdir \"*)\n\t    func_append new_libs \" -L$path/$objdir\" ;;\n\t  esac\n\t  ;;\n\tesac\n      done\n      for deplib in $deplibs; do\n\tcase $deplib in\n\t-L*)\n\t  case \" $new_libs \" in\n\t  *\" $deplib \"*) ;;\n\t  *) func_append new_libs \" $deplib\" ;;\n\t  esac\n\t  ;;\n\t*) func_append new_libs \" $deplib\" ;;\n\tesac\n      done\n      deplibs=\"$new_libs\"\n\n      # All the library-specific variables (install_libdir is set above).\n      library_names=\n      old_library=\n      dlname=\n\n      # Test again, we may have decided not to build it any more\n      if test \"$build_libtool_libs\" = yes; then\n\t# Remove ${wl} instances when linking with ld.\n\t# FIXME: should test the right _cmds variable.\n\tcase $archive_cmds in\n\t  *\\$LD\\ *) wl= ;;\n        esac\n\tif test \"$hardcode_into_libs\" = yes; then\n\t  # Hardcode the library paths\n\t  hardcode_libdirs=\n\t  dep_rpath=\n\t  rpath=\"$finalize_rpath\"\n\t  test \"$opt_mode\" != relink && rpath=\"$compile_rpath$rpath\"\n\t  for libdir in $rpath; do\n\t    if test -n \"$hardcode_libdir_flag_spec\"; then\n\t      if test -n \"$hardcode_libdir_separator\"; then\n\t\tfunc_replace_sysroot \"$libdir\"\n\t\tlibdir=$func_replace_sysroot_result\n\t\tif test -z \"$hardcode_libdirs\"; then\n\t\t  hardcode_libdirs=\"$libdir\"\n\t\telse\n\t\t  # Just accumulate the unique libdirs.\n\t\t  case $hardcode_libdir_separator$hardcode_libdirs$hardcode_libdir_separator in\n\t\t  *\"$hardcode_libdir_separator$libdir$hardcode_libdir_separator\"*)\n\t\t    ;;\n\t\t  *)\n\t\t    func_append hardcode_libdirs \"$hardcode_libdir_separator$libdir\"\n\t\t    ;;\n\t\t  esac\n\t\tfi\n\t      else\n\t\teval flag=\\\"$hardcode_libdir_flag_spec\\\"\n\t\tfunc_append dep_rpath \" $flag\"\n\t      fi\n\t    elif test -n \"$runpath_var\"; then\n\t      case \"$perm_rpath \" in\n\t      *\" $libdir \"*) ;;\n\t      *) func_append perm_rpath \" $libdir\" ;;\n\t      esac\n\t    fi\n\t  done\n\t  # Substitute the hardcoded libdirs into the rpath.\n\t  if test -n \"$hardcode_libdir_separator\" &&\n\t     test -n \"$hardcode_libdirs\"; then\n\t    libdir=\"$hardcode_libdirs\"\n\t    eval \"dep_rpath=\\\"$hardcode_libdir_flag_spec\\\"\"\n\t  fi\n\t  if test -n \"$runpath_var\" && test -n \"$perm_rpath\"; then\n\t    # We should set the runpath_var.\n\t    rpath=\n\t    for dir in $perm_rpath; do\n\t      func_append rpath \"$dir:\"\n\t    done\n\t    eval \"$runpath_var='$rpath\\$$runpath_var'; export $runpath_var\"\n\t  fi\n\t  test -n \"$dep_rpath\" && deplibs=\"$dep_rpath $deplibs\"\n\tfi\n\n\tshlibpath=\"$finalize_shlibpath\"\n\ttest \"$opt_mode\" != relink && shlibpath=\"$compile_shlibpath$shlibpath\"\n\tif test -n \"$shlibpath\"; then\n\t  eval \"$shlibpath_var='$shlibpath\\$$shlibpath_var'; export $shlibpath_var\"\n\tfi\n\n\t# Get the real and link names of the library.\n\teval shared_ext=\\\"$shrext_cmds\\\"\n\teval library_names=\\\"$library_names_spec\\\"\n\tset dummy $library_names\n\tshift\n\trealname=\"$1\"\n\tshift\n\n\tif test -n \"$soname_spec\"; then\n\t  eval soname=\\\"$soname_spec\\\"\n\telse\n\t  soname=\"$realname\"\n\tfi\n\tif test -z \"$dlname\"; then\n\t  dlname=$soname\n\tfi\n\n\tlib=\"$output_objdir/$realname\"\n\tlinknames=\n\tfor link\n\tdo\n\t  func_append linknames \" $link\"\n\tdone\n\n\t# Use standard objects if they are pic\n\ttest -z \"$pic_flag\" && libobjs=`$ECHO \"$libobjs\" | $SP2NL | $SED \"$lo2o\" | $NL2SP`\n\ttest \"X$libobjs\" = \"X \" && libobjs=\n\n\tdelfiles=\n\tif test -n \"$export_symbols\" && test -n \"$include_expsyms\"; then\n\t  $opt_dry_run || cp \"$export_symbols\" \"$output_objdir/$libname.uexp\"\n\t  export_symbols=\"$output_objdir/$libname.uexp\"\n\t  func_append delfiles \" $export_symbols\"\n\tfi\n\n\torig_export_symbols=\n\tcase $host_os in\n\tcygwin* | mingw* | cegcc*)\n\t  if test -n \"$export_symbols\" && test -z \"$export_symbols_regex\"; then\n\t    # exporting using user supplied symfile\n\t    if test \"x`$SED 1q $export_symbols`\" != xEXPORTS; then\n\t      # and it's NOT already a .def file. Must figure out\n\t      # which of the given symbols are data symbols and tag\n\t      # them as such. So, trigger use of export_symbols_cmds.\n\t      # export_symbols gets reassigned inside the \"prepare\n\t      # the list of exported symbols\" if statement, so the\n\t      # include_expsyms logic still works.\n\t      orig_export_symbols=\"$export_symbols\"\n\t      export_symbols=\n\t      always_export_symbols=yes\n\t    fi\n\t  fi\n\t  ;;\n\tesac\n\n\t# Prepare the list of exported symbols\n\tif test -z \"$export_symbols\"; then\n\t  if test \"$always_export_symbols\" = yes || test -n \"$export_symbols_regex\"; then\n\t    func_verbose \"generating symbol list for \\`$libname.la'\"\n\t    export_symbols=\"$output_objdir/$libname.exp\"\n\t    $opt_dry_run || $RM $export_symbols\n\t    cmds=$export_symbols_cmds\n\t    save_ifs=\"$IFS\"; IFS='~'\n\t    for cmd1 in $cmds; do\n\t      IFS=\"$save_ifs\"\n\t      # Take the normal branch if the nm_file_list_spec branch\n\t      # doesn't work or if tool conversion is not needed.\n\t      case $nm_file_list_spec~$to_tool_file_cmd in\n\t\t*~func_convert_file_noop | *~func_convert_file_msys_to_w32 | ~*)\n\t\t  try_normal_branch=yes\n\t\t  eval cmd=\\\"$cmd1\\\"\n\t\t  func_len \" $cmd\"\n\t\t  len=$func_len_result\n\t\t  ;;\n\t\t*)\n\t\t  try_normal_branch=no\n\t\t  ;;\n\t      esac\n\t      if test \"$try_normal_branch\" = yes \\\n\t\t && { test \"$len\" -lt \"$max_cmd_len\" \\\n\t\t      || test \"$max_cmd_len\" -le -1; }\n\t      then\n\t\tfunc_show_eval \"$cmd\" 'exit $?'\n\t\tskipped_export=false\n\t      elif test -n \"$nm_file_list_spec\"; then\n\t\tfunc_basename \"$output\"\n\t\toutput_la=$func_basename_result\n\t\tsave_libobjs=$libobjs\n\t\tsave_output=$output\n\t\toutput=${output_objdir}/${output_la}.nm\n\t\tfunc_to_tool_file \"$output\"\n\t\tlibobjs=$nm_file_list_spec$func_to_tool_file_result\n\t\tfunc_append delfiles \" $output\"\n\t\tfunc_verbose \"creating $NM input file list: $output\"\n\t\tfor obj in $save_libobjs; do\n\t\t  func_to_tool_file \"$obj\"\n\t\t  $ECHO \"$func_to_tool_file_result\"\n\t\tdone > \"$output\"\n\t\teval cmd=\\\"$cmd1\\\"\n\t\tfunc_show_eval \"$cmd\" 'exit $?'\n\t\toutput=$save_output\n\t\tlibobjs=$save_libobjs\n\t\tskipped_export=false\n\t      else\n\t\t# The command line is too long to execute in one step.\n\t\tfunc_verbose \"using reloadable object file for export list...\"\n\t\tskipped_export=:\n\t\t# Break out early, otherwise skipped_export may be\n\t\t# set to false by a later but shorter cmd.\n\t\tbreak\n\t      fi\n\t    done\n\t    IFS=\"$save_ifs\"\n\t    if test -n \"$export_symbols_regex\" && test \"X$skipped_export\" != \"X:\"; then\n\t      func_show_eval '$EGREP -e \"$export_symbols_regex\" \"$export_symbols\" > \"${export_symbols}T\"'\n\t      func_show_eval '$MV \"${export_symbols}T\" \"$export_symbols\"'\n\t    fi\n\t  fi\n\tfi\n\n\tif test -n \"$export_symbols\" && test -n \"$include_expsyms\"; then\n\t  tmp_export_symbols=\"$export_symbols\"\n\t  test -n \"$orig_export_symbols\" && tmp_export_symbols=\"$orig_export_symbols\"\n\t  $opt_dry_run || eval '$ECHO \"$include_expsyms\" | $SP2NL >> \"$tmp_export_symbols\"'\n\tfi\n\n\tif test \"X$skipped_export\" != \"X:\" && test -n \"$orig_export_symbols\"; then\n\t  # The given exports_symbols file has to be filtered, so filter it.\n\t  func_verbose \"filter symbol list for \\`$libname.la' to tag DATA exports\"\n\t  # FIXME: $output_objdir/$libname.filter potentially contains lots of\n\t  # 's' commands which not all seds can handle. GNU sed should be fine\n\t  # though. Also, the filter scales superlinearly with the number of\n\t  # global variables. join(1) would be nice here, but unfortunately\n\t  # isn't a blessed tool.\n\t  $opt_dry_run || $SED -e '/[ ,]DATA/!d;s,\\(.*\\)\\([ \\,].*\\),s|^\\1$|\\1\\2|,' < $export_symbols > $output_objdir/$libname.filter\n\t  func_append delfiles \" $export_symbols $output_objdir/$libname.filter\"\n\t  export_symbols=$output_objdir/$libname.def\n\t  $opt_dry_run || $SED -f $output_objdir/$libname.filter < $orig_export_symbols > $export_symbols\n\tfi\n\n\ttmp_deplibs=\n\tfor test_deplib in $deplibs; do\n\t  case \" $convenience \" in\n\t  *\" $test_deplib \"*) ;;\n\t  *)\n\t    func_append tmp_deplibs \" $test_deplib\"\n\t    ;;\n\t  esac\n\tdone\n\tdeplibs=\"$tmp_deplibs\"\n\n\tif test -n \"$convenience\"; then\n\t  if test -n \"$whole_archive_flag_spec\" &&\n\t    test \"$compiler_needs_object\" = yes &&\n\t    test -z \"$libobjs\"; then\n\t    # extract the archives, so we have objects to list.\n\t    # TODO: could optimize this to just extract one archive.\n\t    whole_archive_flag_spec=\n\t  fi\n\t  if test -n \"$whole_archive_flag_spec\"; then\n\t    save_libobjs=$libobjs\n\t    eval libobjs=\\\"\\$libobjs $whole_archive_flag_spec\\\"\n\t    test \"X$libobjs\" = \"X \" && libobjs=\n\t  else\n\t    gentop=\"$output_objdir/${outputname}x\"\n\t    func_append generated \" $gentop\"\n\n\t    func_extract_archives $gentop $convenience\n\t    func_append libobjs \" $func_extract_archives_result\"\n\t    test \"X$libobjs\" = \"X \" && libobjs=\n\t  fi\n\tfi\n\n\tif test \"$thread_safe\" = yes && test -n \"$thread_safe_flag_spec\"; then\n\t  eval flag=\\\"$thread_safe_flag_spec\\\"\n\t  func_append linker_flags \" $flag\"\n\tfi\n\n\t# Make a backup of the uninstalled library when relinking\n\tif test \"$opt_mode\" = relink; then\n\t  $opt_dry_run || eval '(cd $output_objdir && $RM ${realname}U && $MV $realname ${realname}U)' || exit $?\n\tfi\n\n\t# Do each of the archive commands.\n\tif test \"$module\" = yes && test -n \"$module_cmds\" ; then\n\t  if test -n \"$export_symbols\" && test -n \"$module_expsym_cmds\"; then\n\t    eval test_cmds=\\\"$module_expsym_cmds\\\"\n\t    cmds=$module_expsym_cmds\n\t  else\n\t    eval test_cmds=\\\"$module_cmds\\\"\n\t    cmds=$module_cmds\n\t  fi\n\telse\n\t  if test -n \"$export_symbols\" && test -n \"$archive_expsym_cmds\"; then\n\t    eval test_cmds=\\\"$archive_expsym_cmds\\\"\n\t    cmds=$archive_expsym_cmds\n\t  else\n\t    eval test_cmds=\\\"$archive_cmds\\\"\n\t    cmds=$archive_cmds\n\t  fi\n\tfi\n\n\tif test \"X$skipped_export\" != \"X:\" &&\n\t   func_len \" $test_cmds\" &&\n\t   len=$func_len_result &&\n\t   test \"$len\" -lt \"$max_cmd_len\" || test \"$max_cmd_len\" -le -1; then\n\t  :\n\telse\n\t  # The command line is too long to link in one step, link piecewise\n\t  # or, if using GNU ld and skipped_export is not :, use a linker\n\t  # script.\n\n\t  # Save the value of $output and $libobjs because we want to\n\t  # use them later.  If we have whole_archive_flag_spec, we\n\t  # want to use save_libobjs as it was before\n\t  # whole_archive_flag_spec was expanded, because we can't\n\t  # assume the linker understands whole_archive_flag_spec.\n\t  # This may have to be revisited, in case too many\n\t  # convenience libraries get linked in and end up exceeding\n\t  # the spec.\n\t  if test -z \"$convenience\" || test -z \"$whole_archive_flag_spec\"; then\n\t    save_libobjs=$libobjs\n\t  fi\n\t  save_output=$output\n\t  func_basename \"$output\"\n\t  output_la=$func_basename_result\n\n\t  # Clear the reloadable object creation command queue and\n\t  # initialize k to one.\n\t  test_cmds=\n\t  concat_cmds=\n\t  objlist=\n\t  last_robj=\n\t  k=1\n\n\t  if test -n \"$save_libobjs\" && test \"X$skipped_export\" != \"X:\" && test \"$with_gnu_ld\" = yes; then\n\t    output=${output_objdir}/${output_la}.lnkscript\n\t    func_verbose \"creating GNU ld script: $output\"\n\t    echo 'INPUT (' > $output\n\t    for obj in $save_libobjs\n\t    do\n\t      func_to_tool_file \"$obj\"\n\t      $ECHO \"$func_to_tool_file_result\" >> $output\n\t    done\n\t    echo ')' >> $output\n\t    func_append delfiles \" $output\"\n\t    func_to_tool_file \"$output\"\n\t    output=$func_to_tool_file_result\n\t  elif test -n \"$save_libobjs\" && test \"X$skipped_export\" != \"X:\" && test \"X$file_list_spec\" != X; then\n\t    output=${output_objdir}/${output_la}.lnk\n\t    func_verbose \"creating linker input file list: $output\"\n\t    : > $output\n\t    set x $save_libobjs\n\t    shift\n\t    firstobj=\n\t    if test \"$compiler_needs_object\" = yes; then\n\t      firstobj=\"$1 \"\n\t      shift\n\t    fi\n\t    for obj\n\t    do\n\t      func_to_tool_file \"$obj\"\n\t      $ECHO \"$func_to_tool_file_result\" >> $output\n\t    done\n\t    func_append delfiles \" $output\"\n\t    func_to_tool_file \"$output\"\n\t    output=$firstobj\\\"$file_list_spec$func_to_tool_file_result\\\"\n\t  else\n\t    if test -n \"$save_libobjs\"; then\n\t      func_verbose \"creating reloadable object files...\"\n\t      output=$output_objdir/$output_la-${k}.$objext\n\t      eval test_cmds=\\\"$reload_cmds\\\"\n\t      func_len \" $test_cmds\"\n\t      len0=$func_len_result\n\t      len=$len0\n\n\t      # Loop over the list of objects to be linked.\n\t      for obj in $save_libobjs\n\t      do\n\t\tfunc_len \" $obj\"\n\t\tfunc_arith $len + $func_len_result\n\t\tlen=$func_arith_result\n\t\tif test \"X$objlist\" = X ||\n\t\t   test \"$len\" -lt \"$max_cmd_len\"; then\n\t\t  func_append objlist \" $obj\"\n\t\telse\n\t\t  # The command $test_cmds is almost too long, add a\n\t\t  # command to the queue.\n\t\t  if test \"$k\" -eq 1 ; then\n\t\t    # The first file doesn't have a previous command to add.\n\t\t    reload_objs=$objlist\n\t\t    eval concat_cmds=\\\"$reload_cmds\\\"\n\t\t  else\n\t\t    # All subsequent reloadable object files will link in\n\t\t    # the last one created.\n\t\t    reload_objs=\"$objlist $last_robj\"\n\t\t    eval concat_cmds=\\\"\\$concat_cmds~$reload_cmds~\\$RM $last_robj\\\"\n\t\t  fi\n\t\t  last_robj=$output_objdir/$output_la-${k}.$objext\n\t\t  func_arith $k + 1\n\t\t  k=$func_arith_result\n\t\t  output=$output_objdir/$output_la-${k}.$objext\n\t\t  objlist=\" $obj\"\n\t\t  func_len \" $last_robj\"\n\t\t  func_arith $len0 + $func_len_result\n\t\t  len=$func_arith_result\n\t\tfi\n\t      done\n\t      # Handle the remaining objects by creating one last\n\t      # reloadable object file.  All subsequent reloadable object\n\t      # files will link in the last one created.\n\t      test -z \"$concat_cmds\" || concat_cmds=$concat_cmds~\n\t      reload_objs=\"$objlist $last_robj\"\n\t      eval concat_cmds=\\\"\\${concat_cmds}$reload_cmds\\\"\n\t      if test -n \"$last_robj\"; then\n\t        eval concat_cmds=\\\"\\${concat_cmds}~\\$RM $last_robj\\\"\n\t      fi\n\t      func_append delfiles \" $output\"\n\n\t    else\n\t      output=\n\t    fi\n\n\t    if ${skipped_export-false}; then\n\t      func_verbose \"generating symbol list for \\`$libname.la'\"\n\t      export_symbols=\"$output_objdir/$libname.exp\"\n\t      $opt_dry_run || $RM $export_symbols\n\t      libobjs=$output\n\t      # Append the command to create the export file.\n\t      test -z \"$concat_cmds\" || concat_cmds=$concat_cmds~\n\t      eval concat_cmds=\\\"\\$concat_cmds$export_symbols_cmds\\\"\n\t      if test -n \"$last_robj\"; then\n\t\teval concat_cmds=\\\"\\$concat_cmds~\\$RM $last_robj\\\"\n\t      fi\n\t    fi\n\n\t    test -n \"$save_libobjs\" &&\n\t      func_verbose \"creating a temporary reloadable object file: $output\"\n\n\t    # Loop through the commands generated above and execute them.\n\t    save_ifs=\"$IFS\"; IFS='~'\n\t    for cmd in $concat_cmds; do\n\t      IFS=\"$save_ifs\"\n\t      $opt_silent || {\n\t\t  func_quote_for_expand \"$cmd\"\n\t\t  eval \"func_echo $func_quote_for_expand_result\"\n\t      }\n\t      $opt_dry_run || eval \"$cmd\" || {\n\t\tlt_exit=$?\n\n\t\t# Restore the uninstalled library and exit\n\t\tif test \"$opt_mode\" = relink; then\n\t\t  ( cd \"$output_objdir\" && \\\n\t\t    $RM \"${realname}T\" && \\\n\t\t    $MV \"${realname}U\" \"$realname\" )\n\t\tfi\n\n\t\texit $lt_exit\n\t      }\n\t    done\n\t    IFS=\"$save_ifs\"\n\n\t    if test -n \"$export_symbols_regex\" && ${skipped_export-false}; then\n\t      func_show_eval '$EGREP -e \"$export_symbols_regex\" \"$export_symbols\" > \"${export_symbols}T\"'\n\t      func_show_eval '$MV \"${export_symbols}T\" \"$export_symbols\"'\n\t    fi\n\t  fi\n\n          if ${skipped_export-false}; then\n\t    if test -n \"$export_symbols\" && test -n \"$include_expsyms\"; then\n\t      tmp_export_symbols=\"$export_symbols\"\n\t      test -n \"$orig_export_symbols\" && tmp_export_symbols=\"$orig_export_symbols\"\n\t      $opt_dry_run || eval '$ECHO \"$include_expsyms\" | $SP2NL >> \"$tmp_export_symbols\"'\n\t    fi\n\n\t    if test -n \"$orig_export_symbols\"; then\n\t      # The given exports_symbols file has to be filtered, so filter it.\n\t      func_verbose \"filter symbol list for \\`$libname.la' to tag DATA exports\"\n\t      # FIXME: $output_objdir/$libname.filter potentially contains lots of\n\t      # 's' commands which not all seds can handle. GNU sed should be fine\n\t      # though. Also, the filter scales superlinearly with the number of\n\t      # global variables. join(1) would be nice here, but unfortunately\n\t      # isn't a blessed tool.\n\t      $opt_dry_run || $SED -e '/[ ,]DATA/!d;s,\\(.*\\)\\([ \\,].*\\),s|^\\1$|\\1\\2|,' < $export_symbols > $output_objdir/$libname.filter\n\t      func_append delfiles \" $export_symbols $output_objdir/$libname.filter\"\n\t      export_symbols=$output_objdir/$libname.def\n\t      $opt_dry_run || $SED -f $output_objdir/$libname.filter < $orig_export_symbols > $export_symbols\n\t    fi\n\t  fi\n\n\t  libobjs=$output\n\t  # Restore the value of output.\n\t  output=$save_output\n\n\t  if test -n \"$convenience\" && test -n \"$whole_archive_flag_spec\"; then\n\t    eval libobjs=\\\"\\$libobjs $whole_archive_flag_spec\\\"\n\t    test \"X$libobjs\" = \"X \" && libobjs=\n\t  fi\n\t  # Expand the library linking commands again to reset the\n\t  # value of $libobjs for piecewise linking.\n\n\t  # Do each of the archive commands.\n\t  if test \"$module\" = yes && test -n \"$module_cmds\" ; then\n\t    if test -n \"$export_symbols\" && test -n \"$module_expsym_cmds\"; then\n\t      cmds=$module_expsym_cmds\n\t    else\n\t      cmds=$module_cmds\n\t    fi\n\t  else\n\t    if test -n \"$export_symbols\" && test -n \"$archive_expsym_cmds\"; then\n\t      cmds=$archive_expsym_cmds\n\t    else\n\t      cmds=$archive_cmds\n\t    fi\n\t  fi\n\tfi\n\n\tif test -n \"$delfiles\"; then\n\t  # Append the command to remove temporary files to $cmds.\n\t  eval cmds=\\\"\\$cmds~\\$RM $delfiles\\\"\n\tfi\n\n\t# Add any objects from preloaded convenience libraries\n\tif test -n \"$dlprefiles\"; then\n\t  gentop=\"$output_objdir/${outputname}x\"\n\t  func_append generated \" $gentop\"\n\n\t  func_extract_archives $gentop $dlprefiles\n\t  func_append libobjs \" $func_extract_archives_result\"\n\t  test \"X$libobjs\" = \"X \" && libobjs=\n\tfi\n\n\tsave_ifs=\"$IFS\"; IFS='~'\n\tfor cmd in $cmds; do\n\t  IFS=\"$save_ifs\"\n\t  eval cmd=\\\"$cmd\\\"\n\t  $opt_silent || {\n\t    func_quote_for_expand \"$cmd\"\n\t    eval \"func_echo $func_quote_for_expand_result\"\n\t  }\n\t  $opt_dry_run || eval \"$cmd\" || {\n\t    lt_exit=$?\n\n\t    # Restore the uninstalled library and exit\n\t    if test \"$opt_mode\" = relink; then\n\t      ( cd \"$output_objdir\" && \\\n\t        $RM \"${realname}T\" && \\\n\t\t$MV \"${realname}U\" \"$realname\" )\n\t    fi\n\n\t    exit $lt_exit\n\t  }\n\tdone\n\tIFS=\"$save_ifs\"\n\n\t# Restore the uninstalled library and exit\n\tif test \"$opt_mode\" = relink; then\n\t  $opt_dry_run || eval '(cd $output_objdir && $RM ${realname}T && $MV $realname ${realname}T && $MV ${realname}U $realname)' || exit $?\n\n\t  if test -n \"$convenience\"; then\n\t    if test -z \"$whole_archive_flag_spec\"; then\n\t      func_show_eval '${RM}r \"$gentop\"'\n\t    fi\n\t  fi\n\n\t  exit $EXIT_SUCCESS\n\tfi\n\n\t# Create links to the real library.\n\tfor linkname in $linknames; do\n\t  if test \"$realname\" != \"$linkname\"; then\n\t    func_show_eval '(cd \"$output_objdir\" && $RM \"$linkname\" && $LN_S \"$realname\" \"$linkname\")' 'exit $?'\n\t  fi\n\tdone\n\n\t# If -module or -export-dynamic was specified, set the dlname.\n\tif test \"$module\" = yes || test \"$export_dynamic\" = yes; then\n\t  # On all known operating systems, these are identical.\n\t  dlname=\"$soname\"\n\tfi\n      fi\n      ;;\n\n    obj)\n      if test -n \"$dlfiles$dlprefiles\" || test \"$dlself\" != no; then\n\tfunc_warning \"\\`-dlopen' is ignored for objects\"\n      fi\n\n      case \" $deplibs\" in\n      *\\ -l* | *\\ -L*)\n\tfunc_warning \"\\`-l' and \\`-L' are ignored for objects\" ;;\n      esac\n\n      test -n \"$rpath\" && \\\n\tfunc_warning \"\\`-rpath' is ignored for objects\"\n\n      test -n \"$xrpath\" && \\\n\tfunc_warning \"\\`-R' is ignored for objects\"\n\n      test -n \"$vinfo\" && \\\n\tfunc_warning \"\\`-version-info' is ignored for objects\"\n\n      test -n \"$release\" && \\\n\tfunc_warning \"\\`-release' is ignored for objects\"\n\n      case $output in\n      *.lo)\n\ttest -n \"$objs$old_deplibs\" && \\\n\t  func_fatal_error \"cannot build library object \\`$output' from non-libtool objects\"\n\n\tlibobj=$output\n\tfunc_lo2o \"$libobj\"\n\tobj=$func_lo2o_result\n\t;;\n      *)\n\tlibobj=\n\tobj=\"$output\"\n\t;;\n      esac\n\n      # Delete the old objects.\n      $opt_dry_run || $RM $obj $libobj\n\n      # Objects from convenience libraries.  This assumes\n      # single-version convenience libraries.  Whenever we create\n      # different ones for PIC/non-PIC, this we'll have to duplicate\n      # the extraction.\n      reload_conv_objs=\n      gentop=\n      # reload_cmds runs $LD directly, so let us get rid of\n      # -Wl from whole_archive_flag_spec and hope we can get by with\n      # turning comma into space..\n      wl=\n\n      if test -n \"$convenience\"; then\n\tif test -n \"$whole_archive_flag_spec\"; then\n\t  eval tmp_whole_archive_flags=\\\"$whole_archive_flag_spec\\\"\n\t  reload_conv_objs=$reload_objs\\ `$ECHO \"$tmp_whole_archive_flags\" | $SED 's|,| |g'`\n\telse\n\t  gentop=\"$output_objdir/${obj}x\"\n\t  func_append generated \" $gentop\"\n\n\t  func_extract_archives $gentop $convenience\n\t  reload_conv_objs=\"$reload_objs $func_extract_archives_result\"\n\tfi\n      fi\n\n      # If we're not building shared, we need to use non_pic_objs\n      test \"$build_libtool_libs\" != yes && libobjs=\"$non_pic_objects\"\n\n      # Create the old-style object.\n      reload_objs=\"$objs$old_deplibs \"`$ECHO \"$libobjs\" | $SP2NL | $SED \"/\\.${libext}$/d; /\\.lib$/d; $lo2o\" | $NL2SP`\" $reload_conv_objs\" ### testsuite: skip nested quoting test\n\n      output=\"$obj\"\n      func_execute_cmds \"$reload_cmds\" 'exit $?'\n\n      # Exit if we aren't doing a library object file.\n      if test -z \"$libobj\"; then\n\tif test -n \"$gentop\"; then\n\t  func_show_eval '${RM}r \"$gentop\"'\n\tfi\n\n\texit $EXIT_SUCCESS\n      fi\n\n      if test \"$build_libtool_libs\" != yes; then\n\tif test -n \"$gentop\"; then\n\t  func_show_eval '${RM}r \"$gentop\"'\n\tfi\n\n\t# Create an invalid libtool object if no PIC, so that we don't\n\t# accidentally link it into a program.\n\t# $show \"echo timestamp > $libobj\"\n\t# $opt_dry_run || eval \"echo timestamp > $libobj\" || exit $?\n\texit $EXIT_SUCCESS\n      fi\n\n      if test -n \"$pic_flag\" || test \"$pic_mode\" != default; then\n\t# Only do commands if we really have different PIC objects.\n\treload_objs=\"$libobjs $reload_conv_objs\"\n\toutput=\"$libobj\"\n\tfunc_execute_cmds \"$reload_cmds\" 'exit $?'\n      fi\n\n      if test -n \"$gentop\"; then\n\tfunc_show_eval '${RM}r \"$gentop\"'\n      fi\n\n      exit $EXIT_SUCCESS\n      ;;\n\n    prog)\n      case $host in\n\t*cygwin*) func_stripname '' '.exe' \"$output\"\n\t          output=$func_stripname_result.exe;;\n      esac\n      test -n \"$vinfo\" && \\\n\tfunc_warning \"\\`-version-info' is ignored for programs\"\n\n      test -n \"$release\" && \\\n\tfunc_warning \"\\`-release' is ignored for programs\"\n\n      test \"$preload\" = yes \\\n        && test \"$dlopen_support\" = unknown \\\n\t&& test \"$dlopen_self\" = unknown \\\n\t&& test \"$dlopen_self_static\" = unknown && \\\n\t  func_warning \"\\`LT_INIT([dlopen])' not used. Assuming no dlopen support.\"\n\n      case $host in\n      *-*-rhapsody* | *-*-darwin1.[012])\n\t# On Rhapsody replace the C library is the System framework\n\tcompile_deplibs=`$ECHO \" $compile_deplibs\" | $SED 's/ -lc / System.ltframework /'`\n\tfinalize_deplibs=`$ECHO \" $finalize_deplibs\" | $SED 's/ -lc / System.ltframework /'`\n\t;;\n      esac\n\n      case $host in\n      *-*-darwin*)\n\t# Don't allow lazy linking, it breaks C++ global constructors\n\t# But is supposedly fixed on 10.4 or later (yay!).\n\tif test \"$tagname\" = CXX ; then\n\t  case ${MACOSX_DEPLOYMENT_TARGET-10.0} in\n\t    10.[0123])\n\t      func_append compile_command \" ${wl}-bind_at_load\"\n\t      func_append finalize_command \" ${wl}-bind_at_load\"\n\t    ;;\n\t  esac\n\tfi\n\t# Time to change all our \"foo.ltframework\" stuff back to \"-framework foo\"\n\tcompile_deplibs=`$ECHO \" $compile_deplibs\" | $SED 's% \\([^ $]*\\).ltframework% -framework \\1%g'`\n\tfinalize_deplibs=`$ECHO \" $finalize_deplibs\" | $SED 's% \\([^ $]*\\).ltframework% -framework \\1%g'`\n\t;;\n      esac\n\n\n      # move library search paths that coincide with paths to not yet\n      # installed libraries to the beginning of the library search list\n      new_libs=\n      for path in $notinst_path; do\n\tcase \" $new_libs \" in\n\t*\" -L$path/$objdir \"*) ;;\n\t*)\n\t  case \" $compile_deplibs \" in\n\t  *\" -L$path/$objdir \"*)\n\t    func_append new_libs \" -L$path/$objdir\" ;;\n\t  esac\n\t  ;;\n\tesac\n      done\n      for deplib in $compile_deplibs; do\n\tcase $deplib in\n\t-L*)\n\t  case \" $new_libs \" in\n\t  *\" $deplib \"*) ;;\n\t  *) func_append new_libs \" $deplib\" ;;\n\t  esac\n\t  ;;\n\t*) func_append new_libs \" $deplib\" ;;\n\tesac\n      done\n      compile_deplibs=\"$new_libs\"\n\n\n      func_append compile_command \" $compile_deplibs\"\n      func_append finalize_command \" $finalize_deplibs\"\n\n      if test -n \"$rpath$xrpath\"; then\n\t# If the user specified any rpath flags, then add them.\n\tfor libdir in $rpath $xrpath; do\n\t  # This is the magic to use -rpath.\n\t  case \"$finalize_rpath \" in\n\t  *\" $libdir \"*) ;;\n\t  *) func_append finalize_rpath \" $libdir\" ;;\n\t  esac\n\tdone\n      fi\n\n      # Now hardcode the library paths\n      rpath=\n      hardcode_libdirs=\n      for libdir in $compile_rpath $finalize_rpath; do\n\tif test -n \"$hardcode_libdir_flag_spec\"; then\n\t  if test -n \"$hardcode_libdir_separator\"; then\n\t    if test -z \"$hardcode_libdirs\"; then\n\t      hardcode_libdirs=\"$libdir\"\n\t    else\n\t      # Just accumulate the unique libdirs.\n\t      case $hardcode_libdir_separator$hardcode_libdirs$hardcode_libdir_separator in\n\t      *\"$hardcode_libdir_separator$libdir$hardcode_libdir_separator\"*)\n\t\t;;\n\t      *)\n\t\tfunc_append hardcode_libdirs \"$hardcode_libdir_separator$libdir\"\n\t\t;;\n\t      esac\n\t    fi\n\t  else\n\t    eval flag=\\\"$hardcode_libdir_flag_spec\\\"\n\t    func_append rpath \" $flag\"\n\t  fi\n\telif test -n \"$runpath_var\"; then\n\t  case \"$perm_rpath \" in\n\t  *\" $libdir \"*) ;;\n\t  *) func_append perm_rpath \" $libdir\" ;;\n\t  esac\n\tfi\n\tcase $host in\n\t*-*-cygwin* | *-*-mingw* | *-*-pw32* | *-*-os2* | *-cegcc*)\n\t  testbindir=`${ECHO} \"$libdir\" | ${SED} -e 's*/lib$*/bin*'`\n\t  case :$dllsearchpath: in\n\t  *\":$libdir:\"*) ;;\n\t  ::) dllsearchpath=$libdir;;\n\t  *) func_append dllsearchpath \":$libdir\";;\n\t  esac\n\t  case :$dllsearchpath: in\n\t  *\":$testbindir:\"*) ;;\n\t  ::) dllsearchpath=$testbindir;;\n\t  *) func_append dllsearchpath \":$testbindir\";;\n\t  esac\n\t  ;;\n\tesac\n      done\n      # Substitute the hardcoded libdirs into the rpath.\n      if test -n \"$hardcode_libdir_separator\" &&\n\t test -n \"$hardcode_libdirs\"; then\n\tlibdir=\"$hardcode_libdirs\"\n\teval rpath=\\\" $hardcode_libdir_flag_spec\\\"\n      fi\n      compile_rpath=\"$rpath\"\n\n      rpath=\n      hardcode_libdirs=\n      for libdir in $finalize_rpath; do\n\tif test -n \"$hardcode_libdir_flag_spec\"; then\n\t  if test -n \"$hardcode_libdir_separator\"; then\n\t    if test -z \"$hardcode_libdirs\"; then\n\t      hardcode_libdirs=\"$libdir\"\n\t    else\n\t      # Just accumulate the unique libdirs.\n\t      case $hardcode_libdir_separator$hardcode_libdirs$hardcode_libdir_separator in\n\t      *\"$hardcode_libdir_separator$libdir$hardcode_libdir_separator\"*)\n\t\t;;\n\t      *)\n\t\tfunc_append hardcode_libdirs \"$hardcode_libdir_separator$libdir\"\n\t\t;;\n\t      esac\n\t    fi\n\t  else\n\t    eval flag=\\\"$hardcode_libdir_flag_spec\\\"\n\t    func_append rpath \" $flag\"\n\t  fi\n\telif test -n \"$runpath_var\"; then\n\t  case \"$finalize_perm_rpath \" in\n\t  *\" $libdir \"*) ;;\n\t  *) func_append finalize_perm_rpath \" $libdir\" ;;\n\t  esac\n\tfi\n      done\n      # Substitute the hardcoded libdirs into the rpath.\n      if test -n \"$hardcode_libdir_separator\" &&\n\t test -n \"$hardcode_libdirs\"; then\n\tlibdir=\"$hardcode_libdirs\"\n\teval rpath=\\\" $hardcode_libdir_flag_spec\\\"\n      fi\n      finalize_rpath=\"$rpath\"\n\n      if test -n \"$libobjs\" && test \"$build_old_libs\" = yes; then\n\t# Transform all the library objects into standard objects.\n\tcompile_command=`$ECHO \"$compile_command\" | $SP2NL | $SED \"$lo2o\" | $NL2SP`\n\tfinalize_command=`$ECHO \"$finalize_command\" | $SP2NL | $SED \"$lo2o\" | $NL2SP`\n      fi\n\n      func_generate_dlsyms \"$outputname\" \"@PROGRAM@\" \"no\"\n\n      # template prelinking step\n      if test -n \"$prelink_cmds\"; then\n\tfunc_execute_cmds \"$prelink_cmds\" 'exit $?'\n      fi\n\n      wrappers_required=yes\n      case $host in\n      *cegcc* | *mingw32ce*)\n        # Disable wrappers for cegcc and mingw32ce hosts, we are cross compiling anyway.\n        wrappers_required=no\n        ;;\n      *cygwin* | *mingw* )\n        if test \"$build_libtool_libs\" != yes; then\n          wrappers_required=no\n        fi\n        ;;\n      *)\n        if test \"$need_relink\" = no || test \"$build_libtool_libs\" != yes; then\n          wrappers_required=no\n        fi\n        ;;\n      esac\n      if test \"$wrappers_required\" = no; then\n\t# Replace the output file specification.\n\tcompile_command=`$ECHO \"$compile_command\" | $SED 's%@OUTPUT@%'\"$output\"'%g'`\n\tlink_command=\"$compile_command$compile_rpath\"\n\n\t# We have no uninstalled library dependencies, so finalize right now.\n\texit_status=0\n\tfunc_show_eval \"$link_command\" 'exit_status=$?'\n\n\tif test -n \"$postlink_cmds\"; then\n\t  func_to_tool_file \"$output\"\n\t  postlink_cmds=`func_echo_all \"$postlink_cmds\" | $SED -e 's%@OUTPUT@%'\"$output\"'%g' -e 's%@TOOL_OUTPUT@%'\"$func_to_tool_file_result\"'%g'`\n\t  func_execute_cmds \"$postlink_cmds\" 'exit $?'\n\tfi\n\n\t# Delete the generated files.\n\tif test -f \"$output_objdir/${outputname}S.${objext}\"; then\n\t  func_show_eval '$RM \"$output_objdir/${outputname}S.${objext}\"'\n\tfi\n\n\texit $exit_status\n      fi\n\n      if test -n \"$compile_shlibpath$finalize_shlibpath\"; then\n\tcompile_command=\"$shlibpath_var=\\\"$compile_shlibpath$finalize_shlibpath\\$$shlibpath_var\\\" $compile_command\"\n      fi\n      if test -n \"$finalize_shlibpath\"; then\n\tfinalize_command=\"$shlibpath_var=\\\"$finalize_shlibpath\\$$shlibpath_var\\\" $finalize_command\"\n      fi\n\n      compile_var=\n      finalize_var=\n      if test -n \"$runpath_var\"; then\n\tif test -n \"$perm_rpath\"; then\n\t  # We should set the runpath_var.\n\t  rpath=\n\t  for dir in $perm_rpath; do\n\t    func_append rpath \"$dir:\"\n\t  done\n\t  compile_var=\"$runpath_var=\\\"$rpath\\$$runpath_var\\\" \"\n\tfi\n\tif test -n \"$finalize_perm_rpath\"; then\n\t  # We should set the runpath_var.\n\t  rpath=\n\t  for dir in $finalize_perm_rpath; do\n\t    func_append rpath \"$dir:\"\n\t  done\n\t  finalize_var=\"$runpath_var=\\\"$rpath\\$$runpath_var\\\" \"\n\tfi\n      fi\n\n      if test \"$no_install\" = yes; then\n\t# We don't need to create a wrapper script.\n\tlink_command=\"$compile_var$compile_command$compile_rpath\"\n\t# Replace the output file specification.\n\tlink_command=`$ECHO \"$link_command\" | $SED 's%@OUTPUT@%'\"$output\"'%g'`\n\t# Delete the old output file.\n\t$opt_dry_run || $RM $output\n\t# Link the executable and exit\n\tfunc_show_eval \"$link_command\" 'exit $?'\n\n\tif test -n \"$postlink_cmds\"; then\n\t  func_to_tool_file \"$output\"\n\t  postlink_cmds=`func_echo_all \"$postlink_cmds\" | $SED -e 's%@OUTPUT@%'\"$output\"'%g' -e 's%@TOOL_OUTPUT@%'\"$func_to_tool_file_result\"'%g'`\n\t  func_execute_cmds \"$postlink_cmds\" 'exit $?'\n\tfi\n\n\texit $EXIT_SUCCESS\n      fi\n\n      if test \"$hardcode_action\" = relink; then\n\t# Fast installation is not supported\n\tlink_command=\"$compile_var$compile_command$compile_rpath\"\n\trelink_command=\"$finalize_var$finalize_command$finalize_rpath\"\n\n\tfunc_warning \"this platform does not like uninstalled shared libraries\"\n\tfunc_warning \"\\`$output' will be relinked during installation\"\n      else\n\tif test \"$fast_install\" != no; then\n\t  link_command=\"$finalize_var$compile_command$finalize_rpath\"\n\t  if test \"$fast_install\" = yes; then\n\t    relink_command=`$ECHO \"$compile_var$compile_command$compile_rpath\" | $SED 's%@OUTPUT@%\\$progdir/\\$file%g'`\n\t  else\n\t    # fast_install is set to needless\n\t    relink_command=\n\t  fi\n\telse\n\t  link_command=\"$compile_var$compile_command$compile_rpath\"\n\t  relink_command=\"$finalize_var$finalize_command$finalize_rpath\"\n\tfi\n      fi\n\n      # Replace the output file specification.\n      link_command=`$ECHO \"$link_command\" | $SED 's%@OUTPUT@%'\"$output_objdir/$outputname\"'%g'`\n\n      # Delete the old output files.\n      $opt_dry_run || $RM $output $output_objdir/$outputname $output_objdir/lt-$outputname\n\n      func_show_eval \"$link_command\" 'exit $?'\n\n      if test -n \"$postlink_cmds\"; then\n\tfunc_to_tool_file \"$output_objdir/$outputname\"\n\tpostlink_cmds=`func_echo_all \"$postlink_cmds\" | $SED -e 's%@OUTPUT@%'\"$output_objdir/$outputname\"'%g' -e 's%@TOOL_OUTPUT@%'\"$func_to_tool_file_result\"'%g'`\n\tfunc_execute_cmds \"$postlink_cmds\" 'exit $?'\n      fi\n\n      # Now create the wrapper script.\n      func_verbose \"creating $output\"\n\n      # Quote the relink command for shipping.\n      if test -n \"$relink_command\"; then\n\t# Preserve any variables that may affect compiler behavior\n\tfor var in $variables_saved_for_relink; do\n\t  if eval test -z \\\"\\${$var+set}\\\"; then\n\t    relink_command=\"{ test -z \\\"\\${$var+set}\\\" || $lt_unset $var || { $var=; export $var; }; }; $relink_command\"\n\t  elif eval var_value=\\$$var; test -z \"$var_value\"; then\n\t    relink_command=\"$var=; export $var; $relink_command\"\n\t  else\n\t    func_quote_for_eval \"$var_value\"\n\t    relink_command=\"$var=$func_quote_for_eval_result; export $var; $relink_command\"\n\t  fi\n\tdone\n\trelink_command=\"(cd `pwd`; $relink_command)\"\n\trelink_command=`$ECHO \"$relink_command\" | $SED \"$sed_quote_subst\"`\n      fi\n\n      # Only actually do things if not in dry run mode.\n      $opt_dry_run || {\n\t# win32 will think the script is a binary if it has\n\t# a .exe suffix, so we strip it off here.\n\tcase $output in\n\t  *.exe) func_stripname '' '.exe' \"$output\"\n\t         output=$func_stripname_result ;;\n\tesac\n\t# test for cygwin because mv fails w/o .exe extensions\n\tcase $host in\n\t  *cygwin*)\n\t    exeext=.exe\n\t    func_stripname '' '.exe' \"$outputname\"\n\t    outputname=$func_stripname_result ;;\n\t  *) exeext= ;;\n\tesac\n\tcase $host in\n\t  *cygwin* | *mingw* )\n\t    func_dirname_and_basename \"$output\" \"\" \".\"\n\t    output_name=$func_basename_result\n\t    output_path=$func_dirname_result\n\t    cwrappersource=\"$output_path/$objdir/lt-$output_name.c\"\n\t    cwrapper=\"$output_path/$output_name.exe\"\n\t    $RM $cwrappersource $cwrapper\n\t    trap \"$RM $cwrappersource $cwrapper; exit $EXIT_FAILURE\" 1 2 15\n\n\t    func_emit_cwrapperexe_src > $cwrappersource\n\n\t    # The wrapper executable is built using the $host compiler,\n\t    # because it contains $host paths and files. If cross-\n\t    # compiling, it, like the target executable, must be\n\t    # executed on the $host or under an emulation environment.\n\t    $opt_dry_run || {\n\t      $LTCC $LTCFLAGS -o $cwrapper $cwrappersource\n\t      $STRIP $cwrapper\n\t    }\n\n\t    # Now, create the wrapper script for func_source use:\n\t    func_ltwrapper_scriptname $cwrapper\n\t    $RM $func_ltwrapper_scriptname_result\n\t    trap \"$RM $func_ltwrapper_scriptname_result; exit $EXIT_FAILURE\" 1 2 15\n\t    $opt_dry_run || {\n\t      # note: this script will not be executed, so do not chmod.\n\t      if test \"x$build\" = \"x$host\" ; then\n\t\t$cwrapper --lt-dump-script > $func_ltwrapper_scriptname_result\n\t      else\n\t\tfunc_emit_wrapper no > $func_ltwrapper_scriptname_result\n\t      fi\n\t    }\n\t  ;;\n\t  * )\n\t    $RM $output\n\t    trap \"$RM $output; exit $EXIT_FAILURE\" 1 2 15\n\n\t    func_emit_wrapper no > $output\n\t    chmod +x $output\n\t  ;;\n\tesac\n      }\n      exit $EXIT_SUCCESS\n      ;;\n    esac\n\n    # See if we need to build an old-fashioned archive.\n    for oldlib in $oldlibs; do\n\n      if test \"$build_libtool_libs\" = convenience; then\n\toldobjs=\"$libobjs_save $symfileobj\"\n\taddlibs=\"$convenience\"\n\tbuild_libtool_libs=no\n      else\n\tif test \"$build_libtool_libs\" = module; then\n\t  oldobjs=\"$libobjs_save\"\n\t  build_libtool_libs=no\n\telse\n\t  oldobjs=\"$old_deplibs $non_pic_objects\"\n\t  if test \"$preload\" = yes && test -f \"$symfileobj\"; then\n\t    func_append oldobjs \" $symfileobj\"\n\t  fi\n\tfi\n\taddlibs=\"$old_convenience\"\n      fi\n\n      if test -n \"$addlibs\"; then\n\tgentop=\"$output_objdir/${outputname}x\"\n\tfunc_append generated \" $gentop\"\n\n\tfunc_extract_archives $gentop $addlibs\n\tfunc_append oldobjs \" $func_extract_archives_result\"\n      fi\n\n      # Do each command in the archive commands.\n      if test -n \"$old_archive_from_new_cmds\" && test \"$build_libtool_libs\" = yes; then\n\tcmds=$old_archive_from_new_cmds\n      else\n\n\t# Add any objects from preloaded convenience libraries\n\tif test -n \"$dlprefiles\"; then\n\t  gentop=\"$output_objdir/${outputname}x\"\n\t  func_append generated \" $gentop\"\n\n\t  func_extract_archives $gentop $dlprefiles\n\t  func_append oldobjs \" $func_extract_archives_result\"\n\tfi\n\n\t# POSIX demands no paths to be encoded in archives.  We have\n\t# to avoid creating archives with duplicate basenames if we\n\t# might have to extract them afterwards, e.g., when creating a\n\t# static archive out of a convenience library, or when linking\n\t# the entirety of a libtool archive into another (currently\n\t# not supported by libtool).\n\tif (for obj in $oldobjs\n\t    do\n\t      func_basename \"$obj\"\n\t      $ECHO \"$func_basename_result\"\n\t    done | sort | sort -uc >/dev/null 2>&1); then\n\t  :\n\telse\n\t  echo \"copying selected object files to avoid basename conflicts...\"\n\t  gentop=\"$output_objdir/${outputname}x\"\n\t  func_append generated \" $gentop\"\n\t  func_mkdir_p \"$gentop\"\n\t  save_oldobjs=$oldobjs\n\t  oldobjs=\n\t  counter=1\n\t  for obj in $save_oldobjs\n\t  do\n\t    func_basename \"$obj\"\n\t    objbase=\"$func_basename_result\"\n\t    case \" $oldobjs \" in\n\t    \" \") oldobjs=$obj ;;\n\t    *[\\ /]\"$objbase \"*)\n\t      while :; do\n\t\t# Make sure we don't pick an alternate name that also\n\t\t# overlaps.\n\t\tnewobj=lt$counter-$objbase\n\t\tfunc_arith $counter + 1\n\t\tcounter=$func_arith_result\n\t\tcase \" $oldobjs \" in\n\t\t*[\\ /]\"$newobj \"*) ;;\n\t\t*) if test ! -f \"$gentop/$newobj\"; then break; fi ;;\n\t\tesac\n\t      done\n\t      func_show_eval \"ln $obj $gentop/$newobj || cp $obj $gentop/$newobj\"\n\t      func_append oldobjs \" $gentop/$newobj\"\n\t      ;;\n\t    *) func_append oldobjs \" $obj\" ;;\n\t    esac\n\t  done\n\tfi\n\tfunc_to_tool_file \"$oldlib\" func_convert_file_msys_to_w32\n\ttool_oldlib=$func_to_tool_file_result\n\teval cmds=\\\"$old_archive_cmds\\\"\n\n\tfunc_len \" $cmds\"\n\tlen=$func_len_result\n\tif test \"$len\" -lt \"$max_cmd_len\" || test \"$max_cmd_len\" -le -1; then\n\t  cmds=$old_archive_cmds\n\telif test -n \"$archiver_list_spec\"; then\n\t  func_verbose \"using command file archive linking...\"\n\t  for obj in $oldobjs\n\t  do\n\t    func_to_tool_file \"$obj\"\n\t    $ECHO \"$func_to_tool_file_result\"\n\t  done > $output_objdir/$libname.libcmd\n\t  func_to_tool_file \"$output_objdir/$libname.libcmd\"\n\t  oldobjs=\" $archiver_list_spec$func_to_tool_file_result\"\n\t  cmds=$old_archive_cmds\n\telse\n\t  # the command line is too long to link in one step, link in parts\n\t  func_verbose \"using piecewise archive linking...\"\n\t  save_RANLIB=$RANLIB\n\t  RANLIB=:\n\t  objlist=\n\t  concat_cmds=\n\t  save_oldobjs=$oldobjs\n\t  oldobjs=\n\t  # Is there a better way of finding the last object in the list?\n\t  for obj in $save_oldobjs\n\t  do\n\t    last_oldobj=$obj\n\t  done\n\t  eval test_cmds=\\\"$old_archive_cmds\\\"\n\t  func_len \" $test_cmds\"\n\t  len0=$func_len_result\n\t  len=$len0\n\t  for obj in $save_oldobjs\n\t  do\n\t    func_len \" $obj\"\n\t    func_arith $len + $func_len_result\n\t    len=$func_arith_result\n\t    func_append objlist \" $obj\"\n\t    if test \"$len\" -lt \"$max_cmd_len\"; then\n\t      :\n\t    else\n\t      # the above command should be used before it gets too long\n\t      oldobjs=$objlist\n\t      if test \"$obj\" = \"$last_oldobj\" ; then\n\t\tRANLIB=$save_RANLIB\n\t      fi\n\t      test -z \"$concat_cmds\" || concat_cmds=$concat_cmds~\n\t      eval concat_cmds=\\\"\\${concat_cmds}$old_archive_cmds\\\"\n\t      objlist=\n\t      len=$len0\n\t    fi\n\t  done\n\t  RANLIB=$save_RANLIB\n\t  oldobjs=$objlist\n\t  if test \"X$oldobjs\" = \"X\" ; then\n\t    eval cmds=\\\"\\$concat_cmds\\\"\n\t  else\n\t    eval cmds=\\\"\\$concat_cmds~\\$old_archive_cmds\\\"\n\t  fi\n\tfi\n      fi\n      func_execute_cmds \"$cmds\" 'exit $?'\n    done\n\n    test -n \"$generated\" && \\\n      func_show_eval \"${RM}r$generated\"\n\n    # Now create the libtool archive.\n    case $output in\n    *.la)\n      old_library=\n      test \"$build_old_libs\" = yes && old_library=\"$libname.$libext\"\n      func_verbose \"creating $output\"\n\n      # Preserve any variables that may affect compiler behavior\n      for var in $variables_saved_for_relink; do\n\tif eval test -z \\\"\\${$var+set}\\\"; then\n\t  relink_command=\"{ test -z \\\"\\${$var+set}\\\" || $lt_unset $var || { $var=; export $var; }; }; $relink_command\"\n\telif eval var_value=\\$$var; test -z \"$var_value\"; then\n\t  relink_command=\"$var=; export $var; $relink_command\"\n\telse\n\t  func_quote_for_eval \"$var_value\"\n\t  relink_command=\"$var=$func_quote_for_eval_result; export $var; $relink_command\"\n\tfi\n      done\n      # Quote the link command for shipping.\n      relink_command=\"(cd `pwd`; $SHELL $progpath $preserve_args --mode=relink $libtool_args @inst_prefix_dir@)\"\n      relink_command=`$ECHO \"$relink_command\" | $SED \"$sed_quote_subst\"`\n      if test \"$hardcode_automatic\" = yes ; then\n\trelink_command=\n      fi\n\n      # Only create the output if not a dry run.\n      $opt_dry_run || {\n\tfor installed in no yes; do\n\t  if test \"$installed\" = yes; then\n\t    if test -z \"$install_libdir\"; then\n\t      break\n\t    fi\n\t    output=\"$output_objdir/$outputname\"i\n\t    # Replace all uninstalled libtool libraries with the installed ones\n\t    newdependency_libs=\n\t    for deplib in $dependency_libs; do\n\t      case $deplib in\n\t      *.la)\n\t\tfunc_basename \"$deplib\"\n\t\tname=\"$func_basename_result\"\n\t\tfunc_resolve_sysroot \"$deplib\"\n\t\teval libdir=`${SED} -n -e 's/^libdir=\\(.*\\)$/\\1/p' $func_resolve_sysroot_result`\n\t\ttest -z \"$libdir\" && \\\n\t\t  func_fatal_error \"\\`$deplib' is not a valid libtool archive\"\n\t\tfunc_append newdependency_libs \" ${lt_sysroot:+=}$libdir/$name\"\n\t\t;;\n\t      -L*)\n\t\tfunc_stripname -L '' \"$deplib\"\n\t\tfunc_replace_sysroot \"$func_stripname_result\"\n\t\tfunc_append newdependency_libs \" -L$func_replace_sysroot_result\"\n\t\t;;\n\t      -R*)\n\t\tfunc_stripname -R '' \"$deplib\"\n\t\tfunc_replace_sysroot \"$func_stripname_result\"\n\t\tfunc_append newdependency_libs \" -R$func_replace_sysroot_result\"\n\t\t;;\n\t      *) func_append newdependency_libs \" $deplib\" ;;\n\t      esac\n\t    done\n\t    dependency_libs=\"$newdependency_libs\"\n\t    newdlfiles=\n\n\t    for lib in $dlfiles; do\n\t      case $lib in\n\t      *.la)\n\t        func_basename \"$lib\"\n\t\tname=\"$func_basename_result\"\n\t\teval libdir=`${SED} -n -e 's/^libdir=\\(.*\\)$/\\1/p' $lib`\n\t\ttest -z \"$libdir\" && \\\n\t\t  func_fatal_error \"\\`$lib' is not a valid libtool archive\"\n\t\tfunc_append newdlfiles \" ${lt_sysroot:+=}$libdir/$name\"\n\t\t;;\n\t      *) func_append newdlfiles \" $lib\" ;;\n\t      esac\n\t    done\n\t    dlfiles=\"$newdlfiles\"\n\t    newdlprefiles=\n\t    for lib in $dlprefiles; do\n\t      case $lib in\n\t      *.la)\n\t\t# Only pass preopened files to the pseudo-archive (for\n\t\t# eventual linking with the app. that links it) if we\n\t\t# didn't already link the preopened objects directly into\n\t\t# the library:\n\t\tfunc_basename \"$lib\"\n\t\tname=\"$func_basename_result\"\n\t\teval libdir=`${SED} -n -e 's/^libdir=\\(.*\\)$/\\1/p' $lib`\n\t\ttest -z \"$libdir\" && \\\n\t\t  func_fatal_error \"\\`$lib' is not a valid libtool archive\"\n\t\tfunc_append newdlprefiles \" ${lt_sysroot:+=}$libdir/$name\"\n\t\t;;\n\t      esac\n\t    done\n\t    dlprefiles=\"$newdlprefiles\"\n\t  else\n\t    newdlfiles=\n\t    for lib in $dlfiles; do\n\t      case $lib in\n\t\t[\\\\/]* | [A-Za-z]:[\\\\/]*) abs=\"$lib\" ;;\n\t\t*) abs=`pwd`\"/$lib\" ;;\n\t      esac\n\t      func_append newdlfiles \" $abs\"\n\t    done\n\t    dlfiles=\"$newdlfiles\"\n\t    newdlprefiles=\n\t    for lib in $dlprefiles; do\n\t      case $lib in\n\t\t[\\\\/]* | [A-Za-z]:[\\\\/]*) abs=\"$lib\" ;;\n\t\t*) abs=`pwd`\"/$lib\" ;;\n\t      esac\n\t      func_append newdlprefiles \" $abs\"\n\t    done\n\t    dlprefiles=\"$newdlprefiles\"\n\t  fi\n\t  $RM $output\n\t  # place dlname in correct position for cygwin\n\t  # In fact, it would be nice if we could use this code for all target\n\t  # systems that can't hard-code library paths into their executables\n\t  # and that have no shared library path variable independent of PATH,\n\t  # but it turns out we can't easily determine that from inspecting\n\t  # libtool variables, so we have to hard-code the OSs to which it\n\t  # applies here; at the moment, that means platforms that use the PE\n\t  # object format with DLL files.  See the long comment at the top of\n\t  # tests/bindir.at for full details.\n\t  tdlname=$dlname\n\t  case $host,$output,$installed,$module,$dlname in\n\t    *cygwin*,*lai,yes,no,*.dll | *mingw*,*lai,yes,no,*.dll | *cegcc*,*lai,yes,no,*.dll)\n\t      # If a -bindir argument was supplied, place the dll there.\n\t      if test \"x$bindir\" != x ;\n\t      then\n\t\tfunc_relative_path \"$install_libdir\" \"$bindir\"\n\t\ttdlname=$func_relative_path_result$dlname\n\t      else\n\t\t# Otherwise fall back on heuristic.\n\t\ttdlname=../bin/$dlname\n\t      fi\n\t      ;;\n\t  esac\n\t  $ECHO > $output \"\\\n# $outputname - a libtool library file\n# Generated by $PROGRAM (GNU $PACKAGE$TIMESTAMP) $VERSION\n#\n# Please DO NOT delete this file!\n# It is necessary for linking the library.\n\n# The name that we can dlopen(3).\ndlname='$tdlname'\n\n# Names of this library.\nlibrary_names='$library_names'\n\n# The name of the static archive.\nold_library='$old_library'\n\n# Linker flags that can not go in dependency_libs.\ninherited_linker_flags='$new_inherited_linker_flags'\n\n# Libraries that this one depends upon.\ndependency_libs='$dependency_libs'\n\n# Names of additional weak libraries provided by this library\nweak_library_names='$weak_libs'\n\n# Version information for $libname.\ncurrent=$current\nage=$age\nrevision=$revision\n\n# Is this an already installed library?\ninstalled=$installed\n\n# Should we warn about portability when linking against -modules?\nshouldnotlink=$module\n\n# Files to dlopen/dlpreopen\ndlopen='$dlfiles'\ndlpreopen='$dlprefiles'\n\n# Directory that this library needs to be installed in:\nlibdir='$install_libdir'\"\n\t  if test \"$installed\" = no && test \"$need_relink\" = yes; then\n\t    $ECHO >> $output \"\\\nrelink_command=\\\"$relink_command\\\"\"\n\t  fi\n\tdone\n      }\n\n      # Do a symbolic link so that the libtool archive can be found in\n      # LD_LIBRARY_PATH before the program is installed.\n      func_show_eval '( cd \"$output_objdir\" && $RM \"$outputname\" && $LN_S \"../$outputname\" \"$outputname\" )' 'exit $?'\n      ;;\n    esac\n    exit $EXIT_SUCCESS\n}\n\n{ test \"$opt_mode\" = link || test \"$opt_mode\" = relink; } &&\n    func_mode_link ${1+\"$@\"}\n\n\n# func_mode_uninstall arg...\nfunc_mode_uninstall ()\n{\n    $opt_debug\n    RM=\"$nonopt\"\n    files=\n    rmforce=\n    exit_status=0\n\n    # This variable tells wrapper scripts just to set variables rather\n    # than running their programs.\n    libtool_install_magic=\"$magic\"\n\n    for arg\n    do\n      case $arg in\n      -f) func_append RM \" $arg\"; rmforce=yes ;;\n      -*) func_append RM \" $arg\" ;;\n      *) func_append files \" $arg\" ;;\n      esac\n    done\n\n    test -z \"$RM\" && \\\n      func_fatal_help \"you must specify an RM program\"\n\n    rmdirs=\n\n    for file in $files; do\n      func_dirname \"$file\" \"\" \".\"\n      dir=\"$func_dirname_result\"\n      if test \"X$dir\" = X.; then\n\todir=\"$objdir\"\n      else\n\todir=\"$dir/$objdir\"\n      fi\n      func_basename \"$file\"\n      name=\"$func_basename_result\"\n      test \"$opt_mode\" = uninstall && odir=\"$dir\"\n\n      # Remember odir for removal later, being careful to avoid duplicates\n      if test \"$opt_mode\" = clean; then\n\tcase \" $rmdirs \" in\n\t  *\" $odir \"*) ;;\n\t  *) func_append rmdirs \" $odir\" ;;\n\tesac\n      fi\n\n      # Don't error if the file doesn't exist and rm -f was used.\n      if { test -L \"$file\"; } >/dev/null 2>&1 ||\n\t { test -h \"$file\"; } >/dev/null 2>&1 ||\n\t test -f \"$file\"; then\n\t:\n      elif test -d \"$file\"; then\n\texit_status=1\n\tcontinue\n      elif test \"$rmforce\" = yes; then\n\tcontinue\n      fi\n\n      rmfiles=\"$file\"\n\n      case $name in\n      *.la)\n\t# Possibly a libtool archive, so verify it.\n\tif func_lalib_p \"$file\"; then\n\t  func_source $dir/$name\n\n\t  # Delete the libtool libraries and symlinks.\n\t  for n in $library_names; do\n\t    func_append rmfiles \" $odir/$n\"\n\t  done\n\t  test -n \"$old_library\" && func_append rmfiles \" $odir/$old_library\"\n\n\t  case \"$opt_mode\" in\n\t  clean)\n\t    case \" $library_names \" in\n\t    *\" $dlname \"*) ;;\n\t    *) test -n \"$dlname\" && func_append rmfiles \" $odir/$dlname\" ;;\n\t    esac\n\t    test -n \"$libdir\" && func_append rmfiles \" $odir/$name $odir/${name}i\"\n\t    ;;\n\t  uninstall)\n\t    if test -n \"$library_names\"; then\n\t      # Do each command in the postuninstall commands.\n\t      func_execute_cmds \"$postuninstall_cmds\" 'test \"$rmforce\" = yes || exit_status=1'\n\t    fi\n\n\t    if test -n \"$old_library\"; then\n\t      # Do each command in the old_postuninstall commands.\n\t      func_execute_cmds \"$old_postuninstall_cmds\" 'test \"$rmforce\" = yes || exit_status=1'\n\t    fi\n\t    # FIXME: should reinstall the best remaining shared library.\n\t    ;;\n\t  esac\n\tfi\n\t;;\n\n      *.lo)\n\t# Possibly a libtool object, so verify it.\n\tif func_lalib_p \"$file\"; then\n\n\t  # Read the .lo file\n\t  func_source $dir/$name\n\n\t  # Add PIC object to the list of files to remove.\n\t  if test -n \"$pic_object\" &&\n\t     test \"$pic_object\" != none; then\n\t    func_append rmfiles \" $dir/$pic_object\"\n\t  fi\n\n\t  # Add non-PIC object to the list of files to remove.\n\t  if test -n \"$non_pic_object\" &&\n\t     test \"$non_pic_object\" != none; then\n\t    func_append rmfiles \" $dir/$non_pic_object\"\n\t  fi\n\tfi\n\t;;\n\n      *)\n\tif test \"$opt_mode\" = clean ; then\n\t  noexename=$name\n\t  case $file in\n\t  *.exe)\n\t    func_stripname '' '.exe' \"$file\"\n\t    file=$func_stripname_result\n\t    func_stripname '' '.exe' \"$name\"\n\t    noexename=$func_stripname_result\n\t    # $file with .exe has already been added to rmfiles,\n\t    # add $file without .exe\n\t    func_append rmfiles \" $file\"\n\t    ;;\n\t  esac\n\t  # Do a test to see if this is a libtool program.\n\t  if func_ltwrapper_p \"$file\"; then\n\t    if func_ltwrapper_executable_p \"$file\"; then\n\t      func_ltwrapper_scriptname \"$file\"\n\t      relink_command=\n\t      func_source $func_ltwrapper_scriptname_result\n\t      func_append rmfiles \" $func_ltwrapper_scriptname_result\"\n\t    else\n\t      relink_command=\n\t      func_source $dir/$noexename\n\t    fi\n\n\t    # note $name still contains .exe if it was in $file originally\n\t    # as does the version of $file that was added into $rmfiles\n\t    func_append rmfiles \" $odir/$name $odir/${name}S.${objext}\"\n\t    if test \"$fast_install\" = yes && test -n \"$relink_command\"; then\n\t      func_append rmfiles \" $odir/lt-$name\"\n\t    fi\n\t    if test \"X$noexename\" != \"X$name\" ; then\n\t      func_append rmfiles \" $odir/lt-${noexename}.c\"\n\t    fi\n\t  fi\n\tfi\n\t;;\n      esac\n      func_show_eval \"$RM $rmfiles\" 'exit_status=1'\n    done\n\n    # Try to remove the ${objdir}s in the directories where we deleted files\n    for dir in $rmdirs; do\n      if test -d \"$dir\"; then\n\tfunc_show_eval \"rmdir $dir >/dev/null 2>&1\"\n      fi\n    done\n\n    exit $exit_status\n}\n\n{ test \"$opt_mode\" = uninstall || test \"$opt_mode\" = clean; } &&\n    func_mode_uninstall ${1+\"$@\"}\n\ntest -z \"$opt_mode\" && {\n  help=\"$generic_help\"\n  func_fatal_help \"you must specify a MODE\"\n}\n\ntest -z \"$exec_cmd\" && \\\n  func_fatal_help \"invalid operation mode \\`$opt_mode'\"\n\nif test -n \"$exec_cmd\"; then\n  eval exec \"$exec_cmd\"\n  exit $EXIT_FAILURE\nfi\n\nexit $exit_status\n\n\n# The TAGs below are defined such that we never get into a situation\n# in which we disable both kinds of libraries.  Given conflicting\n# choices, we go for a static library, that is the most portable,\n# since we can't tell whether shared libraries were disabled because\n# the user asked for that or because the platform doesn't support\n# them.  This is particularly important on AIX, because we don't\n# support having both static and shared libraries enabled at the same\n# time on that platform, so we default to a shared-only configuration.\n# If a disable-shared tag is given, we'll fallback to a static-only\n# configuration.  But we'll never go from static-only to shared-only.\n\n# ### BEGIN LIBTOOL TAG CONFIG: disable-shared\nbuild_libtool_libs=no\nbuild_old_libs=yes\n# ### END LIBTOOL TAG CONFIG: disable-shared\n\n# ### BEGIN LIBTOOL TAG CONFIG: disable-static\nbuild_old_libs=`case $build_libtool_libs in yes) echo no;; *) echo yes;; esac`\n# ### END LIBTOOL TAG CONFIG: disable-static\n\n# Local Variables:\n# mode:shell-script\n# sh-indentation:2\n# End:\n# vi:sw=2\n\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/m4/ac_python_devel.m4",
    "content": "dnl @synopsis AC_PYTHON_DEVEL([version])\ndnl\ndnl Note: Defines as a precious variable \"PYTHON_VERSION\". Don't\ndnl override it in your configure.ac.\ndnl\ndnl This macro checks for Python and tries to get the include path to\ndnl 'Python.h'. It provides the $(PYTHON_CPPFLAGS) and\ndnl $(PYTHON_LDFLAGS) output variables. It also exports\ndnl $(PYTHON_EXTRA_LIBS) and $(PYTHON_EXTRA_LDFLAGS) for embedding\ndnl Python in your code.\ndnl\ndnl You can search for some particular version of Python by passing a\ndnl parameter to this macro, for example \">= '2.3.1'\", or \"== '2.4'\".\ndnl Please note that you *have* to pass also an operator along with the\ndnl version to match, and pay special attention to the single quotes\ndnl surrounding the version number. Don't use \"PYTHON_VERSION\" for\ndnl this: that environment variable is declared as precious and thus\ndnl reserved for the end-user.\ndnl\ndnl This macro should work for all versions of Python >= 2.1.0. As an\ndnl end user, you can disable the check for the python version by\ndnl setting the PYTHON_NOVERSIONCHECK environment variable to something\ndnl else than the empty string.\ndnl\ndnl If you need to use this macro for an older Python version, please\ndnl contact the authors. We're always open for feedback.\ndnl\ndnl @category InstalledPackages\ndnl @author Sebastian Huber <sebastian-huber@web.de>\ndnl @author Alan W. Irwin <irwin@beluga.phys.uvic.ca>\ndnl @author Rafael Laboissiere <laboissiere@psy.mpg.de>\ndnl @author Andrew Collier <colliera@nu.ac.za>\ndnl @author Matteo Settenvini <matteo@member.fsf.org>\ndnl @author Horst Knorr <hk_classes@knoda.org>\ndnl @version 2006-05-27\ndnl @license GPLWithACException\n\nAC_DEFUN([AC_PYTHON_DEVEL],[\n\t#\n\t# Allow the use of a (user set) custom python version\n\t#\n\tAC_ARG_VAR([PYTHON_VERSION],[The installed Python\n\t\tversion to use, for example '2.3'. This string\n\t\twill be appended to the Python interpreter\n\t\tcanonical name.])\n\n\tAC_PATH_PROG([PYTHON],[python[$PYTHON_VERSION]])\n\tif test -z \"$PYTHON\"; then\n\t   AC_MSG_ERROR([Cannot find python$PYTHON_VERSION in your system path])\n\t   PYTHON_VERSION=\"\"\n\tfi\n\n\t#\n\t# Check for a version of Python >= 2.1.0\n\t#\n\tAC_MSG_CHECKING([for a version of Python >= '2.1.0'])\n\tac_supports_python_ver=`$PYTHON -c \"import sys, string; \\\n\t\tver = string.split(sys.version)[[0]]; \\\n\t\tprint ver >= '2.1.0'\"`\n\tif test \"$ac_supports_python_ver\" != \"True\"; then\n\t\tif test -z \"$PYTHON_NOVERSIONCHECK\"; then\n\t\t\tAC_MSG_RESULT([no])\n\t\t\tAC_MSG_FAILURE([\nThis version of the AC@&t@_PYTHON_DEVEL macro\ndoesn't work properly with versions of Python before\n2.1.0. You may need to re-run configure, setting the\nvariables PYTHON_CPPFLAGS, PYTHON_LDFLAGS, PYTHON_SITE_PKG,\nPYTHON_EXTRA_LIBS and PYTHON_EXTRA_LDFLAGS by hand.\nMoreover, to disable this check, set PYTHON_NOVERSIONCHECK\nto something else than an empty string.\n])\n\t\telse\n\t\t\tAC_MSG_RESULT([skip at user request])\n\t\tfi\n\telse\n\t\tAC_MSG_RESULT([yes])\n\tfi\n\n\t#\n\t# if the macro parameter ``version'' is set, honour it\n\t#\n\tif test -n \"$1\"; then\n\t\tAC_MSG_CHECKING([for a version of Python $1])\n\t\tac_supports_python_ver=`$PYTHON -c \"import sys, string; \\\n\t\t\tver = string.split(sys.version)[[0]]; \\\n\t\t\tprint ver $1\"`\n\t\tif test \"$ac_supports_python_ver\" = \"True\"; then\n\t   \t   AC_MSG_RESULT([yes])\n\t\telse\n\t\t\tAC_MSG_RESULT([no])\n\t\t\tAC_MSG_ERROR([this package requires Python $1.\nIf you have it installed, but it isn't the default Python\ninterpreter in your system path, please pass the PYTHON_VERSION\nvariable to configure. See ``configure --help'' for reference.\n])\n\t\t\tPYTHON_VERSION=\"\"\n\t\tfi\n\tfi\n\n\t#\n\t# Check if you have distutils, else fail\n\t#\n\tAC_MSG_CHECKING([for the distutils Python package])\n\tac_distutils_result=`$PYTHON -c \"import distutils\" 2>&1`\n\tif test -z \"$ac_distutils_result\"; then\n\t\tAC_MSG_RESULT([yes])\n\telse\n\t\tAC_MSG_RESULT([no])\n\t\tAC_MSG_ERROR([cannot import Python module \"distutils\".\nPlease check your Python installation. The error was:\n$ac_distutils_result])\n\t\tPYTHON_VERSION=\"\"\n\tfi\n\n\t#\n\t# Check for Python include path\n\t#\n\tAC_MSG_CHECKING([for Python include path])\n\tif test -z \"$PYTHON_CPPFLAGS\"; then\n\t\tpython_path=`$PYTHON -c \"import distutils.sysconfig; \\\n           \t\tprint distutils.sysconfig.get_python_inc();\"`\n\t\tif test -n \"${python_path}\"; then\n\t\t   \tpython_path=\"-I$python_path\"\n\t\tfi\n\t\tPYTHON_CPPFLAGS=$python_path\n\tfi\n\tAC_MSG_RESULT([$PYTHON_CPPFLAGS])\n\tAC_SUBST([PYTHON_CPPFLAGS])\n\n\t#\n\t# Check for Python library path\n\t#\n\tAC_MSG_CHECKING([for Python library path])\n\tif test -z \"$PYTHON_LDFLAGS\"; then\n\t\t# (makes two attempts to ensure we've got a version number\n\t\t# from the interpreter)\n\t\tpy_version=`$PYTHON -c \"from distutils.sysconfig import *; \\\n\t\t\tfrom string import join; \\\n\t\t\tprint join(get_config_vars('VERSION'))\"`\n\t\tif test \"$py_version\" == \"[None]\"; then\n\t\t\tif test -n \"$PYTHON_VERSION\"; then\n\t\t\t\tpy_version=$PYTHON_VERSION\n\t\t\telse\n\t\t\t\tpy_version=`$PYTHON -c \"import sys; \\\n\t\t\t\t\tprint sys.version[[:3]]\"`\n\t\t\tfi\n\t\tfi\n\n\t\tPYTHON_LDFLAGS=`$PYTHON -c \"from distutils.sysconfig import *; \\\n\t\t\tfrom string import join; \\\n\t\t\tprint '-L' + get_python_lib(0,1), \\\n\t\t      \t'-lpython';\"`$py_version\n\tfi\n\tAC_MSG_RESULT([$PYTHON_LDFLAGS])\n\tAC_SUBST([PYTHON_LDFLAGS])\n\n\t#\n\t# Check for site packages\n\t#\n\tAC_MSG_CHECKING([for Python site-packages path])\n\tif test -z \"$PYTHON_SITE_PKG\"; then\n\t\tPYTHON_SITE_PKG=`$PYTHON -c \"import distutils.sysconfig; \\\n\t\t        print distutils.sysconfig.get_python_lib(0,0);\"`\n\tfi\n\tAC_MSG_RESULT([$PYTHON_SITE_PKG])\n\tAC_SUBST([PYTHON_SITE_PKG])\n\n\t#\n\t# libraries which must be linked in when embedding\n\t#\n\tAC_MSG_CHECKING(python extra libraries)\n\tif test -z \"$PYTHON_EXTRA_LIBS\"; then\n\t   PYTHON_EXTRA_LIBS=`$PYTHON -c \"import distutils.sysconfig; \\\n                conf = distutils.sysconfig.get_config_var; \\\n                print conf('LOCALMODLIBS'), conf('LIBS')\"`\n\tfi\n\tAC_MSG_RESULT([$PYTHON_EXTRA_LIBS])\n\tAC_SUBST(PYTHON_EXTRA_LIBS)\n\n\t#\n\t# linking flags needed when embedding\n\t#\n\tAC_MSG_CHECKING(python extra linking flags)\n\tif test -z \"$PYTHON_EXTRA_LDFLAGS\"; then\n\t\tPYTHON_EXTRA_LDFLAGS=`$PYTHON -c \"import distutils.sysconfig; \\\n\t\t\tconf = distutils.sysconfig.get_config_var; \\\n\t\t\tprint conf('LINKFORSHARED')\"`\n\tfi\n\tAC_MSG_RESULT([$PYTHON_EXTRA_LDFLAGS])\n\tAC_SUBST(PYTHON_EXTRA_LDFLAGS)\n\n\t#\n\t# final check to see if everything compiles alright\n\t#\n\tAC_MSG_CHECKING([consistency of all components of python development environment])\n\tAC_LANG_PUSH([C])\n\t# save current global flags\n\tLIBS=\"$ac_save_LIBS $PYTHON_LDFLAGS\"\n\tCPPFLAGS=\"$ac_save_CPPFLAGS $PYTHON_CPPFLAGS\"\n\tAC_TRY_LINK([\n\t\t#include <Python.h>\n\t],[\n\t\tPy_Initialize();\n\t],[pythonexists=yes],[pythonexists=no])\n\n\tAC_MSG_RESULT([$pythonexists])\n\n        if test ! \"$pythonexists\" = \"yes\"; then\n\t   AC_MSG_ERROR([\n  Could not link test program to Python. Maybe the main Python library has been\n  installed in some non-standard library path. If so, pass it to configure,\n  via the LDFLAGS environment variable.\n  Example: ./configure LDFLAGS=\"-L/usr/non-standard-path/python/lib\"\n  ============================================================================\n   ERROR!\n   You probably have to install the development version of the Python package\n   for your distribution.  The exact name of this package varies among them.\n  ============================================================================\n\t   ])\n\t  PYTHON_VERSION=\"\"\n\tfi\n\tAC_LANG_POP\n\t# turn back to default flags\n\tCPPFLAGS=\"$ac_save_CPPFLAGS\"\n\tLIBS=\"$ac_save_LIBS\"\n\n\t#\n\t# all done!\n\t#\n])\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/m4/libtool.m4",
    "content": "# libtool.m4 - Configure libtool for the host system. -*-Autoconf-*-\n#\n#   Copyright (C) 1996, 1997, 1998, 1999, 2000, 2001, 2003, 2004, 2005,\n#                 2006, 2007, 2008, 2009, 2010, 2011 Free Software\n#                 Foundation, Inc.\n#   Written by Gordon Matzigkeit, 1996\n#\n# This file is free software; the Free Software Foundation gives\n# unlimited permission to copy and/or distribute it, with or without\n# modifications, as long as this notice is preserved.\n\nm4_define([_LT_COPYING], [dnl\n#   Copyright (C) 1996, 1997, 1998, 1999, 2000, 2001, 2003, 2004, 2005,\n#                 2006, 2007, 2008, 2009, 2010, 2011 Free Software\n#                 Foundation, Inc.\n#   Written by Gordon Matzigkeit, 1996\n#\n#   This file is part of GNU Libtool.\n#\n# GNU Libtool is free software; you can redistribute it and/or\n# modify it under the terms of the GNU General Public License as\n# published by the Free Software Foundation; either version 2 of\n# the License, or (at your option) any later version.\n#\n# As a special exception to the GNU General Public License,\n# if you distribute this file as part of a program or library that\n# is built using GNU Libtool, you may include this file under the\n# same distribution terms that you use for the rest of that program.\n#\n# GNU Libtool is distributed in the hope that it will be useful,\n# but WITHOUT ANY WARRANTY; without even the implied warranty of\n# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n# GNU General Public License for more details.\n#\n# You should have received a copy of the GNU General Public License\n# along with GNU Libtool; see the file COPYING.  If not, a copy\n# can be downloaded from http://www.gnu.org/licenses/gpl.html, or\n# obtained by writing to the Free Software Foundation, Inc.,\n# 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.\n])\n\n# serial 57 LT_INIT\n\n\n# LT_PREREQ(VERSION)\n# ------------------\n# Complain and exit if this libtool version is less that VERSION.\nm4_defun([LT_PREREQ],\n[m4_if(m4_version_compare(m4_defn([LT_PACKAGE_VERSION]), [$1]), -1,\n       [m4_default([$3],\n\t\t   [m4_fatal([Libtool version $1 or higher is required],\n\t\t             63)])],\n       [$2])])\n\n\n# _LT_CHECK_BUILDDIR\n# ------------------\n# Complain if the absolute build directory name contains unusual characters\nm4_defun([_LT_CHECK_BUILDDIR],\n[case `pwd` in\n  *\\ * | *\\\t*)\n    AC_MSG_WARN([Libtool does not cope well with whitespace in `pwd`]) ;;\nesac\n])\n\n\n# LT_INIT([OPTIONS])\n# ------------------\nAC_DEFUN([LT_INIT],\n[AC_PREREQ([2.58])dnl We use AC_INCLUDES_DEFAULT\nAC_REQUIRE([AC_CONFIG_AUX_DIR_DEFAULT])dnl\nAC_BEFORE([$0], [LT_LANG])dnl\nAC_BEFORE([$0], [LT_OUTPUT])dnl\nAC_BEFORE([$0], [LTDL_INIT])dnl\nm4_require([_LT_CHECK_BUILDDIR])dnl\n\ndnl Autoconf doesn't catch unexpanded LT_ macros by default:\nm4_pattern_forbid([^_?LT_[A-Z_]+$])dnl\nm4_pattern_allow([^(_LT_EOF|LT_DLGLOBAL|LT_DLLAZY_OR_NOW|LT_MULTI_MODULE)$])dnl\ndnl aclocal doesn't pull ltoptions.m4, ltsugar.m4, or ltversion.m4\ndnl unless we require an AC_DEFUNed macro:\nAC_REQUIRE([LTOPTIONS_VERSION])dnl\nAC_REQUIRE([LTSUGAR_VERSION])dnl\nAC_REQUIRE([LTVERSION_VERSION])dnl\nAC_REQUIRE([LTOBSOLETE_VERSION])dnl\nm4_require([_LT_PROG_LTMAIN])dnl\n\n_LT_SHELL_INIT([SHELL=${CONFIG_SHELL-/bin/sh}])\n\ndnl Parse OPTIONS\n_LT_SET_OPTIONS([$0], [$1])\n\n# This can be used to rebuild libtool when needed\nLIBTOOL_DEPS=\"$ltmain\"\n\n# Always use our own libtool.\nLIBTOOL='$(SHELL) $(top_builddir)/libtool'\nAC_SUBST(LIBTOOL)dnl\n\n_LT_SETUP\n\n# Only expand once:\nm4_define([LT_INIT])\n])# LT_INIT\n\n# Old names:\nAU_ALIAS([AC_PROG_LIBTOOL], [LT_INIT])\nAU_ALIAS([AM_PROG_LIBTOOL], [LT_INIT])\ndnl aclocal-1.4 backwards compatibility:\ndnl AC_DEFUN([AC_PROG_LIBTOOL], [])\ndnl AC_DEFUN([AM_PROG_LIBTOOL], [])\n\n\n# _LT_CC_BASENAME(CC)\n# -------------------\n# Calculate cc_basename.  Skip known compiler wrappers and cross-prefix.\nm4_defun([_LT_CC_BASENAME],\n[for cc_temp in $1\"\"; do\n  case $cc_temp in\n    compile | *[[\\\\/]]compile | ccache | *[[\\\\/]]ccache ) ;;\n    distcc | *[[\\\\/]]distcc | purify | *[[\\\\/]]purify ) ;;\n    \\-*) ;;\n    *) break;;\n  esac\ndone\ncc_basename=`$ECHO \"$cc_temp\" | $SED \"s%.*/%%; s%^$host_alias-%%\"`\n])\n\n\n# _LT_FILEUTILS_DEFAULTS\n# ----------------------\n# It is okay to use these file commands and assume they have been set\n# sensibly after `m4_require([_LT_FILEUTILS_DEFAULTS])'.\nm4_defun([_LT_FILEUTILS_DEFAULTS],\n[: ${CP=\"cp -f\"}\n: ${MV=\"mv -f\"}\n: ${RM=\"rm -f\"}\n])# _LT_FILEUTILS_DEFAULTS\n\n\n# _LT_SETUP\n# ---------\nm4_defun([_LT_SETUP],\n[AC_REQUIRE([AC_CANONICAL_HOST])dnl\nAC_REQUIRE([AC_CANONICAL_BUILD])dnl\nAC_REQUIRE([_LT_PREPARE_SED_QUOTE_VARS])dnl\nAC_REQUIRE([_LT_PROG_ECHO_BACKSLASH])dnl\n\n_LT_DECL([], [PATH_SEPARATOR], [1], [The PATH separator for the build system])dnl\ndnl\n_LT_DECL([], [host_alias], [0], [The host system])dnl\n_LT_DECL([], [host], [0])dnl\n_LT_DECL([], [host_os], [0])dnl\ndnl\n_LT_DECL([], [build_alias], [0], [The build system])dnl\n_LT_DECL([], [build], [0])dnl\n_LT_DECL([], [build_os], [0])dnl\ndnl\nAC_REQUIRE([AC_PROG_CC])dnl\nAC_REQUIRE([LT_PATH_LD])dnl\nAC_REQUIRE([LT_PATH_NM])dnl\ndnl\nAC_REQUIRE([AC_PROG_LN_S])dnl\ntest -z \"$LN_S\" && LN_S=\"ln -s\"\n_LT_DECL([], [LN_S], [1], [Whether we need soft or hard links])dnl\ndnl\nAC_REQUIRE([LT_CMD_MAX_LEN])dnl\n_LT_DECL([objext], [ac_objext], [0], [Object file suffix (normally \"o\")])dnl\n_LT_DECL([], [exeext], [0], [Executable file suffix (normally \"\")])dnl\ndnl\nm4_require([_LT_FILEUTILS_DEFAULTS])dnl\nm4_require([_LT_CHECK_SHELL_FEATURES])dnl\nm4_require([_LT_PATH_CONVERSION_FUNCTIONS])dnl\nm4_require([_LT_CMD_RELOAD])dnl\nm4_require([_LT_CHECK_MAGIC_METHOD])dnl\nm4_require([_LT_CHECK_SHAREDLIB_FROM_LINKLIB])dnl\nm4_require([_LT_CMD_OLD_ARCHIVE])dnl\nm4_require([_LT_CMD_GLOBAL_SYMBOLS])dnl\nm4_require([_LT_WITH_SYSROOT])dnl\n\n_LT_CONFIG_LIBTOOL_INIT([\n# See if we are running on zsh, and set the options which allow our\n# commands through without removal of \\ escapes INIT.\nif test -n \"\\${ZSH_VERSION+set}\" ; then\n   setopt NO_GLOB_SUBST\nfi\n])\nif test -n \"${ZSH_VERSION+set}\" ; then\n   setopt NO_GLOB_SUBST\nfi\n\n_LT_CHECK_OBJDIR\n\nm4_require([_LT_TAG_COMPILER])dnl\n\ncase $host_os in\naix3*)\n  # AIX sometimes has problems with the GCC collect2 program.  For some\n  # reason, if we set the COLLECT_NAMES environment variable, the problems\n  # vanish in a puff of smoke.\n  if test \"X${COLLECT_NAMES+set}\" != Xset; then\n    COLLECT_NAMES=\n    export COLLECT_NAMES\n  fi\n  ;;\nesac\n\n# Global variables:\nofile=libtool\ncan_build_shared=yes\n\n# All known linkers require a `.a' archive for static linking (except MSVC,\n# which needs '.lib').\nlibext=a\n\nwith_gnu_ld=\"$lt_cv_prog_gnu_ld\"\n\nold_CC=\"$CC\"\nold_CFLAGS=\"$CFLAGS\"\n\n# Set sane defaults for various variables\ntest -z \"$CC\" && CC=cc\ntest -z \"$LTCC\" && LTCC=$CC\ntest -z \"$LTCFLAGS\" && LTCFLAGS=$CFLAGS\ntest -z \"$LD\" && LD=ld\ntest -z \"$ac_objext\" && ac_objext=o\n\n_LT_CC_BASENAME([$compiler])\n\n# Only perform the check for file, if the check method requires it\ntest -z \"$MAGIC_CMD\" && MAGIC_CMD=file\ncase $deplibs_check_method in\nfile_magic*)\n  if test \"$file_magic_cmd\" = '$MAGIC_CMD'; then\n    _LT_PATH_MAGIC\n  fi\n  ;;\nesac\n\n# Use C for the default configuration in the libtool script\nLT_SUPPORTED_TAG([CC])\n_LT_LANG_C_CONFIG\n_LT_LANG_DEFAULT_CONFIG\n_LT_CONFIG_COMMANDS\n])# _LT_SETUP\n\n\n# _LT_PREPARE_SED_QUOTE_VARS\n# --------------------------\n# Define a few sed substitution that help us do robust quoting.\nm4_defun([_LT_PREPARE_SED_QUOTE_VARS],\n[# Backslashify metacharacters that are still active within\n# double-quoted strings.\nsed_quote_subst='s/\\([[\"`$\\\\]]\\)/\\\\\\1/g'\n\n# Same as above, but do not quote variable references.\ndouble_quote_subst='s/\\([[\"`\\\\]]\\)/\\\\\\1/g'\n\n# Sed substitution to delay expansion of an escaped shell variable in a\n# double_quote_subst'ed string.\ndelay_variable_subst='s/\\\\\\\\\\\\\\\\\\\\\\$/\\\\\\\\\\\\$/g'\n\n# Sed substitution to delay expansion of an escaped single quote.\ndelay_single_quote_subst='s/'\\''/'\\'\\\\\\\\\\\\\\'\\''/g'\n\n# Sed substitution to avoid accidental globbing in evaled expressions\nno_glob_subst='s/\\*/\\\\\\*/g'\n])\n\n# _LT_PROG_LTMAIN\n# ---------------\n# Note that this code is called both from `configure', and `config.status'\n# now that we use AC_CONFIG_COMMANDS to generate libtool.  Notably,\n# `config.status' has no value for ac_aux_dir unless we are using Automake,\n# so we pass a copy along to make sure it has a sensible value anyway.\nm4_defun([_LT_PROG_LTMAIN],\n[m4_ifdef([AC_REQUIRE_AUX_FILE], [AC_REQUIRE_AUX_FILE([ltmain.sh])])dnl\n_LT_CONFIG_LIBTOOL_INIT([ac_aux_dir='$ac_aux_dir'])\nltmain=\"$ac_aux_dir/ltmain.sh\"\n])# _LT_PROG_LTMAIN\n\n\n## ------------------------------------- ##\n## Accumulate code for creating libtool. ##\n## ------------------------------------- ##\n\n# So that we can recreate a full libtool script including additional\n# tags, we accumulate the chunks of code to send to AC_CONFIG_COMMANDS\n# in macros and then make a single call at the end using the `libtool'\n# label.\n\n\n# _LT_CONFIG_LIBTOOL_INIT([INIT-COMMANDS])\n# ----------------------------------------\n# Register INIT-COMMANDS to be passed to AC_CONFIG_COMMANDS later.\nm4_define([_LT_CONFIG_LIBTOOL_INIT],\n[m4_ifval([$1],\n          [m4_append([_LT_OUTPUT_LIBTOOL_INIT],\n                     [$1\n])])])\n\n# Initialize.\nm4_define([_LT_OUTPUT_LIBTOOL_INIT])\n\n\n# _LT_CONFIG_LIBTOOL([COMMANDS])\n# ------------------------------\n# Register COMMANDS to be passed to AC_CONFIG_COMMANDS later.\nm4_define([_LT_CONFIG_LIBTOOL],\n[m4_ifval([$1],\n          [m4_append([_LT_OUTPUT_LIBTOOL_COMMANDS],\n                     [$1\n])])])\n\n# Initialize.\nm4_define([_LT_OUTPUT_LIBTOOL_COMMANDS])\n\n\n# _LT_CONFIG_SAVE_COMMANDS([COMMANDS], [INIT_COMMANDS])\n# -----------------------------------------------------\nm4_defun([_LT_CONFIG_SAVE_COMMANDS],\n[_LT_CONFIG_LIBTOOL([$1])\n_LT_CONFIG_LIBTOOL_INIT([$2])\n])\n\n\n# _LT_FORMAT_COMMENT([COMMENT])\n# -----------------------------\n# Add leading comment marks to the start of each line, and a trailing\n# full-stop to the whole comment if one is not present already.\nm4_define([_LT_FORMAT_COMMENT],\n[m4_ifval([$1], [\nm4_bpatsubst([m4_bpatsubst([$1], [^ *], [# ])],\n              [['`$\\]], [\\\\\\&])]m4_bmatch([$1], [[!?.]$], [], [.])\n)])\n\n\n\n## ------------------------ ##\n## FIXME: Eliminate VARNAME ##\n## ------------------------ ##\n\n\n# _LT_DECL([CONFIGNAME], VARNAME, VALUE, [DESCRIPTION], [IS-TAGGED?])\n# -------------------------------------------------------------------\n# CONFIGNAME is the name given to the value in the libtool script.\n# VARNAME is the (base) name used in the configure script.\n# VALUE may be 0, 1 or 2 for a computed quote escaped value based on\n# VARNAME.  Any other value will be used directly.\nm4_define([_LT_DECL],\n[lt_if_append_uniq([lt_decl_varnames], [$2], [, ],\n    [lt_dict_add_subkey([lt_decl_dict], [$2], [libtool_name],\n\t[m4_ifval([$1], [$1], [$2])])\n    lt_dict_add_subkey([lt_decl_dict], [$2], [value], [$3])\n    m4_ifval([$4],\n\t[lt_dict_add_subkey([lt_decl_dict], [$2], [description], [$4])])\n    lt_dict_add_subkey([lt_decl_dict], [$2],\n\t[tagged?], [m4_ifval([$5], [yes], [no])])])\n])\n\n\n# _LT_TAGDECL([CONFIGNAME], VARNAME, VALUE, [DESCRIPTION])\n# --------------------------------------------------------\nm4_define([_LT_TAGDECL], [_LT_DECL([$1], [$2], [$3], [$4], [yes])])\n\n\n# lt_decl_tag_varnames([SEPARATOR], [VARNAME1...])\n# ------------------------------------------------\nm4_define([lt_decl_tag_varnames],\n[_lt_decl_filter([tagged?], [yes], $@)])\n\n\n# _lt_decl_filter(SUBKEY, VALUE, [SEPARATOR], [VARNAME1..])\n# ---------------------------------------------------------\nm4_define([_lt_decl_filter],\n[m4_case([$#],\n  [0], [m4_fatal([$0: too few arguments: $#])],\n  [1], [m4_fatal([$0: too few arguments: $#: $1])],\n  [2], [lt_dict_filter([lt_decl_dict], [$1], [$2], [], lt_decl_varnames)],\n  [3], [lt_dict_filter([lt_decl_dict], [$1], [$2], [$3], lt_decl_varnames)],\n  [lt_dict_filter([lt_decl_dict], $@)])[]dnl\n])\n\n\n# lt_decl_quote_varnames([SEPARATOR], [VARNAME1...])\n# --------------------------------------------------\nm4_define([lt_decl_quote_varnames],\n[_lt_decl_filter([value], [1], $@)])\n\n\n# lt_decl_dquote_varnames([SEPARATOR], [VARNAME1...])\n# ---------------------------------------------------\nm4_define([lt_decl_dquote_varnames],\n[_lt_decl_filter([value], [2], $@)])\n\n\n# lt_decl_varnames_tagged([SEPARATOR], [VARNAME1...])\n# ---------------------------------------------------\nm4_define([lt_decl_varnames_tagged],\n[m4_assert([$# <= 2])dnl\n_$0(m4_quote(m4_default([$1], [[, ]])),\n    m4_ifval([$2], [[$2]], [m4_dquote(lt_decl_tag_varnames)]),\n    m4_split(m4_normalize(m4_quote(_LT_TAGS)), [ ]))])\nm4_define([_lt_decl_varnames_tagged],\n[m4_ifval([$3], [lt_combine([$1], [$2], [_], $3)])])\n\n\n# lt_decl_all_varnames([SEPARATOR], [VARNAME1...])\n# ------------------------------------------------\nm4_define([lt_decl_all_varnames],\n[_$0(m4_quote(m4_default([$1], [[, ]])),\n     m4_if([$2], [],\n\t   m4_quote(lt_decl_varnames),\n\tm4_quote(m4_shift($@))))[]dnl\n])\nm4_define([_lt_decl_all_varnames],\n[lt_join($@, lt_decl_varnames_tagged([$1],\n\t\t\tlt_decl_tag_varnames([[, ]], m4_shift($@))))dnl\n])\n\n\n# _LT_CONFIG_STATUS_DECLARE([VARNAME])\n# ------------------------------------\n# Quote a variable value, and forward it to `config.status' so that its\n# declaration there will have the same value as in `configure'.  VARNAME\n# must have a single quote delimited value for this to work.\nm4_define([_LT_CONFIG_STATUS_DECLARE],\n[$1='`$ECHO \"$][$1\" | $SED \"$delay_single_quote_subst\"`'])\n\n\n# _LT_CONFIG_STATUS_DECLARATIONS\n# ------------------------------\n# We delimit libtool config variables with single quotes, so when\n# we write them to config.status, we have to be sure to quote all\n# embedded single quotes properly.  In configure, this macro expands\n# each variable declared with _LT_DECL (and _LT_TAGDECL) into:\n#\n#    <var>='`$ECHO \"$<var>\" | $SED \"$delay_single_quote_subst\"`'\nm4_defun([_LT_CONFIG_STATUS_DECLARATIONS],\n[m4_foreach([_lt_var], m4_quote(lt_decl_all_varnames),\n    [m4_n([_LT_CONFIG_STATUS_DECLARE(_lt_var)])])])\n\n\n# _LT_LIBTOOL_TAGS\n# ----------------\n# Output comment and list of tags supported by the script\nm4_defun([_LT_LIBTOOL_TAGS],\n[_LT_FORMAT_COMMENT([The names of the tagged configurations supported by this script])dnl\navailable_tags=\"_LT_TAGS\"dnl\n])\n\n\n# _LT_LIBTOOL_DECLARE(VARNAME, [TAG])\n# -----------------------------------\n# Extract the dictionary values for VARNAME (optionally with TAG) and\n# expand to a commented shell variable setting:\n#\n#    # Some comment about what VAR is for.\n#    visible_name=$lt_internal_name\nm4_define([_LT_LIBTOOL_DECLARE],\n[_LT_FORMAT_COMMENT(m4_quote(lt_dict_fetch([lt_decl_dict], [$1],\n\t\t\t\t\t   [description])))[]dnl\nm4_pushdef([_libtool_name],\n    m4_quote(lt_dict_fetch([lt_decl_dict], [$1], [libtool_name])))[]dnl\nm4_case(m4_quote(lt_dict_fetch([lt_decl_dict], [$1], [value])),\n    [0], [_libtool_name=[$]$1],\n    [1], [_libtool_name=$lt_[]$1],\n    [2], [_libtool_name=$lt_[]$1],\n    [_libtool_name=lt_dict_fetch([lt_decl_dict], [$1], [value])])[]dnl\nm4_ifval([$2], [_$2])[]m4_popdef([_libtool_name])[]dnl\n])\n\n\n# _LT_LIBTOOL_CONFIG_VARS\n# -----------------------\n# Produce commented declarations of non-tagged libtool config variables\n# suitable for insertion in the LIBTOOL CONFIG section of the `libtool'\n# script.  Tagged libtool config variables (even for the LIBTOOL CONFIG\n# section) are produced by _LT_LIBTOOL_TAG_VARS.\nm4_defun([_LT_LIBTOOL_CONFIG_VARS],\n[m4_foreach([_lt_var],\n    m4_quote(_lt_decl_filter([tagged?], [no], [], lt_decl_varnames)),\n    [m4_n([_LT_LIBTOOL_DECLARE(_lt_var)])])])\n\n\n# _LT_LIBTOOL_TAG_VARS(TAG)\n# -------------------------\nm4_define([_LT_LIBTOOL_TAG_VARS],\n[m4_foreach([_lt_var], m4_quote(lt_decl_tag_varnames),\n    [m4_n([_LT_LIBTOOL_DECLARE(_lt_var, [$1])])])])\n\n\n# _LT_TAGVAR(VARNAME, [TAGNAME])\n# ------------------------------\nm4_define([_LT_TAGVAR], [m4_ifval([$2], [$1_$2], [$1])])\n\n\n# _LT_CONFIG_COMMANDS\n# -------------------\n# Send accumulated output to $CONFIG_STATUS.  Thanks to the lists of\n# variables for single and double quote escaping we saved from calls\n# to _LT_DECL, we can put quote escaped variables declarations\n# into `config.status', and then the shell code to quote escape them in\n# for loops in `config.status'.  Finally, any additional code accumulated\n# from calls to _LT_CONFIG_LIBTOOL_INIT is expanded.\nm4_defun([_LT_CONFIG_COMMANDS],\n[AC_PROVIDE_IFELSE([LT_OUTPUT],\n\tdnl If the libtool generation code has been placed in $CONFIG_LT,\n\tdnl instead of duplicating it all over again into config.status,\n\tdnl then we will have config.status run $CONFIG_LT later, so it\n\tdnl needs to know what name is stored there:\n        [AC_CONFIG_COMMANDS([libtool],\n            [$SHELL $CONFIG_LT || AS_EXIT(1)], [CONFIG_LT='$CONFIG_LT'])],\n    dnl If the libtool generation code is destined for config.status,\n    dnl expand the accumulated commands and init code now:\n    [AC_CONFIG_COMMANDS([libtool],\n        [_LT_OUTPUT_LIBTOOL_COMMANDS], [_LT_OUTPUT_LIBTOOL_COMMANDS_INIT])])\n])#_LT_CONFIG_COMMANDS\n\n\n# Initialize.\nm4_define([_LT_OUTPUT_LIBTOOL_COMMANDS_INIT],\n[\n\n# The HP-UX ksh and POSIX shell print the target directory to stdout\n# if CDPATH is set.\n(unset CDPATH) >/dev/null 2>&1 && unset CDPATH\n\nsed_quote_subst='$sed_quote_subst'\ndouble_quote_subst='$double_quote_subst'\ndelay_variable_subst='$delay_variable_subst'\n_LT_CONFIG_STATUS_DECLARATIONS\nLTCC='$LTCC'\nLTCFLAGS='$LTCFLAGS'\ncompiler='$compiler_DEFAULT'\n\n# A function that is used when there is no print builtin or printf.\nfunc_fallback_echo ()\n{\n  eval 'cat <<_LTECHO_EOF\n\\$[]1\n_LTECHO_EOF'\n}\n\n# Quote evaled strings.\nfor var in lt_decl_all_varnames([[ \\\n]], lt_decl_quote_varnames); do\n    case \\`eval \\\\\\\\\\$ECHO \\\\\\\\\"\"\\\\\\\\\\$\\$var\"\\\\\\\\\"\\` in\n    *[[\\\\\\\\\\\\\\`\\\\\"\\\\\\$]]*)\n      eval \"lt_\\$var=\\\\\\\\\\\\\"\\\\\\`\\\\\\$ECHO \\\\\"\\\\\\$\\$var\\\\\" | \\\\\\$SED \\\\\"\\\\\\$sed_quote_subst\\\\\"\\\\\\`\\\\\\\\\\\\\"\"\n      ;;\n    *)\n      eval \"lt_\\$var=\\\\\\\\\\\\\"\\\\\\$\\$var\\\\\\\\\\\\\"\"\n      ;;\n    esac\ndone\n\n# Double-quote double-evaled strings.\nfor var in lt_decl_all_varnames([[ \\\n]], lt_decl_dquote_varnames); do\n    case \\`eval \\\\\\\\\\$ECHO \\\\\\\\\"\"\\\\\\\\\\$\\$var\"\\\\\\\\\"\\` in\n    *[[\\\\\\\\\\\\\\`\\\\\"\\\\\\$]]*)\n      eval \"lt_\\$var=\\\\\\\\\\\\\"\\\\\\`\\\\\\$ECHO \\\\\"\\\\\\$\\$var\\\\\" | \\\\\\$SED -e \\\\\"\\\\\\$double_quote_subst\\\\\" -e \\\\\"\\\\\\$sed_quote_subst\\\\\" -e \\\\\"\\\\\\$delay_variable_subst\\\\\"\\\\\\`\\\\\\\\\\\\\"\"\n      ;;\n    *)\n      eval \"lt_\\$var=\\\\\\\\\\\\\"\\\\\\$\\$var\\\\\\\\\\\\\"\"\n      ;;\n    esac\ndone\n\n_LT_OUTPUT_LIBTOOL_INIT\n])\n\n# _LT_GENERATED_FILE_INIT(FILE, [COMMENT])\n# ------------------------------------\n# Generate a child script FILE with all initialization necessary to\n# reuse the environment learned by the parent script, and make the\n# file executable.  If COMMENT is supplied, it is inserted after the\n# `#!' sequence but before initialization text begins.  After this\n# macro, additional text can be appended to FILE to form the body of\n# the child script.  The macro ends with non-zero status if the\n# file could not be fully written (such as if the disk is full).\nm4_ifdef([AS_INIT_GENERATED],\n[m4_defun([_LT_GENERATED_FILE_INIT],[AS_INIT_GENERATED($@)])],\n[m4_defun([_LT_GENERATED_FILE_INIT],\n[m4_require([AS_PREPARE])]dnl\n[m4_pushdef([AS_MESSAGE_LOG_FD])]dnl\n[lt_write_fail=0\ncat >$1 <<_ASEOF || lt_write_fail=1\n#! $SHELL\n# Generated by $as_me.\n$2\nSHELL=\\${CONFIG_SHELL-$SHELL}\nexport SHELL\n_ASEOF\ncat >>$1 <<\\_ASEOF || lt_write_fail=1\nAS_SHELL_SANITIZE\n_AS_PREPARE\nexec AS_MESSAGE_FD>&1\n_ASEOF\ntest $lt_write_fail = 0 && chmod +x $1[]dnl\nm4_popdef([AS_MESSAGE_LOG_FD])])])# _LT_GENERATED_FILE_INIT\n\n# LT_OUTPUT\n# ---------\n# This macro allows early generation of the libtool script (before\n# AC_OUTPUT is called), incase it is used in configure for compilation\n# tests.\nAC_DEFUN([LT_OUTPUT],\n[: ${CONFIG_LT=./config.lt}\nAC_MSG_NOTICE([creating $CONFIG_LT])\n_LT_GENERATED_FILE_INIT([\"$CONFIG_LT\"],\n[# Run this file to recreate a libtool stub with the current configuration.])\n\ncat >>\"$CONFIG_LT\" <<\\_LTEOF\nlt_cl_silent=false\nexec AS_MESSAGE_LOG_FD>>config.log\n{\n  echo\n  AS_BOX([Running $as_me.])\n} >&AS_MESSAGE_LOG_FD\n\nlt_cl_help=\"\\\n\\`$as_me' creates a local libtool stub from the current configuration,\nfor use in further configure time tests before the real libtool is\ngenerated.\n\nUsage: $[0] [[OPTIONS]]\n\n  -h, --help      print this help, then exit\n  -V, --version   print version number, then exit\n  -q, --quiet     do not print progress messages\n  -d, --debug     don't remove temporary files\n\nReport bugs to <bug-libtool@gnu.org>.\"\n\nlt_cl_version=\"\\\nm4_ifset([AC_PACKAGE_NAME], [AC_PACKAGE_NAME ])config.lt[]dnl\nm4_ifset([AC_PACKAGE_VERSION], [ AC_PACKAGE_VERSION])\nconfigured by $[0], generated by m4_PACKAGE_STRING.\n\nCopyright (C) 2011 Free Software Foundation, Inc.\nThis config.lt script is free software; the Free Software Foundation\ngives unlimited permision to copy, distribute and modify it.\"\n\nwhile test $[#] != 0\ndo\n  case $[1] in\n    --version | --v* | -V )\n      echo \"$lt_cl_version\"; exit 0 ;;\n    --help | --h* | -h )\n      echo \"$lt_cl_help\"; exit 0 ;;\n    --debug | --d* | -d )\n      debug=: ;;\n    --quiet | --q* | --silent | --s* | -q )\n      lt_cl_silent=: ;;\n\n    -*) AC_MSG_ERROR([unrecognized option: $[1]\nTry \\`$[0] --help' for more information.]) ;;\n\n    *) AC_MSG_ERROR([unrecognized argument: $[1]\nTry \\`$[0] --help' for more information.]) ;;\n  esac\n  shift\ndone\n\nif $lt_cl_silent; then\n  exec AS_MESSAGE_FD>/dev/null\nfi\n_LTEOF\n\ncat >>\"$CONFIG_LT\" <<_LTEOF\n_LT_OUTPUT_LIBTOOL_COMMANDS_INIT\n_LTEOF\n\ncat >>\"$CONFIG_LT\" <<\\_LTEOF\nAC_MSG_NOTICE([creating $ofile])\n_LT_OUTPUT_LIBTOOL_COMMANDS\nAS_EXIT(0)\n_LTEOF\nchmod +x \"$CONFIG_LT\"\n\n# configure is writing to config.log, but config.lt does its own redirection,\n# appending to config.log, which fails on DOS, as config.log is still kept\n# open by configure.  Here we exec the FD to /dev/null, effectively closing\n# config.log, so it can be properly (re)opened and appended to by config.lt.\nlt_cl_success=:\ntest \"$silent\" = yes &&\n  lt_config_lt_args=\"$lt_config_lt_args --quiet\"\nexec AS_MESSAGE_LOG_FD>/dev/null\n$SHELL \"$CONFIG_LT\" $lt_config_lt_args || lt_cl_success=false\nexec AS_MESSAGE_LOG_FD>>config.log\n$lt_cl_success || AS_EXIT(1)\n])# LT_OUTPUT\n\n\n# _LT_CONFIG(TAG)\n# ---------------\n# If TAG is the built-in tag, create an initial libtool script with a\n# default configuration from the untagged config vars.  Otherwise add code\n# to config.status for appending the configuration named by TAG from the\n# matching tagged config vars.\nm4_defun([_LT_CONFIG],\n[m4_require([_LT_FILEUTILS_DEFAULTS])dnl\n_LT_CONFIG_SAVE_COMMANDS([\n  m4_define([_LT_TAG], m4_if([$1], [], [C], [$1]))dnl\n  m4_if(_LT_TAG, [C], [\n    # See if we are running on zsh, and set the options which allow our\n    # commands through without removal of \\ escapes.\n    if test -n \"${ZSH_VERSION+set}\" ; then\n      setopt NO_GLOB_SUBST\n    fi\n\n    cfgfile=\"${ofile}T\"\n    trap \"$RM \\\"$cfgfile\\\"; exit 1\" 1 2 15\n    $RM \"$cfgfile\"\n\n    cat <<_LT_EOF >> \"$cfgfile\"\n#! $SHELL\n\n# `$ECHO \"$ofile\" | sed 's%^.*/%%'` - Provide generalized library-building support services.\n# Generated automatically by $as_me ($PACKAGE$TIMESTAMP) $VERSION\n# Libtool was configured on host `(hostname || uname -n) 2>/dev/null | sed 1q`:\n# NOTE: Changes made to this file will be lost: look at ltmain.sh.\n#\n_LT_COPYING\n_LT_LIBTOOL_TAGS\n\n# ### BEGIN LIBTOOL CONFIG\n_LT_LIBTOOL_CONFIG_VARS\n_LT_LIBTOOL_TAG_VARS\n# ### END LIBTOOL CONFIG\n\n_LT_EOF\n\n  case $host_os in\n  aix3*)\n    cat <<\\_LT_EOF >> \"$cfgfile\"\n# AIX sometimes has problems with the GCC collect2 program.  For some\n# reason, if we set the COLLECT_NAMES environment variable, the problems\n# vanish in a puff of smoke.\nif test \"X${COLLECT_NAMES+set}\" != Xset; then\n  COLLECT_NAMES=\n  export COLLECT_NAMES\nfi\n_LT_EOF\n    ;;\n  esac\n\n  _LT_PROG_LTMAIN\n\n  # We use sed instead of cat because bash on DJGPP gets confused if\n  # if finds mixed CR/LF and LF-only lines.  Since sed operates in\n  # text mode, it properly converts lines to CR/LF.  This bash problem\n  # is reportedly fixed, but why not run on old versions too?\n  sed '$q' \"$ltmain\" >> \"$cfgfile\" \\\n     || (rm -f \"$cfgfile\"; exit 1)\n\n  _LT_PROG_REPLACE_SHELLFNS\n\n   mv -f \"$cfgfile\" \"$ofile\" ||\n    (rm -f \"$ofile\" && cp \"$cfgfile\" \"$ofile\" && rm -f \"$cfgfile\")\n  chmod +x \"$ofile\"\n],\n[cat <<_LT_EOF >> \"$ofile\"\n\ndnl Unfortunately we have to use $1 here, since _LT_TAG is not expanded\ndnl in a comment (ie after a #).\n# ### BEGIN LIBTOOL TAG CONFIG: $1\n_LT_LIBTOOL_TAG_VARS(_LT_TAG)\n# ### END LIBTOOL TAG CONFIG: $1\n_LT_EOF\n])dnl /m4_if\n],\n[m4_if([$1], [], [\n    PACKAGE='$PACKAGE'\n    VERSION='$VERSION'\n    TIMESTAMP='$TIMESTAMP'\n    RM='$RM'\n    ofile='$ofile'], [])\n])dnl /_LT_CONFIG_SAVE_COMMANDS\n])# _LT_CONFIG\n\n\n# LT_SUPPORTED_TAG(TAG)\n# ---------------------\n# Trace this macro to discover what tags are supported by the libtool\n# --tag option, using:\n#    autoconf --trace 'LT_SUPPORTED_TAG:$1'\nAC_DEFUN([LT_SUPPORTED_TAG], [])\n\n\n# C support is built-in for now\nm4_define([_LT_LANG_C_enabled], [])\nm4_define([_LT_TAGS], [])\n\n\n# LT_LANG(LANG)\n# -------------\n# Enable libtool support for the given language if not already enabled.\nAC_DEFUN([LT_LANG],\n[AC_BEFORE([$0], [LT_OUTPUT])dnl\nm4_case([$1],\n  [C],\t\t\t[_LT_LANG(C)],\n  [C++],\t\t[_LT_LANG(CXX)],\n  [Go],\t\t\t[_LT_LANG(GO)],\n  [Java],\t\t[_LT_LANG(GCJ)],\n  [Fortran 77],\t\t[_LT_LANG(F77)],\n  [Fortran],\t\t[_LT_LANG(FC)],\n  [Windows Resource],\t[_LT_LANG(RC)],\n  [m4_ifdef([_LT_LANG_]$1[_CONFIG],\n    [_LT_LANG($1)],\n    [m4_fatal([$0: unsupported language: \"$1\"])])])dnl\n])# LT_LANG\n\n\n# _LT_LANG(LANGNAME)\n# ------------------\nm4_defun([_LT_LANG],\n[m4_ifdef([_LT_LANG_]$1[_enabled], [],\n  [LT_SUPPORTED_TAG([$1])dnl\n  m4_append([_LT_TAGS], [$1 ])dnl\n  m4_define([_LT_LANG_]$1[_enabled], [])dnl\n  _LT_LANG_$1_CONFIG($1)])dnl\n])# _LT_LANG\n\n\nm4_ifndef([AC_PROG_GO], [\n############################################################\n# NOTE: This macro has been submitted for inclusion into   #\n#  GNU Autoconf as AC_PROG_GO.  When it is available in    #\n#  a released version of Autoconf we should remove this    #\n#  macro and use it instead.                               #\n############################################################\nm4_defun([AC_PROG_GO],\n[AC_LANG_PUSH(Go)dnl\nAC_ARG_VAR([GOC],     [Go compiler command])dnl\nAC_ARG_VAR([GOFLAGS], [Go compiler flags])dnl\n_AC_ARG_VAR_LDFLAGS()dnl\nAC_CHECK_TOOL(GOC, gccgo)\nif test -z \"$GOC\"; then\n  if test -n \"$ac_tool_prefix\"; then\n    AC_CHECK_PROG(GOC, [${ac_tool_prefix}gccgo], [${ac_tool_prefix}gccgo])\n  fi\nfi\nif test -z \"$GOC\"; then\n  AC_CHECK_PROG(GOC, gccgo, gccgo, false)\nfi\n])#m4_defun\n])#m4_ifndef\n\n\n# _LT_LANG_DEFAULT_CONFIG\n# -----------------------\nm4_defun([_LT_LANG_DEFAULT_CONFIG],\n[AC_PROVIDE_IFELSE([AC_PROG_CXX],\n  [LT_LANG(CXX)],\n  [m4_define([AC_PROG_CXX], defn([AC_PROG_CXX])[LT_LANG(CXX)])])\n\nAC_PROVIDE_IFELSE([AC_PROG_F77],\n  [LT_LANG(F77)],\n  [m4_define([AC_PROG_F77], defn([AC_PROG_F77])[LT_LANG(F77)])])\n\nAC_PROVIDE_IFELSE([AC_PROG_FC],\n  [LT_LANG(FC)],\n  [m4_define([AC_PROG_FC], defn([AC_PROG_FC])[LT_LANG(FC)])])\n\ndnl The call to [A][M_PROG_GCJ] is quoted like that to stop aclocal\ndnl pulling things in needlessly.\nAC_PROVIDE_IFELSE([AC_PROG_GCJ],\n  [LT_LANG(GCJ)],\n  [AC_PROVIDE_IFELSE([A][M_PROG_GCJ],\n    [LT_LANG(GCJ)],\n    [AC_PROVIDE_IFELSE([LT_PROG_GCJ],\n      [LT_LANG(GCJ)],\n      [m4_ifdef([AC_PROG_GCJ],\n\t[m4_define([AC_PROG_GCJ], defn([AC_PROG_GCJ])[LT_LANG(GCJ)])])\n       m4_ifdef([A][M_PROG_GCJ],\n\t[m4_define([A][M_PROG_GCJ], defn([A][M_PROG_GCJ])[LT_LANG(GCJ)])])\n       m4_ifdef([LT_PROG_GCJ],\n\t[m4_define([LT_PROG_GCJ], defn([LT_PROG_GCJ])[LT_LANG(GCJ)])])])])])\n\nAC_PROVIDE_IFELSE([AC_PROG_GO],\n  [LT_LANG(GO)],\n  [m4_define([AC_PROG_GO], defn([AC_PROG_GO])[LT_LANG(GO)])])\n\nAC_PROVIDE_IFELSE([LT_PROG_RC],\n  [LT_LANG(RC)],\n  [m4_define([LT_PROG_RC], defn([LT_PROG_RC])[LT_LANG(RC)])])\n])# _LT_LANG_DEFAULT_CONFIG\n\n# Obsolete macros:\nAU_DEFUN([AC_LIBTOOL_CXX], [LT_LANG(C++)])\nAU_DEFUN([AC_LIBTOOL_F77], [LT_LANG(Fortran 77)])\nAU_DEFUN([AC_LIBTOOL_FC], [LT_LANG(Fortran)])\nAU_DEFUN([AC_LIBTOOL_GCJ], [LT_LANG(Java)])\nAU_DEFUN([AC_LIBTOOL_RC], [LT_LANG(Windows Resource)])\ndnl aclocal-1.4 backwards compatibility:\ndnl AC_DEFUN([AC_LIBTOOL_CXX], [])\ndnl AC_DEFUN([AC_LIBTOOL_F77], [])\ndnl AC_DEFUN([AC_LIBTOOL_FC], [])\ndnl AC_DEFUN([AC_LIBTOOL_GCJ], [])\ndnl AC_DEFUN([AC_LIBTOOL_RC], [])\n\n\n# _LT_TAG_COMPILER\n# ----------------\nm4_defun([_LT_TAG_COMPILER],\n[AC_REQUIRE([AC_PROG_CC])dnl\n\n_LT_DECL([LTCC], [CC], [1], [A C compiler])dnl\n_LT_DECL([LTCFLAGS], [CFLAGS], [1], [LTCC compiler flags])dnl\n_LT_TAGDECL([CC], [compiler], [1], [A language specific compiler])dnl\n_LT_TAGDECL([with_gcc], [GCC], [0], [Is the compiler the GNU compiler?])dnl\n\n# If no C compiler was specified, use CC.\nLTCC=${LTCC-\"$CC\"}\n\n# If no C compiler flags were specified, use CFLAGS.\nLTCFLAGS=${LTCFLAGS-\"$CFLAGS\"}\n\n# Allow CC to be a program name with arguments.\ncompiler=$CC\n])# _LT_TAG_COMPILER\n\n\n# _LT_COMPILER_BOILERPLATE\n# ------------------------\n# Check for compiler boilerplate output or warnings with\n# the simple compiler test code.\nm4_defun([_LT_COMPILER_BOILERPLATE],\n[m4_require([_LT_DECL_SED])dnl\nac_outfile=conftest.$ac_objext\necho \"$lt_simple_compile_test_code\" >conftest.$ac_ext\neval \"$ac_compile\" 2>&1 >/dev/null | $SED '/^$/d; /^ *+/d' >conftest.err\n_lt_compiler_boilerplate=`cat conftest.err`\n$RM conftest*\n])# _LT_COMPILER_BOILERPLATE\n\n\n# _LT_LINKER_BOILERPLATE\n# ----------------------\n# Check for linker boilerplate output or warnings with\n# the simple link test code.\nm4_defun([_LT_LINKER_BOILERPLATE],\n[m4_require([_LT_DECL_SED])dnl\nac_outfile=conftest.$ac_objext\necho \"$lt_simple_link_test_code\" >conftest.$ac_ext\neval \"$ac_link\" 2>&1 >/dev/null | $SED '/^$/d; /^ *+/d' >conftest.err\n_lt_linker_boilerplate=`cat conftest.err`\n$RM -r conftest*\n])# _LT_LINKER_BOILERPLATE\n\n# _LT_REQUIRED_DARWIN_CHECKS\n# -------------------------\nm4_defun_once([_LT_REQUIRED_DARWIN_CHECKS],[\n  case $host_os in\n    rhapsody* | darwin*)\n    AC_CHECK_TOOL([DSYMUTIL], [dsymutil], [:])\n    AC_CHECK_TOOL([NMEDIT], [nmedit], [:])\n    AC_CHECK_TOOL([LIPO], [lipo], [:])\n    AC_CHECK_TOOL([OTOOL], [otool], [:])\n    AC_CHECK_TOOL([OTOOL64], [otool64], [:])\n    _LT_DECL([], [DSYMUTIL], [1],\n      [Tool to manipulate archived DWARF debug symbol files on Mac OS X])\n    _LT_DECL([], [NMEDIT], [1],\n      [Tool to change global to local symbols on Mac OS X])\n    _LT_DECL([], [LIPO], [1],\n      [Tool to manipulate fat objects and archives on Mac OS X])\n    _LT_DECL([], [OTOOL], [1],\n      [ldd/readelf like tool for Mach-O binaries on Mac OS X])\n    _LT_DECL([], [OTOOL64], [1],\n      [ldd/readelf like tool for 64 bit Mach-O binaries on Mac OS X 10.4])\n\n    AC_CACHE_CHECK([for -single_module linker flag],[lt_cv_apple_cc_single_mod],\n      [lt_cv_apple_cc_single_mod=no\n      if test -z \"${LT_MULTI_MODULE}\"; then\n\t# By default we will add the -single_module flag. You can override\n\t# by either setting the environment variable LT_MULTI_MODULE\n\t# non-empty at configure time, or by adding -multi_module to the\n\t# link flags.\n\trm -rf libconftest.dylib*\n\techo \"int foo(void){return 1;}\" > conftest.c\n\techo \"$LTCC $LTCFLAGS $LDFLAGS -o libconftest.dylib \\\n-dynamiclib -Wl,-single_module conftest.c\" >&AS_MESSAGE_LOG_FD\n\t$LTCC $LTCFLAGS $LDFLAGS -o libconftest.dylib \\\n\t  -dynamiclib -Wl,-single_module conftest.c 2>conftest.err\n        _lt_result=$?\n\t# If there is a non-empty error log, and \"single_module\"\n\t# appears in it, assume the flag caused a linker warning\n        if test -s conftest.err && $GREP single_module conftest.err; then\n\t  cat conftest.err >&AS_MESSAGE_LOG_FD\n\t# Otherwise, if the output was created with a 0 exit code from\n\t# the compiler, it worked.\n\telif test -f libconftest.dylib && test $_lt_result -eq 0; then\n\t  lt_cv_apple_cc_single_mod=yes\n\telse\n\t  cat conftest.err >&AS_MESSAGE_LOG_FD\n\tfi\n\trm -rf libconftest.dylib*\n\trm -f conftest.*\n      fi])\n\n    AC_CACHE_CHECK([for -exported_symbols_list linker flag],\n      [lt_cv_ld_exported_symbols_list],\n      [lt_cv_ld_exported_symbols_list=no\n      save_LDFLAGS=$LDFLAGS\n      echo \"_main\" > conftest.sym\n      LDFLAGS=\"$LDFLAGS -Wl,-exported_symbols_list,conftest.sym\"\n      AC_LINK_IFELSE([AC_LANG_PROGRAM([],[])],\n\t[lt_cv_ld_exported_symbols_list=yes],\n\t[lt_cv_ld_exported_symbols_list=no])\n\tLDFLAGS=\"$save_LDFLAGS\"\n    ])\n\n    AC_CACHE_CHECK([for -force_load linker flag],[lt_cv_ld_force_load],\n      [lt_cv_ld_force_load=no\n      cat > conftest.c << _LT_EOF\nint forced_loaded() { return 2;}\n_LT_EOF\n      echo \"$LTCC $LTCFLAGS -c -o conftest.o conftest.c\" >&AS_MESSAGE_LOG_FD\n      $LTCC $LTCFLAGS -c -o conftest.o conftest.c 2>&AS_MESSAGE_LOG_FD\n      echo \"$AR cru libconftest.a conftest.o\" >&AS_MESSAGE_LOG_FD\n      $AR cru libconftest.a conftest.o 2>&AS_MESSAGE_LOG_FD\n      echo \"$RANLIB libconftest.a\" >&AS_MESSAGE_LOG_FD\n      $RANLIB libconftest.a 2>&AS_MESSAGE_LOG_FD\n      cat > conftest.c << _LT_EOF\nint main() { return 0;}\n_LT_EOF\n      echo \"$LTCC $LTCFLAGS $LDFLAGS -o conftest conftest.c -Wl,-force_load,./libconftest.a\" >&AS_MESSAGE_LOG_FD\n      $LTCC $LTCFLAGS $LDFLAGS -o conftest conftest.c -Wl,-force_load,./libconftest.a 2>conftest.err\n      _lt_result=$?\n      if test -s conftest.err && $GREP force_load conftest.err; then\n\tcat conftest.err >&AS_MESSAGE_LOG_FD\n      elif test -f conftest && test $_lt_result -eq 0 && $GREP forced_load conftest >/dev/null 2>&1 ; then\n\tlt_cv_ld_force_load=yes\n      else\n\tcat conftest.err >&AS_MESSAGE_LOG_FD\n      fi\n        rm -f conftest.err libconftest.a conftest conftest.c\n        rm -rf conftest.dSYM\n    ])\n    case $host_os in\n    rhapsody* | darwin1.[[012]])\n      _lt_dar_allow_undefined='${wl}-undefined ${wl}suppress' ;;\n    darwin1.*)\n      _lt_dar_allow_undefined='${wl}-flat_namespace ${wl}-undefined ${wl}suppress' ;;\n    darwin*) # darwin 5.x on\n      # if running on 10.5 or later, the deployment target defaults\n      # to the OS version, if on x86, and 10.4, the deployment\n      # target defaults to 10.4. Don't you love it?\n      case ${MACOSX_DEPLOYMENT_TARGET-10.0},$host in\n\t10.0,*86*-darwin8*|10.0,*-darwin[[91]]*)\n\t  _lt_dar_allow_undefined='${wl}-undefined ${wl}dynamic_lookup' ;;\n\t10.[[012]]*)\n\t  _lt_dar_allow_undefined='${wl}-flat_namespace ${wl}-undefined ${wl}suppress' ;;\n\t10.*)\n\t  _lt_dar_allow_undefined='${wl}-undefined ${wl}dynamic_lookup' ;;\n      esac\n    ;;\n  esac\n    if test \"$lt_cv_apple_cc_single_mod\" = \"yes\"; then\n      _lt_dar_single_mod='$single_module'\n    fi\n    if test \"$lt_cv_ld_exported_symbols_list\" = \"yes\"; then\n      _lt_dar_export_syms=' ${wl}-exported_symbols_list,$output_objdir/${libname}-symbols.expsym'\n    else\n      _lt_dar_export_syms='~$NMEDIT -s $output_objdir/${libname}-symbols.expsym ${lib}'\n    fi\n    if test \"$DSYMUTIL\" != \":\" && test \"$lt_cv_ld_force_load\" = \"no\"; then\n      _lt_dsymutil='~$DSYMUTIL $lib || :'\n    else\n      _lt_dsymutil=\n    fi\n    ;;\n  esac\n])\n\n\n# _LT_DARWIN_LINKER_FEATURES([TAG])\n# ---------------------------------\n# Checks for linker and compiler features on darwin\nm4_defun([_LT_DARWIN_LINKER_FEATURES],\n[\n  m4_require([_LT_REQUIRED_DARWIN_CHECKS])\n  _LT_TAGVAR(archive_cmds_need_lc, $1)=no\n  _LT_TAGVAR(hardcode_direct, $1)=no\n  _LT_TAGVAR(hardcode_automatic, $1)=yes\n  _LT_TAGVAR(hardcode_shlibpath_var, $1)=unsupported\n  if test \"$lt_cv_ld_force_load\" = \"yes\"; then\n    _LT_TAGVAR(whole_archive_flag_spec, $1)='`for conv in $convenience\\\"\\\"; do test  -n \\\"$conv\\\" && new_convenience=\\\"$new_convenience ${wl}-force_load,$conv\\\"; done; func_echo_all \\\"$new_convenience\\\"`'\n    m4_case([$1], [F77], [_LT_TAGVAR(compiler_needs_object, $1)=yes],\n                  [FC],  [_LT_TAGVAR(compiler_needs_object, $1)=yes])\n  else\n    _LT_TAGVAR(whole_archive_flag_spec, $1)=''\n  fi\n  _LT_TAGVAR(link_all_deplibs, $1)=yes\n  _LT_TAGVAR(allow_undefined_flag, $1)=\"$_lt_dar_allow_undefined\"\n  case $cc_basename in\n     ifort*) _lt_dar_can_shared=yes ;;\n     *) _lt_dar_can_shared=$GCC ;;\n  esac\n  if test \"$_lt_dar_can_shared\" = \"yes\"; then\n    output_verbose_link_cmd=func_echo_all\n    _LT_TAGVAR(archive_cmds, $1)=\"\\$CC -dynamiclib \\$allow_undefined_flag -o \\$lib \\$libobjs \\$deplibs \\$compiler_flags -install_name \\$rpath/\\$soname \\$verstring $_lt_dar_single_mod${_lt_dsymutil}\"\n    _LT_TAGVAR(module_cmds, $1)=\"\\$CC \\$allow_undefined_flag -o \\$lib -bundle \\$libobjs \\$deplibs \\$compiler_flags${_lt_dsymutil}\"\n    _LT_TAGVAR(archive_expsym_cmds, $1)=\"sed 's,^,_,' < \\$export_symbols > \\$output_objdir/\\${libname}-symbols.expsym~\\$CC -dynamiclib \\$allow_undefined_flag -o \\$lib \\$libobjs \\$deplibs \\$compiler_flags -install_name \\$rpath/\\$soname \\$verstring ${_lt_dar_single_mod}${_lt_dar_export_syms}${_lt_dsymutil}\"\n    _LT_TAGVAR(module_expsym_cmds, $1)=\"sed -e 's,^,_,' < \\$export_symbols > \\$output_objdir/\\${libname}-symbols.expsym~\\$CC \\$allow_undefined_flag -o \\$lib -bundle \\$libobjs \\$deplibs \\$compiler_flags${_lt_dar_export_syms}${_lt_dsymutil}\"\n    m4_if([$1], [CXX],\n[   if test \"$lt_cv_apple_cc_single_mod\" != \"yes\"; then\n      _LT_TAGVAR(archive_cmds, $1)=\"\\$CC -r -keep_private_externs -nostdlib -o \\${lib}-master.o \\$libobjs~\\$CC -dynamiclib \\$allow_undefined_flag -o \\$lib \\${lib}-master.o \\$deplibs \\$compiler_flags -install_name \\$rpath/\\$soname \\$verstring${_lt_dsymutil}\"\n      _LT_TAGVAR(archive_expsym_cmds, $1)=\"sed 's,^,_,' < \\$export_symbols > \\$output_objdir/\\${libname}-symbols.expsym~\\$CC -r -keep_private_externs -nostdlib -o \\${lib}-master.o \\$libobjs~\\$CC -dynamiclib \\$allow_undefined_flag -o \\$lib \\${lib}-master.o \\$deplibs \\$compiler_flags -install_name \\$rpath/\\$soname \\$verstring${_lt_dar_export_syms}${_lt_dsymutil}\"\n    fi\n],[])\n  else\n  _LT_TAGVAR(ld_shlibs, $1)=no\n  fi\n])\n\n# _LT_SYS_MODULE_PATH_AIX([TAGNAME])\n# ----------------------------------\n# Links a minimal program and checks the executable\n# for the system default hardcoded library path. In most cases,\n# this is /usr/lib:/lib, but when the MPI compilers are used\n# the location of the communication and MPI libs are included too.\n# If we don't find anything, use the default library path according\n# to the aix ld manual.\n# Store the results from the different compilers for each TAGNAME.\n# Allow to override them for all tags through lt_cv_aix_libpath.\nm4_defun([_LT_SYS_MODULE_PATH_AIX],\n[m4_require([_LT_DECL_SED])dnl\nif test \"${lt_cv_aix_libpath+set}\" = set; then\n  aix_libpath=$lt_cv_aix_libpath\nelse\n  AC_CACHE_VAL([_LT_TAGVAR([lt_cv_aix_libpath_], [$1])],\n  [AC_LINK_IFELSE([AC_LANG_PROGRAM],[\n  lt_aix_libpath_sed='[\n      /Import File Strings/,/^$/ {\n\t  /^0/ {\n\t      s/^0  *\\([^ ]*\\) *$/\\1/\n\t      p\n\t  }\n      }]'\n  _LT_TAGVAR([lt_cv_aix_libpath_], [$1])=`dump -H conftest$ac_exeext 2>/dev/null | $SED -n -e \"$lt_aix_libpath_sed\"`\n  # Check for a 64-bit object if we didn't find anything.\n  if test -z \"$_LT_TAGVAR([lt_cv_aix_libpath_], [$1])\"; then\n    _LT_TAGVAR([lt_cv_aix_libpath_], [$1])=`dump -HX64 conftest$ac_exeext 2>/dev/null | $SED -n -e \"$lt_aix_libpath_sed\"`\n  fi],[])\n  if test -z \"$_LT_TAGVAR([lt_cv_aix_libpath_], [$1])\"; then\n    _LT_TAGVAR([lt_cv_aix_libpath_], [$1])=\"/usr/lib:/lib\"\n  fi\n  ])\n  aix_libpath=$_LT_TAGVAR([lt_cv_aix_libpath_], [$1])\nfi\n])# _LT_SYS_MODULE_PATH_AIX\n\n\n# _LT_SHELL_INIT(ARG)\n# -------------------\nm4_define([_LT_SHELL_INIT],\n[m4_divert_text([M4SH-INIT], [$1\n])])# _LT_SHELL_INIT\n\n\n\n# _LT_PROG_ECHO_BACKSLASH\n# -----------------------\n# Find how we can fake an echo command that does not interpret backslash.\n# In particular, with Autoconf 2.60 or later we add some code to the start\n# of the generated configure script which will find a shell with a builtin\n# printf (which we can use as an echo command).\nm4_defun([_LT_PROG_ECHO_BACKSLASH],\n[ECHO='\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\'\nECHO=$ECHO$ECHO$ECHO$ECHO$ECHO\nECHO=$ECHO$ECHO$ECHO$ECHO$ECHO$ECHO\n\nAC_MSG_CHECKING([how to print strings])\n# Test print first, because it will be a builtin if present.\nif test \"X`( print -r -- -n ) 2>/dev/null`\" = X-n && \\\n   test \"X`print -r -- $ECHO 2>/dev/null`\" = \"X$ECHO\"; then\n  ECHO='print -r --'\nelif test \"X`printf %s $ECHO 2>/dev/null`\" = \"X$ECHO\"; then\n  ECHO='printf %s\\n'\nelse\n  # Use this function as a fallback that always works.\n  func_fallback_echo ()\n  {\n    eval 'cat <<_LTECHO_EOF\n$[]1\n_LTECHO_EOF'\n  }\n  ECHO='func_fallback_echo'\nfi\n\n# func_echo_all arg...\n# Invoke $ECHO with all args, space-separated.\nfunc_echo_all ()\n{\n    $ECHO \"$*\" \n}\n\ncase \"$ECHO\" in\n  printf*) AC_MSG_RESULT([printf]) ;;\n  print*) AC_MSG_RESULT([print -r]) ;;\n  *) AC_MSG_RESULT([cat]) ;;\nesac\n\nm4_ifdef([_AS_DETECT_SUGGESTED],\n[_AS_DETECT_SUGGESTED([\n  test -n \"${ZSH_VERSION+set}${BASH_VERSION+set}\" || (\n    ECHO='\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\'\n    ECHO=$ECHO$ECHO$ECHO$ECHO$ECHO\n    ECHO=$ECHO$ECHO$ECHO$ECHO$ECHO$ECHO\n    PATH=/empty FPATH=/empty; export PATH FPATH\n    test \"X`printf %s $ECHO`\" = \"X$ECHO\" \\\n      || test \"X`print -r -- $ECHO`\" = \"X$ECHO\" )])])\n\n_LT_DECL([], [SHELL], [1], [Shell to use when invoking shell scripts])\n_LT_DECL([], [ECHO], [1], [An echo program that protects backslashes])\n])# _LT_PROG_ECHO_BACKSLASH\n\n\n# _LT_WITH_SYSROOT\n# ----------------\nAC_DEFUN([_LT_WITH_SYSROOT],\n[AC_MSG_CHECKING([for sysroot])\nAC_ARG_WITH([sysroot],\n[  --with-sysroot[=DIR] Search for dependent libraries within DIR\n                        (or the compiler's sysroot if not specified).],\n[], [with_sysroot=no])\n\ndnl lt_sysroot will always be passed unquoted.  We quote it here\ndnl in case the user passed a directory name.\nlt_sysroot=\ncase ${with_sysroot} in #(\n yes)\n   if test \"$GCC\" = yes; then\n     lt_sysroot=`$CC --print-sysroot 2>/dev/null`\n   fi\n   ;; #(\n /*)\n   lt_sysroot=`echo \"$with_sysroot\" | sed -e \"$sed_quote_subst\"`\n   ;; #(\n no|'')\n   ;; #(\n *)\n   AC_MSG_RESULT([${with_sysroot}])\n   AC_MSG_ERROR([The sysroot must be an absolute path.])\n   ;;\nesac\n\n AC_MSG_RESULT([${lt_sysroot:-no}])\n_LT_DECL([], [lt_sysroot], [0], [The root where to search for ]dnl\n[dependent libraries, and in which our libraries should be installed.])])\n\n# _LT_ENABLE_LOCK\n# ---------------\nm4_defun([_LT_ENABLE_LOCK],\n[AC_ARG_ENABLE([libtool-lock],\n  [AS_HELP_STRING([--disable-libtool-lock],\n    [avoid locking (might break parallel builds)])])\ntest \"x$enable_libtool_lock\" != xno && enable_libtool_lock=yes\n\n# Some flags need to be propagated to the compiler or linker for good\n# libtool support.\ncase $host in\nia64-*-hpux*)\n  # Find out which ABI we are using.\n  echo 'int i;' > conftest.$ac_ext\n  if AC_TRY_EVAL(ac_compile); then\n    case `/usr/bin/file conftest.$ac_objext` in\n      *ELF-32*)\n\tHPUX_IA64_MODE=\"32\"\n\t;;\n      *ELF-64*)\n\tHPUX_IA64_MODE=\"64\"\n\t;;\n    esac\n  fi\n  rm -rf conftest*\n  ;;\n*-*-irix6*)\n  # Find out which ABI we are using.\n  echo '[#]line '$LINENO' \"configure\"' > conftest.$ac_ext\n  if AC_TRY_EVAL(ac_compile); then\n    if test \"$lt_cv_prog_gnu_ld\" = yes; then\n      case `/usr/bin/file conftest.$ac_objext` in\n\t*32-bit*)\n\t  LD=\"${LD-ld} -melf32bsmip\"\n\t  ;;\n\t*N32*)\n\t  LD=\"${LD-ld} -melf32bmipn32\"\n\t  ;;\n\t*64-bit*)\n\t  LD=\"${LD-ld} -melf64bmip\"\n\t;;\n      esac\n    else\n      case `/usr/bin/file conftest.$ac_objext` in\n\t*32-bit*)\n\t  LD=\"${LD-ld} -32\"\n\t  ;;\n\t*N32*)\n\t  LD=\"${LD-ld} -n32\"\n\t  ;;\n\t*64-bit*)\n\t  LD=\"${LD-ld} -64\"\n\t  ;;\n      esac\n    fi\n  fi\n  rm -rf conftest*\n  ;;\n\nx86_64-*kfreebsd*-gnu|x86_64-*linux*|powerpc*-*linux*| \\\ns390*-*linux*|s390*-*tpf*|sparc*-*linux*)\n  # Find out which ABI we are using.\n  echo 'int i;' > conftest.$ac_ext\n  if AC_TRY_EVAL(ac_compile); then\n    case `/usr/bin/file conftest.o` in\n      *32-bit*)\n\tcase $host in\n\t  x86_64-*kfreebsd*-gnu)\n\t    LD=\"${LD-ld} -m elf_i386_fbsd\"\n\t    ;;\n\t  x86_64-*linux*)\n\t    case `/usr/bin/file conftest.o` in\n\t      *x86-64*)\n\t\tLD=\"${LD-ld} -m elf32_x86_64\"\n\t\t;;\n\t      *)\n\t\tLD=\"${LD-ld} -m elf_i386\"\n\t\t;;\n\t    esac\n\t    ;;\n\t  powerpc64le-*)\n\t    LD=\"${LD-ld} -m elf32lppclinux\"\n\t    ;;\n\t  powerpc64-*)\n\t    LD=\"${LD-ld} -m elf32ppclinux\"\n\t    ;;\n\t  s390x-*linux*)\n\t    LD=\"${LD-ld} -m elf_s390\"\n\t    ;;\n\t  sparc64-*linux*)\n\t    LD=\"${LD-ld} -m elf32_sparc\"\n\t    ;;\n\tesac\n\t;;\n      *64-bit*)\n\tcase $host in\n\t  x86_64-*kfreebsd*-gnu)\n\t    LD=\"${LD-ld} -m elf_x86_64_fbsd\"\n\t    ;;\n\t  x86_64-*linux*)\n\t    LD=\"${LD-ld} -m elf_x86_64\"\n\t    ;;\n\t  powerpcle-*)\n\t    LD=\"${LD-ld} -m elf64lppc\"\n\t    ;;\n\t  powerpc-*)\n\t    LD=\"${LD-ld} -m elf64ppc\"\n\t    ;;\n\t  s390*-*linux*|s390*-*tpf*)\n\t    LD=\"${LD-ld} -m elf64_s390\"\n\t    ;;\n\t  sparc*-*linux*)\n\t    LD=\"${LD-ld} -m elf64_sparc\"\n\t    ;;\n\tesac\n\t;;\n    esac\n  fi\n  rm -rf conftest*\n  ;;\n\n*-*-sco3.2v5*)\n  # On SCO OpenServer 5, we need -belf to get full-featured binaries.\n  SAVE_CFLAGS=\"$CFLAGS\"\n  CFLAGS=\"$CFLAGS -belf\"\n  AC_CACHE_CHECK([whether the C compiler needs -belf], lt_cv_cc_needs_belf,\n    [AC_LANG_PUSH(C)\n     AC_LINK_IFELSE([AC_LANG_PROGRAM([[]],[[]])],[lt_cv_cc_needs_belf=yes],[lt_cv_cc_needs_belf=no])\n     AC_LANG_POP])\n  if test x\"$lt_cv_cc_needs_belf\" != x\"yes\"; then\n    # this is probably gcc 2.8.0, egcs 1.0 or newer; no need for -belf\n    CFLAGS=\"$SAVE_CFLAGS\"\n  fi\n  ;;\n*-*solaris*)\n  # Find out which ABI we are using.\n  echo 'int i;' > conftest.$ac_ext\n  if AC_TRY_EVAL(ac_compile); then\n    case `/usr/bin/file conftest.o` in\n    *64-bit*)\n      case $lt_cv_prog_gnu_ld in\n      yes*)\n        case $host in\n        i?86-*-solaris*)\n          LD=\"${LD-ld} -m elf_x86_64\"\n          ;;\n        sparc*-*-solaris*)\n          LD=\"${LD-ld} -m elf64_sparc\"\n          ;;\n        esac\n        # GNU ld 2.21 introduced _sol2 emulations.  Use them if available.\n        if ${LD-ld} -V | grep _sol2 >/dev/null 2>&1; then\n          LD=\"${LD-ld}_sol2\"\n        fi\n        ;;\n      *)\n\tif ${LD-ld} -64 -r -o conftest2.o conftest.o >/dev/null 2>&1; then\n\t  LD=\"${LD-ld} -64\"\n\tfi\n\t;;\n      esac\n      ;;\n    esac\n  fi\n  rm -rf conftest*\n  ;;\nesac\n\nneed_locks=\"$enable_libtool_lock\"\n])# _LT_ENABLE_LOCK\n\n\n# _LT_PROG_AR\n# -----------\nm4_defun([_LT_PROG_AR],\n[AC_CHECK_TOOLS(AR, [ar], false)\n: ${AR=ar}\n: ${AR_FLAGS=cru}\n_LT_DECL([], [AR], [1], [The archiver])\n_LT_DECL([], [AR_FLAGS], [1], [Flags to create an archive])\n\nAC_CACHE_CHECK([for archiver @FILE support], [lt_cv_ar_at_file],\n  [lt_cv_ar_at_file=no\n   AC_COMPILE_IFELSE([AC_LANG_PROGRAM],\n     [echo conftest.$ac_objext > conftest.lst\n      lt_ar_try='$AR $AR_FLAGS libconftest.a @conftest.lst >&AS_MESSAGE_LOG_FD'\n      AC_TRY_EVAL([lt_ar_try])\n      if test \"$ac_status\" -eq 0; then\n\t# Ensure the archiver fails upon bogus file names.\n\trm -f conftest.$ac_objext libconftest.a\n\tAC_TRY_EVAL([lt_ar_try])\n\tif test \"$ac_status\" -ne 0; then\n          lt_cv_ar_at_file=@\n        fi\n      fi\n      rm -f conftest.* libconftest.a\n     ])\n  ])\n\nif test \"x$lt_cv_ar_at_file\" = xno; then\n  archiver_list_spec=\nelse\n  archiver_list_spec=$lt_cv_ar_at_file\nfi\n_LT_DECL([], [archiver_list_spec], [1],\n  [How to feed a file listing to the archiver])\n])# _LT_PROG_AR\n\n\n# _LT_CMD_OLD_ARCHIVE\n# -------------------\nm4_defun([_LT_CMD_OLD_ARCHIVE],\n[_LT_PROG_AR\n\nAC_CHECK_TOOL(STRIP, strip, :)\ntest -z \"$STRIP\" && STRIP=:\n_LT_DECL([], [STRIP], [1], [A symbol stripping program])\n\nAC_CHECK_TOOL(RANLIB, ranlib, :)\ntest -z \"$RANLIB\" && RANLIB=:\n_LT_DECL([], [RANLIB], [1],\n    [Commands used to install an old-style archive])\n\n# Determine commands to create old-style static archives.\nold_archive_cmds='$AR $AR_FLAGS $oldlib$oldobjs'\nold_postinstall_cmds='chmod 644 $oldlib'\nold_postuninstall_cmds=\n\nif test -n \"$RANLIB\"; then\n  case $host_os in\n  openbsd*)\n    old_postinstall_cmds=\"$old_postinstall_cmds~\\$RANLIB -t \\$tool_oldlib\"\n    ;;\n  *)\n    old_postinstall_cmds=\"$old_postinstall_cmds~\\$RANLIB \\$tool_oldlib\"\n    ;;\n  esac\n  old_archive_cmds=\"$old_archive_cmds~\\$RANLIB \\$tool_oldlib\"\nfi\n\ncase $host_os in\n  darwin*)\n    lock_old_archive_extraction=yes ;;\n  *)\n    lock_old_archive_extraction=no ;;\nesac\n_LT_DECL([], [old_postinstall_cmds], [2])\n_LT_DECL([], [old_postuninstall_cmds], [2])\n_LT_TAGDECL([], [old_archive_cmds], [2],\n    [Commands used to build an old-style archive])\n_LT_DECL([], [lock_old_archive_extraction], [0],\n    [Whether to use a lock for old archive extraction])\n])# _LT_CMD_OLD_ARCHIVE\n\n\n# _LT_COMPILER_OPTION(MESSAGE, VARIABLE-NAME, FLAGS,\n#\t\t[OUTPUT-FILE], [ACTION-SUCCESS], [ACTION-FAILURE])\n# ----------------------------------------------------------------\n# Check whether the given compiler option works\nAC_DEFUN([_LT_COMPILER_OPTION],\n[m4_require([_LT_FILEUTILS_DEFAULTS])dnl\nm4_require([_LT_DECL_SED])dnl\nAC_CACHE_CHECK([$1], [$2],\n  [$2=no\n   m4_if([$4], , [ac_outfile=conftest.$ac_objext], [ac_outfile=$4])\n   echo \"$lt_simple_compile_test_code\" > conftest.$ac_ext\n   lt_compiler_flag=\"$3\"\n   # Insert the option either (1) after the last *FLAGS variable, or\n   # (2) before a word containing \"conftest.\", or (3) at the end.\n   # Note that $ac_compile itself does not contain backslashes and begins\n   # with a dollar sign (not a hyphen), so the echo should work correctly.\n   # The option is referenced via a variable to avoid confusing sed.\n   lt_compile=`echo \"$ac_compile\" | $SED \\\n   -e 's:.*FLAGS}\\{0,1\\} :&$lt_compiler_flag :; t' \\\n   -e 's: [[^ ]]*conftest\\.: $lt_compiler_flag&:; t' \\\n   -e 's:$: $lt_compiler_flag:'`\n   (eval echo \"\\\"\\$as_me:$LINENO: $lt_compile\\\"\" >&AS_MESSAGE_LOG_FD)\n   (eval \"$lt_compile\" 2>conftest.err)\n   ac_status=$?\n   cat conftest.err >&AS_MESSAGE_LOG_FD\n   echo \"$as_me:$LINENO: \\$? = $ac_status\" >&AS_MESSAGE_LOG_FD\n   if (exit $ac_status) && test -s \"$ac_outfile\"; then\n     # The compiler can only warn and ignore the option if not recognized\n     # So say no if there are warnings other than the usual output.\n     $ECHO \"$_lt_compiler_boilerplate\" | $SED '/^$/d' >conftest.exp\n     $SED '/^$/d; /^ *+/d' conftest.err >conftest.er2\n     if test ! -s conftest.er2 || diff conftest.exp conftest.er2 >/dev/null; then\n       $2=yes\n     fi\n   fi\n   $RM conftest*\n])\n\nif test x\"[$]$2\" = xyes; then\n    m4_if([$5], , :, [$5])\nelse\n    m4_if([$6], , :, [$6])\nfi\n])# _LT_COMPILER_OPTION\n\n# Old name:\nAU_ALIAS([AC_LIBTOOL_COMPILER_OPTION], [_LT_COMPILER_OPTION])\ndnl aclocal-1.4 backwards compatibility:\ndnl AC_DEFUN([AC_LIBTOOL_COMPILER_OPTION], [])\n\n\n# _LT_LINKER_OPTION(MESSAGE, VARIABLE-NAME, FLAGS,\n#                  [ACTION-SUCCESS], [ACTION-FAILURE])\n# ----------------------------------------------------\n# Check whether the given linker option works\nAC_DEFUN([_LT_LINKER_OPTION],\n[m4_require([_LT_FILEUTILS_DEFAULTS])dnl\nm4_require([_LT_DECL_SED])dnl\nAC_CACHE_CHECK([$1], [$2],\n  [$2=no\n   save_LDFLAGS=\"$LDFLAGS\"\n   LDFLAGS=\"$LDFLAGS $3\"\n   echo \"$lt_simple_link_test_code\" > conftest.$ac_ext\n   if (eval $ac_link 2>conftest.err) && test -s conftest$ac_exeext; then\n     # The linker can only warn and ignore the option if not recognized\n     # So say no if there are warnings\n     if test -s conftest.err; then\n       # Append any errors to the config.log.\n       cat conftest.err 1>&AS_MESSAGE_LOG_FD\n       $ECHO \"$_lt_linker_boilerplate\" | $SED '/^$/d' > conftest.exp\n       $SED '/^$/d; /^ *+/d' conftest.err >conftest.er2\n       if diff conftest.exp conftest.er2 >/dev/null; then\n         $2=yes\n       fi\n     else\n       $2=yes\n     fi\n   fi\n   $RM -r conftest*\n   LDFLAGS=\"$save_LDFLAGS\"\n])\n\nif test x\"[$]$2\" = xyes; then\n    m4_if([$4], , :, [$4])\nelse\n    m4_if([$5], , :, [$5])\nfi\n])# _LT_LINKER_OPTION\n\n# Old name:\nAU_ALIAS([AC_LIBTOOL_LINKER_OPTION], [_LT_LINKER_OPTION])\ndnl aclocal-1.4 backwards compatibility:\ndnl AC_DEFUN([AC_LIBTOOL_LINKER_OPTION], [])\n\n\n# LT_CMD_MAX_LEN\n#---------------\nAC_DEFUN([LT_CMD_MAX_LEN],\n[AC_REQUIRE([AC_CANONICAL_HOST])dnl\n# find the maximum length of command line arguments\nAC_MSG_CHECKING([the maximum length of command line arguments])\nAC_CACHE_VAL([lt_cv_sys_max_cmd_len], [dnl\n  i=0\n  teststring=\"ABCD\"\n\n  case $build_os in\n  msdosdjgpp*)\n    # On DJGPP, this test can blow up pretty badly due to problems in libc\n    # (any single argument exceeding 2000 bytes causes a buffer overrun\n    # during glob expansion).  Even if it were fixed, the result of this\n    # check would be larger than it should be.\n    lt_cv_sys_max_cmd_len=12288;    # 12K is about right\n    ;;\n\n  gnu*)\n    # Under GNU Hurd, this test is not required because there is\n    # no limit to the length of command line arguments.\n    # Libtool will interpret -1 as no limit whatsoever\n    lt_cv_sys_max_cmd_len=-1;\n    ;;\n\n  cygwin* | mingw* | cegcc*)\n    # On Win9x/ME, this test blows up -- it succeeds, but takes\n    # about 5 minutes as the teststring grows exponentially.\n    # Worse, since 9x/ME are not pre-emptively multitasking,\n    # you end up with a \"frozen\" computer, even though with patience\n    # the test eventually succeeds (with a max line length of 256k).\n    # Instead, let's just punt: use the minimum linelength reported by\n    # all of the supported platforms: 8192 (on NT/2K/XP).\n    lt_cv_sys_max_cmd_len=8192;\n    ;;\n\n  mint*)\n    # On MiNT this can take a long time and run out of memory.\n    lt_cv_sys_max_cmd_len=8192;\n    ;;\n\n  amigaos*)\n    # On AmigaOS with pdksh, this test takes hours, literally.\n    # So we just punt and use a minimum line length of 8192.\n    lt_cv_sys_max_cmd_len=8192;\n    ;;\n\n  netbsd* | freebsd* | openbsd* | darwin* | dragonfly*)\n    # This has been around since 386BSD, at least.  Likely further.\n    if test -x /sbin/sysctl; then\n      lt_cv_sys_max_cmd_len=`/sbin/sysctl -n kern.argmax`\n    elif test -x /usr/sbin/sysctl; then\n      lt_cv_sys_max_cmd_len=`/usr/sbin/sysctl -n kern.argmax`\n    else\n      lt_cv_sys_max_cmd_len=65536\t# usable default for all BSDs\n    fi\n    # And add a safety zone\n    lt_cv_sys_max_cmd_len=`expr $lt_cv_sys_max_cmd_len \\/ 4`\n    lt_cv_sys_max_cmd_len=`expr $lt_cv_sys_max_cmd_len \\* 3`\n    ;;\n\n  interix*)\n    # We know the value 262144 and hardcode it with a safety zone (like BSD)\n    lt_cv_sys_max_cmd_len=196608\n    ;;\n\n  os2*)\n    # The test takes a long time on OS/2.\n    lt_cv_sys_max_cmd_len=8192\n    ;;\n\n  osf*)\n    # Dr. Hans Ekkehard Plesser reports seeing a kernel panic running configure\n    # due to this test when exec_disable_arg_limit is 1 on Tru64. It is not\n    # nice to cause kernel panics so lets avoid the loop below.\n    # First set a reasonable default.\n    lt_cv_sys_max_cmd_len=16384\n    #\n    if test -x /sbin/sysconfig; then\n      case `/sbin/sysconfig -q proc exec_disable_arg_limit` in\n        *1*) lt_cv_sys_max_cmd_len=-1 ;;\n      esac\n    fi\n    ;;\n  sco3.2v5*)\n    lt_cv_sys_max_cmd_len=102400\n    ;;\n  sysv5* | sco5v6* | sysv4.2uw2*)\n    kargmax=`grep ARG_MAX /etc/conf/cf.d/stune 2>/dev/null`\n    if test -n \"$kargmax\"; then\n      lt_cv_sys_max_cmd_len=`echo $kargmax | sed 's/.*[[\t ]]//'`\n    else\n      lt_cv_sys_max_cmd_len=32768\n    fi\n    ;;\n  *)\n    lt_cv_sys_max_cmd_len=`(getconf ARG_MAX) 2> /dev/null`\n    if test -n \"$lt_cv_sys_max_cmd_len\" && \\\n\ttest undefined != \"$lt_cv_sys_max_cmd_len\"; then\n      lt_cv_sys_max_cmd_len=`expr $lt_cv_sys_max_cmd_len \\/ 4`\n      lt_cv_sys_max_cmd_len=`expr $lt_cv_sys_max_cmd_len \\* 3`\n    else\n      # Make teststring a little bigger before we do anything with it.\n      # a 1K string should be a reasonable start.\n      for i in 1 2 3 4 5 6 7 8 ; do\n        teststring=$teststring$teststring\n      done\n      SHELL=${SHELL-${CONFIG_SHELL-/bin/sh}}\n      # If test is not a shell built-in, we'll probably end up computing a\n      # maximum length that is only half of the actual maximum length, but\n      # we can't tell.\n      while { test \"X\"`env echo \"$teststring$teststring\" 2>/dev/null` \\\n\t         = \"X$teststring$teststring\"; } >/dev/null 2>&1 &&\n\t      test $i != 17 # 1/2 MB should be enough\n      do\n        i=`expr $i + 1`\n        teststring=$teststring$teststring\n      done\n      # Only check the string length outside the loop.\n      lt_cv_sys_max_cmd_len=`expr \"X$teststring\" : \".*\" 2>&1`\n      teststring=\n      # Add a significant safety factor because C++ compilers can tack on\n      # massive amounts of additional arguments before passing them to the\n      # linker.  It appears as though 1/2 is a usable value.\n      lt_cv_sys_max_cmd_len=`expr $lt_cv_sys_max_cmd_len \\/ 2`\n    fi\n    ;;\n  esac\n])\nif test -n $lt_cv_sys_max_cmd_len ; then\n  AC_MSG_RESULT($lt_cv_sys_max_cmd_len)\nelse\n  AC_MSG_RESULT(none)\nfi\nmax_cmd_len=$lt_cv_sys_max_cmd_len\n_LT_DECL([], [max_cmd_len], [0],\n    [What is the maximum length of a command?])\n])# LT_CMD_MAX_LEN\n\n# Old name:\nAU_ALIAS([AC_LIBTOOL_SYS_MAX_CMD_LEN], [LT_CMD_MAX_LEN])\ndnl aclocal-1.4 backwards compatibility:\ndnl AC_DEFUN([AC_LIBTOOL_SYS_MAX_CMD_LEN], [])\n\n\n# _LT_HEADER_DLFCN\n# ----------------\nm4_defun([_LT_HEADER_DLFCN],\n[AC_CHECK_HEADERS([dlfcn.h], [], [], [AC_INCLUDES_DEFAULT])dnl\n])# _LT_HEADER_DLFCN\n\n\n# _LT_TRY_DLOPEN_SELF (ACTION-IF-TRUE, ACTION-IF-TRUE-W-USCORE,\n#                      ACTION-IF-FALSE, ACTION-IF-CROSS-COMPILING)\n# ----------------------------------------------------------------\nm4_defun([_LT_TRY_DLOPEN_SELF],\n[m4_require([_LT_HEADER_DLFCN])dnl\nif test \"$cross_compiling\" = yes; then :\n  [$4]\nelse\n  lt_dlunknown=0; lt_dlno_uscore=1; lt_dlneed_uscore=2\n  lt_status=$lt_dlunknown\n  cat > conftest.$ac_ext <<_LT_EOF\n[#line $LINENO \"configure\"\n#include \"confdefs.h\"\n\n#if HAVE_DLFCN_H\n#include <dlfcn.h>\n#endif\n\n#include <stdio.h>\n\n#ifdef RTLD_GLOBAL\n#  define LT_DLGLOBAL\t\tRTLD_GLOBAL\n#else\n#  ifdef DL_GLOBAL\n#    define LT_DLGLOBAL\t\tDL_GLOBAL\n#  else\n#    define LT_DLGLOBAL\t\t0\n#  endif\n#endif\n\n/* We may have to define LT_DLLAZY_OR_NOW in the command line if we\n   find out it does not work in some platform. */\n#ifndef LT_DLLAZY_OR_NOW\n#  ifdef RTLD_LAZY\n#    define LT_DLLAZY_OR_NOW\t\tRTLD_LAZY\n#  else\n#    ifdef DL_LAZY\n#      define LT_DLLAZY_OR_NOW\t\tDL_LAZY\n#    else\n#      ifdef RTLD_NOW\n#        define LT_DLLAZY_OR_NOW\tRTLD_NOW\n#      else\n#        ifdef DL_NOW\n#          define LT_DLLAZY_OR_NOW\tDL_NOW\n#        else\n#          define LT_DLLAZY_OR_NOW\t0\n#        endif\n#      endif\n#    endif\n#  endif\n#endif\n\n/* When -fvisbility=hidden is used, assume the code has been annotated\n   correspondingly for the symbols needed.  */\n#if defined(__GNUC__) && (((__GNUC__ == 3) && (__GNUC_MINOR__ >= 3)) || (__GNUC__ > 3))\nint fnord () __attribute__((visibility(\"default\")));\n#endif\n\nint fnord () { return 42; }\nint main ()\n{\n  void *self = dlopen (0, LT_DLGLOBAL|LT_DLLAZY_OR_NOW);\n  int status = $lt_dlunknown;\n\n  if (self)\n    {\n      if (dlsym (self,\"fnord\"))       status = $lt_dlno_uscore;\n      else\n        {\n\t  if (dlsym( self,\"_fnord\"))  status = $lt_dlneed_uscore;\n          else puts (dlerror ());\n\t}\n      /* dlclose (self); */\n    }\n  else\n    puts (dlerror ());\n\n  return status;\n}]\n_LT_EOF\n  if AC_TRY_EVAL(ac_link) && test -s conftest${ac_exeext} 2>/dev/null; then\n    (./conftest; exit; ) >&AS_MESSAGE_LOG_FD 2>/dev/null\n    lt_status=$?\n    case x$lt_status in\n      x$lt_dlno_uscore) $1 ;;\n      x$lt_dlneed_uscore) $2 ;;\n      x$lt_dlunknown|x*) $3 ;;\n    esac\n  else :\n    # compilation failed\n    $3\n  fi\nfi\nrm -fr conftest*\n])# _LT_TRY_DLOPEN_SELF\n\n\n# LT_SYS_DLOPEN_SELF\n# ------------------\nAC_DEFUN([LT_SYS_DLOPEN_SELF],\n[m4_require([_LT_HEADER_DLFCN])dnl\nif test \"x$enable_dlopen\" != xyes; then\n  enable_dlopen=unknown\n  enable_dlopen_self=unknown\n  enable_dlopen_self_static=unknown\nelse\n  lt_cv_dlopen=no\n  lt_cv_dlopen_libs=\n\n  case $host_os in\n  beos*)\n    lt_cv_dlopen=\"load_add_on\"\n    lt_cv_dlopen_libs=\n    lt_cv_dlopen_self=yes\n    ;;\n\n  mingw* | pw32* | cegcc*)\n    lt_cv_dlopen=\"LoadLibrary\"\n    lt_cv_dlopen_libs=\n    ;;\n\n  cygwin*)\n    lt_cv_dlopen=\"dlopen\"\n    lt_cv_dlopen_libs=\n    ;;\n\n  darwin*)\n  # if libdl is installed we need to link against it\n    AC_CHECK_LIB([dl], [dlopen],\n\t\t[lt_cv_dlopen=\"dlopen\" lt_cv_dlopen_libs=\"-ldl\"],[\n    lt_cv_dlopen=\"dyld\"\n    lt_cv_dlopen_libs=\n    lt_cv_dlopen_self=yes\n    ])\n    ;;\n\n  *)\n    AC_CHECK_FUNC([shl_load],\n\t  [lt_cv_dlopen=\"shl_load\"],\n      [AC_CHECK_LIB([dld], [shl_load],\n\t    [lt_cv_dlopen=\"shl_load\" lt_cv_dlopen_libs=\"-ldld\"],\n\t[AC_CHECK_FUNC([dlopen],\n\t      [lt_cv_dlopen=\"dlopen\"],\n\t  [AC_CHECK_LIB([dl], [dlopen],\n\t\t[lt_cv_dlopen=\"dlopen\" lt_cv_dlopen_libs=\"-ldl\"],\n\t    [AC_CHECK_LIB([svld], [dlopen],\n\t\t  [lt_cv_dlopen=\"dlopen\" lt_cv_dlopen_libs=\"-lsvld\"],\n\t      [AC_CHECK_LIB([dld], [dld_link],\n\t\t    [lt_cv_dlopen=\"dld_link\" lt_cv_dlopen_libs=\"-ldld\"])\n\t      ])\n\t    ])\n\t  ])\n\t])\n      ])\n    ;;\n  esac\n\n  if test \"x$lt_cv_dlopen\" != xno; then\n    enable_dlopen=yes\n  else\n    enable_dlopen=no\n  fi\n\n  case $lt_cv_dlopen in\n  dlopen)\n    save_CPPFLAGS=\"$CPPFLAGS\"\n    test \"x$ac_cv_header_dlfcn_h\" = xyes && CPPFLAGS=\"$CPPFLAGS -DHAVE_DLFCN_H\"\n\n    save_LDFLAGS=\"$LDFLAGS\"\n    wl=$lt_prog_compiler_wl eval LDFLAGS=\\\"\\$LDFLAGS $export_dynamic_flag_spec\\\"\n\n    save_LIBS=\"$LIBS\"\n    LIBS=\"$lt_cv_dlopen_libs $LIBS\"\n\n    AC_CACHE_CHECK([whether a program can dlopen itself],\n\t  lt_cv_dlopen_self, [dnl\n\t  _LT_TRY_DLOPEN_SELF(\n\t    lt_cv_dlopen_self=yes, lt_cv_dlopen_self=yes,\n\t    lt_cv_dlopen_self=no, lt_cv_dlopen_self=cross)\n    ])\n\n    if test \"x$lt_cv_dlopen_self\" = xyes; then\n      wl=$lt_prog_compiler_wl eval LDFLAGS=\\\"\\$LDFLAGS $lt_prog_compiler_static\\\"\n      AC_CACHE_CHECK([whether a statically linked program can dlopen itself],\n\t  lt_cv_dlopen_self_static, [dnl\n\t  _LT_TRY_DLOPEN_SELF(\n\t    lt_cv_dlopen_self_static=yes, lt_cv_dlopen_self_static=yes,\n\t    lt_cv_dlopen_self_static=no,  lt_cv_dlopen_self_static=cross)\n      ])\n    fi\n\n    CPPFLAGS=\"$save_CPPFLAGS\"\n    LDFLAGS=\"$save_LDFLAGS\"\n    LIBS=\"$save_LIBS\"\n    ;;\n  esac\n\n  case $lt_cv_dlopen_self in\n  yes|no) enable_dlopen_self=$lt_cv_dlopen_self ;;\n  *) enable_dlopen_self=unknown ;;\n  esac\n\n  case $lt_cv_dlopen_self_static in\n  yes|no) enable_dlopen_self_static=$lt_cv_dlopen_self_static ;;\n  *) enable_dlopen_self_static=unknown ;;\n  esac\nfi\n_LT_DECL([dlopen_support], [enable_dlopen], [0],\n\t [Whether dlopen is supported])\n_LT_DECL([dlopen_self], [enable_dlopen_self], [0],\n\t [Whether dlopen of programs is supported])\n_LT_DECL([dlopen_self_static], [enable_dlopen_self_static], [0],\n\t [Whether dlopen of statically linked programs is supported])\n])# LT_SYS_DLOPEN_SELF\n\n# Old name:\nAU_ALIAS([AC_LIBTOOL_DLOPEN_SELF], [LT_SYS_DLOPEN_SELF])\ndnl aclocal-1.4 backwards compatibility:\ndnl AC_DEFUN([AC_LIBTOOL_DLOPEN_SELF], [])\n\n\n# _LT_COMPILER_C_O([TAGNAME])\n# ---------------------------\n# Check to see if options -c and -o are simultaneously supported by compiler.\n# This macro does not hard code the compiler like AC_PROG_CC_C_O.\nm4_defun([_LT_COMPILER_C_O],\n[m4_require([_LT_DECL_SED])dnl\nm4_require([_LT_FILEUTILS_DEFAULTS])dnl\nm4_require([_LT_TAG_COMPILER])dnl\nAC_CACHE_CHECK([if $compiler supports -c -o file.$ac_objext],\n  [_LT_TAGVAR(lt_cv_prog_compiler_c_o, $1)],\n  [_LT_TAGVAR(lt_cv_prog_compiler_c_o, $1)=no\n   $RM -r conftest 2>/dev/null\n   mkdir conftest\n   cd conftest\n   mkdir out\n   echo \"$lt_simple_compile_test_code\" > conftest.$ac_ext\n\n   lt_compiler_flag=\"-o out/conftest2.$ac_objext\"\n   # Insert the option either (1) after the last *FLAGS variable, or\n   # (2) before a word containing \"conftest.\", or (3) at the end.\n   # Note that $ac_compile itself does not contain backslashes and begins\n   # with a dollar sign (not a hyphen), so the echo should work correctly.\n   lt_compile=`echo \"$ac_compile\" | $SED \\\n   -e 's:.*FLAGS}\\{0,1\\} :&$lt_compiler_flag :; t' \\\n   -e 's: [[^ ]]*conftest\\.: $lt_compiler_flag&:; t' \\\n   -e 's:$: $lt_compiler_flag:'`\n   (eval echo \"\\\"\\$as_me:$LINENO: $lt_compile\\\"\" >&AS_MESSAGE_LOG_FD)\n   (eval \"$lt_compile\" 2>out/conftest.err)\n   ac_status=$?\n   cat out/conftest.err >&AS_MESSAGE_LOG_FD\n   echo \"$as_me:$LINENO: \\$? = $ac_status\" >&AS_MESSAGE_LOG_FD\n   if (exit $ac_status) && test -s out/conftest2.$ac_objext\n   then\n     # The compiler can only warn and ignore the option if not recognized\n     # So say no if there are warnings\n     $ECHO \"$_lt_compiler_boilerplate\" | $SED '/^$/d' > out/conftest.exp\n     $SED '/^$/d; /^ *+/d' out/conftest.err >out/conftest.er2\n     if test ! -s out/conftest.er2 || diff out/conftest.exp out/conftest.er2 >/dev/null; then\n       _LT_TAGVAR(lt_cv_prog_compiler_c_o, $1)=yes\n     fi\n   fi\n   chmod u+w . 2>&AS_MESSAGE_LOG_FD\n   $RM conftest*\n   # SGI C++ compiler will create directory out/ii_files/ for\n   # template instantiation\n   test -d out/ii_files && $RM out/ii_files/* && rmdir out/ii_files\n   $RM out/* && rmdir out\n   cd ..\n   $RM -r conftest\n   $RM conftest*\n])\n_LT_TAGDECL([compiler_c_o], [lt_cv_prog_compiler_c_o], [1],\n\t[Does compiler simultaneously support -c and -o options?])\n])# _LT_COMPILER_C_O\n\n\n# _LT_COMPILER_FILE_LOCKS([TAGNAME])\n# ----------------------------------\n# Check to see if we can do hard links to lock some files if needed\nm4_defun([_LT_COMPILER_FILE_LOCKS],\n[m4_require([_LT_ENABLE_LOCK])dnl\nm4_require([_LT_FILEUTILS_DEFAULTS])dnl\n_LT_COMPILER_C_O([$1])\n\nhard_links=\"nottested\"\nif test \"$_LT_TAGVAR(lt_cv_prog_compiler_c_o, $1)\" = no && test \"$need_locks\" != no; then\n  # do not overwrite the value of need_locks provided by the user\n  AC_MSG_CHECKING([if we can lock with hard links])\n  hard_links=yes\n  $RM conftest*\n  ln conftest.a conftest.b 2>/dev/null && hard_links=no\n  touch conftest.a\n  ln conftest.a conftest.b 2>&5 || hard_links=no\n  ln conftest.a conftest.b 2>/dev/null && hard_links=no\n  AC_MSG_RESULT([$hard_links])\n  if test \"$hard_links\" = no; then\n    AC_MSG_WARN([`$CC' does not support `-c -o', so `make -j' may be unsafe])\n    need_locks=warn\n  fi\nelse\n  need_locks=no\nfi\n_LT_DECL([], [need_locks], [1], [Must we lock files when doing compilation?])\n])# _LT_COMPILER_FILE_LOCKS\n\n\n# _LT_CHECK_OBJDIR\n# ----------------\nm4_defun([_LT_CHECK_OBJDIR],\n[AC_CACHE_CHECK([for objdir], [lt_cv_objdir],\n[rm -f .libs 2>/dev/null\nmkdir .libs 2>/dev/null\nif test -d .libs; then\n  lt_cv_objdir=.libs\nelse\n  # MS-DOS does not allow filenames that begin with a dot.\n  lt_cv_objdir=_libs\nfi\nrmdir .libs 2>/dev/null])\nobjdir=$lt_cv_objdir\n_LT_DECL([], [objdir], [0],\n         [The name of the directory that contains temporary libtool files])dnl\nm4_pattern_allow([LT_OBJDIR])dnl\nAC_DEFINE_UNQUOTED(LT_OBJDIR, \"$lt_cv_objdir/\",\n  [Define to the sub-directory in which libtool stores uninstalled libraries.])\n])# _LT_CHECK_OBJDIR\n\n\n# _LT_LINKER_HARDCODE_LIBPATH([TAGNAME])\n# --------------------------------------\n# Check hardcoding attributes.\nm4_defun([_LT_LINKER_HARDCODE_LIBPATH],\n[AC_MSG_CHECKING([how to hardcode library paths into programs])\n_LT_TAGVAR(hardcode_action, $1)=\nif test -n \"$_LT_TAGVAR(hardcode_libdir_flag_spec, $1)\" ||\n   test -n \"$_LT_TAGVAR(runpath_var, $1)\" ||\n   test \"X$_LT_TAGVAR(hardcode_automatic, $1)\" = \"Xyes\" ; then\n\n  # We can hardcode non-existent directories.\n  if test \"$_LT_TAGVAR(hardcode_direct, $1)\" != no &&\n     # If the only mechanism to avoid hardcoding is shlibpath_var, we\n     # have to relink, otherwise we might link with an installed library\n     # when we should be linking with a yet-to-be-installed one\n     ## test \"$_LT_TAGVAR(hardcode_shlibpath_var, $1)\" != no &&\n     test \"$_LT_TAGVAR(hardcode_minus_L, $1)\" != no; then\n    # Linking always hardcodes the temporary library directory.\n    _LT_TAGVAR(hardcode_action, $1)=relink\n  else\n    # We can link without hardcoding, and we can hardcode nonexisting dirs.\n    _LT_TAGVAR(hardcode_action, $1)=immediate\n  fi\nelse\n  # We cannot hardcode anything, or else we can only hardcode existing\n  # directories.\n  _LT_TAGVAR(hardcode_action, $1)=unsupported\nfi\nAC_MSG_RESULT([$_LT_TAGVAR(hardcode_action, $1)])\n\nif test \"$_LT_TAGVAR(hardcode_action, $1)\" = relink ||\n   test \"$_LT_TAGVAR(inherit_rpath, $1)\" = yes; then\n  # Fast installation is not supported\n  enable_fast_install=no\nelif test \"$shlibpath_overrides_runpath\" = yes ||\n     test \"$enable_shared\" = no; then\n  # Fast installation is not necessary\n  enable_fast_install=needless\nfi\n_LT_TAGDECL([], [hardcode_action], [0],\n    [How to hardcode a shared library path into an executable])\n])# _LT_LINKER_HARDCODE_LIBPATH\n\n\n# _LT_CMD_STRIPLIB\n# ----------------\nm4_defun([_LT_CMD_STRIPLIB],\n[m4_require([_LT_DECL_EGREP])\nstriplib=\nold_striplib=\nAC_MSG_CHECKING([whether stripping libraries is possible])\nif test -n \"$STRIP\" && $STRIP -V 2>&1 | $GREP \"GNU strip\" >/dev/null; then\n  test -z \"$old_striplib\" && old_striplib=\"$STRIP --strip-debug\"\n  test -z \"$striplib\" && striplib=\"$STRIP --strip-unneeded\"\n  AC_MSG_RESULT([yes])\nelse\n# FIXME - insert some real tests, host_os isn't really good enough\n  case $host_os in\n  darwin*)\n    if test -n \"$STRIP\" ; then\n      striplib=\"$STRIP -x\"\n      old_striplib=\"$STRIP -S\"\n      AC_MSG_RESULT([yes])\n    else\n      AC_MSG_RESULT([no])\n    fi\n    ;;\n  *)\n    AC_MSG_RESULT([no])\n    ;;\n  esac\nfi\n_LT_DECL([], [old_striplib], [1], [Commands to strip libraries])\n_LT_DECL([], [striplib], [1])\n])# _LT_CMD_STRIPLIB\n\n\n# _LT_SYS_DYNAMIC_LINKER([TAG])\n# -----------------------------\n# PORTME Fill in your ld.so characteristics\nm4_defun([_LT_SYS_DYNAMIC_LINKER],\n[AC_REQUIRE([AC_CANONICAL_HOST])dnl\nm4_require([_LT_DECL_EGREP])dnl\nm4_require([_LT_FILEUTILS_DEFAULTS])dnl\nm4_require([_LT_DECL_OBJDUMP])dnl\nm4_require([_LT_DECL_SED])dnl\nm4_require([_LT_CHECK_SHELL_FEATURES])dnl\nAC_MSG_CHECKING([dynamic linker characteristics])\nm4_if([$1],\n\t[], [\nif test \"$GCC\" = yes; then\n  case $host_os in\n    darwin*) lt_awk_arg=\"/^libraries:/,/LR/\" ;;\n    *) lt_awk_arg=\"/^libraries:/\" ;;\n  esac\n  case $host_os in\n    mingw* | cegcc*) lt_sed_strip_eq=\"s,=\\([[A-Za-z]]:\\),\\1,g\" ;;\n    *) lt_sed_strip_eq=\"s,=/,/,g\" ;;\n  esac\n  lt_search_path_spec=`$CC -print-search-dirs | awk $lt_awk_arg | $SED -e \"s/^libraries://\" -e $lt_sed_strip_eq`\n  case $lt_search_path_spec in\n  *\\;*)\n    # if the path contains \";\" then we assume it to be the separator\n    # otherwise default to the standard path separator (i.e. \":\") - it is\n    # assumed that no part of a normal pathname contains \";\" but that should\n    # okay in the real world where \";\" in dirpaths is itself problematic.\n    lt_search_path_spec=`$ECHO \"$lt_search_path_spec\" | $SED 's/;/ /g'`\n    ;;\n  *)\n    lt_search_path_spec=`$ECHO \"$lt_search_path_spec\" | $SED \"s/$PATH_SEPARATOR/ /g\"`\n    ;;\n  esac\n  # Ok, now we have the path, separated by spaces, we can step through it\n  # and add multilib dir if necessary.\n  lt_tmp_lt_search_path_spec=\n  lt_multi_os_dir=`$CC $CPPFLAGS $CFLAGS $LDFLAGS -print-multi-os-directory 2>/dev/null`\n  for lt_sys_path in $lt_search_path_spec; do\n    if test -d \"$lt_sys_path/$lt_multi_os_dir\"; then\n      lt_tmp_lt_search_path_spec=\"$lt_tmp_lt_search_path_spec $lt_sys_path/$lt_multi_os_dir\"\n    else\n      test -d \"$lt_sys_path\" && \\\n\tlt_tmp_lt_search_path_spec=\"$lt_tmp_lt_search_path_spec $lt_sys_path\"\n    fi\n  done\n  lt_search_path_spec=`$ECHO \"$lt_tmp_lt_search_path_spec\" | awk '\nBEGIN {RS=\" \"; FS=\"/|\\n\";} {\n  lt_foo=\"\";\n  lt_count=0;\n  for (lt_i = NF; lt_i > 0; lt_i--) {\n    if ($lt_i != \"\" && $lt_i != \".\") {\n      if ($lt_i == \"..\") {\n        lt_count++;\n      } else {\n        if (lt_count == 0) {\n          lt_foo=\"/\" $lt_i lt_foo;\n        } else {\n          lt_count--;\n        }\n      }\n    }\n  }\n  if (lt_foo != \"\") { lt_freq[[lt_foo]]++; }\n  if (lt_freq[[lt_foo]] == 1) { print lt_foo; }\n}'`\n  # AWK program above erroneously prepends '/' to C:/dos/paths\n  # for these hosts.\n  case $host_os in\n    mingw* | cegcc*) lt_search_path_spec=`$ECHO \"$lt_search_path_spec\" |\\\n      $SED 's,/\\([[A-Za-z]]:\\),\\1,g'` ;;\n  esac\n  sys_lib_search_path_spec=`$ECHO \"$lt_search_path_spec\" | $lt_NL2SP`\nelse\n  sys_lib_search_path_spec=\"/lib /usr/lib /usr/local/lib\"\nfi])\nlibrary_names_spec=\nlibname_spec='lib$name'\nsoname_spec=\nshrext_cmds=\".so\"\npostinstall_cmds=\npostuninstall_cmds=\nfinish_cmds=\nfinish_eval=\nshlibpath_var=\nshlibpath_overrides_runpath=unknown\nversion_type=none\ndynamic_linker=\"$host_os ld.so\"\nsys_lib_dlsearch_path_spec=\"/lib /usr/lib\"\nneed_lib_prefix=unknown\nhardcode_into_libs=no\n\n# when you set need_version to no, make sure it does not cause -set_version\n# flags to be left without arguments\nneed_version=unknown\n\ncase $host_os in\naix3*)\n  version_type=linux # correct to gnu/linux during the next big refactor\n  library_names_spec='${libname}${release}${shared_ext}$versuffix $libname.a'\n  shlibpath_var=LIBPATH\n\n  # AIX 3 has no versioning support, so we append a major version to the name.\n  soname_spec='${libname}${release}${shared_ext}$major'\n  ;;\n\naix[[4-9]]*)\n  version_type=linux # correct to gnu/linux during the next big refactor\n  need_lib_prefix=no\n  need_version=no\n  hardcode_into_libs=yes\n  if test \"$host_cpu\" = ia64; then\n    # AIX 5 supports IA64\n    library_names_spec='${libname}${release}${shared_ext}$major ${libname}${release}${shared_ext}$versuffix $libname${shared_ext}'\n    shlibpath_var=LD_LIBRARY_PATH\n  else\n    # With GCC up to 2.95.x, collect2 would create an import file\n    # for dependence libraries.  The import file would start with\n    # the line `#! .'.  This would cause the generated library to\n    # depend on `.', always an invalid library.  This was fixed in\n    # development snapshots of GCC prior to 3.0.\n    case $host_os in\n      aix4 | aix4.[[01]] | aix4.[[01]].*)\n      if { echo '#if __GNUC__ > 2 || (__GNUC__ == 2 && __GNUC_MINOR__ >= 97)'\n\t   echo ' yes '\n\t   echo '#endif'; } | ${CC} -E - | $GREP yes > /dev/null; then\n\t:\n      else\n\tcan_build_shared=no\n      fi\n      ;;\n    esac\n    # AIX (on Power*) has no versioning support, so currently we can not hardcode correct\n    # soname into executable. Probably we can add versioning support to\n    # collect2, so additional links can be useful in future.\n    if test \"$aix_use_runtimelinking\" = yes; then\n      # If using run time linking (on AIX 4.2 or later) use lib<name>.so\n      # instead of lib<name>.a to let people know that these are not\n      # typical AIX shared libraries.\n      library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'\n    else\n      # We preserve .a as extension for shared libraries through AIX4.2\n      # and later when we are not doing run time linking.\n      library_names_spec='${libname}${release}.a $libname.a'\n      soname_spec='${libname}${release}${shared_ext}$major'\n    fi\n    shlibpath_var=LIBPATH\n  fi\n  ;;\n\namigaos*)\n  case $host_cpu in\n  powerpc)\n    # Since July 2007 AmigaOS4 officially supports .so libraries.\n    # When compiling the executable, add -use-dynld -Lsobjs: to the compileline.\n    library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'\n    ;;\n  m68k)\n    library_names_spec='$libname.ixlibrary $libname.a'\n    # Create ${libname}_ixlibrary.a entries in /sys/libs.\n    finish_eval='for lib in `ls $libdir/*.ixlibrary 2>/dev/null`; do libname=`func_echo_all \"$lib\" | $SED '\\''s%^.*/\\([[^/]]*\\)\\.ixlibrary$%\\1%'\\''`; test $RM /sys/libs/${libname}_ixlibrary.a; $show \"cd /sys/libs && $LN_S $lib ${libname}_ixlibrary.a\"; cd /sys/libs && $LN_S $lib ${libname}_ixlibrary.a || exit 1; done'\n    ;;\n  esac\n  ;;\n\nbeos*)\n  library_names_spec='${libname}${shared_ext}'\n  dynamic_linker=\"$host_os ld.so\"\n  shlibpath_var=LIBRARY_PATH\n  ;;\n\nbsdi[[45]]*)\n  version_type=linux # correct to gnu/linux during the next big refactor\n  need_version=no\n  library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'\n  soname_spec='${libname}${release}${shared_ext}$major'\n  finish_cmds='PATH=\"\\$PATH:/sbin\" ldconfig $libdir'\n  shlibpath_var=LD_LIBRARY_PATH\n  sys_lib_search_path_spec=\"/shlib /usr/lib /usr/X11/lib /usr/contrib/lib /lib /usr/local/lib\"\n  sys_lib_dlsearch_path_spec=\"/shlib /usr/lib /usr/local/lib\"\n  # the default ld.so.conf also contains /usr/contrib/lib and\n  # /usr/X11R6/lib (/usr/X11 is a link to /usr/X11R6), but let us allow\n  # libtool to hard-code these into programs\n  ;;\n\ncygwin* | mingw* | pw32* | cegcc*)\n  version_type=windows\n  shrext_cmds=\".dll\"\n  need_version=no\n  need_lib_prefix=no\n\n  case $GCC,$cc_basename in\n  yes,*)\n    # gcc\n    library_names_spec='$libname.dll.a'\n    # DLL is installed to $(libdir)/../bin by postinstall_cmds\n    postinstall_cmds='base_file=`basename \\${file}`~\n      dlpath=`$SHELL 2>&1 -c '\\''. $dir/'\\''\\${base_file}'\\''i; echo \\$dlname'\\''`~\n      dldir=$destdir/`dirname \\$dlpath`~\n      test -d \\$dldir || mkdir -p \\$dldir~\n      $install_prog $dir/$dlname \\$dldir/$dlname~\n      chmod a+x \\$dldir/$dlname~\n      if test -n '\\''$stripme'\\'' && test -n '\\''$striplib'\\''; then\n        eval '\\''$striplib \\$dldir/$dlname'\\'' || exit \\$?;\n      fi'\n    postuninstall_cmds='dldll=`$SHELL 2>&1 -c '\\''. $file; echo \\$dlname'\\''`~\n      dlpath=$dir/\\$dldll~\n       $RM \\$dlpath'\n    shlibpath_overrides_runpath=yes\n\n    case $host_os in\n    cygwin*)\n      # Cygwin DLLs use 'cyg' prefix rather than 'lib'\n      soname_spec='`echo ${libname} | sed -e 's/^lib/cyg/'``echo ${release} | $SED -e 's/[[.]]/-/g'`${versuffix}${shared_ext}'\nm4_if([$1], [],[\n      sys_lib_search_path_spec=\"$sys_lib_search_path_spec /usr/lib/w32api\"])\n      ;;\n    mingw* | cegcc*)\n      # MinGW DLLs use traditional 'lib' prefix\n      soname_spec='${libname}`echo ${release} | $SED -e 's/[[.]]/-/g'`${versuffix}${shared_ext}'\n      ;;\n    pw32*)\n      # pw32 DLLs use 'pw' prefix rather than 'lib'\n      library_names_spec='`echo ${libname} | sed -e 's/^lib/pw/'``echo ${release} | $SED -e 's/[[.]]/-/g'`${versuffix}${shared_ext}'\n      ;;\n    esac\n    dynamic_linker='Win32 ld.exe'\n    ;;\n\n  *,cl*)\n    # Native MSVC\n    libname_spec='$name'\n    soname_spec='${libname}`echo ${release} | $SED -e 's/[[.]]/-/g'`${versuffix}${shared_ext}'\n    library_names_spec='${libname}.dll.lib'\n\n    case $build_os in\n    mingw*)\n      sys_lib_search_path_spec=\n      lt_save_ifs=$IFS\n      IFS=';'\n      for lt_path in $LIB\n      do\n        IFS=$lt_save_ifs\n        # Let DOS variable expansion print the short 8.3 style file name.\n        lt_path=`cd \"$lt_path\" 2>/dev/null && cmd //C \"for %i in (\".\") do @echo %~si\"`\n        sys_lib_search_path_spec=\"$sys_lib_search_path_spec $lt_path\"\n      done\n      IFS=$lt_save_ifs\n      # Convert to MSYS style.\n      sys_lib_search_path_spec=`$ECHO \"$sys_lib_search_path_spec\" | sed -e 's|\\\\\\\\|/|g' -e 's| \\\\([[a-zA-Z]]\\\\):| /\\\\1|g' -e 's|^ ||'`\n      ;;\n    cygwin*)\n      # Convert to unix form, then to dos form, then back to unix form\n      # but this time dos style (no spaces!) so that the unix form looks\n      # like /cygdrive/c/PROGRA~1:/cygdr...\n      sys_lib_search_path_spec=`cygpath --path --unix \"$LIB\"`\n      sys_lib_search_path_spec=`cygpath --path --dos \"$sys_lib_search_path_spec\" 2>/dev/null`\n      sys_lib_search_path_spec=`cygpath --path --unix \"$sys_lib_search_path_spec\" | $SED -e \"s/$PATH_SEPARATOR/ /g\"`\n      ;;\n    *)\n      sys_lib_search_path_spec=\"$LIB\"\n      if $ECHO \"$sys_lib_search_path_spec\" | [$GREP ';[c-zC-Z]:/' >/dev/null]; then\n        # It is most probably a Windows format PATH.\n        sys_lib_search_path_spec=`$ECHO \"$sys_lib_search_path_spec\" | $SED -e 's/;/ /g'`\n      else\n        sys_lib_search_path_spec=`$ECHO \"$sys_lib_search_path_spec\" | $SED -e \"s/$PATH_SEPARATOR/ /g\"`\n      fi\n      # FIXME: find the short name or the path components, as spaces are\n      # common. (e.g. \"Program Files\" -> \"PROGRA~1\")\n      ;;\n    esac\n\n    # DLL is installed to $(libdir)/../bin by postinstall_cmds\n    postinstall_cmds='base_file=`basename \\${file}`~\n      dlpath=`$SHELL 2>&1 -c '\\''. $dir/'\\''\\${base_file}'\\''i; echo \\$dlname'\\''`~\n      dldir=$destdir/`dirname \\$dlpath`~\n      test -d \\$dldir || mkdir -p \\$dldir~\n      $install_prog $dir/$dlname \\$dldir/$dlname'\n    postuninstall_cmds='dldll=`$SHELL 2>&1 -c '\\''. $file; echo \\$dlname'\\''`~\n      dlpath=$dir/\\$dldll~\n       $RM \\$dlpath'\n    shlibpath_overrides_runpath=yes\n    dynamic_linker='Win32 link.exe'\n    ;;\n\n  *)\n    # Assume MSVC wrapper\n    library_names_spec='${libname}`echo ${release} | $SED -e 's/[[.]]/-/g'`${versuffix}${shared_ext} $libname.lib'\n    dynamic_linker='Win32 ld.exe'\n    ;;\n  esac\n  # FIXME: first we should search . and the directory the executable is in\n  shlibpath_var=PATH\n  ;;\n\ndarwin* | rhapsody*)\n  dynamic_linker=\"$host_os dyld\"\n  version_type=darwin\n  need_lib_prefix=no\n  need_version=no\n  library_names_spec='${libname}${release}${major}$shared_ext ${libname}$shared_ext'\n  soname_spec='${libname}${release}${major}$shared_ext'\n  shlibpath_overrides_runpath=yes\n  shlibpath_var=DYLD_LIBRARY_PATH\n  shrext_cmds='`test .$module = .yes && echo .so || echo .dylib`'\nm4_if([$1], [],[\n  sys_lib_search_path_spec=\"$sys_lib_search_path_spec /usr/local/lib\"])\n  sys_lib_dlsearch_path_spec='/usr/local/lib /lib /usr/lib'\n  ;;\n\ndgux*)\n  version_type=linux # correct to gnu/linux during the next big refactor\n  need_lib_prefix=no\n  need_version=no\n  library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname$shared_ext'\n  soname_spec='${libname}${release}${shared_ext}$major'\n  shlibpath_var=LD_LIBRARY_PATH\n  ;;\n\nfreebsd* | dragonfly*)\n  # DragonFly does not have aout.  When/if they implement a new\n  # versioning mechanism, adjust this.\n  if test -x /usr/bin/objformat; then\n    objformat=`/usr/bin/objformat`\n  else\n    case $host_os in\n    freebsd[[23]].*) objformat=aout ;;\n    *) objformat=elf ;;\n    esac\n  fi\n  version_type=freebsd-$objformat\n  case $version_type in\n    freebsd-elf*)\n      library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext} $libname${shared_ext}'\n      need_version=no\n      need_lib_prefix=no\n      ;;\n    freebsd-*)\n      library_names_spec='${libname}${release}${shared_ext}$versuffix $libname${shared_ext}$versuffix'\n      need_version=yes\n      ;;\n  esac\n  shlibpath_var=LD_LIBRARY_PATH\n  case $host_os in\n  freebsd2.*)\n    shlibpath_overrides_runpath=yes\n    ;;\n  freebsd3.[[01]]* | freebsdelf3.[[01]]*)\n    shlibpath_overrides_runpath=yes\n    hardcode_into_libs=yes\n    ;;\n  freebsd3.[[2-9]]* | freebsdelf3.[[2-9]]* | \\\n  freebsd4.[[0-5]] | freebsdelf4.[[0-5]] | freebsd4.1.1 | freebsdelf4.1.1)\n    shlibpath_overrides_runpath=no\n    hardcode_into_libs=yes\n    ;;\n  *) # from 4.6 on, and DragonFly\n    shlibpath_overrides_runpath=yes\n    hardcode_into_libs=yes\n    ;;\n  esac\n  ;;\n\nhaiku*)\n  version_type=linux # correct to gnu/linux during the next big refactor\n  need_lib_prefix=no\n  need_version=no\n  dynamic_linker=\"$host_os runtime_loader\"\n  library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}${major} ${libname}${shared_ext}'\n  soname_spec='${libname}${release}${shared_ext}$major'\n  shlibpath_var=LIBRARY_PATH\n  shlibpath_overrides_runpath=yes\n  sys_lib_dlsearch_path_spec='/boot/home/config/lib /boot/common/lib /boot/system/lib'\n  hardcode_into_libs=yes\n  ;;\n\nhpux9* | hpux10* | hpux11*)\n  # Give a soname corresponding to the major version so that dld.sl refuses to\n  # link against other versions.\n  version_type=sunos\n  need_lib_prefix=no\n  need_version=no\n  case $host_cpu in\n  ia64*)\n    shrext_cmds='.so'\n    hardcode_into_libs=yes\n    dynamic_linker=\"$host_os dld.so\"\n    shlibpath_var=LD_LIBRARY_PATH\n    shlibpath_overrides_runpath=yes # Unless +noenvvar is specified.\n    library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'\n    soname_spec='${libname}${release}${shared_ext}$major'\n    if test \"X$HPUX_IA64_MODE\" = X32; then\n      sys_lib_search_path_spec=\"/usr/lib/hpux32 /usr/local/lib/hpux32 /usr/local/lib\"\n    else\n      sys_lib_search_path_spec=\"/usr/lib/hpux64 /usr/local/lib/hpux64\"\n    fi\n    sys_lib_dlsearch_path_spec=$sys_lib_search_path_spec\n    ;;\n  hppa*64*)\n    shrext_cmds='.sl'\n    hardcode_into_libs=yes\n    dynamic_linker=\"$host_os dld.sl\"\n    shlibpath_var=LD_LIBRARY_PATH # How should we handle SHLIB_PATH\n    shlibpath_overrides_runpath=yes # Unless +noenvvar is specified.\n    library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'\n    soname_spec='${libname}${release}${shared_ext}$major'\n    sys_lib_search_path_spec=\"/usr/lib/pa20_64 /usr/ccs/lib/pa20_64\"\n    sys_lib_dlsearch_path_spec=$sys_lib_search_path_spec\n    ;;\n  *)\n    shrext_cmds='.sl'\n    dynamic_linker=\"$host_os dld.sl\"\n    shlibpath_var=SHLIB_PATH\n    shlibpath_overrides_runpath=no # +s is required to enable SHLIB_PATH\n    library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'\n    soname_spec='${libname}${release}${shared_ext}$major'\n    ;;\n  esac\n  # HP-UX runs *really* slowly unless shared libraries are mode 555, ...\n  postinstall_cmds='chmod 555 $lib'\n  # or fails outright, so override atomically:\n  install_override_mode=555\n  ;;\n\ninterix[[3-9]]*)\n  version_type=linux # correct to gnu/linux during the next big refactor\n  need_lib_prefix=no\n  need_version=no\n  library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${shared_ext}'\n  soname_spec='${libname}${release}${shared_ext}$major'\n  dynamic_linker='Interix 3.x ld.so.1 (PE, like ELF)'\n  shlibpath_var=LD_LIBRARY_PATH\n  shlibpath_overrides_runpath=no\n  hardcode_into_libs=yes\n  ;;\n\nirix5* | irix6* | nonstopux*)\n  case $host_os in\n    nonstopux*) version_type=nonstopux ;;\n    *)\n\tif test \"$lt_cv_prog_gnu_ld\" = yes; then\n\t\tversion_type=linux # correct to gnu/linux during the next big refactor\n\telse\n\t\tversion_type=irix\n\tfi ;;\n  esac\n  need_lib_prefix=no\n  need_version=no\n  soname_spec='${libname}${release}${shared_ext}$major'\n  library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${release}${shared_ext} $libname${shared_ext}'\n  case $host_os in\n  irix5* | nonstopux*)\n    libsuff= shlibsuff=\n    ;;\n  *)\n    case $LD in # libtool.m4 will add one of these switches to LD\n    *-32|*\"-32 \"|*-melf32bsmip|*\"-melf32bsmip \")\n      libsuff= shlibsuff= libmagic=32-bit;;\n    *-n32|*\"-n32 \"|*-melf32bmipn32|*\"-melf32bmipn32 \")\n      libsuff=32 shlibsuff=N32 libmagic=N32;;\n    *-64|*\"-64 \"|*-melf64bmip|*\"-melf64bmip \")\n      libsuff=64 shlibsuff=64 libmagic=64-bit;;\n    *) libsuff= shlibsuff= libmagic=never-match;;\n    esac\n    ;;\n  esac\n  shlibpath_var=LD_LIBRARY${shlibsuff}_PATH\n  shlibpath_overrides_runpath=no\n  sys_lib_search_path_spec=\"/usr/lib${libsuff} /lib${libsuff} /usr/local/lib${libsuff}\"\n  sys_lib_dlsearch_path_spec=\"/usr/lib${libsuff} /lib${libsuff}\"\n  hardcode_into_libs=yes\n  ;;\n\n# No shared lib support for Linux oldld, aout, or coff.\nlinux*oldld* | linux*aout* | linux*coff*)\n  dynamic_linker=no\n  ;;\n\n# This must be glibc/ELF.\nlinux* | k*bsd*-gnu | kopensolaris*-gnu | gnu*)\n  version_type=linux # correct to gnu/linux during the next big refactor\n  need_lib_prefix=no\n  need_version=no\n  library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'\n  soname_spec='${libname}${release}${shared_ext}$major'\n  finish_cmds='PATH=\"\\$PATH:/sbin\" ldconfig -n $libdir'\n  shlibpath_var=LD_LIBRARY_PATH\n  shlibpath_overrides_runpath=no\n\n  # Some binutils ld are patched to set DT_RUNPATH\n  AC_CACHE_VAL([lt_cv_shlibpath_overrides_runpath],\n    [lt_cv_shlibpath_overrides_runpath=no\n    save_LDFLAGS=$LDFLAGS\n    save_libdir=$libdir\n    eval \"libdir=/foo; wl=\\\"$_LT_TAGVAR(lt_prog_compiler_wl, $1)\\\"; \\\n\t LDFLAGS=\\\"\\$LDFLAGS $_LT_TAGVAR(hardcode_libdir_flag_spec, $1)\\\"\"\n    AC_LINK_IFELSE([AC_LANG_PROGRAM([],[])],\n      [AS_IF([ ($OBJDUMP -p conftest$ac_exeext) 2>/dev/null | grep \"RUNPATH.*$libdir\" >/dev/null],\n\t [lt_cv_shlibpath_overrides_runpath=yes])])\n    LDFLAGS=$save_LDFLAGS\n    libdir=$save_libdir\n    ])\n  shlibpath_overrides_runpath=$lt_cv_shlibpath_overrides_runpath\n\n  # This implies no fast_install, which is unacceptable.\n  # Some rework will be needed to allow for fast_install\n  # before this can be enabled.\n  hardcode_into_libs=yes\n\n  # Append ld.so.conf contents to the search path\n  if test -f /etc/ld.so.conf; then\n    lt_ld_extra=`awk '/^include / { system(sprintf(\"cd /etc; cat %s 2>/dev/null\", \\[$]2)); skip = 1; } { if (!skip) print \\[$]0; skip = 0; }' < /etc/ld.so.conf | $SED -e 's/#.*//;/^[\t ]*hwcap[\t ]/d;s/[:,\t]/ /g;s/=[^=]*$//;s/=[^= ]* / /g;s/\"//g;/^$/d' | tr '\\n' ' '`\n    sys_lib_dlsearch_path_spec=\"/lib /usr/lib $lt_ld_extra\"\n  fi\n\n  # We used to test for /lib/ld.so.1 and disable shared libraries on\n  # powerpc, because MkLinux only supported shared libraries with the\n  # GNU dynamic linker.  Since this was broken with cross compilers,\n  # most powerpc-linux boxes support dynamic linking these days and\n  # people can always --disable-shared, the test was removed, and we\n  # assume the GNU/Linux dynamic linker is in use.\n  dynamic_linker='GNU/Linux ld.so'\n  ;;\n\nnetbsdelf*-gnu)\n  version_type=linux\n  need_lib_prefix=no\n  need_version=no\n  library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${shared_ext}'\n  soname_spec='${libname}${release}${shared_ext}$major'\n  shlibpath_var=LD_LIBRARY_PATH\n  shlibpath_overrides_runpath=no\n  hardcode_into_libs=yes\n  dynamic_linker='NetBSD ld.elf_so'\n  ;;\n\nnetbsd*)\n  version_type=sunos\n  need_lib_prefix=no\n  need_version=no\n  if echo __ELF__ | $CC -E - | $GREP __ELF__ >/dev/null; then\n    library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${shared_ext}$versuffix'\n    finish_cmds='PATH=\"\\$PATH:/sbin\" ldconfig -m $libdir'\n    dynamic_linker='NetBSD (a.out) ld.so'\n  else\n    library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${shared_ext}'\n    soname_spec='${libname}${release}${shared_ext}$major'\n    dynamic_linker='NetBSD ld.elf_so'\n  fi\n  shlibpath_var=LD_LIBRARY_PATH\n  shlibpath_overrides_runpath=yes\n  hardcode_into_libs=yes\n  ;;\n\nnewsos6)\n  version_type=linux # correct to gnu/linux during the next big refactor\n  library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'\n  shlibpath_var=LD_LIBRARY_PATH\n  shlibpath_overrides_runpath=yes\n  ;;\n\n*nto* | *qnx*)\n  version_type=qnx\n  need_lib_prefix=no\n  need_version=no\n  library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'\n  soname_spec='${libname}${release}${shared_ext}$major'\n  shlibpath_var=LD_LIBRARY_PATH\n  shlibpath_overrides_runpath=no\n  hardcode_into_libs=yes\n  dynamic_linker='ldqnx.so'\n  ;;\n\nopenbsd*)\n  version_type=sunos\n  sys_lib_dlsearch_path_spec=\"/usr/lib\"\n  need_lib_prefix=no\n  # Some older versions of OpenBSD (3.3 at least) *do* need versioned libs.\n  case $host_os in\n    openbsd3.3 | openbsd3.3.*)\tneed_version=yes ;;\n    *)\t\t\t\tneed_version=no  ;;\n  esac\n  library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${shared_ext}$versuffix'\n  finish_cmds='PATH=\"\\$PATH:/sbin\" ldconfig -m $libdir'\n  shlibpath_var=LD_LIBRARY_PATH\n  if test -z \"`echo __ELF__ | $CC -E - | $GREP __ELF__`\" || test \"$host_os-$host_cpu\" = \"openbsd2.8-powerpc\"; then\n    case $host_os in\n      openbsd2.[[89]] | openbsd2.[[89]].*)\n\tshlibpath_overrides_runpath=no\n\t;;\n      *)\n\tshlibpath_overrides_runpath=yes\n\t;;\n      esac\n  else\n    shlibpath_overrides_runpath=yes\n  fi\n  ;;\n\nos2*)\n  libname_spec='$name'\n  shrext_cmds=\".dll\"\n  need_lib_prefix=no\n  library_names_spec='$libname${shared_ext} $libname.a'\n  dynamic_linker='OS/2 ld.exe'\n  shlibpath_var=LIBPATH\n  ;;\n\nosf3* | osf4* | osf5*)\n  version_type=osf\n  need_lib_prefix=no\n  need_version=no\n  soname_spec='${libname}${release}${shared_ext}$major'\n  library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'\n  shlibpath_var=LD_LIBRARY_PATH\n  sys_lib_search_path_spec=\"/usr/shlib /usr/ccs/lib /usr/lib/cmplrs/cc /usr/lib /usr/local/lib /var/shlib\"\n  sys_lib_dlsearch_path_spec=\"$sys_lib_search_path_spec\"\n  ;;\n\nrdos*)\n  dynamic_linker=no\n  ;;\n\nsolaris*)\n  version_type=linux # correct to gnu/linux during the next big refactor\n  need_lib_prefix=no\n  need_version=no\n  library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'\n  soname_spec='${libname}${release}${shared_ext}$major'\n  shlibpath_var=LD_LIBRARY_PATH\n  shlibpath_overrides_runpath=yes\n  hardcode_into_libs=yes\n  # ldd complains unless libraries are executable\n  postinstall_cmds='chmod +x $lib'\n  ;;\n\nsunos4*)\n  version_type=sunos\n  library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${shared_ext}$versuffix'\n  finish_cmds='PATH=\"\\$PATH:/usr/etc\" ldconfig $libdir'\n  shlibpath_var=LD_LIBRARY_PATH\n  shlibpath_overrides_runpath=yes\n  if test \"$with_gnu_ld\" = yes; then\n    need_lib_prefix=no\n  fi\n  need_version=yes\n  ;;\n\nsysv4 | sysv4.3*)\n  version_type=linux # correct to gnu/linux during the next big refactor\n  library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'\n  soname_spec='${libname}${release}${shared_ext}$major'\n  shlibpath_var=LD_LIBRARY_PATH\n  case $host_vendor in\n    sni)\n      shlibpath_overrides_runpath=no\n      need_lib_prefix=no\n      runpath_var=LD_RUN_PATH\n      ;;\n    siemens)\n      need_lib_prefix=no\n      ;;\n    motorola)\n      need_lib_prefix=no\n      need_version=no\n      shlibpath_overrides_runpath=no\n      sys_lib_search_path_spec='/lib /usr/lib /usr/ccs/lib'\n      ;;\n  esac\n  ;;\n\nsysv4*MP*)\n  if test -d /usr/nec ;then\n    version_type=linux # correct to gnu/linux during the next big refactor\n    library_names_spec='$libname${shared_ext}.$versuffix $libname${shared_ext}.$major $libname${shared_ext}'\n    soname_spec='$libname${shared_ext}.$major'\n    shlibpath_var=LD_LIBRARY_PATH\n  fi\n  ;;\n\nsysv5* | sco3.2v5* | sco5v6* | unixware* | OpenUNIX* | sysv4*uw2*)\n  version_type=freebsd-elf\n  need_lib_prefix=no\n  need_version=no\n  library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext} $libname${shared_ext}'\n  soname_spec='${libname}${release}${shared_ext}$major'\n  shlibpath_var=LD_LIBRARY_PATH\n  shlibpath_overrides_runpath=yes\n  hardcode_into_libs=yes\n  if test \"$with_gnu_ld\" = yes; then\n    sys_lib_search_path_spec='/usr/local/lib /usr/gnu/lib /usr/ccs/lib /usr/lib /lib'\n  else\n    sys_lib_search_path_spec='/usr/ccs/lib /usr/lib'\n    case $host_os in\n      sco3.2v5*)\n        sys_lib_search_path_spec=\"$sys_lib_search_path_spec /lib\"\n\t;;\n    esac\n  fi\n  sys_lib_dlsearch_path_spec='/usr/lib'\n  ;;\n\ntpf*)\n  # TPF is a cross-target only.  Preferred cross-host = GNU/Linux.\n  version_type=linux # correct to gnu/linux during the next big refactor\n  need_lib_prefix=no\n  need_version=no\n  library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'\n  shlibpath_var=LD_LIBRARY_PATH\n  shlibpath_overrides_runpath=no\n  hardcode_into_libs=yes\n  ;;\n\nuts4*)\n  version_type=linux # correct to gnu/linux during the next big refactor\n  library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'\n  soname_spec='${libname}${release}${shared_ext}$major'\n  shlibpath_var=LD_LIBRARY_PATH\n  ;;\n\n*)\n  dynamic_linker=no\n  ;;\nesac\nAC_MSG_RESULT([$dynamic_linker])\ntest \"$dynamic_linker\" = no && can_build_shared=no\n\nvariables_saved_for_relink=\"PATH $shlibpath_var $runpath_var\"\nif test \"$GCC\" = yes; then\n  variables_saved_for_relink=\"$variables_saved_for_relink GCC_EXEC_PREFIX COMPILER_PATH LIBRARY_PATH\"\nfi\n\nif test \"${lt_cv_sys_lib_search_path_spec+set}\" = set; then\n  sys_lib_search_path_spec=\"$lt_cv_sys_lib_search_path_spec\"\nfi\nif test \"${lt_cv_sys_lib_dlsearch_path_spec+set}\" = set; then\n  sys_lib_dlsearch_path_spec=\"$lt_cv_sys_lib_dlsearch_path_spec\"\nfi\n\n_LT_DECL([], [variables_saved_for_relink], [1],\n    [Variables whose values should be saved in libtool wrapper scripts and\n    restored at link time])\n_LT_DECL([], [need_lib_prefix], [0],\n    [Do we need the \"lib\" prefix for modules?])\n_LT_DECL([], [need_version], [0], [Do we need a version for libraries?])\n_LT_DECL([], [version_type], [0], [Library versioning type])\n_LT_DECL([], [runpath_var], [0],  [Shared library runtime path variable])\n_LT_DECL([], [shlibpath_var], [0],[Shared library path variable])\n_LT_DECL([], [shlibpath_overrides_runpath], [0],\n    [Is shlibpath searched before the hard-coded library search path?])\n_LT_DECL([], [libname_spec], [1], [Format of library name prefix])\n_LT_DECL([], [library_names_spec], [1],\n    [[List of archive names.  First name is the real one, the rest are links.\n    The last name is the one that the linker finds with -lNAME]])\n_LT_DECL([], [soname_spec], [1],\n    [[The coded name of the library, if different from the real name]])\n_LT_DECL([], [install_override_mode], [1],\n    [Permission mode override for installation of shared libraries])\n_LT_DECL([], [postinstall_cmds], [2],\n    [Command to use after installation of a shared archive])\n_LT_DECL([], [postuninstall_cmds], [2],\n    [Command to use after uninstallation of a shared archive])\n_LT_DECL([], [finish_cmds], [2],\n    [Commands used to finish a libtool library installation in a directory])\n_LT_DECL([], [finish_eval], [1],\n    [[As \"finish_cmds\", except a single script fragment to be evaled but\n    not shown]])\n_LT_DECL([], [hardcode_into_libs], [0],\n    [Whether we should hardcode library paths into libraries])\n_LT_DECL([], [sys_lib_search_path_spec], [2],\n    [Compile-time system search path for libraries])\n_LT_DECL([], [sys_lib_dlsearch_path_spec], [2],\n    [Run-time system search path for libraries])\n])# _LT_SYS_DYNAMIC_LINKER\n\n\n# _LT_PATH_TOOL_PREFIX(TOOL)\n# --------------------------\n# find a file program which can recognize shared library\nAC_DEFUN([_LT_PATH_TOOL_PREFIX],\n[m4_require([_LT_DECL_EGREP])dnl\nAC_MSG_CHECKING([for $1])\nAC_CACHE_VAL(lt_cv_path_MAGIC_CMD,\n[case $MAGIC_CMD in\n[[\\\\/*] |  ?:[\\\\/]*])\n  lt_cv_path_MAGIC_CMD=\"$MAGIC_CMD\" # Let the user override the test with a path.\n  ;;\n*)\n  lt_save_MAGIC_CMD=\"$MAGIC_CMD\"\n  lt_save_ifs=\"$IFS\"; IFS=$PATH_SEPARATOR\ndnl $ac_dummy forces splitting on constant user-supplied paths.\ndnl POSIX.2 word splitting is done only on the output of word expansions,\ndnl not every word.  This closes a longstanding sh security hole.\n  ac_dummy=\"m4_if([$2], , $PATH, [$2])\"\n  for ac_dir in $ac_dummy; do\n    IFS=\"$lt_save_ifs\"\n    test -z \"$ac_dir\" && ac_dir=.\n    if test -f $ac_dir/$1; then\n      lt_cv_path_MAGIC_CMD=\"$ac_dir/$1\"\n      if test -n \"$file_magic_test_file\"; then\n\tcase $deplibs_check_method in\n\t\"file_magic \"*)\n\t  file_magic_regex=`expr \"$deplibs_check_method\" : \"file_magic \\(.*\\)\"`\n\t  MAGIC_CMD=\"$lt_cv_path_MAGIC_CMD\"\n\t  if eval $file_magic_cmd \\$file_magic_test_file 2> /dev/null |\n\t    $EGREP \"$file_magic_regex\" > /dev/null; then\n\t    :\n\t  else\n\t    cat <<_LT_EOF 1>&2\n\n*** Warning: the command libtool uses to detect shared libraries,\n*** $file_magic_cmd, produces output that libtool cannot recognize.\n*** The result is that libtool may fail to recognize shared libraries\n*** as such.  This will affect the creation of libtool libraries that\n*** depend on shared libraries, but programs linked with such libtool\n*** libraries will work regardless of this problem.  Nevertheless, you\n*** may want to report the problem to your system manager and/or to\n*** bug-libtool@gnu.org\n\n_LT_EOF\n\t  fi ;;\n\tesac\n      fi\n      break\n    fi\n  done\n  IFS=\"$lt_save_ifs\"\n  MAGIC_CMD=\"$lt_save_MAGIC_CMD\"\n  ;;\nesac])\nMAGIC_CMD=\"$lt_cv_path_MAGIC_CMD\"\nif test -n \"$MAGIC_CMD\"; then\n  AC_MSG_RESULT($MAGIC_CMD)\nelse\n  AC_MSG_RESULT(no)\nfi\n_LT_DECL([], [MAGIC_CMD], [0],\n\t [Used to examine libraries when file_magic_cmd begins with \"file\"])dnl\n])# _LT_PATH_TOOL_PREFIX\n\n# Old name:\nAU_ALIAS([AC_PATH_TOOL_PREFIX], [_LT_PATH_TOOL_PREFIX])\ndnl aclocal-1.4 backwards compatibility:\ndnl AC_DEFUN([AC_PATH_TOOL_PREFIX], [])\n\n\n# _LT_PATH_MAGIC\n# --------------\n# find a file program which can recognize a shared library\nm4_defun([_LT_PATH_MAGIC],\n[_LT_PATH_TOOL_PREFIX(${ac_tool_prefix}file, /usr/bin$PATH_SEPARATOR$PATH)\nif test -z \"$lt_cv_path_MAGIC_CMD\"; then\n  if test -n \"$ac_tool_prefix\"; then\n    _LT_PATH_TOOL_PREFIX(file, /usr/bin$PATH_SEPARATOR$PATH)\n  else\n    MAGIC_CMD=:\n  fi\nfi\n])# _LT_PATH_MAGIC\n\n\n# LT_PATH_LD\n# ----------\n# find the pathname to the GNU or non-GNU linker\nAC_DEFUN([LT_PATH_LD],\n[AC_REQUIRE([AC_PROG_CC])dnl\nAC_REQUIRE([AC_CANONICAL_HOST])dnl\nAC_REQUIRE([AC_CANONICAL_BUILD])dnl\nm4_require([_LT_DECL_SED])dnl\nm4_require([_LT_DECL_EGREP])dnl\nm4_require([_LT_PROG_ECHO_BACKSLASH])dnl\n\nAC_ARG_WITH([gnu-ld],\n    [AS_HELP_STRING([--with-gnu-ld],\n\t[assume the C compiler uses GNU ld @<:@default=no@:>@])],\n    [test \"$withval\" = no || with_gnu_ld=yes],\n    [with_gnu_ld=no])dnl\n\nac_prog=ld\nif test \"$GCC\" = yes; then\n  # Check if gcc -print-prog-name=ld gives a path.\n  AC_MSG_CHECKING([for ld used by $CC])\n  case $host in\n  *-*-mingw*)\n    # gcc leaves a trailing carriage return which upsets mingw\n    ac_prog=`($CC -print-prog-name=ld) 2>&5 | tr -d '\\015'` ;;\n  *)\n    ac_prog=`($CC -print-prog-name=ld) 2>&5` ;;\n  esac\n  case $ac_prog in\n    # Accept absolute paths.\n    [[\\\\/]]* | ?:[[\\\\/]]*)\n      re_direlt='/[[^/]][[^/]]*/\\.\\./'\n      # Canonicalize the pathname of ld\n      ac_prog=`$ECHO \"$ac_prog\"| $SED 's%\\\\\\\\%/%g'`\n      while $ECHO \"$ac_prog\" | $GREP \"$re_direlt\" > /dev/null 2>&1; do\n\tac_prog=`$ECHO $ac_prog| $SED \"s%$re_direlt%/%\"`\n      done\n      test -z \"$LD\" && LD=\"$ac_prog\"\n      ;;\n  \"\")\n    # If it fails, then pretend we aren't using GCC.\n    ac_prog=ld\n    ;;\n  *)\n    # If it is relative, then search for the first ld in PATH.\n    with_gnu_ld=unknown\n    ;;\n  esac\nelif test \"$with_gnu_ld\" = yes; then\n  AC_MSG_CHECKING([for GNU ld])\nelse\n  AC_MSG_CHECKING([for non-GNU ld])\nfi\nAC_CACHE_VAL(lt_cv_path_LD,\n[if test -z \"$LD\"; then\n  lt_save_ifs=\"$IFS\"; IFS=$PATH_SEPARATOR\n  for ac_dir in $PATH; do\n    IFS=\"$lt_save_ifs\"\n    test -z \"$ac_dir\" && ac_dir=.\n    if test -f \"$ac_dir/$ac_prog\" || test -f \"$ac_dir/$ac_prog$ac_exeext\"; then\n      lt_cv_path_LD=\"$ac_dir/$ac_prog\"\n      # Check to see if the program is GNU ld.  I'd rather use --version,\n      # but apparently some variants of GNU ld only accept -v.\n      # Break only if it was the GNU/non-GNU ld that we prefer.\n      case `\"$lt_cv_path_LD\" -v 2>&1 </dev/null` in\n      *GNU* | *'with BFD'*)\n\ttest \"$with_gnu_ld\" != no && break\n\t;;\n      *)\n\ttest \"$with_gnu_ld\" != yes && break\n\t;;\n      esac\n    fi\n  done\n  IFS=\"$lt_save_ifs\"\nelse\n  lt_cv_path_LD=\"$LD\" # Let the user override the test with a path.\nfi])\nLD=\"$lt_cv_path_LD\"\nif test -n \"$LD\"; then\n  AC_MSG_RESULT($LD)\nelse\n  AC_MSG_RESULT(no)\nfi\ntest -z \"$LD\" && AC_MSG_ERROR([no acceptable ld found in \\$PATH])\n_LT_PATH_LD_GNU\nAC_SUBST([LD])\n\n_LT_TAGDECL([], [LD], [1], [The linker used to build libraries])\n])# LT_PATH_LD\n\n# Old names:\nAU_ALIAS([AM_PROG_LD], [LT_PATH_LD])\nAU_ALIAS([AC_PROG_LD], [LT_PATH_LD])\ndnl aclocal-1.4 backwards compatibility:\ndnl AC_DEFUN([AM_PROG_LD], [])\ndnl AC_DEFUN([AC_PROG_LD], [])\n\n\n# _LT_PATH_LD_GNU\n#- --------------\nm4_defun([_LT_PATH_LD_GNU],\n[AC_CACHE_CHECK([if the linker ($LD) is GNU ld], lt_cv_prog_gnu_ld,\n[# I'd rather use --version here, but apparently some GNU lds only accept -v.\ncase `$LD -v 2>&1 </dev/null` in\n*GNU* | *'with BFD'*)\n  lt_cv_prog_gnu_ld=yes\n  ;;\n*)\n  lt_cv_prog_gnu_ld=no\n  ;;\nesac])\nwith_gnu_ld=$lt_cv_prog_gnu_ld\n])# _LT_PATH_LD_GNU\n\n\n# _LT_CMD_RELOAD\n# --------------\n# find reload flag for linker\n#   -- PORTME Some linkers may need a different reload flag.\nm4_defun([_LT_CMD_RELOAD],\n[AC_CACHE_CHECK([for $LD option to reload object files],\n  lt_cv_ld_reload_flag,\n  [lt_cv_ld_reload_flag='-r'])\nreload_flag=$lt_cv_ld_reload_flag\ncase $reload_flag in\n\"\" | \" \"*) ;;\n*) reload_flag=\" $reload_flag\" ;;\nesac\nreload_cmds='$LD$reload_flag -o $output$reload_objs'\ncase $host_os in\n  cygwin* | mingw* | pw32* | cegcc*)\n    if test \"$GCC\" != yes; then\n      reload_cmds=false\n    fi\n    ;;\n  darwin*)\n    if test \"$GCC\" = yes; then\n      reload_cmds='$LTCC $LTCFLAGS -nostdlib ${wl}-r -o $output$reload_objs'\n    else\n      reload_cmds='$LD$reload_flag -o $output$reload_objs'\n    fi\n    ;;\nesac\n_LT_TAGDECL([], [reload_flag], [1], [How to create reloadable object files])dnl\n_LT_TAGDECL([], [reload_cmds], [2])dnl\n])# _LT_CMD_RELOAD\n\n\n# _LT_CHECK_MAGIC_METHOD\n# ----------------------\n# how to check for library dependencies\n#  -- PORTME fill in with the dynamic library characteristics\nm4_defun([_LT_CHECK_MAGIC_METHOD],\n[m4_require([_LT_DECL_EGREP])\nm4_require([_LT_DECL_OBJDUMP])\nAC_CACHE_CHECK([how to recognize dependent libraries],\nlt_cv_deplibs_check_method,\n[lt_cv_file_magic_cmd='$MAGIC_CMD'\nlt_cv_file_magic_test_file=\nlt_cv_deplibs_check_method='unknown'\n# Need to set the preceding variable on all platforms that support\n# interlibrary dependencies.\n# 'none' -- dependencies not supported.\n# `unknown' -- same as none, but documents that we really don't know.\n# 'pass_all' -- all dependencies passed with no checks.\n# 'test_compile' -- check by making test program.\n# 'file_magic [[regex]]' -- check by looking for files in library path\n# which responds to the $file_magic_cmd with a given extended regex.\n# If you have `file' or equivalent on your system and you're not sure\n# whether `pass_all' will *always* work, you probably want this one.\n\ncase $host_os in\naix[[4-9]]*)\n  lt_cv_deplibs_check_method=pass_all\n  ;;\n\nbeos*)\n  lt_cv_deplibs_check_method=pass_all\n  ;;\n\nbsdi[[45]]*)\n  lt_cv_deplibs_check_method='file_magic ELF [[0-9]][[0-9]]*-bit [[ML]]SB (shared object|dynamic lib)'\n  lt_cv_file_magic_cmd='/usr/bin/file -L'\n  lt_cv_file_magic_test_file=/shlib/libc.so\n  ;;\n\ncygwin*)\n  # func_win32_libid is a shell function defined in ltmain.sh\n  lt_cv_deplibs_check_method='file_magic ^x86 archive import|^x86 DLL'\n  lt_cv_file_magic_cmd='func_win32_libid'\n  ;;\n\nmingw* | pw32*)\n  # Base MSYS/MinGW do not provide the 'file' command needed by\n  # func_win32_libid shell function, so use a weaker test based on 'objdump',\n  # unless we find 'file', for example because we are cross-compiling.\n  # func_win32_libid assumes BSD nm, so disallow it if using MS dumpbin.\n  if ( test \"$lt_cv_nm_interface\" = \"BSD nm\" && file / ) >/dev/null 2>&1; then\n    lt_cv_deplibs_check_method='file_magic ^x86 archive import|^x86 DLL'\n    lt_cv_file_magic_cmd='func_win32_libid'\n  else\n    # Keep this pattern in sync with the one in func_win32_libid.\n    lt_cv_deplibs_check_method='file_magic file format (pei*-i386(.*architecture: i386)?|pe-arm-wince|pe-x86-64)'\n    lt_cv_file_magic_cmd='$OBJDUMP -f'\n  fi\n  ;;\n\ncegcc*)\n  # use the weaker test based on 'objdump'. See mingw*.\n  lt_cv_deplibs_check_method='file_magic file format pe-arm-.*little(.*architecture: arm)?'\n  lt_cv_file_magic_cmd='$OBJDUMP -f'\n  ;;\n\ndarwin* | rhapsody*)\n  lt_cv_deplibs_check_method=pass_all\n  ;;\n\nfreebsd* | dragonfly*)\n  if echo __ELF__ | $CC -E - | $GREP __ELF__ > /dev/null; then\n    case $host_cpu in\n    i*86 )\n      # Not sure whether the presence of OpenBSD here was a mistake.\n      # Let's accept both of them until this is cleared up.\n      lt_cv_deplibs_check_method='file_magic (FreeBSD|OpenBSD|DragonFly)/i[[3-9]]86 (compact )?demand paged shared library'\n      lt_cv_file_magic_cmd=/usr/bin/file\n      lt_cv_file_magic_test_file=`echo /usr/lib/libc.so.*`\n      ;;\n    esac\n  else\n    lt_cv_deplibs_check_method=pass_all\n  fi\n  ;;\n\nhaiku*)\n  lt_cv_deplibs_check_method=pass_all\n  ;;\n\nhpux10.20* | hpux11*)\n  lt_cv_file_magic_cmd=/usr/bin/file\n  case $host_cpu in\n  ia64*)\n    lt_cv_deplibs_check_method='file_magic (s[[0-9]][[0-9]][[0-9]]|ELF-[[0-9]][[0-9]]) shared object file - IA64'\n    lt_cv_file_magic_test_file=/usr/lib/hpux32/libc.so\n    ;;\n  hppa*64*)\n    [lt_cv_deplibs_check_method='file_magic (s[0-9][0-9][0-9]|ELF[ -][0-9][0-9])(-bit)?( [LM]SB)? shared object( file)?[, -]* PA-RISC [0-9]\\.[0-9]']\n    lt_cv_file_magic_test_file=/usr/lib/pa20_64/libc.sl\n    ;;\n  *)\n    lt_cv_deplibs_check_method='file_magic (s[[0-9]][[0-9]][[0-9]]|PA-RISC[[0-9]]\\.[[0-9]]) shared library'\n    lt_cv_file_magic_test_file=/usr/lib/libc.sl\n    ;;\n  esac\n  ;;\n\ninterix[[3-9]]*)\n  # PIC code is broken on Interix 3.x, that's why |\\.a not |_pic\\.a here\n  lt_cv_deplibs_check_method='match_pattern /lib[[^/]]+(\\.so|\\.a)$'\n  ;;\n\nirix5* | irix6* | nonstopux*)\n  case $LD in\n  *-32|*\"-32 \") libmagic=32-bit;;\n  *-n32|*\"-n32 \") libmagic=N32;;\n  *-64|*\"-64 \") libmagic=64-bit;;\n  *) libmagic=never-match;;\n  esac\n  lt_cv_deplibs_check_method=pass_all\n  ;;\n\n# This must be glibc/ELF.\nlinux* | k*bsd*-gnu | kopensolaris*-gnu | gnu*)\n  lt_cv_deplibs_check_method=pass_all\n  ;;\n\nnetbsd* | netbsdelf*-gnu)\n  if echo __ELF__ | $CC -E - | $GREP __ELF__ > /dev/null; then\n    lt_cv_deplibs_check_method='match_pattern /lib[[^/]]+(\\.so\\.[[0-9]]+\\.[[0-9]]+|_pic\\.a)$'\n  else\n    lt_cv_deplibs_check_method='match_pattern /lib[[^/]]+(\\.so|_pic\\.a)$'\n  fi\n  ;;\n\nnewos6*)\n  lt_cv_deplibs_check_method='file_magic ELF [[0-9]][[0-9]]*-bit [[ML]]SB (executable|dynamic lib)'\n  lt_cv_file_magic_cmd=/usr/bin/file\n  lt_cv_file_magic_test_file=/usr/lib/libnls.so\n  ;;\n\n*nto* | *qnx*)\n  lt_cv_deplibs_check_method=pass_all\n  ;;\n\nopenbsd*)\n  if test -z \"`echo __ELF__ | $CC -E - | $GREP __ELF__`\" || test \"$host_os-$host_cpu\" = \"openbsd2.8-powerpc\"; then\n    lt_cv_deplibs_check_method='match_pattern /lib[[^/]]+(\\.so\\.[[0-9]]+\\.[[0-9]]+|\\.so|_pic\\.a)$'\n  else\n    lt_cv_deplibs_check_method='match_pattern /lib[[^/]]+(\\.so\\.[[0-9]]+\\.[[0-9]]+|_pic\\.a)$'\n  fi\n  ;;\n\nosf3* | osf4* | osf5*)\n  lt_cv_deplibs_check_method=pass_all\n  ;;\n\nrdos*)\n  lt_cv_deplibs_check_method=pass_all\n  ;;\n\nsolaris*)\n  lt_cv_deplibs_check_method=pass_all\n  ;;\n\nsysv5* | sco3.2v5* | sco5v6* | unixware* | OpenUNIX* | sysv4*uw2*)\n  lt_cv_deplibs_check_method=pass_all\n  ;;\n\nsysv4 | sysv4.3*)\n  case $host_vendor in\n  motorola)\n    lt_cv_deplibs_check_method='file_magic ELF [[0-9]][[0-9]]*-bit [[ML]]SB (shared object|dynamic lib) M[[0-9]][[0-9]]* Version [[0-9]]'\n    lt_cv_file_magic_test_file=`echo /usr/lib/libc.so*`\n    ;;\n  ncr)\n    lt_cv_deplibs_check_method=pass_all\n    ;;\n  sequent)\n    lt_cv_file_magic_cmd='/bin/file'\n    lt_cv_deplibs_check_method='file_magic ELF [[0-9]][[0-9]]*-bit [[LM]]SB (shared object|dynamic lib )'\n    ;;\n  sni)\n    lt_cv_file_magic_cmd='/bin/file'\n    lt_cv_deplibs_check_method=\"file_magic ELF [[0-9]][[0-9]]*-bit [[LM]]SB dynamic lib\"\n    lt_cv_file_magic_test_file=/lib/libc.so\n    ;;\n  siemens)\n    lt_cv_deplibs_check_method=pass_all\n    ;;\n  pc)\n    lt_cv_deplibs_check_method=pass_all\n    ;;\n  esac\n  ;;\n\ntpf*)\n  lt_cv_deplibs_check_method=pass_all\n  ;;\nesac\n])\n\nfile_magic_glob=\nwant_nocaseglob=no\nif test \"$build\" = \"$host\"; then\n  case $host_os in\n  mingw* | pw32*)\n    if ( shopt | grep nocaseglob ) >/dev/null 2>&1; then\n      want_nocaseglob=yes\n    else\n      file_magic_glob=`echo aAbBcCdDeEfFgGhHiIjJkKlLmMnNoOpPqQrRsStTuUvVwWxXyYzZ | $SED -e \"s/\\(..\\)/s\\/[[\\1]]\\/[[\\1]]\\/g;/g\"`\n    fi\n    ;;\n  esac\nfi\n\nfile_magic_cmd=$lt_cv_file_magic_cmd\ndeplibs_check_method=$lt_cv_deplibs_check_method\ntest -z \"$deplibs_check_method\" && deplibs_check_method=unknown\n\n_LT_DECL([], [deplibs_check_method], [1],\n    [Method to check whether dependent libraries are shared objects])\n_LT_DECL([], [file_magic_cmd], [1],\n    [Command to use when deplibs_check_method = \"file_magic\"])\n_LT_DECL([], [file_magic_glob], [1],\n    [How to find potential files when deplibs_check_method = \"file_magic\"])\n_LT_DECL([], [want_nocaseglob], [1],\n    [Find potential files using nocaseglob when deplibs_check_method = \"file_magic\"])\n])# _LT_CHECK_MAGIC_METHOD\n\n\n# LT_PATH_NM\n# ----------\n# find the pathname to a BSD- or MS-compatible name lister\nAC_DEFUN([LT_PATH_NM],\n[AC_REQUIRE([AC_PROG_CC])dnl\nAC_CACHE_CHECK([for BSD- or MS-compatible name lister (nm)], lt_cv_path_NM,\n[if test -n \"$NM\"; then\n  # Let the user override the test.\n  lt_cv_path_NM=\"$NM\"\nelse\n  lt_nm_to_check=\"${ac_tool_prefix}nm\"\n  if test -n \"$ac_tool_prefix\" && test \"$build\" = \"$host\"; then\n    lt_nm_to_check=\"$lt_nm_to_check nm\"\n  fi\n  for lt_tmp_nm in $lt_nm_to_check; do\n    lt_save_ifs=\"$IFS\"; IFS=$PATH_SEPARATOR\n    for ac_dir in $PATH /usr/ccs/bin/elf /usr/ccs/bin /usr/ucb /bin; do\n      IFS=\"$lt_save_ifs\"\n      test -z \"$ac_dir\" && ac_dir=.\n      tmp_nm=\"$ac_dir/$lt_tmp_nm\"\n      if test -f \"$tmp_nm\" || test -f \"$tmp_nm$ac_exeext\" ; then\n\t# Check to see if the nm accepts a BSD-compat flag.\n\t# Adding the `sed 1q' prevents false positives on HP-UX, which says:\n\t#   nm: unknown option \"B\" ignored\n\t# Tru64's nm complains that /dev/null is an invalid object file\n\tcase `\"$tmp_nm\" -B /dev/null 2>&1 | sed '1q'` in\n\t*/dev/null* | *'Invalid file or object type'*)\n\t  lt_cv_path_NM=\"$tmp_nm -B\"\n\t  break\n\t  ;;\n\t*)\n\t  case `\"$tmp_nm\" -p /dev/null 2>&1 | sed '1q'` in\n\t  */dev/null*)\n\t    lt_cv_path_NM=\"$tmp_nm -p\"\n\t    break\n\t    ;;\n\t  *)\n\t    lt_cv_path_NM=${lt_cv_path_NM=\"$tmp_nm\"} # keep the first match, but\n\t    continue # so that we can try to find one that supports BSD flags\n\t    ;;\n\t  esac\n\t  ;;\n\tesac\n      fi\n    done\n    IFS=\"$lt_save_ifs\"\n  done\n  : ${lt_cv_path_NM=no}\nfi])\nif test \"$lt_cv_path_NM\" != \"no\"; then\n  NM=\"$lt_cv_path_NM\"\nelse\n  # Didn't find any BSD compatible name lister, look for dumpbin.\n  if test -n \"$DUMPBIN\"; then :\n    # Let the user override the test.\n  else\n    AC_CHECK_TOOLS(DUMPBIN, [dumpbin \"link -dump\"], :)\n    case `$DUMPBIN -symbols /dev/null 2>&1 | sed '1q'` in\n    *COFF*)\n      DUMPBIN=\"$DUMPBIN -symbols\"\n      ;;\n    *)\n      DUMPBIN=:\n      ;;\n    esac\n  fi\n  AC_SUBST([DUMPBIN])\n  if test \"$DUMPBIN\" != \":\"; then\n    NM=\"$DUMPBIN\"\n  fi\nfi\ntest -z \"$NM\" && NM=nm\nAC_SUBST([NM])\n_LT_DECL([], [NM], [1], [A BSD- or MS-compatible name lister])dnl\n\nAC_CACHE_CHECK([the name lister ($NM) interface], [lt_cv_nm_interface],\n  [lt_cv_nm_interface=\"BSD nm\"\n  echo \"int some_variable = 0;\" > conftest.$ac_ext\n  (eval echo \"\\\"\\$as_me:$LINENO: $ac_compile\\\"\" >&AS_MESSAGE_LOG_FD)\n  (eval \"$ac_compile\" 2>conftest.err)\n  cat conftest.err >&AS_MESSAGE_LOG_FD\n  (eval echo \"\\\"\\$as_me:$LINENO: $NM \\\\\\\"conftest.$ac_objext\\\\\\\"\\\"\" >&AS_MESSAGE_LOG_FD)\n  (eval \"$NM \\\"conftest.$ac_objext\\\"\" 2>conftest.err > conftest.out)\n  cat conftest.err >&AS_MESSAGE_LOG_FD\n  (eval echo \"\\\"\\$as_me:$LINENO: output\\\"\" >&AS_MESSAGE_LOG_FD)\n  cat conftest.out >&AS_MESSAGE_LOG_FD\n  if $GREP 'External.*some_variable' conftest.out > /dev/null; then\n    lt_cv_nm_interface=\"MS dumpbin\"\n  fi\n  rm -f conftest*])\n])# LT_PATH_NM\n\n# Old names:\nAU_ALIAS([AM_PROG_NM], [LT_PATH_NM])\nAU_ALIAS([AC_PROG_NM], [LT_PATH_NM])\ndnl aclocal-1.4 backwards compatibility:\ndnl AC_DEFUN([AM_PROG_NM], [])\ndnl AC_DEFUN([AC_PROG_NM], [])\n\n# _LT_CHECK_SHAREDLIB_FROM_LINKLIB\n# --------------------------------\n# how to determine the name of the shared library\n# associated with a specific link library.\n#  -- PORTME fill in with the dynamic library characteristics\nm4_defun([_LT_CHECK_SHAREDLIB_FROM_LINKLIB],\n[m4_require([_LT_DECL_EGREP])\nm4_require([_LT_DECL_OBJDUMP])\nm4_require([_LT_DECL_DLLTOOL])\nAC_CACHE_CHECK([how to associate runtime and link libraries],\nlt_cv_sharedlib_from_linklib_cmd,\n[lt_cv_sharedlib_from_linklib_cmd='unknown'\n\ncase $host_os in\ncygwin* | mingw* | pw32* | cegcc*)\n  # two different shell functions defined in ltmain.sh\n  # decide which to use based on capabilities of $DLLTOOL\n  case `$DLLTOOL --help 2>&1` in\n  *--identify-strict*)\n    lt_cv_sharedlib_from_linklib_cmd=func_cygming_dll_for_implib\n    ;;\n  *)\n    lt_cv_sharedlib_from_linklib_cmd=func_cygming_dll_for_implib_fallback\n    ;;\n  esac\n  ;;\n*)\n  # fallback: assume linklib IS sharedlib\n  lt_cv_sharedlib_from_linklib_cmd=\"$ECHO\"\n  ;;\nesac\n])\nsharedlib_from_linklib_cmd=$lt_cv_sharedlib_from_linklib_cmd\ntest -z \"$sharedlib_from_linklib_cmd\" && sharedlib_from_linklib_cmd=$ECHO\n\n_LT_DECL([], [sharedlib_from_linklib_cmd], [1],\n    [Command to associate shared and link libraries])\n])# _LT_CHECK_SHAREDLIB_FROM_LINKLIB\n\n\n# _LT_PATH_MANIFEST_TOOL\n# ----------------------\n# locate the manifest tool\nm4_defun([_LT_PATH_MANIFEST_TOOL],\n[AC_CHECK_TOOL(MANIFEST_TOOL, mt, :)\ntest -z \"$MANIFEST_TOOL\" && MANIFEST_TOOL=mt\nAC_CACHE_CHECK([if $MANIFEST_TOOL is a manifest tool], [lt_cv_path_mainfest_tool],\n  [lt_cv_path_mainfest_tool=no\n  echo \"$as_me:$LINENO: $MANIFEST_TOOL '-?'\" >&AS_MESSAGE_LOG_FD\n  $MANIFEST_TOOL '-?' 2>conftest.err > conftest.out\n  cat conftest.err >&AS_MESSAGE_LOG_FD\n  if $GREP 'Manifest Tool' conftest.out > /dev/null; then\n    lt_cv_path_mainfest_tool=yes\n  fi\n  rm -f conftest*])\nif test \"x$lt_cv_path_mainfest_tool\" != xyes; then\n  MANIFEST_TOOL=:\nfi\n_LT_DECL([], [MANIFEST_TOOL], [1], [Manifest tool])dnl\n])# _LT_PATH_MANIFEST_TOOL\n\n\n# LT_LIB_M\n# --------\n# check for math library\nAC_DEFUN([LT_LIB_M],\n[AC_REQUIRE([AC_CANONICAL_HOST])dnl\nLIBM=\ncase $host in\n*-*-beos* | *-*-cegcc* | *-*-cygwin* | *-*-haiku* | *-*-pw32* | *-*-darwin*)\n  # These system don't have libm, or don't need it\n  ;;\n*-ncr-sysv4.3*)\n  AC_CHECK_LIB(mw, _mwvalidcheckl, LIBM=\"-lmw\")\n  AC_CHECK_LIB(m, cos, LIBM=\"$LIBM -lm\")\n  ;;\n*)\n  AC_CHECK_LIB(m, cos, LIBM=\"-lm\")\n  ;;\nesac\nAC_SUBST([LIBM])\n])# LT_LIB_M\n\n# Old name:\nAU_ALIAS([AC_CHECK_LIBM], [LT_LIB_M])\ndnl aclocal-1.4 backwards compatibility:\ndnl AC_DEFUN([AC_CHECK_LIBM], [])\n\n\n# _LT_COMPILER_NO_RTTI([TAGNAME])\n# -------------------------------\nm4_defun([_LT_COMPILER_NO_RTTI],\n[m4_require([_LT_TAG_COMPILER])dnl\n\n_LT_TAGVAR(lt_prog_compiler_no_builtin_flag, $1)=\n\nif test \"$GCC\" = yes; then\n  case $cc_basename in\n  nvcc*)\n    _LT_TAGVAR(lt_prog_compiler_no_builtin_flag, $1)=' -Xcompiler -fno-builtin' ;;\n  *)\n    _LT_TAGVAR(lt_prog_compiler_no_builtin_flag, $1)=' -fno-builtin' ;;\n  esac\n\n  _LT_COMPILER_OPTION([if $compiler supports -fno-rtti -fno-exceptions],\n    lt_cv_prog_compiler_rtti_exceptions,\n    [-fno-rtti -fno-exceptions], [],\n    [_LT_TAGVAR(lt_prog_compiler_no_builtin_flag, $1)=\"$_LT_TAGVAR(lt_prog_compiler_no_builtin_flag, $1) -fno-rtti -fno-exceptions\"])\nfi\n_LT_TAGDECL([no_builtin_flag], [lt_prog_compiler_no_builtin_flag], [1],\n\t[Compiler flag to turn off builtin functions])\n])# _LT_COMPILER_NO_RTTI\n\n\n# _LT_CMD_GLOBAL_SYMBOLS\n# ----------------------\nm4_defun([_LT_CMD_GLOBAL_SYMBOLS],\n[AC_REQUIRE([AC_CANONICAL_HOST])dnl\nAC_REQUIRE([AC_PROG_CC])dnl\nAC_REQUIRE([AC_PROG_AWK])dnl\nAC_REQUIRE([LT_PATH_NM])dnl\nAC_REQUIRE([LT_PATH_LD])dnl\nm4_require([_LT_DECL_SED])dnl\nm4_require([_LT_DECL_EGREP])dnl\nm4_require([_LT_TAG_COMPILER])dnl\n\n# Check for command to grab the raw symbol name followed by C symbol from nm.\nAC_MSG_CHECKING([command to parse $NM output from $compiler object])\nAC_CACHE_VAL([lt_cv_sys_global_symbol_pipe],\n[\n# These are sane defaults that work on at least a few old systems.\n# [They come from Ultrix.  What could be older than Ultrix?!! ;)]\n\n# Character class describing NM global symbol codes.\nsymcode='[[BCDEGRST]]'\n\n# Regexp to match symbols that can be accessed directly from C.\nsympat='\\([[_A-Za-z]][[_A-Za-z0-9]]*\\)'\n\n# Define system-specific variables.\ncase $host_os in\naix*)\n  symcode='[[BCDT]]'\n  ;;\ncygwin* | mingw* | pw32* | cegcc*)\n  symcode='[[ABCDGISTW]]'\n  ;;\nhpux*)\n  if test \"$host_cpu\" = ia64; then\n    symcode='[[ABCDEGRST]]'\n  fi\n  ;;\nirix* | nonstopux*)\n  symcode='[[BCDEGRST]]'\n  ;;\nosf*)\n  symcode='[[BCDEGQRST]]'\n  ;;\nsolaris*)\n  symcode='[[BDRT]]'\n  ;;\nsco3.2v5*)\n  symcode='[[DT]]'\n  ;;\nsysv4.2uw2*)\n  symcode='[[DT]]'\n  ;;\nsysv5* | sco5v6* | unixware* | OpenUNIX*)\n  symcode='[[ABDT]]'\n  ;;\nsysv4)\n  symcode='[[DFNSTU]]'\n  ;;\nesac\n\n# If we're using GNU nm, then use its standard symbol codes.\ncase `$NM -V 2>&1` in\n*GNU* | *'with BFD'*)\n  symcode='[[ABCDGIRSTW]]' ;;\nesac\n\n# Transform an extracted symbol line into a proper C declaration.\n# Some systems (esp. on ia64) link data and code symbols differently,\n# so use this general approach.\nlt_cv_sys_global_symbol_to_cdecl=\"sed -n -e 's/^T .* \\(.*\\)$/extern int \\1();/p' -e 's/^$symcode* .* \\(.*\\)$/extern char \\1;/p'\"\n\n# Transform an extracted symbol line into symbol name and symbol address\nlt_cv_sys_global_symbol_to_c_name_address=\"sed -n -e 's/^: \\([[^ ]]*\\)[[ ]]*$/  {\\\\\\\"\\1\\\\\\\", (void *) 0},/p' -e 's/^$symcode* \\([[^ ]]*\\) \\([[^ ]]*\\)$/  {\\\"\\2\\\", (void *) \\&\\2},/p'\"\nlt_cv_sys_global_symbol_to_c_name_address_lib_prefix=\"sed -n -e 's/^: \\([[^ ]]*\\)[[ ]]*$/  {\\\\\\\"\\1\\\\\\\", (void *) 0},/p' -e 's/^$symcode* \\([[^ ]]*\\) \\(lib[[^ ]]*\\)$/  {\\\"\\2\\\", (void *) \\&\\2},/p' -e 's/^$symcode* \\([[^ ]]*\\) \\([[^ ]]*\\)$/  {\\\"lib\\2\\\", (void *) \\&\\2},/p'\"\n\n# Handle CRLF in mingw tool chain\nopt_cr=\ncase $build_os in\nmingw*)\n  opt_cr=`$ECHO 'x\\{0,1\\}' | tr x '\\015'` # option cr in regexp\n  ;;\nesac\n\n# Try without a prefix underscore, then with it.\nfor ac_symprfx in \"\" \"_\"; do\n\n  # Transform symcode, sympat, and symprfx into a raw symbol and a C symbol.\n  symxfrm=\"\\\\1 $ac_symprfx\\\\2 \\\\2\"\n\n  # Write the raw and C identifiers.\n  if test \"$lt_cv_nm_interface\" = \"MS dumpbin\"; then\n    # Fake it for dumpbin and say T for any non-static function\n    # and D for any global variable.\n    # Also find C++ and __fastcall symbols from MSVC++,\n    # which start with @ or ?.\n    lt_cv_sys_global_symbol_pipe=\"$AWK ['\"\\\n\"     {last_section=section; section=\\$ 3};\"\\\n\"     /^COFF SYMBOL TABLE/{for(i in hide) delete hide[i]};\"\\\n\"     /Section length .*#relocs.*(pick any)/{hide[last_section]=1};\"\\\n\"     \\$ 0!~/External *\\|/{next};\"\\\n\"     / 0+ UNDEF /{next}; / UNDEF \\([^|]\\)*()/{next};\"\\\n\"     {if(hide[section]) next};\"\\\n\"     {f=0}; \\$ 0~/\\(\\).*\\|/{f=1}; {printf f ? \\\"T \\\" : \\\"D \\\"};\"\\\n\"     {split(\\$ 0, a, /\\||\\r/); split(a[2], s)};\"\\\n\"     s[1]~/^[@?]/{print s[1], s[1]; next};\"\\\n\"     s[1]~prfx {split(s[1],t,\\\"@\\\"); print t[1], substr(t[1],length(prfx))}\"\\\n\"     ' prfx=^$ac_symprfx]\"\n  else\n    lt_cv_sys_global_symbol_pipe=\"sed -n -e 's/^.*[[\t ]]\\($symcode$symcode*\\)[[\t ]][[\t ]]*$ac_symprfx$sympat$opt_cr$/$symxfrm/p'\"\n  fi\n  lt_cv_sys_global_symbol_pipe=\"$lt_cv_sys_global_symbol_pipe | sed '/ __gnu_lto/d'\"\n\n  # Check to see that the pipe works correctly.\n  pipe_works=no\n\n  rm -f conftest*\n  cat > conftest.$ac_ext <<_LT_EOF\n#ifdef __cplusplus\nextern \"C\" {\n#endif\nchar nm_test_var;\nvoid nm_test_func(void);\nvoid nm_test_func(void){}\n#ifdef __cplusplus\n}\n#endif\nint main(){nm_test_var='a';nm_test_func();return(0);}\n_LT_EOF\n\n  if AC_TRY_EVAL(ac_compile); then\n    # Now try to grab the symbols.\n    nlist=conftest.nm\n    if AC_TRY_EVAL(NM conftest.$ac_objext \\| \"$lt_cv_sys_global_symbol_pipe\" \\> $nlist) && test -s \"$nlist\"; then\n      # Try sorting and uniquifying the output.\n      if sort \"$nlist\" | uniq > \"$nlist\"T; then\n\tmv -f \"$nlist\"T \"$nlist\"\n      else\n\trm -f \"$nlist\"T\n      fi\n\n      # Make sure that we snagged all the symbols we need.\n      if $GREP ' nm_test_var$' \"$nlist\" >/dev/null; then\n\tif $GREP ' nm_test_func$' \"$nlist\" >/dev/null; then\n\t  cat <<_LT_EOF > conftest.$ac_ext\n/* Keep this code in sync between libtool.m4, ltmain, lt_system.h, and tests.  */\n#if defined(_WIN32) || defined(__CYGWIN__) || defined(_WIN32_WCE)\n/* DATA imports from DLLs on WIN32 con't be const, because runtime\n   relocations are performed -- see ld's documentation on pseudo-relocs.  */\n# define LT@&t@_DLSYM_CONST\n#elif defined(__osf__)\n/* This system does not cope well with relocations in const data.  */\n# define LT@&t@_DLSYM_CONST\n#else\n# define LT@&t@_DLSYM_CONST const\n#endif\n\n#ifdef __cplusplus\nextern \"C\" {\n#endif\n\n_LT_EOF\n\t  # Now generate the symbol file.\n\t  eval \"$lt_cv_sys_global_symbol_to_cdecl\"' < \"$nlist\" | $GREP -v main >> conftest.$ac_ext'\n\n\t  cat <<_LT_EOF >> conftest.$ac_ext\n\n/* The mapping between symbol names and symbols.  */\nLT@&t@_DLSYM_CONST struct {\n  const char *name;\n  void       *address;\n}\nlt__PROGRAM__LTX_preloaded_symbols[[]] =\n{\n  { \"@PROGRAM@\", (void *) 0 },\n_LT_EOF\n\t  $SED \"s/^$symcode$symcode* \\(.*\\) \\(.*\\)$/  {\\\"\\2\\\", (void *) \\&\\2},/\" < \"$nlist\" | $GREP -v main >> conftest.$ac_ext\n\t  cat <<\\_LT_EOF >> conftest.$ac_ext\n  {0, (void *) 0}\n};\n\n/* This works around a problem in FreeBSD linker */\n#ifdef FREEBSD_WORKAROUND\nstatic const void *lt_preloaded_setup() {\n  return lt__PROGRAM__LTX_preloaded_symbols;\n}\n#endif\n\n#ifdef __cplusplus\n}\n#endif\n_LT_EOF\n\t  # Now try linking the two files.\n\t  mv conftest.$ac_objext conftstm.$ac_objext\n\t  lt_globsym_save_LIBS=$LIBS\n\t  lt_globsym_save_CFLAGS=$CFLAGS\n\t  LIBS=\"conftstm.$ac_objext\"\n\t  CFLAGS=\"$CFLAGS$_LT_TAGVAR(lt_prog_compiler_no_builtin_flag, $1)\"\n\t  if AC_TRY_EVAL(ac_link) && test -s conftest${ac_exeext}; then\n\t    pipe_works=yes\n\t  fi\n\t  LIBS=$lt_globsym_save_LIBS\n\t  CFLAGS=$lt_globsym_save_CFLAGS\n\telse\n\t  echo \"cannot find nm_test_func in $nlist\" >&AS_MESSAGE_LOG_FD\n\tfi\n      else\n\techo \"cannot find nm_test_var in $nlist\" >&AS_MESSAGE_LOG_FD\n      fi\n    else\n      echo \"cannot run $lt_cv_sys_global_symbol_pipe\" >&AS_MESSAGE_LOG_FD\n    fi\n  else\n    echo \"$progname: failed program was:\" >&AS_MESSAGE_LOG_FD\n    cat conftest.$ac_ext >&5\n  fi\n  rm -rf conftest* conftst*\n\n  # Do not use the global_symbol_pipe unless it works.\n  if test \"$pipe_works\" = yes; then\n    break\n  else\n    lt_cv_sys_global_symbol_pipe=\n  fi\ndone\n])\nif test -z \"$lt_cv_sys_global_symbol_pipe\"; then\n  lt_cv_sys_global_symbol_to_cdecl=\nfi\nif test -z \"$lt_cv_sys_global_symbol_pipe$lt_cv_sys_global_symbol_to_cdecl\"; then\n  AC_MSG_RESULT(failed)\nelse\n  AC_MSG_RESULT(ok)\nfi\n\n# Response file support.\nif test \"$lt_cv_nm_interface\" = \"MS dumpbin\"; then\n  nm_file_list_spec='@'\nelif $NM --help 2>/dev/null | grep '[[@]]FILE' >/dev/null; then\n  nm_file_list_spec='@'\nfi\n\n_LT_DECL([global_symbol_pipe], [lt_cv_sys_global_symbol_pipe], [1],\n    [Take the output of nm and produce a listing of raw symbols and C names])\n_LT_DECL([global_symbol_to_cdecl], [lt_cv_sys_global_symbol_to_cdecl], [1],\n    [Transform the output of nm in a proper C declaration])\n_LT_DECL([global_symbol_to_c_name_address],\n    [lt_cv_sys_global_symbol_to_c_name_address], [1],\n    [Transform the output of nm in a C name address pair])\n_LT_DECL([global_symbol_to_c_name_address_lib_prefix],\n    [lt_cv_sys_global_symbol_to_c_name_address_lib_prefix], [1],\n    [Transform the output of nm in a C name address pair when lib prefix is needed])\n_LT_DECL([], [nm_file_list_spec], [1],\n    [Specify filename containing input files for $NM])\n]) # _LT_CMD_GLOBAL_SYMBOLS\n\n\n# _LT_COMPILER_PIC([TAGNAME])\n# ---------------------------\nm4_defun([_LT_COMPILER_PIC],\n[m4_require([_LT_TAG_COMPILER])dnl\n_LT_TAGVAR(lt_prog_compiler_wl, $1)=\n_LT_TAGVAR(lt_prog_compiler_pic, $1)=\n_LT_TAGVAR(lt_prog_compiler_static, $1)=\n\nm4_if([$1], [CXX], [\n  # C++ specific cases for pic, static, wl, etc.\n  if test \"$GXX\" = yes; then\n    _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'\n    _LT_TAGVAR(lt_prog_compiler_static, $1)='-static'\n\n    case $host_os in\n    aix*)\n      # All AIX code is PIC.\n      if test \"$host_cpu\" = ia64; then\n\t# AIX 5 now supports IA64 processor\n\t_LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic'\n      fi\n      ;;\n\n    amigaos*)\n      case $host_cpu in\n      powerpc)\n            # see comment about AmigaOS4 .so support\n            _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC'\n        ;;\n      m68k)\n            # FIXME: we need at least 68020 code to build shared libraries, but\n            # adding the `-m68020' flag to GCC prevents building anything better,\n            # like `-m68040'.\n            _LT_TAGVAR(lt_prog_compiler_pic, $1)='-m68020 -resident32 -malways-restore-a4'\n        ;;\n      esac\n      ;;\n\n    beos* | irix5* | irix6* | nonstopux* | osf3* | osf4* | osf5*)\n      # PIC is the default for these OSes.\n      ;;\n    mingw* | cygwin* | os2* | pw32* | cegcc*)\n      # This hack is so that the source file can tell whether it is being\n      # built for inclusion in a dll (and should export symbols for example).\n      # Although the cygwin gcc ignores -fPIC, still need this for old-style\n      # (--disable-auto-import) libraries\n      m4_if([$1], [GCJ], [],\n\t[_LT_TAGVAR(lt_prog_compiler_pic, $1)='-DDLL_EXPORT'])\n      ;;\n    darwin* | rhapsody*)\n      # PIC is the default on this platform\n      # Common symbols not allowed in MH_DYLIB files\n      _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fno-common'\n      ;;\n    *djgpp*)\n      # DJGPP does not support shared libraries at all\n      _LT_TAGVAR(lt_prog_compiler_pic, $1)=\n      ;;\n    haiku*)\n      # PIC is the default for Haiku.\n      # The \"-static\" flag exists, but is broken.\n      _LT_TAGVAR(lt_prog_compiler_static, $1)=\n      ;;\n    interix[[3-9]]*)\n      # Interix 3.x gcc -fpic/-fPIC options generate broken code.\n      # Instead, we relocate shared libraries at runtime.\n      ;;\n    sysv4*MP*)\n      if test -d /usr/nec; then\n\t_LT_TAGVAR(lt_prog_compiler_pic, $1)=-Kconform_pic\n      fi\n      ;;\n    hpux*)\n      # PIC is the default for 64-bit PA HP-UX, but not for 32-bit\n      # PA HP-UX.  On IA64 HP-UX, PIC is the default but the pic flag\n      # sets the default TLS model and affects inlining.\n      case $host_cpu in\n      hppa*64*)\n\t;;\n      *)\n\t_LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC'\n\t;;\n      esac\n      ;;\n    *qnx* | *nto*)\n      # QNX uses GNU C++, but need to define -shared option too, otherwise\n      # it will coredump.\n      _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC -shared'\n      ;;\n    *)\n      _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC'\n      ;;\n    esac\n  else\n    case $host_os in\n      aix[[4-9]]*)\n\t# All AIX code is PIC.\n\tif test \"$host_cpu\" = ia64; then\n\t  # AIX 5 now supports IA64 processor\n\t  _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic'\n\telse\n\t  _LT_TAGVAR(lt_prog_compiler_static, $1)='-bnso -bI:/lib/syscalls.exp'\n\tfi\n\t;;\n      chorus*)\n\tcase $cc_basename in\n\tcxch68*)\n\t  # Green Hills C++ Compiler\n\t  # _LT_TAGVAR(lt_prog_compiler_static, $1)=\"--no_auto_instantiation -u __main -u __premain -u _abort -r $COOL_DIR/lib/libOrb.a $MVME_DIR/lib/CC/libC.a $MVME_DIR/lib/classix/libcx.s.a\"\n\t  ;;\n\tesac\n\t;;\n      mingw* | cygwin* | os2* | pw32* | cegcc*)\n\t# This hack is so that the source file can tell whether it is being\n\t# built for inclusion in a dll (and should export symbols for example).\n\tm4_if([$1], [GCJ], [],\n\t  [_LT_TAGVAR(lt_prog_compiler_pic, $1)='-DDLL_EXPORT'])\n\t;;\n      dgux*)\n\tcase $cc_basename in\n\t  ec++*)\n\t    _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC'\n\t    ;;\n\t  ghcx*)\n\t    # Green Hills C++ Compiler\n\t    _LT_TAGVAR(lt_prog_compiler_pic, $1)='-pic'\n\t    ;;\n\t  *)\n\t    ;;\n\tesac\n\t;;\n      freebsd* | dragonfly*)\n\t# FreeBSD uses GNU C++\n\t;;\n      hpux9* | hpux10* | hpux11*)\n\tcase $cc_basename in\n\t  CC*)\n\t    _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'\n\t    _LT_TAGVAR(lt_prog_compiler_static, $1)='${wl}-a ${wl}archive'\n\t    if test \"$host_cpu\" != ia64; then\n\t      _LT_TAGVAR(lt_prog_compiler_pic, $1)='+Z'\n\t    fi\n\t    ;;\n\t  aCC*)\n\t    _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'\n\t    _LT_TAGVAR(lt_prog_compiler_static, $1)='${wl}-a ${wl}archive'\n\t    case $host_cpu in\n\t    hppa*64*|ia64*)\n\t      # +Z the default\n\t      ;;\n\t    *)\n\t      _LT_TAGVAR(lt_prog_compiler_pic, $1)='+Z'\n\t      ;;\n\t    esac\n\t    ;;\n\t  *)\n\t    ;;\n\tesac\n\t;;\n      interix*)\n\t# This is c89, which is MS Visual C++ (no shared libs)\n\t# Anyone wants to do a port?\n\t;;\n      irix5* | irix6* | nonstopux*)\n\tcase $cc_basename in\n\t  CC*)\n\t    _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'\n\t    _LT_TAGVAR(lt_prog_compiler_static, $1)='-non_shared'\n\t    # CC pic flag -KPIC is the default.\n\t    ;;\n\t  *)\n\t    ;;\n\tesac\n\t;;\n      linux* | k*bsd*-gnu | kopensolaris*-gnu | gnu*)\n\tcase $cc_basename in\n\t  KCC*)\n\t    # KAI C++ Compiler\n\t    _LT_TAGVAR(lt_prog_compiler_wl, $1)='--backend -Wl,'\n\t    _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC'\n\t    ;;\n\t  ecpc* )\n\t    # old Intel C++ for x86_64 which still supported -KPIC.\n\t    _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'\n\t    _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC'\n\t    _LT_TAGVAR(lt_prog_compiler_static, $1)='-static'\n\t    ;;\n\t  icpc* )\n\t    # Intel C++, used to be incompatible with GCC.\n\t    # ICC 10 doesn't accept -KPIC any more.\n\t    _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'\n\t    _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC'\n\t    _LT_TAGVAR(lt_prog_compiler_static, $1)='-static'\n\t    ;;\n\t  pgCC* | pgcpp*)\n\t    # Portland Group C++ compiler\n\t    _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'\n\t    _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fpic'\n\t    _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic'\n\t    ;;\n\t  cxx*)\n\t    # Compaq C++\n\t    # Make sure the PIC flag is empty.  It appears that all Alpha\n\t    # Linux and Compaq Tru64 Unix objects are PIC.\n\t    _LT_TAGVAR(lt_prog_compiler_pic, $1)=\n\t    _LT_TAGVAR(lt_prog_compiler_static, $1)='-non_shared'\n\t    ;;\n\t  xlc* | xlC* | bgxl[[cC]]* | mpixl[[cC]]*)\n\t    # IBM XL 8.0, 9.0 on PPC and BlueGene\n\t    _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'\n\t    _LT_TAGVAR(lt_prog_compiler_pic, $1)='-qpic'\n\t    _LT_TAGVAR(lt_prog_compiler_static, $1)='-qstaticlink'\n\t    ;;\n\t  *)\n\t    case `$CC -V 2>&1 | sed 5q` in\n\t    *Sun\\ C*)\n\t      # Sun C++ 5.9\n\t      _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC'\n\t      _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic'\n\t      _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Qoption ld '\n\t      ;;\n\t    esac\n\t    ;;\n\tesac\n\t;;\n      lynxos*)\n\t;;\n      m88k*)\n\t;;\n      mvs*)\n\tcase $cc_basename in\n\t  cxx*)\n\t    _LT_TAGVAR(lt_prog_compiler_pic, $1)='-W c,exportall'\n\t    ;;\n\t  *)\n\t    ;;\n\tesac\n\t;;\n      netbsd* | netbsdelf*-gnu)\n\t;;\n      *qnx* | *nto*)\n        # QNX uses GNU C++, but need to define -shared option too, otherwise\n        # it will coredump.\n        _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC -shared'\n        ;;\n      osf3* | osf4* | osf5*)\n\tcase $cc_basename in\n\t  KCC*)\n\t    _LT_TAGVAR(lt_prog_compiler_wl, $1)='--backend -Wl,'\n\t    ;;\n\t  RCC*)\n\t    # Rational C++ 2.4.1\n\t    _LT_TAGVAR(lt_prog_compiler_pic, $1)='-pic'\n\t    ;;\n\t  cxx*)\n\t    # Digital/Compaq C++\n\t    _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'\n\t    # Make sure the PIC flag is empty.  It appears that all Alpha\n\t    # Linux and Compaq Tru64 Unix objects are PIC.\n\t    _LT_TAGVAR(lt_prog_compiler_pic, $1)=\n\t    _LT_TAGVAR(lt_prog_compiler_static, $1)='-non_shared'\n\t    ;;\n\t  *)\n\t    ;;\n\tesac\n\t;;\n      psos*)\n\t;;\n      solaris*)\n\tcase $cc_basename in\n\t  CC* | sunCC*)\n\t    # Sun C++ 4.2, 5.x and Centerline C++\n\t    _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC'\n\t    _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic'\n\t    _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Qoption ld '\n\t    ;;\n\t  gcx*)\n\t    # Green Hills C++ Compiler\n\t    _LT_TAGVAR(lt_prog_compiler_pic, $1)='-PIC'\n\t    ;;\n\t  *)\n\t    ;;\n\tesac\n\t;;\n      sunos4*)\n\tcase $cc_basename in\n\t  CC*)\n\t    # Sun C++ 4.x\n\t    _LT_TAGVAR(lt_prog_compiler_pic, $1)='-pic'\n\t    _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic'\n\t    ;;\n\t  lcc*)\n\t    # Lucid\n\t    _LT_TAGVAR(lt_prog_compiler_pic, $1)='-pic'\n\t    ;;\n\t  *)\n\t    ;;\n\tesac\n\t;;\n      sysv5* | unixware* | sco3.2v5* | sco5v6* | OpenUNIX*)\n\tcase $cc_basename in\n\t  CC*)\n\t    _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'\n\t    _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC'\n\t    _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic'\n\t    ;;\n\tesac\n\t;;\n      tandem*)\n\tcase $cc_basename in\n\t  NCC*)\n\t    # NonStop-UX NCC 3.20\n\t    _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC'\n\t    ;;\n\t  *)\n\t    ;;\n\tesac\n\t;;\n      vxworks*)\n\t;;\n      *)\n\t_LT_TAGVAR(lt_prog_compiler_can_build_shared, $1)=no\n\t;;\n    esac\n  fi\n],\n[\n  if test \"$GCC\" = yes; then\n    _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'\n    _LT_TAGVAR(lt_prog_compiler_static, $1)='-static'\n\n    case $host_os in\n      aix*)\n      # All AIX code is PIC.\n      if test \"$host_cpu\" = ia64; then\n\t# AIX 5 now supports IA64 processor\n\t_LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic'\n      fi\n      ;;\n\n    amigaos*)\n      case $host_cpu in\n      powerpc)\n            # see comment about AmigaOS4 .so support\n            _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC'\n        ;;\n      m68k)\n            # FIXME: we need at least 68020 code to build shared libraries, but\n            # adding the `-m68020' flag to GCC prevents building anything better,\n            # like `-m68040'.\n            _LT_TAGVAR(lt_prog_compiler_pic, $1)='-m68020 -resident32 -malways-restore-a4'\n        ;;\n      esac\n      ;;\n\n    beos* | irix5* | irix6* | nonstopux* | osf3* | osf4* | osf5*)\n      # PIC is the default for these OSes.\n      ;;\n\n    mingw* | cygwin* | pw32* | os2* | cegcc*)\n      # This hack is so that the source file can tell whether it is being\n      # built for inclusion in a dll (and should export symbols for example).\n      # Although the cygwin gcc ignores -fPIC, still need this for old-style\n      # (--disable-auto-import) libraries\n      m4_if([$1], [GCJ], [],\n\t[_LT_TAGVAR(lt_prog_compiler_pic, $1)='-DDLL_EXPORT'])\n      ;;\n\n    darwin* | rhapsody*)\n      # PIC is the default on this platform\n      # Common symbols not allowed in MH_DYLIB files\n      _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fno-common'\n      ;;\n\n    haiku*)\n      # PIC is the default for Haiku.\n      # The \"-static\" flag exists, but is broken.\n      _LT_TAGVAR(lt_prog_compiler_static, $1)=\n      ;;\n\n    hpux*)\n      # PIC is the default for 64-bit PA HP-UX, but not for 32-bit\n      # PA HP-UX.  On IA64 HP-UX, PIC is the default but the pic flag\n      # sets the default TLS model and affects inlining.\n      case $host_cpu in\n      hppa*64*)\n\t# +Z the default\n\t;;\n      *)\n\t_LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC'\n\t;;\n      esac\n      ;;\n\n    interix[[3-9]]*)\n      # Interix 3.x gcc -fpic/-fPIC options generate broken code.\n      # Instead, we relocate shared libraries at runtime.\n      ;;\n\n    msdosdjgpp*)\n      # Just because we use GCC doesn't mean we suddenly get shared libraries\n      # on systems that don't support them.\n      _LT_TAGVAR(lt_prog_compiler_can_build_shared, $1)=no\n      enable_shared=no\n      ;;\n\n    *nto* | *qnx*)\n      # QNX uses GNU C++, but need to define -shared option too, otherwise\n      # it will coredump.\n      _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC -shared'\n      ;;\n\n    sysv4*MP*)\n      if test -d /usr/nec; then\n\t_LT_TAGVAR(lt_prog_compiler_pic, $1)=-Kconform_pic\n      fi\n      ;;\n\n    *)\n      _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC'\n      ;;\n    esac\n\n    case $cc_basename in\n    nvcc*) # Cuda Compiler Driver 2.2\n      _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Xlinker '\n      if test -n \"$_LT_TAGVAR(lt_prog_compiler_pic, $1)\"; then\n        _LT_TAGVAR(lt_prog_compiler_pic, $1)=\"-Xcompiler $_LT_TAGVAR(lt_prog_compiler_pic, $1)\"\n      fi\n      ;;\n    esac\n  else\n    # PORTME Check for flag to pass linker flags through the system compiler.\n    case $host_os in\n    aix*)\n      _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'\n      if test \"$host_cpu\" = ia64; then\n\t# AIX 5 now supports IA64 processor\n\t_LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic'\n      else\n\t_LT_TAGVAR(lt_prog_compiler_static, $1)='-bnso -bI:/lib/syscalls.exp'\n      fi\n      ;;\n\n    mingw* | cygwin* | pw32* | os2* | cegcc*)\n      # This hack is so that the source file can tell whether it is being\n      # built for inclusion in a dll (and should export symbols for example).\n      m4_if([$1], [GCJ], [],\n\t[_LT_TAGVAR(lt_prog_compiler_pic, $1)='-DDLL_EXPORT'])\n      ;;\n\n    hpux9* | hpux10* | hpux11*)\n      _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'\n      # PIC is the default for IA64 HP-UX and 64-bit HP-UX, but\n      # not for PA HP-UX.\n      case $host_cpu in\n      hppa*64*|ia64*)\n\t# +Z the default\n\t;;\n      *)\n\t_LT_TAGVAR(lt_prog_compiler_pic, $1)='+Z'\n\t;;\n      esac\n      # Is there a better lt_prog_compiler_static that works with the bundled CC?\n      _LT_TAGVAR(lt_prog_compiler_static, $1)='${wl}-a ${wl}archive'\n      ;;\n\n    irix5* | irix6* | nonstopux*)\n      _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'\n      # PIC (with -KPIC) is the default.\n      _LT_TAGVAR(lt_prog_compiler_static, $1)='-non_shared'\n      ;;\n\n    linux* | k*bsd*-gnu | kopensolaris*-gnu | gnu*)\n      case $cc_basename in\n      # old Intel for x86_64 which still supported -KPIC.\n      ecc*)\n\t_LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'\n\t_LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC'\n\t_LT_TAGVAR(lt_prog_compiler_static, $1)='-static'\n        ;;\n      # icc used to be incompatible with GCC.\n      # ICC 10 doesn't accept -KPIC any more.\n      icc* | ifort*)\n\t_LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'\n\t_LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC'\n\t_LT_TAGVAR(lt_prog_compiler_static, $1)='-static'\n        ;;\n      # Lahey Fortran 8.1.\n      lf95*)\n\t_LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'\n\t_LT_TAGVAR(lt_prog_compiler_pic, $1)='--shared'\n\t_LT_TAGVAR(lt_prog_compiler_static, $1)='--static'\n\t;;\n      nagfor*)\n\t# NAG Fortran compiler\n\t_LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,-Wl,,'\n\t_LT_TAGVAR(lt_prog_compiler_pic, $1)='-PIC'\n\t_LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic'\n\t;;\n      pgcc* | pgf77* | pgf90* | pgf95* | pgfortran*)\n        # Portland Group compilers (*not* the Pentium gcc compiler,\n\t# which looks to be a dead project)\n\t_LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'\n\t_LT_TAGVAR(lt_prog_compiler_pic, $1)='-fpic'\n\t_LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic'\n        ;;\n      ccc*)\n        _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'\n        # All Alpha code is PIC.\n        _LT_TAGVAR(lt_prog_compiler_static, $1)='-non_shared'\n        ;;\n      xl* | bgxl* | bgf* | mpixl*)\n\t# IBM XL C 8.0/Fortran 10.1, 11.1 on PPC and BlueGene\n\t_LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'\n\t_LT_TAGVAR(lt_prog_compiler_pic, $1)='-qpic'\n\t_LT_TAGVAR(lt_prog_compiler_static, $1)='-qstaticlink'\n\t;;\n      *)\n\tcase `$CC -V 2>&1 | sed 5q` in\n\t*Sun\\ Ceres\\ Fortran* | *Sun*Fortran*\\ [[1-7]].* | *Sun*Fortran*\\ 8.[[0-3]]*)\n\t  # Sun Fortran 8.3 passes all unrecognized flags to the linker\n\t  _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC'\n\t  _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic'\n\t  _LT_TAGVAR(lt_prog_compiler_wl, $1)=''\n\t  ;;\n\t*Sun\\ F* | *Sun*Fortran*)\n\t  _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC'\n\t  _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic'\n\t  _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Qoption ld '\n\t  ;;\n\t*Sun\\ C*)\n\t  # Sun C 5.9\n\t  _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC'\n\t  _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic'\n\t  _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'\n\t  ;;\n        *Intel*\\ [[CF]]*Compiler*)\n\t  _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'\n\t  _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC'\n\t  _LT_TAGVAR(lt_prog_compiler_static, $1)='-static'\n\t  ;;\n\t*Portland\\ Group*)\n\t  _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'\n\t  _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fpic'\n\t  _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic'\n\t  ;;\n\tesac\n\t;;\n      esac\n      ;;\n\n    newsos6)\n      _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC'\n      _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic'\n      ;;\n\n    *nto* | *qnx*)\n      # QNX uses GNU C++, but need to define -shared option too, otherwise\n      # it will coredump.\n      _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC -shared'\n      ;;\n\n    osf3* | osf4* | osf5*)\n      _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'\n      # All OSF/1 code is PIC.\n      _LT_TAGVAR(lt_prog_compiler_static, $1)='-non_shared'\n      ;;\n\n    rdos*)\n      _LT_TAGVAR(lt_prog_compiler_static, $1)='-non_shared'\n      ;;\n\n    solaris*)\n      _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC'\n      _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic'\n      case $cc_basename in\n      f77* | f90* | f95* | sunf77* | sunf90* | sunf95*)\n\t_LT_TAGVAR(lt_prog_compiler_wl, $1)='-Qoption ld ';;\n      *)\n\t_LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,';;\n      esac\n      ;;\n\n    sunos4*)\n      _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Qoption ld '\n      _LT_TAGVAR(lt_prog_compiler_pic, $1)='-PIC'\n      _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic'\n      ;;\n\n    sysv4 | sysv4.2uw2* | sysv4.3*)\n      _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'\n      _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC'\n      _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic'\n      ;;\n\n    sysv4*MP*)\n      if test -d /usr/nec ;then\n\t_LT_TAGVAR(lt_prog_compiler_pic, $1)='-Kconform_pic'\n\t_LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic'\n      fi\n      ;;\n\n    sysv5* | unixware* | sco3.2v5* | sco5v6* | OpenUNIX*)\n      _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'\n      _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC'\n      _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic'\n      ;;\n\n    unicos*)\n      _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'\n      _LT_TAGVAR(lt_prog_compiler_can_build_shared, $1)=no\n      ;;\n\n    uts4*)\n      _LT_TAGVAR(lt_prog_compiler_pic, $1)='-pic'\n      _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic'\n      ;;\n\n    *)\n      _LT_TAGVAR(lt_prog_compiler_can_build_shared, $1)=no\n      ;;\n    esac\n  fi\n])\ncase $host_os in\n  # For platforms which do not support PIC, -DPIC is meaningless:\n  *djgpp*)\n    _LT_TAGVAR(lt_prog_compiler_pic, $1)=\n    ;;\n  *)\n    _LT_TAGVAR(lt_prog_compiler_pic, $1)=\"$_LT_TAGVAR(lt_prog_compiler_pic, $1)@&t@m4_if([$1],[],[ -DPIC],[m4_if([$1],[CXX],[ -DPIC],[])])\"\n    ;;\nesac\n\nAC_CACHE_CHECK([for $compiler option to produce PIC],\n  [_LT_TAGVAR(lt_cv_prog_compiler_pic, $1)],\n  [_LT_TAGVAR(lt_cv_prog_compiler_pic, $1)=$_LT_TAGVAR(lt_prog_compiler_pic, $1)])\n_LT_TAGVAR(lt_prog_compiler_pic, $1)=$_LT_TAGVAR(lt_cv_prog_compiler_pic, $1)\n\n#\n# Check to make sure the PIC flag actually works.\n#\nif test -n \"$_LT_TAGVAR(lt_prog_compiler_pic, $1)\"; then\n  _LT_COMPILER_OPTION([if $compiler PIC flag $_LT_TAGVAR(lt_prog_compiler_pic, $1) works],\n    [_LT_TAGVAR(lt_cv_prog_compiler_pic_works, $1)],\n    [$_LT_TAGVAR(lt_prog_compiler_pic, $1)@&t@m4_if([$1],[],[ -DPIC],[m4_if([$1],[CXX],[ -DPIC],[])])], [],\n    [case $_LT_TAGVAR(lt_prog_compiler_pic, $1) in\n     \"\" | \" \"*) ;;\n     *) _LT_TAGVAR(lt_prog_compiler_pic, $1)=\" $_LT_TAGVAR(lt_prog_compiler_pic, $1)\" ;;\n     esac],\n    [_LT_TAGVAR(lt_prog_compiler_pic, $1)=\n     _LT_TAGVAR(lt_prog_compiler_can_build_shared, $1)=no])\nfi\n_LT_TAGDECL([pic_flag], [lt_prog_compiler_pic], [1],\n\t[Additional compiler flags for building library objects])\n\n_LT_TAGDECL([wl], [lt_prog_compiler_wl], [1],\n\t[How to pass a linker flag through the compiler])\n#\n# Check to make sure the static flag actually works.\n#\nwl=$_LT_TAGVAR(lt_prog_compiler_wl, $1) eval lt_tmp_static_flag=\\\"$_LT_TAGVAR(lt_prog_compiler_static, $1)\\\"\n_LT_LINKER_OPTION([if $compiler static flag $lt_tmp_static_flag works],\n  _LT_TAGVAR(lt_cv_prog_compiler_static_works, $1),\n  $lt_tmp_static_flag,\n  [],\n  [_LT_TAGVAR(lt_prog_compiler_static, $1)=])\n_LT_TAGDECL([link_static_flag], [lt_prog_compiler_static], [1],\n\t[Compiler flag to prevent dynamic linking])\n])# _LT_COMPILER_PIC\n\n\n# _LT_LINKER_SHLIBS([TAGNAME])\n# ----------------------------\n# See if the linker supports building shared libraries.\nm4_defun([_LT_LINKER_SHLIBS],\n[AC_REQUIRE([LT_PATH_LD])dnl\nAC_REQUIRE([LT_PATH_NM])dnl\nm4_require([_LT_PATH_MANIFEST_TOOL])dnl\nm4_require([_LT_FILEUTILS_DEFAULTS])dnl\nm4_require([_LT_DECL_EGREP])dnl\nm4_require([_LT_DECL_SED])dnl\nm4_require([_LT_CMD_GLOBAL_SYMBOLS])dnl\nm4_require([_LT_TAG_COMPILER])dnl\nAC_MSG_CHECKING([whether the $compiler linker ($LD) supports shared libraries])\nm4_if([$1], [CXX], [\n  _LT_TAGVAR(export_symbols_cmds, $1)='$NM $libobjs $convenience | $global_symbol_pipe | $SED '\\''s/.* //'\\'' | sort | uniq > $export_symbols'\n  _LT_TAGVAR(exclude_expsyms, $1)=['_GLOBAL_OFFSET_TABLE_|_GLOBAL__F[ID]_.*']\n  case $host_os in\n  aix[[4-9]]*)\n    # If we're using GNU nm, then we don't want the \"-C\" option.\n    # -C means demangle to AIX nm, but means don't demangle with GNU nm\n    # Also, AIX nm treats weak defined symbols like other global defined\n    # symbols, whereas GNU nm marks them as \"W\".\n    if $NM -V 2>&1 | $GREP 'GNU' > /dev/null; then\n      _LT_TAGVAR(export_symbols_cmds, $1)='$NM -Bpg $libobjs $convenience | awk '\\''{ if (((\\$ 2 == \"T\") || (\\$ 2 == \"D\") || (\\$ 2 == \"B\") || (\\$ 2 == \"W\")) && ([substr](\\$ 3,1,1) != \".\")) { print \\$ 3 } }'\\'' | sort -u > $export_symbols'\n    else\n      _LT_TAGVAR(export_symbols_cmds, $1)='$NM -BCpg $libobjs $convenience | awk '\\''{ if (((\\$ 2 == \"T\") || (\\$ 2 == \"D\") || (\\$ 2 == \"B\")) && ([substr](\\$ 3,1,1) != \".\")) { print \\$ 3 } }'\\'' | sort -u > $export_symbols'\n    fi\n    ;;\n  pw32*)\n    _LT_TAGVAR(export_symbols_cmds, $1)=\"$ltdll_cmds\"\n    ;;\n  cygwin* | mingw* | cegcc*)\n    case $cc_basename in\n    cl*)\n      _LT_TAGVAR(exclude_expsyms, $1)='_NULL_IMPORT_DESCRIPTOR|_IMPORT_DESCRIPTOR_.*'\n      ;;\n    *)\n      _LT_TAGVAR(export_symbols_cmds, $1)='$NM $libobjs $convenience | $global_symbol_pipe | $SED -e '\\''/^[[BCDGRS]][[ ]]/s/.*[[ ]]\\([[^ ]]*\\)/\\1 DATA/;s/^.*[[ ]]__nm__\\([[^ ]]*\\)[[ ]][[^ ]]*/\\1 DATA/;/^I[[ ]]/d;/^[[AITW]][[ ]]/s/.* //'\\'' | sort | uniq > $export_symbols'\n      _LT_TAGVAR(exclude_expsyms, $1)=['[_]+GLOBAL_OFFSET_TABLE_|[_]+GLOBAL__[FID]_.*|[_]+head_[A-Za-z0-9_]+_dll|[A-Za-z0-9_]+_dll_iname']\n      ;;\n    esac\n    ;;\n  linux* | k*bsd*-gnu | gnu*)\n    _LT_TAGVAR(link_all_deplibs, $1)=no\n    ;;\n  *)\n    _LT_TAGVAR(export_symbols_cmds, $1)='$NM $libobjs $convenience | $global_symbol_pipe | $SED '\\''s/.* //'\\'' | sort | uniq > $export_symbols'\n    ;;\n  esac\n], [\n  runpath_var=\n  _LT_TAGVAR(allow_undefined_flag, $1)=\n  _LT_TAGVAR(always_export_symbols, $1)=no\n  _LT_TAGVAR(archive_cmds, $1)=\n  _LT_TAGVAR(archive_expsym_cmds, $1)=\n  _LT_TAGVAR(compiler_needs_object, $1)=no\n  _LT_TAGVAR(enable_shared_with_static_runtimes, $1)=no\n  _LT_TAGVAR(export_dynamic_flag_spec, $1)=\n  _LT_TAGVAR(export_symbols_cmds, $1)='$NM $libobjs $convenience | $global_symbol_pipe | $SED '\\''s/.* //'\\'' | sort | uniq > $export_symbols'\n  _LT_TAGVAR(hardcode_automatic, $1)=no\n  _LT_TAGVAR(hardcode_direct, $1)=no\n  _LT_TAGVAR(hardcode_direct_absolute, $1)=no\n  _LT_TAGVAR(hardcode_libdir_flag_spec, $1)=\n  _LT_TAGVAR(hardcode_libdir_separator, $1)=\n  _LT_TAGVAR(hardcode_minus_L, $1)=no\n  _LT_TAGVAR(hardcode_shlibpath_var, $1)=unsupported\n  _LT_TAGVAR(inherit_rpath, $1)=no\n  _LT_TAGVAR(link_all_deplibs, $1)=unknown\n  _LT_TAGVAR(module_cmds, $1)=\n  _LT_TAGVAR(module_expsym_cmds, $1)=\n  _LT_TAGVAR(old_archive_from_new_cmds, $1)=\n  _LT_TAGVAR(old_archive_from_expsyms_cmds, $1)=\n  _LT_TAGVAR(thread_safe_flag_spec, $1)=\n  _LT_TAGVAR(whole_archive_flag_spec, $1)=\n  # include_expsyms should be a list of space-separated symbols to be *always*\n  # included in the symbol list\n  _LT_TAGVAR(include_expsyms, $1)=\n  # exclude_expsyms can be an extended regexp of symbols to exclude\n  # it will be wrapped by ` (' and `)$', so one must not match beginning or\n  # end of line.  Example: `a|bc|.*d.*' will exclude the symbols `a' and `bc',\n  # as well as any symbol that contains `d'.\n  _LT_TAGVAR(exclude_expsyms, $1)=['_GLOBAL_OFFSET_TABLE_|_GLOBAL__F[ID]_.*']\n  # Although _GLOBAL_OFFSET_TABLE_ is a valid symbol C name, most a.out\n  # platforms (ab)use it in PIC code, but their linkers get confused if\n  # the symbol is explicitly referenced.  Since portable code cannot\n  # rely on this symbol name, it's probably fine to never include it in\n  # preloaded symbol tables.\n  # Exclude shared library initialization/finalization symbols.\ndnl Note also adjust exclude_expsyms for C++ above.\n  extract_expsyms_cmds=\n\n  case $host_os in\n  cygwin* | mingw* | pw32* | cegcc*)\n    # FIXME: the MSVC++ port hasn't been tested in a loooong time\n    # When not using gcc, we currently assume that we are using\n    # Microsoft Visual C++.\n    if test \"$GCC\" != yes; then\n      with_gnu_ld=no\n    fi\n    ;;\n  interix*)\n    # we just hope/assume this is gcc and not c89 (= MSVC++)\n    with_gnu_ld=yes\n    ;;\n  openbsd*)\n    with_gnu_ld=no\n    ;;\n  linux* | k*bsd*-gnu | gnu*)\n    _LT_TAGVAR(link_all_deplibs, $1)=no\n    ;;\n  esac\n\n  _LT_TAGVAR(ld_shlibs, $1)=yes\n\n  # On some targets, GNU ld is compatible enough with the native linker\n  # that we're better off using the native interface for both.\n  lt_use_gnu_ld_interface=no\n  if test \"$with_gnu_ld\" = yes; then\n    case $host_os in\n      aix*)\n\t# The AIX port of GNU ld has always aspired to compatibility\n\t# with the native linker.  However, as the warning in the GNU ld\n\t# block says, versions before 2.19.5* couldn't really create working\n\t# shared libraries, regardless of the interface used.\n\tcase `$LD -v 2>&1` in\n\t  *\\ \\(GNU\\ Binutils\\)\\ 2.19.5*) ;;\n\t  *\\ \\(GNU\\ Binutils\\)\\ 2.[[2-9]]*) ;;\n\t  *\\ \\(GNU\\ Binutils\\)\\ [[3-9]]*) ;;\n\t  *)\n\t    lt_use_gnu_ld_interface=yes\n\t    ;;\n\tesac\n\t;;\n      *)\n\tlt_use_gnu_ld_interface=yes\n\t;;\n    esac\n  fi\n\n  if test \"$lt_use_gnu_ld_interface\" = yes; then\n    # If archive_cmds runs LD, not CC, wlarc should be empty\n    wlarc='${wl}'\n\n    # Set some defaults for GNU ld with shared library support. These\n    # are reset later if shared libraries are not supported. Putting them\n    # here allows them to be overridden if necessary.\n    runpath_var=LD_RUN_PATH\n    _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath ${wl}$libdir'\n    _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}--export-dynamic'\n    # ancient GNU ld didn't support --whole-archive et. al.\n    if $LD --help 2>&1 | $GREP 'no-whole-archive' > /dev/null; then\n      _LT_TAGVAR(whole_archive_flag_spec, $1)=\"$wlarc\"'--whole-archive$convenience '\"$wlarc\"'--no-whole-archive'\n    else\n      _LT_TAGVAR(whole_archive_flag_spec, $1)=\n    fi\n    supports_anon_versioning=no\n    case `$LD -v 2>&1` in\n      *GNU\\ gold*) supports_anon_versioning=yes ;;\n      *\\ [[01]].* | *\\ 2.[[0-9]].* | *\\ 2.10.*) ;; # catch versions < 2.11\n      *\\ 2.11.93.0.2\\ *) supports_anon_versioning=yes ;; # RH7.3 ...\n      *\\ 2.11.92.0.12\\ *) supports_anon_versioning=yes ;; # Mandrake 8.2 ...\n      *\\ 2.11.*) ;; # other 2.11 versions\n      *) supports_anon_versioning=yes ;;\n    esac\n\n    # See if GNU ld supports shared libraries.\n    case $host_os in\n    aix[[3-9]]*)\n      # On AIX/PPC, the GNU linker is very broken\n      if test \"$host_cpu\" != ia64; then\n\t_LT_TAGVAR(ld_shlibs, $1)=no\n\tcat <<_LT_EOF 1>&2\n\n*** Warning: the GNU linker, at least up to release 2.19, is reported\n*** to be unable to reliably create shared libraries on AIX.\n*** Therefore, libtool is disabling shared libraries support.  If you\n*** really care for shared libraries, you may want to install binutils\n*** 2.20 or above, or modify your PATH so that a non-GNU linker is found.\n*** You will then need to restart the configuration process.\n\n_LT_EOF\n      fi\n      ;;\n\n    amigaos*)\n      case $host_cpu in\n      powerpc)\n            # see comment about AmigaOS4 .so support\n            _LT_TAGVAR(archive_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib'\n            _LT_TAGVAR(archive_expsym_cmds, $1)=''\n        ;;\n      m68k)\n            _LT_TAGVAR(archive_cmds, $1)='$RM $output_objdir/a2ixlibrary.data~$ECHO \"#define NAME $libname\" > $output_objdir/a2ixlibrary.data~$ECHO \"#define LIBRARY_ID 1\" >> $output_objdir/a2ixlibrary.data~$ECHO \"#define VERSION $major\" >> $output_objdir/a2ixlibrary.data~$ECHO \"#define REVISION $revision\" >> $output_objdir/a2ixlibrary.data~$AR $AR_FLAGS $lib $libobjs~$RANLIB $lib~(cd $output_objdir && a2ixlibrary -32)'\n            _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir'\n            _LT_TAGVAR(hardcode_minus_L, $1)=yes\n        ;;\n      esac\n      ;;\n\n    beos*)\n      if $LD --help 2>&1 | $GREP ': supported targets:.* elf' > /dev/null; then\n\t_LT_TAGVAR(allow_undefined_flag, $1)=unsupported\n\t# Joseph Beckenbach <jrb3@best.com> says some releases of gcc\n\t# support --undefined.  This deserves some investigation.  FIXME\n\t_LT_TAGVAR(archive_cmds, $1)='$CC -nostart $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib'\n      else\n\t_LT_TAGVAR(ld_shlibs, $1)=no\n      fi\n      ;;\n\n    cygwin* | mingw* | pw32* | cegcc*)\n      # _LT_TAGVAR(hardcode_libdir_flag_spec, $1) is actually meaningless,\n      # as there is no search path for DLLs.\n      _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir'\n      _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}--export-all-symbols'\n      _LT_TAGVAR(allow_undefined_flag, $1)=unsupported\n      _LT_TAGVAR(always_export_symbols, $1)=no\n      _LT_TAGVAR(enable_shared_with_static_runtimes, $1)=yes\n      _LT_TAGVAR(export_symbols_cmds, $1)='$NM $libobjs $convenience | $global_symbol_pipe | $SED -e '\\''/^[[BCDGRS]][[ ]]/s/.*[[ ]]\\([[^ ]]*\\)/\\1 DATA/;s/^.*[[ ]]__nm__\\([[^ ]]*\\)[[ ]][[^ ]]*/\\1 DATA/;/^I[[ ]]/d;/^[[AITW]][[ ]]/s/.* //'\\'' | sort | uniq > $export_symbols'\n      _LT_TAGVAR(exclude_expsyms, $1)=['[_]+GLOBAL_OFFSET_TABLE_|[_]+GLOBAL__[FID]_.*|[_]+head_[A-Za-z0-9_]+_dll|[A-Za-z0-9_]+_dll_iname']\n\n      if $LD --help 2>&1 | $GREP 'auto-import' > /dev/null; then\n        _LT_TAGVAR(archive_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags -o $output_objdir/$soname ${wl}--enable-auto-image-base -Xlinker --out-implib -Xlinker $lib'\n\t# If the export-symbols file already is a .def file (1st line\n\t# is EXPORTS), use it as is; otherwise, prepend...\n\t_LT_TAGVAR(archive_expsym_cmds, $1)='if test \"x`$SED 1q $export_symbols`\" = xEXPORTS; then\n\t  cp $export_symbols $output_objdir/$soname.def;\n\telse\n\t  echo EXPORTS > $output_objdir/$soname.def;\n\t  cat $export_symbols >> $output_objdir/$soname.def;\n\tfi~\n\t$CC -shared $output_objdir/$soname.def $libobjs $deplibs $compiler_flags -o $output_objdir/$soname ${wl}--enable-auto-image-base -Xlinker --out-implib -Xlinker $lib'\n      else\n\t_LT_TAGVAR(ld_shlibs, $1)=no\n      fi\n      ;;\n\n    haiku*)\n      _LT_TAGVAR(archive_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib'\n      _LT_TAGVAR(link_all_deplibs, $1)=yes\n      ;;\n\n    interix[[3-9]]*)\n      _LT_TAGVAR(hardcode_direct, $1)=no\n      _LT_TAGVAR(hardcode_shlibpath_var, $1)=no\n      _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath,$libdir'\n      _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}-E'\n      # Hack: On Interix 3.x, we cannot compile PIC because of a broken gcc.\n      # Instead, shared libraries are loaded at an image base (0x10000000 by\n      # default) and relocated if they conflict, which is a slow very memory\n      # consuming and fragmenting process.  To avoid this, we pick a random,\n      # 256 KiB-aligned image base between 0x50000000 and 0x6FFC0000 at link\n      # time.  Moving up from 0x10000000 also allows more sbrk(2) space.\n      _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-h,$soname ${wl}--image-base,`expr ${RANDOM-$$} % 4096 / 2 \\* 262144 + 1342177280` -o $lib'\n      _LT_TAGVAR(archive_expsym_cmds, $1)='sed \"s,^,_,\" $export_symbols >$output_objdir/$soname.expsym~$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-h,$soname ${wl}--retain-symbols-file,$output_objdir/$soname.expsym ${wl}--image-base,`expr ${RANDOM-$$} % 4096 / 2 \\* 262144 + 1342177280` -o $lib'\n      ;;\n\n    gnu* | linux* | tpf* | k*bsd*-gnu | kopensolaris*-gnu)\n      tmp_diet=no\n      if test \"$host_os\" = linux-dietlibc; then\n\tcase $cc_basename in\n\t  diet\\ *) tmp_diet=yes;;\t# linux-dietlibc with static linking (!diet-dyn)\n\tesac\n      fi\n      if $LD --help 2>&1 | $EGREP ': supported targets:.* elf' > /dev/null \\\n\t && test \"$tmp_diet\" = no\n      then\n\ttmp_addflag=' $pic_flag'\n\ttmp_sharedflag='-shared'\n\tcase $cc_basename,$host_cpu in\n        pgcc*)\t\t\t\t# Portland Group C compiler\n\t  _LT_TAGVAR(whole_archive_flag_spec, $1)='${wl}--whole-archive`for conv in $convenience\\\"\\\"; do test  -n \\\"$conv\\\" && new_convenience=\\\"$new_convenience,$conv\\\"; done; func_echo_all \\\"$new_convenience\\\"` ${wl}--no-whole-archive'\n\t  tmp_addflag=' $pic_flag'\n\t  ;;\n\tpgf77* | pgf90* | pgf95* | pgfortran*)\n\t\t\t\t\t# Portland Group f77 and f90 compilers\n\t  _LT_TAGVAR(whole_archive_flag_spec, $1)='${wl}--whole-archive`for conv in $convenience\\\"\\\"; do test  -n \\\"$conv\\\" && new_convenience=\\\"$new_convenience,$conv\\\"; done; func_echo_all \\\"$new_convenience\\\"` ${wl}--no-whole-archive'\n\t  tmp_addflag=' $pic_flag -Mnomain' ;;\n\tecc*,ia64* | icc*,ia64*)\t# Intel C compiler on ia64\n\t  tmp_addflag=' -i_dynamic' ;;\n\tefc*,ia64* | ifort*,ia64*)\t# Intel Fortran compiler on ia64\n\t  tmp_addflag=' -i_dynamic -nofor_main' ;;\n\tifc* | ifort*)\t\t\t# Intel Fortran compiler\n\t  tmp_addflag=' -nofor_main' ;;\n\tlf95*)\t\t\t\t# Lahey Fortran 8.1\n\t  _LT_TAGVAR(whole_archive_flag_spec, $1)=\n\t  tmp_sharedflag='--shared' ;;\n\txl[[cC]]* | bgxl[[cC]]* | mpixl[[cC]]*) # IBM XL C 8.0 on PPC (deal with xlf below)\n\t  tmp_sharedflag='-qmkshrobj'\n\t  tmp_addflag= ;;\n\tnvcc*)\t# Cuda Compiler Driver 2.2\n\t  _LT_TAGVAR(whole_archive_flag_spec, $1)='${wl}--whole-archive`for conv in $convenience\\\"\\\"; do test  -n \\\"$conv\\\" && new_convenience=\\\"$new_convenience,$conv\\\"; done; func_echo_all \\\"$new_convenience\\\"` ${wl}--no-whole-archive'\n\t  _LT_TAGVAR(compiler_needs_object, $1)=yes\n\t  ;;\n\tesac\n\tcase `$CC -V 2>&1 | sed 5q` in\n\t*Sun\\ C*)\t\t\t# Sun C 5.9\n\t  _LT_TAGVAR(whole_archive_flag_spec, $1)='${wl}--whole-archive`new_convenience=; for conv in $convenience\\\"\\\"; do test -z \\\"$conv\\\" || new_convenience=\\\"$new_convenience,$conv\\\"; done; func_echo_all \\\"$new_convenience\\\"` ${wl}--no-whole-archive'\n\t  _LT_TAGVAR(compiler_needs_object, $1)=yes\n\t  tmp_sharedflag='-G' ;;\n\t*Sun\\ F*)\t\t\t# Sun Fortran 8.3\n\t  tmp_sharedflag='-G' ;;\n\tesac\n\t_LT_TAGVAR(archive_cmds, $1)='$CC '\"$tmp_sharedflag\"\"$tmp_addflag\"' $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib'\n\n        if test \"x$supports_anon_versioning\" = xyes; then\n          _LT_TAGVAR(archive_expsym_cmds, $1)='echo \"{ global:\" > $output_objdir/$libname.ver~\n\t    cat $export_symbols | sed -e \"s/\\(.*\\)/\\1;/\" >> $output_objdir/$libname.ver~\n\t    echo \"local: *; };\" >> $output_objdir/$libname.ver~\n\t    $CC '\"$tmp_sharedflag\"\"$tmp_addflag\"' $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-version-script ${wl}$output_objdir/$libname.ver -o $lib'\n        fi\n\n\tcase $cc_basename in\n\txlf* | bgf* | bgxlf* | mpixlf*)\n\t  # IBM XL Fortran 10.1 on PPC cannot create shared libs itself\n\t  _LT_TAGVAR(whole_archive_flag_spec, $1)='--whole-archive$convenience --no-whole-archive'\n\t  _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath ${wl}$libdir'\n\t  _LT_TAGVAR(archive_cmds, $1)='$LD -shared $libobjs $deplibs $linker_flags -soname $soname -o $lib'\n\t  if test \"x$supports_anon_versioning\" = xyes; then\n\t    _LT_TAGVAR(archive_expsym_cmds, $1)='echo \"{ global:\" > $output_objdir/$libname.ver~\n\t      cat $export_symbols | sed -e \"s/\\(.*\\)/\\1;/\" >> $output_objdir/$libname.ver~\n\t      echo \"local: *; };\" >> $output_objdir/$libname.ver~\n\t      $LD -shared $libobjs $deplibs $linker_flags -soname $soname -version-script $output_objdir/$libname.ver -o $lib'\n\t  fi\n\t  ;;\n\tesac\n      else\n        _LT_TAGVAR(ld_shlibs, $1)=no\n      fi\n      ;;\n\n    netbsd* | netbsdelf*-gnu)\n      if echo __ELF__ | $CC -E - | $GREP __ELF__ >/dev/null; then\n\t_LT_TAGVAR(archive_cmds, $1)='$LD -Bshareable $libobjs $deplibs $linker_flags -o $lib'\n\twlarc=\n      else\n\t_LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib'\n\t_LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib'\n      fi\n      ;;\n\n    solaris*)\n      if $LD -v 2>&1 | $GREP 'BFD 2\\.8' > /dev/null; then\n\t_LT_TAGVAR(ld_shlibs, $1)=no\n\tcat <<_LT_EOF 1>&2\n\n*** Warning: The releases 2.8.* of the GNU linker cannot reliably\n*** create shared libraries on Solaris systems.  Therefore, libtool\n*** is disabling shared libraries support.  We urge you to upgrade GNU\n*** binutils to release 2.9.1 or newer.  Another option is to modify\n*** your PATH or compiler configuration so that the native linker is\n*** used, and then restart.\n\n_LT_EOF\n      elif $LD --help 2>&1 | $GREP ': supported targets:.* elf' > /dev/null; then\n\t_LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib'\n\t_LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib'\n      else\n\t_LT_TAGVAR(ld_shlibs, $1)=no\n      fi\n      ;;\n\n    sysv5* | sco3.2v5* | sco5v6* | unixware* | OpenUNIX*)\n      case `$LD -v 2>&1` in\n        *\\ [[01]].* | *\\ 2.[[0-9]].* | *\\ 2.1[[0-5]].*)\n\t_LT_TAGVAR(ld_shlibs, $1)=no\n\tcat <<_LT_EOF 1>&2\n\n*** Warning: Releases of the GNU linker prior to 2.16.91.0.3 can not\n*** reliably create shared libraries on SCO systems.  Therefore, libtool\n*** is disabling shared libraries support.  We urge you to upgrade GNU\n*** binutils to release 2.16.91.0.3 or newer.  Another option is to modify\n*** your PATH or compiler configuration so that the native linker is\n*** used, and then restart.\n\n_LT_EOF\n\t;;\n\t*)\n\t  # For security reasons, it is highly recommended that you always\n\t  # use absolute paths for naming shared libraries, and exclude the\n\t  # DT_RUNPATH tag from executables and libraries.  But doing so\n\t  # requires that you compile everything twice, which is a pain.\n\t  if $LD --help 2>&1 | $GREP ': supported targets:.* elf' > /dev/null; then\n\t    _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath ${wl}$libdir'\n\t    _LT_TAGVAR(archive_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib'\n\t    _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib'\n\t  else\n\t    _LT_TAGVAR(ld_shlibs, $1)=no\n\t  fi\n\t;;\n      esac\n      ;;\n\n    sunos4*)\n      _LT_TAGVAR(archive_cmds, $1)='$LD -assert pure-text -Bshareable -o $lib $libobjs $deplibs $linker_flags'\n      wlarc=\n      _LT_TAGVAR(hardcode_direct, $1)=yes\n      _LT_TAGVAR(hardcode_shlibpath_var, $1)=no\n      ;;\n\n    *)\n      if $LD --help 2>&1 | $GREP ': supported targets:.* elf' > /dev/null; then\n\t_LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib'\n\t_LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib'\n      else\n\t_LT_TAGVAR(ld_shlibs, $1)=no\n      fi\n      ;;\n    esac\n\n    if test \"$_LT_TAGVAR(ld_shlibs, $1)\" = no; then\n      runpath_var=\n      _LT_TAGVAR(hardcode_libdir_flag_spec, $1)=\n      _LT_TAGVAR(export_dynamic_flag_spec, $1)=\n      _LT_TAGVAR(whole_archive_flag_spec, $1)=\n    fi\n  else\n    # PORTME fill in a description of your system's linker (not GNU ld)\n    case $host_os in\n    aix3*)\n      _LT_TAGVAR(allow_undefined_flag, $1)=unsupported\n      _LT_TAGVAR(always_export_symbols, $1)=yes\n      _LT_TAGVAR(archive_expsym_cmds, $1)='$LD -o $output_objdir/$soname $libobjs $deplibs $linker_flags -bE:$export_symbols -T512 -H512 -bM:SRE~$AR $AR_FLAGS $lib $output_objdir/$soname'\n      # Note: this linker hardcodes the directories in LIBPATH if there\n      # are no directories specified by -L.\n      _LT_TAGVAR(hardcode_minus_L, $1)=yes\n      if test \"$GCC\" = yes && test -z \"$lt_prog_compiler_static\"; then\n\t# Neither direct hardcoding nor static linking is supported with a\n\t# broken collect2.\n\t_LT_TAGVAR(hardcode_direct, $1)=unsupported\n      fi\n      ;;\n\n    aix[[4-9]]*)\n      if test \"$host_cpu\" = ia64; then\n\t# On IA64, the linker does run time linking by default, so we don't\n\t# have to do anything special.\n\taix_use_runtimelinking=no\n\texp_sym_flag='-Bexport'\n\tno_entry_flag=\"\"\n      else\n\t# If we're using GNU nm, then we don't want the \"-C\" option.\n\t# -C means demangle to AIX nm, but means don't demangle with GNU nm\n\t# Also, AIX nm treats weak defined symbols like other global\n\t# defined symbols, whereas GNU nm marks them as \"W\".\n\tif $NM -V 2>&1 | $GREP 'GNU' > /dev/null; then\n\t  _LT_TAGVAR(export_symbols_cmds, $1)='$NM -Bpg $libobjs $convenience | awk '\\''{ if (((\\$ 2 == \"T\") || (\\$ 2 == \"D\") || (\\$ 2 == \"B\") || (\\$ 2 == \"W\")) && ([substr](\\$ 3,1,1) != \".\")) { print \\$ 3 } }'\\'' | sort -u > $export_symbols'\n\telse\n\t  _LT_TAGVAR(export_symbols_cmds, $1)='$NM -BCpg $libobjs $convenience | awk '\\''{ if (((\\$ 2 == \"T\") || (\\$ 2 == \"D\") || (\\$ 2 == \"B\")) && ([substr](\\$ 3,1,1) != \".\")) { print \\$ 3 } }'\\'' | sort -u > $export_symbols'\n\tfi\n\taix_use_runtimelinking=no\n\n\t# Test if we are trying to use run time linking or normal\n\t# AIX style linking. If -brtl is somewhere in LDFLAGS, we\n\t# need to do runtime linking.\n\tcase $host_os in aix4.[[23]]|aix4.[[23]].*|aix[[5-9]]*)\n\t  for ld_flag in $LDFLAGS; do\n\t  if (test $ld_flag = \"-brtl\" || test $ld_flag = \"-Wl,-brtl\"); then\n\t    aix_use_runtimelinking=yes\n\t    break\n\t  fi\n\t  done\n\t  ;;\n\tesac\n\n\texp_sym_flag='-bexport'\n\tno_entry_flag='-bnoentry'\n      fi\n\n      # When large executables or shared objects are built, AIX ld can\n      # have problems creating the table of contents.  If linking a library\n      # or program results in \"error TOC overflow\" add -mminimal-toc to\n      # CXXFLAGS/CFLAGS for g++/gcc.  In the cases where that is not\n      # enough to fix the problem, add -Wl,-bbigtoc to LDFLAGS.\n\n      _LT_TAGVAR(archive_cmds, $1)=''\n      _LT_TAGVAR(hardcode_direct, $1)=yes\n      _LT_TAGVAR(hardcode_direct_absolute, $1)=yes\n      _LT_TAGVAR(hardcode_libdir_separator, $1)=':'\n      _LT_TAGVAR(link_all_deplibs, $1)=yes\n      _LT_TAGVAR(file_list_spec, $1)='${wl}-f,'\n\n      if test \"$GCC\" = yes; then\n\tcase $host_os in aix4.[[012]]|aix4.[[012]].*)\n\t# We only want to do this on AIX 4.2 and lower, the check\n\t# below for broken collect2 doesn't work under 4.3+\n\t  collect2name=`${CC} -print-prog-name=collect2`\n\t  if test -f \"$collect2name\" &&\n\t   strings \"$collect2name\" | $GREP resolve_lib_name >/dev/null\n\t  then\n\t  # We have reworked collect2\n\t  :\n\t  else\n\t  # We have old collect2\n\t  _LT_TAGVAR(hardcode_direct, $1)=unsupported\n\t  # It fails to find uninstalled libraries when the uninstalled\n\t  # path is not listed in the libpath.  Setting hardcode_minus_L\n\t  # to unsupported forces relinking\n\t  _LT_TAGVAR(hardcode_minus_L, $1)=yes\n\t  _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir'\n\t  _LT_TAGVAR(hardcode_libdir_separator, $1)=\n\t  fi\n\t  ;;\n\tesac\n\tshared_flag='-shared'\n\tif test \"$aix_use_runtimelinking\" = yes; then\n\t  shared_flag=\"$shared_flag \"'${wl}-G'\n\tfi\n\t_LT_TAGVAR(link_all_deplibs, $1)=no\n      else\n\t# not using gcc\n\tif test \"$host_cpu\" = ia64; then\n\t# VisualAge C++, Version 5.5 for AIX 5L for IA-64, Beta 3 Release\n\t# chokes on -Wl,-G. The following line is correct:\n\t  shared_flag='-G'\n\telse\n\t  if test \"$aix_use_runtimelinking\" = yes; then\n\t    shared_flag='${wl}-G'\n\t  else\n\t    shared_flag='${wl}-bM:SRE'\n\t  fi\n\tfi\n      fi\n\n      _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}-bexpall'\n      # It seems that -bexpall does not export symbols beginning with\n      # underscore (_), so it is better to generate a list of symbols to export.\n      _LT_TAGVAR(always_export_symbols, $1)=yes\n      if test \"$aix_use_runtimelinking\" = yes; then\n\t# Warning - without using the other runtime loading flags (-brtl),\n\t# -berok will link without error, but may produce a broken library.\n\t_LT_TAGVAR(allow_undefined_flag, $1)='-berok'\n        # Determine the default libpath from the value encoded in an\n        # empty executable.\n        _LT_SYS_MODULE_PATH_AIX([$1])\n        _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-blibpath:$libdir:'\"$aix_libpath\"\n        _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -o $output_objdir/$soname $libobjs $deplibs '\"\\${wl}$no_entry_flag\"' $compiler_flags `if test \"x${allow_undefined_flag}\" != \"x\"; then func_echo_all \"${wl}${allow_undefined_flag}\"; else :; fi` '\"\\${wl}$exp_sym_flag:\\$export_symbols $shared_flag\"\n      else\n\tif test \"$host_cpu\" = ia64; then\n\t  _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-R $libdir:/usr/lib:/lib'\n\t  _LT_TAGVAR(allow_undefined_flag, $1)=\"-z nodefs\"\n\t  _LT_TAGVAR(archive_expsym_cmds, $1)=\"\\$CC $shared_flag\"' -o $output_objdir/$soname $libobjs $deplibs '\"\\${wl}$no_entry_flag\"' $compiler_flags ${wl}${allow_undefined_flag} '\"\\${wl}$exp_sym_flag:\\$export_symbols\"\n\telse\n\t # Determine the default libpath from the value encoded in an\n\t # empty executable.\n\t _LT_SYS_MODULE_PATH_AIX([$1])\n\t _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-blibpath:$libdir:'\"$aix_libpath\"\n\t  # Warning - without using the other run time loading flags,\n\t  # -berok will link without error, but may produce a broken library.\n\t  _LT_TAGVAR(no_undefined_flag, $1)=' ${wl}-bernotok'\n\t  _LT_TAGVAR(allow_undefined_flag, $1)=' ${wl}-berok'\n\t  if test \"$with_gnu_ld\" = yes; then\n\t    # We only use this code for GNU lds that support --whole-archive.\n\t    _LT_TAGVAR(whole_archive_flag_spec, $1)='${wl}--whole-archive$convenience ${wl}--no-whole-archive'\n\t  else\n\t    # Exported symbols can be pulled into shared objects from archives\n\t    _LT_TAGVAR(whole_archive_flag_spec, $1)='$convenience'\n\t  fi\n\t  _LT_TAGVAR(archive_cmds_need_lc, $1)=yes\n\t  # This is similar to how AIX traditionally builds its shared libraries.\n\t  _LT_TAGVAR(archive_expsym_cmds, $1)=\"\\$CC $shared_flag\"' -o $output_objdir/$soname $libobjs $deplibs ${wl}-bnoentry $compiler_flags ${wl}-bE:$export_symbols${allow_undefined_flag}~$AR $AR_FLAGS $output_objdir/$libname$release.a $output_objdir/$soname'\n\tfi\n      fi\n      ;;\n\n    amigaos*)\n      case $host_cpu in\n      powerpc)\n            # see comment about AmigaOS4 .so support\n            _LT_TAGVAR(archive_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib'\n            _LT_TAGVAR(archive_expsym_cmds, $1)=''\n        ;;\n      m68k)\n            _LT_TAGVAR(archive_cmds, $1)='$RM $output_objdir/a2ixlibrary.data~$ECHO \"#define NAME $libname\" > $output_objdir/a2ixlibrary.data~$ECHO \"#define LIBRARY_ID 1\" >> $output_objdir/a2ixlibrary.data~$ECHO \"#define VERSION $major\" >> $output_objdir/a2ixlibrary.data~$ECHO \"#define REVISION $revision\" >> $output_objdir/a2ixlibrary.data~$AR $AR_FLAGS $lib $libobjs~$RANLIB $lib~(cd $output_objdir && a2ixlibrary -32)'\n            _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir'\n            _LT_TAGVAR(hardcode_minus_L, $1)=yes\n        ;;\n      esac\n      ;;\n\n    bsdi[[45]]*)\n      _LT_TAGVAR(export_dynamic_flag_spec, $1)=-rdynamic\n      ;;\n\n    cygwin* | mingw* | pw32* | cegcc*)\n      # When not using gcc, we currently assume that we are using\n      # Microsoft Visual C++.\n      # hardcode_libdir_flag_spec is actually meaningless, as there is\n      # no search path for DLLs.\n      case $cc_basename in\n      cl*)\n\t# Native MSVC\n\t_LT_TAGVAR(hardcode_libdir_flag_spec, $1)=' '\n\t_LT_TAGVAR(allow_undefined_flag, $1)=unsupported\n\t_LT_TAGVAR(always_export_symbols, $1)=yes\n\t_LT_TAGVAR(file_list_spec, $1)='@'\n\t# Tell ltmain to make .lib files, not .a files.\n\tlibext=lib\n\t# Tell ltmain to make .dll files, not .so files.\n\tshrext_cmds=\".dll\"\n\t# FIXME: Setting linknames here is a bad hack.\n\t_LT_TAGVAR(archive_cmds, $1)='$CC -o $output_objdir/$soname $libobjs $compiler_flags $deplibs -Wl,-dll~linknames='\n\t_LT_TAGVAR(archive_expsym_cmds, $1)='if test \"x`$SED 1q $export_symbols`\" = xEXPORTS; then\n\t    sed -n -e 's/\\\\\\\\\\\\\\(.*\\\\\\\\\\\\\\)/-link\\\\\\ -EXPORT:\\\\\\\\\\\\\\1/' -e '1\\\\\\!p' < $export_symbols > $output_objdir/$soname.exp;\n\t  else\n\t    sed -e 's/\\\\\\\\\\\\\\(.*\\\\\\\\\\\\\\)/-link\\\\\\ -EXPORT:\\\\\\\\\\\\\\1/' < $export_symbols > $output_objdir/$soname.exp;\n\t  fi~\n\t  $CC -o $tool_output_objdir$soname $libobjs $compiler_flags $deplibs \"@$tool_output_objdir$soname.exp\" -Wl,-DLL,-IMPLIB:\"$tool_output_objdir$libname.dll.lib\"~\n\t  linknames='\n\t# The linker will not automatically build a static lib if we build a DLL.\n\t# _LT_TAGVAR(old_archive_from_new_cmds, $1)='true'\n\t_LT_TAGVAR(enable_shared_with_static_runtimes, $1)=yes\n\t_LT_TAGVAR(exclude_expsyms, $1)='_NULL_IMPORT_DESCRIPTOR|_IMPORT_DESCRIPTOR_.*'\n\t_LT_TAGVAR(export_symbols_cmds, $1)='$NM $libobjs $convenience | $global_symbol_pipe | $SED -e '\\''/^[[BCDGRS]][[ ]]/s/.*[[ ]]\\([[^ ]]*\\)/\\1,DATA/'\\'' | $SED -e '\\''/^[[AITW]][[ ]]/s/.*[[ ]]//'\\'' | sort | uniq > $export_symbols'\n\t# Don't use ranlib\n\t_LT_TAGVAR(old_postinstall_cmds, $1)='chmod 644 $oldlib'\n\t_LT_TAGVAR(postlink_cmds, $1)='lt_outputfile=\"@OUTPUT@\"~\n\t  lt_tool_outputfile=\"@TOOL_OUTPUT@\"~\n\t  case $lt_outputfile in\n\t    *.exe|*.EXE) ;;\n\t    *)\n\t      lt_outputfile=\"$lt_outputfile.exe\"\n\t      lt_tool_outputfile=\"$lt_tool_outputfile.exe\"\n\t      ;;\n\t  esac~\n\t  if test \"$MANIFEST_TOOL\" != \":\" && test -f \"$lt_outputfile.manifest\"; then\n\t    $MANIFEST_TOOL -manifest \"$lt_tool_outputfile.manifest\" -outputresource:\"$lt_tool_outputfile\" || exit 1;\n\t    $RM \"$lt_outputfile.manifest\";\n\t  fi'\n\t;;\n      *)\n\t# Assume MSVC wrapper\n\t_LT_TAGVAR(hardcode_libdir_flag_spec, $1)=' '\n\t_LT_TAGVAR(allow_undefined_flag, $1)=unsupported\n\t# Tell ltmain to make .lib files, not .a files.\n\tlibext=lib\n\t# Tell ltmain to make .dll files, not .so files.\n\tshrext_cmds=\".dll\"\n\t# FIXME: Setting linknames here is a bad hack.\n\t_LT_TAGVAR(archive_cmds, $1)='$CC -o $lib $libobjs $compiler_flags `func_echo_all \"$deplibs\" | $SED '\\''s/ -lc$//'\\''` -link -dll~linknames='\n\t# The linker will automatically build a .lib file if we build a DLL.\n\t_LT_TAGVAR(old_archive_from_new_cmds, $1)='true'\n\t# FIXME: Should let the user specify the lib program.\n\t_LT_TAGVAR(old_archive_cmds, $1)='lib -OUT:$oldlib$oldobjs$old_deplibs'\n\t_LT_TAGVAR(enable_shared_with_static_runtimes, $1)=yes\n\t;;\n      esac\n      ;;\n\n    darwin* | rhapsody*)\n      _LT_DARWIN_LINKER_FEATURES($1)\n      ;;\n\n    dgux*)\n      _LT_TAGVAR(archive_cmds, $1)='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags'\n      _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir'\n      _LT_TAGVAR(hardcode_shlibpath_var, $1)=no\n      ;;\n\n    # FreeBSD 2.2.[012] allows us to include c++rt0.o to get C++ constructor\n    # support.  Future versions do this automatically, but an explicit c++rt0.o\n    # does not break anything, and helps significantly (at the cost of a little\n    # extra space).\n    freebsd2.2*)\n      _LT_TAGVAR(archive_cmds, $1)='$LD -Bshareable -o $lib $libobjs $deplibs $linker_flags /usr/lib/c++rt0.o'\n      _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-R$libdir'\n      _LT_TAGVAR(hardcode_direct, $1)=yes\n      _LT_TAGVAR(hardcode_shlibpath_var, $1)=no\n      ;;\n\n    # Unfortunately, older versions of FreeBSD 2 do not have this feature.\n    freebsd2.*)\n      _LT_TAGVAR(archive_cmds, $1)='$LD -Bshareable -o $lib $libobjs $deplibs $linker_flags'\n      _LT_TAGVAR(hardcode_direct, $1)=yes\n      _LT_TAGVAR(hardcode_minus_L, $1)=yes\n      _LT_TAGVAR(hardcode_shlibpath_var, $1)=no\n      ;;\n\n    # FreeBSD 3 and greater uses gcc -shared to do shared libraries.\n    freebsd* | dragonfly*)\n      _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag -o $lib $libobjs $deplibs $compiler_flags'\n      _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-R$libdir'\n      _LT_TAGVAR(hardcode_direct, $1)=yes\n      _LT_TAGVAR(hardcode_shlibpath_var, $1)=no\n      ;;\n\n    hpux9*)\n      if test \"$GCC\" = yes; then\n\t_LT_TAGVAR(archive_cmds, $1)='$RM $output_objdir/$soname~$CC -shared $pic_flag ${wl}+b ${wl}$install_libdir -o $output_objdir/$soname $libobjs $deplibs $compiler_flags~test $output_objdir/$soname = $lib || mv $output_objdir/$soname $lib'\n      else\n\t_LT_TAGVAR(archive_cmds, $1)='$RM $output_objdir/$soname~$LD -b +b $install_libdir -o $output_objdir/$soname $libobjs $deplibs $linker_flags~test $output_objdir/$soname = $lib || mv $output_objdir/$soname $lib'\n      fi\n      _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}+b ${wl}$libdir'\n      _LT_TAGVAR(hardcode_libdir_separator, $1)=:\n      _LT_TAGVAR(hardcode_direct, $1)=yes\n\n      # hardcode_minus_L: Not really in the search PATH,\n      # but as the default location of the library.\n      _LT_TAGVAR(hardcode_minus_L, $1)=yes\n      _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}-E'\n      ;;\n\n    hpux10*)\n      if test \"$GCC\" = yes && test \"$with_gnu_ld\" = no; then\n\t_LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag ${wl}+h ${wl}$soname ${wl}+b ${wl}$install_libdir -o $lib $libobjs $deplibs $compiler_flags'\n      else\n\t_LT_TAGVAR(archive_cmds, $1)='$LD -b +h $soname +b $install_libdir -o $lib $libobjs $deplibs $linker_flags'\n      fi\n      if test \"$with_gnu_ld\" = no; then\n\t_LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}+b ${wl}$libdir'\n\t_LT_TAGVAR(hardcode_libdir_separator, $1)=:\n\t_LT_TAGVAR(hardcode_direct, $1)=yes\n\t_LT_TAGVAR(hardcode_direct_absolute, $1)=yes\n\t_LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}-E'\n\t# hardcode_minus_L: Not really in the search PATH,\n\t# but as the default location of the library.\n\t_LT_TAGVAR(hardcode_minus_L, $1)=yes\n      fi\n      ;;\n\n    hpux11*)\n      if test \"$GCC\" = yes && test \"$with_gnu_ld\" = no; then\n\tcase $host_cpu in\n\thppa*64*)\n\t  _LT_TAGVAR(archive_cmds, $1)='$CC -shared ${wl}+h ${wl}$soname -o $lib $libobjs $deplibs $compiler_flags'\n\t  ;;\n\tia64*)\n\t  _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag ${wl}+h ${wl}$soname ${wl}+nodefaultrpath -o $lib $libobjs $deplibs $compiler_flags'\n\t  ;;\n\t*)\n\t  _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag ${wl}+h ${wl}$soname ${wl}+b ${wl}$install_libdir -o $lib $libobjs $deplibs $compiler_flags'\n\t  ;;\n\tesac\n      else\n\tcase $host_cpu in\n\thppa*64*)\n\t  _LT_TAGVAR(archive_cmds, $1)='$CC -b ${wl}+h ${wl}$soname -o $lib $libobjs $deplibs $compiler_flags'\n\t  ;;\n\tia64*)\n\t  _LT_TAGVAR(archive_cmds, $1)='$CC -b ${wl}+h ${wl}$soname ${wl}+nodefaultrpath -o $lib $libobjs $deplibs $compiler_flags'\n\t  ;;\n\t*)\n\tm4_if($1, [], [\n\t  # Older versions of the 11.00 compiler do not understand -b yet\n\t  # (HP92453-01 A.11.01.20 doesn't, HP92453-01 B.11.X.35175-35176.GP does)\n\t  _LT_LINKER_OPTION([if $CC understands -b],\n\t    _LT_TAGVAR(lt_cv_prog_compiler__b, $1), [-b],\n\t    [_LT_TAGVAR(archive_cmds, $1)='$CC -b ${wl}+h ${wl}$soname ${wl}+b ${wl}$install_libdir -o $lib $libobjs $deplibs $compiler_flags'],\n\t    [_LT_TAGVAR(archive_cmds, $1)='$LD -b +h $soname +b $install_libdir -o $lib $libobjs $deplibs $linker_flags'])],\n\t  [_LT_TAGVAR(archive_cmds, $1)='$CC -b ${wl}+h ${wl}$soname ${wl}+b ${wl}$install_libdir -o $lib $libobjs $deplibs $compiler_flags'])\n\t  ;;\n\tesac\n      fi\n      if test \"$with_gnu_ld\" = no; then\n\t_LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}+b ${wl}$libdir'\n\t_LT_TAGVAR(hardcode_libdir_separator, $1)=:\n\n\tcase $host_cpu in\n\thppa*64*|ia64*)\n\t  _LT_TAGVAR(hardcode_direct, $1)=no\n\t  _LT_TAGVAR(hardcode_shlibpath_var, $1)=no\n\t  ;;\n\t*)\n\t  _LT_TAGVAR(hardcode_direct, $1)=yes\n\t  _LT_TAGVAR(hardcode_direct_absolute, $1)=yes\n\t  _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}-E'\n\n\t  # hardcode_minus_L: Not really in the search PATH,\n\t  # but as the default location of the library.\n\t  _LT_TAGVAR(hardcode_minus_L, $1)=yes\n\t  ;;\n\tesac\n      fi\n      ;;\n\n    irix5* | irix6* | nonstopux*)\n      if test \"$GCC\" = yes; then\n\t_LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-soname ${wl}$soname `test -n \"$verstring\" && func_echo_all \"${wl}-set_version ${wl}$verstring\"` ${wl}-update_registry ${wl}${output_objdir}/so_locations -o $lib'\n\t# Try to use the -exported_symbol ld option, if it does not\n\t# work, assume that -exports_file does not work either and\n\t# implicitly export all symbols.\n\t# This should be the same for all languages, so no per-tag cache variable.\n\tAC_CACHE_CHECK([whether the $host_os linker accepts -exported_symbol],\n\t  [lt_cv_irix_exported_symbol],\n\t  [save_LDFLAGS=\"$LDFLAGS\"\n\t   LDFLAGS=\"$LDFLAGS -shared ${wl}-exported_symbol ${wl}foo ${wl}-update_registry ${wl}/dev/null\"\n\t   AC_LINK_IFELSE(\n\t     [AC_LANG_SOURCE(\n\t        [AC_LANG_CASE([C], [[int foo (void) { return 0; }]],\n\t\t\t      [C++], [[int foo (void) { return 0; }]],\n\t\t\t      [Fortran 77], [[\n      subroutine foo\n      end]],\n\t\t\t      [Fortran], [[\n      subroutine foo\n      end]])])],\n\t      [lt_cv_irix_exported_symbol=yes],\n\t      [lt_cv_irix_exported_symbol=no])\n           LDFLAGS=\"$save_LDFLAGS\"])\n\tif test \"$lt_cv_irix_exported_symbol\" = yes; then\n          _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-soname ${wl}$soname `test -n \"$verstring\" && func_echo_all \"${wl}-set_version ${wl}$verstring\"` ${wl}-update_registry ${wl}${output_objdir}/so_locations ${wl}-exports_file ${wl}$export_symbols -o $lib'\n\tfi\n      else\n\t_LT_TAGVAR(archive_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags -soname $soname `test -n \"$verstring\" && func_echo_all \"-set_version $verstring\"` -update_registry ${output_objdir}/so_locations -o $lib'\n\t_LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags -soname $soname `test -n \"$verstring\" && func_echo_all \"-set_version $verstring\"` -update_registry ${output_objdir}/so_locations -exports_file $export_symbols -o $lib'\n      fi\n      _LT_TAGVAR(archive_cmds_need_lc, $1)='no'\n      _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath ${wl}$libdir'\n      _LT_TAGVAR(hardcode_libdir_separator, $1)=:\n      _LT_TAGVAR(inherit_rpath, $1)=yes\n      _LT_TAGVAR(link_all_deplibs, $1)=yes\n      ;;\n\n    netbsd* | netbsdelf*-gnu)\n      if echo __ELF__ | $CC -E - | $GREP __ELF__ >/dev/null; then\n\t_LT_TAGVAR(archive_cmds, $1)='$LD -Bshareable -o $lib $libobjs $deplibs $linker_flags'  # a.out\n      else\n\t_LT_TAGVAR(archive_cmds, $1)='$LD -shared -o $lib $libobjs $deplibs $linker_flags'      # ELF\n      fi\n      _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-R$libdir'\n      _LT_TAGVAR(hardcode_direct, $1)=yes\n      _LT_TAGVAR(hardcode_shlibpath_var, $1)=no\n      ;;\n\n    newsos6)\n      _LT_TAGVAR(archive_cmds, $1)='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags'\n      _LT_TAGVAR(hardcode_direct, $1)=yes\n      _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath ${wl}$libdir'\n      _LT_TAGVAR(hardcode_libdir_separator, $1)=:\n      _LT_TAGVAR(hardcode_shlibpath_var, $1)=no\n      ;;\n\n    *nto* | *qnx*)\n      ;;\n\n    openbsd*)\n      if test -f /usr/libexec/ld.so; then\n\t_LT_TAGVAR(hardcode_direct, $1)=yes\n\t_LT_TAGVAR(hardcode_shlibpath_var, $1)=no\n\t_LT_TAGVAR(hardcode_direct_absolute, $1)=yes\n\tif test -z \"`echo __ELF__ | $CC -E - | $GREP __ELF__`\" || test \"$host_os-$host_cpu\" = \"openbsd2.8-powerpc\"; then\n\t  _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag -o $lib $libobjs $deplibs $compiler_flags'\n\t  _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $pic_flag -o $lib $libobjs $deplibs $compiler_flags ${wl}-retain-symbols-file,$export_symbols'\n\t  _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath,$libdir'\n\t  _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}-E'\n\telse\n\t  case $host_os in\n\t   openbsd[[01]].* | openbsd2.[[0-7]] | openbsd2.[[0-7]].*)\n\t     _LT_TAGVAR(archive_cmds, $1)='$LD -Bshareable -o $lib $libobjs $deplibs $linker_flags'\n\t     _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-R$libdir'\n\t     ;;\n\t   *)\n\t     _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag -o $lib $libobjs $deplibs $compiler_flags'\n\t     _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath,$libdir'\n\t     ;;\n\t  esac\n\tfi\n      else\n\t_LT_TAGVAR(ld_shlibs, $1)=no\n      fi\n      ;;\n\n    os2*)\n      _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir'\n      _LT_TAGVAR(hardcode_minus_L, $1)=yes\n      _LT_TAGVAR(allow_undefined_flag, $1)=unsupported\n      _LT_TAGVAR(archive_cmds, $1)='$ECHO \"LIBRARY $libname INITINSTANCE\" > $output_objdir/$libname.def~$ECHO \"DESCRIPTION \\\"$libname\\\"\" >> $output_objdir/$libname.def~echo DATA >> $output_objdir/$libname.def~echo \" SINGLE NONSHARED\" >> $output_objdir/$libname.def~echo EXPORTS >> $output_objdir/$libname.def~emxexp $libobjs >> $output_objdir/$libname.def~$CC -Zdll -Zcrtdll -o $lib $libobjs $deplibs $compiler_flags $output_objdir/$libname.def'\n      _LT_TAGVAR(old_archive_from_new_cmds, $1)='emximp -o $output_objdir/$libname.a $output_objdir/$libname.def'\n      ;;\n\n    osf3*)\n      if test \"$GCC\" = yes; then\n\t_LT_TAGVAR(allow_undefined_flag, $1)=' ${wl}-expect_unresolved ${wl}\\*'\n\t_LT_TAGVAR(archive_cmds, $1)='$CC -shared${allow_undefined_flag} $libobjs $deplibs $compiler_flags ${wl}-soname ${wl}$soname `test -n \"$verstring\" && func_echo_all \"${wl}-set_version ${wl}$verstring\"` ${wl}-update_registry ${wl}${output_objdir}/so_locations -o $lib'\n      else\n\t_LT_TAGVAR(allow_undefined_flag, $1)=' -expect_unresolved \\*'\n\t_LT_TAGVAR(archive_cmds, $1)='$CC -shared${allow_undefined_flag} $libobjs $deplibs $compiler_flags -soname $soname `test -n \"$verstring\" && func_echo_all \"-set_version $verstring\"` -update_registry ${output_objdir}/so_locations -o $lib'\n      fi\n      _LT_TAGVAR(archive_cmds_need_lc, $1)='no'\n      _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath ${wl}$libdir'\n      _LT_TAGVAR(hardcode_libdir_separator, $1)=:\n      ;;\n\n    osf4* | osf5*)\t# as osf3* with the addition of -msym flag\n      if test \"$GCC\" = yes; then\n\t_LT_TAGVAR(allow_undefined_flag, $1)=' ${wl}-expect_unresolved ${wl}\\*'\n\t_LT_TAGVAR(archive_cmds, $1)='$CC -shared${allow_undefined_flag} $pic_flag $libobjs $deplibs $compiler_flags ${wl}-msym ${wl}-soname ${wl}$soname `test -n \"$verstring\" && func_echo_all \"${wl}-set_version ${wl}$verstring\"` ${wl}-update_registry ${wl}${output_objdir}/so_locations -o $lib'\n\t_LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath ${wl}$libdir'\n      else\n\t_LT_TAGVAR(allow_undefined_flag, $1)=' -expect_unresolved \\*'\n\t_LT_TAGVAR(archive_cmds, $1)='$CC -shared${allow_undefined_flag} $libobjs $deplibs $compiler_flags -msym -soname $soname `test -n \"$verstring\" && func_echo_all \"-set_version $verstring\"` -update_registry ${output_objdir}/so_locations -o $lib'\n\t_LT_TAGVAR(archive_expsym_cmds, $1)='for i in `cat $export_symbols`; do printf \"%s %s\\\\n\" -exported_symbol \"\\$i\" >> $lib.exp; done; printf \"%s\\\\n\" \"-hidden\">> $lib.exp~\n\t$CC -shared${allow_undefined_flag} ${wl}-input ${wl}$lib.exp $compiler_flags $libobjs $deplibs -soname $soname `test -n \"$verstring\" && $ECHO \"-set_version $verstring\"` -update_registry ${output_objdir}/so_locations -o $lib~$RM $lib.exp'\n\n\t# Both c and cxx compiler support -rpath directly\n\t_LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-rpath $libdir'\n      fi\n      _LT_TAGVAR(archive_cmds_need_lc, $1)='no'\n      _LT_TAGVAR(hardcode_libdir_separator, $1)=:\n      ;;\n\n    solaris*)\n      _LT_TAGVAR(no_undefined_flag, $1)=' -z defs'\n      if test \"$GCC\" = yes; then\n\twlarc='${wl}'\n\t_LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag ${wl}-z ${wl}text ${wl}-h ${wl}$soname -o $lib $libobjs $deplibs $compiler_flags'\n\t_LT_TAGVAR(archive_expsym_cmds, $1)='echo \"{ global:\" > $lib.exp~cat $export_symbols | $SED -e \"s/\\(.*\\)/\\1;/\" >> $lib.exp~echo \"local: *; };\" >> $lib.exp~\n\t  $CC -shared $pic_flag ${wl}-z ${wl}text ${wl}-M ${wl}$lib.exp ${wl}-h ${wl}$soname -o $lib $libobjs $deplibs $compiler_flags~$RM $lib.exp'\n      else\n\tcase `$CC -V 2>&1` in\n\t*\"Compilers 5.0\"*)\n\t  wlarc=''\n\t  _LT_TAGVAR(archive_cmds, $1)='$LD -G${allow_undefined_flag} -h $soname -o $lib $libobjs $deplibs $linker_flags'\n\t  _LT_TAGVAR(archive_expsym_cmds, $1)='echo \"{ global:\" > $lib.exp~cat $export_symbols | $SED -e \"s/\\(.*\\)/\\1;/\" >> $lib.exp~echo \"local: *; };\" >> $lib.exp~\n\t  $LD -G${allow_undefined_flag} -M $lib.exp -h $soname -o $lib $libobjs $deplibs $linker_flags~$RM $lib.exp'\n\t  ;;\n\t*)\n\t  wlarc='${wl}'\n\t  _LT_TAGVAR(archive_cmds, $1)='$CC -G${allow_undefined_flag} -h $soname -o $lib $libobjs $deplibs $compiler_flags'\n\t  _LT_TAGVAR(archive_expsym_cmds, $1)='echo \"{ global:\" > $lib.exp~cat $export_symbols | $SED -e \"s/\\(.*\\)/\\1;/\" >> $lib.exp~echo \"local: *; };\" >> $lib.exp~\n\t  $CC -G${allow_undefined_flag} -M $lib.exp -h $soname -o $lib $libobjs $deplibs $compiler_flags~$RM $lib.exp'\n\t  ;;\n\tesac\n      fi\n      _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-R$libdir'\n      _LT_TAGVAR(hardcode_shlibpath_var, $1)=no\n      case $host_os in\n      solaris2.[[0-5]] | solaris2.[[0-5]].*) ;;\n      *)\n\t# The compiler driver will combine and reorder linker options,\n\t# but understands `-z linker_flag'.  GCC discards it without `$wl',\n\t# but is careful enough not to reorder.\n\t# Supported since Solaris 2.6 (maybe 2.5.1?)\n\tif test \"$GCC\" = yes; then\n\t  _LT_TAGVAR(whole_archive_flag_spec, $1)='${wl}-z ${wl}allextract$convenience ${wl}-z ${wl}defaultextract'\n\telse\n\t  _LT_TAGVAR(whole_archive_flag_spec, $1)='-z allextract$convenience -z defaultextract'\n\tfi\n\t;;\n      esac\n      _LT_TAGVAR(link_all_deplibs, $1)=yes\n      ;;\n\n    sunos4*)\n      if test \"x$host_vendor\" = xsequent; then\n\t# Use $CC to link under sequent, because it throws in some extra .o\n\t# files that make .init and .fini sections work.\n\t_LT_TAGVAR(archive_cmds, $1)='$CC -G ${wl}-h $soname -o $lib $libobjs $deplibs $compiler_flags'\n      else\n\t_LT_TAGVAR(archive_cmds, $1)='$LD -assert pure-text -Bstatic -o $lib $libobjs $deplibs $linker_flags'\n      fi\n      _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir'\n      _LT_TAGVAR(hardcode_direct, $1)=yes\n      _LT_TAGVAR(hardcode_minus_L, $1)=yes\n      _LT_TAGVAR(hardcode_shlibpath_var, $1)=no\n      ;;\n\n    sysv4)\n      case $host_vendor in\n\tsni)\n\t  _LT_TAGVAR(archive_cmds, $1)='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags'\n\t  _LT_TAGVAR(hardcode_direct, $1)=yes # is this really true???\n\t;;\n\tsiemens)\n\t  ## LD is ld it makes a PLAMLIB\n\t  ## CC just makes a GrossModule.\n\t  _LT_TAGVAR(archive_cmds, $1)='$LD -G -o $lib $libobjs $deplibs $linker_flags'\n\t  _LT_TAGVAR(reload_cmds, $1)='$CC -r -o $output$reload_objs'\n\t  _LT_TAGVAR(hardcode_direct, $1)=no\n        ;;\n\tmotorola)\n\t  _LT_TAGVAR(archive_cmds, $1)='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags'\n\t  _LT_TAGVAR(hardcode_direct, $1)=no #Motorola manual says yes, but my tests say they lie\n\t;;\n      esac\n      runpath_var='LD_RUN_PATH'\n      _LT_TAGVAR(hardcode_shlibpath_var, $1)=no\n      ;;\n\n    sysv4.3*)\n      _LT_TAGVAR(archive_cmds, $1)='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags'\n      _LT_TAGVAR(hardcode_shlibpath_var, $1)=no\n      _LT_TAGVAR(export_dynamic_flag_spec, $1)='-Bexport'\n      ;;\n\n    sysv4*MP*)\n      if test -d /usr/nec; then\n\t_LT_TAGVAR(archive_cmds, $1)='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags'\n\t_LT_TAGVAR(hardcode_shlibpath_var, $1)=no\n\trunpath_var=LD_RUN_PATH\n\thardcode_runpath_var=yes\n\t_LT_TAGVAR(ld_shlibs, $1)=yes\n      fi\n      ;;\n\n    sysv4*uw2* | sysv5OpenUNIX* | sysv5UnixWare7.[[01]].[[10]]* | unixware7* | sco3.2v5.0.[[024]]*)\n      _LT_TAGVAR(no_undefined_flag, $1)='${wl}-z,text'\n      _LT_TAGVAR(archive_cmds_need_lc, $1)=no\n      _LT_TAGVAR(hardcode_shlibpath_var, $1)=no\n      runpath_var='LD_RUN_PATH'\n\n      if test \"$GCC\" = yes; then\n\t_LT_TAGVAR(archive_cmds, $1)='$CC -shared ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags'\n\t_LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags'\n      else\n\t_LT_TAGVAR(archive_cmds, $1)='$CC -G ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags'\n\t_LT_TAGVAR(archive_expsym_cmds, $1)='$CC -G ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags'\n      fi\n      ;;\n\n    sysv5* | sco3.2v5* | sco5v6*)\n      # Note: We can NOT use -z defs as we might desire, because we do not\n      # link with -lc, and that would cause any symbols used from libc to\n      # always be unresolved, which means just about no library would\n      # ever link correctly.  If we're not using GNU ld we use -z text\n      # though, which does catch some bad symbols but isn't as heavy-handed\n      # as -z defs.\n      _LT_TAGVAR(no_undefined_flag, $1)='${wl}-z,text'\n      _LT_TAGVAR(allow_undefined_flag, $1)='${wl}-z,nodefs'\n      _LT_TAGVAR(archive_cmds_need_lc, $1)=no\n      _LT_TAGVAR(hardcode_shlibpath_var, $1)=no\n      _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-R,$libdir'\n      _LT_TAGVAR(hardcode_libdir_separator, $1)=':'\n      _LT_TAGVAR(link_all_deplibs, $1)=yes\n      _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}-Bexport'\n      runpath_var='LD_RUN_PATH'\n\n      if test \"$GCC\" = yes; then\n\t_LT_TAGVAR(archive_cmds, $1)='$CC -shared ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags'\n\t_LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags'\n      else\n\t_LT_TAGVAR(archive_cmds, $1)='$CC -G ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags'\n\t_LT_TAGVAR(archive_expsym_cmds, $1)='$CC -G ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags'\n      fi\n      ;;\n\n    uts4*)\n      _LT_TAGVAR(archive_cmds, $1)='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags'\n      _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir'\n      _LT_TAGVAR(hardcode_shlibpath_var, $1)=no\n      ;;\n\n    *)\n      _LT_TAGVAR(ld_shlibs, $1)=no\n      ;;\n    esac\n\n    if test x$host_vendor = xsni; then\n      case $host in\n      sysv4 | sysv4.2uw2* | sysv4.3* | sysv5*)\n\t_LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}-Blargedynsym'\n\t;;\n      esac\n    fi\n  fi\n])\nAC_MSG_RESULT([$_LT_TAGVAR(ld_shlibs, $1)])\ntest \"$_LT_TAGVAR(ld_shlibs, $1)\" = no && can_build_shared=no\n\n_LT_TAGVAR(with_gnu_ld, $1)=$with_gnu_ld\n\n_LT_DECL([], [libext], [0], [Old archive suffix (normally \"a\")])dnl\n_LT_DECL([], [shrext_cmds], [1], [Shared library suffix (normally \".so\")])dnl\n_LT_DECL([], [extract_expsyms_cmds], [2],\n    [The commands to extract the exported symbol list from a shared archive])\n\n#\n# Do we need to explicitly link libc?\n#\ncase \"x$_LT_TAGVAR(archive_cmds_need_lc, $1)\" in\nx|xyes)\n  # Assume -lc should be added\n  _LT_TAGVAR(archive_cmds_need_lc, $1)=yes\n\n  if test \"$enable_shared\" = yes && test \"$GCC\" = yes; then\n    case $_LT_TAGVAR(archive_cmds, $1) in\n    *'~'*)\n      # FIXME: we may have to deal with multi-command sequences.\n      ;;\n    '$CC '*)\n      # Test whether the compiler implicitly links with -lc since on some\n      # systems, -lgcc has to come before -lc. If gcc already passes -lc\n      # to ld, don't add -lc before -lgcc.\n      AC_CACHE_CHECK([whether -lc should be explicitly linked in],\n\t[lt_cv_]_LT_TAGVAR(archive_cmds_need_lc, $1),\n\t[$RM conftest*\n\techo \"$lt_simple_compile_test_code\" > conftest.$ac_ext\n\n\tif AC_TRY_EVAL(ac_compile) 2>conftest.err; then\n\t  soname=conftest\n\t  lib=conftest\n\t  libobjs=conftest.$ac_objext\n\t  deplibs=\n\t  wl=$_LT_TAGVAR(lt_prog_compiler_wl, $1)\n\t  pic_flag=$_LT_TAGVAR(lt_prog_compiler_pic, $1)\n\t  compiler_flags=-v\n\t  linker_flags=-v\n\t  verstring=\n\t  output_objdir=.\n\t  libname=conftest\n\t  lt_save_allow_undefined_flag=$_LT_TAGVAR(allow_undefined_flag, $1)\n\t  _LT_TAGVAR(allow_undefined_flag, $1)=\n\t  if AC_TRY_EVAL(_LT_TAGVAR(archive_cmds, $1) 2\\>\\&1 \\| $GREP \\\" -lc \\\" \\>/dev/null 2\\>\\&1)\n\t  then\n\t    lt_cv_[]_LT_TAGVAR(archive_cmds_need_lc, $1)=no\n\t  else\n\t    lt_cv_[]_LT_TAGVAR(archive_cmds_need_lc, $1)=yes\n\t  fi\n\t  _LT_TAGVAR(allow_undefined_flag, $1)=$lt_save_allow_undefined_flag\n\telse\n\t  cat conftest.err 1>&5\n\tfi\n\t$RM conftest*\n\t])\n      _LT_TAGVAR(archive_cmds_need_lc, $1)=$lt_cv_[]_LT_TAGVAR(archive_cmds_need_lc, $1)\n      ;;\n    esac\n  fi\n  ;;\nesac\n\n_LT_TAGDECL([build_libtool_need_lc], [archive_cmds_need_lc], [0],\n    [Whether or not to add -lc for building shared libraries])\n_LT_TAGDECL([allow_libtool_libs_with_static_runtimes],\n    [enable_shared_with_static_runtimes], [0],\n    [Whether or not to disallow shared libs when runtime libs are static])\n_LT_TAGDECL([], [export_dynamic_flag_spec], [1],\n    [Compiler flag to allow reflexive dlopens])\n_LT_TAGDECL([], [whole_archive_flag_spec], [1],\n    [Compiler flag to generate shared objects directly from archives])\n_LT_TAGDECL([], [compiler_needs_object], [1],\n    [Whether the compiler copes with passing no objects directly])\n_LT_TAGDECL([], [old_archive_from_new_cmds], [2],\n    [Create an old-style archive from a shared archive])\n_LT_TAGDECL([], [old_archive_from_expsyms_cmds], [2],\n    [Create a temporary old-style archive to link instead of a shared archive])\n_LT_TAGDECL([], [archive_cmds], [2], [Commands used to build a shared archive])\n_LT_TAGDECL([], [archive_expsym_cmds], [2])\n_LT_TAGDECL([], [module_cmds], [2],\n    [Commands used to build a loadable module if different from building\n    a shared archive.])\n_LT_TAGDECL([], [module_expsym_cmds], [2])\n_LT_TAGDECL([], [with_gnu_ld], [1],\n    [Whether we are building with GNU ld or not])\n_LT_TAGDECL([], [allow_undefined_flag], [1],\n    [Flag that allows shared libraries with undefined symbols to be built])\n_LT_TAGDECL([], [no_undefined_flag], [1],\n    [Flag that enforces no undefined symbols])\n_LT_TAGDECL([], [hardcode_libdir_flag_spec], [1],\n    [Flag to hardcode $libdir into a binary during linking.\n    This must work even if $libdir does not exist])\n_LT_TAGDECL([], [hardcode_libdir_separator], [1],\n    [Whether we need a single \"-rpath\" flag with a separated argument])\n_LT_TAGDECL([], [hardcode_direct], [0],\n    [Set to \"yes\" if using DIR/libNAME${shared_ext} during linking hardcodes\n    DIR into the resulting binary])\n_LT_TAGDECL([], [hardcode_direct_absolute], [0],\n    [Set to \"yes\" if using DIR/libNAME${shared_ext} during linking hardcodes\n    DIR into the resulting binary and the resulting library dependency is\n    \"absolute\", i.e impossible to change by setting ${shlibpath_var} if the\n    library is relocated])\n_LT_TAGDECL([], [hardcode_minus_L], [0],\n    [Set to \"yes\" if using the -LDIR flag during linking hardcodes DIR\n    into the resulting binary])\n_LT_TAGDECL([], [hardcode_shlibpath_var], [0],\n    [Set to \"yes\" if using SHLIBPATH_VAR=DIR during linking hardcodes DIR\n    into the resulting binary])\n_LT_TAGDECL([], [hardcode_automatic], [0],\n    [Set to \"yes\" if building a shared library automatically hardcodes DIR\n    into the library and all subsequent libraries and executables linked\n    against it])\n_LT_TAGDECL([], [inherit_rpath], [0],\n    [Set to yes if linker adds runtime paths of dependent libraries\n    to runtime path list])\n_LT_TAGDECL([], [link_all_deplibs], [0],\n    [Whether libtool must link a program against all its dependency libraries])\n_LT_TAGDECL([], [always_export_symbols], [0],\n    [Set to \"yes\" if exported symbols are required])\n_LT_TAGDECL([], [export_symbols_cmds], [2],\n    [The commands to list exported symbols])\n_LT_TAGDECL([], [exclude_expsyms], [1],\n    [Symbols that should not be listed in the preloaded symbols])\n_LT_TAGDECL([], [include_expsyms], [1],\n    [Symbols that must always be exported])\n_LT_TAGDECL([], [prelink_cmds], [2],\n    [Commands necessary for linking programs (against libraries) with templates])\n_LT_TAGDECL([], [postlink_cmds], [2],\n    [Commands necessary for finishing linking programs])\n_LT_TAGDECL([], [file_list_spec], [1],\n    [Specify filename containing input files])\ndnl FIXME: Not yet implemented\ndnl _LT_TAGDECL([], [thread_safe_flag_spec], [1],\ndnl    [Compiler flag to generate thread safe objects])\n])# _LT_LINKER_SHLIBS\n\n\n# _LT_LANG_C_CONFIG([TAG])\n# ------------------------\n# Ensure that the configuration variables for a C compiler are suitably\n# defined.  These variables are subsequently used by _LT_CONFIG to write\n# the compiler configuration to `libtool'.\nm4_defun([_LT_LANG_C_CONFIG],\n[m4_require([_LT_DECL_EGREP])dnl\nlt_save_CC=\"$CC\"\nAC_LANG_PUSH(C)\n\n# Source file extension for C test sources.\nac_ext=c\n\n# Object file extension for compiled C test sources.\nobjext=o\n_LT_TAGVAR(objext, $1)=$objext\n\n# Code to be used in simple compile tests\nlt_simple_compile_test_code=\"int some_variable = 0;\"\n\n# Code to be used in simple link tests\nlt_simple_link_test_code='int main(){return(0);}'\n\n_LT_TAG_COMPILER\n# Save the default compiler, since it gets overwritten when the other\n# tags are being tested, and _LT_TAGVAR(compiler, []) is a NOP.\ncompiler_DEFAULT=$CC\n\n# save warnings/boilerplate of simple test code\n_LT_COMPILER_BOILERPLATE\n_LT_LINKER_BOILERPLATE\n\n## CAVEAT EMPTOR:\n## There is no encapsulation within the following macros, do not change\n## the running order or otherwise move them around unless you know exactly\n## what you are doing...\nif test -n \"$compiler\"; then\n  _LT_COMPILER_NO_RTTI($1)\n  _LT_COMPILER_PIC($1)\n  _LT_COMPILER_C_O($1)\n  _LT_COMPILER_FILE_LOCKS($1)\n  _LT_LINKER_SHLIBS($1)\n  _LT_SYS_DYNAMIC_LINKER($1)\n  _LT_LINKER_HARDCODE_LIBPATH($1)\n  LT_SYS_DLOPEN_SELF\n  _LT_CMD_STRIPLIB\n\n  # Report which library types will actually be built\n  AC_MSG_CHECKING([if libtool supports shared libraries])\n  AC_MSG_RESULT([$can_build_shared])\n\n  AC_MSG_CHECKING([whether to build shared libraries])\n  test \"$can_build_shared\" = \"no\" && enable_shared=no\n\n  # On AIX, shared libraries and static libraries use the same namespace, and\n  # are all built from PIC.\n  case $host_os in\n  aix3*)\n    test \"$enable_shared\" = yes && enable_static=no\n    if test -n \"$RANLIB\"; then\n      archive_cmds=\"$archive_cmds~\\$RANLIB \\$lib\"\n      postinstall_cmds='$RANLIB $lib'\n    fi\n    ;;\n\n  aix[[4-9]]*)\n    if test \"$host_cpu\" != ia64 && test \"$aix_use_runtimelinking\" = no ; then\n      test \"$enable_shared\" = yes && enable_static=no\n    fi\n    ;;\n  esac\n  AC_MSG_RESULT([$enable_shared])\n\n  AC_MSG_CHECKING([whether to build static libraries])\n  # Make sure either enable_shared or enable_static is yes.\n  test \"$enable_shared\" = yes || enable_static=yes\n  AC_MSG_RESULT([$enable_static])\n\n  _LT_CONFIG($1)\nfi\nAC_LANG_POP\nCC=\"$lt_save_CC\"\n])# _LT_LANG_C_CONFIG\n\n\n# _LT_LANG_CXX_CONFIG([TAG])\n# --------------------------\n# Ensure that the configuration variables for a C++ compiler are suitably\n# defined.  These variables are subsequently used by _LT_CONFIG to write\n# the compiler configuration to `libtool'.\nm4_defun([_LT_LANG_CXX_CONFIG],\n[m4_require([_LT_FILEUTILS_DEFAULTS])dnl\nm4_require([_LT_DECL_EGREP])dnl\nm4_require([_LT_PATH_MANIFEST_TOOL])dnl\nif test -n \"$CXX\" && ( test \"X$CXX\" != \"Xno\" &&\n    ( (test \"X$CXX\" = \"Xg++\" && `g++ -v >/dev/null 2>&1` ) ||\n    (test \"X$CXX\" != \"Xg++\"))) ; then\n  AC_PROG_CXXCPP\nelse\n  _lt_caught_CXX_error=yes\nfi\n\nAC_LANG_PUSH(C++)\n_LT_TAGVAR(archive_cmds_need_lc, $1)=no\n_LT_TAGVAR(allow_undefined_flag, $1)=\n_LT_TAGVAR(always_export_symbols, $1)=no\n_LT_TAGVAR(archive_expsym_cmds, $1)=\n_LT_TAGVAR(compiler_needs_object, $1)=no\n_LT_TAGVAR(export_dynamic_flag_spec, $1)=\n_LT_TAGVAR(hardcode_direct, $1)=no\n_LT_TAGVAR(hardcode_direct_absolute, $1)=no\n_LT_TAGVAR(hardcode_libdir_flag_spec, $1)=\n_LT_TAGVAR(hardcode_libdir_separator, $1)=\n_LT_TAGVAR(hardcode_minus_L, $1)=no\n_LT_TAGVAR(hardcode_shlibpath_var, $1)=unsupported\n_LT_TAGVAR(hardcode_automatic, $1)=no\n_LT_TAGVAR(inherit_rpath, $1)=no\n_LT_TAGVAR(module_cmds, $1)=\n_LT_TAGVAR(module_expsym_cmds, $1)=\n_LT_TAGVAR(link_all_deplibs, $1)=unknown\n_LT_TAGVAR(old_archive_cmds, $1)=$old_archive_cmds\n_LT_TAGVAR(reload_flag, $1)=$reload_flag\n_LT_TAGVAR(reload_cmds, $1)=$reload_cmds\n_LT_TAGVAR(no_undefined_flag, $1)=\n_LT_TAGVAR(whole_archive_flag_spec, $1)=\n_LT_TAGVAR(enable_shared_with_static_runtimes, $1)=no\n\n# Source file extension for C++ test sources.\nac_ext=cpp\n\n# Object file extension for compiled C++ test sources.\nobjext=o\n_LT_TAGVAR(objext, $1)=$objext\n\n# No sense in running all these tests if we already determined that\n# the CXX compiler isn't working.  Some variables (like enable_shared)\n# are currently assumed to apply to all compilers on this platform,\n# and will be corrupted by setting them based on a non-working compiler.\nif test \"$_lt_caught_CXX_error\" != yes; then\n  # Code to be used in simple compile tests\n  lt_simple_compile_test_code=\"int some_variable = 0;\"\n\n  # Code to be used in simple link tests\n  lt_simple_link_test_code='int main(int, char *[[]]) { return(0); }'\n\n  # ltmain only uses $CC for tagged configurations so make sure $CC is set.\n  _LT_TAG_COMPILER\n\n  # save warnings/boilerplate of simple test code\n  _LT_COMPILER_BOILERPLATE\n  _LT_LINKER_BOILERPLATE\n\n  # Allow CC to be a program name with arguments.\n  lt_save_CC=$CC\n  lt_save_CFLAGS=$CFLAGS\n  lt_save_LD=$LD\n  lt_save_GCC=$GCC\n  GCC=$GXX\n  lt_save_with_gnu_ld=$with_gnu_ld\n  lt_save_path_LD=$lt_cv_path_LD\n  if test -n \"${lt_cv_prog_gnu_ldcxx+set}\"; then\n    lt_cv_prog_gnu_ld=$lt_cv_prog_gnu_ldcxx\n  else\n    $as_unset lt_cv_prog_gnu_ld\n  fi\n  if test -n \"${lt_cv_path_LDCXX+set}\"; then\n    lt_cv_path_LD=$lt_cv_path_LDCXX\n  else\n    $as_unset lt_cv_path_LD\n  fi\n  test -z \"${LDCXX+set}\" || LD=$LDCXX\n  CC=${CXX-\"c++\"}\n  CFLAGS=$CXXFLAGS\n  compiler=$CC\n  _LT_TAGVAR(compiler, $1)=$CC\n  _LT_CC_BASENAME([$compiler])\n\n  if test -n \"$compiler\"; then\n    # We don't want -fno-exception when compiling C++ code, so set the\n    # no_builtin_flag separately\n    if test \"$GXX\" = yes; then\n      _LT_TAGVAR(lt_prog_compiler_no_builtin_flag, $1)=' -fno-builtin'\n    else\n      _LT_TAGVAR(lt_prog_compiler_no_builtin_flag, $1)=\n    fi\n\n    if test \"$GXX\" = yes; then\n      # Set up default GNU C++ configuration\n\n      LT_PATH_LD\n\n      # Check if GNU C++ uses GNU ld as the underlying linker, since the\n      # archiving commands below assume that GNU ld is being used.\n      if test \"$with_gnu_ld\" = yes; then\n        _LT_TAGVAR(archive_cmds, $1)='$CC $pic_flag -shared -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $wl$soname -o $lib'\n        _LT_TAGVAR(archive_expsym_cmds, $1)='$CC $pic_flag -shared -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib'\n\n        _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath ${wl}$libdir'\n        _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}--export-dynamic'\n\n        # If archive_cmds runs LD, not CC, wlarc should be empty\n        # XXX I think wlarc can be eliminated in ltcf-cxx, but I need to\n        #     investigate it a little bit more. (MM)\n        wlarc='${wl}'\n\n        # ancient GNU ld didn't support --whole-archive et. al.\n        if eval \"`$CC -print-prog-name=ld` --help 2>&1\" |\n\t  $GREP 'no-whole-archive' > /dev/null; then\n          _LT_TAGVAR(whole_archive_flag_spec, $1)=\"$wlarc\"'--whole-archive$convenience '\"$wlarc\"'--no-whole-archive'\n        else\n          _LT_TAGVAR(whole_archive_flag_spec, $1)=\n        fi\n      else\n        with_gnu_ld=no\n        wlarc=\n\n        # A generic and very simple default shared library creation\n        # command for GNU C++ for the case where it uses the native\n        # linker, instead of GNU ld.  If possible, this setting should\n        # overridden to take advantage of the native linker features on\n        # the platform it is being used on.\n        _LT_TAGVAR(archive_cmds, $1)='$CC -shared -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -o $lib'\n      fi\n\n      # Commands to make compiler produce verbose output that lists\n      # what \"hidden\" libraries, object files and flags are used when\n      # linking a shared library.\n      output_verbose_link_cmd='$CC -shared $CFLAGS -v conftest.$objext 2>&1 | $GREP -v \"^Configured with:\" | $GREP \"\\-L\"'\n\n    else\n      GXX=no\n      with_gnu_ld=no\n      wlarc=\n    fi\n\n    # PORTME: fill in a description of your system's C++ link characteristics\n    AC_MSG_CHECKING([whether the $compiler linker ($LD) supports shared libraries])\n    _LT_TAGVAR(ld_shlibs, $1)=yes\n    case $host_os in\n      aix3*)\n        # FIXME: insert proper C++ library support\n        _LT_TAGVAR(ld_shlibs, $1)=no\n        ;;\n      aix[[4-9]]*)\n        if test \"$host_cpu\" = ia64; then\n          # On IA64, the linker does run time linking by default, so we don't\n          # have to do anything special.\n          aix_use_runtimelinking=no\n          exp_sym_flag='-Bexport'\n          no_entry_flag=\"\"\n        else\n          aix_use_runtimelinking=no\n\n          # Test if we are trying to use run time linking or normal\n          # AIX style linking. If -brtl is somewhere in LDFLAGS, we\n          # need to do runtime linking.\n          case $host_os in aix4.[[23]]|aix4.[[23]].*|aix[[5-9]]*)\n\t    for ld_flag in $LDFLAGS; do\n\t      case $ld_flag in\n\t      *-brtl*)\n\t        aix_use_runtimelinking=yes\n\t        break\n\t        ;;\n\t      esac\n\t    done\n\t    ;;\n          esac\n\n          exp_sym_flag='-bexport'\n          no_entry_flag='-bnoentry'\n        fi\n\n        # When large executables or shared objects are built, AIX ld can\n        # have problems creating the table of contents.  If linking a library\n        # or program results in \"error TOC overflow\" add -mminimal-toc to\n        # CXXFLAGS/CFLAGS for g++/gcc.  In the cases where that is not\n        # enough to fix the problem, add -Wl,-bbigtoc to LDFLAGS.\n\n        _LT_TAGVAR(archive_cmds, $1)=''\n        _LT_TAGVAR(hardcode_direct, $1)=yes\n        _LT_TAGVAR(hardcode_direct_absolute, $1)=yes\n        _LT_TAGVAR(hardcode_libdir_separator, $1)=':'\n        _LT_TAGVAR(link_all_deplibs, $1)=yes\n        _LT_TAGVAR(file_list_spec, $1)='${wl}-f,'\n\n        if test \"$GXX\" = yes; then\n          case $host_os in aix4.[[012]]|aix4.[[012]].*)\n          # We only want to do this on AIX 4.2 and lower, the check\n          # below for broken collect2 doesn't work under 4.3+\n\t  collect2name=`${CC} -print-prog-name=collect2`\n\t  if test -f \"$collect2name\" &&\n\t     strings \"$collect2name\" | $GREP resolve_lib_name >/dev/null\n\t  then\n\t    # We have reworked collect2\n\t    :\n\t  else\n\t    # We have old collect2\n\t    _LT_TAGVAR(hardcode_direct, $1)=unsupported\n\t    # It fails to find uninstalled libraries when the uninstalled\n\t    # path is not listed in the libpath.  Setting hardcode_minus_L\n\t    # to unsupported forces relinking\n\t    _LT_TAGVAR(hardcode_minus_L, $1)=yes\n\t    _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir'\n\t    _LT_TAGVAR(hardcode_libdir_separator, $1)=\n\t  fi\n          esac\n          shared_flag='-shared'\n\t  if test \"$aix_use_runtimelinking\" = yes; then\n\t    shared_flag=\"$shared_flag \"'${wl}-G'\n\t  fi\n        else\n          # not using gcc\n          if test \"$host_cpu\" = ia64; then\n\t  # VisualAge C++, Version 5.5 for AIX 5L for IA-64, Beta 3 Release\n\t  # chokes on -Wl,-G. The following line is correct:\n\t  shared_flag='-G'\n          else\n\t    if test \"$aix_use_runtimelinking\" = yes; then\n\t      shared_flag='${wl}-G'\n\t    else\n\t      shared_flag='${wl}-bM:SRE'\n\t    fi\n          fi\n        fi\n\n        _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}-bexpall'\n        # It seems that -bexpall does not export symbols beginning with\n        # underscore (_), so it is better to generate a list of symbols to\n\t# export.\n        _LT_TAGVAR(always_export_symbols, $1)=yes\n        if test \"$aix_use_runtimelinking\" = yes; then\n          # Warning - without using the other runtime loading flags (-brtl),\n          # -berok will link without error, but may produce a broken library.\n          _LT_TAGVAR(allow_undefined_flag, $1)='-berok'\n          # Determine the default libpath from the value encoded in an empty\n          # executable.\n          _LT_SYS_MODULE_PATH_AIX([$1])\n          _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-blibpath:$libdir:'\"$aix_libpath\"\n\n          _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -o $output_objdir/$soname $libobjs $deplibs '\"\\${wl}$no_entry_flag\"' $compiler_flags `if test \"x${allow_undefined_flag}\" != \"x\"; then func_echo_all \"${wl}${allow_undefined_flag}\"; else :; fi` '\"\\${wl}$exp_sym_flag:\\$export_symbols $shared_flag\"\n        else\n          if test \"$host_cpu\" = ia64; then\n\t    _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-R $libdir:/usr/lib:/lib'\n\t    _LT_TAGVAR(allow_undefined_flag, $1)=\"-z nodefs\"\n\t    _LT_TAGVAR(archive_expsym_cmds, $1)=\"\\$CC $shared_flag\"' -o $output_objdir/$soname $libobjs $deplibs '\"\\${wl}$no_entry_flag\"' $compiler_flags ${wl}${allow_undefined_flag} '\"\\${wl}$exp_sym_flag:\\$export_symbols\"\n          else\n\t    # Determine the default libpath from the value encoded in an\n\t    # empty executable.\n\t    _LT_SYS_MODULE_PATH_AIX([$1])\n\t    _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-blibpath:$libdir:'\"$aix_libpath\"\n\t    # Warning - without using the other run time loading flags,\n\t    # -berok will link without error, but may produce a broken library.\n\t    _LT_TAGVAR(no_undefined_flag, $1)=' ${wl}-bernotok'\n\t    _LT_TAGVAR(allow_undefined_flag, $1)=' ${wl}-berok'\n\t    if test \"$with_gnu_ld\" = yes; then\n\t      # We only use this code for GNU lds that support --whole-archive.\n\t      _LT_TAGVAR(whole_archive_flag_spec, $1)='${wl}--whole-archive$convenience ${wl}--no-whole-archive'\n\t    else\n\t      # Exported symbols can be pulled into shared objects from archives\n\t      _LT_TAGVAR(whole_archive_flag_spec, $1)='$convenience'\n\t    fi\n\t    _LT_TAGVAR(archive_cmds_need_lc, $1)=yes\n\t    # This is similar to how AIX traditionally builds its shared\n\t    # libraries.\n\t    _LT_TAGVAR(archive_expsym_cmds, $1)=\"\\$CC $shared_flag\"' -o $output_objdir/$soname $libobjs $deplibs ${wl}-bnoentry $compiler_flags ${wl}-bE:$export_symbols${allow_undefined_flag}~$AR $AR_FLAGS $output_objdir/$libname$release.a $output_objdir/$soname'\n          fi\n        fi\n        ;;\n\n      beos*)\n\tif $LD --help 2>&1 | $GREP ': supported targets:.* elf' > /dev/null; then\n\t  _LT_TAGVAR(allow_undefined_flag, $1)=unsupported\n\t  # Joseph Beckenbach <jrb3@best.com> says some releases of gcc\n\t  # support --undefined.  This deserves some investigation.  FIXME\n\t  _LT_TAGVAR(archive_cmds, $1)='$CC -nostart $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib'\n\telse\n\t  _LT_TAGVAR(ld_shlibs, $1)=no\n\tfi\n\t;;\n\n      chorus*)\n        case $cc_basename in\n          *)\n\t  # FIXME: insert proper C++ library support\n\t  _LT_TAGVAR(ld_shlibs, $1)=no\n\t  ;;\n        esac\n        ;;\n\n      cygwin* | mingw* | pw32* | cegcc*)\n\tcase $GXX,$cc_basename in\n\t,cl* | no,cl*)\n\t  # Native MSVC\n\t  # hardcode_libdir_flag_spec is actually meaningless, as there is\n\t  # no search path for DLLs.\n\t  _LT_TAGVAR(hardcode_libdir_flag_spec, $1)=' '\n\t  _LT_TAGVAR(allow_undefined_flag, $1)=unsupported\n\t  _LT_TAGVAR(always_export_symbols, $1)=yes\n\t  _LT_TAGVAR(file_list_spec, $1)='@'\n\t  # Tell ltmain to make .lib files, not .a files.\n\t  libext=lib\n\t  # Tell ltmain to make .dll files, not .so files.\n\t  shrext_cmds=\".dll\"\n\t  # FIXME: Setting linknames here is a bad hack.\n\t  _LT_TAGVAR(archive_cmds, $1)='$CC -o $output_objdir/$soname $libobjs $compiler_flags $deplibs -Wl,-dll~linknames='\n\t  _LT_TAGVAR(archive_expsym_cmds, $1)='if test \"x`$SED 1q $export_symbols`\" = xEXPORTS; then\n\t      $SED -n -e 's/\\\\\\\\\\\\\\(.*\\\\\\\\\\\\\\)/-link\\\\\\ -EXPORT:\\\\\\\\\\\\\\1/' -e '1\\\\\\!p' < $export_symbols > $output_objdir/$soname.exp;\n\t    else\n\t      $SED -e 's/\\\\\\\\\\\\\\(.*\\\\\\\\\\\\\\)/-link\\\\\\ -EXPORT:\\\\\\\\\\\\\\1/' < $export_symbols > $output_objdir/$soname.exp;\n\t    fi~\n\t    $CC -o $tool_output_objdir$soname $libobjs $compiler_flags $deplibs \"@$tool_output_objdir$soname.exp\" -Wl,-DLL,-IMPLIB:\"$tool_output_objdir$libname.dll.lib\"~\n\t    linknames='\n\t  # The linker will not automatically build a static lib if we build a DLL.\n\t  # _LT_TAGVAR(old_archive_from_new_cmds, $1)='true'\n\t  _LT_TAGVAR(enable_shared_with_static_runtimes, $1)=yes\n\t  # Don't use ranlib\n\t  _LT_TAGVAR(old_postinstall_cmds, $1)='chmod 644 $oldlib'\n\t  _LT_TAGVAR(postlink_cmds, $1)='lt_outputfile=\"@OUTPUT@\"~\n\t    lt_tool_outputfile=\"@TOOL_OUTPUT@\"~\n\t    case $lt_outputfile in\n\t      *.exe|*.EXE) ;;\n\t      *)\n\t\tlt_outputfile=\"$lt_outputfile.exe\"\n\t\tlt_tool_outputfile=\"$lt_tool_outputfile.exe\"\n\t\t;;\n\t    esac~\n\t    func_to_tool_file \"$lt_outputfile\"~\n\t    if test \"$MANIFEST_TOOL\" != \":\" && test -f \"$lt_outputfile.manifest\"; then\n\t      $MANIFEST_TOOL -manifest \"$lt_tool_outputfile.manifest\" -outputresource:\"$lt_tool_outputfile\" || exit 1;\n\t      $RM \"$lt_outputfile.manifest\";\n\t    fi'\n\t  ;;\n\t*)\n\t  # g++\n\t  # _LT_TAGVAR(hardcode_libdir_flag_spec, $1) is actually meaningless,\n\t  # as there is no search path for DLLs.\n\t  _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir'\n\t  _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}--export-all-symbols'\n\t  _LT_TAGVAR(allow_undefined_flag, $1)=unsupported\n\t  _LT_TAGVAR(always_export_symbols, $1)=no\n\t  _LT_TAGVAR(enable_shared_with_static_runtimes, $1)=yes\n\n\t  if $LD --help 2>&1 | $GREP 'auto-import' > /dev/null; then\n\t    _LT_TAGVAR(archive_cmds, $1)='$CC -shared -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -o $output_objdir/$soname ${wl}--enable-auto-image-base -Xlinker --out-implib -Xlinker $lib'\n\t    # If the export-symbols file already is a .def file (1st line\n\t    # is EXPORTS), use it as is; otherwise, prepend...\n\t    _LT_TAGVAR(archive_expsym_cmds, $1)='if test \"x`$SED 1q $export_symbols`\" = xEXPORTS; then\n\t      cp $export_symbols $output_objdir/$soname.def;\n\t    else\n\t      echo EXPORTS > $output_objdir/$soname.def;\n\t      cat $export_symbols >> $output_objdir/$soname.def;\n\t    fi~\n\t    $CC -shared -nostdlib $output_objdir/$soname.def $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -o $output_objdir/$soname ${wl}--enable-auto-image-base -Xlinker --out-implib -Xlinker $lib'\n\t  else\n\t    _LT_TAGVAR(ld_shlibs, $1)=no\n\t  fi\n\t  ;;\n\tesac\n\t;;\n      darwin* | rhapsody*)\n        _LT_DARWIN_LINKER_FEATURES($1)\n\t;;\n\n      dgux*)\n        case $cc_basename in\n          ec++*)\n\t    # FIXME: insert proper C++ library support\n\t    _LT_TAGVAR(ld_shlibs, $1)=no\n\t    ;;\n          ghcx*)\n\t    # Green Hills C++ Compiler\n\t    # FIXME: insert proper C++ library support\n\t    _LT_TAGVAR(ld_shlibs, $1)=no\n\t    ;;\n          *)\n\t    # FIXME: insert proper C++ library support\n\t    _LT_TAGVAR(ld_shlibs, $1)=no\n\t    ;;\n        esac\n        ;;\n\n      freebsd2.*)\n        # C++ shared libraries reported to be fairly broken before\n\t# switch to ELF\n        _LT_TAGVAR(ld_shlibs, $1)=no\n        ;;\n\n      freebsd-elf*)\n        _LT_TAGVAR(archive_cmds_need_lc, $1)=no\n        ;;\n\n      freebsd* | dragonfly*)\n        # FreeBSD 3 and later use GNU C++ and GNU ld with standard ELF\n        # conventions\n        _LT_TAGVAR(ld_shlibs, $1)=yes\n        ;;\n\n      haiku*)\n        _LT_TAGVAR(archive_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib'\n        _LT_TAGVAR(link_all_deplibs, $1)=yes\n        ;;\n\n      hpux9*)\n        _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}+b ${wl}$libdir'\n        _LT_TAGVAR(hardcode_libdir_separator, $1)=:\n        _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}-E'\n        _LT_TAGVAR(hardcode_direct, $1)=yes\n        _LT_TAGVAR(hardcode_minus_L, $1)=yes # Not in the search PATH,\n\t\t\t\t             # but as the default\n\t\t\t\t             # location of the library.\n\n        case $cc_basename in\n          CC*)\n            # FIXME: insert proper C++ library support\n            _LT_TAGVAR(ld_shlibs, $1)=no\n            ;;\n          aCC*)\n            _LT_TAGVAR(archive_cmds, $1)='$RM $output_objdir/$soname~$CC -b ${wl}+b ${wl}$install_libdir -o $output_objdir/$soname $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags~test $output_objdir/$soname = $lib || mv $output_objdir/$soname $lib'\n            # Commands to make compiler produce verbose output that lists\n            # what \"hidden\" libraries, object files and flags are used when\n            # linking a shared library.\n            #\n            # There doesn't appear to be a way to prevent this compiler from\n            # explicitly linking system object files so we need to strip them\n            # from the output so that they don't get included in the library\n            # dependencies.\n            output_verbose_link_cmd='templist=`($CC -b $CFLAGS -v conftest.$objext 2>&1) | $EGREP \"\\-L\"`; list=\"\"; for z in $templist; do case $z in conftest.$objext) list=\"$list $z\";; *.$objext);; *) list=\"$list $z\";;esac; done; func_echo_all \"$list\"'\n            ;;\n          *)\n            if test \"$GXX\" = yes; then\n              _LT_TAGVAR(archive_cmds, $1)='$RM $output_objdir/$soname~$CC -shared -nostdlib $pic_flag ${wl}+b ${wl}$install_libdir -o $output_objdir/$soname $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags~test $output_objdir/$soname = $lib || mv $output_objdir/$soname $lib'\n            else\n              # FIXME: insert proper C++ library support\n              _LT_TAGVAR(ld_shlibs, $1)=no\n            fi\n            ;;\n        esac\n        ;;\n\n      hpux10*|hpux11*)\n        if test $with_gnu_ld = no; then\n\t  _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}+b ${wl}$libdir'\n\t  _LT_TAGVAR(hardcode_libdir_separator, $1)=:\n\n          case $host_cpu in\n            hppa*64*|ia64*)\n              ;;\n            *)\n\t      _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}-E'\n              ;;\n          esac\n        fi\n        case $host_cpu in\n          hppa*64*|ia64*)\n            _LT_TAGVAR(hardcode_direct, $1)=no\n            _LT_TAGVAR(hardcode_shlibpath_var, $1)=no\n            ;;\n          *)\n            _LT_TAGVAR(hardcode_direct, $1)=yes\n            _LT_TAGVAR(hardcode_direct_absolute, $1)=yes\n            _LT_TAGVAR(hardcode_minus_L, $1)=yes # Not in the search PATH,\n\t\t\t\t\t         # but as the default\n\t\t\t\t\t         # location of the library.\n            ;;\n        esac\n\n        case $cc_basename in\n          CC*)\n\t    # FIXME: insert proper C++ library support\n\t    _LT_TAGVAR(ld_shlibs, $1)=no\n\t    ;;\n          aCC*)\n\t    case $host_cpu in\n\t      hppa*64*)\n\t        _LT_TAGVAR(archive_cmds, $1)='$CC -b ${wl}+h ${wl}$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags'\n\t        ;;\n\t      ia64*)\n\t        _LT_TAGVAR(archive_cmds, $1)='$CC -b ${wl}+h ${wl}$soname ${wl}+nodefaultrpath -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags'\n\t        ;;\n\t      *)\n\t        _LT_TAGVAR(archive_cmds, $1)='$CC -b ${wl}+h ${wl}$soname ${wl}+b ${wl}$install_libdir -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags'\n\t        ;;\n\t    esac\n\t    # Commands to make compiler produce verbose output that lists\n\t    # what \"hidden\" libraries, object files and flags are used when\n\t    # linking a shared library.\n\t    #\n\t    # There doesn't appear to be a way to prevent this compiler from\n\t    # explicitly linking system object files so we need to strip them\n\t    # from the output so that they don't get included in the library\n\t    # dependencies.\n\t    output_verbose_link_cmd='templist=`($CC -b $CFLAGS -v conftest.$objext 2>&1) | $GREP \"\\-L\"`; list=\"\"; for z in $templist; do case $z in conftest.$objext) list=\"$list $z\";; *.$objext);; *) list=\"$list $z\";;esac; done; func_echo_all \"$list\"'\n\t    ;;\n          *)\n\t    if test \"$GXX\" = yes; then\n\t      if test $with_gnu_ld = no; then\n\t        case $host_cpu in\n\t          hppa*64*)\n\t            _LT_TAGVAR(archive_cmds, $1)='$CC -shared -nostdlib -fPIC ${wl}+h ${wl}$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags'\n\t            ;;\n\t          ia64*)\n\t            _LT_TAGVAR(archive_cmds, $1)='$CC -shared -nostdlib $pic_flag ${wl}+h ${wl}$soname ${wl}+nodefaultrpath -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags'\n\t            ;;\n\t          *)\n\t            _LT_TAGVAR(archive_cmds, $1)='$CC -shared -nostdlib $pic_flag ${wl}+h ${wl}$soname ${wl}+b ${wl}$install_libdir -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags'\n\t            ;;\n\t        esac\n\t      fi\n\t    else\n\t      # FIXME: insert proper C++ library support\n\t      _LT_TAGVAR(ld_shlibs, $1)=no\n\t    fi\n\t    ;;\n        esac\n        ;;\n\n      interix[[3-9]]*)\n\t_LT_TAGVAR(hardcode_direct, $1)=no\n\t_LT_TAGVAR(hardcode_shlibpath_var, $1)=no\n\t_LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath,$libdir'\n\t_LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}-E'\n\t# Hack: On Interix 3.x, we cannot compile PIC because of a broken gcc.\n\t# Instead, shared libraries are loaded at an image base (0x10000000 by\n\t# default) and relocated if they conflict, which is a slow very memory\n\t# consuming and fragmenting process.  To avoid this, we pick a random,\n\t# 256 KiB-aligned image base between 0x50000000 and 0x6FFC0000 at link\n\t# time.  Moving up from 0x10000000 also allows more sbrk(2) space.\n\t_LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-h,$soname ${wl}--image-base,`expr ${RANDOM-$$} % 4096 / 2 \\* 262144 + 1342177280` -o $lib'\n\t_LT_TAGVAR(archive_expsym_cmds, $1)='sed \"s,^,_,\" $export_symbols >$output_objdir/$soname.expsym~$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-h,$soname ${wl}--retain-symbols-file,$output_objdir/$soname.expsym ${wl}--image-base,`expr ${RANDOM-$$} % 4096 / 2 \\* 262144 + 1342177280` -o $lib'\n\t;;\n      irix5* | irix6*)\n        case $cc_basename in\n          CC*)\n\t    # SGI C++\n\t    _LT_TAGVAR(archive_cmds, $1)='$CC -shared -all -multigot $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -soname $soname `test -n \"$verstring\" && func_echo_all \"-set_version $verstring\"` -update_registry ${output_objdir}/so_locations -o $lib'\n\n\t    # Archives containing C++ object files must be created using\n\t    # \"CC -ar\", where \"CC\" is the IRIX C++ compiler.  This is\n\t    # necessary to make sure instantiated templates are included\n\t    # in the archive.\n\t    _LT_TAGVAR(old_archive_cmds, $1)='$CC -ar -WR,-u -o $oldlib $oldobjs'\n\t    ;;\n          *)\n\t    if test \"$GXX\" = yes; then\n\t      if test \"$with_gnu_ld\" = no; then\n\t        _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname ${wl}$soname `test -n \"$verstring\" && func_echo_all \"${wl}-set_version ${wl}$verstring\"` ${wl}-update_registry ${wl}${output_objdir}/so_locations -o $lib'\n\t      else\n\t        _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname ${wl}$soname `test -n \"$verstring\" && func_echo_all \"${wl}-set_version ${wl}$verstring\"` -o $lib'\n\t      fi\n\t    fi\n\t    _LT_TAGVAR(link_all_deplibs, $1)=yes\n\t    ;;\n        esac\n        _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath ${wl}$libdir'\n        _LT_TAGVAR(hardcode_libdir_separator, $1)=:\n        _LT_TAGVAR(inherit_rpath, $1)=yes\n        ;;\n\n      linux* | k*bsd*-gnu | kopensolaris*-gnu | gnu*)\n        case $cc_basename in\n          KCC*)\n\t    # Kuck and Associates, Inc. (KAI) C++ Compiler\n\n\t    # KCC will only create a shared library if the output file\n\t    # ends with \".so\" (or \".sl\" for HP-UX), so rename the library\n\t    # to its proper name (with version) after linking.\n\t    _LT_TAGVAR(archive_cmds, $1)='tempext=`echo $shared_ext | $SED -e '\\''s/\\([[^()0-9A-Za-z{}]]\\)/\\\\\\\\\\1/g'\\''`; templib=`echo $lib | $SED -e \"s/\\${tempext}\\..*/.so/\"`; $CC $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags --soname $soname -o \\$templib; mv \\$templib $lib'\n\t    _LT_TAGVAR(archive_expsym_cmds, $1)='tempext=`echo $shared_ext | $SED -e '\\''s/\\([[^()0-9A-Za-z{}]]\\)/\\\\\\\\\\1/g'\\''`; templib=`echo $lib | $SED -e \"s/\\${tempext}\\..*/.so/\"`; $CC $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags --soname $soname -o \\$templib ${wl}-retain-symbols-file,$export_symbols; mv \\$templib $lib'\n\t    # Commands to make compiler produce verbose output that lists\n\t    # what \"hidden\" libraries, object files and flags are used when\n\t    # linking a shared library.\n\t    #\n\t    # There doesn't appear to be a way to prevent this compiler from\n\t    # explicitly linking system object files so we need to strip them\n\t    # from the output so that they don't get included in the library\n\t    # dependencies.\n\t    output_verbose_link_cmd='templist=`$CC $CFLAGS -v conftest.$objext -o libconftest$shared_ext 2>&1 | $GREP \"ld\"`; rm -f libconftest$shared_ext; list=\"\"; for z in $templist; do case $z in conftest.$objext) list=\"$list $z\";; *.$objext);; *) list=\"$list $z\";;esac; done; func_echo_all \"$list\"'\n\n\t    _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath,$libdir'\n\t    _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}--export-dynamic'\n\n\t    # Archives containing C++ object files must be created using\n\t    # \"CC -Bstatic\", where \"CC\" is the KAI C++ compiler.\n\t    _LT_TAGVAR(old_archive_cmds, $1)='$CC -Bstatic -o $oldlib $oldobjs'\n\t    ;;\n\t  icpc* | ecpc* )\n\t    # Intel C++\n\t    with_gnu_ld=yes\n\t    # version 8.0 and above of icpc choke on multiply defined symbols\n\t    # if we add $predep_objects and $postdep_objects, however 7.1 and\n\t    # earlier do not add the objects themselves.\n\t    case `$CC -V 2>&1` in\n\t      *\"Version 7.\"*)\n\t        _LT_TAGVAR(archive_cmds, $1)='$CC -shared $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $wl$soname -o $lib'\n\t\t_LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib'\n\t\t;;\n\t      *)  # Version 8.0 or newer\n\t        tmp_idyn=\n\t        case $host_cpu in\n\t\t  ia64*) tmp_idyn=' -i_dynamic';;\n\t\tesac\n\t        _LT_TAGVAR(archive_cmds, $1)='$CC -shared'\"$tmp_idyn\"' $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib'\n\t\t_LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared'\"$tmp_idyn\"' $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib'\n\t\t;;\n\t    esac\n\t    _LT_TAGVAR(archive_cmds_need_lc, $1)=no\n\t    _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath,$libdir'\n\t    _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}--export-dynamic'\n\t    _LT_TAGVAR(whole_archive_flag_spec, $1)='${wl}--whole-archive$convenience ${wl}--no-whole-archive'\n\t    ;;\n          pgCC* | pgcpp*)\n            # Portland Group C++ compiler\n\t    case `$CC -V` in\n\t    *pgCC\\ [[1-5]].* | *pgcpp\\ [[1-5]].*)\n\t      _LT_TAGVAR(prelink_cmds, $1)='tpldir=Template.dir~\n\t\trm -rf $tpldir~\n\t\t$CC --prelink_objects --instantiation_dir $tpldir $objs $libobjs $compile_deplibs~\n\t\tcompile_command=\"$compile_command `find $tpldir -name \\*.o | sort | $NL2SP`\"'\n\t      _LT_TAGVAR(old_archive_cmds, $1)='tpldir=Template.dir~\n\t\trm -rf $tpldir~\n\t\t$CC --prelink_objects --instantiation_dir $tpldir $oldobjs$old_deplibs~\n\t\t$AR $AR_FLAGS $oldlib$oldobjs$old_deplibs `find $tpldir -name \\*.o | sort | $NL2SP`~\n\t\t$RANLIB $oldlib'\n\t      _LT_TAGVAR(archive_cmds, $1)='tpldir=Template.dir~\n\t\trm -rf $tpldir~\n\t\t$CC --prelink_objects --instantiation_dir $tpldir $predep_objects $libobjs $deplibs $convenience $postdep_objects~\n\t\t$CC -shared $pic_flag $predep_objects $libobjs $deplibs `find $tpldir -name \\*.o | sort | $NL2SP` $postdep_objects $compiler_flags ${wl}-soname ${wl}$soname -o $lib'\n\t      _LT_TAGVAR(archive_expsym_cmds, $1)='tpldir=Template.dir~\n\t\trm -rf $tpldir~\n\t\t$CC --prelink_objects --instantiation_dir $tpldir $predep_objects $libobjs $deplibs $convenience $postdep_objects~\n\t\t$CC -shared $pic_flag $predep_objects $libobjs $deplibs `find $tpldir -name \\*.o | sort | $NL2SP` $postdep_objects $compiler_flags ${wl}-soname ${wl}$soname ${wl}-retain-symbols-file ${wl}$export_symbols -o $lib'\n\t      ;;\n\t    *) # Version 6 and above use weak symbols\n\t      _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname ${wl}$soname -o $lib'\n\t      _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $pic_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname ${wl}$soname ${wl}-retain-symbols-file ${wl}$export_symbols -o $lib'\n\t      ;;\n\t    esac\n\n\t    _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}--rpath ${wl}$libdir'\n\t    _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}--export-dynamic'\n\t    _LT_TAGVAR(whole_archive_flag_spec, $1)='${wl}--whole-archive`for conv in $convenience\\\"\\\"; do test  -n \\\"$conv\\\" && new_convenience=\\\"$new_convenience,$conv\\\"; done; func_echo_all \\\"$new_convenience\\\"` ${wl}--no-whole-archive'\n            ;;\n\t  cxx*)\n\t    # Compaq C++\n\t    _LT_TAGVAR(archive_cmds, $1)='$CC -shared $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $wl$soname -o $lib'\n\t    _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $wl$soname  -o $lib ${wl}-retain-symbols-file $wl$export_symbols'\n\n\t    runpath_var=LD_RUN_PATH\n\t    _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-rpath $libdir'\n\t    _LT_TAGVAR(hardcode_libdir_separator, $1)=:\n\n\t    # Commands to make compiler produce verbose output that lists\n\t    # what \"hidden\" libraries, object files and flags are used when\n\t    # linking a shared library.\n\t    #\n\t    # There doesn't appear to be a way to prevent this compiler from\n\t    # explicitly linking system object files so we need to strip them\n\t    # from the output so that they don't get included in the library\n\t    # dependencies.\n\t    output_verbose_link_cmd='templist=`$CC -shared $CFLAGS -v conftest.$objext 2>&1 | $GREP \"ld\"`; templist=`func_echo_all \"$templist\" | $SED \"s/\\(^.*ld.*\\)\\( .*ld .*$\\)/\\1/\"`; list=\"\"; for z in $templist; do case $z in conftest.$objext) list=\"$list $z\";; *.$objext);; *) list=\"$list $z\";;esac; done; func_echo_all \"X$list\" | $Xsed'\n\t    ;;\n\t  xl* | mpixl* | bgxl*)\n\t    # IBM XL 8.0 on PPC, with GNU ld\n\t    _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath ${wl}$libdir'\n\t    _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}--export-dynamic'\n\t    _LT_TAGVAR(archive_cmds, $1)='$CC -qmkshrobj $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib'\n\t    if test \"x$supports_anon_versioning\" = xyes; then\n\t      _LT_TAGVAR(archive_expsym_cmds, $1)='echo \"{ global:\" > $output_objdir/$libname.ver~\n\t\tcat $export_symbols | sed -e \"s/\\(.*\\)/\\1;/\" >> $output_objdir/$libname.ver~\n\t\techo \"local: *; };\" >> $output_objdir/$libname.ver~\n\t\t$CC -qmkshrobj $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-version-script ${wl}$output_objdir/$libname.ver -o $lib'\n\t    fi\n\t    ;;\n\t  *)\n\t    case `$CC -V 2>&1 | sed 5q` in\n\t    *Sun\\ C*)\n\t      # Sun C++ 5.9\n\t      _LT_TAGVAR(no_undefined_flag, $1)=' -zdefs'\n\t      _LT_TAGVAR(archive_cmds, $1)='$CC -G${allow_undefined_flag} -h$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags'\n\t      _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -G${allow_undefined_flag} -h$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-retain-symbols-file ${wl}$export_symbols'\n\t      _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-R$libdir'\n\t      _LT_TAGVAR(whole_archive_flag_spec, $1)='${wl}--whole-archive`new_convenience=; for conv in $convenience\\\"\\\"; do test -z \\\"$conv\\\" || new_convenience=\\\"$new_convenience,$conv\\\"; done; func_echo_all \\\"$new_convenience\\\"` ${wl}--no-whole-archive'\n\t      _LT_TAGVAR(compiler_needs_object, $1)=yes\n\n\t      # Not sure whether something based on\n\t      # $CC $CFLAGS -v conftest.$objext -o libconftest$shared_ext 2>&1\n\t      # would be better.\n\t      output_verbose_link_cmd='func_echo_all'\n\n\t      # Archives containing C++ object files must be created using\n\t      # \"CC -xar\", where \"CC\" is the Sun C++ compiler.  This is\n\t      # necessary to make sure instantiated templates are included\n\t      # in the archive.\n\t      _LT_TAGVAR(old_archive_cmds, $1)='$CC -xar -o $oldlib $oldobjs'\n\t      ;;\n\t    esac\n\t    ;;\n\tesac\n\t;;\n\n      lynxos*)\n        # FIXME: insert proper C++ library support\n\t_LT_TAGVAR(ld_shlibs, $1)=no\n\t;;\n\n      m88k*)\n        # FIXME: insert proper C++ library support\n        _LT_TAGVAR(ld_shlibs, $1)=no\n\t;;\n\n      mvs*)\n        case $cc_basename in\n          cxx*)\n\t    # FIXME: insert proper C++ library support\n\t    _LT_TAGVAR(ld_shlibs, $1)=no\n\t    ;;\n\t  *)\n\t    # FIXME: insert proper C++ library support\n\t    _LT_TAGVAR(ld_shlibs, $1)=no\n\t    ;;\n\tesac\n\t;;\n\n      netbsd*)\n        if echo __ELF__ | $CC -E - | $GREP __ELF__ >/dev/null; then\n\t  _LT_TAGVAR(archive_cmds, $1)='$LD -Bshareable  -o $lib $predep_objects $libobjs $deplibs $postdep_objects $linker_flags'\n\t  wlarc=\n\t  _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-R$libdir'\n\t  _LT_TAGVAR(hardcode_direct, $1)=yes\n\t  _LT_TAGVAR(hardcode_shlibpath_var, $1)=no\n\tfi\n\t# Workaround some broken pre-1.5 toolchains\n\toutput_verbose_link_cmd='$CC -shared $CFLAGS -v conftest.$objext 2>&1 | $GREP conftest.$objext | $SED -e \"s:-lgcc -lc -lgcc::\"'\n\t;;\n\n      *nto* | *qnx*)\n        _LT_TAGVAR(ld_shlibs, $1)=yes\n\t;;\n\n      openbsd2*)\n        # C++ shared libraries are fairly broken\n\t_LT_TAGVAR(ld_shlibs, $1)=no\n\t;;\n\n      openbsd*)\n\tif test -f /usr/libexec/ld.so; then\n\t  _LT_TAGVAR(hardcode_direct, $1)=yes\n\t  _LT_TAGVAR(hardcode_shlibpath_var, $1)=no\n\t  _LT_TAGVAR(hardcode_direct_absolute, $1)=yes\n\t  _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -o $lib'\n\t  _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath,$libdir'\n\t  if test -z \"`echo __ELF__ | $CC -E - | grep __ELF__`\" || test \"$host_os-$host_cpu\" = \"openbsd2.8-powerpc\"; then\n\t    _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $pic_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-retain-symbols-file,$export_symbols -o $lib'\n\t    _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}-E'\n\t    _LT_TAGVAR(whole_archive_flag_spec, $1)=\"$wlarc\"'--whole-archive$convenience '\"$wlarc\"'--no-whole-archive'\n\t  fi\n\t  output_verbose_link_cmd=func_echo_all\n\telse\n\t  _LT_TAGVAR(ld_shlibs, $1)=no\n\tfi\n\t;;\n\n      osf3* | osf4* | osf5*)\n        case $cc_basename in\n          KCC*)\n\t    # Kuck and Associates, Inc. (KAI) C++ Compiler\n\n\t    # KCC will only create a shared library if the output file\n\t    # ends with \".so\" (or \".sl\" for HP-UX), so rename the library\n\t    # to its proper name (with version) after linking.\n\t    _LT_TAGVAR(archive_cmds, $1)='tempext=`echo $shared_ext | $SED -e '\\''s/\\([[^()0-9A-Za-z{}]]\\)/\\\\\\\\\\1/g'\\''`; templib=`echo \"$lib\" | $SED -e \"s/\\${tempext}\\..*/.so/\"`; $CC $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags --soname $soname -o \\$templib; mv \\$templib $lib'\n\n\t    _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath,$libdir'\n\t    _LT_TAGVAR(hardcode_libdir_separator, $1)=:\n\n\t    # Archives containing C++ object files must be created using\n\t    # the KAI C++ compiler.\n\t    case $host in\n\t      osf3*) _LT_TAGVAR(old_archive_cmds, $1)='$CC -Bstatic -o $oldlib $oldobjs' ;;\n\t      *) _LT_TAGVAR(old_archive_cmds, $1)='$CC -o $oldlib $oldobjs' ;;\n\t    esac\n\t    ;;\n          RCC*)\n\t    # Rational C++ 2.4.1\n\t    # FIXME: insert proper C++ library support\n\t    _LT_TAGVAR(ld_shlibs, $1)=no\n\t    ;;\n          cxx*)\n\t    case $host in\n\t      osf3*)\n\t        _LT_TAGVAR(allow_undefined_flag, $1)=' ${wl}-expect_unresolved ${wl}\\*'\n\t        _LT_TAGVAR(archive_cmds, $1)='$CC -shared${allow_undefined_flag} $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $soname `test -n \"$verstring\" && func_echo_all \"${wl}-set_version $verstring\"` -update_registry ${output_objdir}/so_locations -o $lib'\n\t        _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath ${wl}$libdir'\n\t\t;;\n\t      *)\n\t        _LT_TAGVAR(allow_undefined_flag, $1)=' -expect_unresolved \\*'\n\t        _LT_TAGVAR(archive_cmds, $1)='$CC -shared${allow_undefined_flag} $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -msym -soname $soname `test -n \"$verstring\" && func_echo_all \"-set_version $verstring\"` -update_registry ${output_objdir}/so_locations -o $lib'\n\t        _LT_TAGVAR(archive_expsym_cmds, $1)='for i in `cat $export_symbols`; do printf \"%s %s\\\\n\" -exported_symbol \"\\$i\" >> $lib.exp; done~\n\t          echo \"-hidden\">> $lib.exp~\n\t          $CC -shared$allow_undefined_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -msym -soname $soname ${wl}-input ${wl}$lib.exp  `test -n \"$verstring\" && $ECHO \"-set_version $verstring\"` -update_registry ${output_objdir}/so_locations -o $lib~\n\t          $RM $lib.exp'\n\t        _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-rpath $libdir'\n\t\t;;\n\t    esac\n\n\t    _LT_TAGVAR(hardcode_libdir_separator, $1)=:\n\n\t    # Commands to make compiler produce verbose output that lists\n\t    # what \"hidden\" libraries, object files and flags are used when\n\t    # linking a shared library.\n\t    #\n\t    # There doesn't appear to be a way to prevent this compiler from\n\t    # explicitly linking system object files so we need to strip them\n\t    # from the output so that they don't get included in the library\n\t    # dependencies.\n\t    output_verbose_link_cmd='templist=`$CC -shared $CFLAGS -v conftest.$objext 2>&1 | $GREP \"ld\" | $GREP -v \"ld:\"`; templist=`func_echo_all \"$templist\" | $SED \"s/\\(^.*ld.*\\)\\( .*ld.*$\\)/\\1/\"`; list=\"\"; for z in $templist; do case $z in conftest.$objext) list=\"$list $z\";; *.$objext);; *) list=\"$list $z\";;esac; done; func_echo_all \"$list\"'\n\t    ;;\n\t  *)\n\t    if test \"$GXX\" = yes && test \"$with_gnu_ld\" = no; then\n\t      _LT_TAGVAR(allow_undefined_flag, $1)=' ${wl}-expect_unresolved ${wl}\\*'\n\t      case $host in\n\t        osf3*)\n\t          _LT_TAGVAR(archive_cmds, $1)='$CC -shared -nostdlib ${allow_undefined_flag} $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname ${wl}$soname `test -n \"$verstring\" && func_echo_all \"${wl}-set_version ${wl}$verstring\"` ${wl}-update_registry ${wl}${output_objdir}/so_locations -o $lib'\n\t\t  ;;\n\t        *)\n\t          _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag -nostdlib ${allow_undefined_flag} $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-msym ${wl}-soname ${wl}$soname `test -n \"$verstring\" && func_echo_all \"${wl}-set_version ${wl}$verstring\"` ${wl}-update_registry ${wl}${output_objdir}/so_locations -o $lib'\n\t\t  ;;\n\t      esac\n\n\t      _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath ${wl}$libdir'\n\t      _LT_TAGVAR(hardcode_libdir_separator, $1)=:\n\n\t      # Commands to make compiler produce verbose output that lists\n\t      # what \"hidden\" libraries, object files and flags are used when\n\t      # linking a shared library.\n\t      output_verbose_link_cmd='$CC -shared $CFLAGS -v conftest.$objext 2>&1 | $GREP -v \"^Configured with:\" | $GREP \"\\-L\"'\n\n\t    else\n\t      # FIXME: insert proper C++ library support\n\t      _LT_TAGVAR(ld_shlibs, $1)=no\n\t    fi\n\t    ;;\n        esac\n        ;;\n\n      psos*)\n        # FIXME: insert proper C++ library support\n        _LT_TAGVAR(ld_shlibs, $1)=no\n        ;;\n\n      sunos4*)\n        case $cc_basename in\n          CC*)\n\t    # Sun C++ 4.x\n\t    # FIXME: insert proper C++ library support\n\t    _LT_TAGVAR(ld_shlibs, $1)=no\n\t    ;;\n          lcc*)\n\t    # Lucid\n\t    # FIXME: insert proper C++ library support\n\t    _LT_TAGVAR(ld_shlibs, $1)=no\n\t    ;;\n          *)\n\t    # FIXME: insert proper C++ library support\n\t    _LT_TAGVAR(ld_shlibs, $1)=no\n\t    ;;\n        esac\n        ;;\n\n      solaris*)\n        case $cc_basename in\n          CC* | sunCC*)\n\t    # Sun C++ 4.2, 5.x and Centerline C++\n            _LT_TAGVAR(archive_cmds_need_lc,$1)=yes\n\t    _LT_TAGVAR(no_undefined_flag, $1)=' -zdefs'\n\t    _LT_TAGVAR(archive_cmds, $1)='$CC -G${allow_undefined_flag}  -h$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags'\n\t    _LT_TAGVAR(archive_expsym_cmds, $1)='echo \"{ global:\" > $lib.exp~cat $export_symbols | $SED -e \"s/\\(.*\\)/\\1;/\" >> $lib.exp~echo \"local: *; };\" >> $lib.exp~\n\t      $CC -G${allow_undefined_flag} ${wl}-M ${wl}$lib.exp -h$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags~$RM $lib.exp'\n\n\t    _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-R$libdir'\n\t    _LT_TAGVAR(hardcode_shlibpath_var, $1)=no\n\t    case $host_os in\n\t      solaris2.[[0-5]] | solaris2.[[0-5]].*) ;;\n\t      *)\n\t\t# The compiler driver will combine and reorder linker options,\n\t\t# but understands `-z linker_flag'.\n\t        # Supported since Solaris 2.6 (maybe 2.5.1?)\n\t\t_LT_TAGVAR(whole_archive_flag_spec, $1)='-z allextract$convenience -z defaultextract'\n\t        ;;\n\t    esac\n\t    _LT_TAGVAR(link_all_deplibs, $1)=yes\n\n\t    output_verbose_link_cmd='func_echo_all'\n\n\t    # Archives containing C++ object files must be created using\n\t    # \"CC -xar\", where \"CC\" is the Sun C++ compiler.  This is\n\t    # necessary to make sure instantiated templates are included\n\t    # in the archive.\n\t    _LT_TAGVAR(old_archive_cmds, $1)='$CC -xar -o $oldlib $oldobjs'\n\t    ;;\n          gcx*)\n\t    # Green Hills C++ Compiler\n\t    _LT_TAGVAR(archive_cmds, $1)='$CC -shared $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-h $wl$soname -o $lib'\n\n\t    # The C++ compiler must be used to create the archive.\n\t    _LT_TAGVAR(old_archive_cmds, $1)='$CC $LDFLAGS -archive -o $oldlib $oldobjs'\n\t    ;;\n          *)\n\t    # GNU C++ compiler with Solaris linker\n\t    if test \"$GXX\" = yes && test \"$with_gnu_ld\" = no; then\n\t      _LT_TAGVAR(no_undefined_flag, $1)=' ${wl}-z ${wl}defs'\n\t      if $CC --version | $GREP -v '^2\\.7' > /dev/null; then\n\t        _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag -nostdlib $LDFLAGS $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-h $wl$soname -o $lib'\n\t        _LT_TAGVAR(archive_expsym_cmds, $1)='echo \"{ global:\" > $lib.exp~cat $export_symbols | $SED -e \"s/\\(.*\\)/\\1;/\" >> $lib.exp~echo \"local: *; };\" >> $lib.exp~\n\t\t  $CC -shared $pic_flag -nostdlib ${wl}-M $wl$lib.exp -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags~$RM $lib.exp'\n\n\t        # Commands to make compiler produce verbose output that lists\n\t        # what \"hidden\" libraries, object files and flags are used when\n\t        # linking a shared library.\n\t        output_verbose_link_cmd='$CC -shared $CFLAGS -v conftest.$objext 2>&1 | $GREP -v \"^Configured with:\" | $GREP \"\\-L\"'\n\t      else\n\t        # g++ 2.7 appears to require `-G' NOT `-shared' on this\n\t        # platform.\n\t        _LT_TAGVAR(archive_cmds, $1)='$CC -G -nostdlib $LDFLAGS $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-h $wl$soname -o $lib'\n\t        _LT_TAGVAR(archive_expsym_cmds, $1)='echo \"{ global:\" > $lib.exp~cat $export_symbols | $SED -e \"s/\\(.*\\)/\\1;/\" >> $lib.exp~echo \"local: *; };\" >> $lib.exp~\n\t\t  $CC -G -nostdlib ${wl}-M $wl$lib.exp -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags~$RM $lib.exp'\n\n\t        # Commands to make compiler produce verbose output that lists\n\t        # what \"hidden\" libraries, object files and flags are used when\n\t        # linking a shared library.\n\t        output_verbose_link_cmd='$CC -G $CFLAGS -v conftest.$objext 2>&1 | $GREP -v \"^Configured with:\" | $GREP \"\\-L\"'\n\t      fi\n\n\t      _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-R $wl$libdir'\n\t      case $host_os in\n\t\tsolaris2.[[0-5]] | solaris2.[[0-5]].*) ;;\n\t\t*)\n\t\t  _LT_TAGVAR(whole_archive_flag_spec, $1)='${wl}-z ${wl}allextract$convenience ${wl}-z ${wl}defaultextract'\n\t\t  ;;\n\t      esac\n\t    fi\n\t    ;;\n        esac\n        ;;\n\n    sysv4*uw2* | sysv5OpenUNIX* | sysv5UnixWare7.[[01]].[[10]]* | unixware7* | sco3.2v5.0.[[024]]*)\n      _LT_TAGVAR(no_undefined_flag, $1)='${wl}-z,text'\n      _LT_TAGVAR(archive_cmds_need_lc, $1)=no\n      _LT_TAGVAR(hardcode_shlibpath_var, $1)=no\n      runpath_var='LD_RUN_PATH'\n\n      case $cc_basename in\n        CC*)\n\t  _LT_TAGVAR(archive_cmds, $1)='$CC -G ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags'\n\t  _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -G ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags'\n\t  ;;\n\t*)\n\t  _LT_TAGVAR(archive_cmds, $1)='$CC -shared ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags'\n\t  _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags'\n\t  ;;\n      esac\n      ;;\n\n      sysv5* | sco3.2v5* | sco5v6*)\n\t# Note: We can NOT use -z defs as we might desire, because we do not\n\t# link with -lc, and that would cause any symbols used from libc to\n\t# always be unresolved, which means just about no library would\n\t# ever link correctly.  If we're not using GNU ld we use -z text\n\t# though, which does catch some bad symbols but isn't as heavy-handed\n\t# as -z defs.\n\t_LT_TAGVAR(no_undefined_flag, $1)='${wl}-z,text'\n\t_LT_TAGVAR(allow_undefined_flag, $1)='${wl}-z,nodefs'\n\t_LT_TAGVAR(archive_cmds_need_lc, $1)=no\n\t_LT_TAGVAR(hardcode_shlibpath_var, $1)=no\n\t_LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-R,$libdir'\n\t_LT_TAGVAR(hardcode_libdir_separator, $1)=':'\n\t_LT_TAGVAR(link_all_deplibs, $1)=yes\n\t_LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}-Bexport'\n\trunpath_var='LD_RUN_PATH'\n\n\tcase $cc_basename in\n          CC*)\n\t    _LT_TAGVAR(archive_cmds, $1)='$CC -G ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags'\n\t    _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -G ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags'\n\t    _LT_TAGVAR(old_archive_cmds, $1)='$CC -Tprelink_objects $oldobjs~\n\t      '\"$_LT_TAGVAR(old_archive_cmds, $1)\"\n\t    _LT_TAGVAR(reload_cmds, $1)='$CC -Tprelink_objects $reload_objs~\n\t      '\"$_LT_TAGVAR(reload_cmds, $1)\"\n\t    ;;\n\t  *)\n\t    _LT_TAGVAR(archive_cmds, $1)='$CC -shared ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags'\n\t    _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags'\n\t    ;;\n\tesac\n      ;;\n\n      tandem*)\n        case $cc_basename in\n          NCC*)\n\t    # NonStop-UX NCC 3.20\n\t    # FIXME: insert proper C++ library support\n\t    _LT_TAGVAR(ld_shlibs, $1)=no\n\t    ;;\n          *)\n\t    # FIXME: insert proper C++ library support\n\t    _LT_TAGVAR(ld_shlibs, $1)=no\n\t    ;;\n        esac\n        ;;\n\n      vxworks*)\n        # FIXME: insert proper C++ library support\n        _LT_TAGVAR(ld_shlibs, $1)=no\n        ;;\n\n      *)\n        # FIXME: insert proper C++ library support\n        _LT_TAGVAR(ld_shlibs, $1)=no\n        ;;\n    esac\n\n    AC_MSG_RESULT([$_LT_TAGVAR(ld_shlibs, $1)])\n    test \"$_LT_TAGVAR(ld_shlibs, $1)\" = no && can_build_shared=no\n\n    _LT_TAGVAR(GCC, $1)=\"$GXX\"\n    _LT_TAGVAR(LD, $1)=\"$LD\"\n\n    ## CAVEAT EMPTOR:\n    ## There is no encapsulation within the following macros, do not change\n    ## the running order or otherwise move them around unless you know exactly\n    ## what you are doing...\n    _LT_SYS_HIDDEN_LIBDEPS($1)\n    _LT_COMPILER_PIC($1)\n    _LT_COMPILER_C_O($1)\n    _LT_COMPILER_FILE_LOCKS($1)\n    _LT_LINKER_SHLIBS($1)\n    _LT_SYS_DYNAMIC_LINKER($1)\n    _LT_LINKER_HARDCODE_LIBPATH($1)\n\n    _LT_CONFIG($1)\n  fi # test -n \"$compiler\"\n\n  CC=$lt_save_CC\n  CFLAGS=$lt_save_CFLAGS\n  LDCXX=$LD\n  LD=$lt_save_LD\n  GCC=$lt_save_GCC\n  with_gnu_ld=$lt_save_with_gnu_ld\n  lt_cv_path_LDCXX=$lt_cv_path_LD\n  lt_cv_path_LD=$lt_save_path_LD\n  lt_cv_prog_gnu_ldcxx=$lt_cv_prog_gnu_ld\n  lt_cv_prog_gnu_ld=$lt_save_with_gnu_ld\nfi # test \"$_lt_caught_CXX_error\" != yes\n\nAC_LANG_POP\n])# _LT_LANG_CXX_CONFIG\n\n\n# _LT_FUNC_STRIPNAME_CNF\n# ----------------------\n# func_stripname_cnf prefix suffix name\n# strip PREFIX and SUFFIX off of NAME.\n# PREFIX and SUFFIX must not contain globbing or regex special\n# characters, hashes, percent signs, but SUFFIX may contain a leading\n# dot (in which case that matches only a dot).\n#\n# This function is identical to the (non-XSI) version of func_stripname,\n# except this one can be used by m4 code that may be executed by configure,\n# rather than the libtool script.\nm4_defun([_LT_FUNC_STRIPNAME_CNF],[dnl\nAC_REQUIRE([_LT_DECL_SED])\nAC_REQUIRE([_LT_PROG_ECHO_BACKSLASH])\nfunc_stripname_cnf ()\n{\n  case ${2} in\n  .*) func_stripname_result=`$ECHO \"${3}\" | $SED \"s%^${1}%%; s%\\\\\\\\${2}\\$%%\"`;;\n  *)  func_stripname_result=`$ECHO \"${3}\" | $SED \"s%^${1}%%; s%${2}\\$%%\"`;;\n  esac\n} # func_stripname_cnf\n])# _LT_FUNC_STRIPNAME_CNF\n\n# _LT_SYS_HIDDEN_LIBDEPS([TAGNAME])\n# ---------------------------------\n# Figure out \"hidden\" library dependencies from verbose\n# compiler output when linking a shared library.\n# Parse the compiler output and extract the necessary\n# objects, libraries and library flags.\nm4_defun([_LT_SYS_HIDDEN_LIBDEPS],\n[m4_require([_LT_FILEUTILS_DEFAULTS])dnl\nAC_REQUIRE([_LT_FUNC_STRIPNAME_CNF])dnl\n# Dependencies to place before and after the object being linked:\n_LT_TAGVAR(predep_objects, $1)=\n_LT_TAGVAR(postdep_objects, $1)=\n_LT_TAGVAR(predeps, $1)=\n_LT_TAGVAR(postdeps, $1)=\n_LT_TAGVAR(compiler_lib_search_path, $1)=\n\ndnl we can't use the lt_simple_compile_test_code here,\ndnl because it contains code intended for an executable,\ndnl not a library.  It's possible we should let each\ndnl tag define a new lt_????_link_test_code variable,\ndnl but it's only used here...\nm4_if([$1], [], [cat > conftest.$ac_ext <<_LT_EOF\nint a;\nvoid foo (void) { a = 0; }\n_LT_EOF\n], [$1], [CXX], [cat > conftest.$ac_ext <<_LT_EOF\nclass Foo\n{\npublic:\n  Foo (void) { a = 0; }\nprivate:\n  int a;\n};\n_LT_EOF\n], [$1], [F77], [cat > conftest.$ac_ext <<_LT_EOF\n      subroutine foo\n      implicit none\n      integer*4 a\n      a=0\n      return\n      end\n_LT_EOF\n], [$1], [FC], [cat > conftest.$ac_ext <<_LT_EOF\n      subroutine foo\n      implicit none\n      integer a\n      a=0\n      return\n      end\n_LT_EOF\n], [$1], [GCJ], [cat > conftest.$ac_ext <<_LT_EOF\npublic class foo {\n  private int a;\n  public void bar (void) {\n    a = 0;\n  }\n};\n_LT_EOF\n], [$1], [GO], [cat > conftest.$ac_ext <<_LT_EOF\npackage foo\nfunc foo() {\n}\n_LT_EOF\n])\n\n_lt_libdeps_save_CFLAGS=$CFLAGS\ncase \"$CC $CFLAGS \" in #(\n*\\ -flto*\\ *) CFLAGS=\"$CFLAGS -fno-lto\" ;;\n*\\ -fwhopr*\\ *) CFLAGS=\"$CFLAGS -fno-whopr\" ;;\n*\\ -fuse-linker-plugin*\\ *) CFLAGS=\"$CFLAGS -fno-use-linker-plugin\" ;;\nesac\n\ndnl Parse the compiler output and extract the necessary\ndnl objects, libraries and library flags.\nif AC_TRY_EVAL(ac_compile); then\n  # Parse the compiler output and extract the necessary\n  # objects, libraries and library flags.\n\n  # Sentinel used to keep track of whether or not we are before\n  # the conftest object file.\n  pre_test_object_deps_done=no\n\n  for p in `eval \"$output_verbose_link_cmd\"`; do\n    case ${prev}${p} in\n\n    -L* | -R* | -l*)\n       # Some compilers place space between \"-{L,R}\" and the path.\n       # Remove the space.\n       if test $p = \"-L\" ||\n          test $p = \"-R\"; then\n\t prev=$p\n\t continue\n       fi\n\n       # Expand the sysroot to ease extracting the directories later.\n       if test -z \"$prev\"; then\n         case $p in\n         -L*) func_stripname_cnf '-L' '' \"$p\"; prev=-L; p=$func_stripname_result ;;\n         -R*) func_stripname_cnf '-R' '' \"$p\"; prev=-R; p=$func_stripname_result ;;\n         -l*) func_stripname_cnf '-l' '' \"$p\"; prev=-l; p=$func_stripname_result ;;\n         esac\n       fi\n       case $p in\n       =*) func_stripname_cnf '=' '' \"$p\"; p=$lt_sysroot$func_stripname_result ;;\n       esac\n       if test \"$pre_test_object_deps_done\" = no; then\n\t case ${prev} in\n\t -L | -R)\n\t   # Internal compiler library paths should come after those\n\t   # provided the user.  The postdeps already come after the\n\t   # user supplied libs so there is no need to process them.\n\t   if test -z \"$_LT_TAGVAR(compiler_lib_search_path, $1)\"; then\n\t     _LT_TAGVAR(compiler_lib_search_path, $1)=\"${prev}${p}\"\n\t   else\n\t     _LT_TAGVAR(compiler_lib_search_path, $1)=\"${_LT_TAGVAR(compiler_lib_search_path, $1)} ${prev}${p}\"\n\t   fi\n\t   ;;\n\t # The \"-l\" case would never come before the object being\n\t # linked, so don't bother handling this case.\n\t esac\n       else\n\t if test -z \"$_LT_TAGVAR(postdeps, $1)\"; then\n\t   _LT_TAGVAR(postdeps, $1)=\"${prev}${p}\"\n\t else\n\t   _LT_TAGVAR(postdeps, $1)=\"${_LT_TAGVAR(postdeps, $1)} ${prev}${p}\"\n\t fi\n       fi\n       prev=\n       ;;\n\n    *.lto.$objext) ;; # Ignore GCC LTO objects\n    *.$objext)\n       # This assumes that the test object file only shows up\n       # once in the compiler output.\n       if test \"$p\" = \"conftest.$objext\"; then\n\t pre_test_object_deps_done=yes\n\t continue\n       fi\n\n       if test \"$pre_test_object_deps_done\" = no; then\n\t if test -z \"$_LT_TAGVAR(predep_objects, $1)\"; then\n\t   _LT_TAGVAR(predep_objects, $1)=\"$p\"\n\t else\n\t   _LT_TAGVAR(predep_objects, $1)=\"$_LT_TAGVAR(predep_objects, $1) $p\"\n\t fi\n       else\n\t if test -z \"$_LT_TAGVAR(postdep_objects, $1)\"; then\n\t   _LT_TAGVAR(postdep_objects, $1)=\"$p\"\n\t else\n\t   _LT_TAGVAR(postdep_objects, $1)=\"$_LT_TAGVAR(postdep_objects, $1) $p\"\n\t fi\n       fi\n       ;;\n\n    *) ;; # Ignore the rest.\n\n    esac\n  done\n\n  # Clean up.\n  rm -f a.out a.exe\nelse\n  echo \"libtool.m4: error: problem compiling $1 test program\"\nfi\n\n$RM -f confest.$objext\nCFLAGS=$_lt_libdeps_save_CFLAGS\n\n# PORTME: override above test on systems where it is broken\nm4_if([$1], [CXX],\n[case $host_os in\ninterix[[3-9]]*)\n  # Interix 3.5 installs completely hosed .la files for C++, so rather than\n  # hack all around it, let's just trust \"g++\" to DTRT.\n  _LT_TAGVAR(predep_objects,$1)=\n  _LT_TAGVAR(postdep_objects,$1)=\n  _LT_TAGVAR(postdeps,$1)=\n  ;;\n\nlinux*)\n  case `$CC -V 2>&1 | sed 5q` in\n  *Sun\\ C*)\n    # Sun C++ 5.9\n\n    # The more standards-conforming stlport4 library is\n    # incompatible with the Cstd library. Avoid specifying\n    # it if it's in CXXFLAGS. Ignore libCrun as\n    # -library=stlport4 depends on it.\n    case \" $CXX $CXXFLAGS \" in\n    *\" -library=stlport4 \"*)\n      solaris_use_stlport4=yes\n      ;;\n    esac\n\n    if test \"$solaris_use_stlport4\" != yes; then\n      _LT_TAGVAR(postdeps,$1)='-library=Cstd -library=Crun'\n    fi\n    ;;\n  esac\n  ;;\n\nsolaris*)\n  case $cc_basename in\n  CC* | sunCC*)\n    # The more standards-conforming stlport4 library is\n    # incompatible with the Cstd library. Avoid specifying\n    # it if it's in CXXFLAGS. Ignore libCrun as\n    # -library=stlport4 depends on it.\n    case \" $CXX $CXXFLAGS \" in\n    *\" -library=stlport4 \"*)\n      solaris_use_stlport4=yes\n      ;;\n    esac\n\n    # Adding this requires a known-good setup of shared libraries for\n    # Sun compiler versions before 5.6, else PIC objects from an old\n    # archive will be linked into the output, leading to subtle bugs.\n    if test \"$solaris_use_stlport4\" != yes; then\n      _LT_TAGVAR(postdeps,$1)='-library=Cstd -library=Crun'\n    fi\n    ;;\n  esac\n  ;;\nesac\n])\n\ncase \" $_LT_TAGVAR(postdeps, $1) \" in\n*\" -lc \"*) _LT_TAGVAR(archive_cmds_need_lc, $1)=no ;;\nesac\n _LT_TAGVAR(compiler_lib_search_dirs, $1)=\nif test -n \"${_LT_TAGVAR(compiler_lib_search_path, $1)}\"; then\n _LT_TAGVAR(compiler_lib_search_dirs, $1)=`echo \" ${_LT_TAGVAR(compiler_lib_search_path, $1)}\" | ${SED} -e 's! -L! !g' -e 's!^ !!'`\nfi\n_LT_TAGDECL([], [compiler_lib_search_dirs], [1],\n    [The directories searched by this compiler when creating a shared library])\n_LT_TAGDECL([], [predep_objects], [1],\n    [Dependencies to place before and after the objects being linked to\n    create a shared library])\n_LT_TAGDECL([], [postdep_objects], [1])\n_LT_TAGDECL([], [predeps], [1])\n_LT_TAGDECL([], [postdeps], [1])\n_LT_TAGDECL([], [compiler_lib_search_path], [1],\n    [The library search path used internally by the compiler when linking\n    a shared library])\n])# _LT_SYS_HIDDEN_LIBDEPS\n\n\n# _LT_LANG_F77_CONFIG([TAG])\n# --------------------------\n# Ensure that the configuration variables for a Fortran 77 compiler are\n# suitably defined.  These variables are subsequently used by _LT_CONFIG\n# to write the compiler configuration to `libtool'.\nm4_defun([_LT_LANG_F77_CONFIG],\n[AC_LANG_PUSH(Fortran 77)\nif test -z \"$F77\" || test \"X$F77\" = \"Xno\"; then\n  _lt_disable_F77=yes\nfi\n\n_LT_TAGVAR(archive_cmds_need_lc, $1)=no\n_LT_TAGVAR(allow_undefined_flag, $1)=\n_LT_TAGVAR(always_export_symbols, $1)=no\n_LT_TAGVAR(archive_expsym_cmds, $1)=\n_LT_TAGVAR(export_dynamic_flag_spec, $1)=\n_LT_TAGVAR(hardcode_direct, $1)=no\n_LT_TAGVAR(hardcode_direct_absolute, $1)=no\n_LT_TAGVAR(hardcode_libdir_flag_spec, $1)=\n_LT_TAGVAR(hardcode_libdir_separator, $1)=\n_LT_TAGVAR(hardcode_minus_L, $1)=no\n_LT_TAGVAR(hardcode_automatic, $1)=no\n_LT_TAGVAR(inherit_rpath, $1)=no\n_LT_TAGVAR(module_cmds, $1)=\n_LT_TAGVAR(module_expsym_cmds, $1)=\n_LT_TAGVAR(link_all_deplibs, $1)=unknown\n_LT_TAGVAR(old_archive_cmds, $1)=$old_archive_cmds\n_LT_TAGVAR(reload_flag, $1)=$reload_flag\n_LT_TAGVAR(reload_cmds, $1)=$reload_cmds\n_LT_TAGVAR(no_undefined_flag, $1)=\n_LT_TAGVAR(whole_archive_flag_spec, $1)=\n_LT_TAGVAR(enable_shared_with_static_runtimes, $1)=no\n\n# Source file extension for f77 test sources.\nac_ext=f\n\n# Object file extension for compiled f77 test sources.\nobjext=o\n_LT_TAGVAR(objext, $1)=$objext\n\n# No sense in running all these tests if we already determined that\n# the F77 compiler isn't working.  Some variables (like enable_shared)\n# are currently assumed to apply to all compilers on this platform,\n# and will be corrupted by setting them based on a non-working compiler.\nif test \"$_lt_disable_F77\" != yes; then\n  # Code to be used in simple compile tests\n  lt_simple_compile_test_code=\"\\\n      subroutine t\n      return\n      end\n\"\n\n  # Code to be used in simple link tests\n  lt_simple_link_test_code=\"\\\n      program t\n      end\n\"\n\n  # ltmain only uses $CC for tagged configurations so make sure $CC is set.\n  _LT_TAG_COMPILER\n\n  # save warnings/boilerplate of simple test code\n  _LT_COMPILER_BOILERPLATE\n  _LT_LINKER_BOILERPLATE\n\n  # Allow CC to be a program name with arguments.\n  lt_save_CC=\"$CC\"\n  lt_save_GCC=$GCC\n  lt_save_CFLAGS=$CFLAGS\n  CC=${F77-\"f77\"}\n  CFLAGS=$FFLAGS\n  compiler=$CC\n  _LT_TAGVAR(compiler, $1)=$CC\n  _LT_CC_BASENAME([$compiler])\n  GCC=$G77\n  if test -n \"$compiler\"; then\n    AC_MSG_CHECKING([if libtool supports shared libraries])\n    AC_MSG_RESULT([$can_build_shared])\n\n    AC_MSG_CHECKING([whether to build shared libraries])\n    test \"$can_build_shared\" = \"no\" && enable_shared=no\n\n    # On AIX, shared libraries and static libraries use the same namespace, and\n    # are all built from PIC.\n    case $host_os in\n      aix3*)\n        test \"$enable_shared\" = yes && enable_static=no\n        if test -n \"$RANLIB\"; then\n          archive_cmds=\"$archive_cmds~\\$RANLIB \\$lib\"\n          postinstall_cmds='$RANLIB $lib'\n        fi\n        ;;\n      aix[[4-9]]*)\n\tif test \"$host_cpu\" != ia64 && test \"$aix_use_runtimelinking\" = no ; then\n\t  test \"$enable_shared\" = yes && enable_static=no\n\tfi\n        ;;\n    esac\n    AC_MSG_RESULT([$enable_shared])\n\n    AC_MSG_CHECKING([whether to build static libraries])\n    # Make sure either enable_shared or enable_static is yes.\n    test \"$enable_shared\" = yes || enable_static=yes\n    AC_MSG_RESULT([$enable_static])\n\n    _LT_TAGVAR(GCC, $1)=\"$G77\"\n    _LT_TAGVAR(LD, $1)=\"$LD\"\n\n    ## CAVEAT EMPTOR:\n    ## There is no encapsulation within the following macros, do not change\n    ## the running order or otherwise move them around unless you know exactly\n    ## what you are doing...\n    _LT_COMPILER_PIC($1)\n    _LT_COMPILER_C_O($1)\n    _LT_COMPILER_FILE_LOCKS($1)\n    _LT_LINKER_SHLIBS($1)\n    _LT_SYS_DYNAMIC_LINKER($1)\n    _LT_LINKER_HARDCODE_LIBPATH($1)\n\n    _LT_CONFIG($1)\n  fi # test -n \"$compiler\"\n\n  GCC=$lt_save_GCC\n  CC=\"$lt_save_CC\"\n  CFLAGS=\"$lt_save_CFLAGS\"\nfi # test \"$_lt_disable_F77\" != yes\n\nAC_LANG_POP\n])# _LT_LANG_F77_CONFIG\n\n\n# _LT_LANG_FC_CONFIG([TAG])\n# -------------------------\n# Ensure that the configuration variables for a Fortran compiler are\n# suitably defined.  These variables are subsequently used by _LT_CONFIG\n# to write the compiler configuration to `libtool'.\nm4_defun([_LT_LANG_FC_CONFIG],\n[AC_LANG_PUSH(Fortran)\n\nif test -z \"$FC\" || test \"X$FC\" = \"Xno\"; then\n  _lt_disable_FC=yes\nfi\n\n_LT_TAGVAR(archive_cmds_need_lc, $1)=no\n_LT_TAGVAR(allow_undefined_flag, $1)=\n_LT_TAGVAR(always_export_symbols, $1)=no\n_LT_TAGVAR(archive_expsym_cmds, $1)=\n_LT_TAGVAR(export_dynamic_flag_spec, $1)=\n_LT_TAGVAR(hardcode_direct, $1)=no\n_LT_TAGVAR(hardcode_direct_absolute, $1)=no\n_LT_TAGVAR(hardcode_libdir_flag_spec, $1)=\n_LT_TAGVAR(hardcode_libdir_separator, $1)=\n_LT_TAGVAR(hardcode_minus_L, $1)=no\n_LT_TAGVAR(hardcode_automatic, $1)=no\n_LT_TAGVAR(inherit_rpath, $1)=no\n_LT_TAGVAR(module_cmds, $1)=\n_LT_TAGVAR(module_expsym_cmds, $1)=\n_LT_TAGVAR(link_all_deplibs, $1)=unknown\n_LT_TAGVAR(old_archive_cmds, $1)=$old_archive_cmds\n_LT_TAGVAR(reload_flag, $1)=$reload_flag\n_LT_TAGVAR(reload_cmds, $1)=$reload_cmds\n_LT_TAGVAR(no_undefined_flag, $1)=\n_LT_TAGVAR(whole_archive_flag_spec, $1)=\n_LT_TAGVAR(enable_shared_with_static_runtimes, $1)=no\n\n# Source file extension for fc test sources.\nac_ext=${ac_fc_srcext-f}\n\n# Object file extension for compiled fc test sources.\nobjext=o\n_LT_TAGVAR(objext, $1)=$objext\n\n# No sense in running all these tests if we already determined that\n# the FC compiler isn't working.  Some variables (like enable_shared)\n# are currently assumed to apply to all compilers on this platform,\n# and will be corrupted by setting them based on a non-working compiler.\nif test \"$_lt_disable_FC\" != yes; then\n  # Code to be used in simple compile tests\n  lt_simple_compile_test_code=\"\\\n      subroutine t\n      return\n      end\n\"\n\n  # Code to be used in simple link tests\n  lt_simple_link_test_code=\"\\\n      program t\n      end\n\"\n\n  # ltmain only uses $CC for tagged configurations so make sure $CC is set.\n  _LT_TAG_COMPILER\n\n  # save warnings/boilerplate of simple test code\n  _LT_COMPILER_BOILERPLATE\n  _LT_LINKER_BOILERPLATE\n\n  # Allow CC to be a program name with arguments.\n  lt_save_CC=\"$CC\"\n  lt_save_GCC=$GCC\n  lt_save_CFLAGS=$CFLAGS\n  CC=${FC-\"f95\"}\n  CFLAGS=$FCFLAGS\n  compiler=$CC\n  GCC=$ac_cv_fc_compiler_gnu\n\n  _LT_TAGVAR(compiler, $1)=$CC\n  _LT_CC_BASENAME([$compiler])\n\n  if test -n \"$compiler\"; then\n    AC_MSG_CHECKING([if libtool supports shared libraries])\n    AC_MSG_RESULT([$can_build_shared])\n\n    AC_MSG_CHECKING([whether to build shared libraries])\n    test \"$can_build_shared\" = \"no\" && enable_shared=no\n\n    # On AIX, shared libraries and static libraries use the same namespace, and\n    # are all built from PIC.\n    case $host_os in\n      aix3*)\n        test \"$enable_shared\" = yes && enable_static=no\n        if test -n \"$RANLIB\"; then\n          archive_cmds=\"$archive_cmds~\\$RANLIB \\$lib\"\n          postinstall_cmds='$RANLIB $lib'\n        fi\n        ;;\n      aix[[4-9]]*)\n\tif test \"$host_cpu\" != ia64 && test \"$aix_use_runtimelinking\" = no ; then\n\t  test \"$enable_shared\" = yes && enable_static=no\n\tfi\n        ;;\n    esac\n    AC_MSG_RESULT([$enable_shared])\n\n    AC_MSG_CHECKING([whether to build static libraries])\n    # Make sure either enable_shared or enable_static is yes.\n    test \"$enable_shared\" = yes || enable_static=yes\n    AC_MSG_RESULT([$enable_static])\n\n    _LT_TAGVAR(GCC, $1)=\"$ac_cv_fc_compiler_gnu\"\n    _LT_TAGVAR(LD, $1)=\"$LD\"\n\n    ## CAVEAT EMPTOR:\n    ## There is no encapsulation within the following macros, do not change\n    ## the running order or otherwise move them around unless you know exactly\n    ## what you are doing...\n    _LT_SYS_HIDDEN_LIBDEPS($1)\n    _LT_COMPILER_PIC($1)\n    _LT_COMPILER_C_O($1)\n    _LT_COMPILER_FILE_LOCKS($1)\n    _LT_LINKER_SHLIBS($1)\n    _LT_SYS_DYNAMIC_LINKER($1)\n    _LT_LINKER_HARDCODE_LIBPATH($1)\n\n    _LT_CONFIG($1)\n  fi # test -n \"$compiler\"\n\n  GCC=$lt_save_GCC\n  CC=$lt_save_CC\n  CFLAGS=$lt_save_CFLAGS\nfi # test \"$_lt_disable_FC\" != yes\n\nAC_LANG_POP\n])# _LT_LANG_FC_CONFIG\n\n\n# _LT_LANG_GCJ_CONFIG([TAG])\n# --------------------------\n# Ensure that the configuration variables for the GNU Java Compiler compiler\n# are suitably defined.  These variables are subsequently used by _LT_CONFIG\n# to write the compiler configuration to `libtool'.\nm4_defun([_LT_LANG_GCJ_CONFIG],\n[AC_REQUIRE([LT_PROG_GCJ])dnl\nAC_LANG_SAVE\n\n# Source file extension for Java test sources.\nac_ext=java\n\n# Object file extension for compiled Java test sources.\nobjext=o\n_LT_TAGVAR(objext, $1)=$objext\n\n# Code to be used in simple compile tests\nlt_simple_compile_test_code=\"class foo {}\"\n\n# Code to be used in simple link tests\nlt_simple_link_test_code='public class conftest { public static void main(String[[]] argv) {}; }'\n\n# ltmain only uses $CC for tagged configurations so make sure $CC is set.\n_LT_TAG_COMPILER\n\n# save warnings/boilerplate of simple test code\n_LT_COMPILER_BOILERPLATE\n_LT_LINKER_BOILERPLATE\n\n# Allow CC to be a program name with arguments.\nlt_save_CC=$CC\nlt_save_CFLAGS=$CFLAGS\nlt_save_GCC=$GCC\nGCC=yes\nCC=${GCJ-\"gcj\"}\nCFLAGS=$GCJFLAGS\ncompiler=$CC\n_LT_TAGVAR(compiler, $1)=$CC\n_LT_TAGVAR(LD, $1)=\"$LD\"\n_LT_CC_BASENAME([$compiler])\n\n# GCJ did not exist at the time GCC didn't implicitly link libc in.\n_LT_TAGVAR(archive_cmds_need_lc, $1)=no\n\n_LT_TAGVAR(old_archive_cmds, $1)=$old_archive_cmds\n_LT_TAGVAR(reload_flag, $1)=$reload_flag\n_LT_TAGVAR(reload_cmds, $1)=$reload_cmds\n\n## CAVEAT EMPTOR:\n## There is no encapsulation within the following macros, do not change\n## the running order or otherwise move them around unless you know exactly\n## what you are doing...\nif test -n \"$compiler\"; then\n  _LT_COMPILER_NO_RTTI($1)\n  _LT_COMPILER_PIC($1)\n  _LT_COMPILER_C_O($1)\n  _LT_COMPILER_FILE_LOCKS($1)\n  _LT_LINKER_SHLIBS($1)\n  _LT_LINKER_HARDCODE_LIBPATH($1)\n\n  _LT_CONFIG($1)\nfi\n\nAC_LANG_RESTORE\n\nGCC=$lt_save_GCC\nCC=$lt_save_CC\nCFLAGS=$lt_save_CFLAGS\n])# _LT_LANG_GCJ_CONFIG\n\n\n# _LT_LANG_GO_CONFIG([TAG])\n# --------------------------\n# Ensure that the configuration variables for the GNU Go compiler\n# are suitably defined.  These variables are subsequently used by _LT_CONFIG\n# to write the compiler configuration to `libtool'.\nm4_defun([_LT_LANG_GO_CONFIG],\n[AC_REQUIRE([LT_PROG_GO])dnl\nAC_LANG_SAVE\n\n# Source file extension for Go test sources.\nac_ext=go\n\n# Object file extension for compiled Go test sources.\nobjext=o\n_LT_TAGVAR(objext, $1)=$objext\n\n# Code to be used in simple compile tests\nlt_simple_compile_test_code=\"package main; func main() { }\"\n\n# Code to be used in simple link tests\nlt_simple_link_test_code='package main; func main() { }'\n\n# ltmain only uses $CC for tagged configurations so make sure $CC is set.\n_LT_TAG_COMPILER\n\n# save warnings/boilerplate of simple test code\n_LT_COMPILER_BOILERPLATE\n_LT_LINKER_BOILERPLATE\n\n# Allow CC to be a program name with arguments.\nlt_save_CC=$CC\nlt_save_CFLAGS=$CFLAGS\nlt_save_GCC=$GCC\nGCC=yes\nCC=${GOC-\"gccgo\"}\nCFLAGS=$GOFLAGS\ncompiler=$CC\n_LT_TAGVAR(compiler, $1)=$CC\n_LT_TAGVAR(LD, $1)=\"$LD\"\n_LT_CC_BASENAME([$compiler])\n\n# Go did not exist at the time GCC didn't implicitly link libc in.\n_LT_TAGVAR(archive_cmds_need_lc, $1)=no\n\n_LT_TAGVAR(old_archive_cmds, $1)=$old_archive_cmds\n_LT_TAGVAR(reload_flag, $1)=$reload_flag\n_LT_TAGVAR(reload_cmds, $1)=$reload_cmds\n\n## CAVEAT EMPTOR:\n## There is no encapsulation within the following macros, do not change\n## the running order or otherwise move them around unless you know exactly\n## what you are doing...\nif test -n \"$compiler\"; then\n  _LT_COMPILER_NO_RTTI($1)\n  _LT_COMPILER_PIC($1)\n  _LT_COMPILER_C_O($1)\n  _LT_COMPILER_FILE_LOCKS($1)\n  _LT_LINKER_SHLIBS($1)\n  _LT_LINKER_HARDCODE_LIBPATH($1)\n\n  _LT_CONFIG($1)\nfi\n\nAC_LANG_RESTORE\n\nGCC=$lt_save_GCC\nCC=$lt_save_CC\nCFLAGS=$lt_save_CFLAGS\n])# _LT_LANG_GO_CONFIG\n\n\n# _LT_LANG_RC_CONFIG([TAG])\n# -------------------------\n# Ensure that the configuration variables for the Windows resource compiler\n# are suitably defined.  These variables are subsequently used by _LT_CONFIG\n# to write the compiler configuration to `libtool'.\nm4_defun([_LT_LANG_RC_CONFIG],\n[AC_REQUIRE([LT_PROG_RC])dnl\nAC_LANG_SAVE\n\n# Source file extension for RC test sources.\nac_ext=rc\n\n# Object file extension for compiled RC test sources.\nobjext=o\n_LT_TAGVAR(objext, $1)=$objext\n\n# Code to be used in simple compile tests\nlt_simple_compile_test_code='sample MENU { MENUITEM \"&Soup\", 100, CHECKED }'\n\n# Code to be used in simple link tests\nlt_simple_link_test_code=\"$lt_simple_compile_test_code\"\n\n# ltmain only uses $CC for tagged configurations so make sure $CC is set.\n_LT_TAG_COMPILER\n\n# save warnings/boilerplate of simple test code\n_LT_COMPILER_BOILERPLATE\n_LT_LINKER_BOILERPLATE\n\n# Allow CC to be a program name with arguments.\nlt_save_CC=\"$CC\"\nlt_save_CFLAGS=$CFLAGS\nlt_save_GCC=$GCC\nGCC=\nCC=${RC-\"windres\"}\nCFLAGS=\ncompiler=$CC\n_LT_TAGVAR(compiler, $1)=$CC\n_LT_CC_BASENAME([$compiler])\n_LT_TAGVAR(lt_cv_prog_compiler_c_o, $1)=yes\n\nif test -n \"$compiler\"; then\n  :\n  _LT_CONFIG($1)\nfi\n\nGCC=$lt_save_GCC\nAC_LANG_RESTORE\nCC=$lt_save_CC\nCFLAGS=$lt_save_CFLAGS\n])# _LT_LANG_RC_CONFIG\n\n\n# LT_PROG_GCJ\n# -----------\nAC_DEFUN([LT_PROG_GCJ],\n[m4_ifdef([AC_PROG_GCJ], [AC_PROG_GCJ],\n  [m4_ifdef([A][M_PROG_GCJ], [A][M_PROG_GCJ],\n    [AC_CHECK_TOOL(GCJ, gcj,)\n      test \"x${GCJFLAGS+set}\" = xset || GCJFLAGS=\"-g -O2\"\n      AC_SUBST(GCJFLAGS)])])[]dnl\n])\n\n# Old name:\nAU_ALIAS([LT_AC_PROG_GCJ], [LT_PROG_GCJ])\ndnl aclocal-1.4 backwards compatibility:\ndnl AC_DEFUN([LT_AC_PROG_GCJ], [])\n\n\n# LT_PROG_GO\n# ----------\nAC_DEFUN([LT_PROG_GO],\n[AC_CHECK_TOOL(GOC, gccgo,)\n])\n\n\n# LT_PROG_RC\n# ----------\nAC_DEFUN([LT_PROG_RC],\n[AC_CHECK_TOOL(RC, windres,)\n])\n\n# Old name:\nAU_ALIAS([LT_AC_PROG_RC], [LT_PROG_RC])\ndnl aclocal-1.4 backwards compatibility:\ndnl AC_DEFUN([LT_AC_PROG_RC], [])\n\n\n# _LT_DECL_EGREP\n# --------------\n# If we don't have a new enough Autoconf to choose the best grep\n# available, choose the one first in the user's PATH.\nm4_defun([_LT_DECL_EGREP],\n[AC_REQUIRE([AC_PROG_EGREP])dnl\nAC_REQUIRE([AC_PROG_FGREP])dnl\ntest -z \"$GREP\" && GREP=grep\n_LT_DECL([], [GREP], [1], [A grep program that handles long lines])\n_LT_DECL([], [EGREP], [1], [An ERE matcher])\n_LT_DECL([], [FGREP], [1], [A literal string matcher])\ndnl Non-bleeding-edge autoconf doesn't subst GREP, so do it here too\nAC_SUBST([GREP])\n])\n\n\n# _LT_DECL_OBJDUMP\n# --------------\n# If we don't have a new enough Autoconf to choose the best objdump\n# available, choose the one first in the user's PATH.\nm4_defun([_LT_DECL_OBJDUMP],\n[AC_CHECK_TOOL(OBJDUMP, objdump, false)\ntest -z \"$OBJDUMP\" && OBJDUMP=objdump\n_LT_DECL([], [OBJDUMP], [1], [An object symbol dumper])\nAC_SUBST([OBJDUMP])\n])\n\n# _LT_DECL_DLLTOOL\n# ----------------\n# Ensure DLLTOOL variable is set.\nm4_defun([_LT_DECL_DLLTOOL],\n[AC_CHECK_TOOL(DLLTOOL, dlltool, false)\ntest -z \"$DLLTOOL\" && DLLTOOL=dlltool\n_LT_DECL([], [DLLTOOL], [1], [DLL creation program])\nAC_SUBST([DLLTOOL])\n])\n\n# _LT_DECL_SED\n# ------------\n# Check for a fully-functional sed program, that truncates\n# as few characters as possible.  Prefer GNU sed if found.\nm4_defun([_LT_DECL_SED],\n[AC_PROG_SED\ntest -z \"$SED\" && SED=sed\nXsed=\"$SED -e 1s/^X//\"\n_LT_DECL([], [SED], [1], [A sed program that does not truncate output])\n_LT_DECL([], [Xsed], [\"\\$SED -e 1s/^X//\"],\n    [Sed that helps us avoid accidentally triggering echo(1) options like -n])\n])# _LT_DECL_SED\n\nm4_ifndef([AC_PROG_SED], [\n############################################################\n# NOTE: This macro has been submitted for inclusion into   #\n#  GNU Autoconf as AC_PROG_SED.  When it is available in   #\n#  a released version of Autoconf we should remove this    #\n#  macro and use it instead.                               #\n############################################################\n\nm4_defun([AC_PROG_SED],\n[AC_MSG_CHECKING([for a sed that does not truncate output])\nAC_CACHE_VAL(lt_cv_path_SED,\n[# Loop through the user's path and test for sed and gsed.\n# Then use that list of sed's as ones to test for truncation.\nas_save_IFS=$IFS; IFS=$PATH_SEPARATOR\nfor as_dir in $PATH\ndo\n  IFS=$as_save_IFS\n  test -z \"$as_dir\" && as_dir=.\n  for lt_ac_prog in sed gsed; do\n    for ac_exec_ext in '' $ac_executable_extensions; do\n      if $as_executable_p \"$as_dir/$lt_ac_prog$ac_exec_ext\"; then\n        lt_ac_sed_list=\"$lt_ac_sed_list $as_dir/$lt_ac_prog$ac_exec_ext\"\n      fi\n    done\n  done\ndone\nIFS=$as_save_IFS\nlt_ac_max=0\nlt_ac_count=0\n# Add /usr/xpg4/bin/sed as it is typically found on Solaris\n# along with /bin/sed that truncates output.\nfor lt_ac_sed in $lt_ac_sed_list /usr/xpg4/bin/sed; do\n  test ! -f $lt_ac_sed && continue\n  cat /dev/null > conftest.in\n  lt_ac_count=0\n  echo $ECHO_N \"0123456789$ECHO_C\" >conftest.in\n  # Check for GNU sed and select it if it is found.\n  if \"$lt_ac_sed\" --version 2>&1 < /dev/null | grep 'GNU' > /dev/null; then\n    lt_cv_path_SED=$lt_ac_sed\n    break\n  fi\n  while true; do\n    cat conftest.in conftest.in >conftest.tmp\n    mv conftest.tmp conftest.in\n    cp conftest.in conftest.nl\n    echo >>conftest.nl\n    $lt_ac_sed -e 's/a$//' < conftest.nl >conftest.out || break\n    cmp -s conftest.out conftest.nl || break\n    # 10000 chars as input seems more than enough\n    test $lt_ac_count -gt 10 && break\n    lt_ac_count=`expr $lt_ac_count + 1`\n    if test $lt_ac_count -gt $lt_ac_max; then\n      lt_ac_max=$lt_ac_count\n      lt_cv_path_SED=$lt_ac_sed\n    fi\n  done\ndone\n])\nSED=$lt_cv_path_SED\nAC_SUBST([SED])\nAC_MSG_RESULT([$SED])\n])#AC_PROG_SED\n])#m4_ifndef\n\n# Old name:\nAU_ALIAS([LT_AC_PROG_SED], [AC_PROG_SED])\ndnl aclocal-1.4 backwards compatibility:\ndnl AC_DEFUN([LT_AC_PROG_SED], [])\n\n\n# _LT_CHECK_SHELL_FEATURES\n# ------------------------\n# Find out whether the shell is Bourne or XSI compatible,\n# or has some other useful features.\nm4_defun([_LT_CHECK_SHELL_FEATURES],\n[AC_MSG_CHECKING([whether the shell understands some XSI constructs])\n# Try some XSI features\nxsi_shell=no\n( _lt_dummy=\"a/b/c\"\n  test \"${_lt_dummy##*/},${_lt_dummy%/*},${_lt_dummy#??}\"${_lt_dummy%\"$_lt_dummy\"}, \\\n      = c,a/b,b/c, \\\n    && eval 'test $(( 1 + 1 )) -eq 2 \\\n    && test \"${#_lt_dummy}\" -eq 5' ) >/dev/null 2>&1 \\\n  && xsi_shell=yes\nAC_MSG_RESULT([$xsi_shell])\n_LT_CONFIG_LIBTOOL_INIT([xsi_shell='$xsi_shell'])\n\nAC_MSG_CHECKING([whether the shell understands \"+=\"])\nlt_shell_append=no\n( foo=bar; set foo baz; eval \"$[1]+=\\$[2]\" && test \"$foo\" = barbaz ) \\\n    >/dev/null 2>&1 \\\n  && lt_shell_append=yes\nAC_MSG_RESULT([$lt_shell_append])\n_LT_CONFIG_LIBTOOL_INIT([lt_shell_append='$lt_shell_append'])\n\nif ( (MAIL=60; unset MAIL) || exit) >/dev/null 2>&1; then\n  lt_unset=unset\nelse\n  lt_unset=false\nfi\n_LT_DECL([], [lt_unset], [0], [whether the shell understands \"unset\"])dnl\n\n# test EBCDIC or ASCII\ncase `echo X|tr X '\\101'` in\n A) # ASCII based system\n    # \\n is not interpreted correctly by Solaris 8 /usr/ucb/tr\n  lt_SP2NL='tr \\040 \\012'\n  lt_NL2SP='tr \\015\\012 \\040\\040'\n  ;;\n *) # EBCDIC based system\n  lt_SP2NL='tr \\100 \\n'\n  lt_NL2SP='tr \\r\\n \\100\\100'\n  ;;\nesac\n_LT_DECL([SP2NL], [lt_SP2NL], [1], [turn spaces into newlines])dnl\n_LT_DECL([NL2SP], [lt_NL2SP], [1], [turn newlines into spaces])dnl\n])# _LT_CHECK_SHELL_FEATURES\n\n\n# _LT_PROG_FUNCTION_REPLACE (FUNCNAME, REPLACEMENT-BODY)\n# ------------------------------------------------------\n# In `$cfgfile', look for function FUNCNAME delimited by `^FUNCNAME ()$' and\n# '^} FUNCNAME ', and replace its body with REPLACEMENT-BODY.\nm4_defun([_LT_PROG_FUNCTION_REPLACE],\n[dnl {\nsed -e '/^$1 ()$/,/^} # $1 /c\\\n$1 ()\\\n{\\\nm4_bpatsubsts([$2], [$], [\\\\], [^\\([\t ]\\)], [\\\\\\1])\n} # Extended-shell $1 implementation' \"$cfgfile\" > $cfgfile.tmp \\\n  && mv -f \"$cfgfile.tmp\" \"$cfgfile\" \\\n    || (rm -f \"$cfgfile\" && cp \"$cfgfile.tmp\" \"$cfgfile\" && rm -f \"$cfgfile.tmp\")\ntest 0 -eq $? || _lt_function_replace_fail=:\n])\n\n\n# _LT_PROG_REPLACE_SHELLFNS\n# -------------------------\n# Replace existing portable implementations of several shell functions with\n# equivalent extended shell implementations where those features are available..\nm4_defun([_LT_PROG_REPLACE_SHELLFNS],\n[if test x\"$xsi_shell\" = xyes; then\n  _LT_PROG_FUNCTION_REPLACE([func_dirname], [dnl\n    case ${1} in\n      */*) func_dirname_result=\"${1%/*}${2}\" ;;\n      *  ) func_dirname_result=\"${3}\" ;;\n    esac])\n\n  _LT_PROG_FUNCTION_REPLACE([func_basename], [dnl\n    func_basename_result=\"${1##*/}\"])\n\n  _LT_PROG_FUNCTION_REPLACE([func_dirname_and_basename], [dnl\n    case ${1} in\n      */*) func_dirname_result=\"${1%/*}${2}\" ;;\n      *  ) func_dirname_result=\"${3}\" ;;\n    esac\n    func_basename_result=\"${1##*/}\"])\n\n  _LT_PROG_FUNCTION_REPLACE([func_stripname], [dnl\n    # pdksh 5.2.14 does not do ${X%$Y} correctly if both X and Y are\n    # positional parameters, so assign one to ordinary parameter first.\n    func_stripname_result=${3}\n    func_stripname_result=${func_stripname_result#\"${1}\"}\n    func_stripname_result=${func_stripname_result%\"${2}\"}])\n\n  _LT_PROG_FUNCTION_REPLACE([func_split_long_opt], [dnl\n    func_split_long_opt_name=${1%%=*}\n    func_split_long_opt_arg=${1#*=}])\n\n  _LT_PROG_FUNCTION_REPLACE([func_split_short_opt], [dnl\n    func_split_short_opt_arg=${1#??}\n    func_split_short_opt_name=${1%\"$func_split_short_opt_arg\"}])\n\n  _LT_PROG_FUNCTION_REPLACE([func_lo2o], [dnl\n    case ${1} in\n      *.lo) func_lo2o_result=${1%.lo}.${objext} ;;\n      *)    func_lo2o_result=${1} ;;\n    esac])\n\n  _LT_PROG_FUNCTION_REPLACE([func_xform], [    func_xform_result=${1%.*}.lo])\n\n  _LT_PROG_FUNCTION_REPLACE([func_arith], [    func_arith_result=$(( $[*] ))])\n\n  _LT_PROG_FUNCTION_REPLACE([func_len], [    func_len_result=${#1}])\nfi\n\nif test x\"$lt_shell_append\" = xyes; then\n  _LT_PROG_FUNCTION_REPLACE([func_append], [    eval \"${1}+=\\\\${2}\"])\n\n  _LT_PROG_FUNCTION_REPLACE([func_append_quoted], [dnl\n    func_quote_for_eval \"${2}\"\ndnl m4 expansion turns \\\\\\\\ into \\\\, and then the shell eval turns that into \\\n    eval \"${1}+=\\\\\\\\ \\\\$func_quote_for_eval_result\"])\n\n  # Save a `func_append' function call where possible by direct use of '+='\n  sed -e 's%func_append \\([[a-zA-Z_]]\\{1,\\}\\) \"%\\1+=\"%g' $cfgfile > $cfgfile.tmp \\\n    && mv -f \"$cfgfile.tmp\" \"$cfgfile\" \\\n      || (rm -f \"$cfgfile\" && cp \"$cfgfile.tmp\" \"$cfgfile\" && rm -f \"$cfgfile.tmp\")\n  test 0 -eq $? || _lt_function_replace_fail=:\nelse\n  # Save a `func_append' function call even when '+=' is not available\n  sed -e 's%func_append \\([[a-zA-Z_]]\\{1,\\}\\) \"%\\1=\"$\\1%g' $cfgfile > $cfgfile.tmp \\\n    && mv -f \"$cfgfile.tmp\" \"$cfgfile\" \\\n      || (rm -f \"$cfgfile\" && cp \"$cfgfile.tmp\" \"$cfgfile\" && rm -f \"$cfgfile.tmp\")\n  test 0 -eq $? || _lt_function_replace_fail=:\nfi\n\nif test x\"$_lt_function_replace_fail\" = x\":\"; then\n  AC_MSG_WARN([Unable to substitute extended shell functions in $ofile])\nfi\n])\n\n# _LT_PATH_CONVERSION_FUNCTIONS\n# -----------------------------\n# Determine which file name conversion functions should be used by\n# func_to_host_file (and, implicitly, by func_to_host_path).  These are needed\n# for certain cross-compile configurations and native mingw.\nm4_defun([_LT_PATH_CONVERSION_FUNCTIONS],\n[AC_REQUIRE([AC_CANONICAL_HOST])dnl\nAC_REQUIRE([AC_CANONICAL_BUILD])dnl\nAC_MSG_CHECKING([how to convert $build file names to $host format])\nAC_CACHE_VAL(lt_cv_to_host_file_cmd,\n[case $host in\n  *-*-mingw* )\n    case $build in\n      *-*-mingw* ) # actually msys\n        lt_cv_to_host_file_cmd=func_convert_file_msys_to_w32\n        ;;\n      *-*-cygwin* )\n        lt_cv_to_host_file_cmd=func_convert_file_cygwin_to_w32\n        ;;\n      * ) # otherwise, assume *nix\n        lt_cv_to_host_file_cmd=func_convert_file_nix_to_w32\n        ;;\n    esac\n    ;;\n  *-*-cygwin* )\n    case $build in\n      *-*-mingw* ) # actually msys\n        lt_cv_to_host_file_cmd=func_convert_file_msys_to_cygwin\n        ;;\n      *-*-cygwin* )\n        lt_cv_to_host_file_cmd=func_convert_file_noop\n        ;;\n      * ) # otherwise, assume *nix\n        lt_cv_to_host_file_cmd=func_convert_file_nix_to_cygwin\n        ;;\n    esac\n    ;;\n  * ) # unhandled hosts (and \"normal\" native builds)\n    lt_cv_to_host_file_cmd=func_convert_file_noop\n    ;;\nesac\n])\nto_host_file_cmd=$lt_cv_to_host_file_cmd\nAC_MSG_RESULT([$lt_cv_to_host_file_cmd])\n_LT_DECL([to_host_file_cmd], [lt_cv_to_host_file_cmd],\n         [0], [convert $build file names to $host format])dnl\n\nAC_MSG_CHECKING([how to convert $build file names to toolchain format])\nAC_CACHE_VAL(lt_cv_to_tool_file_cmd,\n[#assume ordinary cross tools, or native build.\nlt_cv_to_tool_file_cmd=func_convert_file_noop\ncase $host in\n  *-*-mingw* )\n    case $build in\n      *-*-mingw* ) # actually msys\n        lt_cv_to_tool_file_cmd=func_convert_file_msys_to_w32\n        ;;\n    esac\n    ;;\nesac\n])\nto_tool_file_cmd=$lt_cv_to_tool_file_cmd\nAC_MSG_RESULT([$lt_cv_to_tool_file_cmd])\n_LT_DECL([to_tool_file_cmd], [lt_cv_to_tool_file_cmd],\n         [0], [convert $build files to toolchain format])dnl\n])# _LT_PATH_CONVERSION_FUNCTIONS\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/m4/ltoptions.m4",
    "content": "# Helper functions for option handling.                    -*- Autoconf -*-\n#\n#   Copyright (C) 2004, 2005, 2007, 2008, 2009 Free Software Foundation,\n#   Inc.\n#   Written by Gary V. Vaughan, 2004\n#\n# This file is free software; the Free Software Foundation gives\n# unlimited permission to copy and/or distribute it, with or without\n# modifications, as long as this notice is preserved.\n\n# serial 7 ltoptions.m4\n\n# This is to help aclocal find these macros, as it can't see m4_define.\nAC_DEFUN([LTOPTIONS_VERSION], [m4_if([1])])\n\n\n# _LT_MANGLE_OPTION(MACRO-NAME, OPTION-NAME)\n# ------------------------------------------\nm4_define([_LT_MANGLE_OPTION],\n[[_LT_OPTION_]m4_bpatsubst($1__$2, [[^a-zA-Z0-9_]], [_])])\n\n\n# _LT_SET_OPTION(MACRO-NAME, OPTION-NAME)\n# ---------------------------------------\n# Set option OPTION-NAME for macro MACRO-NAME, and if there is a\n# matching handler defined, dispatch to it.  Other OPTION-NAMEs are\n# saved as a flag.\nm4_define([_LT_SET_OPTION],\n[m4_define(_LT_MANGLE_OPTION([$1], [$2]))dnl\nm4_ifdef(_LT_MANGLE_DEFUN([$1], [$2]),\n        _LT_MANGLE_DEFUN([$1], [$2]),\n    [m4_warning([Unknown $1 option `$2'])])[]dnl\n])\n\n\n# _LT_IF_OPTION(MACRO-NAME, OPTION-NAME, IF-SET, [IF-NOT-SET])\n# ------------------------------------------------------------\n# Execute IF-SET if OPTION is set, IF-NOT-SET otherwise.\nm4_define([_LT_IF_OPTION],\n[m4_ifdef(_LT_MANGLE_OPTION([$1], [$2]), [$3], [$4])])\n\n\n# _LT_UNLESS_OPTIONS(MACRO-NAME, OPTION-LIST, IF-NOT-SET)\n# -------------------------------------------------------\n# Execute IF-NOT-SET unless all options in OPTION-LIST for MACRO-NAME\n# are set.\nm4_define([_LT_UNLESS_OPTIONS],\n[m4_foreach([_LT_Option], m4_split(m4_normalize([$2])),\n\t    [m4_ifdef(_LT_MANGLE_OPTION([$1], _LT_Option),\n\t\t      [m4_define([$0_found])])])[]dnl\nm4_ifdef([$0_found], [m4_undefine([$0_found])], [$3\n])[]dnl\n])\n\n\n# _LT_SET_OPTIONS(MACRO-NAME, OPTION-LIST)\n# ----------------------------------------\n# OPTION-LIST is a space-separated list of Libtool options associated\n# with MACRO-NAME.  If any OPTION has a matching handler declared with\n# LT_OPTION_DEFINE, dispatch to that macro; otherwise complain about\n# the unknown option and exit.\nm4_defun([_LT_SET_OPTIONS],\n[# Set options\nm4_foreach([_LT_Option], m4_split(m4_normalize([$2])),\n    [_LT_SET_OPTION([$1], _LT_Option)])\n\nm4_if([$1],[LT_INIT],[\n  dnl\n  dnl Simply set some default values (i.e off) if boolean options were not\n  dnl specified:\n  _LT_UNLESS_OPTIONS([LT_INIT], [dlopen], [enable_dlopen=no\n  ])\n  _LT_UNLESS_OPTIONS([LT_INIT], [win32-dll], [enable_win32_dll=no\n  ])\n  dnl\n  dnl If no reference was made to various pairs of opposing options, then\n  dnl we run the default mode handler for the pair.  For example, if neither\n  dnl `shared' nor `disable-shared' was passed, we enable building of shared\n  dnl archives by default:\n  _LT_UNLESS_OPTIONS([LT_INIT], [shared disable-shared], [_LT_ENABLE_SHARED])\n  _LT_UNLESS_OPTIONS([LT_INIT], [static disable-static], [_LT_ENABLE_STATIC])\n  _LT_UNLESS_OPTIONS([LT_INIT], [pic-only no-pic], [_LT_WITH_PIC])\n  _LT_UNLESS_OPTIONS([LT_INIT], [fast-install disable-fast-install],\n  \t\t   [_LT_ENABLE_FAST_INSTALL])\n  ])\n])# _LT_SET_OPTIONS\n\n\n## --------------------------------- ##\n## Macros to handle LT_INIT options. ##\n## --------------------------------- ##\n\n# _LT_MANGLE_DEFUN(MACRO-NAME, OPTION-NAME)\n# -----------------------------------------\nm4_define([_LT_MANGLE_DEFUN],\n[[_LT_OPTION_DEFUN_]m4_bpatsubst(m4_toupper([$1__$2]), [[^A-Z0-9_]], [_])])\n\n\n# LT_OPTION_DEFINE(MACRO-NAME, OPTION-NAME, CODE)\n# -----------------------------------------------\nm4_define([LT_OPTION_DEFINE],\n[m4_define(_LT_MANGLE_DEFUN([$1], [$2]), [$3])[]dnl\n])# LT_OPTION_DEFINE\n\n\n# dlopen\n# ------\nLT_OPTION_DEFINE([LT_INIT], [dlopen], [enable_dlopen=yes\n])\n\nAU_DEFUN([AC_LIBTOOL_DLOPEN],\n[_LT_SET_OPTION([LT_INIT], [dlopen])\nAC_DIAGNOSE([obsolete],\n[$0: Remove this warning and the call to _LT_SET_OPTION when you\nput the `dlopen' option into LT_INIT's first parameter.])\n])\n\ndnl aclocal-1.4 backwards compatibility:\ndnl AC_DEFUN([AC_LIBTOOL_DLOPEN], [])\n\n\n# win32-dll\n# ---------\n# Declare package support for building win32 dll's.\nLT_OPTION_DEFINE([LT_INIT], [win32-dll],\n[enable_win32_dll=yes\n\ncase $host in\n*-*-cygwin* | *-*-mingw* | *-*-pw32* | *-*-cegcc*)\n  AC_CHECK_TOOL(AS, as, false)\n  AC_CHECK_TOOL(DLLTOOL, dlltool, false)\n  AC_CHECK_TOOL(OBJDUMP, objdump, false)\n  ;;\nesac\n\ntest -z \"$AS\" && AS=as\n_LT_DECL([], [AS],      [1], [Assembler program])dnl\n\ntest -z \"$DLLTOOL\" && DLLTOOL=dlltool\n_LT_DECL([], [DLLTOOL], [1], [DLL creation program])dnl\n\ntest -z \"$OBJDUMP\" && OBJDUMP=objdump\n_LT_DECL([], [OBJDUMP], [1], [Object dumper program])dnl\n])# win32-dll\n\nAU_DEFUN([AC_LIBTOOL_WIN32_DLL],\n[AC_REQUIRE([AC_CANONICAL_HOST])dnl\n_LT_SET_OPTION([LT_INIT], [win32-dll])\nAC_DIAGNOSE([obsolete],\n[$0: Remove this warning and the call to _LT_SET_OPTION when you\nput the `win32-dll' option into LT_INIT's first parameter.])\n])\n\ndnl aclocal-1.4 backwards compatibility:\ndnl AC_DEFUN([AC_LIBTOOL_WIN32_DLL], [])\n\n\n# _LT_ENABLE_SHARED([DEFAULT])\n# ----------------------------\n# implement the --enable-shared flag, and supports the `shared' and\n# `disable-shared' LT_INIT options.\n# DEFAULT is either `yes' or `no'.  If omitted, it defaults to `yes'.\nm4_define([_LT_ENABLE_SHARED],\n[m4_define([_LT_ENABLE_SHARED_DEFAULT], [m4_if($1, no, no, yes)])dnl\nAC_ARG_ENABLE([shared],\n    [AS_HELP_STRING([--enable-shared@<:@=PKGS@:>@],\n\t[build shared libraries @<:@default=]_LT_ENABLE_SHARED_DEFAULT[@:>@])],\n    [p=${PACKAGE-default}\n    case $enableval in\n    yes) enable_shared=yes ;;\n    no) enable_shared=no ;;\n    *)\n      enable_shared=no\n      # Look at the argument we got.  We use all the common list separators.\n      lt_save_ifs=\"$IFS\"; IFS=\"${IFS}$PATH_SEPARATOR,\"\n      for pkg in $enableval; do\n\tIFS=\"$lt_save_ifs\"\n\tif test \"X$pkg\" = \"X$p\"; then\n\t  enable_shared=yes\n\tfi\n      done\n      IFS=\"$lt_save_ifs\"\n      ;;\n    esac],\n    [enable_shared=]_LT_ENABLE_SHARED_DEFAULT)\n\n    _LT_DECL([build_libtool_libs], [enable_shared], [0],\n\t[Whether or not to build shared libraries])\n])# _LT_ENABLE_SHARED\n\nLT_OPTION_DEFINE([LT_INIT], [shared], [_LT_ENABLE_SHARED([yes])])\nLT_OPTION_DEFINE([LT_INIT], [disable-shared], [_LT_ENABLE_SHARED([no])])\n\n# Old names:\nAC_DEFUN([AC_ENABLE_SHARED],\n[_LT_SET_OPTION([LT_INIT], m4_if([$1], [no], [disable-])[shared])\n])\n\nAC_DEFUN([AC_DISABLE_SHARED],\n[_LT_SET_OPTION([LT_INIT], [disable-shared])\n])\n\nAU_DEFUN([AM_ENABLE_SHARED], [AC_ENABLE_SHARED($@)])\nAU_DEFUN([AM_DISABLE_SHARED], [AC_DISABLE_SHARED($@)])\n\ndnl aclocal-1.4 backwards compatibility:\ndnl AC_DEFUN([AM_ENABLE_SHARED], [])\ndnl AC_DEFUN([AM_DISABLE_SHARED], [])\n\n\n\n# _LT_ENABLE_STATIC([DEFAULT])\n# ----------------------------\n# implement the --enable-static flag, and support the `static' and\n# `disable-static' LT_INIT options.\n# DEFAULT is either `yes' or `no'.  If omitted, it defaults to `yes'.\nm4_define([_LT_ENABLE_STATIC],\n[m4_define([_LT_ENABLE_STATIC_DEFAULT], [m4_if($1, no, no, yes)])dnl\nAC_ARG_ENABLE([static],\n    [AS_HELP_STRING([--enable-static@<:@=PKGS@:>@],\n\t[build static libraries @<:@default=]_LT_ENABLE_STATIC_DEFAULT[@:>@])],\n    [p=${PACKAGE-default}\n    case $enableval in\n    yes) enable_static=yes ;;\n    no) enable_static=no ;;\n    *)\n     enable_static=no\n      # Look at the argument we got.  We use all the common list separators.\n      lt_save_ifs=\"$IFS\"; IFS=\"${IFS}$PATH_SEPARATOR,\"\n      for pkg in $enableval; do\n\tIFS=\"$lt_save_ifs\"\n\tif test \"X$pkg\" = \"X$p\"; then\n\t  enable_static=yes\n\tfi\n      done\n      IFS=\"$lt_save_ifs\"\n      ;;\n    esac],\n    [enable_static=]_LT_ENABLE_STATIC_DEFAULT)\n\n    _LT_DECL([build_old_libs], [enable_static], [0],\n\t[Whether or not to build static libraries])\n])# _LT_ENABLE_STATIC\n\nLT_OPTION_DEFINE([LT_INIT], [static], [_LT_ENABLE_STATIC([yes])])\nLT_OPTION_DEFINE([LT_INIT], [disable-static], [_LT_ENABLE_STATIC([no])])\n\n# Old names:\nAC_DEFUN([AC_ENABLE_STATIC],\n[_LT_SET_OPTION([LT_INIT], m4_if([$1], [no], [disable-])[static])\n])\n\nAC_DEFUN([AC_DISABLE_STATIC],\n[_LT_SET_OPTION([LT_INIT], [disable-static])\n])\n\nAU_DEFUN([AM_ENABLE_STATIC], [AC_ENABLE_STATIC($@)])\nAU_DEFUN([AM_DISABLE_STATIC], [AC_DISABLE_STATIC($@)])\n\ndnl aclocal-1.4 backwards compatibility:\ndnl AC_DEFUN([AM_ENABLE_STATIC], [])\ndnl AC_DEFUN([AM_DISABLE_STATIC], [])\n\n\n\n# _LT_ENABLE_FAST_INSTALL([DEFAULT])\n# ----------------------------------\n# implement the --enable-fast-install flag, and support the `fast-install'\n# and `disable-fast-install' LT_INIT options.\n# DEFAULT is either `yes' or `no'.  If omitted, it defaults to `yes'.\nm4_define([_LT_ENABLE_FAST_INSTALL],\n[m4_define([_LT_ENABLE_FAST_INSTALL_DEFAULT], [m4_if($1, no, no, yes)])dnl\nAC_ARG_ENABLE([fast-install],\n    [AS_HELP_STRING([--enable-fast-install@<:@=PKGS@:>@],\n    [optimize for fast installation @<:@default=]_LT_ENABLE_FAST_INSTALL_DEFAULT[@:>@])],\n    [p=${PACKAGE-default}\n    case $enableval in\n    yes) enable_fast_install=yes ;;\n    no) enable_fast_install=no ;;\n    *)\n      enable_fast_install=no\n      # Look at the argument we got.  We use all the common list separators.\n      lt_save_ifs=\"$IFS\"; IFS=\"${IFS}$PATH_SEPARATOR,\"\n      for pkg in $enableval; do\n\tIFS=\"$lt_save_ifs\"\n\tif test \"X$pkg\" = \"X$p\"; then\n\t  enable_fast_install=yes\n\tfi\n      done\n      IFS=\"$lt_save_ifs\"\n      ;;\n    esac],\n    [enable_fast_install=]_LT_ENABLE_FAST_INSTALL_DEFAULT)\n\n_LT_DECL([fast_install], [enable_fast_install], [0],\n\t [Whether or not to optimize for fast installation])dnl\n])# _LT_ENABLE_FAST_INSTALL\n\nLT_OPTION_DEFINE([LT_INIT], [fast-install], [_LT_ENABLE_FAST_INSTALL([yes])])\nLT_OPTION_DEFINE([LT_INIT], [disable-fast-install], [_LT_ENABLE_FAST_INSTALL([no])])\n\n# Old names:\nAU_DEFUN([AC_ENABLE_FAST_INSTALL],\n[_LT_SET_OPTION([LT_INIT], m4_if([$1], [no], [disable-])[fast-install])\nAC_DIAGNOSE([obsolete],\n[$0: Remove this warning and the call to _LT_SET_OPTION when you put\nthe `fast-install' option into LT_INIT's first parameter.])\n])\n\nAU_DEFUN([AC_DISABLE_FAST_INSTALL],\n[_LT_SET_OPTION([LT_INIT], [disable-fast-install])\nAC_DIAGNOSE([obsolete],\n[$0: Remove this warning and the call to _LT_SET_OPTION when you put\nthe `disable-fast-install' option into LT_INIT's first parameter.])\n])\n\ndnl aclocal-1.4 backwards compatibility:\ndnl AC_DEFUN([AC_ENABLE_FAST_INSTALL], [])\ndnl AC_DEFUN([AM_DISABLE_FAST_INSTALL], [])\n\n\n# _LT_WITH_PIC([MODE])\n# --------------------\n# implement the --with-pic flag, and support the `pic-only' and `no-pic'\n# LT_INIT options.\n# MODE is either `yes' or `no'.  If omitted, it defaults to `both'.\nm4_define([_LT_WITH_PIC],\n[AC_ARG_WITH([pic],\n    [AS_HELP_STRING([--with-pic@<:@=PKGS@:>@],\n\t[try to use only PIC/non-PIC objects @<:@default=use both@:>@])],\n    [lt_p=${PACKAGE-default}\n    case $withval in\n    yes|no) pic_mode=$withval ;;\n    *)\n      pic_mode=default\n      # Look at the argument we got.  We use all the common list separators.\n      lt_save_ifs=\"$IFS\"; IFS=\"${IFS}$PATH_SEPARATOR,\"\n      for lt_pkg in $withval; do\n\tIFS=\"$lt_save_ifs\"\n\tif test \"X$lt_pkg\" = \"X$lt_p\"; then\n\t  pic_mode=yes\n\tfi\n      done\n      IFS=\"$lt_save_ifs\"\n      ;;\n    esac],\n    [pic_mode=default])\n\ntest -z \"$pic_mode\" && pic_mode=m4_default([$1], [default])\n\n_LT_DECL([], [pic_mode], [0], [What type of objects to build])dnl\n])# _LT_WITH_PIC\n\nLT_OPTION_DEFINE([LT_INIT], [pic-only], [_LT_WITH_PIC([yes])])\nLT_OPTION_DEFINE([LT_INIT], [no-pic], [_LT_WITH_PIC([no])])\n\n# Old name:\nAU_DEFUN([AC_LIBTOOL_PICMODE],\n[_LT_SET_OPTION([LT_INIT], [pic-only])\nAC_DIAGNOSE([obsolete],\n[$0: Remove this warning and the call to _LT_SET_OPTION when you\nput the `pic-only' option into LT_INIT's first parameter.])\n])\n\ndnl aclocal-1.4 backwards compatibility:\ndnl AC_DEFUN([AC_LIBTOOL_PICMODE], [])\n\n## ----------------- ##\n## LTDL_INIT Options ##\n## ----------------- ##\n\nm4_define([_LTDL_MODE], [])\nLT_OPTION_DEFINE([LTDL_INIT], [nonrecursive],\n\t\t [m4_define([_LTDL_MODE], [nonrecursive])])\nLT_OPTION_DEFINE([LTDL_INIT], [recursive],\n\t\t [m4_define([_LTDL_MODE], [recursive])])\nLT_OPTION_DEFINE([LTDL_INIT], [subproject],\n\t\t [m4_define([_LTDL_MODE], [subproject])])\n\nm4_define([_LTDL_TYPE], [])\nLT_OPTION_DEFINE([LTDL_INIT], [installable],\n\t\t [m4_define([_LTDL_TYPE], [installable])])\nLT_OPTION_DEFINE([LTDL_INIT], [convenience],\n\t\t [m4_define([_LTDL_TYPE], [convenience])])\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/m4/ltsugar.m4",
    "content": "# ltsugar.m4 -- libtool m4 base layer.                         -*-Autoconf-*-\n#\n# Copyright (C) 2004, 2005, 2007, 2008 Free Software Foundation, Inc.\n# Written by Gary V. Vaughan, 2004\n#\n# This file is free software; the Free Software Foundation gives\n# unlimited permission to copy and/or distribute it, with or without\n# modifications, as long as this notice is preserved.\n\n# serial 6 ltsugar.m4\n\n# This is to help aclocal find these macros, as it can't see m4_define.\nAC_DEFUN([LTSUGAR_VERSION], [m4_if([0.1])])\n\n\n# lt_join(SEP, ARG1, [ARG2...])\n# -----------------------------\n# Produce ARG1SEPARG2...SEPARGn, omitting [] arguments and their\n# associated separator.\n# Needed until we can rely on m4_join from Autoconf 2.62, since all earlier\n# versions in m4sugar had bugs.\nm4_define([lt_join],\n[m4_if([$#], [1], [],\n       [$#], [2], [[$2]],\n       [m4_if([$2], [], [], [[$2]_])$0([$1], m4_shift(m4_shift($@)))])])\nm4_define([_lt_join],\n[m4_if([$#$2], [2], [],\n       [m4_if([$2], [], [], [[$1$2]])$0([$1], m4_shift(m4_shift($@)))])])\n\n\n# lt_car(LIST)\n# lt_cdr(LIST)\n# ------------\n# Manipulate m4 lists.\n# These macros are necessary as long as will still need to support\n# Autoconf-2.59 which quotes differently.\nm4_define([lt_car], [[$1]])\nm4_define([lt_cdr],\n[m4_if([$#], 0, [m4_fatal([$0: cannot be called without arguments])],\n       [$#], 1, [],\n       [m4_dquote(m4_shift($@))])])\nm4_define([lt_unquote], $1)\n\n\n# lt_append(MACRO-NAME, STRING, [SEPARATOR])\n# ------------------------------------------\n# Redefine MACRO-NAME to hold its former content plus `SEPARATOR'`STRING'.\n# Note that neither SEPARATOR nor STRING are expanded; they are appended\n# to MACRO-NAME as is (leaving the expansion for when MACRO-NAME is invoked).\n# No SEPARATOR is output if MACRO-NAME was previously undefined (different\n# than defined and empty).\n#\n# This macro is needed until we can rely on Autoconf 2.62, since earlier\n# versions of m4sugar mistakenly expanded SEPARATOR but not STRING.\nm4_define([lt_append],\n[m4_define([$1],\n\t   m4_ifdef([$1], [m4_defn([$1])[$3]])[$2])])\n\n\n\n# lt_combine(SEP, PREFIX-LIST, INFIX, SUFFIX1, [SUFFIX2...])\n# ----------------------------------------------------------\n# Produce a SEP delimited list of all paired combinations of elements of\n# PREFIX-LIST with SUFFIX1 through SUFFIXn.  Each element of the list\n# has the form PREFIXmINFIXSUFFIXn.\n# Needed until we can rely on m4_combine added in Autoconf 2.62.\nm4_define([lt_combine],\n[m4_if(m4_eval([$# > 3]), [1],\n       [m4_pushdef([_Lt_sep], [m4_define([_Lt_sep], m4_defn([lt_car]))])]]dnl\n[[m4_foreach([_Lt_prefix], [$2],\n\t     [m4_foreach([_Lt_suffix],\n\t\t]m4_dquote(m4_dquote(m4_shift(m4_shift(m4_shift($@)))))[,\n\t[_Lt_sep([$1])[]m4_defn([_Lt_prefix])[$3]m4_defn([_Lt_suffix])])])])])\n\n\n# lt_if_append_uniq(MACRO-NAME, VARNAME, [SEPARATOR], [UNIQ], [NOT-UNIQ])\n# -----------------------------------------------------------------------\n# Iff MACRO-NAME does not yet contain VARNAME, then append it (delimited\n# by SEPARATOR if supplied) and expand UNIQ, else NOT-UNIQ.\nm4_define([lt_if_append_uniq],\n[m4_ifdef([$1],\n\t  [m4_if(m4_index([$3]m4_defn([$1])[$3], [$3$2$3]), [-1],\n\t\t [lt_append([$1], [$2], [$3])$4],\n\t\t [$5])],\n\t  [lt_append([$1], [$2], [$3])$4])])\n\n\n# lt_dict_add(DICT, KEY, VALUE)\n# -----------------------------\nm4_define([lt_dict_add],\n[m4_define([$1($2)], [$3])])\n\n\n# lt_dict_add_subkey(DICT, KEY, SUBKEY, VALUE)\n# --------------------------------------------\nm4_define([lt_dict_add_subkey],\n[m4_define([$1($2:$3)], [$4])])\n\n\n# lt_dict_fetch(DICT, KEY, [SUBKEY])\n# ----------------------------------\nm4_define([lt_dict_fetch],\n[m4_ifval([$3],\n\tm4_ifdef([$1($2:$3)], [m4_defn([$1($2:$3)])]),\n    m4_ifdef([$1($2)], [m4_defn([$1($2)])]))])\n\n\n# lt_if_dict_fetch(DICT, KEY, [SUBKEY], VALUE, IF-TRUE, [IF-FALSE])\n# -----------------------------------------------------------------\nm4_define([lt_if_dict_fetch],\n[m4_if(lt_dict_fetch([$1], [$2], [$3]), [$4],\n\t[$5],\n    [$6])])\n\n\n# lt_dict_filter(DICT, [SUBKEY], VALUE, [SEPARATOR], KEY, [...])\n# --------------------------------------------------------------\nm4_define([lt_dict_filter],\n[m4_if([$5], [], [],\n  [lt_join(m4_quote(m4_default([$4], [[, ]])),\n           lt_unquote(m4_split(m4_normalize(m4_foreach(_Lt_key, lt_car([m4_shiftn(4, $@)]),\n\t\t      [lt_if_dict_fetch([$1], _Lt_key, [$2], [$3], [_Lt_key ])])))))])[]dnl\n])\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/m4/ltversion.m4",
    "content": "# ltversion.m4 -- version numbers\t\t\t-*- Autoconf -*-\n#\n#   Copyright (C) 2004 Free Software Foundation, Inc.\n#   Written by Scott James Remnant, 2004\n#\n# This file is free software; the Free Software Foundation gives\n# unlimited permission to copy and/or distribute it, with or without\n# modifications, as long as this notice is preserved.\n\n# @configure_input@\n\n# serial 3337 ltversion.m4\n# This file is part of GNU Libtool\n\nm4_define([LT_PACKAGE_VERSION], [2.4.2])\nm4_define([LT_PACKAGE_REVISION], [1.3337])\n\nAC_DEFUN([LTVERSION_VERSION],\n[macro_version='2.4.2'\nmacro_revision='1.3337'\n_LT_DECL(, macro_version, 0, [Which release of libtool.m4 was used?])\n_LT_DECL(, macro_revision, 0)\n])\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/m4/lt~obsolete.m4",
    "content": "# lt~obsolete.m4 -- aclocal satisfying obsolete definitions.    -*-Autoconf-*-\n#\n#   Copyright (C) 2004, 2005, 2007, 2009 Free Software Foundation, Inc.\n#   Written by Scott James Remnant, 2004.\n#\n# This file is free software; the Free Software Foundation gives\n# unlimited permission to copy and/or distribute it, with or without\n# modifications, as long as this notice is preserved.\n\n# serial 5 lt~obsolete.m4\n\n# These exist entirely to fool aclocal when bootstrapping libtool.\n#\n# In the past libtool.m4 has provided macros via AC_DEFUN (or AU_DEFUN)\n# which have later been changed to m4_define as they aren't part of the\n# exported API, or moved to Autoconf or Automake where they belong.\n#\n# The trouble is, aclocal is a bit thick.  It'll see the old AC_DEFUN\n# in /usr/share/aclocal/libtool.m4 and remember it, then when it sees us\n# using a macro with the same name in our local m4/libtool.m4 it'll\n# pull the old libtool.m4 in (it doesn't see our shiny new m4_define\n# and doesn't know about Autoconf macros at all.)\n#\n# So we provide this file, which has a silly filename so it's always\n# included after everything else.  This provides aclocal with the\n# AC_DEFUNs it wants, but when m4 processes it, it doesn't do anything\n# because those macros already exist, or will be overwritten later.\n# We use AC_DEFUN over AU_DEFUN for compatibility with aclocal-1.6. \n#\n# Anytime we withdraw an AC_DEFUN or AU_DEFUN, remember to add it here.\n# Yes, that means every name once taken will need to remain here until\n# we give up compatibility with versions before 1.7, at which point\n# we need to keep only those names which we still refer to.\n\n# This is to help aclocal find these macros, as it can't see m4_define.\nAC_DEFUN([LTOBSOLETE_VERSION], [m4_if([1])])\n\nm4_ifndef([AC_LIBTOOL_LINKER_OPTION],\t[AC_DEFUN([AC_LIBTOOL_LINKER_OPTION])])\nm4_ifndef([AC_PROG_EGREP],\t\t[AC_DEFUN([AC_PROG_EGREP])])\nm4_ifndef([_LT_AC_PROG_ECHO_BACKSLASH],\t[AC_DEFUN([_LT_AC_PROG_ECHO_BACKSLASH])])\nm4_ifndef([_LT_AC_SHELL_INIT],\t\t[AC_DEFUN([_LT_AC_SHELL_INIT])])\nm4_ifndef([_LT_AC_SYS_LIBPATH_AIX],\t[AC_DEFUN([_LT_AC_SYS_LIBPATH_AIX])])\nm4_ifndef([_LT_PROG_LTMAIN],\t\t[AC_DEFUN([_LT_PROG_LTMAIN])])\nm4_ifndef([_LT_AC_TAGVAR],\t\t[AC_DEFUN([_LT_AC_TAGVAR])])\nm4_ifndef([AC_LTDL_ENABLE_INSTALL],\t[AC_DEFUN([AC_LTDL_ENABLE_INSTALL])])\nm4_ifndef([AC_LTDL_PREOPEN],\t\t[AC_DEFUN([AC_LTDL_PREOPEN])])\nm4_ifndef([_LT_AC_SYS_COMPILER],\t[AC_DEFUN([_LT_AC_SYS_COMPILER])])\nm4_ifndef([_LT_AC_LOCK],\t\t[AC_DEFUN([_LT_AC_LOCK])])\nm4_ifndef([AC_LIBTOOL_SYS_OLD_ARCHIVE],\t[AC_DEFUN([AC_LIBTOOL_SYS_OLD_ARCHIVE])])\nm4_ifndef([_LT_AC_TRY_DLOPEN_SELF],\t[AC_DEFUN([_LT_AC_TRY_DLOPEN_SELF])])\nm4_ifndef([AC_LIBTOOL_PROG_CC_C_O],\t[AC_DEFUN([AC_LIBTOOL_PROG_CC_C_O])])\nm4_ifndef([AC_LIBTOOL_SYS_HARD_LINK_LOCKS], [AC_DEFUN([AC_LIBTOOL_SYS_HARD_LINK_LOCKS])])\nm4_ifndef([AC_LIBTOOL_OBJDIR],\t\t[AC_DEFUN([AC_LIBTOOL_OBJDIR])])\nm4_ifndef([AC_LTDL_OBJDIR],\t\t[AC_DEFUN([AC_LTDL_OBJDIR])])\nm4_ifndef([AC_LIBTOOL_PROG_LD_HARDCODE_LIBPATH], [AC_DEFUN([AC_LIBTOOL_PROG_LD_HARDCODE_LIBPATH])])\nm4_ifndef([AC_LIBTOOL_SYS_LIB_STRIP],\t[AC_DEFUN([AC_LIBTOOL_SYS_LIB_STRIP])])\nm4_ifndef([AC_PATH_MAGIC],\t\t[AC_DEFUN([AC_PATH_MAGIC])])\nm4_ifndef([AC_PROG_LD_GNU],\t\t[AC_DEFUN([AC_PROG_LD_GNU])])\nm4_ifndef([AC_PROG_LD_RELOAD_FLAG],\t[AC_DEFUN([AC_PROG_LD_RELOAD_FLAG])])\nm4_ifndef([AC_DEPLIBS_CHECK_METHOD],\t[AC_DEFUN([AC_DEPLIBS_CHECK_METHOD])])\nm4_ifndef([AC_LIBTOOL_PROG_COMPILER_NO_RTTI], [AC_DEFUN([AC_LIBTOOL_PROG_COMPILER_NO_RTTI])])\nm4_ifndef([AC_LIBTOOL_SYS_GLOBAL_SYMBOL_PIPE], [AC_DEFUN([AC_LIBTOOL_SYS_GLOBAL_SYMBOL_PIPE])])\nm4_ifndef([AC_LIBTOOL_PROG_COMPILER_PIC], [AC_DEFUN([AC_LIBTOOL_PROG_COMPILER_PIC])])\nm4_ifndef([AC_LIBTOOL_PROG_LD_SHLIBS],\t[AC_DEFUN([AC_LIBTOOL_PROG_LD_SHLIBS])])\nm4_ifndef([AC_LIBTOOL_POSTDEP_PREDEP],\t[AC_DEFUN([AC_LIBTOOL_POSTDEP_PREDEP])])\nm4_ifndef([LT_AC_PROG_EGREP],\t\t[AC_DEFUN([LT_AC_PROG_EGREP])])\nm4_ifndef([LT_AC_PROG_SED],\t\t[AC_DEFUN([LT_AC_PROG_SED])])\nm4_ifndef([_LT_CC_BASENAME],\t\t[AC_DEFUN([_LT_CC_BASENAME])])\nm4_ifndef([_LT_COMPILER_BOILERPLATE],\t[AC_DEFUN([_LT_COMPILER_BOILERPLATE])])\nm4_ifndef([_LT_LINKER_BOILERPLATE],\t[AC_DEFUN([_LT_LINKER_BOILERPLATE])])\nm4_ifndef([_AC_PROG_LIBTOOL],\t\t[AC_DEFUN([_AC_PROG_LIBTOOL])])\nm4_ifndef([AC_LIBTOOL_SETUP],\t\t[AC_DEFUN([AC_LIBTOOL_SETUP])])\nm4_ifndef([_LT_AC_CHECK_DLFCN],\t\t[AC_DEFUN([_LT_AC_CHECK_DLFCN])])\nm4_ifndef([AC_LIBTOOL_SYS_DYNAMIC_LINKER],\t[AC_DEFUN([AC_LIBTOOL_SYS_DYNAMIC_LINKER])])\nm4_ifndef([_LT_AC_TAGCONFIG],\t\t[AC_DEFUN([_LT_AC_TAGCONFIG])])\nm4_ifndef([AC_DISABLE_FAST_INSTALL],\t[AC_DEFUN([AC_DISABLE_FAST_INSTALL])])\nm4_ifndef([_LT_AC_LANG_CXX],\t\t[AC_DEFUN([_LT_AC_LANG_CXX])])\nm4_ifndef([_LT_AC_LANG_F77],\t\t[AC_DEFUN([_LT_AC_LANG_F77])])\nm4_ifndef([_LT_AC_LANG_GCJ],\t\t[AC_DEFUN([_LT_AC_LANG_GCJ])])\nm4_ifndef([AC_LIBTOOL_LANG_C_CONFIG],\t[AC_DEFUN([AC_LIBTOOL_LANG_C_CONFIG])])\nm4_ifndef([_LT_AC_LANG_C_CONFIG],\t[AC_DEFUN([_LT_AC_LANG_C_CONFIG])])\nm4_ifndef([AC_LIBTOOL_LANG_CXX_CONFIG],\t[AC_DEFUN([AC_LIBTOOL_LANG_CXX_CONFIG])])\nm4_ifndef([_LT_AC_LANG_CXX_CONFIG],\t[AC_DEFUN([_LT_AC_LANG_CXX_CONFIG])])\nm4_ifndef([AC_LIBTOOL_LANG_F77_CONFIG],\t[AC_DEFUN([AC_LIBTOOL_LANG_F77_CONFIG])])\nm4_ifndef([_LT_AC_LANG_F77_CONFIG],\t[AC_DEFUN([_LT_AC_LANG_F77_CONFIG])])\nm4_ifndef([AC_LIBTOOL_LANG_GCJ_CONFIG],\t[AC_DEFUN([AC_LIBTOOL_LANG_GCJ_CONFIG])])\nm4_ifndef([_LT_AC_LANG_GCJ_CONFIG],\t[AC_DEFUN([_LT_AC_LANG_GCJ_CONFIG])])\nm4_ifndef([AC_LIBTOOL_LANG_RC_CONFIG],\t[AC_DEFUN([AC_LIBTOOL_LANG_RC_CONFIG])])\nm4_ifndef([_LT_AC_LANG_RC_CONFIG],\t[AC_DEFUN([_LT_AC_LANG_RC_CONFIG])])\nm4_ifndef([AC_LIBTOOL_CONFIG],\t\t[AC_DEFUN([AC_LIBTOOL_CONFIG])])\nm4_ifndef([_LT_AC_FILE_LTDLL_C],\t[AC_DEFUN([_LT_AC_FILE_LTDLL_C])])\nm4_ifndef([_LT_REQUIRED_DARWIN_CHECKS],\t[AC_DEFUN([_LT_REQUIRED_DARWIN_CHECKS])])\nm4_ifndef([_LT_AC_PROG_CXXCPP],\t\t[AC_DEFUN([_LT_AC_PROG_CXXCPP])])\nm4_ifndef([_LT_PREPARE_SED_QUOTE_VARS],\t[AC_DEFUN([_LT_PREPARE_SED_QUOTE_VARS])])\nm4_ifndef([_LT_PROG_ECHO_BACKSLASH],\t[AC_DEFUN([_LT_PROG_ECHO_BACKSLASH])])\nm4_ifndef([_LT_PROG_F77],\t\t[AC_DEFUN([_LT_PROG_F77])])\nm4_ifndef([_LT_PROG_FC],\t\t[AC_DEFUN([_LT_PROG_FC])])\nm4_ifndef([_LT_PROG_CXX],\t\t[AC_DEFUN([_LT_PROG_CXX])])\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/missing",
    "content": "#! /bin/sh\n# Common wrapper for a few potentially missing GNU programs.\n\nscriptversion=2013-10-28.13; # UTC\n\n# Copyright (C) 1996-2013 Free Software Foundation, Inc.\n# Originally written by Fran,cois Pinard <pinard@iro.umontreal.ca>, 1996.\n\n# This program is free software; you can redistribute it and/or modify\n# it under the terms of the GNU General Public License as published by\n# the Free Software Foundation; either version 2, or (at your option)\n# any later version.\n\n# This program is distributed in the hope that it will be useful,\n# but WITHOUT ANY WARRANTY; without even the implied warranty of\n# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n# GNU General Public License for more details.\n\n# You should have received a copy of the GNU General Public License\n# along with this program.  If not, see <http://www.gnu.org/licenses/>.\n\n# As a special exception to the GNU General Public License, if you\n# distribute this file as part of a program that contains a\n# configuration script generated by Autoconf, you may include it under\n# the same distribution terms that you use for the rest of that program.\n\nif test $# -eq 0; then\n  echo 1>&2 \"Try '$0 --help' for more information\"\n  exit 1\nfi\n\ncase $1 in\n\n  --is-lightweight)\n    # Used by our autoconf macros to check whether the available missing\n    # script is modern enough.\n    exit 0\n    ;;\n\n  --run)\n    # Back-compat with the calling convention used by older automake.\n    shift\n    ;;\n\n  -h|--h|--he|--hel|--help)\n    echo \"\\\n$0 [OPTION]... PROGRAM [ARGUMENT]...\n\nRun 'PROGRAM [ARGUMENT]...', returning a proper advice when this fails due\nto PROGRAM being missing or too old.\n\nOptions:\n  -h, --help      display this help and exit\n  -v, --version   output version information and exit\n\nSupported PROGRAM values:\n  aclocal   autoconf  autoheader   autom4te  automake  makeinfo\n  bison     yacc      flex         lex       help2man\n\nVersion suffixes to PROGRAM as well as the prefixes 'gnu-', 'gnu', and\n'g' are ignored when checking the name.\n\nSend bug reports to <bug-automake@gnu.org>.\"\n    exit $?\n    ;;\n\n  -v|--v|--ve|--ver|--vers|--versi|--versio|--version)\n    echo \"missing $scriptversion (GNU Automake)\"\n    exit $?\n    ;;\n\n  -*)\n    echo 1>&2 \"$0: unknown '$1' option\"\n    echo 1>&2 \"Try '$0 --help' for more information\"\n    exit 1\n    ;;\n\nesac\n\n# Run the given program, remember its exit status.\n\"$@\"; st=$?\n\n# If it succeeded, we are done.\ntest $st -eq 0 && exit 0\n\n# Also exit now if we it failed (or wasn't found), and '--version' was\n# passed; such an option is passed most likely to detect whether the\n# program is present and works.\ncase $2 in --version|--help) exit $st;; esac\n\n# Exit code 63 means version mismatch.  This often happens when the user\n# tries to use an ancient version of a tool on a file that requires a\n# minimum version.\nif test $st -eq 63; then\n  msg=\"probably too old\"\nelif test $st -eq 127; then\n  # Program was missing.\n  msg=\"missing on your system\"\nelse\n  # Program was found and executed, but failed.  Give up.\n  exit $st\nfi\n\nperl_URL=http://www.perl.org/\nflex_URL=http://flex.sourceforge.net/\ngnu_software_URL=http://www.gnu.org/software\n\nprogram_details ()\n{\n  case $1 in\n    aclocal|automake)\n      echo \"The '$1' program is part of the GNU Automake package:\"\n      echo \"<$gnu_software_URL/automake>\"\n      echo \"It also requires GNU Autoconf, GNU m4 and Perl in order to run:\"\n      echo \"<$gnu_software_URL/autoconf>\"\n      echo \"<$gnu_software_URL/m4/>\"\n      echo \"<$perl_URL>\"\n      ;;\n    autoconf|autom4te|autoheader)\n      echo \"The '$1' program is part of the GNU Autoconf package:\"\n      echo \"<$gnu_software_URL/autoconf/>\"\n      echo \"It also requires GNU m4 and Perl in order to run:\"\n      echo \"<$gnu_software_URL/m4/>\"\n      echo \"<$perl_URL>\"\n      ;;\n  esac\n}\n\ngive_advice ()\n{\n  # Normalize program name to check for.\n  normalized_program=`echo \"$1\" | sed '\n    s/^gnu-//; t\n    s/^gnu//; t\n    s/^g//; t'`\n\n  printf '%s\\n' \"'$1' is $msg.\"\n\n  configure_deps=\"'configure.ac' or m4 files included by 'configure.ac'\"\n  case $normalized_program in\n    autoconf*)\n      echo \"You should only need it if you modified 'configure.ac',\"\n      echo \"or m4 files included by it.\"\n      program_details 'autoconf'\n      ;;\n    autoheader*)\n      echo \"You should only need it if you modified 'acconfig.h' or\"\n      echo \"$configure_deps.\"\n      program_details 'autoheader'\n      ;;\n    automake*)\n      echo \"You should only need it if you modified 'Makefile.am' or\"\n      echo \"$configure_deps.\"\n      program_details 'automake'\n      ;;\n    aclocal*)\n      echo \"You should only need it if you modified 'acinclude.m4' or\"\n      echo \"$configure_deps.\"\n      program_details 'aclocal'\n      ;;\n   autom4te*)\n      echo \"You might have modified some maintainer files that require\"\n      echo \"the 'autom4te' program to be rebuilt.\"\n      program_details 'autom4te'\n      ;;\n    bison*|yacc*)\n      echo \"You should only need it if you modified a '.y' file.\"\n      echo \"You may want to install the GNU Bison package:\"\n      echo \"<$gnu_software_URL/bison/>\"\n      ;;\n    lex*|flex*)\n      echo \"You should only need it if you modified a '.l' file.\"\n      echo \"You may want to install the Fast Lexical Analyzer package:\"\n      echo \"<$flex_URL>\"\n      ;;\n    help2man*)\n      echo \"You should only need it if you modified a dependency\" \\\n           \"of a man page.\"\n      echo \"You may want to install the GNU Help2man package:\"\n      echo \"<$gnu_software_URL/help2man/>\"\n    ;;\n    makeinfo*)\n      echo \"You should only need it if you modified a '.texi' file, or\"\n      echo \"any other file indirectly affecting the aspect of the manual.\"\n      echo \"You might want to install the Texinfo package:\"\n      echo \"<$gnu_software_URL/texinfo/>\"\n      echo \"The spurious makeinfo call might also be the consequence of\"\n      echo \"using a buggy 'make' (AIX, DU, IRIX), in which case you might\"\n      echo \"want to install GNU make:\"\n      echo \"<$gnu_software_URL/make/>\"\n      ;;\n    *)\n      echo \"You might have modified some files without having the proper\"\n      echo \"tools for further handling them.  Check the 'README' file, it\"\n      echo \"often tells you about the needed prerequisites for installing\"\n      echo \"this package.  You may also peek at any GNU archive site, in\"\n      echo \"case some other package contains this missing '$1' program.\"\n      ;;\n  esac\n}\n\ngive_advice \"$1\" | sed -e '1s/^/WARNING: /' \\\n                       -e '2,$s/^/         /' >&2\n\n# Propagate the correct exit status (expected to be 127 for a program\n# not found, 63 for a program that failed due to version mismatch).\nexit $st\n\n# Local variables:\n# eval: (add-hook 'write-file-hooks 'time-stamp)\n# time-stamp-start: \"scriptversion=\"\n# time-stamp-format: \"%:y-%02m-%02d.%02H\"\n# time-stamp-time-zone: \"UTC\"\n# time-stamp-end: \"; # UTC\"\n# End:\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/Makefile.am",
    "content": "SUBDIRS = include lib script bin test extensions\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/Makefile.in",
    "content": "# Makefile.in generated by automake 1.14.1 from Makefile.am.\n# @configure_input@\n\n# Copyright (C) 1994-2013 Free Software Foundation, Inc.\n\n# This Makefile.in is free software; the Free Software Foundation\n# gives unlimited permission to copy and/or distribute it,\n# with or without modifications, as long as this notice is preserved.\n\n# This program is distributed in the hope that it will be useful,\n# but WITHOUT ANY WARRANTY, to the extent permitted by law; without\n# even the implied warranty of MERCHANTABILITY or FITNESS FOR A\n# PARTICULAR PURPOSE.\n\n@SET_MAKE@\nVPATH = @srcdir@\nam__is_gnu_make = test -n '$(MAKEFILE_LIST)' && test -n '$(MAKELEVEL)'\nam__make_running_with_option = \\\n  case $${target_option-} in \\\n      ?) ;; \\\n      *) echo \"am__make_running_with_option: internal error: invalid\" \\\n              \"target option '$${target_option-}' specified\" >&2; \\\n         exit 1;; \\\n  esac; \\\n  has_opt=no; \\\n  sane_makeflags=$$MAKEFLAGS; \\\n  if $(am__is_gnu_make); then \\\n    sane_makeflags=$$MFLAGS; \\\n  else \\\n    case $$MAKEFLAGS in \\\n      *\\\\[\\ \\\t]*) \\\n        bs=\\\\; \\\n        sane_makeflags=`printf '%s\\n' \"$$MAKEFLAGS\" \\\n          | sed \"s/$$bs$$bs[$$bs $$bs\t]*//g\"`;; \\\n    esac; \\\n  fi; \\\n  skip_next=no; \\\n  strip_trailopt () \\\n  { \\\n    flg=`printf '%s\\n' \"$$flg\" | sed \"s/$$1.*$$//\"`; \\\n  }; \\\n  for flg in $$sane_makeflags; do \\\n    test $$skip_next = yes && { skip_next=no; continue; }; \\\n    case $$flg in \\\n      *=*|--*) continue;; \\\n        -*I) strip_trailopt 'I'; skip_next=yes;; \\\n      -*I?*) strip_trailopt 'I';; \\\n        -*O) strip_trailopt 'O'; skip_next=yes;; \\\n      -*O?*) strip_trailopt 'O';; \\\n        -*l) strip_trailopt 'l'; skip_next=yes;; \\\n      -*l?*) strip_trailopt 'l';; \\\n      -[dEDm]) skip_next=yes;; \\\n      -[JT]) skip_next=yes;; \\\n    esac; \\\n    case $$flg in \\\n      *$$target_option*) has_opt=yes; break;; \\\n    esac; \\\n  done; \\\n  test $$has_opt = yes\nam__make_dryrun = (target_option=n; $(am__make_running_with_option))\nam__make_keepgoing = (target_option=k; $(am__make_running_with_option))\npkgdatadir = $(datadir)/@PACKAGE@\npkgincludedir = $(includedir)/@PACKAGE@\npkglibdir = $(libdir)/@PACKAGE@\npkglibexecdir = $(libexecdir)/@PACKAGE@\nam__cd = CDPATH=\"$${ZSH_VERSION+.}$(PATH_SEPARATOR)\" && cd\ninstall_sh_DATA = $(install_sh) -c -m 644\ninstall_sh_PROGRAM = $(install_sh) -c\ninstall_sh_SCRIPT = $(install_sh) -c\nINSTALL_HEADER = $(INSTALL_DATA)\ntransform = $(program_transform_name)\nNORMAL_INSTALL = :\nPRE_INSTALL = :\nPOST_INSTALL = :\nNORMAL_UNINSTALL = :\nPRE_UNINSTALL = :\nPOST_UNINSTALL = :\nbuild_triplet = @build@\nhost_triplet = @host@\nsubdir = src\nDIST_COMMON = $(srcdir)/Makefile.in $(srcdir)/Makefile.am\nACLOCAL_M4 = $(top_srcdir)/aclocal.m4\nam__aclocal_m4_deps = $(top_srcdir)/m4/ac_python_devel.m4 \\\n\t$(top_srcdir)/m4/libtool.m4 $(top_srcdir)/m4/ltoptions.m4 \\\n\t$(top_srcdir)/m4/ltsugar.m4 $(top_srcdir)/m4/ltversion.m4 \\\n\t$(top_srcdir)/m4/lt~obsolete.m4 $(top_srcdir)/configure.ac\nam__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \\\n\t$(ACLOCAL_M4)\nmkinstalldirs = $(install_sh) -d\nCONFIG_HEADER = $(top_builddir)/config.h \\\n\t$(top_builddir)/src/include/fst/config.h\nCONFIG_CLEAN_FILES =\nCONFIG_CLEAN_VPATH_FILES =\nAM_V_P = $(am__v_P_@AM_V@)\nam__v_P_ = $(am__v_P_@AM_DEFAULT_V@)\nam__v_P_0 = false\nam__v_P_1 = :\nAM_V_GEN = $(am__v_GEN_@AM_V@)\nam__v_GEN_ = $(am__v_GEN_@AM_DEFAULT_V@)\nam__v_GEN_0 = @echo \"  GEN     \" $@;\nam__v_GEN_1 = \nAM_V_at = $(am__v_at_@AM_V@)\nam__v_at_ = $(am__v_at_@AM_DEFAULT_V@)\nam__v_at_0 = @\nam__v_at_1 = \nSOURCES =\nDIST_SOURCES =\nRECURSIVE_TARGETS = all-recursive check-recursive cscopelist-recursive \\\n\tctags-recursive dvi-recursive html-recursive info-recursive \\\n\tinstall-data-recursive install-dvi-recursive \\\n\tinstall-exec-recursive install-html-recursive \\\n\tinstall-info-recursive install-pdf-recursive \\\n\tinstall-ps-recursive install-recursive installcheck-recursive \\\n\tinstalldirs-recursive pdf-recursive ps-recursive \\\n\ttags-recursive uninstall-recursive\nam__can_run_installinfo = \\\n  case $$AM_UPDATE_INFO_DIR in \\\n    n|no|NO) false;; \\\n    *) (install-info --version) >/dev/null 2>&1;; \\\n  esac\nRECURSIVE_CLEAN_TARGETS = mostlyclean-recursive clean-recursive\t\\\n  distclean-recursive maintainer-clean-recursive\nam__recursive_targets = \\\n  $(RECURSIVE_TARGETS) \\\n  $(RECURSIVE_CLEAN_TARGETS) \\\n  $(am__extra_recursive_targets)\nAM_RECURSIVE_TARGETS = $(am__recursive_targets:-recursive=) TAGS CTAGS \\\n\tdistdir\nam__tagged_files = $(HEADERS) $(SOURCES) $(TAGS_FILES) $(LISP)\n# Read a list of newline-separated strings from the standard input,\n# and print each of them once, without duplicates.  Input order is\n# *not* preserved.\nam__uniquify_input = $(AWK) '\\\n  BEGIN { nonempty = 0; } \\\n  { items[$$0] = 1; nonempty = 1; } \\\n  END { if (nonempty) { for (i in items) print i; }; } \\\n'\n# Make sure the list of sources is unique.  This is necessary because,\n# e.g., the same source file might be shared among _SOURCES variables\n# for different programs/libraries.\nam__define_uniq_tagged_files = \\\n  list='$(am__tagged_files)'; \\\n  unique=`for i in $$list; do \\\n    if test -f \"$$i\"; then echo $$i; else echo $(srcdir)/$$i; fi; \\\n  done | $(am__uniquify_input)`\nETAGS = etags\nCTAGS = ctags\nDIST_SUBDIRS = $(SUBDIRS)\nDISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST)\nam__relativize = \\\n  dir0=`pwd`; \\\n  sed_first='s,^\\([^/]*\\)/.*$$,\\1,'; \\\n  sed_rest='s,^[^/]*/*,,'; \\\n  sed_last='s,^.*/\\([^/]*\\)$$,\\1,'; \\\n  sed_butlast='s,/*[^/]*$$,,'; \\\n  while test -n \"$$dir1\"; do \\\n    first=`echo \"$$dir1\" | sed -e \"$$sed_first\"`; \\\n    if test \"$$first\" != \".\"; then \\\n      if test \"$$first\" = \"..\"; then \\\n        dir2=`echo \"$$dir0\" | sed -e \"$$sed_last\"`/\"$$dir2\"; \\\n        dir0=`echo \"$$dir0\" | sed -e \"$$sed_butlast\"`; \\\n      else \\\n        first2=`echo \"$$dir2\" | sed -e \"$$sed_first\"`; \\\n        if test \"$$first2\" = \"$$first\"; then \\\n          dir2=`echo \"$$dir2\" | sed -e \"$$sed_rest\"`; \\\n        else \\\n          dir2=\"../$$dir2\"; \\\n        fi; \\\n        dir0=\"$$dir0\"/\"$$first\"; \\\n      fi; \\\n    fi; \\\n    dir1=`echo \"$$dir1\" | sed -e \"$$sed_rest\"`; \\\n  done; \\\n  reldir=\"$$dir2\"\nACLOCAL = @ACLOCAL@\nAMTAR = @AMTAR@\nAM_DEFAULT_VERBOSITY = @AM_DEFAULT_VERBOSITY@\nAR = @AR@\nAUTOCONF = @AUTOCONF@\nAUTOHEADER = @AUTOHEADER@\nAUTOMAKE = @AUTOMAKE@\nAWK = @AWK@\nCC = @CC@\nCCDEPMODE = @CCDEPMODE@\nCFLAGS = @CFLAGS@\nCPP = @CPP@\nCPPFLAGS = @CPPFLAGS@\nCXX = @CXX@\nCXXCPP = @CXXCPP@\nCXXDEPMODE = @CXXDEPMODE@\nCXXFLAGS = @CXXFLAGS@\nCYGPATH_W = @CYGPATH_W@\nDEFS = @DEFS@\nDEPDIR = @DEPDIR@\nDLLTOOL = @DLLTOOL@\nDL_LIBS = @DL_LIBS@\nDSYMUTIL = @DSYMUTIL@\nDUMPBIN = @DUMPBIN@\nECHO_C = @ECHO_C@\nECHO_N = @ECHO_N@\nECHO_T = @ECHO_T@\nEGREP = @EGREP@\nEXEEXT = @EXEEXT@\nFGREP = @FGREP@\nGREP = @GREP@\nINSTALL = @INSTALL@\nINSTALL_DATA = @INSTALL_DATA@\nINSTALL_PROGRAM = @INSTALL_PROGRAM@\nINSTALL_SCRIPT = @INSTALL_SCRIPT@\nINSTALL_STRIP_PROGRAM = @INSTALL_STRIP_PROGRAM@\nLD = @LD@\nLDFLAGS = @LDFLAGS@\nLIBOBJS = @LIBOBJS@\nLIBS = @LIBS@\nLIBTOOL = @LIBTOOL@\nLIPO = @LIPO@\nLN_S = @LN_S@\nLTLIBOBJS = @LTLIBOBJS@\nMAKEINFO = @MAKEINFO@\nMANIFEST_TOOL = @MANIFEST_TOOL@\nMKDIR_P = @MKDIR_P@\nNM = @NM@\nNMEDIT = @NMEDIT@\nOBJDUMP = @OBJDUMP@\nOBJEXT = @OBJEXT@\nOTOOL = @OTOOL@\nOTOOL64 = @OTOOL64@\nPACKAGE = @PACKAGE@\nPACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@\nPACKAGE_NAME = @PACKAGE_NAME@\nPACKAGE_STRING = @PACKAGE_STRING@\nPACKAGE_TARNAME = @PACKAGE_TARNAME@\nPACKAGE_URL = @PACKAGE_URL@\nPACKAGE_VERSION = @PACKAGE_VERSION@\nPATH_SEPARATOR = @PATH_SEPARATOR@\nPYTHON = @PYTHON@\nPYTHON_CPPFLAGS = @PYTHON_CPPFLAGS@\nPYTHON_EXEC_PREFIX = @PYTHON_EXEC_PREFIX@\nPYTHON_EXTRA_LDFLAGS = @PYTHON_EXTRA_LDFLAGS@\nPYTHON_EXTRA_LIBS = @PYTHON_EXTRA_LIBS@\nPYTHON_LDFLAGS = @PYTHON_LDFLAGS@\nPYTHON_PLATFORM = @PYTHON_PLATFORM@\nPYTHON_PREFIX = @PYTHON_PREFIX@\nPYTHON_SITE_PKG = @PYTHON_SITE_PKG@\nPYTHON_VERSION = @PYTHON_VERSION@\nRANLIB = @RANLIB@\nSED = @SED@\nSET_MAKE = @SET_MAKE@\nSHELL = @SHELL@\nSTRIP = @STRIP@\nVERSION = @VERSION@\nabs_builddir = @abs_builddir@\nabs_srcdir = @abs_srcdir@\nabs_top_builddir = @abs_top_builddir@\nabs_top_srcdir = @abs_top_srcdir@\nac_ct_AR = @ac_ct_AR@\nac_ct_CC = @ac_ct_CC@\nac_ct_CXX = @ac_ct_CXX@\nac_ct_DUMPBIN = @ac_ct_DUMPBIN@\nam__include = @am__include@\nam__leading_dot = @am__leading_dot@\nam__quote = @am__quote@\nam__tar = @am__tar@\nam__untar = @am__untar@\nbindir = @bindir@\nbuild = @build@\nbuild_alias = @build_alias@\nbuild_cpu = @build_cpu@\nbuild_os = @build_os@\nbuild_vendor = @build_vendor@\nbuilddir = @builddir@\ndatadir = @datadir@\ndatarootdir = @datarootdir@\ndocdir = @docdir@\ndvidir = @dvidir@\nexec_prefix = @exec_prefix@\nhost = @host@\nhost_alias = @host_alias@\nhost_cpu = @host_cpu@\nhost_os = @host_os@\nhost_vendor = @host_vendor@\nhtmldir = @htmldir@\nincludedir = @includedir@\ninfodir = @infodir@\ninstall_sh = @install_sh@\nlibdir = @libdir@\nlibexecdir = @libexecdir@\nlibfstdir = @libfstdir@\nlocaledir = @localedir@\nlocalstatedir = @localstatedir@\nmandir = @mandir@\nmkdir_p = @mkdir_p@\noldincludedir = @oldincludedir@\npdfdir = @pdfdir@\npkgpyexecdir = @pkgpyexecdir@\npkgpythondir = @pkgpythondir@\nprefix = @prefix@\nprogram_transform_name = @program_transform_name@\npsdir = @psdir@\npyexecdir = @pyexecdir@\npythondir = @pythondir@\nsbindir = @sbindir@\nsharedstatedir = @sharedstatedir@\nsrcdir = @srcdir@\nsysconfdir = @sysconfdir@\ntarget_alias = @target_alias@\ntop_build_prefix = @top_build_prefix@\ntop_builddir = @top_builddir@\ntop_srcdir = @top_srcdir@\nSUBDIRS = include lib script bin test extensions\nall: all-recursive\n\n.SUFFIXES:\n$(srcdir)/Makefile.in:  $(srcdir)/Makefile.am  $(am__configure_deps)\n\t@for dep in $?; do \\\n\t  case '$(am__configure_deps)' in \\\n\t    *$$dep*) \\\n\t      ( cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh ) \\\n\t        && { if test -f $@; then exit 0; else break; fi; }; \\\n\t      exit 1;; \\\n\t  esac; \\\n\tdone; \\\n\techo ' cd $(top_srcdir) && $(AUTOMAKE) --foreign src/Makefile'; \\\n\t$(am__cd) $(top_srcdir) && \\\n\t  $(AUTOMAKE) --foreign src/Makefile\n.PRECIOUS: Makefile\nMakefile: $(srcdir)/Makefile.in $(top_builddir)/config.status\n\t@case '$?' in \\\n\t  *config.status*) \\\n\t    cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh;; \\\n\t  *) \\\n\t    echo ' cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe)'; \\\n\t    cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe);; \\\n\tesac;\n\n$(top_builddir)/config.status: $(top_srcdir)/configure $(CONFIG_STATUS_DEPENDENCIES)\n\tcd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh\n\n$(top_srcdir)/configure:  $(am__configure_deps)\n\tcd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh\n$(ACLOCAL_M4):  $(am__aclocal_m4_deps)\n\tcd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh\n$(am__aclocal_m4_deps):\n\nmostlyclean-libtool:\n\t-rm -f *.lo\n\nclean-libtool:\n\t-rm -rf .libs _libs\n\n# This directory's subdirectories are mostly independent; you can cd\n# into them and run 'make' without going through this Makefile.\n# To change the values of 'make' variables: instead of editing Makefiles,\n# (1) if the variable is set in 'config.status', edit 'config.status'\n#     (which will cause the Makefiles to be regenerated when you run 'make');\n# (2) otherwise, pass the desired values on the 'make' command line.\n$(am__recursive_targets):\n\t@fail=; \\\n\tif $(am__make_keepgoing); then \\\n\t  failcom='fail=yes'; \\\n\telse \\\n\t  failcom='exit 1'; \\\n\tfi; \\\n\tdot_seen=no; \\\n\ttarget=`echo $@ | sed s/-recursive//`; \\\n\tcase \"$@\" in \\\n\t  distclean-* | maintainer-clean-*) list='$(DIST_SUBDIRS)' ;; \\\n\t  *) list='$(SUBDIRS)' ;; \\\n\tesac; \\\n\tfor subdir in $$list; do \\\n\t  echo \"Making $$target in $$subdir\"; \\\n\t  if test \"$$subdir\" = \".\"; then \\\n\t    dot_seen=yes; \\\n\t    local_target=\"$$target-am\"; \\\n\t  else \\\n\t    local_target=\"$$target\"; \\\n\t  fi; \\\n\t  ($(am__cd) $$subdir && $(MAKE) $(AM_MAKEFLAGS) $$local_target) \\\n\t  || eval $$failcom; \\\n\tdone; \\\n\tif test \"$$dot_seen\" = \"no\"; then \\\n\t  $(MAKE) $(AM_MAKEFLAGS) \"$$target-am\" || exit 1; \\\n\tfi; test -z \"$$fail\"\n\nID: $(am__tagged_files)\n\t$(am__define_uniq_tagged_files); mkid -fID $$unique\ntags: tags-recursive\nTAGS: tags\n\ntags-am: $(TAGS_DEPENDENCIES) $(am__tagged_files)\n\tset x; \\\n\there=`pwd`; \\\n\tif ($(ETAGS) --etags-include --version) >/dev/null 2>&1; then \\\n\t  include_option=--etags-include; \\\n\t  empty_fix=.; \\\n\telse \\\n\t  include_option=--include; \\\n\t  empty_fix=; \\\n\tfi; \\\n\tlist='$(SUBDIRS)'; for subdir in $$list; do \\\n\t  if test \"$$subdir\" = .; then :; else \\\n\t    test ! -f $$subdir/TAGS || \\\n\t      set \"$$@\" \"$$include_option=$$here/$$subdir/TAGS\"; \\\n\t  fi; \\\n\tdone; \\\n\t$(am__define_uniq_tagged_files); \\\n\tshift; \\\n\tif test -z \"$(ETAGS_ARGS)$$*$$unique\"; then :; else \\\n\t  test -n \"$$unique\" || unique=$$empty_fix; \\\n\t  if test $$# -gt 0; then \\\n\t    $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \\\n\t      \"$$@\" $$unique; \\\n\t  else \\\n\t    $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \\\n\t      $$unique; \\\n\t  fi; \\\n\tfi\nctags: ctags-recursive\n\nCTAGS: ctags\nctags-am: $(TAGS_DEPENDENCIES) $(am__tagged_files)\n\t$(am__define_uniq_tagged_files); \\\n\ttest -z \"$(CTAGS_ARGS)$$unique\" \\\n\t  || $(CTAGS) $(CTAGSFLAGS) $(AM_CTAGSFLAGS) $(CTAGS_ARGS) \\\n\t     $$unique\n\nGTAGS:\n\there=`$(am__cd) $(top_builddir) && pwd` \\\n\t  && $(am__cd) $(top_srcdir) \\\n\t  && gtags -i $(GTAGS_ARGS) \"$$here\"\ncscopelist: cscopelist-recursive\n\ncscopelist-am: $(am__tagged_files)\n\tlist='$(am__tagged_files)'; \\\n\tcase \"$(srcdir)\" in \\\n\t  [\\\\/]* | ?:[\\\\/]*) sdir=\"$(srcdir)\" ;; \\\n\t  *) sdir=$(subdir)/$(srcdir) ;; \\\n\tesac; \\\n\tfor i in $$list; do \\\n\t  if test -f \"$$i\"; then \\\n\t    echo \"$(subdir)/$$i\"; \\\n\t  else \\\n\t    echo \"$$sdir/$$i\"; \\\n\t  fi; \\\n\tdone >> $(top_builddir)/cscope.files\n\ndistclean-tags:\n\t-rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags\n\ndistdir: $(DISTFILES)\n\t@srcdirstrip=`echo \"$(srcdir)\" | sed 's/[].[^$$\\\\*]/\\\\\\\\&/g'`; \\\n\ttopsrcdirstrip=`echo \"$(top_srcdir)\" | sed 's/[].[^$$\\\\*]/\\\\\\\\&/g'`; \\\n\tlist='$(DISTFILES)'; \\\n\t  dist_files=`for file in $$list; do echo $$file; done | \\\n\t  sed -e \"s|^$$srcdirstrip/||;t\" \\\n\t      -e \"s|^$$topsrcdirstrip/|$(top_builddir)/|;t\"`; \\\n\tcase $$dist_files in \\\n\t  */*) $(MKDIR_P) `echo \"$$dist_files\" | \\\n\t\t\t   sed '/\\//!d;s|^|$(distdir)/|;s,/[^/]*$$,,' | \\\n\t\t\t   sort -u` ;; \\\n\tesac; \\\n\tfor file in $$dist_files; do \\\n\t  if test -f $$file || test -d $$file; then d=.; else d=$(srcdir); fi; \\\n\t  if test -d $$d/$$file; then \\\n\t    dir=`echo \"/$$file\" | sed -e 's,/[^/]*$$,,'`; \\\n\t    if test -d \"$(distdir)/$$file\"; then \\\n\t      find \"$(distdir)/$$file\" -type d ! -perm -700 -exec chmod u+rwx {} \\;; \\\n\t    fi; \\\n\t    if test -d $(srcdir)/$$file && test $$d != $(srcdir); then \\\n\t      cp -fpR $(srcdir)/$$file \"$(distdir)$$dir\" || exit 1; \\\n\t      find \"$(distdir)/$$file\" -type d ! -perm -700 -exec chmod u+rwx {} \\;; \\\n\t    fi; \\\n\t    cp -fpR $$d/$$file \"$(distdir)$$dir\" || exit 1; \\\n\t  else \\\n\t    test -f \"$(distdir)/$$file\" \\\n\t    || cp -p $$d/$$file \"$(distdir)/$$file\" \\\n\t    || exit 1; \\\n\t  fi; \\\n\tdone\n\t@list='$(DIST_SUBDIRS)'; for subdir in $$list; do \\\n\t  if test \"$$subdir\" = .; then :; else \\\n\t    $(am__make_dryrun) \\\n\t      || test -d \"$(distdir)/$$subdir\" \\\n\t      || $(MKDIR_P) \"$(distdir)/$$subdir\" \\\n\t      || exit 1; \\\n\t    dir1=$$subdir; dir2=\"$(distdir)/$$subdir\"; \\\n\t    $(am__relativize); \\\n\t    new_distdir=$$reldir; \\\n\t    dir1=$$subdir; dir2=\"$(top_distdir)\"; \\\n\t    $(am__relativize); \\\n\t    new_top_distdir=$$reldir; \\\n\t    echo \" (cd $$subdir && $(MAKE) $(AM_MAKEFLAGS) top_distdir=\"$$new_top_distdir\" distdir=\"$$new_distdir\" \\\\\"; \\\n\t    echo \"     am__remove_distdir=: am__skip_length_check=: am__skip_mode_fix=: distdir)\"; \\\n\t    ($(am__cd) $$subdir && \\\n\t      $(MAKE) $(AM_MAKEFLAGS) \\\n\t        top_distdir=\"$$new_top_distdir\" \\\n\t        distdir=\"$$new_distdir\" \\\n\t\tam__remove_distdir=: \\\n\t\tam__skip_length_check=: \\\n\t\tam__skip_mode_fix=: \\\n\t        distdir) \\\n\t      || exit 1; \\\n\t  fi; \\\n\tdone\ncheck-am: all-am\ncheck: check-recursive\nall-am: Makefile\ninstalldirs: installdirs-recursive\ninstalldirs-am:\ninstall: install-recursive\ninstall-exec: install-exec-recursive\ninstall-data: install-data-recursive\nuninstall: uninstall-recursive\n\ninstall-am: all-am\n\t@$(MAKE) $(AM_MAKEFLAGS) install-exec-am install-data-am\n\ninstallcheck: installcheck-recursive\ninstall-strip:\n\tif test -z '$(STRIP)'; then \\\n\t  $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" \\\n\t    install_sh_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" INSTALL_STRIP_FLAG=-s \\\n\t      install; \\\n\telse \\\n\t  $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" \\\n\t    install_sh_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" INSTALL_STRIP_FLAG=-s \\\n\t    \"INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'\" install; \\\n\tfi\nmostlyclean-generic:\n\nclean-generic:\n\ndistclean-generic:\n\t-test -z \"$(CONFIG_CLEAN_FILES)\" || rm -f $(CONFIG_CLEAN_FILES)\n\t-test . = \"$(srcdir)\" || test -z \"$(CONFIG_CLEAN_VPATH_FILES)\" || rm -f $(CONFIG_CLEAN_VPATH_FILES)\n\nmaintainer-clean-generic:\n\t@echo \"This command is intended for maintainers to use\"\n\t@echo \"it deletes files that may require special tools to rebuild.\"\nclean: clean-recursive\n\nclean-am: clean-generic clean-libtool mostlyclean-am\n\ndistclean: distclean-recursive\n\t-rm -f Makefile\ndistclean-am: clean-am distclean-generic distclean-tags\n\ndvi: dvi-recursive\n\ndvi-am:\n\nhtml: html-recursive\n\nhtml-am:\n\ninfo: info-recursive\n\ninfo-am:\n\ninstall-data-am:\n\ninstall-dvi: install-dvi-recursive\n\ninstall-dvi-am:\n\ninstall-exec-am:\n\ninstall-html: install-html-recursive\n\ninstall-html-am:\n\ninstall-info: install-info-recursive\n\ninstall-info-am:\n\ninstall-man:\n\ninstall-pdf: install-pdf-recursive\n\ninstall-pdf-am:\n\ninstall-ps: install-ps-recursive\n\ninstall-ps-am:\n\ninstallcheck-am:\n\nmaintainer-clean: maintainer-clean-recursive\n\t-rm -f Makefile\nmaintainer-clean-am: distclean-am maintainer-clean-generic\n\nmostlyclean: mostlyclean-recursive\n\nmostlyclean-am: mostlyclean-generic mostlyclean-libtool\n\npdf: pdf-recursive\n\npdf-am:\n\nps: ps-recursive\n\nps-am:\n\nuninstall-am:\n\n.MAKE: $(am__recursive_targets) install-am install-strip\n\n.PHONY: $(am__recursive_targets) CTAGS GTAGS TAGS all all-am check \\\n\tcheck-am clean clean-generic clean-libtool cscopelist-am ctags \\\n\tctags-am distclean distclean-generic distclean-libtool \\\n\tdistclean-tags distdir dvi dvi-am html html-am info info-am \\\n\tinstall install-am install-data install-data-am install-dvi \\\n\tinstall-dvi-am install-exec install-exec-am install-html \\\n\tinstall-html-am install-info install-info-am install-man \\\n\tinstall-pdf install-pdf-am install-ps install-ps-am \\\n\tinstall-strip installcheck installcheck-am installdirs \\\n\tinstalldirs-am maintainer-clean maintainer-clean-generic \\\n\tmostlyclean mostlyclean-generic mostlyclean-libtool pdf pdf-am \\\n\tps ps-am tags tags-am uninstall uninstall-am\n\n\n# Tell versions [3.59,3.63) of GNU make to not export all variables.\n# Otherwise a system limit (for SysV at least) may be exceeded.\n.NOEXPORT:\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/bin/Makefile.am",
    "content": "AM_CPPFLAGS = -I$(srcdir)/../include -I$(srcdir)/../script $(ICU_FLAGS)\nLDADD = ../script/libfstscript.la ../lib/libfst.la -lm $(DL_LIBS)\n\nif HAVE_BIN\nbin_PROGRAMS = fstarcsort fstclosure fstcompile fstcompose fstconcat \\\nfstconnect fstconvert fstdeterminize fstdifference fstdisambiguate fstdraw \\\nfstencode fstepsnormalize fstequal fstequivalent fstinfo fstintersect \\\nfstinvert fstisomorphic fstmap fstminimize fstprint fstproject fstprune \\\nfstpush fstrandgen fstrelabel fstreplace fstreverse fstreweight fstrmepsilon \\\nfstshortestdistance fstshortestpath fstsymbols fstsynchronize fsttopsort \\\nfstunion\n\nfstarcsort_SOURCES = fstarcsort.cc fstarcsort-main.cc\n\nfstclosure_SOURCES = fstclosure.cc fstclosure-main.cc\n\nfstcompile_SOURCES = fstcompile.cc fstcompile-main.cc\n\nfstcompose_SOURCES = fstcompose.cc fstcompose-main.cc\n\nfstconcat_SOURCES = fstconcat.cc fstconcat-main.cc\n\nfstconnect_SOURCES = fstconnect.cc fstconnect-main.cc\n\nfstconvert_SOURCES = fstconvert.cc fstconvert-main.cc\n\nfstdeterminize_SOURCES = fstdeterminize.cc fstdeterminize-main.cc\n\nfstdifference_SOURCES = fstdifference.cc fstdifference-main.cc\n\nfstdisambiguate_SOURCES = fstdisambiguate.cc fstdisambiguate-main.cc\n\nfstdraw_SOURCES = fstdraw.cc fstdraw-main.cc\n\nfstencode_SOURCES = fstencode.cc fstencode-main.cc\n\nfstepsnormalize_SOURCES = fstepsnormalize.cc fstepsnormalize-main.cc\n\nfstequal_SOURCES = fstequal.cc fstequal-main.cc\n\nfstequivalent_SOURCES = fstequivalent.cc fstequivalent-main.cc\n\nfstinfo_SOURCES = fstinfo.cc fstinfo-main.cc\n\nfstintersect_SOURCES = fstintersect.cc fstintersect-main.cc\n\nfstinvert_SOURCES = fstinvert.cc fstinvert-main.cc\n\nfstisomorphic_SOURCES = fstisomorphic.cc fstisomorphic-main.cc\n\nfstmap_SOURCES = fstmap.cc fstmap-main.cc\n\nfstminimize_SOURCES = fstminimize.cc fstminimize-main.cc\n\nfstprint_SOURCES = fstprint.cc fstprint-main.cc\n\nfstproject_SOURCES = fstproject.cc fstproject-main.cc\n\nfstprune_SOURCES = fstprune.cc fstprune-main.cc\n\nfstpush_SOURCES = fstpush.cc fstpush-main.cc\n\nfstrandgen_SOURCES = fstrandgen.cc fstrandgen-main.cc\n\nfstrelabel_SOURCES = fstrelabel.cc fstrelabel-main.cc\n\nfstreplace_SOURCES = fstreplace.cc fstreplace-main.cc\n\nfstreverse_SOURCES = fstreverse.cc fstreverse-main.cc\n\nfstreweight_SOURCES = fstreweight.cc fstreweight-main.cc\n\nfstrmepsilon_SOURCES = fstrmepsilon.cc fstrmepsilon-main.cc\n\nfstshortestdistance_SOURCES = fstshortestdistance.cc fstshortestdistance-main.cc\n\nfstshortestpath_SOURCES = fstshortestpath.cc fstshortestpath-main.cc\n\nfstsymbols_SOURCES = fstsymbols.cc fstsymbols-main.cc\n\nfstsynchronize_SOURCES = fstsynchronize.cc fstsynchronize-main.cc\n \nfsttopsort_SOURCES = fsttopsort.cc fsttopsort-main.cc\n\nfstunion_SOURCES = fstunion.cc fstunion-main.cc\nendif\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/bin/Makefile.in",
    "content": "# Makefile.in generated by automake 1.14.1 from Makefile.am.\n# @configure_input@\n\n# Copyright (C) 1994-2013 Free Software Foundation, Inc.\n\n# This Makefile.in is free software; the Free Software Foundation\n# gives unlimited permission to copy and/or distribute it,\n# with or without modifications, as long as this notice is preserved.\n\n# This program is distributed in the hope that it will be useful,\n# but WITHOUT ANY WARRANTY, to the extent permitted by law; without\n# even the implied warranty of MERCHANTABILITY or FITNESS FOR A\n# PARTICULAR PURPOSE.\n\n@SET_MAKE@\n\nVPATH = @srcdir@\nam__is_gnu_make = test -n '$(MAKEFILE_LIST)' && test -n '$(MAKELEVEL)'\nam__make_running_with_option = \\\n  case $${target_option-} in \\\n      ?) ;; \\\n      *) echo \"am__make_running_with_option: internal error: invalid\" \\\n              \"target option '$${target_option-}' specified\" >&2; \\\n         exit 1;; \\\n  esac; \\\n  has_opt=no; \\\n  sane_makeflags=$$MAKEFLAGS; \\\n  if $(am__is_gnu_make); then \\\n    sane_makeflags=$$MFLAGS; \\\n  else \\\n    case $$MAKEFLAGS in \\\n      *\\\\[\\ \\\t]*) \\\n        bs=\\\\; \\\n        sane_makeflags=`printf '%s\\n' \"$$MAKEFLAGS\" \\\n          | sed \"s/$$bs$$bs[$$bs $$bs\t]*//g\"`;; \\\n    esac; \\\n  fi; \\\n  skip_next=no; \\\n  strip_trailopt () \\\n  { \\\n    flg=`printf '%s\\n' \"$$flg\" | sed \"s/$$1.*$$//\"`; \\\n  }; \\\n  for flg in $$sane_makeflags; do \\\n    test $$skip_next = yes && { skip_next=no; continue; }; \\\n    case $$flg in \\\n      *=*|--*) continue;; \\\n        -*I) strip_trailopt 'I'; skip_next=yes;; \\\n      -*I?*) strip_trailopt 'I';; \\\n        -*O) strip_trailopt 'O'; skip_next=yes;; \\\n      -*O?*) strip_trailopt 'O';; \\\n        -*l) strip_trailopt 'l'; skip_next=yes;; \\\n      -*l?*) strip_trailopt 'l';; \\\n      -[dEDm]) skip_next=yes;; \\\n      -[JT]) skip_next=yes;; \\\n    esac; \\\n    case $$flg in \\\n      *$$target_option*) has_opt=yes; break;; \\\n    esac; \\\n  done; \\\n  test $$has_opt = yes\nam__make_dryrun = (target_option=n; $(am__make_running_with_option))\nam__make_keepgoing = (target_option=k; $(am__make_running_with_option))\npkgdatadir = $(datadir)/@PACKAGE@\npkgincludedir = $(includedir)/@PACKAGE@\npkglibdir = $(libdir)/@PACKAGE@\npkglibexecdir = $(libexecdir)/@PACKAGE@\nam__cd = CDPATH=\"$${ZSH_VERSION+.}$(PATH_SEPARATOR)\" && cd\ninstall_sh_DATA = $(install_sh) -c -m 644\ninstall_sh_PROGRAM = $(install_sh) -c\ninstall_sh_SCRIPT = $(install_sh) -c\nINSTALL_HEADER = $(INSTALL_DATA)\ntransform = $(program_transform_name)\nNORMAL_INSTALL = :\nPRE_INSTALL = :\nPOST_INSTALL = :\nNORMAL_UNINSTALL = :\nPRE_UNINSTALL = :\nPOST_UNINSTALL = :\nbuild_triplet = @build@\nhost_triplet = @host@\n@HAVE_BIN_TRUE@bin_PROGRAMS = fstarcsort$(EXEEXT) fstclosure$(EXEEXT) \\\n@HAVE_BIN_TRUE@\tfstcompile$(EXEEXT) fstcompose$(EXEEXT) \\\n@HAVE_BIN_TRUE@\tfstconcat$(EXEEXT) fstconnect$(EXEEXT) \\\n@HAVE_BIN_TRUE@\tfstconvert$(EXEEXT) fstdeterminize$(EXEEXT) \\\n@HAVE_BIN_TRUE@\tfstdifference$(EXEEXT) fstdisambiguate$(EXEEXT) \\\n@HAVE_BIN_TRUE@\tfstdraw$(EXEEXT) fstencode$(EXEEXT) \\\n@HAVE_BIN_TRUE@\tfstepsnormalize$(EXEEXT) fstequal$(EXEEXT) \\\n@HAVE_BIN_TRUE@\tfstequivalent$(EXEEXT) fstinfo$(EXEEXT) \\\n@HAVE_BIN_TRUE@\tfstintersect$(EXEEXT) fstinvert$(EXEEXT) \\\n@HAVE_BIN_TRUE@\tfstisomorphic$(EXEEXT) fstmap$(EXEEXT) \\\n@HAVE_BIN_TRUE@\tfstminimize$(EXEEXT) fstprint$(EXEEXT) \\\n@HAVE_BIN_TRUE@\tfstproject$(EXEEXT) fstprune$(EXEEXT) \\\n@HAVE_BIN_TRUE@\tfstpush$(EXEEXT) fstrandgen$(EXEEXT) \\\n@HAVE_BIN_TRUE@\tfstrelabel$(EXEEXT) fstreplace$(EXEEXT) \\\n@HAVE_BIN_TRUE@\tfstreverse$(EXEEXT) fstreweight$(EXEEXT) \\\n@HAVE_BIN_TRUE@\tfstrmepsilon$(EXEEXT) \\\n@HAVE_BIN_TRUE@\tfstshortestdistance$(EXEEXT) \\\n@HAVE_BIN_TRUE@\tfstshortestpath$(EXEEXT) fstsymbols$(EXEEXT) \\\n@HAVE_BIN_TRUE@\tfstsynchronize$(EXEEXT) fsttopsort$(EXEEXT) \\\n@HAVE_BIN_TRUE@\tfstunion$(EXEEXT)\nsubdir = src/bin\nDIST_COMMON = $(srcdir)/Makefile.in $(srcdir)/Makefile.am \\\n\t$(top_srcdir)/depcomp\nACLOCAL_M4 = $(top_srcdir)/aclocal.m4\nam__aclocal_m4_deps = $(top_srcdir)/m4/ac_python_devel.m4 \\\n\t$(top_srcdir)/m4/libtool.m4 $(top_srcdir)/m4/ltoptions.m4 \\\n\t$(top_srcdir)/m4/ltsugar.m4 $(top_srcdir)/m4/ltversion.m4 \\\n\t$(top_srcdir)/m4/lt~obsolete.m4 $(top_srcdir)/configure.ac\nam__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \\\n\t$(ACLOCAL_M4)\nmkinstalldirs = $(install_sh) -d\nCONFIG_HEADER = $(top_builddir)/config.h \\\n\t$(top_builddir)/src/include/fst/config.h\nCONFIG_CLEAN_FILES =\nCONFIG_CLEAN_VPATH_FILES =\nam__installdirs = \"$(DESTDIR)$(bindir)\"\nPROGRAMS = $(bin_PROGRAMS)\nam__fstarcsort_SOURCES_DIST = fstarcsort.cc fstarcsort-main.cc\n@HAVE_BIN_TRUE@am_fstarcsort_OBJECTS = fstarcsort.$(OBJEXT) \\\n@HAVE_BIN_TRUE@\tfstarcsort-main.$(OBJEXT)\nfstarcsort_OBJECTS = $(am_fstarcsort_OBJECTS)\nfstarcsort_LDADD = $(LDADD)\nam__DEPENDENCIES_1 =\nfstarcsort_DEPENDENCIES = ../script/libfstscript.la ../lib/libfst.la \\\n\t$(am__DEPENDENCIES_1)\nAM_V_lt = $(am__v_lt_@AM_V@)\nam__v_lt_ = $(am__v_lt_@AM_DEFAULT_V@)\nam__v_lt_0 = --silent\nam__v_lt_1 = \nam__fstclosure_SOURCES_DIST = fstclosure.cc fstclosure-main.cc\n@HAVE_BIN_TRUE@am_fstclosure_OBJECTS = fstclosure.$(OBJEXT) \\\n@HAVE_BIN_TRUE@\tfstclosure-main.$(OBJEXT)\nfstclosure_OBJECTS = $(am_fstclosure_OBJECTS)\nfstclosure_LDADD = $(LDADD)\nfstclosure_DEPENDENCIES = ../script/libfstscript.la ../lib/libfst.la \\\n\t$(am__DEPENDENCIES_1)\nam__fstcompile_SOURCES_DIST = fstcompile.cc fstcompile-main.cc\n@HAVE_BIN_TRUE@am_fstcompile_OBJECTS = fstcompile.$(OBJEXT) \\\n@HAVE_BIN_TRUE@\tfstcompile-main.$(OBJEXT)\nfstcompile_OBJECTS = $(am_fstcompile_OBJECTS)\nfstcompile_LDADD = $(LDADD)\nfstcompile_DEPENDENCIES = ../script/libfstscript.la ../lib/libfst.la \\\n\t$(am__DEPENDENCIES_1)\nam__fstcompose_SOURCES_DIST = fstcompose.cc fstcompose-main.cc\n@HAVE_BIN_TRUE@am_fstcompose_OBJECTS = fstcompose.$(OBJEXT) \\\n@HAVE_BIN_TRUE@\tfstcompose-main.$(OBJEXT)\nfstcompose_OBJECTS = $(am_fstcompose_OBJECTS)\nfstcompose_LDADD = $(LDADD)\nfstcompose_DEPENDENCIES = ../script/libfstscript.la ../lib/libfst.la \\\n\t$(am__DEPENDENCIES_1)\nam__fstconcat_SOURCES_DIST = fstconcat.cc fstconcat-main.cc\n@HAVE_BIN_TRUE@am_fstconcat_OBJECTS = fstconcat.$(OBJEXT) \\\n@HAVE_BIN_TRUE@\tfstconcat-main.$(OBJEXT)\nfstconcat_OBJECTS = $(am_fstconcat_OBJECTS)\nfstconcat_LDADD = $(LDADD)\nfstconcat_DEPENDENCIES = ../script/libfstscript.la ../lib/libfst.la \\\n\t$(am__DEPENDENCIES_1)\nam__fstconnect_SOURCES_DIST = fstconnect.cc fstconnect-main.cc\n@HAVE_BIN_TRUE@am_fstconnect_OBJECTS = fstconnect.$(OBJEXT) \\\n@HAVE_BIN_TRUE@\tfstconnect-main.$(OBJEXT)\nfstconnect_OBJECTS = $(am_fstconnect_OBJECTS)\nfstconnect_LDADD = $(LDADD)\nfstconnect_DEPENDENCIES = ../script/libfstscript.la ../lib/libfst.la \\\n\t$(am__DEPENDENCIES_1)\nam__fstconvert_SOURCES_DIST = fstconvert.cc fstconvert-main.cc\n@HAVE_BIN_TRUE@am_fstconvert_OBJECTS = fstconvert.$(OBJEXT) \\\n@HAVE_BIN_TRUE@\tfstconvert-main.$(OBJEXT)\nfstconvert_OBJECTS = $(am_fstconvert_OBJECTS)\nfstconvert_LDADD = $(LDADD)\nfstconvert_DEPENDENCIES = ../script/libfstscript.la ../lib/libfst.la \\\n\t$(am__DEPENDENCIES_1)\nam__fstdeterminize_SOURCES_DIST = fstdeterminize.cc \\\n\tfstdeterminize-main.cc\n@HAVE_BIN_TRUE@am_fstdeterminize_OBJECTS = fstdeterminize.$(OBJEXT) \\\n@HAVE_BIN_TRUE@\tfstdeterminize-main.$(OBJEXT)\nfstdeterminize_OBJECTS = $(am_fstdeterminize_OBJECTS)\nfstdeterminize_LDADD = $(LDADD)\nfstdeterminize_DEPENDENCIES = ../script/libfstscript.la \\\n\t../lib/libfst.la $(am__DEPENDENCIES_1)\nam__fstdifference_SOURCES_DIST = fstdifference.cc \\\n\tfstdifference-main.cc\n@HAVE_BIN_TRUE@am_fstdifference_OBJECTS = fstdifference.$(OBJEXT) \\\n@HAVE_BIN_TRUE@\tfstdifference-main.$(OBJEXT)\nfstdifference_OBJECTS = $(am_fstdifference_OBJECTS)\nfstdifference_LDADD = $(LDADD)\nfstdifference_DEPENDENCIES = ../script/libfstscript.la \\\n\t../lib/libfst.la $(am__DEPENDENCIES_1)\nam__fstdisambiguate_SOURCES_DIST = fstdisambiguate.cc \\\n\tfstdisambiguate-main.cc\n@HAVE_BIN_TRUE@am_fstdisambiguate_OBJECTS = fstdisambiguate.$(OBJEXT) \\\n@HAVE_BIN_TRUE@\tfstdisambiguate-main.$(OBJEXT)\nfstdisambiguate_OBJECTS = $(am_fstdisambiguate_OBJECTS)\nfstdisambiguate_LDADD = $(LDADD)\nfstdisambiguate_DEPENDENCIES = ../script/libfstscript.la \\\n\t../lib/libfst.la $(am__DEPENDENCIES_1)\nam__fstdraw_SOURCES_DIST = fstdraw.cc fstdraw-main.cc\n@HAVE_BIN_TRUE@am_fstdraw_OBJECTS = fstdraw.$(OBJEXT) \\\n@HAVE_BIN_TRUE@\tfstdraw-main.$(OBJEXT)\nfstdraw_OBJECTS = $(am_fstdraw_OBJECTS)\nfstdraw_LDADD = $(LDADD)\nfstdraw_DEPENDENCIES = ../script/libfstscript.la ../lib/libfst.la \\\n\t$(am__DEPENDENCIES_1)\nam__fstencode_SOURCES_DIST = fstencode.cc fstencode-main.cc\n@HAVE_BIN_TRUE@am_fstencode_OBJECTS = fstencode.$(OBJEXT) \\\n@HAVE_BIN_TRUE@\tfstencode-main.$(OBJEXT)\nfstencode_OBJECTS = $(am_fstencode_OBJECTS)\nfstencode_LDADD = $(LDADD)\nfstencode_DEPENDENCIES = ../script/libfstscript.la ../lib/libfst.la \\\n\t$(am__DEPENDENCIES_1)\nam__fstepsnormalize_SOURCES_DIST = fstepsnormalize.cc \\\n\tfstepsnormalize-main.cc\n@HAVE_BIN_TRUE@am_fstepsnormalize_OBJECTS = fstepsnormalize.$(OBJEXT) \\\n@HAVE_BIN_TRUE@\tfstepsnormalize-main.$(OBJEXT)\nfstepsnormalize_OBJECTS = $(am_fstepsnormalize_OBJECTS)\nfstepsnormalize_LDADD = $(LDADD)\nfstepsnormalize_DEPENDENCIES = ../script/libfstscript.la \\\n\t../lib/libfst.la $(am__DEPENDENCIES_1)\nam__fstequal_SOURCES_DIST = fstequal.cc fstequal-main.cc\n@HAVE_BIN_TRUE@am_fstequal_OBJECTS = fstequal.$(OBJEXT) \\\n@HAVE_BIN_TRUE@\tfstequal-main.$(OBJEXT)\nfstequal_OBJECTS = $(am_fstequal_OBJECTS)\nfstequal_LDADD = $(LDADD)\nfstequal_DEPENDENCIES = ../script/libfstscript.la ../lib/libfst.la \\\n\t$(am__DEPENDENCIES_1)\nam__fstequivalent_SOURCES_DIST = fstequivalent.cc \\\n\tfstequivalent-main.cc\n@HAVE_BIN_TRUE@am_fstequivalent_OBJECTS = fstequivalent.$(OBJEXT) \\\n@HAVE_BIN_TRUE@\tfstequivalent-main.$(OBJEXT)\nfstequivalent_OBJECTS = $(am_fstequivalent_OBJECTS)\nfstequivalent_LDADD = $(LDADD)\nfstequivalent_DEPENDENCIES = ../script/libfstscript.la \\\n\t../lib/libfst.la $(am__DEPENDENCIES_1)\nam__fstinfo_SOURCES_DIST = fstinfo.cc fstinfo-main.cc\n@HAVE_BIN_TRUE@am_fstinfo_OBJECTS = fstinfo.$(OBJEXT) \\\n@HAVE_BIN_TRUE@\tfstinfo-main.$(OBJEXT)\nfstinfo_OBJECTS = $(am_fstinfo_OBJECTS)\nfstinfo_LDADD = $(LDADD)\nfstinfo_DEPENDENCIES = ../script/libfstscript.la ../lib/libfst.la \\\n\t$(am__DEPENDENCIES_1)\nam__fstintersect_SOURCES_DIST = fstintersect.cc fstintersect-main.cc\n@HAVE_BIN_TRUE@am_fstintersect_OBJECTS = fstintersect.$(OBJEXT) \\\n@HAVE_BIN_TRUE@\tfstintersect-main.$(OBJEXT)\nfstintersect_OBJECTS = $(am_fstintersect_OBJECTS)\nfstintersect_LDADD = $(LDADD)\nfstintersect_DEPENDENCIES = ../script/libfstscript.la ../lib/libfst.la \\\n\t$(am__DEPENDENCIES_1)\nam__fstinvert_SOURCES_DIST = fstinvert.cc fstinvert-main.cc\n@HAVE_BIN_TRUE@am_fstinvert_OBJECTS = fstinvert.$(OBJEXT) \\\n@HAVE_BIN_TRUE@\tfstinvert-main.$(OBJEXT)\nfstinvert_OBJECTS = $(am_fstinvert_OBJECTS)\nfstinvert_LDADD = $(LDADD)\nfstinvert_DEPENDENCIES = ../script/libfstscript.la ../lib/libfst.la \\\n\t$(am__DEPENDENCIES_1)\nam__fstisomorphic_SOURCES_DIST = fstisomorphic.cc \\\n\tfstisomorphic-main.cc\n@HAVE_BIN_TRUE@am_fstisomorphic_OBJECTS = fstisomorphic.$(OBJEXT) \\\n@HAVE_BIN_TRUE@\tfstisomorphic-main.$(OBJEXT)\nfstisomorphic_OBJECTS = $(am_fstisomorphic_OBJECTS)\nfstisomorphic_LDADD = $(LDADD)\nfstisomorphic_DEPENDENCIES = ../script/libfstscript.la \\\n\t../lib/libfst.la $(am__DEPENDENCIES_1)\nam__fstmap_SOURCES_DIST = fstmap.cc fstmap-main.cc\n@HAVE_BIN_TRUE@am_fstmap_OBJECTS = fstmap.$(OBJEXT) \\\n@HAVE_BIN_TRUE@\tfstmap-main.$(OBJEXT)\nfstmap_OBJECTS = $(am_fstmap_OBJECTS)\nfstmap_LDADD = $(LDADD)\nfstmap_DEPENDENCIES = ../script/libfstscript.la ../lib/libfst.la \\\n\t$(am__DEPENDENCIES_1)\nam__fstminimize_SOURCES_DIST = fstminimize.cc fstminimize-main.cc\n@HAVE_BIN_TRUE@am_fstminimize_OBJECTS = fstminimize.$(OBJEXT) \\\n@HAVE_BIN_TRUE@\tfstminimize-main.$(OBJEXT)\nfstminimize_OBJECTS = $(am_fstminimize_OBJECTS)\nfstminimize_LDADD = $(LDADD)\nfstminimize_DEPENDENCIES = ../script/libfstscript.la ../lib/libfst.la \\\n\t$(am__DEPENDENCIES_1)\nam__fstprint_SOURCES_DIST = fstprint.cc fstprint-main.cc\n@HAVE_BIN_TRUE@am_fstprint_OBJECTS = fstprint.$(OBJEXT) \\\n@HAVE_BIN_TRUE@\tfstprint-main.$(OBJEXT)\nfstprint_OBJECTS = $(am_fstprint_OBJECTS)\nfstprint_LDADD = $(LDADD)\nfstprint_DEPENDENCIES = ../script/libfstscript.la ../lib/libfst.la \\\n\t$(am__DEPENDENCIES_1)\nam__fstproject_SOURCES_DIST = fstproject.cc fstproject-main.cc\n@HAVE_BIN_TRUE@am_fstproject_OBJECTS = fstproject.$(OBJEXT) \\\n@HAVE_BIN_TRUE@\tfstproject-main.$(OBJEXT)\nfstproject_OBJECTS = $(am_fstproject_OBJECTS)\nfstproject_LDADD = $(LDADD)\nfstproject_DEPENDENCIES = ../script/libfstscript.la ../lib/libfst.la \\\n\t$(am__DEPENDENCIES_1)\nam__fstprune_SOURCES_DIST = fstprune.cc fstprune-main.cc\n@HAVE_BIN_TRUE@am_fstprune_OBJECTS = fstprune.$(OBJEXT) \\\n@HAVE_BIN_TRUE@\tfstprune-main.$(OBJEXT)\nfstprune_OBJECTS = $(am_fstprune_OBJECTS)\nfstprune_LDADD = $(LDADD)\nfstprune_DEPENDENCIES = ../script/libfstscript.la ../lib/libfst.la \\\n\t$(am__DEPENDENCIES_1)\nam__fstpush_SOURCES_DIST = fstpush.cc fstpush-main.cc\n@HAVE_BIN_TRUE@am_fstpush_OBJECTS = fstpush.$(OBJEXT) \\\n@HAVE_BIN_TRUE@\tfstpush-main.$(OBJEXT)\nfstpush_OBJECTS = $(am_fstpush_OBJECTS)\nfstpush_LDADD = $(LDADD)\nfstpush_DEPENDENCIES = ../script/libfstscript.la ../lib/libfst.la \\\n\t$(am__DEPENDENCIES_1)\nam__fstrandgen_SOURCES_DIST = fstrandgen.cc fstrandgen-main.cc\n@HAVE_BIN_TRUE@am_fstrandgen_OBJECTS = fstrandgen.$(OBJEXT) \\\n@HAVE_BIN_TRUE@\tfstrandgen-main.$(OBJEXT)\nfstrandgen_OBJECTS = $(am_fstrandgen_OBJECTS)\nfstrandgen_LDADD = $(LDADD)\nfstrandgen_DEPENDENCIES = ../script/libfstscript.la ../lib/libfst.la \\\n\t$(am__DEPENDENCIES_1)\nam__fstrelabel_SOURCES_DIST = fstrelabel.cc fstrelabel-main.cc\n@HAVE_BIN_TRUE@am_fstrelabel_OBJECTS = fstrelabel.$(OBJEXT) \\\n@HAVE_BIN_TRUE@\tfstrelabel-main.$(OBJEXT)\nfstrelabel_OBJECTS = $(am_fstrelabel_OBJECTS)\nfstrelabel_LDADD = $(LDADD)\nfstrelabel_DEPENDENCIES = ../script/libfstscript.la ../lib/libfst.la \\\n\t$(am__DEPENDENCIES_1)\nam__fstreplace_SOURCES_DIST = fstreplace.cc fstreplace-main.cc\n@HAVE_BIN_TRUE@am_fstreplace_OBJECTS = fstreplace.$(OBJEXT) \\\n@HAVE_BIN_TRUE@\tfstreplace-main.$(OBJEXT)\nfstreplace_OBJECTS = $(am_fstreplace_OBJECTS)\nfstreplace_LDADD = $(LDADD)\nfstreplace_DEPENDENCIES = ../script/libfstscript.la ../lib/libfst.la \\\n\t$(am__DEPENDENCIES_1)\nam__fstreverse_SOURCES_DIST = fstreverse.cc fstreverse-main.cc\n@HAVE_BIN_TRUE@am_fstreverse_OBJECTS = fstreverse.$(OBJEXT) \\\n@HAVE_BIN_TRUE@\tfstreverse-main.$(OBJEXT)\nfstreverse_OBJECTS = $(am_fstreverse_OBJECTS)\nfstreverse_LDADD = $(LDADD)\nfstreverse_DEPENDENCIES = ../script/libfstscript.la ../lib/libfst.la \\\n\t$(am__DEPENDENCIES_1)\nam__fstreweight_SOURCES_DIST = fstreweight.cc fstreweight-main.cc\n@HAVE_BIN_TRUE@am_fstreweight_OBJECTS = fstreweight.$(OBJEXT) \\\n@HAVE_BIN_TRUE@\tfstreweight-main.$(OBJEXT)\nfstreweight_OBJECTS = $(am_fstreweight_OBJECTS)\nfstreweight_LDADD = $(LDADD)\nfstreweight_DEPENDENCIES = ../script/libfstscript.la ../lib/libfst.la \\\n\t$(am__DEPENDENCIES_1)\nam__fstrmepsilon_SOURCES_DIST = fstrmepsilon.cc fstrmepsilon-main.cc\n@HAVE_BIN_TRUE@am_fstrmepsilon_OBJECTS = fstrmepsilon.$(OBJEXT) \\\n@HAVE_BIN_TRUE@\tfstrmepsilon-main.$(OBJEXT)\nfstrmepsilon_OBJECTS = $(am_fstrmepsilon_OBJECTS)\nfstrmepsilon_LDADD = $(LDADD)\nfstrmepsilon_DEPENDENCIES = ../script/libfstscript.la ../lib/libfst.la \\\n\t$(am__DEPENDENCIES_1)\nam__fstshortestdistance_SOURCES_DIST = fstshortestdistance.cc \\\n\tfstshortestdistance-main.cc\n@HAVE_BIN_TRUE@am_fstshortestdistance_OBJECTS =  \\\n@HAVE_BIN_TRUE@\tfstshortestdistance.$(OBJEXT) \\\n@HAVE_BIN_TRUE@\tfstshortestdistance-main.$(OBJEXT)\nfstshortestdistance_OBJECTS = $(am_fstshortestdistance_OBJECTS)\nfstshortestdistance_LDADD = $(LDADD)\nfstshortestdistance_DEPENDENCIES = ../script/libfstscript.la \\\n\t../lib/libfst.la $(am__DEPENDENCIES_1)\nam__fstshortestpath_SOURCES_DIST = fstshortestpath.cc \\\n\tfstshortestpath-main.cc\n@HAVE_BIN_TRUE@am_fstshortestpath_OBJECTS = fstshortestpath.$(OBJEXT) \\\n@HAVE_BIN_TRUE@\tfstshortestpath-main.$(OBJEXT)\nfstshortestpath_OBJECTS = $(am_fstshortestpath_OBJECTS)\nfstshortestpath_LDADD = $(LDADD)\nfstshortestpath_DEPENDENCIES = ../script/libfstscript.la \\\n\t../lib/libfst.la $(am__DEPENDENCIES_1)\nam__fstsymbols_SOURCES_DIST = fstsymbols.cc fstsymbols-main.cc\n@HAVE_BIN_TRUE@am_fstsymbols_OBJECTS = fstsymbols.$(OBJEXT) \\\n@HAVE_BIN_TRUE@\tfstsymbols-main.$(OBJEXT)\nfstsymbols_OBJECTS = $(am_fstsymbols_OBJECTS)\nfstsymbols_LDADD = $(LDADD)\nfstsymbols_DEPENDENCIES = ../script/libfstscript.la ../lib/libfst.la \\\n\t$(am__DEPENDENCIES_1)\nam__fstsynchronize_SOURCES_DIST = fstsynchronize.cc \\\n\tfstsynchronize-main.cc\n@HAVE_BIN_TRUE@am_fstsynchronize_OBJECTS = fstsynchronize.$(OBJEXT) \\\n@HAVE_BIN_TRUE@\tfstsynchronize-main.$(OBJEXT)\nfstsynchronize_OBJECTS = $(am_fstsynchronize_OBJECTS)\nfstsynchronize_LDADD = $(LDADD)\nfstsynchronize_DEPENDENCIES = ../script/libfstscript.la \\\n\t../lib/libfst.la $(am__DEPENDENCIES_1)\nam__fsttopsort_SOURCES_DIST = fsttopsort.cc fsttopsort-main.cc\n@HAVE_BIN_TRUE@am_fsttopsort_OBJECTS = fsttopsort.$(OBJEXT) \\\n@HAVE_BIN_TRUE@\tfsttopsort-main.$(OBJEXT)\nfsttopsort_OBJECTS = $(am_fsttopsort_OBJECTS)\nfsttopsort_LDADD = $(LDADD)\nfsttopsort_DEPENDENCIES = ../script/libfstscript.la ../lib/libfst.la \\\n\t$(am__DEPENDENCIES_1)\nam__fstunion_SOURCES_DIST = fstunion.cc fstunion-main.cc\n@HAVE_BIN_TRUE@am_fstunion_OBJECTS = fstunion.$(OBJEXT) \\\n@HAVE_BIN_TRUE@\tfstunion-main.$(OBJEXT)\nfstunion_OBJECTS = $(am_fstunion_OBJECTS)\nfstunion_LDADD = $(LDADD)\nfstunion_DEPENDENCIES = ../script/libfstscript.la ../lib/libfst.la \\\n\t$(am__DEPENDENCIES_1)\nAM_V_P = $(am__v_P_@AM_V@)\nam__v_P_ = $(am__v_P_@AM_DEFAULT_V@)\nam__v_P_0 = false\nam__v_P_1 = :\nAM_V_GEN = $(am__v_GEN_@AM_V@)\nam__v_GEN_ = $(am__v_GEN_@AM_DEFAULT_V@)\nam__v_GEN_0 = @echo \"  GEN     \" $@;\nam__v_GEN_1 = \nAM_V_at = $(am__v_at_@AM_V@)\nam__v_at_ = $(am__v_at_@AM_DEFAULT_V@)\nam__v_at_0 = @\nam__v_at_1 = \nDEFAULT_INCLUDES = \ndepcomp = $(SHELL) $(top_srcdir)/depcomp\nam__depfiles_maybe = depfiles\nam__mv = mv -f\nCXXCOMPILE = $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) \\\n\t$(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS)\nLTCXXCOMPILE = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \\\n\t$(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) \\\n\t$(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) \\\n\t$(AM_CXXFLAGS) $(CXXFLAGS)\nAM_V_CXX = $(am__v_CXX_@AM_V@)\nam__v_CXX_ = $(am__v_CXX_@AM_DEFAULT_V@)\nam__v_CXX_0 = @echo \"  CXX     \" $@;\nam__v_CXX_1 = \nCXXLD = $(CXX)\nCXXLINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \\\n\t$(LIBTOOLFLAGS) --mode=link $(CXXLD) $(AM_CXXFLAGS) \\\n\t$(CXXFLAGS) $(AM_LDFLAGS) $(LDFLAGS) -o $@\nAM_V_CXXLD = $(am__v_CXXLD_@AM_V@)\nam__v_CXXLD_ = $(am__v_CXXLD_@AM_DEFAULT_V@)\nam__v_CXXLD_0 = @echo \"  CXXLD   \" $@;\nam__v_CXXLD_1 = \nSOURCES = $(fstarcsort_SOURCES) $(fstclosure_SOURCES) \\\n\t$(fstcompile_SOURCES) $(fstcompose_SOURCES) \\\n\t$(fstconcat_SOURCES) $(fstconnect_SOURCES) \\\n\t$(fstconvert_SOURCES) $(fstdeterminize_SOURCES) \\\n\t$(fstdifference_SOURCES) $(fstdisambiguate_SOURCES) \\\n\t$(fstdraw_SOURCES) $(fstencode_SOURCES) \\\n\t$(fstepsnormalize_SOURCES) $(fstequal_SOURCES) \\\n\t$(fstequivalent_SOURCES) $(fstinfo_SOURCES) \\\n\t$(fstintersect_SOURCES) $(fstinvert_SOURCES) \\\n\t$(fstisomorphic_SOURCES) $(fstmap_SOURCES) \\\n\t$(fstminimize_SOURCES) $(fstprint_SOURCES) \\\n\t$(fstproject_SOURCES) $(fstprune_SOURCES) $(fstpush_SOURCES) \\\n\t$(fstrandgen_SOURCES) $(fstrelabel_SOURCES) \\\n\t$(fstreplace_SOURCES) $(fstreverse_SOURCES) \\\n\t$(fstreweight_SOURCES) $(fstrmepsilon_SOURCES) \\\n\t$(fstshortestdistance_SOURCES) $(fstshortestpath_SOURCES) \\\n\t$(fstsymbols_SOURCES) $(fstsynchronize_SOURCES) \\\n\t$(fsttopsort_SOURCES) $(fstunion_SOURCES)\nDIST_SOURCES = $(am__fstarcsort_SOURCES_DIST) \\\n\t$(am__fstclosure_SOURCES_DIST) $(am__fstcompile_SOURCES_DIST) \\\n\t$(am__fstcompose_SOURCES_DIST) $(am__fstconcat_SOURCES_DIST) \\\n\t$(am__fstconnect_SOURCES_DIST) $(am__fstconvert_SOURCES_DIST) \\\n\t$(am__fstdeterminize_SOURCES_DIST) \\\n\t$(am__fstdifference_SOURCES_DIST) \\\n\t$(am__fstdisambiguate_SOURCES_DIST) \\\n\t$(am__fstdraw_SOURCES_DIST) $(am__fstencode_SOURCES_DIST) \\\n\t$(am__fstepsnormalize_SOURCES_DIST) \\\n\t$(am__fstequal_SOURCES_DIST) $(am__fstequivalent_SOURCES_DIST) \\\n\t$(am__fstinfo_SOURCES_DIST) $(am__fstintersect_SOURCES_DIST) \\\n\t$(am__fstinvert_SOURCES_DIST) \\\n\t$(am__fstisomorphic_SOURCES_DIST) $(am__fstmap_SOURCES_DIST) \\\n\t$(am__fstminimize_SOURCES_DIST) $(am__fstprint_SOURCES_DIST) \\\n\t$(am__fstproject_SOURCES_DIST) $(am__fstprune_SOURCES_DIST) \\\n\t$(am__fstpush_SOURCES_DIST) $(am__fstrandgen_SOURCES_DIST) \\\n\t$(am__fstrelabel_SOURCES_DIST) $(am__fstreplace_SOURCES_DIST) \\\n\t$(am__fstreverse_SOURCES_DIST) $(am__fstreweight_SOURCES_DIST) \\\n\t$(am__fstrmepsilon_SOURCES_DIST) \\\n\t$(am__fstshortestdistance_SOURCES_DIST) \\\n\t$(am__fstshortestpath_SOURCES_DIST) \\\n\t$(am__fstsymbols_SOURCES_DIST) \\\n\t$(am__fstsynchronize_SOURCES_DIST) \\\n\t$(am__fsttopsort_SOURCES_DIST) $(am__fstunion_SOURCES_DIST)\nam__can_run_installinfo = \\\n  case $$AM_UPDATE_INFO_DIR in \\\n    n|no|NO) false;; \\\n    *) (install-info --version) >/dev/null 2>&1;; \\\n  esac\nam__tagged_files = $(HEADERS) $(SOURCES) $(TAGS_FILES) $(LISP)\n# Read a list of newline-separated strings from the standard input,\n# and print each of them once, without duplicates.  Input order is\n# *not* preserved.\nam__uniquify_input = $(AWK) '\\\n  BEGIN { nonempty = 0; } \\\n  { items[$$0] = 1; nonempty = 1; } \\\n  END { if (nonempty) { for (i in items) print i; }; } \\\n'\n# Make sure the list of sources is unique.  This is necessary because,\n# e.g., the same source file might be shared among _SOURCES variables\n# for different programs/libraries.\nam__define_uniq_tagged_files = \\\n  list='$(am__tagged_files)'; \\\n  unique=`for i in $$list; do \\\n    if test -f \"$$i\"; then echo $$i; else echo $(srcdir)/$$i; fi; \\\n  done | $(am__uniquify_input)`\nETAGS = etags\nCTAGS = ctags\nDISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST)\nACLOCAL = @ACLOCAL@\nAMTAR = @AMTAR@\nAM_DEFAULT_VERBOSITY = @AM_DEFAULT_VERBOSITY@\nAR = @AR@\nAUTOCONF = @AUTOCONF@\nAUTOHEADER = @AUTOHEADER@\nAUTOMAKE = @AUTOMAKE@\nAWK = @AWK@\nCC = @CC@\nCCDEPMODE = @CCDEPMODE@\nCFLAGS = @CFLAGS@\nCPP = @CPP@\nCPPFLAGS = @CPPFLAGS@\nCXX = @CXX@\nCXXCPP = @CXXCPP@\nCXXDEPMODE = @CXXDEPMODE@\nCXXFLAGS = @CXXFLAGS@\nCYGPATH_W = @CYGPATH_W@\nDEFS = @DEFS@\nDEPDIR = @DEPDIR@\nDLLTOOL = @DLLTOOL@\nDL_LIBS = @DL_LIBS@\nDSYMUTIL = @DSYMUTIL@\nDUMPBIN = @DUMPBIN@\nECHO_C = @ECHO_C@\nECHO_N = @ECHO_N@\nECHO_T = @ECHO_T@\nEGREP = @EGREP@\nEXEEXT = @EXEEXT@\nFGREP = @FGREP@\nGREP = @GREP@\nINSTALL = @INSTALL@\nINSTALL_DATA = @INSTALL_DATA@\nINSTALL_PROGRAM = @INSTALL_PROGRAM@\nINSTALL_SCRIPT = @INSTALL_SCRIPT@\nINSTALL_STRIP_PROGRAM = @INSTALL_STRIP_PROGRAM@\nLD = @LD@\nLDFLAGS = @LDFLAGS@\nLIBOBJS = @LIBOBJS@\nLIBS = @LIBS@\nLIBTOOL = @LIBTOOL@\nLIPO = @LIPO@\nLN_S = @LN_S@\nLTLIBOBJS = @LTLIBOBJS@\nMAKEINFO = @MAKEINFO@\nMANIFEST_TOOL = @MANIFEST_TOOL@\nMKDIR_P = @MKDIR_P@\nNM = @NM@\nNMEDIT = @NMEDIT@\nOBJDUMP = @OBJDUMP@\nOBJEXT = @OBJEXT@\nOTOOL = @OTOOL@\nOTOOL64 = @OTOOL64@\nPACKAGE = @PACKAGE@\nPACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@\nPACKAGE_NAME = @PACKAGE_NAME@\nPACKAGE_STRING = @PACKAGE_STRING@\nPACKAGE_TARNAME = @PACKAGE_TARNAME@\nPACKAGE_URL = @PACKAGE_URL@\nPACKAGE_VERSION = @PACKAGE_VERSION@\nPATH_SEPARATOR = @PATH_SEPARATOR@\nPYTHON = @PYTHON@\nPYTHON_CPPFLAGS = @PYTHON_CPPFLAGS@\nPYTHON_EXEC_PREFIX = @PYTHON_EXEC_PREFIX@\nPYTHON_EXTRA_LDFLAGS = @PYTHON_EXTRA_LDFLAGS@\nPYTHON_EXTRA_LIBS = @PYTHON_EXTRA_LIBS@\nPYTHON_LDFLAGS = @PYTHON_LDFLAGS@\nPYTHON_PLATFORM = @PYTHON_PLATFORM@\nPYTHON_PREFIX = @PYTHON_PREFIX@\nPYTHON_SITE_PKG = @PYTHON_SITE_PKG@\nPYTHON_VERSION = @PYTHON_VERSION@\nRANLIB = @RANLIB@\nSED = @SED@\nSET_MAKE = @SET_MAKE@\nSHELL = @SHELL@\nSTRIP = @STRIP@\nVERSION = @VERSION@\nabs_builddir = @abs_builddir@\nabs_srcdir = @abs_srcdir@\nabs_top_builddir = @abs_top_builddir@\nabs_top_srcdir = @abs_top_srcdir@\nac_ct_AR = @ac_ct_AR@\nac_ct_CC = @ac_ct_CC@\nac_ct_CXX = @ac_ct_CXX@\nac_ct_DUMPBIN = @ac_ct_DUMPBIN@\nam__include = @am__include@\nam__leading_dot = @am__leading_dot@\nam__quote = @am__quote@\nam__tar = @am__tar@\nam__untar = @am__untar@\nbindir = @bindir@\nbuild = @build@\nbuild_alias = @build_alias@\nbuild_cpu = @build_cpu@\nbuild_os = @build_os@\nbuild_vendor = @build_vendor@\nbuilddir = @builddir@\ndatadir = @datadir@\ndatarootdir = @datarootdir@\ndocdir = @docdir@\ndvidir = @dvidir@\nexec_prefix = @exec_prefix@\nhost = @host@\nhost_alias = @host_alias@\nhost_cpu = @host_cpu@\nhost_os = @host_os@\nhost_vendor = @host_vendor@\nhtmldir = @htmldir@\nincludedir = @includedir@\ninfodir = @infodir@\ninstall_sh = @install_sh@\nlibdir = @libdir@\nlibexecdir = @libexecdir@\nlibfstdir = @libfstdir@\nlocaledir = @localedir@\nlocalstatedir = @localstatedir@\nmandir = @mandir@\nmkdir_p = @mkdir_p@\noldincludedir = @oldincludedir@\npdfdir = @pdfdir@\npkgpyexecdir = @pkgpyexecdir@\npkgpythondir = @pkgpythondir@\nprefix = @prefix@\nprogram_transform_name = @program_transform_name@\npsdir = @psdir@\npyexecdir = @pyexecdir@\npythondir = @pythondir@\nsbindir = @sbindir@\nsharedstatedir = @sharedstatedir@\nsrcdir = @srcdir@\nsysconfdir = @sysconfdir@\ntarget_alias = @target_alias@\ntop_build_prefix = @top_build_prefix@\ntop_builddir = @top_builddir@\ntop_srcdir = @top_srcdir@\nAM_CPPFLAGS = -I$(srcdir)/../include -I$(srcdir)/../script $(ICU_FLAGS)\nLDADD = ../script/libfstscript.la ../lib/libfst.la -lm $(DL_LIBS)\n@HAVE_BIN_TRUE@fstarcsort_SOURCES = fstarcsort.cc fstarcsort-main.cc\n@HAVE_BIN_TRUE@fstclosure_SOURCES = fstclosure.cc fstclosure-main.cc\n@HAVE_BIN_TRUE@fstcompile_SOURCES = fstcompile.cc fstcompile-main.cc\n@HAVE_BIN_TRUE@fstcompose_SOURCES = fstcompose.cc fstcompose-main.cc\n@HAVE_BIN_TRUE@fstconcat_SOURCES = fstconcat.cc fstconcat-main.cc\n@HAVE_BIN_TRUE@fstconnect_SOURCES = fstconnect.cc fstconnect-main.cc\n@HAVE_BIN_TRUE@fstconvert_SOURCES = fstconvert.cc fstconvert-main.cc\n@HAVE_BIN_TRUE@fstdeterminize_SOURCES = fstdeterminize.cc fstdeterminize-main.cc\n@HAVE_BIN_TRUE@fstdifference_SOURCES = fstdifference.cc fstdifference-main.cc\n@HAVE_BIN_TRUE@fstdisambiguate_SOURCES = fstdisambiguate.cc fstdisambiguate-main.cc\n@HAVE_BIN_TRUE@fstdraw_SOURCES = fstdraw.cc fstdraw-main.cc\n@HAVE_BIN_TRUE@fstencode_SOURCES = fstencode.cc fstencode-main.cc\n@HAVE_BIN_TRUE@fstepsnormalize_SOURCES = fstepsnormalize.cc fstepsnormalize-main.cc\n@HAVE_BIN_TRUE@fstequal_SOURCES = fstequal.cc fstequal-main.cc\n@HAVE_BIN_TRUE@fstequivalent_SOURCES = fstequivalent.cc fstequivalent-main.cc\n@HAVE_BIN_TRUE@fstinfo_SOURCES = fstinfo.cc fstinfo-main.cc\n@HAVE_BIN_TRUE@fstintersect_SOURCES = fstintersect.cc fstintersect-main.cc\n@HAVE_BIN_TRUE@fstinvert_SOURCES = fstinvert.cc fstinvert-main.cc\n@HAVE_BIN_TRUE@fstisomorphic_SOURCES = fstisomorphic.cc fstisomorphic-main.cc\n@HAVE_BIN_TRUE@fstmap_SOURCES = fstmap.cc fstmap-main.cc\n@HAVE_BIN_TRUE@fstminimize_SOURCES = fstminimize.cc fstminimize-main.cc\n@HAVE_BIN_TRUE@fstprint_SOURCES = fstprint.cc fstprint-main.cc\n@HAVE_BIN_TRUE@fstproject_SOURCES = fstproject.cc fstproject-main.cc\n@HAVE_BIN_TRUE@fstprune_SOURCES = fstprune.cc fstprune-main.cc\n@HAVE_BIN_TRUE@fstpush_SOURCES = fstpush.cc fstpush-main.cc\n@HAVE_BIN_TRUE@fstrandgen_SOURCES = fstrandgen.cc fstrandgen-main.cc\n@HAVE_BIN_TRUE@fstrelabel_SOURCES = fstrelabel.cc fstrelabel-main.cc\n@HAVE_BIN_TRUE@fstreplace_SOURCES = fstreplace.cc fstreplace-main.cc\n@HAVE_BIN_TRUE@fstreverse_SOURCES = fstreverse.cc fstreverse-main.cc\n@HAVE_BIN_TRUE@fstreweight_SOURCES = fstreweight.cc fstreweight-main.cc\n@HAVE_BIN_TRUE@fstrmepsilon_SOURCES = fstrmepsilon.cc fstrmepsilon-main.cc\n@HAVE_BIN_TRUE@fstshortestdistance_SOURCES = fstshortestdistance.cc fstshortestdistance-main.cc\n@HAVE_BIN_TRUE@fstshortestpath_SOURCES = fstshortestpath.cc fstshortestpath-main.cc\n@HAVE_BIN_TRUE@fstsymbols_SOURCES = fstsymbols.cc fstsymbols-main.cc\n@HAVE_BIN_TRUE@fstsynchronize_SOURCES = fstsynchronize.cc fstsynchronize-main.cc\n@HAVE_BIN_TRUE@fsttopsort_SOURCES = fsttopsort.cc fsttopsort-main.cc\n@HAVE_BIN_TRUE@fstunion_SOURCES = fstunion.cc fstunion-main.cc\nall: all-am\n\n.SUFFIXES:\n.SUFFIXES: .cc .lo .o .obj\n$(srcdir)/Makefile.in:  $(srcdir)/Makefile.am  $(am__configure_deps)\n\t@for dep in $?; do \\\n\t  case '$(am__configure_deps)' in \\\n\t    *$$dep*) \\\n\t      ( cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh ) \\\n\t        && { if test -f $@; then exit 0; else break; fi; }; \\\n\t      exit 1;; \\\n\t  esac; \\\n\tdone; \\\n\techo ' cd $(top_srcdir) && $(AUTOMAKE) --foreign src/bin/Makefile'; \\\n\t$(am__cd) $(top_srcdir) && \\\n\t  $(AUTOMAKE) --foreign src/bin/Makefile\n.PRECIOUS: Makefile\nMakefile: $(srcdir)/Makefile.in $(top_builddir)/config.status\n\t@case '$?' in \\\n\t  *config.status*) \\\n\t    cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh;; \\\n\t  *) \\\n\t    echo ' cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe)'; \\\n\t    cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe);; \\\n\tesac;\n\n$(top_builddir)/config.status: $(top_srcdir)/configure $(CONFIG_STATUS_DEPENDENCIES)\n\tcd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh\n\n$(top_srcdir)/configure:  $(am__configure_deps)\n\tcd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh\n$(ACLOCAL_M4):  $(am__aclocal_m4_deps)\n\tcd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh\n$(am__aclocal_m4_deps):\ninstall-binPROGRAMS: $(bin_PROGRAMS)\n\t@$(NORMAL_INSTALL)\n\t@list='$(bin_PROGRAMS)'; test -n \"$(bindir)\" || list=; \\\n\tif test -n \"$$list\"; then \\\n\t  echo \" $(MKDIR_P) '$(DESTDIR)$(bindir)'\"; \\\n\t  $(MKDIR_P) \"$(DESTDIR)$(bindir)\" || exit 1; \\\n\tfi; \\\n\tfor p in $$list; do echo \"$$p $$p\"; done | \\\n\tsed 's/$(EXEEXT)$$//' | \\\n\twhile read p p1; do if test -f $$p \\\n\t || test -f $$p1 \\\n\t  ; then echo \"$$p\"; echo \"$$p\"; else :; fi; \\\n\tdone | \\\n\tsed -e 'p;s,.*/,,;n;h' \\\n\t    -e 's|.*|.|' \\\n\t    -e 'p;x;s,.*/,,;s/$(EXEEXT)$$//;$(transform);s/$$/$(EXEEXT)/' | \\\n\tsed 'N;N;N;s,\\n, ,g' | \\\n\t$(AWK) 'BEGIN { files[\".\"] = \"\"; dirs[\".\"] = 1 } \\\n\t  { d=$$3; if (dirs[d] != 1) { print \"d\", d; dirs[d] = 1 } \\\n\t    if ($$2 == $$4) files[d] = files[d] \" \" $$1; \\\n\t    else { print \"f\", $$3 \"/\" $$4, $$1; } } \\\n\t  END { for (d in files) print \"f\", d, files[d] }' | \\\n\twhile read type dir files; do \\\n\t    if test \"$$dir\" = .; then dir=; else dir=/$$dir; fi; \\\n\t    test -z \"$$files\" || { \\\n\t    echo \" $(INSTALL_PROGRAM_ENV) $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL_PROGRAM) $$files '$(DESTDIR)$(bindir)$$dir'\"; \\\n\t    $(INSTALL_PROGRAM_ENV) $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL_PROGRAM) $$files \"$(DESTDIR)$(bindir)$$dir\" || exit $$?; \\\n\t    } \\\n\t; done\n\nuninstall-binPROGRAMS:\n\t@$(NORMAL_UNINSTALL)\n\t@list='$(bin_PROGRAMS)'; test -n \"$(bindir)\" || list=; \\\n\tfiles=`for p in $$list; do echo \"$$p\"; done | \\\n\t  sed -e 'h;s,^.*/,,;s/$(EXEEXT)$$//;$(transform)' \\\n\t      -e 's/$$/$(EXEEXT)/' \\\n\t`; \\\n\ttest -n \"$$list\" || exit 0; \\\n\techo \" ( cd '$(DESTDIR)$(bindir)' && rm -f\" $$files \")\"; \\\n\tcd \"$(DESTDIR)$(bindir)\" && rm -f $$files\n\nclean-binPROGRAMS:\n\t@list='$(bin_PROGRAMS)'; test -n \"$$list\" || exit 0; \\\n\techo \" rm -f\" $$list; \\\n\trm -f $$list || exit $$?; \\\n\ttest -n \"$(EXEEXT)\" || exit 0; \\\n\tlist=`for p in $$list; do echo \"$$p\"; done | sed 's/$(EXEEXT)$$//'`; \\\n\techo \" rm -f\" $$list; \\\n\trm -f $$list\n\nfstarcsort$(EXEEXT): $(fstarcsort_OBJECTS) $(fstarcsort_DEPENDENCIES) $(EXTRA_fstarcsort_DEPENDENCIES) \n\t@rm -f fstarcsort$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(fstarcsort_OBJECTS) $(fstarcsort_LDADD) $(LIBS)\n\nfstclosure$(EXEEXT): $(fstclosure_OBJECTS) $(fstclosure_DEPENDENCIES) $(EXTRA_fstclosure_DEPENDENCIES) \n\t@rm -f fstclosure$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(fstclosure_OBJECTS) $(fstclosure_LDADD) $(LIBS)\n\nfstcompile$(EXEEXT): $(fstcompile_OBJECTS) $(fstcompile_DEPENDENCIES) $(EXTRA_fstcompile_DEPENDENCIES) \n\t@rm -f fstcompile$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(fstcompile_OBJECTS) $(fstcompile_LDADD) $(LIBS)\n\nfstcompose$(EXEEXT): $(fstcompose_OBJECTS) $(fstcompose_DEPENDENCIES) $(EXTRA_fstcompose_DEPENDENCIES) \n\t@rm -f fstcompose$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(fstcompose_OBJECTS) $(fstcompose_LDADD) $(LIBS)\n\nfstconcat$(EXEEXT): $(fstconcat_OBJECTS) $(fstconcat_DEPENDENCIES) $(EXTRA_fstconcat_DEPENDENCIES) \n\t@rm -f fstconcat$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(fstconcat_OBJECTS) $(fstconcat_LDADD) $(LIBS)\n\nfstconnect$(EXEEXT): $(fstconnect_OBJECTS) $(fstconnect_DEPENDENCIES) $(EXTRA_fstconnect_DEPENDENCIES) \n\t@rm -f fstconnect$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(fstconnect_OBJECTS) $(fstconnect_LDADD) $(LIBS)\n\nfstconvert$(EXEEXT): $(fstconvert_OBJECTS) $(fstconvert_DEPENDENCIES) $(EXTRA_fstconvert_DEPENDENCIES) \n\t@rm -f fstconvert$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(fstconvert_OBJECTS) $(fstconvert_LDADD) $(LIBS)\n\nfstdeterminize$(EXEEXT): $(fstdeterminize_OBJECTS) $(fstdeterminize_DEPENDENCIES) $(EXTRA_fstdeterminize_DEPENDENCIES) \n\t@rm -f fstdeterminize$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(fstdeterminize_OBJECTS) $(fstdeterminize_LDADD) $(LIBS)\n\nfstdifference$(EXEEXT): $(fstdifference_OBJECTS) $(fstdifference_DEPENDENCIES) $(EXTRA_fstdifference_DEPENDENCIES) \n\t@rm -f fstdifference$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(fstdifference_OBJECTS) $(fstdifference_LDADD) $(LIBS)\n\nfstdisambiguate$(EXEEXT): $(fstdisambiguate_OBJECTS) $(fstdisambiguate_DEPENDENCIES) $(EXTRA_fstdisambiguate_DEPENDENCIES) \n\t@rm -f fstdisambiguate$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(fstdisambiguate_OBJECTS) $(fstdisambiguate_LDADD) $(LIBS)\n\nfstdraw$(EXEEXT): $(fstdraw_OBJECTS) $(fstdraw_DEPENDENCIES) $(EXTRA_fstdraw_DEPENDENCIES) \n\t@rm -f fstdraw$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(fstdraw_OBJECTS) $(fstdraw_LDADD) $(LIBS)\n\nfstencode$(EXEEXT): $(fstencode_OBJECTS) $(fstencode_DEPENDENCIES) $(EXTRA_fstencode_DEPENDENCIES) \n\t@rm -f fstencode$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(fstencode_OBJECTS) $(fstencode_LDADD) $(LIBS)\n\nfstepsnormalize$(EXEEXT): $(fstepsnormalize_OBJECTS) $(fstepsnormalize_DEPENDENCIES) $(EXTRA_fstepsnormalize_DEPENDENCIES) \n\t@rm -f fstepsnormalize$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(fstepsnormalize_OBJECTS) $(fstepsnormalize_LDADD) $(LIBS)\n\nfstequal$(EXEEXT): $(fstequal_OBJECTS) $(fstequal_DEPENDENCIES) $(EXTRA_fstequal_DEPENDENCIES) \n\t@rm -f fstequal$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(fstequal_OBJECTS) $(fstequal_LDADD) $(LIBS)\n\nfstequivalent$(EXEEXT): $(fstequivalent_OBJECTS) $(fstequivalent_DEPENDENCIES) $(EXTRA_fstequivalent_DEPENDENCIES) \n\t@rm -f fstequivalent$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(fstequivalent_OBJECTS) $(fstequivalent_LDADD) $(LIBS)\n\nfstinfo$(EXEEXT): $(fstinfo_OBJECTS) $(fstinfo_DEPENDENCIES) $(EXTRA_fstinfo_DEPENDENCIES) \n\t@rm -f fstinfo$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(fstinfo_OBJECTS) $(fstinfo_LDADD) $(LIBS)\n\nfstintersect$(EXEEXT): $(fstintersect_OBJECTS) $(fstintersect_DEPENDENCIES) $(EXTRA_fstintersect_DEPENDENCIES) \n\t@rm -f fstintersect$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(fstintersect_OBJECTS) $(fstintersect_LDADD) $(LIBS)\n\nfstinvert$(EXEEXT): $(fstinvert_OBJECTS) $(fstinvert_DEPENDENCIES) $(EXTRA_fstinvert_DEPENDENCIES) \n\t@rm -f fstinvert$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(fstinvert_OBJECTS) $(fstinvert_LDADD) $(LIBS)\n\nfstisomorphic$(EXEEXT): $(fstisomorphic_OBJECTS) $(fstisomorphic_DEPENDENCIES) $(EXTRA_fstisomorphic_DEPENDENCIES) \n\t@rm -f fstisomorphic$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(fstisomorphic_OBJECTS) $(fstisomorphic_LDADD) $(LIBS)\n\nfstmap$(EXEEXT): $(fstmap_OBJECTS) $(fstmap_DEPENDENCIES) $(EXTRA_fstmap_DEPENDENCIES) \n\t@rm -f fstmap$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(fstmap_OBJECTS) $(fstmap_LDADD) $(LIBS)\n\nfstminimize$(EXEEXT): $(fstminimize_OBJECTS) $(fstminimize_DEPENDENCIES) $(EXTRA_fstminimize_DEPENDENCIES) \n\t@rm -f fstminimize$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(fstminimize_OBJECTS) $(fstminimize_LDADD) $(LIBS)\n\nfstprint$(EXEEXT): $(fstprint_OBJECTS) $(fstprint_DEPENDENCIES) $(EXTRA_fstprint_DEPENDENCIES) \n\t@rm -f fstprint$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(fstprint_OBJECTS) $(fstprint_LDADD) $(LIBS)\n\nfstproject$(EXEEXT): $(fstproject_OBJECTS) $(fstproject_DEPENDENCIES) $(EXTRA_fstproject_DEPENDENCIES) \n\t@rm -f fstproject$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(fstproject_OBJECTS) $(fstproject_LDADD) $(LIBS)\n\nfstprune$(EXEEXT): $(fstprune_OBJECTS) $(fstprune_DEPENDENCIES) $(EXTRA_fstprune_DEPENDENCIES) \n\t@rm -f fstprune$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(fstprune_OBJECTS) $(fstprune_LDADD) $(LIBS)\n\nfstpush$(EXEEXT): $(fstpush_OBJECTS) $(fstpush_DEPENDENCIES) $(EXTRA_fstpush_DEPENDENCIES) \n\t@rm -f fstpush$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(fstpush_OBJECTS) $(fstpush_LDADD) $(LIBS)\n\nfstrandgen$(EXEEXT): $(fstrandgen_OBJECTS) $(fstrandgen_DEPENDENCIES) $(EXTRA_fstrandgen_DEPENDENCIES) \n\t@rm -f fstrandgen$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(fstrandgen_OBJECTS) $(fstrandgen_LDADD) $(LIBS)\n\nfstrelabel$(EXEEXT): $(fstrelabel_OBJECTS) $(fstrelabel_DEPENDENCIES) $(EXTRA_fstrelabel_DEPENDENCIES) \n\t@rm -f fstrelabel$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(fstrelabel_OBJECTS) $(fstrelabel_LDADD) $(LIBS)\n\nfstreplace$(EXEEXT): $(fstreplace_OBJECTS) $(fstreplace_DEPENDENCIES) $(EXTRA_fstreplace_DEPENDENCIES) \n\t@rm -f fstreplace$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(fstreplace_OBJECTS) $(fstreplace_LDADD) $(LIBS)\n\nfstreverse$(EXEEXT): $(fstreverse_OBJECTS) $(fstreverse_DEPENDENCIES) $(EXTRA_fstreverse_DEPENDENCIES) \n\t@rm -f fstreverse$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(fstreverse_OBJECTS) $(fstreverse_LDADD) $(LIBS)\n\nfstreweight$(EXEEXT): $(fstreweight_OBJECTS) $(fstreweight_DEPENDENCIES) $(EXTRA_fstreweight_DEPENDENCIES) \n\t@rm -f fstreweight$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(fstreweight_OBJECTS) $(fstreweight_LDADD) $(LIBS)\n\nfstrmepsilon$(EXEEXT): $(fstrmepsilon_OBJECTS) $(fstrmepsilon_DEPENDENCIES) $(EXTRA_fstrmepsilon_DEPENDENCIES) \n\t@rm -f fstrmepsilon$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(fstrmepsilon_OBJECTS) $(fstrmepsilon_LDADD) $(LIBS)\n\nfstshortestdistance$(EXEEXT): $(fstshortestdistance_OBJECTS) $(fstshortestdistance_DEPENDENCIES) $(EXTRA_fstshortestdistance_DEPENDENCIES) \n\t@rm -f fstshortestdistance$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(fstshortestdistance_OBJECTS) $(fstshortestdistance_LDADD) $(LIBS)\n\nfstshortestpath$(EXEEXT): $(fstshortestpath_OBJECTS) $(fstshortestpath_DEPENDENCIES) $(EXTRA_fstshortestpath_DEPENDENCIES) \n\t@rm -f fstshortestpath$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(fstshortestpath_OBJECTS) $(fstshortestpath_LDADD) $(LIBS)\n\nfstsymbols$(EXEEXT): $(fstsymbols_OBJECTS) $(fstsymbols_DEPENDENCIES) $(EXTRA_fstsymbols_DEPENDENCIES) \n\t@rm -f fstsymbols$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(fstsymbols_OBJECTS) $(fstsymbols_LDADD) $(LIBS)\n\nfstsynchronize$(EXEEXT): $(fstsynchronize_OBJECTS) $(fstsynchronize_DEPENDENCIES) $(EXTRA_fstsynchronize_DEPENDENCIES) \n\t@rm -f fstsynchronize$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(fstsynchronize_OBJECTS) $(fstsynchronize_LDADD) $(LIBS)\n\nfsttopsort$(EXEEXT): $(fsttopsort_OBJECTS) $(fsttopsort_DEPENDENCIES) $(EXTRA_fsttopsort_DEPENDENCIES) \n\t@rm -f fsttopsort$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(fsttopsort_OBJECTS) $(fsttopsort_LDADD) $(LIBS)\n\nfstunion$(EXEEXT): $(fstunion_OBJECTS) $(fstunion_DEPENDENCIES) $(EXTRA_fstunion_DEPENDENCIES) \n\t@rm -f fstunion$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(fstunion_OBJECTS) $(fstunion_LDADD) $(LIBS)\n\nmostlyclean-compile:\n\t-rm -f *.$(OBJEXT)\n\ndistclean-compile:\n\t-rm -f *.tab.c\n\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstarcsort-main.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstarcsort.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstclosure-main.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstclosure.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstcompile-main.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstcompile.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstcompose-main.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstcompose.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstconcat-main.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstconcat.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstconnect-main.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstconnect.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstconvert-main.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstconvert.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstdeterminize-main.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstdeterminize.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstdifference-main.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstdifference.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstdisambiguate-main.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstdisambiguate.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstdraw-main.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstdraw.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstencode-main.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstencode.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstepsnormalize-main.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstepsnormalize.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstequal-main.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstequal.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstequivalent-main.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstequivalent.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstinfo-main.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstinfo.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstintersect-main.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstintersect.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstinvert-main.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstinvert.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstisomorphic-main.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstisomorphic.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstmap-main.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstmap.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstminimize-main.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstminimize.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstprint-main.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstprint.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstproject-main.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstproject.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstprune-main.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstprune.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstpush-main.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstpush.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstrandgen-main.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstrandgen.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstrelabel-main.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstrelabel.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstreplace-main.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstreplace.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstreverse-main.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstreverse.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstreweight-main.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstreweight.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstrmepsilon-main.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstrmepsilon.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstshortestdistance-main.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstshortestdistance.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstshortestpath-main.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstshortestpath.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstsymbols-main.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstsymbols.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstsynchronize-main.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstsynchronize.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fsttopsort-main.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fsttopsort.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstunion-main.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstunion.Po@am__quote@\n\n.cc.o:\n@am__fastdepCXX_TRUE@\t$(AM_V_CXX)depbase=`echo $@ | sed 's|[^/]*$$|$(DEPDIR)/&|;s|\\.o$$||'`;\\\n@am__fastdepCXX_TRUE@\t$(CXXCOMPILE) -MT $@ -MD -MP -MF $$depbase.Tpo -c -o $@ $< &&\\\n@am__fastdepCXX_TRUE@\t$(am__mv) $$depbase.Tpo $$depbase.Po\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\t$(AM_V_CXX)source='$<' object='$@' libtool=no @AMDEPBACKSLASH@\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\tDEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@\n@am__fastdepCXX_FALSE@\t$(AM_V_CXX@am__nodep@)$(CXXCOMPILE) -c -o $@ $<\n\n.cc.obj:\n@am__fastdepCXX_TRUE@\t$(AM_V_CXX)depbase=`echo $@ | sed 's|[^/]*$$|$(DEPDIR)/&|;s|\\.obj$$||'`;\\\n@am__fastdepCXX_TRUE@\t$(CXXCOMPILE) -MT $@ -MD -MP -MF $$depbase.Tpo -c -o $@ `$(CYGPATH_W) '$<'` &&\\\n@am__fastdepCXX_TRUE@\t$(am__mv) $$depbase.Tpo $$depbase.Po\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\t$(AM_V_CXX)source='$<' object='$@' libtool=no @AMDEPBACKSLASH@\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\tDEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@\n@am__fastdepCXX_FALSE@\t$(AM_V_CXX@am__nodep@)$(CXXCOMPILE) -c -o $@ `$(CYGPATH_W) '$<'`\n\n.cc.lo:\n@am__fastdepCXX_TRUE@\t$(AM_V_CXX)depbase=`echo $@ | sed 's|[^/]*$$|$(DEPDIR)/&|;s|\\.lo$$||'`;\\\n@am__fastdepCXX_TRUE@\t$(LTCXXCOMPILE) -MT $@ -MD -MP -MF $$depbase.Tpo -c -o $@ $< &&\\\n@am__fastdepCXX_TRUE@\t$(am__mv) $$depbase.Tpo $$depbase.Plo\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\t$(AM_V_CXX)source='$<' object='$@' libtool=yes @AMDEPBACKSLASH@\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\tDEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@\n@am__fastdepCXX_FALSE@\t$(AM_V_CXX@am__nodep@)$(LTCXXCOMPILE) -c -o $@ $<\n\nmostlyclean-libtool:\n\t-rm -f *.lo\n\nclean-libtool:\n\t-rm -rf .libs _libs\n\nID: $(am__tagged_files)\n\t$(am__define_uniq_tagged_files); mkid -fID $$unique\ntags: tags-am\nTAGS: tags\n\ntags-am: $(TAGS_DEPENDENCIES) $(am__tagged_files)\n\tset x; \\\n\there=`pwd`; \\\n\t$(am__define_uniq_tagged_files); \\\n\tshift; \\\n\tif test -z \"$(ETAGS_ARGS)$$*$$unique\"; then :; else \\\n\t  test -n \"$$unique\" || unique=$$empty_fix; \\\n\t  if test $$# -gt 0; then \\\n\t    $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \\\n\t      \"$$@\" $$unique; \\\n\t  else \\\n\t    $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \\\n\t      $$unique; \\\n\t  fi; \\\n\tfi\nctags: ctags-am\n\nCTAGS: ctags\nctags-am: $(TAGS_DEPENDENCIES) $(am__tagged_files)\n\t$(am__define_uniq_tagged_files); \\\n\ttest -z \"$(CTAGS_ARGS)$$unique\" \\\n\t  || $(CTAGS) $(CTAGSFLAGS) $(AM_CTAGSFLAGS) $(CTAGS_ARGS) \\\n\t     $$unique\n\nGTAGS:\n\there=`$(am__cd) $(top_builddir) && pwd` \\\n\t  && $(am__cd) $(top_srcdir) \\\n\t  && gtags -i $(GTAGS_ARGS) \"$$here\"\ncscopelist: cscopelist-am\n\ncscopelist-am: $(am__tagged_files)\n\tlist='$(am__tagged_files)'; \\\n\tcase \"$(srcdir)\" in \\\n\t  [\\\\/]* | ?:[\\\\/]*) sdir=\"$(srcdir)\" ;; \\\n\t  *) sdir=$(subdir)/$(srcdir) ;; \\\n\tesac; \\\n\tfor i in $$list; do \\\n\t  if test -f \"$$i\"; then \\\n\t    echo \"$(subdir)/$$i\"; \\\n\t  else \\\n\t    echo \"$$sdir/$$i\"; \\\n\t  fi; \\\n\tdone >> $(top_builddir)/cscope.files\n\ndistclean-tags:\n\t-rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags\n\ndistdir: $(DISTFILES)\n\t@srcdirstrip=`echo \"$(srcdir)\" | sed 's/[].[^$$\\\\*]/\\\\\\\\&/g'`; \\\n\ttopsrcdirstrip=`echo \"$(top_srcdir)\" | sed 's/[].[^$$\\\\*]/\\\\\\\\&/g'`; \\\n\tlist='$(DISTFILES)'; \\\n\t  dist_files=`for file in $$list; do echo $$file; done | \\\n\t  sed -e \"s|^$$srcdirstrip/||;t\" \\\n\t      -e \"s|^$$topsrcdirstrip/|$(top_builddir)/|;t\"`; \\\n\tcase $$dist_files in \\\n\t  */*) $(MKDIR_P) `echo \"$$dist_files\" | \\\n\t\t\t   sed '/\\//!d;s|^|$(distdir)/|;s,/[^/]*$$,,' | \\\n\t\t\t   sort -u` ;; \\\n\tesac; \\\n\tfor file in $$dist_files; do \\\n\t  if test -f $$file || test -d $$file; then d=.; else d=$(srcdir); fi; \\\n\t  if test -d $$d/$$file; then \\\n\t    dir=`echo \"/$$file\" | sed -e 's,/[^/]*$$,,'`; \\\n\t    if test -d \"$(distdir)/$$file\"; then \\\n\t      find \"$(distdir)/$$file\" -type d ! -perm -700 -exec chmod u+rwx {} \\;; \\\n\t    fi; \\\n\t    if test -d $(srcdir)/$$file && test $$d != $(srcdir); then \\\n\t      cp -fpR $(srcdir)/$$file \"$(distdir)$$dir\" || exit 1; \\\n\t      find \"$(distdir)/$$file\" -type d ! -perm -700 -exec chmod u+rwx {} \\;; \\\n\t    fi; \\\n\t    cp -fpR $$d/$$file \"$(distdir)$$dir\" || exit 1; \\\n\t  else \\\n\t    test -f \"$(distdir)/$$file\" \\\n\t    || cp -p $$d/$$file \"$(distdir)/$$file\" \\\n\t    || exit 1; \\\n\t  fi; \\\n\tdone\ncheck-am: all-am\ncheck: check-am\nall-am: Makefile $(PROGRAMS)\ninstalldirs:\n\tfor dir in \"$(DESTDIR)$(bindir)\"; do \\\n\t  test -z \"$$dir\" || $(MKDIR_P) \"$$dir\"; \\\n\tdone\ninstall: install-am\ninstall-exec: install-exec-am\ninstall-data: install-data-am\nuninstall: uninstall-am\n\ninstall-am: all-am\n\t@$(MAKE) $(AM_MAKEFLAGS) install-exec-am install-data-am\n\ninstallcheck: installcheck-am\ninstall-strip:\n\tif test -z '$(STRIP)'; then \\\n\t  $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" \\\n\t    install_sh_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" INSTALL_STRIP_FLAG=-s \\\n\t      install; \\\n\telse \\\n\t  $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" \\\n\t    install_sh_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" INSTALL_STRIP_FLAG=-s \\\n\t    \"INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'\" install; \\\n\tfi\nmostlyclean-generic:\n\nclean-generic:\n\ndistclean-generic:\n\t-test -z \"$(CONFIG_CLEAN_FILES)\" || rm -f $(CONFIG_CLEAN_FILES)\n\t-test . = \"$(srcdir)\" || test -z \"$(CONFIG_CLEAN_VPATH_FILES)\" || rm -f $(CONFIG_CLEAN_VPATH_FILES)\n\nmaintainer-clean-generic:\n\t@echo \"This command is intended for maintainers to use\"\n\t@echo \"it deletes files that may require special tools to rebuild.\"\nclean: clean-am\n\nclean-am: clean-binPROGRAMS clean-generic clean-libtool mostlyclean-am\n\ndistclean: distclean-am\n\t-rm -rf ./$(DEPDIR)\n\t-rm -f Makefile\ndistclean-am: clean-am distclean-compile distclean-generic \\\n\tdistclean-tags\n\ndvi: dvi-am\n\ndvi-am:\n\nhtml: html-am\n\nhtml-am:\n\ninfo: info-am\n\ninfo-am:\n\ninstall-data-am:\n\ninstall-dvi: install-dvi-am\n\ninstall-dvi-am:\n\ninstall-exec-am: install-binPROGRAMS\n\ninstall-html: install-html-am\n\ninstall-html-am:\n\ninstall-info: install-info-am\n\ninstall-info-am:\n\ninstall-man:\n\ninstall-pdf: install-pdf-am\n\ninstall-pdf-am:\n\ninstall-ps: install-ps-am\n\ninstall-ps-am:\n\ninstallcheck-am:\n\nmaintainer-clean: maintainer-clean-am\n\t-rm -rf ./$(DEPDIR)\n\t-rm -f Makefile\nmaintainer-clean-am: distclean-am maintainer-clean-generic\n\nmostlyclean: mostlyclean-am\n\nmostlyclean-am: mostlyclean-compile mostlyclean-generic \\\n\tmostlyclean-libtool\n\npdf: pdf-am\n\npdf-am:\n\nps: ps-am\n\nps-am:\n\nuninstall-am: uninstall-binPROGRAMS\n\n.MAKE: install-am install-strip\n\n.PHONY: CTAGS GTAGS TAGS all all-am check check-am clean \\\n\tclean-binPROGRAMS clean-generic clean-libtool cscopelist-am \\\n\tctags ctags-am distclean distclean-compile distclean-generic \\\n\tdistclean-libtool distclean-tags distdir dvi dvi-am html \\\n\thtml-am info info-am install install-am install-binPROGRAMS \\\n\tinstall-data install-data-am install-dvi install-dvi-am \\\n\tinstall-exec install-exec-am install-html install-html-am \\\n\tinstall-info install-info-am install-man install-pdf \\\n\tinstall-pdf-am install-ps install-ps-am install-strip \\\n\tinstallcheck installcheck-am installdirs maintainer-clean \\\n\tmaintainer-clean-generic mostlyclean mostlyclean-compile \\\n\tmostlyclean-generic mostlyclean-libtool pdf pdf-am ps ps-am \\\n\ttags tags-am uninstall uninstall-am uninstall-binPROGRAMS\n\n\n# Tell versions [3.59,3.63) of GNU make to not export all variables.\n# Otherwise a system limit (for SysV at least) may be exceeded.\n.NOEXPORT:\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/bin/fstarcsort-main.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Sorts arcs of an FST.\n\n#include <cstring>\n\n#include <memory>\n#include <string>\n\n#include <fst/flags.h>\n#include <fst/log.h>\n#include <fst/script/arcsort.h>\n#include <fst/script/getters.h>\n\nDECLARE_string(sort_type);\n\nint fstarcsort_main(int argc, char **argv) {\n  namespace s = fst::script;\n  using fst::script::MutableFstClass;\n\n  string usage = \"Sorts arcs of an FST.\\n\\n  Usage: \";\n  usage += argv[0];\n  usage += \" [in.fst [out.fst]]\\n\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n\n  if (argc > 3) {\n    ShowUsage();\n    return 1;\n  }\n\n  const string in_name =\n      (argc > 1 && (strcmp(argv[1], \"-\") != 0)) ? argv[1] : \"\";\n  const string out_name = argc > 2 ? argv[2] : \"\";\n\n  std::unique_ptr<MutableFstClass> fst(MutableFstClass::Read(in_name, true));\n  if (!fst) return 1;\n\n  s::ArcSortType sort_type;\n  if (!s::GetArcSortType(FLAGS_sort_type, &sort_type)) {\n    LOG(ERROR) << argv[0] << \": Unknown or unsupported sort type: \"\n               << FLAGS_sort_type;\n    return 1;\n  }\n\n  s::ArcSort(fst.get(), sort_type);\n\n  return !fst->Write(out_name);\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/bin/fstarcsort.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/compat.h>\n#include <fst/flags.h>\n\nDEFINE_string(sort_type, \"ilabel\",\n              \"Comparison method, one of: \\\"ilabel\\\", \\\"olabel\\\"\");\n\nint fstarcsort_main(int argc, char **argv);\n\nint main(int argc, char **argv) { return fstarcsort_main(argc, argv); }\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/bin/fstclosure-main.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Creates the Kleene closure of an FST.\n\n#include <cstring>\n\n#include <memory>\n#include <string>\n\n#include <fst/flags.h>\n#include <fst/script/closure.h>\n#include <fst/script/getters.h>\n\nDECLARE_bool(closure_plus);\n\nint fstclosure_main(int argc, char **argv) {\n  namespace s = fst::script;\n  using fst::script::MutableFstClass;\n\n  string usage = \"Creates the Kleene closure of an FST.\\n\\n  Usage: \";\n  usage += argv[0];\n  usage += \" [in.fst [out.fst]]\\n\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n  if (argc > 3) {\n    ShowUsage();\n    return 1;\n  }\n\n  const string in_name = (argc > 1 && strcmp(argv[1], \"-\") != 0) ? argv[1] : \"\";\n  const string out_name = argc > 2 ? argv[2] : \"\";\n\n  std::unique_ptr<MutableFstClass> fst(MutableFstClass::Read(in_name, true));\n  if (!fst) return 1;\n\n  s::Closure(fst.get(), s::GetClosureType(FLAGS_closure_plus));\n\n  return !fst->Write(out_name);\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/bin/fstclosure.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/flags.h>\n\nDEFINE_bool(closure_plus, false,\n            \"Do not add the empty path (T+ instead of T*)?\");\n\nint fstclosure_main(int argc, char **argv);\n\nint main(int argc, char **argv) { return fstclosure_main(argc, argv); }\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/bin/fstcompile-main.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Creates binary FSTs from simple text format used by AT&T.\n\n#include <cstring>\n\n#include <fstream>\n#include <istream>\n#include <memory>\n#include <string>\n\n#include <fst/flags.h>\n#include <fst/log.h>\n#include <fst/script/compile.h>\n\nDECLARE_bool(acceptor);\nDECLARE_string(arc_type);\nDECLARE_string(fst_type);\nDECLARE_string(isymbols);\nDECLARE_string(osymbols);\nDECLARE_string(ssymbols);\nDECLARE_bool(keep_isymbols);\nDECLARE_bool(keep_osymbols);\nDECLARE_bool(keep_state_numbering);\nDECLARE_bool(allow_negative_labels);\n\nint fstcompile_main(int argc, char **argv) {\n  namespace s = fst::script;\n  using fst::SymbolTable;\n  using fst::SymbolTableTextOptions;\n\n  string usage = \"Creates binary FSTs from simple text format.\\n\\n  Usage: \";\n  usage += argv[0];\n  usage += \" [text.fst [binary.fst]]\\n\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n  if (argc > 3) {\n    ShowUsage();\n    return 1;\n  }\n\n  string source = \"standard input\";\n  std::ifstream fstrm;\n  if (argc > 1 && strcmp(argv[1], \"-\") != 0) {\n    fstrm.open(argv[1]);\n    if (!fstrm) {\n      LOG(ERROR) << argv[0] << \": Open failed, file = \" << argv[1];\n      return 1;\n    }\n    source = argv[1];\n  }\n  std::istream &istrm = fstrm.is_open() ? fstrm : std::cin;\n\n  const SymbolTableTextOptions opts(FLAGS_allow_negative_labels);\n\n  std::unique_ptr<const SymbolTable> isyms;\n  if (!FLAGS_isymbols.empty()) {\n    isyms.reset(SymbolTable::ReadText(FLAGS_isymbols, opts));\n    if (!isyms) return 1;\n  }\n\n  std::unique_ptr<const SymbolTable> osyms;\n  if (!FLAGS_osymbols.empty()) {\n    osyms.reset(SymbolTable::ReadText(FLAGS_osymbols, opts));\n    if (!osyms) return 1;\n  }\n\n  std::unique_ptr<const SymbolTable> ssyms;\n  if (!FLAGS_ssymbols.empty()) {\n    ssyms.reset(SymbolTable::ReadText(FLAGS_ssymbols));\n    if (!ssyms) return 1;\n  }\n\n  const string dest = argc > 2 ? argv[2] : \"\";\n\n  s::CompileFst(istrm, source, dest, FLAGS_fst_type, FLAGS_arc_type,\n                isyms.get(), osyms.get(), ssyms.get(), FLAGS_acceptor,\n                FLAGS_keep_isymbols, FLAGS_keep_osymbols,\n                FLAGS_keep_state_numbering, FLAGS_allow_negative_labels);\n\n  return 0;\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/bin/fstcompile.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/flags.h>\n\nDEFINE_bool(acceptor, false, \"Input in acceptor format\");\nDEFINE_string(arc_type, \"standard\", \"Output arc type\");\nDEFINE_string(fst_type, \"vector\", \"Output FST type\");\nDEFINE_string(isymbols, \"\", \"Input label symbol table\");\nDEFINE_string(osymbols, \"\", \"Output label symbol table\");\nDEFINE_string(ssymbols, \"\", \"State label symbol table\");\nDEFINE_bool(keep_isymbols, false, \"Store input label symbol table with FST\");\nDEFINE_bool(keep_osymbols, false, \"Store output label symbol table with FST\");\nDEFINE_bool(keep_state_numbering, false, \"Do not renumber input states\");\nDEFINE_bool(allow_negative_labels, false,\n            \"Allow negative labels (not recommended; may cause conflicts)\");\n\nint fstcompile_main(int argc, char **argv);\n\nint main(int argc, char **argv) { return fstcompile_main(argc, argv); }\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/bin/fstcompose-main.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Composes two FSTs.\n\n#include <cstring>\n\n#include <memory>\n#include <string>\n\n#include <fst/flags.h>\n#include <fst/log.h>\n#include <fst/script/compose.h>\n#include <fst/script/getters.h>\n\nDECLARE_string(compose_filter);\nDECLARE_bool(connect);\n\nint fstcompose_main(int argc, char **argv) {\n  namespace s = fst::script;\n  using fst::ComposeFilter;\n  using fst::ComposeOptions;\n  using fst::script::FstClass;\n  using fst::script::VectorFstClass;\n\n  string usage = \"Composes two FSTs.\\n\\n  Usage: \";\n  usage += argv[0];\n  usage += \" in1.fst in2.fst [out.fst]\\n\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n  if (argc < 3 || argc > 4) {\n    ShowUsage();\n    return 1;\n  }\n\n  const string in1_name = strcmp(argv[1], \"-\") != 0 ? argv[1] : \"\";\n  const string in2_name =\n      (argc > 2 && (strcmp(argv[2], \"-\") != 0)) ? argv[2] : \"\";\n  const string out_name = argc > 3 ? argv[3] : \"\";\n\n  if (in1_name.empty() && in2_name.empty()) {\n    LOG(ERROR) << argv[0] << \": Can't take both inputs from standard input\";\n    return 1;\n  }\n\n  std::unique_ptr<FstClass> ifst1(FstClass::Read(in1_name));\n  if (!ifst1) return 1;\n\n  std::unique_ptr<FstClass> ifst2(FstClass::Read(in2_name));\n  if (!ifst2) return 1;\n\n  if (ifst1->ArcType() != ifst2->ArcType()) {\n    LOG(ERROR) << argv[0] << \": Input FSTs must have the same arc type\";\n    return 1;\n  }\n\n  VectorFstClass ofst(ifst1->ArcType());\n\n  ComposeFilter compose_filter;\n  if (!s::GetComposeFilter(FLAGS_compose_filter, &compose_filter)) {\n    LOG(ERROR) << argv[0] << \": Unknown or unsupported compose filter type: \"\n               << FLAGS_compose_filter;\n    return 1;\n  }\n\n  const ComposeOptions opts(FLAGS_connect, compose_filter);\n\n  s::Compose(*ifst1, *ifst2, &ofst, opts);\n\n  return !ofst.Write(out_name);\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/bin/fstcompose.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/flags.h>\n\nDEFINE_string(compose_filter, \"auto\",\n              \"Composition filter, one of: \\\"alt_sequence\\\", \\\"auto\\\", \"\n              \"\\\"match\\\", \\\"null\\\", \\\"sequence\\\", \\\"trivial\\\"\");\nDEFINE_bool(connect, true, \"Trim output\");\n\nint fstcompose_main(int argc, char **argv);\n\nint main(int argc, char **argv) { return fstcompose_main(argc, argv); }\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/bin/fstconcat-main.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Concatenates two FSTs.\n\n#include <cstring>\n\n#include <memory>\n#include <string>\n\n#include <fst/flags.h>\n#include <fst/log.h>\n#include <fst/script/concat.h>\n\nint fstconcat_main(int argc, char **argv) {\n  namespace s = fst::script;\n  using fst::script::FstClass;\n  using fst::script::MutableFstClass;\n\n  string usage = \"Concatenates two FSTs.\\n\\n  Usage: \";\n  usage += argv[0];\n  usage += \" in1.fst in2.fst [out.fst]\\n\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n  if (argc < 3 || argc > 4) {\n    ShowUsage();\n    return 1;\n  }\n\n  const string in1_name = strcmp(argv[1], \"-\") == 0 ? \"\" : argv[1];\n  const string in2_name = strcmp(argv[2], \"-\") == 0 ? \"\" : argv[2];\n  const string out_name = argc > 3 ? argv[3] : \"\";\n\n  if (in1_name.empty() && in2_name.empty()) {\n    LOG(ERROR) << argv[0] << \": Can't take both inputs from standard input\";\n    return 1;\n  }\n\n  std::unique_ptr<MutableFstClass> fst1(MutableFstClass::Read(in1_name, true));\n  if (!fst1) return 1;\n\n  std::unique_ptr<FstClass> fst2(FstClass::Read(in2_name));\n  if (!fst2) return 1;\n\n  s::Concat(fst1.get(), *fst2);\n\n  return !fst1->Write(out_name);\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/bin/fstconcat.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\nint fstconcat_main(int argc, char **argv);\n\nint main(int argc, char **argv) { return fstconcat_main(argc, argv); }\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/bin/fstconnect-main.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Removes useless (inaccessible or non-coaccessible) states and arcs from an\n// FST.\n\n#include <cstring>\n\n#include <memory>\n#include <string>\n\n#include <fst/flags.h>\n#include <fst/script/connect.h>\n\nint fstconnect_main(int argc, char **argv) {\n  namespace s = fst::script;\n  using fst::script::FstClass;\n  using fst::script::MutableFstClass;\n\n  string usage = \"Removes useless states and arcs from an FST.\\n\\n  Usage: \";\n  usage += argv[0];\n  usage += \" [in.fst [out.fst]]\\n\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n  if (argc > 3) {\n    ShowUsage();\n    return 1;\n  }\n\n  const string in_name = (argc > 1 && strcmp(argv[1], \"-\") != 0) ? argv[1] : \"\";\n  const string out_name = argc > 2 ? argv[2] : \"\";\n\n  std::unique_ptr<MutableFstClass> fst(MutableFstClass::Read(in_name, true));\n  if (!fst) return 1;\n\n  s::Connect(fst.get());\n\n  return !fst->Write(out_name);\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/bin/fstconnect.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\nint fstconnect_main(int argc, char **argv);\n\nint main(int argc, char **argv) { return fstconnect_main(argc, argv); }\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/bin/fstconvert-main.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Converts an FST to another type.\n\n#include <cstring>\n\n#include <memory>\n#include <string>\n\n#include <fst/flags.h>\n#include <fst/script/convert.h>\n\nDECLARE_string(fst_type);\n\nint fstconvert_main(int argc, char **argv) {\n  namespace s = fst::script;\n  using fst::script::FstClass;\n\n  string usage = \"Converts an FST to another type.\\n\\n  Usage: \";\n  usage += argv[0];\n  usage += \" [in.fst [out.fst]]\\n\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n  if (argc > 3) {\n    ShowUsage();\n    return 1;\n  }\n\n  const string in_name = (argc > 1 && strcmp(argv[1], \"-\") != 0) ? argv[1] : \"\";\n  const string out_name = argc > 2 ? argv[2] : \"\";\n\n  std::unique_ptr<FstClass> ifst(FstClass::Read(in_name));\n  if (!ifst) return 1;\n\n  if (ifst->FstType() != FLAGS_fst_type) {\n    std::unique_ptr<FstClass> ofst(s::Convert(*ifst, FLAGS_fst_type));\n    if (!ofst) return 1;\n    return !ofst->Write(out_name);\n  } else {\n    return !ifst->Write(out_name);\n  }\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/bin/fstconvert.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/flags.h>\n\nDEFINE_string(fst_type, \"vector\", \"Output FST type\");\n\nint fstconvert_main(int argc, char **argv);\n\nint main(int argc, char **argv) { return fstconvert_main(argc, argv); }\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/bin/fstdeterminize-main.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Determinizes an FST.\n\n#include <cstring>\n\n#include <memory>\n#include <string>\n\n#include <fst/flags.h>\n#include <fst/script/determinize.h>\n#include <fst/script/getters.h>\n\nDECLARE_double(delta);\nDECLARE_string(weight);\nDECLARE_int64(nstate);\nDECLARE_int64(subsequential_label);\nDECLARE_string(det_type);\nDECLARE_bool(increment_subsequential_label);\n\nint fstdeterminize_main(int argc, char **argv) {\n  namespace s = fst::script;\n  using fst::DeterminizeType;\n  using fst::script::FstClass;\n  using fst::script::VectorFstClass;\n  using fst::script::WeightClass;\n\n  string usage = \"Determinizes an FST.\\n\\n  Usage: \";\n  usage += argv[0];\n  usage += \" [in.fst [out.fst]]\\n\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n  if (argc > 3) {\n    ShowUsage();\n    return 1;\n  }\n\n  DeterminizeType det_type;\n  if (!s::GetDeterminizeType(FLAGS_det_type, &det_type)) {\n    LOG(ERROR) << argv[0] << \": Unknown or unsupported determinization type: \"\n                          << FLAGS_det_type;\n    return 1;\n  }\n\n  const string in_name = (argc > 1 && strcmp(argv[1], \"-\") != 0) ? argv[1] : \"\";\n  const string out_name = argc > 2 ? argv[2] : \"\";\n\n  std::unique_ptr<FstClass> ifst(FstClass::Read(in_name));\n  if (!ifst) return 1;\n\n  VectorFstClass ofst(ifst->ArcType());\n\n  const auto weight_threshold =\n      FLAGS_weight.empty() ? WeightClass::Zero(ifst->WeightType())\n                           : WeightClass(ifst->WeightType(), FLAGS_weight);\n\n  const s::DeterminizeOptions opts(FLAGS_delta, weight_threshold, FLAGS_nstate,\n                                   FLAGS_subsequential_label, det_type,\n                                   FLAGS_increment_subsequential_label);\n\n  s::Determinize(*ifst, &ofst, opts);\n\n  return !ofst.Write(out_name);\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/bin/fstdeterminize.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/flags.h>\n#include <fst/fst.h>\n#include <fst/weight.h>\n\nDEFINE_double(delta, fst::kDelta, \"Comparison/quantization delta\");\nDEFINE_string(weight, \"\", \"Weight threshold\");\nDEFINE_int64(nstate, fst::kNoStateId, \"State number threshold\");\nDEFINE_int64(subsequential_label, 0,\n             \"Input label of arc corresponding to residual final output when\"\n             \" producing a subsequential transducer\");\nDEFINE_string(det_type, \"functional\",\n              \"Type of determinization: \\\"functional\\\", \"\n              \"\\\"nonfunctional\\\", \\\"disambiguate\\\"\");\nDEFINE_bool(increment_subsequential_label, false,\n            \"Increment subsequential_label to obtain distinct labels for \"\n            \" subsequential arcs at a given state\");\n\nint fstdeterminize_main(int argc, char **argv);\n\nint main(int argc, char **argv) { return fstdeterminize_main(argc, argv); }\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/bin/fstdifference-main.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Subtracts an unweighted DFA from an FSA.\n\n#include <cstring>\n\n#include <memory>\n#include <string>\n\n#include <fst/flags.h>\n#include <fst/log.h>\n#include <fst/script/getters.h>\n#include <fst/script/difference.h>\n\nDECLARE_string(compose_filter);\nDECLARE_bool(connect);\n\nint fstdifference_main(int argc, char **argv) {\n  namespace s = fst::script;\n  using fst::ComposeFilter;\n  using fst::DifferenceOptions;\n  using fst::script::FstClass;\n  using fst::script::VectorFstClass;\n\n  string usage = \"Subtracts an unweighted DFA from an FSA.\\n\\n  Usage: \";\n  usage += argv[0];\n  usage += \" in1.fst in2.fst [out.fst]\\n\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n  if (argc < 3 || argc > 4) {\n    ShowUsage();\n    return 1;\n  }\n\n  const string in1_name = strcmp(argv[1], \"-\") == 0 ? \"\" : argv[1];\n  const string in2_name = strcmp(argv[2], \"-\") == 0 ? \"\" : argv[2];\n  const string out_name = argc > 3 ? argv[3] : \"\";\n\n  if (in1_name.empty() && in2_name.empty()) {\n    LOG(ERROR) << argv[0] << \": Can't take both inputs from standard input\";\n    return 1;\n  }\n\n  std::unique_ptr<FstClass> ifst1(FstClass::Read(in1_name));\n  if (!ifst1) return 1;\n\n  std::unique_ptr<FstClass> ifst2(FstClass::Read(in2_name));\n  if (!ifst2) return 1;\n\n  VectorFstClass ofst(ifst1->ArcType());\n\n  ComposeFilter compose_filter;\n  if (!s::GetComposeFilter(FLAGS_compose_filter, &compose_filter)) {\n    LOG(ERROR) << argv[0] << \": Unknown or unsupported compose filter type: \"\n               << FLAGS_compose_filter;\n    return 1;\n  }\n\n  const DifferenceOptions opts(FLAGS_connect, compose_filter);\n\n  s::Difference(*ifst1, *ifst2, &ofst, opts);\n\n  return !ofst.Write(out_name);\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/bin/fstdifference.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/flags.h>\n\nDEFINE_string(compose_filter, \"auto\",\n              \"Composition filter, one of: \\\"alt_sequence\\\", \\\"auto\\\", \"\n              \"\\\"match\\\", \\\"null\\\", \\\"sequence\\\", \\\"trivial\\\"\");\nDEFINE_bool(connect, true, \"Trim output\");\n\nint fstdifference_main(int argc, char **argv);\n\nint main(int argc, char **argv) { return fstdifference_main(argc, argv); }\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/bin/fstdisambiguate-main.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Disambiguates an FST.\n\n#include <cstring>\n\n#include <memory>\n#include <string>\n\n#include <fst/flags.h>\n#include <fst/script/disambiguate.h>\n\nDECLARE_double(delta);\nDECLARE_int64(nstate);\nDECLARE_string(weight);\nDECLARE_int64(subsequential_label);\n\nint fstdisambiguate_main(int argc, char **argv) {\n  namespace s = fst::script;\n  using fst::script::FstClass;\n  using fst::script::VectorFstClass;\n  using fst::script::WeightClass;\n\n  string usage = \"Disambiguates an FST.\\n\\n  Usage: \";\n  usage += argv[0];\n  usage += \" [in.fst [out.fst]]\\n\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n  if (argc > 3) {\n    ShowUsage();\n    return 1;\n  }\n\n  const string in_name = (argc > 1 && strcmp(argv[1], \"-\") != 0) ? argv[1] : \"\";\n  const string out_name = argc > 2 ? argv[2] : \"\";\n\n  std::unique_ptr<FstClass> ifst(FstClass::Read(in_name));\n  if (!ifst) return 1;\n\n  VectorFstClass ofst(ifst->ArcType());\n\n  const auto weight_threshold =\n      FLAGS_weight.empty() ? WeightClass::Zero(ifst->WeightType())\n                           : WeightClass(ifst->WeightType(), FLAGS_weight);\n\n  const s::DisambiguateOptions opts(FLAGS_delta, weight_threshold, FLAGS_nstate,\n                                    FLAGS_subsequential_label);\n\n  s::Disambiguate(*ifst, &ofst, opts);\n\n  return !ofst.Write(out_name);\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/bin/fstdisambiguate.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/flags.h>\n#include <fst/fst.h>\n#include <fst/weight.h>\n\nDEFINE_double(delta, fst::kDelta, \"Comparison/quantization delta\");\nDEFINE_int64(nstate, fst::kNoStateId, \"State number threshold\");\nDEFINE_string(weight, \"\", \"Weight threshold\");\nDEFINE_int64(subsequential_label, 0,\n             \"Input label of arc corresponding to residual final output when\"\n             \" producing a subsequential transducer\");\n\nint fstdisambiguate_main(int argc, char **argv);\n\nint main(int argc, char **argv) { return fstdisambiguate_main(argc, argv); }\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/bin/fstdraw-main.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Draws a binary FSTs in the Graphviz dot text format.\n\n#include <cstring>\n\n#include <fstream>\n#include <memory>\n#include <ostream>\n#include <string>\n\n#include <fst/flags.h>\n#include <fst/log.h>\n#include <fst/script/draw.h>\n\nDECLARE_bool(acceptor);\nDECLARE_string(isymbols);\nDECLARE_string(osymbols);\nDECLARE_string(ssymbols);\nDECLARE_bool(numeric);\nDECLARE_int32(precision);\nDECLARE_string(float_format);\nDECLARE_bool(show_weight_one);\nDECLARE_string(title);\nDECLARE_bool(portrait);\nDECLARE_bool(vertical);\nDECLARE_int32(fontsize);\nDECLARE_double(height);\nDECLARE_double(width);\nDECLARE_double(nodesep);\nDECLARE_double(ranksep);\nDECLARE_bool(allow_negative_labels);\n\nint fstdraw_main(int argc, char **argv) {\n  namespace s = fst::script;\n  using fst::script::FstClass;\n  using fst::SymbolTable;\n  using fst::SymbolTableTextOptions;\n\n  string usage = \"Prints out binary FSTs in dot text format.\\n\\n  Usage: \";\n  usage += argv[0];\n  usage += \" [binary.fst [text.dot]]\\n\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n  if (argc > 3) {\n    ShowUsage();\n    return 1;\n  }\n\n  const string in_name = (argc > 1 && strcmp(argv[1], \"-\") != 0) ? argv[1] : \"\";\n\n  std::unique_ptr<FstClass> fst(FstClass::Read(in_name));\n  if (!fst) return 1;\n\n  string dest = \"stdout\";\n  std::ofstream fstrm;\n  if (argc == 3) {\n    fstrm.open(argv[2]);\n    if (!fstrm) {\n      LOG(ERROR) << argv[0] << \": Open failed, file = \" << argv[2];\n      return 1;\n    }\n    dest = argv[2];\n  }\n  std::ostream &ostrm = fstrm.is_open() ? fstrm : std::cout;\n\n  const SymbolTableTextOptions opts(FLAGS_allow_negative_labels);\n\n  std::unique_ptr<const SymbolTable> isyms;\n  if (!FLAGS_isymbols.empty() && !FLAGS_numeric) {\n    isyms.reset(SymbolTable::ReadText(FLAGS_isymbols, opts));\n    if (!isyms) return 1;\n  }\n\n  std::unique_ptr<const SymbolTable> osyms;\n  if (!FLAGS_osymbols.empty() && !FLAGS_numeric) {\n    osyms.reset(SymbolTable::ReadText(FLAGS_osymbols, opts));\n    if (!osyms) return 1;\n  }\n\n  std::unique_ptr<const SymbolTable> ssyms;\n  if (!FLAGS_ssymbols.empty() && !FLAGS_numeric) {\n    ssyms.reset(SymbolTable::ReadText(FLAGS_ssymbols));\n    if (!ssyms) return 1;\n  }\n\n  if (!isyms && !FLAGS_numeric && fst->InputSymbols()) {\n    isyms.reset(fst->InputSymbols()->Copy());\n  }\n\n  if (!osyms && !FLAGS_numeric && fst->OutputSymbols()) {\n    osyms.reset(fst->OutputSymbols()->Copy());\n  }\n\n  s::DrawFst(*fst, isyms.get(), osyms.get(), ssyms.get(), FLAGS_acceptor,\n             FLAGS_title, FLAGS_width, FLAGS_height, FLAGS_portrait,\n             FLAGS_vertical, FLAGS_ranksep, FLAGS_nodesep, FLAGS_fontsize,\n             FLAGS_precision, FLAGS_float_format, FLAGS_show_weight_one,\n             &ostrm, dest);\n\n  return 0;\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/bin/fstdraw.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/flags.h>\n\nDEFINE_bool(acceptor, false, \"Input in acceptor format\");\nDEFINE_string(isymbols, \"\", \"Input label symbol table\");\nDEFINE_string(osymbols, \"\", \"Output label symbol table\");\nDEFINE_string(ssymbols, \"\", \"State label symbol table\");\nDEFINE_bool(numeric, false, \"Print numeric labels\");\nDEFINE_int32(precision, 5, \"Set precision (number of char/float)\");\nDEFINE_string(float_format, \"g\",\n              \"Floating-point format, one of: \\\"e\\\", \\\"f\\\", or \\\"g\\\"\");\nDEFINE_bool(show_weight_one, false,\n            \"Print/draw arc weights and final weights equal to Weight::One()\");\nDEFINE_string(title, \"\", \"Set figure title\");\nDEFINE_bool(portrait, false, \"Portrait mode (def: landscape)\");\nDEFINE_bool(vertical, false, \"Draw bottom-to-top instead of left-to-right\");\nDEFINE_int32(fontsize, 14, \"Set fontsize\");\nDEFINE_double(height, 11, \"Set height\");\nDEFINE_double(width, 8.5, \"Set width\");\nDEFINE_double(nodesep, 0.25,\n              \"Set minimum separation between nodes (see dot documentation)\");\nDEFINE_double(ranksep, 0.40,\n              \"Set minimum separation between ranks (see dot documentation)\");\nDEFINE_bool(allow_negative_labels, false,\n            \"Allow negative labels (not recommended; may cause conflicts)\");\n\nint fstdraw_main(int argc, char **argv);\n\nint main(int argc, char **argv) { return fstdraw_main(argc, argv); }\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/bin/fstencode-main.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Encode transducer labels and/or weights.\n\n#include <cstring>\n\n#include <memory>\n#include <string>\n\n#include <fst/flags.h>\n#include <fst/script/decode.h>\n#include <fst/script/encode.h>\n#include <fst/script/getters.h>\n\nDECLARE_bool(encode_labels);\nDECLARE_bool(encode_weights);\nDECLARE_bool(encode_reuse);\nDECLARE_bool(decode);\n\nint fstencode_main(int argc, char **argv) {\n  namespace s = fst::script;\n  using fst::script::FstClass;\n  using fst::script::MutableFstClass;\n\n  string usage = \"Encodes transducer labels and/or weights.\\n\\n  Usage: \";\n  usage += argv[0];\n  usage += \" in.fst codex [out.fst]\\n\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n  if (argc < 3 || argc > 4) {\n    ShowUsage();\n    return 1;\n  }\n\n  const string in_name = (strcmp(argv[1], \"-\") != 0) ? argv[1] : \"\";\n  const string codex_name = argv[2];\n  const string out_name = argc > 3 ? argv[3] : \"\";\n\n  std::unique_ptr<MutableFstClass> fst(MutableFstClass::Read(in_name, true));\n  if (!fst) return 1;\n\n  if (FLAGS_decode) {\n    s::Decode(fst.get(), codex_name);\n    return !fst->Write(out_name);\n  } else {\n    const auto flags =\n        s::GetEncodeFlags(FLAGS_encode_labels, FLAGS_encode_weights);\n    s::Encode(fst.get(), flags, FLAGS_encode_reuse, codex_name);\n    return !fst->Write(out_name);\n  }\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/bin/fstencode.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/flags.h>\n\nDEFINE_bool(encode_labels, false, \"Encode output labels\");\nDEFINE_bool(encode_weights, false, \"Encode weights\");\nDEFINE_bool(encode_reuse, false, \"Re-use existing codex\");\nDEFINE_bool(decode, false, \"Decode labels and/or weights\");\n\nint fstencode_main(int argc, char **argv);\n\nint main(int argc, char **argv) { return fstencode_main(argc, argv); }\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/bin/fstepsnormalize-main.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Epsilon-normalizes an FST.\n\n#include <cstring>\n\n#include <memory>\n#include <string>\n\n#include <fst/flags.h>\n#include <fst/script/epsnormalize.h>\n#include <fst/script/getters.h>\n\nDECLARE_bool(eps_norm_output);\n\nint fstepsnormalize_main(int argc, char **argv) {\n  namespace s = fst::script;\n  using fst::script::FstClass;\n  using fst::script::VectorFstClass;\n\n  string usage = \"Epsilon normalizes an FST.\\n\\n  Usage: \";\n  usage += argv[0];\n  usage += \" [in.fst [out.fst]]\\n\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n  if (argc > 3) {\n    ShowUsage();\n    return 1;\n  }\n\n  const string in_name = (argc > 1 && strcmp(argv[1], \"-\") != 0) ? argv[1] : \"\";\n  const string out_name = argc > 2 ? argv[2] : \"\";\n\n  std::unique_ptr<FstClass> ifst(FstClass::Read(in_name));\n  if (!ifst) return 1;\n\n  VectorFstClass ofst(ifst->ArcType());\n\n  s::EpsNormalize(*ifst, &ofst, s::GetEpsNormalizeType(FLAGS_eps_norm_output));\n\n  return !ofst.Write(out_name);\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/bin/fstepsnormalize.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/flags.h>\n\nDEFINE_bool(eps_norm_output, false, \"Normalize output epsilons\");\n\nint fstepsnormalize_main(int argc, char **argv);\n\nint main(int argc, char **argv) { return fstepsnormalize_main(argc, argv); }\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/bin/fstequal-main.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Two FSTS are equal iff their exit status is zero.\n\n#include <cstring>\n\n#include <memory>\n#include <string>\n\n#include <fst/flags.h>\n#include <fst/log.h>\n#include <fst/script/equal.h>\n\nDECLARE_double(delta);\n\nint fstequal_main(int argc, char **argv) {\n  namespace s = fst::script;\n  using fst::script::FstClass;\n\n  string usage = \"Two FSTs are equal iff the exit status is zero.\\n\\n  Usage: \";\n  usage += argv[0];\n  usage += \" in1.fst in2.fst\\n\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n  if (argc != 3) {\n    ShowUsage();\n    return 1;\n  }\n\n  const string in1_name = strcmp(argv[1], \"-\") == 0 ? \"\" : argv[1];\n  const string in2_name = strcmp(argv[2], \"-\") == 0 ? \"\" : argv[2];\n\n  if (in1_name.empty() && in2_name.empty()) {\n    LOG(ERROR) << argv[0] << \": Can't take both inputs from standard input\";\n    return 1;\n  }\n\n  std::unique_ptr<FstClass> ifst1(FstClass::Read(in1_name));\n  if (!ifst1) return 1;\n\n  std::unique_ptr<FstClass> ifst2(FstClass::Read(in2_name));\n  if (!ifst2) return 1;\n\n  bool result = s::Equal(*ifst1, *ifst2, FLAGS_delta);\n  if (!result) VLOG(1) << \"FSTs are not equal.\";\n\n  return result ? 0 : 2;\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/bin/fstequal.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/flags.h>\n#include <fst/weight.h>\n\nDEFINE_double(delta, fst::kDelta, \"Comparison/quantization delta\");\n\nint fstequal_main(int argc, char **argv);\n\nint main(int argc, char **argv) { return fstequal_main(argc, argv); }\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/bin/fstequivalent-main.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Two DFAs are equivalent iff their exit status is zero.\n\n#include <cstring>\n\n#include <memory>\n#include <string>\n\n#include <fst/flags.h>\n#include <fst/log.h>\n#include <fst/script/equivalent.h>\n#include <fst/script/getters.h>\n#include <fst/script/randequivalent.h>\n\nDECLARE_double(delta);\nDECLARE_bool(random);\nDECLARE_int32(max_length);\nDECLARE_int32(npath);\nDECLARE_int32(seed);\nDECLARE_string(select);\n\nint fstequivalent_main(int argc, char **argv) {\n  namespace s = fst::script;\n  using fst::RandGenOptions;\n  using fst::script::FstClass;\n\n  string usage =\n      \"Two DFAs are equivalent iff the exit status is zero.\\n\\n\"\n      \"  Usage: \";\n  usage += argv[0];\n  usage += \" in1.fst in2.fst\\n\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n  if (argc != 3) {\n    ShowUsage();\n    return 1;\n  }\n\n  const string in1_name = strcmp(argv[1], \"-\") == 0 ? \"\" : argv[1];\n  const string in2_name = strcmp(argv[2], \"-\") == 0 ? \"\" : argv[2];\n\n  if (in1_name.empty() && in2_name.empty()) {\n    LOG(ERROR) << argv[0] << \": Can't take both inputs from standard input\";\n    return 1;\n  }\n\n  std::unique_ptr<FstClass> ifst1(FstClass::Read(in1_name));\n  if (!ifst1) return 1;\n\n  std::unique_ptr<FstClass> ifst2(FstClass::Read(in2_name));\n  if (!ifst2) return 1;\n\n  if (!FLAGS_random) {\n    bool result = s::Equivalent(*ifst1, *ifst2, FLAGS_delta);\n    if (!result) VLOG(1) << \"FSTs are not equivalent\";\n    return result ? 0 : 2;\n  } else {\n    s::RandArcSelection ras;\n    if (!s::GetRandArcSelection(FLAGS_select, &ras)) {\n      LOG(ERROR) << argv[0] << \": Unknown or unsupported select type \"\n                            << FLAGS_select;\n      return 1;\n    }\n    const RandGenOptions<s::RandArcSelection> opts(ras, FLAGS_max_length);\n    bool result = s::RandEquivalent(*ifst1, *ifst2, FLAGS_npath, FLAGS_delta,\n                                    FLAGS_seed, opts);\n    if (!result) VLOG(1) << \"FSTs are not equivalent\";\n    return result ? 0 : 2;\n  }\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/bin/fstequivalent.cc",
    "content": "#include <unistd.h>\n\n#include <climits>\n#include <ctime>\n\n#include <fst/flags.h>\n#include <fst/weight.h>\n\nDEFINE_double(delta, fst::kDelta, \"Comparison/quantization delta\");\nDEFINE_bool(random, false,\n            \"Test equivalence by randomly selecting paths in the input FSTs\");\nDEFINE_int32(max_length, INT32_MAX, \"Maximum path length\");\nDEFINE_int32(npath, 1, \"Number of paths to generate\");\nDEFINE_int32(seed, time(nullptr) + getpid(), \"Random seed\");\nDEFINE_string(select, \"uniform\",\n              \"Selection type: one of: \"\n              \" \\\"uniform\\\", \\\"log_prob\\\" (when appropriate),\"\n              \" \\\"fast_log_prob\\\" (when appropriate)\");\n\nint fstequivalent_main(int argc, char **argv);\n\nint main(int argc, char **argv) { return fstequivalent_main(argc, argv); }\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/bin/fstinfo-main.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Prints out various information about an FST such as number of states\n// and arcs and property values (see properties.h).\n\n#include <cstring>\n\n#include <memory>\n#include <string>\n\n#include <fst/flags.h>\n#include <fst/script/info.h>\n\nDECLARE_string(arc_filter);\nDECLARE_string(info_type);\nDECLARE_bool(pipe);\nDECLARE_bool(test_properties);\nDECLARE_bool(fst_verify);\n\nint fstinfo_main(int argc, char **argv) {\n  namespace s = fst::script;\n  using fst::script::FstClass;\n\n  string usage = \"Prints out information about an FST.\\n\\n  Usage: \";\n  usage += argv[0];\n  usage += \" [in.fst]\\n\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n  if (argc > 2) {\n    ShowUsage();\n    return 1;\n  }\n\n  const string in_name =\n      (argc > 1 && (strcmp(argv[1], \"-\") != 0)) ? argv[1] : \"\";\n\n  std::unique_ptr<FstClass> ifst(FstClass::Read(in_name));\n  if (!ifst) return 1;\n\n  s::PrintFstInfo(*ifst, FLAGS_test_properties, FLAGS_arc_filter,\n                  FLAGS_info_type, FLAGS_fst_verify, FLAGS_pipe);\n\n  return 0;\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/bin/fstinfo.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/flags.h>\n\nDEFINE_string(arc_filter, \"any\",\n              \"Arc filter: one of:\"\n              \" \\\"any\\\", \\\"epsilon\\\", \\\"iepsilon\\\", \\\"oepsilon\\\"; \"\n              \"this only affects the counts of (co)accessible states, \"\n              \"connected states, and (strongly) connected components\");\nDEFINE_string(info_type, \"auto\",\n              \"Info format: one of: \\\"auto\\\", \\\"long\\\", \\\"short\\\"\");\nDEFINE_bool(pipe, false, \"Send info to stderr, input to stdout\");\nDEFINE_bool(test_properties, true,\n            \"Compute property values (if unknown to FST)\");\nDEFINE_bool(fst_verify, true, \"Verify FST sanity\");\n\nint fstinfo_main(int argc, char **argv);\n\nint main(int argc, char **argv) { return fstinfo_main(argc, argv); }\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/bin/fstintersect-main.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Intersects two FSTs.\n\n#include <cstring>\n\n#include <memory>\n#include <string>\n\n#include <fst/flags.h>\n#include <fst/log.h>\n#include <fst/script/getters.h>\n#include <fst/script/intersect.h>\n\nDECLARE_string(compose_filter);\nDECLARE_bool(connect);\n\nint fstintersect_main(int argc, char **argv) {\n  namespace s = fst::script;\n  using fst::ComposeFilter;\n  using fst::script::FstClass;\n  using fst::script::VectorFstClass;\n\n  string usage = \"Intersects two FSAs.\\n\\n  Usage: \";\n  usage += argv[0];\n  usage += \" in1.fst in2.fst [out.fst]\\n\";\n  usage += \"  Flags: connect\\n\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n  if (argc < 3 || argc > 4) {\n    ShowUsage();\n    return 1;\n  }\n\n  const string in1_name = strcmp(argv[1], \"-\") == 0 ? \"\" : argv[1];\n  const string in2_name = strcmp(argv[2], \"-\") == 0 ? \"\" : argv[2];\n  const string out_name = argc > 3 ? argv[3] : \"\";\n\n  if (in1_name.empty() && in2_name.empty()) {\n    LOG(ERROR) << argv[0] << \": Can't take both inputs from standard input\";\n    return 1;\n  }\n\n  std::unique_ptr<FstClass> ifst1(FstClass::Read(in1_name));\n  if (!ifst1) return 1;\n  std::unique_ptr<FstClass> ifst2(FstClass::Read(in2_name));\n  if (!ifst2) return 1;\n\n  VectorFstClass ofst(ifst1->ArcType());\n\n  ComposeFilter compose_filter;\n  if (!s::GetComposeFilter(FLAGS_compose_filter, &compose_filter)) {\n    LOG(ERROR) << argv[0] << \": Unknown or unsupported compose filter type: \"\n               << FLAGS_compose_filter;\n    return 1;\n  }\n\n  const fst::IntersectOptions opts(FLAGS_connect, compose_filter);\n\n  s::Intersect(*ifst1, *ifst2, &ofst, opts);\n\n  return !ofst.Write(out_name);\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/bin/fstintersect.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/flags.h>\n\nDEFINE_string(compose_filter, \"auto\",\n             \"Composition filter, one of: \\\"alt_sequence\\\", \\\"auto\\\", \"\n              \"\\\"match\\\", \\\"null\\\", \\\"sequence\\\", \\\"trivial\\\"\");\nDEFINE_bool(connect, true, \"Trim output\");\n\nint fstintersect_main(int argc, char **argv);\n\nint main(int argc, char **argv) { return fstintersect_main(argc, argv); }\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/bin/fstinvert-main.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Inverts a transduction.\n\n#include <cstring>\n\n#include <memory>\n#include <string>\n\n#include <fst/flags.h>\n#include <fst/script/invert.h>\n\nint fstinvert_main(int argc, char **argv) {\n  namespace s = fst::script;\n  using fst::script::MutableFstClass;\n\n  string usage = \"Inverts a transduction.\\n\\n  Usage: \";\n  usage += argv[0];\n  usage += \" [in.fst [out.fst]]\\n\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n  if (argc > 3) {\n    ShowUsage();\n    return 1;\n  }\n\n  const string in_name = (argc > 1 && strcmp(argv[1], \"-\") != 0) ? argv[1] : \"\";\n  const string out_name = argc > 2 ? argv[2] : \"\";\n\n  std::unique_ptr<MutableFstClass> fst(MutableFstClass::Read(in_name, true));\n  if (!fst) return 1;\n\n  s::Invert(fst.get());\n\n  return !fst->Write(out_name);\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/bin/fstinvert.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\nint fstinvert_main(int argc, char **argv);\n\nint main(int argc, char **argv) { return fstinvert_main(argc, argv); }\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/bin/fstisomorphic-main.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Two FSTS are isomorphic (equal up to state and arc re-ordering) iff their\n// exit status is zero. FSTs should be deterministic when viewed as unweighted\n// automata.\n\n#include <cstring>\n\n#include <memory>\n#include <string>\n\n#include <fst/flags.h>\n#include <fst/log.h>\n#include <fst/script/isomorphic.h>\n\nDECLARE_double(delta);\n\nint fstisomorphic_main(int argc, char **argv) {\n  namespace s = fst::script;\n  using fst::script::FstClass;\n\n  string usage =\n      \"Two FSTs are isomorphic iff the exit status is zero.\\n\\n  Usage: \";\n  usage += argv[0];\n  usage += \" in1.fst in2.fst\\n\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n  if (argc != 3) {\n    ShowUsage();\n    return 1;\n  }\n\n  const string in1_name = strcmp(argv[1], \"-\") == 0 ? \"\" : argv[1];\n  const string in2_name = strcmp(argv[2], \"-\") == 0 ? \"\" : argv[2];\n\n  if (in1_name.empty() && in2_name.empty()) {\n    LOG(ERROR) << argv[0] << \": Can't take both inputs from standard input\";\n    return 1;\n  }\n\n  std::unique_ptr<FstClass> ifst1(FstClass::Read(in1_name));\n  if (!ifst1) return 1;\n\n  std::unique_ptr<FstClass> ifst2(FstClass::Read(in2_name));\n  if (!ifst2) return 1;\n\n  bool result = s::Isomorphic(*ifst1, *ifst2, FLAGS_delta);\n  if (!result) VLOG(1) << \"FSTs are not isomorphic\";\n\n  return result ? 0 : 2;\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/bin/fstisomorphic.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/flags.h>\n#include <fst/weight.h>\n\nDEFINE_double(delta, fst::kDelta, \"Comparison/quantization delta\");\n\nint fstisomorphic_main(int argc, char **argv);\n\nint main(int argc, char **argv) { return fstisomorphic_main(argc, argv); }\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/bin/fstmap-main.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Applies an operation to each arc of an FST.\n\n#include <cstring>\n\n#include <memory>\n#include <string>\n\n#include <fst/flags.h>\n#include <fst/log.h>\n#include <fst/script/getters.h>\n#include <fst/script/map.h>\n\nDECLARE_double(delta);\nDECLARE_string(map_type);\nDECLARE_double(power);\nDECLARE_string(weight);\n\nint fstmap_main(int argc, char **argv) {\n  namespace s = fst::script;\n  using fst::script::FstClass;\n  using fst::script::WeightClass;\n\n  string usage = \"Applies an operation to each arc of an FST.\\n\\n  Usage: \";\n  usage += argv[0];\n  usage += \" [in.fst [out.fst]]\\n\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n  if (argc > 3) {\n    ShowUsage();\n    return 1;\n  }\n\n  const string in_name = (argc > 1 && strcmp(argv[1], \"-\") != 0) ? argv[1] : \"\";\n  const string out_name = argc > 2 ? argv[2] : \"\";\n\n  std::unique_ptr<FstClass> ifst(FstClass::Read(in_name));\n  if (!ifst) return 1;\n\n  s::MapType map_type;\n  if (!s::GetMapType(FLAGS_map_type, &map_type)) {\n    LOG(ERROR) << argv[0] << \": Unknown or unsupported map type \"\n               << FLAGS_map_type;\n    return 1;\n  }\n\n  const auto weight_param =\n      !FLAGS_weight.empty()\n          ? WeightClass(ifst->WeightType(), FLAGS_weight)\n          : (FLAGS_map_type == \"times\" ? WeightClass::One(ifst->WeightType())\n                                       : WeightClass::Zero(ifst->WeightType()));\n\n  std::unique_ptr<FstClass> ofst(\n      s::Map(*ifst, map_type, FLAGS_delta, FLAGS_power, weight_param));\n\n  return !ofst->Write(out_name);\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/bin/fstmap.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/flags.h>\n#include <fst/weight.h>\n\nDEFINE_double(delta, fst::kDelta, \"Comparison/quantization delta\");\nDEFINE_string(map_type, \"identity\",\n              \"Map operation, one of: \\\"arc_sum\\\", \\\"arc_unique\\\", \"\n              \"\\\"float_power\\\" (--power)\\\", \\\"identity\\\", \\\"input_epsilon\\\", \"\n              \"\\\"invert\\\", \\\"output_epsilon\\\", \\\"plus (--weight)\\\", \"\n              \"\\\"quantize (--delta)\\\", \\\"rmweight\\\", \\\"superfinal\\\", \"\n              \"\\\"power (--power)\\\", \\\"times (--weight)\\\", \\\"to_log\\\", \"\n              \"\\\"to_log64\\\", \\\"to_std\\\"\");\nDEFINE_double(power, 1.0, \"Power parameter\");\nDEFINE_string(weight, \"\", \"Weight parameter\");\n\nint fstmap_main(int argc, char **argv);\n\nint main(int argc, char **argv) { return fstmap_main(argc, argv); }\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/bin/fstminimize-main.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Minimizes a deterministic FST.\n\n#include <cstring>\n\n#include <memory>\n#include <string>\n\n#include <fst/flags.h>\n#include <fst/log.h>\n#include <fst/script/minimize.h>\n\nDECLARE_double(delta);\nDECLARE_bool(allow_nondet);\n\nint fstminimize_main(int argc, char **argv) {\n  namespace s = fst::script;\n  using fst::script::MutableFstClass;\n  using fst::script::VectorFstClass;\n\n  string usage = \"Minimizes a deterministic FST.\\n\\n  Usage: \";\n  usage += argv[0];\n  usage += \" [in.fst [out1.fst [out2.fst]]]\\n\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n  if (argc > 4) {\n    ShowUsage();\n    return 1;\n  }\n\n  const string in_name = (argc > 1 && strcmp(argv[1], \"-\") != 0) ? argv[1] : \"\";\n  const string out1_name =\n      (argc > 2 && strcmp(argv[2], \"-\") != 0) ? argv[2] : \"\";\n  const string out2_name =\n      (argc > 3 && strcmp(argv[3], \"-\") != 0) ? argv[3] : \"\";\n\n  if (out1_name.empty() && out2_name.empty() && argc > 3) {\n    LOG(ERROR) << argv[0] << \": Both outputs can't be standard output.\";\n    return 1;\n  }\n\n  std::unique_ptr<MutableFstClass> fst1(MutableFstClass::Read(in_name, true));\n  if (!fst1) return 1;\n\n  if (argc > 3) {\n    std::unique_ptr<MutableFstClass> fst2(new VectorFstClass(fst1->ArcType()));\n    s::Minimize(fst1.get(), fst2.get(), FLAGS_delta, FLAGS_allow_nondet);\n    if (!fst2->Write(out2_name)) return 1;\n  } else {\n    s::Minimize(fst1.get(), nullptr, FLAGS_delta, FLAGS_allow_nondet);\n  }\n\n  return !fst1->Write(out1_name);\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/bin/fstminimize.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/flags.h>\n#include <fst/shortest-distance.h>\n#include <fst/weight.h>\n\nDEFINE_double(delta, fst::kShortestDelta, \"Comparison/quantization delta\");\nDEFINE_bool(allow_nondet, false, \"Minimize non-deterministic FSTs\");\n\nint fstminimize_main(int argc, char **argv);\n\nint main(int argc, char **argv) { return fstminimize_main(argc, argv); }\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/bin/fstprint-main.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Prints out binary FSTs in simple text format used by AT&T.\n\n#include <cstring>\n\n#include <fstream>\n#include <memory>\n#include <ostream>\n#include <string>\n\n#include <fst/flags.h>\n#include <fst/log.h>\n#include <fst/script/print.h>\n\nDECLARE_bool(acceptor);\nDECLARE_string(isymbols);\nDECLARE_string(osymbols);\nDECLARE_string(ssymbols);\nDECLARE_bool(numeric);\nDECLARE_string(save_isymbols);\nDECLARE_string(save_osymbols);\nDECLARE_bool(show_weight_one);\nDECLARE_bool(allow_negative_labels);\nDECLARE_string(missing_symbol);\n\nint fstprint_main(int argc, char **argv) {\n  namespace s = fst::script;\n  using fst::script::FstClass;\n  using fst::SymbolTable;\n  using fst::SymbolTableTextOptions;\n\n  string usage = \"Prints out binary FSTs in simple text format.\\n\\n  Usage: \";\n  usage += argv[0];\n  usage += \" [binary.fst [text.fst]]\\n\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n  if (argc > 3) {\n    ShowUsage();\n    return 1;\n  }\n\n  const string in_name = (argc > 1 && strcmp(argv[1], \"-\") != 0) ? argv[1] : \"\";\n  const string out_name = argc > 2 ? argv[2] : \"\";\n\n  std::unique_ptr<FstClass> fst(FstClass::Read(in_name));\n  if (!fst) return 1;\n\n  string dest = \"standard output\";\n  std::ofstream fstrm;\n  if (argc == 3) {\n    fstrm.open(argv[2]);\n    if (!fstrm) {\n      LOG(ERROR) << argv[0] << \": Open failed, file = \" << argv[2];\n      return 1;\n    }\n    dest = argv[2];\n  }\n  std::ostream &ostrm = fstrm.is_open() ? fstrm : std::cout;\n  ostrm.precision(9);\n\n  const SymbolTableTextOptions opts(FLAGS_allow_negative_labels);\n\n  std::unique_ptr<const SymbolTable> isyms;\n  if (!FLAGS_isymbols.empty() && !FLAGS_numeric) {\n    isyms.reset(SymbolTable::ReadText(FLAGS_isymbols, opts));\n    if (!isyms) return 1;\n  }\n\n  std::unique_ptr<const SymbolTable> osyms;\n  if (!FLAGS_osymbols.empty() && !FLAGS_numeric) {\n    osyms.reset(SymbolTable::ReadText(FLAGS_osymbols, opts));\n    if (!osyms) return 1;\n  }\n\n  std::unique_ptr<const SymbolTable> ssyms;\n  if (!FLAGS_ssymbols.empty() && !FLAGS_numeric) {\n    ssyms.reset(SymbolTable::ReadText(FLAGS_ssymbols));\n    if (!ssyms) return 1;\n  }\n\n  if (!isyms && !FLAGS_numeric && fst->InputSymbols()) {\n    isyms.reset(fst->InputSymbols()->Copy());\n  }\n\n  if (!osyms && !FLAGS_numeric && fst->OutputSymbols()) {\n    osyms.reset(fst->OutputSymbols()->Copy());\n  }\n\n  s::PrintFst(*fst, ostrm, dest, isyms.get(), osyms.get(), ssyms.get(),\n              FLAGS_acceptor, FLAGS_show_weight_one, FLAGS_missing_symbol);\n\n  if (isyms && !FLAGS_save_isymbols.empty()) {\n    if (!isyms->WriteText(FLAGS_save_isymbols)) return 1;\n  }\n\n  if (osyms && !FLAGS_save_osymbols.empty()) {\n    if (!osyms->WriteText(FLAGS_save_osymbols)) return 1;\n  }\n\n  return 0;\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/bin/fstprint.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/flags.h>\n\nDEFINE_bool(acceptor, false, \"Input in acceptor format?\");\nDEFINE_string(isymbols, \"\", \"Input label symbol table\");\nDEFINE_string(osymbols, \"\", \"Output label symbol table\");\nDEFINE_string(ssymbols, \"\", \"State label symbol table\");\nDEFINE_bool(numeric, false, \"Print numeric labels?\");\nDEFINE_string(save_isymbols, \"\", \"Save input symbol table to file\");\nDEFINE_string(save_osymbols, \"\", \"Save output symbol table to file\");\nDEFINE_bool(show_weight_one, false,\n            \"Print/draw arc weights and final weights equal to semiring One?\");\nDEFINE_bool(allow_negative_labels, false,\n            \"Allow negative labels (not recommended; may cause conflicts)?\");\nDEFINE_string(missing_symbol, \"\",\n              \"Symbol to print when lookup fails (default raises error)\");\n\nint fstprint_main(int argc, char **argv);\n\nint main(int argc, char **argv) { return fstprint_main(argc, argv); }\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/bin/fstproject-main.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Projects a transduction onto its input or output language.\n\n#include <cstring>\n\n#include <memory>\n#include <string>\n\n#include <fst/flags.h>\n#include <fst/script/getters.h>\n#include <fst/script/project.h>\n\nDECLARE_bool(project_output);\n\nint fstproject_main(int argc, char **argv) {\n  namespace s = fst::script;\n  using fst::script::MutableFstClass;\n\n  string usage =\n      \"Projects a transduction onto its input\"\n      \" or output language.\\n\\n  Usage: \";\n  usage += argv[0];\n  usage += \" [in.fst [out.fst]]\\n\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n  if (argc > 3) {\n    ShowUsage();\n    return 1;\n  }\n\n  const string in_name = (argc > 1 && strcmp(argv[1], \"-\") != 0) ? argv[1] : \"\";\n  const string out_name = argc > 2 ? argv[2] : \"\";\n\n  std::unique_ptr<MutableFstClass> fst(MutableFstClass::Read(in_name, true));\n  if (!fst) return 1;\n\n  s::Project(fst.get(), s::GetProjectType(FLAGS_project_output));\n\n  return !fst->Write(out_name);\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/bin/fstproject.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/flags.h>\n\nDEFINE_bool(project_output, false, \"Project on output (vs. input)\");\n\nint fstproject_main(int argc, char **argv);\n\nint main(int argc, char **argv) { return fstproject_main(argc, argv); }\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/bin/fstprune-main.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Prunes states and arcs of an FST w.r.t. the shortest path weight.\n\n#include <cstring>\n\n#include <memory>\n#include <string>\n\n#include <fst/flags.h>\n#include <fst/script/prune.h>\n\nDECLARE_double(delta);\nDECLARE_int64(nstate);\nDECLARE_string(weight);\n\nint fstprune_main(int argc, char **argv) {\n  namespace s = fst::script;\n  using fst::script::MutableFstClass;\n  using fst::script::WeightClass;\n\n  string usage = \"Prunes states and arcs of an FST.\\n\\n  Usage: \";\n  usage += argv[0];\n  usage += \" [in.fst [out.fst]]\\n\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n  if (argc > 3) {\n    ShowUsage();\n    return 1;\n  }\n\n  const string in_name = (argc > 1 && strcmp(argv[1], \"-\") != 0) ? argv[1] : \"\";\n  const string out_name = argc > 2 ? argv[2] : \"\";\n\n  std::unique_ptr<MutableFstClass> fst(MutableFstClass::Read(in_name, true));\n  if (!fst) return 1;\n\n  const auto weight_threshold =\n      FLAGS_weight.empty() ? WeightClass::Zero(fst->WeightType())\n                           : WeightClass(fst->WeightType(), FLAGS_weight);\n\n  s::Prune(fst.get(), weight_threshold, FLAGS_nstate, FLAGS_delta);\n\n  return !fst->Write(out_name);\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/bin/fstprune.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/flags.h>\n#include <fst/fst.h>\n#include <fst/weight.h>\n\nDEFINE_double(delta, fst::kDelta, \"Comparison/quantization delta\");\nDEFINE_int64(nstate, fst::kNoStateId, \"State number threshold\");\nDEFINE_string(weight, \"\", \"Weight threshold\");\n\nint fstprune_main(int argc, char **argv);\n\nint main(int argc, char **argv) { return fstprune_main(argc, argv); }\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/bin/fstpush-main.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Pushes weights and/or output labels in an FST toward the initial or final\n// states.\n\n#include <cstring>\n\n#include <memory>\n#include <string>\n\n#include <fst/flags.h>\n#include <fst/script/getters.h>\n#include <fst/script/push.h>\n\nDECLARE_double(delta);\nDECLARE_bool(push_weights);\nDECLARE_bool(push_labels);\nDECLARE_bool(remove_total_weight);\nDECLARE_bool(remove_common_affix);\nDECLARE_bool(to_final);\n\nint fstpush_main(int argc, char **argv) {\n  namespace s = fst::script;\n  using fst::script::FstClass;\n  using fst::script::VectorFstClass;\n\n  string usage = \"Pushes weights and/or olabels in an FST.\\n\\n  Usage: \";\n  usage += argv[0];\n  usage += \" [in.fst [out.fst]]\\n\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n  if (argc > 3) {\n    ShowUsage();\n    return 1;\n  }\n\n  string in_name = (argc > 1 && strcmp(argv[1], \"-\") != 0) ? argv[1] : \"\";\n  string out_name = argc > 2 ? argv[2] : \"\";\n\n  std::unique_ptr<FstClass> ifst(FstClass::Read(in_name));\n  if (!ifst) return 1;\n\n  const auto flags =\n      s::GetPushFlags(FLAGS_push_weights, FLAGS_push_labels,\n                      FLAGS_remove_total_weight, FLAGS_remove_common_affix);\n\n  VectorFstClass ofst(ifst->ArcType());\n\n  s::Push(*ifst, &ofst, flags, s::GetReweightType(FLAGS_to_final),\n          FLAGS_delta);\n\n  return !ofst.Write(out_name);\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/bin/fstpush.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/flags.h>\n#include <fst/weight.h>\n\nDEFINE_double(delta, fst::kDelta, \"Comparison/quantization delta\");\nDEFINE_bool(push_weights, false, \"Push weights\");\nDEFINE_bool(push_labels, false, \"Push output labels\");\nDEFINE_bool(remove_total_weight, false,\n            \"Remove total weight when pushing weights\");\nDEFINE_bool(remove_common_affix, false,\n            \"Remove common prefix/suffix when pushing labels\");\nDEFINE_bool(to_final, false, \"Push/reweight to final (vs. to initial) states\");\n\nint fstpush_main(int argc, char **argv);\n\nint main(int argc, char **argv) { return fstpush_main(argc, argv); }\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/bin/fstrandgen-main.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Generates random paths through an FST.\n\n#include <cstring>\n\n#include <memory>\n#include <string>\n\n#include <fst/flags.h>\n#include <fst/log.h>\n#include <fst/script/getters.h>\n#include <fst/script/randgen.h>\n\nDECLARE_int32(max_length);\nDECLARE_int32(npath);\nDECLARE_int32(seed);\nDECLARE_string(select);\nDECLARE_bool(weighted);\nDECLARE_bool(remove_total_weight);\n\nint fstrandgen_main(int argc, char **argv) {\n  namespace s = fst::script;\n  using fst::script::FstClass;\n  using fst::script::VectorFstClass;\n\n  string usage = \"Generates random paths through an FST.\\n\\n  Usage: \";\n  usage += argv[0];\n  usage += \" [in.fst [out.fst]]\\n\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n  if (argc > 3) {\n    ShowUsage();\n    return 1;\n  }\n\n  VLOG(1) << argv[0] << \": Seed = \" << FLAGS_seed;\n\n  const string in_name = (argc > 1 && strcmp(argv[1], \"-\") != 0) ? argv[1] : \"\";\n  const string out_name = argc > 2 ? argv[2] : \"\";\n\n  std::unique_ptr<FstClass> ifst(FstClass::Read(in_name));\n  if (!ifst) return 1;\n\n  VectorFstClass ofst(ifst->ArcType());\n\n  s::RandArcSelection ras;\n  if (!s::GetRandArcSelection(FLAGS_select, &ras)) {\n    LOG(ERROR) << argv[0] << \": Unknown or unsupported select type \"\n               << FLAGS_select;\n    return 1;\n  }\n\n  s::RandGen(*ifst, &ofst, FLAGS_seed,\n             fst::RandGenOptions<s::RandArcSelection>(\n                 ras, FLAGS_max_length, FLAGS_npath, FLAGS_weighted,\n                 FLAGS_remove_total_weight));\n\n  return !ofst.Write(out_name);\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/bin/fstrandgen.cc",
    "content": "#include <unistd.h>\n\n#include <climits>\n#include <ctime>\n\n#include <fst/flags.h>\n\nDEFINE_int32(max_length, INT32_MAX, \"Maximum path length\");\nDEFINE_int32(npath, 1, \"Number of paths to generate\");\nDEFINE_int32(seed, time(nullptr) + getpid(), \"Random seed\");\nDEFINE_string(select, \"uniform\",\n              \"Selection type: one of: \"\n              \" \\\"uniform\\\", \\\"log_prob\\\" (when appropriate),\"\n              \" \\\"fast_log_prob\\\" (when appropriate)\");\nDEFINE_bool(weighted, false,\n            \"Output tree weighted by path count vs. unweighted paths\");\nDEFINE_bool(remove_total_weight, false,\n            \"Remove total weight when output weighted\");\n\nint fstrandgen_main(int argc, char **argv);\n\nint main(int argc, char **argv) { return fstrandgen_main(argc, argv); }\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/bin/fstrelabel-main.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Relabels input or output space of an FST.\n\n#include <cstring>\n\n#include <memory>\n#include <string>\n#include <vector>\n\n#include <fst/flags.h>\n#include <fst/util.h>\n#include <fst/script/relabel.h>\n#include <fst/script/weight-class.h>\n\nDECLARE_string(isymbols);\nDECLARE_string(osymbols);\nDECLARE_string(relabel_isymbols);\nDECLARE_string(relabel_osymbols);\nDECLARE_string(relabel_ipairs);\nDECLARE_string(relabel_opairs);\nDECLARE_string(unknown_isymbol);\nDECLARE_string(unknown_osymbol);\nDECLARE_bool(allow_negative_labels);\n\nint fstrelabel_main(int argc, char **argv) {\n  namespace s = fst::script;\n  using fst::script::MutableFstClass;\n  using fst::SymbolTable;\n  using fst::SymbolTableTextOptions;\n\n  string usage =\n      \"Relabels the input and/or the output labels of the FST.\\n\\n\"\n      \"  Usage: \";\n  usage += argv[0];\n  usage += \" [in.fst [out.fst]]\\n\";\n  usage += \"\\n Using SymbolTables flags:\\n\";\n  usage += \"  --relabel_isymbols isyms.map\\n\";\n  usage += \"  --relabel_osymbols osyms.map\\n\";\n  usage += \"\\n Using numeric labels flags:\\n\";\n  usage += \"  --relabel_ipairs ipairs.txt\\n\";\n  usage += \"  --relabel_opairs opairs.txt\\n\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n  if (argc > 3) {\n    ShowUsage();\n    return 1;\n  }\n\n  const string in_name =\n      (argc > 1 && (strcmp(argv[1], \"-\") != 0)) ? argv[1] : \"\";\n  const string out_name = argc > 2 ? argv[2] : \"\";\n\n  std::unique_ptr<MutableFstClass> fst(MutableFstClass::Read(in_name, true));\n  if (!fst) return 1;\n\n  // Relabel with symbol tables.\n  const SymbolTableTextOptions opts(FLAGS_allow_negative_labels);\n\n  if (!FLAGS_relabel_isymbols.empty() || !FLAGS_relabel_osymbols.empty()) {\n    bool attach_new_isymbols = (fst->InputSymbols() != nullptr);\n    std::unique_ptr<const SymbolTable> old_isymbols(\n        FLAGS_isymbols.empty() ? nullptr\n                               : SymbolTable::ReadText(FLAGS_isymbols, opts));\n    const std::unique_ptr<const SymbolTable> relabel_isymbols(\n        FLAGS_relabel_isymbols.empty()\n            ? nullptr\n            : SymbolTable::ReadText(FLAGS_relabel_isymbols, opts));\n    bool attach_new_osymbols = (fst->OutputSymbols() != nullptr);\n    std::unique_ptr<const SymbolTable> old_osymbols(\n        FLAGS_osymbols.empty() ? nullptr\n                               : SymbolTable::ReadText(FLAGS_osymbols, opts));\n    const std::unique_ptr<const SymbolTable> relabel_osymbols(\n        FLAGS_relabel_osymbols.empty()\n            ? nullptr\n            : SymbolTable::ReadText(FLAGS_relabel_osymbols, opts));\n    s::Relabel(fst.get(),\n               old_isymbols ? old_isymbols.get() : fst->InputSymbols(),\n               relabel_isymbols.get(), FLAGS_unknown_isymbol,\n               attach_new_isymbols,\n               old_osymbols ? old_osymbols.get() : fst->OutputSymbols(),\n               relabel_osymbols.get(), FLAGS_unknown_osymbol,\n               attach_new_osymbols);\n  } else {\n    // Reads in relabeling pairs.\n    std::vector<s::LabelPair> ipairs;\n    std::vector<s::LabelPair> opairs;\n    if (!FLAGS_relabel_ipairs.empty()) {\n      if (!fst::ReadLabelPairs(FLAGS_relabel_ipairs, &ipairs,\n                                   FLAGS_allow_negative_labels))\n        return 1;\n    }\n    if (!FLAGS_relabel_opairs.empty()) {\n      if (!fst::ReadLabelPairs(FLAGS_relabel_opairs, &opairs,\n                                   FLAGS_allow_negative_labels))\n        return 1;\n    }\n    s::Relabel(fst.get(), ipairs, opairs);\n  }\n\n  return !fst->Write(out_name);\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/bin/fstrelabel.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/flags.h>\n\nDEFINE_string(isymbols, \"\", \"Input label symbol table\");\nDEFINE_string(osymbols, \"\", \"Output label symbol table\");\nDEFINE_string(relabel_isymbols, \"\", \"Input symbol set to relabel to\");\nDEFINE_string(relabel_osymbols, \"\", \"Output symbol set to relabel to\");\nDEFINE_string(relabel_ipairs, \"\", \"Input relabel pairs (numeric)\");\nDEFINE_string(relabel_opairs, \"\", \"Output relabel pairs (numeric)\");\nDEFINE_string(unknown_isymbol, \"\",\n    \"Input symbol to use to relabel OOVs (default: OOVs are errors)\");\nDEFINE_string(unknown_osymbol, \"\",\n    \"Output symbol to use to relabel OOVs (default: OOVs are errors)\");\nDEFINE_bool(allow_negative_labels, false,\n    \"Allow negative labels (not recommended; may cause conflicts)\");\n\nint fstrelabel_main(int argc, char **argv);\n\nint main(int argc, char **argv) { return fstrelabel_main(argc, argv); }\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/bin/fstreplace-main.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Performs the dynamic replacement of arcs in one FST with another FST,\n// allowing for the definition of FSTs analogous to RTNs.\n\n#include <cstring>\n\n#include <string>\n#include <vector>\n\n#include <fst/flags.h>\n#include <fst/script/getters.h>\n#include <fst/script/replace.h>\n\nDECLARE_string(call_arc_labeling);\nDECLARE_string(return_arc_labeling);\nDECLARE_int64(return_label);\nDECLARE_bool(epsilon_on_replace);\n\nvoid Cleanup(std::vector<fst::script::LabelFstClassPair> *pairs) {\n  for (const auto &pair : *pairs) {\n    delete pair.second;\n  }\n  pairs->clear();\n}\n\nint fstreplace_main(int argc, char **argv) {\n  namespace s = fst::script;\n  using fst::script::FstClass;\n  using fst::script::VectorFstClass;\n  using fst::ReplaceLabelType;\n\n  string usage = \"Recursively replaces FST arcs with other FST(s).\\n\\n\"\n                 \"  Usage: \";\n  usage += argv[0];\n  usage += \" root.fst rootlabel [rule1.fst label1 ...] [out.fst]\\n\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n  if (argc < 4) {\n    ShowUsage();\n    return 1;\n  }\n\n  const string in_name = argv[1];\n  const string out_name = argc % 2 == 0 ? argv[argc - 1] : \"\";\n\n  auto *ifst = FstClass::Read(in_name);\n  if (!ifst) return 1;\n\n  std::vector<s::LabelFstClassPair> pairs;\n  // Note that if the root label is beyond the range of the underlying FST's\n  // labels, truncation will occur.\n  const auto root = atoll(argv[2]);\n  pairs.emplace_back(root, ifst);\n\n  for (auto i = 3; i < argc - 1; i += 2) {\n    ifst = FstClass::Read(argv[i]);\n    if (!ifst) {\n      Cleanup(&pairs);\n      return 1;\n    }\n    // Note that if the root label is beyond the range of the underlying FST's\n    // labels, truncation will occur.\n    const auto label = atoll(argv[i + 1]);\n    pairs.emplace_back(label, ifst);\n  }\n\n  ReplaceLabelType call_label_type;\n  if (!s::GetReplaceLabelType(FLAGS_call_arc_labeling, FLAGS_epsilon_on_replace,\n                              &call_label_type)) {\n    LOG(ERROR) << argv[0] << \": Unknown or unsupported call arc replace \"\n               << \"label type: \" << FLAGS_call_arc_labeling;\n  }\n  ReplaceLabelType return_label_type;\n  if (!s::GetReplaceLabelType(FLAGS_return_arc_labeling,\n                              FLAGS_epsilon_on_replace, &return_label_type)) {\n    LOG(ERROR) << argv[0] << \": Unknown or unsupported return arc replace \"\n               << \"label type: \" << FLAGS_return_arc_labeling;\n  }\n\n  s::ReplaceOptions opts(root, call_label_type, return_label_type,\n                         FLAGS_return_label);\n\n  VectorFstClass ofst(ifst->ArcType());\n  s::Replace(pairs, &ofst, opts);\n  Cleanup(&pairs);\n\n  return !ofst.Write(out_name);\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/bin/fstreplace.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/flags.h>\n\nDEFINE_string(call_arc_labeling, \"input\",\n              \"Which labels to make non-epsilon on the call arc. \"\n              \"One of: \\\"input\\\" (default), \\\"output\\\", \\\"both\\\", \\\"neither\\\"\");\nDEFINE_string(return_arc_labeling, \"neither\",\n              \"Which labels to make non-epsilon on the return arc. \"\n              \"One of: \\\"input\\\", \\\"output\\\", \\\"both\\\", \\\"neither\\\" (default)\");\nDEFINE_int64(return_label, 0, \"Label to put on return arc\");\nDEFINE_bool(epsilon_on_replace, false, \"Call/return arcs are epsilon arcs?\");\n\nint fstreplace_main(int argc, char **argv);\n\nint main(int argc, char **argv) { return fstreplace_main(argc, argv); }\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/bin/fstreverse-main.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Reverses the paths in an FST.\n\n#include <cstring>\n\n#include <memory>\n#include <string>\n\n#include <fst/flags.h>\n#include <fst/script/fst-class.h>\n#include <fst/script/reverse.h>\n\nDECLARE_bool(require_superinitial);\n\nint fstreverse_main(int argc, char **argv) {\n  namespace s = fst::script;\n  using fst::script::FstClass;\n  using fst::script::VectorFstClass;\n\n  string usage = \"Reverses the paths in an FST.\\n\\n  Usage: \";\n  usage += argv[0];\n  usage += \" [in.fst [out.fst]]\\n\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n  if (argc > 3) {\n    ShowUsage();\n    return 1;\n  }\n\n  const string in_name =\n      (argc > 1 && (strcmp(argv[1], \"-\") != 0)) ? argv[1] : \"\";\n  const string out_name = argc > 2 ? argv[2] : \"\";\n\n  std::unique_ptr<FstClass> ifst(FstClass::Read(in_name));\n  if (!ifst) return 1;\n\n  VectorFstClass ofst(ifst->ArcType());\n\n  s::Reverse(*ifst, &ofst, FLAGS_require_superinitial);\n\n  return !ofst.Write(out_name);\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/bin/fstreverse.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/flags.h>\n\nDEFINE_bool(require_superinitial, true, \"Always create a superinitial state\");\n\nint fstreverse_main(int argc, char **argv);\n\nint main(int argc, char **argv) { return fstreverse_main(argc, argv); }\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/bin/fstreweight-main.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Reweights an FST.\n\n#include <cstring>\n\n#include <memory>\n#include <string>\n#include <vector>\n\n#include <fst/flags.h>\n#include <fst/script/getters.h>\n#include <fst/script/reweight.h>\n#include <fst/script/text-io.h>\n\nDECLARE_bool(to_final);\n\nint fstreweight_main(int argc, char **argv) {\n  namespace s = fst::script;\n  using fst::script::MutableFstClass;\n  using fst::script::WeightClass;\n\n  string usage = \"Reweights an FST.\\n\\n  Usage: \";\n  usage += argv[0];\n  usage += \" in.fst potential.txt [out.fst]\\n\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n  if (argc < 3 || argc > 4) {\n    ShowUsage();\n    return 1;\n  }\n\n  const string in_name = argv[1];\n  const string potentials_name = argv[2];\n  const string out_name = argc > 3 ? argv[3] : \"\";\n\n  std::unique_ptr<MutableFstClass> fst(MutableFstClass::Read(in_name, true));\n  if (!fst) return 1;\n\n  std::vector<WeightClass> potential;\n  if (!s::ReadPotentials(fst->WeightType(), potentials_name, &potential)) {\n    return 1;\n  }\n\n  s::Reweight(fst.get(), potential, s::GetReweightType(FLAGS_to_final));\n\n  return !fst->Write(out_name);\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/bin/fstreweight.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/flags.h>\n\nDEFINE_bool(to_final, false, \"Push/reweight to final (vs. to initial) states\");\n\nint fstreweight_main(int argc, char **argv);\n\nint main(int argc, char **argv) { return fstreweight_main(argc, argv); }\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/bin/fstrmepsilon-main.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Removes epsilons from an FST.\n\n#include <cstring>\n\n#include <memory>\n#include <string>\n\n#include <fst/flags.h>\n#include <fst/log.h>\n#include <fst/script/getters.h>\n#include <fst/script/rmepsilon.h>\n\nDECLARE_bool(connect);\nDECLARE_double(delta);\nDECLARE_int64(nstate);\nDECLARE_string(queue_type);\nDECLARE_string(weight);\n\nint fstrmepsilon_main(int argc, char **argv) {\n  namespace s = fst::script;\n  using fst::script::MutableFstClass;\n  using fst::script::WeightClass;\n\n  string usage = \"Removes epsilons from an FST.\\n\\n  Usage: \";\n  usage += argv[0];\n  usage += \" [in.fst [out.fst]]\\n\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n  if (argc > 3) {\n    ShowUsage();\n    return 1;\n  }\n\n  const string in_name = (argc > 1 && strcmp(argv[1], \"-\") != 0) ? argv[1] : \"\";\n  const string out_name = argc > 2 ? argv[2] : \"\";\n\n  std::unique_ptr<MutableFstClass> fst(MutableFstClass::Read(in_name, true));\n  if (!fst) return 1;\n\n  const auto weight_threshold =\n      FLAGS_weight.empty() ? WeightClass::Zero(fst->WeightType())\n                           : WeightClass(fst->WeightType(), FLAGS_weight);\n\n  fst::QueueType queue_type;\n  if (!s::GetQueueType(FLAGS_queue_type, &queue_type)) {\n    LOG(ERROR) << argv[0]\n               << \": Unknown or unsupported queue type: \" << FLAGS_queue_type;\n    return 1;\n  }\n\n  const s::RmEpsilonOptions opts(queue_type, FLAGS_connect, weight_threshold,\n                                 FLAGS_nstate, FLAGS_delta);\n\n  s::RmEpsilon(fst.get(), opts);\n\n  return !fst->Write(out_name);\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/bin/fstrmepsilon.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/flags.h>\n#include <fst/fst.h>\n#include <fst/shortest-distance.h>\n#include <fst/weight.h>\n\nDEFINE_bool(connect, true, \"Trim output\");\nDEFINE_double(delta, fst::kShortestDelta, \"Comparison/quantization delta\");\nDEFINE_int64(nstate, fst::kNoStateId, \"State number threshold\");\nDEFINE_string(queue_type, \"auto\",\n              \"Queue type: one of: \\\"auto\\\", \"\n              \"\\\"fifo\\\", \\\"lifo\\\", \\\"shortest\\\", \\\"state\\\", \\\"top\\\"\");\nDEFINE_string(weight, \"\", \"Weight threshold\");\n\nint fstrmepsilon_main(int argc, char **argv);\n\nint main(int argc, char **argv) { return fstrmepsilon_main(argc, argv); }\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/bin/fstshortestdistance-main.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Find shortest distances in an FST.\n\n#include <cstring>\n\n#include <memory>\n#include <string>\n#include <vector>\n\n#include <fst/flags.h>\n#include <fst/log.h>\n#include <fst/script/getters.h>\n#include <fst/script/shortest-distance.h>\n#include <fst/script/text-io.h>\n\nDECLARE_bool(reverse);\nDECLARE_double(delta);\nDECLARE_int64(nstate);\nDECLARE_string(queue_type);\n\nint fstshortestdistance_main(int argc, char **argv) {\n  namespace s = fst::script;\n  using fst::script::FstClass;\n  using fst::script::WeightClass;\n  using fst::QueueType;\n  using fst::AUTO_QUEUE;\n\n  string usage = \"Finds shortest distance(s) in an FST.\\n\\n  Usage: \";\n  usage += argv[0];\n  usage += \" [in.fst [distance.txt]]\\n\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n  if (argc > 3) {\n    ShowUsage();\n    return 1;\n  }\n\n  string in_name = (argc > 1 && (strcmp(argv[1], \"-\") != 0)) ? argv[1] : \"\";\n  string out_name = argc > 2 ? argv[2] : \"\";\n\n  std::unique_ptr<FstClass> ifst(FstClass::Read(in_name));\n  if (!ifst) return 1;\n\n  std::vector<WeightClass> distance;\n\n  QueueType queue_type;\n  if (!s::GetQueueType(FLAGS_queue_type, &queue_type)) {\n    LOG(ERROR) << argv[0]\n               << \": Unknown or unsupported queue type: \" << FLAGS_queue_type;\n    return 1;\n  }\n\n  if (FLAGS_reverse && queue_type != AUTO_QUEUE) {\n    LOG(ERROR) << argv[0] << \": Can't use non-default queue with reverse\";\n    return 1;\n  }\n\n  if (FLAGS_reverse) {\n    s::ShortestDistance(*ifst, &distance, FLAGS_reverse, FLAGS_delta);\n  } else {\n    const s::ShortestDistanceOptions opts(queue_type, s::ANY_ARC_FILTER,\n                                          FLAGS_nstate, FLAGS_delta);\n    s::ShortestDistance(*ifst, &distance, opts);\n  }\n\n  return !s::WritePotentials(out_name, distance);\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/bin/fstshortestdistance.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/flags.h>\n#include <fst/fst.h>\n#include <fst/shortest-distance.h>\n#include <fst/weight.h>\n\nDEFINE_bool(reverse, false, \"Perform in the reverse direction\");\nDEFINE_double(delta, fst::kShortestDelta, \"Comparison/quantization delta\");\nDEFINE_int64(nstate, fst::kNoStateId, \"State number threshold\");\nDEFINE_string(queue_type, \"auto\",\n              \"Queue type: one of: \\\"auto\\\", \"\n              \"\\\"fifo\\\", \\\"lifo\\\", \\\"shortest\\\", \\\"state\\\", \\\"top\\\"\");\n\nint fstshortestdistance_main(int argc, char **argv);\n\nint main(int argc, char **argv) { return fstshortestdistance_main(argc, argv); }\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/bin/fstshortestpath-main.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Find shortest path(s) in an FST.\n\n#include <cstring>\n\n#include <memory>\n#include <string>\n#include <vector>\n\n#include <fst/flags.h>\n#include <fst/log.h>\n#include <fst/script/getters.h>\n#include <fst/script/shortest-path.h>\n\nDECLARE_double(delta);\nDECLARE_int32(nshortest);\nDECLARE_int64(nstate);\nDECLARE_string(queue_type);\nDECLARE_bool(unique);\nDECLARE_string(weight);\n\nint fstshortestpath_main(int argc, char **argv) {\n  namespace s = fst::script;\n  using fst::script::FstClass;\n  using fst::script::WeightClass;\n  using fst::script::VectorFstClass;\n\n  string usage = \"Finds shortest path(s) in an FST.\\n\\n  Usage: \";\n  usage += argv[0];\n  usage += \" [in.fst [out.fst]]\\n\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n  if (argc > 3) {\n    ShowUsage();\n    return 1;\n  }\n\n  const string in_name =\n      (argc > 1 && (strcmp(argv[1], \"-\") != 0)) ? argv[1] : \"\";\n  const string out_name = argc > 2 ? argv[2] : \"\";\n\n  std::unique_ptr<FstClass> ifst(FstClass::Read(in_name));\n  if (!ifst) return 1;\n\n  const auto weight_threshold =\n      FLAGS_weight.empty() ? WeightClass::Zero(ifst->WeightType())\n                           : WeightClass(ifst->WeightType(), FLAGS_weight);\n\n  VectorFstClass ofst(ifst->ArcType());\n\n  fst::QueueType queue_type;\n  if (!s::GetQueueType(FLAGS_queue_type, &queue_type)) {\n    LOG(ERROR) << \"Unknown or unsupported queue type: \" << FLAGS_queue_type;\n    return 1;\n  }\n\n  const s::ShortestPathOptions opts(queue_type, FLAGS_nshortest,\n                                    FLAGS_unique, FLAGS_delta,\n                                    weight_threshold, FLAGS_nstate);\n\n  s::ShortestPath(*ifst, &ofst, opts);\n\n  return !ofst.Write(out_name);\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/bin/fstshortestpath.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/flags.h>\n#include <fst/fst.h>\n#include <fst/shortest-distance.h>\n#include <fst/weight.h>\n\nDEFINE_double(delta, fst::kShortestDelta, \"Comparison/quantization delta\");\nDEFINE_int32(nshortest, 1, \"Return N-shortest paths\");\nDEFINE_int64(nstate, fst::kNoStateId, \"State number threshold\");\nDEFINE_string(queue_type, \"auto\",\n              \"Queue type: one of \\\"auto\\\", \"\n              \"\\\"fifo\\\", \\\"lifo\\\", \\\"shortest\\', \\\"state\\\", \\\"top\\\"\");\nDEFINE_bool(unique, false, \"Return unique strings\");\nDEFINE_string(weight, \"\", \"Weight threshold\");\n\nint fstshortestpath_main(int argc, char **argv);\n\nint main(int argc, char **argv) { return fstshortestpath_main(argc, argv); }\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/bin/fstsymbols-main.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Performs operations (set, clear, relabel) on the symbols table attached to an\n// input FST.\n\n#include <cstring>\n\n#include <memory>\n#include <string>\n#include <vector>\n\n#include <fst/flags.h>\n#include <fst/util.h>\n#include <fst/script/fst-class.h>\n#include <fst/script/verify.h>\n\nDECLARE_string(isymbols);\nDECLARE_string(osymbols);\nDECLARE_bool(clear_isymbols);\nDECLARE_bool(clear_osymbols);\nDECLARE_string(relabel_ipairs);\nDECLARE_string(relabel_opairs);\nDECLARE_string(save_isymbols);\nDECLARE_string(save_osymbols);\nDECLARE_bool(allow_negative_labels);\nDECLARE_bool(verify);\n\nint fstsymbols_main(int argc, char **argv) {\n  namespace s = fst::script;\n  using fst::script::MutableFstClass;\n  using fst::ReadLabelPairs;\n  using fst::SymbolTable;\n  using fst::SymbolTableTextOptions;\n\n  string usage =\n      \"Performs operations (set, clear, relabel) on the symbol\"\n      \" tables attached to an FST.\\n\\n  Usage: \";\n  usage += argv[0];\n  usage += \" [in.fst [out.fst]]\\n\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n  if (argc > 3) {\n    ShowUsage();\n    return 1;\n  }\n\n  const string in_name = argc > 1 && strcmp(argv[1], \"-\") != 0 ? argv[1] : \"\";\n  const string out_name = argc > 2 ? argv[2] : \"\";\n\n  std::unique_ptr<MutableFstClass> fst(MutableFstClass::Read(in_name, true));\n  if (!fst) return 1;\n\n  if (!FLAGS_save_isymbols.empty()) {\n    const auto *isyms = fst->InputSymbols();\n    if (isyms) {\n      isyms->WriteText(FLAGS_save_isymbols);\n    } else {\n      LOG(ERROR) << argv[0]\n                 << \": Saving isymbols but there are no input symbols.\";\n    }\n  }\n\n  if (!FLAGS_save_osymbols.empty()) {\n    const auto *osyms = fst->OutputSymbols();\n    if (osyms) {\n      osyms->WriteText(FLAGS_save_osymbols);\n    } else {\n      LOG(ERROR) << argv[0]\n                 << \": Saving osymbols but there are no output symbols.\";\n    }\n  }\n\n  const SymbolTableTextOptions opts(FLAGS_allow_negative_labels);\n\n  std::unique_ptr<SymbolTable> isyms;\n  if (!FLAGS_isymbols.empty()) {\n    isyms.reset(SymbolTable::ReadText(FLAGS_isymbols, opts));\n    fst->SetInputSymbols(isyms.get());\n  } else if (FLAGS_clear_isymbols) {\n    fst->SetInputSymbols(nullptr);\n  }\n  std::unique_ptr<SymbolTable> osyms;\n  if (!FLAGS_osymbols.empty()) {\n    osyms.reset(SymbolTable::ReadText(FLAGS_osymbols, opts));\n    fst->SetOutputSymbols(osyms.get());\n  } else if (FLAGS_clear_osymbols) {\n    fst->SetOutputSymbols(nullptr);\n  }\n\n  using Label = int64;\n  if (!FLAGS_relabel_ipairs.empty()) {\n    std::vector<std::pair<Label, Label>> ipairs;\n    ReadLabelPairs(FLAGS_relabel_ipairs, &ipairs, FLAGS_allow_negative_labels);\n    std::unique_ptr<SymbolTable> isyms_relabel(\n        RelabelSymbolTable(fst->InputSymbols(), ipairs));\n    fst->SetInputSymbols(isyms_relabel.get());\n  }\n  if (!FLAGS_relabel_opairs.empty()) {\n    std::vector<std::pair<Label, Label>> opairs;\n    ReadLabelPairs(FLAGS_relabel_opairs, &opairs, FLAGS_allow_negative_labels);\n    std::unique_ptr<SymbolTable> osyms_relabel(\n        RelabelSymbolTable(fst->OutputSymbols(), opairs));\n    fst->SetOutputSymbols(osyms_relabel.get());\n  }\n\n  if (FLAGS_verify && !s::Verify(*fst)) return 1;\n\n  return !fst->Write(out_name);\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/bin/fstsymbols.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/flags.h>\n\nDEFINE_string(isymbols, \"\", \"Input label symbol table\");\nDEFINE_string(osymbols, \"\", \"Output label symbol table\");\nDEFINE_bool(clear_isymbols, false, \"Clear input symbol table\");\nDEFINE_bool(clear_osymbols, false, \"Clear output symbol table\");\nDEFINE_string(relabel_ipairs, \"\", \"Input relabel pairs (numeric)\");\nDEFINE_string(relabel_opairs, \"\", \"Output relabel pairs (numeric)\");\nDEFINE_string(save_isymbols, \"\", \"Save fst file's input symbol table to file\");\nDEFINE_string(save_osymbols, \"\", \"Save fst file's output symbol table to file\");\nDEFINE_bool(allow_negative_labels, false,\n            \"Allow negative labels (not recommended; may cause conflicts)\");\nDEFINE_bool(verify, false, \"Verify fst properities before saving\");\n\nint fstsymbols_main(int argc, char **argv);\n\nint main(int argc, char **argv) { return fstsymbols_main(argc, argv); }\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/bin/fstsynchronize-main.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Synchronizes an FST.\n\n#include <cstring>\n\n#include <memory>\n#include <string>\n\n#include <fst/flags.h>\n#include <fst/script/synchronize.h>\n\nint fstsynchronize_main(int argc, char **argv) {\n  namespace s = fst::script;\n  using fst::script::FstClass;\n  using fst::script::VectorFstClass;\n\n  string usage = \"Synchronizes an FST.\\n\\n  Usage: \";\n  usage += argv[0];\n  usage += \" [in.fst [out.fst]]\\n\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n  if (argc > 3) {\n    ShowUsage();\n    return 1;\n  }\n\n  const string in_name = (argc > 1 && strcmp(argv[1], \"-\") != 0) ? argv[1] : \"\";\n  const string out_name = argc > 2 ? argv[2] : \"\";\n\n  std::unique_ptr<FstClass> ifst(FstClass::Read(in_name));\n  if (!ifst) return 1;\n\n  VectorFstClass ofst(ifst->ArcType());\n\n  s::Synchronize(*ifst, &ofst);\n\n  return !ofst.Write(out_name);\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/bin/fstsynchronize.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\nint fstsynchronize_main(int argc, char **argv);\n\nint main(int argc, char **argv) { return fstsynchronize_main(argc, argv); }\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/bin/fsttopsort-main.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Topologically sorts an FST.\n\n#include <cstring>\n\n#include <memory>\n#include <string>\n\n#include <fst/flags.h>\n#include <fst/log.h>\n#include <fst/script/topsort.h>\n\nint fsttopsort_main(int argc, char **argv) {\n  namespace s = fst::script;\n  using fst::script::MutableFstClass;\n\n  string usage = \"Topologically sorts an FST.\\n\\n  Usage: \";\n  usage += argv[0];\n  usage += \" [in.fst [out.fst]]\\n\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n  if (argc > 3) {\n    ShowUsage();\n    return 1;\n  }\n\n  const string in_name = argc > 1 && strcmp(argv[1], \"-\") != 0 ? argv[1] : \"\";\n  const string out_name = argc > 2 ? argv[2] : \"\";\n\n  std::unique_ptr<MutableFstClass> fst(MutableFstClass::Read(in_name, true));\n  if (!fst) return 1;\n\n  bool acyclic = TopSort(fst.get());\n\n  if (!acyclic) LOG(WARNING) << argv[0] << \": Input FST is cyclic\";\n\n  return !fst->Write(out_name);\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/bin/fsttopsort.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\nint fsttopsort_main(int argc, char **argv);\n\nint main(int argc, char **argv) { return fsttopsort_main(argc, argv); }\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/bin/fstunion-main.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Creates the union of two FSTs.\n\n#include <cstring>\n\n#include <memory>\n#include <string>\n\n#include <fst/flags.h>\n#include <fst/log.h>\n#include <fst/script/union.h>\n\nint fstunion_main(int argc, char **argv) {\n  namespace s = fst::script;\n  using fst::script::FstClass;\n  using fst::script::MutableFstClass;\n\n  string usage = \"Creates the union of two FSTs.\\n\\n  Usage: \";\n  usage += argv[0];\n  usage += \" in1.fst in2.fst [out.fst]\\n\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n  if (argc < 3 || argc > 4) {\n    ShowUsage();\n    return 1;\n  }\n\n  const string in1_name = strcmp(argv[1], \"-\") != 0 ? argv[1] : \"\";\n  const string in2_name = strcmp(argv[2], \"-\") != 0 ? argv[2] : \"\";\n  const string out_name = argc > 3 ? argv[3] : \"\";\n\n  if (in1_name == \"\" && in2_name == \"\") {\n    LOG(ERROR) << argv[0] << \": Can't take both inputs from standard input\";\n    return 1;\n  }\n\n  std::unique_ptr<MutableFstClass> fst1(MutableFstClass::Read(in1_name, true));\n  if (!fst1) return 1;\n\n  std::unique_ptr<FstClass> fst2(FstClass::Read(in2_name));\n  if (!fst2) return 1;\n\n  s::Union(fst1.get(), *fst2);\n\n  return !fst1->Write(out_name);\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/bin/fstunion.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\nint fstunion_main(int argc, char **argv);\n\nint main(int argc, char **argv) { return fstunion_main(argc, argv); }\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/extensions/Makefile.am",
    "content": "if HAVE_COMPACT\ncompactdir = compact\nendif\n\nif HAVE_COMPRESS\ncompressdir = compress\nendif\n\nif HAVE_CONST\nconstdir = const\nendif\n\nif HAVE_FAR\nfardir = far\nendif\n\nif HAVE_GRM\nfardir = far\npdtdir = pdt\nmpdtdir = mpdt\nendif\n\nif HAVE_LINEAR\nlineardir = linear\nendif\n\nif HAVE_LOOKAHEAD\nlookaheaddir = lookahead\nendif\n\nif HAVE_MPDT\npdtdir = pdt\nmpdtdir = mpdt\nendif\n\nif HAVE_NGRAM\nngramdir = ngram\nendif\n\nif HAVE_PYTHON\nfardir = far\npywrapfstdir = python\nendif\n\nif HAVE_PDT\npdtdir = pdt\nendif\n\nif HAVE_SPECIAL\nspecialdir = special\nendif\n\nSUBDIRS = $(compactdir) $(compressdir) $(constdir) $(fardir) $(lineardir)  \\\n          $(lookaheaddir) $(pdtdir) $(mpdtdir) $(ngramdir) $(pywrapfstdir) \\\n          $(specialdir)\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/extensions/Makefile.in",
    "content": "# Makefile.in generated by automake 1.14.1 from Makefile.am.\n# @configure_input@\n\n# Copyright (C) 1994-2013 Free Software Foundation, Inc.\n\n# This Makefile.in is free software; the Free Software Foundation\n# gives unlimited permission to copy and/or distribute it,\n# with or without modifications, as long as this notice is preserved.\n\n# This program is distributed in the hope that it will be useful,\n# but WITHOUT ANY WARRANTY, to the extent permitted by law; without\n# even the implied warranty of MERCHANTABILITY or FITNESS FOR A\n# PARTICULAR PURPOSE.\n\n@SET_MAKE@\nVPATH = @srcdir@\nam__is_gnu_make = test -n '$(MAKEFILE_LIST)' && test -n '$(MAKELEVEL)'\nam__make_running_with_option = \\\n  case $${target_option-} in \\\n      ?) ;; \\\n      *) echo \"am__make_running_with_option: internal error: invalid\" \\\n              \"target option '$${target_option-}' specified\" >&2; \\\n         exit 1;; \\\n  esac; \\\n  has_opt=no; \\\n  sane_makeflags=$$MAKEFLAGS; \\\n  if $(am__is_gnu_make); then \\\n    sane_makeflags=$$MFLAGS; \\\n  else \\\n    case $$MAKEFLAGS in \\\n      *\\\\[\\ \\\t]*) \\\n        bs=\\\\; \\\n        sane_makeflags=`printf '%s\\n' \"$$MAKEFLAGS\" \\\n          | sed \"s/$$bs$$bs[$$bs $$bs\t]*//g\"`;; \\\n    esac; \\\n  fi; \\\n  skip_next=no; \\\n  strip_trailopt () \\\n  { \\\n    flg=`printf '%s\\n' \"$$flg\" | sed \"s/$$1.*$$//\"`; \\\n  }; \\\n  for flg in $$sane_makeflags; do \\\n    test $$skip_next = yes && { skip_next=no; continue; }; \\\n    case $$flg in \\\n      *=*|--*) continue;; \\\n        -*I) strip_trailopt 'I'; skip_next=yes;; \\\n      -*I?*) strip_trailopt 'I';; \\\n        -*O) strip_trailopt 'O'; skip_next=yes;; \\\n      -*O?*) strip_trailopt 'O';; \\\n        -*l) strip_trailopt 'l'; skip_next=yes;; \\\n      -*l?*) strip_trailopt 'l';; \\\n      -[dEDm]) skip_next=yes;; \\\n      -[JT]) skip_next=yes;; \\\n    esac; \\\n    case $$flg in \\\n      *$$target_option*) has_opt=yes; break;; \\\n    esac; \\\n  done; \\\n  test $$has_opt = yes\nam__make_dryrun = (target_option=n; $(am__make_running_with_option))\nam__make_keepgoing = (target_option=k; $(am__make_running_with_option))\npkgdatadir = $(datadir)/@PACKAGE@\npkgincludedir = $(includedir)/@PACKAGE@\npkglibdir = $(libdir)/@PACKAGE@\npkglibexecdir = $(libexecdir)/@PACKAGE@\nam__cd = CDPATH=\"$${ZSH_VERSION+.}$(PATH_SEPARATOR)\" && cd\ninstall_sh_DATA = $(install_sh) -c -m 644\ninstall_sh_PROGRAM = $(install_sh) -c\ninstall_sh_SCRIPT = $(install_sh) -c\nINSTALL_HEADER = $(INSTALL_DATA)\ntransform = $(program_transform_name)\nNORMAL_INSTALL = :\nPRE_INSTALL = :\nPOST_INSTALL = :\nNORMAL_UNINSTALL = :\nPRE_UNINSTALL = :\nPOST_UNINSTALL = :\nbuild_triplet = @build@\nhost_triplet = @host@\nsubdir = src/extensions\nDIST_COMMON = $(srcdir)/Makefile.in $(srcdir)/Makefile.am\nACLOCAL_M4 = $(top_srcdir)/aclocal.m4\nam__aclocal_m4_deps = $(top_srcdir)/m4/ac_python_devel.m4 \\\n\t$(top_srcdir)/m4/libtool.m4 $(top_srcdir)/m4/ltoptions.m4 \\\n\t$(top_srcdir)/m4/ltsugar.m4 $(top_srcdir)/m4/ltversion.m4 \\\n\t$(top_srcdir)/m4/lt~obsolete.m4 $(top_srcdir)/configure.ac\nam__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \\\n\t$(ACLOCAL_M4)\nmkinstalldirs = $(install_sh) -d\nCONFIG_HEADER = $(top_builddir)/config.h \\\n\t$(top_builddir)/src/include/fst/config.h\nCONFIG_CLEAN_FILES =\nCONFIG_CLEAN_VPATH_FILES =\nAM_V_P = $(am__v_P_@AM_V@)\nam__v_P_ = $(am__v_P_@AM_DEFAULT_V@)\nam__v_P_0 = false\nam__v_P_1 = :\nAM_V_GEN = $(am__v_GEN_@AM_V@)\nam__v_GEN_ = $(am__v_GEN_@AM_DEFAULT_V@)\nam__v_GEN_0 = @echo \"  GEN     \" $@;\nam__v_GEN_1 = \nAM_V_at = $(am__v_at_@AM_V@)\nam__v_at_ = $(am__v_at_@AM_DEFAULT_V@)\nam__v_at_0 = @\nam__v_at_1 = \nSOURCES =\nDIST_SOURCES =\nRECURSIVE_TARGETS = all-recursive check-recursive cscopelist-recursive \\\n\tctags-recursive dvi-recursive html-recursive info-recursive \\\n\tinstall-data-recursive install-dvi-recursive \\\n\tinstall-exec-recursive install-html-recursive \\\n\tinstall-info-recursive install-pdf-recursive \\\n\tinstall-ps-recursive install-recursive installcheck-recursive \\\n\tinstalldirs-recursive pdf-recursive ps-recursive \\\n\ttags-recursive uninstall-recursive\nam__can_run_installinfo = \\\n  case $$AM_UPDATE_INFO_DIR in \\\n    n|no|NO) false;; \\\n    *) (install-info --version) >/dev/null 2>&1;; \\\n  esac\nRECURSIVE_CLEAN_TARGETS = mostlyclean-recursive clean-recursive\t\\\n  distclean-recursive maintainer-clean-recursive\nam__recursive_targets = \\\n  $(RECURSIVE_TARGETS) \\\n  $(RECURSIVE_CLEAN_TARGETS) \\\n  $(am__extra_recursive_targets)\nAM_RECURSIVE_TARGETS = $(am__recursive_targets:-recursive=) TAGS CTAGS \\\n\tdistdir\nam__tagged_files = $(HEADERS) $(SOURCES) $(TAGS_FILES) $(LISP)\n# Read a list of newline-separated strings from the standard input,\n# and print each of them once, without duplicates.  Input order is\n# *not* preserved.\nam__uniquify_input = $(AWK) '\\\n  BEGIN { nonempty = 0; } \\\n  { items[$$0] = 1; nonempty = 1; } \\\n  END { if (nonempty) { for (i in items) print i; }; } \\\n'\n# Make sure the list of sources is unique.  This is necessary because,\n# e.g., the same source file might be shared among _SOURCES variables\n# for different programs/libraries.\nam__define_uniq_tagged_files = \\\n  list='$(am__tagged_files)'; \\\n  unique=`for i in $$list; do \\\n    if test -f \"$$i\"; then echo $$i; else echo $(srcdir)/$$i; fi; \\\n  done | $(am__uniquify_input)`\nETAGS = etags\nCTAGS = ctags\nDIST_SUBDIRS = compact compress const far linear lookahead pdt mpdt \\\n\tngram python special\nDISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST)\nam__relativize = \\\n  dir0=`pwd`; \\\n  sed_first='s,^\\([^/]*\\)/.*$$,\\1,'; \\\n  sed_rest='s,^[^/]*/*,,'; \\\n  sed_last='s,^.*/\\([^/]*\\)$$,\\1,'; \\\n  sed_butlast='s,/*[^/]*$$,,'; \\\n  while test -n \"$$dir1\"; do \\\n    first=`echo \"$$dir1\" | sed -e \"$$sed_first\"`; \\\n    if test \"$$first\" != \".\"; then \\\n      if test \"$$first\" = \"..\"; then \\\n        dir2=`echo \"$$dir0\" | sed -e \"$$sed_last\"`/\"$$dir2\"; \\\n        dir0=`echo \"$$dir0\" | sed -e \"$$sed_butlast\"`; \\\n      else \\\n        first2=`echo \"$$dir2\" | sed -e \"$$sed_first\"`; \\\n        if test \"$$first2\" = \"$$first\"; then \\\n          dir2=`echo \"$$dir2\" | sed -e \"$$sed_rest\"`; \\\n        else \\\n          dir2=\"../$$dir2\"; \\\n        fi; \\\n        dir0=\"$$dir0\"/\"$$first\"; \\\n      fi; \\\n    fi; \\\n    dir1=`echo \"$$dir1\" | sed -e \"$$sed_rest\"`; \\\n  done; \\\n  reldir=\"$$dir2\"\nACLOCAL = @ACLOCAL@\nAMTAR = @AMTAR@\nAM_DEFAULT_VERBOSITY = @AM_DEFAULT_VERBOSITY@\nAR = @AR@\nAUTOCONF = @AUTOCONF@\nAUTOHEADER = @AUTOHEADER@\nAUTOMAKE = @AUTOMAKE@\nAWK = @AWK@\nCC = @CC@\nCCDEPMODE = @CCDEPMODE@\nCFLAGS = @CFLAGS@\nCPP = @CPP@\nCPPFLAGS = @CPPFLAGS@\nCXX = @CXX@\nCXXCPP = @CXXCPP@\nCXXDEPMODE = @CXXDEPMODE@\nCXXFLAGS = @CXXFLAGS@\nCYGPATH_W = @CYGPATH_W@\nDEFS = @DEFS@\nDEPDIR = @DEPDIR@\nDLLTOOL = @DLLTOOL@\nDL_LIBS = @DL_LIBS@\nDSYMUTIL = @DSYMUTIL@\nDUMPBIN = @DUMPBIN@\nECHO_C = @ECHO_C@\nECHO_N = @ECHO_N@\nECHO_T = @ECHO_T@\nEGREP = @EGREP@\nEXEEXT = @EXEEXT@\nFGREP = @FGREP@\nGREP = @GREP@\nINSTALL = @INSTALL@\nINSTALL_DATA = @INSTALL_DATA@\nINSTALL_PROGRAM = @INSTALL_PROGRAM@\nINSTALL_SCRIPT = @INSTALL_SCRIPT@\nINSTALL_STRIP_PROGRAM = @INSTALL_STRIP_PROGRAM@\nLD = @LD@\nLDFLAGS = @LDFLAGS@\nLIBOBJS = @LIBOBJS@\nLIBS = @LIBS@\nLIBTOOL = @LIBTOOL@\nLIPO = @LIPO@\nLN_S = @LN_S@\nLTLIBOBJS = @LTLIBOBJS@\nMAKEINFO = @MAKEINFO@\nMANIFEST_TOOL = @MANIFEST_TOOL@\nMKDIR_P = @MKDIR_P@\nNM = @NM@\nNMEDIT = @NMEDIT@\nOBJDUMP = @OBJDUMP@\nOBJEXT = @OBJEXT@\nOTOOL = @OTOOL@\nOTOOL64 = @OTOOL64@\nPACKAGE = @PACKAGE@\nPACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@\nPACKAGE_NAME = @PACKAGE_NAME@\nPACKAGE_STRING = @PACKAGE_STRING@\nPACKAGE_TARNAME = @PACKAGE_TARNAME@\nPACKAGE_URL = @PACKAGE_URL@\nPACKAGE_VERSION = @PACKAGE_VERSION@\nPATH_SEPARATOR = @PATH_SEPARATOR@\nPYTHON = @PYTHON@\nPYTHON_CPPFLAGS = @PYTHON_CPPFLAGS@\nPYTHON_EXEC_PREFIX = @PYTHON_EXEC_PREFIX@\nPYTHON_EXTRA_LDFLAGS = @PYTHON_EXTRA_LDFLAGS@\nPYTHON_EXTRA_LIBS = @PYTHON_EXTRA_LIBS@\nPYTHON_LDFLAGS = @PYTHON_LDFLAGS@\nPYTHON_PLATFORM = @PYTHON_PLATFORM@\nPYTHON_PREFIX = @PYTHON_PREFIX@\nPYTHON_SITE_PKG = @PYTHON_SITE_PKG@\nPYTHON_VERSION = @PYTHON_VERSION@\nRANLIB = @RANLIB@\nSED = @SED@\nSET_MAKE = @SET_MAKE@\nSHELL = @SHELL@\nSTRIP = @STRIP@\nVERSION = @VERSION@\nabs_builddir = @abs_builddir@\nabs_srcdir = @abs_srcdir@\nabs_top_builddir = @abs_top_builddir@\nabs_top_srcdir = @abs_top_srcdir@\nac_ct_AR = @ac_ct_AR@\nac_ct_CC = @ac_ct_CC@\nac_ct_CXX = @ac_ct_CXX@\nac_ct_DUMPBIN = @ac_ct_DUMPBIN@\nam__include = @am__include@\nam__leading_dot = @am__leading_dot@\nam__quote = @am__quote@\nam__tar = @am__tar@\nam__untar = @am__untar@\nbindir = @bindir@\nbuild = @build@\nbuild_alias = @build_alias@\nbuild_cpu = @build_cpu@\nbuild_os = @build_os@\nbuild_vendor = @build_vendor@\nbuilddir = @builddir@\ndatadir = @datadir@\ndatarootdir = @datarootdir@\ndocdir = @docdir@\ndvidir = @dvidir@\nexec_prefix = @exec_prefix@\nhost = @host@\nhost_alias = @host_alias@\nhost_cpu = @host_cpu@\nhost_os = @host_os@\nhost_vendor = @host_vendor@\nhtmldir = @htmldir@\nincludedir = @includedir@\ninfodir = @infodir@\ninstall_sh = @install_sh@\nlibdir = @libdir@\nlibexecdir = @libexecdir@\nlibfstdir = @libfstdir@\nlocaledir = @localedir@\nlocalstatedir = @localstatedir@\nmandir = @mandir@\nmkdir_p = @mkdir_p@\noldincludedir = @oldincludedir@\npdfdir = @pdfdir@\npkgpyexecdir = @pkgpyexecdir@\npkgpythondir = @pkgpythondir@\nprefix = @prefix@\nprogram_transform_name = @program_transform_name@\npsdir = @psdir@\npyexecdir = @pyexecdir@\npythondir = @pythondir@\nsbindir = @sbindir@\nsharedstatedir = @sharedstatedir@\nsrcdir = @srcdir@\nsysconfdir = @sysconfdir@\ntarget_alias = @target_alias@\ntop_build_prefix = @top_build_prefix@\ntop_builddir = @top_builddir@\ntop_srcdir = @top_srcdir@\n@HAVE_COMPACT_TRUE@compactdir = compact\n@HAVE_COMPRESS_TRUE@compressdir = compress\n@HAVE_CONST_TRUE@constdir = const\n@HAVE_FAR_TRUE@fardir = far\n@HAVE_GRM_TRUE@fardir = far\n@HAVE_PYTHON_TRUE@fardir = far\n@HAVE_GRM_TRUE@pdtdir = pdt\n@HAVE_MPDT_TRUE@pdtdir = pdt\n@HAVE_PDT_TRUE@pdtdir = pdt\n@HAVE_GRM_TRUE@mpdtdir = mpdt\n@HAVE_MPDT_TRUE@mpdtdir = mpdt\n@HAVE_LINEAR_TRUE@lineardir = linear\n@HAVE_LOOKAHEAD_TRUE@lookaheaddir = lookahead\n@HAVE_NGRAM_TRUE@ngramdir = ngram\n@HAVE_PYTHON_TRUE@pywrapfstdir = python\n@HAVE_SPECIAL_TRUE@specialdir = special\nSUBDIRS = $(compactdir) $(compressdir) $(constdir) $(fardir) $(lineardir)  \\\n          $(lookaheaddir) $(pdtdir) $(mpdtdir) $(ngramdir) $(pywrapfstdir) \\\n          $(specialdir)\n\nall: all-recursive\n\n.SUFFIXES:\n$(srcdir)/Makefile.in:  $(srcdir)/Makefile.am  $(am__configure_deps)\n\t@for dep in $?; do \\\n\t  case '$(am__configure_deps)' in \\\n\t    *$$dep*) \\\n\t      ( cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh ) \\\n\t        && { if test -f $@; then exit 0; else break; fi; }; \\\n\t      exit 1;; \\\n\t  esac; \\\n\tdone; \\\n\techo ' cd $(top_srcdir) && $(AUTOMAKE) --foreign src/extensions/Makefile'; \\\n\t$(am__cd) $(top_srcdir) && \\\n\t  $(AUTOMAKE) --foreign src/extensions/Makefile\n.PRECIOUS: Makefile\nMakefile: $(srcdir)/Makefile.in $(top_builddir)/config.status\n\t@case '$?' in \\\n\t  *config.status*) \\\n\t    cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh;; \\\n\t  *) \\\n\t    echo ' cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe)'; \\\n\t    cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe);; \\\n\tesac;\n\n$(top_builddir)/config.status: $(top_srcdir)/configure $(CONFIG_STATUS_DEPENDENCIES)\n\tcd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh\n\n$(top_srcdir)/configure:  $(am__configure_deps)\n\tcd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh\n$(ACLOCAL_M4):  $(am__aclocal_m4_deps)\n\tcd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh\n$(am__aclocal_m4_deps):\n\nmostlyclean-libtool:\n\t-rm -f *.lo\n\nclean-libtool:\n\t-rm -rf .libs _libs\n\n# This directory's subdirectories are mostly independent; you can cd\n# into them and run 'make' without going through this Makefile.\n# To change the values of 'make' variables: instead of editing Makefiles,\n# (1) if the variable is set in 'config.status', edit 'config.status'\n#     (which will cause the Makefiles to be regenerated when you run 'make');\n# (2) otherwise, pass the desired values on the 'make' command line.\n$(am__recursive_targets):\n\t@fail=; \\\n\tif $(am__make_keepgoing); then \\\n\t  failcom='fail=yes'; \\\n\telse \\\n\t  failcom='exit 1'; \\\n\tfi; \\\n\tdot_seen=no; \\\n\ttarget=`echo $@ | sed s/-recursive//`; \\\n\tcase \"$@\" in \\\n\t  distclean-* | maintainer-clean-*) list='$(DIST_SUBDIRS)' ;; \\\n\t  *) list='$(SUBDIRS)' ;; \\\n\tesac; \\\n\tfor subdir in $$list; do \\\n\t  echo \"Making $$target in $$subdir\"; \\\n\t  if test \"$$subdir\" = \".\"; then \\\n\t    dot_seen=yes; \\\n\t    local_target=\"$$target-am\"; \\\n\t  else \\\n\t    local_target=\"$$target\"; \\\n\t  fi; \\\n\t  ($(am__cd) $$subdir && $(MAKE) $(AM_MAKEFLAGS) $$local_target) \\\n\t  || eval $$failcom; \\\n\tdone; \\\n\tif test \"$$dot_seen\" = \"no\"; then \\\n\t  $(MAKE) $(AM_MAKEFLAGS) \"$$target-am\" || exit 1; \\\n\tfi; test -z \"$$fail\"\n\nID: $(am__tagged_files)\n\t$(am__define_uniq_tagged_files); mkid -fID $$unique\ntags: tags-recursive\nTAGS: tags\n\ntags-am: $(TAGS_DEPENDENCIES) $(am__tagged_files)\n\tset x; \\\n\there=`pwd`; \\\n\tif ($(ETAGS) --etags-include --version) >/dev/null 2>&1; then \\\n\t  include_option=--etags-include; \\\n\t  empty_fix=.; \\\n\telse \\\n\t  include_option=--include; \\\n\t  empty_fix=; \\\n\tfi; \\\n\tlist='$(SUBDIRS)'; for subdir in $$list; do \\\n\t  if test \"$$subdir\" = .; then :; else \\\n\t    test ! -f $$subdir/TAGS || \\\n\t      set \"$$@\" \"$$include_option=$$here/$$subdir/TAGS\"; \\\n\t  fi; \\\n\tdone; \\\n\t$(am__define_uniq_tagged_files); \\\n\tshift; \\\n\tif test -z \"$(ETAGS_ARGS)$$*$$unique\"; then :; else \\\n\t  test -n \"$$unique\" || unique=$$empty_fix; \\\n\t  if test $$# -gt 0; then \\\n\t    $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \\\n\t      \"$$@\" $$unique; \\\n\t  else \\\n\t    $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \\\n\t      $$unique; \\\n\t  fi; \\\n\tfi\nctags: ctags-recursive\n\nCTAGS: ctags\nctags-am: $(TAGS_DEPENDENCIES) $(am__tagged_files)\n\t$(am__define_uniq_tagged_files); \\\n\ttest -z \"$(CTAGS_ARGS)$$unique\" \\\n\t  || $(CTAGS) $(CTAGSFLAGS) $(AM_CTAGSFLAGS) $(CTAGS_ARGS) \\\n\t     $$unique\n\nGTAGS:\n\there=`$(am__cd) $(top_builddir) && pwd` \\\n\t  && $(am__cd) $(top_srcdir) \\\n\t  && gtags -i $(GTAGS_ARGS) \"$$here\"\ncscopelist: cscopelist-recursive\n\ncscopelist-am: $(am__tagged_files)\n\tlist='$(am__tagged_files)'; \\\n\tcase \"$(srcdir)\" in \\\n\t  [\\\\/]* | ?:[\\\\/]*) sdir=\"$(srcdir)\" ;; \\\n\t  *) sdir=$(subdir)/$(srcdir) ;; \\\n\tesac; \\\n\tfor i in $$list; do \\\n\t  if test -f \"$$i\"; then \\\n\t    echo \"$(subdir)/$$i\"; \\\n\t  else \\\n\t    echo \"$$sdir/$$i\"; \\\n\t  fi; \\\n\tdone >> $(top_builddir)/cscope.files\n\ndistclean-tags:\n\t-rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags\n\ndistdir: $(DISTFILES)\n\t@srcdirstrip=`echo \"$(srcdir)\" | sed 's/[].[^$$\\\\*]/\\\\\\\\&/g'`; \\\n\ttopsrcdirstrip=`echo \"$(top_srcdir)\" | sed 's/[].[^$$\\\\*]/\\\\\\\\&/g'`; \\\n\tlist='$(DISTFILES)'; \\\n\t  dist_files=`for file in $$list; do echo $$file; done | \\\n\t  sed -e \"s|^$$srcdirstrip/||;t\" \\\n\t      -e \"s|^$$topsrcdirstrip/|$(top_builddir)/|;t\"`; \\\n\tcase $$dist_files in \\\n\t  */*) $(MKDIR_P) `echo \"$$dist_files\" | \\\n\t\t\t   sed '/\\//!d;s|^|$(distdir)/|;s,/[^/]*$$,,' | \\\n\t\t\t   sort -u` ;; \\\n\tesac; \\\n\tfor file in $$dist_files; do \\\n\t  if test -f $$file || test -d $$file; then d=.; else d=$(srcdir); fi; \\\n\t  if test -d $$d/$$file; then \\\n\t    dir=`echo \"/$$file\" | sed -e 's,/[^/]*$$,,'`; \\\n\t    if test -d \"$(distdir)/$$file\"; then \\\n\t      find \"$(distdir)/$$file\" -type d ! -perm -700 -exec chmod u+rwx {} \\;; \\\n\t    fi; \\\n\t    if test -d $(srcdir)/$$file && test $$d != $(srcdir); then \\\n\t      cp -fpR $(srcdir)/$$file \"$(distdir)$$dir\" || exit 1; \\\n\t      find \"$(distdir)/$$file\" -type d ! -perm -700 -exec chmod u+rwx {} \\;; \\\n\t    fi; \\\n\t    cp -fpR $$d/$$file \"$(distdir)$$dir\" || exit 1; \\\n\t  else \\\n\t    test -f \"$(distdir)/$$file\" \\\n\t    || cp -p $$d/$$file \"$(distdir)/$$file\" \\\n\t    || exit 1; \\\n\t  fi; \\\n\tdone\n\t@list='$(DIST_SUBDIRS)'; for subdir in $$list; do \\\n\t  if test \"$$subdir\" = .; then :; else \\\n\t    $(am__make_dryrun) \\\n\t      || test -d \"$(distdir)/$$subdir\" \\\n\t      || $(MKDIR_P) \"$(distdir)/$$subdir\" \\\n\t      || exit 1; \\\n\t    dir1=$$subdir; dir2=\"$(distdir)/$$subdir\"; \\\n\t    $(am__relativize); \\\n\t    new_distdir=$$reldir; \\\n\t    dir1=$$subdir; dir2=\"$(top_distdir)\"; \\\n\t    $(am__relativize); \\\n\t    new_top_distdir=$$reldir; \\\n\t    echo \" (cd $$subdir && $(MAKE) $(AM_MAKEFLAGS) top_distdir=\"$$new_top_distdir\" distdir=\"$$new_distdir\" \\\\\"; \\\n\t    echo \"     am__remove_distdir=: am__skip_length_check=: am__skip_mode_fix=: distdir)\"; \\\n\t    ($(am__cd) $$subdir && \\\n\t      $(MAKE) $(AM_MAKEFLAGS) \\\n\t        top_distdir=\"$$new_top_distdir\" \\\n\t        distdir=\"$$new_distdir\" \\\n\t\tam__remove_distdir=: \\\n\t\tam__skip_length_check=: \\\n\t\tam__skip_mode_fix=: \\\n\t        distdir) \\\n\t      || exit 1; \\\n\t  fi; \\\n\tdone\ncheck-am: all-am\ncheck: check-recursive\nall-am: Makefile\ninstalldirs: installdirs-recursive\ninstalldirs-am:\ninstall: install-recursive\ninstall-exec: install-exec-recursive\ninstall-data: install-data-recursive\nuninstall: uninstall-recursive\n\ninstall-am: all-am\n\t@$(MAKE) $(AM_MAKEFLAGS) install-exec-am install-data-am\n\ninstallcheck: installcheck-recursive\ninstall-strip:\n\tif test -z '$(STRIP)'; then \\\n\t  $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" \\\n\t    install_sh_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" INSTALL_STRIP_FLAG=-s \\\n\t      install; \\\n\telse \\\n\t  $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" \\\n\t    install_sh_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" INSTALL_STRIP_FLAG=-s \\\n\t    \"INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'\" install; \\\n\tfi\nmostlyclean-generic:\n\nclean-generic:\n\ndistclean-generic:\n\t-test -z \"$(CONFIG_CLEAN_FILES)\" || rm -f $(CONFIG_CLEAN_FILES)\n\t-test . = \"$(srcdir)\" || test -z \"$(CONFIG_CLEAN_VPATH_FILES)\" || rm -f $(CONFIG_CLEAN_VPATH_FILES)\n\nmaintainer-clean-generic:\n\t@echo \"This command is intended for maintainers to use\"\n\t@echo \"it deletes files that may require special tools to rebuild.\"\nclean: clean-recursive\n\nclean-am: clean-generic clean-libtool mostlyclean-am\n\ndistclean: distclean-recursive\n\t-rm -f Makefile\ndistclean-am: clean-am distclean-generic distclean-tags\n\ndvi: dvi-recursive\n\ndvi-am:\n\nhtml: html-recursive\n\nhtml-am:\n\ninfo: info-recursive\n\ninfo-am:\n\ninstall-data-am:\n\ninstall-dvi: install-dvi-recursive\n\ninstall-dvi-am:\n\ninstall-exec-am:\n\ninstall-html: install-html-recursive\n\ninstall-html-am:\n\ninstall-info: install-info-recursive\n\ninstall-info-am:\n\ninstall-man:\n\ninstall-pdf: install-pdf-recursive\n\ninstall-pdf-am:\n\ninstall-ps: install-ps-recursive\n\ninstall-ps-am:\n\ninstallcheck-am:\n\nmaintainer-clean: maintainer-clean-recursive\n\t-rm -f Makefile\nmaintainer-clean-am: distclean-am maintainer-clean-generic\n\nmostlyclean: mostlyclean-recursive\n\nmostlyclean-am: mostlyclean-generic mostlyclean-libtool\n\npdf: pdf-recursive\n\npdf-am:\n\nps: ps-recursive\n\nps-am:\n\nuninstall-am:\n\n.MAKE: $(am__recursive_targets) install-am install-strip\n\n.PHONY: $(am__recursive_targets) CTAGS GTAGS TAGS all all-am check \\\n\tcheck-am clean clean-generic clean-libtool cscopelist-am ctags \\\n\tctags-am distclean distclean-generic distclean-libtool \\\n\tdistclean-tags distdir dvi dvi-am html html-am info info-am \\\n\tinstall install-am install-data install-data-am install-dvi \\\n\tinstall-dvi-am install-exec install-exec-am install-html \\\n\tinstall-html-am install-info install-info-am install-man \\\n\tinstall-pdf install-pdf-am install-ps install-ps-am \\\n\tinstall-strip installcheck installcheck-am installdirs \\\n\tinstalldirs-am maintainer-clean maintainer-clean-generic \\\n\tmostlyclean mostlyclean-generic mostlyclean-libtool pdf pdf-am \\\n\tps ps-am tags tags-am uninstall uninstall-am\n\n\n# Tell versions [3.59,3.63) of GNU make to not export all variables.\n# Otherwise a system limit (for SysV at least) may be exceeded.\n.NOEXPORT:\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/extensions/compact/Makefile.am",
    "content": "AM_CPPFLAGS = -I$(srcdir)/../../include $(ICU_CPPFLAGS)\n\nlibfstdir = @libfstdir@\nlibfst_LTLIBRARIES = compact8_acceptor-fst.la compact8_string-fst.la compact8_unweighted-fst.la compact8_unweighted_acceptor-fst.la compact8_weighted_string-fst.la compact16_acceptor-fst.la compact16_string-fst.la compact16_unweighted-fst.la compact16_unweighted_acceptor-fst.la compact16_weighted_string-fst.la compact64_acceptor-fst.la compact64_string-fst.la compact64_unweighted-fst.la compact64_unweighted_acceptor-fst.la compact64_weighted_string-fst.la\n\nlib_LTLIBRARIES = libfstcompact.la\n\nlibfstcompact_la_SOURCES = compact8_acceptor-fst.cc compact8_string-fst.cc compact8_unweighted-fst.cc compact8_unweighted_acceptor-fst.cc compact8_weighted_string-fst.cc compact16_acceptor-fst.cc compact16_string-fst.cc compact16_unweighted-fst.cc compact16_unweighted_acceptor-fst.cc compact16_weighted_string-fst.cc compact64_acceptor-fst.cc compact64_string-fst.cc compact64_unweighted-fst.cc compact64_unweighted_acceptor-fst.cc compact64_weighted_string-fst.cc\nlibfstcompact_la_LDFLAGS = -version-info 10:0:0\nlibfstcompact_la_LIBADD = ../../lib/libfst.la -lm $(DL_LIBS)\n\ncompact8_acceptor_fst_la_SOURCES = compact8_acceptor-fst.cc\ncompact8_acceptor_fst_la_LDFLAGS = -module\n\ncompact8_string_fst_la_SOURCES = compact8_string-fst.cc\ncompact8_string_fst_la_LDFLAGS = -module\n\ncompact8_unweighted_fst_la_SOURCES = compact8_unweighted-fst.cc\ncompact8_unweighted_fst_la_LDFLAGS = -module\n\ncompact8_unweighted_acceptor_fst_la_SOURCES = compact8_unweighted_acceptor-fst.cc\ncompact8_unweighted_acceptor_fst_la_LDFLAGS = -module\n\ncompact8_weighted_string_fst_la_SOURCES = compact8_weighted_string-fst.cc\ncompact8_weighted_string_fst_la_LDFLAGS = -module\n\ncompact16_acceptor_fst_la_SOURCES = compact16_acceptor-fst.cc\ncompact16_acceptor_fst_la_LDFLAGS = -module\n\ncompact16_string_fst_la_SOURCES = compact16_string-fst.cc\ncompact16_string_fst_la_LDFLAGS = -module\n\ncompact16_unweighted_fst_la_SOURCES = compact16_unweighted-fst.cc\ncompact16_unweighted_fst_la_LDFLAGS = -module\n\ncompact16_unweighted_acceptor_fst_la_SOURCES = compact16_unweighted_acceptor-fst.cc\ncompact16_unweighted_acceptor_fst_la_LDFLAGS = -module\n\ncompact16_weighted_string_fst_la_SOURCES = compact16_weighted_string-fst.cc\ncompact16_weighted_string_fst_la_LDFLAGS = -module\n\ncompact64_acceptor_fst_la_SOURCES = compact64_acceptor-fst.cc\ncompact64_acceptor_fst_la_LDFLAGS = -module\n\ncompact64_string_fst_la_SOURCES = compact64_string-fst.cc\ncompact64_string_fst_la_LDFLAGS = -module\n\ncompact64_unweighted_fst_la_SOURCES = compact64_unweighted-fst.cc\ncompact64_unweighted_fst_la_LDFLAGS = -module\n\ncompact64_unweighted_acceptor_fst_la_SOURCES = compact64_unweighted_acceptor-fst.cc\ncompact64_unweighted_acceptor_fst_la_LDFLAGS = -module\n\ncompact64_weighted_string_fst_la_SOURCES = compact64_weighted_string-fst.cc\ncompact64_weighted_string_fst_la_LDFLAGS = -module\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/extensions/compact/Makefile.in",
    "content": "# Makefile.in generated by automake 1.14.1 from Makefile.am.\n# @configure_input@\n\n# Copyright (C) 1994-2013 Free Software Foundation, Inc.\n\n# This Makefile.in is free software; the Free Software Foundation\n# gives unlimited permission to copy and/or distribute it,\n# with or without modifications, as long as this notice is preserved.\n\n# This program is distributed in the hope that it will be useful,\n# but WITHOUT ANY WARRANTY, to the extent permitted by law; without\n# even the implied warranty of MERCHANTABILITY or FITNESS FOR A\n# PARTICULAR PURPOSE.\n\n@SET_MAKE@\n\nVPATH = @srcdir@\nam__is_gnu_make = test -n '$(MAKEFILE_LIST)' && test -n '$(MAKELEVEL)'\nam__make_running_with_option = \\\n  case $${target_option-} in \\\n      ?) ;; \\\n      *) echo \"am__make_running_with_option: internal error: invalid\" \\\n              \"target option '$${target_option-}' specified\" >&2; \\\n         exit 1;; \\\n  esac; \\\n  has_opt=no; \\\n  sane_makeflags=$$MAKEFLAGS; \\\n  if $(am__is_gnu_make); then \\\n    sane_makeflags=$$MFLAGS; \\\n  else \\\n    case $$MAKEFLAGS in \\\n      *\\\\[\\ \\\t]*) \\\n        bs=\\\\; \\\n        sane_makeflags=`printf '%s\\n' \"$$MAKEFLAGS\" \\\n          | sed \"s/$$bs$$bs[$$bs $$bs\t]*//g\"`;; \\\n    esac; \\\n  fi; \\\n  skip_next=no; \\\n  strip_trailopt () \\\n  { \\\n    flg=`printf '%s\\n' \"$$flg\" | sed \"s/$$1.*$$//\"`; \\\n  }; \\\n  for flg in $$sane_makeflags; do \\\n    test $$skip_next = yes && { skip_next=no; continue; }; \\\n    case $$flg in \\\n      *=*|--*) continue;; \\\n        -*I) strip_trailopt 'I'; skip_next=yes;; \\\n      -*I?*) strip_trailopt 'I';; \\\n        -*O) strip_trailopt 'O'; skip_next=yes;; \\\n      -*O?*) strip_trailopt 'O';; \\\n        -*l) strip_trailopt 'l'; skip_next=yes;; \\\n      -*l?*) strip_trailopt 'l';; \\\n      -[dEDm]) skip_next=yes;; \\\n      -[JT]) skip_next=yes;; \\\n    esac; \\\n    case $$flg in \\\n      *$$target_option*) has_opt=yes; break;; \\\n    esac; \\\n  done; \\\n  test $$has_opt = yes\nam__make_dryrun = (target_option=n; $(am__make_running_with_option))\nam__make_keepgoing = (target_option=k; $(am__make_running_with_option))\npkgdatadir = $(datadir)/@PACKAGE@\npkgincludedir = $(includedir)/@PACKAGE@\npkglibdir = $(libdir)/@PACKAGE@\npkglibexecdir = $(libexecdir)/@PACKAGE@\nam__cd = CDPATH=\"$${ZSH_VERSION+.}$(PATH_SEPARATOR)\" && cd\ninstall_sh_DATA = $(install_sh) -c -m 644\ninstall_sh_PROGRAM = $(install_sh) -c\ninstall_sh_SCRIPT = $(install_sh) -c\nINSTALL_HEADER = $(INSTALL_DATA)\ntransform = $(program_transform_name)\nNORMAL_INSTALL = :\nPRE_INSTALL = :\nPOST_INSTALL = :\nNORMAL_UNINSTALL = :\nPRE_UNINSTALL = :\nPOST_UNINSTALL = :\nbuild_triplet = @build@\nhost_triplet = @host@\nsubdir = src/extensions/compact\nDIST_COMMON = $(srcdir)/Makefile.in $(srcdir)/Makefile.am \\\n\t$(top_srcdir)/depcomp\nACLOCAL_M4 = $(top_srcdir)/aclocal.m4\nam__aclocal_m4_deps = $(top_srcdir)/m4/ac_python_devel.m4 \\\n\t$(top_srcdir)/m4/libtool.m4 $(top_srcdir)/m4/ltoptions.m4 \\\n\t$(top_srcdir)/m4/ltsugar.m4 $(top_srcdir)/m4/ltversion.m4 \\\n\t$(top_srcdir)/m4/lt~obsolete.m4 $(top_srcdir)/configure.ac\nam__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \\\n\t$(ACLOCAL_M4)\nmkinstalldirs = $(install_sh) -d\nCONFIG_HEADER = $(top_builddir)/config.h \\\n\t$(top_builddir)/src/include/fst/config.h\nCONFIG_CLEAN_FILES =\nCONFIG_CLEAN_VPATH_FILES =\nam__vpath_adj_setup = srcdirstrip=`echo \"$(srcdir)\" | sed 's|.|.|g'`;\nam__vpath_adj = case $$p in \\\n    $(srcdir)/*) f=`echo \"$$p\" | sed \"s|^$$srcdirstrip/||\"`;; \\\n    *) f=$$p;; \\\n  esac;\nam__strip_dir = f=`echo $$p | sed -e 's|^.*/||'`;\nam__install_max = 40\nam__nobase_strip_setup = \\\n  srcdirstrip=`echo \"$(srcdir)\" | sed 's/[].[^$$\\\\*|]/\\\\\\\\&/g'`\nam__nobase_strip = \\\n  for p in $$list; do echo \"$$p\"; done | sed -e \"s|$$srcdirstrip/||\"\nam__nobase_list = $(am__nobase_strip_setup); \\\n  for p in $$list; do echo \"$$p $$p\"; done | \\\n  sed \"s| $$srcdirstrip/| |;\"' / .*\\//!s/ .*/ ./; s,\\( .*\\)/[^/]*$$,\\1,' | \\\n  $(AWK) 'BEGIN { files[\".\"] = \"\" } { files[$$2] = files[$$2] \" \" $$1; \\\n    if (++n[$$2] == $(am__install_max)) \\\n      { print $$2, files[$$2]; n[$$2] = 0; files[$$2] = \"\" } } \\\n    END { for (dir in files) print dir, files[dir] }'\nam__base_list = \\\n  sed '$$!N;$$!N;$$!N;$$!N;$$!N;$$!N;$$!N;s/\\n/ /g' | \\\n  sed '$$!N;$$!N;$$!N;$$!N;s/\\n/ /g'\nam__uninstall_files_from_dir = { \\\n  test -z \"$$files\" \\\n    || { test ! -d \"$$dir\" && test ! -f \"$$dir\" && test ! -r \"$$dir\"; } \\\n    || { echo \" ( cd '$$dir' && rm -f\" $$files \")\"; \\\n         $(am__cd) \"$$dir\" && rm -f $$files; }; \\\n  }\nam__installdirs = \"$(DESTDIR)$(libdir)\" \"$(DESTDIR)$(libfstdir)\"\nLTLIBRARIES = $(lib_LTLIBRARIES) $(libfst_LTLIBRARIES)\ncompact16_acceptor_fst_la_LIBADD =\nam_compact16_acceptor_fst_la_OBJECTS = compact16_acceptor-fst.lo\ncompact16_acceptor_fst_la_OBJECTS =  \\\n\t$(am_compact16_acceptor_fst_la_OBJECTS)\nAM_V_lt = $(am__v_lt_@AM_V@)\nam__v_lt_ = $(am__v_lt_@AM_DEFAULT_V@)\nam__v_lt_0 = --silent\nam__v_lt_1 = \ncompact16_acceptor_fst_la_LINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX \\\n\t$(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=link $(CXXLD) \\\n\t$(AM_CXXFLAGS) $(CXXFLAGS) \\\n\t$(compact16_acceptor_fst_la_LDFLAGS) $(LDFLAGS) -o $@\ncompact16_string_fst_la_LIBADD =\nam_compact16_string_fst_la_OBJECTS = compact16_string-fst.lo\ncompact16_string_fst_la_OBJECTS =  \\\n\t$(am_compact16_string_fst_la_OBJECTS)\ncompact16_string_fst_la_LINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX \\\n\t$(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=link $(CXXLD) \\\n\t$(AM_CXXFLAGS) $(CXXFLAGS) $(compact16_string_fst_la_LDFLAGS) \\\n\t$(LDFLAGS) -o $@\ncompact16_unweighted_fst_la_LIBADD =\nam_compact16_unweighted_fst_la_OBJECTS = compact16_unweighted-fst.lo\ncompact16_unweighted_fst_la_OBJECTS =  \\\n\t$(am_compact16_unweighted_fst_la_OBJECTS)\ncompact16_unweighted_fst_la_LINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX \\\n\t$(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=link $(CXXLD) \\\n\t$(AM_CXXFLAGS) $(CXXFLAGS) \\\n\t$(compact16_unweighted_fst_la_LDFLAGS) $(LDFLAGS) -o $@\ncompact16_unweighted_acceptor_fst_la_LIBADD =\nam_compact16_unweighted_acceptor_fst_la_OBJECTS =  \\\n\tcompact16_unweighted_acceptor-fst.lo\ncompact16_unweighted_acceptor_fst_la_OBJECTS =  \\\n\t$(am_compact16_unweighted_acceptor_fst_la_OBJECTS)\ncompact16_unweighted_acceptor_fst_la_LINK = $(LIBTOOL) $(AM_V_lt) \\\n\t--tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=link \\\n\t$(CXXLD) $(AM_CXXFLAGS) $(CXXFLAGS) \\\n\t$(compact16_unweighted_acceptor_fst_la_LDFLAGS) $(LDFLAGS) -o \\\n\t$@\ncompact16_weighted_string_fst_la_LIBADD =\nam_compact16_weighted_string_fst_la_OBJECTS =  \\\n\tcompact16_weighted_string-fst.lo\ncompact16_weighted_string_fst_la_OBJECTS =  \\\n\t$(am_compact16_weighted_string_fst_la_OBJECTS)\ncompact16_weighted_string_fst_la_LINK = $(LIBTOOL) $(AM_V_lt) \\\n\t--tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=link \\\n\t$(CXXLD) $(AM_CXXFLAGS) $(CXXFLAGS) \\\n\t$(compact16_weighted_string_fst_la_LDFLAGS) $(LDFLAGS) -o $@\ncompact64_acceptor_fst_la_LIBADD =\nam_compact64_acceptor_fst_la_OBJECTS = compact64_acceptor-fst.lo\ncompact64_acceptor_fst_la_OBJECTS =  \\\n\t$(am_compact64_acceptor_fst_la_OBJECTS)\ncompact64_acceptor_fst_la_LINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX \\\n\t$(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=link $(CXXLD) \\\n\t$(AM_CXXFLAGS) $(CXXFLAGS) \\\n\t$(compact64_acceptor_fst_la_LDFLAGS) $(LDFLAGS) -o $@\ncompact64_string_fst_la_LIBADD =\nam_compact64_string_fst_la_OBJECTS = compact64_string-fst.lo\ncompact64_string_fst_la_OBJECTS =  \\\n\t$(am_compact64_string_fst_la_OBJECTS)\ncompact64_string_fst_la_LINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX \\\n\t$(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=link $(CXXLD) \\\n\t$(AM_CXXFLAGS) $(CXXFLAGS) $(compact64_string_fst_la_LDFLAGS) \\\n\t$(LDFLAGS) -o $@\ncompact64_unweighted_fst_la_LIBADD =\nam_compact64_unweighted_fst_la_OBJECTS = compact64_unweighted-fst.lo\ncompact64_unweighted_fst_la_OBJECTS =  \\\n\t$(am_compact64_unweighted_fst_la_OBJECTS)\ncompact64_unweighted_fst_la_LINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX \\\n\t$(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=link $(CXXLD) \\\n\t$(AM_CXXFLAGS) $(CXXFLAGS) \\\n\t$(compact64_unweighted_fst_la_LDFLAGS) $(LDFLAGS) -o $@\ncompact64_unweighted_acceptor_fst_la_LIBADD =\nam_compact64_unweighted_acceptor_fst_la_OBJECTS =  \\\n\tcompact64_unweighted_acceptor-fst.lo\ncompact64_unweighted_acceptor_fst_la_OBJECTS =  \\\n\t$(am_compact64_unweighted_acceptor_fst_la_OBJECTS)\ncompact64_unweighted_acceptor_fst_la_LINK = $(LIBTOOL) $(AM_V_lt) \\\n\t--tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=link \\\n\t$(CXXLD) $(AM_CXXFLAGS) $(CXXFLAGS) \\\n\t$(compact64_unweighted_acceptor_fst_la_LDFLAGS) $(LDFLAGS) -o \\\n\t$@\ncompact64_weighted_string_fst_la_LIBADD =\nam_compact64_weighted_string_fst_la_OBJECTS =  \\\n\tcompact64_weighted_string-fst.lo\ncompact64_weighted_string_fst_la_OBJECTS =  \\\n\t$(am_compact64_weighted_string_fst_la_OBJECTS)\ncompact64_weighted_string_fst_la_LINK = $(LIBTOOL) $(AM_V_lt) \\\n\t--tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=link \\\n\t$(CXXLD) $(AM_CXXFLAGS) $(CXXFLAGS) \\\n\t$(compact64_weighted_string_fst_la_LDFLAGS) $(LDFLAGS) -o $@\ncompact8_acceptor_fst_la_LIBADD =\nam_compact8_acceptor_fst_la_OBJECTS = compact8_acceptor-fst.lo\ncompact8_acceptor_fst_la_OBJECTS =  \\\n\t$(am_compact8_acceptor_fst_la_OBJECTS)\ncompact8_acceptor_fst_la_LINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX \\\n\t$(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=link $(CXXLD) \\\n\t$(AM_CXXFLAGS) $(CXXFLAGS) $(compact8_acceptor_fst_la_LDFLAGS) \\\n\t$(LDFLAGS) -o $@\ncompact8_string_fst_la_LIBADD =\nam_compact8_string_fst_la_OBJECTS = compact8_string-fst.lo\ncompact8_string_fst_la_OBJECTS = $(am_compact8_string_fst_la_OBJECTS)\ncompact8_string_fst_la_LINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX \\\n\t$(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=link $(CXXLD) \\\n\t$(AM_CXXFLAGS) $(CXXFLAGS) $(compact8_string_fst_la_LDFLAGS) \\\n\t$(LDFLAGS) -o $@\ncompact8_unweighted_fst_la_LIBADD =\nam_compact8_unweighted_fst_la_OBJECTS = compact8_unweighted-fst.lo\ncompact8_unweighted_fst_la_OBJECTS =  \\\n\t$(am_compact8_unweighted_fst_la_OBJECTS)\ncompact8_unweighted_fst_la_LINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX \\\n\t$(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=link $(CXXLD) \\\n\t$(AM_CXXFLAGS) $(CXXFLAGS) \\\n\t$(compact8_unweighted_fst_la_LDFLAGS) $(LDFLAGS) -o $@\ncompact8_unweighted_acceptor_fst_la_LIBADD =\nam_compact8_unweighted_acceptor_fst_la_OBJECTS =  \\\n\tcompact8_unweighted_acceptor-fst.lo\ncompact8_unweighted_acceptor_fst_la_OBJECTS =  \\\n\t$(am_compact8_unweighted_acceptor_fst_la_OBJECTS)\ncompact8_unweighted_acceptor_fst_la_LINK = $(LIBTOOL) $(AM_V_lt) \\\n\t--tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=link \\\n\t$(CXXLD) $(AM_CXXFLAGS) $(CXXFLAGS) \\\n\t$(compact8_unweighted_acceptor_fst_la_LDFLAGS) $(LDFLAGS) -o \\\n\t$@\ncompact8_weighted_string_fst_la_LIBADD =\nam_compact8_weighted_string_fst_la_OBJECTS =  \\\n\tcompact8_weighted_string-fst.lo\ncompact8_weighted_string_fst_la_OBJECTS =  \\\n\t$(am_compact8_weighted_string_fst_la_OBJECTS)\ncompact8_weighted_string_fst_la_LINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX \\\n\t$(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=link $(CXXLD) \\\n\t$(AM_CXXFLAGS) $(CXXFLAGS) \\\n\t$(compact8_weighted_string_fst_la_LDFLAGS) $(LDFLAGS) -o $@\nam__DEPENDENCIES_1 =\nlibfstcompact_la_DEPENDENCIES = ../../lib/libfst.la \\\n\t$(am__DEPENDENCIES_1)\nam_libfstcompact_la_OBJECTS = compact8_acceptor-fst.lo \\\n\tcompact8_string-fst.lo compact8_unweighted-fst.lo \\\n\tcompact8_unweighted_acceptor-fst.lo \\\n\tcompact8_weighted_string-fst.lo compact16_acceptor-fst.lo \\\n\tcompact16_string-fst.lo compact16_unweighted-fst.lo \\\n\tcompact16_unweighted_acceptor-fst.lo \\\n\tcompact16_weighted_string-fst.lo compact64_acceptor-fst.lo \\\n\tcompact64_string-fst.lo compact64_unweighted-fst.lo \\\n\tcompact64_unweighted_acceptor-fst.lo \\\n\tcompact64_weighted_string-fst.lo\nlibfstcompact_la_OBJECTS = $(am_libfstcompact_la_OBJECTS)\nlibfstcompact_la_LINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX \\\n\t$(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=link $(CXXLD) \\\n\t$(AM_CXXFLAGS) $(CXXFLAGS) $(libfstcompact_la_LDFLAGS) \\\n\t$(LDFLAGS) -o $@\nAM_V_P = $(am__v_P_@AM_V@)\nam__v_P_ = $(am__v_P_@AM_DEFAULT_V@)\nam__v_P_0 = false\nam__v_P_1 = :\nAM_V_GEN = $(am__v_GEN_@AM_V@)\nam__v_GEN_ = $(am__v_GEN_@AM_DEFAULT_V@)\nam__v_GEN_0 = @echo \"  GEN     \" $@;\nam__v_GEN_1 = \nAM_V_at = $(am__v_at_@AM_V@)\nam__v_at_ = $(am__v_at_@AM_DEFAULT_V@)\nam__v_at_0 = @\nam__v_at_1 = \nDEFAULT_INCLUDES = \ndepcomp = $(SHELL) $(top_srcdir)/depcomp\nam__depfiles_maybe = depfiles\nam__mv = mv -f\nCXXCOMPILE = $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) \\\n\t$(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS)\nLTCXXCOMPILE = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \\\n\t$(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) \\\n\t$(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) \\\n\t$(AM_CXXFLAGS) $(CXXFLAGS)\nAM_V_CXX = $(am__v_CXX_@AM_V@)\nam__v_CXX_ = $(am__v_CXX_@AM_DEFAULT_V@)\nam__v_CXX_0 = @echo \"  CXX     \" $@;\nam__v_CXX_1 = \nCXXLD = $(CXX)\nCXXLINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \\\n\t$(LIBTOOLFLAGS) --mode=link $(CXXLD) $(AM_CXXFLAGS) \\\n\t$(CXXFLAGS) $(AM_LDFLAGS) $(LDFLAGS) -o $@\nAM_V_CXXLD = $(am__v_CXXLD_@AM_V@)\nam__v_CXXLD_ = $(am__v_CXXLD_@AM_DEFAULT_V@)\nam__v_CXXLD_0 = @echo \"  CXXLD   \" $@;\nam__v_CXXLD_1 = \nSOURCES = $(compact16_acceptor_fst_la_SOURCES) \\\n\t$(compact16_string_fst_la_SOURCES) \\\n\t$(compact16_unweighted_fst_la_SOURCES) \\\n\t$(compact16_unweighted_acceptor_fst_la_SOURCES) \\\n\t$(compact16_weighted_string_fst_la_SOURCES) \\\n\t$(compact64_acceptor_fst_la_SOURCES) \\\n\t$(compact64_string_fst_la_SOURCES) \\\n\t$(compact64_unweighted_fst_la_SOURCES) \\\n\t$(compact64_unweighted_acceptor_fst_la_SOURCES) \\\n\t$(compact64_weighted_string_fst_la_SOURCES) \\\n\t$(compact8_acceptor_fst_la_SOURCES) \\\n\t$(compact8_string_fst_la_SOURCES) \\\n\t$(compact8_unweighted_fst_la_SOURCES) \\\n\t$(compact8_unweighted_acceptor_fst_la_SOURCES) \\\n\t$(compact8_weighted_string_fst_la_SOURCES) \\\n\t$(libfstcompact_la_SOURCES)\nDIST_SOURCES = $(compact16_acceptor_fst_la_SOURCES) \\\n\t$(compact16_string_fst_la_SOURCES) \\\n\t$(compact16_unweighted_fst_la_SOURCES) \\\n\t$(compact16_unweighted_acceptor_fst_la_SOURCES) \\\n\t$(compact16_weighted_string_fst_la_SOURCES) \\\n\t$(compact64_acceptor_fst_la_SOURCES) \\\n\t$(compact64_string_fst_la_SOURCES) \\\n\t$(compact64_unweighted_fst_la_SOURCES) \\\n\t$(compact64_unweighted_acceptor_fst_la_SOURCES) \\\n\t$(compact64_weighted_string_fst_la_SOURCES) \\\n\t$(compact8_acceptor_fst_la_SOURCES) \\\n\t$(compact8_string_fst_la_SOURCES) \\\n\t$(compact8_unweighted_fst_la_SOURCES) \\\n\t$(compact8_unweighted_acceptor_fst_la_SOURCES) \\\n\t$(compact8_weighted_string_fst_la_SOURCES) \\\n\t$(libfstcompact_la_SOURCES)\nam__can_run_installinfo = \\\n  case $$AM_UPDATE_INFO_DIR in \\\n    n|no|NO) false;; \\\n    *) (install-info --version) >/dev/null 2>&1;; \\\n  esac\nam__tagged_files = $(HEADERS) $(SOURCES) $(TAGS_FILES) $(LISP)\n# Read a list of newline-separated strings from the standard input,\n# and print each of them once, without duplicates.  Input order is\n# *not* preserved.\nam__uniquify_input = $(AWK) '\\\n  BEGIN { nonempty = 0; } \\\n  { items[$$0] = 1; nonempty = 1; } \\\n  END { if (nonempty) { for (i in items) print i; }; } \\\n'\n# Make sure the list of sources is unique.  This is necessary because,\n# e.g., the same source file might be shared among _SOURCES variables\n# for different programs/libraries.\nam__define_uniq_tagged_files = \\\n  list='$(am__tagged_files)'; \\\n  unique=`for i in $$list; do \\\n    if test -f \"$$i\"; then echo $$i; else echo $(srcdir)/$$i; fi; \\\n  done | $(am__uniquify_input)`\nETAGS = etags\nCTAGS = ctags\nDISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST)\nACLOCAL = @ACLOCAL@\nAMTAR = @AMTAR@\nAM_DEFAULT_VERBOSITY = @AM_DEFAULT_VERBOSITY@\nAR = @AR@\nAUTOCONF = @AUTOCONF@\nAUTOHEADER = @AUTOHEADER@\nAUTOMAKE = @AUTOMAKE@\nAWK = @AWK@\nCC = @CC@\nCCDEPMODE = @CCDEPMODE@\nCFLAGS = @CFLAGS@\nCPP = @CPP@\nCPPFLAGS = @CPPFLAGS@\nCXX = @CXX@\nCXXCPP = @CXXCPP@\nCXXDEPMODE = @CXXDEPMODE@\nCXXFLAGS = @CXXFLAGS@\nCYGPATH_W = @CYGPATH_W@\nDEFS = @DEFS@\nDEPDIR = @DEPDIR@\nDLLTOOL = @DLLTOOL@\nDL_LIBS = @DL_LIBS@\nDSYMUTIL = @DSYMUTIL@\nDUMPBIN = @DUMPBIN@\nECHO_C = @ECHO_C@\nECHO_N = @ECHO_N@\nECHO_T = @ECHO_T@\nEGREP = @EGREP@\nEXEEXT = @EXEEXT@\nFGREP = @FGREP@\nGREP = @GREP@\nINSTALL = @INSTALL@\nINSTALL_DATA = @INSTALL_DATA@\nINSTALL_PROGRAM = @INSTALL_PROGRAM@\nINSTALL_SCRIPT = @INSTALL_SCRIPT@\nINSTALL_STRIP_PROGRAM = @INSTALL_STRIP_PROGRAM@\nLD = @LD@\nLDFLAGS = @LDFLAGS@\nLIBOBJS = @LIBOBJS@\nLIBS = @LIBS@\nLIBTOOL = @LIBTOOL@\nLIPO = @LIPO@\nLN_S = @LN_S@\nLTLIBOBJS = @LTLIBOBJS@\nMAKEINFO = @MAKEINFO@\nMANIFEST_TOOL = @MANIFEST_TOOL@\nMKDIR_P = @MKDIR_P@\nNM = @NM@\nNMEDIT = @NMEDIT@\nOBJDUMP = @OBJDUMP@\nOBJEXT = @OBJEXT@\nOTOOL = @OTOOL@\nOTOOL64 = @OTOOL64@\nPACKAGE = @PACKAGE@\nPACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@\nPACKAGE_NAME = @PACKAGE_NAME@\nPACKAGE_STRING = @PACKAGE_STRING@\nPACKAGE_TARNAME = @PACKAGE_TARNAME@\nPACKAGE_URL = @PACKAGE_URL@\nPACKAGE_VERSION = @PACKAGE_VERSION@\nPATH_SEPARATOR = @PATH_SEPARATOR@\nPYTHON = @PYTHON@\nPYTHON_CPPFLAGS = @PYTHON_CPPFLAGS@\nPYTHON_EXEC_PREFIX = @PYTHON_EXEC_PREFIX@\nPYTHON_EXTRA_LDFLAGS = @PYTHON_EXTRA_LDFLAGS@\nPYTHON_EXTRA_LIBS = @PYTHON_EXTRA_LIBS@\nPYTHON_LDFLAGS = @PYTHON_LDFLAGS@\nPYTHON_PLATFORM = @PYTHON_PLATFORM@\nPYTHON_PREFIX = @PYTHON_PREFIX@\nPYTHON_SITE_PKG = @PYTHON_SITE_PKG@\nPYTHON_VERSION = @PYTHON_VERSION@\nRANLIB = @RANLIB@\nSED = @SED@\nSET_MAKE = @SET_MAKE@\nSHELL = @SHELL@\nSTRIP = @STRIP@\nVERSION = @VERSION@\nabs_builddir = @abs_builddir@\nabs_srcdir = @abs_srcdir@\nabs_top_builddir = @abs_top_builddir@\nabs_top_srcdir = @abs_top_srcdir@\nac_ct_AR = @ac_ct_AR@\nac_ct_CC = @ac_ct_CC@\nac_ct_CXX = @ac_ct_CXX@\nac_ct_DUMPBIN = @ac_ct_DUMPBIN@\nam__include = @am__include@\nam__leading_dot = @am__leading_dot@\nam__quote = @am__quote@\nam__tar = @am__tar@\nam__untar = @am__untar@\nbindir = @bindir@\nbuild = @build@\nbuild_alias = @build_alias@\nbuild_cpu = @build_cpu@\nbuild_os = @build_os@\nbuild_vendor = @build_vendor@\nbuilddir = @builddir@\ndatadir = @datadir@\ndatarootdir = @datarootdir@\ndocdir = @docdir@\ndvidir = @dvidir@\nexec_prefix = @exec_prefix@\nhost = @host@\nhost_alias = @host_alias@\nhost_cpu = @host_cpu@\nhost_os = @host_os@\nhost_vendor = @host_vendor@\nhtmldir = @htmldir@\nincludedir = @includedir@\ninfodir = @infodir@\ninstall_sh = @install_sh@\nlibdir = @libdir@\nlibexecdir = @libexecdir@\nlibfstdir = @libfstdir@\nlocaledir = @localedir@\nlocalstatedir = @localstatedir@\nmandir = @mandir@\nmkdir_p = @mkdir_p@\noldincludedir = @oldincludedir@\npdfdir = @pdfdir@\npkgpyexecdir = @pkgpyexecdir@\npkgpythondir = @pkgpythondir@\nprefix = @prefix@\nprogram_transform_name = @program_transform_name@\npsdir = @psdir@\npyexecdir = @pyexecdir@\npythondir = @pythondir@\nsbindir = @sbindir@\nsharedstatedir = @sharedstatedir@\nsrcdir = @srcdir@\nsysconfdir = @sysconfdir@\ntarget_alias = @target_alias@\ntop_build_prefix = @top_build_prefix@\ntop_builddir = @top_builddir@\ntop_srcdir = @top_srcdir@\nAM_CPPFLAGS = -I$(srcdir)/../../include $(ICU_CPPFLAGS)\nlibfst_LTLIBRARIES = compact8_acceptor-fst.la compact8_string-fst.la compact8_unweighted-fst.la compact8_unweighted_acceptor-fst.la compact8_weighted_string-fst.la compact16_acceptor-fst.la compact16_string-fst.la compact16_unweighted-fst.la compact16_unweighted_acceptor-fst.la compact16_weighted_string-fst.la compact64_acceptor-fst.la compact64_string-fst.la compact64_unweighted-fst.la compact64_unweighted_acceptor-fst.la compact64_weighted_string-fst.la\nlib_LTLIBRARIES = libfstcompact.la\nlibfstcompact_la_SOURCES = compact8_acceptor-fst.cc compact8_string-fst.cc compact8_unweighted-fst.cc compact8_unweighted_acceptor-fst.cc compact8_weighted_string-fst.cc compact16_acceptor-fst.cc compact16_string-fst.cc compact16_unweighted-fst.cc compact16_unweighted_acceptor-fst.cc compact16_weighted_string-fst.cc compact64_acceptor-fst.cc compact64_string-fst.cc compact64_unweighted-fst.cc compact64_unweighted_acceptor-fst.cc compact64_weighted_string-fst.cc\nlibfstcompact_la_LDFLAGS = -version-info 10:0:0\nlibfstcompact_la_LIBADD = ../../lib/libfst.la -lm $(DL_LIBS)\ncompact8_acceptor_fst_la_SOURCES = compact8_acceptor-fst.cc\ncompact8_acceptor_fst_la_LDFLAGS = -module\ncompact8_string_fst_la_SOURCES = compact8_string-fst.cc\ncompact8_string_fst_la_LDFLAGS = -module\ncompact8_unweighted_fst_la_SOURCES = compact8_unweighted-fst.cc\ncompact8_unweighted_fst_la_LDFLAGS = -module\ncompact8_unweighted_acceptor_fst_la_SOURCES = compact8_unweighted_acceptor-fst.cc\ncompact8_unweighted_acceptor_fst_la_LDFLAGS = -module\ncompact8_weighted_string_fst_la_SOURCES = compact8_weighted_string-fst.cc\ncompact8_weighted_string_fst_la_LDFLAGS = -module\ncompact16_acceptor_fst_la_SOURCES = compact16_acceptor-fst.cc\ncompact16_acceptor_fst_la_LDFLAGS = -module\ncompact16_string_fst_la_SOURCES = compact16_string-fst.cc\ncompact16_string_fst_la_LDFLAGS = -module\ncompact16_unweighted_fst_la_SOURCES = compact16_unweighted-fst.cc\ncompact16_unweighted_fst_la_LDFLAGS = -module\ncompact16_unweighted_acceptor_fst_la_SOURCES = compact16_unweighted_acceptor-fst.cc\ncompact16_unweighted_acceptor_fst_la_LDFLAGS = -module\ncompact16_weighted_string_fst_la_SOURCES = compact16_weighted_string-fst.cc\ncompact16_weighted_string_fst_la_LDFLAGS = -module\ncompact64_acceptor_fst_la_SOURCES = compact64_acceptor-fst.cc\ncompact64_acceptor_fst_la_LDFLAGS = -module\ncompact64_string_fst_la_SOURCES = compact64_string-fst.cc\ncompact64_string_fst_la_LDFLAGS = -module\ncompact64_unweighted_fst_la_SOURCES = compact64_unweighted-fst.cc\ncompact64_unweighted_fst_la_LDFLAGS = -module\ncompact64_unweighted_acceptor_fst_la_SOURCES = compact64_unweighted_acceptor-fst.cc\ncompact64_unweighted_acceptor_fst_la_LDFLAGS = -module\ncompact64_weighted_string_fst_la_SOURCES = compact64_weighted_string-fst.cc\ncompact64_weighted_string_fst_la_LDFLAGS = -module\nall: all-am\n\n.SUFFIXES:\n.SUFFIXES: .cc .lo .o .obj\n$(srcdir)/Makefile.in:  $(srcdir)/Makefile.am  $(am__configure_deps)\n\t@for dep in $?; do \\\n\t  case '$(am__configure_deps)' in \\\n\t    *$$dep*) \\\n\t      ( cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh ) \\\n\t        && { if test -f $@; then exit 0; else break; fi; }; \\\n\t      exit 1;; \\\n\t  esac; \\\n\tdone; \\\n\techo ' cd $(top_srcdir) && $(AUTOMAKE) --foreign src/extensions/compact/Makefile'; \\\n\t$(am__cd) $(top_srcdir) && \\\n\t  $(AUTOMAKE) --foreign src/extensions/compact/Makefile\n.PRECIOUS: Makefile\nMakefile: $(srcdir)/Makefile.in $(top_builddir)/config.status\n\t@case '$?' in \\\n\t  *config.status*) \\\n\t    cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh;; \\\n\t  *) \\\n\t    echo ' cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe)'; \\\n\t    cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe);; \\\n\tesac;\n\n$(top_builddir)/config.status: $(top_srcdir)/configure $(CONFIG_STATUS_DEPENDENCIES)\n\tcd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh\n\n$(top_srcdir)/configure:  $(am__configure_deps)\n\tcd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh\n$(ACLOCAL_M4):  $(am__aclocal_m4_deps)\n\tcd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh\n$(am__aclocal_m4_deps):\n\ninstall-libLTLIBRARIES: $(lib_LTLIBRARIES)\n\t@$(NORMAL_INSTALL)\n\t@list='$(lib_LTLIBRARIES)'; test -n \"$(libdir)\" || list=; \\\n\tlist2=; for p in $$list; do \\\n\t  if test -f $$p; then \\\n\t    list2=\"$$list2 $$p\"; \\\n\t  else :; fi; \\\n\tdone; \\\n\ttest -z \"$$list2\" || { \\\n\t  echo \" $(MKDIR_P) '$(DESTDIR)$(libdir)'\"; \\\n\t  $(MKDIR_P) \"$(DESTDIR)$(libdir)\" || exit 1; \\\n\t  echo \" $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) $$list2 '$(DESTDIR)$(libdir)'\"; \\\n\t  $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) $$list2 \"$(DESTDIR)$(libdir)\"; \\\n\t}\n\nuninstall-libLTLIBRARIES:\n\t@$(NORMAL_UNINSTALL)\n\t@list='$(lib_LTLIBRARIES)'; test -n \"$(libdir)\" || list=; \\\n\tfor p in $$list; do \\\n\t  $(am__strip_dir) \\\n\t  echo \" $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=uninstall rm -f '$(DESTDIR)$(libdir)/$$f'\"; \\\n\t  $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=uninstall rm -f \"$(DESTDIR)$(libdir)/$$f\"; \\\n\tdone\n\nclean-libLTLIBRARIES:\n\t-test -z \"$(lib_LTLIBRARIES)\" || rm -f $(lib_LTLIBRARIES)\n\t@list='$(lib_LTLIBRARIES)'; \\\n\tlocs=`for p in $$list; do echo $$p; done | \\\n\t      sed 's|^[^/]*$$|.|; s|/[^/]*$$||; s|$$|/so_locations|' | \\\n\t      sort -u`; \\\n\ttest -z \"$$locs\" || { \\\n\t  echo rm -f $${locs}; \\\n\t  rm -f $${locs}; \\\n\t}\n\ninstall-libfstLTLIBRARIES: $(libfst_LTLIBRARIES)\n\t@$(NORMAL_INSTALL)\n\t@list='$(libfst_LTLIBRARIES)'; test -n \"$(libfstdir)\" || list=; \\\n\tlist2=; for p in $$list; do \\\n\t  if test -f $$p; then \\\n\t    list2=\"$$list2 $$p\"; \\\n\t  else :; fi; \\\n\tdone; \\\n\ttest -z \"$$list2\" || { \\\n\t  echo \" $(MKDIR_P) '$(DESTDIR)$(libfstdir)'\"; \\\n\t  $(MKDIR_P) \"$(DESTDIR)$(libfstdir)\" || exit 1; \\\n\t  echo \" $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) $$list2 '$(DESTDIR)$(libfstdir)'\"; \\\n\t  $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) $$list2 \"$(DESTDIR)$(libfstdir)\"; \\\n\t}\n\nuninstall-libfstLTLIBRARIES:\n\t@$(NORMAL_UNINSTALL)\n\t@list='$(libfst_LTLIBRARIES)'; test -n \"$(libfstdir)\" || list=; \\\n\tfor p in $$list; do \\\n\t  $(am__strip_dir) \\\n\t  echo \" $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=uninstall rm -f '$(DESTDIR)$(libfstdir)/$$f'\"; \\\n\t  $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=uninstall rm -f \"$(DESTDIR)$(libfstdir)/$$f\"; \\\n\tdone\n\nclean-libfstLTLIBRARIES:\n\t-test -z \"$(libfst_LTLIBRARIES)\" || rm -f $(libfst_LTLIBRARIES)\n\t@list='$(libfst_LTLIBRARIES)'; \\\n\tlocs=`for p in $$list; do echo $$p; done | \\\n\t      sed 's|^[^/]*$$|.|; s|/[^/]*$$||; s|$$|/so_locations|' | \\\n\t      sort -u`; \\\n\ttest -z \"$$locs\" || { \\\n\t  echo rm -f $${locs}; \\\n\t  rm -f $${locs}; \\\n\t}\n\ncompact16_acceptor-fst.la: $(compact16_acceptor_fst_la_OBJECTS) $(compact16_acceptor_fst_la_DEPENDENCIES) $(EXTRA_compact16_acceptor_fst_la_DEPENDENCIES) \n\t$(AM_V_CXXLD)$(compact16_acceptor_fst_la_LINK) -rpath $(libfstdir) $(compact16_acceptor_fst_la_OBJECTS) $(compact16_acceptor_fst_la_LIBADD) $(LIBS)\n\ncompact16_string-fst.la: $(compact16_string_fst_la_OBJECTS) $(compact16_string_fst_la_DEPENDENCIES) $(EXTRA_compact16_string_fst_la_DEPENDENCIES) \n\t$(AM_V_CXXLD)$(compact16_string_fst_la_LINK) -rpath $(libfstdir) $(compact16_string_fst_la_OBJECTS) $(compact16_string_fst_la_LIBADD) $(LIBS)\n\ncompact16_unweighted-fst.la: $(compact16_unweighted_fst_la_OBJECTS) $(compact16_unweighted_fst_la_DEPENDENCIES) $(EXTRA_compact16_unweighted_fst_la_DEPENDENCIES) \n\t$(AM_V_CXXLD)$(compact16_unweighted_fst_la_LINK) -rpath $(libfstdir) $(compact16_unweighted_fst_la_OBJECTS) $(compact16_unweighted_fst_la_LIBADD) $(LIBS)\n\ncompact16_unweighted_acceptor-fst.la: $(compact16_unweighted_acceptor_fst_la_OBJECTS) $(compact16_unweighted_acceptor_fst_la_DEPENDENCIES) $(EXTRA_compact16_unweighted_acceptor_fst_la_DEPENDENCIES) \n\t$(AM_V_CXXLD)$(compact16_unweighted_acceptor_fst_la_LINK) -rpath $(libfstdir) $(compact16_unweighted_acceptor_fst_la_OBJECTS) $(compact16_unweighted_acceptor_fst_la_LIBADD) $(LIBS)\n\ncompact16_weighted_string-fst.la: $(compact16_weighted_string_fst_la_OBJECTS) $(compact16_weighted_string_fst_la_DEPENDENCIES) $(EXTRA_compact16_weighted_string_fst_la_DEPENDENCIES) \n\t$(AM_V_CXXLD)$(compact16_weighted_string_fst_la_LINK) -rpath $(libfstdir) $(compact16_weighted_string_fst_la_OBJECTS) $(compact16_weighted_string_fst_la_LIBADD) $(LIBS)\n\ncompact64_acceptor-fst.la: $(compact64_acceptor_fst_la_OBJECTS) $(compact64_acceptor_fst_la_DEPENDENCIES) $(EXTRA_compact64_acceptor_fst_la_DEPENDENCIES) \n\t$(AM_V_CXXLD)$(compact64_acceptor_fst_la_LINK) -rpath $(libfstdir) $(compact64_acceptor_fst_la_OBJECTS) $(compact64_acceptor_fst_la_LIBADD) $(LIBS)\n\ncompact64_string-fst.la: $(compact64_string_fst_la_OBJECTS) $(compact64_string_fst_la_DEPENDENCIES) $(EXTRA_compact64_string_fst_la_DEPENDENCIES) \n\t$(AM_V_CXXLD)$(compact64_string_fst_la_LINK) -rpath $(libfstdir) $(compact64_string_fst_la_OBJECTS) $(compact64_string_fst_la_LIBADD) $(LIBS)\n\ncompact64_unweighted-fst.la: $(compact64_unweighted_fst_la_OBJECTS) $(compact64_unweighted_fst_la_DEPENDENCIES) $(EXTRA_compact64_unweighted_fst_la_DEPENDENCIES) \n\t$(AM_V_CXXLD)$(compact64_unweighted_fst_la_LINK) -rpath $(libfstdir) $(compact64_unweighted_fst_la_OBJECTS) $(compact64_unweighted_fst_la_LIBADD) $(LIBS)\n\ncompact64_unweighted_acceptor-fst.la: $(compact64_unweighted_acceptor_fst_la_OBJECTS) $(compact64_unweighted_acceptor_fst_la_DEPENDENCIES) $(EXTRA_compact64_unweighted_acceptor_fst_la_DEPENDENCIES) \n\t$(AM_V_CXXLD)$(compact64_unweighted_acceptor_fst_la_LINK) -rpath $(libfstdir) $(compact64_unweighted_acceptor_fst_la_OBJECTS) $(compact64_unweighted_acceptor_fst_la_LIBADD) $(LIBS)\n\ncompact64_weighted_string-fst.la: $(compact64_weighted_string_fst_la_OBJECTS) $(compact64_weighted_string_fst_la_DEPENDENCIES) $(EXTRA_compact64_weighted_string_fst_la_DEPENDENCIES) \n\t$(AM_V_CXXLD)$(compact64_weighted_string_fst_la_LINK) -rpath $(libfstdir) $(compact64_weighted_string_fst_la_OBJECTS) $(compact64_weighted_string_fst_la_LIBADD) $(LIBS)\n\ncompact8_acceptor-fst.la: $(compact8_acceptor_fst_la_OBJECTS) $(compact8_acceptor_fst_la_DEPENDENCIES) $(EXTRA_compact8_acceptor_fst_la_DEPENDENCIES) \n\t$(AM_V_CXXLD)$(compact8_acceptor_fst_la_LINK) -rpath $(libfstdir) $(compact8_acceptor_fst_la_OBJECTS) $(compact8_acceptor_fst_la_LIBADD) $(LIBS)\n\ncompact8_string-fst.la: $(compact8_string_fst_la_OBJECTS) $(compact8_string_fst_la_DEPENDENCIES) $(EXTRA_compact8_string_fst_la_DEPENDENCIES) \n\t$(AM_V_CXXLD)$(compact8_string_fst_la_LINK) -rpath $(libfstdir) $(compact8_string_fst_la_OBJECTS) $(compact8_string_fst_la_LIBADD) $(LIBS)\n\ncompact8_unweighted-fst.la: $(compact8_unweighted_fst_la_OBJECTS) $(compact8_unweighted_fst_la_DEPENDENCIES) $(EXTRA_compact8_unweighted_fst_la_DEPENDENCIES) \n\t$(AM_V_CXXLD)$(compact8_unweighted_fst_la_LINK) -rpath $(libfstdir) $(compact8_unweighted_fst_la_OBJECTS) $(compact8_unweighted_fst_la_LIBADD) $(LIBS)\n\ncompact8_unweighted_acceptor-fst.la: $(compact8_unweighted_acceptor_fst_la_OBJECTS) $(compact8_unweighted_acceptor_fst_la_DEPENDENCIES) $(EXTRA_compact8_unweighted_acceptor_fst_la_DEPENDENCIES) \n\t$(AM_V_CXXLD)$(compact8_unweighted_acceptor_fst_la_LINK) -rpath $(libfstdir) $(compact8_unweighted_acceptor_fst_la_OBJECTS) $(compact8_unweighted_acceptor_fst_la_LIBADD) $(LIBS)\n\ncompact8_weighted_string-fst.la: $(compact8_weighted_string_fst_la_OBJECTS) $(compact8_weighted_string_fst_la_DEPENDENCIES) $(EXTRA_compact8_weighted_string_fst_la_DEPENDENCIES) \n\t$(AM_V_CXXLD)$(compact8_weighted_string_fst_la_LINK) -rpath $(libfstdir) $(compact8_weighted_string_fst_la_OBJECTS) $(compact8_weighted_string_fst_la_LIBADD) $(LIBS)\n\nlibfstcompact.la: $(libfstcompact_la_OBJECTS) $(libfstcompact_la_DEPENDENCIES) $(EXTRA_libfstcompact_la_DEPENDENCIES) \n\t$(AM_V_CXXLD)$(libfstcompact_la_LINK) -rpath $(libdir) $(libfstcompact_la_OBJECTS) $(libfstcompact_la_LIBADD) $(LIBS)\n\nmostlyclean-compile:\n\t-rm -f *.$(OBJEXT)\n\ndistclean-compile:\n\t-rm -f *.tab.c\n\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/compact16_acceptor-fst.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/compact16_string-fst.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/compact16_unweighted-fst.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/compact16_unweighted_acceptor-fst.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/compact16_weighted_string-fst.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/compact64_acceptor-fst.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/compact64_string-fst.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/compact64_unweighted-fst.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/compact64_unweighted_acceptor-fst.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/compact64_weighted_string-fst.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/compact8_acceptor-fst.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/compact8_string-fst.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/compact8_unweighted-fst.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/compact8_unweighted_acceptor-fst.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/compact8_weighted_string-fst.Plo@am__quote@\n\n.cc.o:\n@am__fastdepCXX_TRUE@\t$(AM_V_CXX)depbase=`echo $@ | sed 's|[^/]*$$|$(DEPDIR)/&|;s|\\.o$$||'`;\\\n@am__fastdepCXX_TRUE@\t$(CXXCOMPILE) -MT $@ -MD -MP -MF $$depbase.Tpo -c -o $@ $< &&\\\n@am__fastdepCXX_TRUE@\t$(am__mv) $$depbase.Tpo $$depbase.Po\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\t$(AM_V_CXX)source='$<' object='$@' libtool=no @AMDEPBACKSLASH@\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\tDEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@\n@am__fastdepCXX_FALSE@\t$(AM_V_CXX@am__nodep@)$(CXXCOMPILE) -c -o $@ $<\n\n.cc.obj:\n@am__fastdepCXX_TRUE@\t$(AM_V_CXX)depbase=`echo $@ | sed 's|[^/]*$$|$(DEPDIR)/&|;s|\\.obj$$||'`;\\\n@am__fastdepCXX_TRUE@\t$(CXXCOMPILE) -MT $@ -MD -MP -MF $$depbase.Tpo -c -o $@ `$(CYGPATH_W) '$<'` &&\\\n@am__fastdepCXX_TRUE@\t$(am__mv) $$depbase.Tpo $$depbase.Po\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\t$(AM_V_CXX)source='$<' object='$@' libtool=no @AMDEPBACKSLASH@\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\tDEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@\n@am__fastdepCXX_FALSE@\t$(AM_V_CXX@am__nodep@)$(CXXCOMPILE) -c -o $@ `$(CYGPATH_W) '$<'`\n\n.cc.lo:\n@am__fastdepCXX_TRUE@\t$(AM_V_CXX)depbase=`echo $@ | sed 's|[^/]*$$|$(DEPDIR)/&|;s|\\.lo$$||'`;\\\n@am__fastdepCXX_TRUE@\t$(LTCXXCOMPILE) -MT $@ -MD -MP -MF $$depbase.Tpo -c -o $@ $< &&\\\n@am__fastdepCXX_TRUE@\t$(am__mv) $$depbase.Tpo $$depbase.Plo\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\t$(AM_V_CXX)source='$<' object='$@' libtool=yes @AMDEPBACKSLASH@\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\tDEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@\n@am__fastdepCXX_FALSE@\t$(AM_V_CXX@am__nodep@)$(LTCXXCOMPILE) -c -o $@ $<\n\nmostlyclean-libtool:\n\t-rm -f *.lo\n\nclean-libtool:\n\t-rm -rf .libs _libs\n\nID: $(am__tagged_files)\n\t$(am__define_uniq_tagged_files); mkid -fID $$unique\ntags: tags-am\nTAGS: tags\n\ntags-am: $(TAGS_DEPENDENCIES) $(am__tagged_files)\n\tset x; \\\n\there=`pwd`; \\\n\t$(am__define_uniq_tagged_files); \\\n\tshift; \\\n\tif test -z \"$(ETAGS_ARGS)$$*$$unique\"; then :; else \\\n\t  test -n \"$$unique\" || unique=$$empty_fix; \\\n\t  if test $$# -gt 0; then \\\n\t    $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \\\n\t      \"$$@\" $$unique; \\\n\t  else \\\n\t    $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \\\n\t      $$unique; \\\n\t  fi; \\\n\tfi\nctags: ctags-am\n\nCTAGS: ctags\nctags-am: $(TAGS_DEPENDENCIES) $(am__tagged_files)\n\t$(am__define_uniq_tagged_files); \\\n\ttest -z \"$(CTAGS_ARGS)$$unique\" \\\n\t  || $(CTAGS) $(CTAGSFLAGS) $(AM_CTAGSFLAGS) $(CTAGS_ARGS) \\\n\t     $$unique\n\nGTAGS:\n\there=`$(am__cd) $(top_builddir) && pwd` \\\n\t  && $(am__cd) $(top_srcdir) \\\n\t  && gtags -i $(GTAGS_ARGS) \"$$here\"\ncscopelist: cscopelist-am\n\ncscopelist-am: $(am__tagged_files)\n\tlist='$(am__tagged_files)'; \\\n\tcase \"$(srcdir)\" in \\\n\t  [\\\\/]* | ?:[\\\\/]*) sdir=\"$(srcdir)\" ;; \\\n\t  *) sdir=$(subdir)/$(srcdir) ;; \\\n\tesac; \\\n\tfor i in $$list; do \\\n\t  if test -f \"$$i\"; then \\\n\t    echo \"$(subdir)/$$i\"; \\\n\t  else \\\n\t    echo \"$$sdir/$$i\"; \\\n\t  fi; \\\n\tdone >> $(top_builddir)/cscope.files\n\ndistclean-tags:\n\t-rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags\n\ndistdir: $(DISTFILES)\n\t@srcdirstrip=`echo \"$(srcdir)\" | sed 's/[].[^$$\\\\*]/\\\\\\\\&/g'`; \\\n\ttopsrcdirstrip=`echo \"$(top_srcdir)\" | sed 's/[].[^$$\\\\*]/\\\\\\\\&/g'`; \\\n\tlist='$(DISTFILES)'; \\\n\t  dist_files=`for file in $$list; do echo $$file; done | \\\n\t  sed -e \"s|^$$srcdirstrip/||;t\" \\\n\t      -e \"s|^$$topsrcdirstrip/|$(top_builddir)/|;t\"`; \\\n\tcase $$dist_files in \\\n\t  */*) $(MKDIR_P) `echo \"$$dist_files\" | \\\n\t\t\t   sed '/\\//!d;s|^|$(distdir)/|;s,/[^/]*$$,,' | \\\n\t\t\t   sort -u` ;; \\\n\tesac; \\\n\tfor file in $$dist_files; do \\\n\t  if test -f $$file || test -d $$file; then d=.; else d=$(srcdir); fi; \\\n\t  if test -d $$d/$$file; then \\\n\t    dir=`echo \"/$$file\" | sed -e 's,/[^/]*$$,,'`; \\\n\t    if test -d \"$(distdir)/$$file\"; then \\\n\t      find \"$(distdir)/$$file\" -type d ! -perm -700 -exec chmod u+rwx {} \\;; \\\n\t    fi; \\\n\t    if test -d $(srcdir)/$$file && test $$d != $(srcdir); then \\\n\t      cp -fpR $(srcdir)/$$file \"$(distdir)$$dir\" || exit 1; \\\n\t      find \"$(distdir)/$$file\" -type d ! -perm -700 -exec chmod u+rwx {} \\;; \\\n\t    fi; \\\n\t    cp -fpR $$d/$$file \"$(distdir)$$dir\" || exit 1; \\\n\t  else \\\n\t    test -f \"$(distdir)/$$file\" \\\n\t    || cp -p $$d/$$file \"$(distdir)/$$file\" \\\n\t    || exit 1; \\\n\t  fi; \\\n\tdone\ncheck-am: all-am\ncheck: check-am\nall-am: Makefile $(LTLIBRARIES)\ninstalldirs:\n\tfor dir in \"$(DESTDIR)$(libdir)\" \"$(DESTDIR)$(libfstdir)\"; do \\\n\t  test -z \"$$dir\" || $(MKDIR_P) \"$$dir\"; \\\n\tdone\ninstall: install-am\ninstall-exec: install-exec-am\ninstall-data: install-data-am\nuninstall: uninstall-am\n\ninstall-am: all-am\n\t@$(MAKE) $(AM_MAKEFLAGS) install-exec-am install-data-am\n\ninstallcheck: installcheck-am\ninstall-strip:\n\tif test -z '$(STRIP)'; then \\\n\t  $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" \\\n\t    install_sh_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" INSTALL_STRIP_FLAG=-s \\\n\t      install; \\\n\telse \\\n\t  $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" \\\n\t    install_sh_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" INSTALL_STRIP_FLAG=-s \\\n\t    \"INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'\" install; \\\n\tfi\nmostlyclean-generic:\n\nclean-generic:\n\ndistclean-generic:\n\t-test -z \"$(CONFIG_CLEAN_FILES)\" || rm -f $(CONFIG_CLEAN_FILES)\n\t-test . = \"$(srcdir)\" || test -z \"$(CONFIG_CLEAN_VPATH_FILES)\" || rm -f $(CONFIG_CLEAN_VPATH_FILES)\n\nmaintainer-clean-generic:\n\t@echo \"This command is intended for maintainers to use\"\n\t@echo \"it deletes files that may require special tools to rebuild.\"\nclean: clean-am\n\nclean-am: clean-generic clean-libLTLIBRARIES clean-libfstLTLIBRARIES \\\n\tclean-libtool mostlyclean-am\n\ndistclean: distclean-am\n\t-rm -rf ./$(DEPDIR)\n\t-rm -f Makefile\ndistclean-am: clean-am distclean-compile distclean-generic \\\n\tdistclean-tags\n\ndvi: dvi-am\n\ndvi-am:\n\nhtml: html-am\n\nhtml-am:\n\ninfo: info-am\n\ninfo-am:\n\ninstall-data-am: install-libfstLTLIBRARIES\n\ninstall-dvi: install-dvi-am\n\ninstall-dvi-am:\n\ninstall-exec-am: install-libLTLIBRARIES\n\ninstall-html: install-html-am\n\ninstall-html-am:\n\ninstall-info: install-info-am\n\ninstall-info-am:\n\ninstall-man:\n\ninstall-pdf: install-pdf-am\n\ninstall-pdf-am:\n\ninstall-ps: install-ps-am\n\ninstall-ps-am:\n\ninstallcheck-am:\n\nmaintainer-clean: maintainer-clean-am\n\t-rm -rf ./$(DEPDIR)\n\t-rm -f Makefile\nmaintainer-clean-am: distclean-am maintainer-clean-generic\n\nmostlyclean: mostlyclean-am\n\nmostlyclean-am: mostlyclean-compile mostlyclean-generic \\\n\tmostlyclean-libtool\n\npdf: pdf-am\n\npdf-am:\n\nps: ps-am\n\nps-am:\n\nuninstall-am: uninstall-libLTLIBRARIES uninstall-libfstLTLIBRARIES\n\n.MAKE: install-am install-strip\n\n.PHONY: CTAGS GTAGS TAGS all all-am check check-am clean clean-generic \\\n\tclean-libLTLIBRARIES clean-libfstLTLIBRARIES clean-libtool \\\n\tcscopelist-am ctags ctags-am distclean distclean-compile \\\n\tdistclean-generic distclean-libtool distclean-tags distdir dvi \\\n\tdvi-am html html-am info info-am install install-am \\\n\tinstall-data install-data-am install-dvi install-dvi-am \\\n\tinstall-exec install-exec-am install-html install-html-am \\\n\tinstall-info install-info-am install-libLTLIBRARIES \\\n\tinstall-libfstLTLIBRARIES install-man install-pdf \\\n\tinstall-pdf-am install-ps install-ps-am install-strip \\\n\tinstallcheck installcheck-am installdirs maintainer-clean \\\n\tmaintainer-clean-generic mostlyclean mostlyclean-compile \\\n\tmostlyclean-generic mostlyclean-libtool pdf pdf-am ps ps-am \\\n\ttags tags-am uninstall uninstall-am uninstall-libLTLIBRARIES \\\n\tuninstall-libfstLTLIBRARIES\n\n\n# Tell versions [3.59,3.63) of GNU make to not export all variables.\n# Otherwise a system limit (for SysV at least) may be exceeded.\n.NOEXPORT:\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/extensions/compact/compact16_acceptor-fst.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/fst.h>\n#include <fst/compact-fst.h>\n\nnamespace fst {\n\nstatic FstRegisterer<CompactAcceptorFst<StdArc, uint16>>\n    CompactAcceptorFst_StdArc_uint16_registerer;\nstatic FstRegisterer<CompactAcceptorFst<LogArc, uint16>>\n    CompactAcceptorFst_LogArc_uint16_registerer;\n\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/extensions/compact/compact16_string-fst.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/fst.h>\n#include <fst/compact-fst.h>\n\nnamespace fst {\n\nstatic FstRegisterer<CompactStringFst<StdArc, uint16>>\n    CompactStringFst_StdArc_uint16_registerer;\nstatic FstRegisterer<CompactStringFst<LogArc, uint16>>\n    CompactStringFst_LogArc_uint16_registerer;\n\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/extensions/compact/compact16_unweighted-fst.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/fst.h>\n#include <fst/compact-fst.h>\n\nnamespace fst {\n\nstatic FstRegisterer<CompactUnweightedFst<StdArc, uint16>>\n    CompactUnweightedFst_StdArc_uint16_registerer;\nstatic FstRegisterer<CompactUnweightedFst<LogArc, uint16>>\n    CompactUnweightedFst_LogArc_uint16_registerer;\n\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/extensions/compact/compact16_unweighted_acceptor-fst.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/fst.h>\n#include <fst/compact-fst.h>\n\nnamespace fst {\n\nstatic FstRegisterer<\n    CompactUnweightedAcceptorFst<StdArc, uint16>>\n    CompactUnweightedAcceptorFst_StdArc_uint16_registerer;\nstatic FstRegisterer<\n    CompactUnweightedAcceptorFst<LogArc, uint16>>\n    CompactUnweightedAcceptorFst_LogArc_uint16_registerer;\n\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/extensions/compact/compact16_weighted_string-fst.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/fst.h>\n#include <fst/compact-fst.h>\n\nnamespace fst {\n\nstatic FstRegisterer<\n    CompactWeightedStringFst<StdArc, uint16>>\n    CompactWeightedStringFst_StdArc_uint16_registerer;\n\nstatic FstRegisterer<\n    CompactWeightedStringFst<LogArc, uint16>>\n    CompactWeightedStringFst_LogArc_uint16_registerer;\n\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/extensions/compact/compact64_acceptor-fst.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/fst.h>\n#include <fst/compact-fst.h>\n\nnamespace fst {\n\nstatic FstRegisterer<CompactAcceptorFst<StdArc, uint64>>\n    CompactAcceptorFst_StdArc_uint64_registerer;\n\nstatic FstRegisterer<CompactAcceptorFst<LogArc, uint64>>\n    CompactAcceptorFst_LogArc_uint64_registerer;\n\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/extensions/compact/compact64_string-fst.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/fst.h>\n#include <fst/compact-fst.h>\n\nnamespace fst {\n\nstatic FstRegisterer<CompactStringFst<StdArc, uint64>>\n    CompactStringFst_StdArc_uint64_registerer;\nstatic FstRegisterer<CompactStringFst<LogArc, uint64>>\n    CompactStringFst_LogArc_uint64_registerer;\n\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/extensions/compact/compact64_unweighted-fst.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/fst.h>\n#include <fst/compact-fst.h>\n\nnamespace fst {\n\nstatic FstRegisterer<CompactUnweightedFst<StdArc, uint64>>\n    CompactUnweightedFst_StdArc_uint64_registerer;\nstatic FstRegisterer<CompactUnweightedFst<LogArc, uint64>>\n    CompactUnweightedFst_LogArc_uint64_registerer;\n\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/extensions/compact/compact64_unweighted_acceptor-fst.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/fst.h>\n#include <fst/compact-fst.h>\n\nnamespace fst {\n\nstatic FstRegisterer<\n    CompactUnweightedAcceptorFst<StdArc, uint64>>\n    CompactUnweightedAcceptorFst_StdArc_uint64_registerer;\nstatic FstRegisterer<\n    CompactUnweightedAcceptorFst<LogArc, uint64>>\n    CompactUnweightedAcceptorFst_LogArc_uint64_registerer;\n\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/extensions/compact/compact64_weighted_string-fst.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/fst.h>\n#include <fst/compact-fst.h>\n\nnamespace fst {\n\nstatic FstRegisterer<\n    CompactWeightedStringFst<StdArc, uint64>>\n    CompactWeightedStringFst_StdArc_uint64_registerer;\nstatic FstRegisterer<\n    CompactWeightedStringFst<LogArc, uint64>>\n    CompactWeightedStringFst_LogArc_uint64_registerer;\n\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/extensions/compact/compact8_acceptor-fst.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/fst.h>\n#include <fst/compact-fst.h>\n\nnamespace fst {\n\nstatic FstRegisterer<CompactAcceptorFst<StdArc, uint8>>\n    CompactAcceptorFst_StdArc_uint8_registerer;\nstatic FstRegisterer<CompactAcceptorFst<LogArc, uint8>>\n    CompactAcceptorFst_LogArc_uint8_registerer;\n\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/extensions/compact/compact8_string-fst.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/fst.h>\n#include <fst/compact-fst.h>\n\nnamespace fst {\n\nstatic FstRegisterer<CompactStringFst<StdArc, uint8>>\n    CompactStringFst_StdArc_uint8_registerer;\nstatic FstRegisterer<CompactStringFst<LogArc, uint8>>\n    CompactStringFst_LogArc_uint8_registerer;\n\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/extensions/compact/compact8_unweighted-fst.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/fst.h>\n#include <fst/compact-fst.h>\n\nnamespace fst {\n\nstatic FstRegisterer<CompactUnweightedFst<StdArc, uint8>>\n    CompactUnweightedFst_StdArc_uint8_registerer;\nstatic FstRegisterer<CompactUnweightedFst<LogArc, uint8>>\n    CompactUnweightedFst_LogArc_uint8_registerer;\n\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/extensions/compact/compact8_unweighted_acceptor-fst.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/fst.h>\n#include <fst/compact-fst.h>\n\nnamespace fst {\n\nstatic FstRegisterer<\n    CompactUnweightedAcceptorFst<StdArc, uint8>>\n    CompactUnweightedAcceptorFst_StdArc_uint8_registerer;\nstatic FstRegisterer<\n    CompactUnweightedAcceptorFst<LogArc, uint8>>\n    CompactUnweightedAcceptorFst_LogArc_uint8_registerer;\n\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/extensions/compact/compact8_weighted_string-fst.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/fst.h>\n#include <fst/compact-fst.h>\n\nnamespace fst {\n\nstatic FstRegisterer<\n    CompactWeightedStringFst<StdArc, uint8>>\n    CompactWeightedStringFst_StdArc_uint8_registerer;\nstatic FstRegisterer<\n    CompactWeightedStringFst<LogArc, uint8>>\n    CompactWeightedStringFst_LogArc_uint8_registerer;\n\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/extensions/compress/Makefile.am",
    "content": "AM_CPPFLAGS = -I$(srcdir)/../../include $(ICU_CPPFLAGS)\n\nif HAVE_BIN\nbin_PROGRAMS = fstcompress fstrandmod\n\nLDADD = libfstcompressscript.la \\\n        ../../script/libfstscript.la \\\n        ../../lib/libfst.la \\\n        -lm $(DL_LIBS)\n\nfstcompress_SOURCES = fstcompress.cc\nfstrandmod_SOURCES = fstrandmod.cc\nendif\n\nif HAVE_SCRIPT\nlibfstcompressscript_la_SOURCES = compress-script.cc\nlibfstcompressscript_la_LDFLAGS = -version-info 10:0:0\nlibfstcompressscript_la_LIBADD = \\\n        ../../script/libfstscript.la \\\n        ../../lib/libfst.la -lz -lm $(DL_LIBS)\nendif\n\nif HAVE_SCRIPT\nlib_LTLIBRARIES = libfstcompressscript.la\nendif\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/extensions/compress/Makefile.in",
    "content": "# Makefile.in generated by automake 1.14.1 from Makefile.am.\n# @configure_input@\n\n# Copyright (C) 1994-2013 Free Software Foundation, Inc.\n\n# This Makefile.in is free software; the Free Software Foundation\n# gives unlimited permission to copy and/or distribute it,\n# with or without modifications, as long as this notice is preserved.\n\n# This program is distributed in the hope that it will be useful,\n# but WITHOUT ANY WARRANTY, to the extent permitted by law; without\n# even the implied warranty of MERCHANTABILITY or FITNESS FOR A\n# PARTICULAR PURPOSE.\n\n@SET_MAKE@\n\n\nVPATH = @srcdir@\nam__is_gnu_make = test -n '$(MAKEFILE_LIST)' && test -n '$(MAKELEVEL)'\nam__make_running_with_option = \\\n  case $${target_option-} in \\\n      ?) ;; \\\n      *) echo \"am__make_running_with_option: internal error: invalid\" \\\n              \"target option '$${target_option-}' specified\" >&2; \\\n         exit 1;; \\\n  esac; \\\n  has_opt=no; \\\n  sane_makeflags=$$MAKEFLAGS; \\\n  if $(am__is_gnu_make); then \\\n    sane_makeflags=$$MFLAGS; \\\n  else \\\n    case $$MAKEFLAGS in \\\n      *\\\\[\\ \\\t]*) \\\n        bs=\\\\; \\\n        sane_makeflags=`printf '%s\\n' \"$$MAKEFLAGS\" \\\n          | sed \"s/$$bs$$bs[$$bs $$bs\t]*//g\"`;; \\\n    esac; \\\n  fi; \\\n  skip_next=no; \\\n  strip_trailopt () \\\n  { \\\n    flg=`printf '%s\\n' \"$$flg\" | sed \"s/$$1.*$$//\"`; \\\n  }; \\\n  for flg in $$sane_makeflags; do \\\n    test $$skip_next = yes && { skip_next=no; continue; }; \\\n    case $$flg in \\\n      *=*|--*) continue;; \\\n        -*I) strip_trailopt 'I'; skip_next=yes;; \\\n      -*I?*) strip_trailopt 'I';; \\\n        -*O) strip_trailopt 'O'; skip_next=yes;; \\\n      -*O?*) strip_trailopt 'O';; \\\n        -*l) strip_trailopt 'l'; skip_next=yes;; \\\n      -*l?*) strip_trailopt 'l';; \\\n      -[dEDm]) skip_next=yes;; \\\n      -[JT]) skip_next=yes;; \\\n    esac; \\\n    case $$flg in \\\n      *$$target_option*) has_opt=yes; break;; \\\n    esac; \\\n  done; \\\n  test $$has_opt = yes\nam__make_dryrun = (target_option=n; $(am__make_running_with_option))\nam__make_keepgoing = (target_option=k; $(am__make_running_with_option))\npkgdatadir = $(datadir)/@PACKAGE@\npkgincludedir = $(includedir)/@PACKAGE@\npkglibdir = $(libdir)/@PACKAGE@\npkglibexecdir = $(libexecdir)/@PACKAGE@\nam__cd = CDPATH=\"$${ZSH_VERSION+.}$(PATH_SEPARATOR)\" && cd\ninstall_sh_DATA = $(install_sh) -c -m 644\ninstall_sh_PROGRAM = $(install_sh) -c\ninstall_sh_SCRIPT = $(install_sh) -c\nINSTALL_HEADER = $(INSTALL_DATA)\ntransform = $(program_transform_name)\nNORMAL_INSTALL = :\nPRE_INSTALL = :\nPOST_INSTALL = :\nNORMAL_UNINSTALL = :\nPRE_UNINSTALL = :\nPOST_UNINSTALL = :\nbuild_triplet = @build@\nhost_triplet = @host@\n@HAVE_BIN_TRUE@bin_PROGRAMS = fstcompress$(EXEEXT) fstrandmod$(EXEEXT)\nsubdir = src/extensions/compress\nDIST_COMMON = $(srcdir)/Makefile.in $(srcdir)/Makefile.am \\\n\t$(top_srcdir)/depcomp\nACLOCAL_M4 = $(top_srcdir)/aclocal.m4\nam__aclocal_m4_deps = $(top_srcdir)/m4/ac_python_devel.m4 \\\n\t$(top_srcdir)/m4/libtool.m4 $(top_srcdir)/m4/ltoptions.m4 \\\n\t$(top_srcdir)/m4/ltsugar.m4 $(top_srcdir)/m4/ltversion.m4 \\\n\t$(top_srcdir)/m4/lt~obsolete.m4 $(top_srcdir)/configure.ac\nam__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \\\n\t$(ACLOCAL_M4)\nmkinstalldirs = $(install_sh) -d\nCONFIG_HEADER = $(top_builddir)/config.h \\\n\t$(top_builddir)/src/include/fst/config.h\nCONFIG_CLEAN_FILES =\nCONFIG_CLEAN_VPATH_FILES =\nam__vpath_adj_setup = srcdirstrip=`echo \"$(srcdir)\" | sed 's|.|.|g'`;\nam__vpath_adj = case $$p in \\\n    $(srcdir)/*) f=`echo \"$$p\" | sed \"s|^$$srcdirstrip/||\"`;; \\\n    *) f=$$p;; \\\n  esac;\nam__strip_dir = f=`echo $$p | sed -e 's|^.*/||'`;\nam__install_max = 40\nam__nobase_strip_setup = \\\n  srcdirstrip=`echo \"$(srcdir)\" | sed 's/[].[^$$\\\\*|]/\\\\\\\\&/g'`\nam__nobase_strip = \\\n  for p in $$list; do echo \"$$p\"; done | sed -e \"s|$$srcdirstrip/||\"\nam__nobase_list = $(am__nobase_strip_setup); \\\n  for p in $$list; do echo \"$$p $$p\"; done | \\\n  sed \"s| $$srcdirstrip/| |;\"' / .*\\//!s/ .*/ ./; s,\\( .*\\)/[^/]*$$,\\1,' | \\\n  $(AWK) 'BEGIN { files[\".\"] = \"\" } { files[$$2] = files[$$2] \" \" $$1; \\\n    if (++n[$$2] == $(am__install_max)) \\\n      { print $$2, files[$$2]; n[$$2] = 0; files[$$2] = \"\" } } \\\n    END { for (dir in files) print dir, files[dir] }'\nam__base_list = \\\n  sed '$$!N;$$!N;$$!N;$$!N;$$!N;$$!N;$$!N;s/\\n/ /g' | \\\n  sed '$$!N;$$!N;$$!N;$$!N;s/\\n/ /g'\nam__uninstall_files_from_dir = { \\\n  test -z \"$$files\" \\\n    || { test ! -d \"$$dir\" && test ! -f \"$$dir\" && test ! -r \"$$dir\"; } \\\n    || { echo \" ( cd '$$dir' && rm -f\" $$files \")\"; \\\n         $(am__cd) \"$$dir\" && rm -f $$files; }; \\\n  }\nam__installdirs = \"$(DESTDIR)$(libdir)\" \"$(DESTDIR)$(bindir)\"\nLTLIBRARIES = $(lib_LTLIBRARIES)\nam__DEPENDENCIES_1 =\n@HAVE_SCRIPT_TRUE@libfstcompressscript_la_DEPENDENCIES =  \\\n@HAVE_SCRIPT_TRUE@\t../../script/libfstscript.la \\\n@HAVE_SCRIPT_TRUE@\t../../lib/libfst.la $(am__DEPENDENCIES_1)\nam__libfstcompressscript_la_SOURCES_DIST = compress-script.cc\n@HAVE_SCRIPT_TRUE@am_libfstcompressscript_la_OBJECTS =  \\\n@HAVE_SCRIPT_TRUE@\tcompress-script.lo\nlibfstcompressscript_la_OBJECTS =  \\\n\t$(am_libfstcompressscript_la_OBJECTS)\nAM_V_lt = $(am__v_lt_@AM_V@)\nam__v_lt_ = $(am__v_lt_@AM_DEFAULT_V@)\nam__v_lt_0 = --silent\nam__v_lt_1 = \nlibfstcompressscript_la_LINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX \\\n\t$(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=link $(CXXLD) \\\n\t$(AM_CXXFLAGS) $(CXXFLAGS) $(libfstcompressscript_la_LDFLAGS) \\\n\t$(LDFLAGS) -o $@\n@HAVE_SCRIPT_TRUE@am_libfstcompressscript_la_rpath = -rpath $(libdir)\nPROGRAMS = $(bin_PROGRAMS)\nam__fstcompress_SOURCES_DIST = fstcompress.cc\n@HAVE_BIN_TRUE@am_fstcompress_OBJECTS = fstcompress.$(OBJEXT)\nfstcompress_OBJECTS = $(am_fstcompress_OBJECTS)\nfstcompress_LDADD = $(LDADD)\n@HAVE_BIN_TRUE@fstcompress_DEPENDENCIES = libfstcompressscript.la \\\n@HAVE_BIN_TRUE@\t../../script/libfstscript.la \\\n@HAVE_BIN_TRUE@\t../../lib/libfst.la $(am__DEPENDENCIES_1)\nam__fstrandmod_SOURCES_DIST = fstrandmod.cc\n@HAVE_BIN_TRUE@am_fstrandmod_OBJECTS = fstrandmod.$(OBJEXT)\nfstrandmod_OBJECTS = $(am_fstrandmod_OBJECTS)\nfstrandmod_LDADD = $(LDADD)\n@HAVE_BIN_TRUE@fstrandmod_DEPENDENCIES = libfstcompressscript.la \\\n@HAVE_BIN_TRUE@\t../../script/libfstscript.la \\\n@HAVE_BIN_TRUE@\t../../lib/libfst.la $(am__DEPENDENCIES_1)\nAM_V_P = $(am__v_P_@AM_V@)\nam__v_P_ = $(am__v_P_@AM_DEFAULT_V@)\nam__v_P_0 = false\nam__v_P_1 = :\nAM_V_GEN = $(am__v_GEN_@AM_V@)\nam__v_GEN_ = $(am__v_GEN_@AM_DEFAULT_V@)\nam__v_GEN_0 = @echo \"  GEN     \" $@;\nam__v_GEN_1 = \nAM_V_at = $(am__v_at_@AM_V@)\nam__v_at_ = $(am__v_at_@AM_DEFAULT_V@)\nam__v_at_0 = @\nam__v_at_1 = \nDEFAULT_INCLUDES = \ndepcomp = $(SHELL) $(top_srcdir)/depcomp\nam__depfiles_maybe = depfiles\nam__mv = mv -f\nCXXCOMPILE = $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) \\\n\t$(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS)\nLTCXXCOMPILE = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \\\n\t$(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) \\\n\t$(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) \\\n\t$(AM_CXXFLAGS) $(CXXFLAGS)\nAM_V_CXX = $(am__v_CXX_@AM_V@)\nam__v_CXX_ = $(am__v_CXX_@AM_DEFAULT_V@)\nam__v_CXX_0 = @echo \"  CXX     \" $@;\nam__v_CXX_1 = \nCXXLD = $(CXX)\nCXXLINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \\\n\t$(LIBTOOLFLAGS) --mode=link $(CXXLD) $(AM_CXXFLAGS) \\\n\t$(CXXFLAGS) $(AM_LDFLAGS) $(LDFLAGS) -o $@\nAM_V_CXXLD = $(am__v_CXXLD_@AM_V@)\nam__v_CXXLD_ = $(am__v_CXXLD_@AM_DEFAULT_V@)\nam__v_CXXLD_0 = @echo \"  CXXLD   \" $@;\nam__v_CXXLD_1 = \nSOURCES = $(libfstcompressscript_la_SOURCES) $(fstcompress_SOURCES) \\\n\t$(fstrandmod_SOURCES)\nDIST_SOURCES = $(am__libfstcompressscript_la_SOURCES_DIST) \\\n\t$(am__fstcompress_SOURCES_DIST) $(am__fstrandmod_SOURCES_DIST)\nam__can_run_installinfo = \\\n  case $$AM_UPDATE_INFO_DIR in \\\n    n|no|NO) false;; \\\n    *) (install-info --version) >/dev/null 2>&1;; \\\n  esac\nam__tagged_files = $(HEADERS) $(SOURCES) $(TAGS_FILES) $(LISP)\n# Read a list of newline-separated strings from the standard input,\n# and print each of them once, without duplicates.  Input order is\n# *not* preserved.\nam__uniquify_input = $(AWK) '\\\n  BEGIN { nonempty = 0; } \\\n  { items[$$0] = 1; nonempty = 1; } \\\n  END { if (nonempty) { for (i in items) print i; }; } \\\n'\n# Make sure the list of sources is unique.  This is necessary because,\n# e.g., the same source file might be shared among _SOURCES variables\n# for different programs/libraries.\nam__define_uniq_tagged_files = \\\n  list='$(am__tagged_files)'; \\\n  unique=`for i in $$list; do \\\n    if test -f \"$$i\"; then echo $$i; else echo $(srcdir)/$$i; fi; \\\n  done | $(am__uniquify_input)`\nETAGS = etags\nCTAGS = ctags\nDISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST)\nACLOCAL = @ACLOCAL@\nAMTAR = @AMTAR@\nAM_DEFAULT_VERBOSITY = @AM_DEFAULT_VERBOSITY@\nAR = @AR@\nAUTOCONF = @AUTOCONF@\nAUTOHEADER = @AUTOHEADER@\nAUTOMAKE = @AUTOMAKE@\nAWK = @AWK@\nCC = @CC@\nCCDEPMODE = @CCDEPMODE@\nCFLAGS = @CFLAGS@\nCPP = @CPP@\nCPPFLAGS = @CPPFLAGS@\nCXX = @CXX@\nCXXCPP = @CXXCPP@\nCXXDEPMODE = @CXXDEPMODE@\nCXXFLAGS = @CXXFLAGS@\nCYGPATH_W = @CYGPATH_W@\nDEFS = @DEFS@\nDEPDIR = @DEPDIR@\nDLLTOOL = @DLLTOOL@\nDL_LIBS = @DL_LIBS@\nDSYMUTIL = @DSYMUTIL@\nDUMPBIN = @DUMPBIN@\nECHO_C = @ECHO_C@\nECHO_N = @ECHO_N@\nECHO_T = @ECHO_T@\nEGREP = @EGREP@\nEXEEXT = @EXEEXT@\nFGREP = @FGREP@\nGREP = @GREP@\nINSTALL = @INSTALL@\nINSTALL_DATA = @INSTALL_DATA@\nINSTALL_PROGRAM = @INSTALL_PROGRAM@\nINSTALL_SCRIPT = @INSTALL_SCRIPT@\nINSTALL_STRIP_PROGRAM = @INSTALL_STRIP_PROGRAM@\nLD = @LD@\nLDFLAGS = @LDFLAGS@\nLIBOBJS = @LIBOBJS@\nLIBS = @LIBS@\nLIBTOOL = @LIBTOOL@\nLIPO = @LIPO@\nLN_S = @LN_S@\nLTLIBOBJS = @LTLIBOBJS@\nMAKEINFO = @MAKEINFO@\nMANIFEST_TOOL = @MANIFEST_TOOL@\nMKDIR_P = @MKDIR_P@\nNM = @NM@\nNMEDIT = @NMEDIT@\nOBJDUMP = @OBJDUMP@\nOBJEXT = @OBJEXT@\nOTOOL = @OTOOL@\nOTOOL64 = @OTOOL64@\nPACKAGE = @PACKAGE@\nPACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@\nPACKAGE_NAME = @PACKAGE_NAME@\nPACKAGE_STRING = @PACKAGE_STRING@\nPACKAGE_TARNAME = @PACKAGE_TARNAME@\nPACKAGE_URL = @PACKAGE_URL@\nPACKAGE_VERSION = @PACKAGE_VERSION@\nPATH_SEPARATOR = @PATH_SEPARATOR@\nPYTHON = @PYTHON@\nPYTHON_CPPFLAGS = @PYTHON_CPPFLAGS@\nPYTHON_EXEC_PREFIX = @PYTHON_EXEC_PREFIX@\nPYTHON_EXTRA_LDFLAGS = @PYTHON_EXTRA_LDFLAGS@\nPYTHON_EXTRA_LIBS = @PYTHON_EXTRA_LIBS@\nPYTHON_LDFLAGS = @PYTHON_LDFLAGS@\nPYTHON_PLATFORM = @PYTHON_PLATFORM@\nPYTHON_PREFIX = @PYTHON_PREFIX@\nPYTHON_SITE_PKG = @PYTHON_SITE_PKG@\nPYTHON_VERSION = @PYTHON_VERSION@\nRANLIB = @RANLIB@\nSED = @SED@\nSET_MAKE = @SET_MAKE@\nSHELL = @SHELL@\nSTRIP = @STRIP@\nVERSION = @VERSION@\nabs_builddir = @abs_builddir@\nabs_srcdir = @abs_srcdir@\nabs_top_builddir = @abs_top_builddir@\nabs_top_srcdir = @abs_top_srcdir@\nac_ct_AR = @ac_ct_AR@\nac_ct_CC = @ac_ct_CC@\nac_ct_CXX = @ac_ct_CXX@\nac_ct_DUMPBIN = @ac_ct_DUMPBIN@\nam__include = @am__include@\nam__leading_dot = @am__leading_dot@\nam__quote = @am__quote@\nam__tar = @am__tar@\nam__untar = @am__untar@\nbindir = @bindir@\nbuild = @build@\nbuild_alias = @build_alias@\nbuild_cpu = @build_cpu@\nbuild_os = @build_os@\nbuild_vendor = @build_vendor@\nbuilddir = @builddir@\ndatadir = @datadir@\ndatarootdir = @datarootdir@\ndocdir = @docdir@\ndvidir = @dvidir@\nexec_prefix = @exec_prefix@\nhost = @host@\nhost_alias = @host_alias@\nhost_cpu = @host_cpu@\nhost_os = @host_os@\nhost_vendor = @host_vendor@\nhtmldir = @htmldir@\nincludedir = @includedir@\ninfodir = @infodir@\ninstall_sh = @install_sh@\nlibdir = @libdir@\nlibexecdir = @libexecdir@\nlibfstdir = @libfstdir@\nlocaledir = @localedir@\nlocalstatedir = @localstatedir@\nmandir = @mandir@\nmkdir_p = @mkdir_p@\noldincludedir = @oldincludedir@\npdfdir = @pdfdir@\npkgpyexecdir = @pkgpyexecdir@\npkgpythondir = @pkgpythondir@\nprefix = @prefix@\nprogram_transform_name = @program_transform_name@\npsdir = @psdir@\npyexecdir = @pyexecdir@\npythondir = @pythondir@\nsbindir = @sbindir@\nsharedstatedir = @sharedstatedir@\nsrcdir = @srcdir@\nsysconfdir = @sysconfdir@\ntarget_alias = @target_alias@\ntop_build_prefix = @top_build_prefix@\ntop_builddir = @top_builddir@\ntop_srcdir = @top_srcdir@\nAM_CPPFLAGS = -I$(srcdir)/../../include $(ICU_CPPFLAGS)\n@HAVE_BIN_TRUE@LDADD = libfstcompressscript.la \\\n@HAVE_BIN_TRUE@        ../../script/libfstscript.la \\\n@HAVE_BIN_TRUE@        ../../lib/libfst.la \\\n@HAVE_BIN_TRUE@        -lm $(DL_LIBS)\n\n@HAVE_BIN_TRUE@fstcompress_SOURCES = fstcompress.cc\n@HAVE_BIN_TRUE@fstrandmod_SOURCES = fstrandmod.cc\n@HAVE_SCRIPT_TRUE@libfstcompressscript_la_SOURCES = compress-script.cc\n@HAVE_SCRIPT_TRUE@libfstcompressscript_la_LDFLAGS = -version-info 10:0:0\n@HAVE_SCRIPT_TRUE@libfstcompressscript_la_LIBADD = \\\n@HAVE_SCRIPT_TRUE@        ../../script/libfstscript.la \\\n@HAVE_SCRIPT_TRUE@        ../../lib/libfst.la -lz -lm $(DL_LIBS)\n\n@HAVE_SCRIPT_TRUE@lib_LTLIBRARIES = libfstcompressscript.la\nall: all-am\n\n.SUFFIXES:\n.SUFFIXES: .cc .lo .o .obj\n$(srcdir)/Makefile.in:  $(srcdir)/Makefile.am  $(am__configure_deps)\n\t@for dep in $?; do \\\n\t  case '$(am__configure_deps)' in \\\n\t    *$$dep*) \\\n\t      ( cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh ) \\\n\t        && { if test -f $@; then exit 0; else break; fi; }; \\\n\t      exit 1;; \\\n\t  esac; \\\n\tdone; \\\n\techo ' cd $(top_srcdir) && $(AUTOMAKE) --foreign src/extensions/compress/Makefile'; \\\n\t$(am__cd) $(top_srcdir) && \\\n\t  $(AUTOMAKE) --foreign src/extensions/compress/Makefile\n.PRECIOUS: Makefile\nMakefile: $(srcdir)/Makefile.in $(top_builddir)/config.status\n\t@case '$?' in \\\n\t  *config.status*) \\\n\t    cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh;; \\\n\t  *) \\\n\t    echo ' cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe)'; \\\n\t    cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe);; \\\n\tesac;\n\n$(top_builddir)/config.status: $(top_srcdir)/configure $(CONFIG_STATUS_DEPENDENCIES)\n\tcd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh\n\n$(top_srcdir)/configure:  $(am__configure_deps)\n\tcd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh\n$(ACLOCAL_M4):  $(am__aclocal_m4_deps)\n\tcd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh\n$(am__aclocal_m4_deps):\n\ninstall-libLTLIBRARIES: $(lib_LTLIBRARIES)\n\t@$(NORMAL_INSTALL)\n\t@list='$(lib_LTLIBRARIES)'; test -n \"$(libdir)\" || list=; \\\n\tlist2=; for p in $$list; do \\\n\t  if test -f $$p; then \\\n\t    list2=\"$$list2 $$p\"; \\\n\t  else :; fi; \\\n\tdone; \\\n\ttest -z \"$$list2\" || { \\\n\t  echo \" $(MKDIR_P) '$(DESTDIR)$(libdir)'\"; \\\n\t  $(MKDIR_P) \"$(DESTDIR)$(libdir)\" || exit 1; \\\n\t  echo \" $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) $$list2 '$(DESTDIR)$(libdir)'\"; \\\n\t  $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) $$list2 \"$(DESTDIR)$(libdir)\"; \\\n\t}\n\nuninstall-libLTLIBRARIES:\n\t@$(NORMAL_UNINSTALL)\n\t@list='$(lib_LTLIBRARIES)'; test -n \"$(libdir)\" || list=; \\\n\tfor p in $$list; do \\\n\t  $(am__strip_dir) \\\n\t  echo \" $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=uninstall rm -f '$(DESTDIR)$(libdir)/$$f'\"; \\\n\t  $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=uninstall rm -f \"$(DESTDIR)$(libdir)/$$f\"; \\\n\tdone\n\nclean-libLTLIBRARIES:\n\t-test -z \"$(lib_LTLIBRARIES)\" || rm -f $(lib_LTLIBRARIES)\n\t@list='$(lib_LTLIBRARIES)'; \\\n\tlocs=`for p in $$list; do echo $$p; done | \\\n\t      sed 's|^[^/]*$$|.|; s|/[^/]*$$||; s|$$|/so_locations|' | \\\n\t      sort -u`; \\\n\ttest -z \"$$locs\" || { \\\n\t  echo rm -f $${locs}; \\\n\t  rm -f $${locs}; \\\n\t}\n\nlibfstcompressscript.la: $(libfstcompressscript_la_OBJECTS) $(libfstcompressscript_la_DEPENDENCIES) $(EXTRA_libfstcompressscript_la_DEPENDENCIES) \n\t$(AM_V_CXXLD)$(libfstcompressscript_la_LINK) $(am_libfstcompressscript_la_rpath) $(libfstcompressscript_la_OBJECTS) $(libfstcompressscript_la_LIBADD) $(LIBS)\ninstall-binPROGRAMS: $(bin_PROGRAMS)\n\t@$(NORMAL_INSTALL)\n\t@list='$(bin_PROGRAMS)'; test -n \"$(bindir)\" || list=; \\\n\tif test -n \"$$list\"; then \\\n\t  echo \" $(MKDIR_P) '$(DESTDIR)$(bindir)'\"; \\\n\t  $(MKDIR_P) \"$(DESTDIR)$(bindir)\" || exit 1; \\\n\tfi; \\\n\tfor p in $$list; do echo \"$$p $$p\"; done | \\\n\tsed 's/$(EXEEXT)$$//' | \\\n\twhile read p p1; do if test -f $$p \\\n\t || test -f $$p1 \\\n\t  ; then echo \"$$p\"; echo \"$$p\"; else :; fi; \\\n\tdone | \\\n\tsed -e 'p;s,.*/,,;n;h' \\\n\t    -e 's|.*|.|' \\\n\t    -e 'p;x;s,.*/,,;s/$(EXEEXT)$$//;$(transform);s/$$/$(EXEEXT)/' | \\\n\tsed 'N;N;N;s,\\n, ,g' | \\\n\t$(AWK) 'BEGIN { files[\".\"] = \"\"; dirs[\".\"] = 1 } \\\n\t  { d=$$3; if (dirs[d] != 1) { print \"d\", d; dirs[d] = 1 } \\\n\t    if ($$2 == $$4) files[d] = files[d] \" \" $$1; \\\n\t    else { print \"f\", $$3 \"/\" $$4, $$1; } } \\\n\t  END { for (d in files) print \"f\", d, files[d] }' | \\\n\twhile read type dir files; do \\\n\t    if test \"$$dir\" = .; then dir=; else dir=/$$dir; fi; \\\n\t    test -z \"$$files\" || { \\\n\t    echo \" $(INSTALL_PROGRAM_ENV) $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL_PROGRAM) $$files '$(DESTDIR)$(bindir)$$dir'\"; \\\n\t    $(INSTALL_PROGRAM_ENV) $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL_PROGRAM) $$files \"$(DESTDIR)$(bindir)$$dir\" || exit $$?; \\\n\t    } \\\n\t; done\n\nuninstall-binPROGRAMS:\n\t@$(NORMAL_UNINSTALL)\n\t@list='$(bin_PROGRAMS)'; test -n \"$(bindir)\" || list=; \\\n\tfiles=`for p in $$list; do echo \"$$p\"; done | \\\n\t  sed -e 'h;s,^.*/,,;s/$(EXEEXT)$$//;$(transform)' \\\n\t      -e 's/$$/$(EXEEXT)/' \\\n\t`; \\\n\ttest -n \"$$list\" || exit 0; \\\n\techo \" ( cd '$(DESTDIR)$(bindir)' && rm -f\" $$files \")\"; \\\n\tcd \"$(DESTDIR)$(bindir)\" && rm -f $$files\n\nclean-binPROGRAMS:\n\t@list='$(bin_PROGRAMS)'; test -n \"$$list\" || exit 0; \\\n\techo \" rm -f\" $$list; \\\n\trm -f $$list || exit $$?; \\\n\ttest -n \"$(EXEEXT)\" || exit 0; \\\n\tlist=`for p in $$list; do echo \"$$p\"; done | sed 's/$(EXEEXT)$$//'`; \\\n\techo \" rm -f\" $$list; \\\n\trm -f $$list\n\nfstcompress$(EXEEXT): $(fstcompress_OBJECTS) $(fstcompress_DEPENDENCIES) $(EXTRA_fstcompress_DEPENDENCIES) \n\t@rm -f fstcompress$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(fstcompress_OBJECTS) $(fstcompress_LDADD) $(LIBS)\n\nfstrandmod$(EXEEXT): $(fstrandmod_OBJECTS) $(fstrandmod_DEPENDENCIES) $(EXTRA_fstrandmod_DEPENDENCIES) \n\t@rm -f fstrandmod$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(fstrandmod_OBJECTS) $(fstrandmod_LDADD) $(LIBS)\n\nmostlyclean-compile:\n\t-rm -f *.$(OBJEXT)\n\ndistclean-compile:\n\t-rm -f *.tab.c\n\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/compress-script.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstcompress.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstrandmod.Po@am__quote@\n\n.cc.o:\n@am__fastdepCXX_TRUE@\t$(AM_V_CXX)depbase=`echo $@ | sed 's|[^/]*$$|$(DEPDIR)/&|;s|\\.o$$||'`;\\\n@am__fastdepCXX_TRUE@\t$(CXXCOMPILE) -MT $@ -MD -MP -MF $$depbase.Tpo -c -o $@ $< &&\\\n@am__fastdepCXX_TRUE@\t$(am__mv) $$depbase.Tpo $$depbase.Po\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\t$(AM_V_CXX)source='$<' object='$@' libtool=no @AMDEPBACKSLASH@\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\tDEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@\n@am__fastdepCXX_FALSE@\t$(AM_V_CXX@am__nodep@)$(CXXCOMPILE) -c -o $@ $<\n\n.cc.obj:\n@am__fastdepCXX_TRUE@\t$(AM_V_CXX)depbase=`echo $@ | sed 's|[^/]*$$|$(DEPDIR)/&|;s|\\.obj$$||'`;\\\n@am__fastdepCXX_TRUE@\t$(CXXCOMPILE) -MT $@ -MD -MP -MF $$depbase.Tpo -c -o $@ `$(CYGPATH_W) '$<'` &&\\\n@am__fastdepCXX_TRUE@\t$(am__mv) $$depbase.Tpo $$depbase.Po\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\t$(AM_V_CXX)source='$<' object='$@' libtool=no @AMDEPBACKSLASH@\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\tDEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@\n@am__fastdepCXX_FALSE@\t$(AM_V_CXX@am__nodep@)$(CXXCOMPILE) -c -o $@ `$(CYGPATH_W) '$<'`\n\n.cc.lo:\n@am__fastdepCXX_TRUE@\t$(AM_V_CXX)depbase=`echo $@ | sed 's|[^/]*$$|$(DEPDIR)/&|;s|\\.lo$$||'`;\\\n@am__fastdepCXX_TRUE@\t$(LTCXXCOMPILE) -MT $@ -MD -MP -MF $$depbase.Tpo -c -o $@ $< &&\\\n@am__fastdepCXX_TRUE@\t$(am__mv) $$depbase.Tpo $$depbase.Plo\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\t$(AM_V_CXX)source='$<' object='$@' libtool=yes @AMDEPBACKSLASH@\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\tDEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@\n@am__fastdepCXX_FALSE@\t$(AM_V_CXX@am__nodep@)$(LTCXXCOMPILE) -c -o $@ $<\n\nmostlyclean-libtool:\n\t-rm -f *.lo\n\nclean-libtool:\n\t-rm -rf .libs _libs\n\nID: $(am__tagged_files)\n\t$(am__define_uniq_tagged_files); mkid -fID $$unique\ntags: tags-am\nTAGS: tags\n\ntags-am: $(TAGS_DEPENDENCIES) $(am__tagged_files)\n\tset x; \\\n\there=`pwd`; \\\n\t$(am__define_uniq_tagged_files); \\\n\tshift; \\\n\tif test -z \"$(ETAGS_ARGS)$$*$$unique\"; then :; else \\\n\t  test -n \"$$unique\" || unique=$$empty_fix; \\\n\t  if test $$# -gt 0; then \\\n\t    $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \\\n\t      \"$$@\" $$unique; \\\n\t  else \\\n\t    $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \\\n\t      $$unique; \\\n\t  fi; \\\n\tfi\nctags: ctags-am\n\nCTAGS: ctags\nctags-am: $(TAGS_DEPENDENCIES) $(am__tagged_files)\n\t$(am__define_uniq_tagged_files); \\\n\ttest -z \"$(CTAGS_ARGS)$$unique\" \\\n\t  || $(CTAGS) $(CTAGSFLAGS) $(AM_CTAGSFLAGS) $(CTAGS_ARGS) \\\n\t     $$unique\n\nGTAGS:\n\there=`$(am__cd) $(top_builddir) && pwd` \\\n\t  && $(am__cd) $(top_srcdir) \\\n\t  && gtags -i $(GTAGS_ARGS) \"$$here\"\ncscopelist: cscopelist-am\n\ncscopelist-am: $(am__tagged_files)\n\tlist='$(am__tagged_files)'; \\\n\tcase \"$(srcdir)\" in \\\n\t  [\\\\/]* | ?:[\\\\/]*) sdir=\"$(srcdir)\" ;; \\\n\t  *) sdir=$(subdir)/$(srcdir) ;; \\\n\tesac; \\\n\tfor i in $$list; do \\\n\t  if test -f \"$$i\"; then \\\n\t    echo \"$(subdir)/$$i\"; \\\n\t  else \\\n\t    echo \"$$sdir/$$i\"; \\\n\t  fi; \\\n\tdone >> $(top_builddir)/cscope.files\n\ndistclean-tags:\n\t-rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags\n\ndistdir: $(DISTFILES)\n\t@srcdirstrip=`echo \"$(srcdir)\" | sed 's/[].[^$$\\\\*]/\\\\\\\\&/g'`; \\\n\ttopsrcdirstrip=`echo \"$(top_srcdir)\" | sed 's/[].[^$$\\\\*]/\\\\\\\\&/g'`; \\\n\tlist='$(DISTFILES)'; \\\n\t  dist_files=`for file in $$list; do echo $$file; done | \\\n\t  sed -e \"s|^$$srcdirstrip/||;t\" \\\n\t      -e \"s|^$$topsrcdirstrip/|$(top_builddir)/|;t\"`; \\\n\tcase $$dist_files in \\\n\t  */*) $(MKDIR_P) `echo \"$$dist_files\" | \\\n\t\t\t   sed '/\\//!d;s|^|$(distdir)/|;s,/[^/]*$$,,' | \\\n\t\t\t   sort -u` ;; \\\n\tesac; \\\n\tfor file in $$dist_files; do \\\n\t  if test -f $$file || test -d $$file; then d=.; else d=$(srcdir); fi; \\\n\t  if test -d $$d/$$file; then \\\n\t    dir=`echo \"/$$file\" | sed -e 's,/[^/]*$$,,'`; \\\n\t    if test -d \"$(distdir)/$$file\"; then \\\n\t      find \"$(distdir)/$$file\" -type d ! -perm -700 -exec chmod u+rwx {} \\;; \\\n\t    fi; \\\n\t    if test -d $(srcdir)/$$file && test $$d != $(srcdir); then \\\n\t      cp -fpR $(srcdir)/$$file \"$(distdir)$$dir\" || exit 1; \\\n\t      find \"$(distdir)/$$file\" -type d ! -perm -700 -exec chmod u+rwx {} \\;; \\\n\t    fi; \\\n\t    cp -fpR $$d/$$file \"$(distdir)$$dir\" || exit 1; \\\n\t  else \\\n\t    test -f \"$(distdir)/$$file\" \\\n\t    || cp -p $$d/$$file \"$(distdir)/$$file\" \\\n\t    || exit 1; \\\n\t  fi; \\\n\tdone\ncheck-am: all-am\ncheck: check-am\nall-am: Makefile $(LTLIBRARIES) $(PROGRAMS)\ninstall-binPROGRAMS: install-libLTLIBRARIES\n\ninstalldirs:\n\tfor dir in \"$(DESTDIR)$(libdir)\" \"$(DESTDIR)$(bindir)\"; do \\\n\t  test -z \"$$dir\" || $(MKDIR_P) \"$$dir\"; \\\n\tdone\ninstall: install-am\ninstall-exec: install-exec-am\ninstall-data: install-data-am\nuninstall: uninstall-am\n\ninstall-am: all-am\n\t@$(MAKE) $(AM_MAKEFLAGS) install-exec-am install-data-am\n\ninstallcheck: installcheck-am\ninstall-strip:\n\tif test -z '$(STRIP)'; then \\\n\t  $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" \\\n\t    install_sh_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" INSTALL_STRIP_FLAG=-s \\\n\t      install; \\\n\telse \\\n\t  $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" \\\n\t    install_sh_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" INSTALL_STRIP_FLAG=-s \\\n\t    \"INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'\" install; \\\n\tfi\nmostlyclean-generic:\n\nclean-generic:\n\ndistclean-generic:\n\t-test -z \"$(CONFIG_CLEAN_FILES)\" || rm -f $(CONFIG_CLEAN_FILES)\n\t-test . = \"$(srcdir)\" || test -z \"$(CONFIG_CLEAN_VPATH_FILES)\" || rm -f $(CONFIG_CLEAN_VPATH_FILES)\n\nmaintainer-clean-generic:\n\t@echo \"This command is intended for maintainers to use\"\n\t@echo \"it deletes files that may require special tools to rebuild.\"\nclean: clean-am\n\nclean-am: clean-binPROGRAMS clean-generic clean-libLTLIBRARIES \\\n\tclean-libtool mostlyclean-am\n\ndistclean: distclean-am\n\t-rm -rf ./$(DEPDIR)\n\t-rm -f Makefile\ndistclean-am: clean-am distclean-compile distclean-generic \\\n\tdistclean-tags\n\ndvi: dvi-am\n\ndvi-am:\n\nhtml: html-am\n\nhtml-am:\n\ninfo: info-am\n\ninfo-am:\n\ninstall-data-am:\n\ninstall-dvi: install-dvi-am\n\ninstall-dvi-am:\n\ninstall-exec-am: install-binPROGRAMS install-libLTLIBRARIES\n\ninstall-html: install-html-am\n\ninstall-html-am:\n\ninstall-info: install-info-am\n\ninstall-info-am:\n\ninstall-man:\n\ninstall-pdf: install-pdf-am\n\ninstall-pdf-am:\n\ninstall-ps: install-ps-am\n\ninstall-ps-am:\n\ninstallcheck-am:\n\nmaintainer-clean: maintainer-clean-am\n\t-rm -rf ./$(DEPDIR)\n\t-rm -f Makefile\nmaintainer-clean-am: distclean-am maintainer-clean-generic\n\nmostlyclean: mostlyclean-am\n\nmostlyclean-am: mostlyclean-compile mostlyclean-generic \\\n\tmostlyclean-libtool\n\npdf: pdf-am\n\npdf-am:\n\nps: ps-am\n\nps-am:\n\nuninstall-am: uninstall-binPROGRAMS uninstall-libLTLIBRARIES\n\n.MAKE: install-am install-strip\n\n.PHONY: CTAGS GTAGS TAGS all all-am check check-am clean \\\n\tclean-binPROGRAMS clean-generic clean-libLTLIBRARIES \\\n\tclean-libtool cscopelist-am ctags ctags-am distclean \\\n\tdistclean-compile distclean-generic distclean-libtool \\\n\tdistclean-tags distdir dvi dvi-am html html-am info info-am \\\n\tinstall install-am install-binPROGRAMS install-data \\\n\tinstall-data-am install-dvi install-dvi-am install-exec \\\n\tinstall-exec-am install-html install-html-am install-info \\\n\tinstall-info-am install-libLTLIBRARIES install-man install-pdf \\\n\tinstall-pdf-am install-ps install-ps-am install-strip \\\n\tinstallcheck installcheck-am installdirs maintainer-clean \\\n\tmaintainer-clean-generic mostlyclean mostlyclean-compile \\\n\tmostlyclean-generic mostlyclean-libtool pdf pdf-am ps ps-am \\\n\ttags tags-am uninstall uninstall-am uninstall-binPROGRAMS \\\n\tuninstall-libLTLIBRARIES\n\n\n# Tell versions [3.59,3.63) of GNU make to not export all variables.\n# Otherwise a system limit (for SysV at least) may be exceeded.\n.NOEXPORT:\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/extensions/compress/compress-script.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Definitions of 'scriptable' versions of compression operations, that is,\n// those that can be called with FstClass-type arguments.\n//\n// See comments in nlp/fst/script/script-impl.h for how the registration\n// mechanism allows these to work with various arc types.\n\n#include <utility>\n#include <vector>\n\n#include <fst/extensions/compress/compress-script.h>\n\n#include <fst/script/script-impl.h>\n\nnamespace fst {\nnamespace script {\n\nvoid Compress(const FstClass &fst, const string &filename, const bool gzip) {\n  CompressArgs args(fst, filename, gzip);\n  Apply<Operation<CompressArgs>>(\"Compress\", fst.ArcType(), &args);\n}\n\nvoid Decompress(const string &filename, MutableFstClass *fst, const bool gzip) {\n  DecompressArgs args(filename, fst, gzip);\n  Apply<Operation<DecompressArgs>>(\"Decompress\", fst->ArcType(), &args);\n}\n\n// Register operations for common arc types.\n\nREGISTER_FST_OPERATION(Compress, StdArc, CompressArgs);\nREGISTER_FST_OPERATION(Compress, LogArc, CompressArgs);\nREGISTER_FST_OPERATION(Compress, Log64Arc, CompressArgs);\n\nREGISTER_FST_OPERATION(Decompress, StdArc, DecompressArgs);\nREGISTER_FST_OPERATION(Decompress, LogArc, DecompressArgs);\nREGISTER_FST_OPERATION(Decompress, Log64Arc, DecompressArgs);\n\n}  // namespace script\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/extensions/compress/fstcompress.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Compresses/decompresses an FST.\n\n#include <memory>\n#include <string>\n\n#include <fst/extensions/compress/compress-script.h>\n\n#include <fst/flags.h>\n#include <fst/log.h>\n#include <fst/util.h>\n#include <fst/script/fst-class.h>\n\nDEFINE_string(arc_type, \"standard\", \"Output arc type\");\nDEFINE_bool(decode, false, \"Decode\");\nDEFINE_bool(gzip, false,\n            \"Applies gzip compression after LZA compression and \"\n            \"gzip decompression before LZA decompression \"\n            \"(recommended)\"\n            \"\");\n\nint main(int argc, char **argv) {\n  namespace s = fst::script;\n\n  using s::FstClass;\n  using s::VectorFstClass;\n\n  string usage = \"Compresses/decompresses an FST.\\n\\n  Usage: \";\n  usage += argv[0];\n  usage += \" [in.fst [out.fstz]]\\n\";\n  usage += \" --decode [in.fstz [out.fst]]\\n\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n  if (argc > 3) {\n    ShowUsage();\n    return 1;\n  }\n\n  string in_name = (argc > 1 && (strcmp(argv[1], \"-\") != 0)) ? argv[1] : \"\";\n  string out_name = argc > 2 ? argv[2] : \"\";\n\n  if (FLAGS_decode == false) {\n    std::unique_ptr<FstClass> ifst(FstClass::Read(in_name));\n    if (!ifst) return 1;\n    s::Compress(*ifst, out_name, FLAGS_gzip);\n  } else {\n    VectorFstClass ofst(FLAGS_arc_type);\n    s::Decompress(in_name, &ofst, FLAGS_gzip);\n    ofst.Write(out_name);\n  }\n  return 0;\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/extensions/compress/fstrandmod.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Generates a random FST according to a class-specific transition model.\n\n#include <cstdlib>\n#include <ctime>\n#include <memory>\n#include <string>\n\n#include <fst/extensions/compress/randmod.h>\n\n#include <fst/flags.h>\n#include <fst/log.h>\n#include <fst/fstlib.h>\n#include <fst/util.h>\n\nDEFINE_int32(seed, time(0), \"Random seed\");\nDEFINE_int32(states, 10, \"# of states\");\nDEFINE_int32(labels, 2, \"# of labels\");\nDEFINE_int32(classes, 1, \"# of probability distributions\");\nDEFINE_bool(transducer, false, \"Output a transducer\");\nDEFINE_bool(weights, false, \"Output a weighted FST\");\n\nint main(int argc, char **argv) {\n  using fst::StdVectorFst;\n  using fst::StdArc;\n  using fst::TropicalWeight;\n  using fst::WeightGenerate;\n\n  string usage = \"Generates a random FST.\\n\\n  Usage: \";\n  usage += argv[0];\n  usage += \"[out.fst]\\n\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n  if (argc > 2) {\n    ShowUsage();\n    return 1;\n  }\n\n  string out_name = (argc > 1 && (strcmp(argv[1], \"-\") != 0)) ? argv[1] : \"\";\n\n  srand(FLAGS_seed);\n\n  int num_states = (rand() % FLAGS_states) + 1;    // NOLINT\n  int num_classes = (rand() % FLAGS_classes) + 1;  // NOLINT\n  int num_labels = (rand() % FLAGS_labels) + 1;    // NOLINT\n\n  StdVectorFst fst;\n  using TropicalWeightGenerate = WeightGenerate<TropicalWeight>;\n  std::unique_ptr<TropicalWeightGenerate> generate(FLAGS_weights ?\n      new TropicalWeightGenerate(false) : nullptr);\n  fst::RandMod<StdArc, TropicalWeightGenerate> rand_mod(num_states,\n      num_classes, num_labels, FLAGS_transducer, generate.get());\n  rand_mod.Generate(&fst);\n  fst.Write(out_name);\n  return 0;\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/extensions/const/Makefile.am",
    "content": "AM_CPPFLAGS = -I$(srcdir)/../../include $(ICU_CPPFLAGS)\n\nlibfstdir = @libfstdir@\nlibfst_LTLIBRARIES = const8-fst.la const16-fst.la const64-fst.la\n\nlib_LTLIBRARIES = libfstconst.la\n\nlibfstconst_la_SOURCES = const8-fst.cc const16-fst.cc const64-fst.cc\nlibfstconst_la_LDFLAGS = -version-info 10:0:0 -lm $(DL_LIBS)\nlibfstconst_la_LIBADD = ../../lib/libfst.la -lm $(DL_LIBS)\n\nconst8_fst_la_SOURCES = const8-fst.cc\nconst8_fst_la_LDFLAGS = -module\n\nconst16_fst_la_SOURCES = const16-fst.cc\nconst16_fst_la_LDFLAGS = -module\n\nconst64_fst_la_SOURCES = const64-fst.cc\nconst64_fst_la_LDFLAGS = -module\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/extensions/const/Makefile.in",
    "content": "# Makefile.in generated by automake 1.14.1 from Makefile.am.\n# @configure_input@\n\n# Copyright (C) 1994-2013 Free Software Foundation, Inc.\n\n# This Makefile.in is free software; the Free Software Foundation\n# gives unlimited permission to copy and/or distribute it,\n# with or without modifications, as long as this notice is preserved.\n\n# This program is distributed in the hope that it will be useful,\n# but WITHOUT ANY WARRANTY, to the extent permitted by law; without\n# even the implied warranty of MERCHANTABILITY or FITNESS FOR A\n# PARTICULAR PURPOSE.\n\n@SET_MAKE@\n\nVPATH = @srcdir@\nam__is_gnu_make = test -n '$(MAKEFILE_LIST)' && test -n '$(MAKELEVEL)'\nam__make_running_with_option = \\\n  case $${target_option-} in \\\n      ?) ;; \\\n      *) echo \"am__make_running_with_option: internal error: invalid\" \\\n              \"target option '$${target_option-}' specified\" >&2; \\\n         exit 1;; \\\n  esac; \\\n  has_opt=no; \\\n  sane_makeflags=$$MAKEFLAGS; \\\n  if $(am__is_gnu_make); then \\\n    sane_makeflags=$$MFLAGS; \\\n  else \\\n    case $$MAKEFLAGS in \\\n      *\\\\[\\ \\\t]*) \\\n        bs=\\\\; \\\n        sane_makeflags=`printf '%s\\n' \"$$MAKEFLAGS\" \\\n          | sed \"s/$$bs$$bs[$$bs $$bs\t]*//g\"`;; \\\n    esac; \\\n  fi; \\\n  skip_next=no; \\\n  strip_trailopt () \\\n  { \\\n    flg=`printf '%s\\n' \"$$flg\" | sed \"s/$$1.*$$//\"`; \\\n  }; \\\n  for flg in $$sane_makeflags; do \\\n    test $$skip_next = yes && { skip_next=no; continue; }; \\\n    case $$flg in \\\n      *=*|--*) continue;; \\\n        -*I) strip_trailopt 'I'; skip_next=yes;; \\\n      -*I?*) strip_trailopt 'I';; \\\n        -*O) strip_trailopt 'O'; skip_next=yes;; \\\n      -*O?*) strip_trailopt 'O';; \\\n        -*l) strip_trailopt 'l'; skip_next=yes;; \\\n      -*l?*) strip_trailopt 'l';; \\\n      -[dEDm]) skip_next=yes;; \\\n      -[JT]) skip_next=yes;; \\\n    esac; \\\n    case $$flg in \\\n      *$$target_option*) has_opt=yes; break;; \\\n    esac; \\\n  done; \\\n  test $$has_opt = yes\nam__make_dryrun = (target_option=n; $(am__make_running_with_option))\nam__make_keepgoing = (target_option=k; $(am__make_running_with_option))\npkgdatadir = $(datadir)/@PACKAGE@\npkgincludedir = $(includedir)/@PACKAGE@\npkglibdir = $(libdir)/@PACKAGE@\npkglibexecdir = $(libexecdir)/@PACKAGE@\nam__cd = CDPATH=\"$${ZSH_VERSION+.}$(PATH_SEPARATOR)\" && cd\ninstall_sh_DATA = $(install_sh) -c -m 644\ninstall_sh_PROGRAM = $(install_sh) -c\ninstall_sh_SCRIPT = $(install_sh) -c\nINSTALL_HEADER = $(INSTALL_DATA)\ntransform = $(program_transform_name)\nNORMAL_INSTALL = :\nPRE_INSTALL = :\nPOST_INSTALL = :\nNORMAL_UNINSTALL = :\nPRE_UNINSTALL = :\nPOST_UNINSTALL = :\nbuild_triplet = @build@\nhost_triplet = @host@\nsubdir = src/extensions/const\nDIST_COMMON = $(srcdir)/Makefile.in $(srcdir)/Makefile.am \\\n\t$(top_srcdir)/depcomp\nACLOCAL_M4 = $(top_srcdir)/aclocal.m4\nam__aclocal_m4_deps = $(top_srcdir)/m4/ac_python_devel.m4 \\\n\t$(top_srcdir)/m4/libtool.m4 $(top_srcdir)/m4/ltoptions.m4 \\\n\t$(top_srcdir)/m4/ltsugar.m4 $(top_srcdir)/m4/ltversion.m4 \\\n\t$(top_srcdir)/m4/lt~obsolete.m4 $(top_srcdir)/configure.ac\nam__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \\\n\t$(ACLOCAL_M4)\nmkinstalldirs = $(install_sh) -d\nCONFIG_HEADER = $(top_builddir)/config.h \\\n\t$(top_builddir)/src/include/fst/config.h\nCONFIG_CLEAN_FILES =\nCONFIG_CLEAN_VPATH_FILES =\nam__vpath_adj_setup = srcdirstrip=`echo \"$(srcdir)\" | sed 's|.|.|g'`;\nam__vpath_adj = case $$p in \\\n    $(srcdir)/*) f=`echo \"$$p\" | sed \"s|^$$srcdirstrip/||\"`;; \\\n    *) f=$$p;; \\\n  esac;\nam__strip_dir = f=`echo $$p | sed -e 's|^.*/||'`;\nam__install_max = 40\nam__nobase_strip_setup = \\\n  srcdirstrip=`echo \"$(srcdir)\" | sed 's/[].[^$$\\\\*|]/\\\\\\\\&/g'`\nam__nobase_strip = \\\n  for p in $$list; do echo \"$$p\"; done | sed -e \"s|$$srcdirstrip/||\"\nam__nobase_list = $(am__nobase_strip_setup); \\\n  for p in $$list; do echo \"$$p $$p\"; done | \\\n  sed \"s| $$srcdirstrip/| |;\"' / .*\\//!s/ .*/ ./; s,\\( .*\\)/[^/]*$$,\\1,' | \\\n  $(AWK) 'BEGIN { files[\".\"] = \"\" } { files[$$2] = files[$$2] \" \" $$1; \\\n    if (++n[$$2] == $(am__install_max)) \\\n      { print $$2, files[$$2]; n[$$2] = 0; files[$$2] = \"\" } } \\\n    END { for (dir in files) print dir, files[dir] }'\nam__base_list = \\\n  sed '$$!N;$$!N;$$!N;$$!N;$$!N;$$!N;$$!N;s/\\n/ /g' | \\\n  sed '$$!N;$$!N;$$!N;$$!N;s/\\n/ /g'\nam__uninstall_files_from_dir = { \\\n  test -z \"$$files\" \\\n    || { test ! -d \"$$dir\" && test ! -f \"$$dir\" && test ! -r \"$$dir\"; } \\\n    || { echo \" ( cd '$$dir' && rm -f\" $$files \")\"; \\\n         $(am__cd) \"$$dir\" && rm -f $$files; }; \\\n  }\nam__installdirs = \"$(DESTDIR)$(libdir)\" \"$(DESTDIR)$(libfstdir)\"\nLTLIBRARIES = $(lib_LTLIBRARIES) $(libfst_LTLIBRARIES)\nconst16_fst_la_LIBADD =\nam_const16_fst_la_OBJECTS = const16-fst.lo\nconst16_fst_la_OBJECTS = $(am_const16_fst_la_OBJECTS)\nAM_V_lt = $(am__v_lt_@AM_V@)\nam__v_lt_ = $(am__v_lt_@AM_DEFAULT_V@)\nam__v_lt_0 = --silent\nam__v_lt_1 = \nconst16_fst_la_LINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX \\\n\t$(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=link $(CXXLD) \\\n\t$(AM_CXXFLAGS) $(CXXFLAGS) $(const16_fst_la_LDFLAGS) \\\n\t$(LDFLAGS) -o $@\nconst64_fst_la_LIBADD =\nam_const64_fst_la_OBJECTS = const64-fst.lo\nconst64_fst_la_OBJECTS = $(am_const64_fst_la_OBJECTS)\nconst64_fst_la_LINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX \\\n\t$(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=link $(CXXLD) \\\n\t$(AM_CXXFLAGS) $(CXXFLAGS) $(const64_fst_la_LDFLAGS) \\\n\t$(LDFLAGS) -o $@\nconst8_fst_la_LIBADD =\nam_const8_fst_la_OBJECTS = const8-fst.lo\nconst8_fst_la_OBJECTS = $(am_const8_fst_la_OBJECTS)\nconst8_fst_la_LINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX \\\n\t$(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=link $(CXXLD) \\\n\t$(AM_CXXFLAGS) $(CXXFLAGS) $(const8_fst_la_LDFLAGS) $(LDFLAGS) \\\n\t-o $@\nam__DEPENDENCIES_1 =\nlibfstconst_la_DEPENDENCIES = ../../lib/libfst.la \\\n\t$(am__DEPENDENCIES_1)\nam_libfstconst_la_OBJECTS = const8-fst.lo const16-fst.lo \\\n\tconst64-fst.lo\nlibfstconst_la_OBJECTS = $(am_libfstconst_la_OBJECTS)\nlibfstconst_la_LINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX \\\n\t$(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=link $(CXXLD) \\\n\t$(AM_CXXFLAGS) $(CXXFLAGS) $(libfstconst_la_LDFLAGS) \\\n\t$(LDFLAGS) -o $@\nAM_V_P = $(am__v_P_@AM_V@)\nam__v_P_ = $(am__v_P_@AM_DEFAULT_V@)\nam__v_P_0 = false\nam__v_P_1 = :\nAM_V_GEN = $(am__v_GEN_@AM_V@)\nam__v_GEN_ = $(am__v_GEN_@AM_DEFAULT_V@)\nam__v_GEN_0 = @echo \"  GEN     \" $@;\nam__v_GEN_1 = \nAM_V_at = $(am__v_at_@AM_V@)\nam__v_at_ = $(am__v_at_@AM_DEFAULT_V@)\nam__v_at_0 = @\nam__v_at_1 = \nDEFAULT_INCLUDES = \ndepcomp = $(SHELL) $(top_srcdir)/depcomp\nam__depfiles_maybe = depfiles\nam__mv = mv -f\nCXXCOMPILE = $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) \\\n\t$(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS)\nLTCXXCOMPILE = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \\\n\t$(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) \\\n\t$(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) \\\n\t$(AM_CXXFLAGS) $(CXXFLAGS)\nAM_V_CXX = $(am__v_CXX_@AM_V@)\nam__v_CXX_ = $(am__v_CXX_@AM_DEFAULT_V@)\nam__v_CXX_0 = @echo \"  CXX     \" $@;\nam__v_CXX_1 = \nCXXLD = $(CXX)\nCXXLINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \\\n\t$(LIBTOOLFLAGS) --mode=link $(CXXLD) $(AM_CXXFLAGS) \\\n\t$(CXXFLAGS) $(AM_LDFLAGS) $(LDFLAGS) -o $@\nAM_V_CXXLD = $(am__v_CXXLD_@AM_V@)\nam__v_CXXLD_ = $(am__v_CXXLD_@AM_DEFAULT_V@)\nam__v_CXXLD_0 = @echo \"  CXXLD   \" $@;\nam__v_CXXLD_1 = \nSOURCES = $(const16_fst_la_SOURCES) $(const64_fst_la_SOURCES) \\\n\t$(const8_fst_la_SOURCES) $(libfstconst_la_SOURCES)\nDIST_SOURCES = $(const16_fst_la_SOURCES) $(const64_fst_la_SOURCES) \\\n\t$(const8_fst_la_SOURCES) $(libfstconst_la_SOURCES)\nam__can_run_installinfo = \\\n  case $$AM_UPDATE_INFO_DIR in \\\n    n|no|NO) false;; \\\n    *) (install-info --version) >/dev/null 2>&1;; \\\n  esac\nam__tagged_files = $(HEADERS) $(SOURCES) $(TAGS_FILES) $(LISP)\n# Read a list of newline-separated strings from the standard input,\n# and print each of them once, without duplicates.  Input order is\n# *not* preserved.\nam__uniquify_input = $(AWK) '\\\n  BEGIN { nonempty = 0; } \\\n  { items[$$0] = 1; nonempty = 1; } \\\n  END { if (nonempty) { for (i in items) print i; }; } \\\n'\n# Make sure the list of sources is unique.  This is necessary because,\n# e.g., the same source file might be shared among _SOURCES variables\n# for different programs/libraries.\nam__define_uniq_tagged_files = \\\n  list='$(am__tagged_files)'; \\\n  unique=`for i in $$list; do \\\n    if test -f \"$$i\"; then echo $$i; else echo $(srcdir)/$$i; fi; \\\n  done | $(am__uniquify_input)`\nETAGS = etags\nCTAGS = ctags\nDISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST)\nACLOCAL = @ACLOCAL@\nAMTAR = @AMTAR@\nAM_DEFAULT_VERBOSITY = @AM_DEFAULT_VERBOSITY@\nAR = @AR@\nAUTOCONF = @AUTOCONF@\nAUTOHEADER = @AUTOHEADER@\nAUTOMAKE = @AUTOMAKE@\nAWK = @AWK@\nCC = @CC@\nCCDEPMODE = @CCDEPMODE@\nCFLAGS = @CFLAGS@\nCPP = @CPP@\nCPPFLAGS = @CPPFLAGS@\nCXX = @CXX@\nCXXCPP = @CXXCPP@\nCXXDEPMODE = @CXXDEPMODE@\nCXXFLAGS = @CXXFLAGS@\nCYGPATH_W = @CYGPATH_W@\nDEFS = @DEFS@\nDEPDIR = @DEPDIR@\nDLLTOOL = @DLLTOOL@\nDL_LIBS = @DL_LIBS@\nDSYMUTIL = @DSYMUTIL@\nDUMPBIN = @DUMPBIN@\nECHO_C = @ECHO_C@\nECHO_N = @ECHO_N@\nECHO_T = @ECHO_T@\nEGREP = @EGREP@\nEXEEXT = @EXEEXT@\nFGREP = @FGREP@\nGREP = @GREP@\nINSTALL = @INSTALL@\nINSTALL_DATA = @INSTALL_DATA@\nINSTALL_PROGRAM = @INSTALL_PROGRAM@\nINSTALL_SCRIPT = @INSTALL_SCRIPT@\nINSTALL_STRIP_PROGRAM = @INSTALL_STRIP_PROGRAM@\nLD = @LD@\nLDFLAGS = @LDFLAGS@\nLIBOBJS = @LIBOBJS@\nLIBS = @LIBS@\nLIBTOOL = @LIBTOOL@\nLIPO = @LIPO@\nLN_S = @LN_S@\nLTLIBOBJS = @LTLIBOBJS@\nMAKEINFO = @MAKEINFO@\nMANIFEST_TOOL = @MANIFEST_TOOL@\nMKDIR_P = @MKDIR_P@\nNM = @NM@\nNMEDIT = @NMEDIT@\nOBJDUMP = @OBJDUMP@\nOBJEXT = @OBJEXT@\nOTOOL = @OTOOL@\nOTOOL64 = @OTOOL64@\nPACKAGE = @PACKAGE@\nPACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@\nPACKAGE_NAME = @PACKAGE_NAME@\nPACKAGE_STRING = @PACKAGE_STRING@\nPACKAGE_TARNAME = @PACKAGE_TARNAME@\nPACKAGE_URL = @PACKAGE_URL@\nPACKAGE_VERSION = @PACKAGE_VERSION@\nPATH_SEPARATOR = @PATH_SEPARATOR@\nPYTHON = @PYTHON@\nPYTHON_CPPFLAGS = @PYTHON_CPPFLAGS@\nPYTHON_EXEC_PREFIX = @PYTHON_EXEC_PREFIX@\nPYTHON_EXTRA_LDFLAGS = @PYTHON_EXTRA_LDFLAGS@\nPYTHON_EXTRA_LIBS = @PYTHON_EXTRA_LIBS@\nPYTHON_LDFLAGS = @PYTHON_LDFLAGS@\nPYTHON_PLATFORM = @PYTHON_PLATFORM@\nPYTHON_PREFIX = @PYTHON_PREFIX@\nPYTHON_SITE_PKG = @PYTHON_SITE_PKG@\nPYTHON_VERSION = @PYTHON_VERSION@\nRANLIB = @RANLIB@\nSED = @SED@\nSET_MAKE = @SET_MAKE@\nSHELL = @SHELL@\nSTRIP = @STRIP@\nVERSION = @VERSION@\nabs_builddir = @abs_builddir@\nabs_srcdir = @abs_srcdir@\nabs_top_builddir = @abs_top_builddir@\nabs_top_srcdir = @abs_top_srcdir@\nac_ct_AR = @ac_ct_AR@\nac_ct_CC = @ac_ct_CC@\nac_ct_CXX = @ac_ct_CXX@\nac_ct_DUMPBIN = @ac_ct_DUMPBIN@\nam__include = @am__include@\nam__leading_dot = @am__leading_dot@\nam__quote = @am__quote@\nam__tar = @am__tar@\nam__untar = @am__untar@\nbindir = @bindir@\nbuild = @build@\nbuild_alias = @build_alias@\nbuild_cpu = @build_cpu@\nbuild_os = @build_os@\nbuild_vendor = @build_vendor@\nbuilddir = @builddir@\ndatadir = @datadir@\ndatarootdir = @datarootdir@\ndocdir = @docdir@\ndvidir = @dvidir@\nexec_prefix = @exec_prefix@\nhost = @host@\nhost_alias = @host_alias@\nhost_cpu = @host_cpu@\nhost_os = @host_os@\nhost_vendor = @host_vendor@\nhtmldir = @htmldir@\nincludedir = @includedir@\ninfodir = @infodir@\ninstall_sh = @install_sh@\nlibdir = @libdir@\nlibexecdir = @libexecdir@\nlibfstdir = @libfstdir@\nlocaledir = @localedir@\nlocalstatedir = @localstatedir@\nmandir = @mandir@\nmkdir_p = @mkdir_p@\noldincludedir = @oldincludedir@\npdfdir = @pdfdir@\npkgpyexecdir = @pkgpyexecdir@\npkgpythondir = @pkgpythondir@\nprefix = @prefix@\nprogram_transform_name = @program_transform_name@\npsdir = @psdir@\npyexecdir = @pyexecdir@\npythondir = @pythondir@\nsbindir = @sbindir@\nsharedstatedir = @sharedstatedir@\nsrcdir = @srcdir@\nsysconfdir = @sysconfdir@\ntarget_alias = @target_alias@\ntop_build_prefix = @top_build_prefix@\ntop_builddir = @top_builddir@\ntop_srcdir = @top_srcdir@\nAM_CPPFLAGS = -I$(srcdir)/../../include $(ICU_CPPFLAGS)\nlibfst_LTLIBRARIES = const8-fst.la const16-fst.la const64-fst.la\nlib_LTLIBRARIES = libfstconst.la\nlibfstconst_la_SOURCES = const8-fst.cc const16-fst.cc const64-fst.cc\nlibfstconst_la_LDFLAGS = -version-info 10:0:0 -lm $(DL_LIBS)\nlibfstconst_la_LIBADD = ../../lib/libfst.la -lm $(DL_LIBS)\nconst8_fst_la_SOURCES = const8-fst.cc\nconst8_fst_la_LDFLAGS = -module\nconst16_fst_la_SOURCES = const16-fst.cc\nconst16_fst_la_LDFLAGS = -module\nconst64_fst_la_SOURCES = const64-fst.cc\nconst64_fst_la_LDFLAGS = -module\nall: all-am\n\n.SUFFIXES:\n.SUFFIXES: .cc .lo .o .obj\n$(srcdir)/Makefile.in:  $(srcdir)/Makefile.am  $(am__configure_deps)\n\t@for dep in $?; do \\\n\t  case '$(am__configure_deps)' in \\\n\t    *$$dep*) \\\n\t      ( cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh ) \\\n\t        && { if test -f $@; then exit 0; else break; fi; }; \\\n\t      exit 1;; \\\n\t  esac; \\\n\tdone; \\\n\techo ' cd $(top_srcdir) && $(AUTOMAKE) --foreign src/extensions/const/Makefile'; \\\n\t$(am__cd) $(top_srcdir) && \\\n\t  $(AUTOMAKE) --foreign src/extensions/const/Makefile\n.PRECIOUS: Makefile\nMakefile: $(srcdir)/Makefile.in $(top_builddir)/config.status\n\t@case '$?' in \\\n\t  *config.status*) \\\n\t    cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh;; \\\n\t  *) \\\n\t    echo ' cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe)'; \\\n\t    cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe);; \\\n\tesac;\n\n$(top_builddir)/config.status: $(top_srcdir)/configure $(CONFIG_STATUS_DEPENDENCIES)\n\tcd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh\n\n$(top_srcdir)/configure:  $(am__configure_deps)\n\tcd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh\n$(ACLOCAL_M4):  $(am__aclocal_m4_deps)\n\tcd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh\n$(am__aclocal_m4_deps):\n\ninstall-libLTLIBRARIES: $(lib_LTLIBRARIES)\n\t@$(NORMAL_INSTALL)\n\t@list='$(lib_LTLIBRARIES)'; test -n \"$(libdir)\" || list=; \\\n\tlist2=; for p in $$list; do \\\n\t  if test -f $$p; then \\\n\t    list2=\"$$list2 $$p\"; \\\n\t  else :; fi; \\\n\tdone; \\\n\ttest -z \"$$list2\" || { \\\n\t  echo \" $(MKDIR_P) '$(DESTDIR)$(libdir)'\"; \\\n\t  $(MKDIR_P) \"$(DESTDIR)$(libdir)\" || exit 1; \\\n\t  echo \" $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) $$list2 '$(DESTDIR)$(libdir)'\"; \\\n\t  $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) $$list2 \"$(DESTDIR)$(libdir)\"; \\\n\t}\n\nuninstall-libLTLIBRARIES:\n\t@$(NORMAL_UNINSTALL)\n\t@list='$(lib_LTLIBRARIES)'; test -n \"$(libdir)\" || list=; \\\n\tfor p in $$list; do \\\n\t  $(am__strip_dir) \\\n\t  echo \" $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=uninstall rm -f '$(DESTDIR)$(libdir)/$$f'\"; \\\n\t  $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=uninstall rm -f \"$(DESTDIR)$(libdir)/$$f\"; \\\n\tdone\n\nclean-libLTLIBRARIES:\n\t-test -z \"$(lib_LTLIBRARIES)\" || rm -f $(lib_LTLIBRARIES)\n\t@list='$(lib_LTLIBRARIES)'; \\\n\tlocs=`for p in $$list; do echo $$p; done | \\\n\t      sed 's|^[^/]*$$|.|; s|/[^/]*$$||; s|$$|/so_locations|' | \\\n\t      sort -u`; \\\n\ttest -z \"$$locs\" || { \\\n\t  echo rm -f $${locs}; \\\n\t  rm -f $${locs}; \\\n\t}\n\ninstall-libfstLTLIBRARIES: $(libfst_LTLIBRARIES)\n\t@$(NORMAL_INSTALL)\n\t@list='$(libfst_LTLIBRARIES)'; test -n \"$(libfstdir)\" || list=; \\\n\tlist2=; for p in $$list; do \\\n\t  if test -f $$p; then \\\n\t    list2=\"$$list2 $$p\"; \\\n\t  else :; fi; \\\n\tdone; \\\n\ttest -z \"$$list2\" || { \\\n\t  echo \" $(MKDIR_P) '$(DESTDIR)$(libfstdir)'\"; \\\n\t  $(MKDIR_P) \"$(DESTDIR)$(libfstdir)\" || exit 1; \\\n\t  echo \" $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) $$list2 '$(DESTDIR)$(libfstdir)'\"; \\\n\t  $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) $$list2 \"$(DESTDIR)$(libfstdir)\"; \\\n\t}\n\nuninstall-libfstLTLIBRARIES:\n\t@$(NORMAL_UNINSTALL)\n\t@list='$(libfst_LTLIBRARIES)'; test -n \"$(libfstdir)\" || list=; \\\n\tfor p in $$list; do \\\n\t  $(am__strip_dir) \\\n\t  echo \" $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=uninstall rm -f '$(DESTDIR)$(libfstdir)/$$f'\"; \\\n\t  $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=uninstall rm -f \"$(DESTDIR)$(libfstdir)/$$f\"; \\\n\tdone\n\nclean-libfstLTLIBRARIES:\n\t-test -z \"$(libfst_LTLIBRARIES)\" || rm -f $(libfst_LTLIBRARIES)\n\t@list='$(libfst_LTLIBRARIES)'; \\\n\tlocs=`for p in $$list; do echo $$p; done | \\\n\t      sed 's|^[^/]*$$|.|; s|/[^/]*$$||; s|$$|/so_locations|' | \\\n\t      sort -u`; \\\n\ttest -z \"$$locs\" || { \\\n\t  echo rm -f $${locs}; \\\n\t  rm -f $${locs}; \\\n\t}\n\nconst16-fst.la: $(const16_fst_la_OBJECTS) $(const16_fst_la_DEPENDENCIES) $(EXTRA_const16_fst_la_DEPENDENCIES) \n\t$(AM_V_CXXLD)$(const16_fst_la_LINK) -rpath $(libfstdir) $(const16_fst_la_OBJECTS) $(const16_fst_la_LIBADD) $(LIBS)\n\nconst64-fst.la: $(const64_fst_la_OBJECTS) $(const64_fst_la_DEPENDENCIES) $(EXTRA_const64_fst_la_DEPENDENCIES) \n\t$(AM_V_CXXLD)$(const64_fst_la_LINK) -rpath $(libfstdir) $(const64_fst_la_OBJECTS) $(const64_fst_la_LIBADD) $(LIBS)\n\nconst8-fst.la: $(const8_fst_la_OBJECTS) $(const8_fst_la_DEPENDENCIES) $(EXTRA_const8_fst_la_DEPENDENCIES) \n\t$(AM_V_CXXLD)$(const8_fst_la_LINK) -rpath $(libfstdir) $(const8_fst_la_OBJECTS) $(const8_fst_la_LIBADD) $(LIBS)\n\nlibfstconst.la: $(libfstconst_la_OBJECTS) $(libfstconst_la_DEPENDENCIES) $(EXTRA_libfstconst_la_DEPENDENCIES) \n\t$(AM_V_CXXLD)$(libfstconst_la_LINK) -rpath $(libdir) $(libfstconst_la_OBJECTS) $(libfstconst_la_LIBADD) $(LIBS)\n\nmostlyclean-compile:\n\t-rm -f *.$(OBJEXT)\n\ndistclean-compile:\n\t-rm -f *.tab.c\n\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/const16-fst.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/const64-fst.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/const8-fst.Plo@am__quote@\n\n.cc.o:\n@am__fastdepCXX_TRUE@\t$(AM_V_CXX)depbase=`echo $@ | sed 's|[^/]*$$|$(DEPDIR)/&|;s|\\.o$$||'`;\\\n@am__fastdepCXX_TRUE@\t$(CXXCOMPILE) -MT $@ -MD -MP -MF $$depbase.Tpo -c -o $@ $< &&\\\n@am__fastdepCXX_TRUE@\t$(am__mv) $$depbase.Tpo $$depbase.Po\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\t$(AM_V_CXX)source='$<' object='$@' libtool=no @AMDEPBACKSLASH@\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\tDEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@\n@am__fastdepCXX_FALSE@\t$(AM_V_CXX@am__nodep@)$(CXXCOMPILE) -c -o $@ $<\n\n.cc.obj:\n@am__fastdepCXX_TRUE@\t$(AM_V_CXX)depbase=`echo $@ | sed 's|[^/]*$$|$(DEPDIR)/&|;s|\\.obj$$||'`;\\\n@am__fastdepCXX_TRUE@\t$(CXXCOMPILE) -MT $@ -MD -MP -MF $$depbase.Tpo -c -o $@ `$(CYGPATH_W) '$<'` &&\\\n@am__fastdepCXX_TRUE@\t$(am__mv) $$depbase.Tpo $$depbase.Po\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\t$(AM_V_CXX)source='$<' object='$@' libtool=no @AMDEPBACKSLASH@\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\tDEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@\n@am__fastdepCXX_FALSE@\t$(AM_V_CXX@am__nodep@)$(CXXCOMPILE) -c -o $@ `$(CYGPATH_W) '$<'`\n\n.cc.lo:\n@am__fastdepCXX_TRUE@\t$(AM_V_CXX)depbase=`echo $@ | sed 's|[^/]*$$|$(DEPDIR)/&|;s|\\.lo$$||'`;\\\n@am__fastdepCXX_TRUE@\t$(LTCXXCOMPILE) -MT $@ -MD -MP -MF $$depbase.Tpo -c -o $@ $< &&\\\n@am__fastdepCXX_TRUE@\t$(am__mv) $$depbase.Tpo $$depbase.Plo\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\t$(AM_V_CXX)source='$<' object='$@' libtool=yes @AMDEPBACKSLASH@\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\tDEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@\n@am__fastdepCXX_FALSE@\t$(AM_V_CXX@am__nodep@)$(LTCXXCOMPILE) -c -o $@ $<\n\nmostlyclean-libtool:\n\t-rm -f *.lo\n\nclean-libtool:\n\t-rm -rf .libs _libs\n\nID: $(am__tagged_files)\n\t$(am__define_uniq_tagged_files); mkid -fID $$unique\ntags: tags-am\nTAGS: tags\n\ntags-am: $(TAGS_DEPENDENCIES) $(am__tagged_files)\n\tset x; \\\n\there=`pwd`; \\\n\t$(am__define_uniq_tagged_files); \\\n\tshift; \\\n\tif test -z \"$(ETAGS_ARGS)$$*$$unique\"; then :; else \\\n\t  test -n \"$$unique\" || unique=$$empty_fix; \\\n\t  if test $$# -gt 0; then \\\n\t    $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \\\n\t      \"$$@\" $$unique; \\\n\t  else \\\n\t    $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \\\n\t      $$unique; \\\n\t  fi; \\\n\tfi\nctags: ctags-am\n\nCTAGS: ctags\nctags-am: $(TAGS_DEPENDENCIES) $(am__tagged_files)\n\t$(am__define_uniq_tagged_files); \\\n\ttest -z \"$(CTAGS_ARGS)$$unique\" \\\n\t  || $(CTAGS) $(CTAGSFLAGS) $(AM_CTAGSFLAGS) $(CTAGS_ARGS) \\\n\t     $$unique\n\nGTAGS:\n\there=`$(am__cd) $(top_builddir) && pwd` \\\n\t  && $(am__cd) $(top_srcdir) \\\n\t  && gtags -i $(GTAGS_ARGS) \"$$here\"\ncscopelist: cscopelist-am\n\ncscopelist-am: $(am__tagged_files)\n\tlist='$(am__tagged_files)'; \\\n\tcase \"$(srcdir)\" in \\\n\t  [\\\\/]* | ?:[\\\\/]*) sdir=\"$(srcdir)\" ;; \\\n\t  *) sdir=$(subdir)/$(srcdir) ;; \\\n\tesac; \\\n\tfor i in $$list; do \\\n\t  if test -f \"$$i\"; then \\\n\t    echo \"$(subdir)/$$i\"; \\\n\t  else \\\n\t    echo \"$$sdir/$$i\"; \\\n\t  fi; \\\n\tdone >> $(top_builddir)/cscope.files\n\ndistclean-tags:\n\t-rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags\n\ndistdir: $(DISTFILES)\n\t@srcdirstrip=`echo \"$(srcdir)\" | sed 's/[].[^$$\\\\*]/\\\\\\\\&/g'`; \\\n\ttopsrcdirstrip=`echo \"$(top_srcdir)\" | sed 's/[].[^$$\\\\*]/\\\\\\\\&/g'`; \\\n\tlist='$(DISTFILES)'; \\\n\t  dist_files=`for file in $$list; do echo $$file; done | \\\n\t  sed -e \"s|^$$srcdirstrip/||;t\" \\\n\t      -e \"s|^$$topsrcdirstrip/|$(top_builddir)/|;t\"`; \\\n\tcase $$dist_files in \\\n\t  */*) $(MKDIR_P) `echo \"$$dist_files\" | \\\n\t\t\t   sed '/\\//!d;s|^|$(distdir)/|;s,/[^/]*$$,,' | \\\n\t\t\t   sort -u` ;; \\\n\tesac; \\\n\tfor file in $$dist_files; do \\\n\t  if test -f $$file || test -d $$file; then d=.; else d=$(srcdir); fi; \\\n\t  if test -d $$d/$$file; then \\\n\t    dir=`echo \"/$$file\" | sed -e 's,/[^/]*$$,,'`; \\\n\t    if test -d \"$(distdir)/$$file\"; then \\\n\t      find \"$(distdir)/$$file\" -type d ! -perm -700 -exec chmod u+rwx {} \\;; \\\n\t    fi; \\\n\t    if test -d $(srcdir)/$$file && test $$d != $(srcdir); then \\\n\t      cp -fpR $(srcdir)/$$file \"$(distdir)$$dir\" || exit 1; \\\n\t      find \"$(distdir)/$$file\" -type d ! -perm -700 -exec chmod u+rwx {} \\;; \\\n\t    fi; \\\n\t    cp -fpR $$d/$$file \"$(distdir)$$dir\" || exit 1; \\\n\t  else \\\n\t    test -f \"$(distdir)/$$file\" \\\n\t    || cp -p $$d/$$file \"$(distdir)/$$file\" \\\n\t    || exit 1; \\\n\t  fi; \\\n\tdone\ncheck-am: all-am\ncheck: check-am\nall-am: Makefile $(LTLIBRARIES)\ninstalldirs:\n\tfor dir in \"$(DESTDIR)$(libdir)\" \"$(DESTDIR)$(libfstdir)\"; do \\\n\t  test -z \"$$dir\" || $(MKDIR_P) \"$$dir\"; \\\n\tdone\ninstall: install-am\ninstall-exec: install-exec-am\ninstall-data: install-data-am\nuninstall: uninstall-am\n\ninstall-am: all-am\n\t@$(MAKE) $(AM_MAKEFLAGS) install-exec-am install-data-am\n\ninstallcheck: installcheck-am\ninstall-strip:\n\tif test -z '$(STRIP)'; then \\\n\t  $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" \\\n\t    install_sh_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" INSTALL_STRIP_FLAG=-s \\\n\t      install; \\\n\telse \\\n\t  $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" \\\n\t    install_sh_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" INSTALL_STRIP_FLAG=-s \\\n\t    \"INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'\" install; \\\n\tfi\nmostlyclean-generic:\n\nclean-generic:\n\ndistclean-generic:\n\t-test -z \"$(CONFIG_CLEAN_FILES)\" || rm -f $(CONFIG_CLEAN_FILES)\n\t-test . = \"$(srcdir)\" || test -z \"$(CONFIG_CLEAN_VPATH_FILES)\" || rm -f $(CONFIG_CLEAN_VPATH_FILES)\n\nmaintainer-clean-generic:\n\t@echo \"This command is intended for maintainers to use\"\n\t@echo \"it deletes files that may require special tools to rebuild.\"\nclean: clean-am\n\nclean-am: clean-generic clean-libLTLIBRARIES clean-libfstLTLIBRARIES \\\n\tclean-libtool mostlyclean-am\n\ndistclean: distclean-am\n\t-rm -rf ./$(DEPDIR)\n\t-rm -f Makefile\ndistclean-am: clean-am distclean-compile distclean-generic \\\n\tdistclean-tags\n\ndvi: dvi-am\n\ndvi-am:\n\nhtml: html-am\n\nhtml-am:\n\ninfo: info-am\n\ninfo-am:\n\ninstall-data-am: install-libfstLTLIBRARIES\n\ninstall-dvi: install-dvi-am\n\ninstall-dvi-am:\n\ninstall-exec-am: install-libLTLIBRARIES\n\ninstall-html: install-html-am\n\ninstall-html-am:\n\ninstall-info: install-info-am\n\ninstall-info-am:\n\ninstall-man:\n\ninstall-pdf: install-pdf-am\n\ninstall-pdf-am:\n\ninstall-ps: install-ps-am\n\ninstall-ps-am:\n\ninstallcheck-am:\n\nmaintainer-clean: maintainer-clean-am\n\t-rm -rf ./$(DEPDIR)\n\t-rm -f Makefile\nmaintainer-clean-am: distclean-am maintainer-clean-generic\n\nmostlyclean: mostlyclean-am\n\nmostlyclean-am: mostlyclean-compile mostlyclean-generic \\\n\tmostlyclean-libtool\n\npdf: pdf-am\n\npdf-am:\n\nps: ps-am\n\nps-am:\n\nuninstall-am: uninstall-libLTLIBRARIES uninstall-libfstLTLIBRARIES\n\n.MAKE: install-am install-strip\n\n.PHONY: CTAGS GTAGS TAGS all all-am check check-am clean clean-generic \\\n\tclean-libLTLIBRARIES clean-libfstLTLIBRARIES clean-libtool \\\n\tcscopelist-am ctags ctags-am distclean distclean-compile \\\n\tdistclean-generic distclean-libtool distclean-tags distdir dvi \\\n\tdvi-am html html-am info info-am install install-am \\\n\tinstall-data install-data-am install-dvi install-dvi-am \\\n\tinstall-exec install-exec-am install-html install-html-am \\\n\tinstall-info install-info-am install-libLTLIBRARIES \\\n\tinstall-libfstLTLIBRARIES install-man install-pdf \\\n\tinstall-pdf-am install-ps install-ps-am install-strip \\\n\tinstallcheck installcheck-am installdirs maintainer-clean \\\n\tmaintainer-clean-generic mostlyclean mostlyclean-compile \\\n\tmostlyclean-generic mostlyclean-libtool pdf pdf-am ps ps-am \\\n\ttags tags-am uninstall uninstall-am uninstall-libLTLIBRARIES \\\n\tuninstall-libfstLTLIBRARIES\n\n\n# Tell versions [3.59,3.63) of GNU make to not export all variables.\n# Otherwise a system limit (for SysV at least) may be exceeded.\n.NOEXPORT:\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/extensions/const/const16-fst.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/fst.h>\n#include <fst/const-fst.h>\n\nnamespace fst {\n\nstatic FstRegisterer<ConstFst<StdArc, uint16>>\n    ConstFst_StdArc_uint16_registerer;\nstatic FstRegisterer<ConstFst<LogArc, uint16>>\n    ConstFst_LogArc_uint16_registerer;\nstatic FstRegisterer<ConstFst<Log64Arc, uint16>>\n    ConstFst_Log64Arc_uint16_registerer;\n\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/extensions/const/const64-fst.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/fst.h>\n#include <fst/const-fst.h>\n\nnamespace fst {\n\nstatic FstRegisterer<ConstFst<StdArc, uint64>>\n    ConstFst_StdArc_uint64_registerer;\nstatic FstRegisterer<ConstFst<LogArc, uint64>>\n    ConstFst_LogArc_uint64_registerer;\nstatic FstRegisterer<ConstFst<Log64Arc, uint64>>\n    ConstFst_Log64Arc_uint64_registerer;\n\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/extensions/const/const8-fst.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/fst.h>\n#include <fst/const-fst.h>\n\nnamespace fst {\n\nstatic FstRegisterer<ConstFst<StdArc, uint8>> ConstFst_StdArc_uint8_registerer;\nstatic FstRegisterer<ConstFst<LogArc, uint8>> ConstFst_LogArc_uint8_registerer;\nstatic FstRegisterer<ConstFst<Log64Arc, uint8>>\n    ConstFst_Log64Arc_uint8_registerer;\n\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/extensions/far/Makefile.am",
    "content": "AM_CPPFLAGS = -I$(srcdir)/../../include $(ICU_CPPFLAGS)\n\nif HAVE_SCRIPT\nlib_LTLIBRARIES = libfstfar.la libfstfarscript.la\nelse\nlib_LTLIBRARIES = libfstfar.la\nendif\n\nlibfstfar_la_SOURCES = sttable.cc stlist.cc\nlibfstfar_la_LDFLAGS = -version-info 10:0:0\nlibfstfar_la_LIBADD = ../../lib/libfst.la -lm $(DL_LIBS)\n\nif HAVE_SCRIPT\nlibfstfarscript_la_SOURCES = far-class.cc farscript.cc getters.cc script-impl.cc \\\n                             strings.cc\nlibfstfarscript_la_LDFLAGS = -version-info 10:0:0\nlibfstfarscript_la_LIBADD = \\\n    libfstfar.la ../../script/libfstscript.la \\\n        ../../lib/libfst.la -lm $(DL_LIBS)\nendif\n\nif HAVE_BIN\nbin_PROGRAMS = farcompilestrings farcreate farequal farextract farinfo \\\n    farisomorphic farprintstrings\n\nLDADD = libfstfarscript.la ../../script/libfstscript.la \\\n        ../../lib/libfst.la -lm $(DL_LIBS)\n\nfarcompilestrings_SOURCES = farcompilestrings.cc\n\nfarcreate_SOURCES = farcreate.cc\n\nfarequal_SOURCES = farequal.cc\n\nfarextract_SOURCES = farextract.cc\n\nfarinfo_SOURCES = farinfo.cc\n\nfarisomorphic_SOURCES = farisomorphic.cc\n\nfarprintstrings_SOURCES = farprintstrings.cc\nendif\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/extensions/far/Makefile.in",
    "content": "# Makefile.in generated by automake 1.14.1 from Makefile.am.\n# @configure_input@\n\n# Copyright (C) 1994-2013 Free Software Foundation, Inc.\n\n# This Makefile.in is free software; the Free Software Foundation\n# gives unlimited permission to copy and/or distribute it,\n# with or without modifications, as long as this notice is preserved.\n\n# This program is distributed in the hope that it will be useful,\n# but WITHOUT ANY WARRANTY, to the extent permitted by law; without\n# even the implied warranty of MERCHANTABILITY or FITNESS FOR A\n# PARTICULAR PURPOSE.\n\n@SET_MAKE@\n\n\nVPATH = @srcdir@\nam__is_gnu_make = test -n '$(MAKEFILE_LIST)' && test -n '$(MAKELEVEL)'\nam__make_running_with_option = \\\n  case $${target_option-} in \\\n      ?) ;; \\\n      *) echo \"am__make_running_with_option: internal error: invalid\" \\\n              \"target option '$${target_option-}' specified\" >&2; \\\n         exit 1;; \\\n  esac; \\\n  has_opt=no; \\\n  sane_makeflags=$$MAKEFLAGS; \\\n  if $(am__is_gnu_make); then \\\n    sane_makeflags=$$MFLAGS; \\\n  else \\\n    case $$MAKEFLAGS in \\\n      *\\\\[\\ \\\t]*) \\\n        bs=\\\\; \\\n        sane_makeflags=`printf '%s\\n' \"$$MAKEFLAGS\" \\\n          | sed \"s/$$bs$$bs[$$bs $$bs\t]*//g\"`;; \\\n    esac; \\\n  fi; \\\n  skip_next=no; \\\n  strip_trailopt () \\\n  { \\\n    flg=`printf '%s\\n' \"$$flg\" | sed \"s/$$1.*$$//\"`; \\\n  }; \\\n  for flg in $$sane_makeflags; do \\\n    test $$skip_next = yes && { skip_next=no; continue; }; \\\n    case $$flg in \\\n      *=*|--*) continue;; \\\n        -*I) strip_trailopt 'I'; skip_next=yes;; \\\n      -*I?*) strip_trailopt 'I';; \\\n        -*O) strip_trailopt 'O'; skip_next=yes;; \\\n      -*O?*) strip_trailopt 'O';; \\\n        -*l) strip_trailopt 'l'; skip_next=yes;; \\\n      -*l?*) strip_trailopt 'l';; \\\n      -[dEDm]) skip_next=yes;; \\\n      -[JT]) skip_next=yes;; \\\n    esac; \\\n    case $$flg in \\\n      *$$target_option*) has_opt=yes; break;; \\\n    esac; \\\n  done; \\\n  test $$has_opt = yes\nam__make_dryrun = (target_option=n; $(am__make_running_with_option))\nam__make_keepgoing = (target_option=k; $(am__make_running_with_option))\npkgdatadir = $(datadir)/@PACKAGE@\npkgincludedir = $(includedir)/@PACKAGE@\npkglibdir = $(libdir)/@PACKAGE@\npkglibexecdir = $(libexecdir)/@PACKAGE@\nam__cd = CDPATH=\"$${ZSH_VERSION+.}$(PATH_SEPARATOR)\" && cd\ninstall_sh_DATA = $(install_sh) -c -m 644\ninstall_sh_PROGRAM = $(install_sh) -c\ninstall_sh_SCRIPT = $(install_sh) -c\nINSTALL_HEADER = $(INSTALL_DATA)\ntransform = $(program_transform_name)\nNORMAL_INSTALL = :\nPRE_INSTALL = :\nPOST_INSTALL = :\nNORMAL_UNINSTALL = :\nPRE_UNINSTALL = :\nPOST_UNINSTALL = :\nbuild_triplet = @build@\nhost_triplet = @host@\n@HAVE_BIN_TRUE@bin_PROGRAMS = farcompilestrings$(EXEEXT) \\\n@HAVE_BIN_TRUE@\tfarcreate$(EXEEXT) farequal$(EXEEXT) \\\n@HAVE_BIN_TRUE@\tfarextract$(EXEEXT) farinfo$(EXEEXT) \\\n@HAVE_BIN_TRUE@\tfarisomorphic$(EXEEXT) farprintstrings$(EXEEXT)\nsubdir = src/extensions/far\nDIST_COMMON = $(srcdir)/Makefile.in $(srcdir)/Makefile.am \\\n\t$(top_srcdir)/depcomp\nACLOCAL_M4 = $(top_srcdir)/aclocal.m4\nam__aclocal_m4_deps = $(top_srcdir)/m4/ac_python_devel.m4 \\\n\t$(top_srcdir)/m4/libtool.m4 $(top_srcdir)/m4/ltoptions.m4 \\\n\t$(top_srcdir)/m4/ltsugar.m4 $(top_srcdir)/m4/ltversion.m4 \\\n\t$(top_srcdir)/m4/lt~obsolete.m4 $(top_srcdir)/configure.ac\nam__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \\\n\t$(ACLOCAL_M4)\nmkinstalldirs = $(install_sh) -d\nCONFIG_HEADER = $(top_builddir)/config.h \\\n\t$(top_builddir)/src/include/fst/config.h\nCONFIG_CLEAN_FILES =\nCONFIG_CLEAN_VPATH_FILES =\nam__vpath_adj_setup = srcdirstrip=`echo \"$(srcdir)\" | sed 's|.|.|g'`;\nam__vpath_adj = case $$p in \\\n    $(srcdir)/*) f=`echo \"$$p\" | sed \"s|^$$srcdirstrip/||\"`;; \\\n    *) f=$$p;; \\\n  esac;\nam__strip_dir = f=`echo $$p | sed -e 's|^.*/||'`;\nam__install_max = 40\nam__nobase_strip_setup = \\\n  srcdirstrip=`echo \"$(srcdir)\" | sed 's/[].[^$$\\\\*|]/\\\\\\\\&/g'`\nam__nobase_strip = \\\n  for p in $$list; do echo \"$$p\"; done | sed -e \"s|$$srcdirstrip/||\"\nam__nobase_list = $(am__nobase_strip_setup); \\\n  for p in $$list; do echo \"$$p $$p\"; done | \\\n  sed \"s| $$srcdirstrip/| |;\"' / .*\\//!s/ .*/ ./; s,\\( .*\\)/[^/]*$$,\\1,' | \\\n  $(AWK) 'BEGIN { files[\".\"] = \"\" } { files[$$2] = files[$$2] \" \" $$1; \\\n    if (++n[$$2] == $(am__install_max)) \\\n      { print $$2, files[$$2]; n[$$2] = 0; files[$$2] = \"\" } } \\\n    END { for (dir in files) print dir, files[dir] }'\nam__base_list = \\\n  sed '$$!N;$$!N;$$!N;$$!N;$$!N;$$!N;$$!N;s/\\n/ /g' | \\\n  sed '$$!N;$$!N;$$!N;$$!N;s/\\n/ /g'\nam__uninstall_files_from_dir = { \\\n  test -z \"$$files\" \\\n    || { test ! -d \"$$dir\" && test ! -f \"$$dir\" && test ! -r \"$$dir\"; } \\\n    || { echo \" ( cd '$$dir' && rm -f\" $$files \")\"; \\\n         $(am__cd) \"$$dir\" && rm -f $$files; }; \\\n  }\nam__installdirs = \"$(DESTDIR)$(libdir)\" \"$(DESTDIR)$(bindir)\"\nLTLIBRARIES = $(lib_LTLIBRARIES)\nam__DEPENDENCIES_1 =\nlibfstfar_la_DEPENDENCIES = ../../lib/libfst.la $(am__DEPENDENCIES_1)\nam_libfstfar_la_OBJECTS = sttable.lo stlist.lo\nlibfstfar_la_OBJECTS = $(am_libfstfar_la_OBJECTS)\nAM_V_lt = $(am__v_lt_@AM_V@)\nam__v_lt_ = $(am__v_lt_@AM_DEFAULT_V@)\nam__v_lt_0 = --silent\nam__v_lt_1 = \nlibfstfar_la_LINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \\\n\t$(LIBTOOLFLAGS) --mode=link $(CXXLD) $(AM_CXXFLAGS) \\\n\t$(CXXFLAGS) $(libfstfar_la_LDFLAGS) $(LDFLAGS) -o $@\n@HAVE_SCRIPT_FALSE@am_libfstfar_la_rpath = -rpath $(libdir)\n@HAVE_SCRIPT_TRUE@am_libfstfar_la_rpath = -rpath $(libdir)\n@HAVE_SCRIPT_TRUE@libfstfarscript_la_DEPENDENCIES = libfstfar.la \\\n@HAVE_SCRIPT_TRUE@\t../../script/libfstscript.la \\\n@HAVE_SCRIPT_TRUE@\t../../lib/libfst.la $(am__DEPENDENCIES_1)\nam__libfstfarscript_la_SOURCES_DIST = far-class.cc farscript.cc \\\n\tgetters.cc script-impl.cc strings.cc\n@HAVE_SCRIPT_TRUE@am_libfstfarscript_la_OBJECTS = far-class.lo \\\n@HAVE_SCRIPT_TRUE@\tfarscript.lo getters.lo script-impl.lo \\\n@HAVE_SCRIPT_TRUE@\tstrings.lo\nlibfstfarscript_la_OBJECTS = $(am_libfstfarscript_la_OBJECTS)\nlibfstfarscript_la_LINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX \\\n\t$(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=link $(CXXLD) \\\n\t$(AM_CXXFLAGS) $(CXXFLAGS) $(libfstfarscript_la_LDFLAGS) \\\n\t$(LDFLAGS) -o $@\n@HAVE_SCRIPT_TRUE@am_libfstfarscript_la_rpath = -rpath $(libdir)\nPROGRAMS = $(bin_PROGRAMS)\nam__farcompilestrings_SOURCES_DIST = farcompilestrings.cc\n@HAVE_BIN_TRUE@am_farcompilestrings_OBJECTS =  \\\n@HAVE_BIN_TRUE@\tfarcompilestrings.$(OBJEXT)\nfarcompilestrings_OBJECTS = $(am_farcompilestrings_OBJECTS)\nfarcompilestrings_LDADD = $(LDADD)\n@HAVE_BIN_TRUE@farcompilestrings_DEPENDENCIES = libfstfarscript.la \\\n@HAVE_BIN_TRUE@\t../../script/libfstscript.la \\\n@HAVE_BIN_TRUE@\t../../lib/libfst.la $(am__DEPENDENCIES_1)\nam__farcreate_SOURCES_DIST = farcreate.cc\n@HAVE_BIN_TRUE@am_farcreate_OBJECTS = farcreate.$(OBJEXT)\nfarcreate_OBJECTS = $(am_farcreate_OBJECTS)\nfarcreate_LDADD = $(LDADD)\n@HAVE_BIN_TRUE@farcreate_DEPENDENCIES = libfstfarscript.la \\\n@HAVE_BIN_TRUE@\t../../script/libfstscript.la \\\n@HAVE_BIN_TRUE@\t../../lib/libfst.la $(am__DEPENDENCIES_1)\nam__farequal_SOURCES_DIST = farequal.cc\n@HAVE_BIN_TRUE@am_farequal_OBJECTS = farequal.$(OBJEXT)\nfarequal_OBJECTS = $(am_farequal_OBJECTS)\nfarequal_LDADD = $(LDADD)\n@HAVE_BIN_TRUE@farequal_DEPENDENCIES = libfstfarscript.la \\\n@HAVE_BIN_TRUE@\t../../script/libfstscript.la \\\n@HAVE_BIN_TRUE@\t../../lib/libfst.la $(am__DEPENDENCIES_1)\nam__farextract_SOURCES_DIST = farextract.cc\n@HAVE_BIN_TRUE@am_farextract_OBJECTS = farextract.$(OBJEXT)\nfarextract_OBJECTS = $(am_farextract_OBJECTS)\nfarextract_LDADD = $(LDADD)\n@HAVE_BIN_TRUE@farextract_DEPENDENCIES = libfstfarscript.la \\\n@HAVE_BIN_TRUE@\t../../script/libfstscript.la \\\n@HAVE_BIN_TRUE@\t../../lib/libfst.la $(am__DEPENDENCIES_1)\nam__farinfo_SOURCES_DIST = farinfo.cc\n@HAVE_BIN_TRUE@am_farinfo_OBJECTS = farinfo.$(OBJEXT)\nfarinfo_OBJECTS = $(am_farinfo_OBJECTS)\nfarinfo_LDADD = $(LDADD)\n@HAVE_BIN_TRUE@farinfo_DEPENDENCIES = libfstfarscript.la \\\n@HAVE_BIN_TRUE@\t../../script/libfstscript.la \\\n@HAVE_BIN_TRUE@\t../../lib/libfst.la $(am__DEPENDENCIES_1)\nam__farisomorphic_SOURCES_DIST = farisomorphic.cc\n@HAVE_BIN_TRUE@am_farisomorphic_OBJECTS = farisomorphic.$(OBJEXT)\nfarisomorphic_OBJECTS = $(am_farisomorphic_OBJECTS)\nfarisomorphic_LDADD = $(LDADD)\n@HAVE_BIN_TRUE@farisomorphic_DEPENDENCIES = libfstfarscript.la \\\n@HAVE_BIN_TRUE@\t../../script/libfstscript.la \\\n@HAVE_BIN_TRUE@\t../../lib/libfst.la $(am__DEPENDENCIES_1)\nam__farprintstrings_SOURCES_DIST = farprintstrings.cc\n@HAVE_BIN_TRUE@am_farprintstrings_OBJECTS = farprintstrings.$(OBJEXT)\nfarprintstrings_OBJECTS = $(am_farprintstrings_OBJECTS)\nfarprintstrings_LDADD = $(LDADD)\n@HAVE_BIN_TRUE@farprintstrings_DEPENDENCIES = libfstfarscript.la \\\n@HAVE_BIN_TRUE@\t../../script/libfstscript.la \\\n@HAVE_BIN_TRUE@\t../../lib/libfst.la $(am__DEPENDENCIES_1)\nAM_V_P = $(am__v_P_@AM_V@)\nam__v_P_ = $(am__v_P_@AM_DEFAULT_V@)\nam__v_P_0 = false\nam__v_P_1 = :\nAM_V_GEN = $(am__v_GEN_@AM_V@)\nam__v_GEN_ = $(am__v_GEN_@AM_DEFAULT_V@)\nam__v_GEN_0 = @echo \"  GEN     \" $@;\nam__v_GEN_1 = \nAM_V_at = $(am__v_at_@AM_V@)\nam__v_at_ = $(am__v_at_@AM_DEFAULT_V@)\nam__v_at_0 = @\nam__v_at_1 = \nDEFAULT_INCLUDES = \ndepcomp = $(SHELL) $(top_srcdir)/depcomp\nam__depfiles_maybe = depfiles\nam__mv = mv -f\nCXXCOMPILE = $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) \\\n\t$(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS)\nLTCXXCOMPILE = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \\\n\t$(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) \\\n\t$(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) \\\n\t$(AM_CXXFLAGS) $(CXXFLAGS)\nAM_V_CXX = $(am__v_CXX_@AM_V@)\nam__v_CXX_ = $(am__v_CXX_@AM_DEFAULT_V@)\nam__v_CXX_0 = @echo \"  CXX     \" $@;\nam__v_CXX_1 = \nCXXLD = $(CXX)\nCXXLINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \\\n\t$(LIBTOOLFLAGS) --mode=link $(CXXLD) $(AM_CXXFLAGS) \\\n\t$(CXXFLAGS) $(AM_LDFLAGS) $(LDFLAGS) -o $@\nAM_V_CXXLD = $(am__v_CXXLD_@AM_V@)\nam__v_CXXLD_ = $(am__v_CXXLD_@AM_DEFAULT_V@)\nam__v_CXXLD_0 = @echo \"  CXXLD   \" $@;\nam__v_CXXLD_1 = \nSOURCES = $(libfstfar_la_SOURCES) $(libfstfarscript_la_SOURCES) \\\n\t$(farcompilestrings_SOURCES) $(farcreate_SOURCES) \\\n\t$(farequal_SOURCES) $(farextract_SOURCES) $(farinfo_SOURCES) \\\n\t$(farisomorphic_SOURCES) $(farprintstrings_SOURCES)\nDIST_SOURCES = $(libfstfar_la_SOURCES) \\\n\t$(am__libfstfarscript_la_SOURCES_DIST) \\\n\t$(am__farcompilestrings_SOURCES_DIST) \\\n\t$(am__farcreate_SOURCES_DIST) $(am__farequal_SOURCES_DIST) \\\n\t$(am__farextract_SOURCES_DIST) $(am__farinfo_SOURCES_DIST) \\\n\t$(am__farisomorphic_SOURCES_DIST) \\\n\t$(am__farprintstrings_SOURCES_DIST)\nam__can_run_installinfo = \\\n  case $$AM_UPDATE_INFO_DIR in \\\n    n|no|NO) false;; \\\n    *) (install-info --version) >/dev/null 2>&1;; \\\n  esac\nam__tagged_files = $(HEADERS) $(SOURCES) $(TAGS_FILES) $(LISP)\n# Read a list of newline-separated strings from the standard input,\n# and print each of them once, without duplicates.  Input order is\n# *not* preserved.\nam__uniquify_input = $(AWK) '\\\n  BEGIN { nonempty = 0; } \\\n  { items[$$0] = 1; nonempty = 1; } \\\n  END { if (nonempty) { for (i in items) print i; }; } \\\n'\n# Make sure the list of sources is unique.  This is necessary because,\n# e.g., the same source file might be shared among _SOURCES variables\n# for different programs/libraries.\nam__define_uniq_tagged_files = \\\n  list='$(am__tagged_files)'; \\\n  unique=`for i in $$list; do \\\n    if test -f \"$$i\"; then echo $$i; else echo $(srcdir)/$$i; fi; \\\n  done | $(am__uniquify_input)`\nETAGS = etags\nCTAGS = ctags\nDISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST)\nACLOCAL = @ACLOCAL@\nAMTAR = @AMTAR@\nAM_DEFAULT_VERBOSITY = @AM_DEFAULT_VERBOSITY@\nAR = @AR@\nAUTOCONF = @AUTOCONF@\nAUTOHEADER = @AUTOHEADER@\nAUTOMAKE = @AUTOMAKE@\nAWK = @AWK@\nCC = @CC@\nCCDEPMODE = @CCDEPMODE@\nCFLAGS = @CFLAGS@\nCPP = @CPP@\nCPPFLAGS = @CPPFLAGS@\nCXX = @CXX@\nCXXCPP = @CXXCPP@\nCXXDEPMODE = @CXXDEPMODE@\nCXXFLAGS = @CXXFLAGS@\nCYGPATH_W = @CYGPATH_W@\nDEFS = @DEFS@\nDEPDIR = @DEPDIR@\nDLLTOOL = @DLLTOOL@\nDL_LIBS = @DL_LIBS@\nDSYMUTIL = @DSYMUTIL@\nDUMPBIN = @DUMPBIN@\nECHO_C = @ECHO_C@\nECHO_N = @ECHO_N@\nECHO_T = @ECHO_T@\nEGREP = @EGREP@\nEXEEXT = @EXEEXT@\nFGREP = @FGREP@\nGREP = @GREP@\nINSTALL = @INSTALL@\nINSTALL_DATA = @INSTALL_DATA@\nINSTALL_PROGRAM = @INSTALL_PROGRAM@\nINSTALL_SCRIPT = @INSTALL_SCRIPT@\nINSTALL_STRIP_PROGRAM = @INSTALL_STRIP_PROGRAM@\nLD = @LD@\nLDFLAGS = @LDFLAGS@\nLIBOBJS = @LIBOBJS@\nLIBS = @LIBS@\nLIBTOOL = @LIBTOOL@\nLIPO = @LIPO@\nLN_S = @LN_S@\nLTLIBOBJS = @LTLIBOBJS@\nMAKEINFO = @MAKEINFO@\nMANIFEST_TOOL = @MANIFEST_TOOL@\nMKDIR_P = @MKDIR_P@\nNM = @NM@\nNMEDIT = @NMEDIT@\nOBJDUMP = @OBJDUMP@\nOBJEXT = @OBJEXT@\nOTOOL = @OTOOL@\nOTOOL64 = @OTOOL64@\nPACKAGE = @PACKAGE@\nPACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@\nPACKAGE_NAME = @PACKAGE_NAME@\nPACKAGE_STRING = @PACKAGE_STRING@\nPACKAGE_TARNAME = @PACKAGE_TARNAME@\nPACKAGE_URL = @PACKAGE_URL@\nPACKAGE_VERSION = @PACKAGE_VERSION@\nPATH_SEPARATOR = @PATH_SEPARATOR@\nPYTHON = @PYTHON@\nPYTHON_CPPFLAGS = @PYTHON_CPPFLAGS@\nPYTHON_EXEC_PREFIX = @PYTHON_EXEC_PREFIX@\nPYTHON_EXTRA_LDFLAGS = @PYTHON_EXTRA_LDFLAGS@\nPYTHON_EXTRA_LIBS = @PYTHON_EXTRA_LIBS@\nPYTHON_LDFLAGS = @PYTHON_LDFLAGS@\nPYTHON_PLATFORM = @PYTHON_PLATFORM@\nPYTHON_PREFIX = @PYTHON_PREFIX@\nPYTHON_SITE_PKG = @PYTHON_SITE_PKG@\nPYTHON_VERSION = @PYTHON_VERSION@\nRANLIB = @RANLIB@\nSED = @SED@\nSET_MAKE = @SET_MAKE@\nSHELL = @SHELL@\nSTRIP = @STRIP@\nVERSION = @VERSION@\nabs_builddir = @abs_builddir@\nabs_srcdir = @abs_srcdir@\nabs_top_builddir = @abs_top_builddir@\nabs_top_srcdir = @abs_top_srcdir@\nac_ct_AR = @ac_ct_AR@\nac_ct_CC = @ac_ct_CC@\nac_ct_CXX = @ac_ct_CXX@\nac_ct_DUMPBIN = @ac_ct_DUMPBIN@\nam__include = @am__include@\nam__leading_dot = @am__leading_dot@\nam__quote = @am__quote@\nam__tar = @am__tar@\nam__untar = @am__untar@\nbindir = @bindir@\nbuild = @build@\nbuild_alias = @build_alias@\nbuild_cpu = @build_cpu@\nbuild_os = @build_os@\nbuild_vendor = @build_vendor@\nbuilddir = @builddir@\ndatadir = @datadir@\ndatarootdir = @datarootdir@\ndocdir = @docdir@\ndvidir = @dvidir@\nexec_prefix = @exec_prefix@\nhost = @host@\nhost_alias = @host_alias@\nhost_cpu = @host_cpu@\nhost_os = @host_os@\nhost_vendor = @host_vendor@\nhtmldir = @htmldir@\nincludedir = @includedir@\ninfodir = @infodir@\ninstall_sh = @install_sh@\nlibdir = @libdir@\nlibexecdir = @libexecdir@\nlibfstdir = @libfstdir@\nlocaledir = @localedir@\nlocalstatedir = @localstatedir@\nmandir = @mandir@\nmkdir_p = @mkdir_p@\noldincludedir = @oldincludedir@\npdfdir = @pdfdir@\npkgpyexecdir = @pkgpyexecdir@\npkgpythondir = @pkgpythondir@\nprefix = @prefix@\nprogram_transform_name = @program_transform_name@\npsdir = @psdir@\npyexecdir = @pyexecdir@\npythondir = @pythondir@\nsbindir = @sbindir@\nsharedstatedir = @sharedstatedir@\nsrcdir = @srcdir@\nsysconfdir = @sysconfdir@\ntarget_alias = @target_alias@\ntop_build_prefix = @top_build_prefix@\ntop_builddir = @top_builddir@\ntop_srcdir = @top_srcdir@\nAM_CPPFLAGS = -I$(srcdir)/../../include $(ICU_CPPFLAGS)\n@HAVE_SCRIPT_FALSE@lib_LTLIBRARIES = libfstfar.la\n@HAVE_SCRIPT_TRUE@lib_LTLIBRARIES = libfstfar.la libfstfarscript.la\nlibfstfar_la_SOURCES = sttable.cc stlist.cc\nlibfstfar_la_LDFLAGS = -version-info 10:0:0\nlibfstfar_la_LIBADD = ../../lib/libfst.la -lm $(DL_LIBS)\n@HAVE_SCRIPT_TRUE@libfstfarscript_la_SOURCES = far-class.cc farscript.cc getters.cc script-impl.cc \\\n@HAVE_SCRIPT_TRUE@                             strings.cc\n\n@HAVE_SCRIPT_TRUE@libfstfarscript_la_LDFLAGS = -version-info 10:0:0\n@HAVE_SCRIPT_TRUE@libfstfarscript_la_LIBADD = \\\n@HAVE_SCRIPT_TRUE@    libfstfar.la ../../script/libfstscript.la \\\n@HAVE_SCRIPT_TRUE@        ../../lib/libfst.la -lm $(DL_LIBS)\n\n@HAVE_BIN_TRUE@LDADD = libfstfarscript.la ../../script/libfstscript.la \\\n@HAVE_BIN_TRUE@        ../../lib/libfst.la -lm $(DL_LIBS)\n\n@HAVE_BIN_TRUE@farcompilestrings_SOURCES = farcompilestrings.cc\n@HAVE_BIN_TRUE@farcreate_SOURCES = farcreate.cc\n@HAVE_BIN_TRUE@farequal_SOURCES = farequal.cc\n@HAVE_BIN_TRUE@farextract_SOURCES = farextract.cc\n@HAVE_BIN_TRUE@farinfo_SOURCES = farinfo.cc\n@HAVE_BIN_TRUE@farisomorphic_SOURCES = farisomorphic.cc\n@HAVE_BIN_TRUE@farprintstrings_SOURCES = farprintstrings.cc\nall: all-am\n\n.SUFFIXES:\n.SUFFIXES: .cc .lo .o .obj\n$(srcdir)/Makefile.in:  $(srcdir)/Makefile.am  $(am__configure_deps)\n\t@for dep in $?; do \\\n\t  case '$(am__configure_deps)' in \\\n\t    *$$dep*) \\\n\t      ( cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh ) \\\n\t        && { if test -f $@; then exit 0; else break; fi; }; \\\n\t      exit 1;; \\\n\t  esac; \\\n\tdone; \\\n\techo ' cd $(top_srcdir) && $(AUTOMAKE) --foreign src/extensions/far/Makefile'; \\\n\t$(am__cd) $(top_srcdir) && \\\n\t  $(AUTOMAKE) --foreign src/extensions/far/Makefile\n.PRECIOUS: Makefile\nMakefile: $(srcdir)/Makefile.in $(top_builddir)/config.status\n\t@case '$?' in \\\n\t  *config.status*) \\\n\t    cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh;; \\\n\t  *) \\\n\t    echo ' cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe)'; \\\n\t    cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe);; \\\n\tesac;\n\n$(top_builddir)/config.status: $(top_srcdir)/configure $(CONFIG_STATUS_DEPENDENCIES)\n\tcd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh\n\n$(top_srcdir)/configure:  $(am__configure_deps)\n\tcd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh\n$(ACLOCAL_M4):  $(am__aclocal_m4_deps)\n\tcd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh\n$(am__aclocal_m4_deps):\n\ninstall-libLTLIBRARIES: $(lib_LTLIBRARIES)\n\t@$(NORMAL_INSTALL)\n\t@list='$(lib_LTLIBRARIES)'; test -n \"$(libdir)\" || list=; \\\n\tlist2=; for p in $$list; do \\\n\t  if test -f $$p; then \\\n\t    list2=\"$$list2 $$p\"; \\\n\t  else :; fi; \\\n\tdone; \\\n\ttest -z \"$$list2\" || { \\\n\t  echo \" $(MKDIR_P) '$(DESTDIR)$(libdir)'\"; \\\n\t  $(MKDIR_P) \"$(DESTDIR)$(libdir)\" || exit 1; \\\n\t  echo \" $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) $$list2 '$(DESTDIR)$(libdir)'\"; \\\n\t  $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) $$list2 \"$(DESTDIR)$(libdir)\"; \\\n\t}\n\nuninstall-libLTLIBRARIES:\n\t@$(NORMAL_UNINSTALL)\n\t@list='$(lib_LTLIBRARIES)'; test -n \"$(libdir)\" || list=; \\\n\tfor p in $$list; do \\\n\t  $(am__strip_dir) \\\n\t  echo \" $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=uninstall rm -f '$(DESTDIR)$(libdir)/$$f'\"; \\\n\t  $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=uninstall rm -f \"$(DESTDIR)$(libdir)/$$f\"; \\\n\tdone\n\nclean-libLTLIBRARIES:\n\t-test -z \"$(lib_LTLIBRARIES)\" || rm -f $(lib_LTLIBRARIES)\n\t@list='$(lib_LTLIBRARIES)'; \\\n\tlocs=`for p in $$list; do echo $$p; done | \\\n\t      sed 's|^[^/]*$$|.|; s|/[^/]*$$||; s|$$|/so_locations|' | \\\n\t      sort -u`; \\\n\ttest -z \"$$locs\" || { \\\n\t  echo rm -f $${locs}; \\\n\t  rm -f $${locs}; \\\n\t}\n\nlibfstfar.la: $(libfstfar_la_OBJECTS) $(libfstfar_la_DEPENDENCIES) $(EXTRA_libfstfar_la_DEPENDENCIES) \n\t$(AM_V_CXXLD)$(libfstfar_la_LINK) $(am_libfstfar_la_rpath) $(libfstfar_la_OBJECTS) $(libfstfar_la_LIBADD) $(LIBS)\n\nlibfstfarscript.la: $(libfstfarscript_la_OBJECTS) $(libfstfarscript_la_DEPENDENCIES) $(EXTRA_libfstfarscript_la_DEPENDENCIES) \n\t$(AM_V_CXXLD)$(libfstfarscript_la_LINK) $(am_libfstfarscript_la_rpath) $(libfstfarscript_la_OBJECTS) $(libfstfarscript_la_LIBADD) $(LIBS)\ninstall-binPROGRAMS: $(bin_PROGRAMS)\n\t@$(NORMAL_INSTALL)\n\t@list='$(bin_PROGRAMS)'; test -n \"$(bindir)\" || list=; \\\n\tif test -n \"$$list\"; then \\\n\t  echo \" $(MKDIR_P) '$(DESTDIR)$(bindir)'\"; \\\n\t  $(MKDIR_P) \"$(DESTDIR)$(bindir)\" || exit 1; \\\n\tfi; \\\n\tfor p in $$list; do echo \"$$p $$p\"; done | \\\n\tsed 's/$(EXEEXT)$$//' | \\\n\twhile read p p1; do if test -f $$p \\\n\t || test -f $$p1 \\\n\t  ; then echo \"$$p\"; echo \"$$p\"; else :; fi; \\\n\tdone | \\\n\tsed -e 'p;s,.*/,,;n;h' \\\n\t    -e 's|.*|.|' \\\n\t    -e 'p;x;s,.*/,,;s/$(EXEEXT)$$//;$(transform);s/$$/$(EXEEXT)/' | \\\n\tsed 'N;N;N;s,\\n, ,g' | \\\n\t$(AWK) 'BEGIN { files[\".\"] = \"\"; dirs[\".\"] = 1 } \\\n\t  { d=$$3; if (dirs[d] != 1) { print \"d\", d; dirs[d] = 1 } \\\n\t    if ($$2 == $$4) files[d] = files[d] \" \" $$1; \\\n\t    else { print \"f\", $$3 \"/\" $$4, $$1; } } \\\n\t  END { for (d in files) print \"f\", d, files[d] }' | \\\n\twhile read type dir files; do \\\n\t    if test \"$$dir\" = .; then dir=; else dir=/$$dir; fi; \\\n\t    test -z \"$$files\" || { \\\n\t    echo \" $(INSTALL_PROGRAM_ENV) $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL_PROGRAM) $$files '$(DESTDIR)$(bindir)$$dir'\"; \\\n\t    $(INSTALL_PROGRAM_ENV) $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL_PROGRAM) $$files \"$(DESTDIR)$(bindir)$$dir\" || exit $$?; \\\n\t    } \\\n\t; done\n\nuninstall-binPROGRAMS:\n\t@$(NORMAL_UNINSTALL)\n\t@list='$(bin_PROGRAMS)'; test -n \"$(bindir)\" || list=; \\\n\tfiles=`for p in $$list; do echo \"$$p\"; done | \\\n\t  sed -e 'h;s,^.*/,,;s/$(EXEEXT)$$//;$(transform)' \\\n\t      -e 's/$$/$(EXEEXT)/' \\\n\t`; \\\n\ttest -n \"$$list\" || exit 0; \\\n\techo \" ( cd '$(DESTDIR)$(bindir)' && rm -f\" $$files \")\"; \\\n\tcd \"$(DESTDIR)$(bindir)\" && rm -f $$files\n\nclean-binPROGRAMS:\n\t@list='$(bin_PROGRAMS)'; test -n \"$$list\" || exit 0; \\\n\techo \" rm -f\" $$list; \\\n\trm -f $$list || exit $$?; \\\n\ttest -n \"$(EXEEXT)\" || exit 0; \\\n\tlist=`for p in $$list; do echo \"$$p\"; done | sed 's/$(EXEEXT)$$//'`; \\\n\techo \" rm -f\" $$list; \\\n\trm -f $$list\n\nfarcompilestrings$(EXEEXT): $(farcompilestrings_OBJECTS) $(farcompilestrings_DEPENDENCIES) $(EXTRA_farcompilestrings_DEPENDENCIES) \n\t@rm -f farcompilestrings$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(farcompilestrings_OBJECTS) $(farcompilestrings_LDADD) $(LIBS)\n\nfarcreate$(EXEEXT): $(farcreate_OBJECTS) $(farcreate_DEPENDENCIES) $(EXTRA_farcreate_DEPENDENCIES) \n\t@rm -f farcreate$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(farcreate_OBJECTS) $(farcreate_LDADD) $(LIBS)\n\nfarequal$(EXEEXT): $(farequal_OBJECTS) $(farequal_DEPENDENCIES) $(EXTRA_farequal_DEPENDENCIES) \n\t@rm -f farequal$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(farequal_OBJECTS) $(farequal_LDADD) $(LIBS)\n\nfarextract$(EXEEXT): $(farextract_OBJECTS) $(farextract_DEPENDENCIES) $(EXTRA_farextract_DEPENDENCIES) \n\t@rm -f farextract$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(farextract_OBJECTS) $(farextract_LDADD) $(LIBS)\n\nfarinfo$(EXEEXT): $(farinfo_OBJECTS) $(farinfo_DEPENDENCIES) $(EXTRA_farinfo_DEPENDENCIES) \n\t@rm -f farinfo$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(farinfo_OBJECTS) $(farinfo_LDADD) $(LIBS)\n\nfarisomorphic$(EXEEXT): $(farisomorphic_OBJECTS) $(farisomorphic_DEPENDENCIES) $(EXTRA_farisomorphic_DEPENDENCIES) \n\t@rm -f farisomorphic$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(farisomorphic_OBJECTS) $(farisomorphic_LDADD) $(LIBS)\n\nfarprintstrings$(EXEEXT): $(farprintstrings_OBJECTS) $(farprintstrings_DEPENDENCIES) $(EXTRA_farprintstrings_DEPENDENCIES) \n\t@rm -f farprintstrings$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(farprintstrings_OBJECTS) $(farprintstrings_LDADD) $(LIBS)\n\nmostlyclean-compile:\n\t-rm -f *.$(OBJEXT)\n\ndistclean-compile:\n\t-rm -f *.tab.c\n\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/far-class.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/farcompilestrings.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/farcreate.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/farequal.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/farextract.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/farinfo.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/farisomorphic.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/farprintstrings.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/farscript.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/getters.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/script-impl.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/stlist.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/strings.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/sttable.Plo@am__quote@\n\n.cc.o:\n@am__fastdepCXX_TRUE@\t$(AM_V_CXX)depbase=`echo $@ | sed 's|[^/]*$$|$(DEPDIR)/&|;s|\\.o$$||'`;\\\n@am__fastdepCXX_TRUE@\t$(CXXCOMPILE) -MT $@ -MD -MP -MF $$depbase.Tpo -c -o $@ $< &&\\\n@am__fastdepCXX_TRUE@\t$(am__mv) $$depbase.Tpo $$depbase.Po\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\t$(AM_V_CXX)source='$<' object='$@' libtool=no @AMDEPBACKSLASH@\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\tDEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@\n@am__fastdepCXX_FALSE@\t$(AM_V_CXX@am__nodep@)$(CXXCOMPILE) -c -o $@ $<\n\n.cc.obj:\n@am__fastdepCXX_TRUE@\t$(AM_V_CXX)depbase=`echo $@ | sed 's|[^/]*$$|$(DEPDIR)/&|;s|\\.obj$$||'`;\\\n@am__fastdepCXX_TRUE@\t$(CXXCOMPILE) -MT $@ -MD -MP -MF $$depbase.Tpo -c -o $@ `$(CYGPATH_W) '$<'` &&\\\n@am__fastdepCXX_TRUE@\t$(am__mv) $$depbase.Tpo $$depbase.Po\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\t$(AM_V_CXX)source='$<' object='$@' libtool=no @AMDEPBACKSLASH@\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\tDEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@\n@am__fastdepCXX_FALSE@\t$(AM_V_CXX@am__nodep@)$(CXXCOMPILE) -c -o $@ `$(CYGPATH_W) '$<'`\n\n.cc.lo:\n@am__fastdepCXX_TRUE@\t$(AM_V_CXX)depbase=`echo $@ | sed 's|[^/]*$$|$(DEPDIR)/&|;s|\\.lo$$||'`;\\\n@am__fastdepCXX_TRUE@\t$(LTCXXCOMPILE) -MT $@ -MD -MP -MF $$depbase.Tpo -c -o $@ $< &&\\\n@am__fastdepCXX_TRUE@\t$(am__mv) $$depbase.Tpo $$depbase.Plo\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\t$(AM_V_CXX)source='$<' object='$@' libtool=yes @AMDEPBACKSLASH@\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\tDEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@\n@am__fastdepCXX_FALSE@\t$(AM_V_CXX@am__nodep@)$(LTCXXCOMPILE) -c -o $@ $<\n\nmostlyclean-libtool:\n\t-rm -f *.lo\n\nclean-libtool:\n\t-rm -rf .libs _libs\n\nID: $(am__tagged_files)\n\t$(am__define_uniq_tagged_files); mkid -fID $$unique\ntags: tags-am\nTAGS: tags\n\ntags-am: $(TAGS_DEPENDENCIES) $(am__tagged_files)\n\tset x; \\\n\there=`pwd`; \\\n\t$(am__define_uniq_tagged_files); \\\n\tshift; \\\n\tif test -z \"$(ETAGS_ARGS)$$*$$unique\"; then :; else \\\n\t  test -n \"$$unique\" || unique=$$empty_fix; \\\n\t  if test $$# -gt 0; then \\\n\t    $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \\\n\t      \"$$@\" $$unique; \\\n\t  else \\\n\t    $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \\\n\t      $$unique; \\\n\t  fi; \\\n\tfi\nctags: ctags-am\n\nCTAGS: ctags\nctags-am: $(TAGS_DEPENDENCIES) $(am__tagged_files)\n\t$(am__define_uniq_tagged_files); \\\n\ttest -z \"$(CTAGS_ARGS)$$unique\" \\\n\t  || $(CTAGS) $(CTAGSFLAGS) $(AM_CTAGSFLAGS) $(CTAGS_ARGS) \\\n\t     $$unique\n\nGTAGS:\n\there=`$(am__cd) $(top_builddir) && pwd` \\\n\t  && $(am__cd) $(top_srcdir) \\\n\t  && gtags -i $(GTAGS_ARGS) \"$$here\"\ncscopelist: cscopelist-am\n\ncscopelist-am: $(am__tagged_files)\n\tlist='$(am__tagged_files)'; \\\n\tcase \"$(srcdir)\" in \\\n\t  [\\\\/]* | ?:[\\\\/]*) sdir=\"$(srcdir)\" ;; \\\n\t  *) sdir=$(subdir)/$(srcdir) ;; \\\n\tesac; \\\n\tfor i in $$list; do \\\n\t  if test -f \"$$i\"; then \\\n\t    echo \"$(subdir)/$$i\"; \\\n\t  else \\\n\t    echo \"$$sdir/$$i\"; \\\n\t  fi; \\\n\tdone >> $(top_builddir)/cscope.files\n\ndistclean-tags:\n\t-rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags\n\ndistdir: $(DISTFILES)\n\t@srcdirstrip=`echo \"$(srcdir)\" | sed 's/[].[^$$\\\\*]/\\\\\\\\&/g'`; \\\n\ttopsrcdirstrip=`echo \"$(top_srcdir)\" | sed 's/[].[^$$\\\\*]/\\\\\\\\&/g'`; \\\n\tlist='$(DISTFILES)'; \\\n\t  dist_files=`for file in $$list; do echo $$file; done | \\\n\t  sed -e \"s|^$$srcdirstrip/||;t\" \\\n\t      -e \"s|^$$topsrcdirstrip/|$(top_builddir)/|;t\"`; \\\n\tcase $$dist_files in \\\n\t  */*) $(MKDIR_P) `echo \"$$dist_files\" | \\\n\t\t\t   sed '/\\//!d;s|^|$(distdir)/|;s,/[^/]*$$,,' | \\\n\t\t\t   sort -u` ;; \\\n\tesac; \\\n\tfor file in $$dist_files; do \\\n\t  if test -f $$file || test -d $$file; then d=.; else d=$(srcdir); fi; \\\n\t  if test -d $$d/$$file; then \\\n\t    dir=`echo \"/$$file\" | sed -e 's,/[^/]*$$,,'`; \\\n\t    if test -d \"$(distdir)/$$file\"; then \\\n\t      find \"$(distdir)/$$file\" -type d ! -perm -700 -exec chmod u+rwx {} \\;; \\\n\t    fi; \\\n\t    if test -d $(srcdir)/$$file && test $$d != $(srcdir); then \\\n\t      cp -fpR $(srcdir)/$$file \"$(distdir)$$dir\" || exit 1; \\\n\t      find \"$(distdir)/$$file\" -type d ! -perm -700 -exec chmod u+rwx {} \\;; \\\n\t    fi; \\\n\t    cp -fpR $$d/$$file \"$(distdir)$$dir\" || exit 1; \\\n\t  else \\\n\t    test -f \"$(distdir)/$$file\" \\\n\t    || cp -p $$d/$$file \"$(distdir)/$$file\" \\\n\t    || exit 1; \\\n\t  fi; \\\n\tdone\ncheck-am: all-am\ncheck: check-am\nall-am: Makefile $(LTLIBRARIES) $(PROGRAMS)\ninstall-binPROGRAMS: install-libLTLIBRARIES\n\ninstalldirs:\n\tfor dir in \"$(DESTDIR)$(libdir)\" \"$(DESTDIR)$(bindir)\"; do \\\n\t  test -z \"$$dir\" || $(MKDIR_P) \"$$dir\"; \\\n\tdone\ninstall: install-am\ninstall-exec: install-exec-am\ninstall-data: install-data-am\nuninstall: uninstall-am\n\ninstall-am: all-am\n\t@$(MAKE) $(AM_MAKEFLAGS) install-exec-am install-data-am\n\ninstallcheck: installcheck-am\ninstall-strip:\n\tif test -z '$(STRIP)'; then \\\n\t  $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" \\\n\t    install_sh_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" INSTALL_STRIP_FLAG=-s \\\n\t      install; \\\n\telse \\\n\t  $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" \\\n\t    install_sh_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" INSTALL_STRIP_FLAG=-s \\\n\t    \"INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'\" install; \\\n\tfi\nmostlyclean-generic:\n\nclean-generic:\n\ndistclean-generic:\n\t-test -z \"$(CONFIG_CLEAN_FILES)\" || rm -f $(CONFIG_CLEAN_FILES)\n\t-test . = \"$(srcdir)\" || test -z \"$(CONFIG_CLEAN_VPATH_FILES)\" || rm -f $(CONFIG_CLEAN_VPATH_FILES)\n\nmaintainer-clean-generic:\n\t@echo \"This command is intended for maintainers to use\"\n\t@echo \"it deletes files that may require special tools to rebuild.\"\nclean: clean-am\n\nclean-am: clean-binPROGRAMS clean-generic clean-libLTLIBRARIES \\\n\tclean-libtool mostlyclean-am\n\ndistclean: distclean-am\n\t-rm -rf ./$(DEPDIR)\n\t-rm -f Makefile\ndistclean-am: clean-am distclean-compile distclean-generic \\\n\tdistclean-tags\n\ndvi: dvi-am\n\ndvi-am:\n\nhtml: html-am\n\nhtml-am:\n\ninfo: info-am\n\ninfo-am:\n\ninstall-data-am:\n\ninstall-dvi: install-dvi-am\n\ninstall-dvi-am:\n\ninstall-exec-am: install-binPROGRAMS install-libLTLIBRARIES\n\ninstall-html: install-html-am\n\ninstall-html-am:\n\ninstall-info: install-info-am\n\ninstall-info-am:\n\ninstall-man:\n\ninstall-pdf: install-pdf-am\n\ninstall-pdf-am:\n\ninstall-ps: install-ps-am\n\ninstall-ps-am:\n\ninstallcheck-am:\n\nmaintainer-clean: maintainer-clean-am\n\t-rm -rf ./$(DEPDIR)\n\t-rm -f Makefile\nmaintainer-clean-am: distclean-am maintainer-clean-generic\n\nmostlyclean: mostlyclean-am\n\nmostlyclean-am: mostlyclean-compile mostlyclean-generic \\\n\tmostlyclean-libtool\n\npdf: pdf-am\n\npdf-am:\n\nps: ps-am\n\nps-am:\n\nuninstall-am: uninstall-binPROGRAMS uninstall-libLTLIBRARIES\n\n.MAKE: install-am install-strip\n\n.PHONY: CTAGS GTAGS TAGS all all-am check check-am clean \\\n\tclean-binPROGRAMS clean-generic clean-libLTLIBRARIES \\\n\tclean-libtool cscopelist-am ctags ctags-am distclean \\\n\tdistclean-compile distclean-generic distclean-libtool \\\n\tdistclean-tags distdir dvi dvi-am html html-am info info-am \\\n\tinstall install-am install-binPROGRAMS install-data \\\n\tinstall-data-am install-dvi install-dvi-am install-exec \\\n\tinstall-exec-am install-html install-html-am install-info \\\n\tinstall-info-am install-libLTLIBRARIES install-man install-pdf \\\n\tinstall-pdf-am install-ps install-ps-am install-strip \\\n\tinstallcheck installcheck-am installdirs maintainer-clean \\\n\tmaintainer-clean-generic mostlyclean mostlyclean-compile \\\n\tmostlyclean-generic mostlyclean-libtool pdf pdf-am ps ps-am \\\n\ttags tags-am uninstall uninstall-am uninstall-binPROGRAMS \\\n\tuninstall-libLTLIBRARIES\n\n\n# Tell versions [3.59,3.63) of GNU make to not export all variables.\n# Otherwise a system limit (for SysV at least) may be exceeded.\n.NOEXPORT:\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/extensions/far/far-class.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/extensions/far/far-class.h>\n\n#include <fst/script/script-impl.h>\n#include <fst/extensions/far/script-impl.h>\n\nnamespace fst {\nnamespace script {\n\n\n// FarReaderClass.\n\nFarReaderClass *FarReaderClass::Open(const string &filename) {\n  OpenFarReaderClassArgs1 args(filename);\n  args.retval = nullptr;\n  Apply<Operation<OpenFarReaderClassArgs1>>(\"OpenFarReaderClass\",\n                                            LoadArcTypeFromFar(filename),\n                                            &args);\n  return args.retval;\n}\n\nFarReaderClass *FarReaderClass::Open(const std::vector<string> &filenames) {\n  if (filenames.empty()) {\n    LOG(ERROR) << \"FarReaderClass::Open: No files specified\";\n    return nullptr;\n  }\n  auto it = filenames.cbegin();\n  const auto arc_type = LoadArcTypeFromFar(*it);\n  if (arc_type.empty()) return nullptr;\n  // FIXME(kbg): Is any of this really necessary? I am doing this purely\n  // to conform to what I did with fst::script::Replace.\n  ++it;\n  for (; it != filenames.cend(); ++it) {\n    const string other_arc_type = LoadArcTypeFromFar(*it);\n    if (other_arc_type.empty()) return nullptr;\n    if (arc_type != other_arc_type) {\n      LOG(ERROR) << \"FarReaderClass::Open: Trying to open FARs with \"\n                 << \"non-matching arc types:\\n\\t\" << arc_type << \" and \"\n                 << other_arc_type;\n      return nullptr;\n    }\n  }\n  OpenFarReaderClassArgs2 args(filenames);\n  args.retval = nullptr;\n  Apply<Operation<OpenFarReaderClassArgs2>>(\"OpenFarReaderClass\", arc_type,\n                                            &args);\n  return args.retval;\n}\n\nREGISTER_FST_OPERATION(OpenFarReaderClass, StdArc, OpenFarReaderClassArgs1);\nREGISTER_FST_OPERATION(OpenFarReaderClass, LogArc, OpenFarReaderClassArgs1);\nREGISTER_FST_OPERATION(OpenFarReaderClass, Log64Arc, OpenFarReaderClassArgs1);\n\nREGISTER_FST_OPERATION(OpenFarReaderClass, StdArc, OpenFarReaderClassArgs2);\nREGISTER_FST_OPERATION(OpenFarReaderClass, LogArc, OpenFarReaderClassArgs2);\nREGISTER_FST_OPERATION(OpenFarReaderClass, Log64Arc, OpenFarReaderClassArgs2);\n\n// FarWriterClass.\n\nFarWriterClass *FarWriterClass::Create(const string &filename,\n                                       const string &arc_type, FarType type) {\n  CreateFarWriterClassInnerArgs iargs(filename, type);\n  CreateFarWriterClassArgs args(iargs);\n  args.retval = nullptr;\n  Apply<Operation<CreateFarWriterClassArgs>>(\"CreateFarWriterClass\", arc_type,\n                                             &args);\n  return args.retval;\n}\n\nREGISTER_FST_OPERATION(CreateFarWriterClass, StdArc, CreateFarWriterClassArgs);\nREGISTER_FST_OPERATION(CreateFarWriterClass, LogArc, CreateFarWriterClassArgs);\nREGISTER_FST_OPERATION(CreateFarWriterClass, Log64Arc,\n                       CreateFarWriterClassArgs);\n\n}  // namespace script\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/extensions/far/farcompilestrings.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Compiles a set of stings as FSTs and stores them in a finite-state archive.\n\n#include <string>\n#include <vector>\n\n#include <fst/flags.h>\n#include <fst/extensions/far/farscript.h>\n#include <fst/extensions/far/getters.h>\n#include <fstream>\n\nDEFINE_string(key_prefix, \"\", \"Prefix to append to keys\");\nDEFINE_string(key_suffix, \"\", \"Suffix to append to keys\");\nDEFINE_int32(generate_keys, 0,\n             \"Generate N digit numeric keys (def: use file basenames)\");\nDEFINE_string(far_type, \"default\",\n              \"FAR file format type: one of: \\\"default\\\", \\\"fst\\\", \"\n              \"\\\"stlist\\\", \\\"sttable\\\"\");\nDEFINE_bool(allow_negative_labels, false,\n            \"Allow negative labels (not recommended; may cause conflicts)\");\nDEFINE_string(arc_type, \"standard\", \"Output arc type\");\nDEFINE_string(entry_type, \"line\",\n              \"Entry type: one of : \"\n              \"\\\"file\\\" (one FST per file), \\\"line\\\" (one FST per line)\");\nDEFINE_string(fst_type, \"vector\", \"Output FST type\");\nDEFINE_string(token_type, \"symbol\",\n              \"Token type: one of : \"\n              \"\\\"symbol\\\", \\\"byte\\\", \\\"utf8\\\"\");\nDEFINE_string(symbols, \"\", \"Label symbol table\");\nDEFINE_string(unknown_symbol, \"\", \"\");\nDEFINE_bool(file_list_input, false,\n            \"Each input file contains a list of files to be processed\");\nDEFINE_bool(keep_symbols, false, \"Store symbol table in the FAR file\");\nDEFINE_bool(initial_symbols, true,\n            \"When keep_symbols is true, stores symbol table only for the first\"\n            \" FST in archive.\");\n\nint main(int argc, char **argv) {\n  namespace s = fst::script;\n\n  string usage = \"Compiles a set of strings as FSTs and stores them in\";\n  usage += \" a finite-state archive.\\n\\n  Usage:\";\n  usage += argv[0];\n  usage += \" [in1.txt [[in2.txt ...] out.far]]\\n\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n  s::ExpandArgs(argc, argv, &argc, &argv);\n\n  std::vector<string> in_fnames;\n  if (FLAGS_file_list_input) {\n    for (int i = 1; i < argc - 1; ++i) {\n      std::ifstream istrm(argv[i]);\n      string str;\n      while (getline(istrm, str)) in_fnames.push_back(str);\n    }\n  } else {\n    for (int i = 1; i < argc - 1; ++i)\n      in_fnames.push_back(argv[i]);\n  }\n  if (in_fnames.empty()) {\n    in_fnames.push_back(argc == 2 && strcmp(argv[1], \"-\") != 0 ? argv[1] : \"\");\n  }\n\n  string out_fname =\n      argc > 2 && strcmp(argv[argc - 1], \"-\") != 0 ? argv[argc - 1] : \"\";\n\n  fst::FarEntryType entry_type;\n  if (!s::GetFarEntryType(FLAGS_entry_type, &entry_type)) {\n    LOG(ERROR) << \"Unknown or unsupported FAR entry type: \" << FLAGS_entry_type;\n    return 1;\n  }\n\n  fst::FarTokenType token_type;\n  if (!s::GetFarTokenType(FLAGS_token_type, &token_type)) {\n    LOG(ERROR) << \"Unkonwn or unsupported FAR token type: \" << FLAGS_token_type;\n    return 1;\n  }\n\n  const auto far_type = s::GetFarType(FLAGS_far_type);\n\n  s::FarCompileStrings(in_fnames, out_fname, FLAGS_arc_type, FLAGS_fst_type,\n                       far_type, FLAGS_generate_keys, entry_type, token_type,\n                       FLAGS_symbols, FLAGS_unknown_symbol, FLAGS_keep_symbols,\n                       FLAGS_initial_symbols, FLAGS_allow_negative_labels,\n                       FLAGS_key_prefix, FLAGS_key_suffix);\n\n  return 0;\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/extensions/far/farcreate.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Creates a finite-state archive from input FSTs.\n\n#include <string>\n#include <vector>\n\n#include <fst/flags.h>\n#include <fst/extensions/far/farscript.h>\n#include <fst/extensions/far/getters.h>\n#include <fstream>\n\nDEFINE_string(key_prefix, \"\", \"Prefix to append to keys\");\nDEFINE_string(key_suffix, \"\", \"Suffix to append to keys\");\nDEFINE_int32(generate_keys, 0,\n             \"Generate N digit numeric keys (def: use file basenames)\");\nDEFINE_string(far_type, \"default\",\n              \"FAR file format type: one of: \\\"default\\\", \"\n              \"\\\"stlist\\\", \\\"sttable\\\"\");\nDEFINE_bool(file_list_input, false,\n            \"Each input file contains a list of files to be processed\");\n\nint main(int argc, char **argv) {\n  namespace s = fst::script;\n\n  string usage = \"Creates a finite-state archive from input FSTs.\\n\\n Usage:\";\n  usage += argv[0];\n  usage += \" [in1.fst [[in2.fst ...] out.far]]\\n\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n  s::ExpandArgs(argc, argv, &argc, &argv);\n\n  std::vector<string> in_fnames;\n  if (FLAGS_file_list_input) {\n    for (int i = 1; i < argc - 1; ++i) {\n      std::ifstream istrm(argv[i]);\n      string str;\n      while (getline(istrm, str)) in_fnames.push_back(str);\n    }\n  } else {\n    for (int i = 1; i < argc - 1; ++i)\n      in_fnames.push_back(argv[i]);\n  }\n  if (in_fnames.empty())\n    in_fnames.push_back(argc == 2 && strcmp(argv[1], \"-\") != 0 ? argv[1] : \"\");\n\n  string out_fname =\n      argc > 2 && strcmp(argv[argc - 1], \"-\") != 0 ? argv[argc - 1] : \"\";\n\n  const auto arc_type = s::LoadArcTypeFromFst(in_fnames[0]);\n  if (arc_type.empty()) return 1;\n\n  const auto far_type = s::GetFarType(FLAGS_far_type);\n\n  s::FarCreate(in_fnames, out_fname, arc_type, FLAGS_generate_keys, far_type,\n               FLAGS_key_prefix, FLAGS_key_suffix);\n\n  return 0;\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/extensions/far/farequal.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Tests if two Far files contains the same (key,fst) pairs.\n\n#include <string>\n\n#include <fst/flags.h>\n#include <fst/extensions/far/farscript.h>\n#include <fst/extensions/far/getters.h>\n\nDEFINE_string(begin_key, \"\",\n              \"First key to extract (def: first key in archive)\");\nDEFINE_string(end_key, \"\", \"Last key to extract (def: last key in archive)\");\nDEFINE_double(delta, fst::kDelta, \"Comparison/quantization delta\");\n\nint main(int argc, char **argv) {\n  namespace s = fst::script;\n\n  string usage = \"Compares the FSTs in two FST archives for equality.\";\n  usage += \"\\n\\n  Usage:\";\n  usage += argv[0];\n  usage += \" in1.far in2.far\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n  s::ExpandArgs(argc, argv, &argc, &argv);\n  if (argc != 3) {\n    ShowUsage();\n    return 1;\n  }\n\n  const auto arc_type = s::LoadArcTypeFromFar(argv[1]);\n  if (arc_type.empty()) return 1;\n\n  bool result = s::FarEqual(argv[1], argv[2], arc_type, FLAGS_delta,\n                            FLAGS_begin_key, FLAGS_end_key);\n\n  if (!result) VLOG(1) << \"FARs are not equal.\";\n\n  return result ? 0 : 2;\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/extensions/far/farextract.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Extracts component FSTs from an finite-state archive.\n\n#include <string>\n#include <vector>\n\n#include <fst/flags.h>\n#include <fst/extensions/far/farscript.h>\n#include <fst/extensions/far/getters.h>\n\nDEFINE_string(filename_prefix, \"\", \"Prefix to append to filenames\");\nDEFINE_string(filename_suffix, \"\", \"Suffix to append to filenames\");\nDEFINE_int32(generate_filenames, 0,\n             \"Generate N digit numeric filenames (def: use keys)\");\nDEFINE_string(keys, \"\",\n              \"Extract set of keys separated by comma (default) \"\n              \"including ranges delimited by dash (default)\");\nDEFINE_string(key_separator, \",\", \"Separator for individual keys\");\nDEFINE_string(range_delimiter, \"-\", \"Delimiter for ranges of keys\");\n\nint main(int argc, char **argv) {\n  namespace s = fst::script;\n\n  string usage = \"Extracts FSTs from a finite-state archive.\\n\\n Usage:\";\n  usage += argv[0];\n  usage += \" [in1.far in2.far...]\\n\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n  s::ExpandArgs(argc, argv, &argc, &argv);\n\n  std::vector<string> in_fnames;\n  for (int i = 1; i < argc; ++i) in_fnames.push_back(argv[i]);\n  if (in_fnames.empty()) in_fnames.push_back(\"\");\n\n  const auto arc_type = s::LoadArcTypeFromFar(in_fnames[0]);\n  if (arc_type.empty()) return 1;\n\n  s::FarExtract(in_fnames, arc_type, FLAGS_generate_filenames, FLAGS_keys,\n                FLAGS_key_separator, FLAGS_range_delimiter,\n                FLAGS_filename_prefix, FLAGS_filename_suffix);\n\n  return 0;\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/extensions/far/farinfo.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Prints some basic information about the FSTs in an FST archive.\n\n#include <string>\n#include <vector>\n\n#include <fst/flags.h>\n#include <fst/extensions/far/farscript.h>\n#include <fst/extensions/far/getters.h>\n\nDEFINE_string(begin_key, \"\",\n              \"First key to extract (default: first key in archive)\");\nDEFINE_string(end_key, \"\",\n              \"Last key to extract (default: last key in archive)\");\n\nDEFINE_bool(list_fsts, false, \"Display FST information for each key\");\n\nint main(int argc, char **argv) {\n  namespace s = fst::script;\n\n  string usage = \"Prints some basic information about the FSTs in an FST \";\n  usage += \"archive.\\n\\n  Usage:\";\n  usage += argv[0];\n  usage += \" [in1.far in2.far...]\\n\";\n  usage += \"  Flags: begin_key end_key list_fsts\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n  s::ExpandArgs(argc, argv, &argc, &argv);\n\n  std::vector<string> in_fnames;\n  for (int i = 1; i < argc; ++i) in_fnames.push_back(argv[i]);\n  if (in_fnames.empty()) in_fnames.push_back(\"\");\n\n  const auto arc_type = s::LoadArcTypeFromFar(in_fnames[0]);\n  if (arc_type.empty()) return 1;\n\n  s::FarInfo(in_fnames, arc_type, FLAGS_begin_key, FLAGS_end_key,\n             FLAGS_list_fsts);\n\n  return 0;\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/extensions/far/farisomorphic.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Tests if two Far files contains isomorphic (key,fst) pairs.\n\n#include <string>\n\n#include <fst/flags.h>\n#include <fst/extensions/far/farscript.h>\n#include <fst/extensions/far/getters.h>\n\nDEFINE_string(begin_key, \"\",\n              \"First key to extract (def: first key in archive)\");\nDEFINE_string(end_key, \"\", \"Last key to extract (def: last key in archive)\");\nDEFINE_double(delta, fst::kDelta, \"Comparison/quantization delta\");\n\nint main(int argc, char **argv) {\n  namespace s = fst::script;\n\n  string usage = \"Compares the FSTs in two FST archives for isomorphism.\";\n  usage += \"\\n\\n  Usage:\";\n  usage += argv[0];\n  usage += \" in1.far in2.far\\n\";\n  usage += \"  Flags: begin_key end_key\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n  s::ExpandArgs(argc, argv, &argc, &argv);\n\n  if (argc != 3) {\n    ShowUsage();\n    return 1;\n  }\n\n  const auto arc_type = s::LoadArcTypeFromFar(argv[1]);\n  if (arc_type.empty()) return 1;\n\n  bool result = s::FarIsomorphic(argv[1], argv[2], arc_type,\n                                 FLAGS_delta, FLAGS_begin_key, FLAGS_end_key);\n\n  if (!result) VLOG(1) << \"FARs are not isomorphic.\";\n\n  return result ? 0 : 2;\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/extensions/far/farprintstrings.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Outputs as strings the string FSTs in a finite-state archive.\n\n#include <string>\n#include <vector>\n\n#include <fst/flags.h>\n#include <fst/extensions/far/farscript.h>\n#include <fst/extensions/far/getters.h>\n\nDEFINE_string(filename_prefix, \"\", \"Prefix to append to filenames\");\nDEFINE_string(filename_suffix, \"\", \"Suffix to append to filenames\");\nDEFINE_int32(generate_filenames, 0,\n             \"Generate N digit numeric filenames (def: use keys)\");\nDEFINE_string(begin_key, \"\",\n              \"First key to extract (def: first key in archive)\");\nDEFINE_string(end_key, \"\", \"Last key to extract (def: last key in archive)\");\n// PrintStringsMain specific flag definitions.\nDEFINE_bool(print_key, false, \"Prefix each string by its key\");\nDEFINE_bool(print_weight, false, \"Suffix each string by its weight\");\nDEFINE_string(entry_type, \"line\",\n              \"Entry type: one of : \"\n              \"\\\"file\\\" (one FST per file), \\\"line\\\" (one FST per line)\");\nDEFINE_string(token_type, \"symbol\",\n              \"Token type: one of : \"\n              \"\\\"symbol\\\", \\\"byte\\\", \\\"utf8\\\"\");\nDEFINE_string(symbols, \"\", \"Label symbol table\");\nDEFINE_bool(initial_symbols, true,\n            \"Uses symbol table from the first Fst in archive for all entries.\");\n\nint main(int argc, char **argv) {\n  namespace s = fst::script;\n\n  string usage = \"Print as string the string FSTs in an archive.\\n\\n  Usage:\";\n  usage += argv[0];\n  usage += \" [in1.far in2.far ...]\\n\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n  s::ExpandArgs(argc, argv, &argc, &argv);\n\n  std::vector<string> in_fnames;\n  for (int i = 1; i < argc; ++i) in_fnames.push_back(argv[i]);\n  if (in_fnames.empty()) in_fnames.push_back(\"\");\n\n  const auto arc_type = s::LoadArcTypeFromFar(in_fnames[0]);\n  if (arc_type.empty()) return 1;\n\n  fst::FarEntryType entry_type;\n  if (!s::GetFarEntryType(FLAGS_entry_type, &entry_type)) {\n    LOG(ERROR) << \"Unknown or unsupported FAR entry type: \" << FLAGS_entry_type;\n    return 1;\n  }\n\n  fst::FarTokenType token_type;\n  if (!s::GetFarTokenType(FLAGS_token_type, &token_type)) {\n    LOG(ERROR) << \"Unknown or unsupported FAR token type: \" << FLAGS_token_type;\n    return 1;\n  }\n\n  s::FarPrintStrings(in_fnames, arc_type, entry_type, token_type,\n                     FLAGS_begin_key, FLAGS_end_key, FLAGS_print_key,\n                     FLAGS_print_weight, FLAGS_symbols, FLAGS_initial_symbols,\n                     FLAGS_generate_filenames, FLAGS_filename_prefix,\n                     FLAGS_filename_suffix);\n\n  return 0;\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/extensions/far/farscript.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Definitions of 'scriptable' versions of FAR operations, that is,\n// those that can be called with FstClass-type arguments.\n\n#include <fst/extensions/far/farscript.h>\n#include <fst/extensions/far/far.h>\n#include <fst/script/script-impl.h>\n\nnamespace fst {\nnamespace script {\n\nvoid FarCompileStrings(const std::vector<string> &in_fnames,\n                       const string &out_fname, const string &arc_type,\n                       const string &fst_type, const FarType &far_type,\n                       int32 generate_keys, FarEntryType fet, FarTokenType tt,\n                       const string &symbols_fname,\n                       const string &unknown_symbol, bool keep_symbols,\n                       bool initial_symbols, bool allow_negative_labels,\n                       const string &key_prefix, const string &key_suffix) {\n  FarCompileStringsArgs args(in_fnames, out_fname, fst_type, far_type,\n                             generate_keys, fet, tt, symbols_fname,\n                             unknown_symbol, keep_symbols, initial_symbols,\n                             allow_negative_labels, key_prefix, key_suffix);\n  Apply<Operation<FarCompileStringsArgs>>(\"FarCompileStrings\", arc_type, &args);\n}\n\nvoid FarCreate(const std::vector<string> &in_fnames, const string &out_fname,\n               const string &arc_type, const int32 generate_keys,\n               const FarType &far_type, const string &key_prefix,\n               const string &key_suffix) {\n  FarCreateArgs args(in_fnames, out_fname, generate_keys, far_type, key_prefix,\n                     key_suffix);\n  Apply<Operation<FarCreateArgs>>(\"FarCreate\", arc_type, &args);\n}\n\nbool FarEqual(const string &filename1, const string &filename2,\n              const string &arc_type, float delta, const string &begin_key,\n              const string &end_key) {\n  FarEqualInnerArgs args(filename1, filename2, delta, begin_key, end_key);\n  FarEqualArgs args_with_retval(args);\n  Apply<Operation<FarEqualArgs>>(\"FarEqual\", arc_type, &args_with_retval);\n  return args_with_retval.retval;\n}\n\nvoid FarExtract(const std::vector<string> &ifilenames, const string &arc_type,\n                int32 generate_filenames, const string &keys,\n                const string &key_separator, const string &range_delimiter,\n                const string &filename_prefix, const string &filename_suffix) {\n  FarExtractArgs args(ifilenames, generate_filenames, keys, key_separator,\n                      range_delimiter, filename_prefix, filename_suffix);\n  Apply<Operation<FarExtractArgs>>(\"FarExtract\", arc_type, &args);\n}\n\nvoid FarInfo(const std::vector<string> &filenames, const string &arc_type,\n             const string &begin_key, const string &end_key,\n             const bool list_fsts) {\n  FarInfoArgs args(filenames, begin_key, end_key, list_fsts);\n  Apply<Operation<FarInfoArgs>>(\"FarInfo\", arc_type, &args);\n}\n\nvoid GetFarInfo(const std::vector<string> &filenames, const string &arc_type,\n                const string &begin_key, const string &end_key,\n                const bool list_fsts, FarInfoData *data) {\n  GetFarInfoArgs args(filenames, begin_key, end_key, list_fsts, data);\n  Apply<Operation<GetFarInfoArgs>>(\"GetFarInfo\", arc_type, &args);\n}\n\nbool FarIsomorphic(const string &filename1, const string &filename2,\n                   const string &arc_type, float delta, const string &begin_key,\n                   const string &end_key) {\n  FarIsomorphicInnerArgs args(filename1, filename2, delta, begin_key, end_key);\n  FarIsomorphicArgs args_with_retval(args);\n  Apply<Operation<FarIsomorphicArgs>>(\"FarIsomorphic\", arc_type,\n                                      &args_with_retval);\n  return args_with_retval.retval;\n}\n\nvoid FarPrintStrings(const std::vector<string> &ifilenames,\n                     const string &arc_type, const FarEntryType entry_type,\n                     const FarTokenType token_type, const string &begin_key,\n                     const string &end_key, const bool print_key,\n                     const bool print_weight, const string &symbols_fname,\n                     const bool initial_symbols, const int32 generate_filenames,\n                     const string &filename_prefix,\n                     const string &filename_suffix) {\n  FarPrintStringsArgs args(ifilenames, entry_type, token_type, begin_key,\n                           end_key, print_key, print_weight, symbols_fname,\n                           initial_symbols, generate_filenames, filename_prefix,\n                           filename_suffix);\n  Apply<Operation<FarPrintStringsArgs>>(\"FarPrintStrings\", arc_type, &args);\n}\n\n// Instantiate all templates for common arc types.\n\nREGISTER_FST_FAR_OPERATIONS(StdArc);\nREGISTER_FST_FAR_OPERATIONS(LogArc);\nREGISTER_FST_FAR_OPERATIONS(Log64Arc);\n\n}  // namespace script\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/extensions/far/getters.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n//\n// Definitions and functions for invoking and using Far main functions that\n// support multiple and extensible arc types.\n\n#include <fst/extensions/far/getters.h>\n\n#include <string>\n#include <vector>\n\n#include <fstream>\n\nnamespace fst {\n\nnamespace script {\n\nFarType GetFarType(const string &str) {\n  if (str == \"fst\") {\n    return FAR_FST;\n  } else if (str == \"stlist\") {\n    return FAR_STLIST;\n  } else if (str == \"sttable\") {\n    return FAR_STTABLE;\n  } else {\n    return FAR_DEFAULT;\n  }\n}\n\nbool GetFarEntryType(const string &str, FarEntryType *entry_type) {\n  if (str == \"line\") {\n    *entry_type = FET_LINE;\n  } else if (str == \"file\") {\n    *entry_type = FET_FILE;\n  } else {\n    return false;\n  }\n  return true;\n}\n\nbool GetFarTokenType(const string &str, FarTokenType *token_type) {\n  if (str == \"symbol\") {\n    *token_type = FTT_SYMBOL;\n  } else if (str == \"byte\") {\n    *token_type = FTT_BYTE;\n  } else if (str == \"utf8\") {\n    *token_type = FTT_UTF8;\n  } else {\n    return false;\n  }\n  return true;\n}\n\nvoid ExpandArgs(int argc, char **argv, int *argcp, char ***argvp) {\n}\n\n}  // namespace script\n\nstring GetFarTypeString(FarType type) {\n  switch (type) {\n    case FAR_FST:\n      return \"fst\";\n    case FAR_STLIST:\n      return \"stlist\";\n    case FAR_STTABLE:\n      return \"sttable\";\n    case FAR_DEFAULT:\n      return \"default\";\n    default:\n      return \"<unknown>\";\n  }\n}\n\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/extensions/far/script-impl.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Definitions and functions for invoking and using Far main functions that\n// support multiple and extensible arc types.\n\n#include <fst/extensions/far/script-impl.h>\n\n#include <string>\n\n#include <fst/extensions/far/far.h>\n#include <fstream>\n\nnamespace fst {\nnamespace script {\n\nstring LoadArcTypeFromFar(const string &far_fname) {\n  FarHeader hdr;\n  if (!hdr.Read(far_fname)) {\n    LOG(ERROR) << \"Error reading FAR: \" << far_fname;\n    return \"\";\n  }\n  string atype = hdr.ArcType();\n  if (atype == \"unknown\") {\n    LOG(ERROR) << \"Empty FST archive: \" << far_fname;\n    return \"\";\n  }\n  return atype;\n}\n\nstring LoadArcTypeFromFst(const string &fst_fname) {\n  FstHeader hdr;\n  std::ifstream in(fst_fname, std::ios_base::in | std::ios_base::binary);\n  if (!hdr.Read(in, fst_fname)) {\n    LOG(ERROR) << \"Error reading FST: \" << fst_fname;\n    return \"\";\n  }\n  return hdr.ArcType();\n}\n\n}  // namespace script\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/extensions/far/stlist.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <ios>\n\n#include <fst/extensions/far/stlist.h>\n#include <fstream>\n\nnamespace fst {\n\nbool IsSTList(const string &filename) {\n  std::ifstream strm(filename, std::ios_base::in | std::ios_base::binary);\n  if (!strm) return false;\n  int32 magic_number = 0;\n  ReadType(strm, &magic_number);\n  return magic_number == kSTListMagicNumber;\n}\n\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/extensions/far/strings.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <cmath>\n#include <string>\n\n#include <fst/flags.h>\n#include <fst/extensions/far/compile-strings.h>\n#include <fstream>\n\nDEFINE_string(far_field_separator, \"\\t\",\n              \"Set of characters used as a separator between printed fields\");\n\nnamespace fst {\n\n// Computes the minimal length required to encode each line number as a decimal\n// number.\nint KeySize(const char *filename) {\n  std::ifstream istrm(filename);\n  istrm.seekg(0);\n  string s;\n  int nline = 0;\n  while (getline(istrm, s)) ++nline;\n  istrm.seekg(0);\n  return nline ? ceil(log10(nline + 1)) : 1;\n}\n\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/extensions/far/sttable.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fstream>\n#include <fst/extensions/far/sttable.h>\n\nnamespace fst {\n\nbool IsSTTable(const string &filename) {\n  std::ifstream strm(filename);\n  if (!strm.good()) return false;\n\n  int32 magic_number = 0;\n  ReadType(strm, &magic_number);\n  return magic_number == kSTTableMagicNumber;\n}\n\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/extensions/linear/Makefile.am",
    "content": "AM_CPPFLAGS = -I$(srcdir)/../../include $(ICU_CPPFLAGS)\n\nif HAVE_BIN\nbin_PROGRAMS = fstlinear fstloglinearapply\n\nLDADD = libfstlinearscript.la ../../script/libfstscript.la \\\n    ../../lib/libfst.la -lm $(DL_LIBS)\n\nfstlinear_SOURCES = fstlinear.cc\n\nfstloglinearapply_SOURCES = fstloglinearapply.cc\nendif\n\nif HAVE_SCRIPT\nlibfstlinearscript_la_SOURCES = linearscript.cc\nlibfstlinearscript_la_LDFLAGS = -version-info 10:0:0 -lm $(DL_LIBS)\nlibfstlinearscript_la_LIBADD = ../../script/libfstscript.la \\\n\t\t\t\t\t\t\t../../lib/libfst.la -lm $(DL_LIBS)\nendif\n\nif HAVE_SCRIPT\nlibfst_LTLIBRARIES = linear_tagger-fst.la \\\n    linear_classifier-fst.la\nlib_LTLIBRARIES = libfstlinearscript.la\nelse\nlibfst_LTLIBRARIES = linear_tagger-fst.la linear_classifier-fst.la\nendif\n\nlibfstdir = @libfstdir@\n\nlinear_tagger_fst_la_SOURCES = linear-tagger-fst.cc\nlinear_tagger_fst_la_LDFLAGS = -module\n\nlinear_classifier_fst_la_SOURCES = linear-classifier-fst.cc\nlinear_classifier_fst_la_LDFLAGS = -module\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/extensions/linear/Makefile.in",
    "content": "# Makefile.in generated by automake 1.14.1 from Makefile.am.\n# @configure_input@\n\n# Copyright (C) 1994-2013 Free Software Foundation, Inc.\n\n# This Makefile.in is free software; the Free Software Foundation\n# gives unlimited permission to copy and/or distribute it,\n# with or without modifications, as long as this notice is preserved.\n\n# This program is distributed in the hope that it will be useful,\n# but WITHOUT ANY WARRANTY, to the extent permitted by law; without\n# even the implied warranty of MERCHANTABILITY or FITNESS FOR A\n# PARTICULAR PURPOSE.\n\n@SET_MAKE@\n\n\nVPATH = @srcdir@\nam__is_gnu_make = test -n '$(MAKEFILE_LIST)' && test -n '$(MAKELEVEL)'\nam__make_running_with_option = \\\n  case $${target_option-} in \\\n      ?) ;; \\\n      *) echo \"am__make_running_with_option: internal error: invalid\" \\\n              \"target option '$${target_option-}' specified\" >&2; \\\n         exit 1;; \\\n  esac; \\\n  has_opt=no; \\\n  sane_makeflags=$$MAKEFLAGS; \\\n  if $(am__is_gnu_make); then \\\n    sane_makeflags=$$MFLAGS; \\\n  else \\\n    case $$MAKEFLAGS in \\\n      *\\\\[\\ \\\t]*) \\\n        bs=\\\\; \\\n        sane_makeflags=`printf '%s\\n' \"$$MAKEFLAGS\" \\\n          | sed \"s/$$bs$$bs[$$bs $$bs\t]*//g\"`;; \\\n    esac; \\\n  fi; \\\n  skip_next=no; \\\n  strip_trailopt () \\\n  { \\\n    flg=`printf '%s\\n' \"$$flg\" | sed \"s/$$1.*$$//\"`; \\\n  }; \\\n  for flg in $$sane_makeflags; do \\\n    test $$skip_next = yes && { skip_next=no; continue; }; \\\n    case $$flg in \\\n      *=*|--*) continue;; \\\n        -*I) strip_trailopt 'I'; skip_next=yes;; \\\n      -*I?*) strip_trailopt 'I';; \\\n        -*O) strip_trailopt 'O'; skip_next=yes;; \\\n      -*O?*) strip_trailopt 'O';; \\\n        -*l) strip_trailopt 'l'; skip_next=yes;; \\\n      -*l?*) strip_trailopt 'l';; \\\n      -[dEDm]) skip_next=yes;; \\\n      -[JT]) skip_next=yes;; \\\n    esac; \\\n    case $$flg in \\\n      *$$target_option*) has_opt=yes; break;; \\\n    esac; \\\n  done; \\\n  test $$has_opt = yes\nam__make_dryrun = (target_option=n; $(am__make_running_with_option))\nam__make_keepgoing = (target_option=k; $(am__make_running_with_option))\npkgdatadir = $(datadir)/@PACKAGE@\npkgincludedir = $(includedir)/@PACKAGE@\npkglibdir = $(libdir)/@PACKAGE@\npkglibexecdir = $(libexecdir)/@PACKAGE@\nam__cd = CDPATH=\"$${ZSH_VERSION+.}$(PATH_SEPARATOR)\" && cd\ninstall_sh_DATA = $(install_sh) -c -m 644\ninstall_sh_PROGRAM = $(install_sh) -c\ninstall_sh_SCRIPT = $(install_sh) -c\nINSTALL_HEADER = $(INSTALL_DATA)\ntransform = $(program_transform_name)\nNORMAL_INSTALL = :\nPRE_INSTALL = :\nPOST_INSTALL = :\nNORMAL_UNINSTALL = :\nPRE_UNINSTALL = :\nPOST_UNINSTALL = :\nbuild_triplet = @build@\nhost_triplet = @host@\n@HAVE_BIN_TRUE@bin_PROGRAMS = fstlinear$(EXEEXT) \\\n@HAVE_BIN_TRUE@\tfstloglinearapply$(EXEEXT)\nsubdir = src/extensions/linear\nDIST_COMMON = $(srcdir)/Makefile.in $(srcdir)/Makefile.am \\\n\t$(top_srcdir)/depcomp\nACLOCAL_M4 = $(top_srcdir)/aclocal.m4\nam__aclocal_m4_deps = $(top_srcdir)/m4/ac_python_devel.m4 \\\n\t$(top_srcdir)/m4/libtool.m4 $(top_srcdir)/m4/ltoptions.m4 \\\n\t$(top_srcdir)/m4/ltsugar.m4 $(top_srcdir)/m4/ltversion.m4 \\\n\t$(top_srcdir)/m4/lt~obsolete.m4 $(top_srcdir)/configure.ac\nam__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \\\n\t$(ACLOCAL_M4)\nmkinstalldirs = $(install_sh) -d\nCONFIG_HEADER = $(top_builddir)/config.h \\\n\t$(top_builddir)/src/include/fst/config.h\nCONFIG_CLEAN_FILES =\nCONFIG_CLEAN_VPATH_FILES =\nam__vpath_adj_setup = srcdirstrip=`echo \"$(srcdir)\" | sed 's|.|.|g'`;\nam__vpath_adj = case $$p in \\\n    $(srcdir)/*) f=`echo \"$$p\" | sed \"s|^$$srcdirstrip/||\"`;; \\\n    *) f=$$p;; \\\n  esac;\nam__strip_dir = f=`echo $$p | sed -e 's|^.*/||'`;\nam__install_max = 40\nam__nobase_strip_setup = \\\n  srcdirstrip=`echo \"$(srcdir)\" | sed 's/[].[^$$\\\\*|]/\\\\\\\\&/g'`\nam__nobase_strip = \\\n  for p in $$list; do echo \"$$p\"; done | sed -e \"s|$$srcdirstrip/||\"\nam__nobase_list = $(am__nobase_strip_setup); \\\n  for p in $$list; do echo \"$$p $$p\"; done | \\\n  sed \"s| $$srcdirstrip/| |;\"' / .*\\//!s/ .*/ ./; s,\\( .*\\)/[^/]*$$,\\1,' | \\\n  $(AWK) 'BEGIN { files[\".\"] = \"\" } { files[$$2] = files[$$2] \" \" $$1; \\\n    if (++n[$$2] == $(am__install_max)) \\\n      { print $$2, files[$$2]; n[$$2] = 0; files[$$2] = \"\" } } \\\n    END { for (dir in files) print dir, files[dir] }'\nam__base_list = \\\n  sed '$$!N;$$!N;$$!N;$$!N;$$!N;$$!N;$$!N;s/\\n/ /g' | \\\n  sed '$$!N;$$!N;$$!N;$$!N;s/\\n/ /g'\nam__uninstall_files_from_dir = { \\\n  test -z \"$$files\" \\\n    || { test ! -d \"$$dir\" && test ! -f \"$$dir\" && test ! -r \"$$dir\"; } \\\n    || { echo \" ( cd '$$dir' && rm -f\" $$files \")\"; \\\n         $(am__cd) \"$$dir\" && rm -f $$files; }; \\\n  }\nam__installdirs = \"$(DESTDIR)$(libdir)\" \"$(DESTDIR)$(libfstdir)\" \\\n\t\"$(DESTDIR)$(bindir)\"\nLTLIBRARIES = $(lib_LTLIBRARIES) $(libfst_LTLIBRARIES)\nam__DEPENDENCIES_1 =\n@HAVE_SCRIPT_TRUE@libfstlinearscript_la_DEPENDENCIES =  \\\n@HAVE_SCRIPT_TRUE@\t../../script/libfstscript.la \\\n@HAVE_SCRIPT_TRUE@\t../../lib/libfst.la $(am__DEPENDENCIES_1)\nam__libfstlinearscript_la_SOURCES_DIST = linearscript.cc\n@HAVE_SCRIPT_TRUE@am_libfstlinearscript_la_OBJECTS = linearscript.lo\nlibfstlinearscript_la_OBJECTS = $(am_libfstlinearscript_la_OBJECTS)\nAM_V_lt = $(am__v_lt_@AM_V@)\nam__v_lt_ = $(am__v_lt_@AM_DEFAULT_V@)\nam__v_lt_0 = --silent\nam__v_lt_1 = \nlibfstlinearscript_la_LINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX \\\n\t$(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=link $(CXXLD) \\\n\t$(AM_CXXFLAGS) $(CXXFLAGS) $(libfstlinearscript_la_LDFLAGS) \\\n\t$(LDFLAGS) -o $@\n@HAVE_SCRIPT_TRUE@am_libfstlinearscript_la_rpath = -rpath $(libdir)\nlinear_classifier_fst_la_LIBADD =\nam_linear_classifier_fst_la_OBJECTS = linear-classifier-fst.lo\nlinear_classifier_fst_la_OBJECTS =  \\\n\t$(am_linear_classifier_fst_la_OBJECTS)\nlinear_classifier_fst_la_LINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX \\\n\t$(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=link $(CXXLD) \\\n\t$(AM_CXXFLAGS) $(CXXFLAGS) $(linear_classifier_fst_la_LDFLAGS) \\\n\t$(LDFLAGS) -o $@\n@HAVE_SCRIPT_FALSE@am_linear_classifier_fst_la_rpath = -rpath \\\n@HAVE_SCRIPT_FALSE@\t$(libfstdir)\n@HAVE_SCRIPT_TRUE@am_linear_classifier_fst_la_rpath = -rpath \\\n@HAVE_SCRIPT_TRUE@\t$(libfstdir)\nlinear_tagger_fst_la_LIBADD =\nam_linear_tagger_fst_la_OBJECTS = linear-tagger-fst.lo\nlinear_tagger_fst_la_OBJECTS = $(am_linear_tagger_fst_la_OBJECTS)\nlinear_tagger_fst_la_LINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX \\\n\t$(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=link $(CXXLD) \\\n\t$(AM_CXXFLAGS) $(CXXFLAGS) $(linear_tagger_fst_la_LDFLAGS) \\\n\t$(LDFLAGS) -o $@\n@HAVE_SCRIPT_FALSE@am_linear_tagger_fst_la_rpath = -rpath $(libfstdir)\n@HAVE_SCRIPT_TRUE@am_linear_tagger_fst_la_rpath = -rpath $(libfstdir)\nPROGRAMS = $(bin_PROGRAMS)\nam__fstlinear_SOURCES_DIST = fstlinear.cc\n@HAVE_BIN_TRUE@am_fstlinear_OBJECTS = fstlinear.$(OBJEXT)\nfstlinear_OBJECTS = $(am_fstlinear_OBJECTS)\nfstlinear_LDADD = $(LDADD)\n@HAVE_BIN_TRUE@fstlinear_DEPENDENCIES = libfstlinearscript.la \\\n@HAVE_BIN_TRUE@\t../../script/libfstscript.la \\\n@HAVE_BIN_TRUE@\t../../lib/libfst.la $(am__DEPENDENCIES_1)\nam__fstloglinearapply_SOURCES_DIST = fstloglinearapply.cc\n@HAVE_BIN_TRUE@am_fstloglinearapply_OBJECTS =  \\\n@HAVE_BIN_TRUE@\tfstloglinearapply.$(OBJEXT)\nfstloglinearapply_OBJECTS = $(am_fstloglinearapply_OBJECTS)\nfstloglinearapply_LDADD = $(LDADD)\n@HAVE_BIN_TRUE@fstloglinearapply_DEPENDENCIES = libfstlinearscript.la \\\n@HAVE_BIN_TRUE@\t../../script/libfstscript.la \\\n@HAVE_BIN_TRUE@\t../../lib/libfst.la $(am__DEPENDENCIES_1)\nAM_V_P = $(am__v_P_@AM_V@)\nam__v_P_ = $(am__v_P_@AM_DEFAULT_V@)\nam__v_P_0 = false\nam__v_P_1 = :\nAM_V_GEN = $(am__v_GEN_@AM_V@)\nam__v_GEN_ = $(am__v_GEN_@AM_DEFAULT_V@)\nam__v_GEN_0 = @echo \"  GEN     \" $@;\nam__v_GEN_1 = \nAM_V_at = $(am__v_at_@AM_V@)\nam__v_at_ = $(am__v_at_@AM_DEFAULT_V@)\nam__v_at_0 = @\nam__v_at_1 = \nDEFAULT_INCLUDES = \ndepcomp = $(SHELL) $(top_srcdir)/depcomp\nam__depfiles_maybe = depfiles\nam__mv = mv -f\nCXXCOMPILE = $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) \\\n\t$(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS)\nLTCXXCOMPILE = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \\\n\t$(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) \\\n\t$(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) \\\n\t$(AM_CXXFLAGS) $(CXXFLAGS)\nAM_V_CXX = $(am__v_CXX_@AM_V@)\nam__v_CXX_ = $(am__v_CXX_@AM_DEFAULT_V@)\nam__v_CXX_0 = @echo \"  CXX     \" $@;\nam__v_CXX_1 = \nCXXLD = $(CXX)\nCXXLINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \\\n\t$(LIBTOOLFLAGS) --mode=link $(CXXLD) $(AM_CXXFLAGS) \\\n\t$(CXXFLAGS) $(AM_LDFLAGS) $(LDFLAGS) -o $@\nAM_V_CXXLD = $(am__v_CXXLD_@AM_V@)\nam__v_CXXLD_ = $(am__v_CXXLD_@AM_DEFAULT_V@)\nam__v_CXXLD_0 = @echo \"  CXXLD   \" $@;\nam__v_CXXLD_1 = \nSOURCES = $(libfstlinearscript_la_SOURCES) \\\n\t$(linear_classifier_fst_la_SOURCES) \\\n\t$(linear_tagger_fst_la_SOURCES) $(fstlinear_SOURCES) \\\n\t$(fstloglinearapply_SOURCES)\nDIST_SOURCES = $(am__libfstlinearscript_la_SOURCES_DIST) \\\n\t$(linear_classifier_fst_la_SOURCES) \\\n\t$(linear_tagger_fst_la_SOURCES) $(am__fstlinear_SOURCES_DIST) \\\n\t$(am__fstloglinearapply_SOURCES_DIST)\nam__can_run_installinfo = \\\n  case $$AM_UPDATE_INFO_DIR in \\\n    n|no|NO) false;; \\\n    *) (install-info --version) >/dev/null 2>&1;; \\\n  esac\nam__tagged_files = $(HEADERS) $(SOURCES) $(TAGS_FILES) $(LISP)\n# Read a list of newline-separated strings from the standard input,\n# and print each of them once, without duplicates.  Input order is\n# *not* preserved.\nam__uniquify_input = $(AWK) '\\\n  BEGIN { nonempty = 0; } \\\n  { items[$$0] = 1; nonempty = 1; } \\\n  END { if (nonempty) { for (i in items) print i; }; } \\\n'\n# Make sure the list of sources is unique.  This is necessary because,\n# e.g., the same source file might be shared among _SOURCES variables\n# for different programs/libraries.\nam__define_uniq_tagged_files = \\\n  list='$(am__tagged_files)'; \\\n  unique=`for i in $$list; do \\\n    if test -f \"$$i\"; then echo $$i; else echo $(srcdir)/$$i; fi; \\\n  done | $(am__uniquify_input)`\nETAGS = etags\nCTAGS = ctags\nDISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST)\nACLOCAL = @ACLOCAL@\nAMTAR = @AMTAR@\nAM_DEFAULT_VERBOSITY = @AM_DEFAULT_VERBOSITY@\nAR = @AR@\nAUTOCONF = @AUTOCONF@\nAUTOHEADER = @AUTOHEADER@\nAUTOMAKE = @AUTOMAKE@\nAWK = @AWK@\nCC = @CC@\nCCDEPMODE = @CCDEPMODE@\nCFLAGS = @CFLAGS@\nCPP = @CPP@\nCPPFLAGS = @CPPFLAGS@\nCXX = @CXX@\nCXXCPP = @CXXCPP@\nCXXDEPMODE = @CXXDEPMODE@\nCXXFLAGS = @CXXFLAGS@\nCYGPATH_W = @CYGPATH_W@\nDEFS = @DEFS@\nDEPDIR = @DEPDIR@\nDLLTOOL = @DLLTOOL@\nDL_LIBS = @DL_LIBS@\nDSYMUTIL = @DSYMUTIL@\nDUMPBIN = @DUMPBIN@\nECHO_C = @ECHO_C@\nECHO_N = @ECHO_N@\nECHO_T = @ECHO_T@\nEGREP = @EGREP@\nEXEEXT = @EXEEXT@\nFGREP = @FGREP@\nGREP = @GREP@\nINSTALL = @INSTALL@\nINSTALL_DATA = @INSTALL_DATA@\nINSTALL_PROGRAM = @INSTALL_PROGRAM@\nINSTALL_SCRIPT = @INSTALL_SCRIPT@\nINSTALL_STRIP_PROGRAM = @INSTALL_STRIP_PROGRAM@\nLD = @LD@\nLDFLAGS = @LDFLAGS@\nLIBOBJS = @LIBOBJS@\nLIBS = @LIBS@\nLIBTOOL = @LIBTOOL@\nLIPO = @LIPO@\nLN_S = @LN_S@\nLTLIBOBJS = @LTLIBOBJS@\nMAKEINFO = @MAKEINFO@\nMANIFEST_TOOL = @MANIFEST_TOOL@\nMKDIR_P = @MKDIR_P@\nNM = @NM@\nNMEDIT = @NMEDIT@\nOBJDUMP = @OBJDUMP@\nOBJEXT = @OBJEXT@\nOTOOL = @OTOOL@\nOTOOL64 = @OTOOL64@\nPACKAGE = @PACKAGE@\nPACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@\nPACKAGE_NAME = @PACKAGE_NAME@\nPACKAGE_STRING = @PACKAGE_STRING@\nPACKAGE_TARNAME = @PACKAGE_TARNAME@\nPACKAGE_URL = @PACKAGE_URL@\nPACKAGE_VERSION = @PACKAGE_VERSION@\nPATH_SEPARATOR = @PATH_SEPARATOR@\nPYTHON = @PYTHON@\nPYTHON_CPPFLAGS = @PYTHON_CPPFLAGS@\nPYTHON_EXEC_PREFIX = @PYTHON_EXEC_PREFIX@\nPYTHON_EXTRA_LDFLAGS = @PYTHON_EXTRA_LDFLAGS@\nPYTHON_EXTRA_LIBS = @PYTHON_EXTRA_LIBS@\nPYTHON_LDFLAGS = @PYTHON_LDFLAGS@\nPYTHON_PLATFORM = @PYTHON_PLATFORM@\nPYTHON_PREFIX = @PYTHON_PREFIX@\nPYTHON_SITE_PKG = @PYTHON_SITE_PKG@\nPYTHON_VERSION = @PYTHON_VERSION@\nRANLIB = @RANLIB@\nSED = @SED@\nSET_MAKE = @SET_MAKE@\nSHELL = @SHELL@\nSTRIP = @STRIP@\nVERSION = @VERSION@\nabs_builddir = @abs_builddir@\nabs_srcdir = @abs_srcdir@\nabs_top_builddir = @abs_top_builddir@\nabs_top_srcdir = @abs_top_srcdir@\nac_ct_AR = @ac_ct_AR@\nac_ct_CC = @ac_ct_CC@\nac_ct_CXX = @ac_ct_CXX@\nac_ct_DUMPBIN = @ac_ct_DUMPBIN@\nam__include = @am__include@\nam__leading_dot = @am__leading_dot@\nam__quote = @am__quote@\nam__tar = @am__tar@\nam__untar = @am__untar@\nbindir = @bindir@\nbuild = @build@\nbuild_alias = @build_alias@\nbuild_cpu = @build_cpu@\nbuild_os = @build_os@\nbuild_vendor = @build_vendor@\nbuilddir = @builddir@\ndatadir = @datadir@\ndatarootdir = @datarootdir@\ndocdir = @docdir@\ndvidir = @dvidir@\nexec_prefix = @exec_prefix@\nhost = @host@\nhost_alias = @host_alias@\nhost_cpu = @host_cpu@\nhost_os = @host_os@\nhost_vendor = @host_vendor@\nhtmldir = @htmldir@\nincludedir = @includedir@\ninfodir = @infodir@\ninstall_sh = @install_sh@\nlibdir = @libdir@\nlibexecdir = @libexecdir@\nlibfstdir = @libfstdir@\nlocaledir = @localedir@\nlocalstatedir = @localstatedir@\nmandir = @mandir@\nmkdir_p = @mkdir_p@\noldincludedir = @oldincludedir@\npdfdir = @pdfdir@\npkgpyexecdir = @pkgpyexecdir@\npkgpythondir = @pkgpythondir@\nprefix = @prefix@\nprogram_transform_name = @program_transform_name@\npsdir = @psdir@\npyexecdir = @pyexecdir@\npythondir = @pythondir@\nsbindir = @sbindir@\nsharedstatedir = @sharedstatedir@\nsrcdir = @srcdir@\nsysconfdir = @sysconfdir@\ntarget_alias = @target_alias@\ntop_build_prefix = @top_build_prefix@\ntop_builddir = @top_builddir@\ntop_srcdir = @top_srcdir@\nAM_CPPFLAGS = -I$(srcdir)/../../include $(ICU_CPPFLAGS)\n@HAVE_BIN_TRUE@LDADD = libfstlinearscript.la ../../script/libfstscript.la \\\n@HAVE_BIN_TRUE@    ../../lib/libfst.la -lm $(DL_LIBS)\n\n@HAVE_BIN_TRUE@fstlinear_SOURCES = fstlinear.cc\n@HAVE_BIN_TRUE@fstloglinearapply_SOURCES = fstloglinearapply.cc\n@HAVE_SCRIPT_TRUE@libfstlinearscript_la_SOURCES = linearscript.cc\n@HAVE_SCRIPT_TRUE@libfstlinearscript_la_LDFLAGS = -version-info 10:0:0 -lm $(DL_LIBS)\n@HAVE_SCRIPT_TRUE@libfstlinearscript_la_LIBADD = ../../script/libfstscript.la \\\n@HAVE_SCRIPT_TRUE@\t\t\t\t\t\t\t../../lib/libfst.la -lm $(DL_LIBS)\n\n@HAVE_SCRIPT_FALSE@libfst_LTLIBRARIES = linear_tagger-fst.la linear_classifier-fst.la\n@HAVE_SCRIPT_TRUE@libfst_LTLIBRARIES = linear_tagger-fst.la \\\n@HAVE_SCRIPT_TRUE@    linear_classifier-fst.la\n\n@HAVE_SCRIPT_TRUE@lib_LTLIBRARIES = libfstlinearscript.la\nlinear_tagger_fst_la_SOURCES = linear-tagger-fst.cc\nlinear_tagger_fst_la_LDFLAGS = -module\nlinear_classifier_fst_la_SOURCES = linear-classifier-fst.cc\nlinear_classifier_fst_la_LDFLAGS = -module\nall: all-am\n\n.SUFFIXES:\n.SUFFIXES: .cc .lo .o .obj\n$(srcdir)/Makefile.in:  $(srcdir)/Makefile.am  $(am__configure_deps)\n\t@for dep in $?; do \\\n\t  case '$(am__configure_deps)' in \\\n\t    *$$dep*) \\\n\t      ( cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh ) \\\n\t        && { if test -f $@; then exit 0; else break; fi; }; \\\n\t      exit 1;; \\\n\t  esac; \\\n\tdone; \\\n\techo ' cd $(top_srcdir) && $(AUTOMAKE) --foreign src/extensions/linear/Makefile'; \\\n\t$(am__cd) $(top_srcdir) && \\\n\t  $(AUTOMAKE) --foreign src/extensions/linear/Makefile\n.PRECIOUS: Makefile\nMakefile: $(srcdir)/Makefile.in $(top_builddir)/config.status\n\t@case '$?' in \\\n\t  *config.status*) \\\n\t    cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh;; \\\n\t  *) \\\n\t    echo ' cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe)'; \\\n\t    cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe);; \\\n\tesac;\n\n$(top_builddir)/config.status: $(top_srcdir)/configure $(CONFIG_STATUS_DEPENDENCIES)\n\tcd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh\n\n$(top_srcdir)/configure:  $(am__configure_deps)\n\tcd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh\n$(ACLOCAL_M4):  $(am__aclocal_m4_deps)\n\tcd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh\n$(am__aclocal_m4_deps):\n\ninstall-libLTLIBRARIES: $(lib_LTLIBRARIES)\n\t@$(NORMAL_INSTALL)\n\t@list='$(lib_LTLIBRARIES)'; test -n \"$(libdir)\" || list=; \\\n\tlist2=; for p in $$list; do \\\n\t  if test -f $$p; then \\\n\t    list2=\"$$list2 $$p\"; \\\n\t  else :; fi; \\\n\tdone; \\\n\ttest -z \"$$list2\" || { \\\n\t  echo \" $(MKDIR_P) '$(DESTDIR)$(libdir)'\"; \\\n\t  $(MKDIR_P) \"$(DESTDIR)$(libdir)\" || exit 1; \\\n\t  echo \" $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) $$list2 '$(DESTDIR)$(libdir)'\"; \\\n\t  $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) $$list2 \"$(DESTDIR)$(libdir)\"; \\\n\t}\n\nuninstall-libLTLIBRARIES:\n\t@$(NORMAL_UNINSTALL)\n\t@list='$(lib_LTLIBRARIES)'; test -n \"$(libdir)\" || list=; \\\n\tfor p in $$list; do \\\n\t  $(am__strip_dir) \\\n\t  echo \" $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=uninstall rm -f '$(DESTDIR)$(libdir)/$$f'\"; \\\n\t  $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=uninstall rm -f \"$(DESTDIR)$(libdir)/$$f\"; \\\n\tdone\n\nclean-libLTLIBRARIES:\n\t-test -z \"$(lib_LTLIBRARIES)\" || rm -f $(lib_LTLIBRARIES)\n\t@list='$(lib_LTLIBRARIES)'; \\\n\tlocs=`for p in $$list; do echo $$p; done | \\\n\t      sed 's|^[^/]*$$|.|; s|/[^/]*$$||; s|$$|/so_locations|' | \\\n\t      sort -u`; \\\n\ttest -z \"$$locs\" || { \\\n\t  echo rm -f $${locs}; \\\n\t  rm -f $${locs}; \\\n\t}\n\ninstall-libfstLTLIBRARIES: $(libfst_LTLIBRARIES)\n\t@$(NORMAL_INSTALL)\n\t@list='$(libfst_LTLIBRARIES)'; test -n \"$(libfstdir)\" || list=; \\\n\tlist2=; for p in $$list; do \\\n\t  if test -f $$p; then \\\n\t    list2=\"$$list2 $$p\"; \\\n\t  else :; fi; \\\n\tdone; \\\n\ttest -z \"$$list2\" || { \\\n\t  echo \" $(MKDIR_P) '$(DESTDIR)$(libfstdir)'\"; \\\n\t  $(MKDIR_P) \"$(DESTDIR)$(libfstdir)\" || exit 1; \\\n\t  echo \" $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) $$list2 '$(DESTDIR)$(libfstdir)'\"; \\\n\t  $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) $$list2 \"$(DESTDIR)$(libfstdir)\"; \\\n\t}\n\nuninstall-libfstLTLIBRARIES:\n\t@$(NORMAL_UNINSTALL)\n\t@list='$(libfst_LTLIBRARIES)'; test -n \"$(libfstdir)\" || list=; \\\n\tfor p in $$list; do \\\n\t  $(am__strip_dir) \\\n\t  echo \" $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=uninstall rm -f '$(DESTDIR)$(libfstdir)/$$f'\"; \\\n\t  $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=uninstall rm -f \"$(DESTDIR)$(libfstdir)/$$f\"; \\\n\tdone\n\nclean-libfstLTLIBRARIES:\n\t-test -z \"$(libfst_LTLIBRARIES)\" || rm -f $(libfst_LTLIBRARIES)\n\t@list='$(libfst_LTLIBRARIES)'; \\\n\tlocs=`for p in $$list; do echo $$p; done | \\\n\t      sed 's|^[^/]*$$|.|; s|/[^/]*$$||; s|$$|/so_locations|' | \\\n\t      sort -u`; \\\n\ttest -z \"$$locs\" || { \\\n\t  echo rm -f $${locs}; \\\n\t  rm -f $${locs}; \\\n\t}\n\nlibfstlinearscript.la: $(libfstlinearscript_la_OBJECTS) $(libfstlinearscript_la_DEPENDENCIES) $(EXTRA_libfstlinearscript_la_DEPENDENCIES) \n\t$(AM_V_CXXLD)$(libfstlinearscript_la_LINK) $(am_libfstlinearscript_la_rpath) $(libfstlinearscript_la_OBJECTS) $(libfstlinearscript_la_LIBADD) $(LIBS)\n\nlinear_classifier-fst.la: $(linear_classifier_fst_la_OBJECTS) $(linear_classifier_fst_la_DEPENDENCIES) $(EXTRA_linear_classifier_fst_la_DEPENDENCIES) \n\t$(AM_V_CXXLD)$(linear_classifier_fst_la_LINK) $(am_linear_classifier_fst_la_rpath) $(linear_classifier_fst_la_OBJECTS) $(linear_classifier_fst_la_LIBADD) $(LIBS)\n\nlinear_tagger-fst.la: $(linear_tagger_fst_la_OBJECTS) $(linear_tagger_fst_la_DEPENDENCIES) $(EXTRA_linear_tagger_fst_la_DEPENDENCIES) \n\t$(AM_V_CXXLD)$(linear_tagger_fst_la_LINK) $(am_linear_tagger_fst_la_rpath) $(linear_tagger_fst_la_OBJECTS) $(linear_tagger_fst_la_LIBADD) $(LIBS)\ninstall-binPROGRAMS: $(bin_PROGRAMS)\n\t@$(NORMAL_INSTALL)\n\t@list='$(bin_PROGRAMS)'; test -n \"$(bindir)\" || list=; \\\n\tif test -n \"$$list\"; then \\\n\t  echo \" $(MKDIR_P) '$(DESTDIR)$(bindir)'\"; \\\n\t  $(MKDIR_P) \"$(DESTDIR)$(bindir)\" || exit 1; \\\n\tfi; \\\n\tfor p in $$list; do echo \"$$p $$p\"; done | \\\n\tsed 's/$(EXEEXT)$$//' | \\\n\twhile read p p1; do if test -f $$p \\\n\t || test -f $$p1 \\\n\t  ; then echo \"$$p\"; echo \"$$p\"; else :; fi; \\\n\tdone | \\\n\tsed -e 'p;s,.*/,,;n;h' \\\n\t    -e 's|.*|.|' \\\n\t    -e 'p;x;s,.*/,,;s/$(EXEEXT)$$//;$(transform);s/$$/$(EXEEXT)/' | \\\n\tsed 'N;N;N;s,\\n, ,g' | \\\n\t$(AWK) 'BEGIN { files[\".\"] = \"\"; dirs[\".\"] = 1 } \\\n\t  { d=$$3; if (dirs[d] != 1) { print \"d\", d; dirs[d] = 1 } \\\n\t    if ($$2 == $$4) files[d] = files[d] \" \" $$1; \\\n\t    else { print \"f\", $$3 \"/\" $$4, $$1; } } \\\n\t  END { for (d in files) print \"f\", d, files[d] }' | \\\n\twhile read type dir files; do \\\n\t    if test \"$$dir\" = .; then dir=; else dir=/$$dir; fi; \\\n\t    test -z \"$$files\" || { \\\n\t    echo \" $(INSTALL_PROGRAM_ENV) $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL_PROGRAM) $$files '$(DESTDIR)$(bindir)$$dir'\"; \\\n\t    $(INSTALL_PROGRAM_ENV) $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL_PROGRAM) $$files \"$(DESTDIR)$(bindir)$$dir\" || exit $$?; \\\n\t    } \\\n\t; done\n\nuninstall-binPROGRAMS:\n\t@$(NORMAL_UNINSTALL)\n\t@list='$(bin_PROGRAMS)'; test -n \"$(bindir)\" || list=; \\\n\tfiles=`for p in $$list; do echo \"$$p\"; done | \\\n\t  sed -e 'h;s,^.*/,,;s/$(EXEEXT)$$//;$(transform)' \\\n\t      -e 's/$$/$(EXEEXT)/' \\\n\t`; \\\n\ttest -n \"$$list\" || exit 0; \\\n\techo \" ( cd '$(DESTDIR)$(bindir)' && rm -f\" $$files \")\"; \\\n\tcd \"$(DESTDIR)$(bindir)\" && rm -f $$files\n\nclean-binPROGRAMS:\n\t@list='$(bin_PROGRAMS)'; test -n \"$$list\" || exit 0; \\\n\techo \" rm -f\" $$list; \\\n\trm -f $$list || exit $$?; \\\n\ttest -n \"$(EXEEXT)\" || exit 0; \\\n\tlist=`for p in $$list; do echo \"$$p\"; done | sed 's/$(EXEEXT)$$//'`; \\\n\techo \" rm -f\" $$list; \\\n\trm -f $$list\n\nfstlinear$(EXEEXT): $(fstlinear_OBJECTS) $(fstlinear_DEPENDENCIES) $(EXTRA_fstlinear_DEPENDENCIES) \n\t@rm -f fstlinear$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(fstlinear_OBJECTS) $(fstlinear_LDADD) $(LIBS)\n\nfstloglinearapply$(EXEEXT): $(fstloglinearapply_OBJECTS) $(fstloglinearapply_DEPENDENCIES) $(EXTRA_fstloglinearapply_DEPENDENCIES) \n\t@rm -f fstloglinearapply$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(fstloglinearapply_OBJECTS) $(fstloglinearapply_LDADD) $(LIBS)\n\nmostlyclean-compile:\n\t-rm -f *.$(OBJEXT)\n\ndistclean-compile:\n\t-rm -f *.tab.c\n\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstlinear.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstloglinearapply.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/linear-classifier-fst.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/linear-tagger-fst.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/linearscript.Plo@am__quote@\n\n.cc.o:\n@am__fastdepCXX_TRUE@\t$(AM_V_CXX)depbase=`echo $@ | sed 's|[^/]*$$|$(DEPDIR)/&|;s|\\.o$$||'`;\\\n@am__fastdepCXX_TRUE@\t$(CXXCOMPILE) -MT $@ -MD -MP -MF $$depbase.Tpo -c -o $@ $< &&\\\n@am__fastdepCXX_TRUE@\t$(am__mv) $$depbase.Tpo $$depbase.Po\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\t$(AM_V_CXX)source='$<' object='$@' libtool=no @AMDEPBACKSLASH@\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\tDEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@\n@am__fastdepCXX_FALSE@\t$(AM_V_CXX@am__nodep@)$(CXXCOMPILE) -c -o $@ $<\n\n.cc.obj:\n@am__fastdepCXX_TRUE@\t$(AM_V_CXX)depbase=`echo $@ | sed 's|[^/]*$$|$(DEPDIR)/&|;s|\\.obj$$||'`;\\\n@am__fastdepCXX_TRUE@\t$(CXXCOMPILE) -MT $@ -MD -MP -MF $$depbase.Tpo -c -o $@ `$(CYGPATH_W) '$<'` &&\\\n@am__fastdepCXX_TRUE@\t$(am__mv) $$depbase.Tpo $$depbase.Po\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\t$(AM_V_CXX)source='$<' object='$@' libtool=no @AMDEPBACKSLASH@\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\tDEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@\n@am__fastdepCXX_FALSE@\t$(AM_V_CXX@am__nodep@)$(CXXCOMPILE) -c -o $@ `$(CYGPATH_W) '$<'`\n\n.cc.lo:\n@am__fastdepCXX_TRUE@\t$(AM_V_CXX)depbase=`echo $@ | sed 's|[^/]*$$|$(DEPDIR)/&|;s|\\.lo$$||'`;\\\n@am__fastdepCXX_TRUE@\t$(LTCXXCOMPILE) -MT $@ -MD -MP -MF $$depbase.Tpo -c -o $@ $< &&\\\n@am__fastdepCXX_TRUE@\t$(am__mv) $$depbase.Tpo $$depbase.Plo\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\t$(AM_V_CXX)source='$<' object='$@' libtool=yes @AMDEPBACKSLASH@\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\tDEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@\n@am__fastdepCXX_FALSE@\t$(AM_V_CXX@am__nodep@)$(LTCXXCOMPILE) -c -o $@ $<\n\nmostlyclean-libtool:\n\t-rm -f *.lo\n\nclean-libtool:\n\t-rm -rf .libs _libs\n\nID: $(am__tagged_files)\n\t$(am__define_uniq_tagged_files); mkid -fID $$unique\ntags: tags-am\nTAGS: tags\n\ntags-am: $(TAGS_DEPENDENCIES) $(am__tagged_files)\n\tset x; \\\n\there=`pwd`; \\\n\t$(am__define_uniq_tagged_files); \\\n\tshift; \\\n\tif test -z \"$(ETAGS_ARGS)$$*$$unique\"; then :; else \\\n\t  test -n \"$$unique\" || unique=$$empty_fix; \\\n\t  if test $$# -gt 0; then \\\n\t    $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \\\n\t      \"$$@\" $$unique; \\\n\t  else \\\n\t    $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \\\n\t      $$unique; \\\n\t  fi; \\\n\tfi\nctags: ctags-am\n\nCTAGS: ctags\nctags-am: $(TAGS_DEPENDENCIES) $(am__tagged_files)\n\t$(am__define_uniq_tagged_files); \\\n\ttest -z \"$(CTAGS_ARGS)$$unique\" \\\n\t  || $(CTAGS) $(CTAGSFLAGS) $(AM_CTAGSFLAGS) $(CTAGS_ARGS) \\\n\t     $$unique\n\nGTAGS:\n\there=`$(am__cd) $(top_builddir) && pwd` \\\n\t  && $(am__cd) $(top_srcdir) \\\n\t  && gtags -i $(GTAGS_ARGS) \"$$here\"\ncscopelist: cscopelist-am\n\ncscopelist-am: $(am__tagged_files)\n\tlist='$(am__tagged_files)'; \\\n\tcase \"$(srcdir)\" in \\\n\t  [\\\\/]* | ?:[\\\\/]*) sdir=\"$(srcdir)\" ;; \\\n\t  *) sdir=$(subdir)/$(srcdir) ;; \\\n\tesac; \\\n\tfor i in $$list; do \\\n\t  if test -f \"$$i\"; then \\\n\t    echo \"$(subdir)/$$i\"; \\\n\t  else \\\n\t    echo \"$$sdir/$$i\"; \\\n\t  fi; \\\n\tdone >> $(top_builddir)/cscope.files\n\ndistclean-tags:\n\t-rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags\n\ndistdir: $(DISTFILES)\n\t@srcdirstrip=`echo \"$(srcdir)\" | sed 's/[].[^$$\\\\*]/\\\\\\\\&/g'`; \\\n\ttopsrcdirstrip=`echo \"$(top_srcdir)\" | sed 's/[].[^$$\\\\*]/\\\\\\\\&/g'`; \\\n\tlist='$(DISTFILES)'; \\\n\t  dist_files=`for file in $$list; do echo $$file; done | \\\n\t  sed -e \"s|^$$srcdirstrip/||;t\" \\\n\t      -e \"s|^$$topsrcdirstrip/|$(top_builddir)/|;t\"`; \\\n\tcase $$dist_files in \\\n\t  */*) $(MKDIR_P) `echo \"$$dist_files\" | \\\n\t\t\t   sed '/\\//!d;s|^|$(distdir)/|;s,/[^/]*$$,,' | \\\n\t\t\t   sort -u` ;; \\\n\tesac; \\\n\tfor file in $$dist_files; do \\\n\t  if test -f $$file || test -d $$file; then d=.; else d=$(srcdir); fi; \\\n\t  if test -d $$d/$$file; then \\\n\t    dir=`echo \"/$$file\" | sed -e 's,/[^/]*$$,,'`; \\\n\t    if test -d \"$(distdir)/$$file\"; then \\\n\t      find \"$(distdir)/$$file\" -type d ! -perm -700 -exec chmod u+rwx {} \\;; \\\n\t    fi; \\\n\t    if test -d $(srcdir)/$$file && test $$d != $(srcdir); then \\\n\t      cp -fpR $(srcdir)/$$file \"$(distdir)$$dir\" || exit 1; \\\n\t      find \"$(distdir)/$$file\" -type d ! -perm -700 -exec chmod u+rwx {} \\;; \\\n\t    fi; \\\n\t    cp -fpR $$d/$$file \"$(distdir)$$dir\" || exit 1; \\\n\t  else \\\n\t    test -f \"$(distdir)/$$file\" \\\n\t    || cp -p $$d/$$file \"$(distdir)/$$file\" \\\n\t    || exit 1; \\\n\t  fi; \\\n\tdone\ncheck-am: all-am\ncheck: check-am\nall-am: Makefile $(LTLIBRARIES) $(PROGRAMS)\ninstall-binPROGRAMS: install-libLTLIBRARIES\n\ninstalldirs:\n\tfor dir in \"$(DESTDIR)$(libdir)\" \"$(DESTDIR)$(libfstdir)\" \"$(DESTDIR)$(bindir)\"; do \\\n\t  test -z \"$$dir\" || $(MKDIR_P) \"$$dir\"; \\\n\tdone\ninstall: install-am\ninstall-exec: install-exec-am\ninstall-data: install-data-am\nuninstall: uninstall-am\n\ninstall-am: all-am\n\t@$(MAKE) $(AM_MAKEFLAGS) install-exec-am install-data-am\n\ninstallcheck: installcheck-am\ninstall-strip:\n\tif test -z '$(STRIP)'; then \\\n\t  $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" \\\n\t    install_sh_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" INSTALL_STRIP_FLAG=-s \\\n\t      install; \\\n\telse \\\n\t  $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" \\\n\t    install_sh_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" INSTALL_STRIP_FLAG=-s \\\n\t    \"INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'\" install; \\\n\tfi\nmostlyclean-generic:\n\nclean-generic:\n\ndistclean-generic:\n\t-test -z \"$(CONFIG_CLEAN_FILES)\" || rm -f $(CONFIG_CLEAN_FILES)\n\t-test . = \"$(srcdir)\" || test -z \"$(CONFIG_CLEAN_VPATH_FILES)\" || rm -f $(CONFIG_CLEAN_VPATH_FILES)\n\nmaintainer-clean-generic:\n\t@echo \"This command is intended for maintainers to use\"\n\t@echo \"it deletes files that may require special tools to rebuild.\"\nclean: clean-am\n\nclean-am: clean-binPROGRAMS clean-generic clean-libLTLIBRARIES \\\n\tclean-libfstLTLIBRARIES clean-libtool mostlyclean-am\n\ndistclean: distclean-am\n\t-rm -rf ./$(DEPDIR)\n\t-rm -f Makefile\ndistclean-am: clean-am distclean-compile distclean-generic \\\n\tdistclean-tags\n\ndvi: dvi-am\n\ndvi-am:\n\nhtml: html-am\n\nhtml-am:\n\ninfo: info-am\n\ninfo-am:\n\ninstall-data-am: install-libfstLTLIBRARIES\n\ninstall-dvi: install-dvi-am\n\ninstall-dvi-am:\n\ninstall-exec-am: install-binPROGRAMS install-libLTLIBRARIES\n\ninstall-html: install-html-am\n\ninstall-html-am:\n\ninstall-info: install-info-am\n\ninstall-info-am:\n\ninstall-man:\n\ninstall-pdf: install-pdf-am\n\ninstall-pdf-am:\n\ninstall-ps: install-ps-am\n\ninstall-ps-am:\n\ninstallcheck-am:\n\nmaintainer-clean: maintainer-clean-am\n\t-rm -rf ./$(DEPDIR)\n\t-rm -f Makefile\nmaintainer-clean-am: distclean-am maintainer-clean-generic\n\nmostlyclean: mostlyclean-am\n\nmostlyclean-am: mostlyclean-compile mostlyclean-generic \\\n\tmostlyclean-libtool\n\npdf: pdf-am\n\npdf-am:\n\nps: ps-am\n\nps-am:\n\nuninstall-am: uninstall-binPROGRAMS uninstall-libLTLIBRARIES \\\n\tuninstall-libfstLTLIBRARIES\n\n.MAKE: install-am install-strip\n\n.PHONY: CTAGS GTAGS TAGS all all-am check check-am clean \\\n\tclean-binPROGRAMS clean-generic clean-libLTLIBRARIES \\\n\tclean-libfstLTLIBRARIES clean-libtool cscopelist-am ctags \\\n\tctags-am distclean distclean-compile distclean-generic \\\n\tdistclean-libtool distclean-tags distdir dvi dvi-am html \\\n\thtml-am info info-am install install-am install-binPROGRAMS \\\n\tinstall-data install-data-am install-dvi install-dvi-am \\\n\tinstall-exec install-exec-am install-html install-html-am \\\n\tinstall-info install-info-am install-libLTLIBRARIES \\\n\tinstall-libfstLTLIBRARIES install-man install-pdf \\\n\tinstall-pdf-am install-ps install-ps-am install-strip \\\n\tinstallcheck installcheck-am installdirs maintainer-clean \\\n\tmaintainer-clean-generic mostlyclean mostlyclean-compile \\\n\tmostlyclean-generic mostlyclean-libtool pdf pdf-am ps ps-am \\\n\ttags tags-am uninstall uninstall-am uninstall-binPROGRAMS \\\n\tuninstall-libLTLIBRARIES uninstall-libfstLTLIBRARIES\n\n\n# Tell versions [3.59,3.63) of GNU make to not export all variables.\n# Otherwise a system limit (for SysV at least) may be exceeded.\n.NOEXPORT:\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/extensions/linear/fstlinear.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/extensions/linear/linearscript.h>\n\n#include <fst/flags.h>\n\nDEFINE_string(arc_type, \"standard\", \"Output arc type\");\n\nDEFINE_string(epsilon_symbol, \"<eps>\", \"Epsilon symbol\");\nDEFINE_string(unknown_symbol, \"<unk>\", \"Unknown word symbol\");\n\nDEFINE_string(vocab, \"\", \"Path to the vocabulary file\");\nDEFINE_string(out, \"\", \"Path to the output binary\");\n\nDEFINE_string(save_isymbols, \"\", \"Save input symbol table to file\");\nDEFINE_string(save_fsymbols, \"\", \"Save feature symbol table to file\");\nDEFINE_string(save_osymbols, \"\", \"Save output symbol table to file\");\n\nint main(int argc, char **argv) {\n  // TODO(wuke): more detailed usage\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(argv[0], &argc, &argv, true);\n  fst::script::ValidateDelimiter();\n  fst::script::ValidateEmptySymbol();\n\n  if (argc == 1) {\n    ShowUsage();\n    return 1;\n  }\n\n  fst::script::LinearCompile(FLAGS_arc_type, FLAGS_epsilon_symbol,\n                                 FLAGS_unknown_symbol, FLAGS_vocab, argv + 1,\n                                 argc - 1, FLAGS_out, FLAGS_save_isymbols,\n                                 FLAGS_save_fsymbols, FLAGS_save_osymbols);\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/extensions/linear/fstloglinearapply.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/compat.h>\n#include <fst/extensions/linear/linear-fst.h>\n#include <fst/extensions/linear/loglinear-apply.h>\n#include <fst/vector-fst.h>\n\n#include <fst/flags.h>\n#include <fst/log.h>\n\nDEFINE_bool(normalize, true, \"Normalize to get posterior\");\n\nint main(int argc, char **argv) {\n  string usage =\n      \"Applies an FST to another FST, treating the second as a log-linear \"\n      \"model.\\n\\n  \"\n      \"Usage: \";\n  usage += argv[0];\n  usage += \" in.fst linear.fst [out.fst]\\n\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n  if (argc < 3 || argc > 4) {\n    ShowUsage();\n    return 1;\n  }\n\n  string in_name = strcmp(argv[1], \"-\") != 0 ? argv[1] : \"\";\n  string linear_name = (argc > 2 && (strcmp(argv[2], \"-\") != 0)) ? argv[2] : \"\";\n  string out_name = argc > 3 ? argv[3] : \"\";\n\n  if (in_name.empty() && linear_name.empty()) {\n    LOG(ERROR) << argv[0] << \": Can't take both inputs from standard input.\";\n    return 1;\n  }\n\n  fst::StdFst *ifst1 = fst::StdFst::Read(in_name);\n  if (!ifst1) return 1;\n\n  fst::StdFst *ifst2 = fst::StdFst::Read(linear_name);\n  if (!ifst2) return 1;\n\n  fst::StdVectorFst ofst;\n\n  LogLinearApply(*ifst1, *ifst2, &ofst, FLAGS_normalize);\n\n  ofst.Write(out_name);\n\n  return 0;\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/extensions/linear/linear-classifier-fst.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/extensions/linear/linear-fst.h>\n#include <fst/register.h>\n\nusing fst::LinearClassifierFst;\nusing fst::StdArc;\nusing fst::LogArc;\n\nREGISTER_FST(LinearClassifierFst, StdArc);\nREGISTER_FST(LinearClassifierFst, LogArc);\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/extensions/linear/linear-tagger-fst.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/extensions/linear/linear-fst.h>\n#include <fst/register.h>\n\nusing fst::LinearTaggerFst;\nusing fst::StdArc;\nusing fst::LogArc;\n\nREGISTER_FST(LinearTaggerFst, StdArc);\nREGISTER_FST(LinearTaggerFst, LogArc);\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/extensions/linear/linearscript.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <cctype>\n#include <cstdio>\n#include <set>\n\n#include <fst/compat.h>\n#include <fst/flags.h>\n#include <fst/extensions/linear/linearscript.h>\n#include <fst/arc.h>\n#include <fstream>\n#include <fst/script/script-impl.h>\n\nDEFINE_string(delimiter, \"|\",\n              \"Single non-white-space character delimiter inside sequences of \"\n              \"feature symbols and output symbols\");\nDEFINE_string(empty_symbol, \"<empty>\",\n              \"Special symbol that designates an empty sequence\");\n\nDEFINE_string(start_symbol, \"<s>\", \"Start of sentence symbol\");\nDEFINE_string(end_symbol, \"</s>\", \"End of sentence symbol\");\n\nDEFINE_bool(classifier, false,\n            \"Treat input model as a classifier instead of a tagger\");\n\nnamespace fst {\nnamespace script {\n\nbool ValidateDelimiter() {\n  if (FLAGS_delimiter.size() == 1 && !std::isspace(FLAGS_delimiter[0]))\n    return true;\n  return false;\n}\n\nbool ValidateEmptySymbol() {\n  bool okay = !FLAGS_empty_symbol.empty();\n  for (size_t i = 0; i < FLAGS_empty_symbol.size(); ++i) {\n    char c = FLAGS_empty_symbol[i];\n    if (std::isspace(c)) okay = false;\n  }\n  return okay;\n}\n\nvoid LinearCompile(const string &arc_type, const string &epsilon_symbol,\n                   const string &unknown_symbol, const string &vocab,\n                   char **models, int models_len, const string &out,\n                   const string &save_isymbols, const string &save_fsymbols,\n                   const string &save_osymbols) {\n  LinearCompileArgs args(epsilon_symbol, unknown_symbol, vocab, models,\n                         models_len, out, save_isymbols, save_fsymbols,\n                         save_osymbols);\n  Apply<Operation<LinearCompileArgs>>(\"LinearCompileTpl\", arc_type, &args);\n}\n\n// Instantiate templates for common arc types\nREGISTER_FST_LINEAR_OPERATIONS(StdArc);\nREGISTER_FST_LINEAR_OPERATIONS(LogArc);\n\nvoid SplitByWhitespace(const string &str, std::vector<string> *out) {\n  out->clear();\n  std::istringstream strm(str);\n  string buf;\n  while (strm >> buf) out->push_back(buf);\n}\n\nint ScanNumClasses(char **models, int models_len) {\n  std::set<string> preds;\n  for (int i = 0; i < models_len; ++i) {\n    std::ifstream in(models[i]);\n    if (!in) LOG(FATAL) << \"Failed to open \" << models[i];\n\n    string line;\n    std::getline(in, line);\n\n    size_t num_line = 1;\n    while (std::getline(in, line)) {\n      ++num_line;\n      std::vector<string> fields;\n      SplitByWhitespace(line, &fields);\n      if (fields.size() != 3)\n        LOG(FATAL) << \"Wrong number of fields in source \" << models[i]\n                   << \", line \" << num_line;\n      preds.insert(fields[1]);\n    }\n  }\n  return preds.size();\n}\n\n}  // namespace script\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/extensions/lookahead/Makefile.am",
    "content": "AM_CPPFLAGS = -I$(srcdir)/../../include $(ICU_CPPFLAGS)\n\nlibfstdir = @libfstdir@\nlibfst_LTLIBRARIES = arc_lookahead-fst.la \\\nilabel_lookahead-fst.la olabel_lookahead-fst.la\n\nlib_LTLIBRARIES = libfstlookahead.la\n\nlibfstlookahead_la_SOURCES = arc_lookahead-fst.cc ilabel_lookahead-fst.cc \\\n                             olabel_lookahead-fst.cc\nlibfstlookahead_la_LDFLAGS = -version-info 10:0:0\nlibfstlookahead_la_LIBADD = ../../lib/libfst.la -lm $(DL_LIBS)\n\narc_lookahead_fst_la_SOURCES = arc_lookahead-fst.cc\narc_lookahead_fst_la_LDFLAGS = -module\n\nilabel_lookahead_fst_la_SOURCES = ilabel_lookahead-fst.cc\nilabel_lookahead_fst_la_LDFLAGS = -module\n\nolabel_lookahead_fst_la_SOURCES = olabel_lookahead-fst.cc\nolabel_lookahead_fst_la_LDFLAGS = -module\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/extensions/lookahead/Makefile.in",
    "content": "# Makefile.in generated by automake 1.14.1 from Makefile.am.\n# @configure_input@\n\n# Copyright (C) 1994-2013 Free Software Foundation, Inc.\n\n# This Makefile.in is free software; the Free Software Foundation\n# gives unlimited permission to copy and/or distribute it,\n# with or without modifications, as long as this notice is preserved.\n\n# This program is distributed in the hope that it will be useful,\n# but WITHOUT ANY WARRANTY, to the extent permitted by law; without\n# even the implied warranty of MERCHANTABILITY or FITNESS FOR A\n# PARTICULAR PURPOSE.\n\n@SET_MAKE@\n\nVPATH = @srcdir@\nam__is_gnu_make = test -n '$(MAKEFILE_LIST)' && test -n '$(MAKELEVEL)'\nam__make_running_with_option = \\\n  case $${target_option-} in \\\n      ?) ;; \\\n      *) echo \"am__make_running_with_option: internal error: invalid\" \\\n              \"target option '$${target_option-}' specified\" >&2; \\\n         exit 1;; \\\n  esac; \\\n  has_opt=no; \\\n  sane_makeflags=$$MAKEFLAGS; \\\n  if $(am__is_gnu_make); then \\\n    sane_makeflags=$$MFLAGS; \\\n  else \\\n    case $$MAKEFLAGS in \\\n      *\\\\[\\ \\\t]*) \\\n        bs=\\\\; \\\n        sane_makeflags=`printf '%s\\n' \"$$MAKEFLAGS\" \\\n          | sed \"s/$$bs$$bs[$$bs $$bs\t]*//g\"`;; \\\n    esac; \\\n  fi; \\\n  skip_next=no; \\\n  strip_trailopt () \\\n  { \\\n    flg=`printf '%s\\n' \"$$flg\" | sed \"s/$$1.*$$//\"`; \\\n  }; \\\n  for flg in $$sane_makeflags; do \\\n    test $$skip_next = yes && { skip_next=no; continue; }; \\\n    case $$flg in \\\n      *=*|--*) continue;; \\\n        -*I) strip_trailopt 'I'; skip_next=yes;; \\\n      -*I?*) strip_trailopt 'I';; \\\n        -*O) strip_trailopt 'O'; skip_next=yes;; \\\n      -*O?*) strip_trailopt 'O';; \\\n        -*l) strip_trailopt 'l'; skip_next=yes;; \\\n      -*l?*) strip_trailopt 'l';; \\\n      -[dEDm]) skip_next=yes;; \\\n      -[JT]) skip_next=yes;; \\\n    esac; \\\n    case $$flg in \\\n      *$$target_option*) has_opt=yes; break;; \\\n    esac; \\\n  done; \\\n  test $$has_opt = yes\nam__make_dryrun = (target_option=n; $(am__make_running_with_option))\nam__make_keepgoing = (target_option=k; $(am__make_running_with_option))\npkgdatadir = $(datadir)/@PACKAGE@\npkgincludedir = $(includedir)/@PACKAGE@\npkglibdir = $(libdir)/@PACKAGE@\npkglibexecdir = $(libexecdir)/@PACKAGE@\nam__cd = CDPATH=\"$${ZSH_VERSION+.}$(PATH_SEPARATOR)\" && cd\ninstall_sh_DATA = $(install_sh) -c -m 644\ninstall_sh_PROGRAM = $(install_sh) -c\ninstall_sh_SCRIPT = $(install_sh) -c\nINSTALL_HEADER = $(INSTALL_DATA)\ntransform = $(program_transform_name)\nNORMAL_INSTALL = :\nPRE_INSTALL = :\nPOST_INSTALL = :\nNORMAL_UNINSTALL = :\nPRE_UNINSTALL = :\nPOST_UNINSTALL = :\nbuild_triplet = @build@\nhost_triplet = @host@\nsubdir = src/extensions/lookahead\nDIST_COMMON = $(srcdir)/Makefile.in $(srcdir)/Makefile.am \\\n\t$(top_srcdir)/depcomp\nACLOCAL_M4 = $(top_srcdir)/aclocal.m4\nam__aclocal_m4_deps = $(top_srcdir)/m4/ac_python_devel.m4 \\\n\t$(top_srcdir)/m4/libtool.m4 $(top_srcdir)/m4/ltoptions.m4 \\\n\t$(top_srcdir)/m4/ltsugar.m4 $(top_srcdir)/m4/ltversion.m4 \\\n\t$(top_srcdir)/m4/lt~obsolete.m4 $(top_srcdir)/configure.ac\nam__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \\\n\t$(ACLOCAL_M4)\nmkinstalldirs = $(install_sh) -d\nCONFIG_HEADER = $(top_builddir)/config.h \\\n\t$(top_builddir)/src/include/fst/config.h\nCONFIG_CLEAN_FILES =\nCONFIG_CLEAN_VPATH_FILES =\nam__vpath_adj_setup = srcdirstrip=`echo \"$(srcdir)\" | sed 's|.|.|g'`;\nam__vpath_adj = case $$p in \\\n    $(srcdir)/*) f=`echo \"$$p\" | sed \"s|^$$srcdirstrip/||\"`;; \\\n    *) f=$$p;; \\\n  esac;\nam__strip_dir = f=`echo $$p | sed -e 's|^.*/||'`;\nam__install_max = 40\nam__nobase_strip_setup = \\\n  srcdirstrip=`echo \"$(srcdir)\" | sed 's/[].[^$$\\\\*|]/\\\\\\\\&/g'`\nam__nobase_strip = \\\n  for p in $$list; do echo \"$$p\"; done | sed -e \"s|$$srcdirstrip/||\"\nam__nobase_list = $(am__nobase_strip_setup); \\\n  for p in $$list; do echo \"$$p $$p\"; done | \\\n  sed \"s| $$srcdirstrip/| |;\"' / .*\\//!s/ .*/ ./; s,\\( .*\\)/[^/]*$$,\\1,' | \\\n  $(AWK) 'BEGIN { files[\".\"] = \"\" } { files[$$2] = files[$$2] \" \" $$1; \\\n    if (++n[$$2] == $(am__install_max)) \\\n      { print $$2, files[$$2]; n[$$2] = 0; files[$$2] = \"\" } } \\\n    END { for (dir in files) print dir, files[dir] }'\nam__base_list = \\\n  sed '$$!N;$$!N;$$!N;$$!N;$$!N;$$!N;$$!N;s/\\n/ /g' | \\\n  sed '$$!N;$$!N;$$!N;$$!N;s/\\n/ /g'\nam__uninstall_files_from_dir = { \\\n  test -z \"$$files\" \\\n    || { test ! -d \"$$dir\" && test ! -f \"$$dir\" && test ! -r \"$$dir\"; } \\\n    || { echo \" ( cd '$$dir' && rm -f\" $$files \")\"; \\\n         $(am__cd) \"$$dir\" && rm -f $$files; }; \\\n  }\nam__installdirs = \"$(DESTDIR)$(libdir)\" \"$(DESTDIR)$(libfstdir)\"\nLTLIBRARIES = $(lib_LTLIBRARIES) $(libfst_LTLIBRARIES)\narc_lookahead_fst_la_LIBADD =\nam_arc_lookahead_fst_la_OBJECTS = arc_lookahead-fst.lo\narc_lookahead_fst_la_OBJECTS = $(am_arc_lookahead_fst_la_OBJECTS)\nAM_V_lt = $(am__v_lt_@AM_V@)\nam__v_lt_ = $(am__v_lt_@AM_DEFAULT_V@)\nam__v_lt_0 = --silent\nam__v_lt_1 = \narc_lookahead_fst_la_LINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX \\\n\t$(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=link $(CXXLD) \\\n\t$(AM_CXXFLAGS) $(CXXFLAGS) $(arc_lookahead_fst_la_LDFLAGS) \\\n\t$(LDFLAGS) -o $@\nilabel_lookahead_fst_la_LIBADD =\nam_ilabel_lookahead_fst_la_OBJECTS = ilabel_lookahead-fst.lo\nilabel_lookahead_fst_la_OBJECTS =  \\\n\t$(am_ilabel_lookahead_fst_la_OBJECTS)\nilabel_lookahead_fst_la_LINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX \\\n\t$(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=link $(CXXLD) \\\n\t$(AM_CXXFLAGS) $(CXXFLAGS) $(ilabel_lookahead_fst_la_LDFLAGS) \\\n\t$(LDFLAGS) -o $@\nam__DEPENDENCIES_1 =\nlibfstlookahead_la_DEPENDENCIES = ../../lib/libfst.la \\\n\t$(am__DEPENDENCIES_1)\nam_libfstlookahead_la_OBJECTS = arc_lookahead-fst.lo \\\n\tilabel_lookahead-fst.lo olabel_lookahead-fst.lo\nlibfstlookahead_la_OBJECTS = $(am_libfstlookahead_la_OBJECTS)\nlibfstlookahead_la_LINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX \\\n\t$(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=link $(CXXLD) \\\n\t$(AM_CXXFLAGS) $(CXXFLAGS) $(libfstlookahead_la_LDFLAGS) \\\n\t$(LDFLAGS) -o $@\nolabel_lookahead_fst_la_LIBADD =\nam_olabel_lookahead_fst_la_OBJECTS = olabel_lookahead-fst.lo\nolabel_lookahead_fst_la_OBJECTS =  \\\n\t$(am_olabel_lookahead_fst_la_OBJECTS)\nolabel_lookahead_fst_la_LINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX \\\n\t$(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=link $(CXXLD) \\\n\t$(AM_CXXFLAGS) $(CXXFLAGS) $(olabel_lookahead_fst_la_LDFLAGS) \\\n\t$(LDFLAGS) -o $@\nAM_V_P = $(am__v_P_@AM_V@)\nam__v_P_ = $(am__v_P_@AM_DEFAULT_V@)\nam__v_P_0 = false\nam__v_P_1 = :\nAM_V_GEN = $(am__v_GEN_@AM_V@)\nam__v_GEN_ = $(am__v_GEN_@AM_DEFAULT_V@)\nam__v_GEN_0 = @echo \"  GEN     \" $@;\nam__v_GEN_1 = \nAM_V_at = $(am__v_at_@AM_V@)\nam__v_at_ = $(am__v_at_@AM_DEFAULT_V@)\nam__v_at_0 = @\nam__v_at_1 = \nDEFAULT_INCLUDES = \ndepcomp = $(SHELL) $(top_srcdir)/depcomp\nam__depfiles_maybe = depfiles\nam__mv = mv -f\nCXXCOMPILE = $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) \\\n\t$(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS)\nLTCXXCOMPILE = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \\\n\t$(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) \\\n\t$(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) \\\n\t$(AM_CXXFLAGS) $(CXXFLAGS)\nAM_V_CXX = $(am__v_CXX_@AM_V@)\nam__v_CXX_ = $(am__v_CXX_@AM_DEFAULT_V@)\nam__v_CXX_0 = @echo \"  CXX     \" $@;\nam__v_CXX_1 = \nCXXLD = $(CXX)\nCXXLINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \\\n\t$(LIBTOOLFLAGS) --mode=link $(CXXLD) $(AM_CXXFLAGS) \\\n\t$(CXXFLAGS) $(AM_LDFLAGS) $(LDFLAGS) -o $@\nAM_V_CXXLD = $(am__v_CXXLD_@AM_V@)\nam__v_CXXLD_ = $(am__v_CXXLD_@AM_DEFAULT_V@)\nam__v_CXXLD_0 = @echo \"  CXXLD   \" $@;\nam__v_CXXLD_1 = \nSOURCES = $(arc_lookahead_fst_la_SOURCES) \\\n\t$(ilabel_lookahead_fst_la_SOURCES) \\\n\t$(libfstlookahead_la_SOURCES) \\\n\t$(olabel_lookahead_fst_la_SOURCES)\nDIST_SOURCES = $(arc_lookahead_fst_la_SOURCES) \\\n\t$(ilabel_lookahead_fst_la_SOURCES) \\\n\t$(libfstlookahead_la_SOURCES) \\\n\t$(olabel_lookahead_fst_la_SOURCES)\nam__can_run_installinfo = \\\n  case $$AM_UPDATE_INFO_DIR in \\\n    n|no|NO) false;; \\\n    *) (install-info --version) >/dev/null 2>&1;; \\\n  esac\nam__tagged_files = $(HEADERS) $(SOURCES) $(TAGS_FILES) $(LISP)\n# Read a list of newline-separated strings from the standard input,\n# and print each of them once, without duplicates.  Input order is\n# *not* preserved.\nam__uniquify_input = $(AWK) '\\\n  BEGIN { nonempty = 0; } \\\n  { items[$$0] = 1; nonempty = 1; } \\\n  END { if (nonempty) { for (i in items) print i; }; } \\\n'\n# Make sure the list of sources is unique.  This is necessary because,\n# e.g., the same source file might be shared among _SOURCES variables\n# for different programs/libraries.\nam__define_uniq_tagged_files = \\\n  list='$(am__tagged_files)'; \\\n  unique=`for i in $$list; do \\\n    if test -f \"$$i\"; then echo $$i; else echo $(srcdir)/$$i; fi; \\\n  done | $(am__uniquify_input)`\nETAGS = etags\nCTAGS = ctags\nDISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST)\nACLOCAL = @ACLOCAL@\nAMTAR = @AMTAR@\nAM_DEFAULT_VERBOSITY = @AM_DEFAULT_VERBOSITY@\nAR = @AR@\nAUTOCONF = @AUTOCONF@\nAUTOHEADER = @AUTOHEADER@\nAUTOMAKE = @AUTOMAKE@\nAWK = @AWK@\nCC = @CC@\nCCDEPMODE = @CCDEPMODE@\nCFLAGS = @CFLAGS@\nCPP = @CPP@\nCPPFLAGS = @CPPFLAGS@\nCXX = @CXX@\nCXXCPP = @CXXCPP@\nCXXDEPMODE = @CXXDEPMODE@\nCXXFLAGS = @CXXFLAGS@\nCYGPATH_W = @CYGPATH_W@\nDEFS = @DEFS@\nDEPDIR = @DEPDIR@\nDLLTOOL = @DLLTOOL@\nDL_LIBS = @DL_LIBS@\nDSYMUTIL = @DSYMUTIL@\nDUMPBIN = @DUMPBIN@\nECHO_C = @ECHO_C@\nECHO_N = @ECHO_N@\nECHO_T = @ECHO_T@\nEGREP = @EGREP@\nEXEEXT = @EXEEXT@\nFGREP = @FGREP@\nGREP = @GREP@\nINSTALL = @INSTALL@\nINSTALL_DATA = @INSTALL_DATA@\nINSTALL_PROGRAM = @INSTALL_PROGRAM@\nINSTALL_SCRIPT = @INSTALL_SCRIPT@\nINSTALL_STRIP_PROGRAM = @INSTALL_STRIP_PROGRAM@\nLD = @LD@\nLDFLAGS = @LDFLAGS@\nLIBOBJS = @LIBOBJS@\nLIBS = @LIBS@\nLIBTOOL = @LIBTOOL@\nLIPO = @LIPO@\nLN_S = @LN_S@\nLTLIBOBJS = @LTLIBOBJS@\nMAKEINFO = @MAKEINFO@\nMANIFEST_TOOL = @MANIFEST_TOOL@\nMKDIR_P = @MKDIR_P@\nNM = @NM@\nNMEDIT = @NMEDIT@\nOBJDUMP = @OBJDUMP@\nOBJEXT = @OBJEXT@\nOTOOL = @OTOOL@\nOTOOL64 = @OTOOL64@\nPACKAGE = @PACKAGE@\nPACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@\nPACKAGE_NAME = @PACKAGE_NAME@\nPACKAGE_STRING = @PACKAGE_STRING@\nPACKAGE_TARNAME = @PACKAGE_TARNAME@\nPACKAGE_URL = @PACKAGE_URL@\nPACKAGE_VERSION = @PACKAGE_VERSION@\nPATH_SEPARATOR = @PATH_SEPARATOR@\nPYTHON = @PYTHON@\nPYTHON_CPPFLAGS = @PYTHON_CPPFLAGS@\nPYTHON_EXEC_PREFIX = @PYTHON_EXEC_PREFIX@\nPYTHON_EXTRA_LDFLAGS = @PYTHON_EXTRA_LDFLAGS@\nPYTHON_EXTRA_LIBS = @PYTHON_EXTRA_LIBS@\nPYTHON_LDFLAGS = @PYTHON_LDFLAGS@\nPYTHON_PLATFORM = @PYTHON_PLATFORM@\nPYTHON_PREFIX = @PYTHON_PREFIX@\nPYTHON_SITE_PKG = @PYTHON_SITE_PKG@\nPYTHON_VERSION = @PYTHON_VERSION@\nRANLIB = @RANLIB@\nSED = @SED@\nSET_MAKE = @SET_MAKE@\nSHELL = @SHELL@\nSTRIP = @STRIP@\nVERSION = @VERSION@\nabs_builddir = @abs_builddir@\nabs_srcdir = @abs_srcdir@\nabs_top_builddir = @abs_top_builddir@\nabs_top_srcdir = @abs_top_srcdir@\nac_ct_AR = @ac_ct_AR@\nac_ct_CC = @ac_ct_CC@\nac_ct_CXX = @ac_ct_CXX@\nac_ct_DUMPBIN = @ac_ct_DUMPBIN@\nam__include = @am__include@\nam__leading_dot = @am__leading_dot@\nam__quote = @am__quote@\nam__tar = @am__tar@\nam__untar = @am__untar@\nbindir = @bindir@\nbuild = @build@\nbuild_alias = @build_alias@\nbuild_cpu = @build_cpu@\nbuild_os = @build_os@\nbuild_vendor = @build_vendor@\nbuilddir = @builddir@\ndatadir = @datadir@\ndatarootdir = @datarootdir@\ndocdir = @docdir@\ndvidir = @dvidir@\nexec_prefix = @exec_prefix@\nhost = @host@\nhost_alias = @host_alias@\nhost_cpu = @host_cpu@\nhost_os = @host_os@\nhost_vendor = @host_vendor@\nhtmldir = @htmldir@\nincludedir = @includedir@\ninfodir = @infodir@\ninstall_sh = @install_sh@\nlibdir = @libdir@\nlibexecdir = @libexecdir@\nlibfstdir = @libfstdir@\nlocaledir = @localedir@\nlocalstatedir = @localstatedir@\nmandir = @mandir@\nmkdir_p = @mkdir_p@\noldincludedir = @oldincludedir@\npdfdir = @pdfdir@\npkgpyexecdir = @pkgpyexecdir@\npkgpythondir = @pkgpythondir@\nprefix = @prefix@\nprogram_transform_name = @program_transform_name@\npsdir = @psdir@\npyexecdir = @pyexecdir@\npythondir = @pythondir@\nsbindir = @sbindir@\nsharedstatedir = @sharedstatedir@\nsrcdir = @srcdir@\nsysconfdir = @sysconfdir@\ntarget_alias = @target_alias@\ntop_build_prefix = @top_build_prefix@\ntop_builddir = @top_builddir@\ntop_srcdir = @top_srcdir@\nAM_CPPFLAGS = -I$(srcdir)/../../include $(ICU_CPPFLAGS)\nlibfst_LTLIBRARIES = arc_lookahead-fst.la \\\nilabel_lookahead-fst.la olabel_lookahead-fst.la\n\nlib_LTLIBRARIES = libfstlookahead.la\nlibfstlookahead_la_SOURCES = arc_lookahead-fst.cc ilabel_lookahead-fst.cc \\\n                             olabel_lookahead-fst.cc\n\nlibfstlookahead_la_LDFLAGS = -version-info 10:0:0\nlibfstlookahead_la_LIBADD = ../../lib/libfst.la -lm $(DL_LIBS)\narc_lookahead_fst_la_SOURCES = arc_lookahead-fst.cc\narc_lookahead_fst_la_LDFLAGS = -module\nilabel_lookahead_fst_la_SOURCES = ilabel_lookahead-fst.cc\nilabel_lookahead_fst_la_LDFLAGS = -module\nolabel_lookahead_fst_la_SOURCES = olabel_lookahead-fst.cc\nolabel_lookahead_fst_la_LDFLAGS = -module\nall: all-am\n\n.SUFFIXES:\n.SUFFIXES: .cc .lo .o .obj\n$(srcdir)/Makefile.in:  $(srcdir)/Makefile.am  $(am__configure_deps)\n\t@for dep in $?; do \\\n\t  case '$(am__configure_deps)' in \\\n\t    *$$dep*) \\\n\t      ( cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh ) \\\n\t        && { if test -f $@; then exit 0; else break; fi; }; \\\n\t      exit 1;; \\\n\t  esac; \\\n\tdone; \\\n\techo ' cd $(top_srcdir) && $(AUTOMAKE) --foreign src/extensions/lookahead/Makefile'; \\\n\t$(am__cd) $(top_srcdir) && \\\n\t  $(AUTOMAKE) --foreign src/extensions/lookahead/Makefile\n.PRECIOUS: Makefile\nMakefile: $(srcdir)/Makefile.in $(top_builddir)/config.status\n\t@case '$?' in \\\n\t  *config.status*) \\\n\t    cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh;; \\\n\t  *) \\\n\t    echo ' cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe)'; \\\n\t    cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe);; \\\n\tesac;\n\n$(top_builddir)/config.status: $(top_srcdir)/configure $(CONFIG_STATUS_DEPENDENCIES)\n\tcd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh\n\n$(top_srcdir)/configure:  $(am__configure_deps)\n\tcd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh\n$(ACLOCAL_M4):  $(am__aclocal_m4_deps)\n\tcd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh\n$(am__aclocal_m4_deps):\n\ninstall-libLTLIBRARIES: $(lib_LTLIBRARIES)\n\t@$(NORMAL_INSTALL)\n\t@list='$(lib_LTLIBRARIES)'; test -n \"$(libdir)\" || list=; \\\n\tlist2=; for p in $$list; do \\\n\t  if test -f $$p; then \\\n\t    list2=\"$$list2 $$p\"; \\\n\t  else :; fi; \\\n\tdone; \\\n\ttest -z \"$$list2\" || { \\\n\t  echo \" $(MKDIR_P) '$(DESTDIR)$(libdir)'\"; \\\n\t  $(MKDIR_P) \"$(DESTDIR)$(libdir)\" || exit 1; \\\n\t  echo \" $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) $$list2 '$(DESTDIR)$(libdir)'\"; \\\n\t  $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) $$list2 \"$(DESTDIR)$(libdir)\"; \\\n\t}\n\nuninstall-libLTLIBRARIES:\n\t@$(NORMAL_UNINSTALL)\n\t@list='$(lib_LTLIBRARIES)'; test -n \"$(libdir)\" || list=; \\\n\tfor p in $$list; do \\\n\t  $(am__strip_dir) \\\n\t  echo \" $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=uninstall rm -f '$(DESTDIR)$(libdir)/$$f'\"; \\\n\t  $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=uninstall rm -f \"$(DESTDIR)$(libdir)/$$f\"; \\\n\tdone\n\nclean-libLTLIBRARIES:\n\t-test -z \"$(lib_LTLIBRARIES)\" || rm -f $(lib_LTLIBRARIES)\n\t@list='$(lib_LTLIBRARIES)'; \\\n\tlocs=`for p in $$list; do echo $$p; done | \\\n\t      sed 's|^[^/]*$$|.|; s|/[^/]*$$||; s|$$|/so_locations|' | \\\n\t      sort -u`; \\\n\ttest -z \"$$locs\" || { \\\n\t  echo rm -f $${locs}; \\\n\t  rm -f $${locs}; \\\n\t}\n\ninstall-libfstLTLIBRARIES: $(libfst_LTLIBRARIES)\n\t@$(NORMAL_INSTALL)\n\t@list='$(libfst_LTLIBRARIES)'; test -n \"$(libfstdir)\" || list=; \\\n\tlist2=; for p in $$list; do \\\n\t  if test -f $$p; then \\\n\t    list2=\"$$list2 $$p\"; \\\n\t  else :; fi; \\\n\tdone; \\\n\ttest -z \"$$list2\" || { \\\n\t  echo \" $(MKDIR_P) '$(DESTDIR)$(libfstdir)'\"; \\\n\t  $(MKDIR_P) \"$(DESTDIR)$(libfstdir)\" || exit 1; \\\n\t  echo \" $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) $$list2 '$(DESTDIR)$(libfstdir)'\"; \\\n\t  $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) $$list2 \"$(DESTDIR)$(libfstdir)\"; \\\n\t}\n\nuninstall-libfstLTLIBRARIES:\n\t@$(NORMAL_UNINSTALL)\n\t@list='$(libfst_LTLIBRARIES)'; test -n \"$(libfstdir)\" || list=; \\\n\tfor p in $$list; do \\\n\t  $(am__strip_dir) \\\n\t  echo \" $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=uninstall rm -f '$(DESTDIR)$(libfstdir)/$$f'\"; \\\n\t  $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=uninstall rm -f \"$(DESTDIR)$(libfstdir)/$$f\"; \\\n\tdone\n\nclean-libfstLTLIBRARIES:\n\t-test -z \"$(libfst_LTLIBRARIES)\" || rm -f $(libfst_LTLIBRARIES)\n\t@list='$(libfst_LTLIBRARIES)'; \\\n\tlocs=`for p in $$list; do echo $$p; done | \\\n\t      sed 's|^[^/]*$$|.|; s|/[^/]*$$||; s|$$|/so_locations|' | \\\n\t      sort -u`; \\\n\ttest -z \"$$locs\" || { \\\n\t  echo rm -f $${locs}; \\\n\t  rm -f $${locs}; \\\n\t}\n\narc_lookahead-fst.la: $(arc_lookahead_fst_la_OBJECTS) $(arc_lookahead_fst_la_DEPENDENCIES) $(EXTRA_arc_lookahead_fst_la_DEPENDENCIES) \n\t$(AM_V_CXXLD)$(arc_lookahead_fst_la_LINK) -rpath $(libfstdir) $(arc_lookahead_fst_la_OBJECTS) $(arc_lookahead_fst_la_LIBADD) $(LIBS)\n\nilabel_lookahead-fst.la: $(ilabel_lookahead_fst_la_OBJECTS) $(ilabel_lookahead_fst_la_DEPENDENCIES) $(EXTRA_ilabel_lookahead_fst_la_DEPENDENCIES) \n\t$(AM_V_CXXLD)$(ilabel_lookahead_fst_la_LINK) -rpath $(libfstdir) $(ilabel_lookahead_fst_la_OBJECTS) $(ilabel_lookahead_fst_la_LIBADD) $(LIBS)\n\nlibfstlookahead.la: $(libfstlookahead_la_OBJECTS) $(libfstlookahead_la_DEPENDENCIES) $(EXTRA_libfstlookahead_la_DEPENDENCIES) \n\t$(AM_V_CXXLD)$(libfstlookahead_la_LINK) -rpath $(libdir) $(libfstlookahead_la_OBJECTS) $(libfstlookahead_la_LIBADD) $(LIBS)\n\nolabel_lookahead-fst.la: $(olabel_lookahead_fst_la_OBJECTS) $(olabel_lookahead_fst_la_DEPENDENCIES) $(EXTRA_olabel_lookahead_fst_la_DEPENDENCIES) \n\t$(AM_V_CXXLD)$(olabel_lookahead_fst_la_LINK) -rpath $(libfstdir) $(olabel_lookahead_fst_la_OBJECTS) $(olabel_lookahead_fst_la_LIBADD) $(LIBS)\n\nmostlyclean-compile:\n\t-rm -f *.$(OBJEXT)\n\ndistclean-compile:\n\t-rm -f *.tab.c\n\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/arc_lookahead-fst.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/ilabel_lookahead-fst.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/olabel_lookahead-fst.Plo@am__quote@\n\n.cc.o:\n@am__fastdepCXX_TRUE@\t$(AM_V_CXX)depbase=`echo $@ | sed 's|[^/]*$$|$(DEPDIR)/&|;s|\\.o$$||'`;\\\n@am__fastdepCXX_TRUE@\t$(CXXCOMPILE) -MT $@ -MD -MP -MF $$depbase.Tpo -c -o $@ $< &&\\\n@am__fastdepCXX_TRUE@\t$(am__mv) $$depbase.Tpo $$depbase.Po\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\t$(AM_V_CXX)source='$<' object='$@' libtool=no @AMDEPBACKSLASH@\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\tDEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@\n@am__fastdepCXX_FALSE@\t$(AM_V_CXX@am__nodep@)$(CXXCOMPILE) -c -o $@ $<\n\n.cc.obj:\n@am__fastdepCXX_TRUE@\t$(AM_V_CXX)depbase=`echo $@ | sed 's|[^/]*$$|$(DEPDIR)/&|;s|\\.obj$$||'`;\\\n@am__fastdepCXX_TRUE@\t$(CXXCOMPILE) -MT $@ -MD -MP -MF $$depbase.Tpo -c -o $@ `$(CYGPATH_W) '$<'` &&\\\n@am__fastdepCXX_TRUE@\t$(am__mv) $$depbase.Tpo $$depbase.Po\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\t$(AM_V_CXX)source='$<' object='$@' libtool=no @AMDEPBACKSLASH@\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\tDEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@\n@am__fastdepCXX_FALSE@\t$(AM_V_CXX@am__nodep@)$(CXXCOMPILE) -c -o $@ `$(CYGPATH_W) '$<'`\n\n.cc.lo:\n@am__fastdepCXX_TRUE@\t$(AM_V_CXX)depbase=`echo $@ | sed 's|[^/]*$$|$(DEPDIR)/&|;s|\\.lo$$||'`;\\\n@am__fastdepCXX_TRUE@\t$(LTCXXCOMPILE) -MT $@ -MD -MP -MF $$depbase.Tpo -c -o $@ $< &&\\\n@am__fastdepCXX_TRUE@\t$(am__mv) $$depbase.Tpo $$depbase.Plo\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\t$(AM_V_CXX)source='$<' object='$@' libtool=yes @AMDEPBACKSLASH@\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\tDEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@\n@am__fastdepCXX_FALSE@\t$(AM_V_CXX@am__nodep@)$(LTCXXCOMPILE) -c -o $@ $<\n\nmostlyclean-libtool:\n\t-rm -f *.lo\n\nclean-libtool:\n\t-rm -rf .libs _libs\n\nID: $(am__tagged_files)\n\t$(am__define_uniq_tagged_files); mkid -fID $$unique\ntags: tags-am\nTAGS: tags\n\ntags-am: $(TAGS_DEPENDENCIES) $(am__tagged_files)\n\tset x; \\\n\there=`pwd`; \\\n\t$(am__define_uniq_tagged_files); \\\n\tshift; \\\n\tif test -z \"$(ETAGS_ARGS)$$*$$unique\"; then :; else \\\n\t  test -n \"$$unique\" || unique=$$empty_fix; \\\n\t  if test $$# -gt 0; then \\\n\t    $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \\\n\t      \"$$@\" $$unique; \\\n\t  else \\\n\t    $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \\\n\t      $$unique; \\\n\t  fi; \\\n\tfi\nctags: ctags-am\n\nCTAGS: ctags\nctags-am: $(TAGS_DEPENDENCIES) $(am__tagged_files)\n\t$(am__define_uniq_tagged_files); \\\n\ttest -z \"$(CTAGS_ARGS)$$unique\" \\\n\t  || $(CTAGS) $(CTAGSFLAGS) $(AM_CTAGSFLAGS) $(CTAGS_ARGS) \\\n\t     $$unique\n\nGTAGS:\n\there=`$(am__cd) $(top_builddir) && pwd` \\\n\t  && $(am__cd) $(top_srcdir) \\\n\t  && gtags -i $(GTAGS_ARGS) \"$$here\"\ncscopelist: cscopelist-am\n\ncscopelist-am: $(am__tagged_files)\n\tlist='$(am__tagged_files)'; \\\n\tcase \"$(srcdir)\" in \\\n\t  [\\\\/]* | ?:[\\\\/]*) sdir=\"$(srcdir)\" ;; \\\n\t  *) sdir=$(subdir)/$(srcdir) ;; \\\n\tesac; \\\n\tfor i in $$list; do \\\n\t  if test -f \"$$i\"; then \\\n\t    echo \"$(subdir)/$$i\"; \\\n\t  else \\\n\t    echo \"$$sdir/$$i\"; \\\n\t  fi; \\\n\tdone >> $(top_builddir)/cscope.files\n\ndistclean-tags:\n\t-rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags\n\ndistdir: $(DISTFILES)\n\t@srcdirstrip=`echo \"$(srcdir)\" | sed 's/[].[^$$\\\\*]/\\\\\\\\&/g'`; \\\n\ttopsrcdirstrip=`echo \"$(top_srcdir)\" | sed 's/[].[^$$\\\\*]/\\\\\\\\&/g'`; \\\n\tlist='$(DISTFILES)'; \\\n\t  dist_files=`for file in $$list; do echo $$file; done | \\\n\t  sed -e \"s|^$$srcdirstrip/||;t\" \\\n\t      -e \"s|^$$topsrcdirstrip/|$(top_builddir)/|;t\"`; \\\n\tcase $$dist_files in \\\n\t  */*) $(MKDIR_P) `echo \"$$dist_files\" | \\\n\t\t\t   sed '/\\//!d;s|^|$(distdir)/|;s,/[^/]*$$,,' | \\\n\t\t\t   sort -u` ;; \\\n\tesac; \\\n\tfor file in $$dist_files; do \\\n\t  if test -f $$file || test -d $$file; then d=.; else d=$(srcdir); fi; \\\n\t  if test -d $$d/$$file; then \\\n\t    dir=`echo \"/$$file\" | sed -e 's,/[^/]*$$,,'`; \\\n\t    if test -d \"$(distdir)/$$file\"; then \\\n\t      find \"$(distdir)/$$file\" -type d ! -perm -700 -exec chmod u+rwx {} \\;; \\\n\t    fi; \\\n\t    if test -d $(srcdir)/$$file && test $$d != $(srcdir); then \\\n\t      cp -fpR $(srcdir)/$$file \"$(distdir)$$dir\" || exit 1; \\\n\t      find \"$(distdir)/$$file\" -type d ! -perm -700 -exec chmod u+rwx {} \\;; \\\n\t    fi; \\\n\t    cp -fpR $$d/$$file \"$(distdir)$$dir\" || exit 1; \\\n\t  else \\\n\t    test -f \"$(distdir)/$$file\" \\\n\t    || cp -p $$d/$$file \"$(distdir)/$$file\" \\\n\t    || exit 1; \\\n\t  fi; \\\n\tdone\ncheck-am: all-am\ncheck: check-am\nall-am: Makefile $(LTLIBRARIES)\ninstalldirs:\n\tfor dir in \"$(DESTDIR)$(libdir)\" \"$(DESTDIR)$(libfstdir)\"; do \\\n\t  test -z \"$$dir\" || $(MKDIR_P) \"$$dir\"; \\\n\tdone\ninstall: install-am\ninstall-exec: install-exec-am\ninstall-data: install-data-am\nuninstall: uninstall-am\n\ninstall-am: all-am\n\t@$(MAKE) $(AM_MAKEFLAGS) install-exec-am install-data-am\n\ninstallcheck: installcheck-am\ninstall-strip:\n\tif test -z '$(STRIP)'; then \\\n\t  $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" \\\n\t    install_sh_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" INSTALL_STRIP_FLAG=-s \\\n\t      install; \\\n\telse \\\n\t  $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" \\\n\t    install_sh_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" INSTALL_STRIP_FLAG=-s \\\n\t    \"INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'\" install; \\\n\tfi\nmostlyclean-generic:\n\nclean-generic:\n\ndistclean-generic:\n\t-test -z \"$(CONFIG_CLEAN_FILES)\" || rm -f $(CONFIG_CLEAN_FILES)\n\t-test . = \"$(srcdir)\" || test -z \"$(CONFIG_CLEAN_VPATH_FILES)\" || rm -f $(CONFIG_CLEAN_VPATH_FILES)\n\nmaintainer-clean-generic:\n\t@echo \"This command is intended for maintainers to use\"\n\t@echo \"it deletes files that may require special tools to rebuild.\"\nclean: clean-am\n\nclean-am: clean-generic clean-libLTLIBRARIES clean-libfstLTLIBRARIES \\\n\tclean-libtool mostlyclean-am\n\ndistclean: distclean-am\n\t-rm -rf ./$(DEPDIR)\n\t-rm -f Makefile\ndistclean-am: clean-am distclean-compile distclean-generic \\\n\tdistclean-tags\n\ndvi: dvi-am\n\ndvi-am:\n\nhtml: html-am\n\nhtml-am:\n\ninfo: info-am\n\ninfo-am:\n\ninstall-data-am: install-libfstLTLIBRARIES\n\ninstall-dvi: install-dvi-am\n\ninstall-dvi-am:\n\ninstall-exec-am: install-libLTLIBRARIES\n\ninstall-html: install-html-am\n\ninstall-html-am:\n\ninstall-info: install-info-am\n\ninstall-info-am:\n\ninstall-man:\n\ninstall-pdf: install-pdf-am\n\ninstall-pdf-am:\n\ninstall-ps: install-ps-am\n\ninstall-ps-am:\n\ninstallcheck-am:\n\nmaintainer-clean: maintainer-clean-am\n\t-rm -rf ./$(DEPDIR)\n\t-rm -f Makefile\nmaintainer-clean-am: distclean-am maintainer-clean-generic\n\nmostlyclean: mostlyclean-am\n\nmostlyclean-am: mostlyclean-compile mostlyclean-generic \\\n\tmostlyclean-libtool\n\npdf: pdf-am\n\npdf-am:\n\nps: ps-am\n\nps-am:\n\nuninstall-am: uninstall-libLTLIBRARIES uninstall-libfstLTLIBRARIES\n\n.MAKE: install-am install-strip\n\n.PHONY: CTAGS GTAGS TAGS all all-am check check-am clean clean-generic \\\n\tclean-libLTLIBRARIES clean-libfstLTLIBRARIES clean-libtool \\\n\tcscopelist-am ctags ctags-am distclean distclean-compile \\\n\tdistclean-generic distclean-libtool distclean-tags distdir dvi \\\n\tdvi-am html html-am info info-am install install-am \\\n\tinstall-data install-data-am install-dvi install-dvi-am \\\n\tinstall-exec install-exec-am install-html install-html-am \\\n\tinstall-info install-info-am install-libLTLIBRARIES \\\n\tinstall-libfstLTLIBRARIES install-man install-pdf \\\n\tinstall-pdf-am install-ps install-ps-am install-strip \\\n\tinstallcheck installcheck-am installdirs maintainer-clean \\\n\tmaintainer-clean-generic mostlyclean mostlyclean-compile \\\n\tmostlyclean-generic mostlyclean-libtool pdf pdf-am ps ps-am \\\n\ttags tags-am uninstall uninstall-am uninstall-libLTLIBRARIES \\\n\tuninstall-libfstLTLIBRARIES\n\n\n# Tell versions [3.59,3.63) of GNU make to not export all variables.\n# Otherwise a system limit (for SysV at least) may be exceeded.\n.NOEXPORT:\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/extensions/lookahead/arc_lookahead-fst.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/fst.h>\n#include <fst/matcher-fst.h>\n\nnamespace fst {\n\nstatic FstRegisterer<StdArcLookAheadFst> ArcLookAheadFst_StdArc_registerer;\nstatic FstRegisterer<MatcherFst<\n    ConstFst<LogArc>, ArcLookAheadMatcher<SortedMatcher<ConstFst<LogArc>>>,\n    arc_lookahead_fst_type>>\n    ArcLookAheadFst_LogArc_registerer;\nstatic FstRegisterer<MatcherFst<\n    ConstFst<Log64Arc>, ArcLookAheadMatcher<SortedMatcher<ConstFst<Log64Arc>>>,\n    arc_lookahead_fst_type>>\n    ArcLookAheadFst_Log64Arc_registerer;\n\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/extensions/lookahead/ilabel_lookahead-fst.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/fst.h>\n#include <fst/matcher-fst.h>\n\nnamespace fst {\n\nstatic FstRegisterer<StdILabelLookAheadFst>\n    ILabelLookAheadFst_StdArc_registerer;\nstatic FstRegisterer<MatcherFst<\n    ConstFst<LogArc>,\n    LabelLookAheadMatcher<SortedMatcher<ConstFst<LogArc>>,\n                          ilabel_lookahead_flags, FastLogAccumulator<LogArc>>,\n    ilabel_lookahead_fst_type, LabelLookAheadRelabeler<LogArc>>>\n    ILabelLookAheadFst_LogArc_registerer;\nstatic FstRegisterer<MatcherFst<\n    ConstFst<Log64Arc>,\n    LabelLookAheadMatcher<SortedMatcher<ConstFst<Log64Arc>>,\n                          ilabel_lookahead_flags, FastLogAccumulator<Log64Arc>>,\n    ilabel_lookahead_fst_type, LabelLookAheadRelabeler<Log64Arc>>>\n    ILabelLookAheadFst_Log64Arc_registerer;\n\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/extensions/lookahead/olabel_lookahead-fst.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/fst.h>\n#include <fst/matcher-fst.h>\n\nnamespace fst {\n\nstatic FstRegisterer<StdOLabelLookAheadFst>\n    OLabelLookAheadFst_StdArc_registerer;\nstatic FstRegisterer<MatcherFst<\n    ConstFst<LogArc>,\n    LabelLookAheadMatcher<SortedMatcher<ConstFst<LogArc>>,\n                          olabel_lookahead_flags, FastLogAccumulator<LogArc>>,\n    olabel_lookahead_fst_type, LabelLookAheadRelabeler<LogArc>>>\n    OLabelLookAheadFst_LogArc_registerer;\nstatic FstRegisterer<MatcherFst<\n    ConstFst<Log64Arc>,\n    LabelLookAheadMatcher<SortedMatcher<ConstFst<Log64Arc>>,\n                          olabel_lookahead_flags, FastLogAccumulator<Log64Arc>>,\n    olabel_lookahead_fst_type, LabelLookAheadRelabeler<Log64Arc>>>\n    OLabelLookAheadFst_Log64Arc_registerer;\n\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/extensions/mpdt/Makefile.am",
    "content": "AM_CPPFLAGS = -I$(srcdir)/../../include $(ICU_CPPFLAGS)\n\nif HAVE_BIN\nbin_PROGRAMS = mpdtcompose mpdtexpand mpdtinfo mpdtreverse\n\nLDADD = libfstmpdtscript.la      \\\n    ../pdt/libfstpdtscript.la    \\\n    ../../script/libfstscript.la \\\n    ../../lib/libfst.la -lm $(DL_LIBS)\n\nmpdtcompose_SOURCES = mpdtcompose.cc\n\nmpdtexpand_SOURCES = mpdtexpand.cc\n\nmpdtinfo_SOURCES = mpdtinfo.cc\n\nmpdtreverse_SOURCES = mpdtreverse.cc\nendif\n\nif HAVE_SCRIPT\nlib_LTLIBRARIES = libfstmpdtscript.la\nlibfstmpdtscript_la_SOURCES = mpdtscript.cc\nlibfstmpdtscript_la_LDFLAGS = -version-info 10:0:0\nlibfstmpdtscript_la_LIBADD = ../../script/libfstscript.la \\\n                             ../../lib/libfst.la -lm $(DL_LIBS)\nendif\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/extensions/mpdt/Makefile.in",
    "content": "# Makefile.in generated by automake 1.14.1 from Makefile.am.\n# @configure_input@\n\n# Copyright (C) 1994-2013 Free Software Foundation, Inc.\n\n# This Makefile.in is free software; the Free Software Foundation\n# gives unlimited permission to copy and/or distribute it,\n# with or without modifications, as long as this notice is preserved.\n\n# This program is distributed in the hope that it will be useful,\n# but WITHOUT ANY WARRANTY, to the extent permitted by law; without\n# even the implied warranty of MERCHANTABILITY or FITNESS FOR A\n# PARTICULAR PURPOSE.\n\n@SET_MAKE@\n\n\nVPATH = @srcdir@\nam__is_gnu_make = test -n '$(MAKEFILE_LIST)' && test -n '$(MAKELEVEL)'\nam__make_running_with_option = \\\n  case $${target_option-} in \\\n      ?) ;; \\\n      *) echo \"am__make_running_with_option: internal error: invalid\" \\\n              \"target option '$${target_option-}' specified\" >&2; \\\n         exit 1;; \\\n  esac; \\\n  has_opt=no; \\\n  sane_makeflags=$$MAKEFLAGS; \\\n  if $(am__is_gnu_make); then \\\n    sane_makeflags=$$MFLAGS; \\\n  else \\\n    case $$MAKEFLAGS in \\\n      *\\\\[\\ \\\t]*) \\\n        bs=\\\\; \\\n        sane_makeflags=`printf '%s\\n' \"$$MAKEFLAGS\" \\\n          | sed \"s/$$bs$$bs[$$bs $$bs\t]*//g\"`;; \\\n    esac; \\\n  fi; \\\n  skip_next=no; \\\n  strip_trailopt () \\\n  { \\\n    flg=`printf '%s\\n' \"$$flg\" | sed \"s/$$1.*$$//\"`; \\\n  }; \\\n  for flg in $$sane_makeflags; do \\\n    test $$skip_next = yes && { skip_next=no; continue; }; \\\n    case $$flg in \\\n      *=*|--*) continue;; \\\n        -*I) strip_trailopt 'I'; skip_next=yes;; \\\n      -*I?*) strip_trailopt 'I';; \\\n        -*O) strip_trailopt 'O'; skip_next=yes;; \\\n      -*O?*) strip_trailopt 'O';; \\\n        -*l) strip_trailopt 'l'; skip_next=yes;; \\\n      -*l?*) strip_trailopt 'l';; \\\n      -[dEDm]) skip_next=yes;; \\\n      -[JT]) skip_next=yes;; \\\n    esac; \\\n    case $$flg in \\\n      *$$target_option*) has_opt=yes; break;; \\\n    esac; \\\n  done; \\\n  test $$has_opt = yes\nam__make_dryrun = (target_option=n; $(am__make_running_with_option))\nam__make_keepgoing = (target_option=k; $(am__make_running_with_option))\npkgdatadir = $(datadir)/@PACKAGE@\npkgincludedir = $(includedir)/@PACKAGE@\npkglibdir = $(libdir)/@PACKAGE@\npkglibexecdir = $(libexecdir)/@PACKAGE@\nam__cd = CDPATH=\"$${ZSH_VERSION+.}$(PATH_SEPARATOR)\" && cd\ninstall_sh_DATA = $(install_sh) -c -m 644\ninstall_sh_PROGRAM = $(install_sh) -c\ninstall_sh_SCRIPT = $(install_sh) -c\nINSTALL_HEADER = $(INSTALL_DATA)\ntransform = $(program_transform_name)\nNORMAL_INSTALL = :\nPRE_INSTALL = :\nPOST_INSTALL = :\nNORMAL_UNINSTALL = :\nPRE_UNINSTALL = :\nPOST_UNINSTALL = :\nbuild_triplet = @build@\nhost_triplet = @host@\n@HAVE_BIN_TRUE@bin_PROGRAMS = mpdtcompose$(EXEEXT) mpdtexpand$(EXEEXT) \\\n@HAVE_BIN_TRUE@\tmpdtinfo$(EXEEXT) mpdtreverse$(EXEEXT)\nsubdir = src/extensions/mpdt\nDIST_COMMON = $(srcdir)/Makefile.in $(srcdir)/Makefile.am \\\n\t$(top_srcdir)/depcomp\nACLOCAL_M4 = $(top_srcdir)/aclocal.m4\nam__aclocal_m4_deps = $(top_srcdir)/m4/ac_python_devel.m4 \\\n\t$(top_srcdir)/m4/libtool.m4 $(top_srcdir)/m4/ltoptions.m4 \\\n\t$(top_srcdir)/m4/ltsugar.m4 $(top_srcdir)/m4/ltversion.m4 \\\n\t$(top_srcdir)/m4/lt~obsolete.m4 $(top_srcdir)/configure.ac\nam__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \\\n\t$(ACLOCAL_M4)\nmkinstalldirs = $(install_sh) -d\nCONFIG_HEADER = $(top_builddir)/config.h \\\n\t$(top_builddir)/src/include/fst/config.h\nCONFIG_CLEAN_FILES =\nCONFIG_CLEAN_VPATH_FILES =\nam__vpath_adj_setup = srcdirstrip=`echo \"$(srcdir)\" | sed 's|.|.|g'`;\nam__vpath_adj = case $$p in \\\n    $(srcdir)/*) f=`echo \"$$p\" | sed \"s|^$$srcdirstrip/||\"`;; \\\n    *) f=$$p;; \\\n  esac;\nam__strip_dir = f=`echo $$p | sed -e 's|^.*/||'`;\nam__install_max = 40\nam__nobase_strip_setup = \\\n  srcdirstrip=`echo \"$(srcdir)\" | sed 's/[].[^$$\\\\*|]/\\\\\\\\&/g'`\nam__nobase_strip = \\\n  for p in $$list; do echo \"$$p\"; done | sed -e \"s|$$srcdirstrip/||\"\nam__nobase_list = $(am__nobase_strip_setup); \\\n  for p in $$list; do echo \"$$p $$p\"; done | \\\n  sed \"s| $$srcdirstrip/| |;\"' / .*\\//!s/ .*/ ./; s,\\( .*\\)/[^/]*$$,\\1,' | \\\n  $(AWK) 'BEGIN { files[\".\"] = \"\" } { files[$$2] = files[$$2] \" \" $$1; \\\n    if (++n[$$2] == $(am__install_max)) \\\n      { print $$2, files[$$2]; n[$$2] = 0; files[$$2] = \"\" } } \\\n    END { for (dir in files) print dir, files[dir] }'\nam__base_list = \\\n  sed '$$!N;$$!N;$$!N;$$!N;$$!N;$$!N;$$!N;s/\\n/ /g' | \\\n  sed '$$!N;$$!N;$$!N;$$!N;s/\\n/ /g'\nam__uninstall_files_from_dir = { \\\n  test -z \"$$files\" \\\n    || { test ! -d \"$$dir\" && test ! -f \"$$dir\" && test ! -r \"$$dir\"; } \\\n    || { echo \" ( cd '$$dir' && rm -f\" $$files \")\"; \\\n         $(am__cd) \"$$dir\" && rm -f $$files; }; \\\n  }\nam__installdirs = \"$(DESTDIR)$(libdir)\" \"$(DESTDIR)$(bindir)\"\nLTLIBRARIES = $(lib_LTLIBRARIES)\nam__DEPENDENCIES_1 =\n@HAVE_SCRIPT_TRUE@libfstmpdtscript_la_DEPENDENCIES =  \\\n@HAVE_SCRIPT_TRUE@\t../../script/libfstscript.la \\\n@HAVE_SCRIPT_TRUE@\t../../lib/libfst.la $(am__DEPENDENCIES_1)\nam__libfstmpdtscript_la_SOURCES_DIST = mpdtscript.cc\n@HAVE_SCRIPT_TRUE@am_libfstmpdtscript_la_OBJECTS = mpdtscript.lo\nlibfstmpdtscript_la_OBJECTS = $(am_libfstmpdtscript_la_OBJECTS)\nAM_V_lt = $(am__v_lt_@AM_V@)\nam__v_lt_ = $(am__v_lt_@AM_DEFAULT_V@)\nam__v_lt_0 = --silent\nam__v_lt_1 = \nlibfstmpdtscript_la_LINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX \\\n\t$(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=link $(CXXLD) \\\n\t$(AM_CXXFLAGS) $(CXXFLAGS) $(libfstmpdtscript_la_LDFLAGS) \\\n\t$(LDFLAGS) -o $@\n@HAVE_SCRIPT_TRUE@am_libfstmpdtscript_la_rpath = -rpath $(libdir)\nPROGRAMS = $(bin_PROGRAMS)\nam__mpdtcompose_SOURCES_DIST = mpdtcompose.cc\n@HAVE_BIN_TRUE@am_mpdtcompose_OBJECTS = mpdtcompose.$(OBJEXT)\nmpdtcompose_OBJECTS = $(am_mpdtcompose_OBJECTS)\nmpdtcompose_LDADD = $(LDADD)\n@HAVE_BIN_TRUE@mpdtcompose_DEPENDENCIES = libfstmpdtscript.la \\\n@HAVE_BIN_TRUE@\t../pdt/libfstpdtscript.la \\\n@HAVE_BIN_TRUE@\t../../script/libfstscript.la \\\n@HAVE_BIN_TRUE@\t../../lib/libfst.la $(am__DEPENDENCIES_1)\nam__mpdtexpand_SOURCES_DIST = mpdtexpand.cc\n@HAVE_BIN_TRUE@am_mpdtexpand_OBJECTS = mpdtexpand.$(OBJEXT)\nmpdtexpand_OBJECTS = $(am_mpdtexpand_OBJECTS)\nmpdtexpand_LDADD = $(LDADD)\n@HAVE_BIN_TRUE@mpdtexpand_DEPENDENCIES = libfstmpdtscript.la \\\n@HAVE_BIN_TRUE@\t../pdt/libfstpdtscript.la \\\n@HAVE_BIN_TRUE@\t../../script/libfstscript.la \\\n@HAVE_BIN_TRUE@\t../../lib/libfst.la $(am__DEPENDENCIES_1)\nam__mpdtinfo_SOURCES_DIST = mpdtinfo.cc\n@HAVE_BIN_TRUE@am_mpdtinfo_OBJECTS = mpdtinfo.$(OBJEXT)\nmpdtinfo_OBJECTS = $(am_mpdtinfo_OBJECTS)\nmpdtinfo_LDADD = $(LDADD)\n@HAVE_BIN_TRUE@mpdtinfo_DEPENDENCIES = libfstmpdtscript.la \\\n@HAVE_BIN_TRUE@\t../pdt/libfstpdtscript.la \\\n@HAVE_BIN_TRUE@\t../../script/libfstscript.la \\\n@HAVE_BIN_TRUE@\t../../lib/libfst.la $(am__DEPENDENCIES_1)\nam__mpdtreverse_SOURCES_DIST = mpdtreverse.cc\n@HAVE_BIN_TRUE@am_mpdtreverse_OBJECTS = mpdtreverse.$(OBJEXT)\nmpdtreverse_OBJECTS = $(am_mpdtreverse_OBJECTS)\nmpdtreverse_LDADD = $(LDADD)\n@HAVE_BIN_TRUE@mpdtreverse_DEPENDENCIES = libfstmpdtscript.la \\\n@HAVE_BIN_TRUE@\t../pdt/libfstpdtscript.la \\\n@HAVE_BIN_TRUE@\t../../script/libfstscript.la \\\n@HAVE_BIN_TRUE@\t../../lib/libfst.la $(am__DEPENDENCIES_1)\nAM_V_P = $(am__v_P_@AM_V@)\nam__v_P_ = $(am__v_P_@AM_DEFAULT_V@)\nam__v_P_0 = false\nam__v_P_1 = :\nAM_V_GEN = $(am__v_GEN_@AM_V@)\nam__v_GEN_ = $(am__v_GEN_@AM_DEFAULT_V@)\nam__v_GEN_0 = @echo \"  GEN     \" $@;\nam__v_GEN_1 = \nAM_V_at = $(am__v_at_@AM_V@)\nam__v_at_ = $(am__v_at_@AM_DEFAULT_V@)\nam__v_at_0 = @\nam__v_at_1 = \nDEFAULT_INCLUDES = \ndepcomp = $(SHELL) $(top_srcdir)/depcomp\nam__depfiles_maybe = depfiles\nam__mv = mv -f\nCXXCOMPILE = $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) \\\n\t$(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS)\nLTCXXCOMPILE = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \\\n\t$(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) \\\n\t$(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) \\\n\t$(AM_CXXFLAGS) $(CXXFLAGS)\nAM_V_CXX = $(am__v_CXX_@AM_V@)\nam__v_CXX_ = $(am__v_CXX_@AM_DEFAULT_V@)\nam__v_CXX_0 = @echo \"  CXX     \" $@;\nam__v_CXX_1 = \nCXXLD = $(CXX)\nCXXLINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \\\n\t$(LIBTOOLFLAGS) --mode=link $(CXXLD) $(AM_CXXFLAGS) \\\n\t$(CXXFLAGS) $(AM_LDFLAGS) $(LDFLAGS) -o $@\nAM_V_CXXLD = $(am__v_CXXLD_@AM_V@)\nam__v_CXXLD_ = $(am__v_CXXLD_@AM_DEFAULT_V@)\nam__v_CXXLD_0 = @echo \"  CXXLD   \" $@;\nam__v_CXXLD_1 = \nSOURCES = $(libfstmpdtscript_la_SOURCES) $(mpdtcompose_SOURCES) \\\n\t$(mpdtexpand_SOURCES) $(mpdtinfo_SOURCES) \\\n\t$(mpdtreverse_SOURCES)\nDIST_SOURCES = $(am__libfstmpdtscript_la_SOURCES_DIST) \\\n\t$(am__mpdtcompose_SOURCES_DIST) $(am__mpdtexpand_SOURCES_DIST) \\\n\t$(am__mpdtinfo_SOURCES_DIST) $(am__mpdtreverse_SOURCES_DIST)\nam__can_run_installinfo = \\\n  case $$AM_UPDATE_INFO_DIR in \\\n    n|no|NO) false;; \\\n    *) (install-info --version) >/dev/null 2>&1;; \\\n  esac\nam__tagged_files = $(HEADERS) $(SOURCES) $(TAGS_FILES) $(LISP)\n# Read a list of newline-separated strings from the standard input,\n# and print each of them once, without duplicates.  Input order is\n# *not* preserved.\nam__uniquify_input = $(AWK) '\\\n  BEGIN { nonempty = 0; } \\\n  { items[$$0] = 1; nonempty = 1; } \\\n  END { if (nonempty) { for (i in items) print i; }; } \\\n'\n# Make sure the list of sources is unique.  This is necessary because,\n# e.g., the same source file might be shared among _SOURCES variables\n# for different programs/libraries.\nam__define_uniq_tagged_files = \\\n  list='$(am__tagged_files)'; \\\n  unique=`for i in $$list; do \\\n    if test -f \"$$i\"; then echo $$i; else echo $(srcdir)/$$i; fi; \\\n  done | $(am__uniquify_input)`\nETAGS = etags\nCTAGS = ctags\nDISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST)\nACLOCAL = @ACLOCAL@\nAMTAR = @AMTAR@\nAM_DEFAULT_VERBOSITY = @AM_DEFAULT_VERBOSITY@\nAR = @AR@\nAUTOCONF = @AUTOCONF@\nAUTOHEADER = @AUTOHEADER@\nAUTOMAKE = @AUTOMAKE@\nAWK = @AWK@\nCC = @CC@\nCCDEPMODE = @CCDEPMODE@\nCFLAGS = @CFLAGS@\nCPP = @CPP@\nCPPFLAGS = @CPPFLAGS@\nCXX = @CXX@\nCXXCPP = @CXXCPP@\nCXXDEPMODE = @CXXDEPMODE@\nCXXFLAGS = @CXXFLAGS@\nCYGPATH_W = @CYGPATH_W@\nDEFS = @DEFS@\nDEPDIR = @DEPDIR@\nDLLTOOL = @DLLTOOL@\nDL_LIBS = @DL_LIBS@\nDSYMUTIL = @DSYMUTIL@\nDUMPBIN = @DUMPBIN@\nECHO_C = @ECHO_C@\nECHO_N = @ECHO_N@\nECHO_T = @ECHO_T@\nEGREP = @EGREP@\nEXEEXT = @EXEEXT@\nFGREP = @FGREP@\nGREP = @GREP@\nINSTALL = @INSTALL@\nINSTALL_DATA = @INSTALL_DATA@\nINSTALL_PROGRAM = @INSTALL_PROGRAM@\nINSTALL_SCRIPT = @INSTALL_SCRIPT@\nINSTALL_STRIP_PROGRAM = @INSTALL_STRIP_PROGRAM@\nLD = @LD@\nLDFLAGS = @LDFLAGS@\nLIBOBJS = @LIBOBJS@\nLIBS = @LIBS@\nLIBTOOL = @LIBTOOL@\nLIPO = @LIPO@\nLN_S = @LN_S@\nLTLIBOBJS = @LTLIBOBJS@\nMAKEINFO = @MAKEINFO@\nMANIFEST_TOOL = @MANIFEST_TOOL@\nMKDIR_P = @MKDIR_P@\nNM = @NM@\nNMEDIT = @NMEDIT@\nOBJDUMP = @OBJDUMP@\nOBJEXT = @OBJEXT@\nOTOOL = @OTOOL@\nOTOOL64 = @OTOOL64@\nPACKAGE = @PACKAGE@\nPACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@\nPACKAGE_NAME = @PACKAGE_NAME@\nPACKAGE_STRING = @PACKAGE_STRING@\nPACKAGE_TARNAME = @PACKAGE_TARNAME@\nPACKAGE_URL = @PACKAGE_URL@\nPACKAGE_VERSION = @PACKAGE_VERSION@\nPATH_SEPARATOR = @PATH_SEPARATOR@\nPYTHON = @PYTHON@\nPYTHON_CPPFLAGS = @PYTHON_CPPFLAGS@\nPYTHON_EXEC_PREFIX = @PYTHON_EXEC_PREFIX@\nPYTHON_EXTRA_LDFLAGS = @PYTHON_EXTRA_LDFLAGS@\nPYTHON_EXTRA_LIBS = @PYTHON_EXTRA_LIBS@\nPYTHON_LDFLAGS = @PYTHON_LDFLAGS@\nPYTHON_PLATFORM = @PYTHON_PLATFORM@\nPYTHON_PREFIX = @PYTHON_PREFIX@\nPYTHON_SITE_PKG = @PYTHON_SITE_PKG@\nPYTHON_VERSION = @PYTHON_VERSION@\nRANLIB = @RANLIB@\nSED = @SED@\nSET_MAKE = @SET_MAKE@\nSHELL = @SHELL@\nSTRIP = @STRIP@\nVERSION = @VERSION@\nabs_builddir = @abs_builddir@\nabs_srcdir = @abs_srcdir@\nabs_top_builddir = @abs_top_builddir@\nabs_top_srcdir = @abs_top_srcdir@\nac_ct_AR = @ac_ct_AR@\nac_ct_CC = @ac_ct_CC@\nac_ct_CXX = @ac_ct_CXX@\nac_ct_DUMPBIN = @ac_ct_DUMPBIN@\nam__include = @am__include@\nam__leading_dot = @am__leading_dot@\nam__quote = @am__quote@\nam__tar = @am__tar@\nam__untar = @am__untar@\nbindir = @bindir@\nbuild = @build@\nbuild_alias = @build_alias@\nbuild_cpu = @build_cpu@\nbuild_os = @build_os@\nbuild_vendor = @build_vendor@\nbuilddir = @builddir@\ndatadir = @datadir@\ndatarootdir = @datarootdir@\ndocdir = @docdir@\ndvidir = @dvidir@\nexec_prefix = @exec_prefix@\nhost = @host@\nhost_alias = @host_alias@\nhost_cpu = @host_cpu@\nhost_os = @host_os@\nhost_vendor = @host_vendor@\nhtmldir = @htmldir@\nincludedir = @includedir@\ninfodir = @infodir@\ninstall_sh = @install_sh@\nlibdir = @libdir@\nlibexecdir = @libexecdir@\nlibfstdir = @libfstdir@\nlocaledir = @localedir@\nlocalstatedir = @localstatedir@\nmandir = @mandir@\nmkdir_p = @mkdir_p@\noldincludedir = @oldincludedir@\npdfdir = @pdfdir@\npkgpyexecdir = @pkgpyexecdir@\npkgpythondir = @pkgpythondir@\nprefix = @prefix@\nprogram_transform_name = @program_transform_name@\npsdir = @psdir@\npyexecdir = @pyexecdir@\npythondir = @pythondir@\nsbindir = @sbindir@\nsharedstatedir = @sharedstatedir@\nsrcdir = @srcdir@\nsysconfdir = @sysconfdir@\ntarget_alias = @target_alias@\ntop_build_prefix = @top_build_prefix@\ntop_builddir = @top_builddir@\ntop_srcdir = @top_srcdir@\nAM_CPPFLAGS = -I$(srcdir)/../../include $(ICU_CPPFLAGS)\n@HAVE_BIN_TRUE@LDADD = libfstmpdtscript.la      \\\n@HAVE_BIN_TRUE@    ../pdt/libfstpdtscript.la    \\\n@HAVE_BIN_TRUE@    ../../script/libfstscript.la \\\n@HAVE_BIN_TRUE@    ../../lib/libfst.la -lm $(DL_LIBS)\n\n@HAVE_BIN_TRUE@mpdtcompose_SOURCES = mpdtcompose.cc\n@HAVE_BIN_TRUE@mpdtexpand_SOURCES = mpdtexpand.cc\n@HAVE_BIN_TRUE@mpdtinfo_SOURCES = mpdtinfo.cc\n@HAVE_BIN_TRUE@mpdtreverse_SOURCES = mpdtreverse.cc\n@HAVE_SCRIPT_TRUE@lib_LTLIBRARIES = libfstmpdtscript.la\n@HAVE_SCRIPT_TRUE@libfstmpdtscript_la_SOURCES = mpdtscript.cc\n@HAVE_SCRIPT_TRUE@libfstmpdtscript_la_LDFLAGS = -version-info 10:0:0\n@HAVE_SCRIPT_TRUE@libfstmpdtscript_la_LIBADD = ../../script/libfstscript.la \\\n@HAVE_SCRIPT_TRUE@                             ../../lib/libfst.la -lm $(DL_LIBS)\n\nall: all-am\n\n.SUFFIXES:\n.SUFFIXES: .cc .lo .o .obj\n$(srcdir)/Makefile.in:  $(srcdir)/Makefile.am  $(am__configure_deps)\n\t@for dep in $?; do \\\n\t  case '$(am__configure_deps)' in \\\n\t    *$$dep*) \\\n\t      ( cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh ) \\\n\t        && { if test -f $@; then exit 0; else break; fi; }; \\\n\t      exit 1;; \\\n\t  esac; \\\n\tdone; \\\n\techo ' cd $(top_srcdir) && $(AUTOMAKE) --foreign src/extensions/mpdt/Makefile'; \\\n\t$(am__cd) $(top_srcdir) && \\\n\t  $(AUTOMAKE) --foreign src/extensions/mpdt/Makefile\n.PRECIOUS: Makefile\nMakefile: $(srcdir)/Makefile.in $(top_builddir)/config.status\n\t@case '$?' in \\\n\t  *config.status*) \\\n\t    cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh;; \\\n\t  *) \\\n\t    echo ' cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe)'; \\\n\t    cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe);; \\\n\tesac;\n\n$(top_builddir)/config.status: $(top_srcdir)/configure $(CONFIG_STATUS_DEPENDENCIES)\n\tcd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh\n\n$(top_srcdir)/configure:  $(am__configure_deps)\n\tcd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh\n$(ACLOCAL_M4):  $(am__aclocal_m4_deps)\n\tcd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh\n$(am__aclocal_m4_deps):\n\ninstall-libLTLIBRARIES: $(lib_LTLIBRARIES)\n\t@$(NORMAL_INSTALL)\n\t@list='$(lib_LTLIBRARIES)'; test -n \"$(libdir)\" || list=; \\\n\tlist2=; for p in $$list; do \\\n\t  if test -f $$p; then \\\n\t    list2=\"$$list2 $$p\"; \\\n\t  else :; fi; \\\n\tdone; \\\n\ttest -z \"$$list2\" || { \\\n\t  echo \" $(MKDIR_P) '$(DESTDIR)$(libdir)'\"; \\\n\t  $(MKDIR_P) \"$(DESTDIR)$(libdir)\" || exit 1; \\\n\t  echo \" $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) $$list2 '$(DESTDIR)$(libdir)'\"; \\\n\t  $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) $$list2 \"$(DESTDIR)$(libdir)\"; \\\n\t}\n\nuninstall-libLTLIBRARIES:\n\t@$(NORMAL_UNINSTALL)\n\t@list='$(lib_LTLIBRARIES)'; test -n \"$(libdir)\" || list=; \\\n\tfor p in $$list; do \\\n\t  $(am__strip_dir) \\\n\t  echo \" $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=uninstall rm -f '$(DESTDIR)$(libdir)/$$f'\"; \\\n\t  $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=uninstall rm -f \"$(DESTDIR)$(libdir)/$$f\"; \\\n\tdone\n\nclean-libLTLIBRARIES:\n\t-test -z \"$(lib_LTLIBRARIES)\" || rm -f $(lib_LTLIBRARIES)\n\t@list='$(lib_LTLIBRARIES)'; \\\n\tlocs=`for p in $$list; do echo $$p; done | \\\n\t      sed 's|^[^/]*$$|.|; s|/[^/]*$$||; s|$$|/so_locations|' | \\\n\t      sort -u`; \\\n\ttest -z \"$$locs\" || { \\\n\t  echo rm -f $${locs}; \\\n\t  rm -f $${locs}; \\\n\t}\n\nlibfstmpdtscript.la: $(libfstmpdtscript_la_OBJECTS) $(libfstmpdtscript_la_DEPENDENCIES) $(EXTRA_libfstmpdtscript_la_DEPENDENCIES) \n\t$(AM_V_CXXLD)$(libfstmpdtscript_la_LINK) $(am_libfstmpdtscript_la_rpath) $(libfstmpdtscript_la_OBJECTS) $(libfstmpdtscript_la_LIBADD) $(LIBS)\ninstall-binPROGRAMS: $(bin_PROGRAMS)\n\t@$(NORMAL_INSTALL)\n\t@list='$(bin_PROGRAMS)'; test -n \"$(bindir)\" || list=; \\\n\tif test -n \"$$list\"; then \\\n\t  echo \" $(MKDIR_P) '$(DESTDIR)$(bindir)'\"; \\\n\t  $(MKDIR_P) \"$(DESTDIR)$(bindir)\" || exit 1; \\\n\tfi; \\\n\tfor p in $$list; do echo \"$$p $$p\"; done | \\\n\tsed 's/$(EXEEXT)$$//' | \\\n\twhile read p p1; do if test -f $$p \\\n\t || test -f $$p1 \\\n\t  ; then echo \"$$p\"; echo \"$$p\"; else :; fi; \\\n\tdone | \\\n\tsed -e 'p;s,.*/,,;n;h' \\\n\t    -e 's|.*|.|' \\\n\t    -e 'p;x;s,.*/,,;s/$(EXEEXT)$$//;$(transform);s/$$/$(EXEEXT)/' | \\\n\tsed 'N;N;N;s,\\n, ,g' | \\\n\t$(AWK) 'BEGIN { files[\".\"] = \"\"; dirs[\".\"] = 1 } \\\n\t  { d=$$3; if (dirs[d] != 1) { print \"d\", d; dirs[d] = 1 } \\\n\t    if ($$2 == $$4) files[d] = files[d] \" \" $$1; \\\n\t    else { print \"f\", $$3 \"/\" $$4, $$1; } } \\\n\t  END { for (d in files) print \"f\", d, files[d] }' | \\\n\twhile read type dir files; do \\\n\t    if test \"$$dir\" = .; then dir=; else dir=/$$dir; fi; \\\n\t    test -z \"$$files\" || { \\\n\t    echo \" $(INSTALL_PROGRAM_ENV) $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL_PROGRAM) $$files '$(DESTDIR)$(bindir)$$dir'\"; \\\n\t    $(INSTALL_PROGRAM_ENV) $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL_PROGRAM) $$files \"$(DESTDIR)$(bindir)$$dir\" || exit $$?; \\\n\t    } \\\n\t; done\n\nuninstall-binPROGRAMS:\n\t@$(NORMAL_UNINSTALL)\n\t@list='$(bin_PROGRAMS)'; test -n \"$(bindir)\" || list=; \\\n\tfiles=`for p in $$list; do echo \"$$p\"; done | \\\n\t  sed -e 'h;s,^.*/,,;s/$(EXEEXT)$$//;$(transform)' \\\n\t      -e 's/$$/$(EXEEXT)/' \\\n\t`; \\\n\ttest -n \"$$list\" || exit 0; \\\n\techo \" ( cd '$(DESTDIR)$(bindir)' && rm -f\" $$files \")\"; \\\n\tcd \"$(DESTDIR)$(bindir)\" && rm -f $$files\n\nclean-binPROGRAMS:\n\t@list='$(bin_PROGRAMS)'; test -n \"$$list\" || exit 0; \\\n\techo \" rm -f\" $$list; \\\n\trm -f $$list || exit $$?; \\\n\ttest -n \"$(EXEEXT)\" || exit 0; \\\n\tlist=`for p in $$list; do echo \"$$p\"; done | sed 's/$(EXEEXT)$$//'`; \\\n\techo \" rm -f\" $$list; \\\n\trm -f $$list\n\nmpdtcompose$(EXEEXT): $(mpdtcompose_OBJECTS) $(mpdtcompose_DEPENDENCIES) $(EXTRA_mpdtcompose_DEPENDENCIES) \n\t@rm -f mpdtcompose$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(mpdtcompose_OBJECTS) $(mpdtcompose_LDADD) $(LIBS)\n\nmpdtexpand$(EXEEXT): $(mpdtexpand_OBJECTS) $(mpdtexpand_DEPENDENCIES) $(EXTRA_mpdtexpand_DEPENDENCIES) \n\t@rm -f mpdtexpand$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(mpdtexpand_OBJECTS) $(mpdtexpand_LDADD) $(LIBS)\n\nmpdtinfo$(EXEEXT): $(mpdtinfo_OBJECTS) $(mpdtinfo_DEPENDENCIES) $(EXTRA_mpdtinfo_DEPENDENCIES) \n\t@rm -f mpdtinfo$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(mpdtinfo_OBJECTS) $(mpdtinfo_LDADD) $(LIBS)\n\nmpdtreverse$(EXEEXT): $(mpdtreverse_OBJECTS) $(mpdtreverse_DEPENDENCIES) $(EXTRA_mpdtreverse_DEPENDENCIES) \n\t@rm -f mpdtreverse$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(mpdtreverse_OBJECTS) $(mpdtreverse_LDADD) $(LIBS)\n\nmostlyclean-compile:\n\t-rm -f *.$(OBJEXT)\n\ndistclean-compile:\n\t-rm -f *.tab.c\n\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/mpdtcompose.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/mpdtexpand.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/mpdtinfo.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/mpdtreverse.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/mpdtscript.Plo@am__quote@\n\n.cc.o:\n@am__fastdepCXX_TRUE@\t$(AM_V_CXX)depbase=`echo $@ | sed 's|[^/]*$$|$(DEPDIR)/&|;s|\\.o$$||'`;\\\n@am__fastdepCXX_TRUE@\t$(CXXCOMPILE) -MT $@ -MD -MP -MF $$depbase.Tpo -c -o $@ $< &&\\\n@am__fastdepCXX_TRUE@\t$(am__mv) $$depbase.Tpo $$depbase.Po\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\t$(AM_V_CXX)source='$<' object='$@' libtool=no @AMDEPBACKSLASH@\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\tDEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@\n@am__fastdepCXX_FALSE@\t$(AM_V_CXX@am__nodep@)$(CXXCOMPILE) -c -o $@ $<\n\n.cc.obj:\n@am__fastdepCXX_TRUE@\t$(AM_V_CXX)depbase=`echo $@ | sed 's|[^/]*$$|$(DEPDIR)/&|;s|\\.obj$$||'`;\\\n@am__fastdepCXX_TRUE@\t$(CXXCOMPILE) -MT $@ -MD -MP -MF $$depbase.Tpo -c -o $@ `$(CYGPATH_W) '$<'` &&\\\n@am__fastdepCXX_TRUE@\t$(am__mv) $$depbase.Tpo $$depbase.Po\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\t$(AM_V_CXX)source='$<' object='$@' libtool=no @AMDEPBACKSLASH@\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\tDEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@\n@am__fastdepCXX_FALSE@\t$(AM_V_CXX@am__nodep@)$(CXXCOMPILE) -c -o $@ `$(CYGPATH_W) '$<'`\n\n.cc.lo:\n@am__fastdepCXX_TRUE@\t$(AM_V_CXX)depbase=`echo $@ | sed 's|[^/]*$$|$(DEPDIR)/&|;s|\\.lo$$||'`;\\\n@am__fastdepCXX_TRUE@\t$(LTCXXCOMPILE) -MT $@ -MD -MP -MF $$depbase.Tpo -c -o $@ $< &&\\\n@am__fastdepCXX_TRUE@\t$(am__mv) $$depbase.Tpo $$depbase.Plo\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\t$(AM_V_CXX)source='$<' object='$@' libtool=yes @AMDEPBACKSLASH@\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\tDEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@\n@am__fastdepCXX_FALSE@\t$(AM_V_CXX@am__nodep@)$(LTCXXCOMPILE) -c -o $@ $<\n\nmostlyclean-libtool:\n\t-rm -f *.lo\n\nclean-libtool:\n\t-rm -rf .libs _libs\n\nID: $(am__tagged_files)\n\t$(am__define_uniq_tagged_files); mkid -fID $$unique\ntags: tags-am\nTAGS: tags\n\ntags-am: $(TAGS_DEPENDENCIES) $(am__tagged_files)\n\tset x; \\\n\there=`pwd`; \\\n\t$(am__define_uniq_tagged_files); \\\n\tshift; \\\n\tif test -z \"$(ETAGS_ARGS)$$*$$unique\"; then :; else \\\n\t  test -n \"$$unique\" || unique=$$empty_fix; \\\n\t  if test $$# -gt 0; then \\\n\t    $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \\\n\t      \"$$@\" $$unique; \\\n\t  else \\\n\t    $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \\\n\t      $$unique; \\\n\t  fi; \\\n\tfi\nctags: ctags-am\n\nCTAGS: ctags\nctags-am: $(TAGS_DEPENDENCIES) $(am__tagged_files)\n\t$(am__define_uniq_tagged_files); \\\n\ttest -z \"$(CTAGS_ARGS)$$unique\" \\\n\t  || $(CTAGS) $(CTAGSFLAGS) $(AM_CTAGSFLAGS) $(CTAGS_ARGS) \\\n\t     $$unique\n\nGTAGS:\n\there=`$(am__cd) $(top_builddir) && pwd` \\\n\t  && $(am__cd) $(top_srcdir) \\\n\t  && gtags -i $(GTAGS_ARGS) \"$$here\"\ncscopelist: cscopelist-am\n\ncscopelist-am: $(am__tagged_files)\n\tlist='$(am__tagged_files)'; \\\n\tcase \"$(srcdir)\" in \\\n\t  [\\\\/]* | ?:[\\\\/]*) sdir=\"$(srcdir)\" ;; \\\n\t  *) sdir=$(subdir)/$(srcdir) ;; \\\n\tesac; \\\n\tfor i in $$list; do \\\n\t  if test -f \"$$i\"; then \\\n\t    echo \"$(subdir)/$$i\"; \\\n\t  else \\\n\t    echo \"$$sdir/$$i\"; \\\n\t  fi; \\\n\tdone >> $(top_builddir)/cscope.files\n\ndistclean-tags:\n\t-rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags\n\ndistdir: $(DISTFILES)\n\t@srcdirstrip=`echo \"$(srcdir)\" | sed 's/[].[^$$\\\\*]/\\\\\\\\&/g'`; \\\n\ttopsrcdirstrip=`echo \"$(top_srcdir)\" | sed 's/[].[^$$\\\\*]/\\\\\\\\&/g'`; \\\n\tlist='$(DISTFILES)'; \\\n\t  dist_files=`for file in $$list; do echo $$file; done | \\\n\t  sed -e \"s|^$$srcdirstrip/||;t\" \\\n\t      -e \"s|^$$topsrcdirstrip/|$(top_builddir)/|;t\"`; \\\n\tcase $$dist_files in \\\n\t  */*) $(MKDIR_P) `echo \"$$dist_files\" | \\\n\t\t\t   sed '/\\//!d;s|^|$(distdir)/|;s,/[^/]*$$,,' | \\\n\t\t\t   sort -u` ;; \\\n\tesac; \\\n\tfor file in $$dist_files; do \\\n\t  if test -f $$file || test -d $$file; then d=.; else d=$(srcdir); fi; \\\n\t  if test -d $$d/$$file; then \\\n\t    dir=`echo \"/$$file\" | sed -e 's,/[^/]*$$,,'`; \\\n\t    if test -d \"$(distdir)/$$file\"; then \\\n\t      find \"$(distdir)/$$file\" -type d ! -perm -700 -exec chmod u+rwx {} \\;; \\\n\t    fi; \\\n\t    if test -d $(srcdir)/$$file && test $$d != $(srcdir); then \\\n\t      cp -fpR $(srcdir)/$$file \"$(distdir)$$dir\" || exit 1; \\\n\t      find \"$(distdir)/$$file\" -type d ! -perm -700 -exec chmod u+rwx {} \\;; \\\n\t    fi; \\\n\t    cp -fpR $$d/$$file \"$(distdir)$$dir\" || exit 1; \\\n\t  else \\\n\t    test -f \"$(distdir)/$$file\" \\\n\t    || cp -p $$d/$$file \"$(distdir)/$$file\" \\\n\t    || exit 1; \\\n\t  fi; \\\n\tdone\ncheck-am: all-am\ncheck: check-am\nall-am: Makefile $(LTLIBRARIES) $(PROGRAMS)\ninstall-binPROGRAMS: install-libLTLIBRARIES\n\ninstalldirs:\n\tfor dir in \"$(DESTDIR)$(libdir)\" \"$(DESTDIR)$(bindir)\"; do \\\n\t  test -z \"$$dir\" || $(MKDIR_P) \"$$dir\"; \\\n\tdone\ninstall: install-am\ninstall-exec: install-exec-am\ninstall-data: install-data-am\nuninstall: uninstall-am\n\ninstall-am: all-am\n\t@$(MAKE) $(AM_MAKEFLAGS) install-exec-am install-data-am\n\ninstallcheck: installcheck-am\ninstall-strip:\n\tif test -z '$(STRIP)'; then \\\n\t  $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" \\\n\t    install_sh_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" INSTALL_STRIP_FLAG=-s \\\n\t      install; \\\n\telse \\\n\t  $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" \\\n\t    install_sh_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" INSTALL_STRIP_FLAG=-s \\\n\t    \"INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'\" install; \\\n\tfi\nmostlyclean-generic:\n\nclean-generic:\n\ndistclean-generic:\n\t-test -z \"$(CONFIG_CLEAN_FILES)\" || rm -f $(CONFIG_CLEAN_FILES)\n\t-test . = \"$(srcdir)\" || test -z \"$(CONFIG_CLEAN_VPATH_FILES)\" || rm -f $(CONFIG_CLEAN_VPATH_FILES)\n\nmaintainer-clean-generic:\n\t@echo \"This command is intended for maintainers to use\"\n\t@echo \"it deletes files that may require special tools to rebuild.\"\nclean: clean-am\n\nclean-am: clean-binPROGRAMS clean-generic clean-libLTLIBRARIES \\\n\tclean-libtool mostlyclean-am\n\ndistclean: distclean-am\n\t-rm -rf ./$(DEPDIR)\n\t-rm -f Makefile\ndistclean-am: clean-am distclean-compile distclean-generic \\\n\tdistclean-tags\n\ndvi: dvi-am\n\ndvi-am:\n\nhtml: html-am\n\nhtml-am:\n\ninfo: info-am\n\ninfo-am:\n\ninstall-data-am:\n\ninstall-dvi: install-dvi-am\n\ninstall-dvi-am:\n\ninstall-exec-am: install-binPROGRAMS install-libLTLIBRARIES\n\ninstall-html: install-html-am\n\ninstall-html-am:\n\ninstall-info: install-info-am\n\ninstall-info-am:\n\ninstall-man:\n\ninstall-pdf: install-pdf-am\n\ninstall-pdf-am:\n\ninstall-ps: install-ps-am\n\ninstall-ps-am:\n\ninstallcheck-am:\n\nmaintainer-clean: maintainer-clean-am\n\t-rm -rf ./$(DEPDIR)\n\t-rm -f Makefile\nmaintainer-clean-am: distclean-am maintainer-clean-generic\n\nmostlyclean: mostlyclean-am\n\nmostlyclean-am: mostlyclean-compile mostlyclean-generic \\\n\tmostlyclean-libtool\n\npdf: pdf-am\n\npdf-am:\n\nps: ps-am\n\nps-am:\n\nuninstall-am: uninstall-binPROGRAMS uninstall-libLTLIBRARIES\n\n.MAKE: install-am install-strip\n\n.PHONY: CTAGS GTAGS TAGS all all-am check check-am clean \\\n\tclean-binPROGRAMS clean-generic clean-libLTLIBRARIES \\\n\tclean-libtool cscopelist-am ctags ctags-am distclean \\\n\tdistclean-compile distclean-generic distclean-libtool \\\n\tdistclean-tags distdir dvi dvi-am html html-am info info-am \\\n\tinstall install-am install-binPROGRAMS install-data \\\n\tinstall-data-am install-dvi install-dvi-am install-exec \\\n\tinstall-exec-am install-html install-html-am install-info \\\n\tinstall-info-am install-libLTLIBRARIES install-man install-pdf \\\n\tinstall-pdf-am install-ps install-ps-am install-strip \\\n\tinstallcheck installcheck-am installdirs maintainer-clean \\\n\tmaintainer-clean-generic mostlyclean mostlyclean-compile \\\n\tmostlyclean-generic mostlyclean-libtool pdf pdf-am ps ps-am \\\n\ttags tags-am uninstall uninstall-am uninstall-binPROGRAMS \\\n\tuninstall-libLTLIBRARIES\n\n\n# Tell versions [3.59,3.63) of GNU make to not export all variables.\n# Otherwise a system limit (for SysV at least) may be exceeded.\n.NOEXPORT:\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/extensions/mpdt/mpdtcompose.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Composes an MPDT and an FST.\n\n#include <cstring>\n\n#include <memory>\n#include <string>\n#include <vector>\n\n#include <fst/flags.h>\n#include <fst/log.h>\n\n#include <fst/extensions/mpdt/mpdtscript.h>\n#include <fst/extensions/mpdt/read_write_utils.h>\n#include <fst/extensions/pdt/getters.h>\n#include <fst/util.h>\n\nDEFINE_string(mpdt_parentheses, \"\",\n              \"MPDT parenthesis label pairs with assignments\");\nDEFINE_bool(left_mpdt, true, \"Is the first argument the MPDT?\");\nDEFINE_bool(connect, true, \"Trim output?\");\nDEFINE_string(compose_filter, \"paren\",\n              \"Composition filter, one of: \\\"expand\\\", \\\"expand_paren\\\", \"\n              \"\\\"paren\\\"\");\n\nint main(int argc, char **argv) {\n  namespace s = fst::script;\n  using fst::MPdtComposeOptions;\n  using fst::PdtComposeFilter;\n  using fst::ReadLabelTriples;\n  using fst::script::FstClass;\n  using fst::script::VectorFstClass;\n\n  string usage = \"Compose an MPDT and an FST.\\n\\n  Usage: \";\n  usage += argv[0];\n  usage += \" in.pdt in.fst [out.mpdt]\\n\";\n  usage += \" in.fst in.pdt [out.mpdt]\\n\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n  if (argc < 3 || argc > 4) {\n    ShowUsage();\n    return 1;\n  }\n\n  const string in1_name = strcmp(argv[1], \"-\") == 0 ? \"\" : argv[1];\n  const string in2_name = strcmp(argv[2], \"-\") == 0 ? \"\" : argv[2];\n  const string out_name = argc > 3 ? argv[3] : \"\";\n\n  if (in1_name.empty() && in2_name.empty()) {\n    LOG(ERROR) << argv[0] << \": Can't take both inputs from standard input.\";\n    return 1;\n  }\n\n  std::unique_ptr<FstClass> ifst1(FstClass::Read(in1_name));\n  if (!ifst1) return 1;\n  std::unique_ptr<FstClass> ifst2(FstClass::Read(in2_name));\n  if (!ifst2) return 1;\n\n  if (FLAGS_mpdt_parentheses.empty()) {\n    LOG(ERROR) << argv[0] << \": No MPDT parenthesis label pairs provided\";\n    return 1;\n  }\n\n  std::vector<s::LabelPair> parens;\n  std::vector<int64> assignments;\n  if (!ReadLabelTriples(FLAGS_mpdt_parentheses, &parens, &assignments, false))\n    return 1;\n\n  VectorFstClass ofst(ifst1->ArcType());\n\n  PdtComposeFilter compose_filter;\n  if (!s::GetPdtComposeFilter(FLAGS_compose_filter, &compose_filter)) {\n    LOG(ERROR) << argv[0] << \": Unknown or unsupported compose filter type: \"\n               << FLAGS_compose_filter;\n    return 1;\n  }\n\n  const MPdtComposeOptions opts(FLAGS_connect, compose_filter);\n\n  s::MPdtCompose(*ifst1, *ifst2, parens, assignments, &ofst, opts,\n                 FLAGS_left_mpdt);\n\n  ofst.Write(out_name);\n\n  return 0;\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/extensions/mpdt/mpdtexpand.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Expands a (bounded-stack) MPDT as an FST.\n\n#include <cstring>\n\n#include <memory>\n#include <string>\n#include <vector>\n\n#include <fst/flags.h>\n#include <fst/log.h>\n\n#include <fst/extensions/mpdt/mpdtscript.h>\n#include <fst/extensions/mpdt/read_write_utils.h>\n#include <fst/util.h>\n\nDEFINE_string(mpdt_parentheses, \"\",\n              \"MPDT parenthesis label pairs with assignments\");\nDEFINE_bool(connect, true, \"Trim output?\");\nDEFINE_bool(keep_parentheses, false, \"Keep PDT parentheses in result?\");\n\nint main(int argc, char **argv) {\n  namespace s = fst::script;\n  using fst::script::FstClass;\n  using fst::script::VectorFstClass;\n  using fst::ReadLabelTriples;\n  using fst::MPdtExpandOptions;\n\n  string usage = \"Expand a (bounded-stack) MPDT as an FST.\\n\\n  Usage: \";\n  usage += argv[0];\n  usage += \" in.pdt [out.fst]\\n\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n  if (argc > 3) {\n    ShowUsage();\n    return 1;\n  }\n\n  const string in_name =\n      (argc > 1 && (strcmp(argv[1], \"-\") != 0)) ? argv[1] : \"\";\n  const string out_name = argc > 2 ? argv[2] : \"\";\n\n  std::unique_ptr<FstClass> ifst(FstClass::Read(in_name));\n  if (!ifst) return 1;\n\n  if (FLAGS_mpdt_parentheses.empty()) {\n    LOG(ERROR) << argv[0] << \": No MPDT parenthesis label pairs provided\";\n    return 1;\n  }\n\n  std::vector<s::LabelPair> parens;\n  std::vector<int64> assignments;\n  if (!ReadLabelTriples(FLAGS_mpdt_parentheses, &parens, &assignments, false))\n    return 1;\n\n  VectorFstClass ofst(ifst->ArcType());\n\n  const MPdtExpandOptions opts(FLAGS_connect, FLAGS_keep_parentheses);\n\n  s::MPdtExpand(*ifst, parens, assignments, &ofst, opts);\n\n  ofst.Write(out_name);\n\n  return 0;\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/extensions/mpdt/mpdtinfo.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Prints out various information about an MPDT such as number of states, arcs,\n// and parentheses.\n\n#include <cstring>\n\n#include <memory>\n#include <string>\n#include <vector>\n\n#include <fst/flags.h>\n#include <fst/log.h>\n\n#include <fst/extensions/mpdt/mpdtscript.h>\n#include <fst/extensions/mpdt/read_write_utils.h>\n#include <fst/util.h>\n\nDEFINE_string(mpdt_parentheses, \"\",\n              \"MPDT parenthesis label pairs with assignments\");\n\nint main(int argc, char **argv) {\n  namespace s = fst::script;\n  using fst::script::FstClass;\n  using fst::ReadLabelTriples;\n\n  string usage = \"Prints out information about an MPDT.\\n\\n  Usage: \";\n  usage += argv[0];\n  usage += \" in.pdt\\n\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n  if (argc > 2) {\n    ShowUsage();\n    return 1;\n  }\n\n  const string in_name =\n      (argc > 1 && (strcmp(argv[1], \"-\") != 0)) ? argv[1] : \"\";\n\n  std::unique_ptr<FstClass> ifst(FstClass::Read(in_name));\n  if (!ifst) return 1;\n\n  if (FLAGS_mpdt_parentheses.empty()) {\n    LOG(ERROR) << argv[0] << \": No MPDT parenthesis label pairs provided\";\n    return 1;\n  }\n\n  std::vector<s::LabelPair> parens;\n  std::vector<int64> assignments;\n  if (!ReadLabelTriples(FLAGS_mpdt_parentheses, &parens, &assignments, false))\n    return 1;\n\n  s::PrintMPdtInfo(*ifst, parens, assignments);\n\n  return 0;\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/extensions/mpdt/mpdtreverse.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Reverses an MPDT.\n\n#include <cstring>\n\n#include <memory>\n#include <string>\n#include <vector>\n\n#include <fst/flags.h>\n#include <fst/log.h>\n\n#include <fst/extensions/mpdt/mpdtscript.h>\n#include <fst/extensions/mpdt/read_write_utils.h>\n#include <fst/util.h>\n\nDEFINE_string(mpdt_parentheses, \"\",\n              \"MPDT parenthesis label pairs with assignments.\");\n\nDEFINE_string(mpdt_new_parentheses, \"\",\n              \"Output for reassigned parentheses and stacks\");\n\nint main(int argc, char **argv) {\n  namespace s = fst::script;\n  using fst::ReadLabelTriples;\n  using fst::WriteLabelTriples;\n  using fst::script::FstClass;\n  using fst::script::VectorFstClass;\n\n  string usage = \"Reverse an MPDT.\\n\\n  Usage: \";\n  usage += argv[0];\n  usage += \" in.pdt [out.fst]\\n\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n  if (argc > 3) {\n    ShowUsage();\n    return 1;\n  }\n\n  const string in_name =\n      (argc > 1 && (strcmp(argv[1], \"-\") != 0)) ? argv[1] : \"\";\n  const string out_name = argc > 2 ? argv[2] : \"\";\n\n  std::unique_ptr<FstClass> ifst(FstClass::Read(in_name));\n  if (!ifst) return 1;\n\n  if (FLAGS_mpdt_parentheses.empty()) {\n    LOG(ERROR) << argv[0] << \": No MPDT parenthesis label pairs provided\";\n    return 1;\n  }\n\n  if (FLAGS_mpdt_new_parentheses.empty()) {\n    LOG(ERROR) << argv[0] << \": No MPDT output parenthesis label file provided\";\n    return 1;\n  }\n\n  std::vector<s::LabelPair> parens;\n  std::vector<int64> assignments;\n  if (!ReadLabelTriples(FLAGS_mpdt_parentheses, &parens, &assignments, false))\n    return 1;\n\n  VectorFstClass ofst(ifst->ArcType());\n\n  s::MPdtReverse(*ifst, parens, &assignments, &ofst);\n\n  ofst.Write(out_name);\n\n  if (!WriteLabelTriples(FLAGS_mpdt_new_parentheses, parens, assignments))\n    return 1;\n\n  return 0;\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/extensions/mpdt/mpdtscript.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Definitions of 'scriptable' versions of mpdt operations, that is,\n// those that can be called with FstClass-type arguments.\n//\n// See comments in nlp/fst/script/script-impl.h for how the registration\n// mechanism allows these to work with various arc types.\n\n#include <string>\n#include <vector>\n\n#include <fst/extensions/mpdt/compose.h>\n#include <fst/extensions/mpdt/expand.h>\n#include <fst/extensions/mpdt/mpdtscript.h>\n#include <fst/extensions/mpdt/reverse.h>\n#include <fst/script/script-impl.h>\n\nnamespace fst {\nnamespace script {\n\nvoid MPdtCompose(const FstClass &ifst1, const FstClass &ifst2,\n                 const std::vector<LabelPair> &parens,\n                 const std::vector<int64> &assignments, MutableFstClass *ofst,\n                 const MPdtComposeOptions &copts, bool left_pdt) {\n  if (!internal::ArcTypesMatch(ifst1, ifst2, \"MPdtCompose\") ||\n      !internal::ArcTypesMatch(ifst1, *ofst, \"MPdtCompose\")) return;\n  MPdtComposeArgs args(ifst1, ifst2, parens, assignments, ofst, copts,\n                       left_pdt);\n  Apply<Operation<MPdtComposeArgs>>(\"MPdtCompose\", ifst1.ArcType(), &args);\n}\n\nvoid MPdtExpand(const FstClass &ifst, const std::vector<LabelPair> &parens,\n                const std::vector<int64> &assignments, MutableFstClass *ofst,\n                const MPdtExpandOptions &opts) {\n  MPdtExpandArgs args(ifst, parens, assignments, ofst, opts);\n  Apply<Operation<MPdtExpandArgs>>(\"MPdtExpand\", ifst.ArcType(), &args);\n}\n\nvoid MPdtExpand(const FstClass &ifst, const std::vector<LabelPair> &parens,\n                const std::vector<int64> &assignments, MutableFstClass *ofst,\n                bool connect) {\n  MPdtExpand(ifst, parens, assignments, ofst, MPdtExpandOptions(connect));\n}\n\nvoid MPdtReverse(const FstClass &ifst, const std::vector<LabelPair> &parens,\n                 std::vector<int64> *assignments, MutableFstClass *ofst) {\n  MPdtReverseArgs args(ifst, parens, assignments, ofst);\n  Apply<Operation<MPdtReverseArgs>>(\"MPdtReverse\", ifst.ArcType(), &args);\n}\n\nvoid PrintMPdtInfo(const FstClass &ifst, const std::vector<LabelPair> &parens,\n                   const std::vector<int64> &assignments) {\n  PrintMPdtInfoArgs args(ifst, parens, assignments);\n  Apply<Operation<PrintMPdtInfoArgs>>(\"PrintMPdtInfo\", ifst.ArcType(), &args);\n}\n\n// Register operations for common arc types.\n\nREGISTER_FST_MPDT_OPERATIONS(StdArc);\nREGISTER_FST_MPDT_OPERATIONS(LogArc);\nREGISTER_FST_MPDT_OPERATIONS(Log64Arc);\n\n}  // namespace script\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/extensions/ngram/Makefile.am",
    "content": "AM_CPPFLAGS = -I$(srcdir)/../../include $(ICU_CPPFLAGS)\n\nlibfstdir = @libfstdir@\nlibfst_LTLIBRARIES = ngram-fst.la\n\nlib_LTLIBRARIES = libfstngram.la\n\nngram_fst_la_SOURCES = bitmap-index.cc ngram-fst.cc nthbit.cc\nngram_fst_la_LDFLAGS = -module\n\nlibfstngram_la_SOURCES = bitmap-index.cc ngram-fst.cc nthbit.cc\nlibfstngram_la_LDFLAGS = -version-info 10:0:0\nlibfstngram_la_LIBADD = ../../lib/libfst.la -lm $(DL_LIBS)\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/extensions/ngram/Makefile.in",
    "content": "# Makefile.in generated by automake 1.14.1 from Makefile.am.\n# @configure_input@\n\n# Copyright (C) 1994-2013 Free Software Foundation, Inc.\n\n# This Makefile.in is free software; the Free Software Foundation\n# gives unlimited permission to copy and/or distribute it,\n# with or without modifications, as long as this notice is preserved.\n\n# This program is distributed in the hope that it will be useful,\n# but WITHOUT ANY WARRANTY, to the extent permitted by law; without\n# even the implied warranty of MERCHANTABILITY or FITNESS FOR A\n# PARTICULAR PURPOSE.\n\n@SET_MAKE@\n\nVPATH = @srcdir@\nam__is_gnu_make = test -n '$(MAKEFILE_LIST)' && test -n '$(MAKELEVEL)'\nam__make_running_with_option = \\\n  case $${target_option-} in \\\n      ?) ;; \\\n      *) echo \"am__make_running_with_option: internal error: invalid\" \\\n              \"target option '$${target_option-}' specified\" >&2; \\\n         exit 1;; \\\n  esac; \\\n  has_opt=no; \\\n  sane_makeflags=$$MAKEFLAGS; \\\n  if $(am__is_gnu_make); then \\\n    sane_makeflags=$$MFLAGS; \\\n  else \\\n    case $$MAKEFLAGS in \\\n      *\\\\[\\ \\\t]*) \\\n        bs=\\\\; \\\n        sane_makeflags=`printf '%s\\n' \"$$MAKEFLAGS\" \\\n          | sed \"s/$$bs$$bs[$$bs $$bs\t]*//g\"`;; \\\n    esac; \\\n  fi; \\\n  skip_next=no; \\\n  strip_trailopt () \\\n  { \\\n    flg=`printf '%s\\n' \"$$flg\" | sed \"s/$$1.*$$//\"`; \\\n  }; \\\n  for flg in $$sane_makeflags; do \\\n    test $$skip_next = yes && { skip_next=no; continue; }; \\\n    case $$flg in \\\n      *=*|--*) continue;; \\\n        -*I) strip_trailopt 'I'; skip_next=yes;; \\\n      -*I?*) strip_trailopt 'I';; \\\n        -*O) strip_trailopt 'O'; skip_next=yes;; \\\n      -*O?*) strip_trailopt 'O';; \\\n        -*l) strip_trailopt 'l'; skip_next=yes;; \\\n      -*l?*) strip_trailopt 'l';; \\\n      -[dEDm]) skip_next=yes;; \\\n      -[JT]) skip_next=yes;; \\\n    esac; \\\n    case $$flg in \\\n      *$$target_option*) has_opt=yes; break;; \\\n    esac; \\\n  done; \\\n  test $$has_opt = yes\nam__make_dryrun = (target_option=n; $(am__make_running_with_option))\nam__make_keepgoing = (target_option=k; $(am__make_running_with_option))\npkgdatadir = $(datadir)/@PACKAGE@\npkgincludedir = $(includedir)/@PACKAGE@\npkglibdir = $(libdir)/@PACKAGE@\npkglibexecdir = $(libexecdir)/@PACKAGE@\nam__cd = CDPATH=\"$${ZSH_VERSION+.}$(PATH_SEPARATOR)\" && cd\ninstall_sh_DATA = $(install_sh) -c -m 644\ninstall_sh_PROGRAM = $(install_sh) -c\ninstall_sh_SCRIPT = $(install_sh) -c\nINSTALL_HEADER = $(INSTALL_DATA)\ntransform = $(program_transform_name)\nNORMAL_INSTALL = :\nPRE_INSTALL = :\nPOST_INSTALL = :\nNORMAL_UNINSTALL = :\nPRE_UNINSTALL = :\nPOST_UNINSTALL = :\nbuild_triplet = @build@\nhost_triplet = @host@\nsubdir = src/extensions/ngram\nDIST_COMMON = $(srcdir)/Makefile.in $(srcdir)/Makefile.am \\\n\t$(top_srcdir)/depcomp\nACLOCAL_M4 = $(top_srcdir)/aclocal.m4\nam__aclocal_m4_deps = $(top_srcdir)/m4/ac_python_devel.m4 \\\n\t$(top_srcdir)/m4/libtool.m4 $(top_srcdir)/m4/ltoptions.m4 \\\n\t$(top_srcdir)/m4/ltsugar.m4 $(top_srcdir)/m4/ltversion.m4 \\\n\t$(top_srcdir)/m4/lt~obsolete.m4 $(top_srcdir)/configure.ac\nam__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \\\n\t$(ACLOCAL_M4)\nmkinstalldirs = $(install_sh) -d\nCONFIG_HEADER = $(top_builddir)/config.h \\\n\t$(top_builddir)/src/include/fst/config.h\nCONFIG_CLEAN_FILES =\nCONFIG_CLEAN_VPATH_FILES =\nam__vpath_adj_setup = srcdirstrip=`echo \"$(srcdir)\" | sed 's|.|.|g'`;\nam__vpath_adj = case $$p in \\\n    $(srcdir)/*) f=`echo \"$$p\" | sed \"s|^$$srcdirstrip/||\"`;; \\\n    *) f=$$p;; \\\n  esac;\nam__strip_dir = f=`echo $$p | sed -e 's|^.*/||'`;\nam__install_max = 40\nam__nobase_strip_setup = \\\n  srcdirstrip=`echo \"$(srcdir)\" | sed 's/[].[^$$\\\\*|]/\\\\\\\\&/g'`\nam__nobase_strip = \\\n  for p in $$list; do echo \"$$p\"; done | sed -e \"s|$$srcdirstrip/||\"\nam__nobase_list = $(am__nobase_strip_setup); \\\n  for p in $$list; do echo \"$$p $$p\"; done | \\\n  sed \"s| $$srcdirstrip/| |;\"' / .*\\//!s/ .*/ ./; s,\\( .*\\)/[^/]*$$,\\1,' | \\\n  $(AWK) 'BEGIN { files[\".\"] = \"\" } { files[$$2] = files[$$2] \" \" $$1; \\\n    if (++n[$$2] == $(am__install_max)) \\\n      { print $$2, files[$$2]; n[$$2] = 0; files[$$2] = \"\" } } \\\n    END { for (dir in files) print dir, files[dir] }'\nam__base_list = \\\n  sed '$$!N;$$!N;$$!N;$$!N;$$!N;$$!N;$$!N;s/\\n/ /g' | \\\n  sed '$$!N;$$!N;$$!N;$$!N;s/\\n/ /g'\nam__uninstall_files_from_dir = { \\\n  test -z \"$$files\" \\\n    || { test ! -d \"$$dir\" && test ! -f \"$$dir\" && test ! -r \"$$dir\"; } \\\n    || { echo \" ( cd '$$dir' && rm -f\" $$files \")\"; \\\n         $(am__cd) \"$$dir\" && rm -f $$files; }; \\\n  }\nam__installdirs = \"$(DESTDIR)$(libdir)\" \"$(DESTDIR)$(libfstdir)\"\nLTLIBRARIES = $(lib_LTLIBRARIES) $(libfst_LTLIBRARIES)\nam__DEPENDENCIES_1 =\nlibfstngram_la_DEPENDENCIES = ../../lib/libfst.la \\\n\t$(am__DEPENDENCIES_1)\nam_libfstngram_la_OBJECTS = bitmap-index.lo ngram-fst.lo nthbit.lo\nlibfstngram_la_OBJECTS = $(am_libfstngram_la_OBJECTS)\nAM_V_lt = $(am__v_lt_@AM_V@)\nam__v_lt_ = $(am__v_lt_@AM_DEFAULT_V@)\nam__v_lt_0 = --silent\nam__v_lt_1 = \nlibfstngram_la_LINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX \\\n\t$(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=link $(CXXLD) \\\n\t$(AM_CXXFLAGS) $(CXXFLAGS) $(libfstngram_la_LDFLAGS) \\\n\t$(LDFLAGS) -o $@\nngram_fst_la_LIBADD =\nam_ngram_fst_la_OBJECTS = bitmap-index.lo ngram-fst.lo nthbit.lo\nngram_fst_la_OBJECTS = $(am_ngram_fst_la_OBJECTS)\nngram_fst_la_LINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \\\n\t$(LIBTOOLFLAGS) --mode=link $(CXXLD) $(AM_CXXFLAGS) \\\n\t$(CXXFLAGS) $(ngram_fst_la_LDFLAGS) $(LDFLAGS) -o $@\nAM_V_P = $(am__v_P_@AM_V@)\nam__v_P_ = $(am__v_P_@AM_DEFAULT_V@)\nam__v_P_0 = false\nam__v_P_1 = :\nAM_V_GEN = $(am__v_GEN_@AM_V@)\nam__v_GEN_ = $(am__v_GEN_@AM_DEFAULT_V@)\nam__v_GEN_0 = @echo \"  GEN     \" $@;\nam__v_GEN_1 = \nAM_V_at = $(am__v_at_@AM_V@)\nam__v_at_ = $(am__v_at_@AM_DEFAULT_V@)\nam__v_at_0 = @\nam__v_at_1 = \nDEFAULT_INCLUDES = \ndepcomp = $(SHELL) $(top_srcdir)/depcomp\nam__depfiles_maybe = depfiles\nam__mv = mv -f\nCXXCOMPILE = $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) \\\n\t$(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS)\nLTCXXCOMPILE = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \\\n\t$(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) \\\n\t$(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) \\\n\t$(AM_CXXFLAGS) $(CXXFLAGS)\nAM_V_CXX = $(am__v_CXX_@AM_V@)\nam__v_CXX_ = $(am__v_CXX_@AM_DEFAULT_V@)\nam__v_CXX_0 = @echo \"  CXX     \" $@;\nam__v_CXX_1 = \nCXXLD = $(CXX)\nCXXLINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \\\n\t$(LIBTOOLFLAGS) --mode=link $(CXXLD) $(AM_CXXFLAGS) \\\n\t$(CXXFLAGS) $(AM_LDFLAGS) $(LDFLAGS) -o $@\nAM_V_CXXLD = $(am__v_CXXLD_@AM_V@)\nam__v_CXXLD_ = $(am__v_CXXLD_@AM_DEFAULT_V@)\nam__v_CXXLD_0 = @echo \"  CXXLD   \" $@;\nam__v_CXXLD_1 = \nSOURCES = $(libfstngram_la_SOURCES) $(ngram_fst_la_SOURCES)\nDIST_SOURCES = $(libfstngram_la_SOURCES) $(ngram_fst_la_SOURCES)\nam__can_run_installinfo = \\\n  case $$AM_UPDATE_INFO_DIR in \\\n    n|no|NO) false;; \\\n    *) (install-info --version) >/dev/null 2>&1;; \\\n  esac\nam__tagged_files = $(HEADERS) $(SOURCES) $(TAGS_FILES) $(LISP)\n# Read a list of newline-separated strings from the standard input,\n# and print each of them once, without duplicates.  Input order is\n# *not* preserved.\nam__uniquify_input = $(AWK) '\\\n  BEGIN { nonempty = 0; } \\\n  { items[$$0] = 1; nonempty = 1; } \\\n  END { if (nonempty) { for (i in items) print i; }; } \\\n'\n# Make sure the list of sources is unique.  This is necessary because,\n# e.g., the same source file might be shared among _SOURCES variables\n# for different programs/libraries.\nam__define_uniq_tagged_files = \\\n  list='$(am__tagged_files)'; \\\n  unique=`for i in $$list; do \\\n    if test -f \"$$i\"; then echo $$i; else echo $(srcdir)/$$i; fi; \\\n  done | $(am__uniquify_input)`\nETAGS = etags\nCTAGS = ctags\nDISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST)\nACLOCAL = @ACLOCAL@\nAMTAR = @AMTAR@\nAM_DEFAULT_VERBOSITY = @AM_DEFAULT_VERBOSITY@\nAR = @AR@\nAUTOCONF = @AUTOCONF@\nAUTOHEADER = @AUTOHEADER@\nAUTOMAKE = @AUTOMAKE@\nAWK = @AWK@\nCC = @CC@\nCCDEPMODE = @CCDEPMODE@\nCFLAGS = @CFLAGS@\nCPP = @CPP@\nCPPFLAGS = @CPPFLAGS@\nCXX = @CXX@\nCXXCPP = @CXXCPP@\nCXXDEPMODE = @CXXDEPMODE@\nCXXFLAGS = @CXXFLAGS@\nCYGPATH_W = @CYGPATH_W@\nDEFS = @DEFS@\nDEPDIR = @DEPDIR@\nDLLTOOL = @DLLTOOL@\nDL_LIBS = @DL_LIBS@\nDSYMUTIL = @DSYMUTIL@\nDUMPBIN = @DUMPBIN@\nECHO_C = @ECHO_C@\nECHO_N = @ECHO_N@\nECHO_T = @ECHO_T@\nEGREP = @EGREP@\nEXEEXT = @EXEEXT@\nFGREP = @FGREP@\nGREP = @GREP@\nINSTALL = @INSTALL@\nINSTALL_DATA = @INSTALL_DATA@\nINSTALL_PROGRAM = @INSTALL_PROGRAM@\nINSTALL_SCRIPT = @INSTALL_SCRIPT@\nINSTALL_STRIP_PROGRAM = @INSTALL_STRIP_PROGRAM@\nLD = @LD@\nLDFLAGS = @LDFLAGS@\nLIBOBJS = @LIBOBJS@\nLIBS = @LIBS@\nLIBTOOL = @LIBTOOL@\nLIPO = @LIPO@\nLN_S = @LN_S@\nLTLIBOBJS = @LTLIBOBJS@\nMAKEINFO = @MAKEINFO@\nMANIFEST_TOOL = @MANIFEST_TOOL@\nMKDIR_P = @MKDIR_P@\nNM = @NM@\nNMEDIT = @NMEDIT@\nOBJDUMP = @OBJDUMP@\nOBJEXT = @OBJEXT@\nOTOOL = @OTOOL@\nOTOOL64 = @OTOOL64@\nPACKAGE = @PACKAGE@\nPACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@\nPACKAGE_NAME = @PACKAGE_NAME@\nPACKAGE_STRING = @PACKAGE_STRING@\nPACKAGE_TARNAME = @PACKAGE_TARNAME@\nPACKAGE_URL = @PACKAGE_URL@\nPACKAGE_VERSION = @PACKAGE_VERSION@\nPATH_SEPARATOR = @PATH_SEPARATOR@\nPYTHON = @PYTHON@\nPYTHON_CPPFLAGS = @PYTHON_CPPFLAGS@\nPYTHON_EXEC_PREFIX = @PYTHON_EXEC_PREFIX@\nPYTHON_EXTRA_LDFLAGS = @PYTHON_EXTRA_LDFLAGS@\nPYTHON_EXTRA_LIBS = @PYTHON_EXTRA_LIBS@\nPYTHON_LDFLAGS = @PYTHON_LDFLAGS@\nPYTHON_PLATFORM = @PYTHON_PLATFORM@\nPYTHON_PREFIX = @PYTHON_PREFIX@\nPYTHON_SITE_PKG = @PYTHON_SITE_PKG@\nPYTHON_VERSION = @PYTHON_VERSION@\nRANLIB = @RANLIB@\nSED = @SED@\nSET_MAKE = @SET_MAKE@\nSHELL = @SHELL@\nSTRIP = @STRIP@\nVERSION = @VERSION@\nabs_builddir = @abs_builddir@\nabs_srcdir = @abs_srcdir@\nabs_top_builddir = @abs_top_builddir@\nabs_top_srcdir = @abs_top_srcdir@\nac_ct_AR = @ac_ct_AR@\nac_ct_CC = @ac_ct_CC@\nac_ct_CXX = @ac_ct_CXX@\nac_ct_DUMPBIN = @ac_ct_DUMPBIN@\nam__include = @am__include@\nam__leading_dot = @am__leading_dot@\nam__quote = @am__quote@\nam__tar = @am__tar@\nam__untar = @am__untar@\nbindir = @bindir@\nbuild = @build@\nbuild_alias = @build_alias@\nbuild_cpu = @build_cpu@\nbuild_os = @build_os@\nbuild_vendor = @build_vendor@\nbuilddir = @builddir@\ndatadir = @datadir@\ndatarootdir = @datarootdir@\ndocdir = @docdir@\ndvidir = @dvidir@\nexec_prefix = @exec_prefix@\nhost = @host@\nhost_alias = @host_alias@\nhost_cpu = @host_cpu@\nhost_os = @host_os@\nhost_vendor = @host_vendor@\nhtmldir = @htmldir@\nincludedir = @includedir@\ninfodir = @infodir@\ninstall_sh = @install_sh@\nlibdir = @libdir@\nlibexecdir = @libexecdir@\nlibfstdir = @libfstdir@\nlocaledir = @localedir@\nlocalstatedir = @localstatedir@\nmandir = @mandir@\nmkdir_p = @mkdir_p@\noldincludedir = @oldincludedir@\npdfdir = @pdfdir@\npkgpyexecdir = @pkgpyexecdir@\npkgpythondir = @pkgpythondir@\nprefix = @prefix@\nprogram_transform_name = @program_transform_name@\npsdir = @psdir@\npyexecdir = @pyexecdir@\npythondir = @pythondir@\nsbindir = @sbindir@\nsharedstatedir = @sharedstatedir@\nsrcdir = @srcdir@\nsysconfdir = @sysconfdir@\ntarget_alias = @target_alias@\ntop_build_prefix = @top_build_prefix@\ntop_builddir = @top_builddir@\ntop_srcdir = @top_srcdir@\nAM_CPPFLAGS = -I$(srcdir)/../../include $(ICU_CPPFLAGS)\nlibfst_LTLIBRARIES = ngram-fst.la\nlib_LTLIBRARIES = libfstngram.la\nngram_fst_la_SOURCES = bitmap-index.cc ngram-fst.cc nthbit.cc\nngram_fst_la_LDFLAGS = -module\nlibfstngram_la_SOURCES = bitmap-index.cc ngram-fst.cc nthbit.cc\nlibfstngram_la_LDFLAGS = -version-info 10:0:0\nlibfstngram_la_LIBADD = ../../lib/libfst.la -lm $(DL_LIBS)\nall: all-am\n\n.SUFFIXES:\n.SUFFIXES: .cc .lo .o .obj\n$(srcdir)/Makefile.in:  $(srcdir)/Makefile.am  $(am__configure_deps)\n\t@for dep in $?; do \\\n\t  case '$(am__configure_deps)' in \\\n\t    *$$dep*) \\\n\t      ( cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh ) \\\n\t        && { if test -f $@; then exit 0; else break; fi; }; \\\n\t      exit 1;; \\\n\t  esac; \\\n\tdone; \\\n\techo ' cd $(top_srcdir) && $(AUTOMAKE) --foreign src/extensions/ngram/Makefile'; \\\n\t$(am__cd) $(top_srcdir) && \\\n\t  $(AUTOMAKE) --foreign src/extensions/ngram/Makefile\n.PRECIOUS: Makefile\nMakefile: $(srcdir)/Makefile.in $(top_builddir)/config.status\n\t@case '$?' in \\\n\t  *config.status*) \\\n\t    cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh;; \\\n\t  *) \\\n\t    echo ' cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe)'; \\\n\t    cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe);; \\\n\tesac;\n\n$(top_builddir)/config.status: $(top_srcdir)/configure $(CONFIG_STATUS_DEPENDENCIES)\n\tcd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh\n\n$(top_srcdir)/configure:  $(am__configure_deps)\n\tcd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh\n$(ACLOCAL_M4):  $(am__aclocal_m4_deps)\n\tcd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh\n$(am__aclocal_m4_deps):\n\ninstall-libLTLIBRARIES: $(lib_LTLIBRARIES)\n\t@$(NORMAL_INSTALL)\n\t@list='$(lib_LTLIBRARIES)'; test -n \"$(libdir)\" || list=; \\\n\tlist2=; for p in $$list; do \\\n\t  if test -f $$p; then \\\n\t    list2=\"$$list2 $$p\"; \\\n\t  else :; fi; \\\n\tdone; \\\n\ttest -z \"$$list2\" || { \\\n\t  echo \" $(MKDIR_P) '$(DESTDIR)$(libdir)'\"; \\\n\t  $(MKDIR_P) \"$(DESTDIR)$(libdir)\" || exit 1; \\\n\t  echo \" $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) $$list2 '$(DESTDIR)$(libdir)'\"; \\\n\t  $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) $$list2 \"$(DESTDIR)$(libdir)\"; \\\n\t}\n\nuninstall-libLTLIBRARIES:\n\t@$(NORMAL_UNINSTALL)\n\t@list='$(lib_LTLIBRARIES)'; test -n \"$(libdir)\" || list=; \\\n\tfor p in $$list; do \\\n\t  $(am__strip_dir) \\\n\t  echo \" $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=uninstall rm -f '$(DESTDIR)$(libdir)/$$f'\"; \\\n\t  $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=uninstall rm -f \"$(DESTDIR)$(libdir)/$$f\"; \\\n\tdone\n\nclean-libLTLIBRARIES:\n\t-test -z \"$(lib_LTLIBRARIES)\" || rm -f $(lib_LTLIBRARIES)\n\t@list='$(lib_LTLIBRARIES)'; \\\n\tlocs=`for p in $$list; do echo $$p; done | \\\n\t      sed 's|^[^/]*$$|.|; s|/[^/]*$$||; s|$$|/so_locations|' | \\\n\t      sort -u`; \\\n\ttest -z \"$$locs\" || { \\\n\t  echo rm -f $${locs}; \\\n\t  rm -f $${locs}; \\\n\t}\n\ninstall-libfstLTLIBRARIES: $(libfst_LTLIBRARIES)\n\t@$(NORMAL_INSTALL)\n\t@list='$(libfst_LTLIBRARIES)'; test -n \"$(libfstdir)\" || list=; \\\n\tlist2=; for p in $$list; do \\\n\t  if test -f $$p; then \\\n\t    list2=\"$$list2 $$p\"; \\\n\t  else :; fi; \\\n\tdone; \\\n\ttest -z \"$$list2\" || { \\\n\t  echo \" $(MKDIR_P) '$(DESTDIR)$(libfstdir)'\"; \\\n\t  $(MKDIR_P) \"$(DESTDIR)$(libfstdir)\" || exit 1; \\\n\t  echo \" $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) $$list2 '$(DESTDIR)$(libfstdir)'\"; \\\n\t  $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) $$list2 \"$(DESTDIR)$(libfstdir)\"; \\\n\t}\n\nuninstall-libfstLTLIBRARIES:\n\t@$(NORMAL_UNINSTALL)\n\t@list='$(libfst_LTLIBRARIES)'; test -n \"$(libfstdir)\" || list=; \\\n\tfor p in $$list; do \\\n\t  $(am__strip_dir) \\\n\t  echo \" $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=uninstall rm -f '$(DESTDIR)$(libfstdir)/$$f'\"; \\\n\t  $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=uninstall rm -f \"$(DESTDIR)$(libfstdir)/$$f\"; \\\n\tdone\n\nclean-libfstLTLIBRARIES:\n\t-test -z \"$(libfst_LTLIBRARIES)\" || rm -f $(libfst_LTLIBRARIES)\n\t@list='$(libfst_LTLIBRARIES)'; \\\n\tlocs=`for p in $$list; do echo $$p; done | \\\n\t      sed 's|^[^/]*$$|.|; s|/[^/]*$$||; s|$$|/so_locations|' | \\\n\t      sort -u`; \\\n\ttest -z \"$$locs\" || { \\\n\t  echo rm -f $${locs}; \\\n\t  rm -f $${locs}; \\\n\t}\n\nlibfstngram.la: $(libfstngram_la_OBJECTS) $(libfstngram_la_DEPENDENCIES) $(EXTRA_libfstngram_la_DEPENDENCIES) \n\t$(AM_V_CXXLD)$(libfstngram_la_LINK) -rpath $(libdir) $(libfstngram_la_OBJECTS) $(libfstngram_la_LIBADD) $(LIBS)\n\nngram-fst.la: $(ngram_fst_la_OBJECTS) $(ngram_fst_la_DEPENDENCIES) $(EXTRA_ngram_fst_la_DEPENDENCIES) \n\t$(AM_V_CXXLD)$(ngram_fst_la_LINK) -rpath $(libfstdir) $(ngram_fst_la_OBJECTS) $(ngram_fst_la_LIBADD) $(LIBS)\n\nmostlyclean-compile:\n\t-rm -f *.$(OBJEXT)\n\ndistclean-compile:\n\t-rm -f *.tab.c\n\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/bitmap-index.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/ngram-fst.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/nthbit.Plo@am__quote@\n\n.cc.o:\n@am__fastdepCXX_TRUE@\t$(AM_V_CXX)depbase=`echo $@ | sed 's|[^/]*$$|$(DEPDIR)/&|;s|\\.o$$||'`;\\\n@am__fastdepCXX_TRUE@\t$(CXXCOMPILE) -MT $@ -MD -MP -MF $$depbase.Tpo -c -o $@ $< &&\\\n@am__fastdepCXX_TRUE@\t$(am__mv) $$depbase.Tpo $$depbase.Po\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\t$(AM_V_CXX)source='$<' object='$@' libtool=no @AMDEPBACKSLASH@\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\tDEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@\n@am__fastdepCXX_FALSE@\t$(AM_V_CXX@am__nodep@)$(CXXCOMPILE) -c -o $@ $<\n\n.cc.obj:\n@am__fastdepCXX_TRUE@\t$(AM_V_CXX)depbase=`echo $@ | sed 's|[^/]*$$|$(DEPDIR)/&|;s|\\.obj$$||'`;\\\n@am__fastdepCXX_TRUE@\t$(CXXCOMPILE) -MT $@ -MD -MP -MF $$depbase.Tpo -c -o $@ `$(CYGPATH_W) '$<'` &&\\\n@am__fastdepCXX_TRUE@\t$(am__mv) $$depbase.Tpo $$depbase.Po\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\t$(AM_V_CXX)source='$<' object='$@' libtool=no @AMDEPBACKSLASH@\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\tDEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@\n@am__fastdepCXX_FALSE@\t$(AM_V_CXX@am__nodep@)$(CXXCOMPILE) -c -o $@ `$(CYGPATH_W) '$<'`\n\n.cc.lo:\n@am__fastdepCXX_TRUE@\t$(AM_V_CXX)depbase=`echo $@ | sed 's|[^/]*$$|$(DEPDIR)/&|;s|\\.lo$$||'`;\\\n@am__fastdepCXX_TRUE@\t$(LTCXXCOMPILE) -MT $@ -MD -MP -MF $$depbase.Tpo -c -o $@ $< &&\\\n@am__fastdepCXX_TRUE@\t$(am__mv) $$depbase.Tpo $$depbase.Plo\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\t$(AM_V_CXX)source='$<' object='$@' libtool=yes @AMDEPBACKSLASH@\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\tDEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@\n@am__fastdepCXX_FALSE@\t$(AM_V_CXX@am__nodep@)$(LTCXXCOMPILE) -c -o $@ $<\n\nmostlyclean-libtool:\n\t-rm -f *.lo\n\nclean-libtool:\n\t-rm -rf .libs _libs\n\nID: $(am__tagged_files)\n\t$(am__define_uniq_tagged_files); mkid -fID $$unique\ntags: tags-am\nTAGS: tags\n\ntags-am: $(TAGS_DEPENDENCIES) $(am__tagged_files)\n\tset x; \\\n\there=`pwd`; \\\n\t$(am__define_uniq_tagged_files); \\\n\tshift; \\\n\tif test -z \"$(ETAGS_ARGS)$$*$$unique\"; then :; else \\\n\t  test -n \"$$unique\" || unique=$$empty_fix; \\\n\t  if test $$# -gt 0; then \\\n\t    $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \\\n\t      \"$$@\" $$unique; \\\n\t  else \\\n\t    $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \\\n\t      $$unique; \\\n\t  fi; \\\n\tfi\nctags: ctags-am\n\nCTAGS: ctags\nctags-am: $(TAGS_DEPENDENCIES) $(am__tagged_files)\n\t$(am__define_uniq_tagged_files); \\\n\ttest -z \"$(CTAGS_ARGS)$$unique\" \\\n\t  || $(CTAGS) $(CTAGSFLAGS) $(AM_CTAGSFLAGS) $(CTAGS_ARGS) \\\n\t     $$unique\n\nGTAGS:\n\there=`$(am__cd) $(top_builddir) && pwd` \\\n\t  && $(am__cd) $(top_srcdir) \\\n\t  && gtags -i $(GTAGS_ARGS) \"$$here\"\ncscopelist: cscopelist-am\n\ncscopelist-am: $(am__tagged_files)\n\tlist='$(am__tagged_files)'; \\\n\tcase \"$(srcdir)\" in \\\n\t  [\\\\/]* | ?:[\\\\/]*) sdir=\"$(srcdir)\" ;; \\\n\t  *) sdir=$(subdir)/$(srcdir) ;; \\\n\tesac; \\\n\tfor i in $$list; do \\\n\t  if test -f \"$$i\"; then \\\n\t    echo \"$(subdir)/$$i\"; \\\n\t  else \\\n\t    echo \"$$sdir/$$i\"; \\\n\t  fi; \\\n\tdone >> $(top_builddir)/cscope.files\n\ndistclean-tags:\n\t-rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags\n\ndistdir: $(DISTFILES)\n\t@srcdirstrip=`echo \"$(srcdir)\" | sed 's/[].[^$$\\\\*]/\\\\\\\\&/g'`; \\\n\ttopsrcdirstrip=`echo \"$(top_srcdir)\" | sed 's/[].[^$$\\\\*]/\\\\\\\\&/g'`; \\\n\tlist='$(DISTFILES)'; \\\n\t  dist_files=`for file in $$list; do echo $$file; done | \\\n\t  sed -e \"s|^$$srcdirstrip/||;t\" \\\n\t      -e \"s|^$$topsrcdirstrip/|$(top_builddir)/|;t\"`; \\\n\tcase $$dist_files in \\\n\t  */*) $(MKDIR_P) `echo \"$$dist_files\" | \\\n\t\t\t   sed '/\\//!d;s|^|$(distdir)/|;s,/[^/]*$$,,' | \\\n\t\t\t   sort -u` ;; \\\n\tesac; \\\n\tfor file in $$dist_files; do \\\n\t  if test -f $$file || test -d $$file; then d=.; else d=$(srcdir); fi; \\\n\t  if test -d $$d/$$file; then \\\n\t    dir=`echo \"/$$file\" | sed -e 's,/[^/]*$$,,'`; \\\n\t    if test -d \"$(distdir)/$$file\"; then \\\n\t      find \"$(distdir)/$$file\" -type d ! -perm -700 -exec chmod u+rwx {} \\;; \\\n\t    fi; \\\n\t    if test -d $(srcdir)/$$file && test $$d != $(srcdir); then \\\n\t      cp -fpR $(srcdir)/$$file \"$(distdir)$$dir\" || exit 1; \\\n\t      find \"$(distdir)/$$file\" -type d ! -perm -700 -exec chmod u+rwx {} \\;; \\\n\t    fi; \\\n\t    cp -fpR $$d/$$file \"$(distdir)$$dir\" || exit 1; \\\n\t  else \\\n\t    test -f \"$(distdir)/$$file\" \\\n\t    || cp -p $$d/$$file \"$(distdir)/$$file\" \\\n\t    || exit 1; \\\n\t  fi; \\\n\tdone\ncheck-am: all-am\ncheck: check-am\nall-am: Makefile $(LTLIBRARIES)\ninstalldirs:\n\tfor dir in \"$(DESTDIR)$(libdir)\" \"$(DESTDIR)$(libfstdir)\"; do \\\n\t  test -z \"$$dir\" || $(MKDIR_P) \"$$dir\"; \\\n\tdone\ninstall: install-am\ninstall-exec: install-exec-am\ninstall-data: install-data-am\nuninstall: uninstall-am\n\ninstall-am: all-am\n\t@$(MAKE) $(AM_MAKEFLAGS) install-exec-am install-data-am\n\ninstallcheck: installcheck-am\ninstall-strip:\n\tif test -z '$(STRIP)'; then \\\n\t  $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" \\\n\t    install_sh_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" INSTALL_STRIP_FLAG=-s \\\n\t      install; \\\n\telse \\\n\t  $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" \\\n\t    install_sh_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" INSTALL_STRIP_FLAG=-s \\\n\t    \"INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'\" install; \\\n\tfi\nmostlyclean-generic:\n\nclean-generic:\n\ndistclean-generic:\n\t-test -z \"$(CONFIG_CLEAN_FILES)\" || rm -f $(CONFIG_CLEAN_FILES)\n\t-test . = \"$(srcdir)\" || test -z \"$(CONFIG_CLEAN_VPATH_FILES)\" || rm -f $(CONFIG_CLEAN_VPATH_FILES)\n\nmaintainer-clean-generic:\n\t@echo \"This command is intended for maintainers to use\"\n\t@echo \"it deletes files that may require special tools to rebuild.\"\nclean: clean-am\n\nclean-am: clean-generic clean-libLTLIBRARIES clean-libfstLTLIBRARIES \\\n\tclean-libtool mostlyclean-am\n\ndistclean: distclean-am\n\t-rm -rf ./$(DEPDIR)\n\t-rm -f Makefile\ndistclean-am: clean-am distclean-compile distclean-generic \\\n\tdistclean-tags\n\ndvi: dvi-am\n\ndvi-am:\n\nhtml: html-am\n\nhtml-am:\n\ninfo: info-am\n\ninfo-am:\n\ninstall-data-am: install-libfstLTLIBRARIES\n\ninstall-dvi: install-dvi-am\n\ninstall-dvi-am:\n\ninstall-exec-am: install-libLTLIBRARIES\n\ninstall-html: install-html-am\n\ninstall-html-am:\n\ninstall-info: install-info-am\n\ninstall-info-am:\n\ninstall-man:\n\ninstall-pdf: install-pdf-am\n\ninstall-pdf-am:\n\ninstall-ps: install-ps-am\n\ninstall-ps-am:\n\ninstallcheck-am:\n\nmaintainer-clean: maintainer-clean-am\n\t-rm -rf ./$(DEPDIR)\n\t-rm -f Makefile\nmaintainer-clean-am: distclean-am maintainer-clean-generic\n\nmostlyclean: mostlyclean-am\n\nmostlyclean-am: mostlyclean-compile mostlyclean-generic \\\n\tmostlyclean-libtool\n\npdf: pdf-am\n\npdf-am:\n\nps: ps-am\n\nps-am:\n\nuninstall-am: uninstall-libLTLIBRARIES uninstall-libfstLTLIBRARIES\n\n.MAKE: install-am install-strip\n\n.PHONY: CTAGS GTAGS TAGS all all-am check check-am clean clean-generic \\\n\tclean-libLTLIBRARIES clean-libfstLTLIBRARIES clean-libtool \\\n\tcscopelist-am ctags ctags-am distclean distclean-compile \\\n\tdistclean-generic distclean-libtool distclean-tags distdir dvi \\\n\tdvi-am html html-am info info-am install install-am \\\n\tinstall-data install-data-am install-dvi install-dvi-am \\\n\tinstall-exec install-exec-am install-html install-html-am \\\n\tinstall-info install-info-am install-libLTLIBRARIES \\\n\tinstall-libfstLTLIBRARIES install-man install-pdf \\\n\tinstall-pdf-am install-ps install-ps-am install-strip \\\n\tinstallcheck installcheck-am installdirs maintainer-clean \\\n\tmaintainer-clean-generic mostlyclean mostlyclean-compile \\\n\tmostlyclean-generic mostlyclean-libtool pdf pdf-am ps ps-am \\\n\ttags tags-am uninstall uninstall-am uninstall-libLTLIBRARIES \\\n\tuninstall-libfstLTLIBRARIES\n\n\n# Tell versions [3.59,3.63) of GNU make to not export all variables.\n# Otherwise a system limit (for SysV at least) may be exceeded.\n.NOEXPORT:\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/extensions/ngram/bitmap-index.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/extensions/ngram/bitmap-index.h>\n\n#include <algorithm>\n#include <iterator>\n\n#include <fst/log.h>\n#include <fst/extensions/ngram/nthbit.h>\n\nnamespace fst {\nnamespace {\nconst size_t kPrimaryBlockBits =\n    BitmapIndex::kStorageBitSize * BitmapIndex::kSecondaryBlockSize;\n\n// If [begin, begin+size) is a monotonically increasing running sum of\n// popcounts for a bitmap, this will return the index of the word that contains\n// the value'th zero.  If value is larger then the number of zeros in the\n// bitmap, size will be returned.  The idea is that the number of zerocounts\n// (i.e. the popcount of logical NOT of values) is offset * kStorageBitSize\n// minus the value for each element of the running sum.\ntemplate <size_t BlockSize, typename Container>\nsize_t InvertedSearch(const Container& c,\n                      size_t first_idx,\n                      size_t last_idx,\n                      size_t value) {\n  const size_t begin_idx = first_idx;\n  while (first_idx != last_idx) {\n    // Invariant: [first_idx, last_idx) is the search range.\n    size_t mid_idx = first_idx + ((last_idx - first_idx) / 2);\n    size_t mid_value = BlockSize * (1 + (mid_idx - begin_idx)) - c[mid_idx];\n    if (mid_value < value) {\n      first_idx = mid_idx + 1;\n    } else {\n      last_idx = mid_idx;\n    }\n  }\n  return first_idx;\n}\n}  // namespace\n\nsize_t BitmapIndex::Rank1(size_t end) const {\n  if (end == 0) return 0;\n  const uint32 end_word = (end - 1) >> BitmapIndex::kStorageLogBitSize;\n  const uint32 sum = get_index_ones_count(end_word);\n  const size_t masked = end & kStorageBlockMask;\n  if (masked == 0) {\n    return sum + __builtin_popcountll(bits_[end_word]);\n  } else {\n    const uint64 zero = 0;\n    return sum + __builtin_popcountll(bits_[end_word] &\n                                      (~zero >> (kStorageBitSize - masked)));\n  }\n}\n\nsize_t BitmapIndex::Select1(size_t bit_index) const {\n  if (bit_index >= GetOnesCount()) return Bits();\n  // search primary index for the relevant block\n  uint32 rembits = bit_index + 1;\n  const uint32 block = find_primary_block(bit_index + 1);\n  uint32 offset = 0;\n  if (block > 0) {\n    rembits -= primary_index_[block - 1];\n    offset += block * kSecondaryBlockSize;\n  }\n  // search the secondary index\n  uint32 word = find_secondary_block(offset, rembits);\n  if (word > 0) {\n    rembits -= secondary_index_[offset + word - 1];\n    offset += word;\n  }\n  int nth = nth_bit(bits_[offset], rembits);\n  return (offset << BitmapIndex::kStorageLogBitSize) + nth;\n}\n\nsize_t BitmapIndex::Select0(size_t bit_index) const {\n  if (bit_index >= Bits() - GetOnesCount()) return Bits();\n  // search inverted primary index for relevant block\n  uint32 remzeros = bit_index + 1;\n  uint32 offset = 0;\n  const uint32 block = find_inverted_primary_block(bit_index + 1);\n  if (block > 0) {\n    remzeros -= kPrimaryBlockBits * block - primary_index_[block - 1];\n    offset += block * kSecondaryBlockSize;\n  }\n  // search the inverted secondary index\n  uint32 word = find_inverted_secondary_block(offset, remzeros);\n  if (word > 0) {\n    remzeros -= BitmapIndex::kStorageBitSize * word -\n                secondary_index_[offset + word - 1];\n    offset += word;\n  }\n  int nth = nth_bit(~bits_[offset], remzeros);\n  return (offset << BitmapIndex::kStorageLogBitSize) + nth;\n}\n\nstd::pair<size_t, size_t> BitmapIndex::Select0s(size_t bit_index) const {\n  const uint64 zero = 0;\n  const uint64 ones = ~zero;\n  size_t zeros_count = Bits() - GetOnesCount();\n  if (bit_index >= zeros_count) return std::make_pair(Bits(), Bits());\n  if (bit_index + 1 >= zeros_count) {\n    return std::make_pair(Select0(bit_index), Bits());\n  }\n  // search inverted primary index for relevant block\n  uint32 remzeros = bit_index + 1;\n  uint32 offset = 0;\n  const uint32 block = find_inverted_primary_block(bit_index + 1);\n  size_t num_zeros_in_block =\n      kPrimaryBlockBits * (1 + block) - primary_index_[block];\n  if (block > 0) {\n    size_t num_zeros_next =\n        kPrimaryBlockBits * block - primary_index_[block - 1];\n    num_zeros_in_block -= num_zeros_next;\n    remzeros -= num_zeros_next;\n    offset += block * kSecondaryBlockSize;\n  }\n  // search the inverted secondary index\n  uint32 word = find_inverted_secondary_block(offset, remzeros);\n  uint32 sum_zeros_next_word = BitmapIndex::kStorageBitSize * (1 + word) -\n                               secondary_index_[offset + word];\n  uint32 sum_zeros_this_word = 0;\n  if (word > 0) {\n    sum_zeros_this_word = BitmapIndex::kStorageBitSize * word -\n                          secondary_index_[offset + word - 1];\n    remzeros -= sum_zeros_this_word;\n    offset += word;\n  }\n  int nth = nth_bit(~bits_[offset], remzeros);\n  size_t current_zero = (offset << BitmapIndex::kStorageLogBitSize) + nth;\n\n  size_t next_zero;\n  // Does the current block contain the next zero?\n  if (num_zeros_in_block > remzeros + 1) {\n    if (sum_zeros_next_word - sum_zeros_this_word >= remzeros + 1) {\n      // the next zero is in this word\n      next_zero = (offset << BitmapIndex::kStorageLogBitSize) +\n                  nth_bit(~bits_[offset], remzeros + 1);\n    } else {\n      // Find the first field that is not all ones by linear scan.\n      // In the worst case, this may scan 8Kbytes.  The alternative is\n      // to inspect secondary_index_ looking for a place to jump to, but\n      // that would probably use more cache.\n      while (bits_[++offset] == ones) {\n      }\n      next_zero = (offset << BitmapIndex::kStorageLogBitSize) +\n                  __builtin_ctzll(~bits_[offset]);\n    }\n  } else {\n    // the next zero is in a different block, a full search is required.\n    next_zero = Select0(bit_index + 1);\n  }\n  return std::make_pair(current_zero, next_zero);\n}\n\nsize_t BitmapIndex::get_index_ones_count(size_t array_index) const {\n  uint32 sum = 0;\n  if (array_index > 0) {\n    sum += secondary_index_[array_index - 1];\n    uint32 end_block = (array_index - 1) / kSecondaryBlockSize;\n    if (end_block > 0) sum += primary_index_[end_block - 1];\n  }\n  return sum;\n}\n\nvoid BitmapIndex::BuildIndex(const uint64 *bits, size_t size) {\n  bits_ = bits;\n  size_ = size;\n  primary_index_.resize(primary_index_size());\n  secondary_index_.resize(ArraySize());\n  const uint64 zero = 0;\n  const uint64 ones = ~zero;\n  uint32 popcount = 0;\n  for (uint32 block = 0; block * kSecondaryBlockSize < ArraySize(); block++) {\n    uint32 block_popcount = 0;\n    uint32 block_begin = block * kSecondaryBlockSize;\n    uint32 block_end = block_begin + kSecondaryBlockSize;\n    if (block_end > ArraySize()) block_end = ArraySize();\n    for (uint32 j = block_begin; j < block_end; ++j) {\n      uint64 mask = ones;\n      if (j == ArraySize() - 1) {\n        mask = ones >> (-size_ & BitmapIndex::kStorageBlockMask);\n      }\n      block_popcount += __builtin_popcountll(bits_[j] & mask);\n      secondary_index_[j] = block_popcount;\n    }\n    popcount += block_popcount;\n    primary_index_[block] = popcount;\n  }\n}\n\nsize_t BitmapIndex::find_secondary_block(size_t block_begin,\n                                         size_t rem_bit_index) const {\n  size_t block_end = block_begin + kSecondaryBlockSize;\n  if (block_end > ArraySize()) block_end = ArraySize();\n  return std::distance(\n      secondary_index_.begin() + block_begin,\n      std::lower_bound(secondary_index_.begin() + block_begin,\n                       secondary_index_.begin() + block_end, rem_bit_index));\n}\n\nsize_t BitmapIndex::find_inverted_secondary_block(size_t block_begin,\n                                                  size_t rem_bit_index) const {\n  size_t block_end = block_begin + kSecondaryBlockSize;\n  if (block_end > ArraySize()) block_end = ArraySize();\n  return InvertedSearch<BitmapIndex::kStorageBitSize>(secondary_index_,\n                                                      block_begin, block_end,\n                                                      rem_bit_index)\n      - block_begin;\n}\n\ninline size_t BitmapIndex::find_primary_block(size_t bit_index) const {\n  return std::distance(\n      primary_index_.begin(),\n      std::lower_bound(primary_index_.begin(),\n                       primary_index_.begin() + primary_index_size(),\n                       bit_index));\n}\n\nsize_t BitmapIndex::find_inverted_primary_block(size_t bit_index) const {\n  return InvertedSearch<kPrimaryBlockBits>(\n      primary_index_, 0, primary_index_.size(), bit_index);\n}\n}  // end namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/extensions/ngram/ngram-fst.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/extensions/ngram/ngram-fst.h>\n\n#include <sys/types.h>\n\n#include <fst/arc.h>\n#include <fst/register.h>\n\nusing fst::NGramFst;\nusing fst::StdArc;\nusing fst::LogArc;\n\nREGISTER_FST(NGramFst, StdArc);\nREGISTER_FST(NGramFst, LogArc);\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/extensions/ngram/nthbit.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/extensions/ngram/nthbit.h>\n\n// This table is generated using:\n//\n//  unsigned int nth_bit_scan(uint64 v, unsigned int r) {\n//    int i=0;\n//    for (; i<64; i++) {\n//      if ((r -= v & 1) == 0) return i;\n//      v >>= 1;\n//    }\n//    return i;\n//  }\n//\n//  for (size_t i = 0; i < 256; ++i) {\n//    uint32 offsets = 0;\n//    for (size_t b = 1; b <= 8; ++b) {\n//      uint32 offset = min<uint32>(nth_bit_scan(i, b), 8);\n//      offsets |= (offset << ((b - 1) << 2));\n//    }\n//    bit_offset = offsets;\n//    printf(\"0x%x, \", bit_offset);\n//    if (i % 4 == 3) printf(\"\\n\");\n//  }\n//\nuint32 nth_bit_bit_offset[] = {\n    0x88888888, 0x88888880, 0x88888881, 0x88888810, 0x88888882, 0x88888820,\n    0x88888821, 0x88888210, 0x88888883, 0x88888830, 0x88888831, 0x88888310,\n    0x88888832, 0x88888320, 0x88888321, 0x88883210, 0x88888884, 0x88888840,\n    0x88888841, 0x88888410, 0x88888842, 0x88888420, 0x88888421, 0x88884210,\n    0x88888843, 0x88888430, 0x88888431, 0x88884310, 0x88888432, 0x88884320,\n    0x88884321, 0x88843210, 0x88888885, 0x88888850, 0x88888851, 0x88888510,\n    0x88888852, 0x88888520, 0x88888521, 0x88885210, 0x88888853, 0x88888530,\n    0x88888531, 0x88885310, 0x88888532, 0x88885320, 0x88885321, 0x88853210,\n    0x88888854, 0x88888540, 0x88888541, 0x88885410, 0x88888542, 0x88885420,\n    0x88885421, 0x88854210, 0x88888543, 0x88885430, 0x88885431, 0x88854310,\n    0x88885432, 0x88854320, 0x88854321, 0x88543210, 0x88888886, 0x88888860,\n    0x88888861, 0x88888610, 0x88888862, 0x88888620, 0x88888621, 0x88886210,\n    0x88888863, 0x88888630, 0x88888631, 0x88886310, 0x88888632, 0x88886320,\n    0x88886321, 0x88863210, 0x88888864, 0x88888640, 0x88888641, 0x88886410,\n    0x88888642, 0x88886420, 0x88886421, 0x88864210, 0x88888643, 0x88886430,\n    0x88886431, 0x88864310, 0x88886432, 0x88864320, 0x88864321, 0x88643210,\n    0x88888865, 0x88888650, 0x88888651, 0x88886510, 0x88888652, 0x88886520,\n    0x88886521, 0x88865210, 0x88888653, 0x88886530, 0x88886531, 0x88865310,\n    0x88886532, 0x88865320, 0x88865321, 0x88653210, 0x88888654, 0x88886540,\n    0x88886541, 0x88865410, 0x88886542, 0x88865420, 0x88865421, 0x88654210,\n    0x88886543, 0x88865430, 0x88865431, 0x88654310, 0x88865432, 0x88654320,\n    0x88654321, 0x86543210, 0x88888887, 0x88888870, 0x88888871, 0x88888710,\n    0x88888872, 0x88888720, 0x88888721, 0x88887210, 0x88888873, 0x88888730,\n    0x88888731, 0x88887310, 0x88888732, 0x88887320, 0x88887321, 0x88873210,\n    0x88888874, 0x88888740, 0x88888741, 0x88887410, 0x88888742, 0x88887420,\n    0x88887421, 0x88874210, 0x88888743, 0x88887430, 0x88887431, 0x88874310,\n    0x88887432, 0x88874320, 0x88874321, 0x88743210, 0x88888875, 0x88888750,\n    0x88888751, 0x88887510, 0x88888752, 0x88887520, 0x88887521, 0x88875210,\n    0x88888753, 0x88887530, 0x88887531, 0x88875310, 0x88887532, 0x88875320,\n    0x88875321, 0x88753210, 0x88888754, 0x88887540, 0x88887541, 0x88875410,\n    0x88887542, 0x88875420, 0x88875421, 0x88754210, 0x88887543, 0x88875430,\n    0x88875431, 0x88754310, 0x88875432, 0x88754320, 0x88754321, 0x87543210,\n    0x88888876, 0x88888760, 0x88888761, 0x88887610, 0x88888762, 0x88887620,\n    0x88887621, 0x88876210, 0x88888763, 0x88887630, 0x88887631, 0x88876310,\n    0x88887632, 0x88876320, 0x88876321, 0x88763210, 0x88888764, 0x88887640,\n    0x88887641, 0x88876410, 0x88887642, 0x88876420, 0x88876421, 0x88764210,\n    0x88887643, 0x88876430, 0x88876431, 0x88764310, 0x88876432, 0x88764320,\n    0x88764321, 0x87643210, 0x88888765, 0x88887650, 0x88887651, 0x88876510,\n    0x88887652, 0x88876520, 0x88876521, 0x88765210, 0x88887653, 0x88876530,\n    0x88876531, 0x88765310, 0x88876532, 0x88765320, 0x88765321, 0x87653210,\n    0x88887654, 0x88876540, 0x88876541, 0x88765410, 0x88876542, 0x88765420,\n    0x88765421, 0x87654210, 0x88876543, 0x88765430, 0x88765431, 0x87654310,\n    0x88765432, 0x87654320, 0x87654321, 0x76543210,\n};\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/extensions/pdt/Makefile.am",
    "content": "AM_CPPFLAGS = -I$(srcdir)/../../include $(ICU_CPPFLAGS)\n\nif HAVE_BIN\nbin_PROGRAMS = pdtcompose pdtexpand pdtinfo pdtreplace pdtreverse \\\n               pdtshortestpath\n\nLDADD = libfstpdtscript.la \\\n        ../../script/libfstscript.la \\\n        ../../lib/libfst.la -lm $(DL_LIBS)\n\npdtcompose_SOURCES = pdtcompose.cc\n\npdtexpand_SOURCES = pdtexpand.cc\n\npdtinfo_SOURCES = pdtinfo.cc\n\npdtreplace_SOURCES = pdtreplace.cc\n\npdtreverse_SOURCES = pdtreverse.cc\n\npdtshortestpath_SOURCES = pdtshortestpath.cc\nendif\n\nif HAVE_SCRIPT\nlib_LTLIBRARIES = libfstpdtscript.la\nlibfstpdtscript_la_SOURCES = getters.cc pdtscript.cc\nlibfstpdtscript_la_LDFLAGS = -version-info 10:0:0\nlibfstpdtscript_la_LIBADD = ../../script/libfstscript.la \\\n                            ../../lib/libfst.la -lm $(DL_LIBS)\nendif\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/extensions/pdt/Makefile.in",
    "content": "# Makefile.in generated by automake 1.14.1 from Makefile.am.\n# @configure_input@\n\n# Copyright (C) 1994-2013 Free Software Foundation, Inc.\n\n# This Makefile.in is free software; the Free Software Foundation\n# gives unlimited permission to copy and/or distribute it,\n# with or without modifications, as long as this notice is preserved.\n\n# This program is distributed in the hope that it will be useful,\n# but WITHOUT ANY WARRANTY, to the extent permitted by law; without\n# even the implied warranty of MERCHANTABILITY or FITNESS FOR A\n# PARTICULAR PURPOSE.\n\n@SET_MAKE@\n\n\nVPATH = @srcdir@\nam__is_gnu_make = test -n '$(MAKEFILE_LIST)' && test -n '$(MAKELEVEL)'\nam__make_running_with_option = \\\n  case $${target_option-} in \\\n      ?) ;; \\\n      *) echo \"am__make_running_with_option: internal error: invalid\" \\\n              \"target option '$${target_option-}' specified\" >&2; \\\n         exit 1;; \\\n  esac; \\\n  has_opt=no; \\\n  sane_makeflags=$$MAKEFLAGS; \\\n  if $(am__is_gnu_make); then \\\n    sane_makeflags=$$MFLAGS; \\\n  else \\\n    case $$MAKEFLAGS in \\\n      *\\\\[\\ \\\t]*) \\\n        bs=\\\\; \\\n        sane_makeflags=`printf '%s\\n' \"$$MAKEFLAGS\" \\\n          | sed \"s/$$bs$$bs[$$bs $$bs\t]*//g\"`;; \\\n    esac; \\\n  fi; \\\n  skip_next=no; \\\n  strip_trailopt () \\\n  { \\\n    flg=`printf '%s\\n' \"$$flg\" | sed \"s/$$1.*$$//\"`; \\\n  }; \\\n  for flg in $$sane_makeflags; do \\\n    test $$skip_next = yes && { skip_next=no; continue; }; \\\n    case $$flg in \\\n      *=*|--*) continue;; \\\n        -*I) strip_trailopt 'I'; skip_next=yes;; \\\n      -*I?*) strip_trailopt 'I';; \\\n        -*O) strip_trailopt 'O'; skip_next=yes;; \\\n      -*O?*) strip_trailopt 'O';; \\\n        -*l) strip_trailopt 'l'; skip_next=yes;; \\\n      -*l?*) strip_trailopt 'l';; \\\n      -[dEDm]) skip_next=yes;; \\\n      -[JT]) skip_next=yes;; \\\n    esac; \\\n    case $$flg in \\\n      *$$target_option*) has_opt=yes; break;; \\\n    esac; \\\n  done; \\\n  test $$has_opt = yes\nam__make_dryrun = (target_option=n; $(am__make_running_with_option))\nam__make_keepgoing = (target_option=k; $(am__make_running_with_option))\npkgdatadir = $(datadir)/@PACKAGE@\npkgincludedir = $(includedir)/@PACKAGE@\npkglibdir = $(libdir)/@PACKAGE@\npkglibexecdir = $(libexecdir)/@PACKAGE@\nam__cd = CDPATH=\"$${ZSH_VERSION+.}$(PATH_SEPARATOR)\" && cd\ninstall_sh_DATA = $(install_sh) -c -m 644\ninstall_sh_PROGRAM = $(install_sh) -c\ninstall_sh_SCRIPT = $(install_sh) -c\nINSTALL_HEADER = $(INSTALL_DATA)\ntransform = $(program_transform_name)\nNORMAL_INSTALL = :\nPRE_INSTALL = :\nPOST_INSTALL = :\nNORMAL_UNINSTALL = :\nPRE_UNINSTALL = :\nPOST_UNINSTALL = :\nbuild_triplet = @build@\nhost_triplet = @host@\n@HAVE_BIN_TRUE@bin_PROGRAMS = pdtcompose$(EXEEXT) pdtexpand$(EXEEXT) \\\n@HAVE_BIN_TRUE@\tpdtinfo$(EXEEXT) pdtreplace$(EXEEXT) \\\n@HAVE_BIN_TRUE@\tpdtreverse$(EXEEXT) pdtshortestpath$(EXEEXT)\nsubdir = src/extensions/pdt\nDIST_COMMON = $(srcdir)/Makefile.in $(srcdir)/Makefile.am \\\n\t$(top_srcdir)/depcomp\nACLOCAL_M4 = $(top_srcdir)/aclocal.m4\nam__aclocal_m4_deps = $(top_srcdir)/m4/ac_python_devel.m4 \\\n\t$(top_srcdir)/m4/libtool.m4 $(top_srcdir)/m4/ltoptions.m4 \\\n\t$(top_srcdir)/m4/ltsugar.m4 $(top_srcdir)/m4/ltversion.m4 \\\n\t$(top_srcdir)/m4/lt~obsolete.m4 $(top_srcdir)/configure.ac\nam__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \\\n\t$(ACLOCAL_M4)\nmkinstalldirs = $(install_sh) -d\nCONFIG_HEADER = $(top_builddir)/config.h \\\n\t$(top_builddir)/src/include/fst/config.h\nCONFIG_CLEAN_FILES =\nCONFIG_CLEAN_VPATH_FILES =\nam__vpath_adj_setup = srcdirstrip=`echo \"$(srcdir)\" | sed 's|.|.|g'`;\nam__vpath_adj = case $$p in \\\n    $(srcdir)/*) f=`echo \"$$p\" | sed \"s|^$$srcdirstrip/||\"`;; \\\n    *) f=$$p;; \\\n  esac;\nam__strip_dir = f=`echo $$p | sed -e 's|^.*/||'`;\nam__install_max = 40\nam__nobase_strip_setup = \\\n  srcdirstrip=`echo \"$(srcdir)\" | sed 's/[].[^$$\\\\*|]/\\\\\\\\&/g'`\nam__nobase_strip = \\\n  for p in $$list; do echo \"$$p\"; done | sed -e \"s|$$srcdirstrip/||\"\nam__nobase_list = $(am__nobase_strip_setup); \\\n  for p in $$list; do echo \"$$p $$p\"; done | \\\n  sed \"s| $$srcdirstrip/| |;\"' / .*\\//!s/ .*/ ./; s,\\( .*\\)/[^/]*$$,\\1,' | \\\n  $(AWK) 'BEGIN { files[\".\"] = \"\" } { files[$$2] = files[$$2] \" \" $$1; \\\n    if (++n[$$2] == $(am__install_max)) \\\n      { print $$2, files[$$2]; n[$$2] = 0; files[$$2] = \"\" } } \\\n    END { for (dir in files) print dir, files[dir] }'\nam__base_list = \\\n  sed '$$!N;$$!N;$$!N;$$!N;$$!N;$$!N;$$!N;s/\\n/ /g' | \\\n  sed '$$!N;$$!N;$$!N;$$!N;s/\\n/ /g'\nam__uninstall_files_from_dir = { \\\n  test -z \"$$files\" \\\n    || { test ! -d \"$$dir\" && test ! -f \"$$dir\" && test ! -r \"$$dir\"; } \\\n    || { echo \" ( cd '$$dir' && rm -f\" $$files \")\"; \\\n         $(am__cd) \"$$dir\" && rm -f $$files; }; \\\n  }\nam__installdirs = \"$(DESTDIR)$(libdir)\" \"$(DESTDIR)$(bindir)\"\nLTLIBRARIES = $(lib_LTLIBRARIES)\nam__DEPENDENCIES_1 =\n@HAVE_SCRIPT_TRUE@libfstpdtscript_la_DEPENDENCIES =  \\\n@HAVE_SCRIPT_TRUE@\t../../script/libfstscript.la \\\n@HAVE_SCRIPT_TRUE@\t../../lib/libfst.la $(am__DEPENDENCIES_1)\nam__libfstpdtscript_la_SOURCES_DIST = getters.cc pdtscript.cc\n@HAVE_SCRIPT_TRUE@am_libfstpdtscript_la_OBJECTS = getters.lo \\\n@HAVE_SCRIPT_TRUE@\tpdtscript.lo\nlibfstpdtscript_la_OBJECTS = $(am_libfstpdtscript_la_OBJECTS)\nAM_V_lt = $(am__v_lt_@AM_V@)\nam__v_lt_ = $(am__v_lt_@AM_DEFAULT_V@)\nam__v_lt_0 = --silent\nam__v_lt_1 = \nlibfstpdtscript_la_LINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX \\\n\t$(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=link $(CXXLD) \\\n\t$(AM_CXXFLAGS) $(CXXFLAGS) $(libfstpdtscript_la_LDFLAGS) \\\n\t$(LDFLAGS) -o $@\n@HAVE_SCRIPT_TRUE@am_libfstpdtscript_la_rpath = -rpath $(libdir)\nPROGRAMS = $(bin_PROGRAMS)\nam__pdtcompose_SOURCES_DIST = pdtcompose.cc\n@HAVE_BIN_TRUE@am_pdtcompose_OBJECTS = pdtcompose.$(OBJEXT)\npdtcompose_OBJECTS = $(am_pdtcompose_OBJECTS)\npdtcompose_LDADD = $(LDADD)\n@HAVE_BIN_TRUE@pdtcompose_DEPENDENCIES = libfstpdtscript.la \\\n@HAVE_BIN_TRUE@\t../../script/libfstscript.la \\\n@HAVE_BIN_TRUE@\t../../lib/libfst.la $(am__DEPENDENCIES_1)\nam__pdtexpand_SOURCES_DIST = pdtexpand.cc\n@HAVE_BIN_TRUE@am_pdtexpand_OBJECTS = pdtexpand.$(OBJEXT)\npdtexpand_OBJECTS = $(am_pdtexpand_OBJECTS)\npdtexpand_LDADD = $(LDADD)\n@HAVE_BIN_TRUE@pdtexpand_DEPENDENCIES = libfstpdtscript.la \\\n@HAVE_BIN_TRUE@\t../../script/libfstscript.la \\\n@HAVE_BIN_TRUE@\t../../lib/libfst.la $(am__DEPENDENCIES_1)\nam__pdtinfo_SOURCES_DIST = pdtinfo.cc\n@HAVE_BIN_TRUE@am_pdtinfo_OBJECTS = pdtinfo.$(OBJEXT)\npdtinfo_OBJECTS = $(am_pdtinfo_OBJECTS)\npdtinfo_LDADD = $(LDADD)\n@HAVE_BIN_TRUE@pdtinfo_DEPENDENCIES = libfstpdtscript.la \\\n@HAVE_BIN_TRUE@\t../../script/libfstscript.la \\\n@HAVE_BIN_TRUE@\t../../lib/libfst.la $(am__DEPENDENCIES_1)\nam__pdtreplace_SOURCES_DIST = pdtreplace.cc\n@HAVE_BIN_TRUE@am_pdtreplace_OBJECTS = pdtreplace.$(OBJEXT)\npdtreplace_OBJECTS = $(am_pdtreplace_OBJECTS)\npdtreplace_LDADD = $(LDADD)\n@HAVE_BIN_TRUE@pdtreplace_DEPENDENCIES = libfstpdtscript.la \\\n@HAVE_BIN_TRUE@\t../../script/libfstscript.la \\\n@HAVE_BIN_TRUE@\t../../lib/libfst.la $(am__DEPENDENCIES_1)\nam__pdtreverse_SOURCES_DIST = pdtreverse.cc\n@HAVE_BIN_TRUE@am_pdtreverse_OBJECTS = pdtreverse.$(OBJEXT)\npdtreverse_OBJECTS = $(am_pdtreverse_OBJECTS)\npdtreverse_LDADD = $(LDADD)\n@HAVE_BIN_TRUE@pdtreverse_DEPENDENCIES = libfstpdtscript.la \\\n@HAVE_BIN_TRUE@\t../../script/libfstscript.la \\\n@HAVE_BIN_TRUE@\t../../lib/libfst.la $(am__DEPENDENCIES_1)\nam__pdtshortestpath_SOURCES_DIST = pdtshortestpath.cc\n@HAVE_BIN_TRUE@am_pdtshortestpath_OBJECTS = pdtshortestpath.$(OBJEXT)\npdtshortestpath_OBJECTS = $(am_pdtshortestpath_OBJECTS)\npdtshortestpath_LDADD = $(LDADD)\n@HAVE_BIN_TRUE@pdtshortestpath_DEPENDENCIES = libfstpdtscript.la \\\n@HAVE_BIN_TRUE@\t../../script/libfstscript.la \\\n@HAVE_BIN_TRUE@\t../../lib/libfst.la $(am__DEPENDENCIES_1)\nAM_V_P = $(am__v_P_@AM_V@)\nam__v_P_ = $(am__v_P_@AM_DEFAULT_V@)\nam__v_P_0 = false\nam__v_P_1 = :\nAM_V_GEN = $(am__v_GEN_@AM_V@)\nam__v_GEN_ = $(am__v_GEN_@AM_DEFAULT_V@)\nam__v_GEN_0 = @echo \"  GEN     \" $@;\nam__v_GEN_1 = \nAM_V_at = $(am__v_at_@AM_V@)\nam__v_at_ = $(am__v_at_@AM_DEFAULT_V@)\nam__v_at_0 = @\nam__v_at_1 = \nDEFAULT_INCLUDES = \ndepcomp = $(SHELL) $(top_srcdir)/depcomp\nam__depfiles_maybe = depfiles\nam__mv = mv -f\nCXXCOMPILE = $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) \\\n\t$(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS)\nLTCXXCOMPILE = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \\\n\t$(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) \\\n\t$(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) \\\n\t$(AM_CXXFLAGS) $(CXXFLAGS)\nAM_V_CXX = $(am__v_CXX_@AM_V@)\nam__v_CXX_ = $(am__v_CXX_@AM_DEFAULT_V@)\nam__v_CXX_0 = @echo \"  CXX     \" $@;\nam__v_CXX_1 = \nCXXLD = $(CXX)\nCXXLINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \\\n\t$(LIBTOOLFLAGS) --mode=link $(CXXLD) $(AM_CXXFLAGS) \\\n\t$(CXXFLAGS) $(AM_LDFLAGS) $(LDFLAGS) -o $@\nAM_V_CXXLD = $(am__v_CXXLD_@AM_V@)\nam__v_CXXLD_ = $(am__v_CXXLD_@AM_DEFAULT_V@)\nam__v_CXXLD_0 = @echo \"  CXXLD   \" $@;\nam__v_CXXLD_1 = \nSOURCES = $(libfstpdtscript_la_SOURCES) $(pdtcompose_SOURCES) \\\n\t$(pdtexpand_SOURCES) $(pdtinfo_SOURCES) $(pdtreplace_SOURCES) \\\n\t$(pdtreverse_SOURCES) $(pdtshortestpath_SOURCES)\nDIST_SOURCES = $(am__libfstpdtscript_la_SOURCES_DIST) \\\n\t$(am__pdtcompose_SOURCES_DIST) $(am__pdtexpand_SOURCES_DIST) \\\n\t$(am__pdtinfo_SOURCES_DIST) $(am__pdtreplace_SOURCES_DIST) \\\n\t$(am__pdtreverse_SOURCES_DIST) \\\n\t$(am__pdtshortestpath_SOURCES_DIST)\nam__can_run_installinfo = \\\n  case $$AM_UPDATE_INFO_DIR in \\\n    n|no|NO) false;; \\\n    *) (install-info --version) >/dev/null 2>&1;; \\\n  esac\nam__tagged_files = $(HEADERS) $(SOURCES) $(TAGS_FILES) $(LISP)\n# Read a list of newline-separated strings from the standard input,\n# and print each of them once, without duplicates.  Input order is\n# *not* preserved.\nam__uniquify_input = $(AWK) '\\\n  BEGIN { nonempty = 0; } \\\n  { items[$$0] = 1; nonempty = 1; } \\\n  END { if (nonempty) { for (i in items) print i; }; } \\\n'\n# Make sure the list of sources is unique.  This is necessary because,\n# e.g., the same source file might be shared among _SOURCES variables\n# for different programs/libraries.\nam__define_uniq_tagged_files = \\\n  list='$(am__tagged_files)'; \\\n  unique=`for i in $$list; do \\\n    if test -f \"$$i\"; then echo $$i; else echo $(srcdir)/$$i; fi; \\\n  done | $(am__uniquify_input)`\nETAGS = etags\nCTAGS = ctags\nDISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST)\nACLOCAL = @ACLOCAL@\nAMTAR = @AMTAR@\nAM_DEFAULT_VERBOSITY = @AM_DEFAULT_VERBOSITY@\nAR = @AR@\nAUTOCONF = @AUTOCONF@\nAUTOHEADER = @AUTOHEADER@\nAUTOMAKE = @AUTOMAKE@\nAWK = @AWK@\nCC = @CC@\nCCDEPMODE = @CCDEPMODE@\nCFLAGS = @CFLAGS@\nCPP = @CPP@\nCPPFLAGS = @CPPFLAGS@\nCXX = @CXX@\nCXXCPP = @CXXCPP@\nCXXDEPMODE = @CXXDEPMODE@\nCXXFLAGS = @CXXFLAGS@\nCYGPATH_W = @CYGPATH_W@\nDEFS = @DEFS@\nDEPDIR = @DEPDIR@\nDLLTOOL = @DLLTOOL@\nDL_LIBS = @DL_LIBS@\nDSYMUTIL = @DSYMUTIL@\nDUMPBIN = @DUMPBIN@\nECHO_C = @ECHO_C@\nECHO_N = @ECHO_N@\nECHO_T = @ECHO_T@\nEGREP = @EGREP@\nEXEEXT = @EXEEXT@\nFGREP = @FGREP@\nGREP = @GREP@\nINSTALL = @INSTALL@\nINSTALL_DATA = @INSTALL_DATA@\nINSTALL_PROGRAM = @INSTALL_PROGRAM@\nINSTALL_SCRIPT = @INSTALL_SCRIPT@\nINSTALL_STRIP_PROGRAM = @INSTALL_STRIP_PROGRAM@\nLD = @LD@\nLDFLAGS = @LDFLAGS@\nLIBOBJS = @LIBOBJS@\nLIBS = @LIBS@\nLIBTOOL = @LIBTOOL@\nLIPO = @LIPO@\nLN_S = @LN_S@\nLTLIBOBJS = @LTLIBOBJS@\nMAKEINFO = @MAKEINFO@\nMANIFEST_TOOL = @MANIFEST_TOOL@\nMKDIR_P = @MKDIR_P@\nNM = @NM@\nNMEDIT = @NMEDIT@\nOBJDUMP = @OBJDUMP@\nOBJEXT = @OBJEXT@\nOTOOL = @OTOOL@\nOTOOL64 = @OTOOL64@\nPACKAGE = @PACKAGE@\nPACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@\nPACKAGE_NAME = @PACKAGE_NAME@\nPACKAGE_STRING = @PACKAGE_STRING@\nPACKAGE_TARNAME = @PACKAGE_TARNAME@\nPACKAGE_URL = @PACKAGE_URL@\nPACKAGE_VERSION = @PACKAGE_VERSION@\nPATH_SEPARATOR = @PATH_SEPARATOR@\nPYTHON = @PYTHON@\nPYTHON_CPPFLAGS = @PYTHON_CPPFLAGS@\nPYTHON_EXEC_PREFIX = @PYTHON_EXEC_PREFIX@\nPYTHON_EXTRA_LDFLAGS = @PYTHON_EXTRA_LDFLAGS@\nPYTHON_EXTRA_LIBS = @PYTHON_EXTRA_LIBS@\nPYTHON_LDFLAGS = @PYTHON_LDFLAGS@\nPYTHON_PLATFORM = @PYTHON_PLATFORM@\nPYTHON_PREFIX = @PYTHON_PREFIX@\nPYTHON_SITE_PKG = @PYTHON_SITE_PKG@\nPYTHON_VERSION = @PYTHON_VERSION@\nRANLIB = @RANLIB@\nSED = @SED@\nSET_MAKE = @SET_MAKE@\nSHELL = @SHELL@\nSTRIP = @STRIP@\nVERSION = @VERSION@\nabs_builddir = @abs_builddir@\nabs_srcdir = @abs_srcdir@\nabs_top_builddir = @abs_top_builddir@\nabs_top_srcdir = @abs_top_srcdir@\nac_ct_AR = @ac_ct_AR@\nac_ct_CC = @ac_ct_CC@\nac_ct_CXX = @ac_ct_CXX@\nac_ct_DUMPBIN = @ac_ct_DUMPBIN@\nam__include = @am__include@\nam__leading_dot = @am__leading_dot@\nam__quote = @am__quote@\nam__tar = @am__tar@\nam__untar = @am__untar@\nbindir = @bindir@\nbuild = @build@\nbuild_alias = @build_alias@\nbuild_cpu = @build_cpu@\nbuild_os = @build_os@\nbuild_vendor = @build_vendor@\nbuilddir = @builddir@\ndatadir = @datadir@\ndatarootdir = @datarootdir@\ndocdir = @docdir@\ndvidir = @dvidir@\nexec_prefix = @exec_prefix@\nhost = @host@\nhost_alias = @host_alias@\nhost_cpu = @host_cpu@\nhost_os = @host_os@\nhost_vendor = @host_vendor@\nhtmldir = @htmldir@\nincludedir = @includedir@\ninfodir = @infodir@\ninstall_sh = @install_sh@\nlibdir = @libdir@\nlibexecdir = @libexecdir@\nlibfstdir = @libfstdir@\nlocaledir = @localedir@\nlocalstatedir = @localstatedir@\nmandir = @mandir@\nmkdir_p = @mkdir_p@\noldincludedir = @oldincludedir@\npdfdir = @pdfdir@\npkgpyexecdir = @pkgpyexecdir@\npkgpythondir = @pkgpythondir@\nprefix = @prefix@\nprogram_transform_name = @program_transform_name@\npsdir = @psdir@\npyexecdir = @pyexecdir@\npythondir = @pythondir@\nsbindir = @sbindir@\nsharedstatedir = @sharedstatedir@\nsrcdir = @srcdir@\nsysconfdir = @sysconfdir@\ntarget_alias = @target_alias@\ntop_build_prefix = @top_build_prefix@\ntop_builddir = @top_builddir@\ntop_srcdir = @top_srcdir@\nAM_CPPFLAGS = -I$(srcdir)/../../include $(ICU_CPPFLAGS)\n@HAVE_BIN_TRUE@LDADD = libfstpdtscript.la \\\n@HAVE_BIN_TRUE@        ../../script/libfstscript.la \\\n@HAVE_BIN_TRUE@        ../../lib/libfst.la -lm $(DL_LIBS)\n\n@HAVE_BIN_TRUE@pdtcompose_SOURCES = pdtcompose.cc\n@HAVE_BIN_TRUE@pdtexpand_SOURCES = pdtexpand.cc\n@HAVE_BIN_TRUE@pdtinfo_SOURCES = pdtinfo.cc\n@HAVE_BIN_TRUE@pdtreplace_SOURCES = pdtreplace.cc\n@HAVE_BIN_TRUE@pdtreverse_SOURCES = pdtreverse.cc\n@HAVE_BIN_TRUE@pdtshortestpath_SOURCES = pdtshortestpath.cc\n@HAVE_SCRIPT_TRUE@lib_LTLIBRARIES = libfstpdtscript.la\n@HAVE_SCRIPT_TRUE@libfstpdtscript_la_SOURCES = getters.cc pdtscript.cc\n@HAVE_SCRIPT_TRUE@libfstpdtscript_la_LDFLAGS = -version-info 10:0:0\n@HAVE_SCRIPT_TRUE@libfstpdtscript_la_LIBADD = ../../script/libfstscript.la \\\n@HAVE_SCRIPT_TRUE@                            ../../lib/libfst.la -lm $(DL_LIBS)\n\nall: all-am\n\n.SUFFIXES:\n.SUFFIXES: .cc .lo .o .obj\n$(srcdir)/Makefile.in:  $(srcdir)/Makefile.am  $(am__configure_deps)\n\t@for dep in $?; do \\\n\t  case '$(am__configure_deps)' in \\\n\t    *$$dep*) \\\n\t      ( cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh ) \\\n\t        && { if test -f $@; then exit 0; else break; fi; }; \\\n\t      exit 1;; \\\n\t  esac; \\\n\tdone; \\\n\techo ' cd $(top_srcdir) && $(AUTOMAKE) --foreign src/extensions/pdt/Makefile'; \\\n\t$(am__cd) $(top_srcdir) && \\\n\t  $(AUTOMAKE) --foreign src/extensions/pdt/Makefile\n.PRECIOUS: Makefile\nMakefile: $(srcdir)/Makefile.in $(top_builddir)/config.status\n\t@case '$?' in \\\n\t  *config.status*) \\\n\t    cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh;; \\\n\t  *) \\\n\t    echo ' cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe)'; \\\n\t    cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe);; \\\n\tesac;\n\n$(top_builddir)/config.status: $(top_srcdir)/configure $(CONFIG_STATUS_DEPENDENCIES)\n\tcd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh\n\n$(top_srcdir)/configure:  $(am__configure_deps)\n\tcd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh\n$(ACLOCAL_M4):  $(am__aclocal_m4_deps)\n\tcd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh\n$(am__aclocal_m4_deps):\n\ninstall-libLTLIBRARIES: $(lib_LTLIBRARIES)\n\t@$(NORMAL_INSTALL)\n\t@list='$(lib_LTLIBRARIES)'; test -n \"$(libdir)\" || list=; \\\n\tlist2=; for p in $$list; do \\\n\t  if test -f $$p; then \\\n\t    list2=\"$$list2 $$p\"; \\\n\t  else :; fi; \\\n\tdone; \\\n\ttest -z \"$$list2\" || { \\\n\t  echo \" $(MKDIR_P) '$(DESTDIR)$(libdir)'\"; \\\n\t  $(MKDIR_P) \"$(DESTDIR)$(libdir)\" || exit 1; \\\n\t  echo \" $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) $$list2 '$(DESTDIR)$(libdir)'\"; \\\n\t  $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) $$list2 \"$(DESTDIR)$(libdir)\"; \\\n\t}\n\nuninstall-libLTLIBRARIES:\n\t@$(NORMAL_UNINSTALL)\n\t@list='$(lib_LTLIBRARIES)'; test -n \"$(libdir)\" || list=; \\\n\tfor p in $$list; do \\\n\t  $(am__strip_dir) \\\n\t  echo \" $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=uninstall rm -f '$(DESTDIR)$(libdir)/$$f'\"; \\\n\t  $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=uninstall rm -f \"$(DESTDIR)$(libdir)/$$f\"; \\\n\tdone\n\nclean-libLTLIBRARIES:\n\t-test -z \"$(lib_LTLIBRARIES)\" || rm -f $(lib_LTLIBRARIES)\n\t@list='$(lib_LTLIBRARIES)'; \\\n\tlocs=`for p in $$list; do echo $$p; done | \\\n\t      sed 's|^[^/]*$$|.|; s|/[^/]*$$||; s|$$|/so_locations|' | \\\n\t      sort -u`; \\\n\ttest -z \"$$locs\" || { \\\n\t  echo rm -f $${locs}; \\\n\t  rm -f $${locs}; \\\n\t}\n\nlibfstpdtscript.la: $(libfstpdtscript_la_OBJECTS) $(libfstpdtscript_la_DEPENDENCIES) $(EXTRA_libfstpdtscript_la_DEPENDENCIES) \n\t$(AM_V_CXXLD)$(libfstpdtscript_la_LINK) $(am_libfstpdtscript_la_rpath) $(libfstpdtscript_la_OBJECTS) $(libfstpdtscript_la_LIBADD) $(LIBS)\ninstall-binPROGRAMS: $(bin_PROGRAMS)\n\t@$(NORMAL_INSTALL)\n\t@list='$(bin_PROGRAMS)'; test -n \"$(bindir)\" || list=; \\\n\tif test -n \"$$list\"; then \\\n\t  echo \" $(MKDIR_P) '$(DESTDIR)$(bindir)'\"; \\\n\t  $(MKDIR_P) \"$(DESTDIR)$(bindir)\" || exit 1; \\\n\tfi; \\\n\tfor p in $$list; do echo \"$$p $$p\"; done | \\\n\tsed 's/$(EXEEXT)$$//' | \\\n\twhile read p p1; do if test -f $$p \\\n\t || test -f $$p1 \\\n\t  ; then echo \"$$p\"; echo \"$$p\"; else :; fi; \\\n\tdone | \\\n\tsed -e 'p;s,.*/,,;n;h' \\\n\t    -e 's|.*|.|' \\\n\t    -e 'p;x;s,.*/,,;s/$(EXEEXT)$$//;$(transform);s/$$/$(EXEEXT)/' | \\\n\tsed 'N;N;N;s,\\n, ,g' | \\\n\t$(AWK) 'BEGIN { files[\".\"] = \"\"; dirs[\".\"] = 1 } \\\n\t  { d=$$3; if (dirs[d] != 1) { print \"d\", d; dirs[d] = 1 } \\\n\t    if ($$2 == $$4) files[d] = files[d] \" \" $$1; \\\n\t    else { print \"f\", $$3 \"/\" $$4, $$1; } } \\\n\t  END { for (d in files) print \"f\", d, files[d] }' | \\\n\twhile read type dir files; do \\\n\t    if test \"$$dir\" = .; then dir=; else dir=/$$dir; fi; \\\n\t    test -z \"$$files\" || { \\\n\t    echo \" $(INSTALL_PROGRAM_ENV) $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL_PROGRAM) $$files '$(DESTDIR)$(bindir)$$dir'\"; \\\n\t    $(INSTALL_PROGRAM_ENV) $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL_PROGRAM) $$files \"$(DESTDIR)$(bindir)$$dir\" || exit $$?; \\\n\t    } \\\n\t; done\n\nuninstall-binPROGRAMS:\n\t@$(NORMAL_UNINSTALL)\n\t@list='$(bin_PROGRAMS)'; test -n \"$(bindir)\" || list=; \\\n\tfiles=`for p in $$list; do echo \"$$p\"; done | \\\n\t  sed -e 'h;s,^.*/,,;s/$(EXEEXT)$$//;$(transform)' \\\n\t      -e 's/$$/$(EXEEXT)/' \\\n\t`; \\\n\ttest -n \"$$list\" || exit 0; \\\n\techo \" ( cd '$(DESTDIR)$(bindir)' && rm -f\" $$files \")\"; \\\n\tcd \"$(DESTDIR)$(bindir)\" && rm -f $$files\n\nclean-binPROGRAMS:\n\t@list='$(bin_PROGRAMS)'; test -n \"$$list\" || exit 0; \\\n\techo \" rm -f\" $$list; \\\n\trm -f $$list || exit $$?; \\\n\ttest -n \"$(EXEEXT)\" || exit 0; \\\n\tlist=`for p in $$list; do echo \"$$p\"; done | sed 's/$(EXEEXT)$$//'`; \\\n\techo \" rm -f\" $$list; \\\n\trm -f $$list\n\npdtcompose$(EXEEXT): $(pdtcompose_OBJECTS) $(pdtcompose_DEPENDENCIES) $(EXTRA_pdtcompose_DEPENDENCIES) \n\t@rm -f pdtcompose$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(pdtcompose_OBJECTS) $(pdtcompose_LDADD) $(LIBS)\n\npdtexpand$(EXEEXT): $(pdtexpand_OBJECTS) $(pdtexpand_DEPENDENCIES) $(EXTRA_pdtexpand_DEPENDENCIES) \n\t@rm -f pdtexpand$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(pdtexpand_OBJECTS) $(pdtexpand_LDADD) $(LIBS)\n\npdtinfo$(EXEEXT): $(pdtinfo_OBJECTS) $(pdtinfo_DEPENDENCIES) $(EXTRA_pdtinfo_DEPENDENCIES) \n\t@rm -f pdtinfo$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(pdtinfo_OBJECTS) $(pdtinfo_LDADD) $(LIBS)\n\npdtreplace$(EXEEXT): $(pdtreplace_OBJECTS) $(pdtreplace_DEPENDENCIES) $(EXTRA_pdtreplace_DEPENDENCIES) \n\t@rm -f pdtreplace$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(pdtreplace_OBJECTS) $(pdtreplace_LDADD) $(LIBS)\n\npdtreverse$(EXEEXT): $(pdtreverse_OBJECTS) $(pdtreverse_DEPENDENCIES) $(EXTRA_pdtreverse_DEPENDENCIES) \n\t@rm -f pdtreverse$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(pdtreverse_OBJECTS) $(pdtreverse_LDADD) $(LIBS)\n\npdtshortestpath$(EXEEXT): $(pdtshortestpath_OBJECTS) $(pdtshortestpath_DEPENDENCIES) $(EXTRA_pdtshortestpath_DEPENDENCIES) \n\t@rm -f pdtshortestpath$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(pdtshortestpath_OBJECTS) $(pdtshortestpath_LDADD) $(LIBS)\n\nmostlyclean-compile:\n\t-rm -f *.$(OBJEXT)\n\ndistclean-compile:\n\t-rm -f *.tab.c\n\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/getters.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/pdtcompose.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/pdtexpand.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/pdtinfo.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/pdtreplace.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/pdtreverse.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/pdtscript.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/pdtshortestpath.Po@am__quote@\n\n.cc.o:\n@am__fastdepCXX_TRUE@\t$(AM_V_CXX)depbase=`echo $@ | sed 's|[^/]*$$|$(DEPDIR)/&|;s|\\.o$$||'`;\\\n@am__fastdepCXX_TRUE@\t$(CXXCOMPILE) -MT $@ -MD -MP -MF $$depbase.Tpo -c -o $@ $< &&\\\n@am__fastdepCXX_TRUE@\t$(am__mv) $$depbase.Tpo $$depbase.Po\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\t$(AM_V_CXX)source='$<' object='$@' libtool=no @AMDEPBACKSLASH@\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\tDEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@\n@am__fastdepCXX_FALSE@\t$(AM_V_CXX@am__nodep@)$(CXXCOMPILE) -c -o $@ $<\n\n.cc.obj:\n@am__fastdepCXX_TRUE@\t$(AM_V_CXX)depbase=`echo $@ | sed 's|[^/]*$$|$(DEPDIR)/&|;s|\\.obj$$||'`;\\\n@am__fastdepCXX_TRUE@\t$(CXXCOMPILE) -MT $@ -MD -MP -MF $$depbase.Tpo -c -o $@ `$(CYGPATH_W) '$<'` &&\\\n@am__fastdepCXX_TRUE@\t$(am__mv) $$depbase.Tpo $$depbase.Po\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\t$(AM_V_CXX)source='$<' object='$@' libtool=no @AMDEPBACKSLASH@\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\tDEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@\n@am__fastdepCXX_FALSE@\t$(AM_V_CXX@am__nodep@)$(CXXCOMPILE) -c -o $@ `$(CYGPATH_W) '$<'`\n\n.cc.lo:\n@am__fastdepCXX_TRUE@\t$(AM_V_CXX)depbase=`echo $@ | sed 's|[^/]*$$|$(DEPDIR)/&|;s|\\.lo$$||'`;\\\n@am__fastdepCXX_TRUE@\t$(LTCXXCOMPILE) -MT $@ -MD -MP -MF $$depbase.Tpo -c -o $@ $< &&\\\n@am__fastdepCXX_TRUE@\t$(am__mv) $$depbase.Tpo $$depbase.Plo\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\t$(AM_V_CXX)source='$<' object='$@' libtool=yes @AMDEPBACKSLASH@\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\tDEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@\n@am__fastdepCXX_FALSE@\t$(AM_V_CXX@am__nodep@)$(LTCXXCOMPILE) -c -o $@ $<\n\nmostlyclean-libtool:\n\t-rm -f *.lo\n\nclean-libtool:\n\t-rm -rf .libs _libs\n\nID: $(am__tagged_files)\n\t$(am__define_uniq_tagged_files); mkid -fID $$unique\ntags: tags-am\nTAGS: tags\n\ntags-am: $(TAGS_DEPENDENCIES) $(am__tagged_files)\n\tset x; \\\n\there=`pwd`; \\\n\t$(am__define_uniq_tagged_files); \\\n\tshift; \\\n\tif test -z \"$(ETAGS_ARGS)$$*$$unique\"; then :; else \\\n\t  test -n \"$$unique\" || unique=$$empty_fix; \\\n\t  if test $$# -gt 0; then \\\n\t    $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \\\n\t      \"$$@\" $$unique; \\\n\t  else \\\n\t    $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \\\n\t      $$unique; \\\n\t  fi; \\\n\tfi\nctags: ctags-am\n\nCTAGS: ctags\nctags-am: $(TAGS_DEPENDENCIES) $(am__tagged_files)\n\t$(am__define_uniq_tagged_files); \\\n\ttest -z \"$(CTAGS_ARGS)$$unique\" \\\n\t  || $(CTAGS) $(CTAGSFLAGS) $(AM_CTAGSFLAGS) $(CTAGS_ARGS) \\\n\t     $$unique\n\nGTAGS:\n\there=`$(am__cd) $(top_builddir) && pwd` \\\n\t  && $(am__cd) $(top_srcdir) \\\n\t  && gtags -i $(GTAGS_ARGS) \"$$here\"\ncscopelist: cscopelist-am\n\ncscopelist-am: $(am__tagged_files)\n\tlist='$(am__tagged_files)'; \\\n\tcase \"$(srcdir)\" in \\\n\t  [\\\\/]* | ?:[\\\\/]*) sdir=\"$(srcdir)\" ;; \\\n\t  *) sdir=$(subdir)/$(srcdir) ;; \\\n\tesac; \\\n\tfor i in $$list; do \\\n\t  if test -f \"$$i\"; then \\\n\t    echo \"$(subdir)/$$i\"; \\\n\t  else \\\n\t    echo \"$$sdir/$$i\"; \\\n\t  fi; \\\n\tdone >> $(top_builddir)/cscope.files\n\ndistclean-tags:\n\t-rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags\n\ndistdir: $(DISTFILES)\n\t@srcdirstrip=`echo \"$(srcdir)\" | sed 's/[].[^$$\\\\*]/\\\\\\\\&/g'`; \\\n\ttopsrcdirstrip=`echo \"$(top_srcdir)\" | sed 's/[].[^$$\\\\*]/\\\\\\\\&/g'`; \\\n\tlist='$(DISTFILES)'; \\\n\t  dist_files=`for file in $$list; do echo $$file; done | \\\n\t  sed -e \"s|^$$srcdirstrip/||;t\" \\\n\t      -e \"s|^$$topsrcdirstrip/|$(top_builddir)/|;t\"`; \\\n\tcase $$dist_files in \\\n\t  */*) $(MKDIR_P) `echo \"$$dist_files\" | \\\n\t\t\t   sed '/\\//!d;s|^|$(distdir)/|;s,/[^/]*$$,,' | \\\n\t\t\t   sort -u` ;; \\\n\tesac; \\\n\tfor file in $$dist_files; do \\\n\t  if test -f $$file || test -d $$file; then d=.; else d=$(srcdir); fi; \\\n\t  if test -d $$d/$$file; then \\\n\t    dir=`echo \"/$$file\" | sed -e 's,/[^/]*$$,,'`; \\\n\t    if test -d \"$(distdir)/$$file\"; then \\\n\t      find \"$(distdir)/$$file\" -type d ! -perm -700 -exec chmod u+rwx {} \\;; \\\n\t    fi; \\\n\t    if test -d $(srcdir)/$$file && test $$d != $(srcdir); then \\\n\t      cp -fpR $(srcdir)/$$file \"$(distdir)$$dir\" || exit 1; \\\n\t      find \"$(distdir)/$$file\" -type d ! -perm -700 -exec chmod u+rwx {} \\;; \\\n\t    fi; \\\n\t    cp -fpR $$d/$$file \"$(distdir)$$dir\" || exit 1; \\\n\t  else \\\n\t    test -f \"$(distdir)/$$file\" \\\n\t    || cp -p $$d/$$file \"$(distdir)/$$file\" \\\n\t    || exit 1; \\\n\t  fi; \\\n\tdone\ncheck-am: all-am\ncheck: check-am\nall-am: Makefile $(LTLIBRARIES) $(PROGRAMS)\ninstall-binPROGRAMS: install-libLTLIBRARIES\n\ninstalldirs:\n\tfor dir in \"$(DESTDIR)$(libdir)\" \"$(DESTDIR)$(bindir)\"; do \\\n\t  test -z \"$$dir\" || $(MKDIR_P) \"$$dir\"; \\\n\tdone\ninstall: install-am\ninstall-exec: install-exec-am\ninstall-data: install-data-am\nuninstall: uninstall-am\n\ninstall-am: all-am\n\t@$(MAKE) $(AM_MAKEFLAGS) install-exec-am install-data-am\n\ninstallcheck: installcheck-am\ninstall-strip:\n\tif test -z '$(STRIP)'; then \\\n\t  $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" \\\n\t    install_sh_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" INSTALL_STRIP_FLAG=-s \\\n\t      install; \\\n\telse \\\n\t  $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" \\\n\t    install_sh_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" INSTALL_STRIP_FLAG=-s \\\n\t    \"INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'\" install; \\\n\tfi\nmostlyclean-generic:\n\nclean-generic:\n\ndistclean-generic:\n\t-test -z \"$(CONFIG_CLEAN_FILES)\" || rm -f $(CONFIG_CLEAN_FILES)\n\t-test . = \"$(srcdir)\" || test -z \"$(CONFIG_CLEAN_VPATH_FILES)\" || rm -f $(CONFIG_CLEAN_VPATH_FILES)\n\nmaintainer-clean-generic:\n\t@echo \"This command is intended for maintainers to use\"\n\t@echo \"it deletes files that may require special tools to rebuild.\"\nclean: clean-am\n\nclean-am: clean-binPROGRAMS clean-generic clean-libLTLIBRARIES \\\n\tclean-libtool mostlyclean-am\n\ndistclean: distclean-am\n\t-rm -rf ./$(DEPDIR)\n\t-rm -f Makefile\ndistclean-am: clean-am distclean-compile distclean-generic \\\n\tdistclean-tags\n\ndvi: dvi-am\n\ndvi-am:\n\nhtml: html-am\n\nhtml-am:\n\ninfo: info-am\n\ninfo-am:\n\ninstall-data-am:\n\ninstall-dvi: install-dvi-am\n\ninstall-dvi-am:\n\ninstall-exec-am: install-binPROGRAMS install-libLTLIBRARIES\n\ninstall-html: install-html-am\n\ninstall-html-am:\n\ninstall-info: install-info-am\n\ninstall-info-am:\n\ninstall-man:\n\ninstall-pdf: install-pdf-am\n\ninstall-pdf-am:\n\ninstall-ps: install-ps-am\n\ninstall-ps-am:\n\ninstallcheck-am:\n\nmaintainer-clean: maintainer-clean-am\n\t-rm -rf ./$(DEPDIR)\n\t-rm -f Makefile\nmaintainer-clean-am: distclean-am maintainer-clean-generic\n\nmostlyclean: mostlyclean-am\n\nmostlyclean-am: mostlyclean-compile mostlyclean-generic \\\n\tmostlyclean-libtool\n\npdf: pdf-am\n\npdf-am:\n\nps: ps-am\n\nps-am:\n\nuninstall-am: uninstall-binPROGRAMS uninstall-libLTLIBRARIES\n\n.MAKE: install-am install-strip\n\n.PHONY: CTAGS GTAGS TAGS all all-am check check-am clean \\\n\tclean-binPROGRAMS clean-generic clean-libLTLIBRARIES \\\n\tclean-libtool cscopelist-am ctags ctags-am distclean \\\n\tdistclean-compile distclean-generic distclean-libtool \\\n\tdistclean-tags distdir dvi dvi-am html html-am info info-am \\\n\tinstall install-am install-binPROGRAMS install-data \\\n\tinstall-data-am install-dvi install-dvi-am install-exec \\\n\tinstall-exec-am install-html install-html-am install-info \\\n\tinstall-info-am install-libLTLIBRARIES install-man install-pdf \\\n\tinstall-pdf-am install-ps install-ps-am install-strip \\\n\tinstallcheck installcheck-am installdirs maintainer-clean \\\n\tmaintainer-clean-generic mostlyclean mostlyclean-compile \\\n\tmostlyclean-generic mostlyclean-libtool pdf pdf-am ps ps-am \\\n\ttags tags-am uninstall uninstall-am uninstall-binPROGRAMS \\\n\tuninstall-libLTLIBRARIES\n\n\n# Tell versions [3.59,3.63) of GNU make to not export all variables.\n# Otherwise a system limit (for SysV at least) may be exceeded.\n.NOEXPORT:\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/extensions/pdt/getters.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/extensions/pdt/getters.h>\n\nnamespace fst {\nnamespace script {\n\nbool GetPdtComposeFilter(const string &str, PdtComposeFilter *cf) {\n  if (str == \"expand\") {\n    *cf = EXPAND_FILTER;\n  } else if (str == \"expand_paren\") {\n    *cf = EXPAND_PAREN_FILTER;\n  } else if (str == \"paren\") {\n    *cf = PAREN_FILTER;\n  } else {\n    return false;\n  }\n  return true;\n}\n\nbool GetPdtParserType(const string &str, PdtParserType *pt) {\n  if (str == \"left\") {\n    *pt = PDT_LEFT_PARSER;\n  } else if (str == \"left_sr\") {\n    *pt = PDT_LEFT_SR_PARSER;\n  } else {\n    return false;\n  }\n  return true;\n}\n\n}  // namespace script\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/extensions/pdt/pdtcompose.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Composes a PDT and an FST.\n\n#include <cstring>\n\n#include <memory>\n#include <string>\n#include <vector>\n\n#include <fst/flags.h>\n#include <fst/log.h>\n\n#include <fst/extensions/pdt/getters.h>\n#include <fst/extensions/pdt/pdtscript.h>\n#include <fst/util.h>\n\nDEFINE_string(pdt_parentheses, \"\", \"PDT parenthesis label pairs\");\nDEFINE_bool(left_pdt, true, \"Is the first argument the PDT?\");\nDEFINE_bool(connect, true, \"Trim output?\");\nDEFINE_string(compose_filter, \"paren\",\n              \"Composition filter, one of: \\\"expand\\\", \\\"expand_paren\\\", \"\n              \"\\\"paren\\\"\");\n\nint main(int argc, char **argv) {\n  namespace s = fst::script;\n  using fst::ReadLabelPairs;\n  using fst::PdtComposeFilter;\n  using fst::PdtComposeOptions;\n  using fst::script::FstClass;\n  using fst::script::VectorFstClass;\n\n  string usage = \"Compose a PDT and an FST.\\n\\n  Usage: \";\n  usage += argv[0];\n  usage += \" in.pdt in.fst [out.pdt]\\n\";\n  usage += \" in.fst in.pdt [out.pdt]\\n\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n  if (argc < 3 || argc > 4) {\n    ShowUsage();\n    return 1;\n  }\n\n  const string in1_name = strcmp(argv[1], \"-\") == 0 ? \"\" : argv[1];\n  const string in2_name = strcmp(argv[2], \"-\") == 0 ? \"\" : argv[2];\n  const string out_name = argc > 3 ? argv[3] : \"\";\n\n  if (in1_name.empty() && in2_name.empty()) {\n    LOG(ERROR) << argv[0] << \": Can't take both inputs from standard input.\";\n    return 1;\n  }\n\n  std::unique_ptr<FstClass> ifst1(FstClass::Read(in1_name));\n  if (!ifst1) return 1;\n  std::unique_ptr<FstClass> ifst2(FstClass::Read(in2_name));\n  if (!ifst2) return 1;\n\n  if (FLAGS_pdt_parentheses.empty()) {\n    LOG(ERROR) << argv[0] << \": No PDT parenthesis label pairs provided\";\n    return 1;\n  }\n\n  std::vector<s::LabelPair> parens;\n  if (!ReadLabelPairs(FLAGS_pdt_parentheses, &parens, false)) return 1;\n\n  VectorFstClass ofst(ifst1->ArcType());\n\n  PdtComposeFilter compose_filter;\n  if (!s::GetPdtComposeFilter(FLAGS_compose_filter, &compose_filter)) {\n    LOG(ERROR) << argv[0] << \": Unknown or unsupported compose filter type: \"\n               << FLAGS_compose_filter;\n    return 1;\n  }\n\n  const PdtComposeOptions copts(FLAGS_connect, compose_filter);\n\n  s::PdtCompose(*ifst1, *ifst2, parens, &ofst, copts, FLAGS_left_pdt);\n\n  ofst.Write(out_name);\n\n  return 0;\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/extensions/pdt/pdtexpand.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Expands a (bounded-stack) PDT as an FST.\n\n#include <cstring>\n\n#include <memory>\n#include <string>\n#include <vector>\n\n#include <fst/flags.h>\n#include <fst/log.h>\n\n#include <fst/extensions/pdt/pdtscript.h>\n#include <fst/util.h>\n\nDEFINE_string(pdt_parentheses, \"\", \"PDT parenthesis label pairs\");\nDEFINE_bool(connect, true, \"Trim output?\");\nDEFINE_bool(keep_parentheses, false, \"Keep PDT parentheses in result?\");\nDEFINE_string(weight, \"\", \"Weight threshold\");\n\nint main(int argc, char **argv) {\n  namespace s = fst::script;\n  using fst::script::FstClass;\n  using fst::script::VectorFstClass;\n  using fst::script::WeightClass;\n  using fst::ReadLabelPairs;\n\n  string usage = \"Expand a (bounded-stack) PDT as an FST.\\n\\n  Usage: \";\n  usage += argv[0];\n  usage += \" in.pdt [out.fst]\\n\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n  if (argc > 3) {\n    ShowUsage();\n    return 1;\n  }\n\n  const string in_name =\n      (argc > 1 && (strcmp(argv[1], \"-\") != 0)) ? argv[1] : \"\";\n  const string out_name = argc > 2 ? argv[2] : \"\";\n\n  std::unique_ptr<FstClass> ifst(FstClass::Read(in_name));\n  if (!ifst) return 1;\n\n  if (FLAGS_pdt_parentheses.empty()) {\n    LOG(ERROR) << argv[0] << \": No PDT parenthesis label pairs provided\";\n    return 1;\n  }\n\n  std::vector<s::LabelPair> parens;\n  if (!ReadLabelPairs(FLAGS_pdt_parentheses, &parens, false)) return 1;\n\n  const auto weight_threshold =\n      FLAGS_weight.empty() ? WeightClass::Zero(ifst->WeightType())\n                           : WeightClass(ifst->WeightType(), FLAGS_weight);\n\n  VectorFstClass ofst(ifst->ArcType());\n  s::PdtExpand(*ifst, parens, &ofst,\n               s::PdtExpandOptions(FLAGS_connect, FLAGS_keep_parentheses,\n                                   weight_threshold));\n\n  ofst.Write(out_name);\n\n  return 0;\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/extensions/pdt/pdtinfo.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Prints out various information about a PDT such as number of states, arcs,\n// and parentheses.\n\n#include <cstring>\n\n#include <memory>\n#include <string>\n#include <vector>\n\n#include <fst/flags.h>\n#include <fst/log.h>\n\n#include <fst/extensions/pdt/pdtscript.h>\n#include <fst/util.h>\n\nDEFINE_string(pdt_parentheses, \"\", \"PDT parenthesis label pairs\");\n\nint main(int argc, char **argv) {\n  namespace s = fst::script;\n  using fst::ReadLabelPairs;\n  using fst::script::FstClass;\n\n  string usage = \"Prints out information about a PDT.\\n\\n  Usage: \";\n  usage += argv[0];\n  usage += \" in.pdt\\n\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n  if (argc > 2) {\n    ShowUsage();\n    return 1;\n  }\n\n  const string in_name =\n      (argc > 1 && (strcmp(argv[1], \"-\") != 0)) ? argv[1] : \"\";\n\n  std::unique_ptr<FstClass> ifst(FstClass::Read(in_name));\n  if (!ifst) return 1;\n\n  if (FLAGS_pdt_parentheses.empty()) {\n    LOG(ERROR) << argv[0] << \": No PDT parenthesis label pairs provided\";\n    return 1;\n  }\n\n  std::vector<s::LabelPair> parens;\n  if (!ReadLabelPairs(FLAGS_pdt_parentheses, &parens, false)) return 1;\n\n  s::PrintPdtInfo(*ifst, parens);\n\n  return 0;\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/extensions/pdt/pdtreplace.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Converts an RTN represented by FSTs and non-terminal labels into a PDT.\n\n#include <cstring>\n\n#include <string>\n#include <vector>\n\n#include <fst/flags.h>\n\n#include <fst/extensions/pdt/getters.h>\n#include <fst/extensions/pdt/pdtscript.h>\n#include <fst/util.h>\n#include <fst/vector-fst.h>\n\nDEFINE_string(pdt_parentheses, \"\", \"PDT parenthesis label pairs\");\nDEFINE_string(pdt_parser_type, \"left\",\n              \"Construction method, one of: \\\"left\\\", \\\"left_sr\\\"\");\nDEFINE_int64(start_paren_labels, fst::kNoLabel,\n             \"Index to use for the first inserted parentheses; if not \"\n             \"specified, the next available label beyond the highest output \"\n             \"label is used\");\nDEFINE_string(left_paren_prefix, \"(_\", \"Prefix to attach to SymbolTable \"\n              \"labels for inserted left parentheses\");\nDEFINE_string(right_paren_prefix, \")_\", \"Prefix to attach to SymbolTable \"\n              \"labels for inserted right parentheses\");\n\nvoid Cleanup(std::vector<fst::script::LabelFstClassPair> *pairs) {\n  for (const auto &pair : *pairs) {\n    delete pair.second;\n  }\n  pairs->clear();\n}\n\nint main(int argc, char **argv) {\n  namespace s = fst::script;\n  using fst::script::FstClass;\n  using fst::script::VectorFstClass;\n  using fst::PdtParserType;\n  using fst::WriteLabelPairs;\n\n  string usage = \"Converts an RTN represented by FSTs\";\n  usage += \" and non-terminal labels into PDT.\\n\\n  Usage: \";\n  usage += argv[0];\n  usage += \" root.fst rootlabel [rule1.fst label1 ...] [out.fst]\\n\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n  if (argc < 4) {\n    ShowUsage();\n    return 1;\n  }\n\n  const string in_name = argv[1];\n  const string out_name = argc % 2 == 0 ? argv[argc - 1] : \"\";\n\n  auto *ifst = FstClass::Read(in_name);\n  if (!ifst) return 1;\n\n  PdtParserType parser_type;\n  if (!s::GetPdtParserType(FLAGS_pdt_parser_type, &parser_type)) {\n    LOG(ERROR) << argv[0] << \": Unknown PDT parser type: \"\n               << FLAGS_pdt_parser_type;\n    delete ifst;\n    return 1;\n  }\n\n  std::vector<s::LabelFstClassPair> pairs;\n  // Note that if the root label is beyond the range of the underlying FST's\n  // labels, truncation will occur.\n  const auto root = atoll(argv[2]);\n  pairs.emplace_back(root, ifst);\n\n  for (auto i = 3; i < argc - 1; i += 2) {\n    ifst = FstClass::Read(argv[i]);\n    if (!ifst) {\n      Cleanup(&pairs);\n      return 1;\n    }\n    // Note that if the root label is beyond the range of the underlying FST's\n    // labels, truncation will occur.\n    const auto label = atoll(argv[i + 1]);\n    pairs.emplace_back(label, ifst);\n  }\n\n  VectorFstClass ofst(ifst->ArcType());\n  std::vector<s::LabelPair> parens;\n  s::PdtReplace(pairs, &ofst, &parens, root, parser_type,\n                FLAGS_start_paren_labels, FLAGS_left_paren_prefix,\n                FLAGS_right_paren_prefix);\n  Cleanup(&pairs);\n\n  if (!FLAGS_pdt_parentheses.empty()) {\n    if (!WriteLabelPairs(FLAGS_pdt_parentheses, parens)) return 1;\n  }\n\n  ofst.Write(out_name);\n\n  return 0;\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/extensions/pdt/pdtreverse.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Reverses a PDT.\n\n#include <cstring>\n\n#include <memory>\n#include <string>\n#include <vector>\n\n#include <fst/flags.h>\n#include <fst/log.h>\n\n#include <fst/extensions/pdt/pdtscript.h>\n#include <fst/util.h>\n\nDEFINE_string(pdt_parentheses, \"\", \"PDT parenthesis label pairs\");\n\nint main(int argc, char **argv) {\n  namespace s = fst::script;\n  using fst::ReadLabelPairs;\n  using fst::script::FstClass;\n  using fst::script::VectorFstClass;\n\n  string usage = \"Reverse a PDT.\\n\\n  Usage: \";\n  usage += argv[0];\n  usage += \" in.pdt [out.fst]\\n\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n  if (argc > 3) {\n    ShowUsage();\n    return 1;\n  }\n\n  const string in_name =\n      (argc > 1 && (strcmp(argv[1], \"-\") != 0)) ? argv[1] : \"\";\n  const string out_name = argc > 2 ? argv[2] : \"\";\n\n  std::unique_ptr<FstClass> ifst(FstClass::Read(in_name));\n  if (!ifst) return 1;\n\n  if (FLAGS_pdt_parentheses.empty()) {\n    LOG(ERROR) << argv[0] << \": No PDT parenthesis label pairs provided\";\n    return 1;\n  }\n\n  std::vector<s::LabelPair> parens;\n  if (!ReadLabelPairs(FLAGS_pdt_parentheses, &parens, false)) return 1;\n\n  VectorFstClass ofst(ifst->ArcType());\n\n  s::PdtReverse(*ifst, parens, &ofst);\n\n  ofst.Write(out_name);\n\n  return 0;\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/extensions/pdt/pdtscript.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Definitions of 'scriptable' versions of pdt operations, that is,\n// those that can be called with FstClass-type arguments.\n//\n// See comments in nlp/fst/script/script-impl.h for how the registration\n// mechanism allows these to work with various arc types.\n\n#include <string>\n#include <vector>\n\n#include <fst/extensions/pdt/compose.h>\n#include <fst/extensions/pdt/expand.h>\n#include <fst/extensions/pdt/pdtscript.h>\n#include <fst/extensions/pdt/replace.h>\n#include <fst/extensions/pdt/reverse.h>\n#include <fst/extensions/pdt/shortest-path.h>\n#include <fst/script/script-impl.h>\n\nnamespace fst {\nnamespace script {\n\nvoid PdtCompose(const FstClass &ifst1, const FstClass &ifst2,\n                const std::vector<LabelPair> &parens,\n                MutableFstClass *ofst, const PdtComposeOptions &copts,\n                bool left_pdt) {\n  if (!internal::ArcTypesMatch(ifst1, ifst2, \"PdtCompose\") ||\n      !internal::ArcTypesMatch(ifst1, *ofst, \"PdtCompose\"))\n    return;\n  PdtComposeArgs args(ifst1, ifst2, parens, ofst, copts, left_pdt);\n  Apply<Operation<PdtComposeArgs>>(\"PdtCompose\", ifst1.ArcType(), &args);\n}\n\nvoid PdtExpand(const FstClass &ifst,\n               const std::vector<LabelPair> &parens,\n               MutableFstClass *ofst, const PdtExpandOptions &opts) {\n  PdtExpandArgs args(ifst, parens, ofst, opts);\n  Apply<Operation<PdtExpandArgs>>(\"PdtExpand\", ifst.ArcType(), &args);\n}\n\nvoid PdtExpand(const FstClass &ifst,\n               const std::vector<std::pair<int64, int64>> &parens,\n               MutableFstClass *ofst, bool connect, bool keep_parentheses,\n               const WeightClass &weight_threshold) {\n  PdtExpand(ifst, parens, ofst,\n            PdtExpandOptions(connect, keep_parentheses, weight_threshold));\n}\n\nvoid PdtReplace(const std::vector<LabelFstClassPair> &pairs,\n                MutableFstClass *ofst, std::vector<LabelPair> *parens,\n                int64 root, PdtParserType parser_type, int64 start_paren_labels,\n                const string &left_paren_prefix,\n                const string &right_paren_prefix) {\n  for (size_t i = 1; i < pairs.size(); ++i) {\n    if (!internal::ArcTypesMatch(*pairs[i - 1].second, *pairs[i].second,\n                                 \"PdtReplace\"))\n      return;\n  }\n  if (!internal::ArcTypesMatch(*pairs[0].second, *ofst, \"PdtReplace\")) return;\n  PdtReplaceArgs args(pairs, ofst, parens, root, parser_type,\n                      start_paren_labels, left_paren_prefix,\n                      right_paren_prefix);\n  Apply<Operation<PdtReplaceArgs>>(\"PdtReplace\", ofst->ArcType(), &args);\n}\n\nvoid PdtReverse(const FstClass &ifst,\n                const std::vector<LabelPair> &parens,\n                MutableFstClass *ofst) {\n  PdtReverseArgs args(ifst, parens, ofst);\n  Apply<Operation<PdtReverseArgs>>(\"PdtReverse\", ifst.ArcType(), &args);\n}\n\nvoid PdtShortestPath(const FstClass &ifst,\n                     const std::vector<LabelPair> &parens,\n                     MutableFstClass *ofst,\n                     const PdtShortestPathOptions &opts) {\n  PdtShortestPathArgs args(ifst, parens, ofst, opts);\n  Apply<Operation<PdtShortestPathArgs>>(\"PdtShortestPath\", ifst.ArcType(),\n                                        &args);\n}\n\nvoid PrintPdtInfo(const FstClass &ifst,\n                  const std::vector<LabelPair> &parens) {\n  PrintPdtInfoArgs args(ifst, parens);\n  Apply<Operation<PrintPdtInfoArgs>>(\"PrintPdtInfo\", ifst.ArcType(), &args);\n}\n\n// Register operations for common arc types.\n\nREGISTER_FST_PDT_OPERATIONS(StdArc);\nREGISTER_FST_PDT_OPERATIONS(LogArc);\nREGISTER_FST_PDT_OPERATIONS(Log64Arc);\n\n}  // namespace script\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/extensions/pdt/pdtshortestpath.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Returns the shortest path in a (bounded-stack) PDT.\n\n#include <cstring>\n\n#include <memory>\n#include <string>\n#include <vector>\n\n#include <fst/flags.h>\n#include <fst/log.h>\n\n#include <fst/extensions/pdt/pdtscript.h>\n#include <fst/util.h>\n\nDEFINE_bool(keep_parentheses, false, \"Keep PDT parentheses in result?\");\nDEFINE_string(queue_type, \"fifo\",\n              \"Queue type: one of: \"\n              \"\\\"fifo\\\", \\\"lifo\\\", \\\"state\\\"\");\nDEFINE_bool(path_gc, true, \"Garbage collect shortest path data?\");\nDEFINE_string(pdt_parentheses, \"\", \"PDT parenthesis label pairs\");\n\nint main(int argc, char **argv) {\n  namespace s = fst::script;\n  using fst::script::FstClass;\n  using fst::script::VectorFstClass;\n  using fst::QueueType;\n  using fst::ReadLabelPairs;\n\n  string usage = \"Shortest path in a (bounded-stack) PDT.\\n\\n  Usage: \";\n  usage += argv[0];\n  usage += \" in.pdt [out.fst]\\n\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n  if (argc > 3) {\n    ShowUsage();\n    return 1;\n  }\n\n  const string in_name =\n      (argc > 1 && (strcmp(argv[1], \"-\") != 0)) ? argv[1] : \"\";\n  const string out_name = argc > 2 ? argv[2] : \"\";\n\n  std::unique_ptr<FstClass> ifst(FstClass::Read(in_name));\n  if (!ifst) return 1;\n\n  if (FLAGS_pdt_parentheses.empty()) {\n    LOG(ERROR) << argv[0] << \": No PDT parenthesis label pairs provided\";\n    return 1;\n  }\n\n  std::vector<s::LabelPair> parens;\n  if (!ReadLabelPairs(FLAGS_pdt_parentheses, &parens, false)) return 1;\n\n  VectorFstClass ofst(ifst->ArcType());\n\n  QueueType qt;\n  if (FLAGS_queue_type == \"fifo\") {\n    qt = fst::FIFO_QUEUE;\n  } else if (FLAGS_queue_type == \"lifo\") {\n    qt = fst::LIFO_QUEUE;\n  } else if (FLAGS_queue_type == \"state\") {\n    qt = fst::STATE_ORDER_QUEUE;\n  } else {\n    LOG(ERROR) << \"Unknown queue type: \" << FLAGS_queue_type;\n    return 1;\n  }\n\n  const s::PdtShortestPathOptions opts(qt, FLAGS_keep_parentheses,\n                                       FLAGS_path_gc);\n\n  s::PdtShortestPath(*ifst, parens, &ofst, opts);\n\n  ofst.Write(out_name);\n\n  return 0;\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/extensions/python/Makefile.am",
    "content": "# NB: we use the Cython-generated .cc files rather than the *.pxd/.pyx sources\n# used to generate them. Consequently, modifications to the .pyx files will not\n# influence the build unless the .cc files are regenerated using Cython.\n\npython_LTLIBRARIES = pywrapfst.la\n\npyexec_LTILIBRARIES = pywrapfst.la\n\npywrapfst_la_SOURCES = pywrapfst.cc\npywrapfst_la_CPPFLAGS = -I$(srcdir)/../../include $(PYTHON_CPPFLAGS)\npywrapfst_la_LDFLAGS = $(PYTHON_LDFLAGS) -avoid-version -module\npywrapfst_la_LIBADD = ../far/libfstfarscript.la ../far/libfstfar.la \\\n                      ../../script/libfstscript.la ../../lib/libfst.la \\\n                      -lm $(DL_LIBS)\n\n# Exports the *.pxd/*.pxd source files.\nEXTRA_DIST = basictypes.pxd fst.pxd ios.pxd memory.pxd pywrapfst.pxd \\\n             pywrapfst.pyx\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/extensions/python/Makefile.in",
    "content": "# Makefile.in generated by automake 1.14.1 from Makefile.am.\n# @configure_input@\n\n# Copyright (C) 1994-2013 Free Software Foundation, Inc.\n\n# This Makefile.in is free software; the Free Software Foundation\n# gives unlimited permission to copy and/or distribute it,\n# with or without modifications, as long as this notice is preserved.\n\n# This program is distributed in the hope that it will be useful,\n# but WITHOUT ANY WARRANTY, to the extent permitted by law; without\n# even the implied warranty of MERCHANTABILITY or FITNESS FOR A\n# PARTICULAR PURPOSE.\n\n@SET_MAKE@\n\n# NB: we use the Cython-generated .cc files rather than the *.pxd/.pyx sources\n# used to generate them. Consequently, modifications to the .pyx files will not\n# influence the build unless the .cc files are regenerated using Cython.\n\nVPATH = @srcdir@\nam__is_gnu_make = test -n '$(MAKEFILE_LIST)' && test -n '$(MAKELEVEL)'\nam__make_running_with_option = \\\n  case $${target_option-} in \\\n      ?) ;; \\\n      *) echo \"am__make_running_with_option: internal error: invalid\" \\\n              \"target option '$${target_option-}' specified\" >&2; \\\n         exit 1;; \\\n  esac; \\\n  has_opt=no; \\\n  sane_makeflags=$$MAKEFLAGS; \\\n  if $(am__is_gnu_make); then \\\n    sane_makeflags=$$MFLAGS; \\\n  else \\\n    case $$MAKEFLAGS in \\\n      *\\\\[\\ \\\t]*) \\\n        bs=\\\\; \\\n        sane_makeflags=`printf '%s\\n' \"$$MAKEFLAGS\" \\\n          | sed \"s/$$bs$$bs[$$bs $$bs\t]*//g\"`;; \\\n    esac; \\\n  fi; \\\n  skip_next=no; \\\n  strip_trailopt () \\\n  { \\\n    flg=`printf '%s\\n' \"$$flg\" | sed \"s/$$1.*$$//\"`; \\\n  }; \\\n  for flg in $$sane_makeflags; do \\\n    test $$skip_next = yes && { skip_next=no; continue; }; \\\n    case $$flg in \\\n      *=*|--*) continue;; \\\n        -*I) strip_trailopt 'I'; skip_next=yes;; \\\n      -*I?*) strip_trailopt 'I';; \\\n        -*O) strip_trailopt 'O'; skip_next=yes;; \\\n      -*O?*) strip_trailopt 'O';; \\\n        -*l) strip_trailopt 'l'; skip_next=yes;; \\\n      -*l?*) strip_trailopt 'l';; \\\n      -[dEDm]) skip_next=yes;; \\\n      -[JT]) skip_next=yes;; \\\n    esac; \\\n    case $$flg in \\\n      *$$target_option*) has_opt=yes; break;; \\\n    esac; \\\n  done; \\\n  test $$has_opt = yes\nam__make_dryrun = (target_option=n; $(am__make_running_with_option))\nam__make_keepgoing = (target_option=k; $(am__make_running_with_option))\npkgdatadir = $(datadir)/@PACKAGE@\npkgincludedir = $(includedir)/@PACKAGE@\npkglibdir = $(libdir)/@PACKAGE@\npkglibexecdir = $(libexecdir)/@PACKAGE@\nam__cd = CDPATH=\"$${ZSH_VERSION+.}$(PATH_SEPARATOR)\" && cd\ninstall_sh_DATA = $(install_sh) -c -m 644\ninstall_sh_PROGRAM = $(install_sh) -c\ninstall_sh_SCRIPT = $(install_sh) -c\nINSTALL_HEADER = $(INSTALL_DATA)\ntransform = $(program_transform_name)\nNORMAL_INSTALL = :\nPRE_INSTALL = :\nPOST_INSTALL = :\nNORMAL_UNINSTALL = :\nPRE_UNINSTALL = :\nPOST_UNINSTALL = :\nbuild_triplet = @build@\nhost_triplet = @host@\nsubdir = src/extensions/python\nDIST_COMMON = $(srcdir)/Makefile.in $(srcdir)/Makefile.am \\\n\t$(top_srcdir)/depcomp\nACLOCAL_M4 = $(top_srcdir)/aclocal.m4\nam__aclocal_m4_deps = $(top_srcdir)/m4/ac_python_devel.m4 \\\n\t$(top_srcdir)/m4/libtool.m4 $(top_srcdir)/m4/ltoptions.m4 \\\n\t$(top_srcdir)/m4/ltsugar.m4 $(top_srcdir)/m4/ltversion.m4 \\\n\t$(top_srcdir)/m4/lt~obsolete.m4 $(top_srcdir)/configure.ac\nam__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \\\n\t$(ACLOCAL_M4)\nmkinstalldirs = $(install_sh) -d\nCONFIG_HEADER = $(top_builddir)/config.h \\\n\t$(top_builddir)/src/include/fst/config.h\nCONFIG_CLEAN_FILES =\nCONFIG_CLEAN_VPATH_FILES =\nam__vpath_adj_setup = srcdirstrip=`echo \"$(srcdir)\" | sed 's|.|.|g'`;\nam__vpath_adj = case $$p in \\\n    $(srcdir)/*) f=`echo \"$$p\" | sed \"s|^$$srcdirstrip/||\"`;; \\\n    *) f=$$p;; \\\n  esac;\nam__strip_dir = f=`echo $$p | sed -e 's|^.*/||'`;\nam__install_max = 40\nam__nobase_strip_setup = \\\n  srcdirstrip=`echo \"$(srcdir)\" | sed 's/[].[^$$\\\\*|]/\\\\\\\\&/g'`\nam__nobase_strip = \\\n  for p in $$list; do echo \"$$p\"; done | sed -e \"s|$$srcdirstrip/||\"\nam__nobase_list = $(am__nobase_strip_setup); \\\n  for p in $$list; do echo \"$$p $$p\"; done | \\\n  sed \"s| $$srcdirstrip/| |;\"' / .*\\//!s/ .*/ ./; s,\\( .*\\)/[^/]*$$,\\1,' | \\\n  $(AWK) 'BEGIN { files[\".\"] = \"\" } { files[$$2] = files[$$2] \" \" $$1; \\\n    if (++n[$$2] == $(am__install_max)) \\\n      { print $$2, files[$$2]; n[$$2] = 0; files[$$2] = \"\" } } \\\n    END { for (dir in files) print dir, files[dir] }'\nam__base_list = \\\n  sed '$$!N;$$!N;$$!N;$$!N;$$!N;$$!N;$$!N;s/\\n/ /g' | \\\n  sed '$$!N;$$!N;$$!N;$$!N;s/\\n/ /g'\nam__uninstall_files_from_dir = { \\\n  test -z \"$$files\" \\\n    || { test ! -d \"$$dir\" && test ! -f \"$$dir\" && test ! -r \"$$dir\"; } \\\n    || { echo \" ( cd '$$dir' && rm -f\" $$files \")\"; \\\n         $(am__cd) \"$$dir\" && rm -f $$files; }; \\\n  }\nam__installdirs = \"$(DESTDIR)$(pythondir)\"\nLTLIBRARIES = $(python_LTLIBRARIES)\nam__DEPENDENCIES_1 =\npywrapfst_la_DEPENDENCIES = ../far/libfstfarscript.la \\\n\t../far/libfstfar.la ../../script/libfstscript.la \\\n\t../../lib/libfst.la $(am__DEPENDENCIES_1)\nam_pywrapfst_la_OBJECTS = pywrapfst_la-pywrapfst.lo\npywrapfst_la_OBJECTS = $(am_pywrapfst_la_OBJECTS)\nAM_V_lt = $(am__v_lt_@AM_V@)\nam__v_lt_ = $(am__v_lt_@AM_DEFAULT_V@)\nam__v_lt_0 = --silent\nam__v_lt_1 = \npywrapfst_la_LINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \\\n\t$(LIBTOOLFLAGS) --mode=link $(CXXLD) $(AM_CXXFLAGS) \\\n\t$(CXXFLAGS) $(pywrapfst_la_LDFLAGS) $(LDFLAGS) -o $@\nAM_V_P = $(am__v_P_@AM_V@)\nam__v_P_ = $(am__v_P_@AM_DEFAULT_V@)\nam__v_P_0 = false\nam__v_P_1 = :\nAM_V_GEN = $(am__v_GEN_@AM_V@)\nam__v_GEN_ = $(am__v_GEN_@AM_DEFAULT_V@)\nam__v_GEN_0 = @echo \"  GEN     \" $@;\nam__v_GEN_1 = \nAM_V_at = $(am__v_at_@AM_V@)\nam__v_at_ = $(am__v_at_@AM_DEFAULT_V@)\nam__v_at_0 = @\nam__v_at_1 = \nDEFAULT_INCLUDES = \ndepcomp = $(SHELL) $(top_srcdir)/depcomp\nam__depfiles_maybe = depfiles\nam__mv = mv -f\nCXXCOMPILE = $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) \\\n\t$(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS)\nLTCXXCOMPILE = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \\\n\t$(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) \\\n\t$(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) \\\n\t$(AM_CXXFLAGS) $(CXXFLAGS)\nAM_V_CXX = $(am__v_CXX_@AM_V@)\nam__v_CXX_ = $(am__v_CXX_@AM_DEFAULT_V@)\nam__v_CXX_0 = @echo \"  CXX     \" $@;\nam__v_CXX_1 = \nCXXLD = $(CXX)\nCXXLINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \\\n\t$(LIBTOOLFLAGS) --mode=link $(CXXLD) $(AM_CXXFLAGS) \\\n\t$(CXXFLAGS) $(AM_LDFLAGS) $(LDFLAGS) -o $@\nAM_V_CXXLD = $(am__v_CXXLD_@AM_V@)\nam__v_CXXLD_ = $(am__v_CXXLD_@AM_DEFAULT_V@)\nam__v_CXXLD_0 = @echo \"  CXXLD   \" $@;\nam__v_CXXLD_1 = \nSOURCES = $(pywrapfst_la_SOURCES)\nDIST_SOURCES = $(pywrapfst_la_SOURCES)\nam__can_run_installinfo = \\\n  case $$AM_UPDATE_INFO_DIR in \\\n    n|no|NO) false;; \\\n    *) (install-info --version) >/dev/null 2>&1;; \\\n  esac\nam__tagged_files = $(HEADERS) $(SOURCES) $(TAGS_FILES) $(LISP)\n# Read a list of newline-separated strings from the standard input,\n# and print each of them once, without duplicates.  Input order is\n# *not* preserved.\nam__uniquify_input = $(AWK) '\\\n  BEGIN { nonempty = 0; } \\\n  { items[$$0] = 1; nonempty = 1; } \\\n  END { if (nonempty) { for (i in items) print i; }; } \\\n'\n# Make sure the list of sources is unique.  This is necessary because,\n# e.g., the same source file might be shared among _SOURCES variables\n# for different programs/libraries.\nam__define_uniq_tagged_files = \\\n  list='$(am__tagged_files)'; \\\n  unique=`for i in $$list; do \\\n    if test -f \"$$i\"; then echo $$i; else echo $(srcdir)/$$i; fi; \\\n  done | $(am__uniquify_input)`\nETAGS = etags\nCTAGS = ctags\nDISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST)\nACLOCAL = @ACLOCAL@\nAMTAR = @AMTAR@\nAM_DEFAULT_VERBOSITY = @AM_DEFAULT_VERBOSITY@\nAR = @AR@\nAUTOCONF = @AUTOCONF@\nAUTOHEADER = @AUTOHEADER@\nAUTOMAKE = @AUTOMAKE@\nAWK = @AWK@\nCC = @CC@\nCCDEPMODE = @CCDEPMODE@\nCFLAGS = @CFLAGS@\nCPP = @CPP@\nCPPFLAGS = @CPPFLAGS@\nCXX = @CXX@\nCXXCPP = @CXXCPP@\nCXXDEPMODE = @CXXDEPMODE@\nCXXFLAGS = @CXXFLAGS@\nCYGPATH_W = @CYGPATH_W@\nDEFS = @DEFS@\nDEPDIR = @DEPDIR@\nDLLTOOL = @DLLTOOL@\nDL_LIBS = @DL_LIBS@\nDSYMUTIL = @DSYMUTIL@\nDUMPBIN = @DUMPBIN@\nECHO_C = @ECHO_C@\nECHO_N = @ECHO_N@\nECHO_T = @ECHO_T@\nEGREP = @EGREP@\nEXEEXT = @EXEEXT@\nFGREP = @FGREP@\nGREP = @GREP@\nINSTALL = @INSTALL@\nINSTALL_DATA = @INSTALL_DATA@\nINSTALL_PROGRAM = @INSTALL_PROGRAM@\nINSTALL_SCRIPT = @INSTALL_SCRIPT@\nINSTALL_STRIP_PROGRAM = @INSTALL_STRIP_PROGRAM@\nLD = @LD@\nLDFLAGS = @LDFLAGS@\nLIBOBJS = @LIBOBJS@\nLIBS = @LIBS@\nLIBTOOL = @LIBTOOL@\nLIPO = @LIPO@\nLN_S = @LN_S@\nLTLIBOBJS = @LTLIBOBJS@\nMAKEINFO = @MAKEINFO@\nMANIFEST_TOOL = @MANIFEST_TOOL@\nMKDIR_P = @MKDIR_P@\nNM = @NM@\nNMEDIT = @NMEDIT@\nOBJDUMP = @OBJDUMP@\nOBJEXT = @OBJEXT@\nOTOOL = @OTOOL@\nOTOOL64 = @OTOOL64@\nPACKAGE = @PACKAGE@\nPACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@\nPACKAGE_NAME = @PACKAGE_NAME@\nPACKAGE_STRING = @PACKAGE_STRING@\nPACKAGE_TARNAME = @PACKAGE_TARNAME@\nPACKAGE_URL = @PACKAGE_URL@\nPACKAGE_VERSION = @PACKAGE_VERSION@\nPATH_SEPARATOR = @PATH_SEPARATOR@\nPYTHON = @PYTHON@\nPYTHON_CPPFLAGS = @PYTHON_CPPFLAGS@\nPYTHON_EXEC_PREFIX = @PYTHON_EXEC_PREFIX@\nPYTHON_EXTRA_LDFLAGS = @PYTHON_EXTRA_LDFLAGS@\nPYTHON_EXTRA_LIBS = @PYTHON_EXTRA_LIBS@\nPYTHON_LDFLAGS = @PYTHON_LDFLAGS@\nPYTHON_PLATFORM = @PYTHON_PLATFORM@\nPYTHON_PREFIX = @PYTHON_PREFIX@\nPYTHON_SITE_PKG = @PYTHON_SITE_PKG@\nPYTHON_VERSION = @PYTHON_VERSION@\nRANLIB = @RANLIB@\nSED = @SED@\nSET_MAKE = @SET_MAKE@\nSHELL = @SHELL@\nSTRIP = @STRIP@\nVERSION = @VERSION@\nabs_builddir = @abs_builddir@\nabs_srcdir = @abs_srcdir@\nabs_top_builddir = @abs_top_builddir@\nabs_top_srcdir = @abs_top_srcdir@\nac_ct_AR = @ac_ct_AR@\nac_ct_CC = @ac_ct_CC@\nac_ct_CXX = @ac_ct_CXX@\nac_ct_DUMPBIN = @ac_ct_DUMPBIN@\nam__include = @am__include@\nam__leading_dot = @am__leading_dot@\nam__quote = @am__quote@\nam__tar = @am__tar@\nam__untar = @am__untar@\nbindir = @bindir@\nbuild = @build@\nbuild_alias = @build_alias@\nbuild_cpu = @build_cpu@\nbuild_os = @build_os@\nbuild_vendor = @build_vendor@\nbuilddir = @builddir@\ndatadir = @datadir@\ndatarootdir = @datarootdir@\ndocdir = @docdir@\ndvidir = @dvidir@\nexec_prefix = @exec_prefix@\nhost = @host@\nhost_alias = @host_alias@\nhost_cpu = @host_cpu@\nhost_os = @host_os@\nhost_vendor = @host_vendor@\nhtmldir = @htmldir@\nincludedir = @includedir@\ninfodir = @infodir@\ninstall_sh = @install_sh@\nlibdir = @libdir@\nlibexecdir = @libexecdir@\nlibfstdir = @libfstdir@\nlocaledir = @localedir@\nlocalstatedir = @localstatedir@\nmandir = @mandir@\nmkdir_p = @mkdir_p@\noldincludedir = @oldincludedir@\npdfdir = @pdfdir@\npkgpyexecdir = @pkgpyexecdir@\npkgpythondir = @pkgpythondir@\nprefix = @prefix@\nprogram_transform_name = @program_transform_name@\npsdir = @psdir@\npyexecdir = @pyexecdir@\npythondir = @pythondir@\nsbindir = @sbindir@\nsharedstatedir = @sharedstatedir@\nsrcdir = @srcdir@\nsysconfdir = @sysconfdir@\ntarget_alias = @target_alias@\ntop_build_prefix = @top_build_prefix@\ntop_builddir = @top_builddir@\ntop_srcdir = @top_srcdir@\npython_LTLIBRARIES = pywrapfst.la\npyexec_LTILIBRARIES = pywrapfst.la\npywrapfst_la_SOURCES = pywrapfst.cc\npywrapfst_la_CPPFLAGS = -I$(srcdir)/../../include $(PYTHON_CPPFLAGS)\npywrapfst_la_LDFLAGS = $(PYTHON_LDFLAGS) -avoid-version -module\npywrapfst_la_LIBADD = ../far/libfstfarscript.la ../far/libfstfar.la \\\n                      ../../script/libfstscript.la ../../lib/libfst.la \\\n                      -lm $(DL_LIBS)\n\n\n# Exports the *.pxd/*.pxd source files.\nEXTRA_DIST = basictypes.pxd fst.pxd ios.pxd memory.pxd pywrapfst.pxd \\\n             pywrapfst.pyx\n\nall: all-am\n\n.SUFFIXES:\n.SUFFIXES: .cc .lo .o .obj\n$(srcdir)/Makefile.in:  $(srcdir)/Makefile.am  $(am__configure_deps)\n\t@for dep in $?; do \\\n\t  case '$(am__configure_deps)' in \\\n\t    *$$dep*) \\\n\t      ( cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh ) \\\n\t        && { if test -f $@; then exit 0; else break; fi; }; \\\n\t      exit 1;; \\\n\t  esac; \\\n\tdone; \\\n\techo ' cd $(top_srcdir) && $(AUTOMAKE) --foreign src/extensions/python/Makefile'; \\\n\t$(am__cd) $(top_srcdir) && \\\n\t  $(AUTOMAKE) --foreign src/extensions/python/Makefile\n.PRECIOUS: Makefile\nMakefile: $(srcdir)/Makefile.in $(top_builddir)/config.status\n\t@case '$?' in \\\n\t  *config.status*) \\\n\t    cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh;; \\\n\t  *) \\\n\t    echo ' cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe)'; \\\n\t    cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe);; \\\n\tesac;\n\n$(top_builddir)/config.status: $(top_srcdir)/configure $(CONFIG_STATUS_DEPENDENCIES)\n\tcd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh\n\n$(top_srcdir)/configure:  $(am__configure_deps)\n\tcd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh\n$(ACLOCAL_M4):  $(am__aclocal_m4_deps)\n\tcd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh\n$(am__aclocal_m4_deps):\n\ninstall-pythonLTLIBRARIES: $(python_LTLIBRARIES)\n\t@$(NORMAL_INSTALL)\n\t@list='$(python_LTLIBRARIES)'; test -n \"$(pythondir)\" || list=; \\\n\tlist2=; for p in $$list; do \\\n\t  if test -f $$p; then \\\n\t    list2=\"$$list2 $$p\"; \\\n\t  else :; fi; \\\n\tdone; \\\n\ttest -z \"$$list2\" || { \\\n\t  echo \" $(MKDIR_P) '$(DESTDIR)$(pythondir)'\"; \\\n\t  $(MKDIR_P) \"$(DESTDIR)$(pythondir)\" || exit 1; \\\n\t  echo \" $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) $$list2 '$(DESTDIR)$(pythondir)'\"; \\\n\t  $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) $$list2 \"$(DESTDIR)$(pythondir)\"; \\\n\t}\n\nuninstall-pythonLTLIBRARIES:\n\t@$(NORMAL_UNINSTALL)\n\t@list='$(python_LTLIBRARIES)'; test -n \"$(pythondir)\" || list=; \\\n\tfor p in $$list; do \\\n\t  $(am__strip_dir) \\\n\t  echo \" $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=uninstall rm -f '$(DESTDIR)$(pythondir)/$$f'\"; \\\n\t  $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=uninstall rm -f \"$(DESTDIR)$(pythondir)/$$f\"; \\\n\tdone\n\nclean-pythonLTLIBRARIES:\n\t-test -z \"$(python_LTLIBRARIES)\" || rm -f $(python_LTLIBRARIES)\n\t@list='$(python_LTLIBRARIES)'; \\\n\tlocs=`for p in $$list; do echo $$p; done | \\\n\t      sed 's|^[^/]*$$|.|; s|/[^/]*$$||; s|$$|/so_locations|' | \\\n\t      sort -u`; \\\n\ttest -z \"$$locs\" || { \\\n\t  echo rm -f $${locs}; \\\n\t  rm -f $${locs}; \\\n\t}\n\npywrapfst.la: $(pywrapfst_la_OBJECTS) $(pywrapfst_la_DEPENDENCIES) $(EXTRA_pywrapfst_la_DEPENDENCIES) \n\t$(AM_V_CXXLD)$(pywrapfst_la_LINK) -rpath $(pythondir) $(pywrapfst_la_OBJECTS) $(pywrapfst_la_LIBADD) $(LIBS)\n\nmostlyclean-compile:\n\t-rm -f *.$(OBJEXT)\n\ndistclean-compile:\n\t-rm -f *.tab.c\n\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/pywrapfst_la-pywrapfst.Plo@am__quote@\n\n.cc.o:\n@am__fastdepCXX_TRUE@\t$(AM_V_CXX)depbase=`echo $@ | sed 's|[^/]*$$|$(DEPDIR)/&|;s|\\.o$$||'`;\\\n@am__fastdepCXX_TRUE@\t$(CXXCOMPILE) -MT $@ -MD -MP -MF $$depbase.Tpo -c -o $@ $< &&\\\n@am__fastdepCXX_TRUE@\t$(am__mv) $$depbase.Tpo $$depbase.Po\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\t$(AM_V_CXX)source='$<' object='$@' libtool=no @AMDEPBACKSLASH@\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\tDEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@\n@am__fastdepCXX_FALSE@\t$(AM_V_CXX@am__nodep@)$(CXXCOMPILE) -c -o $@ $<\n\n.cc.obj:\n@am__fastdepCXX_TRUE@\t$(AM_V_CXX)depbase=`echo $@ | sed 's|[^/]*$$|$(DEPDIR)/&|;s|\\.obj$$||'`;\\\n@am__fastdepCXX_TRUE@\t$(CXXCOMPILE) -MT $@ -MD -MP -MF $$depbase.Tpo -c -o $@ `$(CYGPATH_W) '$<'` &&\\\n@am__fastdepCXX_TRUE@\t$(am__mv) $$depbase.Tpo $$depbase.Po\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\t$(AM_V_CXX)source='$<' object='$@' libtool=no @AMDEPBACKSLASH@\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\tDEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@\n@am__fastdepCXX_FALSE@\t$(AM_V_CXX@am__nodep@)$(CXXCOMPILE) -c -o $@ `$(CYGPATH_W) '$<'`\n\n.cc.lo:\n@am__fastdepCXX_TRUE@\t$(AM_V_CXX)depbase=`echo $@ | sed 's|[^/]*$$|$(DEPDIR)/&|;s|\\.lo$$||'`;\\\n@am__fastdepCXX_TRUE@\t$(LTCXXCOMPILE) -MT $@ -MD -MP -MF $$depbase.Tpo -c -o $@ $< &&\\\n@am__fastdepCXX_TRUE@\t$(am__mv) $$depbase.Tpo $$depbase.Plo\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\t$(AM_V_CXX)source='$<' object='$@' libtool=yes @AMDEPBACKSLASH@\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\tDEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@\n@am__fastdepCXX_FALSE@\t$(AM_V_CXX@am__nodep@)$(LTCXXCOMPILE) -c -o $@ $<\n\npywrapfst_la-pywrapfst.lo: pywrapfst.cc\n@am__fastdepCXX_TRUE@\t$(AM_V_CXX)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(pywrapfst_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -MT pywrapfst_la-pywrapfst.lo -MD -MP -MF $(DEPDIR)/pywrapfst_la-pywrapfst.Tpo -c -o pywrapfst_la-pywrapfst.lo `test -f 'pywrapfst.cc' || echo '$(srcdir)/'`pywrapfst.cc\n@am__fastdepCXX_TRUE@\t$(AM_V_at)$(am__mv) $(DEPDIR)/pywrapfst_la-pywrapfst.Tpo $(DEPDIR)/pywrapfst_la-pywrapfst.Plo\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\t$(AM_V_CXX)source='pywrapfst.cc' object='pywrapfst_la-pywrapfst.lo' libtool=yes @AMDEPBACKSLASH@\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\tDEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@\n@am__fastdepCXX_FALSE@\t$(AM_V_CXX@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(pywrapfst_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -c -o pywrapfst_la-pywrapfst.lo `test -f 'pywrapfst.cc' || echo '$(srcdir)/'`pywrapfst.cc\n\nmostlyclean-libtool:\n\t-rm -f *.lo\n\nclean-libtool:\n\t-rm -rf .libs _libs\n\nID: $(am__tagged_files)\n\t$(am__define_uniq_tagged_files); mkid -fID $$unique\ntags: tags-am\nTAGS: tags\n\ntags-am: $(TAGS_DEPENDENCIES) $(am__tagged_files)\n\tset x; \\\n\there=`pwd`; \\\n\t$(am__define_uniq_tagged_files); \\\n\tshift; \\\n\tif test -z \"$(ETAGS_ARGS)$$*$$unique\"; then :; else \\\n\t  test -n \"$$unique\" || unique=$$empty_fix; \\\n\t  if test $$# -gt 0; then \\\n\t    $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \\\n\t      \"$$@\" $$unique; \\\n\t  else \\\n\t    $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \\\n\t      $$unique; \\\n\t  fi; \\\n\tfi\nctags: ctags-am\n\nCTAGS: ctags\nctags-am: $(TAGS_DEPENDENCIES) $(am__tagged_files)\n\t$(am__define_uniq_tagged_files); \\\n\ttest -z \"$(CTAGS_ARGS)$$unique\" \\\n\t  || $(CTAGS) $(CTAGSFLAGS) $(AM_CTAGSFLAGS) $(CTAGS_ARGS) \\\n\t     $$unique\n\nGTAGS:\n\there=`$(am__cd) $(top_builddir) && pwd` \\\n\t  && $(am__cd) $(top_srcdir) \\\n\t  && gtags -i $(GTAGS_ARGS) \"$$here\"\ncscopelist: cscopelist-am\n\ncscopelist-am: $(am__tagged_files)\n\tlist='$(am__tagged_files)'; \\\n\tcase \"$(srcdir)\" in \\\n\t  [\\\\/]* | ?:[\\\\/]*) sdir=\"$(srcdir)\" ;; \\\n\t  *) sdir=$(subdir)/$(srcdir) ;; \\\n\tesac; \\\n\tfor i in $$list; do \\\n\t  if test -f \"$$i\"; then \\\n\t    echo \"$(subdir)/$$i\"; \\\n\t  else \\\n\t    echo \"$$sdir/$$i\"; \\\n\t  fi; \\\n\tdone >> $(top_builddir)/cscope.files\n\ndistclean-tags:\n\t-rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags\n\ndistdir: $(DISTFILES)\n\t@srcdirstrip=`echo \"$(srcdir)\" | sed 's/[].[^$$\\\\*]/\\\\\\\\&/g'`; \\\n\ttopsrcdirstrip=`echo \"$(top_srcdir)\" | sed 's/[].[^$$\\\\*]/\\\\\\\\&/g'`; \\\n\tlist='$(DISTFILES)'; \\\n\t  dist_files=`for file in $$list; do echo $$file; done | \\\n\t  sed -e \"s|^$$srcdirstrip/||;t\" \\\n\t      -e \"s|^$$topsrcdirstrip/|$(top_builddir)/|;t\"`; \\\n\tcase $$dist_files in \\\n\t  */*) $(MKDIR_P) `echo \"$$dist_files\" | \\\n\t\t\t   sed '/\\//!d;s|^|$(distdir)/|;s,/[^/]*$$,,' | \\\n\t\t\t   sort -u` ;; \\\n\tesac; \\\n\tfor file in $$dist_files; do \\\n\t  if test -f $$file || test -d $$file; then d=.; else d=$(srcdir); fi; \\\n\t  if test -d $$d/$$file; then \\\n\t    dir=`echo \"/$$file\" | sed -e 's,/[^/]*$$,,'`; \\\n\t    if test -d \"$(distdir)/$$file\"; then \\\n\t      find \"$(distdir)/$$file\" -type d ! -perm -700 -exec chmod u+rwx {} \\;; \\\n\t    fi; \\\n\t    if test -d $(srcdir)/$$file && test $$d != $(srcdir); then \\\n\t      cp -fpR $(srcdir)/$$file \"$(distdir)$$dir\" || exit 1; \\\n\t      find \"$(distdir)/$$file\" -type d ! -perm -700 -exec chmod u+rwx {} \\;; \\\n\t    fi; \\\n\t    cp -fpR $$d/$$file \"$(distdir)$$dir\" || exit 1; \\\n\t  else \\\n\t    test -f \"$(distdir)/$$file\" \\\n\t    || cp -p $$d/$$file \"$(distdir)/$$file\" \\\n\t    || exit 1; \\\n\t  fi; \\\n\tdone\ncheck-am: all-am\ncheck: check-am\nall-am: Makefile $(LTLIBRARIES)\ninstalldirs:\n\tfor dir in \"$(DESTDIR)$(pythondir)\"; do \\\n\t  test -z \"$$dir\" || $(MKDIR_P) \"$$dir\"; \\\n\tdone\ninstall: install-am\ninstall-exec: install-exec-am\ninstall-data: install-data-am\nuninstall: uninstall-am\n\ninstall-am: all-am\n\t@$(MAKE) $(AM_MAKEFLAGS) install-exec-am install-data-am\n\ninstallcheck: installcheck-am\ninstall-strip:\n\tif test -z '$(STRIP)'; then \\\n\t  $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" \\\n\t    install_sh_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" INSTALL_STRIP_FLAG=-s \\\n\t      install; \\\n\telse \\\n\t  $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" \\\n\t    install_sh_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" INSTALL_STRIP_FLAG=-s \\\n\t    \"INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'\" install; \\\n\tfi\nmostlyclean-generic:\n\nclean-generic:\n\ndistclean-generic:\n\t-test -z \"$(CONFIG_CLEAN_FILES)\" || rm -f $(CONFIG_CLEAN_FILES)\n\t-test . = \"$(srcdir)\" || test -z \"$(CONFIG_CLEAN_VPATH_FILES)\" || rm -f $(CONFIG_CLEAN_VPATH_FILES)\n\nmaintainer-clean-generic:\n\t@echo \"This command is intended for maintainers to use\"\n\t@echo \"it deletes files that may require special tools to rebuild.\"\nclean: clean-am\n\nclean-am: clean-generic clean-libtool clean-pythonLTLIBRARIES \\\n\tmostlyclean-am\n\ndistclean: distclean-am\n\t-rm -rf ./$(DEPDIR)\n\t-rm -f Makefile\ndistclean-am: clean-am distclean-compile distclean-generic \\\n\tdistclean-tags\n\ndvi: dvi-am\n\ndvi-am:\n\nhtml: html-am\n\nhtml-am:\n\ninfo: info-am\n\ninfo-am:\n\ninstall-data-am: install-pythonLTLIBRARIES\n\ninstall-dvi: install-dvi-am\n\ninstall-dvi-am:\n\ninstall-exec-am:\n\ninstall-html: install-html-am\n\ninstall-html-am:\n\ninstall-info: install-info-am\n\ninstall-info-am:\n\ninstall-man:\n\ninstall-pdf: install-pdf-am\n\ninstall-pdf-am:\n\ninstall-ps: install-ps-am\n\ninstall-ps-am:\n\ninstallcheck-am:\n\nmaintainer-clean: maintainer-clean-am\n\t-rm -rf ./$(DEPDIR)\n\t-rm -f Makefile\nmaintainer-clean-am: distclean-am maintainer-clean-generic\n\nmostlyclean: mostlyclean-am\n\nmostlyclean-am: mostlyclean-compile mostlyclean-generic \\\n\tmostlyclean-libtool\n\npdf: pdf-am\n\npdf-am:\n\nps: ps-am\n\nps-am:\n\nuninstall-am: uninstall-pythonLTLIBRARIES\n\n.MAKE: install-am install-strip\n\n.PHONY: CTAGS GTAGS TAGS all all-am check check-am clean clean-generic \\\n\tclean-libtool clean-pythonLTLIBRARIES cscopelist-am ctags \\\n\tctags-am distclean distclean-compile distclean-generic \\\n\tdistclean-libtool distclean-tags distdir dvi dvi-am html \\\n\thtml-am info info-am install install-am install-data \\\n\tinstall-data-am install-dvi install-dvi-am install-exec \\\n\tinstall-exec-am install-html install-html-am install-info \\\n\tinstall-info-am install-man install-pdf install-pdf-am \\\n\tinstall-ps install-ps-am install-pythonLTLIBRARIES \\\n\tinstall-strip installcheck installcheck-am installdirs \\\n\tmaintainer-clean maintainer-clean-generic mostlyclean \\\n\tmostlyclean-compile mostlyclean-generic mostlyclean-libtool \\\n\tpdf pdf-am ps ps-am tags tags-am uninstall uninstall-am \\\n\tuninstall-pythonLTLIBRARIES\n\n\n# Tell versions [3.59,3.63) of GNU make to not export all variables.\n# Otherwise a system limit (for SysV at least) may be exceeded.\n.NOEXPORT:\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/extensions/python/basictypes.pxd",
    "content": "# See www.openfst.org for extensive documentation on this weighted\n# finite-state transducer library.\n\n\nfrom libc.stdint cimport *\n\n\ncdef extern from \"<fst/types.h>\" nogil:\n\n  ctypedef int8_t int8\n  ctypedef int16_t int16\n  ctypedef int32_t int32\n  ctypedef int64_t int64\n  ctypedef uint8_t uint8\n  ctypedef uint16_t uint16\n  ctypedef uint32_t uint32\n  ctypedef uint64_t uint64\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/extensions/python/fst.pxd",
    "content": "# See www.openfst.org for extensive documentation on this weighted\n# finite-state transducer library.\n\n\nfrom libc.time cimport time_t\nfrom libc.time cimport time\n\nfrom libcpp cimport bool\nfrom libcpp.vector cimport vector\nfrom libcpp.utility cimport pair\n\nfrom libcpp.string cimport string\nfrom basictypes cimport int32\nfrom basictypes cimport int64\nfrom basictypes cimport uint32\nfrom basictypes cimport uint64\nfrom ios cimport istream\nfrom ios cimport ostream\n\n\ncdef extern from \"<fst/util.h>\" nogil:\n\n  # Note that this is a copy, so it should be viewed as read-only.\n\n  bool FLAGS_fst_error_fatal\n\n\ncdef extern from \"<fst/fstlib.h>\" namespace \"fst\" nogil:\n\n  # FST properties.\n  const uint64 kExpanded\n  const uint64 kMutable\n  const uint64 kError\n  const uint64 kAcceptor\n  const uint64 kNotAcceptor\n  const uint64 kIDeterministic\n  const uint64 kNonIDeterministic\n  const uint64 kODeterministic\n  const uint64 kNonODeterministic\n  const uint64 kEpsilons\n  const uint64 kNoEpsilons\n  const uint64 kIEpsilons\n  const uint64 kNoIEpsilons\n  const uint64 kOEpsilons\n  const uint64 kNoOEpsilons\n  const uint64 kILabelSorted\n  const uint64 kNotILabelSorted\n  const uint64 kOLabelSorted\n  const uint64 kNotOLabelSorted\n  const uint64 kWeighted\n  const uint64 kUnweighted\n  const uint64 kCyclic\n  const uint64 kAcyclic\n  const uint64 kInitialCyclic\n  const uint64 kInitialAcyclic\n  const uint64 kTopSorted\n  const uint64 kNotTopSorted\n  const uint64 kAccessible\n  const uint64 kNotAccessible\n  const uint64 kCoAccessible\n  const uint64 kNotCoAccessible\n  const uint64 kString\n  const uint64 kNotString\n  const uint64 kWeightedCycles\n  const uint64 kUnweightedCycles\n  const uint64 kNullProperties\n  const uint64 kCopyProperties\n  const uint64 kIntrinsicProperties\n  const uint64 kExtrinsicProperties\n  const uint64 kSetStartProperties\n  const uint64 kSetFinalProperties\n  const uint64 kAddStateProperties\n  const uint64 kAddArcProperties\n  const uint64 kSetArcProperties\n  const uint64 kDeleteStatesProperties\n  const uint64 kDeleteArcsProperties\n  const uint64 kStateSortProperties\n  const uint64 kArcSortProperties\n  const uint64 kILabelInvariantProperties\n  const uint64 kOLabelInvariantProperties\n  const uint64 kWeightInvariantProperties\n  const uint64 kAddSuperFinalProperties\n  const uint64 kRmSuperFinalProperties\n  const uint64 kBinaryProperties\n  const uint64 kTrinaryProperties\n  const uint64 kPosTrinaryProperties\n  const uint64 kNegTrinaryProperties\n  const uint64 kFstProperties\n\n  # ArcIterator flags.\n  const uint32 kArcILabelValue\n  const uint32 kArcOLabelValue\n  const uint32 kArcWeightValue\n  const uint32 kArcNextStateValue\n  const uint32 kArcNoCache\n  const uint32 kArcValueFlags\n  const uint32 kArcFlags\n\n  # EncodeMapper flags.\n  const uint32 kEncodeLabels\n  const uint32 kEncodeWeights\n  const uint32 kEncodeFlags\n\n  # Default argument constants.\n  const float kDelta\n  const float kShortestDelta\n  const int kNoLabel\n  const int kNoStateId\n  const int64 kNoSymbol\n\n  enum ClosureType:\n    CLOSURE_STAR\n    CLOSURE_PLUS\n\n\n  enum ComposeFilter:\n    AUTO_FILTER\n    NULL_FILTER\n    SEQUENCE_FILTER\n    ALT_SEQUENCE_FILTER\n    MATCH_FILTER\n    TRIVIAL_FILTER\n\n\n  cdef cppclass ComposeOptions:\n\n    ComposeOptions(bool, ComposeFilter)\n\n\n  enum DeterminizeType:\n    DETERMINIZE_FUNCTIONAL\n    DETERMINIZE_NONFUNCTIONAL\n    DETERMINIZE_DISAMBIGUATE\n\n\n  enum EncodeType:\n    DECODE\n    ENCODE\n\n\n  enum EpsNormalizeType:\n    EPS_NORM_INPUT\n    EPS_NORM_OUTPUT\n\n\n  enum ProjectType:\n    PROJECT_INPUT\n    PROJECT_OUTPUT\n\n\n  enum QueueType:\n    TRIVIAL_QUEUE\n    FIFO_QUEUE\n    LIFO_QUEUE\n    SHORTEST_FIRST_QUEUE\n    TOP_ORDER_QUEUE\n    STATE_ORDER_QUEUE\n    SCC_QUEUE\n    AUTO_QUEUE\n    OTHER_QUEUE\n\n\n  # This is a templated struct at the C++ level, but Cython does not support\n  # templated structs unless we pretend they are full-blown classes.\n  cdef cppclass RandGenOptions[RandArcSelection]:\n\n    RandGenOptions(const RandArcSelection &, int32, int32, bool, bool)\n\n\n  enum ReplaceLabelType:\n    REPLACE_LABEL_NEITHER\n    REPLACE_LABEL_INPUT\n    REPLACE_LABEL_OUTPUT\n    REPLACE_LABEL_BOTH\n\n\n  enum ReweightType:\n    REWEIGHT_TO_INITIAL\n    REWEIGHT_TO_FINAL\n\n\n  cdef cppclass SymbolTableTextOptions:\n\n    SymbolTableTextOptions(bool)\n\n  # Symbol tables.\n  cdef cppclass SymbolTable:\n\n    SymbolTable()\n\n    SymbolTable(const string &)\n\n    @staticmethod\n    SymbolTable *Read(const string &)\n\n    @staticmethod\n    SymbolTable *ReadText(const string &, const SymbolTableTextOptions &)\n\n    int64 AddSymbol(const string &, int64)\n\n    int64 AddSymbol(const string &)\n\n    SymbolTable *Copy()\n\n    # Aliased for overload.\n    string FindSymbol \"Find\"(int64)\n\n    # Aliased for overload.\n    int64 FindIndex \"Find\"(string)\n\n    # Aliased for overload.\n    bool MemberSymbol \"Member\"(string)\n\n    # Aliased for overload.\n    bool MemberIndex \"Member\"(int64)\n\n    void AddTable(const SymbolTable &)\n\n    int64 GetNthKey(ssize_t)\n\n    const string &Name()\n\n    void SetName(const string &)\n\n    const string &CheckSum()\n\n    const string &LabeledCheckSum()\n\n    bool Write(const string &)\n\n    bool WriteText(const string &)\n\n    int64 AvailableKey()\n\n    size_t NumSymbols()\n\n\n  SymbolTable *CompactSymbolTable(const SymbolTable &syms)\n\n  SymbolTable *MergeSymbolTable(const SymbolTable &, const SymbolTable &,\n                                bool *)\n\n  SymbolTable *FstReadSymbols(const string &, bool)\n\n\n  cdef cppclass SymbolTableIterator:\n\n    SymbolTableIterator(const SymbolTable &)\n\n    bool Done()\n\n    void Next()\n\n    void Reset()\n\n    string Symbol()\n\n    int64 Value()\n\n\ncdef extern from \"<fst/script/fstscript.h>\" namespace \"fst::script\" nogil:\n\n\n  # Weights.\n  cdef cppclass WeightClass:\n\n    WeightClass()\n\n    WeightClass(const WeightClass &)\n\n    WeightClass(const string &, const string &)\n\n    const string &Type()\n\n    string ToString()\n\n    @staticmethod\n    const WeightClass &Zero(const string &)\n\n    @staticmethod\n    const WeightClass &One(const string &)\n\n    @staticmethod\n    const WeightClass &NoWeight(const string &)\n\n  # Alias.\n  cdef bool Eq \"operator==\"(const WeightClass &, const WeightClass &)\n\n  # Alias.\n  cdef bool Ne \"operator!=\"(const WeightClass &, const WeightClass &)\n\n  cdef WeightClass Plus(const WeightClass &, const WeightClass &)\n\n  cdef WeightClass Times(const WeightClass &, const WeightClass &)\n\n  cdef WeightClass Divide(const WeightClass &, const WeightClass &)\n\n  cdef WeightClass Power(const WeightClass &, size_t)\n\n  # Arcs.\n  cdef cppclass ArcClass:\n\n    ArcClass(const ArcClass &)\n\n    ArcClass(int64, int64, const WeightClass &, int64)\n\n    int64 ilabel\n    int64 olabel\n    WeightClass weight\n    int64 nextstate\n\n\n  # FSTs.\n\n\n  cdef cppclass FstClass:\n\n    FstClass(const FstClass &)\n\n    @staticmethod\n    FstClass *Read(const string &)\n\n    # Aliased for overload.\n    @staticmethod\n    FstClass *ReadFromStream \"Read\"(istream &, const string &)\n\n    int64 Start()\n\n    WeightClass Final(int64)\n\n    size_t NumArcs(int64)\n\n    size_t NumInputEpsilons(int64)\n\n    size_t NumOutputEpsilons(int64)\n\n    const string &ArcType()\n\n    const string &FstType()\n\n    const SymbolTable *InputSymbols()\n\n    const SymbolTable *OutputSymbols()\n\n    const string &WeightType()\n\n    bool Write(const string &)\n\n    bool Write(ostream &, const string &)\n\n    uint64 Properties(uint64, bool)\n\n    bool ValidStateId(int64)\n\n\n  cdef cppclass MutableFstClass(FstClass):\n\n    bool AddArc(int64, const ArcClass &)\n\n    int64 AddState()\n\n    bool DeleteArcs(int64, size_t)\n\n    bool DeleteArcs(int64)\n\n    bool DeleteStates(const vector[int64] &)\n\n    void DeleteStates()\n\n    SymbolTable *MutableInputSymbols()\n\n    SymbolTable *MutableOutputSymbols()\n\n    int64 NumStates()\n\n    bool ReserveArcs(int64, size_t)\n\n    void ReserveStates(int64)\n\n    bool SetStart(int64)\n\n    bool SetFinal(int64, const WeightClass &)\n\n    void SetInputSymbols(SymbolTable *)\n\n    void SetOutputSymbols(SymbolTable *)\n\n    void SetProperties(uint64, uint64)\n\n  cdef cppclass VectorFstClass(MutableFstClass):\n\n   VectorFstClass(const FstClass &)\n\n   VectorFstClass(const string &)\n\n\n  # EncodeMapper.\n  cdef cppclass EncodeMapperClass:\n\n    EncodeMapperClass(const string &, uint32, EncodeType)\n\n    # Aliased to __call__ as Cython doesn't have good support for operator().\n    ArcClass __call__ \"operator()\"(const ArcClass &)\n\n    const string &ArcType()\n\n    uint32 Flags()\n\n    uint64 Properties(uint64)\n\n    EncodeType Type()\n\n    const SymbolTable *InputSymbols()\n\n    const SymbolTable *OutputSymbols()\n\n    void SetInputSymbols(const SymbolTable *)\n\n    void SetOutputSymbols(const SymbolTable *)\n\n    const string &WeightType()\n\n\n  # Iterators.\n\n\n  cdef cppclass ArcIteratorClass:\n\n    ArcIteratorClass(const FstClass &, int64)\n\n    bool Done()\n\n    ArcClass Value()\n\n    void Next()\n\n    void Reset()\n\n    void Seek(size_t)\n\n    size_t Position()\n\n    uint32 Flags()\n\n    void SetFlags(uint32, uint32)\n\n  cdef cppclass MutableArcIteratorClass:\n\n    MutableArcIteratorClass(MutableFstClass *, int64)\n\n    bool Done()\n\n    ArcClass Value()\n\n    void Next()\n\n    void Reset()\n\n    void Seek(size_t)\n\n    void SetValue(const ArcClass &)\n\n    size_t Position()\n\n    uint32 Flags()\n\n    void SetFlags(uint32, uint32)\n\n  cdef cppclass StateIteratorClass:\n\n    StateIteratorClass(const FstClass &)\n\n    bool Done()\n\n    int64 Value()\n\n    void Next()\n\n    void Reset()\n\n\nctypedef pair[int64, const FstClass *] LabelFstClassPair\n\nctypedef pair[int64, int64] LabelPair\n\n\ncdef extern from \"<fst/script/fstscript.h>\" namespace \"fst::script\" nogil:\n\n  enum ArcFilterType:\n    ANY_ARC_FILTER\n    EPSILON_ARC_FILTER\n    INPUT_EPSILON_ARC_FILTER\n    OUTPUT_EPSILON_ARC_FILTER\n\n  enum ArcSortType:\n    ILABEL_SORT\n    OLABEL_SORT\n\n  cdef void ArcSort(MutableFstClass *, ArcSortType)\n\n  cdef ClosureType GetClosureType(bool)\n\n  cdef void Closure(MutableFstClass *, ClosureType)\n\n  cdef FstClass *CompileFstInternal(istream &, const string &,\n                                    const string &, const string &,\n                                    const SymbolTable *, const SymbolTable *,\n                                    const SymbolTable*, bool, bool, bool, bool,\n                                    bool)\n\n  cdef void Compose(FstClass &, FstClass &, MutableFstClass *,\n                    const ComposeOptions &)\n\n  cdef void Concat(MutableFstClass *, const FstClass &)\n\n  cdef void Connect(MutableFstClass *)\n\n  cdef FstClass *Convert(const FstClass &, const string &)\n\n  cdef void Decode(MutableFstClass *, const EncodeMapperClass &)\n\n  cdef cppclass DeterminizeOptions:\n\n    DeterminizeOptions(float, const WeightClass &, int64, int64,\n                       DeterminizeType, bool)\n\n  cdef void Determinize(const FstClass &, MutableFstClass *,\n                        const DeterminizeOptions &)\n\n  cdef cppclass DisambiguateOptions:\n\n    DisambiguateOptions(float, const WeightClass &, int64, int64)\n\n  cdef void Disambiguate(const FstClass &, MutableFstClass *,\n                         const DisambiguateOptions &)\n\n  cdef void Difference(const FstClass &, const FstClass &, MutableFstClass *,\n                       const ComposeOptions &)\n\n  cdef void DrawFst(const FstClass &fst, const SymbolTable *,\n                    const SymbolTable *, const SymbolTable *, bool,\n                    const string &, float, float, bool, bool, float, float, int,\n                    int, const string &, bool, ostream *, const string &)\n\n  cdef void Encode(MutableFstClass *, EncodeMapperClass *)\n\n  cdef EpsNormalizeType GetEpsNormalizeType(bool)\n\n  cdef void EpsNormalize(const FstClass &, MutableFstClass *, EpsNormalizeType)\n\n  cdef bool Equal(const FstClass &, const FstClass &, float)\n\n  cdef bool Equivalent(const FstClass &, const FstClass &, float)\n\n  cdef void Intersect(const FstClass &, const FstClass &, MutableFstClass *,\n                      const ComposeOptions &)\n\n  cdef void Invert(MutableFstClass *fst)\n\n  cdef bool Isomorphic(const FstClass &, const FstClass &, float)\n\n  enum MapType:\n    ARC_SUM_MAPPER\n    IDENTITY_MAPPER\n    INPUT_EPSILON_MAPPER\n    INVERT_MAPPER\n    OUTPUT_EPSILON_MAPPER\n    PLUS_MAPPER\n    QUANTIZE_MAPPER\n    RMWEIGHT_MAPPER\n    SUPERFINAL_MAPPER\n    TIMES_MAPPER\n    TO_LOG_MAPPER\n    TO_LOG64_MAPPER\n    TO_STD_MAPPER\n\n  cdef FstClass *Map(const FstClass &, MapType, float, double,\n                     const WeightClass &)\n\n  cdef void Minimize(MutableFstClass *, MutableFstClass *, float, bool)\n\n  cdef ProjectType GetProjectType(bool)\n\n  cdef void Project(MutableFstClass *, ProjectType)\n\n  cdef void PrintFst(const FstClass &, ostream &, const string &,\n                     const SymbolTable *, const SymbolTable *,\n                     const SymbolTable *, bool, bool, const string &)\n\n  cdef void Prune(const FstClass &, MutableFstClass *, const WeightClass &,\n                  int64, float)\n\n  cdef void Prune(MutableFstClass *, const WeightClass &, int64, float)\n\n  cdef void Push(const FstClass &, MutableFstClass *, uint32 flags,\n                 ReweightType, float)\n\n  cdef void Push(MutableFstClass *, ReweightType, float, bool)\n\n  enum RandArcSelection:\n    UNIFORM_ARC_SELECTOR\n    LOG_PROB_ARC_SELECTOR\n    FAST_LOG_PROB_ARC_SELECTOR\n\n  cdef bool RandEquivalent(const FstClass &, const FstClass &, int32, float,\n                           time_t, const RandGenOptions[RandArcSelection] &)\n\n  cdef void RandGen(const FstClass &, MutableFstClass *, time_t,\n                    const RandGenOptions[RandArcSelection] &)\n\n  cdef void Relabel(MutableFstClass *, const SymbolTable *,\n                    const SymbolTable *, const string &, bool,\n                    const SymbolTable *, const SymbolTable *, const string &,\n                    bool)\n\n  cdef void Relabel(MutableFstClass *, const vector[LabelPair] &,\n                    const vector[LabelPair] &)\n\n  cdef cppclass ReplaceOptions:\n\n     ReplaceOptions(int64, ReplaceLabelType, ReplaceLabelType, int64)\n\n  cdef void Replace(const vector[LabelFstClassPair] &, MutableFstClass *,\n                    const ReplaceOptions &)\n\n  cdef void Reverse(const FstClass &, MutableFstClass *, bool)\n\n  cdef void Reweight(MutableFstClass *, const vector[WeightClass] &,\n                     ReweightType)\n\n  cdef cppclass RmEpsilonOptions:\n\n    RmEpsilonOptions(QueueType, bool, const WeightClass &, int64, float)\n\n  cdef void RmEpsilon(MutableFstClass *, const RmEpsilonOptions &)\n\n  cdef cppclass ShortestDistanceOptions:\n\n    ShortestDistanceOptions(QueueType, ArcFilterType, int64, float)\n\n  cdef void ShortestDistance(const FstClass &, vector[WeightClass] *,\n                             const ShortestDistanceOptions &)\n\n  cdef void ShortestDistance(const FstClass &, vector[WeightClass] *, bool,\n                             float)\n\n  cdef cppclass ShortestPathOptions:\n\n    ShortestPathOptions(QueueType, int32, bool, float, const WeightClass &,\n                        int64)\n\n  cdef void ShortestPath(const FstClass &, MutableFstClass *,\n                         const ShortestPathOptions &)\n\n  cdef void Synchronize(const FstClass &, MutableFstClass *)\n\n  cdef bool TopSort(MutableFstClass *)\n\n  cdef void Union(MutableFstClass *, const FstClass &)\n\n  cdef bool Verify(const FstClass &)\n\n\ncdef extern from \"<fst/script/getters.h>\" namespace \"fst::script\" nogil:\n\n  cdef bool GetArcSortType(const string &, ArcSortType *)\n\n  cdef bool GetComposeFilter(const string &, ComposeFilter *)\n\n  cdef bool GetDeterminizeType(const string &, DeterminizeType *)\n\n  cdef uint32 GetEncodeFlags(bool, bool)\n\n  cdef bool GetMapType(const string &, MapType *)\n\n  cdef uint32 GetPushFlags(bool, bool, bool, bool)\n\n  cdef bool GetQueueType(const string &, QueueType *)\n\n  cdef bool GetRandArcSelection(const string &, RandArcSelection *)\n\n  cdef bool GetReplaceLabelType(string, bool, ReplaceLabelType *)\n\n  cdef ReweightType GetReweightType(bool)\n\n\ncdef extern from \"<fst/extensions/far/far.h>\" namespace \"fst\" nogil:\n\n  enum FarType:\n    FAR_DEFAULT\n    FAR_STTABLE\n    FAR_STLIST\n    FAR_FST\n    FAR_SSTABLE\n\ncdef extern from \"<fst/extensions/far/getters.h>\" \\\n    namespace \"fst\" nogil:\n\n  string GetFarTypeString(FarType)\n\n\ncdef extern from \"<fst/extensions/far/getters.h>\" \\\n    namespace \"fst::script\" nogil:\n\n  FarType GetFarType(const string &)\n\n\ncdef extern from \"<fst/extensions/far/far-class.h>\" \\\n    namespace \"fst::script\" nogil:\n\n  cdef cppclass FarReaderClass:\n\n    const string &ArcType()\n\n    bool Done()\n\n    bool Error()\n\n    bool Find(const string &)\n\n    const FstClass *GetFstClass()\n\n    const string &GetKey()\n\n    void Next()\n\n    void Reset()\n\n    FarType Type()\n\n    # For simplicity, we always use the multiple-file one.\n\n    @staticmethod\n    FarReaderClass *Open(const vector[string] &)\n\n  cdef cppclass FarWriterClass:\n\n    bool Add(const string &, const FstClass &)\n\n    bool Error()\n\n    const string &ArcType()\n\n    FarType Type()\n\n    @staticmethod\n    FarWriterClass *Create(const string &, const string &, FarType)\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/extensions/python/ios.pxd",
    "content": "# See www.openfst.org for extensive documentation on this weighted\n# finite-state transducer library.\n\n\nfrom libcpp.string cimport string\nfrom basictypes cimport int8\nfrom basictypes cimport int16\nfrom basictypes cimport int32\nfrom basictypes cimport int64\nfrom basictypes cimport uint8\nfrom basictypes cimport uint16\nfrom basictypes cimport uint32\nfrom basictypes cimport uint64\n\n\ncdef extern from \"<iostream>\" namespace \"std\" nogil:\n\n  cdef cppclass iostream:\n\n    pass\n\n  cdef cppclass istream(iostream):\n\n    pass\n\n  cdef cppclass ostream(iostream):\n\n    pass\n\n\n# We are ignoring openmodes for the moment.\n\n\ncdef extern from \"<fstream>\" namespace \"std\" nogil:\n\n  cdef cppclass ifstream(istream):\n\n    ifstream(const string &)\n\n  cdef cppclass ofstream(ostream):\n\n    ofstream(const string &)\n\n\ncdef extern from \"<sstream>\" namespace \"std\" nogil:\n\n  cdef cppclass stringstream(istream, ostream):\n\n    stringstream()\n\n    string str()\n\n    stringstream &operator<<(const string &)\n\n    stringstream &operator<<(bool)\n\n    # We define these in terms of the Google basictypes.\n\n    stringstream &operator<<(int8)\n\n    stringstream &operator<<(uint8)\n\n    stringstream &operator<<(int16)\n\n    stringstream &operator<<(uint16)\n\n    stringstream &operator<<(int32)\n\n    stringstream &operator<<(uint32)\n\n    stringstream &operator<<(int64)\n\n    stringstream &operator<<(uint64)\n\n    stringstream &operator<<(double)\n\n    stringstream &operator<<(long double)\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/extensions/python/memory.pxd",
    "content": "# See www.openfst.org for extensive documentation on this weighted\n# finite-state transducer library.\n\n\nfrom libcpp.memory cimport shared_ptr\n\n\n# This is mysteriously missing from libcpp.memory.\n\ncdef extern from \"<memory>\" namespace \"std\" nogil:\n\n  shared_ptr[T] static_pointer_cast[T, U](const shared_ptr[U] &)\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/extensions/python/pywrapfst.cc",
    "content": "/* Generated by Cython 0.27.3 */\n\n#define PY_SSIZE_T_CLEAN\n#include \"Python.h\"\n#ifndef Py_PYTHON_H\n    #error Python headers needed to compile C extensions, please install development version of Python.\n#elif PY_VERSION_HEX < 0x02060000 || (0x03000000 <= PY_VERSION_HEX && PY_VERSION_HEX < 0x03030000)\n    #error Cython requires Python 2.6+ or Python 3.3+.\n#else\n#define CYTHON_ABI \"0_27_3\"\n#define CYTHON_FUTURE_DIVISION 0\n#include <stddef.h>\n#ifndef offsetof\n  #define offsetof(type, member) ( (size_t) & ((type*)0) -> member )\n#endif\n#if !defined(WIN32) && !defined(MS_WINDOWS)\n  #ifndef __stdcall\n    #define __stdcall\n  #endif\n  #ifndef __cdecl\n    #define __cdecl\n  #endif\n  #ifndef __fastcall\n    #define __fastcall\n  #endif\n#endif\n#ifndef DL_IMPORT\n  #define DL_IMPORT(t) t\n#endif\n#ifndef DL_EXPORT\n  #define DL_EXPORT(t) t\n#endif\n#define __PYX_COMMA ,\n#ifndef HAVE_LONG_LONG\n  #if PY_VERSION_HEX >= 0x02070000\n    #define HAVE_LONG_LONG\n  #endif\n#endif\n#ifndef PY_LONG_LONG\n  #define PY_LONG_LONG LONG_LONG\n#endif\n#ifndef Py_HUGE_VAL\n  #define Py_HUGE_VAL HUGE_VAL\n#endif\n#ifdef PYPY_VERSION\n  #define CYTHON_COMPILING_IN_PYPY 1\n  #define CYTHON_COMPILING_IN_PYSTON 0\n  #define CYTHON_COMPILING_IN_CPYTHON 0\n  #undef CYTHON_USE_TYPE_SLOTS\n  #define CYTHON_USE_TYPE_SLOTS 0\n  #undef CYTHON_USE_PYTYPE_LOOKUP\n  #define CYTHON_USE_PYTYPE_LOOKUP 0\n  #if PY_VERSION_HEX < 0x03050000\n    #undef CYTHON_USE_ASYNC_SLOTS\n    #define CYTHON_USE_ASYNC_SLOTS 0\n  #elif !defined(CYTHON_USE_ASYNC_SLOTS)\n    #define CYTHON_USE_ASYNC_SLOTS 1\n  #endif\n  #undef CYTHON_USE_PYLIST_INTERNALS\n  #define CYTHON_USE_PYLIST_INTERNALS 0\n  #undef CYTHON_USE_UNICODE_INTERNALS\n  #define CYTHON_USE_UNICODE_INTERNALS 0\n  #undef CYTHON_USE_UNICODE_WRITER\n  #define CYTHON_USE_UNICODE_WRITER 0\n  #undef CYTHON_USE_PYLONG_INTERNALS\n  #define CYTHON_USE_PYLONG_INTERNALS 0\n  #undef CYTHON_AVOID_BORROWED_REFS\n  #define CYTHON_AVOID_BORROWED_REFS 1\n  #undef CYTHON_ASSUME_SAFE_MACROS\n  #define CYTHON_ASSUME_SAFE_MACROS 0\n  #undef CYTHON_UNPACK_METHODS\n  #define CYTHON_UNPACK_METHODS 0\n  #undef CYTHON_FAST_THREAD_STATE\n  #define CYTHON_FAST_THREAD_STATE 0\n  #undef CYTHON_FAST_PYCALL\n  #define CYTHON_FAST_PYCALL 0\n  #undef CYTHON_PEP489_MULTI_PHASE_INIT\n  #define CYTHON_PEP489_MULTI_PHASE_INIT 0\n  #undef CYTHON_USE_TP_FINALIZE\n  #define CYTHON_USE_TP_FINALIZE 0\n#elif defined(PYSTON_VERSION)\n  #define CYTHON_COMPILING_IN_PYPY 0\n  #define CYTHON_COMPILING_IN_PYSTON 1\n  #define CYTHON_COMPILING_IN_CPYTHON 0\n  #ifndef CYTHON_USE_TYPE_SLOTS\n    #define CYTHON_USE_TYPE_SLOTS 1\n  #endif\n  #undef CYTHON_USE_PYTYPE_LOOKUP\n  #define CYTHON_USE_PYTYPE_LOOKUP 0\n  #undef CYTHON_USE_ASYNC_SLOTS\n  #define CYTHON_USE_ASYNC_SLOTS 0\n  #undef CYTHON_USE_PYLIST_INTERNALS\n  #define CYTHON_USE_PYLIST_INTERNALS 0\n  #ifndef CYTHON_USE_UNICODE_INTERNALS\n    #define CYTHON_USE_UNICODE_INTERNALS 1\n  #endif\n  #undef CYTHON_USE_UNICODE_WRITER\n  #define CYTHON_USE_UNICODE_WRITER 0\n  #undef CYTHON_USE_PYLONG_INTERNALS\n  #define CYTHON_USE_PYLONG_INTERNALS 0\n  #ifndef CYTHON_AVOID_BORROWED_REFS\n    #define CYTHON_AVOID_BORROWED_REFS 0\n  #endif\n  #ifndef CYTHON_ASSUME_SAFE_MACROS\n    #define CYTHON_ASSUME_SAFE_MACROS 1\n  #endif\n  #ifndef CYTHON_UNPACK_METHODS\n    #define CYTHON_UNPACK_METHODS 1\n  #endif\n  #undef CYTHON_FAST_THREAD_STATE\n  #define CYTHON_FAST_THREAD_STATE 0\n  #undef CYTHON_FAST_PYCALL\n  #define CYTHON_FAST_PYCALL 0\n  #undef CYTHON_PEP489_MULTI_PHASE_INIT\n  #define CYTHON_PEP489_MULTI_PHASE_INIT 0\n  #undef CYTHON_USE_TP_FINALIZE\n  #define CYTHON_USE_TP_FINALIZE 0\n#else\n  #define CYTHON_COMPILING_IN_PYPY 0\n  #define CYTHON_COMPILING_IN_PYSTON 0\n  #define CYTHON_COMPILING_IN_CPYTHON 1\n  #ifndef CYTHON_USE_TYPE_SLOTS\n    #define CYTHON_USE_TYPE_SLOTS 1\n  #endif\n  #if PY_VERSION_HEX < 0x02070000\n    #undef CYTHON_USE_PYTYPE_LOOKUP\n    #define CYTHON_USE_PYTYPE_LOOKUP 0\n  #elif !defined(CYTHON_USE_PYTYPE_LOOKUP)\n    #define CYTHON_USE_PYTYPE_LOOKUP 1\n  #endif\n  #if PY_MAJOR_VERSION < 3\n    #undef CYTHON_USE_ASYNC_SLOTS\n    #define CYTHON_USE_ASYNC_SLOTS 0\n  #elif !defined(CYTHON_USE_ASYNC_SLOTS)\n    #define CYTHON_USE_ASYNC_SLOTS 1\n  #endif\n  #if PY_VERSION_HEX < 0x02070000\n    #undef CYTHON_USE_PYLONG_INTERNALS\n    #define CYTHON_USE_PYLONG_INTERNALS 0\n  #elif !defined(CYTHON_USE_PYLONG_INTERNALS)\n    #define CYTHON_USE_PYLONG_INTERNALS 1\n  #endif\n  #ifndef CYTHON_USE_PYLIST_INTERNALS\n    #define CYTHON_USE_PYLIST_INTERNALS 1\n  #endif\n  #ifndef CYTHON_USE_UNICODE_INTERNALS\n    #define CYTHON_USE_UNICODE_INTERNALS 1\n  #endif\n  #if PY_VERSION_HEX < 0x030300F0\n    #undef CYTHON_USE_UNICODE_WRITER\n    #define CYTHON_USE_UNICODE_WRITER 0\n  #elif !defined(CYTHON_USE_UNICODE_WRITER)\n    #define CYTHON_USE_UNICODE_WRITER 1\n  #endif\n  #ifndef CYTHON_AVOID_BORROWED_REFS\n    #define CYTHON_AVOID_BORROWED_REFS 0\n  #endif\n  #ifndef CYTHON_ASSUME_SAFE_MACROS\n    #define CYTHON_ASSUME_SAFE_MACROS 1\n  #endif\n  #ifndef CYTHON_UNPACK_METHODS\n    #define CYTHON_UNPACK_METHODS 1\n  #endif\n  #ifndef CYTHON_FAST_THREAD_STATE\n    #define CYTHON_FAST_THREAD_STATE 1\n  #endif\n  #ifndef CYTHON_FAST_PYCALL\n    #define CYTHON_FAST_PYCALL 1\n  #endif\n  #ifndef CYTHON_PEP489_MULTI_PHASE_INIT\n    #define CYTHON_PEP489_MULTI_PHASE_INIT (0 && PY_VERSION_HEX >= 0x03050000)\n  #endif\n  #ifndef CYTHON_USE_TP_FINALIZE\n    #define CYTHON_USE_TP_FINALIZE (PY_VERSION_HEX >= 0x030400a1)\n  #endif\n#endif\n#if !defined(CYTHON_FAST_PYCCALL)\n#define CYTHON_FAST_PYCCALL  (CYTHON_FAST_PYCALL && PY_VERSION_HEX >= 0x030600B1)\n#endif\n#if CYTHON_USE_PYLONG_INTERNALS\n  #include \"longintrepr.h\"\n  #undef SHIFT\n  #undef BASE\n  #undef MASK\n#endif\n#if CYTHON_COMPILING_IN_PYPY && PY_VERSION_HEX < 0x02070600 && !defined(Py_OptimizeFlag)\n  #define Py_OptimizeFlag 0\n#endif\n#define __PYX_BUILD_PY_SSIZE_T \"n\"\n#define CYTHON_FORMAT_SSIZE_T \"z\"\n#if PY_MAJOR_VERSION < 3\n  #define __Pyx_BUILTIN_MODULE_NAME \"__builtin__\"\n  #define __Pyx_PyCode_New(a, k, l, s, f, code, c, n, v, fv, cell, fn, name, fline, lnos)\\\n          PyCode_New(a+k, l, s, f, code, c, n, v, fv, cell, fn, name, fline, lnos)\n  #define __Pyx_DefaultClassType PyClass_Type\n#else\n  #define __Pyx_BUILTIN_MODULE_NAME \"builtins\"\n  #define __Pyx_PyCode_New(a, k, l, s, f, code, c, n, v, fv, cell, fn, name, fline, lnos)\\\n          PyCode_New(a, k, l, s, f, code, c, n, v, fv, cell, fn, name, fline, lnos)\n  #define __Pyx_DefaultClassType PyType_Type\n#endif\n#ifndef Py_TPFLAGS_CHECKTYPES\n  #define Py_TPFLAGS_CHECKTYPES 0\n#endif\n#ifndef Py_TPFLAGS_HAVE_INDEX\n  #define Py_TPFLAGS_HAVE_INDEX 0\n#endif\n#ifndef Py_TPFLAGS_HAVE_NEWBUFFER\n  #define Py_TPFLAGS_HAVE_NEWBUFFER 0\n#endif\n#ifndef Py_TPFLAGS_HAVE_FINALIZE\n  #define Py_TPFLAGS_HAVE_FINALIZE 0\n#endif\n#if PY_VERSION_HEX < 0x030700A0 || !defined(METH_FASTCALL)\n  #ifndef METH_FASTCALL\n     #define METH_FASTCALL 0x80\n  #endif\n  typedef PyObject *(*__Pyx_PyCFunctionFast) (PyObject *self, PyObject **args, Py_ssize_t nargs);\n  typedef PyObject *(*__Pyx_PyCFunctionFastWithKeywords) (PyObject *self, PyObject **args,\n                                                          Py_ssize_t nargs, PyObject *kwnames);\n#else\n  #define __Pyx_PyCFunctionFast _PyCFunctionFast\n  #define __Pyx_PyCFunctionFastWithKeywords _PyCFunctionFastWithKeywords\n#endif\n#if CYTHON_FAST_PYCCALL\n#define __Pyx_PyFastCFunction_Check(func)\\\n    ((PyCFunction_Check(func) && (METH_FASTCALL == (PyCFunction_GET_FLAGS(func) & ~(METH_CLASS | METH_STATIC | METH_COEXIST | METH_KEYWORDS)))))\n#else\n#define __Pyx_PyFastCFunction_Check(func) 0\n#endif\n#if !CYTHON_FAST_THREAD_STATE || PY_VERSION_HEX < 0x02070000\n  #define __Pyx_PyThreadState_Current PyThreadState_GET()\n#elif PY_VERSION_HEX >= 0x03060000\n  #define __Pyx_PyThreadState_Current _PyThreadState_UncheckedGet()\n#elif PY_VERSION_HEX >= 0x03000000\n  #define __Pyx_PyThreadState_Current PyThreadState_GET()\n#else\n  #define __Pyx_PyThreadState_Current _PyThreadState_Current\n#endif\n#if CYTHON_COMPILING_IN_CPYTHON || defined(_PyDict_NewPresized)\n#define __Pyx_PyDict_NewPresized(n)  ((n <= 8) ? PyDict_New() : _PyDict_NewPresized(n))\n#else\n#define __Pyx_PyDict_NewPresized(n)  PyDict_New()\n#endif\n#if PY_MAJOR_VERSION >= 3 || CYTHON_FUTURE_DIVISION\n  #define __Pyx_PyNumber_Divide(x,y)         PyNumber_TrueDivide(x,y)\n  #define __Pyx_PyNumber_InPlaceDivide(x,y)  PyNumber_InPlaceTrueDivide(x,y)\n#else\n  #define __Pyx_PyNumber_Divide(x,y)         PyNumber_Divide(x,y)\n  #define __Pyx_PyNumber_InPlaceDivide(x,y)  PyNumber_InPlaceDivide(x,y)\n#endif\n#if PY_VERSION_HEX > 0x03030000 && defined(PyUnicode_KIND)\n  #define CYTHON_PEP393_ENABLED 1\n  #define __Pyx_PyUnicode_READY(op)       (likely(PyUnicode_IS_READY(op)) ?\\\n                                              0 : _PyUnicode_Ready((PyObject *)(op)))\n  #define __Pyx_PyUnicode_GET_LENGTH(u)   PyUnicode_GET_LENGTH(u)\n  #define __Pyx_PyUnicode_READ_CHAR(u, i) PyUnicode_READ_CHAR(u, i)\n  #define __Pyx_PyUnicode_MAX_CHAR_VALUE(u)   PyUnicode_MAX_CHAR_VALUE(u)\n  #define __Pyx_PyUnicode_KIND(u)         PyUnicode_KIND(u)\n  #define __Pyx_PyUnicode_DATA(u)         PyUnicode_DATA(u)\n  #define __Pyx_PyUnicode_READ(k, d, i)   PyUnicode_READ(k, d, i)\n  #define __Pyx_PyUnicode_WRITE(k, d, i, ch)  PyUnicode_WRITE(k, d, i, ch)\n  #define __Pyx_PyUnicode_IS_TRUE(u)      (0 != (likely(PyUnicode_IS_READY(u)) ? PyUnicode_GET_LENGTH(u) : PyUnicode_GET_SIZE(u)))\n#else\n  #define CYTHON_PEP393_ENABLED 0\n  #define PyUnicode_1BYTE_KIND  1\n  #define PyUnicode_2BYTE_KIND  2\n  #define PyUnicode_4BYTE_KIND  4\n  #define __Pyx_PyUnicode_READY(op)       (0)\n  #define __Pyx_PyUnicode_GET_LENGTH(u)   PyUnicode_GET_SIZE(u)\n  #define __Pyx_PyUnicode_READ_CHAR(u, i) ((Py_UCS4)(PyUnicode_AS_UNICODE(u)[i]))\n  #define __Pyx_PyUnicode_MAX_CHAR_VALUE(u)   ((sizeof(Py_UNICODE) == 2) ? 65535 : 1114111)\n  #define __Pyx_PyUnicode_KIND(u)         (sizeof(Py_UNICODE))\n  #define __Pyx_PyUnicode_DATA(u)         ((void*)PyUnicode_AS_UNICODE(u))\n  #define __Pyx_PyUnicode_READ(k, d, i)   ((void)(k), (Py_UCS4)(((Py_UNICODE*)d)[i]))\n  #define __Pyx_PyUnicode_WRITE(k, d, i, ch)  (((void)(k)), ((Py_UNICODE*)d)[i] = ch)\n  #define __Pyx_PyUnicode_IS_TRUE(u)      (0 != PyUnicode_GET_SIZE(u))\n#endif\n#if CYTHON_COMPILING_IN_PYPY\n  #define __Pyx_PyUnicode_Concat(a, b)      PyNumber_Add(a, b)\n  #define __Pyx_PyUnicode_ConcatSafe(a, b)  PyNumber_Add(a, b)\n#else\n  #define __Pyx_PyUnicode_Concat(a, b)      PyUnicode_Concat(a, b)\n  #define __Pyx_PyUnicode_ConcatSafe(a, b)  ((unlikely((a) == Py_None) || unlikely((b) == Py_None)) ?\\\n      PyNumber_Add(a, b) : __Pyx_PyUnicode_Concat(a, b))\n#endif\n#if CYTHON_COMPILING_IN_PYPY && !defined(PyUnicode_Contains)\n  #define PyUnicode_Contains(u, s)  PySequence_Contains(u, s)\n#endif\n#if CYTHON_COMPILING_IN_PYPY && !defined(PyByteArray_Check)\n  #define PyByteArray_Check(obj)  PyObject_TypeCheck(obj, &PyByteArray_Type)\n#endif\n#if CYTHON_COMPILING_IN_PYPY && !defined(PyObject_Format)\n  #define PyObject_Format(obj, fmt)  PyObject_CallMethod(obj, \"__format__\", \"O\", fmt)\n#endif\n#if CYTHON_COMPILING_IN_PYPY && !defined(PyObject_Malloc)\n  #define PyObject_Malloc(s)   PyMem_Malloc(s)\n  #define PyObject_Free(p)     PyMem_Free(p)\n  #define PyObject_Realloc(p)  PyMem_Realloc(p)\n#endif\n#if CYTHON_COMPILING_IN_PYSTON\n  #define __Pyx_PyCode_HasFreeVars(co)  PyCode_HasFreeVars(co)\n  #define __Pyx_PyFrame_SetLineNumber(frame, lineno) PyFrame_SetLineNumber(frame, lineno)\n#else\n  #define __Pyx_PyCode_HasFreeVars(co)  (PyCode_GetNumFree(co) > 0)\n  #define __Pyx_PyFrame_SetLineNumber(frame, lineno)  (frame)->f_lineno = (lineno)\n#endif\n#define __Pyx_PyString_FormatSafe(a, b)   ((unlikely((a) == Py_None)) ? PyNumber_Remainder(a, b) : __Pyx_PyString_Format(a, b))\n#define __Pyx_PyUnicode_FormatSafe(a, b)  ((unlikely((a) == Py_None)) ? PyNumber_Remainder(a, b) : PyUnicode_Format(a, b))\n#if PY_MAJOR_VERSION >= 3\n  #define __Pyx_PyString_Format(a, b)  PyUnicode_Format(a, b)\n#else\n  #define __Pyx_PyString_Format(a, b)  PyString_Format(a, b)\n#endif\n#if PY_MAJOR_VERSION < 3 && !defined(PyObject_ASCII)\n  #define PyObject_ASCII(o)            PyObject_Repr(o)\n#endif\n#if PY_MAJOR_VERSION >= 3\n  #define PyBaseString_Type            PyUnicode_Type\n  #define PyStringObject               PyUnicodeObject\n  #define PyString_Type                PyUnicode_Type\n  #define PyString_Check               PyUnicode_Check\n  #define PyString_CheckExact          PyUnicode_CheckExact\n#endif\n#if PY_MAJOR_VERSION >= 3\n  #define __Pyx_PyBaseString_Check(obj) PyUnicode_Check(obj)\n  #define __Pyx_PyBaseString_CheckExact(obj) PyUnicode_CheckExact(obj)\n#else\n  #define __Pyx_PyBaseString_Check(obj) (PyString_Check(obj) || PyUnicode_Check(obj))\n  #define __Pyx_PyBaseString_CheckExact(obj) (PyString_CheckExact(obj) || PyUnicode_CheckExact(obj))\n#endif\n#ifndef PySet_CheckExact\n  #define PySet_CheckExact(obj)        (Py_TYPE(obj) == &PySet_Type)\n#endif\n#define __Pyx_PyException_Check(obj) __Pyx_TypeCheck(obj, PyExc_Exception)\n#if PY_MAJOR_VERSION >= 3\n  #define PyIntObject                  PyLongObject\n  #define PyInt_Type                   PyLong_Type\n  #define PyInt_Check(op)              PyLong_Check(op)\n  #define PyInt_CheckExact(op)         PyLong_CheckExact(op)\n  #define PyInt_FromString             PyLong_FromString\n  #define PyInt_FromUnicode            PyLong_FromUnicode\n  #define PyInt_FromLong               PyLong_FromLong\n  #define PyInt_FromSize_t             PyLong_FromSize_t\n  #define PyInt_FromSsize_t            PyLong_FromSsize_t\n  #define PyInt_AsLong                 PyLong_AsLong\n  #define PyInt_AS_LONG                PyLong_AS_LONG\n  #define PyInt_AsSsize_t              PyLong_AsSsize_t\n  #define PyInt_AsUnsignedLongMask     PyLong_AsUnsignedLongMask\n  #define PyInt_AsUnsignedLongLongMask PyLong_AsUnsignedLongLongMask\n  #define PyNumber_Int                 PyNumber_Long\n#endif\n#if PY_MAJOR_VERSION >= 3\n  #define PyBoolObject                 PyLongObject\n#endif\n#if PY_MAJOR_VERSION >= 3 && CYTHON_COMPILING_IN_PYPY\n  #ifndef PyUnicode_InternFromString\n    #define PyUnicode_InternFromString(s) PyUnicode_FromString(s)\n  #endif\n#endif\n#if PY_VERSION_HEX < 0x030200A4\n  typedef long Py_hash_t;\n  #define __Pyx_PyInt_FromHash_t PyInt_FromLong\n  #define __Pyx_PyInt_AsHash_t   PyInt_AsLong\n#else\n  #define __Pyx_PyInt_FromHash_t PyInt_FromSsize_t\n  #define __Pyx_PyInt_AsHash_t   PyInt_AsSsize_t\n#endif\n#if PY_MAJOR_VERSION >= 3\n  #define __Pyx_PyMethod_New(func, self, klass) ((self) ? PyMethod_New(func, self) : PyInstanceMethod_New(func))\n#else\n  #define __Pyx_PyMethod_New(func, self, klass) PyMethod_New(func, self, klass)\n#endif\n#ifndef __has_attribute\n  #define __has_attribute(x) 0\n#endif\n#ifndef __has_cpp_attribute\n  #define __has_cpp_attribute(x) 0\n#endif\n#if CYTHON_USE_ASYNC_SLOTS\n  #if PY_VERSION_HEX >= 0x030500B1\n    #define __Pyx_PyAsyncMethodsStruct PyAsyncMethods\n    #define __Pyx_PyType_AsAsync(obj) (Py_TYPE(obj)->tp_as_async)\n  #else\n    #define __Pyx_PyType_AsAsync(obj) ((__Pyx_PyAsyncMethodsStruct*) (Py_TYPE(obj)->tp_reserved))\n  #endif\n#else\n  #define __Pyx_PyType_AsAsync(obj) NULL\n#endif\n#ifndef __Pyx_PyAsyncMethodsStruct\n    typedef struct {\n        unaryfunc am_await;\n        unaryfunc am_aiter;\n        unaryfunc am_anext;\n    } __Pyx_PyAsyncMethodsStruct;\n#endif\n#ifndef CYTHON_RESTRICT\n  #if defined(__GNUC__)\n    #define CYTHON_RESTRICT __restrict__\n  #elif defined(_MSC_VER) && _MSC_VER >= 1400\n    #define CYTHON_RESTRICT __restrict\n  #elif defined (__STDC_VERSION__) && __STDC_VERSION__ >= 199901L\n    #define CYTHON_RESTRICT restrict\n  #else\n    #define CYTHON_RESTRICT\n  #endif\n#endif\n#ifndef CYTHON_UNUSED\n# if defined(__GNUC__)\n#   if !(defined(__cplusplus)) || (__GNUC__ > 3 || (__GNUC__ == 3 && __GNUC_MINOR__ >= 4))\n#     define CYTHON_UNUSED __attribute__ ((__unused__))\n#   else\n#     define CYTHON_UNUSED\n#   endif\n# elif defined(__ICC) || (defined(__INTEL_COMPILER) && !defined(_MSC_VER))\n#   define CYTHON_UNUSED __attribute__ ((__unused__))\n# else\n#   define CYTHON_UNUSED\n# endif\n#endif\n#ifndef CYTHON_MAYBE_UNUSED_VAR\n#  if defined(__cplusplus)\n     template<class T> void CYTHON_MAYBE_UNUSED_VAR( const T& ) { }\n#  else\n#    define CYTHON_MAYBE_UNUSED_VAR(x) (void)(x)\n#  endif\n#endif\n#ifndef CYTHON_NCP_UNUSED\n# if CYTHON_COMPILING_IN_CPYTHON\n#  define CYTHON_NCP_UNUSED\n# else\n#  define CYTHON_NCP_UNUSED CYTHON_UNUSED\n# endif\n#endif\n#define __Pyx_void_to_None(void_result) ((void)(void_result), Py_INCREF(Py_None), Py_None)\n#ifdef _MSC_VER\n    #ifndef _MSC_STDINT_H_\n        #if _MSC_VER < 1300\n           typedef unsigned char     uint8_t;\n           typedef unsigned int      uint32_t;\n        #else\n           typedef unsigned __int8   uint8_t;\n           typedef unsigned __int32  uint32_t;\n        #endif\n    #endif\n#else\n   #include <stdint.h>\n#endif\n#ifndef CYTHON_FALLTHROUGH\n  #if defined(__cplusplus) && __cplusplus >= 201103L\n    #if __has_cpp_attribute(fallthrough)\n      #define CYTHON_FALLTHROUGH [[fallthrough]]\n    #elif __has_cpp_attribute(clang::fallthrough)\n      #define CYTHON_FALLTHROUGH [[clang::fallthrough]]\n    #elif __has_cpp_attribute(gnu::fallthrough)\n      #define CYTHON_FALLTHROUGH [[gnu::fallthrough]]\n    #endif\n  #endif\n  #ifndef CYTHON_FALLTHROUGH\n    #if __has_attribute(fallthrough)\n      #define CYTHON_FALLTHROUGH __attribute__((fallthrough))\n    #else\n      #define CYTHON_FALLTHROUGH\n    #endif\n  #endif\n  #if defined(__clang__ ) && defined(__apple_build_version__)\n    #if __apple_build_version__ < 7000000\n      #undef  CYTHON_FALLTHROUGH\n      #define CYTHON_FALLTHROUGH\n    #endif\n  #endif\n#endif\n\n#ifndef __cplusplus\n  #error \"Cython files generated with the C++ option must be compiled with a C++ compiler.\"\n#endif\n#ifndef CYTHON_INLINE\n  #if defined(__clang__)\n    #define CYTHON_INLINE __inline__ __attribute__ ((__unused__))\n  #else\n    #define CYTHON_INLINE inline\n  #endif\n#endif\ntemplate<typename T>\nvoid __Pyx_call_destructor(T& x) {\n    x.~T();\n}\ntemplate<typename T>\nclass __Pyx_FakeReference {\n  public:\n    __Pyx_FakeReference() : ptr(NULL) { }\n    __Pyx_FakeReference(const T& ref) : ptr(const_cast<T*>(&ref)) { }\n    T *operator->() { return ptr; }\n    T *operator&() { return ptr; }\n    operator T&() { return *ptr; }\n    template<typename U> bool operator ==(U other) { return *ptr == other; }\n    template<typename U> bool operator !=(U other) { return *ptr != other; }\n  private:\n    T *ptr;\n};\n\n#if defined(WIN32) || defined(MS_WINDOWS)\n  #define _USE_MATH_DEFINES\n#endif\n#include <math.h>\n#ifdef NAN\n#define __PYX_NAN() ((float) NAN)\n#else\nstatic CYTHON_INLINE float __PYX_NAN() {\n  float value;\n  memset(&value, 0xFF, sizeof(value));\n  return value;\n}\n#endif\n#if defined(__CYGWIN__) && defined(_LDBL_EQ_DBL)\n#define __Pyx_truncl trunc\n#else\n#define __Pyx_truncl truncl\n#endif\n\n\n#define __PYX_ERR(f_index, lineno, Ln_error) \\\n{ \\\n  __pyx_filename = __pyx_f[f_index]; __pyx_lineno = lineno; __pyx_clineno = __LINE__; goto Ln_error; \\\n}\n\n#ifndef __PYX_EXTERN_C\n  #ifdef __cplusplus\n    #define __PYX_EXTERN_C extern \"C\"\n  #else\n    #define __PYX_EXTERN_C extern\n  #endif\n#endif\n\n#define __PYX_HAVE__pywrapfst\n#define __PYX_HAVE_API__pywrapfst\n#include <stddef.h>\n#include <time.h>\n#include <memory>\n#include \"ios\"\n#include \"new\"\n#include \"stdexcept\"\n#include \"typeinfo\"\n#include <utility>\n#include <vector>\n#include <string.h>\n#include <string>\n#include <stdint.h>\n#include <iostream>\n#include <fstream>\n#include <sstream>\n#include <fst/util.h>\n#include <fst/fstlib.h>\n#include <fst/script/fstscript.h>\n#include <fst/script/getters.h>\n#include <fst/extensions/far/far.h>\n#include <fst/extensions/far/getters.h>\n#include <fst/extensions/far/far-class.h>\n#include <sys/types.h>\n#include <unistd.h>\n#ifdef _OPENMP\n#include <omp.h>\n#endif /* _OPENMP */\n\n#if defined(PYREX_WITHOUT_ASSERTIONS) && !defined(CYTHON_WITHOUT_ASSERTIONS)\n#define CYTHON_WITHOUT_ASSERTIONS\n#endif\n\ntypedef struct {PyObject **p; const char *s; const Py_ssize_t n; const char* encoding;\n                const char is_unicode; const char is_str; const char intern; } __Pyx_StringTabEntry;\n\n#define __PYX_DEFAULT_STRING_ENCODING_IS_ASCII 0\n#define __PYX_DEFAULT_STRING_ENCODING_IS_DEFAULT 0\n#define __PYX_DEFAULT_STRING_ENCODING \"\"\n#define __Pyx_PyObject_FromString __Pyx_PyBytes_FromString\n#define __Pyx_PyObject_FromStringAndSize __Pyx_PyBytes_FromStringAndSize\n#define __Pyx_uchar_cast(c) ((unsigned char)c)\n#define __Pyx_long_cast(x) ((long)x)\n#define __Pyx_fits_Py_ssize_t(v, type, is_signed)  (\\\n    (sizeof(type) < sizeof(Py_ssize_t))  ||\\\n    (sizeof(type) > sizeof(Py_ssize_t) &&\\\n          likely(v < (type)PY_SSIZE_T_MAX ||\\\n                 v == (type)PY_SSIZE_T_MAX)  &&\\\n          (!is_signed || likely(v > (type)PY_SSIZE_T_MIN ||\\\n                                v == (type)PY_SSIZE_T_MIN)))  ||\\\n    (sizeof(type) == sizeof(Py_ssize_t) &&\\\n          (is_signed || likely(v < (type)PY_SSIZE_T_MAX ||\\\n                               v == (type)PY_SSIZE_T_MAX)))  )\n#if defined (__cplusplus) && __cplusplus >= 201103L\n    #include <cstdlib>\n    #define __Pyx_sst_abs(value) std::abs(value)\n#elif SIZEOF_INT >= SIZEOF_SIZE_T\n    #define __Pyx_sst_abs(value) abs(value)\n#elif SIZEOF_LONG >= SIZEOF_SIZE_T\n    #define __Pyx_sst_abs(value) labs(value)\n#elif defined (_MSC_VER)\n    #define __Pyx_sst_abs(value) ((Py_ssize_t)_abs64(value))\n#elif defined (__STDC_VERSION__) && __STDC_VERSION__ >= 199901L\n    #define __Pyx_sst_abs(value) llabs(value)\n#elif defined (__GNUC__)\n    #define __Pyx_sst_abs(value) __builtin_llabs(value)\n#else\n    #define __Pyx_sst_abs(value) ((value<0) ? -value : value)\n#endif\nstatic CYTHON_INLINE const char* __Pyx_PyObject_AsString(PyObject*);\nstatic CYTHON_INLINE const char* __Pyx_PyObject_AsStringAndSize(PyObject*, Py_ssize_t* length);\n#define __Pyx_PyByteArray_FromString(s) PyByteArray_FromStringAndSize((const char*)s, strlen((const char*)s))\n#define __Pyx_PyByteArray_FromStringAndSize(s, l) PyByteArray_FromStringAndSize((const char*)s, l)\n#define __Pyx_PyBytes_FromString        PyBytes_FromString\n#define __Pyx_PyBytes_FromStringAndSize PyBytes_FromStringAndSize\nstatic CYTHON_INLINE PyObject* __Pyx_PyUnicode_FromString(const char*);\n#if PY_MAJOR_VERSION < 3\n    #define __Pyx_PyStr_FromString        __Pyx_PyBytes_FromString\n    #define __Pyx_PyStr_FromStringAndSize __Pyx_PyBytes_FromStringAndSize\n#else\n    #define __Pyx_PyStr_FromString        __Pyx_PyUnicode_FromString\n    #define __Pyx_PyStr_FromStringAndSize __Pyx_PyUnicode_FromStringAndSize\n#endif\n#define __Pyx_PyBytes_AsWritableString(s)     ((char*) PyBytes_AS_STRING(s))\n#define __Pyx_PyBytes_AsWritableSString(s)    ((signed char*) PyBytes_AS_STRING(s))\n#define __Pyx_PyBytes_AsWritableUString(s)    ((unsigned char*) PyBytes_AS_STRING(s))\n#define __Pyx_PyBytes_AsString(s)     ((const char*) PyBytes_AS_STRING(s))\n#define __Pyx_PyBytes_AsSString(s)    ((const signed char*) PyBytes_AS_STRING(s))\n#define __Pyx_PyBytes_AsUString(s)    ((const unsigned char*) PyBytes_AS_STRING(s))\n#define __Pyx_PyObject_AsWritableString(s)    ((char*) __Pyx_PyObject_AsString(s))\n#define __Pyx_PyObject_AsWritableSString(s)    ((signed char*) __Pyx_PyObject_AsString(s))\n#define __Pyx_PyObject_AsWritableUString(s)    ((unsigned char*) __Pyx_PyObject_AsString(s))\n#define __Pyx_PyObject_AsSString(s)    ((const signed char*) __Pyx_PyObject_AsString(s))\n#define __Pyx_PyObject_AsUString(s)    ((const unsigned char*) __Pyx_PyObject_AsString(s))\n#define __Pyx_PyObject_FromCString(s)  __Pyx_PyObject_FromString((const char*)s)\n#define __Pyx_PyBytes_FromCString(s)   __Pyx_PyBytes_FromString((const char*)s)\n#define __Pyx_PyByteArray_FromCString(s)   __Pyx_PyByteArray_FromString((const char*)s)\n#define __Pyx_PyStr_FromCString(s)     __Pyx_PyStr_FromString((const char*)s)\n#define __Pyx_PyUnicode_FromCString(s) __Pyx_PyUnicode_FromString((const char*)s)\nstatic CYTHON_INLINE size_t __Pyx_Py_UNICODE_strlen(const Py_UNICODE *u) {\n    const Py_UNICODE *u_end = u;\n    while (*u_end++) ;\n    return (size_t)(u_end - u - 1);\n}\n#define __Pyx_PyUnicode_FromUnicode(u)       PyUnicode_FromUnicode(u, __Pyx_Py_UNICODE_strlen(u))\n#define __Pyx_PyUnicode_FromUnicodeAndLength PyUnicode_FromUnicode\n#define __Pyx_PyUnicode_AsUnicode            PyUnicode_AsUnicode\n#define __Pyx_NewRef(obj) (Py_INCREF(obj), obj)\n#define __Pyx_Owned_Py_None(b) __Pyx_NewRef(Py_None)\n#define __Pyx_PyBool_FromLong(b) ((b) ? __Pyx_NewRef(Py_True) : __Pyx_NewRef(Py_False))\nstatic CYTHON_INLINE int __Pyx_PyObject_IsTrue(PyObject*);\nstatic CYTHON_INLINE PyObject* __Pyx_PyNumber_IntOrLong(PyObject* x);\n#define __Pyx_PySequence_Tuple(obj)\\\n    (likely(PyTuple_CheckExact(obj)) ? __Pyx_NewRef(obj) : PySequence_Tuple(obj))\nstatic CYTHON_INLINE Py_ssize_t __Pyx_PyIndex_AsSsize_t(PyObject*);\nstatic CYTHON_INLINE PyObject * __Pyx_PyInt_FromSize_t(size_t);\n#if CYTHON_ASSUME_SAFE_MACROS\n#define __pyx_PyFloat_AsDouble(x) (PyFloat_CheckExact(x) ? PyFloat_AS_DOUBLE(x) : PyFloat_AsDouble(x))\n#else\n#define __pyx_PyFloat_AsDouble(x) PyFloat_AsDouble(x)\n#endif\n#define __pyx_PyFloat_AsFloat(x) ((float) __pyx_PyFloat_AsDouble(x))\n#if PY_MAJOR_VERSION >= 3\n#define __Pyx_PyNumber_Int(x) (PyLong_CheckExact(x) ? __Pyx_NewRef(x) : PyNumber_Long(x))\n#else\n#define __Pyx_PyNumber_Int(x) (PyInt_CheckExact(x) ? __Pyx_NewRef(x) : PyNumber_Int(x))\n#endif\n#define __Pyx_PyNumber_Float(x) (PyFloat_CheckExact(x) ? __Pyx_NewRef(x) : PyNumber_Float(x))\n#if PY_MAJOR_VERSION < 3 && __PYX_DEFAULT_STRING_ENCODING_IS_ASCII\nstatic int __Pyx_sys_getdefaultencoding_not_ascii;\nstatic int __Pyx_init_sys_getdefaultencoding_params(void) {\n    PyObject* sys;\n    PyObject* default_encoding = NULL;\n    PyObject* ascii_chars_u = NULL;\n    PyObject* ascii_chars_b = NULL;\n    const char* default_encoding_c;\n    sys = PyImport_ImportModule(\"sys\");\n    if (!sys) goto bad;\n    default_encoding = PyObject_CallMethod(sys, (char*) \"getdefaultencoding\", NULL);\n    Py_DECREF(sys);\n    if (!default_encoding) goto bad;\n    default_encoding_c = PyBytes_AsString(default_encoding);\n    if (!default_encoding_c) goto bad;\n    if (strcmp(default_encoding_c, \"ascii\") == 0) {\n        __Pyx_sys_getdefaultencoding_not_ascii = 0;\n    } else {\n        char ascii_chars[128];\n        int c;\n        for (c = 0; c < 128; c++) {\n            ascii_chars[c] = c;\n        }\n        __Pyx_sys_getdefaultencoding_not_ascii = 1;\n        ascii_chars_u = PyUnicode_DecodeASCII(ascii_chars, 128, NULL);\n        if (!ascii_chars_u) goto bad;\n        ascii_chars_b = PyUnicode_AsEncodedString(ascii_chars_u, default_encoding_c, NULL);\n        if (!ascii_chars_b || !PyBytes_Check(ascii_chars_b) || memcmp(ascii_chars, PyBytes_AS_STRING(ascii_chars_b), 128) != 0) {\n            PyErr_Format(\n                PyExc_ValueError,\n                \"This module compiled with c_string_encoding=ascii, but default encoding '%.200s' is not a superset of ascii.\",\n                default_encoding_c);\n            goto bad;\n        }\n        Py_DECREF(ascii_chars_u);\n        Py_DECREF(ascii_chars_b);\n    }\n    Py_DECREF(default_encoding);\n    return 0;\nbad:\n    Py_XDECREF(default_encoding);\n    Py_XDECREF(ascii_chars_u);\n    Py_XDECREF(ascii_chars_b);\n    return -1;\n}\n#endif\n#if __PYX_DEFAULT_STRING_ENCODING_IS_DEFAULT && PY_MAJOR_VERSION >= 3\n#define __Pyx_PyUnicode_FromStringAndSize(c_str, size) PyUnicode_DecodeUTF8(c_str, size, NULL)\n#else\n#define __Pyx_PyUnicode_FromStringAndSize(c_str, size) PyUnicode_Decode(c_str, size, __PYX_DEFAULT_STRING_ENCODING, NULL)\n#if __PYX_DEFAULT_STRING_ENCODING_IS_DEFAULT\nstatic char* __PYX_DEFAULT_STRING_ENCODING;\nstatic int __Pyx_init_sys_getdefaultencoding_params(void) {\n    PyObject* sys;\n    PyObject* default_encoding = NULL;\n    char* default_encoding_c;\n    sys = PyImport_ImportModule(\"sys\");\n    if (!sys) goto bad;\n    default_encoding = PyObject_CallMethod(sys, (char*) (const char*) \"getdefaultencoding\", NULL);\n    Py_DECREF(sys);\n    if (!default_encoding) goto bad;\n    default_encoding_c = PyBytes_AsString(default_encoding);\n    if (!default_encoding_c) goto bad;\n    __PYX_DEFAULT_STRING_ENCODING = (char*) malloc(strlen(default_encoding_c));\n    if (!__PYX_DEFAULT_STRING_ENCODING) goto bad;\n    strcpy(__PYX_DEFAULT_STRING_ENCODING, default_encoding_c);\n    Py_DECREF(default_encoding);\n    return 0;\nbad:\n    Py_XDECREF(default_encoding);\n    return -1;\n}\n#endif\n#endif\n\n\n/* Test for GCC > 2.95 */\n#if defined(__GNUC__)     && (__GNUC__ > 2 || (__GNUC__ == 2 && (__GNUC_MINOR__ > 95)))\n  #define likely(x)   __builtin_expect(!!(x), 1)\n  #define unlikely(x) __builtin_expect(!!(x), 0)\n#else /* !__GNUC__ or GCC < 2.95 */\n  #define likely(x)   (x)\n  #define unlikely(x) (x)\n#endif /* __GNUC__ */\nstatic CYTHON_INLINE void __Pyx_pretend_to_initialize(void* ptr) { (void)ptr; }\n\nstatic PyObject *__pyx_m = NULL;\nstatic PyObject *__pyx_d;\nstatic PyObject *__pyx_b;\nstatic PyObject *__pyx_cython_runtime;\nstatic PyObject *__pyx_empty_tuple;\nstatic PyObject *__pyx_empty_bytes;\nstatic PyObject *__pyx_empty_unicode;\nstatic int __pyx_lineno;\nstatic int __pyx_clineno = 0;\nstatic const char * __pyx_cfilenm= __FILE__;\nstatic const char *__pyx_filename;\n\n\nstatic const char *__pyx_f[] = {\n  \"pywrapfst.pyx\",\n  \"stringsource\",\n};\n\n/* \"basictypes.pxd\":22\n * \n * \n * ctypedef int8_t int8             # <<<<<<<<<<<<<<\n * ctypedef int16_t int16\n * ctypedef int32_t int32\n */\ntypedef int8_t __pyx_t_10basictypes_int8;\n\n/* \"basictypes.pxd\":23\n * \n * ctypedef int8_t int8\n * ctypedef int16_t int16             # <<<<<<<<<<<<<<\n * ctypedef int32_t int32\n * ctypedef int64_t int64\n */\ntypedef int16_t __pyx_t_10basictypes_int16;\n\n/* \"basictypes.pxd\":24\n * ctypedef int8_t int8\n * ctypedef int16_t int16\n * ctypedef int32_t int32             # <<<<<<<<<<<<<<\n * ctypedef int64_t int64\n * ctypedef uint8_t uint8\n */\ntypedef int32_t __pyx_t_10basictypes_int32;\n\n/* \"basictypes.pxd\":25\n * ctypedef int16_t int16\n * ctypedef int32_t int32\n * ctypedef int64_t int64             # <<<<<<<<<<<<<<\n * ctypedef uint8_t uint8\n * ctypedef uint16_t uint16\n */\ntypedef int64_t __pyx_t_10basictypes_int64;\n\n/* \"basictypes.pxd\":26\n * ctypedef int32_t int32\n * ctypedef int64_t int64\n * ctypedef uint8_t uint8             # <<<<<<<<<<<<<<\n * ctypedef uint16_t uint16\n * ctypedef uint32_t uint32\n */\ntypedef uint8_t __pyx_t_10basictypes_uint8;\n\n/* \"basictypes.pxd\":27\n * ctypedef int64_t int64\n * ctypedef uint8_t uint8\n * ctypedef uint16_t uint16             # <<<<<<<<<<<<<<\n * ctypedef uint32_t uint32\n * ctypedef uint64_t uint64\n */\ntypedef uint16_t __pyx_t_10basictypes_uint16;\n\n/* \"basictypes.pxd\":28\n * ctypedef uint8_t uint8\n * ctypedef uint16_t uint16\n * ctypedef uint32_t uint32             # <<<<<<<<<<<<<<\n * ctypedef uint64_t uint64\n */\ntypedef uint32_t __pyx_t_10basictypes_uint32;\n\n/* \"basictypes.pxd\":29\n * ctypedef uint16_t uint16\n * ctypedef uint32_t uint32\n * ctypedef uint64_t uint64             # <<<<<<<<<<<<<<\n */\ntypedef uint64_t __pyx_t_10basictypes_uint64;\n\n/*--- Type declarations ---*/\nstruct __pyx_obj_9pywrapfst_Weight;\nstruct __pyx_obj_9pywrapfst__SymbolTable;\nstruct __pyx_obj_9pywrapfst__EncodeMapperSymbolTable;\nstruct __pyx_obj_9pywrapfst__FstSymbolTable;\nstruct __pyx_obj_9pywrapfst__MutableSymbolTable;\nstruct __pyx_obj_9pywrapfst__MutableFstSymbolTable;\nstruct __pyx_obj_9pywrapfst_SymbolTable;\nstruct __pyx_obj_9pywrapfst_SymbolTableIterator;\nstruct __pyx_obj_9pywrapfst_EncodeMapper;\nstruct __pyx_obj_9pywrapfst__Fst;\nstruct __pyx_obj_9pywrapfst__MutableFst;\nstruct __pyx_obj_9pywrapfst_Arc;\nstruct __pyx_obj_9pywrapfst_ArcIterator;\nstruct __pyx_obj_9pywrapfst_MutableArcIterator;\nstruct __pyx_obj_9pywrapfst_StateIterator;\nstruct __pyx_obj_9pywrapfst_Compiler;\nstruct __pyx_obj_9pywrapfst_FarReader;\nstruct __pyx_obj_9pywrapfst_FarWriter;\n\n/* \"fst.pxd\":496\n * \n * \n * ctypedef pair[int64, const FstClass *] LabelFstClassPair             # <<<<<<<<<<<<<<\n * \n * ctypedef pair[int64, int64] LabelPair\n */\ntypedef std::pair<__pyx_t_10basictypes_int64,fst::script::FstClass const *>  __pyx_t_3fst_LabelFstClassPair;\n\n/* \"fst.pxd\":498\n * ctypedef pair[int64, const FstClass *] LabelFstClassPair\n * \n * ctypedef pair[int64, int64] LabelPair             # <<<<<<<<<<<<<<\n * \n * \n */\ntypedef std::pair<__pyx_t_10basictypes_int64,__pyx_t_10basictypes_int64>  __pyx_t_3fst_LabelPair;\nstruct __pyx_opt_args_9pywrapfst_tostring;\nstruct __pyx_opt_args_9pywrapfst_weight_tostring;\nstruct __pyx_opt_args_9pywrapfst_19_MutableSymbolTable_add_symbol;\nstruct __pyx_opt_args_9pywrapfst_4_Fst_draw;\nstruct __pyx_opt_args_9pywrapfst_4_Fst_text;\nstruct __pyx_opt_args_9pywrapfst_11_MutableFst__arcsort;\nstruct __pyx_opt_args_9pywrapfst_11_MutableFst__closure;\nstruct __pyx_opt_args_9pywrapfst_11_MutableFst__delete_arcs;\nstruct __pyx_opt_args_9pywrapfst_11_MutableFst__delete_states;\nstruct __pyx_opt_args_9pywrapfst_11_MutableFst__minimize;\nstruct __pyx_opt_args_9pywrapfst_11_MutableFst__project;\nstruct __pyx_opt_args_9pywrapfst_11_MutableFst__prune;\nstruct __pyx_opt_args_9pywrapfst_11_MutableFst__push;\nstruct __pyx_opt_args_9pywrapfst_11_MutableFst__relabel_pairs;\nstruct __pyx_opt_args_9pywrapfst_11_MutableFst__relabel_tables;\nstruct __pyx_opt_args_9pywrapfst_11_MutableFst__reweight;\nstruct __pyx_opt_args_9pywrapfst_11_MutableFst__rmepsilon;\nstruct __pyx_opt_args_9pywrapfst_11_MutableFst__set_final;\nstruct __pyx_opt_args_9pywrapfst__create_Fst;\nstruct __pyx_opt_args_9pywrapfst__map;\nstruct __pyx_opt_args_9pywrapfst_arcmap;\nstruct __pyx_opt_args_9pywrapfst_compose;\nstruct __pyx_opt_args_9pywrapfst_convert;\nstruct __pyx_opt_args_9pywrapfst_determinize;\nstruct __pyx_opt_args_9pywrapfst_difference;\nstruct __pyx_opt_args_9pywrapfst_disambiguate;\nstruct __pyx_opt_args_9pywrapfst_epsnormalize;\nstruct __pyx_opt_args_9pywrapfst_equal;\nstruct __pyx_opt_args_9pywrapfst_equivalent;\nstruct __pyx_opt_args_9pywrapfst_intersect;\nstruct __pyx_opt_args_9pywrapfst_isomorphic;\nstruct __pyx_opt_args_9pywrapfst_prune;\nstruct __pyx_opt_args_9pywrapfst_push;\nstruct __pyx_opt_args_9pywrapfst_randequivalent;\nstruct __pyx_opt_args_9pywrapfst_randgen;\nstruct __pyx_opt_args_9pywrapfst_replace;\nstruct __pyx_opt_args_9pywrapfst_reverse;\nstruct __pyx_opt_args_9pywrapfst__shortestdistance;\nstruct __pyx_opt_args_9pywrapfst_shortestpath;\n\n/* \"pywrapfst.pxd\":41\n * \n * \n * cdef string tostring(data, encoding=?) except *             # <<<<<<<<<<<<<<\n * \n * cdef string weight_tostring(data, encoding=?) except *\n */\nstruct __pyx_opt_args_9pywrapfst_tostring {\n  int __pyx_n;\n  PyObject *encoding;\n};\n\n/* \"pywrapfst.pxd\":43\n * cdef string tostring(data, encoding=?) except *\n * \n * cdef string weight_tostring(data, encoding=?) except *             # <<<<<<<<<<<<<<\n * \n * cdef fst.ComposeFilter _get_compose_filter(\n */\nstruct __pyx_opt_args_9pywrapfst_weight_tostring {\n  int __pyx_n;\n  PyObject *encoding;\n};\n\n/* \"pywrapfst.pxd\":99\n * # SymbolTable.\n * \n * ctypedef fst.SymbolTable * SymbolTable_ptr             # <<<<<<<<<<<<<<\n * \n * \n */\ntypedef fst::SymbolTable *__pyx_t_9pywrapfst_SymbolTable_ptr;\n\n/* \"pywrapfst.pxd\":139\n * cdef class _MutableSymbolTable(_SymbolTable):\n * \n *   cpdef int64 add_symbol(self, symbol, int64 key=?)             # <<<<<<<<<<<<<<\n * \n *   cpdef void add_table(self, _SymbolTable syms)\n */\nstruct __pyx_opt_args_9pywrapfst_19_MutableSymbolTable_add_symbol {\n  int __pyx_n;\n  __pyx_t_10basictypes_int64 key;\n};\n\n/* \"pywrapfst.pxd\":215\n * \n * \n * ctypedef fst.FstClass * FstClass_ptr             # <<<<<<<<<<<<<<\n * ctypedef fst.MutableFstClass * MutableFstClass_ptr\n * ctypedef fst.VectorFstClass * VectorFstClass_ptr\n */\ntypedef fst::script::FstClass *__pyx_t_9pywrapfst_FstClass_ptr;\n\n/* \"pywrapfst.pxd\":216\n * \n * ctypedef fst.FstClass * FstClass_ptr\n * ctypedef fst.MutableFstClass * MutableFstClass_ptr             # <<<<<<<<<<<<<<\n * ctypedef fst.VectorFstClass * VectorFstClass_ptr\n * \n */\ntypedef fst::script::MutableFstClass *__pyx_t_9pywrapfst_MutableFstClass_ptr;\n\n/* \"pywrapfst.pxd\":217\n * ctypedef fst.FstClass * FstClass_ptr\n * ctypedef fst.MutableFstClass * MutableFstClass_ptr\n * ctypedef fst.VectorFstClass * VectorFstClass_ptr             # <<<<<<<<<<<<<<\n * \n * \n */\ntypedef fst::script::VectorFstClass *__pyx_t_9pywrapfst_VectorFstClass_ptr;\n\n/* \"pywrapfst.pxd\":230\n *   cpdef _Fst copy(self)\n * \n *   cpdef void draw(self, filename, _SymbolTable isymbols=?,             # <<<<<<<<<<<<<<\n *                   _SymbolTable osymbols=?, SymbolTable ssymbols=?,\n *                   bool acceptor=?, title=?, double width=?,\n */\nstruct __pyx_opt_args_9pywrapfst_4_Fst_draw {\n  int __pyx_n;\n  struct __pyx_obj_9pywrapfst__SymbolTable *isymbols;\n  struct __pyx_obj_9pywrapfst__SymbolTable *osymbols;\n  struct __pyx_obj_9pywrapfst_SymbolTable *ssymbols;\n  bool acceptor;\n  PyObject *title;\n  double width;\n  double height;\n  bool portrait;\n  bool vertical;\n  double ranksep;\n  double nodesep;\n  __pyx_t_10basictypes_int32 fontsize;\n  __pyx_t_10basictypes_int32 precision;\n  PyObject *float_format;\n  bool show_weight_one;\n};\n\n/* \"pywrapfst.pxd\":258\n *   cpdef StateIterator states(self)\n * \n *   cpdef string text(self, _SymbolTable isymbols=?, _SymbolTable osymbols=?,             # <<<<<<<<<<<<<<\n *                     _SymbolTable ssymbols=?, bool acceptor=?,\n *                     bool show_weight_one=?, missing_sym=?)\n */\nstruct __pyx_opt_args_9pywrapfst_4_Fst_text {\n  int __pyx_n;\n  struct __pyx_obj_9pywrapfst__SymbolTable *isymbols;\n  struct __pyx_obj_9pywrapfst__SymbolTable *osymbols;\n  struct __pyx_obj_9pywrapfst__SymbolTable *ssymbols;\n  bool acceptor;\n  bool show_weight_one;\n  PyObject *missing_sym;\n};\n\n/* \"pywrapfst.pxd\":281\n *   cpdef int64 add_state(self) except *\n * \n *   cdef void _arcsort(self, sort_type=?) except *             # <<<<<<<<<<<<<<\n * \n *   cdef void _closure(self, bool closure_plus=?) except *\n */\nstruct __pyx_opt_args_9pywrapfst_11_MutableFst__arcsort {\n  int __pyx_n;\n  PyObject *sort_type;\n};\n\n/* \"pywrapfst.pxd\":283\n *   cdef void _arcsort(self, sort_type=?) except *\n * \n *   cdef void _closure(self, bool closure_plus=?) except *             # <<<<<<<<<<<<<<\n * \n *   cdef void _concat(self, _Fst ifst) except *\n */\nstruct __pyx_opt_args_9pywrapfst_11_MutableFst__closure {\n  int __pyx_n;\n  bool closure_plus;\n};\n\n/* \"pywrapfst.pxd\":291\n *   cdef void _decode(self, EncodeMapper) except *\n * \n *   cdef void _delete_arcs(self, int64 state, size_t n=?) except *             # <<<<<<<<<<<<<<\n * \n *   cdef void _delete_states(self, states=?) except *\n */\nstruct __pyx_opt_args_9pywrapfst_11_MutableFst__delete_arcs {\n  int __pyx_n;\n  size_t n;\n};\n\n/* \"pywrapfst.pxd\":293\n *   cdef void _delete_arcs(self, int64 state, size_t n=?) except *\n * \n *   cdef void _delete_states(self, states=?) except *             # <<<<<<<<<<<<<<\n * \n *   cdef void _encode(self, EncodeMapper) except *\n */\nstruct __pyx_opt_args_9pywrapfst_11_MutableFst__delete_states {\n  int __pyx_n;\n  PyObject *states;\n};\n\n/* \"pywrapfst.pxd\":299\n *   cdef void _invert(self) except *\n * \n *   cdef void _minimize(self, float delta=?, bool allow_nondet=?) except *             # <<<<<<<<<<<<<<\n * \n *   cpdef MutableArcIterator mutable_arcs(self, int64 state)\n */\nstruct __pyx_opt_args_9pywrapfst_11_MutableFst__minimize {\n  int __pyx_n;\n  float delta;\n  bool allow_nondet;\n};\n\n/* \"pywrapfst.pxd\":305\n *   cpdef int64 num_states(self)\n * \n *   cdef void _project(self, bool project_output=?) except *             # <<<<<<<<<<<<<<\n * \n *   cdef void _prune(self, float delta=?, int64 nstate=?, weight=?) except *\n */\nstruct __pyx_opt_args_9pywrapfst_11_MutableFst__project {\n  int __pyx_n;\n  bool project_output;\n};\n\n/* \"pywrapfst.pxd\":307\n *   cdef void _project(self, bool project_output=?) except *\n * \n *   cdef void _prune(self, float delta=?, int64 nstate=?, weight=?) except *             # <<<<<<<<<<<<<<\n * \n *   cdef void _push(self, float delta=?, bool remove_total_weight=?,\n */\nstruct __pyx_opt_args_9pywrapfst_11_MutableFst__prune {\n  int __pyx_n;\n  float delta;\n  __pyx_t_10basictypes_int64 nstate;\n  PyObject *weight;\n};\n\n/* \"pywrapfst.pxd\":309\n *   cdef void _prune(self, float delta=?, int64 nstate=?, weight=?) except *\n * \n *   cdef void _push(self, float delta=?, bool remove_total_weight=?,             # <<<<<<<<<<<<<<\n *                   bool to_final=?) except *\n * \n */\nstruct __pyx_opt_args_9pywrapfst_11_MutableFst__push {\n  int __pyx_n;\n  float delta;\n  bool remove_total_weight;\n  bool to_final;\n};\n\n/* \"pywrapfst.pxd\":312\n *                   bool to_final=?) except *\n * \n *   cdef void _relabel_pairs(self, ipairs=?, opairs=?) except *             # <<<<<<<<<<<<<<\n * \n *   cdef void _relabel_tables(self, _SymbolTable old_isymbols=?,\n */\nstruct __pyx_opt_args_9pywrapfst_11_MutableFst__relabel_pairs {\n  int __pyx_n;\n  PyObject *ipairs;\n  PyObject *opairs;\n};\n\n/* \"pywrapfst.pxd\":314\n *   cdef void _relabel_pairs(self, ipairs=?, opairs=?) except *\n * \n *   cdef void _relabel_tables(self, _SymbolTable old_isymbols=?,             # <<<<<<<<<<<<<<\n *       _SymbolTable new_isymbols=?, unknown_isymbol=?,\n *       bool attach_new_isymbols=?,\n */\nstruct __pyx_opt_args_9pywrapfst_11_MutableFst__relabel_tables {\n  int __pyx_n;\n  struct __pyx_obj_9pywrapfst__SymbolTable *old_isymbols;\n  struct __pyx_obj_9pywrapfst__SymbolTable *new_isymbols;\n  PyObject *unknown_isymbol;\n  bool attach_new_isymbols;\n  struct __pyx_obj_9pywrapfst__SymbolTable *old_osymbols;\n  struct __pyx_obj_9pywrapfst__SymbolTable *new_osymbols;\n  PyObject *unknown_osymbol;\n  bool attach_new_osymbols;\n};\n\n/* \"pywrapfst.pxd\":324\n *   cdef void _reserve_states(self, int64 n) except *\n * \n *   cdef void _reweight(self, potentials, bool to_final=?) except *             # <<<<<<<<<<<<<<\n * \n *   cdef void _rmepsilon(self, queue_type=?, bool connect=?, weight=?,\n */\nstruct __pyx_opt_args_9pywrapfst_11_MutableFst__reweight {\n  int __pyx_n;\n  bool to_final;\n};\n\n/* \"pywrapfst.pxd\":326\n *   cdef void _reweight(self, potentials, bool to_final=?) except *\n * \n *   cdef void _rmepsilon(self, queue_type=?, bool connect=?, weight=?,             # <<<<<<<<<<<<<<\n *                        int64 nstate=?, float delta=?) except *\n * \n */\nstruct __pyx_opt_args_9pywrapfst_11_MutableFst__rmepsilon {\n  int __pyx_n;\n  PyObject *queue_type;\n  bool connect;\n  PyObject *weight;\n  __pyx_t_10basictypes_int64 nstate;\n  float delta;\n};\n\n/* \"pywrapfst.pxd\":329\n *                        int64 nstate=?, float delta=?) except *\n * \n *   cdef void _set_final(self, int64 state, weight=?) except *             # <<<<<<<<<<<<<<\n * \n *   cdef void _set_properties(self, uint64 props, uint64 mask)\n */\nstruct __pyx_opt_args_9pywrapfst_11_MutableFst__set_final {\n  int __pyx_n;\n  PyObject *weight;\n};\n\n/* \"pywrapfst.pxd\":353\n * cdef _Fst _init_XFst(FstClass_ptr tfst)\n * \n * cdef _MutableFst _create_Fst(arc_type=?)             # <<<<<<<<<<<<<<\n * \n * cpdef _Fst _read(filename)\n */\nstruct __pyx_opt_args_9pywrapfst__create_Fst {\n  int __pyx_n;\n  PyObject *arc_type;\n};\n\n/* \"pywrapfst.pxd\":436\n * \n * \n * cdef _Fst _map(_Fst ifst, float delta=?, map_type=?, double power=?, weight=?)             # <<<<<<<<<<<<<<\n * \n * cpdef _Fst arcmap(_Fst ifst, float delta=?, map_type=?, double power=?, weight=?)\n */\nstruct __pyx_opt_args_9pywrapfst__map {\n  int __pyx_n;\n  float delta;\n  PyObject *map_type;\n  double power;\n  PyObject *weight;\n};\n\n/* \"pywrapfst.pxd\":438\n * cdef _Fst _map(_Fst ifst, float delta=?, map_type=?, double power=?, weight=?)\n * \n * cpdef _Fst arcmap(_Fst ifst, float delta=?, map_type=?, double power=?, weight=?)             # <<<<<<<<<<<<<<\n * \n * cpdef _MutableFst compose(_Fst ifst1, _Fst ifst2, compose_filter=?,\n */\nstruct __pyx_opt_args_9pywrapfst_arcmap {\n  int __pyx_n;\n  float delta;\n  PyObject *map_type;\n  double power;\n  PyObject *weight;\n};\n\n/* \"pywrapfst.pxd\":440\n * cpdef _Fst arcmap(_Fst ifst, float delta=?, map_type=?, double power=?, weight=?)\n * \n * cpdef _MutableFst compose(_Fst ifst1, _Fst ifst2, compose_filter=?,             # <<<<<<<<<<<<<<\n *                           bool connect=?)\n * \n */\nstruct __pyx_opt_args_9pywrapfst_compose {\n  int __pyx_n;\n  PyObject *compose_filter;\n  bool connect;\n};\n\n/* \"pywrapfst.pxd\":443\n *                           bool connect=?)\n * \n * cpdef _Fst convert(_Fst ifst, fst_type=?)             # <<<<<<<<<<<<<<\n * \n * cpdef _MutableFst determinize(_Fst ifst, float delta=?, det_type=?,\n */\nstruct __pyx_opt_args_9pywrapfst_convert {\n  int __pyx_n;\n  PyObject *fst_type;\n};\n\n/* \"pywrapfst.pxd\":445\n * cpdef _Fst convert(_Fst ifst, fst_type=?)\n * \n * cpdef _MutableFst determinize(_Fst ifst, float delta=?, det_type=?,             # <<<<<<<<<<<<<<\n *                               int64 nstate=?, int64 subsequential_label=?,\n *                               weight=?, bool increment_subsequential_label=?)\n */\nstruct __pyx_opt_args_9pywrapfst_determinize {\n  int __pyx_n;\n  float delta;\n  PyObject *det_type;\n  __pyx_t_10basictypes_int64 nstate;\n  __pyx_t_10basictypes_int64 subsequential_label;\n  PyObject *weight;\n  bool increment_subsequential_label;\n};\n\n/* \"pywrapfst.pxd\":449\n *                               weight=?, bool increment_subsequential_label=?)\n * \n * cpdef _MutableFst difference(_Fst ifst1, _Fst ifst2, compose_filter=?,             # <<<<<<<<<<<<<<\n *                              bool connect=?)\n * \n */\nstruct __pyx_opt_args_9pywrapfst_difference {\n  int __pyx_n;\n  PyObject *compose_filter;\n  bool connect;\n};\n\n/* \"pywrapfst.pxd\":452\n *                              bool connect=?)\n * \n * cpdef _MutableFst disambiguate(_Fst ifst, float delta=?, int64 nstate=?,             # <<<<<<<<<<<<<<\n *                                int64 subsequential_label=?, weight=?)\n * \n */\nstruct __pyx_opt_args_9pywrapfst_disambiguate {\n  int __pyx_n;\n  float delta;\n  __pyx_t_10basictypes_int64 nstate;\n  __pyx_t_10basictypes_int64 subsequential_label;\n  PyObject *weight;\n};\n\n/* \"pywrapfst.pxd\":455\n *                                int64 subsequential_label=?, weight=?)\n * \n * cpdef _MutableFst epsnormalize(_Fst ifst, bool eps_norm_output=?)             # <<<<<<<<<<<<<<\n * \n * cpdef bool equal(_Fst ifst1, _Fst ifst2, float delta=?)\n */\nstruct __pyx_opt_args_9pywrapfst_epsnormalize {\n  int __pyx_n;\n  bool eps_norm_output;\n};\n\n/* \"pywrapfst.pxd\":457\n * cpdef _MutableFst epsnormalize(_Fst ifst, bool eps_norm_output=?)\n * \n * cpdef bool equal(_Fst ifst1, _Fst ifst2, float delta=?)             # <<<<<<<<<<<<<<\n * \n * cpdef bool equivalent(_Fst ifst1, _Fst ifst2, float delta=?) except *\n */\nstruct __pyx_opt_args_9pywrapfst_equal {\n  int __pyx_n;\n  float delta;\n};\n\n/* \"pywrapfst.pxd\":459\n * cpdef bool equal(_Fst ifst1, _Fst ifst2, float delta=?)\n * \n * cpdef bool equivalent(_Fst ifst1, _Fst ifst2, float delta=?) except *             # <<<<<<<<<<<<<<\n * \n * cpdef _MutableFst intersect(_Fst ifst1, _Fst ifst2, compose_filter=?,\n */\nstruct __pyx_opt_args_9pywrapfst_equivalent {\n  int __pyx_n;\n  float delta;\n};\n\n/* \"pywrapfst.pxd\":461\n * cpdef bool equivalent(_Fst ifst1, _Fst ifst2, float delta=?) except *\n * \n * cpdef _MutableFst intersect(_Fst ifst1, _Fst ifst2, compose_filter=?,             # <<<<<<<<<<<<<<\n *                             bool connect=?)\n * \n */\nstruct __pyx_opt_args_9pywrapfst_intersect {\n  int __pyx_n;\n  PyObject *compose_filter;\n  bool connect;\n};\n\n/* \"pywrapfst.pxd\":464\n *                             bool connect=?)\n * \n * cpdef bool isomorphic(_Fst ifst1, _Fst ifst2, float delta=?)             # <<<<<<<<<<<<<<\n * \n * cpdef _MutableFst prune(_Fst ifst, float delta=?, int64 nstate=?,\n */\nstruct __pyx_opt_args_9pywrapfst_isomorphic {\n  int __pyx_n;\n  float delta;\n};\n\n/* \"pywrapfst.pxd\":466\n * cpdef bool isomorphic(_Fst ifst1, _Fst ifst2, float delta=?)\n * \n * cpdef _MutableFst prune(_Fst ifst, float delta=?, int64 nstate=?,             # <<<<<<<<<<<<<<\n *                         weight=?)\n * \n */\nstruct __pyx_opt_args_9pywrapfst_prune {\n  int __pyx_n;\n  float delta;\n  __pyx_t_10basictypes_int64 nstate;\n  PyObject *weight;\n};\n\n/* \"pywrapfst.pxd\":469\n *                         weight=?)\n * \n * cpdef _MutableFst push(_Fst ifst, float delta=?, bool push_weights=?,             # <<<<<<<<<<<<<<\n *                        bool push_labels=?, bool remove_common_affix=?,\n *                        bool remove_total_weight=?, bool to_final=?)\n */\nstruct __pyx_opt_args_9pywrapfst_push {\n  int __pyx_n;\n  float delta;\n  bool push_weights;\n  bool push_labels;\n  bool remove_common_affix;\n  bool remove_total_weight;\n  bool to_final;\n};\n\n/* \"pywrapfst.pxd\":473\n *                        bool remove_total_weight=?, bool to_final=?)\n * \n * cpdef bool randequivalent(_Fst ifst1, _Fst ifst2, int32 npath=?,             # <<<<<<<<<<<<<<\n *                           float delta=?, time_t seed=?, select=?,\n *                           int32 max_length=?) except *\n */\nstruct __pyx_opt_args_9pywrapfst_randequivalent {\n  int __pyx_n;\n  __pyx_t_10basictypes_int32 npath;\n  float delta;\n  time_t seed;\n  PyObject *select;\n  __pyx_t_10basictypes_int32 max_length;\n};\n\n/* \"pywrapfst.pxd\":477\n *                           int32 max_length=?) except *\n * \n * cpdef _MutableFst randgen(_Fst ifst, int32 npath=?, time_t seed=?,             # <<<<<<<<<<<<<<\n *                           select=?, int32 max_length=?,\n *                           bool remove_total_weight=?, bool weighted=?)\n */\nstruct __pyx_opt_args_9pywrapfst_randgen {\n  int __pyx_n;\n  __pyx_t_10basictypes_int32 npath;\n  time_t seed;\n  PyObject *select;\n  __pyx_t_10basictypes_int32 max_length;\n  bool remove_total_weight;\n  bool weighted;\n};\n\n/* \"pywrapfst.pxd\":484\n *     bool epsilon_on_replace) except *\n * \n * cpdef _MutableFst replace(pairs, call_arc_labeling=?, return_arc_labeling=?,             # <<<<<<<<<<<<<<\n *                           bool epsilon_on_replace=?, int64 return_label=?)\n * \n */\nstruct __pyx_opt_args_9pywrapfst_replace {\n  int __pyx_n;\n  PyObject *call_arc_labeling;\n  PyObject *return_arc_labeling;\n  bool epsilon_on_replace;\n  __pyx_t_10basictypes_int64 return_label;\n};\n\n/* \"pywrapfst.pxd\":487\n *                           bool epsilon_on_replace=?, int64 return_label=?)\n * \n * cpdef _MutableFst reverse(_Fst ifst, bool require_superinitial=?)             # <<<<<<<<<<<<<<\n * \n * cdef vector[fst.WeightClass] *_shortestdistance(_Fst ifst, float delta=?,\n */\nstruct __pyx_opt_args_9pywrapfst_reverse {\n  int __pyx_n;\n  bool require_superinitial;\n};\n\n/* \"pywrapfst.pxd\":489\n * cpdef _MutableFst reverse(_Fst ifst, bool require_superinitial=?)\n * \n * cdef vector[fst.WeightClass] *_shortestdistance(_Fst ifst, float delta=?,             # <<<<<<<<<<<<<<\n *                                                 int64 nstate=?, queue_type=?,\n *                                                 bool reverse=?) except *\n */\nstruct __pyx_opt_args_9pywrapfst__shortestdistance {\n  int __pyx_n;\n  float delta;\n  __pyx_t_10basictypes_int64 nstate;\n  PyObject *queue_type;\n  bool reverse;\n};\n\n/* \"pywrapfst.pxd\":493\n *                                                 bool reverse=?) except *\n * \n * cpdef _MutableFst shortestpath(_Fst ifst, float delta=?, int32 nshortest=?,             # <<<<<<<<<<<<<<\n *                                int64 nstate=?, queue_type=?, bool unique=?,\n *                                weight=?)\n */\nstruct __pyx_opt_args_9pywrapfst_shortestpath {\n  int __pyx_n;\n  float delta;\n  __pyx_t_10basictypes_int32 nshortest;\n  __pyx_t_10basictypes_int64 nstate;\n  PyObject *queue_type;\n  bool unique;\n  PyObject *weight;\n};\n\n/* \"pywrapfst.pxd\":69\n * \n * \n * cdef class Weight(object):             # <<<<<<<<<<<<<<\n * \n *   cdef unique_ptr[fst.WeightClass] _weight\n */\nstruct __pyx_obj_9pywrapfst_Weight {\n  PyObject_HEAD\n  struct __pyx_vtabstruct_9pywrapfst_Weight *__pyx_vtab;\n  std::unique_ptr<fst::script::WeightClass>  _weight;\n};\n\n\n/* \"pywrapfst.pxd\":102\n * \n * \n * cdef class _SymbolTable(object):             # <<<<<<<<<<<<<<\n * \n *   cdef fst.SymbolTable *_table\n */\nstruct __pyx_obj_9pywrapfst__SymbolTable {\n  PyObject_HEAD\n  struct __pyx_vtabstruct_9pywrapfst__SymbolTable *__pyx_vtab;\n  fst::SymbolTable *_table;\n};\n\n\n/* \"pywrapfst.pxd\":127\n * \n * \n * cdef class _EncodeMapperSymbolTable(_SymbolTable):             # <<<<<<<<<<<<<<\n * \n *   cdef shared_ptr[fst.EncodeMapperClass] _encoder\n */\nstruct __pyx_obj_9pywrapfst__EncodeMapperSymbolTable {\n  struct __pyx_obj_9pywrapfst__SymbolTable __pyx_base;\n  std::shared_ptr<fst::script::EncodeMapperClass>  _encoder;\n};\n\n\n/* \"pywrapfst.pxd\":132\n * \n * \n * cdef class _FstSymbolTable(_SymbolTable):             # <<<<<<<<<<<<<<\n * \n *   cdef shared_ptr[fst.FstClass] _fst\n */\nstruct __pyx_obj_9pywrapfst__FstSymbolTable {\n  struct __pyx_obj_9pywrapfst__SymbolTable __pyx_base;\n  std::shared_ptr<fst::script::FstClass>  _fst;\n};\n\n\n/* \"pywrapfst.pxd\":137\n * \n * \n * cdef class _MutableSymbolTable(_SymbolTable):             # <<<<<<<<<<<<<<\n * \n *   cpdef int64 add_symbol(self, symbol, int64 key=?)\n */\nstruct __pyx_obj_9pywrapfst__MutableSymbolTable {\n  struct __pyx_obj_9pywrapfst__SymbolTable __pyx_base;\n};\n\n\n/* \"pywrapfst.pxd\":146\n * \n * \n * cdef class _MutableFstSymbolTable(_MutableSymbolTable):             # <<<<<<<<<<<<<<\n * \n *   cdef shared_ptr[fst.MutableFstClass] _mfst\n */\nstruct __pyx_obj_9pywrapfst__MutableFstSymbolTable {\n  struct __pyx_obj_9pywrapfst__MutableSymbolTable __pyx_base;\n  std::shared_ptr<fst::script::MutableFstClass>  _mfst;\n};\n\n\n/* \"pywrapfst.pxd\":151\n * \n * \n * cdef class SymbolTable(_MutableSymbolTable):             # <<<<<<<<<<<<<<\n * \n *   cdef unique_ptr[fst.SymbolTable] _smart_table\n */\nstruct __pyx_obj_9pywrapfst_SymbolTable {\n  struct __pyx_obj_9pywrapfst__MutableSymbolTable __pyx_base;\n  std::unique_ptr<fst::SymbolTable>  _smart_table;\n};\n\n\n/* \"pywrapfst.pxd\":172\n * \n * \n * cdef class SymbolTableIterator(object):             # <<<<<<<<<<<<<<\n * \n *   cdef shared_ptr[fst.SymbolTable] _table\n */\nstruct __pyx_obj_9pywrapfst_SymbolTableIterator {\n  PyObject_HEAD\n  struct __pyx_vtabstruct_9pywrapfst_SymbolTableIterator *__pyx_vtab;\n  std::shared_ptr<fst::SymbolTable>  _table;\n  std::unique_ptr<fst::SymbolTableIterator>  _siter;\n};\n\n\n/* \"pywrapfst.pxd\":191\n * \n * \n * cdef class EncodeMapper(object):             # <<<<<<<<<<<<<<\n * \n *   cdef shared_ptr[fst.EncodeMapperClass] _encoder\n */\nstruct __pyx_obj_9pywrapfst_EncodeMapper {\n  PyObject_HEAD\n  struct __pyx_vtabstruct_9pywrapfst_EncodeMapper *__pyx_vtab;\n  std::shared_ptr<fst::script::EncodeMapperClass>  _encoder;\n};\n\n\n/* \"pywrapfst.pxd\":220\n * \n * \n * cdef class _Fst(object):             # <<<<<<<<<<<<<<\n * \n *   cdef shared_ptr[fst.FstClass] _fst\n */\nstruct __pyx_obj_9pywrapfst__Fst {\n  PyObject_HEAD\n  struct __pyx_vtabstruct_9pywrapfst__Fst *__pyx_vtab;\n  std::shared_ptr<fst::script::FstClass>  _fst;\n};\n\n\n/* \"pywrapfst.pxd\":271\n * \n * \n * cdef class _MutableFst(_Fst):             # <<<<<<<<<<<<<<\n * \n *   cdef shared_ptr[fst.MutableFstClass] _mfst\n */\nstruct __pyx_obj_9pywrapfst__MutableFst {\n  struct __pyx_obj_9pywrapfst__Fst __pyx_base;\n  std::shared_ptr<fst::script::MutableFstClass>  _mfst;\n};\n\n\n/* \"pywrapfst.pxd\":363\n * \n * \n * cdef class Arc(object):             # <<<<<<<<<<<<<<\n * \n *   cdef unique_ptr[fst.ArcClass] _arc\n */\nstruct __pyx_obj_9pywrapfst_Arc {\n  PyObject_HEAD\n  struct __pyx_vtabstruct_9pywrapfst_Arc *__pyx_vtab;\n  std::unique_ptr<fst::script::ArcClass>  _arc;\n};\n\n\n/* \"pywrapfst.pxd\":373\n * \n * \n * cdef class ArcIterator(object):             # <<<<<<<<<<<<<<\n * \n *   cdef shared_ptr[fst.FstClass] _fst\n */\nstruct __pyx_obj_9pywrapfst_ArcIterator {\n  PyObject_HEAD\n  struct __pyx_vtabstruct_9pywrapfst_ArcIterator *__pyx_vtab;\n  std::shared_ptr<fst::script::FstClass>  _fst;\n  std::unique_ptr<fst::script::ArcIteratorClass>  _aiter;\n};\n\n\n/* \"pywrapfst.pxd\":395\n * \n * \n * cdef class MutableArcIterator(object):             # <<<<<<<<<<<<<<\n * \n *   cdef shared_ptr[fst.MutableFstClass] _mfst\n */\nstruct __pyx_obj_9pywrapfst_MutableArcIterator {\n  PyObject_HEAD\n  struct __pyx_vtabstruct_9pywrapfst_MutableArcIterator *__pyx_vtab;\n  std::shared_ptr<fst::script::MutableFstClass>  _mfst;\n  std::unique_ptr<fst::script::MutableArcIteratorClass>  _aiter;\n};\n\n\n/* \"pywrapfst.pxd\":419\n * \n * \n * cdef class StateIterator(object):             # <<<<<<<<<<<<<<\n * \n *   cdef shared_ptr[fst.FstClass] _fst\n */\nstruct __pyx_obj_9pywrapfst_StateIterator {\n  PyObject_HEAD\n  struct __pyx_vtabstruct_9pywrapfst_StateIterator *__pyx_vtab;\n  std::shared_ptr<fst::script::FstClass>  _fst;\n  std::unique_ptr<fst::script::StateIteratorClass>  _siter;\n};\n\n\n/* \"pywrapfst.pxd\":505\n * \n * \n * cdef class Compiler(object):             # <<<<<<<<<<<<<<\n * \n *   cdef unique_ptr[stringstream] _sstrm\n */\nstruct __pyx_obj_9pywrapfst_Compiler {\n  PyObject_HEAD\n  struct __pyx_vtabstruct_9pywrapfst_Compiler *__pyx_vtab;\n  std::unique_ptr<std::stringstream>  _sstrm;\n  std::string _fst_type;\n  std::string _arc_type;\n  fst::SymbolTable const *_isymbols;\n  fst::SymbolTable const *_osymbols;\n  fst::SymbolTable const *_ssymbols;\n  bool _acceptor;\n  bool _keep_isymbols;\n  bool _keep_osymbols;\n  bool _keep_state_numbering;\n  bool _allow_negative_labels;\n};\n\n\n/* \"pywrapfst.pxd\":526\n * # FarReader.\n * \n * cdef class FarReader(object):             # <<<<<<<<<<<<<<\n * \n *   cdef unique_ptr[fst.FarReaderClass] _reader\n */\nstruct __pyx_obj_9pywrapfst_FarReader {\n  PyObject_HEAD\n  struct __pyx_vtabstruct_9pywrapfst_FarReader *__pyx_vtab;\n  std::unique_ptr<fst::script::FarReaderClass>  _reader;\n};\n\n\n/* \"pywrapfst.pxd\":551\n * # FarWriter.\n * \n * cdef class FarWriter(object):             # <<<<<<<<<<<<<<\n * \n *   cdef unique_ptr[fst.FarWriterClass] _writer\n */\nstruct __pyx_obj_9pywrapfst_FarWriter {\n  PyObject_HEAD\n  struct __pyx_vtabstruct_9pywrapfst_FarWriter *__pyx_vtab;\n  std::unique_ptr<fst::script::FarWriterClass>  _writer;\n};\n\n\n\n/* \"pywrapfst.pyx\":348\n * \n * \n * cdef class Weight(object):             # <<<<<<<<<<<<<<\n * \n *   \"\"\"\n */\n\nstruct __pyx_vtabstruct_9pywrapfst_Weight {\n  void (*_check_weight)(struct __pyx_obj_9pywrapfst_Weight *);\n  struct __pyx_obj_9pywrapfst_Weight *(*copy)(struct __pyx_obj_9pywrapfst_Weight *, int __pyx_skip_dispatch);\n  std::string (*to_string)(struct __pyx_obj_9pywrapfst_Weight *, int __pyx_skip_dispatch);\n  std::string (*type)(struct __pyx_obj_9pywrapfst_Weight *, int __pyx_skip_dispatch);\n};\nstatic struct __pyx_vtabstruct_9pywrapfst_Weight *__pyx_vtabptr_9pywrapfst_Weight;\n\n\n/* \"pywrapfst.pyx\":675\n * \n * \n * cdef class _SymbolTable(object):             # <<<<<<<<<<<<<<\n * \n *   \"\"\"\n */\n\nstruct __pyx_vtabstruct_9pywrapfst__SymbolTable {\n  __pyx_t_10basictypes_int64 (*available_key)(struct __pyx_obj_9pywrapfst__SymbolTable *, int __pyx_skip_dispatch);\n  std::string (*checksum)(struct __pyx_obj_9pywrapfst__SymbolTable *, int __pyx_skip_dispatch);\n  struct __pyx_obj_9pywrapfst_SymbolTable *(*copy)(struct __pyx_obj_9pywrapfst__SymbolTable *, int __pyx_skip_dispatch);\n  __pyx_t_10basictypes_int64 (*get_nth_key)(struct __pyx_obj_9pywrapfst__SymbolTable *, Py_ssize_t, int __pyx_skip_dispatch);\n  std::string (*labeled_checksum)(struct __pyx_obj_9pywrapfst__SymbolTable *, int __pyx_skip_dispatch);\n  bool (*member)(struct __pyx_obj_9pywrapfst__SymbolTable *, PyObject *, int __pyx_skip_dispatch);\n  std::string (*name)(struct __pyx_obj_9pywrapfst__SymbolTable *, int __pyx_skip_dispatch);\n  size_t (*num_symbols)(struct __pyx_obj_9pywrapfst__SymbolTable *, int __pyx_skip_dispatch);\n  void (*write)(struct __pyx_obj_9pywrapfst__SymbolTable *, PyObject *, int __pyx_skip_dispatch);\n  void (*write_text)(struct __pyx_obj_9pywrapfst__SymbolTable *, PyObject *, int __pyx_skip_dispatch);\n};\nstatic struct __pyx_vtabstruct_9pywrapfst__SymbolTable *__pyx_vtabptr_9pywrapfst__SymbolTable;\n\n\n/* \"pywrapfst.pyx\":839\n * \n * \n * cdef class _EncodeMapperSymbolTable(_SymbolTable):             # <<<<<<<<<<<<<<\n * \n *   \"\"\"\n */\n\nstruct __pyx_vtabstruct_9pywrapfst__EncodeMapperSymbolTable {\n  struct __pyx_vtabstruct_9pywrapfst__SymbolTable __pyx_base;\n};\nstatic struct __pyx_vtabstruct_9pywrapfst__EncodeMapperSymbolTable *__pyx_vtabptr_9pywrapfst__EncodeMapperSymbolTable;\n\n\n/* \"pywrapfst.pyx\":859\n * \n * \n * cdef class _FstSymbolTable(_SymbolTable):             # <<<<<<<<<<<<<<\n * \n *   \"\"\"\n */\n\nstruct __pyx_vtabstruct_9pywrapfst__FstSymbolTable {\n  struct __pyx_vtabstruct_9pywrapfst__SymbolTable __pyx_base;\n};\nstatic struct __pyx_vtabstruct_9pywrapfst__FstSymbolTable *__pyx_vtabptr_9pywrapfst__FstSymbolTable;\n\n\n/* \"pywrapfst.pyx\":878\n * \n * \n * cdef class _MutableSymbolTable(_SymbolTable):             # <<<<<<<<<<<<<<\n * \n *   \"\"\"\n */\n\nstruct __pyx_vtabstruct_9pywrapfst__MutableSymbolTable {\n  struct __pyx_vtabstruct_9pywrapfst__SymbolTable __pyx_base;\n  __pyx_t_10basictypes_int64 (*add_symbol)(struct __pyx_obj_9pywrapfst__MutableSymbolTable *, PyObject *, int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_19_MutableSymbolTable_add_symbol *__pyx_optional_args);\n  void (*add_table)(struct __pyx_obj_9pywrapfst__MutableSymbolTable *, struct __pyx_obj_9pywrapfst__SymbolTable *, int __pyx_skip_dispatch);\n  void (*set_name)(struct __pyx_obj_9pywrapfst__MutableSymbolTable *, PyObject *, int __pyx_skip_dispatch);\n};\nstatic struct __pyx_vtabstruct_9pywrapfst__MutableSymbolTable *__pyx_vtabptr_9pywrapfst__MutableSymbolTable;\n\n\n/* \"pywrapfst.pyx\":930\n * \n * \n * cdef class _MutableFstSymbolTable(_MutableSymbolTable):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   (No constructor.)\n */\n\nstruct __pyx_vtabstruct_9pywrapfst__MutableFstSymbolTable {\n  struct __pyx_vtabstruct_9pywrapfst__MutableSymbolTable __pyx_base;\n};\nstatic struct __pyx_vtabstruct_9pywrapfst__MutableFstSymbolTable *__pyx_vtabptr_9pywrapfst__MutableFstSymbolTable;\n\n\n/* \"pywrapfst.pyx\":941\n * \n * \n * cdef class SymbolTable(_MutableSymbolTable):             # <<<<<<<<<<<<<<\n * \n *   \"\"\"\n */\n\nstruct __pyx_vtabstruct_9pywrapfst_SymbolTable {\n  struct __pyx_vtabstruct_9pywrapfst__MutableSymbolTable __pyx_base;\n};\nstatic struct __pyx_vtabstruct_9pywrapfst_SymbolTable *__pyx_vtabptr_9pywrapfst_SymbolTable;\n\n\n/* \"pywrapfst.pyx\":1124\n * \n * \n * cdef class SymbolTableIterator(object):             # <<<<<<<<<<<<<<\n * \n *   \"\"\"\n */\n\nstruct __pyx_vtabstruct_9pywrapfst_SymbolTableIterator {\n  bool (*done)(struct __pyx_obj_9pywrapfst_SymbolTableIterator *, int __pyx_skip_dispatch);\n  void (*next)(struct __pyx_obj_9pywrapfst_SymbolTableIterator *, int __pyx_skip_dispatch);\n  void (*reset)(struct __pyx_obj_9pywrapfst_SymbolTableIterator *, int __pyx_skip_dispatch);\n  std::string (*symbol)(struct __pyx_obj_9pywrapfst_SymbolTableIterator *, int __pyx_skip_dispatch);\n  __pyx_t_10basictypes_int64 (*value)(struct __pyx_obj_9pywrapfst_SymbolTableIterator *, int __pyx_skip_dispatch);\n};\nstatic struct __pyx_vtabstruct_9pywrapfst_SymbolTableIterator *__pyx_vtabptr_9pywrapfst_SymbolTableIterator;\n\n\n/* \"pywrapfst.pyx\":1206\n * \n * \n * cdef class EncodeMapper(object):             # <<<<<<<<<<<<<<\n * \n *   \"\"\"\n */\n\nstruct __pyx_vtabstruct_9pywrapfst_EncodeMapper {\n  std::string (*arc_type)(struct __pyx_obj_9pywrapfst_EncodeMapper *, int __pyx_skip_dispatch);\n  __pyx_t_10basictypes_uint32 (*flags)(struct __pyx_obj_9pywrapfst_EncodeMapper *, int __pyx_skip_dispatch);\n  struct __pyx_obj_9pywrapfst__EncodeMapperSymbolTable *(*input_symbols)(struct __pyx_obj_9pywrapfst_EncodeMapper *, int __pyx_skip_dispatch);\n  struct __pyx_obj_9pywrapfst__EncodeMapperSymbolTable *(*output_symbols)(struct __pyx_obj_9pywrapfst_EncodeMapper *, int __pyx_skip_dispatch);\n  __pyx_t_10basictypes_uint64 (*properties)(struct __pyx_obj_9pywrapfst_EncodeMapper *, __pyx_t_10basictypes_uint64, int __pyx_skip_dispatch);\n  void (*set_input_symbols)(struct __pyx_obj_9pywrapfst_EncodeMapper *, struct __pyx_obj_9pywrapfst__SymbolTable *, int __pyx_skip_dispatch);\n  void (*set_output_symbols)(struct __pyx_obj_9pywrapfst_EncodeMapper *, struct __pyx_obj_9pywrapfst__SymbolTable *, int __pyx_skip_dispatch);\n  std::string (*weight_type)(struct __pyx_obj_9pywrapfst_EncodeMapper *, int __pyx_skip_dispatch);\n};\nstatic struct __pyx_vtabstruct_9pywrapfst_EncodeMapper *__pyx_vtabptr_9pywrapfst_EncodeMapper;\n\n\n/* \"pywrapfst.pyx\":1362\n * \n * \n * cdef class _Fst(object):             # <<<<<<<<<<<<<<\n * \n *   \"\"\"\n */\n\nstruct __pyx_vtabstruct_9pywrapfst__Fst {\n  std::string (*arc_type)(struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch);\n  struct __pyx_obj_9pywrapfst_ArcIterator *(*arcs)(struct __pyx_obj_9pywrapfst__Fst *, __pyx_t_10basictypes_int64, int __pyx_skip_dispatch);\n  struct __pyx_obj_9pywrapfst__Fst *(*copy)(struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch);\n  void (*draw)(struct __pyx_obj_9pywrapfst__Fst *, PyObject *, int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_4_Fst_draw *__pyx_optional_args);\n  struct __pyx_obj_9pywrapfst_Weight *(*final)(struct __pyx_obj_9pywrapfst__Fst *, __pyx_t_10basictypes_int64, int __pyx_skip_dispatch);\n  std::string (*fst_type)(struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch);\n  struct __pyx_obj_9pywrapfst__FstSymbolTable *(*input_symbols)(struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch);\n  size_t (*num_arcs)(struct __pyx_obj_9pywrapfst__Fst *, __pyx_t_10basictypes_int64, int __pyx_skip_dispatch);\n  size_t (*num_input_epsilons)(struct __pyx_obj_9pywrapfst__Fst *, __pyx_t_10basictypes_int64, int __pyx_skip_dispatch);\n  size_t (*num_output_epsilons)(struct __pyx_obj_9pywrapfst__Fst *, __pyx_t_10basictypes_int64, int __pyx_skip_dispatch);\n  struct __pyx_obj_9pywrapfst__FstSymbolTable *(*output_symbols)(struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch);\n  __pyx_t_10basictypes_uint64 (*properties)(struct __pyx_obj_9pywrapfst__Fst *, __pyx_t_10basictypes_uint64, bool, int __pyx_skip_dispatch);\n  __pyx_t_10basictypes_int64 (*start)(struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch);\n  struct __pyx_obj_9pywrapfst_StateIterator *(*states)(struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch);\n  std::string (*text)(struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_4_Fst_text *__pyx_optional_args);\n  bool (*verify)(struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch);\n  std::string (*weight_type)(struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch);\n  void (*write)(struct __pyx_obj_9pywrapfst__Fst *, PyObject *, int __pyx_skip_dispatch);\n  std::string (*write_to_string)(struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch);\n};\nstatic struct __pyx_vtabstruct_9pywrapfst__Fst *__pyx_vtabptr_9pywrapfst__Fst;\n\n\n/* \"pywrapfst.pyx\":1774\n * \n * \n * cdef class _MutableFst(_Fst):             # <<<<<<<<<<<<<<\n * \n *   \"\"\"\n */\n\nstruct __pyx_vtabstruct_9pywrapfst__MutableFst {\n  struct __pyx_vtabstruct_9pywrapfst__Fst __pyx_base;\n  void (*_check_mutating_imethod)(struct __pyx_obj_9pywrapfst__MutableFst *);\n  void (*_add_arc)(struct __pyx_obj_9pywrapfst__MutableFst *, __pyx_t_10basictypes_int64, struct __pyx_obj_9pywrapfst_Arc *);\n  __pyx_t_10basictypes_int64 (*add_state)(struct __pyx_obj_9pywrapfst__MutableFst *, int __pyx_skip_dispatch);\n  void (*_arcsort)(struct __pyx_obj_9pywrapfst__MutableFst *, struct __pyx_opt_args_9pywrapfst_11_MutableFst__arcsort *__pyx_optional_args);\n  void (*_closure)(struct __pyx_obj_9pywrapfst__MutableFst *, struct __pyx_opt_args_9pywrapfst_11_MutableFst__closure *__pyx_optional_args);\n  void (*_concat)(struct __pyx_obj_9pywrapfst__MutableFst *, struct __pyx_obj_9pywrapfst__Fst *);\n  void (*_connect)(struct __pyx_obj_9pywrapfst__MutableFst *);\n  void (*_decode)(struct __pyx_obj_9pywrapfst__MutableFst *, struct __pyx_obj_9pywrapfst_EncodeMapper *);\n  void (*_delete_arcs)(struct __pyx_obj_9pywrapfst__MutableFst *, __pyx_t_10basictypes_int64, struct __pyx_opt_args_9pywrapfst_11_MutableFst__delete_arcs *__pyx_optional_args);\n  void (*_delete_states)(struct __pyx_obj_9pywrapfst__MutableFst *, struct __pyx_opt_args_9pywrapfst_11_MutableFst__delete_states *__pyx_optional_args);\n  void (*_encode)(struct __pyx_obj_9pywrapfst__MutableFst *, struct __pyx_obj_9pywrapfst_EncodeMapper *);\n  void (*_invert)(struct __pyx_obj_9pywrapfst__MutableFst *);\n  void (*_minimize)(struct __pyx_obj_9pywrapfst__MutableFst *, struct __pyx_opt_args_9pywrapfst_11_MutableFst__minimize *__pyx_optional_args);\n  struct __pyx_obj_9pywrapfst_MutableArcIterator *(*mutable_arcs)(struct __pyx_obj_9pywrapfst__MutableFst *, __pyx_t_10basictypes_int64, int __pyx_skip_dispatch);\n  __pyx_t_10basictypes_int64 (*num_states)(struct __pyx_obj_9pywrapfst__MutableFst *, int __pyx_skip_dispatch);\n  void (*_project)(struct __pyx_obj_9pywrapfst__MutableFst *, struct __pyx_opt_args_9pywrapfst_11_MutableFst__project *__pyx_optional_args);\n  void (*_prune)(struct __pyx_obj_9pywrapfst__MutableFst *, struct __pyx_opt_args_9pywrapfst_11_MutableFst__prune *__pyx_optional_args);\n  void (*_push)(struct __pyx_obj_9pywrapfst__MutableFst *, struct __pyx_opt_args_9pywrapfst_11_MutableFst__push *__pyx_optional_args);\n  void (*_relabel_pairs)(struct __pyx_obj_9pywrapfst__MutableFst *, struct __pyx_opt_args_9pywrapfst_11_MutableFst__relabel_pairs *__pyx_optional_args);\n  void (*_relabel_tables)(struct __pyx_obj_9pywrapfst__MutableFst *, struct __pyx_opt_args_9pywrapfst_11_MutableFst__relabel_tables *__pyx_optional_args);\n  void (*_reserve_arcs)(struct __pyx_obj_9pywrapfst__MutableFst *, __pyx_t_10basictypes_int64, size_t);\n  void (*_reserve_states)(struct __pyx_obj_9pywrapfst__MutableFst *, __pyx_t_10basictypes_int64);\n  void (*_reweight)(struct __pyx_obj_9pywrapfst__MutableFst *, PyObject *, struct __pyx_opt_args_9pywrapfst_11_MutableFst__reweight *__pyx_optional_args);\n  void (*_rmepsilon)(struct __pyx_obj_9pywrapfst__MutableFst *, struct __pyx_opt_args_9pywrapfst_11_MutableFst__rmepsilon *__pyx_optional_args);\n  void (*_set_final)(struct __pyx_obj_9pywrapfst__MutableFst *, __pyx_t_10basictypes_int64, struct __pyx_opt_args_9pywrapfst_11_MutableFst__set_final *__pyx_optional_args);\n  void (*_set_properties)(struct __pyx_obj_9pywrapfst__MutableFst *, __pyx_t_10basictypes_uint64, __pyx_t_10basictypes_uint64);\n  void (*_set_start)(struct __pyx_obj_9pywrapfst__MutableFst *, __pyx_t_10basictypes_int64);\n  void (*_set_input_symbols)(struct __pyx_obj_9pywrapfst__MutableFst *, struct __pyx_obj_9pywrapfst__SymbolTable *);\n  void (*_set_output_symbols)(struct __pyx_obj_9pywrapfst__MutableFst *, struct __pyx_obj_9pywrapfst__SymbolTable *);\n  void (*_topsort)(struct __pyx_obj_9pywrapfst__MutableFst *);\n  void (*_union)(struct __pyx_obj_9pywrapfst__MutableFst *, struct __pyx_obj_9pywrapfst__Fst *);\n};\nstatic struct __pyx_vtabstruct_9pywrapfst__MutableFst *__pyx_vtabptr_9pywrapfst__MutableFst;\n\n\n/* \"pywrapfst.pyx\":2898\n * \n * \n * cdef class Arc(object):             # <<<<<<<<<<<<<<\n * \n *   \"\"\"\n */\n\nstruct __pyx_vtabstruct_9pywrapfst_Arc {\n  struct __pyx_obj_9pywrapfst_Arc *(*copy)(struct __pyx_obj_9pywrapfst_Arc *, int __pyx_skip_dispatch);\n};\nstatic struct __pyx_vtabstruct_9pywrapfst_Arc *__pyx_vtabptr_9pywrapfst_Arc;\n\n\n/* \"pywrapfst.pyx\":2965\n * \n * \n * cdef class ArcIterator(object):             # <<<<<<<<<<<<<<\n * \n *   \"\"\"\n */\n\nstruct __pyx_vtabstruct_9pywrapfst_ArcIterator {\n  bool (*done)(struct __pyx_obj_9pywrapfst_ArcIterator *, int __pyx_skip_dispatch);\n  __pyx_t_10basictypes_uint32 (*flags)(struct __pyx_obj_9pywrapfst_ArcIterator *, int __pyx_skip_dispatch);\n  void (*next)(struct __pyx_obj_9pywrapfst_ArcIterator *, int __pyx_skip_dispatch);\n  size_t (*position)(struct __pyx_obj_9pywrapfst_ArcIterator *, int __pyx_skip_dispatch);\n  void (*reset)(struct __pyx_obj_9pywrapfst_ArcIterator *, int __pyx_skip_dispatch);\n  void (*seek)(struct __pyx_obj_9pywrapfst_ArcIterator *, size_t, int __pyx_skip_dispatch);\n  void (*set_flags)(struct __pyx_obj_9pywrapfst_ArcIterator *, __pyx_t_10basictypes_uint32, __pyx_t_10basictypes_uint32, int __pyx_skip_dispatch);\n  PyObject *(*value)(struct __pyx_obj_9pywrapfst_ArcIterator *, int __pyx_skip_dispatch);\n};\nstatic struct __pyx_vtabstruct_9pywrapfst_ArcIterator *__pyx_vtabptr_9pywrapfst_ArcIterator;\n\n\n/* \"pywrapfst.pyx\":3076\n * \n * \n * cdef class MutableArcIterator(object):             # <<<<<<<<<<<<<<\n * \n *   \"\"\"\n */\n\nstruct __pyx_vtabstruct_9pywrapfst_MutableArcIterator {\n  bool (*done)(struct __pyx_obj_9pywrapfst_MutableArcIterator *, int __pyx_skip_dispatch);\n  __pyx_t_10basictypes_uint32 (*flags)(struct __pyx_obj_9pywrapfst_MutableArcIterator *, int __pyx_skip_dispatch);\n  void (*next)(struct __pyx_obj_9pywrapfst_MutableArcIterator *, int __pyx_skip_dispatch);\n  size_t (*position)(struct __pyx_obj_9pywrapfst_MutableArcIterator *, int __pyx_skip_dispatch);\n  void (*reset)(struct __pyx_obj_9pywrapfst_MutableArcIterator *, int __pyx_skip_dispatch);\n  void (*seek)(struct __pyx_obj_9pywrapfst_MutableArcIterator *, size_t, int __pyx_skip_dispatch);\n  void (*set_flags)(struct __pyx_obj_9pywrapfst_MutableArcIterator *, __pyx_t_10basictypes_uint32, __pyx_t_10basictypes_uint32, int __pyx_skip_dispatch);\n  void (*set_value)(struct __pyx_obj_9pywrapfst_MutableArcIterator *, struct __pyx_obj_9pywrapfst_Arc *, int __pyx_skip_dispatch);\n  PyObject *(*value)(struct __pyx_obj_9pywrapfst_MutableArcIterator *, int __pyx_skip_dispatch);\n};\nstatic struct __pyx_vtabstruct_9pywrapfst_MutableArcIterator *__pyx_vtabptr_9pywrapfst_MutableArcIterator;\n\n\n/* \"pywrapfst.pyx\":3190\n * \n * \n * cdef class StateIterator(object):             # <<<<<<<<<<<<<<\n * \n *   \"\"\"\n */\n\nstruct __pyx_vtabstruct_9pywrapfst_StateIterator {\n  bool (*done)(struct __pyx_obj_9pywrapfst_StateIterator *, int __pyx_skip_dispatch);\n  void (*next)(struct __pyx_obj_9pywrapfst_StateIterator *, int __pyx_skip_dispatch);\n  void (*reset)(struct __pyx_obj_9pywrapfst_StateIterator *, int __pyx_skip_dispatch);\n  __pyx_t_10basictypes_int64 (*value)(struct __pyx_obj_9pywrapfst_StateIterator *, int __pyx_skip_dispatch);\n};\nstatic struct __pyx_vtabstruct_9pywrapfst_StateIterator *__pyx_vtabptr_9pywrapfst_StateIterator;\n\n\n/* \"pywrapfst.pyx\":4088\n * \n * \n * cdef class Compiler(object):             # <<<<<<<<<<<<<<\n * \n *   \"\"\"\n */\n\nstruct __pyx_vtabstruct_9pywrapfst_Compiler {\n  struct __pyx_obj_9pywrapfst__Fst *(*compile)(struct __pyx_obj_9pywrapfst_Compiler *, int __pyx_skip_dispatch);\n  void (*write)(struct __pyx_obj_9pywrapfst_Compiler *, PyObject *, int __pyx_skip_dispatch);\n};\nstatic struct __pyx_vtabstruct_9pywrapfst_Compiler *__pyx_vtabptr_9pywrapfst_Compiler;\n\n\n/* \"pywrapfst.pyx\":4215\n * \n * \n * cdef class FarReader(object):             # <<<<<<<<<<<<<<\n * \n *   \"\"\"\n */\n\nstruct __pyx_vtabstruct_9pywrapfst_FarReader {\n  std::string (*arc_type)(struct __pyx_obj_9pywrapfst_FarReader *, int __pyx_skip_dispatch);\n  bool (*done)(struct __pyx_obj_9pywrapfst_FarReader *, int __pyx_skip_dispatch);\n  bool (*error)(struct __pyx_obj_9pywrapfst_FarReader *, int __pyx_skip_dispatch);\n  std::string (*far_type)(struct __pyx_obj_9pywrapfst_FarReader *, int __pyx_skip_dispatch);\n  bool (*find)(struct __pyx_obj_9pywrapfst_FarReader *, PyObject *, int __pyx_skip_dispatch);\n  struct __pyx_obj_9pywrapfst__Fst *(*get_fst)(struct __pyx_obj_9pywrapfst_FarReader *, int __pyx_skip_dispatch);\n  std::string (*get_key)(struct __pyx_obj_9pywrapfst_FarReader *, int __pyx_skip_dispatch);\n  void (*next)(struct __pyx_obj_9pywrapfst_FarReader *, int __pyx_skip_dispatch);\n  void (*reset)(struct __pyx_obj_9pywrapfst_FarReader *, int __pyx_skip_dispatch);\n};\nstatic struct __pyx_vtabstruct_9pywrapfst_FarReader *__pyx_vtabptr_9pywrapfst_FarReader;\n\n\n/* \"pywrapfst.pyx\":4360\n * \n * \n * cdef class FarWriter(object):             # <<<<<<<<<<<<<<\n * \n *   \"\"\"\n */\n\nstruct __pyx_vtabstruct_9pywrapfst_FarWriter {\n  std::string (*arc_type)(struct __pyx_obj_9pywrapfst_FarWriter *, int __pyx_skip_dispatch);\n  void (*close)(struct __pyx_obj_9pywrapfst_FarWriter *);\n  void (*add)(struct __pyx_obj_9pywrapfst_FarWriter *, PyObject *, struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch);\n  bool (*error)(struct __pyx_obj_9pywrapfst_FarWriter *, int __pyx_skip_dispatch);\n  std::string (*far_type)(struct __pyx_obj_9pywrapfst_FarWriter *, int __pyx_skip_dispatch);\n};\nstatic struct __pyx_vtabstruct_9pywrapfst_FarWriter *__pyx_vtabptr_9pywrapfst_FarWriter;\n\n/* --- Runtime support code (head) --- */\n/* Refnanny.proto */\n#ifndef CYTHON_REFNANNY\n  #define CYTHON_REFNANNY 0\n#endif\n#if CYTHON_REFNANNY\n  typedef struct {\n    void (*INCREF)(void*, PyObject*, int);\n    void (*DECREF)(void*, PyObject*, int);\n    void (*GOTREF)(void*, PyObject*, int);\n    void (*GIVEREF)(void*, PyObject*, int);\n    void* (*SetupContext)(const char*, int, const char*);\n    void (*FinishContext)(void**);\n  } __Pyx_RefNannyAPIStruct;\n  static __Pyx_RefNannyAPIStruct *__Pyx_RefNanny = NULL;\n  static __Pyx_RefNannyAPIStruct *__Pyx_RefNannyImportAPI(const char *modname);\n  #define __Pyx_RefNannyDeclarations void *__pyx_refnanny = NULL;\n#ifdef WITH_THREAD\n  #define __Pyx_RefNannySetupContext(name, acquire_gil)\\\n          if (acquire_gil) {\\\n              PyGILState_STATE __pyx_gilstate_save = PyGILState_Ensure();\\\n              __pyx_refnanny = __Pyx_RefNanny->SetupContext((name), __LINE__, __FILE__);\\\n              PyGILState_Release(__pyx_gilstate_save);\\\n          } else {\\\n              __pyx_refnanny = __Pyx_RefNanny->SetupContext((name), __LINE__, __FILE__);\\\n          }\n#else\n  #define __Pyx_RefNannySetupContext(name, acquire_gil)\\\n          __pyx_refnanny = __Pyx_RefNanny->SetupContext((name), __LINE__, __FILE__)\n#endif\n  #define __Pyx_RefNannyFinishContext()\\\n          __Pyx_RefNanny->FinishContext(&__pyx_refnanny)\n  #define __Pyx_INCREF(r)  __Pyx_RefNanny->INCREF(__pyx_refnanny, (PyObject *)(r), __LINE__)\n  #define __Pyx_DECREF(r)  __Pyx_RefNanny->DECREF(__pyx_refnanny, (PyObject *)(r), __LINE__)\n  #define __Pyx_GOTREF(r)  __Pyx_RefNanny->GOTREF(__pyx_refnanny, (PyObject *)(r), __LINE__)\n  #define __Pyx_GIVEREF(r) __Pyx_RefNanny->GIVEREF(__pyx_refnanny, (PyObject *)(r), __LINE__)\n  #define __Pyx_XINCREF(r)  do { if((r) != NULL) {__Pyx_INCREF(r); }} while(0)\n  #define __Pyx_XDECREF(r)  do { if((r) != NULL) {__Pyx_DECREF(r); }} while(0)\n  #define __Pyx_XGOTREF(r)  do { if((r) != NULL) {__Pyx_GOTREF(r); }} while(0)\n  #define __Pyx_XGIVEREF(r) do { if((r) != NULL) {__Pyx_GIVEREF(r);}} while(0)\n#else\n  #define __Pyx_RefNannyDeclarations\n  #define __Pyx_RefNannySetupContext(name, acquire_gil)\n  #define __Pyx_RefNannyFinishContext()\n  #define __Pyx_INCREF(r) Py_INCREF(r)\n  #define __Pyx_DECREF(r) Py_DECREF(r)\n  #define __Pyx_GOTREF(r)\n  #define __Pyx_GIVEREF(r)\n  #define __Pyx_XINCREF(r) Py_XINCREF(r)\n  #define __Pyx_XDECREF(r) Py_XDECREF(r)\n  #define __Pyx_XGOTREF(r)\n  #define __Pyx_XGIVEREF(r)\n#endif\n#define __Pyx_XDECREF_SET(r, v) do {\\\n        PyObject *tmp = (PyObject *) r;\\\n        r = v; __Pyx_XDECREF(tmp);\\\n    } while (0)\n#define __Pyx_DECREF_SET(r, v) do {\\\n        PyObject *tmp = (PyObject *) r;\\\n        r = v; __Pyx_DECREF(tmp);\\\n    } while (0)\n#define __Pyx_CLEAR(r)    do { PyObject* tmp = ((PyObject*)(r)); r = NULL; __Pyx_DECREF(tmp);} while(0)\n#define __Pyx_XCLEAR(r)   do { if((r) != NULL) {PyObject* tmp = ((PyObject*)(r)); r = NULL; __Pyx_DECREF(tmp);}} while(0)\n\n/* PyObjectGetAttrStr.proto */\n#if CYTHON_USE_TYPE_SLOTS\nstatic CYTHON_INLINE PyObject* __Pyx_PyObject_GetAttrStr(PyObject* obj, PyObject* attr_name) {\n    PyTypeObject* tp = Py_TYPE(obj);\n    if (likely(tp->tp_getattro))\n        return tp->tp_getattro(obj, attr_name);\n#if PY_MAJOR_VERSION < 3\n    if (likely(tp->tp_getattr))\n        return tp->tp_getattr(obj, PyString_AS_STRING(attr_name));\n#endif\n    return PyObject_GetAttr(obj, attr_name);\n}\n#else\n#define __Pyx_PyObject_GetAttrStr(o,n) PyObject_GetAttr(o,n)\n#endif\n\n/* GetBuiltinName.proto */\nstatic PyObject *__Pyx_GetBuiltinName(PyObject *name);\n\n/* PyCFunctionFastCall.proto */\n#if CYTHON_FAST_PYCCALL\nstatic CYTHON_INLINE PyObject *__Pyx_PyCFunction_FastCall(PyObject *func, PyObject **args, Py_ssize_t nargs);\n#else\n#define __Pyx_PyCFunction_FastCall(func, args, nargs)  (assert(0), NULL)\n#endif\n\n/* PyFunctionFastCall.proto */\n#if CYTHON_FAST_PYCALL\n#define __Pyx_PyFunction_FastCall(func, args, nargs)\\\n    __Pyx_PyFunction_FastCallDict((func), (args), (nargs), NULL)\n#if 1 || PY_VERSION_HEX < 0x030600B1\nstatic PyObject *__Pyx_PyFunction_FastCallDict(PyObject *func, PyObject **args, int nargs, PyObject *kwargs);\n#else\n#define __Pyx_PyFunction_FastCallDict(func, args, nargs, kwargs) _PyFunction_FastCallDict(func, args, nargs, kwargs)\n#endif\n#endif\n\n/* PyObjectCall.proto */\n#if CYTHON_COMPILING_IN_CPYTHON\nstatic CYTHON_INLINE PyObject* __Pyx_PyObject_Call(PyObject *func, PyObject *arg, PyObject *kw);\n#else\n#define __Pyx_PyObject_Call(func, arg, kw) PyObject_Call(func, arg, kw)\n#endif\n\n/* PyObjectCallMethO.proto */\n#if CYTHON_COMPILING_IN_CPYTHON\nstatic CYTHON_INLINE PyObject* __Pyx_PyObject_CallMethO(PyObject *func, PyObject *arg);\n#endif\n\n/* PyObjectCallOneArg.proto */\nstatic CYTHON_INLINE PyObject* __Pyx_PyObject_CallOneArg(PyObject *func, PyObject *arg);\n\n/* GetModuleGlobalName.proto */\nstatic CYTHON_INLINE PyObject *__Pyx_GetModuleGlobalName(PyObject *name);\n\n/* PyThreadStateGet.proto */\n#if CYTHON_FAST_THREAD_STATE\n#define __Pyx_PyThreadState_declare  PyThreadState *__pyx_tstate;\n#define __Pyx_PyThreadState_assign  __pyx_tstate = __Pyx_PyThreadState_Current;\n#define __Pyx_PyErr_Occurred()  __pyx_tstate->curexc_type\n#else\n#define __Pyx_PyThreadState_declare\n#define __Pyx_PyThreadState_assign\n#define __Pyx_PyErr_Occurred()  PyErr_Occurred()\n#endif\n\n/* PyErrFetchRestore.proto */\n#if CYTHON_FAST_THREAD_STATE\n#define __Pyx_PyErr_Clear() __Pyx_ErrRestore(NULL, NULL, NULL)\n#define __Pyx_ErrRestoreWithState(type, value, tb)  __Pyx_ErrRestoreInState(PyThreadState_GET(), type, value, tb)\n#define __Pyx_ErrFetchWithState(type, value, tb)    __Pyx_ErrFetchInState(PyThreadState_GET(), type, value, tb)\n#define __Pyx_ErrRestore(type, value, tb)  __Pyx_ErrRestoreInState(__pyx_tstate, type, value, tb)\n#define __Pyx_ErrFetch(type, value, tb)    __Pyx_ErrFetchInState(__pyx_tstate, type, value, tb)\nstatic CYTHON_INLINE void __Pyx_ErrRestoreInState(PyThreadState *tstate, PyObject *type, PyObject *value, PyObject *tb);\nstatic CYTHON_INLINE void __Pyx_ErrFetchInState(PyThreadState *tstate, PyObject **type, PyObject **value, PyObject **tb);\n#if CYTHON_COMPILING_IN_CPYTHON\n#define __Pyx_PyErr_SetNone(exc) (Py_INCREF(exc), __Pyx_ErrRestore((exc), NULL, NULL))\n#else\n#define __Pyx_PyErr_SetNone(exc) PyErr_SetNone(exc)\n#endif\n#else\n#define __Pyx_PyErr_Clear() PyErr_Clear()\n#define __Pyx_PyErr_SetNone(exc) PyErr_SetNone(exc)\n#define __Pyx_ErrRestoreWithState(type, value, tb)  PyErr_Restore(type, value, tb)\n#define __Pyx_ErrFetchWithState(type, value, tb)  PyErr_Fetch(type, value, tb)\n#define __Pyx_ErrRestoreInState(tstate, type, value, tb)  PyErr_Restore(type, value, tb)\n#define __Pyx_ErrFetchInState(tstate, type, value, tb)  PyErr_Fetch(type, value, tb)\n#define __Pyx_ErrRestore(type, value, tb)  PyErr_Restore(type, value, tb)\n#define __Pyx_ErrFetch(type, value, tb)  PyErr_Fetch(type, value, tb)\n#endif\n\n/* RaiseException.proto */\nstatic void __Pyx_Raise(PyObject *type, PyObject *value, PyObject *tb, PyObject *cause);\n\n/* RaiseArgTupleInvalid.proto */\nstatic void __Pyx_RaiseArgtupleInvalid(const char* func_name, int exact,\n    Py_ssize_t num_min, Py_ssize_t num_max, Py_ssize_t num_found);\n\n/* RaiseDoubleKeywords.proto */\nstatic void __Pyx_RaiseDoubleKeywordsError(const char* func_name, PyObject* kw_name);\n\n/* ParseKeywords.proto */\nstatic int __Pyx_ParseOptionalKeywords(PyObject *kwds, PyObject **argnames[],\\\n    PyObject *kwds2, PyObject *values[], Py_ssize_t num_pos_args,\\\n    const char* function_name);\n\n/* PyObjectCallNoArg.proto */\n#if CYTHON_COMPILING_IN_CPYTHON\nstatic CYTHON_INLINE PyObject* __Pyx_PyObject_CallNoArg(PyObject *func);\n#else\n#define __Pyx_PyObject_CallNoArg(func) __Pyx_PyObject_Call(func, __pyx_empty_tuple, NULL)\n#endif\n\n/* ExtTypeTest.proto */\nstatic CYTHON_INLINE int __Pyx_TypeTest(PyObject *obj, PyTypeObject *type);\n\n/* ArgTypeTest.proto */\n#define __Pyx_ArgTypeTest(obj, type, none_allowed, name, exact)\\\n    ((likely((Py_TYPE(obj) == type) | (none_allowed && (obj == Py_None)))) ? 1 :\\\n        __Pyx__ArgTypeTest(obj, type, name, exact))\nstatic int __Pyx__ArgTypeTest(PyObject *obj, PyTypeObject *type, const char *name, int exact);\n\n/* WriteUnraisableException.proto */\nstatic void __Pyx_WriteUnraisable(const char *name, int clineno,\n                                  int lineno, const char *filename,\n                                  int full_traceback, int nogil);\n\n/* KeywordStringCheck.proto */\nstatic int __Pyx_CheckKeywordStrings(PyObject *kwdict, const char* function_name, int kw_allowed);\n\n/* SaveResetException.proto */\n#if CYTHON_FAST_THREAD_STATE\n#define __Pyx_ExceptionSave(type, value, tb)  __Pyx__ExceptionSave(__pyx_tstate, type, value, tb)\nstatic CYTHON_INLINE void __Pyx__ExceptionSave(PyThreadState *tstate, PyObject **type, PyObject **value, PyObject **tb);\n#define __Pyx_ExceptionReset(type, value, tb)  __Pyx__ExceptionReset(__pyx_tstate, type, value, tb)\nstatic CYTHON_INLINE void __Pyx__ExceptionReset(PyThreadState *tstate, PyObject *type, PyObject *value, PyObject *tb);\n#else\n#define __Pyx_ExceptionSave(type, value, tb)   PyErr_GetExcInfo(type, value, tb)\n#define __Pyx_ExceptionReset(type, value, tb)  PyErr_SetExcInfo(type, value, tb)\n#endif\n\n/* PyErrExceptionMatches.proto */\n#if CYTHON_FAST_THREAD_STATE\n#define __Pyx_PyErr_ExceptionMatches(err) __Pyx_PyErr_ExceptionMatchesInState(__pyx_tstate, err)\nstatic CYTHON_INLINE int __Pyx_PyErr_ExceptionMatchesInState(PyThreadState* tstate, PyObject* err);\n#else\n#define __Pyx_PyErr_ExceptionMatches(err)  PyErr_ExceptionMatches(err)\n#endif\n\n/* GetException.proto */\n#if CYTHON_FAST_THREAD_STATE\n#define __Pyx_GetException(type, value, tb)  __Pyx__GetException(__pyx_tstate, type, value, tb)\nstatic int __Pyx__GetException(PyThreadState *tstate, PyObject **type, PyObject **value, PyObject **tb);\n#else\nstatic int __Pyx_GetException(PyObject **type, PyObject **value, PyObject **tb);\n#endif\n\n/* RaiseTooManyValuesToUnpack.proto */\nstatic CYTHON_INLINE void __Pyx_RaiseTooManyValuesError(Py_ssize_t expected);\n\n/* RaiseNeedMoreValuesToUnpack.proto */\nstatic CYTHON_INLINE void __Pyx_RaiseNeedMoreValuesError(Py_ssize_t index);\n\n/* IterFinish.proto */\nstatic CYTHON_INLINE int __Pyx_IterFinish(void);\n\n/* UnpackItemEndCheck.proto */\nstatic int __Pyx_IternextUnpackEndCheck(PyObject *retval, Py_ssize_t expected);\n\n/* IterNext.proto */\n#define __Pyx_PyIter_Next(obj) __Pyx_PyIter_Next2(obj, NULL)\nstatic CYTHON_INLINE PyObject *__Pyx_PyIter_Next2(PyObject *, PyObject *);\n\n/* ListCompAppend.proto */\n#if CYTHON_USE_PYLIST_INTERNALS && CYTHON_ASSUME_SAFE_MACROS\nstatic CYTHON_INLINE int __Pyx_ListComp_Append(PyObject* list, PyObject* x) {\n    PyListObject* L = (PyListObject*) list;\n    Py_ssize_t len = Py_SIZE(list);\n    if (likely(L->allocated > len)) {\n        Py_INCREF(x);\n        PyList_SET_ITEM(list, len, x);\n        Py_SIZE(list) = len+1;\n        return 0;\n    }\n    return PyList_Append(list, x);\n}\n#else\n#define __Pyx_ListComp_Append(L,x) PyList_Append(L,x)\n#endif\n\n/* SetVTable.proto */\nstatic int __Pyx_SetVtable(PyObject *dict, void *vtable);\n\n/* SetupReduce.proto */\nstatic int __Pyx_setup_reduce(PyObject* type_obj);\n\n/* Import.proto */\nstatic PyObject *__Pyx_Import(PyObject *name, PyObject *from_list, int level);\n\n/* CalculateMetaclass.proto */\nstatic PyObject *__Pyx_CalculateMetaclass(PyTypeObject *metaclass, PyObject *bases);\n\n/* Py3ClassCreate.proto */\nstatic PyObject *__Pyx_Py3MetaclassPrepare(PyObject *metaclass, PyObject *bases, PyObject *name, PyObject *qualname,\n                                           PyObject *mkw, PyObject *modname, PyObject *doc);\nstatic PyObject *__Pyx_Py3ClassCreate(PyObject *metaclass, PyObject *name, PyObject *bases, PyObject *dict,\n                                      PyObject *mkw, int calculate_metaclass, int allow_py2_metaclass);\n\n/* GetNameInClass.proto */\nstatic PyObject *__Pyx_GetNameInClass(PyObject *nmspace, PyObject *name);\n\n/* ClassMethod.proto */\n#include \"descrobject.h\"\nstatic PyObject* __Pyx_Method_ClassMethod(PyObject *method);\n\n/* FetchCommonType.proto */\nstatic PyTypeObject* __Pyx_FetchCommonType(PyTypeObject* type);\n\n/* CythonFunction.proto */\n#define __Pyx_CyFunction_USED 1\n#include <structmember.h>\n#define __Pyx_CYFUNCTION_STATICMETHOD  0x01\n#define __Pyx_CYFUNCTION_CLASSMETHOD   0x02\n#define __Pyx_CYFUNCTION_CCLASS        0x04\n#define __Pyx_CyFunction_GetClosure(f)\\\n    (((__pyx_CyFunctionObject *) (f))->func_closure)\n#define __Pyx_CyFunction_GetClassObj(f)\\\n    (((__pyx_CyFunctionObject *) (f))->func_classobj)\n#define __Pyx_CyFunction_Defaults(type, f)\\\n    ((type *)(((__pyx_CyFunctionObject *) (f))->defaults))\n#define __Pyx_CyFunction_SetDefaultsGetter(f, g)\\\n    ((__pyx_CyFunctionObject *) (f))->defaults_getter = (g)\ntypedef struct {\n    PyCFunctionObject func;\n#if PY_VERSION_HEX < 0x030500A0\n    PyObject *func_weakreflist;\n#endif\n    PyObject *func_dict;\n    PyObject *func_name;\n    PyObject *func_qualname;\n    PyObject *func_doc;\n    PyObject *func_globals;\n    PyObject *func_code;\n    PyObject *func_closure;\n    PyObject *func_classobj;\n    void *defaults;\n    int defaults_pyobjects;\n    int flags;\n    PyObject *defaults_tuple;\n    PyObject *defaults_kwdict;\n    PyObject *(*defaults_getter)(PyObject *);\n    PyObject *func_annotations;\n} __pyx_CyFunctionObject;\nstatic PyTypeObject *__pyx_CyFunctionType = 0;\n#define __Pyx_CyFunction_NewEx(ml, flags, qualname, self, module, globals, code)\\\n    __Pyx_CyFunction_New(__pyx_CyFunctionType, ml, flags, qualname, self, module, globals, code)\nstatic PyObject *__Pyx_CyFunction_New(PyTypeObject *, PyMethodDef *ml,\n                                      int flags, PyObject* qualname,\n                                      PyObject *self,\n                                      PyObject *module, PyObject *globals,\n                                      PyObject* code);\nstatic CYTHON_INLINE void *__Pyx_CyFunction_InitDefaults(PyObject *m,\n                                                         size_t size,\n                                                         int pyobjects);\nstatic CYTHON_INLINE void __Pyx_CyFunction_SetDefaultsTuple(PyObject *m,\n                                                            PyObject *tuple);\nstatic CYTHON_INLINE void __Pyx_CyFunction_SetDefaultsKwDict(PyObject *m,\n                                                             PyObject *dict);\nstatic CYTHON_INLINE void __Pyx_CyFunction_SetAnnotationsDict(PyObject *m,\n                                                              PyObject *dict);\nstatic int __pyx_CyFunction_init(void);\n\n/* CLineInTraceback.proto */\n#ifdef CYTHON_CLINE_IN_TRACEBACK\n#define __Pyx_CLineForTraceback(tstate, c_line)  (((CYTHON_CLINE_IN_TRACEBACK)) ? c_line : 0)\n#else\nstatic int __Pyx_CLineForTraceback(PyThreadState *tstate, int c_line);\n#endif\n\n/* CodeObjectCache.proto */\ntypedef struct {\n    PyCodeObject* code_object;\n    int code_line;\n} __Pyx_CodeObjectCacheEntry;\nstruct __Pyx_CodeObjectCache {\n    int count;\n    int max_count;\n    __Pyx_CodeObjectCacheEntry* entries;\n};\nstatic struct __Pyx_CodeObjectCache __pyx_code_cache = {0,0,NULL};\nstatic int __pyx_bisect_code_objects(__Pyx_CodeObjectCacheEntry* entries, int count, int code_line);\nstatic PyCodeObject *__pyx_find_code_object(int code_line);\nstatic void __pyx_insert_code_object(int code_line, PyCodeObject* code_object);\n\n/* AddTraceback.proto */\nstatic void __Pyx_AddTraceback(const char *funcname, int c_line,\n                               int py_line, const char *filename);\n\n/* None.proto */\n#include <new>\n\n/* CIntToPy.proto */\nstatic CYTHON_INLINE PyObject* __Pyx_PyInt_From_int(int value);\n\n/* CIntToPy.proto */\nstatic CYTHON_INLINE PyObject* __Pyx_PyInt_From_uint64_t(uint64_t value);\n\n/* CIntToPy.proto */\nstatic CYTHON_INLINE PyObject* __Pyx_PyInt_From_uint32_t(uint32_t value);\n\n/* CIntToPy.proto */\nstatic CYTHON_INLINE PyObject* __Pyx_PyInt_From_int64_t(int64_t value);\n\n/* CIntToPy.proto */\nstatic CYTHON_INLINE PyObject* __Pyx_PyInt_From_int32_t(int32_t value);\n\n/* CppExceptionConversion.proto */\n#ifndef __Pyx_CppExn2PyErr\n#include <new>\n#include <typeinfo>\n#include <stdexcept>\n#include <ios>\nstatic void __Pyx_CppExn2PyErr() {\n  try {\n    if (PyErr_Occurred())\n      ; // let the latest Python exn pass through and ignore the current one\n    else\n      throw;\n  } catch (const std::bad_alloc& exn) {\n    PyErr_SetString(PyExc_MemoryError, exn.what());\n  } catch (const std::bad_cast& exn) {\n    PyErr_SetString(PyExc_TypeError, exn.what());\n  } catch (const std::bad_typeid& exn) {\n    PyErr_SetString(PyExc_TypeError, exn.what());\n  } catch (const std::domain_error& exn) {\n    PyErr_SetString(PyExc_ValueError, exn.what());\n  } catch (const std::invalid_argument& exn) {\n    PyErr_SetString(PyExc_ValueError, exn.what());\n  } catch (const std::ios_base::failure& exn) {\n    PyErr_SetString(PyExc_IOError, exn.what());\n  } catch (const std::out_of_range& exn) {\n    PyErr_SetString(PyExc_IndexError, exn.what());\n  } catch (const std::overflow_error& exn) {\n    PyErr_SetString(PyExc_OverflowError, exn.what());\n  } catch (const std::range_error& exn) {\n    PyErr_SetString(PyExc_ArithmeticError, exn.what());\n  } catch (const std::underflow_error& exn) {\n    PyErr_SetString(PyExc_ArithmeticError, exn.what());\n  } catch (const std::exception& exn) {\n    PyErr_SetString(PyExc_RuntimeError, exn.what());\n  }\n  catch (...)\n  {\n    PyErr_SetString(PyExc_RuntimeError, \"Unknown exception\");\n  }\n}\n#endif\n\n/* CIntFromPy.proto */\nstatic CYTHON_INLINE size_t __Pyx_PyInt_As_size_t(PyObject *);\n\n/* CIntFromPy.proto */\nstatic CYTHON_INLINE int64_t __Pyx_PyInt_As_int64_t(PyObject *);\n\n/* CIntFromPy.proto */\nstatic CYTHON_INLINE uint64_t __Pyx_PyInt_As_uint64_t(PyObject *);\n\n/* CIntFromPy.proto */\nstatic CYTHON_INLINE int32_t __Pyx_PyInt_As_int32_t(PyObject *);\n\n/* CIntFromPy.proto */\nstatic CYTHON_INLINE uint32_t __Pyx_PyInt_As_uint32_t(PyObject *);\n\n/* CIntFromPy.proto */\nstatic CYTHON_INLINE time_t __Pyx_PyInt_As_time_t(PyObject *);\n\n/* CIntToPy.proto */\nstatic CYTHON_INLINE PyObject* __Pyx_PyInt_From_long(long value);\n\n/* CIntFromPy.proto */\nstatic CYTHON_INLINE long __Pyx_PyInt_As_long(PyObject *);\n\n/* CIntFromPy.proto */\nstatic CYTHON_INLINE int __Pyx_PyInt_As_int(PyObject *);\n\n/* FastTypeChecks.proto */\n#if CYTHON_COMPILING_IN_CPYTHON\n#define __Pyx_TypeCheck(obj, type) __Pyx_IsSubtype(Py_TYPE(obj), (PyTypeObject *)type)\nstatic CYTHON_INLINE int __Pyx_IsSubtype(PyTypeObject *a, PyTypeObject *b);\nstatic CYTHON_INLINE int __Pyx_PyErr_GivenExceptionMatches(PyObject *err, PyObject *type);\nstatic CYTHON_INLINE int __Pyx_PyErr_GivenExceptionMatches2(PyObject *err, PyObject *type1, PyObject *type2);\n#else\n#define __Pyx_TypeCheck(obj, type) PyObject_TypeCheck(obj, (PyTypeObject *)type)\n#define __Pyx_PyErr_GivenExceptionMatches(err, type) PyErr_GivenExceptionMatches(err, type)\n#define __Pyx_PyErr_GivenExceptionMatches2(err, type1, type2) (PyErr_GivenExceptionMatches(err, type1) || PyErr_GivenExceptionMatches(err, type2))\n#endif\n\n/* CheckBinaryVersion.proto */\nstatic int __Pyx_check_binary_version(void);\n\n/* FunctionExport.proto */\nstatic int __Pyx_ExportFunction(const char *name, void (*f)(void), const char *sig);\n\n/* InitStrings.proto */\nstatic int __Pyx_InitStrings(__Pyx_StringTabEntry *t);\n\nstatic void __pyx_f_9pywrapfst_6Weight__check_weight(struct __pyx_obj_9pywrapfst_Weight *__pyx_v_self); /* proto*/\nstatic struct __pyx_obj_9pywrapfst_Weight *__pyx_f_9pywrapfst_6Weight_copy(struct __pyx_obj_9pywrapfst_Weight *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic std::string __pyx_f_9pywrapfst_6Weight_to_string(struct __pyx_obj_9pywrapfst_Weight *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic std::string __pyx_f_9pywrapfst_6Weight_type(struct __pyx_obj_9pywrapfst_Weight *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic __pyx_t_10basictypes_int64 __pyx_f_9pywrapfst_12_SymbolTable_available_key(struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic std::string __pyx_f_9pywrapfst_12_SymbolTable_checksum(struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic struct __pyx_obj_9pywrapfst_SymbolTable *__pyx_f_9pywrapfst_12_SymbolTable_copy(struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic __pyx_t_10basictypes_int64 __pyx_f_9pywrapfst_12_SymbolTable_get_nth_key(struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_self, Py_ssize_t __pyx_v_pos, int __pyx_skip_dispatch); /* proto*/\nstatic std::string __pyx_f_9pywrapfst_12_SymbolTable_labeled_checksum(struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic bool __pyx_f_9pywrapfst_12_SymbolTable_member(struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_self, PyObject *__pyx_v_key, int __pyx_skip_dispatch); /* proto*/\nstatic std::string __pyx_f_9pywrapfst_12_SymbolTable_name(struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic size_t __pyx_f_9pywrapfst_12_SymbolTable_num_symbols(struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic void __pyx_f_9pywrapfst_12_SymbolTable_write(struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_self, PyObject *__pyx_v_filename, int __pyx_skip_dispatch); /* proto*/\nstatic void __pyx_f_9pywrapfst_12_SymbolTable_write_text(struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_self, PyObject *__pyx_v_filename, int __pyx_skip_dispatch); /* proto*/\nstatic __pyx_t_10basictypes_int64 __pyx_f_9pywrapfst_19_MutableSymbolTable_add_symbol(struct __pyx_obj_9pywrapfst__MutableSymbolTable *__pyx_v_self, PyObject *__pyx_v_symbol, int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_19_MutableSymbolTable_add_symbol *__pyx_optional_args); /* proto*/\nstatic void __pyx_f_9pywrapfst_19_MutableSymbolTable_add_table(struct __pyx_obj_9pywrapfst__MutableSymbolTable *__pyx_v_self, struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_syms, int __pyx_skip_dispatch); /* proto*/\nstatic void __pyx_f_9pywrapfst_19_MutableSymbolTable_set_name(struct __pyx_obj_9pywrapfst__MutableSymbolTable *__pyx_v_self, PyObject *__pyx_v_new_name, int __pyx_skip_dispatch); /* proto*/\nstatic bool __pyx_f_9pywrapfst_19SymbolTableIterator_done(struct __pyx_obj_9pywrapfst_SymbolTableIterator *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic void __pyx_f_9pywrapfst_19SymbolTableIterator_next(struct __pyx_obj_9pywrapfst_SymbolTableIterator *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic void __pyx_f_9pywrapfst_19SymbolTableIterator_reset(struct __pyx_obj_9pywrapfst_SymbolTableIterator *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic std::string __pyx_f_9pywrapfst_19SymbolTableIterator_symbol(struct __pyx_obj_9pywrapfst_SymbolTableIterator *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic __pyx_t_10basictypes_int64 __pyx_f_9pywrapfst_19SymbolTableIterator_value(struct __pyx_obj_9pywrapfst_SymbolTableIterator *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic std::string __pyx_f_9pywrapfst_12EncodeMapper_arc_type(struct __pyx_obj_9pywrapfst_EncodeMapper *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic __pyx_t_10basictypes_uint32 __pyx_f_9pywrapfst_12EncodeMapper_flags(struct __pyx_obj_9pywrapfst_EncodeMapper *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic struct __pyx_obj_9pywrapfst__EncodeMapperSymbolTable *__pyx_f_9pywrapfst_12EncodeMapper_input_symbols(struct __pyx_obj_9pywrapfst_EncodeMapper *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic struct __pyx_obj_9pywrapfst__EncodeMapperSymbolTable *__pyx_f_9pywrapfst_12EncodeMapper_output_symbols(struct __pyx_obj_9pywrapfst_EncodeMapper *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic __pyx_t_10basictypes_uint64 __pyx_f_9pywrapfst_12EncodeMapper_properties(struct __pyx_obj_9pywrapfst_EncodeMapper *__pyx_v_self, __pyx_t_10basictypes_uint64 __pyx_v_mask, int __pyx_skip_dispatch); /* proto*/\nstatic void __pyx_f_9pywrapfst_12EncodeMapper_set_input_symbols(struct __pyx_obj_9pywrapfst_EncodeMapper *__pyx_v_self, struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_syms, int __pyx_skip_dispatch); /* proto*/\nstatic void __pyx_f_9pywrapfst_12EncodeMapper_set_output_symbols(struct __pyx_obj_9pywrapfst_EncodeMapper *__pyx_v_self, struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_syms, int __pyx_skip_dispatch); /* proto*/\nstatic std::string __pyx_f_9pywrapfst_12EncodeMapper_weight_type(struct __pyx_obj_9pywrapfst_EncodeMapper *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic std::string __pyx_f_9pywrapfst_4_Fst_arc_type(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic struct __pyx_obj_9pywrapfst_ArcIterator *__pyx_f_9pywrapfst_4_Fst_arcs(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self, __pyx_t_10basictypes_int64 __pyx_v_state, int __pyx_skip_dispatch); /* proto*/\nstatic struct __pyx_obj_9pywrapfst__Fst *__pyx_f_9pywrapfst_4_Fst_copy(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic void __pyx_f_9pywrapfst_4_Fst_draw(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self, PyObject *__pyx_v_filename, int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_4_Fst_draw *__pyx_optional_args); /* proto*/\nstatic struct __pyx_obj_9pywrapfst_Weight *__pyx_f_9pywrapfst_4_Fst_final(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self, __pyx_t_10basictypes_int64 __pyx_v_state, int __pyx_skip_dispatch); /* proto*/\nstatic std::string __pyx_f_9pywrapfst_4_Fst_fst_type(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic struct __pyx_obj_9pywrapfst__FstSymbolTable *__pyx_f_9pywrapfst_4_Fst_input_symbols(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic size_t __pyx_f_9pywrapfst_4_Fst_num_arcs(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self, __pyx_t_10basictypes_int64 __pyx_v_state, int __pyx_skip_dispatch); /* proto*/\nstatic size_t __pyx_f_9pywrapfst_4_Fst_num_input_epsilons(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self, __pyx_t_10basictypes_int64 __pyx_v_state, int __pyx_skip_dispatch); /* proto*/\nstatic size_t __pyx_f_9pywrapfst_4_Fst_num_output_epsilons(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self, __pyx_t_10basictypes_int64 __pyx_v_state, int __pyx_skip_dispatch); /* proto*/\nstatic struct __pyx_obj_9pywrapfst__FstSymbolTable *__pyx_f_9pywrapfst_4_Fst_output_symbols(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic __pyx_t_10basictypes_uint64 __pyx_f_9pywrapfst_4_Fst_properties(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self, __pyx_t_10basictypes_uint64 __pyx_v_mask, bool __pyx_v_test, int __pyx_skip_dispatch); /* proto*/\nstatic __pyx_t_10basictypes_int64 __pyx_f_9pywrapfst_4_Fst_start(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic struct __pyx_obj_9pywrapfst_StateIterator *__pyx_f_9pywrapfst_4_Fst_states(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic std::string __pyx_f_9pywrapfst_4_Fst_text(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self, int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_4_Fst_text *__pyx_optional_args); /* proto*/\nstatic bool __pyx_f_9pywrapfst_4_Fst_verify(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic std::string __pyx_f_9pywrapfst_4_Fst_weight_type(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic void __pyx_f_9pywrapfst_4_Fst_write(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self, PyObject *__pyx_v_filename, int __pyx_skip_dispatch); /* proto*/\nstatic std::string __pyx_f_9pywrapfst_4_Fst_write_to_string(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic void __pyx_f_9pywrapfst_11_MutableFst__check_mutating_imethod(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self); /* proto*/\nstatic void __pyx_f_9pywrapfst_11_MutableFst__add_arc(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, __pyx_t_10basictypes_int64 __pyx_v_state, struct __pyx_obj_9pywrapfst_Arc *__pyx_v_arc); /* proto*/\nstatic __pyx_t_10basictypes_int64 __pyx_f_9pywrapfst_11_MutableFst_add_state(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic void __pyx_f_9pywrapfst_11_MutableFst__arcsort(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, struct __pyx_opt_args_9pywrapfst_11_MutableFst__arcsort *__pyx_optional_args); /* proto*/\nstatic void __pyx_f_9pywrapfst_11_MutableFst__closure(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, struct __pyx_opt_args_9pywrapfst_11_MutableFst__closure *__pyx_optional_args); /* proto*/\nstatic void __pyx_f_9pywrapfst_11_MutableFst__concat(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst); /* proto*/\nstatic void __pyx_f_9pywrapfst_11_MutableFst__connect(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self); /* proto*/\nstatic void __pyx_f_9pywrapfst_11_MutableFst__decode(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, struct __pyx_obj_9pywrapfst_EncodeMapper *__pyx_v_encoder); /* proto*/\nstatic void __pyx_f_9pywrapfst_11_MutableFst__delete_arcs(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, __pyx_t_10basictypes_int64 __pyx_v_state, struct __pyx_opt_args_9pywrapfst_11_MutableFst__delete_arcs *__pyx_optional_args); /* proto*/\nstatic void __pyx_f_9pywrapfst_11_MutableFst__delete_states(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, struct __pyx_opt_args_9pywrapfst_11_MutableFst__delete_states *__pyx_optional_args); /* proto*/\nstatic void __pyx_f_9pywrapfst_11_MutableFst__encode(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, struct __pyx_obj_9pywrapfst_EncodeMapper *__pyx_v_encoder); /* proto*/\nstatic void __pyx_f_9pywrapfst_11_MutableFst__invert(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self); /* proto*/\nstatic void __pyx_f_9pywrapfst_11_MutableFst__minimize(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, struct __pyx_opt_args_9pywrapfst_11_MutableFst__minimize *__pyx_optional_args); /* proto*/\nstatic struct __pyx_obj_9pywrapfst_MutableArcIterator *__pyx_f_9pywrapfst_11_MutableFst_mutable_arcs(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, __pyx_t_10basictypes_int64 __pyx_v_state, int __pyx_skip_dispatch); /* proto*/\nstatic __pyx_t_10basictypes_int64 __pyx_f_9pywrapfst_11_MutableFst_num_states(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic void __pyx_f_9pywrapfst_11_MutableFst__project(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, struct __pyx_opt_args_9pywrapfst_11_MutableFst__project *__pyx_optional_args); /* proto*/\nstatic void __pyx_f_9pywrapfst_11_MutableFst__prune(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, struct __pyx_opt_args_9pywrapfst_11_MutableFst__prune *__pyx_optional_args); /* proto*/\nstatic void __pyx_f_9pywrapfst_11_MutableFst__push(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, struct __pyx_opt_args_9pywrapfst_11_MutableFst__push *__pyx_optional_args); /* proto*/\nstatic void __pyx_f_9pywrapfst_11_MutableFst__relabel_pairs(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, struct __pyx_opt_args_9pywrapfst_11_MutableFst__relabel_pairs *__pyx_optional_args); /* proto*/\nstatic void __pyx_f_9pywrapfst_11_MutableFst__relabel_tables(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, struct __pyx_opt_args_9pywrapfst_11_MutableFst__relabel_tables *__pyx_optional_args); /* proto*/\nstatic void __pyx_f_9pywrapfst_11_MutableFst__reserve_arcs(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, __pyx_t_10basictypes_int64 __pyx_v_state, size_t __pyx_v_n); /* proto*/\nstatic void __pyx_f_9pywrapfst_11_MutableFst__reserve_states(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, __pyx_t_10basictypes_int64 __pyx_v_n); /* proto*/\nstatic void __pyx_f_9pywrapfst_11_MutableFst__reweight(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, PyObject *__pyx_v_potentials, struct __pyx_opt_args_9pywrapfst_11_MutableFst__reweight *__pyx_optional_args); /* proto*/\nstatic void __pyx_f_9pywrapfst_11_MutableFst__rmepsilon(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, struct __pyx_opt_args_9pywrapfst_11_MutableFst__rmepsilon *__pyx_optional_args); /* proto*/\nstatic void __pyx_f_9pywrapfst_11_MutableFst__set_final(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, __pyx_t_10basictypes_int64 __pyx_v_state, struct __pyx_opt_args_9pywrapfst_11_MutableFst__set_final *__pyx_optional_args); /* proto*/\nstatic void __pyx_f_9pywrapfst_11_MutableFst__set_input_symbols(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_syms); /* proto*/\nstatic void __pyx_f_9pywrapfst_11_MutableFst__set_output_symbols(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_syms); /* proto*/\nstatic void __pyx_f_9pywrapfst_11_MutableFst__set_properties(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, __pyx_t_10basictypes_uint64 __pyx_v_props, __pyx_t_10basictypes_uint64 __pyx_v_mask); /* proto*/\nstatic void __pyx_f_9pywrapfst_11_MutableFst__set_start(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, __pyx_t_10basictypes_int64 __pyx_v_state); /* proto*/\nstatic void __pyx_f_9pywrapfst_11_MutableFst__topsort(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self); /* proto*/\nstatic void __pyx_f_9pywrapfst_11_MutableFst__union(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst); /* proto*/\nstatic struct __pyx_obj_9pywrapfst_Arc *__pyx_f_9pywrapfst_3Arc_copy(struct __pyx_obj_9pywrapfst_Arc *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic bool __pyx_f_9pywrapfst_11ArcIterator_done(struct __pyx_obj_9pywrapfst_ArcIterator *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic __pyx_t_10basictypes_uint32 __pyx_f_9pywrapfst_11ArcIterator_flags(struct __pyx_obj_9pywrapfst_ArcIterator *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic void __pyx_f_9pywrapfst_11ArcIterator_next(struct __pyx_obj_9pywrapfst_ArcIterator *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic size_t __pyx_f_9pywrapfst_11ArcIterator_position(struct __pyx_obj_9pywrapfst_ArcIterator *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic void __pyx_f_9pywrapfst_11ArcIterator_reset(struct __pyx_obj_9pywrapfst_ArcIterator *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic void __pyx_f_9pywrapfst_11ArcIterator_seek(struct __pyx_obj_9pywrapfst_ArcIterator *__pyx_v_self, size_t __pyx_v_a, int __pyx_skip_dispatch); /* proto*/\nstatic void __pyx_f_9pywrapfst_11ArcIterator_set_flags(struct __pyx_obj_9pywrapfst_ArcIterator *__pyx_v_self, __pyx_t_10basictypes_uint32 __pyx_v_flags, __pyx_t_10basictypes_uint32 __pyx_v_mask, int __pyx_skip_dispatch); /* proto*/\nstatic PyObject *__pyx_f_9pywrapfst_11ArcIterator_value(struct __pyx_obj_9pywrapfst_ArcIterator *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic bool __pyx_f_9pywrapfst_18MutableArcIterator_done(struct __pyx_obj_9pywrapfst_MutableArcIterator *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic __pyx_t_10basictypes_uint32 __pyx_f_9pywrapfst_18MutableArcIterator_flags(struct __pyx_obj_9pywrapfst_MutableArcIterator *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic void __pyx_f_9pywrapfst_18MutableArcIterator_next(struct __pyx_obj_9pywrapfst_MutableArcIterator *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic size_t __pyx_f_9pywrapfst_18MutableArcIterator_position(struct __pyx_obj_9pywrapfst_MutableArcIterator *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic void __pyx_f_9pywrapfst_18MutableArcIterator_reset(struct __pyx_obj_9pywrapfst_MutableArcIterator *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic void __pyx_f_9pywrapfst_18MutableArcIterator_seek(struct __pyx_obj_9pywrapfst_MutableArcIterator *__pyx_v_self, size_t __pyx_v_a, int __pyx_skip_dispatch); /* proto*/\nstatic void __pyx_f_9pywrapfst_18MutableArcIterator_set_flags(struct __pyx_obj_9pywrapfst_MutableArcIterator *__pyx_v_self, __pyx_t_10basictypes_uint32 __pyx_v_flags, __pyx_t_10basictypes_uint32 __pyx_v_mask, int __pyx_skip_dispatch); /* proto*/\nstatic void __pyx_f_9pywrapfst_18MutableArcIterator_set_value(struct __pyx_obj_9pywrapfst_MutableArcIterator *__pyx_v_self, struct __pyx_obj_9pywrapfst_Arc *__pyx_v_arc, int __pyx_skip_dispatch); /* proto*/\nstatic PyObject *__pyx_f_9pywrapfst_18MutableArcIterator_value(struct __pyx_obj_9pywrapfst_MutableArcIterator *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic bool __pyx_f_9pywrapfst_13StateIterator_done(struct __pyx_obj_9pywrapfst_StateIterator *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic void __pyx_f_9pywrapfst_13StateIterator_next(struct __pyx_obj_9pywrapfst_StateIterator *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic void __pyx_f_9pywrapfst_13StateIterator_reset(struct __pyx_obj_9pywrapfst_StateIterator *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic __pyx_t_10basictypes_int64 __pyx_f_9pywrapfst_13StateIterator_value(struct __pyx_obj_9pywrapfst_StateIterator *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic struct __pyx_obj_9pywrapfst__Fst *__pyx_f_9pywrapfst_8Compiler_compile(struct __pyx_obj_9pywrapfst_Compiler *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic void __pyx_f_9pywrapfst_8Compiler_write(struct __pyx_obj_9pywrapfst_Compiler *__pyx_v_self, PyObject *__pyx_v_expression, int __pyx_skip_dispatch); /* proto*/\nstatic std::string __pyx_f_9pywrapfst_9FarReader_arc_type(struct __pyx_obj_9pywrapfst_FarReader *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic bool __pyx_f_9pywrapfst_9FarReader_done(struct __pyx_obj_9pywrapfst_FarReader *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic bool __pyx_f_9pywrapfst_9FarReader_error(struct __pyx_obj_9pywrapfst_FarReader *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic std::string __pyx_f_9pywrapfst_9FarReader_far_type(struct __pyx_obj_9pywrapfst_FarReader *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic bool __pyx_f_9pywrapfst_9FarReader_find(struct __pyx_obj_9pywrapfst_FarReader *__pyx_v_self, PyObject *__pyx_v_key, int __pyx_skip_dispatch); /* proto*/\nstatic struct __pyx_obj_9pywrapfst__Fst *__pyx_f_9pywrapfst_9FarReader_get_fst(struct __pyx_obj_9pywrapfst_FarReader *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic std::string __pyx_f_9pywrapfst_9FarReader_get_key(struct __pyx_obj_9pywrapfst_FarReader *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic void __pyx_f_9pywrapfst_9FarReader_next(struct __pyx_obj_9pywrapfst_FarReader *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic void __pyx_f_9pywrapfst_9FarReader_reset(struct __pyx_obj_9pywrapfst_FarReader *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic void __pyx_f_9pywrapfst_9FarWriter_close(struct __pyx_obj_9pywrapfst_FarWriter *__pyx_v_self); /* proto*/\nstatic void __pyx_f_9pywrapfst_9FarWriter_add(struct __pyx_obj_9pywrapfst_FarWriter *__pyx_v_self, PyObject *__pyx_v_key, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst, int __pyx_skip_dispatch); /* proto*/\nstatic std::string __pyx_f_9pywrapfst_9FarWriter_arc_type(struct __pyx_obj_9pywrapfst_FarWriter *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic bool __pyx_f_9pywrapfst_9FarWriter_error(struct __pyx_obj_9pywrapfst_FarWriter *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic std::string __pyx_f_9pywrapfst_9FarWriter_far_type(struct __pyx_obj_9pywrapfst_FarWriter *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\n\n/* Module declarations from 'libc.stddef' */\n\n/* Module declarations from 'libc.time' */\n\n/* Module declarations from 'libcpp' */\n\n/* Module declarations from 'libcpp.memory' */\n\n/* Module declarations from 'libcpp.utility' */\n\n/* Module declarations from 'libcpp.vector' */\n\n/* Module declarations from 'libc.string' */\n\n/* Module declarations from 'libcpp.string' */\n\n/* Module declarations from 'libc.stdint' */\n\n/* Module declarations from 'basictypes' */\n\n/* Module declarations from 'ios' */\n\n/* Module declarations from 'fst' */\n\n/* Module declarations from 'posix.types' */\n\n/* Module declarations from 'posix.unistd' */\n\n/* Module declarations from 'libcpp.cast' */\n\n/* Module declarations from 'memory' */\n\n/* Module declarations from 'pywrapfst' */\nstatic PyTypeObject *__pyx_ptype_9pywrapfst_Weight = 0;\nstatic PyTypeObject *__pyx_ptype_9pywrapfst__SymbolTable = 0;\nstatic PyTypeObject *__pyx_ptype_9pywrapfst__EncodeMapperSymbolTable = 0;\nstatic PyTypeObject *__pyx_ptype_9pywrapfst__FstSymbolTable = 0;\nstatic PyTypeObject *__pyx_ptype_9pywrapfst__MutableSymbolTable = 0;\nstatic PyTypeObject *__pyx_ptype_9pywrapfst__MutableFstSymbolTable = 0;\nstatic PyTypeObject *__pyx_ptype_9pywrapfst_SymbolTable = 0;\nstatic PyTypeObject *__pyx_ptype_9pywrapfst_SymbolTableIterator = 0;\nstatic PyTypeObject *__pyx_ptype_9pywrapfst_EncodeMapper = 0;\nstatic PyTypeObject *__pyx_ptype_9pywrapfst__Fst = 0;\nstatic PyTypeObject *__pyx_ptype_9pywrapfst__MutableFst = 0;\nstatic PyTypeObject *__pyx_ptype_9pywrapfst_Arc = 0;\nstatic PyTypeObject *__pyx_ptype_9pywrapfst_ArcIterator = 0;\nstatic PyTypeObject *__pyx_ptype_9pywrapfst_MutableArcIterator = 0;\nstatic PyTypeObject *__pyx_ptype_9pywrapfst_StateIterator = 0;\nstatic PyTypeObject *__pyx_ptype_9pywrapfst_Compiler = 0;\nstatic PyTypeObject *__pyx_ptype_9pywrapfst_FarReader = 0;\nstatic PyTypeObject *__pyx_ptype_9pywrapfst_FarWriter = 0;\nstatic std::string __pyx_f_9pywrapfst_tostring(PyObject *, struct __pyx_opt_args_9pywrapfst_tostring *__pyx_optional_args); /*proto*/\nstatic std::string __pyx_f_9pywrapfst_weight_tostring(PyObject *, struct __pyx_opt_args_9pywrapfst_weight_tostring *__pyx_optional_args); /*proto*/\nstatic enum fst::ComposeFilter __pyx_f_9pywrapfst__get_compose_filter(std::string const &); /*proto*/\nstatic enum fst::QueueType __pyx_f_9pywrapfst__get_queue_type(std::string const &); /*proto*/\nstatic enum fst::script::RandArcSelection __pyx_f_9pywrapfst__get_rand_arc_selection(std::string const &); /*proto*/\nstatic enum fst::ReplaceLabelType __pyx_f_9pywrapfst__get_replace_label_type(std::string const &, bool); /*proto*/\nstatic fst::script::WeightClass __pyx_f_9pywrapfst__get_WeightClass_or_One(std::string const &, PyObject *); /*proto*/\nstatic fst::script::WeightClass __pyx_f_9pywrapfst__get_WeightClass_or_Zero(std::string const &, PyObject *); /*proto*/\nstatic struct __pyx_obj_9pywrapfst_Weight *__pyx_f_9pywrapfst__Zero(PyObject *); /*proto*/\nstatic struct __pyx_obj_9pywrapfst_Weight *__pyx_f_9pywrapfst__One(PyObject *); /*proto*/\nstatic struct __pyx_obj_9pywrapfst_Weight *__pyx_f_9pywrapfst__NoWeight(PyObject *); /*proto*/\nstatic struct __pyx_obj_9pywrapfst_Weight *__pyx_f_9pywrapfst__plus(struct __pyx_obj_9pywrapfst_Weight *, struct __pyx_obj_9pywrapfst_Weight *); /*proto*/\nstatic struct __pyx_obj_9pywrapfst_Weight *__pyx_f_9pywrapfst__times(struct __pyx_obj_9pywrapfst_Weight *, struct __pyx_obj_9pywrapfst_Weight *); /*proto*/\nstatic struct __pyx_obj_9pywrapfst_Weight *__pyx_f_9pywrapfst__divide(struct __pyx_obj_9pywrapfst_Weight *, struct __pyx_obj_9pywrapfst_Weight *); /*proto*/\nstatic struct __pyx_obj_9pywrapfst_Weight *__pyx_f_9pywrapfst__power(struct __pyx_obj_9pywrapfst_Weight *, size_t); /*proto*/\nstatic struct __pyx_obj_9pywrapfst__EncodeMapperSymbolTable *__pyx_f_9pywrapfst__init_EncodeMapperSymbolTable(fst::SymbolTable *, std::shared_ptr<fst::script::EncodeMapperClass> ); /*proto*/\nstatic struct __pyx_obj_9pywrapfst__FstSymbolTable *__pyx_f_9pywrapfst__init_FstSymbolTable(fst::SymbolTable *, std::shared_ptr<fst::script::FstClass> ); /*proto*/\nstatic struct __pyx_obj_9pywrapfst__MutableFstSymbolTable *__pyx_f_9pywrapfst__init_MutableFstSymbolTable(fst::SymbolTable *, std::shared_ptr<fst::script::MutableFstClass> ); /*proto*/\nstatic struct __pyx_obj_9pywrapfst_SymbolTable *__pyx_f_9pywrapfst__init_SymbolTable(fst::SymbolTable *); /*proto*/\nstatic struct __pyx_obj_9pywrapfst__Fst *__pyx_f_9pywrapfst__init_Fst(__pyx_t_9pywrapfst_FstClass_ptr); /*proto*/\nstatic struct __pyx_obj_9pywrapfst__MutableFst *__pyx_f_9pywrapfst__init_MutableFst(__pyx_t_9pywrapfst_MutableFstClass_ptr); /*proto*/\nstatic struct __pyx_obj_9pywrapfst__Fst *__pyx_f_9pywrapfst__init_XFst(__pyx_t_9pywrapfst_FstClass_ptr); /*proto*/\nstatic struct __pyx_obj_9pywrapfst__MutableFst *__pyx_f_9pywrapfst__create_Fst(struct __pyx_opt_args_9pywrapfst__create_Fst *__pyx_optional_args); /*proto*/\nstatic struct __pyx_obj_9pywrapfst__Fst *__pyx_f_9pywrapfst__read(PyObject *, int __pyx_skip_dispatch); /*proto*/\nstatic struct __pyx_obj_9pywrapfst__Fst *__pyx_f_9pywrapfst__read_from_string(PyObject *, int __pyx_skip_dispatch); /*proto*/\nstatic struct __pyx_obj_9pywrapfst_Arc *__pyx_f_9pywrapfst__init_Arc(fst::script::ArcClass const &); /*proto*/\nstatic struct __pyx_obj_9pywrapfst__Fst *__pyx_f_9pywrapfst__map(struct __pyx_obj_9pywrapfst__Fst *, struct __pyx_opt_args_9pywrapfst__map *__pyx_optional_args); /*proto*/\nstatic struct __pyx_obj_9pywrapfst__Fst *__pyx_f_9pywrapfst_arcmap(struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_arcmap *__pyx_optional_args); /*proto*/\nstatic struct __pyx_obj_9pywrapfst__MutableFst *__pyx_f_9pywrapfst_compose(struct __pyx_obj_9pywrapfst__Fst *, struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_compose *__pyx_optional_args); /*proto*/\nstatic struct __pyx_obj_9pywrapfst__Fst *__pyx_f_9pywrapfst_convert(struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_convert *__pyx_optional_args); /*proto*/\nstatic struct __pyx_obj_9pywrapfst__MutableFst *__pyx_f_9pywrapfst_determinize(struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_determinize *__pyx_optional_args); /*proto*/\nstatic struct __pyx_obj_9pywrapfst__MutableFst *__pyx_f_9pywrapfst_difference(struct __pyx_obj_9pywrapfst__Fst *, struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_difference *__pyx_optional_args); /*proto*/\nstatic struct __pyx_obj_9pywrapfst__MutableFst *__pyx_f_9pywrapfst_disambiguate(struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_disambiguate *__pyx_optional_args); /*proto*/\nstatic struct __pyx_obj_9pywrapfst__MutableFst *__pyx_f_9pywrapfst_epsnormalize(struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_epsnormalize *__pyx_optional_args); /*proto*/\nstatic bool __pyx_f_9pywrapfst_equal(struct __pyx_obj_9pywrapfst__Fst *, struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_equal *__pyx_optional_args); /*proto*/\nstatic bool __pyx_f_9pywrapfst_equivalent(struct __pyx_obj_9pywrapfst__Fst *, struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_equivalent *__pyx_optional_args); /*proto*/\nstatic struct __pyx_obj_9pywrapfst__MutableFst *__pyx_f_9pywrapfst_intersect(struct __pyx_obj_9pywrapfst__Fst *, struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_intersect *__pyx_optional_args); /*proto*/\nstatic bool __pyx_f_9pywrapfst_isomorphic(struct __pyx_obj_9pywrapfst__Fst *, struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_isomorphic *__pyx_optional_args); /*proto*/\nstatic struct __pyx_obj_9pywrapfst__MutableFst *__pyx_f_9pywrapfst_prune(struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_prune *__pyx_optional_args); /*proto*/\nstatic struct __pyx_obj_9pywrapfst__MutableFst *__pyx_f_9pywrapfst_push(struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_push *__pyx_optional_args); /*proto*/\nstatic bool __pyx_f_9pywrapfst_randequivalent(struct __pyx_obj_9pywrapfst__Fst *, struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_randequivalent *__pyx_optional_args); /*proto*/\nstatic struct __pyx_obj_9pywrapfst__MutableFst *__pyx_f_9pywrapfst_randgen(struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_randgen *__pyx_optional_args); /*proto*/\nstatic struct __pyx_obj_9pywrapfst__MutableFst *__pyx_f_9pywrapfst_replace(PyObject *, int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_replace *__pyx_optional_args); /*proto*/\nstatic struct __pyx_obj_9pywrapfst__MutableFst *__pyx_f_9pywrapfst_reverse(struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_reverse *__pyx_optional_args); /*proto*/\nstatic std::vector<fst::script::WeightClass>  *__pyx_f_9pywrapfst__shortestdistance(struct __pyx_obj_9pywrapfst__Fst *, struct __pyx_opt_args_9pywrapfst__shortestdistance *__pyx_optional_args); /*proto*/\nstatic struct __pyx_obj_9pywrapfst__MutableFst *__pyx_f_9pywrapfst_shortestpath(struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_shortestpath *__pyx_optional_args); /*proto*/\nstatic struct __pyx_obj_9pywrapfst__Fst *__pyx_f_9pywrapfst_statemap(struct __pyx_obj_9pywrapfst__Fst *, PyObject *, int __pyx_skip_dispatch); /*proto*/\nstatic struct __pyx_obj_9pywrapfst__MutableFst *__pyx_f_9pywrapfst_synchronize(struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch); /*proto*/\nstatic struct __pyx_obj_9pywrapfst_SymbolTable *__pyx_f_9pywrapfst_compact_symbol_table(struct __pyx_obj_9pywrapfst__SymbolTable *, int __pyx_skip_dispatch); /*proto*/\nstatic struct __pyx_obj_9pywrapfst_SymbolTable *__pyx_f_9pywrapfst_merge_symbol_table(struct __pyx_obj_9pywrapfst__SymbolTable *, struct __pyx_obj_9pywrapfst__SymbolTable *, int __pyx_skip_dispatch); /*proto*/\nstatic std::string __pyx_convert_string_from_py_std__in_string(PyObject *); /*proto*/\nstatic CYTHON_INLINE PyObject *__pyx_convert_PyObject_string_to_py_std__in_string(std::string const &); /*proto*/\nstatic CYTHON_INLINE PyObject *__pyx_convert_PyUnicode_string_to_py_std__in_string(std::string const &); /*proto*/\nstatic CYTHON_INLINE PyObject *__pyx_convert_PyStr_string_to_py_std__in_string(std::string const &); /*proto*/\nstatic CYTHON_INLINE PyObject *__pyx_convert_PyBytes_string_to_py_std__in_string(std::string const &); /*proto*/\nstatic CYTHON_INLINE PyObject *__pyx_convert_PyByteArray_string_to_py_std__in_string(std::string const &); /*proto*/\nstatic std::vector<__pyx_t_10basictypes_int64>  __pyx_convert_vector_from_py___pyx_t_10basictypes_int64(PyObject *); /*proto*/\nstatic std::vector<std::string>  __pyx_convert_vector_from_py_std_3a__3a_string(PyObject *); /*proto*/\n#define __Pyx_MODULE_NAME \"pywrapfst\"\nextern int __pyx_module_is_main_pywrapfst;\nint __pyx_module_is_main_pywrapfst = 0;\n\n/* Implementation of 'pywrapfst' */\nstatic PyObject *__pyx_builtin_ValueError;\nstatic PyObject *__pyx_builtin_RuntimeError;\nstatic PyObject *__pyx_builtin_IndexError;\nstatic PyObject *__pyx_builtin_IOError;\nstatic PyObject *__pyx_builtin_object;\nstatic PyObject *__pyx_builtin_staticmethod;\nstatic PyObject *__pyx_builtin_id;\nstatic PyObject *__pyx_builtin_TypeError;\nstatic PyObject *__pyx_builtin_StopIteration;\nstatic PyObject *__pyx_builtin_KeyError;\nstatic const char __pyx_k_g[] = \"g\";\nstatic const char __pyx_k_n[] = \"n\";\nstatic const char __pyx_k_w[] = \"w\";\nstatic const char __pyx_k_id[] = \"id\";\nstatic const char __pyx_k_Fst[] = \"Fst\";\nstatic const char __pyx_k_One[] = \"One\";\nstatic const char __pyx_k__24[] = \"\";\nstatic const char __pyx_k_add[] = \"add\";\nstatic const char __pyx_k_arc[] = \"arc\";\nstatic const char __pyx_k_cls[] = \"cls\";\nstatic const char __pyx_k_doc[] = \"__doc__\";\nstatic const char __pyx_k_dot[] = \"dot\";\nstatic const char __pyx_k_key[] = \"key\";\nstatic const char __pyx_k_lhs[] = \"lhs\";\nstatic const char __pyx_k_new[] = \"__new__\";\nstatic const char __pyx_k_rhs[] = \"rhs\";\nstatic const char __pyx_k_PIPE[] = \"PIPE\";\nstatic const char __pyx_k_Tsvg[] = \"-Tsvg\";\nstatic const char __pyx_k_Zero[] = \"Zero\";\nstatic const char __pyx_k_arcs[] = \"arcs\";\nstatic const char __pyx_k_auto[] = \"auto\";\nstatic const char __pyx_k_copy[] = \"copy\";\nstatic const char __pyx_k_done[] = \"done\";\nstatic const char __pyx_k_draw[] = \"draw\";\nstatic const char __pyx_k_find[] = \"find\";\nstatic const char __pyx_k_ifst[] = \"ifst\";\nstatic const char __pyx_k_main[] = \"__main__\";\nstatic const char __pyx_k_mask[] = \"mask\";\nstatic const char __pyx_k_name[] = \"__name__\";\nstatic const char __pyx_k_next[] = \"next\";\nstatic const char __pyx_k_open[] = \"open\";\nstatic const char __pyx_k_plus[] = \"plus\";\nstatic const char __pyx_k_read[] = \"read\";\nstatic const char __pyx_k_seed[] = \"seed\";\nstatic const char __pyx_k_seek[] = \"seek\";\nstatic const char __pyx_k_syms[] = \"syms\";\nstatic const char __pyx_k_test[] = \"test\";\nstatic const char __pyx_k_text[] = \"text\";\nstatic const char __pyx_k_type[] = \"type\";\nstatic const char __pyx_k_utf8[] = \"utf8\";\nstatic const char __pyx_k_ERROR[] = \"ERROR\";\nstatic const char __pyx_k_Popen[] = \"Popen\";\nstatic const char __pyx_k_class[] = \"__class__\";\nstatic const char __pyx_k_delta[] = \"delta\";\nstatic const char __pyx_k_error[] = \"error\";\nstatic const char __pyx_k_final[] = \"final\";\nstatic const char __pyx_k_flags[] = \"flags\";\nstatic const char __pyx_k_ifst1[] = \"ifst1\";\nstatic const char __pyx_k_ifst2[] = \"ifst2\";\nstatic const char __pyx_k_input[] = \"input\";\nstatic const char __pyx_k_npath[] = \"npath\";\nstatic const char __pyx_k_pairs[] = \"pairs\";\nstatic const char __pyx_k_power[] = \"power\";\nstatic const char __pyx_k_props[] = \"props\";\nstatic const char __pyx_k_reset[] = \"reset\";\nstatic const char __pyx_k_start[] = \"start\";\nstatic const char __pyx_k_state[] = \"state\";\nstatic const char __pyx_k_stdin[] = \"stdin\";\nstatic const char __pyx_k_times[] = \"times\";\nstatic const char __pyx_k_title[] = \"title\";\nstatic const char __pyx_k_value[] = \"value\";\nstatic const char __pyx_k_width[] = \"width\";\nstatic const char __pyx_k_write[] = \"write\";\nstatic const char __pyx_k_CYCLIC[] = \"CYCLIC\";\nstatic const char __pyx_k_Number[] = \"Number\";\nstatic const char __pyx_k_STRING[] = \"STRING\";\nstatic const char __pyx_k_atexit[] = \"atexit\";\nstatic const char __pyx_k_create[] = \"create\";\nstatic const char __pyx_k_decode[] = \"decode\";\nstatic const char __pyx_k_divide[] = \"divide\";\nstatic const char __pyx_k_encode[] = \"encode\";\nstatic const char __pyx_k_format[] = \"format\";\nstatic const char __pyx_k_height[] = \"height\";\nstatic const char __pyx_k_ilabel[] = \"ilabel\";\nstatic const char __pyx_k_import[] = \"__import__\";\nstatic const char __pyx_k_ipairs[] = \"ipairs\";\nstatic const char __pyx_k_member[] = \"member\";\nstatic const char __pyx_k_module[] = \"__module__\";\nstatic const char __pyx_k_name_2[] = \"name\";\nstatic const char __pyx_k_nstate[] = \"nstate\";\nstatic const char __pyx_k_object[] = \"object\";\nstatic const char __pyx_k_olabel[] = \"olabel\";\nstatic const char __pyx_k_opairs[] = \"opairs\";\nstatic const char __pyx_k_reduce[] = \"__reduce__\";\nstatic const char __pyx_k_result[] = \"result\";\nstatic const char __pyx_k_select[] = \"select\";\nstatic const char __pyx_k_states[] = \"states\";\nstatic const char __pyx_k_stderr[] = \"stderr\";\nstatic const char __pyx_k_stdout[] = \"stdout\";\nstatic const char __pyx_k_symbol[] = \"symbol\";\nstatic const char __pyx_k_test_2[] = \"__test__\";\nstatic const char __pyx_k_unique[] = \"unique\";\nstatic const char __pyx_k_vector[] = \"vector\";\nstatic const char __pyx_k_verify[] = \"verify\";\nstatic const char __pyx_k_weight[] = \"weight\";\nstatic const char __pyx_k_ACYCLIC[] = \"ACYCLIC\";\nstatic const char __pyx_k_IOError[] = \"IOError\";\nstatic const char __pyx_k_MUTABLE[] = \"MUTABLE\";\nstatic const char __pyx_k_compile[] = \"compile\";\nstatic const char __pyx_k_connect[] = \"connect\";\nstatic const char __pyx_k_default[] = \"default\";\nstatic const char __pyx_k_get_fst[] = \"get_fst\";\nstatic const char __pyx_k_get_key[] = \"get_key\";\nstatic const char __pyx_k_logging[] = \"logging\";\nstatic const char __pyx_k_neither[] = \"neither\";\nstatic const char __pyx_k_nodesep[] = \"nodesep\";\nstatic const char __pyx_k_numbers[] = \"numbers\";\nstatic const char __pyx_k_prepare[] = \"__prepare__\";\nstatic const char __pyx_k_ranksep[] = \"ranksep\";\nstatic const char __pyx_k_reverse[] = \"reverse\";\nstatic const char __pyx_k_uniform[] = \"uniform\";\nstatic const char __pyx_k_warning[] = \"warning\";\nstatic const char __pyx_k_ACCEPTOR[] = \"ACCEPTOR\";\nstatic const char __pyx_k_DOT_TSVG[] = \"_DOT_TSVG\";\nstatic const char __pyx_k_EPSILONS[] = \"EPSILONS\";\nstatic const char __pyx_k_EXPANDED[] = \"EXPANDED\";\nstatic const char __pyx_k_FstError[] = \"FstError\";\nstatic const char __pyx_k_Fst_read[] = \"Fst.read\";\nstatic const char __pyx_k_KeyError[] = \"KeyError\";\nstatic const char __pyx_k_NO_LABEL[] = \"NO_LABEL\";\nstatic const char __pyx_k_NoWeight[] = \"NoWeight\";\nstatic const char __pyx_k_WEIGHTED[] = \"WEIGHTED\";\nstatic const char __pyx_k_acceptor[] = \"acceptor\";\nstatic const char __pyx_k_arc_type[] = \"arc_type\";\nstatic const char __pyx_k_checksum[] = \"checksum\";\nstatic const char __pyx_k_det_type[] = \"det_type\";\nstatic const char __pyx_k_distance[] = \"distance\";\nstatic const char __pyx_k_far_type[] = \"far_type\";\nstatic const char __pyx_k_filename[] = \"filename\";\nstatic const char __pyx_k_fontsize[] = \"fontsize\";\nstatic const char __pyx_k_fst_type[] = \"fst_type\";\nstatic const char __pyx_k_getstate[] = \"__getstate__\";\nstatic const char __pyx_k_identity[] = \"identity\";\nstatic const char __pyx_k_isymbols[] = \"isymbols\";\nstatic const char __pyx_k_map_type[] = \"map_type\";\nstatic const char __pyx_k_num_arcs[] = \"num_arcs\";\nstatic const char __pyx_k_osymbols[] = \"osymbols\";\nstatic const char __pyx_k_portrait[] = \"portrait\";\nstatic const char __pyx_k_position[] = \"position\";\nstatic const char __pyx_k_qualname[] = \"__qualname__\";\nstatic const char __pyx_k_read_fst[] = \"read_fst\";\nstatic const char __pyx_k_register[] = \"register\";\nstatic const char __pyx_k_repr_svg[] = \"_repr_svg\";\nstatic const char __pyx_k_set_name[] = \"set_name\";\nstatic const char __pyx_k_setstate[] = \"__setstate__\";\nstatic const char __pyx_k_ssymbols[] = \"ssymbols\";\nstatic const char __pyx_k_standard[] = \"standard\";\nstatic const char __pyx_k_to_final[] = \"to_final\";\nstatic const char __pyx_k_tropical[] = \"tropical\";\nstatic const char __pyx_k_vertical[] = \"vertical\";\nstatic const char __pyx_k_weighted[] = \"weighted\";\nstatic const char __pyx_k_ARC_FLAGS[] = \"ARC_FLAGS\";\nstatic const char __pyx_k_Fst___new[] = \"Fst.__new__\";\nstatic const char __pyx_k_NO_SYMBOL[] = \"NO_SYMBOL\";\nstatic const char __pyx_k_TypeError[] = \"TypeError\";\nstatic const char __pyx_k_add_state[] = \"add_state\";\nstatic const char __pyx_k_add_table[] = \"add_table\";\nstatic const char __pyx_k_kNoSymbol[] = \"kNoSymbol\";\nstatic const char __pyx_k_metaclass[] = \"__metaclass__\";\nstatic const char __pyx_k_nextstate[] = \"nextstate\";\nstatic const char __pyx_k_nshortest[] = \"nshortest\";\nstatic const char __pyx_k_precision[] = \"precision\";\nstatic const char __pyx_k_pywrapfst[] = \"<pywrapfst>\";\nstatic const char __pyx_k_read_text[] = \"read_text\";\nstatic const char __pyx_k_reduce_ex[] = \"__reduce_ex__\";\nstatic const char __pyx_k_set_flags[] = \"set_flags\";\nstatic const char __pyx_k_set_value[] = \"set_value\";\nstatic const char __pyx_k_sort_type[] = \"sort_type\";\nstatic const char __pyx_k_to_string[] = \"to_string\";\nstatic const char __pyx_k_ACCESSIBLE[] = \"ACCESSIBLE\";\nstatic const char __pyx_k_FstIOError[] = \"FstIOError\";\nstatic const char __pyx_k_FstOpError[] = \"FstOpError\";\nstatic const char __pyx_k_I_EPSILONS[] = \"I_EPSILONS\";\nstatic const char __pyx_k_IndexError[] = \"IndexError\";\nstatic const char __pyx_k_NOT_STRING[] = \"NOT_STRING\";\nstatic const char __pyx_k_O_EPSILONS[] = \"O_EPSILONS\";\nstatic const char __pyx_k_TOP_SORTED[] = \"TOP_SORTED\";\nstatic const char __pyx_k_UNWEIGHTED[] = \"UNWEIGHTED\";\nstatic const char __pyx_k_ValueError[] = \"ValueError\";\nstatic const char __pyx_k_add_symbol[] = \"add_symbol\";\nstatic const char __pyx_k_functional[] = \"functional\";\nstatic const char __pyx_k_max_length[] = \"max_length\";\nstatic const char __pyx_k_num_states[] = \"num_states\";\nstatic const char __pyx_k_potentials[] = \"potentials\";\nstatic const char __pyx_k_properties[] = \"properties\";\nstatic const char __pyx_k_pyx_vtable[] = \"__pyx_vtable__\";\nstatic const char __pyx_k_queue_type[] = \"queue_type\";\nstatic const char __pyx_k_returncode[] = \"returncode\";\nstatic const char __pyx_k_subprocess[] = \"subprocess\";\nstatic const char __pyx_k_write_text[] = \"write_text\";\nstatic const char __pyx_k_Arc_at_0x_x[] = \"<Arc at 0x{:x}>\";\nstatic const char __pyx_k_FstArgError[] = \"FstArgError\";\nstatic const char __pyx_k_Fst_at_0x_x[] = \"<{} Fst at 0x{:x}>\";\nstatic const char __pyx_k_NO_EPSILONS[] = \"NO_EPSILONS\";\nstatic const char __pyx_k_NO_STATE_ID[] = \"NO_STATE_ID\";\nstatic const char __pyx_k_communicate[] = \"communicate\";\nstatic const char __pyx_k_get_nth_key[] = \"get_nth_key\";\nstatic const char __pyx_k_input_table[] = \"input_table\";\nstatic const char __pyx_k_missing_sym[] = \"missing_sym\";\nstatic const char __pyx_k_num_symbols[] = \"num_symbols\";\nstatic const char __pyx_k_push_labels[] = \"push_labels\";\nstatic const char __pyx_k_pywrapfst_2[] = \"pywrapfst\";\nstatic const char __pyx_k_unspecified[] = \"<unspecified>\";\nstatic const char __pyx_k_weight_type[] = \"weight_type\";\nstatic const char __pyx_k_ARC_NO_CACHE[] = \"ARC_NO_CACHE\";\nstatic const char __pyx_k_COACCESSIBLE[] = \"COACCESSIBLE\";\nstatic const char __pyx_k_ENCODE_FLAGS[] = \"ENCODE_FLAGS\";\nstatic const char __pyx_k_NOT_ACCEPTOR[] = \"NOT_ACCEPTOR\";\nstatic const char __pyx_k_RuntimeError[] = \"RuntimeError\";\nstatic const char __pyx_k_allow_nondet[] = \"allow_nondet\";\nstatic const char __pyx_k_closure_plus[] = \"closure_plus\";\nstatic const char __pyx_k_float_format[] = \"float_format\";\nstatic const char __pyx_k_mutable_arcs[] = \"mutable_arcs\";\nstatic const char __pyx_k_new_isymbols[] = \"new_isymbols\";\nstatic const char __pyx_k_new_osymbols[] = \"new_osymbols\";\nstatic const char __pyx_k_old_isymbols[] = \"old_isymbols\";\nstatic const char __pyx_k_old_osymbols[] = \"old_osymbols\";\nstatic const char __pyx_k_push_weights[] = \"push_weights\";\nstatic const char __pyx_k_return_label[] = \"return_label\";\nstatic const char __pyx_k_staticmethod[] = \"staticmethod\";\nstatic const char __pyx_k_ENCODE_LABELS[] = \"ENCODE_LABELS\";\nstatic const char __pyx_k_FstIndexError[] = \"FstIndexError\";\nstatic const char __pyx_k_NO_I_EPSILONS[] = \"NO_I_EPSILONS\";\nstatic const char __pyx_k_NO_O_EPSILONS[] = \"NO_O_EPSILONS\";\nstatic const char __pyx_k_Open_failed_r[] = \"Open failed: {!r}\";\nstatic const char __pyx_k_Read_failed_r[] = \"Read failed: {!r}\";\nstatic const char __pyx_k_StopIteration[] = \"StopIteration\";\nstatic const char __pyx_k_available_key[] = \"available_key\";\nstatic const char __pyx_k_encode_labels[] = \"encode_labels\";\nstatic const char __pyx_k_input_symbols[] = \"input_symbols\";\nstatic const char __pyx_k_keep_isymbols[] = \"keep_isymbols\";\nstatic const char __pyx_k_keep_osymbols[] = \"keep_osymbols\";\nstatic const char __pyx_k_pywrapfst_pyx[] = \"pywrapfst.pyx\";\nstatic const char __pyx_k_reduce_cython[] = \"__reduce_cython__\";\nstatic const char __pyx_k_ENCODE_WEIGHTS[] = \"ENCODE_WEIGHTS\";\nstatic const char __pyx_k_FST_PROPERTIES[] = \"FST_PROPERTIES\";\nstatic const char __pyx_k_INITIAL_CYCLIC[] = \"INITIAL_CYCLIC\";\nstatic const char __pyx_k_I_LABEL_SORTED[] = \"I_LABEL_SORTED\";\nstatic const char __pyx_k_Invalid_weight[] = \"Invalid weight\";\nstatic const char __pyx_k_NOT_ACCESSIBLE[] = \"NOT_ACCESSIBLE\";\nstatic const char __pyx_k_NOT_TOP_SORTED[] = \"NOT_TOP_SORTED\";\nstatic const char __pyx_k_O_LABEL_SORTED[] = \"O_LABEL_SORTED\";\nstatic const char __pyx_k_Weight_at_0x_x[] = \"<{} Weight {} at 0x{:x}>\";\nstatic const char __pyx_k_Write_failed_r[] = \"Write failed: {!r}\";\nstatic const char __pyx_k_compose_filter[] = \"compose_filter\";\nstatic const char __pyx_k_encode_weights[] = \"encode_weights\";\nstatic const char __pyx_k_output_symbols[] = \"output_symbols\";\nstatic const char __pyx_k_project_output[] = \"project_output\";\nstatic const char __pyx_k_ARC_VALUE_FLAGS[] = \"ARC_VALUE_FLAGS\";\nstatic const char __pyx_k_COPY_PROPERTIES[] = \"COPY_PROPERTIES\";\nstatic const char __pyx_k_INITIAL_ACYCLIC[] = \"INITIAL_ACYCLIC\";\nstatic const char __pyx_k_I_DETERMINISTIC[] = \"I_DETERMINISTIC\";\nstatic const char __pyx_k_NULL_PROPERTIES[] = \"NULL_PROPERTIES\";\nstatic const char __pyx_k_O_DETERMINISTIC[] = \"O_DETERMINISTIC\";\nstatic const char __pyx_k_WEIGHTED_CYCLES[] = \"WEIGHTED_CYCLES\";\nstatic const char __pyx_k_eps_norm_output[] = \"eps_norm_output\";\nstatic const char __pyx_k_setstate_cython[] = \"__setstate_cython__\";\nstatic const char __pyx_k_show_weight_one[] = \"show_weight_one\";\nstatic const char __pyx_k_unknown_isymbol[] = \"unknown_isymbol\";\nstatic const char __pyx_k_unknown_osymbol[] = \"unknown_osymbol\";\nstatic const char __pyx_k_write_to_string[] = \"write_to_string\";\nstatic const char __pyx_k_ARC_WEIGHT_VALUE[] = \"ARC_WEIGHT_VALUE\";\nstatic const char __pyx_k_Cannot_construct[] = \"Cannot construct {}\";\nstatic const char __pyx_k_Key_out_of_order[] = \"Key out of order\";\nstatic const char __pyx_k_NOT_COACCESSIBLE[] = \"NOT_COACCESSIBLE\";\nstatic const char __pyx_k_Operation_failed[] = \"Operation failed\";\nstatic const char __pyx_k_labeled_checksum[] = \"labeled_checksum\";\nstatic const char __pyx_k_read_from_string[] = \"_read_from_string\";\nstatic const char __pyx_k_shortestdistance[] = \"shortestdistance\";\nstatic const char __pyx_k_ARC_I_LABEL_VALUE[] = \"ARC_I_LABEL_VALUE\";\nstatic const char __pyx_k_ARC_O_LABEL_VALUE[] = \"ARC_O_LABEL_VALUE\";\nstatic const char __pyx_k_BINARY_PROPERTIES[] = \"BINARY_PROPERTIES\";\nstatic const char __pyx_k_FarReader_at_0x_x[] = \"<{} FarReader at 0x{:x}>\";\nstatic const char __pyx_k_FarWriter_at_0x_x[] = \"<{} FarWriter at 0x{:x}>\";\nstatic const char __pyx_k_FstBadWeightError[] = \"FstBadWeightError\";\nstatic const char __pyx_k_UNWEIGHTED_CYCLES[] = \"UNWEIGHTED_CYCLES\";\nstatic const char __pyx_k_call_arc_labeling[] = \"call_arc_labeling\";\nstatic const char __pyx_k_set_input_symbols[] = \"set_input_symbols\";\nstatic const char __pyx_k_ADD_ARC_PROPERTIES[] = \"ADD_ARC_PROPERTIES\";\nstatic const char __pyx_k_CalledProcessError[] = \"CalledProcessError\";\nstatic const char __pyx_k_Compilation_failed[] = \"Compilation failed\";\nstatic const char __pyx_k_NOT_I_LABEL_SORTED[] = \"NOT_I_LABEL_SORTED\";\nstatic const char __pyx_k_NOT_O_LABEL_SORTED[] = \"NOT_O_LABEL_SORTED\";\nstatic const char __pyx_k_Read_failed_string[] = \"Read failed: <string>\";\nstatic const char __pyx_k_SET_ARC_PROPERTIES[] = \"SET_ARC_PROPERTIES\";\nstatic const char __pyx_k_TRINARY_PROPERTIES[] = \"TRINARY_PROPERTIES\";\nstatic const char __pyx_k_Unknown_arc_type_r[] = \"Unknown arc type: {!r}\";\nstatic const char __pyx_k_Unknown_map_type_r[] = \"Unknown map type: {!r}\";\nstatic const char __pyx_k_cline_in_traceback[] = \"cline_in_traceback\";\nstatic const char __pyx_k_epsilon_on_replace[] = \"epsilon_on_replace\";\nstatic const char __pyx_k_num_input_epsilons[] = \"num_input_epsilons\";\nstatic const char __pyx_k_read_from_string_2[] = \"read_from_string\";\nstatic const char __pyx_k_set_output_symbols[] = \"set_output_symbols\";\nstatic const char __pyx_k_ARC_SORT_PROPERTIES[] = \"ARC_SORT_PROPERTIES\";\nstatic const char __pyx_k_ArcIterator_at_0x_x[] = \"<ArcIterator at 0x{:x}>\";\nstatic const char __pyx_k_NON_I_DETERMINISTIC[] = \"NON_I_DETERMINISTIC\";\nstatic const char __pyx_k_NON_O_DETERMINISTIC[] = \"NON_O_DETERMINISTIC\";\nstatic const char __pyx_k_Unknown_sort_type_r[] = \"Unknown sort type {!r}\";\nstatic const char __pyx_k_attach_new_isymbols[] = \"attach_new_isymbols\";\nstatic const char __pyx_k_attach_new_osymbols[] = \"attach_new_osymbols\";\nstatic const char __pyx_k_fst_error_fatal_old[] = \"_fst_error_fatal_old\";\nstatic const char __pyx_k_num_output_epsilons[] = \"num_output_epsilons\";\nstatic const char __pyx_k_remove_common_affix[] = \"remove_common_affix\";\nstatic const char __pyx_k_remove_total_weight[] = \"remove_total_weight\";\nstatic const char __pyx_k_return_arc_labeling[] = \"return_arc_labeling\";\nstatic const char __pyx_k_subsequential_label[] = \"subsequential_label\";\nstatic const char __pyx_k_ADD_STATE_PROPERTIES[] = \"ADD_STATE_PROPERTIES\";\nstatic const char __pyx_k_ARC_NEXT_STATE_VALUE[] = \"ARC_NEXT_STATE_VALUE\";\nstatic const char __pyx_k_EXTRINSIC_PROPERTIES[] = \"EXTRINSIC_PROPERTIES\";\nstatic const char __pyx_k_EncodeMapper_at_0x_x[] = \"<EncodeMapper at 0x{:x}>\";\nstatic const char __pyx_k_Fst_read_from_string[] = \"Fst.read_from_string\";\nstatic const char __pyx_k_INTRINSIC_PROPERTIES[] = \"INTRINSIC_PROPERTIES\";\nstatic const char __pyx_k_SET_FINAL_PROPERTIES[] = \"SET_FINAL_PROPERTIES\";\nstatic const char __pyx_k_SET_START_PROPERTIES[] = \"SET_START_PROPERTIES\";\nstatic const char __pyx_k_Unknown_queue_type_r[] = \"Unknown queue type: {!r}\";\nstatic const char __pyx_k_keep_state_numbering[] = \"keep_state_numbering\";\nstatic const char __pyx_k_require_superinitial[] = \"require_superinitial\";\nstatic const char __pyx_k_DELETE_ARC_PROPERTIES[] = \"DELETE_ARC_PROPERTIES\";\nstatic const char __pyx_k_STATE_SORT_PROPERTIES[] = \"STATE_SORT_PROPERTIES\";\nstatic const char __pyx_k_StateIterator_at_0x_x[] = \"<StateIterator at 0x{:x}>\";\nstatic const char __pyx_k_SymbolTable_r_at_0x_x[] = \"<SymbolTable {!r} at 0x{:x}>\";\nstatic const char __pyx_k_Weight_type_not_found[] = \"Weight type not found\";\nstatic const char __pyx_k_allow_negative_labels[] = \"allow_negative_labels\";\nstatic const char __pyx_k_reset_fst_error_fatal[] = \"_reset_fst_error_fatal\";\nstatic const char __pyx_k_Conversion_to_r_failed[] = \"Conversion to {!r} failed\";\nstatic const char __pyx_k_NEG_TRINARY_PROPERTIES[] = \"NEG_TRINARY_PROPERTIES\";\nstatic const char __pyx_k_POS_TRINARY_PROPERTIES[] = \"POS_TRINARY_PROPERTIES\";\nstatic const char __pyx_k_Write_to_string_failed[] = \"Write to string failed\";\nstatic const char __pyx_k_DELETE_STATE_PROPERTIES[] = \"DELETE_STATE_PROPERTIES\";\nstatic const char __pyx_k_RM_SUPERFINAL_PROPERTIES[] = \"RM_SUPERFINAL_PROPERTIES\";\nstatic const char __pyx_k_State_index_out_of_range[] = \"State index out of range\";\nstatic const char __pyx_k_ADD_SUPERFINAL_PROPERTIES[] = \"ADD_SUPERFINAL_PROPERTIES\";\nstatic const char __pyx_k_Cannot_encode_as_string_r[] = \"Cannot encode as string: {!r}\";\nstatic const char __pyx_k_Cannot_topsort_cyclic_FST[] = \"Cannot topsort cyclic FST.\";\nstatic const char __pyx_k_Fst_SymbolTable_r_at_0x_x[] = \"<Fst SymbolTable {!r} at 0x{:x}>\";\nstatic const char __pyx_k_FstDeletedConstructorError[] = \"FstDeletedConstructorError\";\nstatic const char __pyx_k_MutableArcIterator_at_0x_x[] = \"<MutableArcIterator at 0x{:x}>\";\nstatic const char __pyx_k_SymbolTableIterator_at_0x_x[] = \"<SymbolTableIterator at 0x{:x}>\";\nstatic const char __pyx_k_WEIGHT_INVARIANT_PROPERTIES[] = \"WEIGHT_INVARIANT_PROPERTIES\";\nstatic const char __pyx_k_I_LABEL_INVARIANT_PROPERTIES[] = \"I_LABEL_INVARIANT_PROPERTIES\";\nstatic const char __pyx_k_O_LABEL_INVARIANT_PROPERTIES[] = \"O_LABEL_INVARIANT_PROPERTIES\";\nstatic const char __pyx_k_Unknown_replace_label_type_r[] = \"Unknown replace label type: {!r}\";\nstatic const char __pyx_k_No_new_SymbolTables_specified[] = \"No new SymbolTables specified\";\nstatic const char __pyx_k_No_relabeling_pairs_specified[] = \"No relabeling pairs specified.\";\nstatic const char __pyx_k_Unknown_compose_filter_type_r[] = \"Unknown compose filter type: {!r}\";\nstatic const char __pyx_k_increment_subsequential_label[] = \"increment_subsequential_label\";\nstatic const char __pyx_k_Incompatible_or_invalid_weight[] = \"Incompatible or invalid weight\";\nstatic const char __pyx_k_Unknown_determinization_type_r[] = \"Unknown determinization type: {!r}\";\nstatic const char __pyx_k_const_EncodeMapper_SymbolTable[] = \"<const EncodeMapper SymbolTable {!r} at 0x{:x}>\";\nstatic const char __pyx_k_Fst_arc_type_standard_Construct[] = \"\\n   Fst(arc_type=\\\"standard\\\")\\n\\n   Constructs an empty FST.\\n\\n   Args:\\n     arc_type: A string indicating the arc type.\\n\\n   Raises:\\n     FstError: Unknown arc type.\\n\\n   Raises:\\n     FstOpError: operation failed.\\n   \";\nstatic const char __pyx_k_const_Fst_SymbolTable_r_at_0x_x[] = \"<const Fst SymbolTable {!r} at 0x{:x}>\";\nstatic const char __pyx_k_self__aiter_self__fst_cannot_be[] = \"self._aiter,self._fst cannot be converted to a Python object for pickling\";\nstatic const char __pyx_k_self__fst_self__siter_cannot_be[] = \"self._fst,self._siter cannot be converted to a Python object for pickling\";\nstatic const char __pyx_k_self__fst_self__table_cannot_be[] = \"self._fst,self._table cannot be converted to a Python object for pickling\";\nstatic const char __pyx_k_self__table_cannot_be_converted[] = \"self._table cannot be converted to a Python object for pickling\";\nstatic const char __pyx_k_Incompatible_or_invalid_arc_type[] = \"Incompatible or invalid arc type\";\nstatic const char __pyx_k_Incompatible_or_invalid_weight_t[] = \"Incompatible or invalid weight type\";\nstatic const char __pyx_k_Python_interface_to_the_FST_scri[] = \"Python interface to the FST scripting API.\\n\\nOperations which construct new FSTs are implemented as traditional functions, as\\nare two-argument boolean functions like `equal` and `equivalent`. Destructive\\noperations---those that mutate an FST, in place---are instance methods, as is\\n`write`. Operator overloading is not used. The following example, based on\\nMohri et al. 2002, shows the construction of an ASR system given a pronunciation\\nlexicon L, grammar G, a transducer from context-dependent phones to\\ncontext-independent phones C, and an HMM set H:\\n\\n  L = fst.Fst.read(\\\"L.fst\\\")\\n  G = fst.Fst.read(\\\"G.fst\\\")\\n  C = fst.Fst.read(\\\"C.fst\\\")\\n  H = fst.Fst.read(\\\"H.fst\\\")\\n  LG = fst.determinize(fst.compose(L, G))\\n  CLG = fst.determinize(fst.compose(C, LG))\\n  HCLG = fst.determinize(fst.compose(H, CLG))\\n  HCLG.minimize()                                      # NB: works in-place.\\n\\nPython variables here use snake_case and constants are in all caps, minus the\\nnormal `k` prefix.\\n\";\nstatic const char __pyx_k_Unknown_random_arc_selection_typ[] = \"Unknown random arc selection type: {!r}\";\nstatic const char __pyx_k_no_default___reduce___due_to_non[] = \"no default __reduce__ due to non-trivial __cinit__\";\nstatic const char __pyx_k_self__aiter_self__mfst_cannot_be[] = \"self._aiter,self._mfst cannot be converted to a Python object for pickling\";\nstatic const char __pyx_k_self__arc_cannot_be_converted_to[] = \"self._arc cannot be converted to a Python object for pickling\";\nstatic const char __pyx_k_self__encoder_cannot_be_converte[] = \"self._encoder cannot be converted to a Python object for pickling\";\nstatic const char __pyx_k_self__encoder_self__table_cannot[] = \"self._encoder,self._table cannot be converted to a Python object for pickling\";\nstatic const char __pyx_k_self__mfst_self__table_cannot_be[] = \"self._mfst,self._table cannot be converted to a Python object for pickling\";\nstatic const char __pyx_k_self__reader_cannot_be_converted[] = \"self._reader cannot be converted to a Python object for pickling\";\nstatic const char __pyx_k_self__siter_self__table_cannot_b[] = \"self._siter,self._table cannot be converted to a Python object for pickling\";\nstatic const char __pyx_k_self__smart_table_self__table_ca[] = \"self._smart_table,self._table cannot be converted to a Python object for pickling\";\nstatic const char __pyx_k_self__weight_cannot_be_converted[] = \"self._weight cannot be converted to a Python object for pickling\";\nstatic const char __pyx_k_self__writer_cannot_be_converted[] = \"self._writer cannot be converted to a Python object for pickling\";\nstatic PyObject *__pyx_n_s_ACCEPTOR;\nstatic PyObject *__pyx_n_s_ACCESSIBLE;\nstatic PyObject *__pyx_n_s_ACYCLIC;\nstatic PyObject *__pyx_n_s_ADD_ARC_PROPERTIES;\nstatic PyObject *__pyx_n_s_ADD_STATE_PROPERTIES;\nstatic PyObject *__pyx_n_s_ADD_SUPERFINAL_PROPERTIES;\nstatic PyObject *__pyx_n_s_ARC_FLAGS;\nstatic PyObject *__pyx_n_s_ARC_I_LABEL_VALUE;\nstatic PyObject *__pyx_n_s_ARC_NEXT_STATE_VALUE;\nstatic PyObject *__pyx_n_s_ARC_NO_CACHE;\nstatic PyObject *__pyx_n_s_ARC_O_LABEL_VALUE;\nstatic PyObject *__pyx_n_s_ARC_SORT_PROPERTIES;\nstatic PyObject *__pyx_n_s_ARC_VALUE_FLAGS;\nstatic PyObject *__pyx_n_s_ARC_WEIGHT_VALUE;\nstatic PyObject *__pyx_kp_s_ArcIterator_at_0x_x;\nstatic PyObject *__pyx_kp_s_Arc_at_0x_x;\nstatic PyObject *__pyx_n_s_BINARY_PROPERTIES;\nstatic PyObject *__pyx_n_s_COACCESSIBLE;\nstatic PyObject *__pyx_n_s_COPY_PROPERTIES;\nstatic PyObject *__pyx_n_s_CYCLIC;\nstatic PyObject *__pyx_n_s_CalledProcessError;\nstatic PyObject *__pyx_kp_s_Cannot_construct;\nstatic PyObject *__pyx_kp_s_Cannot_encode_as_string_r;\nstatic PyObject *__pyx_kp_s_Cannot_topsort_cyclic_FST;\nstatic PyObject *__pyx_kp_s_Compilation_failed;\nstatic PyObject *__pyx_kp_s_Conversion_to_r_failed;\nstatic PyObject *__pyx_n_s_DELETE_ARC_PROPERTIES;\nstatic PyObject *__pyx_n_s_DELETE_STATE_PROPERTIES;\nstatic PyObject *__pyx_n_s_DOT_TSVG;\nstatic PyObject *__pyx_n_s_ENCODE_FLAGS;\nstatic PyObject *__pyx_n_s_ENCODE_LABELS;\nstatic PyObject *__pyx_n_s_ENCODE_WEIGHTS;\nstatic PyObject *__pyx_n_s_EPSILONS;\nstatic PyObject *__pyx_n_s_ERROR;\nstatic PyObject *__pyx_n_s_EXPANDED;\nstatic PyObject *__pyx_n_s_EXTRINSIC_PROPERTIES;\nstatic PyObject *__pyx_kp_s_EncodeMapper_at_0x_x;\nstatic PyObject *__pyx_n_s_FST_PROPERTIES;\nstatic PyObject *__pyx_kp_s_FarReader_at_0x_x;\nstatic PyObject *__pyx_kp_s_FarWriter_at_0x_x;\nstatic PyObject *__pyx_n_s_Fst;\nstatic PyObject *__pyx_n_s_FstArgError;\nstatic PyObject *__pyx_n_s_FstBadWeightError;\nstatic PyObject *__pyx_n_s_FstDeletedConstructorError;\nstatic PyObject *__pyx_n_s_FstError;\nstatic PyObject *__pyx_n_s_FstIOError;\nstatic PyObject *__pyx_n_s_FstIndexError;\nstatic PyObject *__pyx_n_s_FstOpError;\nstatic PyObject *__pyx_kp_s_Fst_SymbolTable_r_at_0x_x;\nstatic PyObject *__pyx_n_s_Fst___new;\nstatic PyObject *__pyx_kp_s_Fst_arc_type_standard_Construct;\nstatic PyObject *__pyx_kp_s_Fst_at_0x_x;\nstatic PyObject *__pyx_n_s_Fst_read;\nstatic PyObject *__pyx_n_s_Fst_read_from_string;\nstatic PyObject *__pyx_n_s_INITIAL_ACYCLIC;\nstatic PyObject *__pyx_n_s_INITIAL_CYCLIC;\nstatic PyObject *__pyx_n_s_INTRINSIC_PROPERTIES;\nstatic PyObject *__pyx_n_s_IOError;\nstatic PyObject *__pyx_n_s_I_DETERMINISTIC;\nstatic PyObject *__pyx_n_s_I_EPSILONS;\nstatic PyObject *__pyx_n_s_I_LABEL_INVARIANT_PROPERTIES;\nstatic PyObject *__pyx_n_s_I_LABEL_SORTED;\nstatic PyObject *__pyx_kp_s_Incompatible_or_invalid_arc_type;\nstatic PyObject *__pyx_kp_s_Incompatible_or_invalid_weight;\nstatic PyObject *__pyx_kp_s_Incompatible_or_invalid_weight_t;\nstatic PyObject *__pyx_n_s_IndexError;\nstatic PyObject *__pyx_kp_s_Invalid_weight;\nstatic PyObject *__pyx_n_s_KeyError;\nstatic PyObject *__pyx_kp_s_Key_out_of_order;\nstatic PyObject *__pyx_n_s_MUTABLE;\nstatic PyObject *__pyx_kp_s_MutableArcIterator_at_0x_x;\nstatic PyObject *__pyx_n_s_NEG_TRINARY_PROPERTIES;\nstatic PyObject *__pyx_n_s_NON_I_DETERMINISTIC;\nstatic PyObject *__pyx_n_s_NON_O_DETERMINISTIC;\nstatic PyObject *__pyx_n_s_NOT_ACCEPTOR;\nstatic PyObject *__pyx_n_s_NOT_ACCESSIBLE;\nstatic PyObject *__pyx_n_s_NOT_COACCESSIBLE;\nstatic PyObject *__pyx_n_s_NOT_I_LABEL_SORTED;\nstatic PyObject *__pyx_n_s_NOT_O_LABEL_SORTED;\nstatic PyObject *__pyx_n_s_NOT_STRING;\nstatic PyObject *__pyx_n_s_NOT_TOP_SORTED;\nstatic PyObject *__pyx_n_s_NO_EPSILONS;\nstatic PyObject *__pyx_n_s_NO_I_EPSILONS;\nstatic PyObject *__pyx_n_s_NO_LABEL;\nstatic PyObject *__pyx_n_s_NO_O_EPSILONS;\nstatic PyObject *__pyx_n_s_NO_STATE_ID;\nstatic PyObject *__pyx_n_s_NO_SYMBOL;\nstatic PyObject *__pyx_n_s_NULL_PROPERTIES;\nstatic PyObject *__pyx_n_s_NoWeight;\nstatic PyObject *__pyx_kp_s_No_new_SymbolTables_specified;\nstatic PyObject *__pyx_kp_s_No_relabeling_pairs_specified;\nstatic PyObject *__pyx_n_s_Number;\nstatic PyObject *__pyx_n_s_O_DETERMINISTIC;\nstatic PyObject *__pyx_n_s_O_EPSILONS;\nstatic PyObject *__pyx_n_s_O_LABEL_INVARIANT_PROPERTIES;\nstatic PyObject *__pyx_n_s_O_LABEL_SORTED;\nstatic PyObject *__pyx_n_s_One;\nstatic PyObject *__pyx_kp_s_Open_failed_r;\nstatic PyObject *__pyx_kp_s_Operation_failed;\nstatic PyObject *__pyx_n_s_PIPE;\nstatic PyObject *__pyx_n_s_POS_TRINARY_PROPERTIES;\nstatic PyObject *__pyx_n_s_Popen;\nstatic PyObject *__pyx_n_s_RM_SUPERFINAL_PROPERTIES;\nstatic PyObject *__pyx_kp_s_Read_failed_r;\nstatic PyObject *__pyx_kp_s_Read_failed_string;\nstatic PyObject *__pyx_n_s_RuntimeError;\nstatic PyObject *__pyx_n_s_SET_ARC_PROPERTIES;\nstatic PyObject *__pyx_n_s_SET_FINAL_PROPERTIES;\nstatic PyObject *__pyx_n_s_SET_START_PROPERTIES;\nstatic PyObject *__pyx_n_s_STATE_SORT_PROPERTIES;\nstatic PyObject *__pyx_n_s_STRING;\nstatic PyObject *__pyx_kp_s_StateIterator_at_0x_x;\nstatic PyObject *__pyx_kp_s_State_index_out_of_range;\nstatic PyObject *__pyx_n_s_StopIteration;\nstatic PyObject *__pyx_kp_s_SymbolTableIterator_at_0x_x;\nstatic PyObject *__pyx_kp_s_SymbolTable_r_at_0x_x;\nstatic PyObject *__pyx_n_s_TOP_SORTED;\nstatic PyObject *__pyx_n_s_TRINARY_PROPERTIES;\nstatic PyObject *__pyx_kp_s_Tsvg;\nstatic PyObject *__pyx_n_s_TypeError;\nstatic PyObject *__pyx_n_s_UNWEIGHTED;\nstatic PyObject *__pyx_n_s_UNWEIGHTED_CYCLES;\nstatic PyObject *__pyx_kp_s_Unknown_arc_type_r;\nstatic PyObject *__pyx_kp_s_Unknown_compose_filter_type_r;\nstatic PyObject *__pyx_kp_s_Unknown_determinization_type_r;\nstatic PyObject *__pyx_kp_s_Unknown_map_type_r;\nstatic PyObject *__pyx_kp_s_Unknown_queue_type_r;\nstatic PyObject *__pyx_kp_s_Unknown_random_arc_selection_typ;\nstatic PyObject *__pyx_kp_s_Unknown_replace_label_type_r;\nstatic PyObject *__pyx_kp_s_Unknown_sort_type_r;\nstatic PyObject *__pyx_n_s_ValueError;\nstatic PyObject *__pyx_n_s_WEIGHTED;\nstatic PyObject *__pyx_n_s_WEIGHTED_CYCLES;\nstatic PyObject *__pyx_n_s_WEIGHT_INVARIANT_PROPERTIES;\nstatic PyObject *__pyx_kp_s_Weight_at_0x_x;\nstatic PyObject *__pyx_kp_s_Weight_type_not_found;\nstatic PyObject *__pyx_kp_s_Write_failed_r;\nstatic PyObject *__pyx_kp_s_Write_to_string_failed;\nstatic PyObject *__pyx_n_s_Zero;\nstatic PyObject *__pyx_kp_b__24;\nstatic PyObject *__pyx_n_s_acceptor;\nstatic PyObject *__pyx_n_s_add;\nstatic PyObject *__pyx_n_s_add_state;\nstatic PyObject *__pyx_n_s_add_symbol;\nstatic PyObject *__pyx_n_s_add_table;\nstatic PyObject *__pyx_n_s_allow_negative_labels;\nstatic PyObject *__pyx_n_s_allow_nondet;\nstatic PyObject *__pyx_n_s_arc;\nstatic PyObject *__pyx_n_s_arc_type;\nstatic PyObject *__pyx_n_s_arcs;\nstatic PyObject *__pyx_n_s_atexit;\nstatic PyObject *__pyx_n_s_attach_new_isymbols;\nstatic PyObject *__pyx_n_s_attach_new_osymbols;\nstatic PyObject *__pyx_n_b_auto;\nstatic PyObject *__pyx_n_s_available_key;\nstatic PyObject *__pyx_n_s_call_arc_labeling;\nstatic PyObject *__pyx_n_s_checksum;\nstatic PyObject *__pyx_n_s_class;\nstatic PyObject *__pyx_n_s_cline_in_traceback;\nstatic PyObject *__pyx_n_s_closure_plus;\nstatic PyObject *__pyx_n_s_cls;\nstatic PyObject *__pyx_n_s_communicate;\nstatic PyObject *__pyx_n_s_compile;\nstatic PyObject *__pyx_n_s_compose_filter;\nstatic PyObject *__pyx_n_s_connect;\nstatic PyObject *__pyx_kp_s_const_EncodeMapper_SymbolTable;\nstatic PyObject *__pyx_kp_s_const_Fst_SymbolTable_r_at_0x_x;\nstatic PyObject *__pyx_n_s_copy;\nstatic PyObject *__pyx_n_s_create;\nstatic PyObject *__pyx_n_s_decode;\nstatic PyObject *__pyx_n_b_default;\nstatic PyObject *__pyx_n_s_delta;\nstatic PyObject *__pyx_n_s_det_type;\nstatic PyObject *__pyx_n_s_distance;\nstatic PyObject *__pyx_n_s_divide;\nstatic PyObject *__pyx_n_s_doc;\nstatic PyObject *__pyx_n_s_done;\nstatic PyObject *__pyx_n_s_dot;\nstatic PyObject *__pyx_n_s_draw;\nstatic PyObject *__pyx_n_s_encode;\nstatic PyObject *__pyx_n_s_encode_labels;\nstatic PyObject *__pyx_n_s_encode_weights;\nstatic PyObject *__pyx_n_s_eps_norm_output;\nstatic PyObject *__pyx_n_s_epsilon_on_replace;\nstatic PyObject *__pyx_n_s_error;\nstatic PyObject *__pyx_n_s_far_type;\nstatic PyObject *__pyx_n_s_filename;\nstatic PyObject *__pyx_n_s_final;\nstatic PyObject *__pyx_n_s_find;\nstatic PyObject *__pyx_n_s_flags;\nstatic PyObject *__pyx_n_s_float_format;\nstatic PyObject *__pyx_n_s_fontsize;\nstatic PyObject *__pyx_n_s_format;\nstatic PyObject *__pyx_n_s_fst_error_fatal_old;\nstatic PyObject *__pyx_n_s_fst_type;\nstatic PyObject *__pyx_n_b_functional;\nstatic PyObject *__pyx_n_b_g;\nstatic PyObject *__pyx_n_s_get_fst;\nstatic PyObject *__pyx_n_s_get_key;\nstatic PyObject *__pyx_n_s_get_nth_key;\nstatic PyObject *__pyx_n_s_getstate;\nstatic PyObject *__pyx_n_s_height;\nstatic PyObject *__pyx_n_s_id;\nstatic PyObject *__pyx_n_b_identity;\nstatic PyObject *__pyx_n_s_ifst;\nstatic PyObject *__pyx_n_s_ifst1;\nstatic PyObject *__pyx_n_s_ifst2;\nstatic PyObject *__pyx_n_b_ilabel;\nstatic PyObject *__pyx_n_s_ilabel;\nstatic PyObject *__pyx_n_s_import;\nstatic PyObject *__pyx_n_s_increment_subsequential_label;\nstatic PyObject *__pyx_n_b_input;\nstatic PyObject *__pyx_n_s_input_symbols;\nstatic PyObject *__pyx_n_s_input_table;\nstatic PyObject *__pyx_n_s_ipairs;\nstatic PyObject *__pyx_n_s_isymbols;\nstatic PyObject *__pyx_n_s_kNoSymbol;\nstatic PyObject *__pyx_n_s_keep_isymbols;\nstatic PyObject *__pyx_n_s_keep_osymbols;\nstatic PyObject *__pyx_n_s_keep_state_numbering;\nstatic PyObject *__pyx_n_s_key;\nstatic PyObject *__pyx_n_s_labeled_checksum;\nstatic PyObject *__pyx_n_s_lhs;\nstatic PyObject *__pyx_n_s_logging;\nstatic PyObject *__pyx_n_s_main;\nstatic PyObject *__pyx_n_s_map_type;\nstatic PyObject *__pyx_n_s_mask;\nstatic PyObject *__pyx_n_s_max_length;\nstatic PyObject *__pyx_n_s_member;\nstatic PyObject *__pyx_n_s_metaclass;\nstatic PyObject *__pyx_n_s_missing_sym;\nstatic PyObject *__pyx_n_s_module;\nstatic PyObject *__pyx_n_s_mutable_arcs;\nstatic PyObject *__pyx_n_s_n;\nstatic PyObject *__pyx_n_s_name;\nstatic PyObject *__pyx_n_s_name_2;\nstatic PyObject *__pyx_n_b_neither;\nstatic PyObject *__pyx_n_s_new;\nstatic PyObject *__pyx_n_s_new_isymbols;\nstatic PyObject *__pyx_n_s_new_osymbols;\nstatic PyObject *__pyx_n_s_next;\nstatic PyObject *__pyx_n_s_nextstate;\nstatic PyObject *__pyx_kp_s_no_default___reduce___due_to_non;\nstatic PyObject *__pyx_n_s_nodesep;\nstatic PyObject *__pyx_n_s_npath;\nstatic PyObject *__pyx_n_s_nshortest;\nstatic PyObject *__pyx_n_s_nstate;\nstatic PyObject *__pyx_n_s_num_arcs;\nstatic PyObject *__pyx_n_s_num_input_epsilons;\nstatic PyObject *__pyx_n_s_num_output_epsilons;\nstatic PyObject *__pyx_n_s_num_states;\nstatic PyObject *__pyx_n_s_num_symbols;\nstatic PyObject *__pyx_n_s_numbers;\nstatic PyObject *__pyx_n_s_object;\nstatic PyObject *__pyx_n_s_olabel;\nstatic PyObject *__pyx_n_s_old_isymbols;\nstatic PyObject *__pyx_n_s_old_osymbols;\nstatic PyObject *__pyx_n_s_opairs;\nstatic PyObject *__pyx_n_s_open;\nstatic PyObject *__pyx_n_s_osymbols;\nstatic PyObject *__pyx_n_s_output_symbols;\nstatic PyObject *__pyx_n_s_pairs;\nstatic PyObject *__pyx_n_s_plus;\nstatic PyObject *__pyx_n_s_portrait;\nstatic PyObject *__pyx_n_s_position;\nstatic PyObject *__pyx_n_s_potentials;\nstatic PyObject *__pyx_n_s_power;\nstatic PyObject *__pyx_n_s_precision;\nstatic PyObject *__pyx_n_s_prepare;\nstatic PyObject *__pyx_n_s_project_output;\nstatic PyObject *__pyx_n_s_properties;\nstatic PyObject *__pyx_n_s_props;\nstatic PyObject *__pyx_n_s_push_labels;\nstatic PyObject *__pyx_n_s_push_weights;\nstatic PyObject *__pyx_kp_b_pywrapfst;\nstatic PyObject *__pyx_n_s_pywrapfst_2;\nstatic PyObject *__pyx_kp_s_pywrapfst_pyx;\nstatic PyObject *__pyx_n_s_pyx_vtable;\nstatic PyObject *__pyx_n_s_qualname;\nstatic PyObject *__pyx_n_s_queue_type;\nstatic PyObject *__pyx_n_s_ranksep;\nstatic PyObject *__pyx_n_s_read;\nstatic PyObject *__pyx_n_s_read_from_string;\nstatic PyObject *__pyx_n_s_read_from_string_2;\nstatic PyObject *__pyx_n_s_read_fst;\nstatic PyObject *__pyx_n_s_read_text;\nstatic PyObject *__pyx_n_s_reduce;\nstatic PyObject *__pyx_n_s_reduce_cython;\nstatic PyObject *__pyx_n_s_reduce_ex;\nstatic PyObject *__pyx_n_s_register;\nstatic PyObject *__pyx_n_s_remove_common_affix;\nstatic PyObject *__pyx_n_s_remove_total_weight;\nstatic PyObject *__pyx_n_b_repr_svg;\nstatic PyObject *__pyx_n_s_require_superinitial;\nstatic PyObject *__pyx_n_s_reset;\nstatic PyObject *__pyx_n_s_reset_fst_error_fatal;\nstatic PyObject *__pyx_n_s_result;\nstatic PyObject *__pyx_n_s_return_arc_labeling;\nstatic PyObject *__pyx_n_s_return_label;\nstatic PyObject *__pyx_n_s_returncode;\nstatic PyObject *__pyx_n_s_reverse;\nstatic PyObject *__pyx_n_s_rhs;\nstatic PyObject *__pyx_n_s_seed;\nstatic PyObject *__pyx_n_s_seek;\nstatic PyObject *__pyx_n_s_select;\nstatic PyObject *__pyx_kp_s_self__aiter_self__fst_cannot_be;\nstatic PyObject *__pyx_kp_s_self__aiter_self__mfst_cannot_be;\nstatic PyObject *__pyx_kp_s_self__arc_cannot_be_converted_to;\nstatic PyObject *__pyx_kp_s_self__encoder_cannot_be_converte;\nstatic PyObject *__pyx_kp_s_self__encoder_self__table_cannot;\nstatic PyObject *__pyx_kp_s_self__fst_self__siter_cannot_be;\nstatic PyObject *__pyx_kp_s_self__fst_self__table_cannot_be;\nstatic PyObject *__pyx_kp_s_self__mfst_self__table_cannot_be;\nstatic PyObject *__pyx_kp_s_self__reader_cannot_be_converted;\nstatic PyObject *__pyx_kp_s_self__siter_self__table_cannot_b;\nstatic PyObject *__pyx_kp_s_self__smart_table_self__table_ca;\nstatic PyObject *__pyx_kp_s_self__table_cannot_be_converted;\nstatic PyObject *__pyx_kp_s_self__weight_cannot_be_converted;\nstatic PyObject *__pyx_kp_s_self__writer_cannot_be_converted;\nstatic PyObject *__pyx_n_s_set_flags;\nstatic PyObject *__pyx_n_s_set_input_symbols;\nstatic PyObject *__pyx_n_s_set_name;\nstatic PyObject *__pyx_n_s_set_output_symbols;\nstatic PyObject *__pyx_n_s_set_value;\nstatic PyObject *__pyx_n_s_setstate;\nstatic PyObject *__pyx_n_s_setstate_cython;\nstatic PyObject *__pyx_n_s_shortestdistance;\nstatic PyObject *__pyx_n_s_show_weight_one;\nstatic PyObject *__pyx_n_s_sort_type;\nstatic PyObject *__pyx_n_s_ssymbols;\nstatic PyObject *__pyx_n_b_standard;\nstatic PyObject *__pyx_n_s_start;\nstatic PyObject *__pyx_n_s_state;\nstatic PyObject *__pyx_n_s_states;\nstatic PyObject *__pyx_n_s_staticmethod;\nstatic PyObject *__pyx_n_s_stderr;\nstatic PyObject *__pyx_n_s_stdin;\nstatic PyObject *__pyx_n_s_stdout;\nstatic PyObject *__pyx_n_s_subprocess;\nstatic PyObject *__pyx_n_s_subsequential_label;\nstatic PyObject *__pyx_n_s_symbol;\nstatic PyObject *__pyx_n_s_syms;\nstatic PyObject *__pyx_n_s_test;\nstatic PyObject *__pyx_n_s_test_2;\nstatic PyObject *__pyx_n_s_text;\nstatic PyObject *__pyx_n_s_times;\nstatic PyObject *__pyx_n_s_title;\nstatic PyObject *__pyx_n_s_to_final;\nstatic PyObject *__pyx_n_s_to_string;\nstatic PyObject *__pyx_n_b_tropical;\nstatic PyObject *__pyx_n_s_type;\nstatic PyObject *__pyx_n_b_uniform;\nstatic PyObject *__pyx_n_s_unique;\nstatic PyObject *__pyx_n_s_unknown_isymbol;\nstatic PyObject *__pyx_n_s_unknown_osymbol;\nstatic PyObject *__pyx_kp_b_unspecified;\nstatic PyObject *__pyx_n_s_utf8;\nstatic PyObject *__pyx_n_s_value;\nstatic PyObject *__pyx_n_b_vector;\nstatic PyObject *__pyx_n_s_verify;\nstatic PyObject *__pyx_n_s_vertical;\nstatic PyObject *__pyx_n_s_w;\nstatic PyObject *__pyx_n_s_warning;\nstatic PyObject *__pyx_n_s_weight;\nstatic PyObject *__pyx_n_s_weight_type;\nstatic PyObject *__pyx_n_s_weighted;\nstatic PyObject *__pyx_n_s_width;\nstatic PyObject *__pyx_n_s_write;\nstatic PyObject *__pyx_n_s_write_text;\nstatic PyObject *__pyx_n_b_write_to_string;\nstatic PyObject *__pyx_n_s_write_to_string;\nstatic PyObject *__pyx_pf_9pywrapfst_6Weight___repr__(struct __pyx_obj_9pywrapfst_Weight *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_6Weight_2__str__(struct __pyx_obj_9pywrapfst_Weight *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_6Weight_4__float__(struct __pyx_obj_9pywrapfst_Weight *__pyx_v_self); /* proto */\nstatic int __pyx_pf_9pywrapfst_6Weight_6__init__(struct __pyx_obj_9pywrapfst_Weight *__pyx_v_self, PyObject *__pyx_v_weight_type, PyObject *__pyx_v_weight); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_6Weight_8copy(struct __pyx_obj_9pywrapfst_Weight *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_6Weight_10Zero(CYTHON_UNUSED PyTypeObject *__pyx_v_cls, PyObject *__pyx_v_weight_type); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_6Weight_12One(CYTHON_UNUSED PyTypeObject *__pyx_v_cls, PyObject *__pyx_v_weight_type); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_6Weight_14NoWeight(CYTHON_UNUSED PyTypeObject *__pyx_v_cls, PyObject *__pyx_v_weight_type); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_6Weight_16__eq__(struct __pyx_obj_9pywrapfst_Weight *__pyx_v_w1, struct __pyx_obj_9pywrapfst_Weight *__pyx_v_w2); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_6Weight_18__ne__(struct __pyx_obj_9pywrapfst_Weight *__pyx_v_w1, struct __pyx_obj_9pywrapfst_Weight *__pyx_v_w2); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_6Weight_20to_string(struct __pyx_obj_9pywrapfst_Weight *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_6Weight_22type(struct __pyx_obj_9pywrapfst_Weight *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_6Weight_24__reduce_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst_Weight *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_6Weight_26__setstate_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst_Weight *__pyx_v_self, CYTHON_UNUSED PyObject *__pyx_v___pyx_state); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_plus(CYTHON_UNUSED PyObject *__pyx_self, struct __pyx_obj_9pywrapfst_Weight *__pyx_v_lhs, struct __pyx_obj_9pywrapfst_Weight *__pyx_v_rhs); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_2times(CYTHON_UNUSED PyObject *__pyx_self, struct __pyx_obj_9pywrapfst_Weight *__pyx_v_lhs, struct __pyx_obj_9pywrapfst_Weight *__pyx_v_rhs); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_4divide(CYTHON_UNUSED PyObject *__pyx_self, struct __pyx_obj_9pywrapfst_Weight *__pyx_v_lhs, struct __pyx_obj_9pywrapfst_Weight *__pyx_v_rhs); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_6power(CYTHON_UNUSED PyObject *__pyx_self, struct __pyx_obj_9pywrapfst_Weight *__pyx_v_w, size_t __pyx_v_n); /* proto */\nstatic int __pyx_pf_9pywrapfst_12_SymbolTable___init__(struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_12_SymbolTable_2__iter__(struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_12_SymbolTable_4available_key(struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_12_SymbolTable_6checksum(struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_12_SymbolTable_8copy(struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_12_SymbolTable_10find(struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_self, PyObject *__pyx_v_key); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_12_SymbolTable_12get_nth_key(struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_self, Py_ssize_t __pyx_v_pos); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_12_SymbolTable_14labeled_checksum(struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_12_SymbolTable_16member(struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_self, PyObject *__pyx_v_key); /* proto */\nstatic int __pyx_pf_9pywrapfst_12_SymbolTable_18__contains__(struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_self, PyObject *__pyx_v_key); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_12_SymbolTable_20name(struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_12_SymbolTable_22num_symbols(struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_12_SymbolTable_24write(struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_self, PyObject *__pyx_v_filename); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_12_SymbolTable_26write_text(struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_self, PyObject *__pyx_v_filename); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_12_SymbolTable_28__reduce_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_12_SymbolTable_30__setstate_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_self, CYTHON_UNUSED PyObject *__pyx_v___pyx_state); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_24_EncodeMapperSymbolTable___repr__(struct __pyx_obj_9pywrapfst__EncodeMapperSymbolTable *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_24_EncodeMapperSymbolTable_2__reduce_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst__EncodeMapperSymbolTable *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_24_EncodeMapperSymbolTable_4__setstate_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst__EncodeMapperSymbolTable *__pyx_v_self, CYTHON_UNUSED PyObject *__pyx_v___pyx_state); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_15_FstSymbolTable___repr__(struct __pyx_obj_9pywrapfst__FstSymbolTable *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_15_FstSymbolTable_2__reduce_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst__FstSymbolTable *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_15_FstSymbolTable_4__setstate_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst__FstSymbolTable *__pyx_v_self, CYTHON_UNUSED PyObject *__pyx_v___pyx_state); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_19_MutableSymbolTable_add_symbol(struct __pyx_obj_9pywrapfst__MutableSymbolTable *__pyx_v_self, PyObject *__pyx_v_symbol, __pyx_t_10basictypes_int64 __pyx_v_key); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_19_MutableSymbolTable_2add_table(struct __pyx_obj_9pywrapfst__MutableSymbolTable *__pyx_v_self, struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_syms); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_19_MutableSymbolTable_4set_name(struct __pyx_obj_9pywrapfst__MutableSymbolTable *__pyx_v_self, PyObject *__pyx_v_new_name); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_19_MutableSymbolTable_6__reduce_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst__MutableSymbolTable *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_19_MutableSymbolTable_8__setstate_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst__MutableSymbolTable *__pyx_v_self, CYTHON_UNUSED PyObject *__pyx_v___pyx_state); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_22_MutableFstSymbolTable___repr__(struct __pyx_obj_9pywrapfst__MutableFstSymbolTable *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_22_MutableFstSymbolTable_2__reduce_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst__MutableFstSymbolTable *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_22_MutableFstSymbolTable_4__setstate_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst__MutableFstSymbolTable *__pyx_v_self, CYTHON_UNUSED PyObject *__pyx_v___pyx_state); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_11SymbolTable___repr__(struct __pyx_obj_9pywrapfst_SymbolTable *__pyx_v_self); /* proto */\nstatic int __pyx_pf_9pywrapfst_11SymbolTable_2__init__(struct __pyx_obj_9pywrapfst_SymbolTable *__pyx_v_self, PyObject *__pyx_v_name); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_11SymbolTable_4read(CYTHON_UNUSED PyTypeObject *__pyx_v_cls, PyObject *__pyx_v_filename); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_11SymbolTable_6read_text(CYTHON_UNUSED PyTypeObject *__pyx_v_cls, PyObject *__pyx_v_filename, bool __pyx_v_allow_negative_labels); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_11SymbolTable_8read_fst(CYTHON_UNUSED PyTypeObject *__pyx_v_cls, PyObject *__pyx_v_filename, bool __pyx_v_input_table); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_11SymbolTable_10__reduce_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst_SymbolTable *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_11SymbolTable_12__setstate_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst_SymbolTable *__pyx_v_self, CYTHON_UNUSED PyObject *__pyx_v___pyx_state); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_8compact_symbol_table(CYTHON_UNUSED PyObject *__pyx_self, struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_syms); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_10merge_symbol_table(CYTHON_UNUSED PyObject *__pyx_self, struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_lhs, struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_rhs); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_19SymbolTableIterator___repr__(struct __pyx_obj_9pywrapfst_SymbolTableIterator *__pyx_v_self); /* proto */\nstatic int __pyx_pf_9pywrapfst_19SymbolTableIterator_2__init__(struct __pyx_obj_9pywrapfst_SymbolTableIterator *__pyx_v_self, struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_syms); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_19SymbolTableIterator_4__iter__(struct __pyx_obj_9pywrapfst_SymbolTableIterator *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_19SymbolTableIterator_6__next__(struct __pyx_obj_9pywrapfst_SymbolTableIterator *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_19SymbolTableIterator_8done(struct __pyx_obj_9pywrapfst_SymbolTableIterator *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_19SymbolTableIterator_10next(struct __pyx_obj_9pywrapfst_SymbolTableIterator *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_19SymbolTableIterator_12reset(struct __pyx_obj_9pywrapfst_SymbolTableIterator *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_19SymbolTableIterator_14symbol(struct __pyx_obj_9pywrapfst_SymbolTableIterator *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_19SymbolTableIterator_16value(struct __pyx_obj_9pywrapfst_SymbolTableIterator *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_19SymbolTableIterator_18__reduce_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst_SymbolTableIterator *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_19SymbolTableIterator_20__setstate_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst_SymbolTableIterator *__pyx_v_self, CYTHON_UNUSED PyObject *__pyx_v___pyx_state); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_12EncodeMapper___repr__(struct __pyx_obj_9pywrapfst_EncodeMapper *__pyx_v_self); /* proto */\nstatic int __pyx_pf_9pywrapfst_12EncodeMapper_2__init__(struct __pyx_obj_9pywrapfst_EncodeMapper *__pyx_v_self, PyObject *__pyx_v_arc_type, bool __pyx_v_encode_labels, bool __pyx_v_encode_weights); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_12EncodeMapper_4arc_type(struct __pyx_obj_9pywrapfst_EncodeMapper *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_12EncodeMapper_6__call__(struct __pyx_obj_9pywrapfst_EncodeMapper *__pyx_v_self, struct __pyx_obj_9pywrapfst_Arc *__pyx_v_arc); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_12EncodeMapper_8flags(struct __pyx_obj_9pywrapfst_EncodeMapper *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_12EncodeMapper_10input_symbols(struct __pyx_obj_9pywrapfst_EncodeMapper *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_12EncodeMapper_12output_symbols(struct __pyx_obj_9pywrapfst_EncodeMapper *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_12EncodeMapper_14properties(struct __pyx_obj_9pywrapfst_EncodeMapper *__pyx_v_self, __pyx_t_10basictypes_uint64 __pyx_v_mask); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_12EncodeMapper_16set_input_symbols(struct __pyx_obj_9pywrapfst_EncodeMapper *__pyx_v_self, struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_syms); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_12EncodeMapper_18set_output_symbols(struct __pyx_obj_9pywrapfst_EncodeMapper *__pyx_v_self, struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_syms); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_12EncodeMapper_20weight_type(struct __pyx_obj_9pywrapfst_EncodeMapper *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_12EncodeMapper_22__reduce_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst_EncodeMapper *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_12EncodeMapper_24__setstate_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst_EncodeMapper *__pyx_v_self, CYTHON_UNUSED PyObject *__pyx_v___pyx_state); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_4_Fst__repr_svg_(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_4_Fst_2__repr__(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self); /* proto */\nstatic int __pyx_pf_9pywrapfst_4_Fst_4__init__(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_4_Fst_6__str__(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_4_Fst_8__reduce__(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_4_Fst_10arc_type(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_4_Fst_12arcs(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self, __pyx_t_10basictypes_int64 __pyx_v_state); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_4_Fst_14copy(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_4_Fst_16draw(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self, PyObject *__pyx_v_filename, struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_isymbols, struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_osymbols, struct __pyx_obj_9pywrapfst_SymbolTable *__pyx_v_ssymbols, bool __pyx_v_acceptor, PyObject *__pyx_v_title, double __pyx_v_width, double __pyx_v_height, bool __pyx_v_portrait, bool __pyx_v_vertical, double __pyx_v_ranksep, double __pyx_v_nodesep, __pyx_t_10basictypes_int32 __pyx_v_fontsize, __pyx_t_10basictypes_int32 __pyx_v_precision, PyObject *__pyx_v_float_format, bool __pyx_v_show_weight_one); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_4_Fst_18final(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self, __pyx_t_10basictypes_int64 __pyx_v_state); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_4_Fst_20fst_type(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_4_Fst_22input_symbols(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_4_Fst_24num_arcs(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self, __pyx_t_10basictypes_int64 __pyx_v_state); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_4_Fst_26num_input_epsilons(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self, __pyx_t_10basictypes_int64 __pyx_v_state); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_4_Fst_28num_output_epsilons(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self, __pyx_t_10basictypes_int64 __pyx_v_state); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_4_Fst_30output_symbols(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_4_Fst_32properties(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self, __pyx_t_10basictypes_uint64 __pyx_v_mask, bool __pyx_v_test); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_4_Fst_34start(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_4_Fst_36states(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_4_Fst_38text(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self, struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_isymbols, struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_osymbols, struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_ssymbols, bool __pyx_v_acceptor, bool __pyx_v_show_weight_one, PyObject *__pyx_v_missing_sym); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_4_Fst_40verify(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_4_Fst_42weight_type(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_4_Fst_44write(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self, PyObject *__pyx_v_filename); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_4_Fst_46write_to_string(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_add_arc(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, __pyx_t_10basictypes_int64 __pyx_v_state, struct __pyx_obj_9pywrapfst_Arc *__pyx_v_arc); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_2add_state(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_4arcsort(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, PyObject *__pyx_v_sort_type); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_6closure(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, bool __pyx_v_closure_plus); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_8concat(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_10connect(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_12decode(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, struct __pyx_obj_9pywrapfst_EncodeMapper *__pyx_v_encoder); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_14delete_arcs(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, __pyx_t_10basictypes_int64 __pyx_v_state, size_t __pyx_v_n); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_16delete_states(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, PyObject *__pyx_v_states); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_18encode(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, struct __pyx_obj_9pywrapfst_EncodeMapper *__pyx_v_encoder); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_20invert(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_22minimize(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, float __pyx_v_delta, bool __pyx_v_allow_nondet); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_24mutable_arcs(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, __pyx_t_10basictypes_int64 __pyx_v_state); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_26mutable_input_symbols(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_28mutable_output_symbols(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_30num_states(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_32project(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, bool __pyx_v_project_output); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_34prune(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, float __pyx_v_delta, __pyx_t_10basictypes_int64 __pyx_v_nstate, PyObject *__pyx_v_weight); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_36push(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, float __pyx_v_delta, bool __pyx_v_remove_total_weight, bool __pyx_v_to_final); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_38relabel_pairs(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, PyObject *__pyx_v_ipairs, PyObject *__pyx_v_opairs); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_40relabel_tables(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_old_isymbols, struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_new_isymbols, PyObject *__pyx_v_unknown_isymbol, bool __pyx_v_attach_new_isymbols, struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_old_osymbols, struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_new_osymbols, PyObject *__pyx_v_unknown_osymbol, bool __pyx_v_attach_new_osymbols); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_42reserve_arcs(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, __pyx_t_10basictypes_int64 __pyx_v_state, size_t __pyx_v_n); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_44reserve_states(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, __pyx_t_10basictypes_int64 __pyx_v_n); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_46reweight(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, PyObject *__pyx_v_potentials, bool __pyx_v_to_final); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_48rmepsilon(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, PyObject *__pyx_v_queue_type, bool __pyx_v_connect, PyObject *__pyx_v_weight, __pyx_t_10basictypes_int64 __pyx_v_nstate, float __pyx_v_delta); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_50set_final(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, __pyx_t_10basictypes_int64 __pyx_v_state, PyObject *__pyx_v_weight); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_52set_input_symbols(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_syms); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_54set_output_symbols(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_syms); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_56set_properties(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, __pyx_t_10basictypes_uint64 __pyx_v_props, __pyx_t_10basictypes_uint64 __pyx_v_mask); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_58set_start(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, __pyx_t_10basictypes_int64 __pyx_v_state); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_60topsort(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_62union(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_12_read(CYTHON_UNUSED PyObject *__pyx_self, PyObject *__pyx_v_filename); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_14_read_from_string(CYTHON_UNUSED PyObject *__pyx_self, PyObject *__pyx_v_state); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_3Fst___new__(CYTHON_UNUSED PyObject *__pyx_self, CYTHON_UNUSED PyObject *__pyx_v_cls, PyObject *__pyx_v_arc_type); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_3Fst_2read(CYTHON_UNUSED PyObject *__pyx_self, PyObject *__pyx_v_filename); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_3Fst_4read_from_string(CYTHON_UNUSED PyObject *__pyx_self, PyObject *__pyx_v_state); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_3Arc___repr__(struct __pyx_obj_9pywrapfst_Arc *__pyx_v_self); /* proto */\nstatic int __pyx_pf_9pywrapfst_3Arc_2__init__(struct __pyx_obj_9pywrapfst_Arc *__pyx_v_self, __pyx_t_10basictypes_int64 __pyx_v_ilabel, __pyx_t_10basictypes_int64 __pyx_v_olabel, PyObject *__pyx_v_weight, __pyx_t_10basictypes_int64 __pyx_v_nextstate); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_3Arc_4copy(struct __pyx_obj_9pywrapfst_Arc *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_3Arc_6ilabel___get__(struct __pyx_obj_9pywrapfst_Arc *__pyx_v_self); /* proto */\nstatic int __pyx_pf_9pywrapfst_3Arc_6ilabel_2__set__(struct __pyx_obj_9pywrapfst_Arc *__pyx_v_self, __pyx_t_10basictypes_int64 __pyx_v_value); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_3Arc_6olabel___get__(struct __pyx_obj_9pywrapfst_Arc *__pyx_v_self); /* proto */\nstatic int __pyx_pf_9pywrapfst_3Arc_6olabel_2__set__(struct __pyx_obj_9pywrapfst_Arc *__pyx_v_self, __pyx_t_10basictypes_int64 __pyx_v_value); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_3Arc_6weight___get__(struct __pyx_obj_9pywrapfst_Arc *__pyx_v_self); /* proto */\nstatic int __pyx_pf_9pywrapfst_3Arc_6weight_2__set__(struct __pyx_obj_9pywrapfst_Arc *__pyx_v_self, PyObject *__pyx_v_weight); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_3Arc_9nextstate___get__(struct __pyx_obj_9pywrapfst_Arc *__pyx_v_self); /* proto */\nstatic int __pyx_pf_9pywrapfst_3Arc_9nextstate_2__set__(struct __pyx_obj_9pywrapfst_Arc *__pyx_v_self, __pyx_t_10basictypes_int64 __pyx_v_value); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_3Arc_6__reduce_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst_Arc *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_3Arc_8__setstate_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst_Arc *__pyx_v_self, CYTHON_UNUSED PyObject *__pyx_v___pyx_state); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_11ArcIterator___repr__(struct __pyx_obj_9pywrapfst_ArcIterator *__pyx_v_self); /* proto */\nstatic int __pyx_pf_9pywrapfst_11ArcIterator_2__init__(struct __pyx_obj_9pywrapfst_ArcIterator *__pyx_v_self, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst, __pyx_t_10basictypes_int64 __pyx_v_state); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_11ArcIterator_4__iter__(struct __pyx_obj_9pywrapfst_ArcIterator *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_11ArcIterator_6__next__(struct __pyx_obj_9pywrapfst_ArcIterator *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_11ArcIterator_8done(struct __pyx_obj_9pywrapfst_ArcIterator *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_11ArcIterator_10flags(struct __pyx_obj_9pywrapfst_ArcIterator *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_11ArcIterator_12next(struct __pyx_obj_9pywrapfst_ArcIterator *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_11ArcIterator_14position(struct __pyx_obj_9pywrapfst_ArcIterator *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_11ArcIterator_16reset(struct __pyx_obj_9pywrapfst_ArcIterator *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_11ArcIterator_18seek(struct __pyx_obj_9pywrapfst_ArcIterator *__pyx_v_self, size_t __pyx_v_a); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_11ArcIterator_20set_flags(struct __pyx_obj_9pywrapfst_ArcIterator *__pyx_v_self, __pyx_t_10basictypes_uint32 __pyx_v_flags, __pyx_t_10basictypes_uint32 __pyx_v_mask); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_11ArcIterator_22value(struct __pyx_obj_9pywrapfst_ArcIterator *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_11ArcIterator_24__reduce_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst_ArcIterator *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_11ArcIterator_26__setstate_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst_ArcIterator *__pyx_v_self, CYTHON_UNUSED PyObject *__pyx_v___pyx_state); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_18MutableArcIterator___repr__(struct __pyx_obj_9pywrapfst_MutableArcIterator *__pyx_v_self); /* proto */\nstatic int __pyx_pf_9pywrapfst_18MutableArcIterator_2__init__(struct __pyx_obj_9pywrapfst_MutableArcIterator *__pyx_v_self, struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_ifst, __pyx_t_10basictypes_int64 __pyx_v_state); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_18MutableArcIterator_4done(struct __pyx_obj_9pywrapfst_MutableArcIterator *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_18MutableArcIterator_6flags(struct __pyx_obj_9pywrapfst_MutableArcIterator *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_18MutableArcIterator_8next(struct __pyx_obj_9pywrapfst_MutableArcIterator *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_18MutableArcIterator_10position(struct __pyx_obj_9pywrapfst_MutableArcIterator *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_18MutableArcIterator_12reset(struct __pyx_obj_9pywrapfst_MutableArcIterator *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_18MutableArcIterator_14seek(struct __pyx_obj_9pywrapfst_MutableArcIterator *__pyx_v_self, size_t __pyx_v_a); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_18MutableArcIterator_16set_flags(struct __pyx_obj_9pywrapfst_MutableArcIterator *__pyx_v_self, __pyx_t_10basictypes_uint32 __pyx_v_flags, __pyx_t_10basictypes_uint32 __pyx_v_mask); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_18MutableArcIterator_18set_value(struct __pyx_obj_9pywrapfst_MutableArcIterator *__pyx_v_self, struct __pyx_obj_9pywrapfst_Arc *__pyx_v_arc); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_18MutableArcIterator_20value(struct __pyx_obj_9pywrapfst_MutableArcIterator *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_18MutableArcIterator_22__reduce_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst_MutableArcIterator *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_18MutableArcIterator_24__setstate_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst_MutableArcIterator *__pyx_v_self, CYTHON_UNUSED PyObject *__pyx_v___pyx_state); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_13StateIterator___repr__(struct __pyx_obj_9pywrapfst_StateIterator *__pyx_v_self); /* proto */\nstatic int __pyx_pf_9pywrapfst_13StateIterator_2__init__(struct __pyx_obj_9pywrapfst_StateIterator *__pyx_v_self, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_13StateIterator_4__iter__(struct __pyx_obj_9pywrapfst_StateIterator *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_13StateIterator_6__next__(struct __pyx_obj_9pywrapfst_StateIterator *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_13StateIterator_8done(struct __pyx_obj_9pywrapfst_StateIterator *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_13StateIterator_10next(struct __pyx_obj_9pywrapfst_StateIterator *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_13StateIterator_12reset(struct __pyx_obj_9pywrapfst_StateIterator *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_13StateIterator_14value(struct __pyx_obj_9pywrapfst_StateIterator *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_13StateIterator_16__reduce_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst_StateIterator *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_13StateIterator_18__setstate_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst_StateIterator *__pyx_v_self, CYTHON_UNUSED PyObject *__pyx_v___pyx_state); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_16arcmap(CYTHON_UNUSED PyObject *__pyx_self, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst, float __pyx_v_delta, PyObject *__pyx_v_map_type, double __pyx_v_power, PyObject *__pyx_v_weight); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_18compose(CYTHON_UNUSED PyObject *__pyx_self, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst1, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst2, PyObject *__pyx_v_compose_filter, bool __pyx_v_connect); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_20convert(CYTHON_UNUSED PyObject *__pyx_self, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst, PyObject *__pyx_v_fst_type); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_22determinize(CYTHON_UNUSED PyObject *__pyx_self, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst, float __pyx_v_delta, PyObject *__pyx_v_det_type, __pyx_t_10basictypes_int64 __pyx_v_nstate, __pyx_t_10basictypes_int64 __pyx_v_subsequential_label, PyObject *__pyx_v_weight, bool __pyx_v_increment_subsequential_label); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_24difference(CYTHON_UNUSED PyObject *__pyx_self, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst1, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst2, PyObject *__pyx_v_compose_filter, bool __pyx_v_connect); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_26disambiguate(CYTHON_UNUSED PyObject *__pyx_self, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst, float __pyx_v_delta, __pyx_t_10basictypes_int64 __pyx_v_nstate, __pyx_t_10basictypes_int64 __pyx_v_subsequential_label, PyObject *__pyx_v_weight); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_28epsnormalize(CYTHON_UNUSED PyObject *__pyx_self, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst, bool __pyx_v_eps_norm_output); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_30equal(CYTHON_UNUSED PyObject *__pyx_self, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst1, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst2, float __pyx_v_delta); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_32equivalent(CYTHON_UNUSED PyObject *__pyx_self, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst1, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst2, float __pyx_v_delta); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_34intersect(CYTHON_UNUSED PyObject *__pyx_self, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst1, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst2, PyObject *__pyx_v_compose_filter, bool __pyx_v_connect); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_36isomorphic(CYTHON_UNUSED PyObject *__pyx_self, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst1, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst2, float __pyx_v_delta); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_38prune(CYTHON_UNUSED PyObject *__pyx_self, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst, float __pyx_v_delta, __pyx_t_10basictypes_int64 __pyx_v_nstate, PyObject *__pyx_v_weight); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_40push(CYTHON_UNUSED PyObject *__pyx_self, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst, float __pyx_v_delta, bool __pyx_v_push_weights, bool __pyx_v_push_labels, bool __pyx_v_remove_common_affix, bool __pyx_v_remove_total_weight, bool __pyx_v_to_final); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_42randequivalent(CYTHON_UNUSED PyObject *__pyx_self, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst1, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst2, __pyx_t_10basictypes_int32 __pyx_v_npath, float __pyx_v_delta, time_t __pyx_v_seed, PyObject *__pyx_v_select, __pyx_t_10basictypes_int32 __pyx_v_max_length); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_44randgen(CYTHON_UNUSED PyObject *__pyx_self, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst, __pyx_t_10basictypes_int32 __pyx_v_npath, time_t __pyx_v_seed, PyObject *__pyx_v_select, __pyx_t_10basictypes_int32 __pyx_v_max_length, bool __pyx_v_weighted, bool __pyx_v_remove_total_weight); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_46replace(CYTHON_UNUSED PyObject *__pyx_self, PyObject *__pyx_v_pairs, PyObject *__pyx_v_call_arc_labeling, PyObject *__pyx_v_return_arc_labeling, bool __pyx_v_epsilon_on_replace, __pyx_t_10basictypes_int64 __pyx_v_return_label); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_48reverse(CYTHON_UNUSED PyObject *__pyx_self, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst, bool __pyx_v_require_superinitial); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_50shortestdistance(CYTHON_UNUSED PyObject *__pyx_self, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst, float __pyx_v_delta, __pyx_t_10basictypes_int64 __pyx_v_nstate, PyObject *__pyx_v_queue_type, bool __pyx_v_reverse); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_52shortestpath(CYTHON_UNUSED PyObject *__pyx_self, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst, float __pyx_v_delta, __pyx_t_10basictypes_int32 __pyx_v_nshortest, __pyx_t_10basictypes_int64 __pyx_v_nstate, PyObject *__pyx_v_queue_type, bool __pyx_v_unique, PyObject *__pyx_v_weight); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_54statemap(CYTHON_UNUSED PyObject *__pyx_self, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst, PyObject *__pyx_v_map_type); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_56synchronize(CYTHON_UNUSED PyObject *__pyx_self, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst); /* proto */\nstatic int __pyx_pf_9pywrapfst_8Compiler___cinit__(struct __pyx_obj_9pywrapfst_Compiler *__pyx_v_self, std::string __pyx_v_fst_type, std::string __pyx_v_arc_type, struct __pyx_obj_9pywrapfst_SymbolTable *__pyx_v_isymbols, struct __pyx_obj_9pywrapfst_SymbolTable *__pyx_v_osymbols, struct __pyx_obj_9pywrapfst_SymbolTable *__pyx_v_ssymbols, bool __pyx_v_acceptor, bool __pyx_v_keep_isymbols, bool __pyx_v_keep_osymbols, bool __pyx_v_keep_state_numbering, bool __pyx_v_allow_negative_labels); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_8Compiler_2compile(struct __pyx_obj_9pywrapfst_Compiler *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_8Compiler_4write(struct __pyx_obj_9pywrapfst_Compiler *__pyx_v_self, PyObject *__pyx_v_expression); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_8Compiler_6__reduce_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst_Compiler *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_8Compiler_8__setstate_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst_Compiler *__pyx_v_self, CYTHON_UNUSED PyObject *__pyx_v___pyx_state); /* proto */\nstatic int __pyx_pf_9pywrapfst_9FarReader___init__(struct __pyx_obj_9pywrapfst_FarReader *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_9FarReader_2__repr__(struct __pyx_obj_9pywrapfst_FarReader *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_9FarReader_4open(CYTHON_UNUSED PyTypeObject *__pyx_v_cls, PyObject *__pyx_v_filenames); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_9FarReader_6arc_type(struct __pyx_obj_9pywrapfst_FarReader *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_9FarReader_8done(struct __pyx_obj_9pywrapfst_FarReader *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_9FarReader_10error(struct __pyx_obj_9pywrapfst_FarReader *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_9FarReader_12far_type(struct __pyx_obj_9pywrapfst_FarReader *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_9FarReader_14find(struct __pyx_obj_9pywrapfst_FarReader *__pyx_v_self, PyObject *__pyx_v_key); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_9FarReader_16get_fst(struct __pyx_obj_9pywrapfst_FarReader *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_9FarReader_18get_key(struct __pyx_obj_9pywrapfst_FarReader *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_9FarReader_20next(struct __pyx_obj_9pywrapfst_FarReader *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_9FarReader_22reset(struct __pyx_obj_9pywrapfst_FarReader *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_9FarReader_24__getitem__(struct __pyx_obj_9pywrapfst_FarReader *__pyx_v_self, PyObject *__pyx_v_key); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_9FarReader_26__reduce_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst_FarReader *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_9FarReader_28__setstate_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst_FarReader *__pyx_v_self, CYTHON_UNUSED PyObject *__pyx_v___pyx_state); /* proto */\nstatic int __pyx_pf_9pywrapfst_9FarWriter___init__(struct __pyx_obj_9pywrapfst_FarWriter *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_9FarWriter_2__repr__(struct __pyx_obj_9pywrapfst_FarWriter *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_9FarWriter_4create(CYTHON_UNUSED PyTypeObject *__pyx_v_cls, PyObject *__pyx_v_filename, PyObject *__pyx_v_arc_type, PyObject *__pyx_v_far_type); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_9FarWriter_6add(struct __pyx_obj_9pywrapfst_FarWriter *__pyx_v_self, PyObject *__pyx_v_key, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_9FarWriter_8arc_type(struct __pyx_obj_9pywrapfst_FarWriter *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_9FarWriter_10error(struct __pyx_obj_9pywrapfst_FarWriter *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_9FarWriter_12far_type(struct __pyx_obj_9pywrapfst_FarWriter *__pyx_v_self); /* proto */\nstatic int __pyx_pf_9pywrapfst_9FarWriter_14__setitem__(struct __pyx_obj_9pywrapfst_FarWriter *__pyx_v_self, PyObject *__pyx_v_key, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_fst); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_9FarWriter_16__reduce_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst_FarWriter *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_9FarWriter_18__setstate_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst_FarWriter *__pyx_v_self, CYTHON_UNUSED PyObject *__pyx_v___pyx_state); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_58_reset_fst_error_fatal(CYTHON_UNUSED PyObject *__pyx_self); /* proto */\nstatic PyObject *__pyx_tp_new_9pywrapfst_Weight(PyTypeObject *t, PyObject *a, PyObject *k); /*proto*/\nstatic PyObject *__pyx_tp_new_9pywrapfst__SymbolTable(PyTypeObject *t, PyObject *a, PyObject *k); /*proto*/\nstatic PyObject *__pyx_tp_new_9pywrapfst__EncodeMapperSymbolTable(PyTypeObject *t, PyObject *a, PyObject *k); /*proto*/\nstatic PyObject *__pyx_tp_new_9pywrapfst__FstSymbolTable(PyTypeObject *t, PyObject *a, PyObject *k); /*proto*/\nstatic PyObject *__pyx_tp_new_9pywrapfst__MutableSymbolTable(PyTypeObject *t, PyObject *a, PyObject *k); /*proto*/\nstatic PyObject *__pyx_tp_new_9pywrapfst__MutableFstSymbolTable(PyTypeObject *t, PyObject *a, PyObject *k); /*proto*/\nstatic PyObject *__pyx_tp_new_9pywrapfst_SymbolTable(PyTypeObject *t, PyObject *a, PyObject *k); /*proto*/\nstatic PyObject *__pyx_tp_new_9pywrapfst_SymbolTableIterator(PyTypeObject *t, PyObject *a, PyObject *k); /*proto*/\nstatic PyObject *__pyx_tp_new_9pywrapfst_EncodeMapper(PyTypeObject *t, PyObject *a, PyObject *k); /*proto*/\nstatic PyObject *__pyx_tp_new_9pywrapfst__Fst(PyTypeObject *t, PyObject *a, PyObject *k); /*proto*/\nstatic PyObject *__pyx_tp_new_9pywrapfst__MutableFst(PyTypeObject *t, PyObject *a, PyObject *k); /*proto*/\nstatic PyObject *__pyx_tp_new_9pywrapfst_Arc(PyTypeObject *t, PyObject *a, PyObject *k); /*proto*/\nstatic PyObject *__pyx_tp_new_9pywrapfst_ArcIterator(PyTypeObject *t, PyObject *a, PyObject *k); /*proto*/\nstatic PyObject *__pyx_tp_new_9pywrapfst_MutableArcIterator(PyTypeObject *t, PyObject *a, PyObject *k); /*proto*/\nstatic PyObject *__pyx_tp_new_9pywrapfst_StateIterator(PyTypeObject *t, PyObject *a, PyObject *k); /*proto*/\nstatic PyObject *__pyx_tp_new_9pywrapfst_Compiler(PyTypeObject *t, PyObject *a, PyObject *k); /*proto*/\nstatic PyObject *__pyx_tp_new_9pywrapfst_FarReader(PyTypeObject *t, PyObject *a, PyObject *k); /*proto*/\nstatic PyObject *__pyx_tp_new_9pywrapfst_FarWriter(PyTypeObject *t, PyObject *a, PyObject *k); /*proto*/\nstatic PyObject *__pyx_int_0;\nstatic PyObject *__pyx_int_neg_1;\nstatic __pyx_t_10basictypes_int64 __pyx_k__13;\nstatic float __pyx_k__35;\nstatic float __pyx_k__36;\nstatic float __pyx_k__37;\nstatic __pyx_t_10basictypes_int64 __pyx_k__38;\nstatic float __pyx_k__39;\nstatic __pyx_t_10basictypes_int64 __pyx_k__40;\nstatic float __pyx_k__41;\nstatic float __pyx_k__42;\nstatic __pyx_t_10basictypes_int64 __pyx_k__46;\nstatic float __pyx_k__47;\nstatic __pyx_t_10basictypes_int64 __pyx_k__48;\nstatic float __pyx_k__49;\nstatic float __pyx_k__67;\nstatic float __pyx_k__68;\nstatic float __pyx_k__69;\nstatic __pyx_t_10basictypes_int64 __pyx_k__70;\nstatic float __pyx_k__71;\nstatic __pyx_t_10basictypes_int64 __pyx_k__72;\nstatic float __pyx_k__73;\nstatic float __pyx_k__74;\nstatic float __pyx_k__75;\nstatic float __pyx_k__76;\nstatic __pyx_t_10basictypes_int64 __pyx_k__77;\nstatic float __pyx_k__78;\nstatic float __pyx_k__79;\nstatic __pyx_t_10basictypes_int32 __pyx_k__80;\nstatic __pyx_t_10basictypes_int32 __pyx_k__81;\nstatic float __pyx_k__82;\nstatic __pyx_t_10basictypes_int64 __pyx_k__83;\nstatic float __pyx_k__84;\nstatic __pyx_t_10basictypes_int64 __pyx_k__85;\nstatic float __pyx_k__86;\nstatic __pyx_t_10basictypes_int64 __pyx_k__87;\nstatic std::string __pyx_k__88;\nstatic std::string __pyx_k__89;\nstatic PyObject *__pyx_tuple_;\nstatic PyObject *__pyx_tuple__2;\nstatic PyObject *__pyx_tuple__3;\nstatic PyObject *__pyx_tuple__4;\nstatic PyObject *__pyx_tuple__5;\nstatic PyObject *__pyx_tuple__6;\nstatic PyObject *__pyx_tuple__7;\nstatic PyObject *__pyx_tuple__8;\nstatic PyObject *__pyx_tuple__9;\nstatic PyObject *__pyx_tuple__10;\nstatic PyObject *__pyx_tuple__11;\nstatic PyObject *__pyx_tuple__12;\nstatic PyObject *__pyx_tuple__14;\nstatic PyObject *__pyx_tuple__15;\nstatic PyObject *__pyx_tuple__16;\nstatic PyObject *__pyx_tuple__17;\nstatic PyObject *__pyx_tuple__18;\nstatic PyObject *__pyx_tuple__19;\nstatic PyObject *__pyx_tuple__20;\nstatic PyObject *__pyx_tuple__21;\nstatic PyObject *__pyx_tuple__22;\nstatic PyObject *__pyx_tuple__23;\nstatic PyObject *__pyx_tuple__25;\nstatic PyObject *__pyx_tuple__26;\nstatic PyObject *__pyx_tuple__27;\nstatic PyObject *__pyx_tuple__28;\nstatic PyObject *__pyx_tuple__29;\nstatic PyObject *__pyx_tuple__30;\nstatic PyObject *__pyx_tuple__31;\nstatic PyObject *__pyx_tuple__32;\nstatic PyObject *__pyx_tuple__33;\nstatic PyObject *__pyx_tuple__34;\nstatic PyObject *__pyx_tuple__43;\nstatic PyObject *__pyx_tuple__44;\nstatic PyObject *__pyx_tuple__45;\nstatic PyObject *__pyx_tuple__50;\nstatic PyObject *__pyx_tuple__51;\nstatic PyObject *__pyx_tuple__52;\nstatic PyObject *__pyx_tuple__53;\nstatic PyObject *__pyx_tuple__54;\nstatic PyObject *__pyx_tuple__55;\nstatic PyObject *__pyx_tuple__56;\nstatic PyObject *__pyx_tuple__57;\nstatic PyObject *__pyx_tuple__58;\nstatic PyObject *__pyx_tuple__59;\nstatic PyObject *__pyx_tuple__60;\nstatic PyObject *__pyx_tuple__61;\nstatic PyObject *__pyx_tuple__62;\nstatic PyObject *__pyx_tuple__63;\nstatic PyObject *__pyx_tuple__64;\nstatic PyObject *__pyx_tuple__65;\nstatic PyObject *__pyx_tuple__66;\nstatic PyObject *__pyx_tuple__90;\nstatic PyObject *__pyx_tuple__91;\nstatic PyObject *__pyx_tuple__92;\nstatic PyObject *__pyx_tuple__93;\nstatic PyObject *__pyx_tuple__94;\nstatic PyObject *__pyx_tuple__95;\nstatic PyObject *__pyx_tuple__96;\nstatic PyObject *__pyx_tuple__97;\nstatic PyObject *__pyx_tuple__98;\nstatic PyObject *__pyx_tuple__99;\nstatic PyObject *__pyx_tuple__101;\nstatic PyObject *__pyx_tuple__103;\nstatic PyObject *__pyx_tuple__105;\nstatic PyObject *__pyx_tuple__107;\nstatic PyObject *__pyx_tuple__108;\nstatic PyObject *__pyx_tuple__110;\nstatic PyObject *__pyx_tuple__111;\nstatic PyObject *__pyx_tuple__113;\nstatic PyObject *__pyx_tuple__115;\nstatic PyObject *__pyx_codeobj__100;\nstatic PyObject *__pyx_codeobj__102;\nstatic PyObject *__pyx_codeobj__104;\nstatic PyObject *__pyx_codeobj__106;\nstatic PyObject *__pyx_codeobj__109;\nstatic PyObject *__pyx_codeobj__112;\nstatic PyObject *__pyx_codeobj__114;\nstatic PyObject *__pyx_codeobj__116;\nstatic PyObject *__pyx_codeobj__117;\n\n/* \"pywrapfst.pyx\":159\n * \n * \n * cdef string tostring(data, encoding=\"utf8\") except *:             # <<<<<<<<<<<<<<\n *   \"\"\"Converts strings to bytestrings.\n * \n */\n\nstatic std::string __pyx_f_9pywrapfst_tostring(PyObject *__pyx_v_data, struct __pyx_opt_args_9pywrapfst_tostring *__pyx_optional_args) {\n  PyObject *__pyx_v_encoding = ((PyObject *)__pyx_n_s_utf8);\n  std::string __pyx_r;\n  __Pyx_RefNannyDeclarations\n  int __pyx_t_1;\n  int __pyx_t_2;\n  std::string __pyx_t_3;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  PyObject *__pyx_t_6 = NULL;\n  PyObject *__pyx_t_7 = NULL;\n  PyObject *__pyx_t_8 = NULL;\n  PyObject *__pyx_t_9 = NULL;\n  __Pyx_RefNannySetupContext(\"tostring\", 0);\n  if (__pyx_optional_args) {\n    if (__pyx_optional_args->__pyx_n > 0) {\n      __pyx_v_encoding = __pyx_optional_args->encoding;\n    }\n  }\n\n  /* \"pywrapfst.pyx\":180\n *   \"\"\"\n *   # A Python bytestring can be implicitly cast to a C++ string.\n *   if isinstance(data, bytes):             # <<<<<<<<<<<<<<\n *     return data\n *   elif isinstance(data, unicode):\n */\n  __pyx_t_1 = PyBytes_Check(__pyx_v_data); \n  __pyx_t_2 = (__pyx_t_1 != 0);\n  if (__pyx_t_2) {\n\n    /* \"pywrapfst.pyx\":181\n *   # A Python bytestring can be implicitly cast to a C++ string.\n *   if isinstance(data, bytes):\n *     return data             # <<<<<<<<<<<<<<\n *   elif isinstance(data, unicode):\n *     return data.encode(encoding)\n */\n    __pyx_t_3 = __pyx_convert_string_from_py_std__in_string(__pyx_v_data); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 181, __pyx_L1_error)\n    __pyx_r = __pyx_t_3;\n    goto __pyx_L0;\n\n    /* \"pywrapfst.pyx\":180\n *   \"\"\"\n *   # A Python bytestring can be implicitly cast to a C++ string.\n *   if isinstance(data, bytes):             # <<<<<<<<<<<<<<\n *     return data\n *   elif isinstance(data, unicode):\n */\n  }\n\n  /* \"pywrapfst.pyx\":182\n *   if isinstance(data, bytes):\n *     return data\n *   elif isinstance(data, unicode):             # <<<<<<<<<<<<<<\n *     return data.encode(encoding)\n *   raise FstArgError(\"Cannot encode as string: {!r}\".format(data))\n */\n  __pyx_t_2 = PyUnicode_Check(__pyx_v_data); \n  __pyx_t_1 = (__pyx_t_2 != 0);\n  if (__pyx_t_1) {\n\n    /* \"pywrapfst.pyx\":183\n *     return data\n *   elif isinstance(data, unicode):\n *     return data.encode(encoding)             # <<<<<<<<<<<<<<\n *   raise FstArgError(\"Cannot encode as string: {!r}\".format(data))\n * \n */\n    __pyx_t_5 = __Pyx_PyObject_GetAttrStr(__pyx_v_data, __pyx_n_s_encode); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 183, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_5);\n    __pyx_t_6 = NULL;\n    if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_5))) {\n      __pyx_t_6 = PyMethod_GET_SELF(__pyx_t_5);\n      if (likely(__pyx_t_6)) {\n        PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_5);\n        __Pyx_INCREF(__pyx_t_6);\n        __Pyx_INCREF(function);\n        __Pyx_DECREF_SET(__pyx_t_5, function);\n      }\n    }\n    if (!__pyx_t_6) {\n      __pyx_t_4 = __Pyx_PyObject_CallOneArg(__pyx_t_5, __pyx_v_encoding); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 183, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_4);\n    } else {\n      #if CYTHON_FAST_PYCALL\n      if (PyFunction_Check(__pyx_t_5)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_6, __pyx_v_encoding};\n        __pyx_t_4 = __Pyx_PyFunction_FastCall(__pyx_t_5, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 183, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_6); __pyx_t_6 = 0;\n        __Pyx_GOTREF(__pyx_t_4);\n      } else\n      #endif\n      #if CYTHON_FAST_PYCCALL\n      if (__Pyx_PyFastCFunction_Check(__pyx_t_5)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_6, __pyx_v_encoding};\n        __pyx_t_4 = __Pyx_PyCFunction_FastCall(__pyx_t_5, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 183, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_6); __pyx_t_6 = 0;\n        __Pyx_GOTREF(__pyx_t_4);\n      } else\n      #endif\n      {\n        __pyx_t_7 = PyTuple_New(1+1); if (unlikely(!__pyx_t_7)) __PYX_ERR(0, 183, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_7);\n        __Pyx_GIVEREF(__pyx_t_6); PyTuple_SET_ITEM(__pyx_t_7, 0, __pyx_t_6); __pyx_t_6 = NULL;\n        __Pyx_INCREF(__pyx_v_encoding);\n        __Pyx_GIVEREF(__pyx_v_encoding);\n        PyTuple_SET_ITEM(__pyx_t_7, 0+1, __pyx_v_encoding);\n        __pyx_t_4 = __Pyx_PyObject_Call(__pyx_t_5, __pyx_t_7, NULL); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 183, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_4);\n        __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0;\n      }\n    }\n    __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n    __pyx_t_3 = __pyx_convert_string_from_py_std__in_string(__pyx_t_4); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 183, __pyx_L1_error)\n    __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n    __pyx_r = __pyx_t_3;\n    goto __pyx_L0;\n\n    /* \"pywrapfst.pyx\":182\n *   if isinstance(data, bytes):\n *     return data\n *   elif isinstance(data, unicode):             # <<<<<<<<<<<<<<\n *     return data.encode(encoding)\n *   raise FstArgError(\"Cannot encode as string: {!r}\".format(data))\n */\n  }\n\n  /* \"pywrapfst.pyx\":184\n *   elif isinstance(data, unicode):\n *     return data.encode(encoding)\n *   raise FstArgError(\"Cannot encode as string: {!r}\".format(data))             # <<<<<<<<<<<<<<\n * \n * \n */\n  __pyx_t_5 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstArgError); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 184, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_5);\n  __pyx_t_6 = __Pyx_PyObject_GetAttrStr(__pyx_kp_s_Cannot_encode_as_string_r, __pyx_n_s_format); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 184, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_6);\n  __pyx_t_8 = NULL;\n  if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_6))) {\n    __pyx_t_8 = PyMethod_GET_SELF(__pyx_t_6);\n    if (likely(__pyx_t_8)) {\n      PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_6);\n      __Pyx_INCREF(__pyx_t_8);\n      __Pyx_INCREF(function);\n      __Pyx_DECREF_SET(__pyx_t_6, function);\n    }\n  }\n  if (!__pyx_t_8) {\n    __pyx_t_7 = __Pyx_PyObject_CallOneArg(__pyx_t_6, __pyx_v_data); if (unlikely(!__pyx_t_7)) __PYX_ERR(0, 184, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_7);\n  } else {\n    #if CYTHON_FAST_PYCALL\n    if (PyFunction_Check(__pyx_t_6)) {\n      PyObject *__pyx_temp[2] = {__pyx_t_8, __pyx_v_data};\n      __pyx_t_7 = __Pyx_PyFunction_FastCall(__pyx_t_6, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_7)) __PYX_ERR(0, 184, __pyx_L1_error)\n      __Pyx_XDECREF(__pyx_t_8); __pyx_t_8 = 0;\n      __Pyx_GOTREF(__pyx_t_7);\n    } else\n    #endif\n    #if CYTHON_FAST_PYCCALL\n    if (__Pyx_PyFastCFunction_Check(__pyx_t_6)) {\n      PyObject *__pyx_temp[2] = {__pyx_t_8, __pyx_v_data};\n      __pyx_t_7 = __Pyx_PyCFunction_FastCall(__pyx_t_6, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_7)) __PYX_ERR(0, 184, __pyx_L1_error)\n      __Pyx_XDECREF(__pyx_t_8); __pyx_t_8 = 0;\n      __Pyx_GOTREF(__pyx_t_7);\n    } else\n    #endif\n    {\n      __pyx_t_9 = PyTuple_New(1+1); if (unlikely(!__pyx_t_9)) __PYX_ERR(0, 184, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_9);\n      __Pyx_GIVEREF(__pyx_t_8); PyTuple_SET_ITEM(__pyx_t_9, 0, __pyx_t_8); __pyx_t_8 = NULL;\n      __Pyx_INCREF(__pyx_v_data);\n      __Pyx_GIVEREF(__pyx_v_data);\n      PyTuple_SET_ITEM(__pyx_t_9, 0+1, __pyx_v_data);\n      __pyx_t_7 = __Pyx_PyObject_Call(__pyx_t_6, __pyx_t_9, NULL); if (unlikely(!__pyx_t_7)) __PYX_ERR(0, 184, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_7);\n      __Pyx_DECREF(__pyx_t_9); __pyx_t_9 = 0;\n    }\n  }\n  __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n  __pyx_t_6 = NULL;\n  if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_5))) {\n    __pyx_t_6 = PyMethod_GET_SELF(__pyx_t_5);\n    if (likely(__pyx_t_6)) {\n      PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_5);\n      __Pyx_INCREF(__pyx_t_6);\n      __Pyx_INCREF(function);\n      __Pyx_DECREF_SET(__pyx_t_5, function);\n    }\n  }\n  if (!__pyx_t_6) {\n    __pyx_t_4 = __Pyx_PyObject_CallOneArg(__pyx_t_5, __pyx_t_7); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 184, __pyx_L1_error)\n    __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0;\n    __Pyx_GOTREF(__pyx_t_4);\n  } else {\n    #if CYTHON_FAST_PYCALL\n    if (PyFunction_Check(__pyx_t_5)) {\n      PyObject *__pyx_temp[2] = {__pyx_t_6, __pyx_t_7};\n      __pyx_t_4 = __Pyx_PyFunction_FastCall(__pyx_t_5, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 184, __pyx_L1_error)\n      __Pyx_XDECREF(__pyx_t_6); __pyx_t_6 = 0;\n      __Pyx_GOTREF(__pyx_t_4);\n      __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0;\n    } else\n    #endif\n    #if CYTHON_FAST_PYCCALL\n    if (__Pyx_PyFastCFunction_Check(__pyx_t_5)) {\n      PyObject *__pyx_temp[2] = {__pyx_t_6, __pyx_t_7};\n      __pyx_t_4 = __Pyx_PyCFunction_FastCall(__pyx_t_5, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 184, __pyx_L1_error)\n      __Pyx_XDECREF(__pyx_t_6); __pyx_t_6 = 0;\n      __Pyx_GOTREF(__pyx_t_4);\n      __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0;\n    } else\n    #endif\n    {\n      __pyx_t_9 = PyTuple_New(1+1); if (unlikely(!__pyx_t_9)) __PYX_ERR(0, 184, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_9);\n      __Pyx_GIVEREF(__pyx_t_6); PyTuple_SET_ITEM(__pyx_t_9, 0, __pyx_t_6); __pyx_t_6 = NULL;\n      __Pyx_GIVEREF(__pyx_t_7);\n      PyTuple_SET_ITEM(__pyx_t_9, 0+1, __pyx_t_7);\n      __pyx_t_7 = 0;\n      __pyx_t_4 = __Pyx_PyObject_Call(__pyx_t_5, __pyx_t_9, NULL); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 184, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_4);\n      __Pyx_DECREF(__pyx_t_9); __pyx_t_9 = 0;\n    }\n  }\n  __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n  __Pyx_Raise(__pyx_t_4, 0, 0, 0);\n  __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n  __PYX_ERR(0, 184, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":159\n * \n * \n * cdef string tostring(data, encoding=\"utf8\") except *:             # <<<<<<<<<<<<<<\n *   \"\"\"Converts strings to bytestrings.\n * \n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_XDECREF(__pyx_t_6);\n  __Pyx_XDECREF(__pyx_t_7);\n  __Pyx_XDECREF(__pyx_t_8);\n  __Pyx_XDECREF(__pyx_t_9);\n  __Pyx_AddTraceback(\"pywrapfst.tostring\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_pretend_to_initialize(&__pyx_r);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":187\n * \n * \n * cdef string weight_tostring(data, encoding=\"utf8\") except *:             # <<<<<<<<<<<<<<\n *   \"\"\"Converts strings or numerics to bytestrings.\n * \n */\n\nstatic std::string __pyx_f_9pywrapfst_weight_tostring(PyObject *__pyx_v_data, struct __pyx_opt_args_9pywrapfst_weight_tostring *__pyx_optional_args) {\n  PyObject *__pyx_v_encoding = ((PyObject *)__pyx_n_s_utf8);\n  std::string __pyx_r;\n  __Pyx_RefNannyDeclarations\n  int __pyx_t_1;\n  int __pyx_t_2;\n  std::string __pyx_t_3;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  PyObject *__pyx_t_6 = NULL;\n  PyObject *__pyx_t_7 = NULL;\n  PyObject *__pyx_t_8 = NULL;\n  PyObject *__pyx_t_9 = NULL;\n  __Pyx_RefNannySetupContext(\"weight_tostring\", 0);\n  if (__pyx_optional_args) {\n    if (__pyx_optional_args->__pyx_n > 0) {\n      __pyx_v_encoding = __pyx_optional_args->encoding;\n    }\n  }\n\n  /* \"pywrapfst.pyx\":211\n *   \"\"\"\n *   # A Python bytestring can be implicitly cast to a C++ string.\n *   if isinstance(data, bytes):             # <<<<<<<<<<<<<<\n *     return data\n *   elif isinstance(data, unicode):\n */\n  __pyx_t_1 = PyBytes_Check(__pyx_v_data); \n  __pyx_t_2 = (__pyx_t_1 != 0);\n  if (__pyx_t_2) {\n\n    /* \"pywrapfst.pyx\":212\n *   # A Python bytestring can be implicitly cast to a C++ string.\n *   if isinstance(data, bytes):\n *     return data             # <<<<<<<<<<<<<<\n *   elif isinstance(data, unicode):\n *     return data.encode(encoding)\n */\n    __pyx_t_3 = __pyx_convert_string_from_py_std__in_string(__pyx_v_data); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 212, __pyx_L1_error)\n    __pyx_r = __pyx_t_3;\n    goto __pyx_L0;\n\n    /* \"pywrapfst.pyx\":211\n *   \"\"\"\n *   # A Python bytestring can be implicitly cast to a C++ string.\n *   if isinstance(data, bytes):             # <<<<<<<<<<<<<<\n *     return data\n *   elif isinstance(data, unicode):\n */\n  }\n\n  /* \"pywrapfst.pyx\":213\n *   if isinstance(data, bytes):\n *     return data\n *   elif isinstance(data, unicode):             # <<<<<<<<<<<<<<\n *     return data.encode(encoding)\n *   elif isinstance(data, numbers.Number):\n */\n  __pyx_t_2 = PyUnicode_Check(__pyx_v_data); \n  __pyx_t_1 = (__pyx_t_2 != 0);\n  if (__pyx_t_1) {\n\n    /* \"pywrapfst.pyx\":214\n *     return data\n *   elif isinstance(data, unicode):\n *     return data.encode(encoding)             # <<<<<<<<<<<<<<\n *   elif isinstance(data, numbers.Number):\n *     return str(data).encode(encoding)\n */\n    __pyx_t_5 = __Pyx_PyObject_GetAttrStr(__pyx_v_data, __pyx_n_s_encode); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 214, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_5);\n    __pyx_t_6 = NULL;\n    if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_5))) {\n      __pyx_t_6 = PyMethod_GET_SELF(__pyx_t_5);\n      if (likely(__pyx_t_6)) {\n        PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_5);\n        __Pyx_INCREF(__pyx_t_6);\n        __Pyx_INCREF(function);\n        __Pyx_DECREF_SET(__pyx_t_5, function);\n      }\n    }\n    if (!__pyx_t_6) {\n      __pyx_t_4 = __Pyx_PyObject_CallOneArg(__pyx_t_5, __pyx_v_encoding); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 214, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_4);\n    } else {\n      #if CYTHON_FAST_PYCALL\n      if (PyFunction_Check(__pyx_t_5)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_6, __pyx_v_encoding};\n        __pyx_t_4 = __Pyx_PyFunction_FastCall(__pyx_t_5, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 214, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_6); __pyx_t_6 = 0;\n        __Pyx_GOTREF(__pyx_t_4);\n      } else\n      #endif\n      #if CYTHON_FAST_PYCCALL\n      if (__Pyx_PyFastCFunction_Check(__pyx_t_5)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_6, __pyx_v_encoding};\n        __pyx_t_4 = __Pyx_PyCFunction_FastCall(__pyx_t_5, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 214, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_6); __pyx_t_6 = 0;\n        __Pyx_GOTREF(__pyx_t_4);\n      } else\n      #endif\n      {\n        __pyx_t_7 = PyTuple_New(1+1); if (unlikely(!__pyx_t_7)) __PYX_ERR(0, 214, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_7);\n        __Pyx_GIVEREF(__pyx_t_6); PyTuple_SET_ITEM(__pyx_t_7, 0, __pyx_t_6); __pyx_t_6 = NULL;\n        __Pyx_INCREF(__pyx_v_encoding);\n        __Pyx_GIVEREF(__pyx_v_encoding);\n        PyTuple_SET_ITEM(__pyx_t_7, 0+1, __pyx_v_encoding);\n        __pyx_t_4 = __Pyx_PyObject_Call(__pyx_t_5, __pyx_t_7, NULL); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 214, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_4);\n        __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0;\n      }\n    }\n    __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n    __pyx_t_3 = __pyx_convert_string_from_py_std__in_string(__pyx_t_4); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 214, __pyx_L1_error)\n    __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n    __pyx_r = __pyx_t_3;\n    goto __pyx_L0;\n\n    /* \"pywrapfst.pyx\":213\n *   if isinstance(data, bytes):\n *     return data\n *   elif isinstance(data, unicode):             # <<<<<<<<<<<<<<\n *     return data.encode(encoding)\n *   elif isinstance(data, numbers.Number):\n */\n  }\n\n  /* \"pywrapfst.pyx\":215\n *   elif isinstance(data, unicode):\n *     return data.encode(encoding)\n *   elif isinstance(data, numbers.Number):             # <<<<<<<<<<<<<<\n *     return str(data).encode(encoding)\n *   raise FstArgError(\"Cannot encode as string: {!r}\".format(data))\n */\n  __pyx_t_4 = __Pyx_GetModuleGlobalName(__pyx_n_s_numbers); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 215, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_4);\n  __pyx_t_5 = __Pyx_PyObject_GetAttrStr(__pyx_t_4, __pyx_n_s_Number); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 215, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_5);\n  __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n  __pyx_t_1 = PyObject_IsInstance(__pyx_v_data, __pyx_t_5); if (unlikely(__pyx_t_1 == ((int)-1))) __PYX_ERR(0, 215, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n  __pyx_t_2 = (__pyx_t_1 != 0);\n  if (__pyx_t_2) {\n\n    /* \"pywrapfst.pyx\":216\n *     return data.encode(encoding)\n *   elif isinstance(data, numbers.Number):\n *     return str(data).encode(encoding)             # <<<<<<<<<<<<<<\n *   raise FstArgError(\"Cannot encode as string: {!r}\".format(data))\n * \n */\n    __pyx_t_4 = PyTuple_New(1); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 216, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_4);\n    __Pyx_INCREF(__pyx_v_data);\n    __Pyx_GIVEREF(__pyx_v_data);\n    PyTuple_SET_ITEM(__pyx_t_4, 0, __pyx_v_data);\n    __pyx_t_7 = __Pyx_PyObject_Call(((PyObject *)(&PyString_Type)), __pyx_t_4, NULL); if (unlikely(!__pyx_t_7)) __PYX_ERR(0, 216, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_7);\n    __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n    __pyx_t_4 = __Pyx_PyObject_GetAttrStr(__pyx_t_7, __pyx_n_s_encode); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 216, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_4);\n    __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0;\n    __pyx_t_7 = NULL;\n    if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_4))) {\n      __pyx_t_7 = PyMethod_GET_SELF(__pyx_t_4);\n      if (likely(__pyx_t_7)) {\n        PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_4);\n        __Pyx_INCREF(__pyx_t_7);\n        __Pyx_INCREF(function);\n        __Pyx_DECREF_SET(__pyx_t_4, function);\n      }\n    }\n    if (!__pyx_t_7) {\n      __pyx_t_5 = __Pyx_PyObject_CallOneArg(__pyx_t_4, __pyx_v_encoding); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 216, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_5);\n    } else {\n      #if CYTHON_FAST_PYCALL\n      if (PyFunction_Check(__pyx_t_4)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_7, __pyx_v_encoding};\n        __pyx_t_5 = __Pyx_PyFunction_FastCall(__pyx_t_4, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 216, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_7); __pyx_t_7 = 0;\n        __Pyx_GOTREF(__pyx_t_5);\n      } else\n      #endif\n      #if CYTHON_FAST_PYCCALL\n      if (__Pyx_PyFastCFunction_Check(__pyx_t_4)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_7, __pyx_v_encoding};\n        __pyx_t_5 = __Pyx_PyCFunction_FastCall(__pyx_t_4, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 216, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_7); __pyx_t_7 = 0;\n        __Pyx_GOTREF(__pyx_t_5);\n      } else\n      #endif\n      {\n        __pyx_t_6 = PyTuple_New(1+1); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 216, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_6);\n        __Pyx_GIVEREF(__pyx_t_7); PyTuple_SET_ITEM(__pyx_t_6, 0, __pyx_t_7); __pyx_t_7 = NULL;\n        __Pyx_INCREF(__pyx_v_encoding);\n        __Pyx_GIVEREF(__pyx_v_encoding);\n        PyTuple_SET_ITEM(__pyx_t_6, 0+1, __pyx_v_encoding);\n        __pyx_t_5 = __Pyx_PyObject_Call(__pyx_t_4, __pyx_t_6, NULL); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 216, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_5);\n        __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n      }\n    }\n    __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n    __pyx_t_3 = __pyx_convert_string_from_py_std__in_string(__pyx_t_5); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 216, __pyx_L1_error)\n    __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n    __pyx_r = __pyx_t_3;\n    goto __pyx_L0;\n\n    /* \"pywrapfst.pyx\":215\n *   elif isinstance(data, unicode):\n *     return data.encode(encoding)\n *   elif isinstance(data, numbers.Number):             # <<<<<<<<<<<<<<\n *     return str(data).encode(encoding)\n *   raise FstArgError(\"Cannot encode as string: {!r}\".format(data))\n */\n  }\n\n  /* \"pywrapfst.pyx\":217\n *   elif isinstance(data, numbers.Number):\n *     return str(data).encode(encoding)\n *   raise FstArgError(\"Cannot encode as string: {!r}\".format(data))             # <<<<<<<<<<<<<<\n * \n * \n */\n  __pyx_t_4 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstArgError); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 217, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_4);\n  __pyx_t_7 = __Pyx_PyObject_GetAttrStr(__pyx_kp_s_Cannot_encode_as_string_r, __pyx_n_s_format); if (unlikely(!__pyx_t_7)) __PYX_ERR(0, 217, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_7);\n  __pyx_t_8 = NULL;\n  if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_7))) {\n    __pyx_t_8 = PyMethod_GET_SELF(__pyx_t_7);\n    if (likely(__pyx_t_8)) {\n      PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_7);\n      __Pyx_INCREF(__pyx_t_8);\n      __Pyx_INCREF(function);\n      __Pyx_DECREF_SET(__pyx_t_7, function);\n    }\n  }\n  if (!__pyx_t_8) {\n    __pyx_t_6 = __Pyx_PyObject_CallOneArg(__pyx_t_7, __pyx_v_data); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 217, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_6);\n  } else {\n    #if CYTHON_FAST_PYCALL\n    if (PyFunction_Check(__pyx_t_7)) {\n      PyObject *__pyx_temp[2] = {__pyx_t_8, __pyx_v_data};\n      __pyx_t_6 = __Pyx_PyFunction_FastCall(__pyx_t_7, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 217, __pyx_L1_error)\n      __Pyx_XDECREF(__pyx_t_8); __pyx_t_8 = 0;\n      __Pyx_GOTREF(__pyx_t_6);\n    } else\n    #endif\n    #if CYTHON_FAST_PYCCALL\n    if (__Pyx_PyFastCFunction_Check(__pyx_t_7)) {\n      PyObject *__pyx_temp[2] = {__pyx_t_8, __pyx_v_data};\n      __pyx_t_6 = __Pyx_PyCFunction_FastCall(__pyx_t_7, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 217, __pyx_L1_error)\n      __Pyx_XDECREF(__pyx_t_8); __pyx_t_8 = 0;\n      __Pyx_GOTREF(__pyx_t_6);\n    } else\n    #endif\n    {\n      __pyx_t_9 = PyTuple_New(1+1); if (unlikely(!__pyx_t_9)) __PYX_ERR(0, 217, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_9);\n      __Pyx_GIVEREF(__pyx_t_8); PyTuple_SET_ITEM(__pyx_t_9, 0, __pyx_t_8); __pyx_t_8 = NULL;\n      __Pyx_INCREF(__pyx_v_data);\n      __Pyx_GIVEREF(__pyx_v_data);\n      PyTuple_SET_ITEM(__pyx_t_9, 0+1, __pyx_v_data);\n      __pyx_t_6 = __Pyx_PyObject_Call(__pyx_t_7, __pyx_t_9, NULL); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 217, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_6);\n      __Pyx_DECREF(__pyx_t_9); __pyx_t_9 = 0;\n    }\n  }\n  __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0;\n  __pyx_t_7 = NULL;\n  if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_4))) {\n    __pyx_t_7 = PyMethod_GET_SELF(__pyx_t_4);\n    if (likely(__pyx_t_7)) {\n      PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_4);\n      __Pyx_INCREF(__pyx_t_7);\n      __Pyx_INCREF(function);\n      __Pyx_DECREF_SET(__pyx_t_4, function);\n    }\n  }\n  if (!__pyx_t_7) {\n    __pyx_t_5 = __Pyx_PyObject_CallOneArg(__pyx_t_4, __pyx_t_6); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 217, __pyx_L1_error)\n    __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n    __Pyx_GOTREF(__pyx_t_5);\n  } else {\n    #if CYTHON_FAST_PYCALL\n    if (PyFunction_Check(__pyx_t_4)) {\n      PyObject *__pyx_temp[2] = {__pyx_t_7, __pyx_t_6};\n      __pyx_t_5 = __Pyx_PyFunction_FastCall(__pyx_t_4, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 217, __pyx_L1_error)\n      __Pyx_XDECREF(__pyx_t_7); __pyx_t_7 = 0;\n      __Pyx_GOTREF(__pyx_t_5);\n      __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n    } else\n    #endif\n    #if CYTHON_FAST_PYCCALL\n    if (__Pyx_PyFastCFunction_Check(__pyx_t_4)) {\n      PyObject *__pyx_temp[2] = {__pyx_t_7, __pyx_t_6};\n      __pyx_t_5 = __Pyx_PyCFunction_FastCall(__pyx_t_4, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 217, __pyx_L1_error)\n      __Pyx_XDECREF(__pyx_t_7); __pyx_t_7 = 0;\n      __Pyx_GOTREF(__pyx_t_5);\n      __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n    } else\n    #endif\n    {\n      __pyx_t_9 = PyTuple_New(1+1); if (unlikely(!__pyx_t_9)) __PYX_ERR(0, 217, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_9);\n      __Pyx_GIVEREF(__pyx_t_7); PyTuple_SET_ITEM(__pyx_t_9, 0, __pyx_t_7); __pyx_t_7 = NULL;\n      __Pyx_GIVEREF(__pyx_t_6);\n      PyTuple_SET_ITEM(__pyx_t_9, 0+1, __pyx_t_6);\n      __pyx_t_6 = 0;\n      __pyx_t_5 = __Pyx_PyObject_Call(__pyx_t_4, __pyx_t_9, NULL); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 217, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_5);\n      __Pyx_DECREF(__pyx_t_9); __pyx_t_9 = 0;\n    }\n  }\n  __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n  __Pyx_Raise(__pyx_t_5, 0, 0, 0);\n  __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n  __PYX_ERR(0, 217, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":187\n * \n * \n * cdef string weight_tostring(data, encoding=\"utf8\") except *:             # <<<<<<<<<<<<<<\n *   \"\"\"Converts strings or numerics to bytestrings.\n * \n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_XDECREF(__pyx_t_6);\n  __Pyx_XDECREF(__pyx_t_7);\n  __Pyx_XDECREF(__pyx_t_8);\n  __Pyx_XDECREF(__pyx_t_9);\n  __Pyx_AddTraceback(\"pywrapfst.weight_tostring\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_pretend_to_initialize(&__pyx_r);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":220\n * \n * \n * cdef fst.ComposeFilter _get_compose_filter(             # <<<<<<<<<<<<<<\n *     const string &compose_filter) except *:\n *   \"\"\"Matches string with the appropriate ComposeFilter enum value.\n */\n\nstatic enum fst::ComposeFilter __pyx_f_9pywrapfst__get_compose_filter(std::string const &__pyx_v_compose_filter) {\n  enum fst::ComposeFilter __pyx_v_compose_filter_enum;\n  enum fst::ComposeFilter __pyx_r;\n  __Pyx_RefNannyDeclarations\n  int __pyx_t_1;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  PyObject *__pyx_t_6 = NULL;\n  PyObject *__pyx_t_7 = NULL;\n  PyObject *__pyx_t_8 = NULL;\n  __Pyx_RefNannySetupContext(\"_get_compose_filter\", 0);\n\n  /* \"pywrapfst.pyx\":241\n *   \"\"\"\n *   cdef fst.ComposeFilter compose_filter_enum\n *   if not fst.GetComposeFilter(compose_filter, addr(compose_filter_enum)):             # <<<<<<<<<<<<<<\n *     raise FstArgError(\"Unknown compose filter type: {!r}\".format(\n *         compose_filter))\n */\n  __pyx_t_1 = ((!(fst::script::GetComposeFilter(__pyx_v_compose_filter, (&__pyx_v_compose_filter_enum)) != 0)) != 0);\n  if (__pyx_t_1) {\n\n    /* \"pywrapfst.pyx\":242\n *   cdef fst.ComposeFilter compose_filter_enum\n *   if not fst.GetComposeFilter(compose_filter, addr(compose_filter_enum)):\n *     raise FstArgError(\"Unknown compose filter type: {!r}\".format(             # <<<<<<<<<<<<<<\n *         compose_filter))\n *   return compose_filter_enum\n */\n    __pyx_t_3 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstArgError); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 242, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_3);\n    __pyx_t_5 = __Pyx_PyObject_GetAttrStr(__pyx_kp_s_Unknown_compose_filter_type_r, __pyx_n_s_format); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 242, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_5);\n\n    /* \"pywrapfst.pyx\":243\n *   if not fst.GetComposeFilter(compose_filter, addr(compose_filter_enum)):\n *     raise FstArgError(\"Unknown compose filter type: {!r}\".format(\n *         compose_filter))             # <<<<<<<<<<<<<<\n *   return compose_filter_enum\n * \n */\n    __pyx_t_6 = __pyx_convert_PyBytes_string_to_py_std__in_string(__pyx_v_compose_filter); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 243, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_6);\n    __pyx_t_7 = NULL;\n    if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_5))) {\n      __pyx_t_7 = PyMethod_GET_SELF(__pyx_t_5);\n      if (likely(__pyx_t_7)) {\n        PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_5);\n        __Pyx_INCREF(__pyx_t_7);\n        __Pyx_INCREF(function);\n        __Pyx_DECREF_SET(__pyx_t_5, function);\n      }\n    }\n    if (!__pyx_t_7) {\n      __pyx_t_4 = __Pyx_PyObject_CallOneArg(__pyx_t_5, __pyx_t_6); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 242, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n      __Pyx_GOTREF(__pyx_t_4);\n    } else {\n      #if CYTHON_FAST_PYCALL\n      if (PyFunction_Check(__pyx_t_5)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_7, __pyx_t_6};\n        __pyx_t_4 = __Pyx_PyFunction_FastCall(__pyx_t_5, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 242, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_7); __pyx_t_7 = 0;\n        __Pyx_GOTREF(__pyx_t_4);\n        __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n      } else\n      #endif\n      #if CYTHON_FAST_PYCCALL\n      if (__Pyx_PyFastCFunction_Check(__pyx_t_5)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_7, __pyx_t_6};\n        __pyx_t_4 = __Pyx_PyCFunction_FastCall(__pyx_t_5, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 242, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_7); __pyx_t_7 = 0;\n        __Pyx_GOTREF(__pyx_t_4);\n        __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n      } else\n      #endif\n      {\n        __pyx_t_8 = PyTuple_New(1+1); if (unlikely(!__pyx_t_8)) __PYX_ERR(0, 242, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_8);\n        __Pyx_GIVEREF(__pyx_t_7); PyTuple_SET_ITEM(__pyx_t_8, 0, __pyx_t_7); __pyx_t_7 = NULL;\n        __Pyx_GIVEREF(__pyx_t_6);\n        PyTuple_SET_ITEM(__pyx_t_8, 0+1, __pyx_t_6);\n        __pyx_t_6 = 0;\n        __pyx_t_4 = __Pyx_PyObject_Call(__pyx_t_5, __pyx_t_8, NULL); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 242, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_4);\n        __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0;\n      }\n    }\n    __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n    __pyx_t_5 = NULL;\n    if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n      __pyx_t_5 = PyMethod_GET_SELF(__pyx_t_3);\n      if (likely(__pyx_t_5)) {\n        PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n        __Pyx_INCREF(__pyx_t_5);\n        __Pyx_INCREF(function);\n        __Pyx_DECREF_SET(__pyx_t_3, function);\n      }\n    }\n    if (!__pyx_t_5) {\n      __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 242, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      __Pyx_GOTREF(__pyx_t_2);\n    } else {\n      #if CYTHON_FAST_PYCALL\n      if (PyFunction_Check(__pyx_t_3)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_5, __pyx_t_4};\n        __pyx_t_2 = __Pyx_PyFunction_FastCall(__pyx_t_3, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 242, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;\n        __Pyx_GOTREF(__pyx_t_2);\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else\n      #endif\n      #if CYTHON_FAST_PYCCALL\n      if (__Pyx_PyFastCFunction_Check(__pyx_t_3)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_5, __pyx_t_4};\n        __pyx_t_2 = __Pyx_PyCFunction_FastCall(__pyx_t_3, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 242, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;\n        __Pyx_GOTREF(__pyx_t_2);\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else\n      #endif\n      {\n        __pyx_t_8 = PyTuple_New(1+1); if (unlikely(!__pyx_t_8)) __PYX_ERR(0, 242, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_8);\n        __Pyx_GIVEREF(__pyx_t_5); PyTuple_SET_ITEM(__pyx_t_8, 0, __pyx_t_5); __pyx_t_5 = NULL;\n        __Pyx_GIVEREF(__pyx_t_4);\n        PyTuple_SET_ITEM(__pyx_t_8, 0+1, __pyx_t_4);\n        __pyx_t_4 = 0;\n        __pyx_t_2 = __Pyx_PyObject_Call(__pyx_t_3, __pyx_t_8, NULL); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 242, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_2);\n        __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0;\n      }\n    }\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    __Pyx_Raise(__pyx_t_2, 0, 0, 0);\n    __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n    __PYX_ERR(0, 242, __pyx_L1_error)\n\n    /* \"pywrapfst.pyx\":241\n *   \"\"\"\n *   cdef fst.ComposeFilter compose_filter_enum\n *   if not fst.GetComposeFilter(compose_filter, addr(compose_filter_enum)):             # <<<<<<<<<<<<<<\n *     raise FstArgError(\"Unknown compose filter type: {!r}\".format(\n *         compose_filter))\n */\n  }\n\n  /* \"pywrapfst.pyx\":244\n *     raise FstArgError(\"Unknown compose filter type: {!r}\".format(\n *         compose_filter))\n *   return compose_filter_enum             # <<<<<<<<<<<<<<\n * \n * \n */\n  __pyx_r = __pyx_v_compose_filter_enum;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":220\n * \n * \n * cdef fst.ComposeFilter _get_compose_filter(             # <<<<<<<<<<<<<<\n *     const string &compose_filter) except *:\n *   \"\"\"Matches string with the appropriate ComposeFilter enum value.\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_XDECREF(__pyx_t_6);\n  __Pyx_XDECREF(__pyx_t_7);\n  __Pyx_XDECREF(__pyx_t_8);\n  __Pyx_AddTraceback(\"pywrapfst._get_compose_filter\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = (enum fst::ComposeFilter) 0;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":247\n * \n * \n * cdef fst.DeterminizeType _get_determinize_type(const string &det_type) except *:             # <<<<<<<<<<<<<<\n *   \"\"\"Matches string with the appropriate DeterminizeType enum value.\n * \n */\n\nstatic enum fst::DeterminizeType __pyx_f_9pywrapfst__get_determinize_type(std::string const &__pyx_v_det_type) {\n  enum fst::DeterminizeType __pyx_v_det_type_enum;\n  enum fst::DeterminizeType __pyx_r;\n  __Pyx_RefNannyDeclarations\n  int __pyx_t_1;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  PyObject *__pyx_t_6 = NULL;\n  PyObject *__pyx_t_7 = NULL;\n  PyObject *__pyx_t_8 = NULL;\n  __Pyx_RefNannySetupContext(\"_get_determinize_type\", 0);\n\n  /* \"pywrapfst.pyx\":263\n *   \"\"\"\n *   cdef fst.DeterminizeType det_type_enum\n *   if not fst.GetDeterminizeType(det_type, addr(det_type_enum)):             # <<<<<<<<<<<<<<\n *     raise FstArgError(\"Unknown determinization type: {!r}\".format(det_type))\n *   return det_type_enum\n */\n  __pyx_t_1 = ((!(fst::script::GetDeterminizeType(__pyx_v_det_type, (&__pyx_v_det_type_enum)) != 0)) != 0);\n  if (__pyx_t_1) {\n\n    /* \"pywrapfst.pyx\":264\n *   cdef fst.DeterminizeType det_type_enum\n *   if not fst.GetDeterminizeType(det_type, addr(det_type_enum)):\n *     raise FstArgError(\"Unknown determinization type: {!r}\".format(det_type))             # <<<<<<<<<<<<<<\n *   return det_type_enum\n * \n */\n    __pyx_t_3 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstArgError); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 264, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_3);\n    __pyx_t_5 = __Pyx_PyObject_GetAttrStr(__pyx_kp_s_Unknown_determinization_type_r, __pyx_n_s_format); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 264, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_5);\n    __pyx_t_6 = __pyx_convert_PyBytes_string_to_py_std__in_string(__pyx_v_det_type); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 264, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_6);\n    __pyx_t_7 = NULL;\n    if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_5))) {\n      __pyx_t_7 = PyMethod_GET_SELF(__pyx_t_5);\n      if (likely(__pyx_t_7)) {\n        PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_5);\n        __Pyx_INCREF(__pyx_t_7);\n        __Pyx_INCREF(function);\n        __Pyx_DECREF_SET(__pyx_t_5, function);\n      }\n    }\n    if (!__pyx_t_7) {\n      __pyx_t_4 = __Pyx_PyObject_CallOneArg(__pyx_t_5, __pyx_t_6); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 264, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n      __Pyx_GOTREF(__pyx_t_4);\n    } else {\n      #if CYTHON_FAST_PYCALL\n      if (PyFunction_Check(__pyx_t_5)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_7, __pyx_t_6};\n        __pyx_t_4 = __Pyx_PyFunction_FastCall(__pyx_t_5, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 264, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_7); __pyx_t_7 = 0;\n        __Pyx_GOTREF(__pyx_t_4);\n        __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n      } else\n      #endif\n      #if CYTHON_FAST_PYCCALL\n      if (__Pyx_PyFastCFunction_Check(__pyx_t_5)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_7, __pyx_t_6};\n        __pyx_t_4 = __Pyx_PyCFunction_FastCall(__pyx_t_5, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 264, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_7); __pyx_t_7 = 0;\n        __Pyx_GOTREF(__pyx_t_4);\n        __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n      } else\n      #endif\n      {\n        __pyx_t_8 = PyTuple_New(1+1); if (unlikely(!__pyx_t_8)) __PYX_ERR(0, 264, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_8);\n        __Pyx_GIVEREF(__pyx_t_7); PyTuple_SET_ITEM(__pyx_t_8, 0, __pyx_t_7); __pyx_t_7 = NULL;\n        __Pyx_GIVEREF(__pyx_t_6);\n        PyTuple_SET_ITEM(__pyx_t_8, 0+1, __pyx_t_6);\n        __pyx_t_6 = 0;\n        __pyx_t_4 = __Pyx_PyObject_Call(__pyx_t_5, __pyx_t_8, NULL); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 264, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_4);\n        __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0;\n      }\n    }\n    __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n    __pyx_t_5 = NULL;\n    if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n      __pyx_t_5 = PyMethod_GET_SELF(__pyx_t_3);\n      if (likely(__pyx_t_5)) {\n        PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n        __Pyx_INCREF(__pyx_t_5);\n        __Pyx_INCREF(function);\n        __Pyx_DECREF_SET(__pyx_t_3, function);\n      }\n    }\n    if (!__pyx_t_5) {\n      __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 264, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      __Pyx_GOTREF(__pyx_t_2);\n    } else {\n      #if CYTHON_FAST_PYCALL\n      if (PyFunction_Check(__pyx_t_3)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_5, __pyx_t_4};\n        __pyx_t_2 = __Pyx_PyFunction_FastCall(__pyx_t_3, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 264, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;\n        __Pyx_GOTREF(__pyx_t_2);\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else\n      #endif\n      #if CYTHON_FAST_PYCCALL\n      if (__Pyx_PyFastCFunction_Check(__pyx_t_3)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_5, __pyx_t_4};\n        __pyx_t_2 = __Pyx_PyCFunction_FastCall(__pyx_t_3, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 264, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;\n        __Pyx_GOTREF(__pyx_t_2);\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else\n      #endif\n      {\n        __pyx_t_8 = PyTuple_New(1+1); if (unlikely(!__pyx_t_8)) __PYX_ERR(0, 264, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_8);\n        __Pyx_GIVEREF(__pyx_t_5); PyTuple_SET_ITEM(__pyx_t_8, 0, __pyx_t_5); __pyx_t_5 = NULL;\n        __Pyx_GIVEREF(__pyx_t_4);\n        PyTuple_SET_ITEM(__pyx_t_8, 0+1, __pyx_t_4);\n        __pyx_t_4 = 0;\n        __pyx_t_2 = __Pyx_PyObject_Call(__pyx_t_3, __pyx_t_8, NULL); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 264, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_2);\n        __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0;\n      }\n    }\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    __Pyx_Raise(__pyx_t_2, 0, 0, 0);\n    __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n    __PYX_ERR(0, 264, __pyx_L1_error)\n\n    /* \"pywrapfst.pyx\":263\n *   \"\"\"\n *   cdef fst.DeterminizeType det_type_enum\n *   if not fst.GetDeterminizeType(det_type, addr(det_type_enum)):             # <<<<<<<<<<<<<<\n *     raise FstArgError(\"Unknown determinization type: {!r}\".format(det_type))\n *   return det_type_enum\n */\n  }\n\n  /* \"pywrapfst.pyx\":265\n *   if not fst.GetDeterminizeType(det_type, addr(det_type_enum)):\n *     raise FstArgError(\"Unknown determinization type: {!r}\".format(det_type))\n *   return det_type_enum             # <<<<<<<<<<<<<<\n * \n * \n */\n  __pyx_r = __pyx_v_det_type_enum;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":247\n * \n * \n * cdef fst.DeterminizeType _get_determinize_type(const string &det_type) except *:             # <<<<<<<<<<<<<<\n *   \"\"\"Matches string with the appropriate DeterminizeType enum value.\n * \n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_XDECREF(__pyx_t_6);\n  __Pyx_XDECREF(__pyx_t_7);\n  __Pyx_XDECREF(__pyx_t_8);\n  __Pyx_AddTraceback(\"pywrapfst._get_determinize_type\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = (enum fst::DeterminizeType) 0;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":268\n * \n * \n * cdef fst.QueueType _get_queue_type(const string &queue_type) except *:             # <<<<<<<<<<<<<<\n *   \"\"\"Matches string with the appropriate QueueType enum value.\n * \n */\n\nstatic enum fst::QueueType __pyx_f_9pywrapfst__get_queue_type(std::string const &__pyx_v_queue_type) {\n  enum fst::QueueType __pyx_v_queue_type_enum;\n  enum fst::QueueType __pyx_r;\n  __Pyx_RefNannyDeclarations\n  int __pyx_t_1;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  PyObject *__pyx_t_6 = NULL;\n  PyObject *__pyx_t_7 = NULL;\n  PyObject *__pyx_t_8 = NULL;\n  __Pyx_RefNannySetupContext(\"_get_queue_type\", 0);\n\n  /* \"pywrapfst.pyx\":287\n *   \"\"\"\n *   cdef fst.QueueType queue_type_enum\n *   if not fst.GetQueueType(queue_type, addr(queue_type_enum)):             # <<<<<<<<<<<<<<\n *     raise FstArgError(\"Unknown queue type: {!r}\".format(queue_type))\n *   return queue_type_enum\n */\n  __pyx_t_1 = ((!(fst::script::GetQueueType(__pyx_v_queue_type, (&__pyx_v_queue_type_enum)) != 0)) != 0);\n  if (__pyx_t_1) {\n\n    /* \"pywrapfst.pyx\":288\n *   cdef fst.QueueType queue_type_enum\n *   if not fst.GetQueueType(queue_type, addr(queue_type_enum)):\n *     raise FstArgError(\"Unknown queue type: {!r}\".format(queue_type))             # <<<<<<<<<<<<<<\n *   return queue_type_enum\n * \n */\n    __pyx_t_3 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstArgError); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 288, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_3);\n    __pyx_t_5 = __Pyx_PyObject_GetAttrStr(__pyx_kp_s_Unknown_queue_type_r, __pyx_n_s_format); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 288, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_5);\n    __pyx_t_6 = __pyx_convert_PyBytes_string_to_py_std__in_string(__pyx_v_queue_type); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 288, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_6);\n    __pyx_t_7 = NULL;\n    if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_5))) {\n      __pyx_t_7 = PyMethod_GET_SELF(__pyx_t_5);\n      if (likely(__pyx_t_7)) {\n        PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_5);\n        __Pyx_INCREF(__pyx_t_7);\n        __Pyx_INCREF(function);\n        __Pyx_DECREF_SET(__pyx_t_5, function);\n      }\n    }\n    if (!__pyx_t_7) {\n      __pyx_t_4 = __Pyx_PyObject_CallOneArg(__pyx_t_5, __pyx_t_6); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 288, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n      __Pyx_GOTREF(__pyx_t_4);\n    } else {\n      #if CYTHON_FAST_PYCALL\n      if (PyFunction_Check(__pyx_t_5)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_7, __pyx_t_6};\n        __pyx_t_4 = __Pyx_PyFunction_FastCall(__pyx_t_5, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 288, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_7); __pyx_t_7 = 0;\n        __Pyx_GOTREF(__pyx_t_4);\n        __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n      } else\n      #endif\n      #if CYTHON_FAST_PYCCALL\n      if (__Pyx_PyFastCFunction_Check(__pyx_t_5)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_7, __pyx_t_6};\n        __pyx_t_4 = __Pyx_PyCFunction_FastCall(__pyx_t_5, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 288, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_7); __pyx_t_7 = 0;\n        __Pyx_GOTREF(__pyx_t_4);\n        __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n      } else\n      #endif\n      {\n        __pyx_t_8 = PyTuple_New(1+1); if (unlikely(!__pyx_t_8)) __PYX_ERR(0, 288, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_8);\n        __Pyx_GIVEREF(__pyx_t_7); PyTuple_SET_ITEM(__pyx_t_8, 0, __pyx_t_7); __pyx_t_7 = NULL;\n        __Pyx_GIVEREF(__pyx_t_6);\n        PyTuple_SET_ITEM(__pyx_t_8, 0+1, __pyx_t_6);\n        __pyx_t_6 = 0;\n        __pyx_t_4 = __Pyx_PyObject_Call(__pyx_t_5, __pyx_t_8, NULL); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 288, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_4);\n        __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0;\n      }\n    }\n    __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n    __pyx_t_5 = NULL;\n    if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n      __pyx_t_5 = PyMethod_GET_SELF(__pyx_t_3);\n      if (likely(__pyx_t_5)) {\n        PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n        __Pyx_INCREF(__pyx_t_5);\n        __Pyx_INCREF(function);\n        __Pyx_DECREF_SET(__pyx_t_3, function);\n      }\n    }\n    if (!__pyx_t_5) {\n      __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 288, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      __Pyx_GOTREF(__pyx_t_2);\n    } else {\n      #if CYTHON_FAST_PYCALL\n      if (PyFunction_Check(__pyx_t_3)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_5, __pyx_t_4};\n        __pyx_t_2 = __Pyx_PyFunction_FastCall(__pyx_t_3, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 288, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;\n        __Pyx_GOTREF(__pyx_t_2);\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else\n      #endif\n      #if CYTHON_FAST_PYCCALL\n      if (__Pyx_PyFastCFunction_Check(__pyx_t_3)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_5, __pyx_t_4};\n        __pyx_t_2 = __Pyx_PyCFunction_FastCall(__pyx_t_3, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 288, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;\n        __Pyx_GOTREF(__pyx_t_2);\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else\n      #endif\n      {\n        __pyx_t_8 = PyTuple_New(1+1); if (unlikely(!__pyx_t_8)) __PYX_ERR(0, 288, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_8);\n        __Pyx_GIVEREF(__pyx_t_5); PyTuple_SET_ITEM(__pyx_t_8, 0, __pyx_t_5); __pyx_t_5 = NULL;\n        __Pyx_GIVEREF(__pyx_t_4);\n        PyTuple_SET_ITEM(__pyx_t_8, 0+1, __pyx_t_4);\n        __pyx_t_4 = 0;\n        __pyx_t_2 = __Pyx_PyObject_Call(__pyx_t_3, __pyx_t_8, NULL); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 288, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_2);\n        __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0;\n      }\n    }\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    __Pyx_Raise(__pyx_t_2, 0, 0, 0);\n    __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n    __PYX_ERR(0, 288, __pyx_L1_error)\n\n    /* \"pywrapfst.pyx\":287\n *   \"\"\"\n *   cdef fst.QueueType queue_type_enum\n *   if not fst.GetQueueType(queue_type, addr(queue_type_enum)):             # <<<<<<<<<<<<<<\n *     raise FstArgError(\"Unknown queue type: {!r}\".format(queue_type))\n *   return queue_type_enum\n */\n  }\n\n  /* \"pywrapfst.pyx\":289\n *   if not fst.GetQueueType(queue_type, addr(queue_type_enum)):\n *     raise FstArgError(\"Unknown queue type: {!r}\".format(queue_type))\n *   return queue_type_enum             # <<<<<<<<<<<<<<\n * \n * \n */\n  __pyx_r = __pyx_v_queue_type_enum;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":268\n * \n * \n * cdef fst.QueueType _get_queue_type(const string &queue_type) except *:             # <<<<<<<<<<<<<<\n *   \"\"\"Matches string with the appropriate QueueType enum value.\n * \n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_XDECREF(__pyx_t_6);\n  __Pyx_XDECREF(__pyx_t_7);\n  __Pyx_XDECREF(__pyx_t_8);\n  __Pyx_AddTraceback(\"pywrapfst._get_queue_type\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = (enum fst::QueueType) 0;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":292\n * \n * \n * cdef fst.RandArcSelection _get_rand_arc_selection(             # <<<<<<<<<<<<<<\n *     const string &select) except *:\n *   \"\"\"Matches string with the appropriate RandArcSelection enum value.\n */\n\nstatic enum fst::script::RandArcSelection __pyx_f_9pywrapfst__get_rand_arc_selection(std::string const &__pyx_v_select) {\n  enum fst::script::RandArcSelection __pyx_v_select_enum;\n  enum fst::script::RandArcSelection __pyx_r;\n  __Pyx_RefNannyDeclarations\n  int __pyx_t_1;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  PyObject *__pyx_t_6 = NULL;\n  PyObject *__pyx_t_7 = NULL;\n  PyObject *__pyx_t_8 = NULL;\n  __Pyx_RefNannySetupContext(\"_get_rand_arc_selection\", 0);\n\n  /* \"pywrapfst.pyx\":312\n *   \"\"\"\n *   cdef fst.RandArcSelection select_enum\n *   if not fst.GetRandArcSelection(select, addr(select_enum)):             # <<<<<<<<<<<<<<\n *     raise FstArgError(\"Unknown random arc selection type: {!r}\".format(select))\n *   return select_enum\n */\n  __pyx_t_1 = ((!(fst::script::GetRandArcSelection(__pyx_v_select, (&__pyx_v_select_enum)) != 0)) != 0);\n  if (__pyx_t_1) {\n\n    /* \"pywrapfst.pyx\":313\n *   cdef fst.RandArcSelection select_enum\n *   if not fst.GetRandArcSelection(select, addr(select_enum)):\n *     raise FstArgError(\"Unknown random arc selection type: {!r}\".format(select))             # <<<<<<<<<<<<<<\n *   return select_enum\n * \n */\n    __pyx_t_3 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstArgError); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 313, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_3);\n    __pyx_t_5 = __Pyx_PyObject_GetAttrStr(__pyx_kp_s_Unknown_random_arc_selection_typ, __pyx_n_s_format); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 313, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_5);\n    __pyx_t_6 = __pyx_convert_PyBytes_string_to_py_std__in_string(__pyx_v_select); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 313, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_6);\n    __pyx_t_7 = NULL;\n    if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_5))) {\n      __pyx_t_7 = PyMethod_GET_SELF(__pyx_t_5);\n      if (likely(__pyx_t_7)) {\n        PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_5);\n        __Pyx_INCREF(__pyx_t_7);\n        __Pyx_INCREF(function);\n        __Pyx_DECREF_SET(__pyx_t_5, function);\n      }\n    }\n    if (!__pyx_t_7) {\n      __pyx_t_4 = __Pyx_PyObject_CallOneArg(__pyx_t_5, __pyx_t_6); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 313, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n      __Pyx_GOTREF(__pyx_t_4);\n    } else {\n      #if CYTHON_FAST_PYCALL\n      if (PyFunction_Check(__pyx_t_5)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_7, __pyx_t_6};\n        __pyx_t_4 = __Pyx_PyFunction_FastCall(__pyx_t_5, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 313, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_7); __pyx_t_7 = 0;\n        __Pyx_GOTREF(__pyx_t_4);\n        __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n      } else\n      #endif\n      #if CYTHON_FAST_PYCCALL\n      if (__Pyx_PyFastCFunction_Check(__pyx_t_5)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_7, __pyx_t_6};\n        __pyx_t_4 = __Pyx_PyCFunction_FastCall(__pyx_t_5, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 313, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_7); __pyx_t_7 = 0;\n        __Pyx_GOTREF(__pyx_t_4);\n        __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n      } else\n      #endif\n      {\n        __pyx_t_8 = PyTuple_New(1+1); if (unlikely(!__pyx_t_8)) __PYX_ERR(0, 313, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_8);\n        __Pyx_GIVEREF(__pyx_t_7); PyTuple_SET_ITEM(__pyx_t_8, 0, __pyx_t_7); __pyx_t_7 = NULL;\n        __Pyx_GIVEREF(__pyx_t_6);\n        PyTuple_SET_ITEM(__pyx_t_8, 0+1, __pyx_t_6);\n        __pyx_t_6 = 0;\n        __pyx_t_4 = __Pyx_PyObject_Call(__pyx_t_5, __pyx_t_8, NULL); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 313, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_4);\n        __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0;\n      }\n    }\n    __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n    __pyx_t_5 = NULL;\n    if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n      __pyx_t_5 = PyMethod_GET_SELF(__pyx_t_3);\n      if (likely(__pyx_t_5)) {\n        PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n        __Pyx_INCREF(__pyx_t_5);\n        __Pyx_INCREF(function);\n        __Pyx_DECREF_SET(__pyx_t_3, function);\n      }\n    }\n    if (!__pyx_t_5) {\n      __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 313, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      __Pyx_GOTREF(__pyx_t_2);\n    } else {\n      #if CYTHON_FAST_PYCALL\n      if (PyFunction_Check(__pyx_t_3)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_5, __pyx_t_4};\n        __pyx_t_2 = __Pyx_PyFunction_FastCall(__pyx_t_3, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 313, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;\n        __Pyx_GOTREF(__pyx_t_2);\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else\n      #endif\n      #if CYTHON_FAST_PYCCALL\n      if (__Pyx_PyFastCFunction_Check(__pyx_t_3)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_5, __pyx_t_4};\n        __pyx_t_2 = __Pyx_PyCFunction_FastCall(__pyx_t_3, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 313, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;\n        __Pyx_GOTREF(__pyx_t_2);\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else\n      #endif\n      {\n        __pyx_t_8 = PyTuple_New(1+1); if (unlikely(!__pyx_t_8)) __PYX_ERR(0, 313, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_8);\n        __Pyx_GIVEREF(__pyx_t_5); PyTuple_SET_ITEM(__pyx_t_8, 0, __pyx_t_5); __pyx_t_5 = NULL;\n        __Pyx_GIVEREF(__pyx_t_4);\n        PyTuple_SET_ITEM(__pyx_t_8, 0+1, __pyx_t_4);\n        __pyx_t_4 = 0;\n        __pyx_t_2 = __Pyx_PyObject_Call(__pyx_t_3, __pyx_t_8, NULL); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 313, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_2);\n        __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0;\n      }\n    }\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    __Pyx_Raise(__pyx_t_2, 0, 0, 0);\n    __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n    __PYX_ERR(0, 313, __pyx_L1_error)\n\n    /* \"pywrapfst.pyx\":312\n *   \"\"\"\n *   cdef fst.RandArcSelection select_enum\n *   if not fst.GetRandArcSelection(select, addr(select_enum)):             # <<<<<<<<<<<<<<\n *     raise FstArgError(\"Unknown random arc selection type: {!r}\".format(select))\n *   return select_enum\n */\n  }\n\n  /* \"pywrapfst.pyx\":314\n *   if not fst.GetRandArcSelection(select, addr(select_enum)):\n *     raise FstArgError(\"Unknown random arc selection type: {!r}\".format(select))\n *   return select_enum             # <<<<<<<<<<<<<<\n * \n * \n */\n  __pyx_r = __pyx_v_select_enum;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":292\n * \n * \n * cdef fst.RandArcSelection _get_rand_arc_selection(             # <<<<<<<<<<<<<<\n *     const string &select) except *:\n *   \"\"\"Matches string with the appropriate RandArcSelection enum value.\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_XDECREF(__pyx_t_6);\n  __Pyx_XDECREF(__pyx_t_7);\n  __Pyx_XDECREF(__pyx_t_8);\n  __Pyx_AddTraceback(\"pywrapfst._get_rand_arc_selection\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = (enum fst::script::RandArcSelection) 0;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":317\n * \n * \n * cdef fst.ReplaceLabelType _get_replace_label_type(             # <<<<<<<<<<<<<<\n *     const string &replace_label_type, bool epsilon_on_replace) except *:\n *   \"\"\"Matches string with the appropriate ReplaceLabelType enum value.\n */\n\nstatic enum fst::ReplaceLabelType __pyx_f_9pywrapfst__get_replace_label_type(std::string const &__pyx_v_replace_label_type, bool __pyx_v_epsilon_on_replace) {\n  enum fst::ReplaceLabelType __pyx_v_replace_label_type_enum;\n  enum fst::ReplaceLabelType __pyx_r;\n  __Pyx_RefNannyDeclarations\n  int __pyx_t_1;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  PyObject *__pyx_t_6 = NULL;\n  PyObject *__pyx_t_7 = NULL;\n  PyObject *__pyx_t_8 = NULL;\n  __Pyx_RefNannySetupContext(\"_get_replace_label_type\", 0);\n\n  /* \"pywrapfst.pyx\":338\n *   \"\"\"\n *   cdef fst.ReplaceLabelType replace_label_type_enum\n *   if not fst.GetReplaceLabelType(replace_label_type, epsilon_on_replace,             # <<<<<<<<<<<<<<\n *                                  addr(replace_label_type_enum)):\n *     raise FstArgError(\"Unknown replace label type: {!r}\".format(\n */\n  __pyx_t_1 = ((!(fst::script::GetReplaceLabelType(__pyx_v_replace_label_type, __pyx_v_epsilon_on_replace, (&__pyx_v_replace_label_type_enum)) != 0)) != 0);\n  if (__pyx_t_1) {\n\n    /* \"pywrapfst.pyx\":340\n *   if not fst.GetReplaceLabelType(replace_label_type, epsilon_on_replace,\n *                                  addr(replace_label_type_enum)):\n *     raise FstArgError(\"Unknown replace label type: {!r}\".format(             # <<<<<<<<<<<<<<\n *                       replace_label_type))\n *   return replace_label_type_enum\n */\n    __pyx_t_3 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstArgError); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 340, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_3);\n    __pyx_t_5 = __Pyx_PyObject_GetAttrStr(__pyx_kp_s_Unknown_replace_label_type_r, __pyx_n_s_format); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 340, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_5);\n\n    /* \"pywrapfst.pyx\":341\n *                                  addr(replace_label_type_enum)):\n *     raise FstArgError(\"Unknown replace label type: {!r}\".format(\n *                       replace_label_type))             # <<<<<<<<<<<<<<\n *   return replace_label_type_enum\n * \n */\n    __pyx_t_6 = __pyx_convert_PyBytes_string_to_py_std__in_string(__pyx_v_replace_label_type); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 341, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_6);\n    __pyx_t_7 = NULL;\n    if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_5))) {\n      __pyx_t_7 = PyMethod_GET_SELF(__pyx_t_5);\n      if (likely(__pyx_t_7)) {\n        PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_5);\n        __Pyx_INCREF(__pyx_t_7);\n        __Pyx_INCREF(function);\n        __Pyx_DECREF_SET(__pyx_t_5, function);\n      }\n    }\n    if (!__pyx_t_7) {\n      __pyx_t_4 = __Pyx_PyObject_CallOneArg(__pyx_t_5, __pyx_t_6); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 340, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n      __Pyx_GOTREF(__pyx_t_4);\n    } else {\n      #if CYTHON_FAST_PYCALL\n      if (PyFunction_Check(__pyx_t_5)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_7, __pyx_t_6};\n        __pyx_t_4 = __Pyx_PyFunction_FastCall(__pyx_t_5, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 340, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_7); __pyx_t_7 = 0;\n        __Pyx_GOTREF(__pyx_t_4);\n        __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n      } else\n      #endif\n      #if CYTHON_FAST_PYCCALL\n      if (__Pyx_PyFastCFunction_Check(__pyx_t_5)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_7, __pyx_t_6};\n        __pyx_t_4 = __Pyx_PyCFunction_FastCall(__pyx_t_5, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 340, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_7); __pyx_t_7 = 0;\n        __Pyx_GOTREF(__pyx_t_4);\n        __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n      } else\n      #endif\n      {\n        __pyx_t_8 = PyTuple_New(1+1); if (unlikely(!__pyx_t_8)) __PYX_ERR(0, 340, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_8);\n        __Pyx_GIVEREF(__pyx_t_7); PyTuple_SET_ITEM(__pyx_t_8, 0, __pyx_t_7); __pyx_t_7 = NULL;\n        __Pyx_GIVEREF(__pyx_t_6);\n        PyTuple_SET_ITEM(__pyx_t_8, 0+1, __pyx_t_6);\n        __pyx_t_6 = 0;\n        __pyx_t_4 = __Pyx_PyObject_Call(__pyx_t_5, __pyx_t_8, NULL); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 340, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_4);\n        __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0;\n      }\n    }\n    __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n    __pyx_t_5 = NULL;\n    if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n      __pyx_t_5 = PyMethod_GET_SELF(__pyx_t_3);\n      if (likely(__pyx_t_5)) {\n        PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n        __Pyx_INCREF(__pyx_t_5);\n        __Pyx_INCREF(function);\n        __Pyx_DECREF_SET(__pyx_t_3, function);\n      }\n    }\n    if (!__pyx_t_5) {\n      __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 340, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      __Pyx_GOTREF(__pyx_t_2);\n    } else {\n      #if CYTHON_FAST_PYCALL\n      if (PyFunction_Check(__pyx_t_3)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_5, __pyx_t_4};\n        __pyx_t_2 = __Pyx_PyFunction_FastCall(__pyx_t_3, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 340, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;\n        __Pyx_GOTREF(__pyx_t_2);\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else\n      #endif\n      #if CYTHON_FAST_PYCCALL\n      if (__Pyx_PyFastCFunction_Check(__pyx_t_3)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_5, __pyx_t_4};\n        __pyx_t_2 = __Pyx_PyCFunction_FastCall(__pyx_t_3, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 340, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;\n        __Pyx_GOTREF(__pyx_t_2);\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else\n      #endif\n      {\n        __pyx_t_8 = PyTuple_New(1+1); if (unlikely(!__pyx_t_8)) __PYX_ERR(0, 340, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_8);\n        __Pyx_GIVEREF(__pyx_t_5); PyTuple_SET_ITEM(__pyx_t_8, 0, __pyx_t_5); __pyx_t_5 = NULL;\n        __Pyx_GIVEREF(__pyx_t_4);\n        PyTuple_SET_ITEM(__pyx_t_8, 0+1, __pyx_t_4);\n        __pyx_t_4 = 0;\n        __pyx_t_2 = __Pyx_PyObject_Call(__pyx_t_3, __pyx_t_8, NULL); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 340, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_2);\n        __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0;\n      }\n    }\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    __Pyx_Raise(__pyx_t_2, 0, 0, 0);\n    __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n    __PYX_ERR(0, 340, __pyx_L1_error)\n\n    /* \"pywrapfst.pyx\":338\n *   \"\"\"\n *   cdef fst.ReplaceLabelType replace_label_type_enum\n *   if not fst.GetReplaceLabelType(replace_label_type, epsilon_on_replace,             # <<<<<<<<<<<<<<\n *                                  addr(replace_label_type_enum)):\n *     raise FstArgError(\"Unknown replace label type: {!r}\".format(\n */\n  }\n\n  /* \"pywrapfst.pyx\":342\n *     raise FstArgError(\"Unknown replace label type: {!r}\".format(\n *                       replace_label_type))\n *   return replace_label_type_enum             # <<<<<<<<<<<<<<\n * \n * \n */\n  __pyx_r = __pyx_v_replace_label_type_enum;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":317\n * \n * \n * cdef fst.ReplaceLabelType _get_replace_label_type(             # <<<<<<<<<<<<<<\n *     const string &replace_label_type, bool epsilon_on_replace) except *:\n *   \"\"\"Matches string with the appropriate ReplaceLabelType enum value.\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_XDECREF(__pyx_t_6);\n  __Pyx_XDECREF(__pyx_t_7);\n  __Pyx_XDECREF(__pyx_t_8);\n  __Pyx_AddTraceback(\"pywrapfst._get_replace_label_type\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = (enum fst::ReplaceLabelType) 0;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":368\n *   \"\"\"\n * \n *   def __repr__(self):             # <<<<<<<<<<<<<<\n *     return \"<{} Weight {} at 0x{:x}>\".format(self.type(), self.to_string(),\n *                                              id(self))\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_6Weight_1__repr__(PyObject *__pyx_v_self); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_6Weight_1__repr__(PyObject *__pyx_v_self) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__repr__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_6Weight___repr__(((struct __pyx_obj_9pywrapfst_Weight *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_6Weight___repr__(struct __pyx_obj_9pywrapfst_Weight *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  PyObject *__pyx_t_6 = NULL;\n  int __pyx_t_7;\n  PyObject *__pyx_t_8 = NULL;\n  __Pyx_RefNannySetupContext(\"__repr__\", 0);\n\n  /* \"pywrapfst.pyx\":369\n * \n *   def __repr__(self):\n *     return \"<{} Weight {} at 0x{:x}>\".format(self.type(), self.to_string(),             # <<<<<<<<<<<<<<\n *                                              id(self))\n * \n */\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_2 = __Pyx_PyObject_GetAttrStr(__pyx_kp_s_Weight_at_0x_x, __pyx_n_s_format); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 369, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"type\");\n    __PYX_ERR(0, 369, __pyx_L1_error)\n  }\n  __pyx_t_3 = __pyx_convert_PyBytes_string_to_py_std__in_string(((struct __pyx_vtabstruct_9pywrapfst_Weight *)__pyx_v_self->__pyx_vtab)->type(__pyx_v_self, 0)); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 369, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_3);\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"to_string\");\n    __PYX_ERR(0, 369, __pyx_L1_error)\n  }\n  __pyx_t_4 = __pyx_convert_PyBytes_string_to_py_std__in_string(((struct __pyx_vtabstruct_9pywrapfst_Weight *)__pyx_v_self->__pyx_vtab)->to_string(__pyx_v_self, 0)); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 369, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_4);\n\n  /* \"pywrapfst.pyx\":370\n *   def __repr__(self):\n *     return \"<{} Weight {} at 0x{:x}>\".format(self.type(), self.to_string(),\n *                                              id(self))             # <<<<<<<<<<<<<<\n * \n *   def __str__(self):\n */\n  __pyx_t_5 = PyTuple_New(1); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 370, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_5);\n  __Pyx_INCREF(((PyObject *)__pyx_v_self));\n  __Pyx_GIVEREF(((PyObject *)__pyx_v_self));\n  PyTuple_SET_ITEM(__pyx_t_5, 0, ((PyObject *)__pyx_v_self));\n  __pyx_t_6 = __Pyx_PyObject_Call(__pyx_builtin_id, __pyx_t_5, NULL); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 370, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_6);\n  __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n  __pyx_t_5 = NULL;\n  __pyx_t_7 = 0;\n  if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_2))) {\n    __pyx_t_5 = PyMethod_GET_SELF(__pyx_t_2);\n    if (likely(__pyx_t_5)) {\n      PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_2);\n      __Pyx_INCREF(__pyx_t_5);\n      __Pyx_INCREF(function);\n      __Pyx_DECREF_SET(__pyx_t_2, function);\n      __pyx_t_7 = 1;\n    }\n  }\n  #if CYTHON_FAST_PYCALL\n  if (PyFunction_Check(__pyx_t_2)) {\n    PyObject *__pyx_temp[4] = {__pyx_t_5, __pyx_t_3, __pyx_t_4, __pyx_t_6};\n    __pyx_t_1 = __Pyx_PyFunction_FastCall(__pyx_t_2, __pyx_temp+1-__pyx_t_7, 3+__pyx_t_7); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 369, __pyx_L1_error)\n    __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;\n    __Pyx_GOTREF(__pyx_t_1);\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n    __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n  } else\n  #endif\n  #if CYTHON_FAST_PYCCALL\n  if (__Pyx_PyFastCFunction_Check(__pyx_t_2)) {\n    PyObject *__pyx_temp[4] = {__pyx_t_5, __pyx_t_3, __pyx_t_4, __pyx_t_6};\n    __pyx_t_1 = __Pyx_PyCFunction_FastCall(__pyx_t_2, __pyx_temp+1-__pyx_t_7, 3+__pyx_t_7); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 369, __pyx_L1_error)\n    __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;\n    __Pyx_GOTREF(__pyx_t_1);\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n    __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n  } else\n  #endif\n  {\n    __pyx_t_8 = PyTuple_New(3+__pyx_t_7); if (unlikely(!__pyx_t_8)) __PYX_ERR(0, 369, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_8);\n    if (__pyx_t_5) {\n      __Pyx_GIVEREF(__pyx_t_5); PyTuple_SET_ITEM(__pyx_t_8, 0, __pyx_t_5); __pyx_t_5 = NULL;\n    }\n    __Pyx_GIVEREF(__pyx_t_3);\n    PyTuple_SET_ITEM(__pyx_t_8, 0+__pyx_t_7, __pyx_t_3);\n    __Pyx_GIVEREF(__pyx_t_4);\n    PyTuple_SET_ITEM(__pyx_t_8, 1+__pyx_t_7, __pyx_t_4);\n    __Pyx_GIVEREF(__pyx_t_6);\n    PyTuple_SET_ITEM(__pyx_t_8, 2+__pyx_t_7, __pyx_t_6);\n    __pyx_t_3 = 0;\n    __pyx_t_4 = 0;\n    __pyx_t_6 = 0;\n    __pyx_t_1 = __Pyx_PyObject_Call(__pyx_t_2, __pyx_t_8, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 369, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0;\n  }\n  __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":368\n *   \"\"\"\n * \n *   def __repr__(self):             # <<<<<<<<<<<<<<\n *     return \"<{} Weight {} at 0x{:x}>\".format(self.type(), self.to_string(),\n *                                              id(self))\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_XDECREF(__pyx_t_6);\n  __Pyx_XDECREF(__pyx_t_8);\n  __Pyx_AddTraceback(\"pywrapfst.Weight.__repr__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":372\n *                                              id(self))\n * \n *   def __str__(self):             # <<<<<<<<<<<<<<\n *     return self.to_string()\n * \n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_6Weight_3__str__(PyObject *__pyx_v_self); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_6Weight_3__str__(PyObject *__pyx_v_self) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__str__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_6Weight_2__str__(((struct __pyx_obj_9pywrapfst_Weight *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_6Weight_2__str__(struct __pyx_obj_9pywrapfst_Weight *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"__str__\", 0);\n\n  /* \"pywrapfst.pyx\":373\n * \n *   def __str__(self):\n *     return self.to_string()             # <<<<<<<<<<<<<<\n * \n *   # This attempts to convert the string form into a float, raising\n */\n  __Pyx_XDECREF(__pyx_r);\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"to_string\");\n    __PYX_ERR(0, 373, __pyx_L1_error)\n  }\n  __pyx_t_1 = __pyx_convert_PyBytes_string_to_py_std__in_string(((struct __pyx_vtabstruct_9pywrapfst_Weight *)__pyx_v_self->__pyx_vtab)->to_string(__pyx_v_self, 0)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 373, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":372\n *                                              id(self))\n * \n *   def __str__(self):             # <<<<<<<<<<<<<<\n *     return self.to_string()\n * \n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.Weight.__str__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":378\n *   # ValueError when that is not appropriate.\n * \n *   def __float__(self):             # <<<<<<<<<<<<<<\n *     return float(self.to_string())\n * \n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_6Weight_5__float__(PyObject *__pyx_v_self); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_6Weight_5__float__(PyObject *__pyx_v_self) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__float__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_6Weight_4__float__(((struct __pyx_obj_9pywrapfst_Weight *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_6Weight_4__float__(struct __pyx_obj_9pywrapfst_Weight *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  __Pyx_RefNannySetupContext(\"__float__\", 0);\n\n  /* \"pywrapfst.pyx\":379\n * \n *   def __float__(self):\n *     return float(self.to_string())             # <<<<<<<<<<<<<<\n * \n *   def __init__(self, weight_type, weight):\n */\n  __Pyx_XDECREF(__pyx_r);\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"to_string\");\n    __PYX_ERR(0, 379, __pyx_L1_error)\n  }\n  __pyx_t_1 = __pyx_convert_PyBytes_string_to_py_std__in_string(((struct __pyx_vtabstruct_9pywrapfst_Weight *)__pyx_v_self->__pyx_vtab)->to_string(__pyx_v_self, 0)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 379, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_t_2 = __Pyx_PyNumber_Float(__pyx_t_1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 379, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  __pyx_r = __pyx_t_2;\n  __pyx_t_2 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":378\n *   # ValueError when that is not appropriate.\n * \n *   def __float__(self):             # <<<<<<<<<<<<<<\n *     return float(self.to_string())\n * \n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_AddTraceback(\"pywrapfst.Weight.__float__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":381\n *     return float(self.to_string())\n * \n *   def __init__(self, weight_type, weight):             # <<<<<<<<<<<<<<\n *     self._weight.reset(new fst.WeightClass(tostring(weight_type),\n *                                            weight_tostring(weight)))\n */\n\n/* Python wrapper */\nstatic int __pyx_pw_9pywrapfst_6Weight_7__init__(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic int __pyx_pw_9pywrapfst_6Weight_7__init__(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  PyObject *__pyx_v_weight_type = 0;\n  PyObject *__pyx_v_weight = 0;\n  int __pyx_r;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__init__ (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_weight_type,&__pyx_n_s_weight,0};\n    PyObject* values[2] = {0,0};\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (likely((values[0] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_weight_type)) != 0)) kw_args--;\n        else goto __pyx_L5_argtuple_error;\n        CYTHON_FALLTHROUGH;\n        case  1:\n        if (likely((values[1] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_weight)) != 0)) kw_args--;\n        else {\n          __Pyx_RaiseArgtupleInvalid(\"__init__\", 1, 2, 2, 1); __PYX_ERR(0, 381, __pyx_L3_error)\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"__init__\") < 0)) __PYX_ERR(0, 381, __pyx_L3_error)\n      }\n    } else if (PyTuple_GET_SIZE(__pyx_args) != 2) {\n      goto __pyx_L5_argtuple_error;\n    } else {\n      values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n      values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n    }\n    __pyx_v_weight_type = values[0];\n    __pyx_v_weight = values[1];\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"__init__\", 1, 2, 2, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 381, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst.Weight.__init__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return -1;\n  __pyx_L4_argument_unpacking_done:;\n  __pyx_r = __pyx_pf_9pywrapfst_6Weight_6__init__(((struct __pyx_obj_9pywrapfst_Weight *)__pyx_v_self), __pyx_v_weight_type, __pyx_v_weight);\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic int __pyx_pf_9pywrapfst_6Weight_6__init__(struct __pyx_obj_9pywrapfst_Weight *__pyx_v_self, PyObject *__pyx_v_weight_type, PyObject *__pyx_v_weight) {\n  int __pyx_r;\n  __Pyx_RefNannyDeclarations\n  std::string __pyx_t_1;\n  std::string __pyx_t_2;\n  __Pyx_RefNannySetupContext(\"__init__\", 0);\n\n  /* \"pywrapfst.pyx\":382\n * \n *   def __init__(self, weight_type, weight):\n *     self._weight.reset(new fst.WeightClass(tostring(weight_type),             # <<<<<<<<<<<<<<\n *                                            weight_tostring(weight)))\n *     self._check_weight()\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_weight\");\n    __PYX_ERR(0, 382, __pyx_L1_error)\n  }\n  __pyx_t_1 = __pyx_f_9pywrapfst_tostring(__pyx_v_weight_type, NULL); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 382, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":383\n *   def __init__(self, weight_type, weight):\n *     self._weight.reset(new fst.WeightClass(tostring(weight_type),\n *                                            weight_tostring(weight)))             # <<<<<<<<<<<<<<\n *     self._check_weight()\n * \n */\n  __pyx_t_2 = __pyx_f_9pywrapfst_weight_tostring(__pyx_v_weight, NULL); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 383, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":382\n * \n *   def __init__(self, weight_type, weight):\n *     self._weight.reset(new fst.WeightClass(tostring(weight_type),             # <<<<<<<<<<<<<<\n *                                            weight_tostring(weight)))\n *     self._check_weight()\n */\n  __pyx_v_self->_weight.reset(new fst::script::WeightClass(__pyx_t_1, __pyx_t_2));\n\n  /* \"pywrapfst.pyx\":384\n *     self._weight.reset(new fst.WeightClass(tostring(weight_type),\n *                                            weight_tostring(weight)))\n *     self._check_weight()             # <<<<<<<<<<<<<<\n * \n *   cdef void _check_weight(self) except *:\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_check_weight\");\n    __PYX_ERR(0, 384, __pyx_L1_error)\n  }\n  ((struct __pyx_vtabstruct_9pywrapfst_Weight *)__pyx_v_self->__pyx_vtab)->_check_weight(__pyx_v_self); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 384, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":381\n *     return float(self.to_string())\n * \n *   def __init__(self, weight_type, weight):             # <<<<<<<<<<<<<<\n *     self._weight.reset(new fst.WeightClass(tostring(weight_type),\n *                                            weight_tostring(weight)))\n */\n\n  /* function exit code */\n  __pyx_r = 0;\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"pywrapfst.Weight.__init__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = -1;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":386\n *     self._check_weight()\n * \n *   cdef void _check_weight(self) except *:             # <<<<<<<<<<<<<<\n *     if self.type() == b\"none\":\n *       raise FstArgError(\"Weight type not found\")\n */\n\nstatic void __pyx_f_9pywrapfst_6Weight__check_weight(struct __pyx_obj_9pywrapfst_Weight *__pyx_v_self) {\n  __Pyx_RefNannyDeclarations\n  int __pyx_t_1;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  __Pyx_RefNannySetupContext(\"_check_weight\", 0);\n\n  /* \"pywrapfst.pyx\":387\n * \n *   cdef void _check_weight(self) except *:\n *     if self.type() == b\"none\":             # <<<<<<<<<<<<<<\n *       raise FstArgError(\"Weight type not found\")\n *     if self.to_string() == b\"BadNumber\":\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"type\");\n    __PYX_ERR(0, 387, __pyx_L1_error)\n  }\n  __pyx_t_1 = ((((struct __pyx_vtabstruct_9pywrapfst_Weight *)__pyx_v_self->__pyx_vtab)->type(__pyx_v_self, 0) == ((char *)\"none\")) != 0);\n  if (__pyx_t_1) {\n\n    /* \"pywrapfst.pyx\":388\n *   cdef void _check_weight(self) except *:\n *     if self.type() == b\"none\":\n *       raise FstArgError(\"Weight type not found\")             # <<<<<<<<<<<<<<\n *     if self.to_string() == b\"BadNumber\":\n *       raise FstBadWeightError(\"Invalid weight\")\n */\n    __pyx_t_2 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstArgError); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 388, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_2);\n    __pyx_t_3 = __Pyx_PyObject_Call(__pyx_t_2, __pyx_tuple_, NULL); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 388, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_3);\n    __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n    __Pyx_Raise(__pyx_t_3, 0, 0, 0);\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    __PYX_ERR(0, 388, __pyx_L1_error)\n\n    /* \"pywrapfst.pyx\":387\n * \n *   cdef void _check_weight(self) except *:\n *     if self.type() == b\"none\":             # <<<<<<<<<<<<<<\n *       raise FstArgError(\"Weight type not found\")\n *     if self.to_string() == b\"BadNumber\":\n */\n  }\n\n  /* \"pywrapfst.pyx\":389\n *     if self.type() == b\"none\":\n *       raise FstArgError(\"Weight type not found\")\n *     if self.to_string() == b\"BadNumber\":             # <<<<<<<<<<<<<<\n *       raise FstBadWeightError(\"Invalid weight\")\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"to_string\");\n    __PYX_ERR(0, 389, __pyx_L1_error)\n  }\n  __pyx_t_1 = ((((struct __pyx_vtabstruct_9pywrapfst_Weight *)__pyx_v_self->__pyx_vtab)->to_string(__pyx_v_self, 0) == ((char *)\"BadNumber\")) != 0);\n  if (__pyx_t_1) {\n\n    /* \"pywrapfst.pyx\":390\n *       raise FstArgError(\"Weight type not found\")\n *     if self.to_string() == b\"BadNumber\":\n *       raise FstBadWeightError(\"Invalid weight\")             # <<<<<<<<<<<<<<\n * \n *   cpdef Weight copy(self):\n */\n    __pyx_t_3 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstBadWeightError); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 390, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_3);\n    __pyx_t_2 = __Pyx_PyObject_Call(__pyx_t_3, __pyx_tuple__2, NULL); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 390, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_2);\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    __Pyx_Raise(__pyx_t_2, 0, 0, 0);\n    __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n    __PYX_ERR(0, 390, __pyx_L1_error)\n\n    /* \"pywrapfst.pyx\":389\n *     if self.type() == b\"none\":\n *       raise FstArgError(\"Weight type not found\")\n *     if self.to_string() == b\"BadNumber\":             # <<<<<<<<<<<<<<\n *       raise FstBadWeightError(\"Invalid weight\")\n * \n */\n  }\n\n  /* \"pywrapfst.pyx\":386\n *     self._check_weight()\n * \n *   cdef void _check_weight(self) except *:             # <<<<<<<<<<<<<<\n *     if self.type() == b\"none\":\n *       raise FstArgError(\"Weight type not found\")\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_AddTraceback(\"pywrapfst.Weight._check_weight\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n}\n\n/* \"pywrapfst.pyx\":392\n *       raise FstBadWeightError(\"Invalid weight\")\n * \n *   cpdef Weight copy(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     copy(self)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_6Weight_9copy(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic struct __pyx_obj_9pywrapfst_Weight *__pyx_f_9pywrapfst_6Weight_copy(struct __pyx_obj_9pywrapfst_Weight *__pyx_v_self, int __pyx_skip_dispatch) {\n  struct __pyx_obj_9pywrapfst_Weight *__pyx_v_result = 0;\n  struct __pyx_obj_9pywrapfst_Weight *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  __Pyx_RefNannySetupContext(\"copy\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_copy); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 392, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_6Weight_9copy)) {\n      __Pyx_XDECREF(((PyObject *)__pyx_r));\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 392, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 392, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      if (!(likely(((__pyx_t_2) == Py_None) || likely(__Pyx_TypeTest(__pyx_t_2, __pyx_ptype_9pywrapfst_Weight))))) __PYX_ERR(0, 392, __pyx_L1_error)\n      __pyx_r = ((struct __pyx_obj_9pywrapfst_Weight *)__pyx_t_2);\n      __pyx_t_2 = 0;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":398\n *     Returns a copy of the Weight.\n *     \"\"\"\n *     cdef Weight result = Weight.__new__(Weight)             # <<<<<<<<<<<<<<\n *     result._weight.reset(new fst.WeightClass(deref(self._weight)))\n *     return result\n */\n  __pyx_t_1 = __pyx_tp_new_9pywrapfst_Weight(((PyTypeObject *)__pyx_ptype_9pywrapfst_Weight), __pyx_empty_tuple, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 398, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (!(likely(__Pyx_TypeTest(__pyx_t_1, __pyx_ptype_9pywrapfst_Weight)))) __PYX_ERR(0, 398, __pyx_L1_error)\n  __pyx_v_result = ((struct __pyx_obj_9pywrapfst_Weight *)__pyx_t_1);\n  __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":399\n *     \"\"\"\n *     cdef Weight result = Weight.__new__(Weight)\n *     result._weight.reset(new fst.WeightClass(deref(self._weight)))             # <<<<<<<<<<<<<<\n *     return result\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_result) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_weight\");\n    __PYX_ERR(0, 399, __pyx_L1_error)\n  }\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_weight\");\n    __PYX_ERR(0, 399, __pyx_L1_error)\n  }\n  __pyx_v_result->_weight.reset(new fst::script::WeightClass((*__pyx_v_self->_weight)));\n\n  /* \"pywrapfst.pyx\":400\n *     cdef Weight result = Weight.__new__(Weight)\n *     result._weight.reset(new fst.WeightClass(deref(self._weight)))\n *     return result             # <<<<<<<<<<<<<<\n * \n *   # To get around the inability to declare cdef class methods, we define the\n */\n  __Pyx_XDECREF(((PyObject *)__pyx_r));\n  __Pyx_INCREF(((PyObject *)__pyx_v_result));\n  __pyx_r = __pyx_v_result;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":392\n *       raise FstBadWeightError(\"Invalid weight\")\n * \n *   cpdef Weight copy(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     copy(self)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_AddTraceback(\"pywrapfst.Weight.copy\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XDECREF((PyObject *)__pyx_v_result);\n  __Pyx_XGIVEREF((PyObject *)__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_6Weight_9copy(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_6Weight_8copy[] = \"\\n    copy(self)\\n\\n    Returns a copy of the Weight.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_6Weight_9copy(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"copy (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_6Weight_8copy(((struct __pyx_obj_9pywrapfst_Weight *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_6Weight_8copy(struct __pyx_obj_9pywrapfst_Weight *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"copy\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst_6Weight_copy(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 392, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.Weight.copy\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":406\n * \n *   @classmethod\n *   def Zero(cls, weight_type):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     Weight.Zero(weight_type)\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_6Weight_11Zero(PyObject *__pyx_v_cls, PyObject *__pyx_v_weight_type); /*proto*/\nstatic char __pyx_doc_9pywrapfst_6Weight_10Zero[] = \"\\n    Weight.Zero(weight_type)\\n\\n    Constructs semiring zero.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_6Weight_11Zero(PyObject *__pyx_v_cls, PyObject *__pyx_v_weight_type) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"Zero (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_6Weight_10Zero(((PyTypeObject*)__pyx_v_cls), ((PyObject *)__pyx_v_weight_type));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_6Weight_10Zero(CYTHON_UNUSED PyTypeObject *__pyx_v_cls, PyObject *__pyx_v_weight_type) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"Zero\", 0);\n\n  /* \"pywrapfst.pyx\":412\n *     Constructs semiring zero.\n *     \"\"\"\n *     return _Zero(weight_type)             # <<<<<<<<<<<<<<\n * \n *   @classmethod\n */\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst__Zero(__pyx_v_weight_type)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 412, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":406\n * \n *   @classmethod\n *   def Zero(cls, weight_type):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     Weight.Zero(weight_type)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.Weight.Zero\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":415\n * \n *   @classmethod\n *   def One(cls, weight_type):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     Weight.One(weight_type)\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_6Weight_13One(PyObject *__pyx_v_cls, PyObject *__pyx_v_weight_type); /*proto*/\nstatic char __pyx_doc_9pywrapfst_6Weight_12One[] = \"\\n    Weight.One(weight_type)\\n\\n    Constructs semiring One.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_6Weight_13One(PyObject *__pyx_v_cls, PyObject *__pyx_v_weight_type) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"One (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_6Weight_12One(((PyTypeObject*)__pyx_v_cls), ((PyObject *)__pyx_v_weight_type));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_6Weight_12One(CYTHON_UNUSED PyTypeObject *__pyx_v_cls, PyObject *__pyx_v_weight_type) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"One\", 0);\n\n  /* \"pywrapfst.pyx\":421\n *     Constructs semiring One.\n *     \"\"\"\n *     return _One(weight_type)             # <<<<<<<<<<<<<<\n * \n *   @classmethod\n */\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst__One(__pyx_v_weight_type)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 421, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":415\n * \n *   @classmethod\n *   def One(cls, weight_type):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     Weight.One(weight_type)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.Weight.One\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":424\n * \n *   @classmethod\n *   def NoWeight(cls, weight_type):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     Weight.NoWeight(weight_type)\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_6Weight_15NoWeight(PyObject *__pyx_v_cls, PyObject *__pyx_v_weight_type); /*proto*/\nstatic char __pyx_doc_9pywrapfst_6Weight_14NoWeight[] = \"\\n    Weight.NoWeight(weight_type)\\n\\n    Constructs a non-member weight in the semiring.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_6Weight_15NoWeight(PyObject *__pyx_v_cls, PyObject *__pyx_v_weight_type) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"NoWeight (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_6Weight_14NoWeight(((PyTypeObject*)__pyx_v_cls), ((PyObject *)__pyx_v_weight_type));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_6Weight_14NoWeight(CYTHON_UNUSED PyTypeObject *__pyx_v_cls, PyObject *__pyx_v_weight_type) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"NoWeight\", 0);\n\n  /* \"pywrapfst.pyx\":430\n *     Constructs a non-member weight in the semiring.\n *     \"\"\"\n *     return _NoWeight(weight_type)             # <<<<<<<<<<<<<<\n * \n *   def __eq__(Weight w1, Weight w2):\n */\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst__NoWeight(__pyx_v_weight_type)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 430, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":424\n * \n *   @classmethod\n *   def NoWeight(cls, weight_type):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     Weight.NoWeight(weight_type)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.Weight.NoWeight\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":432\n *     return _NoWeight(weight_type)\n * \n *   def __eq__(Weight w1, Weight w2):             # <<<<<<<<<<<<<<\n *     return fst.Eq(deref(w1._weight), deref(w2._weight))\n * \n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_6Weight_17__eq__(PyObject *__pyx_v_w1, PyObject *__pyx_v_w2); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_6Weight_17__eq__(PyObject *__pyx_v_w1, PyObject *__pyx_v_w2) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__eq__ (wrapper)\", 0);\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_w2), __pyx_ptype_9pywrapfst_Weight, 1, \"w2\", 0))) __PYX_ERR(0, 432, __pyx_L1_error)\n  __pyx_r = __pyx_pf_9pywrapfst_6Weight_16__eq__(((struct __pyx_obj_9pywrapfst_Weight *)__pyx_v_w1), ((struct __pyx_obj_9pywrapfst_Weight *)__pyx_v_w2));\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_6Weight_16__eq__(struct __pyx_obj_9pywrapfst_Weight *__pyx_v_w1, struct __pyx_obj_9pywrapfst_Weight *__pyx_v_w2) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"__eq__\", 0);\n\n  /* \"pywrapfst.pyx\":433\n * \n *   def __eq__(Weight w1, Weight w2):\n *     return fst.Eq(deref(w1._weight), deref(w2._weight))             # <<<<<<<<<<<<<<\n * \n *   def __ne__(Weight w1, Weight w2):\n */\n  __Pyx_XDECREF(__pyx_r);\n  if (unlikely(((PyObject *)__pyx_v_w1) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_weight\");\n    __PYX_ERR(0, 433, __pyx_L1_error)\n  }\n  if (unlikely(((PyObject *)__pyx_v_w2) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_weight\");\n    __PYX_ERR(0, 433, __pyx_L1_error)\n  }\n  __pyx_t_1 = __Pyx_PyBool_FromLong(operator==((*__pyx_v_w1->_weight), (*__pyx_v_w2->_weight))); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 433, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":432\n *     return _NoWeight(weight_type)\n * \n *   def __eq__(Weight w1, Weight w2):             # <<<<<<<<<<<<<<\n *     return fst.Eq(deref(w1._weight), deref(w2._weight))\n * \n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.Weight.__eq__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":435\n *     return fst.Eq(deref(w1._weight), deref(w2._weight))\n * \n *   def __ne__(Weight w1, Weight w2):             # <<<<<<<<<<<<<<\n *     return not w1 == w2\n * \n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_6Weight_19__ne__(PyObject *__pyx_v_w1, PyObject *__pyx_v_w2); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_6Weight_19__ne__(PyObject *__pyx_v_w1, PyObject *__pyx_v_w2) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__ne__ (wrapper)\", 0);\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_w2), __pyx_ptype_9pywrapfst_Weight, 1, \"w2\", 0))) __PYX_ERR(0, 435, __pyx_L1_error)\n  __pyx_r = __pyx_pf_9pywrapfst_6Weight_18__ne__(((struct __pyx_obj_9pywrapfst_Weight *)__pyx_v_w1), ((struct __pyx_obj_9pywrapfst_Weight *)__pyx_v_w2));\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_6Weight_18__ne__(struct __pyx_obj_9pywrapfst_Weight *__pyx_v_w1, struct __pyx_obj_9pywrapfst_Weight *__pyx_v_w2) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  int __pyx_t_2;\n  __Pyx_RefNannySetupContext(\"__ne__\", 0);\n\n  /* \"pywrapfst.pyx\":436\n * \n *   def __ne__(Weight w1, Weight w2):\n *     return not w1 == w2             # <<<<<<<<<<<<<<\n * \n *   cpdef string to_string(self):\n */\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = PyObject_RichCompare(((PyObject *)__pyx_v_w1), ((PyObject *)__pyx_v_w2), Py_EQ); __Pyx_XGOTREF(__pyx_t_1); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 436, __pyx_L1_error)\n  __pyx_t_2 = __Pyx_PyObject_IsTrue(__pyx_t_1); if (unlikely(__pyx_t_2 < 0)) __PYX_ERR(0, 436, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  __pyx_t_1 = __Pyx_PyBool_FromLong((!__pyx_t_2)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 436, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":435\n *     return fst.Eq(deref(w1._weight), deref(w2._weight))\n * \n *   def __ne__(Weight w1, Weight w2):             # <<<<<<<<<<<<<<\n *     return not w1 == w2\n * \n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.Weight.__ne__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":438\n *     return not w1 == w2\n * \n *   cpdef string to_string(self):             # <<<<<<<<<<<<<<\n *     return self._weight.get().ToString()\n * \n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_6Weight_21to_string(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic std::string __pyx_f_9pywrapfst_6Weight_to_string(struct __pyx_obj_9pywrapfst_Weight *__pyx_v_self, int __pyx_skip_dispatch) {\n  std::string __pyx_r;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  std::string __pyx_t_5;\n  __Pyx_RefNannySetupContext(\"to_string\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_to_string); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 438, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_6Weight_21to_string)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 438, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 438, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __pyx_t_5 = __pyx_convert_string_from_py_std__in_string(__pyx_t_2); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 438, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __pyx_r = __pyx_t_5;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":439\n * \n *   cpdef string to_string(self):\n *     return self._weight.get().ToString()             # <<<<<<<<<<<<<<\n * \n *   cpdef string type(self):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_weight\");\n    __PYX_ERR(0, 439, __pyx_L1_error)\n  }\n  __pyx_r = __pyx_v_self->_weight.get()->ToString();\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":438\n *     return not w1 == w2\n * \n *   cpdef string to_string(self):             # <<<<<<<<<<<<<<\n *     return self._weight.get().ToString()\n * \n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_WriteUnraisable(\"pywrapfst.Weight.to_string\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __Pyx_pretend_to_initialize(&__pyx_r);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_6Weight_21to_string(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_6Weight_21to_string(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"to_string (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_6Weight_20to_string(((struct __pyx_obj_9pywrapfst_Weight *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_6Weight_20to_string(struct __pyx_obj_9pywrapfst_Weight *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"to_string\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __pyx_convert_PyBytes_string_to_py_std__in_string(__pyx_f_9pywrapfst_6Weight_to_string(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 438, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.Weight.to_string\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":441\n *     return self._weight.get().ToString()\n * \n *   cpdef string type(self):             # <<<<<<<<<<<<<<\n *     \"\"\"type(self)\n * \n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_6Weight_23type(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic std::string __pyx_f_9pywrapfst_6Weight_type(struct __pyx_obj_9pywrapfst_Weight *__pyx_v_self, int __pyx_skip_dispatch) {\n  std::string __pyx_r;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  std::string __pyx_t_5;\n  __Pyx_RefNannySetupContext(\"type\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_type); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 441, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_6Weight_23type)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 441, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 441, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __pyx_t_5 = __pyx_convert_string_from_py_std__in_string(__pyx_t_2); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 441, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __pyx_r = __pyx_t_5;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":446\n *     Returns a string indicating the weight type.\n *     \"\"\"\n *     return self._weight.get().Type()             # <<<<<<<<<<<<<<\n * \n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_weight\");\n    __PYX_ERR(0, 446, __pyx_L1_error)\n  }\n  __pyx_r = __pyx_v_self->_weight.get()->Type();\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":441\n *     return self._weight.get().ToString()\n * \n *   cpdef string type(self):             # <<<<<<<<<<<<<<\n *     \"\"\"type(self)\n * \n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_WriteUnraisable(\"pywrapfst.Weight.type\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __Pyx_pretend_to_initialize(&__pyx_r);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_6Weight_23type(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_6Weight_22type[] = \"type(self)\\n\\n    Returns a string indicating the weight type.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_6Weight_23type(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"type (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_6Weight_22type(((struct __pyx_obj_9pywrapfst_Weight *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_6Weight_22type(struct __pyx_obj_9pywrapfst_Weight *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"type\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __pyx_convert_PyBytes_string_to_py_std__in_string(__pyx_f_9pywrapfst_6Weight_type(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 441, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.Weight.type\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"(tree fragment)\":1\n * def __reduce_cython__(self):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._weight cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_6Weight_25__reduce_cython__(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_6Weight_25__reduce_cython__(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__reduce_cython__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_6Weight_24__reduce_cython__(((struct __pyx_obj_9pywrapfst_Weight *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_6Weight_24__reduce_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst_Weight *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"__reduce_cython__\", 0);\n\n  /* \"(tree fragment)\":2\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._weight cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._weight cannot be converted to a Python object for pickling\")\n */\n  __pyx_t_1 = __Pyx_PyObject_Call(__pyx_builtin_TypeError, __pyx_tuple__3, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(1, 2, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __Pyx_Raise(__pyx_t_1, 0, 0, 0);\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  __PYX_ERR(1, 2, __pyx_L1_error)\n\n  /* \"(tree fragment)\":1\n * def __reduce_cython__(self):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._weight cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.Weight.__reduce_cython__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"(tree fragment)\":3\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._weight cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._weight cannot be converted to a Python object for pickling\")\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_6Weight_27__setstate_cython__(PyObject *__pyx_v_self, PyObject *__pyx_v___pyx_state); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_6Weight_27__setstate_cython__(PyObject *__pyx_v_self, PyObject *__pyx_v___pyx_state) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__setstate_cython__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_6Weight_26__setstate_cython__(((struct __pyx_obj_9pywrapfst_Weight *)__pyx_v_self), ((PyObject *)__pyx_v___pyx_state));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_6Weight_26__setstate_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst_Weight *__pyx_v_self, CYTHON_UNUSED PyObject *__pyx_v___pyx_state) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"__setstate_cython__\", 0);\n\n  /* \"(tree fragment)\":4\n *     raise TypeError(\"self._weight cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._weight cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n */\n  __pyx_t_1 = __Pyx_PyObject_Call(__pyx_builtin_TypeError, __pyx_tuple__4, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(1, 4, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __Pyx_Raise(__pyx_t_1, 0, 0, 0);\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  __PYX_ERR(1, 4, __pyx_L1_error)\n\n  /* \"(tree fragment)\":3\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._weight cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._weight cannot be converted to a Python object for pickling\")\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.Weight.__setstate_cython__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":449\n * \n * \n * cdef Weight _plus(Weight lhs, Weight rhs):             # <<<<<<<<<<<<<<\n *   cdef Weight result = Weight.__new__(Weight)\n *   result._weight.reset(new fst.WeightClass(fst.Plus(deref(lhs._weight),\n */\n\nstatic struct __pyx_obj_9pywrapfst_Weight *__pyx_f_9pywrapfst__plus(struct __pyx_obj_9pywrapfst_Weight *__pyx_v_lhs, struct __pyx_obj_9pywrapfst_Weight *__pyx_v_rhs) {\n  struct __pyx_obj_9pywrapfst_Weight *__pyx_v_result = 0;\n  struct __pyx_obj_9pywrapfst_Weight *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"_plus\", 0);\n\n  /* \"pywrapfst.pyx\":450\n * \n * cdef Weight _plus(Weight lhs, Weight rhs):\n *   cdef Weight result = Weight.__new__(Weight)             # <<<<<<<<<<<<<<\n *   result._weight.reset(new fst.WeightClass(fst.Plus(deref(lhs._weight),\n *                                                     deref(rhs._weight))))\n */\n  __pyx_t_1 = __pyx_tp_new_9pywrapfst_Weight(((PyTypeObject *)__pyx_ptype_9pywrapfst_Weight), __pyx_empty_tuple, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 450, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (!(likely(__Pyx_TypeTest(__pyx_t_1, __pyx_ptype_9pywrapfst_Weight)))) __PYX_ERR(0, 450, __pyx_L1_error)\n  __pyx_v_result = ((struct __pyx_obj_9pywrapfst_Weight *)__pyx_t_1);\n  __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":451\n * cdef Weight _plus(Weight lhs, Weight rhs):\n *   cdef Weight result = Weight.__new__(Weight)\n *   result._weight.reset(new fst.WeightClass(fst.Plus(deref(lhs._weight),             # <<<<<<<<<<<<<<\n *                                                     deref(rhs._weight))))\n *   return result\n */\n  if (unlikely(((PyObject *)__pyx_v_result) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_weight\");\n    __PYX_ERR(0, 451, __pyx_L1_error)\n  }\n  if (unlikely(((PyObject *)__pyx_v_lhs) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_weight\");\n    __PYX_ERR(0, 451, __pyx_L1_error)\n  }\n\n  /* \"pywrapfst.pyx\":452\n *   cdef Weight result = Weight.__new__(Weight)\n *   result._weight.reset(new fst.WeightClass(fst.Plus(deref(lhs._weight),\n *                                                     deref(rhs._weight))))             # <<<<<<<<<<<<<<\n *   return result\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_rhs) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_weight\");\n    __PYX_ERR(0, 452, __pyx_L1_error)\n  }\n\n  /* \"pywrapfst.pyx\":451\n * cdef Weight _plus(Weight lhs, Weight rhs):\n *   cdef Weight result = Weight.__new__(Weight)\n *   result._weight.reset(new fst.WeightClass(fst.Plus(deref(lhs._weight),             # <<<<<<<<<<<<<<\n *                                                     deref(rhs._weight))))\n *   return result\n */\n  __pyx_v_result->_weight.reset(new fst::script::WeightClass(fst::script::Plus((*__pyx_v_lhs->_weight), (*__pyx_v_rhs->_weight))));\n\n  /* \"pywrapfst.pyx\":453\n *   result._weight.reset(new fst.WeightClass(fst.Plus(deref(lhs._weight),\n *                                                     deref(rhs._weight))))\n *   return result             # <<<<<<<<<<<<<<\n * \n * \n */\n  __Pyx_XDECREF(((PyObject *)__pyx_r));\n  __Pyx_INCREF(((PyObject *)__pyx_v_result));\n  __pyx_r = __pyx_v_result;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":449\n * \n * \n * cdef Weight _plus(Weight lhs, Weight rhs):             # <<<<<<<<<<<<<<\n *   cdef Weight result = Weight.__new__(Weight)\n *   result._weight.reset(new fst.WeightClass(fst.Plus(deref(lhs._weight),\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst._plus\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XDECREF((PyObject *)__pyx_v_result);\n  __Pyx_XGIVEREF((PyObject *)__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":456\n * \n * \n * def plus(Weight lhs, Weight rhs):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   plus(lhs, rhs)\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_1plus(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic char __pyx_doc_9pywrapfst_plus[] = \"\\n  plus(lhs, rhs)\\n\\n  Computes the sum of two Weights in the same semiring.\\n\\n  This function computes lhs \\\\oplus rhs, raising an exception if lhs and rhs\\n  are not in the same semiring.\\n\\n  Args:\\n     lhs: Left-hand side Weight.\\n     rhs: Right-hand side Weight.\\n\\n  Returns:\\n    A Weight object.\\n\\n  Raises:\\n    FstArgError: Weight type not found (or not in same semiring).\\n    FstBadWeightError: invalid weight.\\n  \";\nstatic PyMethodDef __pyx_mdef_9pywrapfst_1plus = {\"plus\", (PyCFunction)__pyx_pw_9pywrapfst_1plus, METH_VARARGS|METH_KEYWORDS, __pyx_doc_9pywrapfst_plus};\nstatic PyObject *__pyx_pw_9pywrapfst_1plus(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  struct __pyx_obj_9pywrapfst_Weight *__pyx_v_lhs = 0;\n  struct __pyx_obj_9pywrapfst_Weight *__pyx_v_rhs = 0;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"plus (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_lhs,&__pyx_n_s_rhs,0};\n    PyObject* values[2] = {0,0};\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (likely((values[0] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_lhs)) != 0)) kw_args--;\n        else goto __pyx_L5_argtuple_error;\n        CYTHON_FALLTHROUGH;\n        case  1:\n        if (likely((values[1] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_rhs)) != 0)) kw_args--;\n        else {\n          __Pyx_RaiseArgtupleInvalid(\"plus\", 1, 2, 2, 1); __PYX_ERR(0, 456, __pyx_L3_error)\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"plus\") < 0)) __PYX_ERR(0, 456, __pyx_L3_error)\n      }\n    } else if (PyTuple_GET_SIZE(__pyx_args) != 2) {\n      goto __pyx_L5_argtuple_error;\n    } else {\n      values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n      values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n    }\n    __pyx_v_lhs = ((struct __pyx_obj_9pywrapfst_Weight *)values[0]);\n    __pyx_v_rhs = ((struct __pyx_obj_9pywrapfst_Weight *)values[1]);\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"plus\", 1, 2, 2, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 456, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst.plus\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_lhs), __pyx_ptype_9pywrapfst_Weight, 1, \"lhs\", 0))) __PYX_ERR(0, 456, __pyx_L1_error)\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_rhs), __pyx_ptype_9pywrapfst_Weight, 1, \"rhs\", 0))) __PYX_ERR(0, 456, __pyx_L1_error)\n  __pyx_r = __pyx_pf_9pywrapfst_plus(__pyx_self, __pyx_v_lhs, __pyx_v_rhs);\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_plus(CYTHON_UNUSED PyObject *__pyx_self, struct __pyx_obj_9pywrapfst_Weight *__pyx_v_lhs, struct __pyx_obj_9pywrapfst_Weight *__pyx_v_rhs) {\n  struct __pyx_obj_9pywrapfst_Weight *__pyx_v_result = 0;\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"plus\", 0);\n\n  /* \"pywrapfst.pyx\":476\n *     FstBadWeightError: invalid weight.\n *   \"\"\"\n *   cdef Weight result = _plus(lhs, rhs)             # <<<<<<<<<<<<<<\n *   result._check_weight()\n *   return result\n */\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst__plus(__pyx_v_lhs, __pyx_v_rhs)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 476, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_v_result = ((struct __pyx_obj_9pywrapfst_Weight *)__pyx_t_1);\n  __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":477\n *   \"\"\"\n *   cdef Weight result = _plus(lhs, rhs)\n *   result._check_weight()             # <<<<<<<<<<<<<<\n *   return result\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_result) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_check_weight\");\n    __PYX_ERR(0, 477, __pyx_L1_error)\n  }\n  ((struct __pyx_vtabstruct_9pywrapfst_Weight *)__pyx_v_result->__pyx_vtab)->_check_weight(__pyx_v_result); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 477, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":478\n *   cdef Weight result = _plus(lhs, rhs)\n *   result._check_weight()\n *   return result             # <<<<<<<<<<<<<<\n * \n * \n */\n  __Pyx_XDECREF(__pyx_r);\n  __Pyx_INCREF(((PyObject *)__pyx_v_result));\n  __pyx_r = ((PyObject *)__pyx_v_result);\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":456\n * \n * \n * def plus(Weight lhs, Weight rhs):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   plus(lhs, rhs)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.plus\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XDECREF((PyObject *)__pyx_v_result);\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":481\n * \n * \n * cdef Weight _times(Weight lhs, Weight rhs):             # <<<<<<<<<<<<<<\n *   cdef Weight result = Weight.__new__(Weight)\n *   result._weight.reset(new fst.WeightClass(fst.Times(deref(lhs._weight),\n */\n\nstatic struct __pyx_obj_9pywrapfst_Weight *__pyx_f_9pywrapfst__times(struct __pyx_obj_9pywrapfst_Weight *__pyx_v_lhs, struct __pyx_obj_9pywrapfst_Weight *__pyx_v_rhs) {\n  struct __pyx_obj_9pywrapfst_Weight *__pyx_v_result = 0;\n  struct __pyx_obj_9pywrapfst_Weight *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"_times\", 0);\n\n  /* \"pywrapfst.pyx\":482\n * \n * cdef Weight _times(Weight lhs, Weight rhs):\n *   cdef Weight result = Weight.__new__(Weight)             # <<<<<<<<<<<<<<\n *   result._weight.reset(new fst.WeightClass(fst.Times(deref(lhs._weight),\n *                                                      deref(rhs._weight))))\n */\n  __pyx_t_1 = __pyx_tp_new_9pywrapfst_Weight(((PyTypeObject *)__pyx_ptype_9pywrapfst_Weight), __pyx_empty_tuple, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 482, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (!(likely(__Pyx_TypeTest(__pyx_t_1, __pyx_ptype_9pywrapfst_Weight)))) __PYX_ERR(0, 482, __pyx_L1_error)\n  __pyx_v_result = ((struct __pyx_obj_9pywrapfst_Weight *)__pyx_t_1);\n  __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":483\n * cdef Weight _times(Weight lhs, Weight rhs):\n *   cdef Weight result = Weight.__new__(Weight)\n *   result._weight.reset(new fst.WeightClass(fst.Times(deref(lhs._weight),             # <<<<<<<<<<<<<<\n *                                                      deref(rhs._weight))))\n *   return result\n */\n  if (unlikely(((PyObject *)__pyx_v_result) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_weight\");\n    __PYX_ERR(0, 483, __pyx_L1_error)\n  }\n  if (unlikely(((PyObject *)__pyx_v_lhs) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_weight\");\n    __PYX_ERR(0, 483, __pyx_L1_error)\n  }\n\n  /* \"pywrapfst.pyx\":484\n *   cdef Weight result = Weight.__new__(Weight)\n *   result._weight.reset(new fst.WeightClass(fst.Times(deref(lhs._weight),\n *                                                      deref(rhs._weight))))             # <<<<<<<<<<<<<<\n *   return result\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_rhs) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_weight\");\n    __PYX_ERR(0, 484, __pyx_L1_error)\n  }\n\n  /* \"pywrapfst.pyx\":483\n * cdef Weight _times(Weight lhs, Weight rhs):\n *   cdef Weight result = Weight.__new__(Weight)\n *   result._weight.reset(new fst.WeightClass(fst.Times(deref(lhs._weight),             # <<<<<<<<<<<<<<\n *                                                      deref(rhs._weight))))\n *   return result\n */\n  __pyx_v_result->_weight.reset(new fst::script::WeightClass(fst::script::Times((*__pyx_v_lhs->_weight), (*__pyx_v_rhs->_weight))));\n\n  /* \"pywrapfst.pyx\":485\n *   result._weight.reset(new fst.WeightClass(fst.Times(deref(lhs._weight),\n *                                                      deref(rhs._weight))))\n *   return result             # <<<<<<<<<<<<<<\n * \n * \n */\n  __Pyx_XDECREF(((PyObject *)__pyx_r));\n  __Pyx_INCREF(((PyObject *)__pyx_v_result));\n  __pyx_r = __pyx_v_result;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":481\n * \n * \n * cdef Weight _times(Weight lhs, Weight rhs):             # <<<<<<<<<<<<<<\n *   cdef Weight result = Weight.__new__(Weight)\n *   result._weight.reset(new fst.WeightClass(fst.Times(deref(lhs._weight),\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst._times\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XDECREF((PyObject *)__pyx_v_result);\n  __Pyx_XGIVEREF((PyObject *)__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":488\n * \n * \n * def times(Weight lhs, Weight rhs):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   times(lhs, rhs)\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_3times(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic char __pyx_doc_9pywrapfst_2times[] = \"\\n  times(lhs, rhs)\\n\\n  Computes the product of two Weights in the same semiring.\\n\\n  This function computes lhs \\\\otimes rhs, raising an exception if lhs and rhs\\n  are not in the same semiring.\\n\\n  Args:\\n     lhs: Left-hand side Weight.\\n     rhs: Right-hand side Weight.\\n\\n  Returns:\\n    A Weight object.\\n\\n  Raises:\\n    FstArgError: Weight type not found (or not in same semiring).\\n    FstBadWeightError: Invalid weight.\\n  \";\nstatic PyMethodDef __pyx_mdef_9pywrapfst_3times = {\"times\", (PyCFunction)__pyx_pw_9pywrapfst_3times, METH_VARARGS|METH_KEYWORDS, __pyx_doc_9pywrapfst_2times};\nstatic PyObject *__pyx_pw_9pywrapfst_3times(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  struct __pyx_obj_9pywrapfst_Weight *__pyx_v_lhs = 0;\n  struct __pyx_obj_9pywrapfst_Weight *__pyx_v_rhs = 0;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"times (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_lhs,&__pyx_n_s_rhs,0};\n    PyObject* values[2] = {0,0};\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (likely((values[0] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_lhs)) != 0)) kw_args--;\n        else goto __pyx_L5_argtuple_error;\n        CYTHON_FALLTHROUGH;\n        case  1:\n        if (likely((values[1] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_rhs)) != 0)) kw_args--;\n        else {\n          __Pyx_RaiseArgtupleInvalid(\"times\", 1, 2, 2, 1); __PYX_ERR(0, 488, __pyx_L3_error)\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"times\") < 0)) __PYX_ERR(0, 488, __pyx_L3_error)\n      }\n    } else if (PyTuple_GET_SIZE(__pyx_args) != 2) {\n      goto __pyx_L5_argtuple_error;\n    } else {\n      values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n      values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n    }\n    __pyx_v_lhs = ((struct __pyx_obj_9pywrapfst_Weight *)values[0]);\n    __pyx_v_rhs = ((struct __pyx_obj_9pywrapfst_Weight *)values[1]);\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"times\", 1, 2, 2, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 488, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst.times\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_lhs), __pyx_ptype_9pywrapfst_Weight, 1, \"lhs\", 0))) __PYX_ERR(0, 488, __pyx_L1_error)\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_rhs), __pyx_ptype_9pywrapfst_Weight, 1, \"rhs\", 0))) __PYX_ERR(0, 488, __pyx_L1_error)\n  __pyx_r = __pyx_pf_9pywrapfst_2times(__pyx_self, __pyx_v_lhs, __pyx_v_rhs);\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_2times(CYTHON_UNUSED PyObject *__pyx_self, struct __pyx_obj_9pywrapfst_Weight *__pyx_v_lhs, struct __pyx_obj_9pywrapfst_Weight *__pyx_v_rhs) {\n  struct __pyx_obj_9pywrapfst_Weight *__pyx_v_result = 0;\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"times\", 0);\n\n  /* \"pywrapfst.pyx\":508\n *     FstBadWeightError: Invalid weight.\n *   \"\"\"\n *   cdef Weight result = _times(lhs, rhs)             # <<<<<<<<<<<<<<\n *   result._check_weight()\n *   return result\n */\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst__times(__pyx_v_lhs, __pyx_v_rhs)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 508, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_v_result = ((struct __pyx_obj_9pywrapfst_Weight *)__pyx_t_1);\n  __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":509\n *   \"\"\"\n *   cdef Weight result = _times(lhs, rhs)\n *   result._check_weight()             # <<<<<<<<<<<<<<\n *   return result\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_result) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_check_weight\");\n    __PYX_ERR(0, 509, __pyx_L1_error)\n  }\n  ((struct __pyx_vtabstruct_9pywrapfst_Weight *)__pyx_v_result->__pyx_vtab)->_check_weight(__pyx_v_result); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 509, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":510\n *   cdef Weight result = _times(lhs, rhs)\n *   result._check_weight()\n *   return result             # <<<<<<<<<<<<<<\n * \n * \n */\n  __Pyx_XDECREF(__pyx_r);\n  __Pyx_INCREF(((PyObject *)__pyx_v_result));\n  __pyx_r = ((PyObject *)__pyx_v_result);\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":488\n * \n * \n * def times(Weight lhs, Weight rhs):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   times(lhs, rhs)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.times\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XDECREF((PyObject *)__pyx_v_result);\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":513\n * \n * \n * cdef Weight _divide(Weight lhs, Weight rhs):             # <<<<<<<<<<<<<<\n *   cdef Weight result = Weight.__new__(Weight)\n *   result._weight.reset(new fst.WeightClass(fst.Divide(deref(lhs._weight),\n */\n\nstatic struct __pyx_obj_9pywrapfst_Weight *__pyx_f_9pywrapfst__divide(struct __pyx_obj_9pywrapfst_Weight *__pyx_v_lhs, struct __pyx_obj_9pywrapfst_Weight *__pyx_v_rhs) {\n  struct __pyx_obj_9pywrapfst_Weight *__pyx_v_result = 0;\n  struct __pyx_obj_9pywrapfst_Weight *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"_divide\", 0);\n\n  /* \"pywrapfst.pyx\":514\n * \n * cdef Weight _divide(Weight lhs, Weight rhs):\n *   cdef Weight result = Weight.__new__(Weight)             # <<<<<<<<<<<<<<\n *   result._weight.reset(new fst.WeightClass(fst.Divide(deref(lhs._weight),\n *                                                       deref(rhs._weight))))\n */\n  __pyx_t_1 = __pyx_tp_new_9pywrapfst_Weight(((PyTypeObject *)__pyx_ptype_9pywrapfst_Weight), __pyx_empty_tuple, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 514, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (!(likely(__Pyx_TypeTest(__pyx_t_1, __pyx_ptype_9pywrapfst_Weight)))) __PYX_ERR(0, 514, __pyx_L1_error)\n  __pyx_v_result = ((struct __pyx_obj_9pywrapfst_Weight *)__pyx_t_1);\n  __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":515\n * cdef Weight _divide(Weight lhs, Weight rhs):\n *   cdef Weight result = Weight.__new__(Weight)\n *   result._weight.reset(new fst.WeightClass(fst.Divide(deref(lhs._weight),             # <<<<<<<<<<<<<<\n *                                                       deref(rhs._weight))))\n *   return result\n */\n  if (unlikely(((PyObject *)__pyx_v_result) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_weight\");\n    __PYX_ERR(0, 515, __pyx_L1_error)\n  }\n  if (unlikely(((PyObject *)__pyx_v_lhs) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_weight\");\n    __PYX_ERR(0, 515, __pyx_L1_error)\n  }\n\n  /* \"pywrapfst.pyx\":516\n *   cdef Weight result = Weight.__new__(Weight)\n *   result._weight.reset(new fst.WeightClass(fst.Divide(deref(lhs._weight),\n *                                                       deref(rhs._weight))))             # <<<<<<<<<<<<<<\n *   return result\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_rhs) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_weight\");\n    __PYX_ERR(0, 516, __pyx_L1_error)\n  }\n\n  /* \"pywrapfst.pyx\":515\n * cdef Weight _divide(Weight lhs, Weight rhs):\n *   cdef Weight result = Weight.__new__(Weight)\n *   result._weight.reset(new fst.WeightClass(fst.Divide(deref(lhs._weight),             # <<<<<<<<<<<<<<\n *                                                       deref(rhs._weight))))\n *   return result\n */\n  __pyx_v_result->_weight.reset(new fst::script::WeightClass(fst::script::Divide((*__pyx_v_lhs->_weight), (*__pyx_v_rhs->_weight))));\n\n  /* \"pywrapfst.pyx\":517\n *   result._weight.reset(new fst.WeightClass(fst.Divide(deref(lhs._weight),\n *                                                       deref(rhs._weight))))\n *   return result             # <<<<<<<<<<<<<<\n * \n * \n */\n  __Pyx_XDECREF(((PyObject *)__pyx_r));\n  __Pyx_INCREF(((PyObject *)__pyx_v_result));\n  __pyx_r = __pyx_v_result;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":513\n * \n * \n * cdef Weight _divide(Weight lhs, Weight rhs):             # <<<<<<<<<<<<<<\n *   cdef Weight result = Weight.__new__(Weight)\n *   result._weight.reset(new fst.WeightClass(fst.Divide(deref(lhs._weight),\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst._divide\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XDECREF((PyObject *)__pyx_v_result);\n  __Pyx_XGIVEREF((PyObject *)__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":520\n * \n * \n * def divide(Weight lhs, Weight rhs):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   divide(lhs, rhs)\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_5divide(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic char __pyx_doc_9pywrapfst_4divide[] = \"\\n  divide(lhs, rhs)\\n\\n  Computes the quotient of two Weights in the same semiring.\\n\\n  This function computes lhs \\\\oslash rhs, raising an exception if lhs and rhs\\n  are not in the same semiring. As there is no way to specify whether to use\\n  left vs. right division, this assumes a commutative semiring in which these\\n  are equivalent operations.\\n\\n  Args:\\n     lhs: Left-hand side Weight.\\n     rhs: Right-hand side Weight.\\n\\n  Returns:\\n    A Weight object.\\n\\n  Raises:\\n    FstArgError: Weight type not found (or not in same semiring).\\n    FstBadWeightError: Invalid weight.\\n  \";\nstatic PyMethodDef __pyx_mdef_9pywrapfst_5divide = {\"divide\", (PyCFunction)__pyx_pw_9pywrapfst_5divide, METH_VARARGS|METH_KEYWORDS, __pyx_doc_9pywrapfst_4divide};\nstatic PyObject *__pyx_pw_9pywrapfst_5divide(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  struct __pyx_obj_9pywrapfst_Weight *__pyx_v_lhs = 0;\n  struct __pyx_obj_9pywrapfst_Weight *__pyx_v_rhs = 0;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"divide (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_lhs,&__pyx_n_s_rhs,0};\n    PyObject* values[2] = {0,0};\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (likely((values[0] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_lhs)) != 0)) kw_args--;\n        else goto __pyx_L5_argtuple_error;\n        CYTHON_FALLTHROUGH;\n        case  1:\n        if (likely((values[1] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_rhs)) != 0)) kw_args--;\n        else {\n          __Pyx_RaiseArgtupleInvalid(\"divide\", 1, 2, 2, 1); __PYX_ERR(0, 520, __pyx_L3_error)\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"divide\") < 0)) __PYX_ERR(0, 520, __pyx_L3_error)\n      }\n    } else if (PyTuple_GET_SIZE(__pyx_args) != 2) {\n      goto __pyx_L5_argtuple_error;\n    } else {\n      values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n      values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n    }\n    __pyx_v_lhs = ((struct __pyx_obj_9pywrapfst_Weight *)values[0]);\n    __pyx_v_rhs = ((struct __pyx_obj_9pywrapfst_Weight *)values[1]);\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"divide\", 1, 2, 2, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 520, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst.divide\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_lhs), __pyx_ptype_9pywrapfst_Weight, 1, \"lhs\", 0))) __PYX_ERR(0, 520, __pyx_L1_error)\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_rhs), __pyx_ptype_9pywrapfst_Weight, 1, \"rhs\", 0))) __PYX_ERR(0, 520, __pyx_L1_error)\n  __pyx_r = __pyx_pf_9pywrapfst_4divide(__pyx_self, __pyx_v_lhs, __pyx_v_rhs);\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_4divide(CYTHON_UNUSED PyObject *__pyx_self, struct __pyx_obj_9pywrapfst_Weight *__pyx_v_lhs, struct __pyx_obj_9pywrapfst_Weight *__pyx_v_rhs) {\n  struct __pyx_obj_9pywrapfst_Weight *__pyx_v_result = 0;\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"divide\", 0);\n\n  /* \"pywrapfst.pyx\":542\n *     FstBadWeightError: Invalid weight.\n *   \"\"\"\n *   cdef Weight result = _divide(lhs, rhs)             # <<<<<<<<<<<<<<\n *   result._check_weight()\n *   return result\n */\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst__divide(__pyx_v_lhs, __pyx_v_rhs)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 542, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_v_result = ((struct __pyx_obj_9pywrapfst_Weight *)__pyx_t_1);\n  __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":543\n *   \"\"\"\n *   cdef Weight result = _divide(lhs, rhs)\n *   result._check_weight()             # <<<<<<<<<<<<<<\n *   return result\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_result) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_check_weight\");\n    __PYX_ERR(0, 543, __pyx_L1_error)\n  }\n  ((struct __pyx_vtabstruct_9pywrapfst_Weight *)__pyx_v_result->__pyx_vtab)->_check_weight(__pyx_v_result); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 543, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":544\n *   cdef Weight result = _divide(lhs, rhs)\n *   result._check_weight()\n *   return result             # <<<<<<<<<<<<<<\n * \n * \n */\n  __Pyx_XDECREF(__pyx_r);\n  __Pyx_INCREF(((PyObject *)__pyx_v_result));\n  __pyx_r = ((PyObject *)__pyx_v_result);\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":520\n * \n * \n * def divide(Weight lhs, Weight rhs):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   divide(lhs, rhs)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.divide\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XDECREF((PyObject *)__pyx_v_result);\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":547\n * \n * \n * cdef Weight _power(Weight w, size_t n):             # <<<<<<<<<<<<<<\n *   cdef Weight result = Weight.__new__(Weight)\n *   result._weight.reset(new fst.WeightClass(fst.Power(deref(w._weight), n)))\n */\n\nstatic struct __pyx_obj_9pywrapfst_Weight *__pyx_f_9pywrapfst__power(struct __pyx_obj_9pywrapfst_Weight *__pyx_v_w, size_t __pyx_v_n) {\n  struct __pyx_obj_9pywrapfst_Weight *__pyx_v_result = 0;\n  struct __pyx_obj_9pywrapfst_Weight *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"_power\", 0);\n\n  /* \"pywrapfst.pyx\":548\n * \n * cdef Weight _power(Weight w, size_t n):\n *   cdef Weight result = Weight.__new__(Weight)             # <<<<<<<<<<<<<<\n *   result._weight.reset(new fst.WeightClass(fst.Power(deref(w._weight), n)))\n *   return result\n */\n  __pyx_t_1 = __pyx_tp_new_9pywrapfst_Weight(((PyTypeObject *)__pyx_ptype_9pywrapfst_Weight), __pyx_empty_tuple, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 548, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (!(likely(__Pyx_TypeTest(__pyx_t_1, __pyx_ptype_9pywrapfst_Weight)))) __PYX_ERR(0, 548, __pyx_L1_error)\n  __pyx_v_result = ((struct __pyx_obj_9pywrapfst_Weight *)__pyx_t_1);\n  __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":549\n * cdef Weight _power(Weight w, size_t n):\n *   cdef Weight result = Weight.__new__(Weight)\n *   result._weight.reset(new fst.WeightClass(fst.Power(deref(w._weight), n)))             # <<<<<<<<<<<<<<\n *   return result\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_result) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_weight\");\n    __PYX_ERR(0, 549, __pyx_L1_error)\n  }\n  if (unlikely(((PyObject *)__pyx_v_w) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_weight\");\n    __PYX_ERR(0, 549, __pyx_L1_error)\n  }\n  __pyx_v_result->_weight.reset(new fst::script::WeightClass(fst::script::Power((*__pyx_v_w->_weight), __pyx_v_n)));\n\n  /* \"pywrapfst.pyx\":550\n *   cdef Weight result = Weight.__new__(Weight)\n *   result._weight.reset(new fst.WeightClass(fst.Power(deref(w._weight), n)))\n *   return result             # <<<<<<<<<<<<<<\n * \n * \n */\n  __Pyx_XDECREF(((PyObject *)__pyx_r));\n  __Pyx_INCREF(((PyObject *)__pyx_v_result));\n  __pyx_r = __pyx_v_result;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":547\n * \n * \n * cdef Weight _power(Weight w, size_t n):             # <<<<<<<<<<<<<<\n *   cdef Weight result = Weight.__new__(Weight)\n *   result._weight.reset(new fst.WeightClass(fst.Power(deref(w._weight), n)))\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst._power\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XDECREF((PyObject *)__pyx_v_result);\n  __Pyx_XGIVEREF((PyObject *)__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":553\n * \n * \n * def power(Weight w, size_t n):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   power(lhs, rhs)\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_7power(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic char __pyx_doc_9pywrapfst_6power[] = \"\\n  power(lhs, rhs)\\n\\n  Computes the iterated product of a weight.\\n\\n  Args:\\n     w: The weight.\\n     n: The power.\\n\\n  Returns:\\n    A Weight object.\\n\\n  Raises:\\n    FstArgError: Weight type not found (or not in same semiring).\\n    FstBadWeightError: Invalid weight.\\n  \";\nstatic PyMethodDef __pyx_mdef_9pywrapfst_7power = {\"power\", (PyCFunction)__pyx_pw_9pywrapfst_7power, METH_VARARGS|METH_KEYWORDS, __pyx_doc_9pywrapfst_6power};\nstatic PyObject *__pyx_pw_9pywrapfst_7power(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  struct __pyx_obj_9pywrapfst_Weight *__pyx_v_w = 0;\n  size_t __pyx_v_n;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"power (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_w,&__pyx_n_s_n,0};\n    PyObject* values[2] = {0,0};\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (likely((values[0] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_w)) != 0)) kw_args--;\n        else goto __pyx_L5_argtuple_error;\n        CYTHON_FALLTHROUGH;\n        case  1:\n        if (likely((values[1] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_n)) != 0)) kw_args--;\n        else {\n          __Pyx_RaiseArgtupleInvalid(\"power\", 1, 2, 2, 1); __PYX_ERR(0, 553, __pyx_L3_error)\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"power\") < 0)) __PYX_ERR(0, 553, __pyx_L3_error)\n      }\n    } else if (PyTuple_GET_SIZE(__pyx_args) != 2) {\n      goto __pyx_L5_argtuple_error;\n    } else {\n      values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n      values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n    }\n    __pyx_v_w = ((struct __pyx_obj_9pywrapfst_Weight *)values[0]);\n    __pyx_v_n = __Pyx_PyInt_As_size_t(values[1]); if (unlikely((__pyx_v_n == (size_t)-1) && PyErr_Occurred())) __PYX_ERR(0, 553, __pyx_L3_error)\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"power\", 1, 2, 2, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 553, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst.power\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_w), __pyx_ptype_9pywrapfst_Weight, 1, \"w\", 0))) __PYX_ERR(0, 553, __pyx_L1_error)\n  __pyx_r = __pyx_pf_9pywrapfst_6power(__pyx_self, __pyx_v_w, __pyx_v_n);\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_6power(CYTHON_UNUSED PyObject *__pyx_self, struct __pyx_obj_9pywrapfst_Weight *__pyx_v_w, size_t __pyx_v_n) {\n  struct __pyx_obj_9pywrapfst_Weight *__pyx_v_result = 0;\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"power\", 0);\n\n  /* \"pywrapfst.pyx\":570\n *     FstBadWeightError: Invalid weight.\n *   \"\"\"\n *   cdef Weight result = _power(w, n)             # <<<<<<<<<<<<<<\n *   result._check_weight()\n *   return result\n */\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst__power(__pyx_v_w, __pyx_v_n)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 570, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_v_result = ((struct __pyx_obj_9pywrapfst_Weight *)__pyx_t_1);\n  __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":571\n *   \"\"\"\n *   cdef Weight result = _power(w, n)\n *   result._check_weight()             # <<<<<<<<<<<<<<\n *   return result\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_result) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_check_weight\");\n    __PYX_ERR(0, 571, __pyx_L1_error)\n  }\n  ((struct __pyx_vtabstruct_9pywrapfst_Weight *)__pyx_v_result->__pyx_vtab)->_check_weight(__pyx_v_result); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 571, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":572\n *   cdef Weight result = _power(w, n)\n *   result._check_weight()\n *   return result             # <<<<<<<<<<<<<<\n * \n * \n */\n  __Pyx_XDECREF(__pyx_r);\n  __Pyx_INCREF(((PyObject *)__pyx_v_result));\n  __pyx_r = ((PyObject *)__pyx_v_result);\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":553\n * \n * \n * def power(Weight w, size_t n):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   power(lhs, rhs)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.power\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XDECREF((PyObject *)__pyx_v_result);\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":575\n * \n * \n * cdef fst.WeightClass _get_WeightClass_or_Zero(const string &weight_type,             # <<<<<<<<<<<<<<\n *                                               weight) except *:\n *   \"\"\"Converts weight string to a WeightClass.\n */\n\nstatic fst::script::WeightClass __pyx_f_9pywrapfst__get_WeightClass_or_Zero(std::string const &__pyx_v_weight_type, PyObject *__pyx_v_weight) {\n  fst::script::WeightClass __pyx_v_result;\n  fst::script::WeightClass __pyx_r;\n  __Pyx_RefNannyDeclarations\n  int __pyx_t_1;\n  int __pyx_t_2;\n  std::string __pyx_t_3;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  PyObject *__pyx_t_6 = NULL;\n  PyObject *__pyx_t_7 = NULL;\n  PyObject *__pyx_t_8 = NULL;\n  __Pyx_RefNannySetupContext(\"_get_WeightClass_or_Zero\", 0);\n\n  /* \"pywrapfst.pyx\":593\n *   \"\"\"\n *   cdef fst.WeightClass result\n *   if weight is None:             # <<<<<<<<<<<<<<\n *     result = fst.WeightClass.Zero(weight_type)\n *   elif isinstance(weight, Weight):\n */\n  __pyx_t_1 = (__pyx_v_weight == Py_None);\n  __pyx_t_2 = (__pyx_t_1 != 0);\n  if (__pyx_t_2) {\n\n    /* \"pywrapfst.pyx\":594\n *   cdef fst.WeightClass result\n *   if weight is None:\n *     result = fst.WeightClass.Zero(weight_type)             # <<<<<<<<<<<<<<\n *   elif isinstance(weight, Weight):\n *     result = deref(<fst.WeightClass *> (<Weight> weight)._weight.get())\n */\n    __pyx_v_result = fst::script::WeightClass::Zero(__pyx_v_weight_type);\n\n    /* \"pywrapfst.pyx\":593\n *   \"\"\"\n *   cdef fst.WeightClass result\n *   if weight is None:             # <<<<<<<<<<<<<<\n *     result = fst.WeightClass.Zero(weight_type)\n *   elif isinstance(weight, Weight):\n */\n    goto __pyx_L3;\n  }\n\n  /* \"pywrapfst.pyx\":595\n *   if weight is None:\n *     result = fst.WeightClass.Zero(weight_type)\n *   elif isinstance(weight, Weight):             # <<<<<<<<<<<<<<\n *     result = deref(<fst.WeightClass *> (<Weight> weight)._weight.get())\n *   else:\n */\n  __pyx_t_2 = __Pyx_TypeCheck(__pyx_v_weight, __pyx_ptype_9pywrapfst_Weight); \n  __pyx_t_1 = (__pyx_t_2 != 0);\n  if (__pyx_t_1) {\n\n    /* \"pywrapfst.pyx\":596\n *     result = fst.WeightClass.Zero(weight_type)\n *   elif isinstance(weight, Weight):\n *     result = deref(<fst.WeightClass *> (<Weight> weight)._weight.get())             # <<<<<<<<<<<<<<\n *   else:\n *     result = fst.WeightClass(weight_type, weight_tostring(weight))\n */\n    if (unlikely(__pyx_v_weight == Py_None)) {\n      PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_weight\");\n      __PYX_ERR(0, 596, __pyx_L1_error)\n    }\n    __pyx_v_result = (*((fst::script::WeightClass *)((struct __pyx_obj_9pywrapfst_Weight *)__pyx_v_weight)->_weight.get()));\n\n    /* \"pywrapfst.pyx\":595\n *   if weight is None:\n *     result = fst.WeightClass.Zero(weight_type)\n *   elif isinstance(weight, Weight):             # <<<<<<<<<<<<<<\n *     result = deref(<fst.WeightClass *> (<Weight> weight)._weight.get())\n *   else:\n */\n    goto __pyx_L3;\n  }\n\n  /* \"pywrapfst.pyx\":598\n *     result = deref(<fst.WeightClass *> (<Weight> weight)._weight.get())\n *   else:\n *     result = fst.WeightClass(weight_type, weight_tostring(weight))             # <<<<<<<<<<<<<<\n *     if result.ToString() == b\"BadNumber\":\n *       raise FstBadWeightError(weight_tostring(weight))\n */\n  /*else*/ {\n    __pyx_t_3 = __pyx_f_9pywrapfst_weight_tostring(__pyx_v_weight, NULL); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 598, __pyx_L1_error)\n    __pyx_v_result = fst::script::WeightClass(__pyx_v_weight_type, __pyx_t_3);\n\n    /* \"pywrapfst.pyx\":599\n *   else:\n *     result = fst.WeightClass(weight_type, weight_tostring(weight))\n *     if result.ToString() == b\"BadNumber\":             # <<<<<<<<<<<<<<\n *       raise FstBadWeightError(weight_tostring(weight))\n *   return result\n */\n    __pyx_t_1 = ((__pyx_v_result.ToString() == ((char *)\"BadNumber\")) != 0);\n    if (__pyx_t_1) {\n\n      /* \"pywrapfst.pyx\":600\n *     result = fst.WeightClass(weight_type, weight_tostring(weight))\n *     if result.ToString() == b\"BadNumber\":\n *       raise FstBadWeightError(weight_tostring(weight))             # <<<<<<<<<<<<<<\n *   return result\n * \n */\n      __pyx_t_5 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstBadWeightError); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 600, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_5);\n      __pyx_t_3 = __pyx_f_9pywrapfst_weight_tostring(__pyx_v_weight, NULL); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 600, __pyx_L1_error)\n      __pyx_t_6 = __pyx_convert_PyBytes_string_to_py_std__in_string(__pyx_t_3); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 600, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_6);\n      __pyx_t_7 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_5))) {\n        __pyx_t_7 = PyMethod_GET_SELF(__pyx_t_5);\n        if (likely(__pyx_t_7)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_5);\n          __Pyx_INCREF(__pyx_t_7);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_5, function);\n        }\n      }\n      if (!__pyx_t_7) {\n        __pyx_t_4 = __Pyx_PyObject_CallOneArg(__pyx_t_5, __pyx_t_6); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 600, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n        __Pyx_GOTREF(__pyx_t_4);\n      } else {\n        #if CYTHON_FAST_PYCALL\n        if (PyFunction_Check(__pyx_t_5)) {\n          PyObject *__pyx_temp[2] = {__pyx_t_7, __pyx_t_6};\n          __pyx_t_4 = __Pyx_PyFunction_FastCall(__pyx_t_5, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 600, __pyx_L1_error)\n          __Pyx_XDECREF(__pyx_t_7); __pyx_t_7 = 0;\n          __Pyx_GOTREF(__pyx_t_4);\n          __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n        } else\n        #endif\n        #if CYTHON_FAST_PYCCALL\n        if (__Pyx_PyFastCFunction_Check(__pyx_t_5)) {\n          PyObject *__pyx_temp[2] = {__pyx_t_7, __pyx_t_6};\n          __pyx_t_4 = __Pyx_PyCFunction_FastCall(__pyx_t_5, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 600, __pyx_L1_error)\n          __Pyx_XDECREF(__pyx_t_7); __pyx_t_7 = 0;\n          __Pyx_GOTREF(__pyx_t_4);\n          __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n        } else\n        #endif\n        {\n          __pyx_t_8 = PyTuple_New(1+1); if (unlikely(!__pyx_t_8)) __PYX_ERR(0, 600, __pyx_L1_error)\n          __Pyx_GOTREF(__pyx_t_8);\n          __Pyx_GIVEREF(__pyx_t_7); PyTuple_SET_ITEM(__pyx_t_8, 0, __pyx_t_7); __pyx_t_7 = NULL;\n          __Pyx_GIVEREF(__pyx_t_6);\n          PyTuple_SET_ITEM(__pyx_t_8, 0+1, __pyx_t_6);\n          __pyx_t_6 = 0;\n          __pyx_t_4 = __Pyx_PyObject_Call(__pyx_t_5, __pyx_t_8, NULL); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 600, __pyx_L1_error)\n          __Pyx_GOTREF(__pyx_t_4);\n          __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0;\n        }\n      }\n      __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n      __Pyx_Raise(__pyx_t_4, 0, 0, 0);\n      __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      __PYX_ERR(0, 600, __pyx_L1_error)\n\n      /* \"pywrapfst.pyx\":599\n *   else:\n *     result = fst.WeightClass(weight_type, weight_tostring(weight))\n *     if result.ToString() == b\"BadNumber\":             # <<<<<<<<<<<<<<\n *       raise FstBadWeightError(weight_tostring(weight))\n *   return result\n */\n    }\n  }\n  __pyx_L3:;\n\n  /* \"pywrapfst.pyx\":601\n *     if result.ToString() == b\"BadNumber\":\n *       raise FstBadWeightError(weight_tostring(weight))\n *   return result             # <<<<<<<<<<<<<<\n * \n * \n */\n  __pyx_r = __pyx_v_result;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":575\n * \n * \n * cdef fst.WeightClass _get_WeightClass_or_Zero(const string &weight_type,             # <<<<<<<<<<<<<<\n *                                               weight) except *:\n *   \"\"\"Converts weight string to a WeightClass.\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_XDECREF(__pyx_t_6);\n  __Pyx_XDECREF(__pyx_t_7);\n  __Pyx_XDECREF(__pyx_t_8);\n  __Pyx_AddTraceback(\"pywrapfst._get_WeightClass_or_Zero\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_pretend_to_initialize(&__pyx_r);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":604\n * \n * \n * cdef fst.WeightClass _get_WeightClass_or_One(const string &weight_type,             # <<<<<<<<<<<<<<\n *                                              weight) except *:\n *   \"\"\"Converts weight string to a WeightClass.\n */\n\nstatic fst::script::WeightClass __pyx_f_9pywrapfst__get_WeightClass_or_One(std::string const &__pyx_v_weight_type, PyObject *__pyx_v_weight) {\n  fst::script::WeightClass __pyx_v_result;\n  fst::script::WeightClass __pyx_r;\n  __Pyx_RefNannyDeclarations\n  int __pyx_t_1;\n  int __pyx_t_2;\n  std::string __pyx_t_3;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  PyObject *__pyx_t_6 = NULL;\n  PyObject *__pyx_t_7 = NULL;\n  PyObject *__pyx_t_8 = NULL;\n  __Pyx_RefNannySetupContext(\"_get_WeightClass_or_One\", 0);\n\n  /* \"pywrapfst.pyx\":622\n *   \"\"\"\n *   cdef fst.WeightClass result\n *   if weight is None:             # <<<<<<<<<<<<<<\n *     result = fst.WeightClass.One(weight_type)\n *   elif isinstance(weight, Weight):\n */\n  __pyx_t_1 = (__pyx_v_weight == Py_None);\n  __pyx_t_2 = (__pyx_t_1 != 0);\n  if (__pyx_t_2) {\n\n    /* \"pywrapfst.pyx\":623\n *   cdef fst.WeightClass result\n *   if weight is None:\n *     result = fst.WeightClass.One(weight_type)             # <<<<<<<<<<<<<<\n *   elif isinstance(weight, Weight):\n *     result = deref(<fst.WeightClass *> (<Weight> weight)._weight.get())\n */\n    __pyx_v_result = fst::script::WeightClass::One(__pyx_v_weight_type);\n\n    /* \"pywrapfst.pyx\":622\n *   \"\"\"\n *   cdef fst.WeightClass result\n *   if weight is None:             # <<<<<<<<<<<<<<\n *     result = fst.WeightClass.One(weight_type)\n *   elif isinstance(weight, Weight):\n */\n    goto __pyx_L3;\n  }\n\n  /* \"pywrapfst.pyx\":624\n *   if weight is None:\n *     result = fst.WeightClass.One(weight_type)\n *   elif isinstance(weight, Weight):             # <<<<<<<<<<<<<<\n *     result = deref(<fst.WeightClass *> (<Weight> weight)._weight.get())\n *   else:\n */\n  __pyx_t_2 = __Pyx_TypeCheck(__pyx_v_weight, __pyx_ptype_9pywrapfst_Weight); \n  __pyx_t_1 = (__pyx_t_2 != 0);\n  if (__pyx_t_1) {\n\n    /* \"pywrapfst.pyx\":625\n *     result = fst.WeightClass.One(weight_type)\n *   elif isinstance(weight, Weight):\n *     result = deref(<fst.WeightClass *> (<Weight> weight)._weight.get())             # <<<<<<<<<<<<<<\n *   else:\n *     result = fst.WeightClass(weight_type, weight_tostring(weight))\n */\n    if (unlikely(__pyx_v_weight == Py_None)) {\n      PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_weight\");\n      __PYX_ERR(0, 625, __pyx_L1_error)\n    }\n    __pyx_v_result = (*((fst::script::WeightClass *)((struct __pyx_obj_9pywrapfst_Weight *)__pyx_v_weight)->_weight.get()));\n\n    /* \"pywrapfst.pyx\":624\n *   if weight is None:\n *     result = fst.WeightClass.One(weight_type)\n *   elif isinstance(weight, Weight):             # <<<<<<<<<<<<<<\n *     result = deref(<fst.WeightClass *> (<Weight> weight)._weight.get())\n *   else:\n */\n    goto __pyx_L3;\n  }\n\n  /* \"pywrapfst.pyx\":627\n *     result = deref(<fst.WeightClass *> (<Weight> weight)._weight.get())\n *   else:\n *     result = fst.WeightClass(weight_type, weight_tostring(weight))             # <<<<<<<<<<<<<<\n *     if result.ToString() == b\"BadNumber\":\n *       raise FstBadWeightError(weight_tostring(weight))\n */\n  /*else*/ {\n    __pyx_t_3 = __pyx_f_9pywrapfst_weight_tostring(__pyx_v_weight, NULL); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 627, __pyx_L1_error)\n    __pyx_v_result = fst::script::WeightClass(__pyx_v_weight_type, __pyx_t_3);\n\n    /* \"pywrapfst.pyx\":628\n *   else:\n *     result = fst.WeightClass(weight_type, weight_tostring(weight))\n *     if result.ToString() == b\"BadNumber\":             # <<<<<<<<<<<<<<\n *       raise FstBadWeightError(weight_tostring(weight))\n *   return result\n */\n    __pyx_t_1 = ((__pyx_v_result.ToString() == ((char *)\"BadNumber\")) != 0);\n    if (__pyx_t_1) {\n\n      /* \"pywrapfst.pyx\":629\n *     result = fst.WeightClass(weight_type, weight_tostring(weight))\n *     if result.ToString() == b\"BadNumber\":\n *       raise FstBadWeightError(weight_tostring(weight))             # <<<<<<<<<<<<<<\n *   return result\n * \n */\n      __pyx_t_5 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstBadWeightError); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 629, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_5);\n      __pyx_t_3 = __pyx_f_9pywrapfst_weight_tostring(__pyx_v_weight, NULL); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 629, __pyx_L1_error)\n      __pyx_t_6 = __pyx_convert_PyBytes_string_to_py_std__in_string(__pyx_t_3); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 629, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_6);\n      __pyx_t_7 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_5))) {\n        __pyx_t_7 = PyMethod_GET_SELF(__pyx_t_5);\n        if (likely(__pyx_t_7)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_5);\n          __Pyx_INCREF(__pyx_t_7);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_5, function);\n        }\n      }\n      if (!__pyx_t_7) {\n        __pyx_t_4 = __Pyx_PyObject_CallOneArg(__pyx_t_5, __pyx_t_6); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 629, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n        __Pyx_GOTREF(__pyx_t_4);\n      } else {\n        #if CYTHON_FAST_PYCALL\n        if (PyFunction_Check(__pyx_t_5)) {\n          PyObject *__pyx_temp[2] = {__pyx_t_7, __pyx_t_6};\n          __pyx_t_4 = __Pyx_PyFunction_FastCall(__pyx_t_5, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 629, __pyx_L1_error)\n          __Pyx_XDECREF(__pyx_t_7); __pyx_t_7 = 0;\n          __Pyx_GOTREF(__pyx_t_4);\n          __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n        } else\n        #endif\n        #if CYTHON_FAST_PYCCALL\n        if (__Pyx_PyFastCFunction_Check(__pyx_t_5)) {\n          PyObject *__pyx_temp[2] = {__pyx_t_7, __pyx_t_6};\n          __pyx_t_4 = __Pyx_PyCFunction_FastCall(__pyx_t_5, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 629, __pyx_L1_error)\n          __Pyx_XDECREF(__pyx_t_7); __pyx_t_7 = 0;\n          __Pyx_GOTREF(__pyx_t_4);\n          __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n        } else\n        #endif\n        {\n          __pyx_t_8 = PyTuple_New(1+1); if (unlikely(!__pyx_t_8)) __PYX_ERR(0, 629, __pyx_L1_error)\n          __Pyx_GOTREF(__pyx_t_8);\n          __Pyx_GIVEREF(__pyx_t_7); PyTuple_SET_ITEM(__pyx_t_8, 0, __pyx_t_7); __pyx_t_7 = NULL;\n          __Pyx_GIVEREF(__pyx_t_6);\n          PyTuple_SET_ITEM(__pyx_t_8, 0+1, __pyx_t_6);\n          __pyx_t_6 = 0;\n          __pyx_t_4 = __Pyx_PyObject_Call(__pyx_t_5, __pyx_t_8, NULL); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 629, __pyx_L1_error)\n          __Pyx_GOTREF(__pyx_t_4);\n          __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0;\n        }\n      }\n      __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n      __Pyx_Raise(__pyx_t_4, 0, 0, 0);\n      __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      __PYX_ERR(0, 629, __pyx_L1_error)\n\n      /* \"pywrapfst.pyx\":628\n *   else:\n *     result = fst.WeightClass(weight_type, weight_tostring(weight))\n *     if result.ToString() == b\"BadNumber\":             # <<<<<<<<<<<<<<\n *       raise FstBadWeightError(weight_tostring(weight))\n *   return result\n */\n    }\n  }\n  __pyx_L3:;\n\n  /* \"pywrapfst.pyx\":630\n *     if result.ToString() == b\"BadNumber\":\n *       raise FstBadWeightError(weight_tostring(weight))\n *   return result             # <<<<<<<<<<<<<<\n * \n * \n */\n  __pyx_r = __pyx_v_result;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":604\n * \n * \n * cdef fst.WeightClass _get_WeightClass_or_One(const string &weight_type,             # <<<<<<<<<<<<<<\n *                                              weight) except *:\n *   \"\"\"Converts weight string to a WeightClass.\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_XDECREF(__pyx_t_6);\n  __Pyx_XDECREF(__pyx_t_7);\n  __Pyx_XDECREF(__pyx_t_8);\n  __Pyx_AddTraceback(\"pywrapfst._get_WeightClass_or_One\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_pretend_to_initialize(&__pyx_r);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":633\n * \n * \n * cdef Weight _Zero(weight_type):             # <<<<<<<<<<<<<<\n *   cdef Weight result = Weight.__new__(Weight)\n *   result._weight.reset(new fst.WeightClass(fst.WeightClass.Zero(\n */\n\nstatic struct __pyx_obj_9pywrapfst_Weight *__pyx_f_9pywrapfst__Zero(PyObject *__pyx_v_weight_type) {\n  struct __pyx_obj_9pywrapfst_Weight *__pyx_v_result = 0;\n  struct __pyx_obj_9pywrapfst_Weight *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  std::string __pyx_t_2;\n  int __pyx_t_3;\n  PyObject *__pyx_t_4 = NULL;\n  __Pyx_RefNannySetupContext(\"_Zero\", 0);\n\n  /* \"pywrapfst.pyx\":634\n * \n * cdef Weight _Zero(weight_type):\n *   cdef Weight result = Weight.__new__(Weight)             # <<<<<<<<<<<<<<\n *   result._weight.reset(new fst.WeightClass(fst.WeightClass.Zero(\n *       tostring(weight_type))))\n */\n  __pyx_t_1 = __pyx_tp_new_9pywrapfst_Weight(((PyTypeObject *)__pyx_ptype_9pywrapfst_Weight), __pyx_empty_tuple, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 634, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (!(likely(__Pyx_TypeTest(__pyx_t_1, __pyx_ptype_9pywrapfst_Weight)))) __PYX_ERR(0, 634, __pyx_L1_error)\n  __pyx_v_result = ((struct __pyx_obj_9pywrapfst_Weight *)__pyx_t_1);\n  __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":635\n * cdef Weight _Zero(weight_type):\n *   cdef Weight result = Weight.__new__(Weight)\n *   result._weight.reset(new fst.WeightClass(fst.WeightClass.Zero(             # <<<<<<<<<<<<<<\n *       tostring(weight_type))))\n *   if result._weight.get().Type() == b\"none\":\n */\n  if (unlikely(((PyObject *)__pyx_v_result) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_weight\");\n    __PYX_ERR(0, 635, __pyx_L1_error)\n  }\n\n  /* \"pywrapfst.pyx\":636\n *   cdef Weight result = Weight.__new__(Weight)\n *   result._weight.reset(new fst.WeightClass(fst.WeightClass.Zero(\n *       tostring(weight_type))))             # <<<<<<<<<<<<<<\n *   if result._weight.get().Type() == b\"none\":\n *     raise FstArgError(\"Weight type not found\")\n */\n  __pyx_t_2 = __pyx_f_9pywrapfst_tostring(__pyx_v_weight_type, NULL); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 636, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":635\n * cdef Weight _Zero(weight_type):\n *   cdef Weight result = Weight.__new__(Weight)\n *   result._weight.reset(new fst.WeightClass(fst.WeightClass.Zero(             # <<<<<<<<<<<<<<\n *       tostring(weight_type))))\n *   if result._weight.get().Type() == b\"none\":\n */\n  __pyx_v_result->_weight.reset(new fst::script::WeightClass(fst::script::WeightClass::Zero(__pyx_t_2)));\n\n  /* \"pywrapfst.pyx\":637\n *   result._weight.reset(new fst.WeightClass(fst.WeightClass.Zero(\n *       tostring(weight_type))))\n *   if result._weight.get().Type() == b\"none\":             # <<<<<<<<<<<<<<\n *     raise FstArgError(\"Weight type not found\")\n *   return result\n */\n  if (unlikely(((PyObject *)__pyx_v_result) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_weight\");\n    __PYX_ERR(0, 637, __pyx_L1_error)\n  }\n  __pyx_t_3 = ((__pyx_v_result->_weight.get()->Type() == ((char *)\"none\")) != 0);\n  if (__pyx_t_3) {\n\n    /* \"pywrapfst.pyx\":638\n *       tostring(weight_type))))\n *   if result._weight.get().Type() == b\"none\":\n *     raise FstArgError(\"Weight type not found\")             # <<<<<<<<<<<<<<\n *   return result\n * \n */\n    __pyx_t_1 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstArgError); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 638, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    __pyx_t_4 = __Pyx_PyObject_Call(__pyx_t_1, __pyx_tuple__5, NULL); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 638, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_4);\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n    __Pyx_Raise(__pyx_t_4, 0, 0, 0);\n    __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n    __PYX_ERR(0, 638, __pyx_L1_error)\n\n    /* \"pywrapfst.pyx\":637\n *   result._weight.reset(new fst.WeightClass(fst.WeightClass.Zero(\n *       tostring(weight_type))))\n *   if result._weight.get().Type() == b\"none\":             # <<<<<<<<<<<<<<\n *     raise FstArgError(\"Weight type not found\")\n *   return result\n */\n  }\n\n  /* \"pywrapfst.pyx\":639\n *   if result._weight.get().Type() == b\"none\":\n *     raise FstArgError(\"Weight type not found\")\n *   return result             # <<<<<<<<<<<<<<\n * \n * \n */\n  __Pyx_XDECREF(((PyObject *)__pyx_r));\n  __Pyx_INCREF(((PyObject *)__pyx_v_result));\n  __pyx_r = __pyx_v_result;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":633\n * \n * \n * cdef Weight _Zero(weight_type):             # <<<<<<<<<<<<<<\n *   cdef Weight result = Weight.__new__(Weight)\n *   result._weight.reset(new fst.WeightClass(fst.WeightClass.Zero(\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_AddTraceback(\"pywrapfst._Zero\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XDECREF((PyObject *)__pyx_v_result);\n  __Pyx_XGIVEREF((PyObject *)__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":642\n * \n * \n * cdef Weight _One(weight_type):             # <<<<<<<<<<<<<<\n *   cdef Weight result = Weight.__new__(Weight)\n *   result._weight.reset(new fst.WeightClass(\n */\n\nstatic struct __pyx_obj_9pywrapfst_Weight *__pyx_f_9pywrapfst__One(PyObject *__pyx_v_weight_type) {\n  struct __pyx_obj_9pywrapfst_Weight *__pyx_v_result = 0;\n  struct __pyx_obj_9pywrapfst_Weight *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  std::string __pyx_t_2;\n  int __pyx_t_3;\n  PyObject *__pyx_t_4 = NULL;\n  __Pyx_RefNannySetupContext(\"_One\", 0);\n\n  /* \"pywrapfst.pyx\":643\n * \n * cdef Weight _One(weight_type):\n *   cdef Weight result = Weight.__new__(Weight)             # <<<<<<<<<<<<<<\n *   result._weight.reset(new fst.WeightClass(\n *         fst.WeightClass.One(tostring(weight_type))))\n */\n  __pyx_t_1 = __pyx_tp_new_9pywrapfst_Weight(((PyTypeObject *)__pyx_ptype_9pywrapfst_Weight), __pyx_empty_tuple, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 643, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (!(likely(__Pyx_TypeTest(__pyx_t_1, __pyx_ptype_9pywrapfst_Weight)))) __PYX_ERR(0, 643, __pyx_L1_error)\n  __pyx_v_result = ((struct __pyx_obj_9pywrapfst_Weight *)__pyx_t_1);\n  __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":644\n * cdef Weight _One(weight_type):\n *   cdef Weight result = Weight.__new__(Weight)\n *   result._weight.reset(new fst.WeightClass(             # <<<<<<<<<<<<<<\n *         fst.WeightClass.One(tostring(weight_type))))\n *   if result._weight.get().Type() == b\"none\":\n */\n  if (unlikely(((PyObject *)__pyx_v_result) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_weight\");\n    __PYX_ERR(0, 644, __pyx_L1_error)\n  }\n\n  /* \"pywrapfst.pyx\":645\n *   cdef Weight result = Weight.__new__(Weight)\n *   result._weight.reset(new fst.WeightClass(\n *         fst.WeightClass.One(tostring(weight_type))))             # <<<<<<<<<<<<<<\n *   if result._weight.get().Type() == b\"none\":\n *     raise FstArgError(\"Weight type not found\")\n */\n  __pyx_t_2 = __pyx_f_9pywrapfst_tostring(__pyx_v_weight_type, NULL); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 645, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":644\n * cdef Weight _One(weight_type):\n *   cdef Weight result = Weight.__new__(Weight)\n *   result._weight.reset(new fst.WeightClass(             # <<<<<<<<<<<<<<\n *         fst.WeightClass.One(tostring(weight_type))))\n *   if result._weight.get().Type() == b\"none\":\n */\n  __pyx_v_result->_weight.reset(new fst::script::WeightClass(fst::script::WeightClass::One(__pyx_t_2)));\n\n  /* \"pywrapfst.pyx\":646\n *   result._weight.reset(new fst.WeightClass(\n *         fst.WeightClass.One(tostring(weight_type))))\n *   if result._weight.get().Type() == b\"none\":             # <<<<<<<<<<<<<<\n *     raise FstArgError(\"Weight type not found\")\n *   return result\n */\n  if (unlikely(((PyObject *)__pyx_v_result) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_weight\");\n    __PYX_ERR(0, 646, __pyx_L1_error)\n  }\n  __pyx_t_3 = ((__pyx_v_result->_weight.get()->Type() == ((char *)\"none\")) != 0);\n  if (__pyx_t_3) {\n\n    /* \"pywrapfst.pyx\":647\n *         fst.WeightClass.One(tostring(weight_type))))\n *   if result._weight.get().Type() == b\"none\":\n *     raise FstArgError(\"Weight type not found\")             # <<<<<<<<<<<<<<\n *   return result\n * \n */\n    __pyx_t_1 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstArgError); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 647, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    __pyx_t_4 = __Pyx_PyObject_Call(__pyx_t_1, __pyx_tuple__6, NULL); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 647, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_4);\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n    __Pyx_Raise(__pyx_t_4, 0, 0, 0);\n    __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n    __PYX_ERR(0, 647, __pyx_L1_error)\n\n    /* \"pywrapfst.pyx\":646\n *   result._weight.reset(new fst.WeightClass(\n *         fst.WeightClass.One(tostring(weight_type))))\n *   if result._weight.get().Type() == b\"none\":             # <<<<<<<<<<<<<<\n *     raise FstArgError(\"Weight type not found\")\n *   return result\n */\n  }\n\n  /* \"pywrapfst.pyx\":648\n *   if result._weight.get().Type() == b\"none\":\n *     raise FstArgError(\"Weight type not found\")\n *   return result             # <<<<<<<<<<<<<<\n * \n * \n */\n  __Pyx_XDECREF(((PyObject *)__pyx_r));\n  __Pyx_INCREF(((PyObject *)__pyx_v_result));\n  __pyx_r = __pyx_v_result;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":642\n * \n * \n * cdef Weight _One(weight_type):             # <<<<<<<<<<<<<<\n *   cdef Weight result = Weight.__new__(Weight)\n *   result._weight.reset(new fst.WeightClass(\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_AddTraceback(\"pywrapfst._One\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XDECREF((PyObject *)__pyx_v_result);\n  __Pyx_XGIVEREF((PyObject *)__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":651\n * \n * \n * cdef Weight _NoWeight(weight_type):             # <<<<<<<<<<<<<<\n *   cdef Weight result = Weight.__new__(Weight)\n *   result._weight.reset(new fst.WeightClass(\n */\n\nstatic struct __pyx_obj_9pywrapfst_Weight *__pyx_f_9pywrapfst__NoWeight(PyObject *__pyx_v_weight_type) {\n  struct __pyx_obj_9pywrapfst_Weight *__pyx_v_result = 0;\n  struct __pyx_obj_9pywrapfst_Weight *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  std::string __pyx_t_2;\n  __Pyx_RefNannySetupContext(\"_NoWeight\", 0);\n\n  /* \"pywrapfst.pyx\":652\n * \n * cdef Weight _NoWeight(weight_type):\n *   cdef Weight result = Weight.__new__(Weight)             # <<<<<<<<<<<<<<\n *   result._weight.reset(new fst.WeightClass(\n *         fst.WeightClass.NoWeight(tostring(weight_type))))\n */\n  __pyx_t_1 = __pyx_tp_new_9pywrapfst_Weight(((PyTypeObject *)__pyx_ptype_9pywrapfst_Weight), __pyx_empty_tuple, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 652, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (!(likely(__Pyx_TypeTest(__pyx_t_1, __pyx_ptype_9pywrapfst_Weight)))) __PYX_ERR(0, 652, __pyx_L1_error)\n  __pyx_v_result = ((struct __pyx_obj_9pywrapfst_Weight *)__pyx_t_1);\n  __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":653\n * cdef Weight _NoWeight(weight_type):\n *   cdef Weight result = Weight.__new__(Weight)\n *   result._weight.reset(new fst.WeightClass(             # <<<<<<<<<<<<<<\n *         fst.WeightClass.NoWeight(tostring(weight_type))))\n *   return result\n */\n  if (unlikely(((PyObject *)__pyx_v_result) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_weight\");\n    __PYX_ERR(0, 653, __pyx_L1_error)\n  }\n\n  /* \"pywrapfst.pyx\":654\n *   cdef Weight result = Weight.__new__(Weight)\n *   result._weight.reset(new fst.WeightClass(\n *         fst.WeightClass.NoWeight(tostring(weight_type))))             # <<<<<<<<<<<<<<\n *   return result\n * \n */\n  __pyx_t_2 = __pyx_f_9pywrapfst_tostring(__pyx_v_weight_type, NULL); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 654, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":653\n * cdef Weight _NoWeight(weight_type):\n *   cdef Weight result = Weight.__new__(Weight)\n *   result._weight.reset(new fst.WeightClass(             # <<<<<<<<<<<<<<\n *         fst.WeightClass.NoWeight(tostring(weight_type))))\n *   return result\n */\n  __pyx_v_result->_weight.reset(new fst::script::WeightClass(fst::script::WeightClass::NoWeight(__pyx_t_2)));\n\n  /* \"pywrapfst.pyx\":655\n *   result._weight.reset(new fst.WeightClass(\n *         fst.WeightClass.NoWeight(tostring(weight_type))))\n *   return result             # <<<<<<<<<<<<<<\n * \n * \n */\n  __Pyx_XDECREF(((PyObject *)__pyx_r));\n  __Pyx_INCREF(((PyObject *)__pyx_v_result));\n  __pyx_r = __pyx_v_result;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":651\n * \n * \n * cdef Weight _NoWeight(weight_type):             # <<<<<<<<<<<<<<\n *   cdef Weight result = Weight.__new__(Weight)\n *   result._weight.reset(new fst.WeightClass(\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst._NoWeight\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XDECREF((PyObject *)__pyx_v_result);\n  __Pyx_XGIVEREF((PyObject *)__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":689\n *   # Doing so will allow undefined behavior.\n * \n *   def __init__(self):             # <<<<<<<<<<<<<<\n *     raise FstDeletedConstructorError(\n *         \"Cannot construct {}\".format(self.__class__.__name__))\n */\n\n/* Python wrapper */\nstatic int __pyx_pw_9pywrapfst_12_SymbolTable_1__init__(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic int __pyx_pw_9pywrapfst_12_SymbolTable_1__init__(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  int __pyx_r;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__init__ (wrapper)\", 0);\n  if (unlikely(PyTuple_GET_SIZE(__pyx_args) > 0)) {\n    __Pyx_RaiseArgtupleInvalid(\"__init__\", 1, 0, 0, PyTuple_GET_SIZE(__pyx_args)); return -1;}\n  if (unlikely(__pyx_kwds) && unlikely(PyDict_Size(__pyx_kwds) > 0) && unlikely(!__Pyx_CheckKeywordStrings(__pyx_kwds, \"__init__\", 0))) return -1;\n  __pyx_r = __pyx_pf_9pywrapfst_12_SymbolTable___init__(((struct __pyx_obj_9pywrapfst__SymbolTable *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic int __pyx_pf_9pywrapfst_12_SymbolTable___init__(struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_self) {\n  int __pyx_r;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  PyObject *__pyx_t_6 = NULL;\n  PyObject *__pyx_t_7 = NULL;\n  __Pyx_RefNannySetupContext(\"__init__\", 0);\n\n  /* \"pywrapfst.pyx\":690\n * \n *   def __init__(self):\n *     raise FstDeletedConstructorError(             # <<<<<<<<<<<<<<\n *         \"Cannot construct {}\".format(self.__class__.__name__))\n * \n */\n  __pyx_t_2 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstDeletedConstructorError); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 690, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n\n  /* \"pywrapfst.pyx\":691\n *   def __init__(self):\n *     raise FstDeletedConstructorError(\n *         \"Cannot construct {}\".format(self.__class__.__name__))             # <<<<<<<<<<<<<<\n * \n *   def __iter__(self):\n */\n  __pyx_t_4 = __Pyx_PyObject_GetAttrStr(__pyx_kp_s_Cannot_construct, __pyx_n_s_format); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 691, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_4);\n  __pyx_t_5 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_class); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 691, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_5);\n  __pyx_t_6 = __Pyx_PyObject_GetAttrStr(__pyx_t_5, __pyx_n_s_name); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 691, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_6);\n  __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n  __pyx_t_5 = NULL;\n  if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_4))) {\n    __pyx_t_5 = PyMethod_GET_SELF(__pyx_t_4);\n    if (likely(__pyx_t_5)) {\n      PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_4);\n      __Pyx_INCREF(__pyx_t_5);\n      __Pyx_INCREF(function);\n      __Pyx_DECREF_SET(__pyx_t_4, function);\n    }\n  }\n  if (!__pyx_t_5) {\n    __pyx_t_3 = __Pyx_PyObject_CallOneArg(__pyx_t_4, __pyx_t_6); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 691, __pyx_L1_error)\n    __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n    __Pyx_GOTREF(__pyx_t_3);\n  } else {\n    #if CYTHON_FAST_PYCALL\n    if (PyFunction_Check(__pyx_t_4)) {\n      PyObject *__pyx_temp[2] = {__pyx_t_5, __pyx_t_6};\n      __pyx_t_3 = __Pyx_PyFunction_FastCall(__pyx_t_4, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 691, __pyx_L1_error)\n      __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;\n      __Pyx_GOTREF(__pyx_t_3);\n      __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n    } else\n    #endif\n    #if CYTHON_FAST_PYCCALL\n    if (__Pyx_PyFastCFunction_Check(__pyx_t_4)) {\n      PyObject *__pyx_temp[2] = {__pyx_t_5, __pyx_t_6};\n      __pyx_t_3 = __Pyx_PyCFunction_FastCall(__pyx_t_4, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 691, __pyx_L1_error)\n      __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;\n      __Pyx_GOTREF(__pyx_t_3);\n      __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n    } else\n    #endif\n    {\n      __pyx_t_7 = PyTuple_New(1+1); if (unlikely(!__pyx_t_7)) __PYX_ERR(0, 691, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_7);\n      __Pyx_GIVEREF(__pyx_t_5); PyTuple_SET_ITEM(__pyx_t_7, 0, __pyx_t_5); __pyx_t_5 = NULL;\n      __Pyx_GIVEREF(__pyx_t_6);\n      PyTuple_SET_ITEM(__pyx_t_7, 0+1, __pyx_t_6);\n      __pyx_t_6 = 0;\n      __pyx_t_3 = __Pyx_PyObject_Call(__pyx_t_4, __pyx_t_7, NULL); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 691, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_3);\n      __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0;\n    }\n  }\n  __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n  __pyx_t_4 = NULL;\n  if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_2))) {\n    __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_2);\n    if (likely(__pyx_t_4)) {\n      PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_2);\n      __Pyx_INCREF(__pyx_t_4);\n      __Pyx_INCREF(function);\n      __Pyx_DECREF_SET(__pyx_t_2, function);\n    }\n  }\n  if (!__pyx_t_4) {\n    __pyx_t_1 = __Pyx_PyObject_CallOneArg(__pyx_t_2, __pyx_t_3); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 690, __pyx_L1_error)\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    __Pyx_GOTREF(__pyx_t_1);\n  } else {\n    #if CYTHON_FAST_PYCALL\n    if (PyFunction_Check(__pyx_t_2)) {\n      PyObject *__pyx_temp[2] = {__pyx_t_4, __pyx_t_3};\n      __pyx_t_1 = __Pyx_PyFunction_FastCall(__pyx_t_2, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 690, __pyx_L1_error)\n      __Pyx_XDECREF(__pyx_t_4); __pyx_t_4 = 0;\n      __Pyx_GOTREF(__pyx_t_1);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    } else\n    #endif\n    #if CYTHON_FAST_PYCCALL\n    if (__Pyx_PyFastCFunction_Check(__pyx_t_2)) {\n      PyObject *__pyx_temp[2] = {__pyx_t_4, __pyx_t_3};\n      __pyx_t_1 = __Pyx_PyCFunction_FastCall(__pyx_t_2, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 690, __pyx_L1_error)\n      __Pyx_XDECREF(__pyx_t_4); __pyx_t_4 = 0;\n      __Pyx_GOTREF(__pyx_t_1);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    } else\n    #endif\n    {\n      __pyx_t_7 = PyTuple_New(1+1); if (unlikely(!__pyx_t_7)) __PYX_ERR(0, 690, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_7);\n      __Pyx_GIVEREF(__pyx_t_4); PyTuple_SET_ITEM(__pyx_t_7, 0, __pyx_t_4); __pyx_t_4 = NULL;\n      __Pyx_GIVEREF(__pyx_t_3);\n      PyTuple_SET_ITEM(__pyx_t_7, 0+1, __pyx_t_3);\n      __pyx_t_3 = 0;\n      __pyx_t_1 = __Pyx_PyObject_Call(__pyx_t_2, __pyx_t_7, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 690, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_1);\n      __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0;\n    }\n  }\n  __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n  __Pyx_Raise(__pyx_t_1, 0, 0, 0);\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  __PYX_ERR(0, 690, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":689\n *   # Doing so will allow undefined behavior.\n * \n *   def __init__(self):             # <<<<<<<<<<<<<<\n *     raise FstDeletedConstructorError(\n *         \"Cannot construct {}\".format(self.__class__.__name__))\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_XDECREF(__pyx_t_6);\n  __Pyx_XDECREF(__pyx_t_7);\n  __Pyx_AddTraceback(\"pywrapfst._SymbolTable.__init__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = -1;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":693\n *         \"Cannot construct {}\".format(self.__class__.__name__))\n * \n *   def __iter__(self):             # <<<<<<<<<<<<<<\n *     return SymbolTableIterator(self)\n * \n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_12_SymbolTable_3__iter__(PyObject *__pyx_v_self); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_12_SymbolTable_3__iter__(PyObject *__pyx_v_self) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__iter__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_12_SymbolTable_2__iter__(((struct __pyx_obj_9pywrapfst__SymbolTable *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_12_SymbolTable_2__iter__(struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  __Pyx_RefNannySetupContext(\"__iter__\", 0);\n\n  /* \"pywrapfst.pyx\":694\n * \n *   def __iter__(self):\n *     return SymbolTableIterator(self)             # <<<<<<<<<<<<<<\n * \n *   cpdef int64 available_key(self):\n */\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = PyTuple_New(1); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 694, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __Pyx_INCREF(((PyObject *)__pyx_v_self));\n  __Pyx_GIVEREF(((PyObject *)__pyx_v_self));\n  PyTuple_SET_ITEM(__pyx_t_1, 0, ((PyObject *)__pyx_v_self));\n  __pyx_t_2 = __Pyx_PyObject_Call(((PyObject *)__pyx_ptype_9pywrapfst_SymbolTableIterator), __pyx_t_1, NULL); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 694, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  __pyx_r = __pyx_t_2;\n  __pyx_t_2 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":693\n *         \"Cannot construct {}\".format(self.__class__.__name__))\n * \n *   def __iter__(self):             # <<<<<<<<<<<<<<\n *     return SymbolTableIterator(self)\n * \n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_AddTraceback(\"pywrapfst._SymbolTable.__iter__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":696\n *     return SymbolTableIterator(self)\n * \n *   cpdef int64 available_key(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     available_key(self)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_12_SymbolTable_5available_key(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic __pyx_t_10basictypes_int64 __pyx_f_9pywrapfst_12_SymbolTable_available_key(struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_self, int __pyx_skip_dispatch) {\n  __pyx_t_10basictypes_int64 __pyx_r;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  __pyx_t_10basictypes_int64 __pyx_t_5;\n  __Pyx_RefNannySetupContext(\"available_key\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_available_key); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 696, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_12_SymbolTable_5available_key)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 696, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 696, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __pyx_t_5 = __Pyx_PyInt_As_int64_t(__pyx_t_2); if (unlikely((__pyx_t_5 == ((int64_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 696, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __pyx_r = __pyx_t_5;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":702\n *     Returns an integer indicating the next available key index in the table.\n *     \"\"\"\n *     return self._table.AvailableKey()             # <<<<<<<<<<<<<<\n * \n *   cpdef string checksum(self):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_table\");\n    __PYX_ERR(0, 702, __pyx_L1_error)\n  }\n  __pyx_r = __pyx_v_self->_table->AvailableKey();\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":696\n *     return SymbolTableIterator(self)\n * \n *   cpdef int64 available_key(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     available_key(self)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_WriteUnraisable(\"pywrapfst._SymbolTable.available_key\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_12_SymbolTable_5available_key(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_12_SymbolTable_4available_key[] = \"\\n    available_key(self)\\n\\n    Returns an integer indicating the next available key index in the table.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_12_SymbolTable_5available_key(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"available_key (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_12_SymbolTable_4available_key(((struct __pyx_obj_9pywrapfst__SymbolTable *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_12_SymbolTable_4available_key(struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"available_key\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __Pyx_PyInt_From_int64_t(__pyx_f_9pywrapfst_12_SymbolTable_available_key(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 696, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst._SymbolTable.available_key\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":704\n *     return self._table.AvailableKey()\n * \n *   cpdef string checksum(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     checksum(self)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_12_SymbolTable_7checksum(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic std::string __pyx_f_9pywrapfst_12_SymbolTable_checksum(struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_self, int __pyx_skip_dispatch) {\n  std::string __pyx_r;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  std::string __pyx_t_5;\n  __Pyx_RefNannySetupContext(\"checksum\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_checksum); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 704, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_12_SymbolTable_7checksum)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 704, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 704, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __pyx_t_5 = __pyx_convert_string_from_py_std__in_string(__pyx_t_2); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 704, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __pyx_r = __pyx_t_5;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":710\n *     Returns a string indicating the label-agnostic MD5 checksum for the table.\n *     \"\"\"\n *     return self._table.CheckSum()             # <<<<<<<<<<<<<<\n * \n *   cpdef SymbolTable copy(self):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_table\");\n    __PYX_ERR(0, 710, __pyx_L1_error)\n  }\n  __pyx_r = __pyx_v_self->_table->CheckSum();\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":704\n *     return self._table.AvailableKey()\n * \n *   cpdef string checksum(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     checksum(self)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_WriteUnraisable(\"pywrapfst._SymbolTable.checksum\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __Pyx_pretend_to_initialize(&__pyx_r);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_12_SymbolTable_7checksum(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_12_SymbolTable_6checksum[] = \"\\n    checksum(self)\\n\\n    Returns a string indicating the label-agnostic MD5 checksum for the table.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_12_SymbolTable_7checksum(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"checksum (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_12_SymbolTable_6checksum(((struct __pyx_obj_9pywrapfst__SymbolTable *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_12_SymbolTable_6checksum(struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"checksum\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __pyx_convert_PyBytes_string_to_py_std__in_string(__pyx_f_9pywrapfst_12_SymbolTable_checksum(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 704, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst._SymbolTable.checksum\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":712\n *     return self._table.CheckSum()\n * \n *   cpdef SymbolTable copy(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     copy(self)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_12_SymbolTable_9copy(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic struct __pyx_obj_9pywrapfst_SymbolTable *__pyx_f_9pywrapfst_12_SymbolTable_copy(struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_self, int __pyx_skip_dispatch) {\n  struct __pyx_obj_9pywrapfst_SymbolTable *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  __Pyx_RefNannySetupContext(\"copy\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_copy); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 712, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_12_SymbolTable_9copy)) {\n      __Pyx_XDECREF(((PyObject *)__pyx_r));\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 712, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 712, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      if (!(likely(((__pyx_t_2) == Py_None) || likely(__Pyx_TypeTest(__pyx_t_2, __pyx_ptype_9pywrapfst_SymbolTable))))) __PYX_ERR(0, 712, __pyx_L1_error)\n      __pyx_r = ((struct __pyx_obj_9pywrapfst_SymbolTable *)__pyx_t_2);\n      __pyx_t_2 = 0;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":718\n *     Returns a mutable copy of the SymbolTable.\n *     \"\"\"\n *     return _init_SymbolTable(self._table.Copy())             # <<<<<<<<<<<<<<\n * \n *   def find(self, key):\n */\n  __Pyx_XDECREF(((PyObject *)__pyx_r));\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_table\");\n    __PYX_ERR(0, 718, __pyx_L1_error)\n  }\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst__init_SymbolTable(__pyx_v_self->_table->Copy())); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 718, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = ((struct __pyx_obj_9pywrapfst_SymbolTable *)__pyx_t_1);\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":712\n *     return self._table.CheckSum()\n * \n *   cpdef SymbolTable copy(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     copy(self)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_AddTraceback(\"pywrapfst._SymbolTable.copy\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XGIVEREF((PyObject *)__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_12_SymbolTable_9copy(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_12_SymbolTable_8copy[] = \"\\n    copy(self)\\n\\n    Returns a mutable copy of the SymbolTable.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_12_SymbolTable_9copy(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"copy (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_12_SymbolTable_8copy(((struct __pyx_obj_9pywrapfst__SymbolTable *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_12_SymbolTable_8copy(struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"copy\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst_12_SymbolTable_copy(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 712, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst._SymbolTable.copy\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":720\n *     return _init_SymbolTable(self._table.Copy())\n * \n *   def find(self, key):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     find(self, key)\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_12_SymbolTable_11find(PyObject *__pyx_v_self, PyObject *__pyx_v_key); /*proto*/\nstatic char __pyx_doc_9pywrapfst_12_SymbolTable_10find[] = \"\\n    find(self, key)\\n\\n    Given a symbol or index, finds the other one.\\n\\n    This method returns the index associated with a symbol key, or the symbol\\n    associated with a index key.\\n\\n    Args:\\n      key: Either a string or an index.\\n\\n    Returns:\\n      If the key is a string, the associated index or NO_LABEL if not found; if\\n          the key is an integer, the associated symbol or an empty string if\\n          not found.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_12_SymbolTable_11find(PyObject *__pyx_v_self, PyObject *__pyx_v_key) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"find (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_12_SymbolTable_10find(((struct __pyx_obj_9pywrapfst__SymbolTable *)__pyx_v_self), ((PyObject *)__pyx_v_key));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_12_SymbolTable_10find(struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_self, PyObject *__pyx_v_key) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  std::string __pyx_t_4;\n  PyObject *__pyx_t_5 = NULL;\n  int __pyx_t_6;\n  PyObject *__pyx_t_7 = NULL;\n  PyObject *__pyx_t_8 = NULL;\n  __pyx_t_10basictypes_int64 __pyx_t_9;\n  PyObject *__pyx_t_10 = NULL;\n  __Pyx_RefNannySetupContext(\"find\", 0);\n\n  /* \"pywrapfst.pyx\":737\n *           not found.\n *     \"\"\"\n *     try:             # <<<<<<<<<<<<<<\n *       return self._table.FindIndex(tostring(key))\n *     except FstArgError:\n */\n  {\n    __Pyx_PyThreadState_declare\n    __Pyx_PyThreadState_assign\n    __Pyx_ExceptionSave(&__pyx_t_1, &__pyx_t_2, &__pyx_t_3);\n    __Pyx_XGOTREF(__pyx_t_1);\n    __Pyx_XGOTREF(__pyx_t_2);\n    __Pyx_XGOTREF(__pyx_t_3);\n    /*try:*/ {\n\n      /* \"pywrapfst.pyx\":738\n *     \"\"\"\n *     try:\n *       return self._table.FindIndex(tostring(key))             # <<<<<<<<<<<<<<\n *     except FstArgError:\n *       return self._table.FindSymbol(key)\n */\n      __Pyx_XDECREF(__pyx_r);\n      if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n        PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_table\");\n        __PYX_ERR(0, 738, __pyx_L3_error)\n      }\n      __pyx_t_4 = __pyx_f_9pywrapfst_tostring(__pyx_v_key, NULL); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 738, __pyx_L3_error)\n      __pyx_t_5 = __Pyx_PyInt_From_int64_t(__pyx_v_self->_table->Find(__pyx_t_4)); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 738, __pyx_L3_error)\n      __Pyx_GOTREF(__pyx_t_5);\n      __pyx_r = __pyx_t_5;\n      __pyx_t_5 = 0;\n      goto __pyx_L7_try_return;\n\n      /* \"pywrapfst.pyx\":737\n *           not found.\n *     \"\"\"\n *     try:             # <<<<<<<<<<<<<<\n *       return self._table.FindIndex(tostring(key))\n *     except FstArgError:\n */\n    }\n    __pyx_L3_error:;\n    __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;\n\n    /* \"pywrapfst.pyx\":739\n *     try:\n *       return self._table.FindIndex(tostring(key))\n *     except FstArgError:             # <<<<<<<<<<<<<<\n *       return self._table.FindSymbol(key)\n * \n */\n    __pyx_t_5 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstArgError); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 739, __pyx_L5_except_error)\n    __Pyx_GOTREF(__pyx_t_5);\n    __pyx_t_6 = __Pyx_PyErr_ExceptionMatches(__pyx_t_5);\n    __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n    if (__pyx_t_6) {\n      __Pyx_AddTraceback(\"pywrapfst._SymbolTable.find\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n      if (__Pyx_GetException(&__pyx_t_5, &__pyx_t_7, &__pyx_t_8) < 0) __PYX_ERR(0, 739, __pyx_L5_except_error)\n      __Pyx_GOTREF(__pyx_t_5);\n      __Pyx_GOTREF(__pyx_t_7);\n      __Pyx_GOTREF(__pyx_t_8);\n\n      /* \"pywrapfst.pyx\":740\n *       return self._table.FindIndex(tostring(key))\n *     except FstArgError:\n *       return self._table.FindSymbol(key)             # <<<<<<<<<<<<<<\n * \n *   cpdef int64 get_nth_key(self, ssize_t pos) except *:\n */\n      __Pyx_XDECREF(__pyx_r);\n      if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n        PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_table\");\n        __PYX_ERR(0, 740, __pyx_L5_except_error)\n      }\n      __pyx_t_9 = __Pyx_PyInt_As_int64_t(__pyx_v_key); if (unlikely((__pyx_t_9 == ((int64_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 740, __pyx_L5_except_error)\n      __pyx_t_10 = __pyx_convert_PyBytes_string_to_py_std__in_string(__pyx_v_self->_table->Find(__pyx_t_9)); if (unlikely(!__pyx_t_10)) __PYX_ERR(0, 740, __pyx_L5_except_error)\n      __Pyx_GOTREF(__pyx_t_10);\n      __pyx_r = __pyx_t_10;\n      __pyx_t_10 = 0;\n      __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n      __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0;\n      __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0;\n      goto __pyx_L6_except_return;\n    }\n    goto __pyx_L5_except_error;\n    __pyx_L5_except_error:;\n\n    /* \"pywrapfst.pyx\":737\n *           not found.\n *     \"\"\"\n *     try:             # <<<<<<<<<<<<<<\n *       return self._table.FindIndex(tostring(key))\n *     except FstArgError:\n */\n    __Pyx_XGIVEREF(__pyx_t_1);\n    __Pyx_XGIVEREF(__pyx_t_2);\n    __Pyx_XGIVEREF(__pyx_t_3);\n    __Pyx_ExceptionReset(__pyx_t_1, __pyx_t_2, __pyx_t_3);\n    goto __pyx_L1_error;\n    __pyx_L7_try_return:;\n    __Pyx_XGIVEREF(__pyx_t_1);\n    __Pyx_XGIVEREF(__pyx_t_2);\n    __Pyx_XGIVEREF(__pyx_t_3);\n    __Pyx_ExceptionReset(__pyx_t_1, __pyx_t_2, __pyx_t_3);\n    goto __pyx_L0;\n    __pyx_L6_except_return:;\n    __Pyx_XGIVEREF(__pyx_t_1);\n    __Pyx_XGIVEREF(__pyx_t_2);\n    __Pyx_XGIVEREF(__pyx_t_3);\n    __Pyx_ExceptionReset(__pyx_t_1, __pyx_t_2, __pyx_t_3);\n    goto __pyx_L0;\n  }\n\n  /* \"pywrapfst.pyx\":720\n *     return _init_SymbolTable(self._table.Copy())\n * \n *   def find(self, key):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     find(self, key)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_XDECREF(__pyx_t_7);\n  __Pyx_XDECREF(__pyx_t_8);\n  __Pyx_XDECREF(__pyx_t_10);\n  __Pyx_AddTraceback(\"pywrapfst._SymbolTable.find\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":742\n *       return self._table.FindSymbol(key)\n * \n *   cpdef int64 get_nth_key(self, ssize_t pos) except *:             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     get_nth_key(self, pos)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_12_SymbolTable_13get_nth_key(PyObject *__pyx_v_self, PyObject *__pyx_arg_pos); /*proto*/\nstatic __pyx_t_10basictypes_int64 __pyx_f_9pywrapfst_12_SymbolTable_get_nth_key(struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_self, Py_ssize_t __pyx_v_pos, int __pyx_skip_dispatch) {\n  __pyx_t_10basictypes_int64 __pyx_r;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  PyObject *__pyx_t_6 = NULL;\n  __pyx_t_10basictypes_int64 __pyx_t_7;\n  __Pyx_RefNannySetupContext(\"get_nth_key\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_get_nth_key); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 742, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_12_SymbolTable_13get_nth_key)) {\n      __pyx_t_3 = PyInt_FromSsize_t(__pyx_v_pos); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 742, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_3);\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_4 = __pyx_t_1; __pyx_t_5 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_4))) {\n        __pyx_t_5 = PyMethod_GET_SELF(__pyx_t_4);\n        if (likely(__pyx_t_5)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_4);\n          __Pyx_INCREF(__pyx_t_5);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_4, function);\n        }\n      }\n      if (!__pyx_t_5) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_4, __pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 742, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n        __Pyx_GOTREF(__pyx_t_2);\n      } else {\n        #if CYTHON_FAST_PYCALL\n        if (PyFunction_Check(__pyx_t_4)) {\n          PyObject *__pyx_temp[2] = {__pyx_t_5, __pyx_t_3};\n          __pyx_t_2 = __Pyx_PyFunction_FastCall(__pyx_t_4, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 742, __pyx_L1_error)\n          __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;\n          __Pyx_GOTREF(__pyx_t_2);\n          __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n        } else\n        #endif\n        #if CYTHON_FAST_PYCCALL\n        if (__Pyx_PyFastCFunction_Check(__pyx_t_4)) {\n          PyObject *__pyx_temp[2] = {__pyx_t_5, __pyx_t_3};\n          __pyx_t_2 = __Pyx_PyCFunction_FastCall(__pyx_t_4, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 742, __pyx_L1_error)\n          __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;\n          __Pyx_GOTREF(__pyx_t_2);\n          __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n        } else\n        #endif\n        {\n          __pyx_t_6 = PyTuple_New(1+1); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 742, __pyx_L1_error)\n          __Pyx_GOTREF(__pyx_t_6);\n          __Pyx_GIVEREF(__pyx_t_5); PyTuple_SET_ITEM(__pyx_t_6, 0, __pyx_t_5); __pyx_t_5 = NULL;\n          __Pyx_GIVEREF(__pyx_t_3);\n          PyTuple_SET_ITEM(__pyx_t_6, 0+1, __pyx_t_3);\n          __pyx_t_3 = 0;\n          __pyx_t_2 = __Pyx_PyObject_Call(__pyx_t_4, __pyx_t_6, NULL); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 742, __pyx_L1_error)\n          __Pyx_GOTREF(__pyx_t_2);\n          __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n        }\n      }\n      __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      __pyx_t_7 = __Pyx_PyInt_As_int64_t(__pyx_t_2); if (unlikely((__pyx_t_7 == ((int64_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 742, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __pyx_r = __pyx_t_7;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":754\n *       The integer index of the n-th key, or NO_LABEL if not found.\n *     \"\"\"\n *     return self._table.GetNthKey(pos)             # <<<<<<<<<<<<<<\n * \n *   cpdef string labeled_checksum(self):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_table\");\n    __PYX_ERR(0, 754, __pyx_L1_error)\n  }\n  __pyx_r = __pyx_v_self->_table->GetNthKey(__pyx_v_pos);\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":742\n *       return self._table.FindSymbol(key)\n * \n *   cpdef int64 get_nth_key(self, ssize_t pos) except *:             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     get_nth_key(self, pos)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_XDECREF(__pyx_t_6);\n  __Pyx_AddTraceback(\"pywrapfst._SymbolTable.get_nth_key\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_12_SymbolTable_13get_nth_key(PyObject *__pyx_v_self, PyObject *__pyx_arg_pos); /*proto*/\nstatic char __pyx_doc_9pywrapfst_12_SymbolTable_12get_nth_key[] = \"\\n    get_nth_key(self, pos)\\n\\n    Retrieves the integer index of the n-th key in the table.\\n\\n    Args:\\n      pos: The n-th key to retrieve.\\n\\n    Returns:\\n      The integer index of the n-th key, or NO_LABEL if not found.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_12_SymbolTable_13get_nth_key(PyObject *__pyx_v_self, PyObject *__pyx_arg_pos) {\n  Py_ssize_t __pyx_v_pos;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"get_nth_key (wrapper)\", 0);\n  assert(__pyx_arg_pos); {\n    __pyx_v_pos = PyInt_AsSsize_t(__pyx_arg_pos); if (unlikely((__pyx_v_pos == (Py_ssize_t)-1) && PyErr_Occurred())) __PYX_ERR(0, 742, __pyx_L3_error)\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst._SymbolTable.get_nth_key\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  __pyx_r = __pyx_pf_9pywrapfst_12_SymbolTable_12get_nth_key(((struct __pyx_obj_9pywrapfst__SymbolTable *)__pyx_v_self), ((Py_ssize_t)__pyx_v_pos));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_12_SymbolTable_12get_nth_key(struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_self, Py_ssize_t __pyx_v_pos) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  __pyx_t_10basictypes_int64 __pyx_t_1;\n  PyObject *__pyx_t_2 = NULL;\n  __Pyx_RefNannySetupContext(\"get_nth_key\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __pyx_f_9pywrapfst_12_SymbolTable_get_nth_key(__pyx_v_self, __pyx_v_pos, 1); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 742, __pyx_L1_error)\n  __pyx_t_2 = __Pyx_PyInt_From_int64_t(__pyx_t_1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 742, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  __pyx_r = __pyx_t_2;\n  __pyx_t_2 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_AddTraceback(\"pywrapfst._SymbolTable.get_nth_key\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":756\n *     return self._table.GetNthKey(pos)\n * \n *   cpdef string labeled_checksum(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     labeled_checksum(self)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_12_SymbolTable_15labeled_checksum(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic std::string __pyx_f_9pywrapfst_12_SymbolTable_labeled_checksum(struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_self, int __pyx_skip_dispatch) {\n  std::string __pyx_r;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  std::string __pyx_t_5;\n  __Pyx_RefNannySetupContext(\"labeled_checksum\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_labeled_checksum); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 756, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_12_SymbolTable_15labeled_checksum)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 756, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 756, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __pyx_t_5 = __pyx_convert_string_from_py_std__in_string(__pyx_t_2); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 756, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __pyx_r = __pyx_t_5;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":762\n *     Returns a string indicating the label-dependent MD5 checksum for the table.\n *     \"\"\"\n *     return self._table.LabeledCheckSum()             # <<<<<<<<<<<<<<\n * \n *   cpdef bool member(self, key):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_table\");\n    __PYX_ERR(0, 762, __pyx_L1_error)\n  }\n  __pyx_r = __pyx_v_self->_table->LabeledCheckSum();\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":756\n *     return self._table.GetNthKey(pos)\n * \n *   cpdef string labeled_checksum(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     labeled_checksum(self)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_WriteUnraisable(\"pywrapfst._SymbolTable.labeled_checksum\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __Pyx_pretend_to_initialize(&__pyx_r);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_12_SymbolTable_15labeled_checksum(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_12_SymbolTable_14labeled_checksum[] = \"\\n    labeled_checksum(self)\\n\\n    Returns a string indicating the label-dependent MD5 checksum for the table.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_12_SymbolTable_15labeled_checksum(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"labeled_checksum (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_12_SymbolTable_14labeled_checksum(((struct __pyx_obj_9pywrapfst__SymbolTable *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_12_SymbolTable_14labeled_checksum(struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"labeled_checksum\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __pyx_convert_PyBytes_string_to_py_std__in_string(__pyx_f_9pywrapfst_12_SymbolTable_labeled_checksum(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 756, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst._SymbolTable.labeled_checksum\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":764\n *     return self._table.LabeledCheckSum()\n * \n *   cpdef bool member(self, key):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     member(self, key)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_12_SymbolTable_17member(PyObject *__pyx_v_self, PyObject *__pyx_v_key); /*proto*/\nstatic bool __pyx_f_9pywrapfst_12_SymbolTable_member(struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_self, PyObject *__pyx_v_key, int __pyx_skip_dispatch) {\n  bool __pyx_r;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  bool __pyx_t_6;\n  PyObject *__pyx_t_7 = NULL;\n  PyObject *__pyx_t_8 = NULL;\n  PyObject *__pyx_t_9 = NULL;\n  std::string __pyx_t_10;\n  int __pyx_t_11;\n  __pyx_t_10basictypes_int64 __pyx_t_12;\n  __Pyx_RefNannySetupContext(\"member\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_member); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 764, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_12_SymbolTable_17member)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (!__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_v_key); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 764, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_2);\n      } else {\n        #if CYTHON_FAST_PYCALL\n        if (PyFunction_Check(__pyx_t_3)) {\n          PyObject *__pyx_temp[2] = {__pyx_t_4, __pyx_v_key};\n          __pyx_t_2 = __Pyx_PyFunction_FastCall(__pyx_t_3, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 764, __pyx_L1_error)\n          __Pyx_XDECREF(__pyx_t_4); __pyx_t_4 = 0;\n          __Pyx_GOTREF(__pyx_t_2);\n        } else\n        #endif\n        #if CYTHON_FAST_PYCCALL\n        if (__Pyx_PyFastCFunction_Check(__pyx_t_3)) {\n          PyObject *__pyx_temp[2] = {__pyx_t_4, __pyx_v_key};\n          __pyx_t_2 = __Pyx_PyCFunction_FastCall(__pyx_t_3, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 764, __pyx_L1_error)\n          __Pyx_XDECREF(__pyx_t_4); __pyx_t_4 = 0;\n          __Pyx_GOTREF(__pyx_t_2);\n        } else\n        #endif\n        {\n          __pyx_t_5 = PyTuple_New(1+1); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 764, __pyx_L1_error)\n          __Pyx_GOTREF(__pyx_t_5);\n          __Pyx_GIVEREF(__pyx_t_4); PyTuple_SET_ITEM(__pyx_t_5, 0, __pyx_t_4); __pyx_t_4 = NULL;\n          __Pyx_INCREF(__pyx_v_key);\n          __Pyx_GIVEREF(__pyx_v_key);\n          PyTuple_SET_ITEM(__pyx_t_5, 0+1, __pyx_v_key);\n          __pyx_t_2 = __Pyx_PyObject_Call(__pyx_t_3, __pyx_t_5, NULL); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 764, __pyx_L1_error)\n          __Pyx_GOTREF(__pyx_t_2);\n          __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n        }\n      }\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __pyx_t_6 = __Pyx_PyObject_IsTrue(__pyx_t_2); if (unlikely((__pyx_t_6 == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 764, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __pyx_r = __pyx_t_6;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":780\n *       Whether or not the key is present (as a string or a index) in the table.\n *     \"\"\"\n *     try:             # <<<<<<<<<<<<<<\n *       return self._table.MemberSymbol(tostring(key))\n *     except FstArgError:\n */\n  {\n    __Pyx_PyThreadState_declare\n    __Pyx_PyThreadState_assign\n    __Pyx_ExceptionSave(&__pyx_t_7, &__pyx_t_8, &__pyx_t_9);\n    __Pyx_XGOTREF(__pyx_t_7);\n    __Pyx_XGOTREF(__pyx_t_8);\n    __Pyx_XGOTREF(__pyx_t_9);\n    /*try:*/ {\n\n      /* \"pywrapfst.pyx\":781\n *     \"\"\"\n *     try:\n *       return self._table.MemberSymbol(tostring(key))             # <<<<<<<<<<<<<<\n *     except FstArgError:\n *       return self._table.MemberIndex(key)\n */\n      if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n        PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_table\");\n        __PYX_ERR(0, 781, __pyx_L3_error)\n      }\n      __pyx_t_10 = __pyx_f_9pywrapfst_tostring(__pyx_v_key, NULL); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 781, __pyx_L3_error)\n      __pyx_r = __pyx_v_self->_table->Member(__pyx_t_10);\n      goto __pyx_L7_try_return;\n\n      /* \"pywrapfst.pyx\":780\n *       Whether or not the key is present (as a string or a index) in the table.\n *     \"\"\"\n *     try:             # <<<<<<<<<<<<<<\n *       return self._table.MemberSymbol(tostring(key))\n *     except FstArgError:\n */\n    }\n    __pyx_L3_error:;\n    __Pyx_XDECREF(__pyx_t_4); __pyx_t_4 = 0;\n    __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;\n    __Pyx_XDECREF(__pyx_t_3); __pyx_t_3 = 0;\n    __Pyx_XDECREF(__pyx_t_2); __pyx_t_2 = 0;\n    __Pyx_XDECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n    /* \"pywrapfst.pyx\":782\n *     try:\n *       return self._table.MemberSymbol(tostring(key))\n *     except FstArgError:             # <<<<<<<<<<<<<<\n *       return self._table.MemberIndex(key)\n * \n */\n    __pyx_t_1 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstArgError); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 782, __pyx_L5_except_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    __pyx_t_11 = __Pyx_PyErr_ExceptionMatches(__pyx_t_1);\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n    if (__pyx_t_11) {\n      __Pyx_AddTraceback(\"pywrapfst._SymbolTable.member\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n      if (__Pyx_GetException(&__pyx_t_1, &__pyx_t_2, &__pyx_t_3) < 0) __PYX_ERR(0, 782, __pyx_L5_except_error)\n      __Pyx_GOTREF(__pyx_t_1);\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_GOTREF(__pyx_t_3);\n\n      /* \"pywrapfst.pyx\":783\n *       return self._table.MemberSymbol(tostring(key))\n *     except FstArgError:\n *       return self._table.MemberIndex(key)             # <<<<<<<<<<<<<<\n * \n *   def __contains__(self, key):\n */\n      if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n        PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_table\");\n        __PYX_ERR(0, 783, __pyx_L5_except_error)\n      }\n      __pyx_t_12 = __Pyx_PyInt_As_int64_t(__pyx_v_key); if (unlikely((__pyx_t_12 == ((int64_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 783, __pyx_L5_except_error)\n      __pyx_r = __pyx_v_self->_table->Member(__pyx_t_12);\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      goto __pyx_L6_except_return;\n    }\n    goto __pyx_L5_except_error;\n    __pyx_L5_except_error:;\n\n    /* \"pywrapfst.pyx\":780\n *       Whether or not the key is present (as a string or a index) in the table.\n *     \"\"\"\n *     try:             # <<<<<<<<<<<<<<\n *       return self._table.MemberSymbol(tostring(key))\n *     except FstArgError:\n */\n    __Pyx_XGIVEREF(__pyx_t_7);\n    __Pyx_XGIVEREF(__pyx_t_8);\n    __Pyx_XGIVEREF(__pyx_t_9);\n    __Pyx_ExceptionReset(__pyx_t_7, __pyx_t_8, __pyx_t_9);\n    goto __pyx_L1_error;\n    __pyx_L7_try_return:;\n    __Pyx_XGIVEREF(__pyx_t_7);\n    __Pyx_XGIVEREF(__pyx_t_8);\n    __Pyx_XGIVEREF(__pyx_t_9);\n    __Pyx_ExceptionReset(__pyx_t_7, __pyx_t_8, __pyx_t_9);\n    goto __pyx_L0;\n    __pyx_L6_except_return:;\n    __Pyx_XGIVEREF(__pyx_t_7);\n    __Pyx_XGIVEREF(__pyx_t_8);\n    __Pyx_XGIVEREF(__pyx_t_9);\n    __Pyx_ExceptionReset(__pyx_t_7, __pyx_t_8, __pyx_t_9);\n    goto __pyx_L0;\n  }\n\n  /* \"pywrapfst.pyx\":764\n *     return self._table.LabeledCheckSum()\n * \n *   cpdef bool member(self, key):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     member(self, key)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_WriteUnraisable(\"pywrapfst._SymbolTable.member\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_12_SymbolTable_17member(PyObject *__pyx_v_self, PyObject *__pyx_v_key); /*proto*/\nstatic char __pyx_doc_9pywrapfst_12_SymbolTable_16member[] = \"\\n    member(self, key)\\n\\n    Given a symbol or index, returns whether it is found in the table.\\n\\n    This method returns a boolean indicating whether the given symbol or index\\n    is present in the table. If one intends to perform subsequent lookup, it is\\n    better to simply call the find method, catching the KeyError.\\n\\n    Args:\\n      key: Either a string or an index.\\n\\n    Returns:\\n      Whether or not the key is present (as a string or a index) in the table.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_12_SymbolTable_17member(PyObject *__pyx_v_self, PyObject *__pyx_v_key) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"member (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_12_SymbolTable_16member(((struct __pyx_obj_9pywrapfst__SymbolTable *)__pyx_v_self), ((PyObject *)__pyx_v_key));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_12_SymbolTable_16member(struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_self, PyObject *__pyx_v_key) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"member\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __Pyx_PyBool_FromLong(__pyx_f_9pywrapfst_12_SymbolTable_member(__pyx_v_self, __pyx_v_key, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 764, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst._SymbolTable.member\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":785\n *       return self._table.MemberIndex(key)\n * \n *   def __contains__(self, key):             # <<<<<<<<<<<<<<\n *     return self.member(key)\n * \n */\n\n/* Python wrapper */\nstatic int __pyx_pw_9pywrapfst_12_SymbolTable_19__contains__(PyObject *__pyx_v_self, PyObject *__pyx_v_key); /*proto*/\nstatic int __pyx_pw_9pywrapfst_12_SymbolTable_19__contains__(PyObject *__pyx_v_self, PyObject *__pyx_v_key) {\n  int __pyx_r;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__contains__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_12_SymbolTable_18__contains__(((struct __pyx_obj_9pywrapfst__SymbolTable *)__pyx_v_self), ((PyObject *)__pyx_v_key));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic int __pyx_pf_9pywrapfst_12_SymbolTable_18__contains__(struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_self, PyObject *__pyx_v_key) {\n  int __pyx_r;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__contains__\", 0);\n\n  /* \"pywrapfst.pyx\":786\n * \n *   def __contains__(self, key):\n *     return self.member(key)             # <<<<<<<<<<<<<<\n * \n *   cpdef string name(self):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"member\");\n    __PYX_ERR(0, 786, __pyx_L1_error)\n  }\n  __pyx_r = ((struct __pyx_vtabstruct_9pywrapfst__SymbolTable *)__pyx_v_self->__pyx_vtab)->member(__pyx_v_self, __pyx_v_key, 0);\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":785\n *       return self._table.MemberIndex(key)\n * \n *   def __contains__(self, key):             # <<<<<<<<<<<<<<\n *     return self.member(key)\n * \n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"pywrapfst._SymbolTable.__contains__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = -1;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":788\n *     return self.member(key)\n * \n *   cpdef string name(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     name(self)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_12_SymbolTable_21name(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic std::string __pyx_f_9pywrapfst_12_SymbolTable_name(struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_self, int __pyx_skip_dispatch) {\n  std::string __pyx_r;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  std::string __pyx_t_5;\n  __Pyx_RefNannySetupContext(\"name\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_name_2); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 788, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_12_SymbolTable_21name)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 788, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 788, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __pyx_t_5 = __pyx_convert_string_from_py_std__in_string(__pyx_t_2); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 788, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __pyx_r = __pyx_t_5;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":794\n *     Returns the symbol table's name.\n *     \"\"\"\n *     return self._table.Name()             # <<<<<<<<<<<<<<\n * \n *   cpdef size_t num_symbols(self):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_table\");\n    __PYX_ERR(0, 794, __pyx_L1_error)\n  }\n  __pyx_r = __pyx_v_self->_table->Name();\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":788\n *     return self.member(key)\n * \n *   cpdef string name(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     name(self)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_WriteUnraisable(\"pywrapfst._SymbolTable.name\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __Pyx_pretend_to_initialize(&__pyx_r);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_12_SymbolTable_21name(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_12_SymbolTable_20name[] = \"\\n    name(self)\\n\\n    Returns the symbol table's name.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_12_SymbolTable_21name(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"name (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_12_SymbolTable_20name(((struct __pyx_obj_9pywrapfst__SymbolTable *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_12_SymbolTable_20name(struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"name\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __pyx_convert_PyBytes_string_to_py_std__in_string(__pyx_f_9pywrapfst_12_SymbolTable_name(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 788, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst._SymbolTable.name\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":796\n *     return self._table.Name()\n * \n *   cpdef size_t num_symbols(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     num_symbols(self)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_12_SymbolTable_23num_symbols(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic size_t __pyx_f_9pywrapfst_12_SymbolTable_num_symbols(struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_self, int __pyx_skip_dispatch) {\n  size_t __pyx_r;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  size_t __pyx_t_5;\n  __Pyx_RefNannySetupContext(\"num_symbols\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_num_symbols); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 796, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_12_SymbolTable_23num_symbols)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 796, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 796, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __pyx_t_5 = __Pyx_PyInt_As_size_t(__pyx_t_2); if (unlikely((__pyx_t_5 == (size_t)-1) && PyErr_Occurred())) __PYX_ERR(0, 796, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __pyx_r = __pyx_t_5;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":802\n *     Returns the number of symbols in the symbol table.\n *     \"\"\"\n *     return self._table.NumSymbols()             # <<<<<<<<<<<<<<\n * \n *   cpdef void write(self, filename) except *:\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_table\");\n    __PYX_ERR(0, 802, __pyx_L1_error)\n  }\n  __pyx_r = __pyx_v_self->_table->NumSymbols();\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":796\n *     return self._table.Name()\n * \n *   cpdef size_t num_symbols(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     num_symbols(self)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_WriteUnraisable(\"pywrapfst._SymbolTable.num_symbols\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_12_SymbolTable_23num_symbols(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_12_SymbolTable_22num_symbols[] = \"\\n    num_symbols(self)\\n\\n    Returns the number of symbols in the symbol table.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_12_SymbolTable_23num_symbols(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"num_symbols (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_12_SymbolTable_22num_symbols(((struct __pyx_obj_9pywrapfst__SymbolTable *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_12_SymbolTable_22num_symbols(struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"num_symbols\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __Pyx_PyInt_FromSize_t(__pyx_f_9pywrapfst_12_SymbolTable_num_symbols(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 796, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst._SymbolTable.num_symbols\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":804\n *     return self._table.NumSymbols()\n * \n *   cpdef void write(self, filename) except *:             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     write(self, filename)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_12_SymbolTable_25write(PyObject *__pyx_v_self, PyObject *__pyx_v_filename); /*proto*/\nstatic void __pyx_f_9pywrapfst_12_SymbolTable_write(struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_self, PyObject *__pyx_v_filename, int __pyx_skip_dispatch) {\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  std::string __pyx_t_6;\n  int __pyx_t_7;\n  PyObject *__pyx_t_8 = NULL;\n  __Pyx_RefNannySetupContext(\"write\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_write); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 804, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_12_SymbolTable_25write)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (!__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_v_filename); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 804, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_2);\n      } else {\n        #if CYTHON_FAST_PYCALL\n        if (PyFunction_Check(__pyx_t_3)) {\n          PyObject *__pyx_temp[2] = {__pyx_t_4, __pyx_v_filename};\n          __pyx_t_2 = __Pyx_PyFunction_FastCall(__pyx_t_3, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 804, __pyx_L1_error)\n          __Pyx_XDECREF(__pyx_t_4); __pyx_t_4 = 0;\n          __Pyx_GOTREF(__pyx_t_2);\n        } else\n        #endif\n        #if CYTHON_FAST_PYCCALL\n        if (__Pyx_PyFastCFunction_Check(__pyx_t_3)) {\n          PyObject *__pyx_temp[2] = {__pyx_t_4, __pyx_v_filename};\n          __pyx_t_2 = __Pyx_PyCFunction_FastCall(__pyx_t_3, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 804, __pyx_L1_error)\n          __Pyx_XDECREF(__pyx_t_4); __pyx_t_4 = 0;\n          __Pyx_GOTREF(__pyx_t_2);\n        } else\n        #endif\n        {\n          __pyx_t_5 = PyTuple_New(1+1); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 804, __pyx_L1_error)\n          __Pyx_GOTREF(__pyx_t_5);\n          __Pyx_GIVEREF(__pyx_t_4); PyTuple_SET_ITEM(__pyx_t_5, 0, __pyx_t_4); __pyx_t_4 = NULL;\n          __Pyx_INCREF(__pyx_v_filename);\n          __Pyx_GIVEREF(__pyx_v_filename);\n          PyTuple_SET_ITEM(__pyx_t_5, 0+1, __pyx_v_filename);\n          __pyx_t_2 = __Pyx_PyObject_Call(__pyx_t_3, __pyx_t_5, NULL); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 804, __pyx_L1_error)\n          __Pyx_GOTREF(__pyx_t_2);\n          __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n        }\n      }\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":818\n *       FstIOError: Write failed.\n *     \"\"\"\n *     if not self._table.Write(tostring(filename)):             # <<<<<<<<<<<<<<\n *       raise FstIOError(\"Write failed: {!r}\".format(filename))\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_table\");\n    __PYX_ERR(0, 818, __pyx_L1_error)\n  }\n  __pyx_t_6 = __pyx_f_9pywrapfst_tostring(__pyx_v_filename, NULL); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 818, __pyx_L1_error)\n  __pyx_t_7 = ((!(__pyx_v_self->_table->Write(__pyx_t_6) != 0)) != 0);\n  if (__pyx_t_7) {\n\n    /* \"pywrapfst.pyx\":819\n *     \"\"\"\n *     if not self._table.Write(tostring(filename)):\n *       raise FstIOError(\"Write failed: {!r}\".format(filename))             # <<<<<<<<<<<<<<\n * \n *   cpdef void write_text(self, filename) except *:\n */\n    __pyx_t_2 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstIOError); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 819, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_2);\n    __pyx_t_5 = __Pyx_PyObject_GetAttrStr(__pyx_kp_s_Write_failed_r, __pyx_n_s_format); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 819, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_5);\n    __pyx_t_4 = NULL;\n    if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_5))) {\n      __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_5);\n      if (likely(__pyx_t_4)) {\n        PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_5);\n        __Pyx_INCREF(__pyx_t_4);\n        __Pyx_INCREF(function);\n        __Pyx_DECREF_SET(__pyx_t_5, function);\n      }\n    }\n    if (!__pyx_t_4) {\n      __pyx_t_3 = __Pyx_PyObject_CallOneArg(__pyx_t_5, __pyx_v_filename); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 819, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_3);\n    } else {\n      #if CYTHON_FAST_PYCALL\n      if (PyFunction_Check(__pyx_t_5)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_4, __pyx_v_filename};\n        __pyx_t_3 = __Pyx_PyFunction_FastCall(__pyx_t_5, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 819, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_4); __pyx_t_4 = 0;\n        __Pyx_GOTREF(__pyx_t_3);\n      } else\n      #endif\n      #if CYTHON_FAST_PYCCALL\n      if (__Pyx_PyFastCFunction_Check(__pyx_t_5)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_4, __pyx_v_filename};\n        __pyx_t_3 = __Pyx_PyCFunction_FastCall(__pyx_t_5, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 819, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_4); __pyx_t_4 = 0;\n        __Pyx_GOTREF(__pyx_t_3);\n      } else\n      #endif\n      {\n        __pyx_t_8 = PyTuple_New(1+1); if (unlikely(!__pyx_t_8)) __PYX_ERR(0, 819, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_8);\n        __Pyx_GIVEREF(__pyx_t_4); PyTuple_SET_ITEM(__pyx_t_8, 0, __pyx_t_4); __pyx_t_4 = NULL;\n        __Pyx_INCREF(__pyx_v_filename);\n        __Pyx_GIVEREF(__pyx_v_filename);\n        PyTuple_SET_ITEM(__pyx_t_8, 0+1, __pyx_v_filename);\n        __pyx_t_3 = __Pyx_PyObject_Call(__pyx_t_5, __pyx_t_8, NULL); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 819, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_3);\n        __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0;\n      }\n    }\n    __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n    __pyx_t_5 = NULL;\n    if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_2))) {\n      __pyx_t_5 = PyMethod_GET_SELF(__pyx_t_2);\n      if (likely(__pyx_t_5)) {\n        PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_2);\n        __Pyx_INCREF(__pyx_t_5);\n        __Pyx_INCREF(function);\n        __Pyx_DECREF_SET(__pyx_t_2, function);\n      }\n    }\n    if (!__pyx_t_5) {\n      __pyx_t_1 = __Pyx_PyObject_CallOneArg(__pyx_t_2, __pyx_t_3); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 819, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __Pyx_GOTREF(__pyx_t_1);\n    } else {\n      #if CYTHON_FAST_PYCALL\n      if (PyFunction_Check(__pyx_t_2)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_5, __pyx_t_3};\n        __pyx_t_1 = __Pyx_PyFunction_FastCall(__pyx_t_2, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 819, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;\n        __Pyx_GOTREF(__pyx_t_1);\n        __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      } else\n      #endif\n      #if CYTHON_FAST_PYCCALL\n      if (__Pyx_PyFastCFunction_Check(__pyx_t_2)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_5, __pyx_t_3};\n        __pyx_t_1 = __Pyx_PyCFunction_FastCall(__pyx_t_2, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 819, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;\n        __Pyx_GOTREF(__pyx_t_1);\n        __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      } else\n      #endif\n      {\n        __pyx_t_8 = PyTuple_New(1+1); if (unlikely(!__pyx_t_8)) __PYX_ERR(0, 819, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_8);\n        __Pyx_GIVEREF(__pyx_t_5); PyTuple_SET_ITEM(__pyx_t_8, 0, __pyx_t_5); __pyx_t_5 = NULL;\n        __Pyx_GIVEREF(__pyx_t_3);\n        PyTuple_SET_ITEM(__pyx_t_8, 0+1, __pyx_t_3);\n        __pyx_t_3 = 0;\n        __pyx_t_1 = __Pyx_PyObject_Call(__pyx_t_2, __pyx_t_8, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 819, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_1);\n        __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0;\n      }\n    }\n    __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n    __Pyx_Raise(__pyx_t_1, 0, 0, 0);\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n    __PYX_ERR(0, 819, __pyx_L1_error)\n\n    /* \"pywrapfst.pyx\":818\n *       FstIOError: Write failed.\n *     \"\"\"\n *     if not self._table.Write(tostring(filename)):             # <<<<<<<<<<<<<<\n *       raise FstIOError(\"Write failed: {!r}\".format(filename))\n * \n */\n  }\n\n  /* \"pywrapfst.pyx\":804\n *     return self._table.NumSymbols()\n * \n *   cpdef void write(self, filename) except *:             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     write(self, filename)\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_XDECREF(__pyx_t_8);\n  __Pyx_AddTraceback(\"pywrapfst._SymbolTable.write\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_12_SymbolTable_25write(PyObject *__pyx_v_self, PyObject *__pyx_v_filename); /*proto*/\nstatic char __pyx_doc_9pywrapfst_12_SymbolTable_24write[] = \"\\n    write(self, filename)\\n\\n    Serializes symbol table to a file.\\n\\n    This methods writes the SymbolTable to a file in binary format.\\n\\n    Args:\\n      filename: The string location of the output file.\\n\\n    Raises:\\n      FstIOError: Write failed.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_12_SymbolTable_25write(PyObject *__pyx_v_self, PyObject *__pyx_v_filename) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"write (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_12_SymbolTable_24write(((struct __pyx_obj_9pywrapfst__SymbolTable *)__pyx_v_self), ((PyObject *)__pyx_v_filename));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_12_SymbolTable_24write(struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_self, PyObject *__pyx_v_filename) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"write\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_f_9pywrapfst_12_SymbolTable_write(__pyx_v_self, __pyx_v_filename, 1); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 804, __pyx_L1_error)\n  __pyx_t_1 = __Pyx_void_to_None(NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 804, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst._SymbolTable.write\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":821\n *       raise FstIOError(\"Write failed: {!r}\".format(filename))\n * \n *   cpdef void write_text(self, filename) except *:             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     write_text(self, filename)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_12_SymbolTable_27write_text(PyObject *__pyx_v_self, PyObject *__pyx_v_filename); /*proto*/\nstatic void __pyx_f_9pywrapfst_12_SymbolTable_write_text(struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_self, PyObject *__pyx_v_filename, int __pyx_skip_dispatch) {\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  std::string __pyx_t_6;\n  int __pyx_t_7;\n  PyObject *__pyx_t_8 = NULL;\n  __Pyx_RefNannySetupContext(\"write_text\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_write_text); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 821, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_12_SymbolTable_27write_text)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (!__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_v_filename); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 821, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_2);\n      } else {\n        #if CYTHON_FAST_PYCALL\n        if (PyFunction_Check(__pyx_t_3)) {\n          PyObject *__pyx_temp[2] = {__pyx_t_4, __pyx_v_filename};\n          __pyx_t_2 = __Pyx_PyFunction_FastCall(__pyx_t_3, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 821, __pyx_L1_error)\n          __Pyx_XDECREF(__pyx_t_4); __pyx_t_4 = 0;\n          __Pyx_GOTREF(__pyx_t_2);\n        } else\n        #endif\n        #if CYTHON_FAST_PYCCALL\n        if (__Pyx_PyFastCFunction_Check(__pyx_t_3)) {\n          PyObject *__pyx_temp[2] = {__pyx_t_4, __pyx_v_filename};\n          __pyx_t_2 = __Pyx_PyCFunction_FastCall(__pyx_t_3, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 821, __pyx_L1_error)\n          __Pyx_XDECREF(__pyx_t_4); __pyx_t_4 = 0;\n          __Pyx_GOTREF(__pyx_t_2);\n        } else\n        #endif\n        {\n          __pyx_t_5 = PyTuple_New(1+1); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 821, __pyx_L1_error)\n          __Pyx_GOTREF(__pyx_t_5);\n          __Pyx_GIVEREF(__pyx_t_4); PyTuple_SET_ITEM(__pyx_t_5, 0, __pyx_t_4); __pyx_t_4 = NULL;\n          __Pyx_INCREF(__pyx_v_filename);\n          __Pyx_GIVEREF(__pyx_v_filename);\n          PyTuple_SET_ITEM(__pyx_t_5, 0+1, __pyx_v_filename);\n          __pyx_t_2 = __Pyx_PyObject_Call(__pyx_t_3, __pyx_t_5, NULL); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 821, __pyx_L1_error)\n          __Pyx_GOTREF(__pyx_t_2);\n          __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n        }\n      }\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":835\n *       FstIOError: Write failed.\n *     \"\"\"\n *     if not self._table.WriteText(tostring(filename)):             # <<<<<<<<<<<<<<\n *       raise FstIOError(\"Write failed: {!r}\".format(filename))\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_table\");\n    __PYX_ERR(0, 835, __pyx_L1_error)\n  }\n  __pyx_t_6 = __pyx_f_9pywrapfst_tostring(__pyx_v_filename, NULL); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 835, __pyx_L1_error)\n  __pyx_t_7 = ((!(__pyx_v_self->_table->WriteText(__pyx_t_6) != 0)) != 0);\n  if (__pyx_t_7) {\n\n    /* \"pywrapfst.pyx\":836\n *     \"\"\"\n *     if not self._table.WriteText(tostring(filename)):\n *       raise FstIOError(\"Write failed: {!r}\".format(filename))             # <<<<<<<<<<<<<<\n * \n * \n */\n    __pyx_t_2 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstIOError); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 836, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_2);\n    __pyx_t_5 = __Pyx_PyObject_GetAttrStr(__pyx_kp_s_Write_failed_r, __pyx_n_s_format); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 836, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_5);\n    __pyx_t_4 = NULL;\n    if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_5))) {\n      __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_5);\n      if (likely(__pyx_t_4)) {\n        PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_5);\n        __Pyx_INCREF(__pyx_t_4);\n        __Pyx_INCREF(function);\n        __Pyx_DECREF_SET(__pyx_t_5, function);\n      }\n    }\n    if (!__pyx_t_4) {\n      __pyx_t_3 = __Pyx_PyObject_CallOneArg(__pyx_t_5, __pyx_v_filename); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 836, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_3);\n    } else {\n      #if CYTHON_FAST_PYCALL\n      if (PyFunction_Check(__pyx_t_5)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_4, __pyx_v_filename};\n        __pyx_t_3 = __Pyx_PyFunction_FastCall(__pyx_t_5, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 836, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_4); __pyx_t_4 = 0;\n        __Pyx_GOTREF(__pyx_t_3);\n      } else\n      #endif\n      #if CYTHON_FAST_PYCCALL\n      if (__Pyx_PyFastCFunction_Check(__pyx_t_5)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_4, __pyx_v_filename};\n        __pyx_t_3 = __Pyx_PyCFunction_FastCall(__pyx_t_5, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 836, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_4); __pyx_t_4 = 0;\n        __Pyx_GOTREF(__pyx_t_3);\n      } else\n      #endif\n      {\n        __pyx_t_8 = PyTuple_New(1+1); if (unlikely(!__pyx_t_8)) __PYX_ERR(0, 836, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_8);\n        __Pyx_GIVEREF(__pyx_t_4); PyTuple_SET_ITEM(__pyx_t_8, 0, __pyx_t_4); __pyx_t_4 = NULL;\n        __Pyx_INCREF(__pyx_v_filename);\n        __Pyx_GIVEREF(__pyx_v_filename);\n        PyTuple_SET_ITEM(__pyx_t_8, 0+1, __pyx_v_filename);\n        __pyx_t_3 = __Pyx_PyObject_Call(__pyx_t_5, __pyx_t_8, NULL); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 836, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_3);\n        __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0;\n      }\n    }\n    __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n    __pyx_t_5 = NULL;\n    if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_2))) {\n      __pyx_t_5 = PyMethod_GET_SELF(__pyx_t_2);\n      if (likely(__pyx_t_5)) {\n        PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_2);\n        __Pyx_INCREF(__pyx_t_5);\n        __Pyx_INCREF(function);\n        __Pyx_DECREF_SET(__pyx_t_2, function);\n      }\n    }\n    if (!__pyx_t_5) {\n      __pyx_t_1 = __Pyx_PyObject_CallOneArg(__pyx_t_2, __pyx_t_3); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 836, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __Pyx_GOTREF(__pyx_t_1);\n    } else {\n      #if CYTHON_FAST_PYCALL\n      if (PyFunction_Check(__pyx_t_2)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_5, __pyx_t_3};\n        __pyx_t_1 = __Pyx_PyFunction_FastCall(__pyx_t_2, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 836, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;\n        __Pyx_GOTREF(__pyx_t_1);\n        __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      } else\n      #endif\n      #if CYTHON_FAST_PYCCALL\n      if (__Pyx_PyFastCFunction_Check(__pyx_t_2)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_5, __pyx_t_3};\n        __pyx_t_1 = __Pyx_PyCFunction_FastCall(__pyx_t_2, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 836, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;\n        __Pyx_GOTREF(__pyx_t_1);\n        __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      } else\n      #endif\n      {\n        __pyx_t_8 = PyTuple_New(1+1); if (unlikely(!__pyx_t_8)) __PYX_ERR(0, 836, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_8);\n        __Pyx_GIVEREF(__pyx_t_5); PyTuple_SET_ITEM(__pyx_t_8, 0, __pyx_t_5); __pyx_t_5 = NULL;\n        __Pyx_GIVEREF(__pyx_t_3);\n        PyTuple_SET_ITEM(__pyx_t_8, 0+1, __pyx_t_3);\n        __pyx_t_3 = 0;\n        __pyx_t_1 = __Pyx_PyObject_Call(__pyx_t_2, __pyx_t_8, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 836, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_1);\n        __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0;\n      }\n    }\n    __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n    __Pyx_Raise(__pyx_t_1, 0, 0, 0);\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n    __PYX_ERR(0, 836, __pyx_L1_error)\n\n    /* \"pywrapfst.pyx\":835\n *       FstIOError: Write failed.\n *     \"\"\"\n *     if not self._table.WriteText(tostring(filename)):             # <<<<<<<<<<<<<<\n *       raise FstIOError(\"Write failed: {!r}\".format(filename))\n * \n */\n  }\n\n  /* \"pywrapfst.pyx\":821\n *       raise FstIOError(\"Write failed: {!r}\".format(filename))\n * \n *   cpdef void write_text(self, filename) except *:             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     write_text(self, filename)\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_XDECREF(__pyx_t_8);\n  __Pyx_AddTraceback(\"pywrapfst._SymbolTable.write_text\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_12_SymbolTable_27write_text(PyObject *__pyx_v_self, PyObject *__pyx_v_filename); /*proto*/\nstatic char __pyx_doc_9pywrapfst_12_SymbolTable_26write_text[] = \"\\n    write_text(self, filename)\\n\\n    Writes symbol table to text file.\\n\\n    This method writes the SymbolTable to a file in human-readable format.\\n\\n    Args:\\n      filename: The string location of the output file.\\n\\n    Raises:\\n      FstIOError: Write failed.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_12_SymbolTable_27write_text(PyObject *__pyx_v_self, PyObject *__pyx_v_filename) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"write_text (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_12_SymbolTable_26write_text(((struct __pyx_obj_9pywrapfst__SymbolTable *)__pyx_v_self), ((PyObject *)__pyx_v_filename));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_12_SymbolTable_26write_text(struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_self, PyObject *__pyx_v_filename) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"write_text\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_f_9pywrapfst_12_SymbolTable_write_text(__pyx_v_self, __pyx_v_filename, 1); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 821, __pyx_L1_error)\n  __pyx_t_1 = __Pyx_void_to_None(NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 821, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst._SymbolTable.write_text\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"(tree fragment)\":1\n * def __reduce_cython__(self):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._table cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_12_SymbolTable_29__reduce_cython__(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_12_SymbolTable_29__reduce_cython__(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__reduce_cython__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_12_SymbolTable_28__reduce_cython__(((struct __pyx_obj_9pywrapfst__SymbolTable *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_12_SymbolTable_28__reduce_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"__reduce_cython__\", 0);\n\n  /* \"(tree fragment)\":2\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._table cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._table cannot be converted to a Python object for pickling\")\n */\n  __pyx_t_1 = __Pyx_PyObject_Call(__pyx_builtin_TypeError, __pyx_tuple__7, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(1, 2, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __Pyx_Raise(__pyx_t_1, 0, 0, 0);\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  __PYX_ERR(1, 2, __pyx_L1_error)\n\n  /* \"(tree fragment)\":1\n * def __reduce_cython__(self):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._table cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst._SymbolTable.__reduce_cython__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"(tree fragment)\":3\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._table cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._table cannot be converted to a Python object for pickling\")\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_12_SymbolTable_31__setstate_cython__(PyObject *__pyx_v_self, PyObject *__pyx_v___pyx_state); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_12_SymbolTable_31__setstate_cython__(PyObject *__pyx_v_self, PyObject *__pyx_v___pyx_state) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__setstate_cython__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_12_SymbolTable_30__setstate_cython__(((struct __pyx_obj_9pywrapfst__SymbolTable *)__pyx_v_self), ((PyObject *)__pyx_v___pyx_state));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_12_SymbolTable_30__setstate_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_self, CYTHON_UNUSED PyObject *__pyx_v___pyx_state) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"__setstate_cython__\", 0);\n\n  /* \"(tree fragment)\":4\n *     raise TypeError(\"self._table cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._table cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n */\n  __pyx_t_1 = __Pyx_PyObject_Call(__pyx_builtin_TypeError, __pyx_tuple__8, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(1, 4, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __Pyx_Raise(__pyx_t_1, 0, 0, 0);\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  __PYX_ERR(1, 4, __pyx_L1_error)\n\n  /* \"(tree fragment)\":3\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._table cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._table cannot be converted to a Python object for pickling\")\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst._SymbolTable.__setstate_cython__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":854\n *   # Doing so will allow undefined behavior.\n * \n *   def __repr__(self):             # <<<<<<<<<<<<<<\n *     return \"<const EncodeMapper SymbolTable {!r} at 0x{:x}>\".format(self.name(),\n *                                                                     id(self))\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_24_EncodeMapperSymbolTable_1__repr__(PyObject *__pyx_v_self); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_24_EncodeMapperSymbolTable_1__repr__(PyObject *__pyx_v_self) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__repr__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_24_EncodeMapperSymbolTable___repr__(((struct __pyx_obj_9pywrapfst__EncodeMapperSymbolTable *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_24_EncodeMapperSymbolTable___repr__(struct __pyx_obj_9pywrapfst__EncodeMapperSymbolTable *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  int __pyx_t_6;\n  PyObject *__pyx_t_7 = NULL;\n  __Pyx_RefNannySetupContext(\"__repr__\", 0);\n\n  /* \"pywrapfst.pyx\":855\n * \n *   def __repr__(self):\n *     return \"<const EncodeMapper SymbolTable {!r} at 0x{:x}>\".format(self.name(),             # <<<<<<<<<<<<<<\n *                                                                     id(self))\n * \n */\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_2 = __Pyx_PyObject_GetAttrStr(__pyx_kp_s_const_EncodeMapper_SymbolTable, __pyx_n_s_format); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 855, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"name\");\n    __PYX_ERR(0, 855, __pyx_L1_error)\n  }\n  __pyx_t_3 = __pyx_convert_PyBytes_string_to_py_std__in_string(((struct __pyx_vtabstruct_9pywrapfst__EncodeMapperSymbolTable *)__pyx_v_self->__pyx_base.__pyx_vtab)->__pyx_base.name(((struct __pyx_obj_9pywrapfst__SymbolTable *)__pyx_v_self), 0)); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 855, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_3);\n\n  /* \"pywrapfst.pyx\":856\n *   def __repr__(self):\n *     return \"<const EncodeMapper SymbolTable {!r} at 0x{:x}>\".format(self.name(),\n *                                                                     id(self))             # <<<<<<<<<<<<<<\n * \n * \n */\n  __pyx_t_4 = PyTuple_New(1); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 856, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_4);\n  __Pyx_INCREF(((PyObject *)__pyx_v_self));\n  __Pyx_GIVEREF(((PyObject *)__pyx_v_self));\n  PyTuple_SET_ITEM(__pyx_t_4, 0, ((PyObject *)__pyx_v_self));\n  __pyx_t_5 = __Pyx_PyObject_Call(__pyx_builtin_id, __pyx_t_4, NULL); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 856, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_5);\n  __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n  __pyx_t_4 = NULL;\n  __pyx_t_6 = 0;\n  if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_2))) {\n    __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_2);\n    if (likely(__pyx_t_4)) {\n      PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_2);\n      __Pyx_INCREF(__pyx_t_4);\n      __Pyx_INCREF(function);\n      __Pyx_DECREF_SET(__pyx_t_2, function);\n      __pyx_t_6 = 1;\n    }\n  }\n  #if CYTHON_FAST_PYCALL\n  if (PyFunction_Check(__pyx_t_2)) {\n    PyObject *__pyx_temp[3] = {__pyx_t_4, __pyx_t_3, __pyx_t_5};\n    __pyx_t_1 = __Pyx_PyFunction_FastCall(__pyx_t_2, __pyx_temp+1-__pyx_t_6, 2+__pyx_t_6); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 855, __pyx_L1_error)\n    __Pyx_XDECREF(__pyx_t_4); __pyx_t_4 = 0;\n    __Pyx_GOTREF(__pyx_t_1);\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n  } else\n  #endif\n  #if CYTHON_FAST_PYCCALL\n  if (__Pyx_PyFastCFunction_Check(__pyx_t_2)) {\n    PyObject *__pyx_temp[3] = {__pyx_t_4, __pyx_t_3, __pyx_t_5};\n    __pyx_t_1 = __Pyx_PyCFunction_FastCall(__pyx_t_2, __pyx_temp+1-__pyx_t_6, 2+__pyx_t_6); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 855, __pyx_L1_error)\n    __Pyx_XDECREF(__pyx_t_4); __pyx_t_4 = 0;\n    __Pyx_GOTREF(__pyx_t_1);\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n  } else\n  #endif\n  {\n    __pyx_t_7 = PyTuple_New(2+__pyx_t_6); if (unlikely(!__pyx_t_7)) __PYX_ERR(0, 855, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_7);\n    if (__pyx_t_4) {\n      __Pyx_GIVEREF(__pyx_t_4); PyTuple_SET_ITEM(__pyx_t_7, 0, __pyx_t_4); __pyx_t_4 = NULL;\n    }\n    __Pyx_GIVEREF(__pyx_t_3);\n    PyTuple_SET_ITEM(__pyx_t_7, 0+__pyx_t_6, __pyx_t_3);\n    __Pyx_GIVEREF(__pyx_t_5);\n    PyTuple_SET_ITEM(__pyx_t_7, 1+__pyx_t_6, __pyx_t_5);\n    __pyx_t_3 = 0;\n    __pyx_t_5 = 0;\n    __pyx_t_1 = __Pyx_PyObject_Call(__pyx_t_2, __pyx_t_7, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 855, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0;\n  }\n  __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":854\n *   # Doing so will allow undefined behavior.\n * \n *   def __repr__(self):             # <<<<<<<<<<<<<<\n *     return \"<const EncodeMapper SymbolTable {!r} at 0x{:x}>\".format(self.name(),\n *                                                                     id(self))\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_XDECREF(__pyx_t_7);\n  __Pyx_AddTraceback(\"pywrapfst._EncodeMapperSymbolTable.__repr__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"(tree fragment)\":1\n * def __reduce_cython__(self):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._encoder,self._table cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_24_EncodeMapperSymbolTable_3__reduce_cython__(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_24_EncodeMapperSymbolTable_3__reduce_cython__(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__reduce_cython__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_24_EncodeMapperSymbolTable_2__reduce_cython__(((struct __pyx_obj_9pywrapfst__EncodeMapperSymbolTable *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_24_EncodeMapperSymbolTable_2__reduce_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst__EncodeMapperSymbolTable *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"__reduce_cython__\", 0);\n\n  /* \"(tree fragment)\":2\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._encoder,self._table cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._encoder,self._table cannot be converted to a Python object for pickling\")\n */\n  __pyx_t_1 = __Pyx_PyObject_Call(__pyx_builtin_TypeError, __pyx_tuple__9, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(1, 2, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __Pyx_Raise(__pyx_t_1, 0, 0, 0);\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  __PYX_ERR(1, 2, __pyx_L1_error)\n\n  /* \"(tree fragment)\":1\n * def __reduce_cython__(self):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._encoder,self._table cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst._EncodeMapperSymbolTable.__reduce_cython__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"(tree fragment)\":3\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._encoder,self._table cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._encoder,self._table cannot be converted to a Python object for pickling\")\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_24_EncodeMapperSymbolTable_5__setstate_cython__(PyObject *__pyx_v_self, PyObject *__pyx_v___pyx_state); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_24_EncodeMapperSymbolTable_5__setstate_cython__(PyObject *__pyx_v_self, PyObject *__pyx_v___pyx_state) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__setstate_cython__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_24_EncodeMapperSymbolTable_4__setstate_cython__(((struct __pyx_obj_9pywrapfst__EncodeMapperSymbolTable *)__pyx_v_self), ((PyObject *)__pyx_v___pyx_state));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_24_EncodeMapperSymbolTable_4__setstate_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst__EncodeMapperSymbolTable *__pyx_v_self, CYTHON_UNUSED PyObject *__pyx_v___pyx_state) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"__setstate_cython__\", 0);\n\n  /* \"(tree fragment)\":4\n *     raise TypeError(\"self._encoder,self._table cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._encoder,self._table cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n */\n  __pyx_t_1 = __Pyx_PyObject_Call(__pyx_builtin_TypeError, __pyx_tuple__10, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(1, 4, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __Pyx_Raise(__pyx_t_1, 0, 0, 0);\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  __PYX_ERR(1, 4, __pyx_L1_error)\n\n  /* \"(tree fragment)\":3\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._encoder,self._table cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._encoder,self._table cannot be converted to a Python object for pickling\")\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst._EncodeMapperSymbolTable.__setstate_cython__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":873\n *   # Doing so will allow undefined behavior.\n * \n *   def __repr__(self):             # <<<<<<<<<<<<<<\n *     return \"<const Fst SymbolTable {!r} at 0x{:x}>\".format(self.name(),\n *                                                            id(self))\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_15_FstSymbolTable_1__repr__(PyObject *__pyx_v_self); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_15_FstSymbolTable_1__repr__(PyObject *__pyx_v_self) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__repr__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_15_FstSymbolTable___repr__(((struct __pyx_obj_9pywrapfst__FstSymbolTable *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_15_FstSymbolTable___repr__(struct __pyx_obj_9pywrapfst__FstSymbolTable *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  int __pyx_t_6;\n  PyObject *__pyx_t_7 = NULL;\n  __Pyx_RefNannySetupContext(\"__repr__\", 0);\n\n  /* \"pywrapfst.pyx\":874\n * \n *   def __repr__(self):\n *     return \"<const Fst SymbolTable {!r} at 0x{:x}>\".format(self.name(),             # <<<<<<<<<<<<<<\n *                                                            id(self))\n * \n */\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_2 = __Pyx_PyObject_GetAttrStr(__pyx_kp_s_const_Fst_SymbolTable_r_at_0x_x, __pyx_n_s_format); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 874, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"name\");\n    __PYX_ERR(0, 874, __pyx_L1_error)\n  }\n  __pyx_t_3 = __pyx_convert_PyBytes_string_to_py_std__in_string(((struct __pyx_vtabstruct_9pywrapfst__FstSymbolTable *)__pyx_v_self->__pyx_base.__pyx_vtab)->__pyx_base.name(((struct __pyx_obj_9pywrapfst__SymbolTable *)__pyx_v_self), 0)); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 874, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_3);\n\n  /* \"pywrapfst.pyx\":875\n *   def __repr__(self):\n *     return \"<const Fst SymbolTable {!r} at 0x{:x}>\".format(self.name(),\n *                                                            id(self))             # <<<<<<<<<<<<<<\n * \n * \n */\n  __pyx_t_4 = PyTuple_New(1); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 875, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_4);\n  __Pyx_INCREF(((PyObject *)__pyx_v_self));\n  __Pyx_GIVEREF(((PyObject *)__pyx_v_self));\n  PyTuple_SET_ITEM(__pyx_t_4, 0, ((PyObject *)__pyx_v_self));\n  __pyx_t_5 = __Pyx_PyObject_Call(__pyx_builtin_id, __pyx_t_4, NULL); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 875, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_5);\n  __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n  __pyx_t_4 = NULL;\n  __pyx_t_6 = 0;\n  if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_2))) {\n    __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_2);\n    if (likely(__pyx_t_4)) {\n      PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_2);\n      __Pyx_INCREF(__pyx_t_4);\n      __Pyx_INCREF(function);\n      __Pyx_DECREF_SET(__pyx_t_2, function);\n      __pyx_t_6 = 1;\n    }\n  }\n  #if CYTHON_FAST_PYCALL\n  if (PyFunction_Check(__pyx_t_2)) {\n    PyObject *__pyx_temp[3] = {__pyx_t_4, __pyx_t_3, __pyx_t_5};\n    __pyx_t_1 = __Pyx_PyFunction_FastCall(__pyx_t_2, __pyx_temp+1-__pyx_t_6, 2+__pyx_t_6); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 874, __pyx_L1_error)\n    __Pyx_XDECREF(__pyx_t_4); __pyx_t_4 = 0;\n    __Pyx_GOTREF(__pyx_t_1);\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n  } else\n  #endif\n  #if CYTHON_FAST_PYCCALL\n  if (__Pyx_PyFastCFunction_Check(__pyx_t_2)) {\n    PyObject *__pyx_temp[3] = {__pyx_t_4, __pyx_t_3, __pyx_t_5};\n    __pyx_t_1 = __Pyx_PyCFunction_FastCall(__pyx_t_2, __pyx_temp+1-__pyx_t_6, 2+__pyx_t_6); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 874, __pyx_L1_error)\n    __Pyx_XDECREF(__pyx_t_4); __pyx_t_4 = 0;\n    __Pyx_GOTREF(__pyx_t_1);\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n  } else\n  #endif\n  {\n    __pyx_t_7 = PyTuple_New(2+__pyx_t_6); if (unlikely(!__pyx_t_7)) __PYX_ERR(0, 874, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_7);\n    if (__pyx_t_4) {\n      __Pyx_GIVEREF(__pyx_t_4); PyTuple_SET_ITEM(__pyx_t_7, 0, __pyx_t_4); __pyx_t_4 = NULL;\n    }\n    __Pyx_GIVEREF(__pyx_t_3);\n    PyTuple_SET_ITEM(__pyx_t_7, 0+__pyx_t_6, __pyx_t_3);\n    __Pyx_GIVEREF(__pyx_t_5);\n    PyTuple_SET_ITEM(__pyx_t_7, 1+__pyx_t_6, __pyx_t_5);\n    __pyx_t_3 = 0;\n    __pyx_t_5 = 0;\n    __pyx_t_1 = __Pyx_PyObject_Call(__pyx_t_2, __pyx_t_7, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 874, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0;\n  }\n  __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":873\n *   # Doing so will allow undefined behavior.\n * \n *   def __repr__(self):             # <<<<<<<<<<<<<<\n *     return \"<const Fst SymbolTable {!r} at 0x{:x}>\".format(self.name(),\n *                                                            id(self))\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_XDECREF(__pyx_t_7);\n  __Pyx_AddTraceback(\"pywrapfst._FstSymbolTable.__repr__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"(tree fragment)\":1\n * def __reduce_cython__(self):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._fst,self._table cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_15_FstSymbolTable_3__reduce_cython__(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_15_FstSymbolTable_3__reduce_cython__(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__reduce_cython__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_15_FstSymbolTable_2__reduce_cython__(((struct __pyx_obj_9pywrapfst__FstSymbolTable *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_15_FstSymbolTable_2__reduce_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst__FstSymbolTable *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"__reduce_cython__\", 0);\n\n  /* \"(tree fragment)\":2\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._fst,self._table cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._fst,self._table cannot be converted to a Python object for pickling\")\n */\n  __pyx_t_1 = __Pyx_PyObject_Call(__pyx_builtin_TypeError, __pyx_tuple__11, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(1, 2, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __Pyx_Raise(__pyx_t_1, 0, 0, 0);\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  __PYX_ERR(1, 2, __pyx_L1_error)\n\n  /* \"(tree fragment)\":1\n * def __reduce_cython__(self):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._fst,self._table cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst._FstSymbolTable.__reduce_cython__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"(tree fragment)\":3\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._fst,self._table cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._fst,self._table cannot be converted to a Python object for pickling\")\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_15_FstSymbolTable_5__setstate_cython__(PyObject *__pyx_v_self, PyObject *__pyx_v___pyx_state); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_15_FstSymbolTable_5__setstate_cython__(PyObject *__pyx_v_self, PyObject *__pyx_v___pyx_state) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__setstate_cython__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_15_FstSymbolTable_4__setstate_cython__(((struct __pyx_obj_9pywrapfst__FstSymbolTable *)__pyx_v_self), ((PyObject *)__pyx_v___pyx_state));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_15_FstSymbolTable_4__setstate_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst__FstSymbolTable *__pyx_v_self, CYTHON_UNUSED PyObject *__pyx_v___pyx_state) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"__setstate_cython__\", 0);\n\n  /* \"(tree fragment)\":4\n *     raise TypeError(\"self._fst,self._table cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._fst,self._table cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n */\n  __pyx_t_1 = __Pyx_PyObject_Call(__pyx_builtin_TypeError, __pyx_tuple__12, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(1, 4, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __Pyx_Raise(__pyx_t_1, 0, 0, 0);\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  __PYX_ERR(1, 4, __pyx_L1_error)\n\n  /* \"(tree fragment)\":3\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._fst,self._table cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._fst,self._table cannot be converted to a Python object for pickling\")\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst._FstSymbolTable.__setstate_cython__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":889\n *   \"\"\"\n * \n *   cpdef int64 add_symbol(self, symbol, int64 key=kNoSymbol):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     add_symbol(self, symbol, key=NO_SYMBOL)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_19_MutableSymbolTable_1add_symbol(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic __pyx_t_10basictypes_int64 __pyx_f_9pywrapfst_19_MutableSymbolTable_add_symbol(struct __pyx_obj_9pywrapfst__MutableSymbolTable *__pyx_v_self, PyObject *__pyx_v_symbol, int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_19_MutableSymbolTable_add_symbol *__pyx_optional_args) {\n  __pyx_t_10basictypes_int64 __pyx_v_key = __pyx_k__13;\n  std::string __pyx_v_symbol_string;\n  __pyx_t_10basictypes_int64 __pyx_r;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  int __pyx_t_6;\n  PyObject *__pyx_t_7 = NULL;\n  __pyx_t_10basictypes_int64 __pyx_t_8;\n  std::string __pyx_t_9;\n  int __pyx_t_10;\n  __Pyx_RefNannySetupContext(\"add_symbol\", 0);\n  if (__pyx_optional_args) {\n    if (__pyx_optional_args->__pyx_n > 0) {\n      __pyx_v_key = __pyx_optional_args->key;\n    }\n  }\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_add_symbol); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 889, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_19_MutableSymbolTable_1add_symbol)) {\n      __pyx_t_3 = __Pyx_PyInt_From_int64_t(__pyx_v_key); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 889, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_3);\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_4 = __pyx_t_1; __pyx_t_5 = NULL;\n      __pyx_t_6 = 0;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_4))) {\n        __pyx_t_5 = PyMethod_GET_SELF(__pyx_t_4);\n        if (likely(__pyx_t_5)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_4);\n          __Pyx_INCREF(__pyx_t_5);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_4, function);\n          __pyx_t_6 = 1;\n        }\n      }\n      #if CYTHON_FAST_PYCALL\n      if (PyFunction_Check(__pyx_t_4)) {\n        PyObject *__pyx_temp[3] = {__pyx_t_5, __pyx_v_symbol, __pyx_t_3};\n        __pyx_t_2 = __Pyx_PyFunction_FastCall(__pyx_t_4, __pyx_temp+1-__pyx_t_6, 2+__pyx_t_6); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 889, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;\n        __Pyx_GOTREF(__pyx_t_2);\n        __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      } else\n      #endif\n      #if CYTHON_FAST_PYCCALL\n      if (__Pyx_PyFastCFunction_Check(__pyx_t_4)) {\n        PyObject *__pyx_temp[3] = {__pyx_t_5, __pyx_v_symbol, __pyx_t_3};\n        __pyx_t_2 = __Pyx_PyCFunction_FastCall(__pyx_t_4, __pyx_temp+1-__pyx_t_6, 2+__pyx_t_6); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 889, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;\n        __Pyx_GOTREF(__pyx_t_2);\n        __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      } else\n      #endif\n      {\n        __pyx_t_7 = PyTuple_New(2+__pyx_t_6); if (unlikely(!__pyx_t_7)) __PYX_ERR(0, 889, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_7);\n        if (__pyx_t_5) {\n          __Pyx_GIVEREF(__pyx_t_5); PyTuple_SET_ITEM(__pyx_t_7, 0, __pyx_t_5); __pyx_t_5 = NULL;\n        }\n        __Pyx_INCREF(__pyx_v_symbol);\n        __Pyx_GIVEREF(__pyx_v_symbol);\n        PyTuple_SET_ITEM(__pyx_t_7, 0+__pyx_t_6, __pyx_v_symbol);\n        __Pyx_GIVEREF(__pyx_t_3);\n        PyTuple_SET_ITEM(__pyx_t_7, 1+__pyx_t_6, __pyx_t_3);\n        __pyx_t_3 = 0;\n        __pyx_t_2 = __Pyx_PyObject_Call(__pyx_t_4, __pyx_t_7, NULL); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 889, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_2);\n        __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0;\n      }\n      __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      __pyx_t_8 = __Pyx_PyInt_As_int64_t(__pyx_t_2); if (unlikely((__pyx_t_8 == ((int64_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 889, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __pyx_r = __pyx_t_8;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":906\n *       The integer key of the new symbol.\n *     \"\"\"\n *     cdef string symbol_string = tostring(symbol)             # <<<<<<<<<<<<<<\n *     if key != kNoSymbol:\n *       return self._table.AddSymbol(symbol_string, key)\n */\n  __pyx_t_9 = __pyx_f_9pywrapfst_tostring(__pyx_v_symbol, NULL); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 906, __pyx_L1_error)\n  __pyx_v_symbol_string = __pyx_t_9;\n\n  /* \"pywrapfst.pyx\":907\n *     \"\"\"\n *     cdef string symbol_string = tostring(symbol)\n *     if key != kNoSymbol:             # <<<<<<<<<<<<<<\n *       return self._table.AddSymbol(symbol_string, key)\n *     else:\n */\n  __pyx_t_1 = __Pyx_PyInt_From_int64_t(__pyx_v_key); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 907, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_t_2 = __Pyx_GetModuleGlobalName(__pyx_n_s_kNoSymbol); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 907, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  __pyx_t_4 = PyObject_RichCompare(__pyx_t_1, __pyx_t_2, Py_NE); __Pyx_XGOTREF(__pyx_t_4); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 907, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n  __pyx_t_10 = __Pyx_PyObject_IsTrue(__pyx_t_4); if (unlikely(__pyx_t_10 < 0)) __PYX_ERR(0, 907, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n  if (__pyx_t_10) {\n\n    /* \"pywrapfst.pyx\":908\n *     cdef string symbol_string = tostring(symbol)\n *     if key != kNoSymbol:\n *       return self._table.AddSymbol(symbol_string, key)             # <<<<<<<<<<<<<<\n *     else:\n *       return self._table.AddSymbol(symbol_string)\n */\n    if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n      PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_table\");\n      __PYX_ERR(0, 908, __pyx_L1_error)\n    }\n    __pyx_r = __pyx_v_self->__pyx_base._table->AddSymbol(__pyx_v_symbol_string, __pyx_v_key);\n    goto __pyx_L0;\n\n    /* \"pywrapfst.pyx\":907\n *     \"\"\"\n *     cdef string symbol_string = tostring(symbol)\n *     if key != kNoSymbol:             # <<<<<<<<<<<<<<\n *       return self._table.AddSymbol(symbol_string, key)\n *     else:\n */\n  }\n\n  /* \"pywrapfst.pyx\":910\n *       return self._table.AddSymbol(symbol_string, key)\n *     else:\n *       return self._table.AddSymbol(symbol_string)             # <<<<<<<<<<<<<<\n * \n *   cpdef void add_table(self, _SymbolTable syms):\n */\n  /*else*/ {\n    if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n      PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_table\");\n      __PYX_ERR(0, 910, __pyx_L1_error)\n    }\n    __pyx_r = __pyx_v_self->__pyx_base._table->AddSymbol(__pyx_v_symbol_string);\n    goto __pyx_L0;\n  }\n\n  /* \"pywrapfst.pyx\":889\n *   \"\"\"\n * \n *   cpdef int64 add_symbol(self, symbol, int64 key=kNoSymbol):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     add_symbol(self, symbol, key=NO_SYMBOL)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_XDECREF(__pyx_t_7);\n  __Pyx_WriteUnraisable(\"pywrapfst._MutableSymbolTable.add_symbol\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_19_MutableSymbolTable_1add_symbol(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic char __pyx_doc_9pywrapfst_19_MutableSymbolTable_add_symbol[] = \"\\n    add_symbol(self, symbol, key=NO_SYMBOL)\\n\\n    Adds a symbol to the table and returns the index.\\n\\n    This method adds a symbol to the table. The caller can optionally\\n    specify a non-negative integer index for the key.\\n\\n    Args:\\n      symbol: A symbol string.\\n      key: An index for the symbol; if not specified, the next index will be\\n          used.\\n\\n    Returns:\\n      The integer key of the new symbol.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_19_MutableSymbolTable_1add_symbol(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  PyObject *__pyx_v_symbol = 0;\n  __pyx_t_10basictypes_int64 __pyx_v_key;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"add_symbol (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_symbol,&__pyx_n_s_key,0};\n    PyObject* values[2] = {0,0};\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (likely((values[0] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_symbol)) != 0)) kw_args--;\n        else goto __pyx_L5_argtuple_error;\n        CYTHON_FALLTHROUGH;\n        case  1:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_key);\n          if (value) { values[1] = value; kw_args--; }\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"add_symbol\") < 0)) __PYX_ERR(0, 889, __pyx_L3_error)\n      }\n    } else {\n      switch (PyTuple_GET_SIZE(__pyx_args)) {\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n    }\n    __pyx_v_symbol = values[0];\n    if (values[1]) {\n      __pyx_v_key = __Pyx_PyInt_As_int64_t(values[1]); if (unlikely((__pyx_v_key == ((int64_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 889, __pyx_L3_error)\n    } else {\n      __pyx_v_key = __pyx_k__13;\n    }\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"add_symbol\", 0, 1, 2, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 889, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableSymbolTable.add_symbol\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  __pyx_r = __pyx_pf_9pywrapfst_19_MutableSymbolTable_add_symbol(((struct __pyx_obj_9pywrapfst__MutableSymbolTable *)__pyx_v_self), __pyx_v_symbol, __pyx_v_key);\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_19_MutableSymbolTable_add_symbol(struct __pyx_obj_9pywrapfst__MutableSymbolTable *__pyx_v_self, PyObject *__pyx_v_symbol, __pyx_t_10basictypes_int64 __pyx_v_key) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  __pyx_t_10basictypes_int64 __pyx_t_1;\n  struct __pyx_opt_args_9pywrapfst_19_MutableSymbolTable_add_symbol __pyx_t_2;\n  PyObject *__pyx_t_3 = NULL;\n  __Pyx_RefNannySetupContext(\"add_symbol\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_2.__pyx_n = 1;\n  __pyx_t_2.key = __pyx_v_key;\n  __pyx_t_1 = __pyx_vtabptr_9pywrapfst__MutableSymbolTable->add_symbol(__pyx_v_self, __pyx_v_symbol, 1, &__pyx_t_2); \n  __pyx_t_3 = __Pyx_PyInt_From_int64_t(__pyx_t_1); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 889, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_3);\n  __pyx_r = __pyx_t_3;\n  __pyx_t_3 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_AddTraceback(\"pywrapfst._MutableSymbolTable.add_symbol\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":912\n *       return self._table.AddSymbol(symbol_string)\n * \n *   cpdef void add_table(self, _SymbolTable syms):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     add_table(self, syms)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_19_MutableSymbolTable_3add_table(PyObject *__pyx_v_self, PyObject *__pyx_v_syms); /*proto*/\nstatic void __pyx_f_9pywrapfst_19_MutableSymbolTable_add_table(struct __pyx_obj_9pywrapfst__MutableSymbolTable *__pyx_v_self, struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_syms, int __pyx_skip_dispatch) {\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  __Pyx_RefNannySetupContext(\"add_table\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_add_table); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 912, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_19_MutableSymbolTable_3add_table)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (!__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, ((PyObject *)__pyx_v_syms)); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 912, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_2);\n      } else {\n        #if CYTHON_FAST_PYCALL\n        if (PyFunction_Check(__pyx_t_3)) {\n          PyObject *__pyx_temp[2] = {__pyx_t_4, ((PyObject *)__pyx_v_syms)};\n          __pyx_t_2 = __Pyx_PyFunction_FastCall(__pyx_t_3, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 912, __pyx_L1_error)\n          __Pyx_XDECREF(__pyx_t_4); __pyx_t_4 = 0;\n          __Pyx_GOTREF(__pyx_t_2);\n        } else\n        #endif\n        #if CYTHON_FAST_PYCCALL\n        if (__Pyx_PyFastCFunction_Check(__pyx_t_3)) {\n          PyObject *__pyx_temp[2] = {__pyx_t_4, ((PyObject *)__pyx_v_syms)};\n          __pyx_t_2 = __Pyx_PyCFunction_FastCall(__pyx_t_3, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 912, __pyx_L1_error)\n          __Pyx_XDECREF(__pyx_t_4); __pyx_t_4 = 0;\n          __Pyx_GOTREF(__pyx_t_2);\n        } else\n        #endif\n        {\n          __pyx_t_5 = PyTuple_New(1+1); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 912, __pyx_L1_error)\n          __Pyx_GOTREF(__pyx_t_5);\n          __Pyx_GIVEREF(__pyx_t_4); PyTuple_SET_ITEM(__pyx_t_5, 0, __pyx_t_4); __pyx_t_4 = NULL;\n          __Pyx_INCREF(((PyObject *)__pyx_v_syms));\n          __Pyx_GIVEREF(((PyObject *)__pyx_v_syms));\n          PyTuple_SET_ITEM(__pyx_t_5, 0+1, ((PyObject *)__pyx_v_syms));\n          __pyx_t_2 = __Pyx_PyObject_Call(__pyx_t_3, __pyx_t_5, NULL); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 912, __pyx_L1_error)\n          __Pyx_GOTREF(__pyx_t_2);\n          __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n        }\n      }\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":924\n *       syms: A SymbolTable to be merged with the current table.\n *     \"\"\"\n *     self._table.AddTable(deref(syms._table))             # <<<<<<<<<<<<<<\n * \n *   cpdef void set_name(self, new_name) except *:\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_table\");\n    __PYX_ERR(0, 924, __pyx_L1_error)\n  }\n  if (unlikely(((PyObject *)__pyx_v_syms) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_table\");\n    __PYX_ERR(0, 924, __pyx_L1_error)\n  }\n  __pyx_v_self->__pyx_base._table->AddTable((*__pyx_v_syms->_table));\n\n  /* \"pywrapfst.pyx\":912\n *       return self._table.AddSymbol(symbol_string)\n * \n *   cpdef void add_table(self, _SymbolTable syms):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     add_table(self, syms)\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_WriteUnraisable(\"pywrapfst._MutableSymbolTable.add_table\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_19_MutableSymbolTable_3add_table(PyObject *__pyx_v_self, PyObject *__pyx_v_syms); /*proto*/\nstatic char __pyx_doc_9pywrapfst_19_MutableSymbolTable_2add_table[] = \"\\n    add_table(self, syms)\\n\\n    Adds another SymbolTable to this table.\\n\\n    This method merges another symbol table into the current table. All key\\n    values will be offset by the current available key.\\n\\n    Args:\\n      syms: A SymbolTable to be merged with the current table.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_19_MutableSymbolTable_3add_table(PyObject *__pyx_v_self, PyObject *__pyx_v_syms) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"add_table (wrapper)\", 0);\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_syms), __pyx_ptype_9pywrapfst__SymbolTable, 1, \"syms\", 0))) __PYX_ERR(0, 912, __pyx_L1_error)\n  __pyx_r = __pyx_pf_9pywrapfst_19_MutableSymbolTable_2add_table(((struct __pyx_obj_9pywrapfst__MutableSymbolTable *)__pyx_v_self), ((struct __pyx_obj_9pywrapfst__SymbolTable *)__pyx_v_syms));\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_19_MutableSymbolTable_2add_table(struct __pyx_obj_9pywrapfst__MutableSymbolTable *__pyx_v_self, struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_syms) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"add_table\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __Pyx_void_to_None(__pyx_f_9pywrapfst_19_MutableSymbolTable_add_table(__pyx_v_self, __pyx_v_syms, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 912, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst._MutableSymbolTable.add_table\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":926\n *     self._table.AddTable(deref(syms._table))\n * \n *   cpdef void set_name(self, new_name) except *:             # <<<<<<<<<<<<<<\n *     self._table.SetName(tostring(new_name))\n * \n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_19_MutableSymbolTable_5set_name(PyObject *__pyx_v_self, PyObject *__pyx_v_new_name); /*proto*/\nstatic void __pyx_f_9pywrapfst_19_MutableSymbolTable_set_name(struct __pyx_obj_9pywrapfst__MutableSymbolTable *__pyx_v_self, PyObject *__pyx_v_new_name, int __pyx_skip_dispatch) {\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  std::string __pyx_t_6;\n  __Pyx_RefNannySetupContext(\"set_name\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_set_name); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 926, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_19_MutableSymbolTable_5set_name)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (!__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_v_new_name); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 926, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_2);\n      } else {\n        #if CYTHON_FAST_PYCALL\n        if (PyFunction_Check(__pyx_t_3)) {\n          PyObject *__pyx_temp[2] = {__pyx_t_4, __pyx_v_new_name};\n          __pyx_t_2 = __Pyx_PyFunction_FastCall(__pyx_t_3, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 926, __pyx_L1_error)\n          __Pyx_XDECREF(__pyx_t_4); __pyx_t_4 = 0;\n          __Pyx_GOTREF(__pyx_t_2);\n        } else\n        #endif\n        #if CYTHON_FAST_PYCCALL\n        if (__Pyx_PyFastCFunction_Check(__pyx_t_3)) {\n          PyObject *__pyx_temp[2] = {__pyx_t_4, __pyx_v_new_name};\n          __pyx_t_2 = __Pyx_PyCFunction_FastCall(__pyx_t_3, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 926, __pyx_L1_error)\n          __Pyx_XDECREF(__pyx_t_4); __pyx_t_4 = 0;\n          __Pyx_GOTREF(__pyx_t_2);\n        } else\n        #endif\n        {\n          __pyx_t_5 = PyTuple_New(1+1); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 926, __pyx_L1_error)\n          __Pyx_GOTREF(__pyx_t_5);\n          __Pyx_GIVEREF(__pyx_t_4); PyTuple_SET_ITEM(__pyx_t_5, 0, __pyx_t_4); __pyx_t_4 = NULL;\n          __Pyx_INCREF(__pyx_v_new_name);\n          __Pyx_GIVEREF(__pyx_v_new_name);\n          PyTuple_SET_ITEM(__pyx_t_5, 0+1, __pyx_v_new_name);\n          __pyx_t_2 = __Pyx_PyObject_Call(__pyx_t_3, __pyx_t_5, NULL); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 926, __pyx_L1_error)\n          __Pyx_GOTREF(__pyx_t_2);\n          __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n        }\n      }\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":927\n * \n *   cpdef void set_name(self, new_name) except *:\n *     self._table.SetName(tostring(new_name))             # <<<<<<<<<<<<<<\n * \n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_table\");\n    __PYX_ERR(0, 927, __pyx_L1_error)\n  }\n  __pyx_t_6 = __pyx_f_9pywrapfst_tostring(__pyx_v_new_name, NULL); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 927, __pyx_L1_error)\n  __pyx_v_self->__pyx_base._table->SetName(__pyx_t_6);\n\n  /* \"pywrapfst.pyx\":926\n *     self._table.AddTable(deref(syms._table))\n * \n *   cpdef void set_name(self, new_name) except *:             # <<<<<<<<<<<<<<\n *     self._table.SetName(tostring(new_name))\n * \n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_AddTraceback(\"pywrapfst._MutableSymbolTable.set_name\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_19_MutableSymbolTable_5set_name(PyObject *__pyx_v_self, PyObject *__pyx_v_new_name); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_19_MutableSymbolTable_5set_name(PyObject *__pyx_v_self, PyObject *__pyx_v_new_name) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"set_name (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_19_MutableSymbolTable_4set_name(((struct __pyx_obj_9pywrapfst__MutableSymbolTable *)__pyx_v_self), ((PyObject *)__pyx_v_new_name));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_19_MutableSymbolTable_4set_name(struct __pyx_obj_9pywrapfst__MutableSymbolTable *__pyx_v_self, PyObject *__pyx_v_new_name) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"set_name\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_f_9pywrapfst_19_MutableSymbolTable_set_name(__pyx_v_self, __pyx_v_new_name, 1); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 926, __pyx_L1_error)\n  __pyx_t_1 = __Pyx_void_to_None(NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 926, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst._MutableSymbolTable.set_name\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"(tree fragment)\":1\n * def __reduce_cython__(self):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._table cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_19_MutableSymbolTable_7__reduce_cython__(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_19_MutableSymbolTable_7__reduce_cython__(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__reduce_cython__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_19_MutableSymbolTable_6__reduce_cython__(((struct __pyx_obj_9pywrapfst__MutableSymbolTable *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_19_MutableSymbolTable_6__reduce_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst__MutableSymbolTable *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"__reduce_cython__\", 0);\n\n  /* \"(tree fragment)\":2\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._table cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._table cannot be converted to a Python object for pickling\")\n */\n  __pyx_t_1 = __Pyx_PyObject_Call(__pyx_builtin_TypeError, __pyx_tuple__14, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(1, 2, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __Pyx_Raise(__pyx_t_1, 0, 0, 0);\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  __PYX_ERR(1, 2, __pyx_L1_error)\n\n  /* \"(tree fragment)\":1\n * def __reduce_cython__(self):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._table cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst._MutableSymbolTable.__reduce_cython__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"(tree fragment)\":3\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._table cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._table cannot be converted to a Python object for pickling\")\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_19_MutableSymbolTable_9__setstate_cython__(PyObject *__pyx_v_self, PyObject *__pyx_v___pyx_state); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_19_MutableSymbolTable_9__setstate_cython__(PyObject *__pyx_v_self, PyObject *__pyx_v___pyx_state) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__setstate_cython__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_19_MutableSymbolTable_8__setstate_cython__(((struct __pyx_obj_9pywrapfst__MutableSymbolTable *)__pyx_v_self), ((PyObject *)__pyx_v___pyx_state));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_19_MutableSymbolTable_8__setstate_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst__MutableSymbolTable *__pyx_v_self, CYTHON_UNUSED PyObject *__pyx_v___pyx_state) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"__setstate_cython__\", 0);\n\n  /* \"(tree fragment)\":4\n *     raise TypeError(\"self._table cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._table cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n */\n  __pyx_t_1 = __Pyx_PyObject_Call(__pyx_builtin_TypeError, __pyx_tuple__15, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(1, 4, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __Pyx_Raise(__pyx_t_1, 0, 0, 0);\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  __PYX_ERR(1, 4, __pyx_L1_error)\n\n  /* \"(tree fragment)\":3\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._table cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._table cannot be converted to a Python object for pickling\")\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst._MutableSymbolTable.__setstate_cython__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":937\n *   \"\"\"\n * \n *   def __repr__(self):             # <<<<<<<<<<<<<<\n *     return \"<Fst SymbolTable {!r} at 0x{:x}>\".format(self.name(), id(self))\n * \n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_22_MutableFstSymbolTable_1__repr__(PyObject *__pyx_v_self); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_22_MutableFstSymbolTable_1__repr__(PyObject *__pyx_v_self) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__repr__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_22_MutableFstSymbolTable___repr__(((struct __pyx_obj_9pywrapfst__MutableFstSymbolTable *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_22_MutableFstSymbolTable___repr__(struct __pyx_obj_9pywrapfst__MutableFstSymbolTable *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  int __pyx_t_6;\n  PyObject *__pyx_t_7 = NULL;\n  __Pyx_RefNannySetupContext(\"__repr__\", 0);\n\n  /* \"pywrapfst.pyx\":938\n * \n *   def __repr__(self):\n *     return \"<Fst SymbolTable {!r} at 0x{:x}>\".format(self.name(), id(self))             # <<<<<<<<<<<<<<\n * \n * \n */\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_2 = __Pyx_PyObject_GetAttrStr(__pyx_kp_s_Fst_SymbolTable_r_at_0x_x, __pyx_n_s_format); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 938, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"name\");\n    __PYX_ERR(0, 938, __pyx_L1_error)\n  }\n  __pyx_t_3 = __pyx_convert_PyBytes_string_to_py_std__in_string(((struct __pyx_vtabstruct_9pywrapfst__MutableFstSymbolTable *)__pyx_v_self->__pyx_base.__pyx_base.__pyx_vtab)->__pyx_base.__pyx_base.name(((struct __pyx_obj_9pywrapfst__SymbolTable *)__pyx_v_self), 0)); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 938, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_3);\n  __pyx_t_4 = PyTuple_New(1); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 938, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_4);\n  __Pyx_INCREF(((PyObject *)__pyx_v_self));\n  __Pyx_GIVEREF(((PyObject *)__pyx_v_self));\n  PyTuple_SET_ITEM(__pyx_t_4, 0, ((PyObject *)__pyx_v_self));\n  __pyx_t_5 = __Pyx_PyObject_Call(__pyx_builtin_id, __pyx_t_4, NULL); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 938, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_5);\n  __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n  __pyx_t_4 = NULL;\n  __pyx_t_6 = 0;\n  if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_2))) {\n    __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_2);\n    if (likely(__pyx_t_4)) {\n      PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_2);\n      __Pyx_INCREF(__pyx_t_4);\n      __Pyx_INCREF(function);\n      __Pyx_DECREF_SET(__pyx_t_2, function);\n      __pyx_t_6 = 1;\n    }\n  }\n  #if CYTHON_FAST_PYCALL\n  if (PyFunction_Check(__pyx_t_2)) {\n    PyObject *__pyx_temp[3] = {__pyx_t_4, __pyx_t_3, __pyx_t_5};\n    __pyx_t_1 = __Pyx_PyFunction_FastCall(__pyx_t_2, __pyx_temp+1-__pyx_t_6, 2+__pyx_t_6); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 938, __pyx_L1_error)\n    __Pyx_XDECREF(__pyx_t_4); __pyx_t_4 = 0;\n    __Pyx_GOTREF(__pyx_t_1);\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n  } else\n  #endif\n  #if CYTHON_FAST_PYCCALL\n  if (__Pyx_PyFastCFunction_Check(__pyx_t_2)) {\n    PyObject *__pyx_temp[3] = {__pyx_t_4, __pyx_t_3, __pyx_t_5};\n    __pyx_t_1 = __Pyx_PyCFunction_FastCall(__pyx_t_2, __pyx_temp+1-__pyx_t_6, 2+__pyx_t_6); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 938, __pyx_L1_error)\n    __Pyx_XDECREF(__pyx_t_4); __pyx_t_4 = 0;\n    __Pyx_GOTREF(__pyx_t_1);\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n  } else\n  #endif\n  {\n    __pyx_t_7 = PyTuple_New(2+__pyx_t_6); if (unlikely(!__pyx_t_7)) __PYX_ERR(0, 938, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_7);\n    if (__pyx_t_4) {\n      __Pyx_GIVEREF(__pyx_t_4); PyTuple_SET_ITEM(__pyx_t_7, 0, __pyx_t_4); __pyx_t_4 = NULL;\n    }\n    __Pyx_GIVEREF(__pyx_t_3);\n    PyTuple_SET_ITEM(__pyx_t_7, 0+__pyx_t_6, __pyx_t_3);\n    __Pyx_GIVEREF(__pyx_t_5);\n    PyTuple_SET_ITEM(__pyx_t_7, 1+__pyx_t_6, __pyx_t_5);\n    __pyx_t_3 = 0;\n    __pyx_t_5 = 0;\n    __pyx_t_1 = __Pyx_PyObject_Call(__pyx_t_2, __pyx_t_7, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 938, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0;\n  }\n  __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":937\n *   \"\"\"\n * \n *   def __repr__(self):             # <<<<<<<<<<<<<<\n *     return \"<Fst SymbolTable {!r} at 0x{:x}>\".format(self.name(), id(self))\n * \n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_XDECREF(__pyx_t_7);\n  __Pyx_AddTraceback(\"pywrapfst._MutableFstSymbolTable.__repr__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"(tree fragment)\":1\n * def __reduce_cython__(self):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._mfst,self._table cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_22_MutableFstSymbolTable_3__reduce_cython__(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_22_MutableFstSymbolTable_3__reduce_cython__(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__reduce_cython__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_22_MutableFstSymbolTable_2__reduce_cython__(((struct __pyx_obj_9pywrapfst__MutableFstSymbolTable *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_22_MutableFstSymbolTable_2__reduce_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst__MutableFstSymbolTable *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"__reduce_cython__\", 0);\n\n  /* \"(tree fragment)\":2\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._mfst,self._table cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._mfst,self._table cannot be converted to a Python object for pickling\")\n */\n  __pyx_t_1 = __Pyx_PyObject_Call(__pyx_builtin_TypeError, __pyx_tuple__16, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(1, 2, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __Pyx_Raise(__pyx_t_1, 0, 0, 0);\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  __PYX_ERR(1, 2, __pyx_L1_error)\n\n  /* \"(tree fragment)\":1\n * def __reduce_cython__(self):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._mfst,self._table cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst._MutableFstSymbolTable.__reduce_cython__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"(tree fragment)\":3\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._mfst,self._table cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._mfst,self._table cannot be converted to a Python object for pickling\")\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_22_MutableFstSymbolTable_5__setstate_cython__(PyObject *__pyx_v_self, PyObject *__pyx_v___pyx_state); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_22_MutableFstSymbolTable_5__setstate_cython__(PyObject *__pyx_v_self, PyObject *__pyx_v___pyx_state) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__setstate_cython__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_22_MutableFstSymbolTable_4__setstate_cython__(((struct __pyx_obj_9pywrapfst__MutableFstSymbolTable *)__pyx_v_self), ((PyObject *)__pyx_v___pyx_state));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_22_MutableFstSymbolTable_4__setstate_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst__MutableFstSymbolTable *__pyx_v_self, CYTHON_UNUSED PyObject *__pyx_v___pyx_state) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"__setstate_cython__\", 0);\n\n  /* \"(tree fragment)\":4\n *     raise TypeError(\"self._mfst,self._table cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._mfst,self._table cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n */\n  __pyx_t_1 = __Pyx_PyObject_Call(__pyx_builtin_TypeError, __pyx_tuple__17, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(1, 4, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __Pyx_Raise(__pyx_t_1, 0, 0, 0);\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  __PYX_ERR(1, 4, __pyx_L1_error)\n\n  /* \"(tree fragment)\":3\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._mfst,self._table cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._mfst,self._table cannot be converted to a Python object for pickling\")\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst._MutableFstSymbolTable.__setstate_cython__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":958\n *   \"\"\"\n * \n *   def __repr__(self):             # <<<<<<<<<<<<<<\n *     return \"<SymbolTable {!r} at 0x{:x}>\".format(self.name(), id(self))\n * \n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_11SymbolTable_1__repr__(PyObject *__pyx_v_self); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_11SymbolTable_1__repr__(PyObject *__pyx_v_self) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__repr__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_11SymbolTable___repr__(((struct __pyx_obj_9pywrapfst_SymbolTable *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_11SymbolTable___repr__(struct __pyx_obj_9pywrapfst_SymbolTable *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  int __pyx_t_6;\n  PyObject *__pyx_t_7 = NULL;\n  __Pyx_RefNannySetupContext(\"__repr__\", 0);\n\n  /* \"pywrapfst.pyx\":959\n * \n *   def __repr__(self):\n *     return \"<SymbolTable {!r} at 0x{:x}>\".format(self.name(), id(self))             # <<<<<<<<<<<<<<\n * \n *   def __init__(self, name=b\"<unspecified>\"):\n */\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_2 = __Pyx_PyObject_GetAttrStr(__pyx_kp_s_SymbolTable_r_at_0x_x, __pyx_n_s_format); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 959, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"name\");\n    __PYX_ERR(0, 959, __pyx_L1_error)\n  }\n  __pyx_t_3 = __pyx_convert_PyBytes_string_to_py_std__in_string(((struct __pyx_vtabstruct_9pywrapfst_SymbolTable *)__pyx_v_self->__pyx_base.__pyx_base.__pyx_vtab)->__pyx_base.__pyx_base.name(((struct __pyx_obj_9pywrapfst__SymbolTable *)__pyx_v_self), 0)); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 959, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_3);\n  __pyx_t_4 = PyTuple_New(1); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 959, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_4);\n  __Pyx_INCREF(((PyObject *)__pyx_v_self));\n  __Pyx_GIVEREF(((PyObject *)__pyx_v_self));\n  PyTuple_SET_ITEM(__pyx_t_4, 0, ((PyObject *)__pyx_v_self));\n  __pyx_t_5 = __Pyx_PyObject_Call(__pyx_builtin_id, __pyx_t_4, NULL); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 959, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_5);\n  __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n  __pyx_t_4 = NULL;\n  __pyx_t_6 = 0;\n  if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_2))) {\n    __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_2);\n    if (likely(__pyx_t_4)) {\n      PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_2);\n      __Pyx_INCREF(__pyx_t_4);\n      __Pyx_INCREF(function);\n      __Pyx_DECREF_SET(__pyx_t_2, function);\n      __pyx_t_6 = 1;\n    }\n  }\n  #if CYTHON_FAST_PYCALL\n  if (PyFunction_Check(__pyx_t_2)) {\n    PyObject *__pyx_temp[3] = {__pyx_t_4, __pyx_t_3, __pyx_t_5};\n    __pyx_t_1 = __Pyx_PyFunction_FastCall(__pyx_t_2, __pyx_temp+1-__pyx_t_6, 2+__pyx_t_6); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 959, __pyx_L1_error)\n    __Pyx_XDECREF(__pyx_t_4); __pyx_t_4 = 0;\n    __Pyx_GOTREF(__pyx_t_1);\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n  } else\n  #endif\n  #if CYTHON_FAST_PYCCALL\n  if (__Pyx_PyFastCFunction_Check(__pyx_t_2)) {\n    PyObject *__pyx_temp[3] = {__pyx_t_4, __pyx_t_3, __pyx_t_5};\n    __pyx_t_1 = __Pyx_PyCFunction_FastCall(__pyx_t_2, __pyx_temp+1-__pyx_t_6, 2+__pyx_t_6); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 959, __pyx_L1_error)\n    __Pyx_XDECREF(__pyx_t_4); __pyx_t_4 = 0;\n    __Pyx_GOTREF(__pyx_t_1);\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n  } else\n  #endif\n  {\n    __pyx_t_7 = PyTuple_New(2+__pyx_t_6); if (unlikely(!__pyx_t_7)) __PYX_ERR(0, 959, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_7);\n    if (__pyx_t_4) {\n      __Pyx_GIVEREF(__pyx_t_4); PyTuple_SET_ITEM(__pyx_t_7, 0, __pyx_t_4); __pyx_t_4 = NULL;\n    }\n    __Pyx_GIVEREF(__pyx_t_3);\n    PyTuple_SET_ITEM(__pyx_t_7, 0+__pyx_t_6, __pyx_t_3);\n    __Pyx_GIVEREF(__pyx_t_5);\n    PyTuple_SET_ITEM(__pyx_t_7, 1+__pyx_t_6, __pyx_t_5);\n    __pyx_t_3 = 0;\n    __pyx_t_5 = 0;\n    __pyx_t_1 = __Pyx_PyObject_Call(__pyx_t_2, __pyx_t_7, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 959, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0;\n  }\n  __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":958\n *   \"\"\"\n * \n *   def __repr__(self):             # <<<<<<<<<<<<<<\n *     return \"<SymbolTable {!r} at 0x{:x}>\".format(self.name(), id(self))\n * \n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_XDECREF(__pyx_t_7);\n  __Pyx_AddTraceback(\"pywrapfst.SymbolTable.__repr__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":961\n *     return \"<SymbolTable {!r} at 0x{:x}>\".format(self.name(), id(self))\n * \n *   def __init__(self, name=b\"<unspecified>\"):             # <<<<<<<<<<<<<<\n *     self._table = new fst.SymbolTable(tostring(name))\n *     self._smart_table.reset(self._table)\n */\n\n/* Python wrapper */\nstatic int __pyx_pw_9pywrapfst_11SymbolTable_3__init__(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic int __pyx_pw_9pywrapfst_11SymbolTable_3__init__(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  PyObject *__pyx_v_name = 0;\n  int __pyx_r;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__init__ (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_name_2,0};\n    PyObject* values[1] = {0};\n    values[0] = ((PyObject *)__pyx_kp_b_unspecified);\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_name_2);\n          if (value) { values[0] = value; kw_args--; }\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"__init__\") < 0)) __PYX_ERR(0, 961, __pyx_L3_error)\n      }\n    } else {\n      switch (PyTuple_GET_SIZE(__pyx_args)) {\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n    }\n    __pyx_v_name = values[0];\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"__init__\", 0, 0, 1, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 961, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst.SymbolTable.__init__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return -1;\n  __pyx_L4_argument_unpacking_done:;\n  __pyx_r = __pyx_pf_9pywrapfst_11SymbolTable_2__init__(((struct __pyx_obj_9pywrapfst_SymbolTable *)__pyx_v_self), __pyx_v_name);\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic int __pyx_pf_9pywrapfst_11SymbolTable_2__init__(struct __pyx_obj_9pywrapfst_SymbolTable *__pyx_v_self, PyObject *__pyx_v_name) {\n  int __pyx_r;\n  __Pyx_RefNannyDeclarations\n  std::string __pyx_t_1;\n  __Pyx_RefNannySetupContext(\"__init__\", 0);\n\n  /* \"pywrapfst.pyx\":962\n * \n *   def __init__(self, name=b\"<unspecified>\"):\n *     self._table = new fst.SymbolTable(tostring(name))             # <<<<<<<<<<<<<<\n *     self._smart_table.reset(self._table)\n * \n */\n  __pyx_t_1 = __pyx_f_9pywrapfst_tostring(__pyx_v_name, NULL); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 962, __pyx_L1_error)\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_table\");\n    __PYX_ERR(0, 962, __pyx_L1_error)\n  }\n  __pyx_v_self->__pyx_base.__pyx_base._table = new fst::SymbolTable(__pyx_t_1);\n\n  /* \"pywrapfst.pyx\":963\n *   def __init__(self, name=b\"<unspecified>\"):\n *     self._table = new fst.SymbolTable(tostring(name))\n *     self._smart_table.reset(self._table)             # <<<<<<<<<<<<<<\n * \n *   @classmethod\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_smart_table\");\n    __PYX_ERR(0, 963, __pyx_L1_error)\n  }\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_table\");\n    __PYX_ERR(0, 963, __pyx_L1_error)\n  }\n  __pyx_v_self->_smart_table.reset(__pyx_v_self->__pyx_base.__pyx_base._table);\n\n  /* \"pywrapfst.pyx\":961\n *     return \"<SymbolTable {!r} at 0x{:x}>\".format(self.name(), id(self))\n * \n *   def __init__(self, name=b\"<unspecified>\"):             # <<<<<<<<<<<<<<\n *     self._table = new fst.SymbolTable(tostring(name))\n *     self._smart_table.reset(self._table)\n */\n\n  /* function exit code */\n  __pyx_r = 0;\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"pywrapfst.SymbolTable.__init__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = -1;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":966\n * \n *   @classmethod\n *   def read(cls, filename):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     SymbolTable.read(filename)\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_11SymbolTable_5read(PyObject *__pyx_v_cls, PyObject *__pyx_v_filename); /*proto*/\nstatic char __pyx_doc_9pywrapfst_11SymbolTable_4read[] = \"\\n    SymbolTable.read(filename)\\n\\n    Reads symbol table from binary file.\\n\\n    This class method creates a new SymbolTable from a symbol table binary file.\\n\\n    Args:\\n      filename: The string location of the input binary file.\\n\\n    Returns:\\n      A new SymbolTable instance.\\n\\n    See also: `SymbolTable.read_fst`, `SymbolTable.read_text`.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_11SymbolTable_5read(PyObject *__pyx_v_cls, PyObject *__pyx_v_filename) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"read (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_11SymbolTable_4read(((PyTypeObject*)__pyx_v_cls), ((PyObject *)__pyx_v_filename));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_11SymbolTable_4read(CYTHON_UNUSED PyTypeObject *__pyx_v_cls, PyObject *__pyx_v_filename) {\n  fst::SymbolTable *__pyx_v_tsyms;\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  std::string __pyx_t_1;\n  int __pyx_t_2;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  PyObject *__pyx_t_6 = NULL;\n  PyObject *__pyx_t_7 = NULL;\n  PyObject *__pyx_t_8 = NULL;\n  __Pyx_RefNannySetupContext(\"read\", 0);\n\n  /* \"pywrapfst.pyx\":982\n *     See also: `SymbolTable.read_fst`, `SymbolTable.read_text`.\n *     \"\"\"\n *     cdef fst.SymbolTable *tsyms = fst.SymbolTable.Read(tostring(filename))             # <<<<<<<<<<<<<<\n *     if tsyms == NULL:\n *       raise FstIOError(\"Read failed: {!r}\".format(filename))\n */\n  __pyx_t_1 = __pyx_f_9pywrapfst_tostring(__pyx_v_filename, NULL); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 982, __pyx_L1_error)\n  __pyx_v_tsyms = fst::SymbolTable::Read(__pyx_t_1);\n\n  /* \"pywrapfst.pyx\":983\n *     \"\"\"\n *     cdef fst.SymbolTable *tsyms = fst.SymbolTable.Read(tostring(filename))\n *     if tsyms == NULL:             # <<<<<<<<<<<<<<\n *       raise FstIOError(\"Read failed: {!r}\".format(filename))\n *     return _init_SymbolTable(tsyms)\n */\n  __pyx_t_2 = ((__pyx_v_tsyms == NULL) != 0);\n  if (__pyx_t_2) {\n\n    /* \"pywrapfst.pyx\":984\n *     cdef fst.SymbolTable *tsyms = fst.SymbolTable.Read(tostring(filename))\n *     if tsyms == NULL:\n *       raise FstIOError(\"Read failed: {!r}\".format(filename))             # <<<<<<<<<<<<<<\n *     return _init_SymbolTable(tsyms)\n * \n */\n    __pyx_t_4 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstIOError); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 984, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_4);\n    __pyx_t_6 = __Pyx_PyObject_GetAttrStr(__pyx_kp_s_Read_failed_r, __pyx_n_s_format); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 984, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_6);\n    __pyx_t_7 = NULL;\n    if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_6))) {\n      __pyx_t_7 = PyMethod_GET_SELF(__pyx_t_6);\n      if (likely(__pyx_t_7)) {\n        PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_6);\n        __Pyx_INCREF(__pyx_t_7);\n        __Pyx_INCREF(function);\n        __Pyx_DECREF_SET(__pyx_t_6, function);\n      }\n    }\n    if (!__pyx_t_7) {\n      __pyx_t_5 = __Pyx_PyObject_CallOneArg(__pyx_t_6, __pyx_v_filename); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 984, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_5);\n    } else {\n      #if CYTHON_FAST_PYCALL\n      if (PyFunction_Check(__pyx_t_6)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_7, __pyx_v_filename};\n        __pyx_t_5 = __Pyx_PyFunction_FastCall(__pyx_t_6, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 984, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_7); __pyx_t_7 = 0;\n        __Pyx_GOTREF(__pyx_t_5);\n      } else\n      #endif\n      #if CYTHON_FAST_PYCCALL\n      if (__Pyx_PyFastCFunction_Check(__pyx_t_6)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_7, __pyx_v_filename};\n        __pyx_t_5 = __Pyx_PyCFunction_FastCall(__pyx_t_6, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 984, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_7); __pyx_t_7 = 0;\n        __Pyx_GOTREF(__pyx_t_5);\n      } else\n      #endif\n      {\n        __pyx_t_8 = PyTuple_New(1+1); if (unlikely(!__pyx_t_8)) __PYX_ERR(0, 984, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_8);\n        __Pyx_GIVEREF(__pyx_t_7); PyTuple_SET_ITEM(__pyx_t_8, 0, __pyx_t_7); __pyx_t_7 = NULL;\n        __Pyx_INCREF(__pyx_v_filename);\n        __Pyx_GIVEREF(__pyx_v_filename);\n        PyTuple_SET_ITEM(__pyx_t_8, 0+1, __pyx_v_filename);\n        __pyx_t_5 = __Pyx_PyObject_Call(__pyx_t_6, __pyx_t_8, NULL); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 984, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_5);\n        __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0;\n      }\n    }\n    __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n    __pyx_t_6 = NULL;\n    if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_4))) {\n      __pyx_t_6 = PyMethod_GET_SELF(__pyx_t_4);\n      if (likely(__pyx_t_6)) {\n        PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_4);\n        __Pyx_INCREF(__pyx_t_6);\n        __Pyx_INCREF(function);\n        __Pyx_DECREF_SET(__pyx_t_4, function);\n      }\n    }\n    if (!__pyx_t_6) {\n      __pyx_t_3 = __Pyx_PyObject_CallOneArg(__pyx_t_4, __pyx_t_5); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 984, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n      __Pyx_GOTREF(__pyx_t_3);\n    } else {\n      #if CYTHON_FAST_PYCALL\n      if (PyFunction_Check(__pyx_t_4)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_6, __pyx_t_5};\n        __pyx_t_3 = __Pyx_PyFunction_FastCall(__pyx_t_4, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 984, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_6); __pyx_t_6 = 0;\n        __Pyx_GOTREF(__pyx_t_3);\n        __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n      } else\n      #endif\n      #if CYTHON_FAST_PYCCALL\n      if (__Pyx_PyFastCFunction_Check(__pyx_t_4)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_6, __pyx_t_5};\n        __pyx_t_3 = __Pyx_PyCFunction_FastCall(__pyx_t_4, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 984, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_6); __pyx_t_6 = 0;\n        __Pyx_GOTREF(__pyx_t_3);\n        __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n      } else\n      #endif\n      {\n        __pyx_t_8 = PyTuple_New(1+1); if (unlikely(!__pyx_t_8)) __PYX_ERR(0, 984, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_8);\n        __Pyx_GIVEREF(__pyx_t_6); PyTuple_SET_ITEM(__pyx_t_8, 0, __pyx_t_6); __pyx_t_6 = NULL;\n        __Pyx_GIVEREF(__pyx_t_5);\n        PyTuple_SET_ITEM(__pyx_t_8, 0+1, __pyx_t_5);\n        __pyx_t_5 = 0;\n        __pyx_t_3 = __Pyx_PyObject_Call(__pyx_t_4, __pyx_t_8, NULL); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 984, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_3);\n        __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0;\n      }\n    }\n    __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n    __Pyx_Raise(__pyx_t_3, 0, 0, 0);\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    __PYX_ERR(0, 984, __pyx_L1_error)\n\n    /* \"pywrapfst.pyx\":983\n *     \"\"\"\n *     cdef fst.SymbolTable *tsyms = fst.SymbolTable.Read(tostring(filename))\n *     if tsyms == NULL:             # <<<<<<<<<<<<<<\n *       raise FstIOError(\"Read failed: {!r}\".format(filename))\n *     return _init_SymbolTable(tsyms)\n */\n  }\n\n  /* \"pywrapfst.pyx\":985\n *     if tsyms == NULL:\n *       raise FstIOError(\"Read failed: {!r}\".format(filename))\n *     return _init_SymbolTable(tsyms)             # <<<<<<<<<<<<<<\n * \n *   @classmethod\n */\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_3 = ((PyObject *)__pyx_f_9pywrapfst__init_SymbolTable(__pyx_v_tsyms)); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 985, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_3);\n  __pyx_r = __pyx_t_3;\n  __pyx_t_3 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":966\n * \n *   @classmethod\n *   def read(cls, filename):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     SymbolTable.read(filename)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_XDECREF(__pyx_t_6);\n  __Pyx_XDECREF(__pyx_t_7);\n  __Pyx_XDECREF(__pyx_t_8);\n  __Pyx_AddTraceback(\"pywrapfst.SymbolTable.read\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":988\n * \n *   @classmethod\n *   def read_text(cls, filename, bool allow_negative_labels=False):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     SymbolTable.read_text(filename)\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_11SymbolTable_7read_text(PyObject *__pyx_v_cls, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic char __pyx_doc_9pywrapfst_11SymbolTable_6read_text[] = \"\\n    SymbolTable.read_text(filename)\\n\\n    Reads symbol table from text file.\\n\\n    This class method creates a new SymbolTable from a symbol table text file.\\n\\n    Args:\\n      filename: The string location of the input text file.\\n      allow_negative_labels: Should negative labels be allowed? (Not\\n          recommended; may cause conflicts).\\n\\n    Returns:\\n      A new SymbolTable instance.\\n\\n    See also: `SymbolTable.read`, `SymbolTable.read_fst`.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_11SymbolTable_7read_text(PyObject *__pyx_v_cls, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  PyObject *__pyx_v_filename = 0;\n  bool __pyx_v_allow_negative_labels;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"read_text (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_filename,&__pyx_n_s_allow_negative_labels,0};\n    PyObject* values[2] = {0,0};\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (likely((values[0] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_filename)) != 0)) kw_args--;\n        else goto __pyx_L5_argtuple_error;\n        CYTHON_FALLTHROUGH;\n        case  1:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_allow_negative_labels);\n          if (value) { values[1] = value; kw_args--; }\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"read_text\") < 0)) __PYX_ERR(0, 988, __pyx_L3_error)\n      }\n    } else {\n      switch (PyTuple_GET_SIZE(__pyx_args)) {\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n    }\n    __pyx_v_filename = values[0];\n    if (values[1]) {\n      __pyx_v_allow_negative_labels = __Pyx_PyObject_IsTrue(values[1]); if (unlikely((__pyx_v_allow_negative_labels == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 988, __pyx_L3_error)\n    } else {\n      __pyx_v_allow_negative_labels = ((bool)0);\n    }\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"read_text\", 0, 1, 2, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 988, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst.SymbolTable.read_text\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  __pyx_r = __pyx_pf_9pywrapfst_11SymbolTable_6read_text(((PyTypeObject*)__pyx_v_cls), __pyx_v_filename, __pyx_v_allow_negative_labels);\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_11SymbolTable_6read_text(CYTHON_UNUSED PyTypeObject *__pyx_v_cls, PyObject *__pyx_v_filename, bool __pyx_v_allow_negative_labels) {\n  std::unique_ptr<fst::SymbolTableTextOptions>  __pyx_v_opts;\n  fst::SymbolTable *__pyx_v_tsyms;\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  std::string __pyx_t_1;\n  int __pyx_t_2;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  PyObject *__pyx_t_6 = NULL;\n  PyObject *__pyx_t_7 = NULL;\n  PyObject *__pyx_t_8 = NULL;\n  __Pyx_RefNannySetupContext(\"read_text\", 0);\n\n  /* \"pywrapfst.pyx\":1007\n *     \"\"\"\n *     cdef unique_ptr[fst.SymbolTableTextOptions] opts\n *     opts.reset(new fst.SymbolTableTextOptions(allow_negative_labels))             # <<<<<<<<<<<<<<\n *     cdef fst.SymbolTable *tsyms = fst.SymbolTable.ReadText(tostring(filename),\n *                                                            deref(opts))\n */\n  __pyx_v_opts.reset(new fst::SymbolTableTextOptions(__pyx_v_allow_negative_labels));\n\n  /* \"pywrapfst.pyx\":1008\n *     cdef unique_ptr[fst.SymbolTableTextOptions] opts\n *     opts.reset(new fst.SymbolTableTextOptions(allow_negative_labels))\n *     cdef fst.SymbolTable *tsyms = fst.SymbolTable.ReadText(tostring(filename),             # <<<<<<<<<<<<<<\n *                                                            deref(opts))\n *     if tsyms == NULL:\n */\n  __pyx_t_1 = __pyx_f_9pywrapfst_tostring(__pyx_v_filename, NULL); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 1008, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":1009\n *     opts.reset(new fst.SymbolTableTextOptions(allow_negative_labels))\n *     cdef fst.SymbolTable *tsyms = fst.SymbolTable.ReadText(tostring(filename),\n *                                                            deref(opts))             # <<<<<<<<<<<<<<\n *     if tsyms == NULL:\n *       raise FstIOError(\"Read failed: {!r}\".format(filename))\n */\n  __pyx_v_tsyms = fst::SymbolTable::ReadText(__pyx_t_1, (*__pyx_v_opts));\n\n  /* \"pywrapfst.pyx\":1010\n *     cdef fst.SymbolTable *tsyms = fst.SymbolTable.ReadText(tostring(filename),\n *                                                            deref(opts))\n *     if tsyms == NULL:             # <<<<<<<<<<<<<<\n *       raise FstIOError(\"Read failed: {!r}\".format(filename))\n *     return _init_SymbolTable(tsyms)\n */\n  __pyx_t_2 = ((__pyx_v_tsyms == NULL) != 0);\n  if (__pyx_t_2) {\n\n    /* \"pywrapfst.pyx\":1011\n *                                                            deref(opts))\n *     if tsyms == NULL:\n *       raise FstIOError(\"Read failed: {!r}\".format(filename))             # <<<<<<<<<<<<<<\n *     return _init_SymbolTable(tsyms)\n * \n */\n    __pyx_t_4 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstIOError); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 1011, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_4);\n    __pyx_t_6 = __Pyx_PyObject_GetAttrStr(__pyx_kp_s_Read_failed_r, __pyx_n_s_format); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 1011, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_6);\n    __pyx_t_7 = NULL;\n    if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_6))) {\n      __pyx_t_7 = PyMethod_GET_SELF(__pyx_t_6);\n      if (likely(__pyx_t_7)) {\n        PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_6);\n        __Pyx_INCREF(__pyx_t_7);\n        __Pyx_INCREF(function);\n        __Pyx_DECREF_SET(__pyx_t_6, function);\n      }\n    }\n    if (!__pyx_t_7) {\n      __pyx_t_5 = __Pyx_PyObject_CallOneArg(__pyx_t_6, __pyx_v_filename); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 1011, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_5);\n    } else {\n      #if CYTHON_FAST_PYCALL\n      if (PyFunction_Check(__pyx_t_6)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_7, __pyx_v_filename};\n        __pyx_t_5 = __Pyx_PyFunction_FastCall(__pyx_t_6, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 1011, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_7); __pyx_t_7 = 0;\n        __Pyx_GOTREF(__pyx_t_5);\n      } else\n      #endif\n      #if CYTHON_FAST_PYCCALL\n      if (__Pyx_PyFastCFunction_Check(__pyx_t_6)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_7, __pyx_v_filename};\n        __pyx_t_5 = __Pyx_PyCFunction_FastCall(__pyx_t_6, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 1011, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_7); __pyx_t_7 = 0;\n        __Pyx_GOTREF(__pyx_t_5);\n      } else\n      #endif\n      {\n        __pyx_t_8 = PyTuple_New(1+1); if (unlikely(!__pyx_t_8)) __PYX_ERR(0, 1011, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_8);\n        __Pyx_GIVEREF(__pyx_t_7); PyTuple_SET_ITEM(__pyx_t_8, 0, __pyx_t_7); __pyx_t_7 = NULL;\n        __Pyx_INCREF(__pyx_v_filename);\n        __Pyx_GIVEREF(__pyx_v_filename);\n        PyTuple_SET_ITEM(__pyx_t_8, 0+1, __pyx_v_filename);\n        __pyx_t_5 = __Pyx_PyObject_Call(__pyx_t_6, __pyx_t_8, NULL); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 1011, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_5);\n        __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0;\n      }\n    }\n    __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n    __pyx_t_6 = NULL;\n    if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_4))) {\n      __pyx_t_6 = PyMethod_GET_SELF(__pyx_t_4);\n      if (likely(__pyx_t_6)) {\n        PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_4);\n        __Pyx_INCREF(__pyx_t_6);\n        __Pyx_INCREF(function);\n        __Pyx_DECREF_SET(__pyx_t_4, function);\n      }\n    }\n    if (!__pyx_t_6) {\n      __pyx_t_3 = __Pyx_PyObject_CallOneArg(__pyx_t_4, __pyx_t_5); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 1011, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n      __Pyx_GOTREF(__pyx_t_3);\n    } else {\n      #if CYTHON_FAST_PYCALL\n      if (PyFunction_Check(__pyx_t_4)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_6, __pyx_t_5};\n        __pyx_t_3 = __Pyx_PyFunction_FastCall(__pyx_t_4, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 1011, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_6); __pyx_t_6 = 0;\n        __Pyx_GOTREF(__pyx_t_3);\n        __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n      } else\n      #endif\n      #if CYTHON_FAST_PYCCALL\n      if (__Pyx_PyFastCFunction_Check(__pyx_t_4)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_6, __pyx_t_5};\n        __pyx_t_3 = __Pyx_PyCFunction_FastCall(__pyx_t_4, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 1011, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_6); __pyx_t_6 = 0;\n        __Pyx_GOTREF(__pyx_t_3);\n        __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n      } else\n      #endif\n      {\n        __pyx_t_8 = PyTuple_New(1+1); if (unlikely(!__pyx_t_8)) __PYX_ERR(0, 1011, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_8);\n        __Pyx_GIVEREF(__pyx_t_6); PyTuple_SET_ITEM(__pyx_t_8, 0, __pyx_t_6); __pyx_t_6 = NULL;\n        __Pyx_GIVEREF(__pyx_t_5);\n        PyTuple_SET_ITEM(__pyx_t_8, 0+1, __pyx_t_5);\n        __pyx_t_5 = 0;\n        __pyx_t_3 = __Pyx_PyObject_Call(__pyx_t_4, __pyx_t_8, NULL); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 1011, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_3);\n        __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0;\n      }\n    }\n    __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n    __Pyx_Raise(__pyx_t_3, 0, 0, 0);\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    __PYX_ERR(0, 1011, __pyx_L1_error)\n\n    /* \"pywrapfst.pyx\":1010\n *     cdef fst.SymbolTable *tsyms = fst.SymbolTable.ReadText(tostring(filename),\n *                                                            deref(opts))\n *     if tsyms == NULL:             # <<<<<<<<<<<<<<\n *       raise FstIOError(\"Read failed: {!r}\".format(filename))\n *     return _init_SymbolTable(tsyms)\n */\n  }\n\n  /* \"pywrapfst.pyx\":1012\n *     if tsyms == NULL:\n *       raise FstIOError(\"Read failed: {!r}\".format(filename))\n *     return _init_SymbolTable(tsyms)             # <<<<<<<<<<<<<<\n * \n *   @classmethod\n */\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_3 = ((PyObject *)__pyx_f_9pywrapfst__init_SymbolTable(__pyx_v_tsyms)); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 1012, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_3);\n  __pyx_r = __pyx_t_3;\n  __pyx_t_3 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":988\n * \n *   @classmethod\n *   def read_text(cls, filename, bool allow_negative_labels=False):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     SymbolTable.read_text(filename)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_XDECREF(__pyx_t_6);\n  __Pyx_XDECREF(__pyx_t_7);\n  __Pyx_XDECREF(__pyx_t_8);\n  __Pyx_AddTraceback(\"pywrapfst.SymbolTable.read_text\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1015\n * \n *   @classmethod\n *   def read_fst(cls, filename, bool input_table):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     SymbolTable.read_fst(filename, input_table)\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_11SymbolTable_9read_fst(PyObject *__pyx_v_cls, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic char __pyx_doc_9pywrapfst_11SymbolTable_8read_fst[] = \"\\n    SymbolTable.read_fst(filename, input_table)\\n\\n    Reads symbol table from an FST file without loading the corresponding FST.\\n\\n    This class method creates a new SymbolTable by reading either the input or\\n    output symbol table from an FST file, without loading the corresponding FST.\\n\\n    Args:\\n      filename: The string location of the input FST file.\\n      input_table: Should the input table be read (True) or the output table\\n          (False)?\\n\\n    Returns:\\n      A new SymbolTable instance, or None if none can be read.\\n\\n    Raises:\\n      FstIOError: Read failed.\\n\\n    See also: `SymbolTable.read`, `SymbolTable.read_text`.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_11SymbolTable_9read_fst(PyObject *__pyx_v_cls, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  PyObject *__pyx_v_filename = 0;\n  bool __pyx_v_input_table;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"read_fst (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_filename,&__pyx_n_s_input_table,0};\n    PyObject* values[2] = {0,0};\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (likely((values[0] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_filename)) != 0)) kw_args--;\n        else goto __pyx_L5_argtuple_error;\n        CYTHON_FALLTHROUGH;\n        case  1:\n        if (likely((values[1] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_input_table)) != 0)) kw_args--;\n        else {\n          __Pyx_RaiseArgtupleInvalid(\"read_fst\", 1, 2, 2, 1); __PYX_ERR(0, 1015, __pyx_L3_error)\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"read_fst\") < 0)) __PYX_ERR(0, 1015, __pyx_L3_error)\n      }\n    } else if (PyTuple_GET_SIZE(__pyx_args) != 2) {\n      goto __pyx_L5_argtuple_error;\n    } else {\n      values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n      values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n    }\n    __pyx_v_filename = values[0];\n    __pyx_v_input_table = __Pyx_PyObject_IsTrue(values[1]); if (unlikely((__pyx_v_input_table == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 1015, __pyx_L3_error)\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"read_fst\", 1, 2, 2, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 1015, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst.SymbolTable.read_fst\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  __pyx_r = __pyx_pf_9pywrapfst_11SymbolTable_8read_fst(((PyTypeObject*)__pyx_v_cls), __pyx_v_filename, __pyx_v_input_table);\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_11SymbolTable_8read_fst(CYTHON_UNUSED PyTypeObject *__pyx_v_cls, PyObject *__pyx_v_filename, bool __pyx_v_input_table) {\n  fst::SymbolTable *__pyx_v_tsyms;\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  std::string __pyx_t_1;\n  int __pyx_t_2;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  PyObject *__pyx_t_6 = NULL;\n  PyObject *__pyx_t_7 = NULL;\n  PyObject *__pyx_t_8 = NULL;\n  __Pyx_RefNannySetupContext(\"read_fst\", 0);\n\n  /* \"pywrapfst.pyx\":1037\n *     See also: `SymbolTable.read`, `SymbolTable.read_text`.\n *     \"\"\"\n *     cdef fst.SymbolTable *tsyms = fst.FstReadSymbols(filename, input_table)             # <<<<<<<<<<<<<<\n *     if tsyms == NULL:\n *       raise FstIOError(\"Read failed: {!r}\".format(filename))\n */\n  __pyx_t_1 = __pyx_convert_string_from_py_std__in_string(__pyx_v_filename); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 1037, __pyx_L1_error)\n  __pyx_v_tsyms = fst::FstReadSymbols(__pyx_t_1, __pyx_v_input_table);\n\n  /* \"pywrapfst.pyx\":1038\n *     \"\"\"\n *     cdef fst.SymbolTable *tsyms = fst.FstReadSymbols(filename, input_table)\n *     if tsyms == NULL:             # <<<<<<<<<<<<<<\n *       raise FstIOError(\"Read failed: {!r}\".format(filename))\n *     return _init_SymbolTable(tsyms)\n */\n  __pyx_t_2 = ((__pyx_v_tsyms == NULL) != 0);\n  if (__pyx_t_2) {\n\n    /* \"pywrapfst.pyx\":1039\n *     cdef fst.SymbolTable *tsyms = fst.FstReadSymbols(filename, input_table)\n *     if tsyms == NULL:\n *       raise FstIOError(\"Read failed: {!r}\".format(filename))             # <<<<<<<<<<<<<<\n *     return _init_SymbolTable(tsyms)\n * \n */\n    __pyx_t_4 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstIOError); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 1039, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_4);\n    __pyx_t_6 = __Pyx_PyObject_GetAttrStr(__pyx_kp_s_Read_failed_r, __pyx_n_s_format); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 1039, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_6);\n    __pyx_t_7 = NULL;\n    if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_6))) {\n      __pyx_t_7 = PyMethod_GET_SELF(__pyx_t_6);\n      if (likely(__pyx_t_7)) {\n        PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_6);\n        __Pyx_INCREF(__pyx_t_7);\n        __Pyx_INCREF(function);\n        __Pyx_DECREF_SET(__pyx_t_6, function);\n      }\n    }\n    if (!__pyx_t_7) {\n      __pyx_t_5 = __Pyx_PyObject_CallOneArg(__pyx_t_6, __pyx_v_filename); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 1039, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_5);\n    } else {\n      #if CYTHON_FAST_PYCALL\n      if (PyFunction_Check(__pyx_t_6)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_7, __pyx_v_filename};\n        __pyx_t_5 = __Pyx_PyFunction_FastCall(__pyx_t_6, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 1039, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_7); __pyx_t_7 = 0;\n        __Pyx_GOTREF(__pyx_t_5);\n      } else\n      #endif\n      #if CYTHON_FAST_PYCCALL\n      if (__Pyx_PyFastCFunction_Check(__pyx_t_6)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_7, __pyx_v_filename};\n        __pyx_t_5 = __Pyx_PyCFunction_FastCall(__pyx_t_6, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 1039, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_7); __pyx_t_7 = 0;\n        __Pyx_GOTREF(__pyx_t_5);\n      } else\n      #endif\n      {\n        __pyx_t_8 = PyTuple_New(1+1); if (unlikely(!__pyx_t_8)) __PYX_ERR(0, 1039, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_8);\n        __Pyx_GIVEREF(__pyx_t_7); PyTuple_SET_ITEM(__pyx_t_8, 0, __pyx_t_7); __pyx_t_7 = NULL;\n        __Pyx_INCREF(__pyx_v_filename);\n        __Pyx_GIVEREF(__pyx_v_filename);\n        PyTuple_SET_ITEM(__pyx_t_8, 0+1, __pyx_v_filename);\n        __pyx_t_5 = __Pyx_PyObject_Call(__pyx_t_6, __pyx_t_8, NULL); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 1039, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_5);\n        __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0;\n      }\n    }\n    __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n    __pyx_t_6 = NULL;\n    if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_4))) {\n      __pyx_t_6 = PyMethod_GET_SELF(__pyx_t_4);\n      if (likely(__pyx_t_6)) {\n        PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_4);\n        __Pyx_INCREF(__pyx_t_6);\n        __Pyx_INCREF(function);\n        __Pyx_DECREF_SET(__pyx_t_4, function);\n      }\n    }\n    if (!__pyx_t_6) {\n      __pyx_t_3 = __Pyx_PyObject_CallOneArg(__pyx_t_4, __pyx_t_5); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 1039, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n      __Pyx_GOTREF(__pyx_t_3);\n    } else {\n      #if CYTHON_FAST_PYCALL\n      if (PyFunction_Check(__pyx_t_4)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_6, __pyx_t_5};\n        __pyx_t_3 = __Pyx_PyFunction_FastCall(__pyx_t_4, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 1039, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_6); __pyx_t_6 = 0;\n        __Pyx_GOTREF(__pyx_t_3);\n        __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n      } else\n      #endif\n      #if CYTHON_FAST_PYCCALL\n      if (__Pyx_PyFastCFunction_Check(__pyx_t_4)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_6, __pyx_t_5};\n        __pyx_t_3 = __Pyx_PyCFunction_FastCall(__pyx_t_4, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 1039, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_6); __pyx_t_6 = 0;\n        __Pyx_GOTREF(__pyx_t_3);\n        __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n      } else\n      #endif\n      {\n        __pyx_t_8 = PyTuple_New(1+1); if (unlikely(!__pyx_t_8)) __PYX_ERR(0, 1039, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_8);\n        __Pyx_GIVEREF(__pyx_t_6); PyTuple_SET_ITEM(__pyx_t_8, 0, __pyx_t_6); __pyx_t_6 = NULL;\n        __Pyx_GIVEREF(__pyx_t_5);\n        PyTuple_SET_ITEM(__pyx_t_8, 0+1, __pyx_t_5);\n        __pyx_t_5 = 0;\n        __pyx_t_3 = __Pyx_PyObject_Call(__pyx_t_4, __pyx_t_8, NULL); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 1039, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_3);\n        __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0;\n      }\n    }\n    __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n    __Pyx_Raise(__pyx_t_3, 0, 0, 0);\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    __PYX_ERR(0, 1039, __pyx_L1_error)\n\n    /* \"pywrapfst.pyx\":1038\n *     \"\"\"\n *     cdef fst.SymbolTable *tsyms = fst.FstReadSymbols(filename, input_table)\n *     if tsyms == NULL:             # <<<<<<<<<<<<<<\n *       raise FstIOError(\"Read failed: {!r}\".format(filename))\n *     return _init_SymbolTable(tsyms)\n */\n  }\n\n  /* \"pywrapfst.pyx\":1040\n *     if tsyms == NULL:\n *       raise FstIOError(\"Read failed: {!r}\".format(filename))\n *     return _init_SymbolTable(tsyms)             # <<<<<<<<<<<<<<\n * \n * \n */\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_3 = ((PyObject *)__pyx_f_9pywrapfst__init_SymbolTable(__pyx_v_tsyms)); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 1040, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_3);\n  __pyx_r = __pyx_t_3;\n  __pyx_t_3 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":1015\n * \n *   @classmethod\n *   def read_fst(cls, filename, bool input_table):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     SymbolTable.read_fst(filename, input_table)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_XDECREF(__pyx_t_6);\n  __Pyx_XDECREF(__pyx_t_7);\n  __Pyx_XDECREF(__pyx_t_8);\n  __Pyx_AddTraceback(\"pywrapfst.SymbolTable.read_fst\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"(tree fragment)\":1\n * def __reduce_cython__(self):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._smart_table,self._table cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_11SymbolTable_11__reduce_cython__(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_11SymbolTable_11__reduce_cython__(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__reduce_cython__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_11SymbolTable_10__reduce_cython__(((struct __pyx_obj_9pywrapfst_SymbolTable *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_11SymbolTable_10__reduce_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst_SymbolTable *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"__reduce_cython__\", 0);\n\n  /* \"(tree fragment)\":2\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._smart_table,self._table cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._smart_table,self._table cannot be converted to a Python object for pickling\")\n */\n  __pyx_t_1 = __Pyx_PyObject_Call(__pyx_builtin_TypeError, __pyx_tuple__18, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(1, 2, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __Pyx_Raise(__pyx_t_1, 0, 0, 0);\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  __PYX_ERR(1, 2, __pyx_L1_error)\n\n  /* \"(tree fragment)\":1\n * def __reduce_cython__(self):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._smart_table,self._table cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.SymbolTable.__reduce_cython__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"(tree fragment)\":3\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._smart_table,self._table cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._smart_table,self._table cannot be converted to a Python object for pickling\")\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_11SymbolTable_13__setstate_cython__(PyObject *__pyx_v_self, PyObject *__pyx_v___pyx_state); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_11SymbolTable_13__setstate_cython__(PyObject *__pyx_v_self, PyObject *__pyx_v___pyx_state) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__setstate_cython__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_11SymbolTable_12__setstate_cython__(((struct __pyx_obj_9pywrapfst_SymbolTable *)__pyx_v_self), ((PyObject *)__pyx_v___pyx_state));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_11SymbolTable_12__setstate_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst_SymbolTable *__pyx_v_self, CYTHON_UNUSED PyObject *__pyx_v___pyx_state) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"__setstate_cython__\", 0);\n\n  /* \"(tree fragment)\":4\n *     raise TypeError(\"self._smart_table,self._table cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._smart_table,self._table cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n */\n  __pyx_t_1 = __Pyx_PyObject_Call(__pyx_builtin_TypeError, __pyx_tuple__19, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(1, 4, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __Pyx_Raise(__pyx_t_1, 0, 0, 0);\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  __PYX_ERR(1, 4, __pyx_L1_error)\n\n  /* \"(tree fragment)\":3\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._smart_table,self._table cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._smart_table,self._table cannot be converted to a Python object for pickling\")\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.SymbolTable.__setstate_cython__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1043\n * \n * \n * cdef _EncodeMapperSymbolTable _init_EncodeMapperSymbolTable(             # <<<<<<<<<<<<<<\n *     fst.SymbolTable *table, shared_ptr[fst.EncodeMapperClass] encoder):\n *   cdef _EncodeMapperSymbolTable result = (\n */\n\nstatic struct __pyx_obj_9pywrapfst__EncodeMapperSymbolTable *__pyx_f_9pywrapfst__init_EncodeMapperSymbolTable(fst::SymbolTable *__pyx_v_table, std::shared_ptr<fst::script::EncodeMapperClass>  __pyx_v_encoder) {\n  struct __pyx_obj_9pywrapfst__EncodeMapperSymbolTable *__pyx_v_result = 0;\n  struct __pyx_obj_9pywrapfst__EncodeMapperSymbolTable *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"_init_EncodeMapperSymbolTable\", 0);\n\n  /* \"pywrapfst.pyx\":1046\n *     fst.SymbolTable *table, shared_ptr[fst.EncodeMapperClass] encoder):\n *   cdef _EncodeMapperSymbolTable result = (\n *       _EncodeMapperSymbolTable.__new__(_EncodeMapperSymbolTable))             # <<<<<<<<<<<<<<\n *   result._table = table\n *   result._encoder = encoder\n */\n  __pyx_t_1 = __pyx_tp_new_9pywrapfst__EncodeMapperSymbolTable(((PyTypeObject *)__pyx_ptype_9pywrapfst__EncodeMapperSymbolTable), __pyx_empty_tuple, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1046, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (!(likely(__Pyx_TypeTest(__pyx_t_1, __pyx_ptype_9pywrapfst__EncodeMapperSymbolTable)))) __PYX_ERR(0, 1046, __pyx_L1_error)\n  __pyx_v_result = ((struct __pyx_obj_9pywrapfst__EncodeMapperSymbolTable *)__pyx_t_1);\n  __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":1047\n *   cdef _EncodeMapperSymbolTable result = (\n *       _EncodeMapperSymbolTable.__new__(_EncodeMapperSymbolTable))\n *   result._table = table             # <<<<<<<<<<<<<<\n *   result._encoder = encoder\n *   return result\n */\n  if (unlikely(((PyObject *)__pyx_v_result) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_table\");\n    __PYX_ERR(0, 1047, __pyx_L1_error)\n  }\n  __pyx_v_result->__pyx_base._table = __pyx_v_table;\n\n  /* \"pywrapfst.pyx\":1048\n *       _EncodeMapperSymbolTable.__new__(_EncodeMapperSymbolTable))\n *   result._table = table\n *   result._encoder = encoder             # <<<<<<<<<<<<<<\n *   return result\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_result) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_encoder\");\n    __PYX_ERR(0, 1048, __pyx_L1_error)\n  }\n  __pyx_v_result->_encoder = __pyx_v_encoder;\n\n  /* \"pywrapfst.pyx\":1049\n *   result._table = table\n *   result._encoder = encoder\n *   return result             # <<<<<<<<<<<<<<\n * \n * \n */\n  __Pyx_XDECREF(((PyObject *)__pyx_r));\n  __Pyx_INCREF(((PyObject *)__pyx_v_result));\n  __pyx_r = __pyx_v_result;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":1043\n * \n * \n * cdef _EncodeMapperSymbolTable _init_EncodeMapperSymbolTable(             # <<<<<<<<<<<<<<\n *     fst.SymbolTable *table, shared_ptr[fst.EncodeMapperClass] encoder):\n *   cdef _EncodeMapperSymbolTable result = (\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst._init_EncodeMapperSymbolTable\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XDECREF((PyObject *)__pyx_v_result);\n  __Pyx_XGIVEREF((PyObject *)__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1052\n * \n * \n * cdef _FstSymbolTable _init_FstSymbolTable(fst.SymbolTable *table,             # <<<<<<<<<<<<<<\n *                                           shared_ptr[fst.FstClass] ifst):\n *   cdef _FstSymbolTable result = _FstSymbolTable.__new__(_FstSymbolTable)\n */\n\nstatic struct __pyx_obj_9pywrapfst__FstSymbolTable *__pyx_f_9pywrapfst__init_FstSymbolTable(fst::SymbolTable *__pyx_v_table, std::shared_ptr<fst::script::FstClass>  __pyx_v_ifst) {\n  struct __pyx_obj_9pywrapfst__FstSymbolTable *__pyx_v_result = 0;\n  struct __pyx_obj_9pywrapfst__FstSymbolTable *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"_init_FstSymbolTable\", 0);\n\n  /* \"pywrapfst.pyx\":1054\n * cdef _FstSymbolTable _init_FstSymbolTable(fst.SymbolTable *table,\n *                                           shared_ptr[fst.FstClass] ifst):\n *   cdef _FstSymbolTable result = _FstSymbolTable.__new__(_FstSymbolTable)             # <<<<<<<<<<<<<<\n *   result._table = table\n *   result._fst = ifst\n */\n  __pyx_t_1 = __pyx_tp_new_9pywrapfst__FstSymbolTable(((PyTypeObject *)__pyx_ptype_9pywrapfst__FstSymbolTable), __pyx_empty_tuple, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1054, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (!(likely(__Pyx_TypeTest(__pyx_t_1, __pyx_ptype_9pywrapfst__FstSymbolTable)))) __PYX_ERR(0, 1054, __pyx_L1_error)\n  __pyx_v_result = ((struct __pyx_obj_9pywrapfst__FstSymbolTable *)__pyx_t_1);\n  __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":1055\n *                                           shared_ptr[fst.FstClass] ifst):\n *   cdef _FstSymbolTable result = _FstSymbolTable.__new__(_FstSymbolTable)\n *   result._table = table             # <<<<<<<<<<<<<<\n *   result._fst = ifst\n *   return result\n */\n  if (unlikely(((PyObject *)__pyx_v_result) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_table\");\n    __PYX_ERR(0, 1055, __pyx_L1_error)\n  }\n  __pyx_v_result->__pyx_base._table = __pyx_v_table;\n\n  /* \"pywrapfst.pyx\":1056\n *   cdef _FstSymbolTable result = _FstSymbolTable.__new__(_FstSymbolTable)\n *   result._table = table\n *   result._fst = ifst             # <<<<<<<<<<<<<<\n *   return result\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_result) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 1056, __pyx_L1_error)\n  }\n  __pyx_v_result->_fst = __pyx_v_ifst;\n\n  /* \"pywrapfst.pyx\":1057\n *   result._table = table\n *   result._fst = ifst\n *   return result             # <<<<<<<<<<<<<<\n * \n * \n */\n  __Pyx_XDECREF(((PyObject *)__pyx_r));\n  __Pyx_INCREF(((PyObject *)__pyx_v_result));\n  __pyx_r = __pyx_v_result;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":1052\n * \n * \n * cdef _FstSymbolTable _init_FstSymbolTable(fst.SymbolTable *table,             # <<<<<<<<<<<<<<\n *                                           shared_ptr[fst.FstClass] ifst):\n *   cdef _FstSymbolTable result = _FstSymbolTable.__new__(_FstSymbolTable)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst._init_FstSymbolTable\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XDECREF((PyObject *)__pyx_v_result);\n  __Pyx_XGIVEREF((PyObject *)__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1060\n * \n * \n * cdef _MutableFstSymbolTable _init_MutableFstSymbolTable(fst.SymbolTable *table,             # <<<<<<<<<<<<<<\n *     shared_ptr[fst.MutableFstClass] ifst):\n *   cdef _MutableFstSymbolTable result = (\n */\n\nstatic struct __pyx_obj_9pywrapfst__MutableFstSymbolTable *__pyx_f_9pywrapfst__init_MutableFstSymbolTable(fst::SymbolTable *__pyx_v_table, std::shared_ptr<fst::script::MutableFstClass>  __pyx_v_ifst) {\n  struct __pyx_obj_9pywrapfst__MutableFstSymbolTable *__pyx_v_result = 0;\n  struct __pyx_obj_9pywrapfst__MutableFstSymbolTable *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"_init_MutableFstSymbolTable\", 0);\n\n  /* \"pywrapfst.pyx\":1063\n *     shared_ptr[fst.MutableFstClass] ifst):\n *   cdef _MutableFstSymbolTable result = (\n *       _MutableFstSymbolTable.__new__(_MutableFstSymbolTable))             # <<<<<<<<<<<<<<\n *   result._table = table\n *   result._mfst = ifst\n */\n  __pyx_t_1 = __pyx_tp_new_9pywrapfst__MutableFstSymbolTable(((PyTypeObject *)__pyx_ptype_9pywrapfst__MutableFstSymbolTable), __pyx_empty_tuple, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1063, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (!(likely(__Pyx_TypeTest(__pyx_t_1, __pyx_ptype_9pywrapfst__MutableFstSymbolTable)))) __PYX_ERR(0, 1063, __pyx_L1_error)\n  __pyx_v_result = ((struct __pyx_obj_9pywrapfst__MutableFstSymbolTable *)__pyx_t_1);\n  __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":1064\n *   cdef _MutableFstSymbolTable result = (\n *       _MutableFstSymbolTable.__new__(_MutableFstSymbolTable))\n *   result._table = table             # <<<<<<<<<<<<<<\n *   result._mfst = ifst\n *   return result\n */\n  if (unlikely(((PyObject *)__pyx_v_result) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_table\");\n    __PYX_ERR(0, 1064, __pyx_L1_error)\n  }\n  __pyx_v_result->__pyx_base.__pyx_base._table = __pyx_v_table;\n\n  /* \"pywrapfst.pyx\":1065\n *       _MutableFstSymbolTable.__new__(_MutableFstSymbolTable))\n *   result._table = table\n *   result._mfst = ifst             # <<<<<<<<<<<<<<\n *   return result\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_result) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_mfst\");\n    __PYX_ERR(0, 1065, __pyx_L1_error)\n  }\n  __pyx_v_result->_mfst = __pyx_v_ifst;\n\n  /* \"pywrapfst.pyx\":1066\n *   result._table = table\n *   result._mfst = ifst\n *   return result             # <<<<<<<<<<<<<<\n * \n * \n */\n  __Pyx_XDECREF(((PyObject *)__pyx_r));\n  __Pyx_INCREF(((PyObject *)__pyx_v_result));\n  __pyx_r = __pyx_v_result;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":1060\n * \n * \n * cdef _MutableFstSymbolTable _init_MutableFstSymbolTable(fst.SymbolTable *table,             # <<<<<<<<<<<<<<\n *     shared_ptr[fst.MutableFstClass] ifst):\n *   cdef _MutableFstSymbolTable result = (\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst._init_MutableFstSymbolTable\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XDECREF((PyObject *)__pyx_v_result);\n  __Pyx_XGIVEREF((PyObject *)__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1069\n * \n * \n * cdef SymbolTable _init_SymbolTable(fst.SymbolTable *table):             # <<<<<<<<<<<<<<\n *   cdef SymbolTable result = SymbolTable.__new__(SymbolTable)\n *   result._table = table\n */\n\nstatic struct __pyx_obj_9pywrapfst_SymbolTable *__pyx_f_9pywrapfst__init_SymbolTable(fst::SymbolTable *__pyx_v_table) {\n  struct __pyx_obj_9pywrapfst_SymbolTable *__pyx_v_result = 0;\n  struct __pyx_obj_9pywrapfst_SymbolTable *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"_init_SymbolTable\", 0);\n\n  /* \"pywrapfst.pyx\":1070\n * \n * cdef SymbolTable _init_SymbolTable(fst.SymbolTable *table):\n *   cdef SymbolTable result = SymbolTable.__new__(SymbolTable)             # <<<<<<<<<<<<<<\n *   result._table = table\n *   return result\n */\n  __pyx_t_1 = __pyx_tp_new_9pywrapfst_SymbolTable(((PyTypeObject *)__pyx_ptype_9pywrapfst_SymbolTable), __pyx_empty_tuple, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1070, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (!(likely(__Pyx_TypeTest(__pyx_t_1, __pyx_ptype_9pywrapfst_SymbolTable)))) __PYX_ERR(0, 1070, __pyx_L1_error)\n  __pyx_v_result = ((struct __pyx_obj_9pywrapfst_SymbolTable *)__pyx_t_1);\n  __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":1071\n * cdef SymbolTable _init_SymbolTable(fst.SymbolTable *table):\n *   cdef SymbolTable result = SymbolTable.__new__(SymbolTable)\n *   result._table = table             # <<<<<<<<<<<<<<\n *   return result\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_result) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_table\");\n    __PYX_ERR(0, 1071, __pyx_L1_error)\n  }\n  __pyx_v_result->__pyx_base.__pyx_base._table = __pyx_v_table;\n\n  /* \"pywrapfst.pyx\":1072\n *   cdef SymbolTable result = SymbolTable.__new__(SymbolTable)\n *   result._table = table\n *   return result             # <<<<<<<<<<<<<<\n * \n * \n */\n  __Pyx_XDECREF(((PyObject *)__pyx_r));\n  __Pyx_INCREF(((PyObject *)__pyx_v_result));\n  __pyx_r = __pyx_v_result;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":1069\n * \n * \n * cdef SymbolTable _init_SymbolTable(fst.SymbolTable *table):             # <<<<<<<<<<<<<<\n *   cdef SymbolTable result = SymbolTable.__new__(SymbolTable)\n *   result._table = table\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst._init_SymbolTable\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XDECREF((PyObject *)__pyx_v_result);\n  __Pyx_XGIVEREF((PyObject *)__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1078\n * \n * \n * cpdef SymbolTable compact_symbol_table(_SymbolTable syms):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   compact_symbol_table(syms)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_9compact_symbol_table(PyObject *__pyx_self, PyObject *__pyx_v_syms); /*proto*/\nstatic struct __pyx_obj_9pywrapfst_SymbolTable *__pyx_f_9pywrapfst_compact_symbol_table(struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_syms, CYTHON_UNUSED int __pyx_skip_dispatch) {\n  struct __pyx_obj_9pywrapfst_SymbolTable *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"compact_symbol_table\", 0);\n\n  /* \"pywrapfst.pyx\":1090\n *     A new compacted SymbolTable.\n *   \"\"\"\n *   return _init_SymbolTable(fst.CompactSymbolTable(deref(syms._table)))             # <<<<<<<<<<<<<<\n * \n * \n */\n  __Pyx_XDECREF(((PyObject *)__pyx_r));\n  if (unlikely(((PyObject *)__pyx_v_syms) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_table\");\n    __PYX_ERR(0, 1090, __pyx_L1_error)\n  }\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst__init_SymbolTable(fst::CompactSymbolTable((*__pyx_v_syms->_table)))); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1090, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = ((struct __pyx_obj_9pywrapfst_SymbolTable *)__pyx_t_1);\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":1078\n * \n * \n * cpdef SymbolTable compact_symbol_table(_SymbolTable syms):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   compact_symbol_table(syms)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.compact_symbol_table\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XGIVEREF((PyObject *)__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_9compact_symbol_table(PyObject *__pyx_self, PyObject *__pyx_v_syms); /*proto*/\nstatic char __pyx_doc_9pywrapfst_8compact_symbol_table[] = \"\\n  compact_symbol_table(syms)\\n\\n  Constructively relabels a SymbolTable to make it a contiguous mapping.\\n\\n  Args:\\n    syms: Input SymbolTable.\\n\\n  Returns:\\n    A new compacted SymbolTable.\\n  \";\nstatic PyObject *__pyx_pw_9pywrapfst_9compact_symbol_table(PyObject *__pyx_self, PyObject *__pyx_v_syms) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"compact_symbol_table (wrapper)\", 0);\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_syms), __pyx_ptype_9pywrapfst__SymbolTable, 1, \"syms\", 0))) __PYX_ERR(0, 1078, __pyx_L1_error)\n  __pyx_r = __pyx_pf_9pywrapfst_8compact_symbol_table(__pyx_self, ((struct __pyx_obj_9pywrapfst__SymbolTable *)__pyx_v_syms));\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_8compact_symbol_table(CYTHON_UNUSED PyObject *__pyx_self, struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_syms) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"compact_symbol_table\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst_compact_symbol_table(__pyx_v_syms, 0)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1078, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.compact_symbol_table\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1093\n * \n * \n * cpdef SymbolTable merge_symbol_table(_SymbolTable lhs, _SymbolTable rhs):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   merge_symbol_table(lhs, rhs)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_11merge_symbol_table(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic struct __pyx_obj_9pywrapfst_SymbolTable *__pyx_f_9pywrapfst_merge_symbol_table(struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_lhs, struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_rhs, CYTHON_UNUSED int __pyx_skip_dispatch) {\n  struct __pyx_obj_9pywrapfst_SymbolTable *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"merge_symbol_table\", 0);\n\n  /* \"pywrapfst.pyx\":1117\n *   See also: `relabel_symbols`.\n *   \"\"\"\n *   return _init_SymbolTable(fst.MergeSymbolTable(deref(lhs._table),             # <<<<<<<<<<<<<<\n *                                                 deref(rhs._table), NULL))\n * \n */\n  __Pyx_XDECREF(((PyObject *)__pyx_r));\n  if (unlikely(((PyObject *)__pyx_v_lhs) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_table\");\n    __PYX_ERR(0, 1117, __pyx_L1_error)\n  }\n\n  /* \"pywrapfst.pyx\":1118\n *   \"\"\"\n *   return _init_SymbolTable(fst.MergeSymbolTable(deref(lhs._table),\n *                                                 deref(rhs._table), NULL))             # <<<<<<<<<<<<<<\n * \n * \n */\n  if (unlikely(((PyObject *)__pyx_v_rhs) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_table\");\n    __PYX_ERR(0, 1118, __pyx_L1_error)\n  }\n\n  /* \"pywrapfst.pyx\":1117\n *   See also: `relabel_symbols`.\n *   \"\"\"\n *   return _init_SymbolTable(fst.MergeSymbolTable(deref(lhs._table),             # <<<<<<<<<<<<<<\n *                                                 deref(rhs._table), NULL))\n * \n */\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst__init_SymbolTable(fst::MergeSymbolTable((*__pyx_v_lhs->_table), (*__pyx_v_rhs->_table), NULL))); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1117, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = ((struct __pyx_obj_9pywrapfst_SymbolTable *)__pyx_t_1);\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":1093\n * \n * \n * cpdef SymbolTable merge_symbol_table(_SymbolTable lhs, _SymbolTable rhs):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   merge_symbol_table(lhs, rhs)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.merge_symbol_table\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XGIVEREF((PyObject *)__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_11merge_symbol_table(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic char __pyx_doc_9pywrapfst_10merge_symbol_table[] = \"\\n  merge_symbol_table(lhs, rhs)\\n\\n  Merges all symbols from the left table into the right.\\n\\n  This function creates a new SymbolTable which is the merger of the two input\\n  symbol Tables. Symbols in the right-hand table that conflict with those in the\\n  left-hand table will be assigned values from the left-hand table. Thus the\\n  returned table will never modify symbol assignments from the left-hand side,\\n  but may do so on the right.\\n\\n  If the left-hand table is associated with an FST, it may be necessary to\\n  relabel it using the output table.\\n\\n  Args:\\n    lhs: Left-hand side SymbolTable.\\n    rhs: Left-hand side SymbolTable.\\n\\n  Returns:\\n    A new merged SymbolTable.\\n\\n  See also: `relabel_symbols`.\\n  \";\nstatic PyObject *__pyx_pw_9pywrapfst_11merge_symbol_table(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_lhs = 0;\n  struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_rhs = 0;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"merge_symbol_table (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_lhs,&__pyx_n_s_rhs,0};\n    PyObject* values[2] = {0,0};\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (likely((values[0] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_lhs)) != 0)) kw_args--;\n        else goto __pyx_L5_argtuple_error;\n        CYTHON_FALLTHROUGH;\n        case  1:\n        if (likely((values[1] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_rhs)) != 0)) kw_args--;\n        else {\n          __Pyx_RaiseArgtupleInvalid(\"merge_symbol_table\", 1, 2, 2, 1); __PYX_ERR(0, 1093, __pyx_L3_error)\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"merge_symbol_table\") < 0)) __PYX_ERR(0, 1093, __pyx_L3_error)\n      }\n    } else if (PyTuple_GET_SIZE(__pyx_args) != 2) {\n      goto __pyx_L5_argtuple_error;\n    } else {\n      values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n      values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n    }\n    __pyx_v_lhs = ((struct __pyx_obj_9pywrapfst__SymbolTable *)values[0]);\n    __pyx_v_rhs = ((struct __pyx_obj_9pywrapfst__SymbolTable *)values[1]);\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"merge_symbol_table\", 1, 2, 2, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 1093, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst.merge_symbol_table\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_lhs), __pyx_ptype_9pywrapfst__SymbolTable, 1, \"lhs\", 0))) __PYX_ERR(0, 1093, __pyx_L1_error)\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_rhs), __pyx_ptype_9pywrapfst__SymbolTable, 1, \"rhs\", 0))) __PYX_ERR(0, 1093, __pyx_L1_error)\n  __pyx_r = __pyx_pf_9pywrapfst_10merge_symbol_table(__pyx_self, __pyx_v_lhs, __pyx_v_rhs);\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_10merge_symbol_table(CYTHON_UNUSED PyObject *__pyx_self, struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_lhs, struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_rhs) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"merge_symbol_table\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst_merge_symbol_table(__pyx_v_lhs, __pyx_v_rhs, 0)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1093, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.merge_symbol_table\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1132\n *   \"\"\"\n * \n *   def __repr__(self):             # <<<<<<<<<<<<<<\n *     return \"<SymbolTableIterator at 0x{:x}>\".format(id(self))\n * \n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_19SymbolTableIterator_1__repr__(PyObject *__pyx_v_self); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_19SymbolTableIterator_1__repr__(PyObject *__pyx_v_self) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__repr__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_19SymbolTableIterator___repr__(((struct __pyx_obj_9pywrapfst_SymbolTableIterator *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_19SymbolTableIterator___repr__(struct __pyx_obj_9pywrapfst_SymbolTableIterator *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  __Pyx_RefNannySetupContext(\"__repr__\", 0);\n\n  /* \"pywrapfst.pyx\":1133\n * \n *   def __repr__(self):\n *     return \"<SymbolTableIterator at 0x{:x}>\".format(id(self))             # <<<<<<<<<<<<<<\n * \n *   def __init__(self, _SymbolTable syms):\n */\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_2 = __Pyx_PyObject_GetAttrStr(__pyx_kp_s_SymbolTableIterator_at_0x_x, __pyx_n_s_format); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1133, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  __pyx_t_3 = PyTuple_New(1); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 1133, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_3);\n  __Pyx_INCREF(((PyObject *)__pyx_v_self));\n  __Pyx_GIVEREF(((PyObject *)__pyx_v_self));\n  PyTuple_SET_ITEM(__pyx_t_3, 0, ((PyObject *)__pyx_v_self));\n  __pyx_t_4 = __Pyx_PyObject_Call(__pyx_builtin_id, __pyx_t_3, NULL); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 1133, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_4);\n  __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n  __pyx_t_3 = NULL;\n  if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_2))) {\n    __pyx_t_3 = PyMethod_GET_SELF(__pyx_t_2);\n    if (likely(__pyx_t_3)) {\n      PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_2);\n      __Pyx_INCREF(__pyx_t_3);\n      __Pyx_INCREF(function);\n      __Pyx_DECREF_SET(__pyx_t_2, function);\n    }\n  }\n  if (!__pyx_t_3) {\n    __pyx_t_1 = __Pyx_PyObject_CallOneArg(__pyx_t_2, __pyx_t_4); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1133, __pyx_L1_error)\n    __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n    __Pyx_GOTREF(__pyx_t_1);\n  } else {\n    #if CYTHON_FAST_PYCALL\n    if (PyFunction_Check(__pyx_t_2)) {\n      PyObject *__pyx_temp[2] = {__pyx_t_3, __pyx_t_4};\n      __pyx_t_1 = __Pyx_PyFunction_FastCall(__pyx_t_2, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1133, __pyx_L1_error)\n      __Pyx_XDECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __Pyx_GOTREF(__pyx_t_1);\n      __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n    } else\n    #endif\n    #if CYTHON_FAST_PYCCALL\n    if (__Pyx_PyFastCFunction_Check(__pyx_t_2)) {\n      PyObject *__pyx_temp[2] = {__pyx_t_3, __pyx_t_4};\n      __pyx_t_1 = __Pyx_PyCFunction_FastCall(__pyx_t_2, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1133, __pyx_L1_error)\n      __Pyx_XDECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __Pyx_GOTREF(__pyx_t_1);\n      __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n    } else\n    #endif\n    {\n      __pyx_t_5 = PyTuple_New(1+1); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 1133, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_5);\n      __Pyx_GIVEREF(__pyx_t_3); PyTuple_SET_ITEM(__pyx_t_5, 0, __pyx_t_3); __pyx_t_3 = NULL;\n      __Pyx_GIVEREF(__pyx_t_4);\n      PyTuple_SET_ITEM(__pyx_t_5, 0+1, __pyx_t_4);\n      __pyx_t_4 = 0;\n      __pyx_t_1 = __Pyx_PyObject_Call(__pyx_t_2, __pyx_t_5, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1133, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_1);\n      __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n    }\n  }\n  __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":1132\n *   \"\"\"\n * \n *   def __repr__(self):             # <<<<<<<<<<<<<<\n *     return \"<SymbolTableIterator at 0x{:x}>\".format(id(self))\n * \n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_AddTraceback(\"pywrapfst.SymbolTableIterator.__repr__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1135\n *     return \"<SymbolTableIterator at 0x{:x}>\".format(id(self))\n * \n *   def __init__(self, _SymbolTable syms):             # <<<<<<<<<<<<<<\n *     self._siter.reset(new fst.SymbolTableIterator(deref(syms._table)))\n * \n */\n\n/* Python wrapper */\nstatic int __pyx_pw_9pywrapfst_19SymbolTableIterator_3__init__(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic int __pyx_pw_9pywrapfst_19SymbolTableIterator_3__init__(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_syms = 0;\n  int __pyx_r;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__init__ (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_syms,0};\n    PyObject* values[1] = {0};\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (likely((values[0] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_syms)) != 0)) kw_args--;\n        else goto __pyx_L5_argtuple_error;\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"__init__\") < 0)) __PYX_ERR(0, 1135, __pyx_L3_error)\n      }\n    } else if (PyTuple_GET_SIZE(__pyx_args) != 1) {\n      goto __pyx_L5_argtuple_error;\n    } else {\n      values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n    }\n    __pyx_v_syms = ((struct __pyx_obj_9pywrapfst__SymbolTable *)values[0]);\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"__init__\", 1, 1, 1, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 1135, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst.SymbolTableIterator.__init__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return -1;\n  __pyx_L4_argument_unpacking_done:;\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_syms), __pyx_ptype_9pywrapfst__SymbolTable, 1, \"syms\", 0))) __PYX_ERR(0, 1135, __pyx_L1_error)\n  __pyx_r = __pyx_pf_9pywrapfst_19SymbolTableIterator_2__init__(((struct __pyx_obj_9pywrapfst_SymbolTableIterator *)__pyx_v_self), __pyx_v_syms);\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __pyx_r = -1;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic int __pyx_pf_9pywrapfst_19SymbolTableIterator_2__init__(struct __pyx_obj_9pywrapfst_SymbolTableIterator *__pyx_v_self, struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_syms) {\n  int __pyx_r;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__init__\", 0);\n\n  /* \"pywrapfst.pyx\":1136\n * \n *   def __init__(self, _SymbolTable syms):\n *     self._siter.reset(new fst.SymbolTableIterator(deref(syms._table)))             # <<<<<<<<<<<<<<\n * \n *   # This just registers this class as a possible iterator.\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_siter\");\n    __PYX_ERR(0, 1136, __pyx_L1_error)\n  }\n  if (unlikely(((PyObject *)__pyx_v_syms) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_table\");\n    __PYX_ERR(0, 1136, __pyx_L1_error)\n  }\n  __pyx_v_self->_siter.reset(new fst::SymbolTableIterator((*__pyx_v_syms->_table)));\n\n  /* \"pywrapfst.pyx\":1135\n *     return \"<SymbolTableIterator at 0x{:x}>\".format(id(self))\n * \n *   def __init__(self, _SymbolTable syms):             # <<<<<<<<<<<<<<\n *     self._siter.reset(new fst.SymbolTableIterator(deref(syms._table)))\n * \n */\n\n  /* function exit code */\n  __pyx_r = 0;\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"pywrapfst.SymbolTableIterator.__init__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = -1;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1139\n * \n *   # This just registers this class as a possible iterator.\n *   def __iter__(self):             # <<<<<<<<<<<<<<\n *     return self\n * \n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_19SymbolTableIterator_5__iter__(PyObject *__pyx_v_self); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_19SymbolTableIterator_5__iter__(PyObject *__pyx_v_self) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__iter__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_19SymbolTableIterator_4__iter__(((struct __pyx_obj_9pywrapfst_SymbolTableIterator *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_19SymbolTableIterator_4__iter__(struct __pyx_obj_9pywrapfst_SymbolTableIterator *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__iter__\", 0);\n\n  /* \"pywrapfst.pyx\":1140\n *   # This just registers this class as a possible iterator.\n *   def __iter__(self):\n *     return self             # <<<<<<<<<<<<<<\n * \n *   # Magic method used to get a Pythonic API out of the C++ API.\n */\n  __Pyx_XDECREF(__pyx_r);\n  __Pyx_INCREF(((PyObject *)__pyx_v_self));\n  __pyx_r = ((PyObject *)__pyx_v_self);\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":1139\n * \n *   # This just registers this class as a possible iterator.\n *   def __iter__(self):             # <<<<<<<<<<<<<<\n *     return self\n * \n */\n\n  /* function exit code */\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1143\n * \n *   # Magic method used to get a Pythonic API out of the C++ API.\n *   def __next__(self):             # <<<<<<<<<<<<<<\n *     if self.done():\n *       raise StopIteration\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_19SymbolTableIterator_7__next__(PyObject *__pyx_v_self); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_19SymbolTableIterator_7__next__(PyObject *__pyx_v_self) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__next__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_19SymbolTableIterator_6__next__(((struct __pyx_obj_9pywrapfst_SymbolTableIterator *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_19SymbolTableIterator_6__next__(struct __pyx_obj_9pywrapfst_SymbolTableIterator *__pyx_v_self) {\n  __pyx_t_10basictypes_int64 __pyx_v_value;\n  std::string __pyx_v_symbol;\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  int __pyx_t_1;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  __Pyx_RefNannySetupContext(\"__next__\", 0);\n\n  /* \"pywrapfst.pyx\":1144\n *   # Magic method used to get a Pythonic API out of the C++ API.\n *   def __next__(self):\n *     if self.done():             # <<<<<<<<<<<<<<\n *       raise StopIteration\n *     cdef int64 value = self.value()\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"done\");\n    __PYX_ERR(0, 1144, __pyx_L1_error)\n  }\n  __pyx_t_1 = (((struct __pyx_vtabstruct_9pywrapfst_SymbolTableIterator *)__pyx_v_self->__pyx_vtab)->done(__pyx_v_self, 0) != 0);\n  if (__pyx_t_1) {\n\n    /* \"pywrapfst.pyx\":1145\n *   def __next__(self):\n *     if self.done():\n *       raise StopIteration             # <<<<<<<<<<<<<<\n *     cdef int64 value = self.value()\n *     cdef string symbol = self.symbol()\n */\n    __Pyx_Raise(__pyx_builtin_StopIteration, 0, 0, 0);\n    __PYX_ERR(0, 1145, __pyx_L1_error)\n\n    /* \"pywrapfst.pyx\":1144\n *   # Magic method used to get a Pythonic API out of the C++ API.\n *   def __next__(self):\n *     if self.done():             # <<<<<<<<<<<<<<\n *       raise StopIteration\n *     cdef int64 value = self.value()\n */\n  }\n\n  /* \"pywrapfst.pyx\":1146\n *     if self.done():\n *       raise StopIteration\n *     cdef int64 value = self.value()             # <<<<<<<<<<<<<<\n *     cdef string symbol = self.symbol()\n *     self.next()\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"value\");\n    __PYX_ERR(0, 1146, __pyx_L1_error)\n  }\n  __pyx_v_value = ((struct __pyx_vtabstruct_9pywrapfst_SymbolTableIterator *)__pyx_v_self->__pyx_vtab)->value(__pyx_v_self, 0);\n\n  /* \"pywrapfst.pyx\":1147\n *       raise StopIteration\n *     cdef int64 value = self.value()\n *     cdef string symbol = self.symbol()             # <<<<<<<<<<<<<<\n *     self.next()\n *     return (value, symbol)\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"symbol\");\n    __PYX_ERR(0, 1147, __pyx_L1_error)\n  }\n  __pyx_v_symbol = ((struct __pyx_vtabstruct_9pywrapfst_SymbolTableIterator *)__pyx_v_self->__pyx_vtab)->symbol(__pyx_v_self, 0);\n\n  /* \"pywrapfst.pyx\":1148\n *     cdef int64 value = self.value()\n *     cdef string symbol = self.symbol()\n *     self.next()             # <<<<<<<<<<<<<<\n *     return (value, symbol)\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"next\");\n    __PYX_ERR(0, 1148, __pyx_L1_error)\n  }\n  ((struct __pyx_vtabstruct_9pywrapfst_SymbolTableIterator *)__pyx_v_self->__pyx_vtab)->next(__pyx_v_self, 0);\n\n  /* \"pywrapfst.pyx\":1149\n *     cdef string symbol = self.symbol()\n *     self.next()\n *     return (value, symbol)             # <<<<<<<<<<<<<<\n * \n *   cpdef bool done(self):\n */\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_2 = __Pyx_PyInt_From_int64_t(__pyx_v_value); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1149, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  __pyx_t_3 = __pyx_convert_PyBytes_string_to_py_std__in_string(__pyx_v_symbol); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 1149, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_3);\n  __pyx_t_4 = PyTuple_New(2); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 1149, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_4);\n  __Pyx_GIVEREF(__pyx_t_2);\n  PyTuple_SET_ITEM(__pyx_t_4, 0, __pyx_t_2);\n  __Pyx_GIVEREF(__pyx_t_3);\n  PyTuple_SET_ITEM(__pyx_t_4, 1, __pyx_t_3);\n  __pyx_t_2 = 0;\n  __pyx_t_3 = 0;\n  __pyx_r = __pyx_t_4;\n  __pyx_t_4 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":1143\n * \n *   # Magic method used to get a Pythonic API out of the C++ API.\n *   def __next__(self):             # <<<<<<<<<<<<<<\n *     if self.done():\n *       raise StopIteration\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_AddTraceback(\"pywrapfst.SymbolTableIterator.__next__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1151\n *     return (value, symbol)\n * \n *   cpdef bool done(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     done(self)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_19SymbolTableIterator_9done(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic bool __pyx_f_9pywrapfst_19SymbolTableIterator_done(struct __pyx_obj_9pywrapfst_SymbolTableIterator *__pyx_v_self, int __pyx_skip_dispatch) {\n  bool __pyx_r;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  bool __pyx_t_5;\n  __Pyx_RefNannySetupContext(\"done\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_done); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1151, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_19SymbolTableIterator_9done)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1151, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1151, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __pyx_t_5 = __Pyx_PyObject_IsTrue(__pyx_t_2); if (unlikely((__pyx_t_5 == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 1151, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __pyx_r = __pyx_t_5;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":1160\n *       True if the iterator is exhausted, False otherwise.\n *     \"\"\"\n *     return self._siter.get().Done()             # <<<<<<<<<<<<<<\n * \n *   cpdef void next(self):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_siter\");\n    __PYX_ERR(0, 1160, __pyx_L1_error)\n  }\n  __pyx_r = __pyx_v_self->_siter.get()->Done();\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":1151\n *     return (value, symbol)\n * \n *   cpdef bool done(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     done(self)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_WriteUnraisable(\"pywrapfst.SymbolTableIterator.done\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_19SymbolTableIterator_9done(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_19SymbolTableIterator_8done[] = \"\\n    done(self)\\n\\n    Indicates whether the iterator is exhausted or not.\\n\\n    Returns:\\n      True if the iterator is exhausted, False otherwise.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_19SymbolTableIterator_9done(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"done (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_19SymbolTableIterator_8done(((struct __pyx_obj_9pywrapfst_SymbolTableIterator *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_19SymbolTableIterator_8done(struct __pyx_obj_9pywrapfst_SymbolTableIterator *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"done\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __Pyx_PyBool_FromLong(__pyx_f_9pywrapfst_19SymbolTableIterator_done(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1151, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.SymbolTableIterator.done\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1162\n *     return self._siter.get().Done()\n * \n *   cpdef void next(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     next(self)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_19SymbolTableIterator_11next(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic void __pyx_f_9pywrapfst_19SymbolTableIterator_next(struct __pyx_obj_9pywrapfst_SymbolTableIterator *__pyx_v_self, int __pyx_skip_dispatch) {\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  __Pyx_RefNannySetupContext(\"next\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_next); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1162, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_19SymbolTableIterator_11next)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1162, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1162, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":1168\n *     Advances the iterator.\n *     \"\"\"\n *     self._siter.get().Next()             # <<<<<<<<<<<<<<\n * \n *   cpdef void reset(self):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_siter\");\n    __PYX_ERR(0, 1168, __pyx_L1_error)\n  }\n  __pyx_v_self->_siter.get()->Next();\n\n  /* \"pywrapfst.pyx\":1162\n *     return self._siter.get().Done()\n * \n *   cpdef void next(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     next(self)\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_WriteUnraisable(\"pywrapfst.SymbolTableIterator.next\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_19SymbolTableIterator_11next(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_19SymbolTableIterator_10next[] = \"\\n    next(self)\\n\\n    Advances the iterator.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_19SymbolTableIterator_11next(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"next (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_19SymbolTableIterator_10next(((struct __pyx_obj_9pywrapfst_SymbolTableIterator *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_19SymbolTableIterator_10next(struct __pyx_obj_9pywrapfst_SymbolTableIterator *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"next\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __Pyx_void_to_None(__pyx_f_9pywrapfst_19SymbolTableIterator_next(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1162, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.SymbolTableIterator.next\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1170\n *     self._siter.get().Next()\n * \n *   cpdef void reset(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     reset(self)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_19SymbolTableIterator_13reset(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic void __pyx_f_9pywrapfst_19SymbolTableIterator_reset(struct __pyx_obj_9pywrapfst_SymbolTableIterator *__pyx_v_self, int __pyx_skip_dispatch) {\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  __Pyx_RefNannySetupContext(\"reset\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_reset); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1170, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_19SymbolTableIterator_13reset)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1170, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1170, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":1176\n *     Resets the iterator to the initial position.\n *     \"\"\"\n *     self._siter.get().Reset()             # <<<<<<<<<<<<<<\n * \n *   cpdef string symbol(self):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_siter\");\n    __PYX_ERR(0, 1176, __pyx_L1_error)\n  }\n  __pyx_v_self->_siter.get()->Reset();\n\n  /* \"pywrapfst.pyx\":1170\n *     self._siter.get().Next()\n * \n *   cpdef void reset(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     reset(self)\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_WriteUnraisable(\"pywrapfst.SymbolTableIterator.reset\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_19SymbolTableIterator_13reset(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_19SymbolTableIterator_12reset[] = \"\\n    reset(self)\\n\\n    Resets the iterator to the initial position.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_19SymbolTableIterator_13reset(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"reset (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_19SymbolTableIterator_12reset(((struct __pyx_obj_9pywrapfst_SymbolTableIterator *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_19SymbolTableIterator_12reset(struct __pyx_obj_9pywrapfst_SymbolTableIterator *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"reset\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __Pyx_void_to_None(__pyx_f_9pywrapfst_19SymbolTableIterator_reset(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1170, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.SymbolTableIterator.reset\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1178\n *     self._siter.get().Reset()\n * \n *   cpdef string symbol(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     symbol(self)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_19SymbolTableIterator_15symbol(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic std::string __pyx_f_9pywrapfst_19SymbolTableIterator_symbol(struct __pyx_obj_9pywrapfst_SymbolTableIterator *__pyx_v_self, int __pyx_skip_dispatch) {\n  std::string __pyx_r;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  std::string __pyx_t_5;\n  __Pyx_RefNannySetupContext(\"symbol\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_symbol); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1178, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_19SymbolTableIterator_15symbol)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1178, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1178, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __pyx_t_5 = __pyx_convert_string_from_py_std__in_string(__pyx_t_2); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 1178, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __pyx_r = __pyx_t_5;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":1189\n *       A symbol string.\n *     \"\"\"\n *     return self._siter.get().Symbol()             # <<<<<<<<<<<<<<\n * \n *   cpdef int64 value(self):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_siter\");\n    __PYX_ERR(0, 1189, __pyx_L1_error)\n  }\n  __pyx_r = __pyx_v_self->_siter.get()->Symbol();\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":1178\n *     self._siter.get().Reset()\n * \n *   cpdef string symbol(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     symbol(self)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_WriteUnraisable(\"pywrapfst.SymbolTableIterator.symbol\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __Pyx_pretend_to_initialize(&__pyx_r);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_19SymbolTableIterator_15symbol(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_19SymbolTableIterator_14symbol[] = \"\\n    symbol(self)\\n\\n    Returns the current symbol string.\\n\\n    This method returns the current symbol string at this point in the table.\\n\\n    Returns:\\n      A symbol string.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_19SymbolTableIterator_15symbol(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"symbol (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_19SymbolTableIterator_14symbol(((struct __pyx_obj_9pywrapfst_SymbolTableIterator *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_19SymbolTableIterator_14symbol(struct __pyx_obj_9pywrapfst_SymbolTableIterator *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"symbol\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __pyx_convert_PyBytes_string_to_py_std__in_string(__pyx_f_9pywrapfst_19SymbolTableIterator_symbol(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1178, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.SymbolTableIterator.symbol\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1191\n *     return self._siter.get().Symbol()\n * \n *   cpdef int64 value(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     value(self)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_19SymbolTableIterator_17value(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic __pyx_t_10basictypes_int64 __pyx_f_9pywrapfst_19SymbolTableIterator_value(struct __pyx_obj_9pywrapfst_SymbolTableIterator *__pyx_v_self, int __pyx_skip_dispatch) {\n  __pyx_t_10basictypes_int64 __pyx_r;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  __pyx_t_10basictypes_int64 __pyx_t_5;\n  __Pyx_RefNannySetupContext(\"value\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_value); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1191, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_19SymbolTableIterator_17value)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1191, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1191, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __pyx_t_5 = __Pyx_PyInt_As_int64_t(__pyx_t_2); if (unlikely((__pyx_t_5 == ((int64_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 1191, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __pyx_r = __pyx_t_5;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":1200\n *       An integer index.\n *     \"\"\"\n *     return self._siter.get().Value()             # <<<<<<<<<<<<<<\n * \n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_siter\");\n    __PYX_ERR(0, 1200, __pyx_L1_error)\n  }\n  __pyx_r = __pyx_v_self->_siter.get()->Value();\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":1191\n *     return self._siter.get().Symbol()\n * \n *   cpdef int64 value(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     value(self)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_WriteUnraisable(\"pywrapfst.SymbolTableIterator.value\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_19SymbolTableIterator_17value(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_19SymbolTableIterator_16value[] = \"\\n    value(self)\\n\\n    Returns the current integer index of the symbol.\\n\\n    Returns:\\n      An integer index.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_19SymbolTableIterator_17value(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"value (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_19SymbolTableIterator_16value(((struct __pyx_obj_9pywrapfst_SymbolTableIterator *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_19SymbolTableIterator_16value(struct __pyx_obj_9pywrapfst_SymbolTableIterator *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"value\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __Pyx_PyInt_From_int64_t(__pyx_f_9pywrapfst_19SymbolTableIterator_value(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1191, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.SymbolTableIterator.value\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"(tree fragment)\":1\n * def __reduce_cython__(self):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._siter,self._table cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_19SymbolTableIterator_19__reduce_cython__(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_19SymbolTableIterator_19__reduce_cython__(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__reduce_cython__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_19SymbolTableIterator_18__reduce_cython__(((struct __pyx_obj_9pywrapfst_SymbolTableIterator *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_19SymbolTableIterator_18__reduce_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst_SymbolTableIterator *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"__reduce_cython__\", 0);\n\n  /* \"(tree fragment)\":2\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._siter,self._table cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._siter,self._table cannot be converted to a Python object for pickling\")\n */\n  __pyx_t_1 = __Pyx_PyObject_Call(__pyx_builtin_TypeError, __pyx_tuple__20, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(1, 2, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __Pyx_Raise(__pyx_t_1, 0, 0, 0);\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  __PYX_ERR(1, 2, __pyx_L1_error)\n\n  /* \"(tree fragment)\":1\n * def __reduce_cython__(self):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._siter,self._table cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.SymbolTableIterator.__reduce_cython__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"(tree fragment)\":3\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._siter,self._table cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._siter,self._table cannot be converted to a Python object for pickling\")\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_19SymbolTableIterator_21__setstate_cython__(PyObject *__pyx_v_self, PyObject *__pyx_v___pyx_state); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_19SymbolTableIterator_21__setstate_cython__(PyObject *__pyx_v_self, PyObject *__pyx_v___pyx_state) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__setstate_cython__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_19SymbolTableIterator_20__setstate_cython__(((struct __pyx_obj_9pywrapfst_SymbolTableIterator *)__pyx_v_self), ((PyObject *)__pyx_v___pyx_state));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_19SymbolTableIterator_20__setstate_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst_SymbolTableIterator *__pyx_v_self, CYTHON_UNUSED PyObject *__pyx_v___pyx_state) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"__setstate_cython__\", 0);\n\n  /* \"(tree fragment)\":4\n *     raise TypeError(\"self._siter,self._table cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._siter,self._table cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n */\n  __pyx_t_1 = __Pyx_PyObject_Call(__pyx_builtin_TypeError, __pyx_tuple__21, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(1, 4, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __Pyx_Raise(__pyx_t_1, 0, 0, 0);\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  __PYX_ERR(1, 4, __pyx_L1_error)\n\n  /* \"(tree fragment)\":3\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._siter,self._table cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._siter,self._table cannot be converted to a Python object for pickling\")\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.SymbolTableIterator.__setstate_cython__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1229\n *   \"\"\"\n * \n *   def __repr__(self):             # <<<<<<<<<<<<<<\n *     return \"<EncodeMapper at 0x{:x}>\".format(id(self))\n * \n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_12EncodeMapper_1__repr__(PyObject *__pyx_v_self); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_12EncodeMapper_1__repr__(PyObject *__pyx_v_self) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__repr__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_12EncodeMapper___repr__(((struct __pyx_obj_9pywrapfst_EncodeMapper *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_12EncodeMapper___repr__(struct __pyx_obj_9pywrapfst_EncodeMapper *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  __Pyx_RefNannySetupContext(\"__repr__\", 0);\n\n  /* \"pywrapfst.pyx\":1230\n * \n *   def __repr__(self):\n *     return \"<EncodeMapper at 0x{:x}>\".format(id(self))             # <<<<<<<<<<<<<<\n * \n *   def __init__(self,\n */\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_2 = __Pyx_PyObject_GetAttrStr(__pyx_kp_s_EncodeMapper_at_0x_x, __pyx_n_s_format); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1230, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  __pyx_t_3 = PyTuple_New(1); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 1230, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_3);\n  __Pyx_INCREF(((PyObject *)__pyx_v_self));\n  __Pyx_GIVEREF(((PyObject *)__pyx_v_self));\n  PyTuple_SET_ITEM(__pyx_t_3, 0, ((PyObject *)__pyx_v_self));\n  __pyx_t_4 = __Pyx_PyObject_Call(__pyx_builtin_id, __pyx_t_3, NULL); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 1230, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_4);\n  __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n  __pyx_t_3 = NULL;\n  if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_2))) {\n    __pyx_t_3 = PyMethod_GET_SELF(__pyx_t_2);\n    if (likely(__pyx_t_3)) {\n      PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_2);\n      __Pyx_INCREF(__pyx_t_3);\n      __Pyx_INCREF(function);\n      __Pyx_DECREF_SET(__pyx_t_2, function);\n    }\n  }\n  if (!__pyx_t_3) {\n    __pyx_t_1 = __Pyx_PyObject_CallOneArg(__pyx_t_2, __pyx_t_4); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1230, __pyx_L1_error)\n    __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n    __Pyx_GOTREF(__pyx_t_1);\n  } else {\n    #if CYTHON_FAST_PYCALL\n    if (PyFunction_Check(__pyx_t_2)) {\n      PyObject *__pyx_temp[2] = {__pyx_t_3, __pyx_t_4};\n      __pyx_t_1 = __Pyx_PyFunction_FastCall(__pyx_t_2, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1230, __pyx_L1_error)\n      __Pyx_XDECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __Pyx_GOTREF(__pyx_t_1);\n      __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n    } else\n    #endif\n    #if CYTHON_FAST_PYCCALL\n    if (__Pyx_PyFastCFunction_Check(__pyx_t_2)) {\n      PyObject *__pyx_temp[2] = {__pyx_t_3, __pyx_t_4};\n      __pyx_t_1 = __Pyx_PyCFunction_FastCall(__pyx_t_2, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1230, __pyx_L1_error)\n      __Pyx_XDECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __Pyx_GOTREF(__pyx_t_1);\n      __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n    } else\n    #endif\n    {\n      __pyx_t_5 = PyTuple_New(1+1); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 1230, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_5);\n      __Pyx_GIVEREF(__pyx_t_3); PyTuple_SET_ITEM(__pyx_t_5, 0, __pyx_t_3); __pyx_t_3 = NULL;\n      __Pyx_GIVEREF(__pyx_t_4);\n      PyTuple_SET_ITEM(__pyx_t_5, 0+1, __pyx_t_4);\n      __pyx_t_4 = 0;\n      __pyx_t_1 = __Pyx_PyObject_Call(__pyx_t_2, __pyx_t_5, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1230, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_1);\n      __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n    }\n  }\n  __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":1229\n *   \"\"\"\n * \n *   def __repr__(self):             # <<<<<<<<<<<<<<\n *     return \"<EncodeMapper at 0x{:x}>\".format(id(self))\n * \n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_AddTraceback(\"pywrapfst.EncodeMapper.__repr__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1232\n *     return \"<EncodeMapper at 0x{:x}>\".format(id(self))\n * \n *   def __init__(self,             # <<<<<<<<<<<<<<\n *                arc_type=b\"standard\",\n *                bool encode_labels=False,\n */\n\n/* Python wrapper */\nstatic int __pyx_pw_9pywrapfst_12EncodeMapper_3__init__(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic int __pyx_pw_9pywrapfst_12EncodeMapper_3__init__(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  PyObject *__pyx_v_arc_type = 0;\n  bool __pyx_v_encode_labels;\n  bool __pyx_v_encode_weights;\n  int __pyx_r;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__init__ (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_arc_type,&__pyx_n_s_encode_labels,&__pyx_n_s_encode_weights,0};\n    PyObject* values[3] = {0,0,0};\n    values[0] = ((PyObject *)__pyx_n_b_standard);\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);\n        CYTHON_FALLTHROUGH;\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_arc_type);\n          if (value) { values[0] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  1:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_encode_labels);\n          if (value) { values[1] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  2:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_encode_weights);\n          if (value) { values[2] = value; kw_args--; }\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"__init__\") < 0)) __PYX_ERR(0, 1232, __pyx_L3_error)\n      }\n    } else {\n      switch (PyTuple_GET_SIZE(__pyx_args)) {\n        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);\n        CYTHON_FALLTHROUGH;\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n    }\n    __pyx_v_arc_type = values[0];\n    if (values[1]) {\n      __pyx_v_encode_labels = __Pyx_PyObject_IsTrue(values[1]); if (unlikely((__pyx_v_encode_labels == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 1234, __pyx_L3_error)\n    } else {\n\n      /* \"pywrapfst.pyx\":1234\n *   def __init__(self,\n *                arc_type=b\"standard\",\n *                bool encode_labels=False,             # <<<<<<<<<<<<<<\n *                bool encode_weights=False):\n *     cdef uint32 flags = fst.GetEncodeFlags(encode_labels, encode_weights)\n */\n      __pyx_v_encode_labels = ((bool)0);\n    }\n    if (values[2]) {\n      __pyx_v_encode_weights = __Pyx_PyObject_IsTrue(values[2]); if (unlikely((__pyx_v_encode_weights == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 1235, __pyx_L3_error)\n    } else {\n\n      /* \"pywrapfst.pyx\":1235\n *                arc_type=b\"standard\",\n *                bool encode_labels=False,\n *                bool encode_weights=False):             # <<<<<<<<<<<<<<\n *     cdef uint32 flags = fst.GetEncodeFlags(encode_labels, encode_weights)\n *     self._encoder.reset(new fst.EncodeMapperClass(tostring(arc_type), flags,\n */\n      __pyx_v_encode_weights = ((bool)0);\n    }\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"__init__\", 0, 0, 3, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 1232, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst.EncodeMapper.__init__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return -1;\n  __pyx_L4_argument_unpacking_done:;\n  __pyx_r = __pyx_pf_9pywrapfst_12EncodeMapper_2__init__(((struct __pyx_obj_9pywrapfst_EncodeMapper *)__pyx_v_self), __pyx_v_arc_type, __pyx_v_encode_labels, __pyx_v_encode_weights);\n\n  /* \"pywrapfst.pyx\":1232\n *     return \"<EncodeMapper at 0x{:x}>\".format(id(self))\n * \n *   def __init__(self,             # <<<<<<<<<<<<<<\n *                arc_type=b\"standard\",\n *                bool encode_labels=False,\n */\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic int __pyx_pf_9pywrapfst_12EncodeMapper_2__init__(struct __pyx_obj_9pywrapfst_EncodeMapper *__pyx_v_self, PyObject *__pyx_v_arc_type, bool __pyx_v_encode_labels, bool __pyx_v_encode_weights) {\n  __pyx_t_10basictypes_uint32 __pyx_v_flags;\n  int __pyx_r;\n  __Pyx_RefNannyDeclarations\n  std::string __pyx_t_1;\n  int __pyx_t_2;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  PyObject *__pyx_t_6 = NULL;\n  PyObject *__pyx_t_7 = NULL;\n  PyObject *__pyx_t_8 = NULL;\n  __Pyx_RefNannySetupContext(\"__init__\", 0);\n\n  /* \"pywrapfst.pyx\":1236\n *                bool encode_labels=False,\n *                bool encode_weights=False):\n *     cdef uint32 flags = fst.GetEncodeFlags(encode_labels, encode_weights)             # <<<<<<<<<<<<<<\n *     self._encoder.reset(new fst.EncodeMapperClass(tostring(arc_type), flags,\n *                                                   fst.ENCODE))\n */\n  __pyx_v_flags = fst::script::GetEncodeFlags(__pyx_v_encode_labels, __pyx_v_encode_weights);\n\n  /* \"pywrapfst.pyx\":1237\n *                bool encode_weights=False):\n *     cdef uint32 flags = fst.GetEncodeFlags(encode_labels, encode_weights)\n *     self._encoder.reset(new fst.EncodeMapperClass(tostring(arc_type), flags,             # <<<<<<<<<<<<<<\n *                                                   fst.ENCODE))\n *     if not self._encoder:\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_encoder\");\n    __PYX_ERR(0, 1237, __pyx_L1_error)\n  }\n  __pyx_t_1 = __pyx_f_9pywrapfst_tostring(__pyx_v_arc_type, NULL); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 1237, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":1238\n *     cdef uint32 flags = fst.GetEncodeFlags(encode_labels, encode_weights)\n *     self._encoder.reset(new fst.EncodeMapperClass(tostring(arc_type), flags,\n *                                                   fst.ENCODE))             # <<<<<<<<<<<<<<\n *     if not self._encoder:\n *       raise FstOpError(\"Unknown arc type: {!r}\".format(arc_type))\n */\n  __pyx_v_self->_encoder.reset(new fst::script::EncodeMapperClass(__pyx_t_1, __pyx_v_flags, fst::ENCODE));\n\n  /* \"pywrapfst.pyx\":1239\n *     self._encoder.reset(new fst.EncodeMapperClass(tostring(arc_type), flags,\n *                                                   fst.ENCODE))\n *     if not self._encoder:             # <<<<<<<<<<<<<<\n *       raise FstOpError(\"Unknown arc type: {!r}\".format(arc_type))\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_encoder\");\n    __PYX_ERR(0, 1239, __pyx_L1_error)\n  }\n  __pyx_t_2 = ((!__pyx_v_self->_encoder) != 0);\n  if (__pyx_t_2) {\n\n    /* \"pywrapfst.pyx\":1240\n *                                                   fst.ENCODE))\n *     if not self._encoder:\n *       raise FstOpError(\"Unknown arc type: {!r}\".format(arc_type))             # <<<<<<<<<<<<<<\n * \n *   cpdef string arc_type(self):\n */\n    __pyx_t_4 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstOpError); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 1240, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_4);\n    __pyx_t_6 = __Pyx_PyObject_GetAttrStr(__pyx_kp_s_Unknown_arc_type_r, __pyx_n_s_format); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 1240, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_6);\n    __pyx_t_7 = NULL;\n    if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_6))) {\n      __pyx_t_7 = PyMethod_GET_SELF(__pyx_t_6);\n      if (likely(__pyx_t_7)) {\n        PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_6);\n        __Pyx_INCREF(__pyx_t_7);\n        __Pyx_INCREF(function);\n        __Pyx_DECREF_SET(__pyx_t_6, function);\n      }\n    }\n    if (!__pyx_t_7) {\n      __pyx_t_5 = __Pyx_PyObject_CallOneArg(__pyx_t_6, __pyx_v_arc_type); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 1240, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_5);\n    } else {\n      #if CYTHON_FAST_PYCALL\n      if (PyFunction_Check(__pyx_t_6)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_7, __pyx_v_arc_type};\n        __pyx_t_5 = __Pyx_PyFunction_FastCall(__pyx_t_6, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 1240, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_7); __pyx_t_7 = 0;\n        __Pyx_GOTREF(__pyx_t_5);\n      } else\n      #endif\n      #if CYTHON_FAST_PYCCALL\n      if (__Pyx_PyFastCFunction_Check(__pyx_t_6)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_7, __pyx_v_arc_type};\n        __pyx_t_5 = __Pyx_PyCFunction_FastCall(__pyx_t_6, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 1240, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_7); __pyx_t_7 = 0;\n        __Pyx_GOTREF(__pyx_t_5);\n      } else\n      #endif\n      {\n        __pyx_t_8 = PyTuple_New(1+1); if (unlikely(!__pyx_t_8)) __PYX_ERR(0, 1240, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_8);\n        __Pyx_GIVEREF(__pyx_t_7); PyTuple_SET_ITEM(__pyx_t_8, 0, __pyx_t_7); __pyx_t_7 = NULL;\n        __Pyx_INCREF(__pyx_v_arc_type);\n        __Pyx_GIVEREF(__pyx_v_arc_type);\n        PyTuple_SET_ITEM(__pyx_t_8, 0+1, __pyx_v_arc_type);\n        __pyx_t_5 = __Pyx_PyObject_Call(__pyx_t_6, __pyx_t_8, NULL); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 1240, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_5);\n        __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0;\n      }\n    }\n    __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n    __pyx_t_6 = NULL;\n    if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_4))) {\n      __pyx_t_6 = PyMethod_GET_SELF(__pyx_t_4);\n      if (likely(__pyx_t_6)) {\n        PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_4);\n        __Pyx_INCREF(__pyx_t_6);\n        __Pyx_INCREF(function);\n        __Pyx_DECREF_SET(__pyx_t_4, function);\n      }\n    }\n    if (!__pyx_t_6) {\n      __pyx_t_3 = __Pyx_PyObject_CallOneArg(__pyx_t_4, __pyx_t_5); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 1240, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n      __Pyx_GOTREF(__pyx_t_3);\n    } else {\n      #if CYTHON_FAST_PYCALL\n      if (PyFunction_Check(__pyx_t_4)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_6, __pyx_t_5};\n        __pyx_t_3 = __Pyx_PyFunction_FastCall(__pyx_t_4, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 1240, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_6); __pyx_t_6 = 0;\n        __Pyx_GOTREF(__pyx_t_3);\n        __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n      } else\n      #endif\n      #if CYTHON_FAST_PYCCALL\n      if (__Pyx_PyFastCFunction_Check(__pyx_t_4)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_6, __pyx_t_5};\n        __pyx_t_3 = __Pyx_PyCFunction_FastCall(__pyx_t_4, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 1240, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_6); __pyx_t_6 = 0;\n        __Pyx_GOTREF(__pyx_t_3);\n        __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n      } else\n      #endif\n      {\n        __pyx_t_8 = PyTuple_New(1+1); if (unlikely(!__pyx_t_8)) __PYX_ERR(0, 1240, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_8);\n        __Pyx_GIVEREF(__pyx_t_6); PyTuple_SET_ITEM(__pyx_t_8, 0, __pyx_t_6); __pyx_t_6 = NULL;\n        __Pyx_GIVEREF(__pyx_t_5);\n        PyTuple_SET_ITEM(__pyx_t_8, 0+1, __pyx_t_5);\n        __pyx_t_5 = 0;\n        __pyx_t_3 = __Pyx_PyObject_Call(__pyx_t_4, __pyx_t_8, NULL); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 1240, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_3);\n        __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0;\n      }\n    }\n    __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n    __Pyx_Raise(__pyx_t_3, 0, 0, 0);\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    __PYX_ERR(0, 1240, __pyx_L1_error)\n\n    /* \"pywrapfst.pyx\":1239\n *     self._encoder.reset(new fst.EncodeMapperClass(tostring(arc_type), flags,\n *                                                   fst.ENCODE))\n *     if not self._encoder:             # <<<<<<<<<<<<<<\n *       raise FstOpError(\"Unknown arc type: {!r}\".format(arc_type))\n * \n */\n  }\n\n  /* \"pywrapfst.pyx\":1232\n *     return \"<EncodeMapper at 0x{:x}>\".format(id(self))\n * \n *   def __init__(self,             # <<<<<<<<<<<<<<\n *                arc_type=b\"standard\",\n *                bool encode_labels=False,\n */\n\n  /* function exit code */\n  __pyx_r = 0;\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_XDECREF(__pyx_t_6);\n  __Pyx_XDECREF(__pyx_t_7);\n  __Pyx_XDECREF(__pyx_t_8);\n  __Pyx_AddTraceback(\"pywrapfst.EncodeMapper.__init__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = -1;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1242\n *       raise FstOpError(\"Unknown arc type: {!r}\".format(arc_type))\n * \n *   cpdef string arc_type(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     arc_type(self)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_12EncodeMapper_5arc_type(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic std::string __pyx_f_9pywrapfst_12EncodeMapper_arc_type(struct __pyx_obj_9pywrapfst_EncodeMapper *__pyx_v_self, int __pyx_skip_dispatch) {\n  std::string __pyx_r;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  std::string __pyx_t_5;\n  __Pyx_RefNannySetupContext(\"arc_type\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_arc_type); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1242, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_12EncodeMapper_5arc_type)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1242, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1242, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __pyx_t_5 = __pyx_convert_string_from_py_std__in_string(__pyx_t_2); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 1242, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __pyx_r = __pyx_t_5;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":1248\n *     Returns a string indicating the arc type.\n *     \"\"\"\n *     return self._encoder.get().ArcType()             # <<<<<<<<<<<<<<\n * \n *   # Python's equivalent to operator().\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_encoder\");\n    __PYX_ERR(0, 1248, __pyx_L1_error)\n  }\n  __pyx_r = __pyx_v_self->_encoder.get()->ArcType();\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":1242\n *       raise FstOpError(\"Unknown arc type: {!r}\".format(arc_type))\n * \n *   cpdef string arc_type(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     arc_type(self)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_WriteUnraisable(\"pywrapfst.EncodeMapper.arc_type\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __Pyx_pretend_to_initialize(&__pyx_r);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_12EncodeMapper_5arc_type(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_12EncodeMapper_4arc_type[] = \"\\n    arc_type(self)\\n\\n    Returns a string indicating the arc type.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_12EncodeMapper_5arc_type(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"arc_type (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_12EncodeMapper_4arc_type(((struct __pyx_obj_9pywrapfst_EncodeMapper *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_12EncodeMapper_4arc_type(struct __pyx_obj_9pywrapfst_EncodeMapper *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"arc_type\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __pyx_convert_PyBytes_string_to_py_std__in_string(__pyx_f_9pywrapfst_12EncodeMapper_arc_type(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1242, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.EncodeMapper.arc_type\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1252\n *   # Python's equivalent to operator().\n * \n *   def __call__(self, Arc arc):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     self(state, ilabel, olabel, weight, nextstate)\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_12EncodeMapper_7__call__(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic char __pyx_doc_9pywrapfst_12EncodeMapper_6__call__[] = \"\\n    self(state, ilabel, olabel, weight, nextstate)\\n\\n    Uses the encoder to encode an arc.\\n\\n    Args:\\n      ilabel: The integer index of the input label.\\n      olabel: The integer index of the output label.\\n      weight: A Weight or weight string indicating the desired final weight; if\\n        null, it is set to semiring One.\\n      nextstate: The integer index of the destination state.\\n\\n    Raises:\\n      FstOpError: Incompatible or invalid weight.\\n    \";\n#if CYTHON_COMPILING_IN_CPYTHON\nstruct wrapperbase __pyx_wrapperbase_9pywrapfst_12EncodeMapper_6__call__;\n#endif\nstatic PyObject *__pyx_pw_9pywrapfst_12EncodeMapper_7__call__(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  struct __pyx_obj_9pywrapfst_Arc *__pyx_v_arc = 0;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__call__ (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_arc,0};\n    PyObject* values[1] = {0};\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (likely((values[0] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_arc)) != 0)) kw_args--;\n        else goto __pyx_L5_argtuple_error;\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"__call__\") < 0)) __PYX_ERR(0, 1252, __pyx_L3_error)\n      }\n    } else if (PyTuple_GET_SIZE(__pyx_args) != 1) {\n      goto __pyx_L5_argtuple_error;\n    } else {\n      values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n    }\n    __pyx_v_arc = ((struct __pyx_obj_9pywrapfst_Arc *)values[0]);\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"__call__\", 1, 1, 1, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 1252, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst.EncodeMapper.__call__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_arc), __pyx_ptype_9pywrapfst_Arc, 1, \"arc\", 0))) __PYX_ERR(0, 1252, __pyx_L1_error)\n  __pyx_r = __pyx_pf_9pywrapfst_12EncodeMapper_6__call__(((struct __pyx_obj_9pywrapfst_EncodeMapper *)__pyx_v_self), __pyx_v_arc);\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_12EncodeMapper_6__call__(struct __pyx_obj_9pywrapfst_EncodeMapper *__pyx_v_self, struct __pyx_obj_9pywrapfst_Arc *__pyx_v_arc) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"__call__\", 0);\n\n  /* \"pywrapfst.pyx\":1268\n *       FstOpError: Incompatible or invalid weight.\n *     \"\"\"\n *     return _init_Arc(self._encoder.get().__call__(deref(arc._arc)))             # <<<<<<<<<<<<<<\n * \n *   cpdef uint32 flags(self):\n */\n  __Pyx_XDECREF(__pyx_r);\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_encoder\");\n    __PYX_ERR(0, 1268, __pyx_L1_error)\n  }\n  if (unlikely(((PyObject *)__pyx_v_arc) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_arc\");\n    __PYX_ERR(0, 1268, __pyx_L1_error)\n  }\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst__init_Arc(__pyx_v_self->_encoder.get()->operator()((*__pyx_v_arc->_arc)))); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1268, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":1252\n *   # Python's equivalent to operator().\n * \n *   def __call__(self, Arc arc):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     self(state, ilabel, olabel, weight, nextstate)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.EncodeMapper.__call__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1270\n *     return _init_Arc(self._encoder.get().__call__(deref(arc._arc)))\n * \n *   cpdef uint32 flags(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     flags(self)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_12EncodeMapper_9flags(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic __pyx_t_10basictypes_uint32 __pyx_f_9pywrapfst_12EncodeMapper_flags(struct __pyx_obj_9pywrapfst_EncodeMapper *__pyx_v_self, int __pyx_skip_dispatch) {\n  __pyx_t_10basictypes_uint32 __pyx_r;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  __pyx_t_10basictypes_uint32 __pyx_t_5;\n  __Pyx_RefNannySetupContext(\"flags\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_flags); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1270, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_12EncodeMapper_9flags)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1270, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1270, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __pyx_t_5 = __Pyx_PyInt_As_uint32_t(__pyx_t_2); if (unlikely((__pyx_t_5 == ((uint32_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 1270, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __pyx_r = __pyx_t_5;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":1276\n *     Returns the encoder's flags.\n *     \"\"\"\n *     return self._encoder.get().Flags()             # <<<<<<<<<<<<<<\n * \n *   cpdef _EncodeMapperSymbolTable input_symbols(self):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_encoder\");\n    __PYX_ERR(0, 1276, __pyx_L1_error)\n  }\n  __pyx_r = __pyx_v_self->_encoder.get()->Flags();\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":1270\n *     return _init_Arc(self._encoder.get().__call__(deref(arc._arc)))\n * \n *   cpdef uint32 flags(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     flags(self)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_WriteUnraisable(\"pywrapfst.EncodeMapper.flags\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_12EncodeMapper_9flags(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_12EncodeMapper_8flags[] = \"\\n    flags(self)\\n\\n    Returns the encoder's flags.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_12EncodeMapper_9flags(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"flags (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_12EncodeMapper_8flags(((struct __pyx_obj_9pywrapfst_EncodeMapper *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_12EncodeMapper_8flags(struct __pyx_obj_9pywrapfst_EncodeMapper *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"flags\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __Pyx_PyInt_From_uint32_t(__pyx_f_9pywrapfst_12EncodeMapper_flags(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1270, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.EncodeMapper.flags\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1278\n *     return self._encoder.get().Flags()\n * \n *   cpdef _EncodeMapperSymbolTable input_symbols(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     input_symbols(self)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_12EncodeMapper_11input_symbols(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic struct __pyx_obj_9pywrapfst__EncodeMapperSymbolTable *__pyx_f_9pywrapfst_12EncodeMapper_input_symbols(struct __pyx_obj_9pywrapfst_EncodeMapper *__pyx_v_self, int __pyx_skip_dispatch) {\n  fst::SymbolTable *__pyx_v_syms;\n  struct __pyx_obj_9pywrapfst__EncodeMapperSymbolTable *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  int __pyx_t_5;\n  __Pyx_RefNannySetupContext(\"input_symbols\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_input_symbols); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1278, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_12EncodeMapper_11input_symbols)) {\n      __Pyx_XDECREF(((PyObject *)__pyx_r));\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1278, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1278, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      if (!(likely(((__pyx_t_2) == Py_None) || likely(__Pyx_TypeTest(__pyx_t_2, __pyx_ptype_9pywrapfst__EncodeMapperSymbolTable))))) __PYX_ERR(0, 1278, __pyx_L1_error)\n      __pyx_r = ((struct __pyx_obj_9pywrapfst__EncodeMapperSymbolTable *)__pyx_t_2);\n      __pyx_t_2 = 0;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":1285\n *     \"\"\"\n *     cdef fst.SymbolTable *syms = const_cast[SymbolTable_ptr](\n *         self._encoder.get().InputSymbols())             # <<<<<<<<<<<<<<\n *     if syms == NULL:\n *       return\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_encoder\");\n    __PYX_ERR(0, 1285, __pyx_L1_error)\n  }\n\n  /* \"pywrapfst.pyx\":1284\n *     Returns the encoder's input symbol table, or None if none is present.\n *     \"\"\"\n *     cdef fst.SymbolTable *syms = const_cast[SymbolTable_ptr](             # <<<<<<<<<<<<<<\n *         self._encoder.get().InputSymbols())\n *     if syms == NULL:\n */\n  __pyx_v_syms = const_cast<__pyx_t_9pywrapfst_SymbolTable_ptr>(__pyx_v_self->_encoder.get()->InputSymbols());\n\n  /* \"pywrapfst.pyx\":1286\n *     cdef fst.SymbolTable *syms = const_cast[SymbolTable_ptr](\n *         self._encoder.get().InputSymbols())\n *     if syms == NULL:             # <<<<<<<<<<<<<<\n *       return\n *     return _init_EncodeMapperSymbolTable(syms, self._encoder)\n */\n  __pyx_t_5 = ((__pyx_v_syms == NULL) != 0);\n  if (__pyx_t_5) {\n\n    /* \"pywrapfst.pyx\":1287\n *         self._encoder.get().InputSymbols())\n *     if syms == NULL:\n *       return             # <<<<<<<<<<<<<<\n *     return _init_EncodeMapperSymbolTable(syms, self._encoder)\n * \n */\n    __Pyx_XDECREF(((PyObject *)__pyx_r));\n    __pyx_r = ((struct __pyx_obj_9pywrapfst__EncodeMapperSymbolTable *)Py_None); __Pyx_INCREF(Py_None);\n    goto __pyx_L0;\n\n    /* \"pywrapfst.pyx\":1286\n *     cdef fst.SymbolTable *syms = const_cast[SymbolTable_ptr](\n *         self._encoder.get().InputSymbols())\n *     if syms == NULL:             # <<<<<<<<<<<<<<\n *       return\n *     return _init_EncodeMapperSymbolTable(syms, self._encoder)\n */\n  }\n\n  /* \"pywrapfst.pyx\":1288\n *     if syms == NULL:\n *       return\n *     return _init_EncodeMapperSymbolTable(syms, self._encoder)             # <<<<<<<<<<<<<<\n * \n *   cpdef _EncodeMapperSymbolTable output_symbols(self):\n */\n  __Pyx_XDECREF(((PyObject *)__pyx_r));\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_encoder\");\n    __PYX_ERR(0, 1288, __pyx_L1_error)\n  }\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst__init_EncodeMapperSymbolTable(__pyx_v_syms, __pyx_v_self->_encoder)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1288, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = ((struct __pyx_obj_9pywrapfst__EncodeMapperSymbolTable *)__pyx_t_1);\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":1278\n *     return self._encoder.get().Flags()\n * \n *   cpdef _EncodeMapperSymbolTable input_symbols(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     input_symbols(self)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_AddTraceback(\"pywrapfst.EncodeMapper.input_symbols\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XGIVEREF((PyObject *)__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_12EncodeMapper_11input_symbols(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_12EncodeMapper_10input_symbols[] = \"\\n    input_symbols(self)\\n\\n    Returns the encoder's input symbol table, or None if none is present.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_12EncodeMapper_11input_symbols(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"input_symbols (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_12EncodeMapper_10input_symbols(((struct __pyx_obj_9pywrapfst_EncodeMapper *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_12EncodeMapper_10input_symbols(struct __pyx_obj_9pywrapfst_EncodeMapper *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"input_symbols\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst_12EncodeMapper_input_symbols(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1278, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.EncodeMapper.input_symbols\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1290\n *     return _init_EncodeMapperSymbolTable(syms, self._encoder)\n * \n *   cpdef _EncodeMapperSymbolTable output_symbols(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     output_symbols(self)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_12EncodeMapper_13output_symbols(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic struct __pyx_obj_9pywrapfst__EncodeMapperSymbolTable *__pyx_f_9pywrapfst_12EncodeMapper_output_symbols(struct __pyx_obj_9pywrapfst_EncodeMapper *__pyx_v_self, int __pyx_skip_dispatch) {\n  fst::SymbolTable *__pyx_v_syms;\n  struct __pyx_obj_9pywrapfst__EncodeMapperSymbolTable *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  int __pyx_t_5;\n  __Pyx_RefNannySetupContext(\"output_symbols\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_output_symbols); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1290, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_12EncodeMapper_13output_symbols)) {\n      __Pyx_XDECREF(((PyObject *)__pyx_r));\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1290, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1290, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      if (!(likely(((__pyx_t_2) == Py_None) || likely(__Pyx_TypeTest(__pyx_t_2, __pyx_ptype_9pywrapfst__EncodeMapperSymbolTable))))) __PYX_ERR(0, 1290, __pyx_L1_error)\n      __pyx_r = ((struct __pyx_obj_9pywrapfst__EncodeMapperSymbolTable *)__pyx_t_2);\n      __pyx_t_2 = 0;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":1297\n *     \"\"\"\n *     cdef fst.SymbolTable *syms = const_cast[SymbolTable_ptr](\n *         self._encoder.get().OutputSymbols())             # <<<<<<<<<<<<<<\n *     if syms == NULL:\n *       return\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_encoder\");\n    __PYX_ERR(0, 1297, __pyx_L1_error)\n  }\n\n  /* \"pywrapfst.pyx\":1296\n *     Returns the encoder's output symbol table, or None if none is present.\n *     \"\"\"\n *     cdef fst.SymbolTable *syms = const_cast[SymbolTable_ptr](             # <<<<<<<<<<<<<<\n *         self._encoder.get().OutputSymbols())\n *     if syms == NULL:\n */\n  __pyx_v_syms = const_cast<__pyx_t_9pywrapfst_SymbolTable_ptr>(__pyx_v_self->_encoder.get()->OutputSymbols());\n\n  /* \"pywrapfst.pyx\":1298\n *     cdef fst.SymbolTable *syms = const_cast[SymbolTable_ptr](\n *         self._encoder.get().OutputSymbols())\n *     if syms == NULL:             # <<<<<<<<<<<<<<\n *       return\n *     return _init_EncodeMapperSymbolTable(syms, self._encoder)\n */\n  __pyx_t_5 = ((__pyx_v_syms == NULL) != 0);\n  if (__pyx_t_5) {\n\n    /* \"pywrapfst.pyx\":1299\n *         self._encoder.get().OutputSymbols())\n *     if syms == NULL:\n *       return             # <<<<<<<<<<<<<<\n *     return _init_EncodeMapperSymbolTable(syms, self._encoder)\n * \n */\n    __Pyx_XDECREF(((PyObject *)__pyx_r));\n    __pyx_r = ((struct __pyx_obj_9pywrapfst__EncodeMapperSymbolTable *)Py_None); __Pyx_INCREF(Py_None);\n    goto __pyx_L0;\n\n    /* \"pywrapfst.pyx\":1298\n *     cdef fst.SymbolTable *syms = const_cast[SymbolTable_ptr](\n *         self._encoder.get().OutputSymbols())\n *     if syms == NULL:             # <<<<<<<<<<<<<<\n *       return\n *     return _init_EncodeMapperSymbolTable(syms, self._encoder)\n */\n  }\n\n  /* \"pywrapfst.pyx\":1300\n *     if syms == NULL:\n *       return\n *     return _init_EncodeMapperSymbolTable(syms, self._encoder)             # <<<<<<<<<<<<<<\n * \n *   cpdef uint64 properties(self, uint64 mask):\n */\n  __Pyx_XDECREF(((PyObject *)__pyx_r));\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_encoder\");\n    __PYX_ERR(0, 1300, __pyx_L1_error)\n  }\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst__init_EncodeMapperSymbolTable(__pyx_v_syms, __pyx_v_self->_encoder)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1300, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = ((struct __pyx_obj_9pywrapfst__EncodeMapperSymbolTable *)__pyx_t_1);\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":1290\n *     return _init_EncodeMapperSymbolTable(syms, self._encoder)\n * \n *   cpdef _EncodeMapperSymbolTable output_symbols(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     output_symbols(self)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_AddTraceback(\"pywrapfst.EncodeMapper.output_symbols\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XGIVEREF((PyObject *)__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_12EncodeMapper_13output_symbols(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_12EncodeMapper_12output_symbols[] = \"\\n    output_symbols(self)\\n\\n    Returns the encoder's output symbol table, or None if none is present.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_12EncodeMapper_13output_symbols(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"output_symbols (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_12EncodeMapper_12output_symbols(((struct __pyx_obj_9pywrapfst_EncodeMapper *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_12EncodeMapper_12output_symbols(struct __pyx_obj_9pywrapfst_EncodeMapper *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"output_symbols\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst_12EncodeMapper_output_symbols(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1290, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.EncodeMapper.output_symbols\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1302\n *     return _init_EncodeMapperSymbolTable(syms, self._encoder)\n * \n *   cpdef uint64 properties(self, uint64 mask):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     properties(self, mask)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_12EncodeMapper_15properties(PyObject *__pyx_v_self, PyObject *__pyx_arg_mask); /*proto*/\nstatic __pyx_t_10basictypes_uint64 __pyx_f_9pywrapfst_12EncodeMapper_properties(struct __pyx_obj_9pywrapfst_EncodeMapper *__pyx_v_self, __pyx_t_10basictypes_uint64 __pyx_v_mask, int __pyx_skip_dispatch) {\n  __pyx_t_10basictypes_uint64 __pyx_r;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  PyObject *__pyx_t_6 = NULL;\n  __pyx_t_10basictypes_uint64 __pyx_t_7;\n  __Pyx_RefNannySetupContext(\"properties\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_properties); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1302, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_12EncodeMapper_15properties)) {\n      __pyx_t_3 = __Pyx_PyInt_From_uint64_t(__pyx_v_mask); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 1302, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_3);\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_4 = __pyx_t_1; __pyx_t_5 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_4))) {\n        __pyx_t_5 = PyMethod_GET_SELF(__pyx_t_4);\n        if (likely(__pyx_t_5)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_4);\n          __Pyx_INCREF(__pyx_t_5);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_4, function);\n        }\n      }\n      if (!__pyx_t_5) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_4, __pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1302, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n        __Pyx_GOTREF(__pyx_t_2);\n      } else {\n        #if CYTHON_FAST_PYCALL\n        if (PyFunction_Check(__pyx_t_4)) {\n          PyObject *__pyx_temp[2] = {__pyx_t_5, __pyx_t_3};\n          __pyx_t_2 = __Pyx_PyFunction_FastCall(__pyx_t_4, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1302, __pyx_L1_error)\n          __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;\n          __Pyx_GOTREF(__pyx_t_2);\n          __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n        } else\n        #endif\n        #if CYTHON_FAST_PYCCALL\n        if (__Pyx_PyFastCFunction_Check(__pyx_t_4)) {\n          PyObject *__pyx_temp[2] = {__pyx_t_5, __pyx_t_3};\n          __pyx_t_2 = __Pyx_PyCFunction_FastCall(__pyx_t_4, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1302, __pyx_L1_error)\n          __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;\n          __Pyx_GOTREF(__pyx_t_2);\n          __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n        } else\n        #endif\n        {\n          __pyx_t_6 = PyTuple_New(1+1); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 1302, __pyx_L1_error)\n          __Pyx_GOTREF(__pyx_t_6);\n          __Pyx_GIVEREF(__pyx_t_5); PyTuple_SET_ITEM(__pyx_t_6, 0, __pyx_t_5); __pyx_t_5 = NULL;\n          __Pyx_GIVEREF(__pyx_t_3);\n          PyTuple_SET_ITEM(__pyx_t_6, 0+1, __pyx_t_3);\n          __pyx_t_3 = 0;\n          __pyx_t_2 = __Pyx_PyObject_Call(__pyx_t_4, __pyx_t_6, NULL); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1302, __pyx_L1_error)\n          __Pyx_GOTREF(__pyx_t_2);\n          __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n        }\n      }\n      __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      __pyx_t_7 = __Pyx_PyInt_As_uint64_t(__pyx_t_2); if (unlikely((__pyx_t_7 == ((uint64_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 1302, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __pyx_r = __pyx_t_7;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":1316\n *       A 64-bit bitmask representing the requested properties.\n *     \"\"\"\n *     return self._encoder.get().Properties(mask)             # <<<<<<<<<<<<<<\n * \n *   cpdef void set_input_symbols(self, _SymbolTable syms) except *:\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_encoder\");\n    __PYX_ERR(0, 1316, __pyx_L1_error)\n  }\n  __pyx_r = __pyx_v_self->_encoder.get()->Properties(__pyx_v_mask);\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":1302\n *     return _init_EncodeMapperSymbolTable(syms, self._encoder)\n * \n *   cpdef uint64 properties(self, uint64 mask):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     properties(self, mask)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_XDECREF(__pyx_t_6);\n  __Pyx_WriteUnraisable(\"pywrapfst.EncodeMapper.properties\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_12EncodeMapper_15properties(PyObject *__pyx_v_self, PyObject *__pyx_arg_mask); /*proto*/\nstatic char __pyx_doc_9pywrapfst_12EncodeMapper_14properties[] = \"\\n    properties(self, mask)\\n\\n    Provides property bits.\\n\\n    This method provides user access to the properties of the encoder.\\n\\n    Args:\\n      mask: The property mask to be compared to the encoder's properties.\\n\\n    Returns:\\n      A 64-bit bitmask representing the requested properties.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_12EncodeMapper_15properties(PyObject *__pyx_v_self, PyObject *__pyx_arg_mask) {\n  __pyx_t_10basictypes_uint64 __pyx_v_mask;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"properties (wrapper)\", 0);\n  assert(__pyx_arg_mask); {\n    __pyx_v_mask = __Pyx_PyInt_As_uint64_t(__pyx_arg_mask); if (unlikely((__pyx_v_mask == ((uint64_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 1302, __pyx_L3_error)\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst.EncodeMapper.properties\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  __pyx_r = __pyx_pf_9pywrapfst_12EncodeMapper_14properties(((struct __pyx_obj_9pywrapfst_EncodeMapper *)__pyx_v_self), ((__pyx_t_10basictypes_uint64)__pyx_v_mask));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_12EncodeMapper_14properties(struct __pyx_obj_9pywrapfst_EncodeMapper *__pyx_v_self, __pyx_t_10basictypes_uint64 __pyx_v_mask) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"properties\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(__pyx_f_9pywrapfst_12EncodeMapper_properties(__pyx_v_self, __pyx_v_mask, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1302, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.EncodeMapper.properties\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1318\n *     return self._encoder.get().Properties(mask)\n * \n *   cpdef void set_input_symbols(self, _SymbolTable syms) except *:             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     set_input_symbols(self, syms)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_12EncodeMapper_17set_input_symbols(PyObject *__pyx_v_self, PyObject *__pyx_v_syms); /*proto*/\nstatic void __pyx_f_9pywrapfst_12EncodeMapper_set_input_symbols(struct __pyx_obj_9pywrapfst_EncodeMapper *__pyx_v_self, struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_syms, int __pyx_skip_dispatch) {\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  __Pyx_RefNannySetupContext(\"set_input_symbols\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_set_input_symbols); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1318, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_12EncodeMapper_17set_input_symbols)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (!__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, ((PyObject *)__pyx_v_syms)); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1318, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_2);\n      } else {\n        #if CYTHON_FAST_PYCALL\n        if (PyFunction_Check(__pyx_t_3)) {\n          PyObject *__pyx_temp[2] = {__pyx_t_4, ((PyObject *)__pyx_v_syms)};\n          __pyx_t_2 = __Pyx_PyFunction_FastCall(__pyx_t_3, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1318, __pyx_L1_error)\n          __Pyx_XDECREF(__pyx_t_4); __pyx_t_4 = 0;\n          __Pyx_GOTREF(__pyx_t_2);\n        } else\n        #endif\n        #if CYTHON_FAST_PYCCALL\n        if (__Pyx_PyFastCFunction_Check(__pyx_t_3)) {\n          PyObject *__pyx_temp[2] = {__pyx_t_4, ((PyObject *)__pyx_v_syms)};\n          __pyx_t_2 = __Pyx_PyCFunction_FastCall(__pyx_t_3, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1318, __pyx_L1_error)\n          __Pyx_XDECREF(__pyx_t_4); __pyx_t_4 = 0;\n          __Pyx_GOTREF(__pyx_t_2);\n        } else\n        #endif\n        {\n          __pyx_t_5 = PyTuple_New(1+1); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 1318, __pyx_L1_error)\n          __Pyx_GOTREF(__pyx_t_5);\n          __Pyx_GIVEREF(__pyx_t_4); PyTuple_SET_ITEM(__pyx_t_5, 0, __pyx_t_4); __pyx_t_4 = NULL;\n          __Pyx_INCREF(((PyObject *)__pyx_v_syms));\n          __Pyx_GIVEREF(((PyObject *)__pyx_v_syms));\n          PyTuple_SET_ITEM(__pyx_t_5, 0+1, ((PyObject *)__pyx_v_syms));\n          __pyx_t_2 = __Pyx_PyObject_Call(__pyx_t_3, __pyx_t_5, NULL); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1318, __pyx_L1_error)\n          __Pyx_GOTREF(__pyx_t_2);\n          __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n        }\n      }\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":1329\n *     See also: `set_output_symbols`.\n *     \"\"\"\n *     self._encoder.get().SetInputSymbols(syms._table)             # <<<<<<<<<<<<<<\n * \n *   cpdef void set_output_symbols(self, _SymbolTable syms) except *:\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_encoder\");\n    __PYX_ERR(0, 1329, __pyx_L1_error)\n  }\n  if (unlikely(((PyObject *)__pyx_v_syms) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_table\");\n    __PYX_ERR(0, 1329, __pyx_L1_error)\n  }\n  __pyx_v_self->_encoder.get()->SetInputSymbols(__pyx_v_syms->_table);\n\n  /* \"pywrapfst.pyx\":1318\n *     return self._encoder.get().Properties(mask)\n * \n *   cpdef void set_input_symbols(self, _SymbolTable syms) except *:             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     set_input_symbols(self, syms)\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_AddTraceback(\"pywrapfst.EncodeMapper.set_input_symbols\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_12EncodeMapper_17set_input_symbols(PyObject *__pyx_v_self, PyObject *__pyx_v_syms); /*proto*/\nstatic char __pyx_doc_9pywrapfst_12EncodeMapper_16set_input_symbols[] = \"\\n    set_input_symbols(self, syms)\\n\\n    Sets the encoder's input symbol table.\\n\\n    Args:\\n      syms: A SymbolTable.\\n\\n    See also: `set_output_symbols`.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_12EncodeMapper_17set_input_symbols(PyObject *__pyx_v_self, PyObject *__pyx_v_syms) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"set_input_symbols (wrapper)\", 0);\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_syms), __pyx_ptype_9pywrapfst__SymbolTable, 1, \"syms\", 0))) __PYX_ERR(0, 1318, __pyx_L1_error)\n  __pyx_r = __pyx_pf_9pywrapfst_12EncodeMapper_16set_input_symbols(((struct __pyx_obj_9pywrapfst_EncodeMapper *)__pyx_v_self), ((struct __pyx_obj_9pywrapfst__SymbolTable *)__pyx_v_syms));\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_12EncodeMapper_16set_input_symbols(struct __pyx_obj_9pywrapfst_EncodeMapper *__pyx_v_self, struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_syms) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"set_input_symbols\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_f_9pywrapfst_12EncodeMapper_set_input_symbols(__pyx_v_self, __pyx_v_syms, 1); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 1318, __pyx_L1_error)\n  __pyx_t_1 = __Pyx_void_to_None(NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1318, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.EncodeMapper.set_input_symbols\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1331\n *     self._encoder.get().SetInputSymbols(syms._table)\n * \n *   cpdef void set_output_symbols(self, _SymbolTable syms) except *:             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     set_output_symbols(self, syms)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_12EncodeMapper_19set_output_symbols(PyObject *__pyx_v_self, PyObject *__pyx_v_syms); /*proto*/\nstatic void __pyx_f_9pywrapfst_12EncodeMapper_set_output_symbols(struct __pyx_obj_9pywrapfst_EncodeMapper *__pyx_v_self, struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_syms, int __pyx_skip_dispatch) {\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  __Pyx_RefNannySetupContext(\"set_output_symbols\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_set_output_symbols); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1331, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_12EncodeMapper_19set_output_symbols)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (!__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, ((PyObject *)__pyx_v_syms)); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1331, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_2);\n      } else {\n        #if CYTHON_FAST_PYCALL\n        if (PyFunction_Check(__pyx_t_3)) {\n          PyObject *__pyx_temp[2] = {__pyx_t_4, ((PyObject *)__pyx_v_syms)};\n          __pyx_t_2 = __Pyx_PyFunction_FastCall(__pyx_t_3, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1331, __pyx_L1_error)\n          __Pyx_XDECREF(__pyx_t_4); __pyx_t_4 = 0;\n          __Pyx_GOTREF(__pyx_t_2);\n        } else\n        #endif\n        #if CYTHON_FAST_PYCCALL\n        if (__Pyx_PyFastCFunction_Check(__pyx_t_3)) {\n          PyObject *__pyx_temp[2] = {__pyx_t_4, ((PyObject *)__pyx_v_syms)};\n          __pyx_t_2 = __Pyx_PyCFunction_FastCall(__pyx_t_3, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1331, __pyx_L1_error)\n          __Pyx_XDECREF(__pyx_t_4); __pyx_t_4 = 0;\n          __Pyx_GOTREF(__pyx_t_2);\n        } else\n        #endif\n        {\n          __pyx_t_5 = PyTuple_New(1+1); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 1331, __pyx_L1_error)\n          __Pyx_GOTREF(__pyx_t_5);\n          __Pyx_GIVEREF(__pyx_t_4); PyTuple_SET_ITEM(__pyx_t_5, 0, __pyx_t_4); __pyx_t_4 = NULL;\n          __Pyx_INCREF(((PyObject *)__pyx_v_syms));\n          __Pyx_GIVEREF(((PyObject *)__pyx_v_syms));\n          PyTuple_SET_ITEM(__pyx_t_5, 0+1, ((PyObject *)__pyx_v_syms));\n          __pyx_t_2 = __Pyx_PyObject_Call(__pyx_t_3, __pyx_t_5, NULL); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1331, __pyx_L1_error)\n          __Pyx_GOTREF(__pyx_t_2);\n          __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n        }\n      }\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":1342\n *     See also: `set_input_symbols`.\n *     \"\"\"\n *     self._encoder.get().SetOutputSymbols(syms._table)             # <<<<<<<<<<<<<<\n * \n *   cpdef string weight_type(self):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_encoder\");\n    __PYX_ERR(0, 1342, __pyx_L1_error)\n  }\n  if (unlikely(((PyObject *)__pyx_v_syms) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_table\");\n    __PYX_ERR(0, 1342, __pyx_L1_error)\n  }\n  __pyx_v_self->_encoder.get()->SetOutputSymbols(__pyx_v_syms->_table);\n\n  /* \"pywrapfst.pyx\":1331\n *     self._encoder.get().SetInputSymbols(syms._table)\n * \n *   cpdef void set_output_symbols(self, _SymbolTable syms) except *:             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     set_output_symbols(self, syms)\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_AddTraceback(\"pywrapfst.EncodeMapper.set_output_symbols\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_12EncodeMapper_19set_output_symbols(PyObject *__pyx_v_self, PyObject *__pyx_v_syms); /*proto*/\nstatic char __pyx_doc_9pywrapfst_12EncodeMapper_18set_output_symbols[] = \"\\n    set_output_symbols(self, syms)\\n\\n    Sets the encoder's output symbol table.\\n\\n    Args:\\n      syms: A SymbolTable.\\n\\n    See also: `set_input_symbols`.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_12EncodeMapper_19set_output_symbols(PyObject *__pyx_v_self, PyObject *__pyx_v_syms) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"set_output_symbols (wrapper)\", 0);\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_syms), __pyx_ptype_9pywrapfst__SymbolTable, 1, \"syms\", 0))) __PYX_ERR(0, 1331, __pyx_L1_error)\n  __pyx_r = __pyx_pf_9pywrapfst_12EncodeMapper_18set_output_symbols(((struct __pyx_obj_9pywrapfst_EncodeMapper *)__pyx_v_self), ((struct __pyx_obj_9pywrapfst__SymbolTable *)__pyx_v_syms));\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_12EncodeMapper_18set_output_symbols(struct __pyx_obj_9pywrapfst_EncodeMapper *__pyx_v_self, struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_syms) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"set_output_symbols\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_f_9pywrapfst_12EncodeMapper_set_output_symbols(__pyx_v_self, __pyx_v_syms, 1); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 1331, __pyx_L1_error)\n  __pyx_t_1 = __Pyx_void_to_None(NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1331, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.EncodeMapper.set_output_symbols\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1344\n *     self._encoder.get().SetOutputSymbols(syms._table)\n * \n *   cpdef string weight_type(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     weight_type(self)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_12EncodeMapper_21weight_type(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic std::string __pyx_f_9pywrapfst_12EncodeMapper_weight_type(struct __pyx_obj_9pywrapfst_EncodeMapper *__pyx_v_self, int __pyx_skip_dispatch) {\n  std::string __pyx_r;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  std::string __pyx_t_5;\n  __Pyx_RefNannySetupContext(\"weight_type\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_weight_type); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1344, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_12EncodeMapper_21weight_type)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1344, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1344, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __pyx_t_5 = __pyx_convert_string_from_py_std__in_string(__pyx_t_2); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 1344, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __pyx_r = __pyx_t_5;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":1350\n *     Returns a string indicating the weight type.\n *     \"\"\"\n *     return self._encoder.get().WeightType()             # <<<<<<<<<<<<<<\n * \n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_encoder\");\n    __PYX_ERR(0, 1350, __pyx_L1_error)\n  }\n  __pyx_r = __pyx_v_self->_encoder.get()->WeightType();\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":1344\n *     self._encoder.get().SetOutputSymbols(syms._table)\n * \n *   cpdef string weight_type(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     weight_type(self)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_WriteUnraisable(\"pywrapfst.EncodeMapper.weight_type\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __Pyx_pretend_to_initialize(&__pyx_r);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_12EncodeMapper_21weight_type(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_12EncodeMapper_20weight_type[] = \"\\n    weight_type(self)\\n\\n    Returns a string indicating the weight type.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_12EncodeMapper_21weight_type(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"weight_type (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_12EncodeMapper_20weight_type(((struct __pyx_obj_9pywrapfst_EncodeMapper *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_12EncodeMapper_20weight_type(struct __pyx_obj_9pywrapfst_EncodeMapper *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"weight_type\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __pyx_convert_PyBytes_string_to_py_std__in_string(__pyx_f_9pywrapfst_12EncodeMapper_weight_type(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1344, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.EncodeMapper.weight_type\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"(tree fragment)\":1\n * def __reduce_cython__(self):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._encoder cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_12EncodeMapper_23__reduce_cython__(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_12EncodeMapper_23__reduce_cython__(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__reduce_cython__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_12EncodeMapper_22__reduce_cython__(((struct __pyx_obj_9pywrapfst_EncodeMapper *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_12EncodeMapper_22__reduce_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst_EncodeMapper *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"__reduce_cython__\", 0);\n\n  /* \"(tree fragment)\":2\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._encoder cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._encoder cannot be converted to a Python object for pickling\")\n */\n  __pyx_t_1 = __Pyx_PyObject_Call(__pyx_builtin_TypeError, __pyx_tuple__22, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(1, 2, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __Pyx_Raise(__pyx_t_1, 0, 0, 0);\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  __PYX_ERR(1, 2, __pyx_L1_error)\n\n  /* \"(tree fragment)\":1\n * def __reduce_cython__(self):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._encoder cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.EncodeMapper.__reduce_cython__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"(tree fragment)\":3\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._encoder cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._encoder cannot be converted to a Python object for pickling\")\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_12EncodeMapper_25__setstate_cython__(PyObject *__pyx_v_self, PyObject *__pyx_v___pyx_state); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_12EncodeMapper_25__setstate_cython__(PyObject *__pyx_v_self, PyObject *__pyx_v___pyx_state) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__setstate_cython__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_12EncodeMapper_24__setstate_cython__(((struct __pyx_obj_9pywrapfst_EncodeMapper *)__pyx_v_self), ((PyObject *)__pyx_v___pyx_state));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_12EncodeMapper_24__setstate_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst_EncodeMapper *__pyx_v_self, CYTHON_UNUSED PyObject *__pyx_v___pyx_state) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"__setstate_cython__\", 0);\n\n  /* \"(tree fragment)\":4\n *     raise TypeError(\"self._encoder cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._encoder cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n */\n  __pyx_t_1 = __Pyx_PyObject_Call(__pyx_builtin_TypeError, __pyx_tuple__23, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(1, 4, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __Pyx_Raise(__pyx_t_1, 0, 0, 0);\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  __PYX_ERR(1, 4, __pyx_L1_error)\n\n  /* \"(tree fragment)\":3\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._encoder cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._encoder cannot be converted to a Python object for pickling\")\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.EncodeMapper.__setstate_cython__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1374\n * \n *   # IPython notebook magic to produce an SVG of the FST.\n *   def _repr_svg_(self):             # <<<<<<<<<<<<<<\n *     \"\"\"IPython notebook magic to produce an SVG of the FST using GraphViz.\n * \n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_1_repr_svg_(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_4_Fst__repr_svg_[] = \"IPython notebook magic to produce an SVG of the FST using GraphViz.\\n\\n    This method produces an SVG of the internal graph. Users wishing to create\\n    publication-quality graphs should instead use the method `draw`, which\\n    exposes additional parameters.\\n\\n    Raises:\\n      OSError: Cannot locate the `dot` executable.\\n      subprocess.CalledProcessError: `dot` returned non-zero exit code.\\n\\n    See also: `draw`, `text`.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_1_repr_svg_(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"_repr_svg_ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_4_Fst__repr_svg_(((struct __pyx_obj_9pywrapfst__Fst *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_4_Fst__repr_svg_(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self) {\n  PyObject *__pyx_v_proc = NULL;\n  std::stringstream __pyx_v_sstrm;\n  PyObject *__pyx_v_sout = NULL;\n  CYTHON_UNUSED PyObject *__pyx_v_serr = NULL;\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  std::string __pyx_t_6;\n  std::string __pyx_t_7;\n  std::string __pyx_t_8;\n  PyObject *(*__pyx_t_9)(PyObject *);\n  int __pyx_t_10;\n  int __pyx_t_11;\n  PyObject *__pyx_t_12 = NULL;\n  __Pyx_RefNannySetupContext(\"_repr_svg_\", 0);\n\n  /* \"pywrapfst.pyx\":1388\n *     \"\"\"\n *     # Throws OSError if the dot executable is not found.\n *     proc = subprocess.Popen([\"dot\", \"-Tsvg\"], stdin=subprocess.PIPE,             # <<<<<<<<<<<<<<\n *                             stdout=subprocess.PIPE, stderr=subprocess.PIPE)\n *     cdef stringstream sstrm\n */\n  __pyx_t_1 = __Pyx_GetModuleGlobalName(__pyx_n_s_subprocess); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1388, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_t_2 = __Pyx_PyObject_GetAttrStr(__pyx_t_1, __pyx_n_s_Popen); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1388, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  __pyx_t_1 = PyList_New(2); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1388, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __Pyx_INCREF(__pyx_n_s_dot);\n  __Pyx_GIVEREF(__pyx_n_s_dot);\n  PyList_SET_ITEM(__pyx_t_1, 0, __pyx_n_s_dot);\n  __Pyx_INCREF(__pyx_kp_s_Tsvg);\n  __Pyx_GIVEREF(__pyx_kp_s_Tsvg);\n  PyList_SET_ITEM(__pyx_t_1, 1, __pyx_kp_s_Tsvg);\n  __pyx_t_3 = PyTuple_New(1); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 1388, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_3);\n  __Pyx_GIVEREF(__pyx_t_1);\n  PyTuple_SET_ITEM(__pyx_t_3, 0, __pyx_t_1);\n  __pyx_t_1 = 0;\n  __pyx_t_1 = __Pyx_PyDict_NewPresized(3); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1388, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_t_4 = __Pyx_GetModuleGlobalName(__pyx_n_s_subprocess); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 1388, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_4);\n  __pyx_t_5 = __Pyx_PyObject_GetAttrStr(__pyx_t_4, __pyx_n_s_PIPE); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 1388, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_5);\n  __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n  if (PyDict_SetItem(__pyx_t_1, __pyx_n_s_stdin, __pyx_t_5) < 0) __PYX_ERR(0, 1388, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n\n  /* \"pywrapfst.pyx\":1389\n *     # Throws OSError if the dot executable is not found.\n *     proc = subprocess.Popen([\"dot\", \"-Tsvg\"], stdin=subprocess.PIPE,\n *                             stdout=subprocess.PIPE, stderr=subprocess.PIPE)             # <<<<<<<<<<<<<<\n *     cdef stringstream sstrm\n *     fst.DrawFst(deref(self._fst), self._fst.get().InputSymbols(),\n */\n  __pyx_t_5 = __Pyx_GetModuleGlobalName(__pyx_n_s_subprocess); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 1389, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_5);\n  __pyx_t_4 = __Pyx_PyObject_GetAttrStr(__pyx_t_5, __pyx_n_s_PIPE); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 1389, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_4);\n  __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n  if (PyDict_SetItem(__pyx_t_1, __pyx_n_s_stdout, __pyx_t_4) < 0) __PYX_ERR(0, 1388, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n  __pyx_t_4 = __Pyx_GetModuleGlobalName(__pyx_n_s_subprocess); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 1389, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_4);\n  __pyx_t_5 = __Pyx_PyObject_GetAttrStr(__pyx_t_4, __pyx_n_s_PIPE); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 1389, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_5);\n  __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n  if (PyDict_SetItem(__pyx_t_1, __pyx_n_s_stderr, __pyx_t_5) < 0) __PYX_ERR(0, 1388, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n\n  /* \"pywrapfst.pyx\":1388\n *     \"\"\"\n *     # Throws OSError if the dot executable is not found.\n *     proc = subprocess.Popen([\"dot\", \"-Tsvg\"], stdin=subprocess.PIPE,             # <<<<<<<<<<<<<<\n *                             stdout=subprocess.PIPE, stderr=subprocess.PIPE)\n *     cdef stringstream sstrm\n */\n  __pyx_t_5 = __Pyx_PyObject_Call(__pyx_t_2, __pyx_t_3, __pyx_t_1); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 1388, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_5);\n  __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n  __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  __pyx_v_proc = __pyx_t_5;\n  __pyx_t_5 = 0;\n\n  /* \"pywrapfst.pyx\":1391\n *                             stdout=subprocess.PIPE, stderr=subprocess.PIPE)\n *     cdef stringstream sstrm\n *     fst.DrawFst(deref(self._fst), self._fst.get().InputSymbols(),             # <<<<<<<<<<<<<<\n *                 self._fst.get().OutputSymbols(), NULL,\n *                 self._fst.get().Properties(fst.kAcceptor, True) ==\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 1391, __pyx_L1_error)\n  }\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 1391, __pyx_L1_error)\n  }\n\n  /* \"pywrapfst.pyx\":1392\n *     cdef stringstream sstrm\n *     fst.DrawFst(deref(self._fst), self._fst.get().InputSymbols(),\n *                 self._fst.get().OutputSymbols(), NULL,             # <<<<<<<<<<<<<<\n *                 self._fst.get().Properties(fst.kAcceptor, True) ==\n *                 fst.kAcceptor,\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 1392, __pyx_L1_error)\n  }\n\n  /* \"pywrapfst.pyx\":1393\n *     fst.DrawFst(deref(self._fst), self._fst.get().InputSymbols(),\n *                 self._fst.get().OutputSymbols(), NULL,\n *                 self._fst.get().Properties(fst.kAcceptor, True) ==             # <<<<<<<<<<<<<<\n *                 fst.kAcceptor,\n *                 b\"\", 8.5, 11, True, False, 0.4, 0.25, 14, 5, b\"g\", False,\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 1393, __pyx_L1_error)\n  }\n\n  /* \"pywrapfst.pyx\":1395\n *                 self._fst.get().Properties(fst.kAcceptor, True) ==\n *                 fst.kAcceptor,\n *                 b\"\", 8.5, 11, True, False, 0.4, 0.25, 14, 5, b\"g\", False,             # <<<<<<<<<<<<<<\n *                 addr(sstrm), b\"_repr_svg\")\n *     (sout, serr) = proc.communicate(sstrm.str())\n */\n  __pyx_t_6 = __pyx_convert_string_from_py_std__in_string(__pyx_kp_b__24); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 1395, __pyx_L1_error)\n  __pyx_t_7 = __pyx_convert_string_from_py_std__in_string(__pyx_n_b_g); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 1395, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":1396\n *                 fst.kAcceptor,\n *                 b\"\", 8.5, 11, True, False, 0.4, 0.25, 14, 5, b\"g\", False,\n *                 addr(sstrm), b\"_repr_svg\")             # <<<<<<<<<<<<<<\n *     (sout, serr) = proc.communicate(sstrm.str())\n *     if proc.returncode != 0:  # Just to be explicit.\n */\n  __pyx_t_8 = __pyx_convert_string_from_py_std__in_string(__pyx_n_b_repr_svg); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 1396, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":1391\n *                             stdout=subprocess.PIPE, stderr=subprocess.PIPE)\n *     cdef stringstream sstrm\n *     fst.DrawFst(deref(self._fst), self._fst.get().InputSymbols(),             # <<<<<<<<<<<<<<\n *                 self._fst.get().OutputSymbols(), NULL,\n *                 self._fst.get().Properties(fst.kAcceptor, True) ==\n */\n  fst::script::DrawFst((*__pyx_v_self->_fst), __pyx_v_self->_fst.get()->InputSymbols(), __pyx_v_self->_fst.get()->OutputSymbols(), NULL, (__pyx_v_self->_fst.get()->Properties(fst::kAcceptor, 1) == fst::kAcceptor), __pyx_t_6, 8.5, 11.0, 1, 0, 0.4, 0.25, 14, 5, __pyx_t_7, 0, (&__pyx_v_sstrm), __pyx_t_8);\n\n  /* \"pywrapfst.pyx\":1397\n *                 b\"\", 8.5, 11, True, False, 0.4, 0.25, 14, 5, b\"g\", False,\n *                 addr(sstrm), b\"_repr_svg\")\n *     (sout, serr) = proc.communicate(sstrm.str())             # <<<<<<<<<<<<<<\n *     if proc.returncode != 0:  # Just to be explicit.\n *       raise subprocess.CalledProcessError(proc.returncode, self._DOT_TSVG)\n */\n  __pyx_t_1 = __Pyx_PyObject_GetAttrStr(__pyx_v_proc, __pyx_n_s_communicate); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1397, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_t_3 = __pyx_convert_PyBytes_string_to_py_std__in_string(__pyx_v_sstrm.str()); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 1397, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_3);\n  __pyx_t_2 = NULL;\n  if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_1))) {\n    __pyx_t_2 = PyMethod_GET_SELF(__pyx_t_1);\n    if (likely(__pyx_t_2)) {\n      PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_1);\n      __Pyx_INCREF(__pyx_t_2);\n      __Pyx_INCREF(function);\n      __Pyx_DECREF_SET(__pyx_t_1, function);\n    }\n  }\n  if (!__pyx_t_2) {\n    __pyx_t_5 = __Pyx_PyObject_CallOneArg(__pyx_t_1, __pyx_t_3); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 1397, __pyx_L1_error)\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    __Pyx_GOTREF(__pyx_t_5);\n  } else {\n    #if CYTHON_FAST_PYCALL\n    if (PyFunction_Check(__pyx_t_1)) {\n      PyObject *__pyx_temp[2] = {__pyx_t_2, __pyx_t_3};\n      __pyx_t_5 = __Pyx_PyFunction_FastCall(__pyx_t_1, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 1397, __pyx_L1_error)\n      __Pyx_XDECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __Pyx_GOTREF(__pyx_t_5);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    } else\n    #endif\n    #if CYTHON_FAST_PYCCALL\n    if (__Pyx_PyFastCFunction_Check(__pyx_t_1)) {\n      PyObject *__pyx_temp[2] = {__pyx_t_2, __pyx_t_3};\n      __pyx_t_5 = __Pyx_PyCFunction_FastCall(__pyx_t_1, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 1397, __pyx_L1_error)\n      __Pyx_XDECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __Pyx_GOTREF(__pyx_t_5);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    } else\n    #endif\n    {\n      __pyx_t_4 = PyTuple_New(1+1); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 1397, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_4);\n      __Pyx_GIVEREF(__pyx_t_2); PyTuple_SET_ITEM(__pyx_t_4, 0, __pyx_t_2); __pyx_t_2 = NULL;\n      __Pyx_GIVEREF(__pyx_t_3);\n      PyTuple_SET_ITEM(__pyx_t_4, 0+1, __pyx_t_3);\n      __pyx_t_3 = 0;\n      __pyx_t_5 = __Pyx_PyObject_Call(__pyx_t_1, __pyx_t_4, NULL); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 1397, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_5);\n      __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n    }\n  }\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  if ((likely(PyTuple_CheckExact(__pyx_t_5))) || (PyList_CheckExact(__pyx_t_5))) {\n    PyObject* sequence = __pyx_t_5;\n    #if !CYTHON_COMPILING_IN_PYPY\n    Py_ssize_t size = Py_SIZE(sequence);\n    #else\n    Py_ssize_t size = PySequence_Size(sequence);\n    #endif\n    if (unlikely(size != 2)) {\n      if (size > 2) __Pyx_RaiseTooManyValuesError(2);\n      else if (size >= 0) __Pyx_RaiseNeedMoreValuesError(size);\n      __PYX_ERR(0, 1397, __pyx_L1_error)\n    }\n    #if CYTHON_ASSUME_SAFE_MACROS && !CYTHON_AVOID_BORROWED_REFS\n    if (likely(PyTuple_CheckExact(sequence))) {\n      __pyx_t_1 = PyTuple_GET_ITEM(sequence, 0); \n      __pyx_t_4 = PyTuple_GET_ITEM(sequence, 1); \n    } else {\n      __pyx_t_1 = PyList_GET_ITEM(sequence, 0); \n      __pyx_t_4 = PyList_GET_ITEM(sequence, 1); \n    }\n    __Pyx_INCREF(__pyx_t_1);\n    __Pyx_INCREF(__pyx_t_4);\n    #else\n    __pyx_t_1 = PySequence_ITEM(sequence, 0); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1397, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    __pyx_t_4 = PySequence_ITEM(sequence, 1); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 1397, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_4);\n    #endif\n    __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n  } else {\n    Py_ssize_t index = -1;\n    __pyx_t_3 = PyObject_GetIter(__pyx_t_5); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 1397, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_3);\n    __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n    __pyx_t_9 = Py_TYPE(__pyx_t_3)->tp_iternext;\n    index = 0; __pyx_t_1 = __pyx_t_9(__pyx_t_3); if (unlikely(!__pyx_t_1)) goto __pyx_L3_unpacking_failed;\n    __Pyx_GOTREF(__pyx_t_1);\n    index = 1; __pyx_t_4 = __pyx_t_9(__pyx_t_3); if (unlikely(!__pyx_t_4)) goto __pyx_L3_unpacking_failed;\n    __Pyx_GOTREF(__pyx_t_4);\n    if (__Pyx_IternextUnpackEndCheck(__pyx_t_9(__pyx_t_3), 2) < 0) __PYX_ERR(0, 1397, __pyx_L1_error)\n    __pyx_t_9 = NULL;\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    goto __pyx_L4_unpacking_done;\n    __pyx_L3_unpacking_failed:;\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    __pyx_t_9 = NULL;\n    if (__Pyx_IterFinish() == 0) __Pyx_RaiseNeedMoreValuesError(index);\n    __PYX_ERR(0, 1397, __pyx_L1_error)\n    __pyx_L4_unpacking_done:;\n  }\n  __pyx_v_sout = __pyx_t_1;\n  __pyx_t_1 = 0;\n  __pyx_v_serr = __pyx_t_4;\n  __pyx_t_4 = 0;\n\n  /* \"pywrapfst.pyx\":1398\n *                 addr(sstrm), b\"_repr_svg\")\n *     (sout, serr) = proc.communicate(sstrm.str())\n *     if proc.returncode != 0:  # Just to be explicit.             # <<<<<<<<<<<<<<\n *       raise subprocess.CalledProcessError(proc.returncode, self._DOT_TSVG)\n *     return sout.decode(\"utf8\")\n */\n  __pyx_t_5 = __Pyx_PyObject_GetAttrStr(__pyx_v_proc, __pyx_n_s_returncode); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 1398, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_5);\n  __pyx_t_4 = PyObject_RichCompare(__pyx_t_5, __pyx_int_0, Py_NE); __Pyx_XGOTREF(__pyx_t_4); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 1398, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n  __pyx_t_10 = __Pyx_PyObject_IsTrue(__pyx_t_4); if (unlikely(__pyx_t_10 < 0)) __PYX_ERR(0, 1398, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n  if (__pyx_t_10) {\n\n    /* \"pywrapfst.pyx\":1399\n *     (sout, serr) = proc.communicate(sstrm.str())\n *     if proc.returncode != 0:  # Just to be explicit.\n *       raise subprocess.CalledProcessError(proc.returncode, self._DOT_TSVG)             # <<<<<<<<<<<<<<\n *     return sout.decode(\"utf8\")\n * \n */\n    __pyx_t_5 = __Pyx_GetModuleGlobalName(__pyx_n_s_subprocess); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 1399, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_5);\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(__pyx_t_5, __pyx_n_s_CalledProcessError); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1399, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n    __pyx_t_5 = __Pyx_PyObject_GetAttrStr(__pyx_v_proc, __pyx_n_s_returncode); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 1399, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_5);\n    __pyx_t_3 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_DOT_TSVG); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 1399, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_3);\n    __pyx_t_2 = NULL;\n    __pyx_t_11 = 0;\n    if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_1))) {\n      __pyx_t_2 = PyMethod_GET_SELF(__pyx_t_1);\n      if (likely(__pyx_t_2)) {\n        PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_1);\n        __Pyx_INCREF(__pyx_t_2);\n        __Pyx_INCREF(function);\n        __Pyx_DECREF_SET(__pyx_t_1, function);\n        __pyx_t_11 = 1;\n      }\n    }\n    #if CYTHON_FAST_PYCALL\n    if (PyFunction_Check(__pyx_t_1)) {\n      PyObject *__pyx_temp[3] = {__pyx_t_2, __pyx_t_5, __pyx_t_3};\n      __pyx_t_4 = __Pyx_PyFunction_FastCall(__pyx_t_1, __pyx_temp+1-__pyx_t_11, 2+__pyx_t_11); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 1399, __pyx_L1_error)\n      __Pyx_XDECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __Pyx_GOTREF(__pyx_t_4);\n      __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    } else\n    #endif\n    #if CYTHON_FAST_PYCCALL\n    if (__Pyx_PyFastCFunction_Check(__pyx_t_1)) {\n      PyObject *__pyx_temp[3] = {__pyx_t_2, __pyx_t_5, __pyx_t_3};\n      __pyx_t_4 = __Pyx_PyCFunction_FastCall(__pyx_t_1, __pyx_temp+1-__pyx_t_11, 2+__pyx_t_11); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 1399, __pyx_L1_error)\n      __Pyx_XDECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __Pyx_GOTREF(__pyx_t_4);\n      __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    } else\n    #endif\n    {\n      __pyx_t_12 = PyTuple_New(2+__pyx_t_11); if (unlikely(!__pyx_t_12)) __PYX_ERR(0, 1399, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_12);\n      if (__pyx_t_2) {\n        __Pyx_GIVEREF(__pyx_t_2); PyTuple_SET_ITEM(__pyx_t_12, 0, __pyx_t_2); __pyx_t_2 = NULL;\n      }\n      __Pyx_GIVEREF(__pyx_t_5);\n      PyTuple_SET_ITEM(__pyx_t_12, 0+__pyx_t_11, __pyx_t_5);\n      __Pyx_GIVEREF(__pyx_t_3);\n      PyTuple_SET_ITEM(__pyx_t_12, 1+__pyx_t_11, __pyx_t_3);\n      __pyx_t_5 = 0;\n      __pyx_t_3 = 0;\n      __pyx_t_4 = __Pyx_PyObject_Call(__pyx_t_1, __pyx_t_12, NULL); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 1399, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_4);\n      __Pyx_DECREF(__pyx_t_12); __pyx_t_12 = 0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n    __Pyx_Raise(__pyx_t_4, 0, 0, 0);\n    __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n    __PYX_ERR(0, 1399, __pyx_L1_error)\n\n    /* \"pywrapfst.pyx\":1398\n *                 addr(sstrm), b\"_repr_svg\")\n *     (sout, serr) = proc.communicate(sstrm.str())\n *     if proc.returncode != 0:  # Just to be explicit.             # <<<<<<<<<<<<<<\n *       raise subprocess.CalledProcessError(proc.returncode, self._DOT_TSVG)\n *     return sout.decode(\"utf8\")\n */\n  }\n\n  /* \"pywrapfst.pyx\":1400\n *     if proc.returncode != 0:  # Just to be explicit.\n *       raise subprocess.CalledProcessError(proc.returncode, self._DOT_TSVG)\n *     return sout.decode(\"utf8\")             # <<<<<<<<<<<<<<\n * \n *   def __repr__(self):\n */\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_4 = __Pyx_PyObject_GetAttrStr(__pyx_v_sout, __pyx_n_s_decode); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 1400, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_4);\n  __pyx_t_1 = __Pyx_PyObject_Call(__pyx_t_4, __pyx_tuple__25, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1400, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":1374\n * \n *   # IPython notebook magic to produce an SVG of the FST.\n *   def _repr_svg_(self):             # <<<<<<<<<<<<<<\n *     \"\"\"IPython notebook magic to produce an SVG of the FST using GraphViz.\n * \n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_XDECREF(__pyx_t_12);\n  __Pyx_AddTraceback(\"pywrapfst._Fst._repr_svg_\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XDECREF(__pyx_v_proc);\n  __Pyx_XDECREF(__pyx_v_sout);\n  __Pyx_XDECREF(__pyx_v_serr);\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1402\n *     return sout.decode(\"utf8\")\n * \n *   def __repr__(self):             # <<<<<<<<<<<<<<\n *     return \"<{} Fst at 0x{:x}>\".format(self.fst_type(), id(self))\n * \n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_3__repr__(PyObject *__pyx_v_self); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_3__repr__(PyObject *__pyx_v_self) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__repr__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_4_Fst_2__repr__(((struct __pyx_obj_9pywrapfst__Fst *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_4_Fst_2__repr__(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  int __pyx_t_6;\n  PyObject *__pyx_t_7 = NULL;\n  __Pyx_RefNannySetupContext(\"__repr__\", 0);\n\n  /* \"pywrapfst.pyx\":1403\n * \n *   def __repr__(self):\n *     return \"<{} Fst at 0x{:x}>\".format(self.fst_type(), id(self))             # <<<<<<<<<<<<<<\n * \n *   def __init__(self):\n */\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_2 = __Pyx_PyObject_GetAttrStr(__pyx_kp_s_Fst_at_0x_x, __pyx_n_s_format); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1403, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"fst_type\");\n    __PYX_ERR(0, 1403, __pyx_L1_error)\n  }\n  __pyx_t_3 = __pyx_convert_PyBytes_string_to_py_std__in_string(((struct __pyx_vtabstruct_9pywrapfst__Fst *)__pyx_v_self->__pyx_vtab)->fst_type(__pyx_v_self, 0)); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 1403, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_3);\n  __pyx_t_4 = PyTuple_New(1); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 1403, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_4);\n  __Pyx_INCREF(((PyObject *)__pyx_v_self));\n  __Pyx_GIVEREF(((PyObject *)__pyx_v_self));\n  PyTuple_SET_ITEM(__pyx_t_4, 0, ((PyObject *)__pyx_v_self));\n  __pyx_t_5 = __Pyx_PyObject_Call(__pyx_builtin_id, __pyx_t_4, NULL); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 1403, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_5);\n  __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n  __pyx_t_4 = NULL;\n  __pyx_t_6 = 0;\n  if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_2))) {\n    __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_2);\n    if (likely(__pyx_t_4)) {\n      PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_2);\n      __Pyx_INCREF(__pyx_t_4);\n      __Pyx_INCREF(function);\n      __Pyx_DECREF_SET(__pyx_t_2, function);\n      __pyx_t_6 = 1;\n    }\n  }\n  #if CYTHON_FAST_PYCALL\n  if (PyFunction_Check(__pyx_t_2)) {\n    PyObject *__pyx_temp[3] = {__pyx_t_4, __pyx_t_3, __pyx_t_5};\n    __pyx_t_1 = __Pyx_PyFunction_FastCall(__pyx_t_2, __pyx_temp+1-__pyx_t_6, 2+__pyx_t_6); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1403, __pyx_L1_error)\n    __Pyx_XDECREF(__pyx_t_4); __pyx_t_4 = 0;\n    __Pyx_GOTREF(__pyx_t_1);\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n  } else\n  #endif\n  #if CYTHON_FAST_PYCCALL\n  if (__Pyx_PyFastCFunction_Check(__pyx_t_2)) {\n    PyObject *__pyx_temp[3] = {__pyx_t_4, __pyx_t_3, __pyx_t_5};\n    __pyx_t_1 = __Pyx_PyCFunction_FastCall(__pyx_t_2, __pyx_temp+1-__pyx_t_6, 2+__pyx_t_6); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1403, __pyx_L1_error)\n    __Pyx_XDECREF(__pyx_t_4); __pyx_t_4 = 0;\n    __Pyx_GOTREF(__pyx_t_1);\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n  } else\n  #endif\n  {\n    __pyx_t_7 = PyTuple_New(2+__pyx_t_6); if (unlikely(!__pyx_t_7)) __PYX_ERR(0, 1403, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_7);\n    if (__pyx_t_4) {\n      __Pyx_GIVEREF(__pyx_t_4); PyTuple_SET_ITEM(__pyx_t_7, 0, __pyx_t_4); __pyx_t_4 = NULL;\n    }\n    __Pyx_GIVEREF(__pyx_t_3);\n    PyTuple_SET_ITEM(__pyx_t_7, 0+__pyx_t_6, __pyx_t_3);\n    __Pyx_GIVEREF(__pyx_t_5);\n    PyTuple_SET_ITEM(__pyx_t_7, 1+__pyx_t_6, __pyx_t_5);\n    __pyx_t_3 = 0;\n    __pyx_t_5 = 0;\n    __pyx_t_1 = __Pyx_PyObject_Call(__pyx_t_2, __pyx_t_7, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1403, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0;\n  }\n  __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":1402\n *     return sout.decode(\"utf8\")\n * \n *   def __repr__(self):             # <<<<<<<<<<<<<<\n *     return \"<{} Fst at 0x{:x}>\".format(self.fst_type(), id(self))\n * \n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_XDECREF(__pyx_t_7);\n  __Pyx_AddTraceback(\"pywrapfst._Fst.__repr__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1405\n *     return \"<{} Fst at 0x{:x}>\".format(self.fst_type(), id(self))\n * \n *   def __init__(self):             # <<<<<<<<<<<<<<\n *     raise FstDeletedConstructorError(\n *         \"Cannot construct {}\".format(self.__class__.__name__))\n */\n\n/* Python wrapper */\nstatic int __pyx_pw_9pywrapfst_4_Fst_5__init__(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic int __pyx_pw_9pywrapfst_4_Fst_5__init__(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  int __pyx_r;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__init__ (wrapper)\", 0);\n  if (unlikely(PyTuple_GET_SIZE(__pyx_args) > 0)) {\n    __Pyx_RaiseArgtupleInvalid(\"__init__\", 1, 0, 0, PyTuple_GET_SIZE(__pyx_args)); return -1;}\n  if (unlikely(__pyx_kwds) && unlikely(PyDict_Size(__pyx_kwds) > 0) && unlikely(!__Pyx_CheckKeywordStrings(__pyx_kwds, \"__init__\", 0))) return -1;\n  __pyx_r = __pyx_pf_9pywrapfst_4_Fst_4__init__(((struct __pyx_obj_9pywrapfst__Fst *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic int __pyx_pf_9pywrapfst_4_Fst_4__init__(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self) {\n  int __pyx_r;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  PyObject *__pyx_t_6 = NULL;\n  PyObject *__pyx_t_7 = NULL;\n  __Pyx_RefNannySetupContext(\"__init__\", 0);\n\n  /* \"pywrapfst.pyx\":1406\n * \n *   def __init__(self):\n *     raise FstDeletedConstructorError(             # <<<<<<<<<<<<<<\n *         \"Cannot construct {}\".format(self.__class__.__name__))\n * \n */\n  __pyx_t_2 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstDeletedConstructorError); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1406, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n\n  /* \"pywrapfst.pyx\":1407\n *   def __init__(self):\n *     raise FstDeletedConstructorError(\n *         \"Cannot construct {}\".format(self.__class__.__name__))             # <<<<<<<<<<<<<<\n * \n *   def __str__(self):\n */\n  __pyx_t_4 = __Pyx_PyObject_GetAttrStr(__pyx_kp_s_Cannot_construct, __pyx_n_s_format); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 1407, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_4);\n  __pyx_t_5 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_class); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 1407, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_5);\n  __pyx_t_6 = __Pyx_PyObject_GetAttrStr(__pyx_t_5, __pyx_n_s_name); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 1407, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_6);\n  __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n  __pyx_t_5 = NULL;\n  if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_4))) {\n    __pyx_t_5 = PyMethod_GET_SELF(__pyx_t_4);\n    if (likely(__pyx_t_5)) {\n      PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_4);\n      __Pyx_INCREF(__pyx_t_5);\n      __Pyx_INCREF(function);\n      __Pyx_DECREF_SET(__pyx_t_4, function);\n    }\n  }\n  if (!__pyx_t_5) {\n    __pyx_t_3 = __Pyx_PyObject_CallOneArg(__pyx_t_4, __pyx_t_6); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 1407, __pyx_L1_error)\n    __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n    __Pyx_GOTREF(__pyx_t_3);\n  } else {\n    #if CYTHON_FAST_PYCALL\n    if (PyFunction_Check(__pyx_t_4)) {\n      PyObject *__pyx_temp[2] = {__pyx_t_5, __pyx_t_6};\n      __pyx_t_3 = __Pyx_PyFunction_FastCall(__pyx_t_4, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 1407, __pyx_L1_error)\n      __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;\n      __Pyx_GOTREF(__pyx_t_3);\n      __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n    } else\n    #endif\n    #if CYTHON_FAST_PYCCALL\n    if (__Pyx_PyFastCFunction_Check(__pyx_t_4)) {\n      PyObject *__pyx_temp[2] = {__pyx_t_5, __pyx_t_6};\n      __pyx_t_3 = __Pyx_PyCFunction_FastCall(__pyx_t_4, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 1407, __pyx_L1_error)\n      __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;\n      __Pyx_GOTREF(__pyx_t_3);\n      __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n    } else\n    #endif\n    {\n      __pyx_t_7 = PyTuple_New(1+1); if (unlikely(!__pyx_t_7)) __PYX_ERR(0, 1407, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_7);\n      __Pyx_GIVEREF(__pyx_t_5); PyTuple_SET_ITEM(__pyx_t_7, 0, __pyx_t_5); __pyx_t_5 = NULL;\n      __Pyx_GIVEREF(__pyx_t_6);\n      PyTuple_SET_ITEM(__pyx_t_7, 0+1, __pyx_t_6);\n      __pyx_t_6 = 0;\n      __pyx_t_3 = __Pyx_PyObject_Call(__pyx_t_4, __pyx_t_7, NULL); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 1407, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_3);\n      __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0;\n    }\n  }\n  __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n  __pyx_t_4 = NULL;\n  if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_2))) {\n    __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_2);\n    if (likely(__pyx_t_4)) {\n      PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_2);\n      __Pyx_INCREF(__pyx_t_4);\n      __Pyx_INCREF(function);\n      __Pyx_DECREF_SET(__pyx_t_2, function);\n    }\n  }\n  if (!__pyx_t_4) {\n    __pyx_t_1 = __Pyx_PyObject_CallOneArg(__pyx_t_2, __pyx_t_3); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1406, __pyx_L1_error)\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    __Pyx_GOTREF(__pyx_t_1);\n  } else {\n    #if CYTHON_FAST_PYCALL\n    if (PyFunction_Check(__pyx_t_2)) {\n      PyObject *__pyx_temp[2] = {__pyx_t_4, __pyx_t_3};\n      __pyx_t_1 = __Pyx_PyFunction_FastCall(__pyx_t_2, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1406, __pyx_L1_error)\n      __Pyx_XDECREF(__pyx_t_4); __pyx_t_4 = 0;\n      __Pyx_GOTREF(__pyx_t_1);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    } else\n    #endif\n    #if CYTHON_FAST_PYCCALL\n    if (__Pyx_PyFastCFunction_Check(__pyx_t_2)) {\n      PyObject *__pyx_temp[2] = {__pyx_t_4, __pyx_t_3};\n      __pyx_t_1 = __Pyx_PyCFunction_FastCall(__pyx_t_2, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1406, __pyx_L1_error)\n      __Pyx_XDECREF(__pyx_t_4); __pyx_t_4 = 0;\n      __Pyx_GOTREF(__pyx_t_1);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    } else\n    #endif\n    {\n      __pyx_t_7 = PyTuple_New(1+1); if (unlikely(!__pyx_t_7)) __PYX_ERR(0, 1406, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_7);\n      __Pyx_GIVEREF(__pyx_t_4); PyTuple_SET_ITEM(__pyx_t_7, 0, __pyx_t_4); __pyx_t_4 = NULL;\n      __Pyx_GIVEREF(__pyx_t_3);\n      PyTuple_SET_ITEM(__pyx_t_7, 0+1, __pyx_t_3);\n      __pyx_t_3 = 0;\n      __pyx_t_1 = __Pyx_PyObject_Call(__pyx_t_2, __pyx_t_7, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1406, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_1);\n      __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0;\n    }\n  }\n  __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n  __Pyx_Raise(__pyx_t_1, 0, 0, 0);\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  __PYX_ERR(0, 1406, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":1405\n *     return \"<{} Fst at 0x{:x}>\".format(self.fst_type(), id(self))\n * \n *   def __init__(self):             # <<<<<<<<<<<<<<\n *     raise FstDeletedConstructorError(\n *         \"Cannot construct {}\".format(self.__class__.__name__))\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_XDECREF(__pyx_t_6);\n  __Pyx_XDECREF(__pyx_t_7);\n  __Pyx_AddTraceback(\"pywrapfst._Fst.__init__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = -1;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1409\n *         \"Cannot construct {}\".format(self.__class__.__name__))\n * \n *   def __str__(self):             # <<<<<<<<<<<<<<\n *     return self.text()\n * \n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_7__str__(PyObject *__pyx_v_self); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_7__str__(PyObject *__pyx_v_self) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__str__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_4_Fst_6__str__(((struct __pyx_obj_9pywrapfst__Fst *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_4_Fst_6__str__(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"__str__\", 0);\n\n  /* \"pywrapfst.pyx\":1410\n * \n *   def __str__(self):\n *     return self.text()             # <<<<<<<<<<<<<<\n * \n *   # Registers the class for pickling; must be repeated in any subclass which\n */\n  __Pyx_XDECREF(__pyx_r);\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"text\");\n    __PYX_ERR(0, 1410, __pyx_L1_error)\n  }\n  __pyx_t_1 = __pyx_convert_PyBytes_string_to_py_std__in_string(((struct __pyx_vtabstruct_9pywrapfst__Fst *)__pyx_v_self->__pyx_vtab)->text(__pyx_v_self, 0, NULL)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1410, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":1409\n *         \"Cannot construct {}\".format(self.__class__.__name__))\n * \n *   def __str__(self):             # <<<<<<<<<<<<<<\n *     return self.text()\n * \n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst._Fst.__str__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1415\n *   # can't be derived by _init_XFst.\n * \n *   def __reduce__(self):             # <<<<<<<<<<<<<<\n *     return (_read_from_string, (self.write_to_string(),))\n * \n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_9__reduce__(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_9__reduce__(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__reduce__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_4_Fst_8__reduce__(((struct __pyx_obj_9pywrapfst__Fst *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_4_Fst_8__reduce__(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  __Pyx_RefNannySetupContext(\"__reduce__\", 0);\n\n  /* \"pywrapfst.pyx\":1416\n * \n *   def __reduce__(self):\n *     return (_read_from_string, (self.write_to_string(),))             # <<<<<<<<<<<<<<\n * \n *   cpdef string arc_type(self):\n */\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __Pyx_GetModuleGlobalName(__pyx_n_s_read_from_string); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1416, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"write_to_string\");\n    __PYX_ERR(0, 1416, __pyx_L1_error)\n  }\n  __pyx_t_2 = __pyx_convert_PyBytes_string_to_py_std__in_string(((struct __pyx_vtabstruct_9pywrapfst__Fst *)__pyx_v_self->__pyx_vtab)->write_to_string(__pyx_v_self, 0)); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1416, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  __pyx_t_3 = PyTuple_New(1); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 1416, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_3);\n  __Pyx_GIVEREF(__pyx_t_2);\n  PyTuple_SET_ITEM(__pyx_t_3, 0, __pyx_t_2);\n  __pyx_t_2 = 0;\n  __pyx_t_2 = PyTuple_New(2); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1416, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  __Pyx_GIVEREF(__pyx_t_1);\n  PyTuple_SET_ITEM(__pyx_t_2, 0, __pyx_t_1);\n  __Pyx_GIVEREF(__pyx_t_3);\n  PyTuple_SET_ITEM(__pyx_t_2, 1, __pyx_t_3);\n  __pyx_t_1 = 0;\n  __pyx_t_3 = 0;\n  __pyx_r = __pyx_t_2;\n  __pyx_t_2 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":1415\n *   # can't be derived by _init_XFst.\n * \n *   def __reduce__(self):             # <<<<<<<<<<<<<<\n *     return (_read_from_string, (self.write_to_string(),))\n * \n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_AddTraceback(\"pywrapfst._Fst.__reduce__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1418\n *     return (_read_from_string, (self.write_to_string(),))\n * \n *   cpdef string arc_type(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     arc_type(self)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_11arc_type(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic std::string __pyx_f_9pywrapfst_4_Fst_arc_type(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self, int __pyx_skip_dispatch) {\n  std::string __pyx_r;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  std::string __pyx_t_5;\n  __Pyx_RefNannySetupContext(\"arc_type\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_arc_type); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1418, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_4_Fst_11arc_type)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1418, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1418, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __pyx_t_5 = __pyx_convert_string_from_py_std__in_string(__pyx_t_2); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 1418, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __pyx_r = __pyx_t_5;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":1424\n *     Returns a string indicating the arc type.\n *     \"\"\"\n *     return self._fst.get().ArcType()             # <<<<<<<<<<<<<<\n * \n *   cpdef ArcIterator arcs(self, int64 state):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 1424, __pyx_L1_error)\n  }\n  __pyx_r = __pyx_v_self->_fst.get()->ArcType();\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":1418\n *     return (_read_from_string, (self.write_to_string(),))\n * \n *   cpdef string arc_type(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     arc_type(self)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_WriteUnraisable(\"pywrapfst._Fst.arc_type\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __Pyx_pretend_to_initialize(&__pyx_r);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_11arc_type(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_4_Fst_10arc_type[] = \"\\n    arc_type(self)\\n\\n    Returns a string indicating the arc type.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_11arc_type(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"arc_type (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_4_Fst_10arc_type(((struct __pyx_obj_9pywrapfst__Fst *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_4_Fst_10arc_type(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"arc_type\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __pyx_convert_PyBytes_string_to_py_std__in_string(__pyx_f_9pywrapfst_4_Fst_arc_type(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1418, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst._Fst.arc_type\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1426\n *     return self._fst.get().ArcType()\n * \n *   cpdef ArcIterator arcs(self, int64 state):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     arcs(self, state)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_13arcs(PyObject *__pyx_v_self, PyObject *__pyx_arg_state); /*proto*/\nstatic struct __pyx_obj_9pywrapfst_ArcIterator *__pyx_f_9pywrapfst_4_Fst_arcs(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self, __pyx_t_10basictypes_int64 __pyx_v_state, int __pyx_skip_dispatch) {\n  struct __pyx_obj_9pywrapfst_ArcIterator *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  PyObject *__pyx_t_6 = NULL;\n  __Pyx_RefNannySetupContext(\"arcs\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_arcs); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1426, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_4_Fst_13arcs)) {\n      __Pyx_XDECREF(((PyObject *)__pyx_r));\n      __pyx_t_3 = __Pyx_PyInt_From_int64_t(__pyx_v_state); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 1426, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_3);\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_4 = __pyx_t_1; __pyx_t_5 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_4))) {\n        __pyx_t_5 = PyMethod_GET_SELF(__pyx_t_4);\n        if (likely(__pyx_t_5)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_4);\n          __Pyx_INCREF(__pyx_t_5);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_4, function);\n        }\n      }\n      if (!__pyx_t_5) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_4, __pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1426, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n        __Pyx_GOTREF(__pyx_t_2);\n      } else {\n        #if CYTHON_FAST_PYCALL\n        if (PyFunction_Check(__pyx_t_4)) {\n          PyObject *__pyx_temp[2] = {__pyx_t_5, __pyx_t_3};\n          __pyx_t_2 = __Pyx_PyFunction_FastCall(__pyx_t_4, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1426, __pyx_L1_error)\n          __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;\n          __Pyx_GOTREF(__pyx_t_2);\n          __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n        } else\n        #endif\n        #if CYTHON_FAST_PYCCALL\n        if (__Pyx_PyFastCFunction_Check(__pyx_t_4)) {\n          PyObject *__pyx_temp[2] = {__pyx_t_5, __pyx_t_3};\n          __pyx_t_2 = __Pyx_PyCFunction_FastCall(__pyx_t_4, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1426, __pyx_L1_error)\n          __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;\n          __Pyx_GOTREF(__pyx_t_2);\n          __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n        } else\n        #endif\n        {\n          __pyx_t_6 = PyTuple_New(1+1); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 1426, __pyx_L1_error)\n          __Pyx_GOTREF(__pyx_t_6);\n          __Pyx_GIVEREF(__pyx_t_5); PyTuple_SET_ITEM(__pyx_t_6, 0, __pyx_t_5); __pyx_t_5 = NULL;\n          __Pyx_GIVEREF(__pyx_t_3);\n          PyTuple_SET_ITEM(__pyx_t_6, 0+1, __pyx_t_3);\n          __pyx_t_3 = 0;\n          __pyx_t_2 = __Pyx_PyObject_Call(__pyx_t_4, __pyx_t_6, NULL); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1426, __pyx_L1_error)\n          __Pyx_GOTREF(__pyx_t_2);\n          __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n        }\n      }\n      __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      if (!(likely(((__pyx_t_2) == Py_None) || likely(__Pyx_TypeTest(__pyx_t_2, __pyx_ptype_9pywrapfst_ArcIterator))))) __PYX_ERR(0, 1426, __pyx_L1_error)\n      __pyx_r = ((struct __pyx_obj_9pywrapfst_ArcIterator *)__pyx_t_2);\n      __pyx_t_2 = 0;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":1440\n *     See also: `mutable_arcs`, `states`.\n *     \"\"\"\n *     return ArcIterator(self, state)             # <<<<<<<<<<<<<<\n * \n *   cpdef _Fst copy(self):\n */\n  __Pyx_XDECREF(((PyObject *)__pyx_r));\n  __pyx_t_1 = __Pyx_PyInt_From_int64_t(__pyx_v_state); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1440, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_t_2 = PyTuple_New(2); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1440, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  __Pyx_INCREF(((PyObject *)__pyx_v_self));\n  __Pyx_GIVEREF(((PyObject *)__pyx_v_self));\n  PyTuple_SET_ITEM(__pyx_t_2, 0, ((PyObject *)__pyx_v_self));\n  __Pyx_GIVEREF(__pyx_t_1);\n  PyTuple_SET_ITEM(__pyx_t_2, 1, __pyx_t_1);\n  __pyx_t_1 = 0;\n  __pyx_t_1 = __Pyx_PyObject_Call(((PyObject *)__pyx_ptype_9pywrapfst_ArcIterator), __pyx_t_2, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1440, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n  __pyx_r = ((struct __pyx_obj_9pywrapfst_ArcIterator *)__pyx_t_1);\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":1426\n *     return self._fst.get().ArcType()\n * \n *   cpdef ArcIterator arcs(self, int64 state):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     arcs(self, state)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_XDECREF(__pyx_t_6);\n  __Pyx_AddTraceback(\"pywrapfst._Fst.arcs\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XGIVEREF((PyObject *)__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_13arcs(PyObject *__pyx_v_self, PyObject *__pyx_arg_state); /*proto*/\nstatic char __pyx_doc_9pywrapfst_4_Fst_12arcs[] = \"\\n    arcs(self, state)\\n\\n    Returns an iterator over arcs leaving the specified state.\\n\\n    Args:\\n      state: The source state ID.\\n\\n    Returns:\\n      An ArcIterator.\\n\\n    See also: `mutable_arcs`, `states`.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_13arcs(PyObject *__pyx_v_self, PyObject *__pyx_arg_state) {\n  __pyx_t_10basictypes_int64 __pyx_v_state;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"arcs (wrapper)\", 0);\n  assert(__pyx_arg_state); {\n    __pyx_v_state = __Pyx_PyInt_As_int64_t(__pyx_arg_state); if (unlikely((__pyx_v_state == ((int64_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 1426, __pyx_L3_error)\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst._Fst.arcs\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  __pyx_r = __pyx_pf_9pywrapfst_4_Fst_12arcs(((struct __pyx_obj_9pywrapfst__Fst *)__pyx_v_self), ((__pyx_t_10basictypes_int64)__pyx_v_state));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_4_Fst_12arcs(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self, __pyx_t_10basictypes_int64 __pyx_v_state) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"arcs\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst_4_Fst_arcs(__pyx_v_self, __pyx_v_state, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1426, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst._Fst.arcs\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1442\n *     return ArcIterator(self, state)\n * \n *   cpdef _Fst copy(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     copy(self)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_15copy(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic struct __pyx_obj_9pywrapfst__Fst *__pyx_f_9pywrapfst_4_Fst_copy(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self, int __pyx_skip_dispatch) {\n  struct __pyx_obj_9pywrapfst__Fst *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  __Pyx_RefNannySetupContext(\"copy\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_copy); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1442, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_4_Fst_15copy)) {\n      __Pyx_XDECREF(((PyObject *)__pyx_r));\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1442, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1442, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      if (!(likely(((__pyx_t_2) == Py_None) || likely(__Pyx_TypeTest(__pyx_t_2, __pyx_ptype_9pywrapfst__Fst))))) __PYX_ERR(0, 1442, __pyx_L1_error)\n      __pyx_r = ((struct __pyx_obj_9pywrapfst__Fst *)__pyx_t_2);\n      __pyx_t_2 = 0;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":1448\n *     Makes a copy of the FST.\n *     \"\"\"\n *     return _init_XFst(new fst.FstClass(deref(self._fst)))             # <<<<<<<<<<<<<<\n * \n *   cpdef void draw(self,\n */\n  __Pyx_XDECREF(((PyObject *)__pyx_r));\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 1448, __pyx_L1_error)\n  }\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst__init_XFst(new fst::script::FstClass((*__pyx_v_self->_fst)))); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1448, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = ((struct __pyx_obj_9pywrapfst__Fst *)__pyx_t_1);\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":1442\n *     return ArcIterator(self, state)\n * \n *   cpdef _Fst copy(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     copy(self)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_AddTraceback(\"pywrapfst._Fst.copy\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XGIVEREF((PyObject *)__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_15copy(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_4_Fst_14copy[] = \"\\n    copy(self)\\n\\n    Makes a copy of the FST.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_15copy(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"copy (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_4_Fst_14copy(((struct __pyx_obj_9pywrapfst__Fst *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_4_Fst_14copy(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"copy\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst_4_Fst_copy(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1442, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst._Fst.copy\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1450\n *     return _init_XFst(new fst.FstClass(deref(self._fst)))\n * \n *   cpdef void draw(self,             # <<<<<<<<<<<<<<\n *                   filename,\n *                   _SymbolTable isymbols=None,\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_17draw(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic void __pyx_f_9pywrapfst_4_Fst_draw(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self, PyObject *__pyx_v_filename, int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_4_Fst_draw *__pyx_optional_args) {\n\n  /* \"pywrapfst.pyx\":1452\n *   cpdef void draw(self,\n *                   filename,\n *                   _SymbolTable isymbols=None,             # <<<<<<<<<<<<<<\n *                   _SymbolTable osymbols=None,\n *                   SymbolTable ssymbols=None,\n */\n  struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_isymbols = ((struct __pyx_obj_9pywrapfst__SymbolTable *)Py_None);\n\n  /* \"pywrapfst.pyx\":1453\n *                   filename,\n *                   _SymbolTable isymbols=None,\n *                   _SymbolTable osymbols=None,             # <<<<<<<<<<<<<<\n *                   SymbolTable ssymbols=None,\n *                   bool acceptor=False,\n */\n  struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_osymbols = ((struct __pyx_obj_9pywrapfst__SymbolTable *)Py_None);\n\n  /* \"pywrapfst.pyx\":1454\n *                   _SymbolTable isymbols=None,\n *                   _SymbolTable osymbols=None,\n *                   SymbolTable ssymbols=None,             # <<<<<<<<<<<<<<\n *                   bool acceptor=False,\n *                   title=b\"\",\n */\n  struct __pyx_obj_9pywrapfst_SymbolTable *__pyx_v_ssymbols = ((struct __pyx_obj_9pywrapfst_SymbolTable *)Py_None);\n\n  /* \"pywrapfst.pyx\":1455\n *                   _SymbolTable osymbols=None,\n *                   SymbolTable ssymbols=None,\n *                   bool acceptor=False,             # <<<<<<<<<<<<<<\n *                   title=b\"\",\n *                   double width=8.5,\n */\n  bool __pyx_v_acceptor = ((bool)0);\n  PyObject *__pyx_v_title = ((PyObject *)__pyx_kp_b__24);\n  double __pyx_v_width = ((double)8.5);\n  double __pyx_v_height = ((double)11.0);\n\n  /* \"pywrapfst.pyx\":1459\n *                   double width=8.5,\n *                   double height=11,\n *                   bool portrait=False,             # <<<<<<<<<<<<<<\n *                   bool vertical=False,\n *                   double ranksep=0.4,\n */\n  bool __pyx_v_portrait = ((bool)0);\n\n  /* \"pywrapfst.pyx\":1460\n *                   double height=11,\n *                   bool portrait=False,\n *                   bool vertical=False,             # <<<<<<<<<<<<<<\n *                   double ranksep=0.4,\n *                   double nodesep=0.25,\n */\n  bool __pyx_v_vertical = ((bool)0);\n  double __pyx_v_ranksep = ((double)0.4);\n  double __pyx_v_nodesep = ((double)0.25);\n  __pyx_t_10basictypes_int32 __pyx_v_fontsize = ((__pyx_t_10basictypes_int32)14);\n  __pyx_t_10basictypes_int32 __pyx_v_precision = ((__pyx_t_10basictypes_int32)5);\n  PyObject *__pyx_v_float_format = ((PyObject *)__pyx_n_b_g);\n\n  /* \"pywrapfst.pyx\":1466\n *                   int32 precision=5,\n *                   float_format=b\"g\",\n *                   bool show_weight_one=False):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     draw(self, filename, isymbols=None, osymbols=None, ssymbols=None,\n */\n  bool __pyx_v_show_weight_one = ((bool)0);\n  std::string __pyx_v_filename_string;\n  std::unique_ptr<std::ofstream>  __pyx_v_ostrm;\n  fst::SymbolTable *__pyx_v_ssymbols_ptr;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  PyObject *__pyx_t_6 = NULL;\n  PyObject *__pyx_t_7 = NULL;\n  PyObject *__pyx_t_8 = NULL;\n  PyObject *__pyx_t_9 = NULL;\n  PyObject *__pyx_t_10 = NULL;\n  PyObject *__pyx_t_11 = NULL;\n  PyObject *__pyx_t_12 = NULL;\n  PyObject *__pyx_t_13 = NULL;\n  PyObject *__pyx_t_14 = NULL;\n  int __pyx_t_15;\n  PyObject *__pyx_t_16 = NULL;\n  std::string __pyx_t_17;\n  int __pyx_t_18;\n  int __pyx_t_19;\n  fst::SymbolTable *__pyx_t_20;\n  fst::SymbolTable const *__pyx_t_21;\n  fst::SymbolTable const *__pyx_t_22;\n  std::string __pyx_t_23;\n  __Pyx_RefNannySetupContext(\"draw\", 0);\n  if (__pyx_optional_args) {\n    if (__pyx_optional_args->__pyx_n > 0) {\n      __pyx_v_isymbols = __pyx_optional_args->isymbols;\n      if (__pyx_optional_args->__pyx_n > 1) {\n        __pyx_v_osymbols = __pyx_optional_args->osymbols;\n        if (__pyx_optional_args->__pyx_n > 2) {\n          __pyx_v_ssymbols = __pyx_optional_args->ssymbols;\n          if (__pyx_optional_args->__pyx_n > 3) {\n            __pyx_v_acceptor = __pyx_optional_args->acceptor;\n            if (__pyx_optional_args->__pyx_n > 4) {\n              __pyx_v_title = __pyx_optional_args->title;\n              if (__pyx_optional_args->__pyx_n > 5) {\n                __pyx_v_width = __pyx_optional_args->width;\n                if (__pyx_optional_args->__pyx_n > 6) {\n                  __pyx_v_height = __pyx_optional_args->height;\n                  if (__pyx_optional_args->__pyx_n > 7) {\n                    __pyx_v_portrait = __pyx_optional_args->portrait;\n                    if (__pyx_optional_args->__pyx_n > 8) {\n                      __pyx_v_vertical = __pyx_optional_args->vertical;\n                      if (__pyx_optional_args->__pyx_n > 9) {\n                        __pyx_v_ranksep = __pyx_optional_args->ranksep;\n                        if (__pyx_optional_args->__pyx_n > 10) {\n                          __pyx_v_nodesep = __pyx_optional_args->nodesep;\n                          if (__pyx_optional_args->__pyx_n > 11) {\n                            __pyx_v_fontsize = __pyx_optional_args->fontsize;\n                            if (__pyx_optional_args->__pyx_n > 12) {\n                              __pyx_v_precision = __pyx_optional_args->precision;\n                              if (__pyx_optional_args->__pyx_n > 13) {\n                                __pyx_v_float_format = __pyx_optional_args->float_format;\n                                if (__pyx_optional_args->__pyx_n > 14) {\n                                  __pyx_v_show_weight_one = __pyx_optional_args->show_weight_one;\n                                }\n                              }\n                            }\n                          }\n                        }\n                      }\n                    }\n                  }\n                }\n              }\n            }\n          }\n        }\n      }\n    }\n  }\n\n  /* \"pywrapfst.pyx\":1450\n *     return _init_XFst(new fst.FstClass(deref(self._fst)))\n * \n *   cpdef void draw(self,             # <<<<<<<<<<<<<<\n *                   filename,\n *                   _SymbolTable isymbols=None,\n */\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_draw); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1450, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_4_Fst_17draw)) {\n      __pyx_t_3 = __Pyx_PyBool_FromLong(__pyx_v_acceptor); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 1450, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_3);\n      __pyx_t_4 = PyFloat_FromDouble(__pyx_v_width); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 1450, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_4);\n      __pyx_t_5 = PyFloat_FromDouble(__pyx_v_height); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 1450, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_5);\n      __pyx_t_6 = __Pyx_PyBool_FromLong(__pyx_v_portrait); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 1450, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_6);\n      __pyx_t_7 = __Pyx_PyBool_FromLong(__pyx_v_vertical); if (unlikely(!__pyx_t_7)) __PYX_ERR(0, 1450, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_7);\n      __pyx_t_8 = PyFloat_FromDouble(__pyx_v_ranksep); if (unlikely(!__pyx_t_8)) __PYX_ERR(0, 1450, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_8);\n      __pyx_t_9 = PyFloat_FromDouble(__pyx_v_nodesep); if (unlikely(!__pyx_t_9)) __PYX_ERR(0, 1450, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_9);\n      __pyx_t_10 = __Pyx_PyInt_From_int32_t(__pyx_v_fontsize); if (unlikely(!__pyx_t_10)) __PYX_ERR(0, 1450, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_10);\n      __pyx_t_11 = __Pyx_PyInt_From_int32_t(__pyx_v_precision); if (unlikely(!__pyx_t_11)) __PYX_ERR(0, 1450, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_11);\n      __pyx_t_12 = __Pyx_PyBool_FromLong(__pyx_v_show_weight_one); if (unlikely(!__pyx_t_12)) __PYX_ERR(0, 1450, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_12);\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_13 = __pyx_t_1; __pyx_t_14 = NULL;\n      __pyx_t_15 = 0;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_13))) {\n        __pyx_t_14 = PyMethod_GET_SELF(__pyx_t_13);\n        if (likely(__pyx_t_14)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_13);\n          __Pyx_INCREF(__pyx_t_14);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_13, function);\n          __pyx_t_15 = 1;\n        }\n      }\n      #if CYTHON_FAST_PYCALL\n      if (PyFunction_Check(__pyx_t_13)) {\n        PyObject *__pyx_temp[17] = {__pyx_t_14, __pyx_v_filename, ((PyObject *)__pyx_v_isymbols), ((PyObject *)__pyx_v_osymbols), ((PyObject *)__pyx_v_ssymbols), __pyx_t_3, __pyx_v_title, __pyx_t_4, __pyx_t_5, __pyx_t_6, __pyx_t_7, __pyx_t_8, __pyx_t_9, __pyx_t_10, __pyx_t_11, __pyx_v_float_format, __pyx_t_12};\n        __pyx_t_2 = __Pyx_PyFunction_FastCall(__pyx_t_13, __pyx_temp+1-__pyx_t_15, 16+__pyx_t_15); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1450, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_14); __pyx_t_14 = 0;\n        __Pyx_GOTREF(__pyx_t_2);\n        __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n        __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n        __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n        __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0;\n        __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0;\n        __Pyx_DECREF(__pyx_t_9); __pyx_t_9 = 0;\n        __Pyx_DECREF(__pyx_t_10); __pyx_t_10 = 0;\n        __Pyx_DECREF(__pyx_t_11); __pyx_t_11 = 0;\n        __Pyx_DECREF(__pyx_t_12); __pyx_t_12 = 0;\n      } else\n      #endif\n      #if CYTHON_FAST_PYCCALL\n      if (__Pyx_PyFastCFunction_Check(__pyx_t_13)) {\n        PyObject *__pyx_temp[17] = {__pyx_t_14, __pyx_v_filename, ((PyObject *)__pyx_v_isymbols), ((PyObject *)__pyx_v_osymbols), ((PyObject *)__pyx_v_ssymbols), __pyx_t_3, __pyx_v_title, __pyx_t_4, __pyx_t_5, __pyx_t_6, __pyx_t_7, __pyx_t_8, __pyx_t_9, __pyx_t_10, __pyx_t_11, __pyx_v_float_format, __pyx_t_12};\n        __pyx_t_2 = __Pyx_PyCFunction_FastCall(__pyx_t_13, __pyx_temp+1-__pyx_t_15, 16+__pyx_t_15); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1450, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_14); __pyx_t_14 = 0;\n        __Pyx_GOTREF(__pyx_t_2);\n        __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n        __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n        __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n        __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0;\n        __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0;\n        __Pyx_DECREF(__pyx_t_9); __pyx_t_9 = 0;\n        __Pyx_DECREF(__pyx_t_10); __pyx_t_10 = 0;\n        __Pyx_DECREF(__pyx_t_11); __pyx_t_11 = 0;\n        __Pyx_DECREF(__pyx_t_12); __pyx_t_12 = 0;\n      } else\n      #endif\n      {\n        __pyx_t_16 = PyTuple_New(16+__pyx_t_15); if (unlikely(!__pyx_t_16)) __PYX_ERR(0, 1450, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_16);\n        if (__pyx_t_14) {\n          __Pyx_GIVEREF(__pyx_t_14); PyTuple_SET_ITEM(__pyx_t_16, 0, __pyx_t_14); __pyx_t_14 = NULL;\n        }\n        __Pyx_INCREF(__pyx_v_filename);\n        __Pyx_GIVEREF(__pyx_v_filename);\n        PyTuple_SET_ITEM(__pyx_t_16, 0+__pyx_t_15, __pyx_v_filename);\n        __Pyx_INCREF(((PyObject *)__pyx_v_isymbols));\n        __Pyx_GIVEREF(((PyObject *)__pyx_v_isymbols));\n        PyTuple_SET_ITEM(__pyx_t_16, 1+__pyx_t_15, ((PyObject *)__pyx_v_isymbols));\n        __Pyx_INCREF(((PyObject *)__pyx_v_osymbols));\n        __Pyx_GIVEREF(((PyObject *)__pyx_v_osymbols));\n        PyTuple_SET_ITEM(__pyx_t_16, 2+__pyx_t_15, ((PyObject *)__pyx_v_osymbols));\n        __Pyx_INCREF(((PyObject *)__pyx_v_ssymbols));\n        __Pyx_GIVEREF(((PyObject *)__pyx_v_ssymbols));\n        PyTuple_SET_ITEM(__pyx_t_16, 3+__pyx_t_15, ((PyObject *)__pyx_v_ssymbols));\n        __Pyx_GIVEREF(__pyx_t_3);\n        PyTuple_SET_ITEM(__pyx_t_16, 4+__pyx_t_15, __pyx_t_3);\n        __Pyx_INCREF(__pyx_v_title);\n        __Pyx_GIVEREF(__pyx_v_title);\n        PyTuple_SET_ITEM(__pyx_t_16, 5+__pyx_t_15, __pyx_v_title);\n        __Pyx_GIVEREF(__pyx_t_4);\n        PyTuple_SET_ITEM(__pyx_t_16, 6+__pyx_t_15, __pyx_t_4);\n        __Pyx_GIVEREF(__pyx_t_5);\n        PyTuple_SET_ITEM(__pyx_t_16, 7+__pyx_t_15, __pyx_t_5);\n        __Pyx_GIVEREF(__pyx_t_6);\n        PyTuple_SET_ITEM(__pyx_t_16, 8+__pyx_t_15, __pyx_t_6);\n        __Pyx_GIVEREF(__pyx_t_7);\n        PyTuple_SET_ITEM(__pyx_t_16, 9+__pyx_t_15, __pyx_t_7);\n        __Pyx_GIVEREF(__pyx_t_8);\n        PyTuple_SET_ITEM(__pyx_t_16, 10+__pyx_t_15, __pyx_t_8);\n        __Pyx_GIVEREF(__pyx_t_9);\n        PyTuple_SET_ITEM(__pyx_t_16, 11+__pyx_t_15, __pyx_t_9);\n        __Pyx_GIVEREF(__pyx_t_10);\n        PyTuple_SET_ITEM(__pyx_t_16, 12+__pyx_t_15, __pyx_t_10);\n        __Pyx_GIVEREF(__pyx_t_11);\n        PyTuple_SET_ITEM(__pyx_t_16, 13+__pyx_t_15, __pyx_t_11);\n        __Pyx_INCREF(__pyx_v_float_format);\n        __Pyx_GIVEREF(__pyx_v_float_format);\n        PyTuple_SET_ITEM(__pyx_t_16, 14+__pyx_t_15, __pyx_v_float_format);\n        __Pyx_GIVEREF(__pyx_t_12);\n        PyTuple_SET_ITEM(__pyx_t_16, 15+__pyx_t_15, __pyx_t_12);\n        __pyx_t_3 = 0;\n        __pyx_t_4 = 0;\n        __pyx_t_5 = 0;\n        __pyx_t_6 = 0;\n        __pyx_t_7 = 0;\n        __pyx_t_8 = 0;\n        __pyx_t_9 = 0;\n        __pyx_t_10 = 0;\n        __pyx_t_11 = 0;\n        __pyx_t_12 = 0;\n        __pyx_t_2 = __Pyx_PyObject_Call(__pyx_t_13, __pyx_t_16, NULL); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1450, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_2);\n        __Pyx_DECREF(__pyx_t_16); __pyx_t_16 = 0;\n      }\n      __Pyx_DECREF(__pyx_t_13); __pyx_t_13 = 0;\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":1500\n *     See also: `text`.\n *     \"\"\"\n *     cdef string filename_string = tostring(filename)             # <<<<<<<<<<<<<<\n *     cdef unique_ptr[ofstream] ostrm\n *     ostrm.reset(new ofstream(filename_string))\n */\n  __pyx_t_17 = __pyx_f_9pywrapfst_tostring(__pyx_v_filename, NULL); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 1500, __pyx_L1_error)\n  __pyx_v_filename_string = __pyx_t_17;\n\n  /* \"pywrapfst.pyx\":1502\n *     cdef string filename_string = tostring(filename)\n *     cdef unique_ptr[ofstream] ostrm\n *     ostrm.reset(new ofstream(filename_string))             # <<<<<<<<<<<<<<\n *     cdef fst.SymbolTable *ssymbols_ptr = NULL\n *     if ssymbols is not None:\n */\n  __pyx_v_ostrm.reset(new std::ofstream(__pyx_v_filename_string));\n\n  /* \"pywrapfst.pyx\":1503\n *     cdef unique_ptr[ofstream] ostrm\n *     ostrm.reset(new ofstream(filename_string))\n *     cdef fst.SymbolTable *ssymbols_ptr = NULL             # <<<<<<<<<<<<<<\n *     if ssymbols is not None:\n *       ssymbols_ptr = ssymbols._table\n */\n  __pyx_v_ssymbols_ptr = NULL;\n\n  /* \"pywrapfst.pyx\":1504\n *     ostrm.reset(new ofstream(filename_string))\n *     cdef fst.SymbolTable *ssymbols_ptr = NULL\n *     if ssymbols is not None:             # <<<<<<<<<<<<<<\n *       ssymbols_ptr = ssymbols._table\n *     fst.DrawFst(deref(self._fst),\n */\n  __pyx_t_18 = (((PyObject *)__pyx_v_ssymbols) != Py_None);\n  __pyx_t_19 = (__pyx_t_18 != 0);\n  if (__pyx_t_19) {\n\n    /* \"pywrapfst.pyx\":1505\n *     cdef fst.SymbolTable *ssymbols_ptr = NULL\n *     if ssymbols is not None:\n *       ssymbols_ptr = ssymbols._table             # <<<<<<<<<<<<<<\n *     fst.DrawFst(deref(self._fst),\n *         self._fst.get().InputSymbols() if isymbols is None\n */\n    if (unlikely(((PyObject *)__pyx_v_ssymbols) == Py_None)) {\n      PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_table\");\n      __PYX_ERR(0, 1505, __pyx_L1_error)\n    }\n    __pyx_t_20 = __pyx_v_ssymbols->__pyx_base.__pyx_base._table;\n    __pyx_v_ssymbols_ptr = __pyx_t_20;\n\n    /* \"pywrapfst.pyx\":1504\n *     ostrm.reset(new ofstream(filename_string))\n *     cdef fst.SymbolTable *ssymbols_ptr = NULL\n *     if ssymbols is not None:             # <<<<<<<<<<<<<<\n *       ssymbols_ptr = ssymbols._table\n *     fst.DrawFst(deref(self._fst),\n */\n  }\n\n  /* \"pywrapfst.pyx\":1506\n *     if ssymbols is not None:\n *       ssymbols_ptr = ssymbols._table\n *     fst.DrawFst(deref(self._fst),             # <<<<<<<<<<<<<<\n *         self._fst.get().InputSymbols() if isymbols is None\n *         else isymbols._table,\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 1506, __pyx_L1_error)\n  }\n\n  /* \"pywrapfst.pyx\":1507\n *       ssymbols_ptr = ssymbols._table\n *     fst.DrawFst(deref(self._fst),\n *         self._fst.get().InputSymbols() if isymbols is None             # <<<<<<<<<<<<<<\n *         else isymbols._table,\n *         self._fst.get().OutputSymbols() if osymbols is None\n */\n  __pyx_t_19 = (((PyObject *)__pyx_v_isymbols) == Py_None);\n  if ((__pyx_t_19 != 0)) {\n    if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n      PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n      __PYX_ERR(0, 1507, __pyx_L1_error)\n    }\n    __pyx_t_21 = __pyx_v_self->_fst.get()->InputSymbols();\n  } else {\n\n    /* \"pywrapfst.pyx\":1508\n *     fst.DrawFst(deref(self._fst),\n *         self._fst.get().InputSymbols() if isymbols is None\n *         else isymbols._table,             # <<<<<<<<<<<<<<\n *         self._fst.get().OutputSymbols() if osymbols is None\n *         else osymbols._table,\n */\n    if (unlikely(((PyObject *)__pyx_v_isymbols) == Py_None)) {\n      PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_table\");\n      __PYX_ERR(0, 1508, __pyx_L1_error)\n    }\n    __pyx_t_21 = __pyx_v_isymbols->_table;\n  }\n\n  /* \"pywrapfst.pyx\":1509\n *         self._fst.get().InputSymbols() if isymbols is None\n *         else isymbols._table,\n *         self._fst.get().OutputSymbols() if osymbols is None             # <<<<<<<<<<<<<<\n *         else osymbols._table,\n *         ssymbols_ptr, acceptor, tostring(title), width, height, portrait,\n */\n  __pyx_t_19 = (((PyObject *)__pyx_v_osymbols) == Py_None);\n  if ((__pyx_t_19 != 0)) {\n    if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n      PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n      __PYX_ERR(0, 1509, __pyx_L1_error)\n    }\n    __pyx_t_22 = __pyx_v_self->_fst.get()->OutputSymbols();\n  } else {\n\n    /* \"pywrapfst.pyx\":1510\n *         else isymbols._table,\n *         self._fst.get().OutputSymbols() if osymbols is None\n *         else osymbols._table,             # <<<<<<<<<<<<<<\n *         ssymbols_ptr, acceptor, tostring(title), width, height, portrait,\n *         vertical, ranksep, nodesep, fontsize, precision,\n */\n    if (unlikely(((PyObject *)__pyx_v_osymbols) == Py_None)) {\n      PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_table\");\n      __PYX_ERR(0, 1510, __pyx_L1_error)\n    }\n    __pyx_t_22 = __pyx_v_osymbols->_table;\n  }\n\n  /* \"pywrapfst.pyx\":1511\n *         self._fst.get().OutputSymbols() if osymbols is None\n *         else osymbols._table,\n *         ssymbols_ptr, acceptor, tostring(title), width, height, portrait,             # <<<<<<<<<<<<<<\n *         vertical, ranksep, nodesep, fontsize, precision,\n *         tostring(float_format), show_weight_one, ostrm.get(),\n */\n  __pyx_t_17 = __pyx_f_9pywrapfst_tostring(__pyx_v_title, NULL); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 1511, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":1513\n *         ssymbols_ptr, acceptor, tostring(title), width, height, portrait,\n *         vertical, ranksep, nodesep, fontsize, precision,\n *         tostring(float_format), show_weight_one, ostrm.get(),             # <<<<<<<<<<<<<<\n *         filename_string)\n * \n */\n  __pyx_t_23 = __pyx_f_9pywrapfst_tostring(__pyx_v_float_format, NULL); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 1513, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":1506\n *     if ssymbols is not None:\n *       ssymbols_ptr = ssymbols._table\n *     fst.DrawFst(deref(self._fst),             # <<<<<<<<<<<<<<\n *         self._fst.get().InputSymbols() if isymbols is None\n *         else isymbols._table,\n */\n  fst::script::DrawFst((*__pyx_v_self->_fst), __pyx_t_21, __pyx_t_22, __pyx_v_ssymbols_ptr, __pyx_v_acceptor, __pyx_t_17, __pyx_v_width, __pyx_v_height, __pyx_v_portrait, __pyx_v_vertical, __pyx_v_ranksep, __pyx_v_nodesep, __pyx_v_fontsize, __pyx_v_precision, __pyx_t_23, __pyx_v_show_weight_one, __pyx_v_ostrm.get(), __pyx_v_filename_string);\n\n  /* \"pywrapfst.pyx\":1450\n *     return _init_XFst(new fst.FstClass(deref(self._fst)))\n * \n *   cpdef void draw(self,             # <<<<<<<<<<<<<<\n *                   filename,\n *                   _SymbolTable isymbols=None,\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_XDECREF(__pyx_t_6);\n  __Pyx_XDECREF(__pyx_t_7);\n  __Pyx_XDECREF(__pyx_t_8);\n  __Pyx_XDECREF(__pyx_t_9);\n  __Pyx_XDECREF(__pyx_t_10);\n  __Pyx_XDECREF(__pyx_t_11);\n  __Pyx_XDECREF(__pyx_t_12);\n  __Pyx_XDECREF(__pyx_t_13);\n  __Pyx_XDECREF(__pyx_t_14);\n  __Pyx_XDECREF(__pyx_t_16);\n  __Pyx_WriteUnraisable(\"pywrapfst._Fst.draw\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_17draw(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic char __pyx_doc_9pywrapfst_4_Fst_16draw[] = \"\\n    draw(self, filename, isymbols=None, osymbols=None, ssymbols=None,\\n         acceptor=False, title=\\\"\\\", width=8.5, height=11, portrait=False,\\n         vertical=False, ranksep=0.4, nodesep=0.25, fontsize=14,\\n         precision=5, float_format=\\\"g\\\", show_weight_one=False):\\n\\n    Writes out the FST in Graphviz text format.\\n\\n    This method writes out the FST in the dot graph description language. The\\n    graph can be rendered using the `dot` executable provided by Graphviz.\\n\\n    Args:\\n      filename: The string location of the output dot/Graphviz file.\\n      isymbols: An optional symbol table used to label input symbols.\\n      osymbols: An optional symbol table used to label output symbols.\\n      ssymbols: An optional symbol table used to label states.\\n      acceptor: Should the figure be rendered in acceptor format if possible?\\n      title: An optional string indicating the figure title.\\n      width: The figure width, in inches.\\n      height: The figure height, in inches.\\n      portrait: Should the figure be rendered in portrait rather than\\n          landscape?\\n      vertical: Should the figure be rendered bottom-to-top rather than\\n          left-to-right?\\n      ranksep: The minimum separation separation between ranks, in inches.\\n      nodesep: The minimum separation between nodes, in inches.\\n      fontsize: Font size, in points.\\n      precision: Numeric precision for floats, in number of chars.\\n      float_format: One of: 'e', 'f' or 'g'.\\n      show_weight_one: Should weights equivalent to semiring One be printed?\\n\\n    See also: `text`.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_17draw(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  PyObject *__pyx_v_filename = 0;\n  struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_isymbols = 0;\n  struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_osymbols = 0;\n  struct __pyx_obj_9pywrapfst_SymbolTable *__pyx_v_ssymbols = 0;\n  bool __pyx_v_acceptor;\n  PyObject *__pyx_v_title = 0;\n  double __pyx_v_width;\n  double __pyx_v_height;\n  bool __pyx_v_portrait;\n  bool __pyx_v_vertical;\n  double __pyx_v_ranksep;\n  double __pyx_v_nodesep;\n  __pyx_t_10basictypes_int32 __pyx_v_fontsize;\n  __pyx_t_10basictypes_int32 __pyx_v_precision;\n  PyObject *__pyx_v_float_format = 0;\n  bool __pyx_v_show_weight_one;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"draw (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_filename,&__pyx_n_s_isymbols,&__pyx_n_s_osymbols,&__pyx_n_s_ssymbols,&__pyx_n_s_acceptor,&__pyx_n_s_title,&__pyx_n_s_width,&__pyx_n_s_height,&__pyx_n_s_portrait,&__pyx_n_s_vertical,&__pyx_n_s_ranksep,&__pyx_n_s_nodesep,&__pyx_n_s_fontsize,&__pyx_n_s_precision,&__pyx_n_s_float_format,&__pyx_n_s_show_weight_one,0};\n    PyObject* values[16] = {0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0};\n\n    /* \"pywrapfst.pyx\":1452\n *   cpdef void draw(self,\n *                   filename,\n *                   _SymbolTable isymbols=None,             # <<<<<<<<<<<<<<\n *                   _SymbolTable osymbols=None,\n *                   SymbolTable ssymbols=None,\n */\n    values[1] = (PyObject *)((struct __pyx_obj_9pywrapfst__SymbolTable *)Py_None);\n\n    /* \"pywrapfst.pyx\":1453\n *                   filename,\n *                   _SymbolTable isymbols=None,\n *                   _SymbolTable osymbols=None,             # <<<<<<<<<<<<<<\n *                   SymbolTable ssymbols=None,\n *                   bool acceptor=False,\n */\n    values[2] = (PyObject *)((struct __pyx_obj_9pywrapfst__SymbolTable *)Py_None);\n\n    /* \"pywrapfst.pyx\":1454\n *                   _SymbolTable isymbols=None,\n *                   _SymbolTable osymbols=None,\n *                   SymbolTable ssymbols=None,             # <<<<<<<<<<<<<<\n *                   bool acceptor=False,\n *                   title=b\"\",\n */\n    values[3] = (PyObject *)((struct __pyx_obj_9pywrapfst_SymbolTable *)Py_None);\n    values[5] = ((PyObject *)__pyx_kp_b__24);\n    values[14] = ((PyObject *)__pyx_n_b_g);\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case 16: values[15] = PyTuple_GET_ITEM(__pyx_args, 15);\n        CYTHON_FALLTHROUGH;\n        case 15: values[14] = PyTuple_GET_ITEM(__pyx_args, 14);\n        CYTHON_FALLTHROUGH;\n        case 14: values[13] = PyTuple_GET_ITEM(__pyx_args, 13);\n        CYTHON_FALLTHROUGH;\n        case 13: values[12] = PyTuple_GET_ITEM(__pyx_args, 12);\n        CYTHON_FALLTHROUGH;\n        case 12: values[11] = PyTuple_GET_ITEM(__pyx_args, 11);\n        CYTHON_FALLTHROUGH;\n        case 11: values[10] = PyTuple_GET_ITEM(__pyx_args, 10);\n        CYTHON_FALLTHROUGH;\n        case 10: values[9] = PyTuple_GET_ITEM(__pyx_args, 9);\n        CYTHON_FALLTHROUGH;\n        case  9: values[8] = PyTuple_GET_ITEM(__pyx_args, 8);\n        CYTHON_FALLTHROUGH;\n        case  8: values[7] = PyTuple_GET_ITEM(__pyx_args, 7);\n        CYTHON_FALLTHROUGH;\n        case  7: values[6] = PyTuple_GET_ITEM(__pyx_args, 6);\n        CYTHON_FALLTHROUGH;\n        case  6: values[5] = PyTuple_GET_ITEM(__pyx_args, 5);\n        CYTHON_FALLTHROUGH;\n        case  5: values[4] = PyTuple_GET_ITEM(__pyx_args, 4);\n        CYTHON_FALLTHROUGH;\n        case  4: values[3] = PyTuple_GET_ITEM(__pyx_args, 3);\n        CYTHON_FALLTHROUGH;\n        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);\n        CYTHON_FALLTHROUGH;\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (likely((values[0] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_filename)) != 0)) kw_args--;\n        else goto __pyx_L5_argtuple_error;\n        CYTHON_FALLTHROUGH;\n        case  1:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_isymbols);\n          if (value) { values[1] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  2:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_osymbols);\n          if (value) { values[2] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  3:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_ssymbols);\n          if (value) { values[3] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  4:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_acceptor);\n          if (value) { values[4] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  5:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_title);\n          if (value) { values[5] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  6:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_width);\n          if (value) { values[6] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  7:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_height);\n          if (value) { values[7] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  8:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_portrait);\n          if (value) { values[8] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  9:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_vertical);\n          if (value) { values[9] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case 10:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_ranksep);\n          if (value) { values[10] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case 11:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_nodesep);\n          if (value) { values[11] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case 12:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_fontsize);\n          if (value) { values[12] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case 13:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_precision);\n          if (value) { values[13] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case 14:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_float_format);\n          if (value) { values[14] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case 15:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_show_weight_one);\n          if (value) { values[15] = value; kw_args--; }\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"draw\") < 0)) __PYX_ERR(0, 1450, __pyx_L3_error)\n      }\n    } else {\n      switch (PyTuple_GET_SIZE(__pyx_args)) {\n        case 16: values[15] = PyTuple_GET_ITEM(__pyx_args, 15);\n        CYTHON_FALLTHROUGH;\n        case 15: values[14] = PyTuple_GET_ITEM(__pyx_args, 14);\n        CYTHON_FALLTHROUGH;\n        case 14: values[13] = PyTuple_GET_ITEM(__pyx_args, 13);\n        CYTHON_FALLTHROUGH;\n        case 13: values[12] = PyTuple_GET_ITEM(__pyx_args, 12);\n        CYTHON_FALLTHROUGH;\n        case 12: values[11] = PyTuple_GET_ITEM(__pyx_args, 11);\n        CYTHON_FALLTHROUGH;\n        case 11: values[10] = PyTuple_GET_ITEM(__pyx_args, 10);\n        CYTHON_FALLTHROUGH;\n        case 10: values[9] = PyTuple_GET_ITEM(__pyx_args, 9);\n        CYTHON_FALLTHROUGH;\n        case  9: values[8] = PyTuple_GET_ITEM(__pyx_args, 8);\n        CYTHON_FALLTHROUGH;\n        case  8: values[7] = PyTuple_GET_ITEM(__pyx_args, 7);\n        CYTHON_FALLTHROUGH;\n        case  7: values[6] = PyTuple_GET_ITEM(__pyx_args, 6);\n        CYTHON_FALLTHROUGH;\n        case  6: values[5] = PyTuple_GET_ITEM(__pyx_args, 5);\n        CYTHON_FALLTHROUGH;\n        case  5: values[4] = PyTuple_GET_ITEM(__pyx_args, 4);\n        CYTHON_FALLTHROUGH;\n        case  4: values[3] = PyTuple_GET_ITEM(__pyx_args, 3);\n        CYTHON_FALLTHROUGH;\n        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);\n        CYTHON_FALLTHROUGH;\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n    }\n    __pyx_v_filename = values[0];\n    __pyx_v_isymbols = ((struct __pyx_obj_9pywrapfst__SymbolTable *)values[1]);\n    __pyx_v_osymbols = ((struct __pyx_obj_9pywrapfst__SymbolTable *)values[2]);\n    __pyx_v_ssymbols = ((struct __pyx_obj_9pywrapfst_SymbolTable *)values[3]);\n    if (values[4]) {\n      __pyx_v_acceptor = __Pyx_PyObject_IsTrue(values[4]); if (unlikely((__pyx_v_acceptor == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 1455, __pyx_L3_error)\n    } else {\n\n      /* \"pywrapfst.pyx\":1455\n *                   _SymbolTable osymbols=None,\n *                   SymbolTable ssymbols=None,\n *                   bool acceptor=False,             # <<<<<<<<<<<<<<\n *                   title=b\"\",\n *                   double width=8.5,\n */\n      __pyx_v_acceptor = ((bool)0);\n    }\n    __pyx_v_title = values[5];\n    if (values[6]) {\n      __pyx_v_width = __pyx_PyFloat_AsDouble(values[6]); if (unlikely((__pyx_v_width == (double)-1) && PyErr_Occurred())) __PYX_ERR(0, 1457, __pyx_L3_error)\n    } else {\n      __pyx_v_width = ((double)8.5);\n    }\n    if (values[7]) {\n      __pyx_v_height = __pyx_PyFloat_AsDouble(values[7]); if (unlikely((__pyx_v_height == (double)-1) && PyErr_Occurred())) __PYX_ERR(0, 1458, __pyx_L3_error)\n    } else {\n      __pyx_v_height = ((double)11.0);\n    }\n    if (values[8]) {\n      __pyx_v_portrait = __Pyx_PyObject_IsTrue(values[8]); if (unlikely((__pyx_v_portrait == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 1459, __pyx_L3_error)\n    } else {\n\n      /* \"pywrapfst.pyx\":1459\n *                   double width=8.5,\n *                   double height=11,\n *                   bool portrait=False,             # <<<<<<<<<<<<<<\n *                   bool vertical=False,\n *                   double ranksep=0.4,\n */\n      __pyx_v_portrait = ((bool)0);\n    }\n    if (values[9]) {\n      __pyx_v_vertical = __Pyx_PyObject_IsTrue(values[9]); if (unlikely((__pyx_v_vertical == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 1460, __pyx_L3_error)\n    } else {\n\n      /* \"pywrapfst.pyx\":1460\n *                   double height=11,\n *                   bool portrait=False,\n *                   bool vertical=False,             # <<<<<<<<<<<<<<\n *                   double ranksep=0.4,\n *                   double nodesep=0.25,\n */\n      __pyx_v_vertical = ((bool)0);\n    }\n    if (values[10]) {\n      __pyx_v_ranksep = __pyx_PyFloat_AsDouble(values[10]); if (unlikely((__pyx_v_ranksep == (double)-1) && PyErr_Occurred())) __PYX_ERR(0, 1461, __pyx_L3_error)\n    } else {\n      __pyx_v_ranksep = ((double)0.4);\n    }\n    if (values[11]) {\n      __pyx_v_nodesep = __pyx_PyFloat_AsDouble(values[11]); if (unlikely((__pyx_v_nodesep == (double)-1) && PyErr_Occurred())) __PYX_ERR(0, 1462, __pyx_L3_error)\n    } else {\n      __pyx_v_nodesep = ((double)0.25);\n    }\n    if (values[12]) {\n      __pyx_v_fontsize = __Pyx_PyInt_As_int32_t(values[12]); if (unlikely((__pyx_v_fontsize == ((int32_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 1463, __pyx_L3_error)\n    } else {\n      __pyx_v_fontsize = ((__pyx_t_10basictypes_int32)14);\n    }\n    if (values[13]) {\n      __pyx_v_precision = __Pyx_PyInt_As_int32_t(values[13]); if (unlikely((__pyx_v_precision == ((int32_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 1464, __pyx_L3_error)\n    } else {\n      __pyx_v_precision = ((__pyx_t_10basictypes_int32)5);\n    }\n    __pyx_v_float_format = values[14];\n    if (values[15]) {\n      __pyx_v_show_weight_one = __Pyx_PyObject_IsTrue(values[15]); if (unlikely((__pyx_v_show_weight_one == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 1466, __pyx_L3_error)\n    } else {\n\n      /* \"pywrapfst.pyx\":1466\n *                   int32 precision=5,\n *                   float_format=b\"g\",\n *                   bool show_weight_one=False):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     draw(self, filename, isymbols=None, osymbols=None, ssymbols=None,\n */\n      __pyx_v_show_weight_one = ((bool)0);\n    }\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"draw\", 0, 1, 16, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 1450, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst._Fst.draw\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_isymbols), __pyx_ptype_9pywrapfst__SymbolTable, 1, \"isymbols\", 0))) __PYX_ERR(0, 1452, __pyx_L1_error)\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_osymbols), __pyx_ptype_9pywrapfst__SymbolTable, 1, \"osymbols\", 0))) __PYX_ERR(0, 1453, __pyx_L1_error)\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_ssymbols), __pyx_ptype_9pywrapfst_SymbolTable, 1, \"ssymbols\", 0))) __PYX_ERR(0, 1454, __pyx_L1_error)\n  __pyx_r = __pyx_pf_9pywrapfst_4_Fst_16draw(((struct __pyx_obj_9pywrapfst__Fst *)__pyx_v_self), __pyx_v_filename, __pyx_v_isymbols, __pyx_v_osymbols, __pyx_v_ssymbols, __pyx_v_acceptor, __pyx_v_title, __pyx_v_width, __pyx_v_height, __pyx_v_portrait, __pyx_v_vertical, __pyx_v_ranksep, __pyx_v_nodesep, __pyx_v_fontsize, __pyx_v_precision, __pyx_v_float_format, __pyx_v_show_weight_one);\n\n  /* \"pywrapfst.pyx\":1450\n *     return _init_XFst(new fst.FstClass(deref(self._fst)))\n * \n *   cpdef void draw(self,             # <<<<<<<<<<<<<<\n *                   filename,\n *                   _SymbolTable isymbols=None,\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_4_Fst_16draw(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self, PyObject *__pyx_v_filename, struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_isymbols, struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_osymbols, struct __pyx_obj_9pywrapfst_SymbolTable *__pyx_v_ssymbols, bool __pyx_v_acceptor, PyObject *__pyx_v_title, double __pyx_v_width, double __pyx_v_height, bool __pyx_v_portrait, bool __pyx_v_vertical, double __pyx_v_ranksep, double __pyx_v_nodesep, __pyx_t_10basictypes_int32 __pyx_v_fontsize, __pyx_t_10basictypes_int32 __pyx_v_precision, PyObject *__pyx_v_float_format, bool __pyx_v_show_weight_one) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  struct __pyx_opt_args_9pywrapfst_4_Fst_draw __pyx_t_1;\n  PyObject *__pyx_t_2 = NULL;\n  __Pyx_RefNannySetupContext(\"draw\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1.__pyx_n = 15;\n  __pyx_t_1.isymbols = __pyx_v_isymbols;\n  __pyx_t_1.osymbols = __pyx_v_osymbols;\n  __pyx_t_1.ssymbols = __pyx_v_ssymbols;\n  __pyx_t_1.acceptor = __pyx_v_acceptor;\n  __pyx_t_1.title = __pyx_v_title;\n  __pyx_t_1.width = __pyx_v_width;\n  __pyx_t_1.height = __pyx_v_height;\n  __pyx_t_1.portrait = __pyx_v_portrait;\n  __pyx_t_1.vertical = __pyx_v_vertical;\n  __pyx_t_1.ranksep = __pyx_v_ranksep;\n  __pyx_t_1.nodesep = __pyx_v_nodesep;\n  __pyx_t_1.fontsize = __pyx_v_fontsize;\n  __pyx_t_1.precision = __pyx_v_precision;\n  __pyx_t_1.float_format = __pyx_v_float_format;\n  __pyx_t_1.show_weight_one = __pyx_v_show_weight_one;\n  __pyx_vtabptr_9pywrapfst__Fst->draw(__pyx_v_self, __pyx_v_filename, 1, &__pyx_t_1); \n  __pyx_t_2 = __Pyx_void_to_None(NULL); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1450, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  __pyx_r = __pyx_t_2;\n  __pyx_t_2 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_AddTraceback(\"pywrapfst._Fst.draw\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1516\n *         filename_string)\n * \n *   cpdef Weight final(self, int64 state):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     final(self, state)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_19final(PyObject *__pyx_v_self, PyObject *__pyx_arg_state); /*proto*/\nstatic struct __pyx_obj_9pywrapfst_Weight *__pyx_f_9pywrapfst_4_Fst_final(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self, __pyx_t_10basictypes_int64 __pyx_v_state, int __pyx_skip_dispatch) {\n  struct __pyx_obj_9pywrapfst_Weight *__pyx_v_weight = 0;\n  struct __pyx_obj_9pywrapfst_Weight *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  PyObject *__pyx_t_6 = NULL;\n  __Pyx_RefNannySetupContext(\"final\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_final); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1516, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_4_Fst_19final)) {\n      __Pyx_XDECREF(((PyObject *)__pyx_r));\n      __pyx_t_3 = __Pyx_PyInt_From_int64_t(__pyx_v_state); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 1516, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_3);\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_4 = __pyx_t_1; __pyx_t_5 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_4))) {\n        __pyx_t_5 = PyMethod_GET_SELF(__pyx_t_4);\n        if (likely(__pyx_t_5)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_4);\n          __Pyx_INCREF(__pyx_t_5);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_4, function);\n        }\n      }\n      if (!__pyx_t_5) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_4, __pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1516, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n        __Pyx_GOTREF(__pyx_t_2);\n      } else {\n        #if CYTHON_FAST_PYCALL\n        if (PyFunction_Check(__pyx_t_4)) {\n          PyObject *__pyx_temp[2] = {__pyx_t_5, __pyx_t_3};\n          __pyx_t_2 = __Pyx_PyFunction_FastCall(__pyx_t_4, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1516, __pyx_L1_error)\n          __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;\n          __Pyx_GOTREF(__pyx_t_2);\n          __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n        } else\n        #endif\n        #if CYTHON_FAST_PYCCALL\n        if (__Pyx_PyFastCFunction_Check(__pyx_t_4)) {\n          PyObject *__pyx_temp[2] = {__pyx_t_5, __pyx_t_3};\n          __pyx_t_2 = __Pyx_PyCFunction_FastCall(__pyx_t_4, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1516, __pyx_L1_error)\n          __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;\n          __Pyx_GOTREF(__pyx_t_2);\n          __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n        } else\n        #endif\n        {\n          __pyx_t_6 = PyTuple_New(1+1); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 1516, __pyx_L1_error)\n          __Pyx_GOTREF(__pyx_t_6);\n          __Pyx_GIVEREF(__pyx_t_5); PyTuple_SET_ITEM(__pyx_t_6, 0, __pyx_t_5); __pyx_t_5 = NULL;\n          __Pyx_GIVEREF(__pyx_t_3);\n          PyTuple_SET_ITEM(__pyx_t_6, 0+1, __pyx_t_3);\n          __pyx_t_3 = 0;\n          __pyx_t_2 = __Pyx_PyObject_Call(__pyx_t_4, __pyx_t_6, NULL); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1516, __pyx_L1_error)\n          __Pyx_GOTREF(__pyx_t_2);\n          __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n        }\n      }\n      __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      if (!(likely(((__pyx_t_2) == Py_None) || likely(__Pyx_TypeTest(__pyx_t_2, __pyx_ptype_9pywrapfst_Weight))))) __PYX_ERR(0, 1516, __pyx_L1_error)\n      __pyx_r = ((struct __pyx_obj_9pywrapfst_Weight *)__pyx_t_2);\n      __pyx_t_2 = 0;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":1531\n *       FstIndexError: State index out of range.\n *     \"\"\"\n *     cdef Weight weight = Weight.__new__(Weight)             # <<<<<<<<<<<<<<\n *     weight._weight.reset(new fst.WeightClass(self._fst.get().Final(state)))\n *     return weight\n */\n  __pyx_t_1 = __pyx_tp_new_9pywrapfst_Weight(((PyTypeObject *)__pyx_ptype_9pywrapfst_Weight), __pyx_empty_tuple, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1531, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (!(likely(__Pyx_TypeTest(__pyx_t_1, __pyx_ptype_9pywrapfst_Weight)))) __PYX_ERR(0, 1531, __pyx_L1_error)\n  __pyx_v_weight = ((struct __pyx_obj_9pywrapfst_Weight *)__pyx_t_1);\n  __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":1532\n *     \"\"\"\n *     cdef Weight weight = Weight.__new__(Weight)\n *     weight._weight.reset(new fst.WeightClass(self._fst.get().Final(state)))             # <<<<<<<<<<<<<<\n *     return weight\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_weight) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_weight\");\n    __PYX_ERR(0, 1532, __pyx_L1_error)\n  }\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 1532, __pyx_L1_error)\n  }\n  __pyx_v_weight->_weight.reset(new fst::script::WeightClass(__pyx_v_self->_fst.get()->Final(__pyx_v_state)));\n\n  /* \"pywrapfst.pyx\":1533\n *     cdef Weight weight = Weight.__new__(Weight)\n *     weight._weight.reset(new fst.WeightClass(self._fst.get().Final(state)))\n *     return weight             # <<<<<<<<<<<<<<\n * \n *   cpdef string fst_type(self):\n */\n  __Pyx_XDECREF(((PyObject *)__pyx_r));\n  __Pyx_INCREF(((PyObject *)__pyx_v_weight));\n  __pyx_r = __pyx_v_weight;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":1516\n *         filename_string)\n * \n *   cpdef Weight final(self, int64 state):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     final(self, state)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_XDECREF(__pyx_t_6);\n  __Pyx_AddTraceback(\"pywrapfst._Fst.final\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XDECREF((PyObject *)__pyx_v_weight);\n  __Pyx_XGIVEREF((PyObject *)__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_19final(PyObject *__pyx_v_self, PyObject *__pyx_arg_state); /*proto*/\nstatic char __pyx_doc_9pywrapfst_4_Fst_18final[] = \"\\n    final(self, state)\\n\\n    Returns the final weight of a state.\\n\\n    Args:\\n      state: The integer index of a state.\\n\\n    Returns:\\n      The final Weight of that state.\\n\\n    Raises:\\n      FstIndexError: State index out of range.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_19final(PyObject *__pyx_v_self, PyObject *__pyx_arg_state) {\n  __pyx_t_10basictypes_int64 __pyx_v_state;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"final (wrapper)\", 0);\n  assert(__pyx_arg_state); {\n    __pyx_v_state = __Pyx_PyInt_As_int64_t(__pyx_arg_state); if (unlikely((__pyx_v_state == ((int64_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 1516, __pyx_L3_error)\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst._Fst.final\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  __pyx_r = __pyx_pf_9pywrapfst_4_Fst_18final(((struct __pyx_obj_9pywrapfst__Fst *)__pyx_v_self), ((__pyx_t_10basictypes_int64)__pyx_v_state));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_4_Fst_18final(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self, __pyx_t_10basictypes_int64 __pyx_v_state) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"final\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst_4_Fst_final(__pyx_v_self, __pyx_v_state, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1516, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst._Fst.final\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1535\n *     return weight\n * \n *   cpdef string fst_type(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     fst_type(self)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_21fst_type(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic std::string __pyx_f_9pywrapfst_4_Fst_fst_type(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self, int __pyx_skip_dispatch) {\n  std::string __pyx_r;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  std::string __pyx_t_5;\n  __Pyx_RefNannySetupContext(\"fst_type\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_fst_type); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1535, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_4_Fst_21fst_type)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1535, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1535, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __pyx_t_5 = __pyx_convert_string_from_py_std__in_string(__pyx_t_2); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 1535, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __pyx_r = __pyx_t_5;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":1541\n *     Returns a string indicating the FST type.\n *     \"\"\"\n *     return self._fst.get().FstType()             # <<<<<<<<<<<<<<\n * \n *   cpdef _FstSymbolTable input_symbols(self):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 1541, __pyx_L1_error)\n  }\n  __pyx_r = __pyx_v_self->_fst.get()->FstType();\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":1535\n *     return weight\n * \n *   cpdef string fst_type(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     fst_type(self)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_WriteUnraisable(\"pywrapfst._Fst.fst_type\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __Pyx_pretend_to_initialize(&__pyx_r);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_21fst_type(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_4_Fst_20fst_type[] = \"\\n    fst_type(self)\\n\\n    Returns a string indicating the FST type.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_21fst_type(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"fst_type (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_4_Fst_20fst_type(((struct __pyx_obj_9pywrapfst__Fst *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_4_Fst_20fst_type(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"fst_type\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __pyx_convert_PyBytes_string_to_py_std__in_string(__pyx_f_9pywrapfst_4_Fst_fst_type(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1535, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst._Fst.fst_type\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1543\n *     return self._fst.get().FstType()\n * \n *   cpdef _FstSymbolTable input_symbols(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     input_symbols(self)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_23input_symbols(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic struct __pyx_obj_9pywrapfst__FstSymbolTable *__pyx_f_9pywrapfst_4_Fst_input_symbols(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self, int __pyx_skip_dispatch) {\n  fst::SymbolTable *__pyx_v_syms;\n  struct __pyx_obj_9pywrapfst__FstSymbolTable *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  int __pyx_t_5;\n  __Pyx_RefNannySetupContext(\"input_symbols\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_input_symbols); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1543, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_4_Fst_23input_symbols)) {\n      __Pyx_XDECREF(((PyObject *)__pyx_r));\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1543, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1543, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      if (!(likely(((__pyx_t_2) == Py_None) || likely(__Pyx_TypeTest(__pyx_t_2, __pyx_ptype_9pywrapfst__FstSymbolTable))))) __PYX_ERR(0, 1543, __pyx_L1_error)\n      __pyx_r = ((struct __pyx_obj_9pywrapfst__FstSymbolTable *)__pyx_t_2);\n      __pyx_t_2 = 0;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":1552\n *     \"\"\"\n *     cdef fst.SymbolTable *syms = const_cast[SymbolTable_ptr](\n *       self._fst.get().InputSymbols())             # <<<<<<<<<<<<<<\n *     if syms == NULL:\n *       return\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 1552, __pyx_L1_error)\n  }\n\n  /* \"pywrapfst.pyx\":1551\n *     See also: `input_symbols`.\n *     \"\"\"\n *     cdef fst.SymbolTable *syms = const_cast[SymbolTable_ptr](             # <<<<<<<<<<<<<<\n *       self._fst.get().InputSymbols())\n *     if syms == NULL:\n */\n  __pyx_v_syms = const_cast<__pyx_t_9pywrapfst_SymbolTable_ptr>(__pyx_v_self->_fst.get()->InputSymbols());\n\n  /* \"pywrapfst.pyx\":1553\n *     cdef fst.SymbolTable *syms = const_cast[SymbolTable_ptr](\n *       self._fst.get().InputSymbols())\n *     if syms == NULL:             # <<<<<<<<<<<<<<\n *       return\n *     return _init_FstSymbolTable(syms, self._fst)\n */\n  __pyx_t_5 = ((__pyx_v_syms == NULL) != 0);\n  if (__pyx_t_5) {\n\n    /* \"pywrapfst.pyx\":1554\n *       self._fst.get().InputSymbols())\n *     if syms == NULL:\n *       return             # <<<<<<<<<<<<<<\n *     return _init_FstSymbolTable(syms, self._fst)\n * \n */\n    __Pyx_XDECREF(((PyObject *)__pyx_r));\n    __pyx_r = ((struct __pyx_obj_9pywrapfst__FstSymbolTable *)Py_None); __Pyx_INCREF(Py_None);\n    goto __pyx_L0;\n\n    /* \"pywrapfst.pyx\":1553\n *     cdef fst.SymbolTable *syms = const_cast[SymbolTable_ptr](\n *       self._fst.get().InputSymbols())\n *     if syms == NULL:             # <<<<<<<<<<<<<<\n *       return\n *     return _init_FstSymbolTable(syms, self._fst)\n */\n  }\n\n  /* \"pywrapfst.pyx\":1555\n *     if syms == NULL:\n *       return\n *     return _init_FstSymbolTable(syms, self._fst)             # <<<<<<<<<<<<<<\n * \n *   cpdef size_t num_arcs(self, int64 state) except *:\n */\n  __Pyx_XDECREF(((PyObject *)__pyx_r));\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 1555, __pyx_L1_error)\n  }\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst__init_FstSymbolTable(__pyx_v_syms, __pyx_v_self->_fst)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1555, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = ((struct __pyx_obj_9pywrapfst__FstSymbolTable *)__pyx_t_1);\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":1543\n *     return self._fst.get().FstType()\n * \n *   cpdef _FstSymbolTable input_symbols(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     input_symbols(self)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_AddTraceback(\"pywrapfst._Fst.input_symbols\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XGIVEREF((PyObject *)__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_23input_symbols(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_4_Fst_22input_symbols[] = \"\\n    input_symbols(self)\\n\\n    Returns the FST's input symbol table, or None if none is present.\\n\\n    See also: `input_symbols`.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_23input_symbols(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"input_symbols (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_4_Fst_22input_symbols(((struct __pyx_obj_9pywrapfst__Fst *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_4_Fst_22input_symbols(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"input_symbols\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst_4_Fst_input_symbols(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1543, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst._Fst.input_symbols\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1557\n *     return _init_FstSymbolTable(syms, self._fst)\n * \n *   cpdef size_t num_arcs(self, int64 state) except *:             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     num_arcs(self, state)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_25num_arcs(PyObject *__pyx_v_self, PyObject *__pyx_arg_state); /*proto*/\nstatic size_t __pyx_f_9pywrapfst_4_Fst_num_arcs(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self, __pyx_t_10basictypes_int64 __pyx_v_state, int __pyx_skip_dispatch) {\n  size_t __pyx_v_result;\n  size_t __pyx_r;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  PyObject *__pyx_t_6 = NULL;\n  size_t __pyx_t_7;\n  int __pyx_t_8;\n  __Pyx_RefNannySetupContext(\"num_arcs\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_num_arcs); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1557, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_4_Fst_25num_arcs)) {\n      __pyx_t_3 = __Pyx_PyInt_From_int64_t(__pyx_v_state); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 1557, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_3);\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_4 = __pyx_t_1; __pyx_t_5 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_4))) {\n        __pyx_t_5 = PyMethod_GET_SELF(__pyx_t_4);\n        if (likely(__pyx_t_5)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_4);\n          __Pyx_INCREF(__pyx_t_5);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_4, function);\n        }\n      }\n      if (!__pyx_t_5) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_4, __pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1557, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n        __Pyx_GOTREF(__pyx_t_2);\n      } else {\n        #if CYTHON_FAST_PYCALL\n        if (PyFunction_Check(__pyx_t_4)) {\n          PyObject *__pyx_temp[2] = {__pyx_t_5, __pyx_t_3};\n          __pyx_t_2 = __Pyx_PyFunction_FastCall(__pyx_t_4, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1557, __pyx_L1_error)\n          __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;\n          __Pyx_GOTREF(__pyx_t_2);\n          __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n        } else\n        #endif\n        #if CYTHON_FAST_PYCCALL\n        if (__Pyx_PyFastCFunction_Check(__pyx_t_4)) {\n          PyObject *__pyx_temp[2] = {__pyx_t_5, __pyx_t_3};\n          __pyx_t_2 = __Pyx_PyCFunction_FastCall(__pyx_t_4, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1557, __pyx_L1_error)\n          __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;\n          __Pyx_GOTREF(__pyx_t_2);\n          __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n        } else\n        #endif\n        {\n          __pyx_t_6 = PyTuple_New(1+1); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 1557, __pyx_L1_error)\n          __Pyx_GOTREF(__pyx_t_6);\n          __Pyx_GIVEREF(__pyx_t_5); PyTuple_SET_ITEM(__pyx_t_6, 0, __pyx_t_5); __pyx_t_5 = NULL;\n          __Pyx_GIVEREF(__pyx_t_3);\n          PyTuple_SET_ITEM(__pyx_t_6, 0+1, __pyx_t_3);\n          __pyx_t_3 = 0;\n          __pyx_t_2 = __Pyx_PyObject_Call(__pyx_t_4, __pyx_t_6, NULL); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1557, __pyx_L1_error)\n          __Pyx_GOTREF(__pyx_t_2);\n          __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n        }\n      }\n      __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      __pyx_t_7 = __Pyx_PyInt_As_size_t(__pyx_t_2); if (unlikely((__pyx_t_7 == (size_t)-1) && PyErr_Occurred())) __PYX_ERR(0, 1557, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __pyx_r = __pyx_t_7;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":1574\n *     See also: `num_states`.\n *     \"\"\"\n *     cdef size_t result = self._fst.get().NumArcs(state)             # <<<<<<<<<<<<<<\n *     if result == SIZE_MAX:\n *       raise FstIndexError(\"State index out of range\")\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 1574, __pyx_L1_error)\n  }\n  __pyx_v_result = __pyx_v_self->_fst.get()->NumArcs(__pyx_v_state);\n\n  /* \"pywrapfst.pyx\":1575\n *     \"\"\"\n *     cdef size_t result = self._fst.get().NumArcs(state)\n *     if result == SIZE_MAX:             # <<<<<<<<<<<<<<\n *       raise FstIndexError(\"State index out of range\")\n *     return result\n */\n  __pyx_t_8 = ((__pyx_v_result == SIZE_MAX) != 0);\n  if (__pyx_t_8) {\n\n    /* \"pywrapfst.pyx\":1576\n *     cdef size_t result = self._fst.get().NumArcs(state)\n *     if result == SIZE_MAX:\n *       raise FstIndexError(\"State index out of range\")             # <<<<<<<<<<<<<<\n *     return result\n * \n */\n    __pyx_t_1 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstIndexError); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1576, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    __pyx_t_2 = __Pyx_PyObject_Call(__pyx_t_1, __pyx_tuple__26, NULL); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1576, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_2);\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n    __Pyx_Raise(__pyx_t_2, 0, 0, 0);\n    __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n    __PYX_ERR(0, 1576, __pyx_L1_error)\n\n    /* \"pywrapfst.pyx\":1575\n *     \"\"\"\n *     cdef size_t result = self._fst.get().NumArcs(state)\n *     if result == SIZE_MAX:             # <<<<<<<<<<<<<<\n *       raise FstIndexError(\"State index out of range\")\n *     return result\n */\n  }\n\n  /* \"pywrapfst.pyx\":1577\n *     if result == SIZE_MAX:\n *       raise FstIndexError(\"State index out of range\")\n *     return result             # <<<<<<<<<<<<<<\n * \n *   cpdef size_t num_input_epsilons(self, int64 state) except *:\n */\n  __pyx_r = __pyx_v_result;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":1557\n *     return _init_FstSymbolTable(syms, self._fst)\n * \n *   cpdef size_t num_arcs(self, int64 state) except *:             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     num_arcs(self, state)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_XDECREF(__pyx_t_6);\n  __Pyx_AddTraceback(\"pywrapfst._Fst.num_arcs\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_25num_arcs(PyObject *__pyx_v_self, PyObject *__pyx_arg_state); /*proto*/\nstatic char __pyx_doc_9pywrapfst_4_Fst_24num_arcs[] = \"\\n    num_arcs(self, state)\\n\\n    Returns the number of arcs leaving a state.\\n\\n    Args:\\n      state: The integer index of a state.\\n\\n    Returns:\\n      The number of arcs leaving that state.\\n\\n    Raises:\\n      FstIndexError: State index out of range.\\n\\n    See also: `num_states`.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_25num_arcs(PyObject *__pyx_v_self, PyObject *__pyx_arg_state) {\n  __pyx_t_10basictypes_int64 __pyx_v_state;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"num_arcs (wrapper)\", 0);\n  assert(__pyx_arg_state); {\n    __pyx_v_state = __Pyx_PyInt_As_int64_t(__pyx_arg_state); if (unlikely((__pyx_v_state == ((int64_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 1557, __pyx_L3_error)\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst._Fst.num_arcs\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  __pyx_r = __pyx_pf_9pywrapfst_4_Fst_24num_arcs(((struct __pyx_obj_9pywrapfst__Fst *)__pyx_v_self), ((__pyx_t_10basictypes_int64)__pyx_v_state));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_4_Fst_24num_arcs(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self, __pyx_t_10basictypes_int64 __pyx_v_state) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  size_t __pyx_t_1;\n  PyObject *__pyx_t_2 = NULL;\n  __Pyx_RefNannySetupContext(\"num_arcs\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __pyx_f_9pywrapfst_4_Fst_num_arcs(__pyx_v_self, __pyx_v_state, 1); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 1557, __pyx_L1_error)\n  __pyx_t_2 = __Pyx_PyInt_FromSize_t(__pyx_t_1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1557, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  __pyx_r = __pyx_t_2;\n  __pyx_t_2 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_AddTraceback(\"pywrapfst._Fst.num_arcs\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1579\n *     return result\n * \n *   cpdef size_t num_input_epsilons(self, int64 state) except *:             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     num_input_epsilons(self, state)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_27num_input_epsilons(PyObject *__pyx_v_self, PyObject *__pyx_arg_state); /*proto*/\nstatic size_t __pyx_f_9pywrapfst_4_Fst_num_input_epsilons(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self, __pyx_t_10basictypes_int64 __pyx_v_state, int __pyx_skip_dispatch) {\n  size_t __pyx_v_result;\n  size_t __pyx_r;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  PyObject *__pyx_t_6 = NULL;\n  size_t __pyx_t_7;\n  int __pyx_t_8;\n  __Pyx_RefNannySetupContext(\"num_input_epsilons\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_num_input_epsilons); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1579, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_4_Fst_27num_input_epsilons)) {\n      __pyx_t_3 = __Pyx_PyInt_From_int64_t(__pyx_v_state); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 1579, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_3);\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_4 = __pyx_t_1; __pyx_t_5 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_4))) {\n        __pyx_t_5 = PyMethod_GET_SELF(__pyx_t_4);\n        if (likely(__pyx_t_5)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_4);\n          __Pyx_INCREF(__pyx_t_5);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_4, function);\n        }\n      }\n      if (!__pyx_t_5) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_4, __pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1579, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n        __Pyx_GOTREF(__pyx_t_2);\n      } else {\n        #if CYTHON_FAST_PYCALL\n        if (PyFunction_Check(__pyx_t_4)) {\n          PyObject *__pyx_temp[2] = {__pyx_t_5, __pyx_t_3};\n          __pyx_t_2 = __Pyx_PyFunction_FastCall(__pyx_t_4, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1579, __pyx_L1_error)\n          __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;\n          __Pyx_GOTREF(__pyx_t_2);\n          __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n        } else\n        #endif\n        #if CYTHON_FAST_PYCCALL\n        if (__Pyx_PyFastCFunction_Check(__pyx_t_4)) {\n          PyObject *__pyx_temp[2] = {__pyx_t_5, __pyx_t_3};\n          __pyx_t_2 = __Pyx_PyCFunction_FastCall(__pyx_t_4, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1579, __pyx_L1_error)\n          __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;\n          __Pyx_GOTREF(__pyx_t_2);\n          __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n        } else\n        #endif\n        {\n          __pyx_t_6 = PyTuple_New(1+1); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 1579, __pyx_L1_error)\n          __Pyx_GOTREF(__pyx_t_6);\n          __Pyx_GIVEREF(__pyx_t_5); PyTuple_SET_ITEM(__pyx_t_6, 0, __pyx_t_5); __pyx_t_5 = NULL;\n          __Pyx_GIVEREF(__pyx_t_3);\n          PyTuple_SET_ITEM(__pyx_t_6, 0+1, __pyx_t_3);\n          __pyx_t_3 = 0;\n          __pyx_t_2 = __Pyx_PyObject_Call(__pyx_t_4, __pyx_t_6, NULL); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1579, __pyx_L1_error)\n          __Pyx_GOTREF(__pyx_t_2);\n          __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n        }\n      }\n      __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      __pyx_t_7 = __Pyx_PyInt_As_size_t(__pyx_t_2); if (unlikely((__pyx_t_7 == (size_t)-1) && PyErr_Occurred())) __PYX_ERR(0, 1579, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __pyx_r = __pyx_t_7;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":1596\n *     See also: `num_output_epsilons`.\n *     \"\"\"\n *     cdef size_t result = self._fst.get().NumInputEpsilons(state)             # <<<<<<<<<<<<<<\n *     if result == SIZE_MAX:\n *       raise FstIndexError(\"State index out of range\")\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 1596, __pyx_L1_error)\n  }\n  __pyx_v_result = __pyx_v_self->_fst.get()->NumInputEpsilons(__pyx_v_state);\n\n  /* \"pywrapfst.pyx\":1597\n *     \"\"\"\n *     cdef size_t result = self._fst.get().NumInputEpsilons(state)\n *     if result == SIZE_MAX:             # <<<<<<<<<<<<<<\n *       raise FstIndexError(\"State index out of range\")\n *     return result\n */\n  __pyx_t_8 = ((__pyx_v_result == SIZE_MAX) != 0);\n  if (__pyx_t_8) {\n\n    /* \"pywrapfst.pyx\":1598\n *     cdef size_t result = self._fst.get().NumInputEpsilons(state)\n *     if result == SIZE_MAX:\n *       raise FstIndexError(\"State index out of range\")             # <<<<<<<<<<<<<<\n *     return result\n * \n */\n    __pyx_t_1 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstIndexError); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1598, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    __pyx_t_2 = __Pyx_PyObject_Call(__pyx_t_1, __pyx_tuple__27, NULL); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1598, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_2);\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n    __Pyx_Raise(__pyx_t_2, 0, 0, 0);\n    __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n    __PYX_ERR(0, 1598, __pyx_L1_error)\n\n    /* \"pywrapfst.pyx\":1597\n *     \"\"\"\n *     cdef size_t result = self._fst.get().NumInputEpsilons(state)\n *     if result == SIZE_MAX:             # <<<<<<<<<<<<<<\n *       raise FstIndexError(\"State index out of range\")\n *     return result\n */\n  }\n\n  /* \"pywrapfst.pyx\":1599\n *     if result == SIZE_MAX:\n *       raise FstIndexError(\"State index out of range\")\n *     return result             # <<<<<<<<<<<<<<\n * \n *   cpdef size_t num_output_epsilons(self, int64 state) except *:\n */\n  __pyx_r = __pyx_v_result;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":1579\n *     return result\n * \n *   cpdef size_t num_input_epsilons(self, int64 state) except *:             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     num_input_epsilons(self, state)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_XDECREF(__pyx_t_6);\n  __Pyx_AddTraceback(\"pywrapfst._Fst.num_input_epsilons\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_27num_input_epsilons(PyObject *__pyx_v_self, PyObject *__pyx_arg_state); /*proto*/\nstatic char __pyx_doc_9pywrapfst_4_Fst_26num_input_epsilons[] = \"\\n    num_input_epsilons(self, state)\\n\\n    Returns the number of arcs with epsilon input labels leaving a state.\\n\\n    Args:\\n      state: The integer index of a state.\\n\\n    Returns:\\n      The number of epsilon-input-labeled arcs leaving that state.\\n\\n    Raises:\\n      FstIndexError: State index out of range.\\n\\n    See also: `num_output_epsilons`.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_27num_input_epsilons(PyObject *__pyx_v_self, PyObject *__pyx_arg_state) {\n  __pyx_t_10basictypes_int64 __pyx_v_state;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"num_input_epsilons (wrapper)\", 0);\n  assert(__pyx_arg_state); {\n    __pyx_v_state = __Pyx_PyInt_As_int64_t(__pyx_arg_state); if (unlikely((__pyx_v_state == ((int64_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 1579, __pyx_L3_error)\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst._Fst.num_input_epsilons\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  __pyx_r = __pyx_pf_9pywrapfst_4_Fst_26num_input_epsilons(((struct __pyx_obj_9pywrapfst__Fst *)__pyx_v_self), ((__pyx_t_10basictypes_int64)__pyx_v_state));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_4_Fst_26num_input_epsilons(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self, __pyx_t_10basictypes_int64 __pyx_v_state) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  size_t __pyx_t_1;\n  PyObject *__pyx_t_2 = NULL;\n  __Pyx_RefNannySetupContext(\"num_input_epsilons\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __pyx_f_9pywrapfst_4_Fst_num_input_epsilons(__pyx_v_self, __pyx_v_state, 1); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 1579, __pyx_L1_error)\n  __pyx_t_2 = __Pyx_PyInt_FromSize_t(__pyx_t_1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1579, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  __pyx_r = __pyx_t_2;\n  __pyx_t_2 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_AddTraceback(\"pywrapfst._Fst.num_input_epsilons\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1601\n *     return result\n * \n *   cpdef size_t num_output_epsilons(self, int64 state) except *:             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     num_output_epsilons(self, state)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_29num_output_epsilons(PyObject *__pyx_v_self, PyObject *__pyx_arg_state); /*proto*/\nstatic size_t __pyx_f_9pywrapfst_4_Fst_num_output_epsilons(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self, __pyx_t_10basictypes_int64 __pyx_v_state, int __pyx_skip_dispatch) {\n  size_t __pyx_v_result;\n  size_t __pyx_r;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  PyObject *__pyx_t_6 = NULL;\n  size_t __pyx_t_7;\n  int __pyx_t_8;\n  __Pyx_RefNannySetupContext(\"num_output_epsilons\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_num_output_epsilons); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1601, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_4_Fst_29num_output_epsilons)) {\n      __pyx_t_3 = __Pyx_PyInt_From_int64_t(__pyx_v_state); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 1601, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_3);\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_4 = __pyx_t_1; __pyx_t_5 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_4))) {\n        __pyx_t_5 = PyMethod_GET_SELF(__pyx_t_4);\n        if (likely(__pyx_t_5)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_4);\n          __Pyx_INCREF(__pyx_t_5);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_4, function);\n        }\n      }\n      if (!__pyx_t_5) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_4, __pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1601, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n        __Pyx_GOTREF(__pyx_t_2);\n      } else {\n        #if CYTHON_FAST_PYCALL\n        if (PyFunction_Check(__pyx_t_4)) {\n          PyObject *__pyx_temp[2] = {__pyx_t_5, __pyx_t_3};\n          __pyx_t_2 = __Pyx_PyFunction_FastCall(__pyx_t_4, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1601, __pyx_L1_error)\n          __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;\n          __Pyx_GOTREF(__pyx_t_2);\n          __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n        } else\n        #endif\n        #if CYTHON_FAST_PYCCALL\n        if (__Pyx_PyFastCFunction_Check(__pyx_t_4)) {\n          PyObject *__pyx_temp[2] = {__pyx_t_5, __pyx_t_3};\n          __pyx_t_2 = __Pyx_PyCFunction_FastCall(__pyx_t_4, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1601, __pyx_L1_error)\n          __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;\n          __Pyx_GOTREF(__pyx_t_2);\n          __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n        } else\n        #endif\n        {\n          __pyx_t_6 = PyTuple_New(1+1); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 1601, __pyx_L1_error)\n          __Pyx_GOTREF(__pyx_t_6);\n          __Pyx_GIVEREF(__pyx_t_5); PyTuple_SET_ITEM(__pyx_t_6, 0, __pyx_t_5); __pyx_t_5 = NULL;\n          __Pyx_GIVEREF(__pyx_t_3);\n          PyTuple_SET_ITEM(__pyx_t_6, 0+1, __pyx_t_3);\n          __pyx_t_3 = 0;\n          __pyx_t_2 = __Pyx_PyObject_Call(__pyx_t_4, __pyx_t_6, NULL); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1601, __pyx_L1_error)\n          __Pyx_GOTREF(__pyx_t_2);\n          __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n        }\n      }\n      __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      __pyx_t_7 = __Pyx_PyInt_As_size_t(__pyx_t_2); if (unlikely((__pyx_t_7 == (size_t)-1) && PyErr_Occurred())) __PYX_ERR(0, 1601, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __pyx_r = __pyx_t_7;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":1618\n *     See also: `num_input_epsilons`.\n *     \"\"\"\n *     cdef size_t result = self._fst.get().NumOutputEpsilons(state)             # <<<<<<<<<<<<<<\n *     if result == SIZE_MAX:\n *       raise FstIndexError(\"State index out of range\")\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 1618, __pyx_L1_error)\n  }\n  __pyx_v_result = __pyx_v_self->_fst.get()->NumOutputEpsilons(__pyx_v_state);\n\n  /* \"pywrapfst.pyx\":1619\n *     \"\"\"\n *     cdef size_t result = self._fst.get().NumOutputEpsilons(state)\n *     if result == SIZE_MAX:             # <<<<<<<<<<<<<<\n *       raise FstIndexError(\"State index out of range\")\n *     return result\n */\n  __pyx_t_8 = ((__pyx_v_result == SIZE_MAX) != 0);\n  if (__pyx_t_8) {\n\n    /* \"pywrapfst.pyx\":1620\n *     cdef size_t result = self._fst.get().NumOutputEpsilons(state)\n *     if result == SIZE_MAX:\n *       raise FstIndexError(\"State index out of range\")             # <<<<<<<<<<<<<<\n *     return result\n * \n */\n    __pyx_t_1 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstIndexError); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1620, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    __pyx_t_2 = __Pyx_PyObject_Call(__pyx_t_1, __pyx_tuple__28, NULL); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1620, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_2);\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n    __Pyx_Raise(__pyx_t_2, 0, 0, 0);\n    __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n    __PYX_ERR(0, 1620, __pyx_L1_error)\n\n    /* \"pywrapfst.pyx\":1619\n *     \"\"\"\n *     cdef size_t result = self._fst.get().NumOutputEpsilons(state)\n *     if result == SIZE_MAX:             # <<<<<<<<<<<<<<\n *       raise FstIndexError(\"State index out of range\")\n *     return result\n */\n  }\n\n  /* \"pywrapfst.pyx\":1621\n *     if result == SIZE_MAX:\n *       raise FstIndexError(\"State index out of range\")\n *     return result             # <<<<<<<<<<<<<<\n * \n *   cpdef _FstSymbolTable output_symbols(self):\n */\n  __pyx_r = __pyx_v_result;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":1601\n *     return result\n * \n *   cpdef size_t num_output_epsilons(self, int64 state) except *:             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     num_output_epsilons(self, state)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_XDECREF(__pyx_t_6);\n  __Pyx_AddTraceback(\"pywrapfst._Fst.num_output_epsilons\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_29num_output_epsilons(PyObject *__pyx_v_self, PyObject *__pyx_arg_state); /*proto*/\nstatic char __pyx_doc_9pywrapfst_4_Fst_28num_output_epsilons[] = \"\\n    num_output_epsilons(self, state)\\n\\n    Returns the number of arcs with epsilon output labels leaving a state.\\n\\n    Args:\\n      state: The integer index of a state.\\n\\n    Returns:\\n      The number of epsilon-output-labeled arcs leaving that state.\\n\\n    Raises:\\n      FstIndexError: State index out of range.\\n\\n    See also: `num_input_epsilons`.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_29num_output_epsilons(PyObject *__pyx_v_self, PyObject *__pyx_arg_state) {\n  __pyx_t_10basictypes_int64 __pyx_v_state;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"num_output_epsilons (wrapper)\", 0);\n  assert(__pyx_arg_state); {\n    __pyx_v_state = __Pyx_PyInt_As_int64_t(__pyx_arg_state); if (unlikely((__pyx_v_state == ((int64_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 1601, __pyx_L3_error)\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst._Fst.num_output_epsilons\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  __pyx_r = __pyx_pf_9pywrapfst_4_Fst_28num_output_epsilons(((struct __pyx_obj_9pywrapfst__Fst *)__pyx_v_self), ((__pyx_t_10basictypes_int64)__pyx_v_state));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_4_Fst_28num_output_epsilons(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self, __pyx_t_10basictypes_int64 __pyx_v_state) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  size_t __pyx_t_1;\n  PyObject *__pyx_t_2 = NULL;\n  __Pyx_RefNannySetupContext(\"num_output_epsilons\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __pyx_f_9pywrapfst_4_Fst_num_output_epsilons(__pyx_v_self, __pyx_v_state, 1); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 1601, __pyx_L1_error)\n  __pyx_t_2 = __Pyx_PyInt_FromSize_t(__pyx_t_1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1601, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  __pyx_r = __pyx_t_2;\n  __pyx_t_2 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_AddTraceback(\"pywrapfst._Fst.num_output_epsilons\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1623\n *     return result\n * \n *   cpdef _FstSymbolTable output_symbols(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     output_symbols(self)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_31output_symbols(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic struct __pyx_obj_9pywrapfst__FstSymbolTable *__pyx_f_9pywrapfst_4_Fst_output_symbols(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self, int __pyx_skip_dispatch) {\n  fst::SymbolTable *__pyx_v_syms;\n  struct __pyx_obj_9pywrapfst__FstSymbolTable *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  int __pyx_t_5;\n  __Pyx_RefNannySetupContext(\"output_symbols\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_output_symbols); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1623, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_4_Fst_31output_symbols)) {\n      __Pyx_XDECREF(((PyObject *)__pyx_r));\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1623, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1623, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      if (!(likely(((__pyx_t_2) == Py_None) || likely(__Pyx_TypeTest(__pyx_t_2, __pyx_ptype_9pywrapfst__FstSymbolTable))))) __PYX_ERR(0, 1623, __pyx_L1_error)\n      __pyx_r = ((struct __pyx_obj_9pywrapfst__FstSymbolTable *)__pyx_t_2);\n      __pyx_t_2 = 0;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":1632\n *     \"\"\"\n *     cdef fst.SymbolTable *syms = const_cast[SymbolTable_ptr](\n *       self._fst.get().OutputSymbols())             # <<<<<<<<<<<<<<\n *     if syms == NULL:\n *       return\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 1632, __pyx_L1_error)\n  }\n\n  /* \"pywrapfst.pyx\":1631\n *     See also: `input_symbols`.\n *     \"\"\"\n *     cdef fst.SymbolTable *syms = const_cast[SymbolTable_ptr](             # <<<<<<<<<<<<<<\n *       self._fst.get().OutputSymbols())\n *     if syms == NULL:\n */\n  __pyx_v_syms = const_cast<__pyx_t_9pywrapfst_SymbolTable_ptr>(__pyx_v_self->_fst.get()->OutputSymbols());\n\n  /* \"pywrapfst.pyx\":1633\n *     cdef fst.SymbolTable *syms = const_cast[SymbolTable_ptr](\n *       self._fst.get().OutputSymbols())\n *     if syms == NULL:             # <<<<<<<<<<<<<<\n *       return\n *     return _init_FstSymbolTable(syms, self._fst)\n */\n  __pyx_t_5 = ((__pyx_v_syms == NULL) != 0);\n  if (__pyx_t_5) {\n\n    /* \"pywrapfst.pyx\":1634\n *       self._fst.get().OutputSymbols())\n *     if syms == NULL:\n *       return             # <<<<<<<<<<<<<<\n *     return _init_FstSymbolTable(syms, self._fst)\n * \n */\n    __Pyx_XDECREF(((PyObject *)__pyx_r));\n    __pyx_r = ((struct __pyx_obj_9pywrapfst__FstSymbolTable *)Py_None); __Pyx_INCREF(Py_None);\n    goto __pyx_L0;\n\n    /* \"pywrapfst.pyx\":1633\n *     cdef fst.SymbolTable *syms = const_cast[SymbolTable_ptr](\n *       self._fst.get().OutputSymbols())\n *     if syms == NULL:             # <<<<<<<<<<<<<<\n *       return\n *     return _init_FstSymbolTable(syms, self._fst)\n */\n  }\n\n  /* \"pywrapfst.pyx\":1635\n *     if syms == NULL:\n *       return\n *     return _init_FstSymbolTable(syms, self._fst)             # <<<<<<<<<<<<<<\n * \n *   cpdef uint64 properties(self, uint64 mask, bool test):\n */\n  __Pyx_XDECREF(((PyObject *)__pyx_r));\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 1635, __pyx_L1_error)\n  }\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst__init_FstSymbolTable(__pyx_v_syms, __pyx_v_self->_fst)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1635, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = ((struct __pyx_obj_9pywrapfst__FstSymbolTable *)__pyx_t_1);\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":1623\n *     return result\n * \n *   cpdef _FstSymbolTable output_symbols(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     output_symbols(self)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_AddTraceback(\"pywrapfst._Fst.output_symbols\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XGIVEREF((PyObject *)__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_31output_symbols(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_4_Fst_30output_symbols[] = \"\\n    output_symbols(self)\\n\\n    Returns the FST's output symbol table, or None if none is present.\\n\\n    See also: `input_symbols`.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_31output_symbols(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"output_symbols (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_4_Fst_30output_symbols(((struct __pyx_obj_9pywrapfst__Fst *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_4_Fst_30output_symbols(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"output_symbols\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst_4_Fst_output_symbols(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1623, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst._Fst.output_symbols\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1637\n *     return _init_FstSymbolTable(syms, self._fst)\n * \n *   cpdef uint64 properties(self, uint64 mask, bool test):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     properties(self, mask, test)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_33properties(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic __pyx_t_10basictypes_uint64 __pyx_f_9pywrapfst_4_Fst_properties(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self, __pyx_t_10basictypes_uint64 __pyx_v_mask, bool __pyx_v_test, int __pyx_skip_dispatch) {\n  __pyx_t_10basictypes_uint64 __pyx_r;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  PyObject *__pyx_t_6 = NULL;\n  int __pyx_t_7;\n  PyObject *__pyx_t_8 = NULL;\n  __pyx_t_10basictypes_uint64 __pyx_t_9;\n  __Pyx_RefNannySetupContext(\"properties\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_properties); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1637, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_4_Fst_33properties)) {\n      __pyx_t_3 = __Pyx_PyInt_From_uint64_t(__pyx_v_mask); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 1637, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_3);\n      __pyx_t_4 = __Pyx_PyBool_FromLong(__pyx_v_test); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 1637, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_4);\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_5 = __pyx_t_1; __pyx_t_6 = NULL;\n      __pyx_t_7 = 0;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_5))) {\n        __pyx_t_6 = PyMethod_GET_SELF(__pyx_t_5);\n        if (likely(__pyx_t_6)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_5);\n          __Pyx_INCREF(__pyx_t_6);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_5, function);\n          __pyx_t_7 = 1;\n        }\n      }\n      #if CYTHON_FAST_PYCALL\n      if (PyFunction_Check(__pyx_t_5)) {\n        PyObject *__pyx_temp[3] = {__pyx_t_6, __pyx_t_3, __pyx_t_4};\n        __pyx_t_2 = __Pyx_PyFunction_FastCall(__pyx_t_5, __pyx_temp+1-__pyx_t_7, 2+__pyx_t_7); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1637, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_6); __pyx_t_6 = 0;\n        __Pyx_GOTREF(__pyx_t_2);\n        __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else\n      #endif\n      #if CYTHON_FAST_PYCCALL\n      if (__Pyx_PyFastCFunction_Check(__pyx_t_5)) {\n        PyObject *__pyx_temp[3] = {__pyx_t_6, __pyx_t_3, __pyx_t_4};\n        __pyx_t_2 = __Pyx_PyCFunction_FastCall(__pyx_t_5, __pyx_temp+1-__pyx_t_7, 2+__pyx_t_7); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1637, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_6); __pyx_t_6 = 0;\n        __Pyx_GOTREF(__pyx_t_2);\n        __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else\n      #endif\n      {\n        __pyx_t_8 = PyTuple_New(2+__pyx_t_7); if (unlikely(!__pyx_t_8)) __PYX_ERR(0, 1637, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_8);\n        if (__pyx_t_6) {\n          __Pyx_GIVEREF(__pyx_t_6); PyTuple_SET_ITEM(__pyx_t_8, 0, __pyx_t_6); __pyx_t_6 = NULL;\n        }\n        __Pyx_GIVEREF(__pyx_t_3);\n        PyTuple_SET_ITEM(__pyx_t_8, 0+__pyx_t_7, __pyx_t_3);\n        __Pyx_GIVEREF(__pyx_t_4);\n        PyTuple_SET_ITEM(__pyx_t_8, 1+__pyx_t_7, __pyx_t_4);\n        __pyx_t_3 = 0;\n        __pyx_t_4 = 0;\n        __pyx_t_2 = __Pyx_PyObject_Call(__pyx_t_5, __pyx_t_8, NULL); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1637, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_2);\n        __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0;\n      }\n      __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n      __pyx_t_9 = __Pyx_PyInt_As_uint64_t(__pyx_t_2); if (unlikely((__pyx_t_9 == ((uint64_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 1637, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __pyx_r = __pyx_t_9;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":1655\n *       A 64-bit bitmask representing the requested properties.\n *     \"\"\"\n *     return self._fst.get().Properties(mask, test)             # <<<<<<<<<<<<<<\n * \n *   cpdef int64 start(self):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 1655, __pyx_L1_error)\n  }\n  __pyx_r = __pyx_v_self->_fst.get()->Properties(__pyx_v_mask, __pyx_v_test);\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":1637\n *     return _init_FstSymbolTable(syms, self._fst)\n * \n *   cpdef uint64 properties(self, uint64 mask, bool test):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     properties(self, mask, test)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_XDECREF(__pyx_t_6);\n  __Pyx_XDECREF(__pyx_t_8);\n  __Pyx_WriteUnraisable(\"pywrapfst._Fst.properties\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_33properties(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic char __pyx_doc_9pywrapfst_4_Fst_32properties[] = \"\\n    properties(self, mask, test)\\n\\n    Provides property bits.\\n\\n    This method provides user access to the properties attributes for the FST.\\n    The resulting value is a long integer, but when it is cast to a boolean,\\n    it represents whether or not the FST has the `mask` property.\\n\\n    Args:\\n      mask: The property mask to be compared to the FST's properties.\\n      test: Should any unknown values be computed before comparing against\\n          the mask?\\n\\n    Returns:\\n      A 64-bit bitmask representing the requested properties.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_33properties(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  __pyx_t_10basictypes_uint64 __pyx_v_mask;\n  bool __pyx_v_test;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"properties (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_mask,&__pyx_n_s_test,0};\n    PyObject* values[2] = {0,0};\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (likely((values[0] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_mask)) != 0)) kw_args--;\n        else goto __pyx_L5_argtuple_error;\n        CYTHON_FALLTHROUGH;\n        case  1:\n        if (likely((values[1] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_test)) != 0)) kw_args--;\n        else {\n          __Pyx_RaiseArgtupleInvalid(\"properties\", 1, 2, 2, 1); __PYX_ERR(0, 1637, __pyx_L3_error)\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"properties\") < 0)) __PYX_ERR(0, 1637, __pyx_L3_error)\n      }\n    } else if (PyTuple_GET_SIZE(__pyx_args) != 2) {\n      goto __pyx_L5_argtuple_error;\n    } else {\n      values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n      values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n    }\n    __pyx_v_mask = __Pyx_PyInt_As_uint64_t(values[0]); if (unlikely((__pyx_v_mask == ((uint64_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 1637, __pyx_L3_error)\n    __pyx_v_test = __Pyx_PyObject_IsTrue(values[1]); if (unlikely((__pyx_v_test == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 1637, __pyx_L3_error)\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"properties\", 1, 2, 2, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 1637, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst._Fst.properties\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  __pyx_r = __pyx_pf_9pywrapfst_4_Fst_32properties(((struct __pyx_obj_9pywrapfst__Fst *)__pyx_v_self), __pyx_v_mask, __pyx_v_test);\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_4_Fst_32properties(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self, __pyx_t_10basictypes_uint64 __pyx_v_mask, bool __pyx_v_test) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"properties\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(__pyx_f_9pywrapfst_4_Fst_properties(__pyx_v_self, __pyx_v_mask, __pyx_v_test, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1637, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst._Fst.properties\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1657\n *     return self._fst.get().Properties(mask, test)\n * \n *   cpdef int64 start(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     start(self)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_35start(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic __pyx_t_10basictypes_int64 __pyx_f_9pywrapfst_4_Fst_start(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self, int __pyx_skip_dispatch) {\n  __pyx_t_10basictypes_int64 __pyx_r;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  __pyx_t_10basictypes_int64 __pyx_t_5;\n  __Pyx_RefNannySetupContext(\"start\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_start); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1657, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_4_Fst_35start)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1657, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1657, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __pyx_t_5 = __Pyx_PyInt_As_int64_t(__pyx_t_2); if (unlikely((__pyx_t_5 == ((int64_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 1657, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __pyx_r = __pyx_t_5;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":1663\n *     Returns the start state.\n *     \"\"\"\n *     return self._fst.get().Start()             # <<<<<<<<<<<<<<\n * \n *   cpdef StateIterator states(self):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 1663, __pyx_L1_error)\n  }\n  __pyx_r = __pyx_v_self->_fst.get()->Start();\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":1657\n *     return self._fst.get().Properties(mask, test)\n * \n *   cpdef int64 start(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     start(self)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_WriteUnraisable(\"pywrapfst._Fst.start\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_35start(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_4_Fst_34start[] = \"\\n    start(self)\\n\\n    Returns the start state.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_35start(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"start (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_4_Fst_34start(((struct __pyx_obj_9pywrapfst__Fst *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_4_Fst_34start(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"start\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __Pyx_PyInt_From_int64_t(__pyx_f_9pywrapfst_4_Fst_start(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1657, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst._Fst.start\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1665\n *     return self._fst.get().Start()\n * \n *   cpdef StateIterator states(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     states(self)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_37states(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic struct __pyx_obj_9pywrapfst_StateIterator *__pyx_f_9pywrapfst_4_Fst_states(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self, int __pyx_skip_dispatch) {\n  struct __pyx_obj_9pywrapfst_StateIterator *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  __Pyx_RefNannySetupContext(\"states\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_states); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1665, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_4_Fst_37states)) {\n      __Pyx_XDECREF(((PyObject *)__pyx_r));\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1665, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1665, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      if (!(likely(((__pyx_t_2) == Py_None) || likely(__Pyx_TypeTest(__pyx_t_2, __pyx_ptype_9pywrapfst_StateIterator))))) __PYX_ERR(0, 1665, __pyx_L1_error)\n      __pyx_r = ((struct __pyx_obj_9pywrapfst_StateIterator *)__pyx_t_2);\n      __pyx_t_2 = 0;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":1676\n *     See also: `arcs`, `mutable_arcs`.\n *     \"\"\"\n *     return StateIterator(self)             # <<<<<<<<<<<<<<\n * \n *   cpdef string text(self, _SymbolTable isymbols=None,\n */\n  __Pyx_XDECREF(((PyObject *)__pyx_r));\n  __pyx_t_1 = PyTuple_New(1); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1676, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __Pyx_INCREF(((PyObject *)__pyx_v_self));\n  __Pyx_GIVEREF(((PyObject *)__pyx_v_self));\n  PyTuple_SET_ITEM(__pyx_t_1, 0, ((PyObject *)__pyx_v_self));\n  __pyx_t_2 = __Pyx_PyObject_Call(((PyObject *)__pyx_ptype_9pywrapfst_StateIterator), __pyx_t_1, NULL); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1676, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  __pyx_r = ((struct __pyx_obj_9pywrapfst_StateIterator *)__pyx_t_2);\n  __pyx_t_2 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":1665\n *     return self._fst.get().Start()\n * \n *   cpdef StateIterator states(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     states(self)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_AddTraceback(\"pywrapfst._Fst.states\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XGIVEREF((PyObject *)__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_37states(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_4_Fst_36states[] = \"\\n    states(self)\\n\\n    Returns an iterator over all states in the FST.\\n\\n    Returns:\\n      A StateIterator object for the FST.\\n\\n    See also: `arcs`, `mutable_arcs`.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_37states(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"states (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_4_Fst_36states(((struct __pyx_obj_9pywrapfst__Fst *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_4_Fst_36states(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"states\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst_4_Fst_states(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1665, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst._Fst.states\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1678\n *     return StateIterator(self)\n * \n *   cpdef string text(self, _SymbolTable isymbols=None,             # <<<<<<<<<<<<<<\n *       _SymbolTable osymbols=None, _SymbolTable ssymbols=None,\n *       bool acceptor=False, bool show_weight_one=False, missing_sym=b\"\"):\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_39text(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic std::string __pyx_f_9pywrapfst_4_Fst_text(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self, int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_4_Fst_text *__pyx_optional_args) {\n  struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_isymbols = ((struct __pyx_obj_9pywrapfst__SymbolTable *)Py_None);\n\n  /* \"pywrapfst.pyx\":1679\n * \n *   cpdef string text(self, _SymbolTable isymbols=None,\n *       _SymbolTable osymbols=None, _SymbolTable ssymbols=None,             # <<<<<<<<<<<<<<\n *       bool acceptor=False, bool show_weight_one=False, missing_sym=b\"\"):\n *     \"\"\"\n */\n  struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_osymbols = ((struct __pyx_obj_9pywrapfst__SymbolTable *)Py_None);\n  struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_ssymbols = ((struct __pyx_obj_9pywrapfst__SymbolTable *)Py_None);\n\n  /* \"pywrapfst.pyx\":1680\n *   cpdef string text(self, _SymbolTable isymbols=None,\n *       _SymbolTable osymbols=None, _SymbolTable ssymbols=None,\n *       bool acceptor=False, bool show_weight_one=False, missing_sym=b\"\"):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     text(self, isymbols=None, osymbols=None, ssymbols=None, acceptor=False,\n */\n  bool __pyx_v_acceptor = ((bool)0);\n  bool __pyx_v_show_weight_one = ((bool)0);\n  PyObject *__pyx_v_missing_sym = ((PyObject *)__pyx_kp_b__24);\n  fst::SymbolTable *__pyx_v_ssymbols_ptr;\n  std::stringstream __pyx_v_sstrm;\n  std::string __pyx_r;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  PyObject *__pyx_t_6 = NULL;\n  int __pyx_t_7;\n  PyObject *__pyx_t_8 = NULL;\n  std::string __pyx_t_9;\n  int __pyx_t_10;\n  int __pyx_t_11;\n  fst::SymbolTable *__pyx_t_12;\n  fst::SymbolTable const *__pyx_t_13;\n  fst::SymbolTable const *__pyx_t_14;\n  std::string __pyx_t_15;\n  __Pyx_RefNannySetupContext(\"text\", 0);\n  if (__pyx_optional_args) {\n    if (__pyx_optional_args->__pyx_n > 0) {\n      __pyx_v_isymbols = __pyx_optional_args->isymbols;\n      if (__pyx_optional_args->__pyx_n > 1) {\n        __pyx_v_osymbols = __pyx_optional_args->osymbols;\n        if (__pyx_optional_args->__pyx_n > 2) {\n          __pyx_v_ssymbols = __pyx_optional_args->ssymbols;\n          if (__pyx_optional_args->__pyx_n > 3) {\n            __pyx_v_acceptor = __pyx_optional_args->acceptor;\n            if (__pyx_optional_args->__pyx_n > 4) {\n              __pyx_v_show_weight_one = __pyx_optional_args->show_weight_one;\n              if (__pyx_optional_args->__pyx_n > 5) {\n                __pyx_v_missing_sym = __pyx_optional_args->missing_sym;\n              }\n            }\n          }\n        }\n      }\n    }\n  }\n\n  /* \"pywrapfst.pyx\":1678\n *     return StateIterator(self)\n * \n *   cpdef string text(self, _SymbolTable isymbols=None,             # <<<<<<<<<<<<<<\n *       _SymbolTable osymbols=None, _SymbolTable ssymbols=None,\n *       bool acceptor=False, bool show_weight_one=False, missing_sym=b\"\"):\n */\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_text); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1678, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_4_Fst_39text)) {\n      __pyx_t_3 = __Pyx_PyBool_FromLong(__pyx_v_acceptor); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 1678, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_3);\n      __pyx_t_4 = __Pyx_PyBool_FromLong(__pyx_v_show_weight_one); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 1678, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_4);\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_5 = __pyx_t_1; __pyx_t_6 = NULL;\n      __pyx_t_7 = 0;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_5))) {\n        __pyx_t_6 = PyMethod_GET_SELF(__pyx_t_5);\n        if (likely(__pyx_t_6)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_5);\n          __Pyx_INCREF(__pyx_t_6);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_5, function);\n          __pyx_t_7 = 1;\n        }\n      }\n      #if CYTHON_FAST_PYCALL\n      if (PyFunction_Check(__pyx_t_5)) {\n        PyObject *__pyx_temp[7] = {__pyx_t_6, ((PyObject *)__pyx_v_isymbols), ((PyObject *)__pyx_v_osymbols), ((PyObject *)__pyx_v_ssymbols), __pyx_t_3, __pyx_t_4, __pyx_v_missing_sym};\n        __pyx_t_2 = __Pyx_PyFunction_FastCall(__pyx_t_5, __pyx_temp+1-__pyx_t_7, 6+__pyx_t_7); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1678, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_6); __pyx_t_6 = 0;\n        __Pyx_GOTREF(__pyx_t_2);\n        __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else\n      #endif\n      #if CYTHON_FAST_PYCCALL\n      if (__Pyx_PyFastCFunction_Check(__pyx_t_5)) {\n        PyObject *__pyx_temp[7] = {__pyx_t_6, ((PyObject *)__pyx_v_isymbols), ((PyObject *)__pyx_v_osymbols), ((PyObject *)__pyx_v_ssymbols), __pyx_t_3, __pyx_t_4, __pyx_v_missing_sym};\n        __pyx_t_2 = __Pyx_PyCFunction_FastCall(__pyx_t_5, __pyx_temp+1-__pyx_t_7, 6+__pyx_t_7); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1678, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_6); __pyx_t_6 = 0;\n        __Pyx_GOTREF(__pyx_t_2);\n        __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else\n      #endif\n      {\n        __pyx_t_8 = PyTuple_New(6+__pyx_t_7); if (unlikely(!__pyx_t_8)) __PYX_ERR(0, 1678, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_8);\n        if (__pyx_t_6) {\n          __Pyx_GIVEREF(__pyx_t_6); PyTuple_SET_ITEM(__pyx_t_8, 0, __pyx_t_6); __pyx_t_6 = NULL;\n        }\n        __Pyx_INCREF(((PyObject *)__pyx_v_isymbols));\n        __Pyx_GIVEREF(((PyObject *)__pyx_v_isymbols));\n        PyTuple_SET_ITEM(__pyx_t_8, 0+__pyx_t_7, ((PyObject *)__pyx_v_isymbols));\n        __Pyx_INCREF(((PyObject *)__pyx_v_osymbols));\n        __Pyx_GIVEREF(((PyObject *)__pyx_v_osymbols));\n        PyTuple_SET_ITEM(__pyx_t_8, 1+__pyx_t_7, ((PyObject *)__pyx_v_osymbols));\n        __Pyx_INCREF(((PyObject *)__pyx_v_ssymbols));\n        __Pyx_GIVEREF(((PyObject *)__pyx_v_ssymbols));\n        PyTuple_SET_ITEM(__pyx_t_8, 2+__pyx_t_7, ((PyObject *)__pyx_v_ssymbols));\n        __Pyx_GIVEREF(__pyx_t_3);\n        PyTuple_SET_ITEM(__pyx_t_8, 3+__pyx_t_7, __pyx_t_3);\n        __Pyx_GIVEREF(__pyx_t_4);\n        PyTuple_SET_ITEM(__pyx_t_8, 4+__pyx_t_7, __pyx_t_4);\n        __Pyx_INCREF(__pyx_v_missing_sym);\n        __Pyx_GIVEREF(__pyx_v_missing_sym);\n        PyTuple_SET_ITEM(__pyx_t_8, 5+__pyx_t_7, __pyx_v_missing_sym);\n        __pyx_t_3 = 0;\n        __pyx_t_4 = 0;\n        __pyx_t_2 = __Pyx_PyObject_Call(__pyx_t_5, __pyx_t_8, NULL); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1678, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_2);\n        __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0;\n      }\n      __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n      __pyx_t_9 = __pyx_convert_string_from_py_std__in_string(__pyx_t_2); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 1678, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __pyx_r = __pyx_t_9;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":1703\n *     \"\"\"\n *     # Prints FST to stringstream, then returns resulting string.\n *     cdef fst.SymbolTable *ssymbols_ptr = NULL             # <<<<<<<<<<<<<<\n *     if ssymbols is not None:\n *       ssymbols_ptr = ssymbols._table\n */\n  __pyx_v_ssymbols_ptr = NULL;\n\n  /* \"pywrapfst.pyx\":1704\n *     # Prints FST to stringstream, then returns resulting string.\n *     cdef fst.SymbolTable *ssymbols_ptr = NULL\n *     if ssymbols is not None:             # <<<<<<<<<<<<<<\n *       ssymbols_ptr = ssymbols._table\n *     cdef stringstream sstrm\n */\n  __pyx_t_10 = (((PyObject *)__pyx_v_ssymbols) != Py_None);\n  __pyx_t_11 = (__pyx_t_10 != 0);\n  if (__pyx_t_11) {\n\n    /* \"pywrapfst.pyx\":1705\n *     cdef fst.SymbolTable *ssymbols_ptr = NULL\n *     if ssymbols is not None:\n *       ssymbols_ptr = ssymbols._table             # <<<<<<<<<<<<<<\n *     cdef stringstream sstrm\n *     fst.PrintFst(deref(self._fst), sstrm, b\"<pywrapfst>\",\n */\n    if (unlikely(((PyObject *)__pyx_v_ssymbols) == Py_None)) {\n      PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_table\");\n      __PYX_ERR(0, 1705, __pyx_L1_error)\n    }\n    __pyx_t_12 = __pyx_v_ssymbols->_table;\n    __pyx_v_ssymbols_ptr = __pyx_t_12;\n\n    /* \"pywrapfst.pyx\":1704\n *     # Prints FST to stringstream, then returns resulting string.\n *     cdef fst.SymbolTable *ssymbols_ptr = NULL\n *     if ssymbols is not None:             # <<<<<<<<<<<<<<\n *       ssymbols_ptr = ssymbols._table\n *     cdef stringstream sstrm\n */\n  }\n\n  /* \"pywrapfst.pyx\":1707\n *       ssymbols_ptr = ssymbols._table\n *     cdef stringstream sstrm\n *     fst.PrintFst(deref(self._fst), sstrm, b\"<pywrapfst>\",             # <<<<<<<<<<<<<<\n *         self._fst.get().InputSymbols() if isymbols is None\n *         else isymbols._table,\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 1707, __pyx_L1_error)\n  }\n  __pyx_t_9 = __pyx_convert_string_from_py_std__in_string(__pyx_kp_b_pywrapfst); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 1707, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":1708\n *     cdef stringstream sstrm\n *     fst.PrintFst(deref(self._fst), sstrm, b\"<pywrapfst>\",\n *         self._fst.get().InputSymbols() if isymbols is None             # <<<<<<<<<<<<<<\n *         else isymbols._table,\n *         self._fst.get().OutputSymbols() if osymbols is None\n */\n  __pyx_t_11 = (((PyObject *)__pyx_v_isymbols) == Py_None);\n  if ((__pyx_t_11 != 0)) {\n    if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n      PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n      __PYX_ERR(0, 1708, __pyx_L1_error)\n    }\n    __pyx_t_13 = __pyx_v_self->_fst.get()->InputSymbols();\n  } else {\n\n    /* \"pywrapfst.pyx\":1709\n *     fst.PrintFst(deref(self._fst), sstrm, b\"<pywrapfst>\",\n *         self._fst.get().InputSymbols() if isymbols is None\n *         else isymbols._table,             # <<<<<<<<<<<<<<\n *         self._fst.get().OutputSymbols() if osymbols is None\n *         else osymbols._table,\n */\n    if (unlikely(((PyObject *)__pyx_v_isymbols) == Py_None)) {\n      PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_table\");\n      __PYX_ERR(0, 1709, __pyx_L1_error)\n    }\n    __pyx_t_13 = __pyx_v_isymbols->_table;\n  }\n\n  /* \"pywrapfst.pyx\":1710\n *         self._fst.get().InputSymbols() if isymbols is None\n *         else isymbols._table,\n *         self._fst.get().OutputSymbols() if osymbols is None             # <<<<<<<<<<<<<<\n *         else osymbols._table,\n *         ssymbols_ptr, acceptor, show_weight_one, tostring(missing_sym))\n */\n  __pyx_t_11 = (((PyObject *)__pyx_v_osymbols) == Py_None);\n  if ((__pyx_t_11 != 0)) {\n    if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n      PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n      __PYX_ERR(0, 1710, __pyx_L1_error)\n    }\n    __pyx_t_14 = __pyx_v_self->_fst.get()->OutputSymbols();\n  } else {\n\n    /* \"pywrapfst.pyx\":1711\n *         else isymbols._table,\n *         self._fst.get().OutputSymbols() if osymbols is None\n *         else osymbols._table,             # <<<<<<<<<<<<<<\n *         ssymbols_ptr, acceptor, show_weight_one, tostring(missing_sym))\n *     return sstrm.str()\n */\n    if (unlikely(((PyObject *)__pyx_v_osymbols) == Py_None)) {\n      PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_table\");\n      __PYX_ERR(0, 1711, __pyx_L1_error)\n    }\n    __pyx_t_14 = __pyx_v_osymbols->_table;\n  }\n\n  /* \"pywrapfst.pyx\":1712\n *         self._fst.get().OutputSymbols() if osymbols is None\n *         else osymbols._table,\n *         ssymbols_ptr, acceptor, show_weight_one, tostring(missing_sym))             # <<<<<<<<<<<<<<\n *     return sstrm.str()\n * \n */\n  __pyx_t_15 = __pyx_f_9pywrapfst_tostring(__pyx_v_missing_sym, NULL); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 1712, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":1707\n *       ssymbols_ptr = ssymbols._table\n *     cdef stringstream sstrm\n *     fst.PrintFst(deref(self._fst), sstrm, b\"<pywrapfst>\",             # <<<<<<<<<<<<<<\n *         self._fst.get().InputSymbols() if isymbols is None\n *         else isymbols._table,\n */\n  fst::script::PrintFst((*__pyx_v_self->_fst), __pyx_v_sstrm, __pyx_t_9, __pyx_t_13, __pyx_t_14, __pyx_v_ssymbols_ptr, __pyx_v_acceptor, __pyx_v_show_weight_one, __pyx_t_15);\n\n  /* \"pywrapfst.pyx\":1713\n *         else osymbols._table,\n *         ssymbols_ptr, acceptor, show_weight_one, tostring(missing_sym))\n *     return sstrm.str()             # <<<<<<<<<<<<<<\n * \n *   cpdef bool verify(self):\n */\n  __pyx_r = __pyx_v_sstrm.str();\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":1678\n *     return StateIterator(self)\n * \n *   cpdef string text(self, _SymbolTable isymbols=None,             # <<<<<<<<<<<<<<\n *       _SymbolTable osymbols=None, _SymbolTable ssymbols=None,\n *       bool acceptor=False, bool show_weight_one=False, missing_sym=b\"\"):\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_XDECREF(__pyx_t_6);\n  __Pyx_XDECREF(__pyx_t_8);\n  __Pyx_WriteUnraisable(\"pywrapfst._Fst.text\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __Pyx_pretend_to_initialize(&__pyx_r);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_39text(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic char __pyx_doc_9pywrapfst_4_Fst_38text[] = \"\\n    text(self, isymbols=None, osymbols=None, ssymbols=None, acceptor=False,\\n         show_weight_one=False, missing_sym=\\\"\\\")\\n\\n    Produces a human-readable string representation of the FST.\\n\\n    This method generates a human-readable string representation of the FST.\\n    The caller may optionally specify SymbolTables used to label input labels,\\n    output labels, or state labels, respectively.\\n\\n    Args:\\n      isymbols: An optional symbol table used to label input symbols.\\n      osymbols: An optional symbol table used to label output symbols.\\n      ssymbols: An optional symbol table used to label states.\\n      acceptor: Should the FST be rendered in acceptor format if possible?\\n      show_weight_one: Should weights equivalent to semiring One be printed?\\n      missing_symbol: The string to be printed when symbol table lookup fails.\\n\\n    Returns:\\n      A formatted string representing the machine.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_39text(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_isymbols = 0;\n  struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_osymbols = 0;\n  struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_ssymbols = 0;\n  bool __pyx_v_acceptor;\n  bool __pyx_v_show_weight_one;\n  PyObject *__pyx_v_missing_sym = 0;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"text (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_isymbols,&__pyx_n_s_osymbols,&__pyx_n_s_ssymbols,&__pyx_n_s_acceptor,&__pyx_n_s_show_weight_one,&__pyx_n_s_missing_sym,0};\n    PyObject* values[6] = {0,0,0,0,0,0};\n    values[0] = (PyObject *)((struct __pyx_obj_9pywrapfst__SymbolTable *)Py_None);\n\n    /* \"pywrapfst.pyx\":1679\n * \n *   cpdef string text(self, _SymbolTable isymbols=None,\n *       _SymbolTable osymbols=None, _SymbolTable ssymbols=None,             # <<<<<<<<<<<<<<\n *       bool acceptor=False, bool show_weight_one=False, missing_sym=b\"\"):\n *     \"\"\"\n */\n    values[1] = (PyObject *)((struct __pyx_obj_9pywrapfst__SymbolTable *)Py_None);\n    values[2] = (PyObject *)((struct __pyx_obj_9pywrapfst__SymbolTable *)Py_None);\n    values[5] = ((PyObject *)__pyx_kp_b__24);\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  6: values[5] = PyTuple_GET_ITEM(__pyx_args, 5);\n        CYTHON_FALLTHROUGH;\n        case  5: values[4] = PyTuple_GET_ITEM(__pyx_args, 4);\n        CYTHON_FALLTHROUGH;\n        case  4: values[3] = PyTuple_GET_ITEM(__pyx_args, 3);\n        CYTHON_FALLTHROUGH;\n        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);\n        CYTHON_FALLTHROUGH;\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_isymbols);\n          if (value) { values[0] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  1:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_osymbols);\n          if (value) { values[1] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  2:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_ssymbols);\n          if (value) { values[2] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  3:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_acceptor);\n          if (value) { values[3] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  4:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_show_weight_one);\n          if (value) { values[4] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  5:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_missing_sym);\n          if (value) { values[5] = value; kw_args--; }\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"text\") < 0)) __PYX_ERR(0, 1678, __pyx_L3_error)\n      }\n    } else {\n      switch (PyTuple_GET_SIZE(__pyx_args)) {\n        case  6: values[5] = PyTuple_GET_ITEM(__pyx_args, 5);\n        CYTHON_FALLTHROUGH;\n        case  5: values[4] = PyTuple_GET_ITEM(__pyx_args, 4);\n        CYTHON_FALLTHROUGH;\n        case  4: values[3] = PyTuple_GET_ITEM(__pyx_args, 3);\n        CYTHON_FALLTHROUGH;\n        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);\n        CYTHON_FALLTHROUGH;\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n    }\n    __pyx_v_isymbols = ((struct __pyx_obj_9pywrapfst__SymbolTable *)values[0]);\n    __pyx_v_osymbols = ((struct __pyx_obj_9pywrapfst__SymbolTable *)values[1]);\n    __pyx_v_ssymbols = ((struct __pyx_obj_9pywrapfst__SymbolTable *)values[2]);\n    if (values[3]) {\n      __pyx_v_acceptor = __Pyx_PyObject_IsTrue(values[3]); if (unlikely((__pyx_v_acceptor == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 1680, __pyx_L3_error)\n    } else {\n\n      /* \"pywrapfst.pyx\":1680\n *   cpdef string text(self, _SymbolTable isymbols=None,\n *       _SymbolTable osymbols=None, _SymbolTable ssymbols=None,\n *       bool acceptor=False, bool show_weight_one=False, missing_sym=b\"\"):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     text(self, isymbols=None, osymbols=None, ssymbols=None, acceptor=False,\n */\n      __pyx_v_acceptor = ((bool)0);\n    }\n    if (values[4]) {\n      __pyx_v_show_weight_one = __Pyx_PyObject_IsTrue(values[4]); if (unlikely((__pyx_v_show_weight_one == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 1680, __pyx_L3_error)\n    } else {\n      __pyx_v_show_weight_one = ((bool)0);\n    }\n    __pyx_v_missing_sym = values[5];\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"text\", 0, 0, 6, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 1678, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst._Fst.text\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_isymbols), __pyx_ptype_9pywrapfst__SymbolTable, 1, \"isymbols\", 0))) __PYX_ERR(0, 1678, __pyx_L1_error)\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_osymbols), __pyx_ptype_9pywrapfst__SymbolTable, 1, \"osymbols\", 0))) __PYX_ERR(0, 1679, __pyx_L1_error)\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_ssymbols), __pyx_ptype_9pywrapfst__SymbolTable, 1, \"ssymbols\", 0))) __PYX_ERR(0, 1679, __pyx_L1_error)\n  __pyx_r = __pyx_pf_9pywrapfst_4_Fst_38text(((struct __pyx_obj_9pywrapfst__Fst *)__pyx_v_self), __pyx_v_isymbols, __pyx_v_osymbols, __pyx_v_ssymbols, __pyx_v_acceptor, __pyx_v_show_weight_one, __pyx_v_missing_sym);\n\n  /* \"pywrapfst.pyx\":1678\n *     return StateIterator(self)\n * \n *   cpdef string text(self, _SymbolTable isymbols=None,             # <<<<<<<<<<<<<<\n *       _SymbolTable osymbols=None, _SymbolTable ssymbols=None,\n *       bool acceptor=False, bool show_weight_one=False, missing_sym=b\"\"):\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_4_Fst_38text(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self, struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_isymbols, struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_osymbols, struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_ssymbols, bool __pyx_v_acceptor, bool __pyx_v_show_weight_one, PyObject *__pyx_v_missing_sym) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  std::string __pyx_t_1;\n  struct __pyx_opt_args_9pywrapfst_4_Fst_text __pyx_t_2;\n  PyObject *__pyx_t_3 = NULL;\n  __Pyx_RefNannySetupContext(\"text\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_2.__pyx_n = 6;\n  __pyx_t_2.isymbols = __pyx_v_isymbols;\n  __pyx_t_2.osymbols = __pyx_v_osymbols;\n  __pyx_t_2.ssymbols = __pyx_v_ssymbols;\n  __pyx_t_2.acceptor = __pyx_v_acceptor;\n  __pyx_t_2.show_weight_one = __pyx_v_show_weight_one;\n  __pyx_t_2.missing_sym = __pyx_v_missing_sym;\n  __pyx_t_1 = __pyx_vtabptr_9pywrapfst__Fst->text(__pyx_v_self, 1, &__pyx_t_2); \n  __pyx_t_3 = __pyx_convert_PyBytes_string_to_py_std__in_string(__pyx_t_1); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 1678, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_3);\n  __pyx_r = __pyx_t_3;\n  __pyx_t_3 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_AddTraceback(\"pywrapfst._Fst.text\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1715\n *     return sstrm.str()\n * \n *   cpdef bool verify(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     verify(self)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_41verify(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic bool __pyx_f_9pywrapfst_4_Fst_verify(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self, int __pyx_skip_dispatch) {\n  bool __pyx_r;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  bool __pyx_t_5;\n  __Pyx_RefNannySetupContext(\"verify\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_verify); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1715, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_4_Fst_41verify)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1715, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1715, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __pyx_t_5 = __Pyx_PyObject_IsTrue(__pyx_t_2); if (unlikely((__pyx_t_5 == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 1715, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __pyx_r = __pyx_t_5;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":1724\n *       True if the contents are sane, False otherwise.\n *     \"\"\"\n *     return fst.Verify(deref(self._fst))             # <<<<<<<<<<<<<<\n * \n *   cpdef string weight_type(self):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 1724, __pyx_L1_error)\n  }\n  __pyx_r = fst::script::Verify((*__pyx_v_self->_fst));\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":1715\n *     return sstrm.str()\n * \n *   cpdef bool verify(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     verify(self)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_WriteUnraisable(\"pywrapfst._Fst.verify\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_41verify(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_4_Fst_40verify[] = \"\\n    verify(self)\\n\\n    Verifies that an FST's contents are sane.\\n\\n    Returns:\\n      True if the contents are sane, False otherwise.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_41verify(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"verify (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_4_Fst_40verify(((struct __pyx_obj_9pywrapfst__Fst *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_4_Fst_40verify(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"verify\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __Pyx_PyBool_FromLong(__pyx_f_9pywrapfst_4_Fst_verify(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1715, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst._Fst.verify\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1726\n *     return fst.Verify(deref(self._fst))\n * \n *   cpdef string weight_type(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     weight_type(self)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_43weight_type(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic std::string __pyx_f_9pywrapfst_4_Fst_weight_type(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self, int __pyx_skip_dispatch) {\n  std::string __pyx_r;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  std::string __pyx_t_5;\n  __Pyx_RefNannySetupContext(\"weight_type\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_weight_type); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1726, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_4_Fst_43weight_type)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1726, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1726, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __pyx_t_5 = __pyx_convert_string_from_py_std__in_string(__pyx_t_2); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 1726, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __pyx_r = __pyx_t_5;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":1735\n *       A string representing the weight type.\n *     \"\"\"\n *     return self._fst.get().WeightType()             # <<<<<<<<<<<<<<\n * \n *   cpdef void write(self, filename) except *:\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 1735, __pyx_L1_error)\n  }\n  __pyx_r = __pyx_v_self->_fst.get()->WeightType();\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":1726\n *     return fst.Verify(deref(self._fst))\n * \n *   cpdef string weight_type(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     weight_type(self)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_WriteUnraisable(\"pywrapfst._Fst.weight_type\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __Pyx_pretend_to_initialize(&__pyx_r);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_43weight_type(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_4_Fst_42weight_type[] = \"\\n    weight_type(self)\\n\\n    Provides the FST's weight type.\\n\\n    Returns:\\n      A string representing the weight type.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_43weight_type(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"weight_type (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_4_Fst_42weight_type(((struct __pyx_obj_9pywrapfst__Fst *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_4_Fst_42weight_type(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"weight_type\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __pyx_convert_PyBytes_string_to_py_std__in_string(__pyx_f_9pywrapfst_4_Fst_weight_type(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1726, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst._Fst.weight_type\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1737\n *     return self._fst.get().WeightType()\n * \n *   cpdef void write(self, filename) except *:             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     write(self, filename)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_45write(PyObject *__pyx_v_self, PyObject *__pyx_v_filename); /*proto*/\nstatic void __pyx_f_9pywrapfst_4_Fst_write(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self, PyObject *__pyx_v_filename, int __pyx_skip_dispatch) {\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  std::string __pyx_t_6;\n  int __pyx_t_7;\n  PyObject *__pyx_t_8 = NULL;\n  __Pyx_RefNannySetupContext(\"write\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_write); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1737, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_4_Fst_45write)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (!__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_v_filename); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1737, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_2);\n      } else {\n        #if CYTHON_FAST_PYCALL\n        if (PyFunction_Check(__pyx_t_3)) {\n          PyObject *__pyx_temp[2] = {__pyx_t_4, __pyx_v_filename};\n          __pyx_t_2 = __Pyx_PyFunction_FastCall(__pyx_t_3, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1737, __pyx_L1_error)\n          __Pyx_XDECREF(__pyx_t_4); __pyx_t_4 = 0;\n          __Pyx_GOTREF(__pyx_t_2);\n        } else\n        #endif\n        #if CYTHON_FAST_PYCCALL\n        if (__Pyx_PyFastCFunction_Check(__pyx_t_3)) {\n          PyObject *__pyx_temp[2] = {__pyx_t_4, __pyx_v_filename};\n          __pyx_t_2 = __Pyx_PyCFunction_FastCall(__pyx_t_3, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1737, __pyx_L1_error)\n          __Pyx_XDECREF(__pyx_t_4); __pyx_t_4 = 0;\n          __Pyx_GOTREF(__pyx_t_2);\n        } else\n        #endif\n        {\n          __pyx_t_5 = PyTuple_New(1+1); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 1737, __pyx_L1_error)\n          __Pyx_GOTREF(__pyx_t_5);\n          __Pyx_GIVEREF(__pyx_t_4); PyTuple_SET_ITEM(__pyx_t_5, 0, __pyx_t_4); __pyx_t_4 = NULL;\n          __Pyx_INCREF(__pyx_v_filename);\n          __Pyx_GIVEREF(__pyx_v_filename);\n          PyTuple_SET_ITEM(__pyx_t_5, 0+1, __pyx_v_filename);\n          __pyx_t_2 = __Pyx_PyObject_Call(__pyx_t_3, __pyx_t_5, NULL); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1737, __pyx_L1_error)\n          __Pyx_GOTREF(__pyx_t_2);\n          __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n        }\n      }\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":1751\n *       FstIOError: Write failed.\n *     \"\"\"\n *     if not self._fst.get().Write(tostring(filename)):             # <<<<<<<<<<<<<<\n *       raise FstIOError(\"Write failed: {!r}\".format(filename))\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 1751, __pyx_L1_error)\n  }\n  __pyx_t_6 = __pyx_f_9pywrapfst_tostring(__pyx_v_filename, NULL); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 1751, __pyx_L1_error)\n  __pyx_t_7 = ((!(__pyx_v_self->_fst.get()->Write(__pyx_t_6) != 0)) != 0);\n  if (__pyx_t_7) {\n\n    /* \"pywrapfst.pyx\":1752\n *     \"\"\"\n *     if not self._fst.get().Write(tostring(filename)):\n *       raise FstIOError(\"Write failed: {!r}\".format(filename))             # <<<<<<<<<<<<<<\n * \n *   cpdef string write_to_string(self):\n */\n    __pyx_t_2 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstIOError); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1752, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_2);\n    __pyx_t_5 = __Pyx_PyObject_GetAttrStr(__pyx_kp_s_Write_failed_r, __pyx_n_s_format); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 1752, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_5);\n    __pyx_t_4 = NULL;\n    if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_5))) {\n      __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_5);\n      if (likely(__pyx_t_4)) {\n        PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_5);\n        __Pyx_INCREF(__pyx_t_4);\n        __Pyx_INCREF(function);\n        __Pyx_DECREF_SET(__pyx_t_5, function);\n      }\n    }\n    if (!__pyx_t_4) {\n      __pyx_t_3 = __Pyx_PyObject_CallOneArg(__pyx_t_5, __pyx_v_filename); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 1752, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_3);\n    } else {\n      #if CYTHON_FAST_PYCALL\n      if (PyFunction_Check(__pyx_t_5)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_4, __pyx_v_filename};\n        __pyx_t_3 = __Pyx_PyFunction_FastCall(__pyx_t_5, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 1752, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_4); __pyx_t_4 = 0;\n        __Pyx_GOTREF(__pyx_t_3);\n      } else\n      #endif\n      #if CYTHON_FAST_PYCCALL\n      if (__Pyx_PyFastCFunction_Check(__pyx_t_5)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_4, __pyx_v_filename};\n        __pyx_t_3 = __Pyx_PyCFunction_FastCall(__pyx_t_5, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 1752, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_4); __pyx_t_4 = 0;\n        __Pyx_GOTREF(__pyx_t_3);\n      } else\n      #endif\n      {\n        __pyx_t_8 = PyTuple_New(1+1); if (unlikely(!__pyx_t_8)) __PYX_ERR(0, 1752, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_8);\n        __Pyx_GIVEREF(__pyx_t_4); PyTuple_SET_ITEM(__pyx_t_8, 0, __pyx_t_4); __pyx_t_4 = NULL;\n        __Pyx_INCREF(__pyx_v_filename);\n        __Pyx_GIVEREF(__pyx_v_filename);\n        PyTuple_SET_ITEM(__pyx_t_8, 0+1, __pyx_v_filename);\n        __pyx_t_3 = __Pyx_PyObject_Call(__pyx_t_5, __pyx_t_8, NULL); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 1752, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_3);\n        __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0;\n      }\n    }\n    __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n    __pyx_t_5 = NULL;\n    if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_2))) {\n      __pyx_t_5 = PyMethod_GET_SELF(__pyx_t_2);\n      if (likely(__pyx_t_5)) {\n        PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_2);\n        __Pyx_INCREF(__pyx_t_5);\n        __Pyx_INCREF(function);\n        __Pyx_DECREF_SET(__pyx_t_2, function);\n      }\n    }\n    if (!__pyx_t_5) {\n      __pyx_t_1 = __Pyx_PyObject_CallOneArg(__pyx_t_2, __pyx_t_3); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1752, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __Pyx_GOTREF(__pyx_t_1);\n    } else {\n      #if CYTHON_FAST_PYCALL\n      if (PyFunction_Check(__pyx_t_2)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_5, __pyx_t_3};\n        __pyx_t_1 = __Pyx_PyFunction_FastCall(__pyx_t_2, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1752, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;\n        __Pyx_GOTREF(__pyx_t_1);\n        __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      } else\n      #endif\n      #if CYTHON_FAST_PYCCALL\n      if (__Pyx_PyFastCFunction_Check(__pyx_t_2)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_5, __pyx_t_3};\n        __pyx_t_1 = __Pyx_PyCFunction_FastCall(__pyx_t_2, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1752, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;\n        __Pyx_GOTREF(__pyx_t_1);\n        __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      } else\n      #endif\n      {\n        __pyx_t_8 = PyTuple_New(1+1); if (unlikely(!__pyx_t_8)) __PYX_ERR(0, 1752, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_8);\n        __Pyx_GIVEREF(__pyx_t_5); PyTuple_SET_ITEM(__pyx_t_8, 0, __pyx_t_5); __pyx_t_5 = NULL;\n        __Pyx_GIVEREF(__pyx_t_3);\n        PyTuple_SET_ITEM(__pyx_t_8, 0+1, __pyx_t_3);\n        __pyx_t_3 = 0;\n        __pyx_t_1 = __Pyx_PyObject_Call(__pyx_t_2, __pyx_t_8, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1752, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_1);\n        __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0;\n      }\n    }\n    __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n    __Pyx_Raise(__pyx_t_1, 0, 0, 0);\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n    __PYX_ERR(0, 1752, __pyx_L1_error)\n\n    /* \"pywrapfst.pyx\":1751\n *       FstIOError: Write failed.\n *     \"\"\"\n *     if not self._fst.get().Write(tostring(filename)):             # <<<<<<<<<<<<<<\n *       raise FstIOError(\"Write failed: {!r}\".format(filename))\n * \n */\n  }\n\n  /* \"pywrapfst.pyx\":1737\n *     return self._fst.get().WeightType()\n * \n *   cpdef void write(self, filename) except *:             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     write(self, filename)\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_XDECREF(__pyx_t_8);\n  __Pyx_AddTraceback(\"pywrapfst._Fst.write\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_45write(PyObject *__pyx_v_self, PyObject *__pyx_v_filename); /*proto*/\nstatic char __pyx_doc_9pywrapfst_4_Fst_44write[] = \"\\n    write(self, filename)\\n\\n    Serializes FST to a file.\\n\\n    This method writes the FST to a file in a binary format.\\n\\n    Args:\\n      filename: The string location of the output file.\\n\\n    Raises:\\n      FstIOError: Write failed.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_45write(PyObject *__pyx_v_self, PyObject *__pyx_v_filename) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"write (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_4_Fst_44write(((struct __pyx_obj_9pywrapfst__Fst *)__pyx_v_self), ((PyObject *)__pyx_v_filename));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_4_Fst_44write(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self, PyObject *__pyx_v_filename) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"write\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_f_9pywrapfst_4_Fst_write(__pyx_v_self, __pyx_v_filename, 1); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 1737, __pyx_L1_error)\n  __pyx_t_1 = __Pyx_void_to_None(NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1737, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst._Fst.write\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1754\n *       raise FstIOError(\"Write failed: {!r}\".format(filename))\n * \n *   cpdef string write_to_string(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     write_to_string(self)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_47write_to_string(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic std::string __pyx_f_9pywrapfst_4_Fst_write_to_string(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self, int __pyx_skip_dispatch) {\n  std::stringstream __pyx_v_sstrm;\n  std::string __pyx_r;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  std::string __pyx_t_5;\n  int __pyx_t_6;\n  __Pyx_RefNannySetupContext(\"write_to_string\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_write_to_string); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1754, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_4_Fst_47write_to_string)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1754, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1754, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __pyx_t_5 = __pyx_convert_string_from_py_std__in_string(__pyx_t_2); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 1754, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __pyx_r = __pyx_t_5;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":1769\n *     \"\"\"\n *     cdef stringstream sstrm\n *     if not self._fst.get().Write(sstrm, \"write_to_string\"):             # <<<<<<<<<<<<<<\n *       raise FstIOError(\"Write to string failed\")\n *     return sstrm.str()\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 1769, __pyx_L1_error)\n  }\n  __pyx_t_5 = __pyx_convert_string_from_py_std__in_string(__pyx_n_b_write_to_string); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 1769, __pyx_L1_error)\n  __pyx_t_6 = ((!(__pyx_v_self->_fst.get()->Write(__pyx_v_sstrm, __pyx_t_5) != 0)) != 0);\n  if (__pyx_t_6) {\n\n    /* \"pywrapfst.pyx\":1770\n *     cdef stringstream sstrm\n *     if not self._fst.get().Write(sstrm, \"write_to_string\"):\n *       raise FstIOError(\"Write to string failed\")             # <<<<<<<<<<<<<<\n *     return sstrm.str()\n * \n */\n    __pyx_t_1 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstIOError); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1770, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    __pyx_t_2 = __Pyx_PyObject_Call(__pyx_t_1, __pyx_tuple__29, NULL); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1770, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_2);\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n    __Pyx_Raise(__pyx_t_2, 0, 0, 0);\n    __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n    __PYX_ERR(0, 1770, __pyx_L1_error)\n\n    /* \"pywrapfst.pyx\":1769\n *     \"\"\"\n *     cdef stringstream sstrm\n *     if not self._fst.get().Write(sstrm, \"write_to_string\"):             # <<<<<<<<<<<<<<\n *       raise FstIOError(\"Write to string failed\")\n *     return sstrm.str()\n */\n  }\n\n  /* \"pywrapfst.pyx\":1771\n *     if not self._fst.get().Write(sstrm, \"write_to_string\"):\n *       raise FstIOError(\"Write to string failed\")\n *     return sstrm.str()             # <<<<<<<<<<<<<<\n * \n * \n */\n  __pyx_r = __pyx_v_sstrm.str();\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":1754\n *       raise FstIOError(\"Write failed: {!r}\".format(filename))\n * \n *   cpdef string write_to_string(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     write_to_string(self)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_WriteUnraisable(\"pywrapfst._Fst.write_to_string\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __Pyx_pretend_to_initialize(&__pyx_r);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_47write_to_string(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_4_Fst_46write_to_string[] = \"\\n    write_to_string(self)\\n\\n    Serializes FST to a string.\\n\\n    Returns:\\n      A string.\\n\\n    Raises:\\n      FstIOError: Write to string failed.\\n\\n    See also: `read_from_string`.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_47write_to_string(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"write_to_string (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_4_Fst_46write_to_string(((struct __pyx_obj_9pywrapfst__Fst *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_4_Fst_46write_to_string(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"write_to_string\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __pyx_convert_PyBytes_string_to_py_std__in_string(__pyx_f_9pywrapfst_4_Fst_write_to_string(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1754, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst._Fst.write_to_string\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1784\n *   \"\"\"\n * \n *   cdef void _check_mutating_imethod(self) except *:             # <<<<<<<<<<<<<<\n *     \"\"\"Checks whether an operation mutating the FST has produced an error.\n * \n */\n\nstatic void __pyx_f_9pywrapfst_11_MutableFst__check_mutating_imethod(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self) {\n  __Pyx_RefNannyDeclarations\n  int __pyx_t_1;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  __Pyx_RefNannySetupContext(\"_check_mutating_imethod\", 0);\n\n  /* \"pywrapfst.pyx\":1789\n *     This function is not visible to Python users.\n *     \"\"\"\n *     if self._fst.get().Properties(fst.kError, True) == fst.kError:             # <<<<<<<<<<<<<<\n *       raise FstOpError(\"Operation failed\")\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 1789, __pyx_L1_error)\n  }\n  __pyx_t_1 = ((__pyx_v_self->__pyx_base._fst.get()->Properties(fst::kError, 1) == fst::kError) != 0);\n  if (__pyx_t_1) {\n\n    /* \"pywrapfst.pyx\":1790\n *     \"\"\"\n *     if self._fst.get().Properties(fst.kError, True) == fst.kError:\n *       raise FstOpError(\"Operation failed\")             # <<<<<<<<<<<<<<\n * \n *   cdef void _add_arc(self, int64 state, Arc arc) except *:\n */\n    __pyx_t_2 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstOpError); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1790, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_2);\n    __pyx_t_3 = __Pyx_PyObject_Call(__pyx_t_2, __pyx_tuple__30, NULL); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 1790, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_3);\n    __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n    __Pyx_Raise(__pyx_t_3, 0, 0, 0);\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    __PYX_ERR(0, 1790, __pyx_L1_error)\n\n    /* \"pywrapfst.pyx\":1789\n *     This function is not visible to Python users.\n *     \"\"\"\n *     if self._fst.get().Properties(fst.kError, True) == fst.kError:             # <<<<<<<<<<<<<<\n *       raise FstOpError(\"Operation failed\")\n * \n */\n  }\n\n  /* \"pywrapfst.pyx\":1784\n *   \"\"\"\n * \n *   cdef void _check_mutating_imethod(self) except *:             # <<<<<<<<<<<<<<\n *     \"\"\"Checks whether an operation mutating the FST has produced an error.\n * \n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst._check_mutating_imethod\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n}\n\n/* \"pywrapfst.pyx\":1792\n *       raise FstOpError(\"Operation failed\")\n * \n *   cdef void _add_arc(self, int64 state, Arc arc) except *:             # <<<<<<<<<<<<<<\n *     if not self._fst.get().ValidStateId(state):\n *       raise FstIndexError(\"State index out of range\")\n */\n\nstatic void __pyx_f_9pywrapfst_11_MutableFst__add_arc(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, __pyx_t_10basictypes_int64 __pyx_v_state, struct __pyx_obj_9pywrapfst_Arc *__pyx_v_arc) {\n  __Pyx_RefNannyDeclarations\n  int __pyx_t_1;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  __Pyx_RefNannySetupContext(\"_add_arc\", 0);\n\n  /* \"pywrapfst.pyx\":1793\n * \n *   cdef void _add_arc(self, int64 state, Arc arc) except *:\n *     if not self._fst.get().ValidStateId(state):             # <<<<<<<<<<<<<<\n *       raise FstIndexError(\"State index out of range\")\n *     if not self._mfst.get().AddArc(state, deref(arc._arc)):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 1793, __pyx_L1_error)\n  }\n  __pyx_t_1 = ((!(__pyx_v_self->__pyx_base._fst.get()->ValidStateId(__pyx_v_state) != 0)) != 0);\n  if (__pyx_t_1) {\n\n    /* \"pywrapfst.pyx\":1794\n *   cdef void _add_arc(self, int64 state, Arc arc) except *:\n *     if not self._fst.get().ValidStateId(state):\n *       raise FstIndexError(\"State index out of range\")             # <<<<<<<<<<<<<<\n *     if not self._mfst.get().AddArc(state, deref(arc._arc)):\n *       raise FstOpError(\"Incompatible or invalid weight type\")\n */\n    __pyx_t_2 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstIndexError); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1794, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_2);\n    __pyx_t_3 = __Pyx_PyObject_Call(__pyx_t_2, __pyx_tuple__31, NULL); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 1794, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_3);\n    __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n    __Pyx_Raise(__pyx_t_3, 0, 0, 0);\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    __PYX_ERR(0, 1794, __pyx_L1_error)\n\n    /* \"pywrapfst.pyx\":1793\n * \n *   cdef void _add_arc(self, int64 state, Arc arc) except *:\n *     if not self._fst.get().ValidStateId(state):             # <<<<<<<<<<<<<<\n *       raise FstIndexError(\"State index out of range\")\n *     if not self._mfst.get().AddArc(state, deref(arc._arc)):\n */\n  }\n\n  /* \"pywrapfst.pyx\":1795\n *     if not self._fst.get().ValidStateId(state):\n *       raise FstIndexError(\"State index out of range\")\n *     if not self._mfst.get().AddArc(state, deref(arc._arc)):             # <<<<<<<<<<<<<<\n *       raise FstOpError(\"Incompatible or invalid weight type\")\n *     self._check_mutating_imethod()\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_mfst\");\n    __PYX_ERR(0, 1795, __pyx_L1_error)\n  }\n  if (unlikely(((PyObject *)__pyx_v_arc) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_arc\");\n    __PYX_ERR(0, 1795, __pyx_L1_error)\n  }\n  __pyx_t_1 = ((!(__pyx_v_self->_mfst.get()->AddArc(__pyx_v_state, (*__pyx_v_arc->_arc)) != 0)) != 0);\n  if (__pyx_t_1) {\n\n    /* \"pywrapfst.pyx\":1796\n *       raise FstIndexError(\"State index out of range\")\n *     if not self._mfst.get().AddArc(state, deref(arc._arc)):\n *       raise FstOpError(\"Incompatible or invalid weight type\")             # <<<<<<<<<<<<<<\n *     self._check_mutating_imethod()\n * \n */\n    __pyx_t_3 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstOpError); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 1796, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_3);\n    __pyx_t_2 = __Pyx_PyObject_Call(__pyx_t_3, __pyx_tuple__32, NULL); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1796, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_2);\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    __Pyx_Raise(__pyx_t_2, 0, 0, 0);\n    __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n    __PYX_ERR(0, 1796, __pyx_L1_error)\n\n    /* \"pywrapfst.pyx\":1795\n *     if not self._fst.get().ValidStateId(state):\n *       raise FstIndexError(\"State index out of range\")\n *     if not self._mfst.get().AddArc(state, deref(arc._arc)):             # <<<<<<<<<<<<<<\n *       raise FstOpError(\"Incompatible or invalid weight type\")\n *     self._check_mutating_imethod()\n */\n  }\n\n  /* \"pywrapfst.pyx\":1797\n *     if not self._mfst.get().AddArc(state, deref(arc._arc)):\n *       raise FstOpError(\"Incompatible or invalid weight type\")\n *     self._check_mutating_imethod()             # <<<<<<<<<<<<<<\n * \n *   def add_arc(self, int64 state, Arc arc):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_check_mutating_imethod\");\n    __PYX_ERR(0, 1797, __pyx_L1_error)\n  }\n  ((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->_check_mutating_imethod(__pyx_v_self); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 1797, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":1792\n *       raise FstOpError(\"Operation failed\")\n * \n *   cdef void _add_arc(self, int64 state, Arc arc) except *:             # <<<<<<<<<<<<<<\n *     if not self._fst.get().ValidStateId(state):\n *       raise FstIndexError(\"State index out of range\")\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst._add_arc\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n}\n\n/* \"pywrapfst.pyx\":1799\n *     self._check_mutating_imethod()\n * \n *   def add_arc(self, int64 state, Arc arc):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     add_arc(self, state, arc)\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_1add_arc(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic char __pyx_doc_9pywrapfst_11_MutableFst_add_arc[] = \"\\n    add_arc(self, state, arc)\\n\\n    Adds a new arc to the FST and return self.\\n\\n    Args:\\n      state: The integer index of the source state.\\n      arc: The arc to add.\\n\\n    Returns:\\n      self.\\n\\n    Raises:\\n      FstIndexError: State index out of range.\\n      FstOpdexError: Incompatible or invalid weight type.\\n\\n    See also: `add_state`.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_1add_arc(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  __pyx_t_10basictypes_int64 __pyx_v_state;\n  struct __pyx_obj_9pywrapfst_Arc *__pyx_v_arc = 0;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"add_arc (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_state,&__pyx_n_s_arc,0};\n    PyObject* values[2] = {0,0};\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (likely((values[0] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_state)) != 0)) kw_args--;\n        else goto __pyx_L5_argtuple_error;\n        CYTHON_FALLTHROUGH;\n        case  1:\n        if (likely((values[1] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_arc)) != 0)) kw_args--;\n        else {\n          __Pyx_RaiseArgtupleInvalid(\"add_arc\", 1, 2, 2, 1); __PYX_ERR(0, 1799, __pyx_L3_error)\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"add_arc\") < 0)) __PYX_ERR(0, 1799, __pyx_L3_error)\n      }\n    } else if (PyTuple_GET_SIZE(__pyx_args) != 2) {\n      goto __pyx_L5_argtuple_error;\n    } else {\n      values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n      values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n    }\n    __pyx_v_state = __Pyx_PyInt_As_int64_t(values[0]); if (unlikely((__pyx_v_state == ((int64_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 1799, __pyx_L3_error)\n    __pyx_v_arc = ((struct __pyx_obj_9pywrapfst_Arc *)values[1]);\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"add_arc\", 1, 2, 2, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 1799, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst.add_arc\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_arc), __pyx_ptype_9pywrapfst_Arc, 1, \"arc\", 0))) __PYX_ERR(0, 1799, __pyx_L1_error)\n  __pyx_r = __pyx_pf_9pywrapfst_11_MutableFst_add_arc(((struct __pyx_obj_9pywrapfst__MutableFst *)__pyx_v_self), __pyx_v_state, __pyx_v_arc);\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_add_arc(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, __pyx_t_10basictypes_int64 __pyx_v_state, struct __pyx_obj_9pywrapfst_Arc *__pyx_v_arc) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"add_arc\", 0);\n\n  /* \"pywrapfst.pyx\":1818\n *     See also: `add_state`.\n *     \"\"\"\n *     self._add_arc(state, arc)             # <<<<<<<<<<<<<<\n *     return self\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_add_arc\");\n    __PYX_ERR(0, 1818, __pyx_L1_error)\n  }\n  ((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->_add_arc(__pyx_v_self, __pyx_v_state, __pyx_v_arc); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 1818, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":1819\n *     \"\"\"\n *     self._add_arc(state, arc)\n *     return self             # <<<<<<<<<<<<<<\n * \n *   cpdef int64 add_state(self) except *:\n */\n  __Pyx_XDECREF(__pyx_r);\n  __Pyx_INCREF(((PyObject *)__pyx_v_self));\n  __pyx_r = ((PyObject *)__pyx_v_self);\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":1799\n *     self._check_mutating_imethod()\n * \n *   def add_arc(self, int64 state, Arc arc):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     add_arc(self, state, arc)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst.add_arc\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1821\n *     return self\n * \n *   cpdef int64 add_state(self) except *:             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     add_state(self)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_3add_state(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic __pyx_t_10basictypes_int64 __pyx_f_9pywrapfst_11_MutableFst_add_state(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, int __pyx_skip_dispatch) {\n  __pyx_t_10basictypes_int64 __pyx_v_result;\n  __pyx_t_10basictypes_int64 __pyx_r;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  __pyx_t_10basictypes_int64 __pyx_t_5;\n  __Pyx_RefNannySetupContext(\"add_state\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_add_state); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1821, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_11_MutableFst_3add_state)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1821, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1821, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __pyx_t_5 = __Pyx_PyInt_As_int64_t(__pyx_t_2); if (unlikely((__pyx_t_5 == ((int64_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 1821, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __pyx_r = __pyx_t_5;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":1832\n *     See also: `add_arc`, `set_start`, `set_final`.\n *     \"\"\"\n *     cdef int64 result = self._mfst.get().AddState()             # <<<<<<<<<<<<<<\n *     self._check_mutating_imethod()\n *     return result\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_mfst\");\n    __PYX_ERR(0, 1832, __pyx_L1_error)\n  }\n  __pyx_v_result = __pyx_v_self->_mfst.get()->AddState();\n\n  /* \"pywrapfst.pyx\":1833\n *     \"\"\"\n *     cdef int64 result = self._mfst.get().AddState()\n *     self._check_mutating_imethod()             # <<<<<<<<<<<<<<\n *     return result\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_check_mutating_imethod\");\n    __PYX_ERR(0, 1833, __pyx_L1_error)\n  }\n  ((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->_check_mutating_imethod(__pyx_v_self); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 1833, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":1834\n *     cdef int64 result = self._mfst.get().AddState()\n *     self._check_mutating_imethod()\n *     return result             # <<<<<<<<<<<<<<\n * \n *   cdef void _arcsort(self, sort_type=b\"ilabel\") except *:\n */\n  __pyx_r = __pyx_v_result;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":1821\n *     return self\n * \n *   cpdef int64 add_state(self) except *:             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     add_state(self)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst.add_state\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_3add_state(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_11_MutableFst_2add_state[] = \"\\n    add_state(self)\\n\\n    Adds a new state to the FST and returns the state ID.\\n\\n    Returns:\\n      The integer index of the new state.\\n\\n    See also: `add_arc`, `set_start`, `set_final`.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_3add_state(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"add_state (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_11_MutableFst_2add_state(((struct __pyx_obj_9pywrapfst__MutableFst *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_2add_state(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  __pyx_t_10basictypes_int64 __pyx_t_1;\n  PyObject *__pyx_t_2 = NULL;\n  __Pyx_RefNannySetupContext(\"add_state\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __pyx_f_9pywrapfst_11_MutableFst_add_state(__pyx_v_self, 1); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 1821, __pyx_L1_error)\n  __pyx_t_2 = __Pyx_PyInt_From_int64_t(__pyx_t_1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1821, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  __pyx_r = __pyx_t_2;\n  __pyx_t_2 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst.add_state\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1836\n *     return result\n * \n *   cdef void _arcsort(self, sort_type=b\"ilabel\") except *:             # <<<<<<<<<<<<<<\n *     cdef fst.ArcSortType sort_type_enum\n *     if not fst.GetArcSortType(tostring(sort_type), addr(sort_type_enum)):\n */\n\nstatic void __pyx_f_9pywrapfst_11_MutableFst__arcsort(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, struct __pyx_opt_args_9pywrapfst_11_MutableFst__arcsort *__pyx_optional_args) {\n  PyObject *__pyx_v_sort_type = ((PyObject *)__pyx_n_b_ilabel);\n  enum fst::script::ArcSortType __pyx_v_sort_type_enum;\n  __Pyx_RefNannyDeclarations\n  std::string __pyx_t_1;\n  int __pyx_t_2;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  PyObject *__pyx_t_6 = NULL;\n  PyObject *__pyx_t_7 = NULL;\n  PyObject *__pyx_t_8 = NULL;\n  __Pyx_RefNannySetupContext(\"_arcsort\", 0);\n  if (__pyx_optional_args) {\n    if (__pyx_optional_args->__pyx_n > 0) {\n      __pyx_v_sort_type = __pyx_optional_args->sort_type;\n    }\n  }\n\n  /* \"pywrapfst.pyx\":1838\n *   cdef void _arcsort(self, sort_type=b\"ilabel\") except *:\n *     cdef fst.ArcSortType sort_type_enum\n *     if not fst.GetArcSortType(tostring(sort_type), addr(sort_type_enum)):             # <<<<<<<<<<<<<<\n *       raise FstArgError(\"Unknown sort type {!r}\".format(sort_type))\n *     fst.ArcSort(self._mfst.get(), sort_type_enum)\n */\n  __pyx_t_1 = __pyx_f_9pywrapfst_tostring(__pyx_v_sort_type, NULL); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 1838, __pyx_L1_error)\n  __pyx_t_2 = ((!(fst::script::GetArcSortType(__pyx_t_1, (&__pyx_v_sort_type_enum)) != 0)) != 0);\n  if (__pyx_t_2) {\n\n    /* \"pywrapfst.pyx\":1839\n *     cdef fst.ArcSortType sort_type_enum\n *     if not fst.GetArcSortType(tostring(sort_type), addr(sort_type_enum)):\n *       raise FstArgError(\"Unknown sort type {!r}\".format(sort_type))             # <<<<<<<<<<<<<<\n *     fst.ArcSort(self._mfst.get(), sort_type_enum)\n *     self._check_mutating_imethod()\n */\n    __pyx_t_4 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstArgError); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 1839, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_4);\n    __pyx_t_6 = __Pyx_PyObject_GetAttrStr(__pyx_kp_s_Unknown_sort_type_r, __pyx_n_s_format); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 1839, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_6);\n    __pyx_t_7 = NULL;\n    if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_6))) {\n      __pyx_t_7 = PyMethod_GET_SELF(__pyx_t_6);\n      if (likely(__pyx_t_7)) {\n        PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_6);\n        __Pyx_INCREF(__pyx_t_7);\n        __Pyx_INCREF(function);\n        __Pyx_DECREF_SET(__pyx_t_6, function);\n      }\n    }\n    if (!__pyx_t_7) {\n      __pyx_t_5 = __Pyx_PyObject_CallOneArg(__pyx_t_6, __pyx_v_sort_type); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 1839, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_5);\n    } else {\n      #if CYTHON_FAST_PYCALL\n      if (PyFunction_Check(__pyx_t_6)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_7, __pyx_v_sort_type};\n        __pyx_t_5 = __Pyx_PyFunction_FastCall(__pyx_t_6, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 1839, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_7); __pyx_t_7 = 0;\n        __Pyx_GOTREF(__pyx_t_5);\n      } else\n      #endif\n      #if CYTHON_FAST_PYCCALL\n      if (__Pyx_PyFastCFunction_Check(__pyx_t_6)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_7, __pyx_v_sort_type};\n        __pyx_t_5 = __Pyx_PyCFunction_FastCall(__pyx_t_6, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 1839, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_7); __pyx_t_7 = 0;\n        __Pyx_GOTREF(__pyx_t_5);\n      } else\n      #endif\n      {\n        __pyx_t_8 = PyTuple_New(1+1); if (unlikely(!__pyx_t_8)) __PYX_ERR(0, 1839, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_8);\n        __Pyx_GIVEREF(__pyx_t_7); PyTuple_SET_ITEM(__pyx_t_8, 0, __pyx_t_7); __pyx_t_7 = NULL;\n        __Pyx_INCREF(__pyx_v_sort_type);\n        __Pyx_GIVEREF(__pyx_v_sort_type);\n        PyTuple_SET_ITEM(__pyx_t_8, 0+1, __pyx_v_sort_type);\n        __pyx_t_5 = __Pyx_PyObject_Call(__pyx_t_6, __pyx_t_8, NULL); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 1839, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_5);\n        __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0;\n      }\n    }\n    __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n    __pyx_t_6 = NULL;\n    if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_4))) {\n      __pyx_t_6 = PyMethod_GET_SELF(__pyx_t_4);\n      if (likely(__pyx_t_6)) {\n        PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_4);\n        __Pyx_INCREF(__pyx_t_6);\n        __Pyx_INCREF(function);\n        __Pyx_DECREF_SET(__pyx_t_4, function);\n      }\n    }\n    if (!__pyx_t_6) {\n      __pyx_t_3 = __Pyx_PyObject_CallOneArg(__pyx_t_4, __pyx_t_5); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 1839, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n      __Pyx_GOTREF(__pyx_t_3);\n    } else {\n      #if CYTHON_FAST_PYCALL\n      if (PyFunction_Check(__pyx_t_4)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_6, __pyx_t_5};\n        __pyx_t_3 = __Pyx_PyFunction_FastCall(__pyx_t_4, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 1839, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_6); __pyx_t_6 = 0;\n        __Pyx_GOTREF(__pyx_t_3);\n        __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n      } else\n      #endif\n      #if CYTHON_FAST_PYCCALL\n      if (__Pyx_PyFastCFunction_Check(__pyx_t_4)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_6, __pyx_t_5};\n        __pyx_t_3 = __Pyx_PyCFunction_FastCall(__pyx_t_4, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 1839, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_6); __pyx_t_6 = 0;\n        __Pyx_GOTREF(__pyx_t_3);\n        __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n      } else\n      #endif\n      {\n        __pyx_t_8 = PyTuple_New(1+1); if (unlikely(!__pyx_t_8)) __PYX_ERR(0, 1839, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_8);\n        __Pyx_GIVEREF(__pyx_t_6); PyTuple_SET_ITEM(__pyx_t_8, 0, __pyx_t_6); __pyx_t_6 = NULL;\n        __Pyx_GIVEREF(__pyx_t_5);\n        PyTuple_SET_ITEM(__pyx_t_8, 0+1, __pyx_t_5);\n        __pyx_t_5 = 0;\n        __pyx_t_3 = __Pyx_PyObject_Call(__pyx_t_4, __pyx_t_8, NULL); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 1839, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_3);\n        __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0;\n      }\n    }\n    __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n    __Pyx_Raise(__pyx_t_3, 0, 0, 0);\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    __PYX_ERR(0, 1839, __pyx_L1_error)\n\n    /* \"pywrapfst.pyx\":1838\n *   cdef void _arcsort(self, sort_type=b\"ilabel\") except *:\n *     cdef fst.ArcSortType sort_type_enum\n *     if not fst.GetArcSortType(tostring(sort_type), addr(sort_type_enum)):             # <<<<<<<<<<<<<<\n *       raise FstArgError(\"Unknown sort type {!r}\".format(sort_type))\n *     fst.ArcSort(self._mfst.get(), sort_type_enum)\n */\n  }\n\n  /* \"pywrapfst.pyx\":1840\n *     if not fst.GetArcSortType(tostring(sort_type), addr(sort_type_enum)):\n *       raise FstArgError(\"Unknown sort type {!r}\".format(sort_type))\n *     fst.ArcSort(self._mfst.get(), sort_type_enum)             # <<<<<<<<<<<<<<\n *     self._check_mutating_imethod()\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_mfst\");\n    __PYX_ERR(0, 1840, __pyx_L1_error)\n  }\n  fst::script::ArcSort(__pyx_v_self->_mfst.get(), __pyx_v_sort_type_enum);\n\n  /* \"pywrapfst.pyx\":1841\n *       raise FstArgError(\"Unknown sort type {!r}\".format(sort_type))\n *     fst.ArcSort(self._mfst.get(), sort_type_enum)\n *     self._check_mutating_imethod()             # <<<<<<<<<<<<<<\n * \n *   def arcsort(self, sort_type=b\"ilabel\"):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_check_mutating_imethod\");\n    __PYX_ERR(0, 1841, __pyx_L1_error)\n  }\n  ((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->_check_mutating_imethod(__pyx_v_self); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 1841, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":1836\n *     return result\n * \n *   cdef void _arcsort(self, sort_type=b\"ilabel\") except *:             # <<<<<<<<<<<<<<\n *     cdef fst.ArcSortType sort_type_enum\n *     if not fst.GetArcSortType(tostring(sort_type), addr(sort_type_enum)):\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_XDECREF(__pyx_t_6);\n  __Pyx_XDECREF(__pyx_t_7);\n  __Pyx_XDECREF(__pyx_t_8);\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst._arcsort\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n}\n\n/* \"pywrapfst.pyx\":1843\n *     self._check_mutating_imethod()\n * \n *   def arcsort(self, sort_type=b\"ilabel\"):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     arcsort(self, sort_type=\"ilabel\")\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_5arcsort(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic char __pyx_doc_9pywrapfst_11_MutableFst_4arcsort[] = \"\\n    arcsort(self, sort_type=\\\"ilabel\\\")\\n\\n    Sorts arcs leaving each state of the FST.\\n\\n    This operation destructively sorts arcs leaving each state using either\\n    input or output labels.\\n\\n    Args:\\n      sort_type: Either \\\"ilabel\\\" (sort arcs according to input labels) or\\n          \\\"olabel\\\" (sort arcs according to output labels).\\n\\n    Returns:\\n      self.\\n\\n    Raises:\\n      FstArgError: Unknown sort type.\\n\\n    See also: `topsort`.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_5arcsort(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  PyObject *__pyx_v_sort_type = 0;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"arcsort (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_sort_type,0};\n    PyObject* values[1] = {0};\n    values[0] = ((PyObject *)__pyx_n_b_ilabel);\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_sort_type);\n          if (value) { values[0] = value; kw_args--; }\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"arcsort\") < 0)) __PYX_ERR(0, 1843, __pyx_L3_error)\n      }\n    } else {\n      switch (PyTuple_GET_SIZE(__pyx_args)) {\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n    }\n    __pyx_v_sort_type = values[0];\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"arcsort\", 0, 0, 1, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 1843, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst.arcsort\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  __pyx_r = __pyx_pf_9pywrapfst_11_MutableFst_4arcsort(((struct __pyx_obj_9pywrapfst__MutableFst *)__pyx_v_self), __pyx_v_sort_type);\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_4arcsort(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, PyObject *__pyx_v_sort_type) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  struct __pyx_opt_args_9pywrapfst_11_MutableFst__arcsort __pyx_t_1;\n  __Pyx_RefNannySetupContext(\"arcsort\", 0);\n\n  /* \"pywrapfst.pyx\":1864\n *     See also: `topsort`.\n *     \"\"\"\n *     self._arcsort(sort_type)             # <<<<<<<<<<<<<<\n *     return self\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_arcsort\");\n    __PYX_ERR(0, 1864, __pyx_L1_error)\n  }\n  __pyx_t_1.__pyx_n = 1;\n  __pyx_t_1.sort_type = __pyx_v_sort_type;\n  ((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->_arcsort(__pyx_v_self, &__pyx_t_1); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 1864, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":1865\n *     \"\"\"\n *     self._arcsort(sort_type)\n *     return self             # <<<<<<<<<<<<<<\n * \n *   cdef void _closure(self, bool closure_plus=False) except *:\n */\n  __Pyx_XDECREF(__pyx_r);\n  __Pyx_INCREF(((PyObject *)__pyx_v_self));\n  __pyx_r = ((PyObject *)__pyx_v_self);\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":1843\n *     self._check_mutating_imethod()\n * \n *   def arcsort(self, sort_type=b\"ilabel\"):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     arcsort(self, sort_type=\"ilabel\")\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst.arcsort\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1867\n *     return self\n * \n *   cdef void _closure(self, bool closure_plus=False) except *:             # <<<<<<<<<<<<<<\n *     fst.Closure(self._mfst.get(), fst.GetClosureType(closure_plus))\n *     self._check_mutating_imethod()\n */\n\nstatic void __pyx_f_9pywrapfst_11_MutableFst__closure(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, struct __pyx_opt_args_9pywrapfst_11_MutableFst__closure *__pyx_optional_args) {\n  bool __pyx_v_closure_plus = ((bool)0);\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"_closure\", 0);\n  if (__pyx_optional_args) {\n    if (__pyx_optional_args->__pyx_n > 0) {\n      __pyx_v_closure_plus = __pyx_optional_args->closure_plus;\n    }\n  }\n\n  /* \"pywrapfst.pyx\":1868\n * \n *   cdef void _closure(self, bool closure_plus=False) except *:\n *     fst.Closure(self._mfst.get(), fst.GetClosureType(closure_plus))             # <<<<<<<<<<<<<<\n *     self._check_mutating_imethod()\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_mfst\");\n    __PYX_ERR(0, 1868, __pyx_L1_error)\n  }\n  fst::script::Closure(__pyx_v_self->_mfst.get(), fst::script::GetClosureType(__pyx_v_closure_plus));\n\n  /* \"pywrapfst.pyx\":1869\n *   cdef void _closure(self, bool closure_plus=False) except *:\n *     fst.Closure(self._mfst.get(), fst.GetClosureType(closure_plus))\n *     self._check_mutating_imethod()             # <<<<<<<<<<<<<<\n * \n *   def closure(self, bool closure_plus=False):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_check_mutating_imethod\");\n    __PYX_ERR(0, 1869, __pyx_L1_error)\n  }\n  ((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->_check_mutating_imethod(__pyx_v_self); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 1869, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":1867\n *     return self\n * \n *   cdef void _closure(self, bool closure_plus=False) except *:             # <<<<<<<<<<<<<<\n *     fst.Closure(self._mfst.get(), fst.GetClosureType(closure_plus))\n *     self._check_mutating_imethod()\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst._closure\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n}\n\n/* \"pywrapfst.pyx\":1871\n *     self._check_mutating_imethod()\n * \n *   def closure(self, bool closure_plus=False):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     closure(self, closure_plus=False)\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_7closure(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic char __pyx_doc_9pywrapfst_11_MutableFst_6closure[] = \"\\n    closure(self, closure_plus=False)\\n\\n    Computes concatenative closure.\\n\\n    This operation destructively converts the FST to its concatenative closure.\\n    If A transduces string x to y with weight a, then the closure transduces x\\n    to y with weight a, xx to yy with weight a \\\\otimes a, xxx to yyy with weight\\n    a \\\\otimes a \\\\otimes a, and so on. The empty string is also transduced to\\n    itself with semiring One if `closure_plus` is False.\\n\\n    Args:\\n      closure_plus: If False, do not accept the empty string.\\n\\n    Returns:\\n      self.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_7closure(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  bool __pyx_v_closure_plus;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"closure (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_closure_plus,0};\n    PyObject* values[1] = {0};\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_closure_plus);\n          if (value) { values[0] = value; kw_args--; }\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"closure\") < 0)) __PYX_ERR(0, 1871, __pyx_L3_error)\n      }\n    } else {\n      switch (PyTuple_GET_SIZE(__pyx_args)) {\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n    }\n    if (values[0]) {\n      __pyx_v_closure_plus = __Pyx_PyObject_IsTrue(values[0]); if (unlikely((__pyx_v_closure_plus == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 1871, __pyx_L3_error)\n    } else {\n      __pyx_v_closure_plus = ((bool)0);\n    }\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"closure\", 0, 0, 1, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 1871, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst.closure\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  __pyx_r = __pyx_pf_9pywrapfst_11_MutableFst_6closure(((struct __pyx_obj_9pywrapfst__MutableFst *)__pyx_v_self), __pyx_v_closure_plus);\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_6closure(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, bool __pyx_v_closure_plus) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  struct __pyx_opt_args_9pywrapfst_11_MutableFst__closure __pyx_t_1;\n  __Pyx_RefNannySetupContext(\"closure\", 0);\n\n  /* \"pywrapfst.pyx\":1889\n *       self.\n *     \"\"\"\n *     self._closure(closure_plus)             # <<<<<<<<<<<<<<\n *     return self\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_closure\");\n    __PYX_ERR(0, 1889, __pyx_L1_error)\n  }\n  __pyx_t_1.__pyx_n = 1;\n  __pyx_t_1.closure_plus = __pyx_v_closure_plus;\n  ((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->_closure(__pyx_v_self, &__pyx_t_1); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 1889, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":1890\n *     \"\"\"\n *     self._closure(closure_plus)\n *     return self             # <<<<<<<<<<<<<<\n * \n *   cdef void _concat(self, _Fst ifst) except *:\n */\n  __Pyx_XDECREF(__pyx_r);\n  __Pyx_INCREF(((PyObject *)__pyx_v_self));\n  __pyx_r = ((PyObject *)__pyx_v_self);\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":1871\n *     self._check_mutating_imethod()\n * \n *   def closure(self, bool closure_plus=False):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     closure(self, closure_plus=False)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst.closure\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1892\n *     return self\n * \n *   cdef void _concat(self, _Fst ifst) except *:             # <<<<<<<<<<<<<<\n *     fst.Concat(self._mfst.get(), deref(ifst._fst))\n *     self._check_mutating_imethod()\n */\n\nstatic void __pyx_f_9pywrapfst_11_MutableFst__concat(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst) {\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"_concat\", 0);\n\n  /* \"pywrapfst.pyx\":1893\n * \n *   cdef void _concat(self, _Fst ifst) except *:\n *     fst.Concat(self._mfst.get(), deref(ifst._fst))             # <<<<<<<<<<<<<<\n *     self._check_mutating_imethod()\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_mfst\");\n    __PYX_ERR(0, 1893, __pyx_L1_error)\n  }\n  if (unlikely(((PyObject *)__pyx_v_ifst) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 1893, __pyx_L1_error)\n  }\n  fst::script::Concat(__pyx_v_self->_mfst.get(), (*__pyx_v_ifst->_fst));\n\n  /* \"pywrapfst.pyx\":1894\n *   cdef void _concat(self, _Fst ifst) except *:\n *     fst.Concat(self._mfst.get(), deref(ifst._fst))\n *     self._check_mutating_imethod()             # <<<<<<<<<<<<<<\n * \n *   def concat(self, _Fst ifst):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_check_mutating_imethod\");\n    __PYX_ERR(0, 1894, __pyx_L1_error)\n  }\n  ((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->_check_mutating_imethod(__pyx_v_self); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 1894, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":1892\n *     return self\n * \n *   cdef void _concat(self, _Fst ifst) except *:             # <<<<<<<<<<<<<<\n *     fst.Concat(self._mfst.get(), deref(ifst._fst))\n *     self._check_mutating_imethod()\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst._concat\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n}\n\n/* \"pywrapfst.pyx\":1896\n *     self._check_mutating_imethod()\n * \n *   def concat(self, _Fst ifst):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     concat(self, ifst)\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_9concat(PyObject *__pyx_v_self, PyObject *__pyx_v_ifst); /*proto*/\nstatic char __pyx_doc_9pywrapfst_11_MutableFst_8concat[] = \"\\n    concat(self, ifst)\\n\\n    Computes the concatenation (product) of two FSTs.\\n\\n    This operation destructively concatenates the FST with a second FST. If A\\n    transduces string x to y with weight a and B transduces string w to v with\\n    weight b, then their concatenation transduces string xw to yv with weight a\\n    \\\\otimes b.\\n\\n    Args:\\n      ifst: The second input FST.\\n\\n    Returns:\\n      self.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_9concat(PyObject *__pyx_v_self, PyObject *__pyx_v_ifst) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"concat (wrapper)\", 0);\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_ifst), __pyx_ptype_9pywrapfst__Fst, 1, \"ifst\", 0))) __PYX_ERR(0, 1896, __pyx_L1_error)\n  __pyx_r = __pyx_pf_9pywrapfst_11_MutableFst_8concat(((struct __pyx_obj_9pywrapfst__MutableFst *)__pyx_v_self), ((struct __pyx_obj_9pywrapfst__Fst *)__pyx_v_ifst));\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_8concat(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"concat\", 0);\n\n  /* \"pywrapfst.pyx\":1913\n *       self.\n *     \"\"\"\n *     self._concat(ifst)             # <<<<<<<<<<<<<<\n *     return self\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_concat\");\n    __PYX_ERR(0, 1913, __pyx_L1_error)\n  }\n  ((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->_concat(__pyx_v_self, __pyx_v_ifst); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 1913, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":1914\n *     \"\"\"\n *     self._concat(ifst)\n *     return self             # <<<<<<<<<<<<<<\n * \n *   cdef void _connect(self) except *:\n */\n  __Pyx_XDECREF(__pyx_r);\n  __Pyx_INCREF(((PyObject *)__pyx_v_self));\n  __pyx_r = ((PyObject *)__pyx_v_self);\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":1896\n *     self._check_mutating_imethod()\n * \n *   def concat(self, _Fst ifst):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     concat(self, ifst)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst.concat\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1916\n *     return self\n * \n *   cdef void _connect(self) except *:             # <<<<<<<<<<<<<<\n *     fst.Connect(self._mfst.get())\n *     self._check_mutating_imethod()\n */\n\nstatic void __pyx_f_9pywrapfst_11_MutableFst__connect(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self) {\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"_connect\", 0);\n\n  /* \"pywrapfst.pyx\":1917\n * \n *   cdef void _connect(self) except *:\n *     fst.Connect(self._mfst.get())             # <<<<<<<<<<<<<<\n *     self._check_mutating_imethod()\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_mfst\");\n    __PYX_ERR(0, 1917, __pyx_L1_error)\n  }\n  fst::script::Connect(__pyx_v_self->_mfst.get());\n\n  /* \"pywrapfst.pyx\":1918\n *   cdef void _connect(self) except *:\n *     fst.Connect(self._mfst.get())\n *     self._check_mutating_imethod()             # <<<<<<<<<<<<<<\n * \n *   def connect(self):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_check_mutating_imethod\");\n    __PYX_ERR(0, 1918, __pyx_L1_error)\n  }\n  ((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->_check_mutating_imethod(__pyx_v_self); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 1918, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":1916\n *     return self\n * \n *   cdef void _connect(self) except *:             # <<<<<<<<<<<<<<\n *     fst.Connect(self._mfst.get())\n *     self._check_mutating_imethod()\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst._connect\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n}\n\n/* \"pywrapfst.pyx\":1920\n *     self._check_mutating_imethod()\n * \n *   def connect(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     connect(self)\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_11connect(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_11_MutableFst_10connect[] = \"\\n    connect(self)\\n\\n    Removes unsuccessful paths.\\n\\n    This operation destructively trims the FST, removing states and arcs that\\n    are not part of any successful path.\\n\\n    Returns:\\n      self.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_11connect(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"connect (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_11_MutableFst_10connect(((struct __pyx_obj_9pywrapfst__MutableFst *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_10connect(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"connect\", 0);\n\n  /* \"pywrapfst.pyx\":1932\n *       self.\n *     \"\"\"\n *     self._connect()             # <<<<<<<<<<<<<<\n *     return self\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_connect\");\n    __PYX_ERR(0, 1932, __pyx_L1_error)\n  }\n  ((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->_connect(__pyx_v_self); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 1932, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":1933\n *     \"\"\"\n *     self._connect()\n *     return self             # <<<<<<<<<<<<<<\n * \n *   cdef void _decode(self, EncodeMapper encoder) except *:\n */\n  __Pyx_XDECREF(__pyx_r);\n  __Pyx_INCREF(((PyObject *)__pyx_v_self));\n  __pyx_r = ((PyObject *)__pyx_v_self);\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":1920\n *     self._check_mutating_imethod()\n * \n *   def connect(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     connect(self)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst.connect\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1935\n *     return self\n * \n *   cdef void _decode(self, EncodeMapper encoder) except *:             # <<<<<<<<<<<<<<\n *     fst.Decode(self._mfst.get(), deref(encoder._encoder))\n *     self._check_mutating_imethod()\n */\n\nstatic void __pyx_f_9pywrapfst_11_MutableFst__decode(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, struct __pyx_obj_9pywrapfst_EncodeMapper *__pyx_v_encoder) {\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"_decode\", 0);\n\n  /* \"pywrapfst.pyx\":1936\n * \n *   cdef void _decode(self, EncodeMapper encoder) except *:\n *     fst.Decode(self._mfst.get(), deref(encoder._encoder))             # <<<<<<<<<<<<<<\n *     self._check_mutating_imethod()\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_mfst\");\n    __PYX_ERR(0, 1936, __pyx_L1_error)\n  }\n  if (unlikely(((PyObject *)__pyx_v_encoder) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_encoder\");\n    __PYX_ERR(0, 1936, __pyx_L1_error)\n  }\n  fst::script::Decode(__pyx_v_self->_mfst.get(), (*__pyx_v_encoder->_encoder));\n\n  /* \"pywrapfst.pyx\":1937\n *   cdef void _decode(self, EncodeMapper encoder) except *:\n *     fst.Decode(self._mfst.get(), deref(encoder._encoder))\n *     self._check_mutating_imethod()             # <<<<<<<<<<<<<<\n * \n *   def decode(self, EncodeMapper encoder):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_check_mutating_imethod\");\n    __PYX_ERR(0, 1937, __pyx_L1_error)\n  }\n  ((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->_check_mutating_imethod(__pyx_v_self); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 1937, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":1935\n *     return self\n * \n *   cdef void _decode(self, EncodeMapper encoder) except *:             # <<<<<<<<<<<<<<\n *     fst.Decode(self._mfst.get(), deref(encoder._encoder))\n *     self._check_mutating_imethod()\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst._decode\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n}\n\n/* \"pywrapfst.pyx\":1939\n *     self._check_mutating_imethod()\n * \n *   def decode(self, EncodeMapper encoder):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     decode(self, encoder)\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_13decode(PyObject *__pyx_v_self, PyObject *__pyx_v_encoder); /*proto*/\nstatic char __pyx_doc_9pywrapfst_11_MutableFst_12decode[] = \"\\n    decode(self, encoder)\\n\\n    Decodes encoded labels and/or weights.\\n\\n    This operation reverses the encoding performed by `encode`.\\n\\n    Args:\\n      encoder: An EncodeMapper object used to encode the FST.\\n\\n    Returns:\\n      self.\\n\\n    See also: `encode`.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_13decode(PyObject *__pyx_v_self, PyObject *__pyx_v_encoder) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"decode (wrapper)\", 0);\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_encoder), __pyx_ptype_9pywrapfst_EncodeMapper, 1, \"encoder\", 0))) __PYX_ERR(0, 1939, __pyx_L1_error)\n  __pyx_r = __pyx_pf_9pywrapfst_11_MutableFst_12decode(((struct __pyx_obj_9pywrapfst__MutableFst *)__pyx_v_self), ((struct __pyx_obj_9pywrapfst_EncodeMapper *)__pyx_v_encoder));\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_12decode(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, struct __pyx_obj_9pywrapfst_EncodeMapper *__pyx_v_encoder) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"decode\", 0);\n\n  /* \"pywrapfst.pyx\":1955\n *     See also: `encode`.\n *     \"\"\"\n *     self._decode(encoder)             # <<<<<<<<<<<<<<\n *     return self\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_decode\");\n    __PYX_ERR(0, 1955, __pyx_L1_error)\n  }\n  ((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->_decode(__pyx_v_self, __pyx_v_encoder); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 1955, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":1956\n *     \"\"\"\n *     self._decode(encoder)\n *     return self             # <<<<<<<<<<<<<<\n * \n *   cdef void _delete_arcs(self, int64 state, size_t n=0) except *:\n */\n  __Pyx_XDECREF(__pyx_r);\n  __Pyx_INCREF(((PyObject *)__pyx_v_self));\n  __pyx_r = ((PyObject *)__pyx_v_self);\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":1939\n *     self._check_mutating_imethod()\n * \n *   def decode(self, EncodeMapper encoder):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     decode(self, encoder)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst.decode\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1958\n *     return self\n * \n *   cdef void _delete_arcs(self, int64 state, size_t n=0) except *:             # <<<<<<<<<<<<<<\n *     if not (self._mfst.get().DeleteArcs(state, n) if n else\n *             self._mfst.get().DeleteArcs(state)):\n */\n\nstatic void __pyx_f_9pywrapfst_11_MutableFst__delete_arcs(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, __pyx_t_10basictypes_int64 __pyx_v_state, struct __pyx_opt_args_9pywrapfst_11_MutableFst__delete_arcs *__pyx_optional_args) {\n  size_t __pyx_v_n = ((size_t)0);\n  __Pyx_RefNannyDeclarations\n  bool __pyx_t_1;\n  int __pyx_t_2;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  __Pyx_RefNannySetupContext(\"_delete_arcs\", 0);\n  if (__pyx_optional_args) {\n    if (__pyx_optional_args->__pyx_n > 0) {\n      __pyx_v_n = __pyx_optional_args->n;\n    }\n  }\n\n  /* \"pywrapfst.pyx\":1959\n * \n *   cdef void _delete_arcs(self, int64 state, size_t n=0) except *:\n *     if not (self._mfst.get().DeleteArcs(state, n) if n else             # <<<<<<<<<<<<<<\n *             self._mfst.get().DeleteArcs(state)):\n *       raise FstIndexError(\"State index out of range\")\n */\n  if ((__pyx_v_n != 0)) {\n    if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n      PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_mfst\");\n      __PYX_ERR(0, 1959, __pyx_L1_error)\n    }\n    __pyx_t_1 = __pyx_v_self->_mfst.get()->DeleteArcs(__pyx_v_state, __pyx_v_n);\n  } else {\n\n    /* \"pywrapfst.pyx\":1960\n *   cdef void _delete_arcs(self, int64 state, size_t n=0) except *:\n *     if not (self._mfst.get().DeleteArcs(state, n) if n else\n *             self._mfst.get().DeleteArcs(state)):             # <<<<<<<<<<<<<<\n *       raise FstIndexError(\"State index out of range\")\n *     self._check_mutating_imethod()\n */\n    if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n      PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_mfst\");\n      __PYX_ERR(0, 1960, __pyx_L1_error)\n    }\n    __pyx_t_1 = __pyx_v_self->_mfst.get()->DeleteArcs(__pyx_v_state);\n  }\n\n  /* \"pywrapfst.pyx\":1959\n * \n *   cdef void _delete_arcs(self, int64 state, size_t n=0) except *:\n *     if not (self._mfst.get().DeleteArcs(state, n) if n else             # <<<<<<<<<<<<<<\n *             self._mfst.get().DeleteArcs(state)):\n *       raise FstIndexError(\"State index out of range\")\n */\n  __pyx_t_2 = ((!(__pyx_t_1 != 0)) != 0);\n  if (__pyx_t_2) {\n\n    /* \"pywrapfst.pyx\":1961\n *     if not (self._mfst.get().DeleteArcs(state, n) if n else\n *             self._mfst.get().DeleteArcs(state)):\n *       raise FstIndexError(\"State index out of range\")             # <<<<<<<<<<<<<<\n *     self._check_mutating_imethod()\n * \n */\n    __pyx_t_3 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstIndexError); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 1961, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_3);\n    __pyx_t_4 = __Pyx_PyObject_Call(__pyx_t_3, __pyx_tuple__33, NULL); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 1961, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_4);\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    __Pyx_Raise(__pyx_t_4, 0, 0, 0);\n    __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n    __PYX_ERR(0, 1961, __pyx_L1_error)\n\n    /* \"pywrapfst.pyx\":1959\n * \n *   cdef void _delete_arcs(self, int64 state, size_t n=0) except *:\n *     if not (self._mfst.get().DeleteArcs(state, n) if n else             # <<<<<<<<<<<<<<\n *             self._mfst.get().DeleteArcs(state)):\n *       raise FstIndexError(\"State index out of range\")\n */\n  }\n\n  /* \"pywrapfst.pyx\":1962\n *             self._mfst.get().DeleteArcs(state)):\n *       raise FstIndexError(\"State index out of range\")\n *     self._check_mutating_imethod()             # <<<<<<<<<<<<<<\n * \n *   def delete_arcs(self, int64 state, size_t n=0):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_check_mutating_imethod\");\n    __PYX_ERR(0, 1962, __pyx_L1_error)\n  }\n  ((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->_check_mutating_imethod(__pyx_v_self); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 1962, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":1958\n *     return self\n * \n *   cdef void _delete_arcs(self, int64 state, size_t n=0) except *:             # <<<<<<<<<<<<<<\n *     if not (self._mfst.get().DeleteArcs(state, n) if n else\n *             self._mfst.get().DeleteArcs(state)):\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst._delete_arcs\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n}\n\n/* \"pywrapfst.pyx\":1964\n *     self._check_mutating_imethod()\n * \n *   def delete_arcs(self, int64 state, size_t n=0):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     delete_arcs(self, state, n=0)\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_15delete_arcs(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic char __pyx_doc_9pywrapfst_11_MutableFst_14delete_arcs[] = \"\\n    delete_arcs(self, state, n=0)\\n\\n    Deletes arcs leaving a particular state.\\n\\n    Args:\\n      state: The integer index of a state.\\n      n: An optional argument indicating how many arcs to be deleted. If this\\n          argument is omitted or passed as zero, all arcs from this state are\\n          deleted.\\n\\n    Returns:\\n      self.\\n\\n    Raises:\\n      FstIndexError: State index out of range.\\n\\n    See also: `delete_states`.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_15delete_arcs(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  __pyx_t_10basictypes_int64 __pyx_v_state;\n  size_t __pyx_v_n;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"delete_arcs (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_state,&__pyx_n_s_n,0};\n    PyObject* values[2] = {0,0};\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (likely((values[0] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_state)) != 0)) kw_args--;\n        else goto __pyx_L5_argtuple_error;\n        CYTHON_FALLTHROUGH;\n        case  1:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_n);\n          if (value) { values[1] = value; kw_args--; }\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"delete_arcs\") < 0)) __PYX_ERR(0, 1964, __pyx_L3_error)\n      }\n    } else {\n      switch (PyTuple_GET_SIZE(__pyx_args)) {\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n    }\n    __pyx_v_state = __Pyx_PyInt_As_int64_t(values[0]); if (unlikely((__pyx_v_state == ((int64_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 1964, __pyx_L3_error)\n    if (values[1]) {\n      __pyx_v_n = __Pyx_PyInt_As_size_t(values[1]); if (unlikely((__pyx_v_n == (size_t)-1) && PyErr_Occurred())) __PYX_ERR(0, 1964, __pyx_L3_error)\n    } else {\n      __pyx_v_n = ((size_t)0);\n    }\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"delete_arcs\", 0, 1, 2, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 1964, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst.delete_arcs\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  __pyx_r = __pyx_pf_9pywrapfst_11_MutableFst_14delete_arcs(((struct __pyx_obj_9pywrapfst__MutableFst *)__pyx_v_self), __pyx_v_state, __pyx_v_n);\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_14delete_arcs(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, __pyx_t_10basictypes_int64 __pyx_v_state, size_t __pyx_v_n) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  struct __pyx_opt_args_9pywrapfst_11_MutableFst__delete_arcs __pyx_t_1;\n  __Pyx_RefNannySetupContext(\"delete_arcs\", 0);\n\n  /* \"pywrapfst.pyx\":1984\n *     See also: `delete_states`.\n *     \"\"\"\n *     self._delete_arcs(state, n)             # <<<<<<<<<<<<<<\n *     return self\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_delete_arcs\");\n    __PYX_ERR(0, 1984, __pyx_L1_error)\n  }\n  __pyx_t_1.__pyx_n = 1;\n  __pyx_t_1.n = __pyx_v_n;\n  ((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->_delete_arcs(__pyx_v_self, __pyx_v_state, &__pyx_t_1); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 1984, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":1985\n *     \"\"\"\n *     self._delete_arcs(state, n)\n *     return self             # <<<<<<<<<<<<<<\n * \n *   cdef void _delete_states(self, states=None) except *:\n */\n  __Pyx_XDECREF(__pyx_r);\n  __Pyx_INCREF(((PyObject *)__pyx_v_self));\n  __pyx_r = ((PyObject *)__pyx_v_self);\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":1964\n *     self._check_mutating_imethod()\n * \n *   def delete_arcs(self, int64 state, size_t n=0):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     delete_arcs(self, state, n=0)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst.delete_arcs\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1987\n *     return self\n * \n *   cdef void _delete_states(self, states=None) except *:             # <<<<<<<<<<<<<<\n *     # Only the former signature has a possible indexing failure.\n *     if states:\n */\n\nstatic void __pyx_f_9pywrapfst_11_MutableFst__delete_states(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, struct __pyx_opt_args_9pywrapfst_11_MutableFst__delete_states *__pyx_optional_args) {\n  PyObject *__pyx_v_states = ((PyObject *)Py_None);\n  __Pyx_RefNannyDeclarations\n  int __pyx_t_1;\n  std::vector<__pyx_t_10basictypes_int64>  __pyx_t_2;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  __Pyx_RefNannySetupContext(\"_delete_states\", 0);\n  if (__pyx_optional_args) {\n    if (__pyx_optional_args->__pyx_n > 0) {\n      __pyx_v_states = __pyx_optional_args->states;\n    }\n  }\n\n  /* \"pywrapfst.pyx\":1989\n *   cdef void _delete_states(self, states=None) except *:\n *     # Only the former signature has a possible indexing failure.\n *     if states:             # <<<<<<<<<<<<<<\n *       if not self._mfst.get().DeleteStates(<const vector[int64]> states):\n *         raise FstIndexError(\"State index out of range\")\n */\n  __pyx_t_1 = __Pyx_PyObject_IsTrue(__pyx_v_states); if (unlikely(__pyx_t_1 < 0)) __PYX_ERR(0, 1989, __pyx_L1_error)\n  if (__pyx_t_1) {\n\n    /* \"pywrapfst.pyx\":1990\n *     # Only the former signature has a possible indexing failure.\n *     if states:\n *       if not self._mfst.get().DeleteStates(<const vector[int64]> states):             # <<<<<<<<<<<<<<\n *         raise FstIndexError(\"State index out of range\")\n *     else:\n */\n    if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n      PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_mfst\");\n      __PYX_ERR(0, 1990, __pyx_L1_error)\n    }\n    __pyx_t_2 = __pyx_convert_vector_from_py___pyx_t_10basictypes_int64(__pyx_v_states); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 1990, __pyx_L1_error)\n    __pyx_t_1 = ((!(__pyx_v_self->_mfst.get()->DeleteStates(((std::vector<__pyx_t_10basictypes_int64>  const )__pyx_t_2)) != 0)) != 0);\n    if (__pyx_t_1) {\n\n      /* \"pywrapfst.pyx\":1991\n *     if states:\n *       if not self._mfst.get().DeleteStates(<const vector[int64]> states):\n *         raise FstIndexError(\"State index out of range\")             # <<<<<<<<<<<<<<\n *     else:\n *       self._mfst.get().DeleteStates()\n */\n      __pyx_t_3 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstIndexError); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 1991, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_3);\n      __pyx_t_4 = __Pyx_PyObject_Call(__pyx_t_3, __pyx_tuple__34, NULL); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 1991, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_4);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __Pyx_Raise(__pyx_t_4, 0, 0, 0);\n      __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      __PYX_ERR(0, 1991, __pyx_L1_error)\n\n      /* \"pywrapfst.pyx\":1990\n *     # Only the former signature has a possible indexing failure.\n *     if states:\n *       if not self._mfst.get().DeleteStates(<const vector[int64]> states):             # <<<<<<<<<<<<<<\n *         raise FstIndexError(\"State index out of range\")\n *     else:\n */\n    }\n\n    /* \"pywrapfst.pyx\":1989\n *   cdef void _delete_states(self, states=None) except *:\n *     # Only the former signature has a possible indexing failure.\n *     if states:             # <<<<<<<<<<<<<<\n *       if not self._mfst.get().DeleteStates(<const vector[int64]> states):\n *         raise FstIndexError(\"State index out of range\")\n */\n    goto __pyx_L3;\n  }\n\n  /* \"pywrapfst.pyx\":1993\n *         raise FstIndexError(\"State index out of range\")\n *     else:\n *       self._mfst.get().DeleteStates()             # <<<<<<<<<<<<<<\n *     self._check_mutating_imethod()\n * \n */\n  /*else*/ {\n    if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n      PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_mfst\");\n      __PYX_ERR(0, 1993, __pyx_L1_error)\n    }\n    __pyx_v_self->_mfst.get()->DeleteStates();\n  }\n  __pyx_L3:;\n\n  /* \"pywrapfst.pyx\":1994\n *     else:\n *       self._mfst.get().DeleteStates()\n *     self._check_mutating_imethod()             # <<<<<<<<<<<<<<\n * \n *   def delete_states(self, states=None):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_check_mutating_imethod\");\n    __PYX_ERR(0, 1994, __pyx_L1_error)\n  }\n  ((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->_check_mutating_imethod(__pyx_v_self); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 1994, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":1987\n *     return self\n * \n *   cdef void _delete_states(self, states=None) except *:             # <<<<<<<<<<<<<<\n *     # Only the former signature has a possible indexing failure.\n *     if states:\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst._delete_states\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n}\n\n/* \"pywrapfst.pyx\":1996\n *     self._check_mutating_imethod()\n * \n *   def delete_states(self, states=None):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     delete_states(self, states=None)\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_17delete_states(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic char __pyx_doc_9pywrapfst_11_MutableFst_16delete_states[] = \"\\n    delete_states(self, states=None)\\n\\n    Deletes states.\\n\\n    Args:\\n      states: An optional iterable of integer indices of the states to be\\n          deleted. If this argument is omitted, all states are deleted.\\n\\n    Returns:\\n      self.\\n\\n    Raises:\\n      FstIndexError: State index out of range.\\n\\n    See also: `delete_arcs`.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_17delete_states(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  PyObject *__pyx_v_states = 0;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"delete_states (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_states,0};\n    PyObject* values[1] = {0};\n    values[0] = ((PyObject *)Py_None);\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_states);\n          if (value) { values[0] = value; kw_args--; }\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"delete_states\") < 0)) __PYX_ERR(0, 1996, __pyx_L3_error)\n      }\n    } else {\n      switch (PyTuple_GET_SIZE(__pyx_args)) {\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n    }\n    __pyx_v_states = values[0];\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"delete_states\", 0, 0, 1, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 1996, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst.delete_states\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  __pyx_r = __pyx_pf_9pywrapfst_11_MutableFst_16delete_states(((struct __pyx_obj_9pywrapfst__MutableFst *)__pyx_v_self), __pyx_v_states);\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_16delete_states(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, PyObject *__pyx_v_states) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  struct __pyx_opt_args_9pywrapfst_11_MutableFst__delete_states __pyx_t_1;\n  __Pyx_RefNannySetupContext(\"delete_states\", 0);\n\n  /* \"pywrapfst.pyx\":2014\n *     See also: `delete_arcs`.\n *     \"\"\"\n *     self._delete_states(states)             # <<<<<<<<<<<<<<\n *     return self\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_delete_states\");\n    __PYX_ERR(0, 2014, __pyx_L1_error)\n  }\n  __pyx_t_1.__pyx_n = 1;\n  __pyx_t_1.states = __pyx_v_states;\n  ((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->_delete_states(__pyx_v_self, &__pyx_t_1); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 2014, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":2015\n *     \"\"\"\n *     self._delete_states(states)\n *     return self             # <<<<<<<<<<<<<<\n * \n *   cdef void _encode(self, EncodeMapper encoder) except *:\n */\n  __Pyx_XDECREF(__pyx_r);\n  __Pyx_INCREF(((PyObject *)__pyx_v_self));\n  __pyx_r = ((PyObject *)__pyx_v_self);\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":1996\n *     self._check_mutating_imethod()\n * \n *   def delete_states(self, states=None):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     delete_states(self, states=None)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst.delete_states\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":2017\n *     return self\n * \n *   cdef void _encode(self, EncodeMapper encoder) except *:             # <<<<<<<<<<<<<<\n *     fst.Encode(self._mfst.get(), encoder._encoder.get())\n *     self._check_mutating_imethod()\n */\n\nstatic void __pyx_f_9pywrapfst_11_MutableFst__encode(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, struct __pyx_obj_9pywrapfst_EncodeMapper *__pyx_v_encoder) {\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"_encode\", 0);\n\n  /* \"pywrapfst.pyx\":2018\n * \n *   cdef void _encode(self, EncodeMapper encoder) except *:\n *     fst.Encode(self._mfst.get(), encoder._encoder.get())             # <<<<<<<<<<<<<<\n *     self._check_mutating_imethod()\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_mfst\");\n    __PYX_ERR(0, 2018, __pyx_L1_error)\n  }\n  if (unlikely(((PyObject *)__pyx_v_encoder) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_encoder\");\n    __PYX_ERR(0, 2018, __pyx_L1_error)\n  }\n  fst::script::Encode(__pyx_v_self->_mfst.get(), __pyx_v_encoder->_encoder.get());\n\n  /* \"pywrapfst.pyx\":2019\n *   cdef void _encode(self, EncodeMapper encoder) except *:\n *     fst.Encode(self._mfst.get(), encoder._encoder.get())\n *     self._check_mutating_imethod()             # <<<<<<<<<<<<<<\n * \n *   def encode(self, EncodeMapper encoder):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_check_mutating_imethod\");\n    __PYX_ERR(0, 2019, __pyx_L1_error)\n  }\n  ((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->_check_mutating_imethod(__pyx_v_self); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 2019, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":2017\n *     return self\n * \n *   cdef void _encode(self, EncodeMapper encoder) except *:             # <<<<<<<<<<<<<<\n *     fst.Encode(self._mfst.get(), encoder._encoder.get())\n *     self._check_mutating_imethod()\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst._encode\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n}\n\n/* \"pywrapfst.pyx\":2021\n *     self._check_mutating_imethod()\n * \n *   def encode(self, EncodeMapper encoder):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     encode(self, encoder)\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_19encode(PyObject *__pyx_v_self, PyObject *__pyx_v_encoder); /*proto*/\nstatic char __pyx_doc_9pywrapfst_11_MutableFst_18encode[] = \"\\n    encode(self, encoder)\\n\\n    Encodes labels and/or weights.\\n\\n    This operation allows for the representation of a weighted transducer as a\\n    weighted acceptor, an unweighted transducer, or an unweighted acceptor by\\n    considering the pair (input label, output label), the pair (input label,\\n    weight), or the triple (input label, output label, weight) as a single\\n    label. Applying this operation mutates the EncodeMapper argument, which\\n    can then be used to decode.\\n\\n    Args:\\n      encoder: An EncodeMapper object to be used as the encoder.\\n\\n    Returns:\\n      self.\\n\\n    See also: `decode`.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_19encode(PyObject *__pyx_v_self, PyObject *__pyx_v_encoder) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"encode (wrapper)\", 0);\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_encoder), __pyx_ptype_9pywrapfst_EncodeMapper, 1, \"encoder\", 0))) __PYX_ERR(0, 2021, __pyx_L1_error)\n  __pyx_r = __pyx_pf_9pywrapfst_11_MutableFst_18encode(((struct __pyx_obj_9pywrapfst__MutableFst *)__pyx_v_self), ((struct __pyx_obj_9pywrapfst_EncodeMapper *)__pyx_v_encoder));\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_18encode(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, struct __pyx_obj_9pywrapfst_EncodeMapper *__pyx_v_encoder) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"encode\", 0);\n\n  /* \"pywrapfst.pyx\":2042\n *     See also: `decode`.\n *     \"\"\"\n *     self._encode(encoder)             # <<<<<<<<<<<<<<\n *     return self\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_encode\");\n    __PYX_ERR(0, 2042, __pyx_L1_error)\n  }\n  ((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->_encode(__pyx_v_self, __pyx_v_encoder); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 2042, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":2043\n *     \"\"\"\n *     self._encode(encoder)\n *     return self             # <<<<<<<<<<<<<<\n * \n *   cdef void _invert(self) except *:\n */\n  __Pyx_XDECREF(__pyx_r);\n  __Pyx_INCREF(((PyObject *)__pyx_v_self));\n  __pyx_r = ((PyObject *)__pyx_v_self);\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":2021\n *     self._check_mutating_imethod()\n * \n *   def encode(self, EncodeMapper encoder):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     encode(self, encoder)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst.encode\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":2045\n *     return self\n * \n *   cdef void _invert(self) except *:             # <<<<<<<<<<<<<<\n *     fst.Invert(self._mfst.get())\n *     self._check_mutating_imethod()\n */\n\nstatic void __pyx_f_9pywrapfst_11_MutableFst__invert(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self) {\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"_invert\", 0);\n\n  /* \"pywrapfst.pyx\":2046\n * \n *   cdef void _invert(self) except *:\n *     fst.Invert(self._mfst.get())             # <<<<<<<<<<<<<<\n *     self._check_mutating_imethod()\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_mfst\");\n    __PYX_ERR(0, 2046, __pyx_L1_error)\n  }\n  fst::script::Invert(__pyx_v_self->_mfst.get());\n\n  /* \"pywrapfst.pyx\":2047\n *   cdef void _invert(self) except *:\n *     fst.Invert(self._mfst.get())\n *     self._check_mutating_imethod()             # <<<<<<<<<<<<<<\n * \n *   def invert(self):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_check_mutating_imethod\");\n    __PYX_ERR(0, 2047, __pyx_L1_error)\n  }\n  ((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->_check_mutating_imethod(__pyx_v_self); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 2047, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":2045\n *     return self\n * \n *   cdef void _invert(self) except *:             # <<<<<<<<<<<<<<\n *     fst.Invert(self._mfst.get())\n *     self._check_mutating_imethod()\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst._invert\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n}\n\n/* \"pywrapfst.pyx\":2049\n *     self._check_mutating_imethod()\n * \n *   def invert(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     invert(self)\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_21invert(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_11_MutableFst_20invert[] = \"\\n    invert(self)\\n\\n    Inverts the FST's transduction.\\n\\n    This operation destructively inverts the FST's transduction by exchanging\\n    input and output labels.\\n\\n    Returns:\\n      self.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_21invert(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"invert (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_11_MutableFst_20invert(((struct __pyx_obj_9pywrapfst__MutableFst *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_20invert(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"invert\", 0);\n\n  /* \"pywrapfst.pyx\":2061\n *       self.\n *     \"\"\"\n *     self._invert()             # <<<<<<<<<<<<<<\n *     return self\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_invert\");\n    __PYX_ERR(0, 2061, __pyx_L1_error)\n  }\n  ((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->_invert(__pyx_v_self); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 2061, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":2062\n *     \"\"\"\n *     self._invert()\n *     return self             # <<<<<<<<<<<<<<\n * \n *   cdef void _minimize(self, float delta=fst.kShortestDelta,\n */\n  __Pyx_XDECREF(__pyx_r);\n  __Pyx_INCREF(((PyObject *)__pyx_v_self));\n  __pyx_r = ((PyObject *)__pyx_v_self);\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":2049\n *     self._check_mutating_imethod()\n * \n *   def invert(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     invert(self)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst.invert\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":2064\n *     return self\n * \n *   cdef void _minimize(self, float delta=fst.kShortestDelta,             # <<<<<<<<<<<<<<\n *                       bool allow_nondet=False) except *:\n *     # This runs in-place when the second argument is null.\n */\n\nstatic void __pyx_f_9pywrapfst_11_MutableFst__minimize(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, struct __pyx_opt_args_9pywrapfst_11_MutableFst__minimize *__pyx_optional_args) {\n  float __pyx_v_delta = __pyx_k__35;\n\n  /* \"pywrapfst.pyx\":2065\n * \n *   cdef void _minimize(self, float delta=fst.kShortestDelta,\n *                       bool allow_nondet=False) except *:             # <<<<<<<<<<<<<<\n *     # This runs in-place when the second argument is null.\n *     fst.Minimize(self._mfst.get(), NULL, delta, allow_nondet)\n */\n  bool __pyx_v_allow_nondet = ((bool)0);\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"_minimize\", 0);\n  if (__pyx_optional_args) {\n    if (__pyx_optional_args->__pyx_n > 0) {\n      __pyx_v_delta = __pyx_optional_args->delta;\n      if (__pyx_optional_args->__pyx_n > 1) {\n        __pyx_v_allow_nondet = __pyx_optional_args->allow_nondet;\n      }\n    }\n  }\n\n  /* \"pywrapfst.pyx\":2067\n *                       bool allow_nondet=False) except *:\n *     # This runs in-place when the second argument is null.\n *     fst.Minimize(self._mfst.get(), NULL, delta, allow_nondet)             # <<<<<<<<<<<<<<\n *     self._check_mutating_imethod()\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_mfst\");\n    __PYX_ERR(0, 2067, __pyx_L1_error)\n  }\n  fst::script::Minimize(__pyx_v_self->_mfst.get(), NULL, __pyx_v_delta, __pyx_v_allow_nondet);\n\n  /* \"pywrapfst.pyx\":2068\n *     # This runs in-place when the second argument is null.\n *     fst.Minimize(self._mfst.get(), NULL, delta, allow_nondet)\n *     self._check_mutating_imethod()             # <<<<<<<<<<<<<<\n * \n *   def minimize(self, float delta=fst.kShortestDelta, bool allow_nondet=False):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_check_mutating_imethod\");\n    __PYX_ERR(0, 2068, __pyx_L1_error)\n  }\n  ((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->_check_mutating_imethod(__pyx_v_self); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 2068, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":2064\n *     return self\n * \n *   cdef void _minimize(self, float delta=fst.kShortestDelta,             # <<<<<<<<<<<<<<\n *                       bool allow_nondet=False) except *:\n *     # This runs in-place when the second argument is null.\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst._minimize\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n}\n\n/* \"pywrapfst.pyx\":2070\n *     self._check_mutating_imethod()\n * \n *   def minimize(self, float delta=fst.kShortestDelta, bool allow_nondet=False):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     minimize(self, delta=1e-6, allow_nondet=False)\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_23minimize(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic char __pyx_doc_9pywrapfst_11_MutableFst_22minimize[] = \"\\n    minimize(self, delta=1e-6, allow_nondet=False)\\n\\n    Minimizes the FST.\\n\\n    This operation destructively performs the minimization of deterministic\\n    weighted automata and transducers. If the input FST A is an acceptor, this\\n    operation produces the minimal acceptor B equivalent to A, i.e. the\\n    acceptor with a minimal number of states that is equivalent to A. If the\\n    input FST A is a transducer, this operation internally builds an equivalent\\n    transducer with a minimal number of states. However, this minimality is\\n    obtained by allowing transition having strings of symbols as output labels,\\n    this known in the litterature as a real-time transducer. Such transducers\\n    are not directly supported by the library. This function will convert such\\n    transducer by expanding each string-labeled transition into a sequence of\\n    transitions. This will results in the creation of new states, hence losing\\n    the minimality property.\\n\\n    Args:\\n      delta: Comparison/quantization delta.\\n      allow_nondet: Attempt minimization of non-deterministic FST?\\n\\n    Returns:\\n      self.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_23minimize(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  float __pyx_v_delta;\n  bool __pyx_v_allow_nondet;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"minimize (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_delta,&__pyx_n_s_allow_nondet,0};\n    PyObject* values[2] = {0,0};\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_delta);\n          if (value) { values[0] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  1:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_allow_nondet);\n          if (value) { values[1] = value; kw_args--; }\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"minimize\") < 0)) __PYX_ERR(0, 2070, __pyx_L3_error)\n      }\n    } else {\n      switch (PyTuple_GET_SIZE(__pyx_args)) {\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n    }\n    if (values[0]) {\n      __pyx_v_delta = __pyx_PyFloat_AsFloat(values[0]); if (unlikely((__pyx_v_delta == (float)-1) && PyErr_Occurred())) __PYX_ERR(0, 2070, __pyx_L3_error)\n    } else {\n      __pyx_v_delta = __pyx_k__36;\n    }\n    if (values[1]) {\n      __pyx_v_allow_nondet = __Pyx_PyObject_IsTrue(values[1]); if (unlikely((__pyx_v_allow_nondet == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 2070, __pyx_L3_error)\n    } else {\n      __pyx_v_allow_nondet = ((bool)0);\n    }\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"minimize\", 0, 0, 2, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 2070, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst.minimize\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  __pyx_r = __pyx_pf_9pywrapfst_11_MutableFst_22minimize(((struct __pyx_obj_9pywrapfst__MutableFst *)__pyx_v_self), __pyx_v_delta, __pyx_v_allow_nondet);\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_22minimize(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, float __pyx_v_delta, bool __pyx_v_allow_nondet) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  struct __pyx_opt_args_9pywrapfst_11_MutableFst__minimize __pyx_t_1;\n  __Pyx_RefNannySetupContext(\"minimize\", 0);\n\n  /* \"pywrapfst.pyx\":2096\n *       self.\n *     \"\"\"\n *     self._minimize(delta, allow_nondet)             # <<<<<<<<<<<<<<\n *     return self\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_minimize\");\n    __PYX_ERR(0, 2096, __pyx_L1_error)\n  }\n  __pyx_t_1.__pyx_n = 2;\n  __pyx_t_1.delta = __pyx_v_delta;\n  __pyx_t_1.allow_nondet = __pyx_v_allow_nondet;\n  ((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->_minimize(__pyx_v_self, &__pyx_t_1); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 2096, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":2097\n *     \"\"\"\n *     self._minimize(delta, allow_nondet)\n *     return self             # <<<<<<<<<<<<<<\n * \n *   cpdef MutableArcIterator mutable_arcs(self, int64 state):\n */\n  __Pyx_XDECREF(__pyx_r);\n  __Pyx_INCREF(((PyObject *)__pyx_v_self));\n  __pyx_r = ((PyObject *)__pyx_v_self);\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":2070\n *     self._check_mutating_imethod()\n * \n *   def minimize(self, float delta=fst.kShortestDelta, bool allow_nondet=False):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     minimize(self, delta=1e-6, allow_nondet=False)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst.minimize\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":2099\n *     return self\n * \n *   cpdef MutableArcIterator mutable_arcs(self, int64 state):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     mutable_arcs(self, state)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_25mutable_arcs(PyObject *__pyx_v_self, PyObject *__pyx_arg_state); /*proto*/\nstatic struct __pyx_obj_9pywrapfst_MutableArcIterator *__pyx_f_9pywrapfst_11_MutableFst_mutable_arcs(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, __pyx_t_10basictypes_int64 __pyx_v_state, int __pyx_skip_dispatch) {\n  struct __pyx_obj_9pywrapfst_MutableArcIterator *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  PyObject *__pyx_t_6 = NULL;\n  __Pyx_RefNannySetupContext(\"mutable_arcs\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_mutable_arcs); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2099, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_11_MutableFst_25mutable_arcs)) {\n      __Pyx_XDECREF(((PyObject *)__pyx_r));\n      __pyx_t_3 = __Pyx_PyInt_From_int64_t(__pyx_v_state); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 2099, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_3);\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_4 = __pyx_t_1; __pyx_t_5 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_4))) {\n        __pyx_t_5 = PyMethod_GET_SELF(__pyx_t_4);\n        if (likely(__pyx_t_5)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_4);\n          __Pyx_INCREF(__pyx_t_5);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_4, function);\n        }\n      }\n      if (!__pyx_t_5) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_4, __pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 2099, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n        __Pyx_GOTREF(__pyx_t_2);\n      } else {\n        #if CYTHON_FAST_PYCALL\n        if (PyFunction_Check(__pyx_t_4)) {\n          PyObject *__pyx_temp[2] = {__pyx_t_5, __pyx_t_3};\n          __pyx_t_2 = __Pyx_PyFunction_FastCall(__pyx_t_4, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 2099, __pyx_L1_error)\n          __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;\n          __Pyx_GOTREF(__pyx_t_2);\n          __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n        } else\n        #endif\n        #if CYTHON_FAST_PYCCALL\n        if (__Pyx_PyFastCFunction_Check(__pyx_t_4)) {\n          PyObject *__pyx_temp[2] = {__pyx_t_5, __pyx_t_3};\n          __pyx_t_2 = __Pyx_PyCFunction_FastCall(__pyx_t_4, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 2099, __pyx_L1_error)\n          __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;\n          __Pyx_GOTREF(__pyx_t_2);\n          __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n        } else\n        #endif\n        {\n          __pyx_t_6 = PyTuple_New(1+1); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 2099, __pyx_L1_error)\n          __Pyx_GOTREF(__pyx_t_6);\n          __Pyx_GIVEREF(__pyx_t_5); PyTuple_SET_ITEM(__pyx_t_6, 0, __pyx_t_5); __pyx_t_5 = NULL;\n          __Pyx_GIVEREF(__pyx_t_3);\n          PyTuple_SET_ITEM(__pyx_t_6, 0+1, __pyx_t_3);\n          __pyx_t_3 = 0;\n          __pyx_t_2 = __Pyx_PyObject_Call(__pyx_t_4, __pyx_t_6, NULL); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 2099, __pyx_L1_error)\n          __Pyx_GOTREF(__pyx_t_2);\n          __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n        }\n      }\n      __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      if (!(likely(((__pyx_t_2) == Py_None) || likely(__Pyx_TypeTest(__pyx_t_2, __pyx_ptype_9pywrapfst_MutableArcIterator))))) __PYX_ERR(0, 2099, __pyx_L1_error)\n      __pyx_r = ((struct __pyx_obj_9pywrapfst_MutableArcIterator *)__pyx_t_2);\n      __pyx_t_2 = 0;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":2113\n *     See also: `arcs`, `states`.\n *     \"\"\"\n *     return MutableArcIterator(self, state)             # <<<<<<<<<<<<<<\n * \n *   def mutable_input_symbols(self):\n */\n  __Pyx_XDECREF(((PyObject *)__pyx_r));\n  __pyx_t_1 = __Pyx_PyInt_From_int64_t(__pyx_v_state); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2113, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_t_2 = PyTuple_New(2); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 2113, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  __Pyx_INCREF(((PyObject *)__pyx_v_self));\n  __Pyx_GIVEREF(((PyObject *)__pyx_v_self));\n  PyTuple_SET_ITEM(__pyx_t_2, 0, ((PyObject *)__pyx_v_self));\n  __Pyx_GIVEREF(__pyx_t_1);\n  PyTuple_SET_ITEM(__pyx_t_2, 1, __pyx_t_1);\n  __pyx_t_1 = 0;\n  __pyx_t_1 = __Pyx_PyObject_Call(((PyObject *)__pyx_ptype_9pywrapfst_MutableArcIterator), __pyx_t_2, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2113, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n  __pyx_r = ((struct __pyx_obj_9pywrapfst_MutableArcIterator *)__pyx_t_1);\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":2099\n *     return self\n * \n *   cpdef MutableArcIterator mutable_arcs(self, int64 state):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     mutable_arcs(self, state)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_XDECREF(__pyx_t_6);\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst.mutable_arcs\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XGIVEREF((PyObject *)__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_25mutable_arcs(PyObject *__pyx_v_self, PyObject *__pyx_arg_state); /*proto*/\nstatic char __pyx_doc_9pywrapfst_11_MutableFst_24mutable_arcs[] = \"\\n    mutable_arcs(self, state)\\n\\n    Returns a mutable iterator over arcs leaving the specified state.\\n\\n    Args:\\n      state: The source state ID.\\n\\n    Returns:\\n      A MutableArcIterator.\\n\\n    See also: `arcs`, `states`.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_25mutable_arcs(PyObject *__pyx_v_self, PyObject *__pyx_arg_state) {\n  __pyx_t_10basictypes_int64 __pyx_v_state;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"mutable_arcs (wrapper)\", 0);\n  assert(__pyx_arg_state); {\n    __pyx_v_state = __Pyx_PyInt_As_int64_t(__pyx_arg_state); if (unlikely((__pyx_v_state == ((int64_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 2099, __pyx_L3_error)\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst.mutable_arcs\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  __pyx_r = __pyx_pf_9pywrapfst_11_MutableFst_24mutable_arcs(((struct __pyx_obj_9pywrapfst__MutableFst *)__pyx_v_self), ((__pyx_t_10basictypes_int64)__pyx_v_state));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_24mutable_arcs(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, __pyx_t_10basictypes_int64 __pyx_v_state) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"mutable_arcs\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst_11_MutableFst_mutable_arcs(__pyx_v_self, __pyx_v_state, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2099, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst.mutable_arcs\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":2115\n *     return MutableArcIterator(self, state)\n * \n *   def mutable_input_symbols(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     mutable_input_symbols(self)\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_27mutable_input_symbols(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_11_MutableFst_26mutable_input_symbols[] = \"\\n    mutable_input_symbols(self)\\n\\n    Returns the FST's (mutable) input symbol table, or None if none is present.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_27mutable_input_symbols(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"mutable_input_symbols (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_11_MutableFst_26mutable_input_symbols(((struct __pyx_obj_9pywrapfst__MutableFst *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_26mutable_input_symbols(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self) {\n  fst::SymbolTable *__pyx_v_tst;\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  int __pyx_t_1;\n  PyObject *__pyx_t_2 = NULL;\n  __Pyx_RefNannySetupContext(\"mutable_input_symbols\", 0);\n\n  /* \"pywrapfst.pyx\":2121\n *     Returns the FST's (mutable) input symbol table, or None if none is present.\n *     \"\"\"\n *     cdef fst.SymbolTable *tst = self._mfst.get().MutableInputSymbols()             # <<<<<<<<<<<<<<\n *     if tst == NULL:\n *       return\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_mfst\");\n    __PYX_ERR(0, 2121, __pyx_L1_error)\n  }\n  __pyx_v_tst = __pyx_v_self->_mfst.get()->MutableInputSymbols();\n\n  /* \"pywrapfst.pyx\":2122\n *     \"\"\"\n *     cdef fst.SymbolTable *tst = self._mfst.get().MutableInputSymbols()\n *     if tst == NULL:             # <<<<<<<<<<<<<<\n *       return\n *     return _init_MutableFstSymbolTable(tst, self._mfst)\n */\n  __pyx_t_1 = ((__pyx_v_tst == NULL) != 0);\n  if (__pyx_t_1) {\n\n    /* \"pywrapfst.pyx\":2123\n *     cdef fst.SymbolTable *tst = self._mfst.get().MutableInputSymbols()\n *     if tst == NULL:\n *       return             # <<<<<<<<<<<<<<\n *     return _init_MutableFstSymbolTable(tst, self._mfst)\n * \n */\n    __Pyx_XDECREF(__pyx_r);\n    __pyx_r = Py_None; __Pyx_INCREF(Py_None);\n    goto __pyx_L0;\n\n    /* \"pywrapfst.pyx\":2122\n *     \"\"\"\n *     cdef fst.SymbolTable *tst = self._mfst.get().MutableInputSymbols()\n *     if tst == NULL:             # <<<<<<<<<<<<<<\n *       return\n *     return _init_MutableFstSymbolTable(tst, self._mfst)\n */\n  }\n\n  /* \"pywrapfst.pyx\":2124\n *     if tst == NULL:\n *       return\n *     return _init_MutableFstSymbolTable(tst, self._mfst)             # <<<<<<<<<<<<<<\n * \n *   def mutable_output_symbols(self):\n */\n  __Pyx_XDECREF(__pyx_r);\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_mfst\");\n    __PYX_ERR(0, 2124, __pyx_L1_error)\n  }\n  __pyx_t_2 = ((PyObject *)__pyx_f_9pywrapfst__init_MutableFstSymbolTable(__pyx_v_tst, __pyx_v_self->_mfst)); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 2124, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  __pyx_r = __pyx_t_2;\n  __pyx_t_2 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":2115\n *     return MutableArcIterator(self, state)\n * \n *   def mutable_input_symbols(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     mutable_input_symbols(self)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst.mutable_input_symbols\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":2126\n *     return _init_MutableFstSymbolTable(tst, self._mfst)\n * \n *   def mutable_output_symbols(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     mutable_output_symbols(self)\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_29mutable_output_symbols(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_11_MutableFst_28mutable_output_symbols[] = \"\\n    mutable_output_symbols(self)\\n\\n    Returns the FST's (mutable) output symbol table, or None if none is present.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_29mutable_output_symbols(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"mutable_output_symbols (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_11_MutableFst_28mutable_output_symbols(((struct __pyx_obj_9pywrapfst__MutableFst *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_28mutable_output_symbols(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self) {\n  fst::SymbolTable *__pyx_v_tst;\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  int __pyx_t_1;\n  PyObject *__pyx_t_2 = NULL;\n  __Pyx_RefNannySetupContext(\"mutable_output_symbols\", 0);\n\n  /* \"pywrapfst.pyx\":2132\n *     Returns the FST's (mutable) output symbol table, or None if none is present.\n *     \"\"\"\n *     cdef fst.SymbolTable *tst = self._mfst.get().MutableOutputSymbols()             # <<<<<<<<<<<<<<\n *     if tst == NULL:\n *       return\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_mfst\");\n    __PYX_ERR(0, 2132, __pyx_L1_error)\n  }\n  __pyx_v_tst = __pyx_v_self->_mfst.get()->MutableOutputSymbols();\n\n  /* \"pywrapfst.pyx\":2133\n *     \"\"\"\n *     cdef fst.SymbolTable *tst = self._mfst.get().MutableOutputSymbols()\n *     if tst == NULL:             # <<<<<<<<<<<<<<\n *       return\n *     return _init_MutableFstSymbolTable(tst, self._mfst)\n */\n  __pyx_t_1 = ((__pyx_v_tst == NULL) != 0);\n  if (__pyx_t_1) {\n\n    /* \"pywrapfst.pyx\":2134\n *     cdef fst.SymbolTable *tst = self._mfst.get().MutableOutputSymbols()\n *     if tst == NULL:\n *       return             # <<<<<<<<<<<<<<\n *     return _init_MutableFstSymbolTable(tst, self._mfst)\n * \n */\n    __Pyx_XDECREF(__pyx_r);\n    __pyx_r = Py_None; __Pyx_INCREF(Py_None);\n    goto __pyx_L0;\n\n    /* \"pywrapfst.pyx\":2133\n *     \"\"\"\n *     cdef fst.SymbolTable *tst = self._mfst.get().MutableOutputSymbols()\n *     if tst == NULL:             # <<<<<<<<<<<<<<\n *       return\n *     return _init_MutableFstSymbolTable(tst, self._mfst)\n */\n  }\n\n  /* \"pywrapfst.pyx\":2135\n *     if tst == NULL:\n *       return\n *     return _init_MutableFstSymbolTable(tst, self._mfst)             # <<<<<<<<<<<<<<\n * \n *   cpdef int64 num_states(self):\n */\n  __Pyx_XDECREF(__pyx_r);\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_mfst\");\n    __PYX_ERR(0, 2135, __pyx_L1_error)\n  }\n  __pyx_t_2 = ((PyObject *)__pyx_f_9pywrapfst__init_MutableFstSymbolTable(__pyx_v_tst, __pyx_v_self->_mfst)); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 2135, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  __pyx_r = __pyx_t_2;\n  __pyx_t_2 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":2126\n *     return _init_MutableFstSymbolTable(tst, self._mfst)\n * \n *   def mutable_output_symbols(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     mutable_output_symbols(self)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst.mutable_output_symbols\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":2137\n *     return _init_MutableFstSymbolTable(tst, self._mfst)\n * \n *   cpdef int64 num_states(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     num_states(self)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_31num_states(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic __pyx_t_10basictypes_int64 __pyx_f_9pywrapfst_11_MutableFst_num_states(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, int __pyx_skip_dispatch) {\n  __pyx_t_10basictypes_int64 __pyx_r;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  __pyx_t_10basictypes_int64 __pyx_t_5;\n  __Pyx_RefNannySetupContext(\"num_states\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_num_states); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2137, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_11_MutableFst_31num_states)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 2137, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 2137, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __pyx_t_5 = __Pyx_PyInt_As_int64_t(__pyx_t_2); if (unlikely((__pyx_t_5 == ((int64_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 2137, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __pyx_r = __pyx_t_5;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":2143\n *     Returns the number of states.\n *     \"\"\"\n *     return self._mfst.get().NumStates()             # <<<<<<<<<<<<<<\n * \n *   cdef void _project(self, bool project_output=False) except *:\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_mfst\");\n    __PYX_ERR(0, 2143, __pyx_L1_error)\n  }\n  __pyx_r = __pyx_v_self->_mfst.get()->NumStates();\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":2137\n *     return _init_MutableFstSymbolTable(tst, self._mfst)\n * \n *   cpdef int64 num_states(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     num_states(self)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_WriteUnraisable(\"pywrapfst._MutableFst.num_states\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_31num_states(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_11_MutableFst_30num_states[] = \"\\n    num_states(self)\\n\\n    Returns the number of states.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_31num_states(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"num_states (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_11_MutableFst_30num_states(((struct __pyx_obj_9pywrapfst__MutableFst *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_30num_states(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"num_states\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __Pyx_PyInt_From_int64_t(__pyx_f_9pywrapfst_11_MutableFst_num_states(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2137, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst.num_states\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":2145\n *     return self._mfst.get().NumStates()\n * \n *   cdef void _project(self, bool project_output=False) except *:             # <<<<<<<<<<<<<<\n *     fst.Project(self._mfst.get(), fst.GetProjectType(project_output))\n *     self._check_mutating_imethod()\n */\n\nstatic void __pyx_f_9pywrapfst_11_MutableFst__project(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, struct __pyx_opt_args_9pywrapfst_11_MutableFst__project *__pyx_optional_args) {\n  bool __pyx_v_project_output = ((bool)0);\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"_project\", 0);\n  if (__pyx_optional_args) {\n    if (__pyx_optional_args->__pyx_n > 0) {\n      __pyx_v_project_output = __pyx_optional_args->project_output;\n    }\n  }\n\n  /* \"pywrapfst.pyx\":2146\n * \n *   cdef void _project(self, bool project_output=False) except *:\n *     fst.Project(self._mfst.get(), fst.GetProjectType(project_output))             # <<<<<<<<<<<<<<\n *     self._check_mutating_imethod()\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_mfst\");\n    __PYX_ERR(0, 2146, __pyx_L1_error)\n  }\n  fst::script::Project(__pyx_v_self->_mfst.get(), fst::script::GetProjectType(__pyx_v_project_output));\n\n  /* \"pywrapfst.pyx\":2147\n *   cdef void _project(self, bool project_output=False) except *:\n *     fst.Project(self._mfst.get(), fst.GetProjectType(project_output))\n *     self._check_mutating_imethod()             # <<<<<<<<<<<<<<\n * \n *   def project(self, bool project_output=False):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_check_mutating_imethod\");\n    __PYX_ERR(0, 2147, __pyx_L1_error)\n  }\n  ((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->_check_mutating_imethod(__pyx_v_self); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 2147, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":2145\n *     return self._mfst.get().NumStates()\n * \n *   cdef void _project(self, bool project_output=False) except *:             # <<<<<<<<<<<<<<\n *     fst.Project(self._mfst.get(), fst.GetProjectType(project_output))\n *     self._check_mutating_imethod()\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst._project\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n}\n\n/* \"pywrapfst.pyx\":2149\n *     self._check_mutating_imethod()\n * \n *   def project(self, bool project_output=False):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     project(self, project_output=False)\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_33project(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic char __pyx_doc_9pywrapfst_11_MutableFst_32project[] = \"\\n    project(self, project_output=False)\\n\\n    Converts the FST to an acceptor using input or output labels.\\n\\n    This operation destructively projects an FST onto its domain or range by\\n    either copying each arc's input label to its output label (the default) or\\n    vice versa.\\n\\n    Args:\\n      project_output: Should the output labels be projected?\\n\\n    Returns:\\n      self.\\n\\n    See also: `decode`, `encode`, `relabel_pairs`, `relabel_symbols`.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_33project(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  bool __pyx_v_project_output;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"project (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_project_output,0};\n    PyObject* values[1] = {0};\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_project_output);\n          if (value) { values[0] = value; kw_args--; }\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"project\") < 0)) __PYX_ERR(0, 2149, __pyx_L3_error)\n      }\n    } else {\n      switch (PyTuple_GET_SIZE(__pyx_args)) {\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n    }\n    if (values[0]) {\n      __pyx_v_project_output = __Pyx_PyObject_IsTrue(values[0]); if (unlikely((__pyx_v_project_output == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 2149, __pyx_L3_error)\n    } else {\n      __pyx_v_project_output = ((bool)0);\n    }\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"project\", 0, 0, 1, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 2149, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst.project\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  __pyx_r = __pyx_pf_9pywrapfst_11_MutableFst_32project(((struct __pyx_obj_9pywrapfst__MutableFst *)__pyx_v_self), __pyx_v_project_output);\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_32project(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, bool __pyx_v_project_output) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  struct __pyx_opt_args_9pywrapfst_11_MutableFst__project __pyx_t_1;\n  __Pyx_RefNannySetupContext(\"project\", 0);\n\n  /* \"pywrapfst.pyx\":2167\n *     See also: `decode`, `encode`, `relabel_pairs`, `relabel_symbols`.\n *     \"\"\"\n *     self._project(project_output)             # <<<<<<<<<<<<<<\n *     return self\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_project\");\n    __PYX_ERR(0, 2167, __pyx_L1_error)\n  }\n  __pyx_t_1.__pyx_n = 1;\n  __pyx_t_1.project_output = __pyx_v_project_output;\n  ((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->_project(__pyx_v_self, &__pyx_t_1); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 2167, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":2168\n *     \"\"\"\n *     self._project(project_output)\n *     return self             # <<<<<<<<<<<<<<\n * \n *   cdef void _prune(self, float delta=fst.kDelta, int64 nstate=fst.kNoStateId,\n */\n  __Pyx_XDECREF(__pyx_r);\n  __Pyx_INCREF(((PyObject *)__pyx_v_self));\n  __pyx_r = ((PyObject *)__pyx_v_self);\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":2149\n *     self._check_mutating_imethod()\n * \n *   def project(self, bool project_output=False):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     project(self, project_output=False)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst.project\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":2170\n *     return self\n * \n *   cdef void _prune(self, float delta=fst.kDelta, int64 nstate=fst.kNoStateId,             # <<<<<<<<<<<<<<\n *                    weight=None) except *:\n *     # Threshold is set to semiring Zero (no pruning) if no weight is specified.\n */\n\nstatic void __pyx_f_9pywrapfst_11_MutableFst__prune(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, struct __pyx_opt_args_9pywrapfst_11_MutableFst__prune *__pyx_optional_args) {\n  float __pyx_v_delta = __pyx_k__37;\n  __pyx_t_10basictypes_int64 __pyx_v_nstate = __pyx_k__38;\n\n  /* \"pywrapfst.pyx\":2171\n * \n *   cdef void _prune(self, float delta=fst.kDelta, int64 nstate=fst.kNoStateId,\n *                    weight=None) except *:             # <<<<<<<<<<<<<<\n *     # Threshold is set to semiring Zero (no pruning) if no weight is specified.\n *     cdef fst.WeightClass wc = _get_WeightClass_or_Zero(self.weight_type(),\n */\n  PyObject *__pyx_v_weight = ((PyObject *)Py_None);\n  fst::script::WeightClass __pyx_v_wc;\n  __Pyx_RefNannyDeclarations\n  fst::script::WeightClass __pyx_t_1;\n  __Pyx_RefNannySetupContext(\"_prune\", 0);\n  if (__pyx_optional_args) {\n    if (__pyx_optional_args->__pyx_n > 0) {\n      __pyx_v_delta = __pyx_optional_args->delta;\n      if (__pyx_optional_args->__pyx_n > 1) {\n        __pyx_v_nstate = __pyx_optional_args->nstate;\n        if (__pyx_optional_args->__pyx_n > 2) {\n          __pyx_v_weight = __pyx_optional_args->weight;\n        }\n      }\n    }\n  }\n\n  /* \"pywrapfst.pyx\":2173\n *                    weight=None) except *:\n *     # Threshold is set to semiring Zero (no pruning) if no weight is specified.\n *     cdef fst.WeightClass wc = _get_WeightClass_or_Zero(self.weight_type(),             # <<<<<<<<<<<<<<\n *                                                        weight)\n *     fst.Prune(self._mfst.get(), wc, nstate, delta)\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"weight_type\");\n    __PYX_ERR(0, 2173, __pyx_L1_error)\n  }\n\n  /* \"pywrapfst.pyx\":2174\n *     # Threshold is set to semiring Zero (no pruning) if no weight is specified.\n *     cdef fst.WeightClass wc = _get_WeightClass_or_Zero(self.weight_type(),\n *                                                        weight)             # <<<<<<<<<<<<<<\n *     fst.Prune(self._mfst.get(), wc, nstate, delta)\n *     self._check_mutating_imethod()\n */\n  __pyx_t_1 = __pyx_f_9pywrapfst__get_WeightClass_or_Zero(((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->__pyx_base.weight_type(((struct __pyx_obj_9pywrapfst__Fst *)__pyx_v_self), 0), __pyx_v_weight); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 2173, __pyx_L1_error)\n  __pyx_v_wc = __pyx_t_1;\n\n  /* \"pywrapfst.pyx\":2175\n *     cdef fst.WeightClass wc = _get_WeightClass_or_Zero(self.weight_type(),\n *                                                        weight)\n *     fst.Prune(self._mfst.get(), wc, nstate, delta)             # <<<<<<<<<<<<<<\n *     self._check_mutating_imethod()\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_mfst\");\n    __PYX_ERR(0, 2175, __pyx_L1_error)\n  }\n  fst::script::Prune(__pyx_v_self->_mfst.get(), __pyx_v_wc, __pyx_v_nstate, __pyx_v_delta);\n\n  /* \"pywrapfst.pyx\":2176\n *                                                        weight)\n *     fst.Prune(self._mfst.get(), wc, nstate, delta)\n *     self._check_mutating_imethod()             # <<<<<<<<<<<<<<\n * \n *   def prune(self,\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_check_mutating_imethod\");\n    __PYX_ERR(0, 2176, __pyx_L1_error)\n  }\n  ((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->_check_mutating_imethod(__pyx_v_self); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 2176, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":2170\n *     return self\n * \n *   cdef void _prune(self, float delta=fst.kDelta, int64 nstate=fst.kNoStateId,             # <<<<<<<<<<<<<<\n *                    weight=None) except *:\n *     # Threshold is set to semiring Zero (no pruning) if no weight is specified.\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst._prune\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n}\n\n/* \"pywrapfst.pyx\":2178\n *     self._check_mutating_imethod()\n * \n *   def prune(self,             # <<<<<<<<<<<<<<\n *             float delta=fst.kDelta,\n *             int64 nstate=fst.kNoStateId,\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_35prune(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic char __pyx_doc_9pywrapfst_11_MutableFst_34prune[] = \"\\n    prune(self, delta=0.0009765625, nstate=NO_STATE_ID, weight=None)\\n\\n    Removes paths with weights below a certain threshold.\\n\\n    This operation deletes states and arcs in the input FST that do not belong\\n    to a successful path whose weight is no more (w.r.t the natural semiring\\n    order) than the threshold t \\\\otimes-times the weight of the shortest path in\\n    the input FST. Weights must be commutative and have the path property.\\n\\n    Args:\\n      delta: Comparison/quantization delta.\\n      nstate: State number threshold.\\n      weight: A Weight or weight string indicating the desired weight threshold\\n          below which paths are pruned; if omitted, no paths are pruned.\\n\\n    Returns:\\n      self.\\n\\n    See also: The constructive variant.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_35prune(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  float __pyx_v_delta;\n  __pyx_t_10basictypes_int64 __pyx_v_nstate;\n  PyObject *__pyx_v_weight = 0;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"prune (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_delta,&__pyx_n_s_nstate,&__pyx_n_s_weight,0};\n    PyObject* values[3] = {0,0,0};\n\n    /* \"pywrapfst.pyx\":2181\n *             float delta=fst.kDelta,\n *             int64 nstate=fst.kNoStateId,\n *             weight=None):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     prune(self, delta=0.0009765625, nstate=NO_STATE_ID, weight=None)\n */\n    values[2] = ((PyObject *)Py_None);\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);\n        CYTHON_FALLTHROUGH;\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_delta);\n          if (value) { values[0] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  1:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_nstate);\n          if (value) { values[1] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  2:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_weight);\n          if (value) { values[2] = value; kw_args--; }\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"prune\") < 0)) __PYX_ERR(0, 2178, __pyx_L3_error)\n      }\n    } else {\n      switch (PyTuple_GET_SIZE(__pyx_args)) {\n        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);\n        CYTHON_FALLTHROUGH;\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n    }\n    if (values[0]) {\n      __pyx_v_delta = __pyx_PyFloat_AsFloat(values[0]); if (unlikely((__pyx_v_delta == (float)-1) && PyErr_Occurred())) __PYX_ERR(0, 2179, __pyx_L3_error)\n    } else {\n      __pyx_v_delta = __pyx_k__39;\n    }\n    if (values[1]) {\n      __pyx_v_nstate = __Pyx_PyInt_As_int64_t(values[1]); if (unlikely((__pyx_v_nstate == ((int64_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 2180, __pyx_L3_error)\n    } else {\n      __pyx_v_nstate = __pyx_k__40;\n    }\n    __pyx_v_weight = values[2];\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"prune\", 0, 0, 3, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 2178, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst.prune\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  __pyx_r = __pyx_pf_9pywrapfst_11_MutableFst_34prune(((struct __pyx_obj_9pywrapfst__MutableFst *)__pyx_v_self), __pyx_v_delta, __pyx_v_nstate, __pyx_v_weight);\n\n  /* \"pywrapfst.pyx\":2178\n *     self._check_mutating_imethod()\n * \n *   def prune(self,             # <<<<<<<<<<<<<<\n *             float delta=fst.kDelta,\n *             int64 nstate=fst.kNoStateId,\n */\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_34prune(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, float __pyx_v_delta, __pyx_t_10basictypes_int64 __pyx_v_nstate, PyObject *__pyx_v_weight) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  struct __pyx_opt_args_9pywrapfst_11_MutableFst__prune __pyx_t_1;\n  __Pyx_RefNannySetupContext(\"prune\", 0);\n\n  /* \"pywrapfst.pyx\":2203\n *     See also: The constructive variant.\n *     \"\"\"\n *     self._prune(delta, nstate, weight)             # <<<<<<<<<<<<<<\n *     return self\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_prune\");\n    __PYX_ERR(0, 2203, __pyx_L1_error)\n  }\n  __pyx_t_1.__pyx_n = 3;\n  __pyx_t_1.delta = __pyx_v_delta;\n  __pyx_t_1.nstate = __pyx_v_nstate;\n  __pyx_t_1.weight = __pyx_v_weight;\n  ((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->_prune(__pyx_v_self, &__pyx_t_1); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 2203, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":2204\n *     \"\"\"\n *     self._prune(delta, nstate, weight)\n *     return self             # <<<<<<<<<<<<<<\n * \n *   cdef void _push(self,\n */\n  __Pyx_XDECREF(__pyx_r);\n  __Pyx_INCREF(((PyObject *)__pyx_v_self));\n  __pyx_r = ((PyObject *)__pyx_v_self);\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":2178\n *     self._check_mutating_imethod()\n * \n *   def prune(self,             # <<<<<<<<<<<<<<\n *             float delta=fst.kDelta,\n *             int64 nstate=fst.kNoStateId,\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst.prune\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":2206\n *     return self\n * \n *   cdef void _push(self,             # <<<<<<<<<<<<<<\n *                   float delta=fst.kDelta,\n *                   bool remove_total_weight=False,\n */\n\nstatic void __pyx_f_9pywrapfst_11_MutableFst__push(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, struct __pyx_opt_args_9pywrapfst_11_MutableFst__push *__pyx_optional_args) {\n  float __pyx_v_delta = __pyx_k__41;\n\n  /* \"pywrapfst.pyx\":2208\n *   cdef void _push(self,\n *                   float delta=fst.kDelta,\n *                   bool remove_total_weight=False,             # <<<<<<<<<<<<<<\n *                   bool to_final=False) except *:\n *     fst.Push(self._mfst.get(), fst.GetReweightType(to_final), delta,\n */\n  bool __pyx_v_remove_total_weight = ((bool)0);\n\n  /* \"pywrapfst.pyx\":2209\n *                   float delta=fst.kDelta,\n *                   bool remove_total_weight=False,\n *                   bool to_final=False) except *:             # <<<<<<<<<<<<<<\n *     fst.Push(self._mfst.get(), fst.GetReweightType(to_final), delta,\n *              remove_total_weight)\n */\n  bool __pyx_v_to_final = ((bool)0);\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"_push\", 0);\n  if (__pyx_optional_args) {\n    if (__pyx_optional_args->__pyx_n > 0) {\n      __pyx_v_delta = __pyx_optional_args->delta;\n      if (__pyx_optional_args->__pyx_n > 1) {\n        __pyx_v_remove_total_weight = __pyx_optional_args->remove_total_weight;\n        if (__pyx_optional_args->__pyx_n > 2) {\n          __pyx_v_to_final = __pyx_optional_args->to_final;\n        }\n      }\n    }\n  }\n\n  /* \"pywrapfst.pyx\":2210\n *                   bool remove_total_weight=False,\n *                   bool to_final=False) except *:\n *     fst.Push(self._mfst.get(), fst.GetReweightType(to_final), delta,             # <<<<<<<<<<<<<<\n *              remove_total_weight)\n *     self._check_mutating_imethod()\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_mfst\");\n    __PYX_ERR(0, 2210, __pyx_L1_error)\n  }\n\n  /* \"pywrapfst.pyx\":2211\n *                   bool to_final=False) except *:\n *     fst.Push(self._mfst.get(), fst.GetReweightType(to_final), delta,\n *              remove_total_weight)             # <<<<<<<<<<<<<<\n *     self._check_mutating_imethod()\n * \n */\n  fst::script::Push(__pyx_v_self->_mfst.get(), fst::script::GetReweightType(__pyx_v_to_final), __pyx_v_delta, __pyx_v_remove_total_weight);\n\n  /* \"pywrapfst.pyx\":2212\n *     fst.Push(self._mfst.get(), fst.GetReweightType(to_final), delta,\n *              remove_total_weight)\n *     self._check_mutating_imethod()             # <<<<<<<<<<<<<<\n * \n *   def push(self,\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_check_mutating_imethod\");\n    __PYX_ERR(0, 2212, __pyx_L1_error)\n  }\n  ((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->_check_mutating_imethod(__pyx_v_self); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 2212, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":2206\n *     return self\n * \n *   cdef void _push(self,             # <<<<<<<<<<<<<<\n *                   float delta=fst.kDelta,\n *                   bool remove_total_weight=False,\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst._push\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n}\n\n/* \"pywrapfst.pyx\":2214\n *     self._check_mutating_imethod()\n * \n *   def push(self,             # <<<<<<<<<<<<<<\n *            float delta=fst.kDelta,\n *            bool remove_total_weight=False,\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_37push(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic char __pyx_doc_9pywrapfst_11_MutableFst_36push[] = \"\\n    push(self, delta=0.0009765625, remove_total_weight=False, to_final=False)\\n\\n    Pushes weights towards the initial or final states.\\n\\n    This operation destructively produces an equivalent transducer by pushing\\n    the weights towards the initial state or toward the final states. When\\n    pushing weights towards the initial state, the sum of the weight of the\\n    outgoing transitions and final weight at any non-initial state is equal to\\n    one in the resulting machine. When pushing weights towards the final states,\\n    the sum of the weight of the incoming transitions at any state is equal to\\n    one. Weights need to be left distributive when pushing towards the initial\\n    state and right distributive when pushing towards the final states.\\n\\n    Args:\\n      delta: Comparison/quantization delta.\\n      remove_total_weight: If pushing weights, should the total weight be\\n          removed?\\n      to_final: Push towards final states?\\n\\n    Returns:\\n      self.\\n\\n    See also: The constructive variant, which also supports label pushing.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_37push(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  float __pyx_v_delta;\n  bool __pyx_v_remove_total_weight;\n  bool __pyx_v_to_final;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"push (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_delta,&__pyx_n_s_remove_total_weight,&__pyx_n_s_to_final,0};\n    PyObject* values[3] = {0,0,0};\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);\n        CYTHON_FALLTHROUGH;\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_delta);\n          if (value) { values[0] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  1:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_remove_total_weight);\n          if (value) { values[1] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  2:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_to_final);\n          if (value) { values[2] = value; kw_args--; }\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"push\") < 0)) __PYX_ERR(0, 2214, __pyx_L3_error)\n      }\n    } else {\n      switch (PyTuple_GET_SIZE(__pyx_args)) {\n        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);\n        CYTHON_FALLTHROUGH;\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n    }\n    if (values[0]) {\n      __pyx_v_delta = __pyx_PyFloat_AsFloat(values[0]); if (unlikely((__pyx_v_delta == (float)-1) && PyErr_Occurred())) __PYX_ERR(0, 2215, __pyx_L3_error)\n    } else {\n      __pyx_v_delta = __pyx_k__42;\n    }\n    if (values[1]) {\n      __pyx_v_remove_total_weight = __Pyx_PyObject_IsTrue(values[1]); if (unlikely((__pyx_v_remove_total_weight == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 2216, __pyx_L3_error)\n    } else {\n\n      /* \"pywrapfst.pyx\":2216\n *   def push(self,\n *            float delta=fst.kDelta,\n *            bool remove_total_weight=False,             # <<<<<<<<<<<<<<\n *            bool to_final=False):\n *     \"\"\"\n */\n      __pyx_v_remove_total_weight = ((bool)0);\n    }\n    if (values[2]) {\n      __pyx_v_to_final = __Pyx_PyObject_IsTrue(values[2]); if (unlikely((__pyx_v_to_final == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 2217, __pyx_L3_error)\n    } else {\n\n      /* \"pywrapfst.pyx\":2217\n *            float delta=fst.kDelta,\n *            bool remove_total_weight=False,\n *            bool to_final=False):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     push(self, delta=0.0009765625, remove_total_weight=False, to_final=False)\n */\n      __pyx_v_to_final = ((bool)0);\n    }\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"push\", 0, 0, 3, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 2214, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst.push\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  __pyx_r = __pyx_pf_9pywrapfst_11_MutableFst_36push(((struct __pyx_obj_9pywrapfst__MutableFst *)__pyx_v_self), __pyx_v_delta, __pyx_v_remove_total_weight, __pyx_v_to_final);\n\n  /* \"pywrapfst.pyx\":2214\n *     self._check_mutating_imethod()\n * \n *   def push(self,             # <<<<<<<<<<<<<<\n *            float delta=fst.kDelta,\n *            bool remove_total_weight=False,\n */\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_36push(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, float __pyx_v_delta, bool __pyx_v_remove_total_weight, bool __pyx_v_to_final) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  struct __pyx_opt_args_9pywrapfst_11_MutableFst__push __pyx_t_1;\n  __Pyx_RefNannySetupContext(\"push\", 0);\n\n  /* \"pywrapfst.pyx\":2243\n *     See also: The constructive variant, which also supports label pushing.\n *     \"\"\"\n *     self._push(delta, remove_total_weight, to_final)             # <<<<<<<<<<<<<<\n *     return self\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_push\");\n    __PYX_ERR(0, 2243, __pyx_L1_error)\n  }\n  __pyx_t_1.__pyx_n = 3;\n  __pyx_t_1.delta = __pyx_v_delta;\n  __pyx_t_1.remove_total_weight = __pyx_v_remove_total_weight;\n  __pyx_t_1.to_final = __pyx_v_to_final;\n  ((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->_push(__pyx_v_self, &__pyx_t_1); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 2243, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":2244\n *     \"\"\"\n *     self._push(delta, remove_total_weight, to_final)\n *     return self             # <<<<<<<<<<<<<<\n * \n *   cdef void _relabel_pairs(self, ipairs=None, opairs=None) except *:\n */\n  __Pyx_XDECREF(__pyx_r);\n  __Pyx_INCREF(((PyObject *)__pyx_v_self));\n  __pyx_r = ((PyObject *)__pyx_v_self);\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":2214\n *     self._check_mutating_imethod()\n * \n *   def push(self,             # <<<<<<<<<<<<<<\n *            float delta=fst.kDelta,\n *            bool remove_total_weight=False,\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst.push\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":2246\n *     return self\n * \n *   cdef void _relabel_pairs(self, ipairs=None, opairs=None) except *:             # <<<<<<<<<<<<<<\n *     cdef unique_ptr[vector[fst.LabelPair]] _ipairs\n *     _ipairs.reset(new vector[fst.LabelPair]())\n */\n\nstatic void __pyx_f_9pywrapfst_11_MutableFst__relabel_pairs(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, struct __pyx_opt_args_9pywrapfst_11_MutableFst__relabel_pairs *__pyx_optional_args) {\n  PyObject *__pyx_v_ipairs = ((PyObject *)Py_None);\n  PyObject *__pyx_v_opairs = ((PyObject *)Py_None);\n  std::unique_ptr<std::vector<__pyx_t_3fst_LabelPair> >  __pyx_v__ipairs;\n  std::unique_ptr<std::vector<__pyx_t_3fst_LabelPair> >  __pyx_v__opairs;\n  __pyx_t_10basictypes_int64 __pyx_v_before;\n  __pyx_t_10basictypes_int64 __pyx_v_after;\n  __Pyx_RefNannyDeclarations\n  std::vector<__pyx_t_3fst_LabelPair>  *__pyx_t_1;\n  int __pyx_t_2;\n  PyObject *__pyx_t_3 = NULL;\n  Py_ssize_t __pyx_t_4;\n  PyObject *(*__pyx_t_5)(PyObject *);\n  PyObject *__pyx_t_6 = NULL;\n  PyObject *__pyx_t_7 = NULL;\n  PyObject *__pyx_t_8 = NULL;\n  PyObject *__pyx_t_9 = NULL;\n  PyObject *(*__pyx_t_10)(PyObject *);\n  __pyx_t_10basictypes_int64 __pyx_t_11;\n  __pyx_t_10basictypes_int64 __pyx_t_12;\n  __pyx_t_3fst_LabelPair __pyx_t_13;\n  int __pyx_t_14;\n  __Pyx_RefNannySetupContext(\"_relabel_pairs\", 0);\n  if (__pyx_optional_args) {\n    if (__pyx_optional_args->__pyx_n > 0) {\n      __pyx_v_ipairs = __pyx_optional_args->ipairs;\n      if (__pyx_optional_args->__pyx_n > 1) {\n        __pyx_v_opairs = __pyx_optional_args->opairs;\n      }\n    }\n  }\n\n  /* \"pywrapfst.pyx\":2248\n *   cdef void _relabel_pairs(self, ipairs=None, opairs=None) except *:\n *     cdef unique_ptr[vector[fst.LabelPair]] _ipairs\n *     _ipairs.reset(new vector[fst.LabelPair]())             # <<<<<<<<<<<<<<\n *     cdef unique_ptr[vector[fst.LabelPair]] _opairs\n *     _opairs.reset(new vector[fst.LabelPair]())\n */\n  try {\n    __pyx_t_1 = new std::vector<__pyx_t_3fst_LabelPair> ();\n  } catch(...) {\n    __Pyx_CppExn2PyErr();\n    __PYX_ERR(0, 2248, __pyx_L1_error)\n  }\n  __pyx_v__ipairs.reset(__pyx_t_1);\n\n  /* \"pywrapfst.pyx\":2250\n *     _ipairs.reset(new vector[fst.LabelPair]())\n *     cdef unique_ptr[vector[fst.LabelPair]] _opairs\n *     _opairs.reset(new vector[fst.LabelPair]())             # <<<<<<<<<<<<<<\n *     cdef int64 before\n *     cdef int64 after\n */\n  try {\n    __pyx_t_1 = new std::vector<__pyx_t_3fst_LabelPair> ();\n  } catch(...) {\n    __Pyx_CppExn2PyErr();\n    __PYX_ERR(0, 2250, __pyx_L1_error)\n  }\n  __pyx_v__opairs.reset(__pyx_t_1);\n\n  /* \"pywrapfst.pyx\":2253\n *     cdef int64 before\n *     cdef int64 after\n *     if ipairs:             # <<<<<<<<<<<<<<\n *       for (before, after) in ipairs:\n *         _ipairs.get().push_back(fst.LabelPair(before, after))\n */\n  __pyx_t_2 = __Pyx_PyObject_IsTrue(__pyx_v_ipairs); if (unlikely(__pyx_t_2 < 0)) __PYX_ERR(0, 2253, __pyx_L1_error)\n  if (__pyx_t_2) {\n\n    /* \"pywrapfst.pyx\":2254\n *     cdef int64 after\n *     if ipairs:\n *       for (before, after) in ipairs:             # <<<<<<<<<<<<<<\n *         _ipairs.get().push_back(fst.LabelPair(before, after))\n *     if opairs:\n */\n    if (likely(PyList_CheckExact(__pyx_v_ipairs)) || PyTuple_CheckExact(__pyx_v_ipairs)) {\n      __pyx_t_3 = __pyx_v_ipairs; __Pyx_INCREF(__pyx_t_3); __pyx_t_4 = 0;\n      __pyx_t_5 = NULL;\n    } else {\n      __pyx_t_4 = -1; __pyx_t_3 = PyObject_GetIter(__pyx_v_ipairs); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 2254, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_3);\n      __pyx_t_5 = Py_TYPE(__pyx_t_3)->tp_iternext; if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 2254, __pyx_L1_error)\n    }\n    for (;;) {\n      if (likely(!__pyx_t_5)) {\n        if (likely(PyList_CheckExact(__pyx_t_3))) {\n          if (__pyx_t_4 >= PyList_GET_SIZE(__pyx_t_3)) break;\n          #if CYTHON_ASSUME_SAFE_MACROS && !CYTHON_AVOID_BORROWED_REFS\n          __pyx_t_6 = PyList_GET_ITEM(__pyx_t_3, __pyx_t_4); __Pyx_INCREF(__pyx_t_6); __pyx_t_4++; if (unlikely(0 < 0)) __PYX_ERR(0, 2254, __pyx_L1_error)\n          #else\n          __pyx_t_6 = PySequence_ITEM(__pyx_t_3, __pyx_t_4); __pyx_t_4++; if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 2254, __pyx_L1_error)\n          __Pyx_GOTREF(__pyx_t_6);\n          #endif\n        } else {\n          if (__pyx_t_4 >= PyTuple_GET_SIZE(__pyx_t_3)) break;\n          #if CYTHON_ASSUME_SAFE_MACROS && !CYTHON_AVOID_BORROWED_REFS\n          __pyx_t_6 = PyTuple_GET_ITEM(__pyx_t_3, __pyx_t_4); __Pyx_INCREF(__pyx_t_6); __pyx_t_4++; if (unlikely(0 < 0)) __PYX_ERR(0, 2254, __pyx_L1_error)\n          #else\n          __pyx_t_6 = PySequence_ITEM(__pyx_t_3, __pyx_t_4); __pyx_t_4++; if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 2254, __pyx_L1_error)\n          __Pyx_GOTREF(__pyx_t_6);\n          #endif\n        }\n      } else {\n        __pyx_t_6 = __pyx_t_5(__pyx_t_3);\n        if (unlikely(!__pyx_t_6)) {\n          PyObject* exc_type = PyErr_Occurred();\n          if (exc_type) {\n            if (likely(__Pyx_PyErr_GivenExceptionMatches(exc_type, PyExc_StopIteration))) PyErr_Clear();\n            else __PYX_ERR(0, 2254, __pyx_L1_error)\n          }\n          break;\n        }\n        __Pyx_GOTREF(__pyx_t_6);\n      }\n      if ((likely(PyTuple_CheckExact(__pyx_t_6))) || (PyList_CheckExact(__pyx_t_6))) {\n        PyObject* sequence = __pyx_t_6;\n        #if !CYTHON_COMPILING_IN_PYPY\n        Py_ssize_t size = Py_SIZE(sequence);\n        #else\n        Py_ssize_t size = PySequence_Size(sequence);\n        #endif\n        if (unlikely(size != 2)) {\n          if (size > 2) __Pyx_RaiseTooManyValuesError(2);\n          else if (size >= 0) __Pyx_RaiseNeedMoreValuesError(size);\n          __PYX_ERR(0, 2254, __pyx_L1_error)\n        }\n        #if CYTHON_ASSUME_SAFE_MACROS && !CYTHON_AVOID_BORROWED_REFS\n        if (likely(PyTuple_CheckExact(sequence))) {\n          __pyx_t_7 = PyTuple_GET_ITEM(sequence, 0); \n          __pyx_t_8 = PyTuple_GET_ITEM(sequence, 1); \n        } else {\n          __pyx_t_7 = PyList_GET_ITEM(sequence, 0); \n          __pyx_t_8 = PyList_GET_ITEM(sequence, 1); \n        }\n        __Pyx_INCREF(__pyx_t_7);\n        __Pyx_INCREF(__pyx_t_8);\n        #else\n        __pyx_t_7 = PySequence_ITEM(sequence, 0); if (unlikely(!__pyx_t_7)) __PYX_ERR(0, 2254, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_7);\n        __pyx_t_8 = PySequence_ITEM(sequence, 1); if (unlikely(!__pyx_t_8)) __PYX_ERR(0, 2254, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_8);\n        #endif\n        __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n      } else {\n        Py_ssize_t index = -1;\n        __pyx_t_9 = PyObject_GetIter(__pyx_t_6); if (unlikely(!__pyx_t_9)) __PYX_ERR(0, 2254, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_9);\n        __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n        __pyx_t_10 = Py_TYPE(__pyx_t_9)->tp_iternext;\n        index = 0; __pyx_t_7 = __pyx_t_10(__pyx_t_9); if (unlikely(!__pyx_t_7)) goto __pyx_L6_unpacking_failed;\n        __Pyx_GOTREF(__pyx_t_7);\n        index = 1; __pyx_t_8 = __pyx_t_10(__pyx_t_9); if (unlikely(!__pyx_t_8)) goto __pyx_L6_unpacking_failed;\n        __Pyx_GOTREF(__pyx_t_8);\n        if (__Pyx_IternextUnpackEndCheck(__pyx_t_10(__pyx_t_9), 2) < 0) __PYX_ERR(0, 2254, __pyx_L1_error)\n        __pyx_t_10 = NULL;\n        __Pyx_DECREF(__pyx_t_9); __pyx_t_9 = 0;\n        goto __pyx_L7_unpacking_done;\n        __pyx_L6_unpacking_failed:;\n        __Pyx_DECREF(__pyx_t_9); __pyx_t_9 = 0;\n        __pyx_t_10 = NULL;\n        if (__Pyx_IterFinish() == 0) __Pyx_RaiseNeedMoreValuesError(index);\n        __PYX_ERR(0, 2254, __pyx_L1_error)\n        __pyx_L7_unpacking_done:;\n      }\n      __pyx_t_11 = __Pyx_PyInt_As_int64_t(__pyx_t_7); if (unlikely((__pyx_t_11 == ((int64_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 2254, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0;\n      __pyx_t_12 = __Pyx_PyInt_As_int64_t(__pyx_t_8); if (unlikely((__pyx_t_12 == ((int64_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 2254, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0;\n      __pyx_v_before = __pyx_t_11;\n      __pyx_v_after = __pyx_t_12;\n\n      /* \"pywrapfst.pyx\":2255\n *     if ipairs:\n *       for (before, after) in ipairs:\n *         _ipairs.get().push_back(fst.LabelPair(before, after))             # <<<<<<<<<<<<<<\n *     if opairs:\n *       for (before, after) in opairs:\n */\n      try {\n        __pyx_t_13 = __pyx_t_3fst_LabelPair(__pyx_v_before, __pyx_v_after);\n      } catch(...) {\n        __Pyx_CppExn2PyErr();\n        __PYX_ERR(0, 2255, __pyx_L1_error)\n      }\n      try {\n        __pyx_v__ipairs.get()->push_back(__pyx_t_13);\n      } catch(...) {\n        __Pyx_CppExn2PyErr();\n        __PYX_ERR(0, 2255, __pyx_L1_error)\n      }\n\n      /* \"pywrapfst.pyx\":2254\n *     cdef int64 after\n *     if ipairs:\n *       for (before, after) in ipairs:             # <<<<<<<<<<<<<<\n *         _ipairs.get().push_back(fst.LabelPair(before, after))\n *     if opairs:\n */\n    }\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n\n    /* \"pywrapfst.pyx\":2253\n *     cdef int64 before\n *     cdef int64 after\n *     if ipairs:             # <<<<<<<<<<<<<<\n *       for (before, after) in ipairs:\n *         _ipairs.get().push_back(fst.LabelPair(before, after))\n */\n  }\n\n  /* \"pywrapfst.pyx\":2256\n *       for (before, after) in ipairs:\n *         _ipairs.get().push_back(fst.LabelPair(before, after))\n *     if opairs:             # <<<<<<<<<<<<<<\n *       for (before, after) in opairs:\n *         _opairs.get().push_back(fst.LabelPair(before, after))\n */\n  __pyx_t_2 = __Pyx_PyObject_IsTrue(__pyx_v_opairs); if (unlikely(__pyx_t_2 < 0)) __PYX_ERR(0, 2256, __pyx_L1_error)\n  if (__pyx_t_2) {\n\n    /* \"pywrapfst.pyx\":2257\n *         _ipairs.get().push_back(fst.LabelPair(before, after))\n *     if opairs:\n *       for (before, after) in opairs:             # <<<<<<<<<<<<<<\n *         _opairs.get().push_back(fst.LabelPair(before, after))\n *     if _ipairs.get().empty() and _opairs.get().empty():\n */\n    if (likely(PyList_CheckExact(__pyx_v_opairs)) || PyTuple_CheckExact(__pyx_v_opairs)) {\n      __pyx_t_3 = __pyx_v_opairs; __Pyx_INCREF(__pyx_t_3); __pyx_t_4 = 0;\n      __pyx_t_5 = NULL;\n    } else {\n      __pyx_t_4 = -1; __pyx_t_3 = PyObject_GetIter(__pyx_v_opairs); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 2257, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_3);\n      __pyx_t_5 = Py_TYPE(__pyx_t_3)->tp_iternext; if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 2257, __pyx_L1_error)\n    }\n    for (;;) {\n      if (likely(!__pyx_t_5)) {\n        if (likely(PyList_CheckExact(__pyx_t_3))) {\n          if (__pyx_t_4 >= PyList_GET_SIZE(__pyx_t_3)) break;\n          #if CYTHON_ASSUME_SAFE_MACROS && !CYTHON_AVOID_BORROWED_REFS\n          __pyx_t_6 = PyList_GET_ITEM(__pyx_t_3, __pyx_t_4); __Pyx_INCREF(__pyx_t_6); __pyx_t_4++; if (unlikely(0 < 0)) __PYX_ERR(0, 2257, __pyx_L1_error)\n          #else\n          __pyx_t_6 = PySequence_ITEM(__pyx_t_3, __pyx_t_4); __pyx_t_4++; if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 2257, __pyx_L1_error)\n          __Pyx_GOTREF(__pyx_t_6);\n          #endif\n        } else {\n          if (__pyx_t_4 >= PyTuple_GET_SIZE(__pyx_t_3)) break;\n          #if CYTHON_ASSUME_SAFE_MACROS && !CYTHON_AVOID_BORROWED_REFS\n          __pyx_t_6 = PyTuple_GET_ITEM(__pyx_t_3, __pyx_t_4); __Pyx_INCREF(__pyx_t_6); __pyx_t_4++; if (unlikely(0 < 0)) __PYX_ERR(0, 2257, __pyx_L1_error)\n          #else\n          __pyx_t_6 = PySequence_ITEM(__pyx_t_3, __pyx_t_4); __pyx_t_4++; if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 2257, __pyx_L1_error)\n          __Pyx_GOTREF(__pyx_t_6);\n          #endif\n        }\n      } else {\n        __pyx_t_6 = __pyx_t_5(__pyx_t_3);\n        if (unlikely(!__pyx_t_6)) {\n          PyObject* exc_type = PyErr_Occurred();\n          if (exc_type) {\n            if (likely(__Pyx_PyErr_GivenExceptionMatches(exc_type, PyExc_StopIteration))) PyErr_Clear();\n            else __PYX_ERR(0, 2257, __pyx_L1_error)\n          }\n          break;\n        }\n        __Pyx_GOTREF(__pyx_t_6);\n      }\n      if ((likely(PyTuple_CheckExact(__pyx_t_6))) || (PyList_CheckExact(__pyx_t_6))) {\n        PyObject* sequence = __pyx_t_6;\n        #if !CYTHON_COMPILING_IN_PYPY\n        Py_ssize_t size = Py_SIZE(sequence);\n        #else\n        Py_ssize_t size = PySequence_Size(sequence);\n        #endif\n        if (unlikely(size != 2)) {\n          if (size > 2) __Pyx_RaiseTooManyValuesError(2);\n          else if (size >= 0) __Pyx_RaiseNeedMoreValuesError(size);\n          __PYX_ERR(0, 2257, __pyx_L1_error)\n        }\n        #if CYTHON_ASSUME_SAFE_MACROS && !CYTHON_AVOID_BORROWED_REFS\n        if (likely(PyTuple_CheckExact(sequence))) {\n          __pyx_t_8 = PyTuple_GET_ITEM(sequence, 0); \n          __pyx_t_7 = PyTuple_GET_ITEM(sequence, 1); \n        } else {\n          __pyx_t_8 = PyList_GET_ITEM(sequence, 0); \n          __pyx_t_7 = PyList_GET_ITEM(sequence, 1); \n        }\n        __Pyx_INCREF(__pyx_t_8);\n        __Pyx_INCREF(__pyx_t_7);\n        #else\n        __pyx_t_8 = PySequence_ITEM(sequence, 0); if (unlikely(!__pyx_t_8)) __PYX_ERR(0, 2257, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_8);\n        __pyx_t_7 = PySequence_ITEM(sequence, 1); if (unlikely(!__pyx_t_7)) __PYX_ERR(0, 2257, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_7);\n        #endif\n        __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n      } else {\n        Py_ssize_t index = -1;\n        __pyx_t_9 = PyObject_GetIter(__pyx_t_6); if (unlikely(!__pyx_t_9)) __PYX_ERR(0, 2257, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_9);\n        __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n        __pyx_t_10 = Py_TYPE(__pyx_t_9)->tp_iternext;\n        index = 0; __pyx_t_8 = __pyx_t_10(__pyx_t_9); if (unlikely(!__pyx_t_8)) goto __pyx_L11_unpacking_failed;\n        __Pyx_GOTREF(__pyx_t_8);\n        index = 1; __pyx_t_7 = __pyx_t_10(__pyx_t_9); if (unlikely(!__pyx_t_7)) goto __pyx_L11_unpacking_failed;\n        __Pyx_GOTREF(__pyx_t_7);\n        if (__Pyx_IternextUnpackEndCheck(__pyx_t_10(__pyx_t_9), 2) < 0) __PYX_ERR(0, 2257, __pyx_L1_error)\n        __pyx_t_10 = NULL;\n        __Pyx_DECREF(__pyx_t_9); __pyx_t_9 = 0;\n        goto __pyx_L12_unpacking_done;\n        __pyx_L11_unpacking_failed:;\n        __Pyx_DECREF(__pyx_t_9); __pyx_t_9 = 0;\n        __pyx_t_10 = NULL;\n        if (__Pyx_IterFinish() == 0) __Pyx_RaiseNeedMoreValuesError(index);\n        __PYX_ERR(0, 2257, __pyx_L1_error)\n        __pyx_L12_unpacking_done:;\n      }\n      __pyx_t_12 = __Pyx_PyInt_As_int64_t(__pyx_t_8); if (unlikely((__pyx_t_12 == ((int64_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 2257, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0;\n      __pyx_t_11 = __Pyx_PyInt_As_int64_t(__pyx_t_7); if (unlikely((__pyx_t_11 == ((int64_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 2257, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0;\n      __pyx_v_before = __pyx_t_12;\n      __pyx_v_after = __pyx_t_11;\n\n      /* \"pywrapfst.pyx\":2258\n *     if opairs:\n *       for (before, after) in opairs:\n *         _opairs.get().push_back(fst.LabelPair(before, after))             # <<<<<<<<<<<<<<\n *     if _ipairs.get().empty() and _opairs.get().empty():\n *       raise FstArgError(\"No relabeling pairs specified.\")\n */\n      try {\n        __pyx_t_13 = __pyx_t_3fst_LabelPair(__pyx_v_before, __pyx_v_after);\n      } catch(...) {\n        __Pyx_CppExn2PyErr();\n        __PYX_ERR(0, 2258, __pyx_L1_error)\n      }\n      try {\n        __pyx_v__opairs.get()->push_back(__pyx_t_13);\n      } catch(...) {\n        __Pyx_CppExn2PyErr();\n        __PYX_ERR(0, 2258, __pyx_L1_error)\n      }\n\n      /* \"pywrapfst.pyx\":2257\n *         _ipairs.get().push_back(fst.LabelPair(before, after))\n *     if opairs:\n *       for (before, after) in opairs:             # <<<<<<<<<<<<<<\n *         _opairs.get().push_back(fst.LabelPair(before, after))\n *     if _ipairs.get().empty() and _opairs.get().empty():\n */\n    }\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n\n    /* \"pywrapfst.pyx\":2256\n *       for (before, after) in ipairs:\n *         _ipairs.get().push_back(fst.LabelPair(before, after))\n *     if opairs:             # <<<<<<<<<<<<<<\n *       for (before, after) in opairs:\n *         _opairs.get().push_back(fst.LabelPair(before, after))\n */\n  }\n\n  /* \"pywrapfst.pyx\":2259\n *       for (before, after) in opairs:\n *         _opairs.get().push_back(fst.LabelPair(before, after))\n *     if _ipairs.get().empty() and _opairs.get().empty():             # <<<<<<<<<<<<<<\n *       raise FstArgError(\"No relabeling pairs specified.\")\n *     fst.Relabel(self._mfst.get(), deref(_ipairs), deref(_opairs))\n */\n  __pyx_t_14 = (__pyx_v__ipairs.get()->empty() != 0);\n  if (__pyx_t_14) {\n  } else {\n    __pyx_t_2 = __pyx_t_14;\n    goto __pyx_L14_bool_binop_done;\n  }\n  __pyx_t_14 = (__pyx_v__opairs.get()->empty() != 0);\n  __pyx_t_2 = __pyx_t_14;\n  __pyx_L14_bool_binop_done:;\n  if (__pyx_t_2) {\n\n    /* \"pywrapfst.pyx\":2260\n *         _opairs.get().push_back(fst.LabelPair(before, after))\n *     if _ipairs.get().empty() and _opairs.get().empty():\n *       raise FstArgError(\"No relabeling pairs specified.\")             # <<<<<<<<<<<<<<\n *     fst.Relabel(self._mfst.get(), deref(_ipairs), deref(_opairs))\n *     self._check_mutating_imethod()\n */\n    __pyx_t_3 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstArgError); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 2260, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_3);\n    __pyx_t_6 = __Pyx_PyObject_Call(__pyx_t_3, __pyx_tuple__43, NULL); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 2260, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_6);\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    __Pyx_Raise(__pyx_t_6, 0, 0, 0);\n    __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n    __PYX_ERR(0, 2260, __pyx_L1_error)\n\n    /* \"pywrapfst.pyx\":2259\n *       for (before, after) in opairs:\n *         _opairs.get().push_back(fst.LabelPair(before, after))\n *     if _ipairs.get().empty() and _opairs.get().empty():             # <<<<<<<<<<<<<<\n *       raise FstArgError(\"No relabeling pairs specified.\")\n *     fst.Relabel(self._mfst.get(), deref(_ipairs), deref(_opairs))\n */\n  }\n\n  /* \"pywrapfst.pyx\":2261\n *     if _ipairs.get().empty() and _opairs.get().empty():\n *       raise FstArgError(\"No relabeling pairs specified.\")\n *     fst.Relabel(self._mfst.get(), deref(_ipairs), deref(_opairs))             # <<<<<<<<<<<<<<\n *     self._check_mutating_imethod()\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_mfst\");\n    __PYX_ERR(0, 2261, __pyx_L1_error)\n  }\n  fst::script::Relabel(__pyx_v_self->_mfst.get(), (*__pyx_v__ipairs), (*__pyx_v__opairs));\n\n  /* \"pywrapfst.pyx\":2262\n *       raise FstArgError(\"No relabeling pairs specified.\")\n *     fst.Relabel(self._mfst.get(), deref(_ipairs), deref(_opairs))\n *     self._check_mutating_imethod()             # <<<<<<<<<<<<<<\n * \n *   def relabel_pairs(self, ipairs=None, opairs=None):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_check_mutating_imethod\");\n    __PYX_ERR(0, 2262, __pyx_L1_error)\n  }\n  ((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->_check_mutating_imethod(__pyx_v_self); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 2262, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":2246\n *     return self\n * \n *   cdef void _relabel_pairs(self, ipairs=None, opairs=None) except *:             # <<<<<<<<<<<<<<\n *     cdef unique_ptr[vector[fst.LabelPair]] _ipairs\n *     _ipairs.reset(new vector[fst.LabelPair]())\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_6);\n  __Pyx_XDECREF(__pyx_t_7);\n  __Pyx_XDECREF(__pyx_t_8);\n  __Pyx_XDECREF(__pyx_t_9);\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst._relabel_pairs\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n}\n\n/* \"pywrapfst.pyx\":2264\n *     self._check_mutating_imethod()\n * \n *   def relabel_pairs(self, ipairs=None, opairs=None):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     relabel_pairs(self, ipairs=None, opairs=None)\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_39relabel_pairs(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic char __pyx_doc_9pywrapfst_11_MutableFst_38relabel_pairs[] = \"\\n    relabel_pairs(self, ipairs=None, opairs=None)\\n\\n    Replaces input and/or output labels using pairs of labels.\\n\\n    This operation destructively relabels the input and/or output labels of the\\n    FST using pairs of the form (old_ID, new_ID); omitted indices are\\n    identity-mapped.\\n\\n    Args:\\n      ipairs: An iterable containing (older index, newer index) integer pairs.\\n      opairs: An iterable containing (older index, newer index) integer pairs.\\n\\n    Returns:\\n      self.\\n\\n    Raises:\\n      FstArgError: No relabeling pairs specified.\\n\\n    See also: `decode`, `encode`, `project`, `relabel_tables`.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_39relabel_pairs(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  PyObject *__pyx_v_ipairs = 0;\n  PyObject *__pyx_v_opairs = 0;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"relabel_pairs (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_ipairs,&__pyx_n_s_opairs,0};\n    PyObject* values[2] = {0,0};\n    values[0] = ((PyObject *)Py_None);\n    values[1] = ((PyObject *)Py_None);\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_ipairs);\n          if (value) { values[0] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  1:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_opairs);\n          if (value) { values[1] = value; kw_args--; }\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"relabel_pairs\") < 0)) __PYX_ERR(0, 2264, __pyx_L3_error)\n      }\n    } else {\n      switch (PyTuple_GET_SIZE(__pyx_args)) {\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n    }\n    __pyx_v_ipairs = values[0];\n    __pyx_v_opairs = values[1];\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"relabel_pairs\", 0, 0, 2, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 2264, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst.relabel_pairs\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  __pyx_r = __pyx_pf_9pywrapfst_11_MutableFst_38relabel_pairs(((struct __pyx_obj_9pywrapfst__MutableFst *)__pyx_v_self), __pyx_v_ipairs, __pyx_v_opairs);\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_38relabel_pairs(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, PyObject *__pyx_v_ipairs, PyObject *__pyx_v_opairs) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  struct __pyx_opt_args_9pywrapfst_11_MutableFst__relabel_pairs __pyx_t_1;\n  __Pyx_RefNannySetupContext(\"relabel_pairs\", 0);\n\n  /* \"pywrapfst.pyx\":2286\n *     See also: `decode`, `encode`, `project`, `relabel_tables`.\n *     \"\"\"\n *     self._relabel_pairs(ipairs, opairs)             # <<<<<<<<<<<<<<\n *     return self\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_relabel_pairs\");\n    __PYX_ERR(0, 2286, __pyx_L1_error)\n  }\n  __pyx_t_1.__pyx_n = 2;\n  __pyx_t_1.ipairs = __pyx_v_ipairs;\n  __pyx_t_1.opairs = __pyx_v_opairs;\n  ((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->_relabel_pairs(__pyx_v_self, &__pyx_t_1); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 2286, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":2287\n *     \"\"\"\n *     self._relabel_pairs(ipairs, opairs)\n *     return self             # <<<<<<<<<<<<<<\n * \n *   cdef void _relabel_tables(self,\n */\n  __Pyx_XDECREF(__pyx_r);\n  __Pyx_INCREF(((PyObject *)__pyx_v_self));\n  __pyx_r = ((PyObject *)__pyx_v_self);\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":2264\n *     self._check_mutating_imethod()\n * \n *   def relabel_pairs(self, ipairs=None, opairs=None):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     relabel_pairs(self, ipairs=None, opairs=None)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst.relabel_pairs\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":2289\n *     return self\n * \n *   cdef void _relabel_tables(self,             # <<<<<<<<<<<<<<\n *                             _SymbolTable old_isymbols=None,\n *                             _SymbolTable new_isymbols=None,\n */\n\nstatic void __pyx_f_9pywrapfst_11_MutableFst__relabel_tables(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, struct __pyx_opt_args_9pywrapfst_11_MutableFst__relabel_tables *__pyx_optional_args) {\n\n  /* \"pywrapfst.pyx\":2290\n * \n *   cdef void _relabel_tables(self,\n *                             _SymbolTable old_isymbols=None,             # <<<<<<<<<<<<<<\n *                             _SymbolTable new_isymbols=None,\n *                             unknown_isymbol=b\"\",\n */\n  struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_old_isymbols = ((struct __pyx_obj_9pywrapfst__SymbolTable *)Py_None);\n\n  /* \"pywrapfst.pyx\":2291\n *   cdef void _relabel_tables(self,\n *                             _SymbolTable old_isymbols=None,\n *                             _SymbolTable new_isymbols=None,             # <<<<<<<<<<<<<<\n *                             unknown_isymbol=b\"\",\n *                             bool attach_new_isymbols=True,\n */\n  struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_new_isymbols = ((struct __pyx_obj_9pywrapfst__SymbolTable *)Py_None);\n  PyObject *__pyx_v_unknown_isymbol = ((PyObject *)__pyx_kp_b__24);\n\n  /* \"pywrapfst.pyx\":2293\n *                             _SymbolTable new_isymbols=None,\n *                             unknown_isymbol=b\"\",\n *                             bool attach_new_isymbols=True,             # <<<<<<<<<<<<<<\n *                             _SymbolTable old_osymbols=None,\n *                             _SymbolTable new_osymbols=None,\n */\n  bool __pyx_v_attach_new_isymbols = ((bool)1);\n\n  /* \"pywrapfst.pyx\":2294\n *                             unknown_isymbol=b\"\",\n *                             bool attach_new_isymbols=True,\n *                             _SymbolTable old_osymbols=None,             # <<<<<<<<<<<<<<\n *                             _SymbolTable new_osymbols=None,\n *                             unknown_osymbol=b\"\",\n */\n  struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_old_osymbols = ((struct __pyx_obj_9pywrapfst__SymbolTable *)Py_None);\n\n  /* \"pywrapfst.pyx\":2295\n *                             bool attach_new_isymbols=True,\n *                             _SymbolTable old_osymbols=None,\n *                             _SymbolTable new_osymbols=None,             # <<<<<<<<<<<<<<\n *                             unknown_osymbol=b\"\",\n *                             bool attach_new_osymbols=True) except *:\n */\n  struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_new_osymbols = ((struct __pyx_obj_9pywrapfst__SymbolTable *)Py_None);\n  PyObject *__pyx_v_unknown_osymbol = ((PyObject *)__pyx_kp_b__24);\n\n  /* \"pywrapfst.pyx\":2297\n *                             _SymbolTable new_osymbols=None,\n *                             unknown_osymbol=b\"\",\n *                             bool attach_new_osymbols=True) except *:             # <<<<<<<<<<<<<<\n *     if new_isymbols is None and new_osymbols is None:\n *       raise FstArgError(\"No new SymbolTables specified\")\n */\n  bool __pyx_v_attach_new_osymbols = ((bool)1);\n  fst::SymbolTable *__pyx_v_new_isymbols_ptr;\n  fst::SymbolTable *__pyx_v_new_osymbols_ptr;\n  __Pyx_RefNannyDeclarations\n  int __pyx_t_1;\n  int __pyx_t_2;\n  int __pyx_t_3;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  fst::SymbolTable *__pyx_t_6;\n  fst::SymbolTable const *__pyx_t_7;\n  std::string __pyx_t_8;\n  fst::SymbolTable const *__pyx_t_9;\n  std::string __pyx_t_10;\n  __Pyx_RefNannySetupContext(\"_relabel_tables\", 0);\n  if (__pyx_optional_args) {\n    if (__pyx_optional_args->__pyx_n > 0) {\n      __pyx_v_old_isymbols = __pyx_optional_args->old_isymbols;\n      if (__pyx_optional_args->__pyx_n > 1) {\n        __pyx_v_new_isymbols = __pyx_optional_args->new_isymbols;\n        if (__pyx_optional_args->__pyx_n > 2) {\n          __pyx_v_unknown_isymbol = __pyx_optional_args->unknown_isymbol;\n          if (__pyx_optional_args->__pyx_n > 3) {\n            __pyx_v_attach_new_isymbols = __pyx_optional_args->attach_new_isymbols;\n            if (__pyx_optional_args->__pyx_n > 4) {\n              __pyx_v_old_osymbols = __pyx_optional_args->old_osymbols;\n              if (__pyx_optional_args->__pyx_n > 5) {\n                __pyx_v_new_osymbols = __pyx_optional_args->new_osymbols;\n                if (__pyx_optional_args->__pyx_n > 6) {\n                  __pyx_v_unknown_osymbol = __pyx_optional_args->unknown_osymbol;\n                  if (__pyx_optional_args->__pyx_n > 7) {\n                    __pyx_v_attach_new_osymbols = __pyx_optional_args->attach_new_osymbols;\n                  }\n                }\n              }\n            }\n          }\n        }\n      }\n    }\n  }\n\n  /* \"pywrapfst.pyx\":2298\n *                             unknown_osymbol=b\"\",\n *                             bool attach_new_osymbols=True) except *:\n *     if new_isymbols is None and new_osymbols is None:             # <<<<<<<<<<<<<<\n *       raise FstArgError(\"No new SymbolTables specified\")\n *     cdef fst.SymbolTable *new_isymbols_ptr = NULL\n */\n  __pyx_t_2 = (((PyObject *)__pyx_v_new_isymbols) == Py_None);\n  __pyx_t_3 = (__pyx_t_2 != 0);\n  if (__pyx_t_3) {\n  } else {\n    __pyx_t_1 = __pyx_t_3;\n    goto __pyx_L4_bool_binop_done;\n  }\n  __pyx_t_3 = (((PyObject *)__pyx_v_new_osymbols) == Py_None);\n  __pyx_t_2 = (__pyx_t_3 != 0);\n  __pyx_t_1 = __pyx_t_2;\n  __pyx_L4_bool_binop_done:;\n  if (__pyx_t_1) {\n\n    /* \"pywrapfst.pyx\":2299\n *                             bool attach_new_osymbols=True) except *:\n *     if new_isymbols is None and new_osymbols is None:\n *       raise FstArgError(\"No new SymbolTables specified\")             # <<<<<<<<<<<<<<\n *     cdef fst.SymbolTable *new_isymbols_ptr = NULL\n *     if new_isymbols is not None:\n */\n    __pyx_t_4 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstArgError); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 2299, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_4);\n    __pyx_t_5 = __Pyx_PyObject_Call(__pyx_t_4, __pyx_tuple__44, NULL); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 2299, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_5);\n    __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n    __Pyx_Raise(__pyx_t_5, 0, 0, 0);\n    __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n    __PYX_ERR(0, 2299, __pyx_L1_error)\n\n    /* \"pywrapfst.pyx\":2298\n *                             unknown_osymbol=b\"\",\n *                             bool attach_new_osymbols=True) except *:\n *     if new_isymbols is None and new_osymbols is None:             # <<<<<<<<<<<<<<\n *       raise FstArgError(\"No new SymbolTables specified\")\n *     cdef fst.SymbolTable *new_isymbols_ptr = NULL\n */\n  }\n\n  /* \"pywrapfst.pyx\":2300\n *     if new_isymbols is None and new_osymbols is None:\n *       raise FstArgError(\"No new SymbolTables specified\")\n *     cdef fst.SymbolTable *new_isymbols_ptr = NULL             # <<<<<<<<<<<<<<\n *     if new_isymbols is not None:\n *       new_isymbols_ptr = new_isymbols._table\n */\n  __pyx_v_new_isymbols_ptr = NULL;\n\n  /* \"pywrapfst.pyx\":2301\n *       raise FstArgError(\"No new SymbolTables specified\")\n *     cdef fst.SymbolTable *new_isymbols_ptr = NULL\n *     if new_isymbols is not None:             # <<<<<<<<<<<<<<\n *       new_isymbols_ptr = new_isymbols._table\n *     cdef fst.SymbolTable *new_osymbols_ptr = NULL\n */\n  __pyx_t_1 = (((PyObject *)__pyx_v_new_isymbols) != Py_None);\n  __pyx_t_2 = (__pyx_t_1 != 0);\n  if (__pyx_t_2) {\n\n    /* \"pywrapfst.pyx\":2302\n *     cdef fst.SymbolTable *new_isymbols_ptr = NULL\n *     if new_isymbols is not None:\n *       new_isymbols_ptr = new_isymbols._table             # <<<<<<<<<<<<<<\n *     cdef fst.SymbolTable *new_osymbols_ptr = NULL\n *     if new_osymbols is not None:\n */\n    if (unlikely(((PyObject *)__pyx_v_new_isymbols) == Py_None)) {\n      PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_table\");\n      __PYX_ERR(0, 2302, __pyx_L1_error)\n    }\n    __pyx_t_6 = __pyx_v_new_isymbols->_table;\n    __pyx_v_new_isymbols_ptr = __pyx_t_6;\n\n    /* \"pywrapfst.pyx\":2301\n *       raise FstArgError(\"No new SymbolTables specified\")\n *     cdef fst.SymbolTable *new_isymbols_ptr = NULL\n *     if new_isymbols is not None:             # <<<<<<<<<<<<<<\n *       new_isymbols_ptr = new_isymbols._table\n *     cdef fst.SymbolTable *new_osymbols_ptr = NULL\n */\n  }\n\n  /* \"pywrapfst.pyx\":2303\n *     if new_isymbols is not None:\n *       new_isymbols_ptr = new_isymbols._table\n *     cdef fst.SymbolTable *new_osymbols_ptr = NULL             # <<<<<<<<<<<<<<\n *     if new_osymbols is not None:\n *       new_osymbols_ptr = new_osymbols._table\n */\n  __pyx_v_new_osymbols_ptr = NULL;\n\n  /* \"pywrapfst.pyx\":2304\n *       new_isymbols_ptr = new_isymbols._table\n *     cdef fst.SymbolTable *new_osymbols_ptr = NULL\n *     if new_osymbols is not None:             # <<<<<<<<<<<<<<\n *       new_osymbols_ptr = new_osymbols._table\n *     fst.Relabel(self._mfst.get(),\n */\n  __pyx_t_2 = (((PyObject *)__pyx_v_new_osymbols) != Py_None);\n  __pyx_t_1 = (__pyx_t_2 != 0);\n  if (__pyx_t_1) {\n\n    /* \"pywrapfst.pyx\":2305\n *     cdef fst.SymbolTable *new_osymbols_ptr = NULL\n *     if new_osymbols is not None:\n *       new_osymbols_ptr = new_osymbols._table             # <<<<<<<<<<<<<<\n *     fst.Relabel(self._mfst.get(),\n *         self._fst.get().InputSymbols() if old_isymbols is None else\n */\n    if (unlikely(((PyObject *)__pyx_v_new_osymbols) == Py_None)) {\n      PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_table\");\n      __PYX_ERR(0, 2305, __pyx_L1_error)\n    }\n    __pyx_t_6 = __pyx_v_new_osymbols->_table;\n    __pyx_v_new_osymbols_ptr = __pyx_t_6;\n\n    /* \"pywrapfst.pyx\":2304\n *       new_isymbols_ptr = new_isymbols._table\n *     cdef fst.SymbolTable *new_osymbols_ptr = NULL\n *     if new_osymbols is not None:             # <<<<<<<<<<<<<<\n *       new_osymbols_ptr = new_osymbols._table\n *     fst.Relabel(self._mfst.get(),\n */\n  }\n\n  /* \"pywrapfst.pyx\":2306\n *     if new_osymbols is not None:\n *       new_osymbols_ptr = new_osymbols._table\n *     fst.Relabel(self._mfst.get(),             # <<<<<<<<<<<<<<\n *         self._fst.get().InputSymbols() if old_isymbols is None else\n *         old_isymbols._table, new_isymbols_ptr, tostring(unknown_isymbol),\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_mfst\");\n    __PYX_ERR(0, 2306, __pyx_L1_error)\n  }\n\n  /* \"pywrapfst.pyx\":2307\n *       new_osymbols_ptr = new_osymbols._table\n *     fst.Relabel(self._mfst.get(),\n *         self._fst.get().InputSymbols() if old_isymbols is None else             # <<<<<<<<<<<<<<\n *         old_isymbols._table, new_isymbols_ptr, tostring(unknown_isymbol),\n *         attach_new_isymbols,\n */\n  __pyx_t_1 = (((PyObject *)__pyx_v_old_isymbols) == Py_None);\n  if ((__pyx_t_1 != 0)) {\n    if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n      PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n      __PYX_ERR(0, 2307, __pyx_L1_error)\n    }\n    __pyx_t_7 = __pyx_v_self->__pyx_base._fst.get()->InputSymbols();\n  } else {\n\n    /* \"pywrapfst.pyx\":2308\n *     fst.Relabel(self._mfst.get(),\n *         self._fst.get().InputSymbols() if old_isymbols is None else\n *         old_isymbols._table, new_isymbols_ptr, tostring(unknown_isymbol),             # <<<<<<<<<<<<<<\n *         attach_new_isymbols,\n *         self._fst.get().OutputSymbols() if old_osymbols is None else\n */\n    if (unlikely(((PyObject *)__pyx_v_old_isymbols) == Py_None)) {\n      PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_table\");\n      __PYX_ERR(0, 2308, __pyx_L1_error)\n    }\n    __pyx_t_7 = __pyx_v_old_isymbols->_table;\n  }\n  __pyx_t_8 = __pyx_f_9pywrapfst_tostring(__pyx_v_unknown_isymbol, NULL); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 2308, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":2310\n *         old_isymbols._table, new_isymbols_ptr, tostring(unknown_isymbol),\n *         attach_new_isymbols,\n *         self._fst.get().OutputSymbols() if old_osymbols is None else             # <<<<<<<<<<<<<<\n *         old_osymbols._table, new_osymbols_ptr, tostring(unknown_osymbol),\n *         attach_new_osymbols)\n */\n  __pyx_t_1 = (((PyObject *)__pyx_v_old_osymbols) == Py_None);\n  if ((__pyx_t_1 != 0)) {\n    if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n      PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n      __PYX_ERR(0, 2310, __pyx_L1_error)\n    }\n    __pyx_t_9 = __pyx_v_self->__pyx_base._fst.get()->OutputSymbols();\n  } else {\n\n    /* \"pywrapfst.pyx\":2311\n *         attach_new_isymbols,\n *         self._fst.get().OutputSymbols() if old_osymbols is None else\n *         old_osymbols._table, new_osymbols_ptr, tostring(unknown_osymbol),             # <<<<<<<<<<<<<<\n *         attach_new_osymbols)\n *     self._check_mutating_imethod()\n */\n    if (unlikely(((PyObject *)__pyx_v_old_osymbols) == Py_None)) {\n      PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_table\");\n      __PYX_ERR(0, 2311, __pyx_L1_error)\n    }\n    __pyx_t_9 = __pyx_v_old_osymbols->_table;\n  }\n  __pyx_t_10 = __pyx_f_9pywrapfst_tostring(__pyx_v_unknown_osymbol, NULL); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 2311, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":2306\n *     if new_osymbols is not None:\n *       new_osymbols_ptr = new_osymbols._table\n *     fst.Relabel(self._mfst.get(),             # <<<<<<<<<<<<<<\n *         self._fst.get().InputSymbols() if old_isymbols is None else\n *         old_isymbols._table, new_isymbols_ptr, tostring(unknown_isymbol),\n */\n  fst::script::Relabel(__pyx_v_self->_mfst.get(), __pyx_t_7, __pyx_v_new_isymbols_ptr, __pyx_t_8, __pyx_v_attach_new_isymbols, __pyx_t_9, __pyx_v_new_osymbols_ptr, __pyx_t_10, __pyx_v_attach_new_osymbols);\n\n  /* \"pywrapfst.pyx\":2313\n *         old_osymbols._table, new_osymbols_ptr, tostring(unknown_osymbol),\n *         attach_new_osymbols)\n *     self._check_mutating_imethod()             # <<<<<<<<<<<<<<\n * \n *   def relabel_tables(self,\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_check_mutating_imethod\");\n    __PYX_ERR(0, 2313, __pyx_L1_error)\n  }\n  ((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->_check_mutating_imethod(__pyx_v_self); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 2313, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":2289\n *     return self\n * \n *   cdef void _relabel_tables(self,             # <<<<<<<<<<<<<<\n *                             _SymbolTable old_isymbols=None,\n *                             _SymbolTable new_isymbols=None,\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst._relabel_tables\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n}\n\n/* \"pywrapfst.pyx\":2315\n *     self._check_mutating_imethod()\n * \n *   def relabel_tables(self,             # <<<<<<<<<<<<<<\n *                      _SymbolTable old_isymbols=None,\n *                      _SymbolTable new_isymbols=None,\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_41relabel_tables(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic char __pyx_doc_9pywrapfst_11_MutableFst_40relabel_tables[] = \"\\n    relabel_tables(self, old_isymbols=None, new_isymbols=None,\\n                   unknown_isymbol=\\\"\\\", attach_new_isymbols=True,\\n                   old_osymbols=None, new_osymbols=None,\\n                   unknown_osymbol=\\\"\\\", attach_new_osymbols=True)\\n\\n    Replaces input and/or output labels using SymbolTables.\\n\\n    This operation destructively relabels the input and/or output labels of the\\n    FST using user-specified symbol tables; omitted symbols are identity-mapped.\\n\\n    Args:\\n       old_isymbols: The old SymbolTable for input labels, defaulting to the\\n          FST's input symbol table.\\n       new_isymbols: A SymbolTable used to relabel the input labels\\n       unknown_isymbol: Input symbol to use to relabel OOVs (if empty,\\n          OOVs raise an exception)\\n       attach_new_isymbols: Should new_isymbols be made the FST's input symbol\\n          table?\\n       old_osymbols: The old SymbolTable for output labels, defaulting to the\\n          FST's output symbol table.\\n       new_osymbols: A SymbolTable used to relabel the output labels.\\n       unknown_osymbol: Outnput symbol to use to relabel OOVs (if empty,\\n          OOVs raise an exception)\\n       attach_new_isymbols: Should new_osymbols be made the FST's output symbol\\n          table?\\n\\n    Returns:\\n      self.\\n\\n    Raises:\\n      FstArgError: No SymbolTable specified.\\n\\n    See also: `decode`, `encode`, `project`, `relabel_pairs`.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_41relabel_tables(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_old_isymbols = 0;\n  struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_new_isymbols = 0;\n  PyObject *__pyx_v_unknown_isymbol = 0;\n  bool __pyx_v_attach_new_isymbols;\n  struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_old_osymbols = 0;\n  struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_new_osymbols = 0;\n  PyObject *__pyx_v_unknown_osymbol = 0;\n  bool __pyx_v_attach_new_osymbols;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"relabel_tables (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_old_isymbols,&__pyx_n_s_new_isymbols,&__pyx_n_s_unknown_isymbol,&__pyx_n_s_attach_new_isymbols,&__pyx_n_s_old_osymbols,&__pyx_n_s_new_osymbols,&__pyx_n_s_unknown_osymbol,&__pyx_n_s_attach_new_osymbols,0};\n    PyObject* values[8] = {0,0,0,0,0,0,0,0};\n\n    /* \"pywrapfst.pyx\":2316\n * \n *   def relabel_tables(self,\n *                      _SymbolTable old_isymbols=None,             # <<<<<<<<<<<<<<\n *                      _SymbolTable new_isymbols=None,\n *                      unknown_isymbol=b\"\",\n */\n    values[0] = (PyObject *)((struct __pyx_obj_9pywrapfst__SymbolTable *)Py_None);\n\n    /* \"pywrapfst.pyx\":2317\n *   def relabel_tables(self,\n *                      _SymbolTable old_isymbols=None,\n *                      _SymbolTable new_isymbols=None,             # <<<<<<<<<<<<<<\n *                      unknown_isymbol=b\"\",\n *                      bool attach_new_isymbols=True,\n */\n    values[1] = (PyObject *)((struct __pyx_obj_9pywrapfst__SymbolTable *)Py_None);\n    values[2] = ((PyObject *)__pyx_kp_b__24);\n\n    /* \"pywrapfst.pyx\":2320\n *                      unknown_isymbol=b\"\",\n *                      bool attach_new_isymbols=True,\n *                      _SymbolTable old_osymbols=None,             # <<<<<<<<<<<<<<\n *                      _SymbolTable new_osymbols=None,\n *                      unknown_osymbol=b\"\",\n */\n    values[4] = (PyObject *)((struct __pyx_obj_9pywrapfst__SymbolTable *)Py_None);\n\n    /* \"pywrapfst.pyx\":2321\n *                      bool attach_new_isymbols=True,\n *                      _SymbolTable old_osymbols=None,\n *                      _SymbolTable new_osymbols=None,             # <<<<<<<<<<<<<<\n *                      unknown_osymbol=b\"\",\n *                      bool attach_new_osymbols=True):\n */\n    values[5] = (PyObject *)((struct __pyx_obj_9pywrapfst__SymbolTable *)Py_None);\n    values[6] = ((PyObject *)__pyx_kp_b__24);\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  8: values[7] = PyTuple_GET_ITEM(__pyx_args, 7);\n        CYTHON_FALLTHROUGH;\n        case  7: values[6] = PyTuple_GET_ITEM(__pyx_args, 6);\n        CYTHON_FALLTHROUGH;\n        case  6: values[5] = PyTuple_GET_ITEM(__pyx_args, 5);\n        CYTHON_FALLTHROUGH;\n        case  5: values[4] = PyTuple_GET_ITEM(__pyx_args, 4);\n        CYTHON_FALLTHROUGH;\n        case  4: values[3] = PyTuple_GET_ITEM(__pyx_args, 3);\n        CYTHON_FALLTHROUGH;\n        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);\n        CYTHON_FALLTHROUGH;\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_old_isymbols);\n          if (value) { values[0] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  1:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_new_isymbols);\n          if (value) { values[1] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  2:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_unknown_isymbol);\n          if (value) { values[2] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  3:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_attach_new_isymbols);\n          if (value) { values[3] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  4:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_old_osymbols);\n          if (value) { values[4] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  5:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_new_osymbols);\n          if (value) { values[5] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  6:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_unknown_osymbol);\n          if (value) { values[6] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  7:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_attach_new_osymbols);\n          if (value) { values[7] = value; kw_args--; }\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"relabel_tables\") < 0)) __PYX_ERR(0, 2315, __pyx_L3_error)\n      }\n    } else {\n      switch (PyTuple_GET_SIZE(__pyx_args)) {\n        case  8: values[7] = PyTuple_GET_ITEM(__pyx_args, 7);\n        CYTHON_FALLTHROUGH;\n        case  7: values[6] = PyTuple_GET_ITEM(__pyx_args, 6);\n        CYTHON_FALLTHROUGH;\n        case  6: values[5] = PyTuple_GET_ITEM(__pyx_args, 5);\n        CYTHON_FALLTHROUGH;\n        case  5: values[4] = PyTuple_GET_ITEM(__pyx_args, 4);\n        CYTHON_FALLTHROUGH;\n        case  4: values[3] = PyTuple_GET_ITEM(__pyx_args, 3);\n        CYTHON_FALLTHROUGH;\n        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);\n        CYTHON_FALLTHROUGH;\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n    }\n    __pyx_v_old_isymbols = ((struct __pyx_obj_9pywrapfst__SymbolTable *)values[0]);\n    __pyx_v_new_isymbols = ((struct __pyx_obj_9pywrapfst__SymbolTable *)values[1]);\n    __pyx_v_unknown_isymbol = values[2];\n    if (values[3]) {\n      __pyx_v_attach_new_isymbols = __Pyx_PyObject_IsTrue(values[3]); if (unlikely((__pyx_v_attach_new_isymbols == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 2319, __pyx_L3_error)\n    } else {\n\n      /* \"pywrapfst.pyx\":2319\n *                      _SymbolTable new_isymbols=None,\n *                      unknown_isymbol=b\"\",\n *                      bool attach_new_isymbols=True,             # <<<<<<<<<<<<<<\n *                      _SymbolTable old_osymbols=None,\n *                      _SymbolTable new_osymbols=None,\n */\n      __pyx_v_attach_new_isymbols = ((bool)1);\n    }\n    __pyx_v_old_osymbols = ((struct __pyx_obj_9pywrapfst__SymbolTable *)values[4]);\n    __pyx_v_new_osymbols = ((struct __pyx_obj_9pywrapfst__SymbolTable *)values[5]);\n    __pyx_v_unknown_osymbol = values[6];\n    if (values[7]) {\n      __pyx_v_attach_new_osymbols = __Pyx_PyObject_IsTrue(values[7]); if (unlikely((__pyx_v_attach_new_osymbols == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 2323, __pyx_L3_error)\n    } else {\n\n      /* \"pywrapfst.pyx\":2323\n *                      _SymbolTable new_osymbols=None,\n *                      unknown_osymbol=b\"\",\n *                      bool attach_new_osymbols=True):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     relabel_tables(self, old_isymbols=None, new_isymbols=None,\n */\n      __pyx_v_attach_new_osymbols = ((bool)1);\n    }\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"relabel_tables\", 0, 0, 8, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 2315, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst.relabel_tables\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_old_isymbols), __pyx_ptype_9pywrapfst__SymbolTable, 1, \"old_isymbols\", 0))) __PYX_ERR(0, 2316, __pyx_L1_error)\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_new_isymbols), __pyx_ptype_9pywrapfst__SymbolTable, 1, \"new_isymbols\", 0))) __PYX_ERR(0, 2317, __pyx_L1_error)\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_old_osymbols), __pyx_ptype_9pywrapfst__SymbolTable, 1, \"old_osymbols\", 0))) __PYX_ERR(0, 2320, __pyx_L1_error)\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_new_osymbols), __pyx_ptype_9pywrapfst__SymbolTable, 1, \"new_osymbols\", 0))) __PYX_ERR(0, 2321, __pyx_L1_error)\n  __pyx_r = __pyx_pf_9pywrapfst_11_MutableFst_40relabel_tables(((struct __pyx_obj_9pywrapfst__MutableFst *)__pyx_v_self), __pyx_v_old_isymbols, __pyx_v_new_isymbols, __pyx_v_unknown_isymbol, __pyx_v_attach_new_isymbols, __pyx_v_old_osymbols, __pyx_v_new_osymbols, __pyx_v_unknown_osymbol, __pyx_v_attach_new_osymbols);\n\n  /* \"pywrapfst.pyx\":2315\n *     self._check_mutating_imethod()\n * \n *   def relabel_tables(self,             # <<<<<<<<<<<<<<\n *                      _SymbolTable old_isymbols=None,\n *                      _SymbolTable new_isymbols=None,\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_40relabel_tables(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_old_isymbols, struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_new_isymbols, PyObject *__pyx_v_unknown_isymbol, bool __pyx_v_attach_new_isymbols, struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_old_osymbols, struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_new_osymbols, PyObject *__pyx_v_unknown_osymbol, bool __pyx_v_attach_new_osymbols) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  struct __pyx_opt_args_9pywrapfst_11_MutableFst__relabel_tables __pyx_t_1;\n  __Pyx_RefNannySetupContext(\"relabel_tables\", 0);\n\n  /* \"pywrapfst.pyx\":2359\n *     See also: `decode`, `encode`, `project`, `relabel_pairs`.\n *     \"\"\"\n *     self._relabel_tables(old_isymbols, new_isymbols,             # <<<<<<<<<<<<<<\n *                          unknown_isymbol, attach_new_isymbols,\n *                          old_osymbols, new_osymbols,\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_relabel_tables\");\n    __PYX_ERR(0, 2359, __pyx_L1_error)\n  }\n\n  /* \"pywrapfst.pyx\":2362\n *                          unknown_isymbol, attach_new_isymbols,\n *                          old_osymbols, new_osymbols,\n *                          unknown_osymbol, attach_new_osymbols)             # <<<<<<<<<<<<<<\n *     return self\n * \n */\n  __pyx_t_1.__pyx_n = 8;\n  __pyx_t_1.old_isymbols = __pyx_v_old_isymbols;\n  __pyx_t_1.new_isymbols = __pyx_v_new_isymbols;\n  __pyx_t_1.unknown_isymbol = __pyx_v_unknown_isymbol;\n  __pyx_t_1.attach_new_isymbols = __pyx_v_attach_new_isymbols;\n  __pyx_t_1.old_osymbols = __pyx_v_old_osymbols;\n  __pyx_t_1.new_osymbols = __pyx_v_new_osymbols;\n  __pyx_t_1.unknown_osymbol = __pyx_v_unknown_osymbol;\n  __pyx_t_1.attach_new_osymbols = __pyx_v_attach_new_osymbols;\n  ((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->_relabel_tables(__pyx_v_self, &__pyx_t_1); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 2359, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":2363\n *                          old_osymbols, new_osymbols,\n *                          unknown_osymbol, attach_new_osymbols)\n *     return self             # <<<<<<<<<<<<<<\n * \n *   cdef void _reserve_arcs(self, int64 state, size_t n) except *:\n */\n  __Pyx_XDECREF(__pyx_r);\n  __Pyx_INCREF(((PyObject *)__pyx_v_self));\n  __pyx_r = ((PyObject *)__pyx_v_self);\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":2315\n *     self._check_mutating_imethod()\n * \n *   def relabel_tables(self,             # <<<<<<<<<<<<<<\n *                      _SymbolTable old_isymbols=None,\n *                      _SymbolTable new_isymbols=None,\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst.relabel_tables\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":2365\n *     return self\n * \n *   cdef void _reserve_arcs(self, int64 state, size_t n) except *:             # <<<<<<<<<<<<<<\n *     if not self._mfst.get().ReserveArcs(state, n):\n *       raise FstIndexError(\"State index out of range\")\n */\n\nstatic void __pyx_f_9pywrapfst_11_MutableFst__reserve_arcs(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, __pyx_t_10basictypes_int64 __pyx_v_state, size_t __pyx_v_n) {\n  __Pyx_RefNannyDeclarations\n  int __pyx_t_1;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  __Pyx_RefNannySetupContext(\"_reserve_arcs\", 0);\n\n  /* \"pywrapfst.pyx\":2366\n * \n *   cdef void _reserve_arcs(self, int64 state, size_t n) except *:\n *     if not self._mfst.get().ReserveArcs(state, n):             # <<<<<<<<<<<<<<\n *       raise FstIndexError(\"State index out of range\")\n *     self._check_mutating_imethod()\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_mfst\");\n    __PYX_ERR(0, 2366, __pyx_L1_error)\n  }\n  __pyx_t_1 = ((!(__pyx_v_self->_mfst.get()->ReserveArcs(__pyx_v_state, __pyx_v_n) != 0)) != 0);\n  if (__pyx_t_1) {\n\n    /* \"pywrapfst.pyx\":2367\n *   cdef void _reserve_arcs(self, int64 state, size_t n) except *:\n *     if not self._mfst.get().ReserveArcs(state, n):\n *       raise FstIndexError(\"State index out of range\")             # <<<<<<<<<<<<<<\n *     self._check_mutating_imethod()\n * \n */\n    __pyx_t_2 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstIndexError); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 2367, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_2);\n    __pyx_t_3 = __Pyx_PyObject_Call(__pyx_t_2, __pyx_tuple__45, NULL); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 2367, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_3);\n    __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n    __Pyx_Raise(__pyx_t_3, 0, 0, 0);\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    __PYX_ERR(0, 2367, __pyx_L1_error)\n\n    /* \"pywrapfst.pyx\":2366\n * \n *   cdef void _reserve_arcs(self, int64 state, size_t n) except *:\n *     if not self._mfst.get().ReserveArcs(state, n):             # <<<<<<<<<<<<<<\n *       raise FstIndexError(\"State index out of range\")\n *     self._check_mutating_imethod()\n */\n  }\n\n  /* \"pywrapfst.pyx\":2368\n *     if not self._mfst.get().ReserveArcs(state, n):\n *       raise FstIndexError(\"State index out of range\")\n *     self._check_mutating_imethod()             # <<<<<<<<<<<<<<\n * \n *   def reserve_arcs(self, int64 state, size_t n):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_check_mutating_imethod\");\n    __PYX_ERR(0, 2368, __pyx_L1_error)\n  }\n  ((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->_check_mutating_imethod(__pyx_v_self); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 2368, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":2365\n *     return self\n * \n *   cdef void _reserve_arcs(self, int64 state, size_t n) except *:             # <<<<<<<<<<<<<<\n *     if not self._mfst.get().ReserveArcs(state, n):\n *       raise FstIndexError(\"State index out of range\")\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst._reserve_arcs\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n}\n\n/* \"pywrapfst.pyx\":2370\n *     self._check_mutating_imethod()\n * \n *   def reserve_arcs(self, int64 state, size_t n):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     reserve_arcs(self, state, n)\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_43reserve_arcs(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic char __pyx_doc_9pywrapfst_11_MutableFst_42reserve_arcs[] = \"\\n    reserve_arcs(self, state, n)\\n\\n    Reserve n arcs at a particular state (best effort).\\n\\n    Args:\\n      state: The integer index of a state.\\n      n: The number of arcs to reserve.\\n\\n    Returns:\\n      self.\\n\\n    Raises:\\n      FstIndexError: State index out of range.\\n\\n    See also: `reserve_states`.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_43reserve_arcs(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  __pyx_t_10basictypes_int64 __pyx_v_state;\n  size_t __pyx_v_n;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"reserve_arcs (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_state,&__pyx_n_s_n,0};\n    PyObject* values[2] = {0,0};\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (likely((values[0] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_state)) != 0)) kw_args--;\n        else goto __pyx_L5_argtuple_error;\n        CYTHON_FALLTHROUGH;\n        case  1:\n        if (likely((values[1] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_n)) != 0)) kw_args--;\n        else {\n          __Pyx_RaiseArgtupleInvalid(\"reserve_arcs\", 1, 2, 2, 1); __PYX_ERR(0, 2370, __pyx_L3_error)\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"reserve_arcs\") < 0)) __PYX_ERR(0, 2370, __pyx_L3_error)\n      }\n    } else if (PyTuple_GET_SIZE(__pyx_args) != 2) {\n      goto __pyx_L5_argtuple_error;\n    } else {\n      values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n      values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n    }\n    __pyx_v_state = __Pyx_PyInt_As_int64_t(values[0]); if (unlikely((__pyx_v_state == ((int64_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 2370, __pyx_L3_error)\n    __pyx_v_n = __Pyx_PyInt_As_size_t(values[1]); if (unlikely((__pyx_v_n == (size_t)-1) && PyErr_Occurred())) __PYX_ERR(0, 2370, __pyx_L3_error)\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"reserve_arcs\", 1, 2, 2, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 2370, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst.reserve_arcs\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  __pyx_r = __pyx_pf_9pywrapfst_11_MutableFst_42reserve_arcs(((struct __pyx_obj_9pywrapfst__MutableFst *)__pyx_v_self), __pyx_v_state, __pyx_v_n);\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_42reserve_arcs(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, __pyx_t_10basictypes_int64 __pyx_v_state, size_t __pyx_v_n) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"reserve_arcs\", 0);\n\n  /* \"pywrapfst.pyx\":2388\n *     See also: `reserve_states`.\n *     \"\"\"\n *     self._reserve_arcs(state, n)             # <<<<<<<<<<<<<<\n *     return self\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_reserve_arcs\");\n    __PYX_ERR(0, 2388, __pyx_L1_error)\n  }\n  ((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->_reserve_arcs(__pyx_v_self, __pyx_v_state, __pyx_v_n); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 2388, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":2389\n *     \"\"\"\n *     self._reserve_arcs(state, n)\n *     return self             # <<<<<<<<<<<<<<\n * \n *   cdef void _reserve_states(self, int64 n) except *:\n */\n  __Pyx_XDECREF(__pyx_r);\n  __Pyx_INCREF(((PyObject *)__pyx_v_self));\n  __pyx_r = ((PyObject *)__pyx_v_self);\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":2370\n *     self._check_mutating_imethod()\n * \n *   def reserve_arcs(self, int64 state, size_t n):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     reserve_arcs(self, state, n)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst.reserve_arcs\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":2391\n *     return self\n * \n *   cdef void _reserve_states(self, int64 n) except *:             # <<<<<<<<<<<<<<\n *     self._mfst.get().ReserveStates(n)\n *     self._check_mutating_imethod()\n */\n\nstatic void __pyx_f_9pywrapfst_11_MutableFst__reserve_states(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, __pyx_t_10basictypes_int64 __pyx_v_n) {\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"_reserve_states\", 0);\n\n  /* \"pywrapfst.pyx\":2392\n * \n *   cdef void _reserve_states(self, int64 n) except *:\n *     self._mfst.get().ReserveStates(n)             # <<<<<<<<<<<<<<\n *     self._check_mutating_imethod()\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_mfst\");\n    __PYX_ERR(0, 2392, __pyx_L1_error)\n  }\n  __pyx_v_self->_mfst.get()->ReserveStates(__pyx_v_n);\n\n  /* \"pywrapfst.pyx\":2393\n *   cdef void _reserve_states(self, int64 n) except *:\n *     self._mfst.get().ReserveStates(n)\n *     self._check_mutating_imethod()             # <<<<<<<<<<<<<<\n * \n *   def reserve_states(self, int64 n):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_check_mutating_imethod\");\n    __PYX_ERR(0, 2393, __pyx_L1_error)\n  }\n  ((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->_check_mutating_imethod(__pyx_v_self); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 2393, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":2391\n *     return self\n * \n *   cdef void _reserve_states(self, int64 n) except *:             # <<<<<<<<<<<<<<\n *     self._mfst.get().ReserveStates(n)\n *     self._check_mutating_imethod()\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst._reserve_states\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n}\n\n/* \"pywrapfst.pyx\":2395\n *     self._check_mutating_imethod()\n * \n *   def reserve_states(self, int64 n):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     reserve_states(self, n)\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_45reserve_states(PyObject *__pyx_v_self, PyObject *__pyx_arg_n); /*proto*/\nstatic char __pyx_doc_9pywrapfst_11_MutableFst_44reserve_states[] = \"\\n    reserve_states(self, n)\\n\\n    Reserve n states (best effort).\\n\\n    Args:\\n      n: The number of states to reserve.\\n\\n    Returns:\\n      self.\\n\\n    See also: `reserve_arcs`.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_45reserve_states(PyObject *__pyx_v_self, PyObject *__pyx_arg_n) {\n  __pyx_t_10basictypes_int64 __pyx_v_n;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"reserve_states (wrapper)\", 0);\n  assert(__pyx_arg_n); {\n    __pyx_v_n = __Pyx_PyInt_As_int64_t(__pyx_arg_n); if (unlikely((__pyx_v_n == ((int64_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 2395, __pyx_L3_error)\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst.reserve_states\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  __pyx_r = __pyx_pf_9pywrapfst_11_MutableFst_44reserve_states(((struct __pyx_obj_9pywrapfst__MutableFst *)__pyx_v_self), ((__pyx_t_10basictypes_int64)__pyx_v_n));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_44reserve_states(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, __pyx_t_10basictypes_int64 __pyx_v_n) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"reserve_states\", 0);\n\n  /* \"pywrapfst.pyx\":2409\n *     See also: `reserve_arcs`.\n *     \"\"\"\n *     self._reserve_states(n)             # <<<<<<<<<<<<<<\n *     return self\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_reserve_states\");\n    __PYX_ERR(0, 2409, __pyx_L1_error)\n  }\n  ((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->_reserve_states(__pyx_v_self, __pyx_v_n); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 2409, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":2410\n *     \"\"\"\n *     self._reserve_states(n)\n *     return self             # <<<<<<<<<<<<<<\n * \n *   cdef void _reweight(self, potentials, bool to_final=False) except *:\n */\n  __Pyx_XDECREF(__pyx_r);\n  __Pyx_INCREF(((PyObject *)__pyx_v_self));\n  __pyx_r = ((PyObject *)__pyx_v_self);\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":2395\n *     self._check_mutating_imethod()\n * \n *   def reserve_states(self, int64 n):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     reserve_states(self, n)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst.reserve_states\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":2412\n *     return self\n * \n *   cdef void _reweight(self, potentials, bool to_final=False) except *:             # <<<<<<<<<<<<<<\n *     cdef unique_ptr[vector[fst.WeightClass]] _potentials\n *     _potentials.reset(new vector[fst.WeightClass]())\n */\n\nstatic void __pyx_f_9pywrapfst_11_MutableFst__reweight(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, PyObject *__pyx_v_potentials, struct __pyx_opt_args_9pywrapfst_11_MutableFst__reweight *__pyx_optional_args) {\n  bool __pyx_v_to_final = ((bool)0);\n  std::unique_ptr<std::vector<fst::script::WeightClass> >  __pyx_v__potentials;\n  CYTHON_UNUSED std::string __pyx_v_weight_type;\n  PyObject *__pyx_v_weight = NULL;\n  __Pyx_RefNannyDeclarations\n  std::vector<fst::script::WeightClass>  *__pyx_t_1;\n  PyObject *__pyx_t_2 = NULL;\n  Py_ssize_t __pyx_t_3;\n  PyObject *(*__pyx_t_4)(PyObject *);\n  PyObject *__pyx_t_5 = NULL;\n  fst::script::WeightClass __pyx_t_6;\n  __Pyx_RefNannySetupContext(\"_reweight\", 0);\n  if (__pyx_optional_args) {\n    if (__pyx_optional_args->__pyx_n > 0) {\n      __pyx_v_to_final = __pyx_optional_args->to_final;\n    }\n  }\n\n  /* \"pywrapfst.pyx\":2414\n *   cdef void _reweight(self, potentials, bool to_final=False) except *:\n *     cdef unique_ptr[vector[fst.WeightClass]] _potentials\n *     _potentials.reset(new vector[fst.WeightClass]())             # <<<<<<<<<<<<<<\n *     cdef string weight_type = self.weight_type()\n *     for weight in potentials:\n */\n  try {\n    __pyx_t_1 = new std::vector<fst::script::WeightClass> ();\n  } catch(...) {\n    __Pyx_CppExn2PyErr();\n    __PYX_ERR(0, 2414, __pyx_L1_error)\n  }\n  __pyx_v__potentials.reset(__pyx_t_1);\n\n  /* \"pywrapfst.pyx\":2415\n *     cdef unique_ptr[vector[fst.WeightClass]] _potentials\n *     _potentials.reset(new vector[fst.WeightClass]())\n *     cdef string weight_type = self.weight_type()             # <<<<<<<<<<<<<<\n *     for weight in potentials:\n *         _potentials.get().push_back(_get_WeightClass_or_One(self.weight_type(),\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"weight_type\");\n    __PYX_ERR(0, 2415, __pyx_L1_error)\n  }\n  __pyx_v_weight_type = ((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->__pyx_base.weight_type(((struct __pyx_obj_9pywrapfst__Fst *)__pyx_v_self), 0);\n\n  /* \"pywrapfst.pyx\":2416\n *     _potentials.reset(new vector[fst.WeightClass]())\n *     cdef string weight_type = self.weight_type()\n *     for weight in potentials:             # <<<<<<<<<<<<<<\n *         _potentials.get().push_back(_get_WeightClass_or_One(self.weight_type(),\n *                                                             weight))\n */\n  if (likely(PyList_CheckExact(__pyx_v_potentials)) || PyTuple_CheckExact(__pyx_v_potentials)) {\n    __pyx_t_2 = __pyx_v_potentials; __Pyx_INCREF(__pyx_t_2); __pyx_t_3 = 0;\n    __pyx_t_4 = NULL;\n  } else {\n    __pyx_t_3 = -1; __pyx_t_2 = PyObject_GetIter(__pyx_v_potentials); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 2416, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_2);\n    __pyx_t_4 = Py_TYPE(__pyx_t_2)->tp_iternext; if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 2416, __pyx_L1_error)\n  }\n  for (;;) {\n    if (likely(!__pyx_t_4)) {\n      if (likely(PyList_CheckExact(__pyx_t_2))) {\n        if (__pyx_t_3 >= PyList_GET_SIZE(__pyx_t_2)) break;\n        #if CYTHON_ASSUME_SAFE_MACROS && !CYTHON_AVOID_BORROWED_REFS\n        __pyx_t_5 = PyList_GET_ITEM(__pyx_t_2, __pyx_t_3); __Pyx_INCREF(__pyx_t_5); __pyx_t_3++; if (unlikely(0 < 0)) __PYX_ERR(0, 2416, __pyx_L1_error)\n        #else\n        __pyx_t_5 = PySequence_ITEM(__pyx_t_2, __pyx_t_3); __pyx_t_3++; if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 2416, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_5);\n        #endif\n      } else {\n        if (__pyx_t_3 >= PyTuple_GET_SIZE(__pyx_t_2)) break;\n        #if CYTHON_ASSUME_SAFE_MACROS && !CYTHON_AVOID_BORROWED_REFS\n        __pyx_t_5 = PyTuple_GET_ITEM(__pyx_t_2, __pyx_t_3); __Pyx_INCREF(__pyx_t_5); __pyx_t_3++; if (unlikely(0 < 0)) __PYX_ERR(0, 2416, __pyx_L1_error)\n        #else\n        __pyx_t_5 = PySequence_ITEM(__pyx_t_2, __pyx_t_3); __pyx_t_3++; if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 2416, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_5);\n        #endif\n      }\n    } else {\n      __pyx_t_5 = __pyx_t_4(__pyx_t_2);\n      if (unlikely(!__pyx_t_5)) {\n        PyObject* exc_type = PyErr_Occurred();\n        if (exc_type) {\n          if (likely(__Pyx_PyErr_GivenExceptionMatches(exc_type, PyExc_StopIteration))) PyErr_Clear();\n          else __PYX_ERR(0, 2416, __pyx_L1_error)\n        }\n        break;\n      }\n      __Pyx_GOTREF(__pyx_t_5);\n    }\n    __Pyx_XDECREF_SET(__pyx_v_weight, __pyx_t_5);\n    __pyx_t_5 = 0;\n\n    /* \"pywrapfst.pyx\":2417\n *     cdef string weight_type = self.weight_type()\n *     for weight in potentials:\n *         _potentials.get().push_back(_get_WeightClass_or_One(self.weight_type(),             # <<<<<<<<<<<<<<\n *                                                             weight))\n *     fst.Reweight(self._mfst.get(), deref(_potentials),\n */\n    if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n      PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"weight_type\");\n      __PYX_ERR(0, 2417, __pyx_L1_error)\n    }\n\n    /* \"pywrapfst.pyx\":2418\n *     for weight in potentials:\n *         _potentials.get().push_back(_get_WeightClass_or_One(self.weight_type(),\n *                                                             weight))             # <<<<<<<<<<<<<<\n *     fst.Reweight(self._mfst.get(), deref(_potentials),\n *                  fst.GetReweightType(to_final))\n */\n    __pyx_t_6 = __pyx_f_9pywrapfst__get_WeightClass_or_One(((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->__pyx_base.weight_type(((struct __pyx_obj_9pywrapfst__Fst *)__pyx_v_self), 0), __pyx_v_weight); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 2417, __pyx_L1_error)\n\n    /* \"pywrapfst.pyx\":2417\n *     cdef string weight_type = self.weight_type()\n *     for weight in potentials:\n *         _potentials.get().push_back(_get_WeightClass_or_One(self.weight_type(),             # <<<<<<<<<<<<<<\n *                                                             weight))\n *     fst.Reweight(self._mfst.get(), deref(_potentials),\n */\n    try {\n      __pyx_v__potentials.get()->push_back(__pyx_t_6);\n    } catch(...) {\n      __Pyx_CppExn2PyErr();\n      __PYX_ERR(0, 2417, __pyx_L1_error)\n    }\n\n    /* \"pywrapfst.pyx\":2416\n *     _potentials.reset(new vector[fst.WeightClass]())\n *     cdef string weight_type = self.weight_type()\n *     for weight in potentials:             # <<<<<<<<<<<<<<\n *         _potentials.get().push_back(_get_WeightClass_or_One(self.weight_type(),\n *                                                             weight))\n */\n  }\n  __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n\n  /* \"pywrapfst.pyx\":2419\n *         _potentials.get().push_back(_get_WeightClass_or_One(self.weight_type(),\n *                                                             weight))\n *     fst.Reweight(self._mfst.get(), deref(_potentials),             # <<<<<<<<<<<<<<\n *                  fst.GetReweightType(to_final))\n *     self._check_mutating_imethod()\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_mfst\");\n    __PYX_ERR(0, 2419, __pyx_L1_error)\n  }\n\n  /* \"pywrapfst.pyx\":2420\n *                                                             weight))\n *     fst.Reweight(self._mfst.get(), deref(_potentials),\n *                  fst.GetReweightType(to_final))             # <<<<<<<<<<<<<<\n *     self._check_mutating_imethod()\n * \n */\n  fst::script::Reweight(__pyx_v_self->_mfst.get(), (*__pyx_v__potentials), fst::script::GetReweightType(__pyx_v_to_final));\n\n  /* \"pywrapfst.pyx\":2421\n *     fst.Reweight(self._mfst.get(), deref(_potentials),\n *                  fst.GetReweightType(to_final))\n *     self._check_mutating_imethod()             # <<<<<<<<<<<<<<\n * \n *   def reweight(self, potentials, bool to_final=False):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_check_mutating_imethod\");\n    __PYX_ERR(0, 2421, __pyx_L1_error)\n  }\n  ((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->_check_mutating_imethod(__pyx_v_self); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 2421, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":2412\n *     return self\n * \n *   cdef void _reweight(self, potentials, bool to_final=False) except *:             # <<<<<<<<<<<<<<\n *     cdef unique_ptr[vector[fst.WeightClass]] _potentials\n *     _potentials.reset(new vector[fst.WeightClass]())\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst._reweight\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_L0:;\n  __Pyx_XDECREF(__pyx_v_weight);\n  __Pyx_RefNannyFinishContext();\n}\n\n/* \"pywrapfst.pyx\":2423\n *     self._check_mutating_imethod()\n * \n *   def reweight(self, potentials, bool to_final=False):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     reweight(self, potentials, to_final=False)\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_47reweight(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic char __pyx_doc_9pywrapfst_11_MutableFst_46reweight[] = \"\\n    reweight(self, potentials, to_final=False)\\n\\n    Reweights an FST using an iterable of potentials.\\n\\n    This operation destructively reweights an FST according to the potentials\\n    and in the direction specified by the user. An arc of weight w, with an\\n    origin state of potential p and destination state of potential q, is\\n    reweighted by p^{-1} \\\\otimes (w \\\\otimes q) when reweighting towards the\\n    initial state, and by (p \\\\otimes w) \\\\otimes q^{-1} when reweighting towards\\n    the final states. The weights must be left distributive when reweighting\\n    towards the initial state and right distributive when reweighting towards\\n    the final states (e.g., TropicalWeight and LogWeight).\\n\\n    Args:\\n      potentials: An iterable of Weight or weight strings.\\n      to_final: Push towards final states?\\n\\n    Returns:\\n      self.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_47reweight(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  PyObject *__pyx_v_potentials = 0;\n  bool __pyx_v_to_final;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"reweight (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_potentials,&__pyx_n_s_to_final,0};\n    PyObject* values[2] = {0,0};\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (likely((values[0] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_potentials)) != 0)) kw_args--;\n        else goto __pyx_L5_argtuple_error;\n        CYTHON_FALLTHROUGH;\n        case  1:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_to_final);\n          if (value) { values[1] = value; kw_args--; }\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"reweight\") < 0)) __PYX_ERR(0, 2423, __pyx_L3_error)\n      }\n    } else {\n      switch (PyTuple_GET_SIZE(__pyx_args)) {\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n    }\n    __pyx_v_potentials = values[0];\n    if (values[1]) {\n      __pyx_v_to_final = __Pyx_PyObject_IsTrue(values[1]); if (unlikely((__pyx_v_to_final == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 2423, __pyx_L3_error)\n    } else {\n      __pyx_v_to_final = ((bool)0);\n    }\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"reweight\", 0, 1, 2, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 2423, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst.reweight\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  __pyx_r = __pyx_pf_9pywrapfst_11_MutableFst_46reweight(((struct __pyx_obj_9pywrapfst__MutableFst *)__pyx_v_self), __pyx_v_potentials, __pyx_v_to_final);\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_46reweight(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, PyObject *__pyx_v_potentials, bool __pyx_v_to_final) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  struct __pyx_opt_args_9pywrapfst_11_MutableFst__reweight __pyx_t_1;\n  __Pyx_RefNannySetupContext(\"reweight\", 0);\n\n  /* \"pywrapfst.pyx\":2445\n *       self.\n *     \"\"\"\n *     self._reweight(potentials, to_final)             # <<<<<<<<<<<<<<\n *     return self\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_reweight\");\n    __PYX_ERR(0, 2445, __pyx_L1_error)\n  }\n  __pyx_t_1.__pyx_n = 1;\n  __pyx_t_1.to_final = __pyx_v_to_final;\n  ((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->_reweight(__pyx_v_self, __pyx_v_potentials, &__pyx_t_1); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 2445, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":2446\n *     \"\"\"\n *     self._reweight(potentials, to_final)\n *     return self             # <<<<<<<<<<<<<<\n * \n *   cdef void _rmepsilon(self,\n */\n  __Pyx_XDECREF(__pyx_r);\n  __Pyx_INCREF(((PyObject *)__pyx_v_self));\n  __pyx_r = ((PyObject *)__pyx_v_self);\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":2423\n *     self._check_mutating_imethod()\n * \n *   def reweight(self, potentials, bool to_final=False):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     reweight(self, potentials, to_final=False)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst.reweight\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":2448\n *     return self\n * \n *   cdef void _rmepsilon(self,             # <<<<<<<<<<<<<<\n *                        queue_type=b\"auto\",\n *                        bool connect=True,\n */\n\nstatic void __pyx_f_9pywrapfst_11_MutableFst__rmepsilon(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, struct __pyx_opt_args_9pywrapfst_11_MutableFst__rmepsilon *__pyx_optional_args) {\n  PyObject *__pyx_v_queue_type = ((PyObject *)__pyx_n_b_auto);\n\n  /* \"pywrapfst.pyx\":2450\n *   cdef void _rmepsilon(self,\n *                        queue_type=b\"auto\",\n *                        bool connect=True,             # <<<<<<<<<<<<<<\n *                        weight=None,\n *                        int64 nstate=fst.kNoStateId,\n */\n  bool __pyx_v_connect = ((bool)1);\n\n  /* \"pywrapfst.pyx\":2451\n *                        queue_type=b\"auto\",\n *                        bool connect=True,\n *                        weight=None,             # <<<<<<<<<<<<<<\n *                        int64 nstate=fst.kNoStateId,\n *                        float delta=fst.kShortestDelta) except *:\n */\n  PyObject *__pyx_v_weight = ((PyObject *)Py_None);\n  __pyx_t_10basictypes_int64 __pyx_v_nstate = __pyx_k__46;\n  float __pyx_v_delta = __pyx_k__47;\n  fst::script::WeightClass __pyx_v_wc;\n  std::unique_ptr<fst::script::RmEpsilonOptions>  __pyx_v_opts;\n  __Pyx_RefNannyDeclarations\n  fst::script::WeightClass __pyx_t_1;\n  std::string __pyx_t_2;\n  enum fst::QueueType __pyx_t_3;\n  __Pyx_RefNannySetupContext(\"_rmepsilon\", 0);\n  if (__pyx_optional_args) {\n    if (__pyx_optional_args->__pyx_n > 0) {\n      __pyx_v_queue_type = __pyx_optional_args->queue_type;\n      if (__pyx_optional_args->__pyx_n > 1) {\n        __pyx_v_connect = __pyx_optional_args->connect;\n        if (__pyx_optional_args->__pyx_n > 2) {\n          __pyx_v_weight = __pyx_optional_args->weight;\n          if (__pyx_optional_args->__pyx_n > 3) {\n            __pyx_v_nstate = __pyx_optional_args->nstate;\n            if (__pyx_optional_args->__pyx_n > 4) {\n              __pyx_v_delta = __pyx_optional_args->delta;\n            }\n          }\n        }\n      }\n    }\n  }\n\n  /* \"pywrapfst.pyx\":2454\n *                        int64 nstate=fst.kNoStateId,\n *                        float delta=fst.kShortestDelta) except *:\n *     cdef fst.WeightClass wc = _get_WeightClass_or_Zero(self.weight_type(),             # <<<<<<<<<<<<<<\n *                                                        weight)\n *     cdef unique_ptr[fst.RmEpsilonOptions] opts\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"weight_type\");\n    __PYX_ERR(0, 2454, __pyx_L1_error)\n  }\n\n  /* \"pywrapfst.pyx\":2455\n *                        float delta=fst.kShortestDelta) except *:\n *     cdef fst.WeightClass wc = _get_WeightClass_or_Zero(self.weight_type(),\n *                                                        weight)             # <<<<<<<<<<<<<<\n *     cdef unique_ptr[fst.RmEpsilonOptions] opts\n *     opts.reset(new fst.RmEpsilonOptions(_get_queue_type(tostring(queue_type)),\n */\n  __pyx_t_1 = __pyx_f_9pywrapfst__get_WeightClass_or_Zero(((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->__pyx_base.weight_type(((struct __pyx_obj_9pywrapfst__Fst *)__pyx_v_self), 0), __pyx_v_weight); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 2454, __pyx_L1_error)\n  __pyx_v_wc = __pyx_t_1;\n\n  /* \"pywrapfst.pyx\":2457\n *                                                        weight)\n *     cdef unique_ptr[fst.RmEpsilonOptions] opts\n *     opts.reset(new fst.RmEpsilonOptions(_get_queue_type(tostring(queue_type)),             # <<<<<<<<<<<<<<\n *                                         connect, wc, nstate, delta))\n *     fst.RmEpsilon(self._mfst.get(), deref(opts))\n */\n  __pyx_t_2 = __pyx_f_9pywrapfst_tostring(__pyx_v_queue_type, NULL); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 2457, __pyx_L1_error)\n  __pyx_t_3 = __pyx_f_9pywrapfst__get_queue_type(__pyx_t_2); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 2457, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":2458\n *     cdef unique_ptr[fst.RmEpsilonOptions] opts\n *     opts.reset(new fst.RmEpsilonOptions(_get_queue_type(tostring(queue_type)),\n *                                         connect, wc, nstate, delta))             # <<<<<<<<<<<<<<\n *     fst.RmEpsilon(self._mfst.get(), deref(opts))\n *     self._check_mutating_imethod()\n */\n  __pyx_v_opts.reset(new fst::script::RmEpsilonOptions(__pyx_t_3, __pyx_v_connect, __pyx_v_wc, __pyx_v_nstate, __pyx_v_delta));\n\n  /* \"pywrapfst.pyx\":2459\n *     opts.reset(new fst.RmEpsilonOptions(_get_queue_type(tostring(queue_type)),\n *                                         connect, wc, nstate, delta))\n *     fst.RmEpsilon(self._mfst.get(), deref(opts))             # <<<<<<<<<<<<<<\n *     self._check_mutating_imethod()\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_mfst\");\n    __PYX_ERR(0, 2459, __pyx_L1_error)\n  }\n  fst::script::RmEpsilon(__pyx_v_self->_mfst.get(), (*__pyx_v_opts));\n\n  /* \"pywrapfst.pyx\":2460\n *                                         connect, wc, nstate, delta))\n *     fst.RmEpsilon(self._mfst.get(), deref(opts))\n *     self._check_mutating_imethod()             # <<<<<<<<<<<<<<\n * \n *   def rmepsilon(self,\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_check_mutating_imethod\");\n    __PYX_ERR(0, 2460, __pyx_L1_error)\n  }\n  ((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->_check_mutating_imethod(__pyx_v_self); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 2460, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":2448\n *     return self\n * \n *   cdef void _rmepsilon(self,             # <<<<<<<<<<<<<<\n *                        queue_type=b\"auto\",\n *                        bool connect=True,\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst._rmepsilon\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n}\n\n/* \"pywrapfst.pyx\":2462\n *     self._check_mutating_imethod()\n * \n *   def rmepsilon(self,             # <<<<<<<<<<<<<<\n *                 queue_type=b\"auto\",\n *                 bool connect=True,\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_49rmepsilon(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic char __pyx_doc_9pywrapfst_11_MutableFst_48rmepsilon[] = \"\\n    rmepsilon(self, queue_type=\\\"auto\\\", connect=True, weight=None,\\n              nstate=NO_STATE_ID, delta=1e-6):\\n\\n    Removes epsilon transitions.\\n\\n    This operation destructively removes epsilon transitions, i.e., those where\\n    both input and output labels are epsilon) from an FST.\\n\\n    Args:\\n      queue_type: A string matching a known queue type; one of: \\\"auto\\\", \\\"fifo\\\",\\n          \\\"lifo\\\", \\\"shortest\\\", \\\"state\\\", \\\"top\\\".\\n      connect: Should output be trimmed?\\n      weight: A Weight or weight string indicating the desired weight threshold\\n          below which paths are pruned; if omitted, no paths are pruned.\\n      nstate: State number threshold.\\n      delta: Comparison/quantization delta.\\n\\n    Returns:\\n      self.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_49rmepsilon(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  PyObject *__pyx_v_queue_type = 0;\n  bool __pyx_v_connect;\n  PyObject *__pyx_v_weight = 0;\n  __pyx_t_10basictypes_int64 __pyx_v_nstate;\n  float __pyx_v_delta;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"rmepsilon (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_queue_type,&__pyx_n_s_connect,&__pyx_n_s_weight,&__pyx_n_s_nstate,&__pyx_n_s_delta,0};\n    PyObject* values[5] = {0,0,0,0,0};\n    values[0] = ((PyObject *)__pyx_n_b_auto);\n\n    /* \"pywrapfst.pyx\":2465\n *                 queue_type=b\"auto\",\n *                 bool connect=True,\n *                 weight=None,             # <<<<<<<<<<<<<<\n *                 int64 nstate=fst.kNoStateId,\n *                 float delta=fst.kShortestDelta):\n */\n    values[2] = ((PyObject *)Py_None);\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  5: values[4] = PyTuple_GET_ITEM(__pyx_args, 4);\n        CYTHON_FALLTHROUGH;\n        case  4: values[3] = PyTuple_GET_ITEM(__pyx_args, 3);\n        CYTHON_FALLTHROUGH;\n        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);\n        CYTHON_FALLTHROUGH;\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_queue_type);\n          if (value) { values[0] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  1:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_connect);\n          if (value) { values[1] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  2:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_weight);\n          if (value) { values[2] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  3:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_nstate);\n          if (value) { values[3] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  4:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_delta);\n          if (value) { values[4] = value; kw_args--; }\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"rmepsilon\") < 0)) __PYX_ERR(0, 2462, __pyx_L3_error)\n      }\n    } else {\n      switch (PyTuple_GET_SIZE(__pyx_args)) {\n        case  5: values[4] = PyTuple_GET_ITEM(__pyx_args, 4);\n        CYTHON_FALLTHROUGH;\n        case  4: values[3] = PyTuple_GET_ITEM(__pyx_args, 3);\n        CYTHON_FALLTHROUGH;\n        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);\n        CYTHON_FALLTHROUGH;\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n    }\n    __pyx_v_queue_type = values[0];\n    if (values[1]) {\n      __pyx_v_connect = __Pyx_PyObject_IsTrue(values[1]); if (unlikely((__pyx_v_connect == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 2464, __pyx_L3_error)\n    } else {\n\n      /* \"pywrapfst.pyx\":2464\n *   def rmepsilon(self,\n *                 queue_type=b\"auto\",\n *                 bool connect=True,             # <<<<<<<<<<<<<<\n *                 weight=None,\n *                 int64 nstate=fst.kNoStateId,\n */\n      __pyx_v_connect = ((bool)1);\n    }\n    __pyx_v_weight = values[2];\n    if (values[3]) {\n      __pyx_v_nstate = __Pyx_PyInt_As_int64_t(values[3]); if (unlikely((__pyx_v_nstate == ((int64_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 2466, __pyx_L3_error)\n    } else {\n      __pyx_v_nstate = __pyx_k__48;\n    }\n    if (values[4]) {\n      __pyx_v_delta = __pyx_PyFloat_AsFloat(values[4]); if (unlikely((__pyx_v_delta == (float)-1) && PyErr_Occurred())) __PYX_ERR(0, 2467, __pyx_L3_error)\n    } else {\n      __pyx_v_delta = __pyx_k__49;\n    }\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"rmepsilon\", 0, 0, 5, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 2462, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst.rmepsilon\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  __pyx_r = __pyx_pf_9pywrapfst_11_MutableFst_48rmepsilon(((struct __pyx_obj_9pywrapfst__MutableFst *)__pyx_v_self), __pyx_v_queue_type, __pyx_v_connect, __pyx_v_weight, __pyx_v_nstate, __pyx_v_delta);\n\n  /* \"pywrapfst.pyx\":2462\n *     self._check_mutating_imethod()\n * \n *   def rmepsilon(self,             # <<<<<<<<<<<<<<\n *                 queue_type=b\"auto\",\n *                 bool connect=True,\n */\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_48rmepsilon(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, PyObject *__pyx_v_queue_type, bool __pyx_v_connect, PyObject *__pyx_v_weight, __pyx_t_10basictypes_int64 __pyx_v_nstate, float __pyx_v_delta) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  struct __pyx_opt_args_9pywrapfst_11_MutableFst__rmepsilon __pyx_t_1;\n  __Pyx_RefNannySetupContext(\"rmepsilon\", 0);\n\n  /* \"pywrapfst.pyx\":2489\n *       self.\n *     \"\"\"\n *     self._rmepsilon(queue_type, connect, weight, nstate, delta)             # <<<<<<<<<<<<<<\n *     return self\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_rmepsilon\");\n    __PYX_ERR(0, 2489, __pyx_L1_error)\n  }\n  __pyx_t_1.__pyx_n = 5;\n  __pyx_t_1.queue_type = __pyx_v_queue_type;\n  __pyx_t_1.connect = __pyx_v_connect;\n  __pyx_t_1.weight = __pyx_v_weight;\n  __pyx_t_1.nstate = __pyx_v_nstate;\n  __pyx_t_1.delta = __pyx_v_delta;\n  ((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->_rmepsilon(__pyx_v_self, &__pyx_t_1); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 2489, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":2490\n *     \"\"\"\n *     self._rmepsilon(queue_type, connect, weight, nstate, delta)\n *     return self             # <<<<<<<<<<<<<<\n * \n *   cdef void _set_final(self, int64 state, weight=None) except *:\n */\n  __Pyx_XDECREF(__pyx_r);\n  __Pyx_INCREF(((PyObject *)__pyx_v_self));\n  __pyx_r = ((PyObject *)__pyx_v_self);\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":2462\n *     self._check_mutating_imethod()\n * \n *   def rmepsilon(self,             # <<<<<<<<<<<<<<\n *                 queue_type=b\"auto\",\n *                 bool connect=True,\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst.rmepsilon\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":2492\n *     return self\n * \n *   cdef void _set_final(self, int64 state, weight=None) except *:             # <<<<<<<<<<<<<<\n *     if not self._mfst.get().ValidStateId(state):\n *       raise FstIndexError(\"State index out of range\")\n */\n\nstatic void __pyx_f_9pywrapfst_11_MutableFst__set_final(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, __pyx_t_10basictypes_int64 __pyx_v_state, struct __pyx_opt_args_9pywrapfst_11_MutableFst__set_final *__pyx_optional_args) {\n  PyObject *__pyx_v_weight = ((PyObject *)Py_None);\n  fst::script::WeightClass __pyx_v_wc;\n  __Pyx_RefNannyDeclarations\n  int __pyx_t_1;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  fst::script::WeightClass __pyx_t_4;\n  __Pyx_RefNannySetupContext(\"_set_final\", 0);\n  if (__pyx_optional_args) {\n    if (__pyx_optional_args->__pyx_n > 0) {\n      __pyx_v_weight = __pyx_optional_args->weight;\n    }\n  }\n\n  /* \"pywrapfst.pyx\":2493\n * \n *   cdef void _set_final(self, int64 state, weight=None) except *:\n *     if not self._mfst.get().ValidStateId(state):             # <<<<<<<<<<<<<<\n *       raise FstIndexError(\"State index out of range\")\n *     cdef fst.WeightClass wc = _get_WeightClass_or_One(self.weight_type(),\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_mfst\");\n    __PYX_ERR(0, 2493, __pyx_L1_error)\n  }\n  __pyx_t_1 = ((!(__pyx_v_self->_mfst.get()->ValidStateId(__pyx_v_state) != 0)) != 0);\n  if (__pyx_t_1) {\n\n    /* \"pywrapfst.pyx\":2494\n *   cdef void _set_final(self, int64 state, weight=None) except *:\n *     if not self._mfst.get().ValidStateId(state):\n *       raise FstIndexError(\"State index out of range\")             # <<<<<<<<<<<<<<\n *     cdef fst.WeightClass wc = _get_WeightClass_or_One(self.weight_type(),\n *                                                       weight)\n */\n    __pyx_t_2 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstIndexError); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 2494, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_2);\n    __pyx_t_3 = __Pyx_PyObject_Call(__pyx_t_2, __pyx_tuple__50, NULL); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 2494, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_3);\n    __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n    __Pyx_Raise(__pyx_t_3, 0, 0, 0);\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    __PYX_ERR(0, 2494, __pyx_L1_error)\n\n    /* \"pywrapfst.pyx\":2493\n * \n *   cdef void _set_final(self, int64 state, weight=None) except *:\n *     if not self._mfst.get().ValidStateId(state):             # <<<<<<<<<<<<<<\n *       raise FstIndexError(\"State index out of range\")\n *     cdef fst.WeightClass wc = _get_WeightClass_or_One(self.weight_type(),\n */\n  }\n\n  /* \"pywrapfst.pyx\":2495\n *     if not self._mfst.get().ValidStateId(state):\n *       raise FstIndexError(\"State index out of range\")\n *     cdef fst.WeightClass wc = _get_WeightClass_or_One(self.weight_type(),             # <<<<<<<<<<<<<<\n *                                                       weight)\n *     if not self._mfst.get().SetFinal(state, wc):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"weight_type\");\n    __PYX_ERR(0, 2495, __pyx_L1_error)\n  }\n\n  /* \"pywrapfst.pyx\":2496\n *       raise FstIndexError(\"State index out of range\")\n *     cdef fst.WeightClass wc = _get_WeightClass_or_One(self.weight_type(),\n *                                                       weight)             # <<<<<<<<<<<<<<\n *     if not self._mfst.get().SetFinal(state, wc):\n *       raise FstOpError(\"Incompatible or invalid weight\")\n */\n  __pyx_t_4 = __pyx_f_9pywrapfst__get_WeightClass_or_One(((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->__pyx_base.weight_type(((struct __pyx_obj_9pywrapfst__Fst *)__pyx_v_self), 0), __pyx_v_weight); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 2495, __pyx_L1_error)\n  __pyx_v_wc = __pyx_t_4;\n\n  /* \"pywrapfst.pyx\":2497\n *     cdef fst.WeightClass wc = _get_WeightClass_or_One(self.weight_type(),\n *                                                       weight)\n *     if not self._mfst.get().SetFinal(state, wc):             # <<<<<<<<<<<<<<\n *       raise FstOpError(\"Incompatible or invalid weight\")\n *     self._check_mutating_imethod()\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_mfst\");\n    __PYX_ERR(0, 2497, __pyx_L1_error)\n  }\n  __pyx_t_1 = ((!(__pyx_v_self->_mfst.get()->SetFinal(__pyx_v_state, __pyx_v_wc) != 0)) != 0);\n  if (__pyx_t_1) {\n\n    /* \"pywrapfst.pyx\":2498\n *                                                       weight)\n *     if not self._mfst.get().SetFinal(state, wc):\n *       raise FstOpError(\"Incompatible or invalid weight\")             # <<<<<<<<<<<<<<\n *     self._check_mutating_imethod()\n * \n */\n    __pyx_t_3 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstOpError); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 2498, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_3);\n    __pyx_t_2 = __Pyx_PyObject_Call(__pyx_t_3, __pyx_tuple__51, NULL); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 2498, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_2);\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    __Pyx_Raise(__pyx_t_2, 0, 0, 0);\n    __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n    __PYX_ERR(0, 2498, __pyx_L1_error)\n\n    /* \"pywrapfst.pyx\":2497\n *     cdef fst.WeightClass wc = _get_WeightClass_or_One(self.weight_type(),\n *                                                       weight)\n *     if not self._mfst.get().SetFinal(state, wc):             # <<<<<<<<<<<<<<\n *       raise FstOpError(\"Incompatible or invalid weight\")\n *     self._check_mutating_imethod()\n */\n  }\n\n  /* \"pywrapfst.pyx\":2499\n *     if not self._mfst.get().SetFinal(state, wc):\n *       raise FstOpError(\"Incompatible or invalid weight\")\n *     self._check_mutating_imethod()             # <<<<<<<<<<<<<<\n * \n *   def set_final(self, int64 state, weight=None):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_check_mutating_imethod\");\n    __PYX_ERR(0, 2499, __pyx_L1_error)\n  }\n  ((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->_check_mutating_imethod(__pyx_v_self); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 2499, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":2492\n *     return self\n * \n *   cdef void _set_final(self, int64 state, weight=None) except *:             # <<<<<<<<<<<<<<\n *     if not self._mfst.get().ValidStateId(state):\n *       raise FstIndexError(\"State index out of range\")\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst._set_final\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n}\n\n/* \"pywrapfst.pyx\":2501\n *     self._check_mutating_imethod()\n * \n *   def set_final(self, int64 state, weight=None):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     set_final(self, state, weight)\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_51set_final(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic char __pyx_doc_9pywrapfst_11_MutableFst_50set_final[] = \"\\n    set_final(self, state, weight)\\n\\n    Sets the final weight for a state.\\n\\n    Args:\\n      state: The integer index of a state.\\n      weight: A Weight or weight string indicating the desired final weight; if\\n          omitted, it is set to semiring One.\\n\\n    Returns:\\n      self.\\n\\n    Raises:\\n      FstIndexError: State index out of range.\\n      FstOpError: Incompatible or invalid weight.\\n\\n    See also: `set_start`.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_51set_final(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  __pyx_t_10basictypes_int64 __pyx_v_state;\n  PyObject *__pyx_v_weight = 0;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"set_final (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_state,&__pyx_n_s_weight,0};\n    PyObject* values[2] = {0,0};\n    values[1] = ((PyObject *)Py_None);\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (likely((values[0] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_state)) != 0)) kw_args--;\n        else goto __pyx_L5_argtuple_error;\n        CYTHON_FALLTHROUGH;\n        case  1:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_weight);\n          if (value) { values[1] = value; kw_args--; }\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"set_final\") < 0)) __PYX_ERR(0, 2501, __pyx_L3_error)\n      }\n    } else {\n      switch (PyTuple_GET_SIZE(__pyx_args)) {\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n    }\n    __pyx_v_state = __Pyx_PyInt_As_int64_t(values[0]); if (unlikely((__pyx_v_state == ((int64_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 2501, __pyx_L3_error)\n    __pyx_v_weight = values[1];\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"set_final\", 0, 1, 2, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 2501, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst.set_final\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  __pyx_r = __pyx_pf_9pywrapfst_11_MutableFst_50set_final(((struct __pyx_obj_9pywrapfst__MutableFst *)__pyx_v_self), __pyx_v_state, __pyx_v_weight);\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_50set_final(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, __pyx_t_10basictypes_int64 __pyx_v_state, PyObject *__pyx_v_weight) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  struct __pyx_opt_args_9pywrapfst_11_MutableFst__set_final __pyx_t_1;\n  __Pyx_RefNannySetupContext(\"set_final\", 0);\n\n  /* \"pywrapfst.pyx\":2521\n *     See also: `set_start`.\n *     \"\"\"\n *     self._set_final(state, weight)             # <<<<<<<<<<<<<<\n *     return self\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_set_final\");\n    __PYX_ERR(0, 2521, __pyx_L1_error)\n  }\n  __pyx_t_1.__pyx_n = 1;\n  __pyx_t_1.weight = __pyx_v_weight;\n  ((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->_set_final(__pyx_v_self, __pyx_v_state, &__pyx_t_1); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 2521, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":2522\n *     \"\"\"\n *     self._set_final(state, weight)\n *     return self             # <<<<<<<<<<<<<<\n * \n *   cdef void _set_input_symbols(self, _SymbolTable syms) except *:\n */\n  __Pyx_XDECREF(__pyx_r);\n  __Pyx_INCREF(((PyObject *)__pyx_v_self));\n  __pyx_r = ((PyObject *)__pyx_v_self);\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":2501\n *     self._check_mutating_imethod()\n * \n *   def set_final(self, int64 state, weight=None):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     set_final(self, state, weight)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst.set_final\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":2524\n *     return self\n * \n *   cdef void _set_input_symbols(self, _SymbolTable syms) except *:             # <<<<<<<<<<<<<<\n *     if syms is None:\n *       self._mfst.get().SetInputSymbols(NULL)\n */\n\nstatic void __pyx_f_9pywrapfst_11_MutableFst__set_input_symbols(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_syms) {\n  __Pyx_RefNannyDeclarations\n  int __pyx_t_1;\n  int __pyx_t_2;\n  __Pyx_RefNannySetupContext(\"_set_input_symbols\", 0);\n\n  /* \"pywrapfst.pyx\":2525\n * \n *   cdef void _set_input_symbols(self, _SymbolTable syms) except *:\n *     if syms is None:             # <<<<<<<<<<<<<<\n *       self._mfst.get().SetInputSymbols(NULL)\n *       return\n */\n  __pyx_t_1 = (((PyObject *)__pyx_v_syms) == Py_None);\n  __pyx_t_2 = (__pyx_t_1 != 0);\n  if (__pyx_t_2) {\n\n    /* \"pywrapfst.pyx\":2526\n *   cdef void _set_input_symbols(self, _SymbolTable syms) except *:\n *     if syms is None:\n *       self._mfst.get().SetInputSymbols(NULL)             # <<<<<<<<<<<<<<\n *       return\n *     self._mfst.get().SetInputSymbols(syms._table)\n */\n    if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n      PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_mfst\");\n      __PYX_ERR(0, 2526, __pyx_L1_error)\n    }\n    __pyx_v_self->_mfst.get()->SetInputSymbols(NULL);\n\n    /* \"pywrapfst.pyx\":2527\n *     if syms is None:\n *       self._mfst.get().SetInputSymbols(NULL)\n *       return             # <<<<<<<<<<<<<<\n *     self._mfst.get().SetInputSymbols(syms._table)\n *     self._check_mutating_imethod()\n */\n    goto __pyx_L0;\n\n    /* \"pywrapfst.pyx\":2525\n * \n *   cdef void _set_input_symbols(self, _SymbolTable syms) except *:\n *     if syms is None:             # <<<<<<<<<<<<<<\n *       self._mfst.get().SetInputSymbols(NULL)\n *       return\n */\n  }\n\n  /* \"pywrapfst.pyx\":2528\n *       self._mfst.get().SetInputSymbols(NULL)\n *       return\n *     self._mfst.get().SetInputSymbols(syms._table)             # <<<<<<<<<<<<<<\n *     self._check_mutating_imethod()\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_mfst\");\n    __PYX_ERR(0, 2528, __pyx_L1_error)\n  }\n  if (unlikely(((PyObject *)__pyx_v_syms) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_table\");\n    __PYX_ERR(0, 2528, __pyx_L1_error)\n  }\n  __pyx_v_self->_mfst.get()->SetInputSymbols(__pyx_v_syms->_table);\n\n  /* \"pywrapfst.pyx\":2529\n *       return\n *     self._mfst.get().SetInputSymbols(syms._table)\n *     self._check_mutating_imethod()             # <<<<<<<<<<<<<<\n * \n *   def set_input_symbols(self, _SymbolTable syms):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_check_mutating_imethod\");\n    __PYX_ERR(0, 2529, __pyx_L1_error)\n  }\n  ((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->_check_mutating_imethod(__pyx_v_self); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 2529, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":2524\n *     return self\n * \n *   cdef void _set_input_symbols(self, _SymbolTable syms) except *:             # <<<<<<<<<<<<<<\n *     if syms is None:\n *       self._mfst.get().SetInputSymbols(NULL)\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst._set_input_symbols\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n}\n\n/* \"pywrapfst.pyx\":2531\n *     self._check_mutating_imethod()\n * \n *   def set_input_symbols(self, _SymbolTable syms):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     set_input_symbols(self, syms)\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_53set_input_symbols(PyObject *__pyx_v_self, PyObject *__pyx_v_syms); /*proto*/\nstatic char __pyx_doc_9pywrapfst_11_MutableFst_52set_input_symbols[] = \"\\n    set_input_symbols(self, syms)\\n\\n    Sets the input symbol table.\\n\\n    Passing None as a value will delete the input symbol table.\\n\\n    Args:\\n      syms: A SymbolTable.\\n\\n    Returns:\\n      self.\\n\\n    See also: `set_output_symbols`.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_53set_input_symbols(PyObject *__pyx_v_self, PyObject *__pyx_v_syms) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"set_input_symbols (wrapper)\", 0);\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_syms), __pyx_ptype_9pywrapfst__SymbolTable, 1, \"syms\", 0))) __PYX_ERR(0, 2531, __pyx_L1_error)\n  __pyx_r = __pyx_pf_9pywrapfst_11_MutableFst_52set_input_symbols(((struct __pyx_obj_9pywrapfst__MutableFst *)__pyx_v_self), ((struct __pyx_obj_9pywrapfst__SymbolTable *)__pyx_v_syms));\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_52set_input_symbols(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_syms) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"set_input_symbols\", 0);\n\n  /* \"pywrapfst.pyx\":2547\n *     See also: `set_output_symbols`.\n *     \"\"\"\n *     self._set_input_symbols(syms)             # <<<<<<<<<<<<<<\n *     return self\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_set_input_symbols\");\n    __PYX_ERR(0, 2547, __pyx_L1_error)\n  }\n  ((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->_set_input_symbols(__pyx_v_self, __pyx_v_syms); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 2547, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":2548\n *     \"\"\"\n *     self._set_input_symbols(syms)\n *     return self             # <<<<<<<<<<<<<<\n * \n *   cdef void _set_output_symbols(self, _SymbolTable syms) except *:\n */\n  __Pyx_XDECREF(__pyx_r);\n  __Pyx_INCREF(((PyObject *)__pyx_v_self));\n  __pyx_r = ((PyObject *)__pyx_v_self);\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":2531\n *     self._check_mutating_imethod()\n * \n *   def set_input_symbols(self, _SymbolTable syms):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     set_input_symbols(self, syms)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst.set_input_symbols\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":2550\n *     return self\n * \n *   cdef void _set_output_symbols(self, _SymbolTable syms) except *:             # <<<<<<<<<<<<<<\n *     if syms is None:\n *       self._mfst.get().SetOutputSymbols(NULL)\n */\n\nstatic void __pyx_f_9pywrapfst_11_MutableFst__set_output_symbols(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_syms) {\n  __Pyx_RefNannyDeclarations\n  int __pyx_t_1;\n  int __pyx_t_2;\n  __Pyx_RefNannySetupContext(\"_set_output_symbols\", 0);\n\n  /* \"pywrapfst.pyx\":2551\n * \n *   cdef void _set_output_symbols(self, _SymbolTable syms) except *:\n *     if syms is None:             # <<<<<<<<<<<<<<\n *       self._mfst.get().SetOutputSymbols(NULL)\n *       return\n */\n  __pyx_t_1 = (((PyObject *)__pyx_v_syms) == Py_None);\n  __pyx_t_2 = (__pyx_t_1 != 0);\n  if (__pyx_t_2) {\n\n    /* \"pywrapfst.pyx\":2552\n *   cdef void _set_output_symbols(self, _SymbolTable syms) except *:\n *     if syms is None:\n *       self._mfst.get().SetOutputSymbols(NULL)             # <<<<<<<<<<<<<<\n *       return\n *     self._mfst.get().SetOutputSymbols(syms._table)\n */\n    if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n      PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_mfst\");\n      __PYX_ERR(0, 2552, __pyx_L1_error)\n    }\n    __pyx_v_self->_mfst.get()->SetOutputSymbols(NULL);\n\n    /* \"pywrapfst.pyx\":2553\n *     if syms is None:\n *       self._mfst.get().SetOutputSymbols(NULL)\n *       return             # <<<<<<<<<<<<<<\n *     self._mfst.get().SetOutputSymbols(syms._table)\n *     self._check_mutating_imethod()\n */\n    goto __pyx_L0;\n\n    /* \"pywrapfst.pyx\":2551\n * \n *   cdef void _set_output_symbols(self, _SymbolTable syms) except *:\n *     if syms is None:             # <<<<<<<<<<<<<<\n *       self._mfst.get().SetOutputSymbols(NULL)\n *       return\n */\n  }\n\n  /* \"pywrapfst.pyx\":2554\n *       self._mfst.get().SetOutputSymbols(NULL)\n *       return\n *     self._mfst.get().SetOutputSymbols(syms._table)             # <<<<<<<<<<<<<<\n *     self._check_mutating_imethod()\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_mfst\");\n    __PYX_ERR(0, 2554, __pyx_L1_error)\n  }\n  if (unlikely(((PyObject *)__pyx_v_syms) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_table\");\n    __PYX_ERR(0, 2554, __pyx_L1_error)\n  }\n  __pyx_v_self->_mfst.get()->SetOutputSymbols(__pyx_v_syms->_table);\n\n  /* \"pywrapfst.pyx\":2555\n *       return\n *     self._mfst.get().SetOutputSymbols(syms._table)\n *     self._check_mutating_imethod()             # <<<<<<<<<<<<<<\n * \n *   def set_output_symbols(self, _SymbolTable syms):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_check_mutating_imethod\");\n    __PYX_ERR(0, 2555, __pyx_L1_error)\n  }\n  ((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->_check_mutating_imethod(__pyx_v_self); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 2555, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":2550\n *     return self\n * \n *   cdef void _set_output_symbols(self, _SymbolTable syms) except *:             # <<<<<<<<<<<<<<\n *     if syms is None:\n *       self._mfst.get().SetOutputSymbols(NULL)\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst._set_output_symbols\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n}\n\n/* \"pywrapfst.pyx\":2557\n *     self._check_mutating_imethod()\n * \n *   def set_output_symbols(self, _SymbolTable syms):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     set_output_symbols(self, syms)\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_55set_output_symbols(PyObject *__pyx_v_self, PyObject *__pyx_v_syms); /*proto*/\nstatic char __pyx_doc_9pywrapfst_11_MutableFst_54set_output_symbols[] = \"\\n    set_output_symbols(self, syms)\\n\\n    Sets the output symbol table.\\n\\n    Passing None as a value will delete the output symbol table.\\n\\n    Args:\\n      syms: A SymbolTable.\\n\\n    Returns:\\n      self.\\n\\n    See also: `set_input_symbols`.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_55set_output_symbols(PyObject *__pyx_v_self, PyObject *__pyx_v_syms) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"set_output_symbols (wrapper)\", 0);\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_syms), __pyx_ptype_9pywrapfst__SymbolTable, 1, \"syms\", 0))) __PYX_ERR(0, 2557, __pyx_L1_error)\n  __pyx_r = __pyx_pf_9pywrapfst_11_MutableFst_54set_output_symbols(((struct __pyx_obj_9pywrapfst__MutableFst *)__pyx_v_self), ((struct __pyx_obj_9pywrapfst__SymbolTable *)__pyx_v_syms));\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_54set_output_symbols(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_syms) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"set_output_symbols\", 0);\n\n  /* \"pywrapfst.pyx\":2573\n *     See also: `set_input_symbols`.\n *     \"\"\"\n *     self._set_output_symbols(syms)             # <<<<<<<<<<<<<<\n *     return self\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_set_output_symbols\");\n    __PYX_ERR(0, 2573, __pyx_L1_error)\n  }\n  ((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->_set_output_symbols(__pyx_v_self, __pyx_v_syms); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 2573, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":2574\n *     \"\"\"\n *     self._set_output_symbols(syms)\n *     return self             # <<<<<<<<<<<<<<\n * \n *   cdef void _set_properties(self, uint64 props, uint64 mask):\n */\n  __Pyx_XDECREF(__pyx_r);\n  __Pyx_INCREF(((PyObject *)__pyx_v_self));\n  __pyx_r = ((PyObject *)__pyx_v_self);\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":2557\n *     self._check_mutating_imethod()\n * \n *   def set_output_symbols(self, _SymbolTable syms):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     set_output_symbols(self, syms)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst.set_output_symbols\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":2576\n *     return self\n * \n *   cdef void _set_properties(self, uint64 props, uint64 mask):             # <<<<<<<<<<<<<<\n *     self._mfst.get().SetProperties(props, mask)\n * \n */\n\nstatic void __pyx_f_9pywrapfst_11_MutableFst__set_properties(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, __pyx_t_10basictypes_uint64 __pyx_v_props, __pyx_t_10basictypes_uint64 __pyx_v_mask) {\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"_set_properties\", 0);\n\n  /* \"pywrapfst.pyx\":2577\n * \n *   cdef void _set_properties(self, uint64 props, uint64 mask):\n *     self._mfst.get().SetProperties(props, mask)             # <<<<<<<<<<<<<<\n * \n *   def set_properties(self, uint64 props, uint64 mask):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_mfst\");\n    __PYX_ERR(0, 2577, __pyx_L1_error)\n  }\n  __pyx_v_self->_mfst.get()->SetProperties(__pyx_v_props, __pyx_v_mask);\n\n  /* \"pywrapfst.pyx\":2576\n *     return self\n * \n *   cdef void _set_properties(self, uint64 props, uint64 mask):             # <<<<<<<<<<<<<<\n *     self._mfst.get().SetProperties(props, mask)\n * \n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_WriteUnraisable(\"pywrapfst._MutableFst._set_properties\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n}\n\n/* \"pywrapfst.pyx\":2579\n *     self._mfst.get().SetProperties(props, mask)\n * \n *   def set_properties(self, uint64 props, uint64 mask):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     set_properties(self, props, mask)\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_57set_properties(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic char __pyx_doc_9pywrapfst_11_MutableFst_56set_properties[] = \"\\n    set_properties(self, props, mask)\\n\\n    Sets the properties bits.\\n\\n    Args:\\n      props: The properties to be set.\\n      mask: A mask to be applied to the `props` argument before setting the\\n          FST's properties.\\n\\n    Returns:\\n      self.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_57set_properties(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  __pyx_t_10basictypes_uint64 __pyx_v_props;\n  __pyx_t_10basictypes_uint64 __pyx_v_mask;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"set_properties (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_props,&__pyx_n_s_mask,0};\n    PyObject* values[2] = {0,0};\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (likely((values[0] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_props)) != 0)) kw_args--;\n        else goto __pyx_L5_argtuple_error;\n        CYTHON_FALLTHROUGH;\n        case  1:\n        if (likely((values[1] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_mask)) != 0)) kw_args--;\n        else {\n          __Pyx_RaiseArgtupleInvalid(\"set_properties\", 1, 2, 2, 1); __PYX_ERR(0, 2579, __pyx_L3_error)\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"set_properties\") < 0)) __PYX_ERR(0, 2579, __pyx_L3_error)\n      }\n    } else if (PyTuple_GET_SIZE(__pyx_args) != 2) {\n      goto __pyx_L5_argtuple_error;\n    } else {\n      values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n      values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n    }\n    __pyx_v_props = __Pyx_PyInt_As_uint64_t(values[0]); if (unlikely((__pyx_v_props == ((uint64_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 2579, __pyx_L3_error)\n    __pyx_v_mask = __Pyx_PyInt_As_uint64_t(values[1]); if (unlikely((__pyx_v_mask == ((uint64_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 2579, __pyx_L3_error)\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"set_properties\", 1, 2, 2, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 2579, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst.set_properties\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  __pyx_r = __pyx_pf_9pywrapfst_11_MutableFst_56set_properties(((struct __pyx_obj_9pywrapfst__MutableFst *)__pyx_v_self), __pyx_v_props, __pyx_v_mask);\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_56set_properties(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, __pyx_t_10basictypes_uint64 __pyx_v_props, __pyx_t_10basictypes_uint64 __pyx_v_mask) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"set_properties\", 0);\n\n  /* \"pywrapfst.pyx\":2593\n *       self.\n *     \"\"\"\n *     self._set_properties(props, mask)             # <<<<<<<<<<<<<<\n *     return self\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_set_properties\");\n    __PYX_ERR(0, 2593, __pyx_L1_error)\n  }\n  ((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->_set_properties(__pyx_v_self, __pyx_v_props, __pyx_v_mask);\n\n  /* \"pywrapfst.pyx\":2594\n *     \"\"\"\n *     self._set_properties(props, mask)\n *     return self             # <<<<<<<<<<<<<<\n * \n *   cdef void _set_start(self, int64 state) except *:\n */\n  __Pyx_XDECREF(__pyx_r);\n  __Pyx_INCREF(((PyObject *)__pyx_v_self));\n  __pyx_r = ((PyObject *)__pyx_v_self);\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":2579\n *     self._mfst.get().SetProperties(props, mask)\n * \n *   def set_properties(self, uint64 props, uint64 mask):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     set_properties(self, props, mask)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst.set_properties\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":2596\n *     return self\n * \n *   cdef void _set_start(self, int64 state) except *:             # <<<<<<<<<<<<<<\n *     if not self._mfst.get().SetStart(state):\n *       raise FstIndexError(\"State index out of range\")\n */\n\nstatic void __pyx_f_9pywrapfst_11_MutableFst__set_start(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, __pyx_t_10basictypes_int64 __pyx_v_state) {\n  __Pyx_RefNannyDeclarations\n  int __pyx_t_1;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  __Pyx_RefNannySetupContext(\"_set_start\", 0);\n\n  /* \"pywrapfst.pyx\":2597\n * \n *   cdef void _set_start(self, int64 state) except *:\n *     if not self._mfst.get().SetStart(state):             # <<<<<<<<<<<<<<\n *       raise FstIndexError(\"State index out of range\")\n *     self._check_mutating_imethod()\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_mfst\");\n    __PYX_ERR(0, 2597, __pyx_L1_error)\n  }\n  __pyx_t_1 = ((!(__pyx_v_self->_mfst.get()->SetStart(__pyx_v_state) != 0)) != 0);\n  if (__pyx_t_1) {\n\n    /* \"pywrapfst.pyx\":2598\n *   cdef void _set_start(self, int64 state) except *:\n *     if not self._mfst.get().SetStart(state):\n *       raise FstIndexError(\"State index out of range\")             # <<<<<<<<<<<<<<\n *     self._check_mutating_imethod()\n * \n */\n    __pyx_t_2 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstIndexError); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 2598, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_2);\n    __pyx_t_3 = __Pyx_PyObject_Call(__pyx_t_2, __pyx_tuple__52, NULL); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 2598, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_3);\n    __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n    __Pyx_Raise(__pyx_t_3, 0, 0, 0);\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    __PYX_ERR(0, 2598, __pyx_L1_error)\n\n    /* \"pywrapfst.pyx\":2597\n * \n *   cdef void _set_start(self, int64 state) except *:\n *     if not self._mfst.get().SetStart(state):             # <<<<<<<<<<<<<<\n *       raise FstIndexError(\"State index out of range\")\n *     self._check_mutating_imethod()\n */\n  }\n\n  /* \"pywrapfst.pyx\":2599\n *     if not self._mfst.get().SetStart(state):\n *       raise FstIndexError(\"State index out of range\")\n *     self._check_mutating_imethod()             # <<<<<<<<<<<<<<\n * \n *   def set_start(self, int64 state):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_check_mutating_imethod\");\n    __PYX_ERR(0, 2599, __pyx_L1_error)\n  }\n  ((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->_check_mutating_imethod(__pyx_v_self); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 2599, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":2596\n *     return self\n * \n *   cdef void _set_start(self, int64 state) except *:             # <<<<<<<<<<<<<<\n *     if not self._mfst.get().SetStart(state):\n *       raise FstIndexError(\"State index out of range\")\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst._set_start\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n}\n\n/* \"pywrapfst.pyx\":2601\n *     self._check_mutating_imethod()\n * \n *   def set_start(self, int64 state):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     set_start(self, state)\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_59set_start(PyObject *__pyx_v_self, PyObject *__pyx_arg_state); /*proto*/\nstatic char __pyx_doc_9pywrapfst_11_MutableFst_58set_start[] = \"\\n    set_start(self, state)\\n\\n    Sets a state to be the initial state state.\\n\\n    Args:\\n      state: The integer index of a state.\\n\\n    Returns:\\n      self.\\n\\n    Raises:\\n      FstIndexError: State index out of range.\\n\\n    See also: `set_final`.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_59set_start(PyObject *__pyx_v_self, PyObject *__pyx_arg_state) {\n  __pyx_t_10basictypes_int64 __pyx_v_state;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"set_start (wrapper)\", 0);\n  assert(__pyx_arg_state); {\n    __pyx_v_state = __Pyx_PyInt_As_int64_t(__pyx_arg_state); if (unlikely((__pyx_v_state == ((int64_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 2601, __pyx_L3_error)\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst.set_start\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  __pyx_r = __pyx_pf_9pywrapfst_11_MutableFst_58set_start(((struct __pyx_obj_9pywrapfst__MutableFst *)__pyx_v_self), ((__pyx_t_10basictypes_int64)__pyx_v_state));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_58set_start(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, __pyx_t_10basictypes_int64 __pyx_v_state) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"set_start\", 0);\n\n  /* \"pywrapfst.pyx\":2618\n *     See also: `set_final`.\n *     \"\"\"\n *     self._set_start(state)             # <<<<<<<<<<<<<<\n *     return self\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_set_start\");\n    __PYX_ERR(0, 2618, __pyx_L1_error)\n  }\n  ((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->_set_start(__pyx_v_self, __pyx_v_state); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 2618, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":2619\n *     \"\"\"\n *     self._set_start(state)\n *     return self             # <<<<<<<<<<<<<<\n * \n *   cdef void _topsort(self) except *:\n */\n  __Pyx_XDECREF(__pyx_r);\n  __Pyx_INCREF(((PyObject *)__pyx_v_self));\n  __pyx_r = ((PyObject *)__pyx_v_self);\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":2601\n *     self._check_mutating_imethod()\n * \n *   def set_start(self, int64 state):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     set_start(self, state)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst.set_start\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":2621\n *     return self\n * \n *   cdef void _topsort(self) except *:             # <<<<<<<<<<<<<<\n *     # TopSort returns False if the FST is cyclic, and thus can't be TopSorted.\n *     if not fst.TopSort(self._mfst.get()):\n */\n\nstatic void __pyx_f_9pywrapfst_11_MutableFst__topsort(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self) {\n  __Pyx_RefNannyDeclarations\n  int __pyx_t_1;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  __Pyx_RefNannySetupContext(\"_topsort\", 0);\n\n  /* \"pywrapfst.pyx\":2623\n *   cdef void _topsort(self) except *:\n *     # TopSort returns False if the FST is cyclic, and thus can't be TopSorted.\n *     if not fst.TopSort(self._mfst.get()):             # <<<<<<<<<<<<<<\n *       logging.warning(\"Cannot topsort cyclic FST.\")\n *     self._check_mutating_imethod()\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_mfst\");\n    __PYX_ERR(0, 2623, __pyx_L1_error)\n  }\n  __pyx_t_1 = ((!(fst::script::TopSort(__pyx_v_self->_mfst.get()) != 0)) != 0);\n  if (__pyx_t_1) {\n\n    /* \"pywrapfst.pyx\":2624\n *     # TopSort returns False if the FST is cyclic, and thus can't be TopSorted.\n *     if not fst.TopSort(self._mfst.get()):\n *       logging.warning(\"Cannot topsort cyclic FST.\")             # <<<<<<<<<<<<<<\n *     self._check_mutating_imethod()\n * \n */\n    __pyx_t_2 = __Pyx_GetModuleGlobalName(__pyx_n_s_logging); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 2624, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_2);\n    __pyx_t_3 = __Pyx_PyObject_GetAttrStr(__pyx_t_2, __pyx_n_s_warning); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 2624, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_3);\n    __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n    __pyx_t_2 = __Pyx_PyObject_Call(__pyx_t_3, __pyx_tuple__53, NULL); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 2624, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_2);\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n\n    /* \"pywrapfst.pyx\":2623\n *   cdef void _topsort(self) except *:\n *     # TopSort returns False if the FST is cyclic, and thus can't be TopSorted.\n *     if not fst.TopSort(self._mfst.get()):             # <<<<<<<<<<<<<<\n *       logging.warning(\"Cannot topsort cyclic FST.\")\n *     self._check_mutating_imethod()\n */\n  }\n\n  /* \"pywrapfst.pyx\":2625\n *     if not fst.TopSort(self._mfst.get()):\n *       logging.warning(\"Cannot topsort cyclic FST.\")\n *     self._check_mutating_imethod()             # <<<<<<<<<<<<<<\n * \n *   def topsort(self):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_check_mutating_imethod\");\n    __PYX_ERR(0, 2625, __pyx_L1_error)\n  }\n  ((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->_check_mutating_imethod(__pyx_v_self); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 2625, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":2621\n *     return self\n * \n *   cdef void _topsort(self) except *:             # <<<<<<<<<<<<<<\n *     # TopSort returns False if the FST is cyclic, and thus can't be TopSorted.\n *     if not fst.TopSort(self._mfst.get()):\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst._topsort\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n}\n\n/* \"pywrapfst.pyx\":2627\n *     self._check_mutating_imethod()\n * \n *   def topsort(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     topsort(self)\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_61topsort(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_11_MutableFst_60topsort[] = \"\\n    topsort(self)\\n\\n    Sorts transitions by state IDs.\\n\\n    This operation destructively topologically sorts the FST, if it is acyclic;\\n    otherwise it remains unchanged. Once sorted, all transitions are from lower\\n    state IDs to higher state IDs\\n\\n    Returns:\\n       self.\\n\\n    See also: `arcsort`.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_61topsort(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"topsort (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_11_MutableFst_60topsort(((struct __pyx_obj_9pywrapfst__MutableFst *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_60topsort(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"topsort\", 0);\n\n  /* \"pywrapfst.pyx\":2642\n *     See also: `arcsort`.\n *     \"\"\"\n *     self._topsort()             # <<<<<<<<<<<<<<\n *     return self\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_topsort\");\n    __PYX_ERR(0, 2642, __pyx_L1_error)\n  }\n  ((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->_topsort(__pyx_v_self); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 2642, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":2643\n *     \"\"\"\n *     self._topsort()\n *     return self             # <<<<<<<<<<<<<<\n * \n *   cdef void _union(self, _Fst ifst) except *:\n */\n  __Pyx_XDECREF(__pyx_r);\n  __Pyx_INCREF(((PyObject *)__pyx_v_self));\n  __pyx_r = ((PyObject *)__pyx_v_self);\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":2627\n *     self._check_mutating_imethod()\n * \n *   def topsort(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     topsort(self)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst.topsort\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":2645\n *     return self\n * \n *   cdef void _union(self, _Fst ifst) except *:             # <<<<<<<<<<<<<<\n *     fst.Union(self._mfst.get(), deref(ifst._fst))\n *     self._check_mutating_imethod()\n */\n\nstatic void __pyx_f_9pywrapfst_11_MutableFst__union(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst) {\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"_union\", 0);\n\n  /* \"pywrapfst.pyx\":2646\n * \n *   cdef void _union(self, _Fst ifst) except *:\n *     fst.Union(self._mfst.get(), deref(ifst._fst))             # <<<<<<<<<<<<<<\n *     self._check_mutating_imethod()\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_mfst\");\n    __PYX_ERR(0, 2646, __pyx_L1_error)\n  }\n  if (unlikely(((PyObject *)__pyx_v_ifst) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 2646, __pyx_L1_error)\n  }\n  fst::script::Union(__pyx_v_self->_mfst.get(), (*__pyx_v_ifst->_fst));\n\n  /* \"pywrapfst.pyx\":2647\n *   cdef void _union(self, _Fst ifst) except *:\n *     fst.Union(self._mfst.get(), deref(ifst._fst))\n *     self._check_mutating_imethod()             # <<<<<<<<<<<<<<\n * \n *   def union(self, _Fst ifst):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_check_mutating_imethod\");\n    __PYX_ERR(0, 2647, __pyx_L1_error)\n  }\n  ((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->_check_mutating_imethod(__pyx_v_self); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 2647, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":2645\n *     return self\n * \n *   cdef void _union(self, _Fst ifst) except *:             # <<<<<<<<<<<<<<\n *     fst.Union(self._mfst.get(), deref(ifst._fst))\n *     self._check_mutating_imethod()\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst._union\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n}\n\n/* \"pywrapfst.pyx\":2649\n *     self._check_mutating_imethod()\n * \n *   def union(self, _Fst ifst):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     union(self, ifst)\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_63union(PyObject *__pyx_v_self, PyObject *__pyx_v_ifst); /*proto*/\nstatic char __pyx_doc_9pywrapfst_11_MutableFst_62union[] = \"\\n    union(self, ifst)\\n\\n    Computes the union (sum) of two FSTs.\\n\\n    This operation computes the union (sum) of two FSTs. If A transduces string\\n    x to y with weight a and B transduces string w to v with weight b, then\\n    their union transduces x to y with weight a and w to v with weight b.\\n\\n    Args:\\n      ifst: The second input FST.\\n\\n    Returns:\\n      self.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_63union(PyObject *__pyx_v_self, PyObject *__pyx_v_ifst) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"union (wrapper)\", 0);\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_ifst), __pyx_ptype_9pywrapfst__Fst, 1, \"ifst\", 0))) __PYX_ERR(0, 2649, __pyx_L1_error)\n  __pyx_r = __pyx_pf_9pywrapfst_11_MutableFst_62union(((struct __pyx_obj_9pywrapfst__MutableFst *)__pyx_v_self), ((struct __pyx_obj_9pywrapfst__Fst *)__pyx_v_ifst));\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_62union(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"union\", 0);\n\n  /* \"pywrapfst.pyx\":2665\n *       self.\n *     \"\"\"\n *     self._union(ifst)             # <<<<<<<<<<<<<<\n *     return self\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_union\");\n    __PYX_ERR(0, 2665, __pyx_L1_error)\n  }\n  ((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->_union(__pyx_v_self, __pyx_v_ifst); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 2665, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":2666\n *     \"\"\"\n *     self._union(ifst)\n *     return self             # <<<<<<<<<<<<<<\n * \n * \n */\n  __Pyx_XDECREF(__pyx_r);\n  __Pyx_INCREF(((PyObject *)__pyx_v_self));\n  __pyx_r = ((PyObject *)__pyx_v_self);\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":2649\n *     self._check_mutating_imethod()\n * \n *   def union(self, _Fst ifst):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     union(self, ifst)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst.union\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":2691\n * \n * \n * cdef _Fst _init_Fst(FstClass_ptr tfst):             # <<<<<<<<<<<<<<\n *   if tfst.Properties(fst.kError, True):\n *     raise FstOpError(\"Operation failed\")\n */\n\nstatic struct __pyx_obj_9pywrapfst__Fst *__pyx_f_9pywrapfst__init_Fst(__pyx_t_9pywrapfst_FstClass_ptr __pyx_v_tfst) {\n  struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ofst = 0;\n  struct __pyx_obj_9pywrapfst__Fst *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  int __pyx_t_1;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  __Pyx_RefNannySetupContext(\"_init_Fst\", 0);\n\n  /* \"pywrapfst.pyx\":2692\n * \n * cdef _Fst _init_Fst(FstClass_ptr tfst):\n *   if tfst.Properties(fst.kError, True):             # <<<<<<<<<<<<<<\n *     raise FstOpError(\"Operation failed\")\n *   cdef _Fst ofst = _Fst.__new__(_Fst)\n */\n  __pyx_t_1 = (__pyx_v_tfst->Properties(fst::kError, 1) != 0);\n  if (__pyx_t_1) {\n\n    /* \"pywrapfst.pyx\":2693\n * cdef _Fst _init_Fst(FstClass_ptr tfst):\n *   if tfst.Properties(fst.kError, True):\n *     raise FstOpError(\"Operation failed\")             # <<<<<<<<<<<<<<\n *   cdef _Fst ofst = _Fst.__new__(_Fst)\n *   ofst._fst.reset(tfst)\n */\n    __pyx_t_2 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstOpError); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 2693, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_2);\n    __pyx_t_3 = __Pyx_PyObject_Call(__pyx_t_2, __pyx_tuple__54, NULL); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 2693, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_3);\n    __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n    __Pyx_Raise(__pyx_t_3, 0, 0, 0);\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    __PYX_ERR(0, 2693, __pyx_L1_error)\n\n    /* \"pywrapfst.pyx\":2692\n * \n * cdef _Fst _init_Fst(FstClass_ptr tfst):\n *   if tfst.Properties(fst.kError, True):             # <<<<<<<<<<<<<<\n *     raise FstOpError(\"Operation failed\")\n *   cdef _Fst ofst = _Fst.__new__(_Fst)\n */\n  }\n\n  /* \"pywrapfst.pyx\":2694\n *   if tfst.Properties(fst.kError, True):\n *     raise FstOpError(\"Operation failed\")\n *   cdef _Fst ofst = _Fst.__new__(_Fst)             # <<<<<<<<<<<<<<\n *   ofst._fst.reset(tfst)\n *   return ofst\n */\n  __pyx_t_3 = __pyx_tp_new_9pywrapfst__Fst(((PyTypeObject *)__pyx_ptype_9pywrapfst__Fst), __pyx_empty_tuple, NULL); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 2694, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_3);\n  if (!(likely(__Pyx_TypeTest(__pyx_t_3, __pyx_ptype_9pywrapfst__Fst)))) __PYX_ERR(0, 2694, __pyx_L1_error)\n  __pyx_v_ofst = ((struct __pyx_obj_9pywrapfst__Fst *)__pyx_t_3);\n  __pyx_t_3 = 0;\n\n  /* \"pywrapfst.pyx\":2695\n *     raise FstOpError(\"Operation failed\")\n *   cdef _Fst ofst = _Fst.__new__(_Fst)\n *   ofst._fst.reset(tfst)             # <<<<<<<<<<<<<<\n *   return ofst\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_ofst) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 2695, __pyx_L1_error)\n  }\n  __pyx_v_ofst->_fst.reset(__pyx_v_tfst);\n\n  /* \"pywrapfst.pyx\":2696\n *   cdef _Fst ofst = _Fst.__new__(_Fst)\n *   ofst._fst.reset(tfst)\n *   return ofst             # <<<<<<<<<<<<<<\n * \n * \n */\n  __Pyx_XDECREF(((PyObject *)__pyx_r));\n  __Pyx_INCREF(((PyObject *)__pyx_v_ofst));\n  __pyx_r = __pyx_v_ofst;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":2691\n * \n * \n * cdef _Fst _init_Fst(FstClass_ptr tfst):             # <<<<<<<<<<<<<<\n *   if tfst.Properties(fst.kError, True):\n *     raise FstOpError(\"Operation failed\")\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_AddTraceback(\"pywrapfst._init_Fst\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XDECREF((PyObject *)__pyx_v_ofst);\n  __Pyx_XGIVEREF((PyObject *)__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":2699\n * \n * \n * cdef _MutableFst _init_MutableFst(MutableFstClass_ptr tfst):             # <<<<<<<<<<<<<<\n *   if tfst.Properties(fst.kError, True):\n *     raise FstOpError(\"Operation failed\")\n */\n\nstatic struct __pyx_obj_9pywrapfst__MutableFst *__pyx_f_9pywrapfst__init_MutableFst(__pyx_t_9pywrapfst_MutableFstClass_ptr __pyx_v_tfst) {\n  struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_ofst = 0;\n  struct __pyx_obj_9pywrapfst__MutableFst *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  int __pyx_t_1;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  __Pyx_RefNannySetupContext(\"_init_MutableFst\", 0);\n\n  /* \"pywrapfst.pyx\":2700\n * \n * cdef _MutableFst _init_MutableFst(MutableFstClass_ptr tfst):\n *   if tfst.Properties(fst.kError, True):             # <<<<<<<<<<<<<<\n *     raise FstOpError(\"Operation failed\")\n *   cdef _MutableFst ofst = _MutableFst.__new__(_MutableFst)\n */\n  __pyx_t_1 = (__pyx_v_tfst->Properties(fst::kError, 1) != 0);\n  if (__pyx_t_1) {\n\n    /* \"pywrapfst.pyx\":2701\n * cdef _MutableFst _init_MutableFst(MutableFstClass_ptr tfst):\n *   if tfst.Properties(fst.kError, True):\n *     raise FstOpError(\"Operation failed\")             # <<<<<<<<<<<<<<\n *   cdef _MutableFst ofst = _MutableFst.__new__(_MutableFst)\n *   ofst._fst.reset(tfst)\n */\n    __pyx_t_2 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstOpError); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 2701, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_2);\n    __pyx_t_3 = __Pyx_PyObject_Call(__pyx_t_2, __pyx_tuple__55, NULL); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 2701, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_3);\n    __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n    __Pyx_Raise(__pyx_t_3, 0, 0, 0);\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    __PYX_ERR(0, 2701, __pyx_L1_error)\n\n    /* \"pywrapfst.pyx\":2700\n * \n * cdef _MutableFst _init_MutableFst(MutableFstClass_ptr tfst):\n *   if tfst.Properties(fst.kError, True):             # <<<<<<<<<<<<<<\n *     raise FstOpError(\"Operation failed\")\n *   cdef _MutableFst ofst = _MutableFst.__new__(_MutableFst)\n */\n  }\n\n  /* \"pywrapfst.pyx\":2702\n *   if tfst.Properties(fst.kError, True):\n *     raise FstOpError(\"Operation failed\")\n *   cdef _MutableFst ofst = _MutableFst.__new__(_MutableFst)             # <<<<<<<<<<<<<<\n *   ofst._fst.reset(tfst)\n *   # Makes a copy of it as the derived type! Cool.\n */\n  __pyx_t_3 = __pyx_tp_new_9pywrapfst__MutableFst(((PyTypeObject *)__pyx_ptype_9pywrapfst__MutableFst), __pyx_empty_tuple, NULL); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 2702, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_3);\n  if (!(likely(__Pyx_TypeTest(__pyx_t_3, __pyx_ptype_9pywrapfst__MutableFst)))) __PYX_ERR(0, 2702, __pyx_L1_error)\n  __pyx_v_ofst = ((struct __pyx_obj_9pywrapfst__MutableFst *)__pyx_t_3);\n  __pyx_t_3 = 0;\n\n  /* \"pywrapfst.pyx\":2703\n *     raise FstOpError(\"Operation failed\")\n *   cdef _MutableFst ofst = _MutableFst.__new__(_MutableFst)\n *   ofst._fst.reset(tfst)             # <<<<<<<<<<<<<<\n *   # Makes a copy of it as the derived type! Cool.\n *   ofst._mfst = static_pointer_cast[fst.MutableFstClass, fst.FstClass](ofst._fst)\n */\n  if (unlikely(((PyObject *)__pyx_v_ofst) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 2703, __pyx_L1_error)\n  }\n  __pyx_v_ofst->__pyx_base._fst.reset(__pyx_v_tfst);\n\n  /* \"pywrapfst.pyx\":2705\n *   ofst._fst.reset(tfst)\n *   # Makes a copy of it as the derived type! Cool.\n *   ofst._mfst = static_pointer_cast[fst.MutableFstClass, fst.FstClass](ofst._fst)             # <<<<<<<<<<<<<<\n *   return ofst\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_ofst) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 2705, __pyx_L1_error)\n  }\n  if (unlikely(((PyObject *)__pyx_v_ofst) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_mfst\");\n    __PYX_ERR(0, 2705, __pyx_L1_error)\n  }\n  __pyx_v_ofst->_mfst = std::static_pointer_cast<fst::script::MutableFstClass,fst::script::FstClass>(__pyx_v_ofst->__pyx_base._fst);\n\n  /* \"pywrapfst.pyx\":2706\n *   # Makes a copy of it as the derived type! Cool.\n *   ofst._mfst = static_pointer_cast[fst.MutableFstClass, fst.FstClass](ofst._fst)\n *   return ofst             # <<<<<<<<<<<<<<\n * \n * \n */\n  __Pyx_XDECREF(((PyObject *)__pyx_r));\n  __Pyx_INCREF(((PyObject *)__pyx_v_ofst));\n  __pyx_r = __pyx_v_ofst;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":2699\n * \n * \n * cdef _MutableFst _init_MutableFst(MutableFstClass_ptr tfst):             # <<<<<<<<<<<<<<\n *   if tfst.Properties(fst.kError, True):\n *     raise FstOpError(\"Operation failed\")\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_AddTraceback(\"pywrapfst._init_MutableFst\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XDECREF((PyObject *)__pyx_v_ofst);\n  __Pyx_XGIVEREF((PyObject *)__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":2709\n * \n * \n * cdef _Fst _init_XFst(FstClass_ptr tfst):             # <<<<<<<<<<<<<<\n *   if tfst.Properties(fst.kMutable, True):\n *     return _init_MutableFst(static_cast[MutableFstClass_ptr](tfst))\n */\n\nstatic struct __pyx_obj_9pywrapfst__Fst *__pyx_f_9pywrapfst__init_XFst(__pyx_t_9pywrapfst_FstClass_ptr __pyx_v_tfst) {\n  struct __pyx_obj_9pywrapfst__Fst *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  int __pyx_t_1;\n  PyObject *__pyx_t_2 = NULL;\n  __Pyx_RefNannySetupContext(\"_init_XFst\", 0);\n\n  /* \"pywrapfst.pyx\":2710\n * \n * cdef _Fst _init_XFst(FstClass_ptr tfst):\n *   if tfst.Properties(fst.kMutable, True):             # <<<<<<<<<<<<<<\n *     return _init_MutableFst(static_cast[MutableFstClass_ptr](tfst))\n *   else:\n */\n  __pyx_t_1 = (__pyx_v_tfst->Properties(fst::kMutable, 1) != 0);\n  if (__pyx_t_1) {\n\n    /* \"pywrapfst.pyx\":2711\n * cdef _Fst _init_XFst(FstClass_ptr tfst):\n *   if tfst.Properties(fst.kMutable, True):\n *     return _init_MutableFst(static_cast[MutableFstClass_ptr](tfst))             # <<<<<<<<<<<<<<\n *   else:\n *     return _init_Fst(tfst)\n */\n    __Pyx_XDECREF(((PyObject *)__pyx_r));\n    __pyx_t_2 = ((PyObject *)__pyx_f_9pywrapfst__init_MutableFst(static_cast<__pyx_t_9pywrapfst_MutableFstClass_ptr>(__pyx_v_tfst))); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 2711, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_2);\n    __pyx_r = ((struct __pyx_obj_9pywrapfst__Fst *)__pyx_t_2);\n    __pyx_t_2 = 0;\n    goto __pyx_L0;\n\n    /* \"pywrapfst.pyx\":2710\n * \n * cdef _Fst _init_XFst(FstClass_ptr tfst):\n *   if tfst.Properties(fst.kMutable, True):             # <<<<<<<<<<<<<<\n *     return _init_MutableFst(static_cast[MutableFstClass_ptr](tfst))\n *   else:\n */\n  }\n\n  /* \"pywrapfst.pyx\":2713\n *     return _init_MutableFst(static_cast[MutableFstClass_ptr](tfst))\n *   else:\n *     return _init_Fst(tfst)             # <<<<<<<<<<<<<<\n * \n * \n */\n  /*else*/ {\n    __Pyx_XDECREF(((PyObject *)__pyx_r));\n    __pyx_t_2 = ((PyObject *)__pyx_f_9pywrapfst__init_Fst(__pyx_v_tfst)); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 2713, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_2);\n    __pyx_r = ((struct __pyx_obj_9pywrapfst__Fst *)__pyx_t_2);\n    __pyx_t_2 = 0;\n    goto __pyx_L0;\n  }\n\n  /* \"pywrapfst.pyx\":2709\n * \n * \n * cdef _Fst _init_XFst(FstClass_ptr tfst):             # <<<<<<<<<<<<<<\n *   if tfst.Properties(fst.kMutable, True):\n *     return _init_MutableFst(static_cast[MutableFstClass_ptr](tfst))\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_AddTraceback(\"pywrapfst._init_XFst\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XGIVEREF((PyObject *)__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":2716\n * \n * \n * cdef _MutableFst _create_Fst(arc_type=b\"standard\"):             # <<<<<<<<<<<<<<\n *   cdef unique_ptr[fst.VectorFstClass] tfst\n *   tfst.reset(new fst.VectorFstClass(tostring(arc_type)))\n */\n\nstatic struct __pyx_obj_9pywrapfst__MutableFst *__pyx_f_9pywrapfst__create_Fst(struct __pyx_opt_args_9pywrapfst__create_Fst *__pyx_optional_args) {\n  PyObject *__pyx_v_arc_type = ((PyObject *)__pyx_n_b_standard);\n  std::unique_ptr<fst::script::VectorFstClass>  __pyx_v_tfst;\n  struct __pyx_obj_9pywrapfst__MutableFst *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  std::string __pyx_t_1;\n  int __pyx_t_2;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  PyObject *__pyx_t_6 = NULL;\n  PyObject *__pyx_t_7 = NULL;\n  PyObject *__pyx_t_8 = NULL;\n  __Pyx_RefNannySetupContext(\"_create_Fst\", 0);\n  if (__pyx_optional_args) {\n    if (__pyx_optional_args->__pyx_n > 0) {\n      __pyx_v_arc_type = __pyx_optional_args->arc_type;\n    }\n  }\n\n  /* \"pywrapfst.pyx\":2718\n * cdef _MutableFst _create_Fst(arc_type=b\"standard\"):\n *   cdef unique_ptr[fst.VectorFstClass] tfst\n *   tfst.reset(new fst.VectorFstClass(tostring(arc_type)))             # <<<<<<<<<<<<<<\n *   if tfst.get() == NULL:\n *     raise FstOpError(\"Unknown arc type: {!r}\".format(arc_type))\n */\n  __pyx_t_1 = __pyx_f_9pywrapfst_tostring(__pyx_v_arc_type, NULL); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 2718, __pyx_L1_error)\n  __pyx_v_tfst.reset(new fst::script::VectorFstClass(__pyx_t_1));\n\n  /* \"pywrapfst.pyx\":2719\n *   cdef unique_ptr[fst.VectorFstClass] tfst\n *   tfst.reset(new fst.VectorFstClass(tostring(arc_type)))\n *   if tfst.get() == NULL:             # <<<<<<<<<<<<<<\n *     raise FstOpError(\"Unknown arc type: {!r}\".format(arc_type))\n *   return _init_MutableFst(tfst.release())\n */\n  __pyx_t_2 = ((__pyx_v_tfst.get() == NULL) != 0);\n  if (__pyx_t_2) {\n\n    /* \"pywrapfst.pyx\":2720\n *   tfst.reset(new fst.VectorFstClass(tostring(arc_type)))\n *   if tfst.get() == NULL:\n *     raise FstOpError(\"Unknown arc type: {!r}\".format(arc_type))             # <<<<<<<<<<<<<<\n *   return _init_MutableFst(tfst.release())\n * \n */\n    __pyx_t_4 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstOpError); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 2720, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_4);\n    __pyx_t_6 = __Pyx_PyObject_GetAttrStr(__pyx_kp_s_Unknown_arc_type_r, __pyx_n_s_format); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 2720, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_6);\n    __pyx_t_7 = NULL;\n    if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_6))) {\n      __pyx_t_7 = PyMethod_GET_SELF(__pyx_t_6);\n      if (likely(__pyx_t_7)) {\n        PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_6);\n        __Pyx_INCREF(__pyx_t_7);\n        __Pyx_INCREF(function);\n        __Pyx_DECREF_SET(__pyx_t_6, function);\n      }\n    }\n    if (!__pyx_t_7) {\n      __pyx_t_5 = __Pyx_PyObject_CallOneArg(__pyx_t_6, __pyx_v_arc_type); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 2720, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_5);\n    } else {\n      #if CYTHON_FAST_PYCALL\n      if (PyFunction_Check(__pyx_t_6)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_7, __pyx_v_arc_type};\n        __pyx_t_5 = __Pyx_PyFunction_FastCall(__pyx_t_6, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 2720, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_7); __pyx_t_7 = 0;\n        __Pyx_GOTREF(__pyx_t_5);\n      } else\n      #endif\n      #if CYTHON_FAST_PYCCALL\n      if (__Pyx_PyFastCFunction_Check(__pyx_t_6)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_7, __pyx_v_arc_type};\n        __pyx_t_5 = __Pyx_PyCFunction_FastCall(__pyx_t_6, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 2720, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_7); __pyx_t_7 = 0;\n        __Pyx_GOTREF(__pyx_t_5);\n      } else\n      #endif\n      {\n        __pyx_t_8 = PyTuple_New(1+1); if (unlikely(!__pyx_t_8)) __PYX_ERR(0, 2720, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_8);\n        __Pyx_GIVEREF(__pyx_t_7); PyTuple_SET_ITEM(__pyx_t_8, 0, __pyx_t_7); __pyx_t_7 = NULL;\n        __Pyx_INCREF(__pyx_v_arc_type);\n        __Pyx_GIVEREF(__pyx_v_arc_type);\n        PyTuple_SET_ITEM(__pyx_t_8, 0+1, __pyx_v_arc_type);\n        __pyx_t_5 = __Pyx_PyObject_Call(__pyx_t_6, __pyx_t_8, NULL); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 2720, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_5);\n        __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0;\n      }\n    }\n    __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n    __pyx_t_6 = NULL;\n    if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_4))) {\n      __pyx_t_6 = PyMethod_GET_SELF(__pyx_t_4);\n      if (likely(__pyx_t_6)) {\n        PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_4);\n        __Pyx_INCREF(__pyx_t_6);\n        __Pyx_INCREF(function);\n        __Pyx_DECREF_SET(__pyx_t_4, function);\n      }\n    }\n    if (!__pyx_t_6) {\n      __pyx_t_3 = __Pyx_PyObject_CallOneArg(__pyx_t_4, __pyx_t_5); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 2720, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n      __Pyx_GOTREF(__pyx_t_3);\n    } else {\n      #if CYTHON_FAST_PYCALL\n      if (PyFunction_Check(__pyx_t_4)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_6, __pyx_t_5};\n        __pyx_t_3 = __Pyx_PyFunction_FastCall(__pyx_t_4, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 2720, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_6); __pyx_t_6 = 0;\n        __Pyx_GOTREF(__pyx_t_3);\n        __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n      } else\n      #endif\n      #if CYTHON_FAST_PYCCALL\n      if (__Pyx_PyFastCFunction_Check(__pyx_t_4)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_6, __pyx_t_5};\n        __pyx_t_3 = __Pyx_PyCFunction_FastCall(__pyx_t_4, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 2720, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_6); __pyx_t_6 = 0;\n        __Pyx_GOTREF(__pyx_t_3);\n        __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n      } else\n      #endif\n      {\n        __pyx_t_8 = PyTuple_New(1+1); if (unlikely(!__pyx_t_8)) __PYX_ERR(0, 2720, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_8);\n        __Pyx_GIVEREF(__pyx_t_6); PyTuple_SET_ITEM(__pyx_t_8, 0, __pyx_t_6); __pyx_t_6 = NULL;\n        __Pyx_GIVEREF(__pyx_t_5);\n        PyTuple_SET_ITEM(__pyx_t_8, 0+1, __pyx_t_5);\n        __pyx_t_5 = 0;\n        __pyx_t_3 = __Pyx_PyObject_Call(__pyx_t_4, __pyx_t_8, NULL); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 2720, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_3);\n        __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0;\n      }\n    }\n    __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n    __Pyx_Raise(__pyx_t_3, 0, 0, 0);\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    __PYX_ERR(0, 2720, __pyx_L1_error)\n\n    /* \"pywrapfst.pyx\":2719\n *   cdef unique_ptr[fst.VectorFstClass] tfst\n *   tfst.reset(new fst.VectorFstClass(tostring(arc_type)))\n *   if tfst.get() == NULL:             # <<<<<<<<<<<<<<\n *     raise FstOpError(\"Unknown arc type: {!r}\".format(arc_type))\n *   return _init_MutableFst(tfst.release())\n */\n  }\n\n  /* \"pywrapfst.pyx\":2721\n *   if tfst.get() == NULL:\n *     raise FstOpError(\"Unknown arc type: {!r}\".format(arc_type))\n *   return _init_MutableFst(tfst.release())             # <<<<<<<<<<<<<<\n * \n * \n */\n  __Pyx_XDECREF(((PyObject *)__pyx_r));\n  __pyx_t_3 = ((PyObject *)__pyx_f_9pywrapfst__init_MutableFst(__pyx_v_tfst.release())); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 2721, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_3);\n  __pyx_r = ((struct __pyx_obj_9pywrapfst__MutableFst *)__pyx_t_3);\n  __pyx_t_3 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":2716\n * \n * \n * cdef _MutableFst _create_Fst(arc_type=b\"standard\"):             # <<<<<<<<<<<<<<\n *   cdef unique_ptr[fst.VectorFstClass] tfst\n *   tfst.reset(new fst.VectorFstClass(tostring(arc_type)))\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_XDECREF(__pyx_t_6);\n  __Pyx_XDECREF(__pyx_t_7);\n  __Pyx_XDECREF(__pyx_t_8);\n  __Pyx_AddTraceback(\"pywrapfst._create_Fst\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XGIVEREF((PyObject *)__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":2724\n * \n * \n * cpdef _Fst _read(filename):             # <<<<<<<<<<<<<<\n *   cdef unique_ptr[fst.FstClass] tfst\n *   tfst.reset(fst.FstClass.Read(tostring(filename)))\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_13_read(PyObject *__pyx_self, PyObject *__pyx_v_filename); /*proto*/\nstatic struct __pyx_obj_9pywrapfst__Fst *__pyx_f_9pywrapfst__read(PyObject *__pyx_v_filename, CYTHON_UNUSED int __pyx_skip_dispatch) {\n  std::unique_ptr<fst::script::FstClass>  __pyx_v_tfst;\n  struct __pyx_obj_9pywrapfst__Fst *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  std::string __pyx_t_1;\n  int __pyx_t_2;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  PyObject *__pyx_t_6 = NULL;\n  PyObject *__pyx_t_7 = NULL;\n  PyObject *__pyx_t_8 = NULL;\n  __Pyx_RefNannySetupContext(\"_read\", 0);\n\n  /* \"pywrapfst.pyx\":2726\n * cpdef _Fst _read(filename):\n *   cdef unique_ptr[fst.FstClass] tfst\n *   tfst.reset(fst.FstClass.Read(tostring(filename)))             # <<<<<<<<<<<<<<\n *   if tfst.get() == NULL:\n *     raise FstIOError(\"Read failed: {!r}\".format(filename))\n */\n  __pyx_t_1 = __pyx_f_9pywrapfst_tostring(__pyx_v_filename, NULL); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 2726, __pyx_L1_error)\n  __pyx_v_tfst.reset(fst::script::FstClass::Read(__pyx_t_1));\n\n  /* \"pywrapfst.pyx\":2727\n *   cdef unique_ptr[fst.FstClass] tfst\n *   tfst.reset(fst.FstClass.Read(tostring(filename)))\n *   if tfst.get() == NULL:             # <<<<<<<<<<<<<<\n *     raise FstIOError(\"Read failed: {!r}\".format(filename))\n *   return _init_XFst(tfst.release())\n */\n  __pyx_t_2 = ((__pyx_v_tfst.get() == NULL) != 0);\n  if (__pyx_t_2) {\n\n    /* \"pywrapfst.pyx\":2728\n *   tfst.reset(fst.FstClass.Read(tostring(filename)))\n *   if tfst.get() == NULL:\n *     raise FstIOError(\"Read failed: {!r}\".format(filename))             # <<<<<<<<<<<<<<\n *   return _init_XFst(tfst.release())\n * \n */\n    __pyx_t_4 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstIOError); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 2728, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_4);\n    __pyx_t_6 = __Pyx_PyObject_GetAttrStr(__pyx_kp_s_Read_failed_r, __pyx_n_s_format); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 2728, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_6);\n    __pyx_t_7 = NULL;\n    if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_6))) {\n      __pyx_t_7 = PyMethod_GET_SELF(__pyx_t_6);\n      if (likely(__pyx_t_7)) {\n        PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_6);\n        __Pyx_INCREF(__pyx_t_7);\n        __Pyx_INCREF(function);\n        __Pyx_DECREF_SET(__pyx_t_6, function);\n      }\n    }\n    if (!__pyx_t_7) {\n      __pyx_t_5 = __Pyx_PyObject_CallOneArg(__pyx_t_6, __pyx_v_filename); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 2728, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_5);\n    } else {\n      #if CYTHON_FAST_PYCALL\n      if (PyFunction_Check(__pyx_t_6)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_7, __pyx_v_filename};\n        __pyx_t_5 = __Pyx_PyFunction_FastCall(__pyx_t_6, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 2728, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_7); __pyx_t_7 = 0;\n        __Pyx_GOTREF(__pyx_t_5);\n      } else\n      #endif\n      #if CYTHON_FAST_PYCCALL\n      if (__Pyx_PyFastCFunction_Check(__pyx_t_6)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_7, __pyx_v_filename};\n        __pyx_t_5 = __Pyx_PyCFunction_FastCall(__pyx_t_6, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 2728, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_7); __pyx_t_7 = 0;\n        __Pyx_GOTREF(__pyx_t_5);\n      } else\n      #endif\n      {\n        __pyx_t_8 = PyTuple_New(1+1); if (unlikely(!__pyx_t_8)) __PYX_ERR(0, 2728, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_8);\n        __Pyx_GIVEREF(__pyx_t_7); PyTuple_SET_ITEM(__pyx_t_8, 0, __pyx_t_7); __pyx_t_7 = NULL;\n        __Pyx_INCREF(__pyx_v_filename);\n        __Pyx_GIVEREF(__pyx_v_filename);\n        PyTuple_SET_ITEM(__pyx_t_8, 0+1, __pyx_v_filename);\n        __pyx_t_5 = __Pyx_PyObject_Call(__pyx_t_6, __pyx_t_8, NULL); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 2728, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_5);\n        __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0;\n      }\n    }\n    __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n    __pyx_t_6 = NULL;\n    if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_4))) {\n      __pyx_t_6 = PyMethod_GET_SELF(__pyx_t_4);\n      if (likely(__pyx_t_6)) {\n        PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_4);\n        __Pyx_INCREF(__pyx_t_6);\n        __Pyx_INCREF(function);\n        __Pyx_DECREF_SET(__pyx_t_4, function);\n      }\n    }\n    if (!__pyx_t_6) {\n      __pyx_t_3 = __Pyx_PyObject_CallOneArg(__pyx_t_4, __pyx_t_5); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 2728, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n      __Pyx_GOTREF(__pyx_t_3);\n    } else {\n      #if CYTHON_FAST_PYCALL\n      if (PyFunction_Check(__pyx_t_4)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_6, __pyx_t_5};\n        __pyx_t_3 = __Pyx_PyFunction_FastCall(__pyx_t_4, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 2728, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_6); __pyx_t_6 = 0;\n        __Pyx_GOTREF(__pyx_t_3);\n        __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n      } else\n      #endif\n      #if CYTHON_FAST_PYCCALL\n      if (__Pyx_PyFastCFunction_Check(__pyx_t_4)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_6, __pyx_t_5};\n        __pyx_t_3 = __Pyx_PyCFunction_FastCall(__pyx_t_4, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 2728, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_6); __pyx_t_6 = 0;\n        __Pyx_GOTREF(__pyx_t_3);\n        __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n      } else\n      #endif\n      {\n        __pyx_t_8 = PyTuple_New(1+1); if (unlikely(!__pyx_t_8)) __PYX_ERR(0, 2728, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_8);\n        __Pyx_GIVEREF(__pyx_t_6); PyTuple_SET_ITEM(__pyx_t_8, 0, __pyx_t_6); __pyx_t_6 = NULL;\n        __Pyx_GIVEREF(__pyx_t_5);\n        PyTuple_SET_ITEM(__pyx_t_8, 0+1, __pyx_t_5);\n        __pyx_t_5 = 0;\n        __pyx_t_3 = __Pyx_PyObject_Call(__pyx_t_4, __pyx_t_8, NULL); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 2728, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_3);\n        __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0;\n      }\n    }\n    __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n    __Pyx_Raise(__pyx_t_3, 0, 0, 0);\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    __PYX_ERR(0, 2728, __pyx_L1_error)\n\n    /* \"pywrapfst.pyx\":2727\n *   cdef unique_ptr[fst.FstClass] tfst\n *   tfst.reset(fst.FstClass.Read(tostring(filename)))\n *   if tfst.get() == NULL:             # <<<<<<<<<<<<<<\n *     raise FstIOError(\"Read failed: {!r}\".format(filename))\n *   return _init_XFst(tfst.release())\n */\n  }\n\n  /* \"pywrapfst.pyx\":2729\n *   if tfst.get() == NULL:\n *     raise FstIOError(\"Read failed: {!r}\".format(filename))\n *   return _init_XFst(tfst.release())             # <<<<<<<<<<<<<<\n * \n * \n */\n  __Pyx_XDECREF(((PyObject *)__pyx_r));\n  __pyx_t_3 = ((PyObject *)__pyx_f_9pywrapfst__init_XFst(__pyx_v_tfst.release())); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 2729, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_3);\n  __pyx_r = ((struct __pyx_obj_9pywrapfst__Fst *)__pyx_t_3);\n  __pyx_t_3 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":2724\n * \n * \n * cpdef _Fst _read(filename):             # <<<<<<<<<<<<<<\n *   cdef unique_ptr[fst.FstClass] tfst\n *   tfst.reset(fst.FstClass.Read(tostring(filename)))\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_XDECREF(__pyx_t_6);\n  __Pyx_XDECREF(__pyx_t_7);\n  __Pyx_XDECREF(__pyx_t_8);\n  __Pyx_AddTraceback(\"pywrapfst._read\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XGIVEREF((PyObject *)__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_13_read(PyObject *__pyx_self, PyObject *__pyx_v_filename); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_13_read(PyObject *__pyx_self, PyObject *__pyx_v_filename) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"_read (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_12_read(__pyx_self, ((PyObject *)__pyx_v_filename));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_12_read(CYTHON_UNUSED PyObject *__pyx_self, PyObject *__pyx_v_filename) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"_read\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst__read(__pyx_v_filename, 0)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2724, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst._read\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":2732\n * \n * \n * cpdef _Fst _read_from_string(state):             # <<<<<<<<<<<<<<\n *   cdef stringstream sstrm\n *   sstrm << tostring(state)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_15_read_from_string(PyObject *__pyx_self, PyObject *__pyx_v_state); /*proto*/\nstatic struct __pyx_obj_9pywrapfst__Fst *__pyx_f_9pywrapfst__read_from_string(PyObject *__pyx_v_state, CYTHON_UNUSED int __pyx_skip_dispatch) {\n  std::stringstream __pyx_v_sstrm;\n  std::unique_ptr<fst::script::FstClass>  __pyx_v_tfst;\n  struct __pyx_obj_9pywrapfst__Fst *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  std::string __pyx_t_1;\n  int __pyx_t_2;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  __Pyx_RefNannySetupContext(\"_read_from_string\", 0);\n\n  /* \"pywrapfst.pyx\":2734\n * cpdef _Fst _read_from_string(state):\n *   cdef stringstream sstrm\n *   sstrm << tostring(state)             # <<<<<<<<<<<<<<\n *   cdef unique_ptr[fst.FstClass] tfst\n *   tfst.reset(fst.FstClass.ReadFromStream(sstrm, b\"<pywrapfst>\"))\n */\n  __pyx_t_1 = __pyx_f_9pywrapfst_tostring(__pyx_v_state, NULL); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 2734, __pyx_L1_error)\n  (__pyx_v_sstrm << __pyx_t_1);\n\n  /* \"pywrapfst.pyx\":2736\n *   sstrm << tostring(state)\n *   cdef unique_ptr[fst.FstClass] tfst\n *   tfst.reset(fst.FstClass.ReadFromStream(sstrm, b\"<pywrapfst>\"))             # <<<<<<<<<<<<<<\n *   if tfst.get() == NULL:\n *     raise FstIOError(\"Read failed: <string>\")\n */\n  __pyx_t_1 = __pyx_convert_string_from_py_std__in_string(__pyx_kp_b_pywrapfst); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 2736, __pyx_L1_error)\n  __pyx_v_tfst.reset(fst::script::FstClass::Read(__pyx_v_sstrm, __pyx_t_1));\n\n  /* \"pywrapfst.pyx\":2737\n *   cdef unique_ptr[fst.FstClass] tfst\n *   tfst.reset(fst.FstClass.ReadFromStream(sstrm, b\"<pywrapfst>\"))\n *   if tfst.get() == NULL:             # <<<<<<<<<<<<<<\n *     raise FstIOError(\"Read failed: <string>\")\n *   return _init_XFst(tfst.release())\n */\n  __pyx_t_2 = ((__pyx_v_tfst.get() == NULL) != 0);\n  if (__pyx_t_2) {\n\n    /* \"pywrapfst.pyx\":2738\n *   tfst.reset(fst.FstClass.ReadFromStream(sstrm, b\"<pywrapfst>\"))\n *   if tfst.get() == NULL:\n *     raise FstIOError(\"Read failed: <string>\")             # <<<<<<<<<<<<<<\n *   return _init_XFst(tfst.release())\n * \n */\n    __pyx_t_3 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstIOError); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 2738, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_3);\n    __pyx_t_4 = __Pyx_PyObject_Call(__pyx_t_3, __pyx_tuple__56, NULL); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 2738, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_4);\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    __Pyx_Raise(__pyx_t_4, 0, 0, 0);\n    __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n    __PYX_ERR(0, 2738, __pyx_L1_error)\n\n    /* \"pywrapfst.pyx\":2737\n *   cdef unique_ptr[fst.FstClass] tfst\n *   tfst.reset(fst.FstClass.ReadFromStream(sstrm, b\"<pywrapfst>\"))\n *   if tfst.get() == NULL:             # <<<<<<<<<<<<<<\n *     raise FstIOError(\"Read failed: <string>\")\n *   return _init_XFst(tfst.release())\n */\n  }\n\n  /* \"pywrapfst.pyx\":2739\n *   if tfst.get() == NULL:\n *     raise FstIOError(\"Read failed: <string>\")\n *   return _init_XFst(tfst.release())             # <<<<<<<<<<<<<<\n * \n * \n */\n  __Pyx_XDECREF(((PyObject *)__pyx_r));\n  __pyx_t_4 = ((PyObject *)__pyx_f_9pywrapfst__init_XFst(__pyx_v_tfst.release())); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 2739, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_4);\n  __pyx_r = ((struct __pyx_obj_9pywrapfst__Fst *)__pyx_t_4);\n  __pyx_t_4 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":2732\n * \n * \n * cpdef _Fst _read_from_string(state):             # <<<<<<<<<<<<<<\n *   cdef stringstream sstrm\n *   sstrm << tostring(state)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_AddTraceback(\"pywrapfst._read_from_string\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XGIVEREF((PyObject *)__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_15_read_from_string(PyObject *__pyx_self, PyObject *__pyx_v_state); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_15_read_from_string(PyObject *__pyx_self, PyObject *__pyx_v_state) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"_read_from_string (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_14_read_from_string(__pyx_self, ((PyObject *)__pyx_v_state));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_14_read_from_string(CYTHON_UNUSED PyObject *__pyx_self, PyObject *__pyx_v_state) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"_read_from_string\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst__read_from_string(__pyx_v_state, 0)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2732, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst._read_from_string\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":2759\n *    \"\"\"\n * \n *    def __new__(cls, arc_type=b\"standard\"):             # <<<<<<<<<<<<<<\n *     return _create_Fst(arc_type)\n * \n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_3Fst_1__new__(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic PyMethodDef __pyx_mdef_9pywrapfst_3Fst_1__new__ = {\"__new__\", (PyCFunction)__pyx_pw_9pywrapfst_3Fst_1__new__, METH_VARARGS|METH_KEYWORDS, 0};\nstatic PyObject *__pyx_pw_9pywrapfst_3Fst_1__new__(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  CYTHON_UNUSED PyObject *__pyx_v_cls = 0;\n  PyObject *__pyx_v_arc_type = 0;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__new__ (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_cls,&__pyx_n_s_arc_type,0};\n    PyObject* values[2] = {0,0};\n    values[1] = ((PyObject *)((PyObject*)__pyx_n_b_standard));\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (likely((values[0] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_cls)) != 0)) kw_args--;\n        else goto __pyx_L5_argtuple_error;\n        CYTHON_FALLTHROUGH;\n        case  1:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_arc_type);\n          if (value) { values[1] = value; kw_args--; }\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"__new__\") < 0)) __PYX_ERR(0, 2759, __pyx_L3_error)\n      }\n    } else {\n      switch (PyTuple_GET_SIZE(__pyx_args)) {\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n    }\n    __pyx_v_cls = values[0];\n    __pyx_v_arc_type = values[1];\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"__new__\", 0, 1, 2, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 2759, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst.Fst.__new__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  __pyx_r = __pyx_pf_9pywrapfst_3Fst___new__(__pyx_self, __pyx_v_cls, __pyx_v_arc_type);\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_3Fst___new__(CYTHON_UNUSED PyObject *__pyx_self, CYTHON_UNUSED PyObject *__pyx_v_cls, PyObject *__pyx_v_arc_type) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  struct __pyx_opt_args_9pywrapfst__create_Fst __pyx_t_2;\n  __Pyx_RefNannySetupContext(\"__new__\", 0);\n\n  /* \"pywrapfst.pyx\":2760\n * \n *    def __new__(cls, arc_type=b\"standard\"):\n *     return _create_Fst(arc_type)             # <<<<<<<<<<<<<<\n * \n *    @staticmethod\n */\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_2.__pyx_n = 1;\n  __pyx_t_2.arc_type = __pyx_v_arc_type;\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst__create_Fst(&__pyx_t_2)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2760, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":2759\n *    \"\"\"\n * \n *    def __new__(cls, arc_type=b\"standard\"):             # <<<<<<<<<<<<<<\n *     return _create_Fst(arc_type)\n * \n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.Fst.__new__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":2763\n * \n *    @staticmethod\n *    def read(filename):             # <<<<<<<<<<<<<<\n *      \"\"\"\n *      read(filename):\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_3Fst_3read(PyObject *__pyx_self, PyObject *__pyx_v_filename); /*proto*/\nstatic char __pyx_doc_9pywrapfst_3Fst_2read[] = \"\\n     read(filename):\\n\\n     Reads an FST from a file.\\n\\n     Args:\\n       filename: The string location of the input file.\\n\\n     Returns:\\n       An FST object.\\n\\n     Raises:\\n       FstIOError: Read failed.\\n     \";\nstatic PyMethodDef __pyx_mdef_9pywrapfst_3Fst_3read = {\"read\", (PyCFunction)__pyx_pw_9pywrapfst_3Fst_3read, METH_O, __pyx_doc_9pywrapfst_3Fst_2read};\nstatic PyObject *__pyx_pw_9pywrapfst_3Fst_3read(PyObject *__pyx_self, PyObject *__pyx_v_filename) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"read (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_3Fst_2read(__pyx_self, ((PyObject *)__pyx_v_filename));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_3Fst_2read(CYTHON_UNUSED PyObject *__pyx_self, PyObject *__pyx_v_filename) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"read\", 0);\n\n  /* \"pywrapfst.pyx\":2778\n *        FstIOError: Read failed.\n *      \"\"\"\n *      return _read(filename)             # <<<<<<<<<<<<<<\n * \n *    @staticmethod\n */\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst__read(__pyx_v_filename, 0)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2778, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":2763\n * \n *    @staticmethod\n *    def read(filename):             # <<<<<<<<<<<<<<\n *      \"\"\"\n *      read(filename):\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.Fst.read\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":2781\n * \n *    @staticmethod\n *    def read_from_string(state):             # <<<<<<<<<<<<<<\n *      \"\"\"\n *      read_from_string(string, fst_type=None)\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_3Fst_5read_from_string(PyObject *__pyx_self, PyObject *__pyx_v_state); /*proto*/\nstatic char __pyx_doc_9pywrapfst_3Fst_4read_from_string[] = \"\\n     read_from_string(string, fst_type=None)\\n\\n     Reads an FST from a serialized string.\\n\\n     Args:\\n       state: A string containing the serialized FST.\\n\\n     Returns:\\n       An FST object.\\n\\n     Raises:\\n       FstIOError: Read failed.\\n       FstOpError: Read-time conversion failed.\\n\\n     See also: `write_to_string`.\\n     \";\nstatic PyMethodDef __pyx_mdef_9pywrapfst_3Fst_5read_from_string = {\"read_from_string\", (PyCFunction)__pyx_pw_9pywrapfst_3Fst_5read_from_string, METH_O, __pyx_doc_9pywrapfst_3Fst_4read_from_string};\nstatic PyObject *__pyx_pw_9pywrapfst_3Fst_5read_from_string(PyObject *__pyx_self, PyObject *__pyx_v_state) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"read_from_string (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_3Fst_4read_from_string(__pyx_self, ((PyObject *)__pyx_v_state));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_3Fst_4read_from_string(CYTHON_UNUSED PyObject *__pyx_self, PyObject *__pyx_v_state) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"read_from_string\", 0);\n\n  /* \"pywrapfst.pyx\":2799\n *      See also: `write_to_string`.\n *      \"\"\"\n *      return _read_from_string(state)             # <<<<<<<<<<<<<<\n * \n * \n */\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst__read_from_string(__pyx_v_state, 0)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2799, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":2781\n * \n *    @staticmethod\n *    def read_from_string(state):             # <<<<<<<<<<<<<<\n *      \"\"\"\n *      read_from_string(string, fst_type=None)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.Fst.read_from_string\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":2914\n *   \"\"\"\n * \n *   def __repr__(self):             # <<<<<<<<<<<<<<\n *     return \"<Arc at 0x{:x}>\".format(id(self))\n * \n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_3Arc_1__repr__(PyObject *__pyx_v_self); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_3Arc_1__repr__(PyObject *__pyx_v_self) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__repr__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_3Arc___repr__(((struct __pyx_obj_9pywrapfst_Arc *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_3Arc___repr__(struct __pyx_obj_9pywrapfst_Arc *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  __Pyx_RefNannySetupContext(\"__repr__\", 0);\n\n  /* \"pywrapfst.pyx\":2915\n * \n *   def __repr__(self):\n *     return \"<Arc at 0x{:x}>\".format(id(self))             # <<<<<<<<<<<<<<\n * \n *   def __init__(self, int64 ilabel, int64 olabel, weight, int64 nextstate):\n */\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_2 = __Pyx_PyObject_GetAttrStr(__pyx_kp_s_Arc_at_0x_x, __pyx_n_s_format); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 2915, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  __pyx_t_3 = PyTuple_New(1); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 2915, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_3);\n  __Pyx_INCREF(((PyObject *)__pyx_v_self));\n  __Pyx_GIVEREF(((PyObject *)__pyx_v_self));\n  PyTuple_SET_ITEM(__pyx_t_3, 0, ((PyObject *)__pyx_v_self));\n  __pyx_t_4 = __Pyx_PyObject_Call(__pyx_builtin_id, __pyx_t_3, NULL); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 2915, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_4);\n  __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n  __pyx_t_3 = NULL;\n  if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_2))) {\n    __pyx_t_3 = PyMethod_GET_SELF(__pyx_t_2);\n    if (likely(__pyx_t_3)) {\n      PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_2);\n      __Pyx_INCREF(__pyx_t_3);\n      __Pyx_INCREF(function);\n      __Pyx_DECREF_SET(__pyx_t_2, function);\n    }\n  }\n  if (!__pyx_t_3) {\n    __pyx_t_1 = __Pyx_PyObject_CallOneArg(__pyx_t_2, __pyx_t_4); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2915, __pyx_L1_error)\n    __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n    __Pyx_GOTREF(__pyx_t_1);\n  } else {\n    #if CYTHON_FAST_PYCALL\n    if (PyFunction_Check(__pyx_t_2)) {\n      PyObject *__pyx_temp[2] = {__pyx_t_3, __pyx_t_4};\n      __pyx_t_1 = __Pyx_PyFunction_FastCall(__pyx_t_2, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2915, __pyx_L1_error)\n      __Pyx_XDECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __Pyx_GOTREF(__pyx_t_1);\n      __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n    } else\n    #endif\n    #if CYTHON_FAST_PYCCALL\n    if (__Pyx_PyFastCFunction_Check(__pyx_t_2)) {\n      PyObject *__pyx_temp[2] = {__pyx_t_3, __pyx_t_4};\n      __pyx_t_1 = __Pyx_PyCFunction_FastCall(__pyx_t_2, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2915, __pyx_L1_error)\n      __Pyx_XDECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __Pyx_GOTREF(__pyx_t_1);\n      __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n    } else\n    #endif\n    {\n      __pyx_t_5 = PyTuple_New(1+1); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 2915, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_5);\n      __Pyx_GIVEREF(__pyx_t_3); PyTuple_SET_ITEM(__pyx_t_5, 0, __pyx_t_3); __pyx_t_3 = NULL;\n      __Pyx_GIVEREF(__pyx_t_4);\n      PyTuple_SET_ITEM(__pyx_t_5, 0+1, __pyx_t_4);\n      __pyx_t_4 = 0;\n      __pyx_t_1 = __Pyx_PyObject_Call(__pyx_t_2, __pyx_t_5, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2915, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_1);\n      __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n    }\n  }\n  __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":2914\n *   \"\"\"\n * \n *   def __repr__(self):             # <<<<<<<<<<<<<<\n *     return \"<Arc at 0x{:x}>\".format(id(self))\n * \n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_AddTraceback(\"pywrapfst.Arc.__repr__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":2917\n *     return \"<Arc at 0x{:x}>\".format(id(self))\n * \n *   def __init__(self, int64 ilabel, int64 olabel, weight, int64 nextstate):             # <<<<<<<<<<<<<<\n *     cdef fst.WeightClass wc = _get_WeightClass_or_One(b\"tropical\", weight)\n *     self._arc.reset(new fst.ArcClass(ilabel, olabel, wc, nextstate))\n */\n\n/* Python wrapper */\nstatic int __pyx_pw_9pywrapfst_3Arc_3__init__(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic int __pyx_pw_9pywrapfst_3Arc_3__init__(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  __pyx_t_10basictypes_int64 __pyx_v_ilabel;\n  __pyx_t_10basictypes_int64 __pyx_v_olabel;\n  PyObject *__pyx_v_weight = 0;\n  __pyx_t_10basictypes_int64 __pyx_v_nextstate;\n  int __pyx_r;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__init__ (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_ilabel,&__pyx_n_s_olabel,&__pyx_n_s_weight,&__pyx_n_s_nextstate,0};\n    PyObject* values[4] = {0,0,0,0};\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  4: values[3] = PyTuple_GET_ITEM(__pyx_args, 3);\n        CYTHON_FALLTHROUGH;\n        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);\n        CYTHON_FALLTHROUGH;\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (likely((values[0] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_ilabel)) != 0)) kw_args--;\n        else goto __pyx_L5_argtuple_error;\n        CYTHON_FALLTHROUGH;\n        case  1:\n        if (likely((values[1] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_olabel)) != 0)) kw_args--;\n        else {\n          __Pyx_RaiseArgtupleInvalid(\"__init__\", 1, 4, 4, 1); __PYX_ERR(0, 2917, __pyx_L3_error)\n        }\n        CYTHON_FALLTHROUGH;\n        case  2:\n        if (likely((values[2] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_weight)) != 0)) kw_args--;\n        else {\n          __Pyx_RaiseArgtupleInvalid(\"__init__\", 1, 4, 4, 2); __PYX_ERR(0, 2917, __pyx_L3_error)\n        }\n        CYTHON_FALLTHROUGH;\n        case  3:\n        if (likely((values[3] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_nextstate)) != 0)) kw_args--;\n        else {\n          __Pyx_RaiseArgtupleInvalid(\"__init__\", 1, 4, 4, 3); __PYX_ERR(0, 2917, __pyx_L3_error)\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"__init__\") < 0)) __PYX_ERR(0, 2917, __pyx_L3_error)\n      }\n    } else if (PyTuple_GET_SIZE(__pyx_args) != 4) {\n      goto __pyx_L5_argtuple_error;\n    } else {\n      values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n      values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n      values[2] = PyTuple_GET_ITEM(__pyx_args, 2);\n      values[3] = PyTuple_GET_ITEM(__pyx_args, 3);\n    }\n    __pyx_v_ilabel = __Pyx_PyInt_As_int64_t(values[0]); if (unlikely((__pyx_v_ilabel == ((int64_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 2917, __pyx_L3_error)\n    __pyx_v_olabel = __Pyx_PyInt_As_int64_t(values[1]); if (unlikely((__pyx_v_olabel == ((int64_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 2917, __pyx_L3_error)\n    __pyx_v_weight = values[2];\n    __pyx_v_nextstate = __Pyx_PyInt_As_int64_t(values[3]); if (unlikely((__pyx_v_nextstate == ((int64_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 2917, __pyx_L3_error)\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"__init__\", 1, 4, 4, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 2917, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst.Arc.__init__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return -1;\n  __pyx_L4_argument_unpacking_done:;\n  __pyx_r = __pyx_pf_9pywrapfst_3Arc_2__init__(((struct __pyx_obj_9pywrapfst_Arc *)__pyx_v_self), __pyx_v_ilabel, __pyx_v_olabel, __pyx_v_weight, __pyx_v_nextstate);\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic int __pyx_pf_9pywrapfst_3Arc_2__init__(struct __pyx_obj_9pywrapfst_Arc *__pyx_v_self, __pyx_t_10basictypes_int64 __pyx_v_ilabel, __pyx_t_10basictypes_int64 __pyx_v_olabel, PyObject *__pyx_v_weight, __pyx_t_10basictypes_int64 __pyx_v_nextstate) {\n  fst::script::WeightClass __pyx_v_wc;\n  int __pyx_r;\n  __Pyx_RefNannyDeclarations\n  std::string __pyx_t_1;\n  fst::script::WeightClass __pyx_t_2;\n  __Pyx_RefNannySetupContext(\"__init__\", 0);\n\n  /* \"pywrapfst.pyx\":2918\n * \n *   def __init__(self, int64 ilabel, int64 olabel, weight, int64 nextstate):\n *     cdef fst.WeightClass wc = _get_WeightClass_or_One(b\"tropical\", weight)             # <<<<<<<<<<<<<<\n *     self._arc.reset(new fst.ArcClass(ilabel, olabel, wc, nextstate))\n * \n */\n  __pyx_t_1 = __pyx_convert_string_from_py_std__in_string(__pyx_n_b_tropical); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 2918, __pyx_L1_error)\n  __pyx_t_2 = __pyx_f_9pywrapfst__get_WeightClass_or_One(__pyx_t_1, __pyx_v_weight); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 2918, __pyx_L1_error)\n  __pyx_v_wc = __pyx_t_2;\n\n  /* \"pywrapfst.pyx\":2919\n *   def __init__(self, int64 ilabel, int64 olabel, weight, int64 nextstate):\n *     cdef fst.WeightClass wc = _get_WeightClass_or_One(b\"tropical\", weight)\n *     self._arc.reset(new fst.ArcClass(ilabel, olabel, wc, nextstate))             # <<<<<<<<<<<<<<\n * \n *   cpdef Arc copy(self):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_arc\");\n    __PYX_ERR(0, 2919, __pyx_L1_error)\n  }\n  __pyx_v_self->_arc.reset(new fst::script::ArcClass(__pyx_v_ilabel, __pyx_v_olabel, __pyx_v_wc, __pyx_v_nextstate));\n\n  /* \"pywrapfst.pyx\":2917\n *     return \"<Arc at 0x{:x}>\".format(id(self))\n * \n *   def __init__(self, int64 ilabel, int64 olabel, weight, int64 nextstate):             # <<<<<<<<<<<<<<\n *     cdef fst.WeightClass wc = _get_WeightClass_or_One(b\"tropical\", weight)\n *     self._arc.reset(new fst.ArcClass(ilabel, olabel, wc, nextstate))\n */\n\n  /* function exit code */\n  __pyx_r = 0;\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"pywrapfst.Arc.__init__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = -1;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":2921\n *     self._arc.reset(new fst.ArcClass(ilabel, olabel, wc, nextstate))\n * \n *   cpdef Arc copy(self):             # <<<<<<<<<<<<<<\n *     return Arc(self.ilabel, self.olabel, self.weight, self.nextstate)\n * \n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_3Arc_5copy(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic struct __pyx_obj_9pywrapfst_Arc *__pyx_f_9pywrapfst_3Arc_copy(struct __pyx_obj_9pywrapfst_Arc *__pyx_v_self, int __pyx_skip_dispatch) {\n  struct __pyx_obj_9pywrapfst_Arc *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  __Pyx_RefNannySetupContext(\"copy\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_copy); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2921, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_3Arc_5copy)) {\n      __Pyx_XDECREF(((PyObject *)__pyx_r));\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 2921, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 2921, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      if (!(likely(((__pyx_t_2) == Py_None) || likely(__Pyx_TypeTest(__pyx_t_2, __pyx_ptype_9pywrapfst_Arc))))) __PYX_ERR(0, 2921, __pyx_L1_error)\n      __pyx_r = ((struct __pyx_obj_9pywrapfst_Arc *)__pyx_t_2);\n      __pyx_t_2 = 0;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":2922\n * \n *   cpdef Arc copy(self):\n *     return Arc(self.ilabel, self.olabel, self.weight, self.nextstate)             # <<<<<<<<<<<<<<\n * \n *   property ilabel:\n */\n  __Pyx_XDECREF(((PyObject *)__pyx_r));\n  __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_ilabel); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2922, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_t_2 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_olabel); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 2922, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  __pyx_t_3 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_weight); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 2922, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_3);\n  __pyx_t_4 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_nextstate); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 2922, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_4);\n  __pyx_t_5 = PyTuple_New(4); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 2922, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_5);\n  __Pyx_GIVEREF(__pyx_t_1);\n  PyTuple_SET_ITEM(__pyx_t_5, 0, __pyx_t_1);\n  __Pyx_GIVEREF(__pyx_t_2);\n  PyTuple_SET_ITEM(__pyx_t_5, 1, __pyx_t_2);\n  __Pyx_GIVEREF(__pyx_t_3);\n  PyTuple_SET_ITEM(__pyx_t_5, 2, __pyx_t_3);\n  __Pyx_GIVEREF(__pyx_t_4);\n  PyTuple_SET_ITEM(__pyx_t_5, 3, __pyx_t_4);\n  __pyx_t_1 = 0;\n  __pyx_t_2 = 0;\n  __pyx_t_3 = 0;\n  __pyx_t_4 = 0;\n  __pyx_t_4 = __Pyx_PyObject_Call(((PyObject *)__pyx_ptype_9pywrapfst_Arc), __pyx_t_5, NULL); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 2922, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_4);\n  __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n  __pyx_r = ((struct __pyx_obj_9pywrapfst_Arc *)__pyx_t_4);\n  __pyx_t_4 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":2921\n *     self._arc.reset(new fst.ArcClass(ilabel, olabel, wc, nextstate))\n * \n *   cpdef Arc copy(self):             # <<<<<<<<<<<<<<\n *     return Arc(self.ilabel, self.olabel, self.weight, self.nextstate)\n * \n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_AddTraceback(\"pywrapfst.Arc.copy\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XGIVEREF((PyObject *)__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_3Arc_5copy(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_3Arc_5copy(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"copy (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_3Arc_4copy(((struct __pyx_obj_9pywrapfst_Arc *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_3Arc_4copy(struct __pyx_obj_9pywrapfst_Arc *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"copy\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst_3Arc_copy(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2921, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.Arc.copy\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":2926\n *   property ilabel:\n * \n *     def __get__(self):             # <<<<<<<<<<<<<<\n *       return deref(self._arc).ilabel\n * \n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_3Arc_6ilabel_1__get__(PyObject *__pyx_v_self); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_3Arc_6ilabel_1__get__(PyObject *__pyx_v_self) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__get__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_3Arc_6ilabel___get__(((struct __pyx_obj_9pywrapfst_Arc *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_3Arc_6ilabel___get__(struct __pyx_obj_9pywrapfst_Arc *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"__get__\", 0);\n\n  /* \"pywrapfst.pyx\":2927\n * \n *     def __get__(self):\n *       return deref(self._arc).ilabel             # <<<<<<<<<<<<<<\n * \n *     def __set__(self, int64 value):\n */\n  __Pyx_XDECREF(__pyx_r);\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_arc\");\n    __PYX_ERR(0, 2927, __pyx_L1_error)\n  }\n  __pyx_t_1 = __Pyx_PyInt_From_int64_t((*__pyx_v_self->_arc).ilabel); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2927, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":2926\n *   property ilabel:\n * \n *     def __get__(self):             # <<<<<<<<<<<<<<\n *       return deref(self._arc).ilabel\n * \n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.Arc.ilabel.__get__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":2929\n *       return deref(self._arc).ilabel\n * \n *     def __set__(self, int64 value):             # <<<<<<<<<<<<<<\n *       deref(self._arc).ilabel = value\n * \n */\n\n/* Python wrapper */\nstatic int __pyx_pw_9pywrapfst_3Arc_6ilabel_3__set__(PyObject *__pyx_v_self, PyObject *__pyx_arg_value); /*proto*/\nstatic int __pyx_pw_9pywrapfst_3Arc_6ilabel_3__set__(PyObject *__pyx_v_self, PyObject *__pyx_arg_value) {\n  __pyx_t_10basictypes_int64 __pyx_v_value;\n  int __pyx_r;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__set__ (wrapper)\", 0);\n  assert(__pyx_arg_value); {\n    __pyx_v_value = __Pyx_PyInt_As_int64_t(__pyx_arg_value); if (unlikely((__pyx_v_value == ((int64_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 2929, __pyx_L3_error)\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst.Arc.ilabel.__set__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return -1;\n  __pyx_L4_argument_unpacking_done:;\n  __pyx_r = __pyx_pf_9pywrapfst_3Arc_6ilabel_2__set__(((struct __pyx_obj_9pywrapfst_Arc *)__pyx_v_self), ((__pyx_t_10basictypes_int64)__pyx_v_value));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic int __pyx_pf_9pywrapfst_3Arc_6ilabel_2__set__(struct __pyx_obj_9pywrapfst_Arc *__pyx_v_self, __pyx_t_10basictypes_int64 __pyx_v_value) {\n  int __pyx_r;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__set__\", 0);\n\n  /* \"pywrapfst.pyx\":2930\n * \n *     def __set__(self, int64 value):\n *       deref(self._arc).ilabel = value             # <<<<<<<<<<<<<<\n * \n *   property olabel:\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_arc\");\n    __PYX_ERR(0, 2930, __pyx_L1_error)\n  }\n  (*__pyx_v_self->_arc).ilabel = __pyx_v_value;\n\n  /* \"pywrapfst.pyx\":2929\n *       return deref(self._arc).ilabel\n * \n *     def __set__(self, int64 value):             # <<<<<<<<<<<<<<\n *       deref(self._arc).ilabel = value\n * \n */\n\n  /* function exit code */\n  __pyx_r = 0;\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"pywrapfst.Arc.ilabel.__set__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = -1;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":2934\n *   property olabel:\n * \n *     def __get__(self):             # <<<<<<<<<<<<<<\n *       return deref(self._arc).olabel\n * \n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_3Arc_6olabel_1__get__(PyObject *__pyx_v_self); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_3Arc_6olabel_1__get__(PyObject *__pyx_v_self) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__get__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_3Arc_6olabel___get__(((struct __pyx_obj_9pywrapfst_Arc *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_3Arc_6olabel___get__(struct __pyx_obj_9pywrapfst_Arc *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"__get__\", 0);\n\n  /* \"pywrapfst.pyx\":2935\n * \n *     def __get__(self):\n *       return deref(self._arc).olabel             # <<<<<<<<<<<<<<\n * \n *     def __set__(self, int64 value):\n */\n  __Pyx_XDECREF(__pyx_r);\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_arc\");\n    __PYX_ERR(0, 2935, __pyx_L1_error)\n  }\n  __pyx_t_1 = __Pyx_PyInt_From_int64_t((*__pyx_v_self->_arc).olabel); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2935, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":2934\n *   property olabel:\n * \n *     def __get__(self):             # <<<<<<<<<<<<<<\n *       return deref(self._arc).olabel\n * \n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.Arc.olabel.__get__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":2937\n *       return deref(self._arc).olabel\n * \n *     def __set__(self, int64 value):             # <<<<<<<<<<<<<<\n *       deref(self._arc).olabel = value\n * \n */\n\n/* Python wrapper */\nstatic int __pyx_pw_9pywrapfst_3Arc_6olabel_3__set__(PyObject *__pyx_v_self, PyObject *__pyx_arg_value); /*proto*/\nstatic int __pyx_pw_9pywrapfst_3Arc_6olabel_3__set__(PyObject *__pyx_v_self, PyObject *__pyx_arg_value) {\n  __pyx_t_10basictypes_int64 __pyx_v_value;\n  int __pyx_r;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__set__ (wrapper)\", 0);\n  assert(__pyx_arg_value); {\n    __pyx_v_value = __Pyx_PyInt_As_int64_t(__pyx_arg_value); if (unlikely((__pyx_v_value == ((int64_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 2937, __pyx_L3_error)\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst.Arc.olabel.__set__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return -1;\n  __pyx_L4_argument_unpacking_done:;\n  __pyx_r = __pyx_pf_9pywrapfst_3Arc_6olabel_2__set__(((struct __pyx_obj_9pywrapfst_Arc *)__pyx_v_self), ((__pyx_t_10basictypes_int64)__pyx_v_value));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic int __pyx_pf_9pywrapfst_3Arc_6olabel_2__set__(struct __pyx_obj_9pywrapfst_Arc *__pyx_v_self, __pyx_t_10basictypes_int64 __pyx_v_value) {\n  int __pyx_r;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__set__\", 0);\n\n  /* \"pywrapfst.pyx\":2938\n * \n *     def __set__(self, int64 value):\n *       deref(self._arc).olabel = value             # <<<<<<<<<<<<<<\n * \n *   property weight:\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_arc\");\n    __PYX_ERR(0, 2938, __pyx_L1_error)\n  }\n  (*__pyx_v_self->_arc).olabel = __pyx_v_value;\n\n  /* \"pywrapfst.pyx\":2937\n *       return deref(self._arc).olabel\n * \n *     def __set__(self, int64 value):             # <<<<<<<<<<<<<<\n *       deref(self._arc).olabel = value\n * \n */\n\n  /* function exit code */\n  __pyx_r = 0;\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"pywrapfst.Arc.olabel.__set__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = -1;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":2942\n *   property weight:\n * \n *     def __get__(self):             # <<<<<<<<<<<<<<\n *       cdef Weight weight = Weight.__new__(Weight)\n *       weight._weight.reset(new fst.WeightClass(deref(self._arc).weight))\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_3Arc_6weight_1__get__(PyObject *__pyx_v_self); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_3Arc_6weight_1__get__(PyObject *__pyx_v_self) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__get__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_3Arc_6weight___get__(((struct __pyx_obj_9pywrapfst_Arc *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_3Arc_6weight___get__(struct __pyx_obj_9pywrapfst_Arc *__pyx_v_self) {\n  struct __pyx_obj_9pywrapfst_Weight *__pyx_v_weight = 0;\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"__get__\", 0);\n\n  /* \"pywrapfst.pyx\":2943\n * \n *     def __get__(self):\n *       cdef Weight weight = Weight.__new__(Weight)             # <<<<<<<<<<<<<<\n *       weight._weight.reset(new fst.WeightClass(deref(self._arc).weight))\n *       return weight\n */\n  __pyx_t_1 = __pyx_tp_new_9pywrapfst_Weight(((PyTypeObject *)__pyx_ptype_9pywrapfst_Weight), __pyx_empty_tuple, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2943, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (!(likely(__Pyx_TypeTest(__pyx_t_1, __pyx_ptype_9pywrapfst_Weight)))) __PYX_ERR(0, 2943, __pyx_L1_error)\n  __pyx_v_weight = ((struct __pyx_obj_9pywrapfst_Weight *)__pyx_t_1);\n  __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2944\n *     def __get__(self):\n *       cdef Weight weight = Weight.__new__(Weight)\n *       weight._weight.reset(new fst.WeightClass(deref(self._arc).weight))             # <<<<<<<<<<<<<<\n *       return weight\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_weight) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_weight\");\n    __PYX_ERR(0, 2944, __pyx_L1_error)\n  }\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_arc\");\n    __PYX_ERR(0, 2944, __pyx_L1_error)\n  }\n  __pyx_v_weight->_weight.reset(new fst::script::WeightClass((*__pyx_v_self->_arc).weight));\n\n  /* \"pywrapfst.pyx\":2945\n *       cdef Weight weight = Weight.__new__(Weight)\n *       weight._weight.reset(new fst.WeightClass(deref(self._arc).weight))\n *       return weight             # <<<<<<<<<<<<<<\n * \n *     def __set__(self, weight):\n */\n  __Pyx_XDECREF(__pyx_r);\n  __Pyx_INCREF(((PyObject *)__pyx_v_weight));\n  __pyx_r = ((PyObject *)__pyx_v_weight);\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":2942\n *   property weight:\n * \n *     def __get__(self):             # <<<<<<<<<<<<<<\n *       cdef Weight weight = Weight.__new__(Weight)\n *       weight._weight.reset(new fst.WeightClass(deref(self._arc).weight))\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.Arc.weight.__get__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XDECREF((PyObject *)__pyx_v_weight);\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":2947\n *       return weight\n * \n *     def __set__(self, weight):             # <<<<<<<<<<<<<<\n *       deref(self._arc).weight = _get_WeightClass_or_One(b\"tropical\", weight)\n * \n */\n\n/* Python wrapper */\nstatic int __pyx_pw_9pywrapfst_3Arc_6weight_3__set__(PyObject *__pyx_v_self, PyObject *__pyx_v_weight); /*proto*/\nstatic int __pyx_pw_9pywrapfst_3Arc_6weight_3__set__(PyObject *__pyx_v_self, PyObject *__pyx_v_weight) {\n  int __pyx_r;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__set__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_3Arc_6weight_2__set__(((struct __pyx_obj_9pywrapfst_Arc *)__pyx_v_self), ((PyObject *)__pyx_v_weight));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic int __pyx_pf_9pywrapfst_3Arc_6weight_2__set__(struct __pyx_obj_9pywrapfst_Arc *__pyx_v_self, PyObject *__pyx_v_weight) {\n  int __pyx_r;\n  __Pyx_RefNannyDeclarations\n  std::string __pyx_t_1;\n  fst::script::WeightClass __pyx_t_2;\n  __Pyx_RefNannySetupContext(\"__set__\", 0);\n\n  /* \"pywrapfst.pyx\":2948\n * \n *     def __set__(self, weight):\n *       deref(self._arc).weight = _get_WeightClass_or_One(b\"tropical\", weight)             # <<<<<<<<<<<<<<\n * \n *   property nextstate:\n */\n  __pyx_t_1 = __pyx_convert_string_from_py_std__in_string(__pyx_n_b_tropical); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 2948, __pyx_L1_error)\n  __pyx_t_2 = __pyx_f_9pywrapfst__get_WeightClass_or_One(__pyx_t_1, __pyx_v_weight); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 2948, __pyx_L1_error)\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_arc\");\n    __PYX_ERR(0, 2948, __pyx_L1_error)\n  }\n  (*__pyx_v_self->_arc).weight = __pyx_t_2;\n\n  /* \"pywrapfst.pyx\":2947\n *       return weight\n * \n *     def __set__(self, weight):             # <<<<<<<<<<<<<<\n *       deref(self._arc).weight = _get_WeightClass_or_One(b\"tropical\", weight)\n * \n */\n\n  /* function exit code */\n  __pyx_r = 0;\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"pywrapfst.Arc.weight.__set__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = -1;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":2952\n *   property nextstate:\n * \n *     def __get__(self):             # <<<<<<<<<<<<<<\n *       return deref(self._arc).nextstate\n * \n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_3Arc_9nextstate_1__get__(PyObject *__pyx_v_self); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_3Arc_9nextstate_1__get__(PyObject *__pyx_v_self) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__get__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_3Arc_9nextstate___get__(((struct __pyx_obj_9pywrapfst_Arc *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_3Arc_9nextstate___get__(struct __pyx_obj_9pywrapfst_Arc *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"__get__\", 0);\n\n  /* \"pywrapfst.pyx\":2953\n * \n *     def __get__(self):\n *       return deref(self._arc).nextstate             # <<<<<<<<<<<<<<\n * \n *     def __set__(self, int64 value):\n */\n  __Pyx_XDECREF(__pyx_r);\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_arc\");\n    __PYX_ERR(0, 2953, __pyx_L1_error)\n  }\n  __pyx_t_1 = __Pyx_PyInt_From_int64_t((*__pyx_v_self->_arc).nextstate); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2953, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":2952\n *   property nextstate:\n * \n *     def __get__(self):             # <<<<<<<<<<<<<<\n *       return deref(self._arc).nextstate\n * \n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.Arc.nextstate.__get__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":2955\n *       return deref(self._arc).nextstate\n * \n *     def __set__(self, int64 value):             # <<<<<<<<<<<<<<\n *       deref(self._arc).nextstate = value\n * \n */\n\n/* Python wrapper */\nstatic int __pyx_pw_9pywrapfst_3Arc_9nextstate_3__set__(PyObject *__pyx_v_self, PyObject *__pyx_arg_value); /*proto*/\nstatic int __pyx_pw_9pywrapfst_3Arc_9nextstate_3__set__(PyObject *__pyx_v_self, PyObject *__pyx_arg_value) {\n  __pyx_t_10basictypes_int64 __pyx_v_value;\n  int __pyx_r;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__set__ (wrapper)\", 0);\n  assert(__pyx_arg_value); {\n    __pyx_v_value = __Pyx_PyInt_As_int64_t(__pyx_arg_value); if (unlikely((__pyx_v_value == ((int64_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 2955, __pyx_L3_error)\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst.Arc.nextstate.__set__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return -1;\n  __pyx_L4_argument_unpacking_done:;\n  __pyx_r = __pyx_pf_9pywrapfst_3Arc_9nextstate_2__set__(((struct __pyx_obj_9pywrapfst_Arc *)__pyx_v_self), ((__pyx_t_10basictypes_int64)__pyx_v_value));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic int __pyx_pf_9pywrapfst_3Arc_9nextstate_2__set__(struct __pyx_obj_9pywrapfst_Arc *__pyx_v_self, __pyx_t_10basictypes_int64 __pyx_v_value) {\n  int __pyx_r;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__set__\", 0);\n\n  /* \"pywrapfst.pyx\":2956\n * \n *     def __set__(self, int64 value):\n *       deref(self._arc).nextstate = value             # <<<<<<<<<<<<<<\n * \n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_arc\");\n    __PYX_ERR(0, 2956, __pyx_L1_error)\n  }\n  (*__pyx_v_self->_arc).nextstate = __pyx_v_value;\n\n  /* \"pywrapfst.pyx\":2955\n *       return deref(self._arc).nextstate\n * \n *     def __set__(self, int64 value):             # <<<<<<<<<<<<<<\n *       deref(self._arc).nextstate = value\n * \n */\n\n  /* function exit code */\n  __pyx_r = 0;\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"pywrapfst.Arc.nextstate.__set__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = -1;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"(tree fragment)\":1\n * def __reduce_cython__(self):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._arc cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_3Arc_7__reduce_cython__(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_3Arc_7__reduce_cython__(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__reduce_cython__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_3Arc_6__reduce_cython__(((struct __pyx_obj_9pywrapfst_Arc *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_3Arc_6__reduce_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst_Arc *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"__reduce_cython__\", 0);\n\n  /* \"(tree fragment)\":2\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._arc cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._arc cannot be converted to a Python object for pickling\")\n */\n  __pyx_t_1 = __Pyx_PyObject_Call(__pyx_builtin_TypeError, __pyx_tuple__57, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(1, 2, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __Pyx_Raise(__pyx_t_1, 0, 0, 0);\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  __PYX_ERR(1, 2, __pyx_L1_error)\n\n  /* \"(tree fragment)\":1\n * def __reduce_cython__(self):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._arc cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.Arc.__reduce_cython__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"(tree fragment)\":3\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._arc cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._arc cannot be converted to a Python object for pickling\")\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_3Arc_9__setstate_cython__(PyObject *__pyx_v_self, PyObject *__pyx_v___pyx_state); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_3Arc_9__setstate_cython__(PyObject *__pyx_v_self, PyObject *__pyx_v___pyx_state) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__setstate_cython__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_3Arc_8__setstate_cython__(((struct __pyx_obj_9pywrapfst_Arc *)__pyx_v_self), ((PyObject *)__pyx_v___pyx_state));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_3Arc_8__setstate_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst_Arc *__pyx_v_self, CYTHON_UNUSED PyObject *__pyx_v___pyx_state) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"__setstate_cython__\", 0);\n\n  /* \"(tree fragment)\":4\n *     raise TypeError(\"self._arc cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._arc cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n */\n  __pyx_t_1 = __Pyx_PyObject_Call(__pyx_builtin_TypeError, __pyx_tuple__58, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(1, 4, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __Pyx_Raise(__pyx_t_1, 0, 0, 0);\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  __PYX_ERR(1, 4, __pyx_L1_error)\n\n  /* \"(tree fragment)\":3\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._arc cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._arc cannot be converted to a Python object for pickling\")\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.Arc.__setstate_cython__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":2959\n * \n * \n * cdef Arc _init_Arc(const fst.ArcClass &arc):             # <<<<<<<<<<<<<<\n *   cdef Weight weight = Weight.__new__(Weight)\n *   weight._weight.reset(new fst.WeightClass(arc.weight))\n */\n\nstatic struct __pyx_obj_9pywrapfst_Arc *__pyx_f_9pywrapfst__init_Arc(fst::script::ArcClass const &__pyx_v_arc) {\n  struct __pyx_obj_9pywrapfst_Weight *__pyx_v_weight = 0;\n  struct __pyx_obj_9pywrapfst_Arc *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  __Pyx_RefNannySetupContext(\"_init_Arc\", 0);\n\n  /* \"pywrapfst.pyx\":2960\n * \n * cdef Arc _init_Arc(const fst.ArcClass &arc):\n *   cdef Weight weight = Weight.__new__(Weight)             # <<<<<<<<<<<<<<\n *   weight._weight.reset(new fst.WeightClass(arc.weight))\n *   return Arc(arc.ilabel, arc.olabel, weight, arc.nextstate)\n */\n  __pyx_t_1 = __pyx_tp_new_9pywrapfst_Weight(((PyTypeObject *)__pyx_ptype_9pywrapfst_Weight), __pyx_empty_tuple, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2960, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (!(likely(__Pyx_TypeTest(__pyx_t_1, __pyx_ptype_9pywrapfst_Weight)))) __PYX_ERR(0, 2960, __pyx_L1_error)\n  __pyx_v_weight = ((struct __pyx_obj_9pywrapfst_Weight *)__pyx_t_1);\n  __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2961\n * cdef Arc _init_Arc(const fst.ArcClass &arc):\n *   cdef Weight weight = Weight.__new__(Weight)\n *   weight._weight.reset(new fst.WeightClass(arc.weight))             # <<<<<<<<<<<<<<\n *   return Arc(arc.ilabel, arc.olabel, weight, arc.nextstate)\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_weight) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_weight\");\n    __PYX_ERR(0, 2961, __pyx_L1_error)\n  }\n  __pyx_v_weight->_weight.reset(new fst::script::WeightClass(__pyx_v_arc.weight));\n\n  /* \"pywrapfst.pyx\":2962\n *   cdef Weight weight = Weight.__new__(Weight)\n *   weight._weight.reset(new fst.WeightClass(arc.weight))\n *   return Arc(arc.ilabel, arc.olabel, weight, arc.nextstate)             # <<<<<<<<<<<<<<\n * \n * \n */\n  __Pyx_XDECREF(((PyObject *)__pyx_r));\n  __pyx_t_1 = __Pyx_PyInt_From_int64_t(__pyx_v_arc.ilabel); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2962, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_t_2 = __Pyx_PyInt_From_int64_t(__pyx_v_arc.olabel); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 2962, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  __pyx_t_3 = __Pyx_PyInt_From_int64_t(__pyx_v_arc.nextstate); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 2962, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_3);\n  __pyx_t_4 = PyTuple_New(4); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 2962, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_4);\n  __Pyx_GIVEREF(__pyx_t_1);\n  PyTuple_SET_ITEM(__pyx_t_4, 0, __pyx_t_1);\n  __Pyx_GIVEREF(__pyx_t_2);\n  PyTuple_SET_ITEM(__pyx_t_4, 1, __pyx_t_2);\n  __Pyx_INCREF(((PyObject *)__pyx_v_weight));\n  __Pyx_GIVEREF(((PyObject *)__pyx_v_weight));\n  PyTuple_SET_ITEM(__pyx_t_4, 2, ((PyObject *)__pyx_v_weight));\n  __Pyx_GIVEREF(__pyx_t_3);\n  PyTuple_SET_ITEM(__pyx_t_4, 3, __pyx_t_3);\n  __pyx_t_1 = 0;\n  __pyx_t_2 = 0;\n  __pyx_t_3 = 0;\n  __pyx_t_3 = __Pyx_PyObject_Call(((PyObject *)__pyx_ptype_9pywrapfst_Arc), __pyx_t_4, NULL); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 2962, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_3);\n  __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n  __pyx_r = ((struct __pyx_obj_9pywrapfst_Arc *)__pyx_t_3);\n  __pyx_t_3 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":2959\n * \n * \n * cdef Arc _init_Arc(const fst.ArcClass &arc):             # <<<<<<<<<<<<<<\n *   cdef Weight weight = Weight.__new__(Weight)\n *   weight._weight.reset(new fst.WeightClass(arc.weight))\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_AddTraceback(\"pywrapfst._init_Arc\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XDECREF((PyObject *)__pyx_v_weight);\n  __Pyx_XGIVEREF((PyObject *)__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":2973\n *   \"\"\"\n * \n *   def __repr__(self):             # <<<<<<<<<<<<<<\n *     return \"<ArcIterator at 0x{:x}>\".format(id(self))\n * \n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_11ArcIterator_1__repr__(PyObject *__pyx_v_self); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_11ArcIterator_1__repr__(PyObject *__pyx_v_self) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__repr__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_11ArcIterator___repr__(((struct __pyx_obj_9pywrapfst_ArcIterator *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_11ArcIterator___repr__(struct __pyx_obj_9pywrapfst_ArcIterator *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  __Pyx_RefNannySetupContext(\"__repr__\", 0);\n\n  /* \"pywrapfst.pyx\":2974\n * \n *   def __repr__(self):\n *     return \"<ArcIterator at 0x{:x}>\".format(id(self))             # <<<<<<<<<<<<<<\n * \n *   def __init__(self, _Fst ifst, int64 state):\n */\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_2 = __Pyx_PyObject_GetAttrStr(__pyx_kp_s_ArcIterator_at_0x_x, __pyx_n_s_format); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 2974, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  __pyx_t_3 = PyTuple_New(1); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 2974, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_3);\n  __Pyx_INCREF(((PyObject *)__pyx_v_self));\n  __Pyx_GIVEREF(((PyObject *)__pyx_v_self));\n  PyTuple_SET_ITEM(__pyx_t_3, 0, ((PyObject *)__pyx_v_self));\n  __pyx_t_4 = __Pyx_PyObject_Call(__pyx_builtin_id, __pyx_t_3, NULL); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 2974, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_4);\n  __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n  __pyx_t_3 = NULL;\n  if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_2))) {\n    __pyx_t_3 = PyMethod_GET_SELF(__pyx_t_2);\n    if (likely(__pyx_t_3)) {\n      PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_2);\n      __Pyx_INCREF(__pyx_t_3);\n      __Pyx_INCREF(function);\n      __Pyx_DECREF_SET(__pyx_t_2, function);\n    }\n  }\n  if (!__pyx_t_3) {\n    __pyx_t_1 = __Pyx_PyObject_CallOneArg(__pyx_t_2, __pyx_t_4); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2974, __pyx_L1_error)\n    __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n    __Pyx_GOTREF(__pyx_t_1);\n  } else {\n    #if CYTHON_FAST_PYCALL\n    if (PyFunction_Check(__pyx_t_2)) {\n      PyObject *__pyx_temp[2] = {__pyx_t_3, __pyx_t_4};\n      __pyx_t_1 = __Pyx_PyFunction_FastCall(__pyx_t_2, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2974, __pyx_L1_error)\n      __Pyx_XDECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __Pyx_GOTREF(__pyx_t_1);\n      __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n    } else\n    #endif\n    #if CYTHON_FAST_PYCCALL\n    if (__Pyx_PyFastCFunction_Check(__pyx_t_2)) {\n      PyObject *__pyx_temp[2] = {__pyx_t_3, __pyx_t_4};\n      __pyx_t_1 = __Pyx_PyCFunction_FastCall(__pyx_t_2, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2974, __pyx_L1_error)\n      __Pyx_XDECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __Pyx_GOTREF(__pyx_t_1);\n      __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n    } else\n    #endif\n    {\n      __pyx_t_5 = PyTuple_New(1+1); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 2974, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_5);\n      __Pyx_GIVEREF(__pyx_t_3); PyTuple_SET_ITEM(__pyx_t_5, 0, __pyx_t_3); __pyx_t_3 = NULL;\n      __Pyx_GIVEREF(__pyx_t_4);\n      PyTuple_SET_ITEM(__pyx_t_5, 0+1, __pyx_t_4);\n      __pyx_t_4 = 0;\n      __pyx_t_1 = __Pyx_PyObject_Call(__pyx_t_2, __pyx_t_5, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2974, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_1);\n      __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n    }\n  }\n  __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":2973\n *   \"\"\"\n * \n *   def __repr__(self):             # <<<<<<<<<<<<<<\n *     return \"<ArcIterator at 0x{:x}>\".format(id(self))\n * \n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_AddTraceback(\"pywrapfst.ArcIterator.__repr__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":2976\n *     return \"<ArcIterator at 0x{:x}>\".format(id(self))\n * \n *   def __init__(self, _Fst ifst, int64 state):             # <<<<<<<<<<<<<<\n *     if not ifst._fst.get().ValidStateId(state):\n *       raise FstIndexError(\"State index out of range\")\n */\n\n/* Python wrapper */\nstatic int __pyx_pw_9pywrapfst_11ArcIterator_3__init__(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic int __pyx_pw_9pywrapfst_11ArcIterator_3__init__(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst = 0;\n  __pyx_t_10basictypes_int64 __pyx_v_state;\n  int __pyx_r;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__init__ (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_ifst,&__pyx_n_s_state,0};\n    PyObject* values[2] = {0,0};\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (likely((values[0] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_ifst)) != 0)) kw_args--;\n        else goto __pyx_L5_argtuple_error;\n        CYTHON_FALLTHROUGH;\n        case  1:\n        if (likely((values[1] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_state)) != 0)) kw_args--;\n        else {\n          __Pyx_RaiseArgtupleInvalid(\"__init__\", 1, 2, 2, 1); __PYX_ERR(0, 2976, __pyx_L3_error)\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"__init__\") < 0)) __PYX_ERR(0, 2976, __pyx_L3_error)\n      }\n    } else if (PyTuple_GET_SIZE(__pyx_args) != 2) {\n      goto __pyx_L5_argtuple_error;\n    } else {\n      values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n      values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n    }\n    __pyx_v_ifst = ((struct __pyx_obj_9pywrapfst__Fst *)values[0]);\n    __pyx_v_state = __Pyx_PyInt_As_int64_t(values[1]); if (unlikely((__pyx_v_state == ((int64_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 2976, __pyx_L3_error)\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"__init__\", 1, 2, 2, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 2976, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst.ArcIterator.__init__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return -1;\n  __pyx_L4_argument_unpacking_done:;\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_ifst), __pyx_ptype_9pywrapfst__Fst, 1, \"ifst\", 0))) __PYX_ERR(0, 2976, __pyx_L1_error)\n  __pyx_r = __pyx_pf_9pywrapfst_11ArcIterator_2__init__(((struct __pyx_obj_9pywrapfst_ArcIterator *)__pyx_v_self), __pyx_v_ifst, __pyx_v_state);\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __pyx_r = -1;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic int __pyx_pf_9pywrapfst_11ArcIterator_2__init__(struct __pyx_obj_9pywrapfst_ArcIterator *__pyx_v_self, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst, __pyx_t_10basictypes_int64 __pyx_v_state) {\n  int __pyx_r;\n  __Pyx_RefNannyDeclarations\n  int __pyx_t_1;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  std::shared_ptr<fst::script::FstClass>  __pyx_t_4;\n  __Pyx_RefNannySetupContext(\"__init__\", 0);\n\n  /* \"pywrapfst.pyx\":2977\n * \n *   def __init__(self, _Fst ifst, int64 state):\n *     if not ifst._fst.get().ValidStateId(state):             # <<<<<<<<<<<<<<\n *       raise FstIndexError(\"State index out of range\")\n *     # Makes copy of the shared_ptr, potentially extending the FST's lifetime.\n */\n  if (unlikely(((PyObject *)__pyx_v_ifst) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 2977, __pyx_L1_error)\n  }\n  __pyx_t_1 = ((!(__pyx_v_ifst->_fst.get()->ValidStateId(__pyx_v_state) != 0)) != 0);\n  if (__pyx_t_1) {\n\n    /* \"pywrapfst.pyx\":2978\n *   def __init__(self, _Fst ifst, int64 state):\n *     if not ifst._fst.get().ValidStateId(state):\n *       raise FstIndexError(\"State index out of range\")             # <<<<<<<<<<<<<<\n *     # Makes copy of the shared_ptr, potentially extending the FST's lifetime.\n *     self._fst = ifst._fst\n */\n    __pyx_t_2 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstIndexError); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 2978, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_2);\n    __pyx_t_3 = __Pyx_PyObject_Call(__pyx_t_2, __pyx_tuple__59, NULL); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 2978, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_3);\n    __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n    __Pyx_Raise(__pyx_t_3, 0, 0, 0);\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    __PYX_ERR(0, 2978, __pyx_L1_error)\n\n    /* \"pywrapfst.pyx\":2977\n * \n *   def __init__(self, _Fst ifst, int64 state):\n *     if not ifst._fst.get().ValidStateId(state):             # <<<<<<<<<<<<<<\n *       raise FstIndexError(\"State index out of range\")\n *     # Makes copy of the shared_ptr, potentially extending the FST's lifetime.\n */\n  }\n\n  /* \"pywrapfst.pyx\":2980\n *       raise FstIndexError(\"State index out of range\")\n *     # Makes copy of the shared_ptr, potentially extending the FST's lifetime.\n *     self._fst = ifst._fst             # <<<<<<<<<<<<<<\n *     self._aiter.reset(new fst.ArcIteratorClass(deref(self._fst), state))\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_ifst) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 2980, __pyx_L1_error)\n  }\n  __pyx_t_4 = __pyx_v_ifst->_fst;\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 2980, __pyx_L1_error)\n  }\n  __pyx_v_self->_fst = __pyx_t_4;\n\n  /* \"pywrapfst.pyx\":2981\n *     # Makes copy of the shared_ptr, potentially extending the FST's lifetime.\n *     self._fst = ifst._fst\n *     self._aiter.reset(new fst.ArcIteratorClass(deref(self._fst), state))             # <<<<<<<<<<<<<<\n * \n *   # This just registers this class as a possible iterator.\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_aiter\");\n    __PYX_ERR(0, 2981, __pyx_L1_error)\n  }\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 2981, __pyx_L1_error)\n  }\n  __pyx_v_self->_aiter.reset(new fst::script::ArcIteratorClass((*__pyx_v_self->_fst), __pyx_v_state));\n\n  /* \"pywrapfst.pyx\":2976\n *     return \"<ArcIterator at 0x{:x}>\".format(id(self))\n * \n *   def __init__(self, _Fst ifst, int64 state):             # <<<<<<<<<<<<<<\n *     if not ifst._fst.get().ValidStateId(state):\n *       raise FstIndexError(\"State index out of range\")\n */\n\n  /* function exit code */\n  __pyx_r = 0;\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_AddTraceback(\"pywrapfst.ArcIterator.__init__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = -1;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":2984\n * \n *   # This just registers this class as a possible iterator.\n *   def __iter__(self):             # <<<<<<<<<<<<<<\n *     return self\n * \n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_11ArcIterator_5__iter__(PyObject *__pyx_v_self); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_11ArcIterator_5__iter__(PyObject *__pyx_v_self) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__iter__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_11ArcIterator_4__iter__(((struct __pyx_obj_9pywrapfst_ArcIterator *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_11ArcIterator_4__iter__(struct __pyx_obj_9pywrapfst_ArcIterator *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__iter__\", 0);\n\n  /* \"pywrapfst.pyx\":2985\n *   # This just registers this class as a possible iterator.\n *   def __iter__(self):\n *     return self             # <<<<<<<<<<<<<<\n * \n *   # Magic method used to get a Pythonic API out of the C++ API.\n */\n  __Pyx_XDECREF(__pyx_r);\n  __Pyx_INCREF(((PyObject *)__pyx_v_self));\n  __pyx_r = ((PyObject *)__pyx_v_self);\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":2984\n * \n *   # This just registers this class as a possible iterator.\n *   def __iter__(self):             # <<<<<<<<<<<<<<\n *     return self\n * \n */\n\n  /* function exit code */\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":2988\n * \n *   # Magic method used to get a Pythonic API out of the C++ API.\n *   def __next__(self):             # <<<<<<<<<<<<<<\n *     if self.done():\n *       raise StopIteration\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_11ArcIterator_7__next__(PyObject *__pyx_v_self); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_11ArcIterator_7__next__(PyObject *__pyx_v_self) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__next__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_11ArcIterator_6__next__(((struct __pyx_obj_9pywrapfst_ArcIterator *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_11ArcIterator_6__next__(struct __pyx_obj_9pywrapfst_ArcIterator *__pyx_v_self) {\n  PyObject *__pyx_v_result = NULL;\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  int __pyx_t_1;\n  PyObject *__pyx_t_2 = NULL;\n  __Pyx_RefNannySetupContext(\"__next__\", 0);\n\n  /* \"pywrapfst.pyx\":2989\n *   # Magic method used to get a Pythonic API out of the C++ API.\n *   def __next__(self):\n *     if self.done():             # <<<<<<<<<<<<<<\n *       raise StopIteration\n *     result = self.value()\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"done\");\n    __PYX_ERR(0, 2989, __pyx_L1_error)\n  }\n  __pyx_t_1 = (((struct __pyx_vtabstruct_9pywrapfst_ArcIterator *)__pyx_v_self->__pyx_vtab)->done(__pyx_v_self, 0) != 0);\n  if (__pyx_t_1) {\n\n    /* \"pywrapfst.pyx\":2990\n *   def __next__(self):\n *     if self.done():\n *       raise StopIteration             # <<<<<<<<<<<<<<\n *     result = self.value()\n *     self.next()\n */\n    __Pyx_Raise(__pyx_builtin_StopIteration, 0, 0, 0);\n    __PYX_ERR(0, 2990, __pyx_L1_error)\n\n    /* \"pywrapfst.pyx\":2989\n *   # Magic method used to get a Pythonic API out of the C++ API.\n *   def __next__(self):\n *     if self.done():             # <<<<<<<<<<<<<<\n *       raise StopIteration\n *     result = self.value()\n */\n  }\n\n  /* \"pywrapfst.pyx\":2991\n *     if self.done():\n *       raise StopIteration\n *     result = self.value()             # <<<<<<<<<<<<<<\n *     self.next()\n *     return result\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"value\");\n    __PYX_ERR(0, 2991, __pyx_L1_error)\n  }\n  __pyx_t_2 = ((struct __pyx_vtabstruct_9pywrapfst_ArcIterator *)__pyx_v_self->__pyx_vtab)->value(__pyx_v_self, 0); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 2991, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  __pyx_v_result = __pyx_t_2;\n  __pyx_t_2 = 0;\n\n  /* \"pywrapfst.pyx\":2992\n *       raise StopIteration\n *     result = self.value()\n *     self.next()             # <<<<<<<<<<<<<<\n *     return result\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"next\");\n    __PYX_ERR(0, 2992, __pyx_L1_error)\n  }\n  ((struct __pyx_vtabstruct_9pywrapfst_ArcIterator *)__pyx_v_self->__pyx_vtab)->next(__pyx_v_self, 0);\n\n  /* \"pywrapfst.pyx\":2993\n *     result = self.value()\n *     self.next()\n *     return result             # <<<<<<<<<<<<<<\n * \n *   cpdef bool done(self):\n */\n  __Pyx_XDECREF(__pyx_r);\n  __Pyx_INCREF(__pyx_v_result);\n  __pyx_r = __pyx_v_result;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":2988\n * \n *   # Magic method used to get a Pythonic API out of the C++ API.\n *   def __next__(self):             # <<<<<<<<<<<<<<\n *     if self.done():\n *       raise StopIteration\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_AddTraceback(\"pywrapfst.ArcIterator.__next__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XDECREF(__pyx_v_result);\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":2995\n *     return result\n * \n *   cpdef bool done(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     done(self)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_11ArcIterator_9done(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic bool __pyx_f_9pywrapfst_11ArcIterator_done(struct __pyx_obj_9pywrapfst_ArcIterator *__pyx_v_self, int __pyx_skip_dispatch) {\n  bool __pyx_r;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  bool __pyx_t_5;\n  __Pyx_RefNannySetupContext(\"done\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_done); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2995, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_11ArcIterator_9done)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 2995, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 2995, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __pyx_t_5 = __Pyx_PyObject_IsTrue(__pyx_t_2); if (unlikely((__pyx_t_5 == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 2995, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __pyx_r = __pyx_t_5;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":3004\n *       True if the iterator is exhausted, False otherwise.\n *     \"\"\"\n *     return self._aiter.get().Done()             # <<<<<<<<<<<<<<\n * \n *   cpdef uint32 flags(self):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_aiter\");\n    __PYX_ERR(0, 3004, __pyx_L1_error)\n  }\n  __pyx_r = __pyx_v_self->_aiter.get()->Done();\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":2995\n *     return result\n * \n *   cpdef bool done(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     done(self)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_WriteUnraisable(\"pywrapfst.ArcIterator.done\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_11ArcIterator_9done(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_11ArcIterator_8done[] = \"\\n    done(self)\\n\\n    Indicates whether the iterator is exhausted or not.\\n\\n    Returns:\\n      True if the iterator is exhausted, False otherwise.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_11ArcIterator_9done(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"done (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_11ArcIterator_8done(((struct __pyx_obj_9pywrapfst_ArcIterator *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_11ArcIterator_8done(struct __pyx_obj_9pywrapfst_ArcIterator *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"done\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __Pyx_PyBool_FromLong(__pyx_f_9pywrapfst_11ArcIterator_done(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2995, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.ArcIterator.done\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":3006\n *     return self._aiter.get().Done()\n * \n *   cpdef uint32 flags(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     flags(self)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_11ArcIterator_11flags(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic __pyx_t_10basictypes_uint32 __pyx_f_9pywrapfst_11ArcIterator_flags(struct __pyx_obj_9pywrapfst_ArcIterator *__pyx_v_self, int __pyx_skip_dispatch) {\n  __pyx_t_10basictypes_uint32 __pyx_r;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  __pyx_t_10basictypes_uint32 __pyx_t_5;\n  __Pyx_RefNannySetupContext(\"flags\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_flags); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3006, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_11ArcIterator_11flags)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3006, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3006, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __pyx_t_5 = __Pyx_PyInt_As_uint32_t(__pyx_t_2); if (unlikely((__pyx_t_5 == ((uint32_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 3006, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __pyx_r = __pyx_t_5;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":3015\n *       The current iterator behavioral flags as an integer.\n *     \"\"\"\n *     return self._aiter.get().Flags()             # <<<<<<<<<<<<<<\n * \n *   cpdef void next(self):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_aiter\");\n    __PYX_ERR(0, 3015, __pyx_L1_error)\n  }\n  __pyx_r = __pyx_v_self->_aiter.get()->Flags();\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":3006\n *     return self._aiter.get().Done()\n * \n *   cpdef uint32 flags(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     flags(self)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_WriteUnraisable(\"pywrapfst.ArcIterator.flags\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_11ArcIterator_11flags(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_11ArcIterator_10flags[] = \"\\n    flags(self)\\n\\n    Returns the current iterator behavioral flags.\\n\\n    Returns:\\n      The current iterator behavioral flags as an integer.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_11ArcIterator_11flags(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"flags (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_11ArcIterator_10flags(((struct __pyx_obj_9pywrapfst_ArcIterator *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_11ArcIterator_10flags(struct __pyx_obj_9pywrapfst_ArcIterator *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"flags\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __Pyx_PyInt_From_uint32_t(__pyx_f_9pywrapfst_11ArcIterator_flags(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3006, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.ArcIterator.flags\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":3017\n *     return self._aiter.get().Flags()\n * \n *   cpdef void next(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     next(self)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_11ArcIterator_13next(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic void __pyx_f_9pywrapfst_11ArcIterator_next(struct __pyx_obj_9pywrapfst_ArcIterator *__pyx_v_self, int __pyx_skip_dispatch) {\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  __Pyx_RefNannySetupContext(\"next\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_next); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3017, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_11ArcIterator_13next)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3017, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3017, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":3023\n *     Advances the iterator.\n *     \"\"\"\n *     self._aiter.get().Next()             # <<<<<<<<<<<<<<\n * \n *   cpdef size_t position(self):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_aiter\");\n    __PYX_ERR(0, 3023, __pyx_L1_error)\n  }\n  __pyx_v_self->_aiter.get()->Next();\n\n  /* \"pywrapfst.pyx\":3017\n *     return self._aiter.get().Flags()\n * \n *   cpdef void next(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     next(self)\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_WriteUnraisable(\"pywrapfst.ArcIterator.next\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_11ArcIterator_13next(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_11ArcIterator_12next[] = \"\\n    next(self)\\n\\n    Advances the iterator.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_11ArcIterator_13next(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"next (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_11ArcIterator_12next(((struct __pyx_obj_9pywrapfst_ArcIterator *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_11ArcIterator_12next(struct __pyx_obj_9pywrapfst_ArcIterator *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"next\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __Pyx_void_to_None(__pyx_f_9pywrapfst_11ArcIterator_next(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3017, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.ArcIterator.next\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":3025\n *     self._aiter.get().Next()\n * \n *   cpdef size_t position(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     position(self)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_11ArcIterator_15position(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic size_t __pyx_f_9pywrapfst_11ArcIterator_position(struct __pyx_obj_9pywrapfst_ArcIterator *__pyx_v_self, int __pyx_skip_dispatch) {\n  size_t __pyx_r;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  size_t __pyx_t_5;\n  __Pyx_RefNannySetupContext(\"position\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_position); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3025, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_11ArcIterator_15position)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3025, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3025, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __pyx_t_5 = __Pyx_PyInt_As_size_t(__pyx_t_2); if (unlikely((__pyx_t_5 == (size_t)-1) && PyErr_Occurred())) __PYX_ERR(0, 3025, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __pyx_r = __pyx_t_5;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":3034\n *       The iterator's position, expressed as an integer.\n *     \"\"\"\n *     return self._aiter.get().Position()             # <<<<<<<<<<<<<<\n * \n *   cpdef void reset(self):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_aiter\");\n    __PYX_ERR(0, 3034, __pyx_L1_error)\n  }\n  __pyx_r = __pyx_v_self->_aiter.get()->Position();\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":3025\n *     self._aiter.get().Next()\n * \n *   cpdef size_t position(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     position(self)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_WriteUnraisable(\"pywrapfst.ArcIterator.position\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_11ArcIterator_15position(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_11ArcIterator_14position[] = \"\\n    position(self)\\n\\n    Returns the position of the iterator.\\n\\n    Returns:\\n      The iterator's position, expressed as an integer.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_11ArcIterator_15position(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"position (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_11ArcIterator_14position(((struct __pyx_obj_9pywrapfst_ArcIterator *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_11ArcIterator_14position(struct __pyx_obj_9pywrapfst_ArcIterator *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"position\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __Pyx_PyInt_FromSize_t(__pyx_f_9pywrapfst_11ArcIterator_position(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3025, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.ArcIterator.position\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":3036\n *     return self._aiter.get().Position()\n * \n *   cpdef void reset(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     reset(self)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_11ArcIterator_17reset(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic void __pyx_f_9pywrapfst_11ArcIterator_reset(struct __pyx_obj_9pywrapfst_ArcIterator *__pyx_v_self, int __pyx_skip_dispatch) {\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  __Pyx_RefNannySetupContext(\"reset\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_reset); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3036, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_11ArcIterator_17reset)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3036, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3036, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":3042\n *     Resets the iterator to the initial position.\n *     \"\"\"\n *     self._aiter.get().Reset()             # <<<<<<<<<<<<<<\n * \n *   cpdef void seek(self, size_t a):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_aiter\");\n    __PYX_ERR(0, 3042, __pyx_L1_error)\n  }\n  __pyx_v_self->_aiter.get()->Reset();\n\n  /* \"pywrapfst.pyx\":3036\n *     return self._aiter.get().Position()\n * \n *   cpdef void reset(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     reset(self)\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_WriteUnraisable(\"pywrapfst.ArcIterator.reset\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_11ArcIterator_17reset(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_11ArcIterator_16reset[] = \"\\n    reset(self)\\n\\n    Resets the iterator to the initial position.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_11ArcIterator_17reset(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"reset (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_11ArcIterator_16reset(((struct __pyx_obj_9pywrapfst_ArcIterator *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_11ArcIterator_16reset(struct __pyx_obj_9pywrapfst_ArcIterator *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"reset\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __Pyx_void_to_None(__pyx_f_9pywrapfst_11ArcIterator_reset(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3036, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.ArcIterator.reset\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":3044\n *     self._aiter.get().Reset()\n * \n *   cpdef void seek(self, size_t a):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     seek(self, a)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_11ArcIterator_19seek(PyObject *__pyx_v_self, PyObject *__pyx_arg_a); /*proto*/\nstatic void __pyx_f_9pywrapfst_11ArcIterator_seek(struct __pyx_obj_9pywrapfst_ArcIterator *__pyx_v_self, size_t __pyx_v_a, int __pyx_skip_dispatch) {\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  PyObject *__pyx_t_6 = NULL;\n  __Pyx_RefNannySetupContext(\"seek\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_seek); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3044, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_11ArcIterator_19seek)) {\n      __pyx_t_3 = __Pyx_PyInt_FromSize_t(__pyx_v_a); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 3044, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_3);\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_4 = __pyx_t_1; __pyx_t_5 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_4))) {\n        __pyx_t_5 = PyMethod_GET_SELF(__pyx_t_4);\n        if (likely(__pyx_t_5)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_4);\n          __Pyx_INCREF(__pyx_t_5);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_4, function);\n        }\n      }\n      if (!__pyx_t_5) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_4, __pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3044, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n        __Pyx_GOTREF(__pyx_t_2);\n      } else {\n        #if CYTHON_FAST_PYCALL\n        if (PyFunction_Check(__pyx_t_4)) {\n          PyObject *__pyx_temp[2] = {__pyx_t_5, __pyx_t_3};\n          __pyx_t_2 = __Pyx_PyFunction_FastCall(__pyx_t_4, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3044, __pyx_L1_error)\n          __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;\n          __Pyx_GOTREF(__pyx_t_2);\n          __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n        } else\n        #endif\n        #if CYTHON_FAST_PYCCALL\n        if (__Pyx_PyFastCFunction_Check(__pyx_t_4)) {\n          PyObject *__pyx_temp[2] = {__pyx_t_5, __pyx_t_3};\n          __pyx_t_2 = __Pyx_PyCFunction_FastCall(__pyx_t_4, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3044, __pyx_L1_error)\n          __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;\n          __Pyx_GOTREF(__pyx_t_2);\n          __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n        } else\n        #endif\n        {\n          __pyx_t_6 = PyTuple_New(1+1); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 3044, __pyx_L1_error)\n          __Pyx_GOTREF(__pyx_t_6);\n          __Pyx_GIVEREF(__pyx_t_5); PyTuple_SET_ITEM(__pyx_t_6, 0, __pyx_t_5); __pyx_t_5 = NULL;\n          __Pyx_GIVEREF(__pyx_t_3);\n          PyTuple_SET_ITEM(__pyx_t_6, 0+1, __pyx_t_3);\n          __pyx_t_3 = 0;\n          __pyx_t_2 = __Pyx_PyObject_Call(__pyx_t_4, __pyx_t_6, NULL); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3044, __pyx_L1_error)\n          __Pyx_GOTREF(__pyx_t_2);\n          __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n        }\n      }\n      __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":3053\n *       a: The position to seek to.\n *     \"\"\"\n *     self._aiter.get().Seek(a)             # <<<<<<<<<<<<<<\n * \n *   cpdef void set_flags(self, uint32 flags, uint32 mask):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_aiter\");\n    __PYX_ERR(0, 3053, __pyx_L1_error)\n  }\n  __pyx_v_self->_aiter.get()->Seek(__pyx_v_a);\n\n  /* \"pywrapfst.pyx\":3044\n *     self._aiter.get().Reset()\n * \n *   cpdef void seek(self, size_t a):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     seek(self, a)\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_XDECREF(__pyx_t_6);\n  __Pyx_WriteUnraisable(\"pywrapfst.ArcIterator.seek\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_11ArcIterator_19seek(PyObject *__pyx_v_self, PyObject *__pyx_arg_a); /*proto*/\nstatic char __pyx_doc_9pywrapfst_11ArcIterator_18seek[] = \"\\n    seek(self, a)\\n\\n    Advance the iterator to a new position.\\n\\n    Args:\\n      a: The position to seek to.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_11ArcIterator_19seek(PyObject *__pyx_v_self, PyObject *__pyx_arg_a) {\n  size_t __pyx_v_a;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"seek (wrapper)\", 0);\n  assert(__pyx_arg_a); {\n    __pyx_v_a = __Pyx_PyInt_As_size_t(__pyx_arg_a); if (unlikely((__pyx_v_a == (size_t)-1) && PyErr_Occurred())) __PYX_ERR(0, 3044, __pyx_L3_error)\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst.ArcIterator.seek\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  __pyx_r = __pyx_pf_9pywrapfst_11ArcIterator_18seek(((struct __pyx_obj_9pywrapfst_ArcIterator *)__pyx_v_self), ((size_t)__pyx_v_a));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_11ArcIterator_18seek(struct __pyx_obj_9pywrapfst_ArcIterator *__pyx_v_self, size_t __pyx_v_a) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"seek\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __Pyx_void_to_None(__pyx_f_9pywrapfst_11ArcIterator_seek(__pyx_v_self, __pyx_v_a, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3044, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.ArcIterator.seek\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":3055\n *     self._aiter.get().Seek(a)\n * \n *   cpdef void set_flags(self, uint32 flags, uint32 mask):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     set_flags(self, flags, mask)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_11ArcIterator_21set_flags(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic void __pyx_f_9pywrapfst_11ArcIterator_set_flags(struct __pyx_obj_9pywrapfst_ArcIterator *__pyx_v_self, __pyx_t_10basictypes_uint32 __pyx_v_flags, __pyx_t_10basictypes_uint32 __pyx_v_mask, int __pyx_skip_dispatch) {\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  PyObject *__pyx_t_6 = NULL;\n  int __pyx_t_7;\n  PyObject *__pyx_t_8 = NULL;\n  __Pyx_RefNannySetupContext(\"set_flags\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_set_flags); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3055, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_11ArcIterator_21set_flags)) {\n      __pyx_t_3 = __Pyx_PyInt_From_uint32_t(__pyx_v_flags); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 3055, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_3);\n      __pyx_t_4 = __Pyx_PyInt_From_uint32_t(__pyx_v_mask); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 3055, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_4);\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_5 = __pyx_t_1; __pyx_t_6 = NULL;\n      __pyx_t_7 = 0;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_5))) {\n        __pyx_t_6 = PyMethod_GET_SELF(__pyx_t_5);\n        if (likely(__pyx_t_6)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_5);\n          __Pyx_INCREF(__pyx_t_6);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_5, function);\n          __pyx_t_7 = 1;\n        }\n      }\n      #if CYTHON_FAST_PYCALL\n      if (PyFunction_Check(__pyx_t_5)) {\n        PyObject *__pyx_temp[3] = {__pyx_t_6, __pyx_t_3, __pyx_t_4};\n        __pyx_t_2 = __Pyx_PyFunction_FastCall(__pyx_t_5, __pyx_temp+1-__pyx_t_7, 2+__pyx_t_7); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3055, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_6); __pyx_t_6 = 0;\n        __Pyx_GOTREF(__pyx_t_2);\n        __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else\n      #endif\n      #if CYTHON_FAST_PYCCALL\n      if (__Pyx_PyFastCFunction_Check(__pyx_t_5)) {\n        PyObject *__pyx_temp[3] = {__pyx_t_6, __pyx_t_3, __pyx_t_4};\n        __pyx_t_2 = __Pyx_PyCFunction_FastCall(__pyx_t_5, __pyx_temp+1-__pyx_t_7, 2+__pyx_t_7); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3055, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_6); __pyx_t_6 = 0;\n        __Pyx_GOTREF(__pyx_t_2);\n        __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else\n      #endif\n      {\n        __pyx_t_8 = PyTuple_New(2+__pyx_t_7); if (unlikely(!__pyx_t_8)) __PYX_ERR(0, 3055, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_8);\n        if (__pyx_t_6) {\n          __Pyx_GIVEREF(__pyx_t_6); PyTuple_SET_ITEM(__pyx_t_8, 0, __pyx_t_6); __pyx_t_6 = NULL;\n        }\n        __Pyx_GIVEREF(__pyx_t_3);\n        PyTuple_SET_ITEM(__pyx_t_8, 0+__pyx_t_7, __pyx_t_3);\n        __Pyx_GIVEREF(__pyx_t_4);\n        PyTuple_SET_ITEM(__pyx_t_8, 1+__pyx_t_7, __pyx_t_4);\n        __pyx_t_3 = 0;\n        __pyx_t_4 = 0;\n        __pyx_t_2 = __Pyx_PyObject_Call(__pyx_t_5, __pyx_t_8, NULL); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3055, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_2);\n        __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0;\n      }\n      __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":3065\n *       mask: A mask to be applied to the `flags` argument before setting them.\n *     \"\"\"\n *     self._aiter.get().SetFlags(flags, mask)             # <<<<<<<<<<<<<<\n * \n *   cpdef object value(self):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_aiter\");\n    __PYX_ERR(0, 3065, __pyx_L1_error)\n  }\n  __pyx_v_self->_aiter.get()->SetFlags(__pyx_v_flags, __pyx_v_mask);\n\n  /* \"pywrapfst.pyx\":3055\n *     self._aiter.get().Seek(a)\n * \n *   cpdef void set_flags(self, uint32 flags, uint32 mask):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     set_flags(self, flags, mask)\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_XDECREF(__pyx_t_6);\n  __Pyx_XDECREF(__pyx_t_8);\n  __Pyx_WriteUnraisable(\"pywrapfst.ArcIterator.set_flags\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_11ArcIterator_21set_flags(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic char __pyx_doc_9pywrapfst_11ArcIterator_20set_flags[] = \"\\n    set_flags(self, flags, mask)\\n\\n    Sets the current iterator behavioral flags.\\n\\n    Args:\\n      flags: The properties to be set.\\n      mask: A mask to be applied to the `flags` argument before setting them.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_11ArcIterator_21set_flags(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  __pyx_t_10basictypes_uint32 __pyx_v_flags;\n  __pyx_t_10basictypes_uint32 __pyx_v_mask;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"set_flags (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_flags,&__pyx_n_s_mask,0};\n    PyObject* values[2] = {0,0};\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (likely((values[0] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_flags)) != 0)) kw_args--;\n        else goto __pyx_L5_argtuple_error;\n        CYTHON_FALLTHROUGH;\n        case  1:\n        if (likely((values[1] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_mask)) != 0)) kw_args--;\n        else {\n          __Pyx_RaiseArgtupleInvalid(\"set_flags\", 1, 2, 2, 1); __PYX_ERR(0, 3055, __pyx_L3_error)\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"set_flags\") < 0)) __PYX_ERR(0, 3055, __pyx_L3_error)\n      }\n    } else if (PyTuple_GET_SIZE(__pyx_args) != 2) {\n      goto __pyx_L5_argtuple_error;\n    } else {\n      values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n      values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n    }\n    __pyx_v_flags = __Pyx_PyInt_As_uint32_t(values[0]); if (unlikely((__pyx_v_flags == ((uint32_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 3055, __pyx_L3_error)\n    __pyx_v_mask = __Pyx_PyInt_As_uint32_t(values[1]); if (unlikely((__pyx_v_mask == ((uint32_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 3055, __pyx_L3_error)\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"set_flags\", 1, 2, 2, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 3055, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst.ArcIterator.set_flags\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  __pyx_r = __pyx_pf_9pywrapfst_11ArcIterator_20set_flags(((struct __pyx_obj_9pywrapfst_ArcIterator *)__pyx_v_self), __pyx_v_flags, __pyx_v_mask);\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_11ArcIterator_20set_flags(struct __pyx_obj_9pywrapfst_ArcIterator *__pyx_v_self, __pyx_t_10basictypes_uint32 __pyx_v_flags, __pyx_t_10basictypes_uint32 __pyx_v_mask) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"set_flags\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __Pyx_void_to_None(__pyx_f_9pywrapfst_11ArcIterator_set_flags(__pyx_v_self, __pyx_v_flags, __pyx_v_mask, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3055, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.ArcIterator.set_flags\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":3067\n *     self._aiter.get().SetFlags(flags, mask)\n * \n *   cpdef object value(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     value(self)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_11ArcIterator_23value(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic PyObject *__pyx_f_9pywrapfst_11ArcIterator_value(struct __pyx_obj_9pywrapfst_ArcIterator *__pyx_v_self, int __pyx_skip_dispatch) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  __Pyx_RefNannySetupContext(\"value\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_value); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3067, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_11ArcIterator_23value)) {\n      __Pyx_XDECREF(__pyx_r);\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3067, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3067, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __pyx_r = __pyx_t_2;\n      __pyx_t_2 = 0;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":3073\n *     Returns the current arc.\n *     \"\"\"\n *     return _init_Arc(self._aiter.get().Value())             # <<<<<<<<<<<<<<\n * \n * \n */\n  __Pyx_XDECREF(__pyx_r);\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_aiter\");\n    __PYX_ERR(0, 3073, __pyx_L1_error)\n  }\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst__init_Arc(__pyx_v_self->_aiter.get()->Value())); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3073, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":3067\n *     self._aiter.get().SetFlags(flags, mask)\n * \n *   cpdef object value(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     value(self)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_AddTraceback(\"pywrapfst.ArcIterator.value\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_11ArcIterator_23value(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_11ArcIterator_22value[] = \"\\n    value(self)\\n\\n    Returns the current arc.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_11ArcIterator_23value(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"value (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_11ArcIterator_22value(((struct __pyx_obj_9pywrapfst_ArcIterator *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_11ArcIterator_22value(struct __pyx_obj_9pywrapfst_ArcIterator *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"value\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __pyx_f_9pywrapfst_11ArcIterator_value(__pyx_v_self, 1); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3067, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.ArcIterator.value\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"(tree fragment)\":1\n * def __reduce_cython__(self):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._aiter,self._fst cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_11ArcIterator_25__reduce_cython__(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_11ArcIterator_25__reduce_cython__(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__reduce_cython__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_11ArcIterator_24__reduce_cython__(((struct __pyx_obj_9pywrapfst_ArcIterator *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_11ArcIterator_24__reduce_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst_ArcIterator *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"__reduce_cython__\", 0);\n\n  /* \"(tree fragment)\":2\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._aiter,self._fst cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._aiter,self._fst cannot be converted to a Python object for pickling\")\n */\n  __pyx_t_1 = __Pyx_PyObject_Call(__pyx_builtin_TypeError, __pyx_tuple__60, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(1, 2, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __Pyx_Raise(__pyx_t_1, 0, 0, 0);\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  __PYX_ERR(1, 2, __pyx_L1_error)\n\n  /* \"(tree fragment)\":1\n * def __reduce_cython__(self):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._aiter,self._fst cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.ArcIterator.__reduce_cython__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"(tree fragment)\":3\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._aiter,self._fst cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._aiter,self._fst cannot be converted to a Python object for pickling\")\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_11ArcIterator_27__setstate_cython__(PyObject *__pyx_v_self, PyObject *__pyx_v___pyx_state); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_11ArcIterator_27__setstate_cython__(PyObject *__pyx_v_self, PyObject *__pyx_v___pyx_state) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__setstate_cython__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_11ArcIterator_26__setstate_cython__(((struct __pyx_obj_9pywrapfst_ArcIterator *)__pyx_v_self), ((PyObject *)__pyx_v___pyx_state));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_11ArcIterator_26__setstate_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst_ArcIterator *__pyx_v_self, CYTHON_UNUSED PyObject *__pyx_v___pyx_state) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"__setstate_cython__\", 0);\n\n  /* \"(tree fragment)\":4\n *     raise TypeError(\"self._aiter,self._fst cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._aiter,self._fst cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n */\n  __pyx_t_1 = __Pyx_PyObject_Call(__pyx_builtin_TypeError, __pyx_tuple__61, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(1, 4, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __Pyx_Raise(__pyx_t_1, 0, 0, 0);\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  __PYX_ERR(1, 4, __pyx_L1_error)\n\n  /* \"(tree fragment)\":3\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._aiter,self._fst cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._aiter,self._fst cannot be converted to a Python object for pickling\")\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.ArcIterator.__setstate_cython__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":3085\n *   \"\"\"\n * \n *   def __repr__(self):             # <<<<<<<<<<<<<<\n *     return \"<MutableArcIterator at 0x{:x}>\".format(id(self))\n * \n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_18MutableArcIterator_1__repr__(PyObject *__pyx_v_self); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_18MutableArcIterator_1__repr__(PyObject *__pyx_v_self) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__repr__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_18MutableArcIterator___repr__(((struct __pyx_obj_9pywrapfst_MutableArcIterator *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_18MutableArcIterator___repr__(struct __pyx_obj_9pywrapfst_MutableArcIterator *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  __Pyx_RefNannySetupContext(\"__repr__\", 0);\n\n  /* \"pywrapfst.pyx\":3086\n * \n *   def __repr__(self):\n *     return \"<MutableArcIterator at 0x{:x}>\".format(id(self))             # <<<<<<<<<<<<<<\n * \n *   def __init__(self, _MutableFst ifst, int64 state):\n */\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_2 = __Pyx_PyObject_GetAttrStr(__pyx_kp_s_MutableArcIterator_at_0x_x, __pyx_n_s_format); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3086, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  __pyx_t_3 = PyTuple_New(1); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 3086, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_3);\n  __Pyx_INCREF(((PyObject *)__pyx_v_self));\n  __Pyx_GIVEREF(((PyObject *)__pyx_v_self));\n  PyTuple_SET_ITEM(__pyx_t_3, 0, ((PyObject *)__pyx_v_self));\n  __pyx_t_4 = __Pyx_PyObject_Call(__pyx_builtin_id, __pyx_t_3, NULL); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 3086, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_4);\n  __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n  __pyx_t_3 = NULL;\n  if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_2))) {\n    __pyx_t_3 = PyMethod_GET_SELF(__pyx_t_2);\n    if (likely(__pyx_t_3)) {\n      PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_2);\n      __Pyx_INCREF(__pyx_t_3);\n      __Pyx_INCREF(function);\n      __Pyx_DECREF_SET(__pyx_t_2, function);\n    }\n  }\n  if (!__pyx_t_3) {\n    __pyx_t_1 = __Pyx_PyObject_CallOneArg(__pyx_t_2, __pyx_t_4); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3086, __pyx_L1_error)\n    __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n    __Pyx_GOTREF(__pyx_t_1);\n  } else {\n    #if CYTHON_FAST_PYCALL\n    if (PyFunction_Check(__pyx_t_2)) {\n      PyObject *__pyx_temp[2] = {__pyx_t_3, __pyx_t_4};\n      __pyx_t_1 = __Pyx_PyFunction_FastCall(__pyx_t_2, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3086, __pyx_L1_error)\n      __Pyx_XDECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __Pyx_GOTREF(__pyx_t_1);\n      __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n    } else\n    #endif\n    #if CYTHON_FAST_PYCCALL\n    if (__Pyx_PyFastCFunction_Check(__pyx_t_2)) {\n      PyObject *__pyx_temp[2] = {__pyx_t_3, __pyx_t_4};\n      __pyx_t_1 = __Pyx_PyCFunction_FastCall(__pyx_t_2, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3086, __pyx_L1_error)\n      __Pyx_XDECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __Pyx_GOTREF(__pyx_t_1);\n      __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n    } else\n    #endif\n    {\n      __pyx_t_5 = PyTuple_New(1+1); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 3086, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_5);\n      __Pyx_GIVEREF(__pyx_t_3); PyTuple_SET_ITEM(__pyx_t_5, 0, __pyx_t_3); __pyx_t_3 = NULL;\n      __Pyx_GIVEREF(__pyx_t_4);\n      PyTuple_SET_ITEM(__pyx_t_5, 0+1, __pyx_t_4);\n      __pyx_t_4 = 0;\n      __pyx_t_1 = __Pyx_PyObject_Call(__pyx_t_2, __pyx_t_5, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3086, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_1);\n      __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n    }\n  }\n  __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":3085\n *   \"\"\"\n * \n *   def __repr__(self):             # <<<<<<<<<<<<<<\n *     return \"<MutableArcIterator at 0x{:x}>\".format(id(self))\n * \n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_AddTraceback(\"pywrapfst.MutableArcIterator.__repr__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":3088\n *     return \"<MutableArcIterator at 0x{:x}>\".format(id(self))\n * \n *   def __init__(self, _MutableFst ifst, int64 state):             # <<<<<<<<<<<<<<\n *     if not ifst._fst.get().ValidStateId(state):\n *       raise FstIndexError(\"State index out of range\")\n */\n\n/* Python wrapper */\nstatic int __pyx_pw_9pywrapfst_18MutableArcIterator_3__init__(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic int __pyx_pw_9pywrapfst_18MutableArcIterator_3__init__(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_ifst = 0;\n  __pyx_t_10basictypes_int64 __pyx_v_state;\n  int __pyx_r;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__init__ (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_ifst,&__pyx_n_s_state,0};\n    PyObject* values[2] = {0,0};\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (likely((values[0] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_ifst)) != 0)) kw_args--;\n        else goto __pyx_L5_argtuple_error;\n        CYTHON_FALLTHROUGH;\n        case  1:\n        if (likely((values[1] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_state)) != 0)) kw_args--;\n        else {\n          __Pyx_RaiseArgtupleInvalid(\"__init__\", 1, 2, 2, 1); __PYX_ERR(0, 3088, __pyx_L3_error)\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"__init__\") < 0)) __PYX_ERR(0, 3088, __pyx_L3_error)\n      }\n    } else if (PyTuple_GET_SIZE(__pyx_args) != 2) {\n      goto __pyx_L5_argtuple_error;\n    } else {\n      values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n      values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n    }\n    __pyx_v_ifst = ((struct __pyx_obj_9pywrapfst__MutableFst *)values[0]);\n    __pyx_v_state = __Pyx_PyInt_As_int64_t(values[1]); if (unlikely((__pyx_v_state == ((int64_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 3088, __pyx_L3_error)\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"__init__\", 1, 2, 2, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 3088, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst.MutableArcIterator.__init__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return -1;\n  __pyx_L4_argument_unpacking_done:;\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_ifst), __pyx_ptype_9pywrapfst__MutableFst, 1, \"ifst\", 0))) __PYX_ERR(0, 3088, __pyx_L1_error)\n  __pyx_r = __pyx_pf_9pywrapfst_18MutableArcIterator_2__init__(((struct __pyx_obj_9pywrapfst_MutableArcIterator *)__pyx_v_self), __pyx_v_ifst, __pyx_v_state);\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __pyx_r = -1;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic int __pyx_pf_9pywrapfst_18MutableArcIterator_2__init__(struct __pyx_obj_9pywrapfst_MutableArcIterator *__pyx_v_self, struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_ifst, __pyx_t_10basictypes_int64 __pyx_v_state) {\n  int __pyx_r;\n  __Pyx_RefNannyDeclarations\n  int __pyx_t_1;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  std::shared_ptr<fst::script::MutableFstClass>  __pyx_t_4;\n  __Pyx_RefNannySetupContext(\"__init__\", 0);\n\n  /* \"pywrapfst.pyx\":3089\n * \n *   def __init__(self, _MutableFst ifst, int64 state):\n *     if not ifst._fst.get().ValidStateId(state):             # <<<<<<<<<<<<<<\n *       raise FstIndexError(\"State index out of range\")\n *     # Makes copy of the shared_ptr, potentially extending the FST's lifetime.\n */\n  if (unlikely(((PyObject *)__pyx_v_ifst) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 3089, __pyx_L1_error)\n  }\n  __pyx_t_1 = ((!(__pyx_v_ifst->__pyx_base._fst.get()->ValidStateId(__pyx_v_state) != 0)) != 0);\n  if (__pyx_t_1) {\n\n    /* \"pywrapfst.pyx\":3090\n *   def __init__(self, _MutableFst ifst, int64 state):\n *     if not ifst._fst.get().ValidStateId(state):\n *       raise FstIndexError(\"State index out of range\")             # <<<<<<<<<<<<<<\n *     # Makes copy of the shared_ptr, potentially extending the FST's lifetime.\n *     self._mfst = ifst._mfst\n */\n    __pyx_t_2 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstIndexError); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3090, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_2);\n    __pyx_t_3 = __Pyx_PyObject_Call(__pyx_t_2, __pyx_tuple__62, NULL); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 3090, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_3);\n    __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n    __Pyx_Raise(__pyx_t_3, 0, 0, 0);\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    __PYX_ERR(0, 3090, __pyx_L1_error)\n\n    /* \"pywrapfst.pyx\":3089\n * \n *   def __init__(self, _MutableFst ifst, int64 state):\n *     if not ifst._fst.get().ValidStateId(state):             # <<<<<<<<<<<<<<\n *       raise FstIndexError(\"State index out of range\")\n *     # Makes copy of the shared_ptr, potentially extending the FST's lifetime.\n */\n  }\n\n  /* \"pywrapfst.pyx\":3092\n *       raise FstIndexError(\"State index out of range\")\n *     # Makes copy of the shared_ptr, potentially extending the FST's lifetime.\n *     self._mfst = ifst._mfst             # <<<<<<<<<<<<<<\n *     self._aiter.reset(new fst.MutableArcIteratorClass(ifst._mfst.get(), state))\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_ifst) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_mfst\");\n    __PYX_ERR(0, 3092, __pyx_L1_error)\n  }\n  __pyx_t_4 = __pyx_v_ifst->_mfst;\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_mfst\");\n    __PYX_ERR(0, 3092, __pyx_L1_error)\n  }\n  __pyx_v_self->_mfst = __pyx_t_4;\n\n  /* \"pywrapfst.pyx\":3093\n *     # Makes copy of the shared_ptr, potentially extending the FST's lifetime.\n *     self._mfst = ifst._mfst\n *     self._aiter.reset(new fst.MutableArcIteratorClass(ifst._mfst.get(), state))             # <<<<<<<<<<<<<<\n * \n *   cpdef bool done(self):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_aiter\");\n    __PYX_ERR(0, 3093, __pyx_L1_error)\n  }\n  if (unlikely(((PyObject *)__pyx_v_ifst) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_mfst\");\n    __PYX_ERR(0, 3093, __pyx_L1_error)\n  }\n  __pyx_v_self->_aiter.reset(new fst::script::MutableArcIteratorClass(__pyx_v_ifst->_mfst.get(), __pyx_v_state));\n\n  /* \"pywrapfst.pyx\":3088\n *     return \"<MutableArcIterator at 0x{:x}>\".format(id(self))\n * \n *   def __init__(self, _MutableFst ifst, int64 state):             # <<<<<<<<<<<<<<\n *     if not ifst._fst.get().ValidStateId(state):\n *       raise FstIndexError(\"State index out of range\")\n */\n\n  /* function exit code */\n  __pyx_r = 0;\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_AddTraceback(\"pywrapfst.MutableArcIterator.__init__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = -1;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":3095\n *     self._aiter.reset(new fst.MutableArcIteratorClass(ifst._mfst.get(), state))\n * \n *   cpdef bool done(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     done(self)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_18MutableArcIterator_5done(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic bool __pyx_f_9pywrapfst_18MutableArcIterator_done(struct __pyx_obj_9pywrapfst_MutableArcIterator *__pyx_v_self, int __pyx_skip_dispatch) {\n  bool __pyx_r;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  bool __pyx_t_5;\n  __Pyx_RefNannySetupContext(\"done\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_done); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3095, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_18MutableArcIterator_5done)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3095, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3095, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __pyx_t_5 = __Pyx_PyObject_IsTrue(__pyx_t_2); if (unlikely((__pyx_t_5 == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 3095, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __pyx_r = __pyx_t_5;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":3104\n *       True if the iterator is exhausted, False otherwise.\n *     \"\"\"\n *     return self._aiter.get().Done()             # <<<<<<<<<<<<<<\n * \n *   cpdef uint32 flags(self):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_aiter\");\n    __PYX_ERR(0, 3104, __pyx_L1_error)\n  }\n  __pyx_r = __pyx_v_self->_aiter.get()->Done();\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":3095\n *     self._aiter.reset(new fst.MutableArcIteratorClass(ifst._mfst.get(), state))\n * \n *   cpdef bool done(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     done(self)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_WriteUnraisable(\"pywrapfst.MutableArcIterator.done\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_18MutableArcIterator_5done(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_18MutableArcIterator_4done[] = \"\\n    done(self)\\n\\n    Indicates whether the iterator is exhausted or not.\\n\\n    Returns:\\n      True if the iterator is exhausted, False otherwise.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_18MutableArcIterator_5done(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"done (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_18MutableArcIterator_4done(((struct __pyx_obj_9pywrapfst_MutableArcIterator *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_18MutableArcIterator_4done(struct __pyx_obj_9pywrapfst_MutableArcIterator *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"done\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __Pyx_PyBool_FromLong(__pyx_f_9pywrapfst_18MutableArcIterator_done(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3095, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.MutableArcIterator.done\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":3106\n *     return self._aiter.get().Done()\n * \n *   cpdef uint32 flags(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     flags(self)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_18MutableArcIterator_7flags(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic __pyx_t_10basictypes_uint32 __pyx_f_9pywrapfst_18MutableArcIterator_flags(struct __pyx_obj_9pywrapfst_MutableArcIterator *__pyx_v_self, int __pyx_skip_dispatch) {\n  __pyx_t_10basictypes_uint32 __pyx_r;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  __pyx_t_10basictypes_uint32 __pyx_t_5;\n  __Pyx_RefNannySetupContext(\"flags\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_flags); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3106, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_18MutableArcIterator_7flags)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3106, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3106, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __pyx_t_5 = __Pyx_PyInt_As_uint32_t(__pyx_t_2); if (unlikely((__pyx_t_5 == ((uint32_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 3106, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __pyx_r = __pyx_t_5;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":3115\n *       The current iterator behavioral flags as an integer.\n *     \"\"\"\n *     return self._aiter.get().Flags()             # <<<<<<<<<<<<<<\n * \n *   cpdef void next(self):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_aiter\");\n    __PYX_ERR(0, 3115, __pyx_L1_error)\n  }\n  __pyx_r = __pyx_v_self->_aiter.get()->Flags();\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":3106\n *     return self._aiter.get().Done()\n * \n *   cpdef uint32 flags(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     flags(self)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_WriteUnraisable(\"pywrapfst.MutableArcIterator.flags\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_18MutableArcIterator_7flags(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_18MutableArcIterator_6flags[] = \"\\n    flags(self)\\n\\n    Returns the current iterator behavioral flags.\\n\\n    Returns:\\n      The current iterator behavioral flags as an integer.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_18MutableArcIterator_7flags(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"flags (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_18MutableArcIterator_6flags(((struct __pyx_obj_9pywrapfst_MutableArcIterator *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_18MutableArcIterator_6flags(struct __pyx_obj_9pywrapfst_MutableArcIterator *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"flags\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __Pyx_PyInt_From_uint32_t(__pyx_f_9pywrapfst_18MutableArcIterator_flags(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3106, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.MutableArcIterator.flags\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":3117\n *     return self._aiter.get().Flags()\n * \n *   cpdef void next(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     next(self)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_18MutableArcIterator_9next(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic void __pyx_f_9pywrapfst_18MutableArcIterator_next(struct __pyx_obj_9pywrapfst_MutableArcIterator *__pyx_v_self, int __pyx_skip_dispatch) {\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  __Pyx_RefNannySetupContext(\"next\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_next); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3117, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_18MutableArcIterator_9next)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3117, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3117, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":3123\n *     Advances the iterator.\n *     \"\"\"\n *     self._aiter.get().Next()             # <<<<<<<<<<<<<<\n * \n *   cpdef size_t position(self):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_aiter\");\n    __PYX_ERR(0, 3123, __pyx_L1_error)\n  }\n  __pyx_v_self->_aiter.get()->Next();\n\n  /* \"pywrapfst.pyx\":3117\n *     return self._aiter.get().Flags()\n * \n *   cpdef void next(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     next(self)\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_WriteUnraisable(\"pywrapfst.MutableArcIterator.next\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_18MutableArcIterator_9next(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_18MutableArcIterator_8next[] = \"\\n    next(self)\\n\\n    Advances the iterator.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_18MutableArcIterator_9next(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"next (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_18MutableArcIterator_8next(((struct __pyx_obj_9pywrapfst_MutableArcIterator *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_18MutableArcIterator_8next(struct __pyx_obj_9pywrapfst_MutableArcIterator *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"next\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __Pyx_void_to_None(__pyx_f_9pywrapfst_18MutableArcIterator_next(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3117, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.MutableArcIterator.next\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":3125\n *     self._aiter.get().Next()\n * \n *   cpdef size_t position(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     position(self)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_18MutableArcIterator_11position(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic size_t __pyx_f_9pywrapfst_18MutableArcIterator_position(struct __pyx_obj_9pywrapfst_MutableArcIterator *__pyx_v_self, int __pyx_skip_dispatch) {\n  size_t __pyx_r;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  size_t __pyx_t_5;\n  __Pyx_RefNannySetupContext(\"position\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_position); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3125, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_18MutableArcIterator_11position)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3125, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3125, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __pyx_t_5 = __Pyx_PyInt_As_size_t(__pyx_t_2); if (unlikely((__pyx_t_5 == (size_t)-1) && PyErr_Occurred())) __PYX_ERR(0, 3125, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __pyx_r = __pyx_t_5;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":3134\n *       The iterator's position, expressed as an integer.\n *     \"\"\"\n *     return self._aiter.get().Position()             # <<<<<<<<<<<<<<\n * \n *   cpdef void reset(self):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_aiter\");\n    __PYX_ERR(0, 3134, __pyx_L1_error)\n  }\n  __pyx_r = __pyx_v_self->_aiter.get()->Position();\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":3125\n *     self._aiter.get().Next()\n * \n *   cpdef size_t position(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     position(self)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_WriteUnraisable(\"pywrapfst.MutableArcIterator.position\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_18MutableArcIterator_11position(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_18MutableArcIterator_10position[] = \"\\n    position(self)\\n\\n    Returns the position of the iterator.\\n\\n    Returns:\\n      The iterator's position, expressed as an integer.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_18MutableArcIterator_11position(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"position (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_18MutableArcIterator_10position(((struct __pyx_obj_9pywrapfst_MutableArcIterator *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_18MutableArcIterator_10position(struct __pyx_obj_9pywrapfst_MutableArcIterator *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"position\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __Pyx_PyInt_FromSize_t(__pyx_f_9pywrapfst_18MutableArcIterator_position(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3125, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.MutableArcIterator.position\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":3136\n *     return self._aiter.get().Position()\n * \n *   cpdef void reset(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     reset(self)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_18MutableArcIterator_13reset(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic void __pyx_f_9pywrapfst_18MutableArcIterator_reset(struct __pyx_obj_9pywrapfst_MutableArcIterator *__pyx_v_self, int __pyx_skip_dispatch) {\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  __Pyx_RefNannySetupContext(\"reset\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_reset); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3136, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_18MutableArcIterator_13reset)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3136, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3136, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":3142\n *     Resets the iterator to the initial position.\n *     \"\"\"\n *     self._aiter.get().Reset()             # <<<<<<<<<<<<<<\n * \n *   cpdef void seek(self, size_t a):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_aiter\");\n    __PYX_ERR(0, 3142, __pyx_L1_error)\n  }\n  __pyx_v_self->_aiter.get()->Reset();\n\n  /* \"pywrapfst.pyx\":3136\n *     return self._aiter.get().Position()\n * \n *   cpdef void reset(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     reset(self)\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_WriteUnraisable(\"pywrapfst.MutableArcIterator.reset\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_18MutableArcIterator_13reset(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_18MutableArcIterator_12reset[] = \"\\n    reset(self)\\n\\n    Resets the iterator to the initial position.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_18MutableArcIterator_13reset(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"reset (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_18MutableArcIterator_12reset(((struct __pyx_obj_9pywrapfst_MutableArcIterator *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_18MutableArcIterator_12reset(struct __pyx_obj_9pywrapfst_MutableArcIterator *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"reset\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __Pyx_void_to_None(__pyx_f_9pywrapfst_18MutableArcIterator_reset(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3136, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.MutableArcIterator.reset\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":3144\n *     self._aiter.get().Reset()\n * \n *   cpdef void seek(self, size_t a):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     seek(self, a)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_18MutableArcIterator_15seek(PyObject *__pyx_v_self, PyObject *__pyx_arg_a); /*proto*/\nstatic void __pyx_f_9pywrapfst_18MutableArcIterator_seek(struct __pyx_obj_9pywrapfst_MutableArcIterator *__pyx_v_self, size_t __pyx_v_a, int __pyx_skip_dispatch) {\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  PyObject *__pyx_t_6 = NULL;\n  __Pyx_RefNannySetupContext(\"seek\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_seek); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3144, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_18MutableArcIterator_15seek)) {\n      __pyx_t_3 = __Pyx_PyInt_FromSize_t(__pyx_v_a); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 3144, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_3);\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_4 = __pyx_t_1; __pyx_t_5 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_4))) {\n        __pyx_t_5 = PyMethod_GET_SELF(__pyx_t_4);\n        if (likely(__pyx_t_5)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_4);\n          __Pyx_INCREF(__pyx_t_5);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_4, function);\n        }\n      }\n      if (!__pyx_t_5) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_4, __pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3144, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n        __Pyx_GOTREF(__pyx_t_2);\n      } else {\n        #if CYTHON_FAST_PYCALL\n        if (PyFunction_Check(__pyx_t_4)) {\n          PyObject *__pyx_temp[2] = {__pyx_t_5, __pyx_t_3};\n          __pyx_t_2 = __Pyx_PyFunction_FastCall(__pyx_t_4, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3144, __pyx_L1_error)\n          __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;\n          __Pyx_GOTREF(__pyx_t_2);\n          __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n        } else\n        #endif\n        #if CYTHON_FAST_PYCCALL\n        if (__Pyx_PyFastCFunction_Check(__pyx_t_4)) {\n          PyObject *__pyx_temp[2] = {__pyx_t_5, __pyx_t_3};\n          __pyx_t_2 = __Pyx_PyCFunction_FastCall(__pyx_t_4, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3144, __pyx_L1_error)\n          __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;\n          __Pyx_GOTREF(__pyx_t_2);\n          __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n        } else\n        #endif\n        {\n          __pyx_t_6 = PyTuple_New(1+1); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 3144, __pyx_L1_error)\n          __Pyx_GOTREF(__pyx_t_6);\n          __Pyx_GIVEREF(__pyx_t_5); PyTuple_SET_ITEM(__pyx_t_6, 0, __pyx_t_5); __pyx_t_5 = NULL;\n          __Pyx_GIVEREF(__pyx_t_3);\n          PyTuple_SET_ITEM(__pyx_t_6, 0+1, __pyx_t_3);\n          __pyx_t_3 = 0;\n          __pyx_t_2 = __Pyx_PyObject_Call(__pyx_t_4, __pyx_t_6, NULL); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3144, __pyx_L1_error)\n          __Pyx_GOTREF(__pyx_t_2);\n          __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n        }\n      }\n      __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":3153\n *       a: The position to seek to.\n *     \"\"\"\n *     self._aiter.get().Seek(a)             # <<<<<<<<<<<<<<\n * \n *   cpdef void set_flags(self, uint32 flags, uint32 mask):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_aiter\");\n    __PYX_ERR(0, 3153, __pyx_L1_error)\n  }\n  __pyx_v_self->_aiter.get()->Seek(__pyx_v_a);\n\n  /* \"pywrapfst.pyx\":3144\n *     self._aiter.get().Reset()\n * \n *   cpdef void seek(self, size_t a):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     seek(self, a)\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_XDECREF(__pyx_t_6);\n  __Pyx_WriteUnraisable(\"pywrapfst.MutableArcIterator.seek\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_18MutableArcIterator_15seek(PyObject *__pyx_v_self, PyObject *__pyx_arg_a); /*proto*/\nstatic char __pyx_doc_9pywrapfst_18MutableArcIterator_14seek[] = \"\\n    seek(self, a)\\n\\n    Advance the iterator to a new position.\\n\\n    Args:\\n      a: The position to seek to.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_18MutableArcIterator_15seek(PyObject *__pyx_v_self, PyObject *__pyx_arg_a) {\n  size_t __pyx_v_a;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"seek (wrapper)\", 0);\n  assert(__pyx_arg_a); {\n    __pyx_v_a = __Pyx_PyInt_As_size_t(__pyx_arg_a); if (unlikely((__pyx_v_a == (size_t)-1) && PyErr_Occurred())) __PYX_ERR(0, 3144, __pyx_L3_error)\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst.MutableArcIterator.seek\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  __pyx_r = __pyx_pf_9pywrapfst_18MutableArcIterator_14seek(((struct __pyx_obj_9pywrapfst_MutableArcIterator *)__pyx_v_self), ((size_t)__pyx_v_a));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_18MutableArcIterator_14seek(struct __pyx_obj_9pywrapfst_MutableArcIterator *__pyx_v_self, size_t __pyx_v_a) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"seek\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __Pyx_void_to_None(__pyx_f_9pywrapfst_18MutableArcIterator_seek(__pyx_v_self, __pyx_v_a, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3144, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.MutableArcIterator.seek\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":3155\n *     self._aiter.get().Seek(a)\n * \n *   cpdef void set_flags(self, uint32 flags, uint32 mask):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     set_flags(self, flags, mask)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_18MutableArcIterator_17set_flags(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic void __pyx_f_9pywrapfst_18MutableArcIterator_set_flags(struct __pyx_obj_9pywrapfst_MutableArcIterator *__pyx_v_self, __pyx_t_10basictypes_uint32 __pyx_v_flags, __pyx_t_10basictypes_uint32 __pyx_v_mask, int __pyx_skip_dispatch) {\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  PyObject *__pyx_t_6 = NULL;\n  int __pyx_t_7;\n  PyObject *__pyx_t_8 = NULL;\n  __Pyx_RefNannySetupContext(\"set_flags\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_set_flags); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3155, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_18MutableArcIterator_17set_flags)) {\n      __pyx_t_3 = __Pyx_PyInt_From_uint32_t(__pyx_v_flags); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 3155, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_3);\n      __pyx_t_4 = __Pyx_PyInt_From_uint32_t(__pyx_v_mask); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 3155, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_4);\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_5 = __pyx_t_1; __pyx_t_6 = NULL;\n      __pyx_t_7 = 0;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_5))) {\n        __pyx_t_6 = PyMethod_GET_SELF(__pyx_t_5);\n        if (likely(__pyx_t_6)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_5);\n          __Pyx_INCREF(__pyx_t_6);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_5, function);\n          __pyx_t_7 = 1;\n        }\n      }\n      #if CYTHON_FAST_PYCALL\n      if (PyFunction_Check(__pyx_t_5)) {\n        PyObject *__pyx_temp[3] = {__pyx_t_6, __pyx_t_3, __pyx_t_4};\n        __pyx_t_2 = __Pyx_PyFunction_FastCall(__pyx_t_5, __pyx_temp+1-__pyx_t_7, 2+__pyx_t_7); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3155, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_6); __pyx_t_6 = 0;\n        __Pyx_GOTREF(__pyx_t_2);\n        __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else\n      #endif\n      #if CYTHON_FAST_PYCCALL\n      if (__Pyx_PyFastCFunction_Check(__pyx_t_5)) {\n        PyObject *__pyx_temp[3] = {__pyx_t_6, __pyx_t_3, __pyx_t_4};\n        __pyx_t_2 = __Pyx_PyCFunction_FastCall(__pyx_t_5, __pyx_temp+1-__pyx_t_7, 2+__pyx_t_7); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3155, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_6); __pyx_t_6 = 0;\n        __Pyx_GOTREF(__pyx_t_2);\n        __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else\n      #endif\n      {\n        __pyx_t_8 = PyTuple_New(2+__pyx_t_7); if (unlikely(!__pyx_t_8)) __PYX_ERR(0, 3155, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_8);\n        if (__pyx_t_6) {\n          __Pyx_GIVEREF(__pyx_t_6); PyTuple_SET_ITEM(__pyx_t_8, 0, __pyx_t_6); __pyx_t_6 = NULL;\n        }\n        __Pyx_GIVEREF(__pyx_t_3);\n        PyTuple_SET_ITEM(__pyx_t_8, 0+__pyx_t_7, __pyx_t_3);\n        __Pyx_GIVEREF(__pyx_t_4);\n        PyTuple_SET_ITEM(__pyx_t_8, 1+__pyx_t_7, __pyx_t_4);\n        __pyx_t_3 = 0;\n        __pyx_t_4 = 0;\n        __pyx_t_2 = __Pyx_PyObject_Call(__pyx_t_5, __pyx_t_8, NULL); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3155, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_2);\n        __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0;\n      }\n      __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":3165\n *       mask: A mask to be applied to the `flags` argument before setting them.\n *     \"\"\"\n *     self._aiter.get().SetFlags(flags, mask)             # <<<<<<<<<<<<<<\n * \n *   cpdef void set_value(self, Arc arc):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_aiter\");\n    __PYX_ERR(0, 3165, __pyx_L1_error)\n  }\n  __pyx_v_self->_aiter.get()->SetFlags(__pyx_v_flags, __pyx_v_mask);\n\n  /* \"pywrapfst.pyx\":3155\n *     self._aiter.get().Seek(a)\n * \n *   cpdef void set_flags(self, uint32 flags, uint32 mask):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     set_flags(self, flags, mask)\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_XDECREF(__pyx_t_6);\n  __Pyx_XDECREF(__pyx_t_8);\n  __Pyx_WriteUnraisable(\"pywrapfst.MutableArcIterator.set_flags\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_18MutableArcIterator_17set_flags(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic char __pyx_doc_9pywrapfst_18MutableArcIterator_16set_flags[] = \"\\n    set_flags(self, flags, mask)\\n\\n    Sets the current iterator behavioral flags.\\n\\n    Args:\\n      flags: The properties to be set.\\n      mask: A mask to be applied to the `flags` argument before setting them.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_18MutableArcIterator_17set_flags(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  __pyx_t_10basictypes_uint32 __pyx_v_flags;\n  __pyx_t_10basictypes_uint32 __pyx_v_mask;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"set_flags (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_flags,&__pyx_n_s_mask,0};\n    PyObject* values[2] = {0,0};\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (likely((values[0] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_flags)) != 0)) kw_args--;\n        else goto __pyx_L5_argtuple_error;\n        CYTHON_FALLTHROUGH;\n        case  1:\n        if (likely((values[1] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_mask)) != 0)) kw_args--;\n        else {\n          __Pyx_RaiseArgtupleInvalid(\"set_flags\", 1, 2, 2, 1); __PYX_ERR(0, 3155, __pyx_L3_error)\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"set_flags\") < 0)) __PYX_ERR(0, 3155, __pyx_L3_error)\n      }\n    } else if (PyTuple_GET_SIZE(__pyx_args) != 2) {\n      goto __pyx_L5_argtuple_error;\n    } else {\n      values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n      values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n    }\n    __pyx_v_flags = __Pyx_PyInt_As_uint32_t(values[0]); if (unlikely((__pyx_v_flags == ((uint32_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 3155, __pyx_L3_error)\n    __pyx_v_mask = __Pyx_PyInt_As_uint32_t(values[1]); if (unlikely((__pyx_v_mask == ((uint32_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 3155, __pyx_L3_error)\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"set_flags\", 1, 2, 2, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 3155, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst.MutableArcIterator.set_flags\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  __pyx_r = __pyx_pf_9pywrapfst_18MutableArcIterator_16set_flags(((struct __pyx_obj_9pywrapfst_MutableArcIterator *)__pyx_v_self), __pyx_v_flags, __pyx_v_mask);\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_18MutableArcIterator_16set_flags(struct __pyx_obj_9pywrapfst_MutableArcIterator *__pyx_v_self, __pyx_t_10basictypes_uint32 __pyx_v_flags, __pyx_t_10basictypes_uint32 __pyx_v_mask) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"set_flags\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __Pyx_void_to_None(__pyx_f_9pywrapfst_18MutableArcIterator_set_flags(__pyx_v_self, __pyx_v_flags, __pyx_v_mask, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3155, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.MutableArcIterator.set_flags\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":3167\n *     self._aiter.get().SetFlags(flags, mask)\n * \n *   cpdef void set_value(self, Arc arc):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     set_value(self, arc)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_18MutableArcIterator_19set_value(PyObject *__pyx_v_self, PyObject *__pyx_v_arc); /*proto*/\nstatic void __pyx_f_9pywrapfst_18MutableArcIterator_set_value(struct __pyx_obj_9pywrapfst_MutableArcIterator *__pyx_v_self, struct __pyx_obj_9pywrapfst_Arc *__pyx_v_arc, int __pyx_skip_dispatch) {\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  __Pyx_RefNannySetupContext(\"set_value\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_set_value); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3167, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_18MutableArcIterator_19set_value)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (!__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, ((PyObject *)__pyx_v_arc)); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3167, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_2);\n      } else {\n        #if CYTHON_FAST_PYCALL\n        if (PyFunction_Check(__pyx_t_3)) {\n          PyObject *__pyx_temp[2] = {__pyx_t_4, ((PyObject *)__pyx_v_arc)};\n          __pyx_t_2 = __Pyx_PyFunction_FastCall(__pyx_t_3, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3167, __pyx_L1_error)\n          __Pyx_XDECREF(__pyx_t_4); __pyx_t_4 = 0;\n          __Pyx_GOTREF(__pyx_t_2);\n        } else\n        #endif\n        #if CYTHON_FAST_PYCCALL\n        if (__Pyx_PyFastCFunction_Check(__pyx_t_3)) {\n          PyObject *__pyx_temp[2] = {__pyx_t_4, ((PyObject *)__pyx_v_arc)};\n          __pyx_t_2 = __Pyx_PyCFunction_FastCall(__pyx_t_3, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3167, __pyx_L1_error)\n          __Pyx_XDECREF(__pyx_t_4); __pyx_t_4 = 0;\n          __Pyx_GOTREF(__pyx_t_2);\n        } else\n        #endif\n        {\n          __pyx_t_5 = PyTuple_New(1+1); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 3167, __pyx_L1_error)\n          __Pyx_GOTREF(__pyx_t_5);\n          __Pyx_GIVEREF(__pyx_t_4); PyTuple_SET_ITEM(__pyx_t_5, 0, __pyx_t_4); __pyx_t_4 = NULL;\n          __Pyx_INCREF(((PyObject *)__pyx_v_arc));\n          __Pyx_GIVEREF(((PyObject *)__pyx_v_arc));\n          PyTuple_SET_ITEM(__pyx_t_5, 0+1, ((PyObject *)__pyx_v_arc));\n          __pyx_t_2 = __Pyx_PyObject_Call(__pyx_t_3, __pyx_t_5, NULL); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3167, __pyx_L1_error)\n          __Pyx_GOTREF(__pyx_t_2);\n          __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n        }\n      }\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":3176\n *       arc: The arc to replace the current arc with.\n *     \"\"\"\n *     self._aiter.get().SetValue(deref(arc._arc))             # <<<<<<<<<<<<<<\n * \n *   cpdef object value(self):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_aiter\");\n    __PYX_ERR(0, 3176, __pyx_L1_error)\n  }\n  if (unlikely(((PyObject *)__pyx_v_arc) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_arc\");\n    __PYX_ERR(0, 3176, __pyx_L1_error)\n  }\n  __pyx_v_self->_aiter.get()->SetValue((*__pyx_v_arc->_arc));\n\n  /* \"pywrapfst.pyx\":3167\n *     self._aiter.get().SetFlags(flags, mask)\n * \n *   cpdef void set_value(self, Arc arc):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     set_value(self, arc)\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_WriteUnraisable(\"pywrapfst.MutableArcIterator.set_value\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_18MutableArcIterator_19set_value(PyObject *__pyx_v_self, PyObject *__pyx_v_arc); /*proto*/\nstatic char __pyx_doc_9pywrapfst_18MutableArcIterator_18set_value[] = \"\\n    set_value(self, arc)\\n\\n    Replace the current arc with a new arc.\\n\\n    Args:\\n      arc: The arc to replace the current arc with.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_18MutableArcIterator_19set_value(PyObject *__pyx_v_self, PyObject *__pyx_v_arc) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"set_value (wrapper)\", 0);\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_arc), __pyx_ptype_9pywrapfst_Arc, 1, \"arc\", 0))) __PYX_ERR(0, 3167, __pyx_L1_error)\n  __pyx_r = __pyx_pf_9pywrapfst_18MutableArcIterator_18set_value(((struct __pyx_obj_9pywrapfst_MutableArcIterator *)__pyx_v_self), ((struct __pyx_obj_9pywrapfst_Arc *)__pyx_v_arc));\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_18MutableArcIterator_18set_value(struct __pyx_obj_9pywrapfst_MutableArcIterator *__pyx_v_self, struct __pyx_obj_9pywrapfst_Arc *__pyx_v_arc) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"set_value\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __Pyx_void_to_None(__pyx_f_9pywrapfst_18MutableArcIterator_set_value(__pyx_v_self, __pyx_v_arc, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3167, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.MutableArcIterator.set_value\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":3178\n *     self._aiter.get().SetValue(deref(arc._arc))\n * \n *   cpdef object value(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     value(self)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_18MutableArcIterator_21value(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic PyObject *__pyx_f_9pywrapfst_18MutableArcIterator_value(struct __pyx_obj_9pywrapfst_MutableArcIterator *__pyx_v_self, int __pyx_skip_dispatch) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  __Pyx_RefNannySetupContext(\"value\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_value); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3178, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_18MutableArcIterator_21value)) {\n      __Pyx_XDECREF(__pyx_r);\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3178, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3178, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __pyx_r = __pyx_t_2;\n      __pyx_t_2 = 0;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":3184\n *     Returns the current arc.\n *     \"\"\"\n *     return _init_Arc(self._aiter.get().Value())             # <<<<<<<<<<<<<<\n * \n * \n */\n  __Pyx_XDECREF(__pyx_r);\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_aiter\");\n    __PYX_ERR(0, 3184, __pyx_L1_error)\n  }\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst__init_Arc(__pyx_v_self->_aiter.get()->Value())); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3184, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":3178\n *     self._aiter.get().SetValue(deref(arc._arc))\n * \n *   cpdef object value(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     value(self)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_AddTraceback(\"pywrapfst.MutableArcIterator.value\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_18MutableArcIterator_21value(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_18MutableArcIterator_20value[] = \"\\n    value(self)\\n\\n    Returns the current arc.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_18MutableArcIterator_21value(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"value (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_18MutableArcIterator_20value(((struct __pyx_obj_9pywrapfst_MutableArcIterator *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_18MutableArcIterator_20value(struct __pyx_obj_9pywrapfst_MutableArcIterator *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"value\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __pyx_f_9pywrapfst_18MutableArcIterator_value(__pyx_v_self, 1); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3178, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.MutableArcIterator.value\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"(tree fragment)\":1\n * def __reduce_cython__(self):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._aiter,self._mfst cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_18MutableArcIterator_23__reduce_cython__(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_18MutableArcIterator_23__reduce_cython__(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__reduce_cython__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_18MutableArcIterator_22__reduce_cython__(((struct __pyx_obj_9pywrapfst_MutableArcIterator *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_18MutableArcIterator_22__reduce_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst_MutableArcIterator *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"__reduce_cython__\", 0);\n\n  /* \"(tree fragment)\":2\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._aiter,self._mfst cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._aiter,self._mfst cannot be converted to a Python object for pickling\")\n */\n  __pyx_t_1 = __Pyx_PyObject_Call(__pyx_builtin_TypeError, __pyx_tuple__63, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(1, 2, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __Pyx_Raise(__pyx_t_1, 0, 0, 0);\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  __PYX_ERR(1, 2, __pyx_L1_error)\n\n  /* \"(tree fragment)\":1\n * def __reduce_cython__(self):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._aiter,self._mfst cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.MutableArcIterator.__reduce_cython__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"(tree fragment)\":3\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._aiter,self._mfst cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._aiter,self._mfst cannot be converted to a Python object for pickling\")\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_18MutableArcIterator_25__setstate_cython__(PyObject *__pyx_v_self, PyObject *__pyx_v___pyx_state); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_18MutableArcIterator_25__setstate_cython__(PyObject *__pyx_v_self, PyObject *__pyx_v___pyx_state) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__setstate_cython__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_18MutableArcIterator_24__setstate_cython__(((struct __pyx_obj_9pywrapfst_MutableArcIterator *)__pyx_v_self), ((PyObject *)__pyx_v___pyx_state));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_18MutableArcIterator_24__setstate_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst_MutableArcIterator *__pyx_v_self, CYTHON_UNUSED PyObject *__pyx_v___pyx_state) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"__setstate_cython__\", 0);\n\n  /* \"(tree fragment)\":4\n *     raise TypeError(\"self._aiter,self._mfst cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._aiter,self._mfst cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n */\n  __pyx_t_1 = __Pyx_PyObject_Call(__pyx_builtin_TypeError, __pyx_tuple__64, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(1, 4, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __Pyx_Raise(__pyx_t_1, 0, 0, 0);\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  __PYX_ERR(1, 4, __pyx_L1_error)\n\n  /* \"(tree fragment)\":3\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._aiter,self._mfst cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._aiter,self._mfst cannot be converted to a Python object for pickling\")\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.MutableArcIterator.__setstate_cython__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":3198\n *   \"\"\"\n * \n *   def __repr__(self):             # <<<<<<<<<<<<<<\n *     return \"<StateIterator at 0x{:x}>\".format(id(self))\n * \n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_13StateIterator_1__repr__(PyObject *__pyx_v_self); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_13StateIterator_1__repr__(PyObject *__pyx_v_self) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__repr__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_13StateIterator___repr__(((struct __pyx_obj_9pywrapfst_StateIterator *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_13StateIterator___repr__(struct __pyx_obj_9pywrapfst_StateIterator *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  __Pyx_RefNannySetupContext(\"__repr__\", 0);\n\n  /* \"pywrapfst.pyx\":3199\n * \n *   def __repr__(self):\n *     return \"<StateIterator at 0x{:x}>\".format(id(self))             # <<<<<<<<<<<<<<\n * \n *   def __init__(self, _Fst ifst):\n */\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_2 = __Pyx_PyObject_GetAttrStr(__pyx_kp_s_StateIterator_at_0x_x, __pyx_n_s_format); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3199, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  __pyx_t_3 = PyTuple_New(1); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 3199, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_3);\n  __Pyx_INCREF(((PyObject *)__pyx_v_self));\n  __Pyx_GIVEREF(((PyObject *)__pyx_v_self));\n  PyTuple_SET_ITEM(__pyx_t_3, 0, ((PyObject *)__pyx_v_self));\n  __pyx_t_4 = __Pyx_PyObject_Call(__pyx_builtin_id, __pyx_t_3, NULL); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 3199, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_4);\n  __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n  __pyx_t_3 = NULL;\n  if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_2))) {\n    __pyx_t_3 = PyMethod_GET_SELF(__pyx_t_2);\n    if (likely(__pyx_t_3)) {\n      PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_2);\n      __Pyx_INCREF(__pyx_t_3);\n      __Pyx_INCREF(function);\n      __Pyx_DECREF_SET(__pyx_t_2, function);\n    }\n  }\n  if (!__pyx_t_3) {\n    __pyx_t_1 = __Pyx_PyObject_CallOneArg(__pyx_t_2, __pyx_t_4); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3199, __pyx_L1_error)\n    __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n    __Pyx_GOTREF(__pyx_t_1);\n  } else {\n    #if CYTHON_FAST_PYCALL\n    if (PyFunction_Check(__pyx_t_2)) {\n      PyObject *__pyx_temp[2] = {__pyx_t_3, __pyx_t_4};\n      __pyx_t_1 = __Pyx_PyFunction_FastCall(__pyx_t_2, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3199, __pyx_L1_error)\n      __Pyx_XDECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __Pyx_GOTREF(__pyx_t_1);\n      __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n    } else\n    #endif\n    #if CYTHON_FAST_PYCCALL\n    if (__Pyx_PyFastCFunction_Check(__pyx_t_2)) {\n      PyObject *__pyx_temp[2] = {__pyx_t_3, __pyx_t_4};\n      __pyx_t_1 = __Pyx_PyCFunction_FastCall(__pyx_t_2, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3199, __pyx_L1_error)\n      __Pyx_XDECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __Pyx_GOTREF(__pyx_t_1);\n      __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n    } else\n    #endif\n    {\n      __pyx_t_5 = PyTuple_New(1+1); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 3199, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_5);\n      __Pyx_GIVEREF(__pyx_t_3); PyTuple_SET_ITEM(__pyx_t_5, 0, __pyx_t_3); __pyx_t_3 = NULL;\n      __Pyx_GIVEREF(__pyx_t_4);\n      PyTuple_SET_ITEM(__pyx_t_5, 0+1, __pyx_t_4);\n      __pyx_t_4 = 0;\n      __pyx_t_1 = __Pyx_PyObject_Call(__pyx_t_2, __pyx_t_5, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3199, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_1);\n      __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n    }\n  }\n  __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":3198\n *   \"\"\"\n * \n *   def __repr__(self):             # <<<<<<<<<<<<<<\n *     return \"<StateIterator at 0x{:x}>\".format(id(self))\n * \n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_AddTraceback(\"pywrapfst.StateIterator.__repr__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":3201\n *     return \"<StateIterator at 0x{:x}>\".format(id(self))\n * \n *   def __init__(self, _Fst ifst):             # <<<<<<<<<<<<<<\n *     # Makes copy of the shared_ptr, potentially extending the FST's lifetime.\n *     self._fst = ifst._fst\n */\n\n/* Python wrapper */\nstatic int __pyx_pw_9pywrapfst_13StateIterator_3__init__(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic int __pyx_pw_9pywrapfst_13StateIterator_3__init__(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst = 0;\n  int __pyx_r;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__init__ (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_ifst,0};\n    PyObject* values[1] = {0};\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (likely((values[0] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_ifst)) != 0)) kw_args--;\n        else goto __pyx_L5_argtuple_error;\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"__init__\") < 0)) __PYX_ERR(0, 3201, __pyx_L3_error)\n      }\n    } else if (PyTuple_GET_SIZE(__pyx_args) != 1) {\n      goto __pyx_L5_argtuple_error;\n    } else {\n      values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n    }\n    __pyx_v_ifst = ((struct __pyx_obj_9pywrapfst__Fst *)values[0]);\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"__init__\", 1, 1, 1, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 3201, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst.StateIterator.__init__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return -1;\n  __pyx_L4_argument_unpacking_done:;\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_ifst), __pyx_ptype_9pywrapfst__Fst, 1, \"ifst\", 0))) __PYX_ERR(0, 3201, __pyx_L1_error)\n  __pyx_r = __pyx_pf_9pywrapfst_13StateIterator_2__init__(((struct __pyx_obj_9pywrapfst_StateIterator *)__pyx_v_self), __pyx_v_ifst);\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __pyx_r = -1;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic int __pyx_pf_9pywrapfst_13StateIterator_2__init__(struct __pyx_obj_9pywrapfst_StateIterator *__pyx_v_self, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst) {\n  int __pyx_r;\n  __Pyx_RefNannyDeclarations\n  std::shared_ptr<fst::script::FstClass>  __pyx_t_1;\n  __Pyx_RefNannySetupContext(\"__init__\", 0);\n\n  /* \"pywrapfst.pyx\":3203\n *   def __init__(self, _Fst ifst):\n *     # Makes copy of the shared_ptr, potentially extending the FST's lifetime.\n *     self._fst = ifst._fst             # <<<<<<<<<<<<<<\n *     self._siter.reset(new fst.StateIteratorClass(deref(self._fst)))\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_ifst) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 3203, __pyx_L1_error)\n  }\n  __pyx_t_1 = __pyx_v_ifst->_fst;\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 3203, __pyx_L1_error)\n  }\n  __pyx_v_self->_fst = __pyx_t_1;\n\n  /* \"pywrapfst.pyx\":3204\n *     # Makes copy of the shared_ptr, potentially extending the FST's lifetime.\n *     self._fst = ifst._fst\n *     self._siter.reset(new fst.StateIteratorClass(deref(self._fst)))             # <<<<<<<<<<<<<<\n * \n *   # This just registers this class as a possible iterator.\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_siter\");\n    __PYX_ERR(0, 3204, __pyx_L1_error)\n  }\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 3204, __pyx_L1_error)\n  }\n  __pyx_v_self->_siter.reset(new fst::script::StateIteratorClass((*__pyx_v_self->_fst)));\n\n  /* \"pywrapfst.pyx\":3201\n *     return \"<StateIterator at 0x{:x}>\".format(id(self))\n * \n *   def __init__(self, _Fst ifst):             # <<<<<<<<<<<<<<\n *     # Makes copy of the shared_ptr, potentially extending the FST's lifetime.\n *     self._fst = ifst._fst\n */\n\n  /* function exit code */\n  __pyx_r = 0;\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"pywrapfst.StateIterator.__init__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = -1;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":3207\n * \n *   # This just registers this class as a possible iterator.\n *   def __iter__(self):             # <<<<<<<<<<<<<<\n *     return self\n * \n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_13StateIterator_5__iter__(PyObject *__pyx_v_self); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_13StateIterator_5__iter__(PyObject *__pyx_v_self) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__iter__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_13StateIterator_4__iter__(((struct __pyx_obj_9pywrapfst_StateIterator *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_13StateIterator_4__iter__(struct __pyx_obj_9pywrapfst_StateIterator *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__iter__\", 0);\n\n  /* \"pywrapfst.pyx\":3208\n *   # This just registers this class as a possible iterator.\n *   def __iter__(self):\n *     return self             # <<<<<<<<<<<<<<\n * \n *   # Magic method used to get a Pythonic API out of the C++ API.\n */\n  __Pyx_XDECREF(__pyx_r);\n  __Pyx_INCREF(((PyObject *)__pyx_v_self));\n  __pyx_r = ((PyObject *)__pyx_v_self);\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":3207\n * \n *   # This just registers this class as a possible iterator.\n *   def __iter__(self):             # <<<<<<<<<<<<<<\n *     return self\n * \n */\n\n  /* function exit code */\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":3211\n * \n *   # Magic method used to get a Pythonic API out of the C++ API.\n *   def __next__(self):             # <<<<<<<<<<<<<<\n *     if self.done():\n *       raise StopIteration\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_13StateIterator_7__next__(PyObject *__pyx_v_self); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_13StateIterator_7__next__(PyObject *__pyx_v_self) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__next__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_13StateIterator_6__next__(((struct __pyx_obj_9pywrapfst_StateIterator *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_13StateIterator_6__next__(struct __pyx_obj_9pywrapfst_StateIterator *__pyx_v_self) {\n  __pyx_t_10basictypes_int64 __pyx_v_result;\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  int __pyx_t_1;\n  PyObject *__pyx_t_2 = NULL;\n  __Pyx_RefNannySetupContext(\"__next__\", 0);\n\n  /* \"pywrapfst.pyx\":3212\n *   # Magic method used to get a Pythonic API out of the C++ API.\n *   def __next__(self):\n *     if self.done():             # <<<<<<<<<<<<<<\n *       raise StopIteration\n *     cdef int64 result = self.value()\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"done\");\n    __PYX_ERR(0, 3212, __pyx_L1_error)\n  }\n  __pyx_t_1 = (((struct __pyx_vtabstruct_9pywrapfst_StateIterator *)__pyx_v_self->__pyx_vtab)->done(__pyx_v_self, 0) != 0);\n  if (__pyx_t_1) {\n\n    /* \"pywrapfst.pyx\":3213\n *   def __next__(self):\n *     if self.done():\n *       raise StopIteration             # <<<<<<<<<<<<<<\n *     cdef int64 result = self.value()\n *     self.next()\n */\n    __Pyx_Raise(__pyx_builtin_StopIteration, 0, 0, 0);\n    __PYX_ERR(0, 3213, __pyx_L1_error)\n\n    /* \"pywrapfst.pyx\":3212\n *   # Magic method used to get a Pythonic API out of the C++ API.\n *   def __next__(self):\n *     if self.done():             # <<<<<<<<<<<<<<\n *       raise StopIteration\n *     cdef int64 result = self.value()\n */\n  }\n\n  /* \"pywrapfst.pyx\":3214\n *     if self.done():\n *       raise StopIteration\n *     cdef int64 result = self.value()             # <<<<<<<<<<<<<<\n *     self.next()\n *     return result\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"value\");\n    __PYX_ERR(0, 3214, __pyx_L1_error)\n  }\n  __pyx_v_result = ((struct __pyx_vtabstruct_9pywrapfst_StateIterator *)__pyx_v_self->__pyx_vtab)->value(__pyx_v_self, 0);\n\n  /* \"pywrapfst.pyx\":3215\n *       raise StopIteration\n *     cdef int64 result = self.value()\n *     self.next()             # <<<<<<<<<<<<<<\n *     return result\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"next\");\n    __PYX_ERR(0, 3215, __pyx_L1_error)\n  }\n  ((struct __pyx_vtabstruct_9pywrapfst_StateIterator *)__pyx_v_self->__pyx_vtab)->next(__pyx_v_self, 0);\n\n  /* \"pywrapfst.pyx\":3216\n *     cdef int64 result = self.value()\n *     self.next()\n *     return result             # <<<<<<<<<<<<<<\n * \n *   cpdef bool done(self):\n */\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_2 = __Pyx_PyInt_From_int64_t(__pyx_v_result); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3216, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  __pyx_r = __pyx_t_2;\n  __pyx_t_2 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":3211\n * \n *   # Magic method used to get a Pythonic API out of the C++ API.\n *   def __next__(self):             # <<<<<<<<<<<<<<\n *     if self.done():\n *       raise StopIteration\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_AddTraceback(\"pywrapfst.StateIterator.__next__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":3218\n *     return result\n * \n *   cpdef bool done(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     done(self)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_13StateIterator_9done(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic bool __pyx_f_9pywrapfst_13StateIterator_done(struct __pyx_obj_9pywrapfst_StateIterator *__pyx_v_self, int __pyx_skip_dispatch) {\n  bool __pyx_r;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  bool __pyx_t_5;\n  __Pyx_RefNannySetupContext(\"done\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_done); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3218, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_13StateIterator_9done)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3218, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3218, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __pyx_t_5 = __Pyx_PyObject_IsTrue(__pyx_t_2); if (unlikely((__pyx_t_5 == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 3218, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __pyx_r = __pyx_t_5;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":3227\n *       True if the iterator is exhausted, False otherwise.\n *     \"\"\"\n *     return self._siter.get().Done()             # <<<<<<<<<<<<<<\n * \n *   cpdef void next(self):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_siter\");\n    __PYX_ERR(0, 3227, __pyx_L1_error)\n  }\n  __pyx_r = __pyx_v_self->_siter.get()->Done();\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":3218\n *     return result\n * \n *   cpdef bool done(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     done(self)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_WriteUnraisable(\"pywrapfst.StateIterator.done\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_13StateIterator_9done(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_13StateIterator_8done[] = \"\\n    done(self)\\n\\n    Indicates whether the iterator is exhausted or not.\\n\\n    Returns:\\n      True if the iterator is exhausted, False otherwise.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_13StateIterator_9done(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"done (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_13StateIterator_8done(((struct __pyx_obj_9pywrapfst_StateIterator *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_13StateIterator_8done(struct __pyx_obj_9pywrapfst_StateIterator *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"done\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __Pyx_PyBool_FromLong(__pyx_f_9pywrapfst_13StateIterator_done(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3218, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.StateIterator.done\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":3229\n *     return self._siter.get().Done()\n * \n *   cpdef void next(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     next(self)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_13StateIterator_11next(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic void __pyx_f_9pywrapfst_13StateIterator_next(struct __pyx_obj_9pywrapfst_StateIterator *__pyx_v_self, int __pyx_skip_dispatch) {\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  __Pyx_RefNannySetupContext(\"next\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_next); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3229, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_13StateIterator_11next)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3229, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3229, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":3235\n *     Advances the iterator.\n *     \"\"\"\n *     self._siter.get().Next()             # <<<<<<<<<<<<<<\n * \n *   cpdef void reset(self):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_siter\");\n    __PYX_ERR(0, 3235, __pyx_L1_error)\n  }\n  __pyx_v_self->_siter.get()->Next();\n\n  /* \"pywrapfst.pyx\":3229\n *     return self._siter.get().Done()\n * \n *   cpdef void next(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     next(self)\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_WriteUnraisable(\"pywrapfst.StateIterator.next\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_13StateIterator_11next(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_13StateIterator_10next[] = \"\\n    next(self)\\n\\n    Advances the iterator.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_13StateIterator_11next(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"next (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_13StateIterator_10next(((struct __pyx_obj_9pywrapfst_StateIterator *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_13StateIterator_10next(struct __pyx_obj_9pywrapfst_StateIterator *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"next\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __Pyx_void_to_None(__pyx_f_9pywrapfst_13StateIterator_next(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3229, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.StateIterator.next\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":3237\n *     self._siter.get().Next()\n * \n *   cpdef void reset(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     reset(self)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_13StateIterator_13reset(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic void __pyx_f_9pywrapfst_13StateIterator_reset(struct __pyx_obj_9pywrapfst_StateIterator *__pyx_v_self, int __pyx_skip_dispatch) {\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  __Pyx_RefNannySetupContext(\"reset\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_reset); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3237, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_13StateIterator_13reset)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3237, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3237, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":3243\n *     Resets the iterator to the initial position.\n *     \"\"\"\n *     self._siter.get().Reset()             # <<<<<<<<<<<<<<\n * \n *   cpdef int64 value(self):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_siter\");\n    __PYX_ERR(0, 3243, __pyx_L1_error)\n  }\n  __pyx_v_self->_siter.get()->Reset();\n\n  /* \"pywrapfst.pyx\":3237\n *     self._siter.get().Next()\n * \n *   cpdef void reset(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     reset(self)\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_WriteUnraisable(\"pywrapfst.StateIterator.reset\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_13StateIterator_13reset(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_13StateIterator_12reset[] = \"\\n    reset(self)\\n\\n    Resets the iterator to the initial position.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_13StateIterator_13reset(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"reset (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_13StateIterator_12reset(((struct __pyx_obj_9pywrapfst_StateIterator *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_13StateIterator_12reset(struct __pyx_obj_9pywrapfst_StateIterator *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"reset\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __Pyx_void_to_None(__pyx_f_9pywrapfst_13StateIterator_reset(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3237, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.StateIterator.reset\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":3245\n *     self._siter.get().Reset()\n * \n *   cpdef int64 value(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     value(self)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_13StateIterator_15value(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic __pyx_t_10basictypes_int64 __pyx_f_9pywrapfst_13StateIterator_value(struct __pyx_obj_9pywrapfst_StateIterator *__pyx_v_self, int __pyx_skip_dispatch) {\n  __pyx_t_10basictypes_int64 __pyx_r;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  __pyx_t_10basictypes_int64 __pyx_t_5;\n  __Pyx_RefNannySetupContext(\"value\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_value); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3245, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_13StateIterator_15value)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3245, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3245, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __pyx_t_5 = __Pyx_PyInt_As_int64_t(__pyx_t_2); if (unlikely((__pyx_t_5 == ((int64_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 3245, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __pyx_r = __pyx_t_5;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":3251\n *     Returns the current state index.\n *     \"\"\"\n *     return self._siter.get().Value()             # <<<<<<<<<<<<<<\n * \n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_siter\");\n    __PYX_ERR(0, 3251, __pyx_L1_error)\n  }\n  __pyx_r = __pyx_v_self->_siter.get()->Value();\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":3245\n *     self._siter.get().Reset()\n * \n *   cpdef int64 value(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     value(self)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_WriteUnraisable(\"pywrapfst.StateIterator.value\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_13StateIterator_15value(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_13StateIterator_14value[] = \"\\n    value(self)\\n\\n    Returns the current state index.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_13StateIterator_15value(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"value (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_13StateIterator_14value(((struct __pyx_obj_9pywrapfst_StateIterator *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_13StateIterator_14value(struct __pyx_obj_9pywrapfst_StateIterator *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"value\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __Pyx_PyInt_From_int64_t(__pyx_f_9pywrapfst_13StateIterator_value(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3245, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.StateIterator.value\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"(tree fragment)\":1\n * def __reduce_cython__(self):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._fst,self._siter cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_13StateIterator_17__reduce_cython__(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_13StateIterator_17__reduce_cython__(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__reduce_cython__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_13StateIterator_16__reduce_cython__(((struct __pyx_obj_9pywrapfst_StateIterator *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_13StateIterator_16__reduce_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst_StateIterator *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"__reduce_cython__\", 0);\n\n  /* \"(tree fragment)\":2\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._fst,self._siter cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._fst,self._siter cannot be converted to a Python object for pickling\")\n */\n  __pyx_t_1 = __Pyx_PyObject_Call(__pyx_builtin_TypeError, __pyx_tuple__65, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(1, 2, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __Pyx_Raise(__pyx_t_1, 0, 0, 0);\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  __PYX_ERR(1, 2, __pyx_L1_error)\n\n  /* \"(tree fragment)\":1\n * def __reduce_cython__(self):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._fst,self._siter cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.StateIterator.__reduce_cython__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"(tree fragment)\":3\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._fst,self._siter cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._fst,self._siter cannot be converted to a Python object for pickling\")\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_13StateIterator_19__setstate_cython__(PyObject *__pyx_v_self, PyObject *__pyx_v___pyx_state); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_13StateIterator_19__setstate_cython__(PyObject *__pyx_v_self, PyObject *__pyx_v___pyx_state) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__setstate_cython__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_13StateIterator_18__setstate_cython__(((struct __pyx_obj_9pywrapfst_StateIterator *)__pyx_v_self), ((PyObject *)__pyx_v___pyx_state));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_13StateIterator_18__setstate_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst_StateIterator *__pyx_v_self, CYTHON_UNUSED PyObject *__pyx_v___pyx_state) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"__setstate_cython__\", 0);\n\n  /* \"(tree fragment)\":4\n *     raise TypeError(\"self._fst,self._siter cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._fst,self._siter cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n */\n  __pyx_t_1 = __Pyx_PyObject_Call(__pyx_builtin_TypeError, __pyx_tuple__66, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(1, 4, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __Pyx_Raise(__pyx_t_1, 0, 0, 0);\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  __PYX_ERR(1, 4, __pyx_L1_error)\n\n  /* \"(tree fragment)\":3\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._fst,self._siter cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._fst,self._siter cannot be converted to a Python object for pickling\")\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.StateIterator.__setstate_cython__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":3257\n * \n * \n * cdef _Fst _map(_Fst ifst,             # <<<<<<<<<<<<<<\n *                float delta=fst.kDelta,\n *                map_type=b\"identity\",\n */\n\nstatic struct __pyx_obj_9pywrapfst__Fst *__pyx_f_9pywrapfst__map(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst, struct __pyx_opt_args_9pywrapfst__map *__pyx_optional_args) {\n  float __pyx_v_delta = __pyx_k__67;\n  PyObject *__pyx_v_map_type = ((PyObject *)__pyx_n_b_identity);\n  double __pyx_v_power = ((double)1.);\n\n  /* \"pywrapfst.pyx\":3261\n *                map_type=b\"identity\",\n *                double power=1.,\n *                weight=None):             # <<<<<<<<<<<<<<\n *   cdef fst.MapType map_type_enum\n *   if not fst.GetMapType(tostring(map_type), addr(map_type_enum)):\n */\n  PyObject *__pyx_v_weight = ((PyObject *)Py_None);\n  enum fst::script::MapType __pyx_v_map_type_enum;\n  fst::script::WeightClass __pyx_v_wc;\n  struct __pyx_obj_9pywrapfst__Fst *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  std::string __pyx_t_1;\n  int __pyx_t_2;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  PyObject *__pyx_t_6 = NULL;\n  PyObject *__pyx_t_7 = NULL;\n  PyObject *__pyx_t_8 = NULL;\n  fst::script::WeightClass __pyx_t_9;\n  fst::script::WeightClass __pyx_t_10;\n  __Pyx_RefNannySetupContext(\"_map\", 0);\n  if (__pyx_optional_args) {\n    if (__pyx_optional_args->__pyx_n > 0) {\n      __pyx_v_delta = __pyx_optional_args->delta;\n      if (__pyx_optional_args->__pyx_n > 1) {\n        __pyx_v_map_type = __pyx_optional_args->map_type;\n        if (__pyx_optional_args->__pyx_n > 2) {\n          __pyx_v_power = __pyx_optional_args->power;\n          if (__pyx_optional_args->__pyx_n > 3) {\n            __pyx_v_weight = __pyx_optional_args->weight;\n          }\n        }\n      }\n    }\n  }\n\n  /* \"pywrapfst.pyx\":3263\n *                weight=None):\n *   cdef fst.MapType map_type_enum\n *   if not fst.GetMapType(tostring(map_type), addr(map_type_enum)):             # <<<<<<<<<<<<<<\n *     raise FstArgError(\"Unknown map type: {!r}\".format(map_type))\n *   cdef fst.WeightClass wc = (_get_WeightClass_or_One(ifst.weight_type(),\n */\n  __pyx_t_1 = __pyx_f_9pywrapfst_tostring(__pyx_v_map_type, NULL); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 3263, __pyx_L1_error)\n  __pyx_t_2 = ((!(fst::script::GetMapType(__pyx_t_1, (&__pyx_v_map_type_enum)) != 0)) != 0);\n  if (__pyx_t_2) {\n\n    /* \"pywrapfst.pyx\":3264\n *   cdef fst.MapType map_type_enum\n *   if not fst.GetMapType(tostring(map_type), addr(map_type_enum)):\n *     raise FstArgError(\"Unknown map type: {!r}\".format(map_type))             # <<<<<<<<<<<<<<\n *   cdef fst.WeightClass wc = (_get_WeightClass_or_One(ifst.weight_type(),\n *       weight) if map_type_enum == fst.TIMES_MAPPER else\n */\n    __pyx_t_4 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstArgError); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 3264, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_4);\n    __pyx_t_6 = __Pyx_PyObject_GetAttrStr(__pyx_kp_s_Unknown_map_type_r, __pyx_n_s_format); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 3264, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_6);\n    __pyx_t_7 = NULL;\n    if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_6))) {\n      __pyx_t_7 = PyMethod_GET_SELF(__pyx_t_6);\n      if (likely(__pyx_t_7)) {\n        PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_6);\n        __Pyx_INCREF(__pyx_t_7);\n        __Pyx_INCREF(function);\n        __Pyx_DECREF_SET(__pyx_t_6, function);\n      }\n    }\n    if (!__pyx_t_7) {\n      __pyx_t_5 = __Pyx_PyObject_CallOneArg(__pyx_t_6, __pyx_v_map_type); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 3264, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_5);\n    } else {\n      #if CYTHON_FAST_PYCALL\n      if (PyFunction_Check(__pyx_t_6)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_7, __pyx_v_map_type};\n        __pyx_t_5 = __Pyx_PyFunction_FastCall(__pyx_t_6, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 3264, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_7); __pyx_t_7 = 0;\n        __Pyx_GOTREF(__pyx_t_5);\n      } else\n      #endif\n      #if CYTHON_FAST_PYCCALL\n      if (__Pyx_PyFastCFunction_Check(__pyx_t_6)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_7, __pyx_v_map_type};\n        __pyx_t_5 = __Pyx_PyCFunction_FastCall(__pyx_t_6, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 3264, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_7); __pyx_t_7 = 0;\n        __Pyx_GOTREF(__pyx_t_5);\n      } else\n      #endif\n      {\n        __pyx_t_8 = PyTuple_New(1+1); if (unlikely(!__pyx_t_8)) __PYX_ERR(0, 3264, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_8);\n        __Pyx_GIVEREF(__pyx_t_7); PyTuple_SET_ITEM(__pyx_t_8, 0, __pyx_t_7); __pyx_t_7 = NULL;\n        __Pyx_INCREF(__pyx_v_map_type);\n        __Pyx_GIVEREF(__pyx_v_map_type);\n        PyTuple_SET_ITEM(__pyx_t_8, 0+1, __pyx_v_map_type);\n        __pyx_t_5 = __Pyx_PyObject_Call(__pyx_t_6, __pyx_t_8, NULL); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 3264, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_5);\n        __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0;\n      }\n    }\n    __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n    __pyx_t_6 = NULL;\n    if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_4))) {\n      __pyx_t_6 = PyMethod_GET_SELF(__pyx_t_4);\n      if (likely(__pyx_t_6)) {\n        PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_4);\n        __Pyx_INCREF(__pyx_t_6);\n        __Pyx_INCREF(function);\n        __Pyx_DECREF_SET(__pyx_t_4, function);\n      }\n    }\n    if (!__pyx_t_6) {\n      __pyx_t_3 = __Pyx_PyObject_CallOneArg(__pyx_t_4, __pyx_t_5); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 3264, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n      __Pyx_GOTREF(__pyx_t_3);\n    } else {\n      #if CYTHON_FAST_PYCALL\n      if (PyFunction_Check(__pyx_t_4)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_6, __pyx_t_5};\n        __pyx_t_3 = __Pyx_PyFunction_FastCall(__pyx_t_4, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 3264, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_6); __pyx_t_6 = 0;\n        __Pyx_GOTREF(__pyx_t_3);\n        __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n      } else\n      #endif\n      #if CYTHON_FAST_PYCCALL\n      if (__Pyx_PyFastCFunction_Check(__pyx_t_4)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_6, __pyx_t_5};\n        __pyx_t_3 = __Pyx_PyCFunction_FastCall(__pyx_t_4, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 3264, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_6); __pyx_t_6 = 0;\n        __Pyx_GOTREF(__pyx_t_3);\n        __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n      } else\n      #endif\n      {\n        __pyx_t_8 = PyTuple_New(1+1); if (unlikely(!__pyx_t_8)) __PYX_ERR(0, 3264, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_8);\n        __Pyx_GIVEREF(__pyx_t_6); PyTuple_SET_ITEM(__pyx_t_8, 0, __pyx_t_6); __pyx_t_6 = NULL;\n        __Pyx_GIVEREF(__pyx_t_5);\n        PyTuple_SET_ITEM(__pyx_t_8, 0+1, __pyx_t_5);\n        __pyx_t_5 = 0;\n        __pyx_t_3 = __Pyx_PyObject_Call(__pyx_t_4, __pyx_t_8, NULL); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 3264, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_3);\n        __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0;\n      }\n    }\n    __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n    __Pyx_Raise(__pyx_t_3, 0, 0, 0);\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    __PYX_ERR(0, 3264, __pyx_L1_error)\n\n    /* \"pywrapfst.pyx\":3263\n *                weight=None):\n *   cdef fst.MapType map_type_enum\n *   if not fst.GetMapType(tostring(map_type), addr(map_type_enum)):             # <<<<<<<<<<<<<<\n *     raise FstArgError(\"Unknown map type: {!r}\".format(map_type))\n *   cdef fst.WeightClass wc = (_get_WeightClass_or_One(ifst.weight_type(),\n */\n  }\n\n  /* \"pywrapfst.pyx\":3266\n *     raise FstArgError(\"Unknown map type: {!r}\".format(map_type))\n *   cdef fst.WeightClass wc = (_get_WeightClass_or_One(ifst.weight_type(),\n *       weight) if map_type_enum == fst.TIMES_MAPPER else             # <<<<<<<<<<<<<<\n *       _get_WeightClass_or_Zero(ifst.weight_type(), weight))\n *   return _init_XFst(fst.Map(deref(ifst._fst), map_type_enum, delta, power, wc))\n */\n  if (((__pyx_v_map_type_enum == fst::script::TIMES_MAPPER) != 0)) {\n\n    /* \"pywrapfst.pyx\":3265\n *   if not fst.GetMapType(tostring(map_type), addr(map_type_enum)):\n *     raise FstArgError(\"Unknown map type: {!r}\".format(map_type))\n *   cdef fst.WeightClass wc = (_get_WeightClass_or_One(ifst.weight_type(),             # <<<<<<<<<<<<<<\n *       weight) if map_type_enum == fst.TIMES_MAPPER else\n *       _get_WeightClass_or_Zero(ifst.weight_type(), weight))\n */\n    if (unlikely(((PyObject *)__pyx_v_ifst) == Py_None)) {\n      PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"weight_type\");\n      __PYX_ERR(0, 3265, __pyx_L1_error)\n    }\n\n    /* \"pywrapfst.pyx\":3266\n *     raise FstArgError(\"Unknown map type: {!r}\".format(map_type))\n *   cdef fst.WeightClass wc = (_get_WeightClass_or_One(ifst.weight_type(),\n *       weight) if map_type_enum == fst.TIMES_MAPPER else             # <<<<<<<<<<<<<<\n *       _get_WeightClass_or_Zero(ifst.weight_type(), weight))\n *   return _init_XFst(fst.Map(deref(ifst._fst), map_type_enum, delta, power, wc))\n */\n    __pyx_t_10 = __pyx_f_9pywrapfst__get_WeightClass_or_One(((struct __pyx_vtabstruct_9pywrapfst__Fst *)__pyx_v_ifst->__pyx_vtab)->weight_type(__pyx_v_ifst, 0), __pyx_v_weight); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 3265, __pyx_L1_error)\n    __pyx_t_9 = __pyx_t_10;\n  } else {\n\n    /* \"pywrapfst.pyx\":3267\n *   cdef fst.WeightClass wc = (_get_WeightClass_or_One(ifst.weight_type(),\n *       weight) if map_type_enum == fst.TIMES_MAPPER else\n *       _get_WeightClass_or_Zero(ifst.weight_type(), weight))             # <<<<<<<<<<<<<<\n *   return _init_XFst(fst.Map(deref(ifst._fst), map_type_enum, delta, power, wc))\n * \n */\n    if (unlikely(((PyObject *)__pyx_v_ifst) == Py_None)) {\n      PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"weight_type\");\n      __PYX_ERR(0, 3267, __pyx_L1_error)\n    }\n    __pyx_t_10 = __pyx_f_9pywrapfst__get_WeightClass_or_Zero(((struct __pyx_vtabstruct_9pywrapfst__Fst *)__pyx_v_ifst->__pyx_vtab)->weight_type(__pyx_v_ifst, 0), __pyx_v_weight); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 3267, __pyx_L1_error)\n    __pyx_t_9 = __pyx_t_10;\n  }\n  __pyx_v_wc = __pyx_t_9;\n\n  /* \"pywrapfst.pyx\":3268\n *       weight) if map_type_enum == fst.TIMES_MAPPER else\n *       _get_WeightClass_or_Zero(ifst.weight_type(), weight))\n *   return _init_XFst(fst.Map(deref(ifst._fst), map_type_enum, delta, power, wc))             # <<<<<<<<<<<<<<\n * \n * \n */\n  __Pyx_XDECREF(((PyObject *)__pyx_r));\n  if (unlikely(((PyObject *)__pyx_v_ifst) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 3268, __pyx_L1_error)\n  }\n  __pyx_t_3 = ((PyObject *)__pyx_f_9pywrapfst__init_XFst(fst::script::Map((*__pyx_v_ifst->_fst), __pyx_v_map_type_enum, __pyx_v_delta, __pyx_v_power, __pyx_v_wc))); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 3268, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_3);\n  __pyx_r = ((struct __pyx_obj_9pywrapfst__Fst *)__pyx_t_3);\n  __pyx_t_3 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":3257\n * \n * \n * cdef _Fst _map(_Fst ifst,             # <<<<<<<<<<<<<<\n *                float delta=fst.kDelta,\n *                map_type=b\"identity\",\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_XDECREF(__pyx_t_6);\n  __Pyx_XDECREF(__pyx_t_7);\n  __Pyx_XDECREF(__pyx_t_8);\n  __Pyx_AddTraceback(\"pywrapfst._map\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XGIVEREF((PyObject *)__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":3271\n * \n * \n * cpdef _Fst arcmap(_Fst ifst,             # <<<<<<<<<<<<<<\n *                   float delta=fst.kDelta,\n *                   map_type=b\"identity\",\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_17arcmap(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic struct __pyx_obj_9pywrapfst__Fst *__pyx_f_9pywrapfst_arcmap(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst, CYTHON_UNUSED int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_arcmap *__pyx_optional_args) {\n  float __pyx_v_delta = __pyx_k__68;\n  PyObject *__pyx_v_map_type = ((PyObject *)__pyx_n_b_identity);\n  double __pyx_v_power = ((double)1.);\n\n  /* \"pywrapfst.pyx\":3275\n *                   map_type=b\"identity\",\n *                   double power=1.,\n *                   weight=None):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   arcmap(ifst, delta=0.0009765625, map_type=\"identity\", weight=None)\n */\n  PyObject *__pyx_v_weight = ((PyObject *)Py_None);\n  struct __pyx_obj_9pywrapfst__Fst *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  struct __pyx_opt_args_9pywrapfst__map __pyx_t_2;\n  __Pyx_RefNannySetupContext(\"arcmap\", 0);\n  if (__pyx_optional_args) {\n    if (__pyx_optional_args->__pyx_n > 0) {\n      __pyx_v_delta = __pyx_optional_args->delta;\n      if (__pyx_optional_args->__pyx_n > 1) {\n        __pyx_v_map_type = __pyx_optional_args->map_type;\n        if (__pyx_optional_args->__pyx_n > 2) {\n          __pyx_v_power = __pyx_optional_args->power;\n          if (__pyx_optional_args->__pyx_n > 3) {\n            __pyx_v_weight = __pyx_optional_args->weight;\n          }\n        }\n      }\n    }\n  }\n\n  /* \"pywrapfst.pyx\":3318\n *   See also: `statemap`.\n *   \"\"\"\n *   return _map(ifst, delta, map_type, power, weight)             # <<<<<<<<<<<<<<\n * \n * \n */\n  __Pyx_XDECREF(((PyObject *)__pyx_r));\n  __pyx_t_2.__pyx_n = 4;\n  __pyx_t_2.delta = __pyx_v_delta;\n  __pyx_t_2.map_type = __pyx_v_map_type;\n  __pyx_t_2.power = __pyx_v_power;\n  __pyx_t_2.weight = __pyx_v_weight;\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst__map(__pyx_v_ifst, &__pyx_t_2)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3318, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = ((struct __pyx_obj_9pywrapfst__Fst *)__pyx_t_1);\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":3271\n * \n * \n * cpdef _Fst arcmap(_Fst ifst,             # <<<<<<<<<<<<<<\n *                   float delta=fst.kDelta,\n *                   map_type=b\"identity\",\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.arcmap\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XGIVEREF((PyObject *)__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_17arcmap(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic char __pyx_doc_9pywrapfst_16arcmap[] = \"\\n  arcmap(ifst, delta=0.0009765625, map_type=\\\"identity\\\", weight=None)\\n\\n  Constructively applies a transform to all arcs and final states.\\n\\n  This operation transforms each arc and final state in the input FST using\\n  one of the following:\\n\\n    * identity: maps to self.\\n    * input_epsilon: replaces all input labels with epsilon.\\n    * invert: reciprocates all non-Zero weights.\\n    * float_power: raises all weights to a floating-point power.\\n    * output_epsilon: replaces all output labels with epsilon.\\n    * quantize: quantizes weights.\\n    * plus: adds a constant to all weights.\\n    * power: raises all weights to an integral power.\\n    * rmweight: replaces all non-Zero weights with 1.\\n    * superfinal: redirects final states to a new superfinal state.\\n    * times: right-multiplies a constant to all weights.\\n    * to_log: converts weights to the log semiring.\\n    * to_log64: converts weights to the log64 semiring.\\n    * to_standard: converts weights to the tropical (\\\"standard\\\") semiring.\\n\\n  Args:\\n    ifst: The input FST.\\n    delta: Comparison/quantization delta (ignored unless `map_type` is\\n        `quantize`).\\n    map_type: A string matching a known mapping operation (see above).\\n    power: A positive scalar or integer power; ignored unless `map_type` is\\n        `float_power` or `power` (in which case it defaults to 1).\\n    weight: A Weight or weight string passed to the arc-mapper; ignored unless\\n        `map_type` is `plus` (in which case it defaults to semiring Zero) or\\n        `times` (in which case it defaults to semiring One).\\n\\n  Returns:\\n    An FST with arcs and final states remapped.\\n\\n  Raises:\\n    FstArgError: Unknown map type.\\n\\n  See also: `statemap`.\\n  \";\nstatic PyObject *__pyx_pw_9pywrapfst_17arcmap(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst = 0;\n  float __pyx_v_delta;\n  PyObject *__pyx_v_map_type = 0;\n  double __pyx_v_power;\n  PyObject *__pyx_v_weight = 0;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"arcmap (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_ifst,&__pyx_n_s_delta,&__pyx_n_s_map_type,&__pyx_n_s_power,&__pyx_n_s_weight,0};\n    PyObject* values[5] = {0,0,0,0,0};\n    values[2] = ((PyObject *)__pyx_n_b_identity);\n\n    /* \"pywrapfst.pyx\":3275\n *                   map_type=b\"identity\",\n *                   double power=1.,\n *                   weight=None):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   arcmap(ifst, delta=0.0009765625, map_type=\"identity\", weight=None)\n */\n    values[4] = ((PyObject *)Py_None);\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  5: values[4] = PyTuple_GET_ITEM(__pyx_args, 4);\n        CYTHON_FALLTHROUGH;\n        case  4: values[3] = PyTuple_GET_ITEM(__pyx_args, 3);\n        CYTHON_FALLTHROUGH;\n        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);\n        CYTHON_FALLTHROUGH;\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (likely((values[0] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_ifst)) != 0)) kw_args--;\n        else goto __pyx_L5_argtuple_error;\n        CYTHON_FALLTHROUGH;\n        case  1:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_delta);\n          if (value) { values[1] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  2:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_map_type);\n          if (value) { values[2] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  3:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_power);\n          if (value) { values[3] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  4:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_weight);\n          if (value) { values[4] = value; kw_args--; }\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"arcmap\") < 0)) __PYX_ERR(0, 3271, __pyx_L3_error)\n      }\n    } else {\n      switch (PyTuple_GET_SIZE(__pyx_args)) {\n        case  5: values[4] = PyTuple_GET_ITEM(__pyx_args, 4);\n        CYTHON_FALLTHROUGH;\n        case  4: values[3] = PyTuple_GET_ITEM(__pyx_args, 3);\n        CYTHON_FALLTHROUGH;\n        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);\n        CYTHON_FALLTHROUGH;\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n    }\n    __pyx_v_ifst = ((struct __pyx_obj_9pywrapfst__Fst *)values[0]);\n    if (values[1]) {\n      __pyx_v_delta = __pyx_PyFloat_AsFloat(values[1]); if (unlikely((__pyx_v_delta == (float)-1) && PyErr_Occurred())) __PYX_ERR(0, 3272, __pyx_L3_error)\n    } else {\n      __pyx_v_delta = __pyx_k__68;\n    }\n    __pyx_v_map_type = values[2];\n    if (values[3]) {\n      __pyx_v_power = __pyx_PyFloat_AsDouble(values[3]); if (unlikely((__pyx_v_power == (double)-1) && PyErr_Occurred())) __PYX_ERR(0, 3274, __pyx_L3_error)\n    } else {\n      __pyx_v_power = ((double)1.);\n    }\n    __pyx_v_weight = values[4];\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"arcmap\", 0, 1, 5, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 3271, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst.arcmap\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_ifst), __pyx_ptype_9pywrapfst__Fst, 1, \"ifst\", 0))) __PYX_ERR(0, 3271, __pyx_L1_error)\n  __pyx_r = __pyx_pf_9pywrapfst_16arcmap(__pyx_self, __pyx_v_ifst, __pyx_v_delta, __pyx_v_map_type, __pyx_v_power, __pyx_v_weight);\n\n  /* \"pywrapfst.pyx\":3271\n * \n * \n * cpdef _Fst arcmap(_Fst ifst,             # <<<<<<<<<<<<<<\n *                   float delta=fst.kDelta,\n *                   map_type=b\"identity\",\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_16arcmap(CYTHON_UNUSED PyObject *__pyx_self, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst, float __pyx_v_delta, PyObject *__pyx_v_map_type, double __pyx_v_power, PyObject *__pyx_v_weight) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  struct __pyx_opt_args_9pywrapfst_arcmap __pyx_t_2;\n  __Pyx_RefNannySetupContext(\"arcmap\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_2.__pyx_n = 4;\n  __pyx_t_2.delta = __pyx_v_delta;\n  __pyx_t_2.map_type = __pyx_v_map_type;\n  __pyx_t_2.power = __pyx_v_power;\n  __pyx_t_2.weight = __pyx_v_weight;\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst_arcmap(__pyx_v_ifst, 0, &__pyx_t_2)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3271, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.arcmap\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":3321\n * \n * \n * cpdef _MutableFst compose(_Fst ifst1,             # <<<<<<<<<<<<<<\n *                           _Fst ifst2,\n *                           compose_filter=b\"auto\",\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_19compose(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic struct __pyx_obj_9pywrapfst__MutableFst *__pyx_f_9pywrapfst_compose(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst1, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst2, CYTHON_UNUSED int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_compose *__pyx_optional_args) {\n  PyObject *__pyx_v_compose_filter = ((PyObject *)__pyx_n_b_auto);\n\n  /* \"pywrapfst.pyx\":3324\n *                           _Fst ifst2,\n *                           compose_filter=b\"auto\",\n *                           bool connect=True):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   compose(ifst1, ifst2, compose_filter=\"auto\", connect=True)\n */\n  bool __pyx_v_connect = ((bool)1);\n  std::unique_ptr<fst::script::VectorFstClass>  __pyx_v_tfst;\n  std::unique_ptr<fst::ComposeOptions>  __pyx_v_opts;\n  struct __pyx_obj_9pywrapfst__MutableFst *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  std::string __pyx_t_1;\n  enum fst::ComposeFilter __pyx_t_2;\n  PyObject *__pyx_t_3 = NULL;\n  __Pyx_RefNannySetupContext(\"compose\", 0);\n  if (__pyx_optional_args) {\n    if (__pyx_optional_args->__pyx_n > 0) {\n      __pyx_v_compose_filter = __pyx_optional_args->compose_filter;\n      if (__pyx_optional_args->__pyx_n > 1) {\n        __pyx_v_connect = __pyx_optional_args->connect;\n      }\n    }\n  }\n\n  /* \"pywrapfst.pyx\":3349\n *   \"\"\"\n *   cdef unique_ptr[fst.VectorFstClass] tfst\n *   tfst.reset(new fst.VectorFstClass(ifst1.arc_type()))             # <<<<<<<<<<<<<<\n *   cdef unique_ptr[fst.ComposeOptions] opts\n *   opts.reset(new fst.ComposeOptions(connect,\n */\n  if (unlikely(((PyObject *)__pyx_v_ifst1) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"arc_type\");\n    __PYX_ERR(0, 3349, __pyx_L1_error)\n  }\n  __pyx_v_tfst.reset(new fst::script::VectorFstClass(((struct __pyx_vtabstruct_9pywrapfst__Fst *)__pyx_v_ifst1->__pyx_vtab)->arc_type(__pyx_v_ifst1, 0)));\n\n  /* \"pywrapfst.pyx\":3352\n *   cdef unique_ptr[fst.ComposeOptions] opts\n *   opts.reset(new fst.ComposeOptions(connect,\n *       _get_compose_filter(tostring(compose_filter))))             # <<<<<<<<<<<<<<\n *   fst.Compose(deref(ifst1._fst), deref(ifst2._fst), tfst.get(), deref(opts))\n *   return _init_MutableFst(tfst.release())\n */\n  __pyx_t_1 = __pyx_f_9pywrapfst_tostring(__pyx_v_compose_filter, NULL); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 3352, __pyx_L1_error)\n  __pyx_t_2 = __pyx_f_9pywrapfst__get_compose_filter(__pyx_t_1); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 3352, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":3351\n *   tfst.reset(new fst.VectorFstClass(ifst1.arc_type()))\n *   cdef unique_ptr[fst.ComposeOptions] opts\n *   opts.reset(new fst.ComposeOptions(connect,             # <<<<<<<<<<<<<<\n *       _get_compose_filter(tostring(compose_filter))))\n *   fst.Compose(deref(ifst1._fst), deref(ifst2._fst), tfst.get(), deref(opts))\n */\n  __pyx_v_opts.reset(new fst::ComposeOptions(__pyx_v_connect, __pyx_t_2));\n\n  /* \"pywrapfst.pyx\":3353\n *   opts.reset(new fst.ComposeOptions(connect,\n *       _get_compose_filter(tostring(compose_filter))))\n *   fst.Compose(deref(ifst1._fst), deref(ifst2._fst), tfst.get(), deref(opts))             # <<<<<<<<<<<<<<\n *   return _init_MutableFst(tfst.release())\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_ifst1) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 3353, __pyx_L1_error)\n  }\n  if (unlikely(((PyObject *)__pyx_v_ifst2) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 3353, __pyx_L1_error)\n  }\n  fst::script::Compose((*__pyx_v_ifst1->_fst), (*__pyx_v_ifst2->_fst), __pyx_v_tfst.get(), (*__pyx_v_opts));\n\n  /* \"pywrapfst.pyx\":3354\n *       _get_compose_filter(tostring(compose_filter))))\n *   fst.Compose(deref(ifst1._fst), deref(ifst2._fst), tfst.get(), deref(opts))\n *   return _init_MutableFst(tfst.release())             # <<<<<<<<<<<<<<\n * \n * \n */\n  __Pyx_XDECREF(((PyObject *)__pyx_r));\n  __pyx_t_3 = ((PyObject *)__pyx_f_9pywrapfst__init_MutableFst(__pyx_v_tfst.release())); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 3354, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_3);\n  __pyx_r = ((struct __pyx_obj_9pywrapfst__MutableFst *)__pyx_t_3);\n  __pyx_t_3 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":3321\n * \n * \n * cpdef _MutableFst compose(_Fst ifst1,             # <<<<<<<<<<<<<<\n *                           _Fst ifst2,\n *                           compose_filter=b\"auto\",\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_AddTraceback(\"pywrapfst.compose\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XGIVEREF((PyObject *)__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_19compose(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic char __pyx_doc_9pywrapfst_18compose[] = \"\\n  compose(ifst1, ifst2, compose_filter=\\\"auto\\\", connect=True)\\n\\n  Constructively composes two FSTs.\\n\\n  This operation computes the composition of two FSTs. If A transduces string\\n  x to y with weight a and B transduces y to z with weight b, then their\\n  composition transduces string x to z with weight a \\\\otimes b. The output\\n  labels of the first transducer or the input labels of the second transducer\\n  must be sorted (or otherwise support appropriate matchers).\\n\\n  Args:\\n    ifst1: The first input FST.\\n    ifst2: The second input FST.\\n    compose_filter: A string matching a known composition filter; one of:\\n        \\\"alt_sequence\\\", \\\"auto\\\", \\\"match\\\", \\\"null\\\", \\\"sequence\\\", \\\"trivial\\\".\\n    connect: Should output be trimmed?\\n\\n  Returns:\\n    An FST.\\n\\n  See also: `arcsort`.\\n  \";\nstatic PyObject *__pyx_pw_9pywrapfst_19compose(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst1 = 0;\n  struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst2 = 0;\n  PyObject *__pyx_v_compose_filter = 0;\n  bool __pyx_v_connect;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"compose (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_ifst1,&__pyx_n_s_ifst2,&__pyx_n_s_compose_filter,&__pyx_n_s_connect,0};\n    PyObject* values[4] = {0,0,0,0};\n    values[2] = ((PyObject *)__pyx_n_b_auto);\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  4: values[3] = PyTuple_GET_ITEM(__pyx_args, 3);\n        CYTHON_FALLTHROUGH;\n        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);\n        CYTHON_FALLTHROUGH;\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (likely((values[0] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_ifst1)) != 0)) kw_args--;\n        else goto __pyx_L5_argtuple_error;\n        CYTHON_FALLTHROUGH;\n        case  1:\n        if (likely((values[1] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_ifst2)) != 0)) kw_args--;\n        else {\n          __Pyx_RaiseArgtupleInvalid(\"compose\", 0, 2, 4, 1); __PYX_ERR(0, 3321, __pyx_L3_error)\n        }\n        CYTHON_FALLTHROUGH;\n        case  2:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_compose_filter);\n          if (value) { values[2] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  3:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_connect);\n          if (value) { values[3] = value; kw_args--; }\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"compose\") < 0)) __PYX_ERR(0, 3321, __pyx_L3_error)\n      }\n    } else {\n      switch (PyTuple_GET_SIZE(__pyx_args)) {\n        case  4: values[3] = PyTuple_GET_ITEM(__pyx_args, 3);\n        CYTHON_FALLTHROUGH;\n        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);\n        CYTHON_FALLTHROUGH;\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n    }\n    __pyx_v_ifst1 = ((struct __pyx_obj_9pywrapfst__Fst *)values[0]);\n    __pyx_v_ifst2 = ((struct __pyx_obj_9pywrapfst__Fst *)values[1]);\n    __pyx_v_compose_filter = values[2];\n    if (values[3]) {\n      __pyx_v_connect = __Pyx_PyObject_IsTrue(values[3]); if (unlikely((__pyx_v_connect == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 3324, __pyx_L3_error)\n    } else {\n\n      /* \"pywrapfst.pyx\":3324\n *                           _Fst ifst2,\n *                           compose_filter=b\"auto\",\n *                           bool connect=True):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   compose(ifst1, ifst2, compose_filter=\"auto\", connect=True)\n */\n      __pyx_v_connect = ((bool)1);\n    }\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"compose\", 0, 2, 4, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 3321, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst.compose\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_ifst1), __pyx_ptype_9pywrapfst__Fst, 1, \"ifst1\", 0))) __PYX_ERR(0, 3321, __pyx_L1_error)\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_ifst2), __pyx_ptype_9pywrapfst__Fst, 1, \"ifst2\", 0))) __PYX_ERR(0, 3322, __pyx_L1_error)\n  __pyx_r = __pyx_pf_9pywrapfst_18compose(__pyx_self, __pyx_v_ifst1, __pyx_v_ifst2, __pyx_v_compose_filter, __pyx_v_connect);\n\n  /* \"pywrapfst.pyx\":3321\n * \n * \n * cpdef _MutableFst compose(_Fst ifst1,             # <<<<<<<<<<<<<<\n *                           _Fst ifst2,\n *                           compose_filter=b\"auto\",\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_18compose(CYTHON_UNUSED PyObject *__pyx_self, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst1, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst2, PyObject *__pyx_v_compose_filter, bool __pyx_v_connect) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  struct __pyx_opt_args_9pywrapfst_compose __pyx_t_2;\n  __Pyx_RefNannySetupContext(\"compose\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_2.__pyx_n = 2;\n  __pyx_t_2.compose_filter = __pyx_v_compose_filter;\n  __pyx_t_2.connect = __pyx_v_connect;\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst_compose(__pyx_v_ifst1, __pyx_v_ifst2, 0, &__pyx_t_2)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3321, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.compose\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":3357\n * \n * \n * cpdef _Fst convert(_Fst ifst, fst_type=None):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   convert(ifst, fst_type=None)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_21convert(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic struct __pyx_obj_9pywrapfst__Fst *__pyx_f_9pywrapfst_convert(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst, CYTHON_UNUSED int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_convert *__pyx_optional_args) {\n  PyObject *__pyx_v_fst_type = ((PyObject *)Py_None);\n  std::string __pyx_v_fst_type_string;\n  std::unique_ptr<fst::script::FstClass>  __pyx_v_tfst;\n  struct __pyx_obj_9pywrapfst__Fst *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  std::string __pyx_t_1;\n  int __pyx_t_2;\n  std::string __pyx_t_3;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  PyObject *__pyx_t_6 = NULL;\n  PyObject *__pyx_t_7 = NULL;\n  PyObject *__pyx_t_8 = NULL;\n  PyObject *__pyx_t_9 = NULL;\n  __Pyx_RefNannySetupContext(\"convert\", 0);\n  if (__pyx_optional_args) {\n    if (__pyx_optional_args->__pyx_n > 0) {\n      __pyx_v_fst_type = __pyx_optional_args->fst_type;\n    }\n  }\n\n  /* \"pywrapfst.pyx\":3374\n *     FstOpError: Conversion failed.\n *   \"\"\"\n *   cdef string fst_type_string = b\"\" if fst_type is None else tostring(fst_type)             # <<<<<<<<<<<<<<\n *   cdef unique_ptr[fst.FstClass] tfst\n *   tfst.reset(fst.Convert(deref(ifst._fst), fst_type_string))\n */\n  __pyx_t_2 = (__pyx_v_fst_type == Py_None);\n  if ((__pyx_t_2 != 0)) {\n    __pyx_t_3 = __pyx_convert_string_from_py_std__in_string(__pyx_kp_b__24); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 3374, __pyx_L1_error)\n    __pyx_t_1 = __pyx_t_3;\n  } else {\n    __pyx_t_3 = __pyx_f_9pywrapfst_tostring(__pyx_v_fst_type, NULL); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 3374, __pyx_L1_error)\n    __pyx_t_4 = __pyx_convert_PyBytes_string_to_py_std__in_string(__pyx_t_3); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 3374, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_4);\n    __pyx_t_3 = __pyx_convert_string_from_py_std__in_string(__pyx_t_4); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 3374, __pyx_L1_error)\n    __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n    __pyx_t_1 = __pyx_t_3;\n  }\n  __pyx_v_fst_type_string = __pyx_t_1;\n\n  /* \"pywrapfst.pyx\":3376\n *   cdef string fst_type_string = b\"\" if fst_type is None else tostring(fst_type)\n *   cdef unique_ptr[fst.FstClass] tfst\n *   tfst.reset(fst.Convert(deref(ifst._fst), fst_type_string))             # <<<<<<<<<<<<<<\n *   # Script-land Convert returns a null pointer to signal failure.\n *   if tfst.get() == NULL:\n */\n  if (unlikely(((PyObject *)__pyx_v_ifst) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 3376, __pyx_L1_error)\n  }\n  __pyx_v_tfst.reset(fst::script::Convert((*__pyx_v_ifst->_fst), __pyx_v_fst_type_string));\n\n  /* \"pywrapfst.pyx\":3378\n *   tfst.reset(fst.Convert(deref(ifst._fst), fst_type_string))\n *   # Script-land Convert returns a null pointer to signal failure.\n *   if tfst.get() == NULL:             # <<<<<<<<<<<<<<\n *     raise FstOpError(\"Conversion to {!r} failed\".format(fst_type))\n *   return _init_XFst(tfst.release())\n */\n  __pyx_t_2 = ((__pyx_v_tfst.get() == NULL) != 0);\n  if (__pyx_t_2) {\n\n    /* \"pywrapfst.pyx\":3379\n *   # Script-land Convert returns a null pointer to signal failure.\n *   if tfst.get() == NULL:\n *     raise FstOpError(\"Conversion to {!r} failed\".format(fst_type))             # <<<<<<<<<<<<<<\n *   return _init_XFst(tfst.release())\n * \n */\n    __pyx_t_5 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstOpError); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 3379, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_5);\n    __pyx_t_7 = __Pyx_PyObject_GetAttrStr(__pyx_kp_s_Conversion_to_r_failed, __pyx_n_s_format); if (unlikely(!__pyx_t_7)) __PYX_ERR(0, 3379, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_7);\n    __pyx_t_8 = NULL;\n    if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_7))) {\n      __pyx_t_8 = PyMethod_GET_SELF(__pyx_t_7);\n      if (likely(__pyx_t_8)) {\n        PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_7);\n        __Pyx_INCREF(__pyx_t_8);\n        __Pyx_INCREF(function);\n        __Pyx_DECREF_SET(__pyx_t_7, function);\n      }\n    }\n    if (!__pyx_t_8) {\n      __pyx_t_6 = __Pyx_PyObject_CallOneArg(__pyx_t_7, __pyx_v_fst_type); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 3379, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_6);\n    } else {\n      #if CYTHON_FAST_PYCALL\n      if (PyFunction_Check(__pyx_t_7)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_8, __pyx_v_fst_type};\n        __pyx_t_6 = __Pyx_PyFunction_FastCall(__pyx_t_7, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 3379, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_8); __pyx_t_8 = 0;\n        __Pyx_GOTREF(__pyx_t_6);\n      } else\n      #endif\n      #if CYTHON_FAST_PYCCALL\n      if (__Pyx_PyFastCFunction_Check(__pyx_t_7)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_8, __pyx_v_fst_type};\n        __pyx_t_6 = __Pyx_PyCFunction_FastCall(__pyx_t_7, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 3379, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_8); __pyx_t_8 = 0;\n        __Pyx_GOTREF(__pyx_t_6);\n      } else\n      #endif\n      {\n        __pyx_t_9 = PyTuple_New(1+1); if (unlikely(!__pyx_t_9)) __PYX_ERR(0, 3379, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_9);\n        __Pyx_GIVEREF(__pyx_t_8); PyTuple_SET_ITEM(__pyx_t_9, 0, __pyx_t_8); __pyx_t_8 = NULL;\n        __Pyx_INCREF(__pyx_v_fst_type);\n        __Pyx_GIVEREF(__pyx_v_fst_type);\n        PyTuple_SET_ITEM(__pyx_t_9, 0+1, __pyx_v_fst_type);\n        __pyx_t_6 = __Pyx_PyObject_Call(__pyx_t_7, __pyx_t_9, NULL); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 3379, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_6);\n        __Pyx_DECREF(__pyx_t_9); __pyx_t_9 = 0;\n      }\n    }\n    __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0;\n    __pyx_t_7 = NULL;\n    if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_5))) {\n      __pyx_t_7 = PyMethod_GET_SELF(__pyx_t_5);\n      if (likely(__pyx_t_7)) {\n        PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_5);\n        __Pyx_INCREF(__pyx_t_7);\n        __Pyx_INCREF(function);\n        __Pyx_DECREF_SET(__pyx_t_5, function);\n      }\n    }\n    if (!__pyx_t_7) {\n      __pyx_t_4 = __Pyx_PyObject_CallOneArg(__pyx_t_5, __pyx_t_6); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 3379, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n      __Pyx_GOTREF(__pyx_t_4);\n    } else {\n      #if CYTHON_FAST_PYCALL\n      if (PyFunction_Check(__pyx_t_5)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_7, __pyx_t_6};\n        __pyx_t_4 = __Pyx_PyFunction_FastCall(__pyx_t_5, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 3379, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_7); __pyx_t_7 = 0;\n        __Pyx_GOTREF(__pyx_t_4);\n        __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n      } else\n      #endif\n      #if CYTHON_FAST_PYCCALL\n      if (__Pyx_PyFastCFunction_Check(__pyx_t_5)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_7, __pyx_t_6};\n        __pyx_t_4 = __Pyx_PyCFunction_FastCall(__pyx_t_5, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 3379, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_7); __pyx_t_7 = 0;\n        __Pyx_GOTREF(__pyx_t_4);\n        __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n      } else\n      #endif\n      {\n        __pyx_t_9 = PyTuple_New(1+1); if (unlikely(!__pyx_t_9)) __PYX_ERR(0, 3379, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_9);\n        __Pyx_GIVEREF(__pyx_t_7); PyTuple_SET_ITEM(__pyx_t_9, 0, __pyx_t_7); __pyx_t_7 = NULL;\n        __Pyx_GIVEREF(__pyx_t_6);\n        PyTuple_SET_ITEM(__pyx_t_9, 0+1, __pyx_t_6);\n        __pyx_t_6 = 0;\n        __pyx_t_4 = __Pyx_PyObject_Call(__pyx_t_5, __pyx_t_9, NULL); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 3379, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_4);\n        __Pyx_DECREF(__pyx_t_9); __pyx_t_9 = 0;\n      }\n    }\n    __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n    __Pyx_Raise(__pyx_t_4, 0, 0, 0);\n    __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n    __PYX_ERR(0, 3379, __pyx_L1_error)\n\n    /* \"pywrapfst.pyx\":3378\n *   tfst.reset(fst.Convert(deref(ifst._fst), fst_type_string))\n *   # Script-land Convert returns a null pointer to signal failure.\n *   if tfst.get() == NULL:             # <<<<<<<<<<<<<<\n *     raise FstOpError(\"Conversion to {!r} failed\".format(fst_type))\n *   return _init_XFst(tfst.release())\n */\n  }\n\n  /* \"pywrapfst.pyx\":3380\n *   if tfst.get() == NULL:\n *     raise FstOpError(\"Conversion to {!r} failed\".format(fst_type))\n *   return _init_XFst(tfst.release())             # <<<<<<<<<<<<<<\n * \n * \n */\n  __Pyx_XDECREF(((PyObject *)__pyx_r));\n  __pyx_t_4 = ((PyObject *)__pyx_f_9pywrapfst__init_XFst(__pyx_v_tfst.release())); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 3380, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_4);\n  __pyx_r = ((struct __pyx_obj_9pywrapfst__Fst *)__pyx_t_4);\n  __pyx_t_4 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":3357\n * \n * \n * cpdef _Fst convert(_Fst ifst, fst_type=None):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   convert(ifst, fst_type=None)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_XDECREF(__pyx_t_6);\n  __Pyx_XDECREF(__pyx_t_7);\n  __Pyx_XDECREF(__pyx_t_8);\n  __Pyx_XDECREF(__pyx_t_9);\n  __Pyx_AddTraceback(\"pywrapfst.convert\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XGIVEREF((PyObject *)__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_21convert(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic char __pyx_doc_9pywrapfst_20convert[] = \"\\n  convert(ifst, fst_type=None)\\n\\n  Constructively converts an FST to a new internal representation.\\n\\n  Args:\\n    ifst: The input FST.\\n    fst_type: A string indicating the FST type to convert to, or None if\\n        no conversion is desired.\\n\\n  Returns:\\n    An equivalent Fst converted to the desired FST type.\\n\\n  Raises:\\n    FstOpError: Conversion failed.\\n  \";\nstatic PyObject *__pyx_pw_9pywrapfst_21convert(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst = 0;\n  PyObject *__pyx_v_fst_type = 0;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"convert (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_ifst,&__pyx_n_s_fst_type,0};\n    PyObject* values[2] = {0,0};\n    values[1] = ((PyObject *)Py_None);\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (likely((values[0] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_ifst)) != 0)) kw_args--;\n        else goto __pyx_L5_argtuple_error;\n        CYTHON_FALLTHROUGH;\n        case  1:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_fst_type);\n          if (value) { values[1] = value; kw_args--; }\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"convert\") < 0)) __PYX_ERR(0, 3357, __pyx_L3_error)\n      }\n    } else {\n      switch (PyTuple_GET_SIZE(__pyx_args)) {\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n    }\n    __pyx_v_ifst = ((struct __pyx_obj_9pywrapfst__Fst *)values[0]);\n    __pyx_v_fst_type = values[1];\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"convert\", 0, 1, 2, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 3357, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst.convert\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_ifst), __pyx_ptype_9pywrapfst__Fst, 1, \"ifst\", 0))) __PYX_ERR(0, 3357, __pyx_L1_error)\n  __pyx_r = __pyx_pf_9pywrapfst_20convert(__pyx_self, __pyx_v_ifst, __pyx_v_fst_type);\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_20convert(CYTHON_UNUSED PyObject *__pyx_self, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst, PyObject *__pyx_v_fst_type) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  struct __pyx_opt_args_9pywrapfst_convert __pyx_t_2;\n  __Pyx_RefNannySetupContext(\"convert\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_2.__pyx_n = 1;\n  __pyx_t_2.fst_type = __pyx_v_fst_type;\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst_convert(__pyx_v_ifst, 0, &__pyx_t_2)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3357, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.convert\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":3383\n * \n * \n * cpdef _MutableFst determinize(_Fst ifst,             # <<<<<<<<<<<<<<\n *                               float delta=fst.kShortestDelta,\n *                               det_type=b\"functional\",\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_23determinize(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic struct __pyx_obj_9pywrapfst__MutableFst *__pyx_f_9pywrapfst_determinize(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst, CYTHON_UNUSED int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_determinize *__pyx_optional_args) {\n  float __pyx_v_delta = __pyx_k__69;\n  PyObject *__pyx_v_det_type = ((PyObject *)__pyx_n_b_functional);\n  __pyx_t_10basictypes_int64 __pyx_v_nstate = __pyx_k__70;\n  __pyx_t_10basictypes_int64 __pyx_v_subsequential_label = ((__pyx_t_10basictypes_int64)0);\n\n  /* \"pywrapfst.pyx\":3388\n *                               int64 nstate=fst.kNoStateId,\n *                               int64 subsequential_label=0,\n *                               weight=None,             # <<<<<<<<<<<<<<\n *                               bool increment_subsequential_label=False):\n *   \"\"\"\n */\n  PyObject *__pyx_v_weight = ((PyObject *)Py_None);\n\n  /* \"pywrapfst.pyx\":3389\n *                               int64 subsequential_label=0,\n *                               weight=None,\n *                               bool increment_subsequential_label=False):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   determinize(ifst, delta=1e-6, det_type=\"functional\",\n */\n  bool __pyx_v_increment_subsequential_label = ((bool)0);\n  std::unique_ptr<fst::script::VectorFstClass>  __pyx_v_tfst;\n  fst::script::WeightClass __pyx_v_wc;\n  enum fst::DeterminizeType __pyx_v_determinize_type_enum;\n  std::unique_ptr<fst::script::DeterminizeOptions>  __pyx_v_opts;\n  struct __pyx_obj_9pywrapfst__MutableFst *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  fst::script::WeightClass __pyx_t_1;\n  std::string __pyx_t_2;\n  int __pyx_t_3;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  PyObject *__pyx_t_6 = NULL;\n  PyObject *__pyx_t_7 = NULL;\n  PyObject *__pyx_t_8 = NULL;\n  PyObject *__pyx_t_9 = NULL;\n  __Pyx_RefNannySetupContext(\"determinize\", 0);\n  if (__pyx_optional_args) {\n    if (__pyx_optional_args->__pyx_n > 0) {\n      __pyx_v_delta = __pyx_optional_args->delta;\n      if (__pyx_optional_args->__pyx_n > 1) {\n        __pyx_v_det_type = __pyx_optional_args->det_type;\n        if (__pyx_optional_args->__pyx_n > 2) {\n          __pyx_v_nstate = __pyx_optional_args->nstate;\n          if (__pyx_optional_args->__pyx_n > 3) {\n            __pyx_v_subsequential_label = __pyx_optional_args->subsequential_label;\n            if (__pyx_optional_args->__pyx_n > 4) {\n              __pyx_v_weight = __pyx_optional_args->weight;\n              if (__pyx_optional_args->__pyx_n > 5) {\n                __pyx_v_increment_subsequential_label = __pyx_optional_args->increment_subsequential_label;\n              }\n            }\n          }\n        }\n      }\n    }\n  }\n\n  /* \"pywrapfst.pyx\":3425\n *   \"\"\"\n *   cdef unique_ptr[fst.VectorFstClass] tfst\n *   tfst.reset(new fst.VectorFstClass(ifst.arc_type()))             # <<<<<<<<<<<<<<\n *   # Threshold is set to semiring Zero (no pruning) if weight unspecified.\n *   cdef fst.WeightClass wc = _get_WeightClass_or_Zero(ifst.weight_type(),\n */\n  if (unlikely(((PyObject *)__pyx_v_ifst) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"arc_type\");\n    __PYX_ERR(0, 3425, __pyx_L1_error)\n  }\n  __pyx_v_tfst.reset(new fst::script::VectorFstClass(((struct __pyx_vtabstruct_9pywrapfst__Fst *)__pyx_v_ifst->__pyx_vtab)->arc_type(__pyx_v_ifst, 0)));\n\n  /* \"pywrapfst.pyx\":3427\n *   tfst.reset(new fst.VectorFstClass(ifst.arc_type()))\n *   # Threshold is set to semiring Zero (no pruning) if weight unspecified.\n *   cdef fst.WeightClass wc = _get_WeightClass_or_Zero(ifst.weight_type(),             # <<<<<<<<<<<<<<\n *                                                      weight)\n *   cdef fst.DeterminizeType determinize_type_enum\n */\n  if (unlikely(((PyObject *)__pyx_v_ifst) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"weight_type\");\n    __PYX_ERR(0, 3427, __pyx_L1_error)\n  }\n\n  /* \"pywrapfst.pyx\":3428\n *   # Threshold is set to semiring Zero (no pruning) if weight unspecified.\n *   cdef fst.WeightClass wc = _get_WeightClass_or_Zero(ifst.weight_type(),\n *                                                      weight)             # <<<<<<<<<<<<<<\n *   cdef fst.DeterminizeType determinize_type_enum\n *   if not fst.GetDeterminizeType(tostring(det_type),\n */\n  __pyx_t_1 = __pyx_f_9pywrapfst__get_WeightClass_or_Zero(((struct __pyx_vtabstruct_9pywrapfst__Fst *)__pyx_v_ifst->__pyx_vtab)->weight_type(__pyx_v_ifst, 0), __pyx_v_weight); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 3427, __pyx_L1_error)\n  __pyx_v_wc = __pyx_t_1;\n\n  /* \"pywrapfst.pyx\":3430\n *                                                      weight)\n *   cdef fst.DeterminizeType determinize_type_enum\n *   if not fst.GetDeterminizeType(tostring(det_type),             # <<<<<<<<<<<<<<\n *                                 addr(determinize_type_enum)):\n *     raise FstArgError(\"Unknown determinization type: {!r}\".format(det_type))\n */\n  __pyx_t_2 = __pyx_f_9pywrapfst_tostring(__pyx_v_det_type, NULL); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 3430, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":3431\n *   cdef fst.DeterminizeType determinize_type_enum\n *   if not fst.GetDeterminizeType(tostring(det_type),\n *                                 addr(determinize_type_enum)):             # <<<<<<<<<<<<<<\n *     raise FstArgError(\"Unknown determinization type: {!r}\".format(det_type))\n *   cdef unique_ptr[fst.DeterminizeOptions] opts\n */\n  __pyx_t_3 = ((!(fst::script::GetDeterminizeType(__pyx_t_2, (&__pyx_v_determinize_type_enum)) != 0)) != 0);\n\n  /* \"pywrapfst.pyx\":3430\n *                                                      weight)\n *   cdef fst.DeterminizeType determinize_type_enum\n *   if not fst.GetDeterminizeType(tostring(det_type),             # <<<<<<<<<<<<<<\n *                                 addr(determinize_type_enum)):\n *     raise FstArgError(\"Unknown determinization type: {!r}\".format(det_type))\n */\n  if (__pyx_t_3) {\n\n    /* \"pywrapfst.pyx\":3432\n *   if not fst.GetDeterminizeType(tostring(det_type),\n *                                 addr(determinize_type_enum)):\n *     raise FstArgError(\"Unknown determinization type: {!r}\".format(det_type))             # <<<<<<<<<<<<<<\n *   cdef unique_ptr[fst.DeterminizeOptions] opts\n *   opts.reset(new fst.DeterminizeOptions(delta, wc, nstate, subsequential_label,\n */\n    __pyx_t_5 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstArgError); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 3432, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_5);\n    __pyx_t_7 = __Pyx_PyObject_GetAttrStr(__pyx_kp_s_Unknown_determinization_type_r, __pyx_n_s_format); if (unlikely(!__pyx_t_7)) __PYX_ERR(0, 3432, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_7);\n    __pyx_t_8 = NULL;\n    if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_7))) {\n      __pyx_t_8 = PyMethod_GET_SELF(__pyx_t_7);\n      if (likely(__pyx_t_8)) {\n        PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_7);\n        __Pyx_INCREF(__pyx_t_8);\n        __Pyx_INCREF(function);\n        __Pyx_DECREF_SET(__pyx_t_7, function);\n      }\n    }\n    if (!__pyx_t_8) {\n      __pyx_t_6 = __Pyx_PyObject_CallOneArg(__pyx_t_7, __pyx_v_det_type); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 3432, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_6);\n    } else {\n      #if CYTHON_FAST_PYCALL\n      if (PyFunction_Check(__pyx_t_7)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_8, __pyx_v_det_type};\n        __pyx_t_6 = __Pyx_PyFunction_FastCall(__pyx_t_7, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 3432, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_8); __pyx_t_8 = 0;\n        __Pyx_GOTREF(__pyx_t_6);\n      } else\n      #endif\n      #if CYTHON_FAST_PYCCALL\n      if (__Pyx_PyFastCFunction_Check(__pyx_t_7)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_8, __pyx_v_det_type};\n        __pyx_t_6 = __Pyx_PyCFunction_FastCall(__pyx_t_7, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 3432, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_8); __pyx_t_8 = 0;\n        __Pyx_GOTREF(__pyx_t_6);\n      } else\n      #endif\n      {\n        __pyx_t_9 = PyTuple_New(1+1); if (unlikely(!__pyx_t_9)) __PYX_ERR(0, 3432, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_9);\n        __Pyx_GIVEREF(__pyx_t_8); PyTuple_SET_ITEM(__pyx_t_9, 0, __pyx_t_8); __pyx_t_8 = NULL;\n        __Pyx_INCREF(__pyx_v_det_type);\n        __Pyx_GIVEREF(__pyx_v_det_type);\n        PyTuple_SET_ITEM(__pyx_t_9, 0+1, __pyx_v_det_type);\n        __pyx_t_6 = __Pyx_PyObject_Call(__pyx_t_7, __pyx_t_9, NULL); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 3432, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_6);\n        __Pyx_DECREF(__pyx_t_9); __pyx_t_9 = 0;\n      }\n    }\n    __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0;\n    __pyx_t_7 = NULL;\n    if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_5))) {\n      __pyx_t_7 = PyMethod_GET_SELF(__pyx_t_5);\n      if (likely(__pyx_t_7)) {\n        PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_5);\n        __Pyx_INCREF(__pyx_t_7);\n        __Pyx_INCREF(function);\n        __Pyx_DECREF_SET(__pyx_t_5, function);\n      }\n    }\n    if (!__pyx_t_7) {\n      __pyx_t_4 = __Pyx_PyObject_CallOneArg(__pyx_t_5, __pyx_t_6); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 3432, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n      __Pyx_GOTREF(__pyx_t_4);\n    } else {\n      #if CYTHON_FAST_PYCALL\n      if (PyFunction_Check(__pyx_t_5)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_7, __pyx_t_6};\n        __pyx_t_4 = __Pyx_PyFunction_FastCall(__pyx_t_5, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 3432, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_7); __pyx_t_7 = 0;\n        __Pyx_GOTREF(__pyx_t_4);\n        __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n      } else\n      #endif\n      #if CYTHON_FAST_PYCCALL\n      if (__Pyx_PyFastCFunction_Check(__pyx_t_5)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_7, __pyx_t_6};\n        __pyx_t_4 = __Pyx_PyCFunction_FastCall(__pyx_t_5, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 3432, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_7); __pyx_t_7 = 0;\n        __Pyx_GOTREF(__pyx_t_4);\n        __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n      } else\n      #endif\n      {\n        __pyx_t_9 = PyTuple_New(1+1); if (unlikely(!__pyx_t_9)) __PYX_ERR(0, 3432, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_9);\n        __Pyx_GIVEREF(__pyx_t_7); PyTuple_SET_ITEM(__pyx_t_9, 0, __pyx_t_7); __pyx_t_7 = NULL;\n        __Pyx_GIVEREF(__pyx_t_6);\n        PyTuple_SET_ITEM(__pyx_t_9, 0+1, __pyx_t_6);\n        __pyx_t_6 = 0;\n        __pyx_t_4 = __Pyx_PyObject_Call(__pyx_t_5, __pyx_t_9, NULL); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 3432, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_4);\n        __Pyx_DECREF(__pyx_t_9); __pyx_t_9 = 0;\n      }\n    }\n    __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n    __Pyx_Raise(__pyx_t_4, 0, 0, 0);\n    __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n    __PYX_ERR(0, 3432, __pyx_L1_error)\n\n    /* \"pywrapfst.pyx\":3430\n *                                                      weight)\n *   cdef fst.DeterminizeType determinize_type_enum\n *   if not fst.GetDeterminizeType(tostring(det_type),             # <<<<<<<<<<<<<<\n *                                 addr(determinize_type_enum)):\n *     raise FstArgError(\"Unknown determinization type: {!r}\".format(det_type))\n */\n  }\n\n  /* \"pywrapfst.pyx\":3434\n *     raise FstArgError(\"Unknown determinization type: {!r}\".format(det_type))\n *   cdef unique_ptr[fst.DeterminizeOptions] opts\n *   opts.reset(new fst.DeterminizeOptions(delta, wc, nstate, subsequential_label,             # <<<<<<<<<<<<<<\n *                                         determinize_type_enum,\n *                                         increment_subsequential_label))\n */\n  __pyx_v_opts.reset(new fst::script::DeterminizeOptions(__pyx_v_delta, __pyx_v_wc, __pyx_v_nstate, __pyx_v_subsequential_label, __pyx_v_determinize_type_enum, __pyx_v_increment_subsequential_label));\n\n  /* \"pywrapfst.pyx\":3437\n *                                         determinize_type_enum,\n *                                         increment_subsequential_label))\n *   fst.Determinize(deref(ifst._fst), tfst.get(), deref(opts))             # <<<<<<<<<<<<<<\n *   return _init_MutableFst(tfst.release())\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_ifst) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 3437, __pyx_L1_error)\n  }\n  fst::script::Determinize((*__pyx_v_ifst->_fst), __pyx_v_tfst.get(), (*__pyx_v_opts));\n\n  /* \"pywrapfst.pyx\":3438\n *                                         increment_subsequential_label))\n *   fst.Determinize(deref(ifst._fst), tfst.get(), deref(opts))\n *   return _init_MutableFst(tfst.release())             # <<<<<<<<<<<<<<\n * \n * \n */\n  __Pyx_XDECREF(((PyObject *)__pyx_r));\n  __pyx_t_4 = ((PyObject *)__pyx_f_9pywrapfst__init_MutableFst(__pyx_v_tfst.release())); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 3438, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_4);\n  __pyx_r = ((struct __pyx_obj_9pywrapfst__MutableFst *)__pyx_t_4);\n  __pyx_t_4 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":3383\n * \n * \n * cpdef _MutableFst determinize(_Fst ifst,             # <<<<<<<<<<<<<<\n *                               float delta=fst.kShortestDelta,\n *                               det_type=b\"functional\",\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_XDECREF(__pyx_t_6);\n  __Pyx_XDECREF(__pyx_t_7);\n  __Pyx_XDECREF(__pyx_t_8);\n  __Pyx_XDECREF(__pyx_t_9);\n  __Pyx_AddTraceback(\"pywrapfst.determinize\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XGIVEREF((PyObject *)__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_23determinize(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic char __pyx_doc_9pywrapfst_22determinize[] = \"\\n  determinize(ifst, delta=1e-6, det_type=\\\"functional\\\",\\n              nstate=NO_STATE_ID, subsequential_label=0, weight=None,\\n              incremental_subsequential_label=False)\\n\\n  Constructively determinizes a weighted FST.\\n\\n  This operations creates an equivalent FST that has the property that no\\n  state has two transitions with the same input label. For this algorithm,\\n  epsilon transitions are treated as regular symbols (cf. `rmepsilon`).\\n\\n  Args:\\n    ifst: The input FST.\\n    delta: Comparison/quantization delta.\\n    det_type: Type of determinization; one of: \\\"functional\\\" (input transducer is\\n        functional), \\\"nonfunctional\\\" (input transducer is not functional) and\\n        disambiguate\\\" (input transducer is not functional but only keep the min\\n        of ambiguous outputs).\\n    nstate: State number threshold.\\n    subsequential_label: Input label of arc corresponding to residual final\\n        output when producing a subsequential transducer.\\n    weight: A Weight or weight string indicating the desired weight threshold\\n        below which paths are pruned; if omitted, no paths are pruned.\\n    increment_subsequential_label: Increment subsequential when creating\\n        several arcs for the residual final output at a given state.\\n\\n  Returns:\\n    An equivalent deterministic FST.\\n\\n  Raises:\\n    FstArgError: Unknown determinization type.\\n\\n  See also: `disambiguate`, `rmepsilon`.\\n  \";\nstatic PyObject *__pyx_pw_9pywrapfst_23determinize(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst = 0;\n  float __pyx_v_delta;\n  PyObject *__pyx_v_det_type = 0;\n  __pyx_t_10basictypes_int64 __pyx_v_nstate;\n  __pyx_t_10basictypes_int64 __pyx_v_subsequential_label;\n  PyObject *__pyx_v_weight = 0;\n  bool __pyx_v_increment_subsequential_label;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"determinize (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_ifst,&__pyx_n_s_delta,&__pyx_n_s_det_type,&__pyx_n_s_nstate,&__pyx_n_s_subsequential_label,&__pyx_n_s_weight,&__pyx_n_s_increment_subsequential_label,0};\n    PyObject* values[7] = {0,0,0,0,0,0,0};\n    values[2] = ((PyObject *)__pyx_n_b_functional);\n\n    /* \"pywrapfst.pyx\":3388\n *                               int64 nstate=fst.kNoStateId,\n *                               int64 subsequential_label=0,\n *                               weight=None,             # <<<<<<<<<<<<<<\n *                               bool increment_subsequential_label=False):\n *   \"\"\"\n */\n    values[5] = ((PyObject *)Py_None);\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  7: values[6] = PyTuple_GET_ITEM(__pyx_args, 6);\n        CYTHON_FALLTHROUGH;\n        case  6: values[5] = PyTuple_GET_ITEM(__pyx_args, 5);\n        CYTHON_FALLTHROUGH;\n        case  5: values[4] = PyTuple_GET_ITEM(__pyx_args, 4);\n        CYTHON_FALLTHROUGH;\n        case  4: values[3] = PyTuple_GET_ITEM(__pyx_args, 3);\n        CYTHON_FALLTHROUGH;\n        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);\n        CYTHON_FALLTHROUGH;\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (likely((values[0] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_ifst)) != 0)) kw_args--;\n        else goto __pyx_L5_argtuple_error;\n        CYTHON_FALLTHROUGH;\n        case  1:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_delta);\n          if (value) { values[1] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  2:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_det_type);\n          if (value) { values[2] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  3:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_nstate);\n          if (value) { values[3] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  4:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_subsequential_label);\n          if (value) { values[4] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  5:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_weight);\n          if (value) { values[5] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  6:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_increment_subsequential_label);\n          if (value) { values[6] = value; kw_args--; }\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"determinize\") < 0)) __PYX_ERR(0, 3383, __pyx_L3_error)\n      }\n    } else {\n      switch (PyTuple_GET_SIZE(__pyx_args)) {\n        case  7: values[6] = PyTuple_GET_ITEM(__pyx_args, 6);\n        CYTHON_FALLTHROUGH;\n        case  6: values[5] = PyTuple_GET_ITEM(__pyx_args, 5);\n        CYTHON_FALLTHROUGH;\n        case  5: values[4] = PyTuple_GET_ITEM(__pyx_args, 4);\n        CYTHON_FALLTHROUGH;\n        case  4: values[3] = PyTuple_GET_ITEM(__pyx_args, 3);\n        CYTHON_FALLTHROUGH;\n        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);\n        CYTHON_FALLTHROUGH;\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n    }\n    __pyx_v_ifst = ((struct __pyx_obj_9pywrapfst__Fst *)values[0]);\n    if (values[1]) {\n      __pyx_v_delta = __pyx_PyFloat_AsFloat(values[1]); if (unlikely((__pyx_v_delta == (float)-1) && PyErr_Occurred())) __PYX_ERR(0, 3384, __pyx_L3_error)\n    } else {\n      __pyx_v_delta = __pyx_k__69;\n    }\n    __pyx_v_det_type = values[2];\n    if (values[3]) {\n      __pyx_v_nstate = __Pyx_PyInt_As_int64_t(values[3]); if (unlikely((__pyx_v_nstate == ((int64_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 3386, __pyx_L3_error)\n    } else {\n      __pyx_v_nstate = __pyx_k__70;\n    }\n    if (values[4]) {\n      __pyx_v_subsequential_label = __Pyx_PyInt_As_int64_t(values[4]); if (unlikely((__pyx_v_subsequential_label == ((int64_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 3387, __pyx_L3_error)\n    } else {\n      __pyx_v_subsequential_label = ((__pyx_t_10basictypes_int64)0);\n    }\n    __pyx_v_weight = values[5];\n    if (values[6]) {\n      __pyx_v_increment_subsequential_label = __Pyx_PyObject_IsTrue(values[6]); if (unlikely((__pyx_v_increment_subsequential_label == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 3389, __pyx_L3_error)\n    } else {\n\n      /* \"pywrapfst.pyx\":3389\n *                               int64 subsequential_label=0,\n *                               weight=None,\n *                               bool increment_subsequential_label=False):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   determinize(ifst, delta=1e-6, det_type=\"functional\",\n */\n      __pyx_v_increment_subsequential_label = ((bool)0);\n    }\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"determinize\", 0, 1, 7, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 3383, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst.determinize\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_ifst), __pyx_ptype_9pywrapfst__Fst, 1, \"ifst\", 0))) __PYX_ERR(0, 3383, __pyx_L1_error)\n  __pyx_r = __pyx_pf_9pywrapfst_22determinize(__pyx_self, __pyx_v_ifst, __pyx_v_delta, __pyx_v_det_type, __pyx_v_nstate, __pyx_v_subsequential_label, __pyx_v_weight, __pyx_v_increment_subsequential_label);\n\n  /* \"pywrapfst.pyx\":3383\n * \n * \n * cpdef _MutableFst determinize(_Fst ifst,             # <<<<<<<<<<<<<<\n *                               float delta=fst.kShortestDelta,\n *                               det_type=b\"functional\",\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_22determinize(CYTHON_UNUSED PyObject *__pyx_self, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst, float __pyx_v_delta, PyObject *__pyx_v_det_type, __pyx_t_10basictypes_int64 __pyx_v_nstate, __pyx_t_10basictypes_int64 __pyx_v_subsequential_label, PyObject *__pyx_v_weight, bool __pyx_v_increment_subsequential_label) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  struct __pyx_opt_args_9pywrapfst_determinize __pyx_t_2;\n  __Pyx_RefNannySetupContext(\"determinize\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_2.__pyx_n = 6;\n  __pyx_t_2.delta = __pyx_v_delta;\n  __pyx_t_2.det_type = __pyx_v_det_type;\n  __pyx_t_2.nstate = __pyx_v_nstate;\n  __pyx_t_2.subsequential_label = __pyx_v_subsequential_label;\n  __pyx_t_2.weight = __pyx_v_weight;\n  __pyx_t_2.increment_subsequential_label = __pyx_v_increment_subsequential_label;\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst_determinize(__pyx_v_ifst, 0, &__pyx_t_2)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3383, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.determinize\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":3441\n * \n * \n * cpdef _MutableFst difference(_Fst ifst1,             # <<<<<<<<<<<<<<\n *                              _Fst ifst2,\n *                              compose_filter=b\"auto\",\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_25difference(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic struct __pyx_obj_9pywrapfst__MutableFst *__pyx_f_9pywrapfst_difference(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst1, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst2, CYTHON_UNUSED int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_difference *__pyx_optional_args) {\n  PyObject *__pyx_v_compose_filter = ((PyObject *)__pyx_n_b_auto);\n\n  /* \"pywrapfst.pyx\":3444\n *                              _Fst ifst2,\n *                              compose_filter=b\"auto\",\n *                              bool connect=True):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   difference(ifst1, ifst2, compose_filter=\"auto\", connect=True)\n */\n  bool __pyx_v_connect = ((bool)1);\n  std::unique_ptr<fst::script::VectorFstClass>  __pyx_v_tfst;\n  std::unique_ptr<fst::ComposeOptions>  __pyx_v_opts;\n  struct __pyx_obj_9pywrapfst__MutableFst *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  std::string __pyx_t_1;\n  enum fst::ComposeFilter __pyx_t_2;\n  PyObject *__pyx_t_3 = NULL;\n  __Pyx_RefNannySetupContext(\"difference\", 0);\n  if (__pyx_optional_args) {\n    if (__pyx_optional_args->__pyx_n > 0) {\n      __pyx_v_compose_filter = __pyx_optional_args->compose_filter;\n      if (__pyx_optional_args->__pyx_n > 1) {\n        __pyx_v_connect = __pyx_optional_args->connect;\n      }\n    }\n  }\n\n  /* \"pywrapfst.pyx\":3468\n *   \"\"\"\n *   cdef unique_ptr[fst.VectorFstClass] tfst\n *   tfst.reset(new fst.VectorFstClass(ifst1.arc_type()))             # <<<<<<<<<<<<<<\n *   cdef unique_ptr[fst.ComposeOptions] opts\n *   opts.reset(new fst.ComposeOptions(connect, _get_compose_filter(\n */\n  if (unlikely(((PyObject *)__pyx_v_ifst1) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"arc_type\");\n    __PYX_ERR(0, 3468, __pyx_L1_error)\n  }\n  __pyx_v_tfst.reset(new fst::script::VectorFstClass(((struct __pyx_vtabstruct_9pywrapfst__Fst *)__pyx_v_ifst1->__pyx_vtab)->arc_type(__pyx_v_ifst1, 0)));\n\n  /* \"pywrapfst.pyx\":3471\n *   cdef unique_ptr[fst.ComposeOptions] opts\n *   opts.reset(new fst.ComposeOptions(connect, _get_compose_filter(\n *       tostring(compose_filter))))             # <<<<<<<<<<<<<<\n *   fst.Difference(deref(ifst1._fst), deref(ifst2._fst), tfst.get(), deref(opts))\n *   return _init_MutableFst(tfst.release())\n */\n  __pyx_t_1 = __pyx_f_9pywrapfst_tostring(__pyx_v_compose_filter, NULL); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 3471, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":3470\n *   tfst.reset(new fst.VectorFstClass(ifst1.arc_type()))\n *   cdef unique_ptr[fst.ComposeOptions] opts\n *   opts.reset(new fst.ComposeOptions(connect, _get_compose_filter(             # <<<<<<<<<<<<<<\n *       tostring(compose_filter))))\n *   fst.Difference(deref(ifst1._fst), deref(ifst2._fst), tfst.get(), deref(opts))\n */\n  __pyx_t_2 = __pyx_f_9pywrapfst__get_compose_filter(__pyx_t_1); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 3470, __pyx_L1_error)\n  __pyx_v_opts.reset(new fst::ComposeOptions(__pyx_v_connect, __pyx_t_2));\n\n  /* \"pywrapfst.pyx\":3472\n *   opts.reset(new fst.ComposeOptions(connect, _get_compose_filter(\n *       tostring(compose_filter))))\n *   fst.Difference(deref(ifst1._fst), deref(ifst2._fst), tfst.get(), deref(opts))             # <<<<<<<<<<<<<<\n *   return _init_MutableFst(tfst.release())\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_ifst1) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 3472, __pyx_L1_error)\n  }\n  if (unlikely(((PyObject *)__pyx_v_ifst2) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 3472, __pyx_L1_error)\n  }\n  fst::script::Difference((*__pyx_v_ifst1->_fst), (*__pyx_v_ifst2->_fst), __pyx_v_tfst.get(), (*__pyx_v_opts));\n\n  /* \"pywrapfst.pyx\":3473\n *       tostring(compose_filter))))\n *   fst.Difference(deref(ifst1._fst), deref(ifst2._fst), tfst.get(), deref(opts))\n *   return _init_MutableFst(tfst.release())             # <<<<<<<<<<<<<<\n * \n * \n */\n  __Pyx_XDECREF(((PyObject *)__pyx_r));\n  __pyx_t_3 = ((PyObject *)__pyx_f_9pywrapfst__init_MutableFst(__pyx_v_tfst.release())); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 3473, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_3);\n  __pyx_r = ((struct __pyx_obj_9pywrapfst__MutableFst *)__pyx_t_3);\n  __pyx_t_3 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":3441\n * \n * \n * cpdef _MutableFst difference(_Fst ifst1,             # <<<<<<<<<<<<<<\n *                              _Fst ifst2,\n *                              compose_filter=b\"auto\",\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_AddTraceback(\"pywrapfst.difference\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XGIVEREF((PyObject *)__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_25difference(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic char __pyx_doc_9pywrapfst_24difference[] = \"\\n  difference(ifst1, ifst2, compose_filter=\\\"auto\\\", connect=True)\\n\\n  Constructively computes the difference of two FSTs.\\n\\n  This operation computes the difference between two FSAs. Only strings that are\\n  in the first automaton but not in second are retained in the result. The first\\n  argument must be an acceptor; the second argument must be an unweighted,\\n  epsilon-free, deterministic acceptor. The output labels of the first\\n  transducer or the input labels of the second transducer must be sorted (or\\n  otherwise support appropriate matchers).\\n\\n  Args:\\n    ifst1: The first input FST.\\n    ifst2: The second input FST.\\n    compose_filter: A string matching a known composition filter; one of:\\n        \\\"alt_sequence\\\", \\\"auto\\\", \\\"match\\\", \\\"null\\\", \\\"sequence\\\", \\\"trivial\\\".\\n    connect: Should the output FST be trimmed?\\n\\n  Returns:\\n    An FST representing the difference of the FSTs.\\n  \";\nstatic PyObject *__pyx_pw_9pywrapfst_25difference(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst1 = 0;\n  struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst2 = 0;\n  PyObject *__pyx_v_compose_filter = 0;\n  bool __pyx_v_connect;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"difference (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_ifst1,&__pyx_n_s_ifst2,&__pyx_n_s_compose_filter,&__pyx_n_s_connect,0};\n    PyObject* values[4] = {0,0,0,0};\n    values[2] = ((PyObject *)__pyx_n_b_auto);\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  4: values[3] = PyTuple_GET_ITEM(__pyx_args, 3);\n        CYTHON_FALLTHROUGH;\n        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);\n        CYTHON_FALLTHROUGH;\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (likely((values[0] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_ifst1)) != 0)) kw_args--;\n        else goto __pyx_L5_argtuple_error;\n        CYTHON_FALLTHROUGH;\n        case  1:\n        if (likely((values[1] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_ifst2)) != 0)) kw_args--;\n        else {\n          __Pyx_RaiseArgtupleInvalid(\"difference\", 0, 2, 4, 1); __PYX_ERR(0, 3441, __pyx_L3_error)\n        }\n        CYTHON_FALLTHROUGH;\n        case  2:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_compose_filter);\n          if (value) { values[2] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  3:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_connect);\n          if (value) { values[3] = value; kw_args--; }\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"difference\") < 0)) __PYX_ERR(0, 3441, __pyx_L3_error)\n      }\n    } else {\n      switch (PyTuple_GET_SIZE(__pyx_args)) {\n        case  4: values[3] = PyTuple_GET_ITEM(__pyx_args, 3);\n        CYTHON_FALLTHROUGH;\n        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);\n        CYTHON_FALLTHROUGH;\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n    }\n    __pyx_v_ifst1 = ((struct __pyx_obj_9pywrapfst__Fst *)values[0]);\n    __pyx_v_ifst2 = ((struct __pyx_obj_9pywrapfst__Fst *)values[1]);\n    __pyx_v_compose_filter = values[2];\n    if (values[3]) {\n      __pyx_v_connect = __Pyx_PyObject_IsTrue(values[3]); if (unlikely((__pyx_v_connect == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 3444, __pyx_L3_error)\n    } else {\n\n      /* \"pywrapfst.pyx\":3444\n *                              _Fst ifst2,\n *                              compose_filter=b\"auto\",\n *                              bool connect=True):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   difference(ifst1, ifst2, compose_filter=\"auto\", connect=True)\n */\n      __pyx_v_connect = ((bool)1);\n    }\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"difference\", 0, 2, 4, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 3441, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst.difference\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_ifst1), __pyx_ptype_9pywrapfst__Fst, 1, \"ifst1\", 0))) __PYX_ERR(0, 3441, __pyx_L1_error)\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_ifst2), __pyx_ptype_9pywrapfst__Fst, 1, \"ifst2\", 0))) __PYX_ERR(0, 3442, __pyx_L1_error)\n  __pyx_r = __pyx_pf_9pywrapfst_24difference(__pyx_self, __pyx_v_ifst1, __pyx_v_ifst2, __pyx_v_compose_filter, __pyx_v_connect);\n\n  /* \"pywrapfst.pyx\":3441\n * \n * \n * cpdef _MutableFst difference(_Fst ifst1,             # <<<<<<<<<<<<<<\n *                              _Fst ifst2,\n *                              compose_filter=b\"auto\",\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_24difference(CYTHON_UNUSED PyObject *__pyx_self, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst1, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst2, PyObject *__pyx_v_compose_filter, bool __pyx_v_connect) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  struct __pyx_opt_args_9pywrapfst_difference __pyx_t_2;\n  __Pyx_RefNannySetupContext(\"difference\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_2.__pyx_n = 2;\n  __pyx_t_2.compose_filter = __pyx_v_compose_filter;\n  __pyx_t_2.connect = __pyx_v_connect;\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst_difference(__pyx_v_ifst1, __pyx_v_ifst2, 0, &__pyx_t_2)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3441, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.difference\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":3476\n * \n * \n * cpdef _MutableFst disambiguate(_Fst ifst,             # <<<<<<<<<<<<<<\n *                                float delta=fst.kDelta,\n *                                int64 nstate=fst.kNoStateId,\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_27disambiguate(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic struct __pyx_obj_9pywrapfst__MutableFst *__pyx_f_9pywrapfst_disambiguate(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst, CYTHON_UNUSED int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_disambiguate *__pyx_optional_args) {\n  float __pyx_v_delta = __pyx_k__71;\n  __pyx_t_10basictypes_int64 __pyx_v_nstate = __pyx_k__72;\n  __pyx_t_10basictypes_int64 __pyx_v_subsequential_label = ((__pyx_t_10basictypes_int64)0);\n\n  /* \"pywrapfst.pyx\":3480\n *                                int64 nstate=fst.kNoStateId,\n *                                int64 subsequential_label=0,\n *                                weight=None):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   disambiguate(ifst, delta=0.0009765625, nstate=NO_STATE_ID,\n */\n  PyObject *__pyx_v_weight = ((PyObject *)Py_None);\n  std::unique_ptr<fst::script::VectorFstClass>  __pyx_v_tfst;\n  fst::script::WeightClass __pyx_v_wc;\n  std::unique_ptr<fst::script::DisambiguateOptions>  __pyx_v_opts;\n  struct __pyx_obj_9pywrapfst__MutableFst *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  fst::script::WeightClass __pyx_t_1;\n  PyObject *__pyx_t_2 = NULL;\n  __Pyx_RefNannySetupContext(\"disambiguate\", 0);\n  if (__pyx_optional_args) {\n    if (__pyx_optional_args->__pyx_n > 0) {\n      __pyx_v_delta = __pyx_optional_args->delta;\n      if (__pyx_optional_args->__pyx_n > 1) {\n        __pyx_v_nstate = __pyx_optional_args->nstate;\n        if (__pyx_optional_args->__pyx_n > 2) {\n          __pyx_v_subsequential_label = __pyx_optional_args->subsequential_label;\n          if (__pyx_optional_args->__pyx_n > 3) {\n            __pyx_v_weight = __pyx_optional_args->weight;\n          }\n        }\n      }\n    }\n  }\n\n  /* \"pywrapfst.pyx\":3507\n *   \"\"\"\n *   cdef unique_ptr[fst.VectorFstClass] tfst\n *   tfst.reset(new fst.VectorFstClass(ifst.arc_type()))             # <<<<<<<<<<<<<<\n *   # Threshold is set to semiring Zero (no pruning) if no weight is specified.\n *   cdef fst.WeightClass wc = _get_WeightClass_or_Zero(ifst.weight_type(),\n */\n  if (unlikely(((PyObject *)__pyx_v_ifst) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"arc_type\");\n    __PYX_ERR(0, 3507, __pyx_L1_error)\n  }\n  __pyx_v_tfst.reset(new fst::script::VectorFstClass(((struct __pyx_vtabstruct_9pywrapfst__Fst *)__pyx_v_ifst->__pyx_vtab)->arc_type(__pyx_v_ifst, 0)));\n\n  /* \"pywrapfst.pyx\":3509\n *   tfst.reset(new fst.VectorFstClass(ifst.arc_type()))\n *   # Threshold is set to semiring Zero (no pruning) if no weight is specified.\n *   cdef fst.WeightClass wc = _get_WeightClass_or_Zero(ifst.weight_type(),             # <<<<<<<<<<<<<<\n *                                                      weight)\n *   cdef unique_ptr[fst.DisambiguateOptions] opts\n */\n  if (unlikely(((PyObject *)__pyx_v_ifst) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"weight_type\");\n    __PYX_ERR(0, 3509, __pyx_L1_error)\n  }\n\n  /* \"pywrapfst.pyx\":3510\n *   # Threshold is set to semiring Zero (no pruning) if no weight is specified.\n *   cdef fst.WeightClass wc = _get_WeightClass_or_Zero(ifst.weight_type(),\n *                                                      weight)             # <<<<<<<<<<<<<<\n *   cdef unique_ptr[fst.DisambiguateOptions] opts\n *   opts.reset(new fst.DisambiguateOptions(delta, wc, nstate,\n */\n  __pyx_t_1 = __pyx_f_9pywrapfst__get_WeightClass_or_Zero(((struct __pyx_vtabstruct_9pywrapfst__Fst *)__pyx_v_ifst->__pyx_vtab)->weight_type(__pyx_v_ifst, 0), __pyx_v_weight); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 3509, __pyx_L1_error)\n  __pyx_v_wc = __pyx_t_1;\n\n  /* \"pywrapfst.pyx\":3512\n *                                                      weight)\n *   cdef unique_ptr[fst.DisambiguateOptions] opts\n *   opts.reset(new fst.DisambiguateOptions(delta, wc, nstate,             # <<<<<<<<<<<<<<\n *                                          subsequential_label))\n *   fst.Disambiguate(deref(ifst._fst), tfst.get(), deref(opts))\n */\n  __pyx_v_opts.reset(new fst::script::DisambiguateOptions(__pyx_v_delta, __pyx_v_wc, __pyx_v_nstate, __pyx_v_subsequential_label));\n\n  /* \"pywrapfst.pyx\":3514\n *   opts.reset(new fst.DisambiguateOptions(delta, wc, nstate,\n *                                          subsequential_label))\n *   fst.Disambiguate(deref(ifst._fst), tfst.get(), deref(opts))             # <<<<<<<<<<<<<<\n *   return _init_MutableFst(tfst.release())\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_ifst) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 3514, __pyx_L1_error)\n  }\n  fst::script::Disambiguate((*__pyx_v_ifst->_fst), __pyx_v_tfst.get(), (*__pyx_v_opts));\n\n  /* \"pywrapfst.pyx\":3515\n *                                          subsequential_label))\n *   fst.Disambiguate(deref(ifst._fst), tfst.get(), deref(opts))\n *   return _init_MutableFst(tfst.release())             # <<<<<<<<<<<<<<\n * \n * \n */\n  __Pyx_XDECREF(((PyObject *)__pyx_r));\n  __pyx_t_2 = ((PyObject *)__pyx_f_9pywrapfst__init_MutableFst(__pyx_v_tfst.release())); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3515, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  __pyx_r = ((struct __pyx_obj_9pywrapfst__MutableFst *)__pyx_t_2);\n  __pyx_t_2 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":3476\n * \n * \n * cpdef _MutableFst disambiguate(_Fst ifst,             # <<<<<<<<<<<<<<\n *                                float delta=fst.kDelta,\n *                                int64 nstate=fst.kNoStateId,\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_AddTraceback(\"pywrapfst.disambiguate\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XGIVEREF((PyObject *)__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_27disambiguate(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic char __pyx_doc_9pywrapfst_26disambiguate[] = \"\\n  disambiguate(ifst, delta=0.0009765625, nstate=NO_STATE_ID,\\n               subsequential_label=0, weight=None):\\n\\n  Constructively disambiguates a weighted transducer.\\n\\n  This operation disambiguates a weighted transducer. The result will be an\\n  equivalent FST that has the property that no two successful paths have the\\n  same input labeling. For this algorithm, epsilon transitions are treated as\\n  regular symbols (cf. `rmepsilon`).\\n\\n  Args:\\n    ifst: The input FST.\\n    delta: Comparison/quantization delta.\\n    nstate: State number threshold.\\n    subsequential_label: Input label of arc corresponding to residual final\\n        output when producing a subsequential transducer.\\n    weight: A Weight or weight string indicating the desired weight threshold\\n        below which paths are pruned; if omitted, no paths are pruned.\\n\\n  Returns:\\n    An equivalent disambiguated FST.\\n\\n  See also: `determinize`, `rmepsilon`.\\n  \";\nstatic PyObject *__pyx_pw_9pywrapfst_27disambiguate(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst = 0;\n  float __pyx_v_delta;\n  __pyx_t_10basictypes_int64 __pyx_v_nstate;\n  __pyx_t_10basictypes_int64 __pyx_v_subsequential_label;\n  PyObject *__pyx_v_weight = 0;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"disambiguate (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_ifst,&__pyx_n_s_delta,&__pyx_n_s_nstate,&__pyx_n_s_subsequential_label,&__pyx_n_s_weight,0};\n    PyObject* values[5] = {0,0,0,0,0};\n\n    /* \"pywrapfst.pyx\":3480\n *                                int64 nstate=fst.kNoStateId,\n *                                int64 subsequential_label=0,\n *                                weight=None):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   disambiguate(ifst, delta=0.0009765625, nstate=NO_STATE_ID,\n */\n    values[4] = ((PyObject *)Py_None);\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  5: values[4] = PyTuple_GET_ITEM(__pyx_args, 4);\n        CYTHON_FALLTHROUGH;\n        case  4: values[3] = PyTuple_GET_ITEM(__pyx_args, 3);\n        CYTHON_FALLTHROUGH;\n        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);\n        CYTHON_FALLTHROUGH;\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (likely((values[0] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_ifst)) != 0)) kw_args--;\n        else goto __pyx_L5_argtuple_error;\n        CYTHON_FALLTHROUGH;\n        case  1:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_delta);\n          if (value) { values[1] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  2:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_nstate);\n          if (value) { values[2] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  3:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_subsequential_label);\n          if (value) { values[3] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  4:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_weight);\n          if (value) { values[4] = value; kw_args--; }\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"disambiguate\") < 0)) __PYX_ERR(0, 3476, __pyx_L3_error)\n      }\n    } else {\n      switch (PyTuple_GET_SIZE(__pyx_args)) {\n        case  5: values[4] = PyTuple_GET_ITEM(__pyx_args, 4);\n        CYTHON_FALLTHROUGH;\n        case  4: values[3] = PyTuple_GET_ITEM(__pyx_args, 3);\n        CYTHON_FALLTHROUGH;\n        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);\n        CYTHON_FALLTHROUGH;\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n    }\n    __pyx_v_ifst = ((struct __pyx_obj_9pywrapfst__Fst *)values[0]);\n    if (values[1]) {\n      __pyx_v_delta = __pyx_PyFloat_AsFloat(values[1]); if (unlikely((__pyx_v_delta == (float)-1) && PyErr_Occurred())) __PYX_ERR(0, 3477, __pyx_L3_error)\n    } else {\n      __pyx_v_delta = __pyx_k__71;\n    }\n    if (values[2]) {\n      __pyx_v_nstate = __Pyx_PyInt_As_int64_t(values[2]); if (unlikely((__pyx_v_nstate == ((int64_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 3478, __pyx_L3_error)\n    } else {\n      __pyx_v_nstate = __pyx_k__72;\n    }\n    if (values[3]) {\n      __pyx_v_subsequential_label = __Pyx_PyInt_As_int64_t(values[3]); if (unlikely((__pyx_v_subsequential_label == ((int64_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 3479, __pyx_L3_error)\n    } else {\n      __pyx_v_subsequential_label = ((__pyx_t_10basictypes_int64)0);\n    }\n    __pyx_v_weight = values[4];\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"disambiguate\", 0, 1, 5, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 3476, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst.disambiguate\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_ifst), __pyx_ptype_9pywrapfst__Fst, 1, \"ifst\", 0))) __PYX_ERR(0, 3476, __pyx_L1_error)\n  __pyx_r = __pyx_pf_9pywrapfst_26disambiguate(__pyx_self, __pyx_v_ifst, __pyx_v_delta, __pyx_v_nstate, __pyx_v_subsequential_label, __pyx_v_weight);\n\n  /* \"pywrapfst.pyx\":3476\n * \n * \n * cpdef _MutableFst disambiguate(_Fst ifst,             # <<<<<<<<<<<<<<\n *                                float delta=fst.kDelta,\n *                                int64 nstate=fst.kNoStateId,\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_26disambiguate(CYTHON_UNUSED PyObject *__pyx_self, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst, float __pyx_v_delta, __pyx_t_10basictypes_int64 __pyx_v_nstate, __pyx_t_10basictypes_int64 __pyx_v_subsequential_label, PyObject *__pyx_v_weight) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  struct __pyx_opt_args_9pywrapfst_disambiguate __pyx_t_2;\n  __Pyx_RefNannySetupContext(\"disambiguate\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_2.__pyx_n = 4;\n  __pyx_t_2.delta = __pyx_v_delta;\n  __pyx_t_2.nstate = __pyx_v_nstate;\n  __pyx_t_2.subsequential_label = __pyx_v_subsequential_label;\n  __pyx_t_2.weight = __pyx_v_weight;\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst_disambiguate(__pyx_v_ifst, 0, &__pyx_t_2)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3476, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.disambiguate\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":3518\n * \n * \n * cpdef _MutableFst epsnormalize(_Fst ifst, bool eps_norm_output=False):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   epsnormalize(ifst, eps_norm_output=False)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_29epsnormalize(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic struct __pyx_obj_9pywrapfst__MutableFst *__pyx_f_9pywrapfst_epsnormalize(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst, CYTHON_UNUSED int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_epsnormalize *__pyx_optional_args) {\n  bool __pyx_v_eps_norm_output = ((bool)0);\n  std::unique_ptr<fst::script::VectorFstClass>  __pyx_v_tfst;\n  struct __pyx_obj_9pywrapfst__MutableFst *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  enum fst::EpsNormalizeType __pyx_t_1;\n  PyObject *__pyx_t_2 = NULL;\n  __Pyx_RefNannySetupContext(\"epsnormalize\", 0);\n  if (__pyx_optional_args) {\n    if (__pyx_optional_args->__pyx_n > 0) {\n      __pyx_v_eps_norm_output = __pyx_optional_args->eps_norm_output;\n    }\n  }\n\n  /* \"pywrapfst.pyx\":3541\n *   \"\"\"\n *   cdef unique_ptr[fst.VectorFstClass] tfst\n *   tfst.reset(new fst.VectorFstClass(ifst.arc_type()))             # <<<<<<<<<<<<<<\n *   fst.EpsNormalize(deref(ifst._fst), tfst.get(), fst.EPS_NORM_OUTPUT if\n *                                                  eps_norm_output else\n */\n  if (unlikely(((PyObject *)__pyx_v_ifst) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"arc_type\");\n    __PYX_ERR(0, 3541, __pyx_L1_error)\n  }\n  __pyx_v_tfst.reset(new fst::script::VectorFstClass(((struct __pyx_vtabstruct_9pywrapfst__Fst *)__pyx_v_ifst->__pyx_vtab)->arc_type(__pyx_v_ifst, 0)));\n\n  /* \"pywrapfst.pyx\":3542\n *   cdef unique_ptr[fst.VectorFstClass] tfst\n *   tfst.reset(new fst.VectorFstClass(ifst.arc_type()))\n *   fst.EpsNormalize(deref(ifst._fst), tfst.get(), fst.EPS_NORM_OUTPUT if             # <<<<<<<<<<<<<<\n *                                                  eps_norm_output else\n *                                                  fst.EPS_NORM_INPUT)\n */\n  if (unlikely(((PyObject *)__pyx_v_ifst) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 3542, __pyx_L1_error)\n  }\n\n  /* \"pywrapfst.pyx\":3543\n *   tfst.reset(new fst.VectorFstClass(ifst.arc_type()))\n *   fst.EpsNormalize(deref(ifst._fst), tfst.get(), fst.EPS_NORM_OUTPUT if\n *                                                  eps_norm_output else             # <<<<<<<<<<<<<<\n *                                                  fst.EPS_NORM_INPUT)\n *   return _init_MutableFst(tfst.release())\n */\n  if ((__pyx_v_eps_norm_output != 0)) {\n\n    /* \"pywrapfst.pyx\":3542\n *   cdef unique_ptr[fst.VectorFstClass] tfst\n *   tfst.reset(new fst.VectorFstClass(ifst.arc_type()))\n *   fst.EpsNormalize(deref(ifst._fst), tfst.get(), fst.EPS_NORM_OUTPUT if             # <<<<<<<<<<<<<<\n *                                                  eps_norm_output else\n *                                                  fst.EPS_NORM_INPUT)\n */\n    __pyx_t_1 = fst::EPS_NORM_OUTPUT;\n  } else {\n\n    /* \"pywrapfst.pyx\":3544\n *   fst.EpsNormalize(deref(ifst._fst), tfst.get(), fst.EPS_NORM_OUTPUT if\n *                                                  eps_norm_output else\n *                                                  fst.EPS_NORM_INPUT)             # <<<<<<<<<<<<<<\n *   return _init_MutableFst(tfst.release())\n * \n */\n    __pyx_t_1 = fst::EPS_NORM_INPUT;\n  }\n\n  /* \"pywrapfst.pyx\":3542\n *   cdef unique_ptr[fst.VectorFstClass] tfst\n *   tfst.reset(new fst.VectorFstClass(ifst.arc_type()))\n *   fst.EpsNormalize(deref(ifst._fst), tfst.get(), fst.EPS_NORM_OUTPUT if             # <<<<<<<<<<<<<<\n *                                                  eps_norm_output else\n *                                                  fst.EPS_NORM_INPUT)\n */\n  fst::script::EpsNormalize((*__pyx_v_ifst->_fst), __pyx_v_tfst.get(), __pyx_t_1);\n\n  /* \"pywrapfst.pyx\":3545\n *                                                  eps_norm_output else\n *                                                  fst.EPS_NORM_INPUT)\n *   return _init_MutableFst(tfst.release())             # <<<<<<<<<<<<<<\n * \n * \n */\n  __Pyx_XDECREF(((PyObject *)__pyx_r));\n  __pyx_t_2 = ((PyObject *)__pyx_f_9pywrapfst__init_MutableFst(__pyx_v_tfst.release())); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3545, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  __pyx_r = ((struct __pyx_obj_9pywrapfst__MutableFst *)__pyx_t_2);\n  __pyx_t_2 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":3518\n * \n * \n * cpdef _MutableFst epsnormalize(_Fst ifst, bool eps_norm_output=False):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   epsnormalize(ifst, eps_norm_output=False)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_AddTraceback(\"pywrapfst.epsnormalize\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XGIVEREF((PyObject *)__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_29epsnormalize(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic char __pyx_doc_9pywrapfst_28epsnormalize[] = \"\\n  epsnormalize(ifst, eps_norm_output=False)\\n\\n  Constructively epsilon-normalizes an FST.\\n\\n  This operation creates an equivalent FST that is epsilon-normalized. An\\n  acceptor is epsilon-normalized if it it is epsilon-removed (cf. `rmepsilon`).\\n  A transducer is input epsilon-normalized if, in addition, along any path, all\\n  arcs with epsilon input labels follow all arcs with non-epsilon input labels.\\n  Output epsilon-normalized is defined similarly. The input FST must be\\n  functional.\\n\\n  Args:\\n    ifst: The input FST.\\n    eps_norm_output: Should the FST be output epsilon-normalized?\\n\\n  Returns:\\n    An equivalent epsilon-normalized FST.\\n\\n  See also: `rmepsilon`.\\n  \";\nstatic PyObject *__pyx_pw_9pywrapfst_29epsnormalize(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst = 0;\n  bool __pyx_v_eps_norm_output;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"epsnormalize (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_ifst,&__pyx_n_s_eps_norm_output,0};\n    PyObject* values[2] = {0,0};\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (likely((values[0] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_ifst)) != 0)) kw_args--;\n        else goto __pyx_L5_argtuple_error;\n        CYTHON_FALLTHROUGH;\n        case  1:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_eps_norm_output);\n          if (value) { values[1] = value; kw_args--; }\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"epsnormalize\") < 0)) __PYX_ERR(0, 3518, __pyx_L3_error)\n      }\n    } else {\n      switch (PyTuple_GET_SIZE(__pyx_args)) {\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n    }\n    __pyx_v_ifst = ((struct __pyx_obj_9pywrapfst__Fst *)values[0]);\n    if (values[1]) {\n      __pyx_v_eps_norm_output = __Pyx_PyObject_IsTrue(values[1]); if (unlikely((__pyx_v_eps_norm_output == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 3518, __pyx_L3_error)\n    } else {\n      __pyx_v_eps_norm_output = ((bool)0);\n    }\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"epsnormalize\", 0, 1, 2, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 3518, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst.epsnormalize\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_ifst), __pyx_ptype_9pywrapfst__Fst, 1, \"ifst\", 0))) __PYX_ERR(0, 3518, __pyx_L1_error)\n  __pyx_r = __pyx_pf_9pywrapfst_28epsnormalize(__pyx_self, __pyx_v_ifst, __pyx_v_eps_norm_output);\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_28epsnormalize(CYTHON_UNUSED PyObject *__pyx_self, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst, bool __pyx_v_eps_norm_output) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  struct __pyx_opt_args_9pywrapfst_epsnormalize __pyx_t_2;\n  __Pyx_RefNannySetupContext(\"epsnormalize\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_2.__pyx_n = 1;\n  __pyx_t_2.eps_norm_output = __pyx_v_eps_norm_output;\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst_epsnormalize(__pyx_v_ifst, 0, &__pyx_t_2)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3518, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.epsnormalize\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":3548\n * \n * \n * cpdef bool equal(_Fst ifst1, _Fst ifst2, float delta=fst.kDelta):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   equal(ifst1, ifst2, delta=0.0009765625)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_31equal(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic bool __pyx_f_9pywrapfst_equal(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst1, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst2, CYTHON_UNUSED int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_equal *__pyx_optional_args) {\n  float __pyx_v_delta = __pyx_k__73;\n  bool __pyx_r;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"equal\", 0);\n  if (__pyx_optional_args) {\n    if (__pyx_optional_args->__pyx_n > 0) {\n      __pyx_v_delta = __pyx_optional_args->delta;\n    }\n  }\n\n  /* \"pywrapfst.pyx\":3568\n *   See also: `equivalent`, `isomorphic`, `randequivalent`.\n *   \"\"\"\n *   return fst.Equal(deref(ifst1._fst), deref(ifst2._fst), delta)             # <<<<<<<<<<<<<<\n * \n * \n */\n  if (unlikely(((PyObject *)__pyx_v_ifst1) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 3568, __pyx_L1_error)\n  }\n  if (unlikely(((PyObject *)__pyx_v_ifst2) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 3568, __pyx_L1_error)\n  }\n  __pyx_r = fst::script::Equal((*__pyx_v_ifst1->_fst), (*__pyx_v_ifst2->_fst), __pyx_v_delta);\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":3548\n * \n * \n * cpdef bool equal(_Fst ifst1, _Fst ifst2, float delta=fst.kDelta):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   equal(ifst1, ifst2, delta=0.0009765625)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_WriteUnraisable(\"pywrapfst.equal\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_31equal(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic char __pyx_doc_9pywrapfst_30equal[] = \"\\n  equal(ifst1, ifst2, delta=0.0009765625)\\n\\n  Are two FSTs equal?\\n\\n  This function tests whether two FSTs have the same states with the same\\n  numbering and the same transitions with the same labels and weights in the\\n  same order.\\n\\n  Args:\\n    ifst1: The first input FST.\\n    ifst2: The second input FST.\\n    delta: Comparison/quantization delta.\\n\\n  Returns:\\n    True if the FSTs satisfy the above condition, else False.\\n\\n  See also: `equivalent`, `isomorphic`, `randequivalent`.\\n  \";\nstatic PyObject *__pyx_pw_9pywrapfst_31equal(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst1 = 0;\n  struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst2 = 0;\n  float __pyx_v_delta;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"equal (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_ifst1,&__pyx_n_s_ifst2,&__pyx_n_s_delta,0};\n    PyObject* values[3] = {0,0,0};\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);\n        CYTHON_FALLTHROUGH;\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (likely((values[0] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_ifst1)) != 0)) kw_args--;\n        else goto __pyx_L5_argtuple_error;\n        CYTHON_FALLTHROUGH;\n        case  1:\n        if (likely((values[1] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_ifst2)) != 0)) kw_args--;\n        else {\n          __Pyx_RaiseArgtupleInvalid(\"equal\", 0, 2, 3, 1); __PYX_ERR(0, 3548, __pyx_L3_error)\n        }\n        CYTHON_FALLTHROUGH;\n        case  2:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_delta);\n          if (value) { values[2] = value; kw_args--; }\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"equal\") < 0)) __PYX_ERR(0, 3548, __pyx_L3_error)\n      }\n    } else {\n      switch (PyTuple_GET_SIZE(__pyx_args)) {\n        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);\n        CYTHON_FALLTHROUGH;\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n    }\n    __pyx_v_ifst1 = ((struct __pyx_obj_9pywrapfst__Fst *)values[0]);\n    __pyx_v_ifst2 = ((struct __pyx_obj_9pywrapfst__Fst *)values[1]);\n    if (values[2]) {\n      __pyx_v_delta = __pyx_PyFloat_AsFloat(values[2]); if (unlikely((__pyx_v_delta == (float)-1) && PyErr_Occurred())) __PYX_ERR(0, 3548, __pyx_L3_error)\n    } else {\n      __pyx_v_delta = __pyx_k__73;\n    }\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"equal\", 0, 2, 3, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 3548, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst.equal\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_ifst1), __pyx_ptype_9pywrapfst__Fst, 1, \"ifst1\", 0))) __PYX_ERR(0, 3548, __pyx_L1_error)\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_ifst2), __pyx_ptype_9pywrapfst__Fst, 1, \"ifst2\", 0))) __PYX_ERR(0, 3548, __pyx_L1_error)\n  __pyx_r = __pyx_pf_9pywrapfst_30equal(__pyx_self, __pyx_v_ifst1, __pyx_v_ifst2, __pyx_v_delta);\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_30equal(CYTHON_UNUSED PyObject *__pyx_self, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst1, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst2, float __pyx_v_delta) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  bool __pyx_t_1;\n  struct __pyx_opt_args_9pywrapfst_equal __pyx_t_2;\n  PyObject *__pyx_t_3 = NULL;\n  __Pyx_RefNannySetupContext(\"equal\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_2.__pyx_n = 1;\n  __pyx_t_2.delta = __pyx_v_delta;\n  __pyx_t_1 = __pyx_f_9pywrapfst_equal(__pyx_v_ifst1, __pyx_v_ifst2, 0, &__pyx_t_2); \n  __pyx_t_3 = __Pyx_PyBool_FromLong(__pyx_t_1); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 3548, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_3);\n  __pyx_r = __pyx_t_3;\n  __pyx_t_3 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_AddTraceback(\"pywrapfst.equal\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":3571\n * \n * \n * cpdef bool equivalent(_Fst ifst1, _Fst ifst2, float delta=fst.kDelta) except *:             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   equivalent(ifst1, ifst2, delta=0.0009765625)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_33equivalent(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic bool __pyx_f_9pywrapfst_equivalent(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst1, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst2, CYTHON_UNUSED int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_equivalent *__pyx_optional_args) {\n  float __pyx_v_delta = __pyx_k__74;\n  bool __pyx_r;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"equivalent\", 0);\n  if (__pyx_optional_args) {\n    if (__pyx_optional_args->__pyx_n > 0) {\n      __pyx_v_delta = __pyx_optional_args->delta;\n    }\n  }\n\n  /* \"pywrapfst.pyx\":3591\n *   See also: `equal`, `isomorphic`, `randequivalent`.\n *   \"\"\"\n *   return fst.Equivalent(deref(ifst1._fst), deref(ifst2._fst), delta)             # <<<<<<<<<<<<<<\n * \n * \n */\n  if (unlikely(((PyObject *)__pyx_v_ifst1) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 3591, __pyx_L1_error)\n  }\n  if (unlikely(((PyObject *)__pyx_v_ifst2) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 3591, __pyx_L1_error)\n  }\n  __pyx_r = fst::script::Equivalent((*__pyx_v_ifst1->_fst), (*__pyx_v_ifst2->_fst), __pyx_v_delta);\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":3571\n * \n * \n * cpdef bool equivalent(_Fst ifst1, _Fst ifst2, float delta=fst.kDelta) except *:             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   equivalent(ifst1, ifst2, delta=0.0009765625)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"pywrapfst.equivalent\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = -1;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_33equivalent(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic char __pyx_doc_9pywrapfst_32equivalent[] = \"\\n  equivalent(ifst1, ifst2, delta=0.0009765625)\\n\\n  Are the two acceptors equivalent?\\n\\n  This operation tests whether two epsilon-free deterministic weighted\\n  acceptors are equivalent, that is if they accept the same strings with the\\n  same weights.\\n\\n  Args:\\n    ifst1: The first input FST.\\n    ifst2: The second input FST.\\n    delta: Comparison/quantization delta.\\n\\n  Returns:\\n    True if the FSTs satisfy the above condition, else False.\\n\\n  See also: `equal`, `isomorphic`, `randequivalent`.\\n  \";\nstatic PyObject *__pyx_pw_9pywrapfst_33equivalent(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst1 = 0;\n  struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst2 = 0;\n  float __pyx_v_delta;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"equivalent (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_ifst1,&__pyx_n_s_ifst2,&__pyx_n_s_delta,0};\n    PyObject* values[3] = {0,0,0};\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);\n        CYTHON_FALLTHROUGH;\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (likely((values[0] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_ifst1)) != 0)) kw_args--;\n        else goto __pyx_L5_argtuple_error;\n        CYTHON_FALLTHROUGH;\n        case  1:\n        if (likely((values[1] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_ifst2)) != 0)) kw_args--;\n        else {\n          __Pyx_RaiseArgtupleInvalid(\"equivalent\", 0, 2, 3, 1); __PYX_ERR(0, 3571, __pyx_L3_error)\n        }\n        CYTHON_FALLTHROUGH;\n        case  2:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_delta);\n          if (value) { values[2] = value; kw_args--; }\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"equivalent\") < 0)) __PYX_ERR(0, 3571, __pyx_L3_error)\n      }\n    } else {\n      switch (PyTuple_GET_SIZE(__pyx_args)) {\n        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);\n        CYTHON_FALLTHROUGH;\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n    }\n    __pyx_v_ifst1 = ((struct __pyx_obj_9pywrapfst__Fst *)values[0]);\n    __pyx_v_ifst2 = ((struct __pyx_obj_9pywrapfst__Fst *)values[1]);\n    if (values[2]) {\n      __pyx_v_delta = __pyx_PyFloat_AsFloat(values[2]); if (unlikely((__pyx_v_delta == (float)-1) && PyErr_Occurred())) __PYX_ERR(0, 3571, __pyx_L3_error)\n    } else {\n      __pyx_v_delta = __pyx_k__74;\n    }\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"equivalent\", 0, 2, 3, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 3571, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst.equivalent\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_ifst1), __pyx_ptype_9pywrapfst__Fst, 1, \"ifst1\", 0))) __PYX_ERR(0, 3571, __pyx_L1_error)\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_ifst2), __pyx_ptype_9pywrapfst__Fst, 1, \"ifst2\", 0))) __PYX_ERR(0, 3571, __pyx_L1_error)\n  __pyx_r = __pyx_pf_9pywrapfst_32equivalent(__pyx_self, __pyx_v_ifst1, __pyx_v_ifst2, __pyx_v_delta);\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_32equivalent(CYTHON_UNUSED PyObject *__pyx_self, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst1, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst2, float __pyx_v_delta) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  bool __pyx_t_1;\n  struct __pyx_opt_args_9pywrapfst_equivalent __pyx_t_2;\n  PyObject *__pyx_t_3 = NULL;\n  __Pyx_RefNannySetupContext(\"equivalent\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_2.__pyx_n = 1;\n  __pyx_t_2.delta = __pyx_v_delta;\n  __pyx_t_1 = __pyx_f_9pywrapfst_equivalent(__pyx_v_ifst1, __pyx_v_ifst2, 0, &__pyx_t_2); if (unlikely(__pyx_t_1 == ((bool)-1) && PyErr_Occurred())) __PYX_ERR(0, 3571, __pyx_L1_error)\n  __pyx_t_3 = __Pyx_PyBool_FromLong(__pyx_t_1); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 3571, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_3);\n  __pyx_r = __pyx_t_3;\n  __pyx_t_3 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_AddTraceback(\"pywrapfst.equivalent\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":3594\n * \n * \n * cpdef _MutableFst intersect(_Fst ifst1,             # <<<<<<<<<<<<<<\n *                             _Fst ifst2,\n *                             compose_filter=b\"auto\",\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_35intersect(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic struct __pyx_obj_9pywrapfst__MutableFst *__pyx_f_9pywrapfst_intersect(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst1, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst2, CYTHON_UNUSED int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_intersect *__pyx_optional_args) {\n  PyObject *__pyx_v_compose_filter = ((PyObject *)__pyx_n_b_auto);\n\n  /* \"pywrapfst.pyx\":3597\n *                             _Fst ifst2,\n *                             compose_filter=b\"auto\",\n *                             bool connect=True):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   intersect(ifst1, ifst2, compose_filter=\"auto\", connect=True)\n */\n  bool __pyx_v_connect = ((bool)1);\n  std::unique_ptr<fst::script::VectorFstClass>  __pyx_v_tfst;\n  std::unique_ptr<fst::ComposeOptions>  __pyx_v_opts;\n  struct __pyx_obj_9pywrapfst__MutableFst *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  std::string __pyx_t_1;\n  enum fst::ComposeFilter __pyx_t_2;\n  PyObject *__pyx_t_3 = NULL;\n  __Pyx_RefNannySetupContext(\"intersect\", 0);\n  if (__pyx_optional_args) {\n    if (__pyx_optional_args->__pyx_n > 0) {\n      __pyx_v_compose_filter = __pyx_optional_args->compose_filter;\n      if (__pyx_optional_args->__pyx_n > 1) {\n        __pyx_v_connect = __pyx_optional_args->connect;\n      }\n    }\n  }\n\n  /* \"pywrapfst.pyx\":3619\n *   \"\"\"\n *   cdef unique_ptr[fst.VectorFstClass] tfst\n *   tfst.reset(new fst.VectorFstClass(ifst1.arc_type()))             # <<<<<<<<<<<<<<\n *   cdef unique_ptr[fst.ComposeOptions] opts\n *   opts.reset(new fst.ComposeOptions(connect,\n */\n  if (unlikely(((PyObject *)__pyx_v_ifst1) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"arc_type\");\n    __PYX_ERR(0, 3619, __pyx_L1_error)\n  }\n  __pyx_v_tfst.reset(new fst::script::VectorFstClass(((struct __pyx_vtabstruct_9pywrapfst__Fst *)__pyx_v_ifst1->__pyx_vtab)->arc_type(__pyx_v_ifst1, 0)));\n\n  /* \"pywrapfst.pyx\":3622\n *   cdef unique_ptr[fst.ComposeOptions] opts\n *   opts.reset(new fst.ComposeOptions(connect,\n *         _get_compose_filter(tostring(compose_filter))))             # <<<<<<<<<<<<<<\n *   fst.Intersect(deref(ifst1._fst), deref(ifst2._fst), tfst.get(), deref(opts))\n *   return _init_MutableFst(tfst.release())\n */\n  __pyx_t_1 = __pyx_f_9pywrapfst_tostring(__pyx_v_compose_filter, NULL); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 3622, __pyx_L1_error)\n  __pyx_t_2 = __pyx_f_9pywrapfst__get_compose_filter(__pyx_t_1); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 3622, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":3621\n *   tfst.reset(new fst.VectorFstClass(ifst1.arc_type()))\n *   cdef unique_ptr[fst.ComposeOptions] opts\n *   opts.reset(new fst.ComposeOptions(connect,             # <<<<<<<<<<<<<<\n *         _get_compose_filter(tostring(compose_filter))))\n *   fst.Intersect(deref(ifst1._fst), deref(ifst2._fst), tfst.get(), deref(opts))\n */\n  __pyx_v_opts.reset(new fst::ComposeOptions(__pyx_v_connect, __pyx_t_2));\n\n  /* \"pywrapfst.pyx\":3623\n *   opts.reset(new fst.ComposeOptions(connect,\n *         _get_compose_filter(tostring(compose_filter))))\n *   fst.Intersect(deref(ifst1._fst), deref(ifst2._fst), tfst.get(), deref(opts))             # <<<<<<<<<<<<<<\n *   return _init_MutableFst(tfst.release())\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_ifst1) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 3623, __pyx_L1_error)\n  }\n  if (unlikely(((PyObject *)__pyx_v_ifst2) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 3623, __pyx_L1_error)\n  }\n  fst::script::Intersect((*__pyx_v_ifst1->_fst), (*__pyx_v_ifst2->_fst), __pyx_v_tfst.get(), (*__pyx_v_opts));\n\n  /* \"pywrapfst.pyx\":3624\n *         _get_compose_filter(tostring(compose_filter))))\n *   fst.Intersect(deref(ifst1._fst), deref(ifst2._fst), tfst.get(), deref(opts))\n *   return _init_MutableFst(tfst.release())             # <<<<<<<<<<<<<<\n * \n * \n */\n  __Pyx_XDECREF(((PyObject *)__pyx_r));\n  __pyx_t_3 = ((PyObject *)__pyx_f_9pywrapfst__init_MutableFst(__pyx_v_tfst.release())); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 3624, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_3);\n  __pyx_r = ((struct __pyx_obj_9pywrapfst__MutableFst *)__pyx_t_3);\n  __pyx_t_3 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":3594\n * \n * \n * cpdef _MutableFst intersect(_Fst ifst1,             # <<<<<<<<<<<<<<\n *                             _Fst ifst2,\n *                             compose_filter=b\"auto\",\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_AddTraceback(\"pywrapfst.intersect\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XGIVEREF((PyObject *)__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_35intersect(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic char __pyx_doc_9pywrapfst_34intersect[] = \"\\n  intersect(ifst1, ifst2, compose_filter=\\\"auto\\\", connect=True)\\n\\n  Constructively intersects two FSTs.\\n\\n  This operation computes the intersection (Hadamard product) of two FSTs.\\n  Only strings that are in both automata are retained in the result. The two\\n  arguments must be acceptors. One of the arguments must be label-sorted (or\\n  otherwise support appropriate matchers).\\n\\n  Args:\\n    ifst1: The first input FST.\\n    ifst2: The second input FST.\\n    compose_filter: A string matching a known composition filter; one of:\\n        \\\"alt_sequence\\\", \\\"auto\\\", \\\"match\\\", \\\"null\\\", \\\"sequence\\\", \\\"trivial\\\".\\n    connect: Should output be trimmed?\\n\\n  Returns:\\n    An intersected FST.\\n  \";\nstatic PyObject *__pyx_pw_9pywrapfst_35intersect(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst1 = 0;\n  struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst2 = 0;\n  PyObject *__pyx_v_compose_filter = 0;\n  bool __pyx_v_connect;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"intersect (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_ifst1,&__pyx_n_s_ifst2,&__pyx_n_s_compose_filter,&__pyx_n_s_connect,0};\n    PyObject* values[4] = {0,0,0,0};\n    values[2] = ((PyObject *)__pyx_n_b_auto);\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  4: values[3] = PyTuple_GET_ITEM(__pyx_args, 3);\n        CYTHON_FALLTHROUGH;\n        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);\n        CYTHON_FALLTHROUGH;\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (likely((values[0] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_ifst1)) != 0)) kw_args--;\n        else goto __pyx_L5_argtuple_error;\n        CYTHON_FALLTHROUGH;\n        case  1:\n        if (likely((values[1] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_ifst2)) != 0)) kw_args--;\n        else {\n          __Pyx_RaiseArgtupleInvalid(\"intersect\", 0, 2, 4, 1); __PYX_ERR(0, 3594, __pyx_L3_error)\n        }\n        CYTHON_FALLTHROUGH;\n        case  2:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_compose_filter);\n          if (value) { values[2] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  3:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_connect);\n          if (value) { values[3] = value; kw_args--; }\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"intersect\") < 0)) __PYX_ERR(0, 3594, __pyx_L3_error)\n      }\n    } else {\n      switch (PyTuple_GET_SIZE(__pyx_args)) {\n        case  4: values[3] = PyTuple_GET_ITEM(__pyx_args, 3);\n        CYTHON_FALLTHROUGH;\n        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);\n        CYTHON_FALLTHROUGH;\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n    }\n    __pyx_v_ifst1 = ((struct __pyx_obj_9pywrapfst__Fst *)values[0]);\n    __pyx_v_ifst2 = ((struct __pyx_obj_9pywrapfst__Fst *)values[1]);\n    __pyx_v_compose_filter = values[2];\n    if (values[3]) {\n      __pyx_v_connect = __Pyx_PyObject_IsTrue(values[3]); if (unlikely((__pyx_v_connect == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 3597, __pyx_L3_error)\n    } else {\n\n      /* \"pywrapfst.pyx\":3597\n *                             _Fst ifst2,\n *                             compose_filter=b\"auto\",\n *                             bool connect=True):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   intersect(ifst1, ifst2, compose_filter=\"auto\", connect=True)\n */\n      __pyx_v_connect = ((bool)1);\n    }\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"intersect\", 0, 2, 4, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 3594, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst.intersect\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_ifst1), __pyx_ptype_9pywrapfst__Fst, 1, \"ifst1\", 0))) __PYX_ERR(0, 3594, __pyx_L1_error)\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_ifst2), __pyx_ptype_9pywrapfst__Fst, 1, \"ifst2\", 0))) __PYX_ERR(0, 3595, __pyx_L1_error)\n  __pyx_r = __pyx_pf_9pywrapfst_34intersect(__pyx_self, __pyx_v_ifst1, __pyx_v_ifst2, __pyx_v_compose_filter, __pyx_v_connect);\n\n  /* \"pywrapfst.pyx\":3594\n * \n * \n * cpdef _MutableFst intersect(_Fst ifst1,             # <<<<<<<<<<<<<<\n *                             _Fst ifst2,\n *                             compose_filter=b\"auto\",\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_34intersect(CYTHON_UNUSED PyObject *__pyx_self, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst1, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst2, PyObject *__pyx_v_compose_filter, bool __pyx_v_connect) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  struct __pyx_opt_args_9pywrapfst_intersect __pyx_t_2;\n  __Pyx_RefNannySetupContext(\"intersect\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_2.__pyx_n = 2;\n  __pyx_t_2.compose_filter = __pyx_v_compose_filter;\n  __pyx_t_2.connect = __pyx_v_connect;\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst_intersect(__pyx_v_ifst1, __pyx_v_ifst2, 0, &__pyx_t_2)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3594, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.intersect\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":3627\n * \n * \n * cpdef bool isomorphic(_Fst ifst1, _Fst ifst2, float delta=fst.kDelta):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   isomorphic(ifst1, ifst2, delta=0.0009765625)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_37isomorphic(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic bool __pyx_f_9pywrapfst_isomorphic(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst1, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst2, CYTHON_UNUSED int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_isomorphic *__pyx_optional_args) {\n  float __pyx_v_delta = __pyx_k__75;\n  bool __pyx_r;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"isomorphic\", 0);\n  if (__pyx_optional_args) {\n    if (__pyx_optional_args->__pyx_n > 0) {\n      __pyx_v_delta = __pyx_optional_args->delta;\n    }\n  }\n\n  /* \"pywrapfst.pyx\":3650\n *   See also: `equal`, `equivalent`, `randequivalent`.\n *   \"\"\"\n *   return fst.Isomorphic(deref(ifst1._fst), deref(ifst2._fst), delta)             # <<<<<<<<<<<<<<\n * \n * \n */\n  if (unlikely(((PyObject *)__pyx_v_ifst1) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 3650, __pyx_L1_error)\n  }\n  if (unlikely(((PyObject *)__pyx_v_ifst2) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 3650, __pyx_L1_error)\n  }\n  __pyx_r = fst::script::Isomorphic((*__pyx_v_ifst1->_fst), (*__pyx_v_ifst2->_fst), __pyx_v_delta);\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":3627\n * \n * \n * cpdef bool isomorphic(_Fst ifst1, _Fst ifst2, float delta=fst.kDelta):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   isomorphic(ifst1, ifst2, delta=0.0009765625)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_WriteUnraisable(\"pywrapfst.isomorphic\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_37isomorphic(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic char __pyx_doc_9pywrapfst_36isomorphic[] = \"\\n  isomorphic(ifst1, ifst2, delta=0.0009765625)\\n\\n  Are the two acceptors isomorphic?\\n\\n  This operation determines if two transducers with a certain required\\n  determinism have the same states, irrespective of numbering, and the same\\n  transitions with the same labels and weights, irrespective of ordering. In\\n  other words, FSTs A, B are isomorphic if and only if the states of A can be\\n  renumbered and the transitions leaving each state reordered so the two are\\n  equal (according to the definition given in `equal`).\\n\\n  Args:\\n    ifst1: The first input FST.\\n    ifst2: The second input FST.\\n    delta: Comparison/quantization delta.\\n\\n  Returns:\\n    True if the two transducers satisfy the above condition, else False.\\n\\n  See also: `equal`, `equivalent`, `randequivalent`.\\n  \";\nstatic PyObject *__pyx_pw_9pywrapfst_37isomorphic(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst1 = 0;\n  struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst2 = 0;\n  float __pyx_v_delta;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"isomorphic (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_ifst1,&__pyx_n_s_ifst2,&__pyx_n_s_delta,0};\n    PyObject* values[3] = {0,0,0};\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);\n        CYTHON_FALLTHROUGH;\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (likely((values[0] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_ifst1)) != 0)) kw_args--;\n        else goto __pyx_L5_argtuple_error;\n        CYTHON_FALLTHROUGH;\n        case  1:\n        if (likely((values[1] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_ifst2)) != 0)) kw_args--;\n        else {\n          __Pyx_RaiseArgtupleInvalid(\"isomorphic\", 0, 2, 3, 1); __PYX_ERR(0, 3627, __pyx_L3_error)\n        }\n        CYTHON_FALLTHROUGH;\n        case  2:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_delta);\n          if (value) { values[2] = value; kw_args--; }\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"isomorphic\") < 0)) __PYX_ERR(0, 3627, __pyx_L3_error)\n      }\n    } else {\n      switch (PyTuple_GET_SIZE(__pyx_args)) {\n        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);\n        CYTHON_FALLTHROUGH;\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n    }\n    __pyx_v_ifst1 = ((struct __pyx_obj_9pywrapfst__Fst *)values[0]);\n    __pyx_v_ifst2 = ((struct __pyx_obj_9pywrapfst__Fst *)values[1]);\n    if (values[2]) {\n      __pyx_v_delta = __pyx_PyFloat_AsFloat(values[2]); if (unlikely((__pyx_v_delta == (float)-1) && PyErr_Occurred())) __PYX_ERR(0, 3627, __pyx_L3_error)\n    } else {\n      __pyx_v_delta = __pyx_k__75;\n    }\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"isomorphic\", 0, 2, 3, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 3627, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst.isomorphic\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_ifst1), __pyx_ptype_9pywrapfst__Fst, 1, \"ifst1\", 0))) __PYX_ERR(0, 3627, __pyx_L1_error)\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_ifst2), __pyx_ptype_9pywrapfst__Fst, 1, \"ifst2\", 0))) __PYX_ERR(0, 3627, __pyx_L1_error)\n  __pyx_r = __pyx_pf_9pywrapfst_36isomorphic(__pyx_self, __pyx_v_ifst1, __pyx_v_ifst2, __pyx_v_delta);\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_36isomorphic(CYTHON_UNUSED PyObject *__pyx_self, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst1, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst2, float __pyx_v_delta) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  bool __pyx_t_1;\n  struct __pyx_opt_args_9pywrapfst_isomorphic __pyx_t_2;\n  PyObject *__pyx_t_3 = NULL;\n  __Pyx_RefNannySetupContext(\"isomorphic\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_2.__pyx_n = 1;\n  __pyx_t_2.delta = __pyx_v_delta;\n  __pyx_t_1 = __pyx_f_9pywrapfst_isomorphic(__pyx_v_ifst1, __pyx_v_ifst2, 0, &__pyx_t_2); \n  __pyx_t_3 = __Pyx_PyBool_FromLong(__pyx_t_1); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 3627, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_3);\n  __pyx_r = __pyx_t_3;\n  __pyx_t_3 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_AddTraceback(\"pywrapfst.isomorphic\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":3653\n * \n * \n * cpdef _MutableFst prune(_Fst ifst,             # <<<<<<<<<<<<<<\n *                         float delta=fst.kDelta,\n *                         int64 nstate=fst.kNoStateId,\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_39prune(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic struct __pyx_obj_9pywrapfst__MutableFst *__pyx_f_9pywrapfst_prune(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst, CYTHON_UNUSED int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_prune *__pyx_optional_args) {\n  float __pyx_v_delta = __pyx_k__76;\n  __pyx_t_10basictypes_int64 __pyx_v_nstate = __pyx_k__77;\n\n  /* \"pywrapfst.pyx\":3656\n *                         float delta=fst.kDelta,\n *                         int64 nstate=fst.kNoStateId,\n *                         weight=None):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   prune(ifst, delta=0.0009765625, nstate=NO_STATE_ID, weight=None)\n */\n  PyObject *__pyx_v_weight = ((PyObject *)Py_None);\n  std::unique_ptr<fst::script::VectorFstClass>  __pyx_v_tfst;\n  fst::script::WeightClass __pyx_v_wc;\n  struct __pyx_obj_9pywrapfst__MutableFst *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  fst::script::WeightClass __pyx_t_1;\n  PyObject *__pyx_t_2 = NULL;\n  __Pyx_RefNannySetupContext(\"prune\", 0);\n  if (__pyx_optional_args) {\n    if (__pyx_optional_args->__pyx_n > 0) {\n      __pyx_v_delta = __pyx_optional_args->delta;\n      if (__pyx_optional_args->__pyx_n > 1) {\n        __pyx_v_nstate = __pyx_optional_args->nstate;\n        if (__pyx_optional_args->__pyx_n > 2) {\n          __pyx_v_weight = __pyx_optional_args->weight;\n        }\n      }\n    }\n  }\n\n  /* \"pywrapfst.pyx\":3680\n *   \"\"\"\n *   cdef unique_ptr[fst.VectorFstClass] tfst\n *   tfst.reset(new fst.VectorFstClass(ifst.arc_type()))             # <<<<<<<<<<<<<<\n *   cdef fst.WeightClass wc = _get_WeightClass_or_Zero(ifst.weight_type(), weight)\n *   fst.Prune(deref(ifst._fst), tfst.get(), wc, nstate, delta)\n */\n  if (unlikely(((PyObject *)__pyx_v_ifst) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"arc_type\");\n    __PYX_ERR(0, 3680, __pyx_L1_error)\n  }\n  __pyx_v_tfst.reset(new fst::script::VectorFstClass(((struct __pyx_vtabstruct_9pywrapfst__Fst *)__pyx_v_ifst->__pyx_vtab)->arc_type(__pyx_v_ifst, 0)));\n\n  /* \"pywrapfst.pyx\":3681\n *   cdef unique_ptr[fst.VectorFstClass] tfst\n *   tfst.reset(new fst.VectorFstClass(ifst.arc_type()))\n *   cdef fst.WeightClass wc = _get_WeightClass_or_Zero(ifst.weight_type(), weight)             # <<<<<<<<<<<<<<\n *   fst.Prune(deref(ifst._fst), tfst.get(), wc, nstate, delta)\n *   return _init_MutableFst(tfst.release())\n */\n  if (unlikely(((PyObject *)__pyx_v_ifst) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"weight_type\");\n    __PYX_ERR(0, 3681, __pyx_L1_error)\n  }\n  __pyx_t_1 = __pyx_f_9pywrapfst__get_WeightClass_or_Zero(((struct __pyx_vtabstruct_9pywrapfst__Fst *)__pyx_v_ifst->__pyx_vtab)->weight_type(__pyx_v_ifst, 0), __pyx_v_weight); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 3681, __pyx_L1_error)\n  __pyx_v_wc = __pyx_t_1;\n\n  /* \"pywrapfst.pyx\":3682\n *   tfst.reset(new fst.VectorFstClass(ifst.arc_type()))\n *   cdef fst.WeightClass wc = _get_WeightClass_or_Zero(ifst.weight_type(), weight)\n *   fst.Prune(deref(ifst._fst), tfst.get(), wc, nstate, delta)             # <<<<<<<<<<<<<<\n *   return _init_MutableFst(tfst.release())\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_ifst) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 3682, __pyx_L1_error)\n  }\n  fst::script::Prune((*__pyx_v_ifst->_fst), __pyx_v_tfst.get(), __pyx_v_wc, __pyx_v_nstate, __pyx_v_delta);\n\n  /* \"pywrapfst.pyx\":3683\n *   cdef fst.WeightClass wc = _get_WeightClass_or_Zero(ifst.weight_type(), weight)\n *   fst.Prune(deref(ifst._fst), tfst.get(), wc, nstate, delta)\n *   return _init_MutableFst(tfst.release())             # <<<<<<<<<<<<<<\n * \n * \n */\n  __Pyx_XDECREF(((PyObject *)__pyx_r));\n  __pyx_t_2 = ((PyObject *)__pyx_f_9pywrapfst__init_MutableFst(__pyx_v_tfst.release())); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3683, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  __pyx_r = ((struct __pyx_obj_9pywrapfst__MutableFst *)__pyx_t_2);\n  __pyx_t_2 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":3653\n * \n * \n * cpdef _MutableFst prune(_Fst ifst,             # <<<<<<<<<<<<<<\n *                         float delta=fst.kDelta,\n *                         int64 nstate=fst.kNoStateId,\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_AddTraceback(\"pywrapfst.prune\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XGIVEREF((PyObject *)__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_39prune(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic char __pyx_doc_9pywrapfst_38prune[] = \"\\n  prune(ifst, delta=0.0009765625, nstate=NO_STATE_ID, weight=None)\\n\\n  Constructively removes paths with weights below a certain threshold.\\n\\n  This operation deletes states and arcs in the input FST that do not belong\\n  to a successful path whose weight is no more (w.r.t the natural semiring\\n  order) than the threshold t \\\\otimes-times the weight of the shortest path in\\n  the input FST. Weights must be commutative and have the path property.\\n\\n  Args:\\n    ifst: The input FST.\\n    delta: Comparison/quantization delta.\\n    nstate: State number threshold.\\n    weight: A Weight or weight string indicating the desired weight threshold\\n        below which paths are pruned; if omitted, no paths are pruned.\\n\\n  Returns:\\n    A pruned FST.\\n\\n  See also: The destructive variant.\\n  \";\nstatic PyObject *__pyx_pw_9pywrapfst_39prune(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst = 0;\n  float __pyx_v_delta;\n  __pyx_t_10basictypes_int64 __pyx_v_nstate;\n  PyObject *__pyx_v_weight = 0;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"prune (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_ifst,&__pyx_n_s_delta,&__pyx_n_s_nstate,&__pyx_n_s_weight,0};\n    PyObject* values[4] = {0,0,0,0};\n\n    /* \"pywrapfst.pyx\":3656\n *                         float delta=fst.kDelta,\n *                         int64 nstate=fst.kNoStateId,\n *                         weight=None):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   prune(ifst, delta=0.0009765625, nstate=NO_STATE_ID, weight=None)\n */\n    values[3] = ((PyObject *)Py_None);\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  4: values[3] = PyTuple_GET_ITEM(__pyx_args, 3);\n        CYTHON_FALLTHROUGH;\n        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);\n        CYTHON_FALLTHROUGH;\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (likely((values[0] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_ifst)) != 0)) kw_args--;\n        else goto __pyx_L5_argtuple_error;\n        CYTHON_FALLTHROUGH;\n        case  1:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_delta);\n          if (value) { values[1] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  2:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_nstate);\n          if (value) { values[2] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  3:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_weight);\n          if (value) { values[3] = value; kw_args--; }\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"prune\") < 0)) __PYX_ERR(0, 3653, __pyx_L3_error)\n      }\n    } else {\n      switch (PyTuple_GET_SIZE(__pyx_args)) {\n        case  4: values[3] = PyTuple_GET_ITEM(__pyx_args, 3);\n        CYTHON_FALLTHROUGH;\n        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);\n        CYTHON_FALLTHROUGH;\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n    }\n    __pyx_v_ifst = ((struct __pyx_obj_9pywrapfst__Fst *)values[0]);\n    if (values[1]) {\n      __pyx_v_delta = __pyx_PyFloat_AsFloat(values[1]); if (unlikely((__pyx_v_delta == (float)-1) && PyErr_Occurred())) __PYX_ERR(0, 3654, __pyx_L3_error)\n    } else {\n      __pyx_v_delta = __pyx_k__76;\n    }\n    if (values[2]) {\n      __pyx_v_nstate = __Pyx_PyInt_As_int64_t(values[2]); if (unlikely((__pyx_v_nstate == ((int64_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 3655, __pyx_L3_error)\n    } else {\n      __pyx_v_nstate = __pyx_k__77;\n    }\n    __pyx_v_weight = values[3];\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"prune\", 0, 1, 4, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 3653, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst.prune\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_ifst), __pyx_ptype_9pywrapfst__Fst, 1, \"ifst\", 0))) __PYX_ERR(0, 3653, __pyx_L1_error)\n  __pyx_r = __pyx_pf_9pywrapfst_38prune(__pyx_self, __pyx_v_ifst, __pyx_v_delta, __pyx_v_nstate, __pyx_v_weight);\n\n  /* \"pywrapfst.pyx\":3653\n * \n * \n * cpdef _MutableFst prune(_Fst ifst,             # <<<<<<<<<<<<<<\n *                         float delta=fst.kDelta,\n *                         int64 nstate=fst.kNoStateId,\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_38prune(CYTHON_UNUSED PyObject *__pyx_self, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst, float __pyx_v_delta, __pyx_t_10basictypes_int64 __pyx_v_nstate, PyObject *__pyx_v_weight) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  struct __pyx_opt_args_9pywrapfst_prune __pyx_t_2;\n  __Pyx_RefNannySetupContext(\"prune\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_2.__pyx_n = 3;\n  __pyx_t_2.delta = __pyx_v_delta;\n  __pyx_t_2.nstate = __pyx_v_nstate;\n  __pyx_t_2.weight = __pyx_v_weight;\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst_prune(__pyx_v_ifst, 0, &__pyx_t_2)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3653, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.prune\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":3686\n * \n * \n * cpdef _MutableFst push(_Fst ifst,             # <<<<<<<<<<<<<<\n *                        float delta=fst.kDelta,\n *                        bool push_weights=False,\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_41push(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic struct __pyx_obj_9pywrapfst__MutableFst *__pyx_f_9pywrapfst_push(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst, CYTHON_UNUSED int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_push *__pyx_optional_args) {\n  float __pyx_v_delta = __pyx_k__78;\n\n  /* \"pywrapfst.pyx\":3688\n * cpdef _MutableFst push(_Fst ifst,\n *                        float delta=fst.kDelta,\n *                        bool push_weights=False,             # <<<<<<<<<<<<<<\n *                        bool push_labels=False,\n *                        bool remove_common_affix=False,\n */\n  bool __pyx_v_push_weights = ((bool)0);\n\n  /* \"pywrapfst.pyx\":3689\n *                        float delta=fst.kDelta,\n *                        bool push_weights=False,\n *                        bool push_labels=False,             # <<<<<<<<<<<<<<\n *                        bool remove_common_affix=False,\n *                        bool remove_total_weight=False,\n */\n  bool __pyx_v_push_labels = ((bool)0);\n\n  /* \"pywrapfst.pyx\":3690\n *                        bool push_weights=False,\n *                        bool push_labels=False,\n *                        bool remove_common_affix=False,             # <<<<<<<<<<<<<<\n *                        bool remove_total_weight=False,\n *                        bool to_final=False):\n */\n  bool __pyx_v_remove_common_affix = ((bool)0);\n\n  /* \"pywrapfst.pyx\":3691\n *                        bool push_labels=False,\n *                        bool remove_common_affix=False,\n *                        bool remove_total_weight=False,             # <<<<<<<<<<<<<<\n *                        bool to_final=False):\n *   \"\"\"\n */\n  bool __pyx_v_remove_total_weight = ((bool)0);\n\n  /* \"pywrapfst.pyx\":3692\n *                        bool remove_common_affix=False,\n *                        bool remove_total_weight=False,\n *                        bool to_final=False):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   push(ifst, delta=0.0009765625, push_weights=False, push_labels=False,\n */\n  bool __pyx_v_to_final = ((bool)0);\n  std::unique_ptr<fst::script::VectorFstClass>  __pyx_v_tfst;\n  __pyx_t_10basictypes_uint32 __pyx_v_flags;\n  struct __pyx_obj_9pywrapfst__MutableFst *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"push\", 0);\n  if (__pyx_optional_args) {\n    if (__pyx_optional_args->__pyx_n > 0) {\n      __pyx_v_delta = __pyx_optional_args->delta;\n      if (__pyx_optional_args->__pyx_n > 1) {\n        __pyx_v_push_weights = __pyx_optional_args->push_weights;\n        if (__pyx_optional_args->__pyx_n > 2) {\n          __pyx_v_push_labels = __pyx_optional_args->push_labels;\n          if (__pyx_optional_args->__pyx_n > 3) {\n            __pyx_v_remove_common_affix = __pyx_optional_args->remove_common_affix;\n            if (__pyx_optional_args->__pyx_n > 4) {\n              __pyx_v_remove_total_weight = __pyx_optional_args->remove_total_weight;\n              if (__pyx_optional_args->__pyx_n > 5) {\n                __pyx_v_to_final = __pyx_optional_args->to_final;\n              }\n            }\n          }\n        }\n      }\n    }\n  }\n\n  /* \"pywrapfst.pyx\":3732\n *   # This is copied, almost verbatim, from nlp/fst/bin/fstpush.cc.\n *   cdef unique_ptr[fst.VectorFstClass] tfst\n *   tfst.reset(new fst.VectorFstClass(ifst.arc_type()))             # <<<<<<<<<<<<<<\n *   cdef uint32 flags = fst.GetPushFlags(push_weights, push_labels,\n *                                        remove_common_affix, remove_total_weight)\n */\n  if (unlikely(((PyObject *)__pyx_v_ifst) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"arc_type\");\n    __PYX_ERR(0, 3732, __pyx_L1_error)\n  }\n  __pyx_v_tfst.reset(new fst::script::VectorFstClass(((struct __pyx_vtabstruct_9pywrapfst__Fst *)__pyx_v_ifst->__pyx_vtab)->arc_type(__pyx_v_ifst, 0)));\n\n  /* \"pywrapfst.pyx\":3733\n *   cdef unique_ptr[fst.VectorFstClass] tfst\n *   tfst.reset(new fst.VectorFstClass(ifst.arc_type()))\n *   cdef uint32 flags = fst.GetPushFlags(push_weights, push_labels,             # <<<<<<<<<<<<<<\n *                                        remove_common_affix, remove_total_weight)\n *   fst.Push(deref(ifst._fst), tfst.get(), flags, fst.GetReweightType(to_final),\n */\n  __pyx_v_flags = fst::script::GetPushFlags(__pyx_v_push_weights, __pyx_v_push_labels, __pyx_v_remove_common_affix, __pyx_v_remove_total_weight);\n\n  /* \"pywrapfst.pyx\":3735\n *   cdef uint32 flags = fst.GetPushFlags(push_weights, push_labels,\n *                                        remove_common_affix, remove_total_weight)\n *   fst.Push(deref(ifst._fst), tfst.get(), flags, fst.GetReweightType(to_final),             # <<<<<<<<<<<<<<\n *            delta)\n *   return _init_MutableFst(tfst.release())\n */\n  if (unlikely(((PyObject *)__pyx_v_ifst) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 3735, __pyx_L1_error)\n  }\n\n  /* \"pywrapfst.pyx\":3736\n *                                        remove_common_affix, remove_total_weight)\n *   fst.Push(deref(ifst._fst), tfst.get(), flags, fst.GetReweightType(to_final),\n *            delta)             # <<<<<<<<<<<<<<\n *   return _init_MutableFst(tfst.release())\n * \n */\n  fst::script::Push((*__pyx_v_ifst->_fst), __pyx_v_tfst.get(), __pyx_v_flags, fst::script::GetReweightType(__pyx_v_to_final), __pyx_v_delta);\n\n  /* \"pywrapfst.pyx\":3737\n *   fst.Push(deref(ifst._fst), tfst.get(), flags, fst.GetReweightType(to_final),\n *            delta)\n *   return _init_MutableFst(tfst.release())             # <<<<<<<<<<<<<<\n * \n * \n */\n  __Pyx_XDECREF(((PyObject *)__pyx_r));\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst__init_MutableFst(__pyx_v_tfst.release())); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3737, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = ((struct __pyx_obj_9pywrapfst__MutableFst *)__pyx_t_1);\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":3686\n * \n * \n * cpdef _MutableFst push(_Fst ifst,             # <<<<<<<<<<<<<<\n *                        float delta=fst.kDelta,\n *                        bool push_weights=False,\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.push\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XGIVEREF((PyObject *)__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_41push(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic char __pyx_doc_9pywrapfst_40push[] = \"\\n  push(ifst, delta=0.0009765625, push_weights=False, push_labels=False,\\n       remove_common_affix=False, remove_total_weight=False, to_final=False)\\n\\n  Constructively pushes weights/labels towards initial or final states.\\n\\n  This operation produces an equivalent transducer by pushing the weights\\n  and/or the labels towards the initial state or toward the final states.\\n\\n  When pushing weights towards the initial state, the sum of the weight of the\\n  outgoing transitions and final weight at any non-initial state is equal to 1\\n  in the resulting machine. When pushing weights towards the final states, the\\n  sum of the weight of the incoming transitions at any state is equal to 1.\\n  Weights need to be left distributive when pushing towards the initial state\\n  and right distributive when pushing towards the final states.\\n\\n  Pushing labels towards the initial state consists in minimizing at every\\n  state the length of the longest common prefix of the output labels of the\\n  outgoing paths. Pushing labels towards the final states consists in\\n  minimizing at every state the length of the longest common suffix of the\\n  output labels of the incoming paths.\\n\\n  Args:\\n    ifst: The input FST.\\n    delta: Comparison/quantization delta.\\n    push_weights: Should weights be pushed?\\n    push_labels: Should labels be pushed?\\n    remove_common_affix: If pushing labels, should common prefix/suffix be\\n        removed?\\n    remove_total_weight: If pushing weights, should total weight be removed?\\n    to_final: Push towards final states?\\n\\n  Returns:\\n    An equivalent pushed FST.\\n\\n  See also: The destructive variant.\\n  \";\nstatic PyObject *__pyx_pw_9pywrapfst_41push(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst = 0;\n  float __pyx_v_delta;\n  bool __pyx_v_push_weights;\n  bool __pyx_v_push_labels;\n  bool __pyx_v_remove_common_affix;\n  bool __pyx_v_remove_total_weight;\n  bool __pyx_v_to_final;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"push (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_ifst,&__pyx_n_s_delta,&__pyx_n_s_push_weights,&__pyx_n_s_push_labels,&__pyx_n_s_remove_common_affix,&__pyx_n_s_remove_total_weight,&__pyx_n_s_to_final,0};\n    PyObject* values[7] = {0,0,0,0,0,0,0};\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  7: values[6] = PyTuple_GET_ITEM(__pyx_args, 6);\n        CYTHON_FALLTHROUGH;\n        case  6: values[5] = PyTuple_GET_ITEM(__pyx_args, 5);\n        CYTHON_FALLTHROUGH;\n        case  5: values[4] = PyTuple_GET_ITEM(__pyx_args, 4);\n        CYTHON_FALLTHROUGH;\n        case  4: values[3] = PyTuple_GET_ITEM(__pyx_args, 3);\n        CYTHON_FALLTHROUGH;\n        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);\n        CYTHON_FALLTHROUGH;\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (likely((values[0] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_ifst)) != 0)) kw_args--;\n        else goto __pyx_L5_argtuple_error;\n        CYTHON_FALLTHROUGH;\n        case  1:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_delta);\n          if (value) { values[1] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  2:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_push_weights);\n          if (value) { values[2] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  3:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_push_labels);\n          if (value) { values[3] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  4:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_remove_common_affix);\n          if (value) { values[4] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  5:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_remove_total_weight);\n          if (value) { values[5] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  6:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_to_final);\n          if (value) { values[6] = value; kw_args--; }\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"push\") < 0)) __PYX_ERR(0, 3686, __pyx_L3_error)\n      }\n    } else {\n      switch (PyTuple_GET_SIZE(__pyx_args)) {\n        case  7: values[6] = PyTuple_GET_ITEM(__pyx_args, 6);\n        CYTHON_FALLTHROUGH;\n        case  6: values[5] = PyTuple_GET_ITEM(__pyx_args, 5);\n        CYTHON_FALLTHROUGH;\n        case  5: values[4] = PyTuple_GET_ITEM(__pyx_args, 4);\n        CYTHON_FALLTHROUGH;\n        case  4: values[3] = PyTuple_GET_ITEM(__pyx_args, 3);\n        CYTHON_FALLTHROUGH;\n        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);\n        CYTHON_FALLTHROUGH;\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n    }\n    __pyx_v_ifst = ((struct __pyx_obj_9pywrapfst__Fst *)values[0]);\n    if (values[1]) {\n      __pyx_v_delta = __pyx_PyFloat_AsFloat(values[1]); if (unlikely((__pyx_v_delta == (float)-1) && PyErr_Occurred())) __PYX_ERR(0, 3687, __pyx_L3_error)\n    } else {\n      __pyx_v_delta = __pyx_k__78;\n    }\n    if (values[2]) {\n      __pyx_v_push_weights = __Pyx_PyObject_IsTrue(values[2]); if (unlikely((__pyx_v_push_weights == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 3688, __pyx_L3_error)\n    } else {\n\n      /* \"pywrapfst.pyx\":3688\n * cpdef _MutableFst push(_Fst ifst,\n *                        float delta=fst.kDelta,\n *                        bool push_weights=False,             # <<<<<<<<<<<<<<\n *                        bool push_labels=False,\n *                        bool remove_common_affix=False,\n */\n      __pyx_v_push_weights = ((bool)0);\n    }\n    if (values[3]) {\n      __pyx_v_push_labels = __Pyx_PyObject_IsTrue(values[3]); if (unlikely((__pyx_v_push_labels == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 3689, __pyx_L3_error)\n    } else {\n\n      /* \"pywrapfst.pyx\":3689\n *                        float delta=fst.kDelta,\n *                        bool push_weights=False,\n *                        bool push_labels=False,             # <<<<<<<<<<<<<<\n *                        bool remove_common_affix=False,\n *                        bool remove_total_weight=False,\n */\n      __pyx_v_push_labels = ((bool)0);\n    }\n    if (values[4]) {\n      __pyx_v_remove_common_affix = __Pyx_PyObject_IsTrue(values[4]); if (unlikely((__pyx_v_remove_common_affix == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 3690, __pyx_L3_error)\n    } else {\n\n      /* \"pywrapfst.pyx\":3690\n *                        bool push_weights=False,\n *                        bool push_labels=False,\n *                        bool remove_common_affix=False,             # <<<<<<<<<<<<<<\n *                        bool remove_total_weight=False,\n *                        bool to_final=False):\n */\n      __pyx_v_remove_common_affix = ((bool)0);\n    }\n    if (values[5]) {\n      __pyx_v_remove_total_weight = __Pyx_PyObject_IsTrue(values[5]); if (unlikely((__pyx_v_remove_total_weight == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 3691, __pyx_L3_error)\n    } else {\n\n      /* \"pywrapfst.pyx\":3691\n *                        bool push_labels=False,\n *                        bool remove_common_affix=False,\n *                        bool remove_total_weight=False,             # <<<<<<<<<<<<<<\n *                        bool to_final=False):\n *   \"\"\"\n */\n      __pyx_v_remove_total_weight = ((bool)0);\n    }\n    if (values[6]) {\n      __pyx_v_to_final = __Pyx_PyObject_IsTrue(values[6]); if (unlikely((__pyx_v_to_final == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 3692, __pyx_L3_error)\n    } else {\n\n      /* \"pywrapfst.pyx\":3692\n *                        bool remove_common_affix=False,\n *                        bool remove_total_weight=False,\n *                        bool to_final=False):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   push(ifst, delta=0.0009765625, push_weights=False, push_labels=False,\n */\n      __pyx_v_to_final = ((bool)0);\n    }\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"push\", 0, 1, 7, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 3686, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst.push\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_ifst), __pyx_ptype_9pywrapfst__Fst, 1, \"ifst\", 0))) __PYX_ERR(0, 3686, __pyx_L1_error)\n  __pyx_r = __pyx_pf_9pywrapfst_40push(__pyx_self, __pyx_v_ifst, __pyx_v_delta, __pyx_v_push_weights, __pyx_v_push_labels, __pyx_v_remove_common_affix, __pyx_v_remove_total_weight, __pyx_v_to_final);\n\n  /* \"pywrapfst.pyx\":3686\n * \n * \n * cpdef _MutableFst push(_Fst ifst,             # <<<<<<<<<<<<<<\n *                        float delta=fst.kDelta,\n *                        bool push_weights=False,\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_40push(CYTHON_UNUSED PyObject *__pyx_self, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst, float __pyx_v_delta, bool __pyx_v_push_weights, bool __pyx_v_push_labels, bool __pyx_v_remove_common_affix, bool __pyx_v_remove_total_weight, bool __pyx_v_to_final) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  struct __pyx_opt_args_9pywrapfst_push __pyx_t_2;\n  __Pyx_RefNannySetupContext(\"push\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_2.__pyx_n = 6;\n  __pyx_t_2.delta = __pyx_v_delta;\n  __pyx_t_2.push_weights = __pyx_v_push_weights;\n  __pyx_t_2.push_labels = __pyx_v_push_labels;\n  __pyx_t_2.remove_common_affix = __pyx_v_remove_common_affix;\n  __pyx_t_2.remove_total_weight = __pyx_v_remove_total_weight;\n  __pyx_t_2.to_final = __pyx_v_to_final;\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst_push(__pyx_v_ifst, 0, &__pyx_t_2)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3686, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.push\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":3740\n * \n * \n * cpdef bool randequivalent(_Fst ifst1,             # <<<<<<<<<<<<<<\n *                           _Fst ifst2,\n *                           int32 npath=1,\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_43randequivalent(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic bool __pyx_f_9pywrapfst_randequivalent(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst1, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst2, CYTHON_UNUSED int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_randequivalent *__pyx_optional_args) {\n  __pyx_t_10basictypes_int32 __pyx_v_npath = ((__pyx_t_10basictypes_int32)1);\n  float __pyx_v_delta = __pyx_k__79;\n  time_t __pyx_v_seed = ((time_t)0);\n  PyObject *__pyx_v_select = ((PyObject *)__pyx_n_b_uniform);\n  __pyx_t_10basictypes_int32 __pyx_v_max_length = __pyx_k__80;\n  enum fst::script::RandArcSelection __pyx_v_ras;\n  std::unique_ptr<fst::RandGenOptions<enum fst::script::RandArcSelection> >  __pyx_v_opts;\n  bool __pyx_r;\n  __Pyx_RefNannyDeclarations\n  std::string __pyx_t_1;\n  enum fst::script::RandArcSelection __pyx_t_2;\n  int __pyx_t_3;\n  __Pyx_RefNannySetupContext(\"randequivalent\", 0);\n  if (__pyx_optional_args) {\n    if (__pyx_optional_args->__pyx_n > 0) {\n      __pyx_v_npath = __pyx_optional_args->npath;\n      if (__pyx_optional_args->__pyx_n > 1) {\n        __pyx_v_delta = __pyx_optional_args->delta;\n        if (__pyx_optional_args->__pyx_n > 2) {\n          __pyx_v_seed = __pyx_optional_args->seed;\n          if (__pyx_optional_args->__pyx_n > 3) {\n            __pyx_v_select = __pyx_optional_args->select;\n            if (__pyx_optional_args->__pyx_n > 4) {\n              __pyx_v_max_length = __pyx_optional_args->max_length;\n            }\n          }\n        }\n      }\n    }\n  }\n\n  /* \"pywrapfst.pyx\":3775\n *   See also: `equal`, `equivalent`, `isomorphic`, `randgen`.\n *   \"\"\"\n *   cdef fst.RandArcSelection ras = _get_rand_arc_selection(tostring(select))             # <<<<<<<<<<<<<<\n *   cdef unique_ptr[fst.RandGenOptions[fst.RandArcSelection]] opts\n *   # The three trailing options will be ignored by RandEquivalent.\n */\n  __pyx_t_1 = __pyx_f_9pywrapfst_tostring(__pyx_v_select, NULL); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 3775, __pyx_L1_error)\n  __pyx_t_2 = __pyx_f_9pywrapfst__get_rand_arc_selection(__pyx_t_1); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 3775, __pyx_L1_error)\n  __pyx_v_ras = __pyx_t_2;\n\n  /* \"pywrapfst.pyx\":3778\n *   cdef unique_ptr[fst.RandGenOptions[fst.RandArcSelection]] opts\n *   # The three trailing options will be ignored by RandEquivalent.\n *   opts.reset(new fst.RandGenOptions[fst.RandArcSelection](ras, max_length,             # <<<<<<<<<<<<<<\n *                                                           1, False, False))\n *   if seed == 0:\n */\n  __pyx_v_opts.reset(new fst::RandGenOptions<enum fst::script::RandArcSelection> (__pyx_v_ras, __pyx_v_max_length, 1, 0, 0));\n\n  /* \"pywrapfst.pyx\":3780\n *   opts.reset(new fst.RandGenOptions[fst.RandArcSelection](ras, max_length,\n *                                                           1, False, False))\n *   if seed == 0:             # <<<<<<<<<<<<<<\n *     seed = time(NULL) + getpid()\n *   return fst.RandEquivalent(deref(ifst1._fst), deref(ifst2._fst), npath, delta,\n */\n  __pyx_t_3 = ((__pyx_v_seed == 0) != 0);\n  if (__pyx_t_3) {\n\n    /* \"pywrapfst.pyx\":3781\n *                                                           1, False, False))\n *   if seed == 0:\n *     seed = time(NULL) + getpid()             # <<<<<<<<<<<<<<\n *   return fst.RandEquivalent(deref(ifst1._fst), deref(ifst2._fst), npath, delta,\n *                            seed, deref(opts))\n */\n    __pyx_v_seed = (time(NULL) + getpid());\n\n    /* \"pywrapfst.pyx\":3780\n *   opts.reset(new fst.RandGenOptions[fst.RandArcSelection](ras, max_length,\n *                                                           1, False, False))\n *   if seed == 0:             # <<<<<<<<<<<<<<\n *     seed = time(NULL) + getpid()\n *   return fst.RandEquivalent(deref(ifst1._fst), deref(ifst2._fst), npath, delta,\n */\n  }\n\n  /* \"pywrapfst.pyx\":3782\n *   if seed == 0:\n *     seed = time(NULL) + getpid()\n *   return fst.RandEquivalent(deref(ifst1._fst), deref(ifst2._fst), npath, delta,             # <<<<<<<<<<<<<<\n *                            seed, deref(opts))\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_ifst1) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 3782, __pyx_L1_error)\n  }\n  if (unlikely(((PyObject *)__pyx_v_ifst2) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 3782, __pyx_L1_error)\n  }\n\n  /* \"pywrapfst.pyx\":3783\n *     seed = time(NULL) + getpid()\n *   return fst.RandEquivalent(deref(ifst1._fst), deref(ifst2._fst), npath, delta,\n *                            seed, deref(opts))             # <<<<<<<<<<<<<<\n * \n * \n */\n  __pyx_r = fst::script::RandEquivalent((*__pyx_v_ifst1->_fst), (*__pyx_v_ifst2->_fst), __pyx_v_npath, __pyx_v_delta, __pyx_v_seed, (*__pyx_v_opts));\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":3740\n * \n * \n * cpdef bool randequivalent(_Fst ifst1,             # <<<<<<<<<<<<<<\n *                           _Fst ifst2,\n *                           int32 npath=1,\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"pywrapfst.randequivalent\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = -1;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_43randequivalent(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic char __pyx_doc_9pywrapfst_42randequivalent[] = \"\\n  randequivalent(ifst1, ifst2, npath=1, delta=0.0009765625, seed=0,\\n                 select=\\\"uniform\\\", max_length=2147483647)\\n\\n  Are two acceptors stochastically equivalent?\\n\\n  This operation tests whether two FSTs are equivalent by randomly generating\\n  paths alternatively in each of the two FSTs. For each randomly generated path,\\n  the algorithm computes for each of the two FSTs the sum of the weights of all\\n  the successful paths sharing the same input and output labels as the randomly\\n  generated path and checks that these two values are within `delta`.\\n\\n  Args:\\n    ifst1: The first input FST.\\n    ifst2: The second input FST.\\n    npath: The number of random paths to generate.\\n    delta: Comparison/quantization delta.\\n    seed: An optional seed value for random path generation; if zero, the\\n        current time and process ID is used.\\n    select: A string matching a known random arc selection type; one of:\\n        \\\"uniform\\\", \\\"log_prob\\\", \\\"fast_log_prob\\\".\\n    max_length: The maximum length of each random path.\\n\\n  Returns:\\n    True if the two transducers satisfy the above condition, else False.\\n\\n  See also: `equal`, `equivalent`, `isomorphic`, `randgen`.\\n  \";\nstatic PyObject *__pyx_pw_9pywrapfst_43randequivalent(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst1 = 0;\n  struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst2 = 0;\n  __pyx_t_10basictypes_int32 __pyx_v_npath;\n  float __pyx_v_delta;\n  time_t __pyx_v_seed;\n  PyObject *__pyx_v_select = 0;\n  __pyx_t_10basictypes_int32 __pyx_v_max_length;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"randequivalent (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_ifst1,&__pyx_n_s_ifst2,&__pyx_n_s_npath,&__pyx_n_s_delta,&__pyx_n_s_seed,&__pyx_n_s_select,&__pyx_n_s_max_length,0};\n    PyObject* values[7] = {0,0,0,0,0,0,0};\n    values[5] = ((PyObject *)__pyx_n_b_uniform);\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  7: values[6] = PyTuple_GET_ITEM(__pyx_args, 6);\n        CYTHON_FALLTHROUGH;\n        case  6: values[5] = PyTuple_GET_ITEM(__pyx_args, 5);\n        CYTHON_FALLTHROUGH;\n        case  5: values[4] = PyTuple_GET_ITEM(__pyx_args, 4);\n        CYTHON_FALLTHROUGH;\n        case  4: values[3] = PyTuple_GET_ITEM(__pyx_args, 3);\n        CYTHON_FALLTHROUGH;\n        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);\n        CYTHON_FALLTHROUGH;\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (likely((values[0] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_ifst1)) != 0)) kw_args--;\n        else goto __pyx_L5_argtuple_error;\n        CYTHON_FALLTHROUGH;\n        case  1:\n        if (likely((values[1] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_ifst2)) != 0)) kw_args--;\n        else {\n          __Pyx_RaiseArgtupleInvalid(\"randequivalent\", 0, 2, 7, 1); __PYX_ERR(0, 3740, __pyx_L3_error)\n        }\n        CYTHON_FALLTHROUGH;\n        case  2:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_npath);\n          if (value) { values[2] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  3:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_delta);\n          if (value) { values[3] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  4:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_seed);\n          if (value) { values[4] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  5:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_select);\n          if (value) { values[5] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  6:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_max_length);\n          if (value) { values[6] = value; kw_args--; }\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"randequivalent\") < 0)) __PYX_ERR(0, 3740, __pyx_L3_error)\n      }\n    } else {\n      switch (PyTuple_GET_SIZE(__pyx_args)) {\n        case  7: values[6] = PyTuple_GET_ITEM(__pyx_args, 6);\n        CYTHON_FALLTHROUGH;\n        case  6: values[5] = PyTuple_GET_ITEM(__pyx_args, 5);\n        CYTHON_FALLTHROUGH;\n        case  5: values[4] = PyTuple_GET_ITEM(__pyx_args, 4);\n        CYTHON_FALLTHROUGH;\n        case  4: values[3] = PyTuple_GET_ITEM(__pyx_args, 3);\n        CYTHON_FALLTHROUGH;\n        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);\n        CYTHON_FALLTHROUGH;\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n    }\n    __pyx_v_ifst1 = ((struct __pyx_obj_9pywrapfst__Fst *)values[0]);\n    __pyx_v_ifst2 = ((struct __pyx_obj_9pywrapfst__Fst *)values[1]);\n    if (values[2]) {\n      __pyx_v_npath = __Pyx_PyInt_As_int32_t(values[2]); if (unlikely((__pyx_v_npath == ((int32_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 3742, __pyx_L3_error)\n    } else {\n      __pyx_v_npath = ((__pyx_t_10basictypes_int32)1);\n    }\n    if (values[3]) {\n      __pyx_v_delta = __pyx_PyFloat_AsFloat(values[3]); if (unlikely((__pyx_v_delta == (float)-1) && PyErr_Occurred())) __PYX_ERR(0, 3743, __pyx_L3_error)\n    } else {\n      __pyx_v_delta = __pyx_k__79;\n    }\n    if (values[4]) {\n      __pyx_v_seed = __Pyx_PyInt_As_time_t(values[4]); if (unlikely((__pyx_v_seed == ((time_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 3744, __pyx_L3_error)\n    } else {\n      __pyx_v_seed = ((time_t)0);\n    }\n    __pyx_v_select = values[5];\n    if (values[6]) {\n      __pyx_v_max_length = __Pyx_PyInt_As_int32_t(values[6]); if (unlikely((__pyx_v_max_length == ((int32_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 3746, __pyx_L3_error)\n    } else {\n      __pyx_v_max_length = __pyx_k__80;\n    }\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"randequivalent\", 0, 2, 7, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 3740, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst.randequivalent\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_ifst1), __pyx_ptype_9pywrapfst__Fst, 1, \"ifst1\", 0))) __PYX_ERR(0, 3740, __pyx_L1_error)\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_ifst2), __pyx_ptype_9pywrapfst__Fst, 1, \"ifst2\", 0))) __PYX_ERR(0, 3741, __pyx_L1_error)\n  __pyx_r = __pyx_pf_9pywrapfst_42randequivalent(__pyx_self, __pyx_v_ifst1, __pyx_v_ifst2, __pyx_v_npath, __pyx_v_delta, __pyx_v_seed, __pyx_v_select, __pyx_v_max_length);\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_42randequivalent(CYTHON_UNUSED PyObject *__pyx_self, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst1, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst2, __pyx_t_10basictypes_int32 __pyx_v_npath, float __pyx_v_delta, time_t __pyx_v_seed, PyObject *__pyx_v_select, __pyx_t_10basictypes_int32 __pyx_v_max_length) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  bool __pyx_t_1;\n  struct __pyx_opt_args_9pywrapfst_randequivalent __pyx_t_2;\n  PyObject *__pyx_t_3 = NULL;\n  __Pyx_RefNannySetupContext(\"randequivalent\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_2.__pyx_n = 5;\n  __pyx_t_2.npath = __pyx_v_npath;\n  __pyx_t_2.delta = __pyx_v_delta;\n  __pyx_t_2.seed = __pyx_v_seed;\n  __pyx_t_2.select = __pyx_v_select;\n  __pyx_t_2.max_length = __pyx_v_max_length;\n  __pyx_t_1 = __pyx_f_9pywrapfst_randequivalent(__pyx_v_ifst1, __pyx_v_ifst2, 0, &__pyx_t_2); if (unlikely(__pyx_t_1 == ((bool)-1) && PyErr_Occurred())) __PYX_ERR(0, 3740, __pyx_L1_error)\n  __pyx_t_3 = __Pyx_PyBool_FromLong(__pyx_t_1); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 3740, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_3);\n  __pyx_r = __pyx_t_3;\n  __pyx_t_3 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_AddTraceback(\"pywrapfst.randequivalent\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":3786\n * \n * \n * cpdef _MutableFst randgen(_Fst ifst,             # <<<<<<<<<<<<<<\n *                           int32 npath=1,\n *                           time_t seed=0,\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_45randgen(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic struct __pyx_obj_9pywrapfst__MutableFst *__pyx_f_9pywrapfst_randgen(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst, CYTHON_UNUSED int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_randgen *__pyx_optional_args) {\n  __pyx_t_10basictypes_int32 __pyx_v_npath = ((__pyx_t_10basictypes_int32)1);\n  time_t __pyx_v_seed = ((time_t)0);\n  PyObject *__pyx_v_select = ((PyObject *)__pyx_n_b_uniform);\n  __pyx_t_10basictypes_int32 __pyx_v_max_length = __pyx_k__81;\n\n  /* \"pywrapfst.pyx\":3791\n *                           select=b\"uniform\",\n *                           int32 max_length=INT32_MAX,\n *                           bool weighted=False,             # <<<<<<<<<<<<<<\n *                           bool remove_total_weight=False):\n *   \"\"\"\n */\n  bool __pyx_v_weighted = ((bool)0);\n\n  /* \"pywrapfst.pyx\":3792\n *                           int32 max_length=INT32_MAX,\n *                           bool weighted=False,\n *                           bool remove_total_weight=False):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   randgen(ifst, npath=1, seed=0, select=\"uniform\", max_length=2147483647,\n */\n  bool __pyx_v_remove_total_weight = ((bool)0);\n  enum fst::script::RandArcSelection __pyx_v_ras;\n  std::unique_ptr<fst::RandGenOptions<enum fst::script::RandArcSelection> >  __pyx_v_opts;\n  std::unique_ptr<fst::script::VectorFstClass>  __pyx_v_tfst;\n  struct __pyx_obj_9pywrapfst__MutableFst *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  std::string __pyx_t_1;\n  enum fst::script::RandArcSelection __pyx_t_2;\n  int __pyx_t_3;\n  PyObject *__pyx_t_4 = NULL;\n  __Pyx_RefNannySetupContext(\"randgen\", 0);\n  if (__pyx_optional_args) {\n    if (__pyx_optional_args->__pyx_n > 0) {\n      __pyx_v_npath = __pyx_optional_args->npath;\n      if (__pyx_optional_args->__pyx_n > 1) {\n        __pyx_v_seed = __pyx_optional_args->seed;\n        if (__pyx_optional_args->__pyx_n > 2) {\n          __pyx_v_select = __pyx_optional_args->select;\n          if (__pyx_optional_args->__pyx_n > 3) {\n            __pyx_v_max_length = __pyx_optional_args->max_length;\n            if (__pyx_optional_args->__pyx_n > 4) {\n              __pyx_v_weighted = __pyx_optional_args->weighted;\n              if (__pyx_optional_args->__pyx_n > 5) {\n                __pyx_v_remove_total_weight = __pyx_optional_args->remove_total_weight;\n              }\n            }\n          }\n        }\n      }\n    }\n  }\n\n  /* \"pywrapfst.pyx\":3824\n *   See also: `randequivalent`.\n *   \"\"\"\n *   cdef fst.RandArcSelection ras = _get_rand_arc_selection(tostring(select))             # <<<<<<<<<<<<<<\n *   cdef unique_ptr[fst.RandGenOptions[fst.RandArcSelection]] opts\n *   opts.reset(new fst.RandGenOptions[fst.RandArcSelection](ras, max_length,\n */\n  __pyx_t_1 = __pyx_f_9pywrapfst_tostring(__pyx_v_select, NULL); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 3824, __pyx_L1_error)\n  __pyx_t_2 = __pyx_f_9pywrapfst__get_rand_arc_selection(__pyx_t_1); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 3824, __pyx_L1_error)\n  __pyx_v_ras = __pyx_t_2;\n\n  /* \"pywrapfst.pyx\":3826\n *   cdef fst.RandArcSelection ras = _get_rand_arc_selection(tostring(select))\n *   cdef unique_ptr[fst.RandGenOptions[fst.RandArcSelection]] opts\n *   opts.reset(new fst.RandGenOptions[fst.RandArcSelection](ras, max_length,             # <<<<<<<<<<<<<<\n *                                                           npath, weighted,\n *                                                           remove_total_weight))\n */\n  __pyx_v_opts.reset(new fst::RandGenOptions<enum fst::script::RandArcSelection> (__pyx_v_ras, __pyx_v_max_length, __pyx_v_npath, __pyx_v_weighted, __pyx_v_remove_total_weight));\n\n  /* \"pywrapfst.pyx\":3830\n *                                                           remove_total_weight))\n *   cdef unique_ptr[fst.VectorFstClass] tfst\n *   tfst.reset(new fst.VectorFstClass(ifst.arc_type()))             # <<<<<<<<<<<<<<\n *   if seed == 0:\n *     seed = time(NULL) + getpid()\n */\n  if (unlikely(((PyObject *)__pyx_v_ifst) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"arc_type\");\n    __PYX_ERR(0, 3830, __pyx_L1_error)\n  }\n  __pyx_v_tfst.reset(new fst::script::VectorFstClass(((struct __pyx_vtabstruct_9pywrapfst__Fst *)__pyx_v_ifst->__pyx_vtab)->arc_type(__pyx_v_ifst, 0)));\n\n  /* \"pywrapfst.pyx\":3831\n *   cdef unique_ptr[fst.VectorFstClass] tfst\n *   tfst.reset(new fst.VectorFstClass(ifst.arc_type()))\n *   if seed == 0:             # <<<<<<<<<<<<<<\n *     seed = time(NULL) + getpid()\n *   fst.RandGen(deref(ifst._fst), tfst.get(), seed, deref(opts))\n */\n  __pyx_t_3 = ((__pyx_v_seed == 0) != 0);\n  if (__pyx_t_3) {\n\n    /* \"pywrapfst.pyx\":3832\n *   tfst.reset(new fst.VectorFstClass(ifst.arc_type()))\n *   if seed == 0:\n *     seed = time(NULL) + getpid()             # <<<<<<<<<<<<<<\n *   fst.RandGen(deref(ifst._fst), tfst.get(), seed, deref(opts))\n *   return _init_MutableFst(tfst.release())\n */\n    __pyx_v_seed = (time(NULL) + getpid());\n\n    /* \"pywrapfst.pyx\":3831\n *   cdef unique_ptr[fst.VectorFstClass] tfst\n *   tfst.reset(new fst.VectorFstClass(ifst.arc_type()))\n *   if seed == 0:             # <<<<<<<<<<<<<<\n *     seed = time(NULL) + getpid()\n *   fst.RandGen(deref(ifst._fst), tfst.get(), seed, deref(opts))\n */\n  }\n\n  /* \"pywrapfst.pyx\":3833\n *   if seed == 0:\n *     seed = time(NULL) + getpid()\n *   fst.RandGen(deref(ifst._fst), tfst.get(), seed, deref(opts))             # <<<<<<<<<<<<<<\n *   return _init_MutableFst(tfst.release())\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_ifst) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 3833, __pyx_L1_error)\n  }\n  fst::script::RandGen((*__pyx_v_ifst->_fst), __pyx_v_tfst.get(), __pyx_v_seed, (*__pyx_v_opts));\n\n  /* \"pywrapfst.pyx\":3834\n *     seed = time(NULL) + getpid()\n *   fst.RandGen(deref(ifst._fst), tfst.get(), seed, deref(opts))\n *   return _init_MutableFst(tfst.release())             # <<<<<<<<<<<<<<\n * \n * \n */\n  __Pyx_XDECREF(((PyObject *)__pyx_r));\n  __pyx_t_4 = ((PyObject *)__pyx_f_9pywrapfst__init_MutableFst(__pyx_v_tfst.release())); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 3834, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_4);\n  __pyx_r = ((struct __pyx_obj_9pywrapfst__MutableFst *)__pyx_t_4);\n  __pyx_t_4 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":3786\n * \n * \n * cpdef _MutableFst randgen(_Fst ifst,             # <<<<<<<<<<<<<<\n *                           int32 npath=1,\n *                           time_t seed=0,\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_AddTraceback(\"pywrapfst.randgen\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XGIVEREF((PyObject *)__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_45randgen(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic char __pyx_doc_9pywrapfst_44randgen[] = \"\\n  randgen(ifst, npath=1, seed=0, select=\\\"uniform\\\", max_length=2147483647,\\n          weight=False, remove_total_weight=False)\\n\\n  Randomly generate successful paths in an FST.\\n\\n  This operation randomly generates a set of successful paths in the input FST.\\n  This relies on a mechanism for selecting arcs, specified using the `select`\\n  argument. The default selector, \\\"uniform\\\", randomly selects a transition\\n  using a uniform distribution. The \\\"log_prob\\\" selector randomly selects a\\n  transition w.r.t. the weights treated as negative log probabilities after\\n  normalizing for the total weight leaving the state. In all cases, finality is\\n  treated as a transition to a super-final state.\\n\\n  Args:\\n    ifst: The input FST.\\n    npath: The number of random paths to generate.\\n    seed: An optional seed value for random path generation; if zero, the\\n        current time and process ID is used.\\n    select: A string matching a known random arc selection type; one of:\\n        \\\"uniform\\\", \\\"log_prob\\\", \\\"fast_log_prob\\\".\\n    max_length: The maximum length of each random path.\\n    weighted: Should the output be weighted by path count?\\n    remove_total_weight: Should the total weight be removed (ignored when\\n        `weighted` is False)?\\n\\n  Returns:\\n    An FST containing one or more random paths.\\n\\n  See also: `randequivalent`.\\n  \";\nstatic PyObject *__pyx_pw_9pywrapfst_45randgen(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst = 0;\n  __pyx_t_10basictypes_int32 __pyx_v_npath;\n  time_t __pyx_v_seed;\n  PyObject *__pyx_v_select = 0;\n  __pyx_t_10basictypes_int32 __pyx_v_max_length;\n  bool __pyx_v_weighted;\n  bool __pyx_v_remove_total_weight;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"randgen (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_ifst,&__pyx_n_s_npath,&__pyx_n_s_seed,&__pyx_n_s_select,&__pyx_n_s_max_length,&__pyx_n_s_weighted,&__pyx_n_s_remove_total_weight,0};\n    PyObject* values[7] = {0,0,0,0,0,0,0};\n    values[3] = ((PyObject *)__pyx_n_b_uniform);\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  7: values[6] = PyTuple_GET_ITEM(__pyx_args, 6);\n        CYTHON_FALLTHROUGH;\n        case  6: values[5] = PyTuple_GET_ITEM(__pyx_args, 5);\n        CYTHON_FALLTHROUGH;\n        case  5: values[4] = PyTuple_GET_ITEM(__pyx_args, 4);\n        CYTHON_FALLTHROUGH;\n        case  4: values[3] = PyTuple_GET_ITEM(__pyx_args, 3);\n        CYTHON_FALLTHROUGH;\n        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);\n        CYTHON_FALLTHROUGH;\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (likely((values[0] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_ifst)) != 0)) kw_args--;\n        else goto __pyx_L5_argtuple_error;\n        CYTHON_FALLTHROUGH;\n        case  1:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_npath);\n          if (value) { values[1] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  2:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_seed);\n          if (value) { values[2] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  3:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_select);\n          if (value) { values[3] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  4:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_max_length);\n          if (value) { values[4] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  5:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_weighted);\n          if (value) { values[5] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  6:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_remove_total_weight);\n          if (value) { values[6] = value; kw_args--; }\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"randgen\") < 0)) __PYX_ERR(0, 3786, __pyx_L3_error)\n      }\n    } else {\n      switch (PyTuple_GET_SIZE(__pyx_args)) {\n        case  7: values[6] = PyTuple_GET_ITEM(__pyx_args, 6);\n        CYTHON_FALLTHROUGH;\n        case  6: values[5] = PyTuple_GET_ITEM(__pyx_args, 5);\n        CYTHON_FALLTHROUGH;\n        case  5: values[4] = PyTuple_GET_ITEM(__pyx_args, 4);\n        CYTHON_FALLTHROUGH;\n        case  4: values[3] = PyTuple_GET_ITEM(__pyx_args, 3);\n        CYTHON_FALLTHROUGH;\n        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);\n        CYTHON_FALLTHROUGH;\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n    }\n    __pyx_v_ifst = ((struct __pyx_obj_9pywrapfst__Fst *)values[0]);\n    if (values[1]) {\n      __pyx_v_npath = __Pyx_PyInt_As_int32_t(values[1]); if (unlikely((__pyx_v_npath == ((int32_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 3787, __pyx_L3_error)\n    } else {\n      __pyx_v_npath = ((__pyx_t_10basictypes_int32)1);\n    }\n    if (values[2]) {\n      __pyx_v_seed = __Pyx_PyInt_As_time_t(values[2]); if (unlikely((__pyx_v_seed == ((time_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 3788, __pyx_L3_error)\n    } else {\n      __pyx_v_seed = ((time_t)0);\n    }\n    __pyx_v_select = values[3];\n    if (values[4]) {\n      __pyx_v_max_length = __Pyx_PyInt_As_int32_t(values[4]); if (unlikely((__pyx_v_max_length == ((int32_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 3790, __pyx_L3_error)\n    } else {\n      __pyx_v_max_length = __pyx_k__81;\n    }\n    if (values[5]) {\n      __pyx_v_weighted = __Pyx_PyObject_IsTrue(values[5]); if (unlikely((__pyx_v_weighted == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 3791, __pyx_L3_error)\n    } else {\n\n      /* \"pywrapfst.pyx\":3791\n *                           select=b\"uniform\",\n *                           int32 max_length=INT32_MAX,\n *                           bool weighted=False,             # <<<<<<<<<<<<<<\n *                           bool remove_total_weight=False):\n *   \"\"\"\n */\n      __pyx_v_weighted = ((bool)0);\n    }\n    if (values[6]) {\n      __pyx_v_remove_total_weight = __Pyx_PyObject_IsTrue(values[6]); if (unlikely((__pyx_v_remove_total_weight == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 3792, __pyx_L3_error)\n    } else {\n\n      /* \"pywrapfst.pyx\":3792\n *                           int32 max_length=INT32_MAX,\n *                           bool weighted=False,\n *                           bool remove_total_weight=False):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   randgen(ifst, npath=1, seed=0, select=\"uniform\", max_length=2147483647,\n */\n      __pyx_v_remove_total_weight = ((bool)0);\n    }\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"randgen\", 0, 1, 7, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 3786, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst.randgen\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_ifst), __pyx_ptype_9pywrapfst__Fst, 1, \"ifst\", 0))) __PYX_ERR(0, 3786, __pyx_L1_error)\n  __pyx_r = __pyx_pf_9pywrapfst_44randgen(__pyx_self, __pyx_v_ifst, __pyx_v_npath, __pyx_v_seed, __pyx_v_select, __pyx_v_max_length, __pyx_v_weighted, __pyx_v_remove_total_weight);\n\n  /* \"pywrapfst.pyx\":3786\n * \n * \n * cpdef _MutableFst randgen(_Fst ifst,             # <<<<<<<<<<<<<<\n *                           int32 npath=1,\n *                           time_t seed=0,\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_44randgen(CYTHON_UNUSED PyObject *__pyx_self, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst, __pyx_t_10basictypes_int32 __pyx_v_npath, time_t __pyx_v_seed, PyObject *__pyx_v_select, __pyx_t_10basictypes_int32 __pyx_v_max_length, bool __pyx_v_weighted, bool __pyx_v_remove_total_weight) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  struct __pyx_opt_args_9pywrapfst_randgen __pyx_t_2;\n  __Pyx_RefNannySetupContext(\"randgen\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_2.__pyx_n = 6;\n  __pyx_t_2.npath = __pyx_v_npath;\n  __pyx_t_2.seed = __pyx_v_seed;\n  __pyx_t_2.select = __pyx_v_select;\n  __pyx_t_2.max_length = __pyx_v_max_length;\n  __pyx_t_2.remove_total_weight = __pyx_v_weighted;\n  __pyx_t_2.weighted = __pyx_v_remove_total_weight;\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst_randgen(__pyx_v_ifst, 0, &__pyx_t_2)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3786, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.randgen\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":3837\n * \n * \n * cpdef _MutableFst replace(pairs,             # <<<<<<<<<<<<<<\n *                           call_arc_labeling=b\"input\",\n *                           return_arc_labeling=b\"neither\",\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_47replace(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic struct __pyx_obj_9pywrapfst__MutableFst *__pyx_f_9pywrapfst_replace(PyObject *__pyx_v_pairs, CYTHON_UNUSED int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_replace *__pyx_optional_args) {\n  PyObject *__pyx_v_call_arc_labeling = ((PyObject *)__pyx_n_b_input);\n  PyObject *__pyx_v_return_arc_labeling = ((PyObject *)__pyx_n_b_neither);\n\n  /* \"pywrapfst.pyx\":3840\n *                           call_arc_labeling=b\"input\",\n *                           return_arc_labeling=b\"neither\",\n *                           bool epsilon_on_replace=False,             # <<<<<<<<<<<<<<\n *                           int64 return_label=0):\n *   \"\"\"\n */\n  bool __pyx_v_epsilon_on_replace = ((bool)0);\n  __pyx_t_10basictypes_int64 __pyx_v_return_label = ((__pyx_t_10basictypes_int64)0);\n  std::vector<__pyx_t_3fst_LabelFstClassPair>  __pyx_v__pairs;\n  __pyx_t_10basictypes_int64 __pyx_v_root_label;\n  __pyx_t_10basictypes_int64 __pyx_v_label;\n  struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst = 0;\n  PyObject *__pyx_v_it = NULL;\n  std::unique_ptr<fst::script::VectorFstClass>  __pyx_v_tfst;\n  enum fst::ReplaceLabelType __pyx_v_cal;\n  enum fst::ReplaceLabelType __pyx_v_ral;\n  std::unique_ptr<fst::script::ReplaceOptions>  __pyx_v_opts;\n  struct __pyx_obj_9pywrapfst__MutableFst *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *(*__pyx_t_5)(PyObject *);\n  __pyx_t_10basictypes_int64 __pyx_t_6;\n  __pyx_t_3fst_LabelFstClassPair __pyx_t_7;\n  Py_ssize_t __pyx_t_8;\n  PyObject *(*__pyx_t_9)(PyObject *);\n  PyObject *__pyx_t_10 = NULL;\n  std::string __pyx_t_11;\n  enum fst::ReplaceLabelType __pyx_t_12;\n  __Pyx_RefNannySetupContext(\"replace\", 0);\n  if (__pyx_optional_args) {\n    if (__pyx_optional_args->__pyx_n > 0) {\n      __pyx_v_call_arc_labeling = __pyx_optional_args->call_arc_labeling;\n      if (__pyx_optional_args->__pyx_n > 1) {\n        __pyx_v_return_arc_labeling = __pyx_optional_args->return_arc_labeling;\n        if (__pyx_optional_args->__pyx_n > 2) {\n          __pyx_v_epsilon_on_replace = __pyx_optional_args->epsilon_on_replace;\n          if (__pyx_optional_args->__pyx_n > 3) {\n            __pyx_v_return_label = __pyx_optional_args->return_label;\n          }\n        }\n      }\n    }\n  }\n\n  /* \"pywrapfst.pyx\":3882\n *   cdef int64 label\n *   cdef _Fst ifst\n *   it = iter(pairs)             # <<<<<<<<<<<<<<\n *   (root_label, ifst) = next(it)\n *   _pairs.push_back(fst.LabelFstClassPair(root_label, ifst._fst.get()))\n */\n  __pyx_t_1 = PyObject_GetIter(__pyx_v_pairs); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3882, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_v_it = __pyx_t_1;\n  __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":3883\n *   cdef _Fst ifst\n *   it = iter(pairs)\n *   (root_label, ifst) = next(it)             # <<<<<<<<<<<<<<\n *   _pairs.push_back(fst.LabelFstClassPair(root_label, ifst._fst.get()))\n *   cdef unique_ptr[fst.VectorFstClass] tfst\n */\n  __pyx_t_1 = __Pyx_PyIter_Next(__pyx_v_it); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3883, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if ((likely(PyTuple_CheckExact(__pyx_t_1))) || (PyList_CheckExact(__pyx_t_1))) {\n    PyObject* sequence = __pyx_t_1;\n    #if !CYTHON_COMPILING_IN_PYPY\n    Py_ssize_t size = Py_SIZE(sequence);\n    #else\n    Py_ssize_t size = PySequence_Size(sequence);\n    #endif\n    if (unlikely(size != 2)) {\n      if (size > 2) __Pyx_RaiseTooManyValuesError(2);\n      else if (size >= 0) __Pyx_RaiseNeedMoreValuesError(size);\n      __PYX_ERR(0, 3883, __pyx_L1_error)\n    }\n    #if CYTHON_ASSUME_SAFE_MACROS && !CYTHON_AVOID_BORROWED_REFS\n    if (likely(PyTuple_CheckExact(sequence))) {\n      __pyx_t_2 = PyTuple_GET_ITEM(sequence, 0); \n      __pyx_t_3 = PyTuple_GET_ITEM(sequence, 1); \n    } else {\n      __pyx_t_2 = PyList_GET_ITEM(sequence, 0); \n      __pyx_t_3 = PyList_GET_ITEM(sequence, 1); \n    }\n    __Pyx_INCREF(__pyx_t_2);\n    __Pyx_INCREF(__pyx_t_3);\n    #else\n    __pyx_t_2 = PySequence_ITEM(sequence, 0); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3883, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_2);\n    __pyx_t_3 = PySequence_ITEM(sequence, 1); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 3883, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_3);\n    #endif\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  } else {\n    Py_ssize_t index = -1;\n    __pyx_t_4 = PyObject_GetIter(__pyx_t_1); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 3883, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_4);\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n    __pyx_t_5 = Py_TYPE(__pyx_t_4)->tp_iternext;\n    index = 0; __pyx_t_2 = __pyx_t_5(__pyx_t_4); if (unlikely(!__pyx_t_2)) goto __pyx_L3_unpacking_failed;\n    __Pyx_GOTREF(__pyx_t_2);\n    index = 1; __pyx_t_3 = __pyx_t_5(__pyx_t_4); if (unlikely(!__pyx_t_3)) goto __pyx_L3_unpacking_failed;\n    __Pyx_GOTREF(__pyx_t_3);\n    if (__Pyx_IternextUnpackEndCheck(__pyx_t_5(__pyx_t_4), 2) < 0) __PYX_ERR(0, 3883, __pyx_L1_error)\n    __pyx_t_5 = NULL;\n    __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n    goto __pyx_L4_unpacking_done;\n    __pyx_L3_unpacking_failed:;\n    __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n    __pyx_t_5 = NULL;\n    if (__Pyx_IterFinish() == 0) __Pyx_RaiseNeedMoreValuesError(index);\n    __PYX_ERR(0, 3883, __pyx_L1_error)\n    __pyx_L4_unpacking_done:;\n  }\n  __pyx_t_6 = __Pyx_PyInt_As_int64_t(__pyx_t_2); if (unlikely((__pyx_t_6 == ((int64_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 3883, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n  if (!(likely(((__pyx_t_3) == Py_None) || likely(__Pyx_TypeTest(__pyx_t_3, __pyx_ptype_9pywrapfst__Fst))))) __PYX_ERR(0, 3883, __pyx_L1_error)\n  __pyx_v_root_label = __pyx_t_6;\n  __pyx_v_ifst = ((struct __pyx_obj_9pywrapfst__Fst *)__pyx_t_3);\n  __pyx_t_3 = 0;\n\n  /* \"pywrapfst.pyx\":3884\n *   it = iter(pairs)\n *   (root_label, ifst) = next(it)\n *   _pairs.push_back(fst.LabelFstClassPair(root_label, ifst._fst.get()))             # <<<<<<<<<<<<<<\n *   cdef unique_ptr[fst.VectorFstClass] tfst\n *   tfst.reset(new fst.VectorFstClass(ifst.arc_type()))\n */\n  if (unlikely(((PyObject *)__pyx_v_ifst) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 3884, __pyx_L1_error)\n  }\n  try {\n    __pyx_t_7 = __pyx_t_3fst_LabelFstClassPair(__pyx_v_root_label, __pyx_v_ifst->_fst.get());\n  } catch(...) {\n    __Pyx_CppExn2PyErr();\n    __PYX_ERR(0, 3884, __pyx_L1_error)\n  }\n  try {\n    __pyx_v__pairs.push_back(__pyx_t_7);\n  } catch(...) {\n    __Pyx_CppExn2PyErr();\n    __PYX_ERR(0, 3884, __pyx_L1_error)\n  }\n\n  /* \"pywrapfst.pyx\":3886\n *   _pairs.push_back(fst.LabelFstClassPair(root_label, ifst._fst.get()))\n *   cdef unique_ptr[fst.VectorFstClass] tfst\n *   tfst.reset(new fst.VectorFstClass(ifst.arc_type()))             # <<<<<<<<<<<<<<\n *   for (label, ifst) in it:\n *     _pairs.push_back(fst.LabelFstClassPair(label, ifst._fst.get()))\n */\n  if (unlikely(((PyObject *)__pyx_v_ifst) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"arc_type\");\n    __PYX_ERR(0, 3886, __pyx_L1_error)\n  }\n  __pyx_v_tfst.reset(new fst::script::VectorFstClass(((struct __pyx_vtabstruct_9pywrapfst__Fst *)__pyx_v_ifst->__pyx_vtab)->arc_type(__pyx_v_ifst, 0)));\n\n  /* \"pywrapfst.pyx\":3887\n *   cdef unique_ptr[fst.VectorFstClass] tfst\n *   tfst.reset(new fst.VectorFstClass(ifst.arc_type()))\n *   for (label, ifst) in it:             # <<<<<<<<<<<<<<\n *     _pairs.push_back(fst.LabelFstClassPair(label, ifst._fst.get()))\n *   cdef fst.ReplaceLabelType cal = _get_replace_label_type(\n */\n  if (likely(PyList_CheckExact(__pyx_v_it)) || PyTuple_CheckExact(__pyx_v_it)) {\n    __pyx_t_1 = __pyx_v_it; __Pyx_INCREF(__pyx_t_1); __pyx_t_8 = 0;\n    __pyx_t_9 = NULL;\n  } else {\n    __pyx_t_8 = -1; __pyx_t_1 = PyObject_GetIter(__pyx_v_it); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3887, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    __pyx_t_9 = Py_TYPE(__pyx_t_1)->tp_iternext; if (unlikely(!__pyx_t_9)) __PYX_ERR(0, 3887, __pyx_L1_error)\n  }\n  for (;;) {\n    if (likely(!__pyx_t_9)) {\n      if (likely(PyList_CheckExact(__pyx_t_1))) {\n        if (__pyx_t_8 >= PyList_GET_SIZE(__pyx_t_1)) break;\n        #if CYTHON_ASSUME_SAFE_MACROS && !CYTHON_AVOID_BORROWED_REFS\n        __pyx_t_3 = PyList_GET_ITEM(__pyx_t_1, __pyx_t_8); __Pyx_INCREF(__pyx_t_3); __pyx_t_8++; if (unlikely(0 < 0)) __PYX_ERR(0, 3887, __pyx_L1_error)\n        #else\n        __pyx_t_3 = PySequence_ITEM(__pyx_t_1, __pyx_t_8); __pyx_t_8++; if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 3887, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_3);\n        #endif\n      } else {\n        if (__pyx_t_8 >= PyTuple_GET_SIZE(__pyx_t_1)) break;\n        #if CYTHON_ASSUME_SAFE_MACROS && !CYTHON_AVOID_BORROWED_REFS\n        __pyx_t_3 = PyTuple_GET_ITEM(__pyx_t_1, __pyx_t_8); __Pyx_INCREF(__pyx_t_3); __pyx_t_8++; if (unlikely(0 < 0)) __PYX_ERR(0, 3887, __pyx_L1_error)\n        #else\n        __pyx_t_3 = PySequence_ITEM(__pyx_t_1, __pyx_t_8); __pyx_t_8++; if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 3887, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_3);\n        #endif\n      }\n    } else {\n      __pyx_t_3 = __pyx_t_9(__pyx_t_1);\n      if (unlikely(!__pyx_t_3)) {\n        PyObject* exc_type = PyErr_Occurred();\n        if (exc_type) {\n          if (likely(__Pyx_PyErr_GivenExceptionMatches(exc_type, PyExc_StopIteration))) PyErr_Clear();\n          else __PYX_ERR(0, 3887, __pyx_L1_error)\n        }\n        break;\n      }\n      __Pyx_GOTREF(__pyx_t_3);\n    }\n    if ((likely(PyTuple_CheckExact(__pyx_t_3))) || (PyList_CheckExact(__pyx_t_3))) {\n      PyObject* sequence = __pyx_t_3;\n      #if !CYTHON_COMPILING_IN_PYPY\n      Py_ssize_t size = Py_SIZE(sequence);\n      #else\n      Py_ssize_t size = PySequence_Size(sequence);\n      #endif\n      if (unlikely(size != 2)) {\n        if (size > 2) __Pyx_RaiseTooManyValuesError(2);\n        else if (size >= 0) __Pyx_RaiseNeedMoreValuesError(size);\n        __PYX_ERR(0, 3887, __pyx_L1_error)\n      }\n      #if CYTHON_ASSUME_SAFE_MACROS && !CYTHON_AVOID_BORROWED_REFS\n      if (likely(PyTuple_CheckExact(sequence))) {\n        __pyx_t_2 = PyTuple_GET_ITEM(sequence, 0); \n        __pyx_t_4 = PyTuple_GET_ITEM(sequence, 1); \n      } else {\n        __pyx_t_2 = PyList_GET_ITEM(sequence, 0); \n        __pyx_t_4 = PyList_GET_ITEM(sequence, 1); \n      }\n      __Pyx_INCREF(__pyx_t_2);\n      __Pyx_INCREF(__pyx_t_4);\n      #else\n      __pyx_t_2 = PySequence_ITEM(sequence, 0); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3887, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_2);\n      __pyx_t_4 = PySequence_ITEM(sequence, 1); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 3887, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_4);\n      #endif\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    } else {\n      Py_ssize_t index = -1;\n      __pyx_t_10 = PyObject_GetIter(__pyx_t_3); if (unlikely(!__pyx_t_10)) __PYX_ERR(0, 3887, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_10);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __pyx_t_5 = Py_TYPE(__pyx_t_10)->tp_iternext;\n      index = 0; __pyx_t_2 = __pyx_t_5(__pyx_t_10); if (unlikely(!__pyx_t_2)) goto __pyx_L7_unpacking_failed;\n      __Pyx_GOTREF(__pyx_t_2);\n      index = 1; __pyx_t_4 = __pyx_t_5(__pyx_t_10); if (unlikely(!__pyx_t_4)) goto __pyx_L7_unpacking_failed;\n      __Pyx_GOTREF(__pyx_t_4);\n      if (__Pyx_IternextUnpackEndCheck(__pyx_t_5(__pyx_t_10), 2) < 0) __PYX_ERR(0, 3887, __pyx_L1_error)\n      __pyx_t_5 = NULL;\n      __Pyx_DECREF(__pyx_t_10); __pyx_t_10 = 0;\n      goto __pyx_L8_unpacking_done;\n      __pyx_L7_unpacking_failed:;\n      __Pyx_DECREF(__pyx_t_10); __pyx_t_10 = 0;\n      __pyx_t_5 = NULL;\n      if (__Pyx_IterFinish() == 0) __Pyx_RaiseNeedMoreValuesError(index);\n      __PYX_ERR(0, 3887, __pyx_L1_error)\n      __pyx_L8_unpacking_done:;\n    }\n    __pyx_t_6 = __Pyx_PyInt_As_int64_t(__pyx_t_2); if (unlikely((__pyx_t_6 == ((int64_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 3887, __pyx_L1_error)\n    __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n    if (!(likely(((__pyx_t_4) == Py_None) || likely(__Pyx_TypeTest(__pyx_t_4, __pyx_ptype_9pywrapfst__Fst))))) __PYX_ERR(0, 3887, __pyx_L1_error)\n    __pyx_v_label = __pyx_t_6;\n    __Pyx_DECREF_SET(__pyx_v_ifst, ((struct __pyx_obj_9pywrapfst__Fst *)__pyx_t_4));\n    __pyx_t_4 = 0;\n\n    /* \"pywrapfst.pyx\":3888\n *   tfst.reset(new fst.VectorFstClass(ifst.arc_type()))\n *   for (label, ifst) in it:\n *     _pairs.push_back(fst.LabelFstClassPair(label, ifst._fst.get()))             # <<<<<<<<<<<<<<\n *   cdef fst.ReplaceLabelType cal = _get_replace_label_type(\n *       tostring(call_arc_labeling), epsilon_on_replace)\n */\n    if (unlikely(((PyObject *)__pyx_v_ifst) == Py_None)) {\n      PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n      __PYX_ERR(0, 3888, __pyx_L1_error)\n    }\n    try {\n      __pyx_t_7 = __pyx_t_3fst_LabelFstClassPair(__pyx_v_label, __pyx_v_ifst->_fst.get());\n    } catch(...) {\n      __Pyx_CppExn2PyErr();\n      __PYX_ERR(0, 3888, __pyx_L1_error)\n    }\n    try {\n      __pyx_v__pairs.push_back(__pyx_t_7);\n    } catch(...) {\n      __Pyx_CppExn2PyErr();\n      __PYX_ERR(0, 3888, __pyx_L1_error)\n    }\n\n    /* \"pywrapfst.pyx\":3887\n *   cdef unique_ptr[fst.VectorFstClass] tfst\n *   tfst.reset(new fst.VectorFstClass(ifst.arc_type()))\n *   for (label, ifst) in it:             # <<<<<<<<<<<<<<\n *     _pairs.push_back(fst.LabelFstClassPair(label, ifst._fst.get()))\n *   cdef fst.ReplaceLabelType cal = _get_replace_label_type(\n */\n  }\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":3890\n *     _pairs.push_back(fst.LabelFstClassPair(label, ifst._fst.get()))\n *   cdef fst.ReplaceLabelType cal = _get_replace_label_type(\n *       tostring(call_arc_labeling), epsilon_on_replace)             # <<<<<<<<<<<<<<\n *   cdef fst.ReplaceLabelType ral = _get_replace_label_type(\n *       tostring(return_arc_labeling), epsilon_on_replace)\n */\n  __pyx_t_11 = __pyx_f_9pywrapfst_tostring(__pyx_v_call_arc_labeling, NULL); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 3890, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":3889\n *   for (label, ifst) in it:\n *     _pairs.push_back(fst.LabelFstClassPair(label, ifst._fst.get()))\n *   cdef fst.ReplaceLabelType cal = _get_replace_label_type(             # <<<<<<<<<<<<<<\n *       tostring(call_arc_labeling), epsilon_on_replace)\n *   cdef fst.ReplaceLabelType ral = _get_replace_label_type(\n */\n  __pyx_t_12 = __pyx_f_9pywrapfst__get_replace_label_type(__pyx_t_11, __pyx_v_epsilon_on_replace); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 3889, __pyx_L1_error)\n  __pyx_v_cal = __pyx_t_12;\n\n  /* \"pywrapfst.pyx\":3892\n *       tostring(call_arc_labeling), epsilon_on_replace)\n *   cdef fst.ReplaceLabelType ral = _get_replace_label_type(\n *       tostring(return_arc_labeling), epsilon_on_replace)             # <<<<<<<<<<<<<<\n *   cdef unique_ptr[fst.ReplaceOptions] opts\n *   opts.reset(new fst.ReplaceOptions(root_label, cal, ral, return_label))\n */\n  __pyx_t_11 = __pyx_f_9pywrapfst_tostring(__pyx_v_return_arc_labeling, NULL); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 3892, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":3891\n *   cdef fst.ReplaceLabelType cal = _get_replace_label_type(\n *       tostring(call_arc_labeling), epsilon_on_replace)\n *   cdef fst.ReplaceLabelType ral = _get_replace_label_type(             # <<<<<<<<<<<<<<\n *       tostring(return_arc_labeling), epsilon_on_replace)\n *   cdef unique_ptr[fst.ReplaceOptions] opts\n */\n  __pyx_t_12 = __pyx_f_9pywrapfst__get_replace_label_type(__pyx_t_11, __pyx_v_epsilon_on_replace); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 3891, __pyx_L1_error)\n  __pyx_v_ral = __pyx_t_12;\n\n  /* \"pywrapfst.pyx\":3894\n *       tostring(return_arc_labeling), epsilon_on_replace)\n *   cdef unique_ptr[fst.ReplaceOptions] opts\n *   opts.reset(new fst.ReplaceOptions(root_label, cal, ral, return_label))             # <<<<<<<<<<<<<<\n *   fst.Replace(_pairs, tfst.get(), deref(opts))\n *   return _init_MutableFst(tfst.release())\n */\n  __pyx_v_opts.reset(new fst::script::ReplaceOptions(__pyx_v_root_label, __pyx_v_cal, __pyx_v_ral, __pyx_v_return_label));\n\n  /* \"pywrapfst.pyx\":3895\n *   cdef unique_ptr[fst.ReplaceOptions] opts\n *   opts.reset(new fst.ReplaceOptions(root_label, cal, ral, return_label))\n *   fst.Replace(_pairs, tfst.get(), deref(opts))             # <<<<<<<<<<<<<<\n *   return _init_MutableFst(tfst.release())\n * \n */\n  fst::script::Replace(__pyx_v__pairs, __pyx_v_tfst.get(), (*__pyx_v_opts));\n\n  /* \"pywrapfst.pyx\":3896\n *   opts.reset(new fst.ReplaceOptions(root_label, cal, ral, return_label))\n *   fst.Replace(_pairs, tfst.get(), deref(opts))\n *   return _init_MutableFst(tfst.release())             # <<<<<<<<<<<<<<\n * \n * \n */\n  __Pyx_XDECREF(((PyObject *)__pyx_r));\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst__init_MutableFst(__pyx_v_tfst.release())); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3896, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = ((struct __pyx_obj_9pywrapfst__MutableFst *)__pyx_t_1);\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":3837\n * \n * \n * cpdef _MutableFst replace(pairs,             # <<<<<<<<<<<<<<\n *                           call_arc_labeling=b\"input\",\n *                           return_arc_labeling=b\"neither\",\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_10);\n  __Pyx_AddTraceback(\"pywrapfst.replace\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XDECREF((PyObject *)__pyx_v_ifst);\n  __Pyx_XDECREF(__pyx_v_it);\n  __Pyx_XGIVEREF((PyObject *)__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_47replace(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic char __pyx_doc_9pywrapfst_46replace[] = \"\\n  replace(pairs, call_arc_labeling=\\\"input\\\", return_arc_labeling=\\\"neither\\\",\\n          epsilon_on_replace=False, return_label=0)\\n\\n  Recursively replaces arcs in the FST with other FST(s).\\n\\n  This operation performs the dynamic replacement of arcs in one FST with\\n  another FST, allowing the definition of FSTs analogous to RTNs. It takes as\\n  input a set of pairs of a set of pairs formed by a non-terminal label and\\n  its corresponding FST, and a label identifying the root FST in that set.\\n  The resulting FST is obtained by taking the root FST and recursively replacing\\n  each arc having a nonterminal as output label by its corresponding FST. More\\n  precisely, an arc from state s to state d with (nonterminal) output label n in\\n  this FST is replaced by redirecting this \\\"call\\\" arc to the initial state of a\\n  copy F of the FST for n, and adding \\\"return\\\" arcs from each final state of F\\n  to d. Optional arguments control how the call and return arcs are labeled; by\\n  default, the only non-epsilon label is placed on the call arc.\\n\\n  Args:\\n\\n    pairs: An iterable of (nonterminal label, FST) pairs, where the former is an\\n        unsigned integer and the latter is an Fst instance.\\n    call_arc_labeling: A string indicating which call arc labels should be\\n        non-epsilon. One of: \\\"input\\\" (default), \\\"output\\\", \\\"both\\\", \\\"neither\\\".\\n        This value is set to \\\"neither\\\" if epsilon_on_replace is True.\\n    return_arc_labeling: A string indicating which return arc labels should be\\n        non-epsilon. One of: \\\"input\\\", \\\"output\\\", \\\"both\\\", \\\"neither\\\" (default).\\n        This value is set to \\\"neither\\\" if epsilon_on_replace is True.\\n    epsilon_on_replace: Should call and return arcs be epsilon arcs? If True,\\n        this effectively overrides call_arc_labeling and return_arc_labeling,\\n        setting both to \\\"neither\\\".\\n    return_label: The integer label for return arcs.\\n\\n  Returns:\\n    An FST resulting from expanding the input\"\" RTN.\\n  \";\nstatic PyObject *__pyx_pw_9pywrapfst_47replace(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  PyObject *__pyx_v_pairs = 0;\n  PyObject *__pyx_v_call_arc_labeling = 0;\n  PyObject *__pyx_v_return_arc_labeling = 0;\n  bool __pyx_v_epsilon_on_replace;\n  __pyx_t_10basictypes_int64 __pyx_v_return_label;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"replace (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_pairs,&__pyx_n_s_call_arc_labeling,&__pyx_n_s_return_arc_labeling,&__pyx_n_s_epsilon_on_replace,&__pyx_n_s_return_label,0};\n    PyObject* values[5] = {0,0,0,0,0};\n    values[1] = ((PyObject *)__pyx_n_b_input);\n    values[2] = ((PyObject *)__pyx_n_b_neither);\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  5: values[4] = PyTuple_GET_ITEM(__pyx_args, 4);\n        CYTHON_FALLTHROUGH;\n        case  4: values[3] = PyTuple_GET_ITEM(__pyx_args, 3);\n        CYTHON_FALLTHROUGH;\n        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);\n        CYTHON_FALLTHROUGH;\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (likely((values[0] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_pairs)) != 0)) kw_args--;\n        else goto __pyx_L5_argtuple_error;\n        CYTHON_FALLTHROUGH;\n        case  1:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_call_arc_labeling);\n          if (value) { values[1] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  2:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_return_arc_labeling);\n          if (value) { values[2] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  3:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_epsilon_on_replace);\n          if (value) { values[3] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  4:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_return_label);\n          if (value) { values[4] = value; kw_args--; }\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"replace\") < 0)) __PYX_ERR(0, 3837, __pyx_L3_error)\n      }\n    } else {\n      switch (PyTuple_GET_SIZE(__pyx_args)) {\n        case  5: values[4] = PyTuple_GET_ITEM(__pyx_args, 4);\n        CYTHON_FALLTHROUGH;\n        case  4: values[3] = PyTuple_GET_ITEM(__pyx_args, 3);\n        CYTHON_FALLTHROUGH;\n        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);\n        CYTHON_FALLTHROUGH;\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n    }\n    __pyx_v_pairs = values[0];\n    __pyx_v_call_arc_labeling = values[1];\n    __pyx_v_return_arc_labeling = values[2];\n    if (values[3]) {\n      __pyx_v_epsilon_on_replace = __Pyx_PyObject_IsTrue(values[3]); if (unlikely((__pyx_v_epsilon_on_replace == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 3840, __pyx_L3_error)\n    } else {\n\n      /* \"pywrapfst.pyx\":3840\n *                           call_arc_labeling=b\"input\",\n *                           return_arc_labeling=b\"neither\",\n *                           bool epsilon_on_replace=False,             # <<<<<<<<<<<<<<\n *                           int64 return_label=0):\n *   \"\"\"\n */\n      __pyx_v_epsilon_on_replace = ((bool)0);\n    }\n    if (values[4]) {\n      __pyx_v_return_label = __Pyx_PyInt_As_int64_t(values[4]); if (unlikely((__pyx_v_return_label == ((int64_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 3841, __pyx_L3_error)\n    } else {\n      __pyx_v_return_label = ((__pyx_t_10basictypes_int64)0);\n    }\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"replace\", 0, 1, 5, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 3837, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst.replace\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  __pyx_r = __pyx_pf_9pywrapfst_46replace(__pyx_self, __pyx_v_pairs, __pyx_v_call_arc_labeling, __pyx_v_return_arc_labeling, __pyx_v_epsilon_on_replace, __pyx_v_return_label);\n\n  /* \"pywrapfst.pyx\":3837\n * \n * \n * cpdef _MutableFst replace(pairs,             # <<<<<<<<<<<<<<\n *                           call_arc_labeling=b\"input\",\n *                           return_arc_labeling=b\"neither\",\n */\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_46replace(CYTHON_UNUSED PyObject *__pyx_self, PyObject *__pyx_v_pairs, PyObject *__pyx_v_call_arc_labeling, PyObject *__pyx_v_return_arc_labeling, bool __pyx_v_epsilon_on_replace, __pyx_t_10basictypes_int64 __pyx_v_return_label) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  struct __pyx_opt_args_9pywrapfst_replace __pyx_t_2;\n  __Pyx_RefNannySetupContext(\"replace\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_2.__pyx_n = 4;\n  __pyx_t_2.call_arc_labeling = __pyx_v_call_arc_labeling;\n  __pyx_t_2.return_arc_labeling = __pyx_v_return_arc_labeling;\n  __pyx_t_2.epsilon_on_replace = __pyx_v_epsilon_on_replace;\n  __pyx_t_2.return_label = __pyx_v_return_label;\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst_replace(__pyx_v_pairs, 0, &__pyx_t_2)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3837, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.replace\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":3899\n * \n * \n * cpdef _MutableFst reverse(_Fst ifst, bool require_superinitial=True):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   reverse(ifst, require_superinitial=True)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_49reverse(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic struct __pyx_obj_9pywrapfst__MutableFst *__pyx_f_9pywrapfst_reverse(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst, CYTHON_UNUSED int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_reverse *__pyx_optional_args) {\n  bool __pyx_v_require_superinitial = ((bool)1);\n  std::unique_ptr<fst::script::VectorFstClass>  __pyx_v_tfst;\n  struct __pyx_obj_9pywrapfst__MutableFst *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"reverse\", 0);\n  if (__pyx_optional_args) {\n    if (__pyx_optional_args->__pyx_n > 0) {\n      __pyx_v_require_superinitial = __pyx_optional_args->require_superinitial;\n    }\n  }\n\n  /* \"pywrapfst.pyx\":3919\n *   \"\"\"\n *   cdef unique_ptr[fst.VectorFstClass] tfst\n *   tfst.reset(new fst.VectorFstClass(ifst.arc_type()))             # <<<<<<<<<<<<<<\n *   fst.Reverse(deref(ifst._fst), tfst.get(), require_superinitial)\n *   return _init_MutableFst(tfst.release())\n */\n  if (unlikely(((PyObject *)__pyx_v_ifst) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"arc_type\");\n    __PYX_ERR(0, 3919, __pyx_L1_error)\n  }\n  __pyx_v_tfst.reset(new fst::script::VectorFstClass(((struct __pyx_vtabstruct_9pywrapfst__Fst *)__pyx_v_ifst->__pyx_vtab)->arc_type(__pyx_v_ifst, 0)));\n\n  /* \"pywrapfst.pyx\":3920\n *   cdef unique_ptr[fst.VectorFstClass] tfst\n *   tfst.reset(new fst.VectorFstClass(ifst.arc_type()))\n *   fst.Reverse(deref(ifst._fst), tfst.get(), require_superinitial)             # <<<<<<<<<<<<<<\n *   return _init_MutableFst(tfst.release())\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_ifst) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 3920, __pyx_L1_error)\n  }\n  fst::script::Reverse((*__pyx_v_ifst->_fst), __pyx_v_tfst.get(), __pyx_v_require_superinitial);\n\n  /* \"pywrapfst.pyx\":3921\n *   tfst.reset(new fst.VectorFstClass(ifst.arc_type()))\n *   fst.Reverse(deref(ifst._fst), tfst.get(), require_superinitial)\n *   return _init_MutableFst(tfst.release())             # <<<<<<<<<<<<<<\n * \n * \n */\n  __Pyx_XDECREF(((PyObject *)__pyx_r));\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst__init_MutableFst(__pyx_v_tfst.release())); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3921, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = ((struct __pyx_obj_9pywrapfst__MutableFst *)__pyx_t_1);\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":3899\n * \n * \n * cpdef _MutableFst reverse(_Fst ifst, bool require_superinitial=True):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   reverse(ifst, require_superinitial=True)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.reverse\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XGIVEREF((PyObject *)__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_49reverse(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic char __pyx_doc_9pywrapfst_48reverse[] = \"\\n  reverse(ifst, require_superinitial=True)\\n\\n  Constructively reverses an FST's transduction.\\n\\n  This operation reverses an FST. If A transduces string x to y with weight a,\\n  then the reverse of A transduces the reverse of x to the reverse of y with\\n  weight a.Reverse(). (Typically, a = a.Reverse() and Arc = RevArc, e.g.,\\n  TropicalWeight and LogWeight.) In general, e.g., when the weights only form a\\n  left or right semiring, the output arc type must match the input arc type.\\n\\n  Args:\\n    ifst: The input FST.\\n    require_superinitial: Should a superinitial state be created?\\n\\n  Returns:\\n    A reversed FST.\\n  \";\nstatic PyObject *__pyx_pw_9pywrapfst_49reverse(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst = 0;\n  bool __pyx_v_require_superinitial;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"reverse (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_ifst,&__pyx_n_s_require_superinitial,0};\n    PyObject* values[2] = {0,0};\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (likely((values[0] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_ifst)) != 0)) kw_args--;\n        else goto __pyx_L5_argtuple_error;\n        CYTHON_FALLTHROUGH;\n        case  1:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_require_superinitial);\n          if (value) { values[1] = value; kw_args--; }\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"reverse\") < 0)) __PYX_ERR(0, 3899, __pyx_L3_error)\n      }\n    } else {\n      switch (PyTuple_GET_SIZE(__pyx_args)) {\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n    }\n    __pyx_v_ifst = ((struct __pyx_obj_9pywrapfst__Fst *)values[0]);\n    if (values[1]) {\n      __pyx_v_require_superinitial = __Pyx_PyObject_IsTrue(values[1]); if (unlikely((__pyx_v_require_superinitial == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 3899, __pyx_L3_error)\n    } else {\n      __pyx_v_require_superinitial = ((bool)1);\n    }\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"reverse\", 0, 1, 2, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 3899, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst.reverse\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_ifst), __pyx_ptype_9pywrapfst__Fst, 1, \"ifst\", 0))) __PYX_ERR(0, 3899, __pyx_L1_error)\n  __pyx_r = __pyx_pf_9pywrapfst_48reverse(__pyx_self, __pyx_v_ifst, __pyx_v_require_superinitial);\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_48reverse(CYTHON_UNUSED PyObject *__pyx_self, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst, bool __pyx_v_require_superinitial) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  struct __pyx_opt_args_9pywrapfst_reverse __pyx_t_2;\n  __Pyx_RefNannySetupContext(\"reverse\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_2.__pyx_n = 1;\n  __pyx_t_2.require_superinitial = __pyx_v_require_superinitial;\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst_reverse(__pyx_v_ifst, 0, &__pyx_t_2)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3899, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.reverse\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":3927\n * \n * \n * cdef vector[fst.WeightClass] *_shortestdistance(_Fst ifst,             # <<<<<<<<<<<<<<\n *                                                 float delta=fst.kShortestDelta,\n *                                                 int64 nstate=fst.kNoStateId,\n */\n\nstatic std::vector<fst::script::WeightClass>  *__pyx_f_9pywrapfst__shortestdistance(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst, struct __pyx_opt_args_9pywrapfst__shortestdistance *__pyx_optional_args) {\n  float __pyx_v_delta = __pyx_k__82;\n  __pyx_t_10basictypes_int64 __pyx_v_nstate = __pyx_k__83;\n  PyObject *__pyx_v_queue_type = ((PyObject *)__pyx_n_b_auto);\n\n  /* \"pywrapfst.pyx\":3931\n *                                                 int64 nstate=fst.kNoStateId,\n *                                                 queue_type=b\"auto\",\n *                                                 bool reverse=False) except *:             # <<<<<<<<<<<<<<\n *   cdef unique_ptr[vector[fst.WeightClass]] distance\n *   distance.reset(new vector[fst.WeightClass]())\n */\n  bool __pyx_v_reverse = ((bool)0);\n  std::unique_ptr<std::vector<fst::script::WeightClass> >  __pyx_v_distance;\n  std::unique_ptr<fst::script::ShortestDistanceOptions>  __pyx_v_opts;\n  std::vector<fst::script::WeightClass>  *__pyx_r;\n  __Pyx_RefNannyDeclarations\n  std::vector<fst::script::WeightClass>  *__pyx_t_1;\n  int __pyx_t_2;\n  std::string __pyx_t_3;\n  enum fst::QueueType __pyx_t_4;\n  __Pyx_RefNannySetupContext(\"_shortestdistance\", 0);\n  if (__pyx_optional_args) {\n    if (__pyx_optional_args->__pyx_n > 0) {\n      __pyx_v_delta = __pyx_optional_args->delta;\n      if (__pyx_optional_args->__pyx_n > 1) {\n        __pyx_v_nstate = __pyx_optional_args->nstate;\n        if (__pyx_optional_args->__pyx_n > 2) {\n          __pyx_v_queue_type = __pyx_optional_args->queue_type;\n          if (__pyx_optional_args->__pyx_n > 3) {\n            __pyx_v_reverse = __pyx_optional_args->reverse;\n          }\n        }\n      }\n    }\n  }\n\n  /* \"pywrapfst.pyx\":3933\n *                                                 bool reverse=False) except *:\n *   cdef unique_ptr[vector[fst.WeightClass]] distance\n *   distance.reset(new vector[fst.WeightClass]())             # <<<<<<<<<<<<<<\n *   # For scoping reasons, these have to be declared here even though they may\n *   # not be used in all cases.\n */\n  try {\n    __pyx_t_1 = new std::vector<fst::script::WeightClass> ();\n  } catch(...) {\n    __Pyx_CppExn2PyErr();\n    __PYX_ERR(0, 3933, __pyx_L1_error)\n  }\n  __pyx_v_distance.reset(__pyx_t_1);\n\n  /* \"pywrapfst.pyx\":3937\n *   # not be used in all cases.\n *   cdef unique_ptr[fst.ShortestDistanceOptions] opts\n *   if reverse:             # <<<<<<<<<<<<<<\n *     # Only the simpler signature supports shortest distance to final states;\n *     # `nstate` and `queue_type` arguments are ignored.\n */\n  __pyx_t_2 = (__pyx_v_reverse != 0);\n  if (__pyx_t_2) {\n\n    /* \"pywrapfst.pyx\":3940\n *     # Only the simpler signature supports shortest distance to final states;\n *     # `nstate` and `queue_type` arguments are ignored.\n *     fst.ShortestDistance(deref(ifst._fst), distance.get(), True, delta)             # <<<<<<<<<<<<<<\n *   else:\n *     opts.reset(new fst.ShortestDistanceOptions(\n */\n    if (unlikely(((PyObject *)__pyx_v_ifst) == Py_None)) {\n      PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n      __PYX_ERR(0, 3940, __pyx_L1_error)\n    }\n    fst::script::ShortestDistance((*__pyx_v_ifst->_fst), __pyx_v_distance.get(), 1, __pyx_v_delta);\n\n    /* \"pywrapfst.pyx\":3937\n *   # not be used in all cases.\n *   cdef unique_ptr[fst.ShortestDistanceOptions] opts\n *   if reverse:             # <<<<<<<<<<<<<<\n *     # Only the simpler signature supports shortest distance to final states;\n *     # `nstate` and `queue_type` arguments are ignored.\n */\n    goto __pyx_L3;\n  }\n\n  /* \"pywrapfst.pyx\":3942\n *     fst.ShortestDistance(deref(ifst._fst), distance.get(), True, delta)\n *   else:\n *     opts.reset(new fst.ShortestDistanceOptions(             # <<<<<<<<<<<<<<\n *         _get_queue_type(tostring(queue_type)), fst.ANY_ARC_FILTER, nstate,\n *         delta))\n */\n  /*else*/ {\n\n    /* \"pywrapfst.pyx\":3943\n *   else:\n *     opts.reset(new fst.ShortestDistanceOptions(\n *         _get_queue_type(tostring(queue_type)), fst.ANY_ARC_FILTER, nstate,             # <<<<<<<<<<<<<<\n *         delta))\n *     fst.ShortestDistance(deref(ifst._fst), distance.get(), deref(opts))\n */\n    __pyx_t_3 = __pyx_f_9pywrapfst_tostring(__pyx_v_queue_type, NULL); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 3943, __pyx_L1_error)\n    __pyx_t_4 = __pyx_f_9pywrapfst__get_queue_type(__pyx_t_3); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 3943, __pyx_L1_error)\n\n    /* \"pywrapfst.pyx\":3942\n *     fst.ShortestDistance(deref(ifst._fst), distance.get(), True, delta)\n *   else:\n *     opts.reset(new fst.ShortestDistanceOptions(             # <<<<<<<<<<<<<<\n *         _get_queue_type(tostring(queue_type)), fst.ANY_ARC_FILTER, nstate,\n *         delta))\n */\n    __pyx_v_opts.reset(new fst::script::ShortestDistanceOptions(__pyx_t_4, fst::script::ANY_ARC_FILTER, __pyx_v_nstate, __pyx_v_delta));\n\n    /* \"pywrapfst.pyx\":3945\n *         _get_queue_type(tostring(queue_type)), fst.ANY_ARC_FILTER, nstate,\n *         delta))\n *     fst.ShortestDistance(deref(ifst._fst), distance.get(), deref(opts))             # <<<<<<<<<<<<<<\n *   return distance.release()\n * \n */\n    if (unlikely(((PyObject *)__pyx_v_ifst) == Py_None)) {\n      PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n      __PYX_ERR(0, 3945, __pyx_L1_error)\n    }\n    fst::script::ShortestDistance((*__pyx_v_ifst->_fst), __pyx_v_distance.get(), (*__pyx_v_opts));\n  }\n  __pyx_L3:;\n\n  /* \"pywrapfst.pyx\":3946\n *         delta))\n *     fst.ShortestDistance(deref(ifst._fst), distance.get(), deref(opts))\n *   return distance.release()             # <<<<<<<<<<<<<<\n * \n * \n */\n  __pyx_r = __pyx_v_distance.release();\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":3927\n * \n * \n * cdef vector[fst.WeightClass] *_shortestdistance(_Fst ifst,             # <<<<<<<<<<<<<<\n *                                                 float delta=fst.kShortestDelta,\n *                                                 int64 nstate=fst.kNoStateId,\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"pywrapfst._shortestdistance\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":3949\n * \n * \n * def shortestdistance(_Fst ifst,             # <<<<<<<<<<<<<<\n *                      float delta=fst.kShortestDelta,\n *                      int64 nstate=fst.kNoStateId,\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_51shortestdistance(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic char __pyx_doc_9pywrapfst_50shortestdistance[] = \"\\n  shortestdistance(ifst, delta=1e-6, nstate=NO_STATE_ID,\\n                   queue_type=\\\"auto\\\", reverse=False)\\n\\n  Compute the shortest distance from the initial or final state.\\n\\n  This operation computes the shortest distance from the initial state (when\\n  `reverse` is False) or from every state to the final state (when `reverse` is\\n  True). The shortest distance from p to q is the \\\\otimes-sum of the weights of\\n  all the paths between p and q. The weights must be right (if `reverse` is\\n  False) or left (if `reverse` is True) distributive, and k-closed (i.e., 1\\n  \\\\otimes x \\\\otimes x^2 \\\\otimes ... \\\\otimes x^{k + 1} = 1 \\\\otimes x \\\\otimes x^2\\n  \\\\otimes ... \\\\otimes x^k; e.g., TropicalWeight).\\n\\n  Args:\\n    ifst: The input FST.\\n    delta: Comparison/quantization delta.\\n    nstate: State number threshold (ignored if `reverse` is True).\\n    queue_type: A string matching a known queue type; one of: \\\"auto\\\", \\\"fifo\\\",\\n        \\\"lifo\\\", \\\"shortest\\\", \\\"state\\\", \\\"top\\\" (ignored if `reverse` is True).\\n    reverse: Should the reverse distance (from each state to the final state)\\n        be computed?\\n\\n  Returns:\\n    A list of Weight objects representing the shortest distance for each state.\\n  \";\nstatic PyMethodDef __pyx_mdef_9pywrapfst_51shortestdistance = {\"shortestdistance\", (PyCFunction)__pyx_pw_9pywrapfst_51shortestdistance, METH_VARARGS|METH_KEYWORDS, __pyx_doc_9pywrapfst_50shortestdistance};\nstatic PyObject *__pyx_pw_9pywrapfst_51shortestdistance(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst = 0;\n  float __pyx_v_delta;\n  __pyx_t_10basictypes_int64 __pyx_v_nstate;\n  PyObject *__pyx_v_queue_type = 0;\n  bool __pyx_v_reverse;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"shortestdistance (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_ifst,&__pyx_n_s_delta,&__pyx_n_s_nstate,&__pyx_n_s_queue_type,&__pyx_n_s_reverse,0};\n    PyObject* values[5] = {0,0,0,0,0};\n    values[3] = ((PyObject *)__pyx_n_b_auto);\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  5: values[4] = PyTuple_GET_ITEM(__pyx_args, 4);\n        CYTHON_FALLTHROUGH;\n        case  4: values[3] = PyTuple_GET_ITEM(__pyx_args, 3);\n        CYTHON_FALLTHROUGH;\n        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);\n        CYTHON_FALLTHROUGH;\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (likely((values[0] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_ifst)) != 0)) kw_args--;\n        else goto __pyx_L5_argtuple_error;\n        CYTHON_FALLTHROUGH;\n        case  1:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_delta);\n          if (value) { values[1] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  2:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_nstate);\n          if (value) { values[2] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  3:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_queue_type);\n          if (value) { values[3] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  4:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_reverse);\n          if (value) { values[4] = value; kw_args--; }\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"shortestdistance\") < 0)) __PYX_ERR(0, 3949, __pyx_L3_error)\n      }\n    } else {\n      switch (PyTuple_GET_SIZE(__pyx_args)) {\n        case  5: values[4] = PyTuple_GET_ITEM(__pyx_args, 4);\n        CYTHON_FALLTHROUGH;\n        case  4: values[3] = PyTuple_GET_ITEM(__pyx_args, 3);\n        CYTHON_FALLTHROUGH;\n        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);\n        CYTHON_FALLTHROUGH;\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n    }\n    __pyx_v_ifst = ((struct __pyx_obj_9pywrapfst__Fst *)values[0]);\n    if (values[1]) {\n      __pyx_v_delta = __pyx_PyFloat_AsFloat(values[1]); if (unlikely((__pyx_v_delta == (float)-1) && PyErr_Occurred())) __PYX_ERR(0, 3950, __pyx_L3_error)\n    } else {\n      __pyx_v_delta = __pyx_k__84;\n    }\n    if (values[2]) {\n      __pyx_v_nstate = __Pyx_PyInt_As_int64_t(values[2]); if (unlikely((__pyx_v_nstate == ((int64_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 3951, __pyx_L3_error)\n    } else {\n      __pyx_v_nstate = __pyx_k__85;\n    }\n    __pyx_v_queue_type = values[3];\n    if (values[4]) {\n      __pyx_v_reverse = __Pyx_PyObject_IsTrue(values[4]); if (unlikely((__pyx_v_reverse == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 3953, __pyx_L3_error)\n    } else {\n\n      /* \"pywrapfst.pyx\":3953\n *                      int64 nstate=fst.kNoStateId,\n *                      queue_type=b\"auto\",\n *                      bool reverse=False):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   shortestdistance(ifst, delta=1e-6, nstate=NO_STATE_ID,\n */\n      __pyx_v_reverse = ((bool)0);\n    }\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"shortestdistance\", 0, 1, 5, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 3949, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst.shortestdistance\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_ifst), __pyx_ptype_9pywrapfst__Fst, 1, \"ifst\", 0))) __PYX_ERR(0, 3949, __pyx_L1_error)\n  __pyx_r = __pyx_pf_9pywrapfst_50shortestdistance(__pyx_self, __pyx_v_ifst, __pyx_v_delta, __pyx_v_nstate, __pyx_v_queue_type, __pyx_v_reverse);\n\n  /* \"pywrapfst.pyx\":3949\n * \n * \n * def shortestdistance(_Fst ifst,             # <<<<<<<<<<<<<<\n *                      float delta=fst.kShortestDelta,\n *                      int64 nstate=fst.kNoStateId,\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_50shortestdistance(CYTHON_UNUSED PyObject *__pyx_self, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst, float __pyx_v_delta, __pyx_t_10basictypes_int64 __pyx_v_nstate, PyObject *__pyx_v_queue_type, bool __pyx_v_reverse) {\n  std::unique_ptr<std::vector<fst::script::WeightClass> >  __pyx_v_distance;\n  std::string __pyx_v_weight_type;\n  fst::script::WeightClass __pyx_v_weight;\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  std::vector<fst::script::WeightClass>  *__pyx_t_1;\n  struct __pyx_opt_args_9pywrapfst__shortestdistance __pyx_t_2;\n  PyObject *__pyx_t_3 = NULL;\n  std::vector<fst::script::WeightClass> ::iterator __pyx_t_4;\n  fst::script::WeightClass __pyx_t_5;\n  PyObject *__pyx_t_6 = NULL;\n  PyObject *__pyx_t_7 = NULL;\n  PyObject *__pyx_t_8 = NULL;\n  __Pyx_RefNannySetupContext(\"shortestdistance\", 0);\n\n  /* \"pywrapfst.pyx\":3981\n *   \"\"\"\n *   cdef unique_ptr[vector[fst.WeightClass]] distance\n *   distance.reset(_shortestdistance(ifst, delta, nstate, queue_type, reverse))             # <<<<<<<<<<<<<<\n *   cdef string weight_type = ifst.weight_type()\n *   return [Weight(weight_type, weight.ToString()) for weight in deref(distance)]\n */\n  __pyx_t_2.__pyx_n = 4;\n  __pyx_t_2.delta = __pyx_v_delta;\n  __pyx_t_2.nstate = __pyx_v_nstate;\n  __pyx_t_2.queue_type = __pyx_v_queue_type;\n  __pyx_t_2.reverse = __pyx_v_reverse;\n  __pyx_t_1 = __pyx_f_9pywrapfst__shortestdistance(__pyx_v_ifst, &__pyx_t_2); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 3981, __pyx_L1_error)\n  __pyx_v_distance.reset(__pyx_t_1);\n\n  /* \"pywrapfst.pyx\":3982\n *   cdef unique_ptr[vector[fst.WeightClass]] distance\n *   distance.reset(_shortestdistance(ifst, delta, nstate, queue_type, reverse))\n *   cdef string weight_type = ifst.weight_type()             # <<<<<<<<<<<<<<\n *   return [Weight(weight_type, weight.ToString()) for weight in deref(distance)]\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_ifst) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"weight_type\");\n    __PYX_ERR(0, 3982, __pyx_L1_error)\n  }\n  __pyx_v_weight_type = ((struct __pyx_vtabstruct_9pywrapfst__Fst *)__pyx_v_ifst->__pyx_vtab)->weight_type(__pyx_v_ifst, 0);\n\n  /* \"pywrapfst.pyx\":3983\n *   distance.reset(_shortestdistance(ifst, delta, nstate, queue_type, reverse))\n *   cdef string weight_type = ifst.weight_type()\n *   return [Weight(weight_type, weight.ToString()) for weight in deref(distance)]             # <<<<<<<<<<<<<<\n * \n * \n */\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_3 = PyList_New(0); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 3983, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_3);\n  __pyx_t_1 = &(*__pyx_v_distance);\n  __pyx_t_4 = __pyx_t_1->begin();\n  for (;;) {\n    if (!(__pyx_t_4 != __pyx_t_1->end())) break;\n    __pyx_t_5 = *__pyx_t_4;\n    ++__pyx_t_4;\n    __pyx_v_weight = __pyx_t_5;\n    __pyx_t_6 = __pyx_convert_PyBytes_string_to_py_std__in_string(__pyx_v_weight_type); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 3983, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_6);\n    __pyx_t_7 = __pyx_convert_PyBytes_string_to_py_std__in_string(__pyx_v_weight.ToString()); if (unlikely(!__pyx_t_7)) __PYX_ERR(0, 3983, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_7);\n    __pyx_t_8 = PyTuple_New(2); if (unlikely(!__pyx_t_8)) __PYX_ERR(0, 3983, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_8);\n    __Pyx_GIVEREF(__pyx_t_6);\n    PyTuple_SET_ITEM(__pyx_t_8, 0, __pyx_t_6);\n    __Pyx_GIVEREF(__pyx_t_7);\n    PyTuple_SET_ITEM(__pyx_t_8, 1, __pyx_t_7);\n    __pyx_t_6 = 0;\n    __pyx_t_7 = 0;\n    __pyx_t_7 = __Pyx_PyObject_Call(((PyObject *)__pyx_ptype_9pywrapfst_Weight), __pyx_t_8, NULL); if (unlikely(!__pyx_t_7)) __PYX_ERR(0, 3983, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_7);\n    __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0;\n    if (unlikely(__Pyx_ListComp_Append(__pyx_t_3, (PyObject*)__pyx_t_7))) __PYX_ERR(0, 3983, __pyx_L1_error)\n    __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0;\n  }\n  __pyx_r = __pyx_t_3;\n  __pyx_t_3 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":3949\n * \n * \n * def shortestdistance(_Fst ifst,             # <<<<<<<<<<<<<<\n *                      float delta=fst.kShortestDelta,\n *                      int64 nstate=fst.kNoStateId,\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_6);\n  __Pyx_XDECREF(__pyx_t_7);\n  __Pyx_XDECREF(__pyx_t_8);\n  __Pyx_AddTraceback(\"pywrapfst.shortestdistance\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":3986\n * \n * \n * cpdef _MutableFst shortestpath(_Fst ifst,             # <<<<<<<<<<<<<<\n *                                float delta=fst.kShortestDelta,\n *                                int32 nshortest=1,\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_53shortestpath(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic struct __pyx_obj_9pywrapfst__MutableFst *__pyx_f_9pywrapfst_shortestpath(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst, CYTHON_UNUSED int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_shortestpath *__pyx_optional_args) {\n  float __pyx_v_delta = __pyx_k__86;\n  __pyx_t_10basictypes_int32 __pyx_v_nshortest = ((__pyx_t_10basictypes_int32)1);\n  __pyx_t_10basictypes_int64 __pyx_v_nstate = __pyx_k__87;\n  PyObject *__pyx_v_queue_type = ((PyObject *)__pyx_n_b_auto);\n\n  /* \"pywrapfst.pyx\":3991\n *                                int64 nstate=fst.kNoStateId,\n *                                queue_type=b\"auto\",\n *                                bool unique=False,             # <<<<<<<<<<<<<<\n *                                weight=None):\n *   \"\"\"\n */\n  bool __pyx_v_unique = ((bool)0);\n\n  /* \"pywrapfst.pyx\":3992\n *                                queue_type=b\"auto\",\n *                                bool unique=False,\n *                                weight=None):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   shortestpath(ifst, delta=1e-6, nshortest=1, nstate=NO_STATE_ID,\n */\n  PyObject *__pyx_v_weight = ((PyObject *)Py_None);\n  std::unique_ptr<fst::script::VectorFstClass>  __pyx_v_tfst;\n  fst::script::WeightClass __pyx_v_wc;\n  std::unique_ptr<fst::script::ShortestPathOptions>  __pyx_v_opts;\n  struct __pyx_obj_9pywrapfst__MutableFst *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  fst::script::WeightClass __pyx_t_1;\n  std::string __pyx_t_2;\n  enum fst::QueueType __pyx_t_3;\n  PyObject *__pyx_t_4 = NULL;\n  __Pyx_RefNannySetupContext(\"shortestpath\", 0);\n  if (__pyx_optional_args) {\n    if (__pyx_optional_args->__pyx_n > 0) {\n      __pyx_v_delta = __pyx_optional_args->delta;\n      if (__pyx_optional_args->__pyx_n > 1) {\n        __pyx_v_nshortest = __pyx_optional_args->nshortest;\n        if (__pyx_optional_args->__pyx_n > 2) {\n          __pyx_v_nstate = __pyx_optional_args->nstate;\n          if (__pyx_optional_args->__pyx_n > 3) {\n            __pyx_v_queue_type = __pyx_optional_args->queue_type;\n            if (__pyx_optional_args->__pyx_n > 4) {\n              __pyx_v_unique = __pyx_optional_args->unique;\n              if (__pyx_optional_args->__pyx_n > 5) {\n                __pyx_v_weight = __pyx_optional_args->weight;\n              }\n            }\n          }\n        }\n      }\n    }\n  }\n\n  /* \"pywrapfst.pyx\":4024\n *   \"\"\"\n *   cdef unique_ptr[fst.VectorFstClass] tfst\n *   tfst.reset(new fst.VectorFstClass(ifst.arc_type()))             # <<<<<<<<<<<<<<\n *   # Threshold is set to semiring Zero (no pruning) if no weight is specified.\n *   cdef fst.WeightClass wc = _get_WeightClass_or_Zero(ifst.weight_type(), weight)\n */\n  if (unlikely(((PyObject *)__pyx_v_ifst) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"arc_type\");\n    __PYX_ERR(0, 4024, __pyx_L1_error)\n  }\n  __pyx_v_tfst.reset(new fst::script::VectorFstClass(((struct __pyx_vtabstruct_9pywrapfst__Fst *)__pyx_v_ifst->__pyx_vtab)->arc_type(__pyx_v_ifst, 0)));\n\n  /* \"pywrapfst.pyx\":4026\n *   tfst.reset(new fst.VectorFstClass(ifst.arc_type()))\n *   # Threshold is set to semiring Zero (no pruning) if no weight is specified.\n *   cdef fst.WeightClass wc = _get_WeightClass_or_Zero(ifst.weight_type(), weight)             # <<<<<<<<<<<<<<\n *   cdef unique_ptr[fst.ShortestPathOptions] opts\n *   opts.reset(new fst.ShortestPathOptions(_get_queue_type(tostring(queue_type)),\n */\n  if (unlikely(((PyObject *)__pyx_v_ifst) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"weight_type\");\n    __PYX_ERR(0, 4026, __pyx_L1_error)\n  }\n  __pyx_t_1 = __pyx_f_9pywrapfst__get_WeightClass_or_Zero(((struct __pyx_vtabstruct_9pywrapfst__Fst *)__pyx_v_ifst->__pyx_vtab)->weight_type(__pyx_v_ifst, 0), __pyx_v_weight); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 4026, __pyx_L1_error)\n  __pyx_v_wc = __pyx_t_1;\n\n  /* \"pywrapfst.pyx\":4028\n *   cdef fst.WeightClass wc = _get_WeightClass_or_Zero(ifst.weight_type(), weight)\n *   cdef unique_ptr[fst.ShortestPathOptions] opts\n *   opts.reset(new fst.ShortestPathOptions(_get_queue_type(tostring(queue_type)),             # <<<<<<<<<<<<<<\n *                                          nshortest, unique, delta, wc, nstate))\n *   fst.ShortestPath(deref(ifst._fst), tfst.get(), deref(opts))\n */\n  __pyx_t_2 = __pyx_f_9pywrapfst_tostring(__pyx_v_queue_type, NULL); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 4028, __pyx_L1_error)\n  __pyx_t_3 = __pyx_f_9pywrapfst__get_queue_type(__pyx_t_2); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 4028, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":4029\n *   cdef unique_ptr[fst.ShortestPathOptions] opts\n *   opts.reset(new fst.ShortestPathOptions(_get_queue_type(tostring(queue_type)),\n *                                          nshortest, unique, delta, wc, nstate))             # <<<<<<<<<<<<<<\n *   fst.ShortestPath(deref(ifst._fst), tfst.get(), deref(opts))\n *   return _init_MutableFst(tfst.release())\n */\n  __pyx_v_opts.reset(new fst::script::ShortestPathOptions(__pyx_t_3, __pyx_v_nshortest, __pyx_v_unique, __pyx_v_delta, __pyx_v_wc, __pyx_v_nstate));\n\n  /* \"pywrapfst.pyx\":4030\n *   opts.reset(new fst.ShortestPathOptions(_get_queue_type(tostring(queue_type)),\n *                                          nshortest, unique, delta, wc, nstate))\n *   fst.ShortestPath(deref(ifst._fst), tfst.get(), deref(opts))             # <<<<<<<<<<<<<<\n *   return _init_MutableFst(tfst.release())\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_ifst) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 4030, __pyx_L1_error)\n  }\n  fst::script::ShortestPath((*__pyx_v_ifst->_fst), __pyx_v_tfst.get(), (*__pyx_v_opts));\n\n  /* \"pywrapfst.pyx\":4031\n *                                          nshortest, unique, delta, wc, nstate))\n *   fst.ShortestPath(deref(ifst._fst), tfst.get(), deref(opts))\n *   return _init_MutableFst(tfst.release())             # <<<<<<<<<<<<<<\n * \n * \n */\n  __Pyx_XDECREF(((PyObject *)__pyx_r));\n  __pyx_t_4 = ((PyObject *)__pyx_f_9pywrapfst__init_MutableFst(__pyx_v_tfst.release())); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 4031, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_4);\n  __pyx_r = ((struct __pyx_obj_9pywrapfst__MutableFst *)__pyx_t_4);\n  __pyx_t_4 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":3986\n * \n * \n * cpdef _MutableFst shortestpath(_Fst ifst,             # <<<<<<<<<<<<<<\n *                                float delta=fst.kShortestDelta,\n *                                int32 nshortest=1,\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_AddTraceback(\"pywrapfst.shortestpath\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XGIVEREF((PyObject *)__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_53shortestpath(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic char __pyx_doc_9pywrapfst_52shortestpath[] = \"\\n  shortestpath(ifst, delta=1e-6, nshortest=1, nstate=NO_STATE_ID,\\n               queue_type=\\\"auto\\\", unique=False, weight=None)\\n\\n  Construct an FST containing the shortest path(s) in the input FST.\\n\\n  This operation produces an FST containing the n-shortest paths in the input\\n  FST. The n-shortest paths are the n-lowest weight paths w.r.t. the natural\\n  semiring order. The single path that can be read from the ith of at most n\\n  transitions leaving the initial state of the resulting FST is the ith\\n  shortest path. The weights need to be right distributive and have the path\\n  property. They also need to be left distributive as well for n-shortest with\\n  n > 1 (e.g., TropicalWeight).\\n\\n  Args:\\n    ifst: The input FST.\\n    delta: Comparison/quantization delta.\\n    nshortest: The number of paths to return.\\n    nstate: State number threshold.\\n    queue_type: A string matching a known queue type; one of: \\\"auto\\\", \\\"fifo\\\",\\n        \\\"lifo\\\", \\\"shortest\\\", \\\"state\\\", \\\"top\\\".\\n    unique: Should the resulting FST only contain distinct paths? (Requires\\n        the input FST to be an acceptor; epsilons are treated as if they are\\n        regular symbols.)\\n    weight: A Weight or weight string indicating the desired weight threshold\\n        below which paths are pruned; if omitted, no paths are pruned.\\n\\n  Returns:\\n    An FST containing the n-shortest paths.\\n  \";\nstatic PyObject *__pyx_pw_9pywrapfst_53shortestpath(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst = 0;\n  float __pyx_v_delta;\n  __pyx_t_10basictypes_int32 __pyx_v_nshortest;\n  __pyx_t_10basictypes_int64 __pyx_v_nstate;\n  PyObject *__pyx_v_queue_type = 0;\n  bool __pyx_v_unique;\n  PyObject *__pyx_v_weight = 0;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"shortestpath (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_ifst,&__pyx_n_s_delta,&__pyx_n_s_nshortest,&__pyx_n_s_nstate,&__pyx_n_s_queue_type,&__pyx_n_s_unique,&__pyx_n_s_weight,0};\n    PyObject* values[7] = {0,0,0,0,0,0,0};\n    values[4] = ((PyObject *)__pyx_n_b_auto);\n\n    /* \"pywrapfst.pyx\":3992\n *                                queue_type=b\"auto\",\n *                                bool unique=False,\n *                                weight=None):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   shortestpath(ifst, delta=1e-6, nshortest=1, nstate=NO_STATE_ID,\n */\n    values[6] = ((PyObject *)Py_None);\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  7: values[6] = PyTuple_GET_ITEM(__pyx_args, 6);\n        CYTHON_FALLTHROUGH;\n        case  6: values[5] = PyTuple_GET_ITEM(__pyx_args, 5);\n        CYTHON_FALLTHROUGH;\n        case  5: values[4] = PyTuple_GET_ITEM(__pyx_args, 4);\n        CYTHON_FALLTHROUGH;\n        case  4: values[3] = PyTuple_GET_ITEM(__pyx_args, 3);\n        CYTHON_FALLTHROUGH;\n        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);\n        CYTHON_FALLTHROUGH;\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (likely((values[0] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_ifst)) != 0)) kw_args--;\n        else goto __pyx_L5_argtuple_error;\n        CYTHON_FALLTHROUGH;\n        case  1:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_delta);\n          if (value) { values[1] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  2:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_nshortest);\n          if (value) { values[2] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  3:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_nstate);\n          if (value) { values[3] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  4:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_queue_type);\n          if (value) { values[4] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  5:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_unique);\n          if (value) { values[5] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  6:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_weight);\n          if (value) { values[6] = value; kw_args--; }\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"shortestpath\") < 0)) __PYX_ERR(0, 3986, __pyx_L3_error)\n      }\n    } else {\n      switch (PyTuple_GET_SIZE(__pyx_args)) {\n        case  7: values[6] = PyTuple_GET_ITEM(__pyx_args, 6);\n        CYTHON_FALLTHROUGH;\n        case  6: values[5] = PyTuple_GET_ITEM(__pyx_args, 5);\n        CYTHON_FALLTHROUGH;\n        case  5: values[4] = PyTuple_GET_ITEM(__pyx_args, 4);\n        CYTHON_FALLTHROUGH;\n        case  4: values[3] = PyTuple_GET_ITEM(__pyx_args, 3);\n        CYTHON_FALLTHROUGH;\n        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);\n        CYTHON_FALLTHROUGH;\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n    }\n    __pyx_v_ifst = ((struct __pyx_obj_9pywrapfst__Fst *)values[0]);\n    if (values[1]) {\n      __pyx_v_delta = __pyx_PyFloat_AsFloat(values[1]); if (unlikely((__pyx_v_delta == (float)-1) && PyErr_Occurred())) __PYX_ERR(0, 3987, __pyx_L3_error)\n    } else {\n      __pyx_v_delta = __pyx_k__86;\n    }\n    if (values[2]) {\n      __pyx_v_nshortest = __Pyx_PyInt_As_int32_t(values[2]); if (unlikely((__pyx_v_nshortest == ((int32_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 3988, __pyx_L3_error)\n    } else {\n      __pyx_v_nshortest = ((__pyx_t_10basictypes_int32)1);\n    }\n    if (values[3]) {\n      __pyx_v_nstate = __Pyx_PyInt_As_int64_t(values[3]); if (unlikely((__pyx_v_nstate == ((int64_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 3989, __pyx_L3_error)\n    } else {\n      __pyx_v_nstate = __pyx_k__87;\n    }\n    __pyx_v_queue_type = values[4];\n    if (values[5]) {\n      __pyx_v_unique = __Pyx_PyObject_IsTrue(values[5]); if (unlikely((__pyx_v_unique == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 3991, __pyx_L3_error)\n    } else {\n\n      /* \"pywrapfst.pyx\":3991\n *                                int64 nstate=fst.kNoStateId,\n *                                queue_type=b\"auto\",\n *                                bool unique=False,             # <<<<<<<<<<<<<<\n *                                weight=None):\n *   \"\"\"\n */\n      __pyx_v_unique = ((bool)0);\n    }\n    __pyx_v_weight = values[6];\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"shortestpath\", 0, 1, 7, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 3986, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst.shortestpath\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_ifst), __pyx_ptype_9pywrapfst__Fst, 1, \"ifst\", 0))) __PYX_ERR(0, 3986, __pyx_L1_error)\n  __pyx_r = __pyx_pf_9pywrapfst_52shortestpath(__pyx_self, __pyx_v_ifst, __pyx_v_delta, __pyx_v_nshortest, __pyx_v_nstate, __pyx_v_queue_type, __pyx_v_unique, __pyx_v_weight);\n\n  /* \"pywrapfst.pyx\":3986\n * \n * \n * cpdef _MutableFst shortestpath(_Fst ifst,             # <<<<<<<<<<<<<<\n *                                float delta=fst.kShortestDelta,\n *                                int32 nshortest=1,\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_52shortestpath(CYTHON_UNUSED PyObject *__pyx_self, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst, float __pyx_v_delta, __pyx_t_10basictypes_int32 __pyx_v_nshortest, __pyx_t_10basictypes_int64 __pyx_v_nstate, PyObject *__pyx_v_queue_type, bool __pyx_v_unique, PyObject *__pyx_v_weight) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  struct __pyx_opt_args_9pywrapfst_shortestpath __pyx_t_2;\n  __Pyx_RefNannySetupContext(\"shortestpath\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_2.__pyx_n = 6;\n  __pyx_t_2.delta = __pyx_v_delta;\n  __pyx_t_2.nshortest = __pyx_v_nshortest;\n  __pyx_t_2.nstate = __pyx_v_nstate;\n  __pyx_t_2.queue_type = __pyx_v_queue_type;\n  __pyx_t_2.unique = __pyx_v_unique;\n  __pyx_t_2.weight = __pyx_v_weight;\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst_shortestpath(__pyx_v_ifst, 0, &__pyx_t_2)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3986, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.shortestpath\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":4034\n * \n * \n * cpdef _Fst statemap(_Fst ifst, map_type):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   state_map(ifst, map_type)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_55statemap(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic struct __pyx_obj_9pywrapfst__Fst *__pyx_f_9pywrapfst_statemap(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst, PyObject *__pyx_v_map_type, CYTHON_UNUSED int __pyx_skip_dispatch) {\n  struct __pyx_obj_9pywrapfst__Fst *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  struct __pyx_opt_args_9pywrapfst__map __pyx_t_2;\n  __Pyx_RefNannySetupContext(\"statemap\", 0);\n\n  /* \"pywrapfst.pyx\":4057\n *   See also: `arcmap`.\n *   \"\"\"\n *   return _map(ifst, fst.kDelta, map_type, 1., None)             # <<<<<<<<<<<<<<\n * \n * \n */\n  __Pyx_XDECREF(((PyObject *)__pyx_r));\n  __pyx_t_2.__pyx_n = 4;\n  __pyx_t_2.delta = fst::kDelta;\n  __pyx_t_2.map_type = __pyx_v_map_type;\n  __pyx_t_2.power = 1.;\n  __pyx_t_2.weight = Py_None;\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst__map(__pyx_v_ifst, &__pyx_t_2)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4057, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = ((struct __pyx_obj_9pywrapfst__Fst *)__pyx_t_1);\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":4034\n * \n * \n * cpdef _Fst statemap(_Fst ifst, map_type):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   state_map(ifst, map_type)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.statemap\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XGIVEREF((PyObject *)__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_55statemap(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic char __pyx_doc_9pywrapfst_54statemap[] = \"\\n  state_map(ifst, map_type)\\n\\n  Constructively applies a transform to all states.\\n\\n  This operation transforms each state according to the requested map type.\\n  Note that currently, only one state-mapping operation is supported.\\n\\n  Args:\\n    ifst: The input FST.\\n    map_type: A string matching a known mapping operation; one of: \\\"arc_sum\\\"\\n        (sum weights of identically-labeled multi-arcs), \\\"arc_unique\\\" (deletes\\n        non-unique identically-labeled multi-arcs).\\n\\n  Returns:\\n    An FST with states remapped.\\n\\n  Raises:\\n    FstArgError: Unknown map type.\\n\\n  See also: `arcmap`.\\n  \";\nstatic PyObject *__pyx_pw_9pywrapfst_55statemap(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst = 0;\n  PyObject *__pyx_v_map_type = 0;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"statemap (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_ifst,&__pyx_n_s_map_type,0};\n    PyObject* values[2] = {0,0};\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (likely((values[0] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_ifst)) != 0)) kw_args--;\n        else goto __pyx_L5_argtuple_error;\n        CYTHON_FALLTHROUGH;\n        case  1:\n        if (likely((values[1] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_map_type)) != 0)) kw_args--;\n        else {\n          __Pyx_RaiseArgtupleInvalid(\"statemap\", 1, 2, 2, 1); __PYX_ERR(0, 4034, __pyx_L3_error)\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"statemap\") < 0)) __PYX_ERR(0, 4034, __pyx_L3_error)\n      }\n    } else if (PyTuple_GET_SIZE(__pyx_args) != 2) {\n      goto __pyx_L5_argtuple_error;\n    } else {\n      values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n      values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n    }\n    __pyx_v_ifst = ((struct __pyx_obj_9pywrapfst__Fst *)values[0]);\n    __pyx_v_map_type = values[1];\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"statemap\", 1, 2, 2, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 4034, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst.statemap\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_ifst), __pyx_ptype_9pywrapfst__Fst, 1, \"ifst\", 0))) __PYX_ERR(0, 4034, __pyx_L1_error)\n  __pyx_r = __pyx_pf_9pywrapfst_54statemap(__pyx_self, __pyx_v_ifst, __pyx_v_map_type);\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_54statemap(CYTHON_UNUSED PyObject *__pyx_self, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst, PyObject *__pyx_v_map_type) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"statemap\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst_statemap(__pyx_v_ifst, __pyx_v_map_type, 0)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4034, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.statemap\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":4060\n * \n * \n * cpdef _MutableFst synchronize(_Fst ifst):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   synchronize(ifst)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_57synchronize(PyObject *__pyx_self, PyObject *__pyx_v_ifst); /*proto*/\nstatic struct __pyx_obj_9pywrapfst__MutableFst *__pyx_f_9pywrapfst_synchronize(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst, CYTHON_UNUSED int __pyx_skip_dispatch) {\n  std::unique_ptr<fst::script::VectorFstClass>  __pyx_v_tfst;\n  struct __pyx_obj_9pywrapfst__MutableFst *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"synchronize\", 0);\n\n  /* \"pywrapfst.pyx\":4080\n *   \"\"\"\n *   cdef unique_ptr[fst.VectorFstClass] tfst\n *   tfst.reset(new fst.VectorFstClass(ifst.arc_type()))             # <<<<<<<<<<<<<<\n *   fst.Synchronize(deref(ifst._fst), tfst.get())\n *   return _init_MutableFst(tfst.release())\n */\n  if (unlikely(((PyObject *)__pyx_v_ifst) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"arc_type\");\n    __PYX_ERR(0, 4080, __pyx_L1_error)\n  }\n  __pyx_v_tfst.reset(new fst::script::VectorFstClass(((struct __pyx_vtabstruct_9pywrapfst__Fst *)__pyx_v_ifst->__pyx_vtab)->arc_type(__pyx_v_ifst, 0)));\n\n  /* \"pywrapfst.pyx\":4081\n *   cdef unique_ptr[fst.VectorFstClass] tfst\n *   tfst.reset(new fst.VectorFstClass(ifst.arc_type()))\n *   fst.Synchronize(deref(ifst._fst), tfst.get())             # <<<<<<<<<<<<<<\n *   return _init_MutableFst(tfst.release())\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_ifst) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 4081, __pyx_L1_error)\n  }\n  fst::script::Synchronize((*__pyx_v_ifst->_fst), __pyx_v_tfst.get());\n\n  /* \"pywrapfst.pyx\":4082\n *   tfst.reset(new fst.VectorFstClass(ifst.arc_type()))\n *   fst.Synchronize(deref(ifst._fst), tfst.get())\n *   return _init_MutableFst(tfst.release())             # <<<<<<<<<<<<<<\n * \n * \n */\n  __Pyx_XDECREF(((PyObject *)__pyx_r));\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst__init_MutableFst(__pyx_v_tfst.release())); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4082, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = ((struct __pyx_obj_9pywrapfst__MutableFst *)__pyx_t_1);\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":4060\n * \n * \n * cpdef _MutableFst synchronize(_Fst ifst):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   synchronize(ifst)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.synchronize\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XGIVEREF((PyObject *)__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_57synchronize(PyObject *__pyx_self, PyObject *__pyx_v_ifst); /*proto*/\nstatic char __pyx_doc_9pywrapfst_56synchronize[] = \"\\n  synchronize(ifst)\\n\\n  Constructively synchronizes an FST.\\n\\n  This operation synchronizes a transducer. The result will be an equivalent\\n  FST that has the property that during the traversal of a path, the delay is\\n  either zero or strictly increasing, where the delay is the difference between\\n  the number of non-epsilon output labels and input labels along the path. For\\n  the algorithm to terminate, the input transducer must have bounded delay,\\n  i.e., the delay of every cycle must be zero.\\n\\n  Args:\\n    ifst: The input FST.\\n\\n  Returns:\\n    An equivalent synchronized FST.\\n  \";\nstatic PyObject *__pyx_pw_9pywrapfst_57synchronize(PyObject *__pyx_self, PyObject *__pyx_v_ifst) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"synchronize (wrapper)\", 0);\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_ifst), __pyx_ptype_9pywrapfst__Fst, 1, \"ifst\", 0))) __PYX_ERR(0, 4060, __pyx_L1_error)\n  __pyx_r = __pyx_pf_9pywrapfst_56synchronize(__pyx_self, ((struct __pyx_obj_9pywrapfst__Fst *)__pyx_v_ifst));\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_56synchronize(CYTHON_UNUSED PyObject *__pyx_self, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"synchronize\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst_synchronize(__pyx_v_ifst, 0)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4060, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.synchronize\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":4139\n *   \"\"\"\n * \n *   def __cinit__(self,             # <<<<<<<<<<<<<<\n *                 string fst_type=b\"vector\",\n *                 string arc_type=b\"standard\",\n */\n\n/* Python wrapper */\nstatic int __pyx_pw_9pywrapfst_8Compiler_1__cinit__(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic int __pyx_pw_9pywrapfst_8Compiler_1__cinit__(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  std::string __pyx_v_fst_type;\n  std::string __pyx_v_arc_type;\n  struct __pyx_obj_9pywrapfst_SymbolTable *__pyx_v_isymbols = 0;\n  struct __pyx_obj_9pywrapfst_SymbolTable *__pyx_v_osymbols = 0;\n  struct __pyx_obj_9pywrapfst_SymbolTable *__pyx_v_ssymbols = 0;\n  bool __pyx_v_acceptor;\n  bool __pyx_v_keep_isymbols;\n  bool __pyx_v_keep_osymbols;\n  bool __pyx_v_keep_state_numbering;\n  bool __pyx_v_allow_negative_labels;\n  int __pyx_r;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__cinit__ (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_fst_type,&__pyx_n_s_arc_type,&__pyx_n_s_isymbols,&__pyx_n_s_osymbols,&__pyx_n_s_ssymbols,&__pyx_n_s_acceptor,&__pyx_n_s_keep_isymbols,&__pyx_n_s_keep_osymbols,&__pyx_n_s_keep_state_numbering,&__pyx_n_s_allow_negative_labels,0};\n    PyObject* values[10] = {0,0,0,0,0,0,0,0,0,0};\n\n    /* \"pywrapfst.pyx\":4142\n *                 string fst_type=b\"vector\",\n *                 string arc_type=b\"standard\",\n *                 SymbolTable isymbols=None,             # <<<<<<<<<<<<<<\n *                 SymbolTable osymbols=None,\n *                 SymbolTable ssymbols=None,\n */\n    values[2] = (PyObject *)((struct __pyx_obj_9pywrapfst_SymbolTable *)Py_None);\n\n    /* \"pywrapfst.pyx\":4143\n *                 string arc_type=b\"standard\",\n *                 SymbolTable isymbols=None,\n *                 SymbolTable osymbols=None,             # <<<<<<<<<<<<<<\n *                 SymbolTable ssymbols=None,\n *                 bool acceptor=False,\n */\n    values[3] = (PyObject *)((struct __pyx_obj_9pywrapfst_SymbolTable *)Py_None);\n\n    /* \"pywrapfst.pyx\":4144\n *                 SymbolTable isymbols=None,\n *                 SymbolTable osymbols=None,\n *                 SymbolTable ssymbols=None,             # <<<<<<<<<<<<<<\n *                 bool acceptor=False,\n *                 bool keep_isymbols=False,\n */\n    values[4] = (PyObject *)((struct __pyx_obj_9pywrapfst_SymbolTable *)Py_None);\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case 10: values[9] = PyTuple_GET_ITEM(__pyx_args, 9);\n        CYTHON_FALLTHROUGH;\n        case  9: values[8] = PyTuple_GET_ITEM(__pyx_args, 8);\n        CYTHON_FALLTHROUGH;\n        case  8: values[7] = PyTuple_GET_ITEM(__pyx_args, 7);\n        CYTHON_FALLTHROUGH;\n        case  7: values[6] = PyTuple_GET_ITEM(__pyx_args, 6);\n        CYTHON_FALLTHROUGH;\n        case  6: values[5] = PyTuple_GET_ITEM(__pyx_args, 5);\n        CYTHON_FALLTHROUGH;\n        case  5: values[4] = PyTuple_GET_ITEM(__pyx_args, 4);\n        CYTHON_FALLTHROUGH;\n        case  4: values[3] = PyTuple_GET_ITEM(__pyx_args, 3);\n        CYTHON_FALLTHROUGH;\n        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);\n        CYTHON_FALLTHROUGH;\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_fst_type);\n          if (value) { values[0] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  1:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_arc_type);\n          if (value) { values[1] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  2:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_isymbols);\n          if (value) { values[2] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  3:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_osymbols);\n          if (value) { values[3] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  4:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_ssymbols);\n          if (value) { values[4] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  5:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_acceptor);\n          if (value) { values[5] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  6:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_keep_isymbols);\n          if (value) { values[6] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  7:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_keep_osymbols);\n          if (value) { values[7] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  8:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_keep_state_numbering);\n          if (value) { values[8] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  9:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_allow_negative_labels);\n          if (value) { values[9] = value; kw_args--; }\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"__cinit__\") < 0)) __PYX_ERR(0, 4139, __pyx_L3_error)\n      }\n    } else {\n      switch (PyTuple_GET_SIZE(__pyx_args)) {\n        case 10: values[9] = PyTuple_GET_ITEM(__pyx_args, 9);\n        CYTHON_FALLTHROUGH;\n        case  9: values[8] = PyTuple_GET_ITEM(__pyx_args, 8);\n        CYTHON_FALLTHROUGH;\n        case  8: values[7] = PyTuple_GET_ITEM(__pyx_args, 7);\n        CYTHON_FALLTHROUGH;\n        case  7: values[6] = PyTuple_GET_ITEM(__pyx_args, 6);\n        CYTHON_FALLTHROUGH;\n        case  6: values[5] = PyTuple_GET_ITEM(__pyx_args, 5);\n        CYTHON_FALLTHROUGH;\n        case  5: values[4] = PyTuple_GET_ITEM(__pyx_args, 4);\n        CYTHON_FALLTHROUGH;\n        case  4: values[3] = PyTuple_GET_ITEM(__pyx_args, 3);\n        CYTHON_FALLTHROUGH;\n        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);\n        CYTHON_FALLTHROUGH;\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n    }\n    if (values[0]) {\n      __pyx_v_fst_type = __pyx_convert_string_from_py_std__in_string(values[0]); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 4140, __pyx_L3_error)\n    } else {\n      __pyx_v_fst_type = __pyx_k__88;\n    }\n    if (values[1]) {\n      __pyx_v_arc_type = __pyx_convert_string_from_py_std__in_string(values[1]); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 4141, __pyx_L3_error)\n    } else {\n      __pyx_v_arc_type = __pyx_k__89;\n    }\n    __pyx_v_isymbols = ((struct __pyx_obj_9pywrapfst_SymbolTable *)values[2]);\n    __pyx_v_osymbols = ((struct __pyx_obj_9pywrapfst_SymbolTable *)values[3]);\n    __pyx_v_ssymbols = ((struct __pyx_obj_9pywrapfst_SymbolTable *)values[4]);\n    if (values[5]) {\n      __pyx_v_acceptor = __Pyx_PyObject_IsTrue(values[5]); if (unlikely((__pyx_v_acceptor == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 4145, __pyx_L3_error)\n    } else {\n\n      /* \"pywrapfst.pyx\":4145\n *                 SymbolTable osymbols=None,\n *                 SymbolTable ssymbols=None,\n *                 bool acceptor=False,             # <<<<<<<<<<<<<<\n *                 bool keep_isymbols=False,\n *                 bool keep_osymbols=False,\n */\n      __pyx_v_acceptor = ((bool)0);\n    }\n    if (values[6]) {\n      __pyx_v_keep_isymbols = __Pyx_PyObject_IsTrue(values[6]); if (unlikely((__pyx_v_keep_isymbols == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 4146, __pyx_L3_error)\n    } else {\n\n      /* \"pywrapfst.pyx\":4146\n *                 SymbolTable ssymbols=None,\n *                 bool acceptor=False,\n *                 bool keep_isymbols=False,             # <<<<<<<<<<<<<<\n *                 bool keep_osymbols=False,\n *                 bool keep_state_numbering=False,\n */\n      __pyx_v_keep_isymbols = ((bool)0);\n    }\n    if (values[7]) {\n      __pyx_v_keep_osymbols = __Pyx_PyObject_IsTrue(values[7]); if (unlikely((__pyx_v_keep_osymbols == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 4147, __pyx_L3_error)\n    } else {\n\n      /* \"pywrapfst.pyx\":4147\n *                 bool acceptor=False,\n *                 bool keep_isymbols=False,\n *                 bool keep_osymbols=False,             # <<<<<<<<<<<<<<\n *                 bool keep_state_numbering=False,\n *                 bool allow_negative_labels=False):\n */\n      __pyx_v_keep_osymbols = ((bool)0);\n    }\n    if (values[8]) {\n      __pyx_v_keep_state_numbering = __Pyx_PyObject_IsTrue(values[8]); if (unlikely((__pyx_v_keep_state_numbering == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 4148, __pyx_L3_error)\n    } else {\n\n      /* \"pywrapfst.pyx\":4148\n *                 bool keep_isymbols=False,\n *                 bool keep_osymbols=False,\n *                 bool keep_state_numbering=False,             # <<<<<<<<<<<<<<\n *                 bool allow_negative_labels=False):\n *     self._sstrm.reset(new stringstream())\n */\n      __pyx_v_keep_state_numbering = ((bool)0);\n    }\n    if (values[9]) {\n      __pyx_v_allow_negative_labels = __Pyx_PyObject_IsTrue(values[9]); if (unlikely((__pyx_v_allow_negative_labels == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 4149, __pyx_L3_error)\n    } else {\n\n      /* \"pywrapfst.pyx\":4149\n *                 bool keep_osymbols=False,\n *                 bool keep_state_numbering=False,\n *                 bool allow_negative_labels=False):             # <<<<<<<<<<<<<<\n *     self._sstrm.reset(new stringstream())\n *     self._fst_type = tostring(fst_type)\n */\n      __pyx_v_allow_negative_labels = ((bool)0);\n    }\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"__cinit__\", 0, 0, 10, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 4139, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst.Compiler.__cinit__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return -1;\n  __pyx_L4_argument_unpacking_done:;\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_isymbols), __pyx_ptype_9pywrapfst_SymbolTable, 1, \"isymbols\", 0))) __PYX_ERR(0, 4142, __pyx_L1_error)\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_osymbols), __pyx_ptype_9pywrapfst_SymbolTable, 1, \"osymbols\", 0))) __PYX_ERR(0, 4143, __pyx_L1_error)\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_ssymbols), __pyx_ptype_9pywrapfst_SymbolTable, 1, \"ssymbols\", 0))) __PYX_ERR(0, 4144, __pyx_L1_error)\n  __pyx_r = __pyx_pf_9pywrapfst_8Compiler___cinit__(((struct __pyx_obj_9pywrapfst_Compiler *)__pyx_v_self), __pyx_v_fst_type, __pyx_v_arc_type, __pyx_v_isymbols, __pyx_v_osymbols, __pyx_v_ssymbols, __pyx_v_acceptor, __pyx_v_keep_isymbols, __pyx_v_keep_osymbols, __pyx_v_keep_state_numbering, __pyx_v_allow_negative_labels);\n\n  /* \"pywrapfst.pyx\":4139\n *   \"\"\"\n * \n *   def __cinit__(self,             # <<<<<<<<<<<<<<\n *                 string fst_type=b\"vector\",\n *                 string arc_type=b\"standard\",\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __pyx_r = -1;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic int __pyx_pf_9pywrapfst_8Compiler___cinit__(struct __pyx_obj_9pywrapfst_Compiler *__pyx_v_self, std::string __pyx_v_fst_type, std::string __pyx_v_arc_type, struct __pyx_obj_9pywrapfst_SymbolTable *__pyx_v_isymbols, struct __pyx_obj_9pywrapfst_SymbolTable *__pyx_v_osymbols, struct __pyx_obj_9pywrapfst_SymbolTable *__pyx_v_ssymbols, bool __pyx_v_acceptor, bool __pyx_v_keep_isymbols, bool __pyx_v_keep_osymbols, bool __pyx_v_keep_state_numbering, bool __pyx_v_allow_negative_labels) {\n  int __pyx_r;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  std::string __pyx_t_2;\n  int __pyx_t_3;\n  int __pyx_t_4;\n  fst::SymbolTable *__pyx_t_5;\n  __Pyx_RefNannySetupContext(\"__cinit__\", 0);\n\n  /* \"pywrapfst.pyx\":4150\n *                 bool keep_state_numbering=False,\n *                 bool allow_negative_labels=False):\n *     self._sstrm.reset(new stringstream())             # <<<<<<<<<<<<<<\n *     self._fst_type = tostring(fst_type)\n *     self._arc_type = tostring(arc_type)\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_sstrm\");\n    __PYX_ERR(0, 4150, __pyx_L1_error)\n  }\n  __pyx_v_self->_sstrm.reset(new std::stringstream());\n\n  /* \"pywrapfst.pyx\":4151\n *                 bool allow_negative_labels=False):\n *     self._sstrm.reset(new stringstream())\n *     self._fst_type = tostring(fst_type)             # <<<<<<<<<<<<<<\n *     self._arc_type = tostring(arc_type)\n *     self._isymbols = NULL\n */\n  __pyx_t_1 = __pyx_convert_PyBytes_string_to_py_std__in_string(__pyx_v_fst_type); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4151, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_t_2 = __pyx_f_9pywrapfst_tostring(__pyx_t_1, NULL); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 4151, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst_type\");\n    __PYX_ERR(0, 4151, __pyx_L1_error)\n  }\n  __pyx_v_self->_fst_type = __pyx_t_2;\n\n  /* \"pywrapfst.pyx\":4152\n *     self._sstrm.reset(new stringstream())\n *     self._fst_type = tostring(fst_type)\n *     self._arc_type = tostring(arc_type)             # <<<<<<<<<<<<<<\n *     self._isymbols = NULL\n *     if isymbols is not None:\n */\n  __pyx_t_1 = __pyx_convert_PyBytes_string_to_py_std__in_string(__pyx_v_arc_type); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4152, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_t_2 = __pyx_f_9pywrapfst_tostring(__pyx_t_1, NULL); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 4152, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_arc_type\");\n    __PYX_ERR(0, 4152, __pyx_L1_error)\n  }\n  __pyx_v_self->_arc_type = __pyx_t_2;\n\n  /* \"pywrapfst.pyx\":4153\n *     self._fst_type = tostring(fst_type)\n *     self._arc_type = tostring(arc_type)\n *     self._isymbols = NULL             # <<<<<<<<<<<<<<\n *     if isymbols is not None:\n *       self._isymbols = isymbols._table\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_isymbols\");\n    __PYX_ERR(0, 4153, __pyx_L1_error)\n  }\n  __pyx_v_self->_isymbols = NULL;\n\n  /* \"pywrapfst.pyx\":4154\n *     self._arc_type = tostring(arc_type)\n *     self._isymbols = NULL\n *     if isymbols is not None:             # <<<<<<<<<<<<<<\n *       self._isymbols = isymbols._table\n *     self._osymbols = NULL\n */\n  __pyx_t_3 = (((PyObject *)__pyx_v_isymbols) != Py_None);\n  __pyx_t_4 = (__pyx_t_3 != 0);\n  if (__pyx_t_4) {\n\n    /* \"pywrapfst.pyx\":4155\n *     self._isymbols = NULL\n *     if isymbols is not None:\n *       self._isymbols = isymbols._table             # <<<<<<<<<<<<<<\n *     self._osymbols = NULL\n *     if osymbols is not None:\n */\n    if (unlikely(((PyObject *)__pyx_v_isymbols) == Py_None)) {\n      PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_table\");\n      __PYX_ERR(0, 4155, __pyx_L1_error)\n    }\n    __pyx_t_5 = __pyx_v_isymbols->__pyx_base.__pyx_base._table;\n    if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n      PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_isymbols\");\n      __PYX_ERR(0, 4155, __pyx_L1_error)\n    }\n    __pyx_v_self->_isymbols = __pyx_t_5;\n\n    /* \"pywrapfst.pyx\":4154\n *     self._arc_type = tostring(arc_type)\n *     self._isymbols = NULL\n *     if isymbols is not None:             # <<<<<<<<<<<<<<\n *       self._isymbols = isymbols._table\n *     self._osymbols = NULL\n */\n  }\n\n  /* \"pywrapfst.pyx\":4156\n *     if isymbols is not None:\n *       self._isymbols = isymbols._table\n *     self._osymbols = NULL             # <<<<<<<<<<<<<<\n *     if osymbols is not None:\n *       self._osymbols = osymbols._table\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_osymbols\");\n    __PYX_ERR(0, 4156, __pyx_L1_error)\n  }\n  __pyx_v_self->_osymbols = NULL;\n\n  /* \"pywrapfst.pyx\":4157\n *       self._isymbols = isymbols._table\n *     self._osymbols = NULL\n *     if osymbols is not None:             # <<<<<<<<<<<<<<\n *       self._osymbols = osymbols._table\n *     self._ssymbols = NULL\n */\n  __pyx_t_4 = (((PyObject *)__pyx_v_osymbols) != Py_None);\n  __pyx_t_3 = (__pyx_t_4 != 0);\n  if (__pyx_t_3) {\n\n    /* \"pywrapfst.pyx\":4158\n *     self._osymbols = NULL\n *     if osymbols is not None:\n *       self._osymbols = osymbols._table             # <<<<<<<<<<<<<<\n *     self._ssymbols = NULL\n *     if ssymbols is not None:\n */\n    if (unlikely(((PyObject *)__pyx_v_osymbols) == Py_None)) {\n      PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_table\");\n      __PYX_ERR(0, 4158, __pyx_L1_error)\n    }\n    __pyx_t_5 = __pyx_v_osymbols->__pyx_base.__pyx_base._table;\n    if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n      PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_osymbols\");\n      __PYX_ERR(0, 4158, __pyx_L1_error)\n    }\n    __pyx_v_self->_osymbols = __pyx_t_5;\n\n    /* \"pywrapfst.pyx\":4157\n *       self._isymbols = isymbols._table\n *     self._osymbols = NULL\n *     if osymbols is not None:             # <<<<<<<<<<<<<<\n *       self._osymbols = osymbols._table\n *     self._ssymbols = NULL\n */\n  }\n\n  /* \"pywrapfst.pyx\":4159\n *     if osymbols is not None:\n *       self._osymbols = osymbols._table\n *     self._ssymbols = NULL             # <<<<<<<<<<<<<<\n *     if ssymbols is not None:\n *       self._ssymbols = ssymbols._table\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_ssymbols\");\n    __PYX_ERR(0, 4159, __pyx_L1_error)\n  }\n  __pyx_v_self->_ssymbols = NULL;\n\n  /* \"pywrapfst.pyx\":4160\n *       self._osymbols = osymbols._table\n *     self._ssymbols = NULL\n *     if ssymbols is not None:             # <<<<<<<<<<<<<<\n *       self._ssymbols = ssymbols._table\n *     self._acceptor = acceptor\n */\n  __pyx_t_3 = (((PyObject *)__pyx_v_ssymbols) != Py_None);\n  __pyx_t_4 = (__pyx_t_3 != 0);\n  if (__pyx_t_4) {\n\n    /* \"pywrapfst.pyx\":4161\n *     self._ssymbols = NULL\n *     if ssymbols is not None:\n *       self._ssymbols = ssymbols._table             # <<<<<<<<<<<<<<\n *     self._acceptor = acceptor\n *     self._keep_isymbols = keep_isymbols\n */\n    if (unlikely(((PyObject *)__pyx_v_ssymbols) == Py_None)) {\n      PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_table\");\n      __PYX_ERR(0, 4161, __pyx_L1_error)\n    }\n    __pyx_t_5 = __pyx_v_ssymbols->__pyx_base.__pyx_base._table;\n    if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n      PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_ssymbols\");\n      __PYX_ERR(0, 4161, __pyx_L1_error)\n    }\n    __pyx_v_self->_ssymbols = __pyx_t_5;\n\n    /* \"pywrapfst.pyx\":4160\n *       self._osymbols = osymbols._table\n *     self._ssymbols = NULL\n *     if ssymbols is not None:             # <<<<<<<<<<<<<<\n *       self._ssymbols = ssymbols._table\n *     self._acceptor = acceptor\n */\n  }\n\n  /* \"pywrapfst.pyx\":4162\n *     if ssymbols is not None:\n *       self._ssymbols = ssymbols._table\n *     self._acceptor = acceptor             # <<<<<<<<<<<<<<\n *     self._keep_isymbols = keep_isymbols\n *     self._keep_osymbols = keep_osymbols\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_acceptor\");\n    __PYX_ERR(0, 4162, __pyx_L1_error)\n  }\n  __pyx_v_self->_acceptor = __pyx_v_acceptor;\n\n  /* \"pywrapfst.pyx\":4163\n *       self._ssymbols = ssymbols._table\n *     self._acceptor = acceptor\n *     self._keep_isymbols = keep_isymbols             # <<<<<<<<<<<<<<\n *     self._keep_osymbols = keep_osymbols\n *     self._keep_state_numbering = keep_state_numbering\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_keep_isymbols\");\n    __PYX_ERR(0, 4163, __pyx_L1_error)\n  }\n  __pyx_v_self->_keep_isymbols = __pyx_v_keep_isymbols;\n\n  /* \"pywrapfst.pyx\":4164\n *     self._acceptor = acceptor\n *     self._keep_isymbols = keep_isymbols\n *     self._keep_osymbols = keep_osymbols             # <<<<<<<<<<<<<<\n *     self._keep_state_numbering = keep_state_numbering\n *     self._allow_negative_labels = allow_negative_labels\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_keep_osymbols\");\n    __PYX_ERR(0, 4164, __pyx_L1_error)\n  }\n  __pyx_v_self->_keep_osymbols = __pyx_v_keep_osymbols;\n\n  /* \"pywrapfst.pyx\":4165\n *     self._keep_isymbols = keep_isymbols\n *     self._keep_osymbols = keep_osymbols\n *     self._keep_state_numbering = keep_state_numbering             # <<<<<<<<<<<<<<\n *     self._allow_negative_labels = allow_negative_labels\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_keep_state_numbering\");\n    __PYX_ERR(0, 4165, __pyx_L1_error)\n  }\n  __pyx_v_self->_keep_state_numbering = __pyx_v_keep_state_numbering;\n\n  /* \"pywrapfst.pyx\":4166\n *     self._keep_osymbols = keep_osymbols\n *     self._keep_state_numbering = keep_state_numbering\n *     self._allow_negative_labels = allow_negative_labels             # <<<<<<<<<<<<<<\n * \n *   cpdef _Fst compile(self):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_allow_negative_labels\");\n    __PYX_ERR(0, 4166, __pyx_L1_error)\n  }\n  __pyx_v_self->_allow_negative_labels = __pyx_v_allow_negative_labels;\n\n  /* \"pywrapfst.pyx\":4139\n *   \"\"\"\n * \n *   def __cinit__(self,             # <<<<<<<<<<<<<<\n *                 string fst_type=b\"vector\",\n *                 string arc_type=b\"standard\",\n */\n\n  /* function exit code */\n  __pyx_r = 0;\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.Compiler.__cinit__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = -1;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":4168\n *     self._allow_negative_labels = allow_negative_labels\n * \n *   cpdef _Fst compile(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     compile()\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_8Compiler_3compile(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic struct __pyx_obj_9pywrapfst__Fst *__pyx_f_9pywrapfst_8Compiler_compile(struct __pyx_obj_9pywrapfst_Compiler *__pyx_v_self, int __pyx_skip_dispatch) {\n  std::unique_ptr<fst::script::FstClass>  __pyx_v_tfst;\n  struct __pyx_obj_9pywrapfst__Fst *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  std::string __pyx_t_5;\n  int __pyx_t_6;\n  __Pyx_RefNannySetupContext(\"compile\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_compile); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4168, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_8Compiler_3compile)) {\n      __Pyx_XDECREF(((PyObject *)__pyx_r));\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 4168, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 4168, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      if (!(likely(((__pyx_t_2) == Py_None) || likely(__Pyx_TypeTest(__pyx_t_2, __pyx_ptype_9pywrapfst__Fst))))) __PYX_ERR(0, 4168, __pyx_L1_error)\n      __pyx_r = ((struct __pyx_obj_9pywrapfst__Fst *)__pyx_t_2);\n      __pyx_t_2 = 0;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":4183\n *     \"\"\"\n *     cdef unique_ptr[fst.FstClass] tfst\n *     tfst.reset(fst.CompileFstInternal(deref(self._sstrm),             # <<<<<<<<<<<<<<\n *         b\"<pywrapfst>\", self._fst_type, self._arc_type, self._isymbols,\n *         self._osymbols, self._ssymbols, self._acceptor, self._keep_isymbols,\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_sstrm\");\n    __PYX_ERR(0, 4183, __pyx_L1_error)\n  }\n\n  /* \"pywrapfst.pyx\":4184\n *     cdef unique_ptr[fst.FstClass] tfst\n *     tfst.reset(fst.CompileFstInternal(deref(self._sstrm),\n *         b\"<pywrapfst>\", self._fst_type, self._arc_type, self._isymbols,             # <<<<<<<<<<<<<<\n *         self._osymbols, self._ssymbols, self._acceptor, self._keep_isymbols,\n *         self._keep_osymbols, self._keep_state_numbering,\n */\n  __pyx_t_5 = __pyx_convert_string_from_py_std__in_string(__pyx_kp_b_pywrapfst); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 4184, __pyx_L1_error)\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst_type\");\n    __PYX_ERR(0, 4184, __pyx_L1_error)\n  }\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_arc_type\");\n    __PYX_ERR(0, 4184, __pyx_L1_error)\n  }\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_isymbols\");\n    __PYX_ERR(0, 4184, __pyx_L1_error)\n  }\n\n  /* \"pywrapfst.pyx\":4185\n *     tfst.reset(fst.CompileFstInternal(deref(self._sstrm),\n *         b\"<pywrapfst>\", self._fst_type, self._arc_type, self._isymbols,\n *         self._osymbols, self._ssymbols, self._acceptor, self._keep_isymbols,             # <<<<<<<<<<<<<<\n *         self._keep_osymbols, self._keep_state_numbering,\n *         self._allow_negative_labels))\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_osymbols\");\n    __PYX_ERR(0, 4185, __pyx_L1_error)\n  }\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_ssymbols\");\n    __PYX_ERR(0, 4185, __pyx_L1_error)\n  }\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_acceptor\");\n    __PYX_ERR(0, 4185, __pyx_L1_error)\n  }\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_keep_isymbols\");\n    __PYX_ERR(0, 4185, __pyx_L1_error)\n  }\n\n  /* \"pywrapfst.pyx\":4186\n *         b\"<pywrapfst>\", self._fst_type, self._arc_type, self._isymbols,\n *         self._osymbols, self._ssymbols, self._acceptor, self._keep_isymbols,\n *         self._keep_osymbols, self._keep_state_numbering,             # <<<<<<<<<<<<<<\n *         self._allow_negative_labels))\n *     self._sstrm.reset(new stringstream())\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_keep_osymbols\");\n    __PYX_ERR(0, 4186, __pyx_L1_error)\n  }\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_keep_state_numbering\");\n    __PYX_ERR(0, 4186, __pyx_L1_error)\n  }\n\n  /* \"pywrapfst.pyx\":4187\n *         self._osymbols, self._ssymbols, self._acceptor, self._keep_isymbols,\n *         self._keep_osymbols, self._keep_state_numbering,\n *         self._allow_negative_labels))             # <<<<<<<<<<<<<<\n *     self._sstrm.reset(new stringstream())\n *     if tfst.get() == NULL:\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_allow_negative_labels\");\n    __PYX_ERR(0, 4187, __pyx_L1_error)\n  }\n\n  /* \"pywrapfst.pyx\":4183\n *     \"\"\"\n *     cdef unique_ptr[fst.FstClass] tfst\n *     tfst.reset(fst.CompileFstInternal(deref(self._sstrm),             # <<<<<<<<<<<<<<\n *         b\"<pywrapfst>\", self._fst_type, self._arc_type, self._isymbols,\n *         self._osymbols, self._ssymbols, self._acceptor, self._keep_isymbols,\n */\n  __pyx_v_tfst.reset(fst::script::CompileFstInternal((*__pyx_v_self->_sstrm), __pyx_t_5, __pyx_v_self->_fst_type, __pyx_v_self->_arc_type, __pyx_v_self->_isymbols, __pyx_v_self->_osymbols, __pyx_v_self->_ssymbols, __pyx_v_self->_acceptor, __pyx_v_self->_keep_isymbols, __pyx_v_self->_keep_osymbols, __pyx_v_self->_keep_state_numbering, __pyx_v_self->_allow_negative_labels));\n\n  /* \"pywrapfst.pyx\":4188\n *         self._keep_osymbols, self._keep_state_numbering,\n *         self._allow_negative_labels))\n *     self._sstrm.reset(new stringstream())             # <<<<<<<<<<<<<<\n *     if tfst.get() == NULL:\n *       raise FstOpError(\"Compilation failed\")\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_sstrm\");\n    __PYX_ERR(0, 4188, __pyx_L1_error)\n  }\n  __pyx_v_self->_sstrm.reset(new std::stringstream());\n\n  /* \"pywrapfst.pyx\":4189\n *         self._allow_negative_labels))\n *     self._sstrm.reset(new stringstream())\n *     if tfst.get() == NULL:             # <<<<<<<<<<<<<<\n *       raise FstOpError(\"Compilation failed\")\n *     return _init_XFst(tfst.release())\n */\n  __pyx_t_6 = ((__pyx_v_tfst.get() == NULL) != 0);\n  if (__pyx_t_6) {\n\n    /* \"pywrapfst.pyx\":4190\n *     self._sstrm.reset(new stringstream())\n *     if tfst.get() == NULL:\n *       raise FstOpError(\"Compilation failed\")             # <<<<<<<<<<<<<<\n *     return _init_XFst(tfst.release())\n * \n */\n    __pyx_t_1 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstOpError); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4190, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    __pyx_t_2 = __Pyx_PyObject_Call(__pyx_t_1, __pyx_tuple__90, NULL); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 4190, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_2);\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n    __Pyx_Raise(__pyx_t_2, 0, 0, 0);\n    __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n    __PYX_ERR(0, 4190, __pyx_L1_error)\n\n    /* \"pywrapfst.pyx\":4189\n *         self._allow_negative_labels))\n *     self._sstrm.reset(new stringstream())\n *     if tfst.get() == NULL:             # <<<<<<<<<<<<<<\n *       raise FstOpError(\"Compilation failed\")\n *     return _init_XFst(tfst.release())\n */\n  }\n\n  /* \"pywrapfst.pyx\":4191\n *     if tfst.get() == NULL:\n *       raise FstOpError(\"Compilation failed\")\n *     return _init_XFst(tfst.release())             # <<<<<<<<<<<<<<\n * \n *   cpdef void write(self, expression):\n */\n  __Pyx_XDECREF(((PyObject *)__pyx_r));\n  __pyx_t_2 = ((PyObject *)__pyx_f_9pywrapfst__init_XFst(__pyx_v_tfst.release())); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 4191, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  __pyx_r = ((struct __pyx_obj_9pywrapfst__Fst *)__pyx_t_2);\n  __pyx_t_2 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":4168\n *     self._allow_negative_labels = allow_negative_labels\n * \n *   cpdef _Fst compile(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     compile()\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_AddTraceback(\"pywrapfst.Compiler.compile\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XGIVEREF((PyObject *)__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_8Compiler_3compile(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_8Compiler_2compile[] = \"\\n    compile()\\n\\n    Compiles the FST in the compiler string buffer.\\n\\n    This method compiles the FST and returns the resulting machine.\\n\\n    Returns:\\n      The FST described by the compiler string buffer.\\n\\n    Raises:\\n      FstOpError: Compilation failed.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_8Compiler_3compile(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"compile (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_8Compiler_2compile(((struct __pyx_obj_9pywrapfst_Compiler *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_8Compiler_2compile(struct __pyx_obj_9pywrapfst_Compiler *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"compile\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst_8Compiler_compile(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4168, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.Compiler.compile\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":4193\n *     return _init_XFst(tfst.release())\n * \n *   cpdef void write(self, expression):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     write(expression)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_8Compiler_5write(PyObject *__pyx_v_self, PyObject *__pyx_v_expression); /*proto*/\nstatic void __pyx_f_9pywrapfst_8Compiler_write(struct __pyx_obj_9pywrapfst_Compiler *__pyx_v_self, PyObject *__pyx_v_expression, int __pyx_skip_dispatch) {\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  std::string __pyx_t_6;\n  __Pyx_RefNannySetupContext(\"write\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_write); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4193, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_8Compiler_5write)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (!__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_v_expression); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 4193, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_2);\n      } else {\n        #if CYTHON_FAST_PYCALL\n        if (PyFunction_Check(__pyx_t_3)) {\n          PyObject *__pyx_temp[2] = {__pyx_t_4, __pyx_v_expression};\n          __pyx_t_2 = __Pyx_PyFunction_FastCall(__pyx_t_3, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 4193, __pyx_L1_error)\n          __Pyx_XDECREF(__pyx_t_4); __pyx_t_4 = 0;\n          __Pyx_GOTREF(__pyx_t_2);\n        } else\n        #endif\n        #if CYTHON_FAST_PYCCALL\n        if (__Pyx_PyFastCFunction_Check(__pyx_t_3)) {\n          PyObject *__pyx_temp[2] = {__pyx_t_4, __pyx_v_expression};\n          __pyx_t_2 = __Pyx_PyCFunction_FastCall(__pyx_t_3, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 4193, __pyx_L1_error)\n          __Pyx_XDECREF(__pyx_t_4); __pyx_t_4 = 0;\n          __Pyx_GOTREF(__pyx_t_2);\n        } else\n        #endif\n        {\n          __pyx_t_5 = PyTuple_New(1+1); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 4193, __pyx_L1_error)\n          __Pyx_GOTREF(__pyx_t_5);\n          __Pyx_GIVEREF(__pyx_t_4); PyTuple_SET_ITEM(__pyx_t_5, 0, __pyx_t_4); __pyx_t_4 = NULL;\n          __Pyx_INCREF(__pyx_v_expression);\n          __Pyx_GIVEREF(__pyx_v_expression);\n          PyTuple_SET_ITEM(__pyx_t_5, 0+1, __pyx_v_expression);\n          __pyx_t_2 = __Pyx_PyObject_Call(__pyx_t_3, __pyx_t_5, NULL); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 4193, __pyx_L1_error)\n          __Pyx_GOTREF(__pyx_t_2);\n          __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n        }\n      }\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":4209\n *       expression: A string expression to add to compiler string buffer.\n *     \"\"\"\n *     deref(self._sstrm) << tostring(expression)             # <<<<<<<<<<<<<<\n * \n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_sstrm\");\n    __PYX_ERR(0, 4209, __pyx_L1_error)\n  }\n  __pyx_t_6 = __pyx_f_9pywrapfst_tostring(__pyx_v_expression, NULL); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 4209, __pyx_L1_error)\n  ((*__pyx_v_self->_sstrm) << __pyx_t_6);\n\n  /* \"pywrapfst.pyx\":4193\n *     return _init_XFst(tfst.release())\n * \n *   cpdef void write(self, expression):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     write(expression)\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_WriteUnraisable(\"pywrapfst.Compiler.write\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_8Compiler_5write(PyObject *__pyx_v_self, PyObject *__pyx_v_expression); /*proto*/\nstatic char __pyx_doc_9pywrapfst_8Compiler_4write[] = \"\\n    write(expression)\\n\\n    Writes a string into the compiler string buffer.\\n\\n    This method adds a line to the compiler string buffer. It is normally\\n    invoked using the right shift operator, like so:\\n\\n        compiler = fst.Compiler()\\n        print >> compiler, \\\"0 0 49 49\\\"\\n        print >> compiler, \\\"0\\\"\\n\\n    Args:\\n      expression: A string expression to add to compiler string buffer.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_8Compiler_5write(PyObject *__pyx_v_self, PyObject *__pyx_v_expression) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"write (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_8Compiler_4write(((struct __pyx_obj_9pywrapfst_Compiler *)__pyx_v_self), ((PyObject *)__pyx_v_expression));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_8Compiler_4write(struct __pyx_obj_9pywrapfst_Compiler *__pyx_v_self, PyObject *__pyx_v_expression) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"write\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __Pyx_void_to_None(__pyx_f_9pywrapfst_8Compiler_write(__pyx_v_self, __pyx_v_expression, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4193, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.Compiler.write\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"(tree fragment)\":1\n * def __reduce_cython__(self):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"no default __reduce__ due to non-trivial __cinit__\")\n * def __setstate_cython__(self, __pyx_state):\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_8Compiler_7__reduce_cython__(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_8Compiler_7__reduce_cython__(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__reduce_cython__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_8Compiler_6__reduce_cython__(((struct __pyx_obj_9pywrapfst_Compiler *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_8Compiler_6__reduce_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst_Compiler *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"__reduce_cython__\", 0);\n\n  /* \"(tree fragment)\":2\n * def __reduce_cython__(self):\n *     raise TypeError(\"no default __reduce__ due to non-trivial __cinit__\")             # <<<<<<<<<<<<<<\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"no default __reduce__ due to non-trivial __cinit__\")\n */\n  __pyx_t_1 = __Pyx_PyObject_Call(__pyx_builtin_TypeError, __pyx_tuple__91, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(1, 2, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __Pyx_Raise(__pyx_t_1, 0, 0, 0);\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  __PYX_ERR(1, 2, __pyx_L1_error)\n\n  /* \"(tree fragment)\":1\n * def __reduce_cython__(self):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"no default __reduce__ due to non-trivial __cinit__\")\n * def __setstate_cython__(self, __pyx_state):\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.Compiler.__reduce_cython__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"(tree fragment)\":3\n * def __reduce_cython__(self):\n *     raise TypeError(\"no default __reduce__ due to non-trivial __cinit__\")\n * def __setstate_cython__(self, __pyx_state):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"no default __reduce__ due to non-trivial __cinit__\")\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_8Compiler_9__setstate_cython__(PyObject *__pyx_v_self, PyObject *__pyx_v___pyx_state); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_8Compiler_9__setstate_cython__(PyObject *__pyx_v_self, PyObject *__pyx_v___pyx_state) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__setstate_cython__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_8Compiler_8__setstate_cython__(((struct __pyx_obj_9pywrapfst_Compiler *)__pyx_v_self), ((PyObject *)__pyx_v___pyx_state));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_8Compiler_8__setstate_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst_Compiler *__pyx_v_self, CYTHON_UNUSED PyObject *__pyx_v___pyx_state) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"__setstate_cython__\", 0);\n\n  /* \"(tree fragment)\":4\n *     raise TypeError(\"no default __reduce__ due to non-trivial __cinit__\")\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"no default __reduce__ due to non-trivial __cinit__\")             # <<<<<<<<<<<<<<\n */\n  __pyx_t_1 = __Pyx_PyObject_Call(__pyx_builtin_TypeError, __pyx_tuple__92, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(1, 4, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __Pyx_Raise(__pyx_t_1, 0, 0, 0);\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  __PYX_ERR(1, 4, __pyx_L1_error)\n\n  /* \"(tree fragment)\":3\n * def __reduce_cython__(self):\n *     raise TypeError(\"no default __reduce__ due to non-trivial __cinit__\")\n * def __setstate_cython__(self, __pyx_state):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"no default __reduce__ due to non-trivial __cinit__\")\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.Compiler.__setstate_cython__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":4231\n *   \"\"\"\n * \n *   def __init__(self):             # <<<<<<<<<<<<<<\n *     raise FstDeletedConstructorError(\n *         \"Cannot construct {}\".format(self.__class__.__name__))\n */\n\n/* Python wrapper */\nstatic int __pyx_pw_9pywrapfst_9FarReader_1__init__(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic int __pyx_pw_9pywrapfst_9FarReader_1__init__(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  int __pyx_r;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__init__ (wrapper)\", 0);\n  if (unlikely(PyTuple_GET_SIZE(__pyx_args) > 0)) {\n    __Pyx_RaiseArgtupleInvalid(\"__init__\", 1, 0, 0, PyTuple_GET_SIZE(__pyx_args)); return -1;}\n  if (unlikely(__pyx_kwds) && unlikely(PyDict_Size(__pyx_kwds) > 0) && unlikely(!__Pyx_CheckKeywordStrings(__pyx_kwds, \"__init__\", 0))) return -1;\n  __pyx_r = __pyx_pf_9pywrapfst_9FarReader___init__(((struct __pyx_obj_9pywrapfst_FarReader *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic int __pyx_pf_9pywrapfst_9FarReader___init__(struct __pyx_obj_9pywrapfst_FarReader *__pyx_v_self) {\n  int __pyx_r;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  PyObject *__pyx_t_6 = NULL;\n  PyObject *__pyx_t_7 = NULL;\n  __Pyx_RefNannySetupContext(\"__init__\", 0);\n\n  /* \"pywrapfst.pyx\":4232\n * \n *   def __init__(self):\n *     raise FstDeletedConstructorError(             # <<<<<<<<<<<<<<\n *         \"Cannot construct {}\".format(self.__class__.__name__))\n * \n */\n  __pyx_t_2 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstDeletedConstructorError); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 4232, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n\n  /* \"pywrapfst.pyx\":4233\n *   def __init__(self):\n *     raise FstDeletedConstructorError(\n *         \"Cannot construct {}\".format(self.__class__.__name__))             # <<<<<<<<<<<<<<\n * \n *   def __repr__(self):\n */\n  __pyx_t_4 = __Pyx_PyObject_GetAttrStr(__pyx_kp_s_Cannot_construct, __pyx_n_s_format); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 4233, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_4);\n  __pyx_t_5 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_class); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 4233, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_5);\n  __pyx_t_6 = __Pyx_PyObject_GetAttrStr(__pyx_t_5, __pyx_n_s_name); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 4233, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_6);\n  __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n  __pyx_t_5 = NULL;\n  if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_4))) {\n    __pyx_t_5 = PyMethod_GET_SELF(__pyx_t_4);\n    if (likely(__pyx_t_5)) {\n      PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_4);\n      __Pyx_INCREF(__pyx_t_5);\n      __Pyx_INCREF(function);\n      __Pyx_DECREF_SET(__pyx_t_4, function);\n    }\n  }\n  if (!__pyx_t_5) {\n    __pyx_t_3 = __Pyx_PyObject_CallOneArg(__pyx_t_4, __pyx_t_6); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 4233, __pyx_L1_error)\n    __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n    __Pyx_GOTREF(__pyx_t_3);\n  } else {\n    #if CYTHON_FAST_PYCALL\n    if (PyFunction_Check(__pyx_t_4)) {\n      PyObject *__pyx_temp[2] = {__pyx_t_5, __pyx_t_6};\n      __pyx_t_3 = __Pyx_PyFunction_FastCall(__pyx_t_4, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 4233, __pyx_L1_error)\n      __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;\n      __Pyx_GOTREF(__pyx_t_3);\n      __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n    } else\n    #endif\n    #if CYTHON_FAST_PYCCALL\n    if (__Pyx_PyFastCFunction_Check(__pyx_t_4)) {\n      PyObject *__pyx_temp[2] = {__pyx_t_5, __pyx_t_6};\n      __pyx_t_3 = __Pyx_PyCFunction_FastCall(__pyx_t_4, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 4233, __pyx_L1_error)\n      __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;\n      __Pyx_GOTREF(__pyx_t_3);\n      __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n    } else\n    #endif\n    {\n      __pyx_t_7 = PyTuple_New(1+1); if (unlikely(!__pyx_t_7)) __PYX_ERR(0, 4233, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_7);\n      __Pyx_GIVEREF(__pyx_t_5); PyTuple_SET_ITEM(__pyx_t_7, 0, __pyx_t_5); __pyx_t_5 = NULL;\n      __Pyx_GIVEREF(__pyx_t_6);\n      PyTuple_SET_ITEM(__pyx_t_7, 0+1, __pyx_t_6);\n      __pyx_t_6 = 0;\n      __pyx_t_3 = __Pyx_PyObject_Call(__pyx_t_4, __pyx_t_7, NULL); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 4233, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_3);\n      __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0;\n    }\n  }\n  __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n  __pyx_t_4 = NULL;\n  if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_2))) {\n    __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_2);\n    if (likely(__pyx_t_4)) {\n      PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_2);\n      __Pyx_INCREF(__pyx_t_4);\n      __Pyx_INCREF(function);\n      __Pyx_DECREF_SET(__pyx_t_2, function);\n    }\n  }\n  if (!__pyx_t_4) {\n    __pyx_t_1 = __Pyx_PyObject_CallOneArg(__pyx_t_2, __pyx_t_3); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4232, __pyx_L1_error)\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    __Pyx_GOTREF(__pyx_t_1);\n  } else {\n    #if CYTHON_FAST_PYCALL\n    if (PyFunction_Check(__pyx_t_2)) {\n      PyObject *__pyx_temp[2] = {__pyx_t_4, __pyx_t_3};\n      __pyx_t_1 = __Pyx_PyFunction_FastCall(__pyx_t_2, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4232, __pyx_L1_error)\n      __Pyx_XDECREF(__pyx_t_4); __pyx_t_4 = 0;\n      __Pyx_GOTREF(__pyx_t_1);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    } else\n    #endif\n    #if CYTHON_FAST_PYCCALL\n    if (__Pyx_PyFastCFunction_Check(__pyx_t_2)) {\n      PyObject *__pyx_temp[2] = {__pyx_t_4, __pyx_t_3};\n      __pyx_t_1 = __Pyx_PyCFunction_FastCall(__pyx_t_2, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4232, __pyx_L1_error)\n      __Pyx_XDECREF(__pyx_t_4); __pyx_t_4 = 0;\n      __Pyx_GOTREF(__pyx_t_1);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    } else\n    #endif\n    {\n      __pyx_t_7 = PyTuple_New(1+1); if (unlikely(!__pyx_t_7)) __PYX_ERR(0, 4232, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_7);\n      __Pyx_GIVEREF(__pyx_t_4); PyTuple_SET_ITEM(__pyx_t_7, 0, __pyx_t_4); __pyx_t_4 = NULL;\n      __Pyx_GIVEREF(__pyx_t_3);\n      PyTuple_SET_ITEM(__pyx_t_7, 0+1, __pyx_t_3);\n      __pyx_t_3 = 0;\n      __pyx_t_1 = __Pyx_PyObject_Call(__pyx_t_2, __pyx_t_7, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4232, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_1);\n      __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0;\n    }\n  }\n  __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n  __Pyx_Raise(__pyx_t_1, 0, 0, 0);\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  __PYX_ERR(0, 4232, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":4231\n *   \"\"\"\n * \n *   def __init__(self):             # <<<<<<<<<<<<<<\n *     raise FstDeletedConstructorError(\n *         \"Cannot construct {}\".format(self.__class__.__name__))\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_XDECREF(__pyx_t_6);\n  __Pyx_XDECREF(__pyx_t_7);\n  __Pyx_AddTraceback(\"pywrapfst.FarReader.__init__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = -1;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":4235\n *         \"Cannot construct {}\".format(self.__class__.__name__))\n * \n *   def __repr__(self):             # <<<<<<<<<<<<<<\n *     return \"<{} FarReader at 0x{:x}>\".format(self.far_type(), id(self))\n * \n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_9FarReader_3__repr__(PyObject *__pyx_v_self); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_9FarReader_3__repr__(PyObject *__pyx_v_self) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__repr__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_9FarReader_2__repr__(((struct __pyx_obj_9pywrapfst_FarReader *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_9FarReader_2__repr__(struct __pyx_obj_9pywrapfst_FarReader *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  int __pyx_t_6;\n  PyObject *__pyx_t_7 = NULL;\n  __Pyx_RefNannySetupContext(\"__repr__\", 0);\n\n  /* \"pywrapfst.pyx\":4236\n * \n *   def __repr__(self):\n *     return \"<{} FarReader at 0x{:x}>\".format(self.far_type(), id(self))             # <<<<<<<<<<<<<<\n * \n *   @classmethod\n */\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_2 = __Pyx_PyObject_GetAttrStr(__pyx_kp_s_FarReader_at_0x_x, __pyx_n_s_format); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 4236, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"far_type\");\n    __PYX_ERR(0, 4236, __pyx_L1_error)\n  }\n  __pyx_t_3 = __pyx_convert_PyBytes_string_to_py_std__in_string(((struct __pyx_vtabstruct_9pywrapfst_FarReader *)__pyx_v_self->__pyx_vtab)->far_type(__pyx_v_self, 0)); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 4236, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_3);\n  __pyx_t_4 = PyTuple_New(1); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 4236, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_4);\n  __Pyx_INCREF(((PyObject *)__pyx_v_self));\n  __Pyx_GIVEREF(((PyObject *)__pyx_v_self));\n  PyTuple_SET_ITEM(__pyx_t_4, 0, ((PyObject *)__pyx_v_self));\n  __pyx_t_5 = __Pyx_PyObject_Call(__pyx_builtin_id, __pyx_t_4, NULL); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 4236, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_5);\n  __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n  __pyx_t_4 = NULL;\n  __pyx_t_6 = 0;\n  if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_2))) {\n    __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_2);\n    if (likely(__pyx_t_4)) {\n      PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_2);\n      __Pyx_INCREF(__pyx_t_4);\n      __Pyx_INCREF(function);\n      __Pyx_DECREF_SET(__pyx_t_2, function);\n      __pyx_t_6 = 1;\n    }\n  }\n  #if CYTHON_FAST_PYCALL\n  if (PyFunction_Check(__pyx_t_2)) {\n    PyObject *__pyx_temp[3] = {__pyx_t_4, __pyx_t_3, __pyx_t_5};\n    __pyx_t_1 = __Pyx_PyFunction_FastCall(__pyx_t_2, __pyx_temp+1-__pyx_t_6, 2+__pyx_t_6); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4236, __pyx_L1_error)\n    __Pyx_XDECREF(__pyx_t_4); __pyx_t_4 = 0;\n    __Pyx_GOTREF(__pyx_t_1);\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n  } else\n  #endif\n  #if CYTHON_FAST_PYCCALL\n  if (__Pyx_PyFastCFunction_Check(__pyx_t_2)) {\n    PyObject *__pyx_temp[3] = {__pyx_t_4, __pyx_t_3, __pyx_t_5};\n    __pyx_t_1 = __Pyx_PyCFunction_FastCall(__pyx_t_2, __pyx_temp+1-__pyx_t_6, 2+__pyx_t_6); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4236, __pyx_L1_error)\n    __Pyx_XDECREF(__pyx_t_4); __pyx_t_4 = 0;\n    __Pyx_GOTREF(__pyx_t_1);\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n  } else\n  #endif\n  {\n    __pyx_t_7 = PyTuple_New(2+__pyx_t_6); if (unlikely(!__pyx_t_7)) __PYX_ERR(0, 4236, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_7);\n    if (__pyx_t_4) {\n      __Pyx_GIVEREF(__pyx_t_4); PyTuple_SET_ITEM(__pyx_t_7, 0, __pyx_t_4); __pyx_t_4 = NULL;\n    }\n    __Pyx_GIVEREF(__pyx_t_3);\n    PyTuple_SET_ITEM(__pyx_t_7, 0+__pyx_t_6, __pyx_t_3);\n    __Pyx_GIVEREF(__pyx_t_5);\n    PyTuple_SET_ITEM(__pyx_t_7, 1+__pyx_t_6, __pyx_t_5);\n    __pyx_t_3 = 0;\n    __pyx_t_5 = 0;\n    __pyx_t_1 = __Pyx_PyObject_Call(__pyx_t_2, __pyx_t_7, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4236, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0;\n  }\n  __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":4235\n *         \"Cannot construct {}\".format(self.__class__.__name__))\n * \n *   def __repr__(self):             # <<<<<<<<<<<<<<\n *     return \"<{} FarReader at 0x{:x}>\".format(self.far_type(), id(self))\n * \n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_XDECREF(__pyx_t_7);\n  __Pyx_AddTraceback(\"pywrapfst.FarReader.__repr__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":4239\n * \n *   @classmethod\n *   def open(cls, *filenames):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     FarReader.open(*filenames)\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_9FarReader_5open(PyObject *__pyx_v_cls, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic char __pyx_doc_9pywrapfst_9FarReader_4open[] = \"\\n    FarReader.open(*filenames)\\n\\n    Creates a FarReader object.\\n\\n    This class method creates a FarReader given the string location of one or\\n    more FAR files on disk.\\n\\n    Args:\\n      *filenames: The string location of one or more input FAR files.\\n\\n    Returns:\\n      A new FarReader instance.\\n\\n    Raises:\\n      FstIOError: Read failed.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_9FarReader_5open(PyObject *__pyx_v_cls, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  PyObject *__pyx_v_filenames = 0;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"open (wrapper)\", 0);\n  if (unlikely(__pyx_kwds) && unlikely(PyDict_Size(__pyx_kwds) > 0) && unlikely(!__Pyx_CheckKeywordStrings(__pyx_kwds, \"open\", 0))) return NULL;\n  __Pyx_INCREF(__pyx_args);\n  __pyx_v_filenames = __pyx_args;\n  __pyx_r = __pyx_pf_9pywrapfst_9FarReader_4open(((PyTypeObject*)__pyx_v_cls), __pyx_v_filenames);\n\n  /* function exit code */\n  __Pyx_XDECREF(__pyx_v_filenames);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_9FarReader_4open(CYTHON_UNUSED PyTypeObject *__pyx_v_cls, PyObject *__pyx_v_filenames) {\n  std::unique_ptr<fst::script::FarReaderClass>  __pyx_v_tfar;\n  struct __pyx_obj_9pywrapfst_FarReader *__pyx_v_result = 0;\n  PyObject *__pyx_v_filename = NULL;\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  Py_ssize_t __pyx_t_3;\n  PyObject *__pyx_t_4 = NULL;\n  std::string __pyx_t_5;\n  std::vector<std::string>  __pyx_t_6;\n  int __pyx_t_7;\n  PyObject *__pyx_t_8 = NULL;\n  PyObject *__pyx_t_9 = NULL;\n  PyObject *__pyx_t_10 = NULL;\n  __Pyx_RefNannySetupContext(\"open\", 0);\n  __Pyx_INCREF(__pyx_v_filenames);\n\n  /* \"pywrapfst.pyx\":4257\n *       FstIOError: Read failed.\n *     \"\"\"\n *     filenames = [tostring(filename) for filename in filenames]             # <<<<<<<<<<<<<<\n *     cdef unique_ptr[fst.FarReaderClass] tfar\n *     tfar.reset(fst.FarReaderClass.Open(filenames))\n */\n  __pyx_t_1 = PyList_New(0); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4257, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_t_2 = __pyx_v_filenames; __Pyx_INCREF(__pyx_t_2); __pyx_t_3 = 0;\n  for (;;) {\n    if (__pyx_t_3 >= PyTuple_GET_SIZE(__pyx_t_2)) break;\n    #if CYTHON_ASSUME_SAFE_MACROS && !CYTHON_AVOID_BORROWED_REFS\n    __pyx_t_4 = PyTuple_GET_ITEM(__pyx_t_2, __pyx_t_3); __Pyx_INCREF(__pyx_t_4); __pyx_t_3++; if (unlikely(0 < 0)) __PYX_ERR(0, 4257, __pyx_L1_error)\n    #else\n    __pyx_t_4 = PySequence_ITEM(__pyx_t_2, __pyx_t_3); __pyx_t_3++; if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 4257, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_4);\n    #endif\n    __Pyx_XDECREF_SET(__pyx_v_filename, __pyx_t_4);\n    __pyx_t_4 = 0;\n    __pyx_t_5 = __pyx_f_9pywrapfst_tostring(__pyx_v_filename, NULL); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 4257, __pyx_L1_error)\n    __pyx_t_4 = __pyx_convert_PyBytes_string_to_py_std__in_string(__pyx_t_5); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 4257, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_4);\n    if (unlikely(__Pyx_ListComp_Append(__pyx_t_1, (PyObject*)__pyx_t_4))) __PYX_ERR(0, 4257, __pyx_L1_error)\n    __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n  }\n  __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n  __Pyx_DECREF_SET(__pyx_v_filenames, __pyx_t_1);\n  __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":4259\n *     filenames = [tostring(filename) for filename in filenames]\n *     cdef unique_ptr[fst.FarReaderClass] tfar\n *     tfar.reset(fst.FarReaderClass.Open(filenames))             # <<<<<<<<<<<<<<\n *     if tfar.get() == NULL:\n *       raise FstIOError(\"Read failed: {!r}\".format(filenames))\n */\n  __pyx_t_6 = __pyx_convert_vector_from_py_std_3a__3a_string(__pyx_v_filenames); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 4259, __pyx_L1_error)\n  __pyx_v_tfar.reset(fst::script::FarReaderClass::Open(__pyx_t_6));\n\n  /* \"pywrapfst.pyx\":4260\n *     cdef unique_ptr[fst.FarReaderClass] tfar\n *     tfar.reset(fst.FarReaderClass.Open(filenames))\n *     if tfar.get() == NULL:             # <<<<<<<<<<<<<<\n *       raise FstIOError(\"Read failed: {!r}\".format(filenames))\n *     cdef FarReader result = FarReader.__new__(FarReader)\n */\n  __pyx_t_7 = ((__pyx_v_tfar.get() == NULL) != 0);\n  if (__pyx_t_7) {\n\n    /* \"pywrapfst.pyx\":4261\n *     tfar.reset(fst.FarReaderClass.Open(filenames))\n *     if tfar.get() == NULL:\n *       raise FstIOError(\"Read failed: {!r}\".format(filenames))             # <<<<<<<<<<<<<<\n *     cdef FarReader result = FarReader.__new__(FarReader)\n *     result._reader.reset(tfar.release())\n */\n    __pyx_t_2 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstIOError); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 4261, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_2);\n    __pyx_t_8 = __Pyx_PyObject_GetAttrStr(__pyx_kp_s_Read_failed_r, __pyx_n_s_format); if (unlikely(!__pyx_t_8)) __PYX_ERR(0, 4261, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_8);\n    __pyx_t_9 = NULL;\n    if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_8))) {\n      __pyx_t_9 = PyMethod_GET_SELF(__pyx_t_8);\n      if (likely(__pyx_t_9)) {\n        PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_8);\n        __Pyx_INCREF(__pyx_t_9);\n        __Pyx_INCREF(function);\n        __Pyx_DECREF_SET(__pyx_t_8, function);\n      }\n    }\n    if (!__pyx_t_9) {\n      __pyx_t_4 = __Pyx_PyObject_CallOneArg(__pyx_t_8, __pyx_v_filenames); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 4261, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_4);\n    } else {\n      #if CYTHON_FAST_PYCALL\n      if (PyFunction_Check(__pyx_t_8)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_9, __pyx_v_filenames};\n        __pyx_t_4 = __Pyx_PyFunction_FastCall(__pyx_t_8, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 4261, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_9); __pyx_t_9 = 0;\n        __Pyx_GOTREF(__pyx_t_4);\n      } else\n      #endif\n      #if CYTHON_FAST_PYCCALL\n      if (__Pyx_PyFastCFunction_Check(__pyx_t_8)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_9, __pyx_v_filenames};\n        __pyx_t_4 = __Pyx_PyCFunction_FastCall(__pyx_t_8, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 4261, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_9); __pyx_t_9 = 0;\n        __Pyx_GOTREF(__pyx_t_4);\n      } else\n      #endif\n      {\n        __pyx_t_10 = PyTuple_New(1+1); if (unlikely(!__pyx_t_10)) __PYX_ERR(0, 4261, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_10);\n        __Pyx_GIVEREF(__pyx_t_9); PyTuple_SET_ITEM(__pyx_t_10, 0, __pyx_t_9); __pyx_t_9 = NULL;\n        __Pyx_INCREF(__pyx_v_filenames);\n        __Pyx_GIVEREF(__pyx_v_filenames);\n        PyTuple_SET_ITEM(__pyx_t_10, 0+1, __pyx_v_filenames);\n        __pyx_t_4 = __Pyx_PyObject_Call(__pyx_t_8, __pyx_t_10, NULL); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 4261, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_4);\n        __Pyx_DECREF(__pyx_t_10); __pyx_t_10 = 0;\n      }\n    }\n    __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0;\n    __pyx_t_8 = NULL;\n    if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_2))) {\n      __pyx_t_8 = PyMethod_GET_SELF(__pyx_t_2);\n      if (likely(__pyx_t_8)) {\n        PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_2);\n        __Pyx_INCREF(__pyx_t_8);\n        __Pyx_INCREF(function);\n        __Pyx_DECREF_SET(__pyx_t_2, function);\n      }\n    }\n    if (!__pyx_t_8) {\n      __pyx_t_1 = __Pyx_PyObject_CallOneArg(__pyx_t_2, __pyx_t_4); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4261, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      __Pyx_GOTREF(__pyx_t_1);\n    } else {\n      #if CYTHON_FAST_PYCALL\n      if (PyFunction_Check(__pyx_t_2)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_8, __pyx_t_4};\n        __pyx_t_1 = __Pyx_PyFunction_FastCall(__pyx_t_2, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4261, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_8); __pyx_t_8 = 0;\n        __Pyx_GOTREF(__pyx_t_1);\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else\n      #endif\n      #if CYTHON_FAST_PYCCALL\n      if (__Pyx_PyFastCFunction_Check(__pyx_t_2)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_8, __pyx_t_4};\n        __pyx_t_1 = __Pyx_PyCFunction_FastCall(__pyx_t_2, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4261, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_8); __pyx_t_8 = 0;\n        __Pyx_GOTREF(__pyx_t_1);\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else\n      #endif\n      {\n        __pyx_t_10 = PyTuple_New(1+1); if (unlikely(!__pyx_t_10)) __PYX_ERR(0, 4261, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_10);\n        __Pyx_GIVEREF(__pyx_t_8); PyTuple_SET_ITEM(__pyx_t_10, 0, __pyx_t_8); __pyx_t_8 = NULL;\n        __Pyx_GIVEREF(__pyx_t_4);\n        PyTuple_SET_ITEM(__pyx_t_10, 0+1, __pyx_t_4);\n        __pyx_t_4 = 0;\n        __pyx_t_1 = __Pyx_PyObject_Call(__pyx_t_2, __pyx_t_10, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4261, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_1);\n        __Pyx_DECREF(__pyx_t_10); __pyx_t_10 = 0;\n      }\n    }\n    __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n    __Pyx_Raise(__pyx_t_1, 0, 0, 0);\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n    __PYX_ERR(0, 4261, __pyx_L1_error)\n\n    /* \"pywrapfst.pyx\":4260\n *     cdef unique_ptr[fst.FarReaderClass] tfar\n *     tfar.reset(fst.FarReaderClass.Open(filenames))\n *     if tfar.get() == NULL:             # <<<<<<<<<<<<<<\n *       raise FstIOError(\"Read failed: {!r}\".format(filenames))\n *     cdef FarReader result = FarReader.__new__(FarReader)\n */\n  }\n\n  /* \"pywrapfst.pyx\":4262\n *     if tfar.get() == NULL:\n *       raise FstIOError(\"Read failed: {!r}\".format(filenames))\n *     cdef FarReader result = FarReader.__new__(FarReader)             # <<<<<<<<<<<<<<\n *     result._reader.reset(tfar.release())\n *     return result\n */\n  __pyx_t_1 = __pyx_tp_new_9pywrapfst_FarReader(((PyTypeObject *)__pyx_ptype_9pywrapfst_FarReader), __pyx_empty_tuple, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4262, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (!(likely(__Pyx_TypeTest(__pyx_t_1, __pyx_ptype_9pywrapfst_FarReader)))) __PYX_ERR(0, 4262, __pyx_L1_error)\n  __pyx_v_result = ((struct __pyx_obj_9pywrapfst_FarReader *)__pyx_t_1);\n  __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":4263\n *       raise FstIOError(\"Read failed: {!r}\".format(filenames))\n *     cdef FarReader result = FarReader.__new__(FarReader)\n *     result._reader.reset(tfar.release())             # <<<<<<<<<<<<<<\n *     return result\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_result) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_reader\");\n    __PYX_ERR(0, 4263, __pyx_L1_error)\n  }\n  __pyx_v_result->_reader.reset(__pyx_v_tfar.release());\n\n  /* \"pywrapfst.pyx\":4264\n *     cdef FarReader result = FarReader.__new__(FarReader)\n *     result._reader.reset(tfar.release())\n *     return result             # <<<<<<<<<<<<<<\n * \n *   cpdef string arc_type(self):\n */\n  __Pyx_XDECREF(__pyx_r);\n  __Pyx_INCREF(((PyObject *)__pyx_v_result));\n  __pyx_r = ((PyObject *)__pyx_v_result);\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":4239\n * \n *   @classmethod\n *   def open(cls, *filenames):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     FarReader.open(*filenames)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_8);\n  __Pyx_XDECREF(__pyx_t_9);\n  __Pyx_XDECREF(__pyx_t_10);\n  __Pyx_AddTraceback(\"pywrapfst.FarReader.open\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XDECREF(__pyx_v_filenames);\n  __Pyx_XDECREF((PyObject *)__pyx_v_result);\n  __Pyx_XDECREF(__pyx_v_filename);\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":4266\n *     return result\n * \n *   cpdef string arc_type(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     arc_type(self)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_9FarReader_7arc_type(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic std::string __pyx_f_9pywrapfst_9FarReader_arc_type(struct __pyx_obj_9pywrapfst_FarReader *__pyx_v_self, int __pyx_skip_dispatch) {\n  std::string __pyx_r;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  std::string __pyx_t_5;\n  __Pyx_RefNannySetupContext(\"arc_type\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_arc_type); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4266, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_9FarReader_7arc_type)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 4266, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 4266, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __pyx_t_5 = __pyx_convert_string_from_py_std__in_string(__pyx_t_2); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 4266, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __pyx_r = __pyx_t_5;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":4272\n *     Returns a string indicating the arc type.\n *     \"\"\"\n *     return self._reader.get().ArcType()             # <<<<<<<<<<<<<<\n * \n *   cpdef bool done(self):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_reader\");\n    __PYX_ERR(0, 4272, __pyx_L1_error)\n  }\n  __pyx_r = __pyx_v_self->_reader.get()->ArcType();\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":4266\n *     return result\n * \n *   cpdef string arc_type(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     arc_type(self)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_WriteUnraisable(\"pywrapfst.FarReader.arc_type\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __Pyx_pretend_to_initialize(&__pyx_r);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_9FarReader_7arc_type(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_9FarReader_6arc_type[] = \"\\n    arc_type(self)\\n\\n    Returns a string indicating the arc type.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_9FarReader_7arc_type(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"arc_type (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_9FarReader_6arc_type(((struct __pyx_obj_9pywrapfst_FarReader *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_9FarReader_6arc_type(struct __pyx_obj_9pywrapfst_FarReader *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"arc_type\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __pyx_convert_PyBytes_string_to_py_std__in_string(__pyx_f_9pywrapfst_9FarReader_arc_type(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4266, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.FarReader.arc_type\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":4274\n *     return self._reader.get().ArcType()\n * \n *   cpdef bool done(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     done(self)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_9FarReader_9done(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic bool __pyx_f_9pywrapfst_9FarReader_done(struct __pyx_obj_9pywrapfst_FarReader *__pyx_v_self, int __pyx_skip_dispatch) {\n  bool __pyx_r;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  bool __pyx_t_5;\n  __Pyx_RefNannySetupContext(\"done\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_done); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4274, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_9FarReader_9done)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 4274, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 4274, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __pyx_t_5 = __Pyx_PyObject_IsTrue(__pyx_t_2); if (unlikely((__pyx_t_5 == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 4274, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __pyx_r = __pyx_t_5;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":4283\n *       True if the iterator is exhausted, False otherwise.\n *     \"\"\"\n *     return self._reader.get().Done()             # <<<<<<<<<<<<<<\n * \n *   cpdef bool error(self):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_reader\");\n    __PYX_ERR(0, 4283, __pyx_L1_error)\n  }\n  __pyx_r = __pyx_v_self->_reader.get()->Done();\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":4274\n *     return self._reader.get().ArcType()\n * \n *   cpdef bool done(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     done(self)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_WriteUnraisable(\"pywrapfst.FarReader.done\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_9FarReader_9done(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_9FarReader_8done[] = \"\\n    done(self)\\n\\n    Indicates whether the iterator is exhausted or not.\\n\\n    Returns:\\n      True if the iterator is exhausted, False otherwise.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_9FarReader_9done(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"done (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_9FarReader_8done(((struct __pyx_obj_9pywrapfst_FarReader *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_9FarReader_8done(struct __pyx_obj_9pywrapfst_FarReader *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"done\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __Pyx_PyBool_FromLong(__pyx_f_9pywrapfst_9FarReader_done(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4274, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.FarReader.done\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":4285\n *     return self._reader.get().Done()\n * \n *   cpdef bool error(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     error(self)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_9FarReader_11error(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic bool __pyx_f_9pywrapfst_9FarReader_error(struct __pyx_obj_9pywrapfst_FarReader *__pyx_v_self, int __pyx_skip_dispatch) {\n  bool __pyx_r;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  bool __pyx_t_5;\n  __Pyx_RefNannySetupContext(\"error\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_error); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4285, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_9FarReader_11error)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 4285, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 4285, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __pyx_t_5 = __Pyx_PyObject_IsTrue(__pyx_t_2); if (unlikely((__pyx_t_5 == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 4285, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __pyx_r = __pyx_t_5;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":4294\n *       True if the FarReader is in an errorful state, False otherwise.\n *     \"\"\"\n *     return self._reader.get().Error()             # <<<<<<<<<<<<<<\n * \n *   cpdef string far_type(self):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_reader\");\n    __PYX_ERR(0, 4294, __pyx_L1_error)\n  }\n  __pyx_r = __pyx_v_self->_reader.get()->Error();\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":4285\n *     return self._reader.get().Done()\n * \n *   cpdef bool error(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     error(self)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_WriteUnraisable(\"pywrapfst.FarReader.error\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_9FarReader_11error(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_9FarReader_10error[] = \"\\n    error(self)\\n\\n    Indicates whether the FarReader has encountered an error.\\n\\n    Returns:\\n      True if the FarReader is in an errorful state, False otherwise.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_9FarReader_11error(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"error (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_9FarReader_10error(((struct __pyx_obj_9pywrapfst_FarReader *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_9FarReader_10error(struct __pyx_obj_9pywrapfst_FarReader *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"error\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __Pyx_PyBool_FromLong(__pyx_f_9pywrapfst_9FarReader_error(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4285, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.FarReader.error\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":4296\n *     return self._reader.get().Error()\n * \n *   cpdef string far_type(self):             # <<<<<<<<<<<<<<\n *     return fst.GetFarTypeString(self._reader.get().Type())\n * \n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_9FarReader_13far_type(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic std::string __pyx_f_9pywrapfst_9FarReader_far_type(struct __pyx_obj_9pywrapfst_FarReader *__pyx_v_self, int __pyx_skip_dispatch) {\n  std::string __pyx_r;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  std::string __pyx_t_5;\n  __Pyx_RefNannySetupContext(\"far_type\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_far_type); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4296, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_9FarReader_13far_type)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 4296, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 4296, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __pyx_t_5 = __pyx_convert_string_from_py_std__in_string(__pyx_t_2); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 4296, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __pyx_r = __pyx_t_5;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":4297\n * \n *   cpdef string far_type(self):\n *     return fst.GetFarTypeString(self._reader.get().Type())             # <<<<<<<<<<<<<<\n * \n *   cpdef bool find(self, key) except *:\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_reader\");\n    __PYX_ERR(0, 4297, __pyx_L1_error)\n  }\n  __pyx_r = fst::GetFarTypeString(__pyx_v_self->_reader.get()->Type());\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":4296\n *     return self._reader.get().Error()\n * \n *   cpdef string far_type(self):             # <<<<<<<<<<<<<<\n *     return fst.GetFarTypeString(self._reader.get().Type())\n * \n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_WriteUnraisable(\"pywrapfst.FarReader.far_type\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __Pyx_pretend_to_initialize(&__pyx_r);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_9FarReader_13far_type(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_9FarReader_13far_type(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"far_type (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_9FarReader_12far_type(((struct __pyx_obj_9pywrapfst_FarReader *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_9FarReader_12far_type(struct __pyx_obj_9pywrapfst_FarReader *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"far_type\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __pyx_convert_PyBytes_string_to_py_std__in_string(__pyx_f_9pywrapfst_9FarReader_far_type(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4296, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.FarReader.far_type\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":4299\n *     return fst.GetFarTypeString(self._reader.get().Type())\n * \n *   cpdef bool find(self, key) except *:             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     find(self, key)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_9FarReader_15find(PyObject *__pyx_v_self, PyObject *__pyx_v_key); /*proto*/\nstatic bool __pyx_f_9pywrapfst_9FarReader_find(struct __pyx_obj_9pywrapfst_FarReader *__pyx_v_self, PyObject *__pyx_v_key, int __pyx_skip_dispatch) {\n  bool __pyx_r;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  bool __pyx_t_6;\n  std::string __pyx_t_7;\n  __Pyx_RefNannySetupContext(\"find\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_find); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4299, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_9FarReader_15find)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (!__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_v_key); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 4299, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_2);\n      } else {\n        #if CYTHON_FAST_PYCALL\n        if (PyFunction_Check(__pyx_t_3)) {\n          PyObject *__pyx_temp[2] = {__pyx_t_4, __pyx_v_key};\n          __pyx_t_2 = __Pyx_PyFunction_FastCall(__pyx_t_3, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 4299, __pyx_L1_error)\n          __Pyx_XDECREF(__pyx_t_4); __pyx_t_4 = 0;\n          __Pyx_GOTREF(__pyx_t_2);\n        } else\n        #endif\n        #if CYTHON_FAST_PYCCALL\n        if (__Pyx_PyFastCFunction_Check(__pyx_t_3)) {\n          PyObject *__pyx_temp[2] = {__pyx_t_4, __pyx_v_key};\n          __pyx_t_2 = __Pyx_PyCFunction_FastCall(__pyx_t_3, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 4299, __pyx_L1_error)\n          __Pyx_XDECREF(__pyx_t_4); __pyx_t_4 = 0;\n          __Pyx_GOTREF(__pyx_t_2);\n        } else\n        #endif\n        {\n          __pyx_t_5 = PyTuple_New(1+1); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 4299, __pyx_L1_error)\n          __Pyx_GOTREF(__pyx_t_5);\n          __Pyx_GIVEREF(__pyx_t_4); PyTuple_SET_ITEM(__pyx_t_5, 0, __pyx_t_4); __pyx_t_4 = NULL;\n          __Pyx_INCREF(__pyx_v_key);\n          __Pyx_GIVEREF(__pyx_v_key);\n          PyTuple_SET_ITEM(__pyx_t_5, 0+1, __pyx_v_key);\n          __pyx_t_2 = __Pyx_PyObject_Call(__pyx_t_3, __pyx_t_5, NULL); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 4299, __pyx_L1_error)\n          __Pyx_GOTREF(__pyx_t_2);\n          __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n        }\n      }\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __pyx_t_6 = __Pyx_PyObject_IsTrue(__pyx_t_2); if (unlikely((__pyx_t_6 == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 4299, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __pyx_r = __pyx_t_6;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":4312\n *       True if the key was found, False otherwise.\n *     \"\"\"\n *     return self._reader.get().Find(tostring(key))             # <<<<<<<<<<<<<<\n * \n *   cpdef _Fst get_fst(self):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_reader\");\n    __PYX_ERR(0, 4312, __pyx_L1_error)\n  }\n  __pyx_t_7 = __pyx_f_9pywrapfst_tostring(__pyx_v_key, NULL); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 4312, __pyx_L1_error)\n  __pyx_r = __pyx_v_self->_reader.get()->Find(__pyx_t_7);\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":4299\n *     return fst.GetFarTypeString(self._reader.get().Type())\n * \n *   cpdef bool find(self, key) except *:             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     find(self, key)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_AddTraceback(\"pywrapfst.FarReader.find\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_9FarReader_15find(PyObject *__pyx_v_self, PyObject *__pyx_v_key); /*proto*/\nstatic char __pyx_doc_9pywrapfst_9FarReader_14find[] = \"\\n    find(self, key)\\n\\n    Sets the current position to the first entry greater than or equal to the\\n    key (a string) and indicates whether or not a match was found.\\n\\n    Args:\\n      key: A string key.\\n\\n    Returns:\\n      True if the key was found, False otherwise.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_9FarReader_15find(PyObject *__pyx_v_self, PyObject *__pyx_v_key) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"find (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_9FarReader_14find(((struct __pyx_obj_9pywrapfst_FarReader *)__pyx_v_self), ((PyObject *)__pyx_v_key));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_9FarReader_14find(struct __pyx_obj_9pywrapfst_FarReader *__pyx_v_self, PyObject *__pyx_v_key) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  bool __pyx_t_1;\n  PyObject *__pyx_t_2 = NULL;\n  __Pyx_RefNannySetupContext(\"find\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __pyx_f_9pywrapfst_9FarReader_find(__pyx_v_self, __pyx_v_key, 1); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 4299, __pyx_L1_error)\n  __pyx_t_2 = __Pyx_PyBool_FromLong(__pyx_t_1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 4299, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  __pyx_r = __pyx_t_2;\n  __pyx_t_2 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_AddTraceback(\"pywrapfst.FarReader.find\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":4314\n *     return self._reader.get().Find(tostring(key))\n * \n *   cpdef _Fst get_fst(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     get_fst(self)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_9FarReader_17get_fst(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic struct __pyx_obj_9pywrapfst__Fst *__pyx_f_9pywrapfst_9FarReader_get_fst(struct __pyx_obj_9pywrapfst_FarReader *__pyx_v_self, int __pyx_skip_dispatch) {\n  struct __pyx_obj_9pywrapfst__Fst *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  __Pyx_RefNannySetupContext(\"get_fst\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_get_fst); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4314, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_9FarReader_17get_fst)) {\n      __Pyx_XDECREF(((PyObject *)__pyx_r));\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 4314, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 4314, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      if (!(likely(((__pyx_t_2) == Py_None) || likely(__Pyx_TypeTest(__pyx_t_2, __pyx_ptype_9pywrapfst__Fst))))) __PYX_ERR(0, 4314, __pyx_L1_error)\n      __pyx_r = ((struct __pyx_obj_9pywrapfst__Fst *)__pyx_t_2);\n      __pyx_t_2 = 0;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":4323\n *       A copy of the FST at the current position.\n *     \"\"\"\n *     return _init_XFst(new fst.FstClass(             # <<<<<<<<<<<<<<\n *         deref(self._reader.get().GetFstClass())))\n * \n */\n  __Pyx_XDECREF(((PyObject *)__pyx_r));\n\n  /* \"pywrapfst.pyx\":4324\n *     \"\"\"\n *     return _init_XFst(new fst.FstClass(\n *         deref(self._reader.get().GetFstClass())))             # <<<<<<<<<<<<<<\n * \n *   cpdef string get_key(self):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_reader\");\n    __PYX_ERR(0, 4324, __pyx_L1_error)\n  }\n\n  /* \"pywrapfst.pyx\":4323\n *       A copy of the FST at the current position.\n *     \"\"\"\n *     return _init_XFst(new fst.FstClass(             # <<<<<<<<<<<<<<\n *         deref(self._reader.get().GetFstClass())))\n * \n */\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst__init_XFst(new fst::script::FstClass((*__pyx_v_self->_reader.get()->GetFstClass())))); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4323, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = ((struct __pyx_obj_9pywrapfst__Fst *)__pyx_t_1);\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":4314\n *     return self._reader.get().Find(tostring(key))\n * \n *   cpdef _Fst get_fst(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     get_fst(self)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_AddTraceback(\"pywrapfst.FarReader.get_fst\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XGIVEREF((PyObject *)__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_9FarReader_17get_fst(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_9FarReader_16get_fst[] = \"\\n    get_fst(self)\\n\\n    Returns the FST at the current position.\\n\\n    Returns:\\n      A copy of the FST at the current position.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_9FarReader_17get_fst(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"get_fst (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_9FarReader_16get_fst(((struct __pyx_obj_9pywrapfst_FarReader *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_9FarReader_16get_fst(struct __pyx_obj_9pywrapfst_FarReader *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"get_fst\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst_9FarReader_get_fst(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4314, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.FarReader.get_fst\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":4326\n *         deref(self._reader.get().GetFstClass())))\n * \n *   cpdef string get_key(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     get_key(self)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_9FarReader_19get_key(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic std::string __pyx_f_9pywrapfst_9FarReader_get_key(struct __pyx_obj_9pywrapfst_FarReader *__pyx_v_self, int __pyx_skip_dispatch) {\n  std::string __pyx_r;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  std::string __pyx_t_5;\n  __Pyx_RefNannySetupContext(\"get_key\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_get_key); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4326, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_9FarReader_19get_key)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 4326, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 4326, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __pyx_t_5 = __pyx_convert_string_from_py_std__in_string(__pyx_t_2); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 4326, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __pyx_r = __pyx_t_5;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":4335\n *       The string key at the current position.\n *     \"\"\"\n *     return self._reader.get().GetKey()             # <<<<<<<<<<<<<<\n * \n *   cpdef void next(self):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_reader\");\n    __PYX_ERR(0, 4335, __pyx_L1_error)\n  }\n  __pyx_r = __pyx_v_self->_reader.get()->GetKey();\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":4326\n *         deref(self._reader.get().GetFstClass())))\n * \n *   cpdef string get_key(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     get_key(self)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_WriteUnraisable(\"pywrapfst.FarReader.get_key\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __Pyx_pretend_to_initialize(&__pyx_r);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_9FarReader_19get_key(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_9FarReader_18get_key[] = \"\\n    get_key(self)\\n\\n    Returns the string key at the current position.\\n\\n    Returns:\\n      The string key at the current position.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_9FarReader_19get_key(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"get_key (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_9FarReader_18get_key(((struct __pyx_obj_9pywrapfst_FarReader *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_9FarReader_18get_key(struct __pyx_obj_9pywrapfst_FarReader *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"get_key\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __pyx_convert_PyBytes_string_to_py_std__in_string(__pyx_f_9pywrapfst_9FarReader_get_key(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4326, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.FarReader.get_key\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":4337\n *     return self._reader.get().GetKey()\n * \n *   cpdef void next(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     next(self)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_9FarReader_21next(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic void __pyx_f_9pywrapfst_9FarReader_next(struct __pyx_obj_9pywrapfst_FarReader *__pyx_v_self, int __pyx_skip_dispatch) {\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  __Pyx_RefNannySetupContext(\"next\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_next); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4337, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_9FarReader_21next)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 4337, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 4337, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":4343\n *     Advances the iterator.\n *     \"\"\"\n *     self._reader.get().Next()             # <<<<<<<<<<<<<<\n * \n *   cpdef void reset(self):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_reader\");\n    __PYX_ERR(0, 4343, __pyx_L1_error)\n  }\n  __pyx_v_self->_reader.get()->Next();\n\n  /* \"pywrapfst.pyx\":4337\n *     return self._reader.get().GetKey()\n * \n *   cpdef void next(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     next(self)\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_WriteUnraisable(\"pywrapfst.FarReader.next\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_9FarReader_21next(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_9FarReader_20next[] = \"\\n    next(self)\\n\\n    Advances the iterator.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_9FarReader_21next(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"next (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_9FarReader_20next(((struct __pyx_obj_9pywrapfst_FarReader *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_9FarReader_20next(struct __pyx_obj_9pywrapfst_FarReader *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"next\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __Pyx_void_to_None(__pyx_f_9pywrapfst_9FarReader_next(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4337, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.FarReader.next\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":4345\n *     self._reader.get().Next()\n * \n *   cpdef void reset(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     reset(self)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_9FarReader_23reset(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic void __pyx_f_9pywrapfst_9FarReader_reset(struct __pyx_obj_9pywrapfst_FarReader *__pyx_v_self, int __pyx_skip_dispatch) {\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  __Pyx_RefNannySetupContext(\"reset\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_reset); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4345, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_9FarReader_23reset)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 4345, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 4345, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":4351\n *     Resets the iterator to the initial position.\n *     \"\"\"\n *     self._reader.get().Reset()             # <<<<<<<<<<<<<<\n * \n *   def __getitem__(self, key):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_reader\");\n    __PYX_ERR(0, 4351, __pyx_L1_error)\n  }\n  __pyx_v_self->_reader.get()->Reset();\n\n  /* \"pywrapfst.pyx\":4345\n *     self._reader.get().Next()\n * \n *   cpdef void reset(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     reset(self)\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_WriteUnraisable(\"pywrapfst.FarReader.reset\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_9FarReader_23reset(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_9FarReader_22reset[] = \"\\n    reset(self)\\n\\n    Resets the iterator to the initial position.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_9FarReader_23reset(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"reset (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_9FarReader_22reset(((struct __pyx_obj_9pywrapfst_FarReader *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_9FarReader_22reset(struct __pyx_obj_9pywrapfst_FarReader *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"reset\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __Pyx_void_to_None(__pyx_f_9pywrapfst_9FarReader_reset(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4345, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.FarReader.reset\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":4353\n *     self._reader.get().Reset()\n * \n *   def __getitem__(self, key):             # <<<<<<<<<<<<<<\n *     cdef string ckey = tostring(key)\n *     if self.get_key() == ckey or self._reader.get().Find(ckey):\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_9FarReader_25__getitem__(PyObject *__pyx_v_self, PyObject *__pyx_v_key); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_9FarReader_25__getitem__(PyObject *__pyx_v_self, PyObject *__pyx_v_key) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__getitem__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_9FarReader_24__getitem__(((struct __pyx_obj_9pywrapfst_FarReader *)__pyx_v_self), ((PyObject *)__pyx_v_key));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_9FarReader_24__getitem__(struct __pyx_obj_9pywrapfst_FarReader *__pyx_v_self, PyObject *__pyx_v_key) {\n  std::string __pyx_v_ckey;\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  std::string __pyx_t_1;\n  int __pyx_t_2;\n  int __pyx_t_3;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  __Pyx_RefNannySetupContext(\"__getitem__\", 0);\n\n  /* \"pywrapfst.pyx\":4354\n * \n *   def __getitem__(self, key):\n *     cdef string ckey = tostring(key)             # <<<<<<<<<<<<<<\n *     if self.get_key() == ckey or self._reader.get().Find(ckey):\n *       return self.get_fst()\n */\n  __pyx_t_1 = __pyx_f_9pywrapfst_tostring(__pyx_v_key, NULL); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 4354, __pyx_L1_error)\n  __pyx_v_ckey = __pyx_t_1;\n\n  /* \"pywrapfst.pyx\":4355\n *   def __getitem__(self, key):\n *     cdef string ckey = tostring(key)\n *     if self.get_key() == ckey or self._reader.get().Find(ckey):             # <<<<<<<<<<<<<<\n *       return self.get_fst()\n *     raise KeyError(key)\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"get_key\");\n    __PYX_ERR(0, 4355, __pyx_L1_error)\n  }\n  __pyx_t_3 = ((((struct __pyx_vtabstruct_9pywrapfst_FarReader *)__pyx_v_self->__pyx_vtab)->get_key(__pyx_v_self, 0) == __pyx_v_ckey) != 0);\n  if (!__pyx_t_3) {\n  } else {\n    __pyx_t_2 = __pyx_t_3;\n    goto __pyx_L4_bool_binop_done;\n  }\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_reader\");\n    __PYX_ERR(0, 4355, __pyx_L1_error)\n  }\n  __pyx_t_3 = (__pyx_v_self->_reader.get()->Find(__pyx_v_ckey) != 0);\n  __pyx_t_2 = __pyx_t_3;\n  __pyx_L4_bool_binop_done:;\n  if (__pyx_t_2) {\n\n    /* \"pywrapfst.pyx\":4356\n *     cdef string ckey = tostring(key)\n *     if self.get_key() == ckey or self._reader.get().Find(ckey):\n *       return self.get_fst()             # <<<<<<<<<<<<<<\n *     raise KeyError(key)\n * \n */\n    __Pyx_XDECREF(__pyx_r);\n    if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n      PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"get_fst\");\n      __PYX_ERR(0, 4356, __pyx_L1_error)\n    }\n    __pyx_t_4 = ((PyObject *)((struct __pyx_vtabstruct_9pywrapfst_FarReader *)__pyx_v_self->__pyx_vtab)->get_fst(__pyx_v_self, 0)); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 4356, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_4);\n    __pyx_r = __pyx_t_4;\n    __pyx_t_4 = 0;\n    goto __pyx_L0;\n\n    /* \"pywrapfst.pyx\":4355\n *   def __getitem__(self, key):\n *     cdef string ckey = tostring(key)\n *     if self.get_key() == ckey or self._reader.get().Find(ckey):             # <<<<<<<<<<<<<<\n *       return self.get_fst()\n *     raise KeyError(key)\n */\n  }\n\n  /* \"pywrapfst.pyx\":4357\n *     if self.get_key() == ckey or self._reader.get().Find(ckey):\n *       return self.get_fst()\n *     raise KeyError(key)             # <<<<<<<<<<<<<<\n * \n * \n */\n  __pyx_t_4 = PyTuple_New(1); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 4357, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_4);\n  __Pyx_INCREF(__pyx_v_key);\n  __Pyx_GIVEREF(__pyx_v_key);\n  PyTuple_SET_ITEM(__pyx_t_4, 0, __pyx_v_key);\n  __pyx_t_5 = __Pyx_PyObject_Call(__pyx_builtin_KeyError, __pyx_t_4, NULL); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 4357, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_5);\n  __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n  __Pyx_Raise(__pyx_t_5, 0, 0, 0);\n  __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n  __PYX_ERR(0, 4357, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":4353\n *     self._reader.get().Reset()\n * \n *   def __getitem__(self, key):             # <<<<<<<<<<<<<<\n *     cdef string ckey = tostring(key)\n *     if self.get_key() == ckey or self._reader.get().Find(ckey):\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_AddTraceback(\"pywrapfst.FarReader.__getitem__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"(tree fragment)\":1\n * def __reduce_cython__(self):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._reader cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_9FarReader_27__reduce_cython__(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_9FarReader_27__reduce_cython__(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__reduce_cython__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_9FarReader_26__reduce_cython__(((struct __pyx_obj_9pywrapfst_FarReader *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_9FarReader_26__reduce_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst_FarReader *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"__reduce_cython__\", 0);\n\n  /* \"(tree fragment)\":2\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._reader cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._reader cannot be converted to a Python object for pickling\")\n */\n  __pyx_t_1 = __Pyx_PyObject_Call(__pyx_builtin_TypeError, __pyx_tuple__93, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(1, 2, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __Pyx_Raise(__pyx_t_1, 0, 0, 0);\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  __PYX_ERR(1, 2, __pyx_L1_error)\n\n  /* \"(tree fragment)\":1\n * def __reduce_cython__(self):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._reader cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.FarReader.__reduce_cython__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"(tree fragment)\":3\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._reader cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._reader cannot be converted to a Python object for pickling\")\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_9FarReader_29__setstate_cython__(PyObject *__pyx_v_self, PyObject *__pyx_v___pyx_state); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_9FarReader_29__setstate_cython__(PyObject *__pyx_v_self, PyObject *__pyx_v___pyx_state) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__setstate_cython__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_9FarReader_28__setstate_cython__(((struct __pyx_obj_9pywrapfst_FarReader *)__pyx_v_self), ((PyObject *)__pyx_v___pyx_state));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_9FarReader_28__setstate_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst_FarReader *__pyx_v_self, CYTHON_UNUSED PyObject *__pyx_v___pyx_state) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"__setstate_cython__\", 0);\n\n  /* \"(tree fragment)\":4\n *     raise TypeError(\"self._reader cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._reader cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n */\n  __pyx_t_1 = __Pyx_PyObject_Call(__pyx_builtin_TypeError, __pyx_tuple__94, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(1, 4, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __Pyx_Raise(__pyx_t_1, 0, 0, 0);\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  __PYX_ERR(1, 4, __pyx_L1_error)\n\n  /* \"(tree fragment)\":3\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._reader cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._reader cannot be converted to a Python object for pickling\")\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.FarReader.__setstate_cython__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":4380\n *   \"\"\"\n * \n *   def __init__(self):             # <<<<<<<<<<<<<<\n *     raise FstDeletedConstructorError(\n *         \"Cannot construct {}\".format(self.__class__.__name__))\n */\n\n/* Python wrapper */\nstatic int __pyx_pw_9pywrapfst_9FarWriter_1__init__(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic int __pyx_pw_9pywrapfst_9FarWriter_1__init__(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  int __pyx_r;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__init__ (wrapper)\", 0);\n  if (unlikely(PyTuple_GET_SIZE(__pyx_args) > 0)) {\n    __Pyx_RaiseArgtupleInvalid(\"__init__\", 1, 0, 0, PyTuple_GET_SIZE(__pyx_args)); return -1;}\n  if (unlikely(__pyx_kwds) && unlikely(PyDict_Size(__pyx_kwds) > 0) && unlikely(!__Pyx_CheckKeywordStrings(__pyx_kwds, \"__init__\", 0))) return -1;\n  __pyx_r = __pyx_pf_9pywrapfst_9FarWriter___init__(((struct __pyx_obj_9pywrapfst_FarWriter *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic int __pyx_pf_9pywrapfst_9FarWriter___init__(struct __pyx_obj_9pywrapfst_FarWriter *__pyx_v_self) {\n  int __pyx_r;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  PyObject *__pyx_t_6 = NULL;\n  PyObject *__pyx_t_7 = NULL;\n  __Pyx_RefNannySetupContext(\"__init__\", 0);\n\n  /* \"pywrapfst.pyx\":4381\n * \n *   def __init__(self):\n *     raise FstDeletedConstructorError(             # <<<<<<<<<<<<<<\n *         \"Cannot construct {}\".format(self.__class__.__name__))\n * \n */\n  __pyx_t_2 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstDeletedConstructorError); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 4381, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n\n  /* \"pywrapfst.pyx\":4382\n *   def __init__(self):\n *     raise FstDeletedConstructorError(\n *         \"Cannot construct {}\".format(self.__class__.__name__))             # <<<<<<<<<<<<<<\n * \n *   def __repr__(self):\n */\n  __pyx_t_4 = __Pyx_PyObject_GetAttrStr(__pyx_kp_s_Cannot_construct, __pyx_n_s_format); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 4382, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_4);\n  __pyx_t_5 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_class); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 4382, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_5);\n  __pyx_t_6 = __Pyx_PyObject_GetAttrStr(__pyx_t_5, __pyx_n_s_name); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 4382, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_6);\n  __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n  __pyx_t_5 = NULL;\n  if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_4))) {\n    __pyx_t_5 = PyMethod_GET_SELF(__pyx_t_4);\n    if (likely(__pyx_t_5)) {\n      PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_4);\n      __Pyx_INCREF(__pyx_t_5);\n      __Pyx_INCREF(function);\n      __Pyx_DECREF_SET(__pyx_t_4, function);\n    }\n  }\n  if (!__pyx_t_5) {\n    __pyx_t_3 = __Pyx_PyObject_CallOneArg(__pyx_t_4, __pyx_t_6); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 4382, __pyx_L1_error)\n    __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n    __Pyx_GOTREF(__pyx_t_3);\n  } else {\n    #if CYTHON_FAST_PYCALL\n    if (PyFunction_Check(__pyx_t_4)) {\n      PyObject *__pyx_temp[2] = {__pyx_t_5, __pyx_t_6};\n      __pyx_t_3 = __Pyx_PyFunction_FastCall(__pyx_t_4, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 4382, __pyx_L1_error)\n      __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;\n      __Pyx_GOTREF(__pyx_t_3);\n      __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n    } else\n    #endif\n    #if CYTHON_FAST_PYCCALL\n    if (__Pyx_PyFastCFunction_Check(__pyx_t_4)) {\n      PyObject *__pyx_temp[2] = {__pyx_t_5, __pyx_t_6};\n      __pyx_t_3 = __Pyx_PyCFunction_FastCall(__pyx_t_4, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 4382, __pyx_L1_error)\n      __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;\n      __Pyx_GOTREF(__pyx_t_3);\n      __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n    } else\n    #endif\n    {\n      __pyx_t_7 = PyTuple_New(1+1); if (unlikely(!__pyx_t_7)) __PYX_ERR(0, 4382, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_7);\n      __Pyx_GIVEREF(__pyx_t_5); PyTuple_SET_ITEM(__pyx_t_7, 0, __pyx_t_5); __pyx_t_5 = NULL;\n      __Pyx_GIVEREF(__pyx_t_6);\n      PyTuple_SET_ITEM(__pyx_t_7, 0+1, __pyx_t_6);\n      __pyx_t_6 = 0;\n      __pyx_t_3 = __Pyx_PyObject_Call(__pyx_t_4, __pyx_t_7, NULL); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 4382, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_3);\n      __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0;\n    }\n  }\n  __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n  __pyx_t_4 = NULL;\n  if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_2))) {\n    __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_2);\n    if (likely(__pyx_t_4)) {\n      PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_2);\n      __Pyx_INCREF(__pyx_t_4);\n      __Pyx_INCREF(function);\n      __Pyx_DECREF_SET(__pyx_t_2, function);\n    }\n  }\n  if (!__pyx_t_4) {\n    __pyx_t_1 = __Pyx_PyObject_CallOneArg(__pyx_t_2, __pyx_t_3); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4381, __pyx_L1_error)\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    __Pyx_GOTREF(__pyx_t_1);\n  } else {\n    #if CYTHON_FAST_PYCALL\n    if (PyFunction_Check(__pyx_t_2)) {\n      PyObject *__pyx_temp[2] = {__pyx_t_4, __pyx_t_3};\n      __pyx_t_1 = __Pyx_PyFunction_FastCall(__pyx_t_2, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4381, __pyx_L1_error)\n      __Pyx_XDECREF(__pyx_t_4); __pyx_t_4 = 0;\n      __Pyx_GOTREF(__pyx_t_1);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    } else\n    #endif\n    #if CYTHON_FAST_PYCCALL\n    if (__Pyx_PyFastCFunction_Check(__pyx_t_2)) {\n      PyObject *__pyx_temp[2] = {__pyx_t_4, __pyx_t_3};\n      __pyx_t_1 = __Pyx_PyCFunction_FastCall(__pyx_t_2, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4381, __pyx_L1_error)\n      __Pyx_XDECREF(__pyx_t_4); __pyx_t_4 = 0;\n      __Pyx_GOTREF(__pyx_t_1);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    } else\n    #endif\n    {\n      __pyx_t_7 = PyTuple_New(1+1); if (unlikely(!__pyx_t_7)) __PYX_ERR(0, 4381, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_7);\n      __Pyx_GIVEREF(__pyx_t_4); PyTuple_SET_ITEM(__pyx_t_7, 0, __pyx_t_4); __pyx_t_4 = NULL;\n      __Pyx_GIVEREF(__pyx_t_3);\n      PyTuple_SET_ITEM(__pyx_t_7, 0+1, __pyx_t_3);\n      __pyx_t_3 = 0;\n      __pyx_t_1 = __Pyx_PyObject_Call(__pyx_t_2, __pyx_t_7, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4381, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_1);\n      __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0;\n    }\n  }\n  __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n  __Pyx_Raise(__pyx_t_1, 0, 0, 0);\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  __PYX_ERR(0, 4381, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":4380\n *   \"\"\"\n * \n *   def __init__(self):             # <<<<<<<<<<<<<<\n *     raise FstDeletedConstructorError(\n *         \"Cannot construct {}\".format(self.__class__.__name__))\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_XDECREF(__pyx_t_6);\n  __Pyx_XDECREF(__pyx_t_7);\n  __Pyx_AddTraceback(\"pywrapfst.FarWriter.__init__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = -1;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":4384\n *         \"Cannot construct {}\".format(self.__class__.__name__))\n * \n *   def __repr__(self):             # <<<<<<<<<<<<<<\n *     return \"<{} FarWriter at 0x{:x}>\".format(self.far_type(), id(self))\n * \n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_9FarWriter_3__repr__(PyObject *__pyx_v_self); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_9FarWriter_3__repr__(PyObject *__pyx_v_self) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__repr__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_9FarWriter_2__repr__(((struct __pyx_obj_9pywrapfst_FarWriter *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_9FarWriter_2__repr__(struct __pyx_obj_9pywrapfst_FarWriter *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  int __pyx_t_6;\n  PyObject *__pyx_t_7 = NULL;\n  __Pyx_RefNannySetupContext(\"__repr__\", 0);\n\n  /* \"pywrapfst.pyx\":4385\n * \n *   def __repr__(self):\n *     return \"<{} FarWriter at 0x{:x}>\".format(self.far_type(), id(self))             # <<<<<<<<<<<<<<\n * \n *   @classmethod\n */\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_2 = __Pyx_PyObject_GetAttrStr(__pyx_kp_s_FarWriter_at_0x_x, __pyx_n_s_format); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 4385, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"far_type\");\n    __PYX_ERR(0, 4385, __pyx_L1_error)\n  }\n  __pyx_t_3 = __pyx_convert_PyBytes_string_to_py_std__in_string(((struct __pyx_vtabstruct_9pywrapfst_FarWriter *)__pyx_v_self->__pyx_vtab)->far_type(__pyx_v_self, 0)); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 4385, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_3);\n  __pyx_t_4 = PyTuple_New(1); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 4385, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_4);\n  __Pyx_INCREF(((PyObject *)__pyx_v_self));\n  __Pyx_GIVEREF(((PyObject *)__pyx_v_self));\n  PyTuple_SET_ITEM(__pyx_t_4, 0, ((PyObject *)__pyx_v_self));\n  __pyx_t_5 = __Pyx_PyObject_Call(__pyx_builtin_id, __pyx_t_4, NULL); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 4385, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_5);\n  __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n  __pyx_t_4 = NULL;\n  __pyx_t_6 = 0;\n  if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_2))) {\n    __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_2);\n    if (likely(__pyx_t_4)) {\n      PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_2);\n      __Pyx_INCREF(__pyx_t_4);\n      __Pyx_INCREF(function);\n      __Pyx_DECREF_SET(__pyx_t_2, function);\n      __pyx_t_6 = 1;\n    }\n  }\n  #if CYTHON_FAST_PYCALL\n  if (PyFunction_Check(__pyx_t_2)) {\n    PyObject *__pyx_temp[3] = {__pyx_t_4, __pyx_t_3, __pyx_t_5};\n    __pyx_t_1 = __Pyx_PyFunction_FastCall(__pyx_t_2, __pyx_temp+1-__pyx_t_6, 2+__pyx_t_6); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4385, __pyx_L1_error)\n    __Pyx_XDECREF(__pyx_t_4); __pyx_t_4 = 0;\n    __Pyx_GOTREF(__pyx_t_1);\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n  } else\n  #endif\n  #if CYTHON_FAST_PYCCALL\n  if (__Pyx_PyFastCFunction_Check(__pyx_t_2)) {\n    PyObject *__pyx_temp[3] = {__pyx_t_4, __pyx_t_3, __pyx_t_5};\n    __pyx_t_1 = __Pyx_PyCFunction_FastCall(__pyx_t_2, __pyx_temp+1-__pyx_t_6, 2+__pyx_t_6); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4385, __pyx_L1_error)\n    __Pyx_XDECREF(__pyx_t_4); __pyx_t_4 = 0;\n    __Pyx_GOTREF(__pyx_t_1);\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n  } else\n  #endif\n  {\n    __pyx_t_7 = PyTuple_New(2+__pyx_t_6); if (unlikely(!__pyx_t_7)) __PYX_ERR(0, 4385, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_7);\n    if (__pyx_t_4) {\n      __Pyx_GIVEREF(__pyx_t_4); PyTuple_SET_ITEM(__pyx_t_7, 0, __pyx_t_4); __pyx_t_4 = NULL;\n    }\n    __Pyx_GIVEREF(__pyx_t_3);\n    PyTuple_SET_ITEM(__pyx_t_7, 0+__pyx_t_6, __pyx_t_3);\n    __Pyx_GIVEREF(__pyx_t_5);\n    PyTuple_SET_ITEM(__pyx_t_7, 1+__pyx_t_6, __pyx_t_5);\n    __pyx_t_3 = 0;\n    __pyx_t_5 = 0;\n    __pyx_t_1 = __Pyx_PyObject_Call(__pyx_t_2, __pyx_t_7, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4385, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0;\n  }\n  __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":4384\n *         \"Cannot construct {}\".format(self.__class__.__name__))\n * \n *   def __repr__(self):             # <<<<<<<<<<<<<<\n *     return \"<{} FarWriter at 0x{:x}>\".format(self.far_type(), id(self))\n * \n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_XDECREF(__pyx_t_7);\n  __Pyx_AddTraceback(\"pywrapfst.FarWriter.__repr__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":4388\n * \n *   @classmethod\n *   def create(cls, filename, arc_type=b\"standard\", far_type=b\"default\"):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     FarWriter.\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_9FarWriter_5create(PyObject *__pyx_v_cls, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic char __pyx_doc_9pywrapfst_9FarWriter_4create[] = \"\\n    FarWriter.\\n\\n    Creates a FarWriter object.\\n\\n    This class method creates a FarWriter given the desired output location,\\n    arc type, and FAR type.\\n\\n    Args:\\n      filename: The string location for the output FAR files.\\n      arc_type: A string indicating the arc type.\\n      far_type: A string indicating the FAR type; one of: \\\"fst\\\", \\\"stlist\\\",\\n          \\\"sttable\\\", \\\"sstable\\\", \\\"default\\\".\\n\\n    Returns:\\n      A new FarWriter instance.\\n\\n    Raises:\\n      FstIOError: Read failed.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_9FarWriter_5create(PyObject *__pyx_v_cls, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  PyObject *__pyx_v_filename = 0;\n  PyObject *__pyx_v_arc_type = 0;\n  PyObject *__pyx_v_far_type = 0;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"create (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_filename,&__pyx_n_s_arc_type,&__pyx_n_s_far_type,0};\n    PyObject* values[3] = {0,0,0};\n    values[1] = ((PyObject *)__pyx_n_b_standard);\n    values[2] = ((PyObject *)__pyx_n_b_default);\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);\n        CYTHON_FALLTHROUGH;\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (likely((values[0] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_filename)) != 0)) kw_args--;\n        else goto __pyx_L5_argtuple_error;\n        CYTHON_FALLTHROUGH;\n        case  1:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_arc_type);\n          if (value) { values[1] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  2:\n        if (kw_args > 0) {\n          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_far_type);\n          if (value) { values[2] = value; kw_args--; }\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"create\") < 0)) __PYX_ERR(0, 4388, __pyx_L3_error)\n      }\n    } else {\n      switch (PyTuple_GET_SIZE(__pyx_args)) {\n        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);\n        CYTHON_FALLTHROUGH;\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n    }\n    __pyx_v_filename = values[0];\n    __pyx_v_arc_type = values[1];\n    __pyx_v_far_type = values[2];\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"create\", 0, 1, 3, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 4388, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst.FarWriter.create\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  __pyx_r = __pyx_pf_9pywrapfst_9FarWriter_4create(((PyTypeObject*)__pyx_v_cls), __pyx_v_filename, __pyx_v_arc_type, __pyx_v_far_type);\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_9FarWriter_4create(CYTHON_UNUSED PyTypeObject *__pyx_v_cls, PyObject *__pyx_v_filename, PyObject *__pyx_v_arc_type, PyObject *__pyx_v_far_type) {\n  enum fst::FarType __pyx_v_ft;\n  fst::script::FarWriterClass *__pyx_v_tfar;\n  struct __pyx_obj_9pywrapfst_FarWriter *__pyx_v_result = 0;\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  std::string __pyx_t_1;\n  std::string __pyx_t_2;\n  int __pyx_t_3;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  PyObject *__pyx_t_6 = NULL;\n  PyObject *__pyx_t_7 = NULL;\n  PyObject *__pyx_t_8 = NULL;\n  PyObject *__pyx_t_9 = NULL;\n  __Pyx_RefNannySetupContext(\"create\", 0);\n\n  /* \"pywrapfst.pyx\":4409\n *       FstIOError: Read failed.\n *     \"\"\"\n *     cdef fst.FarType ft = fst.GetFarType(tostring(far_type))             # <<<<<<<<<<<<<<\n *     cdef fst.FarWriterClass *tfar = fst.FarWriterClass.Create(\n *         tostring(filename), tostring(arc_type), ft)\n */\n  __pyx_t_1 = __pyx_f_9pywrapfst_tostring(__pyx_v_far_type, NULL); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 4409, __pyx_L1_error)\n  __pyx_v_ft = fst::script::GetFarType(__pyx_t_1);\n\n  /* \"pywrapfst.pyx\":4411\n *     cdef fst.FarType ft = fst.GetFarType(tostring(far_type))\n *     cdef fst.FarWriterClass *tfar = fst.FarWriterClass.Create(\n *         tostring(filename), tostring(arc_type), ft)             # <<<<<<<<<<<<<<\n *     if tfar == NULL:\n *       raise FstIOError(\"Open failed: {!r}\".format(filename))\n */\n  __pyx_t_1 = __pyx_f_9pywrapfst_tostring(__pyx_v_filename, NULL); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 4411, __pyx_L1_error)\n  __pyx_t_2 = __pyx_f_9pywrapfst_tostring(__pyx_v_arc_type, NULL); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 4411, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":4410\n *     \"\"\"\n *     cdef fst.FarType ft = fst.GetFarType(tostring(far_type))\n *     cdef fst.FarWriterClass *tfar = fst.FarWriterClass.Create(             # <<<<<<<<<<<<<<\n *         tostring(filename), tostring(arc_type), ft)\n *     if tfar == NULL:\n */\n  __pyx_v_tfar = fst::script::FarWriterClass::Create(__pyx_t_1, __pyx_t_2, __pyx_v_ft);\n\n  /* \"pywrapfst.pyx\":4412\n *     cdef fst.FarWriterClass *tfar = fst.FarWriterClass.Create(\n *         tostring(filename), tostring(arc_type), ft)\n *     if tfar == NULL:             # <<<<<<<<<<<<<<\n *       raise FstIOError(\"Open failed: {!r}\".format(filename))\n *     cdef FarWriter result = FarWriter.__new__(FarWriter)\n */\n  __pyx_t_3 = ((__pyx_v_tfar == NULL) != 0);\n  if (__pyx_t_3) {\n\n    /* \"pywrapfst.pyx\":4413\n *         tostring(filename), tostring(arc_type), ft)\n *     if tfar == NULL:\n *       raise FstIOError(\"Open failed: {!r}\".format(filename))             # <<<<<<<<<<<<<<\n *     cdef FarWriter result = FarWriter.__new__(FarWriter)\n *     result._writer.reset(tfar)\n */\n    __pyx_t_5 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstIOError); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 4413, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_5);\n    __pyx_t_7 = __Pyx_PyObject_GetAttrStr(__pyx_kp_s_Open_failed_r, __pyx_n_s_format); if (unlikely(!__pyx_t_7)) __PYX_ERR(0, 4413, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_7);\n    __pyx_t_8 = NULL;\n    if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_7))) {\n      __pyx_t_8 = PyMethod_GET_SELF(__pyx_t_7);\n      if (likely(__pyx_t_8)) {\n        PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_7);\n        __Pyx_INCREF(__pyx_t_8);\n        __Pyx_INCREF(function);\n        __Pyx_DECREF_SET(__pyx_t_7, function);\n      }\n    }\n    if (!__pyx_t_8) {\n      __pyx_t_6 = __Pyx_PyObject_CallOneArg(__pyx_t_7, __pyx_v_filename); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 4413, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_6);\n    } else {\n      #if CYTHON_FAST_PYCALL\n      if (PyFunction_Check(__pyx_t_7)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_8, __pyx_v_filename};\n        __pyx_t_6 = __Pyx_PyFunction_FastCall(__pyx_t_7, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 4413, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_8); __pyx_t_8 = 0;\n        __Pyx_GOTREF(__pyx_t_6);\n      } else\n      #endif\n      #if CYTHON_FAST_PYCCALL\n      if (__Pyx_PyFastCFunction_Check(__pyx_t_7)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_8, __pyx_v_filename};\n        __pyx_t_6 = __Pyx_PyCFunction_FastCall(__pyx_t_7, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 4413, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_8); __pyx_t_8 = 0;\n        __Pyx_GOTREF(__pyx_t_6);\n      } else\n      #endif\n      {\n        __pyx_t_9 = PyTuple_New(1+1); if (unlikely(!__pyx_t_9)) __PYX_ERR(0, 4413, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_9);\n        __Pyx_GIVEREF(__pyx_t_8); PyTuple_SET_ITEM(__pyx_t_9, 0, __pyx_t_8); __pyx_t_8 = NULL;\n        __Pyx_INCREF(__pyx_v_filename);\n        __Pyx_GIVEREF(__pyx_v_filename);\n        PyTuple_SET_ITEM(__pyx_t_9, 0+1, __pyx_v_filename);\n        __pyx_t_6 = __Pyx_PyObject_Call(__pyx_t_7, __pyx_t_9, NULL); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 4413, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_6);\n        __Pyx_DECREF(__pyx_t_9); __pyx_t_9 = 0;\n      }\n    }\n    __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0;\n    __pyx_t_7 = NULL;\n    if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_5))) {\n      __pyx_t_7 = PyMethod_GET_SELF(__pyx_t_5);\n      if (likely(__pyx_t_7)) {\n        PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_5);\n        __Pyx_INCREF(__pyx_t_7);\n        __Pyx_INCREF(function);\n        __Pyx_DECREF_SET(__pyx_t_5, function);\n      }\n    }\n    if (!__pyx_t_7) {\n      __pyx_t_4 = __Pyx_PyObject_CallOneArg(__pyx_t_5, __pyx_t_6); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 4413, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n      __Pyx_GOTREF(__pyx_t_4);\n    } else {\n      #if CYTHON_FAST_PYCALL\n      if (PyFunction_Check(__pyx_t_5)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_7, __pyx_t_6};\n        __pyx_t_4 = __Pyx_PyFunction_FastCall(__pyx_t_5, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 4413, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_7); __pyx_t_7 = 0;\n        __Pyx_GOTREF(__pyx_t_4);\n        __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n      } else\n      #endif\n      #if CYTHON_FAST_PYCCALL\n      if (__Pyx_PyFastCFunction_Check(__pyx_t_5)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_7, __pyx_t_6};\n        __pyx_t_4 = __Pyx_PyCFunction_FastCall(__pyx_t_5, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 4413, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_7); __pyx_t_7 = 0;\n        __Pyx_GOTREF(__pyx_t_4);\n        __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n      } else\n      #endif\n      {\n        __pyx_t_9 = PyTuple_New(1+1); if (unlikely(!__pyx_t_9)) __PYX_ERR(0, 4413, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_9);\n        __Pyx_GIVEREF(__pyx_t_7); PyTuple_SET_ITEM(__pyx_t_9, 0, __pyx_t_7); __pyx_t_7 = NULL;\n        __Pyx_GIVEREF(__pyx_t_6);\n        PyTuple_SET_ITEM(__pyx_t_9, 0+1, __pyx_t_6);\n        __pyx_t_6 = 0;\n        __pyx_t_4 = __Pyx_PyObject_Call(__pyx_t_5, __pyx_t_9, NULL); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 4413, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_4);\n        __Pyx_DECREF(__pyx_t_9); __pyx_t_9 = 0;\n      }\n    }\n    __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n    __Pyx_Raise(__pyx_t_4, 0, 0, 0);\n    __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n    __PYX_ERR(0, 4413, __pyx_L1_error)\n\n    /* \"pywrapfst.pyx\":4412\n *     cdef fst.FarWriterClass *tfar = fst.FarWriterClass.Create(\n *         tostring(filename), tostring(arc_type), ft)\n *     if tfar == NULL:             # <<<<<<<<<<<<<<\n *       raise FstIOError(\"Open failed: {!r}\".format(filename))\n *     cdef FarWriter result = FarWriter.__new__(FarWriter)\n */\n  }\n\n  /* \"pywrapfst.pyx\":4414\n *     if tfar == NULL:\n *       raise FstIOError(\"Open failed: {!r}\".format(filename))\n *     cdef FarWriter result = FarWriter.__new__(FarWriter)             # <<<<<<<<<<<<<<\n *     result._writer.reset(tfar)\n *     return result\n */\n  __pyx_t_4 = __pyx_tp_new_9pywrapfst_FarWriter(((PyTypeObject *)__pyx_ptype_9pywrapfst_FarWriter), __pyx_empty_tuple, NULL); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 4414, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_4);\n  if (!(likely(__Pyx_TypeTest(__pyx_t_4, __pyx_ptype_9pywrapfst_FarWriter)))) __PYX_ERR(0, 4414, __pyx_L1_error)\n  __pyx_v_result = ((struct __pyx_obj_9pywrapfst_FarWriter *)__pyx_t_4);\n  __pyx_t_4 = 0;\n\n  /* \"pywrapfst.pyx\":4415\n *       raise FstIOError(\"Open failed: {!r}\".format(filename))\n *     cdef FarWriter result = FarWriter.__new__(FarWriter)\n *     result._writer.reset(tfar)             # <<<<<<<<<<<<<<\n *     return result\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_result) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_writer\");\n    __PYX_ERR(0, 4415, __pyx_L1_error)\n  }\n  __pyx_v_result->_writer.reset(__pyx_v_tfar);\n\n  /* \"pywrapfst.pyx\":4416\n *     cdef FarWriter result = FarWriter.__new__(FarWriter)\n *     result._writer.reset(tfar)\n *     return result             # <<<<<<<<<<<<<<\n * \n *   # NB: Invoking this method may be dangerous: calling any other method on the\n */\n  __Pyx_XDECREF(__pyx_r);\n  __Pyx_INCREF(((PyObject *)__pyx_v_result));\n  __pyx_r = ((PyObject *)__pyx_v_result);\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":4388\n * \n *   @classmethod\n *   def create(cls, filename, arc_type=b\"standard\", far_type=b\"default\"):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     FarWriter.\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_XDECREF(__pyx_t_6);\n  __Pyx_XDECREF(__pyx_t_7);\n  __Pyx_XDECREF(__pyx_t_8);\n  __Pyx_XDECREF(__pyx_t_9);\n  __Pyx_AddTraceback(\"pywrapfst.FarWriter.create\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XDECREF((PyObject *)__pyx_v_result);\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":4420\n *   # NB: Invoking this method may be dangerous: calling any other method on the\n *   # instance after this is invoked may result in a null dereference.\n *   cdef void close(self):             # <<<<<<<<<<<<<<\n *     self._writer.reset()\n * \n */\n\nstatic void __pyx_f_9pywrapfst_9FarWriter_close(struct __pyx_obj_9pywrapfst_FarWriter *__pyx_v_self) {\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"close\", 0);\n\n  /* \"pywrapfst.pyx\":4421\n *   # instance after this is invoked may result in a null dereference.\n *   cdef void close(self):\n *     self._writer.reset()             # <<<<<<<<<<<<<<\n * \n *   cpdef void add(self, key, _Fst ifst) except *:\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_writer\");\n    __PYX_ERR(0, 4421, __pyx_L1_error)\n  }\n  __pyx_v_self->_writer.reset();\n\n  /* \"pywrapfst.pyx\":4420\n *   # NB: Invoking this method may be dangerous: calling any other method on the\n *   # instance after this is invoked may result in a null dereference.\n *   cdef void close(self):             # <<<<<<<<<<<<<<\n *     self._writer.reset()\n * \n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_WriteUnraisable(\"pywrapfst.FarWriter.close\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n}\n\n/* \"pywrapfst.pyx\":4423\n *     self._writer.reset()\n * \n *   cpdef void add(self, key, _Fst ifst) except *:             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     add(self, key, ifst)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_9FarWriter_7add(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic void __pyx_f_9pywrapfst_9FarWriter_add(struct __pyx_obj_9pywrapfst_FarWriter *__pyx_v_self, PyObject *__pyx_v_key, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst, int __pyx_skip_dispatch) {\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  int __pyx_t_5;\n  PyObject *__pyx_t_6 = NULL;\n  std::string __pyx_t_7;\n  int __pyx_t_8;\n  __Pyx_RefNannySetupContext(\"add\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_add); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4423, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_9FarWriter_7add)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      __pyx_t_5 = 0;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n          __pyx_t_5 = 1;\n        }\n      }\n      #if CYTHON_FAST_PYCALL\n      if (PyFunction_Check(__pyx_t_3)) {\n        PyObject *__pyx_temp[3] = {__pyx_t_4, __pyx_v_key, ((PyObject *)__pyx_v_ifst)};\n        __pyx_t_2 = __Pyx_PyFunction_FastCall(__pyx_t_3, __pyx_temp+1-__pyx_t_5, 2+__pyx_t_5); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 4423, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_4); __pyx_t_4 = 0;\n        __Pyx_GOTREF(__pyx_t_2);\n      } else\n      #endif\n      #if CYTHON_FAST_PYCCALL\n      if (__Pyx_PyFastCFunction_Check(__pyx_t_3)) {\n        PyObject *__pyx_temp[3] = {__pyx_t_4, __pyx_v_key, ((PyObject *)__pyx_v_ifst)};\n        __pyx_t_2 = __Pyx_PyCFunction_FastCall(__pyx_t_3, __pyx_temp+1-__pyx_t_5, 2+__pyx_t_5); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 4423, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_4); __pyx_t_4 = 0;\n        __Pyx_GOTREF(__pyx_t_2);\n      } else\n      #endif\n      {\n        __pyx_t_6 = PyTuple_New(2+__pyx_t_5); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 4423, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_6);\n        if (__pyx_t_4) {\n          __Pyx_GIVEREF(__pyx_t_4); PyTuple_SET_ITEM(__pyx_t_6, 0, __pyx_t_4); __pyx_t_4 = NULL;\n        }\n        __Pyx_INCREF(__pyx_v_key);\n        __Pyx_GIVEREF(__pyx_v_key);\n        PyTuple_SET_ITEM(__pyx_t_6, 0+__pyx_t_5, __pyx_v_key);\n        __Pyx_INCREF(((PyObject *)__pyx_v_ifst));\n        __Pyx_GIVEREF(((PyObject *)__pyx_v_ifst));\n        PyTuple_SET_ITEM(__pyx_t_6, 1+__pyx_t_5, ((PyObject *)__pyx_v_ifst));\n        __pyx_t_2 = __Pyx_PyObject_Call(__pyx_t_3, __pyx_t_6, NULL); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 4423, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_2);\n        __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n      }\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":4442\n *     # Failure here results from passing an FST with a different arc type than\n *     # used by the FAR was initialized to use.\n *     if not self._writer.get().Add(tostring(key), deref(ifst._fst)):             # <<<<<<<<<<<<<<\n *       raise FstOpError(\"Incompatible or invalid arc type\")\n *     # An error here usually indicates a key out of order.\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_writer\");\n    __PYX_ERR(0, 4442, __pyx_L1_error)\n  }\n  __pyx_t_7 = __pyx_f_9pywrapfst_tostring(__pyx_v_key, NULL); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 4442, __pyx_L1_error)\n  if (unlikely(((PyObject *)__pyx_v_ifst) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 4442, __pyx_L1_error)\n  }\n  __pyx_t_8 = ((!(__pyx_v_self->_writer.get()->Add(__pyx_t_7, (*__pyx_v_ifst->_fst)) != 0)) != 0);\n  if (__pyx_t_8) {\n\n    /* \"pywrapfst.pyx\":4443\n *     # used by the FAR was initialized to use.\n *     if not self._writer.get().Add(tostring(key), deref(ifst._fst)):\n *       raise FstOpError(\"Incompatible or invalid arc type\")             # <<<<<<<<<<<<<<\n *     # An error here usually indicates a key out of order.\n *     if self._writer.get().Error():\n */\n    __pyx_t_1 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstOpError); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4443, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    __pyx_t_2 = __Pyx_PyObject_Call(__pyx_t_1, __pyx_tuple__95, NULL); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 4443, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_2);\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n    __Pyx_Raise(__pyx_t_2, 0, 0, 0);\n    __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n    __PYX_ERR(0, 4443, __pyx_L1_error)\n\n    /* \"pywrapfst.pyx\":4442\n *     # Failure here results from passing an FST with a different arc type than\n *     # used by the FAR was initialized to use.\n *     if not self._writer.get().Add(tostring(key), deref(ifst._fst)):             # <<<<<<<<<<<<<<\n *       raise FstOpError(\"Incompatible or invalid arc type\")\n *     # An error here usually indicates a key out of order.\n */\n  }\n\n  /* \"pywrapfst.pyx\":4445\n *       raise FstOpError(\"Incompatible or invalid arc type\")\n *     # An error here usually indicates a key out of order.\n *     if self._writer.get().Error():             # <<<<<<<<<<<<<<\n *       raise FstArgError(\"Key out of order\")\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_writer\");\n    __PYX_ERR(0, 4445, __pyx_L1_error)\n  }\n  __pyx_t_8 = (__pyx_v_self->_writer.get()->Error() != 0);\n  if (__pyx_t_8) {\n\n    /* \"pywrapfst.pyx\":4446\n *     # An error here usually indicates a key out of order.\n *     if self._writer.get().Error():\n *       raise FstArgError(\"Key out of order\")             # <<<<<<<<<<<<<<\n * \n *   cpdef string arc_type(self):\n */\n    __pyx_t_2 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstArgError); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 4446, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_2);\n    __pyx_t_1 = __Pyx_PyObject_Call(__pyx_t_2, __pyx_tuple__96, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4446, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n    __Pyx_Raise(__pyx_t_1, 0, 0, 0);\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n    __PYX_ERR(0, 4446, __pyx_L1_error)\n\n    /* \"pywrapfst.pyx\":4445\n *       raise FstOpError(\"Incompatible or invalid arc type\")\n *     # An error here usually indicates a key out of order.\n *     if self._writer.get().Error():             # <<<<<<<<<<<<<<\n *       raise FstArgError(\"Key out of order\")\n * \n */\n  }\n\n  /* \"pywrapfst.pyx\":4423\n *     self._writer.reset()\n * \n *   cpdef void add(self, key, _Fst ifst) except *:             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     add(self, key, ifst)\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_6);\n  __Pyx_AddTraceback(\"pywrapfst.FarWriter.add\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_9FarWriter_7add(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic char __pyx_doc_9pywrapfst_9FarWriter_6add[] = \"\\n    add(self, key, ifst)\\n\\n    Adds an FST to the FAR.\\n\\n    This method adds an FST to the FAR which can be retrieved with the\\n    specified string key.\\n\\n    Args:\\n      key: The string used to key the input FST.\\n      ifst: The FST to write to the FAR.\\n\\n    Raises:\\n      FstArgError: Key out of order.\\n      FstOpError: Incompatible or invalid arc type.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_9FarWriter_7add(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  PyObject *__pyx_v_key = 0;\n  struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst = 0;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"add (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_key,&__pyx_n_s_ifst,0};\n    PyObject* values[2] = {0,0};\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (likely((values[0] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_key)) != 0)) kw_args--;\n        else goto __pyx_L5_argtuple_error;\n        CYTHON_FALLTHROUGH;\n        case  1:\n        if (likely((values[1] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_ifst)) != 0)) kw_args--;\n        else {\n          __Pyx_RaiseArgtupleInvalid(\"add\", 1, 2, 2, 1); __PYX_ERR(0, 4423, __pyx_L3_error)\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"add\") < 0)) __PYX_ERR(0, 4423, __pyx_L3_error)\n      }\n    } else if (PyTuple_GET_SIZE(__pyx_args) != 2) {\n      goto __pyx_L5_argtuple_error;\n    } else {\n      values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n      values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n    }\n    __pyx_v_key = values[0];\n    __pyx_v_ifst = ((struct __pyx_obj_9pywrapfst__Fst *)values[1]);\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"add\", 1, 2, 2, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 4423, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst.FarWriter.add\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_ifst), __pyx_ptype_9pywrapfst__Fst, 1, \"ifst\", 0))) __PYX_ERR(0, 4423, __pyx_L1_error)\n  __pyx_r = __pyx_pf_9pywrapfst_9FarWriter_6add(((struct __pyx_obj_9pywrapfst_FarWriter *)__pyx_v_self), __pyx_v_key, __pyx_v_ifst);\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_9FarWriter_6add(struct __pyx_obj_9pywrapfst_FarWriter *__pyx_v_self, PyObject *__pyx_v_key, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"add\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_f_9pywrapfst_9FarWriter_add(__pyx_v_self, __pyx_v_key, __pyx_v_ifst, 1); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 4423, __pyx_L1_error)\n  __pyx_t_1 = __Pyx_void_to_None(NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4423, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.FarWriter.add\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":4448\n *       raise FstArgError(\"Key out of order\")\n * \n *   cpdef string arc_type(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     arc_type(self)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_9FarWriter_9arc_type(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic std::string __pyx_f_9pywrapfst_9FarWriter_arc_type(struct __pyx_obj_9pywrapfst_FarWriter *__pyx_v_self, int __pyx_skip_dispatch) {\n  std::string __pyx_r;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  std::string __pyx_t_5;\n  __Pyx_RefNannySetupContext(\"arc_type\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_arc_type); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4448, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_9FarWriter_9arc_type)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 4448, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 4448, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __pyx_t_5 = __pyx_convert_string_from_py_std__in_string(__pyx_t_2); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 4448, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __pyx_r = __pyx_t_5;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":4454\n *     Returns a string indicating the arc type.\n *     \"\"\"\n *     return self._writer.get().ArcType()             # <<<<<<<<<<<<<<\n * \n *   cpdef bool error(self):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_writer\");\n    __PYX_ERR(0, 4454, __pyx_L1_error)\n  }\n  __pyx_r = __pyx_v_self->_writer.get()->ArcType();\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":4448\n *       raise FstArgError(\"Key out of order\")\n * \n *   cpdef string arc_type(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     arc_type(self)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_WriteUnraisable(\"pywrapfst.FarWriter.arc_type\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __Pyx_pretend_to_initialize(&__pyx_r);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_9FarWriter_9arc_type(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_9FarWriter_8arc_type[] = \"\\n    arc_type(self)\\n\\n    Returns a string indicating the arc type.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_9FarWriter_9arc_type(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"arc_type (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_9FarWriter_8arc_type(((struct __pyx_obj_9pywrapfst_FarWriter *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_9FarWriter_8arc_type(struct __pyx_obj_9pywrapfst_FarWriter *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"arc_type\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __pyx_convert_PyBytes_string_to_py_std__in_string(__pyx_f_9pywrapfst_9FarWriter_arc_type(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4448, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.FarWriter.arc_type\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":4456\n *     return self._writer.get().ArcType()\n * \n *   cpdef bool error(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     error(self)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_9FarWriter_11error(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic bool __pyx_f_9pywrapfst_9FarWriter_error(struct __pyx_obj_9pywrapfst_FarWriter *__pyx_v_self, int __pyx_skip_dispatch) {\n  bool __pyx_r;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  bool __pyx_t_5;\n  __Pyx_RefNannySetupContext(\"error\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_error); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4456, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_9FarWriter_11error)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 4456, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 4456, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __pyx_t_5 = __Pyx_PyObject_IsTrue(__pyx_t_2); if (unlikely((__pyx_t_5 == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 4456, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __pyx_r = __pyx_t_5;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":4465\n *       True if the FarWriter is in an errorful state, False otherwise.\n *     \"\"\"\n *     return self._writer.get().Error()             # <<<<<<<<<<<<<<\n * \n *   cpdef string far_type(self):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_writer\");\n    __PYX_ERR(0, 4465, __pyx_L1_error)\n  }\n  __pyx_r = __pyx_v_self->_writer.get()->Error();\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":4456\n *     return self._writer.get().ArcType()\n * \n *   cpdef bool error(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     error(self)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_WriteUnraisable(\"pywrapfst.FarWriter.error\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_9FarWriter_11error(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_9FarWriter_10error[] = \"\\n    error(self)\\n\\n    Indicates whether the FarWriter has encountered an error.\\n\\n    Returns:\\n      True if the FarWriter is in an errorful state, False otherwise.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_9FarWriter_11error(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"error (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_9FarWriter_10error(((struct __pyx_obj_9pywrapfst_FarWriter *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_9FarWriter_10error(struct __pyx_obj_9pywrapfst_FarWriter *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"error\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __Pyx_PyBool_FromLong(__pyx_f_9pywrapfst_9FarWriter_error(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4456, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.FarWriter.error\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":4467\n *     return self._writer.get().Error()\n * \n *   cpdef string far_type(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     far_type(self)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_9FarWriter_13far_type(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic std::string __pyx_f_9pywrapfst_9FarWriter_far_type(struct __pyx_obj_9pywrapfst_FarWriter *__pyx_v_self, int __pyx_skip_dispatch) {\n  std::string __pyx_r;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  std::string __pyx_t_5;\n  __Pyx_RefNannySetupContext(\"far_type\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_far_type); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4467, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_9FarWriter_13far_type)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 4467, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 4467, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __pyx_t_5 = __pyx_convert_string_from_py_std__in_string(__pyx_t_2); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 4467, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __pyx_r = __pyx_t_5;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":4473\n *     Returns a string indicating the FAR type.\n *     \"\"\"\n *     return fst.GetFarTypeString(self._writer.get().Type())             # <<<<<<<<<<<<<<\n * \n *   # Dictionary-like assignment.\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_writer\");\n    __PYX_ERR(0, 4473, __pyx_L1_error)\n  }\n  __pyx_r = fst::GetFarTypeString(__pyx_v_self->_writer.get()->Type());\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":4467\n *     return self._writer.get().Error()\n * \n *   cpdef string far_type(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     far_type(self)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_WriteUnraisable(\"pywrapfst.FarWriter.far_type\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __Pyx_pretend_to_initialize(&__pyx_r);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_9FarWriter_13far_type(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_9FarWriter_12far_type[] = \"\\n    far_type(self)\\n\\n    Returns a string indicating the FAR type.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_9FarWriter_13far_type(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"far_type (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_9FarWriter_12far_type(((struct __pyx_obj_9pywrapfst_FarWriter *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_9FarWriter_12far_type(struct __pyx_obj_9pywrapfst_FarWriter *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"far_type\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __pyx_convert_PyBytes_string_to_py_std__in_string(__pyx_f_9pywrapfst_9FarWriter_far_type(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4467, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.FarWriter.far_type\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":4476\n * \n *   # Dictionary-like assignment.\n *   def __setitem__(self, key, _Fst fst):             # <<<<<<<<<<<<<<\n *     self.add(key, fst)\n * \n */\n\n/* Python wrapper */\nstatic int __pyx_pw_9pywrapfst_9FarWriter_15__setitem__(PyObject *__pyx_v_self, PyObject *__pyx_v_key, PyObject *__pyx_v_fst); /*proto*/\nstatic int __pyx_pw_9pywrapfst_9FarWriter_15__setitem__(PyObject *__pyx_v_self, PyObject *__pyx_v_key, PyObject *__pyx_v_fst) {\n  int __pyx_r;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__setitem__ (wrapper)\", 0);\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_fst), __pyx_ptype_9pywrapfst__Fst, 1, \"fst\", 0))) __PYX_ERR(0, 4476, __pyx_L1_error)\n  __pyx_r = __pyx_pf_9pywrapfst_9FarWriter_14__setitem__(((struct __pyx_obj_9pywrapfst_FarWriter *)__pyx_v_self), ((PyObject *)__pyx_v_key), ((struct __pyx_obj_9pywrapfst__Fst *)__pyx_v_fst));\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __pyx_r = -1;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic int __pyx_pf_9pywrapfst_9FarWriter_14__setitem__(struct __pyx_obj_9pywrapfst_FarWriter *__pyx_v_self, PyObject *__pyx_v_key, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_fst) {\n  int __pyx_r;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__setitem__\", 0);\n\n  /* \"pywrapfst.pyx\":4477\n *   # Dictionary-like assignment.\n *   def __setitem__(self, key, _Fst fst):\n *     self.add(key, fst)             # <<<<<<<<<<<<<<\n * \n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"add\");\n    __PYX_ERR(0, 4477, __pyx_L1_error)\n  }\n  ((struct __pyx_vtabstruct_9pywrapfst_FarWriter *)__pyx_v_self->__pyx_vtab)->add(__pyx_v_self, __pyx_v_key, __pyx_v_fst, 0); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 4477, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":4476\n * \n *   # Dictionary-like assignment.\n *   def __setitem__(self, key, _Fst fst):             # <<<<<<<<<<<<<<\n *     self.add(key, fst)\n * \n */\n\n  /* function exit code */\n  __pyx_r = 0;\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"pywrapfst.FarWriter.__setitem__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = -1;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"(tree fragment)\":1\n * def __reduce_cython__(self):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._writer cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_9FarWriter_17__reduce_cython__(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_9FarWriter_17__reduce_cython__(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__reduce_cython__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_9FarWriter_16__reduce_cython__(((struct __pyx_obj_9pywrapfst_FarWriter *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_9FarWriter_16__reduce_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst_FarWriter *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"__reduce_cython__\", 0);\n\n  /* \"(tree fragment)\":2\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._writer cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._writer cannot be converted to a Python object for pickling\")\n */\n  __pyx_t_1 = __Pyx_PyObject_Call(__pyx_builtin_TypeError, __pyx_tuple__97, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(1, 2, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __Pyx_Raise(__pyx_t_1, 0, 0, 0);\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  __PYX_ERR(1, 2, __pyx_L1_error)\n\n  /* \"(tree fragment)\":1\n * def __reduce_cython__(self):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._writer cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.FarWriter.__reduce_cython__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"(tree fragment)\":3\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._writer cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._writer cannot be converted to a Python object for pickling\")\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_9FarWriter_19__setstate_cython__(PyObject *__pyx_v_self, PyObject *__pyx_v___pyx_state); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_9FarWriter_19__setstate_cython__(PyObject *__pyx_v_self, PyObject *__pyx_v___pyx_state) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__setstate_cython__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_9FarWriter_18__setstate_cython__(((struct __pyx_obj_9pywrapfst_FarWriter *)__pyx_v_self), ((PyObject *)__pyx_v___pyx_state));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_9FarWriter_18__setstate_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst_FarWriter *__pyx_v_self, CYTHON_UNUSED PyObject *__pyx_v___pyx_state) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"__setstate_cython__\", 0);\n\n  /* \"(tree fragment)\":4\n *     raise TypeError(\"self._writer cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._writer cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n */\n  __pyx_t_1 = __Pyx_PyObject_Call(__pyx_builtin_TypeError, __pyx_tuple__98, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(1, 4, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __Pyx_Raise(__pyx_t_1, 0, 0, 0);\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  __PYX_ERR(1, 4, __pyx_L1_error)\n\n  /* \"(tree fragment)\":3\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._writer cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._writer cannot be converted to a Python object for pickling\")\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.FarWriter.__setstate_cython__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":4492\n * \n * @atexit.register\n * def _reset_fst_error_fatal():             # <<<<<<<<<<<<<<\n *   fst.FLAGS_fst_error_fatal = _fst_error_fatal_old\n * \n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_59_reset_fst_error_fatal(PyObject *__pyx_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic PyMethodDef __pyx_mdef_9pywrapfst_59_reset_fst_error_fatal = {\"_reset_fst_error_fatal\", (PyCFunction)__pyx_pw_9pywrapfst_59_reset_fst_error_fatal, METH_NOARGS, 0};\nstatic PyObject *__pyx_pw_9pywrapfst_59_reset_fst_error_fatal(PyObject *__pyx_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"_reset_fst_error_fatal (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_58_reset_fst_error_fatal(__pyx_self);\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_58_reset_fst_error_fatal(CYTHON_UNUSED PyObject *__pyx_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  bool __pyx_t_2;\n  __Pyx_RefNannySetupContext(\"_reset_fst_error_fatal\", 0);\n\n  /* \"pywrapfst.pyx\":4493\n * @atexit.register\n * def _reset_fst_error_fatal():\n *   fst.FLAGS_fst_error_fatal = _fst_error_fatal_old             # <<<<<<<<<<<<<<\n * \n */\n  __pyx_t_1 = __Pyx_GetModuleGlobalName(__pyx_n_s_fst_error_fatal_old); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4493, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_t_2 = __Pyx_PyObject_IsTrue(__pyx_t_1); if (unlikely((__pyx_t_2 == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 4493, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  FLAGS_fst_error_fatal = __pyx_t_2;\n\n  /* \"pywrapfst.pyx\":4492\n * \n * @atexit.register\n * def _reset_fst_error_fatal():             # <<<<<<<<<<<<<<\n *   fst.FLAGS_fst_error_fatal = _fst_error_fatal_old\n * \n */\n\n  /* function exit code */\n  __pyx_r = Py_None; __Pyx_INCREF(Py_None);\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst._reset_fst_error_fatal\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"string.from_py\":13\n * \n * @cname(\"__pyx_convert_string_from_py_std__in_string\")\n * cdef string __pyx_convert_string_from_py_std__in_string(object o) except *:             # <<<<<<<<<<<<<<\n *     cdef Py_ssize_t length\n *     cdef const char* data = __Pyx_PyObject_AsStringAndSize(o, &length)\n */\n\nstatic std::string __pyx_convert_string_from_py_std__in_string(PyObject *__pyx_v_o) {\n  Py_ssize_t __pyx_v_length;\n  char const *__pyx_v_data;\n  std::string __pyx_r;\n  __Pyx_RefNannyDeclarations\n  char const *__pyx_t_1;\n  __Pyx_RefNannySetupContext(\"__pyx_convert_string_from_py_std__in_string\", 0);\n\n  /* \"string.from_py\":15\n * cdef string __pyx_convert_string_from_py_std__in_string(object o) except *:\n *     cdef Py_ssize_t length\n *     cdef const char* data = __Pyx_PyObject_AsStringAndSize(o, &length)             # <<<<<<<<<<<<<<\n *     return string(data, length)\n * \n */\n  __pyx_t_1 = __Pyx_PyObject_AsStringAndSize(__pyx_v_o, (&__pyx_v_length)); if (unlikely(__pyx_t_1 == ((char const *)NULL))) __PYX_ERR(1, 15, __pyx_L1_error)\n  __pyx_v_data = __pyx_t_1;\n\n  /* \"string.from_py\":16\n *     cdef Py_ssize_t length\n *     cdef const char* data = __Pyx_PyObject_AsStringAndSize(o, &length)\n *     return string(data, length)             # <<<<<<<<<<<<<<\n * \n * \n */\n  __pyx_r = std::string(__pyx_v_data, __pyx_v_length);\n  goto __pyx_L0;\n\n  /* \"string.from_py\":13\n * \n * @cname(\"__pyx_convert_string_from_py_std__in_string\")\n * cdef string __pyx_convert_string_from_py_std__in_string(object o) except *:             # <<<<<<<<<<<<<<\n *     cdef Py_ssize_t length\n *     cdef const char* data = __Pyx_PyObject_AsStringAndSize(o, &length)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"string.from_py.__pyx_convert_string_from_py_std__in_string\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_pretend_to_initialize(&__pyx_r);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"string.to_py\":31\n * \n * @cname(\"__pyx_convert_PyObject_string_to_py_std__in_string\")\n * cdef inline object __pyx_convert_PyObject_string_to_py_std__in_string(const string& s):             # <<<<<<<<<<<<<<\n *     return __Pyx_PyObject_FromStringAndSize(s.data(), s.size())\n * cdef extern from *:\n */\n\nstatic CYTHON_INLINE PyObject *__pyx_convert_PyObject_string_to_py_std__in_string(std::string const &__pyx_v_s) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"__pyx_convert_PyObject_string_to_py_std__in_string\", 0);\n\n  /* \"string.to_py\":32\n * @cname(\"__pyx_convert_PyObject_string_to_py_std__in_string\")\n * cdef inline object __pyx_convert_PyObject_string_to_py_std__in_string(const string& s):\n *     return __Pyx_PyObject_FromStringAndSize(s.data(), s.size())             # <<<<<<<<<<<<<<\n * cdef extern from *:\n *     cdef object __Pyx_PyUnicode_FromStringAndSize(const char*, size_t)\n */\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __Pyx_PyObject_FromStringAndSize(__pyx_v_s.data(), __pyx_v_s.size()); if (unlikely(!__pyx_t_1)) __PYX_ERR(1, 32, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* \"string.to_py\":31\n * \n * @cname(\"__pyx_convert_PyObject_string_to_py_std__in_string\")\n * cdef inline object __pyx_convert_PyObject_string_to_py_std__in_string(const string& s):             # <<<<<<<<<<<<<<\n *     return __Pyx_PyObject_FromStringAndSize(s.data(), s.size())\n * cdef extern from *:\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"string.to_py.__pyx_convert_PyObject_string_to_py_std__in_string\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"string.to_py\":37\n * \n * @cname(\"__pyx_convert_PyUnicode_string_to_py_std__in_string\")\n * cdef inline object __pyx_convert_PyUnicode_string_to_py_std__in_string(const string& s):             # <<<<<<<<<<<<<<\n *     return __Pyx_PyUnicode_FromStringAndSize(s.data(), s.size())\n * cdef extern from *:\n */\n\nstatic CYTHON_INLINE PyObject *__pyx_convert_PyUnicode_string_to_py_std__in_string(std::string const &__pyx_v_s) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"__pyx_convert_PyUnicode_string_to_py_std__in_string\", 0);\n\n  /* \"string.to_py\":38\n * @cname(\"__pyx_convert_PyUnicode_string_to_py_std__in_string\")\n * cdef inline object __pyx_convert_PyUnicode_string_to_py_std__in_string(const string& s):\n *     return __Pyx_PyUnicode_FromStringAndSize(s.data(), s.size())             # <<<<<<<<<<<<<<\n * cdef extern from *:\n *     cdef object __Pyx_PyStr_FromStringAndSize(const char*, size_t)\n */\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __Pyx_PyUnicode_FromStringAndSize(__pyx_v_s.data(), __pyx_v_s.size()); if (unlikely(!__pyx_t_1)) __PYX_ERR(1, 38, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* \"string.to_py\":37\n * \n * @cname(\"__pyx_convert_PyUnicode_string_to_py_std__in_string\")\n * cdef inline object __pyx_convert_PyUnicode_string_to_py_std__in_string(const string& s):             # <<<<<<<<<<<<<<\n *     return __Pyx_PyUnicode_FromStringAndSize(s.data(), s.size())\n * cdef extern from *:\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"string.to_py.__pyx_convert_PyUnicode_string_to_py_std__in_string\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"string.to_py\":43\n * \n * @cname(\"__pyx_convert_PyStr_string_to_py_std__in_string\")\n * cdef inline object __pyx_convert_PyStr_string_to_py_std__in_string(const string& s):             # <<<<<<<<<<<<<<\n *     return __Pyx_PyStr_FromStringAndSize(s.data(), s.size())\n * cdef extern from *:\n */\n\nstatic CYTHON_INLINE PyObject *__pyx_convert_PyStr_string_to_py_std__in_string(std::string const &__pyx_v_s) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"__pyx_convert_PyStr_string_to_py_std__in_string\", 0);\n\n  /* \"string.to_py\":44\n * @cname(\"__pyx_convert_PyStr_string_to_py_std__in_string\")\n * cdef inline object __pyx_convert_PyStr_string_to_py_std__in_string(const string& s):\n *     return __Pyx_PyStr_FromStringAndSize(s.data(), s.size())             # <<<<<<<<<<<<<<\n * cdef extern from *:\n *     cdef object __Pyx_PyBytes_FromStringAndSize(const char*, size_t)\n */\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __Pyx_PyStr_FromStringAndSize(__pyx_v_s.data(), __pyx_v_s.size()); if (unlikely(!__pyx_t_1)) __PYX_ERR(1, 44, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* \"string.to_py\":43\n * \n * @cname(\"__pyx_convert_PyStr_string_to_py_std__in_string\")\n * cdef inline object __pyx_convert_PyStr_string_to_py_std__in_string(const string& s):             # <<<<<<<<<<<<<<\n *     return __Pyx_PyStr_FromStringAndSize(s.data(), s.size())\n * cdef extern from *:\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"string.to_py.__pyx_convert_PyStr_string_to_py_std__in_string\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"string.to_py\":49\n * \n * @cname(\"__pyx_convert_PyBytes_string_to_py_std__in_string\")\n * cdef inline object __pyx_convert_PyBytes_string_to_py_std__in_string(const string& s):             # <<<<<<<<<<<<<<\n *     return __Pyx_PyBytes_FromStringAndSize(s.data(), s.size())\n * cdef extern from *:\n */\n\nstatic CYTHON_INLINE PyObject *__pyx_convert_PyBytes_string_to_py_std__in_string(std::string const &__pyx_v_s) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"__pyx_convert_PyBytes_string_to_py_std__in_string\", 0);\n\n  /* \"string.to_py\":50\n * @cname(\"__pyx_convert_PyBytes_string_to_py_std__in_string\")\n * cdef inline object __pyx_convert_PyBytes_string_to_py_std__in_string(const string& s):\n *     return __Pyx_PyBytes_FromStringAndSize(s.data(), s.size())             # <<<<<<<<<<<<<<\n * cdef extern from *:\n *     cdef object __Pyx_PyByteArray_FromStringAndSize(const char*, size_t)\n */\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __Pyx_PyBytes_FromStringAndSize(__pyx_v_s.data(), __pyx_v_s.size()); if (unlikely(!__pyx_t_1)) __PYX_ERR(1, 50, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* \"string.to_py\":49\n * \n * @cname(\"__pyx_convert_PyBytes_string_to_py_std__in_string\")\n * cdef inline object __pyx_convert_PyBytes_string_to_py_std__in_string(const string& s):             # <<<<<<<<<<<<<<\n *     return __Pyx_PyBytes_FromStringAndSize(s.data(), s.size())\n * cdef extern from *:\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"string.to_py.__pyx_convert_PyBytes_string_to_py_std__in_string\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"string.to_py\":55\n * \n * @cname(\"__pyx_convert_PyByteArray_string_to_py_std__in_string\")\n * cdef inline object __pyx_convert_PyByteArray_string_to_py_std__in_string(const string& s):             # <<<<<<<<<<<<<<\n *     return __Pyx_PyByteArray_FromStringAndSize(s.data(), s.size())\n * \n */\n\nstatic CYTHON_INLINE PyObject *__pyx_convert_PyByteArray_string_to_py_std__in_string(std::string const &__pyx_v_s) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"__pyx_convert_PyByteArray_string_to_py_std__in_string\", 0);\n\n  /* \"string.to_py\":56\n * @cname(\"__pyx_convert_PyByteArray_string_to_py_std__in_string\")\n * cdef inline object __pyx_convert_PyByteArray_string_to_py_std__in_string(const string& s):\n *     return __Pyx_PyByteArray_FromStringAndSize(s.data(), s.size())             # <<<<<<<<<<<<<<\n * \n */\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __Pyx_PyByteArray_FromStringAndSize(__pyx_v_s.data(), __pyx_v_s.size()); if (unlikely(!__pyx_t_1)) __PYX_ERR(1, 56, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* \"string.to_py\":55\n * \n * @cname(\"__pyx_convert_PyByteArray_string_to_py_std__in_string\")\n * cdef inline object __pyx_convert_PyByteArray_string_to_py_std__in_string(const string& s):             # <<<<<<<<<<<<<<\n *     return __Pyx_PyByteArray_FromStringAndSize(s.data(), s.size())\n * \n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"string.to_py.__pyx_convert_PyByteArray_string_to_py_std__in_string\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"vector.from_py\":45\n * \n * @cname(\"__pyx_convert_vector_from_py___pyx_t_10basictypes_int64\")\n * cdef vector[X] __pyx_convert_vector_from_py___pyx_t_10basictypes_int64(object o) except *:             # <<<<<<<<<<<<<<\n *     cdef vector[X] v\n *     for item in o:\n */\n\nstatic std::vector<__pyx_t_10basictypes_int64>  __pyx_convert_vector_from_py___pyx_t_10basictypes_int64(PyObject *__pyx_v_o) {\n  std::vector<__pyx_t_10basictypes_int64>  __pyx_v_v;\n  PyObject *__pyx_v_item = NULL;\n  std::vector<__pyx_t_10basictypes_int64>  __pyx_r;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  Py_ssize_t __pyx_t_2;\n  PyObject *(*__pyx_t_3)(PyObject *);\n  PyObject *__pyx_t_4 = NULL;\n  __pyx_t_10basictypes_int64 __pyx_t_5;\n  __Pyx_RefNannySetupContext(\"__pyx_convert_vector_from_py___pyx_t_10basictypes_int64\", 0);\n\n  /* \"vector.from_py\":47\n * cdef vector[X] __pyx_convert_vector_from_py___pyx_t_10basictypes_int64(object o) except *:\n *     cdef vector[X] v\n *     for item in o:             # <<<<<<<<<<<<<<\n *         v.push_back(<X>item)\n *     return v\n */\n  if (likely(PyList_CheckExact(__pyx_v_o)) || PyTuple_CheckExact(__pyx_v_o)) {\n    __pyx_t_1 = __pyx_v_o; __Pyx_INCREF(__pyx_t_1); __pyx_t_2 = 0;\n    __pyx_t_3 = NULL;\n  } else {\n    __pyx_t_2 = -1; __pyx_t_1 = PyObject_GetIter(__pyx_v_o); if (unlikely(!__pyx_t_1)) __PYX_ERR(1, 47, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    __pyx_t_3 = Py_TYPE(__pyx_t_1)->tp_iternext; if (unlikely(!__pyx_t_3)) __PYX_ERR(1, 47, __pyx_L1_error)\n  }\n  for (;;) {\n    if (likely(!__pyx_t_3)) {\n      if (likely(PyList_CheckExact(__pyx_t_1))) {\n        if (__pyx_t_2 >= PyList_GET_SIZE(__pyx_t_1)) break;\n        #if CYTHON_ASSUME_SAFE_MACROS && !CYTHON_AVOID_BORROWED_REFS\n        __pyx_t_4 = PyList_GET_ITEM(__pyx_t_1, __pyx_t_2); __Pyx_INCREF(__pyx_t_4); __pyx_t_2++; if (unlikely(0 < 0)) __PYX_ERR(1, 47, __pyx_L1_error)\n        #else\n        __pyx_t_4 = PySequence_ITEM(__pyx_t_1, __pyx_t_2); __pyx_t_2++; if (unlikely(!__pyx_t_4)) __PYX_ERR(1, 47, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_4);\n        #endif\n      } else {\n        if (__pyx_t_2 >= PyTuple_GET_SIZE(__pyx_t_1)) break;\n        #if CYTHON_ASSUME_SAFE_MACROS && !CYTHON_AVOID_BORROWED_REFS\n        __pyx_t_4 = PyTuple_GET_ITEM(__pyx_t_1, __pyx_t_2); __Pyx_INCREF(__pyx_t_4); __pyx_t_2++; if (unlikely(0 < 0)) __PYX_ERR(1, 47, __pyx_L1_error)\n        #else\n        __pyx_t_4 = PySequence_ITEM(__pyx_t_1, __pyx_t_2); __pyx_t_2++; if (unlikely(!__pyx_t_4)) __PYX_ERR(1, 47, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_4);\n        #endif\n      }\n    } else {\n      __pyx_t_4 = __pyx_t_3(__pyx_t_1);\n      if (unlikely(!__pyx_t_4)) {\n        PyObject* exc_type = PyErr_Occurred();\n        if (exc_type) {\n          if (likely(__Pyx_PyErr_GivenExceptionMatches(exc_type, PyExc_StopIteration))) PyErr_Clear();\n          else __PYX_ERR(1, 47, __pyx_L1_error)\n        }\n        break;\n      }\n      __Pyx_GOTREF(__pyx_t_4);\n    }\n    __Pyx_XDECREF_SET(__pyx_v_item, __pyx_t_4);\n    __pyx_t_4 = 0;\n\n    /* \"vector.from_py\":48\n *     cdef vector[X] v\n *     for item in o:\n *         v.push_back(<X>item)             # <<<<<<<<<<<<<<\n *     return v\n * \n */\n    __pyx_t_5 = __Pyx_PyInt_As_int64_t(__pyx_v_item); if (unlikely((__pyx_t_5 == ((int64_t)-1)) && PyErr_Occurred())) __PYX_ERR(1, 48, __pyx_L1_error)\n    __pyx_v_v.push_back(((__pyx_t_10basictypes_int64)__pyx_t_5));\n\n    /* \"vector.from_py\":47\n * cdef vector[X] __pyx_convert_vector_from_py___pyx_t_10basictypes_int64(object o) except *:\n *     cdef vector[X] v\n *     for item in o:             # <<<<<<<<<<<<<<\n *         v.push_back(<X>item)\n *     return v\n */\n  }\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"vector.from_py\":49\n *     for item in o:\n *         v.push_back(<X>item)\n *     return v             # <<<<<<<<<<<<<<\n * \n * \n */\n  __pyx_r = __pyx_v_v;\n  goto __pyx_L0;\n\n  /* \"vector.from_py\":45\n * \n * @cname(\"__pyx_convert_vector_from_py___pyx_t_10basictypes_int64\")\n * cdef vector[X] __pyx_convert_vector_from_py___pyx_t_10basictypes_int64(object o) except *:             # <<<<<<<<<<<<<<\n *     cdef vector[X] v\n *     for item in o:\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_AddTraceback(\"vector.from_py.__pyx_convert_vector_from_py___pyx_t_10basictypes_int64\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_pretend_to_initialize(&__pyx_r);\n  __pyx_L0:;\n  __Pyx_XDECREF(__pyx_v_item);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic std::vector<std::string>  __pyx_convert_vector_from_py_std_3a__3a_string(PyObject *__pyx_v_o) {\n  std::vector<std::string>  __pyx_v_v;\n  PyObject *__pyx_v_item = NULL;\n  std::vector<std::string>  __pyx_r;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  Py_ssize_t __pyx_t_2;\n  PyObject *(*__pyx_t_3)(PyObject *);\n  PyObject *__pyx_t_4 = NULL;\n  std::string __pyx_t_5;\n  __Pyx_RefNannySetupContext(\"__pyx_convert_vector_from_py_std_3a__3a_string\", 0);\n\n  /* \"vector.from_py\":47\n * cdef vector[X] __pyx_convert_vector_from_py_std_3a__3a_string(object o) except *:\n *     cdef vector[X] v\n *     for item in o:             # <<<<<<<<<<<<<<\n *         v.push_back(<X>item)\n *     return v\n */\n  if (likely(PyList_CheckExact(__pyx_v_o)) || PyTuple_CheckExact(__pyx_v_o)) {\n    __pyx_t_1 = __pyx_v_o; __Pyx_INCREF(__pyx_t_1); __pyx_t_2 = 0;\n    __pyx_t_3 = NULL;\n  } else {\n    __pyx_t_2 = -1; __pyx_t_1 = PyObject_GetIter(__pyx_v_o); if (unlikely(!__pyx_t_1)) __PYX_ERR(1, 47, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    __pyx_t_3 = Py_TYPE(__pyx_t_1)->tp_iternext; if (unlikely(!__pyx_t_3)) __PYX_ERR(1, 47, __pyx_L1_error)\n  }\n  for (;;) {\n    if (likely(!__pyx_t_3)) {\n      if (likely(PyList_CheckExact(__pyx_t_1))) {\n        if (__pyx_t_2 >= PyList_GET_SIZE(__pyx_t_1)) break;\n        #if CYTHON_ASSUME_SAFE_MACROS && !CYTHON_AVOID_BORROWED_REFS\n        __pyx_t_4 = PyList_GET_ITEM(__pyx_t_1, __pyx_t_2); __Pyx_INCREF(__pyx_t_4); __pyx_t_2++; if (unlikely(0 < 0)) __PYX_ERR(1, 47, __pyx_L1_error)\n        #else\n        __pyx_t_4 = PySequence_ITEM(__pyx_t_1, __pyx_t_2); __pyx_t_2++; if (unlikely(!__pyx_t_4)) __PYX_ERR(1, 47, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_4);\n        #endif\n      } else {\n        if (__pyx_t_2 >= PyTuple_GET_SIZE(__pyx_t_1)) break;\n        #if CYTHON_ASSUME_SAFE_MACROS && !CYTHON_AVOID_BORROWED_REFS\n        __pyx_t_4 = PyTuple_GET_ITEM(__pyx_t_1, __pyx_t_2); __Pyx_INCREF(__pyx_t_4); __pyx_t_2++; if (unlikely(0 < 0)) __PYX_ERR(1, 47, __pyx_L1_error)\n        #else\n        __pyx_t_4 = PySequence_ITEM(__pyx_t_1, __pyx_t_2); __pyx_t_2++; if (unlikely(!__pyx_t_4)) __PYX_ERR(1, 47, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_4);\n        #endif\n      }\n    } else {\n      __pyx_t_4 = __pyx_t_3(__pyx_t_1);\n      if (unlikely(!__pyx_t_4)) {\n        PyObject* exc_type = PyErr_Occurred();\n        if (exc_type) {\n          if (likely(__Pyx_PyErr_GivenExceptionMatches(exc_type, PyExc_StopIteration))) PyErr_Clear();\n          else __PYX_ERR(1, 47, __pyx_L1_error)\n        }\n        break;\n      }\n      __Pyx_GOTREF(__pyx_t_4);\n    }\n    __Pyx_XDECREF_SET(__pyx_v_item, __pyx_t_4);\n    __pyx_t_4 = 0;\n\n    /* \"vector.from_py\":48\n *     cdef vector[X] v\n *     for item in o:\n *         v.push_back(<X>item)             # <<<<<<<<<<<<<<\n *     return v\n * \n */\n    __pyx_t_5 = __pyx_convert_string_from_py_std__in_string(__pyx_v_item); if (unlikely(PyErr_Occurred())) __PYX_ERR(1, 48, __pyx_L1_error)\n    __pyx_v_v.push_back(((std::string)__pyx_t_5));\n\n    /* \"vector.from_py\":47\n * cdef vector[X] __pyx_convert_vector_from_py_std_3a__3a_string(object o) except *:\n *     cdef vector[X] v\n *     for item in o:             # <<<<<<<<<<<<<<\n *         v.push_back(<X>item)\n *     return v\n */\n  }\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"vector.from_py\":49\n *     for item in o:\n *         v.push_back(<X>item)\n *     return v             # <<<<<<<<<<<<<<\n * \n * \n */\n  __pyx_r = __pyx_v_v;\n  goto __pyx_L0;\n\n  /* \"vector.from_py\":45\n * \n * @cname(\"__pyx_convert_vector_from_py_std_3a__3a_string\")\n * cdef vector[X] __pyx_convert_vector_from_py_std_3a__3a_string(object o) except *:             # <<<<<<<<<<<<<<\n *     cdef vector[X] v\n *     for item in o:\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_AddTraceback(\"vector.from_py.__pyx_convert_vector_from_py_std_3a__3a_string\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_pretend_to_initialize(&__pyx_r);\n  __pyx_L0:;\n  __Pyx_XDECREF(__pyx_v_item);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\nstatic struct __pyx_vtabstruct_9pywrapfst_Weight __pyx_vtable_9pywrapfst_Weight;\n\nstatic PyObject *__pyx_tp_new_9pywrapfst_Weight(PyTypeObject *t, CYTHON_UNUSED PyObject *a, CYTHON_UNUSED PyObject *k) {\n  struct __pyx_obj_9pywrapfst_Weight *p;\n  PyObject *o;\n  if (likely((t->tp_flags & Py_TPFLAGS_IS_ABSTRACT) == 0)) {\n    o = (*t->tp_alloc)(t, 0);\n  } else {\n    o = (PyObject *) PyBaseObject_Type.tp_new(t, __pyx_empty_tuple, 0);\n  }\n  if (unlikely(!o)) return 0;\n  p = ((struct __pyx_obj_9pywrapfst_Weight *)o);\n  p->__pyx_vtab = __pyx_vtabptr_9pywrapfst_Weight;\n  new((void*)&(p->_weight)) std::unique_ptr<fst::script::WeightClass> ();\n  return o;\n}\n\nstatic void __pyx_tp_dealloc_9pywrapfst_Weight(PyObject *o) {\n  struct __pyx_obj_9pywrapfst_Weight *p = (struct __pyx_obj_9pywrapfst_Weight *)o;\n  #if CYTHON_USE_TP_FINALIZE\n  if (unlikely(PyType_HasFeature(Py_TYPE(o), Py_TPFLAGS_HAVE_FINALIZE) && Py_TYPE(o)->tp_finalize) && (!PyType_IS_GC(Py_TYPE(o)) || !_PyGC_FINALIZED(o))) {\n    if (PyObject_CallFinalizerFromDealloc(o)) return;\n  }\n  #endif\n  __Pyx_call_destructor(p->_weight);\n  (*Py_TYPE(o)->tp_free)(o);\n}\n\nstatic PyObject *__pyx_tp_richcompare_9pywrapfst_Weight(PyObject *o1, PyObject *o2, int op) {\n  switch (op) {\n    case Py_EQ: {\n      return __pyx_pw_9pywrapfst_6Weight_17__eq__(o1, o2);\n    }\n    case Py_NE: {\n      return __pyx_pw_9pywrapfst_6Weight_19__ne__(o1, o2);\n    }\n    default: {\n      return __Pyx_NewRef(Py_NotImplemented);\n    }\n  }\n}\n\nstatic PyMethodDef __pyx_methods_9pywrapfst_Weight[] = {\n  {\"copy\", (PyCFunction)__pyx_pw_9pywrapfst_6Weight_9copy, METH_NOARGS, __pyx_doc_9pywrapfst_6Weight_8copy},\n  {\"Zero\", (PyCFunction)__pyx_pw_9pywrapfst_6Weight_11Zero, METH_O, __pyx_doc_9pywrapfst_6Weight_10Zero},\n  {\"One\", (PyCFunction)__pyx_pw_9pywrapfst_6Weight_13One, METH_O, __pyx_doc_9pywrapfst_6Weight_12One},\n  {\"NoWeight\", (PyCFunction)__pyx_pw_9pywrapfst_6Weight_15NoWeight, METH_O, __pyx_doc_9pywrapfst_6Weight_14NoWeight},\n  {\"to_string\", (PyCFunction)__pyx_pw_9pywrapfst_6Weight_21to_string, METH_NOARGS, 0},\n  {\"type\", (PyCFunction)__pyx_pw_9pywrapfst_6Weight_23type, METH_NOARGS, __pyx_doc_9pywrapfst_6Weight_22type},\n  {\"__reduce_cython__\", (PyCFunction)__pyx_pw_9pywrapfst_6Weight_25__reduce_cython__, METH_NOARGS, 0},\n  {\"__setstate_cython__\", (PyCFunction)__pyx_pw_9pywrapfst_6Weight_27__setstate_cython__, METH_O, 0},\n  {0, 0, 0, 0}\n};\n\nstatic PyNumberMethods __pyx_tp_as_number_Weight = {\n  0, /*nb_add*/\n  0, /*nb_subtract*/\n  0, /*nb_multiply*/\n  #if PY_MAJOR_VERSION < 3 || (CYTHON_COMPILING_IN_PYPY && PY_VERSION_HEX < 0x03050000)\n  0, /*nb_divide*/\n  #endif\n  0, /*nb_remainder*/\n  0, /*nb_divmod*/\n  0, /*nb_power*/\n  0, /*nb_negative*/\n  0, /*nb_positive*/\n  0, /*nb_absolute*/\n  0, /*nb_nonzero*/\n  0, /*nb_invert*/\n  0, /*nb_lshift*/\n  0, /*nb_rshift*/\n  0, /*nb_and*/\n  0, /*nb_xor*/\n  0, /*nb_or*/\n  #if PY_MAJOR_VERSION < 3 || (CYTHON_COMPILING_IN_PYPY && PY_VERSION_HEX < 0x03050000)\n  0, /*nb_coerce*/\n  #endif\n  0, /*nb_int*/\n  #if PY_MAJOR_VERSION < 3\n  0, /*nb_long*/\n  #else\n  0, /*reserved*/\n  #endif\n  __pyx_pw_9pywrapfst_6Weight_5__float__, /*nb_float*/\n  #if PY_MAJOR_VERSION < 3 || (CYTHON_COMPILING_IN_PYPY && PY_VERSION_HEX < 0x03050000)\n  0, /*nb_oct*/\n  #endif\n  #if PY_MAJOR_VERSION < 3 || (CYTHON_COMPILING_IN_PYPY && PY_VERSION_HEX < 0x03050000)\n  0, /*nb_hex*/\n  #endif\n  0, /*nb_inplace_add*/\n  0, /*nb_inplace_subtract*/\n  0, /*nb_inplace_multiply*/\n  #if PY_MAJOR_VERSION < 3 || (CYTHON_COMPILING_IN_PYPY && PY_VERSION_HEX < 0x03050000)\n  0, /*nb_inplace_divide*/\n  #endif\n  0, /*nb_inplace_remainder*/\n  0, /*nb_inplace_power*/\n  0, /*nb_inplace_lshift*/\n  0, /*nb_inplace_rshift*/\n  0, /*nb_inplace_and*/\n  0, /*nb_inplace_xor*/\n  0, /*nb_inplace_or*/\n  0, /*nb_floor_divide*/\n  0, /*nb_true_divide*/\n  0, /*nb_inplace_floor_divide*/\n  0, /*nb_inplace_true_divide*/\n  0, /*nb_index*/\n  #if PY_VERSION_HEX >= 0x03050000\n  0, /*nb_matrix_multiply*/\n  #endif\n  #if PY_VERSION_HEX >= 0x03050000\n  0, /*nb_inplace_matrix_multiply*/\n  #endif\n};\n\nstatic PyTypeObject __pyx_type_9pywrapfst_Weight = {\n  PyVarObject_HEAD_INIT(0, 0)\n  \"pywrapfst.Weight\", /*tp_name*/\n  sizeof(struct __pyx_obj_9pywrapfst_Weight), /*tp_basicsize*/\n  0, /*tp_itemsize*/\n  __pyx_tp_dealloc_9pywrapfst_Weight, /*tp_dealloc*/\n  0, /*tp_print*/\n  0, /*tp_getattr*/\n  0, /*tp_setattr*/\n  #if PY_MAJOR_VERSION < 3\n  0, /*tp_compare*/\n  #endif\n  #if PY_MAJOR_VERSION >= 3\n  0, /*tp_as_async*/\n  #endif\n  __pyx_pw_9pywrapfst_6Weight_1__repr__, /*tp_repr*/\n  &__pyx_tp_as_number_Weight, /*tp_as_number*/\n  0, /*tp_as_sequence*/\n  0, /*tp_as_mapping*/\n  0, /*tp_hash*/\n  0, /*tp_call*/\n  __pyx_pw_9pywrapfst_6Weight_3__str__, /*tp_str*/\n  0, /*tp_getattro*/\n  0, /*tp_setattro*/\n  0, /*tp_as_buffer*/\n  Py_TPFLAGS_DEFAULT|Py_TPFLAGS_HAVE_VERSION_TAG|Py_TPFLAGS_CHECKTYPES|Py_TPFLAGS_HAVE_NEWBUFFER|Py_TPFLAGS_BASETYPE, /*tp_flags*/\n  \"\\n  Weight(weight_type, weight_string)\\n\\n  FST weight class.\\n\\n  This class represents an FST weight. When passed as an argument to an FST\\n  operation, it should have the weight type of the input FST(s) to said\\n  operation.\\n\\n  Args:\\n    weight_type: A string indicating the weight type.\\n    weight_string: A string indicating the underlying weight.\\n\\n  Raises:\\n    FstArgError: Weight type not found.\\n    FstBadWeightError: Invalid weight.\\n  \", /*tp_doc*/\n  0, /*tp_traverse*/\n  0, /*tp_clear*/\n  __pyx_tp_richcompare_9pywrapfst_Weight, /*tp_richcompare*/\n  0, /*tp_weaklistoffset*/\n  0, /*tp_iter*/\n  0, /*tp_iternext*/\n  __pyx_methods_9pywrapfst_Weight, /*tp_methods*/\n  0, /*tp_members*/\n  0, /*tp_getset*/\n  0, /*tp_base*/\n  0, /*tp_dict*/\n  0, /*tp_descr_get*/\n  0, /*tp_descr_set*/\n  0, /*tp_dictoffset*/\n  __pyx_pw_9pywrapfst_6Weight_7__init__, /*tp_init*/\n  0, /*tp_alloc*/\n  __pyx_tp_new_9pywrapfst_Weight, /*tp_new*/\n  0, /*tp_free*/\n  0, /*tp_is_gc*/\n  0, /*tp_bases*/\n  0, /*tp_mro*/\n  0, /*tp_cache*/\n  0, /*tp_subclasses*/\n  0, /*tp_weaklist*/\n  0, /*tp_del*/\n  0, /*tp_version_tag*/\n  #if PY_VERSION_HEX >= 0x030400a1\n  0, /*tp_finalize*/\n  #endif\n};\nstatic struct __pyx_vtabstruct_9pywrapfst__SymbolTable __pyx_vtable_9pywrapfst__SymbolTable;\n\nstatic PyObject *__pyx_tp_new_9pywrapfst__SymbolTable(PyTypeObject *t, CYTHON_UNUSED PyObject *a, CYTHON_UNUSED PyObject *k) {\n  struct __pyx_obj_9pywrapfst__SymbolTable *p;\n  PyObject *o;\n  if (likely((t->tp_flags & Py_TPFLAGS_IS_ABSTRACT) == 0)) {\n    o = (*t->tp_alloc)(t, 0);\n  } else {\n    o = (PyObject *) PyBaseObject_Type.tp_new(t, __pyx_empty_tuple, 0);\n  }\n  if (unlikely(!o)) return 0;\n  p = ((struct __pyx_obj_9pywrapfst__SymbolTable *)o);\n  p->__pyx_vtab = __pyx_vtabptr_9pywrapfst__SymbolTable;\n  return o;\n}\n\nstatic void __pyx_tp_dealloc_9pywrapfst__SymbolTable(PyObject *o) {\n  #if CYTHON_USE_TP_FINALIZE\n  if (unlikely(PyType_HasFeature(Py_TYPE(o), Py_TPFLAGS_HAVE_FINALIZE) && Py_TYPE(o)->tp_finalize) && (!PyType_IS_GC(Py_TYPE(o)) || !_PyGC_FINALIZED(o))) {\n    if (PyObject_CallFinalizerFromDealloc(o)) return;\n  }\n  #endif\n  (*Py_TYPE(o)->tp_free)(o);\n}\n\nstatic PyMethodDef __pyx_methods_9pywrapfst__SymbolTable[] = {\n  {\"available_key\", (PyCFunction)__pyx_pw_9pywrapfst_12_SymbolTable_5available_key, METH_NOARGS, __pyx_doc_9pywrapfst_12_SymbolTable_4available_key},\n  {\"checksum\", (PyCFunction)__pyx_pw_9pywrapfst_12_SymbolTable_7checksum, METH_NOARGS, __pyx_doc_9pywrapfst_12_SymbolTable_6checksum},\n  {\"copy\", (PyCFunction)__pyx_pw_9pywrapfst_12_SymbolTable_9copy, METH_NOARGS, __pyx_doc_9pywrapfst_12_SymbolTable_8copy},\n  {\"find\", (PyCFunction)__pyx_pw_9pywrapfst_12_SymbolTable_11find, METH_O, __pyx_doc_9pywrapfst_12_SymbolTable_10find},\n  {\"get_nth_key\", (PyCFunction)__pyx_pw_9pywrapfst_12_SymbolTable_13get_nth_key, METH_O, __pyx_doc_9pywrapfst_12_SymbolTable_12get_nth_key},\n  {\"labeled_checksum\", (PyCFunction)__pyx_pw_9pywrapfst_12_SymbolTable_15labeled_checksum, METH_NOARGS, __pyx_doc_9pywrapfst_12_SymbolTable_14labeled_checksum},\n  {\"member\", (PyCFunction)__pyx_pw_9pywrapfst_12_SymbolTable_17member, METH_O, __pyx_doc_9pywrapfst_12_SymbolTable_16member},\n  {\"name\", (PyCFunction)__pyx_pw_9pywrapfst_12_SymbolTable_21name, METH_NOARGS, __pyx_doc_9pywrapfst_12_SymbolTable_20name},\n  {\"num_symbols\", (PyCFunction)__pyx_pw_9pywrapfst_12_SymbolTable_23num_symbols, METH_NOARGS, __pyx_doc_9pywrapfst_12_SymbolTable_22num_symbols},\n  {\"write\", (PyCFunction)__pyx_pw_9pywrapfst_12_SymbolTable_25write, METH_O, __pyx_doc_9pywrapfst_12_SymbolTable_24write},\n  {\"write_text\", (PyCFunction)__pyx_pw_9pywrapfst_12_SymbolTable_27write_text, METH_O, __pyx_doc_9pywrapfst_12_SymbolTable_26write_text},\n  {\"__reduce_cython__\", (PyCFunction)__pyx_pw_9pywrapfst_12_SymbolTable_29__reduce_cython__, METH_NOARGS, 0},\n  {\"__setstate_cython__\", (PyCFunction)__pyx_pw_9pywrapfst_12_SymbolTable_31__setstate_cython__, METH_O, 0},\n  {0, 0, 0, 0}\n};\n\nstatic PySequenceMethods __pyx_tp_as_sequence__SymbolTable = {\n  0, /*sq_length*/\n  0, /*sq_concat*/\n  0, /*sq_repeat*/\n  0, /*sq_item*/\n  0, /*sq_slice*/\n  0, /*sq_ass_item*/\n  0, /*sq_ass_slice*/\n  __pyx_pw_9pywrapfst_12_SymbolTable_19__contains__, /*sq_contains*/\n  0, /*sq_inplace_concat*/\n  0, /*sq_inplace_repeat*/\n};\n\nstatic PyTypeObject __pyx_type_9pywrapfst__SymbolTable = {\n  PyVarObject_HEAD_INIT(0, 0)\n  \"pywrapfst._SymbolTable\", /*tp_name*/\n  sizeof(struct __pyx_obj_9pywrapfst__SymbolTable), /*tp_basicsize*/\n  0, /*tp_itemsize*/\n  __pyx_tp_dealloc_9pywrapfst__SymbolTable, /*tp_dealloc*/\n  0, /*tp_print*/\n  0, /*tp_getattr*/\n  0, /*tp_setattr*/\n  #if PY_MAJOR_VERSION < 3\n  0, /*tp_compare*/\n  #endif\n  #if PY_MAJOR_VERSION >= 3\n  0, /*tp_as_async*/\n  #endif\n  0, /*tp_repr*/\n  0, /*tp_as_number*/\n  &__pyx_tp_as_sequence__SymbolTable, /*tp_as_sequence*/\n  0, /*tp_as_mapping*/\n  0, /*tp_hash*/\n  0, /*tp_call*/\n  0, /*tp_str*/\n  0, /*tp_getattro*/\n  0, /*tp_setattro*/\n  0, /*tp_as_buffer*/\n  Py_TPFLAGS_DEFAULT|Py_TPFLAGS_HAVE_VERSION_TAG|Py_TPFLAGS_CHECKTYPES|Py_TPFLAGS_HAVE_NEWBUFFER|Py_TPFLAGS_BASETYPE, /*tp_flags*/\n  \"\\n  (No constructor.)\\n\\n  Base class for the symbol table hierarchy.\\n\\n  This class is the base class for SymbolTable. It has a \\\"deleted\\\" constructor\\n  and implementations for the const methods of the wrapped SymbolTable.\\n  \", /*tp_doc*/\n  0, /*tp_traverse*/\n  0, /*tp_clear*/\n  0, /*tp_richcompare*/\n  0, /*tp_weaklistoffset*/\n  __pyx_pw_9pywrapfst_12_SymbolTable_3__iter__, /*tp_iter*/\n  0, /*tp_iternext*/\n  __pyx_methods_9pywrapfst__SymbolTable, /*tp_methods*/\n  0, /*tp_members*/\n  0, /*tp_getset*/\n  0, /*tp_base*/\n  0, /*tp_dict*/\n  0, /*tp_descr_get*/\n  0, /*tp_descr_set*/\n  0, /*tp_dictoffset*/\n  __pyx_pw_9pywrapfst_12_SymbolTable_1__init__, /*tp_init*/\n  0, /*tp_alloc*/\n  __pyx_tp_new_9pywrapfst__SymbolTable, /*tp_new*/\n  0, /*tp_free*/\n  0, /*tp_is_gc*/\n  0, /*tp_bases*/\n  0, /*tp_mro*/\n  0, /*tp_cache*/\n  0, /*tp_subclasses*/\n  0, /*tp_weaklist*/\n  0, /*tp_del*/\n  0, /*tp_version_tag*/\n  #if PY_VERSION_HEX >= 0x030400a1\n  0, /*tp_finalize*/\n  #endif\n};\nstatic struct __pyx_vtabstruct_9pywrapfst__EncodeMapperSymbolTable __pyx_vtable_9pywrapfst__EncodeMapperSymbolTable;\n\nstatic PyObject *__pyx_tp_new_9pywrapfst__EncodeMapperSymbolTable(PyTypeObject *t, PyObject *a, PyObject *k) {\n  struct __pyx_obj_9pywrapfst__EncodeMapperSymbolTable *p;\n  PyObject *o = __pyx_tp_new_9pywrapfst__SymbolTable(t, a, k);\n  if (unlikely(!o)) return 0;\n  p = ((struct __pyx_obj_9pywrapfst__EncodeMapperSymbolTable *)o);\n  p->__pyx_base.__pyx_vtab = (struct __pyx_vtabstruct_9pywrapfst__SymbolTable*)__pyx_vtabptr_9pywrapfst__EncodeMapperSymbolTable;\n  new((void*)&(p->_encoder)) std::shared_ptr<fst::script::EncodeMapperClass> ();\n  return o;\n}\n\nstatic void __pyx_tp_dealloc_9pywrapfst__EncodeMapperSymbolTable(PyObject *o) {\n  struct __pyx_obj_9pywrapfst__EncodeMapperSymbolTable *p = (struct __pyx_obj_9pywrapfst__EncodeMapperSymbolTable *)o;\n  #if CYTHON_USE_TP_FINALIZE\n  if (unlikely(PyType_HasFeature(Py_TYPE(o), Py_TPFLAGS_HAVE_FINALIZE) && Py_TYPE(o)->tp_finalize) && (!PyType_IS_GC(Py_TYPE(o)) || !_PyGC_FINALIZED(o))) {\n    if (PyObject_CallFinalizerFromDealloc(o)) return;\n  }\n  #endif\n  __Pyx_call_destructor(p->_encoder);\n  __pyx_tp_dealloc_9pywrapfst__SymbolTable(o);\n}\n\nstatic PyMethodDef __pyx_methods_9pywrapfst__EncodeMapperSymbolTable[] = {\n  {\"__reduce_cython__\", (PyCFunction)__pyx_pw_9pywrapfst_24_EncodeMapperSymbolTable_3__reduce_cython__, METH_NOARGS, 0},\n  {\"__setstate_cython__\", (PyCFunction)__pyx_pw_9pywrapfst_24_EncodeMapperSymbolTable_5__setstate_cython__, METH_O, 0},\n  {0, 0, 0, 0}\n};\n\nstatic PyTypeObject __pyx_type_9pywrapfst__EncodeMapperSymbolTable = {\n  PyVarObject_HEAD_INIT(0, 0)\n  \"pywrapfst._EncodeMapperSymbolTable\", /*tp_name*/\n  sizeof(struct __pyx_obj_9pywrapfst__EncodeMapperSymbolTable), /*tp_basicsize*/\n  0, /*tp_itemsize*/\n  __pyx_tp_dealloc_9pywrapfst__EncodeMapperSymbolTable, /*tp_dealloc*/\n  0, /*tp_print*/\n  0, /*tp_getattr*/\n  0, /*tp_setattr*/\n  #if PY_MAJOR_VERSION < 3\n  0, /*tp_compare*/\n  #endif\n  #if PY_MAJOR_VERSION >= 3\n  0, /*tp_as_async*/\n  #endif\n  __pyx_pw_9pywrapfst_24_EncodeMapperSymbolTable_1__repr__, /*tp_repr*/\n  0, /*tp_as_number*/\n  0, /*tp_as_sequence*/\n  0, /*tp_as_mapping*/\n  0, /*tp_hash*/\n  0, /*tp_call*/\n  0, /*tp_str*/\n  0, /*tp_getattro*/\n  0, /*tp_setattro*/\n  0, /*tp_as_buffer*/\n  Py_TPFLAGS_DEFAULT|Py_TPFLAGS_HAVE_VERSION_TAG|Py_TPFLAGS_CHECKTYPES|Py_TPFLAGS_HAVE_NEWBUFFER|Py_TPFLAGS_BASETYPE, /*tp_flags*/\n  \"\\n  (No constructor.)\\n\\n  Immutable SymbolTable class for tables stored in an EncodeMapper.\\n\\n  This class wraps a library const SymbolTable and exposes const methods of the\\n  wrapped object. It is only to be returned by method, never constructed\\n  directly.\\n  \", /*tp_doc*/\n  0, /*tp_traverse*/\n  0, /*tp_clear*/\n  0, /*tp_richcompare*/\n  0, /*tp_weaklistoffset*/\n  #if CYTHON_COMPILING_IN_PYPY\n  __pyx_pw_9pywrapfst_12_SymbolTable_3__iter__, /*tp_iter*/\n  #else\n  0, /*tp_iter*/\n  #endif\n  0, /*tp_iternext*/\n  __pyx_methods_9pywrapfst__EncodeMapperSymbolTable, /*tp_methods*/\n  0, /*tp_members*/\n  0, /*tp_getset*/\n  0, /*tp_base*/\n  0, /*tp_dict*/\n  0, /*tp_descr_get*/\n  0, /*tp_descr_set*/\n  0, /*tp_dictoffset*/\n  #if CYTHON_COMPILING_IN_PYPY\n  __pyx_pw_9pywrapfst_12_SymbolTable_1__init__, /*tp_init*/\n  #else\n  0, /*tp_init*/\n  #endif\n  0, /*tp_alloc*/\n  __pyx_tp_new_9pywrapfst__EncodeMapperSymbolTable, /*tp_new*/\n  0, /*tp_free*/\n  0, /*tp_is_gc*/\n  0, /*tp_bases*/\n  0, /*tp_mro*/\n  0, /*tp_cache*/\n  0, /*tp_subclasses*/\n  0, /*tp_weaklist*/\n  0, /*tp_del*/\n  0, /*tp_version_tag*/\n  #if PY_VERSION_HEX >= 0x030400a1\n  0, /*tp_finalize*/\n  #endif\n};\nstatic struct __pyx_vtabstruct_9pywrapfst__FstSymbolTable __pyx_vtable_9pywrapfst__FstSymbolTable;\n\nstatic PyObject *__pyx_tp_new_9pywrapfst__FstSymbolTable(PyTypeObject *t, PyObject *a, PyObject *k) {\n  struct __pyx_obj_9pywrapfst__FstSymbolTable *p;\n  PyObject *o = __pyx_tp_new_9pywrapfst__SymbolTable(t, a, k);\n  if (unlikely(!o)) return 0;\n  p = ((struct __pyx_obj_9pywrapfst__FstSymbolTable *)o);\n  p->__pyx_base.__pyx_vtab = (struct __pyx_vtabstruct_9pywrapfst__SymbolTable*)__pyx_vtabptr_9pywrapfst__FstSymbolTable;\n  new((void*)&(p->_fst)) std::shared_ptr<fst::script::FstClass> ();\n  return o;\n}\n\nstatic void __pyx_tp_dealloc_9pywrapfst__FstSymbolTable(PyObject *o) {\n  struct __pyx_obj_9pywrapfst__FstSymbolTable *p = (struct __pyx_obj_9pywrapfst__FstSymbolTable *)o;\n  #if CYTHON_USE_TP_FINALIZE\n  if (unlikely(PyType_HasFeature(Py_TYPE(o), Py_TPFLAGS_HAVE_FINALIZE) && Py_TYPE(o)->tp_finalize) && (!PyType_IS_GC(Py_TYPE(o)) || !_PyGC_FINALIZED(o))) {\n    if (PyObject_CallFinalizerFromDealloc(o)) return;\n  }\n  #endif\n  __Pyx_call_destructor(p->_fst);\n  __pyx_tp_dealloc_9pywrapfst__SymbolTable(o);\n}\n\nstatic PyMethodDef __pyx_methods_9pywrapfst__FstSymbolTable[] = {\n  {\"__reduce_cython__\", (PyCFunction)__pyx_pw_9pywrapfst_15_FstSymbolTable_3__reduce_cython__, METH_NOARGS, 0},\n  {\"__setstate_cython__\", (PyCFunction)__pyx_pw_9pywrapfst_15_FstSymbolTable_5__setstate_cython__, METH_O, 0},\n  {0, 0, 0, 0}\n};\n\nstatic PyTypeObject __pyx_type_9pywrapfst__FstSymbolTable = {\n  PyVarObject_HEAD_INIT(0, 0)\n  \"pywrapfst._FstSymbolTable\", /*tp_name*/\n  sizeof(struct __pyx_obj_9pywrapfst__FstSymbolTable), /*tp_basicsize*/\n  0, /*tp_itemsize*/\n  __pyx_tp_dealloc_9pywrapfst__FstSymbolTable, /*tp_dealloc*/\n  0, /*tp_print*/\n  0, /*tp_getattr*/\n  0, /*tp_setattr*/\n  #if PY_MAJOR_VERSION < 3\n  0, /*tp_compare*/\n  #endif\n  #if PY_MAJOR_VERSION >= 3\n  0, /*tp_as_async*/\n  #endif\n  __pyx_pw_9pywrapfst_15_FstSymbolTable_1__repr__, /*tp_repr*/\n  0, /*tp_as_number*/\n  0, /*tp_as_sequence*/\n  0, /*tp_as_mapping*/\n  0, /*tp_hash*/\n  0, /*tp_call*/\n  0, /*tp_str*/\n  0, /*tp_getattro*/\n  0, /*tp_setattro*/\n  0, /*tp_as_buffer*/\n  Py_TPFLAGS_DEFAULT|Py_TPFLAGS_HAVE_VERSION_TAG|Py_TPFLAGS_CHECKTYPES|Py_TPFLAGS_HAVE_NEWBUFFER|Py_TPFLAGS_BASETYPE, /*tp_flags*/\n  \"\\n  (No constructor.)\\n\\n  Mutable SymbolTable class for tables stored in a mutable FST.\\n\\n  This class wraps a library SymbolTable and exposes methods of the wrapped\\n  object. It is only to be returned by method, never constructed directly.\\n  \", /*tp_doc*/\n  0, /*tp_traverse*/\n  0, /*tp_clear*/\n  0, /*tp_richcompare*/\n  0, /*tp_weaklistoffset*/\n  #if CYTHON_COMPILING_IN_PYPY\n  __pyx_pw_9pywrapfst_12_SymbolTable_3__iter__, /*tp_iter*/\n  #else\n  0, /*tp_iter*/\n  #endif\n  0, /*tp_iternext*/\n  __pyx_methods_9pywrapfst__FstSymbolTable, /*tp_methods*/\n  0, /*tp_members*/\n  0, /*tp_getset*/\n  0, /*tp_base*/\n  0, /*tp_dict*/\n  0, /*tp_descr_get*/\n  0, /*tp_descr_set*/\n  0, /*tp_dictoffset*/\n  #if CYTHON_COMPILING_IN_PYPY\n  __pyx_pw_9pywrapfst_12_SymbolTable_1__init__, /*tp_init*/\n  #else\n  0, /*tp_init*/\n  #endif\n  0, /*tp_alloc*/\n  __pyx_tp_new_9pywrapfst__FstSymbolTable, /*tp_new*/\n  0, /*tp_free*/\n  0, /*tp_is_gc*/\n  0, /*tp_bases*/\n  0, /*tp_mro*/\n  0, /*tp_cache*/\n  0, /*tp_subclasses*/\n  0, /*tp_weaklist*/\n  0, /*tp_del*/\n  0, /*tp_version_tag*/\n  #if PY_VERSION_HEX >= 0x030400a1\n  0, /*tp_finalize*/\n  #endif\n};\nstatic struct __pyx_vtabstruct_9pywrapfst__MutableSymbolTable __pyx_vtable_9pywrapfst__MutableSymbolTable;\n\nstatic PyObject *__pyx_tp_new_9pywrapfst__MutableSymbolTable(PyTypeObject *t, PyObject *a, PyObject *k) {\n  struct __pyx_obj_9pywrapfst__MutableSymbolTable *p;\n  PyObject *o = __pyx_tp_new_9pywrapfst__SymbolTable(t, a, k);\n  if (unlikely(!o)) return 0;\n  p = ((struct __pyx_obj_9pywrapfst__MutableSymbolTable *)o);\n  p->__pyx_base.__pyx_vtab = (struct __pyx_vtabstruct_9pywrapfst__SymbolTable*)__pyx_vtabptr_9pywrapfst__MutableSymbolTable;\n  return o;\n}\n\nstatic PyMethodDef __pyx_methods_9pywrapfst__MutableSymbolTable[] = {\n  {\"add_symbol\", (PyCFunction)__pyx_pw_9pywrapfst_19_MutableSymbolTable_1add_symbol, METH_VARARGS|METH_KEYWORDS, __pyx_doc_9pywrapfst_19_MutableSymbolTable_add_symbol},\n  {\"add_table\", (PyCFunction)__pyx_pw_9pywrapfst_19_MutableSymbolTable_3add_table, METH_O, __pyx_doc_9pywrapfst_19_MutableSymbolTable_2add_table},\n  {\"set_name\", (PyCFunction)__pyx_pw_9pywrapfst_19_MutableSymbolTable_5set_name, METH_O, 0},\n  {\"__reduce_cython__\", (PyCFunction)__pyx_pw_9pywrapfst_19_MutableSymbolTable_7__reduce_cython__, METH_NOARGS, 0},\n  {\"__setstate_cython__\", (PyCFunction)__pyx_pw_9pywrapfst_19_MutableSymbolTable_9__setstate_cython__, METH_O, 0},\n  {0, 0, 0, 0}\n};\n\nstatic PyTypeObject __pyx_type_9pywrapfst__MutableSymbolTable = {\n  PyVarObject_HEAD_INIT(0, 0)\n  \"pywrapfst._MutableSymbolTable\", /*tp_name*/\n  sizeof(struct __pyx_obj_9pywrapfst__MutableSymbolTable), /*tp_basicsize*/\n  0, /*tp_itemsize*/\n  __pyx_tp_dealloc_9pywrapfst__SymbolTable, /*tp_dealloc*/\n  0, /*tp_print*/\n  0, /*tp_getattr*/\n  0, /*tp_setattr*/\n  #if PY_MAJOR_VERSION < 3\n  0, /*tp_compare*/\n  #endif\n  #if PY_MAJOR_VERSION >= 3\n  0, /*tp_as_async*/\n  #endif\n  0, /*tp_repr*/\n  0, /*tp_as_number*/\n  0, /*tp_as_sequence*/\n  0, /*tp_as_mapping*/\n  0, /*tp_hash*/\n  0, /*tp_call*/\n  0, /*tp_str*/\n  0, /*tp_getattro*/\n  0, /*tp_setattro*/\n  0, /*tp_as_buffer*/\n  Py_TPFLAGS_DEFAULT|Py_TPFLAGS_HAVE_VERSION_TAG|Py_TPFLAGS_CHECKTYPES|Py_TPFLAGS_HAVE_NEWBUFFER|Py_TPFLAGS_BASETYPE, /*tp_flags*/\n  \"\\n  (No constructor.)\\n\\n  Base class for mutable symbol tables.\\n\\n  This class is the base class for a mutable SymbolTable. It has a \\\"deleted\\\"\\n  constructor and implementations of all methods of the wrapped SymbolTable.\\n  \", /*tp_doc*/\n  0, /*tp_traverse*/\n  0, /*tp_clear*/\n  0, /*tp_richcompare*/\n  0, /*tp_weaklistoffset*/\n  #if CYTHON_COMPILING_IN_PYPY\n  __pyx_pw_9pywrapfst_12_SymbolTable_3__iter__, /*tp_iter*/\n  #else\n  0, /*tp_iter*/\n  #endif\n  0, /*tp_iternext*/\n  __pyx_methods_9pywrapfst__MutableSymbolTable, /*tp_methods*/\n  0, /*tp_members*/\n  0, /*tp_getset*/\n  0, /*tp_base*/\n  0, /*tp_dict*/\n  0, /*tp_descr_get*/\n  0, /*tp_descr_set*/\n  0, /*tp_dictoffset*/\n  #if CYTHON_COMPILING_IN_PYPY\n  __pyx_pw_9pywrapfst_12_SymbolTable_1__init__, /*tp_init*/\n  #else\n  0, /*tp_init*/\n  #endif\n  0, /*tp_alloc*/\n  __pyx_tp_new_9pywrapfst__MutableSymbolTable, /*tp_new*/\n  0, /*tp_free*/\n  0, /*tp_is_gc*/\n  0, /*tp_bases*/\n  0, /*tp_mro*/\n  0, /*tp_cache*/\n  0, /*tp_subclasses*/\n  0, /*tp_weaklist*/\n  0, /*tp_del*/\n  0, /*tp_version_tag*/\n  #if PY_VERSION_HEX >= 0x030400a1\n  0, /*tp_finalize*/\n  #endif\n};\nstatic struct __pyx_vtabstruct_9pywrapfst__MutableFstSymbolTable __pyx_vtable_9pywrapfst__MutableFstSymbolTable;\n\nstatic PyObject *__pyx_tp_new_9pywrapfst__MutableFstSymbolTable(PyTypeObject *t, PyObject *a, PyObject *k) {\n  struct __pyx_obj_9pywrapfst__MutableFstSymbolTable *p;\n  PyObject *o = __pyx_tp_new_9pywrapfst__MutableSymbolTable(t, a, k);\n  if (unlikely(!o)) return 0;\n  p = ((struct __pyx_obj_9pywrapfst__MutableFstSymbolTable *)o);\n  p->__pyx_base.__pyx_base.__pyx_vtab = (struct __pyx_vtabstruct_9pywrapfst__SymbolTable*)__pyx_vtabptr_9pywrapfst__MutableFstSymbolTable;\n  new((void*)&(p->_mfst)) std::shared_ptr<fst::script::MutableFstClass> ();\n  return o;\n}\n\nstatic void __pyx_tp_dealloc_9pywrapfst__MutableFstSymbolTable(PyObject *o) {\n  struct __pyx_obj_9pywrapfst__MutableFstSymbolTable *p = (struct __pyx_obj_9pywrapfst__MutableFstSymbolTable *)o;\n  #if CYTHON_USE_TP_FINALIZE\n  if (unlikely(PyType_HasFeature(Py_TYPE(o), Py_TPFLAGS_HAVE_FINALIZE) && Py_TYPE(o)->tp_finalize) && (!PyType_IS_GC(Py_TYPE(o)) || !_PyGC_FINALIZED(o))) {\n    if (PyObject_CallFinalizerFromDealloc(o)) return;\n  }\n  #endif\n  __Pyx_call_destructor(p->_mfst);\n  __pyx_tp_dealloc_9pywrapfst__SymbolTable(o);\n}\n\nstatic PyMethodDef __pyx_methods_9pywrapfst__MutableFstSymbolTable[] = {\n  {\"__reduce_cython__\", (PyCFunction)__pyx_pw_9pywrapfst_22_MutableFstSymbolTable_3__reduce_cython__, METH_NOARGS, 0},\n  {\"__setstate_cython__\", (PyCFunction)__pyx_pw_9pywrapfst_22_MutableFstSymbolTable_5__setstate_cython__, METH_O, 0},\n  {0, 0, 0, 0}\n};\n\nstatic PyTypeObject __pyx_type_9pywrapfst__MutableFstSymbolTable = {\n  PyVarObject_HEAD_INIT(0, 0)\n  \"pywrapfst._MutableFstSymbolTable\", /*tp_name*/\n  sizeof(struct __pyx_obj_9pywrapfst__MutableFstSymbolTable), /*tp_basicsize*/\n  0, /*tp_itemsize*/\n  __pyx_tp_dealloc_9pywrapfst__MutableFstSymbolTable, /*tp_dealloc*/\n  0, /*tp_print*/\n  0, /*tp_getattr*/\n  0, /*tp_setattr*/\n  #if PY_MAJOR_VERSION < 3\n  0, /*tp_compare*/\n  #endif\n  #if PY_MAJOR_VERSION >= 3\n  0, /*tp_as_async*/\n  #endif\n  __pyx_pw_9pywrapfst_22_MutableFstSymbolTable_1__repr__, /*tp_repr*/\n  0, /*tp_as_number*/\n  0, /*tp_as_sequence*/\n  0, /*tp_as_mapping*/\n  0, /*tp_hash*/\n  0, /*tp_call*/\n  0, /*tp_str*/\n  0, /*tp_getattro*/\n  0, /*tp_setattro*/\n  0, /*tp_as_buffer*/\n  Py_TPFLAGS_DEFAULT|Py_TPFLAGS_HAVE_VERSION_TAG|Py_TPFLAGS_CHECKTYPES|Py_TPFLAGS_HAVE_NEWBUFFER|Py_TPFLAGS_BASETYPE, /*tp_flags*/\n  \"\\n  (No constructor.)\\n\\n  Mutable SymbolTable assigned to an FST.\\n  \", /*tp_doc*/\n  0, /*tp_traverse*/\n  0, /*tp_clear*/\n  0, /*tp_richcompare*/\n  0, /*tp_weaklistoffset*/\n  #if CYTHON_COMPILING_IN_PYPY\n  __pyx_pw_9pywrapfst_12_SymbolTable_3__iter__, /*tp_iter*/\n  #else\n  0, /*tp_iter*/\n  #endif\n  0, /*tp_iternext*/\n  __pyx_methods_9pywrapfst__MutableFstSymbolTable, /*tp_methods*/\n  0, /*tp_members*/\n  0, /*tp_getset*/\n  0, /*tp_base*/\n  0, /*tp_dict*/\n  0, /*tp_descr_get*/\n  0, /*tp_descr_set*/\n  0, /*tp_dictoffset*/\n  #if CYTHON_COMPILING_IN_PYPY\n  __pyx_pw_9pywrapfst_12_SymbolTable_1__init__, /*tp_init*/\n  #else\n  0, /*tp_init*/\n  #endif\n  0, /*tp_alloc*/\n  __pyx_tp_new_9pywrapfst__MutableFstSymbolTable, /*tp_new*/\n  0, /*tp_free*/\n  0, /*tp_is_gc*/\n  0, /*tp_bases*/\n  0, /*tp_mro*/\n  0, /*tp_cache*/\n  0, /*tp_subclasses*/\n  0, /*tp_weaklist*/\n  0, /*tp_del*/\n  0, /*tp_version_tag*/\n  #if PY_VERSION_HEX >= 0x030400a1\n  0, /*tp_finalize*/\n  #endif\n};\nstatic struct __pyx_vtabstruct_9pywrapfst_SymbolTable __pyx_vtable_9pywrapfst_SymbolTable;\n\nstatic PyObject *__pyx_tp_new_9pywrapfst_SymbolTable(PyTypeObject *t, PyObject *a, PyObject *k) {\n  struct __pyx_obj_9pywrapfst_SymbolTable *p;\n  PyObject *o = __pyx_tp_new_9pywrapfst__MutableSymbolTable(t, a, k);\n  if (unlikely(!o)) return 0;\n  p = ((struct __pyx_obj_9pywrapfst_SymbolTable *)o);\n  p->__pyx_base.__pyx_base.__pyx_vtab = (struct __pyx_vtabstruct_9pywrapfst__SymbolTable*)__pyx_vtabptr_9pywrapfst_SymbolTable;\n  new((void*)&(p->_smart_table)) std::unique_ptr<fst::SymbolTable> ();\n  return o;\n}\n\nstatic void __pyx_tp_dealloc_9pywrapfst_SymbolTable(PyObject *o) {\n  struct __pyx_obj_9pywrapfst_SymbolTable *p = (struct __pyx_obj_9pywrapfst_SymbolTable *)o;\n  #if CYTHON_USE_TP_FINALIZE\n  if (unlikely(PyType_HasFeature(Py_TYPE(o), Py_TPFLAGS_HAVE_FINALIZE) && Py_TYPE(o)->tp_finalize) && (!PyType_IS_GC(Py_TYPE(o)) || !_PyGC_FINALIZED(o))) {\n    if (PyObject_CallFinalizerFromDealloc(o)) return;\n  }\n  #endif\n  __Pyx_call_destructor(p->_smart_table);\n  __pyx_tp_dealloc_9pywrapfst__SymbolTable(o);\n}\n\nstatic PyMethodDef __pyx_methods_9pywrapfst_SymbolTable[] = {\n  {\"read\", (PyCFunction)__pyx_pw_9pywrapfst_11SymbolTable_5read, METH_O, __pyx_doc_9pywrapfst_11SymbolTable_4read},\n  {\"read_text\", (PyCFunction)__pyx_pw_9pywrapfst_11SymbolTable_7read_text, METH_VARARGS|METH_KEYWORDS, __pyx_doc_9pywrapfst_11SymbolTable_6read_text},\n  {\"read_fst\", (PyCFunction)__pyx_pw_9pywrapfst_11SymbolTable_9read_fst, METH_VARARGS|METH_KEYWORDS, __pyx_doc_9pywrapfst_11SymbolTable_8read_fst},\n  {\"__reduce_cython__\", (PyCFunction)__pyx_pw_9pywrapfst_11SymbolTable_11__reduce_cython__, METH_NOARGS, 0},\n  {\"__setstate_cython__\", (PyCFunction)__pyx_pw_9pywrapfst_11SymbolTable_13__setstate_cython__, METH_O, 0},\n  {0, 0, 0, 0}\n};\n\nstatic PyTypeObject __pyx_type_9pywrapfst_SymbolTable = {\n  PyVarObject_HEAD_INIT(0, 0)\n  \"pywrapfst.SymbolTable\", /*tp_name*/\n  sizeof(struct __pyx_obj_9pywrapfst_SymbolTable), /*tp_basicsize*/\n  0, /*tp_itemsize*/\n  __pyx_tp_dealloc_9pywrapfst_SymbolTable, /*tp_dealloc*/\n  0, /*tp_print*/\n  0, /*tp_getattr*/\n  0, /*tp_setattr*/\n  #if PY_MAJOR_VERSION < 3\n  0, /*tp_compare*/\n  #endif\n  #if PY_MAJOR_VERSION >= 3\n  0, /*tp_as_async*/\n  #endif\n  __pyx_pw_9pywrapfst_11SymbolTable_1__repr__, /*tp_repr*/\n  0, /*tp_as_number*/\n  0, /*tp_as_sequence*/\n  0, /*tp_as_mapping*/\n  0, /*tp_hash*/\n  0, /*tp_call*/\n  0, /*tp_str*/\n  0, /*tp_getattro*/\n  0, /*tp_setattro*/\n  0, /*tp_as_buffer*/\n  Py_TPFLAGS_DEFAULT|Py_TPFLAGS_HAVE_VERSION_TAG|Py_TPFLAGS_CHECKTYPES|Py_TPFLAGS_HAVE_NEWBUFFER|Py_TPFLAGS_BASETYPE, /*tp_flags*/\n  \"\\n  SymbolTable(name=\\\"<unspecified>\\\")\\n\\n  Mutable SymbolTable class.\\n\\n  This class wraps the library SymbolTable and exposes both const (i.e.,\\n  access) and non-const (i.e., mutation) methods of wrapped object.\\n\\n  Unlike other classes in the hierarchy, it has a working constructor and can be\\n  used to programmatically construct a SymbolTable in memory.\\n\\n  Args:\\n    name: An optional string indicating the table's name.\\n  \", /*tp_doc*/\n  0, /*tp_traverse*/\n  0, /*tp_clear*/\n  0, /*tp_richcompare*/\n  0, /*tp_weaklistoffset*/\n  #if CYTHON_COMPILING_IN_PYPY\n  __pyx_pw_9pywrapfst_12_SymbolTable_3__iter__, /*tp_iter*/\n  #else\n  0, /*tp_iter*/\n  #endif\n  0, /*tp_iternext*/\n  __pyx_methods_9pywrapfst_SymbolTable, /*tp_methods*/\n  0, /*tp_members*/\n  0, /*tp_getset*/\n  0, /*tp_base*/\n  0, /*tp_dict*/\n  0, /*tp_descr_get*/\n  0, /*tp_descr_set*/\n  0, /*tp_dictoffset*/\n  __pyx_pw_9pywrapfst_11SymbolTable_3__init__, /*tp_init*/\n  0, /*tp_alloc*/\n  __pyx_tp_new_9pywrapfst_SymbolTable, /*tp_new*/\n  0, /*tp_free*/\n  0, /*tp_is_gc*/\n  0, /*tp_bases*/\n  0, /*tp_mro*/\n  0, /*tp_cache*/\n  0, /*tp_subclasses*/\n  0, /*tp_weaklist*/\n  0, /*tp_del*/\n  0, /*tp_version_tag*/\n  #if PY_VERSION_HEX >= 0x030400a1\n  0, /*tp_finalize*/\n  #endif\n};\nstatic struct __pyx_vtabstruct_9pywrapfst_SymbolTableIterator __pyx_vtable_9pywrapfst_SymbolTableIterator;\n\nstatic PyObject *__pyx_tp_new_9pywrapfst_SymbolTableIterator(PyTypeObject *t, CYTHON_UNUSED PyObject *a, CYTHON_UNUSED PyObject *k) {\n  struct __pyx_obj_9pywrapfst_SymbolTableIterator *p;\n  PyObject *o;\n  if (likely((t->tp_flags & Py_TPFLAGS_IS_ABSTRACT) == 0)) {\n    o = (*t->tp_alloc)(t, 0);\n  } else {\n    o = (PyObject *) PyBaseObject_Type.tp_new(t, __pyx_empty_tuple, 0);\n  }\n  if (unlikely(!o)) return 0;\n  p = ((struct __pyx_obj_9pywrapfst_SymbolTableIterator *)o);\n  p->__pyx_vtab = __pyx_vtabptr_9pywrapfst_SymbolTableIterator;\n  new((void*)&(p->_table)) std::shared_ptr<fst::SymbolTable> ();\n  new((void*)&(p->_siter)) std::unique_ptr<fst::SymbolTableIterator> ();\n  return o;\n}\n\nstatic void __pyx_tp_dealloc_9pywrapfst_SymbolTableIterator(PyObject *o) {\n  struct __pyx_obj_9pywrapfst_SymbolTableIterator *p = (struct __pyx_obj_9pywrapfst_SymbolTableIterator *)o;\n  #if CYTHON_USE_TP_FINALIZE\n  if (unlikely(PyType_HasFeature(Py_TYPE(o), Py_TPFLAGS_HAVE_FINALIZE) && Py_TYPE(o)->tp_finalize) && (!PyType_IS_GC(Py_TYPE(o)) || !_PyGC_FINALIZED(o))) {\n    if (PyObject_CallFinalizerFromDealloc(o)) return;\n  }\n  #endif\n  __Pyx_call_destructor(p->_table);\n  __Pyx_call_destructor(p->_siter);\n  (*Py_TYPE(o)->tp_free)(o);\n}\n\nstatic PyMethodDef __pyx_methods_9pywrapfst_SymbolTableIterator[] = {\n  {\"__next__\", (PyCFunction)__pyx_pw_9pywrapfst_19SymbolTableIterator_7__next__, METH_NOARGS|METH_COEXIST, 0},\n  {\"done\", (PyCFunction)__pyx_pw_9pywrapfst_19SymbolTableIterator_9done, METH_NOARGS, __pyx_doc_9pywrapfst_19SymbolTableIterator_8done},\n  {\"next\", (PyCFunction)__pyx_pw_9pywrapfst_19SymbolTableIterator_11next, METH_NOARGS, __pyx_doc_9pywrapfst_19SymbolTableIterator_10next},\n  {\"reset\", (PyCFunction)__pyx_pw_9pywrapfst_19SymbolTableIterator_13reset, METH_NOARGS, __pyx_doc_9pywrapfst_19SymbolTableIterator_12reset},\n  {\"symbol\", (PyCFunction)__pyx_pw_9pywrapfst_19SymbolTableIterator_15symbol, METH_NOARGS, __pyx_doc_9pywrapfst_19SymbolTableIterator_14symbol},\n  {\"value\", (PyCFunction)__pyx_pw_9pywrapfst_19SymbolTableIterator_17value, METH_NOARGS, __pyx_doc_9pywrapfst_19SymbolTableIterator_16value},\n  {\"__reduce_cython__\", (PyCFunction)__pyx_pw_9pywrapfst_19SymbolTableIterator_19__reduce_cython__, METH_NOARGS, 0},\n  {\"__setstate_cython__\", (PyCFunction)__pyx_pw_9pywrapfst_19SymbolTableIterator_21__setstate_cython__, METH_O, 0},\n  {0, 0, 0, 0}\n};\n\nstatic PyTypeObject __pyx_type_9pywrapfst_SymbolTableIterator = {\n  PyVarObject_HEAD_INIT(0, 0)\n  \"pywrapfst.SymbolTableIterator\", /*tp_name*/\n  sizeof(struct __pyx_obj_9pywrapfst_SymbolTableIterator), /*tp_basicsize*/\n  0, /*tp_itemsize*/\n  __pyx_tp_dealloc_9pywrapfst_SymbolTableIterator, /*tp_dealloc*/\n  0, /*tp_print*/\n  0, /*tp_getattr*/\n  0, /*tp_setattr*/\n  #if PY_MAJOR_VERSION < 3\n  0, /*tp_compare*/\n  #endif\n  #if PY_MAJOR_VERSION >= 3\n  0, /*tp_as_async*/\n  #endif\n  __pyx_pw_9pywrapfst_19SymbolTableIterator_1__repr__, /*tp_repr*/\n  0, /*tp_as_number*/\n  0, /*tp_as_sequence*/\n  0, /*tp_as_mapping*/\n  0, /*tp_hash*/\n  0, /*tp_call*/\n  0, /*tp_str*/\n  0, /*tp_getattro*/\n  0, /*tp_setattro*/\n  0, /*tp_as_buffer*/\n  Py_TPFLAGS_DEFAULT|Py_TPFLAGS_HAVE_VERSION_TAG|Py_TPFLAGS_CHECKTYPES|Py_TPFLAGS_HAVE_NEWBUFFER|Py_TPFLAGS_BASETYPE, /*tp_flags*/\n  \"\\n  SymbolTableIterator(syms)\\n\\n  This class is used for iterating over a symbol table.\\n  \", /*tp_doc*/\n  0, /*tp_traverse*/\n  0, /*tp_clear*/\n  0, /*tp_richcompare*/\n  0, /*tp_weaklistoffset*/\n  __pyx_pw_9pywrapfst_19SymbolTableIterator_5__iter__, /*tp_iter*/\n  __pyx_pw_9pywrapfst_19SymbolTableIterator_7__next__, /*tp_iternext*/\n  __pyx_methods_9pywrapfst_SymbolTableIterator, /*tp_methods*/\n  0, /*tp_members*/\n  0, /*tp_getset*/\n  0, /*tp_base*/\n  0, /*tp_dict*/\n  0, /*tp_descr_get*/\n  0, /*tp_descr_set*/\n  0, /*tp_dictoffset*/\n  __pyx_pw_9pywrapfst_19SymbolTableIterator_3__init__, /*tp_init*/\n  0, /*tp_alloc*/\n  __pyx_tp_new_9pywrapfst_SymbolTableIterator, /*tp_new*/\n  0, /*tp_free*/\n  0, /*tp_is_gc*/\n  0, /*tp_bases*/\n  0, /*tp_mro*/\n  0, /*tp_cache*/\n  0, /*tp_subclasses*/\n  0, /*tp_weaklist*/\n  0, /*tp_del*/\n  0, /*tp_version_tag*/\n  #if PY_VERSION_HEX >= 0x030400a1\n  0, /*tp_finalize*/\n  #endif\n};\nstatic struct __pyx_vtabstruct_9pywrapfst_EncodeMapper __pyx_vtable_9pywrapfst_EncodeMapper;\n\nstatic PyObject *__pyx_tp_new_9pywrapfst_EncodeMapper(PyTypeObject *t, CYTHON_UNUSED PyObject *a, CYTHON_UNUSED PyObject *k) {\n  struct __pyx_obj_9pywrapfst_EncodeMapper *p;\n  PyObject *o;\n  if (likely((t->tp_flags & Py_TPFLAGS_IS_ABSTRACT) == 0)) {\n    o = (*t->tp_alloc)(t, 0);\n  } else {\n    o = (PyObject *) PyBaseObject_Type.tp_new(t, __pyx_empty_tuple, 0);\n  }\n  if (unlikely(!o)) return 0;\n  p = ((struct __pyx_obj_9pywrapfst_EncodeMapper *)o);\n  p->__pyx_vtab = __pyx_vtabptr_9pywrapfst_EncodeMapper;\n  new((void*)&(p->_encoder)) std::shared_ptr<fst::script::EncodeMapperClass> ();\n  return o;\n}\n\nstatic void __pyx_tp_dealloc_9pywrapfst_EncodeMapper(PyObject *o) {\n  struct __pyx_obj_9pywrapfst_EncodeMapper *p = (struct __pyx_obj_9pywrapfst_EncodeMapper *)o;\n  #if CYTHON_USE_TP_FINALIZE\n  if (unlikely(PyType_HasFeature(Py_TYPE(o), Py_TPFLAGS_HAVE_FINALIZE) && Py_TYPE(o)->tp_finalize) && (!PyType_IS_GC(Py_TYPE(o)) || !_PyGC_FINALIZED(o))) {\n    if (PyObject_CallFinalizerFromDealloc(o)) return;\n  }\n  #endif\n  __Pyx_call_destructor(p->_encoder);\n  (*Py_TYPE(o)->tp_free)(o);\n}\n\nstatic PyMethodDef __pyx_methods_9pywrapfst_EncodeMapper[] = {\n  {\"arc_type\", (PyCFunction)__pyx_pw_9pywrapfst_12EncodeMapper_5arc_type, METH_NOARGS, __pyx_doc_9pywrapfst_12EncodeMapper_4arc_type},\n  {\"flags\", (PyCFunction)__pyx_pw_9pywrapfst_12EncodeMapper_9flags, METH_NOARGS, __pyx_doc_9pywrapfst_12EncodeMapper_8flags},\n  {\"input_symbols\", (PyCFunction)__pyx_pw_9pywrapfst_12EncodeMapper_11input_symbols, METH_NOARGS, __pyx_doc_9pywrapfst_12EncodeMapper_10input_symbols},\n  {\"output_symbols\", (PyCFunction)__pyx_pw_9pywrapfst_12EncodeMapper_13output_symbols, METH_NOARGS, __pyx_doc_9pywrapfst_12EncodeMapper_12output_symbols},\n  {\"properties\", (PyCFunction)__pyx_pw_9pywrapfst_12EncodeMapper_15properties, METH_O, __pyx_doc_9pywrapfst_12EncodeMapper_14properties},\n  {\"set_input_symbols\", (PyCFunction)__pyx_pw_9pywrapfst_12EncodeMapper_17set_input_symbols, METH_O, __pyx_doc_9pywrapfst_12EncodeMapper_16set_input_symbols},\n  {\"set_output_symbols\", (PyCFunction)__pyx_pw_9pywrapfst_12EncodeMapper_19set_output_symbols, METH_O, __pyx_doc_9pywrapfst_12EncodeMapper_18set_output_symbols},\n  {\"weight_type\", (PyCFunction)__pyx_pw_9pywrapfst_12EncodeMapper_21weight_type, METH_NOARGS, __pyx_doc_9pywrapfst_12EncodeMapper_20weight_type},\n  {\"__reduce_cython__\", (PyCFunction)__pyx_pw_9pywrapfst_12EncodeMapper_23__reduce_cython__, METH_NOARGS, 0},\n  {\"__setstate_cython__\", (PyCFunction)__pyx_pw_9pywrapfst_12EncodeMapper_25__setstate_cython__, METH_O, 0},\n  {0, 0, 0, 0}\n};\n\nstatic PyTypeObject __pyx_type_9pywrapfst_EncodeMapper = {\n  PyVarObject_HEAD_INIT(0, 0)\n  \"pywrapfst.EncodeMapper\", /*tp_name*/\n  sizeof(struct __pyx_obj_9pywrapfst_EncodeMapper), /*tp_basicsize*/\n  0, /*tp_itemsize*/\n  __pyx_tp_dealloc_9pywrapfst_EncodeMapper, /*tp_dealloc*/\n  0, /*tp_print*/\n  0, /*tp_getattr*/\n  0, /*tp_setattr*/\n  #if PY_MAJOR_VERSION < 3\n  0, /*tp_compare*/\n  #endif\n  #if PY_MAJOR_VERSION >= 3\n  0, /*tp_as_async*/\n  #endif\n  __pyx_pw_9pywrapfst_12EncodeMapper_1__repr__, /*tp_repr*/\n  0, /*tp_as_number*/\n  0, /*tp_as_sequence*/\n  0, /*tp_as_mapping*/\n  0, /*tp_hash*/\n  __pyx_pw_9pywrapfst_12EncodeMapper_7__call__, /*tp_call*/\n  0, /*tp_str*/\n  0, /*tp_getattro*/\n  0, /*tp_setattro*/\n  0, /*tp_as_buffer*/\n  Py_TPFLAGS_DEFAULT|Py_TPFLAGS_HAVE_VERSION_TAG|Py_TPFLAGS_CHECKTYPES|Py_TPFLAGS_HAVE_NEWBUFFER|Py_TPFLAGS_BASETYPE, /*tp_flags*/\n  \"\\n  EncodeMapper(arc_type=\\\"standard\\\", encode_labels=False, encode_weights=False)\\n\\n  Arc encoder class, wrapping EncodeMapperClass.\\n\\n  This class provides an object which can be used to encode or decode FST arcs.\\n  This is most useful to convert an FST to an unweighted acceptor, on which\\n  some FST operations are more efficient, and then decoding the FST afterwards.\\n\\n  To use an instance of this class to encode or decode a mutable FST, pass it\\n  as the first argument to the FST instance methods `encode` and `decode`.\\n\\n  For implementational reasons, it is not currently possible to use an encoder\\n  on disk to construct this class.\\n\\n  Args:\\n    arc_type: A string indicating the arc type.\\n    encode_labels: Should labels be encoded?\\n    encode_weights: Should weights be encoded?\\n  \", /*tp_doc*/\n  0, /*tp_traverse*/\n  0, /*tp_clear*/\n  0, /*tp_richcompare*/\n  0, /*tp_weaklistoffset*/\n  0, /*tp_iter*/\n  0, /*tp_iternext*/\n  __pyx_methods_9pywrapfst_EncodeMapper, /*tp_methods*/\n  0, /*tp_members*/\n  0, /*tp_getset*/\n  0, /*tp_base*/\n  0, /*tp_dict*/\n  0, /*tp_descr_get*/\n  0, /*tp_descr_set*/\n  0, /*tp_dictoffset*/\n  __pyx_pw_9pywrapfst_12EncodeMapper_3__init__, /*tp_init*/\n  0, /*tp_alloc*/\n  __pyx_tp_new_9pywrapfst_EncodeMapper, /*tp_new*/\n  0, /*tp_free*/\n  0, /*tp_is_gc*/\n  0, /*tp_bases*/\n  0, /*tp_mro*/\n  0, /*tp_cache*/\n  0, /*tp_subclasses*/\n  0, /*tp_weaklist*/\n  0, /*tp_del*/\n  0, /*tp_version_tag*/\n  #if PY_VERSION_HEX >= 0x030400a1\n  0, /*tp_finalize*/\n  #endif\n};\nstatic struct __pyx_vtabstruct_9pywrapfst__Fst __pyx_vtable_9pywrapfst__Fst;\n\nstatic PyObject *__pyx_tp_new_9pywrapfst__Fst(PyTypeObject *t, CYTHON_UNUSED PyObject *a, CYTHON_UNUSED PyObject *k) {\n  struct __pyx_obj_9pywrapfst__Fst *p;\n  PyObject *o;\n  if (likely((t->tp_flags & Py_TPFLAGS_IS_ABSTRACT) == 0)) {\n    o = (*t->tp_alloc)(t, 0);\n  } else {\n    o = (PyObject *) PyBaseObject_Type.tp_new(t, __pyx_empty_tuple, 0);\n  }\n  if (unlikely(!o)) return 0;\n  p = ((struct __pyx_obj_9pywrapfst__Fst *)o);\n  p->__pyx_vtab = __pyx_vtabptr_9pywrapfst__Fst;\n  new((void*)&(p->_fst)) std::shared_ptr<fst::script::FstClass> ();\n  return o;\n}\n\nstatic void __pyx_tp_dealloc_9pywrapfst__Fst(PyObject *o) {\n  struct __pyx_obj_9pywrapfst__Fst *p = (struct __pyx_obj_9pywrapfst__Fst *)o;\n  #if CYTHON_USE_TP_FINALIZE\n  if (unlikely(PyType_HasFeature(Py_TYPE(o), Py_TPFLAGS_HAVE_FINALIZE) && Py_TYPE(o)->tp_finalize) && (!PyType_IS_GC(Py_TYPE(o)) || !_PyGC_FINALIZED(o))) {\n    if (PyObject_CallFinalizerFromDealloc(o)) return;\n  }\n  #endif\n  __Pyx_call_destructor(p->_fst);\n  (*Py_TYPE(o)->tp_free)(o);\n}\n\nstatic PyMethodDef __pyx_methods_9pywrapfst__Fst[] = {\n  {\"_repr_svg_\", (PyCFunction)__pyx_pw_9pywrapfst_4_Fst_1_repr_svg_, METH_NOARGS, __pyx_doc_9pywrapfst_4_Fst__repr_svg_},\n  {\"__reduce__\", (PyCFunction)__pyx_pw_9pywrapfst_4_Fst_9__reduce__, METH_NOARGS, 0},\n  {\"arc_type\", (PyCFunction)__pyx_pw_9pywrapfst_4_Fst_11arc_type, METH_NOARGS, __pyx_doc_9pywrapfst_4_Fst_10arc_type},\n  {\"arcs\", (PyCFunction)__pyx_pw_9pywrapfst_4_Fst_13arcs, METH_O, __pyx_doc_9pywrapfst_4_Fst_12arcs},\n  {\"copy\", (PyCFunction)__pyx_pw_9pywrapfst_4_Fst_15copy, METH_NOARGS, __pyx_doc_9pywrapfst_4_Fst_14copy},\n  {\"draw\", (PyCFunction)__pyx_pw_9pywrapfst_4_Fst_17draw, METH_VARARGS|METH_KEYWORDS, __pyx_doc_9pywrapfst_4_Fst_16draw},\n  {\"final\", (PyCFunction)__pyx_pw_9pywrapfst_4_Fst_19final, METH_O, __pyx_doc_9pywrapfst_4_Fst_18final},\n  {\"fst_type\", (PyCFunction)__pyx_pw_9pywrapfst_4_Fst_21fst_type, METH_NOARGS, __pyx_doc_9pywrapfst_4_Fst_20fst_type},\n  {\"input_symbols\", (PyCFunction)__pyx_pw_9pywrapfst_4_Fst_23input_symbols, METH_NOARGS, __pyx_doc_9pywrapfst_4_Fst_22input_symbols},\n  {\"num_arcs\", (PyCFunction)__pyx_pw_9pywrapfst_4_Fst_25num_arcs, METH_O, __pyx_doc_9pywrapfst_4_Fst_24num_arcs},\n  {\"num_input_epsilons\", (PyCFunction)__pyx_pw_9pywrapfst_4_Fst_27num_input_epsilons, METH_O, __pyx_doc_9pywrapfst_4_Fst_26num_input_epsilons},\n  {\"num_output_epsilons\", (PyCFunction)__pyx_pw_9pywrapfst_4_Fst_29num_output_epsilons, METH_O, __pyx_doc_9pywrapfst_4_Fst_28num_output_epsilons},\n  {\"output_symbols\", (PyCFunction)__pyx_pw_9pywrapfst_4_Fst_31output_symbols, METH_NOARGS, __pyx_doc_9pywrapfst_4_Fst_30output_symbols},\n  {\"properties\", (PyCFunction)__pyx_pw_9pywrapfst_4_Fst_33properties, METH_VARARGS|METH_KEYWORDS, __pyx_doc_9pywrapfst_4_Fst_32properties},\n  {\"start\", (PyCFunction)__pyx_pw_9pywrapfst_4_Fst_35start, METH_NOARGS, __pyx_doc_9pywrapfst_4_Fst_34start},\n  {\"states\", (PyCFunction)__pyx_pw_9pywrapfst_4_Fst_37states, METH_NOARGS, __pyx_doc_9pywrapfst_4_Fst_36states},\n  {\"text\", (PyCFunction)__pyx_pw_9pywrapfst_4_Fst_39text, METH_VARARGS|METH_KEYWORDS, __pyx_doc_9pywrapfst_4_Fst_38text},\n  {\"verify\", (PyCFunction)__pyx_pw_9pywrapfst_4_Fst_41verify, METH_NOARGS, __pyx_doc_9pywrapfst_4_Fst_40verify},\n  {\"weight_type\", (PyCFunction)__pyx_pw_9pywrapfst_4_Fst_43weight_type, METH_NOARGS, __pyx_doc_9pywrapfst_4_Fst_42weight_type},\n  {\"write\", (PyCFunction)__pyx_pw_9pywrapfst_4_Fst_45write, METH_O, __pyx_doc_9pywrapfst_4_Fst_44write},\n  {\"write_to_string\", (PyCFunction)__pyx_pw_9pywrapfst_4_Fst_47write_to_string, METH_NOARGS, __pyx_doc_9pywrapfst_4_Fst_46write_to_string},\n  {0, 0, 0, 0}\n};\n\nstatic PyTypeObject __pyx_type_9pywrapfst__Fst = {\n  PyVarObject_HEAD_INIT(0, 0)\n  \"pywrapfst._Fst\", /*tp_name*/\n  sizeof(struct __pyx_obj_9pywrapfst__Fst), /*tp_basicsize*/\n  0, /*tp_itemsize*/\n  __pyx_tp_dealloc_9pywrapfst__Fst, /*tp_dealloc*/\n  0, /*tp_print*/\n  0, /*tp_getattr*/\n  0, /*tp_setattr*/\n  #if PY_MAJOR_VERSION < 3\n  0, /*tp_compare*/\n  #endif\n  #if PY_MAJOR_VERSION >= 3\n  0, /*tp_as_async*/\n  #endif\n  __pyx_pw_9pywrapfst_4_Fst_3__repr__, /*tp_repr*/\n  0, /*tp_as_number*/\n  0, /*tp_as_sequence*/\n  0, /*tp_as_mapping*/\n  0, /*tp_hash*/\n  0, /*tp_call*/\n  __pyx_pw_9pywrapfst_4_Fst_7__str__, /*tp_str*/\n  0, /*tp_getattro*/\n  0, /*tp_setattro*/\n  0, /*tp_as_buffer*/\n  Py_TPFLAGS_DEFAULT|Py_TPFLAGS_HAVE_VERSION_TAG|Py_TPFLAGS_CHECKTYPES|Py_TPFLAGS_HAVE_NEWBUFFER|Py_TPFLAGS_BASETYPE, /*tp_flags*/\n  \"\\n  (No constructor.)\\n\\n  Immutable FST class, wrapping FstClass.\\n\\n  This class is the basic user-facing FST object. It does not itself support any\\n  mutation operations.\\n  \", /*tp_doc*/\n  0, /*tp_traverse*/\n  0, /*tp_clear*/\n  0, /*tp_richcompare*/\n  0, /*tp_weaklistoffset*/\n  0, /*tp_iter*/\n  0, /*tp_iternext*/\n  __pyx_methods_9pywrapfst__Fst, /*tp_methods*/\n  0, /*tp_members*/\n  0, /*tp_getset*/\n  0, /*tp_base*/\n  0, /*tp_dict*/\n  0, /*tp_descr_get*/\n  0, /*tp_descr_set*/\n  0, /*tp_dictoffset*/\n  __pyx_pw_9pywrapfst_4_Fst_5__init__, /*tp_init*/\n  0, /*tp_alloc*/\n  __pyx_tp_new_9pywrapfst__Fst, /*tp_new*/\n  0, /*tp_free*/\n  0, /*tp_is_gc*/\n  0, /*tp_bases*/\n  0, /*tp_mro*/\n  0, /*tp_cache*/\n  0, /*tp_subclasses*/\n  0, /*tp_weaklist*/\n  0, /*tp_del*/\n  0, /*tp_version_tag*/\n  #if PY_VERSION_HEX >= 0x030400a1\n  0, /*tp_finalize*/\n  #endif\n};\nstatic struct __pyx_vtabstruct_9pywrapfst__MutableFst __pyx_vtable_9pywrapfst__MutableFst;\n\nstatic PyObject *__pyx_tp_new_9pywrapfst__MutableFst(PyTypeObject *t, PyObject *a, PyObject *k) {\n  struct __pyx_obj_9pywrapfst__MutableFst *p;\n  PyObject *o = __pyx_tp_new_9pywrapfst__Fst(t, a, k);\n  if (unlikely(!o)) return 0;\n  p = ((struct __pyx_obj_9pywrapfst__MutableFst *)o);\n  p->__pyx_base.__pyx_vtab = (struct __pyx_vtabstruct_9pywrapfst__Fst*)__pyx_vtabptr_9pywrapfst__MutableFst;\n  new((void*)&(p->_mfst)) std::shared_ptr<fst::script::MutableFstClass> ();\n  return o;\n}\n\nstatic void __pyx_tp_dealloc_9pywrapfst__MutableFst(PyObject *o) {\n  struct __pyx_obj_9pywrapfst__MutableFst *p = (struct __pyx_obj_9pywrapfst__MutableFst *)o;\n  #if CYTHON_USE_TP_FINALIZE\n  if (unlikely(PyType_HasFeature(Py_TYPE(o), Py_TPFLAGS_HAVE_FINALIZE) && Py_TYPE(o)->tp_finalize) && (!PyType_IS_GC(Py_TYPE(o)) || !_PyGC_FINALIZED(o))) {\n    if (PyObject_CallFinalizerFromDealloc(o)) return;\n  }\n  #endif\n  __Pyx_call_destructor(p->_mfst);\n  __pyx_tp_dealloc_9pywrapfst__Fst(o);\n}\n\nstatic PyMethodDef __pyx_methods_9pywrapfst__MutableFst[] = {\n  {\"add_arc\", (PyCFunction)__pyx_pw_9pywrapfst_11_MutableFst_1add_arc, METH_VARARGS|METH_KEYWORDS, __pyx_doc_9pywrapfst_11_MutableFst_add_arc},\n  {\"add_state\", (PyCFunction)__pyx_pw_9pywrapfst_11_MutableFst_3add_state, METH_NOARGS, __pyx_doc_9pywrapfst_11_MutableFst_2add_state},\n  {\"arcsort\", (PyCFunction)__pyx_pw_9pywrapfst_11_MutableFst_5arcsort, METH_VARARGS|METH_KEYWORDS, __pyx_doc_9pywrapfst_11_MutableFst_4arcsort},\n  {\"closure\", (PyCFunction)__pyx_pw_9pywrapfst_11_MutableFst_7closure, METH_VARARGS|METH_KEYWORDS, __pyx_doc_9pywrapfst_11_MutableFst_6closure},\n  {\"concat\", (PyCFunction)__pyx_pw_9pywrapfst_11_MutableFst_9concat, METH_O, __pyx_doc_9pywrapfst_11_MutableFst_8concat},\n  {\"connect\", (PyCFunction)__pyx_pw_9pywrapfst_11_MutableFst_11connect, METH_NOARGS, __pyx_doc_9pywrapfst_11_MutableFst_10connect},\n  {\"decode\", (PyCFunction)__pyx_pw_9pywrapfst_11_MutableFst_13decode, METH_O, __pyx_doc_9pywrapfst_11_MutableFst_12decode},\n  {\"delete_arcs\", (PyCFunction)__pyx_pw_9pywrapfst_11_MutableFst_15delete_arcs, METH_VARARGS|METH_KEYWORDS, __pyx_doc_9pywrapfst_11_MutableFst_14delete_arcs},\n  {\"delete_states\", (PyCFunction)__pyx_pw_9pywrapfst_11_MutableFst_17delete_states, METH_VARARGS|METH_KEYWORDS, __pyx_doc_9pywrapfst_11_MutableFst_16delete_states},\n  {\"encode\", (PyCFunction)__pyx_pw_9pywrapfst_11_MutableFst_19encode, METH_O, __pyx_doc_9pywrapfst_11_MutableFst_18encode},\n  {\"invert\", (PyCFunction)__pyx_pw_9pywrapfst_11_MutableFst_21invert, METH_NOARGS, __pyx_doc_9pywrapfst_11_MutableFst_20invert},\n  {\"minimize\", (PyCFunction)__pyx_pw_9pywrapfst_11_MutableFst_23minimize, METH_VARARGS|METH_KEYWORDS, __pyx_doc_9pywrapfst_11_MutableFst_22minimize},\n  {\"mutable_arcs\", (PyCFunction)__pyx_pw_9pywrapfst_11_MutableFst_25mutable_arcs, METH_O, __pyx_doc_9pywrapfst_11_MutableFst_24mutable_arcs},\n  {\"mutable_input_symbols\", (PyCFunction)__pyx_pw_9pywrapfst_11_MutableFst_27mutable_input_symbols, METH_NOARGS, __pyx_doc_9pywrapfst_11_MutableFst_26mutable_input_symbols},\n  {\"mutable_output_symbols\", (PyCFunction)__pyx_pw_9pywrapfst_11_MutableFst_29mutable_output_symbols, METH_NOARGS, __pyx_doc_9pywrapfst_11_MutableFst_28mutable_output_symbols},\n  {\"num_states\", (PyCFunction)__pyx_pw_9pywrapfst_11_MutableFst_31num_states, METH_NOARGS, __pyx_doc_9pywrapfst_11_MutableFst_30num_states},\n  {\"project\", (PyCFunction)__pyx_pw_9pywrapfst_11_MutableFst_33project, METH_VARARGS|METH_KEYWORDS, __pyx_doc_9pywrapfst_11_MutableFst_32project},\n  {\"prune\", (PyCFunction)__pyx_pw_9pywrapfst_11_MutableFst_35prune, METH_VARARGS|METH_KEYWORDS, __pyx_doc_9pywrapfst_11_MutableFst_34prune},\n  {\"push\", (PyCFunction)__pyx_pw_9pywrapfst_11_MutableFst_37push, METH_VARARGS|METH_KEYWORDS, __pyx_doc_9pywrapfst_11_MutableFst_36push},\n  {\"relabel_pairs\", (PyCFunction)__pyx_pw_9pywrapfst_11_MutableFst_39relabel_pairs, METH_VARARGS|METH_KEYWORDS, __pyx_doc_9pywrapfst_11_MutableFst_38relabel_pairs},\n  {\"relabel_tables\", (PyCFunction)__pyx_pw_9pywrapfst_11_MutableFst_41relabel_tables, METH_VARARGS|METH_KEYWORDS, __pyx_doc_9pywrapfst_11_MutableFst_40relabel_tables},\n  {\"reserve_arcs\", (PyCFunction)__pyx_pw_9pywrapfst_11_MutableFst_43reserve_arcs, METH_VARARGS|METH_KEYWORDS, __pyx_doc_9pywrapfst_11_MutableFst_42reserve_arcs},\n  {\"reserve_states\", (PyCFunction)__pyx_pw_9pywrapfst_11_MutableFst_45reserve_states, METH_O, __pyx_doc_9pywrapfst_11_MutableFst_44reserve_states},\n  {\"reweight\", (PyCFunction)__pyx_pw_9pywrapfst_11_MutableFst_47reweight, METH_VARARGS|METH_KEYWORDS, __pyx_doc_9pywrapfst_11_MutableFst_46reweight},\n  {\"rmepsilon\", (PyCFunction)__pyx_pw_9pywrapfst_11_MutableFst_49rmepsilon, METH_VARARGS|METH_KEYWORDS, __pyx_doc_9pywrapfst_11_MutableFst_48rmepsilon},\n  {\"set_final\", (PyCFunction)__pyx_pw_9pywrapfst_11_MutableFst_51set_final, METH_VARARGS|METH_KEYWORDS, __pyx_doc_9pywrapfst_11_MutableFst_50set_final},\n  {\"set_input_symbols\", (PyCFunction)__pyx_pw_9pywrapfst_11_MutableFst_53set_input_symbols, METH_O, __pyx_doc_9pywrapfst_11_MutableFst_52set_input_symbols},\n  {\"set_output_symbols\", (PyCFunction)__pyx_pw_9pywrapfst_11_MutableFst_55set_output_symbols, METH_O, __pyx_doc_9pywrapfst_11_MutableFst_54set_output_symbols},\n  {\"set_properties\", (PyCFunction)__pyx_pw_9pywrapfst_11_MutableFst_57set_properties, METH_VARARGS|METH_KEYWORDS, __pyx_doc_9pywrapfst_11_MutableFst_56set_properties},\n  {\"set_start\", (PyCFunction)__pyx_pw_9pywrapfst_11_MutableFst_59set_start, METH_O, __pyx_doc_9pywrapfst_11_MutableFst_58set_start},\n  {\"topsort\", (PyCFunction)__pyx_pw_9pywrapfst_11_MutableFst_61topsort, METH_NOARGS, __pyx_doc_9pywrapfst_11_MutableFst_60topsort},\n  {\"union\", (PyCFunction)__pyx_pw_9pywrapfst_11_MutableFst_63union, METH_O, __pyx_doc_9pywrapfst_11_MutableFst_62union},\n  {0, 0, 0, 0}\n};\n\nstatic PyTypeObject __pyx_type_9pywrapfst__MutableFst = {\n  PyVarObject_HEAD_INIT(0, 0)\n  \"pywrapfst._MutableFst\", /*tp_name*/\n  sizeof(struct __pyx_obj_9pywrapfst__MutableFst), /*tp_basicsize*/\n  0, /*tp_itemsize*/\n  __pyx_tp_dealloc_9pywrapfst__MutableFst, /*tp_dealloc*/\n  0, /*tp_print*/\n  0, /*tp_getattr*/\n  0, /*tp_setattr*/\n  #if PY_MAJOR_VERSION < 3\n  0, /*tp_compare*/\n  #endif\n  #if PY_MAJOR_VERSION >= 3\n  0, /*tp_as_async*/\n  #endif\n  #if CYTHON_COMPILING_IN_PYPY\n  __pyx_pw_9pywrapfst_4_Fst_3__repr__, /*tp_repr*/\n  #else\n  0, /*tp_repr*/\n  #endif\n  0, /*tp_as_number*/\n  0, /*tp_as_sequence*/\n  0, /*tp_as_mapping*/\n  0, /*tp_hash*/\n  0, /*tp_call*/\n  #if CYTHON_COMPILING_IN_PYPY\n  __pyx_pw_9pywrapfst_4_Fst_7__str__, /*tp_str*/\n  #else\n  0, /*tp_str*/\n  #endif\n  0, /*tp_getattro*/\n  0, /*tp_setattro*/\n  0, /*tp_as_buffer*/\n  Py_TPFLAGS_DEFAULT|Py_TPFLAGS_HAVE_VERSION_TAG|Py_TPFLAGS_CHECKTYPES|Py_TPFLAGS_HAVE_NEWBUFFER|Py_TPFLAGS_BASETYPE, /*tp_flags*/\n  \"\\n  (No constructor.)\\n\\n  Mutable FST class, wrapping MutableFstClass.\\n\\n  This class extends _Fst by adding mutation operations.\\n  \", /*tp_doc*/\n  0, /*tp_traverse*/\n  0, /*tp_clear*/\n  0, /*tp_richcompare*/\n  0, /*tp_weaklistoffset*/\n  0, /*tp_iter*/\n  0, /*tp_iternext*/\n  __pyx_methods_9pywrapfst__MutableFst, /*tp_methods*/\n  0, /*tp_members*/\n  0, /*tp_getset*/\n  0, /*tp_base*/\n  0, /*tp_dict*/\n  0, /*tp_descr_get*/\n  0, /*tp_descr_set*/\n  0, /*tp_dictoffset*/\n  #if CYTHON_COMPILING_IN_PYPY\n  __pyx_pw_9pywrapfst_4_Fst_5__init__, /*tp_init*/\n  #else\n  0, /*tp_init*/\n  #endif\n  0, /*tp_alloc*/\n  __pyx_tp_new_9pywrapfst__MutableFst, /*tp_new*/\n  0, /*tp_free*/\n  0, /*tp_is_gc*/\n  0, /*tp_bases*/\n  0, /*tp_mro*/\n  0, /*tp_cache*/\n  0, /*tp_subclasses*/\n  0, /*tp_weaklist*/\n  0, /*tp_del*/\n  0, /*tp_version_tag*/\n  #if PY_VERSION_HEX >= 0x030400a1\n  0, /*tp_finalize*/\n  #endif\n};\nstatic struct __pyx_vtabstruct_9pywrapfst_Arc __pyx_vtable_9pywrapfst_Arc;\n\nstatic PyObject *__pyx_tp_new_9pywrapfst_Arc(PyTypeObject *t, CYTHON_UNUSED PyObject *a, CYTHON_UNUSED PyObject *k) {\n  struct __pyx_obj_9pywrapfst_Arc *p;\n  PyObject *o;\n  if (likely((t->tp_flags & Py_TPFLAGS_IS_ABSTRACT) == 0)) {\n    o = (*t->tp_alloc)(t, 0);\n  } else {\n    o = (PyObject *) PyBaseObject_Type.tp_new(t, __pyx_empty_tuple, 0);\n  }\n  if (unlikely(!o)) return 0;\n  p = ((struct __pyx_obj_9pywrapfst_Arc *)o);\n  p->__pyx_vtab = __pyx_vtabptr_9pywrapfst_Arc;\n  new((void*)&(p->_arc)) std::unique_ptr<fst::script::ArcClass> ();\n  return o;\n}\n\nstatic void __pyx_tp_dealloc_9pywrapfst_Arc(PyObject *o) {\n  struct __pyx_obj_9pywrapfst_Arc *p = (struct __pyx_obj_9pywrapfst_Arc *)o;\n  #if CYTHON_USE_TP_FINALIZE\n  if (unlikely(PyType_HasFeature(Py_TYPE(o), Py_TPFLAGS_HAVE_FINALIZE) && Py_TYPE(o)->tp_finalize) && (!PyType_IS_GC(Py_TYPE(o)) || !_PyGC_FINALIZED(o))) {\n    if (PyObject_CallFinalizerFromDealloc(o)) return;\n  }\n  #endif\n  __Pyx_call_destructor(p->_arc);\n  (*Py_TYPE(o)->tp_free)(o);\n}\n\nstatic PyObject *__pyx_getprop_9pywrapfst_3Arc_ilabel(PyObject *o, CYTHON_UNUSED void *x) {\n  return __pyx_pw_9pywrapfst_3Arc_6ilabel_1__get__(o);\n}\n\nstatic int __pyx_setprop_9pywrapfst_3Arc_ilabel(PyObject *o, PyObject *v, CYTHON_UNUSED void *x) {\n  if (v) {\n    return __pyx_pw_9pywrapfst_3Arc_6ilabel_3__set__(o, v);\n  }\n  else {\n    PyErr_SetString(PyExc_NotImplementedError, \"__del__\");\n    return -1;\n  }\n}\n\nstatic PyObject *__pyx_getprop_9pywrapfst_3Arc_olabel(PyObject *o, CYTHON_UNUSED void *x) {\n  return __pyx_pw_9pywrapfst_3Arc_6olabel_1__get__(o);\n}\n\nstatic int __pyx_setprop_9pywrapfst_3Arc_olabel(PyObject *o, PyObject *v, CYTHON_UNUSED void *x) {\n  if (v) {\n    return __pyx_pw_9pywrapfst_3Arc_6olabel_3__set__(o, v);\n  }\n  else {\n    PyErr_SetString(PyExc_NotImplementedError, \"__del__\");\n    return -1;\n  }\n}\n\nstatic PyObject *__pyx_getprop_9pywrapfst_3Arc_weight(PyObject *o, CYTHON_UNUSED void *x) {\n  return __pyx_pw_9pywrapfst_3Arc_6weight_1__get__(o);\n}\n\nstatic int __pyx_setprop_9pywrapfst_3Arc_weight(PyObject *o, PyObject *v, CYTHON_UNUSED void *x) {\n  if (v) {\n    return __pyx_pw_9pywrapfst_3Arc_6weight_3__set__(o, v);\n  }\n  else {\n    PyErr_SetString(PyExc_NotImplementedError, \"__del__\");\n    return -1;\n  }\n}\n\nstatic PyObject *__pyx_getprop_9pywrapfst_3Arc_nextstate(PyObject *o, CYTHON_UNUSED void *x) {\n  return __pyx_pw_9pywrapfst_3Arc_9nextstate_1__get__(o);\n}\n\nstatic int __pyx_setprop_9pywrapfst_3Arc_nextstate(PyObject *o, PyObject *v, CYTHON_UNUSED void *x) {\n  if (v) {\n    return __pyx_pw_9pywrapfst_3Arc_9nextstate_3__set__(o, v);\n  }\n  else {\n    PyErr_SetString(PyExc_NotImplementedError, \"__del__\");\n    return -1;\n  }\n}\n\nstatic PyMethodDef __pyx_methods_9pywrapfst_Arc[] = {\n  {\"copy\", (PyCFunction)__pyx_pw_9pywrapfst_3Arc_5copy, METH_NOARGS, 0},\n  {\"__reduce_cython__\", (PyCFunction)__pyx_pw_9pywrapfst_3Arc_7__reduce_cython__, METH_NOARGS, 0},\n  {\"__setstate_cython__\", (PyCFunction)__pyx_pw_9pywrapfst_3Arc_9__setstate_cython__, METH_O, 0},\n  {0, 0, 0, 0}\n};\n\nstatic struct PyGetSetDef __pyx_getsets_9pywrapfst_Arc[] = {\n  {(char *)\"ilabel\", __pyx_getprop_9pywrapfst_3Arc_ilabel, __pyx_setprop_9pywrapfst_3Arc_ilabel, (char *)0, 0},\n  {(char *)\"olabel\", __pyx_getprop_9pywrapfst_3Arc_olabel, __pyx_setprop_9pywrapfst_3Arc_olabel, (char *)0, 0},\n  {(char *)\"weight\", __pyx_getprop_9pywrapfst_3Arc_weight, __pyx_setprop_9pywrapfst_3Arc_weight, (char *)0, 0},\n  {(char *)\"nextstate\", __pyx_getprop_9pywrapfst_3Arc_nextstate, __pyx_setprop_9pywrapfst_3Arc_nextstate, (char *)0, 0},\n  {0, 0, 0, 0, 0}\n};\n\nstatic PyTypeObject __pyx_type_9pywrapfst_Arc = {\n  PyVarObject_HEAD_INIT(0, 0)\n  \"pywrapfst.Arc\", /*tp_name*/\n  sizeof(struct __pyx_obj_9pywrapfst_Arc), /*tp_basicsize*/\n  0, /*tp_itemsize*/\n  __pyx_tp_dealloc_9pywrapfst_Arc, /*tp_dealloc*/\n  0, /*tp_print*/\n  0, /*tp_getattr*/\n  0, /*tp_setattr*/\n  #if PY_MAJOR_VERSION < 3\n  0, /*tp_compare*/\n  #endif\n  #if PY_MAJOR_VERSION >= 3\n  0, /*tp_as_async*/\n  #endif\n  __pyx_pw_9pywrapfst_3Arc_1__repr__, /*tp_repr*/\n  0, /*tp_as_number*/\n  0, /*tp_as_sequence*/\n  0, /*tp_as_mapping*/\n  0, /*tp_hash*/\n  0, /*tp_call*/\n  0, /*tp_str*/\n  0, /*tp_getattro*/\n  0, /*tp_setattro*/\n  0, /*tp_as_buffer*/\n  Py_TPFLAGS_DEFAULT|Py_TPFLAGS_HAVE_VERSION_TAG|Py_TPFLAGS_CHECKTYPES|Py_TPFLAGS_HAVE_NEWBUFFER|Py_TPFLAGS_BASETYPE, /*tp_flags*/\n  \"\\n  Arc(ilabel, olabel, weight, nextstate)\\n\\n  This class represents an arc while remaining agnostic about the underlying arc\\n  type.  Attributes of the arc can be accessed or mutated, and the arc can be\\n  copied.\\n\\n  Attributes:\\n    ilabel: The input label.\\n    olabel: The output label.\\n    weight: The arc weight.\\n    nextstate: The destination state for the arc.\\n  \", /*tp_doc*/\n  0, /*tp_traverse*/\n  0, /*tp_clear*/\n  0, /*tp_richcompare*/\n  0, /*tp_weaklistoffset*/\n  0, /*tp_iter*/\n  0, /*tp_iternext*/\n  __pyx_methods_9pywrapfst_Arc, /*tp_methods*/\n  0, /*tp_members*/\n  __pyx_getsets_9pywrapfst_Arc, /*tp_getset*/\n  0, /*tp_base*/\n  0, /*tp_dict*/\n  0, /*tp_descr_get*/\n  0, /*tp_descr_set*/\n  0, /*tp_dictoffset*/\n  __pyx_pw_9pywrapfst_3Arc_3__init__, /*tp_init*/\n  0, /*tp_alloc*/\n  __pyx_tp_new_9pywrapfst_Arc, /*tp_new*/\n  0, /*tp_free*/\n  0, /*tp_is_gc*/\n  0, /*tp_bases*/\n  0, /*tp_mro*/\n  0, /*tp_cache*/\n  0, /*tp_subclasses*/\n  0, /*tp_weaklist*/\n  0, /*tp_del*/\n  0, /*tp_version_tag*/\n  #if PY_VERSION_HEX >= 0x030400a1\n  0, /*tp_finalize*/\n  #endif\n};\nstatic struct __pyx_vtabstruct_9pywrapfst_ArcIterator __pyx_vtable_9pywrapfst_ArcIterator;\n\nstatic PyObject *__pyx_tp_new_9pywrapfst_ArcIterator(PyTypeObject *t, CYTHON_UNUSED PyObject *a, CYTHON_UNUSED PyObject *k) {\n  struct __pyx_obj_9pywrapfst_ArcIterator *p;\n  PyObject *o;\n  if (likely((t->tp_flags & Py_TPFLAGS_IS_ABSTRACT) == 0)) {\n    o = (*t->tp_alloc)(t, 0);\n  } else {\n    o = (PyObject *) PyBaseObject_Type.tp_new(t, __pyx_empty_tuple, 0);\n  }\n  if (unlikely(!o)) return 0;\n  p = ((struct __pyx_obj_9pywrapfst_ArcIterator *)o);\n  p->__pyx_vtab = __pyx_vtabptr_9pywrapfst_ArcIterator;\n  new((void*)&(p->_fst)) std::shared_ptr<fst::script::FstClass> ();\n  new((void*)&(p->_aiter)) std::unique_ptr<fst::script::ArcIteratorClass> ();\n  return o;\n}\n\nstatic void __pyx_tp_dealloc_9pywrapfst_ArcIterator(PyObject *o) {\n  struct __pyx_obj_9pywrapfst_ArcIterator *p = (struct __pyx_obj_9pywrapfst_ArcIterator *)o;\n  #if CYTHON_USE_TP_FINALIZE\n  if (unlikely(PyType_HasFeature(Py_TYPE(o), Py_TPFLAGS_HAVE_FINALIZE) && Py_TYPE(o)->tp_finalize) && (!PyType_IS_GC(Py_TYPE(o)) || !_PyGC_FINALIZED(o))) {\n    if (PyObject_CallFinalizerFromDealloc(o)) return;\n  }\n  #endif\n  __Pyx_call_destructor(p->_fst);\n  __Pyx_call_destructor(p->_aiter);\n  (*Py_TYPE(o)->tp_free)(o);\n}\n\nstatic PyMethodDef __pyx_methods_9pywrapfst_ArcIterator[] = {\n  {\"__next__\", (PyCFunction)__pyx_pw_9pywrapfst_11ArcIterator_7__next__, METH_NOARGS|METH_COEXIST, 0},\n  {\"done\", (PyCFunction)__pyx_pw_9pywrapfst_11ArcIterator_9done, METH_NOARGS, __pyx_doc_9pywrapfst_11ArcIterator_8done},\n  {\"flags\", (PyCFunction)__pyx_pw_9pywrapfst_11ArcIterator_11flags, METH_NOARGS, __pyx_doc_9pywrapfst_11ArcIterator_10flags},\n  {\"next\", (PyCFunction)__pyx_pw_9pywrapfst_11ArcIterator_13next, METH_NOARGS, __pyx_doc_9pywrapfst_11ArcIterator_12next},\n  {\"position\", (PyCFunction)__pyx_pw_9pywrapfst_11ArcIterator_15position, METH_NOARGS, __pyx_doc_9pywrapfst_11ArcIterator_14position},\n  {\"reset\", (PyCFunction)__pyx_pw_9pywrapfst_11ArcIterator_17reset, METH_NOARGS, __pyx_doc_9pywrapfst_11ArcIterator_16reset},\n  {\"seek\", (PyCFunction)__pyx_pw_9pywrapfst_11ArcIterator_19seek, METH_O, __pyx_doc_9pywrapfst_11ArcIterator_18seek},\n  {\"set_flags\", (PyCFunction)__pyx_pw_9pywrapfst_11ArcIterator_21set_flags, METH_VARARGS|METH_KEYWORDS, __pyx_doc_9pywrapfst_11ArcIterator_20set_flags},\n  {\"value\", (PyCFunction)__pyx_pw_9pywrapfst_11ArcIterator_23value, METH_NOARGS, __pyx_doc_9pywrapfst_11ArcIterator_22value},\n  {\"__reduce_cython__\", (PyCFunction)__pyx_pw_9pywrapfst_11ArcIterator_25__reduce_cython__, METH_NOARGS, 0},\n  {\"__setstate_cython__\", (PyCFunction)__pyx_pw_9pywrapfst_11ArcIterator_27__setstate_cython__, METH_O, 0},\n  {0, 0, 0, 0}\n};\n\nstatic PyTypeObject __pyx_type_9pywrapfst_ArcIterator = {\n  PyVarObject_HEAD_INIT(0, 0)\n  \"pywrapfst.ArcIterator\", /*tp_name*/\n  sizeof(struct __pyx_obj_9pywrapfst_ArcIterator), /*tp_basicsize*/\n  0, /*tp_itemsize*/\n  __pyx_tp_dealloc_9pywrapfst_ArcIterator, /*tp_dealloc*/\n  0, /*tp_print*/\n  0, /*tp_getattr*/\n  0, /*tp_setattr*/\n  #if PY_MAJOR_VERSION < 3\n  0, /*tp_compare*/\n  #endif\n  #if PY_MAJOR_VERSION >= 3\n  0, /*tp_as_async*/\n  #endif\n  __pyx_pw_9pywrapfst_11ArcIterator_1__repr__, /*tp_repr*/\n  0, /*tp_as_number*/\n  0, /*tp_as_sequence*/\n  0, /*tp_as_mapping*/\n  0, /*tp_hash*/\n  0, /*tp_call*/\n  0, /*tp_str*/\n  0, /*tp_getattro*/\n  0, /*tp_setattro*/\n  0, /*tp_as_buffer*/\n  Py_TPFLAGS_DEFAULT|Py_TPFLAGS_HAVE_VERSION_TAG|Py_TPFLAGS_CHECKTYPES|Py_TPFLAGS_HAVE_NEWBUFFER|Py_TPFLAGS_BASETYPE, /*tp_flags*/\n  \"\\n  ArcIterator(ifst, state)\\n\\n  This class is used for iterating over the arcs leaving some state of an FST.\\n  \", /*tp_doc*/\n  0, /*tp_traverse*/\n  0, /*tp_clear*/\n  0, /*tp_richcompare*/\n  0, /*tp_weaklistoffset*/\n  __pyx_pw_9pywrapfst_11ArcIterator_5__iter__, /*tp_iter*/\n  __pyx_pw_9pywrapfst_11ArcIterator_7__next__, /*tp_iternext*/\n  __pyx_methods_9pywrapfst_ArcIterator, /*tp_methods*/\n  0, /*tp_members*/\n  0, /*tp_getset*/\n  0, /*tp_base*/\n  0, /*tp_dict*/\n  0, /*tp_descr_get*/\n  0, /*tp_descr_set*/\n  0, /*tp_dictoffset*/\n  __pyx_pw_9pywrapfst_11ArcIterator_3__init__, /*tp_init*/\n  0, /*tp_alloc*/\n  __pyx_tp_new_9pywrapfst_ArcIterator, /*tp_new*/\n  0, /*tp_free*/\n  0, /*tp_is_gc*/\n  0, /*tp_bases*/\n  0, /*tp_mro*/\n  0, /*tp_cache*/\n  0, /*tp_subclasses*/\n  0, /*tp_weaklist*/\n  0, /*tp_del*/\n  0, /*tp_version_tag*/\n  #if PY_VERSION_HEX >= 0x030400a1\n  0, /*tp_finalize*/\n  #endif\n};\nstatic struct __pyx_vtabstruct_9pywrapfst_MutableArcIterator __pyx_vtable_9pywrapfst_MutableArcIterator;\n\nstatic PyObject *__pyx_tp_new_9pywrapfst_MutableArcIterator(PyTypeObject *t, CYTHON_UNUSED PyObject *a, CYTHON_UNUSED PyObject *k) {\n  struct __pyx_obj_9pywrapfst_MutableArcIterator *p;\n  PyObject *o;\n  if (likely((t->tp_flags & Py_TPFLAGS_IS_ABSTRACT) == 0)) {\n    o = (*t->tp_alloc)(t, 0);\n  } else {\n    o = (PyObject *) PyBaseObject_Type.tp_new(t, __pyx_empty_tuple, 0);\n  }\n  if (unlikely(!o)) return 0;\n  p = ((struct __pyx_obj_9pywrapfst_MutableArcIterator *)o);\n  p->__pyx_vtab = __pyx_vtabptr_9pywrapfst_MutableArcIterator;\n  new((void*)&(p->_mfst)) std::shared_ptr<fst::script::MutableFstClass> ();\n  new((void*)&(p->_aiter)) std::unique_ptr<fst::script::MutableArcIteratorClass> ();\n  return o;\n}\n\nstatic void __pyx_tp_dealloc_9pywrapfst_MutableArcIterator(PyObject *o) {\n  struct __pyx_obj_9pywrapfst_MutableArcIterator *p = (struct __pyx_obj_9pywrapfst_MutableArcIterator *)o;\n  #if CYTHON_USE_TP_FINALIZE\n  if (unlikely(PyType_HasFeature(Py_TYPE(o), Py_TPFLAGS_HAVE_FINALIZE) && Py_TYPE(o)->tp_finalize) && (!PyType_IS_GC(Py_TYPE(o)) || !_PyGC_FINALIZED(o))) {\n    if (PyObject_CallFinalizerFromDealloc(o)) return;\n  }\n  #endif\n  __Pyx_call_destructor(p->_mfst);\n  __Pyx_call_destructor(p->_aiter);\n  (*Py_TYPE(o)->tp_free)(o);\n}\n\nstatic PyMethodDef __pyx_methods_9pywrapfst_MutableArcIterator[] = {\n  {\"done\", (PyCFunction)__pyx_pw_9pywrapfst_18MutableArcIterator_5done, METH_NOARGS, __pyx_doc_9pywrapfst_18MutableArcIterator_4done},\n  {\"flags\", (PyCFunction)__pyx_pw_9pywrapfst_18MutableArcIterator_7flags, METH_NOARGS, __pyx_doc_9pywrapfst_18MutableArcIterator_6flags},\n  {\"next\", (PyCFunction)__pyx_pw_9pywrapfst_18MutableArcIterator_9next, METH_NOARGS, __pyx_doc_9pywrapfst_18MutableArcIterator_8next},\n  {\"position\", (PyCFunction)__pyx_pw_9pywrapfst_18MutableArcIterator_11position, METH_NOARGS, __pyx_doc_9pywrapfst_18MutableArcIterator_10position},\n  {\"reset\", (PyCFunction)__pyx_pw_9pywrapfst_18MutableArcIterator_13reset, METH_NOARGS, __pyx_doc_9pywrapfst_18MutableArcIterator_12reset},\n  {\"seek\", (PyCFunction)__pyx_pw_9pywrapfst_18MutableArcIterator_15seek, METH_O, __pyx_doc_9pywrapfst_18MutableArcIterator_14seek},\n  {\"set_flags\", (PyCFunction)__pyx_pw_9pywrapfst_18MutableArcIterator_17set_flags, METH_VARARGS|METH_KEYWORDS, __pyx_doc_9pywrapfst_18MutableArcIterator_16set_flags},\n  {\"set_value\", (PyCFunction)__pyx_pw_9pywrapfst_18MutableArcIterator_19set_value, METH_O, __pyx_doc_9pywrapfst_18MutableArcIterator_18set_value},\n  {\"value\", (PyCFunction)__pyx_pw_9pywrapfst_18MutableArcIterator_21value, METH_NOARGS, __pyx_doc_9pywrapfst_18MutableArcIterator_20value},\n  {\"__reduce_cython__\", (PyCFunction)__pyx_pw_9pywrapfst_18MutableArcIterator_23__reduce_cython__, METH_NOARGS, 0},\n  {\"__setstate_cython__\", (PyCFunction)__pyx_pw_9pywrapfst_18MutableArcIterator_25__setstate_cython__, METH_O, 0},\n  {0, 0, 0, 0}\n};\n\nstatic PyTypeObject __pyx_type_9pywrapfst_MutableArcIterator = {\n  PyVarObject_HEAD_INIT(0, 0)\n  \"pywrapfst.MutableArcIterator\", /*tp_name*/\n  sizeof(struct __pyx_obj_9pywrapfst_MutableArcIterator), /*tp_basicsize*/\n  0, /*tp_itemsize*/\n  __pyx_tp_dealloc_9pywrapfst_MutableArcIterator, /*tp_dealloc*/\n  0, /*tp_print*/\n  0, /*tp_getattr*/\n  0, /*tp_setattr*/\n  #if PY_MAJOR_VERSION < 3\n  0, /*tp_compare*/\n  #endif\n  #if PY_MAJOR_VERSION >= 3\n  0, /*tp_as_async*/\n  #endif\n  __pyx_pw_9pywrapfst_18MutableArcIterator_1__repr__, /*tp_repr*/\n  0, /*tp_as_number*/\n  0, /*tp_as_sequence*/\n  0, /*tp_as_mapping*/\n  0, /*tp_hash*/\n  0, /*tp_call*/\n  0, /*tp_str*/\n  0, /*tp_getattro*/\n  0, /*tp_setattro*/\n  0, /*tp_as_buffer*/\n  Py_TPFLAGS_DEFAULT|Py_TPFLAGS_HAVE_VERSION_TAG|Py_TPFLAGS_CHECKTYPES|Py_TPFLAGS_HAVE_NEWBUFFER|Py_TPFLAGS_BASETYPE, /*tp_flags*/\n  \"\\n  MutableArcIterator(ifst, state)\\n\\n  This class is used for iterating over the arcs leaving some state of an FST,\\n  also permitting mutation of the current arc.\\n  \", /*tp_doc*/\n  0, /*tp_traverse*/\n  0, /*tp_clear*/\n  0, /*tp_richcompare*/\n  0, /*tp_weaklistoffset*/\n  0, /*tp_iter*/\n  0, /*tp_iternext*/\n  __pyx_methods_9pywrapfst_MutableArcIterator, /*tp_methods*/\n  0, /*tp_members*/\n  0, /*tp_getset*/\n  0, /*tp_base*/\n  0, /*tp_dict*/\n  0, /*tp_descr_get*/\n  0, /*tp_descr_set*/\n  0, /*tp_dictoffset*/\n  __pyx_pw_9pywrapfst_18MutableArcIterator_3__init__, /*tp_init*/\n  0, /*tp_alloc*/\n  __pyx_tp_new_9pywrapfst_MutableArcIterator, /*tp_new*/\n  0, /*tp_free*/\n  0, /*tp_is_gc*/\n  0, /*tp_bases*/\n  0, /*tp_mro*/\n  0, /*tp_cache*/\n  0, /*tp_subclasses*/\n  0, /*tp_weaklist*/\n  0, /*tp_del*/\n  0, /*tp_version_tag*/\n  #if PY_VERSION_HEX >= 0x030400a1\n  0, /*tp_finalize*/\n  #endif\n};\nstatic struct __pyx_vtabstruct_9pywrapfst_StateIterator __pyx_vtable_9pywrapfst_StateIterator;\n\nstatic PyObject *__pyx_tp_new_9pywrapfst_StateIterator(PyTypeObject *t, CYTHON_UNUSED PyObject *a, CYTHON_UNUSED PyObject *k) {\n  struct __pyx_obj_9pywrapfst_StateIterator *p;\n  PyObject *o;\n  if (likely((t->tp_flags & Py_TPFLAGS_IS_ABSTRACT) == 0)) {\n    o = (*t->tp_alloc)(t, 0);\n  } else {\n    o = (PyObject *) PyBaseObject_Type.tp_new(t, __pyx_empty_tuple, 0);\n  }\n  if (unlikely(!o)) return 0;\n  p = ((struct __pyx_obj_9pywrapfst_StateIterator *)o);\n  p->__pyx_vtab = __pyx_vtabptr_9pywrapfst_StateIterator;\n  new((void*)&(p->_fst)) std::shared_ptr<fst::script::FstClass> ();\n  new((void*)&(p->_siter)) std::unique_ptr<fst::script::StateIteratorClass> ();\n  return o;\n}\n\nstatic void __pyx_tp_dealloc_9pywrapfst_StateIterator(PyObject *o) {\n  struct __pyx_obj_9pywrapfst_StateIterator *p = (struct __pyx_obj_9pywrapfst_StateIterator *)o;\n  #if CYTHON_USE_TP_FINALIZE\n  if (unlikely(PyType_HasFeature(Py_TYPE(o), Py_TPFLAGS_HAVE_FINALIZE) && Py_TYPE(o)->tp_finalize) && (!PyType_IS_GC(Py_TYPE(o)) || !_PyGC_FINALIZED(o))) {\n    if (PyObject_CallFinalizerFromDealloc(o)) return;\n  }\n  #endif\n  __Pyx_call_destructor(p->_fst);\n  __Pyx_call_destructor(p->_siter);\n  (*Py_TYPE(o)->tp_free)(o);\n}\n\nstatic PyMethodDef __pyx_methods_9pywrapfst_StateIterator[] = {\n  {\"__next__\", (PyCFunction)__pyx_pw_9pywrapfst_13StateIterator_7__next__, METH_NOARGS|METH_COEXIST, 0},\n  {\"done\", (PyCFunction)__pyx_pw_9pywrapfst_13StateIterator_9done, METH_NOARGS, __pyx_doc_9pywrapfst_13StateIterator_8done},\n  {\"next\", (PyCFunction)__pyx_pw_9pywrapfst_13StateIterator_11next, METH_NOARGS, __pyx_doc_9pywrapfst_13StateIterator_10next},\n  {\"reset\", (PyCFunction)__pyx_pw_9pywrapfst_13StateIterator_13reset, METH_NOARGS, __pyx_doc_9pywrapfst_13StateIterator_12reset},\n  {\"value\", (PyCFunction)__pyx_pw_9pywrapfst_13StateIterator_15value, METH_NOARGS, __pyx_doc_9pywrapfst_13StateIterator_14value},\n  {\"__reduce_cython__\", (PyCFunction)__pyx_pw_9pywrapfst_13StateIterator_17__reduce_cython__, METH_NOARGS, 0},\n  {\"__setstate_cython__\", (PyCFunction)__pyx_pw_9pywrapfst_13StateIterator_19__setstate_cython__, METH_O, 0},\n  {0, 0, 0, 0}\n};\n\nstatic PyTypeObject __pyx_type_9pywrapfst_StateIterator = {\n  PyVarObject_HEAD_INIT(0, 0)\n  \"pywrapfst.StateIterator\", /*tp_name*/\n  sizeof(struct __pyx_obj_9pywrapfst_StateIterator), /*tp_basicsize*/\n  0, /*tp_itemsize*/\n  __pyx_tp_dealloc_9pywrapfst_StateIterator, /*tp_dealloc*/\n  0, /*tp_print*/\n  0, /*tp_getattr*/\n  0, /*tp_setattr*/\n  #if PY_MAJOR_VERSION < 3\n  0, /*tp_compare*/\n  #endif\n  #if PY_MAJOR_VERSION >= 3\n  0, /*tp_as_async*/\n  #endif\n  __pyx_pw_9pywrapfst_13StateIterator_1__repr__, /*tp_repr*/\n  0, /*tp_as_number*/\n  0, /*tp_as_sequence*/\n  0, /*tp_as_mapping*/\n  0, /*tp_hash*/\n  0, /*tp_call*/\n  0, /*tp_str*/\n  0, /*tp_getattro*/\n  0, /*tp_setattro*/\n  0, /*tp_as_buffer*/\n  Py_TPFLAGS_DEFAULT|Py_TPFLAGS_HAVE_VERSION_TAG|Py_TPFLAGS_CHECKTYPES|Py_TPFLAGS_HAVE_NEWBUFFER|Py_TPFLAGS_BASETYPE, /*tp_flags*/\n  \"\\n  StateIterator(ifst)\\n\\n  This class is used for iterating over the states in an FST.\\n  \", /*tp_doc*/\n  0, /*tp_traverse*/\n  0, /*tp_clear*/\n  0, /*tp_richcompare*/\n  0, /*tp_weaklistoffset*/\n  __pyx_pw_9pywrapfst_13StateIterator_5__iter__, /*tp_iter*/\n  __pyx_pw_9pywrapfst_13StateIterator_7__next__, /*tp_iternext*/\n  __pyx_methods_9pywrapfst_StateIterator, /*tp_methods*/\n  0, /*tp_members*/\n  0, /*tp_getset*/\n  0, /*tp_base*/\n  0, /*tp_dict*/\n  0, /*tp_descr_get*/\n  0, /*tp_descr_set*/\n  0, /*tp_dictoffset*/\n  __pyx_pw_9pywrapfst_13StateIterator_3__init__, /*tp_init*/\n  0, /*tp_alloc*/\n  __pyx_tp_new_9pywrapfst_StateIterator, /*tp_new*/\n  0, /*tp_free*/\n  0, /*tp_is_gc*/\n  0, /*tp_bases*/\n  0, /*tp_mro*/\n  0, /*tp_cache*/\n  0, /*tp_subclasses*/\n  0, /*tp_weaklist*/\n  0, /*tp_del*/\n  0, /*tp_version_tag*/\n  #if PY_VERSION_HEX >= 0x030400a1\n  0, /*tp_finalize*/\n  #endif\n};\nstatic struct __pyx_vtabstruct_9pywrapfst_Compiler __pyx_vtable_9pywrapfst_Compiler;\n\nstatic PyObject *__pyx_tp_new_9pywrapfst_Compiler(PyTypeObject *t, PyObject *a, PyObject *k) {\n  struct __pyx_obj_9pywrapfst_Compiler *p;\n  PyObject *o;\n  if (likely((t->tp_flags & Py_TPFLAGS_IS_ABSTRACT) == 0)) {\n    o = (*t->tp_alloc)(t, 0);\n  } else {\n    o = (PyObject *) PyBaseObject_Type.tp_new(t, __pyx_empty_tuple, 0);\n  }\n  if (unlikely(!o)) return 0;\n  p = ((struct __pyx_obj_9pywrapfst_Compiler *)o);\n  p->__pyx_vtab = __pyx_vtabptr_9pywrapfst_Compiler;\n  new((void*)&(p->_sstrm)) std::unique_ptr<std::stringstream> ();\n  new((void*)&(p->_fst_type)) std::string();\n  new((void*)&(p->_arc_type)) std::string();\n  if (unlikely(__pyx_pw_9pywrapfst_8Compiler_1__cinit__(o, a, k) < 0)) goto bad;\n  return o;\n  bad:\n  Py_DECREF(o); o = 0;\n  return NULL;\n}\n\nstatic void __pyx_tp_dealloc_9pywrapfst_Compiler(PyObject *o) {\n  struct __pyx_obj_9pywrapfst_Compiler *p = (struct __pyx_obj_9pywrapfst_Compiler *)o;\n  #if CYTHON_USE_TP_FINALIZE\n  if (unlikely(PyType_HasFeature(Py_TYPE(o), Py_TPFLAGS_HAVE_FINALIZE) && Py_TYPE(o)->tp_finalize) && (!PyType_IS_GC(Py_TYPE(o)) || !_PyGC_FINALIZED(o))) {\n    if (PyObject_CallFinalizerFromDealloc(o)) return;\n  }\n  #endif\n  __Pyx_call_destructor(p->_sstrm);\n  __Pyx_call_destructor(p->_fst_type);\n  __Pyx_call_destructor(p->_arc_type);\n  (*Py_TYPE(o)->tp_free)(o);\n}\n\nstatic PyMethodDef __pyx_methods_9pywrapfst_Compiler[] = {\n  {\"compile\", (PyCFunction)__pyx_pw_9pywrapfst_8Compiler_3compile, METH_NOARGS, __pyx_doc_9pywrapfst_8Compiler_2compile},\n  {\"write\", (PyCFunction)__pyx_pw_9pywrapfst_8Compiler_5write, METH_O, __pyx_doc_9pywrapfst_8Compiler_4write},\n  {\"__reduce_cython__\", (PyCFunction)__pyx_pw_9pywrapfst_8Compiler_7__reduce_cython__, METH_NOARGS, 0},\n  {\"__setstate_cython__\", (PyCFunction)__pyx_pw_9pywrapfst_8Compiler_9__setstate_cython__, METH_O, 0},\n  {0, 0, 0, 0}\n};\n\nstatic PyTypeObject __pyx_type_9pywrapfst_Compiler = {\n  PyVarObject_HEAD_INIT(0, 0)\n  \"pywrapfst.Compiler\", /*tp_name*/\n  sizeof(struct __pyx_obj_9pywrapfst_Compiler), /*tp_basicsize*/\n  0, /*tp_itemsize*/\n  __pyx_tp_dealloc_9pywrapfst_Compiler, /*tp_dealloc*/\n  0, /*tp_print*/\n  0, /*tp_getattr*/\n  0, /*tp_setattr*/\n  #if PY_MAJOR_VERSION < 3\n  0, /*tp_compare*/\n  #endif\n  #if PY_MAJOR_VERSION >= 3\n  0, /*tp_as_async*/\n  #endif\n  0, /*tp_repr*/\n  0, /*tp_as_number*/\n  0, /*tp_as_sequence*/\n  0, /*tp_as_mapping*/\n  0, /*tp_hash*/\n  0, /*tp_call*/\n  0, /*tp_str*/\n  0, /*tp_getattro*/\n  0, /*tp_setattro*/\n  0, /*tp_as_buffer*/\n  Py_TPFLAGS_DEFAULT|Py_TPFLAGS_HAVE_VERSION_TAG|Py_TPFLAGS_CHECKTYPES|Py_TPFLAGS_HAVE_NEWBUFFER|Py_TPFLAGS_BASETYPE, /*tp_flags*/\n  \"\\n  Compiler(fst_type=\\\"vector\\\", arc_type=\\\"standard\\\", isymbols=None,\\n           osymbols=None, ssymbols=None, acceptor=False, keep_isymbols=False,\\n           keep_osymbols=False, keep_state_numbering=False,\\n           allow_negative_labels=False)\\n\\n  Class used to compile FSTs from strings.\\n\\n  This class is used to compile FSTs specified using the AT&T FSM library\\n  format described here:\\n\\n  http://web.eecs.umich.edu/~radev/NLP-fall2015/resources/fsm_archive/fsm.5.html\\n\\n  This is the same format used by the `fstcompile` executable.\\n\\n  Compiler options (symbol tables, etc.) are set at construction time.\\n\\n      compiler = fst.Compiler(isymbols=ascii_syms, osymbols=ascii_syms)\\n\\n  Once constructed, Compiler instances behave like a file handle opened for\\n  writing:\\n\\n      # /ba+/\\n      print >> compiler, \\\"0 1 50 50\\\"\\n      print >> compiler, \\\"1 2 49 49\\\"\\n      print >> compiler, \\\"2 2 49 49\\\"\\n      print >> compiler, \\\"2\\\"\\n\\n  The `compile` method returns an actual FST instance:\\n\\n      sheep_machine = compiler.compile()\\n\\n  Compilation flushes the internal buffer, so the compiler instance can be\\n  reused to compile new machines with the same symbol tables (etc.)\\n\\n  Args:\\n    fst_type: A string indicating the container type for the compiled FST.\\n    arc_type: A string indicating the arc type for the compiled FST.\\n    isymbols: An optional SymbolTable used to label input symbols.\\n    osymbols: An optional SymbolTable used to label output symbols.\\n    ssymbols: An optional SymbolTable used to label states.\\n    acceptor: Should the FST be rendered in acceptor format if possible?\\n    keep_isymbols: Should the input symbol table be stored in the FST?\\n    keep_osymbols: Should the output symbol table be stored in the FST?\\n    keep_state_numbering: Should the state numbering be preserved?\\n    allow_negative_labels: Should negative labels be allowed? (Not\\n        recommended; may cause conflicts).\\n  \", /*tp_doc*/\n  0, /*tp_traverse*/\n  0, /*tp_clear*/\n  0, /*tp_richcompare*/\n  0, /*tp_weaklistoffset*/\n  0, /*tp_iter*/\n  0, /*tp_iternext*/\n  __pyx_methods_9pywrapfst_Compiler, /*tp_methods*/\n  0, /*tp_members*/\n  0, /*tp_getset*/\n  0, /*tp_base*/\n  0, /*tp_dict*/\n  0, /*tp_descr_get*/\n  0, /*tp_descr_set*/\n  0, /*tp_dictoffset*/\n  0, /*tp_init*/\n  0, /*tp_alloc*/\n  __pyx_tp_new_9pywrapfst_Compiler, /*tp_new*/\n  0, /*tp_free*/\n  0, /*tp_is_gc*/\n  0, /*tp_bases*/\n  0, /*tp_mro*/\n  0, /*tp_cache*/\n  0, /*tp_subclasses*/\n  0, /*tp_weaklist*/\n  0, /*tp_del*/\n  0, /*tp_version_tag*/\n  #if PY_VERSION_HEX >= 0x030400a1\n  0, /*tp_finalize*/\n  #endif\n};\nstatic struct __pyx_vtabstruct_9pywrapfst_FarReader __pyx_vtable_9pywrapfst_FarReader;\n\nstatic PyObject *__pyx_tp_new_9pywrapfst_FarReader(PyTypeObject *t, CYTHON_UNUSED PyObject *a, CYTHON_UNUSED PyObject *k) {\n  struct __pyx_obj_9pywrapfst_FarReader *p;\n  PyObject *o;\n  if (likely((t->tp_flags & Py_TPFLAGS_IS_ABSTRACT) == 0)) {\n    o = (*t->tp_alloc)(t, 0);\n  } else {\n    o = (PyObject *) PyBaseObject_Type.tp_new(t, __pyx_empty_tuple, 0);\n  }\n  if (unlikely(!o)) return 0;\n  p = ((struct __pyx_obj_9pywrapfst_FarReader *)o);\n  p->__pyx_vtab = __pyx_vtabptr_9pywrapfst_FarReader;\n  new((void*)&(p->_reader)) std::unique_ptr<fst::script::FarReaderClass> ();\n  return o;\n}\n\nstatic void __pyx_tp_dealloc_9pywrapfst_FarReader(PyObject *o) {\n  struct __pyx_obj_9pywrapfst_FarReader *p = (struct __pyx_obj_9pywrapfst_FarReader *)o;\n  #if CYTHON_USE_TP_FINALIZE\n  if (unlikely(PyType_HasFeature(Py_TYPE(o), Py_TPFLAGS_HAVE_FINALIZE) && Py_TYPE(o)->tp_finalize) && (!PyType_IS_GC(Py_TYPE(o)) || !_PyGC_FINALIZED(o))) {\n    if (PyObject_CallFinalizerFromDealloc(o)) return;\n  }\n  #endif\n  __Pyx_call_destructor(p->_reader);\n  (*Py_TYPE(o)->tp_free)(o);\n}\nstatic PyObject *__pyx_sq_item_9pywrapfst_FarReader(PyObject *o, Py_ssize_t i) {\n  PyObject *r;\n  PyObject *x = PyInt_FromSsize_t(i); if(!x) return 0;\n  r = Py_TYPE(o)->tp_as_mapping->mp_subscript(o, x);\n  Py_DECREF(x);\n  return r;\n}\n\nstatic PyMethodDef __pyx_methods_9pywrapfst_FarReader[] = {\n  {\"open\", (PyCFunction)__pyx_pw_9pywrapfst_9FarReader_5open, METH_VARARGS|METH_KEYWORDS, __pyx_doc_9pywrapfst_9FarReader_4open},\n  {\"arc_type\", (PyCFunction)__pyx_pw_9pywrapfst_9FarReader_7arc_type, METH_NOARGS, __pyx_doc_9pywrapfst_9FarReader_6arc_type},\n  {\"done\", (PyCFunction)__pyx_pw_9pywrapfst_9FarReader_9done, METH_NOARGS, __pyx_doc_9pywrapfst_9FarReader_8done},\n  {\"error\", (PyCFunction)__pyx_pw_9pywrapfst_9FarReader_11error, METH_NOARGS, __pyx_doc_9pywrapfst_9FarReader_10error},\n  {\"far_type\", (PyCFunction)__pyx_pw_9pywrapfst_9FarReader_13far_type, METH_NOARGS, 0},\n  {\"find\", (PyCFunction)__pyx_pw_9pywrapfst_9FarReader_15find, METH_O, __pyx_doc_9pywrapfst_9FarReader_14find},\n  {\"get_fst\", (PyCFunction)__pyx_pw_9pywrapfst_9FarReader_17get_fst, METH_NOARGS, __pyx_doc_9pywrapfst_9FarReader_16get_fst},\n  {\"get_key\", (PyCFunction)__pyx_pw_9pywrapfst_9FarReader_19get_key, METH_NOARGS, __pyx_doc_9pywrapfst_9FarReader_18get_key},\n  {\"next\", (PyCFunction)__pyx_pw_9pywrapfst_9FarReader_21next, METH_NOARGS, __pyx_doc_9pywrapfst_9FarReader_20next},\n  {\"reset\", (PyCFunction)__pyx_pw_9pywrapfst_9FarReader_23reset, METH_NOARGS, __pyx_doc_9pywrapfst_9FarReader_22reset},\n  {\"__reduce_cython__\", (PyCFunction)__pyx_pw_9pywrapfst_9FarReader_27__reduce_cython__, METH_NOARGS, 0},\n  {\"__setstate_cython__\", (PyCFunction)__pyx_pw_9pywrapfst_9FarReader_29__setstate_cython__, METH_O, 0},\n  {0, 0, 0, 0}\n};\n\nstatic PySequenceMethods __pyx_tp_as_sequence_FarReader = {\n  0, /*sq_length*/\n  0, /*sq_concat*/\n  0, /*sq_repeat*/\n  __pyx_sq_item_9pywrapfst_FarReader, /*sq_item*/\n  0, /*sq_slice*/\n  0, /*sq_ass_item*/\n  0, /*sq_ass_slice*/\n  0, /*sq_contains*/\n  0, /*sq_inplace_concat*/\n  0, /*sq_inplace_repeat*/\n};\n\nstatic PyMappingMethods __pyx_tp_as_mapping_FarReader = {\n  0, /*mp_length*/\n  __pyx_pw_9pywrapfst_9FarReader_25__getitem__, /*mp_subscript*/\n  0, /*mp_ass_subscript*/\n};\n\nstatic PyTypeObject __pyx_type_9pywrapfst_FarReader = {\n  PyVarObject_HEAD_INIT(0, 0)\n  \"pywrapfst.FarReader\", /*tp_name*/\n  sizeof(struct __pyx_obj_9pywrapfst_FarReader), /*tp_basicsize*/\n  0, /*tp_itemsize*/\n  __pyx_tp_dealloc_9pywrapfst_FarReader, /*tp_dealloc*/\n  0, /*tp_print*/\n  0, /*tp_getattr*/\n  0, /*tp_setattr*/\n  #if PY_MAJOR_VERSION < 3\n  0, /*tp_compare*/\n  #endif\n  #if PY_MAJOR_VERSION >= 3\n  0, /*tp_as_async*/\n  #endif\n  __pyx_pw_9pywrapfst_9FarReader_3__repr__, /*tp_repr*/\n  0, /*tp_as_number*/\n  &__pyx_tp_as_sequence_FarReader, /*tp_as_sequence*/\n  &__pyx_tp_as_mapping_FarReader, /*tp_as_mapping*/\n  0, /*tp_hash*/\n  0, /*tp_call*/\n  0, /*tp_str*/\n  0, /*tp_getattro*/\n  0, /*tp_setattro*/\n  0, /*tp_as_buffer*/\n  Py_TPFLAGS_DEFAULT|Py_TPFLAGS_HAVE_VERSION_TAG|Py_TPFLAGS_CHECKTYPES|Py_TPFLAGS_HAVE_NEWBUFFER|Py_TPFLAGS_BASETYPE, /*tp_flags*/\n  \"\\n  (No constructor.)\\n\\n  FAR (\\\"Fst ARchive\\\") reader object.\\n\\n  This class is used to read a FAR from disk. FARs contain one or more FSTs (of\\n  the same arc type) indexed by a unique string key. To construct a FarReader\\n  object, use the `open` class method.\\n\\n  Attributes:\\n    arc_type: A string indicating the arc type.\\n    far_type: A string indicating the FAR type.\\n  \", /*tp_doc*/\n  0, /*tp_traverse*/\n  0, /*tp_clear*/\n  0, /*tp_richcompare*/\n  0, /*tp_weaklistoffset*/\n  0, /*tp_iter*/\n  0, /*tp_iternext*/\n  __pyx_methods_9pywrapfst_FarReader, /*tp_methods*/\n  0, /*tp_members*/\n  0, /*tp_getset*/\n  0, /*tp_base*/\n  0, /*tp_dict*/\n  0, /*tp_descr_get*/\n  0, /*tp_descr_set*/\n  0, /*tp_dictoffset*/\n  __pyx_pw_9pywrapfst_9FarReader_1__init__, /*tp_init*/\n  0, /*tp_alloc*/\n  __pyx_tp_new_9pywrapfst_FarReader, /*tp_new*/\n  0, /*tp_free*/\n  0, /*tp_is_gc*/\n  0, /*tp_bases*/\n  0, /*tp_mro*/\n  0, /*tp_cache*/\n  0, /*tp_subclasses*/\n  0, /*tp_weaklist*/\n  0, /*tp_del*/\n  0, /*tp_version_tag*/\n  #if PY_VERSION_HEX >= 0x030400a1\n  0, /*tp_finalize*/\n  #endif\n};\nstatic struct __pyx_vtabstruct_9pywrapfst_FarWriter __pyx_vtable_9pywrapfst_FarWriter;\n\nstatic PyObject *__pyx_tp_new_9pywrapfst_FarWriter(PyTypeObject *t, CYTHON_UNUSED PyObject *a, CYTHON_UNUSED PyObject *k) {\n  struct __pyx_obj_9pywrapfst_FarWriter *p;\n  PyObject *o;\n  if (likely((t->tp_flags & Py_TPFLAGS_IS_ABSTRACT) == 0)) {\n    o = (*t->tp_alloc)(t, 0);\n  } else {\n    o = (PyObject *) PyBaseObject_Type.tp_new(t, __pyx_empty_tuple, 0);\n  }\n  if (unlikely(!o)) return 0;\n  p = ((struct __pyx_obj_9pywrapfst_FarWriter *)o);\n  p->__pyx_vtab = __pyx_vtabptr_9pywrapfst_FarWriter;\n  new((void*)&(p->_writer)) std::unique_ptr<fst::script::FarWriterClass> ();\n  return o;\n}\n\nstatic void __pyx_tp_dealloc_9pywrapfst_FarWriter(PyObject *o) {\n  struct __pyx_obj_9pywrapfst_FarWriter *p = (struct __pyx_obj_9pywrapfst_FarWriter *)o;\n  #if CYTHON_USE_TP_FINALIZE\n  if (unlikely(PyType_HasFeature(Py_TYPE(o), Py_TPFLAGS_HAVE_FINALIZE) && Py_TYPE(o)->tp_finalize) && (!PyType_IS_GC(Py_TYPE(o)) || !_PyGC_FINALIZED(o))) {\n    if (PyObject_CallFinalizerFromDealloc(o)) return;\n  }\n  #endif\n  __Pyx_call_destructor(p->_writer);\n  (*Py_TYPE(o)->tp_free)(o);\n}\n\nstatic int __pyx_mp_ass_subscript_9pywrapfst_FarWriter(PyObject *o, PyObject *i, PyObject *v) {\n  if (v) {\n    return __pyx_pw_9pywrapfst_9FarWriter_15__setitem__(o, i, v);\n  }\n  else {\n    PyErr_Format(PyExc_NotImplementedError,\n      \"Subscript deletion not supported by %.200s\", Py_TYPE(o)->tp_name);\n    return -1;\n  }\n}\n\nstatic PyMethodDef __pyx_methods_9pywrapfst_FarWriter[] = {\n  {\"create\", (PyCFunction)__pyx_pw_9pywrapfst_9FarWriter_5create, METH_VARARGS|METH_KEYWORDS, __pyx_doc_9pywrapfst_9FarWriter_4create},\n  {\"add\", (PyCFunction)__pyx_pw_9pywrapfst_9FarWriter_7add, METH_VARARGS|METH_KEYWORDS, __pyx_doc_9pywrapfst_9FarWriter_6add},\n  {\"arc_type\", (PyCFunction)__pyx_pw_9pywrapfst_9FarWriter_9arc_type, METH_NOARGS, __pyx_doc_9pywrapfst_9FarWriter_8arc_type},\n  {\"error\", (PyCFunction)__pyx_pw_9pywrapfst_9FarWriter_11error, METH_NOARGS, __pyx_doc_9pywrapfst_9FarWriter_10error},\n  {\"far_type\", (PyCFunction)__pyx_pw_9pywrapfst_9FarWriter_13far_type, METH_NOARGS, __pyx_doc_9pywrapfst_9FarWriter_12far_type},\n  {\"__reduce_cython__\", (PyCFunction)__pyx_pw_9pywrapfst_9FarWriter_17__reduce_cython__, METH_NOARGS, 0},\n  {\"__setstate_cython__\", (PyCFunction)__pyx_pw_9pywrapfst_9FarWriter_19__setstate_cython__, METH_O, 0},\n  {0, 0, 0, 0}\n};\n\nstatic PyMappingMethods __pyx_tp_as_mapping_FarWriter = {\n  0, /*mp_length*/\n  0, /*mp_subscript*/\n  __pyx_mp_ass_subscript_9pywrapfst_FarWriter, /*mp_ass_subscript*/\n};\n\nstatic PyTypeObject __pyx_type_9pywrapfst_FarWriter = {\n  PyVarObject_HEAD_INIT(0, 0)\n  \"pywrapfst.FarWriter\", /*tp_name*/\n  sizeof(struct __pyx_obj_9pywrapfst_FarWriter), /*tp_basicsize*/\n  0, /*tp_itemsize*/\n  __pyx_tp_dealloc_9pywrapfst_FarWriter, /*tp_dealloc*/\n  0, /*tp_print*/\n  0, /*tp_getattr*/\n  0, /*tp_setattr*/\n  #if PY_MAJOR_VERSION < 3\n  0, /*tp_compare*/\n  #endif\n  #if PY_MAJOR_VERSION >= 3\n  0, /*tp_as_async*/\n  #endif\n  __pyx_pw_9pywrapfst_9FarWriter_3__repr__, /*tp_repr*/\n  0, /*tp_as_number*/\n  0, /*tp_as_sequence*/\n  &__pyx_tp_as_mapping_FarWriter, /*tp_as_mapping*/\n  0, /*tp_hash*/\n  0, /*tp_call*/\n  0, /*tp_str*/\n  0, /*tp_getattro*/\n  0, /*tp_setattro*/\n  0, /*tp_as_buffer*/\n  Py_TPFLAGS_DEFAULT|Py_TPFLAGS_HAVE_VERSION_TAG|Py_TPFLAGS_CHECKTYPES|Py_TPFLAGS_HAVE_NEWBUFFER|Py_TPFLAGS_BASETYPE, /*tp_flags*/\n  \"\\n  (No constructor.)\\n\\n  FAR (\\\"Fst ARchive\\\") writer object.\\n\\n  This class is used to write FSTs (of the same arc type) to a FAR on disk. To\\n  construct a FarWriter, use the `create` class method.\\n\\n  Note that the data is not guaranteed to flush to disk until the FarWriter\\n  is garbage-collected. If a FarWriter has been assigned to only one variable,\\n  then calling `del` on that variable should decrement the object's reference\\n  count from 1 to 0, triggering a flush to disk on the next GC cycle.\\n\\n  Attributes:\\n    arc_type: A string indicating the arc type.\\n    far_type: A string indicating the FAR type.\\n  \", /*tp_doc*/\n  0, /*tp_traverse*/\n  0, /*tp_clear*/\n  0, /*tp_richcompare*/\n  0, /*tp_weaklistoffset*/\n  0, /*tp_iter*/\n  0, /*tp_iternext*/\n  __pyx_methods_9pywrapfst_FarWriter, /*tp_methods*/\n  0, /*tp_members*/\n  0, /*tp_getset*/\n  0, /*tp_base*/\n  0, /*tp_dict*/\n  0, /*tp_descr_get*/\n  0, /*tp_descr_set*/\n  0, /*tp_dictoffset*/\n  __pyx_pw_9pywrapfst_9FarWriter_1__init__, /*tp_init*/\n  0, /*tp_alloc*/\n  __pyx_tp_new_9pywrapfst_FarWriter, /*tp_new*/\n  0, /*tp_free*/\n  0, /*tp_is_gc*/\n  0, /*tp_bases*/\n  0, /*tp_mro*/\n  0, /*tp_cache*/\n  0, /*tp_subclasses*/\n  0, /*tp_weaklist*/\n  0, /*tp_del*/\n  0, /*tp_version_tag*/\n  #if PY_VERSION_HEX >= 0x030400a1\n  0, /*tp_finalize*/\n  #endif\n};\n\nstatic PyMethodDef __pyx_methods[] = {\n  {\"compact_symbol_table\", (PyCFunction)__pyx_pw_9pywrapfst_9compact_symbol_table, METH_O, __pyx_doc_9pywrapfst_8compact_symbol_table},\n  {\"merge_symbol_table\", (PyCFunction)__pyx_pw_9pywrapfst_11merge_symbol_table, METH_VARARGS|METH_KEYWORDS, __pyx_doc_9pywrapfst_10merge_symbol_table},\n  {\"_read\", (PyCFunction)__pyx_pw_9pywrapfst_13_read, METH_O, 0},\n  {\"_read_from_string\", (PyCFunction)__pyx_pw_9pywrapfst_15_read_from_string, METH_O, 0},\n  {\"arcmap\", (PyCFunction)__pyx_pw_9pywrapfst_17arcmap, METH_VARARGS|METH_KEYWORDS, __pyx_doc_9pywrapfst_16arcmap},\n  {\"compose\", (PyCFunction)__pyx_pw_9pywrapfst_19compose, METH_VARARGS|METH_KEYWORDS, __pyx_doc_9pywrapfst_18compose},\n  {\"convert\", (PyCFunction)__pyx_pw_9pywrapfst_21convert, METH_VARARGS|METH_KEYWORDS, __pyx_doc_9pywrapfst_20convert},\n  {\"determinize\", (PyCFunction)__pyx_pw_9pywrapfst_23determinize, METH_VARARGS|METH_KEYWORDS, __pyx_doc_9pywrapfst_22determinize},\n  {\"difference\", (PyCFunction)__pyx_pw_9pywrapfst_25difference, METH_VARARGS|METH_KEYWORDS, __pyx_doc_9pywrapfst_24difference},\n  {\"disambiguate\", (PyCFunction)__pyx_pw_9pywrapfst_27disambiguate, METH_VARARGS|METH_KEYWORDS, __pyx_doc_9pywrapfst_26disambiguate},\n  {\"epsnormalize\", (PyCFunction)__pyx_pw_9pywrapfst_29epsnormalize, METH_VARARGS|METH_KEYWORDS, __pyx_doc_9pywrapfst_28epsnormalize},\n  {\"equal\", (PyCFunction)__pyx_pw_9pywrapfst_31equal, METH_VARARGS|METH_KEYWORDS, __pyx_doc_9pywrapfst_30equal},\n  {\"equivalent\", (PyCFunction)__pyx_pw_9pywrapfst_33equivalent, METH_VARARGS|METH_KEYWORDS, __pyx_doc_9pywrapfst_32equivalent},\n  {\"intersect\", (PyCFunction)__pyx_pw_9pywrapfst_35intersect, METH_VARARGS|METH_KEYWORDS, __pyx_doc_9pywrapfst_34intersect},\n  {\"isomorphic\", (PyCFunction)__pyx_pw_9pywrapfst_37isomorphic, METH_VARARGS|METH_KEYWORDS, __pyx_doc_9pywrapfst_36isomorphic},\n  {\"prune\", (PyCFunction)__pyx_pw_9pywrapfst_39prune, METH_VARARGS|METH_KEYWORDS, __pyx_doc_9pywrapfst_38prune},\n  {\"push\", (PyCFunction)__pyx_pw_9pywrapfst_41push, METH_VARARGS|METH_KEYWORDS, __pyx_doc_9pywrapfst_40push},\n  {\"randequivalent\", (PyCFunction)__pyx_pw_9pywrapfst_43randequivalent, METH_VARARGS|METH_KEYWORDS, __pyx_doc_9pywrapfst_42randequivalent},\n  {\"randgen\", (PyCFunction)__pyx_pw_9pywrapfst_45randgen, METH_VARARGS|METH_KEYWORDS, __pyx_doc_9pywrapfst_44randgen},\n  {\"replace\", (PyCFunction)__pyx_pw_9pywrapfst_47replace, METH_VARARGS|METH_KEYWORDS, __pyx_doc_9pywrapfst_46replace},\n  {\"reverse\", (PyCFunction)__pyx_pw_9pywrapfst_49reverse, METH_VARARGS|METH_KEYWORDS, __pyx_doc_9pywrapfst_48reverse},\n  {\"shortestpath\", (PyCFunction)__pyx_pw_9pywrapfst_53shortestpath, METH_VARARGS|METH_KEYWORDS, __pyx_doc_9pywrapfst_52shortestpath},\n  {\"statemap\", (PyCFunction)__pyx_pw_9pywrapfst_55statemap, METH_VARARGS|METH_KEYWORDS, __pyx_doc_9pywrapfst_54statemap},\n  {\"synchronize\", (PyCFunction)__pyx_pw_9pywrapfst_57synchronize, METH_O, __pyx_doc_9pywrapfst_56synchronize},\n  {0, 0, 0, 0}\n};\n\n#if PY_MAJOR_VERSION >= 3\n#if CYTHON_PEP489_MULTI_PHASE_INIT\nstatic PyObject* __pyx_pymod_create(PyObject *spec, PyModuleDef *def); /*proto*/\nstatic int __pyx_pymod_exec_pywrapfst(PyObject* module); /*proto*/\nstatic PyModuleDef_Slot __pyx_moduledef_slots[] = {\n  {Py_mod_create, (void*)__pyx_pymod_create},\n  {Py_mod_exec, (void*)__pyx_pymod_exec_pywrapfst},\n  {0, NULL}\n};\n#endif\n\nstatic struct PyModuleDef __pyx_moduledef = {\n    PyModuleDef_HEAD_INIT,\n    \"pywrapfst\",\n    __pyx_k_Python_interface_to_the_FST_scri, /* m_doc */\n  #if CYTHON_PEP489_MULTI_PHASE_INIT\n    0, /* m_size */\n  #else\n    -1, /* m_size */\n  #endif\n    __pyx_methods /* m_methods */,\n  #if CYTHON_PEP489_MULTI_PHASE_INIT\n    __pyx_moduledef_slots, /* m_slots */\n  #else\n    NULL, /* m_reload */\n  #endif\n    NULL, /* m_traverse */\n    NULL, /* m_clear */\n    NULL /* m_free */\n};\n#endif\n\nstatic __Pyx_StringTabEntry __pyx_string_tab[] = {\n  {&__pyx_n_s_ACCEPTOR, __pyx_k_ACCEPTOR, sizeof(__pyx_k_ACCEPTOR), 0, 0, 1, 1},\n  {&__pyx_n_s_ACCESSIBLE, __pyx_k_ACCESSIBLE, sizeof(__pyx_k_ACCESSIBLE), 0, 0, 1, 1},\n  {&__pyx_n_s_ACYCLIC, __pyx_k_ACYCLIC, sizeof(__pyx_k_ACYCLIC), 0, 0, 1, 1},\n  {&__pyx_n_s_ADD_ARC_PROPERTIES, __pyx_k_ADD_ARC_PROPERTIES, sizeof(__pyx_k_ADD_ARC_PROPERTIES), 0, 0, 1, 1},\n  {&__pyx_n_s_ADD_STATE_PROPERTIES, __pyx_k_ADD_STATE_PROPERTIES, sizeof(__pyx_k_ADD_STATE_PROPERTIES), 0, 0, 1, 1},\n  {&__pyx_n_s_ADD_SUPERFINAL_PROPERTIES, __pyx_k_ADD_SUPERFINAL_PROPERTIES, sizeof(__pyx_k_ADD_SUPERFINAL_PROPERTIES), 0, 0, 1, 1},\n  {&__pyx_n_s_ARC_FLAGS, __pyx_k_ARC_FLAGS, sizeof(__pyx_k_ARC_FLAGS), 0, 0, 1, 1},\n  {&__pyx_n_s_ARC_I_LABEL_VALUE, __pyx_k_ARC_I_LABEL_VALUE, sizeof(__pyx_k_ARC_I_LABEL_VALUE), 0, 0, 1, 1},\n  {&__pyx_n_s_ARC_NEXT_STATE_VALUE, __pyx_k_ARC_NEXT_STATE_VALUE, sizeof(__pyx_k_ARC_NEXT_STATE_VALUE), 0, 0, 1, 1},\n  {&__pyx_n_s_ARC_NO_CACHE, __pyx_k_ARC_NO_CACHE, sizeof(__pyx_k_ARC_NO_CACHE), 0, 0, 1, 1},\n  {&__pyx_n_s_ARC_O_LABEL_VALUE, __pyx_k_ARC_O_LABEL_VALUE, sizeof(__pyx_k_ARC_O_LABEL_VALUE), 0, 0, 1, 1},\n  {&__pyx_n_s_ARC_SORT_PROPERTIES, __pyx_k_ARC_SORT_PROPERTIES, sizeof(__pyx_k_ARC_SORT_PROPERTIES), 0, 0, 1, 1},\n  {&__pyx_n_s_ARC_VALUE_FLAGS, __pyx_k_ARC_VALUE_FLAGS, sizeof(__pyx_k_ARC_VALUE_FLAGS), 0, 0, 1, 1},\n  {&__pyx_n_s_ARC_WEIGHT_VALUE, __pyx_k_ARC_WEIGHT_VALUE, sizeof(__pyx_k_ARC_WEIGHT_VALUE), 0, 0, 1, 1},\n  {&__pyx_kp_s_ArcIterator_at_0x_x, __pyx_k_ArcIterator_at_0x_x, sizeof(__pyx_k_ArcIterator_at_0x_x), 0, 0, 1, 0},\n  {&__pyx_kp_s_Arc_at_0x_x, __pyx_k_Arc_at_0x_x, sizeof(__pyx_k_Arc_at_0x_x), 0, 0, 1, 0},\n  {&__pyx_n_s_BINARY_PROPERTIES, __pyx_k_BINARY_PROPERTIES, sizeof(__pyx_k_BINARY_PROPERTIES), 0, 0, 1, 1},\n  {&__pyx_n_s_COACCESSIBLE, __pyx_k_COACCESSIBLE, sizeof(__pyx_k_COACCESSIBLE), 0, 0, 1, 1},\n  {&__pyx_n_s_COPY_PROPERTIES, __pyx_k_COPY_PROPERTIES, sizeof(__pyx_k_COPY_PROPERTIES), 0, 0, 1, 1},\n  {&__pyx_n_s_CYCLIC, __pyx_k_CYCLIC, sizeof(__pyx_k_CYCLIC), 0, 0, 1, 1},\n  {&__pyx_n_s_CalledProcessError, __pyx_k_CalledProcessError, sizeof(__pyx_k_CalledProcessError), 0, 0, 1, 1},\n  {&__pyx_kp_s_Cannot_construct, __pyx_k_Cannot_construct, sizeof(__pyx_k_Cannot_construct), 0, 0, 1, 0},\n  {&__pyx_kp_s_Cannot_encode_as_string_r, __pyx_k_Cannot_encode_as_string_r, sizeof(__pyx_k_Cannot_encode_as_string_r), 0, 0, 1, 0},\n  {&__pyx_kp_s_Cannot_topsort_cyclic_FST, __pyx_k_Cannot_topsort_cyclic_FST, sizeof(__pyx_k_Cannot_topsort_cyclic_FST), 0, 0, 1, 0},\n  {&__pyx_kp_s_Compilation_failed, __pyx_k_Compilation_failed, sizeof(__pyx_k_Compilation_failed), 0, 0, 1, 0},\n  {&__pyx_kp_s_Conversion_to_r_failed, __pyx_k_Conversion_to_r_failed, sizeof(__pyx_k_Conversion_to_r_failed), 0, 0, 1, 0},\n  {&__pyx_n_s_DELETE_ARC_PROPERTIES, __pyx_k_DELETE_ARC_PROPERTIES, sizeof(__pyx_k_DELETE_ARC_PROPERTIES), 0, 0, 1, 1},\n  {&__pyx_n_s_DELETE_STATE_PROPERTIES, __pyx_k_DELETE_STATE_PROPERTIES, sizeof(__pyx_k_DELETE_STATE_PROPERTIES), 0, 0, 1, 1},\n  {&__pyx_n_s_DOT_TSVG, __pyx_k_DOT_TSVG, sizeof(__pyx_k_DOT_TSVG), 0, 0, 1, 1},\n  {&__pyx_n_s_ENCODE_FLAGS, __pyx_k_ENCODE_FLAGS, sizeof(__pyx_k_ENCODE_FLAGS), 0, 0, 1, 1},\n  {&__pyx_n_s_ENCODE_LABELS, __pyx_k_ENCODE_LABELS, sizeof(__pyx_k_ENCODE_LABELS), 0, 0, 1, 1},\n  {&__pyx_n_s_ENCODE_WEIGHTS, __pyx_k_ENCODE_WEIGHTS, sizeof(__pyx_k_ENCODE_WEIGHTS), 0, 0, 1, 1},\n  {&__pyx_n_s_EPSILONS, __pyx_k_EPSILONS, sizeof(__pyx_k_EPSILONS), 0, 0, 1, 1},\n  {&__pyx_n_s_ERROR, __pyx_k_ERROR, sizeof(__pyx_k_ERROR), 0, 0, 1, 1},\n  {&__pyx_n_s_EXPANDED, __pyx_k_EXPANDED, sizeof(__pyx_k_EXPANDED), 0, 0, 1, 1},\n  {&__pyx_n_s_EXTRINSIC_PROPERTIES, __pyx_k_EXTRINSIC_PROPERTIES, sizeof(__pyx_k_EXTRINSIC_PROPERTIES), 0, 0, 1, 1},\n  {&__pyx_kp_s_EncodeMapper_at_0x_x, __pyx_k_EncodeMapper_at_0x_x, sizeof(__pyx_k_EncodeMapper_at_0x_x), 0, 0, 1, 0},\n  {&__pyx_n_s_FST_PROPERTIES, __pyx_k_FST_PROPERTIES, sizeof(__pyx_k_FST_PROPERTIES), 0, 0, 1, 1},\n  {&__pyx_kp_s_FarReader_at_0x_x, __pyx_k_FarReader_at_0x_x, sizeof(__pyx_k_FarReader_at_0x_x), 0, 0, 1, 0},\n  {&__pyx_kp_s_FarWriter_at_0x_x, __pyx_k_FarWriter_at_0x_x, sizeof(__pyx_k_FarWriter_at_0x_x), 0, 0, 1, 0},\n  {&__pyx_n_s_Fst, __pyx_k_Fst, sizeof(__pyx_k_Fst), 0, 0, 1, 1},\n  {&__pyx_n_s_FstArgError, __pyx_k_FstArgError, sizeof(__pyx_k_FstArgError), 0, 0, 1, 1},\n  {&__pyx_n_s_FstBadWeightError, __pyx_k_FstBadWeightError, sizeof(__pyx_k_FstBadWeightError), 0, 0, 1, 1},\n  {&__pyx_n_s_FstDeletedConstructorError, __pyx_k_FstDeletedConstructorError, sizeof(__pyx_k_FstDeletedConstructorError), 0, 0, 1, 1},\n  {&__pyx_n_s_FstError, __pyx_k_FstError, sizeof(__pyx_k_FstError), 0, 0, 1, 1},\n  {&__pyx_n_s_FstIOError, __pyx_k_FstIOError, sizeof(__pyx_k_FstIOError), 0, 0, 1, 1},\n  {&__pyx_n_s_FstIndexError, __pyx_k_FstIndexError, sizeof(__pyx_k_FstIndexError), 0, 0, 1, 1},\n  {&__pyx_n_s_FstOpError, __pyx_k_FstOpError, sizeof(__pyx_k_FstOpError), 0, 0, 1, 1},\n  {&__pyx_kp_s_Fst_SymbolTable_r_at_0x_x, __pyx_k_Fst_SymbolTable_r_at_0x_x, sizeof(__pyx_k_Fst_SymbolTable_r_at_0x_x), 0, 0, 1, 0},\n  {&__pyx_n_s_Fst___new, __pyx_k_Fst___new, sizeof(__pyx_k_Fst___new), 0, 0, 1, 1},\n  {&__pyx_kp_s_Fst_arc_type_standard_Construct, __pyx_k_Fst_arc_type_standard_Construct, sizeof(__pyx_k_Fst_arc_type_standard_Construct), 0, 0, 1, 0},\n  {&__pyx_kp_s_Fst_at_0x_x, __pyx_k_Fst_at_0x_x, sizeof(__pyx_k_Fst_at_0x_x), 0, 0, 1, 0},\n  {&__pyx_n_s_Fst_read, __pyx_k_Fst_read, sizeof(__pyx_k_Fst_read), 0, 0, 1, 1},\n  {&__pyx_n_s_Fst_read_from_string, __pyx_k_Fst_read_from_string, sizeof(__pyx_k_Fst_read_from_string), 0, 0, 1, 1},\n  {&__pyx_n_s_INITIAL_ACYCLIC, __pyx_k_INITIAL_ACYCLIC, sizeof(__pyx_k_INITIAL_ACYCLIC), 0, 0, 1, 1},\n  {&__pyx_n_s_INITIAL_CYCLIC, __pyx_k_INITIAL_CYCLIC, sizeof(__pyx_k_INITIAL_CYCLIC), 0, 0, 1, 1},\n  {&__pyx_n_s_INTRINSIC_PROPERTIES, __pyx_k_INTRINSIC_PROPERTIES, sizeof(__pyx_k_INTRINSIC_PROPERTIES), 0, 0, 1, 1},\n  {&__pyx_n_s_IOError, __pyx_k_IOError, sizeof(__pyx_k_IOError), 0, 0, 1, 1},\n  {&__pyx_n_s_I_DETERMINISTIC, __pyx_k_I_DETERMINISTIC, sizeof(__pyx_k_I_DETERMINISTIC), 0, 0, 1, 1},\n  {&__pyx_n_s_I_EPSILONS, __pyx_k_I_EPSILONS, sizeof(__pyx_k_I_EPSILONS), 0, 0, 1, 1},\n  {&__pyx_n_s_I_LABEL_INVARIANT_PROPERTIES, __pyx_k_I_LABEL_INVARIANT_PROPERTIES, sizeof(__pyx_k_I_LABEL_INVARIANT_PROPERTIES), 0, 0, 1, 1},\n  {&__pyx_n_s_I_LABEL_SORTED, __pyx_k_I_LABEL_SORTED, sizeof(__pyx_k_I_LABEL_SORTED), 0, 0, 1, 1},\n  {&__pyx_kp_s_Incompatible_or_invalid_arc_type, __pyx_k_Incompatible_or_invalid_arc_type, sizeof(__pyx_k_Incompatible_or_invalid_arc_type), 0, 0, 1, 0},\n  {&__pyx_kp_s_Incompatible_or_invalid_weight, __pyx_k_Incompatible_or_invalid_weight, sizeof(__pyx_k_Incompatible_or_invalid_weight), 0, 0, 1, 0},\n  {&__pyx_kp_s_Incompatible_or_invalid_weight_t, __pyx_k_Incompatible_or_invalid_weight_t, sizeof(__pyx_k_Incompatible_or_invalid_weight_t), 0, 0, 1, 0},\n  {&__pyx_n_s_IndexError, __pyx_k_IndexError, sizeof(__pyx_k_IndexError), 0, 0, 1, 1},\n  {&__pyx_kp_s_Invalid_weight, __pyx_k_Invalid_weight, sizeof(__pyx_k_Invalid_weight), 0, 0, 1, 0},\n  {&__pyx_n_s_KeyError, __pyx_k_KeyError, sizeof(__pyx_k_KeyError), 0, 0, 1, 1},\n  {&__pyx_kp_s_Key_out_of_order, __pyx_k_Key_out_of_order, sizeof(__pyx_k_Key_out_of_order), 0, 0, 1, 0},\n  {&__pyx_n_s_MUTABLE, __pyx_k_MUTABLE, sizeof(__pyx_k_MUTABLE), 0, 0, 1, 1},\n  {&__pyx_kp_s_MutableArcIterator_at_0x_x, __pyx_k_MutableArcIterator_at_0x_x, sizeof(__pyx_k_MutableArcIterator_at_0x_x), 0, 0, 1, 0},\n  {&__pyx_n_s_NEG_TRINARY_PROPERTIES, __pyx_k_NEG_TRINARY_PROPERTIES, sizeof(__pyx_k_NEG_TRINARY_PROPERTIES), 0, 0, 1, 1},\n  {&__pyx_n_s_NON_I_DETERMINISTIC, __pyx_k_NON_I_DETERMINISTIC, sizeof(__pyx_k_NON_I_DETERMINISTIC), 0, 0, 1, 1},\n  {&__pyx_n_s_NON_O_DETERMINISTIC, __pyx_k_NON_O_DETERMINISTIC, sizeof(__pyx_k_NON_O_DETERMINISTIC), 0, 0, 1, 1},\n  {&__pyx_n_s_NOT_ACCEPTOR, __pyx_k_NOT_ACCEPTOR, sizeof(__pyx_k_NOT_ACCEPTOR), 0, 0, 1, 1},\n  {&__pyx_n_s_NOT_ACCESSIBLE, __pyx_k_NOT_ACCESSIBLE, sizeof(__pyx_k_NOT_ACCESSIBLE), 0, 0, 1, 1},\n  {&__pyx_n_s_NOT_COACCESSIBLE, __pyx_k_NOT_COACCESSIBLE, sizeof(__pyx_k_NOT_COACCESSIBLE), 0, 0, 1, 1},\n  {&__pyx_n_s_NOT_I_LABEL_SORTED, __pyx_k_NOT_I_LABEL_SORTED, sizeof(__pyx_k_NOT_I_LABEL_SORTED), 0, 0, 1, 1},\n  {&__pyx_n_s_NOT_O_LABEL_SORTED, __pyx_k_NOT_O_LABEL_SORTED, sizeof(__pyx_k_NOT_O_LABEL_SORTED), 0, 0, 1, 1},\n  {&__pyx_n_s_NOT_STRING, __pyx_k_NOT_STRING, sizeof(__pyx_k_NOT_STRING), 0, 0, 1, 1},\n  {&__pyx_n_s_NOT_TOP_SORTED, __pyx_k_NOT_TOP_SORTED, sizeof(__pyx_k_NOT_TOP_SORTED), 0, 0, 1, 1},\n  {&__pyx_n_s_NO_EPSILONS, __pyx_k_NO_EPSILONS, sizeof(__pyx_k_NO_EPSILONS), 0, 0, 1, 1},\n  {&__pyx_n_s_NO_I_EPSILONS, __pyx_k_NO_I_EPSILONS, sizeof(__pyx_k_NO_I_EPSILONS), 0, 0, 1, 1},\n  {&__pyx_n_s_NO_LABEL, __pyx_k_NO_LABEL, sizeof(__pyx_k_NO_LABEL), 0, 0, 1, 1},\n  {&__pyx_n_s_NO_O_EPSILONS, __pyx_k_NO_O_EPSILONS, sizeof(__pyx_k_NO_O_EPSILONS), 0, 0, 1, 1},\n  {&__pyx_n_s_NO_STATE_ID, __pyx_k_NO_STATE_ID, sizeof(__pyx_k_NO_STATE_ID), 0, 0, 1, 1},\n  {&__pyx_n_s_NO_SYMBOL, __pyx_k_NO_SYMBOL, sizeof(__pyx_k_NO_SYMBOL), 0, 0, 1, 1},\n  {&__pyx_n_s_NULL_PROPERTIES, __pyx_k_NULL_PROPERTIES, sizeof(__pyx_k_NULL_PROPERTIES), 0, 0, 1, 1},\n  {&__pyx_n_s_NoWeight, __pyx_k_NoWeight, sizeof(__pyx_k_NoWeight), 0, 0, 1, 1},\n  {&__pyx_kp_s_No_new_SymbolTables_specified, __pyx_k_No_new_SymbolTables_specified, sizeof(__pyx_k_No_new_SymbolTables_specified), 0, 0, 1, 0},\n  {&__pyx_kp_s_No_relabeling_pairs_specified, __pyx_k_No_relabeling_pairs_specified, sizeof(__pyx_k_No_relabeling_pairs_specified), 0, 0, 1, 0},\n  {&__pyx_n_s_Number, __pyx_k_Number, sizeof(__pyx_k_Number), 0, 0, 1, 1},\n  {&__pyx_n_s_O_DETERMINISTIC, __pyx_k_O_DETERMINISTIC, sizeof(__pyx_k_O_DETERMINISTIC), 0, 0, 1, 1},\n  {&__pyx_n_s_O_EPSILONS, __pyx_k_O_EPSILONS, sizeof(__pyx_k_O_EPSILONS), 0, 0, 1, 1},\n  {&__pyx_n_s_O_LABEL_INVARIANT_PROPERTIES, __pyx_k_O_LABEL_INVARIANT_PROPERTIES, sizeof(__pyx_k_O_LABEL_INVARIANT_PROPERTIES), 0, 0, 1, 1},\n  {&__pyx_n_s_O_LABEL_SORTED, __pyx_k_O_LABEL_SORTED, sizeof(__pyx_k_O_LABEL_SORTED), 0, 0, 1, 1},\n  {&__pyx_n_s_One, __pyx_k_One, sizeof(__pyx_k_One), 0, 0, 1, 1},\n  {&__pyx_kp_s_Open_failed_r, __pyx_k_Open_failed_r, sizeof(__pyx_k_Open_failed_r), 0, 0, 1, 0},\n  {&__pyx_kp_s_Operation_failed, __pyx_k_Operation_failed, sizeof(__pyx_k_Operation_failed), 0, 0, 1, 0},\n  {&__pyx_n_s_PIPE, __pyx_k_PIPE, sizeof(__pyx_k_PIPE), 0, 0, 1, 1},\n  {&__pyx_n_s_POS_TRINARY_PROPERTIES, __pyx_k_POS_TRINARY_PROPERTIES, sizeof(__pyx_k_POS_TRINARY_PROPERTIES), 0, 0, 1, 1},\n  {&__pyx_n_s_Popen, __pyx_k_Popen, sizeof(__pyx_k_Popen), 0, 0, 1, 1},\n  {&__pyx_n_s_RM_SUPERFINAL_PROPERTIES, __pyx_k_RM_SUPERFINAL_PROPERTIES, sizeof(__pyx_k_RM_SUPERFINAL_PROPERTIES), 0, 0, 1, 1},\n  {&__pyx_kp_s_Read_failed_r, __pyx_k_Read_failed_r, sizeof(__pyx_k_Read_failed_r), 0, 0, 1, 0},\n  {&__pyx_kp_s_Read_failed_string, __pyx_k_Read_failed_string, sizeof(__pyx_k_Read_failed_string), 0, 0, 1, 0},\n  {&__pyx_n_s_RuntimeError, __pyx_k_RuntimeError, sizeof(__pyx_k_RuntimeError), 0, 0, 1, 1},\n  {&__pyx_n_s_SET_ARC_PROPERTIES, __pyx_k_SET_ARC_PROPERTIES, sizeof(__pyx_k_SET_ARC_PROPERTIES), 0, 0, 1, 1},\n  {&__pyx_n_s_SET_FINAL_PROPERTIES, __pyx_k_SET_FINAL_PROPERTIES, sizeof(__pyx_k_SET_FINAL_PROPERTIES), 0, 0, 1, 1},\n  {&__pyx_n_s_SET_START_PROPERTIES, __pyx_k_SET_START_PROPERTIES, sizeof(__pyx_k_SET_START_PROPERTIES), 0, 0, 1, 1},\n  {&__pyx_n_s_STATE_SORT_PROPERTIES, __pyx_k_STATE_SORT_PROPERTIES, sizeof(__pyx_k_STATE_SORT_PROPERTIES), 0, 0, 1, 1},\n  {&__pyx_n_s_STRING, __pyx_k_STRING, sizeof(__pyx_k_STRING), 0, 0, 1, 1},\n  {&__pyx_kp_s_StateIterator_at_0x_x, __pyx_k_StateIterator_at_0x_x, sizeof(__pyx_k_StateIterator_at_0x_x), 0, 0, 1, 0},\n  {&__pyx_kp_s_State_index_out_of_range, __pyx_k_State_index_out_of_range, sizeof(__pyx_k_State_index_out_of_range), 0, 0, 1, 0},\n  {&__pyx_n_s_StopIteration, __pyx_k_StopIteration, sizeof(__pyx_k_StopIteration), 0, 0, 1, 1},\n  {&__pyx_kp_s_SymbolTableIterator_at_0x_x, __pyx_k_SymbolTableIterator_at_0x_x, sizeof(__pyx_k_SymbolTableIterator_at_0x_x), 0, 0, 1, 0},\n  {&__pyx_kp_s_SymbolTable_r_at_0x_x, __pyx_k_SymbolTable_r_at_0x_x, sizeof(__pyx_k_SymbolTable_r_at_0x_x), 0, 0, 1, 0},\n  {&__pyx_n_s_TOP_SORTED, __pyx_k_TOP_SORTED, sizeof(__pyx_k_TOP_SORTED), 0, 0, 1, 1},\n  {&__pyx_n_s_TRINARY_PROPERTIES, __pyx_k_TRINARY_PROPERTIES, sizeof(__pyx_k_TRINARY_PROPERTIES), 0, 0, 1, 1},\n  {&__pyx_kp_s_Tsvg, __pyx_k_Tsvg, sizeof(__pyx_k_Tsvg), 0, 0, 1, 0},\n  {&__pyx_n_s_TypeError, __pyx_k_TypeError, sizeof(__pyx_k_TypeError), 0, 0, 1, 1},\n  {&__pyx_n_s_UNWEIGHTED, __pyx_k_UNWEIGHTED, sizeof(__pyx_k_UNWEIGHTED), 0, 0, 1, 1},\n  {&__pyx_n_s_UNWEIGHTED_CYCLES, __pyx_k_UNWEIGHTED_CYCLES, sizeof(__pyx_k_UNWEIGHTED_CYCLES), 0, 0, 1, 1},\n  {&__pyx_kp_s_Unknown_arc_type_r, __pyx_k_Unknown_arc_type_r, sizeof(__pyx_k_Unknown_arc_type_r), 0, 0, 1, 0},\n  {&__pyx_kp_s_Unknown_compose_filter_type_r, __pyx_k_Unknown_compose_filter_type_r, sizeof(__pyx_k_Unknown_compose_filter_type_r), 0, 0, 1, 0},\n  {&__pyx_kp_s_Unknown_determinization_type_r, __pyx_k_Unknown_determinization_type_r, sizeof(__pyx_k_Unknown_determinization_type_r), 0, 0, 1, 0},\n  {&__pyx_kp_s_Unknown_map_type_r, __pyx_k_Unknown_map_type_r, sizeof(__pyx_k_Unknown_map_type_r), 0, 0, 1, 0},\n  {&__pyx_kp_s_Unknown_queue_type_r, __pyx_k_Unknown_queue_type_r, sizeof(__pyx_k_Unknown_queue_type_r), 0, 0, 1, 0},\n  {&__pyx_kp_s_Unknown_random_arc_selection_typ, __pyx_k_Unknown_random_arc_selection_typ, sizeof(__pyx_k_Unknown_random_arc_selection_typ), 0, 0, 1, 0},\n  {&__pyx_kp_s_Unknown_replace_label_type_r, __pyx_k_Unknown_replace_label_type_r, sizeof(__pyx_k_Unknown_replace_label_type_r), 0, 0, 1, 0},\n  {&__pyx_kp_s_Unknown_sort_type_r, __pyx_k_Unknown_sort_type_r, sizeof(__pyx_k_Unknown_sort_type_r), 0, 0, 1, 0},\n  {&__pyx_n_s_ValueError, __pyx_k_ValueError, sizeof(__pyx_k_ValueError), 0, 0, 1, 1},\n  {&__pyx_n_s_WEIGHTED, __pyx_k_WEIGHTED, sizeof(__pyx_k_WEIGHTED), 0, 0, 1, 1},\n  {&__pyx_n_s_WEIGHTED_CYCLES, __pyx_k_WEIGHTED_CYCLES, sizeof(__pyx_k_WEIGHTED_CYCLES), 0, 0, 1, 1},\n  {&__pyx_n_s_WEIGHT_INVARIANT_PROPERTIES, __pyx_k_WEIGHT_INVARIANT_PROPERTIES, sizeof(__pyx_k_WEIGHT_INVARIANT_PROPERTIES), 0, 0, 1, 1},\n  {&__pyx_kp_s_Weight_at_0x_x, __pyx_k_Weight_at_0x_x, sizeof(__pyx_k_Weight_at_0x_x), 0, 0, 1, 0},\n  {&__pyx_kp_s_Weight_type_not_found, __pyx_k_Weight_type_not_found, sizeof(__pyx_k_Weight_type_not_found), 0, 0, 1, 0},\n  {&__pyx_kp_s_Write_failed_r, __pyx_k_Write_failed_r, sizeof(__pyx_k_Write_failed_r), 0, 0, 1, 0},\n  {&__pyx_kp_s_Write_to_string_failed, __pyx_k_Write_to_string_failed, sizeof(__pyx_k_Write_to_string_failed), 0, 0, 1, 0},\n  {&__pyx_n_s_Zero, __pyx_k_Zero, sizeof(__pyx_k_Zero), 0, 0, 1, 1},\n  {&__pyx_kp_b__24, __pyx_k__24, sizeof(__pyx_k__24), 0, 0, 0, 0},\n  {&__pyx_n_s_acceptor, __pyx_k_acceptor, sizeof(__pyx_k_acceptor), 0, 0, 1, 1},\n  {&__pyx_n_s_add, __pyx_k_add, sizeof(__pyx_k_add), 0, 0, 1, 1},\n  {&__pyx_n_s_add_state, __pyx_k_add_state, sizeof(__pyx_k_add_state), 0, 0, 1, 1},\n  {&__pyx_n_s_add_symbol, __pyx_k_add_symbol, sizeof(__pyx_k_add_symbol), 0, 0, 1, 1},\n  {&__pyx_n_s_add_table, __pyx_k_add_table, sizeof(__pyx_k_add_table), 0, 0, 1, 1},\n  {&__pyx_n_s_allow_negative_labels, __pyx_k_allow_negative_labels, sizeof(__pyx_k_allow_negative_labels), 0, 0, 1, 1},\n  {&__pyx_n_s_allow_nondet, __pyx_k_allow_nondet, sizeof(__pyx_k_allow_nondet), 0, 0, 1, 1},\n  {&__pyx_n_s_arc, __pyx_k_arc, sizeof(__pyx_k_arc), 0, 0, 1, 1},\n  {&__pyx_n_s_arc_type, __pyx_k_arc_type, sizeof(__pyx_k_arc_type), 0, 0, 1, 1},\n  {&__pyx_n_s_arcs, __pyx_k_arcs, sizeof(__pyx_k_arcs), 0, 0, 1, 1},\n  {&__pyx_n_s_atexit, __pyx_k_atexit, sizeof(__pyx_k_atexit), 0, 0, 1, 1},\n  {&__pyx_n_s_attach_new_isymbols, __pyx_k_attach_new_isymbols, sizeof(__pyx_k_attach_new_isymbols), 0, 0, 1, 1},\n  {&__pyx_n_s_attach_new_osymbols, __pyx_k_attach_new_osymbols, sizeof(__pyx_k_attach_new_osymbols), 0, 0, 1, 1},\n  {&__pyx_n_b_auto, __pyx_k_auto, sizeof(__pyx_k_auto), 0, 0, 0, 1},\n  {&__pyx_n_s_available_key, __pyx_k_available_key, sizeof(__pyx_k_available_key), 0, 0, 1, 1},\n  {&__pyx_n_s_call_arc_labeling, __pyx_k_call_arc_labeling, sizeof(__pyx_k_call_arc_labeling), 0, 0, 1, 1},\n  {&__pyx_n_s_checksum, __pyx_k_checksum, sizeof(__pyx_k_checksum), 0, 0, 1, 1},\n  {&__pyx_n_s_class, __pyx_k_class, sizeof(__pyx_k_class), 0, 0, 1, 1},\n  {&__pyx_n_s_cline_in_traceback, __pyx_k_cline_in_traceback, sizeof(__pyx_k_cline_in_traceback), 0, 0, 1, 1},\n  {&__pyx_n_s_closure_plus, __pyx_k_closure_plus, sizeof(__pyx_k_closure_plus), 0, 0, 1, 1},\n  {&__pyx_n_s_cls, __pyx_k_cls, sizeof(__pyx_k_cls), 0, 0, 1, 1},\n  {&__pyx_n_s_communicate, __pyx_k_communicate, sizeof(__pyx_k_communicate), 0, 0, 1, 1},\n  {&__pyx_n_s_compile, __pyx_k_compile, sizeof(__pyx_k_compile), 0, 0, 1, 1},\n  {&__pyx_n_s_compose_filter, __pyx_k_compose_filter, sizeof(__pyx_k_compose_filter), 0, 0, 1, 1},\n  {&__pyx_n_s_connect, __pyx_k_connect, sizeof(__pyx_k_connect), 0, 0, 1, 1},\n  {&__pyx_kp_s_const_EncodeMapper_SymbolTable, __pyx_k_const_EncodeMapper_SymbolTable, sizeof(__pyx_k_const_EncodeMapper_SymbolTable), 0, 0, 1, 0},\n  {&__pyx_kp_s_const_Fst_SymbolTable_r_at_0x_x, __pyx_k_const_Fst_SymbolTable_r_at_0x_x, sizeof(__pyx_k_const_Fst_SymbolTable_r_at_0x_x), 0, 0, 1, 0},\n  {&__pyx_n_s_copy, __pyx_k_copy, sizeof(__pyx_k_copy), 0, 0, 1, 1},\n  {&__pyx_n_s_create, __pyx_k_create, sizeof(__pyx_k_create), 0, 0, 1, 1},\n  {&__pyx_n_s_decode, __pyx_k_decode, sizeof(__pyx_k_decode), 0, 0, 1, 1},\n  {&__pyx_n_b_default, __pyx_k_default, sizeof(__pyx_k_default), 0, 0, 0, 1},\n  {&__pyx_n_s_delta, __pyx_k_delta, sizeof(__pyx_k_delta), 0, 0, 1, 1},\n  {&__pyx_n_s_det_type, __pyx_k_det_type, sizeof(__pyx_k_det_type), 0, 0, 1, 1},\n  {&__pyx_n_s_distance, __pyx_k_distance, sizeof(__pyx_k_distance), 0, 0, 1, 1},\n  {&__pyx_n_s_divide, __pyx_k_divide, sizeof(__pyx_k_divide), 0, 0, 1, 1},\n  {&__pyx_n_s_doc, __pyx_k_doc, sizeof(__pyx_k_doc), 0, 0, 1, 1},\n  {&__pyx_n_s_done, __pyx_k_done, sizeof(__pyx_k_done), 0, 0, 1, 1},\n  {&__pyx_n_s_dot, __pyx_k_dot, sizeof(__pyx_k_dot), 0, 0, 1, 1},\n  {&__pyx_n_s_draw, __pyx_k_draw, sizeof(__pyx_k_draw), 0, 0, 1, 1},\n  {&__pyx_n_s_encode, __pyx_k_encode, sizeof(__pyx_k_encode), 0, 0, 1, 1},\n  {&__pyx_n_s_encode_labels, __pyx_k_encode_labels, sizeof(__pyx_k_encode_labels), 0, 0, 1, 1},\n  {&__pyx_n_s_encode_weights, __pyx_k_encode_weights, sizeof(__pyx_k_encode_weights), 0, 0, 1, 1},\n  {&__pyx_n_s_eps_norm_output, __pyx_k_eps_norm_output, sizeof(__pyx_k_eps_norm_output), 0, 0, 1, 1},\n  {&__pyx_n_s_epsilon_on_replace, __pyx_k_epsilon_on_replace, sizeof(__pyx_k_epsilon_on_replace), 0, 0, 1, 1},\n  {&__pyx_n_s_error, __pyx_k_error, sizeof(__pyx_k_error), 0, 0, 1, 1},\n  {&__pyx_n_s_far_type, __pyx_k_far_type, sizeof(__pyx_k_far_type), 0, 0, 1, 1},\n  {&__pyx_n_s_filename, __pyx_k_filename, sizeof(__pyx_k_filename), 0, 0, 1, 1},\n  {&__pyx_n_s_final, __pyx_k_final, sizeof(__pyx_k_final), 0, 0, 1, 1},\n  {&__pyx_n_s_find, __pyx_k_find, sizeof(__pyx_k_find), 0, 0, 1, 1},\n  {&__pyx_n_s_flags, __pyx_k_flags, sizeof(__pyx_k_flags), 0, 0, 1, 1},\n  {&__pyx_n_s_float_format, __pyx_k_float_format, sizeof(__pyx_k_float_format), 0, 0, 1, 1},\n  {&__pyx_n_s_fontsize, __pyx_k_fontsize, sizeof(__pyx_k_fontsize), 0, 0, 1, 1},\n  {&__pyx_n_s_format, __pyx_k_format, sizeof(__pyx_k_format), 0, 0, 1, 1},\n  {&__pyx_n_s_fst_error_fatal_old, __pyx_k_fst_error_fatal_old, sizeof(__pyx_k_fst_error_fatal_old), 0, 0, 1, 1},\n  {&__pyx_n_s_fst_type, __pyx_k_fst_type, sizeof(__pyx_k_fst_type), 0, 0, 1, 1},\n  {&__pyx_n_b_functional, __pyx_k_functional, sizeof(__pyx_k_functional), 0, 0, 0, 1},\n  {&__pyx_n_b_g, __pyx_k_g, sizeof(__pyx_k_g), 0, 0, 0, 1},\n  {&__pyx_n_s_get_fst, __pyx_k_get_fst, sizeof(__pyx_k_get_fst), 0, 0, 1, 1},\n  {&__pyx_n_s_get_key, __pyx_k_get_key, sizeof(__pyx_k_get_key), 0, 0, 1, 1},\n  {&__pyx_n_s_get_nth_key, __pyx_k_get_nth_key, sizeof(__pyx_k_get_nth_key), 0, 0, 1, 1},\n  {&__pyx_n_s_getstate, __pyx_k_getstate, sizeof(__pyx_k_getstate), 0, 0, 1, 1},\n  {&__pyx_n_s_height, __pyx_k_height, sizeof(__pyx_k_height), 0, 0, 1, 1},\n  {&__pyx_n_s_id, __pyx_k_id, sizeof(__pyx_k_id), 0, 0, 1, 1},\n  {&__pyx_n_b_identity, __pyx_k_identity, sizeof(__pyx_k_identity), 0, 0, 0, 1},\n  {&__pyx_n_s_ifst, __pyx_k_ifst, sizeof(__pyx_k_ifst), 0, 0, 1, 1},\n  {&__pyx_n_s_ifst1, __pyx_k_ifst1, sizeof(__pyx_k_ifst1), 0, 0, 1, 1},\n  {&__pyx_n_s_ifst2, __pyx_k_ifst2, sizeof(__pyx_k_ifst2), 0, 0, 1, 1},\n  {&__pyx_n_b_ilabel, __pyx_k_ilabel, sizeof(__pyx_k_ilabel), 0, 0, 0, 1},\n  {&__pyx_n_s_ilabel, __pyx_k_ilabel, sizeof(__pyx_k_ilabel), 0, 0, 1, 1},\n  {&__pyx_n_s_import, __pyx_k_import, sizeof(__pyx_k_import), 0, 0, 1, 1},\n  {&__pyx_n_s_increment_subsequential_label, __pyx_k_increment_subsequential_label, sizeof(__pyx_k_increment_subsequential_label), 0, 0, 1, 1},\n  {&__pyx_n_b_input, __pyx_k_input, sizeof(__pyx_k_input), 0, 0, 0, 1},\n  {&__pyx_n_s_input_symbols, __pyx_k_input_symbols, sizeof(__pyx_k_input_symbols), 0, 0, 1, 1},\n  {&__pyx_n_s_input_table, __pyx_k_input_table, sizeof(__pyx_k_input_table), 0, 0, 1, 1},\n  {&__pyx_n_s_ipairs, __pyx_k_ipairs, sizeof(__pyx_k_ipairs), 0, 0, 1, 1},\n  {&__pyx_n_s_isymbols, __pyx_k_isymbols, sizeof(__pyx_k_isymbols), 0, 0, 1, 1},\n  {&__pyx_n_s_kNoSymbol, __pyx_k_kNoSymbol, sizeof(__pyx_k_kNoSymbol), 0, 0, 1, 1},\n  {&__pyx_n_s_keep_isymbols, __pyx_k_keep_isymbols, sizeof(__pyx_k_keep_isymbols), 0, 0, 1, 1},\n  {&__pyx_n_s_keep_osymbols, __pyx_k_keep_osymbols, sizeof(__pyx_k_keep_osymbols), 0, 0, 1, 1},\n  {&__pyx_n_s_keep_state_numbering, __pyx_k_keep_state_numbering, sizeof(__pyx_k_keep_state_numbering), 0, 0, 1, 1},\n  {&__pyx_n_s_key, __pyx_k_key, sizeof(__pyx_k_key), 0, 0, 1, 1},\n  {&__pyx_n_s_labeled_checksum, __pyx_k_labeled_checksum, sizeof(__pyx_k_labeled_checksum), 0, 0, 1, 1},\n  {&__pyx_n_s_lhs, __pyx_k_lhs, sizeof(__pyx_k_lhs), 0, 0, 1, 1},\n  {&__pyx_n_s_logging, __pyx_k_logging, sizeof(__pyx_k_logging), 0, 0, 1, 1},\n  {&__pyx_n_s_main, __pyx_k_main, sizeof(__pyx_k_main), 0, 0, 1, 1},\n  {&__pyx_n_s_map_type, __pyx_k_map_type, sizeof(__pyx_k_map_type), 0, 0, 1, 1},\n  {&__pyx_n_s_mask, __pyx_k_mask, sizeof(__pyx_k_mask), 0, 0, 1, 1},\n  {&__pyx_n_s_max_length, __pyx_k_max_length, sizeof(__pyx_k_max_length), 0, 0, 1, 1},\n  {&__pyx_n_s_member, __pyx_k_member, sizeof(__pyx_k_member), 0, 0, 1, 1},\n  {&__pyx_n_s_metaclass, __pyx_k_metaclass, sizeof(__pyx_k_metaclass), 0, 0, 1, 1},\n  {&__pyx_n_s_missing_sym, __pyx_k_missing_sym, sizeof(__pyx_k_missing_sym), 0, 0, 1, 1},\n  {&__pyx_n_s_module, __pyx_k_module, sizeof(__pyx_k_module), 0, 0, 1, 1},\n  {&__pyx_n_s_mutable_arcs, __pyx_k_mutable_arcs, sizeof(__pyx_k_mutable_arcs), 0, 0, 1, 1},\n  {&__pyx_n_s_n, __pyx_k_n, sizeof(__pyx_k_n), 0, 0, 1, 1},\n  {&__pyx_n_s_name, __pyx_k_name, sizeof(__pyx_k_name), 0, 0, 1, 1},\n  {&__pyx_n_s_name_2, __pyx_k_name_2, sizeof(__pyx_k_name_2), 0, 0, 1, 1},\n  {&__pyx_n_b_neither, __pyx_k_neither, sizeof(__pyx_k_neither), 0, 0, 0, 1},\n  {&__pyx_n_s_new, __pyx_k_new, sizeof(__pyx_k_new), 0, 0, 1, 1},\n  {&__pyx_n_s_new_isymbols, __pyx_k_new_isymbols, sizeof(__pyx_k_new_isymbols), 0, 0, 1, 1},\n  {&__pyx_n_s_new_osymbols, __pyx_k_new_osymbols, sizeof(__pyx_k_new_osymbols), 0, 0, 1, 1},\n  {&__pyx_n_s_next, __pyx_k_next, sizeof(__pyx_k_next), 0, 0, 1, 1},\n  {&__pyx_n_s_nextstate, __pyx_k_nextstate, sizeof(__pyx_k_nextstate), 0, 0, 1, 1},\n  {&__pyx_kp_s_no_default___reduce___due_to_non, __pyx_k_no_default___reduce___due_to_non, sizeof(__pyx_k_no_default___reduce___due_to_non), 0, 0, 1, 0},\n  {&__pyx_n_s_nodesep, __pyx_k_nodesep, sizeof(__pyx_k_nodesep), 0, 0, 1, 1},\n  {&__pyx_n_s_npath, __pyx_k_npath, sizeof(__pyx_k_npath), 0, 0, 1, 1},\n  {&__pyx_n_s_nshortest, __pyx_k_nshortest, sizeof(__pyx_k_nshortest), 0, 0, 1, 1},\n  {&__pyx_n_s_nstate, __pyx_k_nstate, sizeof(__pyx_k_nstate), 0, 0, 1, 1},\n  {&__pyx_n_s_num_arcs, __pyx_k_num_arcs, sizeof(__pyx_k_num_arcs), 0, 0, 1, 1},\n  {&__pyx_n_s_num_input_epsilons, __pyx_k_num_input_epsilons, sizeof(__pyx_k_num_input_epsilons), 0, 0, 1, 1},\n  {&__pyx_n_s_num_output_epsilons, __pyx_k_num_output_epsilons, sizeof(__pyx_k_num_output_epsilons), 0, 0, 1, 1},\n  {&__pyx_n_s_num_states, __pyx_k_num_states, sizeof(__pyx_k_num_states), 0, 0, 1, 1},\n  {&__pyx_n_s_num_symbols, __pyx_k_num_symbols, sizeof(__pyx_k_num_symbols), 0, 0, 1, 1},\n  {&__pyx_n_s_numbers, __pyx_k_numbers, sizeof(__pyx_k_numbers), 0, 0, 1, 1},\n  {&__pyx_n_s_object, __pyx_k_object, sizeof(__pyx_k_object), 0, 0, 1, 1},\n  {&__pyx_n_s_olabel, __pyx_k_olabel, sizeof(__pyx_k_olabel), 0, 0, 1, 1},\n  {&__pyx_n_s_old_isymbols, __pyx_k_old_isymbols, sizeof(__pyx_k_old_isymbols), 0, 0, 1, 1},\n  {&__pyx_n_s_old_osymbols, __pyx_k_old_osymbols, sizeof(__pyx_k_old_osymbols), 0, 0, 1, 1},\n  {&__pyx_n_s_opairs, __pyx_k_opairs, sizeof(__pyx_k_opairs), 0, 0, 1, 1},\n  {&__pyx_n_s_open, __pyx_k_open, sizeof(__pyx_k_open), 0, 0, 1, 1},\n  {&__pyx_n_s_osymbols, __pyx_k_osymbols, sizeof(__pyx_k_osymbols), 0, 0, 1, 1},\n  {&__pyx_n_s_output_symbols, __pyx_k_output_symbols, sizeof(__pyx_k_output_symbols), 0, 0, 1, 1},\n  {&__pyx_n_s_pairs, __pyx_k_pairs, sizeof(__pyx_k_pairs), 0, 0, 1, 1},\n  {&__pyx_n_s_plus, __pyx_k_plus, sizeof(__pyx_k_plus), 0, 0, 1, 1},\n  {&__pyx_n_s_portrait, __pyx_k_portrait, sizeof(__pyx_k_portrait), 0, 0, 1, 1},\n  {&__pyx_n_s_position, __pyx_k_position, sizeof(__pyx_k_position), 0, 0, 1, 1},\n  {&__pyx_n_s_potentials, __pyx_k_potentials, sizeof(__pyx_k_potentials), 0, 0, 1, 1},\n  {&__pyx_n_s_power, __pyx_k_power, sizeof(__pyx_k_power), 0, 0, 1, 1},\n  {&__pyx_n_s_precision, __pyx_k_precision, sizeof(__pyx_k_precision), 0, 0, 1, 1},\n  {&__pyx_n_s_prepare, __pyx_k_prepare, sizeof(__pyx_k_prepare), 0, 0, 1, 1},\n  {&__pyx_n_s_project_output, __pyx_k_project_output, sizeof(__pyx_k_project_output), 0, 0, 1, 1},\n  {&__pyx_n_s_properties, __pyx_k_properties, sizeof(__pyx_k_properties), 0, 0, 1, 1},\n  {&__pyx_n_s_props, __pyx_k_props, sizeof(__pyx_k_props), 0, 0, 1, 1},\n  {&__pyx_n_s_push_labels, __pyx_k_push_labels, sizeof(__pyx_k_push_labels), 0, 0, 1, 1},\n  {&__pyx_n_s_push_weights, __pyx_k_push_weights, sizeof(__pyx_k_push_weights), 0, 0, 1, 1},\n  {&__pyx_kp_b_pywrapfst, __pyx_k_pywrapfst, sizeof(__pyx_k_pywrapfst), 0, 0, 0, 0},\n  {&__pyx_n_s_pywrapfst_2, __pyx_k_pywrapfst_2, sizeof(__pyx_k_pywrapfst_2), 0, 0, 1, 1},\n  {&__pyx_kp_s_pywrapfst_pyx, __pyx_k_pywrapfst_pyx, sizeof(__pyx_k_pywrapfst_pyx), 0, 0, 1, 0},\n  {&__pyx_n_s_pyx_vtable, __pyx_k_pyx_vtable, sizeof(__pyx_k_pyx_vtable), 0, 0, 1, 1},\n  {&__pyx_n_s_qualname, __pyx_k_qualname, sizeof(__pyx_k_qualname), 0, 0, 1, 1},\n  {&__pyx_n_s_queue_type, __pyx_k_queue_type, sizeof(__pyx_k_queue_type), 0, 0, 1, 1},\n  {&__pyx_n_s_ranksep, __pyx_k_ranksep, sizeof(__pyx_k_ranksep), 0, 0, 1, 1},\n  {&__pyx_n_s_read, __pyx_k_read, sizeof(__pyx_k_read), 0, 0, 1, 1},\n  {&__pyx_n_s_read_from_string, __pyx_k_read_from_string, sizeof(__pyx_k_read_from_string), 0, 0, 1, 1},\n  {&__pyx_n_s_read_from_string_2, __pyx_k_read_from_string_2, sizeof(__pyx_k_read_from_string_2), 0, 0, 1, 1},\n  {&__pyx_n_s_read_fst, __pyx_k_read_fst, sizeof(__pyx_k_read_fst), 0, 0, 1, 1},\n  {&__pyx_n_s_read_text, __pyx_k_read_text, sizeof(__pyx_k_read_text), 0, 0, 1, 1},\n  {&__pyx_n_s_reduce, __pyx_k_reduce, sizeof(__pyx_k_reduce), 0, 0, 1, 1},\n  {&__pyx_n_s_reduce_cython, __pyx_k_reduce_cython, sizeof(__pyx_k_reduce_cython), 0, 0, 1, 1},\n  {&__pyx_n_s_reduce_ex, __pyx_k_reduce_ex, sizeof(__pyx_k_reduce_ex), 0, 0, 1, 1},\n  {&__pyx_n_s_register, __pyx_k_register, sizeof(__pyx_k_register), 0, 0, 1, 1},\n  {&__pyx_n_s_remove_common_affix, __pyx_k_remove_common_affix, sizeof(__pyx_k_remove_common_affix), 0, 0, 1, 1},\n  {&__pyx_n_s_remove_total_weight, __pyx_k_remove_total_weight, sizeof(__pyx_k_remove_total_weight), 0, 0, 1, 1},\n  {&__pyx_n_b_repr_svg, __pyx_k_repr_svg, sizeof(__pyx_k_repr_svg), 0, 0, 0, 1},\n  {&__pyx_n_s_require_superinitial, __pyx_k_require_superinitial, sizeof(__pyx_k_require_superinitial), 0, 0, 1, 1},\n  {&__pyx_n_s_reset, __pyx_k_reset, sizeof(__pyx_k_reset), 0, 0, 1, 1},\n  {&__pyx_n_s_reset_fst_error_fatal, __pyx_k_reset_fst_error_fatal, sizeof(__pyx_k_reset_fst_error_fatal), 0, 0, 1, 1},\n  {&__pyx_n_s_result, __pyx_k_result, sizeof(__pyx_k_result), 0, 0, 1, 1},\n  {&__pyx_n_s_return_arc_labeling, __pyx_k_return_arc_labeling, sizeof(__pyx_k_return_arc_labeling), 0, 0, 1, 1},\n  {&__pyx_n_s_return_label, __pyx_k_return_label, sizeof(__pyx_k_return_label), 0, 0, 1, 1},\n  {&__pyx_n_s_returncode, __pyx_k_returncode, sizeof(__pyx_k_returncode), 0, 0, 1, 1},\n  {&__pyx_n_s_reverse, __pyx_k_reverse, sizeof(__pyx_k_reverse), 0, 0, 1, 1},\n  {&__pyx_n_s_rhs, __pyx_k_rhs, sizeof(__pyx_k_rhs), 0, 0, 1, 1},\n  {&__pyx_n_s_seed, __pyx_k_seed, sizeof(__pyx_k_seed), 0, 0, 1, 1},\n  {&__pyx_n_s_seek, __pyx_k_seek, sizeof(__pyx_k_seek), 0, 0, 1, 1},\n  {&__pyx_n_s_select, __pyx_k_select, sizeof(__pyx_k_select), 0, 0, 1, 1},\n  {&__pyx_kp_s_self__aiter_self__fst_cannot_be, __pyx_k_self__aiter_self__fst_cannot_be, sizeof(__pyx_k_self__aiter_self__fst_cannot_be), 0, 0, 1, 0},\n  {&__pyx_kp_s_self__aiter_self__mfst_cannot_be, __pyx_k_self__aiter_self__mfst_cannot_be, sizeof(__pyx_k_self__aiter_self__mfst_cannot_be), 0, 0, 1, 0},\n  {&__pyx_kp_s_self__arc_cannot_be_converted_to, __pyx_k_self__arc_cannot_be_converted_to, sizeof(__pyx_k_self__arc_cannot_be_converted_to), 0, 0, 1, 0},\n  {&__pyx_kp_s_self__encoder_cannot_be_converte, __pyx_k_self__encoder_cannot_be_converte, sizeof(__pyx_k_self__encoder_cannot_be_converte), 0, 0, 1, 0},\n  {&__pyx_kp_s_self__encoder_self__table_cannot, __pyx_k_self__encoder_self__table_cannot, sizeof(__pyx_k_self__encoder_self__table_cannot), 0, 0, 1, 0},\n  {&__pyx_kp_s_self__fst_self__siter_cannot_be, __pyx_k_self__fst_self__siter_cannot_be, sizeof(__pyx_k_self__fst_self__siter_cannot_be), 0, 0, 1, 0},\n  {&__pyx_kp_s_self__fst_self__table_cannot_be, __pyx_k_self__fst_self__table_cannot_be, sizeof(__pyx_k_self__fst_self__table_cannot_be), 0, 0, 1, 0},\n  {&__pyx_kp_s_self__mfst_self__table_cannot_be, __pyx_k_self__mfst_self__table_cannot_be, sizeof(__pyx_k_self__mfst_self__table_cannot_be), 0, 0, 1, 0},\n  {&__pyx_kp_s_self__reader_cannot_be_converted, __pyx_k_self__reader_cannot_be_converted, sizeof(__pyx_k_self__reader_cannot_be_converted), 0, 0, 1, 0},\n  {&__pyx_kp_s_self__siter_self__table_cannot_b, __pyx_k_self__siter_self__table_cannot_b, sizeof(__pyx_k_self__siter_self__table_cannot_b), 0, 0, 1, 0},\n  {&__pyx_kp_s_self__smart_table_self__table_ca, __pyx_k_self__smart_table_self__table_ca, sizeof(__pyx_k_self__smart_table_self__table_ca), 0, 0, 1, 0},\n  {&__pyx_kp_s_self__table_cannot_be_converted, __pyx_k_self__table_cannot_be_converted, sizeof(__pyx_k_self__table_cannot_be_converted), 0, 0, 1, 0},\n  {&__pyx_kp_s_self__weight_cannot_be_converted, __pyx_k_self__weight_cannot_be_converted, sizeof(__pyx_k_self__weight_cannot_be_converted), 0, 0, 1, 0},\n  {&__pyx_kp_s_self__writer_cannot_be_converted, __pyx_k_self__writer_cannot_be_converted, sizeof(__pyx_k_self__writer_cannot_be_converted), 0, 0, 1, 0},\n  {&__pyx_n_s_set_flags, __pyx_k_set_flags, sizeof(__pyx_k_set_flags), 0, 0, 1, 1},\n  {&__pyx_n_s_set_input_symbols, __pyx_k_set_input_symbols, sizeof(__pyx_k_set_input_symbols), 0, 0, 1, 1},\n  {&__pyx_n_s_set_name, __pyx_k_set_name, sizeof(__pyx_k_set_name), 0, 0, 1, 1},\n  {&__pyx_n_s_set_output_symbols, __pyx_k_set_output_symbols, sizeof(__pyx_k_set_output_symbols), 0, 0, 1, 1},\n  {&__pyx_n_s_set_value, __pyx_k_set_value, sizeof(__pyx_k_set_value), 0, 0, 1, 1},\n  {&__pyx_n_s_setstate, __pyx_k_setstate, sizeof(__pyx_k_setstate), 0, 0, 1, 1},\n  {&__pyx_n_s_setstate_cython, __pyx_k_setstate_cython, sizeof(__pyx_k_setstate_cython), 0, 0, 1, 1},\n  {&__pyx_n_s_shortestdistance, __pyx_k_shortestdistance, sizeof(__pyx_k_shortestdistance), 0, 0, 1, 1},\n  {&__pyx_n_s_show_weight_one, __pyx_k_show_weight_one, sizeof(__pyx_k_show_weight_one), 0, 0, 1, 1},\n  {&__pyx_n_s_sort_type, __pyx_k_sort_type, sizeof(__pyx_k_sort_type), 0, 0, 1, 1},\n  {&__pyx_n_s_ssymbols, __pyx_k_ssymbols, sizeof(__pyx_k_ssymbols), 0, 0, 1, 1},\n  {&__pyx_n_b_standard, __pyx_k_standard, sizeof(__pyx_k_standard), 0, 0, 0, 1},\n  {&__pyx_n_s_start, __pyx_k_start, sizeof(__pyx_k_start), 0, 0, 1, 1},\n  {&__pyx_n_s_state, __pyx_k_state, sizeof(__pyx_k_state), 0, 0, 1, 1},\n  {&__pyx_n_s_states, __pyx_k_states, sizeof(__pyx_k_states), 0, 0, 1, 1},\n  {&__pyx_n_s_staticmethod, __pyx_k_staticmethod, sizeof(__pyx_k_staticmethod), 0, 0, 1, 1},\n  {&__pyx_n_s_stderr, __pyx_k_stderr, sizeof(__pyx_k_stderr), 0, 0, 1, 1},\n  {&__pyx_n_s_stdin, __pyx_k_stdin, sizeof(__pyx_k_stdin), 0, 0, 1, 1},\n  {&__pyx_n_s_stdout, __pyx_k_stdout, sizeof(__pyx_k_stdout), 0, 0, 1, 1},\n  {&__pyx_n_s_subprocess, __pyx_k_subprocess, sizeof(__pyx_k_subprocess), 0, 0, 1, 1},\n  {&__pyx_n_s_subsequential_label, __pyx_k_subsequential_label, sizeof(__pyx_k_subsequential_label), 0, 0, 1, 1},\n  {&__pyx_n_s_symbol, __pyx_k_symbol, sizeof(__pyx_k_symbol), 0, 0, 1, 1},\n  {&__pyx_n_s_syms, __pyx_k_syms, sizeof(__pyx_k_syms), 0, 0, 1, 1},\n  {&__pyx_n_s_test, __pyx_k_test, sizeof(__pyx_k_test), 0, 0, 1, 1},\n  {&__pyx_n_s_test_2, __pyx_k_test_2, sizeof(__pyx_k_test_2), 0, 0, 1, 1},\n  {&__pyx_n_s_text, __pyx_k_text, sizeof(__pyx_k_text), 0, 0, 1, 1},\n  {&__pyx_n_s_times, __pyx_k_times, sizeof(__pyx_k_times), 0, 0, 1, 1},\n  {&__pyx_n_s_title, __pyx_k_title, sizeof(__pyx_k_title), 0, 0, 1, 1},\n  {&__pyx_n_s_to_final, __pyx_k_to_final, sizeof(__pyx_k_to_final), 0, 0, 1, 1},\n  {&__pyx_n_s_to_string, __pyx_k_to_string, sizeof(__pyx_k_to_string), 0, 0, 1, 1},\n  {&__pyx_n_b_tropical, __pyx_k_tropical, sizeof(__pyx_k_tropical), 0, 0, 0, 1},\n  {&__pyx_n_s_type, __pyx_k_type, sizeof(__pyx_k_type), 0, 0, 1, 1},\n  {&__pyx_n_b_uniform, __pyx_k_uniform, sizeof(__pyx_k_uniform), 0, 0, 0, 1},\n  {&__pyx_n_s_unique, __pyx_k_unique, sizeof(__pyx_k_unique), 0, 0, 1, 1},\n  {&__pyx_n_s_unknown_isymbol, __pyx_k_unknown_isymbol, sizeof(__pyx_k_unknown_isymbol), 0, 0, 1, 1},\n  {&__pyx_n_s_unknown_osymbol, __pyx_k_unknown_osymbol, sizeof(__pyx_k_unknown_osymbol), 0, 0, 1, 1},\n  {&__pyx_kp_b_unspecified, __pyx_k_unspecified, sizeof(__pyx_k_unspecified), 0, 0, 0, 0},\n  {&__pyx_n_s_utf8, __pyx_k_utf8, sizeof(__pyx_k_utf8), 0, 0, 1, 1},\n  {&__pyx_n_s_value, __pyx_k_value, sizeof(__pyx_k_value), 0, 0, 1, 1},\n  {&__pyx_n_b_vector, __pyx_k_vector, sizeof(__pyx_k_vector), 0, 0, 0, 1},\n  {&__pyx_n_s_verify, __pyx_k_verify, sizeof(__pyx_k_verify), 0, 0, 1, 1},\n  {&__pyx_n_s_vertical, __pyx_k_vertical, sizeof(__pyx_k_vertical), 0, 0, 1, 1},\n  {&__pyx_n_s_w, __pyx_k_w, sizeof(__pyx_k_w), 0, 0, 1, 1},\n  {&__pyx_n_s_warning, __pyx_k_warning, sizeof(__pyx_k_warning), 0, 0, 1, 1},\n  {&__pyx_n_s_weight, __pyx_k_weight, sizeof(__pyx_k_weight), 0, 0, 1, 1},\n  {&__pyx_n_s_weight_type, __pyx_k_weight_type, sizeof(__pyx_k_weight_type), 0, 0, 1, 1},\n  {&__pyx_n_s_weighted, __pyx_k_weighted, sizeof(__pyx_k_weighted), 0, 0, 1, 1},\n  {&__pyx_n_s_width, __pyx_k_width, sizeof(__pyx_k_width), 0, 0, 1, 1},\n  {&__pyx_n_s_write, __pyx_k_write, sizeof(__pyx_k_write), 0, 0, 1, 1},\n  {&__pyx_n_s_write_text, __pyx_k_write_text, sizeof(__pyx_k_write_text), 0, 0, 1, 1},\n  {&__pyx_n_b_write_to_string, __pyx_k_write_to_string, sizeof(__pyx_k_write_to_string), 0, 0, 0, 1},\n  {&__pyx_n_s_write_to_string, __pyx_k_write_to_string, sizeof(__pyx_k_write_to_string), 0, 0, 1, 1},\n  {0, 0, 0, 0, 0, 0, 0}\n};\nstatic int __Pyx_InitCachedBuiltins(void) {\n  __pyx_builtin_ValueError = __Pyx_GetBuiltinName(__pyx_n_s_ValueError); if (!__pyx_builtin_ValueError) __PYX_ERR(0, 126, __pyx_L1_error)\n  __pyx_builtin_RuntimeError = __Pyx_GetBuiltinName(__pyx_n_s_RuntimeError); if (!__pyx_builtin_RuntimeError) __PYX_ERR(0, 136, __pyx_L1_error)\n  __pyx_builtin_IndexError = __Pyx_GetBuiltinName(__pyx_n_s_IndexError); if (!__pyx_builtin_IndexError) __PYX_ERR(0, 141, __pyx_L1_error)\n  __pyx_builtin_IOError = __Pyx_GetBuiltinName(__pyx_n_s_IOError); if (!__pyx_builtin_IOError) __PYX_ERR(0, 146, __pyx_L1_error)\n  __pyx_builtin_object = __Pyx_GetBuiltinName(__pyx_n_s_object); if (!__pyx_builtin_object) __PYX_ERR(0, 2742, __pyx_L1_error)\n  __pyx_builtin_staticmethod = __Pyx_GetBuiltinName(__pyx_n_s_staticmethod); if (!__pyx_builtin_staticmethod) __PYX_ERR(0, 2762, __pyx_L1_error)\n  __pyx_builtin_id = __Pyx_GetBuiltinName(__pyx_n_s_id); if (!__pyx_builtin_id) __PYX_ERR(0, 370, __pyx_L1_error)\n  __pyx_builtin_TypeError = __Pyx_GetBuiltinName(__pyx_n_s_TypeError); if (!__pyx_builtin_TypeError) __PYX_ERR(1, 2, __pyx_L1_error)\n  __pyx_builtin_StopIteration = __Pyx_GetBuiltinName(__pyx_n_s_StopIteration); if (!__pyx_builtin_StopIteration) __PYX_ERR(0, 1145, __pyx_L1_error)\n  __pyx_builtin_KeyError = __Pyx_GetBuiltinName(__pyx_n_s_KeyError); if (!__pyx_builtin_KeyError) __PYX_ERR(0, 4357, __pyx_L1_error)\n  return 0;\n  __pyx_L1_error:;\n  return -1;\n}\n\nstatic int __Pyx_InitCachedConstants(void) {\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__Pyx_InitCachedConstants\", 0);\n\n  /* \"pywrapfst.pyx\":388\n *   cdef void _check_weight(self) except *:\n *     if self.type() == b\"none\":\n *       raise FstArgError(\"Weight type not found\")             # <<<<<<<<<<<<<<\n *     if self.to_string() == b\"BadNumber\":\n *       raise FstBadWeightError(\"Invalid weight\")\n */\n  __pyx_tuple_ = PyTuple_Pack(1, __pyx_kp_s_Weight_type_not_found); if (unlikely(!__pyx_tuple_)) __PYX_ERR(0, 388, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple_);\n  __Pyx_GIVEREF(__pyx_tuple_);\n\n  /* \"pywrapfst.pyx\":390\n *       raise FstArgError(\"Weight type not found\")\n *     if self.to_string() == b\"BadNumber\":\n *       raise FstBadWeightError(\"Invalid weight\")             # <<<<<<<<<<<<<<\n * \n *   cpdef Weight copy(self):\n */\n  __pyx_tuple__2 = PyTuple_Pack(1, __pyx_kp_s_Invalid_weight); if (unlikely(!__pyx_tuple__2)) __PYX_ERR(0, 390, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__2);\n  __Pyx_GIVEREF(__pyx_tuple__2);\n\n  /* \"(tree fragment)\":2\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._weight cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._weight cannot be converted to a Python object for pickling\")\n */\n  __pyx_tuple__3 = PyTuple_Pack(1, __pyx_kp_s_self__weight_cannot_be_converted); if (unlikely(!__pyx_tuple__3)) __PYX_ERR(1, 2, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__3);\n  __Pyx_GIVEREF(__pyx_tuple__3);\n\n  /* \"(tree fragment)\":4\n *     raise TypeError(\"self._weight cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._weight cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n */\n  __pyx_tuple__4 = PyTuple_Pack(1, __pyx_kp_s_self__weight_cannot_be_converted); if (unlikely(!__pyx_tuple__4)) __PYX_ERR(1, 4, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__4);\n  __Pyx_GIVEREF(__pyx_tuple__4);\n\n  /* \"pywrapfst.pyx\":638\n *       tostring(weight_type))))\n *   if result._weight.get().Type() == b\"none\":\n *     raise FstArgError(\"Weight type not found\")             # <<<<<<<<<<<<<<\n *   return result\n * \n */\n  __pyx_tuple__5 = PyTuple_Pack(1, __pyx_kp_s_Weight_type_not_found); if (unlikely(!__pyx_tuple__5)) __PYX_ERR(0, 638, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__5);\n  __Pyx_GIVEREF(__pyx_tuple__5);\n\n  /* \"pywrapfst.pyx\":647\n *         fst.WeightClass.One(tostring(weight_type))))\n *   if result._weight.get().Type() == b\"none\":\n *     raise FstArgError(\"Weight type not found\")             # <<<<<<<<<<<<<<\n *   return result\n * \n */\n  __pyx_tuple__6 = PyTuple_Pack(1, __pyx_kp_s_Weight_type_not_found); if (unlikely(!__pyx_tuple__6)) __PYX_ERR(0, 647, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__6);\n  __Pyx_GIVEREF(__pyx_tuple__6);\n\n  /* \"(tree fragment)\":2\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._table cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._table cannot be converted to a Python object for pickling\")\n */\n  __pyx_tuple__7 = PyTuple_Pack(1, __pyx_kp_s_self__table_cannot_be_converted); if (unlikely(!__pyx_tuple__7)) __PYX_ERR(1, 2, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__7);\n  __Pyx_GIVEREF(__pyx_tuple__7);\n\n  /* \"(tree fragment)\":4\n *     raise TypeError(\"self._table cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._table cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n */\n  __pyx_tuple__8 = PyTuple_Pack(1, __pyx_kp_s_self__table_cannot_be_converted); if (unlikely(!__pyx_tuple__8)) __PYX_ERR(1, 4, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__8);\n  __Pyx_GIVEREF(__pyx_tuple__8);\n\n  /* \"(tree fragment)\":2\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._encoder,self._table cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._encoder,self._table cannot be converted to a Python object for pickling\")\n */\n  __pyx_tuple__9 = PyTuple_Pack(1, __pyx_kp_s_self__encoder_self__table_cannot); if (unlikely(!__pyx_tuple__9)) __PYX_ERR(1, 2, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__9);\n  __Pyx_GIVEREF(__pyx_tuple__9);\n\n  /* \"(tree fragment)\":4\n *     raise TypeError(\"self._encoder,self._table cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._encoder,self._table cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n */\n  __pyx_tuple__10 = PyTuple_Pack(1, __pyx_kp_s_self__encoder_self__table_cannot); if (unlikely(!__pyx_tuple__10)) __PYX_ERR(1, 4, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__10);\n  __Pyx_GIVEREF(__pyx_tuple__10);\n\n  /* \"(tree fragment)\":2\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._fst,self._table cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._fst,self._table cannot be converted to a Python object for pickling\")\n */\n  __pyx_tuple__11 = PyTuple_Pack(1, __pyx_kp_s_self__fst_self__table_cannot_be); if (unlikely(!__pyx_tuple__11)) __PYX_ERR(1, 2, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__11);\n  __Pyx_GIVEREF(__pyx_tuple__11);\n\n  /* \"(tree fragment)\":4\n *     raise TypeError(\"self._fst,self._table cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._fst,self._table cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n */\n  __pyx_tuple__12 = PyTuple_Pack(1, __pyx_kp_s_self__fst_self__table_cannot_be); if (unlikely(!__pyx_tuple__12)) __PYX_ERR(1, 4, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__12);\n  __Pyx_GIVEREF(__pyx_tuple__12);\n\n  /* \"(tree fragment)\":2\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._table cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._table cannot be converted to a Python object for pickling\")\n */\n  __pyx_tuple__14 = PyTuple_Pack(1, __pyx_kp_s_self__table_cannot_be_converted); if (unlikely(!__pyx_tuple__14)) __PYX_ERR(1, 2, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__14);\n  __Pyx_GIVEREF(__pyx_tuple__14);\n\n  /* \"(tree fragment)\":4\n *     raise TypeError(\"self._table cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._table cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n */\n  __pyx_tuple__15 = PyTuple_Pack(1, __pyx_kp_s_self__table_cannot_be_converted); if (unlikely(!__pyx_tuple__15)) __PYX_ERR(1, 4, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__15);\n  __Pyx_GIVEREF(__pyx_tuple__15);\n\n  /* \"(tree fragment)\":2\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._mfst,self._table cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._mfst,self._table cannot be converted to a Python object for pickling\")\n */\n  __pyx_tuple__16 = PyTuple_Pack(1, __pyx_kp_s_self__mfst_self__table_cannot_be); if (unlikely(!__pyx_tuple__16)) __PYX_ERR(1, 2, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__16);\n  __Pyx_GIVEREF(__pyx_tuple__16);\n\n  /* \"(tree fragment)\":4\n *     raise TypeError(\"self._mfst,self._table cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._mfst,self._table cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n */\n  __pyx_tuple__17 = PyTuple_Pack(1, __pyx_kp_s_self__mfst_self__table_cannot_be); if (unlikely(!__pyx_tuple__17)) __PYX_ERR(1, 4, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__17);\n  __Pyx_GIVEREF(__pyx_tuple__17);\n\n  /* \"(tree fragment)\":2\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._smart_table,self._table cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._smart_table,self._table cannot be converted to a Python object for pickling\")\n */\n  __pyx_tuple__18 = PyTuple_Pack(1, __pyx_kp_s_self__smart_table_self__table_ca); if (unlikely(!__pyx_tuple__18)) __PYX_ERR(1, 2, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__18);\n  __Pyx_GIVEREF(__pyx_tuple__18);\n\n  /* \"(tree fragment)\":4\n *     raise TypeError(\"self._smart_table,self._table cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._smart_table,self._table cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n */\n  __pyx_tuple__19 = PyTuple_Pack(1, __pyx_kp_s_self__smart_table_self__table_ca); if (unlikely(!__pyx_tuple__19)) __PYX_ERR(1, 4, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__19);\n  __Pyx_GIVEREF(__pyx_tuple__19);\n\n  /* \"(tree fragment)\":2\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._siter,self._table cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._siter,self._table cannot be converted to a Python object for pickling\")\n */\n  __pyx_tuple__20 = PyTuple_Pack(1, __pyx_kp_s_self__siter_self__table_cannot_b); if (unlikely(!__pyx_tuple__20)) __PYX_ERR(1, 2, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__20);\n  __Pyx_GIVEREF(__pyx_tuple__20);\n\n  /* \"(tree fragment)\":4\n *     raise TypeError(\"self._siter,self._table cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._siter,self._table cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n */\n  __pyx_tuple__21 = PyTuple_Pack(1, __pyx_kp_s_self__siter_self__table_cannot_b); if (unlikely(!__pyx_tuple__21)) __PYX_ERR(1, 4, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__21);\n  __Pyx_GIVEREF(__pyx_tuple__21);\n\n  /* \"(tree fragment)\":2\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._encoder cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._encoder cannot be converted to a Python object for pickling\")\n */\n  __pyx_tuple__22 = PyTuple_Pack(1, __pyx_kp_s_self__encoder_cannot_be_converte); if (unlikely(!__pyx_tuple__22)) __PYX_ERR(1, 2, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__22);\n  __Pyx_GIVEREF(__pyx_tuple__22);\n\n  /* \"(tree fragment)\":4\n *     raise TypeError(\"self._encoder cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._encoder cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n */\n  __pyx_tuple__23 = PyTuple_Pack(1, __pyx_kp_s_self__encoder_cannot_be_converte); if (unlikely(!__pyx_tuple__23)) __PYX_ERR(1, 4, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__23);\n  __Pyx_GIVEREF(__pyx_tuple__23);\n\n  /* \"pywrapfst.pyx\":1400\n *     if proc.returncode != 0:  # Just to be explicit.\n *       raise subprocess.CalledProcessError(proc.returncode, self._DOT_TSVG)\n *     return sout.decode(\"utf8\")             # <<<<<<<<<<<<<<\n * \n *   def __repr__(self):\n */\n  __pyx_tuple__25 = PyTuple_Pack(1, __pyx_n_s_utf8); if (unlikely(!__pyx_tuple__25)) __PYX_ERR(0, 1400, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__25);\n  __Pyx_GIVEREF(__pyx_tuple__25);\n\n  /* \"pywrapfst.pyx\":1576\n *     cdef size_t result = self._fst.get().NumArcs(state)\n *     if result == SIZE_MAX:\n *       raise FstIndexError(\"State index out of range\")             # <<<<<<<<<<<<<<\n *     return result\n * \n */\n  __pyx_tuple__26 = PyTuple_Pack(1, __pyx_kp_s_State_index_out_of_range); if (unlikely(!__pyx_tuple__26)) __PYX_ERR(0, 1576, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__26);\n  __Pyx_GIVEREF(__pyx_tuple__26);\n\n  /* \"pywrapfst.pyx\":1598\n *     cdef size_t result = self._fst.get().NumInputEpsilons(state)\n *     if result == SIZE_MAX:\n *       raise FstIndexError(\"State index out of range\")             # <<<<<<<<<<<<<<\n *     return result\n * \n */\n  __pyx_tuple__27 = PyTuple_Pack(1, __pyx_kp_s_State_index_out_of_range); if (unlikely(!__pyx_tuple__27)) __PYX_ERR(0, 1598, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__27);\n  __Pyx_GIVEREF(__pyx_tuple__27);\n\n  /* \"pywrapfst.pyx\":1620\n *     cdef size_t result = self._fst.get().NumOutputEpsilons(state)\n *     if result == SIZE_MAX:\n *       raise FstIndexError(\"State index out of range\")             # <<<<<<<<<<<<<<\n *     return result\n * \n */\n  __pyx_tuple__28 = PyTuple_Pack(1, __pyx_kp_s_State_index_out_of_range); if (unlikely(!__pyx_tuple__28)) __PYX_ERR(0, 1620, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__28);\n  __Pyx_GIVEREF(__pyx_tuple__28);\n\n  /* \"pywrapfst.pyx\":1770\n *     cdef stringstream sstrm\n *     if not self._fst.get().Write(sstrm, \"write_to_string\"):\n *       raise FstIOError(\"Write to string failed\")             # <<<<<<<<<<<<<<\n *     return sstrm.str()\n * \n */\n  __pyx_tuple__29 = PyTuple_Pack(1, __pyx_kp_s_Write_to_string_failed); if (unlikely(!__pyx_tuple__29)) __PYX_ERR(0, 1770, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__29);\n  __Pyx_GIVEREF(__pyx_tuple__29);\n\n  /* \"pywrapfst.pyx\":1790\n *     \"\"\"\n *     if self._fst.get().Properties(fst.kError, True) == fst.kError:\n *       raise FstOpError(\"Operation failed\")             # <<<<<<<<<<<<<<\n * \n *   cdef void _add_arc(self, int64 state, Arc arc) except *:\n */\n  __pyx_tuple__30 = PyTuple_Pack(1, __pyx_kp_s_Operation_failed); if (unlikely(!__pyx_tuple__30)) __PYX_ERR(0, 1790, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__30);\n  __Pyx_GIVEREF(__pyx_tuple__30);\n\n  /* \"pywrapfst.pyx\":1794\n *   cdef void _add_arc(self, int64 state, Arc arc) except *:\n *     if not self._fst.get().ValidStateId(state):\n *       raise FstIndexError(\"State index out of range\")             # <<<<<<<<<<<<<<\n *     if not self._mfst.get().AddArc(state, deref(arc._arc)):\n *       raise FstOpError(\"Incompatible or invalid weight type\")\n */\n  __pyx_tuple__31 = PyTuple_Pack(1, __pyx_kp_s_State_index_out_of_range); if (unlikely(!__pyx_tuple__31)) __PYX_ERR(0, 1794, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__31);\n  __Pyx_GIVEREF(__pyx_tuple__31);\n\n  /* \"pywrapfst.pyx\":1796\n *       raise FstIndexError(\"State index out of range\")\n *     if not self._mfst.get().AddArc(state, deref(arc._arc)):\n *       raise FstOpError(\"Incompatible or invalid weight type\")             # <<<<<<<<<<<<<<\n *     self._check_mutating_imethod()\n * \n */\n  __pyx_tuple__32 = PyTuple_Pack(1, __pyx_kp_s_Incompatible_or_invalid_weight_t); if (unlikely(!__pyx_tuple__32)) __PYX_ERR(0, 1796, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__32);\n  __Pyx_GIVEREF(__pyx_tuple__32);\n\n  /* \"pywrapfst.pyx\":1961\n *     if not (self._mfst.get().DeleteArcs(state, n) if n else\n *             self._mfst.get().DeleteArcs(state)):\n *       raise FstIndexError(\"State index out of range\")             # <<<<<<<<<<<<<<\n *     self._check_mutating_imethod()\n * \n */\n  __pyx_tuple__33 = PyTuple_Pack(1, __pyx_kp_s_State_index_out_of_range); if (unlikely(!__pyx_tuple__33)) __PYX_ERR(0, 1961, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__33);\n  __Pyx_GIVEREF(__pyx_tuple__33);\n\n  /* \"pywrapfst.pyx\":1991\n *     if states:\n *       if not self._mfst.get().DeleteStates(<const vector[int64]> states):\n *         raise FstIndexError(\"State index out of range\")             # <<<<<<<<<<<<<<\n *     else:\n *       self._mfst.get().DeleteStates()\n */\n  __pyx_tuple__34 = PyTuple_Pack(1, __pyx_kp_s_State_index_out_of_range); if (unlikely(!__pyx_tuple__34)) __PYX_ERR(0, 1991, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__34);\n  __Pyx_GIVEREF(__pyx_tuple__34);\n\n  /* \"pywrapfst.pyx\":2260\n *         _opairs.get().push_back(fst.LabelPair(before, after))\n *     if _ipairs.get().empty() and _opairs.get().empty():\n *       raise FstArgError(\"No relabeling pairs specified.\")             # <<<<<<<<<<<<<<\n *     fst.Relabel(self._mfst.get(), deref(_ipairs), deref(_opairs))\n *     self._check_mutating_imethod()\n */\n  __pyx_tuple__43 = PyTuple_Pack(1, __pyx_kp_s_No_relabeling_pairs_specified); if (unlikely(!__pyx_tuple__43)) __PYX_ERR(0, 2260, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__43);\n  __Pyx_GIVEREF(__pyx_tuple__43);\n\n  /* \"pywrapfst.pyx\":2299\n *                             bool attach_new_osymbols=True) except *:\n *     if new_isymbols is None and new_osymbols is None:\n *       raise FstArgError(\"No new SymbolTables specified\")             # <<<<<<<<<<<<<<\n *     cdef fst.SymbolTable *new_isymbols_ptr = NULL\n *     if new_isymbols is not None:\n */\n  __pyx_tuple__44 = PyTuple_Pack(1, __pyx_kp_s_No_new_SymbolTables_specified); if (unlikely(!__pyx_tuple__44)) __PYX_ERR(0, 2299, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__44);\n  __Pyx_GIVEREF(__pyx_tuple__44);\n\n  /* \"pywrapfst.pyx\":2367\n *   cdef void _reserve_arcs(self, int64 state, size_t n) except *:\n *     if not self._mfst.get().ReserveArcs(state, n):\n *       raise FstIndexError(\"State index out of range\")             # <<<<<<<<<<<<<<\n *     self._check_mutating_imethod()\n * \n */\n  __pyx_tuple__45 = PyTuple_Pack(1, __pyx_kp_s_State_index_out_of_range); if (unlikely(!__pyx_tuple__45)) __PYX_ERR(0, 2367, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__45);\n  __Pyx_GIVEREF(__pyx_tuple__45);\n\n  /* \"pywrapfst.pyx\":2494\n *   cdef void _set_final(self, int64 state, weight=None) except *:\n *     if not self._mfst.get().ValidStateId(state):\n *       raise FstIndexError(\"State index out of range\")             # <<<<<<<<<<<<<<\n *     cdef fst.WeightClass wc = _get_WeightClass_or_One(self.weight_type(),\n *                                                       weight)\n */\n  __pyx_tuple__50 = PyTuple_Pack(1, __pyx_kp_s_State_index_out_of_range); if (unlikely(!__pyx_tuple__50)) __PYX_ERR(0, 2494, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__50);\n  __Pyx_GIVEREF(__pyx_tuple__50);\n\n  /* \"pywrapfst.pyx\":2498\n *                                                       weight)\n *     if not self._mfst.get().SetFinal(state, wc):\n *       raise FstOpError(\"Incompatible or invalid weight\")             # <<<<<<<<<<<<<<\n *     self._check_mutating_imethod()\n * \n */\n  __pyx_tuple__51 = PyTuple_Pack(1, __pyx_kp_s_Incompatible_or_invalid_weight); if (unlikely(!__pyx_tuple__51)) __PYX_ERR(0, 2498, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__51);\n  __Pyx_GIVEREF(__pyx_tuple__51);\n\n  /* \"pywrapfst.pyx\":2598\n *   cdef void _set_start(self, int64 state) except *:\n *     if not self._mfst.get().SetStart(state):\n *       raise FstIndexError(\"State index out of range\")             # <<<<<<<<<<<<<<\n *     self._check_mutating_imethod()\n * \n */\n  __pyx_tuple__52 = PyTuple_Pack(1, __pyx_kp_s_State_index_out_of_range); if (unlikely(!__pyx_tuple__52)) __PYX_ERR(0, 2598, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__52);\n  __Pyx_GIVEREF(__pyx_tuple__52);\n\n  /* \"pywrapfst.pyx\":2624\n *     # TopSort returns False if the FST is cyclic, and thus can't be TopSorted.\n *     if not fst.TopSort(self._mfst.get()):\n *       logging.warning(\"Cannot topsort cyclic FST.\")             # <<<<<<<<<<<<<<\n *     self._check_mutating_imethod()\n * \n */\n  __pyx_tuple__53 = PyTuple_Pack(1, __pyx_kp_s_Cannot_topsort_cyclic_FST); if (unlikely(!__pyx_tuple__53)) __PYX_ERR(0, 2624, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__53);\n  __Pyx_GIVEREF(__pyx_tuple__53);\n\n  /* \"pywrapfst.pyx\":2693\n * cdef _Fst _init_Fst(FstClass_ptr tfst):\n *   if tfst.Properties(fst.kError, True):\n *     raise FstOpError(\"Operation failed\")             # <<<<<<<<<<<<<<\n *   cdef _Fst ofst = _Fst.__new__(_Fst)\n *   ofst._fst.reset(tfst)\n */\n  __pyx_tuple__54 = PyTuple_Pack(1, __pyx_kp_s_Operation_failed); if (unlikely(!__pyx_tuple__54)) __PYX_ERR(0, 2693, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__54);\n  __Pyx_GIVEREF(__pyx_tuple__54);\n\n  /* \"pywrapfst.pyx\":2701\n * cdef _MutableFst _init_MutableFst(MutableFstClass_ptr tfst):\n *   if tfst.Properties(fst.kError, True):\n *     raise FstOpError(\"Operation failed\")             # <<<<<<<<<<<<<<\n *   cdef _MutableFst ofst = _MutableFst.__new__(_MutableFst)\n *   ofst._fst.reset(tfst)\n */\n  __pyx_tuple__55 = PyTuple_Pack(1, __pyx_kp_s_Operation_failed); if (unlikely(!__pyx_tuple__55)) __PYX_ERR(0, 2701, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__55);\n  __Pyx_GIVEREF(__pyx_tuple__55);\n\n  /* \"pywrapfst.pyx\":2738\n *   tfst.reset(fst.FstClass.ReadFromStream(sstrm, b\"<pywrapfst>\"))\n *   if tfst.get() == NULL:\n *     raise FstIOError(\"Read failed: <string>\")             # <<<<<<<<<<<<<<\n *   return _init_XFst(tfst.release())\n * \n */\n  __pyx_tuple__56 = PyTuple_Pack(1, __pyx_kp_s_Read_failed_string); if (unlikely(!__pyx_tuple__56)) __PYX_ERR(0, 2738, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__56);\n  __Pyx_GIVEREF(__pyx_tuple__56);\n\n  /* \"(tree fragment)\":2\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._arc cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._arc cannot be converted to a Python object for pickling\")\n */\n  __pyx_tuple__57 = PyTuple_Pack(1, __pyx_kp_s_self__arc_cannot_be_converted_to); if (unlikely(!__pyx_tuple__57)) __PYX_ERR(1, 2, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__57);\n  __Pyx_GIVEREF(__pyx_tuple__57);\n\n  /* \"(tree fragment)\":4\n *     raise TypeError(\"self._arc cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._arc cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n */\n  __pyx_tuple__58 = PyTuple_Pack(1, __pyx_kp_s_self__arc_cannot_be_converted_to); if (unlikely(!__pyx_tuple__58)) __PYX_ERR(1, 4, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__58);\n  __Pyx_GIVEREF(__pyx_tuple__58);\n\n  /* \"pywrapfst.pyx\":2978\n *   def __init__(self, _Fst ifst, int64 state):\n *     if not ifst._fst.get().ValidStateId(state):\n *       raise FstIndexError(\"State index out of range\")             # <<<<<<<<<<<<<<\n *     # Makes copy of the shared_ptr, potentially extending the FST's lifetime.\n *     self._fst = ifst._fst\n */\n  __pyx_tuple__59 = PyTuple_Pack(1, __pyx_kp_s_State_index_out_of_range); if (unlikely(!__pyx_tuple__59)) __PYX_ERR(0, 2978, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__59);\n  __Pyx_GIVEREF(__pyx_tuple__59);\n\n  /* \"(tree fragment)\":2\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._aiter,self._fst cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._aiter,self._fst cannot be converted to a Python object for pickling\")\n */\n  __pyx_tuple__60 = PyTuple_Pack(1, __pyx_kp_s_self__aiter_self__fst_cannot_be); if (unlikely(!__pyx_tuple__60)) __PYX_ERR(1, 2, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__60);\n  __Pyx_GIVEREF(__pyx_tuple__60);\n\n  /* \"(tree fragment)\":4\n *     raise TypeError(\"self._aiter,self._fst cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._aiter,self._fst cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n */\n  __pyx_tuple__61 = PyTuple_Pack(1, __pyx_kp_s_self__aiter_self__fst_cannot_be); if (unlikely(!__pyx_tuple__61)) __PYX_ERR(1, 4, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__61);\n  __Pyx_GIVEREF(__pyx_tuple__61);\n\n  /* \"pywrapfst.pyx\":3090\n *   def __init__(self, _MutableFst ifst, int64 state):\n *     if not ifst._fst.get().ValidStateId(state):\n *       raise FstIndexError(\"State index out of range\")             # <<<<<<<<<<<<<<\n *     # Makes copy of the shared_ptr, potentially extending the FST's lifetime.\n *     self._mfst = ifst._mfst\n */\n  __pyx_tuple__62 = PyTuple_Pack(1, __pyx_kp_s_State_index_out_of_range); if (unlikely(!__pyx_tuple__62)) __PYX_ERR(0, 3090, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__62);\n  __Pyx_GIVEREF(__pyx_tuple__62);\n\n  /* \"(tree fragment)\":2\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._aiter,self._mfst cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._aiter,self._mfst cannot be converted to a Python object for pickling\")\n */\n  __pyx_tuple__63 = PyTuple_Pack(1, __pyx_kp_s_self__aiter_self__mfst_cannot_be); if (unlikely(!__pyx_tuple__63)) __PYX_ERR(1, 2, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__63);\n  __Pyx_GIVEREF(__pyx_tuple__63);\n\n  /* \"(tree fragment)\":4\n *     raise TypeError(\"self._aiter,self._mfst cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._aiter,self._mfst cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n */\n  __pyx_tuple__64 = PyTuple_Pack(1, __pyx_kp_s_self__aiter_self__mfst_cannot_be); if (unlikely(!__pyx_tuple__64)) __PYX_ERR(1, 4, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__64);\n  __Pyx_GIVEREF(__pyx_tuple__64);\n\n  /* \"(tree fragment)\":2\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._fst,self._siter cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._fst,self._siter cannot be converted to a Python object for pickling\")\n */\n  __pyx_tuple__65 = PyTuple_Pack(1, __pyx_kp_s_self__fst_self__siter_cannot_be); if (unlikely(!__pyx_tuple__65)) __PYX_ERR(1, 2, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__65);\n  __Pyx_GIVEREF(__pyx_tuple__65);\n\n  /* \"(tree fragment)\":4\n *     raise TypeError(\"self._fst,self._siter cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._fst,self._siter cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n */\n  __pyx_tuple__66 = PyTuple_Pack(1, __pyx_kp_s_self__fst_self__siter_cannot_be); if (unlikely(!__pyx_tuple__66)) __PYX_ERR(1, 4, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__66);\n  __Pyx_GIVEREF(__pyx_tuple__66);\n\n  /* \"pywrapfst.pyx\":4190\n *     self._sstrm.reset(new stringstream())\n *     if tfst.get() == NULL:\n *       raise FstOpError(\"Compilation failed\")             # <<<<<<<<<<<<<<\n *     return _init_XFst(tfst.release())\n * \n */\n  __pyx_tuple__90 = PyTuple_Pack(1, __pyx_kp_s_Compilation_failed); if (unlikely(!__pyx_tuple__90)) __PYX_ERR(0, 4190, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__90);\n  __Pyx_GIVEREF(__pyx_tuple__90);\n\n  /* \"(tree fragment)\":2\n * def __reduce_cython__(self):\n *     raise TypeError(\"no default __reduce__ due to non-trivial __cinit__\")             # <<<<<<<<<<<<<<\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"no default __reduce__ due to non-trivial __cinit__\")\n */\n  __pyx_tuple__91 = PyTuple_Pack(1, __pyx_kp_s_no_default___reduce___due_to_non); if (unlikely(!__pyx_tuple__91)) __PYX_ERR(1, 2, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__91);\n  __Pyx_GIVEREF(__pyx_tuple__91);\n\n  /* \"(tree fragment)\":4\n *     raise TypeError(\"no default __reduce__ due to non-trivial __cinit__\")\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"no default __reduce__ due to non-trivial __cinit__\")             # <<<<<<<<<<<<<<\n */\n  __pyx_tuple__92 = PyTuple_Pack(1, __pyx_kp_s_no_default___reduce___due_to_non); if (unlikely(!__pyx_tuple__92)) __PYX_ERR(1, 4, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__92);\n  __Pyx_GIVEREF(__pyx_tuple__92);\n\n  /* \"(tree fragment)\":2\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._reader cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._reader cannot be converted to a Python object for pickling\")\n */\n  __pyx_tuple__93 = PyTuple_Pack(1, __pyx_kp_s_self__reader_cannot_be_converted); if (unlikely(!__pyx_tuple__93)) __PYX_ERR(1, 2, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__93);\n  __Pyx_GIVEREF(__pyx_tuple__93);\n\n  /* \"(tree fragment)\":4\n *     raise TypeError(\"self._reader cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._reader cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n */\n  __pyx_tuple__94 = PyTuple_Pack(1, __pyx_kp_s_self__reader_cannot_be_converted); if (unlikely(!__pyx_tuple__94)) __PYX_ERR(1, 4, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__94);\n  __Pyx_GIVEREF(__pyx_tuple__94);\n\n  /* \"pywrapfst.pyx\":4443\n *     # used by the FAR was initialized to use.\n *     if not self._writer.get().Add(tostring(key), deref(ifst._fst)):\n *       raise FstOpError(\"Incompatible or invalid arc type\")             # <<<<<<<<<<<<<<\n *     # An error here usually indicates a key out of order.\n *     if self._writer.get().Error():\n */\n  __pyx_tuple__95 = PyTuple_Pack(1, __pyx_kp_s_Incompatible_or_invalid_arc_type); if (unlikely(!__pyx_tuple__95)) __PYX_ERR(0, 4443, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__95);\n  __Pyx_GIVEREF(__pyx_tuple__95);\n\n  /* \"pywrapfst.pyx\":4446\n *     # An error here usually indicates a key out of order.\n *     if self._writer.get().Error():\n *       raise FstArgError(\"Key out of order\")             # <<<<<<<<<<<<<<\n * \n *   cpdef string arc_type(self):\n */\n  __pyx_tuple__96 = PyTuple_Pack(1, __pyx_kp_s_Key_out_of_order); if (unlikely(!__pyx_tuple__96)) __PYX_ERR(0, 4446, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__96);\n  __Pyx_GIVEREF(__pyx_tuple__96);\n\n  /* \"(tree fragment)\":2\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._writer cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._writer cannot be converted to a Python object for pickling\")\n */\n  __pyx_tuple__97 = PyTuple_Pack(1, __pyx_kp_s_self__writer_cannot_be_converted); if (unlikely(!__pyx_tuple__97)) __PYX_ERR(1, 2, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__97);\n  __Pyx_GIVEREF(__pyx_tuple__97);\n\n  /* \"(tree fragment)\":4\n *     raise TypeError(\"self._writer cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._writer cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n */\n  __pyx_tuple__98 = PyTuple_Pack(1, __pyx_kp_s_self__writer_cannot_be_converted); if (unlikely(!__pyx_tuple__98)) __PYX_ERR(1, 4, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__98);\n  __Pyx_GIVEREF(__pyx_tuple__98);\n\n  /* \"pywrapfst.pyx\":456\n * \n * \n * def plus(Weight lhs, Weight rhs):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   plus(lhs, rhs)\n */\n  __pyx_tuple__99 = PyTuple_Pack(3, __pyx_n_s_lhs, __pyx_n_s_rhs, __pyx_n_s_result); if (unlikely(!__pyx_tuple__99)) __PYX_ERR(0, 456, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__99);\n  __Pyx_GIVEREF(__pyx_tuple__99);\n  __pyx_codeobj__100 = (PyObject*)__Pyx_PyCode_New(2, 0, 3, 0, CO_OPTIMIZED|CO_NEWLOCALS, __pyx_empty_bytes, __pyx_empty_tuple, __pyx_empty_tuple, __pyx_tuple__99, __pyx_empty_tuple, __pyx_empty_tuple, __pyx_kp_s_pywrapfst_pyx, __pyx_n_s_plus, 456, __pyx_empty_bytes); if (unlikely(!__pyx_codeobj__100)) __PYX_ERR(0, 456, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":488\n * \n * \n * def times(Weight lhs, Weight rhs):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   times(lhs, rhs)\n */\n  __pyx_tuple__101 = PyTuple_Pack(3, __pyx_n_s_lhs, __pyx_n_s_rhs, __pyx_n_s_result); if (unlikely(!__pyx_tuple__101)) __PYX_ERR(0, 488, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__101);\n  __Pyx_GIVEREF(__pyx_tuple__101);\n  __pyx_codeobj__102 = (PyObject*)__Pyx_PyCode_New(2, 0, 3, 0, CO_OPTIMIZED|CO_NEWLOCALS, __pyx_empty_bytes, __pyx_empty_tuple, __pyx_empty_tuple, __pyx_tuple__101, __pyx_empty_tuple, __pyx_empty_tuple, __pyx_kp_s_pywrapfst_pyx, __pyx_n_s_times, 488, __pyx_empty_bytes); if (unlikely(!__pyx_codeobj__102)) __PYX_ERR(0, 488, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":520\n * \n * \n * def divide(Weight lhs, Weight rhs):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   divide(lhs, rhs)\n */\n  __pyx_tuple__103 = PyTuple_Pack(3, __pyx_n_s_lhs, __pyx_n_s_rhs, __pyx_n_s_result); if (unlikely(!__pyx_tuple__103)) __PYX_ERR(0, 520, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__103);\n  __Pyx_GIVEREF(__pyx_tuple__103);\n  __pyx_codeobj__104 = (PyObject*)__Pyx_PyCode_New(2, 0, 3, 0, CO_OPTIMIZED|CO_NEWLOCALS, __pyx_empty_bytes, __pyx_empty_tuple, __pyx_empty_tuple, __pyx_tuple__103, __pyx_empty_tuple, __pyx_empty_tuple, __pyx_kp_s_pywrapfst_pyx, __pyx_n_s_divide, 520, __pyx_empty_bytes); if (unlikely(!__pyx_codeobj__104)) __PYX_ERR(0, 520, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":553\n * \n * \n * def power(Weight w, size_t n):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   power(lhs, rhs)\n */\n  __pyx_tuple__105 = PyTuple_Pack(3, __pyx_n_s_w, __pyx_n_s_n, __pyx_n_s_result); if (unlikely(!__pyx_tuple__105)) __PYX_ERR(0, 553, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__105);\n  __Pyx_GIVEREF(__pyx_tuple__105);\n  __pyx_codeobj__106 = (PyObject*)__Pyx_PyCode_New(2, 0, 3, 0, CO_OPTIMIZED|CO_NEWLOCALS, __pyx_empty_bytes, __pyx_empty_tuple, __pyx_empty_tuple, __pyx_tuple__105, __pyx_empty_tuple, __pyx_empty_tuple, __pyx_kp_s_pywrapfst_pyx, __pyx_n_s_power, 553, __pyx_empty_bytes); if (unlikely(!__pyx_codeobj__106)) __PYX_ERR(0, 553, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":2742\n * \n * \n * class Fst(object):             # <<<<<<<<<<<<<<\n * \n *    \"\"\"\n */\n  __pyx_tuple__107 = PyTuple_Pack(1, __pyx_builtin_object); if (unlikely(!__pyx_tuple__107)) __PYX_ERR(0, 2742, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__107);\n  __Pyx_GIVEREF(__pyx_tuple__107);\n\n  /* \"pywrapfst.pyx\":2759\n *    \"\"\"\n * \n *    def __new__(cls, arc_type=b\"standard\"):             # <<<<<<<<<<<<<<\n *     return _create_Fst(arc_type)\n * \n */\n  __pyx_tuple__108 = PyTuple_Pack(2, __pyx_n_s_cls, __pyx_n_s_arc_type); if (unlikely(!__pyx_tuple__108)) __PYX_ERR(0, 2759, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__108);\n  __Pyx_GIVEREF(__pyx_tuple__108);\n  __pyx_codeobj__109 = (PyObject*)__Pyx_PyCode_New(2, 0, 2, 0, CO_OPTIMIZED|CO_NEWLOCALS, __pyx_empty_bytes, __pyx_empty_tuple, __pyx_empty_tuple, __pyx_tuple__108, __pyx_empty_tuple, __pyx_empty_tuple, __pyx_kp_s_pywrapfst_pyx, __pyx_n_s_new, 2759, __pyx_empty_bytes); if (unlikely(!__pyx_codeobj__109)) __PYX_ERR(0, 2759, __pyx_L1_error)\n  __pyx_tuple__110 = PyTuple_Pack(1, ((PyObject*)__pyx_n_b_standard)); if (unlikely(!__pyx_tuple__110)) __PYX_ERR(0, 2759, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__110);\n  __Pyx_GIVEREF(__pyx_tuple__110);\n\n  /* \"pywrapfst.pyx\":2763\n * \n *    @staticmethod\n *    def read(filename):             # <<<<<<<<<<<<<<\n *      \"\"\"\n *      read(filename):\n */\n  __pyx_tuple__111 = PyTuple_Pack(1, __pyx_n_s_filename); if (unlikely(!__pyx_tuple__111)) __PYX_ERR(0, 2763, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__111);\n  __Pyx_GIVEREF(__pyx_tuple__111);\n  __pyx_codeobj__112 = (PyObject*)__Pyx_PyCode_New(1, 0, 1, 0, CO_OPTIMIZED|CO_NEWLOCALS, __pyx_empty_bytes, __pyx_empty_tuple, __pyx_empty_tuple, __pyx_tuple__111, __pyx_empty_tuple, __pyx_empty_tuple, __pyx_kp_s_pywrapfst_pyx, __pyx_n_s_read, 2763, __pyx_empty_bytes); if (unlikely(!__pyx_codeobj__112)) __PYX_ERR(0, 2763, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":2781\n * \n *    @staticmethod\n *    def read_from_string(state):             # <<<<<<<<<<<<<<\n *      \"\"\"\n *      read_from_string(string, fst_type=None)\n */\n  __pyx_tuple__113 = PyTuple_Pack(1, __pyx_n_s_state); if (unlikely(!__pyx_tuple__113)) __PYX_ERR(0, 2781, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__113);\n  __Pyx_GIVEREF(__pyx_tuple__113);\n  __pyx_codeobj__114 = (PyObject*)__Pyx_PyCode_New(1, 0, 1, 0, CO_OPTIMIZED|CO_NEWLOCALS, __pyx_empty_bytes, __pyx_empty_tuple, __pyx_empty_tuple, __pyx_tuple__113, __pyx_empty_tuple, __pyx_empty_tuple, __pyx_kp_s_pywrapfst_pyx, __pyx_n_s_read_from_string_2, 2781, __pyx_empty_bytes); if (unlikely(!__pyx_codeobj__114)) __PYX_ERR(0, 2781, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":3949\n * \n * \n * def shortestdistance(_Fst ifst,             # <<<<<<<<<<<<<<\n *                      float delta=fst.kShortestDelta,\n *                      int64 nstate=fst.kNoStateId,\n */\n  __pyx_tuple__115 = PyTuple_Pack(8, __pyx_n_s_ifst, __pyx_n_s_delta, __pyx_n_s_nstate, __pyx_n_s_queue_type, __pyx_n_s_reverse, __pyx_n_s_distance, __pyx_n_s_weight_type, __pyx_n_s_weight); if (unlikely(!__pyx_tuple__115)) __PYX_ERR(0, 3949, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__115);\n  __Pyx_GIVEREF(__pyx_tuple__115);\n  __pyx_codeobj__116 = (PyObject*)__Pyx_PyCode_New(5, 0, 8, 0, CO_OPTIMIZED|CO_NEWLOCALS, __pyx_empty_bytes, __pyx_empty_tuple, __pyx_empty_tuple, __pyx_tuple__115, __pyx_empty_tuple, __pyx_empty_tuple, __pyx_kp_s_pywrapfst_pyx, __pyx_n_s_shortestdistance, 3949, __pyx_empty_bytes); if (unlikely(!__pyx_codeobj__116)) __PYX_ERR(0, 3949, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":4492\n * \n * @atexit.register\n * def _reset_fst_error_fatal():             # <<<<<<<<<<<<<<\n *   fst.FLAGS_fst_error_fatal = _fst_error_fatal_old\n * \n */\n  __pyx_codeobj__117 = (PyObject*)__Pyx_PyCode_New(0, 0, 0, 0, CO_OPTIMIZED|CO_NEWLOCALS, __pyx_empty_bytes, __pyx_empty_tuple, __pyx_empty_tuple, __pyx_empty_tuple, __pyx_empty_tuple, __pyx_empty_tuple, __pyx_kp_s_pywrapfst_pyx, __pyx_n_s_reset_fst_error_fatal, 4492, __pyx_empty_bytes); if (unlikely(!__pyx_codeobj__117)) __PYX_ERR(0, 4492, __pyx_L1_error)\n  __Pyx_RefNannyFinishContext();\n  return 0;\n  __pyx_L1_error:;\n  __Pyx_RefNannyFinishContext();\n  return -1;\n}\n\nstatic int __Pyx_InitGlobals(void) {\n  if (__Pyx_InitStrings(__pyx_string_tab) < 0) __PYX_ERR(0, 1, __pyx_L1_error);\n  __pyx_int_0 = PyInt_FromLong(0); if (unlikely(!__pyx_int_0)) __PYX_ERR(0, 1, __pyx_L1_error)\n  __pyx_int_neg_1 = PyInt_FromLong(-1); if (unlikely(!__pyx_int_neg_1)) __PYX_ERR(0, 1, __pyx_L1_error)\n  return 0;\n  __pyx_L1_error:;\n  return -1;\n}\n\n#if PY_MAJOR_VERSION < 3\nPyMODINIT_FUNC initpywrapfst(void); /*proto*/\nPyMODINIT_FUNC initpywrapfst(void)\n#else\nPyMODINIT_FUNC PyInit_pywrapfst(void); /*proto*/\nPyMODINIT_FUNC PyInit_pywrapfst(void)\n#if CYTHON_PEP489_MULTI_PHASE_INIT\n{\n  return PyModuleDef_Init(&__pyx_moduledef);\n}\nstatic int __Pyx_copy_spec_to_module(PyObject *spec, PyObject *moddict, const char* from_name, const char* to_name) {\n    PyObject *value = PyObject_GetAttrString(spec, from_name);\n    int result = 0;\n    if (likely(value)) {\n        result = PyDict_SetItemString(moddict, to_name, value);\n        Py_DECREF(value);\n    } else if (PyErr_ExceptionMatches(PyExc_AttributeError)) {\n        PyErr_Clear();\n    } else {\n        result = -1;\n    }\n    return result;\n}\nstatic PyObject* __pyx_pymod_create(PyObject *spec, CYTHON_UNUSED PyModuleDef *def) {\n    PyObject *module = NULL, *moddict, *modname;\n    if (__pyx_m)\n        return __Pyx_NewRef(__pyx_m);\n    modname = PyObject_GetAttrString(spec, \"name\");\n    if (unlikely(!modname)) goto bad;\n    module = PyModule_NewObject(modname);\n    Py_DECREF(modname);\n    if (unlikely(!module)) goto bad;\n    moddict = PyModule_GetDict(module);\n    if (unlikely(!moddict)) goto bad;\n    if (unlikely(__Pyx_copy_spec_to_module(spec, moddict, \"loader\", \"__loader__\") < 0)) goto bad;\n    if (unlikely(__Pyx_copy_spec_to_module(spec, moddict, \"origin\", \"__file__\") < 0)) goto bad;\n    if (unlikely(__Pyx_copy_spec_to_module(spec, moddict, \"parent\", \"__package__\") < 0)) goto bad;\n    if (unlikely(__Pyx_copy_spec_to_module(spec, moddict, \"submodule_search_locations\", \"__path__\") < 0)) goto bad;\n    return module;\nbad:\n    Py_XDECREF(module);\n    return NULL;\n}\n\n\nstatic int __pyx_pymod_exec_pywrapfst(PyObject *__pyx_pyinit_module)\n#endif\n#endif\n{\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  __pyx_t_10basictypes_int64 __pyx_t_5;\n  std::string __pyx_t_6;\n  PyObject *__pyx_t_7 = NULL;\n  __Pyx_RefNannyDeclarations\n  #if CYTHON_PEP489_MULTI_PHASE_INIT\n  if (__pyx_m && __pyx_m == __pyx_pyinit_module) return 0;\n  #endif\n  #if CYTHON_REFNANNY\n  __Pyx_RefNanny = __Pyx_RefNannyImportAPI(\"refnanny\");\n  if (!__Pyx_RefNanny) {\n      PyErr_Clear();\n      __Pyx_RefNanny = __Pyx_RefNannyImportAPI(\"Cython.Runtime.refnanny\");\n      if (!__Pyx_RefNanny)\n          Py_FatalError(\"failed to import 'refnanny' module\");\n  }\n  #endif\n  __Pyx_RefNannySetupContext(\"PyMODINIT_FUNC PyInit_pywrapfst(void)\", 0);\n  if (__Pyx_check_binary_version() < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  __pyx_empty_tuple = PyTuple_New(0); if (unlikely(!__pyx_empty_tuple)) __PYX_ERR(0, 1, __pyx_L1_error)\n  __pyx_empty_bytes = PyBytes_FromStringAndSize(\"\", 0); if (unlikely(!__pyx_empty_bytes)) __PYX_ERR(0, 1, __pyx_L1_error)\n  __pyx_empty_unicode = PyUnicode_FromStringAndSize(\"\", 0); if (unlikely(!__pyx_empty_unicode)) __PYX_ERR(0, 1, __pyx_L1_error)\n  #ifdef __Pyx_CyFunction_USED\n  if (__pyx_CyFunction_init() < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  #endif\n  #ifdef __Pyx_FusedFunction_USED\n  if (__pyx_FusedFunction_init() < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  #endif\n  #ifdef __Pyx_Coroutine_USED\n  if (__pyx_Coroutine_init() < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  #endif\n  #ifdef __Pyx_Generator_USED\n  if (__pyx_Generator_init() < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  #endif\n  #ifdef __Pyx_AsyncGen_USED\n  if (__pyx_AsyncGen_init() < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  #endif\n  #ifdef __Pyx_StopAsyncIteration_USED\n  if (__pyx_StopAsyncIteration_init() < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  #endif\n  /*--- Library function declarations ---*/\n  /*--- Threads initialization code ---*/\n  #if defined(__PYX_FORCE_INIT_THREADS) && __PYX_FORCE_INIT_THREADS\n  #ifdef WITH_THREAD /* Python build with threading support? */\n  PyEval_InitThreads();\n  #endif\n  #endif\n  /*--- Module creation code ---*/\n  #if CYTHON_PEP489_MULTI_PHASE_INIT\n  __pyx_m = __pyx_pyinit_module;\n  Py_INCREF(__pyx_m);\n  #else\n  #if PY_MAJOR_VERSION < 3\n  __pyx_m = Py_InitModule4(\"pywrapfst\", __pyx_methods, __pyx_k_Python_interface_to_the_FST_scri, 0, PYTHON_API_VERSION); Py_XINCREF(__pyx_m);\n  #else\n  __pyx_m = PyModule_Create(&__pyx_moduledef);\n  #endif\n  if (unlikely(!__pyx_m)) __PYX_ERR(0, 1, __pyx_L1_error)\n  #endif\n  __pyx_d = PyModule_GetDict(__pyx_m); if (unlikely(!__pyx_d)) __PYX_ERR(0, 1, __pyx_L1_error)\n  Py_INCREF(__pyx_d);\n  __pyx_b = PyImport_AddModule(__Pyx_BUILTIN_MODULE_NAME); if (unlikely(!__pyx_b)) __PYX_ERR(0, 1, __pyx_L1_error)\n  __pyx_cython_runtime = PyImport_AddModule((char *) \"cython_runtime\"); if (unlikely(!__pyx_cython_runtime)) __PYX_ERR(0, 1, __pyx_L1_error)\n  #if CYTHON_COMPILING_IN_PYPY\n  Py_INCREF(__pyx_b);\n  #endif\n  if (PyObject_SetAttrString(__pyx_m, \"__builtins__\", __pyx_b) < 0) __PYX_ERR(0, 1, __pyx_L1_error);\n  /*--- Initialize various global constants etc. ---*/\n  if (__Pyx_InitGlobals() < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  #if PY_MAJOR_VERSION < 3 && (__PYX_DEFAULT_STRING_ENCODING_IS_ASCII || __PYX_DEFAULT_STRING_ENCODING_IS_DEFAULT)\n  if (__Pyx_init_sys_getdefaultencoding_params() < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  #endif\n  if (__pyx_module_is_main_pywrapfst) {\n    if (PyObject_SetAttrString(__pyx_m, \"__name__\", __pyx_n_s_main) < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  }\n  #if PY_MAJOR_VERSION >= 3\n  {\n    PyObject *modules = PyImport_GetModuleDict(); if (unlikely(!modules)) __PYX_ERR(0, 1, __pyx_L1_error)\n    if (!PyDict_GetItemString(modules, \"pywrapfst\")) {\n      if (unlikely(PyDict_SetItemString(modules, \"pywrapfst\", __pyx_m) < 0)) __PYX_ERR(0, 1, __pyx_L1_error)\n    }\n  }\n  #endif\n  /*--- Builtin init code ---*/\n  if (__Pyx_InitCachedBuiltins() < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  /*--- Constants init code ---*/\n  if (__Pyx_InitCachedConstants() < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  /*--- Global init code ---*/\n  /*--- Variable export code ---*/\n  /*--- Function export code ---*/\n  if (__Pyx_ExportFunction(\"tostring\", (void (*)(void))__pyx_f_9pywrapfst_tostring, \"std::string (PyObject *, struct __pyx_opt_args_9pywrapfst_tostring *__pyx_optional_args)\") < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  if (__Pyx_ExportFunction(\"weight_tostring\", (void (*)(void))__pyx_f_9pywrapfst_weight_tostring, \"std::string (PyObject *, struct __pyx_opt_args_9pywrapfst_weight_tostring *__pyx_optional_args)\") < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  if (__Pyx_ExportFunction(\"_get_compose_filter\", (void (*)(void))__pyx_f_9pywrapfst__get_compose_filter, \"enum fst::ComposeFilter (std::string const &)\") < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  if (__Pyx_ExportFunction(\"_get_determinize_type\", (void (*)(void))__pyx_f_9pywrapfst__get_determinize_type, \"enum fst::DeterminizeType (std::string const &)\") < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  if (__Pyx_ExportFunction(\"_get_queue_type\", (void (*)(void))__pyx_f_9pywrapfst__get_queue_type, \"enum fst::QueueType (std::string const &)\") < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  if (__Pyx_ExportFunction(\"_get_rand_arc_selection\", (void (*)(void))__pyx_f_9pywrapfst__get_rand_arc_selection, \"enum fst::script::RandArcSelection (std::string const &)\") < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  if (__Pyx_ExportFunction(\"_get_replace_label_type\", (void (*)(void))__pyx_f_9pywrapfst__get_replace_label_type, \"enum fst::ReplaceLabelType (std::string const &, bool)\") < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  if (__Pyx_ExportFunction(\"_get_WeightClass_or_One\", (void (*)(void))__pyx_f_9pywrapfst__get_WeightClass_or_One, \"fst::script::WeightClass (std::string const &, PyObject *)\") < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  if (__Pyx_ExportFunction(\"_get_WeightClass_or_Zero\", (void (*)(void))__pyx_f_9pywrapfst__get_WeightClass_or_Zero, \"fst::script::WeightClass (std::string const &, PyObject *)\") < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  if (__Pyx_ExportFunction(\"_Zero\", (void (*)(void))__pyx_f_9pywrapfst__Zero, \"struct __pyx_obj_9pywrapfst_Weight *(PyObject *)\") < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  if (__Pyx_ExportFunction(\"_One\", (void (*)(void))__pyx_f_9pywrapfst__One, \"struct __pyx_obj_9pywrapfst_Weight *(PyObject *)\") < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  if (__Pyx_ExportFunction(\"_NoWeight\", (void (*)(void))__pyx_f_9pywrapfst__NoWeight, \"struct __pyx_obj_9pywrapfst_Weight *(PyObject *)\") < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  if (__Pyx_ExportFunction(\"_plus\", (void (*)(void))__pyx_f_9pywrapfst__plus, \"struct __pyx_obj_9pywrapfst_Weight *(struct __pyx_obj_9pywrapfst_Weight *, struct __pyx_obj_9pywrapfst_Weight *)\") < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  if (__Pyx_ExportFunction(\"_times\", (void (*)(void))__pyx_f_9pywrapfst__times, \"struct __pyx_obj_9pywrapfst_Weight *(struct __pyx_obj_9pywrapfst_Weight *, struct __pyx_obj_9pywrapfst_Weight *)\") < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  if (__Pyx_ExportFunction(\"_divide\", (void (*)(void))__pyx_f_9pywrapfst__divide, \"struct __pyx_obj_9pywrapfst_Weight *(struct __pyx_obj_9pywrapfst_Weight *, struct __pyx_obj_9pywrapfst_Weight *)\") < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  if (__Pyx_ExportFunction(\"_power\", (void (*)(void))__pyx_f_9pywrapfst__power, \"struct __pyx_obj_9pywrapfst_Weight *(struct __pyx_obj_9pywrapfst_Weight *, size_t)\") < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  if (__Pyx_ExportFunction(\"_init_EncodeMapperSymbolTable\", (void (*)(void))__pyx_f_9pywrapfst__init_EncodeMapperSymbolTable, \"struct __pyx_obj_9pywrapfst__EncodeMapperSymbolTable *(fst::SymbolTable *, std::shared_ptr<fst::script::EncodeMapperClass> )\") < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  if (__Pyx_ExportFunction(\"_init_FstSymbolTable\", (void (*)(void))__pyx_f_9pywrapfst__init_FstSymbolTable, \"struct __pyx_obj_9pywrapfst__FstSymbolTable *(fst::SymbolTable *, std::shared_ptr<fst::script::FstClass> )\") < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  if (__Pyx_ExportFunction(\"_init_MutableFstSymbolTable\", (void (*)(void))__pyx_f_9pywrapfst__init_MutableFstSymbolTable, \"struct __pyx_obj_9pywrapfst__MutableFstSymbolTable *(fst::SymbolTable *, std::shared_ptr<fst::script::MutableFstClass> )\") < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  if (__Pyx_ExportFunction(\"_init_SymbolTable\", (void (*)(void))__pyx_f_9pywrapfst__init_SymbolTable, \"struct __pyx_obj_9pywrapfst_SymbolTable *(fst::SymbolTable *)\") < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  if (__Pyx_ExportFunction(\"_init_Fst\", (void (*)(void))__pyx_f_9pywrapfst__init_Fst, \"struct __pyx_obj_9pywrapfst__Fst *(__pyx_t_9pywrapfst_FstClass_ptr)\") < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  if (__Pyx_ExportFunction(\"_init_MutableFst\", (void (*)(void))__pyx_f_9pywrapfst__init_MutableFst, \"struct __pyx_obj_9pywrapfst__MutableFst *(__pyx_t_9pywrapfst_MutableFstClass_ptr)\") < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  if (__Pyx_ExportFunction(\"_init_XFst\", (void (*)(void))__pyx_f_9pywrapfst__init_XFst, \"struct __pyx_obj_9pywrapfst__Fst *(__pyx_t_9pywrapfst_FstClass_ptr)\") < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  if (__Pyx_ExportFunction(\"_create_Fst\", (void (*)(void))__pyx_f_9pywrapfst__create_Fst, \"struct __pyx_obj_9pywrapfst__MutableFst *(struct __pyx_opt_args_9pywrapfst__create_Fst *__pyx_optional_args)\") < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  if (__Pyx_ExportFunction(\"_read\", (void (*)(void))__pyx_f_9pywrapfst__read, \"struct __pyx_obj_9pywrapfst__Fst *(PyObject *, int __pyx_skip_dispatch)\") < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  if (__Pyx_ExportFunction(\"_read_from_string\", (void (*)(void))__pyx_f_9pywrapfst__read_from_string, \"struct __pyx_obj_9pywrapfst__Fst *(PyObject *, int __pyx_skip_dispatch)\") < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  if (__Pyx_ExportFunction(\"_init_Arc\", (void (*)(void))__pyx_f_9pywrapfst__init_Arc, \"struct __pyx_obj_9pywrapfst_Arc *(fst::script::ArcClass const &)\") < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  if (__Pyx_ExportFunction(\"_map\", (void (*)(void))__pyx_f_9pywrapfst__map, \"struct __pyx_obj_9pywrapfst__Fst *(struct __pyx_obj_9pywrapfst__Fst *, struct __pyx_opt_args_9pywrapfst__map *__pyx_optional_args)\") < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  if (__Pyx_ExportFunction(\"arcmap\", (void (*)(void))__pyx_f_9pywrapfst_arcmap, \"struct __pyx_obj_9pywrapfst__Fst *(struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_arcmap *__pyx_optional_args)\") < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  if (__Pyx_ExportFunction(\"compose\", (void (*)(void))__pyx_f_9pywrapfst_compose, \"struct __pyx_obj_9pywrapfst__MutableFst *(struct __pyx_obj_9pywrapfst__Fst *, struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_compose *__pyx_optional_args)\") < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  if (__Pyx_ExportFunction(\"convert\", (void (*)(void))__pyx_f_9pywrapfst_convert, \"struct __pyx_obj_9pywrapfst__Fst *(struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_convert *__pyx_optional_args)\") < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  if (__Pyx_ExportFunction(\"determinize\", (void (*)(void))__pyx_f_9pywrapfst_determinize, \"struct __pyx_obj_9pywrapfst__MutableFst *(struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_determinize *__pyx_optional_args)\") < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  if (__Pyx_ExportFunction(\"difference\", (void (*)(void))__pyx_f_9pywrapfst_difference, \"struct __pyx_obj_9pywrapfst__MutableFst *(struct __pyx_obj_9pywrapfst__Fst *, struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_difference *__pyx_optional_args)\") < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  if (__Pyx_ExportFunction(\"disambiguate\", (void (*)(void))__pyx_f_9pywrapfst_disambiguate, \"struct __pyx_obj_9pywrapfst__MutableFst *(struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_disambiguate *__pyx_optional_args)\") < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  if (__Pyx_ExportFunction(\"epsnormalize\", (void (*)(void))__pyx_f_9pywrapfst_epsnormalize, \"struct __pyx_obj_9pywrapfst__MutableFst *(struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_epsnormalize *__pyx_optional_args)\") < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  if (__Pyx_ExportFunction(\"equal\", (void (*)(void))__pyx_f_9pywrapfst_equal, \"bool (struct __pyx_obj_9pywrapfst__Fst *, struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_equal *__pyx_optional_args)\") < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  if (__Pyx_ExportFunction(\"equivalent\", (void (*)(void))__pyx_f_9pywrapfst_equivalent, \"bool (struct __pyx_obj_9pywrapfst__Fst *, struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_equivalent *__pyx_optional_args)\") < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  if (__Pyx_ExportFunction(\"intersect\", (void (*)(void))__pyx_f_9pywrapfst_intersect, \"struct __pyx_obj_9pywrapfst__MutableFst *(struct __pyx_obj_9pywrapfst__Fst *, struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_intersect *__pyx_optional_args)\") < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  if (__Pyx_ExportFunction(\"isomorphic\", (void (*)(void))__pyx_f_9pywrapfst_isomorphic, \"bool (struct __pyx_obj_9pywrapfst__Fst *, struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_isomorphic *__pyx_optional_args)\") < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  if (__Pyx_ExportFunction(\"prune\", (void (*)(void))__pyx_f_9pywrapfst_prune, \"struct __pyx_obj_9pywrapfst__MutableFst *(struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_prune *__pyx_optional_args)\") < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  if (__Pyx_ExportFunction(\"push\", (void (*)(void))__pyx_f_9pywrapfst_push, \"struct __pyx_obj_9pywrapfst__MutableFst *(struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_push *__pyx_optional_args)\") < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  if (__Pyx_ExportFunction(\"randequivalent\", (void (*)(void))__pyx_f_9pywrapfst_randequivalent, \"bool (struct __pyx_obj_9pywrapfst__Fst *, struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_randequivalent *__pyx_optional_args)\") < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  if (__Pyx_ExportFunction(\"randgen\", (void (*)(void))__pyx_f_9pywrapfst_randgen, \"struct __pyx_obj_9pywrapfst__MutableFst *(struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_randgen *__pyx_optional_args)\") < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  if (__Pyx_ExportFunction(\"replace\", (void (*)(void))__pyx_f_9pywrapfst_replace, \"struct __pyx_obj_9pywrapfst__MutableFst *(PyObject *, int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_replace *__pyx_optional_args)\") < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  if (__Pyx_ExportFunction(\"reverse\", (void (*)(void))__pyx_f_9pywrapfst_reverse, \"struct __pyx_obj_9pywrapfst__MutableFst *(struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_reverse *__pyx_optional_args)\") < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  if (__Pyx_ExportFunction(\"_shortestdistance\", (void (*)(void))__pyx_f_9pywrapfst__shortestdistance, \"std::vector<fst::script::WeightClass>  *(struct __pyx_obj_9pywrapfst__Fst *, struct __pyx_opt_args_9pywrapfst__shortestdistance *__pyx_optional_args)\") < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  if (__Pyx_ExportFunction(\"shortestpath\", (void (*)(void))__pyx_f_9pywrapfst_shortestpath, \"struct __pyx_obj_9pywrapfst__MutableFst *(struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_shortestpath *__pyx_optional_args)\") < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  if (__Pyx_ExportFunction(\"statemap\", (void (*)(void))__pyx_f_9pywrapfst_statemap, \"struct __pyx_obj_9pywrapfst__Fst *(struct __pyx_obj_9pywrapfst__Fst *, PyObject *, int __pyx_skip_dispatch)\") < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  if (__Pyx_ExportFunction(\"synchronize\", (void (*)(void))__pyx_f_9pywrapfst_synchronize, \"struct __pyx_obj_9pywrapfst__MutableFst *(struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch)\") < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  /*--- Type init code ---*/\n  __pyx_vtabptr_9pywrapfst_Weight = &__pyx_vtable_9pywrapfst_Weight;\n  __pyx_vtable_9pywrapfst_Weight._check_weight = (void (*)(struct __pyx_obj_9pywrapfst_Weight *))__pyx_f_9pywrapfst_6Weight__check_weight;\n  __pyx_vtable_9pywrapfst_Weight.copy = (struct __pyx_obj_9pywrapfst_Weight *(*)(struct __pyx_obj_9pywrapfst_Weight *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_6Weight_copy;\n  __pyx_vtable_9pywrapfst_Weight.to_string = (std::string (*)(struct __pyx_obj_9pywrapfst_Weight *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_6Weight_to_string;\n  __pyx_vtable_9pywrapfst_Weight.type = (std::string (*)(struct __pyx_obj_9pywrapfst_Weight *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_6Weight_type;\n  if (PyType_Ready(&__pyx_type_9pywrapfst_Weight) < 0) __PYX_ERR(0, 348, __pyx_L1_error)\n  __pyx_type_9pywrapfst_Weight.tp_print = 0;\n  if (__Pyx_SetVtable(__pyx_type_9pywrapfst_Weight.tp_dict, __pyx_vtabptr_9pywrapfst_Weight) < 0) __PYX_ERR(0, 348, __pyx_L1_error)\n  if (PyObject_SetAttrString(__pyx_m, \"Weight\", (PyObject *)&__pyx_type_9pywrapfst_Weight) < 0) __PYX_ERR(0, 348, __pyx_L1_error)\n  if (__Pyx_setup_reduce((PyObject*)&__pyx_type_9pywrapfst_Weight) < 0) __PYX_ERR(0, 348, __pyx_L1_error)\n  __pyx_ptype_9pywrapfst_Weight = &__pyx_type_9pywrapfst_Weight;\n  __pyx_vtabptr_9pywrapfst__SymbolTable = &__pyx_vtable_9pywrapfst__SymbolTable;\n  __pyx_vtable_9pywrapfst__SymbolTable.available_key = (__pyx_t_10basictypes_int64 (*)(struct __pyx_obj_9pywrapfst__SymbolTable *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_12_SymbolTable_available_key;\n  __pyx_vtable_9pywrapfst__SymbolTable.checksum = (std::string (*)(struct __pyx_obj_9pywrapfst__SymbolTable *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_12_SymbolTable_checksum;\n  __pyx_vtable_9pywrapfst__SymbolTable.copy = (struct __pyx_obj_9pywrapfst_SymbolTable *(*)(struct __pyx_obj_9pywrapfst__SymbolTable *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_12_SymbolTable_copy;\n  __pyx_vtable_9pywrapfst__SymbolTable.get_nth_key = (__pyx_t_10basictypes_int64 (*)(struct __pyx_obj_9pywrapfst__SymbolTable *, Py_ssize_t, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_12_SymbolTable_get_nth_key;\n  __pyx_vtable_9pywrapfst__SymbolTable.labeled_checksum = (std::string (*)(struct __pyx_obj_9pywrapfst__SymbolTable *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_12_SymbolTable_labeled_checksum;\n  __pyx_vtable_9pywrapfst__SymbolTable.member = (bool (*)(struct __pyx_obj_9pywrapfst__SymbolTable *, PyObject *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_12_SymbolTable_member;\n  __pyx_vtable_9pywrapfst__SymbolTable.name = (std::string (*)(struct __pyx_obj_9pywrapfst__SymbolTable *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_12_SymbolTable_name;\n  __pyx_vtable_9pywrapfst__SymbolTable.num_symbols = (size_t (*)(struct __pyx_obj_9pywrapfst__SymbolTable *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_12_SymbolTable_num_symbols;\n  __pyx_vtable_9pywrapfst__SymbolTable.write = (void (*)(struct __pyx_obj_9pywrapfst__SymbolTable *, PyObject *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_12_SymbolTable_write;\n  __pyx_vtable_9pywrapfst__SymbolTable.write_text = (void (*)(struct __pyx_obj_9pywrapfst__SymbolTable *, PyObject *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_12_SymbolTable_write_text;\n  if (PyType_Ready(&__pyx_type_9pywrapfst__SymbolTable) < 0) __PYX_ERR(0, 675, __pyx_L1_error)\n  __pyx_type_9pywrapfst__SymbolTable.tp_print = 0;\n  if (__Pyx_SetVtable(__pyx_type_9pywrapfst__SymbolTable.tp_dict, __pyx_vtabptr_9pywrapfst__SymbolTable) < 0) __PYX_ERR(0, 675, __pyx_L1_error)\n  if (PyObject_SetAttrString(__pyx_m, \"_SymbolTable\", (PyObject *)&__pyx_type_9pywrapfst__SymbolTable) < 0) __PYX_ERR(0, 675, __pyx_L1_error)\n  if (__Pyx_setup_reduce((PyObject*)&__pyx_type_9pywrapfst__SymbolTable) < 0) __PYX_ERR(0, 675, __pyx_L1_error)\n  __pyx_ptype_9pywrapfst__SymbolTable = &__pyx_type_9pywrapfst__SymbolTable;\n  __pyx_vtabptr_9pywrapfst__EncodeMapperSymbolTable = &__pyx_vtable_9pywrapfst__EncodeMapperSymbolTable;\n  __pyx_vtable_9pywrapfst__EncodeMapperSymbolTable.__pyx_base = *__pyx_vtabptr_9pywrapfst__SymbolTable;\n  __pyx_type_9pywrapfst__EncodeMapperSymbolTable.tp_base = __pyx_ptype_9pywrapfst__SymbolTable;\n  if (PyType_Ready(&__pyx_type_9pywrapfst__EncodeMapperSymbolTable) < 0) __PYX_ERR(0, 839, __pyx_L1_error)\n  __pyx_type_9pywrapfst__EncodeMapperSymbolTable.tp_print = 0;\n  if (__Pyx_SetVtable(__pyx_type_9pywrapfst__EncodeMapperSymbolTable.tp_dict, __pyx_vtabptr_9pywrapfst__EncodeMapperSymbolTable) < 0) __PYX_ERR(0, 839, __pyx_L1_error)\n  if (PyObject_SetAttrString(__pyx_m, \"_EncodeMapperSymbolTable\", (PyObject *)&__pyx_type_9pywrapfst__EncodeMapperSymbolTable) < 0) __PYX_ERR(0, 839, __pyx_L1_error)\n  if (__Pyx_setup_reduce((PyObject*)&__pyx_type_9pywrapfst__EncodeMapperSymbolTable) < 0) __PYX_ERR(0, 839, __pyx_L1_error)\n  __pyx_ptype_9pywrapfst__EncodeMapperSymbolTable = &__pyx_type_9pywrapfst__EncodeMapperSymbolTable;\n  __pyx_vtabptr_9pywrapfst__FstSymbolTable = &__pyx_vtable_9pywrapfst__FstSymbolTable;\n  __pyx_vtable_9pywrapfst__FstSymbolTable.__pyx_base = *__pyx_vtabptr_9pywrapfst__SymbolTable;\n  __pyx_type_9pywrapfst__FstSymbolTable.tp_base = __pyx_ptype_9pywrapfst__SymbolTable;\n  if (PyType_Ready(&__pyx_type_9pywrapfst__FstSymbolTable) < 0) __PYX_ERR(0, 859, __pyx_L1_error)\n  __pyx_type_9pywrapfst__FstSymbolTable.tp_print = 0;\n  if (__Pyx_SetVtable(__pyx_type_9pywrapfst__FstSymbolTable.tp_dict, __pyx_vtabptr_9pywrapfst__FstSymbolTable) < 0) __PYX_ERR(0, 859, __pyx_L1_error)\n  if (PyObject_SetAttrString(__pyx_m, \"_FstSymbolTable\", (PyObject *)&__pyx_type_9pywrapfst__FstSymbolTable) < 0) __PYX_ERR(0, 859, __pyx_L1_error)\n  if (__Pyx_setup_reduce((PyObject*)&__pyx_type_9pywrapfst__FstSymbolTable) < 0) __PYX_ERR(0, 859, __pyx_L1_error)\n  __pyx_ptype_9pywrapfst__FstSymbolTable = &__pyx_type_9pywrapfst__FstSymbolTable;\n  __pyx_vtabptr_9pywrapfst__MutableSymbolTable = &__pyx_vtable_9pywrapfst__MutableSymbolTable;\n  __pyx_vtable_9pywrapfst__MutableSymbolTable.__pyx_base = *__pyx_vtabptr_9pywrapfst__SymbolTable;\n  __pyx_vtable_9pywrapfst__MutableSymbolTable.add_symbol = (__pyx_t_10basictypes_int64 (*)(struct __pyx_obj_9pywrapfst__MutableSymbolTable *, PyObject *, int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_19_MutableSymbolTable_add_symbol *__pyx_optional_args))__pyx_f_9pywrapfst_19_MutableSymbolTable_add_symbol;\n  __pyx_vtable_9pywrapfst__MutableSymbolTable.add_table = (void (*)(struct __pyx_obj_9pywrapfst__MutableSymbolTable *, struct __pyx_obj_9pywrapfst__SymbolTable *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_19_MutableSymbolTable_add_table;\n  __pyx_vtable_9pywrapfst__MutableSymbolTable.set_name = (void (*)(struct __pyx_obj_9pywrapfst__MutableSymbolTable *, PyObject *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_19_MutableSymbolTable_set_name;\n  __pyx_type_9pywrapfst__MutableSymbolTable.tp_base = __pyx_ptype_9pywrapfst__SymbolTable;\n  if (PyType_Ready(&__pyx_type_9pywrapfst__MutableSymbolTable) < 0) __PYX_ERR(0, 878, __pyx_L1_error)\n  __pyx_type_9pywrapfst__MutableSymbolTable.tp_print = 0;\n  if (__Pyx_SetVtable(__pyx_type_9pywrapfst__MutableSymbolTable.tp_dict, __pyx_vtabptr_9pywrapfst__MutableSymbolTable) < 0) __PYX_ERR(0, 878, __pyx_L1_error)\n  if (PyObject_SetAttrString(__pyx_m, \"_MutableSymbolTable\", (PyObject *)&__pyx_type_9pywrapfst__MutableSymbolTable) < 0) __PYX_ERR(0, 878, __pyx_L1_error)\n  if (__Pyx_setup_reduce((PyObject*)&__pyx_type_9pywrapfst__MutableSymbolTable) < 0) __PYX_ERR(0, 878, __pyx_L1_error)\n  __pyx_ptype_9pywrapfst__MutableSymbolTable = &__pyx_type_9pywrapfst__MutableSymbolTable;\n  __pyx_vtabptr_9pywrapfst__MutableFstSymbolTable = &__pyx_vtable_9pywrapfst__MutableFstSymbolTable;\n  __pyx_vtable_9pywrapfst__MutableFstSymbolTable.__pyx_base = *__pyx_vtabptr_9pywrapfst__MutableSymbolTable;\n  __pyx_type_9pywrapfst__MutableFstSymbolTable.tp_base = __pyx_ptype_9pywrapfst__MutableSymbolTable;\n  if (PyType_Ready(&__pyx_type_9pywrapfst__MutableFstSymbolTable) < 0) __PYX_ERR(0, 930, __pyx_L1_error)\n  __pyx_type_9pywrapfst__MutableFstSymbolTable.tp_print = 0;\n  if (__Pyx_SetVtable(__pyx_type_9pywrapfst__MutableFstSymbolTable.tp_dict, __pyx_vtabptr_9pywrapfst__MutableFstSymbolTable) < 0) __PYX_ERR(0, 930, __pyx_L1_error)\n  if (PyObject_SetAttrString(__pyx_m, \"_MutableFstSymbolTable\", (PyObject *)&__pyx_type_9pywrapfst__MutableFstSymbolTable) < 0) __PYX_ERR(0, 930, __pyx_L1_error)\n  if (__Pyx_setup_reduce((PyObject*)&__pyx_type_9pywrapfst__MutableFstSymbolTable) < 0) __PYX_ERR(0, 930, __pyx_L1_error)\n  __pyx_ptype_9pywrapfst__MutableFstSymbolTable = &__pyx_type_9pywrapfst__MutableFstSymbolTable;\n  __pyx_vtabptr_9pywrapfst_SymbolTable = &__pyx_vtable_9pywrapfst_SymbolTable;\n  __pyx_vtable_9pywrapfst_SymbolTable.__pyx_base = *__pyx_vtabptr_9pywrapfst__MutableSymbolTable;\n  __pyx_type_9pywrapfst_SymbolTable.tp_base = __pyx_ptype_9pywrapfst__MutableSymbolTable;\n  if (PyType_Ready(&__pyx_type_9pywrapfst_SymbolTable) < 0) __PYX_ERR(0, 941, __pyx_L1_error)\n  __pyx_type_9pywrapfst_SymbolTable.tp_print = 0;\n  if (__Pyx_SetVtable(__pyx_type_9pywrapfst_SymbolTable.tp_dict, __pyx_vtabptr_9pywrapfst_SymbolTable) < 0) __PYX_ERR(0, 941, __pyx_L1_error)\n  if (PyObject_SetAttrString(__pyx_m, \"SymbolTable\", (PyObject *)&__pyx_type_9pywrapfst_SymbolTable) < 0) __PYX_ERR(0, 941, __pyx_L1_error)\n  if (__Pyx_setup_reduce((PyObject*)&__pyx_type_9pywrapfst_SymbolTable) < 0) __PYX_ERR(0, 941, __pyx_L1_error)\n  __pyx_ptype_9pywrapfst_SymbolTable = &__pyx_type_9pywrapfst_SymbolTable;\n  __pyx_vtabptr_9pywrapfst_SymbolTableIterator = &__pyx_vtable_9pywrapfst_SymbolTableIterator;\n  __pyx_vtable_9pywrapfst_SymbolTableIterator.done = (bool (*)(struct __pyx_obj_9pywrapfst_SymbolTableIterator *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_19SymbolTableIterator_done;\n  __pyx_vtable_9pywrapfst_SymbolTableIterator.next = (void (*)(struct __pyx_obj_9pywrapfst_SymbolTableIterator *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_19SymbolTableIterator_next;\n  __pyx_vtable_9pywrapfst_SymbolTableIterator.reset = (void (*)(struct __pyx_obj_9pywrapfst_SymbolTableIterator *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_19SymbolTableIterator_reset;\n  __pyx_vtable_9pywrapfst_SymbolTableIterator.symbol = (std::string (*)(struct __pyx_obj_9pywrapfst_SymbolTableIterator *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_19SymbolTableIterator_symbol;\n  __pyx_vtable_9pywrapfst_SymbolTableIterator.value = (__pyx_t_10basictypes_int64 (*)(struct __pyx_obj_9pywrapfst_SymbolTableIterator *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_19SymbolTableIterator_value;\n  if (PyType_Ready(&__pyx_type_9pywrapfst_SymbolTableIterator) < 0) __PYX_ERR(0, 1124, __pyx_L1_error)\n  __pyx_type_9pywrapfst_SymbolTableIterator.tp_print = 0;\n  if (__Pyx_SetVtable(__pyx_type_9pywrapfst_SymbolTableIterator.tp_dict, __pyx_vtabptr_9pywrapfst_SymbolTableIterator) < 0) __PYX_ERR(0, 1124, __pyx_L1_error)\n  if (PyObject_SetAttrString(__pyx_m, \"SymbolTableIterator\", (PyObject *)&__pyx_type_9pywrapfst_SymbolTableIterator) < 0) __PYX_ERR(0, 1124, __pyx_L1_error)\n  if (__Pyx_setup_reduce((PyObject*)&__pyx_type_9pywrapfst_SymbolTableIterator) < 0) __PYX_ERR(0, 1124, __pyx_L1_error)\n  __pyx_ptype_9pywrapfst_SymbolTableIterator = &__pyx_type_9pywrapfst_SymbolTableIterator;\n  __pyx_vtabptr_9pywrapfst_EncodeMapper = &__pyx_vtable_9pywrapfst_EncodeMapper;\n  __pyx_vtable_9pywrapfst_EncodeMapper.arc_type = (std::string (*)(struct __pyx_obj_9pywrapfst_EncodeMapper *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_12EncodeMapper_arc_type;\n  __pyx_vtable_9pywrapfst_EncodeMapper.flags = (__pyx_t_10basictypes_uint32 (*)(struct __pyx_obj_9pywrapfst_EncodeMapper *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_12EncodeMapper_flags;\n  __pyx_vtable_9pywrapfst_EncodeMapper.input_symbols = (struct __pyx_obj_9pywrapfst__EncodeMapperSymbolTable *(*)(struct __pyx_obj_9pywrapfst_EncodeMapper *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_12EncodeMapper_input_symbols;\n  __pyx_vtable_9pywrapfst_EncodeMapper.output_symbols = (struct __pyx_obj_9pywrapfst__EncodeMapperSymbolTable *(*)(struct __pyx_obj_9pywrapfst_EncodeMapper *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_12EncodeMapper_output_symbols;\n  __pyx_vtable_9pywrapfst_EncodeMapper.properties = (__pyx_t_10basictypes_uint64 (*)(struct __pyx_obj_9pywrapfst_EncodeMapper *, __pyx_t_10basictypes_uint64, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_12EncodeMapper_properties;\n  __pyx_vtable_9pywrapfst_EncodeMapper.set_input_symbols = (void (*)(struct __pyx_obj_9pywrapfst_EncodeMapper *, struct __pyx_obj_9pywrapfst__SymbolTable *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_12EncodeMapper_set_input_symbols;\n  __pyx_vtable_9pywrapfst_EncodeMapper.set_output_symbols = (void (*)(struct __pyx_obj_9pywrapfst_EncodeMapper *, struct __pyx_obj_9pywrapfst__SymbolTable *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_12EncodeMapper_set_output_symbols;\n  __pyx_vtable_9pywrapfst_EncodeMapper.weight_type = (std::string (*)(struct __pyx_obj_9pywrapfst_EncodeMapper *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_12EncodeMapper_weight_type;\n  if (PyType_Ready(&__pyx_type_9pywrapfst_EncodeMapper) < 0) __PYX_ERR(0, 1206, __pyx_L1_error)\n  __pyx_type_9pywrapfst_EncodeMapper.tp_print = 0;\n  #if CYTHON_COMPILING_IN_CPYTHON\n  {\n    PyObject *wrapper = PyObject_GetAttrString((PyObject *)&__pyx_type_9pywrapfst_EncodeMapper, \"__call__\"); if (unlikely(!wrapper)) __PYX_ERR(0, 1206, __pyx_L1_error)\n    if (Py_TYPE(wrapper) == &PyWrapperDescr_Type) {\n      __pyx_wrapperbase_9pywrapfst_12EncodeMapper_6__call__ = *((PyWrapperDescrObject *)wrapper)->d_base;\n      __pyx_wrapperbase_9pywrapfst_12EncodeMapper_6__call__.doc = __pyx_doc_9pywrapfst_12EncodeMapper_6__call__;\n      ((PyWrapperDescrObject *)wrapper)->d_base = &__pyx_wrapperbase_9pywrapfst_12EncodeMapper_6__call__;\n    }\n  }\n  #endif\n  if (__Pyx_SetVtable(__pyx_type_9pywrapfst_EncodeMapper.tp_dict, __pyx_vtabptr_9pywrapfst_EncodeMapper) < 0) __PYX_ERR(0, 1206, __pyx_L1_error)\n  if (PyObject_SetAttrString(__pyx_m, \"EncodeMapper\", (PyObject *)&__pyx_type_9pywrapfst_EncodeMapper) < 0) __PYX_ERR(0, 1206, __pyx_L1_error)\n  if (__Pyx_setup_reduce((PyObject*)&__pyx_type_9pywrapfst_EncodeMapper) < 0) __PYX_ERR(0, 1206, __pyx_L1_error)\n  __pyx_ptype_9pywrapfst_EncodeMapper = &__pyx_type_9pywrapfst_EncodeMapper;\n  __pyx_vtabptr_9pywrapfst__Fst = &__pyx_vtable_9pywrapfst__Fst;\n  __pyx_vtable_9pywrapfst__Fst.arc_type = (std::string (*)(struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_4_Fst_arc_type;\n  __pyx_vtable_9pywrapfst__Fst.arcs = (struct __pyx_obj_9pywrapfst_ArcIterator *(*)(struct __pyx_obj_9pywrapfst__Fst *, __pyx_t_10basictypes_int64, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_4_Fst_arcs;\n  __pyx_vtable_9pywrapfst__Fst.copy = (struct __pyx_obj_9pywrapfst__Fst *(*)(struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_4_Fst_copy;\n  __pyx_vtable_9pywrapfst__Fst.draw = (void (*)(struct __pyx_obj_9pywrapfst__Fst *, PyObject *, int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_4_Fst_draw *__pyx_optional_args))__pyx_f_9pywrapfst_4_Fst_draw;\n  __pyx_vtable_9pywrapfst__Fst.final = (struct __pyx_obj_9pywrapfst_Weight *(*)(struct __pyx_obj_9pywrapfst__Fst *, __pyx_t_10basictypes_int64, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_4_Fst_final;\n  __pyx_vtable_9pywrapfst__Fst.fst_type = (std::string (*)(struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_4_Fst_fst_type;\n  __pyx_vtable_9pywrapfst__Fst.input_symbols = (struct __pyx_obj_9pywrapfst__FstSymbolTable *(*)(struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_4_Fst_input_symbols;\n  __pyx_vtable_9pywrapfst__Fst.num_arcs = (size_t (*)(struct __pyx_obj_9pywrapfst__Fst *, __pyx_t_10basictypes_int64, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_4_Fst_num_arcs;\n  __pyx_vtable_9pywrapfst__Fst.num_input_epsilons = (size_t (*)(struct __pyx_obj_9pywrapfst__Fst *, __pyx_t_10basictypes_int64, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_4_Fst_num_input_epsilons;\n  __pyx_vtable_9pywrapfst__Fst.num_output_epsilons = (size_t (*)(struct __pyx_obj_9pywrapfst__Fst *, __pyx_t_10basictypes_int64, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_4_Fst_num_output_epsilons;\n  __pyx_vtable_9pywrapfst__Fst.output_symbols = (struct __pyx_obj_9pywrapfst__FstSymbolTable *(*)(struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_4_Fst_output_symbols;\n  __pyx_vtable_9pywrapfst__Fst.properties = (__pyx_t_10basictypes_uint64 (*)(struct __pyx_obj_9pywrapfst__Fst *, __pyx_t_10basictypes_uint64, bool, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_4_Fst_properties;\n  __pyx_vtable_9pywrapfst__Fst.start = (__pyx_t_10basictypes_int64 (*)(struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_4_Fst_start;\n  __pyx_vtable_9pywrapfst__Fst.states = (struct __pyx_obj_9pywrapfst_StateIterator *(*)(struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_4_Fst_states;\n  __pyx_vtable_9pywrapfst__Fst.text = (std::string (*)(struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_4_Fst_text *__pyx_optional_args))__pyx_f_9pywrapfst_4_Fst_text;\n  __pyx_vtable_9pywrapfst__Fst.verify = (bool (*)(struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_4_Fst_verify;\n  __pyx_vtable_9pywrapfst__Fst.weight_type = (std::string (*)(struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_4_Fst_weight_type;\n  __pyx_vtable_9pywrapfst__Fst.write = (void (*)(struct __pyx_obj_9pywrapfst__Fst *, PyObject *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_4_Fst_write;\n  __pyx_vtable_9pywrapfst__Fst.write_to_string = (std::string (*)(struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_4_Fst_write_to_string;\n  if (PyType_Ready(&__pyx_type_9pywrapfst__Fst) < 0) __PYX_ERR(0, 1362, __pyx_L1_error)\n  __pyx_type_9pywrapfst__Fst.tp_print = 0;\n  if (__Pyx_SetVtable(__pyx_type_9pywrapfst__Fst.tp_dict, __pyx_vtabptr_9pywrapfst__Fst) < 0) __PYX_ERR(0, 1362, __pyx_L1_error)\n  if (PyObject_SetAttrString(__pyx_m, \"_Fst\", (PyObject *)&__pyx_type_9pywrapfst__Fst) < 0) __PYX_ERR(0, 1362, __pyx_L1_error)\n  __pyx_ptype_9pywrapfst__Fst = &__pyx_type_9pywrapfst__Fst;\n  __pyx_vtabptr_9pywrapfst__MutableFst = &__pyx_vtable_9pywrapfst__MutableFst;\n  __pyx_vtable_9pywrapfst__MutableFst.__pyx_base = *__pyx_vtabptr_9pywrapfst__Fst;\n  __pyx_vtable_9pywrapfst__MutableFst._check_mutating_imethod = (void (*)(struct __pyx_obj_9pywrapfst__MutableFst *))__pyx_f_9pywrapfst_11_MutableFst__check_mutating_imethod;\n  __pyx_vtable_9pywrapfst__MutableFst._add_arc = (void (*)(struct __pyx_obj_9pywrapfst__MutableFst *, __pyx_t_10basictypes_int64, struct __pyx_obj_9pywrapfst_Arc *))__pyx_f_9pywrapfst_11_MutableFst__add_arc;\n  __pyx_vtable_9pywrapfst__MutableFst.add_state = (__pyx_t_10basictypes_int64 (*)(struct __pyx_obj_9pywrapfst__MutableFst *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_11_MutableFst_add_state;\n  __pyx_vtable_9pywrapfst__MutableFst._arcsort = (void (*)(struct __pyx_obj_9pywrapfst__MutableFst *, struct __pyx_opt_args_9pywrapfst_11_MutableFst__arcsort *__pyx_optional_args))__pyx_f_9pywrapfst_11_MutableFst__arcsort;\n  __pyx_vtable_9pywrapfst__MutableFst._closure = (void (*)(struct __pyx_obj_9pywrapfst__MutableFst *, struct __pyx_opt_args_9pywrapfst_11_MutableFst__closure *__pyx_optional_args))__pyx_f_9pywrapfst_11_MutableFst__closure;\n  __pyx_vtable_9pywrapfst__MutableFst._concat = (void (*)(struct __pyx_obj_9pywrapfst__MutableFst *, struct __pyx_obj_9pywrapfst__Fst *))__pyx_f_9pywrapfst_11_MutableFst__concat;\n  __pyx_vtable_9pywrapfst__MutableFst._connect = (void (*)(struct __pyx_obj_9pywrapfst__MutableFst *))__pyx_f_9pywrapfst_11_MutableFst__connect;\n  __pyx_vtable_9pywrapfst__MutableFst._decode = (void (*)(struct __pyx_obj_9pywrapfst__MutableFst *, struct __pyx_obj_9pywrapfst_EncodeMapper *))__pyx_f_9pywrapfst_11_MutableFst__decode;\n  __pyx_vtable_9pywrapfst__MutableFst._delete_arcs = (void (*)(struct __pyx_obj_9pywrapfst__MutableFst *, __pyx_t_10basictypes_int64, struct __pyx_opt_args_9pywrapfst_11_MutableFst__delete_arcs *__pyx_optional_args))__pyx_f_9pywrapfst_11_MutableFst__delete_arcs;\n  __pyx_vtable_9pywrapfst__MutableFst._delete_states = (void (*)(struct __pyx_obj_9pywrapfst__MutableFst *, struct __pyx_opt_args_9pywrapfst_11_MutableFst__delete_states *__pyx_optional_args))__pyx_f_9pywrapfst_11_MutableFst__delete_states;\n  __pyx_vtable_9pywrapfst__MutableFst._encode = (void (*)(struct __pyx_obj_9pywrapfst__MutableFst *, struct __pyx_obj_9pywrapfst_EncodeMapper *))__pyx_f_9pywrapfst_11_MutableFst__encode;\n  __pyx_vtable_9pywrapfst__MutableFst._invert = (void (*)(struct __pyx_obj_9pywrapfst__MutableFst *))__pyx_f_9pywrapfst_11_MutableFst__invert;\n  __pyx_vtable_9pywrapfst__MutableFst._minimize = (void (*)(struct __pyx_obj_9pywrapfst__MutableFst *, struct __pyx_opt_args_9pywrapfst_11_MutableFst__minimize *__pyx_optional_args))__pyx_f_9pywrapfst_11_MutableFst__minimize;\n  __pyx_vtable_9pywrapfst__MutableFst.mutable_arcs = (struct __pyx_obj_9pywrapfst_MutableArcIterator *(*)(struct __pyx_obj_9pywrapfst__MutableFst *, __pyx_t_10basictypes_int64, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_11_MutableFst_mutable_arcs;\n  __pyx_vtable_9pywrapfst__MutableFst.num_states = (__pyx_t_10basictypes_int64 (*)(struct __pyx_obj_9pywrapfst__MutableFst *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_11_MutableFst_num_states;\n  __pyx_vtable_9pywrapfst__MutableFst._project = (void (*)(struct __pyx_obj_9pywrapfst__MutableFst *, struct __pyx_opt_args_9pywrapfst_11_MutableFst__project *__pyx_optional_args))__pyx_f_9pywrapfst_11_MutableFst__project;\n  __pyx_vtable_9pywrapfst__MutableFst._prune = (void (*)(struct __pyx_obj_9pywrapfst__MutableFst *, struct __pyx_opt_args_9pywrapfst_11_MutableFst__prune *__pyx_optional_args))__pyx_f_9pywrapfst_11_MutableFst__prune;\n  __pyx_vtable_9pywrapfst__MutableFst._push = (void (*)(struct __pyx_obj_9pywrapfst__MutableFst *, struct __pyx_opt_args_9pywrapfst_11_MutableFst__push *__pyx_optional_args))__pyx_f_9pywrapfst_11_MutableFst__push;\n  __pyx_vtable_9pywrapfst__MutableFst._relabel_pairs = (void (*)(struct __pyx_obj_9pywrapfst__MutableFst *, struct __pyx_opt_args_9pywrapfst_11_MutableFst__relabel_pairs *__pyx_optional_args))__pyx_f_9pywrapfst_11_MutableFst__relabel_pairs;\n  __pyx_vtable_9pywrapfst__MutableFst._relabel_tables = (void (*)(struct __pyx_obj_9pywrapfst__MutableFst *, struct __pyx_opt_args_9pywrapfst_11_MutableFst__relabel_tables *__pyx_optional_args))__pyx_f_9pywrapfst_11_MutableFst__relabel_tables;\n  __pyx_vtable_9pywrapfst__MutableFst._reserve_arcs = (void (*)(struct __pyx_obj_9pywrapfst__MutableFst *, __pyx_t_10basictypes_int64, size_t))__pyx_f_9pywrapfst_11_MutableFst__reserve_arcs;\n  __pyx_vtable_9pywrapfst__MutableFst._reserve_states = (void (*)(struct __pyx_obj_9pywrapfst__MutableFst *, __pyx_t_10basictypes_int64))__pyx_f_9pywrapfst_11_MutableFst__reserve_states;\n  __pyx_vtable_9pywrapfst__MutableFst._reweight = (void (*)(struct __pyx_obj_9pywrapfst__MutableFst *, PyObject *, struct __pyx_opt_args_9pywrapfst_11_MutableFst__reweight *__pyx_optional_args))__pyx_f_9pywrapfst_11_MutableFst__reweight;\n  __pyx_vtable_9pywrapfst__MutableFst._rmepsilon = (void (*)(struct __pyx_obj_9pywrapfst__MutableFst *, struct __pyx_opt_args_9pywrapfst_11_MutableFst__rmepsilon *__pyx_optional_args))__pyx_f_9pywrapfst_11_MutableFst__rmepsilon;\n  __pyx_vtable_9pywrapfst__MutableFst._set_final = (void (*)(struct __pyx_obj_9pywrapfst__MutableFst *, __pyx_t_10basictypes_int64, struct __pyx_opt_args_9pywrapfst_11_MutableFst__set_final *__pyx_optional_args))__pyx_f_9pywrapfst_11_MutableFst__set_final;\n  __pyx_vtable_9pywrapfst__MutableFst._set_properties = (void (*)(struct __pyx_obj_9pywrapfst__MutableFst *, __pyx_t_10basictypes_uint64, __pyx_t_10basictypes_uint64))__pyx_f_9pywrapfst_11_MutableFst__set_properties;\n  __pyx_vtable_9pywrapfst__MutableFst._set_start = (void (*)(struct __pyx_obj_9pywrapfst__MutableFst *, __pyx_t_10basictypes_int64))__pyx_f_9pywrapfst_11_MutableFst__set_start;\n  __pyx_vtable_9pywrapfst__MutableFst._set_input_symbols = (void (*)(struct __pyx_obj_9pywrapfst__MutableFst *, struct __pyx_obj_9pywrapfst__SymbolTable *))__pyx_f_9pywrapfst_11_MutableFst__set_input_symbols;\n  __pyx_vtable_9pywrapfst__MutableFst._set_output_symbols = (void (*)(struct __pyx_obj_9pywrapfst__MutableFst *, struct __pyx_obj_9pywrapfst__SymbolTable *))__pyx_f_9pywrapfst_11_MutableFst__set_output_symbols;\n  __pyx_vtable_9pywrapfst__MutableFst._topsort = (void (*)(struct __pyx_obj_9pywrapfst__MutableFst *))__pyx_f_9pywrapfst_11_MutableFst__topsort;\n  __pyx_vtable_9pywrapfst__MutableFst._union = (void (*)(struct __pyx_obj_9pywrapfst__MutableFst *, struct __pyx_obj_9pywrapfst__Fst *))__pyx_f_9pywrapfst_11_MutableFst__union;\n  __pyx_type_9pywrapfst__MutableFst.tp_base = __pyx_ptype_9pywrapfst__Fst;\n  if (PyType_Ready(&__pyx_type_9pywrapfst__MutableFst) < 0) __PYX_ERR(0, 1774, __pyx_L1_error)\n  __pyx_type_9pywrapfst__MutableFst.tp_print = 0;\n  if (__Pyx_SetVtable(__pyx_type_9pywrapfst__MutableFst.tp_dict, __pyx_vtabptr_9pywrapfst__MutableFst) < 0) __PYX_ERR(0, 1774, __pyx_L1_error)\n  if (PyObject_SetAttrString(__pyx_m, \"_MutableFst\", (PyObject *)&__pyx_type_9pywrapfst__MutableFst) < 0) __PYX_ERR(0, 1774, __pyx_L1_error)\n  __pyx_ptype_9pywrapfst__MutableFst = &__pyx_type_9pywrapfst__MutableFst;\n  __pyx_vtabptr_9pywrapfst_Arc = &__pyx_vtable_9pywrapfst_Arc;\n  __pyx_vtable_9pywrapfst_Arc.copy = (struct __pyx_obj_9pywrapfst_Arc *(*)(struct __pyx_obj_9pywrapfst_Arc *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_3Arc_copy;\n  if (PyType_Ready(&__pyx_type_9pywrapfst_Arc) < 0) __PYX_ERR(0, 2898, __pyx_L1_error)\n  __pyx_type_9pywrapfst_Arc.tp_print = 0;\n  if (__Pyx_SetVtable(__pyx_type_9pywrapfst_Arc.tp_dict, __pyx_vtabptr_9pywrapfst_Arc) < 0) __PYX_ERR(0, 2898, __pyx_L1_error)\n  if (PyObject_SetAttrString(__pyx_m, \"Arc\", (PyObject *)&__pyx_type_9pywrapfst_Arc) < 0) __PYX_ERR(0, 2898, __pyx_L1_error)\n  if (__Pyx_setup_reduce((PyObject*)&__pyx_type_9pywrapfst_Arc) < 0) __PYX_ERR(0, 2898, __pyx_L1_error)\n  __pyx_ptype_9pywrapfst_Arc = &__pyx_type_9pywrapfst_Arc;\n  __pyx_vtabptr_9pywrapfst_ArcIterator = &__pyx_vtable_9pywrapfst_ArcIterator;\n  __pyx_vtable_9pywrapfst_ArcIterator.done = (bool (*)(struct __pyx_obj_9pywrapfst_ArcIterator *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_11ArcIterator_done;\n  __pyx_vtable_9pywrapfst_ArcIterator.flags = (__pyx_t_10basictypes_uint32 (*)(struct __pyx_obj_9pywrapfst_ArcIterator *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_11ArcIterator_flags;\n  __pyx_vtable_9pywrapfst_ArcIterator.next = (void (*)(struct __pyx_obj_9pywrapfst_ArcIterator *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_11ArcIterator_next;\n  __pyx_vtable_9pywrapfst_ArcIterator.position = (size_t (*)(struct __pyx_obj_9pywrapfst_ArcIterator *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_11ArcIterator_position;\n  __pyx_vtable_9pywrapfst_ArcIterator.reset = (void (*)(struct __pyx_obj_9pywrapfst_ArcIterator *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_11ArcIterator_reset;\n  __pyx_vtable_9pywrapfst_ArcIterator.seek = (void (*)(struct __pyx_obj_9pywrapfst_ArcIterator *, size_t, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_11ArcIterator_seek;\n  __pyx_vtable_9pywrapfst_ArcIterator.set_flags = (void (*)(struct __pyx_obj_9pywrapfst_ArcIterator *, __pyx_t_10basictypes_uint32, __pyx_t_10basictypes_uint32, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_11ArcIterator_set_flags;\n  __pyx_vtable_9pywrapfst_ArcIterator.value = (PyObject *(*)(struct __pyx_obj_9pywrapfst_ArcIterator *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_11ArcIterator_value;\n  if (PyType_Ready(&__pyx_type_9pywrapfst_ArcIterator) < 0) __PYX_ERR(0, 2965, __pyx_L1_error)\n  __pyx_type_9pywrapfst_ArcIterator.tp_print = 0;\n  if (__Pyx_SetVtable(__pyx_type_9pywrapfst_ArcIterator.tp_dict, __pyx_vtabptr_9pywrapfst_ArcIterator) < 0) __PYX_ERR(0, 2965, __pyx_L1_error)\n  if (PyObject_SetAttrString(__pyx_m, \"ArcIterator\", (PyObject *)&__pyx_type_9pywrapfst_ArcIterator) < 0) __PYX_ERR(0, 2965, __pyx_L1_error)\n  if (__Pyx_setup_reduce((PyObject*)&__pyx_type_9pywrapfst_ArcIterator) < 0) __PYX_ERR(0, 2965, __pyx_L1_error)\n  __pyx_ptype_9pywrapfst_ArcIterator = &__pyx_type_9pywrapfst_ArcIterator;\n  __pyx_vtabptr_9pywrapfst_MutableArcIterator = &__pyx_vtable_9pywrapfst_MutableArcIterator;\n  __pyx_vtable_9pywrapfst_MutableArcIterator.done = (bool (*)(struct __pyx_obj_9pywrapfst_MutableArcIterator *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_18MutableArcIterator_done;\n  __pyx_vtable_9pywrapfst_MutableArcIterator.flags = (__pyx_t_10basictypes_uint32 (*)(struct __pyx_obj_9pywrapfst_MutableArcIterator *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_18MutableArcIterator_flags;\n  __pyx_vtable_9pywrapfst_MutableArcIterator.next = (void (*)(struct __pyx_obj_9pywrapfst_MutableArcIterator *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_18MutableArcIterator_next;\n  __pyx_vtable_9pywrapfst_MutableArcIterator.position = (size_t (*)(struct __pyx_obj_9pywrapfst_MutableArcIterator *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_18MutableArcIterator_position;\n  __pyx_vtable_9pywrapfst_MutableArcIterator.reset = (void (*)(struct __pyx_obj_9pywrapfst_MutableArcIterator *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_18MutableArcIterator_reset;\n  __pyx_vtable_9pywrapfst_MutableArcIterator.seek = (void (*)(struct __pyx_obj_9pywrapfst_MutableArcIterator *, size_t, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_18MutableArcIterator_seek;\n  __pyx_vtable_9pywrapfst_MutableArcIterator.set_flags = (void (*)(struct __pyx_obj_9pywrapfst_MutableArcIterator *, __pyx_t_10basictypes_uint32, __pyx_t_10basictypes_uint32, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_18MutableArcIterator_set_flags;\n  __pyx_vtable_9pywrapfst_MutableArcIterator.set_value = (void (*)(struct __pyx_obj_9pywrapfst_MutableArcIterator *, struct __pyx_obj_9pywrapfst_Arc *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_18MutableArcIterator_set_value;\n  __pyx_vtable_9pywrapfst_MutableArcIterator.value = (PyObject *(*)(struct __pyx_obj_9pywrapfst_MutableArcIterator *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_18MutableArcIterator_value;\n  if (PyType_Ready(&__pyx_type_9pywrapfst_MutableArcIterator) < 0) __PYX_ERR(0, 3076, __pyx_L1_error)\n  __pyx_type_9pywrapfst_MutableArcIterator.tp_print = 0;\n  if (__Pyx_SetVtable(__pyx_type_9pywrapfst_MutableArcIterator.tp_dict, __pyx_vtabptr_9pywrapfst_MutableArcIterator) < 0) __PYX_ERR(0, 3076, __pyx_L1_error)\n  if (PyObject_SetAttrString(__pyx_m, \"MutableArcIterator\", (PyObject *)&__pyx_type_9pywrapfst_MutableArcIterator) < 0) __PYX_ERR(0, 3076, __pyx_L1_error)\n  if (__Pyx_setup_reduce((PyObject*)&__pyx_type_9pywrapfst_MutableArcIterator) < 0) __PYX_ERR(0, 3076, __pyx_L1_error)\n  __pyx_ptype_9pywrapfst_MutableArcIterator = &__pyx_type_9pywrapfst_MutableArcIterator;\n  __pyx_vtabptr_9pywrapfst_StateIterator = &__pyx_vtable_9pywrapfst_StateIterator;\n  __pyx_vtable_9pywrapfst_StateIterator.done = (bool (*)(struct __pyx_obj_9pywrapfst_StateIterator *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_13StateIterator_done;\n  __pyx_vtable_9pywrapfst_StateIterator.next = (void (*)(struct __pyx_obj_9pywrapfst_StateIterator *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_13StateIterator_next;\n  __pyx_vtable_9pywrapfst_StateIterator.reset = (void (*)(struct __pyx_obj_9pywrapfst_StateIterator *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_13StateIterator_reset;\n  __pyx_vtable_9pywrapfst_StateIterator.value = (__pyx_t_10basictypes_int64 (*)(struct __pyx_obj_9pywrapfst_StateIterator *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_13StateIterator_value;\n  if (PyType_Ready(&__pyx_type_9pywrapfst_StateIterator) < 0) __PYX_ERR(0, 3190, __pyx_L1_error)\n  __pyx_type_9pywrapfst_StateIterator.tp_print = 0;\n  if (__Pyx_SetVtable(__pyx_type_9pywrapfst_StateIterator.tp_dict, __pyx_vtabptr_9pywrapfst_StateIterator) < 0) __PYX_ERR(0, 3190, __pyx_L1_error)\n  if (PyObject_SetAttrString(__pyx_m, \"StateIterator\", (PyObject *)&__pyx_type_9pywrapfst_StateIterator) < 0) __PYX_ERR(0, 3190, __pyx_L1_error)\n  if (__Pyx_setup_reduce((PyObject*)&__pyx_type_9pywrapfst_StateIterator) < 0) __PYX_ERR(0, 3190, __pyx_L1_error)\n  __pyx_ptype_9pywrapfst_StateIterator = &__pyx_type_9pywrapfst_StateIterator;\n  __pyx_vtabptr_9pywrapfst_Compiler = &__pyx_vtable_9pywrapfst_Compiler;\n  __pyx_vtable_9pywrapfst_Compiler.compile = (struct __pyx_obj_9pywrapfst__Fst *(*)(struct __pyx_obj_9pywrapfst_Compiler *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_8Compiler_compile;\n  __pyx_vtable_9pywrapfst_Compiler.write = (void (*)(struct __pyx_obj_9pywrapfst_Compiler *, PyObject *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_8Compiler_write;\n  if (PyType_Ready(&__pyx_type_9pywrapfst_Compiler) < 0) __PYX_ERR(0, 4088, __pyx_L1_error)\n  __pyx_type_9pywrapfst_Compiler.tp_print = 0;\n  if (__Pyx_SetVtable(__pyx_type_9pywrapfst_Compiler.tp_dict, __pyx_vtabptr_9pywrapfst_Compiler) < 0) __PYX_ERR(0, 4088, __pyx_L1_error)\n  if (PyObject_SetAttrString(__pyx_m, \"Compiler\", (PyObject *)&__pyx_type_9pywrapfst_Compiler) < 0) __PYX_ERR(0, 4088, __pyx_L1_error)\n  if (__Pyx_setup_reduce((PyObject*)&__pyx_type_9pywrapfst_Compiler) < 0) __PYX_ERR(0, 4088, __pyx_L1_error)\n  __pyx_ptype_9pywrapfst_Compiler = &__pyx_type_9pywrapfst_Compiler;\n  __pyx_vtabptr_9pywrapfst_FarReader = &__pyx_vtable_9pywrapfst_FarReader;\n  __pyx_vtable_9pywrapfst_FarReader.arc_type = (std::string (*)(struct __pyx_obj_9pywrapfst_FarReader *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_9FarReader_arc_type;\n  __pyx_vtable_9pywrapfst_FarReader.done = (bool (*)(struct __pyx_obj_9pywrapfst_FarReader *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_9FarReader_done;\n  __pyx_vtable_9pywrapfst_FarReader.error = (bool (*)(struct __pyx_obj_9pywrapfst_FarReader *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_9FarReader_error;\n  __pyx_vtable_9pywrapfst_FarReader.far_type = (std::string (*)(struct __pyx_obj_9pywrapfst_FarReader *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_9FarReader_far_type;\n  __pyx_vtable_9pywrapfst_FarReader.find = (bool (*)(struct __pyx_obj_9pywrapfst_FarReader *, PyObject *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_9FarReader_find;\n  __pyx_vtable_9pywrapfst_FarReader.get_fst = (struct __pyx_obj_9pywrapfst__Fst *(*)(struct __pyx_obj_9pywrapfst_FarReader *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_9FarReader_get_fst;\n  __pyx_vtable_9pywrapfst_FarReader.get_key = (std::string (*)(struct __pyx_obj_9pywrapfst_FarReader *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_9FarReader_get_key;\n  __pyx_vtable_9pywrapfst_FarReader.next = (void (*)(struct __pyx_obj_9pywrapfst_FarReader *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_9FarReader_next;\n  __pyx_vtable_9pywrapfst_FarReader.reset = (void (*)(struct __pyx_obj_9pywrapfst_FarReader *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_9FarReader_reset;\n  if (PyType_Ready(&__pyx_type_9pywrapfst_FarReader) < 0) __PYX_ERR(0, 4215, __pyx_L1_error)\n  __pyx_type_9pywrapfst_FarReader.tp_print = 0;\n  if (__Pyx_SetVtable(__pyx_type_9pywrapfst_FarReader.tp_dict, __pyx_vtabptr_9pywrapfst_FarReader) < 0) __PYX_ERR(0, 4215, __pyx_L1_error)\n  if (PyObject_SetAttrString(__pyx_m, \"FarReader\", (PyObject *)&__pyx_type_9pywrapfst_FarReader) < 0) __PYX_ERR(0, 4215, __pyx_L1_error)\n  if (__Pyx_setup_reduce((PyObject*)&__pyx_type_9pywrapfst_FarReader) < 0) __PYX_ERR(0, 4215, __pyx_L1_error)\n  __pyx_ptype_9pywrapfst_FarReader = &__pyx_type_9pywrapfst_FarReader;\n  __pyx_vtabptr_9pywrapfst_FarWriter = &__pyx_vtable_9pywrapfst_FarWriter;\n  __pyx_vtable_9pywrapfst_FarWriter.arc_type = (std::string (*)(struct __pyx_obj_9pywrapfst_FarWriter *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_9FarWriter_arc_type;\n  __pyx_vtable_9pywrapfst_FarWriter.close = (void (*)(struct __pyx_obj_9pywrapfst_FarWriter *))__pyx_f_9pywrapfst_9FarWriter_close;\n  __pyx_vtable_9pywrapfst_FarWriter.add = (void (*)(struct __pyx_obj_9pywrapfst_FarWriter *, PyObject *, struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_9FarWriter_add;\n  __pyx_vtable_9pywrapfst_FarWriter.error = (bool (*)(struct __pyx_obj_9pywrapfst_FarWriter *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_9FarWriter_error;\n  __pyx_vtable_9pywrapfst_FarWriter.far_type = (std::string (*)(struct __pyx_obj_9pywrapfst_FarWriter *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_9FarWriter_far_type;\n  if (PyType_Ready(&__pyx_type_9pywrapfst_FarWriter) < 0) __PYX_ERR(0, 4360, __pyx_L1_error)\n  __pyx_type_9pywrapfst_FarWriter.tp_print = 0;\n  if (__Pyx_SetVtable(__pyx_type_9pywrapfst_FarWriter.tp_dict, __pyx_vtabptr_9pywrapfst_FarWriter) < 0) __PYX_ERR(0, 4360, __pyx_L1_error)\n  if (PyObject_SetAttrString(__pyx_m, \"FarWriter\", (PyObject *)&__pyx_type_9pywrapfst_FarWriter) < 0) __PYX_ERR(0, 4360, __pyx_L1_error)\n  if (__Pyx_setup_reduce((PyObject*)&__pyx_type_9pywrapfst_FarWriter) < 0) __PYX_ERR(0, 4360, __pyx_L1_error)\n  __pyx_ptype_9pywrapfst_FarWriter = &__pyx_type_9pywrapfst_FarWriter;\n  /*--- Type import code ---*/\n  /*--- Variable import code ---*/\n  /*--- Function import code ---*/\n  /*--- Execution code ---*/\n  #if defined(__Pyx_Generator_USED) || defined(__Pyx_Coroutine_USED)\n  if (__Pyx_patch_abc() < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  #endif\n\n  /* \"pywrapfst.pyx\":107\n * \n * # Python imports.\n * import atexit             # <<<<<<<<<<<<<<\n * import numbers\n * import subprocess\n */\n  __pyx_t_1 = __Pyx_Import(__pyx_n_s_atexit, 0, -1); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 107, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_atexit, __pyx_t_1) < 0) __PYX_ERR(0, 107, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":108\n * # Python imports.\n * import atexit\n * import numbers             # <<<<<<<<<<<<<<\n * import subprocess\n * import logging\n */\n  __pyx_t_1 = __Pyx_Import(__pyx_n_s_numbers, 0, -1); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 108, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_numbers, __pyx_t_1) < 0) __PYX_ERR(0, 108, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":109\n * import atexit\n * import numbers\n * import subprocess             # <<<<<<<<<<<<<<\n * import logging\n * \n */\n  __pyx_t_1 = __Pyx_Import(__pyx_n_s_subprocess, 0, -1); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 109, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_subprocess, __pyx_t_1) < 0) __PYX_ERR(0, 109, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":110\n * import numbers\n * import subprocess\n * import logging             # <<<<<<<<<<<<<<\n * \n * \n */\n  __pyx_t_1 = __Pyx_Import(__pyx_n_s_logging, 0, -1); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 110, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_logging, __pyx_t_1) < 0) __PYX_ERR(0, 110, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":115\n * # TODO(kbg): Figure out how to access static class variables so I don't have\n * # to do it this way.\n * kNoSymbol = -1             # <<<<<<<<<<<<<<\n * \n * \n */\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_kNoSymbol, __pyx_int_neg_1) < 0) __PYX_ERR(0, 115, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":121\n * \n * \n * class FstError(Exception):             # <<<<<<<<<<<<<<\n * \n *   pass\n */\n  __pyx_t_1 = PyTuple_New(1); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 121, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __Pyx_INCREF(((PyObject *)(&((PyTypeObject*)PyExc_Exception)[0])));\n  __Pyx_GIVEREF(((PyObject *)(&((PyTypeObject*)PyExc_Exception)[0])));\n  PyTuple_SET_ITEM(__pyx_t_1, 0, ((PyObject *)(&((PyTypeObject*)PyExc_Exception)[0])));\n  __pyx_t_2 = __Pyx_CalculateMetaclass(NULL, __pyx_t_1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 121, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  __pyx_t_3 = __Pyx_Py3MetaclassPrepare(__pyx_t_2, __pyx_t_1, __pyx_n_s_FstError, __pyx_n_s_FstError, (PyObject *) NULL, __pyx_n_s_pywrapfst_2, (PyObject *) NULL); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 121, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_3);\n  __pyx_t_4 = __Pyx_Py3ClassCreate(__pyx_t_2, __pyx_n_s_FstError, __pyx_t_1, __pyx_t_3, NULL, 0, 1); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 121, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_4);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_FstError, __pyx_t_4) < 0) __PYX_ERR(0, 121, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n  __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n  __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":126\n * \n * \n * class FstArgError(FstError, ValueError):             # <<<<<<<<<<<<<<\n * \n *   pass\n */\n  __pyx_t_1 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstError); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 126, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_t_2 = PyTuple_New(2); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 126, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  __Pyx_GIVEREF(__pyx_t_1);\n  PyTuple_SET_ITEM(__pyx_t_2, 0, __pyx_t_1);\n  __Pyx_INCREF(__pyx_builtin_ValueError);\n  __Pyx_GIVEREF(__pyx_builtin_ValueError);\n  PyTuple_SET_ITEM(__pyx_t_2, 1, __pyx_builtin_ValueError);\n  __pyx_t_1 = 0;\n  __pyx_t_1 = __Pyx_CalculateMetaclass(NULL, __pyx_t_2); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 126, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_t_3 = __Pyx_Py3MetaclassPrepare(__pyx_t_1, __pyx_t_2, __pyx_n_s_FstArgError, __pyx_n_s_FstArgError, (PyObject *) NULL, __pyx_n_s_pywrapfst_2, (PyObject *) NULL); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 126, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_3);\n  __pyx_t_4 = __Pyx_Py3ClassCreate(__pyx_t_1, __pyx_n_s_FstArgError, __pyx_t_2, __pyx_t_3, NULL, 0, 1); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 126, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_4);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_FstArgError, __pyx_t_4) < 0) __PYX_ERR(0, 126, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n  __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n\n  /* \"pywrapfst.pyx\":131\n * \n * \n * class FstBadWeightError(FstError, ValueError):             # <<<<<<<<<<<<<<\n * \n *   pass\n */\n  __pyx_t_2 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstError); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 131, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  __pyx_t_1 = PyTuple_New(2); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 131, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __Pyx_GIVEREF(__pyx_t_2);\n  PyTuple_SET_ITEM(__pyx_t_1, 0, __pyx_t_2);\n  __Pyx_INCREF(__pyx_builtin_ValueError);\n  __Pyx_GIVEREF(__pyx_builtin_ValueError);\n  PyTuple_SET_ITEM(__pyx_t_1, 1, __pyx_builtin_ValueError);\n  __pyx_t_2 = 0;\n  __pyx_t_2 = __Pyx_CalculateMetaclass(NULL, __pyx_t_1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 131, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  __pyx_t_3 = __Pyx_Py3MetaclassPrepare(__pyx_t_2, __pyx_t_1, __pyx_n_s_FstBadWeightError, __pyx_n_s_FstBadWeightError, (PyObject *) NULL, __pyx_n_s_pywrapfst_2, (PyObject *) NULL); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 131, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_3);\n  __pyx_t_4 = __Pyx_Py3ClassCreate(__pyx_t_2, __pyx_n_s_FstBadWeightError, __pyx_t_1, __pyx_t_3, NULL, 0, 1); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 131, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_4);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_FstBadWeightError, __pyx_t_4) < 0) __PYX_ERR(0, 131, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n  __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n  __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":136\n * \n * \n * class FstDeletedConstructorError(FstError, RuntimeError):             # <<<<<<<<<<<<<<\n * \n *   pass\n */\n  __pyx_t_1 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstError); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 136, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_t_2 = PyTuple_New(2); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 136, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  __Pyx_GIVEREF(__pyx_t_1);\n  PyTuple_SET_ITEM(__pyx_t_2, 0, __pyx_t_1);\n  __Pyx_INCREF(__pyx_builtin_RuntimeError);\n  __Pyx_GIVEREF(__pyx_builtin_RuntimeError);\n  PyTuple_SET_ITEM(__pyx_t_2, 1, __pyx_builtin_RuntimeError);\n  __pyx_t_1 = 0;\n  __pyx_t_1 = __Pyx_CalculateMetaclass(NULL, __pyx_t_2); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 136, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_t_3 = __Pyx_Py3MetaclassPrepare(__pyx_t_1, __pyx_t_2, __pyx_n_s_FstDeletedConstructorError, __pyx_n_s_FstDeletedConstructorError, (PyObject *) NULL, __pyx_n_s_pywrapfst_2, (PyObject *) NULL); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 136, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_3);\n  __pyx_t_4 = __Pyx_Py3ClassCreate(__pyx_t_1, __pyx_n_s_FstDeletedConstructorError, __pyx_t_2, __pyx_t_3, NULL, 0, 1); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 136, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_4);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_FstDeletedConstructorError, __pyx_t_4) < 0) __PYX_ERR(0, 136, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n  __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n\n  /* \"pywrapfst.pyx\":141\n * \n * \n * class FstIndexError(FstError, IndexError):             # <<<<<<<<<<<<<<\n * \n *   pass\n */\n  __pyx_t_2 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstError); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 141, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  __pyx_t_1 = PyTuple_New(2); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 141, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __Pyx_GIVEREF(__pyx_t_2);\n  PyTuple_SET_ITEM(__pyx_t_1, 0, __pyx_t_2);\n  __Pyx_INCREF(__pyx_builtin_IndexError);\n  __Pyx_GIVEREF(__pyx_builtin_IndexError);\n  PyTuple_SET_ITEM(__pyx_t_1, 1, __pyx_builtin_IndexError);\n  __pyx_t_2 = 0;\n  __pyx_t_2 = __Pyx_CalculateMetaclass(NULL, __pyx_t_1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 141, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  __pyx_t_3 = __Pyx_Py3MetaclassPrepare(__pyx_t_2, __pyx_t_1, __pyx_n_s_FstIndexError, __pyx_n_s_FstIndexError, (PyObject *) NULL, __pyx_n_s_pywrapfst_2, (PyObject *) NULL); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 141, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_3);\n  __pyx_t_4 = __Pyx_Py3ClassCreate(__pyx_t_2, __pyx_n_s_FstIndexError, __pyx_t_1, __pyx_t_3, NULL, 0, 1); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 141, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_4);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_FstIndexError, __pyx_t_4) < 0) __PYX_ERR(0, 141, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n  __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n  __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":146\n * \n * \n * class FstIOError(FstError, IOError):             # <<<<<<<<<<<<<<\n * \n *   pass\n */\n  __pyx_t_1 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstError); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 146, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_t_2 = PyTuple_New(2); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 146, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  __Pyx_GIVEREF(__pyx_t_1);\n  PyTuple_SET_ITEM(__pyx_t_2, 0, __pyx_t_1);\n  __Pyx_INCREF(__pyx_builtin_IOError);\n  __Pyx_GIVEREF(__pyx_builtin_IOError);\n  PyTuple_SET_ITEM(__pyx_t_2, 1, __pyx_builtin_IOError);\n  __pyx_t_1 = 0;\n  __pyx_t_1 = __Pyx_CalculateMetaclass(NULL, __pyx_t_2); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 146, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_t_3 = __Pyx_Py3MetaclassPrepare(__pyx_t_1, __pyx_t_2, __pyx_n_s_FstIOError, __pyx_n_s_FstIOError, (PyObject *) NULL, __pyx_n_s_pywrapfst_2, (PyObject *) NULL); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 146, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_3);\n  __pyx_t_4 = __Pyx_Py3ClassCreate(__pyx_t_1, __pyx_n_s_FstIOError, __pyx_t_2, __pyx_t_3, NULL, 0, 1); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 146, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_4);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_FstIOError, __pyx_t_4) < 0) __PYX_ERR(0, 146, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n  __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n\n  /* \"pywrapfst.pyx\":151\n * \n * \n * class FstOpError(FstError, RuntimeError):             # <<<<<<<<<<<<<<\n * \n *   pass\n */\n  __pyx_t_2 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstError); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 151, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  __pyx_t_1 = PyTuple_New(2); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 151, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __Pyx_GIVEREF(__pyx_t_2);\n  PyTuple_SET_ITEM(__pyx_t_1, 0, __pyx_t_2);\n  __Pyx_INCREF(__pyx_builtin_RuntimeError);\n  __Pyx_GIVEREF(__pyx_builtin_RuntimeError);\n  PyTuple_SET_ITEM(__pyx_t_1, 1, __pyx_builtin_RuntimeError);\n  __pyx_t_2 = 0;\n  __pyx_t_2 = __Pyx_CalculateMetaclass(NULL, __pyx_t_1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 151, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  __pyx_t_3 = __Pyx_Py3MetaclassPrepare(__pyx_t_2, __pyx_t_1, __pyx_n_s_FstOpError, __pyx_n_s_FstOpError, (PyObject *) NULL, __pyx_n_s_pywrapfst_2, (PyObject *) NULL); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 151, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_3);\n  __pyx_t_4 = __Pyx_Py3ClassCreate(__pyx_t_2, __pyx_n_s_FstOpError, __pyx_t_1, __pyx_t_3, NULL, 0, 1); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 151, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_4);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_FstOpError, __pyx_t_4) < 0) __PYX_ERR(0, 151, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n  __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n  __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":406\n * \n *   @classmethod\n *   def Zero(cls, weight_type):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     Weight.Zero(weight_type)\n */\n  __pyx_t_1 = __Pyx_GetNameInClass((PyObject *)__pyx_ptype_9pywrapfst_Weight, __pyx_n_s_Zero); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 406, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n\n  /* \"pywrapfst.pyx\":405\n *   # C++ part out-of-class and then call it from within.\n * \n *   @classmethod             # <<<<<<<<<<<<<<\n *   def Zero(cls, weight_type):\n *     \"\"\"\n */\n  __pyx_t_2 = __Pyx_Method_ClassMethod(__pyx_t_1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 405, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  if (PyDict_SetItem((PyObject *)__pyx_ptype_9pywrapfst_Weight->tp_dict, __pyx_n_s_Zero, __pyx_t_2) < 0) __PYX_ERR(0, 406, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n  PyType_Modified(__pyx_ptype_9pywrapfst_Weight);\n\n  /* \"pywrapfst.pyx\":415\n * \n *   @classmethod\n *   def One(cls, weight_type):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     Weight.One(weight_type)\n */\n  __pyx_t_2 = __Pyx_GetNameInClass((PyObject *)__pyx_ptype_9pywrapfst_Weight, __pyx_n_s_One); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 415, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n\n  /* \"pywrapfst.pyx\":414\n *     return _Zero(weight_type)\n * \n *   @classmethod             # <<<<<<<<<<<<<<\n *   def One(cls, weight_type):\n *     \"\"\"\n */\n  __pyx_t_1 = __Pyx_Method_ClassMethod(__pyx_t_2); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 414, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n  if (PyDict_SetItem((PyObject *)__pyx_ptype_9pywrapfst_Weight->tp_dict, __pyx_n_s_One, __pyx_t_1) < 0) __PYX_ERR(0, 415, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  PyType_Modified(__pyx_ptype_9pywrapfst_Weight);\n\n  /* \"pywrapfst.pyx\":424\n * \n *   @classmethod\n *   def NoWeight(cls, weight_type):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     Weight.NoWeight(weight_type)\n */\n  __pyx_t_1 = __Pyx_GetNameInClass((PyObject *)__pyx_ptype_9pywrapfst_Weight, __pyx_n_s_NoWeight); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 424, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n\n  /* \"pywrapfst.pyx\":423\n *     return _One(weight_type)\n * \n *   @classmethod             # <<<<<<<<<<<<<<\n *   def NoWeight(cls, weight_type):\n *     \"\"\"\n */\n  __pyx_t_2 = __Pyx_Method_ClassMethod(__pyx_t_1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 423, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  if (PyDict_SetItem((PyObject *)__pyx_ptype_9pywrapfst_Weight->tp_dict, __pyx_n_s_NoWeight, __pyx_t_2) < 0) __PYX_ERR(0, 424, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n  PyType_Modified(__pyx_ptype_9pywrapfst_Weight);\n\n  /* \"pywrapfst.pyx\":456\n * \n * \n * def plus(Weight lhs, Weight rhs):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   plus(lhs, rhs)\n */\n  __pyx_t_2 = PyCFunction_NewEx(&__pyx_mdef_9pywrapfst_1plus, NULL, __pyx_n_s_pywrapfst_2); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 456, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_plus, __pyx_t_2) < 0) __PYX_ERR(0, 456, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n\n  /* \"pywrapfst.pyx\":488\n * \n * \n * def times(Weight lhs, Weight rhs):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   times(lhs, rhs)\n */\n  __pyx_t_2 = PyCFunction_NewEx(&__pyx_mdef_9pywrapfst_3times, NULL, __pyx_n_s_pywrapfst_2); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 488, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_times, __pyx_t_2) < 0) __PYX_ERR(0, 488, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n\n  /* \"pywrapfst.pyx\":520\n * \n * \n * def divide(Weight lhs, Weight rhs):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   divide(lhs, rhs)\n */\n  __pyx_t_2 = PyCFunction_NewEx(&__pyx_mdef_9pywrapfst_5divide, NULL, __pyx_n_s_pywrapfst_2); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 520, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_divide, __pyx_t_2) < 0) __PYX_ERR(0, 520, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n\n  /* \"pywrapfst.pyx\":553\n * \n * \n * def power(Weight w, size_t n):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   power(lhs, rhs)\n */\n  __pyx_t_2 = PyCFunction_NewEx(&__pyx_mdef_9pywrapfst_7power, NULL, __pyx_n_s_pywrapfst_2); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 553, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_power, __pyx_t_2) < 0) __PYX_ERR(0, 553, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n\n  /* \"pywrapfst.pyx\":889\n *   \"\"\"\n * \n *   cpdef int64 add_symbol(self, symbol, int64 key=kNoSymbol):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     add_symbol(self, symbol, key=NO_SYMBOL)\n */\n  __pyx_t_2 = __Pyx_GetModuleGlobalName(__pyx_n_s_kNoSymbol); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 889, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  __pyx_t_5 = __Pyx_PyInt_As_int64_t(__pyx_t_2); if (unlikely((__pyx_t_5 == ((int64_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 889, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n  __pyx_k__13 = __pyx_t_5;\n  __pyx_t_2 = __Pyx_GetModuleGlobalName(__pyx_n_s_kNoSymbol); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 889, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  __pyx_t_5 = __Pyx_PyInt_As_int64_t(__pyx_t_2); if (unlikely((__pyx_t_5 == ((int64_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 889, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n  __pyx_k__13 = __pyx_t_5;\n\n  /* \"pywrapfst.pyx\":966\n * \n *   @classmethod\n *   def read(cls, filename):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     SymbolTable.read(filename)\n */\n  __pyx_t_2 = __Pyx_GetNameInClass((PyObject *)__pyx_ptype_9pywrapfst_SymbolTable, __pyx_n_s_read); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 966, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n\n  /* \"pywrapfst.pyx\":965\n *     self._smart_table.reset(self._table)\n * \n *   @classmethod             # <<<<<<<<<<<<<<\n *   def read(cls, filename):\n *     \"\"\"\n */\n  __pyx_t_1 = __Pyx_Method_ClassMethod(__pyx_t_2); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 965, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n  if (PyDict_SetItem((PyObject *)__pyx_ptype_9pywrapfst_SymbolTable->tp_dict, __pyx_n_s_read, __pyx_t_1) < 0) __PYX_ERR(0, 966, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  PyType_Modified(__pyx_ptype_9pywrapfst_SymbolTable);\n\n  /* \"pywrapfst.pyx\":988\n * \n *   @classmethod\n *   def read_text(cls, filename, bool allow_negative_labels=False):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     SymbolTable.read_text(filename)\n */\n  __pyx_t_1 = __Pyx_GetNameInClass((PyObject *)__pyx_ptype_9pywrapfst_SymbolTable, __pyx_n_s_read_text); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 988, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n\n  /* \"pywrapfst.pyx\":987\n *     return _init_SymbolTable(tsyms)\n * \n *   @classmethod             # <<<<<<<<<<<<<<\n *   def read_text(cls, filename, bool allow_negative_labels=False):\n *     \"\"\"\n */\n  __pyx_t_2 = __Pyx_Method_ClassMethod(__pyx_t_1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 987, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  if (PyDict_SetItem((PyObject *)__pyx_ptype_9pywrapfst_SymbolTable->tp_dict, __pyx_n_s_read_text, __pyx_t_2) < 0) __PYX_ERR(0, 988, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n  PyType_Modified(__pyx_ptype_9pywrapfst_SymbolTable);\n\n  /* \"pywrapfst.pyx\":1015\n * \n *   @classmethod\n *   def read_fst(cls, filename, bool input_table):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     SymbolTable.read_fst(filename, input_table)\n */\n  __pyx_t_2 = __Pyx_GetNameInClass((PyObject *)__pyx_ptype_9pywrapfst_SymbolTable, __pyx_n_s_read_fst); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1015, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n\n  /* \"pywrapfst.pyx\":1014\n *     return _init_SymbolTable(tsyms)\n * \n *   @classmethod             # <<<<<<<<<<<<<<\n *   def read_fst(cls, filename, bool input_table):\n *     \"\"\"\n */\n  __pyx_t_1 = __Pyx_Method_ClassMethod(__pyx_t_2); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1014, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n  if (PyDict_SetItem((PyObject *)__pyx_ptype_9pywrapfst_SymbolTable->tp_dict, __pyx_n_s_read_fst, __pyx_t_1) < 0) __PYX_ERR(0, 1015, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  PyType_Modified(__pyx_ptype_9pywrapfst_SymbolTable);\n\n  /* \"pywrapfst.pyx\":2064\n *     return self\n * \n *   cdef void _minimize(self, float delta=fst.kShortestDelta,             # <<<<<<<<<<<<<<\n *                       bool allow_nondet=False) except *:\n *     # This runs in-place when the second argument is null.\n */\n  __pyx_k__35 = fst::kShortestDelta;\n\n  /* \"pywrapfst.pyx\":2070\n *     self._check_mutating_imethod()\n * \n *   def minimize(self, float delta=fst.kShortestDelta, bool allow_nondet=False):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     minimize(self, delta=1e-6, allow_nondet=False)\n */\n  __pyx_k__36 = fst::kShortestDelta;\n\n  /* \"pywrapfst.pyx\":2170\n *     return self\n * \n *   cdef void _prune(self, float delta=fst.kDelta, int64 nstate=fst.kNoStateId,             # <<<<<<<<<<<<<<\n *                    weight=None) except *:\n *     # Threshold is set to semiring Zero (no pruning) if no weight is specified.\n */\n  __pyx_k__37 = fst::kDelta;\n  __pyx_k__38 = fst::kNoStateId;\n\n  /* \"pywrapfst.pyx\":2179\n * \n *   def prune(self,\n *             float delta=fst.kDelta,             # <<<<<<<<<<<<<<\n *             int64 nstate=fst.kNoStateId,\n *             weight=None):\n */\n  __pyx_k__39 = fst::kDelta;\n\n  /* \"pywrapfst.pyx\":2180\n *   def prune(self,\n *             float delta=fst.kDelta,\n *             int64 nstate=fst.kNoStateId,             # <<<<<<<<<<<<<<\n *             weight=None):\n *     \"\"\"\n */\n  __pyx_k__40 = fst::kNoStateId;\n\n  /* \"pywrapfst.pyx\":2207\n * \n *   cdef void _push(self,\n *                   float delta=fst.kDelta,             # <<<<<<<<<<<<<<\n *                   bool remove_total_weight=False,\n *                   bool to_final=False) except *:\n */\n  __pyx_k__41 = fst::kDelta;\n\n  /* \"pywrapfst.pyx\":2215\n * \n *   def push(self,\n *            float delta=fst.kDelta,             # <<<<<<<<<<<<<<\n *            bool remove_total_weight=False,\n *            bool to_final=False):\n */\n  __pyx_k__42 = fst::kDelta;\n\n  /* \"pywrapfst.pyx\":2452\n *                        bool connect=True,\n *                        weight=None,\n *                        int64 nstate=fst.kNoStateId,             # <<<<<<<<<<<<<<\n *                        float delta=fst.kShortestDelta) except *:\n *     cdef fst.WeightClass wc = _get_WeightClass_or_Zero(self.weight_type(),\n */\n  __pyx_k__46 = fst::kNoStateId;\n\n  /* \"pywrapfst.pyx\":2453\n *                        weight=None,\n *                        int64 nstate=fst.kNoStateId,\n *                        float delta=fst.kShortestDelta) except *:             # <<<<<<<<<<<<<<\n *     cdef fst.WeightClass wc = _get_WeightClass_or_Zero(self.weight_type(),\n *                                                        weight)\n */\n  __pyx_k__47 = fst::kShortestDelta;\n\n  /* \"pywrapfst.pyx\":2466\n *                 bool connect=True,\n *                 weight=None,\n *                 int64 nstate=fst.kNoStateId,             # <<<<<<<<<<<<<<\n *                 float delta=fst.kShortestDelta):\n *     \"\"\"\n */\n  __pyx_k__48 = fst::kNoStateId;\n\n  /* \"pywrapfst.pyx\":2467\n *                 weight=None,\n *                 int64 nstate=fst.kNoStateId,\n *                 float delta=fst.kShortestDelta):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     rmepsilon(self, queue_type=\"auto\", connect=True, weight=None,\n */\n  __pyx_k__49 = fst::kShortestDelta;\n\n  /* \"pywrapfst.pyx\":2742\n * \n * \n * class Fst(object):             # <<<<<<<<<<<<<<\n * \n *    \"\"\"\n */\n  __pyx_t_1 = __Pyx_CalculateMetaclass(NULL, __pyx_tuple__107); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2742, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_t_2 = __Pyx_Py3MetaclassPrepare(__pyx_t_1, __pyx_tuple__107, __pyx_n_s_Fst, __pyx_n_s_Fst, (PyObject *) NULL, __pyx_n_s_pywrapfst_2, __pyx_kp_s_Fst_arc_type_standard_Construct); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 2742, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n\n  /* \"pywrapfst.pyx\":2759\n *    \"\"\"\n * \n *    def __new__(cls, arc_type=b\"standard\"):             # <<<<<<<<<<<<<<\n *     return _create_Fst(arc_type)\n * \n */\n  __pyx_t_3 = __Pyx_CyFunction_NewEx(&__pyx_mdef_9pywrapfst_3Fst_1__new__, __Pyx_CYFUNCTION_STATICMETHOD, __pyx_n_s_Fst___new, NULL, __pyx_n_s_pywrapfst_2, __pyx_d, ((PyObject *)__pyx_codeobj__109)); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 2759, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_3);\n  __Pyx_CyFunction_SetDefaultsTuple(__pyx_t_3, __pyx_tuple__110);\n  if (PyObject_SetItem(__pyx_t_2, __pyx_n_s_new, __pyx_t_3) < 0) __PYX_ERR(0, 2759, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n\n  /* \"pywrapfst.pyx\":2763\n * \n *    @staticmethod\n *    def read(filename):             # <<<<<<<<<<<<<<\n *      \"\"\"\n *      read(filename):\n */\n  __pyx_t_3 = __Pyx_CyFunction_NewEx(&__pyx_mdef_9pywrapfst_3Fst_3read, __Pyx_CYFUNCTION_STATICMETHOD, __pyx_n_s_Fst_read, NULL, __pyx_n_s_pywrapfst_2, __pyx_d, ((PyObject *)__pyx_codeobj__112)); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 2763, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_3);\n\n  /* \"pywrapfst.pyx\":2762\n *     return _create_Fst(arc_type)\n * \n *    @staticmethod             # <<<<<<<<<<<<<<\n *    def read(filename):\n *      \"\"\"\n */\n  __pyx_t_4 = PyTuple_New(1); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 2762, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_4);\n  __Pyx_GIVEREF(__pyx_t_3);\n  PyTuple_SET_ITEM(__pyx_t_4, 0, __pyx_t_3);\n  __pyx_t_3 = 0;\n  __pyx_t_3 = __Pyx_PyObject_Call(__pyx_builtin_staticmethod, __pyx_t_4, NULL); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 2762, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_3);\n  __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n  if (PyObject_SetItem(__pyx_t_2, __pyx_n_s_read, __pyx_t_3) < 0) __PYX_ERR(0, 2763, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n\n  /* \"pywrapfst.pyx\":2781\n * \n *    @staticmethod\n *    def read_from_string(state):             # <<<<<<<<<<<<<<\n *      \"\"\"\n *      read_from_string(string, fst_type=None)\n */\n  __pyx_t_3 = __Pyx_CyFunction_NewEx(&__pyx_mdef_9pywrapfst_3Fst_5read_from_string, __Pyx_CYFUNCTION_STATICMETHOD, __pyx_n_s_Fst_read_from_string, NULL, __pyx_n_s_pywrapfst_2, __pyx_d, ((PyObject *)__pyx_codeobj__114)); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 2781, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_3);\n\n  /* \"pywrapfst.pyx\":2780\n *      return _read(filename)\n * \n *    @staticmethod             # <<<<<<<<<<<<<<\n *    def read_from_string(state):\n *      \"\"\"\n */\n  __pyx_t_4 = PyTuple_New(1); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 2780, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_4);\n  __Pyx_GIVEREF(__pyx_t_3);\n  PyTuple_SET_ITEM(__pyx_t_4, 0, __pyx_t_3);\n  __pyx_t_3 = 0;\n  __pyx_t_3 = __Pyx_PyObject_Call(__pyx_builtin_staticmethod, __pyx_t_4, NULL); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 2780, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_3);\n  __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n  if (PyObject_SetItem(__pyx_t_2, __pyx_n_s_read_from_string_2, __pyx_t_3) < 0) __PYX_ERR(0, 2781, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n\n  /* \"pywrapfst.pyx\":2742\n * \n * \n * class Fst(object):             # <<<<<<<<<<<<<<\n * \n *    \"\"\"\n */\n  __pyx_t_3 = __Pyx_Py3ClassCreate(__pyx_t_1, __pyx_n_s_Fst, __pyx_tuple__107, __pyx_t_2, NULL, 0, 1); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 2742, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_3);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_Fst, __pyx_t_3) < 0) __PYX_ERR(0, 2742, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n  __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2805\n * \n * \n * NO_LABEL = fst.kNoLabel             # <<<<<<<<<<<<<<\n * NO_STATE_ID = fst.kNoStateId\n * # TODO(kbg): Figure out how to access static class variables so I don't have\n */\n  __pyx_t_1 = __Pyx_PyInt_From_int(fst::kNoLabel); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2805, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_NO_LABEL, __pyx_t_1) < 0) __PYX_ERR(0, 2805, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2806\n * \n * NO_LABEL = fst.kNoLabel\n * NO_STATE_ID = fst.kNoStateId             # <<<<<<<<<<<<<<\n * # TODO(kbg): Figure out how to access static class variables so I don't have\n * # to do it this way.\n */\n  __pyx_t_1 = __Pyx_PyInt_From_int(fst::kNoStateId); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2806, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_NO_STATE_ID, __pyx_t_1) < 0) __PYX_ERR(0, 2806, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2809\n * # TODO(kbg): Figure out how to access static class variables so I don't have\n * # to do it this way.\n * NO_SYMBOL = kNoSymbol             # <<<<<<<<<<<<<<\n * \n * \n */\n  __pyx_t_1 = __Pyx_GetModuleGlobalName(__pyx_n_s_kNoSymbol); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2809, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_NO_SYMBOL, __pyx_t_1) < 0) __PYX_ERR(0, 2809, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2815\n * \n * \n * EXPANDED = fst.kExpanded             # <<<<<<<<<<<<<<\n * MUTABLE = fst.kMutable\n * ERROR = fst.kError\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kExpanded); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2815, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_EXPANDED, __pyx_t_1) < 0) __PYX_ERR(0, 2815, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2816\n * \n * EXPANDED = fst.kExpanded\n * MUTABLE = fst.kMutable             # <<<<<<<<<<<<<<\n * ERROR = fst.kError\n * ACCEPTOR = fst.kAcceptor\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kMutable); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2816, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_MUTABLE, __pyx_t_1) < 0) __PYX_ERR(0, 2816, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2817\n * EXPANDED = fst.kExpanded\n * MUTABLE = fst.kMutable\n * ERROR = fst.kError             # <<<<<<<<<<<<<<\n * ACCEPTOR = fst.kAcceptor\n * NOT_ACCEPTOR = fst.kNotAcceptor\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kError); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2817, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_ERROR, __pyx_t_1) < 0) __PYX_ERR(0, 2817, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2818\n * MUTABLE = fst.kMutable\n * ERROR = fst.kError\n * ACCEPTOR = fst.kAcceptor             # <<<<<<<<<<<<<<\n * NOT_ACCEPTOR = fst.kNotAcceptor\n * I_DETERMINISTIC = fst.kIDeterministic\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kAcceptor); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2818, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_ACCEPTOR, __pyx_t_1) < 0) __PYX_ERR(0, 2818, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2819\n * ERROR = fst.kError\n * ACCEPTOR = fst.kAcceptor\n * NOT_ACCEPTOR = fst.kNotAcceptor             # <<<<<<<<<<<<<<\n * I_DETERMINISTIC = fst.kIDeterministic\n * NON_I_DETERMINISTIC = fst.kNonIDeterministic\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kNotAcceptor); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2819, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_NOT_ACCEPTOR, __pyx_t_1) < 0) __PYX_ERR(0, 2819, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2820\n * ACCEPTOR = fst.kAcceptor\n * NOT_ACCEPTOR = fst.kNotAcceptor\n * I_DETERMINISTIC = fst.kIDeterministic             # <<<<<<<<<<<<<<\n * NON_I_DETERMINISTIC = fst.kNonIDeterministic\n * O_DETERMINISTIC = fst.kODeterministic\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kIDeterministic); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2820, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_I_DETERMINISTIC, __pyx_t_1) < 0) __PYX_ERR(0, 2820, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2821\n * NOT_ACCEPTOR = fst.kNotAcceptor\n * I_DETERMINISTIC = fst.kIDeterministic\n * NON_I_DETERMINISTIC = fst.kNonIDeterministic             # <<<<<<<<<<<<<<\n * O_DETERMINISTIC = fst.kODeterministic\n * NON_O_DETERMINISTIC = fst.kNonODeterministic\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kNonIDeterministic); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2821, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_NON_I_DETERMINISTIC, __pyx_t_1) < 0) __PYX_ERR(0, 2821, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2822\n * I_DETERMINISTIC = fst.kIDeterministic\n * NON_I_DETERMINISTIC = fst.kNonIDeterministic\n * O_DETERMINISTIC = fst.kODeterministic             # <<<<<<<<<<<<<<\n * NON_O_DETERMINISTIC = fst.kNonODeterministic\n * EPSILONS = fst.kEpsilons\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kODeterministic); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2822, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_O_DETERMINISTIC, __pyx_t_1) < 0) __PYX_ERR(0, 2822, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2823\n * NON_I_DETERMINISTIC = fst.kNonIDeterministic\n * O_DETERMINISTIC = fst.kODeterministic\n * NON_O_DETERMINISTIC = fst.kNonODeterministic             # <<<<<<<<<<<<<<\n * EPSILONS = fst.kEpsilons\n * NO_EPSILONS = fst.kNoEpsilons\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kNonODeterministic); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2823, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_NON_O_DETERMINISTIC, __pyx_t_1) < 0) __PYX_ERR(0, 2823, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2824\n * O_DETERMINISTIC = fst.kODeterministic\n * NON_O_DETERMINISTIC = fst.kNonODeterministic\n * EPSILONS = fst.kEpsilons             # <<<<<<<<<<<<<<\n * NO_EPSILONS = fst.kNoEpsilons\n * I_EPSILONS = fst.kIEpsilons\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kEpsilons); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2824, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_EPSILONS, __pyx_t_1) < 0) __PYX_ERR(0, 2824, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2825\n * NON_O_DETERMINISTIC = fst.kNonODeterministic\n * EPSILONS = fst.kEpsilons\n * NO_EPSILONS = fst.kNoEpsilons             # <<<<<<<<<<<<<<\n * I_EPSILONS = fst.kIEpsilons\n * NO_I_EPSILONS = fst.kNoIEpsilons\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kNoEpsilons); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2825, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_NO_EPSILONS, __pyx_t_1) < 0) __PYX_ERR(0, 2825, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2826\n * EPSILONS = fst.kEpsilons\n * NO_EPSILONS = fst.kNoEpsilons\n * I_EPSILONS = fst.kIEpsilons             # <<<<<<<<<<<<<<\n * NO_I_EPSILONS = fst.kNoIEpsilons\n * O_EPSILONS = fst.kOEpsilons\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kIEpsilons); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2826, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_I_EPSILONS, __pyx_t_1) < 0) __PYX_ERR(0, 2826, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2827\n * NO_EPSILONS = fst.kNoEpsilons\n * I_EPSILONS = fst.kIEpsilons\n * NO_I_EPSILONS = fst.kNoIEpsilons             # <<<<<<<<<<<<<<\n * O_EPSILONS = fst.kOEpsilons\n * NO_O_EPSILONS = fst.kNoOEpsilons\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kNoIEpsilons); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2827, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_NO_I_EPSILONS, __pyx_t_1) < 0) __PYX_ERR(0, 2827, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2828\n * I_EPSILONS = fst.kIEpsilons\n * NO_I_EPSILONS = fst.kNoIEpsilons\n * O_EPSILONS = fst.kOEpsilons             # <<<<<<<<<<<<<<\n * NO_O_EPSILONS = fst.kNoOEpsilons\n * I_LABEL_SORTED = fst.kILabelSorted\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kOEpsilons); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2828, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_O_EPSILONS, __pyx_t_1) < 0) __PYX_ERR(0, 2828, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2829\n * NO_I_EPSILONS = fst.kNoIEpsilons\n * O_EPSILONS = fst.kOEpsilons\n * NO_O_EPSILONS = fst.kNoOEpsilons             # <<<<<<<<<<<<<<\n * I_LABEL_SORTED = fst.kILabelSorted\n * NOT_I_LABEL_SORTED = fst.kNotILabelSorted\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kNoOEpsilons); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2829, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_NO_O_EPSILONS, __pyx_t_1) < 0) __PYX_ERR(0, 2829, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2830\n * O_EPSILONS = fst.kOEpsilons\n * NO_O_EPSILONS = fst.kNoOEpsilons\n * I_LABEL_SORTED = fst.kILabelSorted             # <<<<<<<<<<<<<<\n * NOT_I_LABEL_SORTED = fst.kNotILabelSorted\n * O_LABEL_SORTED = fst.kOLabelSorted\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kILabelSorted); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2830, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_I_LABEL_SORTED, __pyx_t_1) < 0) __PYX_ERR(0, 2830, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2831\n * NO_O_EPSILONS = fst.kNoOEpsilons\n * I_LABEL_SORTED = fst.kILabelSorted\n * NOT_I_LABEL_SORTED = fst.kNotILabelSorted             # <<<<<<<<<<<<<<\n * O_LABEL_SORTED = fst.kOLabelSorted\n * NOT_O_LABEL_SORTED = fst.kNotOLabelSorted\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kNotILabelSorted); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2831, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_NOT_I_LABEL_SORTED, __pyx_t_1) < 0) __PYX_ERR(0, 2831, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2832\n * I_LABEL_SORTED = fst.kILabelSorted\n * NOT_I_LABEL_SORTED = fst.kNotILabelSorted\n * O_LABEL_SORTED = fst.kOLabelSorted             # <<<<<<<<<<<<<<\n * NOT_O_LABEL_SORTED = fst.kNotOLabelSorted\n * WEIGHTED = fst.kWeighted\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kOLabelSorted); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2832, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_O_LABEL_SORTED, __pyx_t_1) < 0) __PYX_ERR(0, 2832, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2833\n * NOT_I_LABEL_SORTED = fst.kNotILabelSorted\n * O_LABEL_SORTED = fst.kOLabelSorted\n * NOT_O_LABEL_SORTED = fst.kNotOLabelSorted             # <<<<<<<<<<<<<<\n * WEIGHTED = fst.kWeighted\n * UNWEIGHTED = fst.kUnweighted\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kNotOLabelSorted); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2833, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_NOT_O_LABEL_SORTED, __pyx_t_1) < 0) __PYX_ERR(0, 2833, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2834\n * O_LABEL_SORTED = fst.kOLabelSorted\n * NOT_O_LABEL_SORTED = fst.kNotOLabelSorted\n * WEIGHTED = fst.kWeighted             # <<<<<<<<<<<<<<\n * UNWEIGHTED = fst.kUnweighted\n * CYCLIC = fst.kCyclic\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kWeighted); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2834, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_WEIGHTED, __pyx_t_1) < 0) __PYX_ERR(0, 2834, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2835\n * NOT_O_LABEL_SORTED = fst.kNotOLabelSorted\n * WEIGHTED = fst.kWeighted\n * UNWEIGHTED = fst.kUnweighted             # <<<<<<<<<<<<<<\n * CYCLIC = fst.kCyclic\n * ACYCLIC = fst.kAcyclic\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kUnweighted); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2835, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_UNWEIGHTED, __pyx_t_1) < 0) __PYX_ERR(0, 2835, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2836\n * WEIGHTED = fst.kWeighted\n * UNWEIGHTED = fst.kUnweighted\n * CYCLIC = fst.kCyclic             # <<<<<<<<<<<<<<\n * ACYCLIC = fst.kAcyclic\n * INITIAL_CYCLIC = fst.kInitialCyclic\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kCyclic); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2836, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_CYCLIC, __pyx_t_1) < 0) __PYX_ERR(0, 2836, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2837\n * UNWEIGHTED = fst.kUnweighted\n * CYCLIC = fst.kCyclic\n * ACYCLIC = fst.kAcyclic             # <<<<<<<<<<<<<<\n * INITIAL_CYCLIC = fst.kInitialCyclic\n * INITIAL_ACYCLIC = fst.kInitialAcyclic\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kAcyclic); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2837, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_ACYCLIC, __pyx_t_1) < 0) __PYX_ERR(0, 2837, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2838\n * CYCLIC = fst.kCyclic\n * ACYCLIC = fst.kAcyclic\n * INITIAL_CYCLIC = fst.kInitialCyclic             # <<<<<<<<<<<<<<\n * INITIAL_ACYCLIC = fst.kInitialAcyclic\n * TOP_SORTED = fst.kTopSorted\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kInitialCyclic); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2838, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_INITIAL_CYCLIC, __pyx_t_1) < 0) __PYX_ERR(0, 2838, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2839\n * ACYCLIC = fst.kAcyclic\n * INITIAL_CYCLIC = fst.kInitialCyclic\n * INITIAL_ACYCLIC = fst.kInitialAcyclic             # <<<<<<<<<<<<<<\n * TOP_SORTED = fst.kTopSorted\n * NOT_TOP_SORTED = fst.kNotTopSorted\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kInitialAcyclic); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2839, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_INITIAL_ACYCLIC, __pyx_t_1) < 0) __PYX_ERR(0, 2839, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2840\n * INITIAL_CYCLIC = fst.kInitialCyclic\n * INITIAL_ACYCLIC = fst.kInitialAcyclic\n * TOP_SORTED = fst.kTopSorted             # <<<<<<<<<<<<<<\n * NOT_TOP_SORTED = fst.kNotTopSorted\n * ACCESSIBLE = fst.kAccessible\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kTopSorted); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2840, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_TOP_SORTED, __pyx_t_1) < 0) __PYX_ERR(0, 2840, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2841\n * INITIAL_ACYCLIC = fst.kInitialAcyclic\n * TOP_SORTED = fst.kTopSorted\n * NOT_TOP_SORTED = fst.kNotTopSorted             # <<<<<<<<<<<<<<\n * ACCESSIBLE = fst.kAccessible\n * NOT_ACCESSIBLE = fst.kNotAccessible\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kNotTopSorted); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2841, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_NOT_TOP_SORTED, __pyx_t_1) < 0) __PYX_ERR(0, 2841, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2842\n * TOP_SORTED = fst.kTopSorted\n * NOT_TOP_SORTED = fst.kNotTopSorted\n * ACCESSIBLE = fst.kAccessible             # <<<<<<<<<<<<<<\n * NOT_ACCESSIBLE = fst.kNotAccessible\n * COACCESSIBLE = fst.kCoAccessible\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kAccessible); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2842, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_ACCESSIBLE, __pyx_t_1) < 0) __PYX_ERR(0, 2842, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2843\n * NOT_TOP_SORTED = fst.kNotTopSorted\n * ACCESSIBLE = fst.kAccessible\n * NOT_ACCESSIBLE = fst.kNotAccessible             # <<<<<<<<<<<<<<\n * COACCESSIBLE = fst.kCoAccessible\n * NOT_COACCESSIBLE = fst.kNotCoAccessible\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kNotAccessible); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2843, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_NOT_ACCESSIBLE, __pyx_t_1) < 0) __PYX_ERR(0, 2843, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2844\n * ACCESSIBLE = fst.kAccessible\n * NOT_ACCESSIBLE = fst.kNotAccessible\n * COACCESSIBLE = fst.kCoAccessible             # <<<<<<<<<<<<<<\n * NOT_COACCESSIBLE = fst.kNotCoAccessible\n * STRING = fst.kString\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kCoAccessible); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2844, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_COACCESSIBLE, __pyx_t_1) < 0) __PYX_ERR(0, 2844, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2845\n * NOT_ACCESSIBLE = fst.kNotAccessible\n * COACCESSIBLE = fst.kCoAccessible\n * NOT_COACCESSIBLE = fst.kNotCoAccessible             # <<<<<<<<<<<<<<\n * STRING = fst.kString\n * NOT_STRING = fst.kNotString\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kNotCoAccessible); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2845, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_NOT_COACCESSIBLE, __pyx_t_1) < 0) __PYX_ERR(0, 2845, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2846\n * COACCESSIBLE = fst.kCoAccessible\n * NOT_COACCESSIBLE = fst.kNotCoAccessible\n * STRING = fst.kString             # <<<<<<<<<<<<<<\n * NOT_STRING = fst.kNotString\n * WEIGHTED_CYCLES = fst.kWeightedCycles\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kString); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2846, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_STRING, __pyx_t_1) < 0) __PYX_ERR(0, 2846, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2847\n * NOT_COACCESSIBLE = fst.kNotCoAccessible\n * STRING = fst.kString\n * NOT_STRING = fst.kNotString             # <<<<<<<<<<<<<<\n * WEIGHTED_CYCLES = fst.kWeightedCycles\n * UNWEIGHTED_CYCLES = fst.kUnweightedCycles\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kNotString); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2847, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_NOT_STRING, __pyx_t_1) < 0) __PYX_ERR(0, 2847, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2848\n * STRING = fst.kString\n * NOT_STRING = fst.kNotString\n * WEIGHTED_CYCLES = fst.kWeightedCycles             # <<<<<<<<<<<<<<\n * UNWEIGHTED_CYCLES = fst.kUnweightedCycles\n * NULL_PROPERTIES = fst.kNullProperties\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kWeightedCycles); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2848, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_WEIGHTED_CYCLES, __pyx_t_1) < 0) __PYX_ERR(0, 2848, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2849\n * NOT_STRING = fst.kNotString\n * WEIGHTED_CYCLES = fst.kWeightedCycles\n * UNWEIGHTED_CYCLES = fst.kUnweightedCycles             # <<<<<<<<<<<<<<\n * NULL_PROPERTIES = fst.kNullProperties\n * COPY_PROPERTIES = fst.kCopyProperties\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kUnweightedCycles); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2849, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_UNWEIGHTED_CYCLES, __pyx_t_1) < 0) __PYX_ERR(0, 2849, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2850\n * WEIGHTED_CYCLES = fst.kWeightedCycles\n * UNWEIGHTED_CYCLES = fst.kUnweightedCycles\n * NULL_PROPERTIES = fst.kNullProperties             # <<<<<<<<<<<<<<\n * COPY_PROPERTIES = fst.kCopyProperties\n * INTRINSIC_PROPERTIES = fst.kIntrinsicProperties\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kNullProperties); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2850, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_NULL_PROPERTIES, __pyx_t_1) < 0) __PYX_ERR(0, 2850, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2851\n * UNWEIGHTED_CYCLES = fst.kUnweightedCycles\n * NULL_PROPERTIES = fst.kNullProperties\n * COPY_PROPERTIES = fst.kCopyProperties             # <<<<<<<<<<<<<<\n * INTRINSIC_PROPERTIES = fst.kIntrinsicProperties\n * EXTRINSIC_PROPERTIES = fst.kExtrinsicProperties\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kCopyProperties); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2851, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_COPY_PROPERTIES, __pyx_t_1) < 0) __PYX_ERR(0, 2851, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2852\n * NULL_PROPERTIES = fst.kNullProperties\n * COPY_PROPERTIES = fst.kCopyProperties\n * INTRINSIC_PROPERTIES = fst.kIntrinsicProperties             # <<<<<<<<<<<<<<\n * EXTRINSIC_PROPERTIES = fst.kExtrinsicProperties\n * SET_START_PROPERTIES = fst.kSetStartProperties\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kIntrinsicProperties); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2852, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_INTRINSIC_PROPERTIES, __pyx_t_1) < 0) __PYX_ERR(0, 2852, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2853\n * COPY_PROPERTIES = fst.kCopyProperties\n * INTRINSIC_PROPERTIES = fst.kIntrinsicProperties\n * EXTRINSIC_PROPERTIES = fst.kExtrinsicProperties             # <<<<<<<<<<<<<<\n * SET_START_PROPERTIES = fst.kSetStartProperties\n * SET_FINAL_PROPERTIES = fst.kSetFinalProperties\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kExtrinsicProperties); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2853, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_EXTRINSIC_PROPERTIES, __pyx_t_1) < 0) __PYX_ERR(0, 2853, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2854\n * INTRINSIC_PROPERTIES = fst.kIntrinsicProperties\n * EXTRINSIC_PROPERTIES = fst.kExtrinsicProperties\n * SET_START_PROPERTIES = fst.kSetStartProperties             # <<<<<<<<<<<<<<\n * SET_FINAL_PROPERTIES = fst.kSetFinalProperties\n * ADD_STATE_PROPERTIES = fst.kAddStateProperties\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kSetStartProperties); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2854, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_SET_START_PROPERTIES, __pyx_t_1) < 0) __PYX_ERR(0, 2854, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2855\n * EXTRINSIC_PROPERTIES = fst.kExtrinsicProperties\n * SET_START_PROPERTIES = fst.kSetStartProperties\n * SET_FINAL_PROPERTIES = fst.kSetFinalProperties             # <<<<<<<<<<<<<<\n * ADD_STATE_PROPERTIES = fst.kAddStateProperties\n * ADD_ARC_PROPERTIES = fst.kAddArcProperties\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kSetFinalProperties); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2855, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_SET_FINAL_PROPERTIES, __pyx_t_1) < 0) __PYX_ERR(0, 2855, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2856\n * SET_START_PROPERTIES = fst.kSetStartProperties\n * SET_FINAL_PROPERTIES = fst.kSetFinalProperties\n * ADD_STATE_PROPERTIES = fst.kAddStateProperties             # <<<<<<<<<<<<<<\n * ADD_ARC_PROPERTIES = fst.kAddArcProperties\n * SET_ARC_PROPERTIES = fst.kSetArcProperties\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kAddStateProperties); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2856, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_ADD_STATE_PROPERTIES, __pyx_t_1) < 0) __PYX_ERR(0, 2856, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2857\n * SET_FINAL_PROPERTIES = fst.kSetFinalProperties\n * ADD_STATE_PROPERTIES = fst.kAddStateProperties\n * ADD_ARC_PROPERTIES = fst.kAddArcProperties             # <<<<<<<<<<<<<<\n * SET_ARC_PROPERTIES = fst.kSetArcProperties\n * DELETE_STATE_PROPERTIES = fst.kDeleteStatesProperties\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kAddArcProperties); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2857, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_ADD_ARC_PROPERTIES, __pyx_t_1) < 0) __PYX_ERR(0, 2857, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2858\n * ADD_STATE_PROPERTIES = fst.kAddStateProperties\n * ADD_ARC_PROPERTIES = fst.kAddArcProperties\n * SET_ARC_PROPERTIES = fst.kSetArcProperties             # <<<<<<<<<<<<<<\n * DELETE_STATE_PROPERTIES = fst.kDeleteStatesProperties\n * DELETE_ARC_PROPERTIES = fst.kDeleteArcsProperties\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kSetArcProperties); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2858, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_SET_ARC_PROPERTIES, __pyx_t_1) < 0) __PYX_ERR(0, 2858, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2859\n * ADD_ARC_PROPERTIES = fst.kAddArcProperties\n * SET_ARC_PROPERTIES = fst.kSetArcProperties\n * DELETE_STATE_PROPERTIES = fst.kDeleteStatesProperties             # <<<<<<<<<<<<<<\n * DELETE_ARC_PROPERTIES = fst.kDeleteArcsProperties\n * STATE_SORT_PROPERTIES = fst.kStateSortProperties\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kDeleteStatesProperties); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2859, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_DELETE_STATE_PROPERTIES, __pyx_t_1) < 0) __PYX_ERR(0, 2859, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2860\n * SET_ARC_PROPERTIES = fst.kSetArcProperties\n * DELETE_STATE_PROPERTIES = fst.kDeleteStatesProperties\n * DELETE_ARC_PROPERTIES = fst.kDeleteArcsProperties             # <<<<<<<<<<<<<<\n * STATE_SORT_PROPERTIES = fst.kStateSortProperties\n * ARC_SORT_PROPERTIES = fst.kArcSortProperties\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kDeleteArcsProperties); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2860, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_DELETE_ARC_PROPERTIES, __pyx_t_1) < 0) __PYX_ERR(0, 2860, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2861\n * DELETE_STATE_PROPERTIES = fst.kDeleteStatesProperties\n * DELETE_ARC_PROPERTIES = fst.kDeleteArcsProperties\n * STATE_SORT_PROPERTIES = fst.kStateSortProperties             # <<<<<<<<<<<<<<\n * ARC_SORT_PROPERTIES = fst.kArcSortProperties\n * I_LABEL_INVARIANT_PROPERTIES = fst.kILabelInvariantProperties\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kStateSortProperties); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2861, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_STATE_SORT_PROPERTIES, __pyx_t_1) < 0) __PYX_ERR(0, 2861, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2862\n * DELETE_ARC_PROPERTIES = fst.kDeleteArcsProperties\n * STATE_SORT_PROPERTIES = fst.kStateSortProperties\n * ARC_SORT_PROPERTIES = fst.kArcSortProperties             # <<<<<<<<<<<<<<\n * I_LABEL_INVARIANT_PROPERTIES = fst.kILabelInvariantProperties\n * O_LABEL_INVARIANT_PROPERTIES = fst.kOLabelInvariantProperties\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kArcSortProperties); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2862, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_ARC_SORT_PROPERTIES, __pyx_t_1) < 0) __PYX_ERR(0, 2862, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2863\n * STATE_SORT_PROPERTIES = fst.kStateSortProperties\n * ARC_SORT_PROPERTIES = fst.kArcSortProperties\n * I_LABEL_INVARIANT_PROPERTIES = fst.kILabelInvariantProperties             # <<<<<<<<<<<<<<\n * O_LABEL_INVARIANT_PROPERTIES = fst.kOLabelInvariantProperties\n * WEIGHT_INVARIANT_PROPERTIES = fst.kWeightInvariantProperties\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kILabelInvariantProperties); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2863, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_I_LABEL_INVARIANT_PROPERTIES, __pyx_t_1) < 0) __PYX_ERR(0, 2863, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2864\n * ARC_SORT_PROPERTIES = fst.kArcSortProperties\n * I_LABEL_INVARIANT_PROPERTIES = fst.kILabelInvariantProperties\n * O_LABEL_INVARIANT_PROPERTIES = fst.kOLabelInvariantProperties             # <<<<<<<<<<<<<<\n * WEIGHT_INVARIANT_PROPERTIES = fst.kWeightInvariantProperties\n * ADD_SUPERFINAL_PROPERTIES = fst.kAddSuperFinalProperties\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kOLabelInvariantProperties); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2864, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_O_LABEL_INVARIANT_PROPERTIES, __pyx_t_1) < 0) __PYX_ERR(0, 2864, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2865\n * I_LABEL_INVARIANT_PROPERTIES = fst.kILabelInvariantProperties\n * O_LABEL_INVARIANT_PROPERTIES = fst.kOLabelInvariantProperties\n * WEIGHT_INVARIANT_PROPERTIES = fst.kWeightInvariantProperties             # <<<<<<<<<<<<<<\n * ADD_SUPERFINAL_PROPERTIES = fst.kAddSuperFinalProperties\n * RM_SUPERFINAL_PROPERTIES = fst.kRmSuperFinalProperties\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kWeightInvariantProperties); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2865, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_WEIGHT_INVARIANT_PROPERTIES, __pyx_t_1) < 0) __PYX_ERR(0, 2865, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2866\n * O_LABEL_INVARIANT_PROPERTIES = fst.kOLabelInvariantProperties\n * WEIGHT_INVARIANT_PROPERTIES = fst.kWeightInvariantProperties\n * ADD_SUPERFINAL_PROPERTIES = fst.kAddSuperFinalProperties             # <<<<<<<<<<<<<<\n * RM_SUPERFINAL_PROPERTIES = fst.kRmSuperFinalProperties\n * BINARY_PROPERTIES = fst.kBinaryProperties\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kAddSuperFinalProperties); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2866, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_ADD_SUPERFINAL_PROPERTIES, __pyx_t_1) < 0) __PYX_ERR(0, 2866, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2867\n * WEIGHT_INVARIANT_PROPERTIES = fst.kWeightInvariantProperties\n * ADD_SUPERFINAL_PROPERTIES = fst.kAddSuperFinalProperties\n * RM_SUPERFINAL_PROPERTIES = fst.kRmSuperFinalProperties             # <<<<<<<<<<<<<<\n * BINARY_PROPERTIES = fst.kBinaryProperties\n * TRINARY_PROPERTIES = fst.kTrinaryProperties\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kRmSuperFinalProperties); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2867, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_RM_SUPERFINAL_PROPERTIES, __pyx_t_1) < 0) __PYX_ERR(0, 2867, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2868\n * ADD_SUPERFINAL_PROPERTIES = fst.kAddSuperFinalProperties\n * RM_SUPERFINAL_PROPERTIES = fst.kRmSuperFinalProperties\n * BINARY_PROPERTIES = fst.kBinaryProperties             # <<<<<<<<<<<<<<\n * TRINARY_PROPERTIES = fst.kTrinaryProperties\n * POS_TRINARY_PROPERTIES = fst.kPosTrinaryProperties\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kBinaryProperties); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2868, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_BINARY_PROPERTIES, __pyx_t_1) < 0) __PYX_ERR(0, 2868, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2869\n * RM_SUPERFINAL_PROPERTIES = fst.kRmSuperFinalProperties\n * BINARY_PROPERTIES = fst.kBinaryProperties\n * TRINARY_PROPERTIES = fst.kTrinaryProperties             # <<<<<<<<<<<<<<\n * POS_TRINARY_PROPERTIES = fst.kPosTrinaryProperties\n * NEG_TRINARY_PROPERTIES = fst.kNegTrinaryProperties\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kTrinaryProperties); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2869, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_TRINARY_PROPERTIES, __pyx_t_1) < 0) __PYX_ERR(0, 2869, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2870\n * BINARY_PROPERTIES = fst.kBinaryProperties\n * TRINARY_PROPERTIES = fst.kTrinaryProperties\n * POS_TRINARY_PROPERTIES = fst.kPosTrinaryProperties             # <<<<<<<<<<<<<<\n * NEG_TRINARY_PROPERTIES = fst.kNegTrinaryProperties\n * FST_PROPERTIES = fst.kFstProperties\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kPosTrinaryProperties); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2870, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_POS_TRINARY_PROPERTIES, __pyx_t_1) < 0) __PYX_ERR(0, 2870, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2871\n * TRINARY_PROPERTIES = fst.kTrinaryProperties\n * POS_TRINARY_PROPERTIES = fst.kPosTrinaryProperties\n * NEG_TRINARY_PROPERTIES = fst.kNegTrinaryProperties             # <<<<<<<<<<<<<<\n * FST_PROPERTIES = fst.kFstProperties\n * \n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kNegTrinaryProperties); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2871, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_NEG_TRINARY_PROPERTIES, __pyx_t_1) < 0) __PYX_ERR(0, 2871, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2872\n * POS_TRINARY_PROPERTIES = fst.kPosTrinaryProperties\n * NEG_TRINARY_PROPERTIES = fst.kNegTrinaryProperties\n * FST_PROPERTIES = fst.kFstProperties             # <<<<<<<<<<<<<<\n * \n * \n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kFstProperties); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2872, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_FST_PROPERTIES, __pyx_t_1) < 0) __PYX_ERR(0, 2872, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2878\n * \n * \n * ARC_I_LABEL_VALUE = fst.kArcILabelValue             # <<<<<<<<<<<<<<\n * ARC_O_LABEL_VALUE = fst.kArcOLabelValue\n * ARC_WEIGHT_VALUE = fst.kArcWeightValue\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint32_t(fst::kArcILabelValue); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2878, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_ARC_I_LABEL_VALUE, __pyx_t_1) < 0) __PYX_ERR(0, 2878, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2879\n * \n * ARC_I_LABEL_VALUE = fst.kArcILabelValue\n * ARC_O_LABEL_VALUE = fst.kArcOLabelValue             # <<<<<<<<<<<<<<\n * ARC_WEIGHT_VALUE = fst.kArcWeightValue\n * ARC_NEXT_STATE_VALUE = fst.kArcNextStateValue\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint32_t(fst::kArcOLabelValue); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2879, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_ARC_O_LABEL_VALUE, __pyx_t_1) < 0) __PYX_ERR(0, 2879, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2880\n * ARC_I_LABEL_VALUE = fst.kArcILabelValue\n * ARC_O_LABEL_VALUE = fst.kArcOLabelValue\n * ARC_WEIGHT_VALUE = fst.kArcWeightValue             # <<<<<<<<<<<<<<\n * ARC_NEXT_STATE_VALUE = fst.kArcNextStateValue\n * ARC_NO_CACHE = fst.kArcNoCache\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint32_t(fst::kArcWeightValue); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2880, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_ARC_WEIGHT_VALUE, __pyx_t_1) < 0) __PYX_ERR(0, 2880, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2881\n * ARC_O_LABEL_VALUE = fst.kArcOLabelValue\n * ARC_WEIGHT_VALUE = fst.kArcWeightValue\n * ARC_NEXT_STATE_VALUE = fst.kArcNextStateValue             # <<<<<<<<<<<<<<\n * ARC_NO_CACHE = fst.kArcNoCache\n * ARC_VALUE_FLAGS = fst.kArcValueFlags\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint32_t(fst::kArcNextStateValue); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2881, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_ARC_NEXT_STATE_VALUE, __pyx_t_1) < 0) __PYX_ERR(0, 2881, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2882\n * ARC_WEIGHT_VALUE = fst.kArcWeightValue\n * ARC_NEXT_STATE_VALUE = fst.kArcNextStateValue\n * ARC_NO_CACHE = fst.kArcNoCache             # <<<<<<<<<<<<<<\n * ARC_VALUE_FLAGS = fst.kArcValueFlags\n * ARC_FLAGS = fst.kArcFlags\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint32_t(fst::kArcNoCache); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2882, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_ARC_NO_CACHE, __pyx_t_1) < 0) __PYX_ERR(0, 2882, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2883\n * ARC_NEXT_STATE_VALUE = fst.kArcNextStateValue\n * ARC_NO_CACHE = fst.kArcNoCache\n * ARC_VALUE_FLAGS = fst.kArcValueFlags             # <<<<<<<<<<<<<<\n * ARC_FLAGS = fst.kArcFlags\n * \n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint32_t(fst::kArcValueFlags); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2883, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_ARC_VALUE_FLAGS, __pyx_t_1) < 0) __PYX_ERR(0, 2883, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2884\n * ARC_NO_CACHE = fst.kArcNoCache\n * ARC_VALUE_FLAGS = fst.kArcValueFlags\n * ARC_FLAGS = fst.kArcFlags             # <<<<<<<<<<<<<<\n * \n * \n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint32_t(fst::kArcFlags); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2884, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_ARC_FLAGS, __pyx_t_1) < 0) __PYX_ERR(0, 2884, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2890\n * \n * \n * ENCODE_LABELS = fst.kEncodeLabels             # <<<<<<<<<<<<<<\n * ENCODE_WEIGHTS = fst.kEncodeWeights\n * ENCODE_FLAGS = fst.kEncodeFlags\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint32_t(fst::kEncodeLabels); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2890, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_ENCODE_LABELS, __pyx_t_1) < 0) __PYX_ERR(0, 2890, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2891\n * \n * ENCODE_LABELS = fst.kEncodeLabels\n * ENCODE_WEIGHTS = fst.kEncodeWeights             # <<<<<<<<<<<<<<\n * ENCODE_FLAGS = fst.kEncodeFlags\n * \n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint32_t(fst::kEncodeWeights); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2891, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_ENCODE_WEIGHTS, __pyx_t_1) < 0) __PYX_ERR(0, 2891, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2892\n * ENCODE_LABELS = fst.kEncodeLabels\n * ENCODE_WEIGHTS = fst.kEncodeWeights\n * ENCODE_FLAGS = fst.kEncodeFlags             # <<<<<<<<<<<<<<\n * \n * \n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint32_t(fst::kEncodeFlags); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2892, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_ENCODE_FLAGS, __pyx_t_1) < 0) __PYX_ERR(0, 2892, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":3258\n * \n * cdef _Fst _map(_Fst ifst,\n *                float delta=fst.kDelta,             # <<<<<<<<<<<<<<\n *                map_type=b\"identity\",\n *                double power=1.,\n */\n  __pyx_k__67 = fst::kDelta;\n\n  /* \"pywrapfst.pyx\":3272\n * \n * cpdef _Fst arcmap(_Fst ifst,\n *                   float delta=fst.kDelta,             # <<<<<<<<<<<<<<\n *                   map_type=b\"identity\",\n *                   double power=1.,\n */\n  __pyx_k__68 = fst::kDelta;\n\n  /* \"pywrapfst.pyx\":3271\n * \n * \n * cpdef _Fst arcmap(_Fst ifst,             # <<<<<<<<<<<<<<\n *                   float delta=fst.kDelta,\n *                   map_type=b\"identity\",\n */\n  __pyx_k__68 = fst::kDelta;\n\n  /* \"pywrapfst.pyx\":3384\n * \n * cpdef _MutableFst determinize(_Fst ifst,\n *                               float delta=fst.kShortestDelta,             # <<<<<<<<<<<<<<\n *                               det_type=b\"functional\",\n *                               int64 nstate=fst.kNoStateId,\n */\n  __pyx_k__69 = fst::kShortestDelta;\n\n  /* \"pywrapfst.pyx\":3386\n *                               float delta=fst.kShortestDelta,\n *                               det_type=b\"functional\",\n *                               int64 nstate=fst.kNoStateId,             # <<<<<<<<<<<<<<\n *                               int64 subsequential_label=0,\n *                               weight=None,\n */\n  __pyx_k__70 = fst::kNoStateId;\n\n  /* \"pywrapfst.pyx\":3384\n * \n * cpdef _MutableFst determinize(_Fst ifst,\n *                               float delta=fst.kShortestDelta,             # <<<<<<<<<<<<<<\n *                               det_type=b\"functional\",\n *                               int64 nstate=fst.kNoStateId,\n */\n  __pyx_k__69 = fst::kShortestDelta;\n\n  /* \"pywrapfst.pyx\":3386\n *                               float delta=fst.kShortestDelta,\n *                               det_type=b\"functional\",\n *                               int64 nstate=fst.kNoStateId,             # <<<<<<<<<<<<<<\n *                               int64 subsequential_label=0,\n *                               weight=None,\n */\n  __pyx_k__70 = fst::kNoStateId;\n\n  /* \"pywrapfst.pyx\":3477\n * \n * cpdef _MutableFst disambiguate(_Fst ifst,\n *                                float delta=fst.kDelta,             # <<<<<<<<<<<<<<\n *                                int64 nstate=fst.kNoStateId,\n *                                int64 subsequential_label=0,\n */\n  __pyx_k__71 = fst::kDelta;\n\n  /* \"pywrapfst.pyx\":3478\n * cpdef _MutableFst disambiguate(_Fst ifst,\n *                                float delta=fst.kDelta,\n *                                int64 nstate=fst.kNoStateId,             # <<<<<<<<<<<<<<\n *                                int64 subsequential_label=0,\n *                                weight=None):\n */\n  __pyx_k__72 = fst::kNoStateId;\n\n  /* \"pywrapfst.pyx\":3477\n * \n * cpdef _MutableFst disambiguate(_Fst ifst,\n *                                float delta=fst.kDelta,             # <<<<<<<<<<<<<<\n *                                int64 nstate=fst.kNoStateId,\n *                                int64 subsequential_label=0,\n */\n  __pyx_k__71 = fst::kDelta;\n\n  /* \"pywrapfst.pyx\":3478\n * cpdef _MutableFst disambiguate(_Fst ifst,\n *                                float delta=fst.kDelta,\n *                                int64 nstate=fst.kNoStateId,             # <<<<<<<<<<<<<<\n *                                int64 subsequential_label=0,\n *                                weight=None):\n */\n  __pyx_k__72 = fst::kNoStateId;\n\n  /* \"pywrapfst.pyx\":3548\n * \n * \n * cpdef bool equal(_Fst ifst1, _Fst ifst2, float delta=fst.kDelta):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   equal(ifst1, ifst2, delta=0.0009765625)\n */\n  __pyx_k__73 = fst::kDelta;\n  __pyx_k__73 = fst::kDelta;\n\n  /* \"pywrapfst.pyx\":3571\n * \n * \n * cpdef bool equivalent(_Fst ifst1, _Fst ifst2, float delta=fst.kDelta) except *:             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   equivalent(ifst1, ifst2, delta=0.0009765625)\n */\n  __pyx_k__74 = fst::kDelta;\n  __pyx_k__74 = fst::kDelta;\n\n  /* \"pywrapfst.pyx\":3627\n * \n * \n * cpdef bool isomorphic(_Fst ifst1, _Fst ifst2, float delta=fst.kDelta):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   isomorphic(ifst1, ifst2, delta=0.0009765625)\n */\n  __pyx_k__75 = fst::kDelta;\n  __pyx_k__75 = fst::kDelta;\n\n  /* \"pywrapfst.pyx\":3654\n * \n * cpdef _MutableFst prune(_Fst ifst,\n *                         float delta=fst.kDelta,             # <<<<<<<<<<<<<<\n *                         int64 nstate=fst.kNoStateId,\n *                         weight=None):\n */\n  __pyx_k__76 = fst::kDelta;\n\n  /* \"pywrapfst.pyx\":3655\n * cpdef _MutableFst prune(_Fst ifst,\n *                         float delta=fst.kDelta,\n *                         int64 nstate=fst.kNoStateId,             # <<<<<<<<<<<<<<\n *                         weight=None):\n *   \"\"\"\n */\n  __pyx_k__77 = fst::kNoStateId;\n\n  /* \"pywrapfst.pyx\":3654\n * \n * cpdef _MutableFst prune(_Fst ifst,\n *                         float delta=fst.kDelta,             # <<<<<<<<<<<<<<\n *                         int64 nstate=fst.kNoStateId,\n *                         weight=None):\n */\n  __pyx_k__76 = fst::kDelta;\n\n  /* \"pywrapfst.pyx\":3655\n * cpdef _MutableFst prune(_Fst ifst,\n *                         float delta=fst.kDelta,\n *                         int64 nstate=fst.kNoStateId,             # <<<<<<<<<<<<<<\n *                         weight=None):\n *   \"\"\"\n */\n  __pyx_k__77 = fst::kNoStateId;\n\n  /* \"pywrapfst.pyx\":3687\n * \n * cpdef _MutableFst push(_Fst ifst,\n *                        float delta=fst.kDelta,             # <<<<<<<<<<<<<<\n *                        bool push_weights=False,\n *                        bool push_labels=False,\n */\n  __pyx_k__78 = fst::kDelta;\n\n  /* \"pywrapfst.pyx\":3686\n * \n * \n * cpdef _MutableFst push(_Fst ifst,             # <<<<<<<<<<<<<<\n *                        float delta=fst.kDelta,\n *                        bool push_weights=False,\n */\n  __pyx_k__78 = fst::kDelta;\n\n  /* \"pywrapfst.pyx\":3743\n *                           _Fst ifst2,\n *                           int32 npath=1,\n *                           float delta=fst.kDelta,             # <<<<<<<<<<<<<<\n *                           time_t seed=0,\n *                           select=b\"uniform\",\n */\n  __pyx_k__79 = fst::kDelta;\n\n  /* \"pywrapfst.pyx\":3746\n *                           time_t seed=0,\n *                           select=b\"uniform\",\n *                           int32 max_length=INT32_MAX) except *:             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   randequivalent(ifst1, ifst2, npath=1, delta=0.0009765625, seed=0,\n */\n  __pyx_k__80 = INT32_MAX;\n\n  /* \"pywrapfst.pyx\":3743\n *                           _Fst ifst2,\n *                           int32 npath=1,\n *                           float delta=fst.kDelta,             # <<<<<<<<<<<<<<\n *                           time_t seed=0,\n *                           select=b\"uniform\",\n */\n  __pyx_k__79 = fst::kDelta;\n\n  /* \"pywrapfst.pyx\":3746\n *                           time_t seed=0,\n *                           select=b\"uniform\",\n *                           int32 max_length=INT32_MAX) except *:             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   randequivalent(ifst1, ifst2, npath=1, delta=0.0009765625, seed=0,\n */\n  __pyx_k__80 = INT32_MAX;\n\n  /* \"pywrapfst.pyx\":3790\n *                           time_t seed=0,\n *                           select=b\"uniform\",\n *                           int32 max_length=INT32_MAX,             # <<<<<<<<<<<<<<\n *                           bool weighted=False,\n *                           bool remove_total_weight=False):\n */\n  __pyx_k__81 = INT32_MAX;\n\n  /* \"pywrapfst.pyx\":3786\n * \n * \n * cpdef _MutableFst randgen(_Fst ifst,             # <<<<<<<<<<<<<<\n *                           int32 npath=1,\n *                           time_t seed=0,\n */\n  __pyx_k__81 = INT32_MAX;\n\n  /* \"pywrapfst.pyx\":3928\n * \n * cdef vector[fst.WeightClass] *_shortestdistance(_Fst ifst,\n *                                                 float delta=fst.kShortestDelta,             # <<<<<<<<<<<<<<\n *                                                 int64 nstate=fst.kNoStateId,\n *                                                 queue_type=b\"auto\",\n */\n  __pyx_k__82 = fst::kShortestDelta;\n\n  /* \"pywrapfst.pyx\":3929\n * cdef vector[fst.WeightClass] *_shortestdistance(_Fst ifst,\n *                                                 float delta=fst.kShortestDelta,\n *                                                 int64 nstate=fst.kNoStateId,             # <<<<<<<<<<<<<<\n *                                                 queue_type=b\"auto\",\n *                                                 bool reverse=False) except *:\n */\n  __pyx_k__83 = fst::kNoStateId;\n\n  /* \"pywrapfst.pyx\":3950\n * \n * def shortestdistance(_Fst ifst,\n *                      float delta=fst.kShortestDelta,             # <<<<<<<<<<<<<<\n *                      int64 nstate=fst.kNoStateId,\n *                      queue_type=b\"auto\",\n */\n  __pyx_k__84 = fst::kShortestDelta;\n\n  /* \"pywrapfst.pyx\":3951\n * def shortestdistance(_Fst ifst,\n *                      float delta=fst.kShortestDelta,\n *                      int64 nstate=fst.kNoStateId,             # <<<<<<<<<<<<<<\n *                      queue_type=b\"auto\",\n *                      bool reverse=False):\n */\n  __pyx_k__85 = fst::kNoStateId;\n\n  /* \"pywrapfst.pyx\":3949\n * \n * \n * def shortestdistance(_Fst ifst,             # <<<<<<<<<<<<<<\n *                      float delta=fst.kShortestDelta,\n *                      int64 nstate=fst.kNoStateId,\n */\n  __pyx_t_1 = PyCFunction_NewEx(&__pyx_mdef_9pywrapfst_51shortestdistance, NULL, __pyx_n_s_pywrapfst_2); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3949, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_shortestdistance, __pyx_t_1) < 0) __PYX_ERR(0, 3949, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":3987\n * \n * cpdef _MutableFst shortestpath(_Fst ifst,\n *                                float delta=fst.kShortestDelta,             # <<<<<<<<<<<<<<\n *                                int32 nshortest=1,\n *                                int64 nstate=fst.kNoStateId,\n */\n  __pyx_k__86 = fst::kShortestDelta;\n\n  /* \"pywrapfst.pyx\":3989\n *                                float delta=fst.kShortestDelta,\n *                                int32 nshortest=1,\n *                                int64 nstate=fst.kNoStateId,             # <<<<<<<<<<<<<<\n *                                queue_type=b\"auto\",\n *                                bool unique=False,\n */\n  __pyx_k__87 = fst::kNoStateId;\n\n  /* \"pywrapfst.pyx\":3987\n * \n * cpdef _MutableFst shortestpath(_Fst ifst,\n *                                float delta=fst.kShortestDelta,             # <<<<<<<<<<<<<<\n *                                int32 nshortest=1,\n *                                int64 nstate=fst.kNoStateId,\n */\n  __pyx_k__86 = fst::kShortestDelta;\n\n  /* \"pywrapfst.pyx\":3989\n *                                float delta=fst.kShortestDelta,\n *                                int32 nshortest=1,\n *                                int64 nstate=fst.kNoStateId,             # <<<<<<<<<<<<<<\n *                                queue_type=b\"auto\",\n *                                bool unique=False,\n */\n  __pyx_k__87 = fst::kNoStateId;\n\n  /* \"pywrapfst.pyx\":4140\n * \n *   def __cinit__(self,\n *                 string fst_type=b\"vector\",             # <<<<<<<<<<<<<<\n *                 string arc_type=b\"standard\",\n *                 SymbolTable isymbols=None,\n */\n  __pyx_t_6 = __pyx_convert_string_from_py_std__in_string(__pyx_n_b_vector); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 4140, __pyx_L1_error)\n  __pyx_k__88 = __pyx_t_6;\n\n  /* \"pywrapfst.pyx\":4141\n *   def __cinit__(self,\n *                 string fst_type=b\"vector\",\n *                 string arc_type=b\"standard\",             # <<<<<<<<<<<<<<\n *                 SymbolTable isymbols=None,\n *                 SymbolTable osymbols=None,\n */\n  __pyx_t_6 = __pyx_convert_string_from_py_std__in_string(__pyx_n_b_standard); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 4141, __pyx_L1_error)\n  __pyx_k__89 = __pyx_t_6;\n\n  /* \"pywrapfst.pyx\":4239\n * \n *   @classmethod\n *   def open(cls, *filenames):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     FarReader.open(*filenames)\n */\n  __pyx_t_1 = __Pyx_GetNameInClass((PyObject *)__pyx_ptype_9pywrapfst_FarReader, __pyx_n_s_open); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4239, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n\n  /* \"pywrapfst.pyx\":4238\n *     return \"<{} FarReader at 0x{:x}>\".format(self.far_type(), id(self))\n * \n *   @classmethod             # <<<<<<<<<<<<<<\n *   def open(cls, *filenames):\n *     \"\"\"\n */\n  __pyx_t_2 = __Pyx_Method_ClassMethod(__pyx_t_1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 4238, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  if (PyDict_SetItem((PyObject *)__pyx_ptype_9pywrapfst_FarReader->tp_dict, __pyx_n_s_open, __pyx_t_2) < 0) __PYX_ERR(0, 4239, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n  PyType_Modified(__pyx_ptype_9pywrapfst_FarReader);\n\n  /* \"pywrapfst.pyx\":4388\n * \n *   @classmethod\n *   def create(cls, filename, arc_type=b\"standard\", far_type=b\"default\"):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     FarWriter.\n */\n  __pyx_t_2 = __Pyx_GetNameInClass((PyObject *)__pyx_ptype_9pywrapfst_FarWriter, __pyx_n_s_create); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 4388, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n\n  /* \"pywrapfst.pyx\":4387\n *     return \"<{} FarWriter at 0x{:x}>\".format(self.far_type(), id(self))\n * \n *   @classmethod             # <<<<<<<<<<<<<<\n *   def create(cls, filename, arc_type=b\"standard\", far_type=b\"default\"):\n *     \"\"\"\n */\n  __pyx_t_1 = __Pyx_Method_ClassMethod(__pyx_t_2); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4387, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n  if (PyDict_SetItem((PyObject *)__pyx_ptype_9pywrapfst_FarWriter->tp_dict, __pyx_n_s_create, __pyx_t_1) < 0) __PYX_ERR(0, 4388, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  PyType_Modified(__pyx_ptype_9pywrapfst_FarWriter);\n\n  /* \"pywrapfst.pyx\":4487\n * \n * \n * _fst_error_fatal_old = fst.FLAGS_fst_error_fatal             # <<<<<<<<<<<<<<\n * fst.FLAGS_fst_error_fatal = False\n * \n */\n  __pyx_t_1 = __Pyx_PyBool_FromLong(FLAGS_fst_error_fatal); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4487, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_fst_error_fatal_old, __pyx_t_1) < 0) __PYX_ERR(0, 4487, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":4488\n * \n * _fst_error_fatal_old = fst.FLAGS_fst_error_fatal\n * fst.FLAGS_fst_error_fatal = False             # <<<<<<<<<<<<<<\n * \n * \n */\n  FLAGS_fst_error_fatal = 0;\n\n  /* \"pywrapfst.pyx\":4491\n * \n * \n * @atexit.register             # <<<<<<<<<<<<<<\n * def _reset_fst_error_fatal():\n *   fst.FLAGS_fst_error_fatal = _fst_error_fatal_old\n */\n  __pyx_t_2 = __Pyx_GetModuleGlobalName(__pyx_n_s_atexit); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 4491, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  __pyx_t_3 = __Pyx_PyObject_GetAttrStr(__pyx_t_2, __pyx_n_s_register); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 4491, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_3);\n  __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n\n  /* \"pywrapfst.pyx\":4492\n * \n * @atexit.register\n * def _reset_fst_error_fatal():             # <<<<<<<<<<<<<<\n *   fst.FLAGS_fst_error_fatal = _fst_error_fatal_old\n * \n */\n  __pyx_t_2 = PyCFunction_NewEx(&__pyx_mdef_9pywrapfst_59_reset_fst_error_fatal, NULL, __pyx_n_s_pywrapfst_2); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 4492, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  __pyx_t_4 = NULL;\n  if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n    __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n    if (likely(__pyx_t_4)) {\n      PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n      __Pyx_INCREF(__pyx_t_4);\n      __Pyx_INCREF(function);\n      __Pyx_DECREF_SET(__pyx_t_3, function);\n    }\n  }\n  if (!__pyx_t_4) {\n    __pyx_t_1 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_2); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4491, __pyx_L1_error)\n    __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n    __Pyx_GOTREF(__pyx_t_1);\n  } else {\n    #if CYTHON_FAST_PYCALL\n    if (PyFunction_Check(__pyx_t_3)) {\n      PyObject *__pyx_temp[2] = {__pyx_t_4, __pyx_t_2};\n      __pyx_t_1 = __Pyx_PyFunction_FastCall(__pyx_t_3, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4491, __pyx_L1_error)\n      __Pyx_XDECREF(__pyx_t_4); __pyx_t_4 = 0;\n      __Pyx_GOTREF(__pyx_t_1);\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n    } else\n    #endif\n    #if CYTHON_FAST_PYCCALL\n    if (__Pyx_PyFastCFunction_Check(__pyx_t_3)) {\n      PyObject *__pyx_temp[2] = {__pyx_t_4, __pyx_t_2};\n      __pyx_t_1 = __Pyx_PyCFunction_FastCall(__pyx_t_3, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4491, __pyx_L1_error)\n      __Pyx_XDECREF(__pyx_t_4); __pyx_t_4 = 0;\n      __Pyx_GOTREF(__pyx_t_1);\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n    } else\n    #endif\n    {\n      __pyx_t_7 = PyTuple_New(1+1); if (unlikely(!__pyx_t_7)) __PYX_ERR(0, 4491, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_7);\n      __Pyx_GIVEREF(__pyx_t_4); PyTuple_SET_ITEM(__pyx_t_7, 0, __pyx_t_4); __pyx_t_4 = NULL;\n      __Pyx_GIVEREF(__pyx_t_2);\n      PyTuple_SET_ITEM(__pyx_t_7, 0+1, __pyx_t_2);\n      __pyx_t_2 = 0;\n      __pyx_t_1 = __Pyx_PyObject_Call(__pyx_t_3, __pyx_t_7, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4491, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_1);\n      __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0;\n    }\n  }\n  __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_reset_fst_error_fatal, __pyx_t_1) < 0) __PYX_ERR(0, 4492, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":1\n * #cython: nonecheck=True             # <<<<<<<<<<<<<<\n * # Licensed under the Apache License, Version 2.0 (the \"License\");\n * # you may not use this file except in compliance with the License.\n */\n  __pyx_t_1 = __Pyx_PyDict_NewPresized(0); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_test_2, __pyx_t_1) < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"vector.from_py\":45\n * \n * @cname(\"__pyx_convert_vector_from_py_std_3a__3a_string\")\n * cdef vector[X] __pyx_convert_vector_from_py_std_3a__3a_string(object o) except *:             # <<<<<<<<<<<<<<\n *     cdef vector[X] v\n *     for item in o:\n */\n\n  /*--- Wrapped vars code ---*/\n\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_7);\n  if (__pyx_m) {\n    if (__pyx_d) {\n      __Pyx_AddTraceback(\"init pywrapfst\", 0, __pyx_lineno, __pyx_filename);\n    }\n    Py_DECREF(__pyx_m); __pyx_m = 0;\n  } else if (!PyErr_Occurred()) {\n    PyErr_SetString(PyExc_ImportError, \"init pywrapfst\");\n  }\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  #if CYTHON_PEP489_MULTI_PHASE_INIT\n  return (__pyx_m != NULL) ? 0 : -1;\n  #elif PY_MAJOR_VERSION >= 3\n  return __pyx_m;\n  #else\n  return;\n  #endif\n}\n\n/* --- Runtime support code --- */\n/* Refnanny */\n#if CYTHON_REFNANNY\nstatic __Pyx_RefNannyAPIStruct *__Pyx_RefNannyImportAPI(const char *modname) {\n    PyObject *m = NULL, *p = NULL;\n    void *r = NULL;\n    m = PyImport_ImportModule((char *)modname);\n    if (!m) goto end;\n    p = PyObject_GetAttrString(m, (char *)\"RefNannyAPI\");\n    if (!p) goto end;\n    r = PyLong_AsVoidPtr(p);\nend:\n    Py_XDECREF(p);\n    Py_XDECREF(m);\n    return (__Pyx_RefNannyAPIStruct *)r;\n}\n#endif\n\n/* GetBuiltinName */\nstatic PyObject *__Pyx_GetBuiltinName(PyObject *name) {\n    PyObject* result = __Pyx_PyObject_GetAttrStr(__pyx_b, name);\n    if (unlikely(!result)) {\n        PyErr_Format(PyExc_NameError,\n#if PY_MAJOR_VERSION >= 3\n            \"name '%U' is not defined\", name);\n#else\n            \"name '%.200s' is not defined\", PyString_AS_STRING(name));\n#endif\n    }\n    return result;\n}\n\n/* PyCFunctionFastCall */\n#if CYTHON_FAST_PYCCALL\nstatic CYTHON_INLINE PyObject * __Pyx_PyCFunction_FastCall(PyObject *func_obj, PyObject **args, Py_ssize_t nargs) {\n    PyCFunctionObject *func = (PyCFunctionObject*)func_obj;\n    PyCFunction meth = PyCFunction_GET_FUNCTION(func);\n    PyObject *self = PyCFunction_GET_SELF(func);\n    int flags = PyCFunction_GET_FLAGS(func);\n    assert(PyCFunction_Check(func));\n    assert(METH_FASTCALL == (flags & ~(METH_CLASS | METH_STATIC | METH_COEXIST | METH_KEYWORDS)));\n    assert(nargs >= 0);\n    assert(nargs == 0 || args != NULL);\n    /* _PyCFunction_FastCallDict() must not be called with an exception set,\n       because it may clear it (directly or indirectly) and so the\n       caller loses its exception */\n    assert(!PyErr_Occurred());\n    if ((PY_VERSION_HEX < 0x030700A0) || unlikely(flags & METH_KEYWORDS)) {\n        return (*((__Pyx_PyCFunctionFastWithKeywords)meth)) (self, args, nargs, NULL);\n    } else {\n        return (*((__Pyx_PyCFunctionFast)meth)) (self, args, nargs);\n    }\n}\n#endif\n\n/* PyFunctionFastCall */\n#if CYTHON_FAST_PYCALL\n#include \"frameobject.h\"\nstatic PyObject* __Pyx_PyFunction_FastCallNoKw(PyCodeObject *co, PyObject **args, Py_ssize_t na,\n                                               PyObject *globals) {\n    PyFrameObject *f;\n    PyThreadState *tstate = __Pyx_PyThreadState_Current;\n    PyObject **fastlocals;\n    Py_ssize_t i;\n    PyObject *result;\n    assert(globals != NULL);\n    /* XXX Perhaps we should create a specialized\n       PyFrame_New() that doesn't take locals, but does\n       take builtins without sanity checking them.\n       */\n    assert(tstate != NULL);\n    f = PyFrame_New(tstate, co, globals, NULL);\n    if (f == NULL) {\n        return NULL;\n    }\n    fastlocals = f->f_localsplus;\n    for (i = 0; i < na; i++) {\n        Py_INCREF(*args);\n        fastlocals[i] = *args++;\n    }\n    result = PyEval_EvalFrameEx(f,0);\n    ++tstate->recursion_depth;\n    Py_DECREF(f);\n    --tstate->recursion_depth;\n    return result;\n}\n#if 1 || PY_VERSION_HEX < 0x030600B1\nstatic PyObject *__Pyx_PyFunction_FastCallDict(PyObject *func, PyObject **args, int nargs, PyObject *kwargs) {\n    PyCodeObject *co = (PyCodeObject *)PyFunction_GET_CODE(func);\n    PyObject *globals = PyFunction_GET_GLOBALS(func);\n    PyObject *argdefs = PyFunction_GET_DEFAULTS(func);\n    PyObject *closure;\n#if PY_MAJOR_VERSION >= 3\n    PyObject *kwdefs;\n#endif\n    PyObject *kwtuple, **k;\n    PyObject **d;\n    Py_ssize_t nd;\n    Py_ssize_t nk;\n    PyObject *result;\n    assert(kwargs == NULL || PyDict_Check(kwargs));\n    nk = kwargs ? PyDict_Size(kwargs) : 0;\n    if (Py_EnterRecursiveCall((char*)\" while calling a Python object\")) {\n        return NULL;\n    }\n    if (\n#if PY_MAJOR_VERSION >= 3\n            co->co_kwonlyargcount == 0 &&\n#endif\n            likely(kwargs == NULL || nk == 0) &&\n            co->co_flags == (CO_OPTIMIZED | CO_NEWLOCALS | CO_NOFREE)) {\n        if (argdefs == NULL && co->co_argcount == nargs) {\n            result = __Pyx_PyFunction_FastCallNoKw(co, args, nargs, globals);\n            goto done;\n        }\n        else if (nargs == 0 && argdefs != NULL\n                 && co->co_argcount == Py_SIZE(argdefs)) {\n            /* function called with no arguments, but all parameters have\n               a default value: use default values as arguments .*/\n            args = &PyTuple_GET_ITEM(argdefs, 0);\n            result =__Pyx_PyFunction_FastCallNoKw(co, args, Py_SIZE(argdefs), globals);\n            goto done;\n        }\n    }\n    if (kwargs != NULL) {\n        Py_ssize_t pos, i;\n        kwtuple = PyTuple_New(2 * nk);\n        if (kwtuple == NULL) {\n            result = NULL;\n            goto done;\n        }\n        k = &PyTuple_GET_ITEM(kwtuple, 0);\n        pos = i = 0;\n        while (PyDict_Next(kwargs, &pos, &k[i], &k[i+1])) {\n            Py_INCREF(k[i]);\n            Py_INCREF(k[i+1]);\n            i += 2;\n        }\n        nk = i / 2;\n    }\n    else {\n        kwtuple = NULL;\n        k = NULL;\n    }\n    closure = PyFunction_GET_CLOSURE(func);\n#if PY_MAJOR_VERSION >= 3\n    kwdefs = PyFunction_GET_KW_DEFAULTS(func);\n#endif\n    if (argdefs != NULL) {\n        d = &PyTuple_GET_ITEM(argdefs, 0);\n        nd = Py_SIZE(argdefs);\n    }\n    else {\n        d = NULL;\n        nd = 0;\n    }\n#if PY_MAJOR_VERSION >= 3\n    result = PyEval_EvalCodeEx((PyObject*)co, globals, (PyObject *)NULL,\n                               args, nargs,\n                               k, (int)nk,\n                               d, (int)nd, kwdefs, closure);\n#else\n    result = PyEval_EvalCodeEx(co, globals, (PyObject *)NULL,\n                               args, nargs,\n                               k, (int)nk,\n                               d, (int)nd, closure);\n#endif\n    Py_XDECREF(kwtuple);\ndone:\n    Py_LeaveRecursiveCall();\n    return result;\n}\n#endif\n#endif\n\n/* PyObjectCall */\n#if CYTHON_COMPILING_IN_CPYTHON\nstatic CYTHON_INLINE PyObject* __Pyx_PyObject_Call(PyObject *func, PyObject *arg, PyObject *kw) {\n    PyObject *result;\n    ternaryfunc call = func->ob_type->tp_call;\n    if (unlikely(!call))\n        return PyObject_Call(func, arg, kw);\n    if (unlikely(Py_EnterRecursiveCall((char*)\" while calling a Python object\")))\n        return NULL;\n    result = (*call)(func, arg, kw);\n    Py_LeaveRecursiveCall();\n    if (unlikely(!result) && unlikely(!PyErr_Occurred())) {\n        PyErr_SetString(\n            PyExc_SystemError,\n            \"NULL result without error in PyObject_Call\");\n    }\n    return result;\n}\n#endif\n\n/* PyObjectCallMethO */\n#if CYTHON_COMPILING_IN_CPYTHON\nstatic CYTHON_INLINE PyObject* __Pyx_PyObject_CallMethO(PyObject *func, PyObject *arg) {\n    PyObject *self, *result;\n    PyCFunction cfunc;\n    cfunc = PyCFunction_GET_FUNCTION(func);\n    self = PyCFunction_GET_SELF(func);\n    if (unlikely(Py_EnterRecursiveCall((char*)\" while calling a Python object\")))\n        return NULL;\n    result = cfunc(self, arg);\n    Py_LeaveRecursiveCall();\n    if (unlikely(!result) && unlikely(!PyErr_Occurred())) {\n        PyErr_SetString(\n            PyExc_SystemError,\n            \"NULL result without error in PyObject_Call\");\n    }\n    return result;\n}\n#endif\n\n/* PyObjectCallOneArg */\n#if CYTHON_COMPILING_IN_CPYTHON\nstatic PyObject* __Pyx__PyObject_CallOneArg(PyObject *func, PyObject *arg) {\n    PyObject *result;\n    PyObject *args = PyTuple_New(1);\n    if (unlikely(!args)) return NULL;\n    Py_INCREF(arg);\n    PyTuple_SET_ITEM(args, 0, arg);\n    result = __Pyx_PyObject_Call(func, args, NULL);\n    Py_DECREF(args);\n    return result;\n}\nstatic CYTHON_INLINE PyObject* __Pyx_PyObject_CallOneArg(PyObject *func, PyObject *arg) {\n#if CYTHON_FAST_PYCALL\n    if (PyFunction_Check(func)) {\n        return __Pyx_PyFunction_FastCall(func, &arg, 1);\n    }\n#endif\n    if (likely(PyCFunction_Check(func))) {\n        if (likely(PyCFunction_GET_FLAGS(func) & METH_O)) {\n            return __Pyx_PyObject_CallMethO(func, arg);\n#if CYTHON_FAST_PYCCALL\n        } else if (PyCFunction_GET_FLAGS(func) & METH_FASTCALL) {\n            return __Pyx_PyCFunction_FastCall(func, &arg, 1);\n#endif\n        }\n    }\n    return __Pyx__PyObject_CallOneArg(func, arg);\n}\n#else\nstatic CYTHON_INLINE PyObject* __Pyx_PyObject_CallOneArg(PyObject *func, PyObject *arg) {\n    PyObject *result;\n    PyObject *args = PyTuple_Pack(1, arg);\n    if (unlikely(!args)) return NULL;\n    result = __Pyx_PyObject_Call(func, args, NULL);\n    Py_DECREF(args);\n    return result;\n}\n#endif\n\n/* GetModuleGlobalName */\nstatic CYTHON_INLINE PyObject *__Pyx_GetModuleGlobalName(PyObject *name) {\n    PyObject *result;\n#if !CYTHON_AVOID_BORROWED_REFS\n    result = PyDict_GetItem(__pyx_d, name);\n    if (likely(result)) {\n        Py_INCREF(result);\n    } else {\n#else\n    result = PyObject_GetItem(__pyx_d, name);\n    if (!result) {\n        PyErr_Clear();\n#endif\n        result = __Pyx_GetBuiltinName(name);\n    }\n    return result;\n}\n\n/* PyErrFetchRestore */\n  #if CYTHON_FAST_THREAD_STATE\nstatic CYTHON_INLINE void __Pyx_ErrRestoreInState(PyThreadState *tstate, PyObject *type, PyObject *value, PyObject *tb) {\n    PyObject *tmp_type, *tmp_value, *tmp_tb;\n    tmp_type = tstate->curexc_type;\n    tmp_value = tstate->curexc_value;\n    tmp_tb = tstate->curexc_traceback;\n    tstate->curexc_type = type;\n    tstate->curexc_value = value;\n    tstate->curexc_traceback = tb;\n    Py_XDECREF(tmp_type);\n    Py_XDECREF(tmp_value);\n    Py_XDECREF(tmp_tb);\n}\nstatic CYTHON_INLINE void __Pyx_ErrFetchInState(PyThreadState *tstate, PyObject **type, PyObject **value, PyObject **tb) {\n    *type = tstate->curexc_type;\n    *value = tstate->curexc_value;\n    *tb = tstate->curexc_traceback;\n    tstate->curexc_type = 0;\n    tstate->curexc_value = 0;\n    tstate->curexc_traceback = 0;\n}\n#endif\n\n/* RaiseException */\n  #if PY_MAJOR_VERSION < 3\nstatic void __Pyx_Raise(PyObject *type, PyObject *value, PyObject *tb,\n                        CYTHON_UNUSED PyObject *cause) {\n    __Pyx_PyThreadState_declare\n    Py_XINCREF(type);\n    if (!value || value == Py_None)\n        value = NULL;\n    else\n        Py_INCREF(value);\n    if (!tb || tb == Py_None)\n        tb = NULL;\n    else {\n        Py_INCREF(tb);\n        if (!PyTraceBack_Check(tb)) {\n            PyErr_SetString(PyExc_TypeError,\n                \"raise: arg 3 must be a traceback or None\");\n            goto raise_error;\n        }\n    }\n    if (PyType_Check(type)) {\n#if CYTHON_COMPILING_IN_PYPY\n        if (!value) {\n            Py_INCREF(Py_None);\n            value = Py_None;\n        }\n#endif\n        PyErr_NormalizeException(&type, &value, &tb);\n    } else {\n        if (value) {\n            PyErr_SetString(PyExc_TypeError,\n                \"instance exception may not have a separate value\");\n            goto raise_error;\n        }\n        value = type;\n        type = (PyObject*) Py_TYPE(type);\n        Py_INCREF(type);\n        if (!PyType_IsSubtype((PyTypeObject *)type, (PyTypeObject *)PyExc_BaseException)) {\n            PyErr_SetString(PyExc_TypeError,\n                \"raise: exception class must be a subclass of BaseException\");\n            goto raise_error;\n        }\n    }\n    __Pyx_PyThreadState_assign\n    __Pyx_ErrRestore(type, value, tb);\n    return;\nraise_error:\n    Py_XDECREF(value);\n    Py_XDECREF(type);\n    Py_XDECREF(tb);\n    return;\n}\n#else\nstatic void __Pyx_Raise(PyObject *type, PyObject *value, PyObject *tb, PyObject *cause) {\n    PyObject* owned_instance = NULL;\n    if (tb == Py_None) {\n        tb = 0;\n    } else if (tb && !PyTraceBack_Check(tb)) {\n        PyErr_SetString(PyExc_TypeError,\n            \"raise: arg 3 must be a traceback or None\");\n        goto bad;\n    }\n    if (value == Py_None)\n        value = 0;\n    if (PyExceptionInstance_Check(type)) {\n        if (value) {\n            PyErr_SetString(PyExc_TypeError,\n                \"instance exception may not have a separate value\");\n            goto bad;\n        }\n        value = type;\n        type = (PyObject*) Py_TYPE(value);\n    } else if (PyExceptionClass_Check(type)) {\n        PyObject *instance_class = NULL;\n        if (value && PyExceptionInstance_Check(value)) {\n            instance_class = (PyObject*) Py_TYPE(value);\n            if (instance_class != type) {\n                int is_subclass = PyObject_IsSubclass(instance_class, type);\n                if (!is_subclass) {\n                    instance_class = NULL;\n                } else if (unlikely(is_subclass == -1)) {\n                    goto bad;\n                } else {\n                    type = instance_class;\n                }\n            }\n        }\n        if (!instance_class) {\n            PyObject *args;\n            if (!value)\n                args = PyTuple_New(0);\n            else if (PyTuple_Check(value)) {\n                Py_INCREF(value);\n                args = value;\n            } else\n                args = PyTuple_Pack(1, value);\n            if (!args)\n                goto bad;\n            owned_instance = PyObject_Call(type, args, NULL);\n            Py_DECREF(args);\n            if (!owned_instance)\n                goto bad;\n            value = owned_instance;\n            if (!PyExceptionInstance_Check(value)) {\n                PyErr_Format(PyExc_TypeError,\n                             \"calling %R should have returned an instance of \"\n                             \"BaseException, not %R\",\n                             type, Py_TYPE(value));\n                goto bad;\n            }\n        }\n    } else {\n        PyErr_SetString(PyExc_TypeError,\n            \"raise: exception class must be a subclass of BaseException\");\n        goto bad;\n    }\n    if (cause) {\n        PyObject *fixed_cause;\n        if (cause == Py_None) {\n            fixed_cause = NULL;\n        } else if (PyExceptionClass_Check(cause)) {\n            fixed_cause = PyObject_CallObject(cause, NULL);\n            if (fixed_cause == NULL)\n                goto bad;\n        } else if (PyExceptionInstance_Check(cause)) {\n            fixed_cause = cause;\n            Py_INCREF(fixed_cause);\n        } else {\n            PyErr_SetString(PyExc_TypeError,\n                            \"exception causes must derive from \"\n                            \"BaseException\");\n            goto bad;\n        }\n        PyException_SetCause(value, fixed_cause);\n    }\n    PyErr_SetObject(type, value);\n    if (tb) {\n#if CYTHON_COMPILING_IN_PYPY\n        PyObject *tmp_type, *tmp_value, *tmp_tb;\n        PyErr_Fetch(&tmp_type, &tmp_value, &tmp_tb);\n        Py_INCREF(tb);\n        PyErr_Restore(tmp_type, tmp_value, tb);\n        Py_XDECREF(tmp_tb);\n#else\n        PyThreadState *tstate = __Pyx_PyThreadState_Current;\n        PyObject* tmp_tb = tstate->curexc_traceback;\n        if (tb != tmp_tb) {\n            Py_INCREF(tb);\n            tstate->curexc_traceback = tb;\n            Py_XDECREF(tmp_tb);\n        }\n#endif\n    }\nbad:\n    Py_XDECREF(owned_instance);\n    return;\n}\n#endif\n\n/* RaiseArgTupleInvalid */\n  static void __Pyx_RaiseArgtupleInvalid(\n    const char* func_name,\n    int exact,\n    Py_ssize_t num_min,\n    Py_ssize_t num_max,\n    Py_ssize_t num_found)\n{\n    Py_ssize_t num_expected;\n    const char *more_or_less;\n    if (num_found < num_min) {\n        num_expected = num_min;\n        more_or_less = \"at least\";\n    } else {\n        num_expected = num_max;\n        more_or_less = \"at most\";\n    }\n    if (exact) {\n        more_or_less = \"exactly\";\n    }\n    PyErr_Format(PyExc_TypeError,\n                 \"%.200s() takes %.8s %\" CYTHON_FORMAT_SSIZE_T \"d positional argument%.1s (%\" CYTHON_FORMAT_SSIZE_T \"d given)\",\n                 func_name, more_or_less, num_expected,\n                 (num_expected == 1) ? \"\" : \"s\", num_found);\n}\n\n/* RaiseDoubleKeywords */\n  static void __Pyx_RaiseDoubleKeywordsError(\n    const char* func_name,\n    PyObject* kw_name)\n{\n    PyErr_Format(PyExc_TypeError,\n        #if PY_MAJOR_VERSION >= 3\n        \"%s() got multiple values for keyword argument '%U'\", func_name, kw_name);\n        #else\n        \"%s() got multiple values for keyword argument '%s'\", func_name,\n        PyString_AsString(kw_name));\n        #endif\n}\n\n/* ParseKeywords */\n  static int __Pyx_ParseOptionalKeywords(\n    PyObject *kwds,\n    PyObject **argnames[],\n    PyObject *kwds2,\n    PyObject *values[],\n    Py_ssize_t num_pos_args,\n    const char* function_name)\n{\n    PyObject *key = 0, *value = 0;\n    Py_ssize_t pos = 0;\n    PyObject*** name;\n    PyObject*** first_kw_arg = argnames + num_pos_args;\n    while (PyDict_Next(kwds, &pos, &key, &value)) {\n        name = first_kw_arg;\n        while (*name && (**name != key)) name++;\n        if (*name) {\n            values[name-argnames] = value;\n            continue;\n        }\n        name = first_kw_arg;\n        #if PY_MAJOR_VERSION < 3\n        if (likely(PyString_CheckExact(key)) || likely(PyString_Check(key))) {\n            while (*name) {\n                if ((CYTHON_COMPILING_IN_PYPY || PyString_GET_SIZE(**name) == PyString_GET_SIZE(key))\n                        && _PyString_Eq(**name, key)) {\n                    values[name-argnames] = value;\n                    break;\n                }\n                name++;\n            }\n            if (*name) continue;\n            else {\n                PyObject*** argname = argnames;\n                while (argname != first_kw_arg) {\n                    if ((**argname == key) || (\n                            (CYTHON_COMPILING_IN_PYPY || PyString_GET_SIZE(**argname) == PyString_GET_SIZE(key))\n                             && _PyString_Eq(**argname, key))) {\n                        goto arg_passed_twice;\n                    }\n                    argname++;\n                }\n            }\n        } else\n        #endif\n        if (likely(PyUnicode_Check(key))) {\n            while (*name) {\n                int cmp = (**name == key) ? 0 :\n                #if !CYTHON_COMPILING_IN_PYPY && PY_MAJOR_VERSION >= 3\n                    (PyUnicode_GET_SIZE(**name) != PyUnicode_GET_SIZE(key)) ? 1 :\n                #endif\n                    PyUnicode_Compare(**name, key);\n                if (cmp < 0 && unlikely(PyErr_Occurred())) goto bad;\n                if (cmp == 0) {\n                    values[name-argnames] = value;\n                    break;\n                }\n                name++;\n            }\n            if (*name) continue;\n            else {\n                PyObject*** argname = argnames;\n                while (argname != first_kw_arg) {\n                    int cmp = (**argname == key) ? 0 :\n                    #if !CYTHON_COMPILING_IN_PYPY && PY_MAJOR_VERSION >= 3\n                        (PyUnicode_GET_SIZE(**argname) != PyUnicode_GET_SIZE(key)) ? 1 :\n                    #endif\n                        PyUnicode_Compare(**argname, key);\n                    if (cmp < 0 && unlikely(PyErr_Occurred())) goto bad;\n                    if (cmp == 0) goto arg_passed_twice;\n                    argname++;\n                }\n            }\n        } else\n            goto invalid_keyword_type;\n        if (kwds2) {\n            if (unlikely(PyDict_SetItem(kwds2, key, value))) goto bad;\n        } else {\n            goto invalid_keyword;\n        }\n    }\n    return 0;\narg_passed_twice:\n    __Pyx_RaiseDoubleKeywordsError(function_name, key);\n    goto bad;\ninvalid_keyword_type:\n    PyErr_Format(PyExc_TypeError,\n        \"%.200s() keywords must be strings\", function_name);\n    goto bad;\ninvalid_keyword:\n    PyErr_Format(PyExc_TypeError,\n    #if PY_MAJOR_VERSION < 3\n        \"%.200s() got an unexpected keyword argument '%.200s'\",\n        function_name, PyString_AsString(key));\n    #else\n        \"%s() got an unexpected keyword argument '%U'\",\n        function_name, key);\n    #endif\nbad:\n    return -1;\n}\n\n/* PyObjectCallNoArg */\n  #if CYTHON_COMPILING_IN_CPYTHON\nstatic CYTHON_INLINE PyObject* __Pyx_PyObject_CallNoArg(PyObject *func) {\n#if CYTHON_FAST_PYCALL\n    if (PyFunction_Check(func)) {\n        return __Pyx_PyFunction_FastCall(func, NULL, 0);\n    }\n#endif\n#ifdef __Pyx_CyFunction_USED\n    if (likely(PyCFunction_Check(func) || __Pyx_TypeCheck(func, __pyx_CyFunctionType))) {\n#else\n    if (likely(PyCFunction_Check(func))) {\n#endif\n        if (likely(PyCFunction_GET_FLAGS(func) & METH_NOARGS)) {\n            return __Pyx_PyObject_CallMethO(func, NULL);\n        }\n    }\n    return __Pyx_PyObject_Call(func, __pyx_empty_tuple, NULL);\n}\n#endif\n\n/* ExtTypeTest */\n    static CYTHON_INLINE int __Pyx_TypeTest(PyObject *obj, PyTypeObject *type) {\n    if (unlikely(!type)) {\n        PyErr_SetString(PyExc_SystemError, \"Missing type object\");\n        return 0;\n    }\n    if (likely(__Pyx_TypeCheck(obj, type)))\n        return 1;\n    PyErr_Format(PyExc_TypeError, \"Cannot convert %.200s to %.200s\",\n                 Py_TYPE(obj)->tp_name, type->tp_name);\n    return 0;\n}\n\n/* ArgTypeTest */\n    static int __Pyx__ArgTypeTest(PyObject *obj, PyTypeObject *type, const char *name, int exact)\n{\n    if (unlikely(!type)) {\n        PyErr_SetString(PyExc_SystemError, \"Missing type object\");\n        return 0;\n    }\n    else if (exact) {\n        #if PY_MAJOR_VERSION == 2\n        if ((type == &PyBaseString_Type) && likely(__Pyx_PyBaseString_CheckExact(obj))) return 1;\n        #endif\n    }\n    else {\n        if (likely(__Pyx_TypeCheck(obj, type))) return 1;\n    }\n    PyErr_Format(PyExc_TypeError,\n        \"Argument '%.200s' has incorrect type (expected %.200s, got %.200s)\",\n        name, type->tp_name, Py_TYPE(obj)->tp_name);\n    return 0;\n}\n\n/* WriteUnraisableException */\n    static void __Pyx_WriteUnraisable(const char *name, CYTHON_UNUSED int clineno,\n                                  CYTHON_UNUSED int lineno, CYTHON_UNUSED const char *filename,\n                                  int full_traceback, CYTHON_UNUSED int nogil) {\n    PyObject *old_exc, *old_val, *old_tb;\n    PyObject *ctx;\n    __Pyx_PyThreadState_declare\n#ifdef WITH_THREAD\n    PyGILState_STATE state;\n    if (nogil)\n        state = PyGILState_Ensure();\n#ifdef _MSC_VER\n    else state = (PyGILState_STATE)-1;\n#endif\n#endif\n    __Pyx_PyThreadState_assign\n    __Pyx_ErrFetch(&old_exc, &old_val, &old_tb);\n    if (full_traceback) {\n        Py_XINCREF(old_exc);\n        Py_XINCREF(old_val);\n        Py_XINCREF(old_tb);\n        __Pyx_ErrRestore(old_exc, old_val, old_tb);\n        PyErr_PrintEx(1);\n    }\n    #if PY_MAJOR_VERSION < 3\n    ctx = PyString_FromString(name);\n    #else\n    ctx = PyUnicode_FromString(name);\n    #endif\n    __Pyx_ErrRestore(old_exc, old_val, old_tb);\n    if (!ctx) {\n        PyErr_WriteUnraisable(Py_None);\n    } else {\n        PyErr_WriteUnraisable(ctx);\n        Py_DECREF(ctx);\n    }\n#ifdef WITH_THREAD\n    if (nogil)\n        PyGILState_Release(state);\n#endif\n}\n\n/* KeywordStringCheck */\n    static int __Pyx_CheckKeywordStrings(\n    PyObject *kwdict,\n    const char* function_name,\n    int kw_allowed)\n{\n    PyObject* key = 0;\n    Py_ssize_t pos = 0;\n#if CYTHON_COMPILING_IN_PYPY\n    if (!kw_allowed && PyDict_Next(kwdict, &pos, &key, 0))\n        goto invalid_keyword;\n    return 1;\n#else\n    while (PyDict_Next(kwdict, &pos, &key, 0)) {\n        #if PY_MAJOR_VERSION < 3\n        if (unlikely(!PyString_Check(key)))\n        #endif\n            if (unlikely(!PyUnicode_Check(key)))\n                goto invalid_keyword_type;\n    }\n    if ((!kw_allowed) && unlikely(key))\n        goto invalid_keyword;\n    return 1;\ninvalid_keyword_type:\n    PyErr_Format(PyExc_TypeError,\n        \"%.200s() keywords must be strings\", function_name);\n    return 0;\n#endif\ninvalid_keyword:\n    PyErr_Format(PyExc_TypeError,\n    #if PY_MAJOR_VERSION < 3\n        \"%.200s() got an unexpected keyword argument '%.200s'\",\n        function_name, PyString_AsString(key));\n    #else\n        \"%s() got an unexpected keyword argument '%U'\",\n        function_name, key);\n    #endif\n    return 0;\n}\n\n/* SaveResetException */\n    #if CYTHON_FAST_THREAD_STATE\nstatic CYTHON_INLINE void __Pyx__ExceptionSave(PyThreadState *tstate, PyObject **type, PyObject **value, PyObject **tb) {\n    #if PY_VERSION_HEX >= 0x030700A2\n    *type = tstate->exc_state.exc_type;\n    *value = tstate->exc_state.exc_value;\n    *tb = tstate->exc_state.exc_traceback;\n    #else\n    *type = tstate->exc_type;\n    *value = tstate->exc_value;\n    *tb = tstate->exc_traceback;\n    #endif\n    Py_XINCREF(*type);\n    Py_XINCREF(*value);\n    Py_XINCREF(*tb);\n}\nstatic CYTHON_INLINE void __Pyx__ExceptionReset(PyThreadState *tstate, PyObject *type, PyObject *value, PyObject *tb) {\n    PyObject *tmp_type, *tmp_value, *tmp_tb;\n    #if PY_VERSION_HEX >= 0x030700A2\n    tmp_type = tstate->exc_state.exc_type;\n    tmp_value = tstate->exc_state.exc_value;\n    tmp_tb = tstate->exc_state.exc_traceback;\n    tstate->exc_state.exc_type = type;\n    tstate->exc_state.exc_value = value;\n    tstate->exc_state.exc_traceback = tb;\n    #else\n    tmp_type = tstate->exc_type;\n    tmp_value = tstate->exc_value;\n    tmp_tb = tstate->exc_traceback;\n    tstate->exc_type = type;\n    tstate->exc_value = value;\n    tstate->exc_traceback = tb;\n    #endif\n    Py_XDECREF(tmp_type);\n    Py_XDECREF(tmp_value);\n    Py_XDECREF(tmp_tb);\n}\n#endif\n\n/* PyErrExceptionMatches */\n    #if CYTHON_FAST_THREAD_STATE\nstatic int __Pyx_PyErr_ExceptionMatchesTuple(PyObject *exc_type, PyObject *tuple) {\n    Py_ssize_t i, n;\n    n = PyTuple_GET_SIZE(tuple);\n#if PY_MAJOR_VERSION >= 3\n    for (i=0; i<n; i++) {\n        if (exc_type == PyTuple_GET_ITEM(tuple, i)) return 1;\n    }\n#endif\n    for (i=0; i<n; i++) {\n        if (__Pyx_PyErr_GivenExceptionMatches(exc_type, PyTuple_GET_ITEM(tuple, i))) return 1;\n    }\n    return 0;\n}\nstatic CYTHON_INLINE int __Pyx_PyErr_ExceptionMatchesInState(PyThreadState* tstate, PyObject* err) {\n    PyObject *exc_type = tstate->curexc_type;\n    if (exc_type == err) return 1;\n    if (unlikely(!exc_type)) return 0;\n    if (unlikely(PyTuple_Check(err)))\n        return __Pyx_PyErr_ExceptionMatchesTuple(exc_type, err);\n    return __Pyx_PyErr_GivenExceptionMatches(exc_type, err);\n}\n#endif\n\n/* GetException */\n    #if CYTHON_FAST_THREAD_STATE\nstatic int __Pyx__GetException(PyThreadState *tstate, PyObject **type, PyObject **value, PyObject **tb) {\n#else\nstatic int __Pyx_GetException(PyObject **type, PyObject **value, PyObject **tb) {\n#endif\n    PyObject *local_type, *local_value, *local_tb;\n#if CYTHON_FAST_THREAD_STATE\n    PyObject *tmp_type, *tmp_value, *tmp_tb;\n    local_type = tstate->curexc_type;\n    local_value = tstate->curexc_value;\n    local_tb = tstate->curexc_traceback;\n    tstate->curexc_type = 0;\n    tstate->curexc_value = 0;\n    tstate->curexc_traceback = 0;\n#else\n    PyErr_Fetch(&local_type, &local_value, &local_tb);\n#endif\n    PyErr_NormalizeException(&local_type, &local_value, &local_tb);\n#if CYTHON_FAST_THREAD_STATE\n    if (unlikely(tstate->curexc_type))\n#else\n    if (unlikely(PyErr_Occurred()))\n#endif\n        goto bad;\n    #if PY_MAJOR_VERSION >= 3\n    if (local_tb) {\n        if (unlikely(PyException_SetTraceback(local_value, local_tb) < 0))\n            goto bad;\n    }\n    #endif\n    Py_XINCREF(local_tb);\n    Py_XINCREF(local_type);\n    Py_XINCREF(local_value);\n    *type = local_type;\n    *value = local_value;\n    *tb = local_tb;\n#if CYTHON_FAST_THREAD_STATE\n    #if PY_VERSION_HEX >= 0x030700A2\n    tmp_type = tstate->exc_state.exc_type;\n    tmp_value = tstate->exc_state.exc_value;\n    tmp_tb = tstate->exc_state.exc_traceback;\n    tstate->exc_state.exc_type = local_type;\n    tstate->exc_state.exc_value = local_value;\n    tstate->exc_state.exc_traceback = local_tb;\n    #else\n    tmp_type = tstate->exc_type;\n    tmp_value = tstate->exc_value;\n    tmp_tb = tstate->exc_traceback;\n    tstate->exc_type = local_type;\n    tstate->exc_value = local_value;\n    tstate->exc_traceback = local_tb;\n    #endif\n    Py_XDECREF(tmp_type);\n    Py_XDECREF(tmp_value);\n    Py_XDECREF(tmp_tb);\n#else\n    PyErr_SetExcInfo(local_type, local_value, local_tb);\n#endif\n    return 0;\nbad:\n    *type = 0;\n    *value = 0;\n    *tb = 0;\n    Py_XDECREF(local_type);\n    Py_XDECREF(local_value);\n    Py_XDECREF(local_tb);\n    return -1;\n}\n\n/* RaiseTooManyValuesToUnpack */\n      static CYTHON_INLINE void __Pyx_RaiseTooManyValuesError(Py_ssize_t expected) {\n    PyErr_Format(PyExc_ValueError,\n                 \"too many values to unpack (expected %\" CYTHON_FORMAT_SSIZE_T \"d)\", expected);\n}\n\n/* RaiseNeedMoreValuesToUnpack */\n      static CYTHON_INLINE void __Pyx_RaiseNeedMoreValuesError(Py_ssize_t index) {\n    PyErr_Format(PyExc_ValueError,\n                 \"need more than %\" CYTHON_FORMAT_SSIZE_T \"d value%.1s to unpack\",\n                 index, (index == 1) ? \"\" : \"s\");\n}\n\n/* IterFinish */\n      static CYTHON_INLINE int __Pyx_IterFinish(void) {\n#if CYTHON_FAST_THREAD_STATE\n    PyThreadState *tstate = __Pyx_PyThreadState_Current;\n    PyObject* exc_type = tstate->curexc_type;\n    if (unlikely(exc_type)) {\n        if (likely(__Pyx_PyErr_GivenExceptionMatches(exc_type, PyExc_StopIteration))) {\n            PyObject *exc_value, *exc_tb;\n            exc_value = tstate->curexc_value;\n            exc_tb = tstate->curexc_traceback;\n            tstate->curexc_type = 0;\n            tstate->curexc_value = 0;\n            tstate->curexc_traceback = 0;\n            Py_DECREF(exc_type);\n            Py_XDECREF(exc_value);\n            Py_XDECREF(exc_tb);\n            return 0;\n        } else {\n            return -1;\n        }\n    }\n    return 0;\n#else\n    if (unlikely(PyErr_Occurred())) {\n        if (likely(PyErr_ExceptionMatches(PyExc_StopIteration))) {\n            PyErr_Clear();\n            return 0;\n        } else {\n            return -1;\n        }\n    }\n    return 0;\n#endif\n}\n\n/* UnpackItemEndCheck */\n      static int __Pyx_IternextUnpackEndCheck(PyObject *retval, Py_ssize_t expected) {\n    if (unlikely(retval)) {\n        Py_DECREF(retval);\n        __Pyx_RaiseTooManyValuesError(expected);\n        return -1;\n    } else {\n        return __Pyx_IterFinish();\n    }\n    return 0;\n}\n\n/* IterNext */\n      static PyObject *__Pyx_PyIter_Next2Default(PyObject* defval) {\n    PyObject* exc_type;\n    __Pyx_PyThreadState_declare\n    __Pyx_PyThreadState_assign\n    exc_type = __Pyx_PyErr_Occurred();\n    if (unlikely(exc_type)) {\n        if (unlikely(!__Pyx_PyErr_GivenExceptionMatches(exc_type, PyExc_StopIteration)))\n            return NULL;\n        if (defval) {\n            __Pyx_PyErr_Clear();\n            Py_INCREF(defval);\n        }\n        return defval;\n    }\n    if (defval) {\n        Py_INCREF(defval);\n        return defval;\n    }\n    __Pyx_PyErr_SetNone(PyExc_StopIteration);\n    return NULL;\n}\nstatic void __Pyx_PyIter_Next_ErrorNoIterator(PyObject *iterator) {\n    PyErr_Format(PyExc_TypeError,\n        \"%.200s object is not an iterator\", Py_TYPE(iterator)->tp_name);\n}\nstatic CYTHON_INLINE PyObject *__Pyx_PyIter_Next2(PyObject* iterator, PyObject* defval) {\n    PyObject* next;\n    iternextfunc iternext = Py_TYPE(iterator)->tp_iternext;\n    if (likely(iternext)) {\n#if CYTHON_USE_TYPE_SLOTS\n        next = iternext(iterator);\n        if (likely(next))\n            return next;\n        #if PY_VERSION_HEX >= 0x02070000\n        if (unlikely(iternext == &_PyObject_NextNotImplemented))\n            return NULL;\n        #endif\n#else\n        next = PyIter_Next(iterator);\n        if (likely(next))\n            return next;\n#endif\n    } else if (CYTHON_USE_TYPE_SLOTS || !PyIter_Check(iterator)) {\n        __Pyx_PyIter_Next_ErrorNoIterator(iterator);\n        return NULL;\n    }\n    return __Pyx_PyIter_Next2Default(defval);\n}\n\n/* SetVTable */\n      static int __Pyx_SetVtable(PyObject *dict, void *vtable) {\n#if PY_VERSION_HEX >= 0x02070000\n    PyObject *ob = PyCapsule_New(vtable, 0, 0);\n#else\n    PyObject *ob = PyCObject_FromVoidPtr(vtable, 0);\n#endif\n    if (!ob)\n        goto bad;\n    if (PyDict_SetItem(dict, __pyx_n_s_pyx_vtable, ob) < 0)\n        goto bad;\n    Py_DECREF(ob);\n    return 0;\nbad:\n    Py_XDECREF(ob);\n    return -1;\n}\n\n/* SetupReduce */\n      static int __Pyx_setup_reduce_is_named(PyObject* meth, PyObject* name) {\n  int ret;\n  PyObject *name_attr;\n  name_attr = __Pyx_PyObject_GetAttrStr(meth, __pyx_n_s_name);\n  if (likely(name_attr)) {\n      ret = PyObject_RichCompareBool(name_attr, name, Py_EQ);\n  } else {\n      ret = -1;\n  }\n  if (unlikely(ret < 0)) {\n      PyErr_Clear();\n      ret = 0;\n  }\n  Py_XDECREF(name_attr);\n  return ret;\n}\nstatic int __Pyx_setup_reduce(PyObject* type_obj) {\n    int ret = 0;\n    PyObject *object_reduce = NULL;\n    PyObject *object_reduce_ex = NULL;\n    PyObject *reduce = NULL;\n    PyObject *reduce_ex = NULL;\n    PyObject *reduce_cython = NULL;\n    PyObject *setstate = NULL;\n    PyObject *setstate_cython = NULL;\n#if CYTHON_USE_PYTYPE_LOOKUP\n    if (_PyType_Lookup((PyTypeObject*)type_obj, __pyx_n_s_getstate)) goto GOOD;\n#else\n    if (PyObject_HasAttr(type_obj, __pyx_n_s_getstate)) goto GOOD;\n#endif\n#if CYTHON_USE_PYTYPE_LOOKUP\n    object_reduce_ex = _PyType_Lookup(&PyBaseObject_Type, __pyx_n_s_reduce_ex); if (!object_reduce_ex) goto BAD;\n#else\n    object_reduce_ex = __Pyx_PyObject_GetAttrStr((PyObject*)&PyBaseObject_Type, __pyx_n_s_reduce_ex); if (!object_reduce_ex) goto BAD;\n#endif\n    reduce_ex = __Pyx_PyObject_GetAttrStr(type_obj, __pyx_n_s_reduce_ex); if (unlikely(!reduce_ex)) goto BAD;\n    if (reduce_ex == object_reduce_ex) {\n#if CYTHON_USE_PYTYPE_LOOKUP\n        object_reduce = _PyType_Lookup(&PyBaseObject_Type, __pyx_n_s_reduce); if (!object_reduce) goto BAD;\n#else\n        object_reduce = __Pyx_PyObject_GetAttrStr((PyObject*)&PyBaseObject_Type, __pyx_n_s_reduce); if (!object_reduce) goto BAD;\n#endif\n        reduce = __Pyx_PyObject_GetAttrStr(type_obj, __pyx_n_s_reduce); if (unlikely(!reduce)) goto BAD;\n        if (reduce == object_reduce || __Pyx_setup_reduce_is_named(reduce, __pyx_n_s_reduce_cython)) {\n            reduce_cython = __Pyx_PyObject_GetAttrStr(type_obj, __pyx_n_s_reduce_cython); if (unlikely(!reduce_cython)) goto BAD;\n            ret = PyDict_SetItem(((PyTypeObject*)type_obj)->tp_dict, __pyx_n_s_reduce, reduce_cython); if (unlikely(ret < 0)) goto BAD;\n            ret = PyDict_DelItem(((PyTypeObject*)type_obj)->tp_dict, __pyx_n_s_reduce_cython); if (unlikely(ret < 0)) goto BAD;\n            setstate = __Pyx_PyObject_GetAttrStr(type_obj, __pyx_n_s_setstate);\n            if (!setstate) PyErr_Clear();\n            if (!setstate || __Pyx_setup_reduce_is_named(setstate, __pyx_n_s_setstate_cython)) {\n                setstate_cython = __Pyx_PyObject_GetAttrStr(type_obj, __pyx_n_s_setstate_cython); if (unlikely(!setstate_cython)) goto BAD;\n                ret = PyDict_SetItem(((PyTypeObject*)type_obj)->tp_dict, __pyx_n_s_setstate, setstate_cython); if (unlikely(ret < 0)) goto BAD;\n                ret = PyDict_DelItem(((PyTypeObject*)type_obj)->tp_dict, __pyx_n_s_setstate_cython); if (unlikely(ret < 0)) goto BAD;\n            }\n            PyType_Modified((PyTypeObject*)type_obj);\n        }\n    }\n    goto GOOD;\nBAD:\n    if (!PyErr_Occurred())\n        PyErr_Format(PyExc_RuntimeError, \"Unable to initialize pickling for %s\", ((PyTypeObject*)type_obj)->tp_name);\n    ret = -1;\nGOOD:\n#if !CYTHON_USE_PYTYPE_LOOKUP\n    Py_XDECREF(object_reduce);\n    Py_XDECREF(object_reduce_ex);\n#endif\n    Py_XDECREF(reduce);\n    Py_XDECREF(reduce_ex);\n    Py_XDECREF(reduce_cython);\n    Py_XDECREF(setstate);\n    Py_XDECREF(setstate_cython);\n    return ret;\n}\n\n/* Import */\n      static PyObject *__Pyx_Import(PyObject *name, PyObject *from_list, int level) {\n    PyObject *empty_list = 0;\n    PyObject *module = 0;\n    PyObject *global_dict = 0;\n    PyObject *empty_dict = 0;\n    PyObject *list;\n    #if PY_MAJOR_VERSION < 3\n    PyObject *py_import;\n    py_import = __Pyx_PyObject_GetAttrStr(__pyx_b, __pyx_n_s_import);\n    if (!py_import)\n        goto bad;\n    #endif\n    if (from_list)\n        list = from_list;\n    else {\n        empty_list = PyList_New(0);\n        if (!empty_list)\n            goto bad;\n        list = empty_list;\n    }\n    global_dict = PyModule_GetDict(__pyx_m);\n    if (!global_dict)\n        goto bad;\n    empty_dict = PyDict_New();\n    if (!empty_dict)\n        goto bad;\n    {\n        #if PY_MAJOR_VERSION >= 3\n        if (level == -1) {\n            if (strchr(__Pyx_MODULE_NAME, '.')) {\n                module = PyImport_ImportModuleLevelObject(\n                    name, global_dict, empty_dict, list, 1);\n                if (!module) {\n                    if (!PyErr_ExceptionMatches(PyExc_ImportError))\n                        goto bad;\n                    PyErr_Clear();\n                }\n            }\n            level = 0;\n        }\n        #endif\n        if (!module) {\n            #if PY_MAJOR_VERSION < 3\n            PyObject *py_level = PyInt_FromLong(level);\n            if (!py_level)\n                goto bad;\n            module = PyObject_CallFunctionObjArgs(py_import,\n                name, global_dict, empty_dict, list, py_level, NULL);\n            Py_DECREF(py_level);\n            #else\n            module = PyImport_ImportModuleLevelObject(\n                name, global_dict, empty_dict, list, level);\n            #endif\n        }\n    }\nbad:\n    #if PY_MAJOR_VERSION < 3\n    Py_XDECREF(py_import);\n    #endif\n    Py_XDECREF(empty_list);\n    Py_XDECREF(empty_dict);\n    return module;\n}\n\n/* CalculateMetaclass */\n      static PyObject *__Pyx_CalculateMetaclass(PyTypeObject *metaclass, PyObject *bases) {\n    Py_ssize_t i, nbases = PyTuple_GET_SIZE(bases);\n    for (i=0; i < nbases; i++) {\n        PyTypeObject *tmptype;\n        PyObject *tmp = PyTuple_GET_ITEM(bases, i);\n        tmptype = Py_TYPE(tmp);\n#if PY_MAJOR_VERSION < 3\n        if (tmptype == &PyClass_Type)\n            continue;\n#endif\n        if (!metaclass) {\n            metaclass = tmptype;\n            continue;\n        }\n        if (PyType_IsSubtype(metaclass, tmptype))\n            continue;\n        if (PyType_IsSubtype(tmptype, metaclass)) {\n            metaclass = tmptype;\n            continue;\n        }\n        PyErr_SetString(PyExc_TypeError,\n                        \"metaclass conflict: \"\n                        \"the metaclass of a derived class \"\n                        \"must be a (non-strict) subclass \"\n                        \"of the metaclasses of all its bases\");\n        return NULL;\n    }\n    if (!metaclass) {\n#if PY_MAJOR_VERSION < 3\n        metaclass = &PyClass_Type;\n#else\n        metaclass = &PyType_Type;\n#endif\n    }\n    Py_INCREF((PyObject*) metaclass);\n    return (PyObject*) metaclass;\n}\n\n/* Py3ClassCreate */\n      static PyObject *__Pyx_Py3MetaclassPrepare(PyObject *metaclass, PyObject *bases, PyObject *name,\n                                           PyObject *qualname, PyObject *mkw, PyObject *modname, PyObject *doc) {\n    PyObject *ns;\n    if (metaclass) {\n        PyObject *prep = __Pyx_PyObject_GetAttrStr(metaclass, __pyx_n_s_prepare);\n        if (prep) {\n            PyObject *pargs = PyTuple_Pack(2, name, bases);\n            if (unlikely(!pargs)) {\n                Py_DECREF(prep);\n                return NULL;\n            }\n            ns = PyObject_Call(prep, pargs, mkw);\n            Py_DECREF(prep);\n            Py_DECREF(pargs);\n        } else {\n            if (unlikely(!PyErr_ExceptionMatches(PyExc_AttributeError)))\n                return NULL;\n            PyErr_Clear();\n            ns = PyDict_New();\n        }\n    } else {\n        ns = PyDict_New();\n    }\n    if (unlikely(!ns))\n        return NULL;\n    if (unlikely(PyObject_SetItem(ns, __pyx_n_s_module, modname) < 0)) goto bad;\n    if (unlikely(PyObject_SetItem(ns, __pyx_n_s_qualname, qualname) < 0)) goto bad;\n    if (unlikely(doc && PyObject_SetItem(ns, __pyx_n_s_doc, doc) < 0)) goto bad;\n    return ns;\nbad:\n    Py_DECREF(ns);\n    return NULL;\n}\nstatic PyObject *__Pyx_Py3ClassCreate(PyObject *metaclass, PyObject *name, PyObject *bases,\n                                      PyObject *dict, PyObject *mkw,\n                                      int calculate_metaclass, int allow_py2_metaclass) {\n    PyObject *result, *margs;\n    PyObject *owned_metaclass = NULL;\n    if (allow_py2_metaclass) {\n        owned_metaclass = PyObject_GetItem(dict, __pyx_n_s_metaclass);\n        if (owned_metaclass) {\n            metaclass = owned_metaclass;\n        } else if (likely(PyErr_ExceptionMatches(PyExc_KeyError))) {\n            PyErr_Clear();\n        } else {\n            return NULL;\n        }\n    }\n    if (calculate_metaclass && (!metaclass || PyType_Check(metaclass))) {\n        metaclass = __Pyx_CalculateMetaclass((PyTypeObject*) metaclass, bases);\n        Py_XDECREF(owned_metaclass);\n        if (unlikely(!metaclass))\n            return NULL;\n        owned_metaclass = metaclass;\n    }\n    margs = PyTuple_Pack(3, name, bases, dict);\n    if (unlikely(!margs)) {\n        result = NULL;\n    } else {\n        result = PyObject_Call(metaclass, margs, mkw);\n        Py_DECREF(margs);\n    }\n    Py_XDECREF(owned_metaclass);\n    return result;\n}\n\n/* GetNameInClass */\n      static PyObject *__Pyx_GetGlobalNameAfterAttributeLookup(PyObject *name) {\n    __Pyx_PyThreadState_declare\n    __Pyx_PyThreadState_assign\n    if (unlikely(!__Pyx_PyErr_ExceptionMatches(PyExc_AttributeError)))\n        return NULL;\n    __Pyx_PyErr_Clear();\n    return __Pyx_GetModuleGlobalName(name);\n}\nstatic PyObject *__Pyx_GetNameInClass(PyObject *nmspace, PyObject *name) {\n    PyObject *result;\n    result = __Pyx_PyObject_GetAttrStr(nmspace, name);\n    if (!result) {\n        result = __Pyx_GetGlobalNameAfterAttributeLookup(name);\n    }\n    return result;\n}\n\n/* ClassMethod */\n      static PyObject* __Pyx_Method_ClassMethod(PyObject *method) {\n#if CYTHON_COMPILING_IN_PYPY && PYPY_VERSION_NUM <= 0x05080000\n    if (PyObject_TypeCheck(method, &PyWrapperDescr_Type)) {\n        return PyClassMethod_New(method);\n    }\n#else\n#if CYTHON_COMPILING_IN_PYSTON || CYTHON_COMPILING_IN_PYPY\n    if (PyMethodDescr_Check(method)) {\n#else\n    static PyTypeObject *methoddescr_type = NULL;\n    if (methoddescr_type == NULL) {\n       PyObject *meth = PyObject_GetAttrString((PyObject*)&PyList_Type, \"append\");\n       if (!meth) return NULL;\n       methoddescr_type = Py_TYPE(meth);\n       Py_DECREF(meth);\n    }\n    if (__Pyx_TypeCheck(method, methoddescr_type)) {\n#endif\n        PyMethodDescrObject *descr = (PyMethodDescrObject *)method;\n        #if PY_VERSION_HEX < 0x03020000\n        PyTypeObject *d_type = descr->d_type;\n        #else\n        PyTypeObject *d_type = descr->d_common.d_type;\n        #endif\n        return PyDescr_NewClassMethod(d_type, descr->d_method);\n    }\n#endif\n    else if (PyMethod_Check(method)) {\n        return PyClassMethod_New(PyMethod_GET_FUNCTION(method));\n    }\n    else if (PyCFunction_Check(method)) {\n        return PyClassMethod_New(method);\n    }\n#ifdef __Pyx_CyFunction_USED\n    else if (__Pyx_TypeCheck(method, __pyx_CyFunctionType)) {\n        return PyClassMethod_New(method);\n    }\n#endif\n    PyErr_SetString(PyExc_TypeError,\n                   \"Class-level classmethod() can only be called on \"\n                   \"a method_descriptor or instance method.\");\n    return NULL;\n}\n\n/* FetchCommonType */\n        static PyTypeObject* __Pyx_FetchCommonType(PyTypeObject* type) {\n    PyObject* fake_module;\n    PyTypeObject* cached_type = NULL;\n    fake_module = PyImport_AddModule((char*) \"_cython_\" CYTHON_ABI);\n    if (!fake_module) return NULL;\n    Py_INCREF(fake_module);\n    cached_type = (PyTypeObject*) PyObject_GetAttrString(fake_module, type->tp_name);\n    if (cached_type) {\n        if (!PyType_Check((PyObject*)cached_type)) {\n            PyErr_Format(PyExc_TypeError,\n                \"Shared Cython type %.200s is not a type object\",\n                type->tp_name);\n            goto bad;\n        }\n        if (cached_type->tp_basicsize != type->tp_basicsize) {\n            PyErr_Format(PyExc_TypeError,\n                \"Shared Cython type %.200s has the wrong size, try recompiling\",\n                type->tp_name);\n            goto bad;\n        }\n    } else {\n        if (!PyErr_ExceptionMatches(PyExc_AttributeError)) goto bad;\n        PyErr_Clear();\n        if (PyType_Ready(type) < 0) goto bad;\n        if (PyObject_SetAttrString(fake_module, type->tp_name, (PyObject*) type) < 0)\n            goto bad;\n        Py_INCREF(type);\n        cached_type = type;\n    }\ndone:\n    Py_DECREF(fake_module);\n    return cached_type;\nbad:\n    Py_XDECREF(cached_type);\n    cached_type = NULL;\n    goto done;\n}\n\n/* CythonFunction */\n        static PyObject *\n__Pyx_CyFunction_get_doc(__pyx_CyFunctionObject *op, CYTHON_UNUSED void *closure)\n{\n    if (unlikely(op->func_doc == NULL)) {\n        if (op->func.m_ml->ml_doc) {\n#if PY_MAJOR_VERSION >= 3\n            op->func_doc = PyUnicode_FromString(op->func.m_ml->ml_doc);\n#else\n            op->func_doc = PyString_FromString(op->func.m_ml->ml_doc);\n#endif\n            if (unlikely(op->func_doc == NULL))\n                return NULL;\n        } else {\n            Py_INCREF(Py_None);\n            return Py_None;\n        }\n    }\n    Py_INCREF(op->func_doc);\n    return op->func_doc;\n}\nstatic int\n__Pyx_CyFunction_set_doc(__pyx_CyFunctionObject *op, PyObject *value)\n{\n    PyObject *tmp = op->func_doc;\n    if (value == NULL) {\n        value = Py_None;\n    }\n    Py_INCREF(value);\n    op->func_doc = value;\n    Py_XDECREF(tmp);\n    return 0;\n}\nstatic PyObject *\n__Pyx_CyFunction_get_name(__pyx_CyFunctionObject *op)\n{\n    if (unlikely(op->func_name == NULL)) {\n#if PY_MAJOR_VERSION >= 3\n        op->func_name = PyUnicode_InternFromString(op->func.m_ml->ml_name);\n#else\n        op->func_name = PyString_InternFromString(op->func.m_ml->ml_name);\n#endif\n        if (unlikely(op->func_name == NULL))\n            return NULL;\n    }\n    Py_INCREF(op->func_name);\n    return op->func_name;\n}\nstatic int\n__Pyx_CyFunction_set_name(__pyx_CyFunctionObject *op, PyObject *value)\n{\n    PyObject *tmp;\n#if PY_MAJOR_VERSION >= 3\n    if (unlikely(value == NULL || !PyUnicode_Check(value))) {\n#else\n    if (unlikely(value == NULL || !PyString_Check(value))) {\n#endif\n        PyErr_SetString(PyExc_TypeError,\n                        \"__name__ must be set to a string object\");\n        return -1;\n    }\n    tmp = op->func_name;\n    Py_INCREF(value);\n    op->func_name = value;\n    Py_XDECREF(tmp);\n    return 0;\n}\nstatic PyObject *\n__Pyx_CyFunction_get_qualname(__pyx_CyFunctionObject *op)\n{\n    Py_INCREF(op->func_qualname);\n    return op->func_qualname;\n}\nstatic int\n__Pyx_CyFunction_set_qualname(__pyx_CyFunctionObject *op, PyObject *value)\n{\n    PyObject *tmp;\n#if PY_MAJOR_VERSION >= 3\n    if (unlikely(value == NULL || !PyUnicode_Check(value))) {\n#else\n    if (unlikely(value == NULL || !PyString_Check(value))) {\n#endif\n        PyErr_SetString(PyExc_TypeError,\n                        \"__qualname__ must be set to a string object\");\n        return -1;\n    }\n    tmp = op->func_qualname;\n    Py_INCREF(value);\n    op->func_qualname = value;\n    Py_XDECREF(tmp);\n    return 0;\n}\nstatic PyObject *\n__Pyx_CyFunction_get_self(__pyx_CyFunctionObject *m, CYTHON_UNUSED void *closure)\n{\n    PyObject *self;\n    self = m->func_closure;\n    if (self == NULL)\n        self = Py_None;\n    Py_INCREF(self);\n    return self;\n}\nstatic PyObject *\n__Pyx_CyFunction_get_dict(__pyx_CyFunctionObject *op)\n{\n    if (unlikely(op->func_dict == NULL)) {\n        op->func_dict = PyDict_New();\n        if (unlikely(op->func_dict == NULL))\n            return NULL;\n    }\n    Py_INCREF(op->func_dict);\n    return op->func_dict;\n}\nstatic int\n__Pyx_CyFunction_set_dict(__pyx_CyFunctionObject *op, PyObject *value)\n{\n    PyObject *tmp;\n    if (unlikely(value == NULL)) {\n        PyErr_SetString(PyExc_TypeError,\n               \"function's dictionary may not be deleted\");\n        return -1;\n    }\n    if (unlikely(!PyDict_Check(value))) {\n        PyErr_SetString(PyExc_TypeError,\n               \"setting function's dictionary to a non-dict\");\n        return -1;\n    }\n    tmp = op->func_dict;\n    Py_INCREF(value);\n    op->func_dict = value;\n    Py_XDECREF(tmp);\n    return 0;\n}\nstatic PyObject *\n__Pyx_CyFunction_get_globals(__pyx_CyFunctionObject *op)\n{\n    Py_INCREF(op->func_globals);\n    return op->func_globals;\n}\nstatic PyObject *\n__Pyx_CyFunction_get_closure(CYTHON_UNUSED __pyx_CyFunctionObject *op)\n{\n    Py_INCREF(Py_None);\n    return Py_None;\n}\nstatic PyObject *\n__Pyx_CyFunction_get_code(__pyx_CyFunctionObject *op)\n{\n    PyObject* result = (op->func_code) ? op->func_code : Py_None;\n    Py_INCREF(result);\n    return result;\n}\nstatic int\n__Pyx_CyFunction_init_defaults(__pyx_CyFunctionObject *op) {\n    int result = 0;\n    PyObject *res = op->defaults_getter((PyObject *) op);\n    if (unlikely(!res))\n        return -1;\n    #if CYTHON_ASSUME_SAFE_MACROS && !CYTHON_AVOID_BORROWED_REFS\n    op->defaults_tuple = PyTuple_GET_ITEM(res, 0);\n    Py_INCREF(op->defaults_tuple);\n    op->defaults_kwdict = PyTuple_GET_ITEM(res, 1);\n    Py_INCREF(op->defaults_kwdict);\n    #else\n    op->defaults_tuple = PySequence_ITEM(res, 0);\n    if (unlikely(!op->defaults_tuple)) result = -1;\n    else {\n        op->defaults_kwdict = PySequence_ITEM(res, 1);\n        if (unlikely(!op->defaults_kwdict)) result = -1;\n    }\n    #endif\n    Py_DECREF(res);\n    return result;\n}\nstatic int\n__Pyx_CyFunction_set_defaults(__pyx_CyFunctionObject *op, PyObject* value) {\n    PyObject* tmp;\n    if (!value) {\n        value = Py_None;\n    } else if (value != Py_None && !PyTuple_Check(value)) {\n        PyErr_SetString(PyExc_TypeError,\n                        \"__defaults__ must be set to a tuple object\");\n        return -1;\n    }\n    Py_INCREF(value);\n    tmp = op->defaults_tuple;\n    op->defaults_tuple = value;\n    Py_XDECREF(tmp);\n    return 0;\n}\nstatic PyObject *\n__Pyx_CyFunction_get_defaults(__pyx_CyFunctionObject *op) {\n    PyObject* result = op->defaults_tuple;\n    if (unlikely(!result)) {\n        if (op->defaults_getter) {\n            if (__Pyx_CyFunction_init_defaults(op) < 0) return NULL;\n            result = op->defaults_tuple;\n        } else {\n            result = Py_None;\n        }\n    }\n    Py_INCREF(result);\n    return result;\n}\nstatic int\n__Pyx_CyFunction_set_kwdefaults(__pyx_CyFunctionObject *op, PyObject* value) {\n    PyObject* tmp;\n    if (!value) {\n        value = Py_None;\n    } else if (value != Py_None && !PyDict_Check(value)) {\n        PyErr_SetString(PyExc_TypeError,\n                        \"__kwdefaults__ must be set to a dict object\");\n        return -1;\n    }\n    Py_INCREF(value);\n    tmp = op->defaults_kwdict;\n    op->defaults_kwdict = value;\n    Py_XDECREF(tmp);\n    return 0;\n}\nstatic PyObject *\n__Pyx_CyFunction_get_kwdefaults(__pyx_CyFunctionObject *op) {\n    PyObject* result = op->defaults_kwdict;\n    if (unlikely(!result)) {\n        if (op->defaults_getter) {\n            if (__Pyx_CyFunction_init_defaults(op) < 0) return NULL;\n            result = op->defaults_kwdict;\n        } else {\n            result = Py_None;\n        }\n    }\n    Py_INCREF(result);\n    return result;\n}\nstatic int\n__Pyx_CyFunction_set_annotations(__pyx_CyFunctionObject *op, PyObject* value) {\n    PyObject* tmp;\n    if (!value || value == Py_None) {\n        value = NULL;\n    } else if (!PyDict_Check(value)) {\n        PyErr_SetString(PyExc_TypeError,\n                        \"__annotations__ must be set to a dict object\");\n        return -1;\n    }\n    Py_XINCREF(value);\n    tmp = op->func_annotations;\n    op->func_annotations = value;\n    Py_XDECREF(tmp);\n    return 0;\n}\nstatic PyObject *\n__Pyx_CyFunction_get_annotations(__pyx_CyFunctionObject *op) {\n    PyObject* result = op->func_annotations;\n    if (unlikely(!result)) {\n        result = PyDict_New();\n        if (unlikely(!result)) return NULL;\n        op->func_annotations = result;\n    }\n    Py_INCREF(result);\n    return result;\n}\nstatic PyGetSetDef __pyx_CyFunction_getsets[] = {\n    {(char *) \"func_doc\", (getter)__Pyx_CyFunction_get_doc, (setter)__Pyx_CyFunction_set_doc, 0, 0},\n    {(char *) \"__doc__\",  (getter)__Pyx_CyFunction_get_doc, (setter)__Pyx_CyFunction_set_doc, 0, 0},\n    {(char *) \"func_name\", (getter)__Pyx_CyFunction_get_name, (setter)__Pyx_CyFunction_set_name, 0, 0},\n    {(char *) \"__name__\", (getter)__Pyx_CyFunction_get_name, (setter)__Pyx_CyFunction_set_name, 0, 0},\n    {(char *) \"__qualname__\", (getter)__Pyx_CyFunction_get_qualname, (setter)__Pyx_CyFunction_set_qualname, 0, 0},\n    {(char *) \"__self__\", (getter)__Pyx_CyFunction_get_self, 0, 0, 0},\n    {(char *) \"func_dict\", (getter)__Pyx_CyFunction_get_dict, (setter)__Pyx_CyFunction_set_dict, 0, 0},\n    {(char *) \"__dict__\", (getter)__Pyx_CyFunction_get_dict, (setter)__Pyx_CyFunction_set_dict, 0, 0},\n    {(char *) \"func_globals\", (getter)__Pyx_CyFunction_get_globals, 0, 0, 0},\n    {(char *) \"__globals__\", (getter)__Pyx_CyFunction_get_globals, 0, 0, 0},\n    {(char *) \"func_closure\", (getter)__Pyx_CyFunction_get_closure, 0, 0, 0},\n    {(char *) \"__closure__\", (getter)__Pyx_CyFunction_get_closure, 0, 0, 0},\n    {(char *) \"func_code\", (getter)__Pyx_CyFunction_get_code, 0, 0, 0},\n    {(char *) \"__code__\", (getter)__Pyx_CyFunction_get_code, 0, 0, 0},\n    {(char *) \"func_defaults\", (getter)__Pyx_CyFunction_get_defaults, (setter)__Pyx_CyFunction_set_defaults, 0, 0},\n    {(char *) \"__defaults__\", (getter)__Pyx_CyFunction_get_defaults, (setter)__Pyx_CyFunction_set_defaults, 0, 0},\n    {(char *) \"__kwdefaults__\", (getter)__Pyx_CyFunction_get_kwdefaults, (setter)__Pyx_CyFunction_set_kwdefaults, 0, 0},\n    {(char *) \"__annotations__\", (getter)__Pyx_CyFunction_get_annotations, (setter)__Pyx_CyFunction_set_annotations, 0, 0},\n    {0, 0, 0, 0, 0}\n};\nstatic PyMemberDef __pyx_CyFunction_members[] = {\n    {(char *) \"__module__\", T_OBJECT, offsetof(PyCFunctionObject, m_module), PY_WRITE_RESTRICTED, 0},\n    {0, 0, 0,  0, 0}\n};\nstatic PyObject *\n__Pyx_CyFunction_reduce(__pyx_CyFunctionObject *m, CYTHON_UNUSED PyObject *args)\n{\n#if PY_MAJOR_VERSION >= 3\n    return PyUnicode_FromString(m->func.m_ml->ml_name);\n#else\n    return PyString_FromString(m->func.m_ml->ml_name);\n#endif\n}\nstatic PyMethodDef __pyx_CyFunction_methods[] = {\n    {\"__reduce__\", (PyCFunction)__Pyx_CyFunction_reduce, METH_VARARGS, 0},\n    {0, 0, 0, 0}\n};\n#if PY_VERSION_HEX < 0x030500A0\n#define __Pyx_CyFunction_weakreflist(cyfunc) ((cyfunc)->func_weakreflist)\n#else\n#define __Pyx_CyFunction_weakreflist(cyfunc) ((cyfunc)->func.m_weakreflist)\n#endif\nstatic PyObject *__Pyx_CyFunction_New(PyTypeObject *type, PyMethodDef *ml, int flags, PyObject* qualname,\n                                      PyObject *closure, PyObject *module, PyObject* globals, PyObject* code) {\n    __pyx_CyFunctionObject *op = PyObject_GC_New(__pyx_CyFunctionObject, type);\n    if (op == NULL)\n        return NULL;\n    op->flags = flags;\n    __Pyx_CyFunction_weakreflist(op) = NULL;\n    op->func.m_ml = ml;\n    op->func.m_self = (PyObject *) op;\n    Py_XINCREF(closure);\n    op->func_closure = closure;\n    Py_XINCREF(module);\n    op->func.m_module = module;\n    op->func_dict = NULL;\n    op->func_name = NULL;\n    Py_INCREF(qualname);\n    op->func_qualname = qualname;\n    op->func_doc = NULL;\n    op->func_classobj = NULL;\n    op->func_globals = globals;\n    Py_INCREF(op->func_globals);\n    Py_XINCREF(code);\n    op->func_code = code;\n    op->defaults_pyobjects = 0;\n    op->defaults = NULL;\n    op->defaults_tuple = NULL;\n    op->defaults_kwdict = NULL;\n    op->defaults_getter = NULL;\n    op->func_annotations = NULL;\n    PyObject_GC_Track(op);\n    return (PyObject *) op;\n}\nstatic int\n__Pyx_CyFunction_clear(__pyx_CyFunctionObject *m)\n{\n    Py_CLEAR(m->func_closure);\n    Py_CLEAR(m->func.m_module);\n    Py_CLEAR(m->func_dict);\n    Py_CLEAR(m->func_name);\n    Py_CLEAR(m->func_qualname);\n    Py_CLEAR(m->func_doc);\n    Py_CLEAR(m->func_globals);\n    Py_CLEAR(m->func_code);\n    Py_CLEAR(m->func_classobj);\n    Py_CLEAR(m->defaults_tuple);\n    Py_CLEAR(m->defaults_kwdict);\n    Py_CLEAR(m->func_annotations);\n    if (m->defaults) {\n        PyObject **pydefaults = __Pyx_CyFunction_Defaults(PyObject *, m);\n        int i;\n        for (i = 0; i < m->defaults_pyobjects; i++)\n            Py_XDECREF(pydefaults[i]);\n        PyObject_Free(m->defaults);\n        m->defaults = NULL;\n    }\n    return 0;\n}\nstatic void __Pyx__CyFunction_dealloc(__pyx_CyFunctionObject *m)\n{\n    if (__Pyx_CyFunction_weakreflist(m) != NULL)\n        PyObject_ClearWeakRefs((PyObject *) m);\n    __Pyx_CyFunction_clear(m);\n    PyObject_GC_Del(m);\n}\nstatic void __Pyx_CyFunction_dealloc(__pyx_CyFunctionObject *m)\n{\n    PyObject_GC_UnTrack(m);\n    __Pyx__CyFunction_dealloc(m);\n}\nstatic int __Pyx_CyFunction_traverse(__pyx_CyFunctionObject *m, visitproc visit, void *arg)\n{\n    Py_VISIT(m->func_closure);\n    Py_VISIT(m->func.m_module);\n    Py_VISIT(m->func_dict);\n    Py_VISIT(m->func_name);\n    Py_VISIT(m->func_qualname);\n    Py_VISIT(m->func_doc);\n    Py_VISIT(m->func_globals);\n    Py_VISIT(m->func_code);\n    Py_VISIT(m->func_classobj);\n    Py_VISIT(m->defaults_tuple);\n    Py_VISIT(m->defaults_kwdict);\n    if (m->defaults) {\n        PyObject **pydefaults = __Pyx_CyFunction_Defaults(PyObject *, m);\n        int i;\n        for (i = 0; i < m->defaults_pyobjects; i++)\n            Py_VISIT(pydefaults[i]);\n    }\n    return 0;\n}\nstatic PyObject *__Pyx_CyFunction_descr_get(PyObject *func, PyObject *obj, PyObject *type)\n{\n    __pyx_CyFunctionObject *m = (__pyx_CyFunctionObject *) func;\n    if (m->flags & __Pyx_CYFUNCTION_STATICMETHOD) {\n        Py_INCREF(func);\n        return func;\n    }\n    if (m->flags & __Pyx_CYFUNCTION_CLASSMETHOD) {\n        if (type == NULL)\n            type = (PyObject *)(Py_TYPE(obj));\n        return __Pyx_PyMethod_New(func, type, (PyObject *)(Py_TYPE(type)));\n    }\n    if (obj == Py_None)\n        obj = NULL;\n    return __Pyx_PyMethod_New(func, obj, type);\n}\nstatic PyObject*\n__Pyx_CyFunction_repr(__pyx_CyFunctionObject *op)\n{\n#if PY_MAJOR_VERSION >= 3\n    return PyUnicode_FromFormat(\"<cyfunction %U at %p>\",\n                                op->func_qualname, (void *)op);\n#else\n    return PyString_FromFormat(\"<cyfunction %s at %p>\",\n                               PyString_AsString(op->func_qualname), (void *)op);\n#endif\n}\nstatic PyObject * __Pyx_CyFunction_CallMethod(PyObject *func, PyObject *self, PyObject *arg, PyObject *kw) {\n    PyCFunctionObject* f = (PyCFunctionObject*)func;\n    PyCFunction meth = f->m_ml->ml_meth;\n    Py_ssize_t size;\n    switch (f->m_ml->ml_flags & (METH_VARARGS | METH_KEYWORDS | METH_NOARGS | METH_O)) {\n    case METH_VARARGS:\n        if (likely(kw == NULL || PyDict_Size(kw) == 0))\n            return (*meth)(self, arg);\n        break;\n    case METH_VARARGS | METH_KEYWORDS:\n        return (*(PyCFunctionWithKeywords)meth)(self, arg, kw);\n    case METH_NOARGS:\n        if (likely(kw == NULL || PyDict_Size(kw) == 0)) {\n            size = PyTuple_GET_SIZE(arg);\n            if (likely(size == 0))\n                return (*meth)(self, NULL);\n            PyErr_Format(PyExc_TypeError,\n                \"%.200s() takes no arguments (%\" CYTHON_FORMAT_SSIZE_T \"d given)\",\n                f->m_ml->ml_name, size);\n            return NULL;\n        }\n        break;\n    case METH_O:\n        if (likely(kw == NULL || PyDict_Size(kw) == 0)) {\n            size = PyTuple_GET_SIZE(arg);\n            if (likely(size == 1)) {\n                PyObject *result, *arg0;\n                #if CYTHON_ASSUME_SAFE_MACROS && !CYTHON_AVOID_BORROWED_REFS\n                arg0 = PyTuple_GET_ITEM(arg, 0);\n                #else\n                arg0 = PySequence_ITEM(arg, 0); if (unlikely(!arg0)) return NULL;\n                #endif\n                result = (*meth)(self, arg0);\n                #if !(CYTHON_ASSUME_SAFE_MACROS && !CYTHON_AVOID_BORROWED_REFS)\n                Py_DECREF(arg0);\n                #endif\n                return result;\n            }\n            PyErr_Format(PyExc_TypeError,\n                \"%.200s() takes exactly one argument (%\" CYTHON_FORMAT_SSIZE_T \"d given)\",\n                f->m_ml->ml_name, size);\n            return NULL;\n        }\n        break;\n    default:\n        PyErr_SetString(PyExc_SystemError, \"Bad call flags in \"\n                        \"__Pyx_CyFunction_Call. METH_OLDARGS is no \"\n                        \"longer supported!\");\n        return NULL;\n    }\n    PyErr_Format(PyExc_TypeError, \"%.200s() takes no keyword arguments\",\n                 f->m_ml->ml_name);\n    return NULL;\n}\nstatic CYTHON_INLINE PyObject *__Pyx_CyFunction_Call(PyObject *func, PyObject *arg, PyObject *kw) {\n    return __Pyx_CyFunction_CallMethod(func, ((PyCFunctionObject*)func)->m_self, arg, kw);\n}\nstatic PyObject *__Pyx_CyFunction_CallAsMethod(PyObject *func, PyObject *args, PyObject *kw) {\n    PyObject *result;\n    __pyx_CyFunctionObject *cyfunc = (__pyx_CyFunctionObject *) func;\n    if ((cyfunc->flags & __Pyx_CYFUNCTION_CCLASS) && !(cyfunc->flags & __Pyx_CYFUNCTION_STATICMETHOD)) {\n        Py_ssize_t argc;\n        PyObject *new_args;\n        PyObject *self;\n        argc = PyTuple_GET_SIZE(args);\n        new_args = PyTuple_GetSlice(args, 1, argc);\n        if (unlikely(!new_args))\n            return NULL;\n        self = PyTuple_GetItem(args, 0);\n        if (unlikely(!self)) {\n            Py_DECREF(new_args);\n            return NULL;\n        }\n        result = __Pyx_CyFunction_CallMethod(func, self, new_args, kw);\n        Py_DECREF(new_args);\n    } else {\n        result = __Pyx_CyFunction_Call(func, args, kw);\n    }\n    return result;\n}\nstatic PyTypeObject __pyx_CyFunctionType_type = {\n    PyVarObject_HEAD_INIT(0, 0)\n    \"cython_function_or_method\",\n    sizeof(__pyx_CyFunctionObject),\n    0,\n    (destructor) __Pyx_CyFunction_dealloc,\n    0,\n    0,\n    0,\n#if PY_MAJOR_VERSION < 3\n    0,\n#else\n    0,\n#endif\n    (reprfunc) __Pyx_CyFunction_repr,\n    0,\n    0,\n    0,\n    0,\n    __Pyx_CyFunction_CallAsMethod,\n    0,\n    0,\n    0,\n    0,\n    Py_TPFLAGS_DEFAULT | Py_TPFLAGS_HAVE_GC,\n    0,\n    (traverseproc) __Pyx_CyFunction_traverse,\n    (inquiry) __Pyx_CyFunction_clear,\n    0,\n#if PY_VERSION_HEX < 0x030500A0\n    offsetof(__pyx_CyFunctionObject, func_weakreflist),\n#else\n    offsetof(PyCFunctionObject, m_weakreflist),\n#endif\n    0,\n    0,\n    __pyx_CyFunction_methods,\n    __pyx_CyFunction_members,\n    __pyx_CyFunction_getsets,\n    0,\n    0,\n    __Pyx_CyFunction_descr_get,\n    0,\n    offsetof(__pyx_CyFunctionObject, func_dict),\n    0,\n    0,\n    0,\n    0,\n    0,\n    0,\n    0,\n    0,\n    0,\n    0,\n    0,\n    0,\n#if PY_VERSION_HEX >= 0x030400a1\n    0,\n#endif\n};\nstatic int __pyx_CyFunction_init(void) {\n    __pyx_CyFunctionType = __Pyx_FetchCommonType(&__pyx_CyFunctionType_type);\n    if (unlikely(__pyx_CyFunctionType == NULL)) {\n        return -1;\n    }\n    return 0;\n}\nstatic CYTHON_INLINE void *__Pyx_CyFunction_InitDefaults(PyObject *func, size_t size, int pyobjects) {\n    __pyx_CyFunctionObject *m = (__pyx_CyFunctionObject *) func;\n    m->defaults = PyObject_Malloc(size);\n    if (unlikely(!m->defaults))\n        return PyErr_NoMemory();\n    memset(m->defaults, 0, size);\n    m->defaults_pyobjects = pyobjects;\n    return m->defaults;\n}\nstatic CYTHON_INLINE void __Pyx_CyFunction_SetDefaultsTuple(PyObject *func, PyObject *tuple) {\n    __pyx_CyFunctionObject *m = (__pyx_CyFunctionObject *) func;\n    m->defaults_tuple = tuple;\n    Py_INCREF(tuple);\n}\nstatic CYTHON_INLINE void __Pyx_CyFunction_SetDefaultsKwDict(PyObject *func, PyObject *dict) {\n    __pyx_CyFunctionObject *m = (__pyx_CyFunctionObject *) func;\n    m->defaults_kwdict = dict;\n    Py_INCREF(dict);\n}\nstatic CYTHON_INLINE void __Pyx_CyFunction_SetAnnotationsDict(PyObject *func, PyObject *dict) {\n    __pyx_CyFunctionObject *m = (__pyx_CyFunctionObject *) func;\n    m->func_annotations = dict;\n    Py_INCREF(dict);\n}\n\n/* CLineInTraceback */\n            #ifndef CYTHON_CLINE_IN_TRACEBACK\nstatic int __Pyx_CLineForTraceback(CYTHON_UNUSED PyThreadState *tstate, int c_line) {\n    PyObject *use_cline;\n    PyObject *ptype, *pvalue, *ptraceback;\n#if CYTHON_COMPILING_IN_CPYTHON\n    PyObject **cython_runtime_dict;\n#endif\n    __Pyx_ErrFetchInState(tstate, &ptype, &pvalue, &ptraceback);\n#if CYTHON_COMPILING_IN_CPYTHON\n    cython_runtime_dict = _PyObject_GetDictPtr(__pyx_cython_runtime);\n    if (likely(cython_runtime_dict)) {\n      use_cline = PyDict_GetItem(*cython_runtime_dict, __pyx_n_s_cline_in_traceback);\n    } else\n#endif\n    {\n      PyObject *use_cline_obj = __Pyx_PyObject_GetAttrStr(__pyx_cython_runtime, __pyx_n_s_cline_in_traceback);\n      if (use_cline_obj) {\n        use_cline = PyObject_Not(use_cline_obj) ? Py_False : Py_True;\n        Py_DECREF(use_cline_obj);\n      } else {\n        PyErr_Clear();\n        use_cline = NULL;\n      }\n    }\n    if (!use_cline) {\n        c_line = 0;\n        PyObject_SetAttr(__pyx_cython_runtime, __pyx_n_s_cline_in_traceback, Py_False);\n    }\n    else if (PyObject_Not(use_cline) != 0) {\n        c_line = 0;\n    }\n    __Pyx_ErrRestoreInState(tstate, ptype, pvalue, ptraceback);\n    return c_line;\n}\n#endif\n\n/* CodeObjectCache */\n            static int __pyx_bisect_code_objects(__Pyx_CodeObjectCacheEntry* entries, int count, int code_line) {\n    int start = 0, mid = 0, end = count - 1;\n    if (end >= 0 && code_line > entries[end].code_line) {\n        return count;\n    }\n    while (start < end) {\n        mid = start + (end - start) / 2;\n        if (code_line < entries[mid].code_line) {\n            end = mid;\n        } else if (code_line > entries[mid].code_line) {\n             start = mid + 1;\n        } else {\n            return mid;\n        }\n    }\n    if (code_line <= entries[mid].code_line) {\n        return mid;\n    } else {\n        return mid + 1;\n    }\n}\nstatic PyCodeObject *__pyx_find_code_object(int code_line) {\n    PyCodeObject* code_object;\n    int pos;\n    if (unlikely(!code_line) || unlikely(!__pyx_code_cache.entries)) {\n        return NULL;\n    }\n    pos = __pyx_bisect_code_objects(__pyx_code_cache.entries, __pyx_code_cache.count, code_line);\n    if (unlikely(pos >= __pyx_code_cache.count) || unlikely(__pyx_code_cache.entries[pos].code_line != code_line)) {\n        return NULL;\n    }\n    code_object = __pyx_code_cache.entries[pos].code_object;\n    Py_INCREF(code_object);\n    return code_object;\n}\nstatic void __pyx_insert_code_object(int code_line, PyCodeObject* code_object) {\n    int pos, i;\n    __Pyx_CodeObjectCacheEntry* entries = __pyx_code_cache.entries;\n    if (unlikely(!code_line)) {\n        return;\n    }\n    if (unlikely(!entries)) {\n        entries = (__Pyx_CodeObjectCacheEntry*)PyMem_Malloc(64*sizeof(__Pyx_CodeObjectCacheEntry));\n        if (likely(entries)) {\n            __pyx_code_cache.entries = entries;\n            __pyx_code_cache.max_count = 64;\n            __pyx_code_cache.count = 1;\n            entries[0].code_line = code_line;\n            entries[0].code_object = code_object;\n            Py_INCREF(code_object);\n        }\n        return;\n    }\n    pos = __pyx_bisect_code_objects(__pyx_code_cache.entries, __pyx_code_cache.count, code_line);\n    if ((pos < __pyx_code_cache.count) && unlikely(__pyx_code_cache.entries[pos].code_line == code_line)) {\n        PyCodeObject* tmp = entries[pos].code_object;\n        entries[pos].code_object = code_object;\n        Py_DECREF(tmp);\n        return;\n    }\n    if (__pyx_code_cache.count == __pyx_code_cache.max_count) {\n        int new_max = __pyx_code_cache.max_count + 64;\n        entries = (__Pyx_CodeObjectCacheEntry*)PyMem_Realloc(\n            __pyx_code_cache.entries, (size_t)new_max*sizeof(__Pyx_CodeObjectCacheEntry));\n        if (unlikely(!entries)) {\n            return;\n        }\n        __pyx_code_cache.entries = entries;\n        __pyx_code_cache.max_count = new_max;\n    }\n    for (i=__pyx_code_cache.count; i>pos; i--) {\n        entries[i] = entries[i-1];\n    }\n    entries[pos].code_line = code_line;\n    entries[pos].code_object = code_object;\n    __pyx_code_cache.count++;\n    Py_INCREF(code_object);\n}\n\n/* AddTraceback */\n            #include \"compile.h\"\n#include \"frameobject.h\"\n#include \"traceback.h\"\nstatic PyCodeObject* __Pyx_CreateCodeObjectForTraceback(\n            const char *funcname, int c_line,\n            int py_line, const char *filename) {\n    PyCodeObject *py_code = 0;\n    PyObject *py_srcfile = 0;\n    PyObject *py_funcname = 0;\n    #if PY_MAJOR_VERSION < 3\n    py_srcfile = PyString_FromString(filename);\n    #else\n    py_srcfile = PyUnicode_FromString(filename);\n    #endif\n    if (!py_srcfile) goto bad;\n    if (c_line) {\n        #if PY_MAJOR_VERSION < 3\n        py_funcname = PyString_FromFormat( \"%s (%s:%d)\", funcname, __pyx_cfilenm, c_line);\n        #else\n        py_funcname = PyUnicode_FromFormat( \"%s (%s:%d)\", funcname, __pyx_cfilenm, c_line);\n        #endif\n    }\n    else {\n        #if PY_MAJOR_VERSION < 3\n        py_funcname = PyString_FromString(funcname);\n        #else\n        py_funcname = PyUnicode_FromString(funcname);\n        #endif\n    }\n    if (!py_funcname) goto bad;\n    py_code = __Pyx_PyCode_New(\n        0,\n        0,\n        0,\n        0,\n        0,\n        __pyx_empty_bytes, /*PyObject *code,*/\n        __pyx_empty_tuple, /*PyObject *consts,*/\n        __pyx_empty_tuple, /*PyObject *names,*/\n        __pyx_empty_tuple, /*PyObject *varnames,*/\n        __pyx_empty_tuple, /*PyObject *freevars,*/\n        __pyx_empty_tuple, /*PyObject *cellvars,*/\n        py_srcfile,   /*PyObject *filename,*/\n        py_funcname,  /*PyObject *name,*/\n        py_line,\n        __pyx_empty_bytes  /*PyObject *lnotab*/\n    );\n    Py_DECREF(py_srcfile);\n    Py_DECREF(py_funcname);\n    return py_code;\nbad:\n    Py_XDECREF(py_srcfile);\n    Py_XDECREF(py_funcname);\n    return NULL;\n}\nstatic void __Pyx_AddTraceback(const char *funcname, int c_line,\n                               int py_line, const char *filename) {\n    PyCodeObject *py_code = 0;\n    PyFrameObject *py_frame = 0;\n    PyThreadState *tstate = __Pyx_PyThreadState_Current;\n    if (c_line) {\n        c_line = __Pyx_CLineForTraceback(tstate, c_line);\n    }\n    py_code = __pyx_find_code_object(c_line ? -c_line : py_line);\n    if (!py_code) {\n        py_code = __Pyx_CreateCodeObjectForTraceback(\n            funcname, c_line, py_line, filename);\n        if (!py_code) goto bad;\n        __pyx_insert_code_object(c_line ? -c_line : py_line, py_code);\n    }\n    py_frame = PyFrame_New(\n        tstate,            /*PyThreadState *tstate,*/\n        py_code,           /*PyCodeObject *code,*/\n        __pyx_d,    /*PyObject *globals,*/\n        0                  /*PyObject *locals*/\n    );\n    if (!py_frame) goto bad;\n    __Pyx_PyFrame_SetLineNumber(py_frame, py_line);\n    PyTraceBack_Here(py_frame);\nbad:\n    Py_XDECREF(py_code);\n    Py_XDECREF(py_frame);\n}\n\n/* CIntFromPyVerify */\n            #define __PYX_VERIFY_RETURN_INT(target_type, func_type, func_value)\\\n    __PYX__VERIFY_RETURN_INT(target_type, func_type, func_value, 0)\n#define __PYX_VERIFY_RETURN_INT_EXC(target_type, func_type, func_value)\\\n    __PYX__VERIFY_RETURN_INT(target_type, func_type, func_value, 1)\n#define __PYX__VERIFY_RETURN_INT(target_type, func_type, func_value, exc)\\\n    {\\\n        func_type value = func_value;\\\n        if (sizeof(target_type) < sizeof(func_type)) {\\\n            if (unlikely(value != (func_type) (target_type) value)) {\\\n                func_type zero = 0;\\\n                if (exc && unlikely(value == (func_type)-1 && PyErr_Occurred()))\\\n                    return (target_type) -1;\\\n                if (is_unsigned && unlikely(value < zero))\\\n                    goto raise_neg_overflow;\\\n                else\\\n                    goto raise_overflow;\\\n            }\\\n        }\\\n        return (target_type) value;\\\n    }\n\n/* CIntToPy */\n            static CYTHON_INLINE PyObject* __Pyx_PyInt_From_int(int value) {\n    const int neg_one = (int) -1, const_zero = (int) 0;\n    const int is_unsigned = neg_one > const_zero;\n    if (is_unsigned) {\n        if (sizeof(int) < sizeof(long)) {\n            return PyInt_FromLong((long) value);\n        } else if (sizeof(int) <= sizeof(unsigned long)) {\n            return PyLong_FromUnsignedLong((unsigned long) value);\n#ifdef HAVE_LONG_LONG\n        } else if (sizeof(int) <= sizeof(unsigned PY_LONG_LONG)) {\n            return PyLong_FromUnsignedLongLong((unsigned PY_LONG_LONG) value);\n#endif\n        }\n    } else {\n        if (sizeof(int) <= sizeof(long)) {\n            return PyInt_FromLong((long) value);\n#ifdef HAVE_LONG_LONG\n        } else if (sizeof(int) <= sizeof(PY_LONG_LONG)) {\n            return PyLong_FromLongLong((PY_LONG_LONG) value);\n#endif\n        }\n    }\n    {\n        int one = 1; int little = (int)*(unsigned char *)&one;\n        unsigned char *bytes = (unsigned char *)&value;\n        return _PyLong_FromByteArray(bytes, sizeof(int),\n                                     little, !is_unsigned);\n    }\n}\n\n/* CIntToPy */\n            static CYTHON_INLINE PyObject* __Pyx_PyInt_From_uint64_t(uint64_t value) {\n    const uint64_t neg_one = (uint64_t) -1, const_zero = (uint64_t) 0;\n    const int is_unsigned = neg_one > const_zero;\n    if (is_unsigned) {\n        if (sizeof(uint64_t) < sizeof(long)) {\n            return PyInt_FromLong((long) value);\n        } else if (sizeof(uint64_t) <= sizeof(unsigned long)) {\n            return PyLong_FromUnsignedLong((unsigned long) value);\n#ifdef HAVE_LONG_LONG\n        } else if (sizeof(uint64_t) <= sizeof(unsigned PY_LONG_LONG)) {\n            return PyLong_FromUnsignedLongLong((unsigned PY_LONG_LONG) value);\n#endif\n        }\n    } else {\n        if (sizeof(uint64_t) <= sizeof(long)) {\n            return PyInt_FromLong((long) value);\n#ifdef HAVE_LONG_LONG\n        } else if (sizeof(uint64_t) <= sizeof(PY_LONG_LONG)) {\n            return PyLong_FromLongLong((PY_LONG_LONG) value);\n#endif\n        }\n    }\n    {\n        int one = 1; int little = (int)*(unsigned char *)&one;\n        unsigned char *bytes = (unsigned char *)&value;\n        return _PyLong_FromByteArray(bytes, sizeof(uint64_t),\n                                     little, !is_unsigned);\n    }\n}\n\n/* CIntToPy */\n            static CYTHON_INLINE PyObject* __Pyx_PyInt_From_uint32_t(uint32_t value) {\n    const uint32_t neg_one = (uint32_t) -1, const_zero = (uint32_t) 0;\n    const int is_unsigned = neg_one > const_zero;\n    if (is_unsigned) {\n        if (sizeof(uint32_t) < sizeof(long)) {\n            return PyInt_FromLong((long) value);\n        } else if (sizeof(uint32_t) <= sizeof(unsigned long)) {\n            return PyLong_FromUnsignedLong((unsigned long) value);\n#ifdef HAVE_LONG_LONG\n        } else if (sizeof(uint32_t) <= sizeof(unsigned PY_LONG_LONG)) {\n            return PyLong_FromUnsignedLongLong((unsigned PY_LONG_LONG) value);\n#endif\n        }\n    } else {\n        if (sizeof(uint32_t) <= sizeof(long)) {\n            return PyInt_FromLong((long) value);\n#ifdef HAVE_LONG_LONG\n        } else if (sizeof(uint32_t) <= sizeof(PY_LONG_LONG)) {\n            return PyLong_FromLongLong((PY_LONG_LONG) value);\n#endif\n        }\n    }\n    {\n        int one = 1; int little = (int)*(unsigned char *)&one;\n        unsigned char *bytes = (unsigned char *)&value;\n        return _PyLong_FromByteArray(bytes, sizeof(uint32_t),\n                                     little, !is_unsigned);\n    }\n}\n\n/* CIntToPy */\n            static CYTHON_INLINE PyObject* __Pyx_PyInt_From_int64_t(int64_t value) {\n    const int64_t neg_one = (int64_t) -1, const_zero = (int64_t) 0;\n    const int is_unsigned = neg_one > const_zero;\n    if (is_unsigned) {\n        if (sizeof(int64_t) < sizeof(long)) {\n            return PyInt_FromLong((long) value);\n        } else if (sizeof(int64_t) <= sizeof(unsigned long)) {\n            return PyLong_FromUnsignedLong((unsigned long) value);\n#ifdef HAVE_LONG_LONG\n        } else if (sizeof(int64_t) <= sizeof(unsigned PY_LONG_LONG)) {\n            return PyLong_FromUnsignedLongLong((unsigned PY_LONG_LONG) value);\n#endif\n        }\n    } else {\n        if (sizeof(int64_t) <= sizeof(long)) {\n            return PyInt_FromLong((long) value);\n#ifdef HAVE_LONG_LONG\n        } else if (sizeof(int64_t) <= sizeof(PY_LONG_LONG)) {\n            return PyLong_FromLongLong((PY_LONG_LONG) value);\n#endif\n        }\n    }\n    {\n        int one = 1; int little = (int)*(unsigned char *)&one;\n        unsigned char *bytes = (unsigned char *)&value;\n        return _PyLong_FromByteArray(bytes, sizeof(int64_t),\n                                     little, !is_unsigned);\n    }\n}\n\n/* CIntToPy */\n            static CYTHON_INLINE PyObject* __Pyx_PyInt_From_int32_t(int32_t value) {\n    const int32_t neg_one = (int32_t) -1, const_zero = (int32_t) 0;\n    const int is_unsigned = neg_one > const_zero;\n    if (is_unsigned) {\n        if (sizeof(int32_t) < sizeof(long)) {\n            return PyInt_FromLong((long) value);\n        } else if (sizeof(int32_t) <= sizeof(unsigned long)) {\n            return PyLong_FromUnsignedLong((unsigned long) value);\n#ifdef HAVE_LONG_LONG\n        } else if (sizeof(int32_t) <= sizeof(unsigned PY_LONG_LONG)) {\n            return PyLong_FromUnsignedLongLong((unsigned PY_LONG_LONG) value);\n#endif\n        }\n    } else {\n        if (sizeof(int32_t) <= sizeof(long)) {\n            return PyInt_FromLong((long) value);\n#ifdef HAVE_LONG_LONG\n        } else if (sizeof(int32_t) <= sizeof(PY_LONG_LONG)) {\n            return PyLong_FromLongLong((PY_LONG_LONG) value);\n#endif\n        }\n    }\n    {\n        int one = 1; int little = (int)*(unsigned char *)&one;\n        unsigned char *bytes = (unsigned char *)&value;\n        return _PyLong_FromByteArray(bytes, sizeof(int32_t),\n                                     little, !is_unsigned);\n    }\n}\n\n/* CIntFromPy */\n            static CYTHON_INLINE size_t __Pyx_PyInt_As_size_t(PyObject *x) {\n    const size_t neg_one = (size_t) -1, const_zero = (size_t) 0;\n    const int is_unsigned = neg_one > const_zero;\n#if PY_MAJOR_VERSION < 3\n    if (likely(PyInt_Check(x))) {\n        if (sizeof(size_t) < sizeof(long)) {\n            __PYX_VERIFY_RETURN_INT(size_t, long, PyInt_AS_LONG(x))\n        } else {\n            long val = PyInt_AS_LONG(x);\n            if (is_unsigned && unlikely(val < 0)) {\n                goto raise_neg_overflow;\n            }\n            return (size_t) val;\n        }\n    } else\n#endif\n    if (likely(PyLong_Check(x))) {\n        if (is_unsigned) {\n#if CYTHON_USE_PYLONG_INTERNALS\n            const digit* digits = ((PyLongObject*)x)->ob_digit;\n            switch (Py_SIZE(x)) {\n                case  0: return (size_t) 0;\n                case  1: __PYX_VERIFY_RETURN_INT(size_t, digit, digits[0])\n                case 2:\n                    if (8 * sizeof(size_t) > 1 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 2 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(size_t, unsigned long, (((((unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(size_t) >= 2 * PyLong_SHIFT) {\n                            return (size_t) (((((size_t)digits[1]) << PyLong_SHIFT) | (size_t)digits[0]));\n                        }\n                    }\n                    break;\n                case 3:\n                    if (8 * sizeof(size_t) > 2 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 3 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(size_t, unsigned long, (((((((unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(size_t) >= 3 * PyLong_SHIFT) {\n                            return (size_t) (((((((size_t)digits[2]) << PyLong_SHIFT) | (size_t)digits[1]) << PyLong_SHIFT) | (size_t)digits[0]));\n                        }\n                    }\n                    break;\n                case 4:\n                    if (8 * sizeof(size_t) > 3 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 4 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(size_t, unsigned long, (((((((((unsigned long)digits[3]) << PyLong_SHIFT) | (unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(size_t) >= 4 * PyLong_SHIFT) {\n                            return (size_t) (((((((((size_t)digits[3]) << PyLong_SHIFT) | (size_t)digits[2]) << PyLong_SHIFT) | (size_t)digits[1]) << PyLong_SHIFT) | (size_t)digits[0]));\n                        }\n                    }\n                    break;\n            }\n#endif\n#if CYTHON_COMPILING_IN_CPYTHON\n            if (unlikely(Py_SIZE(x) < 0)) {\n                goto raise_neg_overflow;\n            }\n#else\n            {\n                int result = PyObject_RichCompareBool(x, Py_False, Py_LT);\n                if (unlikely(result < 0))\n                    return (size_t) -1;\n                if (unlikely(result == 1))\n                    goto raise_neg_overflow;\n            }\n#endif\n            if (sizeof(size_t) <= sizeof(unsigned long)) {\n                __PYX_VERIFY_RETURN_INT_EXC(size_t, unsigned long, PyLong_AsUnsignedLong(x))\n#ifdef HAVE_LONG_LONG\n            } else if (sizeof(size_t) <= sizeof(unsigned PY_LONG_LONG)) {\n                __PYX_VERIFY_RETURN_INT_EXC(size_t, unsigned PY_LONG_LONG, PyLong_AsUnsignedLongLong(x))\n#endif\n            }\n        } else {\n#if CYTHON_USE_PYLONG_INTERNALS\n            const digit* digits = ((PyLongObject*)x)->ob_digit;\n            switch (Py_SIZE(x)) {\n                case  0: return (size_t) 0;\n                case -1: __PYX_VERIFY_RETURN_INT(size_t, sdigit, (sdigit) (-(sdigit)digits[0]))\n                case  1: __PYX_VERIFY_RETURN_INT(size_t,  digit, +digits[0])\n                case -2:\n                    if (8 * sizeof(size_t) - 1 > 1 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 2 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(size_t, long, -(long) (((((unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(size_t) - 1 > 2 * PyLong_SHIFT) {\n                            return (size_t) (((size_t)-1)*(((((size_t)digits[1]) << PyLong_SHIFT) | (size_t)digits[0])));\n                        }\n                    }\n                    break;\n                case 2:\n                    if (8 * sizeof(size_t) > 1 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 2 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(size_t, unsigned long, (((((unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(size_t) - 1 > 2 * PyLong_SHIFT) {\n                            return (size_t) ((((((size_t)digits[1]) << PyLong_SHIFT) | (size_t)digits[0])));\n                        }\n                    }\n                    break;\n                case -3:\n                    if (8 * sizeof(size_t) - 1 > 2 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 3 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(size_t, long, -(long) (((((((unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(size_t) - 1 > 3 * PyLong_SHIFT) {\n                            return (size_t) (((size_t)-1)*(((((((size_t)digits[2]) << PyLong_SHIFT) | (size_t)digits[1]) << PyLong_SHIFT) | (size_t)digits[0])));\n                        }\n                    }\n                    break;\n                case 3:\n                    if (8 * sizeof(size_t) > 2 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 3 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(size_t, unsigned long, (((((((unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(size_t) - 1 > 3 * PyLong_SHIFT) {\n                            return (size_t) ((((((((size_t)digits[2]) << PyLong_SHIFT) | (size_t)digits[1]) << PyLong_SHIFT) | (size_t)digits[0])));\n                        }\n                    }\n                    break;\n                case -4:\n                    if (8 * sizeof(size_t) - 1 > 3 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 4 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(size_t, long, -(long) (((((((((unsigned long)digits[3]) << PyLong_SHIFT) | (unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(size_t) - 1 > 4 * PyLong_SHIFT) {\n                            return (size_t) (((size_t)-1)*(((((((((size_t)digits[3]) << PyLong_SHIFT) | (size_t)digits[2]) << PyLong_SHIFT) | (size_t)digits[1]) << PyLong_SHIFT) | (size_t)digits[0])));\n                        }\n                    }\n                    break;\n                case 4:\n                    if (8 * sizeof(size_t) > 3 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 4 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(size_t, unsigned long, (((((((((unsigned long)digits[3]) << PyLong_SHIFT) | (unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(size_t) - 1 > 4 * PyLong_SHIFT) {\n                            return (size_t) ((((((((((size_t)digits[3]) << PyLong_SHIFT) | (size_t)digits[2]) << PyLong_SHIFT) | (size_t)digits[1]) << PyLong_SHIFT) | (size_t)digits[0])));\n                        }\n                    }\n                    break;\n            }\n#endif\n            if (sizeof(size_t) <= sizeof(long)) {\n                __PYX_VERIFY_RETURN_INT_EXC(size_t, long, PyLong_AsLong(x))\n#ifdef HAVE_LONG_LONG\n            } else if (sizeof(size_t) <= sizeof(PY_LONG_LONG)) {\n                __PYX_VERIFY_RETURN_INT_EXC(size_t, PY_LONG_LONG, PyLong_AsLongLong(x))\n#endif\n            }\n        }\n        {\n#if CYTHON_COMPILING_IN_PYPY && !defined(_PyLong_AsByteArray)\n            PyErr_SetString(PyExc_RuntimeError,\n                            \"_PyLong_AsByteArray() not available in PyPy, cannot convert large numbers\");\n#else\n            size_t val;\n            PyObject *v = __Pyx_PyNumber_IntOrLong(x);\n #if PY_MAJOR_VERSION < 3\n            if (likely(v) && !PyLong_Check(v)) {\n                PyObject *tmp = v;\n                v = PyNumber_Long(tmp);\n                Py_DECREF(tmp);\n            }\n #endif\n            if (likely(v)) {\n                int one = 1; int is_little = (int)*(unsigned char *)&one;\n                unsigned char *bytes = (unsigned char *)&val;\n                int ret = _PyLong_AsByteArray((PyLongObject *)v,\n                                              bytes, sizeof(val),\n                                              is_little, !is_unsigned);\n                Py_DECREF(v);\n                if (likely(!ret))\n                    return val;\n            }\n#endif\n            return (size_t) -1;\n        }\n    } else {\n        size_t val;\n        PyObject *tmp = __Pyx_PyNumber_IntOrLong(x);\n        if (!tmp) return (size_t) -1;\n        val = __Pyx_PyInt_As_size_t(tmp);\n        Py_DECREF(tmp);\n        return val;\n    }\nraise_overflow:\n    PyErr_SetString(PyExc_OverflowError,\n        \"value too large to convert to size_t\");\n    return (size_t) -1;\nraise_neg_overflow:\n    PyErr_SetString(PyExc_OverflowError,\n        \"can't convert negative value to size_t\");\n    return (size_t) -1;\n}\n\n/* CIntFromPy */\n            static CYTHON_INLINE int64_t __Pyx_PyInt_As_int64_t(PyObject *x) {\n    const int64_t neg_one = (int64_t) -1, const_zero = (int64_t) 0;\n    const int is_unsigned = neg_one > const_zero;\n#if PY_MAJOR_VERSION < 3\n    if (likely(PyInt_Check(x))) {\n        if (sizeof(int64_t) < sizeof(long)) {\n            __PYX_VERIFY_RETURN_INT(int64_t, long, PyInt_AS_LONG(x))\n        } else {\n            long val = PyInt_AS_LONG(x);\n            if (is_unsigned && unlikely(val < 0)) {\n                goto raise_neg_overflow;\n            }\n            return (int64_t) val;\n        }\n    } else\n#endif\n    if (likely(PyLong_Check(x))) {\n        if (is_unsigned) {\n#if CYTHON_USE_PYLONG_INTERNALS\n            const digit* digits = ((PyLongObject*)x)->ob_digit;\n            switch (Py_SIZE(x)) {\n                case  0: return (int64_t) 0;\n                case  1: __PYX_VERIFY_RETURN_INT(int64_t, digit, digits[0])\n                case 2:\n                    if (8 * sizeof(int64_t) > 1 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 2 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(int64_t, unsigned long, (((((unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(int64_t) >= 2 * PyLong_SHIFT) {\n                            return (int64_t) (((((int64_t)digits[1]) << PyLong_SHIFT) | (int64_t)digits[0]));\n                        }\n                    }\n                    break;\n                case 3:\n                    if (8 * sizeof(int64_t) > 2 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 3 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(int64_t, unsigned long, (((((((unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(int64_t) >= 3 * PyLong_SHIFT) {\n                            return (int64_t) (((((((int64_t)digits[2]) << PyLong_SHIFT) | (int64_t)digits[1]) << PyLong_SHIFT) | (int64_t)digits[0]));\n                        }\n                    }\n                    break;\n                case 4:\n                    if (8 * sizeof(int64_t) > 3 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 4 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(int64_t, unsigned long, (((((((((unsigned long)digits[3]) << PyLong_SHIFT) | (unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(int64_t) >= 4 * PyLong_SHIFT) {\n                            return (int64_t) (((((((((int64_t)digits[3]) << PyLong_SHIFT) | (int64_t)digits[2]) << PyLong_SHIFT) | (int64_t)digits[1]) << PyLong_SHIFT) | (int64_t)digits[0]));\n                        }\n                    }\n                    break;\n            }\n#endif\n#if CYTHON_COMPILING_IN_CPYTHON\n            if (unlikely(Py_SIZE(x) < 0)) {\n                goto raise_neg_overflow;\n            }\n#else\n            {\n                int result = PyObject_RichCompareBool(x, Py_False, Py_LT);\n                if (unlikely(result < 0))\n                    return (int64_t) -1;\n                if (unlikely(result == 1))\n                    goto raise_neg_overflow;\n            }\n#endif\n            if (sizeof(int64_t) <= sizeof(unsigned long)) {\n                __PYX_VERIFY_RETURN_INT_EXC(int64_t, unsigned long, PyLong_AsUnsignedLong(x))\n#ifdef HAVE_LONG_LONG\n            } else if (sizeof(int64_t) <= sizeof(unsigned PY_LONG_LONG)) {\n                __PYX_VERIFY_RETURN_INT_EXC(int64_t, unsigned PY_LONG_LONG, PyLong_AsUnsignedLongLong(x))\n#endif\n            }\n        } else {\n#if CYTHON_USE_PYLONG_INTERNALS\n            const digit* digits = ((PyLongObject*)x)->ob_digit;\n            switch (Py_SIZE(x)) {\n                case  0: return (int64_t) 0;\n                case -1: __PYX_VERIFY_RETURN_INT(int64_t, sdigit, (sdigit) (-(sdigit)digits[0]))\n                case  1: __PYX_VERIFY_RETURN_INT(int64_t,  digit, +digits[0])\n                case -2:\n                    if (8 * sizeof(int64_t) - 1 > 1 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 2 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(int64_t, long, -(long) (((((unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(int64_t) - 1 > 2 * PyLong_SHIFT) {\n                            return (int64_t) (((int64_t)-1)*(((((int64_t)digits[1]) << PyLong_SHIFT) | (int64_t)digits[0])));\n                        }\n                    }\n                    break;\n                case 2:\n                    if (8 * sizeof(int64_t) > 1 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 2 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(int64_t, unsigned long, (((((unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(int64_t) - 1 > 2 * PyLong_SHIFT) {\n                            return (int64_t) ((((((int64_t)digits[1]) << PyLong_SHIFT) | (int64_t)digits[0])));\n                        }\n                    }\n                    break;\n                case -3:\n                    if (8 * sizeof(int64_t) - 1 > 2 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 3 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(int64_t, long, -(long) (((((((unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(int64_t) - 1 > 3 * PyLong_SHIFT) {\n                            return (int64_t) (((int64_t)-1)*(((((((int64_t)digits[2]) << PyLong_SHIFT) | (int64_t)digits[1]) << PyLong_SHIFT) | (int64_t)digits[0])));\n                        }\n                    }\n                    break;\n                case 3:\n                    if (8 * sizeof(int64_t) > 2 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 3 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(int64_t, unsigned long, (((((((unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(int64_t) - 1 > 3 * PyLong_SHIFT) {\n                            return (int64_t) ((((((((int64_t)digits[2]) << PyLong_SHIFT) | (int64_t)digits[1]) << PyLong_SHIFT) | (int64_t)digits[0])));\n                        }\n                    }\n                    break;\n                case -4:\n                    if (8 * sizeof(int64_t) - 1 > 3 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 4 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(int64_t, long, -(long) (((((((((unsigned long)digits[3]) << PyLong_SHIFT) | (unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(int64_t) - 1 > 4 * PyLong_SHIFT) {\n                            return (int64_t) (((int64_t)-1)*(((((((((int64_t)digits[3]) << PyLong_SHIFT) | (int64_t)digits[2]) << PyLong_SHIFT) | (int64_t)digits[1]) << PyLong_SHIFT) | (int64_t)digits[0])));\n                        }\n                    }\n                    break;\n                case 4:\n                    if (8 * sizeof(int64_t) > 3 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 4 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(int64_t, unsigned long, (((((((((unsigned long)digits[3]) << PyLong_SHIFT) | (unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(int64_t) - 1 > 4 * PyLong_SHIFT) {\n                            return (int64_t) ((((((((((int64_t)digits[3]) << PyLong_SHIFT) | (int64_t)digits[2]) << PyLong_SHIFT) | (int64_t)digits[1]) << PyLong_SHIFT) | (int64_t)digits[0])));\n                        }\n                    }\n                    break;\n            }\n#endif\n            if (sizeof(int64_t) <= sizeof(long)) {\n                __PYX_VERIFY_RETURN_INT_EXC(int64_t, long, PyLong_AsLong(x))\n#ifdef HAVE_LONG_LONG\n            } else if (sizeof(int64_t) <= sizeof(PY_LONG_LONG)) {\n                __PYX_VERIFY_RETURN_INT_EXC(int64_t, PY_LONG_LONG, PyLong_AsLongLong(x))\n#endif\n            }\n        }\n        {\n#if CYTHON_COMPILING_IN_PYPY && !defined(_PyLong_AsByteArray)\n            PyErr_SetString(PyExc_RuntimeError,\n                            \"_PyLong_AsByteArray() not available in PyPy, cannot convert large numbers\");\n#else\n            int64_t val;\n            PyObject *v = __Pyx_PyNumber_IntOrLong(x);\n #if PY_MAJOR_VERSION < 3\n            if (likely(v) && !PyLong_Check(v)) {\n                PyObject *tmp = v;\n                v = PyNumber_Long(tmp);\n                Py_DECREF(tmp);\n            }\n #endif\n            if (likely(v)) {\n                int one = 1; int is_little = (int)*(unsigned char *)&one;\n                unsigned char *bytes = (unsigned char *)&val;\n                int ret = _PyLong_AsByteArray((PyLongObject *)v,\n                                              bytes, sizeof(val),\n                                              is_little, !is_unsigned);\n                Py_DECREF(v);\n                if (likely(!ret))\n                    return val;\n            }\n#endif\n            return (int64_t) -1;\n        }\n    } else {\n        int64_t val;\n        PyObject *tmp = __Pyx_PyNumber_IntOrLong(x);\n        if (!tmp) return (int64_t) -1;\n        val = __Pyx_PyInt_As_int64_t(tmp);\n        Py_DECREF(tmp);\n        return val;\n    }\nraise_overflow:\n    PyErr_SetString(PyExc_OverflowError,\n        \"value too large to convert to int64_t\");\n    return (int64_t) -1;\nraise_neg_overflow:\n    PyErr_SetString(PyExc_OverflowError,\n        \"can't convert negative value to int64_t\");\n    return (int64_t) -1;\n}\n\n/* CIntFromPy */\n            static CYTHON_INLINE uint64_t __Pyx_PyInt_As_uint64_t(PyObject *x) {\n    const uint64_t neg_one = (uint64_t) -1, const_zero = (uint64_t) 0;\n    const int is_unsigned = neg_one > const_zero;\n#if PY_MAJOR_VERSION < 3\n    if (likely(PyInt_Check(x))) {\n        if (sizeof(uint64_t) < sizeof(long)) {\n            __PYX_VERIFY_RETURN_INT(uint64_t, long, PyInt_AS_LONG(x))\n        } else {\n            long val = PyInt_AS_LONG(x);\n            if (is_unsigned && unlikely(val < 0)) {\n                goto raise_neg_overflow;\n            }\n            return (uint64_t) val;\n        }\n    } else\n#endif\n    if (likely(PyLong_Check(x))) {\n        if (is_unsigned) {\n#if CYTHON_USE_PYLONG_INTERNALS\n            const digit* digits = ((PyLongObject*)x)->ob_digit;\n            switch (Py_SIZE(x)) {\n                case  0: return (uint64_t) 0;\n                case  1: __PYX_VERIFY_RETURN_INT(uint64_t, digit, digits[0])\n                case 2:\n                    if (8 * sizeof(uint64_t) > 1 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 2 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(uint64_t, unsigned long, (((((unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(uint64_t) >= 2 * PyLong_SHIFT) {\n                            return (uint64_t) (((((uint64_t)digits[1]) << PyLong_SHIFT) | (uint64_t)digits[0]));\n                        }\n                    }\n                    break;\n                case 3:\n                    if (8 * sizeof(uint64_t) > 2 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 3 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(uint64_t, unsigned long, (((((((unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(uint64_t) >= 3 * PyLong_SHIFT) {\n                            return (uint64_t) (((((((uint64_t)digits[2]) << PyLong_SHIFT) | (uint64_t)digits[1]) << PyLong_SHIFT) | (uint64_t)digits[0]));\n                        }\n                    }\n                    break;\n                case 4:\n                    if (8 * sizeof(uint64_t) > 3 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 4 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(uint64_t, unsigned long, (((((((((unsigned long)digits[3]) << PyLong_SHIFT) | (unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(uint64_t) >= 4 * PyLong_SHIFT) {\n                            return (uint64_t) (((((((((uint64_t)digits[3]) << PyLong_SHIFT) | (uint64_t)digits[2]) << PyLong_SHIFT) | (uint64_t)digits[1]) << PyLong_SHIFT) | (uint64_t)digits[0]));\n                        }\n                    }\n                    break;\n            }\n#endif\n#if CYTHON_COMPILING_IN_CPYTHON\n            if (unlikely(Py_SIZE(x) < 0)) {\n                goto raise_neg_overflow;\n            }\n#else\n            {\n                int result = PyObject_RichCompareBool(x, Py_False, Py_LT);\n                if (unlikely(result < 0))\n                    return (uint64_t) -1;\n                if (unlikely(result == 1))\n                    goto raise_neg_overflow;\n            }\n#endif\n            if (sizeof(uint64_t) <= sizeof(unsigned long)) {\n                __PYX_VERIFY_RETURN_INT_EXC(uint64_t, unsigned long, PyLong_AsUnsignedLong(x))\n#ifdef HAVE_LONG_LONG\n            } else if (sizeof(uint64_t) <= sizeof(unsigned PY_LONG_LONG)) {\n                __PYX_VERIFY_RETURN_INT_EXC(uint64_t, unsigned PY_LONG_LONG, PyLong_AsUnsignedLongLong(x))\n#endif\n            }\n        } else {\n#if CYTHON_USE_PYLONG_INTERNALS\n            const digit* digits = ((PyLongObject*)x)->ob_digit;\n            switch (Py_SIZE(x)) {\n                case  0: return (uint64_t) 0;\n                case -1: __PYX_VERIFY_RETURN_INT(uint64_t, sdigit, (sdigit) (-(sdigit)digits[0]))\n                case  1: __PYX_VERIFY_RETURN_INT(uint64_t,  digit, +digits[0])\n                case -2:\n                    if (8 * sizeof(uint64_t) - 1 > 1 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 2 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(uint64_t, long, -(long) (((((unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(uint64_t) - 1 > 2 * PyLong_SHIFT) {\n                            return (uint64_t) (((uint64_t)-1)*(((((uint64_t)digits[1]) << PyLong_SHIFT) | (uint64_t)digits[0])));\n                        }\n                    }\n                    break;\n                case 2:\n                    if (8 * sizeof(uint64_t) > 1 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 2 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(uint64_t, unsigned long, (((((unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(uint64_t) - 1 > 2 * PyLong_SHIFT) {\n                            return (uint64_t) ((((((uint64_t)digits[1]) << PyLong_SHIFT) | (uint64_t)digits[0])));\n                        }\n                    }\n                    break;\n                case -3:\n                    if (8 * sizeof(uint64_t) - 1 > 2 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 3 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(uint64_t, long, -(long) (((((((unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(uint64_t) - 1 > 3 * PyLong_SHIFT) {\n                            return (uint64_t) (((uint64_t)-1)*(((((((uint64_t)digits[2]) << PyLong_SHIFT) | (uint64_t)digits[1]) << PyLong_SHIFT) | (uint64_t)digits[0])));\n                        }\n                    }\n                    break;\n                case 3:\n                    if (8 * sizeof(uint64_t) > 2 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 3 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(uint64_t, unsigned long, (((((((unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(uint64_t) - 1 > 3 * PyLong_SHIFT) {\n                            return (uint64_t) ((((((((uint64_t)digits[2]) << PyLong_SHIFT) | (uint64_t)digits[1]) << PyLong_SHIFT) | (uint64_t)digits[0])));\n                        }\n                    }\n                    break;\n                case -4:\n                    if (8 * sizeof(uint64_t) - 1 > 3 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 4 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(uint64_t, long, -(long) (((((((((unsigned long)digits[3]) << PyLong_SHIFT) | (unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(uint64_t) - 1 > 4 * PyLong_SHIFT) {\n                            return (uint64_t) (((uint64_t)-1)*(((((((((uint64_t)digits[3]) << PyLong_SHIFT) | (uint64_t)digits[2]) << PyLong_SHIFT) | (uint64_t)digits[1]) << PyLong_SHIFT) | (uint64_t)digits[0])));\n                        }\n                    }\n                    break;\n                case 4:\n                    if (8 * sizeof(uint64_t) > 3 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 4 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(uint64_t, unsigned long, (((((((((unsigned long)digits[3]) << PyLong_SHIFT) | (unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(uint64_t) - 1 > 4 * PyLong_SHIFT) {\n                            return (uint64_t) ((((((((((uint64_t)digits[3]) << PyLong_SHIFT) | (uint64_t)digits[2]) << PyLong_SHIFT) | (uint64_t)digits[1]) << PyLong_SHIFT) | (uint64_t)digits[0])));\n                        }\n                    }\n                    break;\n            }\n#endif\n            if (sizeof(uint64_t) <= sizeof(long)) {\n                __PYX_VERIFY_RETURN_INT_EXC(uint64_t, long, PyLong_AsLong(x))\n#ifdef HAVE_LONG_LONG\n            } else if (sizeof(uint64_t) <= sizeof(PY_LONG_LONG)) {\n                __PYX_VERIFY_RETURN_INT_EXC(uint64_t, PY_LONG_LONG, PyLong_AsLongLong(x))\n#endif\n            }\n        }\n        {\n#if CYTHON_COMPILING_IN_PYPY && !defined(_PyLong_AsByteArray)\n            PyErr_SetString(PyExc_RuntimeError,\n                            \"_PyLong_AsByteArray() not available in PyPy, cannot convert large numbers\");\n#else\n            uint64_t val;\n            PyObject *v = __Pyx_PyNumber_IntOrLong(x);\n #if PY_MAJOR_VERSION < 3\n            if (likely(v) && !PyLong_Check(v)) {\n                PyObject *tmp = v;\n                v = PyNumber_Long(tmp);\n                Py_DECREF(tmp);\n            }\n #endif\n            if (likely(v)) {\n                int one = 1; int is_little = (int)*(unsigned char *)&one;\n                unsigned char *bytes = (unsigned char *)&val;\n                int ret = _PyLong_AsByteArray((PyLongObject *)v,\n                                              bytes, sizeof(val),\n                                              is_little, !is_unsigned);\n                Py_DECREF(v);\n                if (likely(!ret))\n                    return val;\n            }\n#endif\n            return (uint64_t) -1;\n        }\n    } else {\n        uint64_t val;\n        PyObject *tmp = __Pyx_PyNumber_IntOrLong(x);\n        if (!tmp) return (uint64_t) -1;\n        val = __Pyx_PyInt_As_uint64_t(tmp);\n        Py_DECREF(tmp);\n        return val;\n    }\nraise_overflow:\n    PyErr_SetString(PyExc_OverflowError,\n        \"value too large to convert to uint64_t\");\n    return (uint64_t) -1;\nraise_neg_overflow:\n    PyErr_SetString(PyExc_OverflowError,\n        \"can't convert negative value to uint64_t\");\n    return (uint64_t) -1;\n}\n\n/* CIntFromPy */\n            static CYTHON_INLINE int32_t __Pyx_PyInt_As_int32_t(PyObject *x) {\n    const int32_t neg_one = (int32_t) -1, const_zero = (int32_t) 0;\n    const int is_unsigned = neg_one > const_zero;\n#if PY_MAJOR_VERSION < 3\n    if (likely(PyInt_Check(x))) {\n        if (sizeof(int32_t) < sizeof(long)) {\n            __PYX_VERIFY_RETURN_INT(int32_t, long, PyInt_AS_LONG(x))\n        } else {\n            long val = PyInt_AS_LONG(x);\n            if (is_unsigned && unlikely(val < 0)) {\n                goto raise_neg_overflow;\n            }\n            return (int32_t) val;\n        }\n    } else\n#endif\n    if (likely(PyLong_Check(x))) {\n        if (is_unsigned) {\n#if CYTHON_USE_PYLONG_INTERNALS\n            const digit* digits = ((PyLongObject*)x)->ob_digit;\n            switch (Py_SIZE(x)) {\n                case  0: return (int32_t) 0;\n                case  1: __PYX_VERIFY_RETURN_INT(int32_t, digit, digits[0])\n                case 2:\n                    if (8 * sizeof(int32_t) > 1 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 2 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(int32_t, unsigned long, (((((unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(int32_t) >= 2 * PyLong_SHIFT) {\n                            return (int32_t) (((((int32_t)digits[1]) << PyLong_SHIFT) | (int32_t)digits[0]));\n                        }\n                    }\n                    break;\n                case 3:\n                    if (8 * sizeof(int32_t) > 2 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 3 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(int32_t, unsigned long, (((((((unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(int32_t) >= 3 * PyLong_SHIFT) {\n                            return (int32_t) (((((((int32_t)digits[2]) << PyLong_SHIFT) | (int32_t)digits[1]) << PyLong_SHIFT) | (int32_t)digits[0]));\n                        }\n                    }\n                    break;\n                case 4:\n                    if (8 * sizeof(int32_t) > 3 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 4 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(int32_t, unsigned long, (((((((((unsigned long)digits[3]) << PyLong_SHIFT) | (unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(int32_t) >= 4 * PyLong_SHIFT) {\n                            return (int32_t) (((((((((int32_t)digits[3]) << PyLong_SHIFT) | (int32_t)digits[2]) << PyLong_SHIFT) | (int32_t)digits[1]) << PyLong_SHIFT) | (int32_t)digits[0]));\n                        }\n                    }\n                    break;\n            }\n#endif\n#if CYTHON_COMPILING_IN_CPYTHON\n            if (unlikely(Py_SIZE(x) < 0)) {\n                goto raise_neg_overflow;\n            }\n#else\n            {\n                int result = PyObject_RichCompareBool(x, Py_False, Py_LT);\n                if (unlikely(result < 0))\n                    return (int32_t) -1;\n                if (unlikely(result == 1))\n                    goto raise_neg_overflow;\n            }\n#endif\n            if (sizeof(int32_t) <= sizeof(unsigned long)) {\n                __PYX_VERIFY_RETURN_INT_EXC(int32_t, unsigned long, PyLong_AsUnsignedLong(x))\n#ifdef HAVE_LONG_LONG\n            } else if (sizeof(int32_t) <= sizeof(unsigned PY_LONG_LONG)) {\n                __PYX_VERIFY_RETURN_INT_EXC(int32_t, unsigned PY_LONG_LONG, PyLong_AsUnsignedLongLong(x))\n#endif\n            }\n        } else {\n#if CYTHON_USE_PYLONG_INTERNALS\n            const digit* digits = ((PyLongObject*)x)->ob_digit;\n            switch (Py_SIZE(x)) {\n                case  0: return (int32_t) 0;\n                case -1: __PYX_VERIFY_RETURN_INT(int32_t, sdigit, (sdigit) (-(sdigit)digits[0]))\n                case  1: __PYX_VERIFY_RETURN_INT(int32_t,  digit, +digits[0])\n                case -2:\n                    if (8 * sizeof(int32_t) - 1 > 1 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 2 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(int32_t, long, -(long) (((((unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(int32_t) - 1 > 2 * PyLong_SHIFT) {\n                            return (int32_t) (((int32_t)-1)*(((((int32_t)digits[1]) << PyLong_SHIFT) | (int32_t)digits[0])));\n                        }\n                    }\n                    break;\n                case 2:\n                    if (8 * sizeof(int32_t) > 1 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 2 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(int32_t, unsigned long, (((((unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(int32_t) - 1 > 2 * PyLong_SHIFT) {\n                            return (int32_t) ((((((int32_t)digits[1]) << PyLong_SHIFT) | (int32_t)digits[0])));\n                        }\n                    }\n                    break;\n                case -3:\n                    if (8 * sizeof(int32_t) - 1 > 2 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 3 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(int32_t, long, -(long) (((((((unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(int32_t) - 1 > 3 * PyLong_SHIFT) {\n                            return (int32_t) (((int32_t)-1)*(((((((int32_t)digits[2]) << PyLong_SHIFT) | (int32_t)digits[1]) << PyLong_SHIFT) | (int32_t)digits[0])));\n                        }\n                    }\n                    break;\n                case 3:\n                    if (8 * sizeof(int32_t) > 2 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 3 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(int32_t, unsigned long, (((((((unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(int32_t) - 1 > 3 * PyLong_SHIFT) {\n                            return (int32_t) ((((((((int32_t)digits[2]) << PyLong_SHIFT) | (int32_t)digits[1]) << PyLong_SHIFT) | (int32_t)digits[0])));\n                        }\n                    }\n                    break;\n                case -4:\n                    if (8 * sizeof(int32_t) - 1 > 3 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 4 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(int32_t, long, -(long) (((((((((unsigned long)digits[3]) << PyLong_SHIFT) | (unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(int32_t) - 1 > 4 * PyLong_SHIFT) {\n                            return (int32_t) (((int32_t)-1)*(((((((((int32_t)digits[3]) << PyLong_SHIFT) | (int32_t)digits[2]) << PyLong_SHIFT) | (int32_t)digits[1]) << PyLong_SHIFT) | (int32_t)digits[0])));\n                        }\n                    }\n                    break;\n                case 4:\n                    if (8 * sizeof(int32_t) > 3 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 4 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(int32_t, unsigned long, (((((((((unsigned long)digits[3]) << PyLong_SHIFT) | (unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(int32_t) - 1 > 4 * PyLong_SHIFT) {\n                            return (int32_t) ((((((((((int32_t)digits[3]) << PyLong_SHIFT) | (int32_t)digits[2]) << PyLong_SHIFT) | (int32_t)digits[1]) << PyLong_SHIFT) | (int32_t)digits[0])));\n                        }\n                    }\n                    break;\n            }\n#endif\n            if (sizeof(int32_t) <= sizeof(long)) {\n                __PYX_VERIFY_RETURN_INT_EXC(int32_t, long, PyLong_AsLong(x))\n#ifdef HAVE_LONG_LONG\n            } else if (sizeof(int32_t) <= sizeof(PY_LONG_LONG)) {\n                __PYX_VERIFY_RETURN_INT_EXC(int32_t, PY_LONG_LONG, PyLong_AsLongLong(x))\n#endif\n            }\n        }\n        {\n#if CYTHON_COMPILING_IN_PYPY && !defined(_PyLong_AsByteArray)\n            PyErr_SetString(PyExc_RuntimeError,\n                            \"_PyLong_AsByteArray() not available in PyPy, cannot convert large numbers\");\n#else\n            int32_t val;\n            PyObject *v = __Pyx_PyNumber_IntOrLong(x);\n #if PY_MAJOR_VERSION < 3\n            if (likely(v) && !PyLong_Check(v)) {\n                PyObject *tmp = v;\n                v = PyNumber_Long(tmp);\n                Py_DECREF(tmp);\n            }\n #endif\n            if (likely(v)) {\n                int one = 1; int is_little = (int)*(unsigned char *)&one;\n                unsigned char *bytes = (unsigned char *)&val;\n                int ret = _PyLong_AsByteArray((PyLongObject *)v,\n                                              bytes, sizeof(val),\n                                              is_little, !is_unsigned);\n                Py_DECREF(v);\n                if (likely(!ret))\n                    return val;\n            }\n#endif\n            return (int32_t) -1;\n        }\n    } else {\n        int32_t val;\n        PyObject *tmp = __Pyx_PyNumber_IntOrLong(x);\n        if (!tmp) return (int32_t) -1;\n        val = __Pyx_PyInt_As_int32_t(tmp);\n        Py_DECREF(tmp);\n        return val;\n    }\nraise_overflow:\n    PyErr_SetString(PyExc_OverflowError,\n        \"value too large to convert to int32_t\");\n    return (int32_t) -1;\nraise_neg_overflow:\n    PyErr_SetString(PyExc_OverflowError,\n        \"can't convert negative value to int32_t\");\n    return (int32_t) -1;\n}\n\n/* CIntFromPy */\n            static CYTHON_INLINE uint32_t __Pyx_PyInt_As_uint32_t(PyObject *x) {\n    const uint32_t neg_one = (uint32_t) -1, const_zero = (uint32_t) 0;\n    const int is_unsigned = neg_one > const_zero;\n#if PY_MAJOR_VERSION < 3\n    if (likely(PyInt_Check(x))) {\n        if (sizeof(uint32_t) < sizeof(long)) {\n            __PYX_VERIFY_RETURN_INT(uint32_t, long, PyInt_AS_LONG(x))\n        } else {\n            long val = PyInt_AS_LONG(x);\n            if (is_unsigned && unlikely(val < 0)) {\n                goto raise_neg_overflow;\n            }\n            return (uint32_t) val;\n        }\n    } else\n#endif\n    if (likely(PyLong_Check(x))) {\n        if (is_unsigned) {\n#if CYTHON_USE_PYLONG_INTERNALS\n            const digit* digits = ((PyLongObject*)x)->ob_digit;\n            switch (Py_SIZE(x)) {\n                case  0: return (uint32_t) 0;\n                case  1: __PYX_VERIFY_RETURN_INT(uint32_t, digit, digits[0])\n                case 2:\n                    if (8 * sizeof(uint32_t) > 1 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 2 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(uint32_t, unsigned long, (((((unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(uint32_t) >= 2 * PyLong_SHIFT) {\n                            return (uint32_t) (((((uint32_t)digits[1]) << PyLong_SHIFT) | (uint32_t)digits[0]));\n                        }\n                    }\n                    break;\n                case 3:\n                    if (8 * sizeof(uint32_t) > 2 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 3 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(uint32_t, unsigned long, (((((((unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(uint32_t) >= 3 * PyLong_SHIFT) {\n                            return (uint32_t) (((((((uint32_t)digits[2]) << PyLong_SHIFT) | (uint32_t)digits[1]) << PyLong_SHIFT) | (uint32_t)digits[0]));\n                        }\n                    }\n                    break;\n                case 4:\n                    if (8 * sizeof(uint32_t) > 3 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 4 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(uint32_t, unsigned long, (((((((((unsigned long)digits[3]) << PyLong_SHIFT) | (unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(uint32_t) >= 4 * PyLong_SHIFT) {\n                            return (uint32_t) (((((((((uint32_t)digits[3]) << PyLong_SHIFT) | (uint32_t)digits[2]) << PyLong_SHIFT) | (uint32_t)digits[1]) << PyLong_SHIFT) | (uint32_t)digits[0]));\n                        }\n                    }\n                    break;\n            }\n#endif\n#if CYTHON_COMPILING_IN_CPYTHON\n            if (unlikely(Py_SIZE(x) < 0)) {\n                goto raise_neg_overflow;\n            }\n#else\n            {\n                int result = PyObject_RichCompareBool(x, Py_False, Py_LT);\n                if (unlikely(result < 0))\n                    return (uint32_t) -1;\n                if (unlikely(result == 1))\n                    goto raise_neg_overflow;\n            }\n#endif\n            if (sizeof(uint32_t) <= sizeof(unsigned long)) {\n                __PYX_VERIFY_RETURN_INT_EXC(uint32_t, unsigned long, PyLong_AsUnsignedLong(x))\n#ifdef HAVE_LONG_LONG\n            } else if (sizeof(uint32_t) <= sizeof(unsigned PY_LONG_LONG)) {\n                __PYX_VERIFY_RETURN_INT_EXC(uint32_t, unsigned PY_LONG_LONG, PyLong_AsUnsignedLongLong(x))\n#endif\n            }\n        } else {\n#if CYTHON_USE_PYLONG_INTERNALS\n            const digit* digits = ((PyLongObject*)x)->ob_digit;\n            switch (Py_SIZE(x)) {\n                case  0: return (uint32_t) 0;\n                case -1: __PYX_VERIFY_RETURN_INT(uint32_t, sdigit, (sdigit) (-(sdigit)digits[0]))\n                case  1: __PYX_VERIFY_RETURN_INT(uint32_t,  digit, +digits[0])\n                case -2:\n                    if (8 * sizeof(uint32_t) - 1 > 1 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 2 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(uint32_t, long, -(long) (((((unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(uint32_t) - 1 > 2 * PyLong_SHIFT) {\n                            return (uint32_t) (((uint32_t)-1)*(((((uint32_t)digits[1]) << PyLong_SHIFT) | (uint32_t)digits[0])));\n                        }\n                    }\n                    break;\n                case 2:\n                    if (8 * sizeof(uint32_t) > 1 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 2 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(uint32_t, unsigned long, (((((unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(uint32_t) - 1 > 2 * PyLong_SHIFT) {\n                            return (uint32_t) ((((((uint32_t)digits[1]) << PyLong_SHIFT) | (uint32_t)digits[0])));\n                        }\n                    }\n                    break;\n                case -3:\n                    if (8 * sizeof(uint32_t) - 1 > 2 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 3 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(uint32_t, long, -(long) (((((((unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(uint32_t) - 1 > 3 * PyLong_SHIFT) {\n                            return (uint32_t) (((uint32_t)-1)*(((((((uint32_t)digits[2]) << PyLong_SHIFT) | (uint32_t)digits[1]) << PyLong_SHIFT) | (uint32_t)digits[0])));\n                        }\n                    }\n                    break;\n                case 3:\n                    if (8 * sizeof(uint32_t) > 2 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 3 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(uint32_t, unsigned long, (((((((unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(uint32_t) - 1 > 3 * PyLong_SHIFT) {\n                            return (uint32_t) ((((((((uint32_t)digits[2]) << PyLong_SHIFT) | (uint32_t)digits[1]) << PyLong_SHIFT) | (uint32_t)digits[0])));\n                        }\n                    }\n                    break;\n                case -4:\n                    if (8 * sizeof(uint32_t) - 1 > 3 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 4 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(uint32_t, long, -(long) (((((((((unsigned long)digits[3]) << PyLong_SHIFT) | (unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(uint32_t) - 1 > 4 * PyLong_SHIFT) {\n                            return (uint32_t) (((uint32_t)-1)*(((((((((uint32_t)digits[3]) << PyLong_SHIFT) | (uint32_t)digits[2]) << PyLong_SHIFT) | (uint32_t)digits[1]) << PyLong_SHIFT) | (uint32_t)digits[0])));\n                        }\n                    }\n                    break;\n                case 4:\n                    if (8 * sizeof(uint32_t) > 3 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 4 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(uint32_t, unsigned long, (((((((((unsigned long)digits[3]) << PyLong_SHIFT) | (unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(uint32_t) - 1 > 4 * PyLong_SHIFT) {\n                            return (uint32_t) ((((((((((uint32_t)digits[3]) << PyLong_SHIFT) | (uint32_t)digits[2]) << PyLong_SHIFT) | (uint32_t)digits[1]) << PyLong_SHIFT) | (uint32_t)digits[0])));\n                        }\n                    }\n                    break;\n            }\n#endif\n            if (sizeof(uint32_t) <= sizeof(long)) {\n                __PYX_VERIFY_RETURN_INT_EXC(uint32_t, long, PyLong_AsLong(x))\n#ifdef HAVE_LONG_LONG\n            } else if (sizeof(uint32_t) <= sizeof(PY_LONG_LONG)) {\n                __PYX_VERIFY_RETURN_INT_EXC(uint32_t, PY_LONG_LONG, PyLong_AsLongLong(x))\n#endif\n            }\n        }\n        {\n#if CYTHON_COMPILING_IN_PYPY && !defined(_PyLong_AsByteArray)\n            PyErr_SetString(PyExc_RuntimeError,\n                            \"_PyLong_AsByteArray() not available in PyPy, cannot convert large numbers\");\n#else\n            uint32_t val;\n            PyObject *v = __Pyx_PyNumber_IntOrLong(x);\n #if PY_MAJOR_VERSION < 3\n            if (likely(v) && !PyLong_Check(v)) {\n                PyObject *tmp = v;\n                v = PyNumber_Long(tmp);\n                Py_DECREF(tmp);\n            }\n #endif\n            if (likely(v)) {\n                int one = 1; int is_little = (int)*(unsigned char *)&one;\n                unsigned char *bytes = (unsigned char *)&val;\n                int ret = _PyLong_AsByteArray((PyLongObject *)v,\n                                              bytes, sizeof(val),\n                                              is_little, !is_unsigned);\n                Py_DECREF(v);\n                if (likely(!ret))\n                    return val;\n            }\n#endif\n            return (uint32_t) -1;\n        }\n    } else {\n        uint32_t val;\n        PyObject *tmp = __Pyx_PyNumber_IntOrLong(x);\n        if (!tmp) return (uint32_t) -1;\n        val = __Pyx_PyInt_As_uint32_t(tmp);\n        Py_DECREF(tmp);\n        return val;\n    }\nraise_overflow:\n    PyErr_SetString(PyExc_OverflowError,\n        \"value too large to convert to uint32_t\");\n    return (uint32_t) -1;\nraise_neg_overflow:\n    PyErr_SetString(PyExc_OverflowError,\n        \"can't convert negative value to uint32_t\");\n    return (uint32_t) -1;\n}\n\n/* CIntFromPy */\n            static CYTHON_INLINE time_t __Pyx_PyInt_As_time_t(PyObject *x) {\n    const time_t neg_one = (time_t) -1, const_zero = (time_t) 0;\n    const int is_unsigned = neg_one > const_zero;\n#if PY_MAJOR_VERSION < 3\n    if (likely(PyInt_Check(x))) {\n        if (sizeof(time_t) < sizeof(long)) {\n            __PYX_VERIFY_RETURN_INT(time_t, long, PyInt_AS_LONG(x))\n        } else {\n            long val = PyInt_AS_LONG(x);\n            if (is_unsigned && unlikely(val < 0)) {\n                goto raise_neg_overflow;\n            }\n            return (time_t) val;\n        }\n    } else\n#endif\n    if (likely(PyLong_Check(x))) {\n        if (is_unsigned) {\n#if CYTHON_USE_PYLONG_INTERNALS\n            const digit* digits = ((PyLongObject*)x)->ob_digit;\n            switch (Py_SIZE(x)) {\n                case  0: return (time_t) 0;\n                case  1: __PYX_VERIFY_RETURN_INT(time_t, digit, digits[0])\n                case 2:\n                    if (8 * sizeof(time_t) > 1 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 2 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(time_t, unsigned long, (((((unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(time_t) >= 2 * PyLong_SHIFT) {\n                            return (time_t) (((((time_t)digits[1]) << PyLong_SHIFT) | (time_t)digits[0]));\n                        }\n                    }\n                    break;\n                case 3:\n                    if (8 * sizeof(time_t) > 2 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 3 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(time_t, unsigned long, (((((((unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(time_t) >= 3 * PyLong_SHIFT) {\n                            return (time_t) (((((((time_t)digits[2]) << PyLong_SHIFT) | (time_t)digits[1]) << PyLong_SHIFT) | (time_t)digits[0]));\n                        }\n                    }\n                    break;\n                case 4:\n                    if (8 * sizeof(time_t) > 3 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 4 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(time_t, unsigned long, (((((((((unsigned long)digits[3]) << PyLong_SHIFT) | (unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(time_t) >= 4 * PyLong_SHIFT) {\n                            return (time_t) (((((((((time_t)digits[3]) << PyLong_SHIFT) | (time_t)digits[2]) << PyLong_SHIFT) | (time_t)digits[1]) << PyLong_SHIFT) | (time_t)digits[0]));\n                        }\n                    }\n                    break;\n            }\n#endif\n#if CYTHON_COMPILING_IN_CPYTHON\n            if (unlikely(Py_SIZE(x) < 0)) {\n                goto raise_neg_overflow;\n            }\n#else\n            {\n                int result = PyObject_RichCompareBool(x, Py_False, Py_LT);\n                if (unlikely(result < 0))\n                    return (time_t) -1;\n                if (unlikely(result == 1))\n                    goto raise_neg_overflow;\n            }\n#endif\n            if (sizeof(time_t) <= sizeof(unsigned long)) {\n                __PYX_VERIFY_RETURN_INT_EXC(time_t, unsigned long, PyLong_AsUnsignedLong(x))\n#ifdef HAVE_LONG_LONG\n            } else if (sizeof(time_t) <= sizeof(unsigned PY_LONG_LONG)) {\n                __PYX_VERIFY_RETURN_INT_EXC(time_t, unsigned PY_LONG_LONG, PyLong_AsUnsignedLongLong(x))\n#endif\n            }\n        } else {\n#if CYTHON_USE_PYLONG_INTERNALS\n            const digit* digits = ((PyLongObject*)x)->ob_digit;\n            switch (Py_SIZE(x)) {\n                case  0: return (time_t) 0;\n                case -1: __PYX_VERIFY_RETURN_INT(time_t, sdigit, (sdigit) (-(sdigit)digits[0]))\n                case  1: __PYX_VERIFY_RETURN_INT(time_t,  digit, +digits[0])\n                case -2:\n                    if (8 * sizeof(time_t) - 1 > 1 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 2 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(time_t, long, -(long) (((((unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(time_t) - 1 > 2 * PyLong_SHIFT) {\n                            return (time_t) (((time_t)-1)*(((((time_t)digits[1]) << PyLong_SHIFT) | (time_t)digits[0])));\n                        }\n                    }\n                    break;\n                case 2:\n                    if (8 * sizeof(time_t) > 1 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 2 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(time_t, unsigned long, (((((unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(time_t) - 1 > 2 * PyLong_SHIFT) {\n                            return (time_t) ((((((time_t)digits[1]) << PyLong_SHIFT) | (time_t)digits[0])));\n                        }\n                    }\n                    break;\n                case -3:\n                    if (8 * sizeof(time_t) - 1 > 2 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 3 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(time_t, long, -(long) (((((((unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(time_t) - 1 > 3 * PyLong_SHIFT) {\n                            return (time_t) (((time_t)-1)*(((((((time_t)digits[2]) << PyLong_SHIFT) | (time_t)digits[1]) << PyLong_SHIFT) | (time_t)digits[0])));\n                        }\n                    }\n                    break;\n                case 3:\n                    if (8 * sizeof(time_t) > 2 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 3 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(time_t, unsigned long, (((((((unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(time_t) - 1 > 3 * PyLong_SHIFT) {\n                            return (time_t) ((((((((time_t)digits[2]) << PyLong_SHIFT) | (time_t)digits[1]) << PyLong_SHIFT) | (time_t)digits[0])));\n                        }\n                    }\n                    break;\n                case -4:\n                    if (8 * sizeof(time_t) - 1 > 3 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 4 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(time_t, long, -(long) (((((((((unsigned long)digits[3]) << PyLong_SHIFT) | (unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(time_t) - 1 > 4 * PyLong_SHIFT) {\n                            return (time_t) (((time_t)-1)*(((((((((time_t)digits[3]) << PyLong_SHIFT) | (time_t)digits[2]) << PyLong_SHIFT) | (time_t)digits[1]) << PyLong_SHIFT) | (time_t)digits[0])));\n                        }\n                    }\n                    break;\n                case 4:\n                    if (8 * sizeof(time_t) > 3 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 4 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(time_t, unsigned long, (((((((((unsigned long)digits[3]) << PyLong_SHIFT) | (unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(time_t) - 1 > 4 * PyLong_SHIFT) {\n                            return (time_t) ((((((((((time_t)digits[3]) << PyLong_SHIFT) | (time_t)digits[2]) << PyLong_SHIFT) | (time_t)digits[1]) << PyLong_SHIFT) | (time_t)digits[0])));\n                        }\n                    }\n                    break;\n            }\n#endif\n            if (sizeof(time_t) <= sizeof(long)) {\n                __PYX_VERIFY_RETURN_INT_EXC(time_t, long, PyLong_AsLong(x))\n#ifdef HAVE_LONG_LONG\n            } else if (sizeof(time_t) <= sizeof(PY_LONG_LONG)) {\n                __PYX_VERIFY_RETURN_INT_EXC(time_t, PY_LONG_LONG, PyLong_AsLongLong(x))\n#endif\n            }\n        }\n        {\n#if CYTHON_COMPILING_IN_PYPY && !defined(_PyLong_AsByteArray)\n            PyErr_SetString(PyExc_RuntimeError,\n                            \"_PyLong_AsByteArray() not available in PyPy, cannot convert large numbers\");\n#else\n            time_t val;\n            PyObject *v = __Pyx_PyNumber_IntOrLong(x);\n #if PY_MAJOR_VERSION < 3\n            if (likely(v) && !PyLong_Check(v)) {\n                PyObject *tmp = v;\n                v = PyNumber_Long(tmp);\n                Py_DECREF(tmp);\n            }\n #endif\n            if (likely(v)) {\n                int one = 1; int is_little = (int)*(unsigned char *)&one;\n                unsigned char *bytes = (unsigned char *)&val;\n                int ret = _PyLong_AsByteArray((PyLongObject *)v,\n                                              bytes, sizeof(val),\n                                              is_little, !is_unsigned);\n                Py_DECREF(v);\n                if (likely(!ret))\n                    return val;\n            }\n#endif\n            return (time_t) -1;\n        }\n    } else {\n        time_t val;\n        PyObject *tmp = __Pyx_PyNumber_IntOrLong(x);\n        if (!tmp) return (time_t) -1;\n        val = __Pyx_PyInt_As_time_t(tmp);\n        Py_DECREF(tmp);\n        return val;\n    }\nraise_overflow:\n    PyErr_SetString(PyExc_OverflowError,\n        \"value too large to convert to time_t\");\n    return (time_t) -1;\nraise_neg_overflow:\n    PyErr_SetString(PyExc_OverflowError,\n        \"can't convert negative value to time_t\");\n    return (time_t) -1;\n}\n\n/* CIntToPy */\n            static CYTHON_INLINE PyObject* __Pyx_PyInt_From_long(long value) {\n    const long neg_one = (long) -1, const_zero = (long) 0;\n    const int is_unsigned = neg_one > const_zero;\n    if (is_unsigned) {\n        if (sizeof(long) < sizeof(long)) {\n            return PyInt_FromLong((long) value);\n        } else if (sizeof(long) <= sizeof(unsigned long)) {\n            return PyLong_FromUnsignedLong((unsigned long) value);\n#ifdef HAVE_LONG_LONG\n        } else if (sizeof(long) <= sizeof(unsigned PY_LONG_LONG)) {\n            return PyLong_FromUnsignedLongLong((unsigned PY_LONG_LONG) value);\n#endif\n        }\n    } else {\n        if (sizeof(long) <= sizeof(long)) {\n            return PyInt_FromLong((long) value);\n#ifdef HAVE_LONG_LONG\n        } else if (sizeof(long) <= sizeof(PY_LONG_LONG)) {\n            return PyLong_FromLongLong((PY_LONG_LONG) value);\n#endif\n        }\n    }\n    {\n        int one = 1; int little = (int)*(unsigned char *)&one;\n        unsigned char *bytes = (unsigned char *)&value;\n        return _PyLong_FromByteArray(bytes, sizeof(long),\n                                     little, !is_unsigned);\n    }\n}\n\n/* CIntFromPy */\n            static CYTHON_INLINE long __Pyx_PyInt_As_long(PyObject *x) {\n    const long neg_one = (long) -1, const_zero = (long) 0;\n    const int is_unsigned = neg_one > const_zero;\n#if PY_MAJOR_VERSION < 3\n    if (likely(PyInt_Check(x))) {\n        if (sizeof(long) < sizeof(long)) {\n            __PYX_VERIFY_RETURN_INT(long, long, PyInt_AS_LONG(x))\n        } else {\n            long val = PyInt_AS_LONG(x);\n            if (is_unsigned && unlikely(val < 0)) {\n                goto raise_neg_overflow;\n            }\n            return (long) val;\n        }\n    } else\n#endif\n    if (likely(PyLong_Check(x))) {\n        if (is_unsigned) {\n#if CYTHON_USE_PYLONG_INTERNALS\n            const digit* digits = ((PyLongObject*)x)->ob_digit;\n            switch (Py_SIZE(x)) {\n                case  0: return (long) 0;\n                case  1: __PYX_VERIFY_RETURN_INT(long, digit, digits[0])\n                case 2:\n                    if (8 * sizeof(long) > 1 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 2 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(long, unsigned long, (((((unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(long) >= 2 * PyLong_SHIFT) {\n                            return (long) (((((long)digits[1]) << PyLong_SHIFT) | (long)digits[0]));\n                        }\n                    }\n                    break;\n                case 3:\n                    if (8 * sizeof(long) > 2 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 3 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(long, unsigned long, (((((((unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(long) >= 3 * PyLong_SHIFT) {\n                            return (long) (((((((long)digits[2]) << PyLong_SHIFT) | (long)digits[1]) << PyLong_SHIFT) | (long)digits[0]));\n                        }\n                    }\n                    break;\n                case 4:\n                    if (8 * sizeof(long) > 3 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 4 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(long, unsigned long, (((((((((unsigned long)digits[3]) << PyLong_SHIFT) | (unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(long) >= 4 * PyLong_SHIFT) {\n                            return (long) (((((((((long)digits[3]) << PyLong_SHIFT) | (long)digits[2]) << PyLong_SHIFT) | (long)digits[1]) << PyLong_SHIFT) | (long)digits[0]));\n                        }\n                    }\n                    break;\n            }\n#endif\n#if CYTHON_COMPILING_IN_CPYTHON\n            if (unlikely(Py_SIZE(x) < 0)) {\n                goto raise_neg_overflow;\n            }\n#else\n            {\n                int result = PyObject_RichCompareBool(x, Py_False, Py_LT);\n                if (unlikely(result < 0))\n                    return (long) -1;\n                if (unlikely(result == 1))\n                    goto raise_neg_overflow;\n            }\n#endif\n            if (sizeof(long) <= sizeof(unsigned long)) {\n                __PYX_VERIFY_RETURN_INT_EXC(long, unsigned long, PyLong_AsUnsignedLong(x))\n#ifdef HAVE_LONG_LONG\n            } else if (sizeof(long) <= sizeof(unsigned PY_LONG_LONG)) {\n                __PYX_VERIFY_RETURN_INT_EXC(long, unsigned PY_LONG_LONG, PyLong_AsUnsignedLongLong(x))\n#endif\n            }\n        } else {\n#if CYTHON_USE_PYLONG_INTERNALS\n            const digit* digits = ((PyLongObject*)x)->ob_digit;\n            switch (Py_SIZE(x)) {\n                case  0: return (long) 0;\n                case -1: __PYX_VERIFY_RETURN_INT(long, sdigit, (sdigit) (-(sdigit)digits[0]))\n                case  1: __PYX_VERIFY_RETURN_INT(long,  digit, +digits[0])\n                case -2:\n                    if (8 * sizeof(long) - 1 > 1 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 2 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(long, long, -(long) (((((unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(long) - 1 > 2 * PyLong_SHIFT) {\n                            return (long) (((long)-1)*(((((long)digits[1]) << PyLong_SHIFT) | (long)digits[0])));\n                        }\n                    }\n                    break;\n                case 2:\n                    if (8 * sizeof(long) > 1 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 2 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(long, unsigned long, (((((unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(long) - 1 > 2 * PyLong_SHIFT) {\n                            return (long) ((((((long)digits[1]) << PyLong_SHIFT) | (long)digits[0])));\n                        }\n                    }\n                    break;\n                case -3:\n                    if (8 * sizeof(long) - 1 > 2 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 3 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(long, long, -(long) (((((((unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(long) - 1 > 3 * PyLong_SHIFT) {\n                            return (long) (((long)-1)*(((((((long)digits[2]) << PyLong_SHIFT) | (long)digits[1]) << PyLong_SHIFT) | (long)digits[0])));\n                        }\n                    }\n                    break;\n                case 3:\n                    if (8 * sizeof(long) > 2 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 3 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(long, unsigned long, (((((((unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(long) - 1 > 3 * PyLong_SHIFT) {\n                            return (long) ((((((((long)digits[2]) << PyLong_SHIFT) | (long)digits[1]) << PyLong_SHIFT) | (long)digits[0])));\n                        }\n                    }\n                    break;\n                case -4:\n                    if (8 * sizeof(long) - 1 > 3 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 4 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(long, long, -(long) (((((((((unsigned long)digits[3]) << PyLong_SHIFT) | (unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(long) - 1 > 4 * PyLong_SHIFT) {\n                            return (long) (((long)-1)*(((((((((long)digits[3]) << PyLong_SHIFT) | (long)digits[2]) << PyLong_SHIFT) | (long)digits[1]) << PyLong_SHIFT) | (long)digits[0])));\n                        }\n                    }\n                    break;\n                case 4:\n                    if (8 * sizeof(long) > 3 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 4 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(long, unsigned long, (((((((((unsigned long)digits[3]) << PyLong_SHIFT) | (unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(long) - 1 > 4 * PyLong_SHIFT) {\n                            return (long) ((((((((((long)digits[3]) << PyLong_SHIFT) | (long)digits[2]) << PyLong_SHIFT) | (long)digits[1]) << PyLong_SHIFT) | (long)digits[0])));\n                        }\n                    }\n                    break;\n            }\n#endif\n            if (sizeof(long) <= sizeof(long)) {\n                __PYX_VERIFY_RETURN_INT_EXC(long, long, PyLong_AsLong(x))\n#ifdef HAVE_LONG_LONG\n            } else if (sizeof(long) <= sizeof(PY_LONG_LONG)) {\n                __PYX_VERIFY_RETURN_INT_EXC(long, PY_LONG_LONG, PyLong_AsLongLong(x))\n#endif\n            }\n        }\n        {\n#if CYTHON_COMPILING_IN_PYPY && !defined(_PyLong_AsByteArray)\n            PyErr_SetString(PyExc_RuntimeError,\n                            \"_PyLong_AsByteArray() not available in PyPy, cannot convert large numbers\");\n#else\n            long val;\n            PyObject *v = __Pyx_PyNumber_IntOrLong(x);\n #if PY_MAJOR_VERSION < 3\n            if (likely(v) && !PyLong_Check(v)) {\n                PyObject *tmp = v;\n                v = PyNumber_Long(tmp);\n                Py_DECREF(tmp);\n            }\n #endif\n            if (likely(v)) {\n                int one = 1; int is_little = (int)*(unsigned char *)&one;\n                unsigned char *bytes = (unsigned char *)&val;\n                int ret = _PyLong_AsByteArray((PyLongObject *)v,\n                                              bytes, sizeof(val),\n                                              is_little, !is_unsigned);\n                Py_DECREF(v);\n                if (likely(!ret))\n                    return val;\n            }\n#endif\n            return (long) -1;\n        }\n    } else {\n        long val;\n        PyObject *tmp = __Pyx_PyNumber_IntOrLong(x);\n        if (!tmp) return (long) -1;\n        val = __Pyx_PyInt_As_long(tmp);\n        Py_DECREF(tmp);\n        return val;\n    }\nraise_overflow:\n    PyErr_SetString(PyExc_OverflowError,\n        \"value too large to convert to long\");\n    return (long) -1;\nraise_neg_overflow:\n    PyErr_SetString(PyExc_OverflowError,\n        \"can't convert negative value to long\");\n    return (long) -1;\n}\n\n/* CIntFromPy */\n            static CYTHON_INLINE int __Pyx_PyInt_As_int(PyObject *x) {\n    const int neg_one = (int) -1, const_zero = (int) 0;\n    const int is_unsigned = neg_one > const_zero;\n#if PY_MAJOR_VERSION < 3\n    if (likely(PyInt_Check(x))) {\n        if (sizeof(int) < sizeof(long)) {\n            __PYX_VERIFY_RETURN_INT(int, long, PyInt_AS_LONG(x))\n        } else {\n            long val = PyInt_AS_LONG(x);\n            if (is_unsigned && unlikely(val < 0)) {\n                goto raise_neg_overflow;\n            }\n            return (int) val;\n        }\n    } else\n#endif\n    if (likely(PyLong_Check(x))) {\n        if (is_unsigned) {\n#if CYTHON_USE_PYLONG_INTERNALS\n            const digit* digits = ((PyLongObject*)x)->ob_digit;\n            switch (Py_SIZE(x)) {\n                case  0: return (int) 0;\n                case  1: __PYX_VERIFY_RETURN_INT(int, digit, digits[0])\n                case 2:\n                    if (8 * sizeof(int) > 1 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 2 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(int, unsigned long, (((((unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(int) >= 2 * PyLong_SHIFT) {\n                            return (int) (((((int)digits[1]) << PyLong_SHIFT) | (int)digits[0]));\n                        }\n                    }\n                    break;\n                case 3:\n                    if (8 * sizeof(int) > 2 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 3 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(int, unsigned long, (((((((unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(int) >= 3 * PyLong_SHIFT) {\n                            return (int) (((((((int)digits[2]) << PyLong_SHIFT) | (int)digits[1]) << PyLong_SHIFT) | (int)digits[0]));\n                        }\n                    }\n                    break;\n                case 4:\n                    if (8 * sizeof(int) > 3 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 4 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(int, unsigned long, (((((((((unsigned long)digits[3]) << PyLong_SHIFT) | (unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(int) >= 4 * PyLong_SHIFT) {\n                            return (int) (((((((((int)digits[3]) << PyLong_SHIFT) | (int)digits[2]) << PyLong_SHIFT) | (int)digits[1]) << PyLong_SHIFT) | (int)digits[0]));\n                        }\n                    }\n                    break;\n            }\n#endif\n#if CYTHON_COMPILING_IN_CPYTHON\n            if (unlikely(Py_SIZE(x) < 0)) {\n                goto raise_neg_overflow;\n            }\n#else\n            {\n                int result = PyObject_RichCompareBool(x, Py_False, Py_LT);\n                if (unlikely(result < 0))\n                    return (int) -1;\n                if (unlikely(result == 1))\n                    goto raise_neg_overflow;\n            }\n#endif\n            if (sizeof(int) <= sizeof(unsigned long)) {\n                __PYX_VERIFY_RETURN_INT_EXC(int, unsigned long, PyLong_AsUnsignedLong(x))\n#ifdef HAVE_LONG_LONG\n            } else if (sizeof(int) <= sizeof(unsigned PY_LONG_LONG)) {\n                __PYX_VERIFY_RETURN_INT_EXC(int, unsigned PY_LONG_LONG, PyLong_AsUnsignedLongLong(x))\n#endif\n            }\n        } else {\n#if CYTHON_USE_PYLONG_INTERNALS\n            const digit* digits = ((PyLongObject*)x)->ob_digit;\n            switch (Py_SIZE(x)) {\n                case  0: return (int) 0;\n                case -1: __PYX_VERIFY_RETURN_INT(int, sdigit, (sdigit) (-(sdigit)digits[0]))\n                case  1: __PYX_VERIFY_RETURN_INT(int,  digit, +digits[0])\n                case -2:\n                    if (8 * sizeof(int) - 1 > 1 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 2 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(int, long, -(long) (((((unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(int) - 1 > 2 * PyLong_SHIFT) {\n                            return (int) (((int)-1)*(((((int)digits[1]) << PyLong_SHIFT) | (int)digits[0])));\n                        }\n                    }\n                    break;\n                case 2:\n                    if (8 * sizeof(int) > 1 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 2 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(int, unsigned long, (((((unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(int) - 1 > 2 * PyLong_SHIFT) {\n                            return (int) ((((((int)digits[1]) << PyLong_SHIFT) | (int)digits[0])));\n                        }\n                    }\n                    break;\n                case -3:\n                    if (8 * sizeof(int) - 1 > 2 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 3 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(int, long, -(long) (((((((unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(int) - 1 > 3 * PyLong_SHIFT) {\n                            return (int) (((int)-1)*(((((((int)digits[2]) << PyLong_SHIFT) | (int)digits[1]) << PyLong_SHIFT) | (int)digits[0])));\n                        }\n                    }\n                    break;\n                case 3:\n                    if (8 * sizeof(int) > 2 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 3 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(int, unsigned long, (((((((unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(int) - 1 > 3 * PyLong_SHIFT) {\n                            return (int) ((((((((int)digits[2]) << PyLong_SHIFT) | (int)digits[1]) << PyLong_SHIFT) | (int)digits[0])));\n                        }\n                    }\n                    break;\n                case -4:\n                    if (8 * sizeof(int) - 1 > 3 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 4 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(int, long, -(long) (((((((((unsigned long)digits[3]) << PyLong_SHIFT) | (unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(int) - 1 > 4 * PyLong_SHIFT) {\n                            return (int) (((int)-1)*(((((((((int)digits[3]) << PyLong_SHIFT) | (int)digits[2]) << PyLong_SHIFT) | (int)digits[1]) << PyLong_SHIFT) | (int)digits[0])));\n                        }\n                    }\n                    break;\n                case 4:\n                    if (8 * sizeof(int) > 3 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 4 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(int, unsigned long, (((((((((unsigned long)digits[3]) << PyLong_SHIFT) | (unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(int) - 1 > 4 * PyLong_SHIFT) {\n                            return (int) ((((((((((int)digits[3]) << PyLong_SHIFT) | (int)digits[2]) << PyLong_SHIFT) | (int)digits[1]) << PyLong_SHIFT) | (int)digits[0])));\n                        }\n                    }\n                    break;\n            }\n#endif\n            if (sizeof(int) <= sizeof(long)) {\n                __PYX_VERIFY_RETURN_INT_EXC(int, long, PyLong_AsLong(x))\n#ifdef HAVE_LONG_LONG\n            } else if (sizeof(int) <= sizeof(PY_LONG_LONG)) {\n                __PYX_VERIFY_RETURN_INT_EXC(int, PY_LONG_LONG, PyLong_AsLongLong(x))\n#endif\n            }\n        }\n        {\n#if CYTHON_COMPILING_IN_PYPY && !defined(_PyLong_AsByteArray)\n            PyErr_SetString(PyExc_RuntimeError,\n                            \"_PyLong_AsByteArray() not available in PyPy, cannot convert large numbers\");\n#else\n            int val;\n            PyObject *v = __Pyx_PyNumber_IntOrLong(x);\n #if PY_MAJOR_VERSION < 3\n            if (likely(v) && !PyLong_Check(v)) {\n                PyObject *tmp = v;\n                v = PyNumber_Long(tmp);\n                Py_DECREF(tmp);\n            }\n #endif\n            if (likely(v)) {\n                int one = 1; int is_little = (int)*(unsigned char *)&one;\n                unsigned char *bytes = (unsigned char *)&val;\n                int ret = _PyLong_AsByteArray((PyLongObject *)v,\n                                              bytes, sizeof(val),\n                                              is_little, !is_unsigned);\n                Py_DECREF(v);\n                if (likely(!ret))\n                    return val;\n            }\n#endif\n            return (int) -1;\n        }\n    } else {\n        int val;\n        PyObject *tmp = __Pyx_PyNumber_IntOrLong(x);\n        if (!tmp) return (int) -1;\n        val = __Pyx_PyInt_As_int(tmp);\n        Py_DECREF(tmp);\n        return val;\n    }\nraise_overflow:\n    PyErr_SetString(PyExc_OverflowError,\n        \"value too large to convert to int\");\n    return (int) -1;\nraise_neg_overflow:\n    PyErr_SetString(PyExc_OverflowError,\n        \"can't convert negative value to int\");\n    return (int) -1;\n}\n\n/* FastTypeChecks */\n            #if CYTHON_COMPILING_IN_CPYTHON\nstatic int __Pyx_InBases(PyTypeObject *a, PyTypeObject *b) {\n    while (a) {\n        a = a->tp_base;\n        if (a == b)\n            return 1;\n    }\n    return b == &PyBaseObject_Type;\n}\nstatic CYTHON_INLINE int __Pyx_IsSubtype(PyTypeObject *a, PyTypeObject *b) {\n    PyObject *mro;\n    if (a == b) return 1;\n    mro = a->tp_mro;\n    if (likely(mro)) {\n        Py_ssize_t i, n;\n        n = PyTuple_GET_SIZE(mro);\n        for (i = 0; i < n; i++) {\n            if (PyTuple_GET_ITEM(mro, i) == (PyObject *)b)\n                return 1;\n        }\n        return 0;\n    }\n    return __Pyx_InBases(a, b);\n}\n#if PY_MAJOR_VERSION == 2\nstatic int __Pyx_inner_PyErr_GivenExceptionMatches2(PyObject *err, PyObject* exc_type1, PyObject* exc_type2) {\n    PyObject *exception, *value, *tb;\n    int res;\n    __Pyx_PyThreadState_declare\n    __Pyx_PyThreadState_assign\n    __Pyx_ErrFetch(&exception, &value, &tb);\n    res = exc_type1 ? PyObject_IsSubclass(err, exc_type1) : 0;\n    if (unlikely(res == -1)) {\n        PyErr_WriteUnraisable(err);\n        res = 0;\n    }\n    if (!res) {\n        res = PyObject_IsSubclass(err, exc_type2);\n        if (unlikely(res == -1)) {\n            PyErr_WriteUnraisable(err);\n            res = 0;\n        }\n    }\n    __Pyx_ErrRestore(exception, value, tb);\n    return res;\n}\n#else\nstatic CYTHON_INLINE int __Pyx_inner_PyErr_GivenExceptionMatches2(PyObject *err, PyObject* exc_type1, PyObject *exc_type2) {\n    int res = exc_type1 ? __Pyx_IsSubtype((PyTypeObject*)err, (PyTypeObject*)exc_type1) : 0;\n    if (!res) {\n        res = __Pyx_IsSubtype((PyTypeObject*)err, (PyTypeObject*)exc_type2);\n    }\n    return res;\n}\n#endif\nstatic CYTHON_INLINE int __Pyx_PyErr_GivenExceptionMatches(PyObject *err, PyObject* exc_type) {\n    if (likely(err == exc_type)) return 1;\n    if (likely(PyExceptionClass_Check(err))) {\n        return __Pyx_inner_PyErr_GivenExceptionMatches2(err, NULL, exc_type);\n    }\n    return PyErr_GivenExceptionMatches(err, exc_type);\n}\nstatic CYTHON_INLINE int __Pyx_PyErr_GivenExceptionMatches2(PyObject *err, PyObject *exc_type1, PyObject *exc_type2) {\n    if (likely(err == exc_type1 || err == exc_type2)) return 1;\n    if (likely(PyExceptionClass_Check(err))) {\n        return __Pyx_inner_PyErr_GivenExceptionMatches2(err, exc_type1, exc_type2);\n    }\n    return (PyErr_GivenExceptionMatches(err, exc_type1) || PyErr_GivenExceptionMatches(err, exc_type2));\n}\n#endif\n\n/* CheckBinaryVersion */\n            static int __Pyx_check_binary_version(void) {\n    char ctversion[4], rtversion[4];\n    PyOS_snprintf(ctversion, 4, \"%d.%d\", PY_MAJOR_VERSION, PY_MINOR_VERSION);\n    PyOS_snprintf(rtversion, 4, \"%s\", Py_GetVersion());\n    if (ctversion[0] != rtversion[0] || ctversion[2] != rtversion[2]) {\n        char message[200];\n        PyOS_snprintf(message, sizeof(message),\n                      \"compiletime version %s of module '%.100s' \"\n                      \"does not match runtime version %s\",\n                      ctversion, __Pyx_MODULE_NAME, rtversion);\n        return PyErr_WarnEx(NULL, message, 1);\n    }\n    return 0;\n}\n\n/* FunctionExport */\n            static int __Pyx_ExportFunction(const char *name, void (*f)(void), const char *sig) {\n    PyObject *d = 0;\n    PyObject *cobj = 0;\n    union {\n        void (*fp)(void);\n        void *p;\n    } tmp;\n    d = PyObject_GetAttrString(__pyx_m, (char *)\"__pyx_capi__\");\n    if (!d) {\n        PyErr_Clear();\n        d = PyDict_New();\n        if (!d)\n            goto bad;\n        Py_INCREF(d);\n        if (PyModule_AddObject(__pyx_m, (char *)\"__pyx_capi__\", d) < 0)\n            goto bad;\n    }\n    tmp.fp = f;\n#if PY_VERSION_HEX >= 0x02070000\n    cobj = PyCapsule_New(tmp.p, sig, 0);\n#else\n    cobj = PyCObject_FromVoidPtrAndDesc(tmp.p, (void *)sig, 0);\n#endif\n    if (!cobj)\n        goto bad;\n    if (PyDict_SetItemString(d, name, cobj) < 0)\n        goto bad;\n    Py_DECREF(cobj);\n    Py_DECREF(d);\n    return 0;\nbad:\n    Py_XDECREF(cobj);\n    Py_XDECREF(d);\n    return -1;\n}\n\n/* InitStrings */\n            static int __Pyx_InitStrings(__Pyx_StringTabEntry *t) {\n    while (t->p) {\n        #if PY_MAJOR_VERSION < 3\n        if (t->is_unicode) {\n            *t->p = PyUnicode_DecodeUTF8(t->s, t->n - 1, NULL);\n        } else if (t->intern) {\n            *t->p = PyString_InternFromString(t->s);\n        } else {\n            *t->p = PyString_FromStringAndSize(t->s, t->n - 1);\n        }\n        #else\n        if (t->is_unicode | t->is_str) {\n            if (t->intern) {\n                *t->p = PyUnicode_InternFromString(t->s);\n            } else if (t->encoding) {\n                *t->p = PyUnicode_Decode(t->s, t->n - 1, t->encoding, NULL);\n            } else {\n                *t->p = PyUnicode_FromStringAndSize(t->s, t->n - 1);\n            }\n        } else {\n            *t->p = PyBytes_FromStringAndSize(t->s, t->n - 1);\n        }\n        #endif\n        if (!*t->p)\n            return -1;\n        if (PyObject_Hash(*t->p) == -1)\n            PyErr_Clear();\n        ++t;\n    }\n    return 0;\n}\n\nstatic CYTHON_INLINE PyObject* __Pyx_PyUnicode_FromString(const char* c_str) {\n    return __Pyx_PyUnicode_FromStringAndSize(c_str, (Py_ssize_t)strlen(c_str));\n}\nstatic CYTHON_INLINE const char* __Pyx_PyObject_AsString(PyObject* o) {\n    Py_ssize_t ignore;\n    return __Pyx_PyObject_AsStringAndSize(o, &ignore);\n}\n#if __PYX_DEFAULT_STRING_ENCODING_IS_ASCII || __PYX_DEFAULT_STRING_ENCODING_IS_DEFAULT\n#if !CYTHON_PEP393_ENABLED\nstatic const char* __Pyx_PyUnicode_AsStringAndSize(PyObject* o, Py_ssize_t *length) {\n    char* defenc_c;\n    PyObject* defenc = _PyUnicode_AsDefaultEncodedString(o, NULL);\n    if (!defenc) return NULL;\n    defenc_c = PyBytes_AS_STRING(defenc);\n#if __PYX_DEFAULT_STRING_ENCODING_IS_ASCII\n    {\n        char* end = defenc_c + PyBytes_GET_SIZE(defenc);\n        char* c;\n        for (c = defenc_c; c < end; c++) {\n            if ((unsigned char) (*c) >= 128) {\n                PyUnicode_AsASCIIString(o);\n                return NULL;\n            }\n        }\n    }\n#endif\n    *length = PyBytes_GET_SIZE(defenc);\n    return defenc_c;\n}\n#else\nstatic CYTHON_INLINE const char* __Pyx_PyUnicode_AsStringAndSize(PyObject* o, Py_ssize_t *length) {\n    if (unlikely(__Pyx_PyUnicode_READY(o) == -1)) return NULL;\n#if __PYX_DEFAULT_STRING_ENCODING_IS_ASCII\n    if (likely(PyUnicode_IS_ASCII(o))) {\n        *length = PyUnicode_GET_LENGTH(o);\n        return PyUnicode_AsUTF8(o);\n    } else {\n        PyUnicode_AsASCIIString(o);\n        return NULL;\n    }\n#else\n    return PyUnicode_AsUTF8AndSize(o, length);\n#endif\n}\n#endif\n#endif\nstatic CYTHON_INLINE const char* __Pyx_PyObject_AsStringAndSize(PyObject* o, Py_ssize_t *length) {\n#if __PYX_DEFAULT_STRING_ENCODING_IS_ASCII || __PYX_DEFAULT_STRING_ENCODING_IS_DEFAULT\n    if (\n#if PY_MAJOR_VERSION < 3 && __PYX_DEFAULT_STRING_ENCODING_IS_ASCII\n            __Pyx_sys_getdefaultencoding_not_ascii &&\n#endif\n            PyUnicode_Check(o)) {\n        return __Pyx_PyUnicode_AsStringAndSize(o, length);\n    } else\n#endif\n#if (!CYTHON_COMPILING_IN_PYPY) || (defined(PyByteArray_AS_STRING) && defined(PyByteArray_GET_SIZE))\n    if (PyByteArray_Check(o)) {\n        *length = PyByteArray_GET_SIZE(o);\n        return PyByteArray_AS_STRING(o);\n    } else\n#endif\n    {\n        char* result;\n        int r = PyBytes_AsStringAndSize(o, &result, length);\n        if (unlikely(r < 0)) {\n            return NULL;\n        } else {\n            return result;\n        }\n    }\n}\nstatic CYTHON_INLINE int __Pyx_PyObject_IsTrue(PyObject* x) {\n   int is_true = x == Py_True;\n   if (is_true | (x == Py_False) | (x == Py_None)) return is_true;\n   else return PyObject_IsTrue(x);\n}\nstatic PyObject* __Pyx_PyNumber_IntOrLongWrongResultType(PyObject* result, const char* type_name) {\n#if PY_MAJOR_VERSION >= 3\n    if (PyLong_Check(result)) {\n        if (PyErr_WarnFormat(PyExc_DeprecationWarning, 1,\n                \"__int__ returned non-int (type %.200s).  \"\n                \"The ability to return an instance of a strict subclass of int \"\n                \"is deprecated, and may be removed in a future version of Python.\",\n                Py_TYPE(result)->tp_name)) {\n            Py_DECREF(result);\n            return NULL;\n        }\n        return result;\n    }\n#endif\n    PyErr_Format(PyExc_TypeError,\n                 \"__%.4s__ returned non-%.4s (type %.200s)\",\n                 type_name, type_name, Py_TYPE(result)->tp_name);\n    Py_DECREF(result);\n    return NULL;\n}\nstatic CYTHON_INLINE PyObject* __Pyx_PyNumber_IntOrLong(PyObject* x) {\n#if CYTHON_USE_TYPE_SLOTS\n  PyNumberMethods *m;\n#endif\n  const char *name = NULL;\n  PyObject *res = NULL;\n#if PY_MAJOR_VERSION < 3\n  if (likely(PyInt_Check(x) || PyLong_Check(x)))\n#else\n  if (likely(PyLong_Check(x)))\n#endif\n    return __Pyx_NewRef(x);\n#if CYTHON_USE_TYPE_SLOTS\n  m = Py_TYPE(x)->tp_as_number;\n  #if PY_MAJOR_VERSION < 3\n  if (m && m->nb_int) {\n    name = \"int\";\n    res = m->nb_int(x);\n  }\n  else if (m && m->nb_long) {\n    name = \"long\";\n    res = m->nb_long(x);\n  }\n  #else\n  if (likely(m && m->nb_int)) {\n    name = \"int\";\n    res = m->nb_int(x);\n  }\n  #endif\n#else\n  if (!PyBytes_CheckExact(x) && !PyUnicode_CheckExact(x)) {\n    res = PyNumber_Int(x);\n  }\n#endif\n  if (likely(res)) {\n#if PY_MAJOR_VERSION < 3\n    if (unlikely(!PyInt_Check(res) && !PyLong_Check(res))) {\n#else\n    if (unlikely(!PyLong_CheckExact(res))) {\n#endif\n        return __Pyx_PyNumber_IntOrLongWrongResultType(res, name);\n    }\n  }\n  else if (!PyErr_Occurred()) {\n    PyErr_SetString(PyExc_TypeError,\n                    \"an integer is required\");\n  }\n  return res;\n}\nstatic CYTHON_INLINE Py_ssize_t __Pyx_PyIndex_AsSsize_t(PyObject* b) {\n  Py_ssize_t ival;\n  PyObject *x;\n#if PY_MAJOR_VERSION < 3\n  if (likely(PyInt_CheckExact(b))) {\n    if (sizeof(Py_ssize_t) >= sizeof(long))\n        return PyInt_AS_LONG(b);\n    else\n        return PyInt_AsSsize_t(x);\n  }\n#endif\n  if (likely(PyLong_CheckExact(b))) {\n    #if CYTHON_USE_PYLONG_INTERNALS\n    const digit* digits = ((PyLongObject*)b)->ob_digit;\n    const Py_ssize_t size = Py_SIZE(b);\n    if (likely(__Pyx_sst_abs(size) <= 1)) {\n        ival = likely(size) ? digits[0] : 0;\n        if (size == -1) ival = -ival;\n        return ival;\n    } else {\n      switch (size) {\n         case 2:\n           if (8 * sizeof(Py_ssize_t) > 2 * PyLong_SHIFT) {\n             return (Py_ssize_t) (((((size_t)digits[1]) << PyLong_SHIFT) | (size_t)digits[0]));\n           }\n           break;\n         case -2:\n           if (8 * sizeof(Py_ssize_t) > 2 * PyLong_SHIFT) {\n             return -(Py_ssize_t) (((((size_t)digits[1]) << PyLong_SHIFT) | (size_t)digits[0]));\n           }\n           break;\n         case 3:\n           if (8 * sizeof(Py_ssize_t) > 3 * PyLong_SHIFT) {\n             return (Py_ssize_t) (((((((size_t)digits[2]) << PyLong_SHIFT) | (size_t)digits[1]) << PyLong_SHIFT) | (size_t)digits[0]));\n           }\n           break;\n         case -3:\n           if (8 * sizeof(Py_ssize_t) > 3 * PyLong_SHIFT) {\n             return -(Py_ssize_t) (((((((size_t)digits[2]) << PyLong_SHIFT) | (size_t)digits[1]) << PyLong_SHIFT) | (size_t)digits[0]));\n           }\n           break;\n         case 4:\n           if (8 * sizeof(Py_ssize_t) > 4 * PyLong_SHIFT) {\n             return (Py_ssize_t) (((((((((size_t)digits[3]) << PyLong_SHIFT) | (size_t)digits[2]) << PyLong_SHIFT) | (size_t)digits[1]) << PyLong_SHIFT) | (size_t)digits[0]));\n           }\n           break;\n         case -4:\n           if (8 * sizeof(Py_ssize_t) > 4 * PyLong_SHIFT) {\n             return -(Py_ssize_t) (((((((((size_t)digits[3]) << PyLong_SHIFT) | (size_t)digits[2]) << PyLong_SHIFT) | (size_t)digits[1]) << PyLong_SHIFT) | (size_t)digits[0]));\n           }\n           break;\n      }\n    }\n    #endif\n    return PyLong_AsSsize_t(b);\n  }\n  x = PyNumber_Index(b);\n  if (!x) return -1;\n  ival = PyInt_AsSsize_t(x);\n  Py_DECREF(x);\n  return ival;\n}\nstatic CYTHON_INLINE PyObject * __Pyx_PyInt_FromSize_t(size_t ival) {\n    return PyInt_FromSize_t(ival);\n}\n\n\n#endif /* Py_PYTHON_H */\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/extensions/python/pywrapfst.pxd",
    "content": "# See www.openfst.org for extensive documentation on this weighted\n# finite-state transducer library.\n\n\nfrom libc.time cimport time\nfrom libc.time cimport time_t\n\nfrom libcpp cimport bool\nfrom libcpp.memory cimport shared_ptr\nfrom libcpp.memory cimport unique_ptr\nfrom libcpp.utility cimport pair\nfrom libcpp.vector cimport vector\n\nfrom libcpp.string cimport string\nfrom basictypes cimport int32\nfrom basictypes cimport int64\nfrom basictypes cimport uint32\nfrom basictypes cimport uint64\ncimport fst as fst\nfrom ios cimport stringstream\n\n\n\n# Exportable helper functions.\n\n\ncdef string tostring(data, encoding=?) except *\n\ncdef string weight_tostring(data, encoding=?) except *\n\ncdef fst.ComposeFilter _get_compose_filter(\n    const string &compose_filter) except *\n\ncdef fst.DeterminizeType _get_determinize_type(const string &det_type) except *\n\ncdef fst.QueueType _get_queue_type(const string &queue_type) except *\n\ncdef fst.RandArcSelection _get_rand_arc_selection(\n    const string &replace_label_type) except *\n\ncdef fst.ReplaceLabelType _get_replace_label_type(\n    const string &replace_label_type, bool epsilon_on_replace) except *\n\n\n# Weight.\n\n\ncdef fst.WeightClass _get_WeightClass_or_One(const string &weight_type,\n                                             weight_string) except *\n\ncdef fst.WeightClass _get_WeightClass_or_Zero(const string &weight_type,\n                                              weight_string) except *\n\n\ncdef class Weight(object):\n\n  cdef unique_ptr[fst.WeightClass] _weight\n\n  cdef void _check_weight(self) except *\n\n  cpdef Weight copy(self)\n\n  cpdef string to_string(self)\n\n  cpdef string type(self)\n\n\ncdef Weight _Zero(weight_type)\n\ncdef Weight _One(weight_type)\n\ncdef Weight _NoWeight(weight_type)\n\ncdef Weight _plus(Weight lhs, Weight rhs)\n\ncdef Weight _times(Weight lhs, Weight rhs)\n\ncdef Weight _divide(Weight lhs, Weight rhs)\n\ncdef Weight _power(Weight lhs, size_t n)\n\n\n# SymbolTable.\n\nctypedef fst.SymbolTable * SymbolTable_ptr\n\n\ncdef class _SymbolTable(object):\n\n  cdef fst.SymbolTable *_table\n\n  cpdef int64 available_key(self)\n\n  cpdef string checksum(self)\n\n  cpdef SymbolTable copy(self)\n\n  cpdef int64 get_nth_key(self, ssize_t pos) except *\n\n  cpdef string labeled_checksum(self)\n\n  cpdef bool member(self, key)\n\n  cpdef string name(self)\n\n  cpdef size_t num_symbols(self)\n\n  cpdef void write(self, filename) except *\n\n  cpdef void write_text(self, filename) except *\n\n\ncdef class _EncodeMapperSymbolTable(_SymbolTable):\n\n  cdef shared_ptr[fst.EncodeMapperClass] _encoder\n\n\ncdef class _FstSymbolTable(_SymbolTable):\n\n  cdef shared_ptr[fst.FstClass] _fst\n\n\ncdef class _MutableSymbolTable(_SymbolTable):\n\n  cpdef int64 add_symbol(self, symbol, int64 key=?)\n\n  cpdef void add_table(self, _SymbolTable syms)\n\n  cpdef void set_name(self, new_name) except *\n\n\ncdef class _MutableFstSymbolTable(_MutableSymbolTable):\n\n  cdef shared_ptr[fst.MutableFstClass] _mfst\n\n\ncdef class SymbolTable(_MutableSymbolTable):\n\n  cdef unique_ptr[fst.SymbolTable] _smart_table\n\n\ncdef _EncodeMapperSymbolTable _init_EncodeMapperSymbolTable(\n    fst.SymbolTable *table, shared_ptr[fst.EncodeMapperClass] encoder)\n\n\ncdef _FstSymbolTable _init_FstSymbolTable(fst.SymbolTable *table,\n                                          shared_ptr[fst.FstClass] ifst)\n\n\ncdef _MutableFstSymbolTable _init_MutableFstSymbolTable(fst.SymbolTable *table,\n    shared_ptr[fst.MutableFstClass] ifst)\n\n\ncdef SymbolTable _init_SymbolTable(fst.SymbolTable *table)\n\n\n\ncdef class SymbolTableIterator(object):\n\n  cdef shared_ptr[fst.SymbolTable] _table\n  cdef unique_ptr[fst.SymbolTableIterator] _siter\n\n  cpdef bool done(self)\n\n  cpdef void next(self)\n\n  cpdef void reset(self)\n\n  cpdef string symbol(self)\n\n  cpdef int64 value(self)\n\n\n# EncodeMapper.\n\n\ncdef class EncodeMapper(object):\n\n  cdef shared_ptr[fst.EncodeMapperClass] _encoder\n\n  cpdef string arc_type(self)\n\n  cpdef uint32 flags(self)\n\n  cpdef _EncodeMapperSymbolTable input_symbols(self)\n\n  cpdef _EncodeMapperSymbolTable output_symbols(self)\n\n  cpdef uint64 properties(self, uint64 mask)\n\n  cpdef void set_input_symbols(self, _SymbolTable syms) except *\n\n  cpdef void set_output_symbols(self, _SymbolTable syms) except *\n\n  cpdef string weight_type(self)\n\n\n# Fst.\n\n\nctypedef fst.FstClass * FstClass_ptr\nctypedef fst.MutableFstClass * MutableFstClass_ptr\nctypedef fst.VectorFstClass * VectorFstClass_ptr\n\n\ncdef class _Fst(object):\n\n  cdef shared_ptr[fst.FstClass] _fst\n\n  cpdef string arc_type(self)\n\n  cpdef ArcIterator arcs(self, int64 state)\n\n  cpdef _Fst copy(self)\n\n  cpdef void draw(self, filename, _SymbolTable isymbols=?,\n                  _SymbolTable osymbols=?, SymbolTable ssymbols=?,\n                  bool acceptor=?, title=?, double width=?,\n                  double height=?, bool portrait=?, bool vertical=?,\n                  double ranksep=?, double nodesep=?, int32 fontsize=?,\n                  int32 precision=?, float_format=?,\n                  bool show_weight_one=?)\n\n  cpdef Weight final(self, int64 state)\n\n  cpdef string fst_type(self)\n\n  cpdef _FstSymbolTable input_symbols(self)\n\n  cpdef size_t num_arcs(self, int64 state) except *\n\n  cpdef size_t num_input_epsilons(self, int64 state) except *\n\n  cpdef size_t num_output_epsilons(self, int64 state) except *\n\n  cpdef _FstSymbolTable output_symbols(self)\n\n  cpdef uint64 properties(self, uint64 mask, bool test)\n\n  cpdef int64 start(self)\n\n  cpdef StateIterator states(self)\n\n  cpdef string text(self, _SymbolTable isymbols=?, _SymbolTable osymbols=?,\n                    _SymbolTable ssymbols=?, bool acceptor=?,\n                    bool show_weight_one=?, missing_sym=?)\n\n  cpdef bool verify(self)\n\n  cpdef string weight_type(self)\n\n  cpdef void write(self, filename) except *\n\n  cpdef string write_to_string(self)\n\n\ncdef class _MutableFst(_Fst):\n\n  cdef shared_ptr[fst.MutableFstClass] _mfst\n\n  cdef void _check_mutating_imethod(self) except *\n\n  cdef void _add_arc(self, int64 state, Arc arc) except *\n\n  cpdef int64 add_state(self) except *\n\n  cdef void _arcsort(self, sort_type=?) except *\n\n  cdef void _closure(self, bool closure_plus=?) except *\n\n  cdef void _concat(self, _Fst ifst) except *\n\n  cdef void _connect(self) except *\n\n  cdef void _decode(self, EncodeMapper) except *\n\n  cdef void _delete_arcs(self, int64 state, size_t n=?) except *\n\n  cdef void _delete_states(self, states=?) except *\n\n  cdef void _encode(self, EncodeMapper) except *\n\n  cdef void _invert(self) except *\n\n  cdef void _minimize(self, float delta=?, bool allow_nondet=?) except *\n\n  cpdef MutableArcIterator mutable_arcs(self, int64 state)\n\n  cpdef int64 num_states(self)\n\n  cdef void _project(self, bool project_output=?) except *\n\n  cdef void _prune(self, float delta=?, int64 nstate=?, weight=?) except *\n\n  cdef void _push(self, float delta=?, bool remove_total_weight=?,\n                  bool to_final=?) except *\n\n  cdef void _relabel_pairs(self, ipairs=?, opairs=?) except *\n\n  cdef void _relabel_tables(self, _SymbolTable old_isymbols=?,\n      _SymbolTable new_isymbols=?, unknown_isymbol=?,\n      bool attach_new_isymbols=?,\n      _SymbolTable old_osymbols=?, _SymbolTable new_osymbols=?,\n      unknown_osymbol=?, bool attach_new_osymbols=?) except *\n\n  cdef void _reserve_arcs(self, int64 state, size_t n) except *\n\n  cdef void _reserve_states(self, int64 n) except *\n\n  cdef void _reweight(self, potentials, bool to_final=?) except *\n\n  cdef void _rmepsilon(self, queue_type=?, bool connect=?, weight=?,\n                       int64 nstate=?, float delta=?) except *\n\n  cdef void _set_final(self, int64 state, weight=?) except *\n\n  cdef void _set_properties(self, uint64 props, uint64 mask)\n\n  cdef void _set_start(self, int64 state) except *\n\n  cdef void _set_input_symbols(self, _SymbolTable syms) except *\n\n  cdef void _set_output_symbols(self, _SymbolTable syms) except *\n\n  cdef void _topsort(self) except *\n\n  cdef void _union(self, _Fst ifst) except *\n\n\n# Fst construction helpers.\n\n\ncdef _Fst _init_Fst(FstClass_ptr tfst)\n\ncdef _MutableFst _init_MutableFst(MutableFstClass_ptr tfst)\n\ncdef _Fst _init_XFst(FstClass_ptr tfst)\n\ncdef _MutableFst _create_Fst(arc_type=?)\n\ncpdef _Fst _read(filename)\n\ncpdef _Fst _read_from_string(State)\n\n\n# Iterators.\n\n\ncdef class Arc(object):\n\n  cdef unique_ptr[fst.ArcClass] _arc\n\n  cpdef Arc copy(self)\n\n\ncdef Arc _init_Arc(const fst.ArcClass &arc)\n\n\ncdef class ArcIterator(object):\n\n  cdef shared_ptr[fst.FstClass] _fst\n  cdef unique_ptr[fst.ArcIteratorClass] _aiter\n\n  cpdef bool done(self)\n\n  cpdef uint32 flags(self)\n\n  cpdef void next(self)\n\n  cpdef size_t position(self)\n\n  cpdef void reset(self)\n\n  cpdef void seek(self, size_t a)\n\n  cpdef void set_flags(self, uint32 flags, uint32 mask)\n\n  cpdef object value(self)\n\n\ncdef class MutableArcIterator(object):\n\n  cdef shared_ptr[fst.MutableFstClass] _mfst\n  cdef unique_ptr[fst.MutableArcIteratorClass] _aiter\n\n  cpdef bool done(self)\n\n  cpdef uint32 flags(self)\n\n  cpdef void next(self)\n\n  cpdef size_t position(self)\n\n  cpdef void reset(self)\n\n  cpdef void seek(self, size_t a)\n\n  cpdef void set_flags(self, uint32 flags, uint32 mask)\n\n  cpdef void set_value(self, Arc arc)\n\n  cpdef object value(self)\n\n\ncdef class StateIterator(object):\n\n  cdef shared_ptr[fst.FstClass] _fst\n  cdef unique_ptr[fst.StateIteratorClass] _siter\n\n  cpdef bool done(self)\n\n  cpdef void next(self)\n\n  cpdef void reset(self)\n\n  cpdef int64 value(self)\n\n\n# Constructive operations on Fst.\n\n\ncdef _Fst _map(_Fst ifst, float delta=?, map_type=?, double power=?, weight=?)\n\ncpdef _Fst arcmap(_Fst ifst, float delta=?, map_type=?, double power=?, weight=?)\n\ncpdef _MutableFst compose(_Fst ifst1, _Fst ifst2, compose_filter=?,\n                          bool connect=?)\n\ncpdef _Fst convert(_Fst ifst, fst_type=?)\n\ncpdef _MutableFst determinize(_Fst ifst, float delta=?, det_type=?,\n                              int64 nstate=?, int64 subsequential_label=?,\n                              weight=?, bool increment_subsequential_label=?)\n\ncpdef _MutableFst difference(_Fst ifst1, _Fst ifst2, compose_filter=?,\n                             bool connect=?)\n\ncpdef _MutableFst disambiguate(_Fst ifst, float delta=?, int64 nstate=?,\n                               int64 subsequential_label=?, weight=?)\n\ncpdef _MutableFst epsnormalize(_Fst ifst, bool eps_norm_output=?)\n\ncpdef bool equal(_Fst ifst1, _Fst ifst2, float delta=?)\n\ncpdef bool equivalent(_Fst ifst1, _Fst ifst2, float delta=?) except *\n\ncpdef _MutableFst intersect(_Fst ifst1, _Fst ifst2, compose_filter=?,\n                            bool connect=?)\n\ncpdef bool isomorphic(_Fst ifst1, _Fst ifst2, float delta=?)\n\ncpdef _MutableFst prune(_Fst ifst, float delta=?, int64 nstate=?,\n                        weight=?)\n\ncpdef _MutableFst push(_Fst ifst, float delta=?, bool push_weights=?,\n                       bool push_labels=?, bool remove_common_affix=?,\n                       bool remove_total_weight=?, bool to_final=?)\n\ncpdef bool randequivalent(_Fst ifst1, _Fst ifst2, int32 npath=?,\n                          float delta=?, time_t seed=?, select=?,\n                          int32 max_length=?) except *\n\ncpdef _MutableFst randgen(_Fst ifst, int32 npath=?, time_t seed=?,\n                          select=?, int32 max_length=?,\n                          bool remove_total_weight=?, bool weighted=?)\n\ncdef fst.ReplaceLabelType _get_replace_label_type(string rlt,\n    bool epsilon_on_replace) except *\n\ncpdef _MutableFst replace(pairs, call_arc_labeling=?, return_arc_labeling=?,\n                          bool epsilon_on_replace=?, int64 return_label=?)\n\ncpdef _MutableFst reverse(_Fst ifst, bool require_superinitial=?)\n\ncdef vector[fst.WeightClass] *_shortestdistance(_Fst ifst, float delta=?,\n                                                int64 nstate=?, queue_type=?,\n                                                bool reverse=?) except *\n\ncpdef _MutableFst shortestpath(_Fst ifst, float delta=?, int32 nshortest=?,\n                               int64 nstate=?, queue_type=?, bool unique=?,\n                               weight=?)\n\ncpdef _Fst statemap(_Fst ifst, map_type)\n\ncpdef _MutableFst synchronize(_Fst ifst)\n\n\n# Compiler.\n\n\ncdef class Compiler(object):\n\n  cdef unique_ptr[stringstream] _sstrm\n  cdef string _fst_type\n  cdef string _arc_type\n  cdef const fst.SymbolTable *_isymbols\n  cdef const fst.SymbolTable *_osymbols\n  cdef const fst.SymbolTable *_ssymbols\n  cdef bool _acceptor\n  cdef bool _keep_isymbols\n  cdef bool _keep_osymbols\n  cdef bool _keep_state_numbering\n  cdef bool _allow_negative_labels\n\n  cpdef _Fst compile(self)\n\n  cpdef void write(self, expression)\n\n\n# FarReader.\n\ncdef class FarReader(object):\n\n  cdef unique_ptr[fst.FarReaderClass] _reader\n\n  cpdef string arc_type(self)\n\n  cpdef bool done(self)\n\n  cpdef bool error(self)\n\n  cpdef string far_type(self)\n\n  cpdef bool find(self, key) except *\n\n  cpdef _Fst get_fst(self)\n\n  cpdef string get_key(self)\n\n  cpdef void next(self)\n\n  cpdef void reset(self)\n\n\n# FarWriter.\n\ncdef class FarWriter(object):\n\n  cdef unique_ptr[fst.FarWriterClass] _writer\n\n  cpdef string arc_type(self)\n\n  cdef void close(self)\n\n  cpdef void add(self, key, _Fst ifst) except *\n\n  cpdef bool error(self)\n\n  cpdef string far_type(self)\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/extensions/python/pywrapfst.pyx",
    "content": "#cython: nonecheck=True\n# See www.openfst.org for extensive documentation on this weighted\n# finite-state transducer library.\n\n\n\"\"\"Python interface to the FST scripting API.\n\nOperations which construct new FSTs are implemented as traditional functions, as\nare two-argument boolean functions like `equal` and `equivalent`. Destructive\noperations---those that mutate an FST, in place---are instance methods, as is\n`write`. Operator overloading is not used. The following example, based on\nMohri et al. 2002, shows the construction of an ASR system given a pronunciation\nlexicon L, grammar G, a transducer from context-dependent phones to\ncontext-independent phones C, and an HMM set H:\n\n  L = fst.Fst.read(\"L.fst\")\n  G = fst.Fst.read(\"G.fst\")\n  C = fst.Fst.read(\"C.fst\")\n  H = fst.Fst.read(\"H.fst\")\n  LG = fst.determinize(fst.compose(L, G))\n  CLG = fst.determinize(fst.compose(C, LG))\n  HCLG = fst.determinize(fst.compose(H, CLG))\n  HCLG.minimize()                                      # NB: works in-place.\n\nPython variables here use snake_case and constants are in all caps, minus the\nnormal `k` prefix.\n\"\"\"\n\n# Overview of the file:\n#\n# * Imports\n# * Custom exceptions\n# * General helpers\n# * Weight and helpers\n# * _SymbolTable, _EncodeMapperSymbolTable, _FstSymbolTable,\n#   _MutableFstSymbolTable, SymbolTable, and helpers\n# * SymbolTableIterator\n# * EncodeMapper\n# * _Fst, _MutableFst, Fst, and helpers\n# * FST properties\n# * Arc, ArcIterator, and MutableArcIterator\n# * StateIterator\n# * FST operations\n# * Compiler\n# * FarReader and FarWriter\n# * Cleanup operations for module entrance and exit.\n#\n# TODO(kbg): Try breaking this apart into smaller pieces.\n#\n# A few of the more idiosyncratic choices made here are due to \"impedance\n# mismatches\" between C++ and Python, as follows.\n#\n# Another issue is that due to differences in C++ and Python scope rules, most\n# C++ class instances have to be heap-allocated. Since all are packed into\n# Python class instances, Python destructors are used to semi-automatically\n# free C++ instances. The one exception are the various `...Options` structs.\n# All that is included here are the constructors; there is no need to include\n# the names of the struct members. Cython does not draw any meaningful\n# distinction between structs and C++ classes, so these look just like class\n# definitions.\n#\n# Cython's type annotations (e.g., `string`) are used when the variables will\n# be sent as arguments to C++ functions, but are not used for variables used\n# within the module.\n#\n# Internal functions which may raise a Python error do not have a C++ return\n# type simply because this leads the C++ compiler to think that the resulting\n# value could be used before it is populated.\n\n\n## Imports.\n\n# C imports.\nfrom libc.stdint cimport INT32_MAX\nfrom libc.stdint cimport SIZE_MAX\nfrom posix.unistd cimport getpid\n\n# C++ imports.\nfrom libcpp cimport bool\nfrom libcpp.cast cimport const_cast\nfrom libcpp.cast cimport static_cast\n\n# Our C++ imports.\nfrom ios cimport ofstream\nfrom memory cimport static_pointer_cast\n\n# Cython operator workarounds.\nfrom cython.operator cimport address as addr       # &foo\nfrom cython.operator cimport dereference as deref  # *foo\nfrom cython.operator cimport preincrement as inc   # ++foo\n\n# Python imports.\nimport atexit\nimport numbers\nimport subprocess\nimport logging\n\n\n# TODO(kbg): Figure out how to access static class variables so I don't have\n# to do it this way.\nkNoSymbol = -1\n\n\n## Custom exceptions.\n\n\nclass FstError(Exception):\n\n  pass\n\n\nclass FstArgError(FstError, ValueError):\n\n  pass\n\n\nclass FstBadWeightError(FstError, ValueError):\n\n  pass\n\n\nclass FstDeletedConstructorError(FstError, RuntimeError):\n\n  pass\n\n\nclass FstIndexError(FstError, IndexError):\n\n  pass\n\n\nclass FstIOError(FstError, IOError):\n\n  pass\n\n\nclass FstOpError(FstError, RuntimeError):\n\n  pass\n\n\n## General helpers.\n\n\ncdef string tostring(data, encoding=\"utf8\") except *:\n  \"\"\"Converts strings to bytestrings.\n\n  This function converts Python bytestrings and Unicode strings to bytestrings\n  encoded in UTF-8. It is used to process most Python string arguments before\n  passing them to the lower-level library.\n\n  Args:\n    data: A Unicode string or bytestring.\n    encoding: The desired encoding, defaulting to UTF-8.\n\n  Returns:\n    A bytestring.\n\n  Raises:\n    FstArgError: Cannot encode string.\n    UnicodeEncodeError.\n\n  This function is not visible to Python users.\n  \"\"\"\n  # A Python bytestring can be implicitly cast to a C++ string.\n  if isinstance(data, bytes):\n    return data\n  elif isinstance(data, unicode):\n    return data.encode(encoding)\n  raise FstArgError(\"Cannot encode as string: {!r}\".format(data))\n\n\ncdef string weight_tostring(data, encoding=\"utf8\") except *:\n  \"\"\"Converts strings or numerics to bytestrings.\n\n  This function converts Python bytestrings, Unicode strings, and numerics\n  which can be cast to floats to bytestrings encoded in UTF-8. It is used to\n  process Python string arguments so they can be used to construct Weight\n  objects. In most cases, weights are underlyingly floating-point, but since\n  not all weights are, they can only be constructed using a string.\n\n  Args:\n    data: A Unicode string, bytestring, or type which can be converted to a\n      Python float.\n\n  Returns:\n    A bytestring.\n\n  Raise:\n    FstArgError: Cannot encode string.\n    ValueError: Invalid literal for float.\n    UnicodeEncodeError.\n\n  This function is not visible to Python users.\n  \"\"\"\n  # A Python bytestring can be implicitly cast to a C++ string.\n  if isinstance(data, bytes):\n    return data\n  elif isinstance(data, unicode):\n    return data.encode(encoding)\n  elif isinstance(data, numbers.Number):\n    return str(data).encode(encoding)\n  raise FstArgError(\"Cannot encode as string: {!r}\".format(data))\n\n\ncdef fst.ComposeFilter _get_compose_filter(\n    const string &compose_filter) except *:\n  \"\"\"Matches string with the appropriate ComposeFilter enum value.\n\n  This function takes a string argument and returns the matching ComposeFilter\n  enum value used to initialize ComposeOptions instances. ComposeOptions is used\n  by difference and intersection in addition to composition.\n\n  Args:\n    compose_filter: A string matching a known composition filter; one of:\n        \"alt_sequence\", \"auto\", \"match\", \"null\", \"sequence\", \"trivial\".\n\n  Returns:\n    A ComposeFilter enum value.\n\n  Raises:\n    FstArgError: Unknown compose filter type.\n\n  This function is not visible to Python users.\n  \"\"\"\n  cdef fst.ComposeFilter compose_filter_enum\n  if not fst.GetComposeFilter(compose_filter, addr(compose_filter_enum)):\n    raise FstArgError(\"Unknown compose filter type: {!r}\".format(\n        compose_filter))\n  return compose_filter_enum\n\n\ncdef fst.DeterminizeType _get_determinize_type(const string &det_type) except *:\n  \"\"\"Matches string with the appropriate DeterminizeType enum value.\n\n  Args:\n    det_type: A string matching a known determinization type; one of:\n        \"functional\", \"nonfunctional\", \"disambiguate\".\n\n  Returns:\n    A DeterminizeType enum value.\n\n  Raises:\n    FstArgError: Unknown determinization type.\n\n  This function is not visible to Python users.\n  \"\"\"\n  cdef fst.DeterminizeType det_type_enum\n  if not fst.GetDeterminizeType(det_type, addr(det_type_enum)):\n    raise FstArgError(\"Unknown determinization type: {!r}\".format(det_type))\n  return det_type_enum\n\n\ncdef fst.QueueType _get_queue_type(const string &queue_type) except *:\n  \"\"\"Matches string with the appropriate QueueType enum value.\n\n  This function takes a string argument and returns the matching QueueType enum\n  value passed to the RmEpsilonOptions constructor.\n\n  Args:\n    queue_type: A string matching a known queue type; one of: \"auto\", \"fifo\",\n        \"lifo\", \"shortest\", \"state\", \"top\".\n\n  Returns:\n    A QueueType enum value.\n\n  Raises:\n    FstArgError: Unknown queue type.\n\n  This function is not visible to Python users.\n  \"\"\"\n  cdef fst.QueueType queue_type_enum\n  if not fst.GetQueueType(queue_type, addr(queue_type_enum)):\n    raise FstArgError(\"Unknown queue type: {!r}\".format(queue_type))\n  return queue_type_enum\n\n\ncdef fst.RandArcSelection _get_rand_arc_selection(\n    const string &select) except *:\n  \"\"\"Matches string with the appropriate RandArcSelection enum value.\n\n  This function takes a string argument and returns the matching\n  RandArcSelection enum value passed to the RandGenOptions constructor.\n\n  Args:\n    select: A string matching a known random arc selection type; one of:\n        \"uniform\", \"log_prob\", \"fast_log_prob\".\n\n  Returns:\n    A RandArcSelection enum value.\n\n  Raises:\n    FstArgError: Unknown random arc selection type.\n\n  This function is not visible to Python users.\n  \"\"\"\n  cdef fst.RandArcSelection select_enum\n  if not fst.GetRandArcSelection(select, addr(select_enum)):\n    raise FstArgError(\"Unknown random arc selection type: {!r}\".format(select))\n  return select_enum\n\n\ncdef fst.ReplaceLabelType _get_replace_label_type(\n    const string &replace_label_type, bool epsilon_on_replace) except *:\n  \"\"\"Matches string with the appropriate ReplaceLabelType enum value.\n\n  This function takes a string argument and returns the matching\n  ReplaceLabelType enum value passed to the ReplaceOptions constructor.\n\n  Args:\n    replace_label_type: A string matching a known replace label type; one of:\n        \"neither\", \"input\", \"output\", \"both\".\n    epsilon_on_replace: Should call/return arcs be epsilon arcs?\n\n  Returns:\n    A ReplaceLabelType enum value.\n\n  Raises:\n    FstArgError: Unknown replace label type.\n\n  This function is not visible to Python users.\n  \"\"\"\n  cdef fst.ReplaceLabelType replace_label_type_enum\n  if not fst.GetReplaceLabelType(replace_label_type, epsilon_on_replace,\n                                 addr(replace_label_type_enum)):\n    raise FstArgError(\"Unknown replace label type: {!r}\".format(\n                      replace_label_type))\n  return replace_label_type_enum\n\n\n## Weight and helpers.\n\n\ncdef class Weight(object):\n\n  \"\"\"\n  Weight(weight_type, weight_string)\n\n  FST weight class.\n\n  This class represents an FST weight. When passed as an argument to an FST\n  operation, it should have the weight type of the input FST(s) to said\n  operation.\n\n  Args:\n    weight_type: A string indicating the weight type.\n    weight_string: A string indicating the underlying weight.\n\n  Raises:\n    FstArgError: Weight type not found.\n    FstBadWeightError: Invalid weight.\n  \"\"\"\n\n  def __repr__(self):\n    return \"<{} Weight {} at 0x{:x}>\".format(self.type(), self.to_string(),\n                                             id(self))\n\n  def __str__(self):\n    return self.to_string()\n\n  # This attempts to convert the string form into a float, raising\n  # ValueError when that is not appropriate.\n\n  def __float__(self):\n    return float(self.to_string())\n\n  def __init__(self, weight_type, weight):\n    self._weight.reset(new fst.WeightClass(tostring(weight_type),\n                                           weight_tostring(weight)))\n    self._check_weight()\n\n  cdef void _check_weight(self) except *:\n    if self.type() == b\"none\":\n      raise FstArgError(\"Weight type not found\")\n    if self.to_string() == b\"BadNumber\":\n      raise FstBadWeightError(\"Invalid weight\")\n\n  cpdef Weight copy(self):\n    \"\"\"\n    copy(self)\n\n    Returns a copy of the Weight.\n    \"\"\"\n    cdef Weight result = Weight.__new__(Weight)\n    result._weight.reset(new fst.WeightClass(deref(self._weight)))\n    return result\n\n  # To get around the inability to declare cdef class methods, we define the\n  # C++ part out-of-class and then call it from within.\n\n  @classmethod\n  def Zero(cls, weight_type):\n    \"\"\"\n    Weight.Zero(weight_type)\n\n    Constructs semiring zero.\n    \"\"\"\n    return _Zero(weight_type)\n\n  @classmethod\n  def One(cls, weight_type):\n    \"\"\"\n    Weight.One(weight_type)\n\n    Constructs semiring One.\n    \"\"\"\n    return _One(weight_type)\n\n  @classmethod\n  def NoWeight(cls, weight_type):\n    \"\"\"\n    Weight.NoWeight(weight_type)\n\n    Constructs a non-member weight in the semiring.\n    \"\"\"\n    return _NoWeight(weight_type)\n\n  def __eq__(Weight w1, Weight w2):\n    return fst.Eq(deref(w1._weight), deref(w2._weight))\n\n  def __ne__(Weight w1, Weight w2):\n    return not w1 == w2\n\n  cpdef string to_string(self):\n    return self._weight.get().ToString()\n\n  cpdef string type(self):\n    \"\"\"type(self)\n\n    Returns a string indicating the weight type.\n    \"\"\"\n    return self._weight.get().Type()\n\n\ncdef Weight _plus(Weight lhs, Weight rhs):\n  cdef Weight result = Weight.__new__(Weight)\n  result._weight.reset(new fst.WeightClass(fst.Plus(deref(lhs._weight),\n                                                    deref(rhs._weight))))\n  return result\n\n\ndef plus(Weight lhs, Weight rhs):\n  \"\"\"\n  plus(lhs, rhs)\n\n  Computes the sum of two Weights in the same semiring.\n\n  This function computes lhs \\oplus rhs, raising an exception if lhs and rhs\n  are not in the same semiring.\n\n  Args:\n     lhs: Left-hand side Weight.\n     rhs: Right-hand side Weight.\n\n  Returns:\n    A Weight object.\n\n  Raises:\n    FstArgError: Weight type not found (or not in same semiring).\n    FstBadWeightError: invalid weight.\n  \"\"\"\n  cdef Weight result = _plus(lhs, rhs)\n  result._check_weight()\n  return result\n\n\ncdef Weight _times(Weight lhs, Weight rhs):\n  cdef Weight result = Weight.__new__(Weight)\n  result._weight.reset(new fst.WeightClass(fst.Times(deref(lhs._weight),\n                                                     deref(rhs._weight))))\n  return result\n\n\ndef times(Weight lhs, Weight rhs):\n  \"\"\"\n  times(lhs, rhs)\n\n  Computes the product of two Weights in the same semiring.\n\n  This function computes lhs \\otimes rhs, raising an exception if lhs and rhs\n  are not in the same semiring.\n\n  Args:\n     lhs: Left-hand side Weight.\n     rhs: Right-hand side Weight.\n\n  Returns:\n    A Weight object.\n\n  Raises:\n    FstArgError: Weight type not found (or not in same semiring).\n    FstBadWeightError: Invalid weight.\n  \"\"\"\n  cdef Weight result = _times(lhs, rhs)\n  result._check_weight()\n  return result\n\n\ncdef Weight _divide(Weight lhs, Weight rhs):\n  cdef Weight result = Weight.__new__(Weight)\n  result._weight.reset(new fst.WeightClass(fst.Divide(deref(lhs._weight),\n                                                      deref(rhs._weight))))\n  return result\n\n\ndef divide(Weight lhs, Weight rhs):\n  \"\"\"\n  divide(lhs, rhs)\n\n  Computes the quotient of two Weights in the same semiring.\n\n  This function computes lhs \\oslash rhs, raising an exception if lhs and rhs\n  are not in the same semiring. As there is no way to specify whether to use\n  left vs. right division, this assumes a commutative semiring in which these\n  are equivalent operations.\n\n  Args:\n     lhs: Left-hand side Weight.\n     rhs: Right-hand side Weight.\n\n  Returns:\n    A Weight object.\n\n  Raises:\n    FstArgError: Weight type not found (or not in same semiring).\n    FstBadWeightError: Invalid weight.\n  \"\"\"\n  cdef Weight result = _divide(lhs, rhs)\n  result._check_weight()\n  return result\n\n\ncdef Weight _power(Weight w, size_t n):\n  cdef Weight result = Weight.__new__(Weight)\n  result._weight.reset(new fst.WeightClass(fst.Power(deref(w._weight), n)))\n  return result\n\n\ndef power(Weight w, size_t n):\n  \"\"\"\n  power(lhs, rhs)\n\n  Computes the iterated product of a weight.\n\n  Args:\n     w: The weight.\n     n: The power.\n\n  Returns:\n    A Weight object.\n\n  Raises:\n    FstArgError: Weight type not found (or not in same semiring).\n    FstBadWeightError: Invalid weight.\n  \"\"\"\n  cdef Weight result = _power(w, n)\n  result._check_weight()\n  return result\n\n\ncdef fst.WeightClass _get_WeightClass_or_Zero(const string &weight_type,\n                                              weight) except *:\n  \"\"\"Converts weight string to a WeightClass.\n\n  This function constructs a WeightClass instance of the desired weight type.\n  If the first argument is null, the weight is set to semiring Zero.\n\n  Args:\n    weight_type: A string denoting the desired weight type.\n    weight: A object indicating the desired weight; if omitted, the weight is\n        set to semiring Zero.\n\n  Returns:\n    A WeightClass object.\n\n  This function is not visible to Python users.\n  \"\"\"\n  cdef fst.WeightClass result\n  if weight is None:\n    result = fst.WeightClass.Zero(weight_type)\n  elif isinstance(weight, Weight):\n    result = deref(<fst.WeightClass *> (<Weight> weight)._weight.get())\n  else:\n    result = fst.WeightClass(weight_type, weight_tostring(weight))\n    if result.ToString() == b\"BadNumber\":\n      raise FstBadWeightError(weight_tostring(weight))\n  return result\n\n\ncdef fst.WeightClass _get_WeightClass_or_One(const string &weight_type,\n                                             weight) except *:\n  \"\"\"Converts weight string to a WeightClass.\n\n  This function constructs a WeightClass instance of the desired weight type.\n  If the first argument is null, the weight is set to semiring One.\n\n  Args:\n    weight_type: A string denoting the desired weight type.\n    weight: A object indicating the desired weight; if omitted, the weight is\n        set to semiring One.\n\n  Returns:\n    A WeightClass object.\n\n  This function is not visible to Python users.\n  \"\"\"\n  cdef fst.WeightClass result\n  if weight is None:\n    result = fst.WeightClass.One(weight_type)\n  elif isinstance(weight, Weight):\n    result = deref(<fst.WeightClass *> (<Weight> weight)._weight.get())\n  else:\n    result = fst.WeightClass(weight_type, weight_tostring(weight))\n    if result.ToString() == b\"BadNumber\":\n      raise FstBadWeightError(weight_tostring(weight))\n  return result\n\n\ncdef Weight _Zero(weight_type):\n  cdef Weight result = Weight.__new__(Weight)\n  result._weight.reset(new fst.WeightClass(fst.WeightClass.Zero(\n      tostring(weight_type))))\n  if result._weight.get().Type() == b\"none\":\n    raise FstArgError(\"Weight type not found\")\n  return result\n\n\ncdef Weight _One(weight_type):\n  cdef Weight result = Weight.__new__(Weight)\n  result._weight.reset(new fst.WeightClass(\n        fst.WeightClass.One(tostring(weight_type))))\n  if result._weight.get().Type() == b\"none\":\n    raise FstArgError(\"Weight type not found\")\n  return result\n\n\ncdef Weight _NoWeight(weight_type):\n  cdef Weight result = Weight.__new__(Weight)\n  result._weight.reset(new fst.WeightClass(\n        fst.WeightClass.NoWeight(tostring(weight_type))))\n  return result\n\n\n## _SymbolTable, _MutableSymbolTable, _EncodeMapperSymbolTable, _FstSymbolTable,\n##  _MutableFstSymbolTable, SymbolTable, and helpers.\n#\n# SymbolTable hierarchy:\n#\n# _SymbolTable: abstract base class; has-a SymbolTable*\n# _EncodeMapperSymbolTable(_SymbolTable): constant symbol table returned by\n#     EncodeMapper.input_symbols/output_symbols\n# _FstSymbolTable(_SymbolTable): constant symbol table returned by\n#     _Fst.input_symbols/output_symbols\n#\n# _MutableSymbolTable(_SymbolTable): abstract base class adding mutation methods\n# _MutableFstSymbolTable(_MutableSymbolTable): mutable symbol table returned by\n#     _MutableFst.mutable_input_symbols/mutable_output_symbols\n# SymbolTable(_MutableSymbolTable): adds constructor\n\n\ncdef class _SymbolTable(object):\n\n  \"\"\"\n  (No constructor.)\n\n  Base class for the symbol table hierarchy.\n\n  This class is the base class for SymbolTable. It has a \"deleted\" constructor\n  and implementations for the const methods of the wrapped SymbolTable.\n  \"\"\"\n\n  # NB: Do not expose any non-const methods of the wrapped SymbolTable here.\n  # Doing so will allow undefined behavior.\n\n  def __init__(self):\n    raise FstDeletedConstructorError(\n        \"Cannot construct {}\".format(self.__class__.__name__))\n\n  def __iter__(self):\n    return SymbolTableIterator(self)\n\n  cpdef int64 available_key(self):\n    \"\"\"\n    available_key(self)\n\n    Returns an integer indicating the next available key index in the table.\n    \"\"\"\n    return self._table.AvailableKey()\n\n  cpdef string checksum(self):\n    \"\"\"\n    checksum(self)\n\n    Returns a string indicating the label-agnostic MD5 checksum for the table.\n    \"\"\"\n    return self._table.CheckSum()\n\n  cpdef SymbolTable copy(self):\n    \"\"\"\n    copy(self)\n\n    Returns a mutable copy of the SymbolTable.\n    \"\"\"\n    return _init_SymbolTable(self._table.Copy())\n\n  def find(self, key):\n    \"\"\"\n    find(self, key)\n\n    Given a symbol or index, finds the other one.\n\n    This method returns the index associated with a symbol key, or the symbol\n    associated with a index key.\n\n    Args:\n      key: Either a string or an index.\n\n    Returns:\n      If the key is a string, the associated index or NO_LABEL if not found; if\n          the key is an integer, the associated symbol or an empty string if\n          not found.\n    \"\"\"\n    try:\n      return self._table.FindIndex(tostring(key))\n    except FstArgError:\n      return self._table.FindSymbol(key)\n\n  cpdef int64 get_nth_key(self, ssize_t pos) except *:\n    \"\"\"\n    get_nth_key(self, pos)\n\n    Retrieves the integer index of the n-th key in the table.\n\n    Args:\n      pos: The n-th key to retrieve.\n\n    Returns:\n      The integer index of the n-th key, or NO_LABEL if not found.\n    \"\"\"\n    return self._table.GetNthKey(pos)\n\n  cpdef string labeled_checksum(self):\n    \"\"\"\n    labeled_checksum(self)\n\n    Returns a string indicating the label-dependent MD5 checksum for the table.\n    \"\"\"\n    return self._table.LabeledCheckSum()\n\n  cpdef bool member(self, key):\n    \"\"\"\n    member(self, key)\n\n    Given a symbol or index, returns whether it is found in the table.\n\n    This method returns a boolean indicating whether the given symbol or index\n    is present in the table. If one intends to perform subsequent lookup, it is\n    better to simply call the find method, catching the KeyError.\n\n    Args:\n      key: Either a string or an index.\n\n    Returns:\n      Whether or not the key is present (as a string or a index) in the table.\n    \"\"\"\n    try:\n      return self._table.MemberSymbol(tostring(key))\n    except FstArgError:\n      return self._table.MemberIndex(key)\n\n  def __contains__(self, key):\n    return self.member(key)\n\n  cpdef string name(self):\n    \"\"\"\n    name(self)\n\n    Returns the symbol table's name.\n    \"\"\"\n    return self._table.Name()\n\n  cpdef size_t num_symbols(self):\n    \"\"\"\n    num_symbols(self)\n\n    Returns the number of symbols in the symbol table.\n    \"\"\"\n    return self._table.NumSymbols()\n\n  cpdef void write(self, filename) except *:\n    \"\"\"\n    write(self, filename)\n\n    Serializes symbol table to a file.\n\n    This methods writes the SymbolTable to a file in binary format.\n\n    Args:\n      filename: The string location of the output file.\n\n    Raises:\n      FstIOError: Write failed.\n    \"\"\"\n    if not self._table.Write(tostring(filename)):\n      raise FstIOError(\"Write failed: {!r}\".format(filename))\n\n  cpdef void write_text(self, filename) except *:\n    \"\"\"\n    write_text(self, filename)\n\n    Writes symbol table to text file.\n\n    This method writes the SymbolTable to a file in human-readable format.\n\n    Args:\n      filename: The string location of the output file.\n\n    Raises:\n      FstIOError: Write failed.\n    \"\"\"\n    if not self._table.WriteText(tostring(filename)):\n      raise FstIOError(\"Write failed: {!r}\".format(filename))\n\n\ncdef class _EncodeMapperSymbolTable(_SymbolTable):\n\n  \"\"\"\n  (No constructor.)\n\n  Immutable SymbolTable class for tables stored in an EncodeMapper.\n\n  This class wraps a library const SymbolTable and exposes const methods of the\n  wrapped object. It is only to be returned by method, never constructed\n  directly.\n  \"\"\"\n\n  # NB: Do not expose any non-const methods of the wrapped SymbolTable here.\n  # Doing so will allow undefined behavior.\n\n  def __repr__(self):\n    return \"<const EncodeMapper SymbolTable {!r} at 0x{:x}>\".format(self.name(),\n                                                                    id(self))\n\n\ncdef class _FstSymbolTable(_SymbolTable):\n\n  \"\"\"\n  (No constructor.)\n\n  Mutable SymbolTable class for tables stored in a mutable FST.\n\n  This class wraps a library SymbolTable and exposes methods of the wrapped\n  object. It is only to be returned by method, never constructed directly.\n  \"\"\"\n\n  # NB: Do not expose any non-const methods of the wrapped SymbolTable here.\n  # Doing so will allow undefined behavior.\n\n  def __repr__(self):\n    return \"<const Fst SymbolTable {!r} at 0x{:x}>\".format(self.name(),\n                                                           id(self))\n\n\ncdef class _MutableSymbolTable(_SymbolTable):\n\n  \"\"\"\n  (No constructor.)\n\n  Base class for mutable symbol tables.\n\n  This class is the base class for a mutable SymbolTable. It has a \"deleted\"\n  constructor and implementations of all methods of the wrapped SymbolTable.\n  \"\"\"\n\n  cpdef int64 add_symbol(self, symbol, int64 key=kNoSymbol):\n    \"\"\"\n    add_symbol(self, symbol, key=NO_SYMBOL)\n\n    Adds a symbol to the table and returns the index.\n\n    This method adds a symbol to the table. The caller can optionally\n    specify a non-negative integer index for the key.\n\n    Args:\n      symbol: A symbol string.\n      key: An index for the symbol; if not specified, the next index will be\n          used.\n\n    Returns:\n      The integer key of the new symbol.\n    \"\"\"\n    cdef string symbol_string = tostring(symbol)\n    if key != kNoSymbol:\n      return self._table.AddSymbol(symbol_string, key)\n    else:\n      return self._table.AddSymbol(symbol_string)\n\n  cpdef void add_table(self, _SymbolTable syms):\n    \"\"\"\n    add_table(self, syms)\n\n    Adds another SymbolTable to this table.\n\n    This method merges another symbol table into the current table. All key\n    values will be offset by the current available key.\n\n    Args:\n      syms: A SymbolTable to be merged with the current table.\n    \"\"\"\n    self._table.AddTable(deref(syms._table))\n\n  cpdef void set_name(self, new_name) except *:\n    self._table.SetName(tostring(new_name))\n\n\ncdef class _MutableFstSymbolTable(_MutableSymbolTable):\n  \"\"\"\n  (No constructor.)\n\n  Mutable SymbolTable assigned to an FST.\n  \"\"\"\n\n  def __repr__(self):\n    return \"<Fst SymbolTable {!r} at 0x{:x}>\".format(self.name(), id(self))\n\n\ncdef class SymbolTable(_MutableSymbolTable):\n\n  \"\"\"\n  SymbolTable(name=\"<unspecified>\")\n\n  Mutable SymbolTable class.\n\n  This class wraps the library SymbolTable and exposes both const (i.e.,\n  access) and non-const (i.e., mutation) methods of wrapped object.\n\n  Unlike other classes in the hierarchy, it has a working constructor and can be\n  used to programmatically construct a SymbolTable in memory.\n\n  Args:\n    name: An optional string indicating the table's name.\n  \"\"\"\n\n  def __repr__(self):\n    return \"<SymbolTable {!r} at 0x{:x}>\".format(self.name(), id(self))\n\n  def __init__(self, name=b\"<unspecified>\"):\n    self._table = new fst.SymbolTable(tostring(name))\n    self._smart_table.reset(self._table)\n\n  @classmethod\n  def read(cls, filename):\n    \"\"\"\n    SymbolTable.read(filename)\n\n    Reads symbol table from binary file.\n\n    This class method creates a new SymbolTable from a symbol table binary file.\n\n    Args:\n      filename: The string location of the input binary file.\n\n    Returns:\n      A new SymbolTable instance.\n\n    See also: `SymbolTable.read_fst`, `SymbolTable.read_text`.\n    \"\"\"\n    cdef fst.SymbolTable *tsyms = fst.SymbolTable.Read(tostring(filename))\n    if tsyms == NULL:\n      raise FstIOError(\"Read failed: {!r}\".format(filename))\n    return _init_SymbolTable(tsyms)\n\n  @classmethod\n  def read_text(cls, filename, bool allow_negative_labels=False):\n    \"\"\"\n    SymbolTable.read_text(filename)\n\n    Reads symbol table from text file.\n\n    This class method creates a new SymbolTable from a symbol table text file.\n\n    Args:\n      filename: The string location of the input text file.\n      allow_negative_labels: Should negative labels be allowed? (Not\n          recommended; may cause conflicts).\n\n    Returns:\n      A new SymbolTable instance.\n\n    See also: `SymbolTable.read`, `SymbolTable.read_fst`.\n    \"\"\"\n    cdef unique_ptr[fst.SymbolTableTextOptions] opts\n    opts.reset(new fst.SymbolTableTextOptions(allow_negative_labels))\n    cdef fst.SymbolTable *tsyms = fst.SymbolTable.ReadText(tostring(filename),\n                                                           deref(opts))\n    if tsyms == NULL:\n      raise FstIOError(\"Read failed: {!r}\".format(filename))\n    return _init_SymbolTable(tsyms)\n\n  @classmethod\n  def read_fst(cls, filename, bool input_table):\n    \"\"\"\n    SymbolTable.read_fst(filename, input_table)\n\n    Reads symbol table from an FST file without loading the corresponding FST.\n\n    This class method creates a new SymbolTable by reading either the input or\n    output symbol table from an FST file, without loading the corresponding FST.\n\n    Args:\n      filename: The string location of the input FST file.\n      input_table: Should the input table be read (True) or the output table\n          (False)?\n\n    Returns:\n      A new SymbolTable instance, or None if none can be read.\n\n    Raises:\n      FstIOError: Read failed.\n\n    See also: `SymbolTable.read`, `SymbolTable.read_text`.\n    \"\"\"\n    cdef fst.SymbolTable *tsyms = fst.FstReadSymbols(filename, input_table)\n    if tsyms == NULL:\n      raise FstIOError(\"Read failed: {!r}\".format(filename))\n    return _init_SymbolTable(tsyms)\n\n\ncdef _EncodeMapperSymbolTable _init_EncodeMapperSymbolTable(\n    fst.SymbolTable *table, shared_ptr[fst.EncodeMapperClass] encoder):\n  cdef _EncodeMapperSymbolTable result = (\n      _EncodeMapperSymbolTable.__new__(_EncodeMapperSymbolTable))\n  result._table = table\n  result._encoder = encoder\n  return result\n\n\ncdef _FstSymbolTable _init_FstSymbolTable(fst.SymbolTable *table,\n                                          shared_ptr[fst.FstClass] ifst):\n  cdef _FstSymbolTable result = _FstSymbolTable.__new__(_FstSymbolTable)\n  result._table = table\n  result._fst = ifst\n  return result\n\n\ncdef _MutableFstSymbolTable _init_MutableFstSymbolTable(fst.SymbolTable *table,\n    shared_ptr[fst.MutableFstClass] ifst):\n  cdef _MutableFstSymbolTable result = (\n      _MutableFstSymbolTable.__new__(_MutableFstSymbolTable))\n  result._table = table\n  result._mfst = ifst\n  return result\n\n\ncdef SymbolTable _init_SymbolTable(fst.SymbolTable *table):\n  cdef SymbolTable result = SymbolTable.__new__(SymbolTable)\n  result._table = table\n  return result\n\n\n# Constructive SymbolTable operations.\n\n\ncpdef SymbolTable compact_symbol_table(_SymbolTable syms):\n  \"\"\"\n  compact_symbol_table(syms)\n\n  Constructively relabels a SymbolTable to make it a contiguous mapping.\n\n  Args:\n    syms: Input SymbolTable.\n\n  Returns:\n    A new compacted SymbolTable.\n  \"\"\"\n  return _init_SymbolTable(fst.CompactSymbolTable(deref(syms._table)))\n\n\ncpdef SymbolTable merge_symbol_table(_SymbolTable lhs, _SymbolTable rhs):\n  \"\"\"\n  merge_symbol_table(lhs, rhs)\n\n  Merges all symbols from the left table into the right.\n\n  This function creates a new SymbolTable which is the merger of the two input\n  symbol Tables. Symbols in the right-hand table that conflict with those in the\n  left-hand table will be assigned values from the left-hand table. Thus the\n  returned table will never modify symbol assignments from the left-hand side,\n  but may do so on the right.\n\n  If the left-hand table is associated with an FST, it may be necessary to\n  relabel it using the output table.\n\n  Args:\n    lhs: Left-hand side SymbolTable.\n    rhs: Left-hand side SymbolTable.\n\n  Returns:\n    A new merged SymbolTable.\n\n  See also: `relabel_symbols`.\n  \"\"\"\n  return _init_SymbolTable(fst.MergeSymbolTable(deref(lhs._table),\n                                                deref(rhs._table), NULL))\n\n\n## SymbolTableIterator.\n\n\ncdef class SymbolTableIterator(object):\n\n  \"\"\"\n  SymbolTableIterator(syms)\n\n  This class is used for iterating over a symbol table.\n  \"\"\"\n\n  def __repr__(self):\n    return \"<SymbolTableIterator at 0x{:x}>\".format(id(self))\n\n  def __init__(self, _SymbolTable syms):\n    self._siter.reset(new fst.SymbolTableIterator(deref(syms._table)))\n\n  # This just registers this class as a possible iterator.\n  def __iter__(self):\n    return self\n\n  # Magic method used to get a Pythonic API out of the C++ API.\n  def __next__(self):\n    if self.done():\n      raise StopIteration\n    cdef int64 value = self.value()\n    cdef string symbol = self.symbol()\n    self.next()\n    return (value, symbol)\n\n  cpdef bool done(self):\n    \"\"\"\n    done(self)\n\n    Indicates whether the iterator is exhausted or not.\n\n    Returns:\n      True if the iterator is exhausted, False otherwise.\n    \"\"\"\n    return self._siter.get().Done()\n\n  cpdef void next(self):\n    \"\"\"\n    next(self)\n\n    Advances the iterator.\n    \"\"\"\n    self._siter.get().Next()\n\n  cpdef void reset(self):\n    \"\"\"\n    reset(self)\n\n    Resets the iterator to the initial position.\n    \"\"\"\n    self._siter.get().Reset()\n\n  cpdef string symbol(self):\n    \"\"\"\n    symbol(self)\n\n    Returns the current symbol string.\n\n    This method returns the current symbol string at this point in the table.\n\n    Returns:\n      A symbol string.\n    \"\"\"\n    return self._siter.get().Symbol()\n\n  cpdef int64 value(self):\n    \"\"\"\n    value(self)\n\n    Returns the current integer index of the symbol.\n\n    Returns:\n      An integer index.\n    \"\"\"\n    return self._siter.get().Value()\n\n\n## EncodeMapper.\n\n\ncdef class EncodeMapper(object):\n\n  \"\"\"\n  EncodeMapper(arc_type=\"standard\", encode_labels=False, encode_weights=False)\n\n  Arc encoder class, wrapping EncodeMapperClass.\n\n  This class provides an object which can be used to encode or decode FST arcs.\n  This is most useful to convert an FST to an unweighted acceptor, on which\n  some FST operations are more efficient, and then decoding the FST afterwards.\n\n  To use an instance of this class to encode or decode a mutable FST, pass it\n  as the first argument to the FST instance methods `encode` and `decode`.\n\n  For implementational reasons, it is not currently possible to use an encoder\n  on disk to construct this class.\n\n  Args:\n    arc_type: A string indicating the arc type.\n    encode_labels: Should labels be encoded?\n    encode_weights: Should weights be encoded?\n  \"\"\"\n\n  def __repr__(self):\n    return \"<EncodeMapper at 0x{:x}>\".format(id(self))\n\n  def __init__(self,\n               arc_type=b\"standard\",\n               bool encode_labels=False,\n               bool encode_weights=False):\n    cdef uint32 flags = fst.GetEncodeFlags(encode_labels, encode_weights)\n    self._encoder.reset(new fst.EncodeMapperClass(tostring(arc_type), flags,\n                                                  fst.ENCODE))\n    if not self._encoder:\n      raise FstOpError(\"Unknown arc type: {!r}\".format(arc_type))\n\n  cpdef string arc_type(self):\n    \"\"\"\n    arc_type(self)\n\n    Returns a string indicating the arc type.\n    \"\"\"\n    return self._encoder.get().ArcType()\n\n  # Python's equivalent to operator().\n\n  def __call__(self, Arc arc):\n    \"\"\"\n    self(state, ilabel, olabel, weight, nextstate)\n\n    Uses the encoder to encode an arc.\n\n    Args:\n      ilabel: The integer index of the input label.\n      olabel: The integer index of the output label.\n      weight: A Weight or weight string indicating the desired final weight; if\n        null, it is set to semiring One.\n      nextstate: The integer index of the destination state.\n\n    Raises:\n      FstOpError: Incompatible or invalid weight.\n    \"\"\"\n    return _init_Arc(self._encoder.get().__call__(deref(arc._arc)))\n\n  cpdef uint32 flags(self):\n    \"\"\"\n    flags(self)\n\n    Returns the encoder's flags.\n    \"\"\"\n    return self._encoder.get().Flags()\n\n  cpdef _EncodeMapperSymbolTable input_symbols(self):\n    \"\"\"\n    input_symbols(self)\n\n    Returns the encoder's input symbol table, or None if none is present.\n    \"\"\"\n    cdef fst.SymbolTable *syms = const_cast[SymbolTable_ptr](\n        self._encoder.get().InputSymbols())\n    if syms == NULL:\n      return\n    return _init_EncodeMapperSymbolTable(syms, self._encoder)\n\n  cpdef _EncodeMapperSymbolTable output_symbols(self):\n    \"\"\"\n    output_symbols(self)\n\n    Returns the encoder's output symbol table, or None if none is present.\n    \"\"\"\n    cdef fst.SymbolTable *syms = const_cast[SymbolTable_ptr](\n        self._encoder.get().OutputSymbols())\n    if syms == NULL:\n      return\n    return _init_EncodeMapperSymbolTable(syms, self._encoder)\n\n  cpdef uint64 properties(self, uint64 mask):\n    \"\"\"\n    properties(self, mask)\n\n    Provides property bits.\n\n    This method provides user access to the properties of the encoder.\n\n    Args:\n      mask: The property mask to be compared to the encoder's properties.\n\n    Returns:\n      A 64-bit bitmask representing the requested properties.\n    \"\"\"\n    return self._encoder.get().Properties(mask)\n\n  cpdef void set_input_symbols(self, _SymbolTable syms) except *:\n    \"\"\"\n    set_input_symbols(self, syms)\n\n    Sets the encoder's input symbol table.\n\n    Args:\n      syms: A SymbolTable.\n\n    See also: `set_output_symbols`.\n    \"\"\"\n    self._encoder.get().SetInputSymbols(syms._table)\n\n  cpdef void set_output_symbols(self, _SymbolTable syms) except *:\n    \"\"\"\n    set_output_symbols(self, syms)\n\n    Sets the encoder's output symbol table.\n\n    Args:\n      syms: A SymbolTable.\n\n    See also: `set_input_symbols`.\n    \"\"\"\n    self._encoder.get().SetOutputSymbols(syms._table)\n\n  cpdef string weight_type(self):\n    \"\"\"\n    weight_type(self)\n\n    Returns a string indicating the weight type.\n    \"\"\"\n    return self._encoder.get().WeightType()\n\n\n## _Fst, _MutableFst, Fst, and helpers.\n#\n# Fst hierarchy:\n#\n# _Fst: base class; has-a FstClass*.\n# _MutableFst(_Fst): adds mutable methods.\n# Fst(filename): pseudo-constructor.\n\n\ncdef class _Fst(object):\n\n  \"\"\"\n  (No constructor.)\n\n  Immutable FST class, wrapping FstClass.\n\n  This class is the basic user-facing FST object. It does not itself support any\n  mutation operations.\n  \"\"\"\n\n  # IPython notebook magic to produce an SVG of the FST.\n  def _repr_svg_(self):\n    \"\"\"IPython notebook magic to produce an SVG of the FST using GraphViz.\n\n    This method produces an SVG of the internal graph. Users wishing to create\n    publication-quality graphs should instead use the method `draw`, which\n    exposes additional parameters.\n\n    Raises:\n      OSError: Cannot locate the `dot` executable.\n      subprocess.CalledProcessError: `dot` returned non-zero exit code.\n\n    See also: `draw`, `text`.\n    \"\"\"\n    # Throws OSError if the dot executable is not found.\n    proc = subprocess.Popen([\"dot\", \"-Tsvg\"], stdin=subprocess.PIPE,\n                            stdout=subprocess.PIPE, stderr=subprocess.PIPE)\n    cdef stringstream sstrm\n    fst.DrawFst(deref(self._fst), self._fst.get().InputSymbols(),\n                self._fst.get().OutputSymbols(), NULL,\n                self._fst.get().Properties(fst.kAcceptor, True) ==\n                fst.kAcceptor,\n                b\"\", 8.5, 11, True, False, 0.4, 0.25, 14, 5, b\"g\", False,\n                addr(sstrm), b\"_repr_svg\")\n    (sout, serr) = proc.communicate(sstrm.str())\n    if proc.returncode != 0:  # Just to be explicit.\n      raise subprocess.CalledProcessError(proc.returncode, self._DOT_TSVG)\n    return sout.decode(\"utf8\")\n\n  def __repr__(self):\n    return \"<{} Fst at 0x{:x}>\".format(self.fst_type(), id(self))\n\n  def __init__(self):\n    raise FstDeletedConstructorError(\n        \"Cannot construct {}\".format(self.__class__.__name__))\n\n  def __str__(self):\n    return self.text()\n\n  # Registers the class for pickling; must be repeated in any subclass which\n  # can't be derived by _init_XFst.\n\n  def __reduce__(self):\n    return (_read_from_string, (self.write_to_string(),))\n\n  cpdef string arc_type(self):\n    \"\"\"\n    arc_type(self)\n\n    Returns a string indicating the arc type.\n    \"\"\"\n    return self._fst.get().ArcType()\n\n  cpdef ArcIterator arcs(self, int64 state):\n    \"\"\"\n    arcs(self, state)\n\n    Returns an iterator over arcs leaving the specified state.\n\n    Args:\n      state: The source state ID.\n\n    Returns:\n      An ArcIterator.\n\n    See also: `mutable_arcs`, `states`.\n    \"\"\"\n    return ArcIterator(self, state)\n\n  cpdef _Fst copy(self):\n    \"\"\"\n    copy(self)\n\n    Makes a copy of the FST.\n    \"\"\"\n    return _init_XFst(new fst.FstClass(deref(self._fst)))\n\n  cpdef void draw(self,\n                  filename,\n                  _SymbolTable isymbols=None,\n                  _SymbolTable osymbols=None,\n                  SymbolTable ssymbols=None,\n                  bool acceptor=False,\n                  title=b\"\",\n                  double width=8.5,\n                  double height=11,\n                  bool portrait=False,\n                  bool vertical=False,\n                  double ranksep=0.4,\n                  double nodesep=0.25,\n                  int32 fontsize=14,\n                  int32 precision=5,\n                  float_format=b\"g\",\n                  bool show_weight_one=False):\n    \"\"\"\n    draw(self, filename, isymbols=None, osymbols=None, ssymbols=None,\n         acceptor=False, title=\"\", width=8.5, height=11, portrait=False,\n         vertical=False, ranksep=0.4, nodesep=0.25, fontsize=14,\n         precision=5, float_format=\"g\", show_weight_one=False):\n\n    Writes out the FST in Graphviz text format.\n\n    This method writes out the FST in the dot graph description language. The\n    graph can be rendered using the `dot` executable provided by Graphviz.\n\n    Args:\n      filename: The string location of the output dot/Graphviz file.\n      isymbols: An optional symbol table used to label input symbols.\n      osymbols: An optional symbol table used to label output symbols.\n      ssymbols: An optional symbol table used to label states.\n      acceptor: Should the figure be rendered in acceptor format if possible?\n      title: An optional string indicating the figure title.\n      width: The figure width, in inches.\n      height: The figure height, in inches.\n      portrait: Should the figure be rendered in portrait rather than\n          landscape?\n      vertical: Should the figure be rendered bottom-to-top rather than\n          left-to-right?\n      ranksep: The minimum separation separation between ranks, in inches.\n      nodesep: The minimum separation between nodes, in inches.\n      fontsize: Font size, in points.\n      precision: Numeric precision for floats, in number of chars.\n      float_format: One of: 'e', 'f' or 'g'.\n      show_weight_one: Should weights equivalent to semiring One be printed?\n\n    See also: `text`.\n    \"\"\"\n    cdef string filename_string = tostring(filename)\n    cdef unique_ptr[ofstream] ostrm\n    ostrm.reset(new ofstream(filename_string))\n    cdef fst.SymbolTable *ssymbols_ptr = NULL\n    if ssymbols is not None:\n      ssymbols_ptr = ssymbols._table\n    fst.DrawFst(deref(self._fst),\n        self._fst.get().InputSymbols() if isymbols is None\n        else isymbols._table,\n        self._fst.get().OutputSymbols() if osymbols is None\n        else osymbols._table,\n        ssymbols_ptr, acceptor, tostring(title), width, height, portrait,\n        vertical, ranksep, nodesep, fontsize, precision,\n        tostring(float_format), show_weight_one, ostrm.get(),\n        filename_string)\n\n  cpdef Weight final(self, int64 state):\n    \"\"\"\n    final(self, state)\n\n    Returns the final weight of a state.\n\n    Args:\n      state: The integer index of a state.\n\n    Returns:\n      The final Weight of that state.\n\n    Raises:\n      FstIndexError: State index out of range.\n    \"\"\"\n    cdef Weight weight = Weight.__new__(Weight)\n    weight._weight.reset(new fst.WeightClass(self._fst.get().Final(state)))\n    return weight\n\n  cpdef string fst_type(self):\n    \"\"\"\n    fst_type(self)\n\n    Returns a string indicating the FST type.\n    \"\"\"\n    return self._fst.get().FstType()\n\n  cpdef _FstSymbolTable input_symbols(self):\n    \"\"\"\n    input_symbols(self)\n\n    Returns the FST's input symbol table, or None if none is present.\n\n    See also: `input_symbols`.\n    \"\"\"\n    cdef fst.SymbolTable *syms = const_cast[SymbolTable_ptr](\n      self._fst.get().InputSymbols())\n    if syms == NULL:\n      return\n    return _init_FstSymbolTable(syms, self._fst)\n\n  cpdef size_t num_arcs(self, int64 state) except *:\n    \"\"\"\n    num_arcs(self, state)\n\n    Returns the number of arcs leaving a state.\n\n    Args:\n      state: The integer index of a state.\n\n    Returns:\n      The number of arcs leaving that state.\n\n    Raises:\n      FstIndexError: State index out of range.\n\n    See also: `num_states`.\n    \"\"\"\n    cdef size_t result = self._fst.get().NumArcs(state)\n    if result == SIZE_MAX:\n      raise FstIndexError(\"State index out of range\")\n    return result\n\n  cpdef size_t num_input_epsilons(self, int64 state) except *:\n    \"\"\"\n    num_input_epsilons(self, state)\n\n    Returns the number of arcs with epsilon input labels leaving a state.\n\n    Args:\n      state: The integer index of a state.\n\n    Returns:\n      The number of epsilon-input-labeled arcs leaving that state.\n\n    Raises:\n      FstIndexError: State index out of range.\n\n    See also: `num_output_epsilons`.\n    \"\"\"\n    cdef size_t result = self._fst.get().NumInputEpsilons(state)\n    if result == SIZE_MAX:\n      raise FstIndexError(\"State index out of range\")\n    return result\n\n  cpdef size_t num_output_epsilons(self, int64 state) except *:\n    \"\"\"\n    num_output_epsilons(self, state)\n\n    Returns the number of arcs with epsilon output labels leaving a state.\n\n    Args:\n      state: The integer index of a state.\n\n    Returns:\n      The number of epsilon-output-labeled arcs leaving that state.\n\n    Raises:\n      FstIndexError: State index out of range.\n\n    See also: `num_input_epsilons`.\n    \"\"\"\n    cdef size_t result = self._fst.get().NumOutputEpsilons(state)\n    if result == SIZE_MAX:\n      raise FstIndexError(\"State index out of range\")\n    return result\n\n  cpdef _FstSymbolTable output_symbols(self):\n    \"\"\"\n    output_symbols(self)\n\n    Returns the FST's output symbol table, or None if none is present.\n\n    See also: `input_symbols`.\n    \"\"\"\n    cdef fst.SymbolTable *syms = const_cast[SymbolTable_ptr](\n      self._fst.get().OutputSymbols())\n    if syms == NULL:\n      return\n    return _init_FstSymbolTable(syms, self._fst)\n\n  cpdef uint64 properties(self, uint64 mask, bool test):\n    \"\"\"\n    properties(self, mask, test)\n\n    Provides property bits.\n\n    This method provides user access to the properties attributes for the FST.\n    The resulting value is a long integer, but when it is cast to a boolean,\n    it represents whether or not the FST has the `mask` property.\n\n    Args:\n      mask: The property mask to be compared to the FST's properties.\n      test: Should any unknown values be computed before comparing against\n          the mask?\n\n    Returns:\n      A 64-bit bitmask representing the requested properties.\n    \"\"\"\n    return self._fst.get().Properties(mask, test)\n\n  cpdef int64 start(self):\n    \"\"\"\n    start(self)\n\n    Returns the start state.\n    \"\"\"\n    return self._fst.get().Start()\n\n  cpdef StateIterator states(self):\n    \"\"\"\n    states(self)\n\n    Returns an iterator over all states in the FST.\n\n    Returns:\n      A StateIterator object for the FST.\n\n    See also: `arcs`, `mutable_arcs`.\n    \"\"\"\n    return StateIterator(self)\n\n  cpdef string text(self, _SymbolTable isymbols=None,\n      _SymbolTable osymbols=None, _SymbolTable ssymbols=None,\n      bool acceptor=False, bool show_weight_one=False, missing_sym=b\"\"):\n    \"\"\"\n    text(self, isymbols=None, osymbols=None, ssymbols=None, acceptor=False,\n         show_weight_one=False, missing_sym=\"\")\n\n    Produces a human-readable string representation of the FST.\n\n    This method generates a human-readable string representation of the FST.\n    The caller may optionally specify SymbolTables used to label input labels,\n    output labels, or state labels, respectively.\n\n    Args:\n      isymbols: An optional symbol table used to label input symbols.\n      osymbols: An optional symbol table used to label output symbols.\n      ssymbols: An optional symbol table used to label states.\n      acceptor: Should the FST be rendered in acceptor format if possible?\n      show_weight_one: Should weights equivalent to semiring One be printed?\n      missing_symbol: The string to be printed when symbol table lookup fails.\n\n    Returns:\n      A formatted string representing the machine.\n    \"\"\"\n    # Prints FST to stringstream, then returns resulting string.\n    cdef fst.SymbolTable *ssymbols_ptr = NULL\n    if ssymbols is not None:\n      ssymbols_ptr = ssymbols._table\n    cdef stringstream sstrm\n    fst.PrintFst(deref(self._fst), sstrm, b\"<pywrapfst>\",\n        self._fst.get().InputSymbols() if isymbols is None\n        else isymbols._table,\n        self._fst.get().OutputSymbols() if osymbols is None\n        else osymbols._table,\n        ssymbols_ptr, acceptor, show_weight_one, tostring(missing_sym))\n    return sstrm.str()\n\n  cpdef bool verify(self):\n    \"\"\"\n    verify(self)\n\n    Verifies that an FST's contents are sane.\n\n    Returns:\n      True if the contents are sane, False otherwise.\n    \"\"\"\n    return fst.Verify(deref(self._fst))\n\n  cpdef string weight_type(self):\n    \"\"\"\n    weight_type(self)\n\n    Provides the FST's weight type.\n\n    Returns:\n      A string representing the weight type.\n    \"\"\"\n    return self._fst.get().WeightType()\n\n  cpdef void write(self, filename) except *:\n    \"\"\"\n    write(self, filename)\n\n    Serializes FST to a file.\n\n    This method writes the FST to a file in a binary format.\n\n    Args:\n      filename: The string location of the output file.\n\n    Raises:\n      FstIOError: Write failed.\n    \"\"\"\n    if not self._fst.get().Write(tostring(filename)):\n      raise FstIOError(\"Write failed: {!r}\".format(filename))\n\n  cpdef string write_to_string(self):\n    \"\"\"\n    write_to_string(self)\n\n    Serializes FST to a string.\n\n    Returns:\n      A string.\n\n    Raises:\n      FstIOError: Write to string failed.\n\n    See also: `read_from_string`.\n    \"\"\"\n    cdef stringstream sstrm\n    if not self._fst.get().Write(sstrm, \"write_to_string\"):\n      raise FstIOError(\"Write to string failed\")\n    return sstrm.str()\n\n\ncdef class _MutableFst(_Fst):\n\n  \"\"\"\n  (No constructor.)\n\n  Mutable FST class, wrapping MutableFstClass.\n\n  This class extends _Fst by adding mutation operations.\n  \"\"\"\n\n  cdef void _check_mutating_imethod(self) except *:\n    \"\"\"Checks whether an operation mutating the FST has produced an error.\n\n    This function is not visible to Python users.\n    \"\"\"\n    if self._fst.get().Properties(fst.kError, True) == fst.kError:\n      raise FstOpError(\"Operation failed\")\n\n  cdef void _add_arc(self, int64 state, Arc arc) except *:\n    if not self._fst.get().ValidStateId(state):\n      raise FstIndexError(\"State index out of range\")\n    if not self._mfst.get().AddArc(state, deref(arc._arc)):\n      raise FstOpError(\"Incompatible or invalid weight type\")\n    self._check_mutating_imethod()\n\n  def add_arc(self, int64 state, Arc arc):\n    \"\"\"\n    add_arc(self, state, arc)\n\n    Adds a new arc to the FST and return self.\n\n    Args:\n      state: The integer index of the source state.\n      arc: The arc to add.\n\n    Returns:\n      self.\n\n    Raises:\n      FstIndexError: State index out of range.\n      FstOpdexError: Incompatible or invalid weight type.\n\n    See also: `add_state`.\n    \"\"\"\n    self._add_arc(state, arc)\n    return self\n\n  cpdef int64 add_state(self) except *:\n    \"\"\"\n    add_state(self)\n\n    Adds a new state to the FST and returns the state ID.\n\n    Returns:\n      The integer index of the new state.\n\n    See also: `add_arc`, `set_start`, `set_final`.\n    \"\"\"\n    cdef int64 result = self._mfst.get().AddState()\n    self._check_mutating_imethod()\n    return result\n\n  cdef void _arcsort(self, sort_type=b\"ilabel\") except *:\n    cdef fst.ArcSortType sort_type_enum\n    if not fst.GetArcSortType(tostring(sort_type), addr(sort_type_enum)):\n      raise FstArgError(\"Unknown sort type {!r}\".format(sort_type))\n    fst.ArcSort(self._mfst.get(), sort_type_enum)\n    self._check_mutating_imethod()\n\n  def arcsort(self, sort_type=b\"ilabel\"):\n    \"\"\"\n    arcsort(self, sort_type=\"ilabel\")\n\n    Sorts arcs leaving each state of the FST.\n\n    This operation destructively sorts arcs leaving each state using either\n    input or output labels.\n\n    Args:\n      sort_type: Either \"ilabel\" (sort arcs according to input labels) or\n          \"olabel\" (sort arcs according to output labels).\n\n    Returns:\n      self.\n\n    Raises:\n      FstArgError: Unknown sort type.\n\n    See also: `topsort`.\n    \"\"\"\n    self._arcsort(sort_type)\n    return self\n\n  cdef void _closure(self, bool closure_plus=False) except *:\n    fst.Closure(self._mfst.get(), fst.GetClosureType(closure_plus))\n    self._check_mutating_imethod()\n\n  def closure(self, bool closure_plus=False):\n    \"\"\"\n    closure(self, closure_plus=False)\n\n    Computes concatenative closure.\n\n    This operation destructively converts the FST to its concatenative closure.\n    If A transduces string x to y with weight a, then the closure transduces x\n    to y with weight a, xx to yy with weight a \\otimes a, xxx to yyy with weight\n    a \\otimes a \\otimes a, and so on. The empty string is also transduced to\n    itself with semiring One if `closure_plus` is False.\n\n    Args:\n      closure_plus: If False, do not accept the empty string.\n\n    Returns:\n      self.\n    \"\"\"\n    self._closure(closure_plus)\n    return self\n\n  cdef void _concat(self, _Fst ifst) except *:\n    fst.Concat(self._mfst.get(), deref(ifst._fst))\n    self._check_mutating_imethod()\n\n  def concat(self, _Fst ifst):\n    \"\"\"\n    concat(self, ifst)\n\n    Computes the concatenation (product) of two FSTs.\n\n    This operation destructively concatenates the FST with a second FST. If A\n    transduces string x to y with weight a and B transduces string w to v with\n    weight b, then their concatenation transduces string xw to yv with weight a\n    \\otimes b.\n\n    Args:\n      ifst: The second input FST.\n\n    Returns:\n      self.\n    \"\"\"\n    self._concat(ifst)\n    return self\n\n  cdef void _connect(self) except *:\n    fst.Connect(self._mfst.get())\n    self._check_mutating_imethod()\n\n  def connect(self):\n    \"\"\"\n    connect(self)\n\n    Removes unsuccessful paths.\n\n    This operation destructively trims the FST, removing states and arcs that\n    are not part of any successful path.\n\n    Returns:\n      self.\n    \"\"\"\n    self._connect()\n    return self\n\n  cdef void _decode(self, EncodeMapper encoder) except *:\n    fst.Decode(self._mfst.get(), deref(encoder._encoder))\n    self._check_mutating_imethod()\n\n  def decode(self, EncodeMapper encoder):\n    \"\"\"\n    decode(self, encoder)\n\n    Decodes encoded labels and/or weights.\n\n    This operation reverses the encoding performed by `encode`.\n\n    Args:\n      encoder: An EncodeMapper object used to encode the FST.\n\n    Returns:\n      self.\n\n    See also: `encode`.\n    \"\"\"\n    self._decode(encoder)\n    return self\n\n  cdef void _delete_arcs(self, int64 state, size_t n=0) except *:\n    if not (self._mfst.get().DeleteArcs(state, n) if n else\n            self._mfst.get().DeleteArcs(state)):\n      raise FstIndexError(\"State index out of range\")\n    self._check_mutating_imethod()\n\n  def delete_arcs(self, int64 state, size_t n=0):\n    \"\"\"\n    delete_arcs(self, state, n=0)\n\n    Deletes arcs leaving a particular state.\n\n    Args:\n      state: The integer index of a state.\n      n: An optional argument indicating how many arcs to be deleted. If this\n          argument is omitted or passed as zero, all arcs from this state are\n          deleted.\n\n    Returns:\n      self.\n\n    Raises:\n      FstIndexError: State index out of range.\n\n    See also: `delete_states`.\n    \"\"\"\n    self._delete_arcs(state, n)\n    return self\n\n  cdef void _delete_states(self, states=None) except *:\n    # Only the former signature has a possible indexing failure.\n    if states:\n      if not self._mfst.get().DeleteStates(<const vector[int64]> states):\n        raise FstIndexError(\"State index out of range\")\n    else:\n      self._mfst.get().DeleteStates()\n    self._check_mutating_imethod()\n\n  def delete_states(self, states=None):\n    \"\"\"\n    delete_states(self, states=None)\n\n    Deletes states.\n\n    Args:\n      states: An optional iterable of integer indices of the states to be\n          deleted. If this argument is omitted, all states are deleted.\n\n    Returns:\n      self.\n\n    Raises:\n      FstIndexError: State index out of range.\n\n    See also: `delete_arcs`.\n    \"\"\"\n    self._delete_states(states)\n    return self\n\n  cdef void _encode(self, EncodeMapper encoder) except *:\n    fst.Encode(self._mfst.get(), encoder._encoder.get())\n    self._check_mutating_imethod()\n\n  def encode(self, EncodeMapper encoder):\n    \"\"\"\n    encode(self, encoder)\n\n    Encodes labels and/or weights.\n\n    This operation allows for the representation of a weighted transducer as a\n    weighted acceptor, an unweighted transducer, or an unweighted acceptor by\n    considering the pair (input label, output label), the pair (input label,\n    weight), or the triple (input label, output label, weight) as a single\n    label. Applying this operation mutates the EncodeMapper argument, which\n    can then be used to decode.\n\n    Args:\n      encoder: An EncodeMapper object to be used as the encoder.\n\n    Returns:\n      self.\n\n    See also: `decode`.\n    \"\"\"\n    self._encode(encoder)\n    return self\n\n  cdef void _invert(self) except *:\n    fst.Invert(self._mfst.get())\n    self._check_mutating_imethod()\n\n  def invert(self):\n    \"\"\"\n    invert(self)\n\n    Inverts the FST's transduction.\n\n    This operation destructively inverts the FST's transduction by exchanging\n    input and output labels.\n\n    Returns:\n      self.\n    \"\"\"\n    self._invert()\n    return self\n\n  cdef void _minimize(self, float delta=fst.kShortestDelta,\n                      bool allow_nondet=False) except *:\n    # This runs in-place when the second argument is null.\n    fst.Minimize(self._mfst.get(), NULL, delta, allow_nondet)\n    self._check_mutating_imethod()\n\n  def minimize(self, float delta=fst.kShortestDelta, bool allow_nondet=False):\n    \"\"\"\n    minimize(self, delta=1e-6, allow_nondet=False)\n\n    Minimizes the FST.\n\n    This operation destructively performs the minimization of deterministic\n    weighted automata and transducers. If the input FST A is an acceptor, this\n    operation produces the minimal acceptor B equivalent to A, i.e. the\n    acceptor with a minimal number of states that is equivalent to A. If the\n    input FST A is a transducer, this operation internally builds an equivalent\n    transducer with a minimal number of states. However, this minimality is\n    obtained by allowing transition having strings of symbols as output labels,\n    this known in the litterature as a real-time transducer. Such transducers\n    are not directly supported by the library. This function will convert such\n    transducer by expanding each string-labeled transition into a sequence of\n    transitions. This will results in the creation of new states, hence losing\n    the minimality property.\n\n    Args:\n      delta: Comparison/quantization delta.\n      allow_nondet: Attempt minimization of non-deterministic FST?\n\n    Returns:\n      self.\n    \"\"\"\n    self._minimize(delta, allow_nondet)\n    return self\n\n  cpdef MutableArcIterator mutable_arcs(self, int64 state):\n    \"\"\"\n    mutable_arcs(self, state)\n\n    Returns a mutable iterator over arcs leaving the specified state.\n\n    Args:\n      state: The source state ID.\n\n    Returns:\n      A MutableArcIterator.\n\n    See also: `arcs`, `states`.\n    \"\"\"\n    return MutableArcIterator(self, state)\n\n  def mutable_input_symbols(self):\n    \"\"\"\n    mutable_input_symbols(self)\n\n    Returns the FST's (mutable) input symbol table, or None if none is present.\n    \"\"\"\n    cdef fst.SymbolTable *tst = self._mfst.get().MutableInputSymbols()\n    if tst == NULL:\n      return\n    return _init_MutableFstSymbolTable(tst, self._mfst)\n\n  def mutable_output_symbols(self):\n    \"\"\"\n    mutable_output_symbols(self)\n\n    Returns the FST's (mutable) output symbol table, or None if none is present.\n    \"\"\"\n    cdef fst.SymbolTable *tst = self._mfst.get().MutableOutputSymbols()\n    if tst == NULL:\n      return\n    return _init_MutableFstSymbolTable(tst, self._mfst)\n\n  cpdef int64 num_states(self):\n    \"\"\"\n    num_states(self)\n\n    Returns the number of states.\n    \"\"\"\n    return self._mfst.get().NumStates()\n\n  cdef void _project(self, bool project_output=False) except *:\n    fst.Project(self._mfst.get(), fst.GetProjectType(project_output))\n    self._check_mutating_imethod()\n\n  def project(self, bool project_output=False):\n    \"\"\"\n    project(self, project_output=False)\n\n    Converts the FST to an acceptor using input or output labels.\n\n    This operation destructively projects an FST onto its domain or range by\n    either copying each arc's input label to its output label (the default) or\n    vice versa.\n\n    Args:\n      project_output: Should the output labels be projected?\n\n    Returns:\n      self.\n\n    See also: `decode`, `encode`, `relabel_pairs`, `relabel_symbols`.\n    \"\"\"\n    self._project(project_output)\n    return self\n\n  cdef void _prune(self, float delta=fst.kDelta, int64 nstate=fst.kNoStateId,\n                   weight=None) except *:\n    # Threshold is set to semiring Zero (no pruning) if no weight is specified.\n    cdef fst.WeightClass wc = _get_WeightClass_or_Zero(self.weight_type(),\n                                                       weight)\n    fst.Prune(self._mfst.get(), wc, nstate, delta)\n    self._check_mutating_imethod()\n\n  def prune(self,\n            float delta=fst.kDelta,\n            int64 nstate=fst.kNoStateId,\n            weight=None):\n    \"\"\"\n    prune(self, delta=0.0009765625, nstate=NO_STATE_ID, weight=None)\n\n    Removes paths with weights below a certain threshold.\n\n    This operation deletes states and arcs in the input FST that do not belong\n    to a successful path whose weight is no more (w.r.t the natural semiring\n    order) than the threshold t \\otimes-times the weight of the shortest path in\n    the input FST. Weights must be commutative and have the path property.\n\n    Args:\n      delta: Comparison/quantization delta.\n      nstate: State number threshold.\n      weight: A Weight or weight string indicating the desired weight threshold\n          below which paths are pruned; if omitted, no paths are pruned.\n\n    Returns:\n      self.\n\n    See also: The constructive variant.\n    \"\"\"\n    self._prune(delta, nstate, weight)\n    return self\n\n  cdef void _push(self,\n                  float delta=fst.kDelta,\n                  bool remove_total_weight=False,\n                  bool to_final=False) except *:\n    fst.Push(self._mfst.get(), fst.GetReweightType(to_final), delta,\n             remove_total_weight)\n    self._check_mutating_imethod()\n\n  def push(self,\n           float delta=fst.kDelta,\n           bool remove_total_weight=False,\n           bool to_final=False):\n    \"\"\"\n    push(self, delta=0.0009765625, remove_total_weight=False, to_final=False)\n\n    Pushes weights towards the initial or final states.\n\n    This operation destructively produces an equivalent transducer by pushing\n    the weights towards the initial state or toward the final states. When\n    pushing weights towards the initial state, the sum of the weight of the\n    outgoing transitions and final weight at any non-initial state is equal to\n    one in the resulting machine. When pushing weights towards the final states,\n    the sum of the weight of the incoming transitions at any state is equal to\n    one. Weights need to be left distributive when pushing towards the initial\n    state and right distributive when pushing towards the final states.\n\n    Args:\n      delta: Comparison/quantization delta.\n      remove_total_weight: If pushing weights, should the total weight be\n          removed?\n      to_final: Push towards final states?\n\n    Returns:\n      self.\n\n    See also: The constructive variant, which also supports label pushing.\n    \"\"\"\n    self._push(delta, remove_total_weight, to_final)\n    return self\n\n  cdef void _relabel_pairs(self, ipairs=None, opairs=None) except *:\n    cdef unique_ptr[vector[fst.LabelPair]] _ipairs\n    _ipairs.reset(new vector[fst.LabelPair]())\n    cdef unique_ptr[vector[fst.LabelPair]] _opairs\n    _opairs.reset(new vector[fst.LabelPair]())\n    cdef int64 before\n    cdef int64 after\n    if ipairs:\n      for (before, after) in ipairs:\n        _ipairs.get().push_back(fst.LabelPair(before, after))\n    if opairs:\n      for (before, after) in opairs:\n        _opairs.get().push_back(fst.LabelPair(before, after))\n    if _ipairs.get().empty() and _opairs.get().empty():\n      raise FstArgError(\"No relabeling pairs specified.\")\n    fst.Relabel(self._mfst.get(), deref(_ipairs), deref(_opairs))\n    self._check_mutating_imethod()\n\n  def relabel_pairs(self, ipairs=None, opairs=None):\n    \"\"\"\n    relabel_pairs(self, ipairs=None, opairs=None)\n\n    Replaces input and/or output labels using pairs of labels.\n\n    This operation destructively relabels the input and/or output labels of the\n    FST using pairs of the form (old_ID, new_ID); omitted indices are\n    identity-mapped.\n\n    Args:\n      ipairs: An iterable containing (older index, newer index) integer pairs.\n      opairs: An iterable containing (older index, newer index) integer pairs.\n\n    Returns:\n      self.\n\n    Raises:\n      FstArgError: No relabeling pairs specified.\n\n    See also: `decode`, `encode`, `project`, `relabel_tables`.\n    \"\"\"\n    self._relabel_pairs(ipairs, opairs)\n    return self\n\n  cdef void _relabel_tables(self,\n                            _SymbolTable old_isymbols=None,\n                            _SymbolTable new_isymbols=None,\n                            unknown_isymbol=b\"\",\n                            bool attach_new_isymbols=True,\n                            _SymbolTable old_osymbols=None,\n                            _SymbolTable new_osymbols=None,\n                            unknown_osymbol=b\"\",\n                            bool attach_new_osymbols=True) except *:\n    if new_isymbols is None and new_osymbols is None:\n      raise FstArgError(\"No new SymbolTables specified\")\n    cdef fst.SymbolTable *new_isymbols_ptr = NULL\n    if new_isymbols is not None:\n      new_isymbols_ptr = new_isymbols._table\n    cdef fst.SymbolTable *new_osymbols_ptr = NULL\n    if new_osymbols is not None:\n      new_osymbols_ptr = new_osymbols._table\n    fst.Relabel(self._mfst.get(),\n        self._fst.get().InputSymbols() if old_isymbols is None else\n        old_isymbols._table, new_isymbols_ptr, tostring(unknown_isymbol),\n        attach_new_isymbols,\n        self._fst.get().OutputSymbols() if old_osymbols is None else\n        old_osymbols._table, new_osymbols_ptr, tostring(unknown_osymbol),\n        attach_new_osymbols)\n    self._check_mutating_imethod()\n\n  def relabel_tables(self,\n                     _SymbolTable old_isymbols=None,\n                     _SymbolTable new_isymbols=None,\n                     unknown_isymbol=b\"\",\n                     bool attach_new_isymbols=True,\n                     _SymbolTable old_osymbols=None,\n                     _SymbolTable new_osymbols=None,\n                     unknown_osymbol=b\"\",\n                     bool attach_new_osymbols=True):\n    \"\"\"\n    relabel_tables(self, old_isymbols=None, new_isymbols=None,\n                   unknown_isymbol=\"\", attach_new_isymbols=True,\n                   old_osymbols=None, new_osymbols=None,\n                   unknown_osymbol=\"\", attach_new_osymbols=True)\n\n    Replaces input and/or output labels using SymbolTables.\n\n    This operation destructively relabels the input and/or output labels of the\n    FST using user-specified symbol tables; omitted symbols are identity-mapped.\n\n    Args:\n       old_isymbols: The old SymbolTable for input labels, defaulting to the\n          FST's input symbol table.\n       new_isymbols: A SymbolTable used to relabel the input labels\n       unknown_isymbol: Input symbol to use to relabel OOVs (if empty,\n          OOVs raise an exception)\n       attach_new_isymbols: Should new_isymbols be made the FST's input symbol\n          table?\n       old_osymbols: The old SymbolTable for output labels, defaulting to the\n          FST's output symbol table.\n       new_osymbols: A SymbolTable used to relabel the output labels.\n       unknown_osymbol: Outnput symbol to use to relabel OOVs (if empty,\n          OOVs raise an exception)\n       attach_new_isymbols: Should new_osymbols be made the FST's output symbol\n          table?\n\n    Returns:\n      self.\n\n    Raises:\n      FstArgError: No SymbolTable specified.\n\n    See also: `decode`, `encode`, `project`, `relabel_pairs`.\n    \"\"\"\n    self._relabel_tables(old_isymbols, new_isymbols,\n                         unknown_isymbol, attach_new_isymbols,\n                         old_osymbols, new_osymbols,\n                         unknown_osymbol, attach_new_osymbols)\n    return self\n\n  cdef void _reserve_arcs(self, int64 state, size_t n) except *:\n    if not self._mfst.get().ReserveArcs(state, n):\n      raise FstIndexError(\"State index out of range\")\n    self._check_mutating_imethod()\n\n  def reserve_arcs(self, int64 state, size_t n):\n    \"\"\"\n    reserve_arcs(self, state, n)\n\n    Reserve n arcs at a particular state (best effort).\n\n    Args:\n      state: The integer index of a state.\n      n: The number of arcs to reserve.\n\n    Returns:\n      self.\n\n    Raises:\n      FstIndexError: State index out of range.\n\n    See also: `reserve_states`.\n    \"\"\"\n    self._reserve_arcs(state, n)\n    return self\n\n  cdef void _reserve_states(self, int64 n) except *:\n    self._mfst.get().ReserveStates(n)\n    self._check_mutating_imethod()\n\n  def reserve_states(self, int64 n):\n    \"\"\"\n    reserve_states(self, n)\n\n    Reserve n states (best effort).\n\n    Args:\n      n: The number of states to reserve.\n\n    Returns:\n      self.\n\n    See also: `reserve_arcs`.\n    \"\"\"\n    self._reserve_states(n)\n    return self\n\n  cdef void _reweight(self, potentials, bool to_final=False) except *:\n    cdef unique_ptr[vector[fst.WeightClass]] _potentials\n    _potentials.reset(new vector[fst.WeightClass]())\n    cdef string weight_type = self.weight_type()\n    for weight in potentials:\n        _potentials.get().push_back(_get_WeightClass_or_One(self.weight_type(),\n                                                            weight))\n    fst.Reweight(self._mfst.get(), deref(_potentials),\n                 fst.GetReweightType(to_final))\n    self._check_mutating_imethod()\n\n  def reweight(self, potentials, bool to_final=False):\n    \"\"\"\n    reweight(self, potentials, to_final=False)\n\n    Reweights an FST using an iterable of potentials.\n\n    This operation destructively reweights an FST according to the potentials\n    and in the direction specified by the user. An arc of weight w, with an\n    origin state of potential p and destination state of potential q, is\n    reweighted by p^{-1} \\otimes (w \\otimes q) when reweighting towards the\n    initial state, and by (p \\otimes w) \\otimes q^{-1} when reweighting towards\n    the final states. The weights must be left distributive when reweighting\n    towards the initial state and right distributive when reweighting towards\n    the final states (e.g., TropicalWeight and LogWeight).\n\n    Args:\n      potentials: An iterable of Weight or weight strings.\n      to_final: Push towards final states?\n\n    Returns:\n      self.\n    \"\"\"\n    self._reweight(potentials, to_final)\n    return self\n\n  cdef void _rmepsilon(self,\n                       queue_type=b\"auto\",\n                       bool connect=True,\n                       weight=None,\n                       int64 nstate=fst.kNoStateId,\n                       float delta=fst.kShortestDelta) except *:\n    cdef fst.WeightClass wc = _get_WeightClass_or_Zero(self.weight_type(),\n                                                       weight)\n    cdef unique_ptr[fst.RmEpsilonOptions] opts\n    opts.reset(new fst.RmEpsilonOptions(_get_queue_type(tostring(queue_type)),\n                                        connect, wc, nstate, delta))\n    fst.RmEpsilon(self._mfst.get(), deref(opts))\n    self._check_mutating_imethod()\n\n  def rmepsilon(self,\n                queue_type=b\"auto\",\n                bool connect=True,\n                weight=None,\n                int64 nstate=fst.kNoStateId,\n                float delta=fst.kShortestDelta):\n    \"\"\"\n    rmepsilon(self, queue_type=\"auto\", connect=True, weight=None,\n              nstate=NO_STATE_ID, delta=1e-6):\n\n    Removes epsilon transitions.\n\n    This operation destructively removes epsilon transitions, i.e., those where\n    both input and output labels are epsilon) from an FST.\n\n    Args:\n      queue_type: A string matching a known queue type; one of: \"auto\", \"fifo\",\n          \"lifo\", \"shortest\", \"state\", \"top\".\n      connect: Should output be trimmed?\n      weight: A Weight or weight string indicating the desired weight threshold\n          below which paths are pruned; if omitted, no paths are pruned.\n      nstate: State number threshold.\n      delta: Comparison/quantization delta.\n\n    Returns:\n      self.\n    \"\"\"\n    self._rmepsilon(queue_type, connect, weight, nstate, delta)\n    return self\n\n  cdef void _set_final(self, int64 state, weight=None) except *:\n    if not self._mfst.get().ValidStateId(state):\n      raise FstIndexError(\"State index out of range\")\n    cdef fst.WeightClass wc = _get_WeightClass_or_One(self.weight_type(),\n                                                      weight)\n    if not self._mfst.get().SetFinal(state, wc):\n      raise FstOpError(\"Incompatible or invalid weight\")\n    self._check_mutating_imethod()\n\n  def set_final(self, int64 state, weight=None):\n    \"\"\"\n    set_final(self, state, weight)\n\n    Sets the final weight for a state.\n\n    Args:\n      state: The integer index of a state.\n      weight: A Weight or weight string indicating the desired final weight; if\n          omitted, it is set to semiring One.\n\n    Returns:\n      self.\n\n    Raises:\n      FstIndexError: State index out of range.\n      FstOpError: Incompatible or invalid weight.\n\n    See also: `set_start`.\n    \"\"\"\n    self._set_final(state, weight)\n    return self\n\n  cdef void _set_input_symbols(self, _SymbolTable syms) except *:\n    if syms is None:\n      self._mfst.get().SetInputSymbols(NULL)\n      return\n    self._mfst.get().SetInputSymbols(syms._table)\n    self._check_mutating_imethod()\n\n  def set_input_symbols(self, _SymbolTable syms):\n    \"\"\"\n    set_input_symbols(self, syms)\n\n    Sets the input symbol table.\n\n    Passing None as a value will delete the input symbol table.\n\n    Args:\n      syms: A SymbolTable.\n\n    Returns:\n      self.\n\n    See also: `set_output_symbols`.\n    \"\"\"\n    self._set_input_symbols(syms)\n    return self\n\n  cdef void _set_output_symbols(self, _SymbolTable syms) except *:\n    if syms is None:\n      self._mfst.get().SetOutputSymbols(NULL)\n      return\n    self._mfst.get().SetOutputSymbols(syms._table)\n    self._check_mutating_imethod()\n\n  def set_output_symbols(self, _SymbolTable syms):\n    \"\"\"\n    set_output_symbols(self, syms)\n\n    Sets the output symbol table.\n\n    Passing None as a value will delete the output symbol table.\n\n    Args:\n      syms: A SymbolTable.\n\n    Returns:\n      self.\n\n    See also: `set_input_symbols`.\n    \"\"\"\n    self._set_output_symbols(syms)\n    return self\n\n  cdef void _set_properties(self, uint64 props, uint64 mask):\n    self._mfst.get().SetProperties(props, mask)\n\n  def set_properties(self, uint64 props, uint64 mask):\n    \"\"\"\n    set_properties(self, props, mask)\n\n    Sets the properties bits.\n\n    Args:\n      props: The properties to be set.\n      mask: A mask to be applied to the `props` argument before setting the\n          FST's properties.\n\n    Returns:\n      self.\n    \"\"\"\n    self._set_properties(props, mask)\n    return self\n\n  cdef void _set_start(self, int64 state) except *:\n    if not self._mfst.get().SetStart(state):\n      raise FstIndexError(\"State index out of range\")\n    self._check_mutating_imethod()\n\n  def set_start(self, int64 state):\n    \"\"\"\n    set_start(self, state)\n\n    Sets a state to be the initial state state.\n\n    Args:\n      state: The integer index of a state.\n\n    Returns:\n      self.\n\n    Raises:\n      FstIndexError: State index out of range.\n\n    See also: `set_final`.\n    \"\"\"\n    self._set_start(state)\n    return self\n\n  cdef void _topsort(self) except *:\n    # TopSort returns False if the FST is cyclic, and thus can't be TopSorted.\n    if not fst.TopSort(self._mfst.get()):\n      logging.warning(\"Cannot topsort cyclic FST.\")\n    self._check_mutating_imethod()\n\n  def topsort(self):\n    \"\"\"\n    topsort(self)\n\n    Sorts transitions by state IDs.\n\n    This operation destructively topologically sorts the FST, if it is acyclic;\n    otherwise it remains unchanged. Once sorted, all transitions are from lower\n    state IDs to higher state IDs\n\n    Returns:\n       self.\n\n    See also: `arcsort`.\n    \"\"\"\n    self._topsort()\n    return self\n\n  cdef void _union(self, _Fst ifst) except *:\n    fst.Union(self._mfst.get(), deref(ifst._fst))\n    self._check_mutating_imethod()\n\n  def union(self, _Fst ifst):\n    \"\"\"\n    union(self, ifst)\n\n    Computes the union (sum) of two FSTs.\n\n    This operation computes the union (sum) of two FSTs. If A transduces string\n    x to y with weight a and B transduces string w to v with weight b, then\n    their union transduces x to y with weight a and w to v with weight b.\n\n    Args:\n      ifst: The second input FST.\n\n    Returns:\n      self.\n    \"\"\"\n    self._union(ifst)\n    return self\n\n\n# Pseudo-constructors for _Fst and _MutableFst.\n#\n# _init_Fst and _init_MutableFst use an FstClass pointer to instantiate _Fst\n# and _MutableFst objects, respectively. The latter function is only safe to\n# call when the FST being wrapped is known to be kMutable. The caller can\n# safely use it when they have either checked this bit (e.g., by using\n# _init_XFst) or have themselves constructed a mutable container for the\n# FstClass pointer they're passing (e.g., most of the constructive operations,\n# storing their results in a VectorFstClass, a derivative of MutableFstClass).\n#\n# _create_Fst constructs an empty VectorFstClass of a user-specified arc type,\n# and passes this pointer to _init_MutableFst.\n#\n# _read_Fst reads an FST from disk, performing FST conversion if requested, and\n# then passes this pointer to _init_XFst.\n#\n# The Python class Fst provides a wrapper for these two operations. The former\n# can be accessed by calling Fst(...), which acts like a class method, and the\n# latter via Fst.read(...), which acts like a static method. This is a bit\n# nasty, but totally hidden from the Python user.\n\n\ncdef _Fst _init_Fst(FstClass_ptr tfst):\n  if tfst.Properties(fst.kError, True):\n    raise FstOpError(\"Operation failed\")\n  cdef _Fst ofst = _Fst.__new__(_Fst)\n  ofst._fst.reset(tfst)\n  return ofst\n\n\ncdef _MutableFst _init_MutableFst(MutableFstClass_ptr tfst):\n  if tfst.Properties(fst.kError, True):\n    raise FstOpError(\"Operation failed\")\n  cdef _MutableFst ofst = _MutableFst.__new__(_MutableFst)\n  ofst._fst.reset(tfst)\n  # Makes a copy of it as the derived type! Cool.\n  ofst._mfst = static_pointer_cast[fst.MutableFstClass, fst.FstClass](ofst._fst)\n  return ofst\n\n\ncdef _Fst _init_XFst(FstClass_ptr tfst):\n  if tfst.Properties(fst.kMutable, True):\n    return _init_MutableFst(static_cast[MutableFstClass_ptr](tfst))\n  else:\n    return _init_Fst(tfst)\n\n\ncdef _MutableFst _create_Fst(arc_type=b\"standard\"):\n  cdef unique_ptr[fst.VectorFstClass] tfst\n  tfst.reset(new fst.VectorFstClass(tostring(arc_type)))\n  if tfst.get() == NULL:\n    raise FstOpError(\"Unknown arc type: {!r}\".format(arc_type))\n  return _init_MutableFst(tfst.release())\n\n\ncpdef _Fst _read(filename):\n  cdef unique_ptr[fst.FstClass] tfst\n  tfst.reset(fst.FstClass.Read(tostring(filename)))\n  if tfst.get() == NULL:\n    raise FstIOError(\"Read failed: {!r}\".format(filename))\n  return _init_XFst(tfst.release())\n\n\ncpdef _Fst _read_from_string(state):\n  cdef stringstream sstrm\n  sstrm << tostring(state)\n  cdef unique_ptr[fst.FstClass] tfst\n  tfst.reset(fst.FstClass.ReadFromStream(sstrm, b\"<pywrapfst>\"))\n  if tfst.get() == NULL:\n    raise FstIOError(\"Read failed: <string>\")\n  return _init_XFst(tfst.release())\n\n\nclass Fst(object):\n\n   \"\"\"\n   Fst(arc_type=\"standard\")\n\n   Constructs an empty FST.\n\n   Args:\n     arc_type: A string indicating the arc type.\n\n   Raises:\n     FstError: Unknown arc type.\n\n   Raises:\n     FstOpError: operation failed.\n   \"\"\"\n\n   def __new__(cls, arc_type=b\"standard\"):\n    return _create_Fst(arc_type)\n\n   @staticmethod\n   def read(filename):\n     \"\"\"\n     read(filename):\n\n     Reads an FST from a file.\n\n     Args:\n       filename: The string location of the input file.\n\n     Returns:\n       An FST object.\n\n     Raises:\n       FstIOError: Read failed.\n     \"\"\"\n     return _read(filename)\n\n   @staticmethod\n   def read_from_string(state):\n     \"\"\"\n     read_from_string(string, fst_type=None)\n\n     Reads an FST from a serialized string.\n\n     Args:\n       state: A string containing the serialized FST.\n\n     Returns:\n       An FST object.\n\n     Raises:\n       FstIOError: Read failed.\n       FstOpError: Read-time conversion failed.\n\n     See also: `write_to_string`.\n     \"\"\"\n     return _read_from_string(state)\n\n\n## FST constants.\n\n\nNO_LABEL = fst.kNoLabel\nNO_STATE_ID = fst.kNoStateId\n# TODO(kbg): Figure out how to access static class variables so I don't have\n# to do it this way.\nNO_SYMBOL = kNoSymbol\n\n\n## FST properties.\n\n\nEXPANDED = fst.kExpanded\nMUTABLE = fst.kMutable\nERROR = fst.kError\nACCEPTOR = fst.kAcceptor\nNOT_ACCEPTOR = fst.kNotAcceptor\nI_DETERMINISTIC = fst.kIDeterministic\nNON_I_DETERMINISTIC = fst.kNonIDeterministic\nO_DETERMINISTIC = fst.kODeterministic\nNON_O_DETERMINISTIC = fst.kNonODeterministic\nEPSILONS = fst.kEpsilons\nNO_EPSILONS = fst.kNoEpsilons\nI_EPSILONS = fst.kIEpsilons\nNO_I_EPSILONS = fst.kNoIEpsilons\nO_EPSILONS = fst.kOEpsilons\nNO_O_EPSILONS = fst.kNoOEpsilons\nI_LABEL_SORTED = fst.kILabelSorted\nNOT_I_LABEL_SORTED = fst.kNotILabelSorted\nO_LABEL_SORTED = fst.kOLabelSorted\nNOT_O_LABEL_SORTED = fst.kNotOLabelSorted\nWEIGHTED = fst.kWeighted\nUNWEIGHTED = fst.kUnweighted\nCYCLIC = fst.kCyclic\nACYCLIC = fst.kAcyclic\nINITIAL_CYCLIC = fst.kInitialCyclic\nINITIAL_ACYCLIC = fst.kInitialAcyclic\nTOP_SORTED = fst.kTopSorted\nNOT_TOP_SORTED = fst.kNotTopSorted\nACCESSIBLE = fst.kAccessible\nNOT_ACCESSIBLE = fst.kNotAccessible\nCOACCESSIBLE = fst.kCoAccessible\nNOT_COACCESSIBLE = fst.kNotCoAccessible\nSTRING = fst.kString\nNOT_STRING = fst.kNotString\nWEIGHTED_CYCLES = fst.kWeightedCycles\nUNWEIGHTED_CYCLES = fst.kUnweightedCycles\nNULL_PROPERTIES = fst.kNullProperties\nCOPY_PROPERTIES = fst.kCopyProperties\nINTRINSIC_PROPERTIES = fst.kIntrinsicProperties\nEXTRINSIC_PROPERTIES = fst.kExtrinsicProperties\nSET_START_PROPERTIES = fst.kSetStartProperties\nSET_FINAL_PROPERTIES = fst.kSetFinalProperties\nADD_STATE_PROPERTIES = fst.kAddStateProperties\nADD_ARC_PROPERTIES = fst.kAddArcProperties\nSET_ARC_PROPERTIES = fst.kSetArcProperties\nDELETE_STATE_PROPERTIES = fst.kDeleteStatesProperties\nDELETE_ARC_PROPERTIES = fst.kDeleteArcsProperties\nSTATE_SORT_PROPERTIES = fst.kStateSortProperties\nARC_SORT_PROPERTIES = fst.kArcSortProperties\nI_LABEL_INVARIANT_PROPERTIES = fst.kILabelInvariantProperties\nO_LABEL_INVARIANT_PROPERTIES = fst.kOLabelInvariantProperties\nWEIGHT_INVARIANT_PROPERTIES = fst.kWeightInvariantProperties\nADD_SUPERFINAL_PROPERTIES = fst.kAddSuperFinalProperties\nRM_SUPERFINAL_PROPERTIES = fst.kRmSuperFinalProperties\nBINARY_PROPERTIES = fst.kBinaryProperties\nTRINARY_PROPERTIES = fst.kTrinaryProperties\nPOS_TRINARY_PROPERTIES = fst.kPosTrinaryProperties\nNEG_TRINARY_PROPERTIES = fst.kNegTrinaryProperties\nFST_PROPERTIES = fst.kFstProperties\n\n\n## Arc iterator properties.\n\n\nARC_I_LABEL_VALUE = fst.kArcILabelValue\nARC_O_LABEL_VALUE = fst.kArcOLabelValue\nARC_WEIGHT_VALUE = fst.kArcWeightValue\nARC_NEXT_STATE_VALUE = fst.kArcNextStateValue\nARC_NO_CACHE = fst.kArcNoCache\nARC_VALUE_FLAGS = fst.kArcValueFlags\nARC_FLAGS = fst.kArcFlags\n\n\n## EncodeMapper properties.\n\n\nENCODE_LABELS = fst.kEncodeLabels\nENCODE_WEIGHTS = fst.kEncodeWeights\nENCODE_FLAGS = fst.kEncodeFlags\n\n\n## Arc, ArcIterator, and MutableArcIterator.\n\n\ncdef class Arc(object):\n\n  \"\"\"\n  Arc(ilabel, olabel, weight, nextstate)\n\n  This class represents an arc while remaining agnostic about the underlying arc\n  type.  Attributes of the arc can be accessed or mutated, and the arc can be\n  copied.\n\n  Attributes:\n    ilabel: The input label.\n    olabel: The output label.\n    weight: The arc weight.\n    nextstate: The destination state for the arc.\n  \"\"\"\n\n  def __repr__(self):\n    return \"<Arc at 0x{:x}>\".format(id(self))\n\n  def __init__(self, int64 ilabel, int64 olabel, weight, int64 nextstate):\n    cdef fst.WeightClass wc = _get_WeightClass_or_One(b\"tropical\", weight)\n    self._arc.reset(new fst.ArcClass(ilabel, olabel, wc, nextstate))\n\n  cpdef Arc copy(self):\n    return Arc(self.ilabel, self.olabel, self.weight, self.nextstate)\n\n  property ilabel:\n\n    def __get__(self):\n      return deref(self._arc).ilabel\n\n    def __set__(self, int64 value):\n      deref(self._arc).ilabel = value\n\n  property olabel:\n\n    def __get__(self):\n      return deref(self._arc).olabel\n\n    def __set__(self, int64 value):\n      deref(self._arc).olabel = value\n\n  property weight:\n\n    def __get__(self):\n      cdef Weight weight = Weight.__new__(Weight)\n      weight._weight.reset(new fst.WeightClass(deref(self._arc).weight))\n      return weight\n\n    def __set__(self, weight):\n      deref(self._arc).weight = _get_WeightClass_or_One(b\"tropical\", weight)\n\n  property nextstate:\n\n    def __get__(self):\n      return deref(self._arc).nextstate\n\n    def __set__(self, int64 value):\n      deref(self._arc).nextstate = value\n\n\ncdef Arc _init_Arc(const fst.ArcClass &arc):\n  cdef Weight weight = Weight.__new__(Weight)\n  weight._weight.reset(new fst.WeightClass(arc.weight))\n  return Arc(arc.ilabel, arc.olabel, weight, arc.nextstate)\n\n\ncdef class ArcIterator(object):\n\n  \"\"\"\n  ArcIterator(ifst, state)\n\n  This class is used for iterating over the arcs leaving some state of an FST.\n  \"\"\"\n\n  def __repr__(self):\n    return \"<ArcIterator at 0x{:x}>\".format(id(self))\n\n  def __init__(self, _Fst ifst, int64 state):\n    if not ifst._fst.get().ValidStateId(state):\n      raise FstIndexError(\"State index out of range\")\n    # Makes copy of the shared_ptr, potentially extending the FST's lifetime.\n    self._fst = ifst._fst\n    self._aiter.reset(new fst.ArcIteratorClass(deref(self._fst), state))\n\n  # This just registers this class as a possible iterator.\n  def __iter__(self):\n    return self\n\n  # Magic method used to get a Pythonic API out of the C++ API.\n  def __next__(self):\n    if self.done():\n      raise StopIteration\n    result = self.value()\n    self.next()\n    return result\n\n  cpdef bool done(self):\n    \"\"\"\n    done(self)\n\n    Indicates whether the iterator is exhausted or not.\n\n    Returns:\n      True if the iterator is exhausted, False otherwise.\n    \"\"\"\n    return self._aiter.get().Done()\n\n  cpdef uint32 flags(self):\n    \"\"\"\n    flags(self)\n\n    Returns the current iterator behavioral flags.\n\n    Returns:\n      The current iterator behavioral flags as an integer.\n    \"\"\"\n    return self._aiter.get().Flags()\n\n  cpdef void next(self):\n    \"\"\"\n    next(self)\n\n    Advances the iterator.\n    \"\"\"\n    self._aiter.get().Next()\n\n  cpdef size_t position(self):\n    \"\"\"\n    position(self)\n\n    Returns the position of the iterator.\n\n    Returns:\n      The iterator's position, expressed as an integer.\n    \"\"\"\n    return self._aiter.get().Position()\n\n  cpdef void reset(self):\n    \"\"\"\n    reset(self)\n\n    Resets the iterator to the initial position.\n    \"\"\"\n    self._aiter.get().Reset()\n\n  cpdef void seek(self, size_t a):\n    \"\"\"\n    seek(self, a)\n\n    Advance the iterator to a new position.\n\n    Args:\n      a: The position to seek to.\n    \"\"\"\n    self._aiter.get().Seek(a)\n\n  cpdef void set_flags(self, uint32 flags, uint32 mask):\n    \"\"\"\n    set_flags(self, flags, mask)\n\n    Sets the current iterator behavioral flags.\n\n    Args:\n      flags: The properties to be set.\n      mask: A mask to be applied to the `flags` argument before setting them.\n    \"\"\"\n    self._aiter.get().SetFlags(flags, mask)\n\n  cpdef object value(self):\n    \"\"\"\n    value(self)\n\n    Returns the current arc.\n    \"\"\"\n    return _init_Arc(self._aiter.get().Value())\n\n\ncdef class MutableArcIterator(object):\n\n  \"\"\"\n  MutableArcIterator(ifst, state)\n\n  This class is used for iterating over the arcs leaving some state of an FST,\n  also permitting mutation of the current arc.\n  \"\"\"\n\n  def __repr__(self):\n    return \"<MutableArcIterator at 0x{:x}>\".format(id(self))\n\n  def __init__(self, _MutableFst ifst, int64 state):\n    if not ifst._fst.get().ValidStateId(state):\n      raise FstIndexError(\"State index out of range\")\n    # Makes copy of the shared_ptr, potentially extending the FST's lifetime.\n    self._mfst = ifst._mfst\n    self._aiter.reset(new fst.MutableArcIteratorClass(ifst._mfst.get(), state))\n\n  cpdef bool done(self):\n    \"\"\"\n    done(self)\n\n    Indicates whether the iterator is exhausted or not.\n\n    Returns:\n      True if the iterator is exhausted, False otherwise.\n    \"\"\"\n    return self._aiter.get().Done()\n\n  cpdef uint32 flags(self):\n    \"\"\"\n    flags(self)\n\n    Returns the current iterator behavioral flags.\n\n    Returns:\n      The current iterator behavioral flags as an integer.\n    \"\"\"\n    return self._aiter.get().Flags()\n\n  cpdef void next(self):\n    \"\"\"\n    next(self)\n\n    Advances the iterator.\n    \"\"\"\n    self._aiter.get().Next()\n\n  cpdef size_t position(self):\n    \"\"\"\n    position(self)\n\n    Returns the position of the iterator.\n\n    Returns:\n      The iterator's position, expressed as an integer.\n    \"\"\"\n    return self._aiter.get().Position()\n\n  cpdef void reset(self):\n    \"\"\"\n    reset(self)\n\n    Resets the iterator to the initial position.\n    \"\"\"\n    self._aiter.get().Reset()\n\n  cpdef void seek(self, size_t a):\n    \"\"\"\n    seek(self, a)\n\n    Advance the iterator to a new position.\n\n    Args:\n      a: The position to seek to.\n    \"\"\"\n    self._aiter.get().Seek(a)\n\n  cpdef void set_flags(self, uint32 flags, uint32 mask):\n    \"\"\"\n    set_flags(self, flags, mask)\n\n    Sets the current iterator behavioral flags.\n\n    Args:\n      flags: The properties to be set.\n      mask: A mask to be applied to the `flags` argument before setting them.\n    \"\"\"\n    self._aiter.get().SetFlags(flags, mask)\n\n  cpdef void set_value(self, Arc arc):\n    \"\"\"\n    set_value(self, arc)\n\n    Replace the current arc with a new arc.\n\n    Args:\n      arc: The arc to replace the current arc with.\n    \"\"\"\n    self._aiter.get().SetValue(deref(arc._arc))\n\n  cpdef object value(self):\n    \"\"\"\n    value(self)\n\n    Returns the current arc.\n    \"\"\"\n    return _init_Arc(self._aiter.get().Value())\n\n\n## StateIterator.\n\n\ncdef class StateIterator(object):\n\n  \"\"\"\n  StateIterator(ifst)\n\n  This class is used for iterating over the states in an FST.\n  \"\"\"\n\n  def __repr__(self):\n    return \"<StateIterator at 0x{:x}>\".format(id(self))\n\n  def __init__(self, _Fst ifst):\n    # Makes copy of the shared_ptr, potentially extending the FST's lifetime.\n    self._fst = ifst._fst\n    self._siter.reset(new fst.StateIteratorClass(deref(self._fst)))\n\n  # This just registers this class as a possible iterator.\n  def __iter__(self):\n    return self\n\n  # Magic method used to get a Pythonic API out of the C++ API.\n  def __next__(self):\n    if self.done():\n      raise StopIteration\n    cdef int64 result = self.value()\n    self.next()\n    return result\n\n  cpdef bool done(self):\n    \"\"\"\n    done(self)\n\n    Indicates whether the iterator is exhausted or not.\n\n    Returns:\n      True if the iterator is exhausted, False otherwise.\n    \"\"\"\n    return self._siter.get().Done()\n\n  cpdef void next(self):\n    \"\"\"\n    next(self)\n\n    Advances the iterator.\n    \"\"\"\n    self._siter.get().Next()\n\n  cpdef void reset(self):\n    \"\"\"\n    reset(self)\n\n    Resets the iterator to the initial position.\n    \"\"\"\n    self._siter.get().Reset()\n\n  cpdef int64 value(self):\n    \"\"\"\n    value(self)\n\n    Returns the current state index.\n    \"\"\"\n    return self._siter.get().Value()\n\n\n## FST operations.\n\n\ncdef _Fst _map(_Fst ifst,\n               float delta=fst.kDelta,\n               map_type=b\"identity\",\n               double power=1.,\n               weight=None):\n  cdef fst.MapType map_type_enum\n  if not fst.GetMapType(tostring(map_type), addr(map_type_enum)):\n    raise FstArgError(\"Unknown map type: {!r}\".format(map_type))\n  cdef fst.WeightClass wc = (_get_WeightClass_or_One(ifst.weight_type(),\n      weight) if map_type_enum == fst.TIMES_MAPPER else\n      _get_WeightClass_or_Zero(ifst.weight_type(), weight))\n  return _init_XFst(fst.Map(deref(ifst._fst), map_type_enum, delta, power, wc))\n\n\ncpdef _Fst arcmap(_Fst ifst,\n                  float delta=fst.kDelta,\n                  map_type=b\"identity\",\n                  double power=1.,\n                  weight=None):\n  \"\"\"\n  arcmap(ifst, delta=0.0009765625, map_type=\"identity\", weight=None)\n\n  Constructively applies a transform to all arcs and final states.\n\n  This operation transforms each arc and final state in the input FST using\n  one of the following:\n\n    * identity: maps to self.\n    * input_epsilon: replaces all input labels with epsilon.\n    * invert: reciprocates all non-Zero weights.\n    * float_power: raises all weights to a floating-point power.\n    * output_epsilon: replaces all output labels with epsilon.\n    * quantize: quantizes weights.\n    * plus: adds a constant to all weights.\n    * power: raises all weights to an integral power.\n    * rmweight: replaces all non-Zero weights with 1.\n    * superfinal: redirects final states to a new superfinal state.\n    * times: right-multiplies a constant to all weights.\n    * to_log: converts weights to the log semiring.\n    * to_log64: converts weights to the log64 semiring.\n    * to_standard: converts weights to the tropical (\"standard\") semiring.\n\n  Args:\n    ifst: The input FST.\n    delta: Comparison/quantization delta (ignored unless `map_type` is\n        `quantize`).\n    map_type: A string matching a known mapping operation (see above).\n    power: A positive scalar or integer power; ignored unless `map_type` is\n        `float_power` or `power` (in which case it defaults to 1).\n    weight: A Weight or weight string passed to the arc-mapper; ignored unless\n        `map_type` is `plus` (in which case it defaults to semiring Zero) or\n        `times` (in which case it defaults to semiring One).\n\n  Returns:\n    An FST with arcs and final states remapped.\n\n  Raises:\n    FstArgError: Unknown map type.\n\n  See also: `statemap`.\n  \"\"\"\n  return _map(ifst, delta, map_type, power, weight)\n\n\ncpdef _MutableFst compose(_Fst ifst1,\n                          _Fst ifst2,\n                          compose_filter=b\"auto\",\n                          bool connect=True):\n  \"\"\"\n  compose(ifst1, ifst2, compose_filter=\"auto\", connect=True)\n\n  Constructively composes two FSTs.\n\n  This operation computes the composition of two FSTs. If A transduces string\n  x to y with weight a and B transduces y to z with weight b, then their\n  composition transduces string x to z with weight a \\otimes b. The output\n  labels of the first transducer or the input labels of the second transducer\n  must be sorted (or otherwise support appropriate matchers).\n\n  Args:\n    ifst1: The first input FST.\n    ifst2: The second input FST.\n    compose_filter: A string matching a known composition filter; one of:\n        \"alt_sequence\", \"auto\", \"match\", \"null\", \"sequence\", \"trivial\".\n    connect: Should output be trimmed?\n\n  Returns:\n    An FST.\n\n  See also: `arcsort`.\n  \"\"\"\n  cdef unique_ptr[fst.VectorFstClass] tfst\n  tfst.reset(new fst.VectorFstClass(ifst1.arc_type()))\n  cdef unique_ptr[fst.ComposeOptions] opts\n  opts.reset(new fst.ComposeOptions(connect,\n      _get_compose_filter(tostring(compose_filter))))\n  fst.Compose(deref(ifst1._fst), deref(ifst2._fst), tfst.get(), deref(opts))\n  return _init_MutableFst(tfst.release())\n\n\ncpdef _Fst convert(_Fst ifst, fst_type=None):\n  \"\"\"\n  convert(ifst, fst_type=None)\n\n  Constructively converts an FST to a new internal representation.\n\n  Args:\n    ifst: The input FST.\n    fst_type: A string indicating the FST type to convert to, or None if\n        no conversion is desired.\n\n  Returns:\n    An equivalent Fst converted to the desired FST type.\n\n  Raises:\n    FstOpError: Conversion failed.\n  \"\"\"\n  cdef string fst_type_string = b\"\" if fst_type is None else tostring(fst_type)\n  cdef unique_ptr[fst.FstClass] tfst\n  tfst.reset(fst.Convert(deref(ifst._fst), fst_type_string))\n  # Script-land Convert returns a null pointer to signal failure.\n  if tfst.get() == NULL:\n    raise FstOpError(\"Conversion to {!r} failed\".format(fst_type))\n  return _init_XFst(tfst.release())\n\n\ncpdef _MutableFst determinize(_Fst ifst,\n                              float delta=fst.kShortestDelta,\n                              det_type=b\"functional\",\n                              int64 nstate=fst.kNoStateId,\n                              int64 subsequential_label=0,\n                              weight=None,\n                              bool increment_subsequential_label=False):\n  \"\"\"\n  determinize(ifst, delta=1e-6, det_type=\"functional\",\n              nstate=NO_STATE_ID, subsequential_label=0, weight=None,\n              incremental_subsequential_label=False)\n\n  Constructively determinizes a weighted FST.\n\n  This operations creates an equivalent FST that has the property that no\n  state has two transitions with the same input label. For this algorithm,\n  epsilon transitions are treated as regular symbols (cf. `rmepsilon`).\n\n  Args:\n    ifst: The input FST.\n    delta: Comparison/quantization delta.\n    det_type: Type of determinization; one of: \"functional\" (input transducer is\n        functional), \"nonfunctional\" (input transducer is not functional) and\n        disambiguate\" (input transducer is not functional but only keep the min\n        of ambiguous outputs).\n    nstate: State number threshold.\n    subsequential_label: Input label of arc corresponding to residual final\n        output when producing a subsequential transducer.\n    weight: A Weight or weight string indicating the desired weight threshold\n        below which paths are pruned; if omitted, no paths are pruned.\n    increment_subsequential_label: Increment subsequential when creating\n        several arcs for the residual final output at a given state.\n\n  Returns:\n    An equivalent deterministic FST.\n\n  Raises:\n    FstArgError: Unknown determinization type.\n\n  See also: `disambiguate`, `rmepsilon`.\n  \"\"\"\n  cdef unique_ptr[fst.VectorFstClass] tfst\n  tfst.reset(new fst.VectorFstClass(ifst.arc_type()))\n  # Threshold is set to semiring Zero (no pruning) if weight unspecified.\n  cdef fst.WeightClass wc = _get_WeightClass_or_Zero(ifst.weight_type(),\n                                                     weight)\n  cdef fst.DeterminizeType determinize_type_enum\n  if not fst.GetDeterminizeType(tostring(det_type),\n                                addr(determinize_type_enum)):\n    raise FstArgError(\"Unknown determinization type: {!r}\".format(det_type))\n  cdef unique_ptr[fst.DeterminizeOptions] opts\n  opts.reset(new fst.DeterminizeOptions(delta, wc, nstate, subsequential_label,\n                                        determinize_type_enum,\n                                        increment_subsequential_label))\n  fst.Determinize(deref(ifst._fst), tfst.get(), deref(opts))\n  return _init_MutableFst(tfst.release())\n\n\ncpdef _MutableFst difference(_Fst ifst1,\n                             _Fst ifst2,\n                             compose_filter=b\"auto\",\n                             bool connect=True):\n  \"\"\"\n  difference(ifst1, ifst2, compose_filter=\"auto\", connect=True)\n\n  Constructively computes the difference of two FSTs.\n\n  This operation computes the difference between two FSAs. Only strings that are\n  in the first automaton but not in second are retained in the result. The first\n  argument must be an acceptor; the second argument must be an unweighted,\n  epsilon-free, deterministic acceptor. The output labels of the first\n  transducer or the input labels of the second transducer must be sorted (or\n  otherwise support appropriate matchers).\n\n  Args:\n    ifst1: The first input FST.\n    ifst2: The second input FST.\n    compose_filter: A string matching a known composition filter; one of:\n        \"alt_sequence\", \"auto\", \"match\", \"null\", \"sequence\", \"trivial\".\n    connect: Should the output FST be trimmed?\n\n  Returns:\n    An FST representing the difference of the FSTs.\n  \"\"\"\n  cdef unique_ptr[fst.VectorFstClass] tfst\n  tfst.reset(new fst.VectorFstClass(ifst1.arc_type()))\n  cdef unique_ptr[fst.ComposeOptions] opts\n  opts.reset(new fst.ComposeOptions(connect, _get_compose_filter(\n      tostring(compose_filter))))\n  fst.Difference(deref(ifst1._fst), deref(ifst2._fst), tfst.get(), deref(opts))\n  return _init_MutableFst(tfst.release())\n\n\ncpdef _MutableFst disambiguate(_Fst ifst,\n                               float delta=fst.kDelta,\n                               int64 nstate=fst.kNoStateId,\n                               int64 subsequential_label=0,\n                               weight=None):\n  \"\"\"\n  disambiguate(ifst, delta=0.0009765625, nstate=NO_STATE_ID,\n               subsequential_label=0, weight=None):\n\n  Constructively disambiguates a weighted transducer.\n\n  This operation disambiguates a weighted transducer. The result will be an\n  equivalent FST that has the property that no two successful paths have the\n  same input labeling. For this algorithm, epsilon transitions are treated as\n  regular symbols (cf. `rmepsilon`).\n\n  Args:\n    ifst: The input FST.\n    delta: Comparison/quantization delta.\n    nstate: State number threshold.\n    subsequential_label: Input label of arc corresponding to residual final\n        output when producing a subsequential transducer.\n    weight: A Weight or weight string indicating the desired weight threshold\n        below which paths are pruned; if omitted, no paths are pruned.\n\n  Returns:\n    An equivalent disambiguated FST.\n\n  See also: `determinize`, `rmepsilon`.\n  \"\"\"\n  cdef unique_ptr[fst.VectorFstClass] tfst\n  tfst.reset(new fst.VectorFstClass(ifst.arc_type()))\n  # Threshold is set to semiring Zero (no pruning) if no weight is specified.\n  cdef fst.WeightClass wc = _get_WeightClass_or_Zero(ifst.weight_type(),\n                                                     weight)\n  cdef unique_ptr[fst.DisambiguateOptions] opts\n  opts.reset(new fst.DisambiguateOptions(delta, wc, nstate,\n                                         subsequential_label))\n  fst.Disambiguate(deref(ifst._fst), tfst.get(), deref(opts))\n  return _init_MutableFst(tfst.release())\n\n\ncpdef _MutableFst epsnormalize(_Fst ifst, bool eps_norm_output=False):\n  \"\"\"\n  epsnormalize(ifst, eps_norm_output=False)\n\n  Constructively epsilon-normalizes an FST.\n\n  This operation creates an equivalent FST that is epsilon-normalized. An\n  acceptor is epsilon-normalized if it it is epsilon-removed (cf. `rmepsilon`).\n  A transducer is input epsilon-normalized if, in addition, along any path, all\n  arcs with epsilon input labels follow all arcs with non-epsilon input labels.\n  Output epsilon-normalized is defined similarly. The input FST must be\n  functional.\n\n  Args:\n    ifst: The input FST.\n    eps_norm_output: Should the FST be output epsilon-normalized?\n\n  Returns:\n    An equivalent epsilon-normalized FST.\n\n  See also: `rmepsilon`.\n  \"\"\"\n  cdef unique_ptr[fst.VectorFstClass] tfst\n  tfst.reset(new fst.VectorFstClass(ifst.arc_type()))\n  fst.EpsNormalize(deref(ifst._fst), tfst.get(), fst.EPS_NORM_OUTPUT if\n                                                 eps_norm_output else\n                                                 fst.EPS_NORM_INPUT)\n  return _init_MutableFst(tfst.release())\n\n\ncpdef bool equal(_Fst ifst1, _Fst ifst2, float delta=fst.kDelta):\n  \"\"\"\n  equal(ifst1, ifst2, delta=0.0009765625)\n\n  Are two FSTs equal?\n\n  This function tests whether two FSTs have the same states with the same\n  numbering and the same transitions with the same labels and weights in the\n  same order.\n\n  Args:\n    ifst1: The first input FST.\n    ifst2: The second input FST.\n    delta: Comparison/quantization delta.\n\n  Returns:\n    True if the FSTs satisfy the above condition, else False.\n\n  See also: `equivalent`, `isomorphic`, `randequivalent`.\n  \"\"\"\n  return fst.Equal(deref(ifst1._fst), deref(ifst2._fst), delta)\n\n\ncpdef bool equivalent(_Fst ifst1, _Fst ifst2, float delta=fst.kDelta) except *:\n  \"\"\"\n  equivalent(ifst1, ifst2, delta=0.0009765625)\n\n  Are the two acceptors equivalent?\n\n  This operation tests whether two epsilon-free deterministic weighted\n  acceptors are equivalent, that is if they accept the same strings with the\n  same weights.\n\n  Args:\n    ifst1: The first input FST.\n    ifst2: The second input FST.\n    delta: Comparison/quantization delta.\n\n  Returns:\n    True if the FSTs satisfy the above condition, else False.\n\n  See also: `equal`, `isomorphic`, `randequivalent`.\n  \"\"\"\n  return fst.Equivalent(deref(ifst1._fst), deref(ifst2._fst), delta)\n\n\ncpdef _MutableFst intersect(_Fst ifst1,\n                            _Fst ifst2,\n                            compose_filter=b\"auto\",\n                            bool connect=True):\n  \"\"\"\n  intersect(ifst1, ifst2, compose_filter=\"auto\", connect=True)\n\n  Constructively intersects two FSTs.\n\n  This operation computes the intersection (Hadamard product) of two FSTs.\n  Only strings that are in both automata are retained in the result. The two\n  arguments must be acceptors. One of the arguments must be label-sorted (or\n  otherwise support appropriate matchers).\n\n  Args:\n    ifst1: The first input FST.\n    ifst2: The second input FST.\n    compose_filter: A string matching a known composition filter; one of:\n        \"alt_sequence\", \"auto\", \"match\", \"null\", \"sequence\", \"trivial\".\n    connect: Should output be trimmed?\n\n  Returns:\n    An intersected FST.\n  \"\"\"\n  cdef unique_ptr[fst.VectorFstClass] tfst\n  tfst.reset(new fst.VectorFstClass(ifst1.arc_type()))\n  cdef unique_ptr[fst.ComposeOptions] opts\n  opts.reset(new fst.ComposeOptions(connect,\n        _get_compose_filter(tostring(compose_filter))))\n  fst.Intersect(deref(ifst1._fst), deref(ifst2._fst), tfst.get(), deref(opts))\n  return _init_MutableFst(tfst.release())\n\n\ncpdef bool isomorphic(_Fst ifst1, _Fst ifst2, float delta=fst.kDelta):\n  \"\"\"\n  isomorphic(ifst1, ifst2, delta=0.0009765625)\n\n  Are the two acceptors isomorphic?\n\n  This operation determines if two transducers with a certain required\n  determinism have the same states, irrespective of numbering, and the same\n  transitions with the same labels and weights, irrespective of ordering. In\n  other words, FSTs A, B are isomorphic if and only if the states of A can be\n  renumbered and the transitions leaving each state reordered so the two are\n  equal (according to the definition given in `equal`).\n\n  Args:\n    ifst1: The first input FST.\n    ifst2: The second input FST.\n    delta: Comparison/quantization delta.\n\n  Returns:\n    True if the two transducers satisfy the above condition, else False.\n\n  See also: `equal`, `equivalent`, `randequivalent`.\n  \"\"\"\n  return fst.Isomorphic(deref(ifst1._fst), deref(ifst2._fst), delta)\n\n\ncpdef _MutableFst prune(_Fst ifst,\n                        float delta=fst.kDelta,\n                        int64 nstate=fst.kNoStateId,\n                        weight=None):\n  \"\"\"\n  prune(ifst, delta=0.0009765625, nstate=NO_STATE_ID, weight=None)\n\n  Constructively removes paths with weights below a certain threshold.\n\n  This operation deletes states and arcs in the input FST that do not belong\n  to a successful path whose weight is no more (w.r.t the natural semiring\n  order) than the threshold t \\otimes-times the weight of the shortest path in\n  the input FST. Weights must be commutative and have the path property.\n\n  Args:\n    ifst: The input FST.\n    delta: Comparison/quantization delta.\n    nstate: State number threshold.\n    weight: A Weight or weight string indicating the desired weight threshold\n        below which paths are pruned; if omitted, no paths are pruned.\n\n  Returns:\n    A pruned FST.\n\n  See also: The destructive variant.\n  \"\"\"\n  cdef unique_ptr[fst.VectorFstClass] tfst\n  tfst.reset(new fst.VectorFstClass(ifst.arc_type()))\n  cdef fst.WeightClass wc = _get_WeightClass_or_Zero(ifst.weight_type(), weight)\n  fst.Prune(deref(ifst._fst), tfst.get(), wc, nstate, delta)\n  return _init_MutableFst(tfst.release())\n\n\ncpdef _MutableFst push(_Fst ifst,\n                       float delta=fst.kDelta,\n                       bool push_weights=False,\n                       bool push_labels=False,\n                       bool remove_common_affix=False,\n                       bool remove_total_weight=False,\n                       bool to_final=False):\n  \"\"\"\n  push(ifst, delta=0.0009765625, push_weights=False, push_labels=False,\n       remove_common_affix=False, remove_total_weight=False, to_final=False)\n\n  Constructively pushes weights/labels towards initial or final states.\n\n  This operation produces an equivalent transducer by pushing the weights\n  and/or the labels towards the initial state or toward the final states.\n\n  When pushing weights towards the initial state, the sum of the weight of the\n  outgoing transitions and final weight at any non-initial state is equal to 1\n  in the resulting machine. When pushing weights towards the final states, the\n  sum of the weight of the incoming transitions at any state is equal to 1.\n  Weights need to be left distributive when pushing towards the initial state\n  and right distributive when pushing towards the final states.\n\n  Pushing labels towards the initial state consists in minimizing at every\n  state the length of the longest common prefix of the output labels of the\n  outgoing paths. Pushing labels towards the final states consists in\n  minimizing at every state the length of the longest common suffix of the\n  output labels of the incoming paths.\n\n  Args:\n    ifst: The input FST.\n    delta: Comparison/quantization delta.\n    push_weights: Should weights be pushed?\n    push_labels: Should labels be pushed?\n    remove_common_affix: If pushing labels, should common prefix/suffix be\n        removed?\n    remove_total_weight: If pushing weights, should total weight be removed?\n    to_final: Push towards final states?\n\n  Returns:\n    An equivalent pushed FST.\n\n  See also: The destructive variant.\n  \"\"\"\n  # This is copied, almost verbatim, from ./fstpush.cc.\n  cdef unique_ptr[fst.VectorFstClass] tfst\n  tfst.reset(new fst.VectorFstClass(ifst.arc_type()))\n  cdef uint32 flags = fst.GetPushFlags(push_weights, push_labels,\n                                       remove_common_affix, remove_total_weight)\n  fst.Push(deref(ifst._fst), tfst.get(), flags, fst.GetReweightType(to_final),\n           delta)\n  return _init_MutableFst(tfst.release())\n\n\ncpdef bool randequivalent(_Fst ifst1,\n                          _Fst ifst2,\n                          int32 npath=1,\n                          float delta=fst.kDelta,\n                          time_t seed=0,\n                          select=b\"uniform\",\n                          int32 max_length=INT32_MAX) except *:\n  \"\"\"\n  randequivalent(ifst1, ifst2, npath=1, delta=0.0009765625, seed=0,\n                 select=\"uniform\", max_length=2147483647)\n\n  Are two acceptors stochastically equivalent?\n\n  This operation tests whether two FSTs are equivalent by randomly generating\n  paths alternatively in each of the two FSTs. For each randomly generated path,\n  the algorithm computes for each of the two FSTs the sum of the weights of all\n  the successful paths sharing the same input and output labels as the randomly\n  generated path and checks that these two values are within `delta`.\n\n  Args:\n    ifst1: The first input FST.\n    ifst2: The second input FST.\n    npath: The number of random paths to generate.\n    delta: Comparison/quantization delta.\n    seed: An optional seed value for random path generation; if zero, the\n        current time and process ID is used.\n    select: A string matching a known random arc selection type; one of:\n        \"uniform\", \"log_prob\", \"fast_log_prob\".\n    max_length: The maximum length of each random path.\n\n  Returns:\n    True if the two transducers satisfy the above condition, else False.\n\n  See also: `equal`, `equivalent`, `isomorphic`, `randgen`.\n  \"\"\"\n  cdef fst.RandArcSelection ras = _get_rand_arc_selection(tostring(select))\n  cdef unique_ptr[fst.RandGenOptions[fst.RandArcSelection]] opts\n  # The three trailing options will be ignored by RandEquivalent.\n  opts.reset(new fst.RandGenOptions[fst.RandArcSelection](ras, max_length,\n                                                          1, False, False))\n  if seed == 0:\n    seed = time(NULL) + getpid()\n  return fst.RandEquivalent(deref(ifst1._fst), deref(ifst2._fst), npath, delta,\n                           seed, deref(opts))\n\n\ncpdef _MutableFst randgen(_Fst ifst,\n                          int32 npath=1,\n                          time_t seed=0,\n                          select=b\"uniform\",\n                          int32 max_length=INT32_MAX,\n                          bool weighted=False,\n                          bool remove_total_weight=False):\n  \"\"\"\n  randgen(ifst, npath=1, seed=0, select=\"uniform\", max_length=2147483647,\n          weight=False, remove_total_weight=False)\n\n  Randomly generate successful paths in an FST.\n\n  This operation randomly generates a set of successful paths in the input FST.\n  This relies on a mechanism for selecting arcs, specified using the `select`\n  argument. The default selector, \"uniform\", randomly selects a transition\n  using a uniform distribution. The \"log_prob\" selector randomly selects a\n  transition w.r.t. the weights treated as negative log probabilities after\n  normalizing for the total weight leaving the state. In all cases, finality is\n  treated as a transition to a super-final state.\n\n  Args:\n    ifst: The input FST.\n    npath: The number of random paths to generate.\n    seed: An optional seed value for random path generation; if zero, the\n        current time and process ID is used.\n    select: A string matching a known random arc selection type; one of:\n        \"uniform\", \"log_prob\", \"fast_log_prob\".\n    max_length: The maximum length of each random path.\n    weighted: Should the output be weighted by path count?\n    remove_total_weight: Should the total weight be removed (ignored when\n        `weighted` is False)?\n\n  Returns:\n    An FST containing one or more random paths.\n\n  See also: `randequivalent`.\n  \"\"\"\n  cdef fst.RandArcSelection ras = _get_rand_arc_selection(tostring(select))\n  cdef unique_ptr[fst.RandGenOptions[fst.RandArcSelection]] opts\n  opts.reset(new fst.RandGenOptions[fst.RandArcSelection](ras, max_length,\n                                                          npath, weighted,\n                                                          remove_total_weight))\n  cdef unique_ptr[fst.VectorFstClass] tfst\n  tfst.reset(new fst.VectorFstClass(ifst.arc_type()))\n  if seed == 0:\n    seed = time(NULL) + getpid()\n  fst.RandGen(deref(ifst._fst), tfst.get(), seed, deref(opts))\n  return _init_MutableFst(tfst.release())\n\n\ncpdef _MutableFst replace(pairs,\n                          call_arc_labeling=b\"input\",\n                          return_arc_labeling=b\"neither\",\n                          bool epsilon_on_replace=False,\n                          int64 return_label=0):\n  \"\"\"\n  replace(pairs, call_arc_labeling=\"input\", return_arc_labeling=\"neither\",\n          epsilon_on_replace=False, return_label=0)\n\n  Recursively replaces arcs in the FST with other FST(s).\n\n  This operation performs the dynamic replacement of arcs in one FST with\n  another FST, allowing the definition of FSTs analogous to RTNs. It takes as\n  input a set of pairs of a set of pairs formed by a non-terminal label and\n  its corresponding FST, and a label identifying the root FST in that set.\n  The resulting FST is obtained by taking the root FST and recursively replacing\n  each arc having a nonterminal as output label by its corresponding FST. More\n  precisely, an arc from state s to state d with (nonterminal) output label n in\n  this FST is replaced by redirecting this \"call\" arc to the initial state of a\n  copy F of the FST for n, and adding \"return\" arcs from each final state of F\n  to d. Optional arguments control how the call and return arcs are labeled; by\n  default, the only non-epsilon label is placed on the call arc.\n\n  Args:\n\n    pairs: An iterable of (nonterminal label, FST) pairs, where the former is an\n        unsigned integer and the latter is an Fst instance.\n    call_arc_labeling: A string indicating which call arc labels should be\n        non-epsilon. One of: \"input\" (default), \"output\", \"both\", \"neither\".\n        This value is set to \"neither\" if epsilon_on_replace is True.\n    return_arc_labeling: A string indicating which return arc labels should be\n        non-epsilon. One of: \"input\", \"output\", \"both\", \"neither\" (default).\n        This value is set to \"neither\" if epsilon_on_replace is True.\n    epsilon_on_replace: Should call and return arcs be epsilon arcs? If True,\n        this effectively overrides call_arc_labeling and return_arc_labeling,\n        setting both to \"neither\".\n    return_label: The integer label for return arcs.\n\n  Returns:\n    An FST resulting from expanding the input RTN.\n  \"\"\"\n  cdef vector[fst.LabelFstClassPair] _pairs\n  cdef int64 root_label\n  cdef int64 label\n  cdef _Fst ifst\n  it = iter(pairs)\n  (root_label, ifst) = next(it)\n  _pairs.push_back(fst.LabelFstClassPair(root_label, ifst._fst.get()))\n  cdef unique_ptr[fst.VectorFstClass] tfst\n  tfst.reset(new fst.VectorFstClass(ifst.arc_type()))\n  for (label, ifst) in it:\n    _pairs.push_back(fst.LabelFstClassPair(label, ifst._fst.get()))\n  cdef fst.ReplaceLabelType cal = _get_replace_label_type(\n      tostring(call_arc_labeling), epsilon_on_replace)\n  cdef fst.ReplaceLabelType ral = _get_replace_label_type(\n      tostring(return_arc_labeling), epsilon_on_replace)\n  cdef unique_ptr[fst.ReplaceOptions] opts\n  opts.reset(new fst.ReplaceOptions(root_label, cal, ral, return_label))\n  fst.Replace(_pairs, tfst.get(), deref(opts))\n  return _init_MutableFst(tfst.release())\n\n\ncpdef _MutableFst reverse(_Fst ifst, bool require_superinitial=True):\n  \"\"\"\n  reverse(ifst, require_superinitial=True)\n\n  Constructively reverses an FST's transduction.\n\n  This operation reverses an FST. If A transduces string x to y with weight a,\n  then the reverse of A transduces the reverse of x to the reverse of y with\n  weight a.Reverse(). (Typically, a = a.Reverse() and Arc = RevArc, e.g.,\n  TropicalWeight and LogWeight.) In general, e.g., when the weights only form a\n  left or right semiring, the output arc type must match the input arc type.\n\n  Args:\n    ifst: The input FST.\n    require_superinitial: Should a superinitial state be created?\n\n  Returns:\n    A reversed FST.\n  \"\"\"\n  cdef unique_ptr[fst.VectorFstClass] tfst\n  tfst.reset(new fst.VectorFstClass(ifst.arc_type()))\n  fst.Reverse(deref(ifst._fst), tfst.get(), require_superinitial)\n  return _init_MutableFst(tfst.release())\n\n\n# Pure C++ helper for shortestdistance.\n\n\ncdef vector[fst.WeightClass] *_shortestdistance(_Fst ifst,\n                                                float delta=fst.kShortestDelta,\n                                                int64 nstate=fst.kNoStateId,\n                                                queue_type=b\"auto\",\n                                                bool reverse=False) except *:\n  cdef unique_ptr[vector[fst.WeightClass]] distance\n  distance.reset(new vector[fst.WeightClass]())\n  # For scoping reasons, these have to be declared here even though they may\n  # not be used in all cases.\n  cdef unique_ptr[fst.ShortestDistanceOptions] opts\n  if reverse:\n    # Only the simpler signature supports shortest distance to final states;\n    # `nstate` and `queue_type` arguments are ignored.\n    fst.ShortestDistance(deref(ifst._fst), distance.get(), True, delta)\n  else:\n    opts.reset(new fst.ShortestDistanceOptions(\n        _get_queue_type(tostring(queue_type)), fst.ANY_ARC_FILTER, nstate,\n        delta))\n    fst.ShortestDistance(deref(ifst._fst), distance.get(), deref(opts))\n  return distance.release()\n\n\ndef shortestdistance(_Fst ifst,\n                     float delta=fst.kShortestDelta,\n                     int64 nstate=fst.kNoStateId,\n                     queue_type=b\"auto\",\n                     bool reverse=False):\n  \"\"\"\n  shortestdistance(ifst, delta=1e-6, nstate=NO_STATE_ID,\n                   queue_type=\"auto\", reverse=False)\n\n  Compute the shortest distance from the initial or final state.\n\n  This operation computes the shortest distance from the initial state (when\n  `reverse` is False) or from every state to the final state (when `reverse` is\n  True). The shortest distance from p to q is the \\otimes-sum of the weights of\n  all the paths between p and q. The weights must be right (if `reverse` is\n  False) or left (if `reverse` is True) distributive, and k-closed (i.e., 1\n  \\otimes x \\otimes x^2 \\otimes ... \\otimes x^{k + 1} = 1 \\otimes x \\otimes x^2\n  \\otimes ... \\otimes x^k; e.g., TropicalWeight).\n\n  Args:\n    ifst: The input FST.\n    delta: Comparison/quantization delta.\n    nstate: State number threshold (ignored if `reverse` is True).\n    queue_type: A string matching a known queue type; one of: \"auto\", \"fifo\",\n        \"lifo\", \"shortest\", \"state\", \"top\" (ignored if `reverse` is True).\n    reverse: Should the reverse distance (from each state to the final state)\n        be computed?\n\n  Returns:\n    A list of Weight objects representing the shortest distance for each state.\n  \"\"\"\n  cdef unique_ptr[vector[fst.WeightClass]] distance\n  distance.reset(_shortestdistance(ifst, delta, nstate, queue_type, reverse))\n  cdef string weight_type = ifst.weight_type()\n  return [Weight(weight_type, weight.ToString()) for weight in deref(distance)]\n\n\ncpdef _MutableFst shortestpath(_Fst ifst,\n                               float delta=fst.kShortestDelta,\n                               int32 nshortest=1,\n                               int64 nstate=fst.kNoStateId,\n                               queue_type=b\"auto\",\n                               bool unique=False,\n                               weight=None):\n  \"\"\"\n  shortestpath(ifst, delta=1e-6, nshortest=1, nstate=NO_STATE_ID,\n               queue_type=\"auto\", unique=False, weight=None)\n\n  Construct an FST containing the shortest path(s) in the input FST.\n\n  This operation produces an FST containing the n-shortest paths in the input\n  FST. The n-shortest paths are the n-lowest weight paths w.r.t. the natural\n  semiring order. The single path that can be read from the ith of at most n\n  transitions leaving the initial state of the resulting FST is the ith\n  shortest path. The weights need to be right distributive and have the path\n  property. They also need to be left distributive as well for n-shortest with\n  n > 1 (e.g., TropicalWeight).\n\n  Args:\n    ifst: The input FST.\n    delta: Comparison/quantization delta.\n    nshortest: The number of paths to return.\n    nstate: State number threshold.\n    queue_type: A string matching a known queue type; one of: \"auto\", \"fifo\",\n        \"lifo\", \"shortest\", \"state\", \"top\".\n    unique: Should the resulting FST only contain distinct paths? (Requires\n        the input FST to be an acceptor; epsilons are treated as if they are\n        regular symbols.)\n    weight: A Weight or weight string indicating the desired weight threshold\n        below which paths are pruned; if omitted, no paths are pruned.\n\n  Returns:\n    An FST containing the n-shortest paths.\n  \"\"\"\n  cdef unique_ptr[fst.VectorFstClass] tfst\n  tfst.reset(new fst.VectorFstClass(ifst.arc_type()))\n  # Threshold is set to semiring Zero (no pruning) if no weight is specified.\n  cdef fst.WeightClass wc = _get_WeightClass_or_Zero(ifst.weight_type(), weight)\n  cdef unique_ptr[fst.ShortestPathOptions] opts\n  opts.reset(new fst.ShortestPathOptions(_get_queue_type(tostring(queue_type)),\n                                         nshortest, unique, delta, wc, nstate))\n  fst.ShortestPath(deref(ifst._fst), tfst.get(), deref(opts))\n  return _init_MutableFst(tfst.release())\n\n\ncpdef _Fst statemap(_Fst ifst, map_type):\n  \"\"\"\n  state_map(ifst, map_type)\n\n  Constructively applies a transform to all states.\n\n  This operation transforms each state according to the requested map type.\n  Note that currently, only one state-mapping operation is supported.\n\n  Args:\n    ifst: The input FST.\n    map_type: A string matching a known mapping operation; one of: \"arc_sum\"\n        (sum weights of identically-labeled multi-arcs), \"arc_unique\" (deletes\n        non-unique identically-labeled multi-arcs).\n\n  Returns:\n    An FST with states remapped.\n\n  Raises:\n    FstArgError: Unknown map type.\n\n  See also: `arcmap`.\n  \"\"\"\n  return _map(ifst, fst.kDelta, map_type, 1., None)\n\n\ncpdef _MutableFst synchronize(_Fst ifst):\n  \"\"\"\n  synchronize(ifst)\n\n  Constructively synchronizes an FST.\n\n  This operation synchronizes a transducer. The result will be an equivalent\n  FST that has the property that during the traversal of a path, the delay is\n  either zero or strictly increasing, where the delay is the difference between\n  the number of non-epsilon output labels and input labels along the path. For\n  the algorithm to terminate, the input transducer must have bounded delay,\n  i.e., the delay of every cycle must be zero.\n\n  Args:\n    ifst: The input FST.\n\n  Returns:\n    An equivalent synchronized FST.\n  \"\"\"\n  cdef unique_ptr[fst.VectorFstClass] tfst\n  tfst.reset(new fst.VectorFstClass(ifst.arc_type()))\n  fst.Synchronize(deref(ifst._fst), tfst.get())\n  return _init_MutableFst(tfst.release())\n\n\n## Compiler.\n\n\ncdef class Compiler(object):\n\n  \"\"\"\n  Compiler(fst_type=\"vector\", arc_type=\"standard\", isymbols=None,\n           osymbols=None, ssymbols=None, acceptor=False, keep_isymbols=False,\n           keep_osymbols=False, keep_state_numbering=False,\n           allow_negative_labels=False)\n\n  Class used to compile FSTs from strings.\n\n  This class is used to compile FSTs specified using the AT&T FSM library\n  format described here:\n\n  http://web.eecs.umich.edu/~radev/NLP-fall2015/resources/fsm_archive/fsm.5.html\n\n  This is the same format used by the `fstcompile` executable.\n\n  Compiler options (symbol tables, etc.) are set at construction time.\n\n      compiler = fst.Compiler(isymbols=ascii_syms, osymbols=ascii_syms)\n\n  Once constructed, Compiler instances behave like a file handle opened for\n  writing:\n\n      # /ba+/\n      print >> compiler, \"0 1 50 50\"\n      print >> compiler, \"1 2 49 49\"\n      print >> compiler, \"2 2 49 49\"\n      print >> compiler, \"2\"\n\n  The `compile` method returns an actual FST instance:\n\n      sheep_machine = compiler.compile()\n\n  Compilation flushes the internal buffer, so the compiler instance can be\n  reused to compile new machines with the same symbol tables (etc.)\n\n  Args:\n    fst_type: A string indicating the container type for the compiled FST.\n    arc_type: A string indicating the arc type for the compiled FST.\n    isymbols: An optional SymbolTable used to label input symbols.\n    osymbols: An optional SymbolTable used to label output symbols.\n    ssymbols: An optional SymbolTable used to label states.\n    acceptor: Should the FST be rendered in acceptor format if possible?\n    keep_isymbols: Should the input symbol table be stored in the FST?\n    keep_osymbols: Should the output symbol table be stored in the FST?\n    keep_state_numbering: Should the state numbering be preserved?\n    allow_negative_labels: Should negative labels be allowed? (Not\n        recommended; may cause conflicts).\n  \"\"\"\n\n  def __cinit__(self,\n                string fst_type=b\"vector\",\n                string arc_type=b\"standard\",\n                SymbolTable isymbols=None,\n                SymbolTable osymbols=None,\n                SymbolTable ssymbols=None,\n                bool acceptor=False,\n                bool keep_isymbols=False,\n                bool keep_osymbols=False,\n                bool keep_state_numbering=False,\n                bool allow_negative_labels=False):\n    self._sstrm.reset(new stringstream())\n    self._fst_type = tostring(fst_type)\n    self._arc_type = tostring(arc_type)\n    self._isymbols = NULL\n    if isymbols is not None:\n      self._isymbols = isymbols._table\n    self._osymbols = NULL\n    if osymbols is not None:\n      self._osymbols = osymbols._table\n    self._ssymbols = NULL\n    if ssymbols is not None:\n      self._ssymbols = ssymbols._table\n    self._acceptor = acceptor\n    self._keep_isymbols = keep_isymbols\n    self._keep_osymbols = keep_osymbols\n    self._keep_state_numbering = keep_state_numbering\n    self._allow_negative_labels = allow_negative_labels\n\n  cpdef _Fst compile(self):\n    \"\"\"\n    compile()\n\n    Compiles the FST in the compiler string buffer.\n\n    This method compiles the FST and returns the resulting machine.\n\n    Returns:\n      The FST described by the compiler string buffer.\n\n    Raises:\n      FstOpError: Compilation failed.\n    \"\"\"\n    cdef unique_ptr[fst.FstClass] tfst\n    tfst.reset(fst.CompileFstInternal(deref(self._sstrm),\n        b\"<pywrapfst>\", self._fst_type, self._arc_type, self._isymbols,\n        self._osymbols, self._ssymbols, self._acceptor, self._keep_isymbols,\n        self._keep_osymbols, self._keep_state_numbering,\n        self._allow_negative_labels))\n    self._sstrm.reset(new stringstream())\n    if tfst.get() == NULL:\n      raise FstOpError(\"Compilation failed\")\n    return _init_XFst(tfst.release())\n\n  cpdef void write(self, expression):\n    \"\"\"\n    write(expression)\n\n    Writes a string into the compiler string buffer.\n\n    This method adds a line to the compiler string buffer. It is normally\n    invoked using the right shift operator, like so:\n\n        compiler = fst.Compiler()\n        print >> compiler, \"0 0 49 49\"\n        print >> compiler, \"0\"\n\n    Args:\n      expression: A string expression to add to compiler string buffer.\n    \"\"\"\n    deref(self._sstrm) << tostring(expression)\n\n\n## FarReader and FarWriter.\n\n\ncdef class FarReader(object):\n\n  \"\"\"\n  (No constructor.)\n\n  FAR (\"Fst ARchive\") reader object.\n\n  This class is used to read a FAR from disk. FARs contain one or more FSTs (of\n  the same arc type) indexed by a unique string key. To construct a FarReader\n  object, use the `open` class method.\n\n  Attributes:\n    arc_type: A string indicating the arc type.\n    far_type: A string indicating the FAR type.\n  \"\"\"\n\n  def __init__(self):\n    raise FstDeletedConstructorError(\n        \"Cannot construct {}\".format(self.__class__.__name__))\n\n  def __repr__(self):\n    return \"<{} FarReader at 0x{:x}>\".format(self.far_type(), id(self))\n\n  @classmethod\n  def open(cls, *filenames):\n    \"\"\"\n    FarReader.open(*filenames)\n\n    Creates a FarReader object.\n\n    This class method creates a FarReader given the string location of one or\n    more FAR files on disk.\n\n    Args:\n      *filenames: The string location of one or more input FAR files.\n\n    Returns:\n      A new FarReader instance.\n\n    Raises:\n      FstIOError: Read failed.\n    \"\"\"\n    filenames = [tostring(filename) for filename in filenames]\n    cdef unique_ptr[fst.FarReaderClass] tfar\n    tfar.reset(fst.FarReaderClass.Open(filenames))\n    if tfar.get() == NULL:\n      raise FstIOError(\"Read failed: {!r}\".format(filenames))\n    cdef FarReader result = FarReader.__new__(FarReader)\n    result._reader.reset(tfar.release())\n    return result\n\n  cpdef string arc_type(self):\n    \"\"\"\n    arc_type(self)\n\n    Returns a string indicating the arc type.\n    \"\"\"\n    return self._reader.get().ArcType()\n\n  cpdef bool done(self):\n    \"\"\"\n    done(self)\n\n    Indicates whether the iterator is exhausted or not.\n\n    Returns:\n      True if the iterator is exhausted, False otherwise.\n    \"\"\"\n    return self._reader.get().Done()\n\n  cpdef bool error(self):\n    \"\"\"\n    error(self)\n\n    Indicates whether the FarReader has encountered an error.\n\n    Returns:\n      True if the FarReader is in an errorful state, False otherwise.\n    \"\"\"\n    return self._reader.get().Error()\n\n  cpdef string far_type(self):\n    return fst.GetFarTypeString(self._reader.get().Type())\n\n  cpdef bool find(self, key) except *:\n    \"\"\"\n    find(self, key)\n\n    Sets the current position to the first entry greater than or equal to the\n    key (a string) and indicates whether or not a match was found.\n\n    Args:\n      key: A string key.\n\n    Returns:\n      True if the key was found, False otherwise.\n    \"\"\"\n    return self._reader.get().Find(tostring(key))\n\n  cpdef _Fst get_fst(self):\n    \"\"\"\n    get_fst(self)\n\n    Returns the FST at the current position.\n\n    Returns:\n      A copy of the FST at the current position.\n    \"\"\"\n    return _init_XFst(new fst.FstClass(\n        deref(self._reader.get().GetFstClass())))\n\n  cpdef string get_key(self):\n    \"\"\"\n    get_key(self)\n\n    Returns the string key at the current position.\n\n    Returns:\n      The string key at the current position.\n    \"\"\"\n    return self._reader.get().GetKey()\n\n  cpdef void next(self):\n    \"\"\"\n    next(self)\n\n    Advances the iterator.\n    \"\"\"\n    self._reader.get().Next()\n\n  cpdef void reset(self):\n    \"\"\"\n    reset(self)\n\n    Resets the iterator to the initial position.\n    \"\"\"\n    self._reader.get().Reset()\n\n  def __getitem__(self, key):\n    cdef string ckey = tostring(key)\n    if self.get_key() == ckey or self._reader.get().Find(ckey):\n      return self.get_fst()\n    raise KeyError(key)\n\n\ncdef class FarWriter(object):\n\n  \"\"\"\n  (No constructor.)\n\n  FAR (\"Fst ARchive\") writer object.\n\n  This class is used to write FSTs (of the same arc type) to a FAR on disk. To\n  construct a FarWriter, use the `create` class method.\n\n  Note that the data is not guaranteed to flush to disk until the FarWriter\n  is garbage-collected. If a FarWriter has been assigned to only one variable,\n  then calling `del` on that variable should decrement the object's reference\n  count from 1 to 0, triggering a flush to disk on the next GC cycle.\n\n  Attributes:\n    arc_type: A string indicating the arc type.\n    far_type: A string indicating the FAR type.\n  \"\"\"\n\n  def __init__(self):\n    raise FstDeletedConstructorError(\n        \"Cannot construct {}\".format(self.__class__.__name__))\n\n  def __repr__(self):\n    return \"<{} FarWriter at 0x{:x}>\".format(self.far_type(), id(self))\n\n  @classmethod\n  def create(cls, filename, arc_type=b\"standard\", far_type=b\"default\"):\n    \"\"\"\n    FarWriter.\n\n    Creates a FarWriter object.\n\n    This class method creates a FarWriter given the desired output location,\n    arc type, and FAR type.\n\n    Args:\n      filename: The string location for the output FAR files.\n      arc_type: A string indicating the arc type.\n      far_type: A string indicating the FAR type; one of: \"fst\", \"stlist\",\n          \"sttable\", \"sstable\", \"default\".\n\n    Returns:\n      A new FarWriter instance.\n\n    Raises:\n      FstIOError: Read failed.\n    \"\"\"\n    cdef fst.FarType ft = fst.GetFarType(tostring(far_type))\n    cdef fst.FarWriterClass *tfar = fst.FarWriterClass.Create(\n        tostring(filename), tostring(arc_type), ft)\n    if tfar == NULL:\n      raise FstIOError(\"Open failed: {!r}\".format(filename))\n    cdef FarWriter result = FarWriter.__new__(FarWriter)\n    result._writer.reset(tfar)\n    return result\n\n  # NB: Invoking this method may be dangerous: calling any other method on the\n  # instance after this is invoked may result in a null dereference.\n  cdef void close(self):\n    self._writer.reset()\n\n  cpdef void add(self, key, _Fst ifst) except *:\n    \"\"\"\n    add(self, key, ifst)\n\n    Adds an FST to the FAR.\n\n    This method adds an FST to the FAR which can be retrieved with the\n    specified string key.\n\n    Args:\n      key: The string used to key the input FST.\n      ifst: The FST to write to the FAR.\n\n    Raises:\n      FstArgError: Key out of order.\n      FstOpError: Incompatible or invalid arc type.\n    \"\"\"\n    # Failure here results from passing an FST with a different arc type than\n    # used by the FAR was initialized to use.\n    if not self._writer.get().Add(tostring(key), deref(ifst._fst)):\n      raise FstOpError(\"Incompatible or invalid arc type\")\n    # An error here usually indicates a key out of order.\n    if self._writer.get().Error():\n      raise FstArgError(\"Key out of order\")\n\n  cpdef string arc_type(self):\n    \"\"\"\n    arc_type(self)\n\n    Returns a string indicating the arc type.\n    \"\"\"\n    return self._writer.get().ArcType()\n\n  cpdef bool error(self):\n    \"\"\"\n    error(self)\n\n    Indicates whether the FarWriter has encountered an error.\n\n    Returns:\n      True if the FarWriter is in an errorful state, False otherwise.\n    \"\"\"\n    return self._writer.get().Error()\n\n  cpdef string far_type(self):\n    \"\"\"\n    far_type(self)\n\n    Returns a string indicating the FAR type.\n    \"\"\"\n    return fst.GetFarTypeString(self._writer.get().Type())\n\n  # Dictionary-like assignment.\n  def __setitem__(self, key, _Fst fst):\n    self.add(key, fst)\n\n\n## Cleanup operations for module entrance and exit.\n\n\n# Masks fst_error_fatal flags while this module is running, returning to the\n# previous state upon module exit.\n\n\n_fst_error_fatal_old = fst.FLAGS_fst_error_fatal\nfst.FLAGS_fst_error_fatal = False\n\n\n@atexit.register\ndef _reset_fst_error_fatal():\n  fst.FLAGS_fst_error_fatal = _fst_error_fatal_old\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/extensions/special/Makefile.am",
    "content": "AM_CPPFLAGS = -I$(srcdir)/../../include $(ICU_CPPFLAGS)\n\nif HAVE_BIN\nbin_PROGRAMS = fstspecial\n\nLDADD = ../../script/libfstscript.la \\\n        ../../lib/libfst.la -lm $(DL_LIBS)\n\nfstspecial_SOURCES = ../../bin/fstconvert.cc ../../bin/fstconvert-main.cc \\\n                     phi-fst.cc rho-fst.cc sigma-fst.cc\nfstspecial_CPPFLAGS = $(AM_CPPFLAGS)\nendif\n\nlibfstdir = @libfstdir@\nlibfst_LTLIBRARIES = phi-fst.la rho-fst.la sigma-fst.la\n\nlib_LTLIBRARIES = libfstspecial.la\n\nlibfstspecial_la_SOURCES = phi-fst.cc rho-fst.cc sigma-fst.cc\nlibfstspecial_la_LDFLAGS = -version-info 10:0:0 -lm $(DL_LIBS)\nlibfstspecial_la_LIBADD = ../../lib/libfst.la -lm $(DL_LIBS)\n\nphi_fst_la_SOURCES = phi-fst.cc\nphi_fst_la_LDFLAGS = -module\nphi_fst_la_LIBADD = ../../lib/libfst.la -lm $(DL_LIBS)\n\nrho_fst_la_SOURCES = rho-fst.cc\nrho_fst_la_LDFLAGS = -module\nrho_fst_la_LIBADD = ../../lib/libfst.la -lm $(DL_LIBS)\n\nsigma_fst_la_SOURCES = sigma-fst.cc\nsigma_fst_la_LDFLAGS = -module\nsigma_fst_la_LIBADD = ../../lib/libfst.la -lm $(DL_LIBS)\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/extensions/special/Makefile.in",
    "content": "# Makefile.in generated by automake 1.14.1 from Makefile.am.\n# @configure_input@\n\n# Copyright (C) 1994-2013 Free Software Foundation, Inc.\n\n# This Makefile.in is free software; the Free Software Foundation\n# gives unlimited permission to copy and/or distribute it,\n# with or without modifications, as long as this notice is preserved.\n\n# This program is distributed in the hope that it will be useful,\n# but WITHOUT ANY WARRANTY, to the extent permitted by law; without\n# even the implied warranty of MERCHANTABILITY or FITNESS FOR A\n# PARTICULAR PURPOSE.\n\n@SET_MAKE@\n\n\nVPATH = @srcdir@\nam__is_gnu_make = test -n '$(MAKEFILE_LIST)' && test -n '$(MAKELEVEL)'\nam__make_running_with_option = \\\n  case $${target_option-} in \\\n      ?) ;; \\\n      *) echo \"am__make_running_with_option: internal error: invalid\" \\\n              \"target option '$${target_option-}' specified\" >&2; \\\n         exit 1;; \\\n  esac; \\\n  has_opt=no; \\\n  sane_makeflags=$$MAKEFLAGS; \\\n  if $(am__is_gnu_make); then \\\n    sane_makeflags=$$MFLAGS; \\\n  else \\\n    case $$MAKEFLAGS in \\\n      *\\\\[\\ \\\t]*) \\\n        bs=\\\\; \\\n        sane_makeflags=`printf '%s\\n' \"$$MAKEFLAGS\" \\\n          | sed \"s/$$bs$$bs[$$bs $$bs\t]*//g\"`;; \\\n    esac; \\\n  fi; \\\n  skip_next=no; \\\n  strip_trailopt () \\\n  { \\\n    flg=`printf '%s\\n' \"$$flg\" | sed \"s/$$1.*$$//\"`; \\\n  }; \\\n  for flg in $$sane_makeflags; do \\\n    test $$skip_next = yes && { skip_next=no; continue; }; \\\n    case $$flg in \\\n      *=*|--*) continue;; \\\n        -*I) strip_trailopt 'I'; skip_next=yes;; \\\n      -*I?*) strip_trailopt 'I';; \\\n        -*O) strip_trailopt 'O'; skip_next=yes;; \\\n      -*O?*) strip_trailopt 'O';; \\\n        -*l) strip_trailopt 'l'; skip_next=yes;; \\\n      -*l?*) strip_trailopt 'l';; \\\n      -[dEDm]) skip_next=yes;; \\\n      -[JT]) skip_next=yes;; \\\n    esac; \\\n    case $$flg in \\\n      *$$target_option*) has_opt=yes; break;; \\\n    esac; \\\n  done; \\\n  test $$has_opt = yes\nam__make_dryrun = (target_option=n; $(am__make_running_with_option))\nam__make_keepgoing = (target_option=k; $(am__make_running_with_option))\npkgdatadir = $(datadir)/@PACKAGE@\npkgincludedir = $(includedir)/@PACKAGE@\npkglibdir = $(libdir)/@PACKAGE@\npkglibexecdir = $(libexecdir)/@PACKAGE@\nam__cd = CDPATH=\"$${ZSH_VERSION+.}$(PATH_SEPARATOR)\" && cd\ninstall_sh_DATA = $(install_sh) -c -m 644\ninstall_sh_PROGRAM = $(install_sh) -c\ninstall_sh_SCRIPT = $(install_sh) -c\nINSTALL_HEADER = $(INSTALL_DATA)\ntransform = $(program_transform_name)\nNORMAL_INSTALL = :\nPRE_INSTALL = :\nPOST_INSTALL = :\nNORMAL_UNINSTALL = :\nPRE_UNINSTALL = :\nPOST_UNINSTALL = :\nbuild_triplet = @build@\nhost_triplet = @host@\n@HAVE_BIN_TRUE@bin_PROGRAMS = fstspecial$(EXEEXT)\nsubdir = src/extensions/special\nDIST_COMMON = $(srcdir)/Makefile.in $(srcdir)/Makefile.am \\\n\t$(top_srcdir)/depcomp\nACLOCAL_M4 = $(top_srcdir)/aclocal.m4\nam__aclocal_m4_deps = $(top_srcdir)/m4/ac_python_devel.m4 \\\n\t$(top_srcdir)/m4/libtool.m4 $(top_srcdir)/m4/ltoptions.m4 \\\n\t$(top_srcdir)/m4/ltsugar.m4 $(top_srcdir)/m4/ltversion.m4 \\\n\t$(top_srcdir)/m4/lt~obsolete.m4 $(top_srcdir)/configure.ac\nam__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \\\n\t$(ACLOCAL_M4)\nmkinstalldirs = $(install_sh) -d\nCONFIG_HEADER = $(top_builddir)/config.h \\\n\t$(top_builddir)/src/include/fst/config.h\nCONFIG_CLEAN_FILES =\nCONFIG_CLEAN_VPATH_FILES =\nam__vpath_adj_setup = srcdirstrip=`echo \"$(srcdir)\" | sed 's|.|.|g'`;\nam__vpath_adj = case $$p in \\\n    $(srcdir)/*) f=`echo \"$$p\" | sed \"s|^$$srcdirstrip/||\"`;; \\\n    *) f=$$p;; \\\n  esac;\nam__strip_dir = f=`echo $$p | sed -e 's|^.*/||'`;\nam__install_max = 40\nam__nobase_strip_setup = \\\n  srcdirstrip=`echo \"$(srcdir)\" | sed 's/[].[^$$\\\\*|]/\\\\\\\\&/g'`\nam__nobase_strip = \\\n  for p in $$list; do echo \"$$p\"; done | sed -e \"s|$$srcdirstrip/||\"\nam__nobase_list = $(am__nobase_strip_setup); \\\n  for p in $$list; do echo \"$$p $$p\"; done | \\\n  sed \"s| $$srcdirstrip/| |;\"' / .*\\//!s/ .*/ ./; s,\\( .*\\)/[^/]*$$,\\1,' | \\\n  $(AWK) 'BEGIN { files[\".\"] = \"\" } { files[$$2] = files[$$2] \" \" $$1; \\\n    if (++n[$$2] == $(am__install_max)) \\\n      { print $$2, files[$$2]; n[$$2] = 0; files[$$2] = \"\" } } \\\n    END { for (dir in files) print dir, files[dir] }'\nam__base_list = \\\n  sed '$$!N;$$!N;$$!N;$$!N;$$!N;$$!N;$$!N;s/\\n/ /g' | \\\n  sed '$$!N;$$!N;$$!N;$$!N;s/\\n/ /g'\nam__uninstall_files_from_dir = { \\\n  test -z \"$$files\" \\\n    || { test ! -d \"$$dir\" && test ! -f \"$$dir\" && test ! -r \"$$dir\"; } \\\n    || { echo \" ( cd '$$dir' && rm -f\" $$files \")\"; \\\n         $(am__cd) \"$$dir\" && rm -f $$files; }; \\\n  }\nam__installdirs = \"$(DESTDIR)$(libdir)\" \"$(DESTDIR)$(libfstdir)\" \\\n\t\"$(DESTDIR)$(bindir)\"\nLTLIBRARIES = $(lib_LTLIBRARIES) $(libfst_LTLIBRARIES)\nam__DEPENDENCIES_1 =\nlibfstspecial_la_DEPENDENCIES = ../../lib/libfst.la \\\n\t$(am__DEPENDENCIES_1)\nam_libfstspecial_la_OBJECTS = phi-fst.lo rho-fst.lo sigma-fst.lo\nlibfstspecial_la_OBJECTS = $(am_libfstspecial_la_OBJECTS)\nAM_V_lt = $(am__v_lt_@AM_V@)\nam__v_lt_ = $(am__v_lt_@AM_DEFAULT_V@)\nam__v_lt_0 = --silent\nam__v_lt_1 = \nlibfstspecial_la_LINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX \\\n\t$(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=link $(CXXLD) \\\n\t$(AM_CXXFLAGS) $(CXXFLAGS) $(libfstspecial_la_LDFLAGS) \\\n\t$(LDFLAGS) -o $@\nphi_fst_la_DEPENDENCIES = ../../lib/libfst.la $(am__DEPENDENCIES_1)\nam_phi_fst_la_OBJECTS = phi-fst.lo\nphi_fst_la_OBJECTS = $(am_phi_fst_la_OBJECTS)\nphi_fst_la_LINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \\\n\t$(LIBTOOLFLAGS) --mode=link $(CXXLD) $(AM_CXXFLAGS) \\\n\t$(CXXFLAGS) $(phi_fst_la_LDFLAGS) $(LDFLAGS) -o $@\nrho_fst_la_DEPENDENCIES = ../../lib/libfst.la $(am__DEPENDENCIES_1)\nam_rho_fst_la_OBJECTS = rho-fst.lo\nrho_fst_la_OBJECTS = $(am_rho_fst_la_OBJECTS)\nrho_fst_la_LINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \\\n\t$(LIBTOOLFLAGS) --mode=link $(CXXLD) $(AM_CXXFLAGS) \\\n\t$(CXXFLAGS) $(rho_fst_la_LDFLAGS) $(LDFLAGS) -o $@\nsigma_fst_la_DEPENDENCIES = ../../lib/libfst.la $(am__DEPENDENCIES_1)\nam_sigma_fst_la_OBJECTS = sigma-fst.lo\nsigma_fst_la_OBJECTS = $(am_sigma_fst_la_OBJECTS)\nsigma_fst_la_LINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \\\n\t$(LIBTOOLFLAGS) --mode=link $(CXXLD) $(AM_CXXFLAGS) \\\n\t$(CXXFLAGS) $(sigma_fst_la_LDFLAGS) $(LDFLAGS) -o $@\nPROGRAMS = $(bin_PROGRAMS)\nam__fstspecial_SOURCES_DIST = ../../bin/fstconvert.cc \\\n\t../../bin/fstconvert-main.cc phi-fst.cc rho-fst.cc \\\n\tsigma-fst.cc\nam__dirstamp = $(am__leading_dot)dirstamp\n@HAVE_BIN_TRUE@am_fstspecial_OBJECTS =  \\\n@HAVE_BIN_TRUE@\t../../bin/fstspecial-fstconvert.$(OBJEXT) \\\n@HAVE_BIN_TRUE@\t../../bin/fstspecial-fstconvert-main.$(OBJEXT) \\\n@HAVE_BIN_TRUE@\tfstspecial-phi-fst.$(OBJEXT) \\\n@HAVE_BIN_TRUE@\tfstspecial-rho-fst.$(OBJEXT) \\\n@HAVE_BIN_TRUE@\tfstspecial-sigma-fst.$(OBJEXT)\nfstspecial_OBJECTS = $(am_fstspecial_OBJECTS)\nfstspecial_LDADD = $(LDADD)\n@HAVE_BIN_TRUE@fstspecial_DEPENDENCIES = ../../script/libfstscript.la \\\n@HAVE_BIN_TRUE@\t../../lib/libfst.la $(am__DEPENDENCIES_1)\nAM_V_P = $(am__v_P_@AM_V@)\nam__v_P_ = $(am__v_P_@AM_DEFAULT_V@)\nam__v_P_0 = false\nam__v_P_1 = :\nAM_V_GEN = $(am__v_GEN_@AM_V@)\nam__v_GEN_ = $(am__v_GEN_@AM_DEFAULT_V@)\nam__v_GEN_0 = @echo \"  GEN     \" $@;\nam__v_GEN_1 = \nAM_V_at = $(am__v_at_@AM_V@)\nam__v_at_ = $(am__v_at_@AM_DEFAULT_V@)\nam__v_at_0 = @\nam__v_at_1 = \nDEFAULT_INCLUDES = \ndepcomp = $(SHELL) $(top_srcdir)/depcomp\nam__depfiles_maybe = depfiles\nam__mv = mv -f\nCXXCOMPILE = $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) \\\n\t$(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS)\nLTCXXCOMPILE = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \\\n\t$(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) \\\n\t$(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) \\\n\t$(AM_CXXFLAGS) $(CXXFLAGS)\nAM_V_CXX = $(am__v_CXX_@AM_V@)\nam__v_CXX_ = $(am__v_CXX_@AM_DEFAULT_V@)\nam__v_CXX_0 = @echo \"  CXX     \" $@;\nam__v_CXX_1 = \nCXXLD = $(CXX)\nCXXLINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \\\n\t$(LIBTOOLFLAGS) --mode=link $(CXXLD) $(AM_CXXFLAGS) \\\n\t$(CXXFLAGS) $(AM_LDFLAGS) $(LDFLAGS) -o $@\nAM_V_CXXLD = $(am__v_CXXLD_@AM_V@)\nam__v_CXXLD_ = $(am__v_CXXLD_@AM_DEFAULT_V@)\nam__v_CXXLD_0 = @echo \"  CXXLD   \" $@;\nam__v_CXXLD_1 = \nSOURCES = $(libfstspecial_la_SOURCES) $(phi_fst_la_SOURCES) \\\n\t$(rho_fst_la_SOURCES) $(sigma_fst_la_SOURCES) \\\n\t$(fstspecial_SOURCES)\nDIST_SOURCES = $(libfstspecial_la_SOURCES) $(phi_fst_la_SOURCES) \\\n\t$(rho_fst_la_SOURCES) $(sigma_fst_la_SOURCES) \\\n\t$(am__fstspecial_SOURCES_DIST)\nam__can_run_installinfo = \\\n  case $$AM_UPDATE_INFO_DIR in \\\n    n|no|NO) false;; \\\n    *) (install-info --version) >/dev/null 2>&1;; \\\n  esac\nam__tagged_files = $(HEADERS) $(SOURCES) $(TAGS_FILES) $(LISP)\n# Read a list of newline-separated strings from the standard input,\n# and print each of them once, without duplicates.  Input order is\n# *not* preserved.\nam__uniquify_input = $(AWK) '\\\n  BEGIN { nonempty = 0; } \\\n  { items[$$0] = 1; nonempty = 1; } \\\n  END { if (nonempty) { for (i in items) print i; }; } \\\n'\n# Make sure the list of sources is unique.  This is necessary because,\n# e.g., the same source file might be shared among _SOURCES variables\n# for different programs/libraries.\nam__define_uniq_tagged_files = \\\n  list='$(am__tagged_files)'; \\\n  unique=`for i in $$list; do \\\n    if test -f \"$$i\"; then echo $$i; else echo $(srcdir)/$$i; fi; \\\n  done | $(am__uniquify_input)`\nETAGS = etags\nCTAGS = ctags\nDISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST)\nACLOCAL = @ACLOCAL@\nAMTAR = @AMTAR@\nAM_DEFAULT_VERBOSITY = @AM_DEFAULT_VERBOSITY@\nAR = @AR@\nAUTOCONF = @AUTOCONF@\nAUTOHEADER = @AUTOHEADER@\nAUTOMAKE = @AUTOMAKE@\nAWK = @AWK@\nCC = @CC@\nCCDEPMODE = @CCDEPMODE@\nCFLAGS = @CFLAGS@\nCPP = @CPP@\nCPPFLAGS = @CPPFLAGS@\nCXX = @CXX@\nCXXCPP = @CXXCPP@\nCXXDEPMODE = @CXXDEPMODE@\nCXXFLAGS = @CXXFLAGS@\nCYGPATH_W = @CYGPATH_W@\nDEFS = @DEFS@\nDEPDIR = @DEPDIR@\nDLLTOOL = @DLLTOOL@\nDL_LIBS = @DL_LIBS@\nDSYMUTIL = @DSYMUTIL@\nDUMPBIN = @DUMPBIN@\nECHO_C = @ECHO_C@\nECHO_N = @ECHO_N@\nECHO_T = @ECHO_T@\nEGREP = @EGREP@\nEXEEXT = @EXEEXT@\nFGREP = @FGREP@\nGREP = @GREP@\nINSTALL = @INSTALL@\nINSTALL_DATA = @INSTALL_DATA@\nINSTALL_PROGRAM = @INSTALL_PROGRAM@\nINSTALL_SCRIPT = @INSTALL_SCRIPT@\nINSTALL_STRIP_PROGRAM = @INSTALL_STRIP_PROGRAM@\nLD = @LD@\nLDFLAGS = @LDFLAGS@\nLIBOBJS = @LIBOBJS@\nLIBS = @LIBS@\nLIBTOOL = @LIBTOOL@\nLIPO = @LIPO@\nLN_S = @LN_S@\nLTLIBOBJS = @LTLIBOBJS@\nMAKEINFO = @MAKEINFO@\nMANIFEST_TOOL = @MANIFEST_TOOL@\nMKDIR_P = @MKDIR_P@\nNM = @NM@\nNMEDIT = @NMEDIT@\nOBJDUMP = @OBJDUMP@\nOBJEXT = @OBJEXT@\nOTOOL = @OTOOL@\nOTOOL64 = @OTOOL64@\nPACKAGE = @PACKAGE@\nPACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@\nPACKAGE_NAME = @PACKAGE_NAME@\nPACKAGE_STRING = @PACKAGE_STRING@\nPACKAGE_TARNAME = @PACKAGE_TARNAME@\nPACKAGE_URL = @PACKAGE_URL@\nPACKAGE_VERSION = @PACKAGE_VERSION@\nPATH_SEPARATOR = @PATH_SEPARATOR@\nPYTHON = @PYTHON@\nPYTHON_CPPFLAGS = @PYTHON_CPPFLAGS@\nPYTHON_EXEC_PREFIX = @PYTHON_EXEC_PREFIX@\nPYTHON_EXTRA_LDFLAGS = @PYTHON_EXTRA_LDFLAGS@\nPYTHON_EXTRA_LIBS = @PYTHON_EXTRA_LIBS@\nPYTHON_LDFLAGS = @PYTHON_LDFLAGS@\nPYTHON_PLATFORM = @PYTHON_PLATFORM@\nPYTHON_PREFIX = @PYTHON_PREFIX@\nPYTHON_SITE_PKG = @PYTHON_SITE_PKG@\nPYTHON_VERSION = @PYTHON_VERSION@\nRANLIB = @RANLIB@\nSED = @SED@\nSET_MAKE = @SET_MAKE@\nSHELL = @SHELL@\nSTRIP = @STRIP@\nVERSION = @VERSION@\nabs_builddir = @abs_builddir@\nabs_srcdir = @abs_srcdir@\nabs_top_builddir = @abs_top_builddir@\nabs_top_srcdir = @abs_top_srcdir@\nac_ct_AR = @ac_ct_AR@\nac_ct_CC = @ac_ct_CC@\nac_ct_CXX = @ac_ct_CXX@\nac_ct_DUMPBIN = @ac_ct_DUMPBIN@\nam__include = @am__include@\nam__leading_dot = @am__leading_dot@\nam__quote = @am__quote@\nam__tar = @am__tar@\nam__untar = @am__untar@\nbindir = @bindir@\nbuild = @build@\nbuild_alias = @build_alias@\nbuild_cpu = @build_cpu@\nbuild_os = @build_os@\nbuild_vendor = @build_vendor@\nbuilddir = @builddir@\ndatadir = @datadir@\ndatarootdir = @datarootdir@\ndocdir = @docdir@\ndvidir = @dvidir@\nexec_prefix = @exec_prefix@\nhost = @host@\nhost_alias = @host_alias@\nhost_cpu = @host_cpu@\nhost_os = @host_os@\nhost_vendor = @host_vendor@\nhtmldir = @htmldir@\nincludedir = @includedir@\ninfodir = @infodir@\ninstall_sh = @install_sh@\nlibdir = @libdir@\nlibexecdir = @libexecdir@\nlibfstdir = @libfstdir@\nlocaledir = @localedir@\nlocalstatedir = @localstatedir@\nmandir = @mandir@\nmkdir_p = @mkdir_p@\noldincludedir = @oldincludedir@\npdfdir = @pdfdir@\npkgpyexecdir = @pkgpyexecdir@\npkgpythondir = @pkgpythondir@\nprefix = @prefix@\nprogram_transform_name = @program_transform_name@\npsdir = @psdir@\npyexecdir = @pyexecdir@\npythondir = @pythondir@\nsbindir = @sbindir@\nsharedstatedir = @sharedstatedir@\nsrcdir = @srcdir@\nsysconfdir = @sysconfdir@\ntarget_alias = @target_alias@\ntop_build_prefix = @top_build_prefix@\ntop_builddir = @top_builddir@\ntop_srcdir = @top_srcdir@\nAM_CPPFLAGS = -I$(srcdir)/../../include $(ICU_CPPFLAGS)\n@HAVE_BIN_TRUE@LDADD = ../../script/libfstscript.la \\\n@HAVE_BIN_TRUE@        ../../lib/libfst.la -lm $(DL_LIBS)\n\n@HAVE_BIN_TRUE@fstspecial_SOURCES = ../../bin/fstconvert.cc ../../bin/fstconvert-main.cc \\\n@HAVE_BIN_TRUE@                     phi-fst.cc rho-fst.cc sigma-fst.cc\n\n@HAVE_BIN_TRUE@fstspecial_CPPFLAGS = $(AM_CPPFLAGS)\nlibfst_LTLIBRARIES = phi-fst.la rho-fst.la sigma-fst.la\nlib_LTLIBRARIES = libfstspecial.la\nlibfstspecial_la_SOURCES = phi-fst.cc rho-fst.cc sigma-fst.cc\nlibfstspecial_la_LDFLAGS = -version-info 10:0:0 -lm $(DL_LIBS)\nlibfstspecial_la_LIBADD = ../../lib/libfst.la -lm $(DL_LIBS)\nphi_fst_la_SOURCES = phi-fst.cc\nphi_fst_la_LDFLAGS = -module\nphi_fst_la_LIBADD = ../../lib/libfst.la -lm $(DL_LIBS)\nrho_fst_la_SOURCES = rho-fst.cc\nrho_fst_la_LDFLAGS = -module\nrho_fst_la_LIBADD = ../../lib/libfst.la -lm $(DL_LIBS)\nsigma_fst_la_SOURCES = sigma-fst.cc\nsigma_fst_la_LDFLAGS = -module\nsigma_fst_la_LIBADD = ../../lib/libfst.la -lm $(DL_LIBS)\nall: all-am\n\n.SUFFIXES:\n.SUFFIXES: .cc .lo .o .obj\n$(srcdir)/Makefile.in:  $(srcdir)/Makefile.am  $(am__configure_deps)\n\t@for dep in $?; do \\\n\t  case '$(am__configure_deps)' in \\\n\t    *$$dep*) \\\n\t      ( cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh ) \\\n\t        && { if test -f $@; then exit 0; else break; fi; }; \\\n\t      exit 1;; \\\n\t  esac; \\\n\tdone; \\\n\techo ' cd $(top_srcdir) && $(AUTOMAKE) --foreign src/extensions/special/Makefile'; \\\n\t$(am__cd) $(top_srcdir) && \\\n\t  $(AUTOMAKE) --foreign src/extensions/special/Makefile\n.PRECIOUS: Makefile\nMakefile: $(srcdir)/Makefile.in $(top_builddir)/config.status\n\t@case '$?' in \\\n\t  *config.status*) \\\n\t    cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh;; \\\n\t  *) \\\n\t    echo ' cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe)'; \\\n\t    cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe);; \\\n\tesac;\n\n$(top_builddir)/config.status: $(top_srcdir)/configure $(CONFIG_STATUS_DEPENDENCIES)\n\tcd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh\n\n$(top_srcdir)/configure:  $(am__configure_deps)\n\tcd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh\n$(ACLOCAL_M4):  $(am__aclocal_m4_deps)\n\tcd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh\n$(am__aclocal_m4_deps):\n\ninstall-libLTLIBRARIES: $(lib_LTLIBRARIES)\n\t@$(NORMAL_INSTALL)\n\t@list='$(lib_LTLIBRARIES)'; test -n \"$(libdir)\" || list=; \\\n\tlist2=; for p in $$list; do \\\n\t  if test -f $$p; then \\\n\t    list2=\"$$list2 $$p\"; \\\n\t  else :; fi; \\\n\tdone; \\\n\ttest -z \"$$list2\" || { \\\n\t  echo \" $(MKDIR_P) '$(DESTDIR)$(libdir)'\"; \\\n\t  $(MKDIR_P) \"$(DESTDIR)$(libdir)\" || exit 1; \\\n\t  echo \" $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) $$list2 '$(DESTDIR)$(libdir)'\"; \\\n\t  $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) $$list2 \"$(DESTDIR)$(libdir)\"; \\\n\t}\n\nuninstall-libLTLIBRARIES:\n\t@$(NORMAL_UNINSTALL)\n\t@list='$(lib_LTLIBRARIES)'; test -n \"$(libdir)\" || list=; \\\n\tfor p in $$list; do \\\n\t  $(am__strip_dir) \\\n\t  echo \" $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=uninstall rm -f '$(DESTDIR)$(libdir)/$$f'\"; \\\n\t  $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=uninstall rm -f \"$(DESTDIR)$(libdir)/$$f\"; \\\n\tdone\n\nclean-libLTLIBRARIES:\n\t-test -z \"$(lib_LTLIBRARIES)\" || rm -f $(lib_LTLIBRARIES)\n\t@list='$(lib_LTLIBRARIES)'; \\\n\tlocs=`for p in $$list; do echo $$p; done | \\\n\t      sed 's|^[^/]*$$|.|; s|/[^/]*$$||; s|$$|/so_locations|' | \\\n\t      sort -u`; \\\n\ttest -z \"$$locs\" || { \\\n\t  echo rm -f $${locs}; \\\n\t  rm -f $${locs}; \\\n\t}\n\ninstall-libfstLTLIBRARIES: $(libfst_LTLIBRARIES)\n\t@$(NORMAL_INSTALL)\n\t@list='$(libfst_LTLIBRARIES)'; test -n \"$(libfstdir)\" || list=; \\\n\tlist2=; for p in $$list; do \\\n\t  if test -f $$p; then \\\n\t    list2=\"$$list2 $$p\"; \\\n\t  else :; fi; \\\n\tdone; \\\n\ttest -z \"$$list2\" || { \\\n\t  echo \" $(MKDIR_P) '$(DESTDIR)$(libfstdir)'\"; \\\n\t  $(MKDIR_P) \"$(DESTDIR)$(libfstdir)\" || exit 1; \\\n\t  echo \" $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) $$list2 '$(DESTDIR)$(libfstdir)'\"; \\\n\t  $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) $$list2 \"$(DESTDIR)$(libfstdir)\"; \\\n\t}\n\nuninstall-libfstLTLIBRARIES:\n\t@$(NORMAL_UNINSTALL)\n\t@list='$(libfst_LTLIBRARIES)'; test -n \"$(libfstdir)\" || list=; \\\n\tfor p in $$list; do \\\n\t  $(am__strip_dir) \\\n\t  echo \" $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=uninstall rm -f '$(DESTDIR)$(libfstdir)/$$f'\"; \\\n\t  $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=uninstall rm -f \"$(DESTDIR)$(libfstdir)/$$f\"; \\\n\tdone\n\nclean-libfstLTLIBRARIES:\n\t-test -z \"$(libfst_LTLIBRARIES)\" || rm -f $(libfst_LTLIBRARIES)\n\t@list='$(libfst_LTLIBRARIES)'; \\\n\tlocs=`for p in $$list; do echo $$p; done | \\\n\t      sed 's|^[^/]*$$|.|; s|/[^/]*$$||; s|$$|/so_locations|' | \\\n\t      sort -u`; \\\n\ttest -z \"$$locs\" || { \\\n\t  echo rm -f $${locs}; \\\n\t  rm -f $${locs}; \\\n\t}\n\nlibfstspecial.la: $(libfstspecial_la_OBJECTS) $(libfstspecial_la_DEPENDENCIES) $(EXTRA_libfstspecial_la_DEPENDENCIES) \n\t$(AM_V_CXXLD)$(libfstspecial_la_LINK) -rpath $(libdir) $(libfstspecial_la_OBJECTS) $(libfstspecial_la_LIBADD) $(LIBS)\n\nphi-fst.la: $(phi_fst_la_OBJECTS) $(phi_fst_la_DEPENDENCIES) $(EXTRA_phi_fst_la_DEPENDENCIES) \n\t$(AM_V_CXXLD)$(phi_fst_la_LINK) -rpath $(libfstdir) $(phi_fst_la_OBJECTS) $(phi_fst_la_LIBADD) $(LIBS)\n\nrho-fst.la: $(rho_fst_la_OBJECTS) $(rho_fst_la_DEPENDENCIES) $(EXTRA_rho_fst_la_DEPENDENCIES) \n\t$(AM_V_CXXLD)$(rho_fst_la_LINK) -rpath $(libfstdir) $(rho_fst_la_OBJECTS) $(rho_fst_la_LIBADD) $(LIBS)\n\nsigma-fst.la: $(sigma_fst_la_OBJECTS) $(sigma_fst_la_DEPENDENCIES) $(EXTRA_sigma_fst_la_DEPENDENCIES) \n\t$(AM_V_CXXLD)$(sigma_fst_la_LINK) -rpath $(libfstdir) $(sigma_fst_la_OBJECTS) $(sigma_fst_la_LIBADD) $(LIBS)\ninstall-binPROGRAMS: $(bin_PROGRAMS)\n\t@$(NORMAL_INSTALL)\n\t@list='$(bin_PROGRAMS)'; test -n \"$(bindir)\" || list=; \\\n\tif test -n \"$$list\"; then \\\n\t  echo \" $(MKDIR_P) '$(DESTDIR)$(bindir)'\"; \\\n\t  $(MKDIR_P) \"$(DESTDIR)$(bindir)\" || exit 1; \\\n\tfi; \\\n\tfor p in $$list; do echo \"$$p $$p\"; done | \\\n\tsed 's/$(EXEEXT)$$//' | \\\n\twhile read p p1; do if test -f $$p \\\n\t || test -f $$p1 \\\n\t  ; then echo \"$$p\"; echo \"$$p\"; else :; fi; \\\n\tdone | \\\n\tsed -e 'p;s,.*/,,;n;h' \\\n\t    -e 's|.*|.|' \\\n\t    -e 'p;x;s,.*/,,;s/$(EXEEXT)$$//;$(transform);s/$$/$(EXEEXT)/' | \\\n\tsed 'N;N;N;s,\\n, ,g' | \\\n\t$(AWK) 'BEGIN { files[\".\"] = \"\"; dirs[\".\"] = 1 } \\\n\t  { d=$$3; if (dirs[d] != 1) { print \"d\", d; dirs[d] = 1 } \\\n\t    if ($$2 == $$4) files[d] = files[d] \" \" $$1; \\\n\t    else { print \"f\", $$3 \"/\" $$4, $$1; } } \\\n\t  END { for (d in files) print \"f\", d, files[d] }' | \\\n\twhile read type dir files; do \\\n\t    if test \"$$dir\" = .; then dir=; else dir=/$$dir; fi; \\\n\t    test -z \"$$files\" || { \\\n\t    echo \" $(INSTALL_PROGRAM_ENV) $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL_PROGRAM) $$files '$(DESTDIR)$(bindir)$$dir'\"; \\\n\t    $(INSTALL_PROGRAM_ENV) $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL_PROGRAM) $$files \"$(DESTDIR)$(bindir)$$dir\" || exit $$?; \\\n\t    } \\\n\t; done\n\nuninstall-binPROGRAMS:\n\t@$(NORMAL_UNINSTALL)\n\t@list='$(bin_PROGRAMS)'; test -n \"$(bindir)\" || list=; \\\n\tfiles=`for p in $$list; do echo \"$$p\"; done | \\\n\t  sed -e 'h;s,^.*/,,;s/$(EXEEXT)$$//;$(transform)' \\\n\t      -e 's/$$/$(EXEEXT)/' \\\n\t`; \\\n\ttest -n \"$$list\" || exit 0; \\\n\techo \" ( cd '$(DESTDIR)$(bindir)' && rm -f\" $$files \")\"; \\\n\tcd \"$(DESTDIR)$(bindir)\" && rm -f $$files\n\nclean-binPROGRAMS:\n\t@list='$(bin_PROGRAMS)'; test -n \"$$list\" || exit 0; \\\n\techo \" rm -f\" $$list; \\\n\trm -f $$list || exit $$?; \\\n\ttest -n \"$(EXEEXT)\" || exit 0; \\\n\tlist=`for p in $$list; do echo \"$$p\"; done | sed 's/$(EXEEXT)$$//'`; \\\n\techo \" rm -f\" $$list; \\\n\trm -f $$list\n../../bin/$(am__dirstamp):\n\t@$(MKDIR_P) ../../bin\n\t@: > ../../bin/$(am__dirstamp)\n../../bin/$(DEPDIR)/$(am__dirstamp):\n\t@$(MKDIR_P) ../../bin/$(DEPDIR)\n\t@: > ../../bin/$(DEPDIR)/$(am__dirstamp)\n../../bin/fstspecial-fstconvert.$(OBJEXT): ../../bin/$(am__dirstamp) \\\n\t../../bin/$(DEPDIR)/$(am__dirstamp)\n../../bin/fstspecial-fstconvert-main.$(OBJEXT):  \\\n\t../../bin/$(am__dirstamp) ../../bin/$(DEPDIR)/$(am__dirstamp)\n\nfstspecial$(EXEEXT): $(fstspecial_OBJECTS) $(fstspecial_DEPENDENCIES) $(EXTRA_fstspecial_DEPENDENCIES) \n\t@rm -f fstspecial$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(fstspecial_OBJECTS) $(fstspecial_LDADD) $(LIBS)\n\nmostlyclean-compile:\n\t-rm -f *.$(OBJEXT)\n\t-rm -f ../../bin/*.$(OBJEXT)\n\ndistclean-compile:\n\t-rm -f *.tab.c\n\n@AMDEP_TRUE@@am__include@ @am__quote@../../bin/$(DEPDIR)/fstspecial-fstconvert-main.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@../../bin/$(DEPDIR)/fstspecial-fstconvert.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstspecial-phi-fst.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstspecial-rho-fst.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstspecial-sigma-fst.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/phi-fst.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/rho-fst.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/sigma-fst.Plo@am__quote@\n\n.cc.o:\n@am__fastdepCXX_TRUE@\t$(AM_V_CXX)depbase=`echo $@ | sed 's|[^/]*$$|$(DEPDIR)/&|;s|\\.o$$||'`;\\\n@am__fastdepCXX_TRUE@\t$(CXXCOMPILE) -MT $@ -MD -MP -MF $$depbase.Tpo -c -o $@ $< &&\\\n@am__fastdepCXX_TRUE@\t$(am__mv) $$depbase.Tpo $$depbase.Po\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\t$(AM_V_CXX)source='$<' object='$@' libtool=no @AMDEPBACKSLASH@\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\tDEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@\n@am__fastdepCXX_FALSE@\t$(AM_V_CXX@am__nodep@)$(CXXCOMPILE) -c -o $@ $<\n\n.cc.obj:\n@am__fastdepCXX_TRUE@\t$(AM_V_CXX)depbase=`echo $@ | sed 's|[^/]*$$|$(DEPDIR)/&|;s|\\.obj$$||'`;\\\n@am__fastdepCXX_TRUE@\t$(CXXCOMPILE) -MT $@ -MD -MP -MF $$depbase.Tpo -c -o $@ `$(CYGPATH_W) '$<'` &&\\\n@am__fastdepCXX_TRUE@\t$(am__mv) $$depbase.Tpo $$depbase.Po\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\t$(AM_V_CXX)source='$<' object='$@' libtool=no @AMDEPBACKSLASH@\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\tDEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@\n@am__fastdepCXX_FALSE@\t$(AM_V_CXX@am__nodep@)$(CXXCOMPILE) -c -o $@ `$(CYGPATH_W) '$<'`\n\n.cc.lo:\n@am__fastdepCXX_TRUE@\t$(AM_V_CXX)depbase=`echo $@ | sed 's|[^/]*$$|$(DEPDIR)/&|;s|\\.lo$$||'`;\\\n@am__fastdepCXX_TRUE@\t$(LTCXXCOMPILE) -MT $@ -MD -MP -MF $$depbase.Tpo -c -o $@ $< &&\\\n@am__fastdepCXX_TRUE@\t$(am__mv) $$depbase.Tpo $$depbase.Plo\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\t$(AM_V_CXX)source='$<' object='$@' libtool=yes @AMDEPBACKSLASH@\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\tDEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@\n@am__fastdepCXX_FALSE@\t$(AM_V_CXX@am__nodep@)$(LTCXXCOMPILE) -c -o $@ $<\n\n../../bin/fstspecial-fstconvert.o: ../../bin/fstconvert.cc\n@am__fastdepCXX_TRUE@\t$(AM_V_CXX)$(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(fstspecial_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -MT ../../bin/fstspecial-fstconvert.o -MD -MP -MF ../../bin/$(DEPDIR)/fstspecial-fstconvert.Tpo -c -o ../../bin/fstspecial-fstconvert.o `test -f '../../bin/fstconvert.cc' || echo '$(srcdir)/'`../../bin/fstconvert.cc\n@am__fastdepCXX_TRUE@\t$(AM_V_at)$(am__mv) ../../bin/$(DEPDIR)/fstspecial-fstconvert.Tpo ../../bin/$(DEPDIR)/fstspecial-fstconvert.Po\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\t$(AM_V_CXX)source='../../bin/fstconvert.cc' object='../../bin/fstspecial-fstconvert.o' libtool=no @AMDEPBACKSLASH@\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\tDEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@\n@am__fastdepCXX_FALSE@\t$(AM_V_CXX@am__nodep@)$(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(fstspecial_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -c -o ../../bin/fstspecial-fstconvert.o `test -f '../../bin/fstconvert.cc' || echo '$(srcdir)/'`../../bin/fstconvert.cc\n\n../../bin/fstspecial-fstconvert.obj: ../../bin/fstconvert.cc\n@am__fastdepCXX_TRUE@\t$(AM_V_CXX)$(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(fstspecial_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -MT ../../bin/fstspecial-fstconvert.obj -MD -MP -MF ../../bin/$(DEPDIR)/fstspecial-fstconvert.Tpo -c -o ../../bin/fstspecial-fstconvert.obj `if test -f '../../bin/fstconvert.cc'; then $(CYGPATH_W) '../../bin/fstconvert.cc'; else $(CYGPATH_W) '$(srcdir)/../../bin/fstconvert.cc'; fi`\n@am__fastdepCXX_TRUE@\t$(AM_V_at)$(am__mv) ../../bin/$(DEPDIR)/fstspecial-fstconvert.Tpo ../../bin/$(DEPDIR)/fstspecial-fstconvert.Po\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\t$(AM_V_CXX)source='../../bin/fstconvert.cc' object='../../bin/fstspecial-fstconvert.obj' libtool=no @AMDEPBACKSLASH@\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\tDEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@\n@am__fastdepCXX_FALSE@\t$(AM_V_CXX@am__nodep@)$(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(fstspecial_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -c -o ../../bin/fstspecial-fstconvert.obj `if test -f '../../bin/fstconvert.cc'; then $(CYGPATH_W) '../../bin/fstconvert.cc'; else $(CYGPATH_W) '$(srcdir)/../../bin/fstconvert.cc'; fi`\n\n../../bin/fstspecial-fstconvert-main.o: ../../bin/fstconvert-main.cc\n@am__fastdepCXX_TRUE@\t$(AM_V_CXX)$(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(fstspecial_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -MT ../../bin/fstspecial-fstconvert-main.o -MD -MP -MF ../../bin/$(DEPDIR)/fstspecial-fstconvert-main.Tpo -c -o ../../bin/fstspecial-fstconvert-main.o `test -f '../../bin/fstconvert-main.cc' || echo '$(srcdir)/'`../../bin/fstconvert-main.cc\n@am__fastdepCXX_TRUE@\t$(AM_V_at)$(am__mv) ../../bin/$(DEPDIR)/fstspecial-fstconvert-main.Tpo ../../bin/$(DEPDIR)/fstspecial-fstconvert-main.Po\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\t$(AM_V_CXX)source='../../bin/fstconvert-main.cc' object='../../bin/fstspecial-fstconvert-main.o' libtool=no @AMDEPBACKSLASH@\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\tDEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@\n@am__fastdepCXX_FALSE@\t$(AM_V_CXX@am__nodep@)$(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(fstspecial_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -c -o ../../bin/fstspecial-fstconvert-main.o `test -f '../../bin/fstconvert-main.cc' || echo '$(srcdir)/'`../../bin/fstconvert-main.cc\n\n../../bin/fstspecial-fstconvert-main.obj: ../../bin/fstconvert-main.cc\n@am__fastdepCXX_TRUE@\t$(AM_V_CXX)$(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(fstspecial_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -MT ../../bin/fstspecial-fstconvert-main.obj -MD -MP -MF ../../bin/$(DEPDIR)/fstspecial-fstconvert-main.Tpo -c -o ../../bin/fstspecial-fstconvert-main.obj `if test -f '../../bin/fstconvert-main.cc'; then $(CYGPATH_W) '../../bin/fstconvert-main.cc'; else $(CYGPATH_W) '$(srcdir)/../../bin/fstconvert-main.cc'; fi`\n@am__fastdepCXX_TRUE@\t$(AM_V_at)$(am__mv) ../../bin/$(DEPDIR)/fstspecial-fstconvert-main.Tpo ../../bin/$(DEPDIR)/fstspecial-fstconvert-main.Po\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\t$(AM_V_CXX)source='../../bin/fstconvert-main.cc' object='../../bin/fstspecial-fstconvert-main.obj' libtool=no @AMDEPBACKSLASH@\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\tDEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@\n@am__fastdepCXX_FALSE@\t$(AM_V_CXX@am__nodep@)$(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(fstspecial_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -c -o ../../bin/fstspecial-fstconvert-main.obj `if test -f '../../bin/fstconvert-main.cc'; then $(CYGPATH_W) '../../bin/fstconvert-main.cc'; else $(CYGPATH_W) '$(srcdir)/../../bin/fstconvert-main.cc'; fi`\n\nfstspecial-phi-fst.o: phi-fst.cc\n@am__fastdepCXX_TRUE@\t$(AM_V_CXX)$(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(fstspecial_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -MT fstspecial-phi-fst.o -MD -MP -MF $(DEPDIR)/fstspecial-phi-fst.Tpo -c -o fstspecial-phi-fst.o `test -f 'phi-fst.cc' || echo '$(srcdir)/'`phi-fst.cc\n@am__fastdepCXX_TRUE@\t$(AM_V_at)$(am__mv) $(DEPDIR)/fstspecial-phi-fst.Tpo $(DEPDIR)/fstspecial-phi-fst.Po\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\t$(AM_V_CXX)source='phi-fst.cc' object='fstspecial-phi-fst.o' libtool=no @AMDEPBACKSLASH@\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\tDEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@\n@am__fastdepCXX_FALSE@\t$(AM_V_CXX@am__nodep@)$(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(fstspecial_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -c -o fstspecial-phi-fst.o `test -f 'phi-fst.cc' || echo '$(srcdir)/'`phi-fst.cc\n\nfstspecial-phi-fst.obj: phi-fst.cc\n@am__fastdepCXX_TRUE@\t$(AM_V_CXX)$(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(fstspecial_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -MT fstspecial-phi-fst.obj -MD -MP -MF $(DEPDIR)/fstspecial-phi-fst.Tpo -c -o fstspecial-phi-fst.obj `if test -f 'phi-fst.cc'; then $(CYGPATH_W) 'phi-fst.cc'; else $(CYGPATH_W) '$(srcdir)/phi-fst.cc'; fi`\n@am__fastdepCXX_TRUE@\t$(AM_V_at)$(am__mv) $(DEPDIR)/fstspecial-phi-fst.Tpo $(DEPDIR)/fstspecial-phi-fst.Po\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\t$(AM_V_CXX)source='phi-fst.cc' object='fstspecial-phi-fst.obj' libtool=no @AMDEPBACKSLASH@\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\tDEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@\n@am__fastdepCXX_FALSE@\t$(AM_V_CXX@am__nodep@)$(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(fstspecial_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -c -o fstspecial-phi-fst.obj `if test -f 'phi-fst.cc'; then $(CYGPATH_W) 'phi-fst.cc'; else $(CYGPATH_W) '$(srcdir)/phi-fst.cc'; fi`\n\nfstspecial-rho-fst.o: rho-fst.cc\n@am__fastdepCXX_TRUE@\t$(AM_V_CXX)$(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(fstspecial_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -MT fstspecial-rho-fst.o -MD -MP -MF $(DEPDIR)/fstspecial-rho-fst.Tpo -c -o fstspecial-rho-fst.o `test -f 'rho-fst.cc' || echo '$(srcdir)/'`rho-fst.cc\n@am__fastdepCXX_TRUE@\t$(AM_V_at)$(am__mv) $(DEPDIR)/fstspecial-rho-fst.Tpo $(DEPDIR)/fstspecial-rho-fst.Po\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\t$(AM_V_CXX)source='rho-fst.cc' object='fstspecial-rho-fst.o' libtool=no @AMDEPBACKSLASH@\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\tDEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@\n@am__fastdepCXX_FALSE@\t$(AM_V_CXX@am__nodep@)$(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(fstspecial_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -c -o fstspecial-rho-fst.o `test -f 'rho-fst.cc' || echo '$(srcdir)/'`rho-fst.cc\n\nfstspecial-rho-fst.obj: rho-fst.cc\n@am__fastdepCXX_TRUE@\t$(AM_V_CXX)$(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(fstspecial_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -MT fstspecial-rho-fst.obj -MD -MP -MF $(DEPDIR)/fstspecial-rho-fst.Tpo -c -o fstspecial-rho-fst.obj `if test -f 'rho-fst.cc'; then $(CYGPATH_W) 'rho-fst.cc'; else $(CYGPATH_W) '$(srcdir)/rho-fst.cc'; fi`\n@am__fastdepCXX_TRUE@\t$(AM_V_at)$(am__mv) $(DEPDIR)/fstspecial-rho-fst.Tpo $(DEPDIR)/fstspecial-rho-fst.Po\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\t$(AM_V_CXX)source='rho-fst.cc' object='fstspecial-rho-fst.obj' libtool=no @AMDEPBACKSLASH@\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\tDEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@\n@am__fastdepCXX_FALSE@\t$(AM_V_CXX@am__nodep@)$(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(fstspecial_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -c -o fstspecial-rho-fst.obj `if test -f 'rho-fst.cc'; then $(CYGPATH_W) 'rho-fst.cc'; else $(CYGPATH_W) '$(srcdir)/rho-fst.cc'; fi`\n\nfstspecial-sigma-fst.o: sigma-fst.cc\n@am__fastdepCXX_TRUE@\t$(AM_V_CXX)$(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(fstspecial_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -MT fstspecial-sigma-fst.o -MD -MP -MF $(DEPDIR)/fstspecial-sigma-fst.Tpo -c -o fstspecial-sigma-fst.o `test -f 'sigma-fst.cc' || echo '$(srcdir)/'`sigma-fst.cc\n@am__fastdepCXX_TRUE@\t$(AM_V_at)$(am__mv) $(DEPDIR)/fstspecial-sigma-fst.Tpo $(DEPDIR)/fstspecial-sigma-fst.Po\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\t$(AM_V_CXX)source='sigma-fst.cc' object='fstspecial-sigma-fst.o' libtool=no @AMDEPBACKSLASH@\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\tDEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@\n@am__fastdepCXX_FALSE@\t$(AM_V_CXX@am__nodep@)$(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(fstspecial_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -c -o fstspecial-sigma-fst.o `test -f 'sigma-fst.cc' || echo '$(srcdir)/'`sigma-fst.cc\n\nfstspecial-sigma-fst.obj: sigma-fst.cc\n@am__fastdepCXX_TRUE@\t$(AM_V_CXX)$(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(fstspecial_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -MT fstspecial-sigma-fst.obj -MD -MP -MF $(DEPDIR)/fstspecial-sigma-fst.Tpo -c -o fstspecial-sigma-fst.obj `if test -f 'sigma-fst.cc'; then $(CYGPATH_W) 'sigma-fst.cc'; else $(CYGPATH_W) '$(srcdir)/sigma-fst.cc'; fi`\n@am__fastdepCXX_TRUE@\t$(AM_V_at)$(am__mv) $(DEPDIR)/fstspecial-sigma-fst.Tpo $(DEPDIR)/fstspecial-sigma-fst.Po\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\t$(AM_V_CXX)source='sigma-fst.cc' object='fstspecial-sigma-fst.obj' libtool=no @AMDEPBACKSLASH@\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\tDEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@\n@am__fastdepCXX_FALSE@\t$(AM_V_CXX@am__nodep@)$(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(fstspecial_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -c -o fstspecial-sigma-fst.obj `if test -f 'sigma-fst.cc'; then $(CYGPATH_W) 'sigma-fst.cc'; else $(CYGPATH_W) '$(srcdir)/sigma-fst.cc'; fi`\n\nmostlyclean-libtool:\n\t-rm -f *.lo\n\nclean-libtool:\n\t-rm -rf .libs _libs\n\nID: $(am__tagged_files)\n\t$(am__define_uniq_tagged_files); mkid -fID $$unique\ntags: tags-am\nTAGS: tags\n\ntags-am: $(TAGS_DEPENDENCIES) $(am__tagged_files)\n\tset x; \\\n\there=`pwd`; \\\n\t$(am__define_uniq_tagged_files); \\\n\tshift; \\\n\tif test -z \"$(ETAGS_ARGS)$$*$$unique\"; then :; else \\\n\t  test -n \"$$unique\" || unique=$$empty_fix; \\\n\t  if test $$# -gt 0; then \\\n\t    $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \\\n\t      \"$$@\" $$unique; \\\n\t  else \\\n\t    $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \\\n\t      $$unique; \\\n\t  fi; \\\n\tfi\nctags: ctags-am\n\nCTAGS: ctags\nctags-am: $(TAGS_DEPENDENCIES) $(am__tagged_files)\n\t$(am__define_uniq_tagged_files); \\\n\ttest -z \"$(CTAGS_ARGS)$$unique\" \\\n\t  || $(CTAGS) $(CTAGSFLAGS) $(AM_CTAGSFLAGS) $(CTAGS_ARGS) \\\n\t     $$unique\n\nGTAGS:\n\there=`$(am__cd) $(top_builddir) && pwd` \\\n\t  && $(am__cd) $(top_srcdir) \\\n\t  && gtags -i $(GTAGS_ARGS) \"$$here\"\ncscopelist: cscopelist-am\n\ncscopelist-am: $(am__tagged_files)\n\tlist='$(am__tagged_files)'; \\\n\tcase \"$(srcdir)\" in \\\n\t  [\\\\/]* | ?:[\\\\/]*) sdir=\"$(srcdir)\" ;; \\\n\t  *) sdir=$(subdir)/$(srcdir) ;; \\\n\tesac; \\\n\tfor i in $$list; do \\\n\t  if test -f \"$$i\"; then \\\n\t    echo \"$(subdir)/$$i\"; \\\n\t  else \\\n\t    echo \"$$sdir/$$i\"; \\\n\t  fi; \\\n\tdone >> $(top_builddir)/cscope.files\n\ndistclean-tags:\n\t-rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags\n\ndistdir: $(DISTFILES)\n\t@srcdirstrip=`echo \"$(srcdir)\" | sed 's/[].[^$$\\\\*]/\\\\\\\\&/g'`; \\\n\ttopsrcdirstrip=`echo \"$(top_srcdir)\" | sed 's/[].[^$$\\\\*]/\\\\\\\\&/g'`; \\\n\tlist='$(DISTFILES)'; \\\n\t  dist_files=`for file in $$list; do echo $$file; done | \\\n\t  sed -e \"s|^$$srcdirstrip/||;t\" \\\n\t      -e \"s|^$$topsrcdirstrip/|$(top_builddir)/|;t\"`; \\\n\tcase $$dist_files in \\\n\t  */*) $(MKDIR_P) `echo \"$$dist_files\" | \\\n\t\t\t   sed '/\\//!d;s|^|$(distdir)/|;s,/[^/]*$$,,' | \\\n\t\t\t   sort -u` ;; \\\n\tesac; \\\n\tfor file in $$dist_files; do \\\n\t  if test -f $$file || test -d $$file; then d=.; else d=$(srcdir); fi; \\\n\t  if test -d $$d/$$file; then \\\n\t    dir=`echo \"/$$file\" | sed -e 's,/[^/]*$$,,'`; \\\n\t    if test -d \"$(distdir)/$$file\"; then \\\n\t      find \"$(distdir)/$$file\" -type d ! -perm -700 -exec chmod u+rwx {} \\;; \\\n\t    fi; \\\n\t    if test -d $(srcdir)/$$file && test $$d != $(srcdir); then \\\n\t      cp -fpR $(srcdir)/$$file \"$(distdir)$$dir\" || exit 1; \\\n\t      find \"$(distdir)/$$file\" -type d ! -perm -700 -exec chmod u+rwx {} \\;; \\\n\t    fi; \\\n\t    cp -fpR $$d/$$file \"$(distdir)$$dir\" || exit 1; \\\n\t  else \\\n\t    test -f \"$(distdir)/$$file\" \\\n\t    || cp -p $$d/$$file \"$(distdir)/$$file\" \\\n\t    || exit 1; \\\n\t  fi; \\\n\tdone\ncheck-am: all-am\ncheck: check-am\nall-am: Makefile $(LTLIBRARIES) $(PROGRAMS)\ninstall-binPROGRAMS: install-libLTLIBRARIES\n\ninstalldirs:\n\tfor dir in \"$(DESTDIR)$(libdir)\" \"$(DESTDIR)$(libfstdir)\" \"$(DESTDIR)$(bindir)\"; do \\\n\t  test -z \"$$dir\" || $(MKDIR_P) \"$$dir\"; \\\n\tdone\ninstall: install-am\ninstall-exec: install-exec-am\ninstall-data: install-data-am\nuninstall: uninstall-am\n\ninstall-am: all-am\n\t@$(MAKE) $(AM_MAKEFLAGS) install-exec-am install-data-am\n\ninstallcheck: installcheck-am\ninstall-strip:\n\tif test -z '$(STRIP)'; then \\\n\t  $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" \\\n\t    install_sh_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" INSTALL_STRIP_FLAG=-s \\\n\t      install; \\\n\telse \\\n\t  $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" \\\n\t    install_sh_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" INSTALL_STRIP_FLAG=-s \\\n\t    \"INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'\" install; \\\n\tfi\nmostlyclean-generic:\n\nclean-generic:\n\ndistclean-generic:\n\t-test -z \"$(CONFIG_CLEAN_FILES)\" || rm -f $(CONFIG_CLEAN_FILES)\n\t-test . = \"$(srcdir)\" || test -z \"$(CONFIG_CLEAN_VPATH_FILES)\" || rm -f $(CONFIG_CLEAN_VPATH_FILES)\n\t-rm -f ../../bin/$(DEPDIR)/$(am__dirstamp)\n\t-rm -f ../../bin/$(am__dirstamp)\n\nmaintainer-clean-generic:\n\t@echo \"This command is intended for maintainers to use\"\n\t@echo \"it deletes files that may require special tools to rebuild.\"\nclean: clean-am\n\nclean-am: clean-binPROGRAMS clean-generic clean-libLTLIBRARIES \\\n\tclean-libfstLTLIBRARIES clean-libtool mostlyclean-am\n\ndistclean: distclean-am\n\t-rm -rf ../../bin/$(DEPDIR) ./$(DEPDIR)\n\t-rm -f Makefile\ndistclean-am: clean-am distclean-compile distclean-generic \\\n\tdistclean-tags\n\ndvi: dvi-am\n\ndvi-am:\n\nhtml: html-am\n\nhtml-am:\n\ninfo: info-am\n\ninfo-am:\n\ninstall-data-am: install-libfstLTLIBRARIES\n\ninstall-dvi: install-dvi-am\n\ninstall-dvi-am:\n\ninstall-exec-am: install-binPROGRAMS install-libLTLIBRARIES\n\ninstall-html: install-html-am\n\ninstall-html-am:\n\ninstall-info: install-info-am\n\ninstall-info-am:\n\ninstall-man:\n\ninstall-pdf: install-pdf-am\n\ninstall-pdf-am:\n\ninstall-ps: install-ps-am\n\ninstall-ps-am:\n\ninstallcheck-am:\n\nmaintainer-clean: maintainer-clean-am\n\t-rm -rf ../../bin/$(DEPDIR) ./$(DEPDIR)\n\t-rm -f Makefile\nmaintainer-clean-am: distclean-am maintainer-clean-generic\n\nmostlyclean: mostlyclean-am\n\nmostlyclean-am: mostlyclean-compile mostlyclean-generic \\\n\tmostlyclean-libtool\n\npdf: pdf-am\n\npdf-am:\n\nps: ps-am\n\nps-am:\n\nuninstall-am: uninstall-binPROGRAMS uninstall-libLTLIBRARIES \\\n\tuninstall-libfstLTLIBRARIES\n\n.MAKE: install-am install-strip\n\n.PHONY: CTAGS GTAGS TAGS all all-am check check-am clean \\\n\tclean-binPROGRAMS clean-generic clean-libLTLIBRARIES \\\n\tclean-libfstLTLIBRARIES clean-libtool cscopelist-am ctags \\\n\tctags-am distclean distclean-compile distclean-generic \\\n\tdistclean-libtool distclean-tags distdir dvi dvi-am html \\\n\thtml-am info info-am install install-am install-binPROGRAMS \\\n\tinstall-data install-data-am install-dvi install-dvi-am \\\n\tinstall-exec install-exec-am install-html install-html-am \\\n\tinstall-info install-info-am install-libLTLIBRARIES \\\n\tinstall-libfstLTLIBRARIES install-man install-pdf \\\n\tinstall-pdf-am install-ps install-ps-am install-strip \\\n\tinstallcheck installcheck-am installdirs maintainer-clean \\\n\tmaintainer-clean-generic mostlyclean mostlyclean-compile \\\n\tmostlyclean-generic mostlyclean-libtool pdf pdf-am ps ps-am \\\n\ttags tags-am uninstall uninstall-am uninstall-binPROGRAMS \\\n\tuninstall-libLTLIBRARIES uninstall-libfstLTLIBRARIES\n\n\n# Tell versions [3.59,3.63) of GNU make to not export all variables.\n# Otherwise a system limit (for SysV at least) may be exceeded.\n.NOEXPORT:\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/extensions/special/phi-fst.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/fst.h>\n#include <fst/extensions/special/phi-fst.h>\n\nDEFINE_int64(phi_fst_phi_label, 0,\n             \"Label of transitions to be interpreted as phi ('failure') \"\n              \"transitions\");\nDEFINE_bool(phi_fst_phi_loop, true,\n            \"When true, a phi self loop consumes a symbol\");\nDEFINE_string(phi_fst_rewrite_mode, \"auto\",\n              \"Rewrite both sides when matching? One of:\"\n              \" \\\"auto\\\" (rewrite iff acceptor), \\\"always\\\", \\\"never\\\"\");\n\nnamespace fst {\n\nconst char phi_fst_type[] = \"phi\";\nconst char input_phi_fst_type[] = \"input_phi\";\nconst char output_phi_fst_type[] = \"output_phi\";\n\nstatic FstRegisterer<StdPhiFst> PhiFst_StdArc_registerer;\nstatic FstRegisterer<LogPhiFst> PhiFst_LogArc_registerer;\nstatic FstRegisterer<Log64PhiFst> PhiFst_Log64Arc_registerer;\n\nstatic FstRegisterer<StdInputPhiFst> InputPhiFst_StdArc_registerer;\nstatic FstRegisterer<LogInputPhiFst> InputPhiFst_LogArc_registerer;\nstatic FstRegisterer<Log64InputPhiFst> InputPhiFst_Log64Arc_registerer;\n\nstatic FstRegisterer<StdOutputPhiFst> OutputPhiFst_StdArc_registerer;\nstatic FstRegisterer<LogOutputPhiFst> OutputPhiFst_LogArc_registerer;\nstatic FstRegisterer<Log64OutputPhiFst> OutputPhiFst_Log64Arc_registerer;\n\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/extensions/special/rho-fst.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/extensions/special/rho-fst.h>\n\n#include <fst/fst.h>\n\nDEFINE_int64(rho_fst_rho_label, 0,\n             \"Label of transitions to be interpreted as rho ('rest') \"\n             \"transitions\");\nDEFINE_string(rho_fst_rewrite_mode, \"auto\",\n              \"Rewrite both sides when matching? One of:\"\n              \" \\\"auto\\\" (rewrite iff acceptor), \\\"always\\\", \\\"never\\\"\");\n\nnamespace fst {\n\nconst char rho_fst_type[] = \"rho\";\nconst char input_rho_fst_type[] = \"input_rho\";\nconst char output_rho_fst_type[] = \"output_rho\";\n\nstatic FstRegisterer<StdRhoFst> RhoFst_StdArc_registerer;\nstatic FstRegisterer<LogRhoFst> RhoFst_LogArc_registerer;\nstatic FstRegisterer<Log64RhoFst> RhoFst_Log64Arc_registerer;\n\nstatic FstRegisterer<StdInputRhoFst> InputRhoFst_StdArc_registerer;\nstatic FstRegisterer<LogInputRhoFst> InputRhoFst_LogArc_registerer;\nstatic FstRegisterer<Log64InputRhoFst> InputRhoFst_Log64Arc_registerer;\n\nstatic FstRegisterer<StdOutputRhoFst> OutputRhoFst_StdArc_registerer;\nstatic FstRegisterer<LogOutputRhoFst> OutputRhoFst_LogArc_registerer;\nstatic FstRegisterer<Log64OutputRhoFst> OutputRhoFst_Log64Arc_registerer;\n\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/extensions/special/sigma-fst.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/extensions/special/sigma-fst.h>\n\n#include <fst/fst.h>\n\nDEFINE_int64(sigma_fst_sigma_label, 0,\n             \"Label of transitions to be interpreted as sigma ('any') \"\n             \"transitions\");\nDEFINE_string(sigma_fst_rewrite_mode, \"auto\",\n              \"Rewrite both sides when matching? One of:\"\n              \" \\\"auto\\\" (rewrite iff acceptor), \\\"always\\\", \\\"never\\\"\");\n\nnamespace fst {\n\nconst char sigma_fst_type[] = \"sigma\";\nconst char input_sigma_fst_type[] = \"input_sigma\";\nconst char output_sigma_fst_type[] = \"output_sigma\";\n\nstatic FstRegisterer<StdSigmaFst> SigmaFst_StdArc_registerer;\nstatic FstRegisterer<LogSigmaFst> SigmaFst_LogArc_registerer;\nstatic FstRegisterer<Log64SigmaFst> SigmaFst_Log64Arc_registerer;\n\nstatic FstRegisterer<StdInputSigmaFst> InputSigmaFst_StdArc_registerer;\nstatic FstRegisterer<LogInputSigmaFst> InputSigmaFst_LogArc_registerer;\nstatic FstRegisterer<Log64InputSigmaFst> InputSigmaFst_Log64Arc_registerer;\n\nstatic FstRegisterer<StdOutputSigmaFst> OutputSigmaFst_StdArc_registerer;\nstatic FstRegisterer<LogOutputSigmaFst> OutputSigmaFst_LogArc_registerer;\nstatic FstRegisterer<Log64OutputSigmaFst> OutputSigmaFst_Log64Arc_registerer;\n\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/Makefile.am",
    "content": "if HAVE_COMPRESS\ncompress_include_headers = fst/extensions/compress/compress.h \\\nfst/extensions/compress/compress-script.h fst/extensions/compress/gzfile.h \\\nfst/extensions/compress/elias.h fst/extensions/compress/randmod.h\nendif\n\nif HAVE_FAR\nfar_include_headers = fst/extensions/far/compile-strings.h \\\nfst/extensions/far/create.h fst/extensions/far/equal.h \\\nfst/extensions/far/extract.h fst/extensions/far/far.h \\\nfst/extensions/far/far-class.h fst/extensions/far/farlib.h \\\nfst/extensions/far/farscript.h fst/extensions/far/getters.h \\\nfst/extensions/far/info.h fst/extensions/far/isomorphic.h \\\nfst/extensions/far/print-strings.h fst/extensions/far/script-impl.h \\\nfst/extensions/far/stlist.h fst/extensions/far/sttable.h\nendif\n\nif HAVE_LINEAR\nlinear_include_headers = fst/extensions/linear/linear-fst-data-builder.h \\\nfst/extensions/linear/linear-fst-data.h fst/extensions/linear/linear-fst.h \\\nfst/extensions/linear/linearscript.h fst/extensions/linear/loglinear-apply.h \\\nfst/extensions/linear/trie.h\nendif\n\nif HAVE_MPDT\nmpdt_include_headers = fst/extensions/mpdt/compose.h \\\nfst/extensions/mpdt/expand.h fst/extensions/mpdt/info.h \\\nfst/extensions/mpdt/mpdt.h fst/extensions/mpdt/mpdtlib.h \\\nfst/extensions/mpdt/mpdtscript.h fst/extensions/mpdt/read_write_utils.h \\\nfst/extensions/mpdt/reverse.h\nendif\n\nif HAVE_NGRAM\nngram_include_headers = fst/extensions/ngram/bitmap-index.h \\\nfst/extensions/ngram/ngram-fst.h fst/extensions/ngram/nthbit.h\nendif\n\nif HAVE_PDT\npdt_include_headers = fst/extensions/pdt/collection.h \\\nfst/extensions/pdt/compose.h fst/extensions/pdt/expand.h \\\nfst/extensions/pdt/getters.h fst/extensions/pdt/info.h \\\nfst/extensions/pdt/paren.h fst/extensions/pdt/pdt.h \\\nfst/extensions/pdt/pdtlib.h fst/extensions/pdt/pdtscript.h \\\nfst/extensions/pdt/replace.h fst/extensions/pdt/reverse.h \\\nfst/extensions/pdt/shortest-path.h\nendif\n\nif HAVE_SPECIAL\nspecial_include_headers = fst/extensions/special/phi-fst.h \\\nfst/extensions/special/rho-fst.h fst/extensions/special/sigma-fst.h\nendif\n\nif HAVE_GRM\nfar_include_headers = fst/extensions/far/compile-strings.h \\\nfst/extensions/far/create.h fst/extensions/far/equal.h \\\nfst/extensions/far/extract.h fst/extensions/far/far.h \\\nfst/extensions/far/far-class.h fst/extensions/far/farlib.h \\\nfst/extensions/far/farscript.h fst/extensions/far/getters.h \\\nfst/extensions/far/info.h fst/extensions/far/isomorphic.h \\\nfst/extensions/far/print-strings.h fst/extensions/far/script-impl.h \\\nfst/extensions/far/stlist.h fst/extensions/far/sttable.h\nmpdt_include_headers = fst/extensions/mpdt/compose.h \\\nfst/extensions/mpdt/expand.h fst/extensions/mpdt/info.h \\\nfst/extensions/mpdt/mpdt.h fst/extensions/mpdt/mpdtlib.h \\\nfst/extensions/mpdt/mpdtscript.h fst/extensions/mpdt/read_write_utils.h \\\nfst/extensions/mpdt/reverse.h\npdt_include_headers = fst/extensions/pdt/collection.h \\\nfst/extensions/pdt/compose.h fst/extensions/pdt/expand.h \\\nfst/extensions/pdt/getters.h fst/extensions/pdt/info.h \\\nfst/extensions/pdt/paren.h fst/extensions/pdt/pdt.h \\\nfst/extensions/pdt/pdtlib.h fst/extensions/pdt/pdtscript.h \\\nfst/extensions/pdt/replace.h fst/extensions/pdt/reverse.h \\\nfst/extensions/pdt/shortest-path.h\nendif\n\nscript_include_headers = fst/script/arc-class.h \\\nfst/script/arciterator-class.h fst/script/arcsort.h \\\nfst/script/arg-packs.h fst/script/closure.h fst/script/compile-impl.h \\\nfst/script/compile.h fst/script/compose.h fst/script/concat.h \\\nfst/script/connect.h fst/script/convert.h fst/script/decode.h \\\nfst/script/determinize.h fst/script/difference.h fst/script/disambiguate.h \\\nfst/script/draw-impl.h fst/script/draw.h fst/script/encode.h \\\nfst/script/encodemapper-class.h fst/script/epsnormalize.h fst/script/equal.h \\\nfst/script/equivalent.h fst/script/fst-class.h fst/script/fstscript.h \\\nfst/script/getters.h fst/script/info-impl.h fst/script/info.h \\\nfst/script/intersect.h fst/script/invert.h fst/script/isomorphic.h \\\nfst/script/map.h fst/script/minimize.h fst/script/print-impl.h \\\nfst/script/print.h fst/script/project.h fst/script/prune.h \\\nfst/script/push.h fst/script/randequivalent.h fst/script/randgen.h \\\nfst/script/register.h fst/script/relabel.h fst/script/replace.h \\\nfst/script/reverse.h fst/script/reweight.h fst/script/rmepsilon.h \\\nfst/script/script-impl.h fst/script/shortest-distance.h \\\nfst/script/shortest-path.h fst/script/stateiterator-class.h \\\nfst/script/synchronize.h fst/script/text-io.h fst/script/topsort.h \\\nfst/script/union.h fst/script/weight-class.h fst/script/fstscript-decl.h \\\nfst/script/verify.h\n\nnobase_include_HEADERS = fst/accumulator.h fst/add-on.h fst/arc-arena.h \\\nfst/arc-map.h fst/arc.h fst/arcfilter.h fst/arcsort.h fst/bi-table.h \\\nfst/cache.h fst/closure.h fst/compact-fst.h fst/compat.h fst/complement.h \\\nfst/compose-filter.h fst/compose.h fst/concat.h fst/config.h fst/connect.h \\\nfst/const-fst.h fst/determinize.h fst/dfs-visit.h fst/difference.h \\\nfst/disambiguate.h fst/edit-fst.h fst/encode.h fst/epsnormalize.h fst/equal.h \\\nfst/equivalent.h fst/expanded-fst.h fst/expectation-weight.h \\\nfst/factor-weight.h fst/filter-state.h fst/flags.h fst/float-weight.h \\\nfst/fst-decl.h fst/fst.h fst/fstlib.h fst/generic-register.h fst/heap.h \\\nfst/icu.h fst/intersect.h fst/interval-set.h fst/invert.h fst/isomorphic.h \\\nfst/label-reachable.h fst/lexicographic-weight.h fst/lock.h fst/log.h \\\nfst/lookahead-filter.h fst/lookahead-matcher.h fst/map.h fst/mapped-file.h \\\nfst/matcher-fst.h fst/matcher.h fst/memory.h fst/minimize.h fst/mutable-fst.h \\\nfst/pair-weight.h fst/partition.h fst/power-weight.h fst/product-weight.h \\\nfst/project.h fst/properties.h fst/prune.h fst/push.h fst/queue.h \\\nfst/randequivalent.h fst/randgen.h fst/rational.h fst/register.h \\\nfst/relabel.h fst/replace-util.h fst/replace.h fst/reverse.h fst/reweight.h \\\nfst/rmepsilon.h fst/rmfinalepsilon.h fst/set-weight.h fst/shortest-distance.h \\\nfst/shortest-path.h fst/signed-log-weight.h fst/sparse-power-weight.h \\\nfst/sparse-tuple-weight.h fst/state-map.h fst/state-reachable.h \\\nfst/state-table.h fst/statesort.h fst/string-weight.h fst/string.h \\\nfst/symbol-table-ops.h fst/symbol-table.h fst/synchronize.h \\\nfst/test-properties.h fst/topsort.h fst/tuple-weight.h fst/types.h \\\nfst/union-find.h fst/union-weight.h fst/union.h fst/util.h fst/vector-fst.h \\\nfst/verify.h fst/visit.h fst/weight.h \\\n$(compress_include_headers) \\\n$(far_include_headers) \\\n$(linear_include_headers) \\\n$(mpdt_include_headers) \\\n$(ngram_include_headers) \\\n$(pdt_include_headers) \\\n$(script_include_headers) \\\n$(special_include_headers)\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/Makefile.in",
    "content": "# Makefile.in generated by automake 1.14.1 from Makefile.am.\n# @configure_input@\n\n# Copyright (C) 1994-2013 Free Software Foundation, Inc.\n\n# This Makefile.in is free software; the Free Software Foundation\n# gives unlimited permission to copy and/or distribute it,\n# with or without modifications, as long as this notice is preserved.\n\n# This program is distributed in the hope that it will be useful,\n# but WITHOUT ANY WARRANTY, to the extent permitted by law; without\n# even the implied warranty of MERCHANTABILITY or FITNESS FOR A\n# PARTICULAR PURPOSE.\n\n@SET_MAKE@\n\nVPATH = @srcdir@\nam__is_gnu_make = test -n '$(MAKEFILE_LIST)' && test -n '$(MAKELEVEL)'\nam__make_running_with_option = \\\n  case $${target_option-} in \\\n      ?) ;; \\\n      *) echo \"am__make_running_with_option: internal error: invalid\" \\\n              \"target option '$${target_option-}' specified\" >&2; \\\n         exit 1;; \\\n  esac; \\\n  has_opt=no; \\\n  sane_makeflags=$$MAKEFLAGS; \\\n  if $(am__is_gnu_make); then \\\n    sane_makeflags=$$MFLAGS; \\\n  else \\\n    case $$MAKEFLAGS in \\\n      *\\\\[\\ \\\t]*) \\\n        bs=\\\\; \\\n        sane_makeflags=`printf '%s\\n' \"$$MAKEFLAGS\" \\\n          | sed \"s/$$bs$$bs[$$bs $$bs\t]*//g\"`;; \\\n    esac; \\\n  fi; \\\n  skip_next=no; \\\n  strip_trailopt () \\\n  { \\\n    flg=`printf '%s\\n' \"$$flg\" | sed \"s/$$1.*$$//\"`; \\\n  }; \\\n  for flg in $$sane_makeflags; do \\\n    test $$skip_next = yes && { skip_next=no; continue; }; \\\n    case $$flg in \\\n      *=*|--*) continue;; \\\n        -*I) strip_trailopt 'I'; skip_next=yes;; \\\n      -*I?*) strip_trailopt 'I';; \\\n        -*O) strip_trailopt 'O'; skip_next=yes;; \\\n      -*O?*) strip_trailopt 'O';; \\\n        -*l) strip_trailopt 'l'; skip_next=yes;; \\\n      -*l?*) strip_trailopt 'l';; \\\n      -[dEDm]) skip_next=yes;; \\\n      -[JT]) skip_next=yes;; \\\n    esac; \\\n    case $$flg in \\\n      *$$target_option*) has_opt=yes; break;; \\\n    esac; \\\n  done; \\\n  test $$has_opt = yes\nam__make_dryrun = (target_option=n; $(am__make_running_with_option))\nam__make_keepgoing = (target_option=k; $(am__make_running_with_option))\npkgdatadir = $(datadir)/@PACKAGE@\npkgincludedir = $(includedir)/@PACKAGE@\npkglibdir = $(libdir)/@PACKAGE@\npkglibexecdir = $(libexecdir)/@PACKAGE@\nam__cd = CDPATH=\"$${ZSH_VERSION+.}$(PATH_SEPARATOR)\" && cd\ninstall_sh_DATA = $(install_sh) -c -m 644\ninstall_sh_PROGRAM = $(install_sh) -c\ninstall_sh_SCRIPT = $(install_sh) -c\nINSTALL_HEADER = $(INSTALL_DATA)\ntransform = $(program_transform_name)\nNORMAL_INSTALL = :\nPRE_INSTALL = :\nPOST_INSTALL = :\nNORMAL_UNINSTALL = :\nPRE_UNINSTALL = :\nPOST_UNINSTALL = :\nbuild_triplet = @build@\nhost_triplet = @host@\nsubdir = src/include\nDIST_COMMON = $(srcdir)/Makefile.in $(srcdir)/Makefile.am \\\n\t$(am__nobase_include_HEADERS_DIST)\nACLOCAL_M4 = $(top_srcdir)/aclocal.m4\nam__aclocal_m4_deps = $(top_srcdir)/m4/ac_python_devel.m4 \\\n\t$(top_srcdir)/m4/libtool.m4 $(top_srcdir)/m4/ltoptions.m4 \\\n\t$(top_srcdir)/m4/ltsugar.m4 $(top_srcdir)/m4/ltversion.m4 \\\n\t$(top_srcdir)/m4/lt~obsolete.m4 $(top_srcdir)/configure.ac\nam__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \\\n\t$(ACLOCAL_M4)\nmkinstalldirs = $(install_sh) -d\nCONFIG_HEADER = $(top_builddir)/config.h \\\n\t$(top_builddir)/src/include/fst/config.h\nCONFIG_CLEAN_FILES =\nCONFIG_CLEAN_VPATH_FILES =\nAM_V_P = $(am__v_P_@AM_V@)\nam__v_P_ = $(am__v_P_@AM_DEFAULT_V@)\nam__v_P_0 = false\nam__v_P_1 = :\nAM_V_GEN = $(am__v_GEN_@AM_V@)\nam__v_GEN_ = $(am__v_GEN_@AM_DEFAULT_V@)\nam__v_GEN_0 = @echo \"  GEN     \" $@;\nam__v_GEN_1 = \nAM_V_at = $(am__v_at_@AM_V@)\nam__v_at_ = $(am__v_at_@AM_DEFAULT_V@)\nam__v_at_0 = @\nam__v_at_1 = \nSOURCES =\nDIST_SOURCES =\nam__can_run_installinfo = \\\n  case $$AM_UPDATE_INFO_DIR in \\\n    n|no|NO) false;; \\\n    *) (install-info --version) >/dev/null 2>&1;; \\\n  esac\nam__nobase_include_HEADERS_DIST = fst/accumulator.h fst/add-on.h \\\n\tfst/arc-arena.h fst/arc-map.h fst/arc.h fst/arcfilter.h \\\n\tfst/arcsort.h fst/bi-table.h fst/cache.h fst/closure.h \\\n\tfst/compact-fst.h fst/compat.h fst/complement.h \\\n\tfst/compose-filter.h fst/compose.h fst/concat.h fst/config.h \\\n\tfst/connect.h fst/const-fst.h fst/determinize.h \\\n\tfst/dfs-visit.h fst/difference.h fst/disambiguate.h \\\n\tfst/edit-fst.h fst/encode.h fst/epsnormalize.h fst/equal.h \\\n\tfst/equivalent.h fst/expanded-fst.h fst/expectation-weight.h \\\n\tfst/factor-weight.h fst/filter-state.h fst/flags.h \\\n\tfst/float-weight.h fst/fst-decl.h fst/fst.h fst/fstlib.h \\\n\tfst/generic-register.h fst/heap.h fst/icu.h fst/intersect.h \\\n\tfst/interval-set.h fst/invert.h fst/isomorphic.h \\\n\tfst/label-reachable.h fst/lexicographic-weight.h fst/lock.h \\\n\tfst/log.h fst/lookahead-filter.h fst/lookahead-matcher.h \\\n\tfst/map.h fst/mapped-file.h fst/matcher-fst.h fst/matcher.h \\\n\tfst/memory.h fst/minimize.h fst/mutable-fst.h \\\n\tfst/pair-weight.h fst/partition.h fst/power-weight.h \\\n\tfst/product-weight.h fst/project.h fst/properties.h \\\n\tfst/prune.h fst/push.h fst/queue.h fst/randequivalent.h \\\n\tfst/randgen.h fst/rational.h fst/register.h fst/relabel.h \\\n\tfst/replace-util.h fst/replace.h fst/reverse.h fst/reweight.h \\\n\tfst/rmepsilon.h fst/rmfinalepsilon.h fst/set-weight.h \\\n\tfst/shortest-distance.h fst/shortest-path.h \\\n\tfst/signed-log-weight.h fst/sparse-power-weight.h \\\n\tfst/sparse-tuple-weight.h fst/state-map.h \\\n\tfst/state-reachable.h fst/state-table.h fst/statesort.h \\\n\tfst/string-weight.h fst/string.h fst/symbol-table-ops.h \\\n\tfst/symbol-table.h fst/synchronize.h fst/test-properties.h \\\n\tfst/topsort.h fst/tuple-weight.h fst/types.h fst/union-find.h \\\n\tfst/union-weight.h fst/union.h fst/util.h fst/vector-fst.h \\\n\tfst/verify.h fst/visit.h fst/weight.h \\\n\tfst/extensions/compress/compress.h \\\n\tfst/extensions/compress/compress-script.h \\\n\tfst/extensions/compress/gzfile.h \\\n\tfst/extensions/compress/elias.h \\\n\tfst/extensions/compress/randmod.h \\\n\tfst/extensions/far/compile-strings.h \\\n\tfst/extensions/far/create.h fst/extensions/far/equal.h \\\n\tfst/extensions/far/extract.h fst/extensions/far/far.h \\\n\tfst/extensions/far/far-class.h fst/extensions/far/farlib.h \\\n\tfst/extensions/far/farscript.h fst/extensions/far/getters.h \\\n\tfst/extensions/far/info.h fst/extensions/far/isomorphic.h \\\n\tfst/extensions/far/print-strings.h \\\n\tfst/extensions/far/script-impl.h fst/extensions/far/stlist.h \\\n\tfst/extensions/far/sttable.h \\\n\tfst/extensions/linear/linear-fst-data-builder.h \\\n\tfst/extensions/linear/linear-fst-data.h \\\n\tfst/extensions/linear/linear-fst.h \\\n\tfst/extensions/linear/linearscript.h \\\n\tfst/extensions/linear/loglinear-apply.h \\\n\tfst/extensions/linear/trie.h fst/extensions/mpdt/compose.h \\\n\tfst/extensions/mpdt/expand.h fst/extensions/mpdt/info.h \\\n\tfst/extensions/mpdt/mpdt.h fst/extensions/mpdt/mpdtlib.h \\\n\tfst/extensions/mpdt/mpdtscript.h \\\n\tfst/extensions/mpdt/read_write_utils.h \\\n\tfst/extensions/mpdt/reverse.h \\\n\tfst/extensions/ngram/bitmap-index.h \\\n\tfst/extensions/ngram/ngram-fst.h fst/extensions/ngram/nthbit.h \\\n\tfst/extensions/pdt/collection.h fst/extensions/pdt/compose.h \\\n\tfst/extensions/pdt/expand.h fst/extensions/pdt/getters.h \\\n\tfst/extensions/pdt/info.h fst/extensions/pdt/paren.h \\\n\tfst/extensions/pdt/pdt.h fst/extensions/pdt/pdtlib.h \\\n\tfst/extensions/pdt/pdtscript.h fst/extensions/pdt/replace.h \\\n\tfst/extensions/pdt/reverse.h \\\n\tfst/extensions/pdt/shortest-path.h fst/script/arc-class.h \\\n\tfst/script/arciterator-class.h fst/script/arcsort.h \\\n\tfst/script/arg-packs.h fst/script/closure.h \\\n\tfst/script/compile-impl.h fst/script/compile.h \\\n\tfst/script/compose.h fst/script/concat.h fst/script/connect.h \\\n\tfst/script/convert.h fst/script/decode.h \\\n\tfst/script/determinize.h fst/script/difference.h \\\n\tfst/script/disambiguate.h fst/script/draw-impl.h \\\n\tfst/script/draw.h fst/script/encode.h \\\n\tfst/script/encodemapper-class.h fst/script/epsnormalize.h \\\n\tfst/script/equal.h fst/script/equivalent.h \\\n\tfst/script/fst-class.h fst/script/fstscript.h \\\n\tfst/script/getters.h fst/script/info-impl.h fst/script/info.h \\\n\tfst/script/intersect.h fst/script/invert.h \\\n\tfst/script/isomorphic.h fst/script/map.h fst/script/minimize.h \\\n\tfst/script/print-impl.h fst/script/print.h \\\n\tfst/script/project.h fst/script/prune.h fst/script/push.h \\\n\tfst/script/randequivalent.h fst/script/randgen.h \\\n\tfst/script/register.h fst/script/relabel.h \\\n\tfst/script/replace.h fst/script/reverse.h \\\n\tfst/script/reweight.h fst/script/rmepsilon.h \\\n\tfst/script/script-impl.h fst/script/shortest-distance.h \\\n\tfst/script/shortest-path.h fst/script/stateiterator-class.h \\\n\tfst/script/synchronize.h fst/script/text-io.h \\\n\tfst/script/topsort.h fst/script/union.h \\\n\tfst/script/weight-class.h fst/script/fstscript-decl.h \\\n\tfst/script/verify.h fst/extensions/special/phi-fst.h \\\n\tfst/extensions/special/rho-fst.h \\\n\tfst/extensions/special/sigma-fst.h\nam__vpath_adj_setup = srcdirstrip=`echo \"$(srcdir)\" | sed 's|.|.|g'`;\nam__vpath_adj = case $$p in \\\n    $(srcdir)/*) f=`echo \"$$p\" | sed \"s|^$$srcdirstrip/||\"`;; \\\n    *) f=$$p;; \\\n  esac;\nam__strip_dir = f=`echo $$p | sed -e 's|^.*/||'`;\nam__install_max = 40\nam__nobase_strip_setup = \\\n  srcdirstrip=`echo \"$(srcdir)\" | sed 's/[].[^$$\\\\*|]/\\\\\\\\&/g'`\nam__nobase_strip = \\\n  for p in $$list; do echo \"$$p\"; done | sed -e \"s|$$srcdirstrip/||\"\nam__nobase_list = $(am__nobase_strip_setup); \\\n  for p in $$list; do echo \"$$p $$p\"; done | \\\n  sed \"s| $$srcdirstrip/| |;\"' / .*\\//!s/ .*/ ./; s,\\( .*\\)/[^/]*$$,\\1,' | \\\n  $(AWK) 'BEGIN { files[\".\"] = \"\" } { files[$$2] = files[$$2] \" \" $$1; \\\n    if (++n[$$2] == $(am__install_max)) \\\n      { print $$2, files[$$2]; n[$$2] = 0; files[$$2] = \"\" } } \\\n    END { for (dir in files) print dir, files[dir] }'\nam__base_list = \\\n  sed '$$!N;$$!N;$$!N;$$!N;$$!N;$$!N;$$!N;s/\\n/ /g' | \\\n  sed '$$!N;$$!N;$$!N;$$!N;s/\\n/ /g'\nam__uninstall_files_from_dir = { \\\n  test -z \"$$files\" \\\n    || { test ! -d \"$$dir\" && test ! -f \"$$dir\" && test ! -r \"$$dir\"; } \\\n    || { echo \" ( cd '$$dir' && rm -f\" $$files \")\"; \\\n         $(am__cd) \"$$dir\" && rm -f $$files; }; \\\n  }\nam__installdirs = \"$(DESTDIR)$(includedir)\"\nHEADERS = $(nobase_include_HEADERS)\nam__tagged_files = $(HEADERS) $(SOURCES) $(TAGS_FILES) $(LISP)\n# Read a list of newline-separated strings from the standard input,\n# and print each of them once, without duplicates.  Input order is\n# *not* preserved.\nam__uniquify_input = $(AWK) '\\\n  BEGIN { nonempty = 0; } \\\n  { items[$$0] = 1; nonempty = 1; } \\\n  END { if (nonempty) { for (i in items) print i; }; } \\\n'\n# Make sure the list of sources is unique.  This is necessary because,\n# e.g., the same source file might be shared among _SOURCES variables\n# for different programs/libraries.\nam__define_uniq_tagged_files = \\\n  list='$(am__tagged_files)'; \\\n  unique=`for i in $$list; do \\\n    if test -f \"$$i\"; then echo $$i; else echo $(srcdir)/$$i; fi; \\\n  done | $(am__uniquify_input)`\nETAGS = etags\nCTAGS = ctags\nDISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST)\nACLOCAL = @ACLOCAL@\nAMTAR = @AMTAR@\nAM_DEFAULT_VERBOSITY = @AM_DEFAULT_VERBOSITY@\nAR = @AR@\nAUTOCONF = @AUTOCONF@\nAUTOHEADER = @AUTOHEADER@\nAUTOMAKE = @AUTOMAKE@\nAWK = @AWK@\nCC = @CC@\nCCDEPMODE = @CCDEPMODE@\nCFLAGS = @CFLAGS@\nCPP = @CPP@\nCPPFLAGS = @CPPFLAGS@\nCXX = @CXX@\nCXXCPP = @CXXCPP@\nCXXDEPMODE = @CXXDEPMODE@\nCXXFLAGS = @CXXFLAGS@\nCYGPATH_W = @CYGPATH_W@\nDEFS = @DEFS@\nDEPDIR = @DEPDIR@\nDLLTOOL = @DLLTOOL@\nDL_LIBS = @DL_LIBS@\nDSYMUTIL = @DSYMUTIL@\nDUMPBIN = @DUMPBIN@\nECHO_C = @ECHO_C@\nECHO_N = @ECHO_N@\nECHO_T = @ECHO_T@\nEGREP = @EGREP@\nEXEEXT = @EXEEXT@\nFGREP = @FGREP@\nGREP = @GREP@\nINSTALL = @INSTALL@\nINSTALL_DATA = @INSTALL_DATA@\nINSTALL_PROGRAM = @INSTALL_PROGRAM@\nINSTALL_SCRIPT = @INSTALL_SCRIPT@\nINSTALL_STRIP_PROGRAM = @INSTALL_STRIP_PROGRAM@\nLD = @LD@\nLDFLAGS = @LDFLAGS@\nLIBOBJS = @LIBOBJS@\nLIBS = @LIBS@\nLIBTOOL = @LIBTOOL@\nLIPO = @LIPO@\nLN_S = @LN_S@\nLTLIBOBJS = @LTLIBOBJS@\nMAKEINFO = @MAKEINFO@\nMANIFEST_TOOL = @MANIFEST_TOOL@\nMKDIR_P = @MKDIR_P@\nNM = @NM@\nNMEDIT = @NMEDIT@\nOBJDUMP = @OBJDUMP@\nOBJEXT = @OBJEXT@\nOTOOL = @OTOOL@\nOTOOL64 = @OTOOL64@\nPACKAGE = @PACKAGE@\nPACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@\nPACKAGE_NAME = @PACKAGE_NAME@\nPACKAGE_STRING = @PACKAGE_STRING@\nPACKAGE_TARNAME = @PACKAGE_TARNAME@\nPACKAGE_URL = @PACKAGE_URL@\nPACKAGE_VERSION = @PACKAGE_VERSION@\nPATH_SEPARATOR = @PATH_SEPARATOR@\nPYTHON = @PYTHON@\nPYTHON_CPPFLAGS = @PYTHON_CPPFLAGS@\nPYTHON_EXEC_PREFIX = @PYTHON_EXEC_PREFIX@\nPYTHON_EXTRA_LDFLAGS = @PYTHON_EXTRA_LDFLAGS@\nPYTHON_EXTRA_LIBS = @PYTHON_EXTRA_LIBS@\nPYTHON_LDFLAGS = @PYTHON_LDFLAGS@\nPYTHON_PLATFORM = @PYTHON_PLATFORM@\nPYTHON_PREFIX = @PYTHON_PREFIX@\nPYTHON_SITE_PKG = @PYTHON_SITE_PKG@\nPYTHON_VERSION = @PYTHON_VERSION@\nRANLIB = @RANLIB@\nSED = @SED@\nSET_MAKE = @SET_MAKE@\nSHELL = @SHELL@\nSTRIP = @STRIP@\nVERSION = @VERSION@\nabs_builddir = @abs_builddir@\nabs_srcdir = @abs_srcdir@\nabs_top_builddir = @abs_top_builddir@\nabs_top_srcdir = @abs_top_srcdir@\nac_ct_AR = @ac_ct_AR@\nac_ct_CC = @ac_ct_CC@\nac_ct_CXX = @ac_ct_CXX@\nac_ct_DUMPBIN = @ac_ct_DUMPBIN@\nam__include = @am__include@\nam__leading_dot = @am__leading_dot@\nam__quote = @am__quote@\nam__tar = @am__tar@\nam__untar = @am__untar@\nbindir = @bindir@\nbuild = @build@\nbuild_alias = @build_alias@\nbuild_cpu = @build_cpu@\nbuild_os = @build_os@\nbuild_vendor = @build_vendor@\nbuilddir = @builddir@\ndatadir = @datadir@\ndatarootdir = @datarootdir@\ndocdir = @docdir@\ndvidir = @dvidir@\nexec_prefix = @exec_prefix@\nhost = @host@\nhost_alias = @host_alias@\nhost_cpu = @host_cpu@\nhost_os = @host_os@\nhost_vendor = @host_vendor@\nhtmldir = @htmldir@\nincludedir = @includedir@\ninfodir = @infodir@\ninstall_sh = @install_sh@\nlibdir = @libdir@\nlibexecdir = @libexecdir@\nlibfstdir = @libfstdir@\nlocaledir = @localedir@\nlocalstatedir = @localstatedir@\nmandir = @mandir@\nmkdir_p = @mkdir_p@\noldincludedir = @oldincludedir@\npdfdir = @pdfdir@\npkgpyexecdir = @pkgpyexecdir@\npkgpythondir = @pkgpythondir@\nprefix = @prefix@\nprogram_transform_name = @program_transform_name@\npsdir = @psdir@\npyexecdir = @pyexecdir@\npythondir = @pythondir@\nsbindir = @sbindir@\nsharedstatedir = @sharedstatedir@\nsrcdir = @srcdir@\nsysconfdir = @sysconfdir@\ntarget_alias = @target_alias@\ntop_build_prefix = @top_build_prefix@\ntop_builddir = @top_builddir@\ntop_srcdir = @top_srcdir@\n@HAVE_COMPRESS_TRUE@compress_include_headers = fst/extensions/compress/compress.h \\\n@HAVE_COMPRESS_TRUE@fst/extensions/compress/compress-script.h fst/extensions/compress/gzfile.h \\\n@HAVE_COMPRESS_TRUE@fst/extensions/compress/elias.h fst/extensions/compress/randmod.h\n\n@HAVE_FAR_TRUE@far_include_headers = fst/extensions/far/compile-strings.h \\\n@HAVE_FAR_TRUE@fst/extensions/far/create.h fst/extensions/far/equal.h \\\n@HAVE_FAR_TRUE@fst/extensions/far/extract.h fst/extensions/far/far.h \\\n@HAVE_FAR_TRUE@fst/extensions/far/far-class.h fst/extensions/far/farlib.h \\\n@HAVE_FAR_TRUE@fst/extensions/far/farscript.h fst/extensions/far/getters.h \\\n@HAVE_FAR_TRUE@fst/extensions/far/info.h fst/extensions/far/isomorphic.h \\\n@HAVE_FAR_TRUE@fst/extensions/far/print-strings.h fst/extensions/far/script-impl.h \\\n@HAVE_FAR_TRUE@fst/extensions/far/stlist.h fst/extensions/far/sttable.h\n\n@HAVE_GRM_TRUE@far_include_headers = fst/extensions/far/compile-strings.h \\\n@HAVE_GRM_TRUE@fst/extensions/far/create.h fst/extensions/far/equal.h \\\n@HAVE_GRM_TRUE@fst/extensions/far/extract.h fst/extensions/far/far.h \\\n@HAVE_GRM_TRUE@fst/extensions/far/far-class.h fst/extensions/far/farlib.h \\\n@HAVE_GRM_TRUE@fst/extensions/far/farscript.h fst/extensions/far/getters.h \\\n@HAVE_GRM_TRUE@fst/extensions/far/info.h fst/extensions/far/isomorphic.h \\\n@HAVE_GRM_TRUE@fst/extensions/far/print-strings.h fst/extensions/far/script-impl.h \\\n@HAVE_GRM_TRUE@fst/extensions/far/stlist.h fst/extensions/far/sttable.h\n\n@HAVE_LINEAR_TRUE@linear_include_headers = fst/extensions/linear/linear-fst-data-builder.h \\\n@HAVE_LINEAR_TRUE@fst/extensions/linear/linear-fst-data.h fst/extensions/linear/linear-fst.h \\\n@HAVE_LINEAR_TRUE@fst/extensions/linear/linearscript.h fst/extensions/linear/loglinear-apply.h \\\n@HAVE_LINEAR_TRUE@fst/extensions/linear/trie.h\n\n@HAVE_GRM_TRUE@mpdt_include_headers = fst/extensions/mpdt/compose.h \\\n@HAVE_GRM_TRUE@fst/extensions/mpdt/expand.h fst/extensions/mpdt/info.h \\\n@HAVE_GRM_TRUE@fst/extensions/mpdt/mpdt.h fst/extensions/mpdt/mpdtlib.h \\\n@HAVE_GRM_TRUE@fst/extensions/mpdt/mpdtscript.h fst/extensions/mpdt/read_write_utils.h \\\n@HAVE_GRM_TRUE@fst/extensions/mpdt/reverse.h\n\n@HAVE_MPDT_TRUE@mpdt_include_headers = fst/extensions/mpdt/compose.h \\\n@HAVE_MPDT_TRUE@fst/extensions/mpdt/expand.h fst/extensions/mpdt/info.h \\\n@HAVE_MPDT_TRUE@fst/extensions/mpdt/mpdt.h fst/extensions/mpdt/mpdtlib.h \\\n@HAVE_MPDT_TRUE@fst/extensions/mpdt/mpdtscript.h fst/extensions/mpdt/read_write_utils.h \\\n@HAVE_MPDT_TRUE@fst/extensions/mpdt/reverse.h\n\n@HAVE_NGRAM_TRUE@ngram_include_headers = fst/extensions/ngram/bitmap-index.h \\\n@HAVE_NGRAM_TRUE@fst/extensions/ngram/ngram-fst.h fst/extensions/ngram/nthbit.h\n\n@HAVE_GRM_TRUE@pdt_include_headers = fst/extensions/pdt/collection.h \\\n@HAVE_GRM_TRUE@fst/extensions/pdt/compose.h fst/extensions/pdt/expand.h \\\n@HAVE_GRM_TRUE@fst/extensions/pdt/getters.h fst/extensions/pdt/info.h \\\n@HAVE_GRM_TRUE@fst/extensions/pdt/paren.h fst/extensions/pdt/pdt.h \\\n@HAVE_GRM_TRUE@fst/extensions/pdt/pdtlib.h fst/extensions/pdt/pdtscript.h \\\n@HAVE_GRM_TRUE@fst/extensions/pdt/replace.h fst/extensions/pdt/reverse.h \\\n@HAVE_GRM_TRUE@fst/extensions/pdt/shortest-path.h\n\n@HAVE_PDT_TRUE@pdt_include_headers = fst/extensions/pdt/collection.h \\\n@HAVE_PDT_TRUE@fst/extensions/pdt/compose.h fst/extensions/pdt/expand.h \\\n@HAVE_PDT_TRUE@fst/extensions/pdt/getters.h fst/extensions/pdt/info.h \\\n@HAVE_PDT_TRUE@fst/extensions/pdt/paren.h fst/extensions/pdt/pdt.h \\\n@HAVE_PDT_TRUE@fst/extensions/pdt/pdtlib.h fst/extensions/pdt/pdtscript.h \\\n@HAVE_PDT_TRUE@fst/extensions/pdt/replace.h fst/extensions/pdt/reverse.h \\\n@HAVE_PDT_TRUE@fst/extensions/pdt/shortest-path.h\n\n@HAVE_SPECIAL_TRUE@special_include_headers = fst/extensions/special/phi-fst.h \\\n@HAVE_SPECIAL_TRUE@fst/extensions/special/rho-fst.h fst/extensions/special/sigma-fst.h\n\nscript_include_headers = fst/script/arc-class.h \\\nfst/script/arciterator-class.h fst/script/arcsort.h \\\nfst/script/arg-packs.h fst/script/closure.h fst/script/compile-impl.h \\\nfst/script/compile.h fst/script/compose.h fst/script/concat.h \\\nfst/script/connect.h fst/script/convert.h fst/script/decode.h \\\nfst/script/determinize.h fst/script/difference.h fst/script/disambiguate.h \\\nfst/script/draw-impl.h fst/script/draw.h fst/script/encode.h \\\nfst/script/encodemapper-class.h fst/script/epsnormalize.h fst/script/equal.h \\\nfst/script/equivalent.h fst/script/fst-class.h fst/script/fstscript.h \\\nfst/script/getters.h fst/script/info-impl.h fst/script/info.h \\\nfst/script/intersect.h fst/script/invert.h fst/script/isomorphic.h \\\nfst/script/map.h fst/script/minimize.h fst/script/print-impl.h \\\nfst/script/print.h fst/script/project.h fst/script/prune.h \\\nfst/script/push.h fst/script/randequivalent.h fst/script/randgen.h \\\nfst/script/register.h fst/script/relabel.h fst/script/replace.h \\\nfst/script/reverse.h fst/script/reweight.h fst/script/rmepsilon.h \\\nfst/script/script-impl.h fst/script/shortest-distance.h \\\nfst/script/shortest-path.h fst/script/stateiterator-class.h \\\nfst/script/synchronize.h fst/script/text-io.h fst/script/topsort.h \\\nfst/script/union.h fst/script/weight-class.h fst/script/fstscript-decl.h \\\nfst/script/verify.h\n\nnobase_include_HEADERS = fst/accumulator.h fst/add-on.h fst/arc-arena.h \\\nfst/arc-map.h fst/arc.h fst/arcfilter.h fst/arcsort.h fst/bi-table.h \\\nfst/cache.h fst/closure.h fst/compact-fst.h fst/compat.h fst/complement.h \\\nfst/compose-filter.h fst/compose.h fst/concat.h fst/config.h fst/connect.h \\\nfst/const-fst.h fst/determinize.h fst/dfs-visit.h fst/difference.h \\\nfst/disambiguate.h fst/edit-fst.h fst/encode.h fst/epsnormalize.h fst/equal.h \\\nfst/equivalent.h fst/expanded-fst.h fst/expectation-weight.h \\\nfst/factor-weight.h fst/filter-state.h fst/flags.h fst/float-weight.h \\\nfst/fst-decl.h fst/fst.h fst/fstlib.h fst/generic-register.h fst/heap.h \\\nfst/icu.h fst/intersect.h fst/interval-set.h fst/invert.h fst/isomorphic.h \\\nfst/label-reachable.h fst/lexicographic-weight.h fst/lock.h fst/log.h \\\nfst/lookahead-filter.h fst/lookahead-matcher.h fst/map.h fst/mapped-file.h \\\nfst/matcher-fst.h fst/matcher.h fst/memory.h fst/minimize.h fst/mutable-fst.h \\\nfst/pair-weight.h fst/partition.h fst/power-weight.h fst/product-weight.h \\\nfst/project.h fst/properties.h fst/prune.h fst/push.h fst/queue.h \\\nfst/randequivalent.h fst/randgen.h fst/rational.h fst/register.h \\\nfst/relabel.h fst/replace-util.h fst/replace.h fst/reverse.h fst/reweight.h \\\nfst/rmepsilon.h fst/rmfinalepsilon.h fst/set-weight.h fst/shortest-distance.h \\\nfst/shortest-path.h fst/signed-log-weight.h fst/sparse-power-weight.h \\\nfst/sparse-tuple-weight.h fst/state-map.h fst/state-reachable.h \\\nfst/state-table.h fst/statesort.h fst/string-weight.h fst/string.h \\\nfst/symbol-table-ops.h fst/symbol-table.h fst/synchronize.h \\\nfst/test-properties.h fst/topsort.h fst/tuple-weight.h fst/types.h \\\nfst/union-find.h fst/union-weight.h fst/union.h fst/util.h fst/vector-fst.h \\\nfst/verify.h fst/visit.h fst/weight.h \\\n$(compress_include_headers) \\\n$(far_include_headers) \\\n$(linear_include_headers) \\\n$(mpdt_include_headers) \\\n$(ngram_include_headers) \\\n$(pdt_include_headers) \\\n$(script_include_headers) \\\n$(special_include_headers)\n\nall: all-am\n\n.SUFFIXES:\n$(srcdir)/Makefile.in:  $(srcdir)/Makefile.am  $(am__configure_deps)\n\t@for dep in $?; do \\\n\t  case '$(am__configure_deps)' in \\\n\t    *$$dep*) \\\n\t      ( cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh ) \\\n\t        && { if test -f $@; then exit 0; else break; fi; }; \\\n\t      exit 1;; \\\n\t  esac; \\\n\tdone; \\\n\techo ' cd $(top_srcdir) && $(AUTOMAKE) --foreign src/include/Makefile'; \\\n\t$(am__cd) $(top_srcdir) && \\\n\t  $(AUTOMAKE) --foreign src/include/Makefile\n.PRECIOUS: Makefile\nMakefile: $(srcdir)/Makefile.in $(top_builddir)/config.status\n\t@case '$?' in \\\n\t  *config.status*) \\\n\t    cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh;; \\\n\t  *) \\\n\t    echo ' cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe)'; \\\n\t    cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe);; \\\n\tesac;\n\n$(top_builddir)/config.status: $(top_srcdir)/configure $(CONFIG_STATUS_DEPENDENCIES)\n\tcd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh\n\n$(top_srcdir)/configure:  $(am__configure_deps)\n\tcd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh\n$(ACLOCAL_M4):  $(am__aclocal_m4_deps)\n\tcd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh\n$(am__aclocal_m4_deps):\n\nmostlyclean-libtool:\n\t-rm -f *.lo\n\nclean-libtool:\n\t-rm -rf .libs _libs\ninstall-nobase_includeHEADERS: $(nobase_include_HEADERS)\n\t@$(NORMAL_INSTALL)\n\t@list='$(nobase_include_HEADERS)'; test -n \"$(includedir)\" || list=; \\\n\tif test -n \"$$list\"; then \\\n\t  echo \" $(MKDIR_P) '$(DESTDIR)$(includedir)'\"; \\\n\t  $(MKDIR_P) \"$(DESTDIR)$(includedir)\" || exit 1; \\\n\tfi; \\\n\t$(am__nobase_list) | while read dir files; do \\\n\t  xfiles=; for file in $$files; do \\\n\t    if test -f \"$$file\"; then xfiles=\"$$xfiles $$file\"; \\\n\t    else xfiles=\"$$xfiles $(srcdir)/$$file\"; fi; done; \\\n\t  test -z \"$$xfiles\" || { \\\n\t    test \"x$$dir\" = x. || { \\\n\t      echo \" $(MKDIR_P) '$(DESTDIR)$(includedir)/$$dir'\"; \\\n\t      $(MKDIR_P) \"$(DESTDIR)$(includedir)/$$dir\"; }; \\\n\t    echo \" $(INSTALL_HEADER) $$xfiles '$(DESTDIR)$(includedir)/$$dir'\"; \\\n\t    $(INSTALL_HEADER) $$xfiles \"$(DESTDIR)$(includedir)/$$dir\" || exit $$?; }; \\\n\tdone\n\nuninstall-nobase_includeHEADERS:\n\t@$(NORMAL_UNINSTALL)\n\t@list='$(nobase_include_HEADERS)'; test -n \"$(includedir)\" || list=; \\\n\t$(am__nobase_strip_setup); files=`$(am__nobase_strip)`; \\\n\tdir='$(DESTDIR)$(includedir)'; $(am__uninstall_files_from_dir)\n\nID: $(am__tagged_files)\n\t$(am__define_uniq_tagged_files); mkid -fID $$unique\ntags: tags-am\nTAGS: tags\n\ntags-am: $(TAGS_DEPENDENCIES) $(am__tagged_files)\n\tset x; \\\n\there=`pwd`; \\\n\t$(am__define_uniq_tagged_files); \\\n\tshift; \\\n\tif test -z \"$(ETAGS_ARGS)$$*$$unique\"; then :; else \\\n\t  test -n \"$$unique\" || unique=$$empty_fix; \\\n\t  if test $$# -gt 0; then \\\n\t    $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \\\n\t      \"$$@\" $$unique; \\\n\t  else \\\n\t    $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \\\n\t      $$unique; \\\n\t  fi; \\\n\tfi\nctags: ctags-am\n\nCTAGS: ctags\nctags-am: $(TAGS_DEPENDENCIES) $(am__tagged_files)\n\t$(am__define_uniq_tagged_files); \\\n\ttest -z \"$(CTAGS_ARGS)$$unique\" \\\n\t  || $(CTAGS) $(CTAGSFLAGS) $(AM_CTAGSFLAGS) $(CTAGS_ARGS) \\\n\t     $$unique\n\nGTAGS:\n\there=`$(am__cd) $(top_builddir) && pwd` \\\n\t  && $(am__cd) $(top_srcdir) \\\n\t  && gtags -i $(GTAGS_ARGS) \"$$here\"\ncscopelist: cscopelist-am\n\ncscopelist-am: $(am__tagged_files)\n\tlist='$(am__tagged_files)'; \\\n\tcase \"$(srcdir)\" in \\\n\t  [\\\\/]* | ?:[\\\\/]*) sdir=\"$(srcdir)\" ;; \\\n\t  *) sdir=$(subdir)/$(srcdir) ;; \\\n\tesac; \\\n\tfor i in $$list; do \\\n\t  if test -f \"$$i\"; then \\\n\t    echo \"$(subdir)/$$i\"; \\\n\t  else \\\n\t    echo \"$$sdir/$$i\"; \\\n\t  fi; \\\n\tdone >> $(top_builddir)/cscope.files\n\ndistclean-tags:\n\t-rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags\n\ndistdir: $(DISTFILES)\n\t@srcdirstrip=`echo \"$(srcdir)\" | sed 's/[].[^$$\\\\*]/\\\\\\\\&/g'`; \\\n\ttopsrcdirstrip=`echo \"$(top_srcdir)\" | sed 's/[].[^$$\\\\*]/\\\\\\\\&/g'`; \\\n\tlist='$(DISTFILES)'; \\\n\t  dist_files=`for file in $$list; do echo $$file; done | \\\n\t  sed -e \"s|^$$srcdirstrip/||;t\" \\\n\t      -e \"s|^$$topsrcdirstrip/|$(top_builddir)/|;t\"`; \\\n\tcase $$dist_files in \\\n\t  */*) $(MKDIR_P) `echo \"$$dist_files\" | \\\n\t\t\t   sed '/\\//!d;s|^|$(distdir)/|;s,/[^/]*$$,,' | \\\n\t\t\t   sort -u` ;; \\\n\tesac; \\\n\tfor file in $$dist_files; do \\\n\t  if test -f $$file || test -d $$file; then d=.; else d=$(srcdir); fi; \\\n\t  if test -d $$d/$$file; then \\\n\t    dir=`echo \"/$$file\" | sed -e 's,/[^/]*$$,,'`; \\\n\t    if test -d \"$(distdir)/$$file\"; then \\\n\t      find \"$(distdir)/$$file\" -type d ! -perm -700 -exec chmod u+rwx {} \\;; \\\n\t    fi; \\\n\t    if test -d $(srcdir)/$$file && test $$d != $(srcdir); then \\\n\t      cp -fpR $(srcdir)/$$file \"$(distdir)$$dir\" || exit 1; \\\n\t      find \"$(distdir)/$$file\" -type d ! -perm -700 -exec chmod u+rwx {} \\;; \\\n\t    fi; \\\n\t    cp -fpR $$d/$$file \"$(distdir)$$dir\" || exit 1; \\\n\t  else \\\n\t    test -f \"$(distdir)/$$file\" \\\n\t    || cp -p $$d/$$file \"$(distdir)/$$file\" \\\n\t    || exit 1; \\\n\t  fi; \\\n\tdone\ncheck-am: all-am\ncheck: check-am\nall-am: Makefile $(HEADERS)\ninstalldirs:\n\tfor dir in \"$(DESTDIR)$(includedir)\"; do \\\n\t  test -z \"$$dir\" || $(MKDIR_P) \"$$dir\"; \\\n\tdone\ninstall: install-am\ninstall-exec: install-exec-am\ninstall-data: install-data-am\nuninstall: uninstall-am\n\ninstall-am: all-am\n\t@$(MAKE) $(AM_MAKEFLAGS) install-exec-am install-data-am\n\ninstallcheck: installcheck-am\ninstall-strip:\n\tif test -z '$(STRIP)'; then \\\n\t  $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" \\\n\t    install_sh_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" INSTALL_STRIP_FLAG=-s \\\n\t      install; \\\n\telse \\\n\t  $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" \\\n\t    install_sh_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" INSTALL_STRIP_FLAG=-s \\\n\t    \"INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'\" install; \\\n\tfi\nmostlyclean-generic:\n\nclean-generic:\n\ndistclean-generic:\n\t-test -z \"$(CONFIG_CLEAN_FILES)\" || rm -f $(CONFIG_CLEAN_FILES)\n\t-test . = \"$(srcdir)\" || test -z \"$(CONFIG_CLEAN_VPATH_FILES)\" || rm -f $(CONFIG_CLEAN_VPATH_FILES)\n\nmaintainer-clean-generic:\n\t@echo \"This command is intended for maintainers to use\"\n\t@echo \"it deletes files that may require special tools to rebuild.\"\nclean: clean-am\n\nclean-am: clean-generic clean-libtool mostlyclean-am\n\ndistclean: distclean-am\n\t-rm -f Makefile\ndistclean-am: clean-am distclean-generic distclean-tags\n\ndvi: dvi-am\n\ndvi-am:\n\nhtml: html-am\n\nhtml-am:\n\ninfo: info-am\n\ninfo-am:\n\ninstall-data-am: install-nobase_includeHEADERS\n\ninstall-dvi: install-dvi-am\n\ninstall-dvi-am:\n\ninstall-exec-am:\n\ninstall-html: install-html-am\n\ninstall-html-am:\n\ninstall-info: install-info-am\n\ninstall-info-am:\n\ninstall-man:\n\ninstall-pdf: install-pdf-am\n\ninstall-pdf-am:\n\ninstall-ps: install-ps-am\n\ninstall-ps-am:\n\ninstallcheck-am:\n\nmaintainer-clean: maintainer-clean-am\n\t-rm -f Makefile\nmaintainer-clean-am: distclean-am maintainer-clean-generic\n\nmostlyclean: mostlyclean-am\n\nmostlyclean-am: mostlyclean-generic mostlyclean-libtool\n\npdf: pdf-am\n\npdf-am:\n\nps: ps-am\n\nps-am:\n\nuninstall-am: uninstall-nobase_includeHEADERS\n\n.MAKE: install-am install-strip\n\n.PHONY: CTAGS GTAGS TAGS all all-am check check-am clean clean-generic \\\n\tclean-libtool cscopelist-am ctags ctags-am distclean \\\n\tdistclean-generic distclean-libtool distclean-tags distdir dvi \\\n\tdvi-am html html-am info info-am install install-am \\\n\tinstall-data install-data-am install-dvi install-dvi-am \\\n\tinstall-exec install-exec-am install-html install-html-am \\\n\tinstall-info install-info-am install-man \\\n\tinstall-nobase_includeHEADERS install-pdf install-pdf-am \\\n\tinstall-ps install-ps-am install-strip installcheck \\\n\tinstallcheck-am installdirs maintainer-clean \\\n\tmaintainer-clean-generic mostlyclean mostlyclean-generic \\\n\tmostlyclean-libtool pdf pdf-am ps ps-am tags tags-am uninstall \\\n\tuninstall-am uninstall-nobase_includeHEADERS\n\n\n# Tell versions [3.59,3.63) of GNU make to not export all variables.\n# Otherwise a system limit (for SysV at least) may be exceeded.\n.NOEXPORT:\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/accumulator.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Classes to accumulate arc weights. Useful for weight lookahead.\n\n#ifndef FST_ACCUMULATOR_H_\n#define FST_ACCUMULATOR_H_\n\n#include <algorithm>\n#include <functional>\n#include <unordered_map>\n#include <vector>\n\n#include <fst/log.h>\n\n#include <fst/arcfilter.h>\n#include <fst/arcsort.h>\n#include <fst/dfs-visit.h>\n#include <fst/expanded-fst.h>\n#include <fst/replace.h>\n\nnamespace fst {\n\n// This class accumulates arc weights using the semiring Plus().\ntemplate <class A>\nclass DefaultAccumulator {\n public:\n  using Arc = A;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  DefaultAccumulator() {}\n\n  DefaultAccumulator(const DefaultAccumulator &acc, bool safe = false) {}\n\n  void Init(const Fst<Arc> &fst, bool copy = false) {}\n\n  void SetState(StateId state) {}\n\n  Weight Sum(Weight w, Weight v) { return Plus(w, v); }\n\n  template <class ArcIter>\n  Weight Sum(Weight w, ArcIter *aiter, ssize_t begin, ssize_t end) {\n    Adder<Weight> adder(w);  // maintains cumulative sum accurately\n    aiter->Seek(begin);\n    for (auto pos = begin; pos < end; aiter->Next(), ++pos)\n      adder.Add(aiter->Value().weight);\n    return adder.Sum();\n  }\n\n  constexpr bool Error() const { return false; }\n\n private:\n  DefaultAccumulator &operator=(const DefaultAccumulator &) = delete;\n};\n\n// This class accumulates arc weights using the log semiring Plus() assuming an\n// arc weight has a WeightConvert specialization to and from log64 weights.\ntemplate <class A>\nclass LogAccumulator {\n public:\n  using Arc = A;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  LogAccumulator() {}\n\n  LogAccumulator(const LogAccumulator &acc, bool safe = false) {}\n\n  void Init(const Fst<Arc> &fst, bool copy = false) {}\n\n  void SetState(StateId s) {}\n\n  Weight Sum(Weight w, Weight v) { return LogPlus(w, v); }\n\n  template <class ArcIter>\n  Weight Sum(Weight w, ArcIter *aiter, ssize_t begin, ssize_t end) {\n    auto sum = w;\n    aiter->Seek(begin);\n    for (auto pos = begin; pos < end; aiter->Next(), ++pos) {\n      sum = LogPlus(sum, aiter->Value().weight);\n    }\n    return sum;\n  }\n\n  constexpr bool Error() const { return false; }\n\n private:\n  Weight LogPlus(Weight w, Weight v) {\n    if (w == Weight::Zero()) {\n      return v;\n    }\n    const auto f1 = to_log_weight_(w).Value();\n    const auto f2 = to_log_weight_(v).Value();\n    if (f1 > f2) {\n      return to_weight_(Log64Weight(f2 - internal::LogPosExp(f1 - f2)));\n    } else {\n      return to_weight_(Log64Weight(f1 - internal::LogPosExp(f2 - f1)));\n    }\n  }\n\n  WeightConvert<Weight, Log64Weight> to_log_weight_;\n  WeightConvert<Log64Weight, Weight> to_weight_;\n\n  LogAccumulator &operator=(const LogAccumulator &) = delete;\n};\n\n// Interface for shareable data for fast log accumulator copies. Holds pointers\n// to data only, storage is provided by derived classes.\nclass FastLogAccumulatorData {\n public:\n  FastLogAccumulatorData(int arc_limit, int arc_period)\n      : arc_limit_(arc_limit),\n        arc_period_(arc_period),\n        weights_ptr_(nullptr),\n        num_weights_(0),\n        weight_positions_ptr_(nullptr),\n        num_positions_(0) {}\n\n  virtual ~FastLogAccumulatorData() {}\n\n  // Cummulative weight per state for all states s.t. # of arcs > arc_limit_\n  // with arcs in order. The first element per state is Log64Weight::Zero().\n  const double *Weights() const { return weights_ptr_; }\n\n  int NumWeights() const { return num_weights_; }\n\n  // Maps from state to corresponding beginning weight position in weights_.\n  // osition -1 means no pre-computed weights for that state.\n  const int *WeightPositions() const { return weight_positions_ptr_; }\n\n  int NumPositions() const { return num_positions_; }\n\n  int ArcLimit() const { return arc_limit_; }\n\n  int ArcPeriod() const { return arc_period_; }\n\n  // Returns true if the data object is mutable and supports SetData().\n  virtual bool IsMutable() const = 0;\n\n  // Does not take ownership but may invalidate the contents of weights and\n  // weight_positions.\n  virtual void SetData(std::vector<double> *weights,\n                       std::vector<int> *weight_positions) = 0;\n\n protected:\n  void Init(int num_weights, const double *weights, int num_positions,\n            const int *weight_positions) {\n    weights_ptr_ = weights;\n    num_weights_ = num_weights;\n    weight_positions_ptr_ = weight_positions;\n    num_positions_ = num_positions;\n  }\n\n private:\n  const int arc_limit_;\n  const int arc_period_;\n  const double *weights_ptr_;\n  int num_weights_;\n  const int *weight_positions_ptr_;\n  int num_positions_;\n\n  FastLogAccumulatorData(const FastLogAccumulatorData &) = delete;\n  FastLogAccumulatorData &operator=(const FastLogAccumulatorData &) = delete;\n};\n\n// FastLogAccumulatorData with mutable storage; filled by\n// FastLogAccumulator::Init.\nclass MutableFastLogAccumulatorData : public FastLogAccumulatorData {\n public:\n  MutableFastLogAccumulatorData(int arc_limit, int arc_period)\n      : FastLogAccumulatorData(arc_limit, arc_period) {}\n\n  bool IsMutable() const override { return true; }\n\n  void SetData(std::vector<double> *weights,\n               std::vector<int> *weight_positions) override {\n    weights_.swap(*weights);\n    weight_positions_.swap(*weight_positions);\n    Init(weights_.size(), weights_.data(), weight_positions_.size(),\n         weight_positions_.data());\n  }\n\n private:\n  std::vector<double> weights_;\n  std::vector<int> weight_positions_;\n\n  MutableFastLogAccumulatorData(const MutableFastLogAccumulatorData &) = delete;\n  MutableFastLogAccumulatorData &operator=(\n      const MutableFastLogAccumulatorData &) = delete;\n};\n\n// This class accumulates arc weights using the log semiring Plus() assuming an\n// arc weight has a WeightConvert specialization to and from log64 weights. The\n// member function Init(fst) has to be called to setup pre-computed weight\n// information.\ntemplate <class A>\nclass FastLogAccumulator {\n public:\n  using Arc = A;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  explicit FastLogAccumulator(ssize_t arc_limit = 20, ssize_t arc_period = 10)\n      : to_log_weight_(),\n        to_weight_(),\n        arc_limit_(arc_limit),\n        arc_period_(arc_period),\n        data_(std::make_shared<MutableFastLogAccumulatorData>(arc_limit,\n                                                              arc_period)),\n        state_weights_(nullptr),\n        error_(false) {}\n\n  explicit FastLogAccumulator(std::shared_ptr<FastLogAccumulatorData> data)\n      : to_log_weight_(),\n        to_weight_(),\n        arc_limit_(data->ArcLimit()),\n        arc_period_(data->ArcPeriod()),\n        data_(data),\n        state_weights_(nullptr),\n        error_(false) {}\n\n  FastLogAccumulator(const FastLogAccumulator<Arc> &acc, bool safe = false)\n      : to_log_weight_(),\n        to_weight_(),\n        arc_limit_(acc.arc_limit_),\n        arc_period_(acc.arc_period_),\n        data_(acc.data_),\n        state_weights_(nullptr),\n        error_(acc.error_) {}\n\n  void SetState(StateId s) {\n    const auto *weights = data_->Weights();\n    const auto *weight_positions = data_->WeightPositions();\n    state_weights_ = nullptr;\n    if (s < data_->NumPositions()) {\n      const auto pos = weight_positions[s];\n      if (pos >= 0) state_weights_ = &(weights[pos]);\n    }\n  }\n\n  Weight Sum(Weight w, Weight v) const { return LogPlus(w, v); }\n\n  template <class ArcIter>\n  Weight Sum(Weight w, ArcIter *aiter, ssize_t begin, ssize_t end) const {\n    if (error_) return Weight::NoWeight();\n    auto sum = w;\n    // Finds begin and end of pre-stored weights.\n    ssize_t index_begin = -1;\n    ssize_t index_end = -1;\n    ssize_t stored_begin = end;\n    ssize_t stored_end = end;\n    if (state_weights_) {\n      index_begin = begin > 0 ? (begin - 1) / arc_period_ + 1 : 0;\n      index_end = end / arc_period_;\n      stored_begin = index_begin * arc_period_;\n      stored_end = index_end * arc_period_;\n    }\n    // Computes sum before pre-stored weights.\n    if (begin < stored_begin) {\n      const auto pos_end = std::min(stored_begin, end);\n      aiter->Seek(begin);\n      for (auto pos = begin; pos < pos_end; aiter->Next(), ++pos) {\n        sum = LogPlus(sum, aiter->Value().weight);\n      }\n    }\n    // Computes sum between pre-stored weights.\n    if (stored_begin < stored_end) {\n      const auto f1 = state_weights_[index_end];\n      const auto f2 = state_weights_[index_begin];\n      if (f1 < f2) sum = LogPlus(sum, LogMinus(f1, f2));\n      // Commented out for efficiency; adds Zero().\n      /*\n      else {\n        // explicitly computes if cumulative sum lacks precision\n        aiter->Seek(stored_begin);\n        for (auto pos = stored_begin; pos < stored_end; aiter->Next(), ++pos)\n          sum = LogPlus(sum, aiter->Value().weight);\n      }\n      */\n    }\n    // Computes sum after pre-stored weights.\n    if (stored_end < end) {\n      const auto pos_start = std::max(stored_begin, stored_end);\n      aiter->Seek(pos_start);\n      for (auto pos = pos_start; pos < end; aiter->Next(), ++pos) {\n        sum = LogPlus(sum, aiter->Value().weight);\n      }\n    }\n    return sum;\n  }\n\n  template <class FST>\n  void Init(const FST &fst, bool copy = false) {\n    if (copy || !data_->IsMutable()) return;\n    if (data_->NumPositions() != 0 || arc_limit_ < arc_period_) {\n      FSTERROR() << \"FastLogAccumulator: Initialization error\";\n      error_ = true;\n      return;\n    }\n    std::vector<double> weights;\n    std::vector<int> weight_positions;\n    weight_positions.reserve(CountStates(fst));\n    for (StateIterator<FST> siter(fst); !siter.Done(); siter.Next()) {\n      const auto s = siter.Value();\n      if (fst.NumArcs(s) >= arc_limit_) {\n        auto sum = FloatLimits<double>::PosInfinity();\n        if (weight_positions.size() <= s) weight_positions.resize(s + 1, -1);\n        weight_positions[s] = weights.size();\n        weights.push_back(sum);\n        size_t narcs = 0;\n        ArcIterator<FST> aiter(fst, s);\n        aiter.SetFlags(kArcWeightValue | kArcNoCache, kArcFlags);\n        for (; !aiter.Done(); aiter.Next()) {\n          const auto &arc = aiter.Value();\n          sum = LogPlus(sum, arc.weight);\n          // Stores cumulative weight distribution per arc_period_.\n          if (++narcs % arc_period_ == 0) weights.push_back(sum);\n        }\n      }\n    }\n    data_->SetData(&weights, &weight_positions);\n  }\n\n  bool Error() const { return error_; }\n\n  std::shared_ptr<FastLogAccumulatorData> GetData() const { return data_; }\n\n private:\n  static double LogPosExp(double x) {\n    return x == FloatLimits<double>::PosInfinity() ? 0.0\n                                                   : log(1.0F + exp(-x));\n  }\n\n  static double LogMinusExp(double x) {\n    return x == FloatLimits<double>::PosInfinity() ? 0.0\n                                                   : log(1.0F - exp(-x));\n  }\n\n  Weight LogPlus(Weight w, Weight v) const {\n    if (w == Weight::Zero()) {\n      return v;\n    }\n    const auto f1 = to_log_weight_(w).Value();\n    const auto f2 = to_log_weight_(v).Value();\n    if (f1 > f2) {\n      return to_weight_(Log64Weight(f2 - LogPosExp(f1 - f2)));\n    } else {\n      return to_weight_(Log64Weight(f1 - LogPosExp(f2 - f1)));\n    }\n  }\n\n  double LogPlus(double f1, Weight v) const {\n    const auto f2 = to_log_weight_(v).Value();\n    if (f1 == FloatLimits<double>::PosInfinity()) {\n      return f2;\n    } else if (f1 > f2) {\n      return f2 - LogPosExp(f1 - f2);\n    } else {\n      return f1 - LogPosExp(f2 - f1);\n    }\n  }\n\n  // Assumes f1 < f2.\n  Weight LogMinus(double f1, double f2) const {\n    if (f2 == FloatLimits<double>::PosInfinity()) {\n      return to_weight_(Log64Weight(f1));\n    } else {\n      return to_weight_(Log64Weight(f1 - LogMinusExp(f2 - f1)));\n    }\n  }\n\n  const WeightConvert<Weight, Log64Weight> to_log_weight_;\n  const WeightConvert<Log64Weight, Weight> to_weight_;\n  const ssize_t arc_limit_;   // Minimum number of arcs to pre-compute state.\n  const ssize_t arc_period_;  // Saves cumulative weights per arc_period_.\n  std::shared_ptr<FastLogAccumulatorData> data_;\n  const double *state_weights_;\n  bool error_;\n\n  FastLogAccumulator &operator=(const FastLogAccumulator &) = delete;\n};\n\n// Stores shareable data for cache log accumulator copies. All copies share the\n// same cache.\ntemplate <class Arc>\nclass CacheLogAccumulatorData {\n public:\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  CacheLogAccumulatorData(bool gc, size_t gc_limit)\n      : cache_gc_(gc), cache_limit_(gc_limit), cache_size_(0) {}\n\n  CacheLogAccumulatorData(const CacheLogAccumulatorData<Arc> &data)\n      : cache_gc_(data.cache_gc_),\n        cache_limit_(data.cache_limit_),\n        cache_size_(0) {}\n\n  bool CacheDisabled() const { return cache_gc_ && cache_limit_ == 0; }\n\n  std::vector<double> *GetWeights(StateId s) {\n    auto it = cache_.find(s);\n    if (it != cache_.end()) {\n      it->second.recent = true;\n      return it->second.weights.get();\n    } else {\n      return nullptr;\n    }\n  }\n\n  void AddWeights(StateId s, std::vector<double> *weights) {\n    if (cache_gc_ && cache_size_ >= cache_limit_) GC(false);\n    cache_.insert(std::make_pair(s, CacheState(weights, true)));\n    if (cache_gc_) cache_size_ += weights->capacity() * sizeof(double);\n  }\n\n private:\n  // Cached information for a given state.\n  struct CacheState {\n    std::unique_ptr<std::vector<double>> weights;  // Accumulated weights.\n    bool recent;  // Has this state been accessed since last GC?\n\n    CacheState(std::vector<double> *weights, bool recent)\n        : weights(weights), recent(recent) {}\n  };\n\n  // Garbage collect: Deletes from cache states that have not been accessed\n  // since the last GC ('free_recent = false') until 'cache_size_' is 2/3 of\n  // 'cache_limit_'. If it does not free enough memory, start deleting\n  // recently accessed states.\n  void GC(bool free_recent) {\n    auto cache_target = (2 * cache_limit_) / 3 + 1;\n    auto it = cache_.begin();\n    while (it != cache_.end() && cache_size_ > cache_target) {\n      auto &cs = it->second;\n      if (free_recent || !cs.recent) {\n        cache_size_ -= cs.weights->capacity() * sizeof(double);\n        cache_.erase(it++);\n      } else {\n        cs.recent = false;\n        ++it;\n      }\n    }\n    if (!free_recent && cache_size_ > cache_target) GC(true);\n  }\n\n  std::unordered_map<StateId, CacheState> cache_;  // Cache.\n  bool cache_gc_;       // Enables garbage collection.\n  size_t cache_limit_;  // # of bytes cached.\n  size_t cache_size_;   // # of bytes allowed before GC.\n\n  CacheLogAccumulatorData &operator=(const CacheLogAccumulatorData &) = delete;\n};\n\n// This class accumulates arc weights using the log semiring Plus() has a\n// WeightConvert specialization to and from log64 weights. It is similar to the\n// FastLogAccumator. However here, the accumulated weights are pre-computed and\n// stored only for the states that are visited. The member function Init(fst)\n// has to be called to setup this accumulator.\ntemplate <class Arc>\nclass CacheLogAccumulator {\n public:\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  explicit CacheLogAccumulator(ssize_t arc_limit = 10, bool gc = false,\n                               size_t gc_limit = 10 * 1024 * 1024)\n      : arc_limit_(arc_limit),\n        data_(std::make_shared<CacheLogAccumulatorData<Arc>>(gc, gc_limit)),\n        s_(kNoStateId),\n        error_(false) {}\n\n  CacheLogAccumulator(const CacheLogAccumulator<Arc> &acc, bool safe = false)\n      : arc_limit_(acc.arc_limit_),\n        fst_(acc.fst_ ? acc.fst_->Copy() : nullptr),\n        data_(safe ? std::make_shared<CacheLogAccumulatorData<Arc>>(*acc.data_)\n                   : acc.data_),\n        s_(kNoStateId),\n        error_(acc.error_) {}\n\n  // Argument arc_limit specifies the minimum number of arcs to pre-compute.\n  void Init(const Fst<Arc> &fst, bool copy = false) {\n    if (!copy && fst_) {\n      FSTERROR() << \"CacheLogAccumulator: Initialization error\";\n      error_ = true;\n      return;\n    }\n    fst_.reset(fst.Copy());\n  }\n\n  void SetState(StateId s, int depth = 0) {\n    if (s == s_) return;\n    s_ = s;\n    if (data_->CacheDisabled() || error_) {\n      weights_ = nullptr;\n      return;\n    }\n    if (!fst_) {\n      FSTERROR() << \"CacheLogAccumulator::SetState: Incorrectly initialized\";\n      error_ = true;\n      weights_ = nullptr;\n      return;\n    }\n    weights_ = data_->GetWeights(s);\n    if ((weights_ == nullptr) && (fst_->NumArcs(s) >= arc_limit_)) {\n      weights_ = new std::vector<double>;\n      weights_->reserve(fst_->NumArcs(s) + 1);\n      weights_->push_back(FloatLimits<double>::PosInfinity());\n      data_->AddWeights(s, weights_);\n    }\n  }\n\n  Weight Sum(Weight w, Weight v) { return LogPlus(w, v); }\n\n  template <class ArcIter>\n  Weight Sum(Weight w, ArcIter *aiter, ssize_t begin, ssize_t end) {\n    if (weights_ == nullptr) {\n      auto sum = w;\n      aiter->Seek(begin);\n      for (auto pos = begin; pos < end; aiter->Next(), ++pos) {\n        sum = LogPlus(sum, aiter->Value().weight);\n      }\n      return sum;\n    } else {\n      Extend(end, aiter);\n      const auto &f1 = (*weights_)[end];\n      const auto &f2 = (*weights_)[begin];\n      if (f1 < f2) {\n        return LogPlus(w, LogMinus(f1, f2));\n      } else {\n        // Commented out for efficiency; adds Zero().\n        /*\n        auto sum = w;\n        // Explicitly computes if cumulative sum lacks precision.\n        aiter->Seek(begin);\n        for (auto pos = begin; pos < end; aiter->Next(), ++pos) {\n          sum = LogPlus(sum, aiter->Value().weight);\n        }\n        return sum;\n        */\n        return w;\n      }\n    }\n  }\n\n  // Returns first position from aiter->Position() whose accumulated\n  // value is greater or equal to w (w.r.t. Zero() < One()). The\n  // iterator may be repositioned.\n  template <class ArcIter>\n  size_t LowerBound(Weight w, ArcIter *aiter) {\n    const auto f = to_log_weight_(w).Value();\n    auto pos = aiter->Position();\n    if (weights_) {\n      Extend(fst_->NumArcs(s_), aiter);\n      return std::lower_bound(weights_->begin() + pos + 1, weights_->end(),\n                              f, std::greater<double>()) -\n          weights_->begin() - 1;\n    } else {\n      size_t n = 0;\n      auto x = FloatLimits<double>::PosInfinity();\n      for (aiter->Reset(); !aiter->Done(); aiter->Next(), ++n) {\n        x = LogPlus(x, aiter->Value().weight);\n        if (n >= pos && x <= f) break;\n      }\n      return n;\n    }\n  }\n\n  bool Error() const { return error_; }\n\n private:\n  double LogPosExp(double x) {\n    return x == FloatLimits<double>::PosInfinity() ? 0.0\n                                                   : log(1.0F + exp(-x));\n  }\n\n  double LogMinusExp(double x) {\n    return x == FloatLimits<double>::PosInfinity() ? 0.0\n                                                   : log(1.0F - exp(-x));\n  }\n\n  Weight LogPlus(Weight w, Weight v) {\n    if (w == Weight::Zero()) {\n      return v;\n    }\n    const auto f1 = to_log_weight_(w).Value();\n    const auto f2 = to_log_weight_(v).Value();\n    if (f1 > f2) {\n      return to_weight_(Log64Weight(f2 - LogPosExp(f1 - f2)));\n    } else {\n      return to_weight_(Log64Weight(f1 - LogPosExp(f2 - f1)));\n    }\n  }\n\n  double LogPlus(double f1, Weight v) {\n    const auto f2 = to_log_weight_(v).Value();\n    if (f1 == FloatLimits<double>::PosInfinity()) {\n      return f2;\n    } else if (f1 > f2) {\n      return f2 - LogPosExp(f1 - f2);\n    } else {\n      return f1 - LogPosExp(f2 - f1);\n    }\n  }\n\n  // Assumes f1 < f2.\n  Weight LogMinus(double f1, double f2) {\n    if (f2 == FloatLimits<double>::PosInfinity()) {\n      return to_weight_(Log64Weight(f1));\n    } else {\n      return to_weight_(Log64Weight(f1 - LogMinusExp(f2 - f1)));\n    }\n  }\n\n  // Extends weights up to index 'end'.\n  template <class ArcIter>\n  void Extend(ssize_t end, ArcIter *aiter) {\n    if (weights_->size() <= end) {\n      for (aiter->Seek(weights_->size() - 1); weights_->size() <= end;\n           aiter->Next()) {\n        weights_->push_back(LogPlus(weights_->back(), aiter->Value().weight));\n      }\n    }\n  }\n\n\n  WeightConvert<Weight, Log64Weight> to_log_weight_;\n  WeightConvert<Log64Weight, Weight> to_weight_;\n  ssize_t arc_limit_;                    // Minimum # of arcs to cache a state.\n  std::vector<double> *weights_;         // Accumulated weights for cur. state.\n  std::unique_ptr<const Fst<Arc>> fst_;  // Input FST.\n  std::shared_ptr<CacheLogAccumulatorData<Arc>> data_;  // Cache data.\n  StateId s_;                                           // Current state.\n  bool error_;\n};\n\n// Stores shareable data for replace accumulator copies.\ntemplate <class Accumulator, class T>\nclass ReplaceAccumulatorData {\n public:\n  using Arc = typename Accumulator::Arc;\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using StateTable = T;\n  using StateTuple = typename StateTable::StateTuple;\n\n  ReplaceAccumulatorData() : state_table_(nullptr) {}\n\n  explicit ReplaceAccumulatorData(\n      const std::vector<Accumulator *> &accumulators)\n      : state_table_(nullptr) {\n    accumulators_.reserve(accumulators.size());\n    for (const auto accumulator : accumulators) {\n      accumulators_.emplace_back(accumulator);\n    }\n  }\n\n  void Init(const std::vector<std::pair<Label, const Fst<Arc> *>> &fst_tuples,\n            const StateTable *state_table) {\n    state_table_ = state_table;\n    accumulators_.resize(fst_tuples.size());\n    for (Label i = 0; i < accumulators_.size(); ++i) {\n      if (!accumulators_[i]) {\n        accumulators_[i].reset(new Accumulator());\n        accumulators_[i]->Init(*(fst_tuples[i].second));\n      }\n      fst_array_.emplace_back(fst_tuples[i].second->Copy());\n    }\n  }\n\n  const StateTuple &GetTuple(StateId s) const { return state_table_->Tuple(s); }\n\n  Accumulator *GetAccumulator(size_t i) { return accumulators_[i].get(); }\n\n  const Fst<Arc> *GetFst(size_t i) const { return fst_array_[i].get(); }\n\n private:\n  const StateTable *state_table_;\n  std::vector<std::unique_ptr<Accumulator>> accumulators_;\n  std::vector<std::unique_ptr<const Fst<Arc>>> fst_array_;\n};\n\n// This class accumulates weights in a ReplaceFst.  The 'Init' method takes as\n// input the argument used to build the ReplaceFst and the ReplaceFst state\n// table. It uses accumulators of type 'Accumulator' in the underlying FSTs.\ntemplate <class Accumulator,\n          class T = DefaultReplaceStateTable<typename Accumulator::Arc>>\nclass ReplaceAccumulator {\n public:\n  using Arc = typename Accumulator::Arc;\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using StateTable = T;\n  using StateTuple = typename StateTable::StateTuple;\n  using Weight = typename Arc::Weight;\n\n  ReplaceAccumulator()\n      : init_(false),\n        data_(std::make_shared<\n              ReplaceAccumulatorData<Accumulator, StateTable>>()),\n        error_(false) {}\n\n  explicit ReplaceAccumulator(const std::vector<Accumulator *> &accumulators)\n      : init_(false),\n        data_(std::make_shared<ReplaceAccumulatorData<Accumulator, StateTable>>(\n            accumulators)),\n        error_(false) {}\n\n  ReplaceAccumulator(const ReplaceAccumulator<Accumulator, StateTable> &acc,\n                     bool safe = false)\n      : init_(acc.init_), data_(acc.data_), error_(acc.error_) {\n    if (!init_) {\n      FSTERROR() << \"ReplaceAccumulator: Can't copy unintialized accumulator\";\n    }\n    if (safe) FSTERROR() << \"ReplaceAccumulator: Safe copy not supported\";\n  }\n\n  // Does not take ownership of the state table, the state table is owned by\n  // the ReplaceFst.\n  void Init(const std::vector<std::pair<Label, const Fst<Arc> *>> &fst_tuples,\n            const StateTable *state_table) {\n    init_ = true;\n    data_->Init(fst_tuples, state_table);\n  }\n\n  // Method required by LookAheadMatcher. However, ReplaceAccumulator needs to\n  // be initialized by calling the Init method above before being passed to\n  // LookAheadMatcher.\n  //\n  // TODO(allauzen): Revisit this. Consider creating a method\n  // Init(const ReplaceFst<A, T, C>&, bool) and using friendship to get access\n  // to the innards of ReplaceFst.\n  void Init(const Fst<Arc> &fst, bool copy = false) {\n    if (!init_) {\n      FSTERROR() << \"ReplaceAccumulator::Init: Accumulator needs to be\"\n                 << \" initialized before being passed to LookAheadMatcher\";\n      error_ = true;\n    }\n  }\n\n  void SetState(StateId s) {\n    if (!init_) {\n      FSTERROR() << \"ReplaceAccumulator::SetState: Incorrectly initialized\";\n      error_ = true;\n      return;\n    }\n    auto tuple = data_->GetTuple(s);\n    fst_id_ = tuple.fst_id - 1;  // Replace FST ID is 1-based.\n    data_->GetAccumulator(fst_id_)->SetState(tuple.fst_state);\n    if ((tuple.prefix_id != 0) &&\n        (data_->GetFst(fst_id_)->Final(tuple.fst_state) != Weight::Zero())) {\n      offset_ = 1;\n      offset_weight_ = data_->GetFst(fst_id_)->Final(tuple.fst_state);\n    } else {\n      offset_ = 0;\n      offset_weight_ = Weight::Zero();\n    }\n    aiter_.reset(\n        new ArcIterator<Fst<Arc>>(*data_->GetFst(fst_id_), tuple.fst_state));\n  }\n\n  Weight Sum(Weight w, Weight v) {\n    if (error_) return Weight::NoWeight();\n    return data_->GetAccumulator(fst_id_)->Sum(w, v);\n  }\n\n  template <class ArcIter>\n  Weight Sum(Weight w, ArcIter *aiter, ssize_t begin, ssize_t end) {\n    if (error_) return Weight::NoWeight();\n    auto sum = begin == end ? Weight::Zero()\n                            : data_->GetAccumulator(fst_id_)->Sum(\n                                  w, aiter_.get(), begin ? begin - offset_ : 0,\n                                  end - offset_);\n    if (begin == 0 && end != 0 && offset_ > 0) sum = Sum(offset_weight_, sum);\n    return sum;\n  }\n\n  bool Error() const { return error_; }\n\n private:\n  bool init_;\n  std::shared_ptr<ReplaceAccumulatorData<Accumulator, StateTable>> data_;\n  Label fst_id_;\n  size_t offset_;\n  Weight offset_weight_;\n  std::unique_ptr<ArcIterator<Fst<Arc>>> aiter_;\n  bool error_;\n};\n\n// SafeReplaceAccumulator accumulates weights in a ReplaceFst and copies of it\n// are always thread-safe copies.\ntemplate <class Accumulator, class T>\nclass SafeReplaceAccumulator {\n public:\n  using Arc = typename Accumulator::Arc;\n  using StateId = typename Arc::StateId;\n  using Label = typename Arc::Label;\n  using Weight = typename Arc::Weight;\n  using StateTable = T;\n  using StateTuple = typename StateTable::StateTuple;\n\n  SafeReplaceAccumulator() {}\n\n  SafeReplaceAccumulator(const SafeReplaceAccumulator &copy, bool safe)\n      : SafeReplaceAccumulator(copy) {}\n\n  explicit SafeReplaceAccumulator(\n      const std::vector<Accumulator> &accumulators) {\n    for (const auto &accumulator : accumulators) {\n      accumulators_.emplace_back(accumulator, true);\n    }\n  }\n\n  void Init(const std::vector<std::pair<Label, const Fst<Arc> *>> &fst_tuples,\n            const StateTable *state_table) {\n    state_table_ = state_table;\n    for (Label i = 0; i < fst_tuples.size(); ++i) {\n      if (i == accumulators_.size()) {\n        accumulators_.resize(accumulators_.size() + 1);\n        accumulators_[i].Init(*(fst_tuples[i].second));\n      }\n      fst_array_.emplace_back(fst_tuples[i].second->Copy(true));\n    }\n    init_ = true;\n  }\n\n  void Init(const Fst<Arc> &fst, bool copy = false) {\n    if (!init_) {\n      FSTERROR() << \"SafeReplaceAccumulator::Init: Accumulator needs to be\"\n                 << \" initialized before being passed to LookAheadMatcher\";\n      error_ = true;\n    }\n  }\n\n  void SetState(StateId s) {\n    auto tuple = state_table_->Tuple(s);\n    fst_id_ = tuple.fst_id - 1;  // Replace FST ID is 1-based\n    GetAccumulator(fst_id_)->SetState(tuple.fst_state);\n    offset_ = 0;\n    offset_weight_ = Weight::Zero();\n    const auto final_weight = GetFst(fst_id_)->Final(tuple.fst_state);\n    if ((tuple.prefix_id != 0) && (final_weight != Weight::Zero())) {\n      offset_ = 1;\n      offset_weight_ = final_weight;\n    }\n    aiter_.Set(*GetFst(fst_id_), tuple.fst_state);\n  }\n\n  Weight Sum(Weight w, Weight v) {\n    if (error_) return Weight::NoWeight();\n    return GetAccumulator(fst_id_)->Sum(w, v);\n  }\n\n  template <class ArcIter>\n  Weight Sum(Weight w, ArcIter *aiter, ssize_t begin, ssize_t end) {\n    if (error_) return Weight::NoWeight();\n    if (begin == end) return Weight::Zero();\n    auto sum = GetAccumulator(fst_id_)->Sum(\n        w, aiter_.get(), begin ? begin - offset_ : 0, end - offset_);\n    if (begin == 0 && end != 0 && offset_ > 0) {\n      sum = Sum(offset_weight_, sum);\n    }\n    return sum;\n  }\n\n  bool Error() const { return error_; }\n\n private:\n  class ArcIteratorPtr {\n   public:\n    ArcIteratorPtr() {}\n\n    ArcIteratorPtr(const ArcIteratorPtr &copy) {}\n\n    void Set(const Fst<Arc> &fst, StateId state_id) {\n      ptr_.reset(new ArcIterator<Fst<Arc>>(fst, state_id));\n    }\n\n    ArcIterator<Fst<Arc>> *get() { return ptr_.get(); }\n\n   private:\n    std::unique_ptr<ArcIterator<Fst<Arc>>> ptr_;\n  };\n\n  Accumulator *GetAccumulator(size_t i) { return &accumulators_[i]; }\n\n  const Fst<Arc> *GetFst(size_t i) const { return fst_array_[i].get(); }\n\n  const StateTable *state_table_;\n  std::vector<Accumulator> accumulators_;\n  std::vector<std::shared_ptr<Fst<Arc>>> fst_array_;\n  ArcIteratorPtr aiter_;\n  bool init_ = false;\n  bool error_ = false;\n  Label fst_id_;\n  size_t offset_;\n  Weight offset_weight_;\n};\n\n}  // namespace fst\n\n#endif  // FST_ACCUMULATOR_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/add-on.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// FST implementation class to attach an arbitrary object with a read/write\n// method to an FST and its file representation. The FST is given a new type\n// name.\n\n#ifndef FST_ADD_ON_H_\n#define FST_ADD_ON_H_\n\n#include <stddef.h>\n#include <memory>\n#include <string>\n#include <utility>\n\n#include <fst/log.h>\n\n#include <fst/fst.h>\n\n\nnamespace fst {\n\n// Identifies stream data as an add-on FST.\nstatic constexpr int32 kAddOnMagicNumber = 446681434;\n\n// Nothing to save.\nclass NullAddOn {\n public:\n  NullAddOn() {}\n\n  static NullAddOn *Read(std::istream &strm, const FstReadOptions &opts) {\n    return new NullAddOn();\n  }\n\n  bool Write(std::ostream &ostrm, const FstWriteOptions &opts) const {\n    return true;\n  }\n};\n\n// Create a new add-on from a pair of add-ons.\ntemplate <class A1, class A2>\nclass AddOnPair {\n public:\n  // Argument reference count incremented.\n  AddOnPair(std::shared_ptr<A1> a1, std::shared_ptr<A2> a2)\n      : a1_(std::move(a1)), a2_(std::move(a2)) {}\n\n  const A1 *First() const { return a1_.get(); }\n\n  const A2 *Second() const { return a2_.get(); }\n\n  std::shared_ptr<A1> SharedFirst() const { return a1_; }\n\n  std::shared_ptr<A2> SharedSecond() const { return a2_; }\n\n  static AddOnPair<A1, A2> *Read(std::istream &istrm,\n                                 const FstReadOptions &opts) {\n    A1 *a1 = nullptr;\n    bool have_addon1 = false;\n    ReadType(istrm, &have_addon1);\n    if (have_addon1) a1 = A1::Read(istrm, opts);\n\n    A2 *a2 = nullptr;\n    bool have_addon2 = false;\n    ReadType(istrm, &have_addon2);\n    if (have_addon2) a2 = A2::Read(istrm, opts);\n\n    return new AddOnPair<A1, A2>(std::shared_ptr<A1>(a1),\n                                 std::shared_ptr<A2>(a2));\n  }\n\n  bool Write(std::ostream &ostrm, const FstWriteOptions &opts) const {\n    bool have_addon1 = a1_ != nullptr;\n    WriteType(ostrm, have_addon1);\n    if (have_addon1) a1_->Write(ostrm, opts);\n    bool have_addon2 = a2_ != nullptr;\n    WriteType(ostrm, have_addon2);\n    if (have_addon2) a2_->Write(ostrm, opts);\n    return true;\n  }\n\n private:\n  std::shared_ptr<A1> a1_;\n  std::shared_ptr<A2> a2_;\n};\n\nnamespace internal {\n\n// Adds an object of type T to an FST. T must support:\n//\n//     T* Read(std::istream &);\n//     bool Write(std::ostream &);\n//\n// The resulting type is a new FST implementation.\ntemplate <class FST, class T>\nclass AddOnImpl : public FstImpl<typename FST::Arc> {\n public:\n  using Arc = typename FST::Arc;\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using FstImpl<Arc>::SetType;\n  using FstImpl<Arc>::SetInputSymbols;\n  using FstImpl<Arc>::SetOutputSymbols;\n  using FstImpl<Arc>::SetProperties;\n  using FstImpl<Arc>::WriteHeader;\n\n  // We make a thread-safe copy of the FST by default since an FST\n  // implementation is expected to not share mutable data between objects.\n  AddOnImpl(const FST &fst, const string &type,\n            std::shared_ptr<T> t = std::shared_ptr<T>())\n      : fst_(fst, true), t_(std::move(t)) {\n    SetType(type);\n    SetProperties(fst_.Properties(kFstProperties, false));\n    SetInputSymbols(fst_.InputSymbols());\n    SetOutputSymbols(fst_.OutputSymbols());\n  }\n\n  // Conversion from const Fst<Arc> & to F always copies the underlying\n  // implementation.\n  AddOnImpl(const Fst<Arc> &fst, const string &type,\n            std::shared_ptr<T> t = std::shared_ptr<T>())\n      : fst_(fst), t_(std::move(t)) {\n    SetType(type);\n    SetProperties(fst_.Properties(kFstProperties, false));\n    SetInputSymbols(fst_.InputSymbols());\n    SetOutputSymbols(fst_.OutputSymbols());\n  }\n\n  // We make a thread-safe copy of the FST by default since an FST\n  // implementation is expected to not share mutable data between objects.\n  AddOnImpl(const AddOnImpl<FST, T> &impl)\n      : fst_(impl.fst_, true), t_(impl.t_) {\n    SetType(impl.Type());\n    SetProperties(fst_.Properties(kCopyProperties, false));\n    SetInputSymbols(fst_.InputSymbols());\n    SetOutputSymbols(fst_.OutputSymbols());\n  }\n\n  StateId Start() const { return fst_.Start(); }\n\n  Weight Final(StateId s) const { return fst_.Final(s); }\n\n  size_t NumArcs(StateId s) const { return fst_.NumArcs(s); }\n\n  size_t NumInputEpsilons(StateId s) const { return fst_.NumInputEpsilons(s); }\n\n  size_t NumOutputEpsilons(StateId s) const {\n    return fst_.NumOutputEpsilons(s);\n  }\n\n  size_t NumStates() const { return fst_.NumStates(); }\n\n  static AddOnImpl<FST, T> *Read(std::istream &strm,\n                                 const FstReadOptions &opts) {\n    FstReadOptions nopts(opts);\n    FstHeader hdr;\n    if (!nopts.header) {\n      hdr.Read(strm, nopts.source);\n      nopts.header = &hdr;\n    }\n    std::unique_ptr<AddOnImpl<FST, T>> impl(\n        new AddOnImpl<FST, T>(nopts.header->FstType()));\n    if (!impl->ReadHeader(strm, nopts, kMinFileVersion, &hdr)) return nullptr;\n    impl.reset();\n    int32 magic_number = 0;\n    ReadType(strm, &magic_number);  // Ensures this is an add-on FST.\n    if (magic_number != kAddOnMagicNumber) {\n      LOG(ERROR) << \"AddOnImpl::Read: Bad add-on header: \" << nopts.source;\n      return nullptr;\n    }\n    FstReadOptions fopts(opts);\n    fopts.header = nullptr;  // Contained header was written out.\n    std::unique_ptr<FST> fst(FST::Read(strm, fopts));\n    if (!fst) return nullptr;\n    std::shared_ptr<T> t;\n    bool have_addon = false;\n    ReadType(strm, &have_addon);\n    if (have_addon) {  // Reads add-on object if present.\n      t = std::shared_ptr<T>(T::Read(strm, fopts));\n      if (!t) return nullptr;\n    }\n    return new AddOnImpl<FST, T>(*fst, nopts.header->FstType(), t);\n  }\n\n  bool Write(std::ostream &strm, const FstWriteOptions &opts) const {\n    FstHeader hdr;\n    FstWriteOptions nopts(opts);\n    nopts.write_isymbols = false;  // Allows contained FST to hold any symbols.\n    nopts.write_osymbols = false;\n    WriteHeader(strm, nopts, kFileVersion, &hdr);\n    WriteType(strm, kAddOnMagicNumber);  // Ensures this is an add-on FST.\n    FstWriteOptions fopts(opts);\n    fopts.write_header = true;  // Forces writing contained header.\n    if (!fst_.Write(strm, fopts)) return false;\n    bool have_addon = !!t_;\n    WriteType(strm, have_addon);\n    // Writes add-on object if present.\n    if (have_addon) t_->Write(strm, opts);\n    return true;\n  }\n\n  void InitStateIterator(StateIteratorData<Arc> *data) const {\n    fst_.InitStateIterator(data);\n  }\n\n  void InitArcIterator(StateId s, ArcIteratorData<Arc> *data) const {\n    fst_.InitArcIterator(s, data);\n  }\n\n  FST &GetFst() { return fst_; }\n\n  const FST &GetFst() const { return fst_; }\n\n  const T *GetAddOn() const { return t_.get(); }\n\n  std::shared_ptr<T> GetSharedAddOn() const { return t_; }\n\n  void SetAddOn(std::shared_ptr<T> t) { t_ = t; }\n\n private:\n  explicit AddOnImpl(const string &type) : t_() {\n    SetType(type);\n    SetProperties(kExpanded);\n  }\n\n  // Current file format version.\n  static constexpr int kFileVersion = 1;\n  // Minimum file format version supported.\n  static constexpr int kMinFileVersion = 1;\n\n  FST fst_;\n  std::shared_ptr<T> t_;\n\n  AddOnImpl &operator=(const AddOnImpl &) = delete;\n};\n\ntemplate <class FST, class T>\nconstexpr int AddOnImpl<FST, T>::kFileVersion;\n\ntemplate <class FST, class T>\nconstexpr int AddOnImpl<FST, T>::kMinFileVersion;\n\n}  // namespace internal\n}  // namespace fst\n\n#endif  // FST_ADD_ON_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/arc-arena.h",
    "content": "#ifndef FST_ARC_ARENA_H_\n#define FST_ARC_ARENA_H_\n\n#include <deque>\n#include <memory>\n#include <utility>\n#include <fst/fst.h>\n#include <fst/memory.h>\n#include <unordered_map>\n\nnamespace fst {\n\n// ArcArena is used for fast allocation of contiguous arrays of arcs.\n//\n// To create an arc array:\n//   for each state:\n//     for each arc:\n//       arena.PushArc();\n//     // Commits these arcs and returns pointer to them.\n//     Arc *arcs = arena.GetArcs();\n//\n//     OR\n//\n//     arena.DropArcs();  // Throws away current arcs, reuse the space.\n//\n// The arcs returned are guaranteed to be contiguous and the pointer returned\n// will never be invalidated until the arena is cleared for reuse.\n//\n// The contents of the arena can be released with a call to arena.Clear() after\n// which the arena will restart with an initial allocation capable of holding at\n// least all of the arcs requested in the last usage before Clear() making\n// subsequent uses of the Arena more efficient.\n//\n// The max_retained_size option can limit the amount of arc space requested on\n// Clear() to avoid excess growth from intermittent high usage.\ntemplate <typename Arc>\nclass ArcArena {\n public:\n  explicit ArcArena(size_t block_size = 256,\n                    size_t max_retained_size = 1e6)\n      : block_size_(block_size),\n        max_retained_size_(max_retained_size) {\n    blocks_.emplace_back(MakeSharedBlock(block_size_));\n    first_block_size_ = block_size_;\n    total_size_ = block_size_;\n    arcs_ = blocks_.back().get();\n    end_ = arcs_ + block_size_;\n    next_ = arcs_;\n  }\n\n  ArcArena(const ArcArena& copy)\n      : arcs_(copy.arcs_), next_(copy.next_), end_(copy.end_),\n        block_size_(copy.block_size_),\n        first_block_size_(copy.first_block_size_),\n        total_size_(copy.total_size_),\n        max_retained_size_(copy.max_retained_size_),\n        blocks_(copy.blocks_) {\n    NewBlock(block_size_);\n  }\n\n  void ReserveArcs(size_t n) {\n    if (next_ + n < end_) return;\n    NewBlock(n);\n  }\n\n  void PushArc(const Arc& arc) {\n    if (next_ == end_) {\n      size_t length = next_ - arcs_;\n      NewBlock(length * 2);\n    }\n    *next_ = arc;\n    ++next_;\n  }\n\n  const Arc* GetArcs() {\n    const auto *arcs = arcs_;\n    arcs_ = next_;\n    return arcs;\n  }\n\n  void DropArcs() { next_ = arcs_; }\n\n  size_t Size() { return total_size_; }\n\n  void Clear() {\n    blocks_.resize(1);\n    if (total_size_ > first_block_size_) {\n      first_block_size_ = std::min(max_retained_size_, total_size_);\n      blocks_.back() = MakeSharedBlock(first_block_size_);\n    }\n    total_size_ = first_block_size_;\n    arcs_ = blocks_.back().get();\n    end_ = arcs_ + first_block_size_;\n    next_ = arcs_;\n  }\n\n private:\n  // Allocates a new block with capacity of at least n or block_size,\n  // copying incomplete arc sequence from old block to new block.\n  void NewBlock(size_t n) {\n    const auto length = next_ - arcs_;\n    const auto new_block_size = std::max(n, block_size_);\n    total_size_ += new_block_size;\n    blocks_.emplace_back(MakeSharedBlock(new_block_size));\n    std::copy(arcs_, next_, blocks_.back().get());\n    arcs_ = blocks_.back().get();\n    next_ = arcs_ + length;\n    end_ = arcs_ + new_block_size;\n  }\n\n  std::shared_ptr<Arc> MakeSharedBlock(size_t size) {\n    return std::shared_ptr<Arc>(new Arc[size], std::default_delete<Arc[]>());\n  }\n\n  Arc *arcs_;\n  Arc *next_;\n  const Arc *end_;\n  size_t block_size_;\n  size_t first_block_size_;\n  size_t total_size_;\n  size_t max_retained_size_;\n  std::list<std::shared_ptr<Arc>> blocks_;\n};\n\n// ArcArenaStateStore uses a resusable ArcArena to store arc arrays and does not\n// require that the Expander call ReserveArcs first.\n//\n// TODO(tombagby): Make cache type configurable.\n// TODO(tombagby): Provide ThreadLocal/Concurrent configuration.\ntemplate <class A>\nclass ArcArenaStateStore {\n public:\n  using Arc = A;\n  using Weight = typename Arc::Weight;\n  using StateId = typename Arc::StateId;\n\n  ArcArenaStateStore() : arena_(64 * 1024) {\n  }\n\n  class State {\n   public:\n    Weight Final() const { return final_; }\n\n    size_t NumInputEpsilons() const { return niepsilons_; }\n\n    size_t NumOutputEpsilons() const { return noepsilons_; }\n\n    size_t NumArcs() const { return narcs_; }\n\n    const Arc &GetArc(size_t n) const { return arcs_[n]; }\n\n    const Arc *Arcs() const { return arcs_; }\n\n    int* MutableRefCount() const { return nullptr; }\n\n   private:\n    State(Weight weight, int32 niepsilons, int32 noepsilons, int32 narcs,\n          const Arc *arcs)\n        : final_(std::move(weight)),\n          niepsilons_(niepsilons),\n          noepsilons_(noepsilons),\n          narcs_(narcs),\n          arcs_(arcs) {}\n\n    Weight final_;\n    size_t niepsilons_;\n    size_t noepsilons_;\n    size_t narcs_;\n    const Arc *arcs_;\n\n    friend class ArcArenaStateStore<Arc>;\n  };\n\n  template <class Expander>\n  State *FindOrExpand(Expander &expander, StateId state_id) {  // NOLINT\n    auto it = cache_.insert(std::pair<StateId, State*>(state_id, nullptr));\n    if (!it.second) return it.first->second;\n    // Needs a new state.\n    StateBuilder builder(&arena_);\n    expander.Expand(state_id, &builder);\n    const auto arcs = arena_.GetArcs();\n    size_t narcs = builder.narcs_;\n    size_t niepsilons = 0;\n    size_t noepsilons = 0;\n    for (size_t i = 0; i < narcs; ++i) {\n      if (arcs[i].ilabel == 0) ++niepsilons;\n      if (arcs[i].olabel == 0) ++noepsilons;\n    }\n    states_.emplace_back(\n        State(builder.final_, niepsilons, noepsilons, narcs, arcs));\n    // Places it in the cache.\n    auto state = &states_.back();\n    it.first->second = state;\n    return state;\n  }\n\n  State *Find(StateId state_id) const {\n    auto it = cache_.find(state_id);\n    return (it == cache_.end()) ? nullptr : it->second;\n  }\n\n private:\n  class StateBuilder {\n   public:\n    explicit StateBuilder(ArcArena<Arc>* arena)\n       : arena_(arena), final_(Weight::Zero()), narcs_(0) {}\n\n    void SetFinal(Weight weight) { final_ = std::move(weight); }\n\n    void ReserveArcs(size_t n) { arena_->ReserveArcs(n); }\n\n    void AddArc(const Arc &arc) {\n      ++narcs_;\n      arena_->PushArc(arc);\n    }\n\n   private:\n    friend class ArcArenaStateStore<Arc>;\n\n    ArcArena<Arc> *arena_;\n    Weight final_;\n    size_t narcs_;\n  };\n\n  std::unordered_map<StateId, State *> cache_;\n  std::deque<State> states_;\n  ArcArena<Arc> arena_;\n};\n\n}  // namespace fst\n\n#endif  // FST_ARC_ARENA_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/arc-map.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Class to map over/transform arcs e.g., change semirings or\n// implement project/invert. Consider using when operation does\n// not change the number of arcs (except possibly superfinal arcs).\n\n#ifndef FST_ARC_MAP_H_\n#define FST_ARC_MAP_H_\n\n#include <string>\n#include <unordered_map>\n#include <utility>\n\n#include <fst/log.h>\n\n#include <fst/cache.h>\n#include <fst/mutable-fst.h>\n\n\nnamespace fst {\n\n// Determines how final weights are mapped.\nenum MapFinalAction {\n  // A final weight is mapped into a final weight. An error is raised if this\n  // is not possible.\n  MAP_NO_SUPERFINAL,\n  // A final weight is mapped to an arc to the superfinal state when the result\n  // cannot be represented as a final weight. The superfinal state will be\n  // added only if it is needed.\n  MAP_ALLOW_SUPERFINAL,\n  // A final weight is mapped to an arc to the superfinal state unless the\n  // result can be represented as a final weight of weight Zero(). The\n  // superfinal state is always added (if the input is not the empty FST).\n  MAP_REQUIRE_SUPERFINAL\n};\n\n// Determines how symbol tables are mapped.\nenum MapSymbolsAction {\n  // Symbols should be cleared in the result by the map.\n  MAP_CLEAR_SYMBOLS,\n  // Symbols should be copied from the input FST by the map.\n  MAP_COPY_SYMBOLS,\n  // Symbols should not be modified in the result by the map itself.\n  // (They may set by the mapper).\n  MAP_NOOP_SYMBOLS\n};\n\n// The ArcMapper interfaces defines how arcs and final weights are mapped.\n// This is useful for implementing operations that do not change the number of\n// arcs (expect possibly superfinal arcs).\n//\n// template <class A, class B>\n// class ArcMapper {\n//  public:\n//   using FromArc = A;\n//   using ToArc = B;\n//\n//   // Maps an arc type FromArc to arc type ToArc.\n//   ToArc operator()(const FromArc &arc);\n//\n//   // Specifies final action the mapper requires (see above).\n//   // The mapper will be passed final weights as arcs of the form\n//   // Arc(0, 0, weight, kNoStateId).\n//   MapFinalAction FinalAction() const;\n//\n//   // Specifies input symbol table action the mapper requires (see above).\n//   MapSymbolsAction InputSymbolsAction() const;\n//\n//   // Specifies output symbol table action the mapper requires (see above).\n//   MapSymbolsAction OutputSymbolsAction() const;\n//\n//   // This specifies the known properties of an FST mapped by this mapper. It\n//   takes as argument the input FSTs's known properties.\n//   uint64 Properties(uint64 props) const;\n// };\n//\n// The ArcMap functions and classes below will use the FinalAction()\n// method of the mapper to determine how to treat final weights, e.g., whether\n// to add a superfinal state. They will use the Properties() method to set the\n// result FST properties.\n//\n// We include a various map versions below. One dimension of variation is\n// whether the mapping mutates its input, writes to a new result FST, or is an\n// on-the-fly FST. Another dimension is how we pass the mapper. We allow passing\n// the mapper by pointer for cases that we need to change the state of the\n// user's mapper.  This is the case with the EncodeMapper, which is reused\n// during decoding. We also include map versions that pass the mapper by value\n// or const reference when this suffices.\n\n// Maps an arc type A using a mapper function object C, passed\n// by pointer.  This version modifies its Fst input.\ntemplate <class A, class C>\nvoid ArcMap(MutableFst<A> *fst, C *mapper) {\n  using FromArc = A;\n  using ToArc = A;\n  using StateId = typename FromArc::StateId;\n  using Weight = typename FromArc::Weight;\n  if (mapper->InputSymbolsAction() == MAP_CLEAR_SYMBOLS) {\n    fst->SetInputSymbols(nullptr);\n  }\n  if (mapper->OutputSymbolsAction() == MAP_CLEAR_SYMBOLS) {\n    fst->SetOutputSymbols(nullptr);\n  }\n  if (fst->Start() == kNoStateId) return;\n  const auto props = fst->Properties(kFstProperties, false);\n  const auto final_action = mapper->FinalAction();\n  auto superfinal = kNoStateId;\n  if (final_action == MAP_REQUIRE_SUPERFINAL) {\n    superfinal = fst->AddState();\n    fst->SetFinal(superfinal, Weight::One());\n  }\n  for (StateIterator<MutableFst<FromArc>> siter(*fst); !siter.Done();\n       siter.Next()) {\n    const auto state = siter.Value();\n    for (MutableArcIterator<MutableFst<FromArc>> aiter(fst, state);\n         !aiter.Done(); aiter.Next()) {\n      const auto &arc = aiter.Value();\n      aiter.SetValue((*mapper)(arc));\n    }\n    switch (final_action) {\n      case MAP_NO_SUPERFINAL:\n      default: {\n        const FromArc arc(0, 0, fst->Final(state), kNoStateId);\n        const auto final_arc = (*mapper)(arc);\n        if (final_arc.ilabel != 0 || final_arc.olabel != 0) {\n          FSTERROR() << \"ArcMap: Non-zero arc labels for superfinal arc\";\n          fst->SetProperties(kError, kError);\n        }\n        fst->SetFinal(state, final_arc.weight);\n        break;\n      }\n      case MAP_ALLOW_SUPERFINAL: {\n        if (state != superfinal) {\n          const FromArc arc(0, 0, fst->Final(state), kNoStateId);\n          auto final_arc = (*mapper)(arc);\n          if (final_arc.ilabel != 0 || final_arc.olabel != 0) {\n            // Add a superfinal state if not already done.\n            if (superfinal == kNoStateId) {\n              superfinal = fst->AddState();\n              fst->SetFinal(superfinal, Weight::One());\n            }\n            final_arc.nextstate = superfinal;\n            fst->AddArc(state, final_arc);\n            fst->SetFinal(state, Weight::Zero());\n          } else {\n            fst->SetFinal(state, final_arc.weight);\n          }\n        }\n        break;\n      }\n      case MAP_REQUIRE_SUPERFINAL: {\n        if (state != superfinal) {\n          const FromArc arc(0, 0, fst->Final(state), kNoStateId);\n          const auto final_arc = (*mapper)(arc);\n          if (final_arc.ilabel != 0 || final_arc.olabel != 0 ||\n              final_arc.weight != Weight::Zero()) {\n            fst->AddArc(state, ToArc(final_arc.ilabel, final_arc.olabel,\n                                     final_arc.weight, superfinal));\n          }\n          fst->SetFinal(state, Weight::Zero());\n        }\n        break;\n      }\n    }\n  }\n  fst->SetProperties(mapper->Properties(props), kFstProperties);\n}\n\n// Maps an arc type A using a mapper function object C, passed by value. This\n// version modifies its FST input.\ntemplate <class A, class C>\nvoid ArcMap(MutableFst<A> *fst, C mapper) {\n  ArcMap(fst, &mapper);\n}\n\n// Maps an arc type A to an arc type B using mapper function object C,\n// passed by pointer. This version writes the mapped input FST to an\n// output MutableFst.\ntemplate <class A, class B, class C>\nvoid ArcMap(const Fst<A> &ifst, MutableFst<B> *ofst, C *mapper) {\n  using FromArc = A;\n  using StateId = typename FromArc::StateId;\n  using Weight = typename FromArc::Weight;\n  ofst->DeleteStates();\n  if (mapper->InputSymbolsAction() == MAP_COPY_SYMBOLS) {\n    ofst->SetInputSymbols(ifst.InputSymbols());\n  } else if (mapper->InputSymbolsAction() == MAP_CLEAR_SYMBOLS) {\n    ofst->SetInputSymbols(nullptr);\n  }\n  if (mapper->OutputSymbolsAction() == MAP_COPY_SYMBOLS) {\n    ofst->SetOutputSymbols(ifst.OutputSymbols());\n  } else if (mapper->OutputSymbolsAction() == MAP_CLEAR_SYMBOLS) {\n    ofst->SetOutputSymbols(nullptr);\n  }\n  const auto iprops = ifst.Properties(kCopyProperties, false);\n  if (ifst.Start() == kNoStateId) {\n    if (iprops & kError) ofst->SetProperties(kError, kError);\n    return;\n  }\n  const auto final_action = mapper->FinalAction();\n  if (ifst.Properties(kExpanded, false)) {\n    ofst->ReserveStates(\n        CountStates(ifst) + final_action == MAP_NO_SUPERFINAL ? 0 : 1);\n  }\n  // Adds all states.\n  for (StateIterator<Fst<A>> siter(ifst); !siter.Done(); siter.Next()) {\n    ofst->AddState();\n  }\n  StateId superfinal = kNoStateId;\n  if (final_action == MAP_REQUIRE_SUPERFINAL) {\n    superfinal = ofst->AddState();\n    ofst->SetFinal(superfinal, B::Weight::One());\n  }\n  for (StateIterator<Fst<A>> siter(ifst); !siter.Done(); siter.Next()) {\n    StateId s = siter.Value();\n    if (s == ifst.Start()) ofst->SetStart(s);\n    ofst->ReserveArcs(s, ifst.NumArcs(s));\n    for (ArcIterator<Fst<A>> aiter(ifst, s); !aiter.Done(); aiter.Next()) {\n      ofst->AddArc(s, (*mapper)(aiter.Value()));\n    }\n    switch (final_action) {\n      case MAP_NO_SUPERFINAL:\n      default: {\n        B final_arc = (*mapper)(A(0, 0, ifst.Final(s), kNoStateId));\n        if (final_arc.ilabel != 0 || final_arc.olabel != 0) {\n          FSTERROR() << \"ArcMap: Non-zero arc labels for superfinal arc\";\n          ofst->SetProperties(kError, kError);\n        }\n        ofst->SetFinal(s, final_arc.weight);\n        break;\n      }\n      case MAP_ALLOW_SUPERFINAL: {\n        B final_arc = (*mapper)(A(0, 0, ifst.Final(s), kNoStateId));\n        if (final_arc.ilabel != 0 || final_arc.olabel != 0) {\n          // Add a superfinal state if not already done.\n          if (superfinal == kNoStateId) {\n            superfinal = ofst->AddState();\n            ofst->SetFinal(superfinal, B::Weight::One());\n          }\n          final_arc.nextstate = superfinal;\n          ofst->AddArc(s, final_arc);\n          ofst->SetFinal(s, B::Weight::Zero());\n        } else {\n          ofst->SetFinal(s, final_arc.weight);\n        }\n        break;\n      }\n      case MAP_REQUIRE_SUPERFINAL: {\n        B final_arc = (*mapper)(A(0, 0, ifst.Final(s), kNoStateId));\n        if (final_arc.ilabel != 0 || final_arc.olabel != 0 ||\n            final_arc.weight != B::Weight::Zero()) {\n          ofst->AddArc(s, B(final_arc.ilabel, final_arc.olabel,\n                            final_arc.weight, superfinal));\n        }\n        ofst->SetFinal(s, B::Weight::Zero());\n        break;\n      }\n    }\n  }\n  const auto oprops = ofst->Properties(kFstProperties, false);\n  ofst->SetProperties(mapper->Properties(iprops) | oprops, kFstProperties);\n}\n\n// Maps an arc type A to an arc type B using mapper function\n// object C, passed by value. This version writes the mapped input\n// Fst to an output MutableFst.\ntemplate <class A, class B, class C>\nvoid ArcMap(const Fst<A> &ifst, MutableFst<B> *ofst, C mapper) {\n  ArcMap(ifst, ofst, &mapper);\n}\n\nstruct ArcMapFstOptions : public CacheOptions {\n  // ArcMapFst default caching behaviour is to do no caching. Most mappers are\n  // cheap and therefore we save memory by not doing caching.\n  ArcMapFstOptions() : CacheOptions(true, 0) {}\n\n  explicit ArcMapFstOptions(const CacheOptions &opts) : CacheOptions(opts) {}\n};\n\ntemplate <class A, class B, class C>\nclass ArcMapFst;\n\nnamespace internal {\n\n// Implementation of delayed ArcMapFst.\ntemplate <class A, class B, class C>\nclass ArcMapFstImpl : public CacheImpl<B> {\n public:\n  using Arc = B;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using FstImpl<B>::SetType;\n  using FstImpl<B>::SetProperties;\n  using FstImpl<B>::SetInputSymbols;\n  using FstImpl<B>::SetOutputSymbols;\n\n  using CacheImpl<B>::PushArc;\n  using CacheImpl<B>::HasArcs;\n  using CacheImpl<B>::HasFinal;\n  using CacheImpl<B>::HasStart;\n  using CacheImpl<B>::SetArcs;\n  using CacheImpl<B>::SetFinal;\n  using CacheImpl<B>::SetStart;\n\n  friend class StateIterator<ArcMapFst<A, B, C>>;\n\n  ArcMapFstImpl(const Fst<A> &fst, const C &mapper,\n                const ArcMapFstOptions &opts)\n      : CacheImpl<B>(opts),\n        fst_(fst.Copy()),\n        mapper_(new C(mapper)),\n        own_mapper_(true),\n        superfinal_(kNoStateId),\n        nstates_(0) {\n    Init();\n  }\n\n  ArcMapFstImpl(const Fst<A> &fst, C *mapper, const ArcMapFstOptions &opts)\n      : CacheImpl<B>(opts),\n        fst_(fst.Copy()),\n        mapper_(mapper),\n        own_mapper_(false),\n        superfinal_(kNoStateId),\n        nstates_(0) {\n    Init();\n  }\n\n  ArcMapFstImpl(const ArcMapFstImpl<A, B, C> &impl)\n      : CacheImpl<B>(impl),\n        fst_(impl.fst_->Copy(true)),\n        mapper_(new C(*impl.mapper_)),\n        own_mapper_(true),\n        superfinal_(kNoStateId),\n        nstates_(0) {\n    Init();\n  }\n\n  ~ArcMapFstImpl() override {\n    if (own_mapper_) delete mapper_;\n  }\n\n  StateId Start() {\n    if (!HasStart()) SetStart(FindOState(fst_->Start()));\n    return CacheImpl<B>::Start();\n  }\n\n  Weight Final(StateId s) {\n    if (!HasFinal(s)) {\n      switch (final_action_) {\n        case MAP_NO_SUPERFINAL:\n        default: {\n          const auto final_arc =\n              (*mapper_)(A(0, 0, fst_->Final(FindIState(s)), kNoStateId));\n          if (final_arc.ilabel != 0 || final_arc.olabel != 0) {\n            FSTERROR() << \"ArcMapFst: Non-zero arc labels for superfinal arc\";\n            SetProperties(kError, kError);\n          }\n          SetFinal(s, final_arc.weight);\n          break;\n        }\n        case MAP_ALLOW_SUPERFINAL: {\n          if (s == superfinal_) {\n            SetFinal(s, Weight::One());\n          } else {\n            const auto final_arc =\n                (*mapper_)(A(0, 0, fst_->Final(FindIState(s)), kNoStateId));\n            if (final_arc.ilabel == 0 && final_arc.olabel == 0) {\n              SetFinal(s, final_arc.weight);\n            } else {\n              SetFinal(s, Weight::Zero());\n            }\n          }\n          break;\n        }\n        case MAP_REQUIRE_SUPERFINAL: {\n          SetFinal(s, s == superfinal_ ? Weight::One() : Weight::Zero());\n          break;\n        }\n      }\n    }\n    return CacheImpl<B>::Final(s);\n  }\n\n  size_t NumArcs(StateId s) {\n    if (!HasArcs(s)) Expand(s);\n    return CacheImpl<B>::NumArcs(s);\n  }\n\n  size_t NumInputEpsilons(StateId s) {\n    if (!HasArcs(s)) Expand(s);\n    return CacheImpl<B>::NumInputEpsilons(s);\n  }\n\n  size_t NumOutputEpsilons(StateId s) {\n    if (!HasArcs(s)) Expand(s);\n    return CacheImpl<B>::NumOutputEpsilons(s);\n  }\n\n  uint64 Properties() const override { return Properties(kFstProperties); }\n\n  // Sets error if found, and returns other FST impl properties.\n  uint64 Properties(uint64 mask) const override {\n    if ((mask & kError) && (fst_->Properties(kError, false) ||\n                            (mapper_->Properties(0) & kError))) {\n      SetProperties(kError, kError);\n    }\n    return FstImpl<Arc>::Properties(mask);\n  }\n\n  void InitArcIterator(StateId s, ArcIteratorData<B> *data) {\n    if (!HasArcs(s)) Expand(s);\n    CacheImpl<B>::InitArcIterator(s, data);\n  }\n\n  void Expand(StateId s) {\n    // Add exiting arcs.\n    if (s == superfinal_) {\n      SetArcs(s);\n      return;\n    }\n    for (ArcIterator<Fst<A>> aiter(*fst_, FindIState(s)); !aiter.Done();\n         aiter.Next()) {\n      auto aarc = aiter.Value();\n      aarc.nextstate = FindOState(aarc.nextstate);\n      const auto &barc = (*mapper_)(aarc);\n      PushArc(s, barc);\n    }\n\n    // Check for superfinal arcs.\n    if (!HasFinal(s) || Final(s) == Weight::Zero()) {\n      switch (final_action_) {\n        case MAP_NO_SUPERFINAL:\n        default:\n          break;\n        case MAP_ALLOW_SUPERFINAL: {\n          auto final_arc =\n              (*mapper_)(A(0, 0, fst_->Final(FindIState(s)), kNoStateId));\n          if (final_arc.ilabel != 0 || final_arc.olabel != 0) {\n            if (superfinal_ == kNoStateId) superfinal_ = nstates_++;\n            final_arc.nextstate = superfinal_;\n            PushArc(s, final_arc);\n          }\n          break;\n        }\n        case MAP_REQUIRE_SUPERFINAL: {\n          const auto final_arc =\n              (*mapper_)(A(0, 0, fst_->Final(FindIState(s)), kNoStateId));\n          if (final_arc.ilabel != 0 || final_arc.olabel != 0 ||\n              final_arc.weight != B::Weight::Zero()) {\n            PushArc(s, B(final_arc.ilabel, final_arc.olabel, final_arc.weight,\n                         superfinal_));\n          }\n          break;\n        }\n      }\n    }\n    SetArcs(s);\n  }\n\n private:\n  void Init() {\n    SetType(\"map\");\n    if (mapper_->InputSymbolsAction() == MAP_COPY_SYMBOLS) {\n      SetInputSymbols(fst_->InputSymbols());\n    } else if (mapper_->InputSymbolsAction() == MAP_CLEAR_SYMBOLS) {\n      SetInputSymbols(nullptr);\n    }\n    if (mapper_->OutputSymbolsAction() == MAP_COPY_SYMBOLS) {\n      SetOutputSymbols(fst_->OutputSymbols());\n    } else if (mapper_->OutputSymbolsAction() == MAP_CLEAR_SYMBOLS) {\n      SetOutputSymbols(nullptr);\n    }\n    if (fst_->Start() == kNoStateId) {\n      final_action_ = MAP_NO_SUPERFINAL;\n      SetProperties(kNullProperties);\n    } else {\n      final_action_ = mapper_->FinalAction();\n      uint64 props = fst_->Properties(kCopyProperties, false);\n      SetProperties(mapper_->Properties(props));\n      if (final_action_ == MAP_REQUIRE_SUPERFINAL) superfinal_ = 0;\n    }\n  }\n\n  // Maps from output state to input state.\n  StateId FindIState(StateId s) {\n    if (superfinal_ == kNoStateId || s < superfinal_) {\n      return s;\n    } else {\n      return s - 1;\n    }\n  }\n\n  // Maps from input state to output state.\n  StateId FindOState(StateId is) {\n    auto os = is;\n    if (!(superfinal_ == kNoStateId || is < superfinal_)) ++os;\n    if (os >= nstates_) nstates_ = os + 1;\n    return os;\n  }\n\n  std::unique_ptr<const Fst<A>> fst_;\n  C *mapper_;\n  const bool own_mapper_;\n  MapFinalAction final_action_;\n  StateId superfinal_;\n  StateId nstates_;\n};\n\n}  // namespace internal\n\n// Maps an arc type A to an arc type B using Mapper function object\n// C. This version is a delayed FST.\ntemplate <class A, class B, class C>\nclass ArcMapFst : public ImplToFst<internal::ArcMapFstImpl<A, B, C>> {\n public:\n  using Arc = B;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using Store = DefaultCacheStore<B>;\n  using State = typename Store::State;\n  using Impl = internal::ArcMapFstImpl<A, B, C>;\n\n  friend class ArcIterator<ArcMapFst<A, B, C>>;\n  friend class StateIterator<ArcMapFst<A, B, C>>;\n\n  ArcMapFst(const Fst<A> &fst, const C &mapper, const ArcMapFstOptions &opts)\n      : ImplToFst<Impl>(std::make_shared<Impl>(fst, mapper, opts)) {}\n\n  ArcMapFst(const Fst<A> &fst, C *mapper, const ArcMapFstOptions &opts)\n      : ImplToFst<Impl>(std::make_shared<Impl>(fst, mapper, opts)) {}\n\n  ArcMapFst(const Fst<A> &fst, const C &mapper)\n      : ImplToFst<Impl>(\n            std::make_shared<Impl>(fst, mapper, ArcMapFstOptions())) {}\n\n  ArcMapFst(const Fst<A> &fst, C *mapper)\n      : ImplToFst<Impl>(\n            std::make_shared<Impl>(fst, mapper, ArcMapFstOptions())) {}\n\n  // See Fst<>::Copy() for doc.\n  ArcMapFst(const ArcMapFst<A, B, C> &fst, bool safe = false)\n      : ImplToFst<Impl>(fst, safe) {}\n\n  // Get a copy of this ArcMapFst. See Fst<>::Copy() for further doc.\n  ArcMapFst<A, B, C> *Copy(bool safe = false) const override {\n    return new ArcMapFst<A, B, C>(*this, safe);\n  }\n\n  inline void InitStateIterator(StateIteratorData<B> *data) const override;\n\n  void InitArcIterator(StateId s, ArcIteratorData<B> *data) const override {\n    GetMutableImpl()->InitArcIterator(s, data);\n  }\n\n protected:\n  using ImplToFst<Impl>::GetImpl;\n  using ImplToFst<Impl>::GetMutableImpl;\n\n private:\n  ArcMapFst &operator=(const ArcMapFst &) = delete;\n};\n\n// Specialization for ArcMapFst.\n//\n// This may be derived from.\ntemplate <class A, class B, class C>\nclass StateIterator<ArcMapFst<A, B, C>> : public StateIteratorBase<B> {\n public:\n  using StateId = typename B::StateId;\n\n  explicit StateIterator(const ArcMapFst<A, B, C> &fst)\n      : impl_(fst.GetImpl()),\n        siter_(*impl_->fst_),\n        s_(0),\n        superfinal_(impl_->final_action_ == MAP_REQUIRE_SUPERFINAL) {\n    CheckSuperfinal();\n  }\n\n  bool Done() const final { return siter_.Done() && !superfinal_; }\n\n  StateId Value() const final { return s_; }\n\n  void Next() final {\n    ++s_;\n    if (!siter_.Done()) {\n      siter_.Next();\n      CheckSuperfinal();\n    } else if (superfinal_) {\n      superfinal_ = false;\n    }\n  }\n\n  void Reset() final {\n    s_ = 0;\n    siter_.Reset();\n    superfinal_ = impl_->final_action_ == MAP_REQUIRE_SUPERFINAL;\n    CheckSuperfinal();\n  }\n\n private:\n  void CheckSuperfinal() {\n    if (impl_->final_action_ != MAP_ALLOW_SUPERFINAL || superfinal_) return;\n    if (!siter_.Done()) {\n      const auto final_arc =\n          (*impl_->mapper_)(A(0, 0, impl_->fst_->Final(s_), kNoStateId));\n      if (final_arc.ilabel != 0 || final_arc.olabel != 0) superfinal_ = true;\n    }\n  }\n\n  const internal::ArcMapFstImpl<A, B, C> *impl_;\n  StateIterator<Fst<A>> siter_;\n  StateId s_;\n  bool superfinal_;  // True if there is a superfinal state and not done.\n};\n\n// Specialization for ArcMapFst.\ntemplate <class A, class B, class C>\nclass ArcIterator<ArcMapFst<A, B, C>>\n    : public CacheArcIterator<ArcMapFst<A, B, C>> {\n public:\n  using StateId = typename A::StateId;\n\n  ArcIterator(const ArcMapFst<A, B, C> &fst, StateId s)\n      : CacheArcIterator<ArcMapFst<A, B, C>>(fst.GetMutableImpl(), s) {\n    if (!fst.GetImpl()->HasArcs(s)) fst.GetMutableImpl()->Expand(s);\n  }\n};\n\ntemplate <class A, class B, class C>\ninline void ArcMapFst<A, B, C>::InitStateIterator(\n    StateIteratorData<B> *data) const {\n  data->base = new StateIterator<ArcMapFst<A, B, C>>(*this);\n}\n\n// Utility Mappers.\n\n// Mapper that returns its input.\ntemplate <class A>\nclass IdentityArcMapper {\n public:\n  using FromArc = A;\n  using ToArc = A;\n\n  ToArc operator()(const FromArc &arc) const { return arc; }\n\n  constexpr MapFinalAction FinalAction() const { return MAP_NO_SUPERFINAL; }\n\n  constexpr MapSymbolsAction InputSymbolsAction() const {\n    return MAP_COPY_SYMBOLS;\n  }\n\n  constexpr MapSymbolsAction OutputSymbolsAction() const {\n    return MAP_COPY_SYMBOLS;\n  }\n\n  uint64 Properties(uint64 props) const { return props; }\n};\n\n// Mapper that converts all input symbols to epsilon.\ntemplate <class A>\nclass InputEpsilonMapper {\n public:\n  using FromArc = A;\n  using ToArc = A;\n\n  ToArc operator()(const FromArc &arc) const {\n    return ToArc(0, arc.olabel, arc.weight, arc.nextstate);\n  }\n\n  constexpr MapFinalAction FinalAction() const { return MAP_NO_SUPERFINAL; }\n\n  constexpr MapSymbolsAction InputSymbolsAction() const {\n    return MAP_CLEAR_SYMBOLS;\n  }\n\n  constexpr MapSymbolsAction OutputSymbolsAction() const {\n    return MAP_COPY_SYMBOLS;\n  }\n\n  uint64 Properties(uint64 props) const {\n    return (props & kSetArcProperties) | kIEpsilons;\n  }\n};\n\n// Mapper that converts all output symbols to epsilon.\ntemplate <class A>\nclass OutputEpsilonMapper {\n public:\n  using FromArc = A;\n  using ToArc = A;\n\n  ToArc operator()(const FromArc &arc) const {\n    return ToArc(arc.ilabel, 0, arc.weight, arc.nextstate);\n  }\n\n  constexpr MapFinalAction FinalAction() const { return MAP_NO_SUPERFINAL; }\n\n  constexpr MapSymbolsAction InputSymbolsAction() const {\n    return MAP_COPY_SYMBOLS;\n  }\n\n  constexpr MapSymbolsAction OutputSymbolsAction() const {\n    return MAP_CLEAR_SYMBOLS;\n  }\n\n  uint64 Properties(uint64 props) const {\n    return (props & kSetArcProperties) | kOEpsilons;\n  }\n};\n\n// Mapper that returns its input with final states redirected to a single\n// super-final state.\ntemplate <class A>\nclass SuperFinalMapper {\n public:\n  using FromArc = A;\n  using ToArc = A;\n  using Label = typename FromArc::Label;\n  using Weight = typename FromArc::Weight;;\n\n  // Arg allows setting super-final label.\n  explicit SuperFinalMapper(Label final_label = 0)\n      : final_label_(final_label) {}\n\n  ToArc operator()(const FromArc &arc) const {\n    // Super-final arc.\n    if (arc.nextstate == kNoStateId && arc.weight != Weight::Zero()) {\n      return ToArc(final_label_, final_label_, arc.weight, kNoStateId);\n    } else {\n      return arc;\n    }\n  }\n\n  constexpr MapFinalAction FinalAction() const {\n    return MAP_REQUIRE_SUPERFINAL;\n  }\n\n  constexpr MapSymbolsAction InputSymbolsAction() const {\n    return MAP_COPY_SYMBOLS;\n  }\n\n  constexpr MapSymbolsAction OutputSymbolsAction() const {\n    return MAP_COPY_SYMBOLS;\n  }\n\n  uint64 Properties(uint64 props) const {\n    if (final_label_ == 0) {\n      return props & kAddSuperFinalProperties;\n    } else {\n      return props & kAddSuperFinalProperties &\n          kILabelInvariantProperties & kOLabelInvariantProperties;\n    }\n  }\n\n private:\n  Label final_label_;\n};\n\n// Mapper that leaves labels and nextstate unchanged and constructs a new weight\n// from the underlying value of the arc weight. If no weight converter is\n// explictly specified, requires that there is a WeightConvert class\n// specialization that converts the weights.\ntemplate <class A, class B,\n          class C = WeightConvert<typename A::Weight, typename B::Weight>>\nclass WeightConvertMapper {\n public:\n  using FromArc = A;\n  using ToArc = B;\n  using Converter = C;\n  using FromWeight = typename FromArc::Weight;\n  using ToWeight = typename ToArc::Weight;\n\n  explicit WeightConvertMapper(const Converter &c = Converter())\n      : convert_weight_(c) {}\n\n  ToArc operator()(const FromArc &arc) const {\n    return ToArc(arc.ilabel, arc.olabel, convert_weight_(arc.weight),\n                 arc.nextstate);\n  }\n\n  constexpr MapFinalAction FinalAction() const { return MAP_NO_SUPERFINAL; }\n\n  constexpr MapSymbolsAction InputSymbolsAction() const {\n    return MAP_COPY_SYMBOLS;\n  }\n\n  constexpr MapSymbolsAction OutputSymbolsAction() const {\n    return MAP_COPY_SYMBOLS;\n  }\n\n  uint64 Properties(uint64 props) const { return props; }\n\n private:\n  Converter convert_weight_;\n};\n\n// Non-precision-changing weight conversions; consider using more efficient\n// Cast method instead.\n\nusing StdToLogMapper = WeightConvertMapper<StdArc, LogArc>;\n\nusing LogToStdMapper = WeightConvertMapper<LogArc, StdArc>;\n\n// Precision-changing weight conversions.\n\nusing StdToLog64Mapper = WeightConvertMapper<StdArc, Log64Arc>;\n\nusing LogToLog64Mapper = WeightConvertMapper<LogArc, Log64Arc>;\n\nusing Log64ToStdMapper = WeightConvertMapper<Log64Arc, StdArc>;\n\nusing Log64ToLogMapper = WeightConvertMapper<Log64Arc, LogArc>;\n\n// Mapper from A to GallicArc<A>.\ntemplate <class A, GallicType G = GALLIC_LEFT>\nclass ToGallicMapper {\n public:\n  using FromArc = A;\n  using ToArc = GallicArc<A, G>;\n\n  using SW = StringWeight<typename A::Label, GallicStringType(G)>;\n  using AW = typename FromArc::Weight;\n  using GW = typename ToArc::Weight;\n\n  ToArc operator()(const FromArc &arc) const {\n    // Super-final arc.\n    if (arc.nextstate == kNoStateId && arc.weight != AW::Zero()) {\n      return ToArc(0, 0, GW(SW::One(), arc.weight), kNoStateId);\n    // Super-non-final arc.\n    } else if (arc.nextstate == kNoStateId) {\n      return ToArc(0, 0, GW::Zero(), kNoStateId);\n    // Epsilon label.\n    } else if (arc.olabel == 0) {\n      return ToArc(arc.ilabel, arc.ilabel, GW(SW::One(), arc.weight),\n                   arc.nextstate);\n    // Regular label.\n    } else {\n      return ToArc(arc.ilabel, arc.ilabel, GW(SW(arc.olabel), arc.weight),\n                   arc.nextstate);\n    }\n  }\n\n  constexpr MapFinalAction FinalAction() const { return MAP_NO_SUPERFINAL; }\n\n  constexpr MapSymbolsAction InputSymbolsAction() const {\n    return MAP_COPY_SYMBOLS;\n  }\n\n  constexpr MapSymbolsAction OutputSymbolsAction() const {\n    return MAP_CLEAR_SYMBOLS;\n  }\n\n  uint64 Properties(uint64 props) const {\n    return ProjectProperties(props, true) & kWeightInvariantProperties;\n  }\n};\n\n// Mapper from GallicArc<A> to A.\ntemplate <class A, GallicType G = GALLIC_LEFT>\nclass FromGallicMapper {\n public:\n  using FromArc = GallicArc<A, G>;\n  using ToArc = A;\n\n  using Label = typename ToArc::Label;\n  using AW = typename ToArc::Weight;\n  using GW = typename FromArc::Weight;\n\n  explicit FromGallicMapper(Label superfinal_label = 0)\n      : superfinal_label_(superfinal_label), error_(false) {}\n\n  ToArc operator()(const FromArc &arc) const {\n    // 'Super-non-final' arc.\n    if (arc.nextstate == kNoStateId && arc.weight == GW::Zero()) {\n      return A(arc.ilabel, 0, AW::Zero(), kNoStateId);\n    }\n    Label l = kNoLabel;\n    AW weight;\n    if (!Extract(arc.weight, &weight, &l) || arc.ilabel != arc.olabel) {\n      FSTERROR() << \"FromGallicMapper: Unrepresentable weight: \" << arc.weight\n                 << \" for arc with ilabel = \" << arc.ilabel\n                 << \", olabel = \" << arc.olabel\n                 << \", nextstate = \" << arc.nextstate;\n      error_ = true;\n    }\n    if (arc.ilabel == 0 && l != 0 && arc.nextstate == kNoStateId) {\n      return ToArc(superfinal_label_, l, weight, arc.nextstate);\n    } else {\n      return ToArc(arc.ilabel, l, weight, arc.nextstate);\n    }\n  }\n\n  constexpr MapFinalAction FinalAction() const { return MAP_ALLOW_SUPERFINAL; }\n\n  constexpr MapSymbolsAction InputSymbolsAction() const {\n    return MAP_COPY_SYMBOLS;\n  }\n\n  constexpr MapSymbolsAction OutputSymbolsAction() const {\n    return MAP_CLEAR_SYMBOLS;\n  }\n\n  uint64 Properties(uint64 inprops) const {\n    uint64 outprops = inprops & kOLabelInvariantProperties &\n                      kWeightInvariantProperties & kAddSuperFinalProperties;\n    if (error_) outprops |= kError;\n    return outprops;\n  }\n\n private:\n  template <GallicType GT>\n  static bool Extract(const GallicWeight<Label, AW, GT> &gallic_weight,\n                      typename A::Weight *weight, typename A::Label *label) {\n    using GW = StringWeight<Label, GallicStringType(GT)>;\n    const GW &w1 = gallic_weight.Value1();\n    const AW &w2 = gallic_weight.Value2();\n    typename GW::Iterator iter1(w1);\n    const Label l = w1.Size() == 1 ? iter1.Value() : 0;\n    if (l == kStringInfinity || l == kStringBad || w1.Size() > 1) return false;\n    *label = l;\n    *weight = w2;\n    return true;\n  }\n\n  static bool Extract(const GallicWeight<Label, AW, GALLIC> &gallic_weight,\n                      typename A::Weight *weight, typename A::Label *label) {\n    if (gallic_weight.Size() > 1) return false;\n    if (gallic_weight.Size() == 0) {\n      *label = 0;\n      *weight = A::Weight::Zero();\n      return true;\n    }\n    return Extract<GALLIC_RESTRICT>(gallic_weight.Back(), weight, label);\n  }\n\n  const Label superfinal_label_;\n  mutable bool error_;\n};\n\n// Mapper from GallicArc<A> to A.\ntemplate <class A, GallicType G = GALLIC_LEFT>\nclass GallicToNewSymbolsMapper {\n public:\n  using FromArc = GallicArc<A, G>;\n  using ToArc = A;\n\n  using Label = typename ToArc::Label;\n  using StateId = typename ToArc::StateId;\n  using AW = typename ToArc::Weight;\n  using GW = typename FromArc::Weight;\n  using SW = StringWeight<Label, GallicStringType(G)>;\n\n  explicit GallicToNewSymbolsMapper(MutableFst<ToArc> *fst)\n      : fst_(fst),\n        lmax_(0),\n        osymbols_(fst->OutputSymbols()),\n        isymbols_(nullptr),\n        error_(false) {\n    fst_->DeleteStates();\n    state_ = fst_->AddState();\n    fst_->SetStart(state_);\n    fst_->SetFinal(state_, AW::One());\n    if (osymbols_) {\n      string name = osymbols_->Name() + \"_from_gallic\";\n      fst_->SetInputSymbols(new SymbolTable(name));\n      isymbols_ = fst_->MutableInputSymbols();\n      const int64 zero = 0;\n      isymbols_->AddSymbol(osymbols_->Find(zero), 0);\n    } else {\n      fst_->SetInputSymbols(nullptr);\n    }\n  }\n\n  ToArc operator()(const FromArc &arc) {\n    // Super-non-final arc.\n    if (arc.nextstate == kNoStateId && arc.weight == GW::Zero()) {\n      return ToArc(arc.ilabel, 0, AW::Zero(), kNoStateId);\n    }\n    SW w1 = arc.weight.Value1();\n    AW w2 = arc.weight.Value2();\n    Label l;\n    if (w1.Size() == 0) {\n      l = 0;\n    } else {\n      auto insert_result = map_.insert(std::make_pair(w1, kNoLabel));\n      if (!insert_result.second) {\n        l = insert_result.first->second;\n      } else {\n        l = ++lmax_;\n        insert_result.first->second = l;\n        StringWeightIterator<SW> iter1(w1);\n        StateId n;\n        string s;\n        for (size_t i = 0, p = state_; i < w1.Size();\n             ++i, iter1.Next(), p = n) {\n          n = i == w1.Size() - 1 ? state_ : fst_->AddState();\n          fst_->AddArc(p, ToArc(i ? 0 : l, iter1.Value(), AW::One(), n));\n          if (isymbols_) {\n            if (i) s = s + \"_\";\n            s = s + osymbols_->Find(iter1.Value());\n          }\n        }\n        if (isymbols_) isymbols_->AddSymbol(s, l);\n      }\n    }\n    if (l == kStringInfinity || l == kStringBad || arc.ilabel != arc.olabel) {\n      FSTERROR() << \"GallicToNewSymbolMapper: Unrepresentable weight: \" << l;\n      error_ = true;\n    }\n    return ToArc(arc.ilabel, l, w2, arc.nextstate);\n  }\n\n  constexpr MapFinalAction FinalAction() const { return MAP_ALLOW_SUPERFINAL; }\n\n  constexpr MapSymbolsAction InputSymbolsAction() const {\n    return MAP_COPY_SYMBOLS;\n  }\n\n  constexpr MapSymbolsAction OutputSymbolsAction() const {\n    return MAP_CLEAR_SYMBOLS;\n  }\n\n  uint64 Properties(uint64 inprops) const {\n    uint64 outprops = inprops & kOLabelInvariantProperties &\n                      kWeightInvariantProperties & kAddSuperFinalProperties;\n    if (error_) outprops |= kError;\n    return outprops;\n  }\n\n private:\n  class StringKey {\n   public:\n    size_t operator()(const SW &x) const { return x.Hash(); }\n  };\n\n  using Map = std::unordered_map<SW, Label, StringKey>;\n\n  MutableFst<ToArc> *fst_;\n  Map map_;\n  Label lmax_;\n  StateId state_;\n  const SymbolTable *osymbols_;\n  SymbolTable *isymbols_;\n  mutable bool error_;\n};\n\n// TODO(kbg): Add common base class for those mappers which do nothing except\n// mutate their weights.\n\n// Mapper to add a constant to all weights.\ntemplate <class A>\nclass PlusMapper {\n public:\n  using FromArc = A;\n  using ToArc = A;\n  using Weight = typename FromArc::Weight;\n\n  explicit PlusMapper(Weight weight) : weight_(std::move(weight)) {}\n\n  ToArc operator()(const FromArc &arc) const {\n    if (arc.weight == Weight::Zero()) return arc;\n    return ToArc(arc.ilabel, arc.olabel, Plus(arc.weight, weight_),\n                 arc.nextstate);\n  }\n\n  constexpr MapFinalAction FinalAction() const { return MAP_NO_SUPERFINAL; }\n\n  constexpr MapSymbolsAction InputSymbolsAction() const {\n    return MAP_COPY_SYMBOLS;\n  }\n\n  constexpr MapSymbolsAction OutputSymbolsAction() const {\n    return MAP_COPY_SYMBOLS;\n  }\n\n  uint64 Properties(uint64 props) const {\n    return props & kWeightInvariantProperties;\n  }\n\n private:\n  const Weight weight_;\n};\n\n// Mapper to (right) multiply a constant to all weights.\ntemplate <class A>\nclass TimesMapper {\n public:\n  using FromArc = A;\n  using ToArc = A;\n  using Weight = typename FromArc::Weight;\n\n  explicit TimesMapper(Weight weight) : weight_(std::move(weight)) {}\n\n  ToArc operator()(const FromArc &arc) const {\n    if (arc.weight == Weight::Zero()) return arc;\n    return ToArc(arc.ilabel, arc.olabel, Times(arc.weight, weight_),\n                 arc.nextstate);\n  }\n\n  constexpr MapFinalAction FinalAction() const { return MAP_NO_SUPERFINAL; }\n\n  constexpr MapSymbolsAction InputSymbolsAction() const {\n    return MAP_COPY_SYMBOLS;\n  }\n\n  constexpr MapSymbolsAction OutputSymbolsAction() const {\n    return MAP_COPY_SYMBOLS;\n  }\n\n  uint64 Properties(uint64 props) const {\n    return props & kWeightInvariantProperties;\n  }\n\n private:\n  const Weight weight_;\n};\n\n// Mapper to take all weights to a constant power. The power argument is stored\n// as a double, so if there is a floating-point power implementation for this\n// weight type, it will take precedence. Otherwise, the power argument's 53 bits\n// of integer precision will be implicitly converted to a size_t and the default\n// power implementation (iterated multiplication) will be used instead.\ntemplate <class A>\nclass PowerMapper {\n public:\n  using FromArc = A;\n  using ToArc = A;\n  using Weight = typename FromArc::Weight;\n\n  explicit PowerMapper(double power) : power_(power) {}\n\n  ToArc operator()(const FromArc &arc) const {\n    return ToArc(arc.ilabel, arc.olabel, Power(arc.weight, power_),\n                 arc.nextstate);\n  }\n\n  constexpr MapFinalAction FinalAction() const { return MAP_NO_SUPERFINAL; }\n\n  constexpr MapSymbolsAction InputSymbolsAction() const {\n    return MAP_COPY_SYMBOLS;\n  }\n\n  constexpr MapSymbolsAction OutputSymbolsAction() const {\n    return MAP_COPY_SYMBOLS;\n  }\n\n  uint64 Properties(uint64 props) const {\n    return props & kWeightInvariantProperties;\n  }\n\n private:\n  const double power_;\n};\n\n// Mapper to reciprocate all non-Zero() weights.\ntemplate <class A>\nclass InvertWeightMapper {\n public:\n  using FromArc = A;\n  using ToArc = A;\n  using Weight = typename FromArc::Weight;\n\n  ToArc operator()(const FromArc &arc) const {\n    if (arc.weight == Weight::Zero()) return arc;\n    return ToArc(arc.ilabel, arc.olabel, Divide(Weight::One(), arc.weight),\n                 arc.nextstate);\n  }\n\n  constexpr MapFinalAction FinalAction() const { return MAP_NO_SUPERFINAL; }\n\n  constexpr MapSymbolsAction InputSymbolsAction() const {\n    return MAP_COPY_SYMBOLS;\n  }\n\n  constexpr MapSymbolsAction OutputSymbolsAction() const {\n    return MAP_COPY_SYMBOLS;\n  }\n\n  uint64 Properties(uint64 props) const {\n    return props & kWeightInvariantProperties;\n  }\n};\n\n// Mapper to map all non-Zero() weights to One().\ntemplate <class A, class B = A>\nclass RmWeightMapper {\n public:\n  using FromArc = A;\n  using ToArc = B;\n  using FromWeight = typename FromArc::Weight;\n  using ToWeight = typename ToArc::Weight;\n\n  ToArc operator()(const FromArc &arc) const {\n    return ToArc(arc.ilabel, arc.olabel,\n                 arc.weight != FromWeight::Zero() ?\n                 ToWeight::One() : ToWeight::Zero(),\n                 arc.nextstate);\n  }\n\n  constexpr MapFinalAction FinalAction() const { return MAP_NO_SUPERFINAL; }\n\n  constexpr MapSymbolsAction InputSymbolsAction() const {\n    return MAP_COPY_SYMBOLS;\n  }\n\n  constexpr MapSymbolsAction OutputSymbolsAction() const {\n    return MAP_COPY_SYMBOLS;\n  }\n\n  uint64 Properties(uint64 props) const {\n    return (props & kWeightInvariantProperties) | kUnweighted;\n  }\n};\n\n// Mapper to quantize all weights.\ntemplate <class A, class B = A>\nclass QuantizeMapper {\n public:\n  using FromArc = A;\n  using ToArc = B;\n  using FromWeight = typename FromArc::Weight;\n  using ToWeight = typename ToArc::Weight;\n\n  QuantizeMapper() : delta_(kDelta) {}\n\n  explicit QuantizeMapper(float d) : delta_(d) {}\n\n  ToArc operator()(const FromArc &arc) const {\n    return ToArc(arc.ilabel, arc.olabel, arc.weight.Quantize(delta_),\n                 arc.nextstate);\n  }\n\n  constexpr MapFinalAction FinalAction() const { return MAP_NO_SUPERFINAL; }\n\n  constexpr MapSymbolsAction InputSymbolsAction() const {\n    return MAP_COPY_SYMBOLS;\n  }\n\n  constexpr MapSymbolsAction OutputSymbolsAction() const {\n    return MAP_COPY_SYMBOLS;\n  }\n\n  uint64 Properties(uint64 props) const {\n    return props & kWeightInvariantProperties;\n  }\n\n private:\n  const float delta_;\n};\n\n// Mapper from A to B under the assumption:\n//\n//    B::Weight = A::Weight::ReverseWeight\n//    B::Label == A::Label\n//    B::StateId == A::StateId\n//\n// The weight is reversed, while the label and nextstate are preserved.\ntemplate <class A, class B>\nclass ReverseWeightMapper {\n public:\n  using FromArc = A;\n  using ToArc = B;\n\n  ToArc operator()(const FromArc &arc) const {\n    return ToArc(arc.ilabel, arc.olabel, arc.weight.Reverse(), arc.nextstate);\n  }\n\n  constexpr MapFinalAction FinalAction() const { return MAP_NO_SUPERFINAL; }\n\n  constexpr MapSymbolsAction InputSymbolsAction() const {\n    return MAP_COPY_SYMBOLS;\n  }\n\n  constexpr MapSymbolsAction OutputSymbolsAction() const {\n    return MAP_COPY_SYMBOLS;\n  }\n\n  uint64 Properties(uint64 props) const { return props; }\n};\n\n}  // namespace fst\n\n#endif  // FST_ARC_MAP_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/arc.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Commonly used FST arc types.\n\n#ifndef FST_ARC_H_\n#define FST_ARC_H_\n\n#include <climits>\n#include <string>\n#include <utility>\n\n\n#include <fst/expectation-weight.h>\n#include <fst/float-weight.h>\n#include <fst/lexicographic-weight.h>\n#include <fst/power-weight.h>\n#include <fst/product-weight.h>\n#include <fst/signed-log-weight.h>\n#include <fst/sparse-power-weight.h>\n#include <fst/string-weight.h>\n\n\nnamespace fst {\n\ntemplate <class W>\nstruct ArcTpl {\n public:\n  using Weight = W;\n  using Label = int;\n  using StateId = int;\n\n  Label ilabel;\n  Label olabel;\n  Weight weight;\n  StateId nextstate;\n\n  ArcTpl() {}\n\n  ArcTpl(Label ilabel, Label olabel, Weight weight, StateId nextstate)\n      : ilabel(ilabel),\n        olabel(olabel),\n        weight(std::move(weight)),\n        nextstate(nextstate) {}\n\n  static const string &Type() {\n    static const string *const type =\n        new string(Weight::Type() == \"tropical\" ? \"standard\" : Weight::Type());\n    return *type;\n  }\n};\n\nusing StdArc = ArcTpl<TropicalWeight>;\nusing LogArc = ArcTpl<LogWeight>;\nusing Log64Arc = ArcTpl<Log64Weight>;\nusing SignedLogArc = ArcTpl<SignedLogWeight>;\nusing SignedLog64Arc = ArcTpl<SignedLog64Weight>;\nusing MinMaxArc = ArcTpl<MinMaxWeight>;\n\n// Arc with integer labels and state IDs and string weights.\ntemplate <StringType S = STRING_LEFT>\nstruct StringArc {\n public:\n  using Label = int;\n  using Weight = StringWeight<int, S>;\n  using StateId = int;\n\n  Label ilabel;\n  Label olabel;\n  Weight weight;\n  StateId nextstate;\n\n  StringArc() = default;\n\n  StringArc(Label ilabel, Label olabel, Weight weight, StateId nextstate)\n      : ilabel(ilabel),\n        olabel(olabel),\n        weight(std::move(weight)),\n        nextstate(nextstate) {}\n\n  static const string &Type() {\n    static const string *const type =\n        new string(S == STRING_LEFT\n                       ? \"left_standard_string\"\n                       : (S == STRING_RIGHT ? \"right_standard_string\"\n                                            : \"restricted_standard_string\"));\n    return *type;\n  }\n};\n\n// Arc with label and state Id type the same as template arg and with\n// weights over the Gallic semiring w.r.t the output labels and weights of A.\ntemplate <class A, GallicType G = GALLIC_LEFT>\nstruct GallicArc {\n  using Arc = A;\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = GallicWeight<Label, typename Arc::Weight, G>;\n\n  Label ilabel;\n  Label olabel;\n  Weight weight;\n  StateId nextstate;\n\n  GallicArc() = default;\n\n  GallicArc(Label ilabel, Label olabel, Weight weight, StateId nextstate)\n      : ilabel(ilabel),\n        olabel(olabel),\n        weight(std::move(weight)),\n        nextstate(nextstate) {}\n\n  explicit GallicArc(const Arc &arc)\n      : ilabel(arc.ilabel), olabel(arc.ilabel), weight(arc.olabel, arc.weight),\n        nextstate(arc.nextstate) {}\n\n  static const string &Type() {\n    static const string *const type =\n        new string(\n            (G == GALLIC_LEFT\n                 ? \"left_gallic_\"\n                 : (G == GALLIC_RIGHT\n                        ? \"right_gallic_\"\n                        : (G == GALLIC_RESTRICT\n                               ? \"restricted_gallic_\"\n                               : (G == GALLIC_MIN\n                                      ? \"min_gallic_\" : \"gallic_\")))) +\n            Arc::Type());\n    return *type;\n  }\n};\n\n// Arc with the reverse of the weight found in its template arg.\ntemplate <class A>\nstruct ReverseArc {\n  using Arc = A;\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using AWeight = typename Arc::Weight;\n  using Weight = typename AWeight::ReverseWeight;\n\n  Label ilabel;\n  Label olabel;\n  Weight weight;\n  StateId nextstate;\n\n  ReverseArc() = default;\n\n  ReverseArc(Label ilabel, Label olabel, Weight weight, StateId nextstate)\n      : ilabel(ilabel),\n        olabel(olabel),\n        weight(std::move(weight)),\n        nextstate(nextstate) {}\n\n  static const string &Type() {\n    static const string *const type = new string(\"reverse_\" + Arc::Type());\n    return *type;\n  }\n};\n\n// Arc with integer labels and state IDs and lexicographic weights.\ntemplate <class Weight1, class Weight2>\nstruct LexicographicArc {\n  using Label = int;\n  using StateId = int;\n  using Weight = LexicographicWeight<Weight1, Weight2>;\n\n  Label ilabel;\n  Label olabel;\n  Weight weight;\n  StateId nextstate;\n\n  LexicographicArc() = default;\n\n  LexicographicArc(Label ilabel, Label olabel, Weight weight, StateId nextstate)\n      : ilabel(ilabel),\n        olabel(olabel),\n        weight(std::move(weight)),\n        nextstate(nextstate) {}\n\n  static const string &Type() {\n    static const string *const type = new string(Weight::Type());\n    return *type;\n  }\n};\n\n// Arc with integer labels and state IDs and product weights.\ntemplate <class Weight1, class Weight2>\nstruct ProductArc {\n  using Label = int;\n  using StateId = int;\n  using Weight = ProductWeight<Weight1, Weight2>;\n\n  Label ilabel;\n  Label olabel;\n  Weight weight;\n  StateId nextstate;\n\n  ProductArc() = default;\n\n  ProductArc(Label ilabel, Label olabel, Weight weight, StateId nextstate)\n      : ilabel(ilabel),\n        olabel(olabel),\n        weight(std::move(weight)),\n        nextstate(nextstate) {}\n\n  static const string &Type() {\n    static const string *const type = new string(Weight::Type());\n    return *type;\n  }\n};\n\n// Arc with label and state ID type the same as first template argument and with\n// weights over the n-th Cartesian power of the weight type of the template\n// argument.\ntemplate <class A, unsigned int N>\nstruct PowerArc {\n  using Arc = A;\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = PowerWeight<typename Arc::Weight, N>;\n\n  Label ilabel;\n  Label olabel;\n  Weight weight;\n  StateId nextstate;\n\n  PowerArc() = default;\n\n  PowerArc(Label ilabel, Label olabel, Weight weight, StateId nextstate)\n      : ilabel(ilabel),\n        olabel(olabel),\n        weight(std::move(weight)),\n        nextstate(nextstate) {}\n\n  static const string &Type() {\n    static const string *const type =\n        new string(Arc::Type() + \"_^\" + std::to_string(N));\n    return *type;\n  }\n};\n\n// Arc with label and state ID type the same as first template argument and with\n// weights over the arbitrary Cartesian power of the weight type.\ntemplate <class A, class K = int>\nstruct SparsePowerArc {\n  using Arc = A;\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::Label;\n  using Weight = SparsePowerWeight<typename Arc::Weight, K>;\n\n  Label ilabel;\n  Label olabel;\n  Weight weight;\n  StateId nextstate;\n\n  SparsePowerArc() = default;\n\n  SparsePowerArc(Label ilabel, Label olabel, Weight weight, StateId nextstate)\n      : ilabel(ilabel),\n        olabel(olabel),\n        weight(std::move(weight)),\n        nextstate(nextstate) {}\n\n  static const string &Type() {\n    static const string *const type = [] {\n      string type = Arc::Type() + \"_^n\";\n      if (sizeof(K) != sizeof(uint32)) {\n        type += \"_\" + std::to_string(CHAR_BIT * sizeof(K));\n      }\n      return new string(type);\n    }();\n    return *type;\n  }\n};\n\n// Arc with label and state ID type the same as first template argument and with\n// expectation weight over the first template argument's weight type and the\n// second template argument.\ntemplate <class A, class X2>\nstruct ExpectationArc {\n  using Arc = A;\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using X1 = typename Arc::Weight;\n  using Weight = ExpectationWeight<X1, X2>;\n\n  Label ilabel;\n  Label olabel;\n  Weight weight;\n  StateId nextstate;\n\n  ExpectationArc() = default;\n\n  ExpectationArc(Label ilabel, Label olabel, Weight weight, StateId nextstate)\n      : ilabel(ilabel),\n        olabel(olabel),\n        weight(std::move(weight)),\n        nextstate(nextstate) {}\n\n  static const string &Type() {\n    static const string *const type =\n        new string(\"expectation_\" + Arc::Type() + \"_\" + X2::Type());\n    return *type;\n  }\n};\n\n}  // namespace fst\n\n#endif  // FST_ARC_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/arcfilter.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Function objects to restrict which arcs are traversed in an FST.\n\n#ifndef FST_ARCFILTER_H_\n#define FST_ARCFILTER_H_\n\n\n#include <fst/fst.h>\n#include <fst/util.h>\n\n\nnamespace fst {\n\n// True for all arcs.\ntemplate <class Arc>\nclass AnyArcFilter {\n public:\n  bool operator()(const Arc &arc) const { return true; }\n};\n\n// True for (input/output) epsilon arcs.\ntemplate <class Arc>\nclass EpsilonArcFilter {\n public:\n  bool operator()(const Arc &arc) const {\n    return arc.ilabel == 0 && arc.olabel == 0;\n  }\n};\n\n// True for input epsilon arcs.\ntemplate <class Arc>\nclass InputEpsilonArcFilter {\n public:\n  bool operator()(const Arc &arc) const { return arc.ilabel == 0; }\n};\n\n// True for output epsilon arcs.\ntemplate <class Arc>\nclass OutputEpsilonArcFilter {\n public:\n  bool operator()(const Arc &arc) const { return arc.olabel == 0; }\n};\n\n// True if specified label matches (doesn't match) when keep_match is\n// true (false).\ntemplate <class Arc>\nclass LabelArcFilter {\n public:\n  using Label = typename Arc::Label;\n\n  explicit LabelArcFilter(Label label, bool match_input = true,\n                          bool keep_match = true)\n      : label_(label), match_input_(match_input), keep_match_(keep_match) {}\n\n  bool operator()(const Arc &arc) const {\n    const bool match = (match_input_ ? arc.ilabel : arc.olabel) == label_;\n    return keep_match_ ? match : !match;\n  }\n\n private:\n  const Label label_;\n  const bool match_input_;\n  const bool keep_match_;\n};\n\n// True if specified labels match (don't match) when keep_match is true (false).\ntemplate <class Arc>\nclass MultiLabelArcFilter {\n public:\n  using Label = typename Arc::Label;\n\n  explicit MultiLabelArcFilter(bool match_input = true, bool keep_match = true)\n      : match_input_(match_input), keep_match_(keep_match) {}\n\n  bool operator()(const Arc &arc) const {\n    const Label label = match_input_ ? arc.ilabel : arc.olabel;\n    const bool match = labels_.Find(label) != labels_.End();\n    return keep_match_ ? match : !match;\n  }\n\n  void AddLabel(Label label) { labels_.Insert(label); }\n\n private:\n  CompactSet<Label, kNoLabel> labels_;\n  const bool match_input_;\n  const bool keep_match_;\n};\n\n}  // namespace fst\n\n#endif  // FST_ARCFILTER_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/arcsort.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Functions and classes to sort arcs in an FST.\n\n#ifndef FST_ARCSORT_H_\n#define FST_ARCSORT_H_\n\n#include <algorithm>\n#include <string>\n#include <vector>\n\n#include <fst/cache.h>\n#include <fst/state-map.h>\n#include <fst/test-properties.h>\n\n\nnamespace fst {\n\ntemplate <class Arc, class Compare>\nclass ArcSortMapper {\n public:\n  using FromArc = Arc;\n  using ToArc = Arc;\n\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  ArcSortMapper(const Fst<Arc> &fst, const Compare &comp)\n      : fst_(fst), comp_(comp), i_(0) {}\n\n  // Allows updating Fst argument; pass only if changed.\n  ArcSortMapper(const ArcSortMapper<Arc, Compare> &mapper,\n                const Fst<Arc> *fst = nullptr)\n      : fst_(fst ? *fst : mapper.fst_), comp_(mapper.comp_), i_(0) {}\n\n  StateId Start() { return fst_.Start(); }\n\n  Weight Final(StateId s) const { return fst_.Final(s); }\n\n  void SetState(StateId s) {\n    i_ = 0;\n    arcs_.clear();\n    arcs_.reserve(fst_.NumArcs(s));\n    for (ArcIterator<Fst<Arc>> aiter(fst_, s); !aiter.Done(); aiter.Next()) {\n      arcs_.push_back(aiter.Value());\n    }\n    std::sort(arcs_.begin(), arcs_.end(), comp_);\n  }\n\n  bool Done() const { return i_ >= arcs_.size(); }\n\n  const Arc &Value() const { return arcs_[i_]; }\n\n  void Next() { ++i_; }\n\n  MapSymbolsAction InputSymbolsAction() const { return MAP_COPY_SYMBOLS; }\n\n  MapSymbolsAction OutputSymbolsAction() const { return MAP_COPY_SYMBOLS; }\n\n  uint64 Properties(uint64 props) const { return comp_.Properties(props); }\n\n private:\n  const Fst<Arc> &fst_;\n  const Compare &comp_;\n  std::vector<Arc> arcs_;\n  ssize_t i_;  // current arc position\n\n  ArcSortMapper &operator=(const ArcSortMapper &) = delete;\n};\n\n// Sorts the arcs in an FST according to function object 'comp' of type Compare.\n// This version modifies its input. Comparison function objects ILabelCompare\n// and OLabelCompare are provided by the library. In general, Compare must meet\n// the requirements for a  comparison function object (e.g., similar to those\n// used by std::sort). It must also have a member Properties(uint64) that\n// specifies the known properties of the sorted FST; it takes as argument the\n// input FST's known properties before the sort.\n//\n// Complexity:\n//\n// - Time: O(v d log d)\n// - Space: O(d)\n//\n// where v = # of states and d = maximum out-degree.\ntemplate <class Arc, class Compare>\nvoid ArcSort(MutableFst<Arc> *fst, Compare comp) {\n  ArcSortMapper<Arc, Compare> mapper(*fst, comp);\n  StateMap(fst, mapper);\n}\n\nusing ArcSortFstOptions = CacheOptions;\n\n// Sorts the arcs in an FST according to function object 'comp' of type Compare.\n// This version is a delayed FST. Comparsion function objects ILabelCompare and\n// OLabelCompare are provided by the library. In general, Compare must meet the\n// requirements for a comparision function object (e.g., similar to those\n// used by std::sort). It must also have a member Properties(uint64) that\n// specifies the known properties of the sorted FST; it takes as argument the\n// input FST's known properties.\n//\n// Complexity:\n//\n// - Time: O(v d log d)\n// - Space: O(d)\n//\n// where v = # of states visited, d = maximum out-degree of states visited.\n// Constant time and space to visit an input state is assumed and exclusive of\n// caching.\ntemplate <class Arc, class Compare>\nclass ArcSortFst : public StateMapFst<Arc, Arc, ArcSortMapper<Arc, Compare>> {\n  using StateMapFst<Arc, Arc, ArcSortMapper<Arc, Compare>>::GetImpl;\n\n public:\n  using StateId = typename Arc::StateId;\n  using Mapper = ArcSortMapper<Arc, Compare>;\n\n  ArcSortFst(const Fst<Arc> &fst, const Compare &comp)\n      : StateMapFst<Arc, Arc, Mapper>(fst,\n                                      ArcSortMapper<Arc, Compare>(fst, comp)) {}\n\n  ArcSortFst(const Fst<Arc> &fst, const Compare &comp,\n             const ArcSortFstOptions &opts)\n      : StateMapFst<Arc, Arc, Mapper>(fst, Mapper(fst, comp), opts) {}\n\n  // See Fst<>::Copy() for doc.\n  ArcSortFst(const ArcSortFst<Arc, Compare> &fst, bool safe = false)\n      : StateMapFst<Arc, Arc, Mapper>(fst, safe) {}\n\n  // Gets a copy of this ArcSortFst. See Fst<>::Copy() for further doc.\n  ArcSortFst<Arc, Compare> *Copy(bool safe = false) const override {\n    return new ArcSortFst(*this, safe);\n  }\n\n  size_t NumArcs(StateId s) const override {\n    return GetImpl()->GetFst()->NumArcs(s);\n  }\n\n  size_t NumInputEpsilons(StateId s) const override {\n    return GetImpl()->GetFst()->NumInputEpsilons(s);\n  }\n\n  size_t NumOutputEpsilons(StateId s) const override {\n    return GetImpl()->GetFst()->NumOutputEpsilons(s);\n  }\n};\n\n// Specialization for ArcSortFst.\ntemplate <class Arc, class Compare>\nclass StateIterator<ArcSortFst<Arc, Compare>>\n    : public StateIterator<StateMapFst<Arc, Arc, ArcSortMapper<Arc, Compare>>> {\n public:\n  explicit StateIterator(const ArcSortFst<Arc, Compare> &fst)\n      : StateIterator<StateMapFst<Arc, Arc, ArcSortMapper<Arc, Compare>>>(fst) {\n  }\n};\n\n// Specialization for ArcSortFst.\ntemplate <class Arc, class Compare>\nclass ArcIterator<ArcSortFst<Arc, Compare>>\n    : public ArcIterator<StateMapFst<Arc, Arc, ArcSortMapper<Arc, Compare>>> {\n public:\n  ArcIterator(const ArcSortFst<Arc, Compare> &fst, typename Arc::StateId s)\n      : ArcIterator<StateMapFst<Arc, Arc, ArcSortMapper<Arc, Compare>>>(fst,\n                                                                        s) {}\n};\n\n// Compare class for comparing input labels of arcs.\ntemplate <class Arc>\nclass ILabelCompare {\n public:\n  ILabelCompare() {}\n\n  bool operator()(const Arc &arc1, const Arc &arc2) const {\n    return arc1.ilabel < arc2.ilabel;\n  }\n\n  uint64 Properties(uint64 props) const {\n    return (props & kArcSortProperties) | kILabelSorted |\n           (props & kAcceptor ? kOLabelSorted : 0);\n  }\n};\n\n// Compare class for comparing output labels of arcs.\ntemplate <class Arc>\nclass OLabelCompare {\n public:\n  OLabelCompare() {}\n\n  bool operator()(const Arc &arc1, const Arc &arc2) const {\n    return arc1.olabel < arc2.olabel;\n  }\n\n  uint64 Properties(uint64 props) const {\n    return (props & kArcSortProperties) | kOLabelSorted |\n           (props & kAcceptor ? kILabelSorted : 0);\n  }\n};\n\n// Useful aliases when using StdArc.\n\ntemplate <class Compare>\nusing StdArcSortFst = ArcSortFst<StdArc, Compare>;\n\nusing StdILabelCompare = ILabelCompare<StdArc>;\n\nusing StdOLabelCompare = OLabelCompare<StdArc>;\n\n}  // namespace fst\n\n#endif  // FST_ARCSORT_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/bi-table.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Classes for representing a bijective mapping between an arbitrary entry\n// of type T and a signed integral ID.\n\n#ifndef FST_BI_TABLE_H_\n#define FST_BI_TABLE_H_\n\n#include <deque>\n#include <memory>\n#include <functional>\n#include <unordered_map>\n#include <unordered_set>\n#include <vector>\n\n#include <fst/log.h>\n#include <fst/memory.h>\n\nnamespace fst {\n\n// Bitables model bijective mappings between entries of an arbitrary type T and\n// an signed integral ID of type I. The IDs are allocated starting from 0 in\n// order.\n//\n// template <class I, class T>\n// class BiTable {\n//  public:\n//\n//   // Required constructors.\n//   BiTable();\n//\n//   // Looks up integer ID from entry. If it doesn't exist and insert\n//   / is true, adds it; otherwise, returns -1.\n//   I FindId(const T &entry, bool insert = true);\n//\n//   // Looks up entry from integer ID.\n//   const T &FindEntry(I) const;\n//\n//   // Returns number of stored entries.\n//   I Size() const;\n// };\n\n// An implementation using a hash map for the entry to ID mapping. H is the\n// hash function and E is the equality function. If passed to the constructor,\n// ownership is given to this class.\ntemplate <class I, class T, class H, class E = std::equal_to<T>>\nclass HashBiTable {\n public:\n  // Reserves space for table_size elements. If passing H and E to the\n  // constructor, this class owns them.\n  explicit HashBiTable(size_t table_size = 0, H *h = nullptr, E *e = nullptr) :\n      hash_func_(h ? h : new H()), hash_equal_(e ? e : new E()),\n      entry2id_(table_size, *hash_func_, *hash_equal_) {\n    if (table_size) id2entry_.reserve(table_size);\n  }\n\n  HashBiTable(const HashBiTable<I, T, H, E> &table)\n      : hash_func_(new H(*table.hash_func_)),\n        hash_equal_(new E(*table.hash_equal_)),\n        entry2id_(table.entry2id_.begin(), table.entry2id_.end(),\n                  table.entry2id_.size(), *hash_func_, *hash_equal_),\n        id2entry_(table.id2entry_) {}\n\n  I FindId(const T &entry, bool insert = true) {\n    if (!insert) {\n      const auto it = entry2id_.find(entry);\n      return it == entry2id_.end() ? -1 : it->second - 1;\n    }\n    I &id_ref = entry2id_[entry];\n    if (id_ref == 0) {  // T not found; stores and assigns a new ID.\n      id2entry_.push_back(entry);\n      id_ref = id2entry_.size();\n    }\n    return id_ref - 1;  // NB: id_ref = ID + 1.\n  }\n\n  const T &FindEntry(I s) const { return id2entry_[s]; }\n\n  I Size() const { return id2entry_.size(); }\n\n  // TODO(riley): Add fancy clear-to-size, as in CompactHashBiTable.\n  void Clear() {\n    entry2id_.clear();\n    id2entry_.clear();\n  }\n\n private:\n  std::unique_ptr<H> hash_func_;\n  std::unique_ptr<E> hash_equal_;\n  std::unordered_map<T, I, H, E> entry2id_;\n  std::vector<T> id2entry_;\n};\n\n// Enables alternative hash set representations below.\nenum HSType { HS_STL = 0, HS_DENSE = 1, HS_SPARSE = 2, HS_FLAT = 3 };\n\n// Default hash set is STL hash_set.\ntemplate <class K, class H, class E, HSType HS>\nstruct HashSet : public std::unordered_set<K, H, E, PoolAllocator<K>> {\n  explicit HashSet(size_t n = 0, const H &h = H(), const E &e = E())\n      : std::unordered_set<K, H, E, PoolAllocator<K>>(n, h, e) {}\n\n  void rehash(size_t n) {}\n};\n\n// An implementation using a hash set for the entry to ID mapping. The hash set\n// holds keys which are either the ID or kCurrentKey. These keys can be mapped\n// to entries either by looking up in the entry vector or, if kCurrentKey, in\n// current_entry_. The hash and key equality functions map to entries first. H\n// is the hash function and E is the equality function. If passed to the\n// constructor, ownership is given to this class.\ntemplate <class I, class T, class H, class E = std::equal_to<T>,\n          HSType HS = HS_FLAT>\nclass CompactHashBiTable {\n public:\n  friend class HashFunc;\n  friend class HashEqual;\n\n  // Reserves space for table_size elements. If passing H and E to the\n  // constructor, this class owns them.\n  explicit CompactHashBiTable(size_t table_size = 0, H *h = nullptr,\n                              E *e = nullptr) :\n        hash_func_(h ? h : new H()), hash_equal_(e ? e : new E()),\n        compact_hash_func_(*this), compact_hash_equal_(*this),\n        keys_(table_size, compact_hash_func_, compact_hash_equal_) {\n    if (table_size) id2entry_.reserve(table_size);\n  }\n\n  CompactHashBiTable(const CompactHashBiTable<I, T, H, E, HS> &table)\n      : hash_func_(new H(*table.hash_func_)),\n        hash_equal_(new E(*table.hash_equal_)),\n        compact_hash_func_(*this), compact_hash_equal_(*this),\n        keys_(table.keys_.size(), compact_hash_func_, compact_hash_equal_),\n        id2entry_(table.id2entry_) {\n    keys_.insert(table.keys_.begin(), table.keys_.end());\n  }\n\n  I FindId(const T &entry, bool insert = true) {\n    current_entry_ = &entry;\n    if (insert) {\n      auto result = keys_.insert(kCurrentKey);\n      if (!result.second) return *result.first;  // Already exists.\n      // Overwrites kCurrentKey with a new key value; this is safe because it\n      // doesn't affect hashing or equality testing.\n      I key = id2entry_.size();\n      const_cast<I &>(*result.first) = key;\n      id2entry_.push_back(entry);\n      return key;\n    }\n    const auto it = keys_.find(kCurrentKey);\n    return it == keys_.end() ? -1 : *it;\n  }\n\n  const T &FindEntry(I s) const { return id2entry_[s]; }\n\n  I Size() const { return id2entry_.size(); }\n\n  // Clears content; with argument, erases last n IDs.\n  void Clear(ssize_t n = -1) {\n    if (n < 0 || n >= id2entry_.size()) {  // Clears completely.\n      keys_.clear();\n      id2entry_.clear();\n    } else if (n == id2entry_.size() - 1) {  // Leaves only key 0.\n      const T entry = FindEntry(0);\n      keys_.clear();\n      id2entry_.clear();\n      FindId(entry, true);\n    } else {\n      while (n-- > 0) {\n        I key = id2entry_.size() - 1;\n        keys_.erase(key);\n        id2entry_.pop_back();\n      }\n      keys_.rehash(0);\n    }\n  }\n\n private:\n  static constexpr I kCurrentKey = -1;\n  static constexpr I kEmptyKey = -2;\n  static constexpr I kDeletedKey = -3;\n\n  class HashFunc {\n   public:\n    explicit HashFunc(const CompactHashBiTable &ht) : ht_(&ht) {}\n\n    size_t operator()(I k) const {\n      if (k >= kCurrentKey) {\n        return (*ht_->hash_func_)(ht_->Key2Entry(k));\n      } else {\n        return 0;\n      }\n    }\n\n   private:\n    const CompactHashBiTable *ht_;\n  };\n\n  class HashEqual {\n   public:\n    explicit HashEqual(const CompactHashBiTable &ht) : ht_(&ht) {}\n\n    bool operator()(I k1, I k2) const {\n      if (k1 == k2) {\n        return true;\n      } else if (k1 >= kCurrentKey && k2 >= kCurrentKey) {\n        return (*ht_->hash_equal_)(ht_->Key2Entry(k1), ht_->Key2Entry(k2));\n      } else {\n        return false;\n      }\n    }\n\n   private:\n    const CompactHashBiTable *ht_;\n  };\n\n  using KeyHashSet = HashSet<I, HashFunc, HashEqual, HS>;\n\n  const T &Key2Entry(I k) const {\n    if (k == kCurrentKey) {\n      return *current_entry_;\n    } else {\n      return id2entry_[k];\n    }\n  }\n\n  std::unique_ptr<H> hash_func_;\n  std::unique_ptr<E> hash_equal_;\n  HashFunc compact_hash_func_;\n  HashEqual compact_hash_equal_;\n  KeyHashSet keys_;\n  std::vector<T> id2entry_;\n  const T *current_entry_;\n};\n\ntemplate <class I, class T, class H, class E, HSType HS>\nconstexpr I CompactHashBiTable<I, T, H, E, HS>::kCurrentKey;\n\ntemplate <class I, class T, class H, class E, HSType HS>\nconstexpr I CompactHashBiTable<I, T, H, E, HS>::kEmptyKey;\n\ntemplate <class I, class T, class H, class E, HSType HS>\nconstexpr I CompactHashBiTable<I, T, H, E, HS>::kDeletedKey;\n\n// An implementation using a vector for the entry to ID mapping. It is passed a\n// function object FP that should fingerprint entries uniquely to an integer\n// that can used as a vector index. Normally, VectorBiTable constructs the FP\n// object. The user can instead pass in this object; in that case, VectorBiTable\n// takes its ownership.\ntemplate <class I, class T, class FP>\nclass VectorBiTable {\n public:\n  // Reserves table_size cells of space. If passing FP argument to the\n  // constructor, this class owns it.\n  explicit VectorBiTable(FP *fp = nullptr, size_t table_size = 0) :\n      fp_(fp ? fp : new FP()) {\n    if (table_size) id2entry_.reserve(table_size);\n  }\n\n  VectorBiTable(const VectorBiTable<I, T, FP> &table)\n      : fp_(new FP(*table.fp_)), fp2id_(table.fp2id_),\n        id2entry_(table.id2entry_) {}\n\n  I FindId(const T &entry, bool insert = true) {\n    ssize_t fp = (*fp_)(entry);\n    if (fp >= fp2id_.size()) fp2id_.resize(fp + 1);\n    I &id_ref = fp2id_[fp];\n    if (id_ref == 0) {  // T not found.\n      if (insert) {     // Stores and assigns a new ID.\n        id2entry_.push_back(entry);\n        id_ref = id2entry_.size();\n      } else {\n        return -1;\n      }\n    }\n    return id_ref - 1;  // NB: id_ref = ID + 1.\n  }\n\n  const T &FindEntry(I s) const { return id2entry_[s]; }\n\n  I Size() const { return id2entry_.size(); }\n\n  const FP &Fingerprint() const { return *fp_; }\n\n private:\n  std::unique_ptr<FP> fp_;\n  std::vector<I> fp2id_;\n  std::vector<T> id2entry_;\n};\n\n// An implementation using a vector and a compact hash table. The selecting\n// functor S returns true for entries to be hashed in the vector. The\n// fingerprinting functor FP returns a unique fingerprint for each entry to be\n// hashed in the vector (these need to be suitable for indexing in a vector).\n// The hash functor H is used when hashing entry into the compact hash table.\n// If passed to the constructor, ownership is given to this class.\ntemplate <class I, class T, class S, class FP, class H, HSType HS = HS_DENSE>\nclass VectorHashBiTable {\n public:\n  friend class HashFunc;\n  friend class HashEqual;\n\n  explicit VectorHashBiTable(S *s, FP *fp, H *h, size_t vector_size = 0,\n                             size_t entry_size = 0)\n      : selector_(s), fp_(fp), h_(h), hash_func_(*this), hash_equal_(*this),\n        keys_(0, hash_func_, hash_equal_) {\n    if (vector_size) fp2id_.reserve(vector_size);\n    if (entry_size) id2entry_.reserve(entry_size);\n  }\n\n  VectorHashBiTable(const VectorHashBiTable<I, T, S, FP, H, HS> &table)\n      : selector_(new S(table.s_)), fp_(new FP(*table.fp_)),\n        h_(new H(*table.h_)), id2entry_(table.id2entry_),\n        fp2id_(table.fp2id_), hash_func_(*this), hash_equal_(*this),\n        keys_(table.keys_.size(), hash_func_, hash_equal_) {\n    keys_.insert(table.keys_.begin(), table.keys_.end());\n  }\n\n  I FindId(const T &entry, bool insert = true) {\n    if ((*selector_)(entry)) {  // Uses the vector if selector_(entry) == true.\n      uint64 fp = (*fp_)(entry);\n      if (fp2id_.size() <= fp) fp2id_.resize(fp + 1, 0);\n      if (fp2id_[fp] == 0) {  // T not found.\n        if (insert) {         // Stores and assigns a new ID.\n          id2entry_.push_back(entry);\n          fp2id_[fp] = id2entry_.size();\n        } else {\n          return -1;\n        }\n      }\n      return fp2id_[fp] - 1;  // NB: assoc_value = ID + 1.\n    } else {                  // Uses the hash table otherwise.\n      current_entry_ = &entry;\n      const auto it = keys_.find(kCurrentKey);\n      if (it == keys_.end()) {\n        if (insert) {\n          I key = id2entry_.size();\n          id2entry_.push_back(entry);\n          keys_.insert(key);\n          return key;\n        } else {\n          return -1;\n        }\n      } else {\n        return *it;\n      }\n    }\n  }\n\n  const T &FindEntry(I s) const { return id2entry_[s]; }\n\n  I Size() const { return id2entry_.size(); }\n\n  const S &Selector() const { return *selector_; }\n\n  const FP &Fingerprint() const { return *fp_; }\n\n  const H &Hash() const { return *h_; }\n\n private:\n  static constexpr I kCurrentKey = -1;\n  static constexpr I kEmptyKey = -2;\n\n  class HashFunc {\n   public:\n    explicit HashFunc(const VectorHashBiTable &ht) : ht_(&ht) {}\n\n    size_t operator()(I k) const {\n      if (k >= kCurrentKey) {\n        return (*(ht_->h_))(ht_->Key2Entry(k));\n      } else {\n        return 0;\n      }\n    }\n\n   private:\n    const VectorHashBiTable *ht_;\n  };\n\n  class HashEqual {\n   public:\n    explicit HashEqual(const VectorHashBiTable &ht) : ht_(&ht) {}\n\n    bool operator()(I k1, I k2) const {\n      if (k1 >= kCurrentKey && k2 >= kCurrentKey) {\n        return ht_->Key2Entry(k1) == ht_->Key2Entry(k2);\n      } else {\n        return k1 == k2;\n      }\n    }\n\n   private:\n    const VectorHashBiTable *ht_;\n  };\n\n  using KeyHashSet = HashSet<I, HashFunc, HashEqual, HS>;\n\n  const T &Key2Entry(I k) const {\n    if (k == kCurrentKey) {\n      return *current_entry_;\n    } else {\n      return id2entry_[k];\n    }\n  }\n\n  std::unique_ptr<S> selector_;  // True if entry hashed into vector.\n  std::unique_ptr<FP> fp_;       // Fingerprint used for hashing into vector.\n  std::unique_ptr<H> h_;         // Hash funcion used for hashing into hash_set.\n\n  std::vector<T> id2entry_;  // Maps state IDs to entry.\n  std::vector<I> fp2id_;     // Maps entry fingerprints to IDs.\n\n  // Compact implementation of the hash table mapping entries to state IDs\n  // using the hash function h_.\n  HashFunc hash_func_;\n  HashEqual hash_equal_;\n  KeyHashSet keys_;\n  const T *current_entry_;\n};\n\ntemplate <class I, class T, class S, class FP, class H, HSType HS>\nconstexpr I VectorHashBiTable<I, T, S, FP, H, HS>::kCurrentKey;\n\ntemplate <class I, class T, class S, class FP, class H, HSType HS>\nconstexpr I VectorHashBiTable<I, T, S, FP, H, HS>::kEmptyKey;\n\n// An implementation using a hash map for the entry to ID mapping. This version\n// permits erasing of arbitrary states. The entry T must have == defined and\n// its default constructor must produce a entry that will never be seen. F is\n// the hash function.\ntemplate <class I, class T, class F>\nclass ErasableBiTable {\n public:\n  ErasableBiTable() : first_(0) {}\n\n  I FindId(const T &entry, bool insert = true) {\n    I &id_ref = entry2id_[entry];\n    if (id_ref == 0) {  // T not found.\n      if (insert) {     // Stores and assigns a new ID.\n        id2entry_.push_back(entry);\n        id_ref = id2entry_.size() + first_;\n      } else {\n        return -1;\n      }\n    }\n    return id_ref - 1;  // NB: id_ref = ID + 1.\n  }\n\n  const T &FindEntry(I s) const { return id2entry_[s - first_]; }\n\n  I Size() const { return id2entry_.size(); }\n\n  void Erase(I s) {\n    auto &ref = id2entry_[s - first_];\n    entry2id_.erase(ref);\n    ref = empty_entry_;\n    while (!id2entry_.empty() && id2entry_.front() == empty_entry_) {\n      id2entry_.pop_front();\n      ++first_;\n    }\n  }\n\n private:\n  std::unordered_map<T, I, F> entry2id_;\n  std::deque<T> id2entry_;\n  const T empty_entry_;\n  I first_;  // I of first element in the deque.\n};\n\n}  // namespace fst\n\n#endif  // FST_BI_TABLE_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/cache.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// An FST implementation that caches FST elements of a delayed computation.\n\n#ifndef FST_CACHE_H_\n#define FST_CACHE_H_\n\n#include <functional>\n#include <unordered_map>\nusing std::unordered_map;\nusing std::unordered_multimap;\n#include <list>\n#include <vector>\n\n#include <fst/flags.h>\n#include <fst/log.h>\n\n#include <fst/vector-fst.h>\n\n\nDECLARE_bool(fst_default_cache_gc);\nDECLARE_int64(fst_default_cache_gc_limit);\n\nnamespace fst {\n\n// Options for controlling caching behavior; higher level than CacheImplOptions.\nstruct CacheOptions {\n  bool gc;          // Enables GC.\n  size_t gc_limit;  // Number of bytes allowed before GC.\n\n  explicit CacheOptions(bool gc = FLAGS_fst_default_cache_gc,\n                        size_t gc_limit = FLAGS_fst_default_cache_gc_limit)\n      : gc(gc), gc_limit(gc_limit) {}\n};\n\n// Options for controlling caching behavior, at a lower level than\n// CacheOptions; templated on the cache store and allows passing the store.\ntemplate <class CacheStore>\nstruct CacheImplOptions {\n  bool gc;            // Enables GC.\n  size_t gc_limit;    // Number of bytes allowed before GC.\n  CacheStore *store;  // Cache store.\n  bool own_store;     // Should CacheImpl takes ownership of the store?\n\n  explicit CacheImplOptions(bool gc = FLAGS_fst_default_cache_gc,\n                            size_t gc_limit = FLAGS_fst_default_cache_gc_limit,\n                            CacheStore *store = nullptr)\n      : gc(gc), gc_limit(gc_limit), store(store), own_store(true) {}\n\n  explicit CacheImplOptions(const CacheOptions &opts)\n      : gc(opts.gc), gc_limit(opts.gc_limit), store(nullptr), own_store(true) {}\n};\n\n// Cache flags.\nconstexpr uint32 kCacheFinal = 0x0001;   // Final weight has been cached.\nconstexpr uint32 kCacheArcs = 0x0002;    // Arcs have been cached.\nconstexpr uint32 kCacheInit = 0x0004;    // Initialized by GC.\nconstexpr uint32 kCacheRecent = 0x0008;  // Visited since GC.\nconstexpr uint32 kCacheFlags =\n    kCacheFinal | kCacheArcs | kCacheInit | kCacheRecent;\n\n// Cache state, with arcs stored in a per-state std::vector.\ntemplate <class A, class M = PoolAllocator<A>>\nclass CacheState {\n public:\n  using Arc = A;\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using ArcAllocator = M;\n  using StateAllocator =\n      typename ArcAllocator::template rebind<CacheState<A, M>>::other;\n\n  // Provides STL allocator for arcs.\n  explicit CacheState(const ArcAllocator &alloc)\n      : final_(Weight::Zero()),\n        niepsilons_(0),\n        noepsilons_(0),\n        arcs_(alloc),\n        flags_(0),\n        ref_count_(0) {}\n\n  CacheState(const CacheState<A> &state, const ArcAllocator &alloc)\n      : final_(state.Final()),\n        niepsilons_(state.NumInputEpsilons()),\n        noepsilons_(state.NumOutputEpsilons()),\n        arcs_(state.arcs_.begin(), state.arcs_.end(), alloc),\n        flags_(state.Flags()),\n        ref_count_(0) {}\n\n  void Reset() {\n    final_ = Weight::Zero();\n    niepsilons_ = 0;\n    noepsilons_ = 0;\n    ref_count_ = 0;\n    flags_ = 0;\n    arcs_.clear();\n  }\n\n  Weight Final() const { return final_; }\n\n  size_t NumInputEpsilons() const { return niepsilons_; }\n\n  size_t NumOutputEpsilons() const { return noepsilons_; }\n\n  size_t NumArcs() const { return arcs_.size(); }\n\n  const Arc &GetArc(size_t n) const { return arcs_[n]; }\n\n  // Used by the ArcIterator<Fst<Arc>> efficient implementation.\n  const Arc *Arcs() const { return !arcs_.empty() ? &arcs_[0] : nullptr; }\n\n  // Accesses flags; used by the caller.\n  uint32 Flags() const { return flags_; }\n\n  // Accesses ref count; used by the caller.\n  int RefCount() const { return ref_count_; }\n\n  void SetFinal(Weight weight) { final_ = std::move(weight); }\n\n  void ReserveArcs(size_t n) { arcs_.reserve(n); }\n\n  // Adds one arc at a time with all needed book-keeping; use PushArc and\n  // SetArcs for a more efficient alternative.\n  void AddArc(const Arc &arc) {\n    arcs_.push_back(arc);\n    if (arc.ilabel == 0) ++niepsilons_;\n    if (arc.olabel == 0) ++noepsilons_;\n  }\n\n  // Adds one arc at a time with delayed book-keeping; finalize with SetArcs().\n  void PushArc(const Arc &arc) { arcs_.push_back(arc); }\n\n  // Finalizes arcs book-keeping; call only once.\n  void SetArcs() {\n    for (const auto &arc : arcs_) {\n      if (arc.ilabel == 0) ++niepsilons_;\n      if (arc.olabel == 0) ++noepsilons_;\n    }\n  }\n\n  // Modifies nth arc.\n  void SetArc(const Arc &arc, size_t n) {\n    if (arcs_[n].ilabel == 0) --niepsilons_;\n    if (arcs_[n].olabel == 0) --noepsilons_;\n    if (arc.ilabel == 0) ++niepsilons_;\n    if (arc.olabel == 0) ++noepsilons_;\n    arcs_[n] = arc;\n  }\n\n  // Deletes all arcs.\n  void DeleteArcs() {\n    niepsilons_ = 0;\n    noepsilons_ = 0;\n    arcs_.clear();\n  }\n\n  void DeleteArcs(size_t n) {\n    for (size_t i = 0; i < n; ++i) {\n      if (arcs_.back().ilabel == 0) --niepsilons_;\n      if (arcs_.back().olabel == 0) --noepsilons_;\n      arcs_.pop_back();\n    }\n  }\n\n  // Sets status flags; used by the caller.\n  void SetFlags(uint32 flags, uint32 mask) const {\n    flags_ &= ~mask;\n    flags_ |= flags;\n  }\n\n  // Mutates reference counts; used by the caller.\n\n  int IncrRefCount() const { return ++ref_count_; }\n\n  int DecrRefCount() const { return --ref_count_; }\n\n  // Used by the ArcIterator<Fst<Arc>> efficient implementation.\n  int *MutableRefCount() const { return &ref_count_; }\n\n  // Used for state class allocation.\n  void *operator new(size_t size, StateAllocator *alloc) {\n    return alloc->allocate(1);\n  }\n\n  // For state destruction and memory freeing.\n  static void Destroy(CacheState<Arc> *state, StateAllocator *alloc) {\n    if (state) {\n      state->~CacheState<Arc>();\n      alloc->deallocate(state, 1);\n    }\n  }\n\n private:\n  Weight final_;                         // Final weight.\n  size_t niepsilons_;                    // # of input epsilons.\n  size_t noepsilons_;                    // # of output epsilons.\n  std::vector<Arc, ArcAllocator> arcs_;  // Arcs representation.\n  mutable uint32 flags_;\n  mutable int ref_count_;  // If 0, available for GC.\n};\n\n// Cache store, allocating and storing states, providing a mapping from state\n// IDs to cached states, and an iterator over these states. The state template\n// argument must implement the CacheState interface. The state for a StateId s\n// is constructed when requested by GetMutableState(s) if it is not yet stored.\n// Initially, a state has a reference count of zero, but the user may increment\n// or decrement this to control the time of destruction. In particular, a state\n// is destroyed when:\n//\n// 1. This instance is destroyed, or\n// 2. Clear() or Delete() is called, or\n// 3. Possibly (implementation-dependently) when:\n//    - Garbage collection is enabled (as defined by opts.gc),\n//    - The cache store size exceeds the limits (as defined by opts.gc_limits),\n//    - The state's reference count is zero, and\n//    - The state is not the most recently requested state.\n//\n// template <class S>\n// class CacheStore {\n//  public:\n//   using State = S;\n//   using Arc = typename State::Arc;\n//   using StateId = typename Arc::StateId;\n//\n//   // Required constructors/assignment operators.\n//   explicit CacheStore(const CacheOptions &opts);\n//\n//   // Returns nullptr if state is not stored.\n//   const State *GetState(StateId s);\n//\n//   // Creates state if state is not stored.\n//   State *GetMutableState(StateId s);\n//\n//   // Similar to State::AddArc() but updates cache store book-keeping.\n//   void AddArc(State *state, const Arc &arc);\n//\n//   // Similar to State::SetArcs() but updates cache store book-keeping; call\n//   // only once.\n//   void SetArcs(State *state);\n//\n//   // Similar to State::DeleteArcs() but updates cache store book-keeping.\n//\n//   void DeleteArcs(State *state);\n//\n//   void DeleteArcs(State *state, size_t n);\n//\n//   // Deletes all cached states.\n//   void Clear();\n//\n//   // Iterates over cached states (in an arbitrary order); only needed if\n//   // opts.gc is true.\n//   bool Done() const;      // End of iteration.\n//   StateId Value() const;  // Current state.\n//   void Next();            // Advances to next state (when !Done).\n//   void Reset();           // Returns to initial condition.\n//   void Delete();          // Deletes current state and advances to next.\n// };\n\n// Container cache stores.\n\n// This class uses a vector of pointers to states to store cached states.\ntemplate <class S>\nclass VectorCacheStore {\n public:\n  using State = S;\n  using Arc = typename State::Arc;\n  using StateId = typename Arc::StateId;\n  using StateList = std::list<StateId, PoolAllocator<StateId>>;\n\n  // Required constructors/assignment operators.\n  explicit VectorCacheStore(const CacheOptions &opts) : cache_gc_(opts.gc) {\n    Clear();\n    Reset();\n  }\n\n  VectorCacheStore(const VectorCacheStore<S> &store)\n      : cache_gc_(store.cache_gc_) {\n    CopyStates(store);\n    Reset();\n  }\n\n  ~VectorCacheStore() { Clear(); }\n\n  VectorCacheStore<State> &operator=(const VectorCacheStore<State> &store) {\n    if (this != &store) {\n      CopyStates(store);\n      Reset();\n    }\n    return *this;\n  }\n\n  // Returns nullptr if state is not stored.\n  const State *GetState(StateId s) const {\n    return s < state_vec_.size() ? state_vec_[s] : nullptr;\n  }\n\n  // Creates state if state is not stored.\n  State *GetMutableState(StateId s) {\n    State *state = nullptr;\n    if (s >= state_vec_.size()) {\n      state_vec_.resize(s + 1, nullptr);\n    } else {\n      state = state_vec_[s];\n    }\n    if (!state) {\n      state = new (&state_alloc_) State(arc_alloc_);\n      state_vec_[s] = state;\n      if (cache_gc_) state_list_.push_back(s);\n    }\n    return state;\n  }\n\n  // Similar to State::AddArc() but updates cache store book-keeping\n  void AddArc(State *state, const Arc &arc) { state->AddArc(arc); }\n\n  // Similar to State::SetArcs() but updates cache store book-keeping; call\n  // only once.\n  void SetArcs(State *state) { state->SetArcs(); }\n\n  // Deletes all arcs.\n  void DeleteArcs(State *state) { state->DeleteArcs(); }\n\n  // Deletes some arcs.\n  void DeleteArcs(State *state, size_t n) { state->DeleteArcs(n); }\n\n  // Deletes all cached states.\n  void Clear() {\n    for (StateId s = 0; s < state_vec_.size(); ++s) {\n      State::Destroy(state_vec_[s], &state_alloc_);\n    }\n    state_vec_.clear();\n    state_list_.clear();\n  }\n\n  // Iterates over cached states (in an arbitrary order); only works if GC is\n  // enabled (o.w. avoiding state_list_ overhead).\n  bool Done() const { return iter_ == state_list_.end(); }\n\n  StateId Value() const { return *iter_; }\n\n  void Next() { ++iter_; }\n\n  void Reset() { iter_ = state_list_.begin(); }\n\n  // Deletes current state and advances to next.\n  void Delete() {\n    State::Destroy(state_vec_[*iter_], &state_alloc_);\n    state_vec_[*iter_] = nullptr;\n    state_list_.erase(iter_++);\n  }\n\n private:\n  void CopyStates(const VectorCacheStore<State> &store) {\n    Clear();\n    state_vec_.reserve(store.state_vec_.size());\n    for (StateId s = 0; s < store.state_vec_.size(); ++s) {\n      State *state = nullptr;\n      const auto *store_state = store.state_vec_[s];\n      if (store_state) {\n        state = new (&state_alloc_) State(*store_state, arc_alloc_);\n        if (cache_gc_) state_list_.push_back(s);\n      }\n      state_vec_.push_back(state);\n    }\n  }\n\n  bool cache_gc_;                               // Supports iteration when true.\n  std::vector<State *> state_vec_;              // Vector of states (or null).\n  StateList state_list_;                        // List of states.\n  typename StateList::iterator iter_;           // State list iterator.\n  typename State::StateAllocator state_alloc_;  // For state allocation.\n  typename State::ArcAllocator arc_alloc_;      // For arc allocation.\n};\n\n// This class uses a hash map from state IDs to pointers to cached states.\ntemplate <class S>\nclass HashCacheStore {\n public:\n  using State = S;\n  using Arc = typename State::Arc;\n  using StateId = typename Arc::StateId;\n\n  using StateMap =\n      std::unordered_map<StateId, State *, std::hash<StateId>,\n                         std::equal_to<StateId>,\n                         PoolAllocator<std::pair<const StateId, State *>>>;\n\n  // Required constructors/assignment operators.\n  explicit HashCacheStore(const CacheOptions &opts) {\n    Clear();\n    Reset();\n  }\n\n  HashCacheStore(const HashCacheStore<S> &store) {\n    CopyStates(store);\n    Reset();\n  }\n\n  ~HashCacheStore() { Clear(); }\n\n  HashCacheStore<State> &operator=(const HashCacheStore<State> &store) {\n    if (this != &store) {\n      CopyStates(store);\n      Reset();\n    }\n    return *this;\n  }\n\n  // Returns nullptr if state is not stored.\n  const State *GetState(StateId s) const {\n    const auto it = state_map_.find(s);\n    return it != state_map_.end() ? it->second : nullptr;\n  }\n\n  // Creates state if state is not stored.\n  State *GetMutableState(StateId s) {\n    auto *&state = state_map_[s];\n    if (!state) state = new (&state_alloc_) State(arc_alloc_);\n    return state;\n  }\n\n  // Similar to State::AddArc() but updates cache store book-keeping.\n  void AddArc(State *state, const Arc &arc) { state->AddArc(arc); }\n\n  // Similar to State::SetArcs() but updates internal cache size; call only\n  // once.\n  void SetArcs(State *state) { state->SetArcs(); }\n\n  // Deletes all arcs.\n  void DeleteArcs(State *state) { state->DeleteArcs(); }\n\n  // Deletes some arcs.\n  void DeleteArcs(State *state, size_t n) { state->DeleteArcs(n); }\n\n  // Deletes all cached states.\n  void Clear() {\n    for (auto it = state_map_.begin(); it != state_map_.end(); ++it) {\n      State::Destroy(it->second, &state_alloc_);\n    }\n    state_map_.clear();\n  }\n\n  // Iterates over cached states (in an arbitrary order).\n  bool Done() const { return iter_ == state_map_.end(); }\n\n  StateId Value() const { return iter_->first; }\n\n  void Next() { ++iter_; }\n\n  void Reset() { iter_ = state_map_.begin(); }\n\n  // Deletes current state and advances to next.\n  void Delete() {\n    State::Destroy(iter_->second, &state_alloc_);\n    state_map_.erase(iter_++);\n  }\n\n private:\n  void CopyStates(const HashCacheStore<State> &store) {\n    Clear();\n    for (auto it = store.state_map_.begin(); it != store.state_map_.end();\n         ++it) {\n      state_map_[it->first] =\n          new (&state_alloc_) State(*it->second, arc_alloc_);\n    }\n  }\n\n  StateMap state_map_;                          // Map from state ID to state.\n  typename StateMap::iterator iter_;            // State map iterator.\n  typename State::StateAllocator state_alloc_;  // For state allocation.\n  typename State::ArcAllocator arc_alloc_;      // For arc allocation.\n};\n\n// Garbage-colllection cache stores.\n\n// This class implements a simple garbage collection scheme when\n// 'opts.gc_limit = 0'. In particular, the first cached state is reused for each\n// new state so long as the reference count is zero on the to-be-reused state.\n// Otherwise, the full underlying store is used. The caller can increment the\n// reference count to inhibit the GC of in-use states (e.g., in an ArcIterator).\n//\n// The typical use case for this optimization is when a single pass over a\n// cached\n// FST is performed with only one-state expanded at a time.\ntemplate <class CacheStore>\nclass FirstCacheStore {\n public:\n  using State = typename CacheStore::State;\n  using Arc = typename State::Arc;\n  using StateId = typename Arc::StateId;\n\n  // Required constructors/assignment operators.\n  explicit FirstCacheStore(const CacheOptions &opts)\n      : store_(opts),\n        cache_gc_(opts.gc_limit == 0),  // opts.gc ignored historically.\n        cache_first_state_id_(kNoStateId),\n        cache_first_state_(nullptr) {}\n\n  FirstCacheStore(const FirstCacheStore<CacheStore> &store)\n      : store_(store.store_),\n        cache_gc_(store.cache_gc_),\n        cache_first_state_id_(store.cache_first_state_id_),\n        cache_first_state_(store.cache_first_state_id_ != kNoStateId\n                               ? store_.GetMutableState(0)\n                               : nullptr) {}\n\n  FirstCacheStore<CacheStore> &operator=(\n      const FirstCacheStore<CacheStore> &store) {\n    if (this != &store) {\n      store_ = store.store_;\n      cache_gc_ = store.cache_gc_;\n      cache_first_state_id_ = store.cache_first_state_id_;\n      cache_first_state_ = store.cache_first_state_id_ != kNoStateId\n                               ? store_.GetMutableState(0)\n                               : nullptr;\n    }\n    return *this;\n  }\n\n  // Returns nullptr if state is not stored.\n  const State *GetState(StateId s) const {\n    // store_ state 0 may hold first cached state; the rest are shifted by 1.\n    return s == cache_first_state_id_ ? cache_first_state_\n                                      : store_.GetState(s + 1);\n  }\n\n  // Creates state if state is not stored.\n  State *GetMutableState(StateId s) {\n    // store_ state 0 used to hold first cached state; the rest are shifted by\n    // 1.\n    if (cache_first_state_id_ == s) {\n      return cache_first_state_;  // Request for first cached state.\n    }\n    if (cache_gc_) {\n      if (cache_first_state_id_ == kNoStateId) {\n        cache_first_state_id_ = s;  // Sets first cached state.\n        cache_first_state_ = store_.GetMutableState(0);\n        cache_first_state_->SetFlags(kCacheInit, kCacheInit);\n        cache_first_state_->ReserveArcs(2 * kAllocSize);\n        return cache_first_state_;\n      } else if (cache_first_state_->RefCount() == 0) {\n        cache_first_state_id_ = s;  // Updates first cached state.\n        cache_first_state_->Reset();\n        cache_first_state_->SetFlags(kCacheInit, kCacheInit);\n        return cache_first_state_;\n      } else {  // Keeps first cached state.\n        cache_first_state_->SetFlags(0, kCacheInit);  // Clears initialized bit.\n        cache_gc_ = false;                            // Disables GC.\n      }\n    }\n    auto *state = store_.GetMutableState(s + 1);\n    return state;\n  }\n\n  // Similar to State::AddArc() but updates cache store book-keeping.\n  void AddArc(State *state, const Arc &arc) { store_.AddArc(state, arc); }\n\n  // Similar to State::SetArcs() but updates internal cache size; call only\n  // once.\n  void SetArcs(State *state) { store_.SetArcs(state); }\n\n  // Deletes all arcs\n  void DeleteArcs(State *state) { store_.DeleteArcs(state); }\n\n  // Deletes some arcs\n  void DeleteArcs(State *state, size_t n) { store_.DeleteArcs(state, n); }\n\n  // Deletes all cached states\n  void Clear() {\n    store_.Clear();\n    cache_first_state_id_ = kNoStateId;\n    cache_first_state_ = nullptr;\n  }\n\n  // Iterates over cached states (in an arbitrary order). Only needed if GC is\n  // enabled.\n  bool Done() const { return store_.Done(); }\n\n  StateId Value() const {\n    // store_ state 0 may hold first cached state; rest shifted + 1.\n    const auto s = store_.Value();\n    return s ? s - 1 : cache_first_state_id_;\n  }\n\n  void Next() { store_.Next(); }\n\n  void Reset() { store_.Reset(); }\n\n  // Deletes current state and advances to next.\n  void Delete() {\n    if (Value() == cache_first_state_id_) {\n      cache_first_state_id_ = kNoStateId;\n      cache_first_state_ = nullptr;\n    }\n    store_.Delete();\n  }\n\n private:\n  CacheStore store_;              // Underlying store.\n  bool cache_gc_;                 // GC enabled.\n  StateId cache_first_state_id_;  // First cached state ID.\n  State *cache_first_state_;      // First cached state.\n};\n\n// This class implements mark-sweep garbage collection on an underlying cache\n// store. If GC is enabled, garbage collection of states is performed in a\n// rough approximation of LRU order once when 'gc_limit' bytes is reached. The\n// caller can increment the reference count to inhibit the GC of in-use state\n// (e.g., in an ArcIterator). With GC enabled, the 'gc_limit' parameter allows\n// the caller to trade-off time vs. space.\ntemplate <class CacheStore>\nclass GCCacheStore {\n public:\n  using State = typename CacheStore::State;\n  using Arc = typename State::Arc;\n  using StateId = typename Arc::StateId;\n\n  // Required constructors/assignment operators.\n  explicit GCCacheStore(const CacheOptions &opts)\n      : store_(opts),\n        cache_gc_request_(opts.gc),\n        cache_limit_(opts.gc_limit > kMinCacheLimit ? opts.gc_limit\n                                                    : kMinCacheLimit),\n        cache_gc_(false),\n        cache_size_(0) {}\n\n  // Returns 0 if state is not stored.\n  const State *GetState(StateId s) const { return store_.GetState(s); }\n\n  // Creates state if state is not stored\n  State *GetMutableState(StateId s) {\n    auto *state = store_.GetMutableState(s);\n    if (cache_gc_request_ && !(state->Flags() & kCacheInit)) {\n      state->SetFlags(kCacheInit, kCacheInit);\n      cache_size_ += sizeof(State) + state->NumArcs() * sizeof(Arc);\n      // GC is enabled once an uninited state (from underlying store) is seen.\n      cache_gc_ = true;\n      if (cache_size_ > cache_limit_) GC(state, false);\n    }\n    return state;\n  }\n\n  // Similar to State::AddArc() but updates cache store book-keeping.\n  void AddArc(State *state, const Arc &arc) {\n    store_.AddArc(state, arc);\n    if (cache_gc_ && (state->Flags() & kCacheInit)) {\n      cache_size_ += sizeof(Arc);\n      if (cache_size_ > cache_limit_) GC(state, false);\n    }\n  }\n\n  // Similar to State::SetArcs() but updates internal cache size; call only\n  // once.\n  void SetArcs(State *state) {\n    store_.SetArcs(state);\n    if (cache_gc_ && (state->Flags() & kCacheInit)) {\n      cache_size_ += state->NumArcs() * sizeof(Arc);\n      if (cache_size_ > cache_limit_) GC(state, false);\n    }\n  }\n\n  // Deletes all arcs.\n  void DeleteArcs(State *state) {\n    if (cache_gc_ && (state->Flags() & kCacheInit)) {\n      cache_size_ -= state->NumArcs() * sizeof(Arc);\n    }\n    store_.DeleteArcs(state);\n  }\n\n  // Deletes some arcs.\n  void DeleteArcs(State *state, size_t n) {\n    if (cache_gc_ && (state->Flags() & kCacheInit)) {\n      cache_size_ -= n * sizeof(Arc);\n    }\n    store_.DeleteArcs(state, n);\n  }\n\n  // Deletes all cached states.\n  void Clear() {\n    store_.Clear();\n    cache_size_ = 0;\n  }\n\n  // Iterates over cached states (in an arbitrary order); only needed if GC is\n  // enabled.\n  bool Done() const { return store_.Done(); }\n\n  StateId Value() const { return store_.Value(); }\n\n  void Next() { store_.Next(); }\n\n  void Reset() { store_.Reset(); }\n\n  // Deletes current state and advances to next.\n  void Delete() {\n    if (cache_gc_) {\n      const auto *state = store_.GetState(Value());\n      if (state->Flags() & kCacheInit) {\n        cache_size_ -= sizeof(State) + state->NumArcs() * sizeof(Arc);\n      }\n    }\n    store_.Delete();\n  }\n\n  // Removes from the cache store (not referenced-counted and not the current)\n  // states that have not been accessed since the last GC until at most\n  // cache_fraction * cache_limit_ bytes are cached. If that fails to free\n  // enough, attempts to uncaching recently visited states as well. If still\n  // unable to free enough memory, then widens cache_limit_.\n  void GC(const State *current, bool free_recent, float cache_fraction = 0.666);\n\n  // Returns the current cache size in bytes or 0 if GC is disabled.\n  size_t CacheSize() const { return cache_size_; }\n\n  // Returns the cache limit in bytes.\n  size_t CacheLimit() const { return cache_limit_; }\n\n private:\n  static constexpr size_t kMinCacheLimit = 8096;  // Minimum cache limit.\n\n  CacheStore store_;       // Underlying store.\n  bool cache_gc_request_;  // GC requested but possibly not yet enabled.\n  size_t cache_limit_;     // Number of bytes allowed before GC.\n  bool cache_gc_;          // GC enabled\n  size_t cache_size_;      // Number of bytes cached.\n};\n\ntemplate <class CacheStore>\nvoid GCCacheStore<CacheStore>::GC(const State *current, bool free_recent,\n                                  float cache_fraction) {\n  if (!cache_gc_) return;\n  VLOG(2) << \"GCCacheStore: Enter GC: object = \"\n          << \"(\" << this << \"), free recently cached = \" << free_recent\n          << \", cache size = \" << cache_size_\n          << \", cache frac = \" << cache_fraction\n          << \", cache limit = \" << cache_limit_ << \"\\n\";\n  size_t cache_target = cache_fraction * cache_limit_;\n  store_.Reset();\n  while (!store_.Done()) {\n    auto *state = store_.GetMutableState(store_.Value());\n    if (cache_size_ > cache_target && state->RefCount() == 0 &&\n        (free_recent || !(state->Flags() & kCacheRecent)) && state != current) {\n      if (state->Flags() & kCacheInit) {\n        size_t size = sizeof(State) + state->NumArcs() * sizeof(Arc);\n        if (size < cache_size_) {\n          cache_size_ -= size;\n        }\n      }\n      store_.Delete();\n    } else {\n      state->SetFlags(0, kCacheRecent);\n      store_.Next();\n    }\n  }\n  if (!free_recent && cache_size_ > cache_target) {  // Recurses on recent.\n    GC(current, true, cache_fraction);\n  } else if (cache_target > 0) {  // Widens cache limit.\n    while (cache_size_ > cache_target) {\n      cache_limit_ *= 2;\n      cache_target *= 2;\n    }\n  } else if (cache_size_ > 0) {\n    FSTERROR() << \"GCCacheStore:GC: Unable to free all cached states\";\n  }\n  VLOG(2) << \"GCCacheStore: Exit GC: object = \"\n          << \"(\" << this << \"), free recently cached = \" << free_recent\n          << \", cache size = \" << cache_size_\n          << \", cache frac = \" << cache_fraction\n          << \", cache limit = \" << cache_limit_ << \"\\n\";\n}\n\ntemplate <class CacheStore>\nconstexpr size_t GCCacheStore<CacheStore>::kMinCacheLimit;\n\n// This class is the default cache state and store used by CacheBaseImpl.\n// It uses VectorCacheStore for storage decorated by FirstCacheStore\n// and GCCacheStore to do (optional) garbage collection.\ntemplate <class Arc>\nclass DefaultCacheStore\n    : public GCCacheStore<FirstCacheStore<VectorCacheStore<CacheState<Arc>>>> {\n public:\n  explicit DefaultCacheStore(const CacheOptions &opts)\n      : GCCacheStore<FirstCacheStore<VectorCacheStore<CacheState<Arc>>>>(opts) {\n  }\n};\n\nnamespace internal {\n\n// This class is used to cache FST elements stored in states of type State\n// (see CacheState) with the flags used to indicate what has been cached. Use\n// HasStart(), HasFinal(), and HasArcs() to determine if cached and SetStart(),\n// SetFinal(), AddArc(), (or PushArc() and SetArcs()) to cache. Note that you\n// must set the final weight even if the state is non-final to mark it as\n// cached. The state storage method and any garbage collection policy are\n// determined by the cache store. If the store is passed in with the options,\n// CacheBaseImpl takes ownership.\ntemplate <class State,\n          class CacheStore = DefaultCacheStore<typename State::Arc>>\nclass CacheBaseImpl : public FstImpl<typename State::Arc> {\n public:\n  using Arc = typename State::Arc;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using Store = CacheStore;\n\n  using FstImpl<Arc>::Type;\n  using FstImpl<Arc>::Properties;\n\n  explicit CacheBaseImpl(const CacheOptions &opts = CacheOptions())\n      : has_start_(false),\n        cache_start_(kNoStateId),\n        nknown_states_(0),\n        min_unexpanded_state_id_(0),\n        max_expanded_state_id_(-1),\n        cache_gc_(opts.gc),\n        cache_limit_(opts.gc_limit),\n        cache_store_(new CacheStore(opts)),\n        new_cache_store_(true),\n        own_cache_store_(true) {}\n\n  explicit CacheBaseImpl(const CacheImplOptions<CacheStore> &opts)\n      : has_start_(false),\n        cache_start_(kNoStateId),\n        nknown_states_(0),\n        min_unexpanded_state_id_(0),\n        max_expanded_state_id_(-1),\n        cache_gc_(opts.gc),\n        cache_limit_(opts.gc_limit),\n        cache_store_(opts.store ? opts.store : new CacheStore(CacheOptions(\n                                                   opts.gc, opts.gc_limit))),\n        new_cache_store_(!opts.store),\n        own_cache_store_(opts.store ? opts.own_store : true) {}\n\n  // Preserve gc parameters. If preserve_cache is true, also preserves\n  // cache data.\n  CacheBaseImpl(const CacheBaseImpl<State, CacheStore> &impl,\n                bool preserve_cache = false)\n      : FstImpl<Arc>(),\n        has_start_(false),\n        cache_start_(kNoStateId),\n        nknown_states_(0),\n        min_unexpanded_state_id_(0),\n        max_expanded_state_id_(-1),\n        cache_gc_(impl.cache_gc_),\n        cache_limit_(impl.cache_limit_),\n        cache_store_(new CacheStore(CacheOptions(cache_gc_, cache_limit_))),\n        new_cache_store_(impl.new_cache_store_ || !preserve_cache),\n        own_cache_store_(true) {\n    if (preserve_cache) {\n      *cache_store_ = *impl.cache_store_;\n      has_start_ = impl.has_start_;\n      cache_start_ = impl.cache_start_;\n      nknown_states_ = impl.nknown_states_;\n      expanded_states_ = impl.expanded_states_;\n      min_unexpanded_state_id_ = impl.min_unexpanded_state_id_;\n      max_expanded_state_id_ = impl.max_expanded_state_id_;\n    }\n  }\n\n  ~CacheBaseImpl() override { if (own_cache_store_) delete cache_store_; }\n\n  void SetStart(StateId s) {\n    cache_start_ = s;\n    has_start_ = true;\n    if (s >= nknown_states_) nknown_states_ = s + 1;\n  }\n\n  void SetFinal(StateId s, Weight weight) {\n    auto *state = cache_store_->GetMutableState(s);\n    state->SetFinal(std::move(weight));\n    static constexpr auto flags = kCacheFinal | kCacheRecent;\n    state->SetFlags(flags, flags);\n  }\n\n// Disabled to ensure PushArc not AddArc is used in existing code\n// TODO(sorenj): re-enable for backing store\n#if 0\n  // AddArc adds a single arc to a state and does incremental cache\n  // book-keeping. For efficiency, prefer PushArc and SetArcs below\n  // when possible.\n  void AddArc(StateId s, const Arc &arc) {\n    auto *state = cache_store_->GetMutableState(s);\n    cache_store_->AddArc(state, arc);\n    if (arc.nextstate >= nknown_states_)\n      nknown_states_ = arc.nextstate + 1;\n    SetExpandedState(s);\n    static constexpr auto flags = kCacheArcs | kCacheRecent;\n    state->SetFlags(flags, flags);\n  }\n#endif\n\n  // Adds a single arc to a state but delays cache book-keeping. SetArcs must\n  // be called when all PushArc calls at a state are complete. Do not mix with\n  // calls to AddArc.\n  void PushArc(StateId s, const Arc &arc) {\n    auto *state = cache_store_->GetMutableState(s);\n    state->PushArc(arc);\n  }\n\n  // Marks arcs of a state as cached and does cache book-keeping after all\n  // calls to PushArc have been completed. Do not mix with calls to AddArc.\n  void SetArcs(StateId s) {\n    auto *state = cache_store_->GetMutableState(s);\n    cache_store_->SetArcs(state);\n    const auto narcs = state->NumArcs();\n    for (size_t a = 0; a < narcs; ++a) {\n      const auto &arc = state->GetArc(a);\n      if (arc.nextstate >= nknown_states_) nknown_states_ = arc.nextstate + 1;\n    }\n    SetExpandedState(s);\n    static constexpr auto flags = kCacheArcs | kCacheRecent;\n    state->SetFlags(flags, flags);\n  }\n\n  void ReserveArcs(StateId s, size_t n) {\n    auto *state = cache_store_->GetMutableState(s);\n    state->ReserveArcs(n);\n  }\n\n  void DeleteArcs(StateId s) {\n    auto *state = cache_store_->GetMutableState(s);\n    cache_store_->DeleteArcs(state);\n  }\n\n  void DeleteArcs(StateId s, size_t n) {\n    auto *state = cache_store_->GetMutableState(s);\n    cache_store_->DeleteArcs(state, n);\n  }\n\n  void Clear() {\n    nknown_states_ = 0;\n    min_unexpanded_state_id_ = 0;\n    max_expanded_state_id_ = -1;\n    has_start_ = false;\n    cache_start_ = kNoStateId;\n    cache_store_->Clear();\n  }\n\n  // Is the start state cached?\n  bool HasStart() const {\n    if (!has_start_ && Properties(kError)) has_start_ = true;\n    return has_start_;\n  }\n\n  // Is the final weight of the state cached?\n  bool HasFinal(StateId s) const {\n    const auto *state = cache_store_->GetState(s);\n    if (state && state->Flags() & kCacheFinal) {\n      state->SetFlags(kCacheRecent, kCacheRecent);\n      return true;\n    } else {\n      return false;\n    }\n  }\n\n  // Are arcs of the state cached?\n  bool HasArcs(StateId s) const {\n    const auto *state = cache_store_->GetState(s);\n    if (state && state->Flags() & kCacheArcs) {\n      state->SetFlags(kCacheRecent, kCacheRecent);\n      return true;\n    } else {\n      return false;\n    }\n  }\n\n  StateId Start() const { return cache_start_; }\n\n  Weight Final(StateId s) const {\n    const auto *state = cache_store_->GetState(s);\n    return state->Final();\n  }\n\n  size_t NumArcs(StateId s) const {\n    const auto *state = cache_store_->GetState(s);\n    return state->NumArcs();\n  }\n\n  size_t NumInputEpsilons(StateId s) const {\n    const auto *state = cache_store_->GetState(s);\n    return state->NumInputEpsilons();\n  }\n\n  size_t NumOutputEpsilons(StateId s) const {\n    const auto *state = cache_store_->GetState(s);\n    return state->NumOutputEpsilons();\n  }\n\n  // Provides information needed for generic arc iterator.\n  void InitArcIterator(StateId s, ArcIteratorData<Arc> *data) const {\n    const auto *state = cache_store_->GetState(s);\n    data->base = nullptr;\n    data->narcs = state->NumArcs();\n    data->arcs = state->Arcs();\n    data->ref_count = state->MutableRefCount();\n    state->IncrRefCount();\n  }\n\n  // Number of known states.\n  StateId NumKnownStates() const { return nknown_states_; }\n\n  // Updates number of known states, taking into account the passed state ID.\n  void UpdateNumKnownStates(StateId s) {\n    if (s >= nknown_states_) nknown_states_ = s + 1;\n  }\n\n  // Finds the mininum never-expanded state ID.\n  StateId MinUnexpandedState() const {\n    while (min_unexpanded_state_id_ <= max_expanded_state_id_ &&\n           ExpandedState(min_unexpanded_state_id_)) {\n      ++min_unexpanded_state_id_;\n    }\n    return min_unexpanded_state_id_;\n  }\n\n  // Returns maximum ever-expanded state ID.\n  StateId MaxExpandedState() const { return max_expanded_state_id_; }\n\n  void SetExpandedState(StateId s) {\n    if (s > max_expanded_state_id_) max_expanded_state_id_ = s;\n    if (s < min_unexpanded_state_id_) return;\n    if (s == min_unexpanded_state_id_) ++min_unexpanded_state_id_;\n    if (cache_gc_ || cache_limit_ == 0) {\n      if (expanded_states_.size() <= s) expanded_states_.resize(s + 1, false);\n      expanded_states_[s] = true;\n    }\n  }\n\n  bool ExpandedState(StateId s) const {\n    if (cache_gc_ || cache_limit_ == 0) {\n      return expanded_states_[s];\n    } else if (new_cache_store_) {\n      return cache_store_->GetState(s) != nullptr;\n    } else {\n      // If the cache was not created by this class, then the cached state needs\n      // to be inspected to update nknown_states_.\n      return false;\n    }\n  }\n\n  const CacheStore *GetCacheStore() const { return cache_store_; }\n\n  CacheStore *GetCacheStore() { return cache_store_; }\n\n  // Caching on/off switch, limit and size accessors.\n\n  bool GetCacheGc() const { return cache_gc_; }\n\n  size_t GetCacheLimit() const { return cache_limit_; }\n\n private:\n  mutable bool has_start_;                   // Is the start state cached?\n  StateId cache_start_;                      // ID of start state.\n  StateId nknown_states_;                    // Number of known states.\n  std::vector<bool> expanded_states_;        // States that have been expanded.\n  mutable StateId min_unexpanded_state_id_;  // Minimum never-expanded state ID\n  mutable StateId max_expanded_state_id_;    // Maximum ever-expanded state ID\n  bool cache_gc_;                            // GC enabled.\n  size_t cache_limit_;       // Number of bytes allowed before GC.\n  CacheStore *cache_store_;  // The store of cached states.\n  bool new_cache_store_;     // Was the store was created by class?\n  bool own_cache_store_;     // Is the store owned by class?\n\n  CacheBaseImpl &operator=(const CacheBaseImpl &impl) = delete;\n};\n\n// A CacheBaseImpl with the default cache state type.\ntemplate <class Arc>\nclass CacheImpl : public CacheBaseImpl<CacheState<Arc>> {\n public:\n  using State = CacheState<Arc>;\n\n  CacheImpl() {}\n\n  explicit CacheImpl(const CacheOptions &opts)\n      : CacheBaseImpl<CacheState<Arc>>(opts) {}\n\n  CacheImpl(const CacheImpl<Arc> &impl, bool preserve_cache = false)\n      : CacheBaseImpl<State>(impl, preserve_cache) {}\n\n private:\n  CacheImpl &operator=(const CacheImpl &impl) = delete;\n};\n\n}  // namespace internal\n\n// Use this to make a state iterator for a CacheBaseImpl-derived FST, which must\n// have Arc and Store types defined. Note this iterator only returns those\n// states reachable from the initial state, so consider implementing a\n// class-specific one.\n//\n// This class may be derived from.\ntemplate <class FST>\nclass CacheStateIterator : public StateIteratorBase<typename FST::Arc> {\n public:\n  using Arc = typename FST::Arc;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using Store = typename FST::Store;\n  using State = typename Store::State;\n  using Impl = internal::CacheBaseImpl<State, Store>;\n\n  CacheStateIterator(const FST &fst, Impl *impl)\n      : fst_(fst), impl_(impl), s_(0) {\n    fst_.Start();  // Forces start state.\n  }\n\n  bool Done() const final {\n    if (s_ < impl_->NumKnownStates()) return false;\n    for (StateId u = impl_->MinUnexpandedState(); u < impl_->NumKnownStates();\n         u = impl_->MinUnexpandedState()) {\n      // Forces state expansion.\n      ArcIterator<FST> aiter(fst_, u);\n      aiter.SetFlags(kArcValueFlags, kArcValueFlags | kArcNoCache);\n      for (; !aiter.Done(); aiter.Next()) {\n        impl_->UpdateNumKnownStates(aiter.Value().nextstate);\n      }\n      impl_->SetExpandedState(u);\n      if (s_ < impl_->NumKnownStates()) return false;\n    }\n    return true;\n  }\n\n  StateId Value() const final { return s_; }\n\n  void Next() final { ++s_; }\n\n  void Reset() final { s_ = 0; }\n\n private:\n  const FST &fst_;\n  Impl *impl_;\n  StateId s_;\n};\n\n// Used to make an arc iterator for a CacheBaseImpl-derived FST, which must\n// have Arc and State types defined.\ntemplate <class FST>\nclass CacheArcIterator {\n public:\n  using Arc = typename FST::Arc;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using Store = typename FST::Store;\n  using State = typename Store::State;\n  using Impl = internal::CacheBaseImpl<State, Store>;\n\n  CacheArcIterator(Impl *impl, StateId s) : i_(0) {\n    state_ = impl->GetCacheStore()->GetMutableState(s);\n    state_->IncrRefCount();\n  }\n\n  ~CacheArcIterator() { state_->DecrRefCount(); }\n\n  bool Done() const { return i_ >= state_->NumArcs(); }\n\n  const Arc &Value() const { return state_->GetArc(i_); }\n\n  void Next() { ++i_; }\n\n  size_t Position() const { return i_; }\n\n  void Reset() { i_ = 0; }\n\n  void Seek(size_t a) { i_ = a; }\n\n  constexpr uint32 Flags() const { return kArcValueFlags; }\n\n  void SetFlags(uint32 flags, uint32 mask) {}\n\n private:\n  const State *state_;\n  size_t i_;\n\n  CacheArcIterator(const CacheArcIterator &) = delete;\n  CacheArcIterator &operator=(const CacheArcIterator &) = delete;\n};\n\n// Use this to make a mutable arc iterator for a CacheBaseImpl-derived FST,\n// which must have types Arc and Store defined.\ntemplate <class FST>\nclass CacheMutableArcIterator\n    : public MutableArcIteratorBase<typename FST::Arc> {\n public:\n  using Arc = typename FST::Arc;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using Store = typename FST::Store;\n  using State = typename Store::State;\n  using Impl = internal::CacheBaseImpl<State, Store>;\n\n  // User must call MutateCheck() in the constructor.\n  CacheMutableArcIterator(Impl *impl, StateId s) : i_(0), s_(s), impl_(impl) {\n    state_ = impl_->GetCacheStore()->GetMutableState(s_);\n    state_->IncrRefCount();\n  }\n\n  ~CacheMutableArcIterator() override { state_->DecrRefCount(); }\n\n  bool Done() const final { return i_ >= state_->NumArcs(); }\n\n  const Arc &Value() const final { return state_->GetArc(i_); }\n\n  void Next() final { ++i_; }\n\n  size_t Position() const final { return i_; }\n\n  void Reset() final { i_ = 0; }\n\n  void Seek(size_t a) final { i_ = a; }\n\n  void SetValue(const Arc &arc) final { state_->SetArc(arc, i_); }\n\n  uint32 Flags() const final { return kArcValueFlags; }\n\n  void SetFlags(uint32, uint32) final {}\n\n private:\n  size_t i_;\n  StateId s_;\n  Impl *impl_;\n  State *state_;\n\n  CacheMutableArcIterator(const CacheMutableArcIterator &) = delete;\n  CacheMutableArcIterator &operator=(const CacheMutableArcIterator &) = delete;\n};\n\n// Wrap existing CacheStore implementation to use with ExpanderFst.\ntemplate <class CacheStore>\nclass ExpanderCacheStore {\n public:\n  using State = typename CacheStore::State;\n  using Arc = typename CacheStore::Arc;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  explicit ExpanderCacheStore(const CacheOptions &opts = CacheOptions())\n      : store_(opts) {}\n\n  template <class Expander>\n  State *FindOrExpand(Expander &expander, StateId s) {  // NOLINT\n    auto *state = store_.GetMutableState(s);\n    if (state->Flags()) {\n      state->SetFlags(kCacheRecent, kCacheRecent);\n    } else {\n      StateBuilder builder(state);\n      expander.Expand(s, &builder);\n      state->SetFlags(kCacheFlags, kCacheFlags);\n      store_.SetArcs(state);\n    }\n    return state;\n  }\n\n private:\n  CacheStore store_;\n\n  struct StateBuilder {\n    State *state;\n\n    explicit StateBuilder(State *state_) : state(state_) {}\n\n    void AddArc(const Arc &arc) { state->PushArc(arc); }\n\n    void SetFinal(Weight weight) { state->SetFinal(std::move(weight)); }\n  };\n};\n\n}  // namespace fst\n\n#endif  // FST_CACHE_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/closure.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Functions and classes to compute the concatenative closure of an FST.\n\n#ifndef FST_CLOSURE_H_\n#define FST_CLOSURE_H_\n\n#include <algorithm>\n#include <vector>\n\n#include <fst/mutable-fst.h>\n#include <fst/rational.h>\n\n\nnamespace fst {\n\n// Computes the concatenative closure. This version modifies its\n// MutableFst input. If an FST transduces string x to y with weight a,\n// then its closure transduces x to y with weight a, xx to yy with\n// weight Times(a, a), xxx to yyy with with Times(Times(a, a), a),\n// etc. If closure_type == CLOSURE_STAR, then the empty string is\n// transduced to itself with weight Weight::One() as well.\n//\n// Complexity:\n//\n//   Time: O(V)\n//   Space: O(V)\n//\n// where V is the number of states.\ntemplate <class Arc>\nvoid Closure(MutableFst<Arc> *fst, ClosureType closure_type) {\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n  const auto props = fst->Properties(kFstProperties, false);\n  const auto start = fst->Start();\n  for (StateIterator<MutableFst<Arc>> siter(*fst); !siter.Done();\n       siter.Next()) {\n    const auto s = siter.Value();\n    const auto weight = fst->Final(s);\n    if (weight != Weight::Zero()) fst->AddArc(s, Arc(0, 0, weight, start));\n  }\n  if (closure_type == CLOSURE_STAR) {\n    fst->ReserveStates(fst->NumStates() + 1);\n    const auto nstart = fst->AddState();\n    fst->SetStart(nstart);\n    fst->SetFinal(nstart, Weight::One());\n    if (start != kNoLabel) fst->AddArc(nstart, Arc(0, 0, Weight::One(), start));\n  }\n  fst->SetProperties(ClosureProperties(props, closure_type == CLOSURE_STAR),\n                     kFstProperties);\n}\n\n// Computes the concatenative closure. This version modifies its\n// RationalFst input.\ntemplate <class Arc>\nvoid Closure(RationalFst<Arc> *fst, ClosureType closure_type) {\n  fst->GetMutableImpl()->AddClosure(closure_type);\n}\n\nstruct ClosureFstOptions : RationalFstOptions {\n  ClosureType type;\n\n  ClosureFstOptions(const RationalFstOptions &opts,\n                    ClosureType type = CLOSURE_STAR)\n      : RationalFstOptions(opts), type(type) {}\n\n  explicit ClosureFstOptions(ClosureType type = CLOSURE_STAR) : type(type) {}\n};\n\n// Computes the concatenative closure. This version is a delayed FST. If an FST\n// transduces string x to y with weight a, then its closure transduces x to y\n// with weight a, xx to yy with weight Times(a, a), xxx to yyy with weight\n// Times(Times(a, a), a), etc. If closure_type == CLOSURE_STAR, then the empty\n// string is transduced to itself with weight Weight::One() as well.\n//\n// Complexity:\n//\n//   Time: O(v)\n//   Space: O(v)\n//\n// where v is the number of states visited. Constant time and space to visit an\n// input state or arc is assumed and exclusive of caching.\ntemplate <class A>\nclass ClosureFst : public RationalFst<A> {\n public:\n  using Arc = A;\n\n  ClosureFst(const Fst<Arc> &fst, ClosureType closure_type) {\n    GetMutableImpl()->InitClosure(fst, closure_type);\n  }\n\n  ClosureFst(const Fst<Arc> &fst, const ClosureFstOptions &opts)\n      : RationalFst<A>(opts) {\n    GetMutableImpl()->InitClosure(fst, opts.type);\n  }\n\n  // See Fst<>::Copy() for doc.\n  ClosureFst(const ClosureFst<Arc> &fst, bool safe = false)\n      : RationalFst<A>(fst, safe) {}\n\n  // Gets a copy of this ClosureFst. See Fst<>::Copy() for further doc.\n  ClosureFst<A> *Copy(bool safe = false) const override {\n    return new ClosureFst<A>(*this, safe);\n  }\n\n private:\n  using ImplToFst<internal::RationalFstImpl<Arc>>::GetImpl;\n  using ImplToFst<internal::RationalFstImpl<Arc>>::GetMutableImpl;\n};\n\n// Specialization for ClosureFst.\ntemplate <class Arc>\nclass StateIterator<ClosureFst<Arc>> : public StateIterator<RationalFst<Arc>> {\n public:\n  explicit StateIterator(const ClosureFst<Arc> &fst)\n      : StateIterator<RationalFst<Arc>>(fst) {}\n};\n\n// Specialization for ClosureFst.\ntemplate <class Arc>\nclass ArcIterator<ClosureFst<Arc>> : public ArcIterator<RationalFst<Arc>> {\n public:\n  using StateId = typename Arc::StateId;\n\n  ArcIterator(const ClosureFst<Arc> &fst, StateId s)\n      : ArcIterator<RationalFst<Arc>>(fst, s) {}\n};\n\n// Useful alias when using StdArc.\nusing StdClosureFst = ClosureFst<StdArc>;\n\n}  // namespace fst\n\n#endif  // FST_CLOSURE_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/compact-fst.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// FST Class for memory-efficient representation of common types of\n// FSTs: linear automata, acceptors, unweighted FSTs, ...\n\n#ifndef FST_COMPACT_FST_H_\n#define FST_COMPACT_FST_H_\n\n#include <climits>\n#include <iterator>\n#include <memory>\n#include <tuple>\n#include <utility>\n#include <vector>\n\n#include <fst/log.h>\n\n#include <fst/cache.h>\n#include <fst/expanded-fst.h>\n#include <fst/fst-decl.h>  // For optional argument declarations\n#include <fst/mapped-file.h>\n#include <fst/matcher.h>\n#include <fst/test-properties.h>\n#include <fst/util.h>\n\n\nnamespace fst {\n\nstruct CompactFstOptions : public CacheOptions {\n  // The default caching behaviour is to do no caching. Most compactors are\n  // cheap and therefore we save memory by not doing caching.\n  CompactFstOptions() : CacheOptions(true, 0) {}\n\n  explicit CompactFstOptions(const CacheOptions &opts) : CacheOptions(opts) {}\n};\n\n// New upcoming (Fst) Compactor interface - currently used internally\n// by CompactFstImpl.\n//\n// class Compactor {\n//  public:\n//   // Constructor from the Fst to be compacted.\n//   Compactor(const Fst<Arc> &fst, ...);\n//   // Copy constructor\n//   Compactor(const Compactor &compactor, bool safe = false)\n//   // Default constructor (optional, see comment below).\n//   Compactor();\n//\n//   // Returns the start state, number of states, and total number of arcs\n//   // of the compacted Fst\n//   StateId Start() const;\n//   StateId NumStates() const;\n//   size_t NumArcs() const;\n//\n//   // Accessor class for state attributes.\n//   class State {\n//    public:\n//     State();  // Required, corresponds to kNoStateId.\n//     State(const Compactor *c, StateId);  // Accessor for StateId 's'.\n//     StateId GetStateId() const;\n//     Weight Final() const;\n//     size_t NumArcs() const;\n//     Arc GetArc(size_t i) const;\n//   };\n//\n//   // Modifies 'state' accessor to provide access to state id 's'.\n//   void SetState(StateId s, State *state);\n//   // Tests whether 'fst' can be compacted by this compactor.\n//   bool IsCompatible(const Fst<A> &fst) const;\n//   // Return the properties that are always true for an fst\n//   // compacted using this compactor\n//   uint64 Properties() const;\n//   // Return a string identifying the type of compactor.\n//   static const string &Type();\n//   // Return true if an error has occured.\n//   bool Error() const;\n//   // Writes a compactor to a file.\n//   bool Write(std::ostream &strm, const FstWriteOptions &opts) const;\n//   // Reads a compactor from a file.\n//   static Compactor*Read(std::istream &strm, const FstReadOptions &opts,\n//                         const FstHeader &hdr);\n// };\n//\n\n// Old (Arc) Compactor Interface:\n//\n// The ArcCompactor class determines how arcs and final weights are compacted\n// and expanded.\n//\n// Final weights are treated as transitions to the superfinal state, i.e.,\n// ilabel = olabel = kNoLabel and nextstate = kNoStateId.\n//\n// There are two types of compactors:\n//\n// * Fixed out-degree compactors: 'compactor.Size()' returns a positive integer\n//   's'. An FST can be compacted by this compactor only if each state has\n//   exactly 's' outgoing transitions (counting a non-Zero() final weight as a\n//   transition). A typical example is a compactor for string FSTs, i.e.,\n//   's == 1'.\n//\n// * Variable out-degree compactors: 'compactor.Size() == -1'. There are no\n//   out-degree restrictions for these compactors.\n//\n// Interface:\n//\n// class ArcCompactor {\n//  public:\n//   // Element is the type of the compacted transitions.\n//   using Element = ...\n//\n//   // Returns the compacted representation of a transition 'arc'\n//   // at a state 's'.\n//   Element Compact(StateId s, const Arc &arc);\n//\n//   // Returns the transition at state 's' represented by the compacted\n//   // transition 'e'.\n//   Arc Expand(StateId s, const Element &e) const;\n//\n//   // Returns -1 for variable out-degree compactors, and the mandatory\n//   // out-degree otherwise.\n//   ssize_t Size() const;\n//\n//   // Tests whether an FST can be compacted by this compactor.\n//   bool Compatible(const Fst<A> &fst) const;\n//\n//   // Returns the properties that are always true for an FST compacted using\n//   // this compactor\n//   uint64 Properties() const;\n//\n//   // Returns a string identifying the type of compactor.\n//   static const string &Type();\n//\n//   // Writes a compactor to a file.\n//   bool Write(std::ostream &strm) const;\n//\n//   // Reads a compactor from a file.\n//   static ArcCompactor *Read(std::istream &strm);\n//\n//   // Default constructor (optional, see comment below).\n//   ArcCompactor();\n// };\n//\n// The default constructor is only required for FST_REGISTER to work (i.e.,\n// enabling Convert() and the command-line utilities to work with this new\n// compactor). However, a default constructor always needs to be specified for\n// this code to compile, but one can have it simply raise an error when called,\n// like so:\n//\n// Compactor::Compactor() {\n//   FSTERROR() << \"Compactor: No default constructor\";\n// }\n\n// Default implementation data for CompactFst, which can shared between\n// otherwise independent copies.\n//\n// The implementation contains two arrays: 'states_' and 'compacts_'.\n//\n// For fixed out-degree compactors, the 'states_' array is unallocated. The\n// 'compacts_' contains the compacted transitions. Its size is 'ncompacts_'.\n// The outgoing transitions at a given state are stored consecutively. For a\n// given state 's', its 'compactor.Size()' outgoing transitions (including\n// superfinal transition when 's' is final), are stored in position\n// ['s*compactor.Size()', '(s+1)*compactor.Size()').\n//\n// For variable out-degree compactors, the states_ array has size\n// 'nstates_ + 1' and contains pointers to positions into 'compacts_'. For a\n// given state 's', the compacted transitions of 's' are stored in positions\n// ['states_[s]', 'states_[s + 1]') in 'compacts_'. By convention,\n// 'states_[nstates_] == ncompacts_'.\n//\n// In both cases, the superfinal transitions (when 's' is final, i.e.,\n// 'Final(s) != Weight::Zero()') are stored first.\n//\n// The unsigned type U is used to represent indices into the compacts_ array.\ntemplate <class Element, class Unsigned>\nclass DefaultCompactStore {\n public:\n  DefaultCompactStore()\n      : states_(nullptr),\n        compacts_(nullptr),\n        nstates_(0),\n        ncompacts_(0),\n        narcs_(0),\n        start_(kNoStateId),\n        error_(false) {}\n\n  template <class Arc, class Compactor>\n  DefaultCompactStore(const Fst<Arc> &fst, const Compactor &compactor);\n\n  template <class Iterator, class Compactor>\n  DefaultCompactStore(const Iterator &begin, const Iterator &end,\n                      const Compactor &compactor);\n\n  ~DefaultCompactStore() {\n    if (!states_region_) delete[] states_;\n    if (!compacts_region_) delete[] compacts_;\n  }\n\n  template <class Compactor>\n  static DefaultCompactStore<Element, Unsigned> *Read(\n      std::istream &strm, const FstReadOptions &opts, const FstHeader &hdr,\n      const Compactor &compactor);\n\n  bool Write(std::ostream &strm, const FstWriteOptions &opts) const;\n\n  Unsigned States(ssize_t i) const { return states_[i]; }\n\n  const Element &Compacts(size_t i) const { return compacts_[i]; }\n\n  size_t NumStates() const { return nstates_; }\n\n  size_t NumCompacts() const { return ncompacts_; }\n\n  size_t NumArcs() const { return narcs_; }\n\n  ssize_t Start() const { return start_; }\n\n  bool Error() const { return error_; }\n\n  // Returns a string identifying the type of data storage container.\n  static const string &Type();\n\n private:\n  std::unique_ptr<MappedFile> states_region_;\n  std::unique_ptr<MappedFile> compacts_region_;\n  Unsigned *states_;\n  Element *compacts_;\n  size_t nstates_;\n  size_t ncompacts_;\n  size_t narcs_;\n  ssize_t start_;\n  bool error_;\n};\n\ntemplate <class Element, class Unsigned>\ntemplate <class Arc, class Compactor>\nDefaultCompactStore<Element, Unsigned>::DefaultCompactStore(\n    const Fst<Arc> &fst, const Compactor &compactor)\n    : states_(nullptr),\n      compacts_(nullptr),\n      nstates_(0),\n      ncompacts_(0),\n      narcs_(0),\n      start_(kNoStateId),\n      error_(false) {\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n  start_ = fst.Start();\n  // Counts # of states and arcs.\n  StateId nfinals = 0;\n  for (StateIterator<Fst<Arc>> siter(fst); !siter.Done(); siter.Next()) {\n    ++nstates_;\n    const auto s = siter.Value();\n    for (ArcIterator<Fst<Arc>> aiter(fst, s); !aiter.Done(); aiter.Next()) {\n      ++narcs_;\n    }\n    if (fst.Final(s) != Weight::Zero()) ++nfinals;\n  }\n  if (compactor.Size() == -1) {\n    states_ = new Unsigned[nstates_ + 1];\n    ncompacts_ = narcs_ + nfinals;\n    compacts_ = new Element[ncompacts_];\n    states_[nstates_] = ncompacts_;\n  } else {\n    states_ = nullptr;\n    ncompacts_ = nstates_ * compactor.Size();\n    if ((narcs_ + nfinals) != ncompacts_) {\n      FSTERROR() << \"DefaultCompactStore: Compactor incompatible with FST\";\n      error_ = true;\n      return;\n    }\n    compacts_ = new Element[ncompacts_];\n  }\n  size_t pos = 0;\n  size_t fpos = 0;\n  for (size_t s = 0; s < nstates_; ++s) {\n    fpos = pos;\n    if (compactor.Size() == -1) states_[s] = pos;\n    if (fst.Final(s) != Weight::Zero()) {\n      compacts_[pos++] = compactor.Compact(\n          s, Arc(kNoLabel, kNoLabel, fst.Final(s), kNoStateId));\n    }\n    for (ArcIterator<Fst<Arc>> aiter(fst, s); !aiter.Done(); aiter.Next()) {\n      compacts_[pos++] = compactor.Compact(s, aiter.Value());\n    }\n    if ((compactor.Size() != -1) && ((pos - fpos) != compactor.Size())) {\n      FSTERROR() << \"DefaultCompactStore: Compactor incompatible with FST\";\n      error_ = true;\n      return;\n    }\n  }\n  if (pos != ncompacts_) {\n    FSTERROR() << \"DefaultCompactStore: Compactor incompatible with FST\";\n    error_ = true;\n    return;\n  }\n}\n\ntemplate <class Element, class Unsigned>\ntemplate <class Iterator, class Compactor>\nDefaultCompactStore<Element, Unsigned>::DefaultCompactStore(\n    const Iterator &begin, const Iterator &end, const Compactor &compactor)\n    : states_(nullptr),\n      compacts_(nullptr),\n      nstates_(0),\n      ncompacts_(0),\n      narcs_(0),\n      start_(kNoStateId),\n      error_(false) {\n  using Arc = typename Compactor::Arc;\n  using Weight = typename Arc::Weight;\n  if (compactor.Size() != -1) {\n    ncompacts_ = std::distance(begin, end);\n    if (compactor.Size() == 1) {\n      // For strings, allows implicit final weight. Empty input is the empty\n      // string.\n      if (ncompacts_ == 0) {\n        ++ncompacts_;\n      } else {\n        const auto arc =\n            compactor.Expand(ncompacts_ - 1, *(begin + (ncompacts_ - 1)));\n        if (arc.ilabel != kNoLabel) ++ncompacts_;\n      }\n    }\n    if (ncompacts_ % compactor.Size()) {\n      FSTERROR() << \"DefaultCompactStore: Size of input container incompatible\"\n                 << \" with compactor\";\n      error_ = true;\n      return;\n    }\n    if (ncompacts_ == 0) return;\n    start_ = 0;\n    nstates_ = ncompacts_ / compactor.Size();\n    compacts_ = new Element[ncompacts_];\n    size_t i = 0;\n    Iterator it = begin;\n    for (; it != end; ++it, ++i) {\n      compacts_[i] = *it;\n      if (compactor.Expand(i, *it).ilabel != kNoLabel) ++narcs_;\n    }\n    if (i < ncompacts_) {\n      compacts_[i] = compactor.Compact(\n          i, Arc(kNoLabel, kNoLabel, Weight::One(), kNoStateId));\n    }\n  } else {\n    if (std::distance(begin, end) == 0) return;\n    // Count # of states, arcs and compacts.\n    auto it = begin;\n    for (size_t i = 0; it != end; ++it, ++i) {\n      const auto arc = compactor.Expand(i, *it);\n      if (arc.ilabel != kNoLabel) {\n        ++narcs_;\n        ++ncompacts_;\n      } else {\n        ++nstates_;\n        if (arc.weight != Weight::Zero()) ++ncompacts_;\n      }\n    }\n    start_ = 0;\n    compacts_ = new Element[ncompacts_];\n    states_ = new Unsigned[nstates_ + 1];\n    states_[nstates_] = ncompacts_;\n    size_t i = 0;\n    size_t s = 0;\n    for (it = begin; it != end; ++it) {\n      const auto arc = compactor.Expand(i, *it);\n      if (arc.ilabel != kNoLabel) {\n        compacts_[i++] = *it;\n      } else {\n        states_[s++] = i;\n        if (arc.weight != Weight::Zero()) compacts_[i++] = *it;\n      }\n    }\n    if ((s != nstates_) || (i != ncompacts_)) {\n      FSTERROR() << \"DefaultCompactStore: Ill-formed input container\";\n      error_ = true;\n      return;\n    }\n  }\n}\n\ntemplate <class Element, class Unsigned>\ntemplate <class Compactor>\nDefaultCompactStore<Element, Unsigned>\n    *DefaultCompactStore<Element, Unsigned>::Read(std::istream &strm,\n                                                  const FstReadOptions &opts,\n                                                  const FstHeader &hdr,\n                                                  const Compactor &compactor) {\n  std::unique_ptr<DefaultCompactStore<Element, Unsigned>> data(\n      new DefaultCompactStore<Element, Unsigned>());\n  data->start_ = hdr.Start();\n  data->nstates_ = hdr.NumStates();\n  data->narcs_ = hdr.NumArcs();\n  if (compactor.Size() == -1) {\n    if ((hdr.GetFlags() & FstHeader::IS_ALIGNED) && !AlignInput(strm)) {\n      LOG(ERROR) << \"DefaultCompactStore::Read: Alignment failed: \"\n                 << opts.source;\n      return nullptr;\n    }\n    auto b = (data->nstates_ + 1) * sizeof(Unsigned);\n    data->states_region_.reset(MappedFile::Map(\n        &strm, opts.mode == FstReadOptions::MAP, opts.source, b));\n    if (!strm || !data->states_region_) {\n      LOG(ERROR) << \"DefaultCompactStore::Read: Read failed: \" << opts.source;\n      return nullptr;\n    }\n    data->states_ =\n        static_cast<Unsigned *>(data->states_region_->mutable_data());\n  } else {\n    data->states_ = nullptr;\n  }\n  data->ncompacts_ = compactor.Size() == -1 ? data->states_[data->nstates_]\n                                            : data->nstates_ * compactor.Size();\n  if ((hdr.GetFlags() & FstHeader::IS_ALIGNED) && !AlignInput(strm)) {\n    LOG(ERROR) << \"DefaultCompactStore::Read: Alignment failed: \"\n               << opts.source;\n    return nullptr;\n  }\n  size_t b = data->ncompacts_ * sizeof(Element);\n  data->compacts_region_.reset(\n      MappedFile::Map(&strm, opts.mode == FstReadOptions::MAP, opts.source, b));\n  if (!strm || !data->compacts_region_) {\n    LOG(ERROR) << \"DefaultCompactStore::Read: Read failed: \" << opts.source;\n    return nullptr;\n  }\n  data->compacts_ =\n      static_cast<Element *>(data->compacts_region_->mutable_data());\n  return data.release();\n}\n\ntemplate <class Element, class Unsigned>\nbool DefaultCompactStore<Element, Unsigned>::Write(\n    std::ostream &strm, const FstWriteOptions &opts) const {\n  if (states_) {\n    if (opts.align && !AlignOutput(strm)) {\n      LOG(ERROR) << \"DefaultCompactStore::Write: Alignment failed: \"\n                 << opts.source;\n      return false;\n    }\n    strm.write(reinterpret_cast<char *>(states_),\n               (nstates_ + 1) * sizeof(Unsigned));\n  }\n  if (opts.align && !AlignOutput(strm)) {\n    LOG(ERROR) << \"DefaultCompactStore::Write: Alignment failed: \"\n               << opts.source;\n    return false;\n  }\n  strm.write(reinterpret_cast<char *>(compacts_), ncompacts_ * sizeof(Element));\n  strm.flush();\n  if (!strm) {\n    LOG(ERROR) << \"DefaultCompactStore::Write: Write failed: \" << opts.source;\n    return false;\n  }\n  return true;\n}\n\ntemplate <class Element, class Unsigned>\nconst string &DefaultCompactStore<Element, Unsigned>::Type() {\n  static const string *const type = new string(\"compact\");\n  return *type;\n}\n\ntemplate <class C, class U, class S> class DefaultCompactState;\n\n// Wraps an arc compactor and a compact store as a new Fst compactor.\ntemplate <class C, class U,\n          class S = DefaultCompactStore<typename C::Element, U>>\nclass DefaultCompactor {\n public:\n  using ArcCompactor = C;\n  using Unsigned = U;\n  using CompactStore = S;\n  using Element = typename C::Element;\n  using Arc = typename C::Arc;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n  using State = DefaultCompactState<C, U, S>;\n  friend State;\n\n  DefaultCompactor()\n      : arc_compactor_(nullptr), compact_store_(nullptr) {}\n\n  // Constructs from Fst.\n  DefaultCompactor(const Fst<Arc> &fst,\n                   std::shared_ptr<ArcCompactor> arc_compactor)\n      : arc_compactor_(std::move(arc_compactor)),\n        compact_store_(std::make_shared<S>(fst, *arc_compactor_)) {}\n\n  DefaultCompactor(const Fst<Arc> &fst,\n                   std::shared_ptr<DefaultCompactor<C, U, S>> compactor)\n      : arc_compactor_(compactor->arc_compactor_),\n        compact_store_(compactor->compact_store_ == nullptr ?\n                       std::make_shared<S>(fst, *arc_compactor_) :\n                       compactor->compact_store_) {}\n\n  // Constructs from CompactStore.\n  DefaultCompactor(std::shared_ptr<ArcCompactor> arc_compactor,\n                   std::shared_ptr<CompactStore> compact_store)\n      : arc_compactor_(std::move(arc_compactor)),\n        compact_store_(std::move(compact_store)) {}\n\n  // Constructs from set of compact elements (when arc_compactor.Size() != -1).\n  template <class Iterator>\n  DefaultCompactor(const Iterator &b, const Iterator &e,\n                   std::shared_ptr<C> arc_compactor)\n      : arc_compactor_(std::move(arc_compactor)),\n        compact_store_(std::make_shared<S>(b, e, *arc_compactor_)) {}\n\n  // Copy constructor.\n  DefaultCompactor(const DefaultCompactor<C, U, S> &compactor)\n      : arc_compactor_(std::make_shared<C>(*compactor.GetArcCompactor())),\n        compact_store_(compactor.SharedCompactStore()) {}\n\n  template <class OtherC>\n  explicit DefaultCompactor(const DefaultCompactor<OtherC, U, S> &compactor)\n      : arc_compactor_(std::make_shared<C>(*compactor.GetArcCompactor())),\n        compact_store_(compactor.SharedCompactStore()) {}\n\n  StateId Start() const { return compact_store_->Start(); }\n  StateId NumStates() const { return compact_store_->NumStates(); }\n  size_t NumArcs() const { return compact_store_->NumArcs(); }\n\n  void SetState(StateId s, State *state) const {\n    if (state->GetStateId() != s) state->Set(this, s);\n  }\n\n  static DefaultCompactor<C, U, S> *Read(std::istream &strm,\n                                         const FstReadOptions &opts,\n                                         const FstHeader &hdr) {\n    std::shared_ptr<C> arc_compactor(C::Read(strm));\n    if (arc_compactor == nullptr) return nullptr;\n    std::shared_ptr<S> compact_store(S::Read(strm, opts, hdr, *arc_compactor));\n    if (compact_store == nullptr) return nullptr;\n    return new DefaultCompactor<C, U, S>(arc_compactor, compact_store);\n  }\n\n  bool Write(std::ostream &strm, const FstWriteOptions &opts) const {\n    return arc_compactor_->Write(strm) && compact_store_->Write(strm, opts);\n  }\n\n  uint64 Properties() const { return arc_compactor_->Properties(); }\n\n  bool IsCompatible(const Fst<Arc> &fst) const {\n    return arc_compactor_->Compatible(fst);\n  }\n\n  bool Error() const { return compact_store_->Error(); }\n\n  bool HasFixedOutdegree() const { return arc_compactor_->Size() != -1; }\n\n  static const string &Type() {\n    static const string *const type = [] {\n      string type = \"compact\";\n      if (sizeof(U) != sizeof(uint32)) type += std::to_string(8 * sizeof(U));\n      type += \"_\";\n      type += C::Type();\n      if (CompactStore::Type() != \"compact\") {\n        type += \"_\";\n        type += CompactStore::Type();\n      }\n      return new string(type);\n    }();\n    return *type;\n  }\n\n  const ArcCompactor *GetArcCompactor() const { return arc_compactor_.get(); }\n  CompactStore *GetCompactStore() const { return compact_store_.get(); }\n\n  std::shared_ptr<ArcCompactor> SharedArcCompactor() const {\n    return arc_compactor_;\n  }\n\n  std::shared_ptr<CompactStore> SharedCompactStore() const {\n    return compact_store_;\n  }\n\n  // TODO(allauzen): remove dependencies on this method and make private.\n  Arc ComputeArc(StateId s, Unsigned i, uint32 f) const {\n    return arc_compactor_->Expand(s, compact_store_->Compacts(i), f);\n  }\n\n private:\n  std::pair<Unsigned, Unsigned> CompactsRange(StateId s) const {\n    std::pair<size_t, size_t> range;\n    if (HasFixedOutdegree()) {\n      range.first = s * arc_compactor_->Size();\n      range.second = arc_compactor_->Size();\n    } else {\n      range.first = compact_store_->States(s);\n      range.second = compact_store_->States(s + 1) - range.first;\n    }\n    return range;\n  }\n\n private:\n  std::shared_ptr<ArcCompactor> arc_compactor_;\n  std::shared_ptr<CompactStore> compact_store_;\n};\n\n// Default implementation of state attributes accessor class for\n// DefaultCompactor. Use of efficient specialization strongly encouraged.\ntemplate <class C, class U, class S>\nclass DefaultCompactState {\n public:\n  using Arc = typename C::Arc;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  DefaultCompactState() = default;\n\n  DefaultCompactState(const DefaultCompactor<C, U, S> *compactor, StateId s)\n      : compactor_(compactor),\n        s_(s),\n        range_(compactor->CompactsRange(s)),\n        has_final_(\n            range_.second != 0 &&\n            compactor->ComputeArc(s, range_.first,\n                                 kArcILabelValue).ilabel == kNoLabel) {\n    if (has_final_) {\n      ++range_.first;\n      --range_.second;\n    }\n  }\n\n  void Set(const DefaultCompactor<C, U, S> *compactor, StateId s) {\n    compactor_ = compactor;\n    s_ = s;\n    range_ = compactor->CompactsRange(s);\n    if (range_.second != 0 &&\n        compactor->ComputeArc(s, range_.first, kArcILabelValue).ilabel\n        == kNoLabel) {\n      has_final_ = true;\n      ++range_.first;\n      --range_.second;\n    } else {\n      has_final_ = false;\n    }\n  }\n\n  StateId GetStateId() const { return s_; }\n\n  Weight Final() const {\n    if (!has_final_) return Weight::Zero();\n    return compactor_->ComputeArc(s_, range_.first - 1, kArcWeightValue).weight;\n  }\n\n  size_t NumArcs() const { return range_.second; }\n\n  Arc GetArc(size_t i, uint32 f) const {\n    return compactor_->ComputeArc(s_, range_.first + i, f);\n  }\n\n private:\n  const DefaultCompactor<C, U, S> *compactor_ = nullptr;  // borrowed ref.\n  StateId s_ = kNoStateId;\n  std::pair<U, U> range_ = {0, 0};\n  bool has_final_ = false;\n};\n\n// Specialization for DefaultCompactStore.\ntemplate <class C, class U>\nclass DefaultCompactState<C, U, DefaultCompactStore<typename C::Element, U>> {\n public:\n  using Arc = typename C::Arc;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n  using CompactStore = DefaultCompactStore<typename C::Element, U>;\n\n  DefaultCompactState() = default;\n\n  DefaultCompactState(\n      const DefaultCompactor<C, U, CompactStore> *compactor, StateId s)\n      : arc_compactor_(compactor->GetArcCompactor()), s_(s) {\n    Init(compactor);\n  }\n\n  void Set(const DefaultCompactor<C, U, CompactStore> *compactor, StateId s) {\n    arc_compactor_ = compactor->GetArcCompactor();\n    s_ = s;\n    has_final_ = false;\n    Init(compactor);\n  }\n\n  StateId GetStateId() const { return s_; }\n\n  Weight Final() const {\n    if (!has_final_) return Weight::Zero();\n    return arc_compactor_->Expand(s_, *(compacts_ - 1), kArcWeightValue).weight;\n  }\n\n  size_t NumArcs() const { return num_arcs_; }\n\n  Arc GetArc(size_t i, uint32 f) const {\n    return arc_compactor_->Expand(s_, compacts_[i], f);\n  }\n\n private:\n  void Init(const DefaultCompactor<C, U, CompactStore> *compactor) {\n    const auto *store = compactor->GetCompactStore();\n    U offset;\n    if (!compactor->HasFixedOutdegree()) {  // Variable out-degree compactor.\n      offset = store->States(s_);\n      num_arcs_ = store->States(s_ + 1) - offset;\n    } else {  // Fixed out-degree compactor.\n      offset = s_ * arc_compactor_->Size();\n      num_arcs_ = arc_compactor_->Size();\n    }\n    if (num_arcs_ > 0) {\n      compacts_ = &(store->Compacts(offset));\n      if (arc_compactor_->Expand(s_, *compacts_, kArcILabelValue).ilabel\n          == kNoStateId) {\n        ++compacts_;\n        --num_arcs_;\n        has_final_ = true;\n      }\n    }\n  }\n\n private:\n  const C *arc_compactor_ = nullptr;               // Borrowed reference.\n  const typename C::Element *compacts_ = nullptr;  // Borrowed reference.\n  StateId s_ = kNoStateId;\n  U num_arcs_ = 0;\n  bool has_final_ = false;\n};\n\ntemplate <class Arc, class ArcCompactor, class Unsigned, class CompactStore,\n          class CacheStore>\nclass CompactFst;\n\ntemplate <class F, class G>\nvoid Cast(const F &, G *);\n\nnamespace internal {\n\n// Implementation class for CompactFst, which contains parametrizeable\n// Fst data storage (DefaultCompactStore by default) and Fst cache.\ntemplate <class Arc, class C, class CacheStore = DefaultCacheStore<Arc>>\nclass CompactFstImpl\n    : public CacheBaseImpl<typename CacheStore::State, CacheStore> {\n public:\n  using Weight = typename Arc::Weight;\n  using StateId = typename Arc::StateId;\n  using Compactor = C;\n\n  using FstImpl<Arc>::SetType;\n  using FstImpl<Arc>::SetProperties;\n  using FstImpl<Arc>::Properties;\n  using FstImpl<Arc>::SetInputSymbols;\n  using FstImpl<Arc>::SetOutputSymbols;\n  using FstImpl<Arc>::WriteHeader;\n\n  using ImplBase = CacheBaseImpl<typename CacheStore::State, CacheStore>;\n  using ImplBase::PushArc;\n  using ImplBase::HasArcs;\n  using ImplBase::HasFinal;\n  using ImplBase::HasStart;\n  using ImplBase::SetArcs;\n  using ImplBase::SetFinal;\n  using ImplBase::SetStart;\n\n  CompactFstImpl()\n      : ImplBase(CompactFstOptions()),\n        compactor_() {\n    SetType(Compactor::Type());\n    SetProperties(kNullProperties | kStaticProperties);\n  }\n\n  CompactFstImpl(const Fst<Arc> &fst, std::shared_ptr<Compactor> compactor,\n                 const CompactFstOptions &opts)\n      : ImplBase(opts),\n        compactor_(std::make_shared<Compactor>(fst, compactor)) {\n    SetType(Compactor::Type());\n    SetInputSymbols(fst.InputSymbols());\n    SetOutputSymbols(fst.OutputSymbols());\n    if (compactor_->Error()) SetProperties(kError, kError);\n    uint64 copy_properties = fst.Properties(kMutable, false) ?\n        fst.Properties(kCopyProperties, true):\n        CheckProperties(fst,\n                        kCopyProperties & ~kWeightedCycles & ~kUnweightedCycles,\n                        kCopyProperties);\n    if ((copy_properties & kError) || !compactor_->IsCompatible(fst)) {\n      FSTERROR() << \"CompactFstImpl: Input Fst incompatible with compactor\";\n      SetProperties(kError, kError);\n      return;\n    }\n    SetProperties(copy_properties | kStaticProperties);\n  }\n\n  CompactFstImpl(std::shared_ptr<Compactor> compactor,\n                 const CompactFstOptions &opts)\n      : ImplBase(opts),\n        compactor_(compactor) {\n    SetType(Compactor::Type());\n    SetProperties(kStaticProperties | compactor_->Properties());\n    if (compactor_->Error()) SetProperties(kError, kError);\n  }\n\n  CompactFstImpl(const CompactFstImpl<Arc, Compactor, CacheStore> &impl)\n      : ImplBase(impl),\n        compactor_(impl.compactor_ == nullptr ?\n                   std::make_shared<Compactor>() :\n                   std::make_shared<Compactor>(*impl.compactor_)) {\n    SetType(impl.Type());\n    SetProperties(impl.Properties());\n    SetInputSymbols(impl.InputSymbols());\n    SetOutputSymbols(impl.OutputSymbols());\n  }\n\n  // Allows to change the cache store from OtherI to I.\n  template <class OtherCacheStore>\n  CompactFstImpl(const CompactFstImpl<Arc, Compactor, OtherCacheStore> &impl)\n      : ImplBase(CacheOptions(impl.GetCacheGc(), impl.GetCacheLimit())),\n        compactor_(impl.compactor_ == nullptr ?\n                   std::make_shared<Compactor>() :\n                   std::make_shared<Compactor>(*impl.compactor_)) {\n    SetType(impl.Type());\n    SetProperties(impl.Properties());\n    SetInputSymbols(impl.InputSymbols());\n    SetOutputSymbols(impl.OutputSymbols());\n  }\n\n  StateId Start() {\n    if (!HasStart()) SetStart(compactor_->Start());\n    return ImplBase::Start();\n  }\n\n  Weight Final(StateId s) {\n    if (HasFinal(s)) return ImplBase::Final(s);\n    compactor_->SetState(s, &state_);\n    return state_.Final();\n  }\n\n  StateId NumStates() const {\n    if (Properties(kError)) return 0;\n    return compactor_->NumStates();\n  }\n\n  size_t NumArcs(StateId s) {\n    if (HasArcs(s)) return ImplBase::NumArcs(s);\n    compactor_->SetState(s, &state_);\n    return state_.NumArcs();\n  }\n\n  size_t NumInputEpsilons(StateId s) {\n    if (!HasArcs(s) && !Properties(kILabelSorted)) Expand(s);\n    if (HasArcs(s)) return ImplBase::NumInputEpsilons(s);\n    return CountEpsilons(s, false);\n  }\n\n  size_t NumOutputEpsilons(StateId s) {\n    if (!HasArcs(s) && !Properties(kOLabelSorted)) Expand(s);\n    if (HasArcs(s)) return ImplBase::NumOutputEpsilons(s);\n    return CountEpsilons(s, true);\n  }\n\n  size_t CountEpsilons(StateId s, bool output_epsilons) {\n    compactor_->SetState(s, &state_);\n    const uint32 f = output_epsilons ? kArcOLabelValue : kArcILabelValue;\n    size_t num_eps = 0;\n    for (size_t i = 0; i < state_.NumArcs(); ++i) {\n      const auto& arc = state_.GetArc(i, f);\n      const auto label = output_epsilons ? arc.olabel : arc.ilabel;\n      if (label == 0)\n        ++num_eps;\n      else if (label > 0)\n        break;\n    }\n    return num_eps;\n  }\n\n  static CompactFstImpl<Arc, Compactor, CacheStore> *Read(\n      std::istream &strm, const FstReadOptions &opts) {\n    std::unique_ptr<CompactFstImpl<Arc, Compactor, CacheStore>> impl(\n      new CompactFstImpl<Arc, Compactor, CacheStore>());\n    FstHeader hdr;\n    if (!impl->ReadHeader(strm, opts, kMinFileVersion, &hdr)) {\n      return nullptr;\n    }\n    // Ensures compatibility.\n    if (hdr.Version() == kAlignedFileVersion) {\n      hdr.SetFlags(hdr.GetFlags() | FstHeader::IS_ALIGNED);\n    }\n    impl->compactor_ = std::shared_ptr<Compactor>(\n        Compactor::Read(strm, opts, hdr));\n    if (!impl->compactor_) {\n      return nullptr;\n    }\n    return impl.release();\n  }\n\n  bool Write(std::ostream &strm, const FstWriteOptions &opts) const {\n    FstHeader hdr;\n    hdr.SetStart(compactor_->Start());\n    hdr.SetNumStates(compactor_->NumStates());\n    hdr.SetNumArcs(compactor_->NumArcs());\n    // Ensures compatibility.\n    const auto file_version = opts.align ? kAlignedFileVersion : kFileVersion;\n    WriteHeader(strm, opts, file_version, &hdr);\n    return compactor_->Write(strm, opts);\n  }\n\n  // Provides information needed for generic state iterator.\n  void InitStateIterator(StateIteratorData<Arc> *data) const {\n    data->base = nullptr;\n    data->nstates = compactor_->NumStates();\n  }\n\n  void InitArcIterator(StateId s, ArcIteratorData<Arc> *data) {\n    if (!HasArcs(s)) Expand(s);\n    ImplBase::InitArcIterator(s, data);\n  }\n\n  void Expand(StateId s) {\n    compactor_->SetState(s, &state_);\n    for (size_t i = 0; i < state_.NumArcs(); ++i)\n      PushArc(s, state_.GetArc(i, kArcValueFlags));\n    SetArcs(s);\n    if (!HasFinal(s)) SetFinal(s, state_.Final());\n  }\n\n  const Compactor *GetCompactor() const { return compactor_.get(); }\n  std::shared_ptr<Compactor> SharedCompactor() const { return compactor_; }\n  void SetCompactor(std::shared_ptr<Compactor> compactor) {\n    // TODO(allauzen): is this correct? is this needed?\n    // TODO(allauzen): consider removing and forcing this through direct calls\n    // to compactor.\n    compactor_ = compactor;\n  }\n\n  // Properties always true of this FST class.\n  static constexpr uint64 kStaticProperties = kExpanded;\n\n protected:\n  template <class OtherArc, class OtherCompactor, class OtherCacheStore>\n  explicit CompactFstImpl(\n    const CompactFstImpl<OtherArc, OtherCompactor, OtherCacheStore> &impl)\n    : compactor_(std::make_shared<Compactor>(*impl.GetCompactor())) {\n    SetType(impl.Type());\n    SetProperties(impl.Properties());\n    SetInputSymbols(impl.InputSymbols());\n    SetOutputSymbols(impl.OutputSymbols());\n  }\n\n private:\n  // Allows access during write.\n  template <class AnyArc, class ArcCompactor, class Unsigned,\n            class CompactStore, class AnyCacheStore>\n  friend class ::fst::CompactFst;  // allow access during write.\n\n  // Current unaligned file format version.\n  static constexpr int kFileVersion = 2;\n  // Current aligned file format version.\n  static constexpr int kAlignedFileVersion = 1;\n  // Minimum file format version supported.\n  static constexpr int kMinFileVersion = 1;\n\n  std::shared_ptr<Compactor> compactor_;\n  typename Compactor::State state_;\n};\n\ntemplate <class Arc, class Compactor, class CacheStore>\nconstexpr uint64 CompactFstImpl<Arc, Compactor, CacheStore>::kStaticProperties;\n\ntemplate <class Arc, class Compactor, class CacheStore>\nconstexpr int CompactFstImpl<Arc, Compactor, CacheStore>::kFileVersion;\n\ntemplate <class Arc, class Compactor, class CacheStore>\nconstexpr int CompactFstImpl<Arc, Compactor, CacheStore>::kAlignedFileVersion;\n\ntemplate <class Arc, class Compactor, class CacheStore>\nconstexpr int CompactFstImpl<Arc, Compactor, CacheStore>::kMinFileVersion;\n\n}  // namespace internal\n\n// This class attaches interface to implementation and handles reference\n// counting, delegating most methods to ImplToExpandedFst. The Unsigned type\n// is used to represent indices into the compact arc array. (Template\n// argument defaults are declared in fst-decl.h.)\ntemplate <class A, class ArcCompactor, class Unsigned, class CompactStore,\n          class CacheStore>\nclass CompactFst\n    : public ImplToExpandedFst<internal::CompactFstImpl<\n          A,\n          DefaultCompactor<ArcCompactor, Unsigned, CompactStore>,\n          CacheStore>> {\n public:\n  template <class F, class G>\n  void friend Cast(const F &, G *);\n\n  using Arc = A;\n  using StateId = typename A::StateId;\n  using Compactor = DefaultCompactor<ArcCompactor, Unsigned, CompactStore>;\n  using Impl = internal::CompactFstImpl<A, Compactor, CacheStore>;\n  using Store = CacheStore;  // for CacheArcIterator\n\n  friend class StateIterator<\n      CompactFst<A, ArcCompactor, Unsigned, CompactStore, CacheStore>>;\n  friend class ArcIterator<\n      CompactFst<A, ArcCompactor, Unsigned, CompactStore, CacheStore>>;\n\n  CompactFst() : ImplToExpandedFst<Impl>(std::make_shared<Impl>()) {}\n\n  // If data is not nullptr, it is assumed to be already initialized.\n  explicit CompactFst(\n      const Fst<A> &fst,\n      const ArcCompactor &compactor = ArcCompactor(),\n      const CompactFstOptions &opts = CompactFstOptions(),\n      std::shared_ptr<CompactStore> data = std::shared_ptr<CompactStore>())\n      : ImplToExpandedFst<Impl>(\n            std::make_shared<Impl>(\n                fst,\n                std::make_shared<Compactor>(\n                    std::make_shared<ArcCompactor>(compactor), data),\n                opts)) {}\n\n  // If data is not nullptr, it is assumed to be already initialized.\n  CompactFst(\n      const Fst<Arc> &fst,\n      std::shared_ptr<ArcCompactor> compactor,\n      const CompactFstOptions &opts = CompactFstOptions(),\n      std::shared_ptr<CompactStore> data = std::shared_ptr<CompactStore>())\n      : ImplToExpandedFst<Impl>(\n            std::make_shared<Impl>(fst,\n                                   std::make_shared<Compactor>(compactor, data),\n                                   opts)) {}\n\n  // The following 2 constructors take as input two iterators delimiting a set\n  // of (already) compacted transitions, starting with the transitions out of\n  // the initial state. The format of the input differs for fixed out-degree\n  // and variable out-degree compactors.\n  //\n  // - For fixed out-degree compactors, the final weight (encoded as a\n  // compacted transition) needs to be given only for final states. All strings\n  // (compactor of size 1) will be assume to be terminated by a final state\n  // even when the final state is not implicitely given.\n  //\n  // - For variable out-degree compactors, the final weight (encoded as a\n  // compacted transition) needs to be given for all states and must appeared\n  // first in the list (for state s, final weight of s, followed by outgoing\n  // transitons in s).\n  //\n  // These 2 constructors allows the direct construction of a CompactFst\n  // without first creating a more memory-hungry regular FST. This is useful\n  // when memory usage is severely constrained.\n  template <class Iterator>\n  explicit CompactFst(const Iterator &begin, const Iterator &end,\n                      const ArcCompactor &compactor = ArcCompactor(),\n                      const CompactFstOptions &opts = CompactFstOptions())\n      : ImplToExpandedFst<Impl>(\n            std::make_shared<Impl>(\n                std::make_shared<Compactor>(\n                    begin, end, std::make_shared<ArcCompactor>(compactor)),\n                opts)) {}\n\n  template <class Iterator>\n  CompactFst(const Iterator &begin, const Iterator &end,\n             std::shared_ptr<ArcCompactor> compactor,\n             const CompactFstOptions &opts = CompactFstOptions())\n      : ImplToExpandedFst<Impl>(\n            std::make_shared<Impl>(\n                std::make_shared<Compactor>(begin, end, compactor), opts)) {}\n\n  // See Fst<>::Copy() for doc.\n  CompactFst(\n      const CompactFst<A, ArcCompactor, Unsigned, CompactStore, CacheStore>\n      &fst,\n      bool safe = false)\n      : ImplToExpandedFst<Impl>(fst, safe) {}\n\n  // Get a copy of this CompactFst. See Fst<>::Copy() for further doc.\n  CompactFst<A, ArcCompactor, Unsigned, CompactStore, CacheStore> *Copy(\n      bool safe = false) const override {\n    return new CompactFst<A, ArcCompactor, Unsigned, CompactStore, CacheStore>(\n        *this, safe);\n  }\n\n  // Read a CompactFst from an input stream; return nullptr on error\n  static CompactFst<A, ArcCompactor, Unsigned, CompactStore, CacheStore> *Read(\n      std::istream &strm, const FstReadOptions &opts) {\n    auto *impl = Impl::Read(strm, opts);\n    return impl ? new CompactFst<A, ArcCompactor, Unsigned, CompactStore,\n                                 CacheStore>(std::shared_ptr<Impl>(impl))\n                : nullptr;\n  }\n\n  // Read a CompactFst from a file; return nullptr on error\n  // Empty filename reads from standard input\n  static CompactFst<A, ArcCompactor, Unsigned, CompactStore, CacheStore> *Read(\n      const string &filename) {\n    auto *impl = ImplToExpandedFst<Impl>::Read(filename);\n    return impl ? new CompactFst<A, ArcCompactor, Unsigned, CompactStore,\n                                 CacheStore>(std::shared_ptr<Impl>(impl))\n                : nullptr;\n  }\n\n  bool Write(std::ostream &strm, const FstWriteOptions &opts) const override {\n    return GetImpl()->Write(strm, opts);\n  }\n\n  bool Write(const string &filename) const override {\n    return Fst<Arc>::WriteFile(filename);\n  }\n\n  template <class FST>\n  static bool WriteFst(const FST &fst, const ArcCompactor &compactor,\n                       std::ostream &strm, const FstWriteOptions &opts);\n\n  void InitStateIterator(StateIteratorData<Arc> *data) const override {\n    GetImpl()->InitStateIterator(data);\n  }\n\n  void InitArcIterator(StateId s, ArcIteratorData<Arc> *data) const override {\n    GetMutableImpl()->InitArcIterator(s, data);\n  }\n\n  MatcherBase<Arc> *InitMatcher(MatchType match_type) const override {\n    return new SortedMatcher<\n        CompactFst<A, ArcCompactor, Unsigned, CompactStore, CacheStore>>(\n        *this, match_type);\n  }\n\n  template <class Iterator>\n  void SetCompactElements(const Iterator &b, const Iterator &e) {\n    GetMutableImpl()->SetCompactor(std::make_shared<Compactor>(\n        b, e, std::make_shared<ArcCompactor>()));\n  }\n\n private:\n  using ImplToFst<Impl, ExpandedFst<Arc>>::GetImpl;\n  using ImplToFst<Impl, ExpandedFst<Arc>>::GetMutableImpl;\n\n  explicit CompactFst(std::shared_ptr<Impl> impl)\n      : ImplToExpandedFst<Impl>(impl) {}\n\n  // Use overloading to extract the type of the argument.\n  static Impl *GetImplIfCompactFst(\n      const CompactFst<A, ArcCompactor, Unsigned, CompactStore, CacheStore>\n          &compact_fst) {\n    return compact_fst.GetImpl();\n  }\n\n  // This does not give privileged treatment to subclasses of CompactFst.\n  template <typename NonCompactFst>\n  static Impl *GetImplIfCompactFst(const NonCompactFst &fst) {\n    return nullptr;\n  }\n\n  CompactFst &operator=(const CompactFst &fst) = delete;\n};\n\n// Writes FST in Compact format, with a possible pass over the machine before\n// writing to compute the number of states and arcs.\ntemplate <class A, class ArcCompactor, class Unsigned, class CompactStore,\n          class CacheStore>\ntemplate <class FST>\nbool CompactFst<A, ArcCompactor, Unsigned, CompactStore, CacheStore>::WriteFst(\n    const FST &fst, const ArcCompactor &compactor, std::ostream &strm,\n    const FstWriteOptions &opts) {\n  using Arc = A;\n  using Weight = typename A::Weight;\n  using Element = typename ArcCompactor::Element;\n  const auto file_version =\n      opts.align ? Impl::kAlignedFileVersion : Impl::kFileVersion;\n  size_t num_arcs = -1;\n  size_t num_states = -1;\n  auto first_pass_compactor = compactor;\n  if (auto *impl = GetImplIfCompactFst(fst)) {\n    num_arcs = impl->GetCompactor()->GetCompactStore()->NumArcs();\n    num_states = impl->GetCompactor()->GetCompactStore()->NumStates();\n    first_pass_compactor = *impl->GetCompactor()->GetArcCompactor();\n  } else {\n    // A first pass is needed to compute the state of the compactor, which\n    // is saved ahead of the rest of the data structures. This unfortunately\n    // means forcing a complete double compaction when writing in this format.\n    // TODO(allauzen): eliminate mutable state from compactors.\n    num_arcs = 0;\n    num_states = 0;\n    for (StateIterator<FST> siter(fst); !siter.Done(); siter.Next()) {\n      const auto s = siter.Value();\n      ++num_states;\n      if (fst.Final(s) != Weight::Zero()) {\n        first_pass_compactor.Compact(\n            s, Arc(kNoLabel, kNoLabel, fst.Final(s), kNoStateId));\n      }\n      for (ArcIterator<FST> aiter(fst, s); !aiter.Done(); aiter.Next()) {\n        ++num_arcs;\n        first_pass_compactor.Compact(s, aiter.Value());\n      }\n    }\n  }\n  FstHeader hdr;\n  hdr.SetStart(fst.Start());\n  hdr.SetNumStates(num_states);\n  hdr.SetNumArcs(num_arcs);\n  string type = \"compact\";\n  if (sizeof(Unsigned) != sizeof(uint32)) {\n    type += std::to_string(CHAR_BIT * sizeof(Unsigned));\n  }\n  type += \"_\";\n  type += ArcCompactor::Type();\n  if (CompactStore::Type() != \"compact\") {\n    type += \"_\";\n    type += CompactStore::Type();\n  }\n  const auto copy_properties = fst.Properties(kCopyProperties, true);\n  if ((copy_properties & kError) || !compactor.Compatible(fst)) {\n    FSTERROR() << \"Fst incompatible with compactor\";\n    return false;\n  }\n  uint64 properties = copy_properties | Impl::kStaticProperties;\n  internal::FstImpl<Arc>::WriteFstHeader(fst, strm, opts, file_version, type,\n                                         properties, &hdr);\n  first_pass_compactor.Write(strm);\n  if (first_pass_compactor.Size() == -1) {\n    if (opts.align && !AlignOutput(strm)) {\n      LOG(ERROR) << \"CompactFst::Write: Alignment failed: \" << opts.source;\n      return false;\n    }\n    Unsigned compacts = 0;\n    for (StateIterator<FST> siter(fst); !siter.Done(); siter.Next()) {\n      const auto s = siter.Value();\n      strm.write(reinterpret_cast<const char *>(&compacts), sizeof(compacts));\n      if (fst.Final(s) != Weight::Zero()) {\n        ++compacts;\n      }\n      compacts += fst.NumArcs(s);\n    }\n    strm.write(reinterpret_cast<const char *>(&compacts), sizeof(compacts));\n  }\n  if (opts.align && !AlignOutput(strm)) {\n    LOG(ERROR) << \"Could not align file during write after writing states\";\n  }\n  const auto &second_pass_compactor = compactor;\n  Element element;\n  for (StateIterator<FST> siter(fst); !siter.Done(); siter.Next()) {\n    const auto s = siter.Value();\n    if (fst.Final(s) != Weight::Zero()) {\n      element = second_pass_compactor.Compact(\n          s, A(kNoLabel, kNoLabel, fst.Final(s), kNoStateId));\n      strm.write(reinterpret_cast<const char *>(&element), sizeof(element));\n    }\n    for (ArcIterator<FST> aiter(fst, s); !aiter.Done(); aiter.Next()) {\n      element = second_pass_compactor.Compact(s, aiter.Value());\n      strm.write(reinterpret_cast<const char *>(&element), sizeof(element));\n    }\n  }\n  strm.flush();\n  if (!strm) {\n    LOG(ERROR) << \"CompactFst write failed: \" << opts.source;\n    return false;\n  }\n  return true;\n}\n\n// Specialization for CompactFst; see generic version in fst.h for sample\n// usage (but use the CompactFst type!). This version should inline.\ntemplate <class Arc, class ArcCompactor, class Unsigned, class CompactStore,\n          class CacheStore>\nclass StateIterator<\n    CompactFst<Arc, ArcCompactor, Unsigned, CompactStore, CacheStore>> {\n public:\n  using StateId = typename Arc::StateId;\n\n  explicit StateIterator(\n      const CompactFst<Arc, ArcCompactor, Unsigned, CompactStore,\n                       CacheStore> &fst)\n      : nstates_(fst.GetImpl()->NumStates()), s_(0) {}\n\n  bool Done() const { return s_ >= nstates_; }\n\n  StateId Value() const { return s_; }\n\n  void Next() { ++s_; }\n\n  void Reset() { s_ = 0; }\n\n private:\n  StateId nstates_;\n  StateId s_;\n};\n\n// Specialization for CompactFst. Never caches,\n// always iterates over the underlying compact elements.\ntemplate <class Arc, class ArcCompactor, class Unsigned,\n          class CompactStore, class CacheStore>\nclass ArcIterator<CompactFst<\n    Arc, ArcCompactor, Unsigned, CompactStore, CacheStore>> {\n public:\n  using StateId = typename Arc::StateId;\n  using Element = typename ArcCompactor::Element;\n  using Compactor = DefaultCompactor<ArcCompactor, Unsigned, CompactStore>;\n  using State = typename Compactor::State;\n\n  ArcIterator(const CompactFst<Arc, ArcCompactor, Unsigned, CompactStore,\n                               CacheStore> &fst,\n              StateId s)\n      : state_(fst.GetImpl()->GetCompactor(), s),\n        pos_(0),\n        flags_(kArcValueFlags) {}\n\n  bool Done() const { return pos_ >= state_.NumArcs(); }\n\n  const Arc &Value() const {\n    arc_ = state_.GetArc(pos_, flags_);\n    return arc_;\n  }\n\n  void Next() { ++pos_; }\n\n  size_t Position() const { return pos_; }\n\n  void Reset() { pos_ = 0; }\n\n  void Seek(size_t pos) { pos_ = pos; }\n\n  uint32 Flags() const { return flags_; }\n\n  void SetFlags(uint32 f, uint32 m) {\n    flags_ &= ~m;\n    flags_ |= (f & kArcValueFlags);\n  }\n\n private:\n  State state_;\n  size_t pos_;\n  mutable Arc arc_;\n  uint32 flags_;\n};\n\n// ArcCompactor for unweighted string FSTs.\ntemplate <class A>\nclass StringCompactor {\n public:\n  using Arc = A;\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using Element = Label;\n\n  Element Compact(StateId s, const Arc &arc) const { return arc.ilabel; }\n\n  Arc Expand(StateId s, const Element &p, uint32 f = kArcValueFlags) const {\n    return Arc(p, p, Weight::One(), p != kNoLabel ? s + 1 : kNoStateId);\n  }\n\n  constexpr ssize_t Size() const { return 1; }\n\n  constexpr uint64 Properties() const {\n    return kString | kAcceptor | kUnweighted;\n  }\n\n  bool Compatible(const Fst<Arc> &fst) const {\n    const auto props = Properties();\n    return fst.Properties(props, true) == props;\n  }\n\n  static const string &Type() {\n    static const string *const type = new string(\"string\");\n    return *type;\n  }\n\n  bool Write(std::ostream &strm) const { return true; }\n\n  static StringCompactor *Read(std::istream &strm) {\n    return new StringCompactor;\n  }\n};\n\n// ArcCompactor for weighted string FSTs.\ntemplate <class A>\nclass WeightedStringCompactor {\n public:\n  using Arc = A;\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using Element = std::pair<Label, Weight>;\n\n  Element Compact(StateId s, const Arc &arc) const {\n    return std::make_pair(arc.ilabel, arc.weight);\n  }\n\n  Arc Expand(StateId s, const Element &p, uint32 f = kArcValueFlags) const {\n    return Arc(p.first, p.first, p.second,\n               p.first != kNoLabel ? s + 1 : kNoStateId);\n  }\n\n  constexpr ssize_t Size() const { return 1; }\n\n  constexpr uint64 Properties() const { return kString | kAcceptor; }\n\n  bool Compatible(const Fst<Arc> &fst) const {\n    const auto props = Properties();\n    return fst.Properties(props, true) == props;\n  }\n\n  static const string &Type() {\n    static const string *const type = new string(\"weighted_string\");\n    return *type;\n  }\n\n  bool Write(std::ostream &strm) const { return true; }\n\n  static WeightedStringCompactor *Read(std::istream &strm) {\n    return new WeightedStringCompactor;\n  }\n};\n\n// ArcCompactor for unweighted acceptor FSTs.\ntemplate <class A>\nclass UnweightedAcceptorCompactor {\n public:\n  using Arc = A;\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using Element = std::pair<Label, StateId>;\n\n  Element Compact(StateId s, const Arc &arc) const {\n    return std::make_pair(arc.ilabel, arc.nextstate);\n  }\n\n  Arc Expand(StateId s, const Element &p, uint32 f = kArcValueFlags) const {\n    return Arc(p.first, p.first, Weight::One(), p.second);\n  }\n\n  constexpr ssize_t Size() const { return -1; }\n\n  constexpr uint64 Properties() const { return kAcceptor | kUnweighted; }\n\n  bool Compatible(const Fst<Arc> &fst) const {\n    const auto props = Properties();\n    return fst.Properties(props, true) == props;\n  }\n\n  static const string &Type() {\n    static const string *const type = new string(\"unweighted_acceptor\");\n    return *type;\n  }\n\n  bool Write(std::ostream &strm) const { return true; }\n\n  static UnweightedAcceptorCompactor *Read(std::istream &istrm) {\n    return new UnweightedAcceptorCompactor;\n  }\n};\n\n// ArcCompactor for weighted acceptor FSTs.\ntemplate <class A>\nclass AcceptorCompactor {\n public:\n  using Arc = A;\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using Element = std::pair<std::pair<Label, Weight>, StateId>;\n\n  Element Compact(StateId s, const Arc &arc) const {\n    return std::make_pair(std::make_pair(arc.ilabel, arc.weight),\n                          arc.nextstate);\n  }\n\n  Arc Expand(StateId s, const Element &p, uint32 f = kArcValueFlags) const {\n    return Arc(p.first.first, p.first.first, p.first.second, p.second);\n  }\n\n  constexpr ssize_t Size() const { return -1; }\n\n  constexpr uint64 Properties() const { return kAcceptor; }\n\n  bool Compatible(const Fst<Arc> &fst) const {\n    const auto props = Properties();\n    return fst.Properties(props, true) == props;\n  }\n\n  static const string &Type() {\n    static const string *const type = new string(\"acceptor\");\n    return *type;\n  }\n\n  bool Write(std::ostream &strm) const { return true; }\n\n  static AcceptorCompactor *Read(std::istream &strm) {\n    return new AcceptorCompactor;\n  }\n};\n\n// ArcCompactor for unweighted FSTs.\ntemplate <class A>\nclass UnweightedCompactor {\n public:\n  using Arc = A;\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using Element = std::pair<std::pair<Label, Label>, StateId>;\n\n  Element Compact(StateId s, const Arc &arc) const {\n    return std::make_pair(std::make_pair(arc.ilabel, arc.olabel),\n                          arc.nextstate);\n  }\n\n  Arc Expand(StateId s, const Element &p, uint32 f = kArcValueFlags) const {\n    return Arc(p.first.first, p.first.second, Weight::One(), p.second);\n  }\n\n  constexpr ssize_t Size() const { return -1; }\n\n  constexpr uint64 Properties() const { return kUnweighted; }\n\n  bool Compatible(const Fst<Arc> &fst) const {\n    const auto props = Properties();\n    return fst.Properties(props, true) == props;\n  }\n\n  static const string &Type() {\n    static const string *const type = new string(\"unweighted\");\n    return *type;\n  }\n\n  bool Write(std::ostream &strm) const { return true; }\n\n  static UnweightedCompactor *Read(std::istream &strm) {\n    return new UnweightedCompactor;\n  }\n};\n\ntemplate <class Arc, class Unsigned /* = uint32 */>\nusing CompactStringFst = CompactFst<Arc, StringCompactor<Arc>, Unsigned>;\n\ntemplate <class Arc, class Unsigned /* = uint32 */>\nusing CompactWeightedStringFst =\n    CompactFst<Arc, WeightedStringCompactor<Arc>, Unsigned>;\n\ntemplate <class Arc, class Unsigned /* = uint32 */>\nusing CompactAcceptorFst = CompactFst<Arc, AcceptorCompactor<Arc>, Unsigned>;\n\ntemplate <class Arc, class Unsigned /* = uint32 */>\nusing CompactUnweightedFst =\n    CompactFst<Arc, UnweightedCompactor<Arc>, Unsigned>;\n\ntemplate <class Arc, class Unsigned /* = uint32 */>\nusing CompactUnweightedAcceptorFst =\n    CompactFst<Arc, UnweightedAcceptorCompactor<Arc>, Unsigned>;\n\nusing StdCompactStringFst = CompactStringFst<StdArc, uint32>;\n\nusing StdCompactWeightedStringFst = CompactWeightedStringFst<StdArc, uint32>;\n\nusing StdCompactAcceptorFst = CompactAcceptorFst<StdArc, uint32>;\n\nusing StdCompactUnweightedFst = CompactUnweightedFst<StdArc, uint32>;\n\nusing StdCompactUnweightedAcceptorFst =\n    CompactUnweightedAcceptorFst<StdArc, uint32>;\n\n}  // namespace fst\n\n#endif  // FST_COMPACT_FST_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/compat.h",
    "content": "// Licensed under the Apache License, Version 2.0 (the \"License\");\n// you may not use this file except in compliance with the License.\n// You may obtain a copy of the License at\n//\n//      http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n// See the License for the specific language governing permissions and\n// limitations under the License.\n//\n// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#ifndef FST_LIB_COMPAT_H_\n#define FST_LIB_COMPAT_H_\n\n#include <climits>\n#include <cstdlib>\n#include <cstring>\n#include <iostream>\n#include <string>\n#include <vector>\n\n// Makes copy constructor and operator= private\n// Deprecated: now just use =delete.\n#define DISALLOW_COPY_AND_ASSIGN(type)    \\\n  type(const type&);                      \\\n  void operator=(const type&)\n\n#if defined(__GNUC__) || defined(__clang__)\n#define OPENFST_DEPRECATED(message) __attribute__((deprecated(message)))\n#elif defined(_MSC_VER)\n#define OPENFST_DEPRECATED(message) __declspec(deprecated(message))\n#else\n#define OPENFST_DEPRECATED(message)\n#endif\n\n#include <fst/config.h>\n#include <fst/types.h>\n#include <fst/lock.h>\n#include <fst/flags.h>\n#include <fst/log.h>\n#include <fst/icu.h>\n\nusing std::string;\n\nvoid FailedNewHandler();\n\nnamespace fst {\n\n// Downcasting.\ntemplate<typename To, typename From>\ninline To down_cast(From* f) { return static_cast<To>(f); }\n\n// Bitcasting.\ntemplate <class Dest, class Source>\ninline Dest bit_cast(const Source &source) {\n  static_assert(sizeof(Dest) == sizeof(Source),\n                \"Bitcasting unsafe for specified types\");\n  Dest dest;\n  memcpy(&dest, &source, sizeof(dest));\n  return dest;\n}\n\n// Check sums\nclass CheckSummer {\n public:\n  CheckSummer() : count_(0) {\n    check_sum_.resize(kCheckSumLength, '\\0');\n  }\n\n  void Reset() {\n    count_ = 0;\n    for (int i = 0; i < kCheckSumLength; ++i) check_sum_[i] = '\\0';\n  }\n\n  void Update(void const *data, int size) {\n    const char *p = reinterpret_cast<const char *>(data);\n    for (int i = 0; i < size; ++i) {\n      check_sum_[(count_++) % kCheckSumLength] ^= p[i];\n    }\n  }\n\n  void Update(string const &data) {\n    for (int i = 0; i < data.size(); ++i) {\n      check_sum_[(count_++) % kCheckSumLength] ^= data[i];\n    }\n  }\n\n  string Digest() { return check_sum_; }\n\n private:\n  static const int kCheckSumLength = 32;\n  int count_;\n  string check_sum_;\n\n  CheckSummer(const CheckSummer &) = delete;\n  CheckSummer &operator=(const CheckSummer &) = delete;\n};\n\n}  // namespace fst\n\n#endif  // FST_LIB_COMPAT_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/complement.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Class to complement an FST.\n\n#ifndef FST_COMPLEMENT_H_\n#define FST_COMPLEMENT_H_\n\n#include <algorithm>\n#include <string>\n#include <vector>\n#include <fst/log.h>\n\n#include <fst/fst.h>\n#include <fst/test-properties.h>\n\n\nnamespace fst {\n\ntemplate <class Arc>\nclass ComplementFst;\n\nnamespace internal {\n\n// Implementation of delayed ComplementFst. The algorithm used completes the\n// (deterministic) FSA and then exchanges final and non-final states.\n// Completion, i.e. ensuring that all labels can be read from every state, is\n// accomplished by using ρ-labels, which match all labels that are otherwise\n// not found leaving a state. The first state in the output is reserved to be a\n// new state that is the destination of all ρ-labels. Each remaining output\n// state s corresponds to input state s - 1. The first arc in the output at\n// these states is the ρ-label, the remaining arcs correspond to the input\n// arcs.\ntemplate <class A>\nclass ComplementFstImpl : public FstImpl<A> {\n public:\n  using Arc = A;\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using FstImpl<A>::SetType;\n  using FstImpl<A>::SetProperties;\n  using FstImpl<A>::SetInputSymbols;\n  using FstImpl<A>::SetOutputSymbols;\n\n  friend class StateIterator<ComplementFst<Arc>>;\n  friend class ArcIterator<ComplementFst<Arc>>;\n\n  explicit ComplementFstImpl(const Fst<Arc> &fst) : fst_(fst.Copy()) {\n    SetType(\"complement\");\n    uint64 props = fst.Properties(kILabelSorted, false);\n    SetProperties(ComplementProperties(props), kCopyProperties);\n    SetInputSymbols(fst.InputSymbols());\n    SetOutputSymbols(fst.OutputSymbols());\n  }\n\n  ComplementFstImpl(const ComplementFstImpl<Arc> &impl)\n      : fst_(impl.fst_->Copy()) {\n    SetType(\"complement\");\n    SetProperties(impl.Properties(), kCopyProperties);\n    SetInputSymbols(impl.InputSymbols());\n    SetOutputSymbols(impl.OutputSymbols());\n  }\n\n  StateId Start() const {\n    if (Properties(kError)) return kNoStateId;\n    auto start = fst_->Start();\n    return start != kNoStateId ? start + 1 : 0;\n  }\n\n  // Exchange final and non-final states; makes ρ-destination state final.\n  Weight Final(StateId s) const {\n    if (s == 0 || fst_->Final(s - 1) == Weight::Zero()) {\n      return Weight::One();\n    } else {\n      return Weight::Zero();\n    }\n  }\n\n  size_t NumArcs(StateId s) const {\n    return s == 0 ? 1 : fst_->NumArcs(s - 1) + 1;\n  }\n\n  size_t NumInputEpsilons(StateId s) const {\n    return s == 0 ? 0 : fst_->NumInputEpsilons(s - 1);\n  }\n\n  size_t NumOutputEpsilons(StateId s) const {\n    return s == 0 ? 0 : fst_->NumOutputEpsilons(s - 1);\n  }\n\n  uint64 Properties() const override { return Properties(kFstProperties); }\n\n  // Sets error if found, and returns other FST impl properties.\n  uint64 Properties(uint64 mask) const override {\n    if ((mask & kError) && fst_->Properties(kError, false)) {\n      SetProperties(kError, kError);\n    }\n    return FstImpl<Arc>::Properties(mask);\n  }\n\n private:\n  std::unique_ptr<const Fst<Arc>> fst_;\n};\n\n}  // namespace internal\n\n// Complements an automaton. This is a library-internal operation that\n// introduces a (negative) ρ-label; use Difference/DifferenceFst in user code,\n// which will not see this label. This version is a delayed FST.\n//\n// This class attaches interface to implementation and handles\n// reference counting, delegating most methods to ImplToFst.\ntemplate <class A>\nclass ComplementFst : public ImplToFst<internal::ComplementFstImpl<A>> {\n public:\n  using Arc = A;\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Impl = internal::ComplementFstImpl<Arc>;\n\n  friend class StateIterator<ComplementFst<Arc>>;\n  friend class ArcIterator<ComplementFst<Arc>>;\n\n  explicit ComplementFst(const Fst<Arc> &fst)\n      : ImplToFst<Impl>(std::make_shared<Impl>(fst)) {\n    static constexpr auto props =\n        kUnweighted | kNoEpsilons | kIDeterministic | kAcceptor;\n    if (fst.Properties(props, true) != props) {\n      FSTERROR() << \"ComplementFst: Argument not an unweighted \"\n                 << \"epsilon-free deterministic acceptor\";\n      GetImpl()->SetProperties(kError, kError);\n    }\n  }\n\n  // See Fst<>::Copy() for doc.\n  ComplementFst(const ComplementFst<Arc> &fst, bool safe = false)\n      : ImplToFst<Impl>(fst, safe) {}\n\n  // Gets a copy of this FST. See Fst<>::Copy() for further doc.\n  ComplementFst<Arc> *Copy(bool safe = false) const override {\n    return new ComplementFst<Arc>(*this, safe);\n  }\n\n  inline void InitStateIterator(StateIteratorData<Arc> *data) const override;\n\n  inline void InitArcIterator(StateId s,\n                              ArcIteratorData<Arc> *data) const override;\n\n  // Label that represents the ρ-transition; we use a negative value private to\n  // the library and which will preserve FST label sort order.\n  static const Label kRhoLabel = -2;\n\n private:\n  using ImplToFst<Impl>::GetImpl;\n\n  ComplementFst &operator=(const ComplementFst &) = delete;\n};\n\ntemplate <class Arc>\nconst typename Arc::Label ComplementFst<Arc>::kRhoLabel;\n\n// Specialization for ComplementFst.\ntemplate <class Arc>\nclass StateIterator<ComplementFst<Arc>> : public StateIteratorBase<Arc> {\n public:\n  using StateId = typename Arc::StateId;\n\n  explicit StateIterator(const ComplementFst<Arc> &fst)\n      : siter_(*fst.GetImpl()->fst_), s_(0) {}\n\n  bool Done() const final { return s_ > 0 && siter_.Done(); }\n\n  StateId Value() const final { return s_; }\n\n  void Next() final {\n    if (s_ != 0) siter_.Next();\n    ++s_;\n  }\n\n  void Reset() final {\n    siter_.Reset();\n    s_ = 0;\n  }\n\n private:\n  StateIterator<Fst<Arc>> siter_;\n  StateId s_;\n};\n\n// Specialization for ComplementFst.\ntemplate <class Arc>\nclass ArcIterator<ComplementFst<Arc>> : public ArcIteratorBase<Arc> {\n public:\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  ArcIterator(const ComplementFst<Arc> &fst, StateId s) : s_(s), pos_(0) {\n    if (s_ != 0) {\n      aiter_.reset(new ArcIterator<Fst<Arc>>(*fst.GetImpl()->fst_, s - 1));\n    }\n  }\n\n  bool Done() const final {\n    if (s_ != 0) {\n      return pos_ > 0 && aiter_->Done();\n    } else {\n      return pos_ > 0;\n    }\n  }\n\n  // Adds the ρ-label to the ρ destination state.\n  const Arc &Value() const final {\n    if (pos_ == 0) {\n      arc_.ilabel = arc_.olabel = ComplementFst<Arc>::kRhoLabel;\n      arc_.weight = Weight::One();\n      arc_.nextstate = 0;\n    } else {\n      arc_ = aiter_->Value();\n      ++arc_.nextstate;\n    }\n    return arc_;\n  }\n\n  void Next() final {\n    if (s_ != 0 && pos_ > 0) aiter_->Next();\n    ++pos_;\n  }\n\n  size_t Position() const final { return pos_; }\n\n  void Reset() final {\n    if (s_ != 0) aiter_->Reset();\n    pos_ = 0;\n  }\n\n  void Seek(size_t a) final {\n    if (s_ != 0) {\n      if (a == 0) {\n        aiter_->Reset();\n      } else {\n        aiter_->Seek(a - 1);\n      }\n    }\n    pos_ = a;\n  }\n\n  uint32 Flags() const final { return kArcValueFlags; }\n\n  void SetFlags(uint32, uint32) final {}\n\n private:\n  std::unique_ptr<ArcIterator<Fst<Arc>>> aiter_;\n  StateId s_;\n  size_t pos_;\n  mutable Arc arc_;\n};\n\ntemplate <class Arc>\ninline void ComplementFst<Arc>::InitStateIterator(\n    StateIteratorData<Arc> *data) const {\n  data->base = new StateIterator<ComplementFst<Arc>>(*this);\n}\n\ntemplate <class Arc>\ninline void ComplementFst<Arc>::InitArcIterator(StateId s,\n    ArcIteratorData<Arc> *data) const {\n  data->base = new ArcIterator<ComplementFst<Arc>>(*this, s);\n}\n\n// Useful alias when using StdArc.\nusing StdComplementFst = ComplementFst<StdArc>;\n\n}  // namespace fst\n\n#endif  // FST_COMPLEMENT_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/compose-filter.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Classes for filtering the composition matches, e.g. for correct epsilon\n// handling.\n\n#ifndef FST_COMPOSE_FILTER_H_\n#define FST_COMPOSE_FILTER_H_\n\n#include <fst/filter-state.h>\n#include <fst/fst-decl.h>  // For optional argument declarations\n#include <fst/fst.h>\n#include <fst/matcher.h>\n\n\nnamespace fst {\n\n// Composition filters determine which matches are allowed to proceed. The\n// filter's state is represeted by the type ComposeFilter::FilterState.\n// The basic filters handle correct epsilon matching. Their interface is:\n//\n// template <class M1, class M2>\n// class ComposeFilter {\n//  public:\n//   using Matcher1 = ...;\n//   using Matcher2 = ...;\n//   using FST1 = typename M1::FST;\n//   using FST2 = typename M2::FST;\n//   using FilterState = ...;\n//\n//   using Arc = typename FST1::Arc;\n//   using StateId = typename Arc::StateId;\n//   using Weight = typename Arc::Weight;\n//\n//   // Required constructor.\n//   ComposeFilter(const FST1 &fst1, const FST2 &fst2,\n//                 M1 *matcher1 = nullptr, M2 *matcher2 = nullptr);\n//\n//   // If safe=true, the copy is thread-safe. See Fst<>::Copy()\n//   // for further doc.\n//   ComposeFilter(const ComposeFilter<M1, M2> &filter,\n//                 bool safe = false);\n//\n//   // Return start state of filter.\n//   FilterState Start() const;\n//\n//   // Specifies current composition state.\n//   void SetState(StateId s1, StateId s2, const FilterState &fs);\n//\n//   // Apply filter at current composition state to these transitions. If an\n//   // arc label to be matched is kNolabel, then that side does not consume a\n//   // symbol. Returns the new filter state or, if disallowed,\n//   // FilterState::NoState(). The filter is permitted to modify its inputs\n//   // (e.g. for optimization reasons).\n//   FilterState FilterArc(Arc *arc1, Arc *arc2) const;\n\n//   // Apply filter at current composition state to these final weights\n//   // (cf. superfinal transitions). The filter may modify its inputs\n//   // (e.g. for optimization reasons).\n//   void FilterFinal(Weight *w1, Weight *w2) const;\n//\n//   // Return the respective matchers. Ownership stays with filter. These\n//   // methods allow the filter to access and possibly modify the compositio\n//   // matchers (useful, e.g., with lookahead).\n//\n//   Matcher1 *GetMatcher1();\n//\n//   Matcher2 *GetMatcher2();\n//\n//   // This specifies how the filter affects the composition result properties.\n//   It takes as argument the properties that would apply with a trivial\n//   // composition filter.\n//   uint64 Properties(uint64 props) const;\n// };\n//\n// This filter allows only exact matching of symbols from FST1 with on FST2;\n// e.g., no special interpretation of epsilons.\ntemplate <class M1, class M2 /* = M1 */>\nclass NullComposeFilter {\n public:\n  using Matcher1 = M1;\n  using Matcher2 = M2;\n  using FST1 = typename M1::FST;\n  using FST2 = typename M2::FST;\n  using FilterState = TrivialFilterState;\n\n  using Arc = typename FST1::Arc;\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  NullComposeFilter(const FST1 &fst1, const FST2 &fst2,\n                    Matcher1 *matcher1 = nullptr, Matcher2 *matcher2 = nullptr)\n      : matcher1_(matcher1 ? matcher1 : new Matcher1(fst1, MATCH_OUTPUT)),\n        matcher2_(matcher2 ? matcher2 : new Matcher2(fst2, MATCH_INPUT)),\n        fst1_(matcher1_->GetFst()),\n        fst2_(matcher2_->GetFst()) {}\n\n  NullComposeFilter(const NullComposeFilter<M1, M2> &filter, bool safe = false)\n      : matcher1_(filter.matcher1_->Copy(safe)),\n        matcher2_(filter.matcher2_->Copy(safe)),\n        fst1_(matcher1_->GetFst()),\n        fst2_(matcher2_->GetFst()) {}\n\n  FilterState Start() const { return FilterState(true); }\n\n  void SetState(StateId, StateId, const FilterState &) {}\n\n  FilterState FilterArc(Arc *arc1, Arc *arc2) const {\n    return (arc1->olabel == kNoLabel || arc2->ilabel == kNoLabel)\n               ? FilterState::NoState()\n               : FilterState(true);\n  }\n\n  void FilterFinal(Weight *, Weight *) const {}\n\n  Matcher1 *GetMatcher1() { return matcher1_.get(); }\n\n  Matcher2 *GetMatcher2() { return matcher2_.get(); }\n\n  uint64 Properties(uint64 props) const { return props; }\n\n private:\n  std::unique_ptr<Matcher1> matcher1_;\n  std::unique_ptr<Matcher2> matcher2_;\n  const FST1 &fst1_;\n  const FST2 &fst2_;\n};\n\n// This filter allows all epsilon matches, potentially resulting in redundant\n// epsilon paths. The use of this filter gives correct results iff one of the\n// following conditions hold:\n//\n//  (1) The semiring is idempotent,\n//  (2) the first FST is output-epsilon free, or\n//  (3) the second FST is input-epsilon free.\n//\n// For (1), redundant epsilon paths may be created but won't hurt correctness.\n// For (2) and (3), no redundant paths are created.\ntemplate <class M1, class M2 /* = M1 */>\nclass TrivialComposeFilter {\n public:\n  using Matcher1 = M1;\n  using Matcher2 = M2;\n  using FST1 = typename M1::FST;\n  using FST2 = typename M2::FST;\n  using FilterState = TrivialFilterState;\n\n  using Arc = typename FST1::Arc;\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  TrivialComposeFilter(const FST1 &fst1, const FST2 &fst2,\n                       Matcher1 *matcher1 = nullptr,\n                       Matcher2 *matcher2 = nullptr)\n      : matcher1_(matcher1 ? matcher1 : new Matcher1(fst1, MATCH_OUTPUT)),\n        matcher2_(matcher2 ? matcher2 : new Matcher2(fst2, MATCH_INPUT)),\n        fst1_(matcher1_->GetFst()),\n        fst2_(matcher2_->GetFst()) {}\n\n  TrivialComposeFilter(const TrivialComposeFilter<Matcher1, Matcher2> &filter,\n                       bool safe = false)\n      : matcher1_(filter.matcher1_->Copy(safe)),\n        matcher2_(filter.matcher2_->Copy(safe)),\n        fst1_(matcher1_->GetFst()),\n        fst2_(matcher2_->GetFst()) {}\n\n  FilterState Start() const { return FilterState(true); }\n\n  void SetState(StateId, StateId, const FilterState &) {}\n\n  FilterState FilterArc(Arc *, Arc *) const { return FilterState(true); }\n\n  void FilterFinal(Weight *, Weight *) const {}\n\n  Matcher1 *GetMatcher1() { return matcher1_.get(); }\n\n  Matcher2 *GetMatcher2() { return matcher2_.get(); }\n\n  uint64 Properties(uint64 props) const { return props; }\n\n private:\n  std::unique_ptr<Matcher1> matcher1_;\n  std::unique_ptr<Matcher2> matcher2_;\n  const FST1 &fst1_;\n  const FST2 &fst2_;\n};\n\n// This filter requires epsilons on FST1 to be read before epsilons on FST2.\ntemplate <class M1, class M2 /* = M1 */>\nclass SequenceComposeFilter {\n public:\n  using Matcher1 = M1;\n  using Matcher2 = M2;\n  using FST1 = typename M1::FST;\n  using FST2 = typename M2::FST;\n  using FilterState = CharFilterState;\n\n  using Arc = typename FST1::Arc;\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  SequenceComposeFilter(const FST1 &fst1, const FST2 &fst2,\n                        Matcher1 *matcher1 = nullptr,\n                        Matcher2 *matcher2 = nullptr)\n      : matcher1_(matcher1 ? matcher1 : new Matcher1(fst1, MATCH_OUTPUT)),\n        matcher2_(matcher2 ? matcher2 : new Matcher2(fst2, MATCH_INPUT)),\n        fst1_(matcher1_->GetFst()),\n        s1_(kNoStateId),\n        s2_(kNoStateId),\n        fs_(kNoStateId) {}\n\n  SequenceComposeFilter(const SequenceComposeFilter<Matcher1, Matcher2> &filter,\n                        bool safe = false)\n      : matcher1_(filter.matcher1_->Copy(safe)),\n        matcher2_(filter.matcher2_->Copy(safe)),\n        fst1_(matcher1_->GetFst()),\n        s1_(kNoStateId),\n        s2_(kNoStateId),\n        fs_(kNoStateId) {}\n\n  FilterState Start() const { return FilterState(0); }\n\n  void SetState(StateId s1, StateId s2, const FilterState &fs) {\n    if (s1_ == s1 && s2_ == s2 && fs == fs_) return;\n    s1_ = s1;\n    s2_ = s2;\n    fs_ = fs;\n    const auto na1 = internal::NumArcs(fst1_, s1);\n    const auto ne1 = internal::NumOutputEpsilons(fst1_, s1);\n    const bool fin1 = internal::Final(fst1_, s1) != Weight::Zero();\n    alleps1_ = na1 == ne1 && !fin1;\n    noeps1_ = ne1 == 0;\n  }\n\n  FilterState FilterArc(Arc *arc1, Arc *arc2) const {\n    if (arc1->olabel == kNoLabel) {\n      return alleps1_ ? FilterState::NoState() : noeps1_ ? FilterState(0)\n                                                         : FilterState(1);\n    } else if (arc2->ilabel == kNoLabel) {\n      return fs_ != FilterState(0) ? FilterState::NoState() : FilterState(0);\n    } else {\n      return arc1->olabel == 0 ? FilterState::NoState() : FilterState(0);\n    }\n  }\n\n  void FilterFinal(Weight *, Weight *) const {}\n\n  Matcher1 *GetMatcher1() { return matcher1_.get(); }\n\n  Matcher2 *GetMatcher2() { return matcher2_.get(); }\n\n  uint64 Properties(uint64 props) const { return props; }\n\n private:\n  std::unique_ptr<Matcher1> matcher1_;\n  std::unique_ptr<Matcher2> matcher2_;\n  const FST1 &fst1_;\n  StateId s1_;      // Current fst1_ state.\n  StateId s2_;      // Current fst2_ state.\n  FilterState fs_;  // Current filter state.\n  bool alleps1_;   // Only epsilons (and non-final) leaving s1_?\n  bool noeps1_;    // No epsilons leaving s1_?\n};\n\n// This filter requires epsilons on FST2 to be read before epsilons on FST1.\ntemplate <class M1, class M2 /* = M1 */>\nclass AltSequenceComposeFilter {\n public:\n  using Matcher1 = M1;\n  using Matcher2 = M2;\n  using FST1 = typename M1::FST;\n  using FST2 = typename M2::FST;\n  using FilterState = CharFilterState;\n\n  using Arc = typename FST1::Arc;\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  AltSequenceComposeFilter(const FST1 &fst1, const FST2 &fst2,\n                           Matcher1 *matcher1 = nullptr,\n                           Matcher2 *matcher2 = nullptr)\n      : matcher1_(matcher1 ? matcher1 : new Matcher1(fst1, MATCH_OUTPUT)),\n        matcher2_(matcher2 ? matcher2 : new Matcher2(fst2, MATCH_INPUT)),\n        fst2_(matcher2_->GetFst()),\n        s1_(kNoStateId),\n        s2_(kNoStateId),\n        fs_(kNoStateId) {}\n\n  AltSequenceComposeFilter(\n      const AltSequenceComposeFilter<Matcher1, Matcher2> &filter,\n      bool safe = false)\n      : matcher1_(filter.matcher1_->Copy(safe)),\n        matcher2_(filter.matcher2_->Copy(safe)),\n        fst2_(matcher2_->GetFst()),\n        s1_(kNoStateId),\n        s2_(kNoStateId),\n        fs_(kNoStateId) {}\n\n  FilterState Start() const { return FilterState(0); }\n\n  void SetState(StateId s1, StateId s2, const FilterState &fs) {\n    if (s1_ == s1 && s2_ == s2 && fs == fs_) return;\n    s1_ = s1;\n    s2_ = s2;\n    fs_ = fs;\n    const auto na2 = internal::NumArcs(fst2_, s2);\n    const auto ne2 = internal::NumInputEpsilons(fst2_, s2);\n    const bool fin2 = internal::Final(fst2_, s2) != Weight::Zero();\n    alleps2_ = na2 == ne2 && !fin2;\n    noeps2_ = ne2 == 0;\n  }\n\n  FilterState FilterArc(Arc *arc1, Arc *arc2) const {\n    if (arc2->ilabel == kNoLabel) {\n      return alleps2_ ? FilterState::NoState() : noeps2_ ? FilterState(0)\n                                                         : FilterState(1);\n    } else if (arc1->olabel == kNoLabel) {\n      return fs_ == FilterState(1) ? FilterState::NoState() : FilterState(0);\n    } else {\n      return arc1->olabel == 0 ? FilterState::NoState() : FilterState(0);\n    }\n  }\n\n  void FilterFinal(Weight *, Weight *) const {}\n\n  Matcher1 *GetMatcher1() { return matcher1_.get(); }\n\n  Matcher2 *GetMatcher2() { return matcher2_.get(); }\n\n  uint64 Properties(uint64 props) const { return props; }\n\n private:\n  std::unique_ptr<Matcher1> matcher1_;\n  std::unique_ptr<Matcher2> matcher2_;\n  const FST2 &fst2_;\n  StateId s1_;      // Current fst1_ state.\n  StateId s2_;      // Current fst2_ state.\n  FilterState fs_;  // Current filter state.\n  bool alleps2_;    // Only epsilons (and non-final) leaving s2_?\n  bool noeps2_;     // No epsilons leaving s2_?\n};\n\n// This filter requires epsilons on FST1 to be matched with epsilons on FST2\n// whenever possible. (Template arg default declared in fst-decl.h.)\ntemplate <class M1, class M2 /* = M1 */>\nclass MatchComposeFilter {\n public:\n  using Matcher1 = M1;\n  using Matcher2 = M2;\n  using FST1 = typename M1::FST;\n  using FST2 = typename M2::FST;\n  using FilterState = CharFilterState;\n\n  using Arc = typename FST1::Arc;\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  MatchComposeFilter(const FST1 &fst1, const FST2 &fst2,\n                     Matcher1 *matcher1 = nullptr, Matcher2 *matcher2 = nullptr)\n      : matcher1_(matcher1 ? matcher1 : new Matcher1(fst1, MATCH_OUTPUT)),\n        matcher2_(matcher2 ? matcher2 : new Matcher2(fst2, MATCH_INPUT)),\n        fst1_(matcher1_->GetFst()),\n        fst2_(matcher2_->GetFst()),\n        s1_(kNoStateId),\n        s2_(kNoStateId),\n        fs_(kNoStateId) {}\n\n  MatchComposeFilter(const MatchComposeFilter<Matcher1, Matcher2> &filter,\n                     bool safe = false)\n      : matcher1_(filter.matcher1_->Copy(safe)),\n        matcher2_(filter.matcher2_->Copy(safe)),\n        fst1_(matcher1_->GetFst()),\n        fst2_(matcher2_->GetFst()),\n        s1_(kNoStateId),\n        s2_(kNoStateId),\n        fs_(kNoStateId) {}\n\n  FilterState Start() const { return FilterState(0); }\n\n  void SetState(StateId s1, StateId s2, const FilterState &fs) {\n    if (s1_ == s1 && s2_ == s2 && fs == fs_) return;\n    s1_ = s1;\n    s2_ = s2;\n    fs_ = fs;\n    size_t na1 = internal::NumArcs(fst1_, s1);\n    size_t ne1 = internal::NumOutputEpsilons(fst1_, s1);\n    bool f1 = internal::Final(fst1_, s1) != Weight::Zero();\n    alleps1_ = na1 == ne1 && !f1;\n    noeps1_ = ne1 == 0;\n    size_t na2 = internal::NumArcs(fst2_, s2);\n    size_t ne2 = internal::NumInputEpsilons(fst2_, s2);\n    bool f2 = internal::Final(fst2_, s2) != Weight::Zero();\n    alleps2_ = na2 == ne2 && !f2;\n    noeps2_ = ne2 == 0;\n  }\n\n  FilterState FilterArc(Arc *arc1, Arc *arc2) const {\n    if (arc2->ilabel == kNoLabel) {  // Epsilon in FST1.\n      return fs_ == FilterState(0)\n                 ? (noeps2_\n                        ? FilterState(0)\n                        : (alleps2_ ? FilterState::NoState() : FilterState(1)))\n                 : (fs_ == FilterState(1) ? FilterState(1)\n                                          : FilterState::NoState());\n    } else if (arc1->olabel == kNoLabel) {  // Epsilon in FST2.\n      return fs_ == FilterState(0)\n                 ? (noeps1_\n                        ? FilterState(0)\n                        : (alleps1_ ? FilterState::NoState() : FilterState(2)))\n                 : (fs_ == FilterState(2) ? FilterState(2)\n                                          : FilterState::NoState());\n    } else if (arc1->olabel == 0) {  // Epsilon in both.\n      return fs_ == FilterState(0) ? FilterState(0) : FilterState::NoState();\n    } else {  // Both are non-epsilons.\n      return FilterState(0);\n    }\n  }\n\n  void FilterFinal(Weight *, Weight *) const {}\n\n  Matcher1 *GetMatcher1() { return matcher1_.get(); }\n\n  Matcher2 *GetMatcher2() { return matcher2_.get(); }\n\n  uint64 Properties(uint64 props) const { return props; }\n\n private:\n  std::unique_ptr<Matcher1> matcher1_;\n  std::unique_ptr<Matcher2> matcher2_;\n  const FST1 &fst1_;\n  const FST2 &fst2_;\n  StateId s1_;      // Current fst1_ state.\n  StateId s2_;      // Current fst2_ state.\n  FilterState fs_;  // Current filter state ID.\n  bool alleps1_;    // Only epsilson (and non-final) leaving s1?\n  bool alleps2_;    // Only epsilons (and non-final) leaving s2?\n  bool noeps1_;     // No epsilons leaving s1?\n  bool noeps2_;     // No epsilons leaving s2?\n};\n\n// This filter works with the MultiEpsMatcher to determine if multi-epsilons are\n// preserved in the composition output (rather than rewritten as 0) and\n// ensures correct properties.\ntemplate <class Filter>\nclass MultiEpsFilter {\n public:\n  using Matcher1 = typename Filter::Matcher1;\n  using Matcher2 = typename Filter::Matcher2;\n  using FST1 = typename Filter::FST1;\n  using FST2 = typename Filter::FST2;\n  using FilterState = typename Filter::FilterState;\n\n  using Arc = typename Filter::Arc;\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  MultiEpsFilter(const FST1 &fst1, const FST2 &fst2,\n                 Matcher1 *matcher1 = nullptr, Matcher2 *matcher2 = nullptr,\n                 bool keep_multi_eps = false)\n      : filter_(fst1, fst2, matcher1, matcher2),\n        keep_multi_eps_(keep_multi_eps) {}\n\n  MultiEpsFilter(const MultiEpsFilter<Filter> &filter, bool safe = false)\n      : filter_(filter.filter_, safe),\n        keep_multi_eps_(filter.keep_multi_eps_) {}\n\n  FilterState Start() const { return filter_.Start(); }\n\n  void SetState(StateId s1, StateId s2, const FilterState &fs) {\n    return filter_.SetState(s1, s2, fs);\n  }\n\n  FilterState FilterArc(Arc *arc1, Arc *arc2) const {\n    const auto fs = filter_.FilterArc(arc1, arc2);\n    if (keep_multi_eps_) {\n      if (arc1->olabel == kNoLabel) arc1->ilabel = arc2->ilabel;\n      if (arc2->ilabel == kNoLabel) arc2->olabel = arc1->olabel;\n    }\n    return fs;\n  }\n\n  void FilterFinal(Weight *w1, Weight *w2) const {\n    return filter_.FilterFinal(w1, w2);\n  }\n\n  Matcher1 *GetMatcher1() { return filter_.GetMatcher1(); }\n\n  Matcher2 *GetMatcher2() { return filter_.GetMatcher2(); }\n\n  uint64 Properties(uint64 iprops) const {\n    const auto oprops = filter_.Properties(iprops);\n    return oprops & kILabelInvariantProperties & kOLabelInvariantProperties;\n  }\n\n private:\n  Filter filter_;\n  bool keep_multi_eps_;\n};\n\n}  // namespace fst\n\n#endif  // FST_COMPOSE_FILTER_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/compose.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Class to compute the composition of two FSTs.\n\n#ifndef FST_COMPOSE_H_\n#define FST_COMPOSE_H_\n\n#include <algorithm>\n\n#include <fst/log.h>\n\n#include <fst/cache.h>\n#include <fst/compose-filter.h>\n#include <fst/fst-decl.h>  // For optional argument declarations\n#include <fst/lookahead-filter.h>\n#include <fst/matcher.h>\n#include <fst/state-table.h>\n#include <fst/test-properties.h>\n\n\nnamespace fst {\n\n// Delayed composition options templated on the arc type, the matcher,\n// the composition filter, and the composition state table.  By\n// default, the matchers, filter, and state table are constructed by\n// composition. If set below, the user can instead pass in these\n// objects; in that case, ComposeFst takes their ownership. This\n// version controls composition implemented between generic Fst<Arc>\n// types and a shared matcher type M for Fst<Arc>. This should be\n// adequate for most applications, giving a reasonable tradeoff\n// between efficiency and code sharing (but see ComposeFstImplOptions).\ntemplate <class Arc, class M = Matcher<Fst<Arc>>,\n          class Filter = SequenceComposeFilter<M>,\n          class StateTable =\n              GenericComposeStateTable<Arc, typename Filter::FilterState>>\nstruct ComposeFstOptions : public CacheOptions {\n  M *matcher1;              // FST1 matcher.\n  M *matcher2;              // FST2 matcher.\n  Filter *filter;           // Composition filter.\n  StateTable *state_table;  // Composition state table.\n\n  explicit ComposeFstOptions(const CacheOptions &opts = CacheOptions(),\n                             M *matcher1 = nullptr, M *matcher2 = nullptr,\n                             Filter *filter = nullptr,\n                             StateTable *state_table = nullptr)\n      : CacheOptions(opts),\n        matcher1(matcher1),\n        matcher2(matcher2),\n        filter(filter),\n        state_table(state_table) {}\n};\n\n// Forward declaration of ComposeFstMatcher.\ntemplate <class C, class F, class T>\nclass ComposeFstMatcher;\n\n// Delayed composition options templated on the two matcher types, the\n// composition filter, the composition state table and the cache store. By\n// default, the matchers, filter, state table and cache store are constructed\n// by composition. If set below, the user can instead pass in these objects; in\n// that case, ComposeFst takes their ownership. This version controls\n// composition implemented using arbitrary matchers (of the same arc type but\n// otherwise arbitrary FST type). The user must ensure the matchers are\n// compatible. These options permit the most efficient use, but shares the\n// least code. This is for advanced use only in the most demanding or\n// specialized applications that can benefit from it; otherwise, prefer\n// ComposeFstOptions).\ntemplate <class M1, class M2, class Filter = SequenceComposeFilter<M1, M2>,\n          class StateTable = GenericComposeStateTable<\n              typename M1::Arc, typename Filter::FilterState>,\n          class CacheStore = DefaultCacheStore<typename M1::Arc>>\nstruct ComposeFstImplOptions : public CacheImplOptions<CacheStore> {\n  M1 *matcher1;    // FST1 matcher (see matcher.h)....\n  M2 *matcher2;    // FST2 matcher.\n  Filter *filter;  // Composition filter (see compose-filter.h).\n  StateTable\n    *state_table;        // Composition state table (see compose-state-table.h).\n  bool own_state_table;   // ComposeFstImpl takes ownership of 'state_table'?\n  bool allow_noncommute;  // Allow non-commutative weights\n\n  explicit ComposeFstImplOptions(const CacheOptions &opts,\n                                 M1 *matcher1 = nullptr, M2 *matcher2 = nullptr,\n                                 Filter *filter = nullptr,\n                                 StateTable *state_table = nullptr)\n      : CacheImplOptions<CacheStore>(opts),\n        matcher1(matcher1),\n        matcher2(matcher2),\n        filter(filter),\n        state_table(state_table),\n        own_state_table(true),\n        allow_noncommute(false) {}\n\n  explicit ComposeFstImplOptions(const CacheImplOptions<CacheStore> &opts,\n                                 M1 *matcher1 = nullptr, M2 *matcher2 = nullptr,\n                                 Filter *filter = nullptr,\n                                 StateTable *state_table = nullptr)\n      : CacheImplOptions<CacheStore>(opts),\n        matcher1(matcher1),\n        matcher2(matcher2),\n        filter(filter),\n        state_table(state_table),\n        own_state_table(true),\n        allow_noncommute(false) {}\n\n  ComposeFstImplOptions()\n      : matcher1(nullptr),\n        matcher2(nullptr),\n        filter(nullptr),\n        state_table(nullptr),\n        own_state_table(true),\n        allow_noncommute(false) {}\n};\n\nnamespace internal {\n\n// Implementation of delayed composition. This base class is common to the\n// variants with different matchers, composition filters and state tables.\ntemplate <class Arc, class CacheStore = DefaultCacheStore<Arc>,\n          class F = ComposeFst<Arc, CacheStore>>\nclass ComposeFstImplBase\n    : public CacheBaseImpl<typename CacheStore::State, CacheStore> {\n public:\n  using FST = F;\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using State = typename CacheStore::State;\n  using CacheImpl = CacheBaseImpl<State, CacheStore>;\n\n  using FstImpl<Arc>::SetType;\n  using FstImpl<Arc>::SetProperties;\n  using FstImpl<Arc>::Properties;\n  using FstImpl<Arc>::SetInputSymbols;\n  using FstImpl<Arc>::SetOutputSymbols;\n\n  using CacheImpl::HasStart;\n  using CacheImpl::HasFinal;\n  using CacheImpl::HasArcs;\n  using CacheImpl::SetFinal;\n  using CacheImpl::SetStart;\n\n  ComposeFstImplBase(const CacheImplOptions<CacheStore> &opts)\n      : CacheImpl(opts) {}\n\n  ComposeFstImplBase(const CacheOptions &opts) : CacheImpl(opts) {}\n\n  ComposeFstImplBase(const ComposeFstImplBase &impl) : CacheImpl(impl, true) {\n    SetType(impl.Type());\n    SetProperties(impl.Properties(), kCopyProperties);\n    SetInputSymbols(impl.InputSymbols());\n    SetOutputSymbols(impl.OutputSymbols());\n  }\n\n  virtual ComposeFstImplBase *Copy() const = 0;\n\n  ~ComposeFstImplBase() override {}\n\n  StateId Start() {\n    if (!HasStart()) {\n      const auto start = ComputeStart();\n      if (start != kNoStateId) SetStart(start);\n    }\n    return CacheImpl::Start();\n  }\n\n  Weight Final(StateId s) {\n    if (!HasFinal(s)) SetFinal(s, ComputeFinal(s));\n    return CacheImpl::Final(s);\n  }\n\n  virtual void Expand(StateId s) = 0;\n\n  size_t NumArcs(StateId s) {\n    if (!HasArcs(s)) Expand(s);\n    return CacheImpl::NumArcs(s);\n  }\n\n  size_t NumInputEpsilons(StateId s) {\n    if (!HasArcs(s)) Expand(s);\n    return CacheImpl::NumInputEpsilons(s);\n  }\n\n  size_t NumOutputEpsilons(StateId s) {\n    if (!HasArcs(s)) Expand(s);\n    return CacheImpl::NumOutputEpsilons(s);\n  }\n\n  void InitArcIterator(StateId s, ArcIteratorData<Arc> *data) {\n    if (!HasArcs(s)) Expand(s);\n    CacheImpl::InitArcIterator(s, data);\n  }\n\n  virtual MatcherBase<Arc> *InitMatcher(const F &fst,\n                                        MatchType match_type) const {\n    // Use the default matcher if no override is provided.\n    return nullptr;\n  }\n\n protected:\n  virtual StateId ComputeStart() = 0;\n  virtual Weight ComputeFinal(StateId s) = 0;\n};\n\n// Implementation of delayed composition templated on the matchers (see\n// matcher.h), composition filter (see compose-filter.h) and the composition\n// state table (see compose-state-table.h).\ntemplate <class CacheStore, class Filter, class StateTable>\nclass ComposeFstImpl\n    : public ComposeFstImplBase<typename CacheStore::Arc, CacheStore> {\n public:\n  using Matcher1 = typename Filter::Matcher1;\n  using Matcher2 = typename Filter::Matcher2;\n\n  using FST1 = typename Matcher1::FST;\n  using FST2 = typename Matcher2::FST;\n\n  using Arc = typename CacheStore::Arc;\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using FilterState = typename Filter::FilterState;\n  using State = typename CacheStore::State;\n\n  using CacheImpl = CacheBaseImpl<State, CacheStore>;\n\n  using StateTuple = typename StateTable::StateTuple;\n\n  friend class ComposeFstMatcher<CacheStore, Filter, StateTable>;\n\n  using FstImpl<Arc>::SetInputSymbols;\n  using FstImpl<Arc>::SetOutputSymbols;\n  using FstImpl<Arc>::SetType;\n  using FstImpl<Arc>::SetProperties;\n\n  template <class M1, class M2>\n  ComposeFstImpl(const FST1 &fst1, const FST2 &fst2,\n                 const ComposeFstImplOptions<M1, M2, Filter, StateTable,\n                                             CacheStore> &opts);\n\n  ComposeFstImpl(const ComposeFstImpl &impl)\n      : ComposeFstImplBase<Arc, CacheStore>(impl),\n        filter_(new Filter(*impl.filter_, true)),\n        matcher1_(filter_->GetMatcher1()),\n        matcher2_(filter_->GetMatcher2()),\n        fst1_(matcher1_->GetFst()),\n        fst2_(matcher2_->GetFst()),\n        state_table_(new StateTable(*impl.state_table_)),\n        own_state_table_(true),\n        match_type_(impl.match_type_) {}\n\n  ~ComposeFstImpl() override {\n    if (own_state_table_) delete state_table_;\n  }\n\n  ComposeFstImpl *Copy() const override { return new ComposeFstImpl(*this); }\n\n  uint64 Properties() const override { return Properties(kFstProperties); }\n\n  // Sets error if found, and returns other FST impl properties.\n  uint64 Properties(uint64 mask) const override {\n    if ((mask & kError) &&\n        (fst1_.Properties(kError, false) || fst2_.Properties(kError, false) ||\n         (matcher1_->Properties(0) & kError) ||\n         (matcher2_->Properties(0) & kError) |\n             (filter_->Properties(0) & kError) ||\n         state_table_->Error())) {\n      SetProperties(kError, kError);\n    }\n    return FstImpl<Arc>::Properties(mask);\n  }\n\n  // Arranges it so that the first arg to OrderedExpand is the Fst\n  // that will be matched on.\n  void Expand(StateId s) override {\n    const auto &tuple = state_table_->Tuple(s);\n    const auto s1 = tuple.StateId1();\n    const auto s2 = tuple.StateId2();\n    filter_->SetState(s1, s2, tuple.GetFilterState());\n    if (MatchInput(s1, s2)) {\n      OrderedExpand(s, fst2_, s2, fst1_, s1, matcher2_, true);\n    } else {\n      OrderedExpand(s, fst1_, s1, fst2_, s2, matcher1_, false);\n    }\n  }\n\n  const FST1 &GetFst1() const { return fst1_; }\n\n  const FST2 &GetFst2() const { return fst2_; }\n\n  const Matcher1 *GetMatcher1() const { return matcher1_; }\n\n  Matcher1 *GetMatcher1() { return matcher1_; }\n\n  const Matcher2 *GetMatcher2() const { return matcher2_; }\n\n  Matcher2 *GetMatcher2() { return matcher2_; }\n\n  const Filter *GetFilter() const { return filter_.get(); }\n\n  Filter *GetFilter() { return filter_.get(); }\n\n  const StateTable *GetStateTable() const { return state_table_; }\n\n  StateTable *GetStateTable() { return state_table_; }\n\n  MatcherBase<Arc> *InitMatcher(const ComposeFst<Arc, CacheStore> &fst,\n                                MatchType match_type) const override {\n    const auto test_props = match_type == MATCH_INPUT\n                                ? kFstProperties & ~kILabelInvariantProperties\n                                : kFstProperties & ~kOLabelInvariantProperties;\n    // If both matchers support 'match_type' and we have a guarantee that a\n    // call to 'filter_->FilterArc(arc1, arc2)' will not modify the ilabel of\n    // arc1 when MATCH_INPUT or the olabel or arc2 when MATCH_OUTPUT, then\n    // ComposeFstMatcher can be used.\n    if ((matcher1_->Type(false) == match_type) &&\n        (matcher2_->Type(false) == match_type) &&\n        (filter_->Properties(test_props) == test_props)) {\n      return new ComposeFstMatcher<\n        CacheStore, Filter, StateTable>(&fst, match_type);\n    }\n    return nullptr;\n  }\n\n private:\n  // This does that actual matching of labels in the composition. The\n  // arguments are ordered so matching is called on state 'sa' of\n  // 'fsta' for each arc leaving state 'sb' of 'fstb'. The 'match_input' arg\n  // determines whether the input or output label of arcs at 'sb' is\n  // the one to match on.\n  template <class FST, class Matcher>\n  void OrderedExpand(StateId s, const Fst<Arc> &, StateId sa, const FST &fstb,\n                     StateId sb, Matcher *matchera, bool match_input) {\n    matchera->SetState(sa);\n    // First processes non-consuming symbols (e.g., epsilons) on FSTA.\n    const Arc loop(match_input ? 0 : kNoLabel, match_input ? kNoLabel : 0,\n                   Weight::One(), sb);\n    MatchArc(s, matchera, loop, match_input);\n    // Then processes matches on FSTB.\n    for (ArcIterator<FST> iterb(fstb, sb); !iterb.Done(); iterb.Next()) {\n      MatchArc(s, matchera, iterb.Value(), match_input);\n    }\n    CacheImpl::SetArcs(s);\n  }\n\n  // Matches a single transition from 'fstb' against 'fata' at 's'.\n  template <class Matcher>\n  void MatchArc(StateId s, Matcher *matchera, const Arc &arc,\n                bool match_input) {\n    if (matchera->Find(match_input ? arc.olabel : arc.ilabel)) {\n      for (; !matchera->Done(); matchera->Next()) {\n        auto arca = matchera->Value();\n        auto arcb = arc;\n        if (match_input) {\n          const auto &fs = filter_->FilterArc(&arcb, &arca);\n          if (fs != FilterState::NoState()) AddArc(s, arcb, arca, fs);\n        } else {\n          const auto &fs = filter_->FilterArc(&arca, &arcb);\n          if (fs != FilterState::NoState()) AddArc(s, arca, arcb, fs);\n        }\n      }\n    }\n  }\n\n  // Add a matching transition at 's'.\n  void AddArc(StateId s, const Arc &arc1, const Arc &arc2,\n              const FilterState &f) {\n    const StateTuple tuple(arc1.nextstate, arc2.nextstate, f);\n    const Arc oarc(arc1.ilabel, arc2.olabel, Times(arc1.weight, arc2.weight),\n                   state_table_->FindState(tuple));\n    CacheImpl::PushArc(s, oarc);\n  }\n\n  StateId ComputeStart() override {\n    const auto s1 = fst1_.Start();\n    if (s1 == kNoStateId) return kNoStateId;\n    const auto s2 = fst2_.Start();\n    if (s2 == kNoStateId) return kNoStateId;\n    const auto &fs = filter_->Start();\n    const StateTuple tuple(s1, s2, fs);\n    return state_table_->FindState(tuple);\n  }\n\n  Weight ComputeFinal(StateId s) override {\n    const auto &tuple = state_table_->Tuple(s);\n    const auto s1 = tuple.StateId1();\n    auto final1 = matcher1_->Final(s1);\n    if (final1 == Weight::Zero()) return final1;\n    const auto s2 = tuple.StateId2();\n    auto final2 = matcher2_->Final(s2);\n    if (final2 == Weight::Zero()) return final2;\n    filter_->SetState(s1, s2, tuple.GetFilterState());\n    filter_->FilterFinal(&final1, &final2);\n    return Times(final1, final2);\n  }\n\n  // Determines which side to match on per composition state.\n  bool MatchInput(StateId s1, StateId s2) {\n    switch (match_type_) {\n      case MATCH_INPUT:\n        return true;\n      case MATCH_OUTPUT:\n        return false;\n      default:  // MATCH_BOTH\n        const auto priority1 = matcher1_->Priority(s1);\n        const auto priority2 = matcher2_->Priority(s2);\n        if (priority1 == kRequirePriority && priority2 == kRequirePriority) {\n          FSTERROR() << \"ComposeFst: Both sides can't require match\";\n          SetProperties(kError, kError);\n          return true;\n        }\n        if (priority1 == kRequirePriority) return false;\n        if (priority2 == kRequirePriority) {\n          return true;\n        }\n        return priority1 <= priority2;\n    }\n  }\n\n  // Identifies and verifies the capabilities of the matcher to be used for\n  // composition.\n  void SetMatchType();\n\n  std::unique_ptr<Filter> filter_;\n  Matcher1 *matcher1_;  // Borrowed reference.\n  Matcher2 *matcher2_;  // Borrowed reference.\n  const FST1 &fst1_;\n  const FST2 &fst2_;\n  StateTable *state_table_;\n  bool own_state_table_;\n\n  MatchType match_type_;\n};\n\ntemplate <class CacheStore, class Filter, class StateTable>\ntemplate <class M1, class M2>\nComposeFstImpl<CacheStore, Filter, StateTable>::ComposeFstImpl(\n    const FST1 &fst1, const FST2 &fst2,\n    const ComposeFstImplOptions<M1, M2, Filter, StateTable, CacheStore> &opts)\n    : ComposeFstImplBase<Arc, CacheStore>(opts),\n      filter_(opts.filter\n                  ? opts.filter\n                  : new Filter(fst1, fst2, opts.matcher1, opts.matcher2)),\n      matcher1_(filter_->GetMatcher1()),\n      matcher2_(filter_->GetMatcher2()),\n      fst1_(matcher1_->GetFst()),\n      fst2_(matcher2_->GetFst()),\n      state_table_(opts.state_table ? opts.state_table\n                                    : new StateTable(fst1_, fst2_)),\n      own_state_table_(opts.state_table ? opts.own_state_table : true) {\n  SetType(\"compose\");\n  if (!CompatSymbols(fst2.InputSymbols(), fst1.OutputSymbols())) {\n    FSTERROR() << \"ComposeFst: Output symbol table of 1st argument \"\n               << \"does not match input symbol table of 2nd argument\";\n    SetProperties(kError, kError);\n  }\n  SetInputSymbols(fst1_.InputSymbols());\n  SetOutputSymbols(fst2_.OutputSymbols());\n  SetMatchType();\n  VLOG(2) << \"ComposeFstImpl: Match type: \" << match_type_;\n  if (match_type_ == MATCH_NONE) SetProperties(kError, kError);\n  const auto fprops1 = fst1.Properties(kFstProperties, false);\n  const auto fprops2 = fst2.Properties(kFstProperties, false);\n  const auto mprops1 = matcher1_->Properties(fprops1);\n  const auto mprops2 = matcher2_->Properties(fprops2);\n  const auto cprops = ComposeProperties(mprops1, mprops2);\n  SetProperties(filter_->Properties(cprops), kCopyProperties);\n  if (state_table_->Error()) SetProperties(kError, kError);\n}\n\ntemplate <class CacheStore, class Filter, class StateTable>\nvoid ComposeFstImpl<CacheStore, Filter, StateTable>::SetMatchType() {\n  // Ensures any required matching is possible and known.\n  if ((matcher1_->Flags() & kRequireMatch) &&\n      matcher1_->Type(true) != MATCH_OUTPUT) {\n    FSTERROR() << \"ComposeFst: 1st argument cannot perform required matching \"\n               << \"(sort?).\";\n    match_type_ = MATCH_NONE;\n    return;\n  }\n  if ((matcher2_->Flags() & kRequireMatch) &&\n      matcher2_->Type(true) != MATCH_INPUT) {\n    FSTERROR() << \"ComposeFst: 2nd argument cannot perform required matching \"\n               << \"(sort?).\";\n    match_type_ = MATCH_NONE;\n    return;\n  }\n  // Finds which sides to match on (favoring minimal testing of capabilities).\n  const auto type1 = matcher1_->Type(false);\n  const auto type2 = matcher2_->Type(false);\n  if (type1 == MATCH_OUTPUT && type2 == MATCH_INPUT) {\n    match_type_ = MATCH_BOTH;\n  } else if (type1 == MATCH_OUTPUT) {\n    match_type_ = MATCH_OUTPUT;\n  } else if (type2 == MATCH_INPUT) {\n    match_type_ = MATCH_INPUT;\n  } else if (matcher1_->Type(true) == MATCH_OUTPUT) {\n    match_type_ = MATCH_OUTPUT;\n  } else if (matcher2_->Type(true) == MATCH_INPUT) {\n    match_type_ = MATCH_INPUT;\n  } else {\n    FSTERROR() << \"ComposeFst: 1st argument cannot match on output labels \"\n               << \"and 2nd argument cannot match on input labels (sort?).\";\n    match_type_ = MATCH_NONE;\n  }\n}\n\n}  // namespace internal\n\n// Computes the composition of two transducers. This version is a delayed FST.\n// If FST1 transduces string x to y with weight a and FST2 transduces y to z\n// with weight b, then their composition transduces string x to z with weight\n// Times(x, z).\n//\n// The output labels of the first transducer or the input labels of the second\n// transducer must be sorted (with the default matcher). The weights need to\n// form a commutative semiring (valid for TropicalWeight and LogWeight).\n//\n// Complexity:\n//\n// Assuming the first FST is unsorted and the second is sorted,\n//\n//   Time: O(v1 v2 d1 (log d2 + m2)),\n//   Space: O(v1 v2)\n//\n// where vi = # of states visited, di = maximum out-degree, and mi the\n// maximum multiplicity of the states visited, for the ith FST. Constant time\n// and space to visit an input state or arc is assumed and exclusive of caching.\n//\n// Caveats:\n// - ComposeFst does not trim its output (since it is a delayed operation).\n// - The efficiency of composition can be strongly affected by several factors:\n//   - the choice of which transducer is sorted - prefer sorting the FST\n//     that has the greater average out-degree.\n//   - the amount of non-determinism\n//   - the presence and location of epsilon transitions - avoid epsilon\n//     transitions on the output side of the first transducer or\n//     the input side of the second transducer or prefer placing\n//     them later in a path since they delay matching and can\n//     introduce non-coaccessible states and transitions.\n//\n// This class attaches interface to implementation and handles reference\n// counting, delegating most methods to ImplToFst. The CacheStore specifies the\n// cache store (default declared in fst-decl.h).\ntemplate <class A, class CacheStore /* = DefaultCacheStore<A> */>\nclass ComposeFst\n    : public ImplToFst<internal::ComposeFstImplBase<A, CacheStore>> {\n public:\n  using Arc = A;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using Store = CacheStore;\n  using State = typename CacheStore::State;\n\n  using Impl = internal::ComposeFstImplBase<A, CacheStore>;\n\n  friend class ArcIterator<ComposeFst<Arc, CacheStore>>;\n  friend class StateIterator<ComposeFst<Arc, CacheStore>>;\n  template <class, class, class> friend class ComposeFstMatcher;\n\n  // Compose specifying only caching options.\n  ComposeFst(const Fst<Arc> &fst1, const Fst<Arc> &fst2,\n             const CacheOptions &opts = CacheOptions())\n      : ImplToFst<Impl>(CreateBase(fst1, fst2, opts)) {}\n\n  // Compose specifying one shared matcher type M. Requires that the input FSTs\n  // and matcher FST types be Fst<Arc>. Recommended for best code-sharing and\n  // matcher compatiblity.\n  template <class Matcher, class Filter, class StateTuple>\n  ComposeFst(const Fst<Arc> &fst1, const Fst<Arc> &fst2,\n             const ComposeFstOptions<Arc, Matcher, Filter, StateTuple> &opts)\n      : ImplToFst<Impl>(CreateBase1(fst1, fst2, opts)) {}\n\n  // Compose specifying two matcher types Matcher1 and Matcher2. Requires input\n  // FST (of the same Arc type, but o.w. arbitrary) match the corresponding\n  // matcher FST types). Recommended only for advanced use in demanding or\n  // specialized applications due to potential code bloat and matcher\n  // incompatibilities.\n  template <class Matcher1, class Matcher2, class Filter, class StateTuple>\n  ComposeFst(const typename Matcher1::FST &fst1,\n             const typename Matcher2::FST &fst2,\n             const ComposeFstImplOptions<Matcher1, Matcher2, Filter, StateTuple,\n                                         CacheStore> &opts)\n      : ImplToFst<Impl>(CreateBase2(fst1, fst2, opts)) {}\n\n  // See Fst<>::Copy() for doc.\n  ComposeFst(const ComposeFst<A, CacheStore> &fst, bool safe = false)\n      : ImplToFst<Impl>(safe ? std::shared_ptr<Impl>(fst.GetImpl()->Copy())\n                             : fst.GetSharedImpl()) {}\n\n  // Get a copy of this ComposeFst. See Fst<>::Copy() for further doc.\n  ComposeFst<A, CacheStore> *Copy(bool safe = false) const override {\n    return new ComposeFst<A, CacheStore>(*this, safe);\n  }\n\n  inline void InitStateIterator(StateIteratorData<Arc> *data) const override;\n\n  void InitArcIterator(StateId s, ArcIteratorData<Arc> *data) const override {\n    GetMutableImpl()->InitArcIterator(s, data);\n  }\n\n  MatcherBase<Arc> *InitMatcher(MatchType match_type) const override {\n    return GetImpl()->InitMatcher(*this, match_type);\n  }\n\n protected:\n  using ImplToFst<Impl>::GetImpl;\n  using ImplToFst<Impl>::GetMutableImpl;\n\n  explicit ComposeFst(std::shared_ptr<Impl> impl) : ImplToFst<Impl>(impl) {}\n\n  // Create compose implementation specifying two matcher types.\n  template <class Matcher1, class Matcher2, class Filter, class StateTuple>\n  static std::shared_ptr<Impl> CreateBase2(\n      const typename Matcher1::FST &fst1, const typename Matcher2::FST &fst2,\n      const ComposeFstImplOptions<Matcher1, Matcher2, Filter, StateTuple,\n                                  CacheStore> &opts) {\n    auto impl = std::make_shared<\n        internal::ComposeFstImpl<CacheStore, Filter, StateTuple>>(fst1, fst2,\n                                                                  opts);\n    if (!(Weight::Properties() & kCommutative) && !opts.allow_noncommute) {\n      const auto props1 = fst1.Properties(kUnweighted, true);\n      const auto props2 = fst2.Properties(kUnweighted, true);\n      if (!(props1 & kUnweighted) && !(props2 & kUnweighted)) {\n        FSTERROR() << \"ComposeFst: Weights must be a commutative semiring: \"\n                   << Weight::Type();\n        impl->SetProperties(kError, kError);\n      }\n    }\n    return impl;\n  }\n\n  // Create compose implementation specifying one matcher type; requires that\n  // input and matcher FST types be Fst<Arc>.\n  template <class Matcher, class Filter, class StateTuple>\n  static std::shared_ptr<Impl> CreateBase1(\n      const Fst<Arc> &fst1, const Fst<Arc> &fst2,\n      const ComposeFstOptions<Arc, Matcher, Filter, StateTuple> &opts) {\n    ComposeFstImplOptions<Matcher, Matcher, Filter, StateTuple, CacheStore>\n        nopts(opts, opts.matcher1, opts.matcher2, opts.filter,\n              opts.state_table);\n    return CreateBase2(fst1, fst2, nopts);\n  }\n\n  // Create compose implementation specifying no matcher type.\n  static std::shared_ptr<Impl> CreateBase(const Fst<Arc> &fst1,\n                                          const Fst<Arc> &fst2,\n                                          const CacheOptions &opts) {\n    switch (LookAheadMatchType(fst1, fst2)) {  // Check for lookahead matchers\n      default:\n      case MATCH_NONE: {  // Default composition (no look-ahead).\n        ComposeFstOptions<Arc> nopts(opts);\n        return CreateBase1(fst1, fst2, nopts);\n      }\n      case MATCH_OUTPUT: {  // Lookahead on fst1.\n        using M = typename DefaultLookAhead<Arc, MATCH_OUTPUT>::FstMatcher;\n        using F = typename DefaultLookAhead<Arc, MATCH_OUTPUT>::ComposeFilter;\n        ComposeFstOptions<Arc, M, F> nopts(opts);\n        return CreateBase1(fst1, fst2, nopts);\n      }\n      case MATCH_INPUT: {  // Lookahead on fst2\n        using M = typename DefaultLookAhead<Arc, MATCH_INPUT>::FstMatcher;\n        using F = typename DefaultLookAhead<Arc, MATCH_INPUT>::ComposeFilter;\n        ComposeFstOptions<Arc, M, F> nopts(opts);\n        return CreateBase1(fst1, fst2, nopts);\n      }\n    }\n  }\n\n private:\n  ComposeFst &operator=(const ComposeFst &fst) = delete;\n};\n\n// Specialization for ComposeFst.\ntemplate <class Arc, class CacheStore>\nclass StateIterator<ComposeFst<Arc, CacheStore>>\n    : public CacheStateIterator<ComposeFst<Arc, CacheStore>> {\n public:\n  explicit StateIterator(const ComposeFst<Arc, CacheStore> &fst)\n      : CacheStateIterator<ComposeFst<Arc, CacheStore>>(fst,\n                                                        fst.GetMutableImpl()) {}\n};\n\n// Specialization for ComposeFst.\ntemplate <class Arc, class CacheStore>\nclass ArcIterator<ComposeFst<Arc, CacheStore>>\n    : public CacheArcIterator<ComposeFst<Arc, CacheStore>> {\n public:\n  using StateId = typename Arc::StateId;\n\n  ArcIterator(const ComposeFst<Arc, CacheStore> &fst, StateId s)\n      : CacheArcIterator<ComposeFst<Arc, CacheStore>>(fst.GetMutableImpl(), s) {\n    if (!fst.GetImpl()->HasArcs(s)) fst.GetMutableImpl()->Expand(s);\n  }\n};\n\ntemplate <class Arc, class CacheStore>\ninline void ComposeFst<Arc, CacheStore>::InitStateIterator(\n    StateIteratorData<Arc> *data) const {\n  data->base = new StateIterator<ComposeFst<Arc, CacheStore>>(*this);\n}\n\n// Specialized matcher for ComposeFst. Supports MATCH_INPUT or MATCH_OUTPUT,\n// iff the underlying matchers for the two FSTS being composed support\n// MATCH_INPUT or MATCH_OUTPUT, respectively.\ntemplate <class CacheStore, class Filter, class StateTable>\nclass ComposeFstMatcher : public MatcherBase<typename CacheStore::Arc> {\n public:\n  using Arc = typename CacheStore::Arc;\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using Matcher1 = typename Filter::Matcher1;\n  using Matcher2 = typename Filter::Matcher2;\n  using FilterState = typename Filter::FilterState;\n\n  using StateTuple = typename StateTable::StateTuple;\n  using Impl = internal::ComposeFstImpl<CacheStore, Filter, StateTable>;\n\n  // The compose FST arg must match the filter and state table types.\n  // This makes a copy of the FST.\n  ComposeFstMatcher(const ComposeFst<Arc, CacheStore> &fst,\n                    MatchType match_type)\n      : owned_fst_(fst.Copy()),\n        fst_(*owned_fst_),\n        impl_(static_cast<const Impl *>(fst_.GetImpl())),\n        s_(kNoStateId),\n        match_type_(match_type),\n        matcher1_(impl_->matcher1_->Copy()),\n        matcher2_(impl_->matcher2_->Copy()),\n        current_loop_(false),\n        loop_(kNoLabel, 0, Weight::One(), kNoStateId) {\n    if (match_type_ == MATCH_OUTPUT) std::swap(loop_.ilabel, loop_.olabel);\n  }\n\n  // The compose FST arg must match the filter and state table types.\n  // This doesn't copy the FST (although it may copy components).\n  ComposeFstMatcher(const ComposeFst<Arc, CacheStore> *fst,\n                    MatchType match_type)\n      : fst_(*fst),\n        impl_(static_cast<const Impl *>(fst_.GetImpl())),\n        s_(kNoStateId),\n        match_type_(match_type),\n        matcher1_(impl_->matcher1_->Copy()),\n        matcher2_(impl_->matcher2_->Copy()),\n        current_loop_(false),\n        loop_(kNoLabel, 0, Weight::One(), kNoStateId) {\n    if (match_type_ == MATCH_OUTPUT) std::swap(loop_.ilabel, loop_.olabel);\n  }\n\n  // This makes a copy of the FST.\n  ComposeFstMatcher(\n      const ComposeFstMatcher<CacheStore, Filter, StateTable> &matcher,\n      bool safe = false)\n      : owned_fst_(matcher.fst_.Copy(safe)),\n        fst_(*owned_fst_),\n        impl_(static_cast<const Impl *>(fst_.GetImpl())),\n        s_(kNoStateId),\n        match_type_(matcher.match_type_),\n        matcher1_(matcher.matcher1_->Copy(safe)),\n        matcher2_(matcher.matcher2_->Copy(safe)),\n        current_loop_(false),\n        loop_(kNoLabel, 0, Weight::One(), kNoStateId) {\n    if (match_type_ == MATCH_OUTPUT) std::swap(loop_.ilabel, loop_.olabel);\n  }\n\n  ComposeFstMatcher<CacheStore, Filter, StateTable> *Copy(\n      bool safe = false) const override {\n    return new ComposeFstMatcher<CacheStore, Filter, StateTable>(*this, safe);\n  }\n\n  MatchType Type(bool test) const override {\n    if ((matcher1_->Type(test) == MATCH_NONE) ||\n        (matcher2_->Type(test) == MATCH_NONE)) {\n      return MATCH_NONE;\n    }\n    if (((matcher1_->Type(test) == MATCH_UNKNOWN) &&\n         (matcher2_->Type(test) == MATCH_UNKNOWN)) ||\n        ((matcher1_->Type(test) == MATCH_UNKNOWN) &&\n         (matcher2_->Type(test) == match_type_)) ||\n        ((matcher1_->Type(test) == match_type_) &&\n         (matcher2_->Type(test) == MATCH_UNKNOWN))) {\n      return MATCH_UNKNOWN;\n    }\n    if ((matcher1_->Type(test) == match_type_) &&\n        (matcher2_->Type(test) == match_type_)) {\n      return match_type_;\n    }\n    return MATCH_NONE;\n  }\n\n  const Fst<Arc> &GetFst() const override { return fst_; }\n\n  uint64 Properties(uint64 inprops) const override {\n    return inprops;\n  }\n\n  void SetState(StateId s) final {\n    if (s_ == s) return;\n    s_ = s;\n    const auto &tuple = impl_->state_table_->Tuple(s);\n    matcher1_->SetState(tuple.StateId1());\n    matcher2_->SetState(tuple.StateId2());\n    loop_.nextstate = s_;\n  }\n\n  bool Find(Label label) final {\n    bool found = false;\n    current_loop_ = false;\n    if (label == 0) {\n      current_loop_ = true;\n      found = true;\n    }\n    if (match_type_ == MATCH_INPUT) {\n      found = found || FindLabel(label, matcher1_.get(), matcher2_.get());\n    } else {  // match_type_ == MATCH_OUTPUT\n      found = found || FindLabel(label, matcher2_.get(), matcher1_.get());\n    }\n    return found;\n  }\n\n  bool Done() const final {\n    return !current_loop_ && matcher1_->Done() && matcher2_->Done();\n  }\n\n  const Arc &Value() const final { return current_loop_ ? loop_ : arc_; }\n\n  void Next() final {\n    if (current_loop_) {\n      current_loop_ = false;\n    } else if (match_type_ == MATCH_INPUT) {\n      FindNext(matcher1_.get(), matcher2_.get());\n    } else {  // match_type_ == MATCH_OUTPUT\n      FindNext(matcher2_.get(), matcher1_.get());\n    }\n  }\n\n  ssize_t Priority(StateId s) final { return fst_.NumArcs(s); }\n\n private:\n  // Processes a match with the filter and creates resulting arc.\n  bool MatchArc(StateId s, Arc arc1,\n                Arc arc2) {  // FIXME(kbg): copy but not assignment.\n    const auto &fs = impl_->filter_->FilterArc(&arc1, &arc2);\n    if (fs == FilterState::NoState()) return false;\n    const StateTuple tuple(arc1.nextstate, arc2.nextstate, fs);\n    arc_.ilabel = arc1.ilabel;\n    arc_.olabel = arc2.olabel;\n    arc_.weight = Times(arc1.weight, arc2.weight);\n    arc_.nextstate = impl_->state_table_->FindState(tuple);\n    return true;\n  }\n\n  // Finds the first match allowed by the filter.\n  template <class MatcherA, class MatcherB>\n  bool FindLabel(Label label, MatcherA *matchera, MatcherB *matcherb) {\n    if (matchera->Find(label)) {\n      matcherb->Find(match_type_ == MATCH_INPUT ? matchera->Value().olabel\n                                                : matchera->Value().ilabel);\n      return FindNext(matchera, matcherb);\n    }\n    return false;\n  }\n\n  // Finds the next match allowed by the filter, returning true iff such a\n  // match is found.\n  template <class MatcherA, class MatcherB>\n  bool FindNext(MatcherA *matchera, MatcherB *matcherb) {\n    // State when entering this function:\n    // 'matchera' is pointed to a match x, y for label x, and a match for y was\n    // requested on 'matcherb'.\n    while (!matchera->Done() || !matcherb->Done()) {\n      if (matcherb->Done()) {\n        // If no more matches for y on 'matcherb', moves forward on 'matchera'\n        // until a match x, y' is found such that there is a match for y' on\n        // 'matcherb'.\n        matchera->Next();\n        while (!matchera->Done() &&\n               !matcherb->Find(match_type_ == MATCH_INPUT\n                                   ? matchera->Value().olabel\n                                   : matchera->Value().ilabel)) {\n          matchera->Next();\n        }\n      }\n      while (!matcherb->Done()) {\n        // 'matchera' is pointing to a match x, y' ('arca') and 'matcherb' is\n        // pointing to a match y', z' ('arcb'). If combining these two arcs is\n        // allowed by the filter (hence resulting in an arc x, z') return true.\n        // Position 'matcherb' on the next potential match for y' before\n        // returning.\n        const auto &arca = matchera->Value();\n        const auto &arcb = matcherb->Value();\n        // Position 'matcherb' on the next potential match for y'.\n        matcherb->Next();\n        // Returns true If combining these two arcs is allowed by the filter\n        // (hence resulting in an arc x, z'); otherwise consider next match\n        // for y' on 'matcherb'.\n        if (MatchArc(s_, match_type_ == MATCH_INPUT ? arca : arcb,\n                     match_type_ == MATCH_INPUT ? arcb : arca)) {\n          return true;\n        }\n      }\n    }\n    // Both 'matchera' and 'matcherb' are done, no more match to analyse.\n    return false;\n  }\n\n  std::unique_ptr<const ComposeFst<Arc, CacheStore>> owned_fst_;\n  const ComposeFst<Arc, CacheStore> &fst_;\n  const Impl *impl_;\n  StateId s_;\n  MatchType match_type_;\n  std::unique_ptr<Matcher1> matcher1_;\n  std::unique_ptr<Matcher2> matcher2_;\n  bool current_loop_;\n  Arc loop_;\n  Arc arc_;\n};\n\n// Useful alias when using StdArc.\nusing StdComposeFst = ComposeFst<StdArc>;\n\nenum ComposeFilter {\n  AUTO_FILTER,\n  NULL_FILTER,\n  TRIVIAL_FILTER,\n  SEQUENCE_FILTER,\n  ALT_SEQUENCE_FILTER,\n  MATCH_FILTER\n};\n\nstruct ComposeOptions {\n  bool connect;               // Connect output?\n  ComposeFilter filter_type;  // Pre-defined filter to use.\n\n  explicit ComposeOptions(bool connect = true,\n                          ComposeFilter filter_type = AUTO_FILTER)\n      : connect(connect), filter_type(filter_type) {}\n};\n\n// Computes the composition of two transducers. This version writes\n// the composed FST into a MutableFst. If FST1 transduces string x to\n// y with weight a and FST2 transduces y to z with weight b, then\n// their composition transduces string x to z with weight\n// Times(x, z).\n//\n// The output labels of the first transducer or the input labels of\n// the second transducer must be sorted.  The weights need to form a\n// commutative semiring (valid for TropicalWeight and LogWeight).\n//\n// Complexity:\n//\n// Assuming the first FST is unsorted and the second is sorted:\n//\n//   Time: O(V1 V2 D1 (log D2 + M2)),\n//   Space: O(V1 V2 D1 M2)\n//\n// where Vi = # of states, Di = maximum out-degree, and Mi is the maximum\n// multiplicity, for the ith FST.\n//\n// Caveats:\n//\n// - Compose trims its output.\n// - The efficiency of composition can be strongly affected by several factors:\n//   - the choice of which transducer is sorted - prefer sorting the FST\n//     that has the greater average out-degree.\n//   - the amount of non-determinism\n//   - the presence and location of epsilon transitions - avoid epsilon\n//     transitions on the output side of the first transducer or\n//     the input side of the second transducer or prefer placing\n//     them later in a path since they delay matching and can\n//     introduce non-coaccessible states and transitions.\ntemplate <class Arc>\nvoid Compose(const Fst<Arc> &ifst1, const Fst<Arc> &ifst2,\n             MutableFst<Arc> *ofst,\n             const ComposeOptions &opts = ComposeOptions()) {\n  using M = Matcher<Fst<Arc>>;\n  // In each case, we cache only the last state for fastest copy.\n  switch (opts.filter_type) {\n    case AUTO_FILTER: {\n      CacheOptions nopts;\n      nopts.gc_limit = 0;\n      *ofst = ComposeFst<Arc>(ifst1, ifst2, nopts);\n      break;\n    }\n    case NULL_FILTER: {\n      ComposeFstOptions<Arc, M, NullComposeFilter<M>> copts;\n      copts.gc_limit = 0;\n      *ofst = ComposeFst<Arc>(ifst1, ifst2, copts);\n      break;\n    }\n    case SEQUENCE_FILTER: {\n      ComposeFstOptions<Arc, M, SequenceComposeFilter<M>> copts;\n      copts.gc_limit = 0;\n      *ofst = ComposeFst<Arc>(ifst1, ifst2, copts);\n      break;\n    }\n    case ALT_SEQUENCE_FILTER: {\n      ComposeFstOptions<Arc, M, AltSequenceComposeFilter<M>> copts;\n      copts.gc_limit = 0;\n      *ofst = ComposeFst<Arc>(ifst1, ifst2, copts);\n      break;\n    }\n    case MATCH_FILTER: {\n      ComposeFstOptions<Arc, M, MatchComposeFilter<M>> copts;\n      copts.gc_limit = 0;\n      *ofst = ComposeFst<Arc>(ifst1, ifst2, copts);\n      break;\n    }\n    case TRIVIAL_FILTER: {\n      ComposeFstOptions<Arc, M, TrivialComposeFilter<M>> copts;\n      copts.gc_limit = 0;\n      *ofst = ComposeFst<Arc>(ifst1, ifst2, copts);\n      break;\n    }\n  }\n  if (opts.connect) Connect(ofst);\n}\n\n}  // namespace fst\n\n#endif  // FST_COMPOSE_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/concat.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Functions and classes to compute the concatenation of two FSTs.\n\n#ifndef FST_CONCAT_H_\n#define FST_CONCAT_H_\n\n#include <algorithm>\n#include <vector>\n\n#include <fst/mutable-fst.h>\n#include <fst/rational.h>\n\n\nnamespace fst {\n\n// Computes the concatenation (product) of two FSTs. If FST1 transduces string\n// x to y with weight a and FST2 transduces string w to v with weight b, then\n// their concatenation transduces string xw to yv with weight Times(a, b).\n//\n// This version modifies its MutableFst argument (in first position).\n//\n// Complexity:\n//\n//   Time: O(V1 + V2 + E2)\n//   Space: O(V1 + V2 + E2)\n//\n// where Vi is the number of states, and Ei is the number of arcs, of the ith\n// FST.\ntemplate <class Arc>\nvoid Concat(MutableFst<Arc> *fst1, const Fst<Arc> &fst2) {\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n  // Checks that the symbol table are compatible.\n  if (!CompatSymbols(fst1->InputSymbols(), fst2.InputSymbols()) ||\n      !CompatSymbols(fst1->OutputSymbols(), fst2.OutputSymbols())) {\n    FSTERROR() << \"Concat: Input/output symbol tables of 1st argument \"\n               << \"does not match input/output symbol tables of 2nd argument\";\n    fst1->SetProperties(kError, kError);\n    return;\n  }\n  const auto props1 = fst1->Properties(kFstProperties, false);\n  const auto props2 = fst2.Properties(kFstProperties, false);\n  const auto start1 = fst1->Start();\n  if (start1 == kNoStateId) {\n    if (props2 & kError) fst1->SetProperties(kError, kError);\n    return;\n  }\n  const auto numstates1 = fst1->NumStates();\n  if (fst2.Properties(kExpanded, false)) {\n    fst1->ReserveStates(numstates1 + CountStates(fst2));\n  }\n  for (StateIterator<Fst<Arc>> siter2(fst2); !siter2.Done(); siter2.Next()) {\n    const auto s1 = fst1->AddState();\n    const auto s2 = siter2.Value();\n    fst1->SetFinal(s1, fst2.Final(s2));\n    fst1->ReserveArcs(s1, fst2.NumArcs(s2));\n    for (ArcIterator<Fst<Arc>> aiter(fst2, s2); !aiter.Done(); aiter.Next()) {\n      auto arc = aiter.Value();\n      arc.nextstate += numstates1;\n      fst1->AddArc(s1, arc);\n    }\n  }\n  const auto start2 = fst2.Start();\n  for (StateId s1 = 0; s1 < numstates1; ++s1) {\n    const auto weight = fst1->Final(s1);\n    if (weight != Weight::Zero()) {\n      fst1->SetFinal(s1, Weight::Zero());\n      if (start2 != kNoStateId) {\n        fst1->AddArc(s1, Arc(0, 0, weight, start2 + numstates1));\n      }\n    }\n  }\n  if (start2 != kNoStateId) {\n    fst1->SetProperties(ConcatProperties(props1, props2), kFstProperties);\n  }\n}\n\n// Computes the concatentation of two FSTs.  This version modifies its\n// MutableFst argument (in second position).\n//\n// Complexity:\n//\n//   Time: O(V1 + E1)\n//   Space: O(V1 + E1)\n//\n// where Vi is the number of states, and Ei is the number of arcs, of the ith\n// FST.\ntemplate <class Arc>\nvoid Concat(const Fst<Arc> &fst1, MutableFst<Arc> *fst2) {\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n  // Checks that the symbol table are compatible.\n  if (!CompatSymbols(fst1.InputSymbols(), fst2->InputSymbols()) ||\n      !CompatSymbols(fst1.OutputSymbols(), fst2->OutputSymbols())) {\n    FSTERROR() << \"Concat: Input/output symbol tables of 1st argument \"\n               << \"does not match input/output symbol tables of 2nd argument\";\n    fst2->SetProperties(kError, kError);\n    return;\n  }\n  const auto props1 = fst1.Properties(kFstProperties, false);\n  const auto props2 = fst2->Properties(kFstProperties, false);\n  const auto start2 = fst2->Start();\n  if (start2 == kNoStateId) {\n    if (props1 & kError) fst2->SetProperties(kError, kError);\n    return;\n  }\n  const auto numstates2 = fst2->NumStates();\n  if (fst1.Properties(kExpanded, false)) {\n    fst2->ReserveStates(numstates2 + CountStates(fst1));\n  }\n  for (StateIterator<Fst<Arc>> siter(fst1); !siter.Done(); siter.Next()) {\n    const auto s1 = siter.Value();\n    const auto s2 = fst2->AddState();\n    const auto weight = fst1.Final(s1);\n    if (weight != Weight::Zero()) {\n      fst2->ReserveArcs(s2, fst1.NumArcs(s1) + 1);\n      fst2->AddArc(s2, Arc(0, 0, weight, start2));\n    } else {\n      fst2->ReserveArcs(s2, fst1.NumArcs(s1));\n    }\n    for (ArcIterator<Fst<Arc>> aiter(fst1, s1); !aiter.Done(); aiter.Next()) {\n      auto arc = aiter.Value();\n      arc.nextstate += numstates2;\n      fst2->AddArc(s2, arc);\n    }\n  }\n  const auto start1 = fst1.Start();\n  if (start1 != kNoStateId) {\n    fst2->SetStart(start1 + numstates2);\n    fst2->SetProperties(ConcatProperties(props1, props2), kFstProperties);\n  } else {\n    fst2->SetStart(fst2->AddState());\n  }\n}\n\n// Computes the concatentation of two FSTs. This version modifies its\n// RationalFst input (in first position).\ntemplate <class Arc>\nvoid Concat(RationalFst<Arc> *fst1, const Fst<Arc> &fst2) {\n  fst1->GetMutableImpl()->AddConcat(fst2, true);\n}\n\n// Computes the concatentation of two FSTs. This version modifies its\n// RationalFst input (in second position).\ntemplate <class Arc>\nvoid Concat(const Fst<Arc> &fst1, RationalFst<Arc> *fst2) {\n  fst2->GetMutableImpl()->AddConcat(fst1, false);\n}\n\nusing ConcatFstOptions = RationalFstOptions;\n\n// Computes the concatenation (product) of two FSTs; this version is a delayed\n// FST. If FST1 transduces string x to y with weight a and FST2 transduces\n// string w to v with weight b, then their concatenation transduces string xw\n// to yv with Times(a, b).\n//\n// Complexity:\n//\n//   Time: O(v1 + e1 + v2 + e2),\n//   Space: O(v1 + v2)\n//\n// where vi is the number of states visited, and ei is the number of arcs\n// visited, of the ith FST. Constant time and space to visit an input state or\n// arc is assumed and exclusive of caching.\ntemplate <class A>\nclass ConcatFst : public RationalFst<A> {\n public:\n  using Arc = A;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  ConcatFst(const Fst<Arc> &fst1, const Fst<Arc> &fst2) {\n    GetMutableImpl()->InitConcat(fst1, fst2);\n  }\n\n  ConcatFst(const Fst<Arc> &fst1, const Fst<Arc> &fst2,\n            const ConcatFstOptions &opts)\n      : RationalFst<Arc>(opts) {\n    GetMutableImpl()->InitConcat(fst1, fst2);\n  }\n\n  // See Fst<>::Copy() for doc.\n  ConcatFst(const ConcatFst<Arc> &fst, bool safe = false)\n      : RationalFst<Arc>(fst, safe) {}\n\n  // Get a copy of this ConcatFst. See Fst<>::Copy() for further doc.\n  ConcatFst<Arc> *Copy(bool safe = false) const override {\n    return new ConcatFst<Arc>(*this, safe);\n  }\n\n private:\n  using ImplToFst<internal::RationalFstImpl<Arc>>::GetImpl;\n  using ImplToFst<internal::RationalFstImpl<Arc>>::GetMutableImpl;\n};\n\n// Specialization for ConcatFst.\ntemplate <class Arc>\nclass StateIterator<ConcatFst<Arc>> : public StateIterator<RationalFst<Arc>> {\n public:\n  explicit StateIterator(const ConcatFst<Arc> &fst)\n      : StateIterator<RationalFst<Arc>>(fst) {}\n};\n\n// Specialization for ConcatFst.\ntemplate <class Arc>\nclass ArcIterator<ConcatFst<Arc>> : public ArcIterator<RationalFst<Arc>> {\n public:\n  using StateId = typename Arc::StateId;\n\n  ArcIterator(const ConcatFst<Arc> &fst, StateId s)\n      : ArcIterator<RationalFst<Arc>>(fst, s) {}\n};\n\n// Useful alias when using StdArc.\nusing StdConcatFst = ConcatFst<StdArc>;\n\n}  // namespace fst\n\n#endif  // FST_CONCAT_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/config.h",
    "content": "/* src/include/fst/config.h.  Generated from config.h.in by configure.  */\n// OpenFst config file \n\n/* Define to 1 if you have the ICU library. */\n/* #undef HAVE_ICU */\n\n/* Define to 1 if the system has the type `std::tr1::hash<long long\n   unsigned>'. */\n#define HAVE_STD__TR1__HASH_LONG_LONG_UNSIGNED_ 1\n\n/* Define to 1 if the system has the type `__gnu_cxx::slist<int>'. */\n#define HAVE___GNU_CXX__SLIST_INT_ 1\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/config.h.in",
    "content": "// OpenFst config file \n\n/* Define to 1 if you have the ICU library. */\n#undef HAVE_ICU\n\n/* Define to 1 if the system has the type `std::tr1::hash<long long\n   unsigned>'. */\n#define HAVE_STD__TR1__HASH_LONG_LONG_UNSIGNED_ 1\n\n/* Define to 1 if the system has the type `__gnu_cxx::slist<int>'. */\n#define HAVE___GNU_CXX__SLIST_INT_ 1\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/connect.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Classes and functions to remove unsuccessful paths from an FST.\n\n#ifndef FST_CONNECT_H_\n#define FST_CONNECT_H_\n\n#include <vector>\n\n#include <fst/dfs-visit.h>\n#include <fst/mutable-fst.h>\n#include <fst/union-find.h>\n\n\nnamespace fst {\n\n// Finds and returns connected components. Use with Visit().\ntemplate <class Arc>\nclass CcVisitor {\n public:\n  using Weight = typename Arc::Weight;\n  using StateId = typename Arc::StateId;\n\n  // cc[i]: connected component number for state i.\n  explicit CcVisitor(std::vector<StateId> *cc)\n      : comps_(new UnionFind<StateId>(0, kNoStateId)), cc_(cc), nstates_(0) {}\n\n  // comps: connected components equiv classes.\n  explicit CcVisitor(UnionFind<StateId> *comps)\n      : comps_(comps), cc_(nullptr), nstates_(0) {}\n\n  ~CcVisitor() {\n    if (cc_) delete comps_;\n  }\n\n  void InitVisit(const Fst<Arc> &fst) {}\n\n  bool InitState(StateId s, StateId root) {\n    ++nstates_;\n    if (comps_->FindSet(s) == kNoStateId) comps_->MakeSet(s);\n    return true;\n  }\n\n  bool WhiteArc(StateId s, const Arc &arc) {\n    comps_->MakeSet(arc.nextstate);\n    comps_->Union(s, arc.nextstate);\n    return true;\n  }\n\n  bool GreyArc(StateId s, const Arc &arc) {\n    comps_->Union(s, arc.nextstate);\n    return true;\n  }\n\n  bool BlackArc(StateId s, const Arc &arc) {\n    comps_->Union(s, arc.nextstate);\n    return true;\n  }\n\n  void FinishState(StateId s) {}\n\n  void FinishVisit() {\n    if (cc_) GetCcVector(cc_);\n  }\n\n  // Returns number of components.\n  // cc[i]: connected component number for state i.\n  int GetCcVector(std::vector<StateId> *cc) {\n    cc->clear();\n    cc->resize(nstates_, kNoStateId);\n    StateId ncomp = 0;\n    for (StateId s = 0; s < nstates_; ++s) {\n      const auto rep = comps_->FindSet(s);\n      auto &comp = (*cc)[rep];\n      if (comp == kNoStateId) {\n        comp = ncomp;\n        ++ncomp;\n      }\n      (*cc)[s] = comp;\n    }\n    return ncomp;\n  }\n\n private:\n  UnionFind<StateId> *comps_;  // Components.\n  std::vector<StateId> *cc_;   // State's cc number.\n  StateId nstates_;            // State count.\n};\n\n// Finds and returns strongly-connected components, accessible and\n// coaccessible states and related properties. Uses Tarjan's single\n// DFS SCC algorithm (see Aho, et al, \"Design and Analysis of Computer\n// Algorithms\", 189pp). Use with DfsVisit();\ntemplate <class Arc>\nclass SccVisitor {\n public:\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  // scc[i]: strongly-connected component number for state i.\n  //   SCC numbers will be in topological order for acyclic input.\n  // access[i]: accessibility of state i.\n  // coaccess[i]: coaccessibility of state i.\n  // Any of above can be NULL.\n  // props: related property bits (cyclicity, initial cyclicity,\n  //   accessibility, coaccessibility) set/cleared (o.w. unchanged).\n  SccVisitor(std::vector<StateId> *scc, std::vector<bool> *access,\n             std::vector<bool> *coaccess, uint64 *props)\n      : scc_(scc), access_(access), coaccess_(coaccess), props_(props) {}\n  explicit SccVisitor(uint64 *props)\n      : scc_(nullptr), access_(nullptr), coaccess_(nullptr), props_(props) {}\n\n  void InitVisit(const Fst<Arc> &fst);\n\n  bool InitState(StateId s, StateId root);\n\n  bool TreeArc(StateId s, const Arc &arc) { return true; }\n\n  bool BackArc(StateId s, const Arc &arc) {\n    const auto t = arc.nextstate;\n    if ((*dfnumber_)[t] < (*lowlink_)[s]) (*lowlink_)[s] = (*dfnumber_)[t];\n    if ((*coaccess_)[t]) (*coaccess_)[s] = true;\n    *props_ |= kCyclic;\n    *props_ &= ~kAcyclic;\n    if (t == start_) {\n      *props_ |= kInitialCyclic;\n      *props_ &= ~kInitialAcyclic;\n    }\n    return true;\n  }\n\n  bool ForwardOrCrossArc(StateId s, const Arc &arc) {\n    const auto t = arc.nextstate;\n    if ((*dfnumber_)[t] < (*dfnumber_)[s] /* cross edge */ && (*onstack_)[t] &&\n        (*dfnumber_)[t] < (*lowlink_)[s]) {\n      (*lowlink_)[s] = (*dfnumber_)[t];\n    }\n    if ((*coaccess_)[t]) (*coaccess_)[s] = true;\n    return true;\n  }\n\n  // Last argument always ignored, but required by the interface.\n  void FinishState(StateId state, StateId p, const Arc *);\n\n  void FinishVisit() {\n    // Numbers SCCs in topological order when acyclic.\n    if (scc_) {\n      for (StateId s = 0; s < scc_->size(); ++s) {\n        (*scc_)[s] = nscc_ - 1 - (*scc_)[s];\n      }\n    }\n    if (coaccess_internal_) delete coaccess_;\n    dfnumber_.reset();\n    lowlink_.reset();\n    onstack_.reset();\n    scc_stack_.reset();\n  }\n\n private:\n  std::vector<StateId> *scc_;    // State's scc number.\n  std::vector<bool> *access_;    // State's accessibility.\n  std::vector<bool> *coaccess_;  // State's coaccessibility.\n  uint64 *props_;\n  const Fst<Arc> *fst_;\n  StateId start_;\n  StateId nstates_;  // State count.\n  StateId nscc_;     // SCC count.\n  bool coaccess_internal_;\n  std::unique_ptr<std::vector<StateId>> dfnumber_;  // State discovery times.\n  std::unique_ptr<std::vector<StateId>>\n      lowlink_;  // lowlink[state] == dfnumber[state] => SCC root\n  std::unique_ptr<std::vector<bool>> onstack_;  // Is a state on the SCC stack?\n  std::unique_ptr<std::vector<StateId>>\n      scc_stack_;  // SCC stack, with random access.\n};\n\ntemplate <class Arc>\ninline void SccVisitor<Arc>::InitVisit(const Fst<Arc> &fst) {\n  if (scc_) scc_->clear();\n  if (access_) access_->clear();\n  if (coaccess_) {\n    coaccess_->clear();\n    coaccess_internal_ = false;\n  } else {\n    coaccess_ = new std::vector<bool>;\n    coaccess_internal_ = true;\n  }\n  *props_ |= kAcyclic | kInitialAcyclic | kAccessible | kCoAccessible;\n  *props_ &= ~(kCyclic | kInitialCyclic | kNotAccessible | kNotCoAccessible);\n  fst_ = &fst;\n  start_ = fst.Start();\n  nstates_ = 0;\n  nscc_ = 0;\n  dfnumber_.reset(new std::vector<StateId>());\n  lowlink_.reset(new std::vector<StateId>());\n  onstack_.reset(new std::vector<bool>());\n  scc_stack_.reset(new std::vector<StateId>());\n}\n\ntemplate <class Arc>\ninline bool SccVisitor<Arc>::InitState(StateId s, StateId root) {\n  scc_stack_->push_back(s);\n  while (dfnumber_->size() <= s) {\n    if (scc_) scc_->push_back(-1);\n    if (access_) access_->push_back(false);\n    coaccess_->push_back(false);\n    dfnumber_->push_back(-1);\n    lowlink_->push_back(-1);\n    onstack_->push_back(false);\n  }\n  (*dfnumber_)[s] = nstates_;\n  (*lowlink_)[s] = nstates_;\n  (*onstack_)[s] = true;\n  if (root == start_) {\n    if (access_) (*access_)[s] = true;\n  } else {\n    if (access_) (*access_)[s] = false;\n    *props_ |= kNotAccessible;\n    *props_ &= ~kAccessible;\n  }\n  ++nstates_;\n  return true;\n}\n\ntemplate <class Arc>\ninline void SccVisitor<Arc>::FinishState(StateId s, StateId p, const Arc *) {\n  if (fst_->Final(s) != Weight::Zero()) (*coaccess_)[s] = true;\n  if ((*dfnumber_)[s] == (*lowlink_)[s]) {  // Root of new SCC.\n    bool scc_coaccess = false;\n    auto i = scc_stack_->size();\n    StateId t;\n    do {\n      t = (*scc_stack_)[--i];\n      if ((*coaccess_)[t]) scc_coaccess = true;\n    } while (s != t);\n    do {\n      t = scc_stack_->back();\n      if (scc_) (*scc_)[t] = nscc_;\n      if (scc_coaccess) (*coaccess_)[t] = true;\n      (*onstack_)[t] = false;\n      scc_stack_->pop_back();\n    } while (s != t);\n    if (!scc_coaccess) {\n      *props_ |= kNotCoAccessible;\n      *props_ &= ~kCoAccessible;\n    }\n    ++nscc_;\n  }\n  if (p != kNoStateId) {\n    if ((*coaccess_)[s]) (*coaccess_)[p] = true;\n    if ((*lowlink_)[s] < (*lowlink_)[p]) (*lowlink_)[p] = (*lowlink_)[s];\n  }\n}\n\n// Trims an FST, removing states and arcs that are not on successful paths.\n// This version modifies its input.\n//\n// Complexity:\n//\n//   Time:  O(V + E)\n//   Space: O(V + E)\n//\n// where V = # of states and E = # of arcs.\ntemplate <class Arc>\nvoid Connect(MutableFst<Arc> *fst) {\n  using StateId = typename Arc::StateId;\n  std::vector<bool> access;\n  std::vector<bool> coaccess;\n  uint64 props = 0;\n  SccVisitor<Arc> scc_visitor(nullptr, &access, &coaccess, &props);\n  DfsVisit(*fst, &scc_visitor);\n  std::vector<StateId> dstates;\n  for (StateId s = 0; s < access.size(); ++s) {\n    if (!access[s] || !coaccess[s]) dstates.push_back(s);\n  }\n  fst->DeleteStates(dstates);\n  fst->SetProperties(kAccessible | kCoAccessible, kAccessible | kCoAccessible);\n}\n\n// Returns an acyclic FST where each SCC in the input FST has been condensed to\n// a single state with transitions between SCCs retained and within SCCs\n// dropped. Also populates 'scc' with a mapping from input to output states.\ntemplate <class Arc>\nvoid Condense(const Fst<Arc> &ifst, MutableFst<Arc> *ofst,\n              std::vector<typename Arc::StateId> *scc) {\n  using StateId = typename Arc::StateId;\n  ofst->DeleteStates();\n  uint64 props = 0;\n  SccVisitor<Arc> scc_visitor(scc, nullptr, nullptr, &props);\n  DfsVisit(ifst, &scc_visitor);\n  for (StateId s = 0; s < scc->size(); ++s) {\n    const auto c = (*scc)[s];\n    while (c >= ofst->NumStates()) ofst->AddState();\n    if (s == ifst.Start()) ofst->SetStart(c);\n    const auto weight = ifst.Final(s);\n    if (weight != Arc::Weight::Zero())\n      ofst->SetFinal(c, Plus(ofst->Final(c), weight));\n    for (ArcIterator<Fst<Arc>> aiter(ifst, s); !aiter.Done(); aiter.Next()) {\n      auto arc = aiter.Value();\n      const auto nextc = (*scc)[arc.nextstate];\n      if (nextc != c) {\n        while (nextc >= ofst->NumStates()) ofst->AddState();\n        arc.nextstate = nextc;\n        ofst->AddArc(c, arc);\n      }\n    }\n  }\n  ofst->SetProperties(kAcyclic | kInitialAcyclic, kAcyclic | kInitialAcyclic);\n}\n\n}  // namespace fst\n\n#endif  // FST_CONNECT_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/const-fst.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Simple concrete immutable FST whose states and arcs are each stored in\n// single arrays.\n\n#ifndef FST_CONST_FST_H_\n#define FST_CONST_FST_H_\n\n#include <climits>\n#include <string>\n#include <vector>\n\n// Google-only...\n// ...Google-only\n#include <fst/log.h>\n\n#include <fst/expanded-fst.h>\n#include <fst/fst-decl.h>\n#include <fst/mapped-file.h>\n#include <fst/test-properties.h>\n#include <fst/util.h>\n\n\nnamespace fst {\n\ntemplate <class A, class Unsigned>\nclass ConstFst;\n\ntemplate <class F, class G>\nvoid Cast(const F &, G *);\n\nnamespace internal {\n\n// States and arcs each implemented by single arrays, templated on the\n// Arc definition. Unsigned is used to represent indices into the arc array.\ntemplate <class A, class Unsigned>\nclass ConstFstImpl : public FstImpl<A> {\n public:\n  using Arc = A;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using FstImpl<A>::SetInputSymbols;\n  using FstImpl<A>::SetOutputSymbols;\n  using FstImpl<A>::SetType;\n  using FstImpl<A>::SetProperties;\n  using FstImpl<A>::Properties;\n\n  ConstFstImpl()\n      : states_(nullptr),\n        arcs_(nullptr),\n        nstates_(0),\n        narcs_(0),\n        start_(kNoStateId) {\n    string type = \"const\";\n    if (sizeof(Unsigned) != sizeof(uint32)) {\n      type += std::to_string(CHAR_BIT * sizeof(Unsigned));\n    }\n    SetType(type);\n    SetProperties(kNullProperties | kStaticProperties);\n  }\n\n  explicit ConstFstImpl(const Fst<Arc> &fst);\n\n  StateId Start() const { return start_; }\n\n  Weight Final(StateId s) const { return states_[s].weight; }\n\n  StateId NumStates() const { return nstates_; }\n\n  size_t NumArcs(StateId s) const { return states_[s].narcs; }\n\n  size_t NumInputEpsilons(StateId s) const { return states_[s].niepsilons; }\n\n  size_t NumOutputEpsilons(StateId s) const { return states_[s].noepsilons; }\n\n  static ConstFstImpl<Arc, Unsigned> *Read(std::istream &strm,\n                                           const FstReadOptions &opts);\n\n  const Arc *Arcs(StateId s) const { return arcs_ + states_[s].pos; }\n\n  // Provide information needed for generic state iterator.\n  void InitStateIterator(StateIteratorData<Arc> *data) const {\n    data->base = nullptr;\n    data->nstates = nstates_;\n  }\n\n  // Provide information needed for the generic arc iterator.\n  void InitArcIterator(StateId s, ArcIteratorData<Arc> *data) const {\n    data->base = nullptr;\n    data->arcs = arcs_ + states_[s].pos;\n    data->narcs = states_[s].narcs;\n    data->ref_count = nullptr;\n  }\n\n private:\n  // Used to find narcs_ and nstates_ in Write.\n  friend class ConstFst<Arc, Unsigned>;\n\n  // States implemented by array *states_ below, arcs by (single) *arcs_.\n  struct ConstState {\n    Weight weight;        // Final weight.\n    Unsigned pos;         // Start of state's arcs in *arcs_.\n    Unsigned narcs;       // Number of arcs (per state).\n    Unsigned niepsilons;  // Number of input epsilons.\n    Unsigned noepsilons;  // Number of output epsilons.\n\n    ConstState() : weight(Weight::Zero()) {}\n  };\n\n  // Properties always true of this FST class.\n  static constexpr uint64 kStaticProperties = kExpanded;\n  // Current unaligned file format version. The unaligned version was added and\n  // made the default since the aligned version does not work on pipes.\n  static constexpr int kFileVersion = 2;\n  // Current aligned file format version.\n  static constexpr int kAlignedFileVersion = 1;\n  // Minimum file format version supported.\n  static constexpr int kMinFileVersion = 1;\n\n  std::unique_ptr<MappedFile> states_region_;  // Mapped file for states.\n  std::unique_ptr<MappedFile> arcs_region_;    // Mapped file for arcs.\n  ConstState *states_;                         // States representation.\n  Arc *arcs_;                                  // Arcs representation.\n  StateId nstates_;                            // Number of states.\n  size_t narcs_;                               // Number of arcs.\n  StateId start_;                              // Initial state.\n\n  ConstFstImpl(const ConstFstImpl &) = delete;\n  ConstFstImpl &operator=(const ConstFstImpl &) = delete;\n};\n\ntemplate <class Arc, class Unsigned>\nconstexpr uint64 ConstFstImpl<Arc, Unsigned>::kStaticProperties;\n\ntemplate <class Arc, class Unsigned>\nconstexpr int ConstFstImpl<Arc, Unsigned>::kFileVersion;\n\ntemplate <class Arc, class Unsigned>\nconstexpr int ConstFstImpl<Arc, Unsigned>::kAlignedFileVersion;\n\ntemplate <class Arc, class Unsigned>\nconstexpr int ConstFstImpl<Arc, Unsigned>::kMinFileVersion;\n\ntemplate <class Arc, class Unsigned>\nConstFstImpl<Arc, Unsigned>::ConstFstImpl(const Fst<Arc> &fst)\n    : nstates_(0), narcs_(0) {\n  string type = \"const\";\n  if (sizeof(Unsigned) != sizeof(uint32)) {\n    type += std::to_string(CHAR_BIT * sizeof(Unsigned));\n  }\n  SetType(type);\n  SetInputSymbols(fst.InputSymbols());\n  SetOutputSymbols(fst.OutputSymbols());\n  start_ = fst.Start();\n  // Counts states and arcs.\n  for (StateIterator<Fst<Arc>> siter(fst); !siter.Done(); siter.Next()) {\n    ++nstates_;\n    for (ArcIterator<Fst<Arc>> aiter(fst, siter.Value()); !aiter.Done();\n         aiter.Next()) {\n      ++narcs_;\n    }\n  }\n  states_region_.reset(MappedFile::Allocate(nstates_ * sizeof(*states_)));\n  arcs_region_.reset(MappedFile::Allocate(narcs_ * sizeof(*arcs_)));\n  states_ = reinterpret_cast<ConstState *>(states_region_->mutable_data());\n  arcs_ = reinterpret_cast<Arc *>(arcs_region_->mutable_data());\n  size_t pos = 0;\n  for (StateId s = 0; s < nstates_; ++s) {\n    states_[s].weight = fst.Final(s);\n    states_[s].pos = pos;\n    states_[s].narcs = 0;\n    states_[s].niepsilons = 0;\n    states_[s].noepsilons = 0;\n    for (ArcIterator<Fst<Arc>> aiter(fst, s); !aiter.Done(); aiter.Next()) {\n      const auto &arc = aiter.Value();\n      ++states_[s].narcs;\n      if (arc.ilabel == 0) ++states_[s].niepsilons;\n      if (arc.olabel == 0) ++states_[s].noepsilons;\n      arcs_[pos] = arc;\n      ++pos;\n    }\n  }\n  const auto props =\n      fst.Properties(kMutable, false)\n          ? fst.Properties(kCopyProperties, true)\n          : CheckProperties(\n                fst, kCopyProperties & ~kWeightedCycles & ~kUnweightedCycles,\n                kCopyProperties);\n  SetProperties(props | kStaticProperties);\n}\n\ntemplate <class Arc, class Unsigned>\nConstFstImpl<Arc, Unsigned> *ConstFstImpl<Arc, Unsigned>::Read(\n    std::istream &strm, const FstReadOptions &opts) {\n  using ConstState = typename ConstFstImpl<Arc, Unsigned>::ConstState;\n  std::unique_ptr<ConstFstImpl<Arc, Unsigned>> impl(\n      new ConstFstImpl<Arc, Unsigned>());\n  FstHeader hdr;\n  if (!impl->ReadHeader(strm, opts, kMinFileVersion, &hdr)) return nullptr;\n  impl->start_ = hdr.Start();\n  impl->nstates_ = hdr.NumStates();\n  impl->narcs_ = hdr.NumArcs();\n  // Ensures compatibility.\n  if (hdr.Version() == kAlignedFileVersion) {\n    hdr.SetFlags(hdr.GetFlags() | FstHeader::IS_ALIGNED);\n  }\n  if ((hdr.GetFlags() & FstHeader::IS_ALIGNED) && !AlignInput(strm)) {\n    LOG(ERROR) << \"ConstFst::Read: Alignment failed: \" << opts.source;\n    return nullptr;\n  }\n  size_t b = impl->nstates_ * sizeof(ConstState);\n  impl->states_region_.reset(\n      MappedFile::Map(&strm, opts.mode == FstReadOptions::MAP, opts.source, b));\n  if (!strm || !impl->states_region_) {\n    LOG(ERROR) << \"ConstFst::Read: Read failed: \" << opts.source;\n    return nullptr;\n  }\n  impl->states_ =\n      reinterpret_cast<ConstState *>(impl->states_region_->mutable_data());\n  if ((hdr.GetFlags() & FstHeader::IS_ALIGNED) && !AlignInput(strm)) {\n    LOG(ERROR) << \"ConstFst::Read: Alignment failed: \" << opts.source;\n    return nullptr;\n  }\n  b = impl->narcs_ * sizeof(Arc);\n  impl->arcs_region_.reset(\n      MappedFile::Map(&strm, opts.mode == FstReadOptions::MAP, opts.source, b));\n  if (!strm || !impl->arcs_region_) {\n    LOG(ERROR) << \"ConstFst::Read: Read failed: \" << opts.source;\n    return nullptr;\n  }\n  impl->arcs_ = reinterpret_cast<Arc *>(impl->arcs_region_->mutable_data());\n  return impl.release();\n}\n\n}  // namespace internal\n\n// Simple concrete immutable FST. This class attaches interface to\n// implementation and handles reference counting, delegating most methods to\n// ImplToExpandedFst. The unsigned type U is used to represent indices into the\n// arc array (default declared in fst-decl.h).\ntemplate <class A, class Unsigned>\nclass ConstFst : public ImplToExpandedFst<internal::ConstFstImpl<A, Unsigned>> {\n public:\n  using Arc = A;\n  using StateId = typename Arc::StateId;\n\n  using Impl = internal::ConstFstImpl<A, Unsigned>;\n  using ConstState = typename Impl::ConstState;\n\n  friend class StateIterator<ConstFst<Arc, Unsigned>>;\n  friend class ArcIterator<ConstFst<Arc, Unsigned>>;\n\n  template <class F, class G>\n  void friend Cast(const F &, G *);\n\n  ConstFst() : ImplToExpandedFst<Impl>(std::make_shared<Impl>()) {}\n\n  explicit ConstFst(const Fst<Arc> &fst)\n      : ImplToExpandedFst<Impl>(std::make_shared<Impl>(fst)) {}\n\n  ConstFst(const ConstFst<A, Unsigned> &fst, bool safe = false)\n      : ImplToExpandedFst<Impl>(fst) {}\n\n  // Gets a copy of this ConstFst. See Fst<>::Copy() for further doc.\n  ConstFst<A, Unsigned> *Copy(bool safe = false) const override {\n    return new ConstFst<A, Unsigned>(*this, safe);\n  }\n\n  // Reads a ConstFst from an input stream, returning nullptr on error.\n  static ConstFst<A, Unsigned> *Read(std::istream &strm,\n                                     const FstReadOptions &opts) {\n    auto *impl = Impl::Read(strm, opts);\n    return impl ? new ConstFst<A, Unsigned>(std::shared_ptr<Impl>(impl))\n                : nullptr;\n  }\n\n  // Read a ConstFst from a file; return nullptr on error; empty filename reads\n  // from standard input.\n  static ConstFst<A, Unsigned> *Read(const string &filename) {\n    auto *impl = ImplToExpandedFst<Impl>::Read(filename);\n    return impl ? new ConstFst<A, Unsigned>(std::shared_ptr<Impl>(impl))\n                : nullptr;\n  }\n\n  bool Write(std::ostream &strm, const FstWriteOptions &opts) const override {\n    return WriteFst(*this, strm, opts);\n  }\n\n  bool Write(const string &filename) const override {\n    return Fst<Arc>::WriteFile(filename);\n  }\n\n  template <class FST>\n  static bool WriteFst(const FST &fst, std::ostream &strm,\n                       const FstWriteOptions &opts);\n\n  void InitStateIterator(StateIteratorData<Arc> *data) const override {\n    GetImpl()->InitStateIterator(data);\n  }\n\n  void InitArcIterator(StateId s, ArcIteratorData<Arc> *data) const override {\n    GetImpl()->InitArcIterator(s, data);\n  }\n\n private:\n  explicit ConstFst(std::shared_ptr<Impl> impl)\n      : ImplToExpandedFst<Impl>(impl) {}\n\n  using ImplToFst<Impl, ExpandedFst<Arc>>::GetImpl;\n\n  // Uses overloading to extract the type of the argument.\n  static const Impl *GetImplIfConstFst(const ConstFst &const_fst) {\n    return const_fst.GetImpl();\n  }\n\n  // NB: this does not give privileged treatment to subtypes of ConstFst.\n  template <typename FST>\n  static Impl *GetImplIfConstFst(const FST &fst) {\n    return nullptr;\n  }\n\n  ConstFst &operator=(const ConstFst &) = delete;\n};\n\n// Writes FST in Const format, potentially with a pass over the machine before\n// writing to compute number of states and arcs.\ntemplate <class Arc, class Unsigned>\ntemplate <class FST>\nbool ConstFst<Arc, Unsigned>::WriteFst(const FST &fst, std::ostream &strm,\n                                       const FstWriteOptions &opts) {\n  const auto file_version =\n      opts.align ? internal::ConstFstImpl<Arc, Unsigned>::kAlignedFileVersion\n                 : internal::ConstFstImpl<Arc, Unsigned>::kFileVersion;\n  size_t num_arcs = 0;    // To silence -Wsometimes-uninitialized warnings.\n  size_t num_states = 0;  // Ditto.\n  size_t start_offset = 0;\n  bool update_header = true;\n  if (const auto *impl = GetImplIfConstFst(fst)) {\n    num_arcs = impl->narcs_;\n    num_states = impl->nstates_;\n    update_header = false;\n  } else if (opts.stream_write || (start_offset = strm.tellp()) == -1) {\n    // precompute values needed for header when we cannot seek to rewrite it.\n    num_arcs = 0;\n    num_states = 0;\n    for (StateIterator<FST> siter(fst); !siter.Done(); siter.Next()) {\n      num_arcs += fst.NumArcs(siter.Value());\n      ++num_states;\n    }\n    update_header = false;\n  }\n  FstHeader hdr;\n  hdr.SetStart(fst.Start());\n  hdr.SetNumStates(num_states);\n  hdr.SetNumArcs(num_arcs);\n  string type = \"const\";\n  if (sizeof(Unsigned) != sizeof(uint32)) {\n    type += std::to_string(CHAR_BIT * sizeof(Unsigned));\n  }\n  const auto properties =\n      fst.Properties(kCopyProperties, true) |\n      internal::ConstFstImpl<Arc, Unsigned>::kStaticProperties;\n  internal::FstImpl<Arc>::WriteFstHeader(fst, strm, opts, file_version, type,\n                                         properties, &hdr);\n  if (opts.align && !AlignOutput(strm)) {\n    LOG(ERROR) << \"Could not align file during write after header\";\n    return false;\n  }\n  size_t pos = 0;\n  size_t states = 0;\n  typename ConstFst<Arc, Unsigned>::ConstState state;\n  for (StateIterator<FST> siter(fst); !siter.Done(); siter.Next()) {\n    const auto s = siter.Value();\n    state.weight = fst.Final(s);\n    state.pos = pos;\n    state.narcs = fst.NumArcs(s);\n    state.niepsilons = fst.NumInputEpsilons(s);\n    state.noepsilons = fst.NumOutputEpsilons(s);\n    strm.write(reinterpret_cast<const char *>(&state), sizeof(state));\n    pos += state.narcs;\n    ++states;\n  }\n  hdr.SetNumStates(states);\n  hdr.SetNumArcs(pos);\n  if (opts.align && !AlignOutput(strm)) {\n    LOG(ERROR) << \"Could not align file during write after writing states\";\n  }\n  for (StateIterator<FST> siter(fst); !siter.Done(); siter.Next()) {\n    for (ArcIterator<FST> aiter(fst, siter.Value()); !aiter.Done();\n         aiter.Next()) {\n      const auto &arc = aiter.Value();\n// Google-only...\n#ifdef MEMORY_SANITIZER\n      // arc may contain padding which has unspecified contents. Tell MSAN to\n      // not complain about it when writing it to a file.\n      ANNOTATE_MEMORY_IS_INITIALIZED(reinterpret_cast<const char *>(&arc),\n                                     sizeof(arc));\n#endif\n      // ...Google-only\n      strm.write(reinterpret_cast<const char *>(&arc), sizeof(arc));\n    }\n  }\n  strm.flush();\n  if (!strm) {\n    LOG(ERROR) << \"ConstFst::WriteFst: write failed: \" << opts.source;\n    return false;\n  }\n  if (update_header) {\n    return internal::FstImpl<Arc>::UpdateFstHeader(\n        fst, strm, opts, file_version, type, properties, &hdr, start_offset);\n  } else {\n    if (hdr.NumStates() != num_states) {\n      LOG(ERROR) << \"Inconsistent number of states observed during write\";\n      return false;\n    }\n    if (hdr.NumArcs() != num_arcs) {\n      LOG(ERROR) << \"Inconsistent number of arcs observed during write\";\n      return false;\n    }\n  }\n  return true;\n}\n\n// Specialization for ConstFst; see generic version in fst.h for sample usage\n// (but use the ConstFst type instead). This version should inline.\ntemplate <class Arc, class Unsigned>\nclass StateIterator<ConstFst<Arc, Unsigned>> {\n public:\n  using StateId = typename Arc::StateId;\n\n  explicit StateIterator(const ConstFst<Arc, Unsigned> &fst)\n      : nstates_(fst.GetImpl()->NumStates()), s_(0) {}\n\n  bool Done() const { return s_ >= nstates_; }\n\n  StateId Value() const { return s_; }\n\n  void Next() { ++s_; }\n\n  void Reset() { s_ = 0; }\n\n private:\n  const StateId nstates_;\n  StateId s_;\n};\n\n// Specialization for ConstFst; see generic version in fst.h for sample usage\n// (but use the ConstFst type instead). This version should inline.\ntemplate <class Arc, class Unsigned>\nclass ArcIterator<ConstFst<Arc, Unsigned>> {\n public:\n  using StateId = typename Arc::StateId;\n\n  ArcIterator(const ConstFst<Arc, Unsigned> &fst, StateId s)\n      : arcs_(fst.GetImpl()->Arcs(s)),\n        narcs_(fst.GetImpl()->NumArcs(s)),\n        i_(0) {}\n\n  bool Done() const { return i_ >= narcs_; }\n\n  const Arc &Value() const { return arcs_[i_]; }\n\n  void Next() { ++i_; }\n\n  size_t Position() const { return i_; }\n\n  void Reset() { i_ = 0; }\n\n  void Seek(size_t a) { i_ = a; }\n\n  constexpr uint32 Flags() const { return kArcValueFlags; }\n\n  void SetFlags(uint32, uint32) {}\n\n private:\n  const Arc *arcs_;\n  size_t narcs_;\n  size_t i_;\n};\n\n// A useful alias when using StdArc.\nusing StdConstFst = ConstFst<StdArc>;\n\n}  // namespace fst\n\n#endif  // FST_CONST_FST_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/determinize.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Functions and classes to determinize an FST.\n\n#ifndef FST_DETERMINIZE_H_\n#define FST_DETERMINIZE_H_\n\n#include <algorithm>\n#include <climits>\n#include <forward_list>\n#include <map>\n#include <string>\n#include <vector>\n\n#include <fst/log.h>\n\n#include <fst/arc-map.h>\n#include <fst/bi-table.h>\n#include <fst/cache.h>\n#include <fst/factor-weight.h>\n#include <fst/filter-state.h>\n#include <fst/prune.h>\n#include <fst/test-properties.h>\n\n\nnamespace fst {\n\n// Common divisors are used in determinization to compute transition weights.\n// In the simplest case, it is the same as semiring Plus, but other choices\n// permit more efficient determinization when the output contains strings.\n\n// The default common divisor uses the semiring Plus.\ntemplate <class W>\nstruct DefaultCommonDivisor {\n public:\n  using Weight = W;\n\n  Weight operator()(const Weight &w1, const Weight &w2) const {\n    return Plus(w1, w2);\n  }\n};\n\n// The label common divisor for a (left) string semiring selects a single\n// letter common prefix or the empty string. This is used in the\n// determinization of output strings so that at most a single letter will\n// appear in the output of a transtion.\ntemplate <typename Label, StringType S>\nstruct LabelCommonDivisor {\n public:\n  using Weight = StringWeight<Label, S>;\n\n  Weight operator()(const Weight &w1, const Weight &w2) const {\n    typename Weight::Iterator iter1(w1);\n    typename Weight::Iterator iter2(w2);\n    if (!(StringWeight<Label, S>::Properties() & kLeftSemiring)) {\n      FSTERROR() << \"LabelCommonDivisor: Weight needs to be left semiring\";\n      return Weight::NoWeight();\n    } else if (w1.Size() == 0 || w2.Size() == 0) {\n      return Weight::One();\n    } else if (w1 == Weight::Zero()) {\n      return Weight(iter2.Value());\n    } else if (w2 == Weight::Zero()) {\n      return Weight(iter1.Value());\n    } else if (iter1.Value() == iter2.Value()) {\n      return Weight(iter1.Value());\n    } else {\n      return Weight::One();\n    }\n  }\n};\n\n// The gallic common divisor uses the label common divisor on the string\n// component and the common divisor on the weight component, which defaults to\n// the default common divisor.\ntemplate <class Label, class W, GallicType G,\n          class CommonDivisor = DefaultCommonDivisor<W>>\nclass GallicCommonDivisor {\n public:\n  using Weight = GallicWeight<Label, W, G>;\n\n  Weight operator()(const Weight &w1, const Weight &w2) const {\n    return Weight(label_common_divisor_(w1.Value1(), w2.Value1()),\n                  weight_common_divisor_(w1.Value2(), w2.Value2()));\n  }\n\n private:\n  LabelCommonDivisor<Label, GallicStringType(G)> label_common_divisor_;\n  CommonDivisor weight_common_divisor_;\n};\n\n// Specialization for general GALLIC weight.\ntemplate <class Label, class W, class CommonDivisor>\nclass GallicCommonDivisor<Label, W, GALLIC, CommonDivisor> {\n public:\n  using Weight = GallicWeight<Label, W, GALLIC>;\n  using GRWeight = GallicWeight<Label, W, GALLIC_RESTRICT>;\n  using Iterator =\n      UnionWeightIterator<GRWeight, GallicUnionWeightOptions<Label, W>>;\n\n  Weight operator()(const Weight &w1, const Weight &w2) const {\n    auto weight = GRWeight::Zero();\n    for (Iterator iter(w1); !iter.Done(); iter.Next()) {\n      weight = common_divisor_(weight, iter.Value());\n    }\n    for (Iterator iter(w2); !iter.Done(); iter.Next()) {\n      weight = common_divisor_(weight, iter.Value());\n    }\n    return weight == GRWeight::Zero() ? Weight::Zero() : Weight(weight);\n  }\n\n private:\n  GallicCommonDivisor<Label, W, GALLIC_RESTRICT, CommonDivisor> common_divisor_;\n};\n\nnamespace internal {\n\n// Represents an element in a subset\ntemplate <class Arc>\nstruct DeterminizeElement {\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  DeterminizeElement(StateId s, Weight weight)\n      : state_id(s), weight(std::move(weight)) {}\n\n  inline bool operator==(const DeterminizeElement<Arc> &element) const {\n    return state_id == element.state_id && weight == element.weight;\n  }\n\n  inline bool operator!=(const DeterminizeElement<Arc> &element) const {\n    return !(*this == element);\n  }\n\n  inline bool operator<(const DeterminizeElement<Arc> &element) const {\n    return state_id < element.state_id;\n  }\n\n  StateId state_id;  // Input state ID.\n  Weight weight;     // Residual weight.\n};\n\n// Represents a weighted subset and determinization filter state\ntemplate <typename A, typename FilterState>\nstruct DeterminizeStateTuple {\n  using Arc = A;\n  using Element = DeterminizeElement<Arc>;\n  using Subset = std::forward_list<Element>;\n\n  DeterminizeStateTuple() : filter_state(FilterState::NoState()) {}\n\n  inline bool operator==(\n      const DeterminizeStateTuple<Arc, FilterState> &tuple) const {\n    return (tuple.filter_state == filter_state) && (tuple.subset == subset);\n  }\n\n  inline bool operator!=(\n      const DeterminizeStateTuple<Arc, FilterState> &tuple) const {\n    return (tuple.filter_state != filter_state) || (tuple.subset != subset);\n  }\n\n  Subset subset;\n  FilterState filter_state;\n};\n\n// Proto-transition for determinization.\ntemplate <class StateTuple>\nstruct DeterminizeArc {\n  using Arc = typename StateTuple::Arc;\n  using Label = typename Arc::Label;\n  using Weight = typename Arc::Weight;\n\n  DeterminizeArc()\n      : label(kNoLabel), weight(Weight::Zero()), dest_tuple(nullptr) {}\n\n  explicit DeterminizeArc(const Arc &arc)\n      : label(arc.ilabel), weight(Weight::Zero()), dest_tuple(new StateTuple) {}\n\n  Label label;             // Arc label.\n  Weight weight;           // Arc weight.\n  StateTuple *dest_tuple;  // Destination subset and filter state.\n};\n\n}  // namespace internal\n\n// Determinization filters are used to compute destination state tuples based\n// on the source tuple, transition, and destination element or on similar\n// super-final transition information. The filter operates on a map between a\n// label and the corresponding destination state tuples. It must define the map\n// type LabelMap. The default filter is used for weighted determinization.\n// A determinize filter for implementing weighted determinization.\ntemplate <class Arc>\nclass DefaultDeterminizeFilter {\n public:\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using FilterState = CharFilterState;\n  using Element = internal::DeterminizeElement<Arc>;\n  using StateTuple = internal::DeterminizeStateTuple<Arc, FilterState>;\n  using LabelMap = std::map<Label, internal::DeterminizeArc<StateTuple>>;\n\n  // This is needed e.g. to go into the gallic domain for transducers.\n  template <class A>\n  struct rebind {\n    using Other = DefaultDeterminizeFilter<A>;\n  };\n\n  explicit DefaultDeterminizeFilter(const Fst<Arc> &fst) : fst_(fst.Copy()) {}\n\n  // This is needed (e.g.) to go into the gallic domain for transducers.\n  // Ownership of the templated filter argument is given to this class.\n  template <class Filter>\n  DefaultDeterminizeFilter(const Fst<Arc> &fst, Filter *filter)\n      : fst_(fst.Copy()) {\n    delete filter;\n  }\n\n  // Copy constructor; the FST can be passed if it has been deep-copied.\n  DefaultDeterminizeFilter(const DefaultDeterminizeFilter<Arc> &filter,\n                           const Fst<Arc> *fst = nullptr)\n      : fst_(fst ? fst->Copy() : filter.fst_->Copy()) {}\n\n  FilterState Start() const { return FilterState(0); }\n\n  // Does no work.\n  void SetState(StateId s, const StateTuple &tuple) {}\n\n  // Filters transition, possibly modifying label map. Returns true if arc is\n  // added to the label map.\n  bool FilterArc(const Arc &arc, const Element &src_element,\n                 const Element &dest_element, LabelMap *label_map) const {\n    // Adds element to unique state tuple for arc label.\n    auto &det_arc = (*label_map)[arc.ilabel];\n    if (det_arc.label == kNoLabel) {\n      det_arc = internal::DeterminizeArc<StateTuple>(arc);\n      det_arc.dest_tuple->filter_state = FilterState(0);\n    }\n    det_arc.dest_tuple->subset.push_front(dest_element);\n    return true;\n  }\n\n  // Filters super-final transition, returning new final weight.\n  Weight FilterFinal(Weight weight, const Element &element) { return weight; }\n\n  static uint64 Properties(uint64 props) { return props; }\n\n private:\n  std::unique_ptr<Fst<Arc>> fst_;\n};\n\n// Determinization state table interface:\n//\n// template <class Arc, class FilterState>\n// class DeterminizeStateTable {\n//  public:\n//   using StateId = typename Arc::StateId;\n//   using StateTuple = internal::DeterminizeStateTuple<Arc, FilterState>;\n//\n//   // Required sub-class. This is needed (e.g.) to go into the gallic domain.\n//   template <class B, class G>\n//   struct rebind {\n//     using Other = DeterminizeStateTable<B, G>;\n//   }\n//\n//   // Required constuctor.\n//   DeterminizeStateTable();\n//\n//   // Required copy constructor that does not copy state.\n//   DeterminizeStateTable(const DeterminizeStateTable<Arc, FilterState>\n//   &table);\n//\n//   // Looks up state ID by state tuple; if it doesn't exist, then adds it.\n//   // FindState takes ownership of the state tuple argument so that it\n//   // doesn't have to copy it if it creates a new state.\n//   StateId FindState(StateTuple *tuple);\n//\n//   // Looks up state tuple by ID.\n//   const StateTuple *Tuple(StateId id) const;\n// };\n\n// The default determinization state table based on the compact hash bi-table.\ntemplate <class Arc, class FilterState>\nclass DefaultDeterminizeStateTable {\n public:\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using StateTuple = internal::DeterminizeStateTuple<Arc, FilterState>;\n  using Element = typename StateTuple::Element;\n  using Subset = typename StateTuple::Subset;\n\n  template <class B, class G>\n  struct rebind {\n    using Other = DefaultDeterminizeStateTable<B, G>;\n  };\n\n  explicit DefaultDeterminizeStateTable(size_t table_size = 0)\n      : table_size_(table_size), tuples_(table_size_) {}\n\n  DefaultDeterminizeStateTable(\n      const DefaultDeterminizeStateTable<Arc, FilterState> &table)\n      : table_size_(table.table_size_), tuples_(table_size_) {}\n\n  ~DefaultDeterminizeStateTable() {\n    for (StateId s = 0; s < tuples_.Size(); ++s) delete tuples_.FindEntry(s);\n  }\n\n  // Finds the state corresponding to a state tuple. Only creates a new state if\n  // the tuple is not found. FindState takes ownership of the tuple argument so\n  // that it doesn't have to copy it if it creates a new state.\n  StateId FindState(StateTuple *tuple) {\n    const StateId ns = tuples_.Size();\n    const auto s = tuples_.FindId(tuple);\n    if (s != ns) delete tuple;  // Tuple found.\n    return s;\n  }\n\n  const StateTuple *Tuple(StateId s) { return tuples_.FindEntry(s); }\n\n private:\n  // Comparison object for StateTuples.\n  class StateTupleEqual {\n   public:\n    bool operator()(const StateTuple *tuple1, const StateTuple *tuple2) const {\n      return *tuple1 == *tuple2;\n    }\n  };\n\n  // Hash function for StateTuples.\n  class StateTupleKey {\n   public:\n    size_t operator()(const StateTuple *tuple) const {\n      size_t h = tuple->filter_state.Hash();\n      for (auto it = tuple->subset.begin(); it != tuple->subset.end(); ++it) {\n        const size_t h1 = it->state_id;\n        static constexpr auto lshift = 5;\n        static constexpr auto rshift = CHAR_BIT * sizeof(size_t) - 5;\n        h ^= h << 1 ^ h1 << lshift ^ h1 >> rshift ^ it->weight.Hash();\n      }\n      return h;\n    }\n  };\n\n  size_t table_size_;\n  CompactHashBiTable<StateId, StateTuple *, StateTupleKey, StateTupleEqual,\n                     HS_STL>\n      tuples_;\n\n  DefaultDeterminizeStateTable &operator=(\n      const DefaultDeterminizeStateTable &) = delete;\n};\n\n// Determinization type.\nenum DeterminizeType {\n  // Input transducer is known to be functional (or error).\n  DETERMINIZE_FUNCTIONAL,  // Input transducer is functional (error if not).\n  // Input transducer is not known to be functional.\n  DETERMINIZE_NONFUNCTIONAL,\n  // Input transducer is not known to be functional but only keep the min of\n  // of ambiguous outputs.\n  DETERMINIZE_DISAMBIGUATE\n};\n\n// Options for finite-state transducer determinization templated on the arc\n// type, common divisor, the determinization filter and the state table.\n// DeterminizeFst takes ownership of the determinization filter and state table,\n// if provided.\ntemplate <class Arc,\n          class CommonDivisor = DefaultCommonDivisor<typename Arc::Weight>,\n          class Filter = DefaultDeterminizeFilter<Arc>,\n          class StateTable =\n              DefaultDeterminizeStateTable<Arc, typename Filter::FilterState>>\nstruct DeterminizeFstOptions : public CacheOptions {\n  using Label = typename Arc::Label;\n\n  float delta;                // Quantization delta for subset weights.\n  Label subsequential_label;  // Label used for residual final output\n                              // when producing subsequential transducers.\n  DeterminizeType type;       // Determinization type.\n  bool increment_subsequential_label;  // When creating several subsequential\n                                       // arcs at a given state, make their\n                                       // label distinct by incrementing.\n  Filter *filter;                      // Determinization filter;\n                                       // DeterminizeFst takes ownership.\n  StateTable *state_table;             // Determinization state table;\n                                       // DeterminizeFst takes ownership.\n\n  explicit DeterminizeFstOptions(const CacheOptions &opts, float delta = kDelta,\n                                 Label subsequential_label = 0,\n                                 DeterminizeType type = DETERMINIZE_FUNCTIONAL,\n                                 bool increment_subsequential_label = false,\n                                 Filter *filter = nullptr,\n                                 StateTable *state_table = nullptr)\n      : CacheOptions(opts),\n        delta(delta),\n        subsequential_label(subsequential_label),\n        type(type),\n        increment_subsequential_label(increment_subsequential_label),\n        filter(filter),\n        state_table(state_table) {}\n\n  explicit DeterminizeFstOptions(float delta = kDelta,\n                                 Label subsequential_label = 0,\n                                 DeterminizeType type = DETERMINIZE_FUNCTIONAL,\n                                 bool increment_subsequential_label = false,\n                                 Filter *filter = nullptr,\n                                 StateTable *state_table = nullptr)\n      : delta(delta),\n        subsequential_label(subsequential_label),\n        type(type),\n        increment_subsequential_label(increment_subsequential_label),\n        filter(filter),\n        state_table(state_table) {}\n};\n\nnamespace internal {\n\n// Implementation of delayed DeterminizeFst. This base class is\n// common to the variants that implement acceptor and transducer\n// determinization.\ntemplate <class Arc>\nclass DeterminizeFstImplBase : public CacheImpl<Arc> {\n public:\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using Store = DefaultCacheStore<Arc>;\n  using State = typename Store::State;\n\n  using FstImpl<Arc>::SetType;\n  using FstImpl<Arc>::SetProperties;\n  using FstImpl<Arc>::Properties;\n  using FstImpl<Arc>::SetInputSymbols;\n  using FstImpl<Arc>::SetOutputSymbols;\n\n  using CacheBaseImpl<CacheState<Arc>>::HasStart;\n  using CacheBaseImpl<CacheState<Arc>>::HasFinal;\n  using CacheBaseImpl<CacheState<Arc>>::HasArcs;\n  using CacheBaseImpl<CacheState<Arc>>::SetFinal;\n  using CacheBaseImpl<CacheState<Arc>>::SetStart;\n\n  template <class CommonDivisor, class Filter, class StateTable>\n  DeterminizeFstImplBase(\n      const Fst<Arc> &fst,\n      const DeterminizeFstOptions<Arc, CommonDivisor, Filter, StateTable> &opts)\n      : CacheImpl<Arc>(opts), fst_(fst.Copy()) {\n    SetType(\"determinize\");\n    const auto iprops = fst.Properties(kFstProperties, false);\n    const auto dprops =\n        DeterminizeProperties(iprops, opts.subsequential_label != 0,\n                              opts.type == DETERMINIZE_NONFUNCTIONAL\n                                  ? opts.increment_subsequential_label\n                                  : true);\n    SetProperties(Filter::Properties(dprops), kCopyProperties);\n    SetInputSymbols(fst.InputSymbols());\n    SetOutputSymbols(fst.OutputSymbols());\n  }\n\n  DeterminizeFstImplBase(const DeterminizeFstImplBase<Arc> &impl)\n      : CacheImpl<Arc>(impl), fst_(impl.fst_->Copy(true)) {\n    SetType(\"determinize\");\n    SetProperties(impl.Properties(), kCopyProperties);\n    SetInputSymbols(impl.InputSymbols());\n    SetOutputSymbols(impl.OutputSymbols());\n  }\n\n  virtual DeterminizeFstImplBase<Arc> *Copy() const = 0;\n\n  StateId Start() {\n    if (!HasStart()) {\n      const auto start = ComputeStart();\n      if (start != kNoStateId) SetStart(start);\n    }\n    return CacheImpl<Arc>::Start();\n  }\n\n  Weight Final(StateId s) {\n    if (!HasFinal(s)) SetFinal(s, ComputeFinal(s));\n    return CacheImpl<Arc>::Final(s);\n  }\n\n  virtual void Expand(StateId s) = 0;\n\n  size_t NumArcs(StateId s) {\n    if (!HasArcs(s)) Expand(s);\n    return CacheImpl<Arc>::NumArcs(s);\n  }\n\n  size_t NumInputEpsilons(StateId s) {\n    if (!HasArcs(s)) Expand(s);\n    return CacheImpl<Arc>::NumInputEpsilons(s);\n  }\n\n  size_t NumOutputEpsilons(StateId s) {\n    if (!HasArcs(s)) Expand(s);\n    return CacheImpl<Arc>::NumOutputEpsilons(s);\n  }\n\n  void InitArcIterator(StateId s, ArcIteratorData<Arc> *data) {\n    if (!HasArcs(s)) Expand(s);\n    CacheImpl<Arc>::InitArcIterator(s, data);\n  }\n\n  virtual StateId ComputeStart() = 0;\n\n  virtual Weight ComputeFinal(StateId s) = 0;\n\n  const Fst<Arc> &GetFst() const { return *fst_; }\n\n private:\n  std::unique_ptr<const Fst<Arc>> fst_;  // Input FST.\n};\n\n// Implementation of delayed determinization for weighted acceptors.\ntemplate <class Arc, class CommonDivisor, class Filter, class StateTable>\nclass DeterminizeFsaImpl : public DeterminizeFstImplBase<Arc> {\n public:\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using FilterState = typename Filter::FilterState;\n  using StateTuple = internal::DeterminizeStateTuple<Arc, FilterState>;\n  using Element = typename StateTuple::Element;\n  using Subset = typename StateTuple::Subset;\n  using LabelMap = typename Filter::LabelMap;\n\n  using FstImpl<Arc>::SetProperties;\n  using DeterminizeFstImplBase<Arc>::GetFst;\n  using DeterminizeFstImplBase<Arc>::SetArcs;\n\n  DeterminizeFsaImpl(\n      const Fst<Arc> &fst, const std::vector<Weight> *in_dist,\n      std::vector<Weight> *out_dist,\n      const DeterminizeFstOptions<Arc, CommonDivisor, Filter, StateTable> &opts)\n      : DeterminizeFstImplBase<Arc>(fst, opts),\n        delta_(opts.delta),\n        in_dist_(in_dist),\n        out_dist_(out_dist),\n        filter_(opts.filter ? opts.filter : new Filter(fst)),\n        state_table_(opts.state_table ? opts.state_table : new StateTable()) {\n    if (!fst.Properties(kAcceptor, true)) {\n      FSTERROR() << \"DeterminizeFst: Argument not an acceptor\";\n      SetProperties(kError, kError);\n    }\n    if (!(Weight::Properties() & kLeftSemiring)) {\n      FSTERROR() << \"DeterminizeFst: Weight must be left distributive: \"\n                 << Weight::Type();\n      SetProperties(kError, kError);\n    }\n    if (out_dist_) out_dist_->clear();\n  }\n\n  DeterminizeFsaImpl(\n      const DeterminizeFsaImpl<Arc, CommonDivisor, Filter, StateTable> &impl)\n      : DeterminizeFstImplBase<Arc>(impl),\n        delta_(impl.delta_),\n        in_dist_(nullptr),\n        out_dist_(nullptr),\n        filter_(new Filter(*impl.filter_, &GetFst())),\n        state_table_(new StateTable(*impl.state_table_)) {\n    if (impl.out_dist_) {\n      FSTERROR() << \"DeterminizeFsaImpl: Cannot copy with out_dist vector\";\n      SetProperties(kError, kError);\n    }\n  }\n\n  DeterminizeFsaImpl<Arc, CommonDivisor, Filter, StateTable> *Copy()\n      const override {\n    return new DeterminizeFsaImpl<Arc, CommonDivisor, Filter, StateTable>(\n        *this);\n  }\n\n  uint64 Properties() const override { return Properties(kFstProperties); }\n\n  // Sets error if found, and returns other FST impl properties.\n  uint64 Properties(uint64 mask) const override {\n    if ((mask & kError) && (GetFst().Properties(kError, false))) {\n      SetProperties(kError, kError);\n    }\n    return FstImpl<Arc>::Properties(mask);\n  }\n\n  StateId ComputeStart() override {\n    const auto s = GetFst().Start();\n    if (s == kNoStateId) return kNoStateId;\n    const Element element(s, Weight::One());\n    auto *tuple = new StateTuple;\n    tuple->subset.push_front(element);\n    tuple->filter_state = filter_->Start();\n    return FindState(tuple);\n  }\n\n  Weight ComputeFinal(StateId s) override {\n    const auto *tuple = state_table_->Tuple(s);\n    filter_->SetState(s, *tuple);\n    auto final_weight = Weight::Zero();\n    for (auto it = tuple->subset.begin(); it != tuple->subset.end(); ++it) {\n      const auto &element = *it;\n      final_weight =\n          Plus(final_weight,\n               Times(element.weight, GetFst().Final(element.state_id)));\n      final_weight = filter_->FilterFinal(final_weight, element);\n      if (!final_weight.Member()) SetProperties(kError, kError);\n    }\n    return final_weight;\n  }\n\n  StateId FindState(StateTuple *tuple) {\n    const auto s = state_table_->FindState(tuple);\n    if (in_dist_ && out_dist_->size() <= s) {\n      out_dist_->push_back(ComputeDistance(tuple->subset));\n    }\n    return s;\n  }\n\n  // Computes distance from a state to the final states in the DFA given the\n  // distances in the NFA.\n  Weight ComputeDistance(const Subset &subset) {\n    auto outd = Weight::Zero();\n    for (auto it = subset.begin(); it != subset.end(); ++it) {\n      const auto &element = *it;\n      const auto ind =\n          (element.state_id < in_dist_->size() ? (*in_dist_)[element.state_id]\n                                               : Weight::Zero());\n      outd = Plus(outd, Times(element.weight, ind));\n    }\n    return outd;\n  }\n\n  // Computes the outgoing transitions from a state, creating new destination\n  // states as needed.\n  void Expand(StateId s) override {\n    LabelMap label_map;\n    GetLabelMap(s, &label_map);\n    for (auto it = label_map.begin(); it != label_map.end(); ++it) {\n      AddArc(s, it->second);\n    }\n    SetArcs(s);\n  }\n\n private:\n  using DetArc = internal::DeterminizeArc<StateTuple>;\n\n  // Constructs proto-determinization transition, including destination subset,\n  // per label.\n  void GetLabelMap(StateId s, LabelMap *label_map) {\n    const auto *src_tuple = state_table_->Tuple(s);\n    filter_->SetState(s, *src_tuple);\n    for (auto it = src_tuple->subset.begin(); it != src_tuple->subset.end();\n         ++it) {\n      const auto &src_element = *it;\n      for (ArcIterator<Fst<Arc>> aiter(GetFst(), src_element.state_id);\n           !aiter.Done(); aiter.Next()) {\n        const auto &arc = aiter.Value();\n        const Element dest_element(arc.nextstate,\n                                   Times(src_element.weight, arc.weight));\n        filter_->FilterArc(arc, src_element, dest_element, label_map);\n      }\n    }\n    for (auto it = label_map->begin(); it != label_map->end(); ++it) {\n      NormArc(&it->second);\n    }\n  }\n\n  // Sorts subsets and removes duplicate elements, normalizing transition and\n  // subset weights.\n  void NormArc(DetArc *det_arc) {\n    auto *dest_tuple = det_arc->dest_tuple;\n    dest_tuple->subset.sort();\n    auto piter = dest_tuple->subset.begin();\n    for (auto diter = dest_tuple->subset.begin();\n         diter != dest_tuple->subset.end();) {\n      auto &dest_element = *diter;\n      auto &prev_element = *piter;\n      // Computes arc weight.\n      det_arc->weight = common_divisor_(det_arc->weight, dest_element.weight);\n      if (piter != diter && dest_element.state_id == prev_element.state_id) {\n        // Found duplicate state: sums state weight and deletes duplicate.\n        prev_element.weight = Plus(prev_element.weight, dest_element.weight);\n        if (!prev_element.weight.Member()) SetProperties(kError, kError);\n        ++diter;\n        dest_tuple->subset.erase_after(piter);\n      } else {\n        piter = diter;\n        ++diter;\n      }\n    }\n    // Divides out label weight from destination subset elements, quantizing to\n    // ensure comparisons are effective.\n    for (auto diter = dest_tuple->subset.begin();\n         diter != dest_tuple->subset.end(); ++diter) {\n      auto &dest_element = *diter;\n      dest_element.weight =\n          Divide(dest_element.weight, det_arc->weight, DIVIDE_LEFT);\n      dest_element.weight = dest_element.weight.Quantize(delta_);\n    }\n  }\n\n  // Adds an arc from state S to the destination state associated with state\n  // tuple in det_arc as created by GetLabelMap.\n  void AddArc(StateId s, const DetArc &det_arc) {\n    const Arc arc(det_arc.label, det_arc.label, det_arc.weight,\n                  FindState(det_arc.dest_tuple));\n    CacheImpl<Arc>::PushArc(s, arc);\n  }\n\n  float delta_;                         // Quantization delta for weights.\n  const std::vector<Weight> *in_dist_;  // Distance to final NFA states.\n  std::vector<Weight> *out_dist_;       // Distance to final DFA states.\n\n  // FIXME(kbg): Ought to be static const?\n  CommonDivisor common_divisor_;\n  std::unique_ptr<Filter> filter_;\n  std::unique_ptr<StateTable> state_table_;\n};\n\n// Implementation of delayed determinization for transducers. Transducer\n// determinization is implemented by mapping the input to the Gallic semiring as\n// an acceptor whose weights contain the output strings and using acceptor\n// determinization above to determinize that acceptor.\ntemplate <class Arc, GallicType G, class CommonDivisor, class Filter,\n          class StateTable>\nclass DeterminizeFstImpl : public DeterminizeFstImplBase<Arc> {\n public:\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using ToMapper = ToGallicMapper<Arc, G>;\n  using ToArc = typename ToMapper::ToArc;\n  using ToFst = ArcMapFst<Arc, ToArc, ToMapper>;\n  using FromMapper = FromGallicMapper<Arc, G>;\n  using FromFst = ArcMapFst<ToArc, Arc, FromMapper>;\n\n  using ToCommonDivisor = GallicCommonDivisor<Label, Weight, G, CommonDivisor>;\n  using ToFilter = typename Filter::template rebind<ToArc>::Other;\n  using ToFilterState = typename ToFilter::FilterState;\n  using ToStateTable =\n      typename StateTable::template rebind<ToArc, ToFilterState>::Other;\n  using FactorIterator = GallicFactor<Label, Weight, G>;\n\n  using FstImpl<Arc>::SetProperties;\n  using DeterminizeFstImplBase<Arc>::GetFst;\n  using CacheBaseImpl<CacheState<Arc>>::GetCacheGc;\n  using CacheBaseImpl<CacheState<Arc>>::GetCacheLimit;\n\n  DeterminizeFstImpl(\n      const Fst<Arc> &fst,\n      const DeterminizeFstOptions<Arc, CommonDivisor, Filter, StateTable> &opts)\n      : DeterminizeFstImplBase<Arc>(fst, opts),\n        delta_(opts.delta),\n        subsequential_label_(opts.subsequential_label),\n        increment_subsequential_label_(opts.increment_subsequential_label) {\n    if (opts.state_table) {\n      FSTERROR() << \"DeterminizeFst: \"\n                 << \"A state table can not be passed with transducer input\";\n      SetProperties(kError, kError);\n      return;\n    }\n    Init(GetFst(), opts.filter);\n  }\n\n  DeterminizeFstImpl(\n      const DeterminizeFstImpl<Arc, G, CommonDivisor, Filter, StateTable> &impl)\n      : DeterminizeFstImplBase<Arc>(impl),\n        delta_(impl.delta_),\n        subsequential_label_(impl.subsequential_label_),\n        increment_subsequential_label_(impl.increment_subsequential_label_) {\n    Init(GetFst(), nullptr);\n  }\n\n  DeterminizeFstImpl<Arc, G, CommonDivisor, Filter, StateTable> *Copy()\n      const override {\n    return new DeterminizeFstImpl<Arc, G, CommonDivisor, Filter, StateTable>(\n        *this);\n  }\n\n  uint64 Properties() const override { return Properties(kFstProperties); }\n\n  // Sets error if found, and returns other FST impl properties.\n  uint64 Properties(uint64 mask) const override {\n    if ((mask & kError) && (GetFst().Properties(kError, false) ||\n                            from_fst_->Properties(kError, false))) {\n      SetProperties(kError, kError);\n    }\n    return FstImpl<Arc>::Properties(mask);\n  }\n\n  StateId ComputeStart() override { return from_fst_->Start(); }\n\n  Weight ComputeFinal(StateId s) override { return from_fst_->Final(s); }\n\n  void Expand(StateId s) override {\n    for (ArcIterator<FromFst> aiter(*from_fst_, s); !aiter.Done();\n         aiter.Next()) {\n      CacheImpl<Arc>::PushArc(s, aiter.Value());\n    }\n    CacheImpl<Arc>::SetArcs(s);\n  }\n\n private:\n  // Initialization of transducer determinization implementation, which is\n  // defined after DeterminizeFst since it calls it.\n  void Init(const Fst<Arc> &fst, Filter *filter);\n\n  float delta_;\n  Label subsequential_label_;\n  bool increment_subsequential_label_;\n  std::unique_ptr<FromFst> from_fst_;\n};\n\n}  // namespace internal\n\n// Determinizes a weighted transducer. This version is a delayed\n// FST. The result will be an equivalent FST that has the property\n// that no state has two transitions with the same input label.\n// For this algorithm, epsilon transitions are treated as regular\n// symbols (cf. RmEpsilon).\n//\n// The transducer must be functional. The weights must be (weakly) left\n// divisible (valid for TropicalWeight and LogWeight for instance) and be\n// zero-sum-free if for all a, b: (Plus(a, b) == 0) => a = b = 0.\n//\n// Complexity:\n//\n//   Determinizable: exponential (polynomial in the size of the output).\n//   Non-determinizable: does not terminate.\n//\n// The determinizable automata include all unweighted and all acyclic input.\n//\n// For more information, see:\n//\n// Mohri, M. 1997. Finite-state transducers in language and speech processing.\n// Computational Linguistics 23(2): 269-311.\n//\n// This class attaches interface to implementation and handles reference\n// counting, delegating most methods to ImplToFst.\ntemplate <class A>\nclass DeterminizeFst : public ImplToFst<internal::DeterminizeFstImplBase<A>> {\n public:\n  using Arc = A;\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using Store = DefaultCacheStore<Arc>;\n  using State = typename Store::State;\n  using Impl = internal::DeterminizeFstImplBase<Arc>;\n\n  friend class ArcIterator<DeterminizeFst<Arc>>;\n  friend class StateIterator<DeterminizeFst<Arc>>;\n\n  template <class B, GallicType G, class CommonDivisor, class Filter,\n            class StateTable>\n  friend class DeterminizeFstImpl;\n\n  explicit DeterminizeFst(const Fst<A> &fst)\n      : ImplToFst<Impl>(CreateImpl(fst)) {}\n\n  template <class CommonDivisor, class Filter, class StateTable>\n  DeterminizeFst(\n      const Fst<Arc> &fst,\n      const DeterminizeFstOptions<Arc, CommonDivisor, Filter, StateTable>\n          &opts =\n              DeterminizeFstOptions<Arc, CommonDivisor, Filter, StateTable>())\n      : ImplToFst<Impl>(CreateImpl(fst, opts)) {}\n\n  // This acceptor-only version additionally computes the distance to final\n  // states in the output if provided with those distances for the input; this\n  // is useful for e.g., computing the k-shortest unique paths.\n  template <class CommonDivisor, class Filter, class StateTable>\n  DeterminizeFst(\n      const Fst<Arc> &fst, const std::vector<Weight> *in_dist,\n      std::vector<Weight> *out_dist,\n      const DeterminizeFstOptions<Arc, CommonDivisor, Filter, StateTable>\n          &opts =\n              DeterminizeFstOptions<Arc, CommonDivisor, Filter, StateTable>())\n      : ImplToFst<Impl>(\n            std::make_shared<internal::DeterminizeFsaImpl<Arc, CommonDivisor,\n                                                          Filter, StateTable>>(\n                fst, in_dist, out_dist, opts)) {\n    if (!fst.Properties(kAcceptor, true)) {\n      FSTERROR() << \"DeterminizeFst: \"\n                 << \"Distance to final states computed for acceptors only\";\n      GetMutableImpl()->SetProperties(kError, kError);\n    }\n  }\n\n  // See Fst<>::Copy() for doc.\n  DeterminizeFst(const DeterminizeFst<Arc> &fst, bool safe = false)\n      : ImplToFst<Impl>(safe ? std::shared_ptr<Impl>(fst.GetImpl()->Copy())\n                             : fst.GetSharedImpl()) {}\n\n  // Get a copy of this DeterminizeFst. See Fst<>::Copy() for further doc.\n  DeterminizeFst<Arc> *Copy(bool safe = false) const override {\n    return new DeterminizeFst<Arc>(*this, safe);\n  }\n\n  inline void InitStateIterator(StateIteratorData<Arc> *data) const override;\n\n  void InitArcIterator(StateId s, ArcIteratorData<Arc> *data) const override {\n    GetMutableImpl()->InitArcIterator(s, data);\n  }\n\n private:\n  using ImplToFst<Impl>::GetImpl;\n  using ImplToFst<Impl>::GetMutableImpl;\n\n  static std::shared_ptr<Impl> CreateImpl(const Fst<Arc> &fst) {\n    using D = DefaultCommonDivisor<Weight>;\n    using F = DefaultDeterminizeFilter<Arc>;\n    using T = DefaultDeterminizeStateTable<Arc, typename F::FilterState>;\n    const DeterminizeFstOptions<Arc, D, F, T> opts;\n    return CreateImpl(fst, opts);\n  }\n\n  template <class CommonDivisor, class Filter, class StateTable>\n  static std::shared_ptr<Impl> CreateImpl(\n      const Fst<Arc> &fst,\n      const DeterminizeFstOptions<Arc, CommonDivisor, Filter, StateTable>\n          &opts) {\n    if (fst.Properties(kAcceptor, true)) {\n      // Calls implementation for acceptors.\n      return std::make_shared<\n          internal::DeterminizeFsaImpl<Arc, CommonDivisor, Filter, StateTable>>(\n          fst, nullptr, nullptr, opts);\n    } else if (opts.type == DETERMINIZE_DISAMBIGUATE) {\n      auto rv = std::make_shared<internal::DeterminizeFstImpl<\n          Arc, GALLIC_MIN, CommonDivisor, Filter, StateTable>>(fst, opts);\n      if (!(Weight::Properties() & kPath)) {\n        FSTERROR() << \"DeterminizeFst: Weight needs to have the \"\n                   << \"path property to disambiguate output: \"\n                   << Weight::Type();\n        rv->SetProperties(kError, kError);\n      }\n      // Calls disambiguating implementation for non-functional transducers.\n      return rv;\n    } else if (opts.type == DETERMINIZE_FUNCTIONAL) {\n      // Calls implementation for functional transducers.\n      return std::make_shared<internal::DeterminizeFstImpl<\n          Arc, GALLIC_RESTRICT, CommonDivisor, Filter, StateTable>>(fst, opts);\n    } else {  // opts.type == DETERMINIZE_NONFUNCTIONAL\n      // Calls implementation for non functional transducers;\n      return std::make_shared<internal::DeterminizeFstImpl<\n          Arc, GALLIC, CommonDivisor, Filter, StateTable>>(fst, opts);\n    }\n  }\n\n  DeterminizeFst &operator=(const DeterminizeFst &) = delete;\n};\n\nnamespace internal {\n\n// Initialization of transducer determinization implementation, which is defined\n// after DeterminizeFst since it calls it.\ntemplate <class A, GallicType G, class D, class F, class T>\nvoid DeterminizeFstImpl<A, G, D, F, T>::Init(const Fst<A> &fst, F *filter) {\n  // Mapper to an acceptor.\n  const ToFst to_fst(fst, ToMapper());\n  auto *to_filter = filter ? new ToFilter(to_fst, filter) : nullptr;\n  // This recursive call terminates since it is to a (non-recursive)\n  // different constructor.\n  const CacheOptions copts(GetCacheGc(), GetCacheLimit());\n  const DeterminizeFstOptions<ToArc, ToCommonDivisor, ToFilter, ToStateTable>\n      dopts(copts, delta_, 0, DETERMINIZE_FUNCTIONAL, false, to_filter);\n  // Uses acceptor-only constructor to avoid template recursion.\n  const DeterminizeFst<ToArc> det_fsa(to_fst, nullptr, nullptr, dopts);\n  // Mapper back to transducer.\n  const FactorWeightOptions<ToArc> fopts(\n      CacheOptions(true, 0), delta_, kFactorFinalWeights, subsequential_label_,\n      subsequential_label_, increment_subsequential_label_,\n      increment_subsequential_label_);\n  const FactorWeightFst<ToArc, FactorIterator> factored_fst(det_fsa, fopts);\n  from_fst_.reset(new FromFst(factored_fst, FromMapper(subsequential_label_)));\n}\n\n}  // namespace internal\n\n// Specialization for DeterminizeFst.\ntemplate <class Arc>\nclass StateIterator<DeterminizeFst<Arc>>\n    : public CacheStateIterator<DeterminizeFst<Arc>> {\n public:\n  explicit StateIterator(const DeterminizeFst<Arc> &fst)\n      : CacheStateIterator<DeterminizeFst<Arc>>(fst, fst.GetMutableImpl()) {}\n};\n\n// Specialization for DeterminizeFst.\ntemplate <class Arc>\nclass ArcIterator<DeterminizeFst<Arc>>\n    : public CacheArcIterator<DeterminizeFst<Arc>> {\n public:\n  using StateId = typename Arc::StateId;\n\n  ArcIterator(const DeterminizeFst<Arc> &fst, StateId s)\n      : CacheArcIterator<DeterminizeFst<Arc>>(fst.GetMutableImpl(), s) {\n    if (!fst.GetImpl()->HasArcs(s)) fst.GetMutableImpl()->Expand(s);\n  }\n};\n\ntemplate <class Arc>\ninline void DeterminizeFst<Arc>::InitStateIterator(\n    StateIteratorData<Arc> *data) const {\n  data->base = new StateIterator<DeterminizeFst<Arc>>(*this);\n}\n\n// Useful aliases when using StdArc.\nusing StdDeterminizeFst = DeterminizeFst<StdArc>;\n\ntemplate <class Arc>\nstruct DeterminizeOptions {\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  float delta;                // Quantization delta for subset weights.\n  Weight weight_threshold;    // Pruning weight threshold.\n  StateId state_threshold;    // Pruning state threshold.\n  Label subsequential_label;  // Label used for residual final output.\n  DeterminizeType type;\n  bool increment_subsequential_label;  // When creating several subsequential\n                                       // arcs at a given state, make their\n                                       // label distinct by incrementation?\n\n  explicit DeterminizeOptions(float delta = kDelta,\n                              Weight weight_threshold = Weight::Zero(),\n                              StateId state_threshold = kNoStateId,\n                              Label subsequential_label = 0,\n                              DeterminizeType type = DETERMINIZE_FUNCTIONAL,\n                              bool increment_subsequential_label = false)\n      : delta(delta),\n        weight_threshold(std::move(weight_threshold)),\n        state_threshold(state_threshold),\n        subsequential_label(subsequential_label),\n        type(type),\n        increment_subsequential_label(increment_subsequential_label) {}\n};\n\n// Determinizes a weighted transducer. This version writes the\n// determinized Fst to an output MutableFst. The result will be an\n// equivalent FST that has the property that no state has two\n// transitions with the same input label. For this algorithm, epsilon\n// transitions are treated as regular symbols (cf. RmEpsilon).\n//\n// The transducer must be functional. The weights must be (weakly)\n// left divisible (valid for TropicalWeight and LogWeight).\n//\n// Complexity:\n//\n//   Determinizable: exponential (polynomial in the size of the output)\n//   Non-determinizable: does not terminate\n//\n// The determinizable automata include all unweighted and all acyclic input.\ntemplate <class Arc>\nvoid Determinize(\n    const Fst<Arc> &ifst, MutableFst<Arc> *ofst,\n    const DeterminizeOptions<Arc> &opts = DeterminizeOptions<Arc>()) {\n  using Weight = typename Arc::Weight;\n  DeterminizeFstOptions<Arc> nopts;\n  nopts.delta = opts.delta;\n  nopts.subsequential_label = opts.subsequential_label;\n  nopts.type = opts.type;\n  nopts.increment_subsequential_label = opts.increment_subsequential_label;\n  nopts.gc_limit = 0;  // Caches only the last state for fastest copy.\n  if (opts.weight_threshold != Weight::Zero() ||\n      opts.state_threshold != kNoStateId) {\n    if (ifst.Properties(kAcceptor, false)) {\n      std::vector<Weight> idistance;\n      std::vector<Weight> odistance;\n      ShortestDistance(ifst, &idistance, true);\n      DeterminizeFst<Arc> dfst(ifst, &idistance, &odistance, nopts);\n      PruneOptions<Arc, AnyArcFilter<Arc>> popts(\n          opts.weight_threshold, opts.state_threshold, AnyArcFilter<Arc>(),\n          &odistance);\n      Prune(dfst, ofst, popts);\n    } else {\n      *ofst = DeterminizeFst<Arc>(ifst, nopts);\n      Prune(ofst, opts.weight_threshold, opts.state_threshold);\n    }\n  } else {\n    *ofst = DeterminizeFst<Arc>(ifst, nopts);\n  }\n}\n\n}  // namespace fst\n\n#endif  // FST_DETERMINIZE_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/dfs-visit.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Depth-first search visitation. See visit.h for more general search queue\n// disciplines.\n\n#ifndef FST_DFS_VISIT_H_\n#define FST_DFS_VISIT_H_\n\n#include <stack>\n#include <vector>\n\n#include <fst/arcfilter.h>\n#include <fst/fst.h>\n\n\nnamespace fst {\n\n// Visitor Interface: class determining actions taken during a depth-first\n// search-style visit. If any of the boolean member functions return false, the\n// DFS is aborted by first calling FinishState() on all currently grey states\n// and then calling FinishVisit().\n//\n// This is similar to the more general visitor interface in visit.h, except\n// that FinishState returns additional information appropriate only for a DFS\n// and some methods names here are better suited to a DFS.\n//\n// template <class Arc>\n// class Visitor {\n//  public:\n//   using StateId = typename Arc::StateId;\n//\n//   Visitor(T *return_data);\n//\n//   // Invoked before DFS visit.\n//   void InitVisit(const Fst<Arc> &fst);\n//\n//   // Invoked when state discovered (2nd arg is DFS tree root).\n//   bool InitState(StateId s, StateId root);\n//\n//   // Invoked when tree arc to white/undiscovered state examined.\n//   bool TreeArc(StateId s, const Arc &arc);\n//\n//   // Invoked when back arc to grey/unfinished state examined.\n//   bool BackArc(StateId s, const Arc &arc);\n//\n//   // Invoked when forward or cross arc to black/finished state examined.\n//   bool ForwardOrCrossArc(StateId s, const Arc &arc);\n//\n//   // Invoked when state finished ('s' is tree root, 'parent' is kNoStateId,\n//   // and 'arc' is nullptr).\n//   void FinishState(StateId s, StateId parent, const Arc *arc);\n//\n//   // Invoked after DFS visit.\n//   void FinishVisit();\n// };\n\nnamespace internal {\n\n// An FST state's DFS stack state.\ntemplate <class FST>\nstruct DfsState {\n  using Arc = typename FST::Arc;\n  using StateId = typename Arc::StateId;\n\n  DfsState(const FST &fst, StateId s) : state_id(s), arc_iter(fst, s) {}\n\n  void *operator new(size_t size, MemoryPool<DfsState<FST>> *pool) {\n    return pool->Allocate();\n  }\n\n  static void Destroy(DfsState<FST> *dfs_state,\n                      MemoryPool<DfsState<FST>> *pool) {\n    if (dfs_state) {\n      dfs_state->~DfsState<FST>();\n      pool->Free(dfs_state);\n    }\n  }\n\n  StateId state_id;           // FST state.\n  ArcIterator<FST> arc_iter;  // The corresponding arcs.\n};\n\n}  // namespace internal\n\n// Performs depth-first visitation. Visitor class argument determines actions\n// and contains any return data. ArcFilter determines arcs that are considered.\n// If 'access_only' is true, performs visitation only to states accessible from\n// the initial state.\n//\n// Note this is similar to Visit() in visit.h called with a LIFO queue, except\n// this version has a Visitor class specialized and augmented for a DFS.\ntemplate <class FST, class Visitor, class ArcFilter>\nvoid DfsVisit(const FST &fst, Visitor *visitor, ArcFilter filter,\n              bool access_only = false) {\n  using Arc = typename FST::Arc;\n  using StateId = typename Arc::StateId;\n  visitor->InitVisit(fst);\n  const auto start = fst.Start();\n  if (start == kNoStateId) {\n    visitor->FinishVisit();\n    return;\n  }\n  // An FST state's DFS status\n  static constexpr uint8 kDfsWhite = 0;  // Undiscovered.\n  static constexpr uint8 kDfsGrey = 1;   // Discovered but unfinished.\n  static constexpr uint8 kDfsBlack = 2;  // Finished.\n  std::vector<uint8> state_color;\n  std::stack<internal::DfsState<FST> *> state_stack;  // DFS execution stack.\n  MemoryPool<internal::DfsState<FST>> state_pool;     // Pool for DFSStates.\n  auto nstates = start + 1;  // Number of known states in general case.\n  bool expanded = false;\n  if (fst.Properties(kExpanded, false)) {  // Tests if expanded case, then\n    nstates = CountStates(fst);            // uses ExpandedFst::NumStates().\n    expanded = true;\n  }\n  state_color.resize(nstates, kDfsWhite);\n  StateIterator<FST> siter(fst);\n  // Continue DFS while true.\n  bool dfs = true;\n  // Iterate over trees in DFS forest.\n  for (auto root = start; dfs && root < nstates;) {\n    state_color[root] = kDfsGrey;\n    state_stack.push(new (&state_pool) internal::DfsState<FST>(fst, root));\n    dfs = visitor->InitState(root, root);\n    while (!state_stack.empty()) {\n      auto *dfs_state = state_stack.top();\n      const auto s = dfs_state->state_id;\n      if (s >= state_color.size()) {\n        nstates = s + 1;\n        state_color.resize(nstates, kDfsWhite);\n      }\n      ArcIterator<FST> &aiter = dfs_state->arc_iter;\n      if (!dfs || aiter.Done()) {\n        state_color[s] = kDfsBlack;\n        internal::DfsState<FST>::Destroy(dfs_state, &state_pool);\n        state_stack.pop();\n        if (!state_stack.empty()) {\n          auto *parent_state = state_stack.top();\n          auto &piter = parent_state->arc_iter;\n          visitor->FinishState(s, parent_state->state_id, &piter.Value());\n          piter.Next();\n        } else {\n          visitor->FinishState(s, kNoStateId, nullptr);\n        }\n        continue;\n      }\n      const auto &arc = aiter.Value();\n      if (arc.nextstate >= state_color.size()) {\n        nstates = arc.nextstate + 1;\n        state_color.resize(nstates, kDfsWhite);\n      }\n      if (!filter(arc)) {\n        aiter.Next();\n        continue;\n      }\n      const auto next_color = state_color[arc.nextstate];\n      switch (next_color) {\n        default:\n        case kDfsWhite:\n          dfs = visitor->TreeArc(s, arc);\n          if (!dfs) break;\n          state_color[arc.nextstate] = kDfsGrey;\n          state_stack.push(new (&state_pool)\n                               internal::DfsState<FST>(fst, arc.nextstate));\n          dfs = visitor->InitState(arc.nextstate, root);\n          break;\n        case kDfsGrey:\n          dfs = visitor->BackArc(s, arc);\n          aiter.Next();\n          break;\n        case kDfsBlack:\n          dfs = visitor->ForwardOrCrossArc(s, arc);\n          aiter.Next();\n          break;\n      }\n    }\n    if (access_only) break;\n    // Finds next tree root.\n    for (root = root == start ? 0 : root + 1;\n         root < nstates && state_color[root] != kDfsWhite; ++root) {\n    }\n    // Checks for a state beyond the largest known state.\n    if (!expanded && root == nstates) {\n      for (; !siter.Done(); siter.Next()) {\n        if (siter.Value() == nstates) {\n          ++nstates;\n          state_color.push_back(kDfsWhite);\n          break;\n        }\n      }\n    }\n  }\n  visitor->FinishVisit();\n}\n\ntemplate <class Arc, class Visitor>\nvoid DfsVisit(const Fst<Arc> &fst, Visitor *visitor) {\n  DfsVisit(fst, visitor, AnyArcFilter<Arc>());\n}\n\n}  // namespace fst\n\n#endif  // FST_DFS_VISIT_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/difference.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Class to compute the difference between two FSAs.\n\n#ifndef FST_DIFFERENCE_H_\n#define FST_DIFFERENCE_H_\n\n#include <memory>\n\n\n#include <fst/cache.h>\n#include <fst/complement.h>\n#include <fst/compose.h>\n\n\nnamespace fst {\n\ntemplate <class Arc, class M = Matcher<Fst<Arc>>,\n          class Filter = SequenceComposeFilter<M>,\n          class StateTable =\n              GenericComposeStateTable<Arc, typename Filter::FilterState>>\nstruct DifferenceFstOptions\n    : public ComposeFstOptions<Arc, M, Filter, StateTable> {\n  explicit DifferenceFstOptions(const CacheOptions &opts = CacheOptions(),\n                                M *matcher1 = nullptr, M *matcher2 = nullptr,\n                                Filter *filter = nullptr,\n                                StateTable *state_table = nullptr)\n      : ComposeFstOptions<Arc, M, Filter, StateTable>(opts, matcher1, matcher2,\n                                                      filter, state_table) {}\n};\n\n// Computes the difference between two FSAs. This version is a delayed FST.\n// Only strings that are in the first automaton but not in second are retained\n// in the result.\n//\n// The first argument must be an acceptor; the second argument must be an\n// unweighted, epsilon-free, deterministic acceptor. One of the arguments must\n// be label-sorted.\n//\n// Complexity: same as ComposeFst.\n//\n// Caveats: same as ComposeFst.\ntemplate <class A>\nclass DifferenceFst : public ComposeFst<A> {\n public:\n  using Arc = A;\n  using Weight = typename Arc::Weight;\n  using StateId = typename Arc::StateId;\n\n  using ComposeFst<Arc>::CreateBase1;\n\n  // A - B = A ^ B'.\n  DifferenceFst(const Fst<Arc> &fst1, const Fst<Arc> &fst2,\n                const CacheOptions &opts = CacheOptions())\n      : ComposeFst<Arc>(CreateDifferenceImplWithCacheOpts(fst1, fst2, opts)) {\n    if (!fst1.Properties(kAcceptor, true)) {\n      FSTERROR() << \"DifferenceFst: 1st argument not an acceptor\";\n      GetImpl()->SetProperties(kError, kError);\n    }\n  }\n\n  template <class Matcher, class Filter, class StateTable>\n  DifferenceFst(\n      const Fst<Arc> &fst1, const Fst<Arc> &fst2,\n      const DifferenceFstOptions<Arc, Matcher, Filter, StateTable> &opts)\n      : ComposeFst<Arc>(\n            CreateDifferenceImplWithDifferenceOpts(fst1, fst2, opts)) {\n    if (!fst1.Properties(kAcceptor, true)) {\n      FSTERROR() << \"DifferenceFst: 1st argument not an acceptor\";\n      GetImpl()->SetProperties(kError, kError);\n    }\n  }\n\n  // See Fst<>::Copy() for doc.\n  DifferenceFst(const DifferenceFst<Arc> &fst, bool safe = false)\n      : ComposeFst<Arc>(fst, safe) {}\n\n  // Get a copy of this DifferenceFst. See Fst<>::Copy() for further doc.\n  DifferenceFst<Arc> *Copy(bool safe = false) const override {\n    return new DifferenceFst<Arc>(*this, safe);\n  }\n\n private:\n  using Impl = internal::ComposeFstImplBase<Arc>;\n  using ImplToFst<Impl>::GetImpl;\n\n  static std::shared_ptr<Impl> CreateDifferenceImplWithCacheOpts(\n      const Fst<Arc> &fst1, const Fst<Arc> &fst2, const CacheOptions &opts) {\n    using RM = RhoMatcher<Matcher<Fst<A>>>;\n    ComplementFst<Arc> cfst(fst2);\n    ComposeFstOptions<A, RM> copts(\n        CacheOptions(), new RM(fst1, MATCH_NONE),\n        new RM(cfst, MATCH_INPUT, ComplementFst<Arc>::kRhoLabel));\n    return CreateBase1(fst1, cfst, copts);\n  }\n\n  template <class Matcher, class Filter, class StateTable>\n  static std::shared_ptr<Impl> CreateDifferenceImplWithDifferenceOpts(\n      const Fst<Arc> &fst1, const Fst<Arc> &fst2,\n      const DifferenceFstOptions<Arc, Matcher, Filter, StateTable> &opts) {\n    using RM = RhoMatcher<Matcher>;\n    ComplementFst<Arc> cfst(fst2);\n    ComposeFstOptions<Arc, RM> copts(opts);\n    copts.matcher1 = new RM(fst1, MATCH_NONE, kNoLabel, MATCHER_REWRITE_ALWAYS,\n                            opts.matcher1);\n    copts.matcher2 = new RM(cfst, MATCH_INPUT, ComplementFst<Arc>::kRhoLabel,\n                            MATCHER_REWRITE_ALWAYS, opts.matcher2);\n    return CreateBase1(fst1, cfst, copts);\n  }\n};\n\n// Specialization for DifferenceFst.\ntemplate <class Arc>\nclass StateIterator<DifferenceFst<Arc>>\n    : public StateIterator<ComposeFst<Arc>> {\n public:\n  explicit StateIterator(const DifferenceFst<Arc> &fst)\n      : StateIterator<ComposeFst<Arc>>(fst) {}\n};\n\n// Specialization for DifferenceFst.\ntemplate <class Arc>\nclass ArcIterator<DifferenceFst<Arc>> : public ArcIterator<ComposeFst<Arc>> {\n public:\n  using StateId = typename Arc::StateId;\n\n  ArcIterator(const DifferenceFst<Arc> &fst, StateId s)\n      : ArcIterator<ComposeFst<Arc>>(fst, s) {}\n};\n\nusing DifferenceOptions = ComposeOptions;\n\n// Useful alias when using StdArc.\nusing StdDifferenceFst = DifferenceFst<StdArc>;\n\nusing DifferenceOptions = ComposeOptions;\n\n// Computes the difference between two FSAs. This version writes the difference\n// to an output MutableFst. Only strings that are in the first automaton but not\n// in the second are retained in the result.\n//\n// The first argument must be an acceptor; the second argument must be an\n// unweighted, epsilon-free, deterministic acceptor. One of the arguments must\n// be label-sorted.\n//\n// Complexity: same as Compose.\n//\n// Caveats: same as Compose.\ntemplate <class Arc>\nvoid Difference(const Fst<Arc> &ifst1, const Fst<Arc> &ifst2,\n                MutableFst<Arc> *ofst,\n                const DifferenceOptions &opts = DifferenceOptions()) {\n  using M = Matcher<Fst<Arc>>;\n  if (opts.filter_type == AUTO_FILTER) {\n    CacheOptions nopts;\n    nopts.gc_limit = 0;  // Cache only the last state for fastest copy.\n    *ofst = DifferenceFst<Arc>(ifst1, ifst2, nopts);\n  } else if (opts.filter_type == SEQUENCE_FILTER) {\n    DifferenceFstOptions<Arc> dopts;\n    dopts.gc_limit = 0;  // Cache only the last state for fastest copy.\n    *ofst = DifferenceFst<Arc>(ifst1, ifst2, dopts);\n  } else if (opts.filter_type == ALT_SEQUENCE_FILTER) {\n    DifferenceFstOptions<Arc, M, AltSequenceComposeFilter<M>> dopts;\n    dopts.gc_limit = 0;  // Cache only the last state for fastest copy.\n    *ofst = DifferenceFst<Arc>(ifst1, ifst2, dopts);\n  } else if (opts.filter_type == MATCH_FILTER) {\n    DifferenceFstOptions<Arc, M, MatchComposeFilter<M>> dopts;\n    dopts.gc_limit = 0;  // Cache only the last state for fastest copy.\n    *ofst = DifferenceFst<Arc>(ifst1, ifst2, dopts);\n  }\n  if (opts.connect) Connect(ofst);\n}\n\n}  // namespace fst\n\n#endif  // FST_DIFFERENCE_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/disambiguate.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Functions and classes to disambiguate an FST.\n\n#ifndef FST_DISAMBIGUATE_H_\n#define FST_DISAMBIGUATE_H_\n\n#include <list>\n#include <map>\n#include <set>\n#include <utility>\n#include <vector>\n\n#include <fst/arcsort.h>\n#include <fst/compose.h>\n#include <fst/connect.h>\n#include <fst/determinize.h>\n#include <fst/dfs-visit.h>\n#include <fst/project.h>\n#include <fst/prune.h>\n#include <fst/state-map.h>\n#include <fst/state-table.h>\n#include <fst/union-find.h>\n#include <fst/verify.h>\n\n\nnamespace fst {\n\ntemplate <class Arc>\nstruct DisambiguateOptions : public DeterminizeOptions<Arc> {\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  explicit DisambiguateOptions(float delta = kDelta,\n                               Weight weight = Weight::Zero(),\n                               StateId n = kNoStateId, Label label = 0)\n      : DeterminizeOptions<Arc>(delta, std::move(weight), n, label,\n                                DETERMINIZE_FUNCTIONAL) {}\n};\n\nnamespace internal {\n\n// A determinization filter based on a subset element relation. The relation is\n// assumed to be reflexive and symmetric.\ntemplate <class Arc, class Relation>\nclass RelationDeterminizeFilter {\n public:\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using FilterState = IntegerFilterState<StateId>;\n  using StateTuple = DeterminizeStateTuple<Arc, FilterState>;\n  using Subset = typename StateTuple::Subset;\n  using Element = typename StateTuple::Element;\n  using LabelMap = std::multimap<Label, DeterminizeArc<StateTuple>>;\n\n  // This is needed (e.g.) to go into the gallic domain for transducers; there\n  // is no need to rebind the relation since its use here only depends on the\n  // state IDs.\n  template <class A>\n  struct rebind {\n    using Other = RelationDeterminizeFilter<A, Relation>;\n  };\n\n  explicit RelationDeterminizeFilter(const Fst<Arc> &fst)\n      : fst_(fst.Copy()), r_(new Relation()), s_(kNoStateId), head_(nullptr) {}\n\n  // Ownership of the relation is given to this class.\n  RelationDeterminizeFilter(const Fst<Arc> &fst, Relation *r)\n      : fst_(fst.Copy()), r_(r), s_(kNoStateId), head_(0) {}\n\n  // Ownership of the relation is given to this class.\n  RelationDeterminizeFilter(const Fst<Arc> &fst, Relation *r,\n                            std::vector<StateId> *head)\n      : fst_(fst.Copy()), r_(r), s_(kNoStateId), head_(head) {}\n\n  // This is needed, e.g., to go into the gallic domain for transducers.\n  // Ownership of the templated filter argument is given to this class.\n  template <class Filter>\n  RelationDeterminizeFilter(const Fst<Arc> &fst, Filter *filter)\n      : fst_(fst.Copy()),\n        r_(new Relation(filter->GetRelation())),\n        s_(kNoStateId),\n        head_(filter->GetHeadStates()) {\n    delete filter;\n  }\n\n  // Copy constructor; the FST can be passed if it has been deep-copied.\n  RelationDeterminizeFilter(const RelationDeterminizeFilter &filter,\n                            const Fst<Arc> *fst = nullptr)\n      : fst_(fst ? fst->Copy() : filter.fst_->Copy()),\n        r_(new Relation(*filter.r_)),\n        s_(kNoStateId),\n        head_() {}\n\n  FilterState Start() const { return FilterState(fst_->Start()); }\n\n  void SetState(StateId s, const StateTuple &tuple) {\n    if (s_ != s) {\n      s_ = s;\n      tuple_ = &tuple;\n      const auto head = tuple.filter_state.GetState();\n      is_final_ = fst_->Final(head) != Weight::Zero();\n      if (head_) {\n        if (head_->size() <= s) head_->resize(s + 1, kNoStateId);\n        (*head_)[s] = head;\n      }\n    }\n  }\n\n  // Filters transition, possibly modifying label map. Returns true if arc is\n  // added to label map.\n  bool FilterArc(const Arc &arc, const Element &src_element,\n                 const Element &dest_element, LabelMap *label_map) const;\n\n  // Filters super-final transition, returning new final weight.\n  Weight FilterFinal(const Weight final_weight, const Element &element) const {\n    return is_final_ ? final_weight : Weight::Zero();\n  }\n\n  static uint64 Properties(uint64 props) {\n    return props & ~(kIDeterministic | kODeterministic);\n  }\n\n  const Relation &GetRelation() { return *r_; }\n\n  std::vector<StateId> *GetHeadStates() { return head_; }\n\n private:\n  // Pairs arc labels with state tuples with possible heads and empty subsets.\n  void InitLabelMap(LabelMap *label_map) const;\n\n  std::unique_ptr<Fst<Arc>> fst_;  // Input FST.\n  std::unique_ptr<Relation> r_;    // Relation compatible with inv. trans. fnc.\n  StateId s_;                      // Current state.\n  const StateTuple *tuple_;        // Current tuple.\n  bool is_final_;                  // Is the current head state final?\n  std::vector<StateId> *head_;     // Head state for a given state,\n                                   // owned by the Disambiguator.\n};\n\ntemplate <class Arc, class Relation>\nbool RelationDeterminizeFilter<Arc, Relation>::FilterArc(\n    const Arc &arc, const Element &src_element, const Element &dest_element,\n    LabelMap *label_map) const {\n  bool added = false;\n  if (label_map->empty()) InitLabelMap(label_map);\n  // Adds element to state tuple if element state is related to tuple head.\n  for (auto liter = label_map->lower_bound(arc.ilabel);\n       liter != label_map->end() && liter->first == arc.ilabel; ++liter) {\n    auto *dest_tuple = liter->second.dest_tuple;\n    const auto dest_head = dest_tuple->filter_state.GetState();\n    if ((*r_)(dest_element.state_id, dest_head)) {\n      dest_tuple->subset.push_front(dest_element);\n      added = true;\n    }\n  }\n  return added;\n}\n\ntemplate <class Arc, class Relation>\nvoid RelationDeterminizeFilter<Arc, Relation>::InitLabelMap(\n    LabelMap *label_map) const {\n  const auto src_head = tuple_->filter_state.GetState();\n  Label label = kNoLabel;\n  StateId nextstate = kNoStateId;\n  for (ArcIterator<Fst<Arc>> aiter(*fst_, src_head); !aiter.Done();\n       aiter.Next()) {\n    const auto &arc = aiter.Value();\n    // Continues if multiarc.\n    if (arc.ilabel == label && arc.nextstate == nextstate) continue;\n    DeterminizeArc<StateTuple> det_arc(arc);\n    det_arc.dest_tuple->filter_state = FilterState(arc.nextstate);\n    label_map->insert(std::make_pair(arc.ilabel, det_arc));\n    label = arc.ilabel;\n    nextstate = arc.nextstate;\n  }\n}\n\n// Helper class to disambiguate an FST via Disambiguate().\ntemplate <class Arc>\nclass Disambiguator {\n public:\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  // IDs arcs with state ID and arc position. Arc position -1 indicates final\n  // (super-final transition).\n  using ArcId = std::pair<StateId, ssize_t>;\n\n  Disambiguator() : error_(false) {}\n\n  void Disambiguate(\n      const Fst<Arc> &ifst, MutableFst<Arc> *ofst,\n      const DisambiguateOptions<Arc> &opts = DisambiguateOptions<Arc>()) {\n    VectorFst<Arc> sfst(ifst);\n    Connect(&sfst);\n    ArcSort(&sfst, ArcCompare());\n    PreDisambiguate(sfst, ofst, opts);\n    ArcSort(ofst, ArcCompare());\n    FindAmbiguities(*ofst);\n    RemoveSplits(ofst);\n    MarkAmbiguities();\n    RemoveAmbiguities(ofst);\n    if (error_) ofst->SetProperties(kError, kError);\n  }\n\n private:\n  // Comparison functor for comparing input labels and next states of arcs. This\n  // sort order facilitates the predisambiguation.\n  class ArcCompare {\n   public:\n    bool operator()(const Arc &arc1, const Arc &arc2) const {\n      return arc1.ilabel < arc2.ilabel ||\n             (arc1.ilabel == arc2.ilabel && arc1.nextstate < arc2.nextstate);\n    }\n\n    uint64 Properties(uint64 props) const {\n      return (props & kArcSortProperties) | kILabelSorted |\n             (props & kAcceptor ? kOLabelSorted : 0);\n    }\n  };\n\n  // Comparison functor for comparing transitions represented by their arc ID.\n  // This sort order facilitates ambiguity detection.\n  class ArcIdCompare {\n   public:\n    explicit ArcIdCompare(const std::vector<StateId> &head) : head_(head) {}\n\n    bool operator()(const ArcId &a1, const ArcId &a2) const {\n      // Sort first by source head state...\n      const auto src1 = a1.first;\n      const auto src2 = a2.first;\n      const auto head1 = head_[src1];\n      const auto head2 = head_[src2];\n      if (head1 < head2) return true;\n      if (head2 < head1) return false;\n      // ...then by source state...\n      if (src1 < src2) return true;\n      if (src2 < src1) return false;\n      // ...then by position.\n      return a1.second < a2.second;\n    }\n\n   private:\n    const std::vector<StateId> &head_;\n  };\n\n  // A relation that determines if two states share a common future.\n  class CommonFuture {\n   public:\n    using StateTable = GenericComposeStateTable<Arc, TrivialFilterState>;\n    using StateTuple = typename StateTable::StateTuple;\n\n    // Needed for compilation with DeterminizeRelationFilter.\n    CommonFuture() {\n      FSTERROR() << \"Disambiguate::CommonFuture: FST not provided\";\n    }\n\n    explicit CommonFuture(const Fst<Arc> &ifst) {\n      using M = Matcher<Fst<Arc>>;\n      ComposeFstOptions<Arc, M, NullComposeFilter<M>> opts;\n      // Ensures composition is between acceptors.\n      const bool trans = ifst.Properties(kNotAcceptor, true);\n      const auto *fsa =\n          trans ? new ProjectFst<Arc>(ifst, PROJECT_INPUT) : &ifst;\n      opts.state_table = new StateTable(*fsa, *fsa);\n      const ComposeFst<Arc> cfst(*fsa, *fsa, opts);\n      std::vector<bool> coaccess;\n      uint64 props = 0;\n      SccVisitor<Arc> scc_visitor(nullptr, nullptr, &coaccess, &props);\n      DfsVisit(cfst, &scc_visitor);\n      for (StateId s = 0; s < coaccess.size(); ++s) {\n        if (coaccess[s]) {\n          related_.insert(opts.state_table->Tuple(s).StatePair());\n        }\n      }\n      if (trans) delete fsa;\n    }\n\n    bool operator()(const StateId s1, StateId s2) const {\n      return related_.count(std::make_pair(s1, s2)) > 0;\n    }\n\n   private:\n    // States s1 and s2 resp. are in this relation iff they there is a\n    // path from s1 to a final state that has the same label as some\n    // path from s2 to a final state.\n    std::set<std::pair<StateId, StateId>> related_;\n  };\n\n  using ArcIdMap = std::multimap<ArcId, ArcId, ArcIdCompare>;\n\n  // Inserts candidate into the arc ID map.\n  inline void InsertCandidate(StateId s1, StateId s2, const ArcId &a1,\n                              const ArcId &a2) {\n    candidates_->insert(head_[s1] > head_[s2] ? std::make_pair(a1, a2)\n                                              : std::make_pair(a2, a1));\n  }\n\n  // Returns the arc corresponding to ArcId a.\n  static Arc GetArc(const Fst<Arc> &fst, ArcId aid) {\n    if (aid.second == -1) {  // Returns super-final transition.\n      return Arc(kNoLabel, kNoLabel, fst.Final(aid.first), kNoStateId);\n    } else {\n      ArcIterator<Fst<Arc>> aiter(fst, aid.first);\n      aiter.Seek(aid.second);\n      return aiter.Value();\n    }\n  }\n\n  // Outputs an equivalent FST whose states are subsets of states that have a\n  // future path in common.\n  void PreDisambiguate(const ExpandedFst<Arc> &ifst, MutableFst<Arc> *ofst,\n                       const DisambiguateOptions<Arc> &opts);\n\n  // Finds transitions that are ambiguous candidates in the result of\n  // PreDisambiguate.\n  void FindAmbiguities(const ExpandedFst<Arc> &fst);\n\n  // Finds transition pairs that are ambiguous candidates from two specified\n  // source states.\n  void FindAmbiguousPairs(const ExpandedFst<Arc> &fst, StateId s1, StateId s2);\n\n  // Marks ambiguous transitions to be removed.\n  void MarkAmbiguities();\n\n  // Deletes spurious ambiguous transitions (due to quantization).\n  void RemoveSplits(MutableFst<Arc> *ofst);\n\n  // Deletes actual ambiguous transitions.\n  void RemoveAmbiguities(MutableFst<Arc> *ofst);\n\n  // States s1 and s2 are in this relation iff there is a path from the initial\n  // state to s1 that has the same label as some path from the initial state to\n  // s2. We store only state pairs s1, s2 such that s1 <= s2.\n  std::set<std::pair<StateId, StateId>> coreachable_;\n\n  // Queue of disambiguation-related states to be processed. We store only\n  // state pairs s1, s2 such that s1 <= s2.\n  std::list<std::pair<StateId, StateId>> queue_;\n\n  // Head state in the pre-disambiguation for a given state.\n  std::vector<StateId> head_;\n\n  // Maps from a candidate ambiguous arc A to each ambiguous candidate arc B\n  // with the same label and destination state as A, whose source state s' is\n  // coreachable with the source state s of A, and for which head(s') < head(s).\n  std::unique_ptr<ArcIdMap> candidates_;\n\n  // Set of ambiguous transitions to be removed.\n  std::set<ArcId> ambiguous_;\n\n  // States to merge due to quantization issues.\n  std::unique_ptr<UnionFind<StateId>> merge_;\n  // Marks error condition.\n  bool error_;\n\n  Disambiguator(const Disambiguator &) = delete;\n  Disambiguator &operator=(const Disambiguator &) = delete;\n};\n\ntemplate <class Arc>\nvoid Disambiguator<Arc>::PreDisambiguate(const ExpandedFst<Arc> &ifst,\n                                         MutableFst<Arc> *ofst,\n                                         const DisambiguateOptions<Arc> &opts) {\n  using CommonDivisor = DefaultCommonDivisor<Weight>;\n  using Filter = RelationDeterminizeFilter<Arc, CommonFuture>;\n  // Subset elements with states s1 and s2 (resp.) are in this relation iff they\n  // there is a path from s1 to a final state that has the same label as some\n  // path from s2 to a final state.\n  auto *common_future = new CommonFuture(ifst);\n  DeterminizeFstOptions<Arc, CommonDivisor, Filter> nopts;\n  nopts.delta = opts.delta;\n  nopts.subsequential_label = opts.subsequential_label;\n  nopts.filter = new Filter(ifst, common_future, &head_);\n  // The filter takes ownership of 'common_future', and determinization takes\n  // ownership of the filter itself.\n  nopts.gc_limit = 0;  // Cache only the last state for fastest copy.\n  if (opts.weight_threshold != Weight::Zero() ||\n      opts.state_threshold != kNoStateId) {\n    /* TODO(riley): fails regression test; understand why\n    if (ifst.Properties(kAcceptor, true)) {\n      std::vector<Weight> idistance, odistance;\n      ShortestDistance(ifst, &idistance, true);\n      DeterminizeFst<Arc> dfst(ifst, &idistance, &odistance, nopts);\n      PruneOptions< Arc, AnyArcFilter<Arc>> popts(opts.weight_threshold,\n                                                   opts.state_threshold,\n                                                   AnyArcFilter<Arc>(),\n                                                   &odistance);\n      Prune(dfst, ofst, popts);\n      } else */ {\n      *ofst = DeterminizeFst<Arc>(ifst, nopts);\n      Prune(ofst, opts.weight_threshold, opts.state_threshold);\n    }\n  } else {\n    *ofst = DeterminizeFst<Arc>(ifst, nopts);\n  }\n  head_.resize(ofst->NumStates(), kNoStateId);\n}\n\ntemplate <class Arc>\nvoid Disambiguator<Arc>::FindAmbiguities(const ExpandedFst<Arc> &fst) {\n  if (fst.Start() == kNoStateId) return;\n  candidates_.reset(new ArcIdMap(ArcIdCompare(head_)));\n  const auto start_pr = std::make_pair(fst.Start(), fst.Start());\n  coreachable_.insert(start_pr);\n  queue_.push_back(start_pr);\n  while (!queue_.empty()) {\n    const auto &pr = queue_.front();\n    const auto s1 = pr.first;\n    const auto s2 = pr.second;\n    queue_.pop_front();\n    FindAmbiguousPairs(fst, s1, s2);\n  }\n}\n\ntemplate <class Arc>\nvoid Disambiguator<Arc>::FindAmbiguousPairs(const ExpandedFst<Arc> &fst,\n                                            StateId s1, StateId s2) {\n  if (fst.NumArcs(s2) > fst.NumArcs(s1)) FindAmbiguousPairs(fst, s2, s1);\n  SortedMatcher<Fst<Arc>> matcher(fst, MATCH_INPUT);\n  matcher.SetState(s2);\n  for (ArcIterator<Fst<Arc>> aiter(fst, s1); !aiter.Done(); aiter.Next()) {\n    const auto &arc1 = aiter.Value();\n    const ArcId a1(s1, aiter.Position());\n    if (matcher.Find(arc1.ilabel)) {\n      for (; !matcher.Done(); matcher.Next()) {\n        const auto &arc2 = matcher.Value();\n        // Continues on implicit epsilon match.\n        if (arc2.ilabel == kNoLabel) continue;\n        const ArcId a2(s2, matcher.Position());\n        // Actual transition is ambiguous.\n        if (s1 != s2 && arc1.nextstate == arc2.nextstate) {\n          InsertCandidate(s1, s2, a1, a2);\n        }\n        const auto spr = arc1.nextstate <= arc2.nextstate\n                             ? std::make_pair(arc1.nextstate, arc2.nextstate)\n                             : std::make_pair(arc2.nextstate, arc1.nextstate);\n        // Not already marked as coreachable?\n        if (coreachable_.insert(spr).second) {\n          // Only possible if state split by quantization issues.\n          if (spr.first != spr.second &&\n              head_[spr.first] == head_[spr.second]) {\n            if (!merge_) {\n              merge_.reset(new UnionFind<StateId>(fst.NumStates(), kNoStateId));\n              merge_->MakeAllSet(fst.NumStates());\n            }\n            merge_->Union(spr.first, spr.second);\n          } else {\n            queue_.push_back(spr);\n          }\n        }\n      }\n    }\n  }\n  // Super-final transition is ambiguous.\n  if (s1 != s2 && fst.Final(s1) != Weight::Zero() &&\n      fst.Final(s2) != Weight::Zero()) {\n    const ArcId a1(s1, -1);\n    const ArcId a2(s2, -1);\n    InsertCandidate(s1, s2, a1, a2);\n  }\n}\n\ntemplate <class Arc>\nvoid Disambiguator<Arc>::MarkAmbiguities() {\n  if (!candidates_) return;\n  for (auto it = candidates_->begin(); it != candidates_->end(); ++it) {\n    const auto a = it->first;\n    const auto b = it->second;\n    // If b is not to be removed, then a is.\n    if (ambiguous_.count(b) == 0) ambiguous_.insert(a);\n  }\n  coreachable_.clear();\n  candidates_.reset();\n}\n\ntemplate <class Arc>\nvoid Disambiguator<Arc>::RemoveSplits(MutableFst<Arc> *ofst) {\n  if (!merge_) return;\n  // Merges split states to remove spurious ambiguities.\n  for (StateIterator<MutableFst<Arc>> siter(*ofst); !siter.Done();\n       siter.Next()) {\n    for (MutableArcIterator<MutableFst<Arc>> aiter(ofst, siter.Value());\n         !aiter.Done(); aiter.Next()) {\n      auto arc = aiter.Value();\n      const auto nextstate = merge_->FindSet(arc.nextstate);\n      if (nextstate != arc.nextstate) {\n        arc.nextstate = nextstate;\n        aiter.SetValue(arc);\n      }\n    }\n  }\n  // Repeats search for actual ambiguities on modified FST.\n  coreachable_.clear();\n  merge_.reset();\n  candidates_.reset();\n  FindAmbiguities(*ofst);\n  if (merge_) {  // Shouldn't get here; sanity test.\n    FSTERROR() << \"Disambiguate: Unable to remove spurious ambiguities\";\n    error_ = true;\n    return;\n  }\n}\n\ntemplate <class Arc>\nvoid Disambiguator<Arc>::RemoveAmbiguities(MutableFst<Arc> *ofst) {\n  if (ambiguous_.empty()) return;\n  // Adds dead state to redirect ambiguous transitions to be removed.\n  const auto dead = ofst->AddState();\n  for (auto it = ambiguous_.begin(); it != ambiguous_.end(); ++it) {\n    const auto pos = it->second;\n    if (pos >= 0) {  // Actual transition.\n      MutableArcIterator<MutableFst<Arc>> aiter(ofst, it->first);\n      aiter.Seek(pos);\n      auto arc = aiter.Value();\n      arc.nextstate = dead;\n      aiter.SetValue(arc);\n    } else {  // Super-final transition.\n      ofst->SetFinal(it->first, Weight::Zero());\n    }\n  }\n  Connect(ofst);\n  ambiguous_.clear();\n}\n\n}  // namespace internal\n\n// Disambiguates a weighted FST. This version writes the disambiguated FST to an\n// output MutableFst. The result will be an equivalent FST that has the\n// property that there are not two distinct paths from the initial state to a\n// final state with the same input labeling.\n//\n// The weights must be (weakly) left divisible (valid for Tropical and\n// LogWeight).\n//\n// Complexity:\n//\n//   Disambiguable: exponential (polynomial in the size of the output).\n//   Non-disambiguable: does not terminate.\n//\n// The disambiguable transducers include all automata and functional transducers\n// that are unweighted or that are acyclic or that are unambiguous.\n//\n// For more information, see:\n//\n// Mohri, M. and Riley, M. 2015. On the disambiguation of weighted automata.\n// In CIAA, pages 263-278.\ntemplate <class Arc>\nvoid Disambiguate(\n    const Fst<Arc> &ifst, MutableFst<Arc> *ofst,\n    const DisambiguateOptions<Arc> &opts = DisambiguateOptions<Arc>()) {\n  internal::Disambiguator<Arc> disambiguator;\n  disambiguator.Disambiguate(ifst, ofst, opts);\n}\n\n}  // namespace fst\n\n#endif  // FST_DISAMBIGUATE_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/edit-fst.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// An FST implementation that allows non-destructive edit operations on an\n// existing FST.\n//\n// The EditFst class enables non-destructive edit operations on a wrapped\n// ExpandedFst. The implementation uses copy-on-write semantics at the node\n// level: if a user has an underlying fst on which he or she wants to perform a\n// relatively small number of edits (read: mutations), then this implementation\n// will copy the edited node to an internal MutableFst and perform any edits in\n// situ on that copied node. This class supports all the methods of MutableFst\n// except for DeleteStates(const std::vector<StateId> &); thus, new nodes may\n// also be\n// added, and one may add transitions from existing nodes of the wrapped fst to\n// new nodes.\n//\n// N.B.: The documentation for Fst::Copy(true) says that its behavior is\n// undefined if invoked on an fst that has already been accessed.  This class\n// requires that the Fst implementation it wraps provides consistent, reliable\n// behavior when its Copy(true) method is invoked, where consistent means\n// the graph structure, graph properties and state numbering and do not change.\n// VectorFst and CompactFst, for example, are both well-behaved in this regard.\n\n#ifndef FST_EDIT_FST_H_\n#define FST_EDIT_FST_H_\n\n#include <string>\n#include <unordered_map>\n#include <vector>\n\n#include <fst/log.h>\n\n#include <fst/cache.h>\n\n\nnamespace fst {\nnamespace internal {\n\n// The EditFstData class is a container for all mutable data for EditFstImpl;\n// also, this class provides most of the actual implementation of what EditFst\n// does (that is, most of EditFstImpl's methods delegate to methods in this, the\n// EditFstData class).  Instances of this class are reference-counted and can be\n// shared between otherwise independent EditFstImpl instances. This scheme\n// allows EditFstImpl to implement the thread-safe, copy-on-write semantics\n// required by Fst::Copy(true).\n//\n// template parameters:\n//   A the type of arc to use\n//   WrappedFstT the type of fst wrapped by the EditFst instance that\n//     this EditFstData instance is backing\n//   MutableFstT the type of mutable fst to use internally for edited states;\n//     crucially, MutableFstT::Copy(false) *must* yield an fst that is\n//     thread-safe for reading (VectorFst, for example, has this property)\ntemplate <typename Arc, typename WrappedFstT = ExpandedFst<Arc>,\n          typename MutableFstT = VectorFst<Arc>>\nclass EditFstData {\n public:\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  EditFstData() : num_new_states_(0) {}\n\n  EditFstData(const EditFstData &other)\n      : edits_(other.edits_),\n        external_to_internal_ids_(other.external_to_internal_ids_),\n        edited_final_weights_(other.edited_final_weights_),\n        num_new_states_(other.num_new_states_) {}\n\n  ~EditFstData() {}\n\n  static EditFstData<Arc, WrappedFstT, MutableFstT> *Read(\n      std::istream &strm, const FstReadOptions &opts);\n\n  bool Write(std::ostream &strm, const FstWriteOptions &opts) const {\n    // Serialize all private data members of this class.\n    FstWriteOptions edits_opts(opts);\n    edits_opts.write_header = true;  // Force writing contained header.\n    edits_.Write(strm, edits_opts);\n    WriteType(strm, external_to_internal_ids_);\n    WriteType(strm, edited_final_weights_);\n    WriteType(strm, num_new_states_);\n    if (!strm) {\n      LOG(ERROR) << \"EditFstData::Write: Write failed: \" << opts.source;\n      return false;\n    }\n    return true;\n  }\n\n  StateId NumNewStates() const { return num_new_states_; }\n\n  // accessor methods for the fst holding edited states\n  StateId EditedStart() const { return edits_.Start(); }\n\n  Weight Final(StateId s, const WrappedFstT *wrapped) const {\n    auto final_weight_it = GetFinalWeightIterator(s);\n    if (final_weight_it == NotInFinalWeightMap()) {\n      auto it = GetEditedIdMapIterator(s);\n      return it == NotInEditedMap() ? wrapped->Final(s)\n                                    : edits_.Final(it->second);\n    } else {\n      return final_weight_it->second;\n    }\n  }\n\n  size_t NumArcs(StateId s, const WrappedFstT *wrapped) const {\n    auto it = GetEditedIdMapIterator(s);\n    return it == NotInEditedMap() ? wrapped->NumArcs(s)\n                                  : edits_.NumArcs(it->second);\n  }\n\n  size_t NumInputEpsilons(StateId s, const WrappedFstT *wrapped) const {\n    auto it = GetEditedIdMapIterator(s);\n    return it == NotInEditedMap() ? wrapped->NumInputEpsilons(s)\n                                  : edits_.NumInputEpsilons(it->second);\n  }\n\n  size_t NumOutputEpsilons(StateId s, const WrappedFstT *wrapped) const {\n    auto it = GetEditedIdMapIterator(s);\n    return it == NotInEditedMap() ? wrapped->NumOutputEpsilons(s)\n                                  : edits_.NumOutputEpsilons(it->second);\n  }\n\n  void SetEditedProperties(uint64 props, uint64 mask) {\n    edits_.SetProperties(props, mask);\n  }\n\n  // Non-const MutableFst operations.\n\n  // Sets the start state for this FST.\n  void SetStart(StateId s) { edits_.SetStart(s); }\n\n  // Sets the final state for this FST.\n  Weight SetFinal(StateId s, Weight w, const WrappedFstT *wrapped) {\n    Weight old_weight = Final(s, wrapped);\n    auto it = GetEditedIdMapIterator(s);\n    // If we haven't already edited state s, don't add it to edited_ (which can\n    // be expensive if s has many transitions); just use the\n    // edited_final_weights_ map.\n    if (it == NotInEditedMap()) {\n      edited_final_weights_[s] = w;\n    } else {\n      edits_.SetFinal(GetEditableInternalId(s, wrapped), w);\n    }\n    return old_weight;\n  }\n\n  // Adds a new state to this FST, initially with no arcs.\n  StateId AddState(StateId curr_num_states) {\n    StateId internal_state_id = edits_.AddState();\n    StateId external_state_id = curr_num_states;\n    external_to_internal_ids_[external_state_id] = internal_state_id;\n    num_new_states_++;\n    return external_state_id;\n  }\n\n  // Adds the specified arc to the specified state of this FST.\n  const Arc *AddArc(StateId s, const Arc &arc, const WrappedFstT *wrapped) {\n    const auto internal_id = GetEditableInternalId(s, wrapped);\n    const auto num_arcs = edits_.NumArcs(internal_id);\n    ArcIterator<MutableFstT> arc_it(edits_, internal_id);\n    const Arc *prev_arc = nullptr;\n    if (num_arcs > 0) {\n      // grab the final arc associated with this state in edits_\n      arc_it.Seek(num_arcs - 1);\n      prev_arc = &(arc_it.Value());\n    }\n    edits_.AddArc(internal_id, arc);\n    return prev_arc;\n  }\n\n  void DeleteStates() {\n    edits_.DeleteStates();\n    num_new_states_ = 0;\n    external_to_internal_ids_.clear();\n    edited_final_weights_.clear();\n  }\n\n  // Removes all but the first n outgoing arcs of the specified state.\n  void DeleteArcs(StateId s, size_t n, const WrappedFstT *wrapped) {\n    edits_.DeleteArcs(GetEditableInternalId(s, wrapped), n);\n  }\n\n  // Removes all outgoing arcs from the specified state.\n  void DeleteArcs(StateId s, const WrappedFstT *wrapped) {\n    edits_.DeleteArcs(GetEditableInternalId(s, wrapped));\n  }\n\n  // End methods for non-const MutableFst operations.\n\n  // Provides information for the generic arc iterator.\n  void InitArcIterator(StateId s, ArcIteratorData<Arc> *data,\n                       const WrappedFstT *wrapped) const {\n    auto id_map_it = GetEditedIdMapIterator(s);\n    if (id_map_it == NotInEditedMap()) {\n      VLOG(3) << \"EditFstData::InitArcIterator: iterating on state \" << s\n              << \" of original fst\";\n      wrapped->InitArcIterator(s, data);\n    } else {\n      VLOG(2) << \"EditFstData::InitArcIterator: iterating on edited state \" << s\n              << \" (internal state id: \" << id_map_it->second << \")\";\n      edits_.InitArcIterator(id_map_it->second, data);\n    }\n  }\n\n  // Provides information for the generic mutable arc iterator.\n  void InitMutableArcIterator(StateId s, MutableArcIteratorData<Arc> *data,\n                              const WrappedFstT *wrapped) {\n    data->base = new MutableArcIterator<MutableFstT>(\n        &edits_, GetEditableInternalId(s, wrapped));\n  }\n\n  // Prints out the map from external to internal state id's (for debugging\n  // purposes).\n  void PrintMap() {\n    for (auto map_it = external_to_internal_ids_.begin();\n         map_it != NotInEditedMap(); ++map_it) {\n      LOG(INFO) << \"(external,internal)=(\" << map_it->first << \",\"\n                << map_it->second << \")\";\n    }\n  }\n\n private:\n  // Returns the iterator of the map from external to internal state id's\n  // of edits_ for the specified external state id.\n  typename std::unordered_map<StateId, StateId>::const_iterator\n      GetEditedIdMapIterator(StateId s) const {\n    return external_to_internal_ids_.find(s);\n  }\n\n  typename std::unordered_map<StateId, StateId>::const_iterator\n      NotInEditedMap() const {\n    return external_to_internal_ids_.end();\n  }\n\n  typename std::unordered_map<StateId, Weight>::const_iterator\n      GetFinalWeightIterator(StateId s) const {\n    return edited_final_weights_.find(s);\n  }\n\n  typename std::unordered_map<StateId, Weight>::const_iterator\n      NotInFinalWeightMap() const {\n    return edited_final_weights_.end();\n  }\n\n  // Returns the internal state ID of the specified external ID if the state has\n  // already been made editable, or else copies the state from wrapped_ to\n  // edits_ and returns the state id of the newly editable state in edits_.\n  StateId GetEditableInternalId(StateId s, const WrappedFstT *wrapped) {\n    auto id_map_it = GetEditedIdMapIterator(s);\n    if (id_map_it == NotInEditedMap()) {\n      StateId new_internal_id = edits_.AddState();\n      VLOG(2) << \"EditFstData::GetEditableInternalId: editing state \" << s\n              << \" of original fst; new internal state id:\" << new_internal_id;\n      external_to_internal_ids_[s] = new_internal_id;\n      for (ArcIterator<Fst<Arc>> arc_iterator(*wrapped, s);\n           !arc_iterator.Done(); arc_iterator.Next()) {\n        edits_.AddArc(new_internal_id, arc_iterator.Value());\n      }\n      // Copies the final weight.\n      auto final_weight_it = GetFinalWeightIterator(s);\n      if (final_weight_it == NotInFinalWeightMap()) {\n        edits_.SetFinal(new_internal_id, wrapped->Final(s));\n      } else {\n        edits_.SetFinal(new_internal_id, final_weight_it->second);\n        edited_final_weights_.erase(s);\n      }\n      return new_internal_id;\n    } else {\n      return id_map_it->second;\n    }\n  }\n\n  // A mutable FST (by default, a VectorFst) to contain new states, and/or\n  // copies of states from a wrapped ExpandedFst that have been modified in\n  // some way.\n  MutableFstT edits_;\n  // A mapping from external state IDs to the internal IDs of states that\n  // appear in edits_.\n  std::unordered_map<StateId, StateId> external_to_internal_ids_;\n  // A mapping from external state IDs to final state weights assigned to\n  // those states.  The states in this map are *only* those whose final weight\n  // has been modified; if any other part of the state has been modified,\n  // the entire state is copied to edits_, and all modifications reside there.\n  std::unordered_map<StateId, Weight> edited_final_weights_;\n  // The number of new states added to this mutable fst impl, which is <= the\n  // number of states in edits_ (since edits_ contains both edited *and* new\n  // states).\n  StateId num_new_states_;\n};\n\n// EditFstData method implementations: just the Read method.\ntemplate <typename A, typename WrappedFstT, typename MutableFstT>\nEditFstData<A, WrappedFstT, MutableFstT> *\nEditFstData<A, WrappedFstT, MutableFstT>::Read(std::istream &strm,\n                                               const FstReadOptions &opts) {\n  auto *data = new EditFstData<A, WrappedFstT, MutableFstT>();\n  // next read in MutabelFstT machine that stores edits\n  FstReadOptions edits_opts(opts);\n  // Contained header was written out, so read it in.\n  edits_opts.header = nullptr;\n\n  // Because our internal representation of edited states is a solid object\n  // of type MutableFstT (defaults to VectorFst<A>) and not a pointer,\n  // and because the static Read method allocates a new object on the heap,\n  // we need to call Read, check if there was a failure, use\n  // MutableFstT::operator= to assign the object (not the pointer) to the\n  // edits_ data member (which will increase the ref count by 1 on the impl)\n  // and, finally, delete the heap-allocated object.\n  std::unique_ptr<MutableFstT> edits(MutableFstT::Read(strm, edits_opts));\n  if (!edits) return nullptr;\n  data->edits_ = *edits;\n  edits.reset();\n  // Finally, reads in rest of private data members.\n  ReadType(strm, &data->external_to_internal_ids_);\n  ReadType(strm, &data->edited_final_weights_);\n  ReadType(strm, &data->num_new_states_);\n  if (!strm) {\n    LOG(ERROR) << \"EditFst::Read: read failed: \" << opts.source;\n    return nullptr;\n  }\n  return data;\n}\n\n// This class enables non-destructive edit operations on a wrapped ExpandedFst.\n// The implementation uses copy-on-write semantics at the node level: if a user\n// has an underlying fst on which he or she wants to perform a relatively small\n// number of edits (read: mutations), then this implementation will copy the\n// edited node to an internal MutableFst and perform any edits in situ on that\n// copied node. This class supports all the methods of MutableFst except for\n// DeleteStates(const std::vector<StateId> &); thus, new nodes may also be\n// added, and\n// one may add transitions from existing nodes of the wrapped fst to new nodes.\n//\n// template parameters:\n//   A the type of arc to use\n//   WrappedFstT the type of fst wrapped by the EditFst instance that\n//     this EditFstImpl instance is backing\n//   MutableFstT the type of mutable fst to use internally for edited states;\n//     crucially, MutableFstT::Copy(false) *must* yield an fst that is\n//     thread-safe for reading (VectorFst, for example, has this property)\ntemplate <typename A, typename WrappedFstT = ExpandedFst<A>,\n          typename MutableFstT = VectorFst<A>>\nclass EditFstImpl : public FstImpl<A> {\n public:\n  using Arc = A;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using FstImpl<Arc>::SetProperties;\n  using FstImpl<Arc>::SetInputSymbols;\n  using FstImpl<Arc>::SetOutputSymbols;\n  using FstImpl<Arc>::WriteHeader;\n\n  // Constructs an editable FST implementation with no states. Effectively, this\n  // initially-empty fst will in every way mimic the behavior of a\n  // VectorFst---more precisely, a VectorFstImpl instance---but with slightly\n  // slower performance (by a constant factor), due to the fact that\n  // this class maintains a mapping between external state id's and\n  // their internal equivalents.\n  EditFstImpl() : wrapped_(new MutableFstT()) {\n    FstImpl<Arc>::SetType(\"edit\");\n    InheritPropertiesFromWrapped();\n    data_ = std::make_shared<EditFstData<Arc, WrappedFstT, MutableFstT>>();\n  }\n\n  // Wraps the specified ExpandedFst. This constructor requires that the\n  // specified Fst is an ExpandedFst instance. This requirement is only enforced\n  // at runtime. (See below for the reason.)\n  //\n  // This library uses the pointer-to-implementation or \"PIMPL\" design pattern.\n  // In particular, to make it convenient to bind an implementation class to its\n  // interface, there are a pair of template \"binder\" classes, one for immutable\n  // and one for mutable fst's (ImplToFst and ImplToMutableFst, respectively).\n  // As it happens, the API for the ImplToMutableFst<I,F> class requires that\n  // the implementation class--the template parameter \"I\"--have a constructor\n  // taking a const Fst<A> reference.  Accordingly, the constructor here must\n  // perform a static_cast to the WrappedFstT type required by EditFst and\n  // therefore EditFstImpl.\n  explicit EditFstImpl(const Fst<Arc> &wrapped)\n      : wrapped_(static_cast<WrappedFstT *>(wrapped.Copy())) {\n    FstImpl<Arc>::SetType(\"edit\");\n    data_ = std::make_shared<EditFstData<Arc, WrappedFstT, MutableFstT>>();\n    // have edits_ inherit all properties from wrapped_\n    data_->SetEditedProperties(wrapped_->Properties(kFstProperties, false),\n                               kFstProperties);\n    InheritPropertiesFromWrapped();\n  }\n\n  // A copy constructor for this implementation class, used to implement\n  // the Copy() method of the Fst interface.\n  EditFstImpl(const EditFstImpl &impl)\n      : FstImpl<Arc>(),\n        wrapped_(static_cast<WrappedFstT *>(impl.wrapped_->Copy(true))),\n        data_(impl.data_) {\n    SetProperties(impl.Properties());\n  }\n\n  // const Fst/ExpandedFst operations, declared in the Fst and ExpandedFst\n  // interfaces\n  StateId Start() const {\n    const auto edited_start = data_->EditedStart();\n    return edited_start == kNoStateId ? wrapped_->Start() : edited_start;\n  }\n\n  Weight Final(StateId s) const { return data_->Final(s, wrapped_.get()); }\n\n  size_t NumArcs(StateId s) const { return data_->NumArcs(s, wrapped_.get()); }\n\n  size_t NumInputEpsilons(StateId s) const {\n    return data_->NumInputEpsilons(s, wrapped_.get());\n  }\n\n  size_t NumOutputEpsilons(StateId s) const {\n    return data_->NumOutputEpsilons(s, wrapped_.get());\n  }\n\n  StateId NumStates() const {\n    return wrapped_->NumStates() + data_->NumNewStates();\n  }\n\n  static EditFstImpl<Arc, WrappedFstT, MutableFstT> *Read(\n      std::istream &strm, const FstReadOptions &opts);\n\n  bool Write(std::ostream &strm, const FstWriteOptions &opts) const {\n    FstHeader hdr;\n    hdr.SetStart(Start());\n    hdr.SetNumStates(NumStates());\n    FstWriteOptions header_opts(opts);\n    // Allows the contained FST to hold any symbols.\n    header_opts.write_isymbols = false;\n    header_opts.write_osymbols = false;\n    WriteHeader(strm, header_opts, kFileVersion, &hdr);\n    // First, serializes the wrapped FST to stream.\n    FstWriteOptions wrapped_opts(opts);\n    // Forcse writing the contained header.\n    wrapped_opts.write_header = true;\n    wrapped_->Write(strm, wrapped_opts);\n    data_->Write(strm, opts);\n    strm.flush();\n    if (!strm) {\n      LOG(ERROR) << \"EditFst::Write: Write failed: \" << opts.source;\n      return false;\n    }\n    return true;\n  }\n\n  // Sets the start state for this FST.\n  void SetStart(StateId s) {\n    MutateCheck();\n    data_->SetStart(s);\n    SetProperties(SetStartProperties(FstImpl<Arc>::Properties()));\n  }\n\n  // Sets the final state for this fst.\n  void SetFinal(StateId s, Weight weight) {\n    MutateCheck();\n    Weight old_weight = data_->SetFinal(s, weight, wrapped_.get());\n    SetProperties(\n        SetFinalProperties(FstImpl<Arc>::Properties(), old_weight, weight));\n  }\n\n  // Adds a new state to this fst, initially with no arcs.\n  StateId AddState() {\n    MutateCheck();\n    SetProperties(AddStateProperties(FstImpl<Arc>::Properties()));\n    return data_->AddState(NumStates());\n  }\n\n  // Adds the specified arc to the specified state of this fst.\n  void AddArc(StateId s, const Arc &arc) {\n    MutateCheck();\n    const auto *prev_arc = data_->AddArc(s, arc, wrapped_.get());\n    SetProperties(\n        AddArcProperties(FstImpl<Arc>::Properties(), s, arc, prev_arc));\n  }\n\n  void DeleteStates(const std::vector<StateId> &dstates) {\n    FSTERROR() << \": EditFstImpl::DeleteStates(const std::vector<StateId>&): \"\n               << \" not implemented\";\n    SetProperties(kError, kError);\n  }\n\n  // Deletes all states in this fst.\n  void DeleteStates();\n\n  // Removes all but the first n outgoing arcs of the specified state.\n  void DeleteArcs(StateId s, size_t n) {\n    MutateCheck();\n    data_->DeleteArcs(s, n, wrapped_.get());\n    SetProperties(DeleteArcsProperties(FstImpl<Arc>::Properties()));\n  }\n\n  // Removes all outgoing arcs from the specified state.\n  void DeleteArcs(StateId s) {\n    MutateCheck();\n    data_->DeleteArcs(s, wrapped_.get());\n    SetProperties(DeleteArcsProperties(FstImpl<Arc>::Properties()));\n  }\n\n  void ReserveStates(StateId s) {}\n\n  void ReserveArcs(StateId s, size_t n) {}\n\n  // Ends non-const MutableFst operations.\n\n  // Provides information for the generic state iterator.\n  void InitStateIterator(StateIteratorData<Arc> *data) const {\n    data->base = nullptr;\n    data->nstates = NumStates();\n  }\n\n  // Provides information for the generic arc iterator.\n  void InitArcIterator(StateId s, ArcIteratorData<Arc> *data) const {\n    data_->InitArcIterator(s, data, wrapped_.get());\n  }\n\n  // Provides information for the generic mutable arc iterator.\n  void InitMutableArcIterator(StateId s, MutableArcIteratorData<Arc> *data) {\n    MutateCheck();\n    data_->InitMutableArcIterator(s, data, wrapped_.get());\n  }\n\n private:\n  // Properties always true of this FST class.\n  static constexpr uint64 kStaticProperties = kExpanded | kMutable;\n  // Current file format version.\n  static constexpr int kFileVersion = 2;\n  // Minimum file format version supported\n  static constexpr int kMinFileVersion = 2;\n\n  // Causes this FST to inherit all the properties from its wrapped FST, except\n  // for the two properties that always apply to EditFst instances: kExpanded\n  // and kMutable.\n  void InheritPropertiesFromWrapped() {\n    SetProperties(wrapped_->Properties(kCopyProperties, false) |\n                  kStaticProperties);\n    SetInputSymbols(wrapped_->InputSymbols());\n    SetOutputSymbols(wrapped_->OutputSymbols());\n  }\n\n  // This method ensures that any operations that alter the mutable data\n  // portion of this EditFstImpl cause the data_ member to be copied when its\n  // reference count is greater than 1.  Note that this method is distinct from\n  // MutableFst::Mutate, which gets invoked whenever one of the basic mutation\n  // methods defined in MutableFst is invoked, such as SetInputSymbols.\n  // The MutateCheck here in EditFstImpl is invoked whenever one of the\n  // mutating methods specifically related to the types of edits provided\n  // by EditFst is performed, such as changing an arc of an existing state\n  // of the wrapped fst via a MutableArcIterator, or adding a new state via\n  // AddState().\n  void MutateCheck() {\n    if (!data_.unique()) {\n      data_ =\n          std::make_shared<EditFstData<Arc, WrappedFstT, MutableFstT>>(*data_);\n    }\n  }\n\n  // The FST that this FST wraps. The purpose of this class is to enable\n  // non-destructive edits on this wrapped FST.\n  std::unique_ptr<const WrappedFstT> wrapped_;\n  // The mutable data for this EditFst instance, with delegates for all the\n  // methods that can mutate data.\n  std::shared_ptr<EditFstData<Arc, WrappedFstT, MutableFstT>> data_;\n};\n\ntemplate <typename Arc, typename WrappedFstT, typename MutableFstT>\nconstexpr uint64 EditFstImpl<Arc, WrappedFstT, MutableFstT>::kStaticProperties;\n\ntemplate <typename Arc, typename WrappedFstT, typename MutableFstT>\nconstexpr int EditFstImpl<Arc, WrappedFstT, MutableFstT>::kFileVersion;\n\ntemplate <typename Arc, typename WrappedFstT, typename MutableFstT>\nconstexpr int EditFstImpl<Arc, WrappedFstT, MutableFstT>::kMinFileVersion;\n\ntemplate <typename Arc, typename WrappedFstT, typename MutableFstT>\ninline void EditFstImpl<Arc, WrappedFstT, MutableFstT>::DeleteStates() {\n  data_->DeleteStates();\n  // we are deleting all states, so just forget about pointer to wrapped_\n  // and do what default constructor does: set wrapped_ to a new VectorFst\n  wrapped_.reset(new MutableFstT());\n  const auto new_props =\n      DeleteAllStatesProperties(FstImpl<Arc>::Properties(), kStaticProperties);\n  FstImpl<Arc>::SetProperties(new_props);\n}\n\ntemplate <typename Arc, typename WrappedFstT, typename MutableFstT>\nEditFstImpl<Arc, WrappedFstT, MutableFstT> *\nEditFstImpl<Arc, WrappedFstT, MutableFstT>::Read(std::istream &strm,\n                                                 const FstReadOptions &opts) {\n  auto *impl = new EditFstImpl();\n  FstHeader hdr;\n  if (!impl->ReadHeader(strm, opts, kMinFileVersion, &hdr)) return nullptr;\n  impl->SetStart(hdr.Start());\n  // Reads in wrapped FST.\n  FstReadOptions wrapped_opts(opts);\n  // Contained header was written out, so reads it in too.\n  wrapped_opts.header = nullptr;\n  std::unique_ptr<Fst<Arc>> wrapped_fst(Fst<Arc>::Read(strm, wrapped_opts));\n  if (!wrapped_fst) return nullptr;\n  impl->wrapped_.reset(static_cast<WrappedFstT *>(wrapped_fst.release()));\n  impl->data_ = std::shared_ptr<EditFstData<Arc, WrappedFstT, MutableFstT>>(\n      EditFstData<Arc, WrappedFstT, MutableFstT>::Read(strm, opts));\n  if (!impl->data_) return nullptr;\n  return impl;\n}\n\n}  // namespace internal\n\n// Concrete, editable FST.  This class attaches interface to implementation.\ntemplate <typename A, typename WrappedFstT = ExpandedFst<A>,\n          typename MutableFstT = VectorFst<A>>\nclass EditFst : public ImplToMutableFst<\n                    internal::EditFstImpl<A, WrappedFstT, MutableFstT>> {\n public:\n  using Arc = A;\n  using StateId = typename Arc::StateId;\n\n  using Impl = internal::EditFstImpl<Arc, WrappedFstT, MutableFstT>;\n\n  friend class MutableArcIterator<EditFst<Arc, WrappedFstT, MutableFstT>>;\n\n  EditFst() : ImplToMutableFst<Impl>(std::make_shared<Impl>()) {}\n\n  explicit EditFst(const Fst<Arc> &fst)\n      : ImplToMutableFst<Impl>(std::make_shared<Impl>(fst)) {}\n\n  explicit EditFst(const WrappedFstT &fst)\n      : ImplToMutableFst<Impl>(std::make_shared<Impl>(fst)) {}\n\n  // See Fst<>::Copy() for doc.\n  EditFst(const EditFst<Arc, WrappedFstT, MutableFstT> &fst, bool safe = false)\n      : ImplToMutableFst<Impl>(fst, safe) {}\n\n  ~EditFst() override {}\n\n  // Gets a copy of this EditFst. See Fst<>::Copy() for further doc.\n  EditFst<Arc, WrappedFstT, MutableFstT> *Copy(\n      bool safe = false) const override {\n    return new EditFst<Arc, WrappedFstT, MutableFstT>(*this, safe);\n  }\n\n  EditFst<Arc, WrappedFstT, MutableFstT> &operator=(\n      const EditFst<Arc, WrappedFstT, MutableFstT> &fst) {\n    SetImpl(fst.GetSharedImpl());\n    return *this;\n  }\n\n  EditFst<Arc, WrappedFstT, MutableFstT> &operator=(\n      const Fst<Arc> &fst) override {\n    SetImpl(std::make_shared<Impl>(fst));\n    return *this;\n  }\n\n  // Reads an EditFst from an input stream, returning nullptr on error.\n  static EditFst<Arc, WrappedFstT, MutableFstT> *Read(\n      std::istream &strm, const FstReadOptions &opts) {\n    auto *impl = Impl::Read(strm, opts);\n    return impl ? new EditFst<Arc>(std::shared_ptr<Impl>(impl)) : nullptr;\n  }\n\n  // Reads an EditFst from a file, returning nullptr on error. If the filename\n  // argument is an empty string, it reads from standard input.\n  static EditFst<Arc, WrappedFstT, MutableFstT> *Read(const string &filename) {\n    auto *impl = ImplToExpandedFst<Impl, MutableFst<Arc>>::Read(filename);\n    return impl ? new EditFst<Arc, WrappedFstT, MutableFstT>(\n                      std::shared_ptr<Impl>(impl))\n                : nullptr;\n  }\n\n  bool Write(std::ostream &strm, const FstWriteOptions &opts) const override {\n    return GetImpl()->Write(strm, opts);\n  }\n\n  bool Write(const string &filename) const override {\n    return Fst<Arc>::WriteFile(filename);\n  }\n\n  void InitStateIterator(StateIteratorData<Arc> *data) const override {\n    GetImpl()->InitStateIterator(data);\n  }\n\n  void InitArcIterator(StateId s, ArcIteratorData<Arc> *data) const override {\n    GetImpl()->InitArcIterator(s, data);\n  }\n\n  void InitMutableArcIterator(StateId s,\n                              MutableArcIteratorData<A> *data) override {\n    GetMutableImpl()->InitMutableArcIterator(s, data);\n  }\n\n private:\n  explicit EditFst(std::shared_ptr<Impl> impl) : ImplToMutableFst<Impl>(impl) {}\n\n  using ImplToFst<Impl, MutableFst<Arc>>::GetImpl;\n  using ImplToFst<Impl, MutableFst<Arc>>::GetMutableImpl;\n  using ImplToFst<Impl, MutableFst<Arc>>::SetImpl;\n};\n\n}  // namespace fst\n\n#endif  // FST_EDIT_FST_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/encode.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Class to encode and decode an FST.\n\n#ifndef FST_ENCODE_H_\n#define FST_ENCODE_H_\n\n#include <iostream>\n#include <memory>\n#include <string>\n#include <unordered_map>\n#include <utility>\n#include <vector>\n\n#include <fst/log.h>\n#include <fstream>\n\n#include <fst/arc-map.h>\n#include <fst/rmfinalepsilon.h>\n\n\nnamespace fst {\n\nenum EncodeType { ENCODE = 1, DECODE = 2 };\n\nstatic constexpr uint32 kEncodeLabels = 0x0001;\nstatic constexpr uint32 kEncodeWeights = 0x0002;\nstatic constexpr uint32 kEncodeFlags = 0x0003;\n\nnamespace internal {\n\nstatic constexpr uint32 kEncodeHasISymbols = 0x0004;\nstatic constexpr uint32 kEncodeHasOSymbols = 0x0008;\n\n// Identifies stream data as an encode table (and its endianity)\nstatic const int32 kEncodeMagicNumber = 2129983209;\n\n// The following class encapsulates implementation details for the encoding and\n// decoding of label/weight tuples used for encoding and decoding of FSTs. The\n// EncodeTable is bidirectional. I.e, it stores both the Tuple of encode labels\n// and weights to a unique label, and the reverse.\ntemplate <class Arc>\nclass EncodeTable {\n public:\n  using Label = typename Arc::Label;\n  using Weight = typename Arc::Weight;\n\n  // Encoded data consists of arc input/output labels and arc weight.\n  struct Tuple {\n    Tuple() {}\n\n    Tuple(Label ilabel_, Label olabel_, Weight weight_)\n        : ilabel(ilabel_), olabel(olabel_), weight(std::move(weight_)) {}\n\n    Tuple(const Tuple &tuple)\n        : ilabel(tuple.ilabel),\n          olabel(tuple.olabel),\n          weight(std::move(tuple.weight)) {}\n\n    Label ilabel;\n    Label olabel;\n    Weight weight;\n  };\n\n  // Comparison object for hashing EncodeTable Tuple(s).\n  class TupleEqual {\n   public:\n    bool operator()(const Tuple *x, const Tuple *y) const {\n      return (x->ilabel == y->ilabel && x->olabel == y->olabel &&\n              x->weight == y->weight);\n    }\n  };\n\n  // Hash function for EncodeTabe Tuples. Based on the encode flags\n  // we either hash the labels, weights or combination of them.\n  class TupleKey {\n   public:\n    TupleKey() : encode_flags_(kEncodeLabels | kEncodeWeights) {}\n\n    TupleKey(const TupleKey &key) : encode_flags_(key.encode_flags_) {}\n\n    explicit TupleKey(uint32 encode_flags) : encode_flags_(encode_flags) {}\n\n    size_t operator()(const Tuple *x) const {\n      size_t hash = x->ilabel;\n      static constexpr int lshift = 5;\n      static constexpr int rshift = CHAR_BIT * sizeof(size_t) - 5;\n      if (encode_flags_ & kEncodeLabels) {\n        hash = hash << lshift ^ hash >> rshift ^ x->olabel;\n      }\n      if (encode_flags_ & kEncodeWeights) {\n        hash = hash << lshift ^ hash >> rshift ^ x->weight.Hash();\n      }\n      return hash;\n    }\n\n   private:\n    int32 encode_flags_;\n  };\n\n  explicit EncodeTable(uint32 encode_flags)\n      : flags_(encode_flags), encode_hash_(1024, TupleKey(encode_flags)) {}\n\n  using EncodeHash = std::unordered_map<const Tuple *, Label, TupleKey,\n                                        TupleEqual>;\n\n  // Given an arc, encodes either input/output labels or input/costs or both.\n  Label Encode(const Arc &arc) {\n    std::unique_ptr<Tuple> tuple(\n        new Tuple(arc.ilabel, flags_ & kEncodeLabels ? arc.olabel : 0,\n                  flags_ & kEncodeWeights ? arc.weight : Weight::One()));\n    auto insert_result = encode_hash_.insert(\n        std::make_pair(tuple.get(), encode_tuples_.size() + 1));\n    if (insert_result.second) encode_tuples_.push_back(std::move(tuple));\n    return insert_result.first->second;\n  }\n\n  // Given an arc, looks up its encoded label or returns kNoLabel if not found.\n  Label GetLabel(const Arc &arc) const {\n    const Tuple tuple(arc.ilabel, flags_ & kEncodeLabels ? arc.olabel : 0,\n                      flags_ & kEncodeWeights ? arc.weight : Weight::One());\n    auto it = encode_hash_.find(&tuple);\n    return (it == encode_hash_.end()) ?  kNoLabel : it->second;\n  }\n\n  // Given an encoded arc label, decodes back to input/output labels and costs.\n  const Tuple *Decode(Label key) const {\n    if (key < 1 || key > encode_tuples_.size()) {\n      LOG(ERROR) << \"EncodeTable::Decode: Unknown decode key: \" << key;\n      return nullptr;\n    }\n    return encode_tuples_[key - 1].get();\n  }\n\n  size_t Size() const { return encode_tuples_.size(); }\n\n  bool Write(std::ostream &strm, const string &source) const;\n\n  static EncodeTable<Arc> *Read(std::istream &strm, const string &source);\n\n  uint32 Flags() const { return flags_ & kEncodeFlags; }\n\n  const SymbolTable *InputSymbols() const { return isymbols_.get(); }\n\n  const SymbolTable *OutputSymbols() const { return osymbols_.get(); }\n\n  void SetInputSymbols(const SymbolTable *syms) {\n    if (syms) {\n      isymbols_.reset(syms->Copy());\n      flags_ |= kEncodeHasISymbols;\n    } else {\n      isymbols_.reset();\n      flags_ &= ~kEncodeHasISymbols;\n    }\n  }\n\n  void SetOutputSymbols(const SymbolTable *syms) {\n    if (syms) {\n      osymbols_.reset(syms->Copy());\n      flags_ |= kEncodeHasOSymbols;\n    } else {\n      osymbols_.reset();\n      flags_ &= ~kEncodeHasOSymbols;\n    }\n  }\n\n private:\n  uint32 flags_;\n  std::vector<std::unique_ptr<Tuple>> encode_tuples_;\n  EncodeHash encode_hash_;\n  std::unique_ptr<SymbolTable> isymbols_;  // Pre-encoded input symbol table.\n  std::unique_ptr<SymbolTable> osymbols_;  // Pre-encoded output symbol table.\n\n  EncodeTable(const EncodeTable &) = delete;\n  EncodeTable &operator=(const EncodeTable &) = delete;\n};\n\ntemplate <class Arc>\nbool EncodeTable<Arc>::Write(std::ostream &strm,\n                                  const string &source) const {\n  WriteType(strm, kEncodeMagicNumber);\n  WriteType(strm, flags_);\n  const int64 size = encode_tuples_.size();\n  WriteType(strm, size);\n  for (const auto &tuple : encode_tuples_) {\n    WriteType(strm, tuple->ilabel);\n    WriteType(strm, tuple->olabel);\n    tuple->weight.Write(strm);\n  }\n  if (flags_ & kEncodeHasISymbols) isymbols_->Write(strm);\n  if (flags_ & kEncodeHasOSymbols) osymbols_->Write(strm);\n  strm.flush();\n  if (!strm) {\n    LOG(ERROR) << \"EncodeTable::Write: Write failed: \" << source;\n    return false;\n  }\n  return true;\n}\n\ntemplate <class Arc>\nEncodeTable<Arc> *EncodeTable<Arc>::Read(std::istream &strm,\n                                         const string &source) {\n  int32 magic_number = 0;\n  ReadType(strm, &magic_number);\n  if (magic_number != kEncodeMagicNumber) {\n    LOG(ERROR) << \"EncodeTable::Read: Bad encode table header: \" << source;\n    return nullptr;\n  }\n  uint32 flags;\n  ReadType(strm, &flags);\n  int64 size;\n  ReadType(strm, &size);\n  if (!strm) {\n    LOG(ERROR) << \"EncodeTable::Read: Read failed: \" << source;\n    return nullptr;\n  }\n  std::unique_ptr<EncodeTable<Arc>> table(new EncodeTable<Arc>(flags));\n  for (int64 i = 0; i < size; ++i) {\n    std::unique_ptr<Tuple> tuple(new Tuple());\n    ReadType(strm, &tuple->ilabel);\n    ReadType(strm, &tuple->olabel);\n    tuple->weight.Read(strm);\n    if (!strm) {\n      LOG(ERROR) << \"EncodeTable::Read: Read failed: \" << source;\n      return nullptr;\n    }\n    table->encode_tuples_.push_back(std::move(tuple));\n    table->encode_hash_[table->encode_tuples_.back().get()] =\n        table->encode_tuples_.size();\n  }\n  if (flags & kEncodeHasISymbols) {\n    table->isymbols_.reset(SymbolTable::Read(strm, source));\n  }\n  if (flags & kEncodeHasOSymbols) {\n    table->osymbols_.reset(SymbolTable::Read(strm, source));\n  }\n  return table.release();\n}\n\n}  // namespace internal\n\n// A mapper to encode/decode weighted transducers. Encoding of an FST is used\n// for performing classical determinization or minimization on a weighted\n// transducer viewing it as an unweighted acceptor over encoded labels.\n//\n// The mapper stores the encoding in a local hash table (EncodeTable). This\n// table is shared (and reference-counted) between the encoder and decoder.\n// A decoder has read-only access to the EncodeTable.\n//\n// The EncodeMapper allows on the fly encoding of the machine. As the\n// EncodeTable is generated the same table may by used to decode the machine\n// on the fly. For example in the following sequence of operations\n//\n//  Encode -> Determinize -> Decode\n//\n// we will use the encoding table generated during the encode step in the\n// decode, even though the encoding is not complete.\ntemplate <class Arc>\nclass EncodeMapper {\n  using Label = typename Arc::Label;\n  using Weight = typename Arc::Weight;\n\n public:\n  EncodeMapper(uint32 flags, EncodeType type)\n      : flags_(flags),\n        type_(type),\n        table_(std::make_shared<internal::EncodeTable<Arc>>(flags)),\n        error_(false) {}\n\n  EncodeMapper(const EncodeMapper &mapper)\n      : flags_(mapper.flags_),\n        type_(mapper.type_),\n        table_(mapper.table_),\n        error_(false) {}\n\n  // Copy constructor but setting the type, typically to DECODE.\n  EncodeMapper(const EncodeMapper &mapper, EncodeType type)\n      : flags_(mapper.flags_),\n        type_(type),\n        table_(mapper.table_),\n        error_(mapper.error_) {}\n\n  Arc operator()(const Arc &arc);\n\n  MapFinalAction FinalAction() const {\n    return (type_ == ENCODE && (flags_ & kEncodeWeights))\n               ? MAP_REQUIRE_SUPERFINAL\n               : MAP_NO_SUPERFINAL;\n  }\n\n  constexpr MapSymbolsAction InputSymbolsAction() const {\n    return MAP_CLEAR_SYMBOLS;\n  }\n\n  constexpr MapSymbolsAction OutputSymbolsAction() const {\n    return MAP_CLEAR_SYMBOLS;\n  }\n\n  uint64 Properties(uint64 inprops) {\n    uint64 outprops = inprops;\n    if (error_) outprops |= kError;\n    uint64 mask = kFstProperties;\n    if (flags_ & kEncodeLabels) {\n      mask &= kILabelInvariantProperties & kOLabelInvariantProperties;\n    }\n    if (flags_ & kEncodeWeights) {\n      mask &= kILabelInvariantProperties & kWeightInvariantProperties &\n              (type_ == ENCODE ? kAddSuperFinalProperties\n                               : kRmSuperFinalProperties);\n    }\n    return outprops & mask;\n  }\n\n  uint32 Flags() const { return flags_; }\n\n  EncodeType Type() const { return type_; }\n\n  bool Write(std::ostream &strm, const string &source) const {\n    return table_->Write(strm, source);\n  }\n\n  bool Write(const string &filename) const {\n    std::ofstream strm(filename,\n                             std::ios_base::out | std::ios_base::binary);\n    if (!strm) {\n      LOG(ERROR) << \"EncodeMap: Can't open file: \" << filename;\n      return false;\n    }\n    return Write(strm, filename);\n  }\n\n  static EncodeMapper<Arc> *Read(std::istream &strm, const string &source,\n                               EncodeType type = ENCODE) {\n    auto *table = internal::EncodeTable<Arc>::Read(strm, source);\n    return table ? new EncodeMapper(table->Flags(), type, table) : nullptr;\n  }\n\n  static EncodeMapper<Arc> *Read(const string &filename,\n                                 EncodeType type = ENCODE) {\n    std::ifstream strm(filename,\n                            std::ios_base::in | std::ios_base::binary);\n    if (!strm) {\n      LOG(ERROR) << \"EncodeMap: Can't open file: \" << filename;\n      return nullptr;\n    }\n    return Read(strm, filename, type);\n  }\n\n  const SymbolTable *InputSymbols() const { return table_->InputSymbols(); }\n\n  const SymbolTable *OutputSymbols() const { return table_->OutputSymbols(); }\n\n  void SetInputSymbols(const SymbolTable *syms) {\n    table_->SetInputSymbols(syms);\n  }\n\n  void SetOutputSymbols(const SymbolTable *syms) {\n    table_->SetOutputSymbols(syms);\n  }\n\n private:\n  uint32 flags_;\n  EncodeType type_;\n  std::shared_ptr<internal::EncodeTable<Arc>> table_;\n  bool error_;\n\n  explicit EncodeMapper(uint32 flags, EncodeType type,\n                        internal::EncodeTable<Arc> *table)\n      : flags_(flags), type_(type), table_(table), error_(false) {}\n\n  EncodeMapper &operator=(const EncodeMapper &) = delete;\n};\n\ntemplate <class Arc>\nArc EncodeMapper<Arc>::operator()(const Arc &arc) {\n  if (type_ == ENCODE) {\n    if ((arc.nextstate == kNoStateId && !(flags_ & kEncodeWeights)) ||\n        (arc.nextstate == kNoStateId && (flags_ & kEncodeWeights) &&\n         arc.weight == Weight::Zero())) {\n      return arc;\n    } else {\n      const auto label = table_->Encode(arc);\n      return Arc(label, flags_ & kEncodeLabels ? label : arc.olabel,\n                 flags_ & kEncodeWeights ? Weight::One() : arc.weight,\n                 arc.nextstate);\n    }\n  } else {  // type_ == DECODE\n    if (arc.nextstate == kNoStateId) {\n      return arc;\n    } else {\n      if (arc.ilabel == 0) return arc;\n      if (flags_ & kEncodeLabels && arc.ilabel != arc.olabel) {\n        FSTERROR() << \"EncodeMapper: Label-encoded arc has different \"\n                      \"input and output labels\";\n        error_ = true;\n      }\n      if (flags_ & kEncodeWeights && arc.weight != Weight::One()) {\n        FSTERROR() << \"EncodeMapper: Weight-encoded arc has non-trivial weight\";\n        error_ = true;\n      }\n      const auto tuple = table_->Decode(arc.ilabel);\n      if (!tuple) {\n        FSTERROR() << \"EncodeMapper: Decode failed\";\n        error_ = true;\n        return Arc(kNoLabel, kNoLabel, Weight::NoWeight(), arc.nextstate);\n      } else {\n        return Arc(tuple->ilabel,\n                   flags_ & kEncodeLabels ? tuple->olabel : arc.olabel,\n                   flags_ & kEncodeWeights ? tuple->weight : arc.weight,\n                   arc.nextstate);\n      }\n    }\n  }\n}\n\n// Complexity: O(E + V).\ntemplate <class Arc>\ninline void Encode(MutableFst<Arc> *fst, EncodeMapper<Arc> *mapper) {\n  mapper->SetInputSymbols(fst->InputSymbols());\n  mapper->SetOutputSymbols(fst->OutputSymbols());\n  ArcMap(fst, mapper);\n}\n\ntemplate <class Arc>\ninline void Decode(MutableFst<Arc> *fst, const EncodeMapper<Arc> &mapper) {\n  ArcMap(fst, EncodeMapper<Arc>(mapper, DECODE));\n  RmFinalEpsilon(fst);\n  fst->SetInputSymbols(mapper.InputSymbols());\n  fst->SetOutputSymbols(mapper.OutputSymbols());\n}\n\n// On-the-fly encoding of an input FST.\n//\n// Complexity:\n//\n//   Construction: O(1)\n//   Traversal: O(e + v)\n//\n// where e is the number of arcs visited and v is the number of states visited.\n// Constant time and space to visit an input state or arc is assumed and\n// exclusive of caching.\ntemplate <class Arc>\nclass EncodeFst : public ArcMapFst<Arc, Arc, EncodeMapper<Arc>> {\n public:\n  using Mapper = EncodeMapper<Arc>;\n  using Impl = internal::ArcMapFstImpl<Arc, Arc, Mapper>;\n\n  EncodeFst(const Fst<Arc> &fst, Mapper *encoder)\n      : ArcMapFst<Arc, Arc, Mapper>(fst, encoder, ArcMapFstOptions()) {\n    encoder->SetInputSymbols(fst.InputSymbols());\n    encoder->SetOutputSymbols(fst.OutputSymbols());\n  }\n\n  EncodeFst(const Fst<Arc> &fst, const Mapper &encoder)\n      : ArcMapFst<Arc, Arc, Mapper>(fst, encoder, ArcMapFstOptions()) {}\n\n  // See Fst<>::Copy() for doc.\n  EncodeFst(const EncodeFst<Arc> &fst, bool copy = false)\n      : ArcMapFst<Arc, Arc, Mapper>(fst, copy) {}\n\n  // Makes a copy of this EncodeFst. See Fst<>::Copy() for further doc.\n  EncodeFst<Arc> *Copy(bool safe = false) const override {\n    if (safe) {\n      FSTERROR() << \"EncodeFst::Copy(true): Not allowed\";\n      GetImpl()->SetProperties(kError, kError);\n    }\n    return new EncodeFst(*this);\n  }\n\n private:\n  using ImplToFst<Impl>::GetImpl;\n  using ImplToFst<Impl>::GetMutableImpl;\n};\n\n// On-the-fly decoding of an input FST.\n//\n// Complexity:\n//\n//   Construction: O(1).\n//   Traversal: O(e + v)\n//\n// Constant time and space to visit an input state or arc is assumed and\n// exclusive of caching.\ntemplate <class Arc>\nclass DecodeFst : public ArcMapFst<Arc, Arc, EncodeMapper<Arc>> {\n public:\n  using Mapper = EncodeMapper<Arc>;\n  using Impl = internal::ArcMapFstImpl<Arc, Arc, Mapper>;\n  using ImplToFst<Impl>::GetImpl;\n\n  DecodeFst(const Fst<Arc> &fst, const Mapper &encoder)\n      : ArcMapFst<Arc, Arc, Mapper>(fst, Mapper(encoder, DECODE),\n                                    ArcMapFstOptions()) {\n    GetMutableImpl()->SetInputSymbols(encoder.InputSymbols());\n    GetMutableImpl()->SetOutputSymbols(encoder.OutputSymbols());\n  }\n\n  // See Fst<>::Copy() for doc.\n  DecodeFst(const DecodeFst<Arc> &fst, bool safe = false)\n      : ArcMapFst<Arc, Arc, Mapper>(fst, safe) {}\n\n  // Makes a copy of this DecodeFst. See Fst<>::Copy() for further doc.\n  DecodeFst<Arc> *Copy(bool safe = false) const override {\n    return new DecodeFst(*this, safe);\n  }\n\n private:\n  using ImplToFst<Impl>::GetMutableImpl;\n};\n\n// Specialization for EncodeFst.\ntemplate <class Arc>\nclass StateIterator<EncodeFst<Arc>>\n    : public StateIterator<ArcMapFst<Arc, Arc, EncodeMapper<Arc>>> {\n public:\n  explicit StateIterator(const EncodeFst<Arc> &fst)\n      : StateIterator<ArcMapFst<Arc, Arc, EncodeMapper<Arc>>>(fst) {}\n};\n\n// Specialization for EncodeFst.\ntemplate <class Arc>\nclass ArcIterator<EncodeFst<Arc>>\n    : public ArcIterator<ArcMapFst<Arc, Arc, EncodeMapper<Arc>>> {\n public:\n  ArcIterator(const EncodeFst<Arc> &fst, typename Arc::StateId s)\n      : ArcIterator<ArcMapFst<Arc, Arc, EncodeMapper<Arc>>>(fst, s) {}\n};\n\n// Specialization for DecodeFst.\ntemplate <class Arc>\nclass StateIterator<DecodeFst<Arc>>\n    : public StateIterator<ArcMapFst<Arc, Arc, EncodeMapper<Arc>>> {\n public:\n  explicit StateIterator(const DecodeFst<Arc> &fst)\n      : StateIterator<ArcMapFst<Arc, Arc, EncodeMapper<Arc>>>(fst) {}\n};\n\n// Specialization for DecodeFst.\ntemplate <class Arc>\nclass ArcIterator<DecodeFst<Arc>>\n    : public ArcIterator<ArcMapFst<Arc, Arc, EncodeMapper<Arc>>> {\n public:\n  ArcIterator(const DecodeFst<Arc> &fst, typename Arc::StateId s)\n      : ArcIterator<ArcMapFst<Arc, Arc, EncodeMapper<Arc>>>(fst, s) {}\n};\n\n// Useful aliases when using StdArc.\n\nusing StdEncodeFst = EncodeFst<StdArc>;\n\nusing StdDecodeFst = DecodeFst<StdArc>;\n\n}  // namespace fst\n\n#endif  // FST_ENCODE_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/epsnormalize.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Function that implements epsilon-normalization.\n\n#ifndef FST_EPSNORMALIZE_H_\n#define FST_EPSNORMALIZE_H_\n\n\n#include <fst/arc-map.h>\n#include <fst/factor-weight.h>\n#include <fst/invert.h>\n#include <fst/rmepsilon.h>\n\n\nnamespace fst {\n\nenum EpsNormalizeType { EPS_NORM_INPUT, EPS_NORM_OUTPUT };\n\n// Returns an equivalent FST that is epsilon-normalized. An acceptor is\n// epsilon-normalized if it is epsilon-removed. A transducer is input\n// epsilon-normalized if additionally if on each path any epsilon input\n// label follows all non-epsilon input labels. Output epsilon-normalized\n// is defined similarly.\n//\n// For more information, see:\n//\n// Mohri, M. 2002. Generic epsilon-removal and input epsilon-normalization\n// algorithms for weighted transducers. International Journal of Computer\n// Science, 13(1): 129-143, 2002.\ntemplate <class Arc>\nvoid EpsNormalize(const Fst<Arc> &ifst, MutableFst<Arc> *ofst,\n                  EpsNormalizeType type = EPS_NORM_INPUT) {\n  EpsNormalize<Arc, GALLIC>(ifst, ofst, type);\n}\n\n// Same as above, expect allows specifying explicitely the gallic weight type.\ntemplate <class Arc, GallicType G>\nvoid EpsNormalize(const Fst<Arc> &ifst, MutableFst<Arc> *ofst,\n                  EpsNormalizeType type) {\n  VectorFst<GallicArc<Arc, G>> gfst;\n  if (type == EPS_NORM_INPUT) {\n    ArcMap(ifst, &gfst, ToGallicMapper<Arc, G>());\n  } else {  // type == EPS_NORM_OUTPUT\n    ArcMap(InvertFst<Arc>(ifst), &gfst, ToGallicMapper<Arc, G>());\n  }\n  RmEpsilon(&gfst);\n  FactorWeightFst<GallicArc<Arc, G>,\n                  GallicFactor<typename Arc::Label, typename Arc::Weight, G>>\n      fwfst(gfst);\n  ArcMap(fwfst, ofst, FromGallicMapper<Arc, G>());\n  ofst->SetOutputSymbols(ifst.OutputSymbols());\n  if (type == EPS_NORM_OUTPUT) Invert(ofst);\n}\n\n}  // namespace fst\n\n#endif  // FST_EPSNORMALIZE_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/equal.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Function to test equality of two FSTs.\n\n#ifndef FST_EQUAL_H_\n#define FST_EQUAL_H_\n\n#include <fst/log.h>\n\n#include <fst/fst.h>\n#include <fst/test-properties.h>\n\n\nnamespace fst {\n\nconstexpr uint32 kEqualFsts = 0x0001;\nconstexpr uint32 kEqualFstTypes = 0x0002;\nconstexpr uint32 kEqualCompatProperties = 0x0004;\nconstexpr uint32 kEqualCompatSymbols = 0x0008;\nconstexpr uint32 kEqualAll =\n    kEqualFsts | kEqualFstTypes | kEqualCompatProperties | kEqualCompatSymbols;\n\n// Tests if two Fsts have the same states and arcs in the same order (when\n// etype & kEqualFst).\n// Also optional checks equality of Fst types (etype & kEqualFstTypes) and\n// compatibility of stored properties (etype & kEqualCompatProperties) and\n// of symbol tables (etype & kEqualCompatSymbols).\ntemplate <class Arc>\nbool Equal(const Fst<Arc> &fst1, const Fst<Arc> &fst2, float delta = kDelta,\n           uint32 etype = kEqualFsts) {\n  if ((etype & kEqualFstTypes) && (fst1.Type() != fst2.Type())) {\n    VLOG(1) << \"Equal: Mismatched FST types (\" << fst1.Type() << \" != \"\n            << fst2.Type() << \")\";\n    return false;\n  }\n  if ((etype & kEqualCompatProperties) &&\n      !CompatProperties(fst1.Properties(kCopyProperties, false),\n                        fst2.Properties(kCopyProperties, false))) {\n    VLOG(1) << \"Equal: Properties not compatible\";\n    return false;\n  }\n  if (etype & kEqualCompatSymbols) {\n    if (!CompatSymbols(fst1.InputSymbols(), fst2.InputSymbols(), false)) {\n      VLOG(1) << \"Equal: Input symbols not compatible\";\n      return false;\n    }\n    if (!CompatSymbols(fst1.OutputSymbols(), fst2.OutputSymbols(), false)) {\n      VLOG(1) << \"Equal: Output symbols not compatible\";\n      return false;\n    }\n  }\n  if (!(etype & kEqualFsts)) return true;\n  if (fst1.Start() != fst2.Start()) {\n    VLOG(1) << \"Equal: Mismatched start states (\" << fst1.Start() << \" != \"\n            << fst2.Start() << \")\";\n    return false;\n  }\n  StateIterator<Fst<Arc>> siter1(fst1);\n  StateIterator<Fst<Arc>> siter2(fst2);\n  while (!siter1.Done() || !siter2.Done()) {\n    if (siter1.Done() || siter2.Done()) {\n      VLOG(1) << \"Equal: Mismatched number of states\";\n      return false;\n    }\n    const auto s1 = siter1.Value();\n    const auto s2 = siter2.Value();\n    if (s1 != s2) {\n      VLOG(1) << \"Equal: Mismatched states (\" << s1 << \"!= \"\n              << s2 << \")\";\n      return false;\n    }\n    const auto &final1 = fst1.Final(s1);\n    const auto &final2 = fst2.Final(s2);\n    if (!ApproxEqual(final1, final2, delta)) {\n      VLOG(1) << \"Equal: Mismatched final weights at state \" << s1\n              << \" (\" << final1 << \" != \" << final2 << \")\";\n      return false;\n    }\n    ArcIterator<Fst<Arc>> aiter1(fst1, s1);\n    ArcIterator<Fst<Arc>> aiter2(fst2, s2);\n    for (auto a = 0; !aiter1.Done() || !aiter2.Done(); ++a) {\n      if (aiter1.Done() || aiter2.Done()) {\n        VLOG(1) << \"Equal: Mismatched number of arcs at state \" << s1;\n        return false;\n      }\n      const auto &arc1 = aiter1.Value();\n      const auto &arc2 = aiter2.Value();\n      if (arc1.ilabel != arc2.ilabel) {\n        VLOG(1) << \"Equal: Mismatched arc input labels at state \" << s1\n                << \", arc \" << a << \" (\" << arc1.ilabel << \" != \"\n                << arc2.ilabel << \")\";\n        return false;\n      } else if (arc1.olabel != arc2.olabel) {\n        VLOG(1) << \"Equal: Mismatched arc output labels at state \" << s1\n                << \", arc \" << a << \" (\" << arc1.olabel << \" != \"\n                << arc2.olabel << \")\";\n        return false;\n      } else if (!ApproxEqual(arc1.weight, arc2.weight, delta)) {\n        VLOG(1) << \"Equal: Mismatched arc weights at state \" << s1\n                << \", arc \" << a << \" (\" << arc1.weight << \" != \"\n                << arc2.weight << \")\";\n        return false;\n      } else if (arc1.nextstate != arc2.nextstate) {\n        VLOG(1) << \"Equal: Mismatched next state at state \" << s1\n                << \", arc \" << a << \" (\" << arc1.nextstate << \" != \"\n                << arc2.nextstate << \")\";\n        return false;\n      }\n      aiter1.Next();\n      aiter2.Next();\n    }\n    // Sanity checks: should never fail.\n    if (fst1.NumArcs(s1) != fst2.NumArcs(s2)) {\n      FSTERROR() << \"Equal: Inconsistent arc counts at state \" << s1\n                 << \" (\" << fst1.NumArcs(s1) << \" != \"\n                 << fst2.NumArcs(s2) << \")\";\n      return false;\n    }\n    if (fst1.NumInputEpsilons(s1) != fst2.NumInputEpsilons(s2)) {\n      FSTERROR() << \"Equal: Inconsistent input epsilon counts at state \" << s1\n                 << \" (\" << fst1.NumInputEpsilons(s1) << \" != \"\n                 << fst2.NumInputEpsilons(s2) << \")\";\n      return false;\n    }\n    if (fst1.NumOutputEpsilons(s1) != fst2.NumOutputEpsilons(s2)) {\n      FSTERROR() << \"Equal: Inconsistent output epsilon counts at state \" << s1\n                 << \" (\" << fst1.NumOutputEpsilons(s1) << \" != \"\n                 << fst2.NumOutputEpsilons(s2) << \")\";\n    }\n    siter1.Next();\n    siter2.Next();\n  }\n  return true;\n}\n\n}  // namespace fst\n\n#endif  // FST_EQUAL_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/equivalent.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Functions and classes to determine the equivalence of two FSTs.\n\n#ifndef FST_EQUIVALENT_H_\n#define FST_EQUIVALENT_H_\n\n#include <algorithm>\n#include <deque>\n#include <unordered_map>\n#include <utility>\n#include <vector>\n#include <fst/log.h>\n\n#include <fst/encode.h>\n#include <fst/push.h>\n#include <fst/union-find.h>\n#include <fst/vector-fst.h>\n\n\nnamespace fst {\nnamespace internal {\n\n// Traits-like struct holding utility functions/typedefs/constants for\n// the equivalence algorithm.\n//\n// Encoding device: in order to make the statesets of the two acceptors\n// disjoint, we map Arc::StateId on the type MappedId. The states of\n// the first acceptor are mapped on odd numbers (s -> 2s + 1), and\n// those of the second one on even numbers (s -> 2s + 2). The number 0\n// is reserved for an implicit (non-final) dead state (required for\n// the correct treatment of non-coaccessible states; kNoStateId is mapped to\n// kDeadState for both acceptors). The union-find algorithm operates on the\n// mapped IDs.\ntemplate <class Arc>\nstruct EquivalenceUtil {\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using MappedId = StateId;  // ID for an equivalence class.\n\n  // MappedId for an implicit dead state.\n  static constexpr MappedId kDeadState = 0;\n\n  // MappedId for lookup failure.\n  static constexpr MappedId kInvalidId = -1;\n\n  // Maps state ID to the representative of the corresponding\n  // equivalence class. The parameter 'which_fst' takes the values 1\n  // and 2, identifying the input FST.\n  static MappedId MapState(StateId s, int32 which_fst) {\n    return (kNoStateId == s) ? kDeadState\n                             : (static_cast<MappedId>(s) << 1) + which_fst;\n  }\n\n  // Maps set ID to State ID.\n  static StateId UnMapState(MappedId id) {\n    return static_cast<StateId>((--id) >> 1);\n  }\n\n  // Convenience function: checks if state with MappedId s is final in\n  // acceptor fa.\n  static bool IsFinal(const Fst<Arc> &fa, MappedId s) {\n    return (kDeadState == s) ? false\n                             : (fa.Final(UnMapState(s)) != Weight::Zero());\n  }\n  // Convenience function: returns the representative of ID in sets,\n  // creating a new set if needed.\n  static MappedId FindSet(UnionFind<MappedId> *sets, MappedId id) {\n    const auto repr = sets->FindSet(id);\n    if (repr != kInvalidId) {\n      return repr;\n    } else {\n      sets->MakeSet(id);\n      return id;\n    }\n  }\n};\n\ntemplate <class Arc>\nconstexpr\n    typename EquivalenceUtil<Arc>::MappedId EquivalenceUtil<Arc>::kDeadState;\n\ntemplate <class Arc>\nconstexpr\n    typename EquivalenceUtil<Arc>::MappedId EquivalenceUtil<Arc>::kInvalidId;\n\n}  // namespace internal\n\n// Equivalence checking algorithm: determines if the two FSTs fst1 and fst2\n// are equivalent. The input FSTs must be deterministic input-side epsilon-free\n// acceptors, unweighted or with weights over a left semiring. Two acceptors are\n// considered equivalent if they accept exactly the same set of strings (with\n// the same weights).\n//\n// The algorithm (cf. Aho, Hopcroft and Ullman, \"The Design and Analysis of\n// Computer Programs\") successively constructs sets of states that can be\n// reached by the same prefixes, starting with a set containing the start states\n// of both acceptors. A disjoint tree forest (the union-find algorithm) is used\n// to represent the sets of states. The algorithm returns false if one of the\n// constructed sets contains both final and non-final states. Returns an\n// optional error value (useful when FLAGS_error_fatal = false).\n//\n// Complexity:\n//\n// Quasi-linear, i.e., O(n G(n)), where\n//\n//   n = |S1| + |S2| is the number of states in both acceptors\n//\n//   G(n) is a very slowly growing function that can be approximated\n//        by 4 by all practical purposes.\ntemplate <class Arc>\nbool Equivalent(const Fst<Arc> &fst1, const Fst<Arc> &fst2,\n                float delta = kDelta, bool *error = nullptr) {\n  using Weight = typename Arc::Weight;\n  if (error) *error = false;\n  // Check that the symbol table are compatible.\n  if (!CompatSymbols(fst1.InputSymbols(), fst2.InputSymbols()) ||\n      !CompatSymbols(fst1.OutputSymbols(), fst2.OutputSymbols())) {\n    FSTERROR() << \"Equivalent: Input/output symbol tables of 1st argument \"\n               << \"do not match input/output symbol tables of 2nd argument\";\n    if (error) *error = true;\n    return false;\n  }\n  // Check properties first.\n  static constexpr auto props = kNoEpsilons | kIDeterministic | kAcceptor;\n  if (fst1.Properties(props, true) != props) {\n    FSTERROR() << \"Equivalent: 1st argument not an\"\n               << \" epsilon-free deterministic acceptor\";\n    if (error) *error = true;\n    return false;\n  }\n  if (fst2.Properties(props, true) != props) {\n    FSTERROR() << \"Equivalent: 2nd argument not an\"\n               << \" epsilon-free deterministic acceptor\";\n    if (error) *error = true;\n    return false;\n  }\n  if ((fst1.Properties(kUnweighted, true) != kUnweighted) ||\n      (fst2.Properties(kUnweighted, true) != kUnweighted)) {\n    VectorFst<Arc> efst1(fst1);\n    VectorFst<Arc> efst2(fst2);\n    Push(&efst1, REWEIGHT_TO_INITIAL, delta);\n    Push(&efst2, REWEIGHT_TO_INITIAL, delta);\n    ArcMap(&efst1, QuantizeMapper<Arc>(delta));\n    ArcMap(&efst2, QuantizeMapper<Arc>(delta));\n    EncodeMapper<Arc> mapper(kEncodeWeights | kEncodeLabels, ENCODE);\n    ArcMap(&efst1, &mapper);\n    ArcMap(&efst2, &mapper);\n    return Equivalent(efst1, efst2);\n  }\n  using Util = internal::EquivalenceUtil<Arc>;\n  using MappedId = typename Util::MappedId;\n  enum { FST1 = 1, FST2 = 2 };  // Required by Util::MapState(...)\n  auto s1 = Util::MapState(fst1.Start(), FST1);\n  auto s2 = Util::MapState(fst2.Start(), FST2);\n  // The union-find structure.\n  UnionFind<MappedId> eq_classes(1000, Util::kInvalidId);\n  // Initializes the union-find structure.\n  eq_classes.MakeSet(s1);\n  eq_classes.MakeSet(s2);\n  // Data structure for the (partial) acceptor transition function of fst1 and\n  // fst2: input labels mapped to pairs of MappedIds representing destination\n  // states of the corresponding arcs in fst1 and fst2, respectively.\n  using Label2StatePairMap =\n      std::unordered_map<typename Arc::Label, std::pair<MappedId, MappedId>>;\n  Label2StatePairMap arc_pairs;\n  // Pairs of MappedId's to be processed, organized in a queue.\n  std::deque<std::pair<MappedId, MappedId>> q;\n  bool ret = true;\n  // Returns early if the start states differ w.r.t. finality.\n  if (Util::IsFinal(fst1, s1) != Util::IsFinal(fst2, s2)) ret = false;\n  // Main loop: explores the two acceptors in a breadth-first manner, updating\n  // the equivalence relation on the statesets. Loop invariant: each block of\n  // the states contains either final states only or non-final states only.\n  for (q.push_back(std::make_pair(s1, s2)); ret && !q.empty(); q.pop_front()) {\n    s1 = q.front().first;\n    s2 = q.front().second;\n    // Representatives of the equivalence classes of s1/s2.\n    const auto rep1 = Util::FindSet(&eq_classes, s1);\n    const auto rep2 = Util::FindSet(&eq_classes, s2);\n    if (rep1 != rep2) {\n      eq_classes.Union(rep1, rep2);\n      arc_pairs.clear();\n      // Copies outgoing arcs starting at s1 into the hash-table.\n      if (Util::kDeadState != s1) {\n        ArcIterator<Fst<Arc>> arc_iter(fst1, Util::UnMapState(s1));\n        for (; !arc_iter.Done(); arc_iter.Next()) {\n          const auto &arc = arc_iter.Value();\n          // Zero-weight arcs are treated as if they did not exist.\n          if (arc.weight != Weight::Zero()) {\n            arc_pairs[arc.ilabel].first = Util::MapState(arc.nextstate, FST1);\n          }\n        }\n      }\n      // Copies outgoing arcs starting at s2 into the hashtable.\n      if (Util::kDeadState != s2) {\n        ArcIterator<Fst<Arc>> arc_iter(fst2, Util::UnMapState(s2));\n        for (; !arc_iter.Done(); arc_iter.Next()) {\n          const auto &arc = arc_iter.Value();\n          // Zero-weight arcs are treated as if they did not exist.\n          if (arc.weight != Weight::Zero()) {\n            arc_pairs[arc.ilabel].second = Util::MapState(arc.nextstate, FST2);\n          }\n        }\n      }\n      // Iterates through the hashtable and process pairs of target states.\n      for (const auto &arc_iter : arc_pairs) {\n        const auto &pair = arc_iter.second;\n        if (Util::IsFinal(fst1, pair.first) !=\n            Util::IsFinal(fst2, pair.second)) {\n          // Detected inconsistency: return false.\n          ret = false;\n          break;\n        }\n        q.push_back(pair);\n      }\n    }\n  }\n  if (fst1.Properties(kError, false) || fst2.Properties(kError, false)) {\n    if (error) *error = true;\n    return false;\n  }\n  return ret;\n}\n\n}  // namespace fst\n\n#endif  // FST_EQUIVALENT_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/expanded-fst.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Generic FST augmented with state count-interface class definition.\n\n#ifndef FST_EXPANDED_FST_H_\n#define FST_EXPANDED_FST_H_\n\n#include <sys/types.h>\n#include <istream>\n#include <string>\n\n#include <fst/log.h>\n#include <fstream>\n\n#include <fst/fst.h>\n\n\nnamespace fst {\n\n// A generic FST plus state count.\ntemplate <class A>\nclass ExpandedFst : public Fst<A> {\n public:\n  using Arc = A;\n  using StateId = typename Arc::StateId;\n\n  virtual StateId NumStates() const = 0;  // State count\n\n  // Get a copy of this ExpandedFst. See Fst<>::Copy() for further doc.\n  ExpandedFst<Arc> *Copy(bool safe = false) const override = 0;\n\n  // Read an ExpandedFst from an input stream; return NULL on error.\n  static ExpandedFst<Arc> *Read(std::istream &strm,\n                                const FstReadOptions &opts) {\n    FstReadOptions ropts(opts);\n    FstHeader hdr;\n    if (ropts.header) {\n      hdr = *opts.header;\n    } else {\n      if (!hdr.Read(strm, opts.source)) return nullptr;\n      ropts.header = &hdr;\n    }\n    if (!(hdr.Properties() & kExpanded)) {\n      LOG(ERROR) << \"ExpandedFst::Read: Not an ExpandedFst: \" << ropts.source;\n      return nullptr;\n    }\n    const auto reader =\n        FstRegister<Arc>::GetRegister()->GetReader(hdr.FstType());\n    if (!reader) {\n      LOG(ERROR) << \"ExpandedFst::Read: Unknown FST type \\\"\" << hdr.FstType()\n                 << \"\\\" (arc type = \\\"\" << A::Type() << \"\\\"): \" << ropts.source;\n      return nullptr;\n    }\n    auto *fst = reader(strm, ropts);\n    if (!fst) return nullptr;\n    return static_cast<ExpandedFst<Arc> *>(fst);\n  }\n\n  // Read an ExpandedFst from a file; return NULL on error.\n  // Empty filename reads from standard input.\n  static ExpandedFst<Arc> *Read(const string &filename) {\n    if (!filename.empty()) {\n      std::ifstream strm(filename,\n                              std::ios_base::in | std::ios_base::binary);\n      if (!strm) {\n        LOG(ERROR) << \"ExpandedFst::Read: Can't open file: \" << filename;\n        return nullptr;\n      }\n      return Read(strm, FstReadOptions(filename));\n    } else {\n      return Read(std::cin, FstReadOptions(\"standard input\"));\n    }\n  }\n};\n\nnamespace internal {\n\n//  ExpandedFst<A> case - abstract methods.\ntemplate <class Arc>\ninline typename Arc::Weight Final(const ExpandedFst<Arc> &fst,\n                                  typename Arc::StateId s) {\n  return fst.Final(s);\n}\n\ntemplate <class Arc>\ninline ssize_t NumArcs(const ExpandedFst<Arc> &fst, typename Arc::StateId s) {\n  return fst.NumArcs(s);\n}\n\ntemplate <class Arc>\ninline ssize_t NumInputEpsilons(const ExpandedFst<Arc> &fst,\n                                typename Arc::StateId s) {\n  return fst.NumInputEpsilons(s);\n}\n\ntemplate <class Arc>\ninline ssize_t NumOutputEpsilons(const ExpandedFst<Arc> &fst,\n                                 typename Arc::StateId s) {\n  return fst.NumOutputEpsilons(s);\n}\n\n}  // namespace internal\n\n// A useful alias when using StdArc.\nusing StdExpandedFst = ExpandedFst<StdArc>;\n\n// This is a helper class template useful for attaching an ExpandedFst\n// interface to its implementation, handling reference counting. It\n// delegates to ImplToFst the handling of the Fst interface methods.\ntemplate <class Impl, class FST = ExpandedFst<typename Impl::Arc>>\nclass ImplToExpandedFst : public ImplToFst<Impl, FST> {\n public:\n  using Arc = typename FST::Arc;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using ImplToFst<Impl, FST>::operator=;\n\n  StateId NumStates() const override { return GetImpl()->NumStates(); }\n\n protected:\n  using ImplToFst<Impl, FST>::GetImpl;\n\n  explicit ImplToExpandedFst(std::shared_ptr<Impl> impl)\n      : ImplToFst<Impl, FST>(impl) {}\n\n  ImplToExpandedFst(const ImplToExpandedFst<Impl, FST> &fst)\n      : ImplToFst<Impl, FST>(fst) {}\n\n  ImplToExpandedFst(const ImplToExpandedFst<Impl, FST> &fst, bool safe)\n      : ImplToFst<Impl, FST>(fst, safe) {}\n\n  static Impl *Read(std::istream &strm, const FstReadOptions &opts) {\n    return Impl::Read(strm, opts);\n  }\n\n  // Read FST implementation from a file; return NULL on error.\n  // Empty filename reads from standard input.\n  static Impl *Read(const string &filename) {\n    if (!filename.empty()) {\n      std::ifstream strm(filename,\n                              std::ios_base::in | std::ios_base::binary);\n      if (!strm) {\n        LOG(ERROR) << \"ExpandedFst::Read: Can't open file: \" << filename;\n        return nullptr;\n      }\n      return Impl::Read(strm, FstReadOptions(filename));\n    } else {\n      return Impl::Read(std::cin, FstReadOptions(\"standard input\"));\n    }\n  }\n};\n\n// Function to return the number of states in an FST, counting them\n// if necessary.\ntemplate <class Arc>\ntypename Arc::StateId CountStates(const Fst<Arc> &fst) {\n  if (fst.Properties(kExpanded, false)) {\n    const auto *efst = static_cast<const ExpandedFst<Arc> *>(&fst);\n    return efst->NumStates();\n  } else {\n    typename Arc::StateId nstates = 0;\n    for (StateIterator<Fst<Arc>> siter(fst); !siter.Done(); siter.Next()) {\n      ++nstates;\n    }\n    return nstates;\n  }\n}\n\n// Function to return the number of arcs in an FST.\ntemplate <class Arc>\ntypename Arc::StateId CountArcs(const Fst<Arc> &fst) {\n  size_t narcs = 0;\n  for (StateIterator<Fst<Arc>> siter(fst); !siter.Done(); siter.Next()) {\n    narcs += fst.NumArcs(siter.Value());\n  }\n  return narcs;\n}\n\n}  // namespace fst\n\n#endif  // FST_EXPANDED_FST_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/expectation-weight.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Expectation semiring as described by Jason Eisner:\n// See: doi=10.1.1.22.9398\n// Multiplex semiring operations and identities:\n//    One: <One, Zero>\n//    Zero: <Zero, Zero>\n//    Plus: <a1, b1> + <a2, b2> = < (a1 + a2) , (b1 + b2) >\n//    Times: <a1, b1> * <a2, b2> = < (a1 * a2) , [(a1 * b2) + (a2 * b1)] >\n//    Division: Undefined (currently)\n//\n// Usually used to store the pair <probability, random_variable> so that\n// ShortestDistance[Fst<ArcTpl<ExpectationWeight<P, V>>>]\n//    == < PosteriorProbability, Expected_Value[V] >\n\n#ifndef FST_EXPECTATION_WEIGHT_H_\n#define FST_EXPECTATION_WEIGHT_H_\n\n#include <string>\n\n#include <fst/log.h>\n\n#include <fst/pair-weight.h>\n#include <fst/product-weight.h>\n\n\nnamespace fst {\n\n// X1 is usually a probability weight like LogWeight.\n// X2 is usually a random variable or vector (see SignedLogWeight or\n// SparsePowerWeight).\n//\n// If X1 is distinct from X2, it is required that there is an external product\n// between X1 and X2 and if both semriring are commutative, or left or right\n// semirings, then result must have those properties.\ntemplate <class X1, class X2>\nclass ExpectationWeight : public PairWeight<X1, X2> {\n public:\n  using PairWeight<X1, X2>::Value1;\n  using PairWeight<X1, X2>::Value2;\n\n  using PairWeight<X1, X2>::Reverse;\n  using PairWeight<X1, X2>::Quantize;\n  using PairWeight<X1, X2>::Member;\n\n  using ReverseWeight =\n      ExpectationWeight<typename X1::ReverseWeight, typename X2::ReverseWeight>;\n\n  ExpectationWeight() : PairWeight<X1, X2>(Zero()) {}\n\n  ExpectationWeight(const ExpectationWeight &weight)\n      : PairWeight<X1, X2>(weight) {}\n\n  explicit ExpectationWeight(const PairWeight<X1, X2> &weight)\n      : PairWeight<X1, X2>(weight) {}\n\n  ExpectationWeight(const X1 &x1, const X2 &x2) : PairWeight<X1, X2>(x1, x2) {}\n\n  static const ExpectationWeight &Zero() {\n    static const ExpectationWeight zero(X1::Zero(), X2::Zero());\n    return zero;\n  }\n\n  static const ExpectationWeight &One() {\n    static const ExpectationWeight one(X1::One(), X2::Zero());\n    return one;\n  }\n\n  static const ExpectationWeight &NoWeight() {\n    static const ExpectationWeight no_weight(X1::NoWeight(), X2::NoWeight());\n    return no_weight;\n  }\n\n  static const string &Type() {\n    static const string *const type =\n        new string(\"expectation_\" + X1::Type() + \"_\" + X2::Type());\n    return *type;\n  }\n\n  PairWeight<X1, X2> Quantize(float delta = kDelta) const {\n    return ExpectationWeight(PairWeight<X1, X2>::Quantize());\n  }\n\n  ReverseWeight Reverse() const {\n    return ReverseWeight(PairWeight<X1, X2>::Reverse());\n  }\n\n  bool Member() const { return PairWeight<X1, X2>::Member(); }\n\n  static constexpr uint64 Properties() {\n    return X1::Properties() & X2::Properties() &\n           (kLeftSemiring | kRightSemiring | kCommutative | kIdempotent);\n  }\n};\n\ntemplate <class X1, class X2>\ninline ExpectationWeight<X1, X2> Plus(const ExpectationWeight<X1, X2> &w1,\n                                      const ExpectationWeight<X1, X2> &w2) {\n  return ExpectationWeight<X1, X2>(Plus(w1.Value1(), w2.Value1()),\n                                   Plus(w1.Value2(), w2.Value2()));\n}\n\ntemplate <class X1, class X2>\ninline ExpectationWeight<X1, X2> Times(const ExpectationWeight<X1, X2> &w1,\n                                       const ExpectationWeight<X1, X2> &w2) {\n  return ExpectationWeight<X1, X2>(\n      Times(w1.Value1(), w2.Value1()),\n      Plus(Times(w1.Value1(), w2.Value2()), Times(w1.Value2(), w2.Value1())));\n}\n\ntemplate <class X1, class X2>\ninline ExpectationWeight<X1, X2> Divide(const ExpectationWeight<X1, X2> &w1,\n                                        const ExpectationWeight<X1, X2> &w2,\n                                        DivideType typ = DIVIDE_ANY) {\n  FSTERROR() << \"ExpectationWeight::Divide: Not implemented\";\n  return ExpectationWeight<X1, X2>::NoWeight();\n}\n\n// This function object generates weights by calling the underlying generators\n// for the template weight types, like all other pair weight types. This is\n// intended primarily for testing.\ntemplate <class X1, class X2>\nclass WeightGenerate<ExpectationWeight<X1, X2>>\n    : public WeightGenerate<PairWeight<X1, X2>> {\n public:\n  using Weight = ExpectationWeight<X1, X2>;\n  using Generate = WeightGenerate<PairWeight<X1, X2>>;\n\n  explicit WeightGenerate(bool allow_zero = true) : Generate(allow_zero) {}\n\n  Weight operator()() const { return Weight(Generate::operator()()); }\n};\n\n}  // namespace fst\n\n#endif  // FST_EXPECTATION_WEIGHT_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/extensions/compress/compress-script.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Declarations of 'scriptable' versions of compression operations, that is,\n// those that can be called with FstClass-type arguments.\n\n#ifndef FST_EXTENSIONS_COMPRESS_COMPRESS_SCRIPT_H_\n#define FST_EXTENSIONS_COMPRESS_COMPRESS_SCRIPT_H_\n\n#include <utility>\n#include <vector>\n\n#include <fst/extensions/compress/compress.h>\n\n#include <fst/log.h>\n#include <fst/util.h>\n#include <fst/script/arg-packs.h>\n#include <fst/script/fst-class.h>\n\nnamespace fst {\nnamespace script {\n\ntypedef std::tuple<const FstClass &, const string &, const bool> CompressArgs;\n\ntemplate <class Arc>\nvoid Compress(CompressArgs *args) {\n  const Fst<Arc> &fst = *(std::get<0>(*args).GetFst<Arc>());\n  const string &filename = std::get<1>(*args);\n  const bool gzip = std::get<2>(*args);\n\n  if (!fst::Compress(fst, filename, gzip)) FSTERROR() << \"Compress: failed\";\n}\n\nvoid Compress(const FstClass &fst, const string &filename, const bool gzip);\n\ntypedef std::tuple<const string &, MutableFstClass *, const bool>\n    DecompressArgs;\n\ntemplate <class Arc>\nvoid Decompress(DecompressArgs *args) {\n  const string &filename = std::get<0>(*args);\n  MutableFst<Arc> *fst = std::get<1>(*args)->GetMutableFst<Arc>();\n  const bool gzip = std::get<2>(*args);\n\n  if (!fst::Decompress(filename, fst, gzip))\n    FSTERROR() << \"Decompress: failed\";\n}\n\nvoid Decompress(const string &filename, MutableFstClass *fst, const bool gzip);\n\n}  // namespace script\n}  // namespace fst\n\n#endif  // FST_EXTENSIONS_COMPRESS_COMPRESS_SCRIPT_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/extensions/compress/compress.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Compresses and decompresses unweighted FSTs.\n\n#ifndef FST_EXTENSIONS_COMPRESS_COMPRESS_H_\n#define FST_EXTENSIONS_COMPRESS_COMPRESS_H_\n\n#include <cstdio>\n\n#include <iostream>\n#include <queue>\n#include <vector>\n\n#include <fst/compat.h>\n#include <fst/extensions/compress/elias.h>\n#include <fst/extensions/compress/gzfile.h>\n#include <fstream>\n\n#include <fst/encode.h>\n#include <fst/expanded-fst.h>\n#include <fst/fst.h>\n#include <fst/mutable-fst.h>\n#include <fst/statesort.h>\n\nnamespace fst {\n\n// Identifies stream data as a vanilla compressed FST.\nstatic const int32 kCompressMagicNumber = 1858869554;\n// Identifies stream data as (probably) a Gzip file accidentally read from\n// a vanilla stream, without gzip support.\nstatic const int32 kGzipMagicNumber = 0x8b1f;\n// Selects the two most significant bytes.\nconstexpr uint32 kGzipMask = 0xffffffff >> 16;\n\nnamespace internal {\n\n// Expands a Lempel Ziv code and returns the set of code words. expanded_code[i]\n// is the i^th Lempel Ziv codeword.\ntemplate <class Var, class Edge>\nbool ExpandLZCode(const std::vector<std::pair<Var, Edge>> &code,\n                  std::vector<std::vector<Edge>> *expanded_code) {\n  expanded_code->resize(code.size());\n  for (int i = 0; i < code.size(); ++i) {\n    if (code[i].first > i) {\n      LOG(ERROR) << \"ExpandLZCode: Not a valid code\";\n      return false;\n    }\n    if (code[i].first == 0) {\n      (*expanded_code)[i].resize(1, code[i].second);\n    } else {\n      (*expanded_code)[i].resize((*expanded_code)[code[i].first - 1].size() +\n                                 1);\n      std::copy((*expanded_code)[code[i].first - 1].begin(),\n                (*expanded_code)[code[i].first - 1].end(),\n                (*expanded_code)[i].begin());\n      (*expanded_code)[i][(*expanded_code)[code[i].first - 1].size()] =\n          code[i].second;\n    }\n  }\n  return true;\n}\n\n}  // namespace internal\n\n// Lempel Ziv on data structure Edge, with a less than operator\n// EdgeLessThan and an equals operator  EdgeEquals.\n// Edge has a value defaultedge which it never takes and\n// Edge is defined, it is initialized to defaultedge\ntemplate <class Var, class Edge, class EdgeLessThan, class EdgeEquals>\nclass LempelZiv {\n public:\n  LempelZiv() : dict_number_(0), default_edge_() {\n    root_.current_number = dict_number_++;\n    root_.current_edge = default_edge_;\n    decode_vector_.push_back(std::make_pair(0, default_edge_));\n  }\n  // Encodes a vector input into output\n  void BatchEncode(const std::vector<Edge> &input,\n                   std::vector<std::pair<Var, Edge>> *output);\n\n  // Decodes codedvector to output. Returns false if\n  // the index exceeds the size.\n  bool BatchDecode(const std::vector<std::pair<Var, Edge>> &input,\n                   std::vector<Edge> *output);\n\n  // Decodes a single dictionary element. Returns false\n  // if the index exceeds the size.\n  bool SingleDecode(const Var &index, Edge *output) {\n    if (index >= decode_vector_.size()) {\n      LOG(ERROR) << \"LempelZiv::SingleDecode: \"\n                 << \"Index exceeded the dictionary size\";\n      return false;\n    } else {\n      *output = decode_vector_[index].second;\n      return true;\n    }\n  }\n\n  ~LempelZiv() {\n    for (auto it = (root_.next_number).begin(); it != (root_.next_number).end();\n         ++it) {\n      CleanUp(it->second);\n    }\n  }\n  // Adds a single dictionary element while decoding\n  //  void AddDictElement(const std::pair<Var, Edge> &newdict) {\n  //    EdgeEquals InstEdgeEquals;\n  //  if (InstEdgeEquals(newdict.second, default_edge_) != 1)\n  //     decode_vector_.push_back(newdict);\n  //  }\n\n private:\n  // Node datastructure is used for encoding\n\n  struct Node {\n    Var current_number;\n    Edge current_edge;\n    std::map<Edge, Node *, EdgeLessThan> next_number;\n  };\n\n  void CleanUp(Node *temp) {\n    for (auto it = (temp->next_number).begin(); it != (temp->next_number).end();\n         ++it) {\n      CleanUp(it->second);\n    }\n    delete temp;\n  }\n  Node root_;\n  Var dict_number_;\n  // decode_vector_ is used for decoding\n  std::vector<std::pair<Var, Edge>> decode_vector_;\n  Edge default_edge_;\n};\n\ntemplate <class Var, class Edge, class EdgeLessThan, class EdgeEquals>\nvoid LempelZiv<Var, Edge, EdgeLessThan, EdgeEquals>::BatchEncode(\n    const std::vector<Edge> &input, std::vector<std::pair<Var, Edge>> *output) {\n  for (typename std::vector<Edge>::const_iterator it = input.begin();\n       it != input.end(); ++it) {\n    Node *temp_node = &root_;\n    while (it != input.end()) {\n      auto next = (temp_node->next_number).find(*it);\n      if (next != (temp_node->next_number).end()) {\n        temp_node = next->second;\n        ++it;\n      } else {\n        break;\n      }\n    }\n    if (it == input.end() && temp_node->current_number != 0) {\n      output->push_back(\n          std::make_pair(temp_node->current_number, default_edge_));\n    } else if (it != input.end()) {\n      output->push_back(std::make_pair(temp_node->current_number, *it));\n      Node *new_node = new (Node);\n      new_node->current_number = dict_number_++;\n      new_node->current_edge = *it;\n      (temp_node->next_number)[*it] = new_node;\n    }\n    if (it == input.end()) break;\n  }\n}\n\ntemplate <class Var, class Edge, class EdgeLessThan, class EdgeEquals>\nbool LempelZiv<Var, Edge, EdgeLessThan, EdgeEquals>::BatchDecode(\n    const std::vector<std::pair<Var, Edge>> &input, std::vector<Edge> *output) {\n  for (typename std::vector<std::pair<Var, Edge>>::const_iterator it =\n           input.begin();\n       it != input.end(); ++it) {\n    std::vector<Edge> temp_output;\n    EdgeEquals InstEdgeEquals;\n    if (InstEdgeEquals(it->second, default_edge_) != 1) {\n      decode_vector_.push_back(*it);\n      temp_output.push_back(it->second);\n    }\n    Var temp_integer = it->first;\n    if (temp_integer >= decode_vector_.size()) {\n      LOG(ERROR) << \"LempelZiv::BatchDecode: \"\n                 << \"Index exceeded the dictionary size\";\n      return false;\n    } else {\n      while (temp_integer != 0) {\n        temp_output.push_back(decode_vector_[temp_integer].second);\n        temp_integer = decode_vector_[temp_integer].first;\n      }\n      std::reverse(temp_output.begin(), temp_output.end());\n      output->insert(output->end(), temp_output.begin(), temp_output.end());\n    }\n  }\n  return true;\n}\n\n// The main Compressor class\ntemplate <class Arc>\nclass Compressor {\n public:\n  typedef typename Arc::StateId StateId;\n  typedef typename Arc::Label Label;\n  typedef typename Arc::Weight Weight;\n\n  Compressor() {}\n\n  // Compresses fst into a boolean vector code. Returns true on sucesss.\n  bool Compress(const Fst<Arc> &fst, std::ostream &strm);\n\n  // Decompresses the boolean vector into Fst. Returns true on sucesss.\n  bool Decompress(std::istream &strm, const string &source,\n                  MutableFst<Arc> *fst);\n\n  // Finds the BFS order of a fst\n  void BfsOrder(const ExpandedFst<Arc> &fst, std::vector<StateId> *order);\n\n  // Preprocessing step to convert fst to a isomorphic fst\n  // Returns a preproccess fst and a dictionary\n  void Preprocess(const Fst<Arc> &fst, MutableFst<Arc> *preprocessedfst,\n                  EncodeMapper<Arc> *encoder);\n\n  // Performs Lempel Ziv and outputs a stream of integers\n  // and sends it to a stream\n  void EncodeProcessedFst(const ExpandedFst<Arc> &fst, std::ostream &strm);\n\n  // Decodes fst from the stream\n  void DecodeProcessedFst(const std::vector<StateId> &input,\n                          MutableFst<Arc> *fst, bool unweighted);\n\n  // Converts buffer_code_ to uint8 and writes to a stream.\n\n  // Writes the boolean file to the stream\n  void WriteToStream(std::ostream &strm);\n\n  // Writes the weights to the stream\n  void WriteWeight(const std::vector<Weight> &input, std::ostream &strm);\n\n  void ReadWeight(std::istream &strm, std::vector<Weight> *output);\n\n  // Same as fst::Decode without the line RmFinalEpsilon(fst)\n  void DecodeForCompress(MutableFst<Arc> *fst, const EncodeMapper<Arc> &mapper);\n\n  // Updates the buffer_code_\n  template <class CVar>\n  void WriteToBuffer(CVar input) {\n    std::vector<bool> current_code;\n    Elias<CVar>::DeltaEncode(input, &current_code);\n    if (!buffer_code_.empty()) {\n      buffer_code_.insert(buffer_code_.end(), current_code.begin(),\n                          current_code.end());\n    } else {\n      buffer_code_.assign(current_code.begin(), current_code.end());\n    }\n  }\n\n private:\n  struct LZLabel {\n    LZLabel() : label(0) {}\n    Label label;\n  };\n\n  struct LabelLessThan {\n    bool operator()(const LZLabel &labelone, const LZLabel &labeltwo) const {\n      return labelone.label < labeltwo.label;\n    }\n  };\n\n  struct LabelEquals {\n    bool operator()(const LZLabel &labelone, const LZLabel &labeltwo) const {\n      return labelone.label == labeltwo.label;\n    }\n  };\n\n  struct Transition {\n    Transition() : nextstate(0), label(0), weight(Weight::Zero()) {}\n\n    StateId nextstate;\n    Label label;\n    Weight weight;\n  };\n\n  struct TransitionLessThan {\n    bool operator()(const Transition &transition_one,\n                    const Transition &transition_two) const {\n      if (transition_one.nextstate == transition_two.nextstate)\n        return transition_one.label < transition_two.label;\n      else\n        return transition_one.nextstate < transition_two.nextstate;\n    }\n  } transition_less_than;\n\n  struct TransitionEquals {\n    bool operator()(const Transition &transition_one,\n                    const Transition &transition_two) const {\n      return transition_one.nextstate == transition_two.nextstate &&\n             transition_one.label == transition_two.label;\n    }\n  } transition_equals;\n\n  struct OldDictCompare {\n    bool operator()(const std::pair<StateId, Transition> &pair_one,\n                    const std::pair<StateId, Transition> &pair_two) const {\n      if ((pair_one.second).nextstate == (pair_two.second).nextstate)\n        return (pair_one.second).label < (pair_two.second).label;\n      else\n        return (pair_one.second).nextstate < (pair_two.second).nextstate;\n    }\n  } old_dict_compare;\n\n  std::vector<bool> buffer_code_;\n  std::vector<Weight> arc_weight_;\n  std::vector<Weight> final_weight_;\n};\n\ntemplate <class Arc>\ninline void Compressor<Arc>::DecodeForCompress(\n    MutableFst<Arc> *fst, const EncodeMapper<Arc> &mapper) {\n  ArcMap(fst, EncodeMapper<Arc>(mapper, DECODE));\n  fst->SetInputSymbols(mapper.InputSymbols());\n  fst->SetOutputSymbols(mapper.OutputSymbols());\n}\n\n// Compressor::BfsOrder\ntemplate <class Arc>\nvoid Compressor<Arc>::BfsOrder(const ExpandedFst<Arc> &fst,\n                               std::vector<StateId> *order) {\n  Arc arc;\n  StateId bfs_visit_number = 0;\n  std::queue<StateId> states_queue;\n  order->assign(fst.NumStates(), kNoStateId);\n  states_queue.push(fst.Start());\n  (*order)[fst.Start()] = bfs_visit_number++;\n  while (!states_queue.empty()) {\n    for (ArcIterator<Fst<Arc>> aiter(fst, states_queue.front()); !aiter.Done();\n         aiter.Next()) {\n      arc = aiter.Value();\n      StateId nextstate = arc.nextstate;\n      if ((*order)[nextstate] == kNoStateId) {\n        (*order)[nextstate] = bfs_visit_number++;\n        states_queue.push(nextstate);\n      }\n    }\n    states_queue.pop();\n  }\n\n  // If the FST is unconnected, then the following\n  // code finds them\n  while (bfs_visit_number < fst.NumStates()) {\n    int unseen_state = 0;\n    for (unseen_state = 0; unseen_state < fst.NumStates(); ++unseen_state) {\n      if ((*order)[unseen_state] == kNoStateId) break;\n    }\n    states_queue.push(unseen_state);\n    (*order)[unseen_state] = bfs_visit_number++;\n    while (!states_queue.empty()) {\n      for (ArcIterator<Fst<Arc>> aiter(fst, states_queue.front());\n           !aiter.Done(); aiter.Next()) {\n        arc = aiter.Value();\n        StateId nextstate = arc.nextstate;\n        if ((*order)[nextstate] == kNoStateId) {\n          (*order)[nextstate] = bfs_visit_number++;\n          states_queue.push(nextstate);\n        }\n      }\n      states_queue.pop();\n    }\n  }\n}\n\ntemplate <class Arc>\nvoid Compressor<Arc>::Preprocess(const Fst<Arc> &fst,\n                                 MutableFst<Arc> *preprocessedfst,\n                                 EncodeMapper<Arc> *encoder) {\n  *preprocessedfst = fst;\n  if (!preprocessedfst->NumStates()) {\n    return;\n  }\n  // Relabels the edges and develops a dictionary\n  Encode(preprocessedfst, encoder);\n  std::vector<StateId> order;\n  // Finds the BFS sorting order of the fst\n  BfsOrder(*preprocessedfst, &order);\n  // Reorders the states according to the BFS order\n  StateSort(preprocessedfst, order);\n}\n\ntemplate <class Arc>\nvoid Compressor<Arc>::EncodeProcessedFst(const ExpandedFst<Arc> &fst,\n                                         std::ostream &strm) {\n  std::vector<StateId> output;\n  LempelZiv<StateId, LZLabel, LabelLessThan, LabelEquals> dict_new;\n  LempelZiv<StateId, Transition, TransitionLessThan, TransitionEquals> dict_old;\n  std::vector<LZLabel> current_new_input;\n  std::vector<Transition> current_old_input;\n  std::vector<std::pair<StateId, LZLabel>> current_new_output;\n  std::vector<std::pair<StateId, Transition>> current_old_output;\n  std::vector<StateId> final_states;\n\n  StateId number_of_states = fst.NumStates();\n\n  StateId seen_states = 0;\n  // Adding the number of states\n  WriteToBuffer<StateId>(number_of_states);\n\n  for (StateId state = 0; state < number_of_states; ++state) {\n    current_new_input.clear();\n    current_old_input.clear();\n    current_new_output.clear();\n    current_old_output.clear();\n    if (state > seen_states) ++seen_states;\n\n    // Collecting the final states\n    if (fst.Final(state) != Weight::Zero()) {\n      final_states.push_back(state);\n      final_weight_.push_back(fst.Final(state));\n    }\n\n    // Reading the states\n    for (ArcIterator<Fst<Arc>> aiter(fst, state); !aiter.Done(); aiter.Next()) {\n      Arc arc = aiter.Value();\n      if (arc.nextstate > seen_states) {  // RILEY: > or >= ?\n        ++seen_states;\n        LZLabel temp_label;\n        temp_label.label = arc.ilabel;\n        arc_weight_.push_back(arc.weight);\n        current_new_input.push_back(temp_label);\n      } else {\n        Transition temp_transition;\n        temp_transition.nextstate = arc.nextstate;\n        temp_transition.label = arc.ilabel;\n        temp_transition.weight = arc.weight;\n        current_old_input.push_back(temp_transition);\n      }\n    }\n    // Adding new states\n    dict_new.BatchEncode(current_new_input, &current_new_output);\n    WriteToBuffer<StateId>(current_new_output.size());\n\n    for (auto it = current_new_output.begin(); it != current_new_output.end();\n         ++it) {\n      WriteToBuffer<StateId>(it->first);\n      WriteToBuffer<Label>((it->second).label);\n    }\n    // Adding old states by sorting and using difference coding\n    std::sort(current_old_input.begin(), current_old_input.end(),\n              transition_less_than);\n    for (auto it = current_old_input.begin(); it != current_old_input.end();\n         ++it) {\n      arc_weight_.push_back(it->weight);\n    }\n    dict_old.BatchEncode(current_old_input, &current_old_output);\n    std::vector<StateId> dict_old_temp;\n    std::vector<Transition> transition_old_temp;\n    for (auto it = current_old_output.begin(); it != current_old_output.end();\n         ++it) {\n      dict_old_temp.push_back(it->first);\n      transition_old_temp.push_back(it->second);\n    }\n    if (!transition_old_temp.empty()) {\n      if ((transition_old_temp.back()).nextstate == 0 &&\n          (transition_old_temp.back()).label == 0) {\n        transition_old_temp.pop_back();\n      }\n    }\n    std::sort(dict_old_temp.begin(), dict_old_temp.end());\n    std::sort(transition_old_temp.begin(), transition_old_temp.end(),\n              transition_less_than);\n\n    WriteToBuffer<StateId>(dict_old_temp.size());\n    if (dict_old_temp.size() != transition_old_temp.size())\n      WriteToBuffer<int>(1);\n    else\n      WriteToBuffer<int>(0);\n\n    StateId previous;\n    if (!dict_old_temp.empty()) {\n      WriteToBuffer<StateId>(dict_old_temp.front());\n      previous = dict_old_temp.front();\n    }\n    if (dict_old_temp.size() > 1) {\n      for (auto it = dict_old_temp.begin() + 1; it != dict_old_temp.end();\n           ++it) {\n        WriteToBuffer<StateId>(*it - previous);\n        previous = *it;\n      }\n    }\n    if (!transition_old_temp.empty()) {\n      WriteToBuffer<StateId>((transition_old_temp.front()).nextstate);\n      previous = (transition_old_temp.front()).nextstate;\n      WriteToBuffer<Label>((transition_old_temp.front()).label);\n    }\n    if (transition_old_temp.size() > 1) {\n      for (auto it = transition_old_temp.begin() + 1;\n           it != transition_old_temp.end(); ++it) {\n        WriteToBuffer<StateId>(it->nextstate - previous);\n        previous = it->nextstate;\n        WriteToBuffer<StateId>(it->label);\n      }\n    }\n  }\n  // Adding final states\n  WriteToBuffer<StateId>(final_states.size());\n  if (!final_states.empty()) {\n    for (auto it = final_states.begin(); it != final_states.end(); ++it) {\n      WriteToBuffer<StateId>(*it);\n    }\n  }\n  WriteToStream(strm);\n  uint8 unweighted = (fst.Properties(kUnweighted, true) == kUnweighted);\n  WriteType(strm, unweighted);\n  if (unweighted == 0) {\n    WriteWeight(arc_weight_, strm);\n    WriteWeight(final_weight_, strm);\n  }\n}\n\ntemplate <class Arc>\nvoid Compressor<Arc>::DecodeProcessedFst(const std::vector<StateId> &input,\n                                         MutableFst<Arc> *fst,\n                                         bool unweighted) {\n  LempelZiv<StateId, LZLabel, LabelLessThan, LabelEquals> dict_new;\n  LempelZiv<StateId, Transition, TransitionLessThan, TransitionEquals> dict_old;\n  std::vector<std::pair<StateId, LZLabel>> current_new_input;\n  std::vector<std::pair<StateId, Transition>> current_old_input;\n  std::vector<LZLabel> current_new_output;\n  std::vector<Transition> current_old_output;\n  std::vector<std::pair<StateId, Transition>> actual_old_dict_numbers;\n  std::vector<Transition> actual_old_dict_transitions;\n  auto arc_weight_it = arc_weight_.begin();\n  Transition default_transition;\n  StateId seen_states = 1;\n\n  // Adding states.\n  const StateId num_states = input.front();\n  if (num_states > 0) {\n    const StateId start_state = fst->AddState();\n    fst->SetStart(start_state);\n    for (StateId state = 1; state < num_states; ++state) {\n      fst->AddState();\n    }\n  }\n\n  typename std::vector<StateId>::const_iterator main_it = input.begin();\n  ++main_it;\n\n  for (StateId current_state = 0; current_state < num_states; ++current_state) {\n    if (current_state >= seen_states) ++seen_states;\n    current_new_input.clear();\n    current_new_output.clear();\n    current_old_input.clear();\n    current_old_output.clear();\n    // New states\n    StateId current_number_new_elements = *main_it;\n    ++main_it;\n    for (StateId new_integer = 0; new_integer < current_number_new_elements;\n         ++new_integer) {\n      std::pair<StateId, LZLabel> temp_new_dict_element;\n      temp_new_dict_element.first = *main_it;\n      ++main_it;\n      LZLabel temp_label;\n      temp_label.label = *main_it;\n      ++main_it;\n      temp_new_dict_element.second = temp_label;\n      current_new_input.push_back(temp_new_dict_element);\n    }\n    dict_new.BatchDecode(current_new_input, &current_new_output);\n    for (auto it = current_new_output.begin(); it != current_new_output.end();\n         ++it) {\n      if (!unweighted) {\n        fst->AddArc(current_state,\n                    Arc(it->label, it->label, *arc_weight_it, seen_states++));\n        ++arc_weight_it;\n      } else {\n        fst->AddArc(current_state,\n                    Arc(it->label, it->label, Weight::One(), seen_states++));\n      }\n    }\n\n    // Old states dictionary\n    StateId current_number_old_elements = *main_it;\n    ++main_it;\n    StateId is_zero_removed = *main_it;\n    ++main_it;\n    StateId previous = 0;\n    actual_old_dict_numbers.clear();\n    for (StateId new_integer = 0; new_integer < current_number_old_elements;\n         ++new_integer) {\n      std::pair<StateId, Transition> pair_temp_transition;\n      if (new_integer == 0) {\n        pair_temp_transition.first = *main_it;\n        previous = *main_it;\n      } else {\n        pair_temp_transition.first = *main_it + previous;\n        previous = pair_temp_transition.first;\n      }\n      ++main_it;\n      Transition temp_test;\n      if (!dict_old.SingleDecode(pair_temp_transition.first, &temp_test)) {\n        FSTERROR() << \"Compressor::Decode: failed\";\n        fst->DeleteStates();\n        fst->SetProperties(kError, kError);\n        return;\n      }\n      pair_temp_transition.second = temp_test;\n      actual_old_dict_numbers.push_back(pair_temp_transition);\n    }\n\n    // Reordering the dictionary elements\n    std::sort(actual_old_dict_numbers.begin(), actual_old_dict_numbers.end(),\n              old_dict_compare);\n\n    // Transitions\n    previous = 0;\n    actual_old_dict_transitions.clear();\n\n    for (StateId new_integer = 0;\n         new_integer < current_number_old_elements - is_zero_removed;\n         ++new_integer) {\n      Transition temp_transition;\n      if (new_integer == 0) {\n        temp_transition.nextstate = *main_it;\n        previous = *main_it;\n      } else {\n        temp_transition.nextstate = *main_it + previous;\n        previous = temp_transition.nextstate;\n      }\n      ++main_it;\n      temp_transition.label = *main_it;\n      ++main_it;\n      actual_old_dict_transitions.push_back(temp_transition);\n    }\n\n    if (is_zero_removed == 1) {\n      actual_old_dict_transitions.push_back(default_transition);\n    }\n\n    auto trans_it = actual_old_dict_transitions.begin();\n    auto dict_it = actual_old_dict_numbers.begin();\n\n    while (trans_it != actual_old_dict_transitions.end() &&\n           dict_it != actual_old_dict_numbers.end()) {\n      if (dict_it->first == 0) {\n        ++dict_it;\n      } else {\n        std::pair<StateId, Transition> temp_pair;\n        if (transition_equals(*trans_it, default_transition) == 1) {\n          temp_pair.first = dict_it->first;\n          temp_pair.second = default_transition;\n          ++dict_it;\n        } else if (transition_less_than(dict_it->second, *trans_it) == 1) {\n          temp_pair.first = dict_it->first;\n          temp_pair.second = *trans_it;\n          ++dict_it;\n        } else {\n          temp_pair.first = 0;\n          temp_pair.second = *trans_it;\n        }\n        ++trans_it;\n        current_old_input.push_back(temp_pair);\n      }\n    }\n    while (trans_it != actual_old_dict_transitions.end()) {\n      std::pair<StateId, Transition> temp_pair;\n      temp_pair.first = 0;\n      temp_pair.second = *trans_it;\n      ++trans_it;\n      current_old_input.push_back(temp_pair);\n    }\n\n    // Adding old elements in the dictionary\n    if (!dict_old.BatchDecode(current_old_input, &current_old_output)) {\n      FSTERROR() << \"Compressor::Decode: Failed\";\n      fst->DeleteStates();\n      fst->SetProperties(kError, kError);\n      return;\n    }\n\n    for (auto it = current_old_output.begin(); it != current_old_output.end();\n         ++it) {\n      if (!unweighted) {\n        fst->AddArc(current_state,\n                    Arc(it->label, it->label, *arc_weight_it, it->nextstate));\n        ++arc_weight_it;\n      } else {\n        fst->AddArc(current_state,\n                    Arc(it->label, it->label, Weight::One(), it->nextstate));\n      }\n    }\n  }\n  // Adding the final states\n  StateId number_of_final_states = *main_it;\n  if (number_of_final_states > 0) {\n    ++main_it;\n    for (StateId temp_int = 0; temp_int < number_of_final_states; ++temp_int) {\n      if (!unweighted) {\n        fst->SetFinal(*main_it, final_weight_[temp_int]);\n      } else {\n        fst->SetFinal(*main_it, Weight(0));\n      }\n      ++main_it;\n    }\n  }\n}\n\ntemplate <class Arc>\nvoid Compressor<Arc>::ReadWeight(std::istream &strm,\n                                 std::vector<Weight> *output) {\n  int64 size;\n  Weight weight;\n  ReadType(strm, &size);\n  for (int64 i = 0; i < size; ++i) {\n    weight.Read(strm);\n    output->push_back(weight);\n  }\n}\n\ntemplate <class Arc>\nbool Compressor<Arc>::Decompress(std::istream &strm, const string &source,\n                                 MutableFst<Arc> *fst) {\n  fst->DeleteStates();\n  int32 magic_number = 0;\n  ReadType(strm, &magic_number);\n  if (magic_number != kCompressMagicNumber) {\n    LOG(ERROR) << \"Decompress: Bad compressed Fst: \" << source;\n    // If the most significant two bytes of the magic number match the\n    // gzip magic number, then we are probably reading a gzip file as an\n    // ordinary stream.\n    if ((magic_number & kGzipMask) == kGzipMagicNumber) {\n      LOG(ERROR) << \"Decompress: Fst appears to be compressed with Gzip, but \"\n                    \"gzip decompression was not requested. Try with \"\n                    \"the --gzip flag\"\n                    \".\";\n    }\n    return false;\n  }\n  std::unique_ptr<EncodeMapper<Arc>> encoder(\n      EncodeMapper<Arc>::Read(strm, \"Decoding\", DECODE));\n  std::vector<bool> bool_code;\n  uint8 block;\n  uint8 msb = 128;\n  int64 data_size;\n  ReadType(strm, &data_size);\n  for (int64 i = 0; i < data_size; ++i) {\n    ReadType(strm, &block);\n    for (int j = 0; j < 8; ++j) {\n      uint8 temp = msb & block;\n      if (temp == 128)\n        bool_code.push_back(1);\n      else\n        bool_code.push_back(0);\n      block = block << 1;\n    }\n  }\n  std::vector<StateId> int_code;\n  Elias<StateId>::BatchDecode(bool_code, &int_code);\n  bool_code.clear();\n  uint8 unweighted;\n  ReadType(strm, &unweighted);\n  if (unweighted == 0) {\n    ReadWeight(strm, &arc_weight_);\n    ReadWeight(strm, &final_weight_);\n  }\n  DecodeProcessedFst(int_code, fst, unweighted);\n  DecodeForCompress(fst, *encoder);\n  return !fst->Properties(kError, false);\n}\n\ntemplate <class Arc>\nvoid Compressor<Arc>::WriteWeight(const std::vector<Weight> &input,\n                                  std::ostream &strm) {\n  int64 size = input.size();\n  WriteType(strm, size);\n  for (typename std::vector<Weight>::const_iterator it = input.begin();\n       it != input.end(); ++it) {\n    it->Write(strm);\n  }\n}\n\ntemplate <class Arc>\nvoid Compressor<Arc>::WriteToStream(std::ostream &strm) {\n  while (buffer_code_.size() % 8 != 0) buffer_code_.push_back(1);\n  int64 data_size = buffer_code_.size() / 8;\n  WriteType(strm, data_size);\n  std::vector<bool>::const_iterator it;\n  int64 i;\n  uint8 block;\n  for (it = buffer_code_.begin(), i = 0; it != buffer_code_.end(); ++it, ++i) {\n    if (i % 8 == 0) {\n      if (i > 0) WriteType(strm, block);\n      block = 0;\n    } else {\n      block = block << 1;\n    }\n    block |= *it;\n  }\n  WriteType(strm, block);\n}\n\ntemplate <class Arc>\nbool Compressor<Arc>::Compress(const Fst<Arc> &fst, std::ostream &strm) {\n  VectorFst<Arc> processedfst;\n  EncodeMapper<Arc> encoder(kEncodeLabels, ENCODE);\n  Preprocess(fst, &processedfst, &encoder);\n  WriteType(strm, kCompressMagicNumber);\n  encoder.Write(strm, \"encoder stream\");\n  EncodeProcessedFst(processedfst, strm);\n  return true;\n}\n\n// Convenience functions that call the compressor and decompressor.\n\ntemplate <class Arc>\nvoid Compress(const Fst<Arc> &fst, std::ostream &strm) {\n  Compressor<Arc> comp;\n  comp.Compress(fst, strm);\n}\n\n// Returns true on success.\ntemplate <class Arc>\nbool Compress(const Fst<Arc> &fst, const string &file_name,\n              const bool gzip = false) {\n  if (gzip) {\n    if (file_name.empty()) {\n      std::stringstream strm;\n      Compress(fst, strm);\n      OGzFile gzfile(fileno(stdout));\n      gzfile.write(strm);\n      if (!gzfile) {\n        LOG(ERROR) << \"Compress: Can't write to file: stdout\";\n        return false;\n      }\n    } else {\n      std::stringstream strm;\n      Compress(fst, strm);\n      OGzFile gzfile(file_name);\n      if (!gzfile) {\n        LOG(ERROR) << \"Compress: Can't open file: \" << file_name;\n        return false;\n      }\n      gzfile.write(strm);\n      if (!gzfile) {\n        LOG(ERROR) << \"Compress: Can't write to file: \" << file_name;\n        return false;\n      }\n    }\n  } else if (file_name.empty()) {\n    Compress(fst, std::cout);\n  } else {\n    std::ofstream strm(file_name,\n                             std::ios_base::out | std::ios_base::binary);\n    if (!strm) {\n      LOG(ERROR) << \"Compress: Can't open file: \" << file_name;\n      return false;\n    }\n    Compress(fst, strm);\n  }\n  return true;\n}\n\ntemplate <class Arc>\nvoid Decompress(std::istream &strm, const string &source,\n                MutableFst<Arc> *fst) {\n  Compressor<Arc> comp;\n  comp.Decompress(strm, source, fst);\n}\n\n// Returns true on success.\ntemplate <class Arc>\nbool Decompress(const string &file_name, MutableFst<Arc> *fst,\n                const bool gzip = false) {\n  if (gzip) {\n    if (file_name.empty()) {\n      IGzFile gzfile(fileno(stdin));\n      Decompress(*gzfile.read(), \"stdin\", fst);\n      if (!gzfile) {\n        LOG(ERROR) << \"Decompress: Can't read from file: stdin\";\n        return false;\n      }\n    } else {\n      IGzFile gzfile(file_name);\n      if (!gzfile) {\n        LOG(ERROR) << \"Decompress: Can't open file: \" << file_name;\n        return false;\n      }\n      Decompress(*gzfile.read(), file_name, fst);\n      if (!gzfile) {\n        LOG(ERROR) << \"Decompress: Can't read from file: \" << file_name;\n        return false;\n      }\n    }\n  } else if (file_name.empty()) {\n    Decompress(std::cin, \"stdin\", fst);\n  } else {\n    std::ifstream strm(file_name,\n                            std::ios_base::in | std::ios_base::binary);\n    if (!strm) {\n      LOG(ERROR) << \"Decompress: Can't open file: \" << file_name;\n      return false;\n    }\n    Decompress(strm, file_name, fst);\n  }\n  return true;\n}\n\n}  // namespace fst\n\n#endif  // FST_EXTENSIONS_COMPRESS_COMPRESS_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/extensions/compress/elias.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Compresses and decompresses unweighted FSTs.\n\n#ifndef FST_EXTENSIONS_COMPRESS_ELIAS_H_\n#define FST_EXTENSIONS_COMPRESS_ELIAS_H_\n\n#include <stack>\n#include <vector>\n\n#include <fst/compat.h>\nnamespace fst {\n\ntemplate <class Var>\nclass Elias {\n public:\n  // Gamma encoding is a subroutine for Delta encoding\n  static void GammaEncode(const Var &input, std::vector<bool> *code);\n\n  // Elias Delta encoding for a single integer\n  static void DeltaEncode(const Var &input, std::vector<bool> *code);\n\n  // Batch decoding of a set of integers\n  static void BatchDecode(const std::vector<bool> &input,\n                          std::vector<Var> *output);\n};\n\ntemplate <class Var>\nvoid Elias<Var>::GammaEncode(const Var &input, std::vector<bool> *code) {\n  Var input_copy = input;\n  std::stack<bool> reverse_code;\n  while (input_copy > 0) {\n    reverse_code.push(input_copy % 2);\n    input_copy = input_copy / 2;\n  }\n  for (Var auxvar = 0; auxvar < reverse_code.size() - 1; auxvar++)\n    code->push_back(0);\n  while (reverse_code.empty() != 1) {\n    code->push_back(reverse_code.top());\n    reverse_code.pop();\n  }\n}\ntemplate <class Var>\nvoid Elias<Var>::DeltaEncode(const Var &input, std::vector<bool> *code) {\n  Var input_copy = input + 1;\n  std::stack<bool> reverse_remainder;\n  Var auxvar = 0;\n  while (input_copy != 0) {\n    reverse_remainder.push(input_copy % 2);\n    input_copy = input_copy / 2;\n    auxvar = auxvar + 1;\n  }\n  GammaEncode(auxvar, code);\n  reverse_remainder.pop();\n  while (reverse_remainder.empty() != 1) {\n    code->push_back(reverse_remainder.top());\n    reverse_remainder.pop();\n  }\n}\n\ntemplate <class Var>\nvoid Elias<Var>::BatchDecode(const std::vector<bool> &input,\n                             std::vector<Var> *output) {\n  Var lead_zeros = 0;\n  Var remainder_bits = 0;\n  Var current_word = 1;\n  Var value = 1;\n  std::vector<bool>::const_iterator it = input.begin();\n  while (it != input.end()) {\n    lead_zeros = 0;\n    remainder_bits = 0;\n    current_word = 1;\n    value = 1;\n    while (*it != 1) {\n      it++;\n      lead_zeros++;\n    }\n    it++;\n    while (lead_zeros > 0) {\n      lead_zeros--;\n      current_word = 2 * current_word + *it;\n      it++;\n    }\n    current_word--;\n    while (current_word > 0) {\n      value = 2 * value + *it;\n      current_word--;\n      it++;\n    }\n    output->push_back(value - 1);\n  }\n}\n\n}  // namespace fst\n\n#endif  // FST_EXTENSIONS_COMPRESS_ELIAS_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/extensions/compress/gzfile.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Resource handles for gzip files written to or read from stringstreams. These\n// are necessary to provide the compression routines with streams reading from\n// or writing to compressed files (or the UNIX standard streams), and are not\n// intended for general use.\n\n#ifndef FST_EXTENSIONS_COMPRESS_GZFILE_H_\n#define FST_EXTENSIONS_COMPRESS_GZFILE_H_\n\n#include <iostream>\n#include <memory>\n#include <sstream>\n#include <string>\n\n#include <fst/compat.h>\n#include <fst/fst.h>\n#include <zlib.h>\n\nusing std::stringstream;\nusing std::unique_ptr;\n\nnamespace fst {\n\n// Gives the zlib gzFile type an OO-like interface. String inputs are all\n// C-style strings. The caller is responsible to get the file modes appropriate\n// for the IO methods being called, and for opening the file descriptors\n// if that constructor is used. The ! operator can be used to check for errors\n// after construction or read/writing.\nclass GzFile {\n public:\n  GzFile(const char *filename, const char *mode)\n      : gzfile_(gzopen(filename, mode)), error_(check_handle()) {\n  }\n\n  // The caller is responsible to ensure the corresponding FD is open and has\n  // the needed modes (\"r\" for reading, \"w\" or \"a\" for writing).\n  explicit GzFile(const int fd, const char *mode)\n      : gzfile_(gzdopen(fd, mode)), error_(check_handle()), close_me_(false) {\n  }\n\n  // If the instance was constructed from an FD, flush the buffer; otherwise,\n  // close the file, which flushes the buffer as a side-effect.\n  ~GzFile() { close_me_ ? gzclose(gzfile_) : gzflush(gzfile_, Z_FINISH); }\n\n  inline bool operator!() const { return error_; }\n\n  // Returns false on EOF and sets error if short read does not reach an EOF.\n  int read(void *buf, unsigned int size) {\n    int bytes_read = gzread(gzfile_, buf, size);\n    if ((bytes_read < size) && !gzeof(gzfile_)) error_ = true;\n    return bytes_read;\n  }\n\n  // Sets error on short writes.\n  void write(const char *buf, unsigned int size) {\n    if (gzwrite(gzfile_, buf, size) != size) error_ = true;\n  }\n\n private:\n  // gzopen and gzdopen signal failure by returning null.\n  bool check_handle() { return gzfile_ == nullptr; }\n\n  gzFile gzfile_ = nullptr;\n  bool error_ = false;\n  bool close_me_ = false;\n};\n\n// Resource handle for writing stringstream to GzFile.\nclass OGzFile {\n public:\n  explicit OGzFile(const string &filename) : OGzFile(filename.c_str()) {}\n\n  explicit OGzFile(const char *filename) : gz_(GzFile(filename, mode_)) {}\n\n  explicit OGzFile(const int fd) : gz_(GzFile(fd, mode_)) {}\n\n  inline bool operator!() const { return !gz_; }\n\n  void write(const stringstream &ssbuf) {\n    string sbuf = ssbuf.str();\n    gz_.write(sbuf.data(), sbuf.size());\n  }\n\n private:\n  GzFile gz_;\n  static constexpr auto &mode_ = \"wb\";\n};\n\n// Resource handle for reading stringstream from GzFile.\nclass IGzFile {\n public:\n  explicit IGzFile(const string &filename) : IGzFile(filename.c_str()) {}\n\n  explicit IGzFile(const char *filename) : gz_(GzFile(filename, mode_)) {}\n\n  explicit IGzFile(const int fd) : gz_(GzFile(fd, mode_)) {}\n\n  inline bool operator!() const { return !gz_; }\n\n  // This is a great case for \"move\", but GCC 4 is missing the C+11 standard\n  // move constructor for stringstream, so a unique_ptr is the next best thing.\n  unique_ptr<stringstream> read() {\n    char buf[bufsize_];\n    unique_ptr<stringstream> sstrm(new stringstream);\n    // We always read at least once, and the result of the last read is always\n    // pushed onto the stringstream. We use the \"write\" member because << onto\n    // a stringstream stops at the null byte, which might be data!\n    int bytes_read;\n    while ((bytes_read = gz_.read(buf, bufsize_)) == bufsize_)\n      sstrm->write(buf, bufsize_);\n    sstrm->write(buf, bytes_read);\n    return sstrm;\n  }\n\n private:\n  GzFile gz_;\n  static constexpr auto &mode_ = \"rb\";\n  // This is the same size as the default internal buffer for zlib.\n  static const size_t bufsize_ = 8192;\n};\n\n}  // namespace fst\n\n#endif  // FST_EXTENSIONS_COMPRESS_GZFILE_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/extensions/compress/randmod.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Generates a random FST according to a class-specific transition model.\n\n#ifndef FST_EXTENSIONS_COMPRESS_RANDMOD_H_\n#define FST_EXTENSIONS_COMPRESS_RANDMOD_H_\n\n#include <vector>\n\n#include <fst/compat.h>\n#include <fst/mutable-fst.h>\n\nnamespace fst {\n\ntemplate <class Arc, class G>\nclass RandMod {\n public:\n  typedef typename Arc::StateId StateId;\n  typedef typename Arc::Label Label;\n  typedef typename Arc::Weight Weight;\n\n  // Generates random FST with 'nstates' with 'nclasses' in the probability\n  // generation model, and 'nlabels' in the alphabet. If 'trans' = true, then\n  // a transducer is generated; iff 'generate_' is non-null, the output is\n  // randomly weighted.\n  RandMod(StateId nstates, StateId nclasses, Label nlabels, bool trans,\n          const G *generate)\n      : nstates_(nstates),\n        nclasses_(nclasses),\n        nlabels_(nlabels),\n        trans_(trans),\n        generate_(generate) {\n    for (StateId s = 0; s < nstates; ++s) {\n      classes_.push_back(rand() % nclasses);  // NOLINT\n    }\n  }\n\n  // Generates a random FST according to a class-specific transition model\n  void Generate(StdMutableFst *fst) {\n    StateId start = rand() % nstates_;  // NOLINT\n    fst->DeleteStates();\n    for (StateId s = 0; s < nstates_; ++s) {\n      fst->AddState();\n      if (s == start) fst->SetStart(start);\n      for (StateId n = 0; n <= nstates_; ++n) {\n        Arc arc;\n        StateId d = n == nstates_ ? kNoStateId : n;\n        if (!RandArc(s, d, &arc)) continue;\n        if (d == kNoStateId) {  // A super-final transition?\n          fst->SetFinal(s, arc.weight);\n        } else {\n          fst->AddArc(s, arc);\n        }\n      }\n    }\n  }\n\n private:\n  // Generates a transition from s to d. If d == kNoStateId, a superfinal\n  // transition is generated. Returns false if no transition generated.\n  bool RandArc(StateId s, StateId d, Arc *arc) {\n    StateId sclass = classes_[s];\n    StateId dclass = d != kNoStateId ? classes_[d] : 0;\n\n    int r = sclass + dclass + 2;\n    if ((rand() % r) != 0)  // NOLINT\n      return false;\n\n    arc->nextstate = d;\n\n    Label ilabel = kNoLabel;\n    Label olabel = kNoLabel;\n    if (d != kNoStateId) {\n      ilabel = (dclass % nlabels_) + 1;\n      if (trans_)\n        olabel = (sclass % nlabels_) + 1;\n      else\n        olabel = ilabel;\n    }\n\n    Weight weight = Weight::One();\n    if (generate_) weight = (*generate_)();\n\n    arc->ilabel = ilabel;\n    arc->olabel = olabel;\n    arc->weight = weight;\n    return true;\n  }\n\n  StateId nstates_;\n  StateId nclasses_;\n  Label nlabels_;\n  bool trans_;\n  const G *generate_;\n  std::vector<StateId> classes_;\n};\n\n}  // namespace fst\n\n#endif  // FST_EXTENSIONS_COMPRESS_RANDMOD_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/extensions/far/compile-strings.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#ifndef FST_EXTENSIONS_FAR_COMPILE_STRINGS_H_\n#define FST_EXTENSIONS_FAR_COMPILE_STRINGS_H_\n\n#include <libgen.h>\n\n#include <fstream>\n#include <istream>\n#include <string>\n#include <vector>\n\n#include <fst/extensions/far/far.h>\n#include <fstream>\n#include <fst/string.h>\n\nnamespace fst {\n\n// Constructs a reader that provides FSTs from a file (stream) either on a\n// line-by-line basis or on a per-stream basis. Note that the freshly\n// constructed reader is already set to the first input.\n//\n// Sample usage:\n//\n//   for (StringReader<Arc> reader(...); !reader.Done(); reader.Next()) {\n//     auto *fst = reader.GetVectorFst();\n//   }\ntemplate <class Arc>\nclass StringReader {\n public:\n  using Label = typename Arc::Label;\n  using Weight = typename Arc::Weight;\n\n  enum EntryType { LINE = 1, FILE = 2 };\n\n  StringReader(std::istream &istrm, const string &source, EntryType entry_type,\n               StringTokenType token_type, bool allow_negative_labels,\n               const SymbolTable *syms = nullptr,\n               Label unknown_label = kNoStateId)\n      : nline_(0),\n        istrm_(istrm),\n        source_(source),\n        entry_type_(entry_type),\n        token_type_(token_type),\n        symbols_(syms),\n        done_(false),\n        compiler_(token_type, syms, unknown_label, allow_negative_labels) {\n    Next();  // Initialize the reader to the first input.\n  }\n\n  bool Done() { return done_; }\n\n  void Next() {\n    VLOG(1) << \"Processing source \" << source_ << \" at line \" << nline_;\n    if (!istrm_) {  // We're done if we have no more input.\n      done_ = true;\n      return;\n    }\n    if (entry_type_ == LINE) {\n      getline(istrm_, content_);\n      ++nline_;\n    } else {\n      content_.clear();\n      string line;\n      while (getline(istrm_, line)) {\n        ++nline_;\n        content_.append(line);\n        content_.append(\"\\n\");\n      }\n    }\n    if (!istrm_ && content_.empty())  // We're also done if we read off all the\n      done_ = true;                   // whitespace at the end of a file.\n  }\n\n  VectorFst<Arc> *GetVectorFst(bool keep_symbols = false) {\n    std::unique_ptr<VectorFst<Arc>> fst(new VectorFst<Arc>());\n    if (keep_symbols) {\n      fst->SetInputSymbols(symbols_);\n      fst->SetOutputSymbols(symbols_);\n    }\n    if (compiler_(content_, fst.get())) {\n      return fst.release();\n    } else {\n      return nullptr;\n    }\n  }\n\n  CompactStringFst<Arc> *GetCompactFst(bool keep_symbols = false) {\n    std::unique_ptr<CompactStringFst<Arc>> fst;\n    if (keep_symbols) {\n      VectorFst<Arc> tmp;\n      tmp.SetInputSymbols(symbols_);\n      tmp.SetOutputSymbols(symbols_);\n      fst.reset(new CompactStringFst<Arc>(tmp));\n    } else {\n      fst.reset(new CompactStringFst<Arc>());\n    }\n    if (compiler_(content_, fst.get())) {\n      return fst.release();\n    } else {\n      return nullptr;\n    }\n  }\n\n private:\n  size_t nline_;\n  std::istream &istrm_;\n  string source_;\n  EntryType entry_type_;\n  StringTokenType token_type_;\n  const SymbolTable *symbols_;\n  bool done_;\n  StringCompiler<Arc> compiler_;\n  string content_;  // The actual content of the input stream's next FST.\n\n  StringReader(const StringReader &) = delete;\n  StringReader &operator=(const StringReader &) = delete;\n};\n\n// Computes the minimal length required to encode each line number as a decimal\n// number.\nint KeySize(const char *filename);\n\ntemplate <class Arc>\nvoid FarCompileStrings(const std::vector<string> &in_fnames,\n                       const string &out_fname, const string &fst_type,\n                       const FarType &far_type, int32 generate_keys,\n                       FarEntryType fet, FarTokenType tt,\n                       const string &symbols_fname,\n                       const string &unknown_symbol, bool keep_symbols,\n                       bool initial_symbols, bool allow_negative_labels,\n                       const string &key_prefix, const string &key_suffix) {\n  typename StringReader<Arc>::EntryType entry_type;\n  if (fet == FET_LINE) {\n    entry_type = StringReader<Arc>::LINE;\n  } else if (fet == FET_FILE) {\n    entry_type = StringReader<Arc>::FILE;\n  } else {\n    FSTERROR() << \"FarCompileStrings: Unknown entry type\";\n    return;\n  }\n  StringTokenType token_type;\n  if (tt == FTT_SYMBOL) {\n    token_type = StringTokenType::SYMBOL;\n  } else if (tt == FTT_BYTE) {\n    token_type = StringTokenType::BYTE;\n  } else if (tt == FTT_UTF8) {\n    token_type = StringTokenType::UTF8;\n  } else {\n    FSTERROR() << \"FarCompileStrings: Unknown token type\";\n    return;\n  }\n  bool compact;\n  if (fst_type.empty() || (fst_type == \"vector\")) {\n    compact = false;\n  } else if (fst_type == \"compact\") {\n    compact = true;\n  } else {\n    FSTERROR() << \"FarCompileStrings: Unknown FST type: \" << fst_type;\n    return;\n  }\n  std::unique_ptr<const SymbolTable> syms;\n  typename Arc::Label unknown_label = kNoLabel;\n  if (!symbols_fname.empty()) {\n    const SymbolTableTextOptions opts(allow_negative_labels);\n    syms.reset(SymbolTable::ReadText(symbols_fname, opts));\n    if (!syms) {\n      LOG(ERROR) << \"FarCompileStrings: Error reading symbol table: \"\n                 << symbols_fname;\n      return;\n    }\n    if (!unknown_symbol.empty()) {\n      unknown_label = syms->Find(unknown_symbol);\n      if (unknown_label == kNoLabel) {\n        FSTERROR() << \"FarCompileStrings: Label \\\"\" << unknown_label\n                   << \"\\\" missing from symbol table: \" << symbols_fname;\n        return;\n      }\n    }\n  }\n  std::unique_ptr<FarWriter<Arc>> far_writer(\n      FarWriter<Arc>::Create(out_fname, far_type));\n  if (!far_writer) return;\n  int n = 0;\n  for (const auto &in_fname : in_fnames) {\n    if (generate_keys == 0 && in_fname.empty()) {\n      FSTERROR() << \"FarCompileStrings: Read from a file instead of stdin or\"\n                 << \" set the --generate_keys flags.\";\n      return;\n    }\n    int key_size =\n        generate_keys ? generate_keys : (entry_type == StringReader<Arc>::FILE\n                                             ? 1 : KeySize(in_fname.c_str()));\n    std::ifstream fstrm;\n    if (!in_fname.empty()) {\n      fstrm.open(in_fname);\n      if (!fstrm) {\n        FSTERROR() << \"FarCompileStrings: Can't open file: \" << in_fname;\n        return;\n      }\n    }\n    std::istream &istrm = fstrm.is_open() ? fstrm : std::cin;\n    bool keep_syms = keep_symbols;\n    for (StringReader<Arc> reader(\n             istrm, in_fname.empty() ? \"stdin\" : in_fname, entry_type,\n             token_type, allow_negative_labels, syms.get(), unknown_label);\n         !reader.Done(); reader.Next()) {\n      ++n;\n      std::unique_ptr<const Fst<Arc>> fst;\n      if (compact) {\n        fst.reset(reader.GetCompactFst(keep_syms));\n      } else {\n        fst.reset(reader.GetVectorFst(keep_syms));\n      }\n      if (initial_symbols) keep_syms = false;\n      if (!fst) {\n        FSTERROR() << \"FarCompileStrings: Compiling string number \" << n\n                   << \" in file \" << in_fname << \" failed with token_type = \"\n                   << (tt == FTT_BYTE\n                           ? \"byte\"\n                           : (tt == FTT_UTF8\n                                  ? \"utf8\"\n                                  : (tt == FTT_SYMBOL ? \"symbol\" : \"unknown\")))\n                   << \" and entry_type = \"\n                   << (fet == FET_LINE\n                           ? \"line\"\n                           : (fet == FET_FILE ? \"file\" : \"unknown\"));\n        return;\n      }\n      std::ostringstream keybuf;\n      keybuf.width(key_size);\n      keybuf.fill('0');\n      keybuf << n;\n      string key;\n      if (generate_keys > 0) {\n        key = keybuf.str();\n      } else {\n        auto *filename = new char[in_fname.size() + 1];\n        strcpy(filename, in_fname.c_str());\n        key = basename(filename);\n        if (entry_type != StringReader<Arc>::FILE) {\n          key += \"-\";\n          key += keybuf.str();\n        }\n        delete[] filename;\n      }\n      far_writer->Add(key_prefix + key + key_suffix, *fst);\n    }\n    if (generate_keys == 0) n = 0;\n  }\n}\n\n}  // namespace fst\n\n#endif  // FST_EXTENSIONS_FAR_COMPILE_STRINGS_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/extensions/far/create.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Creates a finite-state archive from component FSTs.\n\n#ifndef FST_EXTENSIONS_FAR_CREATE_H_\n#define FST_EXTENSIONS_FAR_CREATE_H_\n\n#include <libgen.h>\n#include <sstream>\n#include <string>\n#include <vector>\n\n#include <fst/extensions/far/far.h>\n\nnamespace fst {\n\ntemplate <class Arc>\nvoid FarCreate(const std::vector<string> &in_fnames, const string &out_fname,\n               const int32 generate_keys, const FarType &far_type,\n               const string &key_prefix, const string &key_suffix) {\n  std::unique_ptr<FarWriter<Arc>> far_writer(\n      FarWriter<Arc>::Create(out_fname, far_type));\n  if (!far_writer) return;\n  for (size_t i = 0; i < in_fnames.size(); ++i) {\n    std::unique_ptr<Fst<Arc>> ifst(Fst<Arc>::Read(in_fnames[i]));\n    if (!ifst) return;\n    string key;\n    if (generate_keys > 0) {\n      std::ostringstream keybuf;\n      keybuf.width(generate_keys);\n      keybuf.fill('0');\n      keybuf << i + 1;\n      key = keybuf.str();\n    } else {\n      auto *filename = new char[in_fnames[i].size() + 1];\n      strcpy(filename, in_fnames[i].c_str());\n      key = basename(filename);\n      delete[] filename;\n    }\n    far_writer->Add(key_prefix + key + key_suffix, *ifst);\n  }\n}\n\n}  // namespace fst\n\n#endif  // FST_EXTENSIONS_FAR_CREATE_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/extensions/far/equal.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#ifndef FST_EXTENSIONS_FAR_EQUAL_H_\n#define FST_EXTENSIONS_FAR_EQUAL_H_\n\n#include <memory>\n#include <string>\n\n#include <fst/extensions/far/far.h>\n#include <fst/equal.h>\n\nnamespace fst {\n\ntemplate <class Arc>\nbool FarEqual(const string &filename1, const string &filename2,\n              float delta = kDelta, const string &begin_key = string(),\n              const string &end_key = string()) {\n  std::unique_ptr<FarReader<Arc>> reader1(FarReader<Arc>::Open(filename1));\n  if (!reader1) {\n    LOG(ERROR) << \"FarEqual: Could not open FAR file \" << filename1;\n    return false;\n  }\n  std::unique_ptr<FarReader<Arc>> reader2(FarReader<Arc>::Open(filename2));\n  if (!reader2) {\n    LOG(ERROR) << \"FarEqual: Could not open FAR file \" << filename2;\n    return false;\n  }\n  if (!begin_key.empty()) {\n    bool find_begin1 = reader1->Find(begin_key);\n    bool find_begin2 = reader2->Find(begin_key);\n    if (!find_begin1 || !find_begin2) {\n      bool ret = !find_begin1 && !find_begin2;\n      if (!ret) {\n        LOG(ERROR) << \"FarEqual: Key \" << begin_key << \" missing from \"\n                   << (find_begin1 ? \"second\" : \"first\") << \" archive\";\n      }\n      return ret;\n    }\n  }\n  for (; !reader1->Done() && !reader2->Done();\n       reader1->Next(), reader2->Next()) {\n    const auto &key1 = reader1->GetKey();\n    const auto &key2 = reader2->GetKey();\n    if (!end_key.empty() && end_key < key1 && end_key < key2) {\n      return true;\n    }\n    if (key1 != key2) {\n      LOG(ERROR) << \"FarEqual: Mismatched keys \" << key1 << \" and \" << key2;\n      return false;\n    }\n    if (!Equal(*(reader1->GetFst()), *(reader2->GetFst()), delta)) {\n      LOG(ERROR) << \"FarEqual: FSTs for key \" << key1 << \" are not equal\";\n      return false;\n    }\n  }\n  if (!reader1->Done() || !reader2->Done()) {\n    LOG(ERROR) << \"FarEqual: Key \"\n               << (reader1->Done() ? reader2->GetKey() : reader1->GetKey())\n               << \" missing from \" << (reader2->Done() ? \"first\" : \"second\")\n               << \" archive\";\n    return false;\n  }\n  return true;\n}\n\n}  // namespace fst\n\n#endif  // FST_EXTENSIONS_FAR_EQUAL_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/extensions/far/extract.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Extracts component FSTs from an finite-state archive.\n\n#ifndef FST_EXTENSIONS_FAR_EXTRACT_H_\n#define FST_EXTENSIONS_FAR_EXTRACT_H_\n\n#include <memory>\n#include <string>\n#include <vector>\n\n#include <fst/extensions/far/far.h>\n\nnamespace fst {\n\ntemplate <class Arc>\ninline void FarWriteFst(const Fst<Arc> *fst, string key, string *okey,\n                        int *nrep, int32 generate_filenames, int i,\n                        const string &filename_prefix,\n                        const string &filename_suffix) {\n  if (key == *okey) {\n    ++*nrep;\n  } else {\n    *nrep = 0;\n  }\n  *okey = key;\n  string ofilename;\n  if (generate_filenames) {\n    std::ostringstream tmp;\n    tmp.width(generate_filenames);\n    tmp.fill('0');\n    tmp << i;\n    ofilename = tmp.str();\n  } else {\n    if (*nrep > 0) {\n      std::ostringstream tmp;\n      tmp << '.' << nrep;\n      key.append(tmp.str().data(), tmp.str().size());\n    }\n    ofilename = key;\n  }\n  fst->Write(filename_prefix + ofilename + filename_suffix);\n}\n\ntemplate <class Arc>\nvoid FarExtract(const std::vector<string> &ifilenames, int32 generate_filenames,\n                const string &keys, const string &key_separator,\n                const string &range_delimiter, const string &filename_prefix,\n                const string &filename_suffix) {\n  std::unique_ptr<FarReader<Arc>> far_reader(\n      FarReader<Arc>::Open(ifilenames));\n  if (!far_reader) return;\n  string okey;\n  int nrep = 0;\n  std::vector<char *> key_vector;\n  // User has specified a set of FSTs to extract, where some of these may in\n  // fact be ranges.\n  if (!keys.empty()) {\n    auto *keys_cstr = new char[keys.size() + 1];\n    strcpy(keys_cstr, keys.c_str());\n    SplitString(keys_cstr, key_separator.c_str(), &key_vector, true);\n    int i = 0;\n    for (size_t k = 0; k < key_vector.size(); ++k, ++i) {\n      string key = key_vector[k];\n      auto *key_cstr = new char[key.size() + 1];\n      strcpy(key_cstr, key.c_str());\n      std::vector<char *> range_vector;\n      SplitString(key_cstr, range_delimiter.c_str(), &range_vector, false);\n      if (range_vector.size() == 1) {  // Not a range\n        if (!far_reader->Find(key)) {\n          LOG(ERROR) << \"FarExtract: Cannot find key \" << key;\n          return;\n        }\n        const auto *fst = far_reader->GetFst();\n        FarWriteFst(fst, key, &okey, &nrep, generate_filenames, i,\n                    filename_prefix, filename_suffix);\n      } else if (range_vector.size() == 2) {  // A legal range\n        string begin_key = range_vector[0];\n        string end_key = range_vector[1];\n        if (begin_key.empty() || end_key.empty()) {\n          LOG(ERROR) << \"FarExtract: Illegal range specification \" << key;\n          return;\n        }\n        if (!far_reader->Find(begin_key)) {\n          LOG(ERROR) << \"FarExtract: Cannot find key \" << begin_key;\n          return;\n        }\n        for (; !far_reader->Done(); far_reader->Next(), ++i) {\n          const auto &ikey = far_reader->GetKey();\n          if (end_key < ikey) break;\n          const auto *fst = far_reader->GetFst();\n          FarWriteFst(fst, ikey, &okey, &nrep, generate_filenames, i,\n                      filename_prefix, filename_suffix);\n        }\n      } else {\n        LOG(ERROR) << \"FarExtract: Illegal range specification \" << key;\n        return;\n      }\n      delete[] key_cstr;\n    }\n    delete[] keys_cstr;\n    return;\n  }\n  // Nothing specified, so just extracts everything.\n  for (size_t i = 1; !far_reader->Done(); far_reader->Next(), ++i) {\n    const auto &key = far_reader->GetKey();\n    const auto *fst = far_reader->GetFst();\n    FarWriteFst(fst, key, &okey, &nrep, generate_filenames, i, filename_prefix,\n                filename_suffix);\n  }\n  return;\n}\n\n}  // namespace fst\n\n#endif  // FST_EXTENSIONS_FAR_EXTRACT_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/extensions/far/far-class.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Scripting API support for FarReader and FarWriter.\n\n#ifndef FST_EXTENSIONS_FAR_FAR_CLASS_H_\n#define FST_EXTENSIONS_FAR_FAR_CLASS_H_\n\n#include <memory>\n#include <string>\n#include <vector>\n\n#include <fst/script/arg-packs.h>\n#include <fst/script/fstscript.h>\n#include <fst/extensions/far/far.h>\n\n\nnamespace fst {\nnamespace script {\n\n\n// FarReader API.\n\n// Virtual interface implemented by each concrete FarReaderImpl<A>.\n// See the FarReader interface in far.h for the exact semantics.\nclass FarReaderImplBase {\n public:\n  virtual const string &ArcType() const = 0;\n  virtual bool Done() const = 0;\n  virtual bool Error() const = 0;\n  virtual const string &GetKey() const = 0;\n  virtual const FstClass *GetFstClass() const = 0;\n  virtual bool Find(const string &key) = 0;\n  virtual void Next() = 0;\n  virtual void Reset() = 0;\n  virtual FarType Type() const = 0;\n  virtual ~FarReaderImplBase() {}\n};\n\n// Templated implementation.\ntemplate <class Arc>\nclass FarReaderClassImpl : public FarReaderImplBase {\n public:\n  explicit FarReaderClassImpl(const string &filename)\n      : impl_(FarReader<Arc>::Open(filename)) {}\n\n  explicit FarReaderClassImpl(const std::vector<string> &filenames)\n      : impl_(FarReader<Arc>::Open(filenames)) {}\n\n  const string &ArcType() const final { return Arc::Type(); }\n\n  bool Done() const final { return impl_->Done(); }\n\n  bool Error() const final { return impl_->Error(); }\n\n  bool Find(const string &key) final { return impl_->Find(key); }\n\n  const FstClass *GetFstClass() const final {\n    fstc_.reset(new FstClass(*impl_->GetFst()));\n    return fstc_.get();\n  }\n\n  const string &GetKey() const final { return impl_->GetKey(); }\n\n  void Next() final { return impl_->Next(); }\n\n  void Reset() final { impl_->Reset(); }\n\n  FarType Type() const final { return impl_->Type(); }\n\n  const FarReader<Arc> *GetImpl() const { return impl_.get(); }\n\n  FarReader<Arc> *GetImpl() { return impl_.get(); }\n\n private:\n  std::unique_ptr<FarReader<Arc>> impl_;\n  mutable std::unique_ptr<FstClass> fstc_;\n};\n\n\nclass FarReaderClass;\n\nusing OpenFarReaderClassArgs1 =\n    WithReturnValue<FarReaderClass *, const string &>;\n\nusing OpenFarReaderClassArgs2 =\n    WithReturnValue<FarReaderClass *, const std::vector<string> &>;\n\n// Untemplated user-facing class holding a templated pimpl.\nclass FarReaderClass {\n public:\n  const string &ArcType() const { return impl_->ArcType(); }\n\n  bool Done() const { return impl_->Done(); }\n\n  // Returns True if the impl is null (i.e., due to read failure).\n  // Attempting to call any other function will result in null dereference.\n  bool Error() const { return (impl_) ? impl_->Error() : true; }\n\n  bool Find(const string &key) { return impl_->Find(key); }\n\n  const FstClass *GetFstClass() const { return impl_->GetFstClass(); }\n\n  const string &GetKey() const { return impl_->GetKey(); }\n\n  void Next() { impl_->Next(); }\n\n  void Reset() { impl_->Reset(); }\n\n  FarType Type() const { return impl_->Type(); }\n\n  template <class Arc>\n  const FarReader<Arc> *GetFarReader() const {\n    if (Arc::Type() != ArcType()) return nullptr;\n    const FarReaderClassImpl<Arc> *typed_impl =\n        static_cast<FarReaderClassImpl<Arc> *>(impl_.get());\n    return typed_impl->GetImpl();\n  }\n\n  template <class Arc>\n  FarReader<Arc> *GetFarReader() {\n    if (Arc::Type() != ArcType()) return nullptr;\n    FarReaderClassImpl<Arc> *typed_impl =\n        static_cast<FarReaderClassImpl<Arc> *>(impl_.get());\n    return typed_impl->GetImpl();\n  }\n\n  template <class Arc>\n  friend void OpenFarReaderClass(OpenFarReaderClassArgs1 *args);\n\n  template <class Arc>\n  friend void OpenFarReaderClass(OpenFarReaderClassArgs2 *args);\n\n  // Defined in the CC.\n\n  static FarReaderClass *Open(const string &filename);\n\n  static FarReaderClass *Open(const std::vector<string> &filenames);\n\n private:\n  template <class Arc>\n  explicit FarReaderClass(FarReaderClassImpl<Arc> *impl) : impl_(impl) {}\n\n  std::unique_ptr<FarReaderImplBase> impl_;\n};\n\n// These exist solely for registration purposes; users should call the\n// static method FarReaderClass::Open instead.\n\ntemplate <class Arc>\nvoid OpenFarReaderClass(OpenFarReaderClassArgs1 *args) {\n  args->retval = new FarReaderClass(new FarReaderClassImpl<Arc>(args->args));\n}\n\ntemplate <class Arc>\nvoid OpenFarReaderClass(OpenFarReaderClassArgs2 *args) {\n  args->retval = new FarReaderClass(new FarReaderClassImpl<Arc>(args->args));\n}\n\n// FarWriter API.\n\n// Virtual interface implemented by each concrete FarWriterImpl<A>.\nclass FarWriterImplBase {\n public:\n  // Unlike the lower-level library, this returns a boolean to signal failure\n  // due to non-conformant arc types.\n  virtual bool Add(const string &key, const FstClass &fst) = 0;\n  virtual const string &ArcType() const = 0;\n  virtual bool Error() const = 0;\n  virtual FarType Type() const = 0;\n  virtual ~FarWriterImplBase() {}\n};\n\n\n// Templated implementation.\ntemplate <class Arc>\nclass FarWriterClassImpl : public FarWriterImplBase {\n public:\n  explicit FarWriterClassImpl(const string &filename,\n                              FarType type = FAR_DEFAULT)\n      : impl_(FarWriter<Arc>::Create(filename, type)) {}\n\n  bool Add(const string &key, const FstClass &fst) final {\n    if (ArcType() != fst.ArcType()) {\n      FSTERROR() << \"Cannot write FST with \" << fst.ArcType() << \" arcs to \"\n                 << \"FAR with \" << ArcType() << \" arcs\";\n      return false;\n    }\n    impl_->Add(key, *(fst.GetFst<Arc>()));\n    return true;\n  }\n\n  const string &ArcType() const final { return Arc::Type(); }\n\n  bool Error() const final { return impl_->Error(); }\n\n  FarType Type() const final { return impl_->Type(); }\n\n  const FarWriter<Arc> *GetImpl() const { return impl_.get(); }\n\n  FarWriter<Arc> *GetImpl() { return impl_.get(); }\n\n private:\n  std::unique_ptr<FarWriter<Arc>> impl_;\n};\n\n\nclass FarWriterClass;\n\nusing CreateFarWriterClassInnerArgs = std::pair<const string &, FarType>;\n\nusing CreateFarWriterClassArgs =\n    WithReturnValue<FarWriterClass *, CreateFarWriterClassInnerArgs>;\n\n// Untemplated user-facing class holding a templated pimpl.\nclass FarWriterClass {\n public:\n  static FarWriterClass *Create(const string &filename, const string &arc_type,\n                                FarType type = FAR_DEFAULT);\n\n  bool Add(const string &key, const FstClass &fst) {\n    return impl_->Add(key, fst);\n  }\n\n  // Returns True if the impl is null (i.e., due to construction failure).\n  // Attempting to call any other function will result in null dereference.\n  bool Error() const { return (impl_) ? impl_->Error() : true; }\n\n  const string &ArcType() const { return impl_->ArcType(); }\n\n  FarType Type() const { return impl_->Type(); }\n\n  template <class Arc>\n  const FarWriter<Arc> *GetFarWriter() const {\n    if (Arc::Type() != ArcType()) return nullptr;\n    const FarWriterClassImpl<Arc> *typed_impl =\n        static_cast<FarWriterClassImpl<Arc> *>(impl_.get());\n    return typed_impl->GetImpl();\n  }\n\n  template <class Arc>\n  FarWriter<Arc> *GetFarWriter() {\n    if (Arc::Type() != ArcType()) return nullptr;\n    FarWriterClassImpl<Arc> *typed_impl =\n        static_cast<FarWriterClassImpl<Arc> *>(impl_.get());\n    return typed_impl->GetImpl();\n  }\n\n  template <class Arc>\n  friend void CreateFarWriterClass(CreateFarWriterClassArgs *args);\n\n private:\n  template <class Arc>\n  explicit FarWriterClass(FarWriterClassImpl<Arc> *impl) : impl_(impl) {}\n\n  std::unique_ptr<FarWriterImplBase> impl_;\n};\n\n// This exists solely for registration purposes; users should call the\n// static method FarWriterClass::Create instead.\ntemplate <class Arc>\nvoid CreateFarWriterClass(CreateFarWriterClassArgs *args) {\n  args->retval = new FarWriterClass(new FarWriterClassImpl<Arc>(\n      std::get<0>(args->args), std::get<1>(args->args)));\n}\n\n}  // namespace script\n}  // namespace fst\n\n#endif  // FST_EXTENSIONS_FAR_FAR_CLASS_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/extensions/far/far.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Finite-State Transducer (FST) archive classes.\n\n#ifndef FST_EXTENSIONS_FAR_FAR_H_\n#define FST_EXTENSIONS_FAR_FAR_H_\n\n#include <iostream>\n#include <sstream>\n\n#include <fst/log.h>\n#include <fst/extensions/far/stlist.h>\n#include <fst/extensions/far/sttable.h>\n#include <fst/fst.h>\n#include <fst/vector-fst.h>\n#include <fstream>\n\nnamespace fst {\n\nenum FarEntryType { FET_LINE, FET_FILE };\n\nenum FarTokenType { FTT_SYMBOL, FTT_BYTE, FTT_UTF8 };\n\ninline bool IsFst(const string &filename) {\n  std::ifstream strm(filename, std::ios_base::in | std::ios_base::binary);\n  if (!strm) return false;\n  return IsFstHeader(strm, filename);\n}\n\n// FST archive header class\nclass FarHeader {\n public:\n  const string &ArcType() const { return arctype_; }\n\n  const string &FarType() const { return fartype_; }\n\n  bool Read(const string &filename) {\n    FstHeader fsthdr;\n    if (filename.empty()) {\n      // Header reading unsupported on stdin. Assumes STList and StdArc.\n      fartype_ = \"stlist\";\n      arctype_ = \"standard\";\n      return true;\n    } else if (IsSTTable(filename)) {  // Checks if STTable.\n      ReadSTTableHeader(filename, &fsthdr);\n      fartype_ = \"sttable\";\n      arctype_ = fsthdr.ArcType().empty() ? \"unknown\" : fsthdr.ArcType();\n      return true;\n    } else if (IsSTList(filename)) {  // Checks if STList.\n      ReadSTListHeader(filename, &fsthdr);\n      fartype_ = \"stlist\";\n      arctype_ = fsthdr.ArcType().empty() ? \"unknown\" : fsthdr.ArcType();\n      return true;\n    } else if (IsFst(filename)) {  // Checks if FST.\n      std::ifstream istrm(filename,\n                               std::ios_base::in | std::ios_base::binary);\n      fsthdr.Read(istrm, filename);\n      fartype_ = \"fst\";\n      arctype_ = fsthdr.ArcType().empty() ? \"unknown\" : fsthdr.ArcType();\n      return true;\n    }\n    return false;\n  }\n\n private:\n  string fartype_;\n  string arctype_;\n};\n\nenum FarType {\n  FAR_DEFAULT = 0,\n  FAR_STTABLE = 1,\n  FAR_STLIST = 2,\n  FAR_FST = 3,\n};\n\n// This class creates an archive of FSTs.\ntemplate <class A>\nclass FarWriter {\n public:\n  using Arc = A;\n\n  // Creates a new (empty) FST archive; returns null on error.\n  static FarWriter *Create(const string &filename, FarType type = FAR_DEFAULT);\n\n  // Adds an FST to the end of an archive. Keys must be non-empty and\n  // in lexicographic order. FSTs must have a suitable write method.\n  virtual void Add(const string &key, const Fst<Arc> &fst) = 0;\n\n  virtual FarType Type() const = 0;\n\n  virtual bool Error() const = 0;\n\n  virtual ~FarWriter() {}\n\n protected:\n  FarWriter() {}\n};\n\n// This class iterates through an existing archive of FSTs.\ntemplate <class A>\nclass FarReader {\n public:\n  using Arc = A;\n\n  // Opens an existing FST archive in a single file; returns null on error.\n  // Sets current position to the beginning of the achive.\n  static FarReader *Open(const string &filename);\n\n  // Opens an existing FST archive in multiple files; returns null on error.\n  // Sets current position to the beginning of the achive.\n  static FarReader *Open(const std::vector<string> &filenames);\n\n  // Resets current position to beginning of archive.\n  virtual void Reset() = 0;\n\n  // Sets current position to first entry >= key.  Returns true if a match.\n  virtual bool Find(const string &key) = 0;\n\n  // Current position at end of archive?\n  virtual bool Done() const = 0;\n\n  // Move current position to next FST.\n  virtual void Next() = 0;\n\n  // Returns key at the current position. This reference is invalidated if\n  // the current position in the archive is changed.\n  virtual const string &GetKey() const = 0;\n\n  // Returns pointer to FST at the current position. This is invalidated if\n  // the current position in the archive is changed.\n  virtual const Fst<Arc> *GetFst() const = 0;\n\n  virtual FarType Type() const = 0;\n\n  virtual bool Error() const = 0;\n\n  virtual ~FarReader() {}\n\n protected:\n  FarReader() {}\n};\n\ntemplate <class Arc>\nclass FstWriter {\n public:\n  void operator()(std::ostream &strm, const Fst<Arc> &fst) const {\n    fst.Write(strm, FstWriteOptions());\n  }\n};\n\ntemplate <class A>\nclass STTableFarWriter : public FarWriter<A> {\n public:\n  using Arc = A;\n\n  static STTableFarWriter *Create(const string &filename) {\n    auto *writer = STTableWriter<Fst<Arc>, FstWriter<Arc>>::Create(filename);\n    return new STTableFarWriter(writer);\n  }\n\n  void Add(const string &key, const Fst<Arc> &fst) final {\n    writer_->Add(key, fst);\n  }\n\n  FarType Type() const final { return FAR_STTABLE; }\n\n  bool Error() const final { return writer_->Error(); }\n\n private:\n  explicit STTableFarWriter(STTableWriter<Fst<Arc>, FstWriter<Arc>> *writer)\n      : writer_(writer) {}\n\n  std::unique_ptr<STTableWriter<Fst<Arc>, FstWriter<Arc>>> writer_;\n};\n\ntemplate <class A>\nclass STListFarWriter : public FarWriter<A> {\n public:\n  using Arc = A;\n\n  static STListFarWriter *Create(const string &filename) {\n    auto *writer = STListWriter<Fst<Arc>, FstWriter<Arc>>::Create(filename);\n    return new STListFarWriter(writer);\n  }\n\n  void Add(const string &key, const Fst<Arc> &fst) final {\n    writer_->Add(key, fst);\n  }\n\n  constexpr FarType Type() const final { return FAR_STLIST; }\n\n  bool Error() const final { return writer_->Error(); }\n\n private:\n  explicit STListFarWriter(STListWriter<Fst<Arc>, FstWriter<Arc>> *writer)\n      : writer_(writer) {}\n\n  std::unique_ptr<STListWriter<Fst<Arc>, FstWriter<Arc>>> writer_;\n};\n\ntemplate <class A>\nclass FstFarWriter : public FarWriter<A> {\n public:\n  using Arc = A;\n\n  explicit FstFarWriter(const string &filename)\n      : filename_(filename), error_(false), written_(false) {}\n\n  static FstFarWriter *Create(const string &filename) {\n    return new FstFarWriter(filename);\n  }\n\n  void Add(const string &key, const Fst<A> &fst) final {\n    if (written_) {\n      LOG(WARNING) << \"FstFarWriter::Add: only one FST supported,\"\n                   << \" subsequent entries discarded.\";\n    } else {\n      error_ = !fst.Write(filename_);\n      written_ = true;\n    }\n  }\n\n  constexpr FarType Type() const final { return FAR_FST; }\n\n  bool Error() const final { return error_; }\n\n  ~FstFarWriter() final {}\n\n private:\n  string filename_;\n  bool error_;\n  bool written_;\n};\n\ntemplate <class Arc>\nFarWriter<Arc> *FarWriter<Arc>::Create(const string &filename, FarType type) {\n  switch (type) {\n    case FAR_DEFAULT:\n      if (filename.empty()) return STListFarWriter<Arc>::Create(filename);\n    case FAR_STTABLE:\n      return STTableFarWriter<Arc>::Create(filename);\n    case FAR_STLIST:\n      return STListFarWriter<Arc>::Create(filename);\n    case FAR_FST:\n      return FstFarWriter<Arc>::Create(filename);\n    default:\n      LOG(ERROR) << \"FarWriter::Create: Unknown FAR type\";\n      return nullptr;\n  }\n}\n\ntemplate <class Arc>\nclass FstReader {\n public:\n  Fst<Arc> *operator()(std::istream &strm) const {\n    return Fst<Arc>::Read(strm, FstReadOptions());\n  }\n};\n\ntemplate <class A>\nclass STTableFarReader : public FarReader<A> {\n public:\n  using Arc = A;\n\n  static STTableFarReader *Open(const string &filename) {\n    auto *reader = STTableReader<Fst<Arc>, FstReader<Arc>>::Open(filename);\n    if (!reader || reader->Error()) return nullptr;\n    return new STTableFarReader(reader);\n  }\n\n  static STTableFarReader *Open(const std::vector<string> &filenames) {\n    auto *reader = STTableReader<Fst<Arc>, FstReader<Arc>>::Open(filenames);\n    if (!reader || reader->Error()) return nullptr;\n    return new STTableFarReader(reader);\n  }\n\n  void Reset() final { reader_->Reset(); }\n\n  bool Find(const string &key) final { return reader_->Find(key); }\n\n  bool Done() const final { return reader_->Done(); }\n\n  void Next() final { return reader_->Next(); }\n\n  const string &GetKey() const final { return reader_->GetKey(); }\n\n  const Fst<Arc> *GetFst() const final { return reader_->GetEntry(); }\n\n  constexpr FarType Type() const final { return FAR_STTABLE; }\n\n  bool Error() const final { return reader_->Error(); }\n\n private:\n  explicit STTableFarReader(STTableReader<Fst<Arc>, FstReader<Arc>> *reader)\n      : reader_(reader) {}\n\n  std::unique_ptr<STTableReader<Fst<Arc>, FstReader<Arc>>> reader_;\n};\n\ntemplate <class A>\nclass STListFarReader : public FarReader<A> {\n public:\n  using Arc = A;\n\n  static STListFarReader *Open(const string &filename) {\n    auto *reader = STListReader<Fst<Arc>, FstReader<Arc>>::Open(filename);\n    if (!reader || reader->Error()) return nullptr;\n    return new STListFarReader(reader);\n  }\n\n  static STListFarReader *Open(const std::vector<string> &filenames) {\n    auto *reader = STListReader<Fst<Arc>, FstReader<Arc>>::Open(filenames);\n    if (!reader || reader->Error()) return nullptr;\n    return new STListFarReader(reader);\n  }\n\n  void Reset() final { reader_->Reset(); }\n\n  bool Find(const string &key) final { return reader_->Find(key); }\n\n  bool Done() const final { return reader_->Done(); }\n\n  void Next() final { return reader_->Next(); }\n\n  const string &GetKey() const final { return reader_->GetKey(); }\n\n  const Fst<Arc> *GetFst() const final { return reader_->GetEntry(); }\n\n  constexpr FarType Type() const final { return FAR_STLIST; }\n\n  bool Error() const final { return reader_->Error(); }\n\n private:\n  explicit STListFarReader(STListReader<Fst<Arc>, FstReader<Arc>> *reader)\n      : reader_(reader) {}\n\n  std::unique_ptr<STListReader<Fst<Arc>, FstReader<Arc>>> reader_;\n};\n\ntemplate <class A>\nclass FstFarReader : public FarReader<A> {\n public:\n  using Arc = A;\n\n  static FstFarReader *Open(const string &filename) {\n    std::vector<string> filenames;\n    filenames.push_back(filename);\n    return new FstFarReader<Arc>(filenames);\n  }\n\n  static FstFarReader *Open(const std::vector<string> &filenames) {\n    return new FstFarReader<Arc>(filenames);\n  }\n\n  explicit FstFarReader(const std::vector<string> &filenames)\n      : keys_(filenames), has_stdin_(false), pos_(0), error_(false) {\n    std::sort(keys_.begin(), keys_.end());\n    streams_.resize(keys_.size(), 0);\n    for (size_t i = 0; i < keys_.size(); ++i) {\n      if (keys_[i].empty()) {\n        if (!has_stdin_) {\n          streams_[i] = &std::cin;\n          // sources_[i] = \"stdin\";\n          has_stdin_ = true;\n        } else {\n          FSTERROR() << \"FstFarReader::FstFarReader: standard input should \"\n                        \"only appear once in the input file list\";\n          error_ = true;\n          return;\n        }\n      } else {\n        streams_[i] = new std::ifstream(\n            keys_[i], std::ios_base::in | std::ios_base::binary);\n      }\n    }\n    if (pos_ >= keys_.size()) return;\n    ReadFst();\n  }\n\n  void Reset() final {\n    if (has_stdin_) {\n      FSTERROR()\n          << \"FstFarReader::Reset: Operation not supported on standard input\";\n      error_ = true;\n      return;\n    }\n    pos_ = 0;\n    ReadFst();\n  }\n\n  bool Find(const string &key) final {\n    if (has_stdin_) {\n      FSTERROR()\n          << \"FstFarReader::Find: Operation not supported on standard input\";\n      error_ = true;\n      return false;\n    }\n    pos_ = 0;  // TODO\n    ReadFst();\n    return true;\n  }\n\n  bool Done() const final { return error_ || pos_ >= keys_.size(); }\n\n  void Next() final {\n    ++pos_;\n    ReadFst();\n  }\n\n  const string &GetKey() const final { return keys_[pos_]; }\n\n  const Fst<Arc> *GetFst() const final { return fst_.get(); }\n\n  constexpr FarType Type() const final { return FAR_FST; }\n\n  bool Error() const final { return error_; }\n\n  ~FstFarReader() final {\n    for (size_t i = 0; i < keys_.size(); ++i) {\n      if (streams_[i] != &std::cin) {\n        delete streams_[i];\n      }\n    }\n  }\n\n private:\n  void ReadFst() {\n    fst_.reset();\n    if (pos_ >= keys_.size()) return;\n    streams_[pos_]->seekg(0);\n    fst_.reset(Fst<Arc>::Read(*streams_[pos_], FstReadOptions()));\n    if (!fst_) {\n      FSTERROR() << \"FstFarReader: Error reading Fst from: \" << keys_[pos_];\n      error_ = true;\n    }\n  }\n\n  std::vector<string> keys_;\n  std::vector<std::istream *> streams_;\n  bool has_stdin_;\n  size_t pos_;\n  mutable std::unique_ptr<Fst<Arc>> fst_;\n  mutable bool error_;\n};\n\ntemplate <class Arc>\nFarReader<Arc> *FarReader<Arc>::Open(const string &filename) {\n  if (filename.empty())\n    return STListFarReader<Arc>::Open(filename);\n  else if (IsSTTable(filename))\n    return STTableFarReader<Arc>::Open(filename);\n  else if (IsSTList(filename))\n    return STListFarReader<Arc>::Open(filename);\n  else if (IsFst(filename))\n    return FstFarReader<Arc>::Open(filename);\n  return nullptr;\n}\n\ntemplate <class Arc>\nFarReader<Arc> *FarReader<Arc>::Open(const std::vector<string> &filenames) {\n  if (!filenames.empty() && filenames[0].empty())\n    return STListFarReader<Arc>::Open(filenames);\n  else if (!filenames.empty() && IsSTTable(filenames[0]))\n    return STTableFarReader<Arc>::Open(filenames);\n  else if (!filenames.empty() && IsSTList(filenames[0]))\n    return STListFarReader<Arc>::Open(filenames);\n  else if (!filenames.empty() && IsFst(filenames[0]))\n    return FstFarReader<Arc>::Open(filenames);\n  return nullptr;\n}\n\n}  // namespace fst\n\n#endif  // FST_EXTENSIONS_FAR_FAR_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/extensions/far/farlib.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// A finite-state archive (FAR) is used to store an indexable collection of\n// FSTs in a single file. Utilities are provided to create FARs from FSTs,\n// to iterate over FARs, and to extract specific FSTs from FARs.\n\n#ifndef FST_EXTENSIONS_FAR_FARLIB_H_\n#define FST_EXTENSIONS_FAR_FARLIB_H_\n\n#include <fst/extensions/far/compile-strings.h>\n#include <fst/extensions/far/create.h>\n#include <fst/extensions/far/extract.h>\n#include <fst/extensions/far/far.h>\n#include <fst/extensions/far/getters.h>\n#include <fst/extensions/far/info.h>\n#include <fst/extensions/far/print-strings.h>\n\n#endif  // FST_EXTENSIONS_FAR_FARLIB_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/extensions/far/farscript.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Convenience file for including all of the FAR operations, or registering\n// them for new arc types.\n\n#ifndef FST_EXTENSIONS_FAR_FARSCRIPT_H_\n#define FST_EXTENSIONS_FAR_FARSCRIPT_H_\n\n#include <string>\n#include <vector>\n\n#include <fst/types.h>\n#include <fst/extensions/far/compile-strings.h>\n#include <fst/extensions/far/create.h>\n#include <fst/extensions/far/equal.h>\n#include <fst/extensions/far/extract.h>\n#include <fst/extensions/far/far.h>\n#include <fst/extensions/far/far-class.h>\n#include <fst/extensions/far/info.h>\n#include <fst/extensions/far/isomorphic.h>\n#include <fst/extensions/far/print-strings.h>\n#include <fst/extensions/far/script-impl.h>\n#include <fst/script/arg-packs.h>\n\nnamespace fst {\nnamespace script {\n\n// Note: it is safe to pass these strings as references because this struct is\n// only used to pass them deeper in the call graph. Be sure you understand why\n// this is so before using this struct for anything else!\nstruct FarCompileStringsArgs {\n  const std::vector<string> &in_fnames;\n  const string &out_fname;\n  const string &fst_type;\n  const FarType &far_type;\n  const int32 generate_keys;\n  const FarEntryType fet;\n  const FarTokenType tt;\n  const string &symbols_fname;\n  const string &unknown_symbol;\n  const bool keep_symbols;\n  const bool initial_symbols;\n  const bool allow_negative_labels;\n  const string &key_prefix;\n  const string &key_suffix;\n\n  FarCompileStringsArgs(const std::vector<string> &in_fnames,\n                        const string &out_fname, const string &fst_type,\n                        const FarType &far_type, int32 generate_keys,\n                        FarEntryType fet, FarTokenType tt,\n                        const string &symbols_fname,\n                        const string &unknown_symbol, bool keep_symbols,\n                        bool initial_symbols, bool allow_negative_labels,\n                        const string &key_prefix, const string &key_suffix)\n      : in_fnames(in_fnames),\n        out_fname(out_fname),\n        fst_type(fst_type),\n        far_type(far_type),\n        generate_keys(generate_keys),\n        fet(fet),\n        tt(tt),\n        symbols_fname(symbols_fname),\n        unknown_symbol(unknown_symbol),\n        keep_symbols(keep_symbols),\n        initial_symbols(initial_symbols),\n        allow_negative_labels(allow_negative_labels),\n        key_prefix(key_prefix),\n        key_suffix(key_suffix) {}\n};\n\ntemplate <class Arc>\nvoid FarCompileStrings(FarCompileStringsArgs *args) {\n  FarCompileStrings<Arc>(\n      args->in_fnames, args->out_fname, args->fst_type, args->far_type,\n      args->generate_keys, args->fet, args->tt, args->symbols_fname,\n      args->unknown_symbol, args->keep_symbols, args->initial_symbols,\n      args->allow_negative_labels, args->key_prefix, args->key_suffix);\n}\n\nvoid FarCompileStrings(const std::vector<string> &in_fnames,\n                       const string &out_fname, const string &arc_type,\n                       const string &fst_type, const FarType &far_type,\n                       int32 generate_keys, FarEntryType fet, FarTokenType tt,\n                       const string &symbols_fname,\n                       const string &unknown_symbol, bool keep_symbols,\n                       bool initial_symbols, bool allow_negative_labels,\n                       const string &key_prefix, const string &key_suffix);\n\n// Note: it is safe to pass these strings as references because this struct is\n// only used to pass them deeper in the call graph. Be sure you understand why\n// this is so before using this struct for anything else!\nstruct FarCreateArgs {\n  const std::vector<string> &in_fnames;\n  const string &out_fname;\n  const int32 generate_keys;\n  const FarType &far_type;\n  const string &key_prefix;\n  const string &key_suffix;\n\n  FarCreateArgs(const std::vector<string> &in_fnames, const string &out_fname,\n                const int32 generate_keys, const FarType &far_type,\n                const string &key_prefix, const string &key_suffix)\n      : in_fnames(in_fnames),\n        out_fname(out_fname),\n        generate_keys(generate_keys),\n        far_type(far_type),\n        key_prefix(key_prefix),\n        key_suffix(key_suffix) {}\n};\n\ntemplate <class Arc>\nvoid FarCreate(FarCreateArgs *args) {\n  FarCreate<Arc>(args->in_fnames, args->out_fname, args->generate_keys,\n                 args->far_type, args->key_prefix, args->key_suffix);\n}\n\nvoid FarCreate(const std::vector<string> &in_fnames, const string &out_fname,\n               const string &arc_type, const int32 generate_keys,\n               const FarType &far_type, const string &key_prefix,\n               const string &key_suffix);\n\nusing FarEqualInnerArgs = std::tuple<const string &, const string &, float,\n                                     const string &, const string &>;\n\nusing FarEqualArgs = WithReturnValue<bool, FarEqualInnerArgs>;\n\ntemplate <class Arc>\nvoid FarEqual(FarEqualArgs *args) {\n  args->retval = fst::FarEqual<Arc>(\n      std::get<0>(args->args), std::get<1>(args->args), std::get<2>(args->args),\n      std::get<3>(args->args), std::get<4>(args->args));\n}\n\nbool FarEqual(const string &filename1, const string &filename2,\n              const string &arc_type, float delta = kDelta,\n              const string &begin_key = string(),\n              const string &end_key = string());\n\nusing FarExtractArgs =\n    std::tuple<const std::vector<string> &, int32, const string &,\n               const string &, const string &, const string &, const string &>;\n\ntemplate <class Arc>\nvoid FarExtract(FarExtractArgs *args) {\n  fst::FarExtract<Arc>(std::get<0>(*args), std::get<1>(*args),\n                           std::get<2>(*args), std::get<3>(*args),\n                           std::get<4>(*args), std::get<5>(*args),\n                           std::get<6>(*args));\n}\n\nvoid FarExtract(const std::vector<string> &ifilenames, const string &arc_type,\n                int32 generate_filenames, const string &keys,\n                const string &key_separator, const string &range_delimiter,\n                const string &filename_prefix, const string &filename_suffix);\n\nusing FarInfoArgs = std::tuple<const std::vector<string> &, const string &,\n                               const string &, const bool>;\n\ntemplate <class Arc>\nvoid FarInfo(FarInfoArgs *args) {\n  fst::FarInfo<Arc>(std::get<0>(*args), std::get<1>(*args),\n                        std::get<2>(*args), std::get<3>(*args));\n}\n\nvoid FarInfo(const std::vector<string> &filenames, const string &arc_type,\n             const string &begin_key, const string &end_key,\n             const bool list_fsts);\n\nusing GetFarInfoArgs = std::tuple<const std::vector<string> &, const string &,\n                                  const string &, const bool, FarInfoData *>;\n\ntemplate <class Arc>\nvoid GetFarInfo(GetFarInfoArgs *args) {\n  fst::GetFarInfo<Arc>(std::get<0>(*args), std::get<1>(*args),\n                           std::get<2>(*args), std::get<3>(*args),\n                           std::get<4>(*args));\n}\n\nvoid GetFarInfo(const std::vector<string> &filenames, const string &arc_type,\n                const string &begin_key, const string &end_key,\n                const bool list_fsts, FarInfoData *);\n\nusing FarIsomorphicInnerArgs = std::tuple<const string &, const string &, float,\n                                          const string &, const string &>;\n\nusing FarIsomorphicArgs = WithReturnValue<bool, FarIsomorphicInnerArgs>;\n\ntemplate <class Arc>\nvoid FarIsomorphic(FarIsomorphicArgs *args) {\n  args->retval = fst::FarIsomorphic<Arc>(\n      std::get<0>(args->args), std::get<1>(args->args), std::get<2>(args->args),\n      std::get<3>(args->args), std::get<4>(args->args));\n}\n\nbool FarIsomorphic(const string &filename1, const string &filename2,\n                   const string &arc_type, float delta = kDelta,\n                   const string &begin_key = string(),\n                   const string &end_key = string());\n\nstruct FarPrintStringsArgs {\n  const std::vector<string> &ifilenames;\n  const FarEntryType entry_type;\n  const FarTokenType token_type;\n  const string &begin_key;\n  const string &end_key;\n  const bool print_key;\n  const bool print_weight;\n  const string &symbols_fname;\n  const bool initial_symbols;\n  const int32 generate_filenames;\n  const string &filename_prefix;\n  const string &filename_suffix;\n\n  FarPrintStringsArgs(const std::vector<string> &ifilenames,\n                      const FarEntryType entry_type,\n                      const FarTokenType token_type, const string &begin_key,\n                      const string &end_key, const bool print_key,\n                      const bool print_weight, const string &symbols_fname,\n                      const bool initial_symbols,\n                      const int32 generate_filenames,\n                      const string &filename_prefix,\n                      const string &filename_suffix)\n      : ifilenames(ifilenames),\n        entry_type(entry_type),\n        token_type(token_type),\n        begin_key(begin_key),\n        end_key(end_key),\n        print_key(print_key),\n        print_weight(print_weight),\n        symbols_fname(symbols_fname),\n        initial_symbols(initial_symbols),\n        generate_filenames(generate_filenames),\n        filename_prefix(filename_prefix),\n        filename_suffix(filename_suffix) {}\n};\n\ntemplate <class Arc>\nvoid FarPrintStrings(FarPrintStringsArgs *args) {\n  fst::FarPrintStrings<Arc>(\n      args->ifilenames, args->entry_type, args->token_type, args->begin_key,\n      args->end_key, args->print_key, args->print_weight, args->symbols_fname,\n      args->initial_symbols, args->generate_filenames, args->filename_prefix,\n      args->filename_suffix);\n}\n\nvoid FarPrintStrings(const std::vector<string> &ifilenames,\n                     const string &arc_type, const FarEntryType entry_type,\n                     const FarTokenType token_type, const string &begin_key,\n                     const string &end_key, const bool print_key,\n                     const bool print_weight, const string &symbols_fname,\n                     const bool initial_symbols, const int32 generate_filenames,\n                     const string &filename_prefix,\n                     const string &filename_suffix);\n\n}  // namespace script\n}  // namespace fst\n\n#define REGISTER_FST_FAR_OPERATIONS(ArcType)                                 \\\n  REGISTER_FST_OPERATION(FarCompileStrings, ArcType, FarCompileStringsArgs); \\\n  REGISTER_FST_OPERATION(FarCreate, ArcType, FarCreateArgs);                 \\\n  REGISTER_FST_OPERATION(FarEqual, ArcType, FarEqualArgs);                   \\\n  REGISTER_FST_OPERATION(FarExtract, ArcType, FarExtractArgs);               \\\n  REGISTER_FST_OPERATION(FarInfo, ArcType, FarInfoArgs);                     \\\n  REGISTER_FST_OPERATION(FarIsomorphic, ArcType, FarIsomorphicArgs);         \\\n  REGISTER_FST_OPERATION(FarPrintStrings, ArcType, FarPrintStringsArgs);     \\\n  REGISTER_FST_OPERATION(GetFarInfo, ArcType, GetFarInfoArgs)\n\n#endif  // FST_EXTENSIONS_FAR_FARSCRIPT_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/extensions/far/getters.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Classes and functions for registering and invoking FAR main\n// functions that support multiple and extensible arc types.\n\n#ifndef FST_EXTENSIONS_FAR_GETTERS_H_\n#define FST_EXTENSIONS_FAR_GETTERS_H_\n\n#include <fst/flags.h>\n#include <fst/extensions/far/far.h>\n\nnamespace fst {\nnamespace script {\n\nFarType GetFarType(const string &str);\n\nbool GetFarEntryType(const string &str, FarEntryType *entry_type);\n\nbool GetFarTokenType(const string &str, FarTokenType *token_type);\n\nvoid ExpandArgs(int argc, char **argv, int *argcp, char ***argvp);\n\n}  // namespace script\n\nstring GetFarTypeString(FarType type);\n\n}  // namespace fst\n\n#endif  // FST_EXTENSIONS_FAR_GETTERS_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/extensions/far/info.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#ifndef FST_EXTENSIONS_FAR_INFO_H_\n#define FST_EXTENSIONS_FAR_INFO_H_\n\n#include <iomanip>\n#include <memory>\n#include <set>\n#include <string>\n#include <utility>\n#include <vector>\n\n#include <fst/extensions/far/far.h>\n#include <fst/extensions/far/getters.h>\n\nnamespace fst {\n\ntemplate <class Arc>\nvoid AccumulateStatesAndArcs(const Fst<Arc> &fst, size_t *nstate, size_t *narc,\n                             size_t *nfinal) {\n  for (StateIterator<Fst<Arc>> siter(fst); !siter.Done();\n       siter.Next(), ++(*nstate)) {\n    ArcIterator<Fst<Arc>> aiter(fst, siter.Value());\n    for (; !aiter.Done(); aiter.Next(), ++(*narc)) {\n    }\n    if (fst.Final(siter.Value()) != Arc::Weight::Zero()) ++(*nfinal);\n  }\n}\n\nstruct KeyInfo {\n  string key;\n  string type;\n  size_t nstate = 0;\n  size_t narc = 0;\n  size_t nfinal = 0;\n};\n\nstruct FarInfoData {\n  std::vector<KeyInfo> key_infos;\n  string far_type;\n  string arc_type;\n  size_t nfst = 0;\n  size_t nstate = 0;\n  size_t narc = 0;\n  size_t nfinal = 0;\n  std::set<string> fst_types;\n};\n\ntemplate <class Arc>\nvoid GetFarInfo(const std::vector<string> &filenames, const string &begin_key,\n                const string &end_key, const bool list_fsts,\n                FarInfoData *far_info) {\n  *far_info = FarInfoData();\n  std::unique_ptr<FarReader<Arc>> reader(FarReader<Arc>::Open(filenames));\n  if (!reader) {\n    LOG(ERROR) << \"GetFarInfo: failed to create far reader.\";\n    return;\n  }\n  if (!begin_key.empty()) reader->Find(begin_key);\n\n  for (; !reader->Done(); reader->Next()) {\n    const auto &key = reader->GetKey();\n    if (!end_key.empty() && end_key < key) break;\n    ++far_info->nfst;\n    const auto *fst = reader->GetFst();\n    far_info->fst_types.insert(fst->Type());\n    if (list_fsts) {\n      KeyInfo info;\n      info.key = key;\n      info.type = fst->Type();\n      AccumulateStatesAndArcs(*fst, &info.nstate, &info.narc, &info.nfinal);\n      far_info->nstate += info.nstate;\n      far_info->narc += info.narc;\n      far_info->nfinal += info.nfinal;\n      far_info->key_infos.push_back(info);\n    } else {\n      AccumulateStatesAndArcs(*fst, &far_info->nstate, &far_info->narc,\n                              &far_info->nfinal);\n    }\n  }\n  far_info->far_type = GetFarTypeString(reader->Type());\n  far_info->arc_type = Arc::Type();\n}\n\ntemplate <class Arc>\nvoid FarInfo(const std::vector<string> &filenames, const string &begin_key,\n             const string &end_key, const bool list_fsts) {\n  FarInfoData info;\n  GetFarInfo<Arc>(filenames, begin_key, end_key, list_fsts, &info);\n  if (!list_fsts) {\n    std::cout << std::left << std::setw(50) << \"far type\" << info.far_type\n              << std::endl;\n    std::cout << std::left << std::setw(50) << \"arc type\" << Arc::Type()\n              << std::endl;\n    std::cout << std::left << std::setw(50) << \"fst type\";\n    for (auto iter = info.fst_types.begin(); iter != info.fst_types.end();\n         ++iter) {\n      if (iter != info.fst_types.begin()) std::cout << \",\";\n      std::cout << *iter;\n    }\n    std::cout << std::endl;\n    std::cout << std::left << std::setw(50) << \"# of FSTs\" << info.nfst\n              << std::endl;\n    std::cout << std::left << std::setw(50) << \"total # of states\"\n              << info.nstate << std::endl;\n    std::cout << std::left << std::setw(50) << \"total # of arcs\" << info.narc\n              << std::endl;\n    std::cout << std::left << std::setw(50) << \"total # of final states\"\n              << info.nfinal << std::endl;\n  } else {\n    // FIXME(kbg): Grok, then document this.\n    int wkey = 10;\n    int wtype = 10;\n    int wnstate = 14;\n    int wnarc = 12;\n    int wnfinal = 20;\n    for (const auto &key_info : info.key_infos) {\n      if (key_info.key.size() + 2 > wkey) wkey = key_info.key.size() + 2;\n      if (key_info.type.size() + 2 > wtype) wtype = key_info.type.size() + 2;\n      if (ceil(log10(key_info.nstate)) + 2 > wnstate) {\n        wnstate = ceil(log10(key_info.nstate)) + 2;\n      }\n      if (ceil(log10(key_info.narc)) + 2 > wnarc) {\n        wnarc = ceil(log10(key_info.narc)) + 2;\n      }\n      if (ceil(log10(key_info.nfinal)) + 2 > wnfinal) {\n        wnfinal = ceil(log10(key_info.nfinal)) + 2;\n      }\n    }\n    std::cout << std::left << std::setw(wkey) << \"key\" << std::setw(wtype)\n              << \"type\" << std::right << std::setw(wnstate) << \"# of states\"\n              << std::setw(wnarc) << \"# of arcs\" << std::setw(wnfinal)\n              << \"# of final states\" << std::endl;\n    for (const auto &key_info : info.key_infos) {\n      std::cout << std::left << std::setw(wkey) << key_info.key\n                << std::setw(wtype) << key_info.type << std::right\n                << std::setw(wnstate) << key_info.nstate << std::setw(wnarc)\n                << key_info.narc << std::setw(wnfinal) << key_info.nfinal\n                << std::endl;\n    }\n  }\n}\n\n}  // namespace fst\n\n#endif  // FST_EXTENSIONS_FAR_INFO_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/extensions/far/isomorphic.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#ifndef FST_EXTENSIONS_FAR_ISOMORPHIC_H_\n#define FST_EXTENSIONS_FAR_ISOMORPHIC_H_\n\n#include <memory>\n#include <string>\n\n#include <fst/extensions/far/far.h>\n#include <fst/isomorphic.h>\n\nnamespace fst {\n\ntemplate <class Arc>\nbool FarIsomorphic(const string &filename1, const string &filename2,\n                   float delta = kDelta, const string &begin_key = string(),\n                   const string &end_key = string()) {\n  std::unique_ptr<FarReader<Arc>> reader1(FarReader<Arc>::Open(filename1));\n  if (!reader1) {\n    LOG(ERROR) << \"FarIsomorphic: Cannot open FAR file \" << filename1;\n    return false;\n  }\n  std::unique_ptr<FarReader<Arc>> reader2(FarReader<Arc>::Open(filename2));\n  if (!reader2) {\n    LOG(ERROR) << \"FarIsomorphic: Cannot open FAR file \" << filename2;\n    return false;\n  }\n  if (!begin_key.empty()) {\n    bool find_begin1 = reader1->Find(begin_key);\n    bool find_begin2 = reader2->Find(begin_key);\n    if (!find_begin1 || !find_begin2) {\n      bool ret = !find_begin1 && !find_begin2;\n      if (!ret) {\n        VLOG(1) << \"FarIsomorphic: Key \" << begin_key << \" missing from \"\n                << (find_begin1 ? \"second\" : \"first\") << \" archive.\";\n      }\n      return ret;\n    }\n  }\n  for (; !reader1->Done() && !reader2->Done();\n       reader1->Next(), reader2->Next()) {\n    const auto &key1 = reader1->GetKey();\n    const auto &key2 = reader2->GetKey();\n    if (!end_key.empty() && end_key < key1 && end_key < key2) return true;\n    if (key1 != key2) {\n      LOG(ERROR) << \"FarIsomorphic: Mismatched keys \" << key1 << \" and \"\n                 << key2;\n      return false;\n    }\n    if (!Isomorphic(*(reader1->GetFst()), *(reader2->GetFst()), delta)) {\n      LOG(ERROR) << \"FarIsomorphic: FSTs for key \" << key1\n                 << \" are not isomorphic\";\n      return false;\n    }\n  }\n  if (!reader1->Done() || !reader2->Done()) {\n    LOG(ERROR) << \"FarIsomorphic: Key \"\n               << (reader1->Done() ? reader2->GetKey() : reader1->GetKey())\n               << \" missing form \" << (reader2->Done() ? \"first\" : \"second\")\n               << \" archive\";\n    return false;\n  }\n  return true;\n}\n\n}  // namespace fst\n\n#endif  // FST_EXTENSIONS_FAR_ISOMORPHIC_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/extensions/far/print-strings.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Outputs as strings the string FSTs in a finite-state archive.\n\n#ifndef FST_EXTENSIONS_FAR_PRINT_STRINGS_H_\n#define FST_EXTENSIONS_FAR_PRINT_STRINGS_H_\n\n#include <iomanip>\n#include <string>\n#include <vector>\n\n#include <fst/flags.h>\n#include <fst/extensions/far/far.h>\n#include <fstream>\n#include <fst/shortest-distance.h>\n#include <fst/string.h>\n\nDECLARE_string(far_field_separator);\n\nnamespace fst {\n\ntemplate <class Arc>\nvoid FarPrintStrings(const std::vector<string> &ifilenames,\n                     FarEntryType entry_type, FarTokenType far_token_type,\n                     const string &begin_key, const string &end_key,\n                     bool print_key, bool print_weight,\n                     const string &symbols_fname, bool initial_symbols,\n                     int32 generate_filenames, const string &filename_prefix,\n                     const string &filename_suffix) {\n  StringTokenType token_type;\n  if (far_token_type == FTT_SYMBOL) {\n    token_type = StringTokenType::SYMBOL;\n  } else if (far_token_type == FTT_BYTE) {\n    token_type = StringTokenType::BYTE;\n  } else if (far_token_type == FTT_UTF8) {\n    token_type = StringTokenType::UTF8;\n  } else {\n    FSTERROR() << \"FarPrintStrings: Unknown token type\";\n    return;\n  }\n  std::unique_ptr<const SymbolTable> syms;\n  if (!symbols_fname.empty()) {\n    // TODO(kbg): Allow negative flag?\n    const SymbolTableTextOptions opts(true);\n    syms.reset(SymbolTable::ReadText(symbols_fname, opts));\n    if (!syms) {\n      LOG(ERROR) << \"FarPrintStrings: Error reading symbol table \"\n                 << symbols_fname;\n      return;\n    }\n  }\n  std::unique_ptr<FarReader<Arc>> far_reader(FarReader<Arc>::Open(ifilenames));\n  if (!far_reader) return;\n  if (!begin_key.empty()) far_reader->Find(begin_key);\n  string okey;\n  int nrep = 0;\n  for (int i = 1; !far_reader->Done(); far_reader->Next(), ++i) {\n    const auto &key = far_reader->GetKey();\n    if (!end_key.empty() && end_key < key) break;\n    if (okey == key) {\n      ++nrep;\n    } else {\n      nrep = 0;\n    }\n    okey = key;\n    const auto *fst = far_reader->GetFst();\n    if (i == 1 && initial_symbols && !syms && fst->InputSymbols())\n      syms.reset(fst->InputSymbols()->Copy());\n    string str;\n    VLOG(2) << \"Handling key: \" << key;\n    StringPrinter<Arc> string_printer(token_type,\n                                      syms ? syms.get() : fst->InputSymbols());\n    string_printer(*fst, &str);\n    if (entry_type == FET_LINE) {\n      if (print_key) std::cout << key << FLAGS_far_field_separator[0];\n      std::cout << str;\n      if (print_weight)\n        std::cout << FLAGS_far_field_separator[0] << ShortestDistance(*fst);\n      std::cout << std::endl;\n    } else if (entry_type == FET_FILE) {\n      std::stringstream sstrm;\n      if (generate_filenames) {\n        sstrm.fill('0');\n        sstrm << std::right << std::setw(generate_filenames) << i;\n      } else {\n        sstrm << key;\n        if (nrep > 0) sstrm << \".\" << nrep;\n      }\n      string filename;\n      filename = filename_prefix + sstrm.str() + filename_suffix;\n      std::ofstream ostrm(filename);\n      if (!ostrm) {\n        LOG(ERROR) << \"FarPrintStrings: Can't open file: \" << filename;\n        return;\n      }\n      ostrm << str;\n      if (token_type == StringTokenType::SYMBOL) ostrm << \"\\n\";\n    }\n  }\n}\n\n}  // namespace fst\n\n#endif  // FST_EXTENSIONS_FAR_PRINT_STRINGS_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/extensions/far/script-impl.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Classes and functions for registering and invoking Far main\n// functions that support multiple and extensible arc types.\n\n#ifndef FST_EXTENSIONS_FAR_SCRIPT_IMPL_H_\n#define FST_EXTENSIONS_FAR_SCRIPT_IMPL_H_\n\n#include <string>\n\n#include <fst/compat.h>\nnamespace fst {\nnamespace script {\n\nstring LoadArcTypeFromFar(const string &far_fname);\n\nstring LoadArcTypeFromFst(const string &fst_fname);\n\n}  // namespace script\n}  // namespace fst\n\n#endif  // FST_EXTENSIONS_FAR_SCRIPT_IMPL_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/extensions/far/stlist.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// A generic (string,type) list file format.\n//\n// This is a stripped-down version of STTable that does not support the Find()\n// operation but that does support reading/writting from standard in/out.\n\n#ifndef FST_EXTENSIONS_FAR_STLIST_H_\n#define FST_EXTENSIONS_FAR_STLIST_H_\n\n#include <algorithm>\n#include <functional>\n#include <iostream>\n#include <memory>\n#include <queue>\n#include <string>\n#include <utility>\n#include <vector>\n\n#include <fstream>\n#include <fst/util.h>\n\nnamespace fst {\n\nstatic constexpr int32 kSTListMagicNumber = 5656924;\nstatic constexpr int32 kSTListFileVersion = 1;\n\n// String-type list writing class for object of type T using a functor Writer.\n// The Writer functor must provide at least the following interface:\n//\n//   struct Writer {\n//     void operator()(std::ostream &, const T &) const;\n//   };\ntemplate <class T, class Writer>\nclass STListWriter {\n public:\n  explicit STListWriter(const string &filename)\n      : stream_(filename.empty() ? &std::cout : new std::ofstream(\n                                                    filename,\n                                                    std::ios_base::out |\n                                                        std::ios_base::binary)),\n        error_(false) {\n    WriteType(*stream_, kSTListMagicNumber);\n    WriteType(*stream_, kSTListFileVersion);\n    if (!stream_) {\n      FSTERROR() << \"STListWriter::STListWriter: Error writing to file: \"\n                 << filename;\n      error_ = true;\n    }\n  }\n\n  static STListWriter<T, Writer> *Create(const string &filename) {\n    return new STListWriter<T, Writer>(filename);\n  }\n\n  void Add(const string &key, const T &t) {\n    if (key == \"\") {\n      FSTERROR() << \"STListWriter::Add: Key empty: \" << key;\n      error_ = true;\n    } else if (key < last_key_) {\n      FSTERROR() << \"STListWriter::Add: Key out of order: \" << key;\n      error_ = true;\n    }\n    if (error_) return;\n    last_key_ = key;\n    WriteType(*stream_, key);\n    entry_writer_(*stream_, t);\n  }\n\n  bool Error() const { return error_; }\n\n  ~STListWriter() {\n    WriteType(*stream_, string());\n    if (stream_ != &std::cout) delete stream_;\n  }\n\n private:\n  Writer entry_writer_;\n  std::ostream *stream_;  // Output stream.\n  string last_key_;       // Last key.\n  bool error_;\n\n  STListWriter(const STListWriter &) = delete;\n  STListWriter &operator=(const STListWriter &) = delete;\n};\n\n// String-type list reading class for object of type T using a functor Reader.\n// Reader must provide at least the following interface:\n//\n//   struct Reader {\n//     T *operator()(std::istream &) const;\n//   };\ntemplate <class T, class Reader>\nclass STListReader {\n public:\n  explicit STListReader(const std::vector<string> &filenames)\n      : sources_(filenames), error_(false) {\n    streams_.resize(filenames.size(), 0);\n    bool has_stdin = false;\n    for (size_t i = 0; i < filenames.size(); ++i) {\n      if (filenames[i].empty()) {\n        if (!has_stdin) {\n          streams_[i] = &std::cin;\n          sources_[i] = \"stdin\";\n          has_stdin = true;\n        } else {\n          FSTERROR() << \"STListReader::STListReader: Cannot read multiple \"\n                     << \"inputs from standard input\";\n          error_ = true;\n          return;\n        }\n      } else {\n        streams_[i] = new std::ifstream(\n            filenames[i], std::ios_base::in | std::ios_base::binary);\n      }\n      int32 magic_number = 0;\n      ReadType(*streams_[i], &magic_number);\n      int32 file_version = 0;\n      ReadType(*streams_[i], &file_version);\n      if (magic_number != kSTListMagicNumber) {\n        FSTERROR() << \"STListReader::STListReader: Wrong file type: \"\n                   << filenames[i];\n        error_ = true;\n        return;\n      }\n      if (file_version != kSTListFileVersion) {\n        FSTERROR() << \"STListReader::STListReader: Wrong file version: \"\n                   << filenames[i];\n        error_ = true;\n        return;\n      }\n      string key;\n      ReadType(*streams_[i], &key);\n      if (!key.empty()) heap_.push(std::make_pair(key, i));\n      if (!*streams_[i]) {\n        FSTERROR() << \"STListReader: Error reading file: \" << sources_[i];\n        error_ = true;\n        return;\n      }\n    }\n    if (heap_.empty()) return;\n    const auto current = heap_.top().second;\n    entry_.reset(entry_reader_(*streams_[current]));\n    if (!entry_ || !*streams_[current]) {\n      FSTERROR() << \"STListReader: Error reading entry for key \"\n                 << heap_.top().first << \", file \" << sources_[current];\n      error_ = true;\n    }\n  }\n\n  ~STListReader() {\n    for (auto &stream : streams_) {\n      if (stream != &std::cin) delete stream;\n    }\n  }\n\n  static STListReader<T, Reader> *Open(const string &filename) {\n    std::vector<string> filenames;\n    filenames.push_back(filename);\n    return new STListReader<T, Reader>(filenames);\n  }\n\n  static STListReader<T, Reader> *Open(const std::vector<string> &filenames) {\n    return new STListReader<T, Reader>(filenames);\n  }\n\n  void Reset() {\n    FSTERROR() << \"STListReader::Reset: Operation not supported\";\n    error_ = true;\n  }\n\n  bool Find(const string &key) {\n    FSTERROR() << \"STListReader::Find: Operation not supported\";\n    error_ = true;\n    return false;\n  }\n\n  bool Done() const { return error_ || heap_.empty(); }\n\n  void Next() {\n    if (error_) return;\n    auto current = heap_.top().second;\n    string key;\n    heap_.pop();\n    ReadType(*(streams_[current]), &key);\n    if (!*streams_[current]) {\n      FSTERROR() << \"STListReader: Error reading file: \" << sources_[current];\n      error_ = true;\n      return;\n    }\n    if (!key.empty()) heap_.push(std::make_pair(key, current));\n    if (!heap_.empty()) {\n      current = heap_.top().second;\n      entry_.reset(entry_reader_(*streams_[current]));\n      if (!entry_ || !*streams_[current]) {\n        FSTERROR() << \"STListReader: Error reading entry for key: \"\n                   << heap_.top().first << \", file: \" << sources_[current];\n        error_ = true;\n      }\n    }\n  }\n\n  const string &GetKey() const { return heap_.top().first; }\n\n  const T *GetEntry() const { return entry_.get(); }\n\n  bool Error() const { return error_; }\n\n private:\n  Reader entry_reader_;                  // Read functor.\n  std::vector<std::istream *> streams_;  // Input streams.\n  std::vector<string> sources_;          // Corresponding filenames.\n  std::priority_queue<\n      std::pair<string, size_t>, std::vector<std::pair<string, size_t>>,\n      std::greater<std::pair<string, size_t>>> heap_;  // (Key, stream id) heap\n  mutable std::unique_ptr<T> entry_;  // The currently read entry.\n  bool error_;\n\n  STListReader(const STListReader &) = delete;\n  STListReader &operator=(const STListReader &) = delete;\n};\n\n// String-type list header reading function, templated on the entry header type.\n// The Header type must provide at least the following interface:\n//\n//  struct Header {\n//    void Read(std::istream &strm, const string &filename);\n//  };\ntemplate <class Header>\nbool ReadSTListHeader(const string &filename, Header *header) {\n  if (filename.empty()) {\n    LOG(ERROR) << \"ReadSTListHeader: Can't read header from standard input\";\n    return false;\n  }\n  std::ifstream strm(filename, std::ios_base::in | std::ios_base::binary);\n  if (!strm) {\n    LOG(ERROR) << \"ReadSTListHeader: Could not open file: \" << filename;\n    return false;\n  }\n  int32 magic_number = 0;\n  ReadType(strm, &magic_number);\n  int32 file_version = 0;\n  ReadType(strm, &file_version);\n  if (magic_number != kSTListMagicNumber) {\n    LOG(ERROR) << \"ReadSTListHeader: Wrong file type: \" << filename;\n    return false;\n  }\n  if (file_version != kSTListFileVersion) {\n    LOG(ERROR) << \"ReadSTListHeader: Wrong file version: \" << filename;\n    return false;\n  }\n  string key;\n  ReadType(strm, &key);\n  header->Read(strm, filename + \":\" + key);\n  if (!strm) {\n    LOG(ERROR) << \"ReadSTListHeader: Error reading file: \" << filename;\n    return false;\n  }\n  return true;\n}\n\nbool IsSTList(const string &filename);\n\n}  // namespace fst\n\n#endif  // FST_EXTENSIONS_FAR_STLIST_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/extensions/far/sttable.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// A generic string-to-type table file format.\n//\n// This is not meant as a generalization of SSTable. This is more of a simple\n// replacement for SSTable in order to provide an open-source implementation\n// of the FAR format for the external version of the FST library.\n\n#ifndef FST_EXTENSIONS_FAR_STTABLE_H_\n#define FST_EXTENSIONS_FAR_STTABLE_H_\n\n#include <algorithm>\n#include <istream>\n#include <memory>\n\n#include <fstream>\n#include <fst/util.h>\n\nnamespace fst {\n\nstatic constexpr int32 kSTTableMagicNumber = 2125656924;\nstatic constexpr int32 kSTTableFileVersion = 1;\n\n// String-type table writing class for an object of type T using a functor\n// Writer. The Writer functor must provide at least the following interface:\n//\n//   struct Writer {\n//     void operator()(std::ostream &, const T &) const;\n//   };\ntemplate <class T, class Writer>\nclass STTableWriter {\n public:\n  explicit STTableWriter(const string &filename)\n      : stream_(filename, std::ios_base::out | std::ios_base::binary),\n        error_(false) {\n    WriteType(stream_, kSTTableMagicNumber);\n    WriteType(stream_, kSTTableFileVersion);\n    if (stream_.fail()) {\n      FSTERROR() << \"STTableWriter::STTableWriter: Error writing to file: \"\n                 << filename;\n      error_ = true;\n    }\n  }\n\n  static STTableWriter<T, Writer> *Create(const string &filename) {\n    if (filename.empty()) {\n      LOG(ERROR) << \"STTableWriter: Writing to standard out unsupported.\";\n      return nullptr;\n    }\n    return new STTableWriter<T, Writer>(filename);\n  }\n\n  void Add(const string &key, const T &t) {\n    if (key == \"\") {\n      FSTERROR() << \"STTableWriter::Add: Key empty: \" << key;\n      error_ = true;\n    } else if (key < last_key_) {\n      FSTERROR() << \"STTableWriter::Add: Key out of order: \" << key;\n      error_ = true;\n    }\n    if (error_) return;\n    last_key_ = key;\n    positions_.push_back(stream_.tellp());\n    WriteType(stream_, key);\n    entry_writer_(stream_, t);\n  }\n\n  bool Error() const { return error_; }\n\n  ~STTableWriter() {\n    WriteType(stream_, positions_);\n    WriteType(stream_, static_cast<int64>(positions_.size()));\n  }\n\n private:\n  Writer entry_writer_;\n  std::ofstream stream_;\n  std::vector<int64> positions_;  // Position in file of each key-entry pair.\n  string last_key_;               // Last key.\n  bool error_;\n\n  STTableWriter(const STTableWriter &) = delete;\n  STTableWriter &operator=(const STTableWriter &) = delete;\n};\n\n// String-type table reading class for object of type T using a functor Reader.\n// Reader must provide at least the following interface:\n//\n//   struct Reader {\n//     T *operator()(std::istream &) const;\n//   };\n//\ntemplate <class T, class Reader>\nclass STTableReader {\n public:\n  explicit STTableReader(const std::vector<string> &filenames)\n      : sources_(filenames), error_(false) {\n    compare_.reset(new Compare(&keys_));\n    keys_.resize(filenames.size());\n    streams_.resize(filenames.size(), 0);\n    positions_.resize(filenames.size());\n    for (size_t i = 0; i < filenames.size(); ++i) {\n      streams_[i] = new std::ifstream(\n          filenames[i], std::ios_base::in | std::ios_base::binary);\n      int32 magic_number = 0;\n      ReadType(*streams_[i], &magic_number);\n      int32 file_version = 0;\n      ReadType(*streams_[i], &file_version);\n      if (magic_number != kSTTableMagicNumber) {\n        FSTERROR() << \"STTableReader::STTableReader: Wrong file type: \"\n                   << filenames[i];\n        error_ = true;\n        return;\n      }\n      if (file_version != kSTTableFileVersion) {\n        FSTERROR() << \"STTableReader::STTableReader: Wrong file version: \"\n                   << filenames[i];\n        error_ = true;\n        return;\n      }\n      int64 num_entries;\n      streams_[i]->seekg(-static_cast<int>(sizeof(int64)), std::ios_base::end);\n      ReadType(*streams_[i], &num_entries);\n      if (num_entries > 0) {\n        streams_[i]->seekg(-static_cast<int>(sizeof(int64)) * (num_entries + 1),\n                           std::ios_base::end);\n        positions_[i].resize(num_entries);\n        for (size_t j = 0; (j < num_entries) && (!streams_[i]->fail()); ++j) {\n          ReadType(*streams_[i], &(positions_[i][j]));\n        }\n        streams_[i]->seekg(positions_[i][0]);\n        if (streams_[i]->fail()) {\n          FSTERROR() << \"STTableReader::STTableReader: Error reading file: \"\n                     << filenames[i];\n          error_ = true;\n          return;\n        }\n      }\n    }\n    MakeHeap();\n  }\n\n  ~STTableReader() {\n    for (auto &stream : streams_) delete stream;\n  }\n\n  static STTableReader<T, Reader> *Open(const string &filename) {\n    if (filename.empty()) {\n      LOG(ERROR) << \"STTableReader: Operation not supported on standard input\";\n      return nullptr;\n    }\n    std::vector<string> filenames;\n    filenames.push_back(filename);\n    return new STTableReader<T, Reader>(filenames);\n  }\n\n  static STTableReader<T, Reader> *Open(const std::vector<string> &filenames) {\n    return new STTableReader<T, Reader>(filenames);\n  }\n\n  void Reset() {\n    if (error_) return;\n    for (size_t i = 0; i < streams_.size(); ++i)\n      streams_[i]->seekg(positions_[i].front());\n    MakeHeap();\n  }\n\n  bool Find(const string &key) {\n    if (error_) return false;\n    for (size_t i = 0; i < streams_.size(); ++i) LowerBound(i, key);\n    MakeHeap();\n    if (heap_.empty()) return false;\n    return keys_[current_] == key;\n  }\n\n  bool Done() const { return error_ || heap_.empty(); }\n\n  void Next() {\n    if (error_) return;\n    if (streams_[current_]->tellg() <= positions_[current_].back()) {\n      ReadType(*(streams_[current_]), &(keys_[current_]));\n      if (streams_[current_]->fail()) {\n        FSTERROR() << \"STTableReader: Error reading file: \"\n                   << sources_[current_];\n        error_ = true;\n        return;\n      }\n      std::push_heap(heap_.begin(), heap_.end(), *compare_);\n    } else {\n      heap_.pop_back();\n    }\n    if (!heap_.empty()) PopHeap();\n  }\n\n  const string &GetKey() const { return keys_[current_]; }\n\n  const T *GetEntry() const { return entry_.get(); }\n\n  bool Error() const { return error_; }\n\n private:\n  // Comparison functor used to compare stream IDs in the heap.\n  struct Compare {\n    explicit Compare(const std::vector<string> *keys) : keys(keys) {}\n\n    bool operator()(size_t i, size_t j) const {\n      return (*keys)[i] > (*keys)[j];\n    };\n\n   private:\n    const std::vector<string> *keys;\n  };\n\n  // Positions the stream at the position corresponding to the lower bound for\n  // the specified key.\n  void LowerBound(size_t id, const string &find_key) {\n    auto *strm = streams_[id];\n    const auto &positions = positions_[id];\n    if (positions.empty()) return;\n    size_t low = 0;\n    size_t high = positions.size() - 1;\n    while (low < high) {\n      size_t mid = (low + high) / 2;\n      strm->seekg(positions[mid]);\n      string key;\n      ReadType(*strm, &key);\n      if (key > find_key) {\n        high = mid;\n      } else if (key < find_key) {\n        low = mid + 1;\n      } else {\n        for (size_t i = mid; i > low; --i) {\n          strm->seekg(positions[i - 1]);\n          ReadType(*strm, &key);\n          if (key != find_key) {\n            strm->seekg(positions[i]);\n            return;\n          }\n        }\n        strm->seekg(positions[low]);\n        return;\n      }\n    }\n    strm->seekg(positions[low]);\n  }\n\n  // Adds all streams to the heap.\n  void MakeHeap() {\n    heap_.clear();\n    for (size_t i = 0; i < streams_.size(); ++i) {\n      if (positions_[i].empty()) continue;\n      ReadType(*streams_[i], &(keys_[i]));\n      if (streams_[i]->fail()) {\n        FSTERROR() << \"STTableReader: Error reading file: \" << sources_[i];\n        error_ = true;\n        return;\n      }\n      heap_.push_back(i);\n    }\n    if (heap_.empty()) return;\n    std::make_heap(heap_.begin(), heap_.end(), *compare_);\n    PopHeap();\n  }\n\n  // Positions the stream with the lowest key at the top of the heap, sets\n  // current_ to the ID of that stream, and reads the current entry from that\n  // stream.\n  void PopHeap() {\n    std::pop_heap(heap_.begin(), heap_.end(), *compare_);\n    current_ = heap_.back();\n    entry_.reset(entry_reader_(*streams_[current_]));\n    if (!entry_) error_ = true;\n    if (streams_[current_]->fail()) {\n      FSTERROR() << \"STTableReader: Error reading entry for key: \"\n                 << keys_[current_] << \", file: \" << sources_[current_];\n      error_ = true;\n    }\n  }\n\n  Reader entry_reader_;\n  std::vector<std::istream *> streams_;        // Input streams.\n  std::vector<string> sources_;                // Corresponding file names.\n  std::vector<std::vector<int64>> positions_;  // Index of positions.\n  std::vector<string> keys_;  // Lowest unread key for each stream.\n  std::vector<int64> heap_;   // Heap containing ID of streams with unread keys.\n  int64 current_;             // ID of current stream to be read.\n  std::unique_ptr<Compare> compare_;  // Functor comparing stream IDs.\n  mutable std::unique_ptr<T> entry_;  // The currently read entry.\n  bool error_;\n};\n\n// String-type table header reading function template on the entry header type.\n// The Header type must provide at least the following interface:\n//\n//   struct Header {\n//     void Read(std::istream &istrm, const string &filename);\n//   };\ntemplate <class Header>\nbool ReadSTTableHeader(const string &filename, Header *header) {\n  if (filename.empty()) {\n    LOG(ERROR) << \"ReadSTTable: Can't read header from standard input\";\n    return false;\n  }\n  std::ifstream strm(filename, std::ios_base::in | std::ios_base::binary);\n  if (!strm) {\n    LOG(ERROR) << \"ReadSTTableHeader: Could not open file: \" << filename;\n    return false;\n  }\n  int32 magic_number = 0;\n  ReadType(strm, &magic_number);\n  int32 file_version = 0;\n  ReadType(strm, &file_version);\n  if (magic_number != kSTTableMagicNumber) {\n    LOG(ERROR) << \"ReadSTTableHeader: Wrong file type: \" << filename;\n    return false;\n  }\n  if (file_version != kSTTableFileVersion) {\n    LOG(ERROR) << \"ReadSTTableHeader: Wrong file version: \" << filename;\n    return false;\n  }\n  int64 i = -1;\n  strm.seekg(-static_cast<int>(sizeof(int64)), std::ios_base::end);\n  ReadType(strm, &i);  // Reads number of entries\n  if (strm.fail()) {\n    LOG(ERROR) << \"ReadSTTableHeader: Error reading file: \" << filename;\n    return false;\n  }\n  if (i == 0) return true;  // No entry header to read.\n  strm.seekg(-2 * static_cast<int>(sizeof(int64)), std::ios_base::end);\n  ReadType(strm, &i);  // Reads position for last entry in file.\n  strm.seekg(i);\n  string key;\n  ReadType(strm, &key);\n  header->Read(strm, filename + \":\" + key);\n  if (strm.fail()) {\n    LOG(ERROR) << \"ReadSTTableHeader: Error reading file: \" << filename;\n    return false;\n  }\n  return true;\n}\n\nbool IsSTTable(const string &filename);\n\n}  // namespace fst\n\n#endif  // FST_EXTENSIONS_FAR_STTABLE_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/extensions/linear/linear-fst-data-builder.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#ifndef FST_EXTENSIONS_LINEAR_LINEAR_FST_DATA_BUILDER_H_\n#define FST_EXTENSIONS_LINEAR_LINEAR_FST_DATA_BUILDER_H_\n\n#include <map>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <stack>\n#include <string>\n#include <vector>\n\n#include <fst/compat.h>\n#include <fst/log.h>\n#include <fst/fst.h>\n#include <fst/symbol-table.h>\n#include <fst/util.h>\n\n#include <fst/extensions/linear/linear-fst-data.h>\n\nnamespace fst {\n\n// Forward declaration\ntemplate <class A>\nclass FeatureGroupBuilder;\n\n// For logging purposes\ninline string TranslateLabel(int64 label, const SymbolTable *syms);\ntemplate <class Iterator>\nstring JoinLabels(Iterator begin, Iterator end, const SymbolTable *syms);\ntemplate <class Label>\nstring JoinLabels(const std::vector<Label> &labels, const SymbolTable *syms);\n\n// Guesses the appropriate boundary label (start- or end-of-sentence)\n// for all labels equal to `boundary` and modifies the `sequence`\n// in-place. Returns the number of positions that are still uncertain.\ntemplate <class A>\ntypename A::Label GuessStartOrEnd(std::vector<typename A::Label> *sequence,\n                                  typename A::Label boundary);\n\n// Builds a `LinearFstData` object by adding words and feature\n// weights. A few conventions:\n//\n// - Input labels forms a dense non-empty range from 1 to `MaxInputLabel()`.\n// - Feature labels, output labels are > 0.\n// - Being a discriminative linear model, it only makes sense to use tropical\n// semirings.\ntemplate <class A>\nclass LinearFstDataBuilder {\n public:\n  typedef typename A::Label Label;\n  typedef typename A::Weight Weight;\n\n  // Constructs a builder with associated symbol tables for diagonstic\n  // output. Each of these symbol tables may also be nullptr.\n  explicit LinearFstDataBuilder(const SymbolTable *isyms = nullptr,\n                                const SymbolTable *fsyms = nullptr,\n                                const SymbolTable *osyms = nullptr)\n      : error_(false),\n        max_future_size_(0),\n        max_input_label_(1),\n        isyms_(isyms),\n        fsyms_(fsyms),\n        osyms_(osyms) {}\n\n  // Tests whether the builder has encountered any error. No operation\n  // is valid if the builder is already at error state. All other\n  // public methods should check this before any actual operations.\n  bool Error() const { return error_; }\n\n  // Adds a word and its feature labels to the vocabulary; this\n  // version allows the word to have any output label. Returns true\n  // iff the word is added.\n  //\n  // This may fail if the word is added twice or if the feature labels\n  // are non-positive.\n  bool AddWord(Label word, const std::vector<Label> &features);\n\n  // Adds a word and its feature labels to the vocabulary; this\n  // version puts constraint on possible output labels the word can\n  // have. `possible_output` must not be empty. Returns true iff the\n  // word is added.\n  //\n  // In addition to the reasons above in the two-parameter version,\n  // this may also fail if `possible_output` is empty or any output\n  // label in it is non-positive.\n  bool AddWord(Label word, const std::vector<Label> &word_features,\n               const std::vector<Label> &possible_output);\n\n  // Creates a new feature group with specified future size (size of\n  // the look-ahead window), returns the group id to be used for\n  // adding actual feature weights or a negative number when called at\n  // error state.\n  //\n  // This does not fail unless called at error state.\n  int AddGroup(size_t future_size);\n\n  // Adds an instance of feature weight to the specified feature\n  // group. If some weight has already been added with the same\n  // feature, the product of the old and new weights are\n  // stored. Returns true iff the weight is added. A weight is not\n  // added when the context has ill-formed context involving start-,\n  // end-of-sentence marks.\n  //\n  // For two features to be within the same group, it must satisfy\n  // that (1) they have the same future size; (2) the two either have\n  // disjoint context or one is the back-off context of the\n  // other. Furthermore, for all features in a single group, there\n  // must be one and only one other context (not necessarily an active\n  // feature) that the feature immediately backs off to (i.e. there is\n  // no other context that is the back-off of the first and backs off\n  // to the second).\n  //\n  // Consider for example features with zero look-ahead of the form\n  // (input, OUTPUT).\n  //\n  // - The following two features can be put in the same group because\n  // their context is disjoint: (a a a, A A), (b, B B);\n  //\n  // - The following two features can be put in the same group because\n  // one is the back-off context of the other: (a a a, A A), (a a, A\n  // A);\n  //\n  // - The following two features can NOT be put in the same group\n  // because there is overlap but neither is the other's back-off: (a\n  // a a, A), (a a, A A);\n  //\n  // - Finally, the following three features cannot be in a same group\n  // because the first one can immediately back off to either of the\n  // rest: (a a a, A A), (a a, A A), (a a a, A).\n  //\n  // The easiest way to satisfy the constraints is to create a feature\n  // group for each feature template. However, better feature grouping\n  // may help improve speed.\n  //\n  // This may fail if any of input or output labels are non-positive,\n  // or if any call to `FeatureGroupBuilder<>::AddWeight()` fails.\n  bool AddWeight(size_t group, const std::vector<Label> &input,\n                 const std::vector<Label> &output, Weight weight);\n\n  // Returns a newly created `LinearFstData` object or nullptr in case\n  // of failure. The caller takes the ownership of the memory. No\n  // other methods shall be called after this --- this is enforced by\n  // putting the builder at error state, even when a\n  // `LinearFstData<>` object is successfully built.\n  //\n  // This may fail if the call to any `FeatureGroupBuilder<>::Dump()`\n  // fails.\n  LinearFstData<A> *Dump();\n\n private:\n  bool error_;\n  CompactSet<Label, kNoLabel> all_output_labels_;\n  std::map<Label, std::set<Label>> word_output_map_, word_feat_map_;\n  std::map<Label, std::set<size_t>> feat_groups_;\n  std::vector<std::unique_ptr<FeatureGroupBuilder<A>>> groups_;\n  size_t max_future_size_;\n  Label max_input_label_;\n  const SymbolTable *isyms_, *fsyms_, *osyms_;\n\n  LinearFstDataBuilder(const LinearFstDataBuilder &) = delete;\n  LinearFstDataBuilder &operator=(const LinearFstDataBuilder &) = delete;\n};\n\n// Builds a LinearFstData tailored for a LinearClassifierFst. The\n// major difference between an ordinary LinearFstData that works on\n// taggers and a LinearFstData that works on classifiers is that\n// feature groups are divided into sections by the prediction class\n// label. For a prediction label `pred` and a logical group id\n// `group`, the actual group id is `group * num_classes + pred -\n// 1`.\n//\n// This layout saves us from recording output labels in each single\n// FeatureGroup. Because there is no need for any delaying, stripping\n// the output allows features with different shapes but using the same\n// set of feature label mapping to reside in a single FeatureGroup.\ntemplate <class A>\nclass LinearClassifierFstDataBuilder {\n public:\n  typedef typename A::Label Label;\n  typedef typename A::Weight Weight;\n\n  // Constructs a builder for a `num_classes`-class classifier,\n  // optinally with associated symbol tables for diagnostic\n  // output. The output labels (i.e. prediction) must be in the range\n  // of [1, num_classes].\n  explicit LinearClassifierFstDataBuilder(size_t num_classes,\n                                          const SymbolTable *isyms = nullptr,\n                                          const SymbolTable *fsyms = nullptr,\n                                          const SymbolTable *osyms = nullptr)\n      : error_(false),\n        num_classes_(num_classes),\n        num_groups_(0),\n        builder_(isyms, fsyms, osyms) {}\n\n  // Tests whether the builder has encountered any error. Similar to\n  // LinearFstDataBuilder<>::Error().\n  bool Error() const { return error_; }\n\n  // Same as LinearFstDataBuilder<>::AddWord().\n  bool AddWord(Label word, const std::vector<Label> &features);\n\n  // Adds a logical feature group. Similar to\n  // LinearFstDataBuilder<>::AddGroup(), with the exception that the\n  // returned group id is the logical group id. Also there is no need\n  // for \"future\" in a classifier.\n  int AddGroup();\n\n  // Adds an instance of feature weight to the specified logical\n  // feature group. Instead of a vector of output, only a single\n  // prediction is needed as the output.\n  //\n  // This may fail if `pred` is not in the range of [1, num_classes_].\n  bool AddWeight(size_t group, const std::vector<Label> &input, Label pred,\n                 Weight weight);\n\n  // Returns a newly created `LinearFstData` object or nullptr in case of\n  // failure.\n  LinearFstData<A> *Dump();\n\n private:\n  std::vector<Label> empty_;\n  bool error_;\n  size_t num_classes_, num_groups_;\n  LinearFstDataBuilder<A> builder_;\n};\n\n// Builds a single feature group. Usually used in\n// `LinearFstDataBuilder::AddWeight()`. See that method for the\n// constraints on grouping features.\ntemplate <class A>\nclass FeatureGroupBuilder {\n public:\n  typedef typename A::Label Label;\n  typedef typename A::Weight Weight;\n\n  // Constructs a builder with the given future size. All features\n  // added to the group will have look-ahead windows of this size.\n  FeatureGroupBuilder(size_t future_size, const SymbolTable *fsyms,\n                      const SymbolTable *osyms)\n      : error_(false), future_size_(future_size), fsyms_(fsyms), osyms_(osyms) {\n    // This edge is special; see doc of class `FeatureGroup` on the\n    // details.\n    start_ = trie_.Insert(trie_.Root(), InputOutputLabel(kNoLabel, kNoLabel));\n  }\n\n  // Tests whether the builder has encountered any error. No operation\n  // is valid if the builder is already at error state. All other\n  // public methods should check this before any actual operations.\n  bool Error() const { return error_; }\n\n  // Adds a feature weight with the given context. Returns true iff\n  // the weight is added. A weight is not added if it has ill-formed\n  // context involving start-, end-of-sentence marks.\n  //\n  // Note: `input` is the sequence of input\n  // features, instead of input labels themselves. `input` must be at\n  // least as long as `future_size`; `output` may be empty, but\n  // usually should be non-empty because an empty output context is\n  // useless in discriminative modelling. All labels in both `input`\n  // and `output` must be > 0 (this is checked in\n  // `LinearFstDataBuilder::AddWeight()`). See\n  // LinearFstDataBuilder<>::AddWeight for more details.\n  //\n  // This may fail if the input is smaller than the look-ahead window.\n  bool AddWeight(const std::vector<Label> &input,\n                 const std::vector<Label> &output, Weight weight);\n\n  // Creates an actual FeatureGroup<> object. Connects back-off links;\n  // pre-accumulates weights from back-off features. Returns nullptr if\n  // there is any violation in unique immediate back-off\n  // constraints.\n  //\n  // Regardless of whether the call succeeds or not, the error flag is\n  // always set before this returns, to prevent repeated dumping.\n  //\n  // TODO(wuke): check overlapping top-level contexts (see\n  // `DumpOverlappingContext()` in tests).\n  FeatureGroup<A> *Dump(size_t max_future_size);\n\n private:\n  typedef typename FeatureGroup<A>::InputOutputLabel InputOutputLabel;\n  typedef typename FeatureGroup<A>::InputOutputLabelHash InputOutputLabelHash;\n  typedef typename FeatureGroup<A>::WeightBackLink WeightBackLink;\n  // Nested trie topology uses more memory but we can traverse a\n  // node's children easily, which is required in `BuildBackLinks()`.\n  typedef NestedTrieTopology<InputOutputLabel, InputOutputLabelHash> Topology;\n  typedef MutableTrie<InputOutputLabel, WeightBackLink, Topology> Trie;\n\n  // Finds the first node with an arc with `label` following the\n  // back-off chain of `parent`. Returns the node index or\n  // `kNoTrieNodeId` when not found. The number of hops is stored in\n  // `hop` when it is not `nullptr`.\n  //\n  // This does not fail.\n  int FindFirstMatch(InputOutputLabel label, int parent, int *hop) const;\n\n  // Links each node to its immediate back-off. root is linked to -1.\n  //\n  // This may fail when the unique immediate back-off constraint is\n  // violated.\n  void BuildBackLinks();\n\n  // Traces back on the back-chain for each node to multiply the\n  // weights from back-offs to the node itself.\n  //\n  // This does not fail.\n  void PreAccumulateWeights();\n\n  // Reconstruct the path from trie root to given node for logging.\n  bool TrieDfs(const Topology &topology, int cur, int target,\n               std::vector<InputOutputLabel> *path) const;\n  string TriePath(int node, const Topology &topology) const;\n\n  bool error_;\n  size_t future_size_;\n  Trie trie_;\n  int start_;\n  const SymbolTable *fsyms_, *osyms_;\n\n  FeatureGroupBuilder(const FeatureGroupBuilder &) = delete;\n  FeatureGroupBuilder &operator=(const FeatureGroupBuilder &) = delete;\n};\n\n//\n// Implementation of methods in `LinearFstDataBuilder`\n//\ntemplate <class A>\nbool LinearFstDataBuilder<A>::AddWord(Label word,\n                                      const std::vector<Label> &features) {\n  if (error_) {\n    FSTERROR() << \"Calling LinearFstDataBuilder<>::AddWord() at error state\";\n    return false;\n  }\n  if (word == LinearFstData<A>::kStartOfSentence ||\n      word == LinearFstData<A>::kEndOfSentence) {\n    LOG(WARNING) << \"Ignored: adding boundary label: \"\n                 << TranslateLabel(word, isyms_)\n                 << \"(start-of-sentence=\" << LinearFstData<A>::kStartOfSentence\n                 << \", end-of-sentence=\" << LinearFstData<A>::kEndOfSentence\n                 << \")\";\n    return false;\n  }\n  if (word <= 0) {\n    error_ = true;\n    FSTERROR() << \"Word label must be > 0; got \" << word;\n    return false;\n  }\n  if (word > max_input_label_) max_input_label_ = word;\n  // Make sure the word hasn't been added before\n  if (word_feat_map_.find(word) != word_feat_map_.end()) {\n    error_ = true;\n    FSTERROR() << \"Input word \" << TranslateLabel(word, isyms_)\n               << \" is added twice\";\n    return false;\n  }\n  // Store features\n  std::set<Label> *feats = &word_feat_map_[word];\n  for (size_t i = 0; i < features.size(); ++i) {\n    Label feat = features[i];\n    if (feat <= 0) {\n      error_ = true;\n      FSTERROR() << \"Feature label must be > 0; got \" << feat;\n      return false;\n    }\n    feats->insert(feat);\n  }\n  return true;\n}\n\ntemplate <class A>\nbool LinearFstDataBuilder<A>::AddWord(\n    Label word, const std::vector<Label> &word_features,\n    const std::vector<Label> &possible_output) {\n  if (error_) {\n    FSTERROR() << \"Calling LinearFstDataBuilder<>::AddWord() at error state\";\n    return false;\n  }\n  if (!AddWord(word, word_features)) return false;\n  // Store possible output constraint\n  if (possible_output.empty()) {\n    error_ = true;\n    FSTERROR() << \"Empty possible output constraint; \"\n               << \"use the two-parameter version if no constraint is need.\";\n    return false;\n  }\n  std::set<Label> *outputs = &word_output_map_[word];\n  for (size_t i = 0; i < possible_output.size(); ++i) {\n    Label output = possible_output[i];\n    if (output == LinearFstData<A>::kStartOfSentence ||\n        output == LinearFstData<A>::kEndOfSentence) {\n      LOG(WARNING) << \"Ignored: word = \" << TranslateLabel(word, isyms_)\n                   << \": adding boundary label as possible output: \" << output\n                   << \"(start-of-sentence=\"\n                   << LinearFstData<A>::kStartOfSentence\n                   << \", end-of-sentence=\" << LinearFstData<A>::kEndOfSentence\n                   << \")\";\n      continue;\n    }\n    if (output <= 0) {\n      error_ = true;\n      FSTERROR() << \"Output label must be > 0; got \" << output;\n      return false;\n    }\n    outputs->insert(output);\n    all_output_labels_.Insert(output);\n  }\n  return true;\n}\n\ntemplate <class A>\ninline int LinearFstDataBuilder<A>::AddGroup(size_t future_size) {\n  if (error_) {\n    FSTERROR() << \"Calling LinearFstDataBuilder<>::AddGroup() at error state\";\n    return -1;\n  }\n  size_t ret = groups_.size();\n  groups_.emplace_back(new FeatureGroupBuilder<A>(future_size, fsyms_, osyms_));\n  if (future_size > max_future_size_) max_future_size_ = future_size;\n  return ret;\n}\n\ntemplate <class A>\nbool LinearFstDataBuilder<A>::AddWeight(size_t group,\n                                        const std::vector<Label> &input,\n                                        const std::vector<Label> &output,\n                                        Weight weight) {\n  if (error_) {\n    FSTERROR() << \"Calling LinearFstDataBuilder<>::AddWeight() at error state\";\n    return false;\n  }\n  // Check well-formedness of boundary marks on the input.\n  {\n    bool start_in_middle = false, end_in_middle = false;\n    for (int i = 1; i < input.size(); ++i) {\n      if (input[i] == LinearFstData<A>::kStartOfSentence &&\n          input[i - 1] != LinearFstData<A>::kStartOfSentence)\n        start_in_middle = true;\n      if (input[i - 1] == LinearFstData<A>::kEndOfSentence &&\n          input[i] != LinearFstData<A>::kEndOfSentence)\n        end_in_middle = true;\n    }\n    if (start_in_middle) {\n      LOG(WARNING) << \"Ignored: start-of-sentence in the middle of the input!\";\n      LOG(WARNING) << \"\\tInput: \" << JoinLabels(input, fsyms_);\n      LOG(WARNING) << \"\\tOutput: \" << JoinLabels(output, osyms_);\n      return false;\n    }\n    if (end_in_middle) {\n      LOG(WARNING) << \"Ignored: end-of-sentence in the middle of the input!\";\n      LOG(WARNING) << \"\\tInput: \" << JoinLabels(input, fsyms_);\n      LOG(WARNING) << \"\\tOutput: \" << JoinLabels(output, osyms_);\n      return false;\n    }\n  }\n  // Check well-formedness of boundary marks on the output.\n  {\n    bool non_first_start = false, non_last_end = false;\n    for (int i = 1; i < output.size(); ++i) {\n      if (output[i] == LinearFstData<A>::kStartOfSentence)\n        non_first_start = true;\n      if (output[i - 1] == LinearFstData<A>::kEndOfSentence)\n        non_last_end = true;\n    }\n    if (non_first_start) {\n      LOG(WARNING) << \"Ignored: start-of-sentence not appearing \"\n                   << \"as the first label in the output!\";\n      LOG(WARNING) << \"\\tInput: \" << JoinLabels(input, fsyms_);\n      LOG(WARNING) << \"\\tOutput: \" << JoinLabels(output, osyms_);\n      return false;\n    }\n    if (non_last_end) {\n      LOG(WARNING) << \"Ignored: end-of-sentence not appearing \"\n                   << \"as the last label in the output!\";\n      LOG(WARNING) << \"\\tInput: \" << JoinLabels(input, fsyms_);\n      LOG(WARNING) << \"\\tOutput: \" << JoinLabels(output, osyms_);\n      return false;\n    }\n  }\n\n  for (size_t i = 0; i < input.size(); ++i) {\n    Label feat = input[i];\n    if (feat != LinearFstData<A>::kStartOfSentence &&\n        feat != LinearFstData<A>::kEndOfSentence && feat <= 0) {\n      error_ = true;\n      FSTERROR() << \"Feature label must be > 0; got \" << feat;\n      return false;\n    }\n    feat_groups_[feat].insert(group);\n  }\n  for (size_t i = 0; i < output.size(); ++i) {\n    Label label = output[i];\n    if (label != LinearFstData<A>::kStartOfSentence &&\n        label != LinearFstData<A>::kEndOfSentence && label <= 0) {\n      error_ = true;\n      FSTERROR() << \"Output label must be > 0; got \" << label;\n      return false;\n    }\n    if (label != LinearFstData<A>::kStartOfSentence &&\n        label != LinearFstData<A>::kEndOfSentence)\n      all_output_labels_.Insert(label);\n  }\n\n  // Everything looks good at this point (more checks on the way in\n  // the feature group). Add this feature weight.\n  bool added = groups_[group]->AddWeight(input, output, weight);\n  if (groups_[group]->Error()) {\n    error_ = true;\n    FSTERROR() << \"FeatureGroupBuilder<>::AddWeight() failed\";\n    return false;\n  }\n  return added;\n}\n\ntemplate <class A>\nLinearFstData<A> *LinearFstDataBuilder<A>::Dump() {\n  if (error_) {\n    FSTERROR() << \"Calling LinearFstDataBuilder<>::Dump() at error state\";\n    return nullptr;\n  }\n\n  std::unique_ptr<LinearFstData<A>> data(new LinearFstData<A>());\n  data->max_future_size_ = max_future_size_;\n  data->max_input_label_ = max_input_label_;\n\n  // Feature groups; free builders after it's dumped.\n  data->groups_.resize(groups_.size());\n  for (int group = 0; group != groups_.size(); ++group) {\n    FeatureGroup<A> *new_group = groups_[group]->Dump(max_future_size_);\n    if (new_group == nullptr) {\n      error_ = true;\n      FSTERROR() << \"Error in dumping group \" << group;\n      return nullptr;\n    }\n    data->groups_[group].reset(new_group);\n    groups_[group].reset();\n    VLOG(1) << \"Group \" << group << \": \" << new_group->Stats();\n  }\n\n  // Per-group feature mapping\n  data->group_feat_map_.Init(data->NumGroups(), max_input_label_ + 1);\n  for (Label word = 1; word <= max_input_label_; ++word) {\n    typename std::map<Label, std::set<Label>>::const_iterator it =\n        word_feat_map_.find(word);\n    if (it == word_feat_map_.end()) continue;\n    for (typename std::set<Label>::const_iterator oit = it->second.begin();\n         oit != it->second.end(); ++oit) {\n      Label feat = *oit;\n      typename std::map<Label, std::set<size_t>>::const_iterator jt =\n          feat_groups_.find(feat);\n      if (jt == feat_groups_.end()) continue;\n      for (std::set<size_t>::const_iterator git = jt->second.begin();\n           git != jt->second.end(); ++git) {\n        size_t group_id = *git;\n        if (!data->group_feat_map_.Set(group_id, word, feat)) {\n          error_ = true;\n          return nullptr;\n        }\n      }\n    }\n  }\n\n  // Possible output labels\n  {\n    std::vector<typename LinearFstData<A>::InputAttribute> *input_attribs =\n        &data->input_attribs_;\n    std::vector<Label> *output_pool = &data->output_pool_;\n    input_attribs->resize(max_input_label_ + 1);\n    for (Label word = 0; word <= max_input_label_; ++word) {\n      typename std::map<Label, std::set<Label>>::const_iterator it =\n          word_output_map_.find(word);\n      if (it == word_output_map_.end()) {\n        (*input_attribs)[word].output_begin = 0;\n        (*input_attribs)[word].output_length = 0;\n      } else {\n        (*input_attribs)[word].output_begin = output_pool->size();\n        (*input_attribs)[word].output_length = it->second.size();\n        for (typename std::set<Label>::const_iterator oit = it->second.begin();\n             oit != it->second.end(); ++oit) {\n          Label olabel = *oit;\n          output_pool->push_back(olabel);\n        }\n      }\n    }\n  }\n\n  for (typename CompactSet<Label, kNoLabel>::const_iterator it =\n           all_output_labels_.Begin();\n       it != all_output_labels_.End(); ++it)\n    data->output_set_.push_back(*it);\n\n  error_ = true;  // prevent future calls on this object\n  return data.release();\n}\n\n//\n// Implementation of methods in `LinearClassifierFstDataBuilder`\n//\ntemplate <class A>\ninline bool LinearClassifierFstDataBuilder<A>::AddWord(\n    Label word, const std::vector<Label> &features) {\n  if (error_) {\n    FSTERROR() << \"Calling LinearClassifierFstDataBuilder<>::AddWord() at \"\n                  \"error state\";\n    return false;\n  }\n  bool added = builder_.AddWord(word, features);\n  if (builder_.Error()) error_ = true;\n  return added;\n}\n\ntemplate <class A>\ninline int LinearClassifierFstDataBuilder<A>::AddGroup() {\n  if (error_) {\n    FSTERROR() << \"Calling LinearClassifierFstDataBuilder<>::AddGroup() at \"\n                  \"error state\";\n    return -1;\n  }\n  for (int i = 0; i < num_classes_; ++i) builder_.AddGroup(0);\n  if (builder_.Error()) {\n    error_ = true;\n    return -1;\n  }\n  return num_groups_++;\n}\n\ntemplate <class A>\ninline bool LinearClassifierFstDataBuilder<A>::AddWeight(\n    size_t group, const std::vector<Label> &input, Label pred, Weight weight) {\n  if (error_) {\n    FSTERROR() << \"Calling LinearClassifierFstDataBuilder<>::AddWeight() at \"\n                  \"error state\";\n    return false;\n  }\n  if (pred <= 0 || pred > num_classes_) {\n    FSTERROR() << \"Out-of-range prediction label: \" << pred\n               << \" (num classes = \" << num_classes_ << \")\";\n    error_ = true;\n    return false;\n  }\n  size_t real_group = group * num_classes_ + pred - 1;\n  bool added = builder_.AddWeight(real_group, input, empty_, weight);\n  if (builder_.Error()) error_ = true;\n  return added;\n}\n\ntemplate <class A>\ninline LinearFstData<A> *LinearClassifierFstDataBuilder<A>::Dump() {\n  if (error_) {\n    FSTERROR()\n        << \"Calling LinearClassifierFstDataBuilder<>::Dump() at error state\";\n    return nullptr;\n  }\n  LinearFstData<A> *data = builder_.Dump();\n  error_ = true;\n  return data;\n}\n\n//\n// Implementation of methods in `FeatureGroupBuilder`\n//\ntemplate <class A>\nbool FeatureGroupBuilder<A>::AddWeight(const std::vector<Label> &input,\n                                       const std::vector<Label> &output,\n                                       Weight weight) {\n  if (error_) {\n    FSTERROR() << \"Calling FeatureGroupBuilder<>::AddWeight() at error state\";\n    return false;\n  }\n\n  // `LinearFstDataBuilder<>::AddWeight()` ensures prefix/suffix\n  // properties for us. We can directly count.\n  int num_input_start = 0;\n  while (num_input_start < input.size() &&\n         input[num_input_start] == LinearFstData<A>::kStartOfSentence)\n    ++num_input_start;\n  int num_output_start = 0;\n  while (num_output_start < output.size() &&\n         output[num_output_start] == LinearFstData<A>::kStartOfSentence)\n    ++num_output_start;\n  int num_input_end = 0;\n  for (int i = input.size() - 1;\n       i >= 0 && input[i] == LinearFstData<A>::kEndOfSentence; --i)\n    ++num_input_end;\n  int num_output_end = 0;\n  for (int i = output.size() - 1;\n       i >= 0 && output[i] == LinearFstData<A>::kEndOfSentence; --i)\n    ++num_output_end;\n\n  DCHECK_LE(num_output_end, 1);\n\n  if (input.size() - num_input_start < future_size_) {\n    LOG(WARNING) << \"Ignored: start-of-sentence in the future!\";\n    LOG(WARNING) << \"\\tInput: \" << JoinLabels(input, fsyms_);\n    LOG(WARNING) << \"\\tOutput: \" << JoinLabels(output, fsyms_);\n    return false;\n  }\n  if (num_input_start > 0 &&\n      input.size() - future_size_ - num_input_start <\n          output.size() - num_output_start) {\n    LOG(WARNING) << \"Ignored: matching start-of-sentence with actual output!\";\n    LOG(WARNING) << \"\\tInput: \" << JoinLabels(input, fsyms_);\n    LOG(WARNING) << \"\\tOutput: \" << JoinLabels(output, osyms_);\n    return false;\n  }\n  if (num_output_start > 0 &&\n      input.size() - future_size_ - num_input_start >\n          output.size() - num_output_start) {\n    LOG(WARNING) << \"Ignored: matching start-of-sentence with actual input!\";\n    LOG(WARNING) << \"\\tInput: \" << JoinLabels(input, fsyms_);\n    LOG(WARNING) << \"\\tOutput: \" << JoinLabels(output, osyms_);\n    return false;\n  }\n  // The following two require `num_output_end` <= 1.\n  if (num_input_end > future_size_ && num_input_end - future_size_ != 1) {\n    LOG(WARNING) << \"Ignored: matching end-of-sentence with actual output!\";\n    LOG(WARNING) << \"\\tInput: \" << JoinLabels(input, fsyms_);\n    LOG(WARNING) << \"\\tOutput: \" << JoinLabels(output, osyms_);\n    return false;\n  }\n  if (num_output_end > 0 &&\n      ((input.size() == future_size_ && future_size_ != num_input_end) ||\n       (input.size() > future_size_ &&\n        num_input_end != future_size_ + num_output_end))) {\n    LOG(WARNING) << \"Ignored: matching end-of-sentence with actual input!\";\n    LOG(WARNING) << \"\\tInput: \" << JoinLabels(input, fsyms_);\n    LOG(WARNING) << \"\\tOutput: \" << JoinLabels(output, osyms_);\n    return false;\n  }\n  // Check if the context has no other labels than boundary marks\n  // (such features are useless).\n  if (num_input_start + num_input_end == input.size() &&\n      num_output_start + num_output_end == output.size()) {\n    LOG(WARNING)\n        << \"Ignored: feature context consisting of only boundary marks!\";\n    LOG(WARNING) << \"\\tInput: \" << JoinLabels(input, fsyms_);\n    LOG(WARNING) << \"\\tOutput: \" << JoinLabels(output, osyms_);\n    return false;\n  }\n\n  // Start point for insertion in the trie. Insert at `start_` iff the\n  // beginning of the context is non-consumed start-of-sentence.\n  int cur = (num_input_start == 0 && num_output_start <= future_size_)\n                ? trie_.Root()\n                : start_;\n  // Skip all input start-of-sentence marks\n  size_t ipos = num_input_start;\n  // Skip to keep at most `future_size_` start-of-sentence marks\n  size_t opos =\n      num_output_start <= future_size_ ? 0 : num_output_start - future_size_;\n  // Skip `num_output_end` end-of-sentence marks on both input and output\n  size_t iend = !input.empty() ? input.size() - num_output_end : 0,\n         oend = output.size() - num_output_end;\n  // Further, when output is empty, keep at most `future_size_`\n  // end-of-sentence marks on input.\n  if (output.empty() && num_input_end > future_size_)\n    iend = input.size() - num_input_end + future_size_;\n\n  // Actual feature context is (input[ipos:iend], output[opos:oend]).\n\n  // Pad `kNoLabel` as don't cares on the shorter of actual `input`\n  // and `output`.\n  const size_t effective_input_size = iend - ipos,\n               effective_output_size = oend - opos;\n  if (effective_input_size > effective_output_size) {\n    for (size_t pad = effective_input_size - effective_output_size; pad != 0;\n         --pad, ++ipos)\n      cur = trie_.Insert(cur, InputOutputLabel(input[ipos], kNoLabel));\n  } else if (effective_input_size < effective_output_size) {\n    for (size_t pad = effective_output_size - effective_input_size; pad != 0;\n         --pad, ++opos)\n      cur = trie_.Insert(cur, InputOutputLabel(kNoLabel, output[opos]));\n  }\n  CHECK_EQ(iend - ipos, oend - opos);\n  for (; ipos != iend; ++ipos, ++opos)\n    cur = trie_.Insert(cur, InputOutputLabel(input[ipos], output[opos]));\n  // We only need to attach final weight when there is an output\n  // end-of-sentence. When there is only end-of-sentence on the input,\n  // they are all consumed as the end-of-sentence paddings from\n  // `LinearFstImpl<>::ShiftBuffer()`. `LinearFstImpl<>::Expand()`\n  // and `LinearFstImpl<>::MatchInput()` ensures no other\n  // transition takes place after consuming the padding.\n  if (num_output_end > 0 || (output.empty() && num_input_end > future_size_))\n    trie_[cur].final_weight = Times(trie_[cur].final_weight, weight);\n  else\n    trie_[cur].weight = Times(trie_[cur].weight, weight);\n\n  return true;\n}\n\ntemplate <class A>\nFeatureGroup<A> *FeatureGroupBuilder<A>::Dump(size_t max_future_size) {\n  if (error_) {\n    FSTERROR() << \"Calling FeatureGroupBuilder<>::PreAccumulateWeights() \"\n               << \"at error state\";\n    return nullptr;\n  }\n\n  if (max_future_size < future_size_) {\n    error_ = true;\n    FSTERROR() << \"max_future_size (= \" << max_future_size\n               << \") is smaller the builder's future_size (= \" << future_size_\n               << \")\";\n    return nullptr;\n  }\n\n  BuildBackLinks();\n  if (error_) return nullptr;\n  PreAccumulateWeights();  // does not fail\n\n  FeatureGroup<A> *ret =\n      new FeatureGroup<A>(max_future_size - future_size_, start_);\n\n  // Walk around the trie to compute next states\n  ret->next_state_.resize(trie_.NumNodes());\n  const Topology &topology = trie_.TrieTopology();\n  for (int i = 0; i < topology.NumNodes(); ++i) {\n    int next = i;\n    while (next != topology.Root() && topology.ChildrenOf(next).empty() &&\n           trie_[next].final_weight ==\n               trie_[trie_[next].back_link].final_weight)\n      next = trie_[next].back_link;\n    ret->next_state_[i] = next;\n  }\n\n  // Copy the trie\n  typename FeatureGroup<A>::Trie store_trie(trie_);\n  ret->trie_.swap(store_trie);\n\n  // Put the builder at error state to prevent repeated call of `Dump()`.\n  error_ = true;\n  return ret;\n}\n\ntemplate <class A>\nint FeatureGroupBuilder<A>::FindFirstMatch(InputOutputLabel label, int parent,\n                                           int *hop) const {\n  int hop_count = 0;\n  int ret = kNoTrieNodeId;\n  for (; parent >= 0; parent = trie_[parent].back_link, ++hop_count) {\n    int next = trie_.Find(parent, label);\n    if (next != kNoTrieNodeId) {\n      ret = next;\n      break;\n    }\n  }\n  if (hop != nullptr) *hop = hop_count;\n  return ret;\n}\n\ntemplate <class A>\nvoid FeatureGroupBuilder<A>::BuildBackLinks() {\n  // Breadth first search from the root. In the case where we only\n  // have the input label, the immedate back-off is simply the longest\n  // suffix of the current node that is also in the trie. For a node\n  // reached from its parent with label L, we can simply walk through\n  // the parent's back-off chain to find the first state with an arc\n  // of the same label L. The uniqueness is always\n  // guanranteed. However, in the case with both input and output\n  // labels, it is possible to back off by removing first labels from\n  // either side, which in general causes non-uniqueness.\n\n  const Topology &topology = trie_.TrieTopology();\n  std::queue<int> q;  // all enqueued or visited nodes have known links\n\n  // Note: nodes have back link initialized to -1 in their\n  // constructor.\n  q.push(trie_.Root());\n  while (!error_ && !q.empty()) {\n    int parent = q.front();\n    q.pop();\n    // Find links for every child\n    const typename Topology::NextMap &children = topology.ChildrenOf(parent);\n    for (typename Topology::NextMap::const_iterator eit = children.begin();\n         eit != children.end(); ++eit) {\n      const std::pair<InputOutputLabel, int> &edge = *eit;\n      InputOutputLabel label = edge.first;\n      int child = edge.second;\n      if (label.input == kNoLabel || label.output == kNoLabel) {\n        // Label pairs from root to here all have one and only one\n        // `kNoLabel` on the same side; equivalent to the\n        // \"longest-suffix\" case.\n        trie_[child].back_link =\n            FindFirstMatch(label, trie_[parent].back_link, nullptr);\n      } else {\n        // Neither side is `kNoLabel` at this point, there are\n        // three possible ways to back-off: if the parent backs\n        // off to some context with only one side non-empty, the\n        // empty side may remain empty; or else an exact match of\n        // both sides is needed. Try to find all three possible\n        // backs and look for the closest one (in terms of hops\n        // along the parent's back-off chain).\n        int only_input_hop, only_output_hop, full_hop;\n        int only_input_link =\n                FindFirstMatch(InputOutputLabel(label.input, kNoLabel), parent,\n                               &only_input_hop),\n            only_output_link =\n                FindFirstMatch(InputOutputLabel(kNoLabel, label.output), parent,\n                               &only_output_hop),\n            full_link =\n                FindFirstMatch(label, trie_[parent].back_link, &full_hop);\n        if (only_input_link != -1 && only_output_link != -1) {\n          error_ = true;\n          FSTERROR() << \"Branching back-off chain:\\n\"\n                     << \"\\tnode \" << child << \": \" << TriePath(child, topology)\n                     << \"\\n\"\n                     << \"\\tcan back-off to node \" << only_input_link << \": \"\n                     << TriePath(only_input_link, topology) << \"\\n\"\n                     << \"\\tcan back-off to node \" << only_output_link << \": \"\n                     << TriePath(only_output_link, topology);\n          return;\n        } else if (full_link != -1) {\n          ++full_hop;\n          if (full_hop <= only_input_hop && full_hop <= only_output_hop) {\n            trie_[child].back_link = full_link;\n          } else {\n            error_ = true;\n            int problem_link = only_input_link != kNoTrieNodeId\n                                   ? only_input_link\n                                   : only_output_link;\n            CHECK_NE(problem_link, kNoTrieNodeId);\n            FSTERROR() << \"Branching back-off chain:\\n\"\n                       << \"\\tnode \" << child << \": \"\n                       << TriePath(child, topology) << \"\\n\"\n                       << \"\\tcan back-off to node \" << full_link << \": \"\n                       << TriePath(full_link, topology) << \"\\n\"\n                       << \"tcan back-off to node \" << problem_link << \": \"\n                       << TriePath(problem_link, topology);\n            return;\n          }\n        } else {\n          trie_[child].back_link =\n              only_input_link != -1 ? only_input_link : only_output_link;\n        }\n      }\n      if (error_) break;\n      // Point to empty context (root) when no back-off can be found\n      if (trie_[child].back_link == -1) trie_[child].back_link = 0;\n      q.push(child);\n    }\n  }\n}\n\ntemplate <class A>\nvoid FeatureGroupBuilder<A>::PreAccumulateWeights() {\n  std::vector<bool> visited(trie_.NumNodes(), false);\n  visited[trie_.Root()] = true;\n\n  for (size_t i = 0; i != trie_.NumNodes(); ++i) {\n    std::stack<int> back_offs;\n    for (int j = i; !visited[j]; j = trie_[j].back_link) back_offs.push(j);\n    while (!back_offs.empty()) {\n      int j = back_offs.top();\n      back_offs.pop();\n      WeightBackLink &node = trie_[j];\n      node.weight = Times(node.weight, trie_[node.back_link].weight);\n      node.final_weight =\n          Times(node.final_weight, trie_[node.back_link].final_weight);\n      visited[j] = true;\n    }\n  }\n}\n\ntemplate <class A>\nbool FeatureGroupBuilder<A>::TrieDfs(\n    const Topology &topology, int cur, int target,\n    std::vector<InputOutputLabel> *path) const {\n  if (cur == target) return true;\n  const typename Topology::NextMap &children = topology.ChildrenOf(cur);\n  for (typename Topology::NextMap::const_iterator eit = children.begin();\n       eit != children.end(); ++eit) {\n    const std::pair<InputOutputLabel, int> &edge = *eit;\n    path->push_back(edge.first);\n    if (TrieDfs(topology, edge.second, target, path)) return true;\n    path->pop_back();\n  }\n  return false;\n}\n\ntemplate <class A>\nstring FeatureGroupBuilder<A>::TriePath(int node,\n                                        const Topology &topology) const {\n  std::vector<InputOutputLabel> labels;\n  TrieDfs(topology, topology.Root(), node, &labels);\n  bool first = true;\n  std::ostringstream strm;\n  for (typename std::vector<InputOutputLabel>::const_iterator it =\n           labels.begin();\n       it != labels.end(); ++it) {\n    InputOutputLabel i = *it;\n    if (first)\n      first = false;\n    else\n      strm << \", \";\n    strm << \"(\" << TranslateLabel(i.input, fsyms_) << \", \"\n         << TranslateLabel(i.output, osyms_) << \")\";\n  }\n  return strm.str();\n}\n\ninline string TranslateLabel(int64 label, const SymbolTable *syms) {\n  string ret;\n  if (syms != nullptr) ret += syms->Find(label);\n  if (ret.empty()) {\n    std::ostringstream strm;\n    strm << '<' << label << '>';\n    ret = strm.str();\n  }\n  return ret;\n}\n\ntemplate <class Iterator>\nstring JoinLabels(Iterator begin, Iterator end, const SymbolTable *syms) {\n  if (begin == end) return \"<empty>\";\n  std::ostringstream strm;\n  bool first = true;\n  for (Iterator it = begin; it != end; ++it) {\n    if (first)\n      first = false;\n    else\n      strm << '|';\n    strm << TranslateLabel(*it, syms);\n  }\n  return strm.str();\n}\n\ntemplate <class Label>\nstring JoinLabels(const std::vector<Label> &labels, const SymbolTable *syms) {\n  return JoinLabels(labels.begin(), labels.end(), syms);\n}\n\ntemplate <class A>\ntypename A::Label GuessStartOrEnd(std::vector<typename A::Label> *sequence,\n                                  typename A::Label boundary) {\n  const size_t length = sequence->size();\n  std::vector<bool> non_boundary_on_left(length, false),\n      non_boundary_on_right(length, false);\n  for (size_t i = 1; i < length; ++i) {\n    non_boundary_on_left[i] =\n        non_boundary_on_left[i - 1] || (*sequence)[i - 1] != boundary;\n    non_boundary_on_right[length - 1 - i] = non_boundary_on_right[length - i] ||\n                                            (*sequence)[length - i] != boundary;\n  }\n  int unresolved = 0;\n  for (size_t i = 0; i < length; ++i) {\n    if ((*sequence)[i] != boundary) continue;\n    const bool left = non_boundary_on_left[i], right = non_boundary_on_right[i];\n    if (left && right) {\n      // Boundary in the middle\n      LOG(WARNING) << \"Boundary label in the middle of the sequence! position: \"\n                   << i << \"; boundary: \" << boundary\n                   << \"; sequence: \" << JoinLabels(*sequence, nullptr);\n      LOG(WARNING)\n          << \"This is an invalid sequence anyway so I will set it to start.\";\n      (*sequence)[i] = LinearFstData<A>::kStartOfSentence;\n    } else if (left && !right) {\n      // Can only be end\n      (*sequence)[i] = LinearFstData<A>::kEndOfSentence;\n    } else if (!left && right) {\n      // Can only be start\n      (*sequence)[i] = LinearFstData<A>::kStartOfSentence;\n    } else {\n      // !left && !right; can't really tell\n      ++unresolved;\n    }\n  }\n  return unresolved;\n}\n\n}  // namespace fst\n\n#endif  // FST_EXTENSIONS_LINEAR_LINEAR_FST_DATA_BUILDER_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/extensions/linear/linear-fst-data.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Data structures for storing and looking up the actual feature weights.\n\n#ifndef FST_EXTENSIONS_LINEAR_LINEAR_FST_DATA_H_\n#define FST_EXTENSIONS_LINEAR_LINEAR_FST_DATA_H_\n\n#include <memory>\n#include <numeric>\n#include <string>\n#include <utility>\n#include <vector>\n\n#include <fst/compat.h>\n#include <fst/fst.h>\n\n#include <fst/extensions/linear/trie.h>\n\nnamespace fst {\n\n// Forward declarations\ntemplate <class A>\nclass LinearFstDataBuilder;\ntemplate <class A>\nclass FeatureGroup;\n\n// Immutable data storage of the feature weights in a linear\n// model. Produces state tuples that represent internal states of a\n// LinearTaggerFst. Object of this class can only be constructed via\n// either `LinearFstDataBuilder::Dump()` or `LinearFstData::Read()`\n// and usually used as refcount'd object shared across mutiple\n// `LinearTaggerFst` copies.\n//\n// TODO(wuke): more efficient trie implementation\ntemplate <class A>\nclass LinearFstData {\n public:\n  friend class LinearFstDataBuilder<A>;  // For builder access\n\n  typedef typename A::Label Label;\n  typedef typename A::Weight Weight;\n\n  // Sentence boundary labels. Both of them are negative labels other\n  // than `kNoLabel`.\n  static const Label kStartOfSentence;\n  static const Label kEndOfSentence;\n\n  // Constructs empty data; for non-trivial ways of construction see\n  // `Read()` and `LinearFstDataBuilder`.\n  LinearFstData()\n      : max_future_size_(0), max_input_label_(1), input_attribs_(1) {}\n\n  // Appends the state tuple of the start state to `output`, where\n  // each tuple holds the node ids of a trie for each feature group.\n  void EncodeStartState(std::vector<Label> *output) const {\n    for (int i = 0; i < NumGroups(); ++i) output->push_back(GroupStartState(i));\n  }\n\n  // Takes a transition from the trie states stored in\n  // `(trie_state_begin, trie_state_end)` with input label `ilabel`\n  // and output label `olabel`; appends the destination state tuple to\n  // `next` and multiplies the weight of the transition onto\n  // `weight`. `next` should be the shifted input buffer of the caller\n  // in `LinearTaggerFstImpl` (i.e. of size `LinearTaggerFstImpl::delay_`;\n  // the last element is `ilabel`).\n  template <class Iterator>\n  void TakeTransition(Iterator buffer_end, Iterator trie_state_begin,\n                      Iterator trie_state_end, Label ilabel, Label olabel,\n                      std::vector<Label> *next, Weight *weight) const;\n\n  // Returns the final weight of the given trie state sequence.\n  template <class Iterator>\n  Weight FinalWeight(Iterator trie_state_begin, Iterator trie_state_end) const;\n\n  // Returns the start trie state of the given group.\n  Label GroupStartState(int group_id) const {\n    return groups_[group_id]->Start();\n  }\n\n  // Takes a transition only within the given group. Returns the\n  // destination trie state and multiplies the weight onto `weight`.\n  Label GroupTransition(int group_id, int trie_state, Label ilabel,\n                        Label olabel, Weight *weight) const;\n\n  // Returns the final weight of the given trie state in the given group.\n  Weight GroupFinalWeight(int group_id, int trie_state) const {\n    return groups_[group_id]->FinalWeight(trie_state);\n  }\n\n  Label MinInputLabel() const { return 1; }\n\n  Label MaxInputLabel() const { return max_input_label_; }\n\n  // Returns the maximum future size of all feature groups. Future is\n  // the look-ahead window of a feature, e.g. if a feature looks at\n  // the next 2 words after the current input, then the future size is\n  // 2. There is no look-ahead for output. Features inside a single\n  // `FeatureGroup` must have equal future size.\n  size_t MaxFutureSize() const { return max_future_size_; }\n\n  // Returns the number of feature groups\n  size_t NumGroups() const { return groups_.size(); }\n\n  // Returns the range of possible output labels for an input label.\n  std::pair<typename std::vector<Label>::const_iterator,\n            typename std::vector<Label>::const_iterator>\n  PossibleOutputLabels(Label word) const;\n\n  static LinearFstData<A> *Read(std::istream &strm);  // NOLINT\n  std::ostream &Write(std::ostream &strm) const;      // NOLINT\n\n private:\n  // Offsets in `output_pool_`\n  struct InputAttribute {\n    size_t output_begin, output_length;\n\n    std::istream &Read(std::istream &strm);         // NOLINT\n    std::ostream &Write(std::ostream &strm) const;  // NOLINT\n  };\n\n  // Mapping from input label to per-group feature label\n  class GroupFeatureMap;\n\n  // Translates the input label into input feature label of group\n  // `group`; returns `kNoLabel` when there is no feature for that\n  // group.\n  Label FindFeature(size_t group, Label word) const;\n\n  size_t max_future_size_;\n  Label max_input_label_;\n  std::vector<std::unique_ptr<const FeatureGroup<A>>> groups_;\n  std::vector<InputAttribute> input_attribs_;\n  std::vector<Label> output_pool_, output_set_;\n  GroupFeatureMap group_feat_map_;\n\n  LinearFstData(const LinearFstData &) = delete;\n  LinearFstData &operator=(const LinearFstData &) = delete;\n};\n\ntemplate <class A>\nconst typename A::Label LinearFstData<A>::kStartOfSentence = -3;\ntemplate <class A>\nconst typename A::Label LinearFstData<A>::kEndOfSentence = -2;\n\ntemplate <class A>\ntemplate <class Iterator>\nvoid LinearFstData<A>::TakeTransition(Iterator buffer_end,\n                                      Iterator trie_state_begin,\n                                      Iterator trie_state_end, Label ilabel,\n                                      Label olabel, std::vector<Label> *next,\n                                      Weight *weight) const {\n  DCHECK_EQ(trie_state_end - trie_state_begin, groups_.size());\n  DCHECK(ilabel > 0 || ilabel == kEndOfSentence);\n  DCHECK(olabel > 0 || olabel == kStartOfSentence);\n  size_t group_id = 0;\n  for (Iterator it = trie_state_begin; it != trie_state_end; ++it, ++group_id) {\n    size_t delay = groups_[group_id]->Delay();\n    // On the buffer, there may also be `kStartOfSentence` from the\n    // initial empty buffer.\n    Label real_ilabel = delay == 0 ? ilabel : *(buffer_end - delay);\n    next->push_back(\n        GroupTransition(group_id, *it, real_ilabel, olabel, weight));\n  }\n}\n\ntemplate <class A>\ntypename A::Label LinearFstData<A>::GroupTransition(int group_id,\n                                                    int trie_state,\n                                                    Label ilabel, Label olabel,\n                                                    Weight *weight) const {\n  Label group_ilabel = FindFeature(group_id, ilabel);\n  return groups_[group_id]->Walk(trie_state, group_ilabel, olabel, weight);\n}\n\ntemplate <class A>\ntemplate <class Iterator>\ninline typename A::Weight LinearFstData<A>::FinalWeight(\n    Iterator trie_state_begin, Iterator trie_state_end) const {\n  DCHECK_EQ(trie_state_end - trie_state_begin, groups_.size());\n  size_t group_id = 0;\n  Weight accum = Weight::One();\n  for (Iterator it = trie_state_begin; it != trie_state_end; ++it, ++group_id)\n    accum = Times(accum, GroupFinalWeight(group_id, *it));\n  return accum;\n}\n\ntemplate <class A>\ninline std::pair<typename std::vector<typename A::Label>::const_iterator,\n                 typename std::vector<typename A::Label>::const_iterator>\nLinearFstData<A>::PossibleOutputLabels(Label word) const {\n  const InputAttribute &attrib = input_attribs_[word];\n  if (attrib.output_length == 0)\n    return std::make_pair(output_set_.begin(), output_set_.end());\n  else\n    return std::make_pair(\n        output_pool_.begin() + attrib.output_begin,\n        output_pool_.begin() + attrib.output_begin + attrib.output_length);\n}\n\ntemplate <class A>\ninline LinearFstData<A> *LinearFstData<A>::Read(std::istream &strm) {  // NOLINT\n  std::unique_ptr<LinearFstData<A>> data(new LinearFstData<A>());\n  ReadType(strm, &(data->max_future_size_));\n  ReadType(strm, &(data->max_input_label_));\n  // Feature groups\n  size_t num_groups = 0;\n  ReadType(strm, &num_groups);\n  data->groups_.resize(num_groups);\n  for (size_t i = 0; i < num_groups; ++i)\n    data->groups_[i].reset(FeatureGroup<A>::Read(strm));\n  // Other data\n  ReadType(strm, &(data->input_attribs_));\n  ReadType(strm, &(data->output_pool_));\n  ReadType(strm, &(data->output_set_));\n  ReadType(strm, &(data->group_feat_map_));\n  if (strm) {\n    return data.release();\n  } else {\n    return nullptr;\n  }\n}\n\ntemplate <class A>\ninline std::ostream &LinearFstData<A>::Write(\n    std::ostream &strm) const {  // NOLINT\n  WriteType(strm, max_future_size_);\n  WriteType(strm, max_input_label_);\n  // Feature groups\n  WriteType(strm, groups_.size());\n  for (size_t i = 0; i < groups_.size(); ++i) {\n    groups_[i]->Write(strm);\n  }\n  // Other data\n  WriteType(strm, input_attribs_);\n  WriteType(strm, output_pool_);\n  WriteType(strm, output_set_);\n  WriteType(strm, group_feat_map_);\n  return strm;\n}\n\ntemplate <class A>\ntypename A::Label LinearFstData<A>::FindFeature(size_t group,\n                                                Label word) const {\n  DCHECK(word > 0 || word == kStartOfSentence || word == kEndOfSentence);\n  if (word == kStartOfSentence || word == kEndOfSentence)\n    return word;\n  else\n    return group_feat_map_.Find(group, word);\n}\n\ntemplate <class A>\ninline std::istream &LinearFstData<A>::InputAttribute::Read(\n    std::istream &strm) {  // NOLINT\n  ReadType(strm, &output_begin);\n  ReadType(strm, &output_length);\n  return strm;\n}\n\ntemplate <class A>\ninline std::ostream &LinearFstData<A>::InputAttribute::Write(\n    std::ostream &strm) const {  // NOLINT\n  WriteType(strm, output_begin);\n  WriteType(strm, output_length);\n  return strm;\n}\n\n// Forward declaration\ntemplate <class A>\nclass FeatureGroupBuilder;\n\n// An immutable grouping of features with similar context shape. Like\n// `LinearFstData`, this can only be constructed via `Read()` or\n// via its builder.\n//\n// Internally it uses a trie to store all feature n-grams and their\n// weights. The label of a trie edge is a pair (feat, olabel) of\n// labels. They can be either positive (ordinary label), `kNoLabel`,\n// `kStartOfSentence`, or `kEndOfSentence`. `kNoLabel` usually means\n// matching anything, with one exception: from the root of the trie,\n// there is a special (kNoLabel, kNoLabel) that leads to the implicit\n// start-of-sentence state. This edge is never actually matched\n// (`FindFirstMatch()` ensures this).\ntemplate <class A>\nclass FeatureGroup {\n public:\n  friend class FeatureGroupBuilder<A>;  // for builder access\n\n  typedef typename A::Label Label;\n  typedef typename A::Weight Weight;\n\n  int Start() const { return start_; }\n\n  // Finds destination node from `cur` by consuming `ilabel` and\n  // `olabel`. The transition weight is multiplied onto `weight`.\n  int Walk(int cur, Label ilabel, Label olabel, Weight *weight) const;\n\n  // Returns the final weight of the current trie state. Only valid if\n  // the state is already known to be part of a final state (see\n  // `LinearFstData<>::CanBeFinal()`).\n  Weight FinalWeight(int trie_state) const {\n    return trie_[trie_state].final_weight;\n  }\n\n  static FeatureGroup<A> *Read(std::istream &strm) {  // NOLINT\n    size_t delay;\n    ReadType(strm, &delay);\n    int start;\n    ReadType(strm, &start);\n    Trie trie;\n    ReadType(strm, &trie);\n    std::unique_ptr<FeatureGroup<A>> ret(new FeatureGroup<A>(delay, start));\n    ret->trie_.swap(trie);\n    ReadType(strm, &ret->next_state_);\n    if (strm) {\n      return ret.release();\n    } else {\n      return nullptr;\n    }\n  }\n\n  std::ostream &Write(std::ostream &strm) const {  // NOLINT\n    WriteType(strm, delay_);\n    WriteType(strm, start_);\n    WriteType(strm, trie_);\n    WriteType(strm, next_state_);\n    return strm;\n  }\n\n  size_t Delay() const { return delay_; }\n\n  string Stats() const;\n\n private:\n  // Label along the arcs on the trie. `kNoLabel` means anything\n  // (non-negative label) can match; both sides holding `kNoLabel`\n  // is not allow; otherwise the label is > 0 (enforced by\n  // `LinearFstDataBuilder::AddWeight()`).\n  struct InputOutputLabel;\n  struct InputOutputLabelHash;\n\n  // Data to be stored on the trie\n  struct WeightBackLink {\n    int back_link;\n    Weight weight, final_weight;\n\n    WeightBackLink()\n        : back_link(kNoTrieNodeId),\n          weight(Weight::One()),\n          final_weight(Weight::One()) {}\n\n    std::istream &Read(std::istream &strm) {  // NOLINT\n      ReadType(strm, &back_link);\n      ReadType(strm, &weight);\n      ReadType(strm, &final_weight);\n      return strm;\n    }\n\n    std::ostream &Write(std::ostream &strm) const {  // NOLINT\n      WriteType(strm, back_link);\n      WriteType(strm, weight);\n      WriteType(strm, final_weight);\n      return strm;\n    }\n  };\n\n  typedef FlatTrieTopology<InputOutputLabel, InputOutputLabelHash> Topology;\n  typedef MutableTrie<InputOutputLabel, WeightBackLink, Topology> Trie;\n\n  explicit FeatureGroup(size_t delay, int start)\n      : delay_(delay), start_(start) {}\n\n  // Finds the first node with an arc with `label` following the\n  // back-off chain of `parent`. Returns the node index or\n  // `kNoTrieNodeId` when not found.\n  int FindFirstMatch(InputOutputLabel label, int parent) const;\n\n  size_t delay_;\n  int start_;\n  Trie trie_;\n  // Where to go after hitting this state. When we reach a state with\n  // no child and with no additional final weight (i.e. its final\n  // weight is the same as its back-off), we can immediately go to its\n  // back-off state.\n  std::vector<int> next_state_;\n\n  FeatureGroup(const FeatureGroup &) = delete;\n  FeatureGroup &operator=(const FeatureGroup &) = delete;\n};\n\ntemplate <class A>\nstruct FeatureGroup<A>::InputOutputLabel {\n  Label input, output;\n\n  InputOutputLabel(Label i = kNoLabel, Label o = kNoLabel)\n      : input(i), output(o) {}\n\n  bool operator==(InputOutputLabel that) const {\n    return input == that.input && output == that.output;\n  }\n\n  std::istream &Read(std::istream &strm) {  // NOLINT\n    ReadType(strm, &input);\n    ReadType(strm, &output);\n    return strm;\n  }\n\n  std::ostream &Write(std::ostream &strm) const {  // NOLINT\n    WriteType(strm, input);\n    WriteType(strm, output);\n    return strm;\n  }\n};\n\ntemplate <class A>\nstruct FeatureGroup<A>::InputOutputLabelHash {\n  size_t operator()(InputOutputLabel label) const {\n    return static_cast<size_t>(label.input * 7853 + label.output);\n  }\n};\n\ntemplate <class A>\nint FeatureGroup<A>::Walk(int cur, Label ilabel, Label olabel,\n                          Weight *weight) const {\n  // Note: user of this method need to ensure `ilabel` and `olabel`\n  // are valid (e.g. see DCHECKs in\n  // `LinearFstData<>::TakeTransition()` and\n  // `LinearFstData<>::FindFeature()`).\n  int next;\n  if (ilabel == LinearFstData<A>::kStartOfSentence) {\n    // An observed start-of-sentence only occurs in the beginning of\n    // the input, when this feature group is delayed (i.e. there is\n    // another feature group with a larger future size). The actual\n    // input hasn't arrived so stay at the start state.\n    DCHECK_EQ(cur, start_);\n    next = start_;\n  } else {\n    // First, try exact match\n    next = FindFirstMatch(InputOutputLabel(ilabel, olabel), cur);\n    // Then try with don't cares\n    if (next == kNoTrieNodeId)\n      next = FindFirstMatch(InputOutputLabel(ilabel, kNoLabel), cur);\n    if (next == kNoTrieNodeId)\n      next = FindFirstMatch(InputOutputLabel(kNoLabel, olabel), cur);\n    // All failed, go to empty context\n    if (next == kNoTrieNodeId) next = trie_.Root();\n    *weight = Times(*weight, trie_[next].weight);\n    next = next_state_[next];\n  }\n  return next;\n}\n\ntemplate <class A>\ninline int FeatureGroup<A>::FindFirstMatch(InputOutputLabel label,\n                                           int parent) const {\n  if (label.input == kNoLabel && label.output == kNoLabel)\n    return kNoTrieNodeId;  // very important; see class doc.\n  for (; parent != kNoTrieNodeId; parent = trie_[parent].back_link) {\n    int next = trie_.Find(parent, label);\n    if (next != kNoTrieNodeId) return next;\n  }\n  return kNoTrieNodeId;\n}\n\ntemplate <class A>\ninline string FeatureGroup<A>::Stats() const {\n  std::ostringstream strm;\n  int num_states = 2;\n  for (int i = 2; i < next_state_.size(); ++i)\n    num_states += i == next_state_[i];\n  strm << trie_.NumNodes() << \" node(s); \" << num_states << \" state(s)\";\n  return strm.str();\n}\n\ntemplate <class A>\nclass LinearFstData<A>::GroupFeatureMap {\n public:\n  GroupFeatureMap() {}\n\n  void Init(size_t num_groups, size_t num_words) {\n    num_groups_ = num_groups;\n    pool_.clear();\n    pool_.resize(num_groups * num_words, kNoLabel);\n  }\n\n  Label Find(size_t group_id, Label ilabel) const {\n    return pool_[IndexOf(group_id, ilabel)];\n  }\n\n  bool Set(size_t group_id, Label ilabel, Label feat) {\n    size_t i = IndexOf(group_id, ilabel);\n    if (pool_[i] != kNoLabel && pool_[i] != feat) {\n      FSTERROR() << \"Feature group \" << group_id\n                 << \" already has feature for word \" << ilabel;\n      return false;\n    }\n    pool_[i] = feat;\n    return true;\n  }\n\n  std::istream &Read(std::istream &strm) {  // NOLINT\n    ReadType(strm, &num_groups_);\n    ReadType(strm, &pool_);\n    return strm;\n  }\n\n  std::ostream &Write(std::ostream &strm) const {  // NOLINT\n    WriteType(strm, num_groups_);\n    WriteType(strm, pool_);\n    return strm;\n  }\n\n private:\n  size_t IndexOf(size_t group_id, Label ilabel) const {\n    return ilabel * num_groups_ + group_id;\n  }\n\n  size_t num_groups_;\n  // `pool_[ilabel * num_groups_ + group_id]` is the feature active\n  // for group `group_id` with input `ilabel`\n  std::vector<Label> pool_;\n};\n\n}  // namespace fst\n\n#endif  // FST_EXTENSIONS_LINEAR_LINEAR_FST_DATA_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/extensions/linear/linear-fst.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Classes for building, storing and representing log-linear models as FSTs.\n\n#ifndef FST_EXTENSIONS_LINEAR_LINEAR_FST_H_\n#define FST_EXTENSIONS_LINEAR_LINEAR_FST_H_\n\n#include <algorithm>\n#include <iostream>\n#include <memory>\n#include <vector>\n\n#include <fst/compat.h>\n#include <fst/log.h>\n#include <fst/extensions/pdt/collection.h>\n#include <fst/bi-table.h>\n#include <fst/cache.h>\n#include <fstream>\n#include <fst/fst.h>\n#include <fst/matcher.h>\n#include <fst/symbol-table.h>\n\n#include <fst/extensions/linear/linear-fst-data.h>\n\nnamespace fst {\n\n// Forward declaration of the specialized matcher for both\n// LinearTaggerFst and LinearClassifierFst.\ntemplate <class F>\nclass LinearFstMatcherTpl;\n\nnamespace internal {\n\n// Implementation class for on-the-fly generated LinearTaggerFst with\n// special optimization in matching.\ntemplate <class A>\nclass LinearTaggerFstImpl : public CacheImpl<A> {\n public:\n  using FstImpl<A>::SetType;\n  using FstImpl<A>::SetProperties;\n  using FstImpl<A>::SetInputSymbols;\n  using FstImpl<A>::SetOutputSymbols;\n  using FstImpl<A>::WriteHeader;\n\n  using CacheBaseImpl<CacheState<A>>::PushArc;\n  using CacheBaseImpl<CacheState<A>>::HasArcs;\n  using CacheBaseImpl<CacheState<A>>::HasFinal;\n  using CacheBaseImpl<CacheState<A>>::HasStart;\n  using CacheBaseImpl<CacheState<A>>::SetArcs;\n  using CacheBaseImpl<CacheState<A>>::SetFinal;\n  using CacheBaseImpl<CacheState<A>>::SetStart;\n\n  typedef A Arc;\n  typedef typename A::Label Label;\n  typedef typename A::Weight Weight;\n  typedef typename A::StateId StateId;\n  typedef typename Collection<StateId, Label>::SetIterator NGramIterator;\n\n  // Constructs an empty FST by default.\n  LinearTaggerFstImpl()\n      : CacheImpl<A>(CacheOptions()),\n        data_(std::make_shared<LinearFstData<A>>()),\n        delay_(0) {\n    SetType(\"linear-tagger\");\n  }\n\n  // Constructs the FST with given data storage and symbol\n  // tables.\n  //\n  // TODO(wuke): when there is no constraint on output we can delay\n  // less than `data->MaxFutureSize` positions.\n  LinearTaggerFstImpl(const LinearFstData<Arc> *data, const SymbolTable *isyms,\n                      const SymbolTable *osyms, CacheOptions opts)\n      : CacheImpl<A>(opts), data_(data), delay_(data->MaxFutureSize()) {\n    SetType(\"linear-tagger\");\n    SetProperties(kILabelSorted, kFstProperties);\n    SetInputSymbols(isyms);\n    SetOutputSymbols(osyms);\n    ReserveStubSpace();\n  }\n\n  // Copy by sharing the underlying data storage.\n  LinearTaggerFstImpl(const LinearTaggerFstImpl &impl)\n      : CacheImpl<A>(impl), data_(impl.data_), delay_(impl.delay_) {\n    SetType(\"linear-tagger\");\n    SetProperties(impl.Properties(), kCopyProperties);\n    SetInputSymbols(impl.InputSymbols());\n    SetOutputSymbols(impl.OutputSymbols());\n    ReserveStubSpace();\n  }\n\n  StateId Start() {\n    if (!HasStart()) {\n      StateId start = FindStartState();\n      SetStart(start);\n    }\n    return CacheImpl<A>::Start();\n  }\n\n  Weight Final(StateId s) {\n    if (!HasFinal(s)) {\n      state_stub_.clear();\n      FillState(s, &state_stub_);\n      if (CanBeFinal(state_stub_))\n        SetFinal(s, data_->FinalWeight(InternalBegin(state_stub_),\n                                       InternalEnd(state_stub_)));\n      else\n        SetFinal(s, Weight::Zero());\n    }\n    return CacheImpl<A>::Final(s);\n  }\n\n  size_t NumArcs(StateId s) {\n    if (!HasArcs(s)) Expand(s);\n    return CacheImpl<A>::NumArcs(s);\n  }\n\n  size_t NumInputEpsilons(StateId s) {\n    if (!HasArcs(s)) Expand(s);\n    return CacheImpl<A>::NumInputEpsilons(s);\n  }\n\n  size_t NumOutputEpsilons(StateId s) {\n    if (!HasArcs(s)) Expand(s);\n    return CacheImpl<A>::NumOutputEpsilons(s);\n  }\n\n  void InitArcIterator(StateId s, ArcIteratorData<A> *data) {\n    if (!HasArcs(s)) Expand(s);\n    CacheImpl<A>::InitArcIterator(s, data);\n  }\n\n  // Computes the outgoing transitions from a state, creating new\n  // destination states as needed.\n  void Expand(StateId s);\n\n  // Appends to `arcs` all out-going arcs from state `s` that matches `label` as\n  // the input label.\n  void MatchInput(StateId s, Label ilabel, std::vector<Arc> *arcs);\n\n  static LinearTaggerFstImpl *Read(std::istream &strm,\n                                   const FstReadOptions &opts);\n\n  bool Write(std::ostream &strm,  // NOLINT\n             const FstWriteOptions &opts) const {\n    FstHeader header;\n    header.SetStart(kNoStateId);\n    WriteHeader(strm, opts, kFileVersion, &header);\n    data_->Write(strm);\n    if (!strm) {\n      LOG(ERROR) << \"LinearTaggerFst::Write: Write failed: \" << opts.source;\n      return false;\n    }\n    return true;\n  }\n\n private:\n  static const int kMinFileVersion;\n  static const int kFileVersion;\n\n  // A collection of functions to access parts of the state tuple. A\n  // state tuple is a vector of `Label`s with two parts:\n  //   [buffer] [internal].\n  //\n  // - [buffer] is a buffer of observed input labels with length\n  // `delay_`. `LinearFstData<A>::kStartOfSentence`\n  // (resp. `LinearFstData<A>::kEndOfSentence`) are used as\n  // paddings when the buffer has fewer than `delay_` elements, which\n  // can only appear as the prefix (resp. suffix) of the buffer.\n  //\n  // - [internal] is the internal state tuple for `LinearFstData`\n  typename std::vector<Label>::const_iterator BufferBegin(\n      const std::vector<Label> &state) const {\n    return state.begin();\n  }\n\n  typename std::vector<Label>::const_iterator BufferEnd(\n      const std::vector<Label> &state) const {\n    return state.begin() + delay_;\n  }\n\n  typename std::vector<Label>::const_iterator InternalBegin(\n      const std::vector<Label> &state) const {\n    return state.begin() + delay_;\n  }\n\n  typename std::vector<Label>::const_iterator InternalEnd(\n      const std::vector<Label> &state) const {\n    return state.end();\n  }\n\n  // The size of state tuples are fixed, reserve them in stubs\n  void ReserveStubSpace() {\n    state_stub_.reserve(delay_ + data_->NumGroups());\n    next_stub_.reserve(delay_ + data_->NumGroups());\n  }\n\n  // Computes the start state tuple and maps it to the start state id.\n  StateId FindStartState() {\n    // Empty buffer with start-of-sentence paddings\n    state_stub_.clear();\n    state_stub_.resize(delay_, LinearFstData<A>::kStartOfSentence);\n    // Append internal states\n    data_->EncodeStartState(&state_stub_);\n    return FindState(state_stub_);\n  }\n\n  // Tests whether the buffer in `(begin, end)` is empty.\n  bool IsEmptyBuffer(typename std::vector<Label>::const_iterator begin,\n                     typename std::vector<Label>::const_iterator end) const {\n    // The following is guanranteed by `ShiftBuffer()`:\n    // - buffer[i] == LinearFstData<A>::kEndOfSentence =>\n    //       buffer[i+x] == LinearFstData<A>::kEndOfSentence\n    // - buffer[i] == LinearFstData<A>::kStartOfSentence =>\n    //       buffer[i-x] == LinearFstData<A>::kStartOfSentence\n    return delay_ == 0 || *(end - 1) == LinearFstData<A>::kStartOfSentence ||\n           *begin == LinearFstData<A>::kEndOfSentence;\n  }\n\n  // Tests whether the given state tuple can be a final state. A state\n  // is final iff there is no observed input in the buffer.\n  bool CanBeFinal(const std::vector<Label> &state) {\n    return IsEmptyBuffer(BufferBegin(state), BufferEnd(state));\n  }\n\n  // Finds state corresponding to an n-gram. Creates new state if n-gram not\n  // found.\n  StateId FindState(const std::vector<Label> &ngram) {\n    StateId sparse = ngrams_.FindId(ngram, true);\n    StateId dense = condensed_.FindId(sparse, true);\n    return dense;\n  }\n\n  // Appends after `output` the state tuple corresponding to the state id. The\n  // state id must exist.\n  void FillState(StateId s, std::vector<Label> *output) {\n    s = condensed_.FindEntry(s);\n    for (NGramIterator it = ngrams_.FindSet(s); !it.Done(); it.Next()) {\n      Label label = it.Element();\n      output->push_back(label);\n    }\n  }\n\n  // Shifts the buffer in `state` by appending `ilabel` and popping\n  // the one in the front as the return value. `next_stub_` is a\n  // shifted buffer of size `delay_` where the first `delay_ - 1`\n  // elements are the last `delay_ - 1` elements in the buffer of\n  // `state`. The last (if any) element in `next_stub_` will be\n  // `ilabel` after the call returns.\n  Label ShiftBuffer(const std::vector<Label> &state, Label ilabel,\n                    std::vector<Label> *next_stub_);\n\n  // Builds an arc from state tuple `state` consuming `ilabel` and\n  // `olabel`. `next_stub_` is the buffer filled in `ShiftBuffer`.\n  Arc MakeArc(const std::vector<Label> &state, Label ilabel, Label olabel,\n              std::vector<Label> *next_stub_);\n\n  // Expands arcs from state `s`, equivalent to state tuple `state`,\n  // with input `ilabel`. `next_stub_` is the buffer filled in\n  // `ShiftBuffer`.\n  void ExpandArcs(StateId s, const std::vector<Label> &state, Label ilabel,\n                  std::vector<Label> *next_stub_);\n\n  // Appends arcs from state `s`, equivalent to state tuple `state`,\n  // with input `ilabel` to `arcs`. `next_stub_` is the buffer filled\n  // in `ShiftBuffer`.\n  void AppendArcs(StateId s, const std::vector<Label> &state, Label ilabel,\n                  std::vector<Label> *next_stub_, std::vector<Arc> *arcs);\n\n  std::shared_ptr<const LinearFstData<A>> data_;\n  size_t delay_;\n  // Mapping from internal state tuple to *non-consecutive* ids\n  Collection<StateId, Label> ngrams_;\n  // Mapping from non-consecutive id to actual state id\n  CompactHashBiTable<StateId, StateId, std::hash<StateId>> condensed_;\n  // Two frequently used vectors, reuse to avoid repeated heap\n  // allocation\n  std::vector<Label> state_stub_, next_stub_;\n\n  LinearTaggerFstImpl &operator=(const LinearTaggerFstImpl &) = delete;\n};\n\ntemplate <class A>\nconst int LinearTaggerFstImpl<A>::kMinFileVersion = 1;\n\ntemplate <class A>\nconst int LinearTaggerFstImpl<A>::kFileVersion = 1;\n\ntemplate <class A>\ninline typename A::Label LinearTaggerFstImpl<A>::ShiftBuffer(\n    const std::vector<Label> &state, Label ilabel,\n    std::vector<Label> *next_stub_) {\n  DCHECK(ilabel > 0 || ilabel == LinearFstData<A>::kEndOfSentence);\n  if (delay_ == 0) {\n    DCHECK_GT(ilabel, 0);\n    return ilabel;\n  } else {\n    (*next_stub_)[BufferEnd(*next_stub_) - next_stub_->begin() - 1] = ilabel;\n    return *BufferBegin(state);\n  }\n}\n\ntemplate <class A>\ninline A LinearTaggerFstImpl<A>::MakeArc(const std::vector<Label> &state,\n                                         Label ilabel, Label olabel,\n                                         std::vector<Label> *next_stub_) {\n  DCHECK(ilabel > 0 || ilabel == LinearFstData<A>::kEndOfSentence);\n  DCHECK(olabel > 0 || olabel == LinearFstData<A>::kStartOfSentence);\n  Weight weight(Weight::One());\n  data_->TakeTransition(BufferEnd(state), InternalBegin(state),\n                        InternalEnd(state), ilabel, olabel, next_stub_,\n                        &weight);\n  StateId nextstate = FindState(*next_stub_);\n  // Restore `next_stub_` to its size before the call\n  next_stub_->resize(delay_);\n  // In the actual arc, we use epsilons instead of boundaries.\n  return A(ilabel == LinearFstData<A>::kEndOfSentence ? 0 : ilabel,\n           olabel == LinearFstData<A>::kStartOfSentence ? 0 : olabel, weight,\n           nextstate);\n}\n\ntemplate <class A>\ninline void LinearTaggerFstImpl<A>::ExpandArcs(StateId s,\n                                               const std::vector<Label> &state,\n                                               Label ilabel,\n                                               std::vector<Label> *next_stub_) {\n  // Input label to constrain the output with, observed `delay_` steps\n  // back. `ilabel` is the input label to be put on the arc, which\n  // fires features.\n  Label obs_ilabel = ShiftBuffer(state, ilabel, next_stub_);\n  if (obs_ilabel == LinearFstData<A>::kStartOfSentence) {\n    // This happens when input is shorter than `delay_`.\n    PushArc(s, MakeArc(state, ilabel, LinearFstData<A>::kStartOfSentence,\n                       next_stub_));\n  } else {\n    std::pair<typename std::vector<typename A::Label>::const_iterator,\n              typename std::vector<typename A::Label>::const_iterator> range =\n        data_->PossibleOutputLabels(obs_ilabel);\n    for (typename std::vector<typename A::Label>::const_iterator it =\n             range.first;\n         it != range.second; ++it)\n      PushArc(s, MakeArc(state, ilabel, *it, next_stub_));\n  }\n}\n\n// TODO(wuke): this has much in duplicate with `ExpandArcs()`\ntemplate <class A>\ninline void LinearTaggerFstImpl<A>::AppendArcs(StateId /*s*/,\n                                               const std::vector<Label> &state,\n                                               Label ilabel,\n                                               std::vector<Label> *next_stub_,\n                                               std::vector<Arc> *arcs) {\n  // Input label to constrain the output with, observed `delay_` steps\n  // back. `ilabel` is the input label to be put on the arc, which\n  // fires features.\n  Label obs_ilabel = ShiftBuffer(state, ilabel, next_stub_);\n  if (obs_ilabel == LinearFstData<A>::kStartOfSentence) {\n    // This happens when input is shorter than `delay_`.\n    arcs->push_back(\n        MakeArc(state, ilabel, LinearFstData<A>::kStartOfSentence, next_stub_));\n  } else {\n    std::pair<typename std::vector<typename A::Label>::const_iterator,\n              typename std::vector<typename A::Label>::const_iterator> range =\n        data_->PossibleOutputLabels(obs_ilabel);\n    for (typename std::vector<typename A::Label>::const_iterator it =\n             range.first;\n         it != range.second; ++it)\n      arcs->push_back(MakeArc(state, ilabel, *it, next_stub_));\n  }\n}\n\ntemplate <class A>\nvoid LinearTaggerFstImpl<A>::Expand(StateId s) {\n  VLOG(3) << \"Expand \" << s;\n  state_stub_.clear();\n  FillState(s, &state_stub_);\n\n  // Precompute the first `delay_ - 1` elements in the buffer of\n  // next states, which are identical for different input/output.\n  next_stub_.clear();\n  next_stub_.resize(delay_);\n  if (delay_ > 0)\n    std::copy(BufferBegin(state_stub_) + 1, BufferEnd(state_stub_),\n              next_stub_.begin());\n\n  // Epsilon transition for flushing out the next observed input\n  if (!IsEmptyBuffer(BufferBegin(state_stub_), BufferEnd(state_stub_)))\n    ExpandArcs(s, state_stub_, LinearFstData<A>::kEndOfSentence, &next_stub_);\n\n  // Non-epsilon input when we haven't flushed\n  if (delay_ == 0 ||\n      *(BufferEnd(state_stub_) - 1) != LinearFstData<A>::kEndOfSentence)\n    for (Label ilabel = data_->MinInputLabel();\n         ilabel <= data_->MaxInputLabel(); ++ilabel)\n      ExpandArcs(s, state_stub_, ilabel, &next_stub_);\n\n  SetArcs(s);\n}\n\ntemplate <class A>\nvoid LinearTaggerFstImpl<A>::MatchInput(StateId s, Label ilabel,\n                                        std::vector<Arc> *arcs) {\n  state_stub_.clear();\n  FillState(s, &state_stub_);\n\n  // Precompute the first `delay_ - 1` elements in the buffer of\n  // next states, which are identical for different input/output.\n  next_stub_.clear();\n  next_stub_.resize(delay_);\n  if (delay_ > 0)\n    std::copy(BufferBegin(state_stub_) + 1, BufferEnd(state_stub_),\n              next_stub_.begin());\n\n  if (ilabel == 0) {\n    // Epsilon transition for flushing out the next observed input\n    if (!IsEmptyBuffer(BufferBegin(state_stub_), BufferEnd(state_stub_)))\n      AppendArcs(s, state_stub_, LinearFstData<A>::kEndOfSentence, &next_stub_,\n                 arcs);\n  } else {\n    // Non-epsilon input when we haven't flushed\n    if (delay_ == 0 ||\n        *(BufferEnd(state_stub_) - 1) != LinearFstData<A>::kEndOfSentence)\n      AppendArcs(s, state_stub_, ilabel, &next_stub_, arcs);\n  }\n}\n\ntemplate <class A>\ninline LinearTaggerFstImpl<A> *LinearTaggerFstImpl<A>::Read(\n    std::istream &strm, const FstReadOptions &opts) {  // NOLINT\n  std::unique_ptr<LinearTaggerFstImpl<A>> impl(new LinearTaggerFstImpl<A>());\n  FstHeader header;\n  if (!impl->ReadHeader(strm, opts, kMinFileVersion, &header)) {\n    return nullptr;\n  }\n  impl->data_ = std::shared_ptr<LinearFstData<A>>(LinearFstData<A>::Read(strm));\n  if (!impl->data_) {\n    return nullptr;\n  }\n  impl->delay_ = impl->data_->MaxFutureSize();\n  impl->ReserveStubSpace();\n  return impl.release();\n}\n\n}  // namespace internal\n\n// This class attaches interface to implementation and handles\n// reference counting, delegating most methods to ImplToFst.\ntemplate <class A>\nclass LinearTaggerFst : public ImplToFst<internal::LinearTaggerFstImpl<A>> {\n public:\n  friend class ArcIterator<LinearTaggerFst<A>>;\n  friend class StateIterator<LinearTaggerFst<A>>;\n  friend class LinearFstMatcherTpl<LinearTaggerFst<A>>;\n\n  typedef A Arc;\n  typedef typename A::Label Label;\n  typedef typename A::Weight Weight;\n  typedef typename A::StateId StateId;\n  typedef DefaultCacheStore<A> Store;\n  typedef typename Store::State State;\n  using Impl = internal::LinearTaggerFstImpl<A>;\n\n  LinearTaggerFst() : ImplToFst<Impl>(std::make_shared<Impl>()) {}\n\n  explicit LinearTaggerFst(LinearFstData<A> *data,\n                           const SymbolTable *isyms = nullptr,\n                           const SymbolTable *osyms = nullptr,\n                           CacheOptions opts = CacheOptions())\n      : ImplToFst<Impl>(std::make_shared<Impl>(data, isyms, osyms, opts)) {}\n\n  explicit LinearTaggerFst(const Fst<A> &fst)\n      : ImplToFst<Impl>(std::make_shared<Impl>()) {\n    LOG(FATAL) << \"LinearTaggerFst: no constructor from arbitrary FST.\";\n  }\n\n  // See Fst<>::Copy() for doc.\n  LinearTaggerFst(const LinearTaggerFst<A> &fst, bool safe = false)\n      : ImplToFst<Impl>(fst, safe) {}\n\n  // Get a copy of this LinearTaggerFst. See Fst<>::Copy() for further doc.\n  LinearTaggerFst<A> *Copy(bool safe = false) const override {\n    return new LinearTaggerFst<A>(*this, safe);\n  }\n\n  inline void InitStateIterator(StateIteratorData<A> *data) const override;\n\n  void InitArcIterator(StateId s, ArcIteratorData<A> *data) const override {\n    GetMutableImpl()->InitArcIterator(s, data);\n  }\n\n  MatcherBase<A> *InitMatcher(MatchType match_type) const override {\n    return new LinearFstMatcherTpl<LinearTaggerFst<A>>(this, match_type);\n  }\n\n  static LinearTaggerFst<A> *Read(const string &filename) {\n    if (!filename.empty()) {\n      std::ifstream strm(filename,\n                              std::ios_base::in | std::ios_base::binary);\n      if (!strm) {\n        LOG(ERROR) << \"LinearTaggerFst::Read: Can't open file: \" << filename;\n        return nullptr;\n      }\n      return Read(strm, FstReadOptions(filename));\n    } else {\n      return Read(std::cin, FstReadOptions(\"standard input\"));\n    }\n  }\n\n  static LinearTaggerFst<A> *Read(std::istream &in,  // NOLINT\n                                  const FstReadOptions &opts) {\n    auto *impl = Impl::Read(in, opts);\n    return impl ? new LinearTaggerFst<A>(std::shared_ptr<Impl>(impl)) : nullptr;\n  }\n\n  bool Write(const string &filename) const override {\n    if (!filename.empty()) {\n      std::ofstream strm(filename,\n                               std::ios_base::out | std::ios_base::binary);\n      if (!strm) {\n        LOG(ERROR) << \"LinearTaggerFst::Write: Can't open file: \" << filename;\n        return false;\n      }\n      return Write(strm, FstWriteOptions(filename));\n    } else {\n      return Write(std::cout, FstWriteOptions(\"standard output\"));\n    }\n  }\n\n  bool Write(std::ostream &strm, const FstWriteOptions &opts) const override {\n    return GetImpl()->Write(strm, opts);\n  }\n\n private:\n  using ImplToFst<Impl>::GetImpl;\n  using ImplToFst<Impl>::GetMutableImpl;\n\n  explicit LinearTaggerFst(std::shared_ptr<Impl> impl)\n      : ImplToFst<Impl>(impl) {}\n\n  void operator=(const LinearTaggerFst<A> &fst) = delete;\n};\n\n// Specialization for LinearTaggerFst.\ntemplate <class Arc>\nclass StateIterator<LinearTaggerFst<Arc>>\n    : public CacheStateIterator<LinearTaggerFst<Arc>> {\n public:\n  explicit StateIterator(const LinearTaggerFst<Arc> &fst)\n      : CacheStateIterator<LinearTaggerFst<Arc>>(fst, fst.GetMutableImpl()) {}\n};\n\n// Specialization for LinearTaggerFst.\ntemplate <class Arc>\nclass ArcIterator<LinearTaggerFst<Arc>>\n    : public CacheArcIterator<LinearTaggerFst<Arc>> {\n public:\n  using StateId = typename Arc::StateId;\n\n  ArcIterator(const LinearTaggerFst<Arc> &fst, StateId s)\n      : CacheArcIterator<LinearTaggerFst<Arc>>(fst.GetMutableImpl(), s) {\n    if (!fst.GetImpl()->HasArcs(s)) fst.GetMutableImpl()->Expand(s);\n  }\n};\n\ntemplate <class Arc>\ninline void LinearTaggerFst<Arc>::InitStateIterator(\n    StateIteratorData<Arc> *data) const {\n  data->base = new StateIterator<LinearTaggerFst<Arc>>(*this);\n}\n\nnamespace internal {\n\n// Implementation class for on-the-fly generated LinearClassifierFst with\n// special optimization in matching.\ntemplate <class A>\nclass LinearClassifierFstImpl : public CacheImpl<A> {\n public:\n  using FstImpl<A>::SetType;\n  using FstImpl<A>::SetProperties;\n  using FstImpl<A>::SetInputSymbols;\n  using FstImpl<A>::SetOutputSymbols;\n  using FstImpl<A>::WriteHeader;\n\n  using CacheBaseImpl<CacheState<A>>::PushArc;\n  using CacheBaseImpl<CacheState<A>>::HasArcs;\n  using CacheBaseImpl<CacheState<A>>::HasFinal;\n  using CacheBaseImpl<CacheState<A>>::HasStart;\n  using CacheBaseImpl<CacheState<A>>::SetArcs;\n  using CacheBaseImpl<CacheState<A>>::SetFinal;\n  using CacheBaseImpl<CacheState<A>>::SetStart;\n\n  typedef A Arc;\n  typedef typename A::Label Label;\n  typedef typename A::Weight Weight;\n  typedef typename A::StateId StateId;\n  typedef typename Collection<StateId, Label>::SetIterator NGramIterator;\n\n  // Constructs an empty FST by default.\n  LinearClassifierFstImpl()\n      : CacheImpl<A>(CacheOptions()),\n        data_(std::make_shared<LinearFstData<A>>()) {\n    SetType(\"linear-classifier\");\n    num_classes_ = 0;\n    num_groups_ = 0;\n  }\n\n  // Constructs the FST with given data storage, number of classes and\n  // symbol tables.\n  LinearClassifierFstImpl(const LinearFstData<Arc> *data, size_t num_classes,\n                          const SymbolTable *isyms, const SymbolTable *osyms,\n                          CacheOptions opts)\n      : CacheImpl<A>(opts),\n        data_(data),\n        num_classes_(num_classes),\n        num_groups_(data_->NumGroups() / num_classes_) {\n    SetType(\"linear-classifier\");\n    SetProperties(kILabelSorted, kFstProperties);\n    SetInputSymbols(isyms);\n    SetOutputSymbols(osyms);\n    ReserveStubSpace();\n  }\n\n  // Copy by sharing the underlying data storage.\n  LinearClassifierFstImpl(const LinearClassifierFstImpl &impl)\n      : CacheImpl<A>(impl),\n        data_(impl.data_),\n        num_classes_(impl.num_classes_),\n        num_groups_(impl.num_groups_) {\n    SetType(\"linear-classifier\");\n    SetProperties(impl.Properties(), kCopyProperties);\n    SetInputSymbols(impl.InputSymbols());\n    SetOutputSymbols(impl.OutputSymbols());\n    ReserveStubSpace();\n  }\n\n  StateId Start() {\n    if (!HasStart()) {\n      StateId start = FindStartState();\n      SetStart(start);\n    }\n    return CacheImpl<A>::Start();\n  }\n\n  Weight Final(StateId s) {\n    if (!HasFinal(s)) {\n      state_stub_.clear();\n      FillState(s, &state_stub_);\n      SetFinal(s, FinalWeight(state_stub_));\n    }\n    return CacheImpl<A>::Final(s);\n  }\n\n  size_t NumArcs(StateId s) {\n    if (!HasArcs(s)) Expand(s);\n    return CacheImpl<A>::NumArcs(s);\n  }\n\n  size_t NumInputEpsilons(StateId s) {\n    if (!HasArcs(s)) Expand(s);\n    return CacheImpl<A>::NumInputEpsilons(s);\n  }\n\n  size_t NumOutputEpsilons(StateId s) {\n    if (!HasArcs(s)) Expand(s);\n    return CacheImpl<A>::NumOutputEpsilons(s);\n  }\n\n  void InitArcIterator(StateId s, ArcIteratorData<A> *data) {\n    if (!HasArcs(s)) Expand(s);\n    CacheImpl<A>::InitArcIterator(s, data);\n  }\n\n  // Computes the outgoing transitions from a state, creating new\n  // destination states as needed.\n  void Expand(StateId s);\n\n  // Appends to `arcs` all out-going arcs from state `s` that matches\n  // `label` as the input label.\n  void MatchInput(StateId s, Label ilabel, std::vector<Arc> *arcs);\n\n  static LinearClassifierFstImpl<A> *Read(std::istream &strm,\n                                          const FstReadOptions &opts);\n\n  bool Write(std::ostream &strm, const FstWriteOptions &opts) const {\n    FstHeader header;\n    header.SetStart(kNoStateId);\n    WriteHeader(strm, opts, kFileVersion, &header);\n    data_->Write(strm);\n    WriteType(strm, num_classes_);\n    if (!strm) {\n      LOG(ERROR) << \"LinearClassifierFst::Write: Write failed: \" << opts.source;\n      return false;\n    }\n    return true;\n  }\n\n private:\n  static const int kMinFileVersion;\n  static const int kFileVersion;\n\n  // A collection of functions to access parts of the state tuple. A\n  // state tuple is a vector of `Label`s with two parts:\n  //   [prediction] [internal].\n  //\n  // - [prediction] is a single label of the predicted class. A state\n  //   must have a positive class label, unless it is the start state.\n  //\n  // - [internal] is the internal state tuple for `LinearFstData` of\n  //   the given class; or kNoTrieNodeId's if in start state.\n  Label &Prediction(std::vector<Label> &state) { return state[0]; }  // NOLINT\n  Label Prediction(const std::vector<Label> &state) const { return state[0]; }\n\n  Label &InternalAt(std::vector<Label> &state, int index) {  // NOLINT\n    return state[index + 1];\n  }\n  Label InternalAt(const std::vector<Label> &state, int index) const {\n    return state[index + 1];\n  }\n\n  // The size of state tuples are fixed, reserve them in stubs\n  void ReserveStubSpace() {\n    size_t size = 1 + num_groups_;\n    state_stub_.reserve(size);\n    next_stub_.reserve(size);\n  }\n\n  // Computes the start state tuple and maps it to the start state id.\n  StateId FindStartState() {\n    // A start state tuple has no prediction\n    state_stub_.clear();\n    state_stub_.push_back(kNoLabel);\n    // For a start state, we don't yet know where we are in the tries.\n    for (size_t i = 0; i < num_groups_; ++i)\n      state_stub_.push_back(kNoTrieNodeId);\n    return FindState(state_stub_);\n  }\n\n  // Tests if the state tuple represents the start state.\n  bool IsStartState(const std::vector<Label> &state) const {\n    return state[0] == kNoLabel;\n  }\n\n  // Computes the actual group id in the data storage.\n  int GroupId(Label pred, int group) const {\n    return group * num_classes_ + pred - 1;\n  }\n\n  // Finds out the final weight of the given state. A state is final\n  // iff it is not the start.\n  Weight FinalWeight(const std::vector<Label> &state) const {\n    if (IsStartState(state)) {\n      return Weight::Zero();\n    }\n    Label pred = Prediction(state);\n    DCHECK_GT(pred, 0);\n    DCHECK_LE(pred, num_classes_);\n    Weight final_weight = Weight::One();\n    for (size_t group = 0; group < num_groups_; ++group) {\n      int group_id = GroupId(pred, group);\n      int trie_state = InternalAt(state, group);\n      final_weight =\n          Times(final_weight, data_->GroupFinalWeight(group_id, trie_state));\n    }\n    return final_weight;\n  }\n\n  // Finds state corresponding to an n-gram. Creates new state if n-gram not\n  // found.\n  StateId FindState(const std::vector<Label> &ngram) {\n    StateId sparse = ngrams_.FindId(ngram, true);\n    StateId dense = condensed_.FindId(sparse, true);\n    return dense;\n  }\n\n  // Appends after `output` the state tuple corresponding to the state id. The\n  // state id must exist.\n  void FillState(StateId s, std::vector<Label> *output) {\n    s = condensed_.FindEntry(s);\n    for (NGramIterator it = ngrams_.FindSet(s); !it.Done(); it.Next()) {\n      Label label = it.Element();\n      output->push_back(label);\n    }\n  }\n\n  std::shared_ptr<const LinearFstData<A>> data_;\n  // Division of groups in `data_`; num_classes_ * num_groups_ ==\n  // data_->NumGroups().\n  size_t num_classes_, num_groups_;\n  // Mapping from internal state tuple to *non-consecutive* ids\n  Collection<StateId, Label> ngrams_;\n  // Mapping from non-consecutive id to actual state id\n  CompactHashBiTable<StateId, StateId, std::hash<StateId>> condensed_;\n  // Two frequently used vectors, reuse to avoid repeated heap\n  // allocation\n  std::vector<Label> state_stub_, next_stub_;\n\n  void operator=(const LinearClassifierFstImpl<A> &) = delete;\n};\n\ntemplate <class A>\nconst int LinearClassifierFstImpl<A>::kMinFileVersion = 0;\n\ntemplate <class A>\nconst int LinearClassifierFstImpl<A>::kFileVersion = 0;\n\ntemplate <class A>\nvoid LinearClassifierFstImpl<A>::Expand(StateId s) {\n  VLOG(3) << \"Expand \" << s;\n  state_stub_.clear();\n  FillState(s, &state_stub_);\n  next_stub_.clear();\n  next_stub_.resize(1 + num_groups_);\n\n  if (IsStartState(state_stub_)) {\n    // Make prediction\n    for (Label pred = 1; pred <= num_classes_; ++pred) {\n      Prediction(next_stub_) = pred;\n      for (int i = 0; i < num_groups_; ++i)\n        InternalAt(next_stub_, i) = data_->GroupStartState(GroupId(pred, i));\n      PushArc(s, A(0, pred, Weight::One(), FindState(next_stub_)));\n    }\n  } else {\n    Label pred = Prediction(state_stub_);\n    DCHECK_GT(pred, 0);\n    DCHECK_LE(pred, num_classes_);\n    for (Label ilabel = data_->MinInputLabel();\n         ilabel <= data_->MaxInputLabel(); ++ilabel) {\n      Prediction(next_stub_) = pred;\n      Weight weight = Weight::One();\n      for (int i = 0; i < num_groups_; ++i)\n        InternalAt(next_stub_, i) =\n            data_->GroupTransition(GroupId(pred, i), InternalAt(state_stub_, i),\n                                   ilabel, pred, &weight);\n      PushArc(s, A(ilabel, 0, weight, FindState(next_stub_)));\n    }\n  }\n\n  SetArcs(s);\n}\n\ntemplate <class A>\nvoid LinearClassifierFstImpl<A>::MatchInput(StateId s, Label ilabel,\n                                            std::vector<Arc> *arcs) {\n  state_stub_.clear();\n  FillState(s, &state_stub_);\n  next_stub_.clear();\n  next_stub_.resize(1 + num_groups_);\n\n  if (IsStartState(state_stub_)) {\n    // Make prediction if `ilabel` is epsilon.\n    if (ilabel == 0) {\n      for (Label pred = 1; pred <= num_classes_; ++pred) {\n        Prediction(next_stub_) = pred;\n        for (int i = 0; i < num_groups_; ++i)\n          InternalAt(next_stub_, i) = data_->GroupStartState(GroupId(pred, i));\n        arcs->push_back(A(0, pred, Weight::One(), FindState(next_stub_)));\n      }\n    }\n  } else if (ilabel != 0) {\n    Label pred = Prediction(state_stub_);\n    Weight weight = Weight::One();\n    Prediction(next_stub_) = pred;\n    for (int i = 0; i < num_groups_; ++i)\n      InternalAt(next_stub_, i) = data_->GroupTransition(\n          GroupId(pred, i), InternalAt(state_stub_, i), ilabel, pred, &weight);\n    arcs->push_back(A(ilabel, 0, weight, FindState(next_stub_)));\n  }\n}\n\ntemplate <class A>\ninline LinearClassifierFstImpl<A> *LinearClassifierFstImpl<A>::Read(\n    std::istream &strm, const FstReadOptions &opts) {\n  std::unique_ptr<LinearClassifierFstImpl<A>> impl(\n      new LinearClassifierFstImpl<A>());\n  FstHeader header;\n  if (!impl->ReadHeader(strm, opts, kMinFileVersion, &header)) {\n    return nullptr;\n  }\n  impl->data_ = std::shared_ptr<LinearFstData<A>>(LinearFstData<A>::Read(strm));\n  if (!impl->data_) {\n    return nullptr;\n  }\n  ReadType(strm, &impl->num_classes_);\n  if (!strm) {\n    return nullptr;\n  }\n  impl->num_groups_ = impl->data_->NumGroups() / impl->num_classes_;\n  if (impl->num_groups_ * impl->num_classes_ != impl->data_->NumGroups()) {\n    FSTERROR() << \"Total number of feature groups is not a multiple of the \"\n                  \"number of classes: num groups = \"\n               << impl->data_->NumGroups()\n               << \", num classes = \" << impl->num_classes_;\n    return nullptr;\n  }\n  impl->ReserveStubSpace();\n  return impl.release();\n}\n\n}  // namespace internal\n\n// This class attaches interface to implementation and handles\n// reference counting, delegating most methods to ImplToFst.\ntemplate <class A>\nclass LinearClassifierFst\n    : public ImplToFst<internal::LinearClassifierFstImpl<A>> {\n public:\n  friend class ArcIterator<LinearClassifierFst<A>>;\n  friend class StateIterator<LinearClassifierFst<A>>;\n  friend class LinearFstMatcherTpl<LinearClassifierFst<A>>;\n\n  typedef A Arc;\n  typedef typename A::Label Label;\n  typedef typename A::Weight Weight;\n  typedef typename A::StateId StateId;\n  typedef DefaultCacheStore<A> Store;\n  typedef typename Store::State State;\n  using Impl = internal::LinearClassifierFstImpl<A>;\n\n  LinearClassifierFst() : ImplToFst<Impl>(std::make_shared<Impl>()) {}\n\n  explicit LinearClassifierFst(LinearFstData<A> *data, size_t num_classes,\n                               const SymbolTable *isyms = nullptr,\n                               const SymbolTable *osyms = nullptr,\n                               CacheOptions opts = CacheOptions())\n      : ImplToFst<Impl>(\n            std::make_shared<Impl>(data, num_classes, isyms, osyms, opts)) {}\n\n  explicit LinearClassifierFst(const Fst<A> &fst)\n      : ImplToFst<Impl>(std::make_shared<Impl>()) {\n    LOG(FATAL) << \"LinearClassifierFst: no constructor from arbitrary FST.\";\n  }\n\n  // See Fst<>::Copy() for doc.\n  LinearClassifierFst(const LinearClassifierFst<A> &fst, bool safe = false)\n      : ImplToFst<Impl>(fst, safe) {}\n\n  // Get a copy of this LinearClassifierFst. See Fst<>::Copy() for further doc.\n  LinearClassifierFst<A> *Copy(bool safe = false) const override {\n    return new LinearClassifierFst<A>(*this, safe);\n  }\n\n  inline void InitStateIterator(StateIteratorData<A> *data) const override;\n\n  void InitArcIterator(StateId s, ArcIteratorData<A> *data) const override {\n    GetMutableImpl()->InitArcIterator(s, data);\n  }\n\n  MatcherBase<A> *InitMatcher(MatchType match_type) const override {\n    return new LinearFstMatcherTpl<LinearClassifierFst<A>>(this, match_type);\n  }\n\n  static LinearClassifierFst<A> *Read(const string &filename) {\n    if (!filename.empty()) {\n      std::ifstream strm(filename,\n                              std::ios_base::in | std::ios_base::binary);\n      if (!strm) {\n        LOG(ERROR) << \"LinearClassifierFst::Read: Can't open file: \"\n                   << filename;\n        return nullptr;\n      }\n      return Read(strm, FstReadOptions(filename));\n    } else {\n      return Read(std::cin, FstReadOptions(\"standard input\"));\n    }\n  }\n\n  static LinearClassifierFst<A> *Read(std::istream &in,\n                                      const FstReadOptions &opts) {\n    auto *impl = Impl::Read(in, opts);\n    return impl ? new LinearClassifierFst<A>(std::shared_ptr<Impl>(impl))\n                : nullptr;\n  }\n\n  bool Write(const string &filename) const override {\n    if (!filename.empty()) {\n      std::ofstream strm(filename,\n                               std::ios_base::out | std::ios_base::binary);\n      if (!strm) {\n        LOG(ERROR) << \"ProdLmFst::Write: Can't open file: \" << filename;\n        return false;\n      }\n      return Write(strm, FstWriteOptions(filename));\n    } else {\n      return Write(std::cout, FstWriteOptions(\"standard output\"));\n    }\n  }\n\n  bool Write(std::ostream &strm, const FstWriteOptions &opts) const override {\n    return GetImpl()->Write(strm, opts);\n  }\n\n private:\n  using ImplToFst<Impl>::GetImpl;\n  using ImplToFst<Impl>::GetMutableImpl;\n\n  explicit LinearClassifierFst(std::shared_ptr<Impl> impl)\n      : ImplToFst<Impl>(impl) {}\n\n  void operator=(const LinearClassifierFst<A> &fst) = delete;\n};\n\n// Specialization for LinearClassifierFst.\ntemplate <class Arc>\nclass StateIterator<LinearClassifierFst<Arc>>\n    : public CacheStateIterator<LinearClassifierFst<Arc>> {\n public:\n  explicit StateIterator(const LinearClassifierFst<Arc> &fst)\n      : CacheStateIterator<LinearClassifierFst<Arc>>(fst,\n                                                     fst.GetMutableImpl()) {}\n};\n\n// Specialization for LinearClassifierFst.\ntemplate <class Arc>\nclass ArcIterator<LinearClassifierFst<Arc>>\n    : public CacheArcIterator<LinearClassifierFst<Arc>> {\n public:\n  using StateId = typename Arc::StateId;\n\n  ArcIterator(const LinearClassifierFst<Arc> &fst, StateId s)\n      : CacheArcIterator<LinearClassifierFst<Arc>>(fst.GetMutableImpl(), s) {\n    if (!fst.GetImpl()->HasArcs(s)) fst.GetMutableImpl()->Expand(s);\n  }\n};\n\ntemplate <class Arc>\ninline void LinearClassifierFst<Arc>::InitStateIterator(\n    StateIteratorData<Arc> *data) const {\n  data->base = new StateIterator<LinearClassifierFst<Arc>>(*this);\n}\n\n// Specialized Matcher for LinearFsts. This matcher only supports\n// matching from the input side. This is intentional because comparing\n// the scores of different input sequences with the same output\n// sequence is meaningless in a discriminative model.\ntemplate <class F>\nclass LinearFstMatcherTpl : public MatcherBase<typename F::Arc> {\n public:\n  typedef typename F::Arc Arc;\n  typedef typename Arc::Label Label;\n  typedef typename Arc::Weight Weight;\n  typedef typename Arc::StateId StateId;\n  typedef F FST;\n\n  // This makes a copy of the FST.\n  LinearFstMatcherTpl(const FST &fst, MatchType match_type)\n      : owned_fst_(fst.Copy()),\n        fst_(*owned_fst_),\n        match_type_(match_type),\n        s_(kNoStateId),\n        current_loop_(false),\n        loop_(kNoLabel, 0, Weight::One(), kNoStateId),\n        cur_arc_(0),\n        error_(false) {\n    switch (match_type_) {\n      case MATCH_INPUT:\n      case MATCH_OUTPUT:\n      case MATCH_NONE:\n        break;\n      default:\n        FSTERROR() << \"LinearFstMatcherTpl: Bad match type\";\n        match_type_ = MATCH_NONE;\n        error_ = true;\n    }\n  }\n\n  // This doesn't copy the FST.\n  LinearFstMatcherTpl(const FST *fst, MatchType match_type)\n      : fst_(*fst),\n        match_type_(match_type),\n        s_(kNoStateId),\n        current_loop_(false),\n        loop_(kNoLabel, 0, Weight::One(), kNoStateId),\n        cur_arc_(0),\n        error_(false) {\n    switch (match_type_) {\n      case MATCH_INPUT:\n      case MATCH_OUTPUT:\n      case MATCH_NONE:\n        break;\n      default:\n        FSTERROR() << \"LinearFstMatcherTpl: Bad match type\";\n        match_type_ = MATCH_NONE;\n        error_ = true;\n    }\n  }\n\n  // This makes a copy of the FST.\n  LinearFstMatcherTpl(const LinearFstMatcherTpl<F> &matcher, bool safe = false)\n      : owned_fst_(matcher.fst_.Copy(safe)),\n        fst_(*owned_fst_),\n        match_type_(matcher.match_type_),\n        s_(kNoStateId),\n        current_loop_(false),\n        loop_(matcher.loop_),\n        cur_arc_(0),\n        error_(matcher.error_) {}\n\n  LinearFstMatcherTpl<F> *Copy(bool safe = false) const override {\n    return new LinearFstMatcherTpl<F>(*this, safe);\n  }\n\n  MatchType Type(bool /*test*/) const override {\n    // `MATCH_INPUT` is the only valid type\n    return match_type_ == MATCH_INPUT ? match_type_ : MATCH_NONE;\n  }\n\n  void SetState(StateId s) final {\n    if (s_ == s) return;\n    s_ = s;\n    // `MATCH_INPUT` is the only valid type\n    if (match_type_ != MATCH_INPUT) {\n      FSTERROR() << \"LinearFstMatcherTpl: Bad match type\";\n      error_ = true;\n    }\n    loop_.nextstate = s;\n  }\n\n  bool Find(Label label) final {\n    if (error_) {\n      current_loop_ = false;\n      return false;\n    }\n    current_loop_ = label == 0;\n    if (label == kNoLabel) label = 0;\n    arcs_.clear();\n    cur_arc_ = 0;\n    fst_.GetMutableImpl()->MatchInput(s_, label, &arcs_);\n    return current_loop_ || !arcs_.empty();\n  }\n\n  bool Done() const final {\n    return !(current_loop_ || cur_arc_ < arcs_.size());\n  }\n\n  const Arc &Value() const final {\n    return current_loop_ ? loop_ : arcs_[cur_arc_];\n  }\n\n  void Next() final {\n    if (current_loop_)\n      current_loop_ = false;\n    else\n      ++cur_arc_;\n  }\n\n  ssize_t Priority(StateId s) final { return kRequirePriority; }\n\n  const FST &GetFst() const override { return fst_; }\n\n  uint64 Properties(uint64 props) const override {\n    if (error_) props |= kError;\n    return props;\n  }\n\n  uint32 Flags() const override { return kRequireMatch; }\n\n private:\n  std::unique_ptr<const FST> owned_fst_;\n  const FST &fst_;\n  MatchType match_type_;  // Type of match to perform.\n  StateId s_;             // Current state.\n  bool current_loop_;     // Current arc is the implicit loop.\n  Arc loop_;              // For non-consuming symbols.\n  // All out-going arcs matching the label in last Find() call.\n  std::vector<Arc> arcs_;\n  size_t cur_arc_;  // Index to the arc that `Value()` should return.\n  bool error_;      // Error encountered.\n};\n\n}  // namespace fst\n\n#endif  // FST_EXTENSIONS_LINEAR_LINEAR_FST_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/extensions/linear/linearscript.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#ifndef FST_EXTENSIONS_LINEAR_LINEARSCRIPT_H_\n#define FST_EXTENSIONS_LINEAR_LINEARSCRIPT_H_\n\n#include <istream>\n#include <sstream>\n#include <string>\n#include <vector>\n\n#include <fst/compat.h>\n#include <fst/extensions/linear/linear-fst-data-builder.h>\n#include <fst/extensions/linear/linear-fst.h>\n#include <fstream>\n#include <fst/symbol-table.h>\n#include <fst/script/arg-packs.h>\n#include <fst/script/script-impl.h>\n\nDECLARE_string(delimiter);\nDECLARE_string(empty_symbol);\nDECLARE_string(start_symbol);\nDECLARE_string(end_symbol);\nDECLARE_bool(classifier);\n\nnamespace fst {\nnamespace script {\ntypedef std::tuple<const string &, const string &, const string &, char **, int,\n                   const string &, const string &, const string &,\n                   const string &>\n    LinearCompileArgs;\n\nbool ValidateDelimiter();\nbool ValidateEmptySymbol();\n\n// Returns the proper label given the symbol. For symbols other than\n// `FLAGS_start_symbol` or `FLAGS_end_symbol`, looks up the symbol\n// table to decide the label. Depending on whether\n// `FLAGS_start_symbol` and `FLAGS_end_symbol` are identical, it\n// either returns `kNoLabel` for later processing or decides the label\n// right away.\ntemplate <class Arc>\ninline typename Arc::Label LookUp(const string &str, SymbolTable *syms) {\n  if (str == FLAGS_start_symbol)\n    return str == FLAGS_end_symbol ? kNoLabel\n                                   : LinearFstData<Arc>::kStartOfSentence;\n  else if (str == FLAGS_end_symbol)\n    return LinearFstData<Arc>::kEndOfSentence;\n  else\n    return syms->AddSymbol(str);\n}\n\n// Splits `str` with `delim` as the delimiter and stores the labels in\n// `output`.\ntemplate <class Arc>\nvoid SplitAndPush(const string &str, const char delim, SymbolTable *syms,\n                  std::vector<typename Arc::Label> *output) {\n  if (str == FLAGS_empty_symbol) return;\n  std::istringstream strm(str);\n  string buf;\n  while (std::getline(strm, buf, delim))\n    output->push_back(LookUp<Arc>(buf, syms));\n}\n\n// Like `std::replace_copy` but returns the number of modifications\ntemplate <class InputIterator, class OutputIterator, class T>\nsize_t ReplaceCopy(InputIterator first, InputIterator last,\n                   OutputIterator result, const T &old_value,\n                   const T &new_value) {\n  size_t changes = 0;\n  while (first != last) {\n    if (*first == old_value) {\n      *result = new_value;\n      ++changes;\n    } else {\n      *result = *first;\n    }\n    ++first;\n    ++result;\n  }\n  return changes;\n}\n\ntemplate <class Arc>\nbool GetVocabRecord(const string &vocab, std::istream &strm,  // NOLINT\n                    SymbolTable *isyms, SymbolTable *fsyms, SymbolTable *osyms,\n                    typename Arc::Label *word,\n                    std::vector<typename Arc::Label> *feature_labels,\n                    std::vector<typename Arc::Label> *possible_labels,\n                    size_t *num_line);\n\ntemplate <class Arc>\nbool GetModelRecord(const string &model, std::istream &strm,  // NOLINT\n                    SymbolTable *fsyms, SymbolTable *osyms,\n                    std::vector<typename Arc::Label> *input_labels,\n                    std::vector<typename Arc::Label> *output_labels,\n                    typename Arc::Weight *weight, size_t *num_line);\n\n// Reads in vocabulary file. Each line is in the following format\n//\n//   word <whitespace> features [ <whitespace> possible output ]\n//\n// where features and possible output are `FLAGS_delimiter`-delimited lists of\n// tokens\ntemplate <class Arc>\nvoid AddVocab(const string &vocab, SymbolTable *isyms, SymbolTable *fsyms,\n              SymbolTable *osyms, LinearFstDataBuilder<Arc> *builder) {\n  std::ifstream in(vocab);\n  if (!in) LOG(FATAL) << \"Can't open file: \" << vocab;\n  size_t num_line = 0, num_added = 0;\n  std::vector<string> fields;\n  std::vector<typename Arc::Label> feature_labels, possible_labels;\n  typename Arc::Label word;\n  while (GetVocabRecord<Arc>(vocab, in, isyms, fsyms, osyms, &word,\n                             &feature_labels, &possible_labels, &num_line)) {\n    if (word == kNoLabel) {\n      LOG(WARNING) << \"Ignored: boundary word: \" << fields[0];\n      continue;\n    }\n    if (possible_labels.empty())\n      num_added += builder->AddWord(word, feature_labels);\n    else\n      num_added += builder->AddWord(word, feature_labels, possible_labels);\n  }\n  VLOG(1) << \"Read \" << num_added << \" words in \" << num_line << \" lines from \"\n          << vocab;\n}\n\ntemplate <class Arc>\nvoid AddVocab(const string &vocab, SymbolTable *isyms, SymbolTable *fsyms,\n              SymbolTable *osyms,\n              LinearClassifierFstDataBuilder<Arc> *builder) {\n  std::ifstream in(vocab);\n  if (!in) LOG(FATAL) << \"Can't open file: \" << vocab;\n  size_t num_line = 0, num_added = 0;\n  std::vector<string> fields;\n  std::vector<typename Arc::Label> feature_labels, possible_labels;\n  typename Arc::Label word;\n  while (GetVocabRecord<Arc>(vocab, in, isyms, fsyms, osyms, &word,\n                             &feature_labels, &possible_labels, &num_line)) {\n    if (!possible_labels.empty())\n      LOG(FATAL)\n          << \"Classifier vocabulary should not have possible output constraint\";\n    if (word == kNoLabel) {\n      LOG(WARNING) << \"Ignored: boundary word: \" << fields[0];\n      continue;\n    }\n    num_added += builder->AddWord(word, feature_labels);\n  }\n  VLOG(1) << \"Read \" << num_added << \" words in \" << num_line << \" lines from \"\n          << vocab;\n}\n\n// Reads in model file. The first line is an integer designating the\n// size of future window in the input sequences. After this, each line\n// is in the following format\n//\n//   input sequence <whitespace> output sequence <whitespace> weight\n//\n// input sequence is a `FLAGS_delimiter`-delimited sequence of feature\n// labels (see `AddVocab()`) . output sequence is a\n// `FLAGS_delimiter`-delimited sequence of output labels where the\n// last label is the output of the feature position before the history\n// boundary.\ntemplate <class Arc>\nvoid AddModel(const string &model, SymbolTable *fsyms, SymbolTable *osyms,\n              LinearFstDataBuilder<Arc> *builder) {\n  std::ifstream in(model);\n  if (!in) LOG(FATAL) << \"Can't open file: \" << model;\n  string line;\n  std::getline(in, line);\n  if (!in) LOG(FATAL) << \"Empty file: \" << model;\n  size_t future_size;\n  {\n    std::istringstream strm(line);\n    strm >> future_size;\n    if (!strm) LOG(FATAL) << \"Can't read future size: \" << model;\n  }\n  size_t num_line = 1, num_added = 0;\n  const int group = builder->AddGroup(future_size);\n  VLOG(1) << \"Group \" << group << \": from \" << model << \"; future size is \"\n          << future_size << \".\";\n  // Add the rest of lines as a single feature group\n  std::vector<string> fields;\n  std::vector<typename Arc::Label> input_labels, output_labels;\n  typename Arc::Weight weight;\n  while (GetModelRecord<Arc>(model, in, fsyms, osyms, &input_labels,\n                             &output_labels, &weight, &num_line)) {\n    if (output_labels.empty())\n      LOG(FATAL) << \"Empty output sequence in source \" << model << \", line \"\n                 << num_line;\n\n    const typename Arc::Label marks[] = {LinearFstData<Arc>::kStartOfSentence,\n                                         LinearFstData<Arc>::kEndOfSentence};\n\n    std::vector<typename Arc::Label> copy_input(input_labels.size()),\n        copy_output(output_labels.size());\n    for (int i = 0; i < 2; ++i) {\n      for (int j = 0; j < 2; ++j) {\n        size_t num_input_changes =\n            ReplaceCopy(input_labels.begin(), input_labels.end(),\n                        copy_input.begin(), kNoLabel, marks[i]);\n        size_t num_output_changes =\n            ReplaceCopy(output_labels.begin(), output_labels.end(),\n                        copy_output.begin(), kNoLabel, marks[j]);\n        if ((num_input_changes > 0 || i == 0) &&\n            (num_output_changes > 0 || j == 0))\n          num_added +=\n              builder->AddWeight(group, copy_input, copy_output, weight);\n      }\n    }\n  }\n  VLOG(1) << \"Group \" << group << \": read \" << num_added << \" weight(s) in \"\n          << num_line << \" lines.\";\n}\n\ntemplate <class Arc>\nvoid AddModel(const string &model, SymbolTable *fsyms, SymbolTable *osyms,\n              LinearClassifierFstDataBuilder<Arc> *builder) {\n  std::ifstream in(model);\n  if (!in) LOG(FATAL) << \"Can't open file: \" << model;\n  string line;\n  std::getline(in, line);\n  if (!in) LOG(FATAL) << \"Empty file: \" << model;\n  size_t future_size;\n  {\n    std::istringstream strm(line);\n    strm >> future_size;\n    if (!strm) LOG(FATAL) << \"Can't read future size: \" << model;\n  }\n  if (future_size != 0)\n    LOG(FATAL) << \"Classifier model must have future size = 0; got \"\n               << future_size << \" from \" << model;\n  size_t num_line = 1, num_added = 0;\n  const int group = builder->AddGroup();\n  VLOG(1) << \"Group \" << group << \": from \" << model << \"; future size is \"\n          << future_size << \".\";\n  // Add the rest of lines as a single feature group\n  std::vector<string> fields;\n  std::vector<typename Arc::Label> input_labels, output_labels;\n  typename Arc::Weight weight;\n  while (GetModelRecord<Arc>(model, in, fsyms, osyms, &input_labels,\n                             &output_labels, &weight, &num_line)) {\n    if (output_labels.size() != 1)\n      LOG(FATAL) << \"Output not a single label in source \" << model << \", line \"\n                 << num_line;\n\n    const typename Arc::Label marks[] = {LinearFstData<Arc>::kStartOfSentence,\n                                         LinearFstData<Arc>::kEndOfSentence};\n\n    typename Arc::Label pred = output_labels[0];\n\n    std::vector<typename Arc::Label> copy_input(input_labels.size());\n    for (int i = 0; i < 2; ++i) {\n      size_t num_input_changes =\n          ReplaceCopy(input_labels.begin(), input_labels.end(),\n                      copy_input.begin(), kNoLabel, marks[i]);\n      if (num_input_changes > 0 || i == 0)\n        num_added += builder->AddWeight(group, copy_input, pred, weight);\n    }\n  }\n  VLOG(1) << \"Group \" << group << \": read \" << num_added << \" weight(s) in \"\n          << num_line << \" lines.\";\n}\n\nvoid SplitByWhitespace(const string &str, std::vector<string> *out);\nint ScanNumClasses(char **models, int models_length);\n\ntemplate <class Arc>\nvoid LinearCompileTpl(LinearCompileArgs *args) {\n  const string &epsilon_symbol = std::get<0>(*args);\n  const string &unknown_symbol = std::get<1>(*args);\n  const string &vocab = std::get<2>(*args);\n  char **models = std::get<3>(*args);\n  const int models_length = std::get<4>(*args);\n  const string &out = std::get<5>(*args);\n  const string &save_isymbols = std::get<6>(*args);\n  const string &save_fsymbols = std::get<7>(*args);\n  const string &save_osymbols = std::get<8>(*args);\n\n  SymbolTable isyms,  // input (e.g. word tokens)\n      osyms,          // output (e.g. tags)\n      fsyms;          // feature (e.g. word identity, suffix, etc.)\n  isyms.AddSymbol(epsilon_symbol);\n  osyms.AddSymbol(epsilon_symbol);\n  fsyms.AddSymbol(epsilon_symbol);\n  isyms.AddSymbol(unknown_symbol);\n\n  VLOG(1) << \"start-of-sentence label is \"\n          << LinearFstData<Arc>::kStartOfSentence;\n  VLOG(1) << \"end-of-sentence label is \" << LinearFstData<Arc>::kEndOfSentence;\n\n  if (FLAGS_classifier) {\n    int num_classes = ScanNumClasses(models, models_length);\n    LinearClassifierFstDataBuilder<Arc> builder(num_classes, &isyms, &fsyms,\n                                                &osyms);\n\n    AddVocab(vocab, &isyms, &fsyms, &osyms, &builder);\n    for (int i = 0; i < models_length; ++i)\n      AddModel(models[i], &fsyms, &osyms, &builder);\n\n    LinearClassifierFst<Arc> fst(builder.Dump(), num_classes, &isyms, &osyms);\n    fst.Write(out);\n  } else {\n    LinearFstDataBuilder<Arc> builder(&isyms, &fsyms, &osyms);\n\n    AddVocab(vocab, &isyms, &fsyms, &osyms, &builder);\n    for (int i = 0; i < models_length; ++i)\n      AddModel(models[i], &fsyms, &osyms, &builder);\n\n    LinearTaggerFst<Arc> fst(builder.Dump(), &isyms, &osyms);\n    fst.Write(out);\n  }\n\n  if (!save_isymbols.empty()) isyms.WriteText(save_isymbols);\n  if (!save_fsymbols.empty()) fsyms.WriteText(save_fsymbols);\n  if (!save_osymbols.empty()) osyms.WriteText(save_osymbols);\n}\n\nvoid LinearCompile(const string &arc_type, const string &epsilon_symbol,\n                   const string &unknown_symbol, const string &vocab,\n                   char **models, int models_len, const string &out,\n                   const string &save_isymbols, const string &save_fsymbols,\n                   const string &save_osymbols);\n\ntemplate <class Arc>\nbool GetVocabRecord(const string &vocab, std::istream &strm,  // NOLINT\n                    SymbolTable *isyms, SymbolTable *fsyms, SymbolTable *osyms,\n                    typename Arc::Label *word,\n                    std::vector<typename Arc::Label> *feature_labels,\n                    std::vector<typename Arc::Label> *possible_labels,\n                    size_t *num_line) {\n  string line;\n  if (!std::getline(strm, line)) return false;\n  ++(*num_line);\n\n  std::vector<string> fields;\n  SplitByWhitespace(line, &fields);\n  if (fields.size() != 3)\n    LOG(FATAL) << \"Wrong number of fields in source \" << vocab << \", line \"\n               << num_line;\n\n  feature_labels->clear();\n  possible_labels->clear();\n\n  *word = LookUp<Arc>(fields[0], isyms);\n\n  const char delim = FLAGS_delimiter[0];\n  SplitAndPush<Arc>(fields[1], delim, fsyms, feature_labels);\n  SplitAndPush<Arc>(fields[2], delim, osyms, possible_labels);\n\n  return true;\n}\n\ntemplate <class Arc>\nbool GetModelRecord(const string &model, std::istream &strm,  // NOLINT\n                    SymbolTable *fsyms, SymbolTable *osyms,\n                    std::vector<typename Arc::Label> *input_labels,\n                    std::vector<typename Arc::Label> *output_labels,\n                    typename Arc::Weight *weight, size_t *num_line) {\n  string line;\n  if (!std::getline(strm, line)) return false;\n  ++(*num_line);\n\n  std::vector<string> fields;\n  SplitByWhitespace(line, &fields);\n  if (fields.size() != 3)\n    LOG(FATAL) << \"Wrong number of fields in source \" << model << \", line \"\n               << num_line;\n\n  input_labels->clear();\n  output_labels->clear();\n\n  const char delim = FLAGS_delimiter[0];\n  SplitAndPush<Arc>(fields[0], delim, fsyms, input_labels);\n  SplitAndPush<Arc>(fields[1], delim, osyms, output_labels);\n\n  *weight = StrToWeight<typename Arc::Weight>(fields[2], model, *num_line);\n\n  GuessStartOrEnd<Arc>(input_labels, kNoLabel);\n  GuessStartOrEnd<Arc>(output_labels, kNoLabel);\n\n  return true;\n}\n}  // namespace script\n}  // namespace fst\n\n#define REGISTER_FST_LINEAR_OPERATIONS(Arc) \\\n  REGISTER_FST_OPERATION(LinearCompileTpl, Arc, LinearCompileArgs);\n\n#endif  // FST_EXTENSIONS_LINEAR_LINEARSCRIPT_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/extensions/linear/loglinear-apply.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#ifndef FST_EXTENSIONS_LINEAR_LOGLINEAR_APPLY_H_\n#define FST_EXTENSIONS_LINEAR_LOGLINEAR_APPLY_H_\n\n#include <fst/compat.h>\n#include <fst/arc.h>\n#include <fst/arc-map.h>\n#include <fst/compose.h>\n#include <fst/determinize.h>\n#include <fst/float-weight.h>\n#include <fst/fst.h>\n#include <fst/minimize.h>\n#include <fst/mutable-fst.h>\n#include <fst/project.h>\n#include <fst/rmepsilon.h>\n#include <fst/vector-fst.h>\n\nnamespace fst {\n\n// Applies a FST model as a discriminative model to weighted input\n// `ifst`. `A` is an arc type with tropical weight of all the\n// input/output FSTs.\n//\n// In general, consider `ifst` an unnormalized probability\n// distribution between its input X and output Y, P(X, Y); and `lfst`\n// a group of unnormalized probability distributions of all its output\n// Z for every input Y, Q(Z|Y). `normalize` controls whether Q is\n// normalized for every Y before chaining with P(X, Y). I.e., for a\n// path (X, Y, Z) in `ofst` (where Y is hidden),\n//\n// - When `normalize` is true, its weight is P(X, Y) Q(Z|Y) / sum_z Q(z|Y);\n// - When `normalize` is false, its weight is P(X, Y) Q(Z|Y).\ntemplate <class A>\nvoid LogLinearApply(const Fst<A> &ifst, const Fst<A> &lfst, MutableFst<A> *ofst,\n                    bool normalize = true) {\n  LogLinearApply<A, LogArc>(ifst, lfst, ofst, normalize);\n}\n\n// This version gives finer control over the arc type (`B`) to be used\n// in normalization. `B` is an arc type with log weight (e.g. `LogArc`\n// or `Log64Arc`).\ntemplate <class A, class B>\nvoid LogLinearApply(const Fst<A> &ifst, const Fst<A> &lfst, MutableFst<A> *ofst,\n                    bool normalize = true) {\n  if (normalize) {\n    VectorFst<A> unnormalized_ofst, rescored_ifsa;\n    Compose(ifst, lfst, &unnormalized_ofst);\n    {\n      VectorFst<A> tropical_ifsa(unnormalized_ofst);\n      Project(&tropical_ifsa, PROJECT_INPUT);\n      {\n        VectorFst<B> minimal_log_ifsa;\n        {\n          VectorFst<B> log_ifsa;\n          ArcMap(tropical_ifsa, &log_ifsa, WeightConvertMapper<A, B>());\n          RmEpsilon(&log_ifsa);\n          Determinize(log_ifsa, &minimal_log_ifsa);\n        }\n        Minimize(&minimal_log_ifsa);\n        ArcMap(&minimal_log_ifsa, InvertWeightMapper<B>());\n        ArcMap(minimal_log_ifsa, &tropical_ifsa, WeightConvertMapper<B, A>());\n      }\n      ArcSort(&tropical_ifsa, OLabelCompare<A>());\n      Compose(tropical_ifsa, ifst, &rescored_ifsa);\n    }\n    ArcSort(&rescored_ifsa, OLabelCompare<A>());\n    Compose(rescored_ifsa, unnormalized_ofst, ofst);\n  } else {\n    Compose(ifst, lfst, ofst);\n  }\n}\n\n}  // namespace fst\n\n#endif  // FST_EXTENSIONS_LINEAR_LOGLINEAR_APPLY_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/extensions/linear/trie.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#ifndef FST_EXTENSIONS_LINEAR_TRIE_H_\n#define FST_EXTENSIONS_LINEAR_TRIE_H_\n\n#include <unordered_map>\n#include <utility>\n#include <vector>\n\n#include <fst/compat.h>\n#include <fst/util.h>\n\nnamespace fst {\n\nconst int kNoTrieNodeId = -1;\n\n// Forward declarations of all available trie topologies.\ntemplate <class L, class H>\nclass NestedTrieTopology;\ntemplate <class L, class H>\nclass FlatTrieTopology;\n\n// A pair of parent node id and label, part of a trie edge\ntemplate <class L>\nstruct ParentLabel {\n  int parent;\n  L label;\n\n  ParentLabel() {}\n  ParentLabel(int p, L l) : parent(p), label(l) {}\n\n  bool operator==(const ParentLabel &that) const {\n    return parent == that.parent && label == that.label;\n  }\n\n  std::istream &Read(std::istream &strm) {  // NOLINT\n    ReadType(strm, &parent);\n    ReadType(strm, &label);\n    return strm;\n  }\n\n  std::ostream &Write(std::ostream &strm) const {  // NOLINT\n    WriteType(strm, parent);\n    WriteType(strm, label);\n    return strm;\n  }\n};\n\ntemplate <class L, class H>\nstruct ParentLabelHash {\n  size_t operator()(const ParentLabel<L> &pl) const {\n    return static_cast<size_t>(pl.parent * 7853 + H()(pl.label));\n  }\n};\n\n// The trie topology in a nested tree of hash maps; allows efficient\n// iteration over children of a specific node.\ntemplate <class L, class H>\nclass NestedTrieTopology {\n public:\n  typedef L Label;\n  typedef H Hash;\n  typedef std::unordered_map<L, int, H> NextMap;\n\n  class const_iterator {\n   public:\n    typedef std::forward_iterator_tag iterator_category;\n    typedef std::pair<ParentLabel<L>, int> value_type;\n    typedef std::ptrdiff_t difference_type;\n    typedef const value_type *pointer;\n    typedef const value_type &reference;\n\n    friend class NestedTrieTopology<L, H>;\n\n    const_iterator() : ptr_(nullptr), cur_node_(kNoTrieNodeId), cur_edge_() {}\n\n    reference operator*() {\n      UpdateStub();\n      return stub_;\n    }\n    pointer operator->() {\n      UpdateStub();\n      return &stub_;\n    }\n\n    const_iterator &operator++();\n    const_iterator &operator++(int);  // NOLINT\n\n    bool operator==(const const_iterator &that) const {\n      return ptr_ == that.ptr_ && cur_node_ == that.cur_node_ &&\n             cur_edge_ == that.cur_edge_;\n    }\n    bool operator!=(const const_iterator &that) const {\n      return !(*this == that);\n    }\n\n   private:\n    const_iterator(const NestedTrieTopology *ptr, int cur_node)\n        : ptr_(ptr), cur_node_(cur_node) {\n      SetProperCurEdge();\n    }\n\n    void SetProperCurEdge() {\n      if (cur_node_ < ptr_->NumNodes())\n        cur_edge_ = ptr_->nodes_[cur_node_]->begin();\n      else\n        cur_edge_ = ptr_->nodes_[0]->begin();\n    }\n\n    void UpdateStub() {\n      stub_.first = ParentLabel<L>(cur_node_, cur_edge_->first);\n      stub_.second = cur_edge_->second;\n    }\n\n    const NestedTrieTopology *ptr_;\n    int cur_node_;\n    typename NextMap::const_iterator cur_edge_;\n    value_type stub_;\n  };\n\n  NestedTrieTopology();\n  NestedTrieTopology(const NestedTrieTopology &that);\n  ~NestedTrieTopology();\n  void swap(NestedTrieTopology &that);\n  NestedTrieTopology &operator=(const NestedTrieTopology &that);\n  bool operator==(const NestedTrieTopology &that) const;\n  bool operator!=(const NestedTrieTopology &that) const;\n\n  int Root() const { return 0; }\n  size_t NumNodes() const { return nodes_.size(); }\n  int Insert(int parent, const L &label);\n  int Find(int parent, const L &label) const;\n  const NextMap &ChildrenOf(int parent) const { return *nodes_[parent]; }\n\n  std::istream &Read(std::istream &strm);         // NOLINT\n  std::ostream &Write(std::ostream &strm) const;  // NOLINT\n\n  const_iterator begin() const { return const_iterator(this, 0); }\n  const_iterator end() const { return const_iterator(this, NumNodes()); }\n\n private:\n  std::vector<NextMap *>\n      nodes_;  // Use pointers to avoid copying the maps when the\n               // vector grows\n};\n\ntemplate <class L, class H>\nNestedTrieTopology<L, H>::NestedTrieTopology() {\n  nodes_.push_back(new NextMap);\n}\n\ntemplate <class L, class H>\nNestedTrieTopology<L, H>::NestedTrieTopology(const NestedTrieTopology &that) {\n  nodes_.reserve(that.nodes_.size());\n  for (size_t i = 0; i < that.nodes_.size(); ++i) {\n    NextMap *node = that.nodes_[i];\n    nodes_.push_back(new NextMap(*node));\n  }\n}\n\ntemplate <class L, class H>\nNestedTrieTopology<L, H>::~NestedTrieTopology() {\n  for (size_t i = 0; i < nodes_.size(); ++i) {\n    NextMap *node = nodes_[i];\n    delete node;\n  }\n}\n\n// TODO(wuke): std::swap compatibility\ntemplate <class L, class H>\ninline void NestedTrieTopology<L, H>::swap(NestedTrieTopology &that) {\n  nodes_.swap(that.nodes_);\n}\n\ntemplate <class L, class H>\ninline NestedTrieTopology<L, H> &NestedTrieTopology<L, H>::operator=(\n    const NestedTrieTopology &that) {\n  NestedTrieTopology copy(that);\n  swap(copy);\n  return *this;\n}\n\ntemplate <class L, class H>\ninline bool NestedTrieTopology<L, H>::operator==(\n    const NestedTrieTopology &that) const {\n  if (NumNodes() != that.NumNodes()) return false;\n  for (int i = 0; i < NumNodes(); ++i)\n    if (ChildrenOf(i) != that.ChildrenOf(i)) return false;\n  return true;\n}\n\ntemplate <class L, class H>\ninline bool NestedTrieTopology<L, H>::operator!=(\n    const NestedTrieTopology &that) const {\n  return !(*this == that);\n}\n\ntemplate <class L, class H>\ninline int NestedTrieTopology<L, H>::Insert(int parent, const L &label) {\n  int ret = Find(parent, label);\n  if (ret == kNoTrieNodeId) {\n    ret = NumNodes();\n    (*nodes_[parent])[label] = ret;\n    nodes_.push_back(new NextMap);\n  }\n  return ret;\n}\n\ntemplate <class L, class H>\ninline int NestedTrieTopology<L, H>::Find(int parent, const L &label) const {\n  typename NextMap::const_iterator it = nodes_[parent]->find(label);\n  return it == nodes_[parent]->end() ? kNoTrieNodeId : it->second;\n}\n\ntemplate <class L, class H>\ninline std::istream &NestedTrieTopology<L, H>::Read(\n    std::istream &strm) {  // NOLINT\n  NestedTrieTopology new_trie;\n  size_t num_nodes;\n  if (!ReadType(strm, &num_nodes)) return strm;\n  for (size_t i = 1; i < num_nodes; ++i) new_trie.nodes_.push_back(new NextMap);\n  for (size_t i = 0; i < num_nodes; ++i) ReadType(strm, new_trie.nodes_[i]);\n  if (strm) swap(new_trie);\n  return strm;\n}\n\ntemplate <class L, class H>\ninline std::ostream &NestedTrieTopology<L, H>::Write(\n    std::ostream &strm) const {  // NOLINT\n  WriteType(strm, NumNodes());\n  for (size_t i = 0; i < NumNodes(); ++i) WriteType(strm, *nodes_[i]);\n  return strm;\n}\n\ntemplate <class L, class H>\ninline typename NestedTrieTopology<L, H>::const_iterator\n    &NestedTrieTopology<L, H>::const_iterator::operator++() {\n  ++cur_edge_;\n  if (cur_edge_ == ptr_->nodes_[cur_node_]->end()) {\n    ++cur_node_;\n    while (cur_node_ < ptr_->NumNodes() && ptr_->nodes_[cur_node_]->empty())\n      ++cur_node_;\n    SetProperCurEdge();\n  }\n  return *this;\n}\n\ntemplate <class L, class H>\ninline typename NestedTrieTopology<L, H>::const_iterator\n    &NestedTrieTopology<L, H>::const_iterator::operator++(int) {  // NOLINT\n  const_iterator save(*this);\n  ++(*this);\n  return save;\n}\n\n// The trie topology in a single hash map; only allows iteration over\n// all the edges in arbitrary order.\ntemplate <class L, class H>\nclass FlatTrieTopology {\n private:\n  typedef std::unordered_map<ParentLabel<L>, int, ParentLabelHash<L, H>>\n      NextMap;\n\n public:\n  // Iterator over edges as std::pair<ParentLabel<L>, int>\n  typedef typename NextMap::const_iterator const_iterator;\n  typedef L Label;\n  typedef H Hash;\n\n  FlatTrieTopology() {}\n  FlatTrieTopology(const FlatTrieTopology &that) : next_(that.next_) {}\n  template <class T>\n  explicit FlatTrieTopology(const T &that);\n\n  // TODO(wuke): std::swap compatibility\n  void swap(FlatTrieTopology &that) { next_.swap(that.next_); }\n\n  bool operator==(const FlatTrieTopology &that) const {\n    return next_ == that.next_;\n  }\n  bool operator!=(const FlatTrieTopology &that) const {\n    return !(*this == that);\n  }\n\n  int Root() const { return 0; }\n  size_t NumNodes() const { return next_.size() + 1; }\n  int Insert(int parent, const L &label);\n  int Find(int parent, const L &label) const;\n\n  std::istream &Read(std::istream &strm) {  // NOLINT\n    return ReadType(strm, &next_);\n  }\n  std::ostream &Write(std::ostream &strm) const {  // NOLINT\n    return WriteType(strm, next_);\n  }\n\n  const_iterator begin() const { return next_.begin(); }\n  const_iterator end() const { return next_.end(); }\n\n private:\n  NextMap next_;\n};\n\ntemplate <class L, class H>\ntemplate <class T>\nFlatTrieTopology<L, H>::FlatTrieTopology(const T &that)\n    : next_(that.begin(), that.end()) {}\n\ntemplate <class L, class H>\ninline int FlatTrieTopology<L, H>::Insert(int parent, const L &label) {\n  int ret = Find(parent, label);\n  if (ret == kNoTrieNodeId) {\n    ret = NumNodes();\n    next_[ParentLabel<L>(parent, label)] = ret;\n  }\n  return ret;\n}\n\ntemplate <class L, class H>\ninline int FlatTrieTopology<L, H>::Find(int parent, const L &label) const {\n  typename NextMap::const_iterator it =\n      next_.find(ParentLabel<L>(parent, label));\n  return it == next_.end() ? kNoTrieNodeId : it->second;\n}\n\n// A collection of implementations of the trie data structure. The key\n// is a sequence of type `L` which must be hashable. The value is of\n// `V` which must be default constructible and copyable. In addition,\n// a value object is stored for each node in the trie therefore\n// copying `V` should be cheap.\n//\n// One can access the store values with an integer node id, using the\n// [] operator. A valid node id can be obtained by the following ways:\n//\n// 1. Using the `Root()` method to get the node id of the root.\n//\n// 2. Iterating through 0 to `NumNodes() - 1`. The node ids are dense\n// so every integer in this range is a valid node id.\n//\n// 3. Using the node id returned from a successful `Insert()` or\n// `Find()` call.\n//\n// 4. Iterating over the trie edges with an `EdgeIterator` and using\n// the node ids returned from its `Parent()` and `Child()` methods.\n//\n// Below is an example of inserting keys into the trie:\n//\n//   const string words[] = {\"hello\", \"health\", \"jello\"};\n//   Trie<char, bool> dict;\n//   for (auto word : words) {\n//     int cur = dict.Root();\n//     for (char c : word) {\n//       cur = dict.Insert(cur, c);\n//     }\n//     dict[cur] = true;\n//   }\n//\n// And the following is an example of looking up the longest prefix of\n// a string using the trie constructed above:\n//\n//   string query = \"healed\";\n//   size_t prefix_length = 0;\n//   int cur = dict.Find(dict.Root(), query[prefix_length]);\n//   while (prefix_length < query.size() &&\n//     cur != Trie<char, bool>::kNoNodeId) {\n//     ++prefix_length;\n//     cur = dict.Find(cur, query[prefix_length]);\n//   }\ntemplate <class L, class V, class T>\nclass MutableTrie {\n public:\n  template <class LL, class VV, class TT>\n  friend class MutableTrie;\n\n  typedef L Label;\n  typedef V Value;\n  typedef T Topology;\n\n  // Constructs a trie with only the root node.\n  MutableTrie() {}\n\n  // Conversion from another trie of a possiblly different\n  // topology. The underlying topology must supported conversion.\n  template <class S>\n  explicit MutableTrie(const MutableTrie<L, V, S> &that)\n      : topology_(that.topology_), values_(that.values_) {}\n\n  // TODO(wuke): std::swap compatibility\n  void swap(MutableTrie &that) {\n    topology_.swap(that.topology_);\n    values_.swap(that.values_);\n  }\n\n  int Root() const { return topology_.Root(); }\n  size_t NumNodes() const { return topology_.NumNodes(); }\n\n  // Inserts an edge with given `label` at node `parent`. Returns the\n  // child node id. If the node already exists, returns the node id\n  // right away.\n  int Insert(int parent, const L &label) {\n    int ret = topology_.Insert(parent, label);\n    values_.resize(NumNodes());\n    return ret;\n  }\n\n  // Finds the node id of the node from `parent` via `label`. Returns\n  // `kNoTrieNodeId` when such a node does not exist.\n  int Find(int parent, const L &label) const {\n    return topology_.Find(parent, label);\n  }\n\n  const T &TrieTopology() const { return topology_; }\n\n  // Accesses the value stored for the given node.\n  V &operator[](int node_id) { return values_[node_id]; }\n  const V &operator[](int node_id) const { return values_[node_id]; }\n\n  // Comparison by content\n  bool operator==(const MutableTrie &that) const {\n    return topology_ == that.topology_ && values_ == that.values_;\n  }\n\n  bool operator!=(const MutableTrie &that) const { return !(*this == that); }\n\n  std::istream &Read(std::istream &strm) {  // NOLINT\n    ReadType(strm, &topology_);\n    ReadType(strm, &values_);\n    return strm;\n  }\n  std::ostream &Write(std::ostream &strm) const {  // NOLINT\n    WriteType(strm, topology_);\n    WriteType(strm, values_);\n    return strm;\n  }\n\n private:\n  T topology_;\n  std::vector<V> values_;\n};\n\n}  // namespace fst\n\n#endif  // FST_EXTENSIONS_LINEAR_TRIE_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/extensions/mpdt/compose.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Compose an MPDT and an FST.\n\n#ifndef FST_EXTENSIONS_MPDT_COMPOSE_H_\n#define FST_EXTENSIONS_MPDT_COMPOSE_H_\n\n#include <list>\n\n#include <fst/extensions/mpdt/mpdt.h>\n#include <fst/extensions/pdt/compose.h>\n#include <fst/compose.h>\n\nnamespace fst {\n\ntemplate <class Filter>\nclass MPdtParenFilter {\n public:\n  using FST1 = typename Filter::FST1;\n  using FST2 = typename Filter::FST2;\n  using Arc = typename Filter::Arc;\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using Matcher1 = typename Filter::Matcher1;\n  using Matcher2 = typename Filter::Matcher2;\n\n  using StackId = StateId;\n  using ParenStack = internal::MPdtStack<StackId, Label>;\n  using FilterState1 = typename Filter::FilterState;\n  using FilterState2 = IntegerFilterState<StackId>;\n  using FilterState = PairFilterState<FilterState1, FilterState2>;\n\n  MPdtParenFilter(const FST1 &fst1, const FST2 &fst2,\n                  Matcher1 *matcher1 = nullptr, Matcher2 *matcher2 = nullptr,\n                  const std::vector<std::pair<Label, Label>> *parens = nullptr,\n                  const std::vector<Label> *assignments = nullptr,\n                  bool expand = false, bool keep_parens = true)\n      : filter_(fst1, fst2, matcher1, matcher2),\n        parens_(parens ? *parens : std::vector<std::pair<Label, Label>>()),\n        assignments_(assignments ? *assignments : std::vector<Label>()),\n        expand_(expand),\n        keep_parens_(keep_parens),\n        fs_(FilterState::NoState()),\n        stack_(parens_, assignments_),\n        paren_id_(-1) {\n    if (parens) {\n      for (const auto &pair : *parens) {\n        parens_.push_back(pair);\n        GetMatcher1()->AddOpenParen(pair.first);\n        GetMatcher2()->AddOpenParen(pair.first);\n        if (!expand_) {\n          GetMatcher1()->AddCloseParen(pair.second);\n          GetMatcher2()->AddCloseParen(pair.second);\n        }\n      }\n    }\n  }\n\n  MPdtParenFilter(const MPdtParenFilter &filter, bool safe = false)\n      : filter_(filter.filter_, safe),\n        parens_(filter.parens_),\n        expand_(filter.expand_),\n        keep_parens_(filter.keep_parens_),\n        fs_(FilterState::NoState()),\n        stack_(filter.parens_, filter.assignments_),\n        paren_id_(-1) {}\n\n  FilterState Start() const {\n    return FilterState(filter_.Start(), FilterState2(0));\n  }\n\n  void SetState(StateId s1, StateId s2, const FilterState &fs) {\n    fs_ = fs;\n    filter_.SetState(s1, s2, fs_.GetState1());\n    if (!expand_) return;\n    const auto paren_id = stack_.Top(fs.GetState2().GetState());\n    if (paren_id != paren_id_) {\n      if (paren_id_ != -1) {\n        GetMatcher1()->RemoveCloseParen(parens_[paren_id_].second);\n        GetMatcher2()->RemoveCloseParen(parens_[paren_id_].second);\n      }\n      paren_id_ = paren_id;\n      if (paren_id_ != -1) {\n        GetMatcher1()->AddCloseParen(parens_[paren_id_].second);\n        GetMatcher2()->AddCloseParen(parens_[paren_id_].second);\n      }\n    }\n  }\n\n  FilterState FilterArc(Arc *arc1, Arc *arc2) const {\n    const auto fs1 = filter_.FilterArc(arc1, arc2);\n    const auto &fs2 = fs_.GetState2();\n    if (fs1 == FilterState1::NoState()) return FilterState::NoState();\n    if (arc1->olabel == kNoLabel && arc2->ilabel) {  // arc2 parentheses.\n      if (keep_parens_) {\n        arc1->ilabel = arc2->ilabel;\n      } else if (arc2->ilabel) {\n        arc2->olabel = arc1->ilabel;\n      }\n      return FilterParen(arc2->ilabel, fs1, fs2);\n    } else if (arc2->ilabel == kNoLabel && arc1->olabel) {  // arc1 parentheses\n      if (keep_parens_) {\n        arc2->olabel = arc1->olabel;\n      } else {\n        arc1->ilabel = arc2->olabel;\n      }\n      return FilterParen(arc1->olabel, fs1, fs2);\n    } else {\n      return FilterState(fs1, fs2);\n    }\n  }\n\n  void FilterFinal(Weight *w1, Weight *w2) const {\n    if (fs_.GetState2().GetState() != 0) *w1 = Weight::Zero();\n    filter_.FilterFinal(w1, w2);\n  }\n\n  // Returns respective matchers; ownership stays with filter.\n\n  Matcher1 *GetMatcher1() { return filter_.GetMatcher1(); }\n\n  Matcher2 *GetMatcher2() { return filter_.GetMatcher2(); }\n\n  uint64 Properties(uint64 iprops) const {\n    const auto oprops = filter_.Properties(iprops);\n    return oprops & kILabelInvariantProperties & kOLabelInvariantProperties;\n  }\n\n private:\n  const FilterState FilterParen(Label label, const FilterState1 &fs1,\n                                const FilterState2 &fs2) const {\n    if (!expand_) return FilterState(fs1, fs2);\n    const auto stack_id = stack_.Find(fs2.GetState(), label);\n    if (stack_id < 0) {\n      return FilterState::NoState();\n    } else {\n      return FilterState(fs1, FilterState2(stack_id));\n    }\n  }\n\n  Filter filter_;\n  std::vector<std::pair<Label, Label>> parens_;\n  std::vector<Label> assignments_;\n  bool expand_;       // Expands to FST?\n  bool keep_parens_;  // Retains parentheses in output?\n  FilterState fs_;    // Current filter state.\n  mutable ParenStack stack_;\n  ssize_t paren_id_;\n};\n\n// Class to setup composition options for MPDT composition. Default is to take\n// the MPDT as the first composition argument.\ntemplate <class Arc, bool left_pdt = true>\nclass MPdtComposeFstOptions\n    : public ComposeFstOptions<Arc, ParenMatcher<Fst<Arc>>,\n                               MPdtParenFilter<AltSequenceComposeFilter<\n                                   ParenMatcher<Fst<Arc>> >> > {\n public:\n  using Label = typename Arc::Label;\n  using MPdtMatcher = ParenMatcher<Fst<Arc>>;\n  using MPdtFilter = MPdtParenFilter<AltSequenceComposeFilter<MPdtMatcher>>;\n\n  using ComposeFstOptions<Arc, MPdtMatcher, MPdtFilter>::matcher1;\n  using ComposeFstOptions<Arc, MPdtMatcher, MPdtFilter>::matcher2;\n  using ComposeFstOptions<Arc, MPdtMatcher, MPdtFilter>::filter;\n\n  MPdtComposeFstOptions(const Fst<Arc> &ifst1,\n                        const std::vector<std::pair<Label, Label>> &parens,\n                        const std::vector<typename Arc::Label> &assignments,\n                        const Fst<Arc> &ifst2, bool expand = false,\n                        bool keep_parens = true) {\n    matcher1 = new MPdtMatcher(ifst1, MATCH_OUTPUT, kParenList);\n    matcher2 = new MPdtMatcher(ifst2, MATCH_INPUT, kParenLoop);\n    filter = new MPdtFilter(ifst1, ifst2, matcher1, matcher2, &parens,\n                            &assignments, expand, keep_parens);\n  }\n};\n\n// Class to setup composition options for PDT with FST composition.\n// Specialization is for the FST as the first composition argument.\ntemplate <class Arc>\nclass MPdtComposeFstOptions<Arc, false>\n    : public ComposeFstOptions<\n          Arc, ParenMatcher<Fst<Arc>>,\n          MPdtParenFilter<SequenceComposeFilter<ParenMatcher<Fst<Arc>> >> > {\n public:\n  using Label = typename Arc::Label;\n  using MPdtMatcher = ParenMatcher<Fst<Arc>>;\n  using MPdtFilter = MPdtParenFilter<SequenceComposeFilter<MPdtMatcher>>;\n\n  using ComposeFstOptions<Arc, MPdtMatcher, MPdtFilter>::matcher1;\n  using ComposeFstOptions<Arc, MPdtMatcher, MPdtFilter>::matcher2;\n  using ComposeFstOptions<Arc, MPdtMatcher, MPdtFilter>::filter;\n\n  MPdtComposeFstOptions(const Fst<Arc> &ifst1, const Fst<Arc> &ifst2,\n                        const std::vector<std::pair<Label, Label>> &parens,\n                        const std::vector<typename Arc::Label> &assignments,\n                        bool expand = false, bool keep_parens = true) {\n    matcher1 = new MPdtMatcher(ifst1, MATCH_OUTPUT, kParenLoop);\n    matcher2 = new MPdtMatcher(ifst2, MATCH_INPUT, kParenList);\n    filter = new MPdtFilter(ifst1, ifst2, matcher1, matcher2, &parens,\n                            &assignments, expand, keep_parens);\n  }\n};\n\nstruct MPdtComposeOptions {\n  bool connect;                  // Connect output?\n  PdtComposeFilter filter_type;  // Which pre-defined filter to use.\n\n  explicit MPdtComposeOptions(bool connect = true,\n                              PdtComposeFilter filter_type = PAREN_FILTER)\n      : connect(connect), filter_type(filter_type) {}\n};\n\n// Composes multi-pushdown transducer (MPDT) encoded as an FST (1st arg) and an\n// FST (2nd arg) with the result also an MPDT encoded as an FST (3rd arg). In\n// theMPDTs, some transitions are labeled with open or close parentheses (and\n// associated with a stack). To be interpreted as an MPDT, the parents on each\n// stack must balance on a path (see MPdtExpand()). The open-close parenthesis\n// label pairs are passed using the parens arguments, and the stack assignments\n// are passed using the assignments argument.\ntemplate <class Arc>\nvoid Compose(\n    const Fst<Arc> &ifst1,\n    const std::vector<std::pair<typename Arc::Label, typename Arc::Label>>\n        &parens,\n    const std::vector<typename Arc::Label> &assignments, const Fst<Arc> &ifst2,\n    MutableFst<Arc> *ofst,\n    const MPdtComposeOptions &opts = MPdtComposeOptions()) {\n  bool expand = opts.filter_type != PAREN_FILTER;\n  bool keep_parens = opts.filter_type != EXPAND_FILTER;\n  MPdtComposeFstOptions<Arc, true> copts(ifst1, parens, assignments, ifst2,\n                                         expand, keep_parens);\n  copts.gc_limit = 0;\n  *ofst = ComposeFst<Arc>(ifst1, ifst2, copts);\n  if (opts.connect) Connect(ofst);\n}\n\n// Composes an FST (1st arg) and a multi-pushdown transducer (MPDT) encoded as\n// an FST (2nd arg) with the result also an MPDT encoded as an FST (3rd arg).\n// In the MPDTs, some transitions are labeled with open or close parentheses\n// (and associated with a stack). To be interpreted as an MPDT, the parents on\n// each stack must balance on a path (see MPdtExpand()). The open-close\n// parenthesis label pairs are passed using the parens arguments, and the stack\n// assignments are passed using the assignments argument.\ntemplate <class Arc>\nvoid Compose(\n    const Fst<Arc> &ifst1, const Fst<Arc> &ifst2,\n    const std::vector<std::pair<typename Arc::Label, typename Arc::Label>>\n        &parens,\n    const std::vector<typename Arc::Label> &assignments, MutableFst<Arc> *ofst,\n    const MPdtComposeOptions &opts = MPdtComposeOptions()) {\n  bool expand = opts.filter_type != PAREN_FILTER;\n  bool keep_parens = opts.filter_type != EXPAND_FILTER;\n  MPdtComposeFstOptions<Arc, false> copts(ifst1, ifst2, parens, assignments,\n                                          expand, keep_parens);\n  copts.gc_limit = 0;\n  *ofst = ComposeFst<Arc>(ifst1, ifst2, copts);\n  if (opts.connect) Connect(ofst);\n}\n\n}  // namespace fst\n\n#endif  // FST_EXTENSIONS_MPDT_COMPOSE_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/extensions/mpdt/expand.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Expands an MPDT to an FST.\n\n#ifndef FST_EXTENSIONS_MPDT_EXPAND_H_\n#define FST_EXTENSIONS_MPDT_EXPAND_H_\n\n#include <vector>\n\n#include <fst/extensions/mpdt/mpdt.h>\n#include <fst/extensions/pdt/paren.h>\n#include <fst/cache.h>\n#include <fst/mutable-fst.h>\n#include <fst/queue.h>\n#include <fst/state-table.h>\n#include <fst/test-properties.h>\n\nnamespace fst {\n\ntemplate <class Arc>\nstruct MPdtExpandFstOptions : public CacheOptions {\n  bool keep_parentheses;\n  internal::MPdtStack<typename Arc::StateId, typename Arc::Label> *stack;\n  PdtStateTable<typename Arc::StateId, typename Arc::StateId> *state_table;\n\n  MPdtExpandFstOptions(\n      const CacheOptions &opts = CacheOptions(), bool kp = false,\n      internal::MPdtStack<typename Arc::StateId, typename Arc::Label> *s =\n          nullptr,\n      PdtStateTable<typename Arc::StateId, typename Arc::StateId> *st = nullptr)\n      : CacheOptions(opts), keep_parentheses(kp), stack(s), state_table(st) {}\n};\n\n// Properties for an expanded PDT.\ninline uint64 MPdtExpandProperties(uint64 inprops) {\n  return inprops & (kAcceptor | kAcyclic | kInitialAcyclic | kUnweighted);\n}\n\nnamespace internal {\n\n// Implementation class for ExpandFst\ntemplate <class Arc>\nclass MPdtExpandFstImpl : public CacheImpl<Arc> {\n public:\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using StackId = StateId;\n  using StateTuple = PdtStateTuple<StateId, StackId>;\n  using ParenStack = internal::MPdtStack<StateId, Label>;\n\n  using FstImpl<Arc>::SetType;\n  using FstImpl<Arc>::SetProperties;\n  using FstImpl<Arc>::Properties;\n  using FstImpl<Arc>::SetInputSymbols;\n  using FstImpl<Arc>::SetOutputSymbols;\n\n  using CacheBaseImpl<CacheState<Arc>>::PushArc;\n  using CacheBaseImpl<CacheState<Arc>>::HasArcs;\n  using CacheBaseImpl<CacheState<Arc>>::HasFinal;\n  using CacheBaseImpl<CacheState<Arc>>::HasStart;\n  using CacheBaseImpl<CacheState<Arc>>::SetArcs;\n  using CacheBaseImpl<CacheState<Arc>>::SetFinal;\n  using CacheBaseImpl<CacheState<Arc>>::SetStart;\n\n  MPdtExpandFstImpl(const Fst<Arc> &fst,\n                    const std::vector<std::pair<Label, Label>> &parens,\n                    const std::vector<Label> &assignments,\n                    const MPdtExpandFstOptions<Arc> &opts)\n      : CacheImpl<Arc>(opts),\n        fst_(fst.Copy()),\n        stack_(opts.stack ? opts.stack : new ParenStack(parens, assignments)),\n        state_table_(opts.state_table ? opts.state_table\n                                      : new PdtStateTable<StateId, StackId>()),\n        own_stack_(!opts.stack),\n        own_state_table_(!opts.state_table),\n        keep_parentheses_(opts.keep_parentheses) {\n    SetType(\"expand\");\n    const auto props = fst.Properties(kFstProperties, false);\n    SetProperties(MPdtExpandProperties(props), kCopyProperties);\n    SetInputSymbols(fst.InputSymbols());\n    SetOutputSymbols(fst.OutputSymbols());\n  }\n\n  MPdtExpandFstImpl(const MPdtExpandFstImpl &impl)\n      : CacheImpl<Arc>(impl),\n        fst_(impl.fst_->Copy(true)),\n        stack_(new ParenStack(*impl.stack_)),\n        state_table_(new PdtStateTable<StateId, StackId>()),\n        own_stack_(true),\n        own_state_table_(true),\n        keep_parentheses_(impl.keep_parentheses_) {\n    SetType(\"expand\");\n    SetProperties(impl.Properties(), kCopyProperties);\n    SetInputSymbols(impl.InputSymbols());\n    SetOutputSymbols(impl.OutputSymbols());\n  }\n\n  ~MPdtExpandFstImpl() override {\n    if (own_stack_) delete stack_;\n    if (own_state_table_) delete state_table_;\n  }\n\n  StateId Start() {\n    if (!HasStart()) {\n      const auto s = fst_->Start();\n      if (s == kNoStateId) return kNoStateId;\n      const StateTuple tuple(s, 0);\n      const auto start = state_table_->FindState(tuple);\n      SetStart(start);\n    }\n    return CacheImpl<Arc>::Start();\n  }\n\n  Weight Final(StateId s) {\n    if (!HasFinal(s)) {\n      const auto &tuple = state_table_->Tuple(s);\n      const auto weight = fst_->Final(tuple.state_id);\n      SetFinal(s,\n               (weight != Weight::Zero() && tuple.stack_id == 0)\n                   ? weight\n                   : Weight::Zero());\n    }\n    return CacheImpl<Arc>::Final(s);\n  }\n\n  size_t NumArcs(StateId s) {\n    if (!HasArcs(s)) ExpandState(s);\n    return CacheImpl<Arc>::NumArcs(s);\n  }\n\n  size_t NumInputEpsilons(StateId s) {\n    if (!HasArcs(s)) ExpandState(s);\n    return CacheImpl<Arc>::NumInputEpsilons(s);\n  }\n\n  size_t NumOutputEpsilons(StateId s) {\n    if (!HasArcs(s)) ExpandState(s);\n    return CacheImpl<Arc>::NumOutputEpsilons(s);\n  }\n\n  void InitArcIterator(StateId s, ArcIteratorData<Arc> *data) {\n    if (!HasArcs(s)) ExpandState(s);\n    CacheImpl<Arc>::InitArcIterator(s, data);\n  }\n\n  // Computes the outgoing transitions from a state, creating new destination\n  // states as needed.\n  void ExpandState(StateId s) {\n    const auto tuple = state_table_->Tuple(s);\n    for (ArcIterator<Fst<Arc>> aiter(*fst_, tuple.state_id); !aiter.Done();\n         aiter.Next()) {\n      auto arc = aiter.Value();\n      const auto stack_id = stack_->Find(tuple.stack_id, arc.ilabel);\n      if (stack_id == -1) {\n        continue;  // Non-matching close parenthesis.\n      } else if ((stack_id != tuple.stack_id) && !keep_parentheses_) {\n        arc.ilabel = arc.olabel = 0;  // Stack push/pop.\n      }\n      const StateTuple ntuple(arc.nextstate, stack_id);\n      arc.nextstate = state_table_->FindState(ntuple);\n      PushArc(s, arc);\n    }\n    SetArcs(s);\n  }\n\n  const ParenStack &GetStack() const { return *stack_; }\n\n  const PdtStateTable<StateId, StackId> &GetStateTable() const {\n    return *state_table_;\n  }\n\n private:\n  std::unique_ptr<const Fst<Arc>> fst_;\n  ParenStack *stack_;\n  PdtStateTable<StateId, StackId> *state_table_;\n  const bool own_stack_;\n  const bool own_state_table_;\n  const bool keep_parentheses_;\n\n  MPdtExpandFstImpl &operator=(const MPdtExpandFstImpl &) = delete;\n};\n\n}  // namespace internal\n\n// Expands a multi-pushdown transducer (MPDT) encoded as an FST into an FST.\n// This version is a delayed FST. In the MPDT, some transitions are labeled with\n// open or close parentheses. To be interpreted as an MPDT, the parens for each\n// stack must balance on a path. The open-close parenthesis label\n// pairs are passed using the parens argument, and the assignment of those pairs\n// to stacks is passed using the assignments argument. Expansion enforces the\n// parenthesis constraints. The MPDT must be\n// expandable as an FST.\n//\n// This class attaches interface to implementation and handles\n// reference counting, delegating most methods to ImplToFst.\ntemplate <class A>\nclass MPdtExpandFst : public ImplToFst<internal::MPdtExpandFstImpl<A>> {\n public:\n  using Arc = A;\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using StackId = StateId;\n  using ParenStack = internal::MPdtStack<StackId, Label>;\n  using Store = DefaultCacheStore<Arc>;\n  using State = typename Store::State;\n  using Impl = internal::MPdtExpandFstImpl<Arc>;\n\n  friend class ArcIterator<MPdtExpandFst<Arc>>;\n  friend class StateIterator<MPdtExpandFst<Arc>>;\n\n  MPdtExpandFst(const Fst<Arc> &fst,\n                const std::vector<std::pair<Label, Label>> &parens,\n                const std::vector<Label> &assignments)\n      : ImplToFst<Impl>(std::make_shared<Impl>(fst, parens, assignments,\n                                               MPdtExpandFstOptions<Arc>())) {}\n\n  MPdtExpandFst(const Fst<Arc> &fst,\n                const std::vector<std::pair<Label, Label>> &parens,\n                const std::vector<Label> &assignments,\n                const MPdtExpandFstOptions<Arc> &opts)\n      : ImplToFst<Impl>(\n            std::make_shared<Impl>(fst, parens, assignments, opts)) {}\n\n  // See Fst<>::Copy() for doc.\n  MPdtExpandFst(const MPdtExpandFst<Arc> &fst, bool safe = false)\n      : ImplToFst<Impl>(fst, safe) {}\n\n  // Get a copy of this ExpandFst. See Fst<>::Copy() for further doc.\n  MPdtExpandFst<Arc> *Copy(bool safe = false) const override {\n    return new MPdtExpandFst<A>(*this, safe);\n  }\n\n  inline void InitStateIterator(StateIteratorData<Arc> *data) const override;\n\n  void InitArcIterator(StateId s, ArcIteratorData<Arc> *data) const override {\n    GetMutableImpl()->InitArcIterator(s, data);\n  }\n\n  const ParenStack &GetStack() const { return GetImpl()->GetStack(); }\n\n  const PdtStateTable<StateId, StackId> &GetStateTable() const {\n    return GetImpl()->GetStateTable();\n  }\n\n private:\n  using ImplToFst<Impl>::GetImpl;\n  using ImplToFst<Impl>::GetMutableImpl;\n\n  void operator=(const MPdtExpandFst &) = delete;\n};\n\n// Specialization for MPdtExpandFst.\ntemplate <class Arc>\nclass StateIterator<MPdtExpandFst<Arc>>\n    : public CacheStateIterator<MPdtExpandFst<Arc>> {\n public:\n  explicit StateIterator(const MPdtExpandFst<Arc> &fst)\n      : CacheStateIterator<MPdtExpandFst<Arc>>(fst, fst.GetMutableImpl()) {}\n};\n\n// Specialization for MPdtExpandFst.\ntemplate <class Arc>\nclass ArcIterator<MPdtExpandFst<Arc>>\n    : public CacheArcIterator<MPdtExpandFst<Arc>> {\n public:\n  using StateId = typename Arc::StateId;\n\n  ArcIterator(const MPdtExpandFst<Arc> &fst, StateId s)\n      : CacheArcIterator<MPdtExpandFst<Arc>>(fst.GetMutableImpl(), s) {\n    if (!fst.GetImpl()->HasArcs(s)) fst.GetMutableImpl()->ExpandState(s);\n  }\n};\n\ntemplate <class Arc>\ninline void MPdtExpandFst<Arc>::InitStateIterator(\n    StateIteratorData<Arc> *data) const {\n  data->base = new StateIterator<MPdtExpandFst<Arc>>(*this);\n}\n\nstruct MPdtExpandOptions {\n  bool connect;\n  bool keep_parentheses;\n\n  explicit MPdtExpandOptions(bool connect = true, bool keep_parentheses = false)\n      : connect(connect), keep_parentheses(keep_parentheses) {}\n};\n\n// Expands a multi-pushdown transducer (MPDT) encoded as an FST into an FST.\n// This version writes the expanded PDT to a mutable FST. In the MPDT, some\n// transitions are labeled with open or close parentheses. To be interpreted as\n// an MPDT, the parens for each stack must balance on a path. The open-close\n// parenthesis label pair sets are passed using the parens argument, and the\n// assignment of those pairs to stacks is passed using the assignments argument.\n// The expansion enforces the parenthesis constraints. The MPDT must be\n// expandable as an FST.\ntemplate <class Arc>\nvoid Expand(const Fst<Arc> &ifst,\n            const std::vector<\n            std::pair<typename Arc::Label, typename Arc::Label>> &parens,\n            const std::vector<typename Arc::Label> &assignments,\n            MutableFst<Arc> *ofst, const MPdtExpandOptions &opts) {\n  MPdtExpandFstOptions<Arc> eopts;\n  eopts.gc_limit = 0;\n  eopts.keep_parentheses = opts.keep_parentheses;\n  *ofst = MPdtExpandFst<Arc>(ifst, parens, assignments, eopts);\n  if (opts.connect) Connect(ofst);\n}\n\n// Expands a multi-pushdown transducer (MPDT) encoded as an FST into an FST.\n// This version writes the expanded PDT to a mutable FST. In the MPDT, some\n// transitions are labeled with open or close parentheses. To be interpreted as\n// an MPDT, the parens for each stack must balance on a path. The open-close\n// parenthesis label pair sets are passed using the parens argument, and the\n// assignment of those pairs to stacks is passed using the assignments argument.\n// The expansion enforces the parenthesis constraints. The MPDT must be\n// expandable as an FST.\ntemplate <class Arc>\nvoid Expand(const Fst<Arc> &ifst,\n            const std::vector<std::pair<typename Arc::Label,\n            typename Arc::Label>> &parens,\n            const std::vector<typename Arc::Label> &assignments,\n            MutableFst<Arc> *ofst, bool connect = true,\n            bool keep_parentheses = false) {\n  const MPdtExpandOptions opts(connect, keep_parentheses);\n  Expand(ifst, parens, assignments, ofst, opts);\n}\n\n}  // namespace fst\n\n#endif  // FST_EXTENSIONS_MPDT_EXPAND_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/extensions/mpdt/info.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Prints information about an MPDT.\n\n#ifndef FST_EXTENSIONS_MPDT_INFO_H_\n#define FST_EXTENSIONS_MPDT_INFO_H_\n\n#include <unordered_map>\n#include <vector>\n\n#include <fst/extensions/mpdt/mpdt.h>\n#include <fst/fst.h>\n\nnamespace fst {\n\n// Compute various information about MPDTs, helper class for mpdtinfo.cc.\ntemplate <class Arc, typename Arc::Label nlevels = 2>\nclass MPdtInfo {\n public:\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  MPdtInfo(const Fst<Arc> &fst,\n           const std::vector<std::pair<Label, Label>> &parens,\n           const std::vector<Label> &assignments);\n\n  const string &FstType() const { return fst_type_; }\n\n  const string &ArcType() const { return Arc::Type(); }\n\n  int64 NumStates() const { return nstates_; }\n\n  int64 NumArcs() const { return narcs_; }\n\n  int64 NumLevels() const { return nlevels; }\n\n  int64 NumOpenParens(Label level) const { return nopen_parens_[level]; }\n\n  int64 NumCloseParens(Label level) const { return nclose_parens_[level]; }\n\n  int64 NumUniqueOpenParens(Label level) const {\n    return nuniq_open_parens_[level];\n  }\n\n  int64 NumUniqueCloseParens(Label level) const {\n    return nuniq_close_parens_[level];\n  }\n  int64 NumOpenParenStates(Label level) const {\n    return nopen_paren_states_[level];\n  }\n\n  int64 NumCloseParenStates(Label level) const {\n    return nclose_paren_states_[level];\n  }\n\n  void Print();\n\n private:\n  string fst_type_;\n  int64 nstates_;\n  int64 narcs_;\n  int64 nopen_parens_[nlevels];\n  int64 nclose_parens_[nlevels];\n  int64 nuniq_open_parens_[nlevels];\n  int64 nuniq_close_parens_[nlevels];\n  int64 nopen_paren_states_[nlevels];\n  int64 nclose_paren_states_[nlevels];\n  bool error_;\n};\n\ntemplate <class Arc, typename Arc::Label nlevels>\nMPdtInfo<Arc, nlevels>::MPdtInfo(\n    const Fst<Arc> &fst,\n    const std::vector<std::pair<typename Arc::Label, typename Arc::Label>>\n        &parens,\n    const std::vector<typename Arc::Label> &assignments)\n    : fst_type_(fst.Type()), nstates_(0), narcs_(0), error_(false) {\n  std::unordered_map<Label, size_t> paren_map;\n  std::unordered_set<Label> paren_set;\n  std::unordered_map<Label, int> paren_levels;\n  std::unordered_set<StateId> open_paren_state_set;\n  std::unordered_set<StateId> close_paren_state_set;\n  if (parens.size() != assignments.size()) {\n    FSTERROR() << \"MPdtInfo: Parens of different size from assignments\";\n    error_ = true;\n    return;\n  }\n  for (Label i = 0; i < assignments.size(); ++i) {\n    // Assignments here start at 0, so assuming the human-readable version has\n    // them starting at 1, we should subtract 1 here.\n    Label level = assignments[i] - 1;\n    if (level < 0 || level >= nlevels) {\n      FSTERROR() << \"MPdtInfo: Specified level \" << level << \" out of bounds\";\n      error_ = true;\n      return;\n    }\n    const auto &pair = parens[i];\n    paren_levels[pair.first] = level;\n    paren_levels[pair.second] = level;\n    paren_map[pair.first] = i;\n    paren_map[pair.second] = i;\n  }\n  for (Label i = 0; i < nlevels; ++i) {\n    nopen_parens_[i] = 0;\n    nclose_parens_[i] = 0;\n    nuniq_open_parens_[i] = 0;\n    nuniq_close_parens_[i] = 0;\n    nopen_paren_states_[i] = 0;\n    nclose_paren_states_[i] = 0;\n  }\n  for (StateIterator<Fst<Arc>> siter(fst); !siter.Done(); siter.Next()) {\n    ++nstates_;\n    const auto s = siter.Value();\n    for (ArcIterator<Fst<Arc>> aiter(fst, s); !aiter.Done(); aiter.Next()) {\n      const auto &arc = aiter.Value();\n      ++narcs_;\n      const auto it = paren_map.find(arc.ilabel);\n      if (it != paren_map.end()) {\n        const auto open_paren = parens[it->second].first;\n        const auto close_paren = parens[it->second].second;\n        const auto level = paren_levels[arc.ilabel];\n        if (arc.ilabel == open_paren) {\n          ++nopen_parens_[level];\n          if (!paren_set.count(open_paren)) {\n            ++nuniq_open_parens_[level];\n            paren_set.insert(open_paren);\n          }\n          if (!open_paren_state_set.count(arc.nextstate)) {\n            ++nopen_paren_states_[level];\n            open_paren_state_set.insert(arc.nextstate);\n          }\n        } else {\n          ++nclose_parens_[level];\n          if (!paren_set.count(close_paren)) {\n            ++nuniq_close_parens_[level];\n            paren_set.insert(close_paren);\n          }\n          if (!close_paren_state_set.count(s)) {\n            ++nclose_paren_states_[level];\n            close_paren_state_set.insert(s);\n          }\n        }\n      }\n    }\n  }\n}\n\ntemplate <class Arc, typename Arc::Label nlevels>\nvoid MPdtInfo<Arc, nlevels>::Print() {\n  const auto old = std::cout.setf(std::ios::left);\n  std::cout.width(50);\n  std::cout << \"fst type\" << FstType() << std::endl;\n  std::cout.width(50);\n  std::cout << \"arc type\" << ArcType() << std::endl;\n  std::cout.width(50);\n  std::cout << \"# of states\" << NumStates() << std::endl;\n  std::cout.width(50);\n  std::cout << \"# of arcs\" << NumArcs() << std::endl;\n  std::cout.width(50);\n  std::cout << \"# of levels\" << NumLevels() << std::endl;\n  std::cout.width(50);\n  for (typename Arc::Label i = 0; i < nlevels; ++i) {\n    int level = i + 1;\n    std::cout << \"# of open parentheses at levelel \" << level << \"\\t\"\n              << NumOpenParens(i) << std::endl;\n    std::cout.width(50);\n    std::cout << \"# of close parentheses at levelel \" << level << \"\\t\"\n              << NumCloseParens(i) << std::endl;\n    std::cout.width(50);\n    std::cout << \"# of unique open parentheses at levelel \" << level << \"\\t\"\n              << NumUniqueOpenParens(i) << std::endl;\n    std::cout.width(50);\n    std::cout << \"# of unique close parentheses at levelel \" << level << \"\\t\"\n              << NumUniqueCloseParens(i) << std::endl;\n    std::cout.width(50);\n    std::cout << \"# of open parenthesis dest. states at levelel \" << level\n              << \"\\t\" << NumOpenParenStates(i) << std::endl;\n    std::cout.width(50);\n    std::cout << \"# of close parenthesis source states at levelel \" << level\n              << \"\\t\" << NumCloseParenStates(i) << std::endl;\n    std::cout.width(50);\n  }\n  std::cout.setf(old);\n}\n\n}  // namespace fst\n\n#endif  // FST_EXTENSIONS_MPDT_INFO_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/extensions/mpdt/mpdt.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Common classes for Multi Pushdown Transducer (MPDT) expansion/traversal.\n\n#ifndef FST_EXTENSIONS_MPDT_MPDT_H_\n#define FST_EXTENSIONS_MPDT_MPDT_H_\n\n#include <array>\n#include <functional>\n#include <map>\n#include <vector>\n\n#include <fst/compat.h>\n#include <fst/extensions/pdt/pdt.h>\n\nnamespace fst {\n\nenum MPdtType {\n  MPDT_READ_RESTRICT,   // Can only read from first empty stack\n  MPDT_WRITE_RESTRICT,  // Can only write to first empty stack\n  MPDT_NO_RESTRICT,     // No read-write restrictions\n};\n\nnamespace internal {\n\n// PLEASE READ THIS CAREFULLY:\n//\n// When USEVECTOR is set, the stack configurations --- the statewise\n// representation of the StackId's for each substack --- is stored in a vector.\n// I would like to do this using an array for efficiency reasons, thus the\n// definition of StackConfig below. However, while this *works* in that tests\n// pass, etc. It causes a memory leak in the compose and expand tests, evidently\n// in the map[] that is being used to store the mapping between these\n// StackConfigs and the external StackId that the caller sees. There are no\n// memory leaks when I use a vector, only with this StackId. Why there should be\n// memory leaks given that I am not mallocing anything is a mystery. In case you\n// were wondering, clearing the map at the end does not help.\n\ntemplate <typename StackId, typename Level, Level nlevels>\nstruct StackConfig {\n  StackConfig() : array_() {}\n\n  StackConfig(const StackConfig<StackId, Level, nlevels> &config) {\n    array_ = config.array_;\n  }\n\n  StackId &operator[](const int index) { return array_[index]; }\n\n  const StackId &operator[](const int index) const { return array_[index]; }\n\n  StackConfig &operator=(const StackConfig<StackId, Level, nlevels> &config) {\n    if (this == &config) return *this;\n    array_ = config.array_;\n    return *this;\n  }\n\n  std::array<StackId, nlevels> array_;\n};\n\ntemplate <typename StackId, typename Level, Level nlevels>\nclass CompConfig {\n public:\n  using Config = StackConfig<StackId, Level, nlevels>;\n\n  bool operator()(const Config &x, const Config &y) const {\n    for (Level level = 0; level < nlevels; ++level) {\n      if (x.array_[level] < y.array_[level]) {\n        return true;\n      } else if (x.array_[level] > y.array_[level]) {\n        return false;\n      }\n    }\n    return false;\n  }\n};\n\n// Defines the KeyPair type used as the key to MPdtStack.paren_id_map_. The hash\n// function is provided as a separate struct to match templating syntax.\ntemplate <typename Level>\nstruct KeyPair {\n  Level level;\n  size_t underlying_id;\n\n  KeyPair(Level level, size_t id) : level(level), underlying_id(id) {}\n\n  inline bool operator==(const KeyPair<Level> &rhs) const {\n    return level == rhs.level && underlying_id == rhs.underlying_id;\n  }\n};\n\ntemplate <typename Level>\nstruct KeyPairHasher {\n  inline size_t operator()(const KeyPair<Level> &keypair) const {\n    return std::hash<Level>()(keypair.level) ^\n           (std::hash<size_t>()(keypair.underlying_id) << 1);\n  }\n};\n\ntemplate <typename StackId, typename Level, Level nlevels = 2,\n          MPdtType restrict = MPDT_READ_RESTRICT>\nclass MPdtStack {\n public:\n  using Label = Level;\n  using Config = StackConfig<StackId, Level, nlevels>;\n  using ConfigToStackId =\n      std::map<Config, StackId, CompConfig<StackId, Level, nlevels>>;\n\n  MPdtStack(const std::vector<std::pair<Label, Label>> &parens,\n            const std::vector<Level> &assignments);\n\n  MPdtStack(const MPdtStack &mstack);\n\n  ~MPdtStack() {\n    for (Level level = 0; level < nlevels; ++level) delete stacks_[level];\n  }\n\n  StackId Find(StackId stack_id, Label label);\n\n  // For now we do not implement Pop since this is needed only for\n  // ShortestPath().\n\n  // For Top we find the first non-empty config, and find the paren ID of that\n  // (or -1) if there is none, then map that to the external stack_id to return.\n  ssize_t Top(StackId stack_id) const {\n    if (stack_id == -1) return -1;\n    const auto config = InternalStackIds(stack_id);\n    Level level = 0;\n    StackId underlying_id = -1;\n    for (; level < nlevels; ++level) {\n      if (!Empty(config, level)) {\n        underlying_id = stacks_[level]->Top(config[level]);\n        break;\n      }\n    }\n    if (underlying_id == -1) return -1;\n    const auto it = paren_id_map_.find(KeyPair<Level>(level, underlying_id));\n    if (it == paren_id_map_.end()) return -1;  // NB: shouldn't happen.\n    return it->second;\n  }\n\n  ssize_t ParenId(Label label) const {\n    const auto it = paren_map_.find(label);\n    return it != paren_map_.end() ? it->second : -1;\n  }\n\n  // TODO(rws): For debugging purposes only: remove later.\n  string PrintConfig(const Config &config) const {\n    string result = \"[\";\n    for (Level i = 0; i < nlevels; ++i) {\n      char s[128];\n      snprintf(s, sizeof(s), \"%d\", config[i]);\n      result += string(s);\n      if (i < nlevels - 1) result += \", \";\n    }\n    result += \"]\";\n    return result;\n  }\n\n  bool Error() { return error_; }\n\n  // Each component stack has an internal stack ID for a given configuration and\n  // label.\n  // This function maps a configuration of those to the stack ID the caller\n  // sees.\n  inline StackId ExternalStackId(const Config &config) {\n    const auto it = config_to_stack_id_map_.find(config);\n    StackId result;\n    if (it == config_to_stack_id_map_.end()) {\n      result = next_stack_id_++;\n      config_to_stack_id_map_.insert(\n          std::pair<Config, StackId>(config, result));\n      stack_id_to_config_map_[result] = config;\n    } else {\n      result = it->second;\n    }\n    return result;\n  }\n\n  // Retrieves the internal stack ID for a corresponding external stack ID.\n  inline const Config InternalStackIds(StackId stack_id) const {\n    auto it = stack_id_to_config_map_.find(stack_id);\n    if (it == stack_id_to_config_map_.end()) {\n      it = stack_id_to_config_map_.find(-1);\n    }\n    return it->second;\n  }\n\n  inline bool Empty(const Config &config, Level level) const {\n    return config[level] <= 0;\n  }\n\n  inline bool AllEmpty(const Config &config) {\n    for (Level level = 0; level < nlevels; ++level) {\n      if (!Empty(config, level)) return false;\n    }\n    return true;\n  }\n\n  bool error_;\n  Label min_paren_;\n  Label max_paren_;\n  // Stores level of each paren.\n  std::unordered_map<Label, Label> paren_levels_;\n  std::vector<std::pair<Label, Label>> parens_;  // As in pdt.h.\n  std::unordered_map<Label, size_t> paren_map_;  // As in pdt.h.\n  // Maps between internal paren_id and external paren_id.\n  std::unordered_map<KeyPair<Level>, size_t, KeyPairHasher<Level>>\n      paren_id_map_;\n  // Maps between internal stack ids and external stack id.\n  ConfigToStackId config_to_stack_id_map_;\n  std::unordered_map<StackId, Config> stack_id_to_config_map_;\n  StackId next_stack_id_;\n  // Array of stacks.\n  PdtStack<StackId, Label> *stacks_[nlevels];\n};\n\ntemplate <typename StackId, typename Level, Level nlevels, MPdtType restrict>\nMPdtStack<StackId, Level, nlevels, restrict>::MPdtStack(\n    const std::vector<std::pair<Level, Level>> &parens,  // NB: Label = Level.\n    const std::vector<Level> &assignments)\n    : error_(false),\n      min_paren_(kNoLabel),\n      max_paren_(kNoLabel),\n      parens_(parens),\n      next_stack_id_(1) {\n  using Label = Level;\n  if (parens.size() != assignments.size()) {\n    FSTERROR() << \"MPdtStack: Parens of different size from assignments\";\n    error_ = true;\n    return;\n  }\n  std::vector<std::pair<Label, Label>> vectors[nlevels];\n  for (Level i = 0; i < assignments.size(); ++i) {\n    // Assignments here start at 0, so assuming the human-readable version has\n    // them starting at 1, we should subtract 1 here\n    const auto level = assignments[i] - 1;\n    if (level < 0 || level >= nlevels) {\n      FSTERROR() << \"MPdtStack: Specified level \" << level << \" out of bounds\";\n      error_ = true;\n      return;\n    }\n    const auto &pair = parens[i];\n    vectors[level].push_back(pair);\n    paren_levels_[pair.first] = level;\n    paren_levels_[pair.second] = level;\n    paren_map_[pair.first] = i;\n    paren_map_[pair.second] = i;\n    const KeyPair<Level> key(level, vectors[level].size() - 1);\n    paren_id_map_[key] = i;\n    if (min_paren_ == kNoLabel || pair.first < min_paren_) {\n      min_paren_ = pair.first;\n    }\n    if (pair.second < min_paren_) min_paren_ = pair.second;\n    if (max_paren_ == kNoLabel || pair.first > max_paren_) {\n      max_paren_ = pair.first;\n    }\n    if (pair.second > max_paren_) max_paren_ = pair.second;\n  }\n  using Config = StackConfig<StackId, Level, nlevels>;\n  Config neg_one;\n  Config zero;\n  for (Level level = 0; level < nlevels; ++level) {\n    stacks_[level] = new PdtStack<StackId, Label>(vectors[level]);\n    neg_one[level] = -1;\n    zero[level] = 0;\n  }\n  config_to_stack_id_map_[neg_one] = -1;\n  config_to_stack_id_map_[zero] = 0;\n  stack_id_to_config_map_[-1] = neg_one;\n  stack_id_to_config_map_[0] = zero;\n}\n\ntemplate <typename StackId, typename Level, Level nlevels, MPdtType restrict>\nMPdtStack<StackId, Level, nlevels, restrict>::MPdtStack(\n    const MPdtStack<StackId, Level, nlevels, restrict> &mstack)\n    : error_(mstack.error_),\n      min_paren_(mstack.min_paren_),\n      max_paren_(mstack.max_paren_),\n      parens_(mstack.parens_),\n      next_stack_id_(mstack.next_stack_id_) {\n  for (const auto &kv : mstack.paren_levels_) {\n    paren_levels_[kv.first] = kv.second;\n  }\n  for (const auto &paren : mstack.parens_) parens_.push_back(paren);\n  for (const auto &kv : mstack.paren_map_) {\n    paren_map_[kv.first] = kv.second;\n  }\n  for (const auto &kv : mstack.paren_id_map_) {\n    paren_id_map_[kv.first] = kv.second;\n  }\n  for (auto it = mstack.config_to_stack_id_map_.begin();\n       it != mstack.config_to_stack_id_map_.end(); ++it) {\n    config_to_stack_id_map_[it->first] = it->second;\n  }\n  for (const auto &kv : mstack.stack_id_to_config_map_) {\n    using Config = StackConfig<StackId, Level, nlevels>;\n    const Config config(kv.second);\n    stack_id_to_config_map_[kv.first] = config;\n  }\n  for (Level level = 0; level < nlevels; ++level)\n    stacks_[level] = mstack.stacks_[level];\n}\n\ntemplate <typename StackId, typename Level, Level nlevels, MPdtType restrict>\nStackId MPdtStack<StackId, Level, nlevels, restrict>::Find(StackId stack_id,\n                                                           Level label) {\n  // Non-paren.\n  if (min_paren_ == kNoLabel || label < min_paren_ || label > max_paren_) {\n    return stack_id;\n  }\n  const auto it = paren_map_.find(label);\n  // Non-paren.\n  if (it == paren_map_.end()) return stack_id;\n  ssize_t paren_id = it->second;\n  // Gets the configuration associated with this stack_id.\n  const auto config = InternalStackIds(stack_id);\n  // Gets the level.\n  const auto level = paren_levels_.find(label)->second;\n  // If the label is an open paren we push:\n  //\n  // 1) if the restrict type is not MPDT_WRITE_RESTRICT, or\n  // 2) the restrict type is MPDT_WRITE_RESTRICT, and all the stacks above the\n  // level are empty.\n  if (label == parens_[paren_id].first) {  // Open paren.\n    if (restrict == MPDT_WRITE_RESTRICT) {\n      for (Level upper_level = 0; upper_level < level; ++upper_level) {\n        if (!Empty(config, upper_level)) return -1;  // Non-empty stack blocks.\n      }\n    }\n    // If the label is an close paren we pop:\n    //\n    // 1) if the restrict type is not MPDT_READ_RESTRICT, or\n    // 2) the restrict type is MPDT_READ_RESTRICT, and all the stacks above the\n    // level are empty.\n  } else if (restrict == MPDT_READ_RESTRICT) {\n    for (Level lower_level = 0; lower_level < level; ++lower_level) {\n      if (!Empty(config, lower_level)) return -1;  // Non-empty stack blocks.\n    }\n  }\n  const auto nid = stacks_[level]->Find(config[level], label);\n  // If the new ID is -1, that means that there is no valid transition at the\n  // level we want.\n  if (nid == -1) {\n    return -1;\n  } else {\n    using Config = StackConfig<StackId, Level, nlevels>;\n    Config nconfig(config);\n    nconfig[level] = nid;\n    return ExternalStackId(nconfig);\n  }\n}\n\n}  // namespace internal\n}  // namespace fst\n\n#endif  // FST_EXTENSIONS_MPDT_MPDT_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/extensions/mpdt/mpdtlib.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// This is an experimental multipush-down transducer (MPDT) library. An MPDT is\n// encoded as an FST, where some transitions are labeled with open or close\n// parentheses, each mated pair of which is associated to one stack. To be\n// interpreted as an MPDT, the parentheses within a stack must balance on a\n// path.\n\n#ifndef FST_EXTENSIONS_MPDT_MPDTLIB_H_\n#define FST_EXTENSIONS_MPDT_MPDTLIB_H_\n\n#include <fst/extensions/mpdt/compose.h>\n#include <fst/extensions/mpdt/expand.h>\n#include <fst/extensions/mpdt/mpdt.h>\n#include <fst/extensions/mpdt/reverse.h>\n\n#endif  // FST_EXTENSIONS_MPDT_MPDTLIB_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/extensions/mpdt/mpdtscript.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Convenience file for including all MPDT operations at once, and/or\n// registering them for new arc types.\n\n#ifndef FST_EXTENSIONS_MPDT_MPDTSCRIPT_H_\n#define FST_EXTENSIONS_MPDT_MPDTSCRIPT_H_\n\n#include <algorithm>\n#include <utility>\n#include <vector>\n\n#include <fst/log.h>\n#include <fst/compose.h>  // for ComposeOptions\n#include <fst/util.h>\n\n#include <fst/script/arg-packs.h>\n#include <fst/script/fst-class.h>\n#include <fst/script/shortest-path.h>\n\n#include <fst/extensions/mpdt/compose.h>\n#include <fst/extensions/mpdt/expand.h>\n#include <fst/extensions/mpdt/info.h>\n#include <fst/extensions/mpdt/reverse.h>\n\n#include <fst/extensions/pdt/pdtscript.h>  // For LabelClassPair,\n                                               // FstClassPair, and to detect\n                                               // any collisions.\n\nnamespace fst {\nnamespace script {\n\nusing MPdtComposeArgs =\n    std::tuple<const FstClass &, const FstClass &,\n               const std::vector<LabelPair> &, const std::vector<int64> &,\n               MutableFstClass *, const MPdtComposeOptions &, bool>;\n\ntemplate <class Arc>\nvoid MPdtCompose(MPdtComposeArgs *args) {\n  const Fst<Arc> &ifst1 = *(std::get<0>(*args).GetFst<Arc>());\n  const Fst<Arc> &ifst2 = *(std::get<1>(*args).GetFst<Arc>());\n  MutableFst<Arc> *ofst = std::get<4>(*args)->GetMutableFst<Arc>();\n  std::vector<std::pair<typename Arc::Label, typename Arc::Label>> typed_parens(\n      std::get<2>(*args).size());\n  std::copy(std::get<2>(*args).begin(), std::get<2>(*args).end(),\n            typed_parens.begin());\n  using Level = typename Arc::Label;\n  std::vector<Level> typed_assignments(std::get<3>(*args).size());\n  std::copy(std::get<3>(*args).begin(), std::get<3>(*args).end(),\n            typed_assignments.begin());\n  if (std::get<6>(*args)) {\n    Compose(ifst1, typed_parens, typed_assignments, ifst2, ofst,\n            std::get<5>(*args));\n  } else {\n    Compose(ifst1, ifst2, typed_parens, typed_assignments, ofst,\n            std::get<5>(*args));\n  }\n}\n\nvoid MPdtCompose(const FstClass &ifst1, const FstClass &ifst2,\n                 const std::vector<LabelPair> &parens,\n                 const std::vector<int64> &assignments, MutableFstClass *ofst,\n                 const MPdtComposeOptions &copts, bool left_pdt);\n\nusing MPdtExpandArgs =\n    std::tuple<const FstClass &, const std::vector<LabelPair> &,\n               const std::vector<int64> &, MutableFstClass *,\n               const MPdtExpandOptions &>;\n\ntemplate <class Arc>\nvoid MPdtExpand(MPdtExpandArgs *args) {\n  const Fst<Arc> &fst = *(std::get<0>(*args).GetFst<Arc>());\n  MutableFst<Arc> *ofst = std::get<3>(*args)->GetMutableFst<Arc>();\n  // In case Arc::Label is not the same as FstClass::Label, we make copies.\n  // Truncation may occur if FstClass::Label has more precision than\n  // Arc::Label.\n  std::vector<std::pair<typename Arc::Label, typename Arc::Label>> typed_parens(\n      std::get<1>(*args).size());\n  std::copy(std::get<1>(*args).begin(), std::get<1>(*args).end(),\n            typed_parens.begin());\n  using Level = typename Arc::Label;\n  std::vector<Level> typed_assignments(std::get<2>(*args).size());\n  std::copy(std::get<2>(*args).begin(), std::get<2>(*args).end(),\n            typed_assignments.begin());\n  Expand(fst, typed_parens, typed_assignments, ofst,\n         MPdtExpandOptions(std::get<4>(*args).connect,\n                           std::get<4>(*args).keep_parentheses));\n}\n\nvoid MPdtExpand(const FstClass &ifst, const std::vector<LabelPair> &parens,\n                const std::vector<int64> &assignments, MutableFstClass *ofst,\n                const MPdtExpandOptions &opts);\n\nusing MPdtReverseArgs =\n    std::tuple<const FstClass &, const std::vector<LabelPair> &,\n               std::vector<int64> *, MutableFstClass *>;\n\ntemplate <class Arc>\nvoid MPdtReverse(MPdtReverseArgs *args) {\n  const Fst<Arc> &fst = *(std::get<0>(*args).GetFst<Arc>());\n  MutableFst<Arc> *ofst = std::get<3>(*args)->GetMutableFst<Arc>();\n  // In case Arc::Label is not the same as FstClass::Label, we make copies.\n  // Truncation may occur if FstClass::Label has more precision than\n  // Arc::Label.\n  std::vector<std::pair<typename Arc::Label, typename Arc::Label>> typed_parens(\n      std::get<1>(*args).size());\n  std::copy(std::get<1>(*args).begin(), std::get<1>(*args).end(),\n            typed_parens.begin());\n  using Level = typename Arc::Label;\n  std::vector<Level> typed_assignments(std::get<2>(*args)->size());\n  std::copy(std::get<2>(*args)->begin(), std::get<2>(*args)->end(),\n            typed_assignments.begin());\n  Reverse(fst, typed_parens, &typed_assignments, ofst);\n  // Reassign stack assignments to input assignment vector.\n  std::copy(typed_assignments.begin(), typed_assignments.end(),\n            std::get<2>(*args)->begin());\n}\n\nvoid MPdtReverse(const FstClass &ifst, const std::vector<LabelPair> &parens,\n                 std::vector<int64> *assignments, MutableFstClass *ofst);\n\nusing PrintMPdtInfoArgs =\n    std::tuple<const FstClass &, const std::vector<LabelPair> &,\n               const std::vector<int64> &>;\n\ntemplate <class Arc>\nvoid PrintMPdtInfo(PrintMPdtInfoArgs *args) {\n  const Fst<Arc> &fst = *(std::get<0>(*args).GetFst<Arc>());\n  // In case Arc::Label is not the same as FstClass::Label, we make copies.\n  // Truncation may occur if FstClass::Label has more precision than\n  // Arc::Label.\n  std::vector<std::pair<typename Arc::Label, typename Arc::Label>> typed_parens(\n      std::get<1>(*args).size());\n  std::copy(std::get<1>(*args).begin(), std::get<1>(*args).end(),\n            typed_parens.begin());\n  using Level = typename Arc::Label;\n  std::vector<Level> typed_assignments(std::get<2>(*args).size());\n  std::copy(std::get<2>(*args).begin(), std::get<2>(*args).end(),\n            typed_assignments.begin());\n  MPdtInfo<Arc> mpdtinfo(fst, typed_parens, typed_assignments);\n  mpdtinfo.Print();\n}\n\nvoid PrintMPdtInfo(const FstClass &ifst, const std::vector<LabelPair> &parens,\n                   const std::vector<int64> &assignments);\n\n}  // namespace script\n}  // namespace fst\n\n#define REGISTER_FST_MPDT_OPERATIONS(ArcType)                    \\\n  REGISTER_FST_OPERATION(MPdtCompose, ArcType, MPdtComposeArgs); \\\n  REGISTER_FST_OPERATION(MPdtExpand, ArcType, MPdtExpandArgs);   \\\n  REGISTER_FST_OPERATION(MPdtReverse, ArcType, MPdtReverseArgs); \\\n  REGISTER_FST_OPERATION(PrintMPdtInfo, ArcType, PrintMPdtInfoArgs)\n#endif  // FST_EXTENSIONS_MPDT_MPDTSCRIPT_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/extensions/mpdt/read_write_utils.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Definition of ReadLabelTriples based on ReadLabelPairs, like that in\n// nlp/fst/lib/util.h for pairs, and similarly for WriteLabelTriples.\n\n#ifndef FST_EXTENSIONS_MPDT_READ_WRITE_UTILS_H_\n#define FST_EXTENSIONS_MPDT_READ_WRITE_UTILS_H_\n\n#include <string>\n#include <utility>\n#include <vector>\n\n#include <fstream>\n#include <fst/test-properties.h>\n\nnamespace fst {\n\n// Returns true on success.\ntemplate <typename Label>\nbool ReadLabelTriples(const string &filename,\n                      std::vector<std::pair<Label, Label>> *pairs,\n                      std::vector<Label> *assignments,\n                      bool allow_negative = false) {\n  std::ifstream fstrm(filename);\n  if (!fstrm) {\n    LOG(ERROR) << \"ReadIntTriples: Can't open file: \" << filename;\n    return false;\n  }\n  static constexpr auto kLineLen = 8096;\n  char line[kLineLen];\n  size_t nline = 0;\n  pairs->clear();\n  while (fstrm.getline(line, kLineLen)) {\n    ++nline;\n    std::vector<char *> col;\n    SplitString(line, \"\\n\\t \", &col, true);\n    // Empty line or comment?\n    if (col.empty() || col[0][0] == '\\0' || col[0][0] == '#') continue;\n    if (col.size() != 3) {\n      LOG(ERROR) << \"ReadLabelTriples: Bad number of columns, \"\n                 << \"file = \" << filename << \", line = \" << nline;\n      return false;\n    }\n    bool err;\n    const Label i1 = StrToInt64(col[0], filename, nline, allow_negative, &err);\n    if (err) return false;\n    const Label i2 = StrToInt64(col[1], filename, nline, allow_negative, &err);\n    if (err) return false;\n    using Level = Label;\n    const Level i3 = StrToInt64(col[2], filename, nline, allow_negative, &err);\n    if (err) return false;\n    pairs->push_back(std::make_pair(i1, i2));\n    assignments->push_back(i3);\n  }\n  return true;\n}\n\n// Returns true on success.\ntemplate <typename Label>\nbool WriteLabelTriples(const string &filename,\n                       const std::vector<std::pair<Label, Label>> &pairs,\n                       const std::vector<Label> &assignments) {\n  if (pairs.size() != assignments.size()) {\n    LOG(ERROR) << \"WriteLabelTriples: Pairs and assignments of different sizes\";\n    return false;\n  }\n  std::ofstream fstrm(filename);\n  if (!fstrm) {\n    LOG(ERROR) << \"WriteLabelTriples: Can't open file: \" << filename;\n    return false;\n  }\n  for (size_t n = 0; n < pairs.size(); ++n)\n    fstrm << pairs[n].first << \"\\t\" << pairs[n].second << \"\\t\" << assignments[n]\n          << \"\\n\";\n  if (!fstrm) {\n    LOG(ERROR) << \"WriteLabelTriples: Write failed: \"\n               << (filename.empty() ? \"standard output\" : filename);\n    return false;\n  }\n  return true;\n}\n\n}  // namespace fst\n\n#endif  // FST_EXTENSIONS_MPDT_READ_WRITE_UTILS_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/extensions/mpdt/reverse.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Reverses an MPDT.\n\n#ifndef FST_EXTENSIONS_MPDT_REVERSE_H_\n#define FST_EXTENSIONS_MPDT_REVERSE_H_\n\n#include <limits>\n#include <vector>\n\n#include <fst/mutable-fst.h>\n#include <fst/relabel.h>\n#include <fst/reverse.h>\n\nnamespace fst {\n\n// Reverses a multi-stack pushdown transducer (MPDT) encoded as an FST.\ntemplate <class Arc, class RevArc>\nvoid Reverse(\n    const Fst<Arc> &ifst,\n    const std::vector<std::pair<typename Arc::Label, typename Arc::Label>>\n        &parens,\n    std::vector<typename Arc::Label> *assignments, MutableFst<RevArc> *ofst) {\n  using Label = typename Arc::Label;\n  // Reverses FST component.\n  Reverse(ifst, ofst);\n  // Exchanges open and close parenthesis pairs.\n  std::vector<std::pair<Label, Label>> relabel_pairs;\n  relabel_pairs.reserve(2 * parens.size());\n  for (const auto &pair : parens) {\n    relabel_pairs.emplace_back(pair.first, pair.second);\n    relabel_pairs.emplace_back(pair.second, pair.first);\n  }\n  Relabel(ofst, relabel_pairs, relabel_pairs);\n  // Computes new bounds for the stack assignments.\n  Label max_level = -1;\n  Label min_level = std::numeric_limits<Label>::max();\n  for (const auto assignment : *assignments) {\n    if (assignment < min_level) {\n      min_level = assignment;\n    } else if (assignment > max_level) {\n      max_level = assignment;\n    }\n  }\n  // Actually reverses stack assignments.\n  for (auto &assignment : *assignments) {\n    assignment = (max_level - assignment) + min_level;\n  }\n}\n\n}  // namespace fst\n\n#endif  // FST_EXTENSIONS_MPDT_REVERSE_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/extensions/ngram/bitmap-index.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#ifndef FST_EXTENSIONS_NGRAM_BITMAP_INDEX_H_\n#define FST_EXTENSIONS_NGRAM_BITMAP_INDEX_H_\n\n#include <utility>\n#include <vector>\n\n#include <fst/compat.h>\n\n// This class is a bitstring storage class with an index that allows\n// seeking to the Nth set or clear bit in time O(Log(N)) where N is\n// the length of the bit vector.  In addition, it allows counting set or\n// clear bits over ranges in constant time.\n//\n// This is accomplished by maintaining an \"secondary\" index of limited\n// size in bits that maintains a running count of the number of bits set\n// in each block of bitmap data.  A block is defined as the number of\n// uint64 values that can fit in the secondary index before an overflow\n// occurs.\n//\n// To handle overflows, a \"primary\" index containing a running count of\n// bits set in each block is created using the type uint64.\n\nnamespace fst {\n\nclass BitmapIndex {\n public:\n  static size_t StorageSize(size_t size) {\n    return ((size + kStorageBlockMask) >> kStorageLogBitSize);\n  }\n\n  BitmapIndex() : bits_(nullptr), size_(0) {}\n\n  bool Get(size_t index) const {\n    return (bits_[index >> kStorageLogBitSize] &\n            (kOne << (index & kStorageBlockMask))) != 0;\n  }\n\n  static void Set(uint64* bits, size_t index) {\n    bits[index >> kStorageLogBitSize] |= (kOne << (index & kStorageBlockMask));\n  }\n\n  static void Clear(uint64* bits, size_t index) {\n    bits[index >> kStorageLogBitSize] &= ~(kOne << (index & kStorageBlockMask));\n  }\n\n  size_t Bits() const { return size_; }\n\n  size_t ArraySize() const { return StorageSize(size_); }\n\n  // Returns the number of one bits in the bitmap\n  size_t GetOnesCount() const {\n    return primary_index_[primary_index_size() - 1];\n  }\n\n  // Returns the number of one bits in positions 0 to limit - 1.\n  // REQUIRES: limit <= Bits()\n  size_t Rank1(size_t end) const;\n\n  // Returns the number of one bits in the range start to end - 1.\n  // REQUIRES: limit <= Bits()\n  size_t GetOnesCountInRange(size_t start, size_t end) const {\n    return Rank1(end) - Rank1(start);\n  }\n\n  // Returns the number of zero bits in positions 0 to limit - 1.\n  // REQUIRES: limit <= Bits()\n  size_t Rank0(size_t end) const { return end - Rank1(end); }\n\n  // Returns the number of zero bits in the range start to end - 1.\n  // REQUIRES: limit <= Bits()\n  size_t GetZeroesCountInRange(size_t start, size_t end) const {\n    return end - start - GetOnesCountInRange(start, end);\n  }\n\n  // Return true if any bit between begin inclusive and end exclusive\n  // is set.  0 <= begin <= end <= Bits() is required.\n  //\n  bool TestRange(size_t start, size_t end) const {\n    return Rank1(end) > Rank1(start);\n  }\n\n  // Returns the offset to the nth set bit (zero based)\n  // or Bits() if index >= number of ones\n  size_t Select1(size_t bit_index) const;\n\n  // Returns the offset to the nth clear bit (zero based)\n  // or Bits() if index > number of\n  size_t Select0(size_t bit_index) const;\n\n  // Returns the offset of the nth and nth+1 clear bit (zero based),\n  // equivalent to two calls to Select0, but more efficient.\n  std::pair<size_t, size_t> Select0s(size_t bit_index) const;\n\n  // Rebuilds from index for the associated Bitmap, should be called\n  // whenever changes have been made to the Bitmap or else behavior\n  // of the indexed bitmap methods will be undefined.\n  void BuildIndex(const uint64* bits, size_t size);\n\n  // the secondary index accumulates counts until it can possibly overflow\n  // this constant computes the number of uint64 units that can fit into\n  // units the size of uint16.\n  static const uint64 kOne = 1;\n  static const uint32 kStorageBitSize = 64;\n  static const uint32 kStorageLogBitSize = 6;\n  static const uint32 kSecondaryBlockSize =\n      ((1 << 16) - 1) >> kStorageLogBitSize;\n\n private:\n  static const uint32 kStorageBlockMask = kStorageBitSize - 1;\n\n  // returns, from the index, the count of ones up to array_index\n  size_t get_index_ones_count(size_t array_index) const;\n\n  // because the indexes, both primary and secondary, contain a running\n  // count of the population of one bits contained in [0,i), there is\n  // no reason to have an element in the zeroth position as this value would\n  // necessarily be zero.  (The bits are indexed in a zero based way.)  Thus\n  // we don't store the 0th element in either index.  Both of the following\n  // functions, if greater than 0, must be decremented by one before retreiving\n  // the value from the corresponding array.\n  // returns the 1 + the block that contains the bitindex in question\n  // the inverted version works the same but looks for zeros using an inverted\n  // view of the index\n  size_t find_primary_block(size_t bit_index) const;\n\n  size_t find_inverted_primary_block(size_t bit_index) const;\n\n  // similarly, the secondary index (which resets its count to zero at\n  // the end of every kSecondaryBlockSize entries) does not store the element\n  // at 0.  Note that the rem_bit_index parameter is the number of bits\n  // within the secondary block, after the bits accounted for by the primary\n  // block have been removed (i.e. the remaining bits)  And, because we\n  // reset to zero with each new block, there is no need to store those\n  // actual zeros.\n  // returns 1 + the secondary block that contains the bitindex in question\n  size_t find_secondary_block(size_t block, size_t rem_bit_index) const;\n\n  size_t find_inverted_secondary_block(size_t block,\n                                       size_t rem_bit_index) const;\n\n  // We create a primary index based upon the number of secondary index\n  // blocks.  The primary index uses fields wide enough to accomodate any\n  // index of the bitarray so cannot overflow\n  // The primary index is the actual running\n  // count of one bits set for all blocks (and, thus, all uint64s).\n  size_t primary_index_size() const {\n    return (ArraySize() + kSecondaryBlockSize - 1) / kSecondaryBlockSize;\n  }\n\n  const uint64* bits_;\n  size_t size_;\n\n  // The primary index contains the running popcount of all blocks\n  // which means the nth value contains the popcounts of\n  // [0,n*kSecondaryBlockSize], however, the 0th element is omitted.\n  std::vector<uint32> primary_index_;\n  // The secondary index contains the running popcount of the associated\n  // bitmap.  It is the same length (in units of uint16) as the\n  // bitmap's map is in units of uint64s.\n  std::vector<uint16> secondary_index_;\n};\n\n}  // end namespace fst\n\n#endif  // FST_EXTENSIONS_NGRAM_BITMAP_INDEX_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/extensions/ngram/ngram-fst.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// NgramFst implements a n-gram language model based upon the LOUDS data\n// structure.  Please refer to \"Unary Data Structures for Language Models\"\n// http://research.google.com/pubs/archive/37218.pdf\n\n#ifndef FST_EXTENSIONS_NGRAM_NGRAM_FST_H_\n#define FST_EXTENSIONS_NGRAM_NGRAM_FST_H_\n\n#include <stddef.h>\n#include <string.h>\n#include <algorithm>\n#include <iostream>\n#include <string>\n#include <utility>\n#include <vector>\n\n#include <fst/compat.h>\n#include <fst/log.h>\n#include <fstream>\n#include <fst/extensions/ngram/bitmap-index.h>\n#include <fst/fstlib.h>\n#include <fst/mapped-file.h>\n\nnamespace fst {\ntemplate <class A>\nclass NGramFst;\ntemplate <class A>\nclass NGramFstMatcher;\n\n// Instance data containing mutable state for bookkeeping repeated access to\n// the same state.\ntemplate <class A>\nstruct NGramFstInst {\n  typedef typename A::Label Label;\n  typedef typename A::StateId StateId;\n  typedef typename A::Weight Weight;\n  StateId state_;\n  size_t num_futures_;\n  size_t offset_;\n  size_t node_;\n  StateId node_state_;\n  std::vector<Label> context_;\n  StateId context_state_;\n  NGramFstInst()\n      : state_(kNoStateId),\n        node_state_(kNoStateId),\n        context_state_(kNoStateId) {}\n};\n\nnamespace internal {\n\n// Implementation class for LOUDS based NgramFst interface.\ntemplate <class A>\nclass NGramFstImpl : public FstImpl<A> {\n  using FstImpl<A>::SetInputSymbols;\n  using FstImpl<A>::SetOutputSymbols;\n  using FstImpl<A>::SetType;\n  using FstImpl<A>::WriteHeader;\n\n  friend class ArcIterator<NGramFst<A>>;\n  friend class NGramFstMatcher<A>;\n\n public:\n  using FstImpl<A>::InputSymbols;\n  using FstImpl<A>::SetProperties;\n  using FstImpl<A>::Properties;\n\n  typedef A Arc;\n  typedef typename A::Label Label;\n  typedef typename A::StateId StateId;\n  typedef typename A::Weight Weight;\n\n  NGramFstImpl() {\n    SetType(\"ngram\");\n    SetInputSymbols(nullptr);\n    SetOutputSymbols(nullptr);\n    SetProperties(kStaticProperties);\n  }\n\n  NGramFstImpl(const Fst<A> &fst, std::vector<StateId> *order_out);\n\n  explicit NGramFstImpl(const Fst<A> &fst) : NGramFstImpl(fst, nullptr) {}\n\n  NGramFstImpl(const NGramFstImpl &other) {\n    FSTERROR() << \"Copying NGramFst Impls is not supported, use safe = false.\";\n    SetProperties(kError, kError);\n  }\n\n  ~NGramFstImpl() override {\n    if (owned_) {\n      delete[] data_;\n    }\n  }\n\n  static NGramFstImpl<A> *Read(std::istream &strm,  // NOLINT\n                               const FstReadOptions &opts) {\n    NGramFstImpl<A> *impl = new NGramFstImpl();\n    FstHeader hdr;\n    if (!impl->ReadHeader(strm, opts, kMinFileVersion, &hdr)) return 0;\n    uint64 num_states, num_futures, num_final;\n    const size_t offset =\n        sizeof(num_states) + sizeof(num_futures) + sizeof(num_final);\n    // Peek at num_states and num_futures to see how much more needs to be read.\n    strm.read(reinterpret_cast<char *>(&num_states), sizeof(num_states));\n    strm.read(reinterpret_cast<char *>(&num_futures), sizeof(num_futures));\n    strm.read(reinterpret_cast<char *>(&num_final), sizeof(num_final));\n    size_t size = Storage(num_states, num_futures, num_final);\n    MappedFile *data_region = MappedFile::Allocate(size);\n    char *data = reinterpret_cast<char *>(data_region->mutable_data());\n    // Copy num_states, num_futures and num_final back into data.\n    memcpy(data, reinterpret_cast<char *>(&num_states), sizeof(num_states));\n    memcpy(data + sizeof(num_states), reinterpret_cast<char *>(&num_futures),\n           sizeof(num_futures));\n    memcpy(data + sizeof(num_states) + sizeof(num_futures),\n           reinterpret_cast<char *>(&num_final), sizeof(num_final));\n    strm.read(data + offset, size - offset);\n    if (strm.fail()) {\n      delete impl;\n      return nullptr;\n    }\n    impl->Init(data, false, data_region);\n    return impl;\n  }\n\n  bool Write(std::ostream &strm,  // NOLINT\n             const FstWriteOptions &opts) const {\n    FstHeader hdr;\n    hdr.SetStart(Start());\n    hdr.SetNumStates(num_states_);\n    WriteHeader(strm, opts, kFileVersion, &hdr);\n    strm.write(data_, StorageSize());\n    return !strm.fail();\n  }\n\n  StateId Start() const { return start_; }\n\n  Weight Final(StateId state) const {\n    if (final_index_.Get(state)) {\n      return final_probs_[final_index_.Rank1(state)];\n    } else {\n      return Weight::Zero();\n    }\n  }\n\n  size_t NumArcs(StateId state, NGramFstInst<A> *inst = nullptr) const {\n    if (inst == nullptr) {\n      const std::pair<size_t, size_t> zeros =\n          (state == 0) ? select_root_ : future_index_.Select0s(state);\n      return zeros.second - zeros.first - 1;\n    }\n    SetInstFuture(state, inst);\n    return inst->num_futures_ + ((state == 0) ? 0 : 1);\n  }\n\n  size_t NumInputEpsilons(StateId state) const {\n    // State 0 has no parent, thus no backoff.\n    if (state == 0) return 0;\n    return 1;\n  }\n\n  size_t NumOutputEpsilons(StateId state) const {\n    return NumInputEpsilons(state);\n  }\n\n  StateId NumStates() const { return num_states_; }\n\n  void InitStateIterator(StateIteratorData<A> *data) const {\n    data->base = 0;\n    data->nstates = num_states_;\n  }\n\n  static size_t Storage(uint64 num_states, uint64 num_futures,\n                        uint64 num_final) {\n    uint64 b64;\n    Weight weight;\n    Label label;\n    size_t offset =\n        sizeof(num_states) + sizeof(num_futures) + sizeof(num_final);\n    offset +=\n        sizeof(b64) * (BitmapIndex::StorageSize(num_states * 2 + 1) +\n                       BitmapIndex::StorageSize(num_futures + num_states + 1) +\n                       BitmapIndex::StorageSize(num_states));\n    offset += (num_states + 1) * sizeof(label) + num_futures * sizeof(label);\n    // Pad for alignemnt, see\n    // http://en.wikipedia.org/wiki/Data_structure_alignment#Computing_padding\n    offset = (offset + sizeof(weight) - 1) & ~(sizeof(weight) - 1);\n    offset += (num_states + 1) * sizeof(weight) + num_final * sizeof(weight) +\n              (num_futures + 1) * sizeof(weight);\n    return offset;\n  }\n\n  void SetInstFuture(StateId state, NGramFstInst<A> *inst) const {\n    if (inst->state_ != state) {\n      inst->state_ = state;\n      const std::pair<size_t, size_t> zeros = future_index_.Select0s(state);\n      inst->num_futures_ = zeros.second - zeros.first - 1;\n      inst->offset_ = future_index_.Rank1(zeros.first + 1);\n    }\n  }\n\n  void SetInstNode(NGramFstInst<A> *inst) const {\n    if (inst->node_state_ != inst->state_) {\n      inst->node_state_ = inst->state_;\n      inst->node_ = context_index_.Select1(inst->state_);\n    }\n  }\n\n  void SetInstContext(NGramFstInst<A> *inst) const {\n    SetInstNode(inst);\n    if (inst->context_state_ != inst->state_) {\n      inst->context_state_ = inst->state_;\n      inst->context_.clear();\n      size_t node = inst->node_;\n      while (node != 0) {\n        inst->context_.push_back(context_words_[context_index_.Rank1(node)]);\n        node = context_index_.Select1(context_index_.Rank0(node) - 1);\n      }\n    }\n  }\n\n  // Access to the underlying representation\n  const char *GetData(size_t *data_size) const {\n    *data_size = StorageSize();\n    return data_;\n  }\n\n  void Init(const char *data, bool owned, MappedFile *file = nullptr);\n\n  const std::vector<Label> &GetContext(StateId s, NGramFstInst<A> *inst) const {\n    SetInstFuture(s, inst);\n    SetInstContext(inst);\n    return inst->context_;\n  }\n\n  size_t StorageSize() const {\n    return Storage(num_states_, num_futures_, num_final_);\n  }\n\n  void GetStates(const std::vector<Label> &context,\n                 std::vector<StateId> *states) const;\n\n private:\n  StateId Transition(const std::vector<Label> &context, Label future) const;\n\n  // Properties always true for this Fst class.\n  static const uint64 kStaticProperties =\n      kAcceptor | kIDeterministic | kODeterministic | kEpsilons | kIEpsilons |\n      kOEpsilons | kILabelSorted | kOLabelSorted | kWeighted | kCyclic |\n      kInitialAcyclic | kNotTopSorted | kAccessible | kCoAccessible |\n      kNotString | kExpanded;\n  // Current file format version.\n  static const int kFileVersion = 4;\n  // Minimum file format version supported.\n  static const int kMinFileVersion = 4;\n\n  std::unique_ptr<MappedFile> data_region_;\n  const char *data_ = nullptr;\n  bool owned_ = false;  // True if we own data_\n  StateId start_ = fst::kNoStateId;\n  uint64 num_states_ = 0;\n  uint64 num_futures_ = 0;\n  uint64 num_final_ = 0;\n  std::pair<size_t, size_t> select_root_;\n  const Label *root_children_ = nullptr;\n  // borrowed references\n  const uint64 *context_ = nullptr;\n  const uint64 *future_ = nullptr;\n  const uint64 *final_ = nullptr;\n  const Label *context_words_ = nullptr;\n  const Label *future_words_ = nullptr;\n  const Weight *backoff_ = nullptr;\n  const Weight *final_probs_ = nullptr;\n  const Weight *future_probs_ = nullptr;\n  BitmapIndex context_index_;\n  BitmapIndex future_index_;\n  BitmapIndex final_index_;\n};\n\ntemplate <typename A>\ninline void NGramFstImpl<A>::GetStates(\n    const std::vector<Label> &context,\n    std::vector<typename A::StateId> *states) const {\n  states->clear();\n  states->push_back(0);\n  typename std::vector<Label>::const_reverse_iterator cit = context.rbegin();\n  const Label *children = root_children_;\n  size_t num_children = select_root_.second - 2;\n  const Label *loc = std::lower_bound(children, children + num_children, *cit);\n  if (loc == children + num_children || *loc != *cit) return;\n  size_t node = 2 + loc - children;\n  states->push_back(context_index_.Rank1(node));\n  if (context.size() == 1) return;\n  size_t node_rank = context_index_.Rank1(node);\n  std::pair<size_t, size_t> zeros =\n      node_rank == 0 ? select_root_ : context_index_.Select0s(node_rank);\n  size_t first_child = zeros.first + 1;\n  ++cit;\n  if (context_index_.Get(first_child) != false) {\n    size_t last_child = zeros.second - 1;\n    while (cit != context.rend()) {\n      children = context_words_ + context_index_.Rank1(first_child);\n      loc = std::lower_bound(children, children + last_child - first_child + 1,\n                             *cit);\n      if (loc == children + last_child - first_child + 1 || *loc != *cit) {\n        break;\n      }\n      ++cit;\n      node = first_child + loc - children;\n      states->push_back(context_index_.Rank1(node));\n      node_rank = context_index_.Rank1(node);\n      zeros =\n          node_rank == 0 ? select_root_ : context_index_.Select0s(node_rank);\n      first_child = zeros.first + 1;\n      if (context_index_.Get(first_child) == false) break;\n      last_child = zeros.second - 1;\n    }\n  }\n}\n\n}  // namespace internal\n\n/*****************************************************************************/\ntemplate <class A>\nclass NGramFst : public ImplToExpandedFst<internal::NGramFstImpl<A>> {\n  friend class ArcIterator<NGramFst<A>>;\n  friend class NGramFstMatcher<A>;\n\n public:\n  typedef A Arc;\n  typedef typename A::StateId StateId;\n  typedef typename A::Label Label;\n  typedef typename A::Weight Weight;\n  typedef internal::NGramFstImpl<A> Impl;\n\n  explicit NGramFst(const Fst<A> &dst)\n      : ImplToExpandedFst<Impl>(std::make_shared<Impl>(dst, nullptr)) {}\n\n  NGramFst(const Fst<A> &fst, std::vector<StateId> *order_out)\n      : ImplToExpandedFst<Impl>(std::make_shared<Impl>(fst, order_out)) {}\n\n  // Because the NGramFstImpl is a const stateless data structure, there\n  // is never a need to do anything beside copy the reference.\n  NGramFst(const NGramFst<A> &fst, bool safe = false)\n      : ImplToExpandedFst<Impl>(fst, false) {}\n\n  NGramFst() : ImplToExpandedFst<Impl>(std::make_shared<Impl>()) {}\n\n  // Non-standard constructor to initialize NGramFst directly from data.\n  NGramFst(const char *data, bool owned)\n      : ImplToExpandedFst<Impl>(std::make_shared<Impl>()) {\n    GetMutableImpl()->Init(data, owned, nullptr);\n  }\n\n  // Get method that gets the data associated with Init().\n  const char *GetData(size_t *data_size) const {\n    return GetImpl()->GetData(data_size);\n  }\n\n  const std::vector<Label> GetContext(StateId s) const {\n    return GetImpl()->GetContext(s, &inst_);\n  }\n\n  // Consumes as much as possible of context from right to left, returns the\n  // the states corresponding to the increasingly conditioned input sequence.\n  void GetStates(const std::vector<Label> &context,\n                 std::vector<StateId> *state) const {\n    return GetImpl()->GetStates(context, state);\n  }\n\n  size_t NumArcs(StateId s) const override {\n    return GetImpl()->NumArcs(s, &inst_);\n  }\n\n  NGramFst<A> *Copy(bool safe = false) const override {\n    return new NGramFst(*this, safe);\n  }\n\n  static NGramFst<A> *Read(std::istream &strm, const FstReadOptions &opts) {\n    Impl *impl = Impl::Read(strm, opts);\n    return impl ? new NGramFst<A>(std::shared_ptr<Impl>(impl)) : nullptr;\n  }\n\n  static NGramFst<A> *Read(const string &filename) {\n    if (!filename.empty()) {\n      std::ifstream strm(filename,\n                              std::ios_base::in | std::ios_base::binary);\n      if (!strm.good()) {\n        LOG(ERROR) << \"NGramFst::Read: Can't open file: \" << filename;\n        return nullptr;\n      }\n      return Read(strm, FstReadOptions(filename));\n    } else {\n      return Read(std::cin, FstReadOptions(\"standard input\"));\n    }\n  }\n\n  bool Write(std::ostream &strm, const FstWriteOptions &opts) const override {\n    return GetImpl()->Write(strm, opts);\n  }\n\n  bool Write(const string &filename) const override {\n    return Fst<A>::WriteFile(filename);\n  }\n\n  inline void InitStateIterator(StateIteratorData<A> *data) const override {\n    GetImpl()->InitStateIterator(data);\n  }\n\n  inline void InitArcIterator(StateId s,\n                              ArcIteratorData<A> *data) const override;\n\n  MatcherBase<A> *InitMatcher(MatchType match_type) const override {\n    return new NGramFstMatcher<A>(this, match_type);\n  }\n\n  size_t StorageSize() const { return GetImpl()->StorageSize(); }\n\n  static bool HasRequiredProps(const Fst<A> &fst) {\n    int64 props =\n        kAcceptor | kIDeterministic | kILabelSorted | kIEpsilons | kAccessible;\n    return fst.Properties(props, true) == props;\n  }\n\n  static bool HasRequiredStructure(const Fst<A> &fst) {\n    if (!HasRequiredProps(fst)) {\n      return false;\n    }\n    typename A::StateId unigram = fst.Start();\n    while (true) {  // Follows epsilon arc chain to find unigram state.\n      if (unigram == fst::kNoStateId) return false;  // No unigram state.\n      typename fst::ArcIterator<Fst<A>> aiter(fst, unigram);\n      if (aiter.Done() || aiter.Value().ilabel != 0) break;\n      unigram = aiter.Value().nextstate;\n      aiter.Next();\n    }\n    // Other requirement: all states other than unigram an epsilon arc.\n    for (fst::StateIterator<Fst<A>> siter(fst); !siter.Done();\n         siter.Next()) {\n      const typename A::StateId &state = siter.Value();\n      fst::ArcIterator<Fst<A>> aiter(fst, state);\n      if (state != unigram) {\n        if (aiter.Done()) return false;\n        if (aiter.Value().ilabel != 0) return false;\n        aiter.Next();\n        if (!aiter.Done() && aiter.Value().ilabel == 0) return false;\n      }\n    }\n    return true;\n  }\n\n private:\n  using ImplToExpandedFst<Impl, ExpandedFst<A>>::GetImpl;\n  using ImplToExpandedFst<Impl, ExpandedFst<A>>::GetMutableImpl;\n\n  explicit NGramFst(std::shared_ptr<Impl> impl)\n      : ImplToExpandedFst<Impl>(impl) {}\n\n  mutable NGramFstInst<A> inst_;\n};\n\ntemplate <class A>\ninline void NGramFst<A>::InitArcIterator(StateId s,\n                                         ArcIteratorData<A> *data) const {\n  GetImpl()->SetInstFuture(s, &inst_);\n  GetImpl()->SetInstNode(&inst_);\n  data->base = new ArcIterator<NGramFst<A>>(*this, s);\n}\n\nnamespace internal {\n\ntemplate <typename A>\nNGramFstImpl<A>::NGramFstImpl(const Fst<A> &fst,\n                              std::vector<StateId> *order_out) {\n  typedef A Arc;\n  typedef typename Arc::Label Label;\n  typedef typename Arc::Weight Weight;\n  typedef typename Arc::StateId StateId;\n  SetType(\"ngram\");\n  SetInputSymbols(fst.InputSymbols());\n  SetOutputSymbols(fst.OutputSymbols());\n  SetProperties(kStaticProperties);\n\n  // Check basic requirements for an OpenGrm language model Fst.\n  if (!NGramFst<A>::HasRequiredProps(fst)) {\n    FSTERROR() << \"NGramFst only accepts OpenGrm language models as input\";\n    SetProperties(kError, kError);\n    return;\n  }\n\n  int64 num_states = CountStates(fst);\n  Label *context = new Label[num_states];\n\n  // Find the unigram state by starting from the start state, following\n  // epsilons.\n  StateId unigram = fst.Start();\n  while (1) {\n    if (unigram == kNoStateId) {\n      FSTERROR() << \"Could not identify unigram state\";\n      SetProperties(kError, kError);\n      return;\n    }\n    ArcIterator<Fst<A>> aiter(fst, unigram);\n    if (aiter.Done()) {\n      LOG(WARNING) << \"Unigram state \" << unigram << \" has no arcs.\";\n      break;\n    }\n    if (aiter.Value().ilabel != 0) break;\n    unigram = aiter.Value().nextstate;\n  }\n\n  // Each state's context is determined by the subtree it is under from the\n  // unigram state.\n  std::queue<std::pair<StateId, Label>> label_queue;\n  std::vector<bool> visited(num_states);\n  // Force an epsilon link to the start state.\n  label_queue.push(std::make_pair(fst.Start(), 0));\n  for (ArcIterator<Fst<A>> aiter(fst, unigram); !aiter.Done(); aiter.Next()) {\n    label_queue.push(\n        std::make_pair(aiter.Value().nextstate, aiter.Value().ilabel));\n  }\n  // investigate states in breadth first fashion to assign context words.\n  while (!label_queue.empty()) {\n    std::pair<StateId, Label> &now = label_queue.front();\n    if (!visited[now.first]) {\n      context[now.first] = now.second;\n      visited[now.first] = true;\n      for (ArcIterator<Fst<A>> aiter(fst, now.first); !aiter.Done();\n           aiter.Next()) {\n        const Arc &arc = aiter.Value();\n        if (arc.ilabel != 0) {\n          label_queue.push(std::make_pair(arc.nextstate, now.second));\n        }\n      }\n    }\n    label_queue.pop();\n  }\n  visited.clear();\n\n  // The arc from the start state should be assigned an epsilon to put it\n  // in front of the all other labels (which makes Start state 1 after\n  // unigram which is state 0).\n  context[fst.Start()] = 0;\n\n  // Build the tree of contexts fst by reversing the epsilon arcs from fst.\n  VectorFst<Arc> context_fst;\n  uint64 num_final = 0;\n  for (int i = 0; i < num_states; ++i) {\n    if (fst.Final(i) != Weight::Zero()) {\n      ++num_final;\n    }\n    context_fst.SetFinal(context_fst.AddState(), fst.Final(i));\n  }\n  context_fst.SetStart(unigram);\n  context_fst.SetInputSymbols(fst.InputSymbols());\n  context_fst.SetOutputSymbols(fst.OutputSymbols());\n  int64 num_context_arcs = 0;\n  int64 num_futures = 0;\n  for (StateIterator<Fst<A>> siter(fst); !siter.Done(); siter.Next()) {\n    const StateId &state = siter.Value();\n    num_futures += fst.NumArcs(state) - fst.NumInputEpsilons(state);\n    ArcIterator<Fst<A>> aiter(fst, state);\n    if (!aiter.Done()) {\n      const Arc &arc = aiter.Value();\n      // this arc goes from state to arc.nextstate, so create an arc from\n      // arc.nextstate to state to reverse it.\n      if (arc.ilabel == 0) {\n        context_fst.AddArc(arc.nextstate, Arc(context[state], context[state],\n                                              arc.weight, state));\n        num_context_arcs++;\n      }\n    }\n  }\n  if (num_context_arcs != context_fst.NumStates() - 1) {\n    FSTERROR() << \"Number of contexts arcs != number of states - 1\";\n    SetProperties(kError, kError);\n    return;\n  }\n  if (context_fst.NumStates() != num_states) {\n    FSTERROR() << \"Number of contexts != number of states\";\n    SetProperties(kError, kError);\n    return;\n  }\n  int64 context_props =\n      context_fst.Properties(kIDeterministic | kILabelSorted, true);\n  if (!(context_props & kIDeterministic)) {\n    FSTERROR() << \"Input Fst is not structured properly\";\n    SetProperties(kError, kError);\n    return;\n  }\n  if (!(context_props & kILabelSorted)) {\n    ArcSort(&context_fst, ILabelCompare<Arc>());\n  }\n\n  delete[] context;\n\n  uint64 b64;\n  Weight weight;\n  Label label = kNoLabel;\n  const size_t storage = Storage(num_states, num_futures, num_final);\n  MappedFile *data_region = MappedFile::Allocate(storage);\n  char *data = reinterpret_cast<char *>(data_region->mutable_data());\n  memset(data, 0, storage);\n  size_t offset = 0;\n  memcpy(data + offset, reinterpret_cast<char *>(&num_states),\n         sizeof(num_states));\n  offset += sizeof(num_states);\n  memcpy(data + offset, reinterpret_cast<char *>(&num_futures),\n         sizeof(num_futures));\n  offset += sizeof(num_futures);\n  memcpy(data + offset, reinterpret_cast<char *>(&num_final),\n         sizeof(num_final));\n  offset += sizeof(num_final);\n  uint64 *context_bits = reinterpret_cast<uint64 *>(data + offset);\n  offset += BitmapIndex::StorageSize(num_states * 2 + 1) * sizeof(b64);\n  uint64 *future_bits = reinterpret_cast<uint64 *>(data + offset);\n  offset +=\n      BitmapIndex::StorageSize(num_futures + num_states + 1) * sizeof(b64);\n  uint64 *final_bits = reinterpret_cast<uint64 *>(data + offset);\n  offset += BitmapIndex::StorageSize(num_states) * sizeof(b64);\n  Label *context_words = reinterpret_cast<Label *>(data + offset);\n  offset += (num_states + 1) * sizeof(label);\n  Label *future_words = reinterpret_cast<Label *>(data + offset);\n  offset += num_futures * sizeof(label);\n  offset = (offset + sizeof(weight) - 1) & ~(sizeof(weight) - 1);\n  Weight *backoff = reinterpret_cast<Weight *>(data + offset);\n  offset += (num_states + 1) * sizeof(weight);\n  Weight *final_probs = reinterpret_cast<Weight *>(data + offset);\n  offset += num_final * sizeof(weight);\n  Weight *future_probs = reinterpret_cast<Weight *>(data + offset);\n  int64 context_arc = 0, future_arc = 0, context_bit = 0, future_bit = 0,\n        final_bit = 0;\n\n  // pseudo-root bits\n  BitmapIndex::Set(context_bits, context_bit++);\n  ++context_bit;\n  context_words[context_arc] = label;\n  backoff[context_arc] = Weight::Zero();\n  context_arc++;\n\n  ++future_bit;\n  if (order_out) {\n    order_out->clear();\n    order_out->resize(num_states);\n  }\n\n  std::queue<StateId> context_q;\n  context_q.push(context_fst.Start());\n  StateId state_number = 0;\n  while (!context_q.empty()) {\n    const StateId &state = context_q.front();\n    if (order_out) {\n      (*order_out)[state] = state_number;\n    }\n\n    const Weight final_weight = context_fst.Final(state);\n    if (final_weight != Weight::Zero()) {\n      BitmapIndex::Set(final_bits, state_number);\n      final_probs[final_bit] = final_weight;\n      ++final_bit;\n    }\n\n    for (ArcIterator<VectorFst<A>> aiter(context_fst, state); !aiter.Done();\n         aiter.Next()) {\n      const Arc &arc = aiter.Value();\n      context_words[context_arc] = arc.ilabel;\n      backoff[context_arc] = arc.weight;\n      ++context_arc;\n      BitmapIndex::Set(context_bits, context_bit++);\n      context_q.push(arc.nextstate);\n    }\n    ++context_bit;\n\n    for (ArcIterator<Fst<A>> aiter(fst, state); !aiter.Done(); aiter.Next()) {\n      const Arc &arc = aiter.Value();\n      if (arc.ilabel != 0) {\n        future_words[future_arc] = arc.ilabel;\n        future_probs[future_arc] = arc.weight;\n        ++future_arc;\n        BitmapIndex::Set(future_bits, future_bit++);\n      }\n    }\n    ++future_bit;\n    ++state_number;\n    context_q.pop();\n  }\n\n  if ((state_number != num_states) || (context_bit != num_states * 2 + 1) ||\n      (context_arc != num_states) || (future_arc != num_futures) ||\n      (future_bit != num_futures + num_states + 1) ||\n      (final_bit != num_final)) {\n    FSTERROR() << \"Structure problems detected during construction\";\n    SetProperties(kError, kError);\n    return;\n  }\n\n  Init(data, false, data_region);\n}\n\ntemplate <typename A>\ninline void NGramFstImpl<A>::Init(const char *data, bool owned,\n                                  MappedFile *data_region) {\n  if (owned_) {\n    delete[] data_;\n  }\n  data_region_.reset(data_region);\n  owned_ = owned;\n  data_ = data;\n  size_t offset = 0;\n  num_states_ = *(reinterpret_cast<const uint64 *>(data_ + offset));\n  offset += sizeof(num_states_);\n  num_futures_ = *(reinterpret_cast<const uint64 *>(data_ + offset));\n  offset += sizeof(num_futures_);\n  num_final_ = *(reinterpret_cast<const uint64 *>(data_ + offset));\n  offset += sizeof(num_final_);\n  uint64 bits;\n  size_t context_bits = num_states_ * 2 + 1;\n  size_t future_bits = num_futures_ + num_states_ + 1;\n  context_ = reinterpret_cast<const uint64 *>(data_ + offset);\n  offset += BitmapIndex::StorageSize(context_bits) * sizeof(bits);\n  future_ = reinterpret_cast<const uint64 *>(data_ + offset);\n  offset += BitmapIndex::StorageSize(future_bits) * sizeof(bits);\n  final_ = reinterpret_cast<const uint64 *>(data_ + offset);\n  offset += BitmapIndex::StorageSize(num_states_) * sizeof(bits);\n  context_words_ = reinterpret_cast<const Label *>(data_ + offset);\n  offset += (num_states_ + 1) * sizeof(*context_words_);\n  future_words_ = reinterpret_cast<const Label *>(data_ + offset);\n  offset += num_futures_ * sizeof(*future_words_);\n  offset = (offset + sizeof(*backoff_) - 1) & ~(sizeof(*backoff_) - 1);\n  backoff_ = reinterpret_cast<const Weight *>(data_ + offset);\n  offset += (num_states_ + 1) * sizeof(*backoff_);\n  final_probs_ = reinterpret_cast<const Weight *>(data_ + offset);\n  offset += num_final_ * sizeof(*final_probs_);\n  future_probs_ = reinterpret_cast<const Weight *>(data_ + offset);\n\n  context_index_.BuildIndex(context_, context_bits);\n  future_index_.BuildIndex(future_, future_bits);\n  final_index_.BuildIndex(final_, num_states_);\n\n  select_root_ = context_index_.Select0s(0);\n  if (context_index_.Rank1(0) != 0 || select_root_.first != 1 ||\n      context_index_.Get(2) == false) {\n    FSTERROR() << \"Malformed file\";\n    SetProperties(kError, kError);\n    return;\n  }\n  root_children_ = context_words_ + context_index_.Rank1(2);\n  start_ = 1;\n}\n\ntemplate <typename A>\ninline typename A::StateId NGramFstImpl<A>::Transition(\n    const std::vector<Label> &context, Label future) const {\n  const Label *children = root_children_;\n  size_t num_children = select_root_.second - 2;\n  const Label *loc =\n      std::lower_bound(children, children + num_children, future);\n  if (loc == children + num_children || *loc != future) {\n    return context_index_.Rank1(0);\n  }\n  size_t node = 2 + loc - children;\n  size_t node_rank = context_index_.Rank1(node);\n  std::pair<size_t, size_t> zeros =\n      (node_rank == 0) ? select_root_ : context_index_.Select0s(node_rank);\n  size_t first_child = zeros.first + 1;\n  if (context_index_.Get(first_child) == false) {\n    return context_index_.Rank1(node);\n  }\n  size_t last_child = zeros.second - 1;\n  for (int word = context.size() - 1; word >= 0; --word) {\n    children = context_words_ + context_index_.Rank1(first_child);\n    loc = std::lower_bound(children, children + last_child - first_child + 1,\n                           context[word]);\n    if (loc == children + last_child - first_child + 1 ||\n        *loc != context[word]) {\n      break;\n    }\n    node = first_child + loc - children;\n    node_rank = context_index_.Rank1(node);\n    zeros =\n        (node_rank == 0) ? select_root_ : context_index_.Select0s(node_rank);\n    first_child = zeros.first + 1;\n    if (context_index_.Get(first_child) == false) break;\n    last_child = zeros.second - 1;\n  }\n  return context_index_.Rank1(node);\n}\n\n}  // namespace internal\n\n/*****************************************************************************/\ntemplate <class A>\nclass NGramFstMatcher : public MatcherBase<A> {\n public:\n  typedef A Arc;\n  typedef typename A::Label Label;\n  typedef typename A::StateId StateId;\n  typedef typename A::Weight Weight;\n\n  // This makes a copy of the FST.\n  NGramFstMatcher(const NGramFst<A> &fst, MatchType match_type)\n      : owned_fst_(fst.Copy()),\n        fst_(*owned_fst_),\n        inst_(fst_.inst_),\n        match_type_(match_type),\n        current_loop_(false),\n        loop_(kNoLabel, 0, A::Weight::One(), kNoStateId) {\n    if (match_type_ == MATCH_OUTPUT) {\n      std::swap(loop_.ilabel, loop_.olabel);\n    }\n  }\n\n  // This doesn't copy the FST.\n  NGramFstMatcher(const NGramFst<A> *fst, MatchType match_type)\n      : fst_(*fst),\n        inst_(fst_.inst_),\n        match_type_(match_type),\n        current_loop_(false),\n        loop_(kNoLabel, 0, A::Weight::One(), kNoStateId) {\n    if (match_type_ == MATCH_OUTPUT) {\n      std::swap(loop_.ilabel, loop_.olabel);\n    }\n  }\n\n  // This makes a copy of the FST.\n  NGramFstMatcher(const NGramFstMatcher<A> &matcher, bool safe = false)\n      : owned_fst_(matcher.fst_.Copy(safe)),\n        fst_(*owned_fst_),\n        inst_(matcher.inst_),\n        match_type_(matcher.match_type_),\n        current_loop_(false),\n        loop_(kNoLabel, 0, A::Weight::One(), kNoStateId) {\n    if (match_type_ == MATCH_OUTPUT) {\n      std::swap(loop_.ilabel, loop_.olabel);\n    }\n  }\n\n  NGramFstMatcher<A> *Copy(bool safe = false) const override {\n    return new NGramFstMatcher<A>(*this, safe);\n  }\n\n  MatchType Type(bool test) const override { return match_type_; }\n\n  const Fst<A> &GetFst() const override { return fst_; }\n\n  uint64 Properties(uint64 props) const override { return props; }\n\n  void SetState(StateId s) final {\n    fst_.GetImpl()->SetInstFuture(s, &inst_);\n    current_loop_ = false;\n  }\n\n  bool Find(Label label) final {\n    const Label nolabel = kNoLabel;\n    done_ = true;\n    if (label == 0 || label == nolabel) {\n      if (label == 0) {\n        current_loop_ = true;\n        loop_.nextstate = inst_.state_;\n      }\n      // The unigram state has no epsilon arc.\n      if (inst_.state_ != 0) {\n        arc_.ilabel = arc_.olabel = 0;\n        fst_.GetImpl()->SetInstNode(&inst_);\n        arc_.nextstate = fst_.GetImpl()->context_index_.Rank1(\n            fst_.GetImpl()->context_index_.Select1(\n                fst_.GetImpl()->context_index_.Rank0(inst_.node_) - 1));\n        arc_.weight = fst_.GetImpl()->backoff_[inst_.state_];\n        done_ = false;\n      }\n    } else {\n      current_loop_ = false;\n      const Label *start = fst_.GetImpl()->future_words_ + inst_.offset_;\n      const Label *end = start + inst_.num_futures_;\n      const Label *search = std::lower_bound(start, end, label);\n      if (search != end && *search == label) {\n        size_t state = search - start;\n        arc_.ilabel = arc_.olabel = label;\n        arc_.weight = fst_.GetImpl()->future_probs_[inst_.offset_ + state];\n        fst_.GetImpl()->SetInstContext(&inst_);\n        arc_.nextstate = fst_.GetImpl()->Transition(inst_.context_, label);\n        done_ = false;\n      }\n    }\n    return !Done();\n  }\n\n  bool Done() const final { return !current_loop_ && done_; }\n\n  const Arc &Value() const final { return (current_loop_) ? loop_ : arc_; }\n\n  void Next() final {\n    if (current_loop_) {\n      current_loop_ = false;\n    } else {\n      done_ = true;\n    }\n  }\n\n  ssize_t Priority(StateId s) final { return fst_.NumArcs(s); }\n\n private:\n  std::unique_ptr<NGramFst<A>> owned_fst_;\n  const NGramFst<A> &fst_;\n  NGramFstInst<A> inst_;\n  MatchType match_type_;  // Supplied by caller\n  bool done_;\n  Arc arc_;\n  bool current_loop_;  // Current arc is the implicit loop\n  Arc loop_;\n};\n\n/*****************************************************************************/\n// Specialization for NGramFst; see generic version in fst.h\n// for sample usage (but use the ProdLmFst type!). This version\n// should inline.\ntemplate <class A>\nclass StateIterator<NGramFst<A>> : public StateIteratorBase<A> {\n public:\n  typedef typename A::StateId StateId;\n\n  explicit StateIterator(const NGramFst<A> &fst)\n      : s_(0), num_states_(fst.NumStates()) {}\n\n  bool Done() const final { return s_ >= num_states_; }\n\n  StateId Value() const final { return s_; }\n\n  void Next() final { ++s_; }\n\n  void Reset() final { s_ = 0; }\n\n private:\n  StateId s_;\n  StateId num_states_;\n};\n\n/*****************************************************************************/\ntemplate <class A>\nclass ArcIterator<NGramFst<A>> : public ArcIteratorBase<A> {\n public:\n  typedef A Arc;\n  typedef typename A::Label Label;\n  typedef typename A::StateId StateId;\n  typedef typename A::Weight Weight;\n\n  ArcIterator(const NGramFst<A> &fst, StateId state)\n      : lazy_(~0), impl_(fst.GetImpl()), i_(0), flags_(kArcValueFlags) {\n    inst_ = fst.inst_;\n    impl_->SetInstFuture(state, &inst_);\n    impl_->SetInstNode(&inst_);\n  }\n\n  bool Done() const final {\n    return i_ >=\n           ((inst_.node_ == 0) ? inst_.num_futures_ : inst_.num_futures_ + 1);\n  }\n\n  const Arc &Value() const final {\n    bool eps = (inst_.node_ != 0 && i_ == 0);\n    StateId state = (inst_.node_ == 0) ? i_ : i_ - 1;\n    if (flags_ & lazy_ & (kArcILabelValue | kArcOLabelValue)) {\n      arc_.ilabel = arc_.olabel =\n          eps ? 0 : impl_->future_words_[inst_.offset_ + state];\n      lazy_ &= ~(kArcILabelValue | kArcOLabelValue);\n    }\n    if (flags_ & lazy_ & kArcNextStateValue) {\n      if (eps) {\n        arc_.nextstate =\n            impl_->context_index_.Rank1(impl_->context_index_.Select1(\n                impl_->context_index_.Rank0(inst_.node_) - 1));\n      } else {\n        if (lazy_ & kArcNextStateValue) {\n          impl_->SetInstContext(&inst_);  // first time only.\n        }\n        arc_.nextstate = impl_->Transition(\n            inst_.context_, impl_->future_words_[inst_.offset_ + state]);\n      }\n      lazy_ &= ~kArcNextStateValue;\n    }\n    if (flags_ & lazy_ & kArcWeightValue) {\n      arc_.weight = eps ? impl_->backoff_[inst_.state_]\n                        : impl_->future_probs_[inst_.offset_ + state];\n      lazy_ &= ~kArcWeightValue;\n    }\n    return arc_;\n  }\n\n  void Next() final {\n    ++i_;\n    lazy_ = ~0;\n  }\n\n  size_t Position() const final { return i_; }\n\n  void Reset() final {\n    i_ = 0;\n    lazy_ = ~0;\n  }\n\n  void Seek(size_t a) final {\n    if (i_ != a) {\n      i_ = a;\n      lazy_ = ~0;\n    }\n  }\n\n  uint32 Flags() const final { return flags_; }\n\n  void SetFlags(uint32 flags, uint32 mask) final {\n    flags_ &= ~mask;\n    flags_ |= (flags & kArcValueFlags);\n  }\n\n private:\n  mutable Arc arc_;\n  mutable uint32 lazy_;\n  const internal::NGramFstImpl<A> *impl_;  // Borrowed reference.\n  mutable NGramFstInst<A> inst_;\n\n  size_t i_;\n  uint32 flags_;\n};\n\n}  // namespace fst\n#endif  // FST_EXTENSIONS_NGRAM_NGRAM_FST_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/extensions/ngram/nthbit.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#ifndef FST_EXTENSIONS_NGRAM_NTHBIT_H_\n#define FST_EXTENSIONS_NGRAM_NTHBIT_H_\n\n#include <fst/types.h>\n\nextern uint32 nth_bit_bit_offset[];\n\ninline uint32 nth_bit(uint64 v, uint32 r) {\n  uint32 shift = 0;\n  uint32 c = __builtin_popcount(v & 0xffffffff);\n  uint32 mask = -(r > c);\n  r -= c & mask;\n  shift += (32 & mask);\n\n  c = __builtin_popcount((v >> shift) & 0xffff);\n  mask = -(r > c);\n  r -= c & mask;\n  shift += (16 & mask);\n\n  c = __builtin_popcount((v >> shift) & 0xff);\n  mask = -(r > c);\n  r -= c & mask;\n  shift += (8 & mask);\n\n  return shift +\n         ((nth_bit_bit_offset[(v >> shift) & 0xff] >> ((r - 1) << 2)) & 0xf);\n}\n\n#endif  // FST_EXTENSIONS_NGRAM_NTHBIT_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/extensions/pdt/collection.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Class to store a collection of ordered (multi-)sets with elements of type T.\n\n#ifndef FST_EXTENSIONS_PDT_COLLECTION_H_\n#define FST_EXTENSIONS_PDT_COLLECTION_H_\n\n#include <functional>\n#include <vector>\n\n#include <fst/log.h>\n#include <fst/bi-table.h>\n\nnamespace fst {\n\n// Stores a collection of non-empty, ordered (multi-)sets with elements of type\n// T. A default constructor, operator==, and an STL-style hash functor must be\n// defined on the elements. Provides signed integer ID (of type I) for each\n// unique set. The IDs are allocated starting from 0 in order.\ntemplate <class I, class T>\nclass Collection {\n public:\n  struct Node {  // Trie node.\n    I node_id;   // Root is kNoNodeId;\n    T element;\n\n    Node() : node_id(kNoNodeId), element(T()) {}\n\n    Node(I i, const T &t) : node_id(i), element(t) {}\n\n    bool operator==(const Node &n) const {\n      return n.node_id == node_id && n.element == element;\n    }\n  };\n\n  struct NodeHash {\n    size_t operator()(const Node &n) const {\n      static constexpr auto kPrime = 7853;\n      return n.node_id + hash_(n.element) * kPrime;\n    }\n  };\n\n  using NodeTable = CompactHashBiTable<I, Node, NodeHash>;\n\n  class SetIterator {\n   public:\n    SetIterator(I id, Node node, NodeTable *node_table)\n        : id_(id), node_(node), node_table_(node_table) {}\n\n    bool Done() const { return id_ == kNoNodeId; }\n\n    const T &Element() const { return node_.element; }\n\n    void Next() {\n      id_ = node_.node_id;\n      if (id_ != kNoNodeId) node_ = node_table_->FindEntry(id_);\n    }\n\n   private:\n    I id_;       // Iterator set node ID.\n    Node node_;  // Iterator set node.\n    NodeTable *node_table_;\n  };\n\n  Collection() {}\n\n  // Looks up integer ID from ordered multi-se, and if it doesn't exist and\n  // insert is true, then adds it. Otherwise returns -1.\n  I FindId(const std::vector<T> &set, bool insert = true) {\n    I node_id = kNoNodeId;\n    for (ssize_t i = set.size() - 1; i >= 0; --i) {\n      Node node(node_id, set[i]);\n      node_id = node_table_.FindId(node, insert);\n      if (node_id == -1) break;\n    }\n    return node_id;\n  }\n\n  // Finds ordered (multi-)set given integer ID. Returns set iterator to\n  // traverse result.\n  SetIterator FindSet(I id) {\n    if (id < 0 || id >= node_table_.Size()) {\n      return SetIterator(kNoNodeId, Node(kNoNodeId, T()), &node_table_);\n    } else {\n      return SetIterator(id, node_table_.FindEntry(id), &node_table_);\n    }\n  }\n\n  I Size() const { return node_table_.Size(); }\n\n private:\n  static constexpr I kNoNodeId = -1;\n  static const std::hash<T> hash_;\n\n  NodeTable node_table_;\n};\n\ntemplate <class I, class T>\nconstexpr I Collection<I, T>::kNoNodeId;\n\ntemplate <class I, class T>\nconst std::hash<T> Collection<I, T>::hash_ = {};\n\n}  // namespace fst\n\n#endif  // FST_EXTENSIONS_PDT_COLLECTION_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/extensions/pdt/compose.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Composes a PDT and an FST.\n\n#ifndef FST_EXTENSIONS_PDT_COMPOSE_H_\n#define FST_EXTENSIONS_PDT_COMPOSE_H_\n\n#include <list>\n\n#include <fst/extensions/pdt/pdt.h>\n#include <fst/compose.h>\n\nnamespace fst {\n\n// Returns paren arcs for Find(kNoLabel).\nconstexpr uint32 kParenList = 0x00000001;\n\n// Returns a kNolabel loop for Find(paren).\nconstexpr uint32 kParenLoop = 0x00000002;\n\n// This class is a matcher that treats parens as multi-epsilon labels.\n// It is most efficient if the parens are in a range non-overlapping with\n// the non-paren labels.\ntemplate <class F>\nclass ParenMatcher {\n public:\n  using FST = F;\n  using M = SortedMatcher<FST>;\n  using Arc = typename FST::Arc;\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  // This makes a copy of the FST.\n  ParenMatcher(const FST &fst, MatchType match_type,\n               uint32 flags = (kParenLoop | kParenList))\n      : matcher_(fst, match_type), match_type_(match_type), flags_(flags) {\n    if (match_type == MATCH_INPUT) {\n      loop_.ilabel = kNoLabel;\n      loop_.olabel = 0;\n    } else {\n      loop_.ilabel = 0;\n      loop_.olabel = kNoLabel;\n    }\n    loop_.weight = Weight::One();\n    loop_.nextstate = kNoStateId;\n  }\n\n  // This doesn't copy the FST.\n  ParenMatcher(const FST *fst, MatchType match_type,\n               uint32 flags = (kParenLoop | kParenList))\n      : matcher_(fst, match_type), match_type_(match_type), flags_(flags) {\n    if (match_type == MATCH_INPUT) {\n      loop_.ilabel = kNoLabel;\n      loop_.olabel = 0;\n    } else {\n      loop_.ilabel = 0;\n      loop_.olabel = kNoLabel;\n    }\n    loop_.weight = Weight::One();\n    loop_.nextstate = kNoStateId;\n  }\n\n  // This makes a copy of the FST.\n  ParenMatcher(const ParenMatcher<FST> &matcher, bool safe = false)\n      : matcher_(matcher.matcher_, safe),\n        match_type_(matcher.match_type_),\n        flags_(matcher.flags_),\n        open_parens_(matcher.open_parens_),\n        close_parens_(matcher.close_parens_),\n        loop_(matcher.loop_) {\n    loop_.nextstate = kNoStateId;\n  }\n\n  ParenMatcher<FST> *Copy(bool safe = false) const {\n    return new ParenMatcher<FST>(*this, safe);\n  }\n\n  MatchType Type(bool test) const { return matcher_.Type(test); }\n\n  void SetState(StateId s) {\n    matcher_.SetState(s);\n    loop_.nextstate = s;\n  }\n\n  bool Find(Label match_label);\n\n  bool Done() const { return done_; }\n\n  const Arc &Value() const { return paren_loop_ ? loop_ : matcher_.Value(); }\n\n  void Next();\n\n  Weight Final(StateId s) { return matcher_.Final(s); }\n\n  ssize_t Priority(StateId s) { return matcher_.Priority(s); }\n\n  const FST &GetFst() const { return matcher_.GetFst(); }\n\n  uint64 Properties(uint64 props) const { return matcher_.Properties(props); }\n\n  uint32 Flags() const { return matcher_.Flags(); }\n\n  void AddOpenParen(Label label) {\n    if (label == 0) {\n      FSTERROR() << \"ParenMatcher: Bad open paren label: 0\";\n    } else {\n      open_parens_.Insert(label);\n    }\n  }\n\n  void AddCloseParen(Label label) {\n    if (label == 0) {\n      FSTERROR() << \"ParenMatcher: Bad close paren label: 0\";\n    } else {\n      close_parens_.Insert(label);\n    }\n  }\n\n  void RemoveOpenParen(Label label) {\n    if (label == 0) {\n      FSTERROR() << \"ParenMatcher: Bad open paren label: 0\";\n    } else {\n      open_parens_.Erase(label);\n    }\n  }\n\n  void RemoveCloseParen(Label label) {\n    if (label == 0) {\n      FSTERROR() << \"ParenMatcher: Bad close paren label: 0\";\n    } else {\n      close_parens_.Erase(label);\n    }\n  }\n\n  void ClearOpenParens() { open_parens_.Clear(); }\n\n  void ClearCloseParens() { close_parens_.Clear(); }\n\n  bool IsOpenParen(Label label) const { return open_parens_.Member(label); }\n\n  bool IsCloseParen(Label label) const { return close_parens_.Member(label); }\n\n private:\n  // Advances matcher to next open paren, returning true if it exists.\n  bool NextOpenParen();\n\n  // Advances matcher to next close paren, returning true if it exists.\n  bool NextCloseParen();\n\n  M matcher_;\n  MatchType match_type_;  // Type of match to perform.\n  uint32 flags_;\n  // Open paren label set.\n  CompactSet<Label, kNoLabel> open_parens_;\n  // Close paren label set.\n  CompactSet<Label, kNoLabel> close_parens_;\n  bool open_paren_list_;   // Matching open paren list?\n  bool close_paren_list_;  // Matching close paren list?\n  bool paren_loop_;        // Current arc is the implicit paren loop?\n  mutable Arc loop_;       // For non-consuming symbols.\n  bool done_;              // Matching done?\n\n  ParenMatcher &operator=(const ParenMatcher &) = delete;\n};\n\ntemplate <class FST>\ninline bool ParenMatcher<FST>::Find(Label match_label) {\n  open_paren_list_ = false;\n  close_paren_list_ = false;\n  paren_loop_ = false;\n  done_ = false;\n  // Returns all parenthesis arcs.\n  if (match_label == kNoLabel && (flags_ & kParenList)) {\n    if (open_parens_.LowerBound() != kNoLabel) {\n      matcher_.LowerBound(open_parens_.LowerBound());\n      open_paren_list_ = NextOpenParen();\n      if (open_paren_list_) return true;\n    }\n    if (close_parens_.LowerBound() != kNoLabel) {\n      matcher_.LowerBound(close_parens_.LowerBound());\n      close_paren_list_ = NextCloseParen();\n      if (close_paren_list_) return true;\n    }\n  }\n  // Returns the implicit paren loop.\n  if (match_label > 0 && (flags_ & kParenLoop) &&\n      (IsOpenParen(match_label) || IsCloseParen(match_label))) {\n    paren_loop_ = true;\n    return true;\n  }\n  // Returns all other labels.\n  if (matcher_.Find(match_label)) return true;\n  done_ = true;\n  return false;\n}\n\ntemplate <class FST>\ninline void ParenMatcher<FST>::Next() {\n  if (paren_loop_) {\n    paren_loop_ = false;\n    done_ = true;\n  } else if (open_paren_list_) {\n    matcher_.Next();\n    open_paren_list_ = NextOpenParen();\n    if (open_paren_list_) return;\n    if (close_parens_.LowerBound() != kNoLabel) {\n      matcher_.LowerBound(close_parens_.LowerBound());\n      close_paren_list_ = NextCloseParen();\n      if (close_paren_list_) return;\n    }\n    done_ = !matcher_.Find(kNoLabel);\n  } else if (close_paren_list_) {\n    matcher_.Next();\n    close_paren_list_ = NextCloseParen();\n    if (close_paren_list_) return;\n    done_ = !matcher_.Find(kNoLabel);\n  } else {\n    matcher_.Next();\n    done_ = matcher_.Done();\n  }\n}\n\n// Advances matcher to next open paren, returning true if it exists.\ntemplate <class FST>\ninline bool ParenMatcher<FST>::NextOpenParen() {\n  for (; !matcher_.Done(); matcher_.Next()) {\n    Label label = match_type_ == MATCH_INPUT ? matcher_.Value().ilabel\n                                             : matcher_.Value().olabel;\n    if (label > open_parens_.UpperBound()) return false;\n    if (IsOpenParen(label)) return true;\n  }\n  return false;\n}\n\n// Advances matcher to next close paren, returning true if it exists.\ntemplate <class FST>\ninline bool ParenMatcher<FST>::NextCloseParen() {\n  for (; !matcher_.Done(); matcher_.Next()) {\n    Label label = match_type_ == MATCH_INPUT ? matcher_.Value().ilabel\n                                             : matcher_.Value().olabel;\n    if (label > close_parens_.UpperBound()) return false;\n    if (IsCloseParen(label)) return true;\n  }\n  return false;\n}\n\ntemplate <class Filter>\nclass ParenFilter {\n public:\n  using FST1 = typename Filter::FST1;\n  using FST2 = typename Filter::FST2;\n  using Arc = typename Filter::Arc;\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using Matcher1 = typename Filter::Matcher1;\n  using Matcher2 = typename Filter::Matcher2;\n\n  using StackId = StateId;\n  using ParenStack = PdtStack<StackId, Label>;\n  using FilterState1 = typename Filter::FilterState;\n  using FilterState2 = IntegerFilterState<StackId>;\n  using FilterState = PairFilterState<FilterState1, FilterState2>;\n\n  ParenFilter(const FST1 &fst1, const FST2 &fst2, Matcher1 *matcher1 = nullptr,\n              Matcher2 *matcher2 = nullptr,\n              const std::vector<std::pair<Label, Label>> *parens = nullptr,\n              bool expand = false, bool keep_parens = true)\n      : filter_(fst1, fst2, matcher1, matcher2),\n        parens_(parens ? *parens : std::vector<std::pair<Label, Label>>()),\n        expand_(expand),\n        keep_parens_(keep_parens),\n        fs_(FilterState::NoState()),\n        stack_(parens_),\n        paren_id_(-1) {\n    if (parens) {\n      for (const auto &pair : *parens) {\n        parens_.push_back(pair);\n        GetMatcher1()->AddOpenParen(pair.first);\n        GetMatcher2()->AddOpenParen(pair.first);\n        if (!expand_) {\n          GetMatcher1()->AddCloseParen(pair.second);\n          GetMatcher2()->AddCloseParen(pair.second);\n        }\n      }\n    }\n  }\n\n  ParenFilter(const ParenFilter &filter, bool safe = false)\n      : filter_(filter.filter_, safe),\n        parens_(filter.parens_),\n        expand_(filter.expand_),\n        keep_parens_(filter.keep_parens_),\n        fs_(FilterState::NoState()),\n        stack_(filter.parens_),\n        paren_id_(-1) {}\n\n  FilterState Start() const {\n    return FilterState(filter_.Start(), FilterState2(0));\n  }\n\n  void SetState(StateId s1, StateId s2, const FilterState &fs) {\n    fs_ = fs;\n    filter_.SetState(s1, s2, fs_.GetState1());\n    if (!expand_) return;\n    ssize_t paren_id = stack_.Top(fs.GetState2().GetState());\n    if (paren_id != paren_id_) {\n      if (paren_id_ != -1) {\n        GetMatcher1()->RemoveCloseParen(parens_[paren_id_].second);\n        GetMatcher2()->RemoveCloseParen(parens_[paren_id_].second);\n      }\n      paren_id_ = paren_id;\n      if (paren_id_ != -1) {\n        GetMatcher1()->AddCloseParen(parens_[paren_id_].second);\n        GetMatcher2()->AddCloseParen(parens_[paren_id_].second);\n      }\n    }\n  }\n\n  FilterState FilterArc(Arc *arc1, Arc *arc2) const {\n    const auto fs1 = filter_.FilterArc(arc1, arc2);\n    const auto &fs2 = fs_.GetState2();\n    if (fs1 == FilterState1::NoState()) return FilterState::NoState();\n    if (arc1->olabel == kNoLabel && arc2->ilabel) {  // arc2 parentheses.\n      if (keep_parens_) {\n        arc1->ilabel = arc2->ilabel;\n      } else if (arc2->ilabel) {\n        arc2->olabel = arc1->ilabel;\n      }\n      return FilterParen(arc2->ilabel, fs1, fs2);\n    } else if (arc2->ilabel == kNoLabel && arc1->olabel) {  // arc1 parentheses.\n      if (keep_parens_) {\n        arc2->olabel = arc1->olabel;\n      } else {\n        arc1->ilabel = arc2->olabel;\n      }\n      return FilterParen(arc1->olabel, fs1, fs2);\n    } else {\n      return FilterState(fs1, fs2);\n    }\n  }\n\n  void FilterFinal(Weight *w1, Weight *w2) const {\n    if (fs_.GetState2().GetState() != 0) *w1 = Weight::Zero();\n    filter_.FilterFinal(w1, w2);\n  }\n\n  // Returns respective matchers; ownership stays with filter.\n\n  Matcher1 *GetMatcher1() { return filter_.GetMatcher1(); }\n\n  Matcher2 *GetMatcher2() { return filter_.GetMatcher2(); }\n\n  uint64 Properties(uint64 iprops) const {\n    return filter_.Properties(iprops) & kILabelInvariantProperties &\n           kOLabelInvariantProperties;\n  }\n\n private:\n  const FilterState FilterParen(Label label, const FilterState1 &fs1,\n                                const FilterState2 &fs2) const {\n    if (!expand_) return FilterState(fs1, fs2);\n    const auto stack_id = stack_.Find(fs2.GetState(), label);\n    if (stack_id < 0) {\n      return FilterState::NoState();\n    } else {\n      return FilterState(fs1, FilterState2(stack_id));\n    }\n  }\n\n  Filter filter_;\n  std::vector<std::pair<Label, Label>> parens_;\n  bool expand_;       // Expands to FST?\n  bool keep_parens_;  // Retains parentheses in output?\n  FilterState fs_;    // Current filter state.\n  mutable ParenStack stack_;\n  ssize_t paren_id_;\n};\n\n// Class to setup composition options for PDT composition. Default is to take\n// the PDT as the first composition argument.\ntemplate <class Arc, bool left_pdt = true>\nclass PdtComposeFstOptions\n    : public ComposeFstOptions<\n          Arc, ParenMatcher<Fst<Arc>>,\n          ParenFilter<AltSequenceComposeFilter<ParenMatcher<Fst<Arc>>>>> {\n public:\n  using Label = typename Arc::Label;\n  using PdtMatcher = ParenMatcher<Fst<Arc>>;\n  using PdtFilter = ParenFilter<AltSequenceComposeFilter<PdtMatcher>>;\n\n  using ComposeFstOptions<Arc, PdtMatcher, PdtFilter>::matcher1;\n  using ComposeFstOptions<Arc, PdtMatcher, PdtFilter>::matcher2;\n  using ComposeFstOptions<Arc, PdtMatcher, PdtFilter>::filter;\n\n  PdtComposeFstOptions(const Fst<Arc> &ifst1,\n                       const std::vector<std::pair<Label, Label>> &parens,\n                       const Fst<Arc> &ifst2, bool expand = false,\n                       bool keep_parens = true) {\n    matcher1 = new PdtMatcher(ifst1, MATCH_OUTPUT, kParenList);\n    matcher2 = new PdtMatcher(ifst2, MATCH_INPUT, kParenLoop);\n    filter = new PdtFilter(ifst1, ifst2, matcher1, matcher2, &parens, expand,\n                           keep_parens);\n  }\n};\n\n// Class to setup composition options for PDT with FST composition.\n// Specialization is for the FST as the first composition argument.\ntemplate <class Arc>\nclass PdtComposeFstOptions<Arc, false>\n    : public ComposeFstOptions<\n          Arc, ParenMatcher<Fst<Arc>>,\n          ParenFilter<SequenceComposeFilter<ParenMatcher<Fst<Arc>>>>> {\n public:\n  using Label = typename Arc::Label;\n  using PdtMatcher = ParenMatcher<Fst<Arc>>;\n  using PdtFilter = ParenFilter<SequenceComposeFilter<PdtMatcher>>;\n\n  using ComposeFstOptions<Arc, PdtMatcher, PdtFilter>::matcher1;\n  using ComposeFstOptions<Arc, PdtMatcher, PdtFilter>::matcher2;\n  using ComposeFstOptions<Arc, PdtMatcher, PdtFilter>::filter;\n\n  PdtComposeFstOptions(const Fst<Arc> &ifst1, const Fst<Arc> &ifst2,\n                       const std::vector<std::pair<Label, Label>> &parens,\n                       bool expand = false, bool keep_parens = true) {\n    matcher1 = new PdtMatcher(ifst1, MATCH_OUTPUT, kParenLoop);\n    matcher2 = new PdtMatcher(ifst2, MATCH_INPUT, kParenList);\n    filter = new PdtFilter(ifst1, ifst2, matcher1, matcher2, &parens, expand,\n                           keep_parens);\n  }\n};\n\nenum PdtComposeFilter {\n  PAREN_FILTER,         // Bar-Hillel construction; keeps parentheses.\n  EXPAND_FILTER,        // Bar-Hillel + expansion; removes parentheses.\n  EXPAND_PAREN_FILTER,  // Bar-Hillel + expansion; keeps parentheses.\n};\n\nstruct PdtComposeOptions {\n  bool connect;                  // Connect output?\n  PdtComposeFilter filter_type;  // Pre-defined filter to use.\n\n  explicit PdtComposeOptions(bool connect = true,\n                             PdtComposeFilter filter_type = PAREN_FILTER)\n      : connect(connect), filter_type(filter_type) {}\n};\n\n// Composes pushdown transducer (PDT) encoded as an FST (1st arg) and an FST\n// (2nd arg) with the result also a PDT encoded as an FST (3rd arg). In the\n// PDTs, some transitions are labeled with open or close parentheses. To be\n// interpreted as a PDT, the parens must balance on a path (see PdtExpand()).\n// The open-close parenthesis label pairs are passed using the parens argument.\ntemplate <class Arc>\nvoid Compose(const Fst<Arc> &ifst1,\n             const std::vector<\n                 std::pair<typename Arc::Label, typename Arc::Label>> &parens,\n             const Fst<Arc> &ifst2, MutableFst<Arc> *ofst,\n             const PdtComposeOptions &opts = PdtComposeOptions()) {\n  bool expand = opts.filter_type != PAREN_FILTER;\n  bool keep_parens = opts.filter_type != EXPAND_FILTER;\n  PdtComposeFstOptions<Arc, true> copts(ifst1, parens, ifst2, expand,\n                                        keep_parens);\n  copts.gc_limit = 0;\n  *ofst = ComposeFst<Arc>(ifst1, ifst2, copts);\n  if (opts.connect) Connect(ofst);\n}\n\n// Composes an FST (1st arg) and pushdown transducer (PDT) encoded as an FST\n// (2nd arg) with the result also a PDT encoded as an FST (3rd arg). In the\n// PDTs, some transitions are labeled with open or close parentheses. To be\n// interpreted as a PDT, the parens must balance on a path (see ExpandFst()).\n// The open-close parenthesis label pairs are passed using the parens argument.\ntemplate <class Arc>\nvoid Compose(const Fst<Arc> &ifst1, const Fst<Arc> &ifst2,\n             const std::vector<\n                 std::pair<typename Arc::Label, typename Arc::Label>> &parens,\n             MutableFst<Arc> *ofst,\n             const PdtComposeOptions &opts = PdtComposeOptions()) {\n  bool expand = opts.filter_type != PAREN_FILTER;\n  bool keep_parens = opts.filter_type != EXPAND_FILTER;\n  PdtComposeFstOptions<Arc, false> copts(ifst1, ifst2, parens, expand,\n                                         keep_parens);\n  copts.gc_limit = 0;\n  *ofst = ComposeFst<Arc>(ifst1, ifst2, copts);\n  if (opts.connect) Connect(ofst);\n}\n\n}  // namespace fst\n\n#endif  // FST_EXTENSIONS_PDT_COMPOSE_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/extensions/pdt/expand.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Expands a PDT to an FST.\n\n#ifndef FST_EXTENSIONS_PDT_EXPAND_H_\n#define FST_EXTENSIONS_PDT_EXPAND_H_\n\n#include <forward_list>\n#include <vector>\n\n#include <fst/log.h>\n\n#include <fst/extensions/pdt/paren.h>\n#include <fst/extensions/pdt/pdt.h>\n#include <fst/extensions/pdt/reverse.h>\n#include <fst/extensions/pdt/shortest-path.h>\n#include <fst/cache.h>\n#include <fst/mutable-fst.h>\n#include <fst/queue.h>\n#include <fst/state-table.h>\n#include <fst/test-properties.h>\n\nnamespace fst {\n\ntemplate <class Arc>\nstruct PdtExpandFstOptions : public CacheOptions {\n  bool keep_parentheses;\n  PdtStack<typename Arc::StateId, typename Arc::Label> *stack;\n  PdtStateTable<typename Arc::StateId, typename Arc::StateId> *state_table;\n\n  explicit PdtExpandFstOptions(\n      const CacheOptions &opts = CacheOptions(), bool keep_parentheses = false,\n      PdtStack<typename Arc::StateId, typename Arc::Label> *stack = nullptr,\n      PdtStateTable<typename Arc::StateId, typename Arc::StateId> *state_table =\n          nullptr)\n      : CacheOptions(opts),\n        keep_parentheses(keep_parentheses),\n        stack(stack),\n        state_table(state_table) {}\n};\n\nnamespace internal {\n\n// Implementation class for PdtExpandFst.\ntemplate <class Arc>\nclass PdtExpandFstImpl : public CacheImpl<Arc> {\n public:\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using StackId = StateId;\n  using StateTuple = PdtStateTuple<StateId, StackId>;\n\n  using FstImpl<Arc>::SetType;\n  using FstImpl<Arc>::SetProperties;\n  using FstImpl<Arc>::Properties;\n  using FstImpl<Arc>::SetInputSymbols;\n  using FstImpl<Arc>::SetOutputSymbols;\n\n  using CacheBaseImpl<CacheState<Arc>>::PushArc;\n  using CacheBaseImpl<CacheState<Arc>>::HasArcs;\n  using CacheBaseImpl<CacheState<Arc>>::HasFinal;\n  using CacheBaseImpl<CacheState<Arc>>::HasStart;\n  using CacheBaseImpl<CacheState<Arc>>::SetArcs;\n  using CacheBaseImpl<CacheState<Arc>>::SetFinal;\n  using CacheBaseImpl<CacheState<Arc>>::SetStart;\n\n  PdtExpandFstImpl(const Fst<Arc> &fst,\n                   const std::vector<std::pair<Label, Label>> &parens,\n                   const PdtExpandFstOptions<Arc> &opts)\n      : CacheImpl<Arc>(opts),\n        fst_(fst.Copy()),\n        stack_(opts.stack ? opts.stack : new PdtStack<StateId, Label>(parens)),\n        state_table_(opts.state_table ? opts.state_table\n                                      : new PdtStateTable<StateId, StackId>()),\n        own_stack_(opts.stack == 0),\n        own_state_table_(opts.state_table == 0),\n        keep_parentheses_(opts.keep_parentheses) {\n    SetType(\"expand\");\n    const auto props = fst.Properties(kFstProperties, false);\n    SetProperties(PdtExpandProperties(props), kCopyProperties);\n    SetInputSymbols(fst.InputSymbols());\n    SetOutputSymbols(fst.OutputSymbols());\n  }\n\n  PdtExpandFstImpl(const PdtExpandFstImpl &impl)\n      : CacheImpl<Arc>(impl),\n        fst_(impl.fst_->Copy(true)),\n        stack_(new PdtStack<StateId, Label>(*impl.stack_)),\n        state_table_(new PdtStateTable<StateId, StackId>()),\n        own_stack_(true),\n        own_state_table_(true),\n        keep_parentheses_(impl.keep_parentheses_) {\n    SetType(\"expand\");\n    SetProperties(impl.Properties(), kCopyProperties);\n    SetInputSymbols(impl.InputSymbols());\n    SetOutputSymbols(impl.OutputSymbols());\n  }\n\n  ~PdtExpandFstImpl() override {\n    if (own_stack_) delete stack_;\n    if (own_state_table_) delete state_table_;\n  }\n\n  StateId Start() {\n    if (!HasStart()) {\n      const auto s = fst_->Start();\n      if (s == kNoStateId) return kNoStateId;\n      StateTuple tuple(s, 0);\n      const auto start = state_table_->FindState(tuple);\n      SetStart(start);\n    }\n    return CacheImpl<Arc>::Start();\n  }\n\n  Weight Final(StateId s) {\n    if (!HasFinal(s)) {\n      const auto &tuple = state_table_->Tuple(s);\n      const auto weight = fst_->Final(tuple.state_id);\n      if (weight != Weight::Zero() && tuple.stack_id == 0)\n        SetFinal(s, weight);\n      else\n        SetFinal(s, Weight::Zero());\n    }\n    return CacheImpl<Arc>::Final(s);\n  }\n\n  size_t NumArcs(StateId s) {\n    if (!HasArcs(s)) ExpandState(s);\n    return CacheImpl<Arc>::NumArcs(s);\n  }\n\n  size_t NumInputEpsilons(StateId s) {\n    if (!HasArcs(s)) ExpandState(s);\n    return CacheImpl<Arc>::NumInputEpsilons(s);\n  }\n\n  size_t NumOutputEpsilons(StateId s) {\n    if (!HasArcs(s)) ExpandState(s);\n    return CacheImpl<Arc>::NumOutputEpsilons(s);\n  }\n\n  void InitArcIterator(StateId s, ArcIteratorData<Arc> *data) {\n    if (!HasArcs(s)) ExpandState(s);\n    CacheImpl<Arc>::InitArcIterator(s, data);\n  }\n\n  // Computes the outgoing transitions from a state, creating new destination\n  // states as needed.\n  void ExpandState(StateId s) {\n    StateTuple tuple = state_table_->Tuple(s);\n    for (ArcIterator<Fst<Arc>> aiter(*fst_, tuple.state_id); !aiter.Done();\n         aiter.Next()) {\n      auto arc = aiter.Value();\n      const auto stack_id = stack_->Find(tuple.stack_id, arc.ilabel);\n      if (stack_id == -1) {  // Non-matching close parenthesis.\n        continue;\n      } else if ((stack_id != tuple.stack_id) && !keep_parentheses_) {\n        // Stack push/pop.\n        arc.ilabel = 0;\n        arc.olabel = 0;\n      }\n      StateTuple ntuple(arc.nextstate, stack_id);\n      arc.nextstate = state_table_->FindState(ntuple);\n      PushArc(s, arc);\n    }\n    SetArcs(s);\n  }\n\n  const PdtStack<StackId, Label> &GetStack() const { return *stack_; }\n\n  const PdtStateTable<StateId, StackId> &GetStateTable() const {\n    return *state_table_;\n  }\n\n private:\n  // Properties for an expanded PDT.\n  inline uint64 PdtExpandProperties(uint64 inprops) {\n    return inprops & (kAcceptor | kAcyclic | kInitialAcyclic | kUnweighted);\n  }\n\n  std::unique_ptr<const Fst<Arc>> fst_;\n  PdtStack<StackId, Label> *stack_;\n  PdtStateTable<StateId, StackId> *state_table_;\n  bool own_stack_;\n  bool own_state_table_;\n  bool keep_parentheses_;\n};\n\n}  // namespace internal\n\n// Expands a pushdown transducer (PDT) encoded as an FST into an FST. This\n// version is a delayed FST. In the PDT, some transitions are labeled with open\n// or close parentheses. To be interpreted as a PDT, the parens must balance on\n// a path. The open-close parenthesis label pairs are passed using the parens\n// argument. The expansion enforces the parenthesis constraints. The PDT must be\n// expandable as an FST.\n//\n// This class attaches interface to implementation and handles reference\n// counting, delegating most methods to ImplToFst.\ntemplate <class A>\nclass PdtExpandFst : public ImplToFst<internal::PdtExpandFstImpl<A>> {\n public:\n  using Arc = A;\n\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using StackId = StateId;\n  using Store = DefaultCacheStore<Arc>;\n  using State = typename Store::State;\n  using Impl = internal::PdtExpandFstImpl<Arc>;\n\n  friend class ArcIterator<PdtExpandFst<Arc>>;\n  friend class StateIterator<PdtExpandFst<Arc>>;\n\n  PdtExpandFst(const Fst<Arc> &fst,\n               const std::vector<std::pair<Label, Label>> &parens)\n      : ImplToFst<Impl>(\n            std::make_shared<Impl>(fst, parens, PdtExpandFstOptions<A>())) {}\n\n  PdtExpandFst(const Fst<Arc> &fst,\n               const std::vector<std::pair<Label, Label>> &parens,\n               const PdtExpandFstOptions<Arc> &opts)\n      : ImplToFst<Impl>(std::make_shared<Impl>(fst, parens, opts)) {}\n\n  // See Fst<>::Copy() for doc.\n  PdtExpandFst(const PdtExpandFst<Arc> &fst, bool safe = false)\n      : ImplToFst<Impl>(fst, safe) {}\n\n  // Gets a copy of this ExpandFst. See Fst<>::Copy() for further doc.\n  PdtExpandFst<Arc> *Copy(bool safe = false) const override {\n    return new PdtExpandFst<Arc>(*this, safe);\n  }\n\n  inline void InitStateIterator(StateIteratorData<Arc> *data) const override;\n\n  void InitArcIterator(StateId s, ArcIteratorData<Arc> *data) const override {\n    GetMutableImpl()->InitArcIterator(s, data);\n  }\n\n  const PdtStack<StackId, Label> &GetStack() const {\n    return GetImpl()->GetStack();\n  }\n\n  const PdtStateTable<StateId, StackId> &GetStateTable() const {\n    return GetImpl()->GetStateTable();\n  }\n\n private:\n  using ImplToFst<Impl>::GetImpl;\n  using ImplToFst<Impl>::GetMutableImpl;\n\n  void operator=(const PdtExpandFst &) = delete;\n};\n\n// Specialization for PdtExpandFst.\ntemplate <class Arc>\nclass StateIterator<PdtExpandFst<Arc>>\n    : public CacheStateIterator<PdtExpandFst<Arc>> {\n public:\n  explicit StateIterator(const PdtExpandFst<Arc> &fst)\n      : CacheStateIterator<PdtExpandFst<Arc>>(fst, fst.GetMutableImpl()) {}\n};\n\n// Specialization for PdtExpandFst.\ntemplate <class Arc>\nclass ArcIterator<PdtExpandFst<Arc>>\n    : public CacheArcIterator<PdtExpandFst<Arc>> {\n public:\n  using StateId = typename Arc::StateId;\n\n  ArcIterator(const PdtExpandFst<Arc> &fst, StateId s)\n      : CacheArcIterator<PdtExpandFst<Arc>>(fst.GetMutableImpl(), s) {\n    if (!fst.GetImpl()->HasArcs(s)) fst.GetMutableImpl()->ExpandState(s);\n  }\n};\n\ntemplate <class Arc>\ninline void PdtExpandFst<Arc>::InitStateIterator(\n    StateIteratorData<Arc> *data) const {\n  data->base = new StateIterator<PdtExpandFst<Arc>>(*this);\n}\n\n// PrunedExpand prunes the delayed expansion of a pushdown transducer (PDT)\n// encoded as an FST into an FST. In the PDT, some transitions are labeled with\n// open or close parentheses. To be interpreted as a PDT, the parens must\n// balance on a path. The open-close parenthesis label pairs are passed\n// using the parens argument. The expansion enforces the parenthesis\n// constraints.\n//\n// The algorithm works by visiting the delayed ExpandFst using a shortest-stack\n// first queue discipline and relies on the shortest-distance information\n// computed using a reverse shortest-path call to perform the pruning.\n//\n// The algorithm maintains the same state ordering between the ExpandFst being\n// visited (efst_) and the result of pruning written into the MutableFst (ofst_)\n// to improve readability.\ntemplate <class Arc>\nclass PdtPrunedExpand {\n public:\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using StackId = StateId;\n  using Stack = PdtStack<StackId, Label>;\n  using StateTable = PdtStateTable<StateId, StackId>;\n  using SetIterator = typename internal::PdtBalanceData<Arc>::SetIterator;\n\n  // Constructor taking as input a PDT specified by by an input FST and a vector\n  // of parentheses. The keep_parentheses argument specifies whether parentheses\n  // are replaced by epsilons or not during the expansion. The cache options are\n  // passed to the underlying ExpandFst.\n  PdtPrunedExpand(const Fst<Arc> &ifst,\n                  const std::vector<std::pair<Label, Label>> &parens,\n                  bool keep_parentheses = false,\n                  const CacheOptions &opts = CacheOptions())\n      : ifst_(ifst.Copy()),\n        keep_parentheses_(keep_parentheses),\n        stack_(parens),\n        efst_(ifst, parens,\n              PdtExpandFstOptions<Arc>(opts, true, &stack_, &state_table_)),\n        queue_(state_table_, stack_, stack_length_, distance_, fdistance_),\n        error_(false) {\n    Reverse(*ifst_, parens, &rfst_);\n    VectorFst<Arc> path;\n    reverse_shortest_path_.reset(new PdtShortestPath<Arc, FifoQueue<StateId>>(\n        rfst_, parens,\n        PdtShortestPathOptions<Arc, FifoQueue<StateId>>(true, false)));\n    reverse_shortest_path_->ShortestPath(&path);\n    error_ = (path.Properties(kError, true) == kError);\n    balance_data_.reset(reverse_shortest_path_->GetBalanceData()->Reverse(\n        rfst_.NumStates(), 10, -1));\n    InitCloseParenMultimap(parens);\n  }\n\n  bool Error() const { return error_; }\n\n  // Expands and prunes the input PDT according to the provided weight\n  // threshold, wirting the result into an output mutable FST.\n  void Expand(MutableFst<Arc> *ofst, const Weight &threshold);\n\n private:\n  static constexpr uint8 kEnqueued = 0x01;\n  static constexpr uint8 kExpanded = 0x02;\n  static constexpr uint8 kSourceState = 0x04;\n\n  // Comparison functor used by the queue:\n  //\n  // 1. States corresponding to shortest stack first, and\n  // 2. for stacks of matching length, reverse lexicographic order is used, and\n  // 3. for states with the same stack, shortest-first order is used.\n  class StackCompare {\n   public:\n    StackCompare(const StateTable &state_table, const Stack &stack,\n                 const std::vector<StackId> &stack_length,\n                 const std::vector<Weight> &distance,\n                 const std::vector<Weight> &fdistance)\n        : state_table_(state_table),\n          stack_(stack),\n          stack_length_(stack_length),\n          distance_(distance),\n          fdistance_(fdistance) {}\n\n    bool operator()(StateId s1, StateId s2) const {\n      auto si1 = state_table_.Tuple(s1).stack_id;\n      auto si2 = state_table_.Tuple(s2).stack_id;\n      if (stack_length_[si1] < stack_length_[si2]) return true;\n      if (stack_length_[si1] > stack_length_[si2]) return false;\n      // If stack IDs are equal, use A*.\n      if (si1 == si2) {\n        return less_(Distance(s1), Distance(s2));\n      }\n      // If lengths are equal, uses reverse lexicographic order.\n      for (; si1 != si2; si1 = stack_.Pop(si1), si2 = stack_.Pop(si2)) {\n        if (stack_.Top(si1) < stack_.Top(si2)) return true;\n        if (stack_.Top(si1) > stack_.Top(si2)) return false;\n      }\n      return false;\n    }\n\n   private:\n    Weight Distance(StateId s) const {\n      return (s < distance_.size()) && (s < fdistance_.size())\n                 ? Times(distance_[s], fdistance_[s])\n                 : Weight::Zero();\n    }\n\n    const StateTable &state_table_;\n    const Stack &stack_;\n    const std::vector<StackId> &stack_length_;\n    const std::vector<Weight> &distance_;\n    const std::vector<Weight> &fdistance_;\n    const NaturalLess<Weight> less_;\n  };\n\n  class ShortestStackFirstQueue\n      : public ShortestFirstQueue<StateId, StackCompare> {\n   public:\n    ShortestStackFirstQueue(const PdtStateTable<StateId, StackId> &state_table,\n                            const Stack &stack,\n                            const std::vector<StackId> &stack_length,\n                            const std::vector<Weight> &distance,\n                            const std::vector<Weight> &fdistance)\n        : ShortestFirstQueue<StateId, StackCompare>(StackCompare(\n              state_table, stack, stack_length, distance, fdistance)) {}\n  };\n\n  void InitCloseParenMultimap(\n      const std::vector<std::pair<Label, Label>> &parens);\n\n  Weight DistanceToDest(StateId source, StateId dest) const;\n\n  uint8 Flags(StateId s) const;\n\n  void SetFlags(StateId s, uint8 flags, uint8 mask);\n\n  Weight Distance(StateId s) const;\n\n  void SetDistance(StateId s, Weight weight);\n\n  Weight FinalDistance(StateId s) const;\n\n  void SetFinalDistance(StateId s, Weight weight);\n\n  StateId SourceState(StateId s) const;\n\n  void SetSourceState(StateId s, StateId p);\n\n  void AddStateAndEnqueue(StateId s);\n\n  void Relax(StateId s, const Arc &arc, Weight weight);\n\n  bool PruneArc(StateId s, const Arc &arc);\n\n  void ProcStart();\n\n  void ProcFinal(StateId s);\n\n  bool ProcNonParen(StateId s, const Arc &arc, bool add_arc);\n\n  bool ProcOpenParen(StateId s, const Arc &arc, StackId si, StackId nsi);\n\n  bool ProcCloseParen(StateId s, const Arc &arc);\n\n  void ProcDestStates(StateId s, StackId si);\n\n  // Input PDT.\n  std::unique_ptr<Fst<Arc>> ifst_;\n  // Reversed PDT.\n  VectorFst<Arc> rfst_;\n  // Keep parentheses in ofst?\n  const bool keep_parentheses_;\n  // State table for efst_.\n  StateTable state_table_;\n  // Stack trie.\n  Stack stack_;\n  // Expanded PDT.\n  PdtExpandFst<Arc> efst_;\n  // Length of stack for given stack ID.\n  std::vector<StackId> stack_length_;\n  // Distance from initial state in efst_/ofst.\n  std::vector<Weight> distance_;\n  // Distance to final states in efst_/ofst.\n  std::vector<Weight> fdistance_;\n  // Queue used to visit efst_.\n  ShortestStackFirstQueue queue_;\n  // Construction time failure?\n  bool error_;\n  // Status flags for states in efst_/ofst.\n  std::vector<uint8> flags_;\n  // PDT source state for each expanded state.\n  std::vector<StateId> sources_;\n  // Shortest path for rfst_.\n  std::unique_ptr<PdtShortestPath<Arc, FifoQueue<StateId>>>\n      reverse_shortest_path_;\n  std::unique_ptr<internal::PdtBalanceData<Arc>> balance_data_;\n  // Maps open paren arcs to balancing close paren arcs.\n  typename PdtShortestPath<Arc, FifoQueue<StateId>>::CloseParenMultimap\n      close_paren_multimap_;\n  MutableFst<Arc> *ofst_;  // Output FST.\n  Weight limit_;           // Weight limit.\n\n  // Maps a state s in ifst (i.e., the source of a closed paranthesis matching\n  // the top of current_stack_id_ to final states in efst_.\n  std::unordered_map<StateId, Weight> dest_map_;\n  // Stack ID of the states currently at the top of the queue, i.e., the states\n  // currently being popped and processed.\n  StackId current_stack_id_;\n  ssize_t current_paren_id_;  // Paren ID at top of current stack.\n  ssize_t cached_stack_id_;\n  StateId cached_source_;\n  // The set of pairs of destination states and weights to final states for the\n  // source state cached_source_ and the paren ID cached_paren_id_; i.e., the\n  // set of source states of a closed parenthesis with paren ID cached_paren_id\n  // balancing an incoming open parenthesis with paren ID cached_paren_id_ in\n  // state cached_source_.\n  std::forward_list<std::pair<StateId, Weight>> cached_dest_list_;\n  NaturalLess<Weight> less_;\n};\n\n// Initializes close paren multimap, mapping pairs (s, paren_id) to all the arcs\n// out of s labeled with close parenthese for paren_id.\ntemplate <class Arc>\nvoid PdtPrunedExpand<Arc>::InitCloseParenMultimap(\n    const std::vector<std::pair<Label, Label>> &parens) {\n  std::unordered_map<Label, Label> paren_map;\n  for (size_t i = 0; i < parens.size(); ++i) {\n    const auto &pair = parens[i];\n    paren_map[pair.first] = i;\n    paren_map[pair.second] = i;\n  }\n  for (StateIterator<Fst<Arc>> siter(*ifst_); !siter.Done(); siter.Next()) {\n    const auto s = siter.Value();\n    for (ArcIterator<Fst<Arc>> aiter(*ifst_, s); !aiter.Done(); aiter.Next()) {\n      const auto &arc = aiter.Value();\n      const auto it = paren_map.find(arc.ilabel);\n      if (it == paren_map.end()) continue;\n      if (arc.ilabel == parens[it->second].second) {  // Close paren.\n        const internal::ParenState<Arc> key(it->second, s);\n        close_paren_multimap_.emplace(key, arc);\n      }\n    }\n  }\n}\n\n// Returns the weight of the shortest balanced path from source to dest\n// in ifst_; dest must be the source state of a close paren arc.\ntemplate <class Arc>\ntypename Arc::Weight PdtPrunedExpand<Arc>::DistanceToDest(StateId source,\n                                                          StateId dest) const {\n  using SearchState =\n      typename PdtShortestPath<Arc, FifoQueue<StateId>>::SearchState;\n  const SearchState ss(source + 1, dest + 1);\n  const auto distance =\n      reverse_shortest_path_->GetShortestPathData().Distance(ss);\n  VLOG(2) << \"D(\" << source << \", \" << dest << \") =\" << distance;\n  return distance;\n}\n\n// Returns the flags for state s in ofst_.\ntemplate <class Arc>\nuint8 PdtPrunedExpand<Arc>::Flags(StateId s) const {\n  return s < flags_.size() ? flags_[s] : 0;\n}\n\n// Modifies the flags for state s in ofst_.\ntemplate <class Arc>\nvoid PdtPrunedExpand<Arc>::SetFlags(StateId s, uint8 flags, uint8 mask) {\n  while (flags_.size() <= s) flags_.push_back(0);\n  flags_[s] &= ~mask;\n  flags_[s] |= flags & mask;\n}\n\n// Returns the shortest distance from the initial state to s in ofst_.\ntemplate <class Arc>\ntypename Arc::Weight PdtPrunedExpand<Arc>::Distance(StateId s) const {\n  return s < distance_.size() ? distance_[s] : Weight::Zero();\n}\n\n// Sets the shortest distance from the initial state to s in ofst_.\ntemplate <class Arc>\nvoid PdtPrunedExpand<Arc>::SetDistance(StateId s, Weight weight) {\n  while (distance_.size() <= s) distance_.push_back(Weight::Zero());\n  distance_[s] = std::move(weight);\n}\n\n// Returns the shortest distance from s to the final states in ofst_.\ntemplate <class Arc>\ntypename Arc::Weight PdtPrunedExpand<Arc>::FinalDistance(StateId s) const {\n  return s < fdistance_.size() ? fdistance_[s] : Weight::Zero();\n}\n\n// Sets the shortest distance from s to the final states in ofst_.\ntemplate <class Arc>\nvoid PdtPrunedExpand<Arc>::SetFinalDistance(StateId s, Weight weight) {\n  while (fdistance_.size() <= s) fdistance_.push_back(Weight::Zero());\n  fdistance_[s] = std::move(weight);\n}\n\n// Returns the PDT source state of state s in ofst_.\ntemplate <class Arc>\ntypename Arc::StateId PdtPrunedExpand<Arc>::SourceState(StateId s) const {\n  return s < sources_.size() ? sources_[s] : kNoStateId;\n}\n\n// Sets the PDT source state of state s in ofst_ to state p'in ifst_.\ntemplate <class Arc>\nvoid PdtPrunedExpand<Arc>::SetSourceState(StateId s, StateId p) {\n  while (sources_.size() <= s) sources_.push_back(kNoStateId);\n  sources_[s] = p;\n}\n\n// Adds state s of efst_ to ofst_ and inserts it in the queue, modifying the\n// flags for s accordingly.\ntemplate <class Arc>\nvoid PdtPrunedExpand<Arc>::AddStateAndEnqueue(StateId s) {\n  if (!(Flags(s) & (kEnqueued | kExpanded))) {\n    while (ofst_->NumStates() <= s) ofst_->AddState();\n    queue_.Enqueue(s);\n    SetFlags(s, kEnqueued, kEnqueued);\n  } else if (Flags(s) & kEnqueued) {\n    queue_.Update(s);\n  }\n  // TODO(allauzen): Check everything is fine when kExpanded?\n}\n\n// Relaxes arc out of state s in ofst_ as follows:\n//\n// 1. If the distance to s times the weight of arc is smaller than\n//   the currently stored distance for arc.nextstate, updates\n//   Distance(arc.nextstate) with a new estimate\n// 2. If fd is less than the currently stored distance from arc.nextstate to the\n// final state, updates with new estimate.\ntemplate <class Arc>\nvoid PdtPrunedExpand<Arc>::Relax(StateId s, const Arc &arc, Weight fd) {\n  const auto nd = Times(Distance(s), arc.weight);\n  if (less_(nd, Distance(arc.nextstate))) {\n    SetDistance(arc.nextstate, nd);\n    SetSourceState(arc.nextstate, SourceState(s));\n  }\n  if (less_(fd, FinalDistance(arc.nextstate))) {\n    SetFinalDistance(arc.nextstate, fd);\n  }\n  VLOG(2) << \"Relax: \" << s << \", d[s] = \" << Distance(s) << \", to \"\n          << arc.nextstate << \", d[ns] = \" << Distance(arc.nextstate)\n          << \", nd = \" << nd;\n}\n\n// Returns whether the arc out of state s in efst needs pruned.\ntemplate <class Arc>\nbool PdtPrunedExpand<Arc>::PruneArc(StateId s, const Arc &arc) {\n  VLOG(2) << \"Prune ?\";\n  auto fd = Weight::Zero();\n  if ((cached_source_ != SourceState(s)) ||\n      (cached_stack_id_ != current_stack_id_)) {\n    cached_source_ = SourceState(s);\n    cached_stack_id_ = current_stack_id_;\n    cached_dest_list_.clear();\n    if (cached_source_ != ifst_->Start()) {\n      for (auto set_iter =\n               balance_data_->Find(current_paren_id_, cached_source_);\n           !set_iter.Done(); set_iter.Next()) {\n        auto dest = set_iter.Element();\n        const auto it = dest_map_.find(dest);\n        cached_dest_list_.push_front(*it);\n      }\n    } else {\n      // TODO(allauzen): queue discipline should prevent this from ever\n      // happening.\n      // Replace by a check.\n      cached_dest_list_.push_front(\n          std::make_pair(rfst_.Start() - 1, Weight::One()));\n    }\n  }\n  for (auto it = cached_dest_list_.begin(); it != cached_dest_list_.end();\n       ++it) {\n    const auto d =\n        DistanceToDest(state_table_.Tuple(arc.nextstate).state_id, it->first);\n    fd = Plus(fd, Times(d, it->second));\n  }\n  Relax(s, arc, fd);\n  return less_(limit_, Times(Distance(s), Times(arc.weight, fd)));\n}\n\n// Adds start state of efst_ to ofst_, enqueues it, and initializes the distance\n// data structures.\ntemplate <class Arc>\nvoid PdtPrunedExpand<Arc>::ProcStart() {\n  const auto s = efst_.Start();\n  AddStateAndEnqueue(s);\n  ofst_->SetStart(s);\n  SetSourceState(s, ifst_->Start());\n  current_stack_id_ = 0;\n  current_paren_id_ = -1;\n  stack_length_.push_back(0);\n  const auto r = rfst_.Start() - 1;\n  cached_source_ = ifst_->Start();\n  cached_stack_id_ = 0;\n  cached_dest_list_.push_front(std::make_pair(r, Weight::One()));\n  const PdtStateTuple<StateId, StackId> tuple(r, 0);\n  SetFinalDistance(state_table_.FindState(tuple), Weight::One());\n  SetDistance(s, Weight::One());\n  const auto d = DistanceToDest(ifst_->Start(), r);\n  SetFinalDistance(s, d);\n  VLOG(2) << d;\n}\n\n// Makes s final in ofst_ if shortest accepting path ending in s is below\n// threshold.\ntemplate <class Arc>\nvoid PdtPrunedExpand<Arc>::ProcFinal(StateId s) {\n  const auto weight = efst_.Final(s);\n  if (weight == Weight::Zero()) return;\n  if (less_(limit_, Times(Distance(s), weight))) return;\n  ofst_->SetFinal(s, weight);\n}\n\n// Returns true when an arc (or meta-arc) leaving state s in efst_ is below the\n// threshold. When add_arc is true, arc is added to ofst_.\ntemplate <class Arc>\nbool PdtPrunedExpand<Arc>::ProcNonParen(StateId s, const Arc &arc,\n                                        bool add_arc) {\n  VLOG(2) << \"ProcNonParen: \" << s << \" to \" << arc.nextstate << \", \"\n          << arc.ilabel << \":\" << arc.olabel << \" / \" << arc.weight\n          << \", add_arc = \" << (add_arc ? \"true\" : \"false\");\n  if (PruneArc(s, arc)) return false;\n  if (add_arc) ofst_->AddArc(s, arc);\n  AddStateAndEnqueue(arc.nextstate);\n  return true;\n}\n\n// Processes an open paren arc leaving state s in ofst_. When the arc is labeled\n// with an open paren,\n//\n// 1. Considers each (shortest) balanced path starting in s by taking the arc\n// and ending by a close paren balancing the open paren of as a meta-arc,\n// processing and pruning each meta-arc as a non-paren arc, inserting its\n// destination to the queue;\n// 2. if at least one of these meta-arcs has not been pruned, adds the\n// destination of arc to ofst_ as a new source state for the stack ID nsi, and\n// inserts it in the queue.\ntemplate <class Arc>\nbool PdtPrunedExpand<Arc>::ProcOpenParen(StateId s, const Arc &arc, StackId si,\n                                         StackId nsi) {\n  // Updates the stack length when needed.\n  while (stack_length_.size() <= nsi) stack_length_.push_back(-1);\n  if (stack_length_[nsi] == -1) stack_length_[nsi] = stack_length_[si] + 1;\n  const auto ns = arc.nextstate;\n  VLOG(2) << \"Open paren: \" << s << \"(\" << state_table_.Tuple(s).state_id\n          << \") to \" << ns << \"(\" << state_table_.Tuple(ns).state_id << \")\";\n  bool proc_arc = false;\n  auto fd = Weight::Zero();\n  const auto paren_id = stack_.ParenId(arc.ilabel);\n  std::forward_list<StateId> sources;\n  for (auto set_iter =\n           balance_data_->Find(paren_id, state_table_.Tuple(ns).state_id);\n       !set_iter.Done(); set_iter.Next()) {\n    sources.push_front(set_iter.Element());\n  }\n  for (const auto source : sources) {\n    VLOG(2) << \"Close paren source: \" << source;\n    const internal::ParenState<Arc> paren_state(paren_id, source);\n    for (auto it = close_paren_multimap_.find(paren_state);\n         it != close_paren_multimap_.end() && paren_state == it->first; ++it) {\n      auto meta_arc = it->second;\n      const PdtStateTuple<StateId, StackId> tuple(meta_arc.nextstate, si);\n      meta_arc.nextstate = state_table_.FindState(tuple);\n      const auto state_id = state_table_.Tuple(ns).state_id;\n      const auto d = DistanceToDest(state_id, source);\n      VLOG(2) << state_id << \", \" << source;\n      VLOG(2) << \"Meta arc weight = \" << arc.weight << \" Times \" << d\n              << \" Times \" << meta_arc.weight;\n      meta_arc.weight = Times(arc.weight, Times(d, meta_arc.weight));\n      proc_arc |= ProcNonParen(s, meta_arc, false);\n      fd = Plus(\n          fd,\n          Times(Times(DistanceToDest(state_table_.Tuple(ns).state_id, source),\n                      it->second.weight),\n                FinalDistance(meta_arc.nextstate)));\n    }\n  }\n  if (proc_arc) {\n    VLOG(2) << \"Proc open paren \" << s << \" to \" << arc.nextstate;\n    ofst_->AddArc(\n        s, keep_parentheses_ ? arc : Arc(0, 0, arc.weight, arc.nextstate));\n    AddStateAndEnqueue(arc.nextstate);\n    const auto nd = Times(Distance(s), arc.weight);\n    if (less_(nd, Distance(arc.nextstate))) SetDistance(arc.nextstate, nd);\n    // FinalDistance not necessary for source state since pruning decided using\n    // meta-arcs above.  But this is a problem with A*, hence the following.\n    if (less_(fd, FinalDistance(arc.nextstate)))\n      SetFinalDistance(arc.nextstate, fd);\n    SetFlags(arc.nextstate, kSourceState, kSourceState);\n  }\n  return proc_arc;\n}\n\n// Checks that shortest path through close paren arc in efst_ is below\n// threshold, and if so, adds it to ofst_.\ntemplate <class Arc>\nbool PdtPrunedExpand<Arc>::ProcCloseParen(StateId s, const Arc &arc) {\n  const auto weight =\n      Times(Distance(s), Times(arc.weight, FinalDistance(arc.nextstate)));\n  if (less_(limit_, weight)) return false;\n  ofst_->AddArc(s,\n                keep_parentheses_ ? arc : Arc(0, 0, arc.weight, arc.nextstate));\n  return true;\n}\n\n// When state s in ofst_ is a source state for stack ID si, identifies all the\n// corresponding possible destination states, that is, all the states in ifst_\n// that have an outgoing close paren arc balancing the incoming open paren taken\n// to get to s. For each such state t, computes the shortest distance from (t,\n// si) to the final states in ofst_. Stores this information in dest_map_.\ntemplate <class Arc>\nvoid PdtPrunedExpand<Arc>::ProcDestStates(StateId s, StackId si) {\n  if (!(Flags(s) & kSourceState)) return;\n  if (si != current_stack_id_) {\n    dest_map_.clear();\n    current_stack_id_ = si;\n    current_paren_id_ = stack_.Top(current_stack_id_);\n    VLOG(2) << \"StackID \" << si << \" dequeued for first time\";\n  }\n  // TODO(allauzen): clean up source state business; rename current function to\n  // ProcSourceState.\n  SetSourceState(s, state_table_.Tuple(s).state_id);\n  const auto paren_id = stack_.Top(si);\n  for (auto set_iter =\n           balance_data_->Find(paren_id, state_table_.Tuple(s).state_id);\n       !set_iter.Done(); set_iter.Next()) {\n    const auto dest_state = set_iter.Element();\n    if (dest_map_.find(dest_state) != dest_map_.end()) continue;\n    auto dest_weight = Weight::Zero();\n    internal::ParenState<Arc> paren_state(paren_id, dest_state);\n    for (auto it = close_paren_multimap_.find(paren_state);\n         it != close_paren_multimap_.end() && paren_state == it->first; ++it) {\n      const auto &arc = it->second;\n      const PdtStateTuple<StateId, StackId> tuple(arc.nextstate,\n                                                  stack_.Pop(si));\n      dest_weight =\n          Plus(dest_weight,\n               Times(arc.weight, FinalDistance(state_table_.FindState(tuple))));\n    }\n    dest_map_[dest_state] = dest_weight;\n    VLOG(2) << \"State \" << dest_state << \" is a dest state for stack ID \" << si\n            << \" with weight \" << dest_weight;\n  }\n}\n\n// Expands and prunes the input PDT, writing the result in ofst.\ntemplate <class Arc>\nvoid PdtPrunedExpand<Arc>::Expand(MutableFst<Arc> *ofst,\n                                  const typename Arc::Weight &threshold) {\n  ofst_ = ofst;\n  if (error_) {\n    ofst_->SetProperties(kError, kError);\n    return;\n  }\n  ofst_->DeleteStates();\n  ofst_->SetInputSymbols(ifst_->InputSymbols());\n  ofst_->SetOutputSymbols(ifst_->OutputSymbols());\n  limit_ = Times(DistanceToDest(ifst_->Start(), rfst_.Start() - 1), threshold);\n  flags_.clear();\n  ProcStart();\n  while (!queue_.Empty()) {\n    const auto s = queue_.Head();\n    queue_.Dequeue();\n    SetFlags(s, kExpanded, kExpanded | kEnqueued);\n    VLOG(2) << s << \" dequeued!\";\n    ProcFinal(s);\n    StackId stack_id = state_table_.Tuple(s).stack_id;\n    ProcDestStates(s, stack_id);\n    for (ArcIterator<PdtExpandFst<Arc>> aiter(efst_, s); !aiter.Done();\n         aiter.Next()) {\n      const auto &arc = aiter.Value();\n      const auto nextstack_id = state_table_.Tuple(arc.nextstate).stack_id;\n      if (stack_id == nextstack_id) {\n        ProcNonParen(s, arc, true);\n      } else if (stack_id == stack_.Pop(nextstack_id)) {\n        ProcOpenParen(s, arc, stack_id, nextstack_id);\n      } else {\n        ProcCloseParen(s, arc);\n      }\n    }\n    VLOG(2) << \"d[\" << s << \"] = \" << Distance(s) << \", fd[\" << s\n            << \"] = \" << FinalDistance(s);\n  }\n}\n\n// Expand functions.\n\ntemplate <class Arc>\nstruct PdtExpandOptions {\n  using Weight = typename Arc::Weight;\n\n  bool connect;\n  bool keep_parentheses;\n  Weight weight_threshold;\n\n  PdtExpandOptions(bool connect = true, bool keep_parentheses = false,\n                   Weight weight_threshold = Weight::Zero())\n      : connect(connect),\n        keep_parentheses(keep_parentheses),\n        weight_threshold(std::move(weight_threshold)) {}\n};\n\n// Expands a pushdown transducer (PDT) encoded as an FST into an FST. This\n// version writes the expanded PDT to a mutable FST. In the PDT, some\n// transitions are labeled with open or close parentheses. To be interpreted as\n// a PDT, the parens must balance on a path. The open-close parenthesis label\n// pairs are passed using the parens argument. Expansion enforces the\n// parenthesis constraints. The PDT must be expandable as an FST.\ntemplate <class Arc>\nvoid Expand(\n    const Fst<Arc> &ifst,\n    const std::vector<std::pair<typename Arc::Label, typename Arc::Label>>\n        &parens,\n    MutableFst<Arc> *ofst, const PdtExpandOptions<Arc> &opts) {\n  PdtExpandFstOptions<Arc> eopts;\n  eopts.gc_limit = 0;\n  if (opts.weight_threshold == Arc::Weight::Zero()) {\n    eopts.keep_parentheses = opts.keep_parentheses;\n    *ofst = PdtExpandFst<Arc>(ifst, parens, eopts);\n  } else {\n    PdtPrunedExpand<Arc> pruned_expand(ifst, parens, opts.keep_parentheses);\n    pruned_expand.Expand(ofst, opts.weight_threshold);\n  }\n  if (opts.connect) Connect(ofst);\n}\n\n// Expands a pushdown transducer (PDT) encoded as an FST into an FST. This\n// version writes the expanded PDT result to a mutable FST. In the PDT, some\n// transitions are labeled with open or close parentheses. To be interpreted as\n// a PDT, the parens must balance on a path. The open-close parenthesis label\n// pairs are passed using the parents argument. Expansion enforces the\n// parenthesis constraints. The PDT must be expandable as an FST.\ntemplate <class Arc>\nvoid Expand(const Fst<Arc> &ifst,\n    const std::vector<std::pair<typename Arc::Label, typename Arc::Label>>\n    &parens, MutableFst<Arc> *ofst, bool connect = true,\n    bool keep_parentheses = false) {\n  const PdtExpandOptions<Arc> opts(connect, keep_parentheses);\n  Expand(ifst, parens, ofst, opts);\n}\n\n}  // namespace fst\n\n#endif  // FST_EXTENSIONS_PDT_EXPAND_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/extensions/pdt/getters.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#ifndef FST_EXTENSIONS_PDT_GETTERS_H_\n#define FST_EXTENSIONS_PDT_GETTERS_H_\n\n#include <string>\n\n#include <fst/extensions/pdt/compose.h>\n#include <fst/extensions/pdt/replace.h>\n\nnamespace fst {\nnamespace script {\n\nbool GetPdtComposeFilter(const string &str, PdtComposeFilter *cf);\n\nbool GetPdtParserType(const string &str, PdtParserType *pt);\n\n}  // namespace script\n}  // namespace fst\n\n#endif  // FST_EXTENSIONS_PDT_GETTERS_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/extensions/pdt/info.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Prints information about a PDT.\n\n#ifndef FST_EXTENSIONS_PDT_INFO_H_\n#define FST_EXTENSIONS_PDT_INFO_H_\n\n#include <unordered_map>\n#include <unordered_set>\n#include <vector>\n\n#include <fst/extensions/pdt/pdt.h>\n#include <fst/fst.h>\n\nnamespace fst {\n\n// Compute various information about PDTs.\ntemplate <class Arc>\nclass PdtInfo {\n public:\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  PdtInfo(const Fst<Arc> &fst,\n          const std::vector<std::pair<Label, Label>> &parents);\n\n  const string &FstType() const { return fst_type_; }\n\n  const string &ArcType() const { return Arc::Type(); }\n\n  int64 NumStates() const { return nstates_; }\n\n  int64 NumArcs() const { return narcs_; }\n\n  int64 NumOpenParens() const { return nopen_parens_; }\n\n  int64 NumCloseParens() const { return nclose_parens_; }\n\n  int64 NumUniqueOpenParens() const { return nuniq_open_parens_; }\n\n  int64 NumUniqueCloseParens() const { return nuniq_close_parens_; }\n\n  int64 NumOpenParenStates() const { return nopen_paren_states_; }\n\n  int64 NumCloseParenStates() const { return nclose_paren_states_; }\n\n private:\n  string fst_type_;\n  int64 nstates_;\n  int64 narcs_;\n  int64 nopen_parens_;\n  int64 nclose_parens_;\n  int64 nuniq_open_parens_;\n  int64 nuniq_close_parens_;\n  int64 nopen_paren_states_;\n  int64 nclose_paren_states_;\n};\n\ntemplate <class Arc>\nPdtInfo<Arc>::PdtInfo(\n    const Fst<Arc> &fst,\n    const std::vector<std::pair<typename Arc::Label, typename Arc::Label>>\n        &parens)\n    : fst_type_(fst.Type()),\n      nstates_(0),\n      narcs_(0),\n      nopen_parens_(0),\n      nclose_parens_(0),\n      nuniq_open_parens_(0),\n      nuniq_close_parens_(0),\n      nopen_paren_states_(0),\n      nclose_paren_states_(0) {\n  std::unordered_map<Label, size_t> paren_map;\n  std::unordered_set<Label> paren_set;\n  std::unordered_set<StateId> open_paren_state_set;\n  std::unordered_set<StateId> close_paren_state_set;\n  for (size_t i = 0; i < parens.size(); ++i) {\n    const auto &pair = parens[i];\n    paren_map[pair.first] = i;\n    paren_map[pair.second] = i;\n  }\n  for (StateIterator<Fst<Arc>> siter(fst); !siter.Done(); siter.Next()) {\n    ++nstates_;\n    const auto s = siter.Value();\n    for (ArcIterator<Fst<Arc>> aiter(fst, s); !aiter.Done(); aiter.Next()) {\n      const auto &arc = aiter.Value();\n      ++narcs_;\n      const auto it = paren_map.find(arc.ilabel);\n      if (it != paren_map.end()) {\n        const auto open_paren = parens[it->second].first;\n        const auto close_paren = parens[it->second].second;\n        if (arc.ilabel == open_paren) {\n          ++nopen_parens_;\n          if (!paren_set.count(open_paren)) {\n            ++nuniq_open_parens_;\n            paren_set.insert(open_paren);\n          }\n          if (!open_paren_state_set.count(arc.nextstate)) {\n            ++nopen_paren_states_;\n            open_paren_state_set.insert(arc.nextstate);\n          }\n        } else {\n          ++nclose_parens_;\n          if (!paren_set.count(close_paren)) {\n            ++nuniq_close_parens_;\n            paren_set.insert(close_paren);\n          }\n          if (!close_paren_state_set.count(s)) {\n            ++nclose_paren_states_;\n            close_paren_state_set.insert(s);\n          }\n        }\n      }\n    }\n  }\n}\n\ntemplate <class Arc>\nvoid PrintPdtInfo(const PdtInfo<Arc> &info) {\n  const auto old = std::cout.setf(std::ios::left);\n  std::cout.width(50);\n  std::cout << \"fst type\" << info.FstType() << std::endl;\n  std::cout.width(50);\n  std::cout << \"arc type\" << info.ArcType() << std::endl;\n  std::cout.width(50);\n  std::cout << \"# of states\" << info.NumStates() << std::endl;\n  std::cout.width(50);\n  std::cout << \"# of arcs\" << info.NumArcs() << std::endl;\n  std::cout.width(50);\n  std::cout << \"# of open parentheses\" << info.NumOpenParens() << std::endl;\n  std::cout.width(50);\n  std::cout << \"# of close parentheses\" << info.NumCloseParens() << std::endl;\n  std::cout.width(50);\n  std::cout << \"# of unique open parentheses\" << info.NumUniqueOpenParens()\n            << std::endl;\n  std::cout.width(50);\n  std::cout << \"# of unique close parentheses\" << info.NumUniqueCloseParens()\n            << std::endl;\n  std::cout.width(50);\n  std::cout << \"# of open parenthesis dest. states\" << info.NumOpenParenStates()\n            << std::endl;\n  std::cout.width(50);\n  std::cout << \"# of close parenthesis source states\"\n            << info.NumCloseParenStates() << std::endl;\n  std::cout.setf(old);\n}\n\n}  // namespace fst\n\n#endif  // FST_EXTENSIONS_PDT_INFO_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/extensions/pdt/paren.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Common classes for PDT parentheses.\n\n#ifndef FST_EXTENSIONS_PDT_PAREN_H_\n#define FST_EXTENSIONS_PDT_PAREN_H_\n\n#include <algorithm>\n#include <set>\n#include <unordered_map>\n#include <unordered_set>\n\n#include <fst/log.h>\n\n#include <fst/extensions/pdt/collection.h>\n#include <fst/extensions/pdt/pdt.h>\n#include <fst/dfs-visit.h>\n#include <fst/fst.h>\n\n\nnamespace fst {\nnamespace internal {\n\n// ParenState: Pair of an open (close) parenthesis and its destination (source)\n// state.\n\ntemplate <class Arc>\nstruct ParenState {\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n\n  Label paren_id;    // ID of open (close) paren.\n  StateId state_id;  // Destination (source) state of open (close) paren.\n\n  explicit ParenState(Label paren_id = kNoLabel, StateId state_id = kNoStateId)\n      : paren_id(paren_id), state_id(state_id) {}\n\n  bool operator==(const ParenState<Arc> &other) const {\n    if (&other == this) return true;\n    return other.paren_id == paren_id && other.state_id == state_id;\n  }\n\n  bool operator!=(const ParenState<Arc> &other) const {\n    return !(other == *this);\n  }\n\n  struct Hash {\n    size_t operator()(const ParenState<Arc> &pstate) const {\n      static constexpr auto prime = 7853;\n      return pstate.paren_id + pstate.state_id * prime;\n    }\n  };\n};\n\n// Creates an FST-style const iterator from an STL-style map.\ntemplate <class Map>\nclass MapIterator {\n public:\n  using StlIterator = typename Map::const_iterator;\n  using ValueType = typename Map::mapped_type;\n\n  MapIterator(const Map &map, StlIterator it)\n      : begin_(it), end_(map.end()), it_(it) {}\n\n  bool Done() const { return it_ == end_ || it_->first != begin_->first; }\n\n  ValueType Value() const { return it_->second; }\n\n  void Next() { ++it_; }\n\n  void Reset() { it_ = begin_; }\n\n private:\n  const StlIterator begin_;\n  const StlIterator end_;\n  StlIterator it_;\n};\n\n// PdtParenReachable: Provides various parenthesis reachability information.\n\ntemplate <class Arc>\nclass PdtParenReachable {\n public:\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n\n  using State = ParenState<Arc>;\n  using StateHash = typename State::Hash;\n\n  // Maps from state ID to reachable paren IDs from (to) that state.\n  using ParenMultimap = std::unordered_multimap<StateId, Label>;\n\n  // Maps from paren ID and state ID to reachable state set ID.\n  using StateSetMap = std::unordered_map<State, ssize_t, StateHash>;\n\n  // Maps from paren ID and state ID to arcs exiting that state with that\n  // Label.\n  using ParenArcMultimap = std::unordered_map<State, Arc, StateHash>;\n\n  using ParenIterator = MapIterator<ParenMultimap>;\n\n  using ParenArcIterator = MapIterator<ParenArcMultimap>;\n\n  using SetIterator = typename Collection<ssize_t, StateId>::SetIterator;\n\n  // Computes close (open) parenthesis reachability information for a PDT with\n  // bounded stack.\n  PdtParenReachable(const Fst<Arc> &fst,\n                    const std::vector<std::pair<Label, Label>> &parens,\n                    bool close)\n      : fst_(fst), parens_(parens), close_(close), error_(false) {\n    paren_map_.reserve(2 * parens.size());\n    for (size_t i = 0; i < parens.size(); ++i) {\n      const auto &pair = parens[i];\n      paren_map_[pair.first] = i;\n      paren_map_[pair.second] = i;\n    }\n    if (close_) {\n      const auto start = fst.Start();\n      if (start == kNoStateId) return;\n      if (!DFSearch(start)) {\n        FSTERROR() << \"PdtReachable: Underlying cyclicity not supported\";\n        error_ = true;\n      }\n    } else {\n      FSTERROR() << \"PdtParenReachable: Open paren info not implemented\";\n      error_ = true;\n    }\n  }\n\n  bool Error() const { return error_; }\n\n  // Given a state ID, returns an iterator over paren IDs for close (open)\n  // parens reachable from that state along balanced paths.\n  ParenIterator FindParens(StateId s) const {\n    return ParenIterator(paren_multimap_, paren_multimap_.find(s));\n  }\n\n  // Given a paren ID and a state ID s, returns an iterator over states that can\n  // be reached along balanced paths from (to) s that have have close (open)\n  // parentheses matching the paren ID exiting (entering) those states.\n  SetIterator FindStates(Label paren_id, StateId s) const {\n    const State paren_state(paren_id, s);\n    const auto it = set_map_.find(paren_state);\n    if (it == set_map_.end()) {\n      return state_sets_.FindSet(-1);\n    } else {\n      return state_sets_.FindSet(it->second);\n    }\n  }\n\n  // Given a paren ID and a state ID s, return an iterator over arcs that exit\n  // (enter) s and are labeled with a close (open) parenthesis matching the\n  // paren ID.\n  ParenArcIterator FindParenArcs(Label paren_id, StateId s) const {\n    const State paren_state(paren_id, s);\n    return ParenArcIterator(paren_arc_multimap_,\n                            paren_arc_multimap_.find(paren_state));\n  }\n\n private:\n  // Returns false when cycle detected during DFS gathering paren and state set\n  // information.\n  bool DFSearch(StateId s);\n\n  // Unions state sets together gathered by the DFS.\n  void ComputeStateSet(StateId s);\n\n  // Gathers state set(s) from state.\n  void UpdateStateSet(StateId nextstate, std::set<Label> *paren_set,\n                      std::vector<std::set<StateId>> *state_sets) const;\n\n  const Fst<Arc> &fst_;\n  // Paren IDs to labels.\n  const std::vector<std::pair<Label, Label>> &parens_;\n  // Close/open paren info?\n  const bool close_;\n  // Labels to paren IDs.\n  std::unordered_map<Label, Label> paren_map_;\n  // Paren reachability.\n  ParenMultimap paren_multimap_;\n  // Paren arcs.\n  ParenArcMultimap paren_arc_multimap_;\n  // DFS states.\n  std::vector<uint8> state_color_;\n  // Reachable states to IDs.\n  mutable Collection<ssize_t, StateId> state_sets_;\n  // IDs to reachable states.\n  StateSetMap set_map_;\n  bool error_;\n\n  PdtParenReachable(const PdtParenReachable &) = delete;\n  PdtParenReachable &operator=(const PdtParenReachable &) = delete;\n};\n\n// Gathers paren and state set information.\ntemplate <class Arc>\nbool PdtParenReachable<Arc>::DFSearch(StateId s) {\n  static constexpr uint8 kWhiteState = 0x01;  // Undiscovered.\n  static constexpr uint8 kGreyState = 0x02;   // Discovered & unfinished.\n  static constexpr uint8 kBlackState = 0x04;  // Finished.\n  if (s >= state_color_.size()) state_color_.resize(s + 1, kWhiteState);\n  if (state_color_[s] == kBlackState) return true;\n  if (state_color_[s] == kGreyState) return false;\n  state_color_[s] = kGreyState;\n  for (ArcIterator<Fst<Arc>> aiter(fst_, s); !aiter.Done(); aiter.Next()) {\n    const auto &arc = aiter.Value();\n    const auto it = paren_map_.find(arc.ilabel);\n    if (it != paren_map_.end()) {  // Paren?\n      const auto paren_id = it->second;\n      if (arc.ilabel == parens_[paren_id].first) {  // Open paren?\n        if (!DFSearch(arc.nextstate)) return false;\n        for (auto set_iter = FindStates(paren_id, arc.nextstate);\n             !set_iter.Done(); set_iter.Next()) {\n          for (auto paren_arc_iter =\n                   FindParenArcs(paren_id, set_iter.Element());\n               !paren_arc_iter.Done(); paren_arc_iter.Next()) {\n            const auto &cparc = paren_arc_iter.Value();\n            if (!DFSearch(cparc.nextstate)) return false;\n          }\n        }\n      }\n    } else if (!DFSearch(arc.nextstate)) {  // Non-paren.\n      return false;\n    }\n  }\n  ComputeStateSet(s);\n  state_color_[s] = kBlackState;\n  return true;\n}\n\n// Unions state sets.\ntemplate <class Arc>\nvoid PdtParenReachable<Arc>::ComputeStateSet(StateId s) {\n  std::set<Label> paren_set;\n  std::vector<std::set<StateId>> state_sets(parens_.size());\n  for (ArcIterator<Fst<Arc>> aiter(fst_, s); !aiter.Done(); aiter.Next()) {\n    const auto &arc = aiter.Value();\n    const auto it = paren_map_.find(arc.ilabel);\n    if (it != paren_map_.end()) {  // Paren?\n      const auto paren_id = it->second;\n      if (arc.ilabel == parens_[paren_id].first) {  // Open paren?\n        for (auto set_iter = FindStates(paren_id, arc.nextstate);\n             !set_iter.Done(); set_iter.Next()) {\n          for (auto paren_arc_iter =\n                   FindParenArcs(paren_id, set_iter.Element());\n               !paren_arc_iter.Done(); paren_arc_iter.Next()) {\n            const auto &cparc = paren_arc_iter.Value();\n            UpdateStateSet(cparc.nextstate, &paren_set, &state_sets);\n          }\n        }\n      } else {  // Close paren.\n        paren_set.insert(paren_id);\n        state_sets[paren_id].insert(s);\n        const State paren_state(paren_id, s);\n        paren_arc_multimap_.insert(std::make_pair(paren_state, arc));\n      }\n    } else {  // Non-paren.\n      UpdateStateSet(arc.nextstate, &paren_set, &state_sets);\n    }\n  }\n  std::vector<StateId> state_set;\n  for (auto paren_iter = paren_set.begin(); paren_iter != paren_set.end();\n       ++paren_iter) {\n    state_set.clear();\n    const auto paren_id = *paren_iter;\n    paren_multimap_.insert(std::make_pair(s, paren_id));\n    for (auto state_iter = state_sets[paren_id].begin();\n         state_iter != state_sets[paren_id].end(); ++state_iter) {\n      state_set.push_back(*state_iter);\n    }\n    const State paren_state(paren_id, s);\n    set_map_[paren_state] = state_sets_.FindId(state_set);\n  }\n}\n\n// Gathers state sets.\ntemplate <class Arc>\nvoid PdtParenReachable<Arc>::UpdateStateSet(\n    StateId nextstate, std::set<Label> *paren_set,\n    std::vector<std::set<StateId>> *state_sets) const {\n  for (auto paren_iter = FindParens(nextstate); !paren_iter.Done();\n       paren_iter.Next()) {\n    const auto paren_id = paren_iter.Value();\n    paren_set->insert(paren_id);\n    for (auto set_iter = FindStates(paren_id, nextstate); !set_iter.Done();\n         set_iter.Next()) {\n      (*state_sets)[paren_id].insert(set_iter.Element());\n    }\n  }\n}\n\n// Stores balancing parenthesis data for a PDT. Unlike PdtParenReachable above\n// this allows on-the-fly construction (e.g., in PdtShortestPath).\ntemplate <class Arc>\nclass PdtBalanceData {\n public:\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n\n  using State = ParenState<Arc>;\n  using StateHash = typename State::Hash;\n\n  // Set for open parens.\n  using OpenParenSet = std::unordered_set<State, StateHash>;\n\n  // Maps from open paren destination state to parenthesis ID.\n  using OpenParenMap = std::unordered_multimap<StateId, Label>;\n\n  // Maps from open paren state to source states of matching close parens\n  using CloseParenMap = std::unordered_multimap<State, StateId, StateHash>;\n\n  // Maps from open paren state to close source set ID.\n  using CloseSourceMap = std::unordered_map<State, ssize_t, StateHash>;\n\n  using SetIterator = typename Collection<ssize_t, StateId>::SetIterator;\n\n  PdtBalanceData() {}\n\n  void Clear() {\n    open_paren_map_.clear();\n    close_paren_map_.clear();\n  }\n\n  // Adds an open parenthesis with destination state open_dest.\n  void OpenInsert(Label paren_id, StateId open_dest) {\n    const State key(paren_id, open_dest);\n    if (!open_paren_set_.count(key)) {\n      open_paren_set_.insert(key);\n      open_paren_map_.emplace(open_dest, paren_id);\n    }\n  }\n\n  // Adds a matching closing parenthesis with source state close_source\n  // balancing an open_parenthesis with destination state open_dest if\n  // OpenInsert() previously called.\n  void CloseInsert(Label paren_id, StateId open_dest, StateId close_source) {\n    const State key(paren_id, open_dest);\n    if (open_paren_set_.count(key)) {\n      close_paren_map_.emplace(key, close_source);\n    }\n  }\n\n  // Finds close paren source states matching an open parenthesis. The following\n  // methods are then used to iterate through those matching states. Should be\n  // called only after FinishInsert(open_dest).\n  SetIterator Find(Label paren_id, StateId open_dest) {\n    const State key(paren_id, open_dest);\n    const auto it = close_source_map_.find(key);\n    if (it == close_source_map_.end()) {\n      return close_source_sets_.FindSet(-1);\n    } else {\n      return close_source_sets_.FindSet(it->second);\n    }\n  }\n\n  // Called when all open and close parenthesis insertions (w.r.t. open\n  // parentheses entering state open_dest) are finished. Must be called before\n  // Find(open_dest).\n  void FinishInsert(StateId open_dest) {\n    std::vector<StateId> close_sources;\n    for (auto oit = open_paren_map_.find(open_dest);\n         oit != open_paren_map_.end() && oit->first == open_dest;) {\n      const auto paren_id = oit->second;\n      close_sources.clear();\n      const State key(paren_id, open_dest);\n      open_paren_set_.erase(open_paren_set_.find(key));\n      for (auto cit = close_paren_map_.find(key);\n           cit != close_paren_map_.end() && cit->first == key;) {\n        close_sources.push_back(cit->second);\n        close_paren_map_.erase(cit++);\n      }\n      std::sort(close_sources.begin(), close_sources.end());\n      auto unique_end = std::unique(close_sources.begin(), close_sources.end());\n      close_sources.resize(unique_end - close_sources.begin());\n      if (!close_sources.empty()) {\n        close_source_map_[key] = close_source_sets_.FindId(close_sources);\n      }\n      open_paren_map_.erase(oit++);\n    }\n  }\n\n  // Returns a new balance data object representing the reversed balance\n  // information.\n  PdtBalanceData<Arc> *Reverse(StateId num_states, StateId num_split,\n                               StateId state_id_shift) const;\n\n private:\n  // Open paren at destintation state?\n  OpenParenSet open_paren_set_;\n  // Open parens per state.\n  OpenParenMap open_paren_map_;\n  // Current open destination state.\n  State open_dest_;\n  // Current open paren/state.\n  typename OpenParenMap::const_iterator open_iter_;\n  // Close states to (open paren, state).\n  CloseParenMap close_paren_map_;\n  // (Paren, state) to set ID.\n  CloseSourceMap close_source_map_;\n  mutable Collection<ssize_t, StateId> close_source_sets_;\n};\n\n// Return a new balance data object representing the reversed balance\n// information.\ntemplate <class Arc>\nPdtBalanceData<Arc> *PdtBalanceData<Arc>::Reverse(\n    StateId num_states, StateId num_split, StateId state_id_shift) const {\n  auto *bd = new PdtBalanceData<Arc>;\n  std::unordered_set<StateId> close_sources;\n  const auto split_size = num_states / num_split;\n  for (StateId i = 0; i < num_states; i += split_size) {\n    close_sources.clear();\n    for (auto it = close_source_map_.begin(); it != close_source_map_.end();\n         ++it) {\n      const auto &okey = it->first;\n      const auto open_dest = okey.state_id;\n      const auto paren_id = okey.paren_id;\n      for (auto set_iter = close_source_sets_.FindSet(it->second);\n           !set_iter.Done(); set_iter.Next()) {\n        const auto close_source = set_iter.Element();\n        if ((close_source < i) || (close_source >= i + split_size)) continue;\n        close_sources.insert(close_source + state_id_shift);\n        bd->OpenInsert(paren_id, close_source + state_id_shift);\n        bd->CloseInsert(paren_id, close_source + state_id_shift,\n                        open_dest + state_id_shift);\n      }\n    }\n    for (auto it = close_sources.begin(); it != close_sources.end(); ++it) {\n      bd->FinishInsert(*it);\n    }\n  }\n  return bd;\n}\n\n}  // namespace internal\n}  // namespace fst\n\n#endif  // FST_EXTENSIONS_PDT_PAREN_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/extensions/pdt/pdt.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Common classes for PDT expansion/traversal.\n\n#ifndef FST_EXTENSIONS_PDT_PDT_H_\n#define FST_EXTENSIONS_PDT_PDT_H_\n\n#include <map>\n#include <set>\n#include <unordered_map>\n\n#include <fst/compat.h>\n#include <fst/log.h>\n#include <fst/fst.h>\n#include <fst/state-table.h>\n\nnamespace fst {\n\n// Provides bijection between parenthesis stacks and signed integral stack IDs.\n// Each stack ID is unique to each distinct stack. The open-close parenthesis\n// label pairs are passed using the parens argument.\ntemplate <typename StackId, typename Label>\nclass PdtStack {\n public:\n  // The stacks are stored in a tree. The nodes are stored in a vector. Each\n  // node represents the top of some stack and is identified by its position in\n  // the vector. Its' parent node represents the stack with the top popped and\n  // its children are stored in child_map_ and accessed by stack_id and label.\n  // The paren_id is\n  // the position in parens of the parenthesis for that node.\n  struct StackNode {\n    StackId parent_id;\n    size_t paren_id;\n\n    StackNode(StackId p, size_t i) : parent_id(p), paren_id(i) {}\n  };\n\n  explicit PdtStack(const std::vector<std::pair<Label, Label>> &parens)\n      : parens_(parens), min_paren_(kNoLabel), max_paren_(kNoLabel) {\n    for (size_t i = 0; i < parens.size(); ++i) {\n      const auto &pair = parens[i];\n      paren_map_[pair.first] = i;\n      paren_map_[pair.second] = i;\n      if (min_paren_ == kNoLabel || pair.first < min_paren_) {\n        min_paren_ = pair.first;\n      }\n      if (pair.second < min_paren_) min_paren_ = pair.second;\n      if (max_paren_ == kNoLabel || pair.first > max_paren_) {\n        max_paren_ = pair.first;\n      }\n      if (pair.second > max_paren_) max_paren_ = pair.second;\n    }\n    nodes_.push_back(StackNode(-1, -1));  // Tree root.\n  }\n\n  // Returns stack ID given the current stack ID (0 if empty) and label read.\n  // Pushes onto the stack if the label is an open parenthesis, returning the\n  // new stack ID. Pops the stack if the label is a close parenthesis that\n  // matches the top of the stack, returning the parent stack ID. Returns -1 if\n  // label is an unmatched close parenthesis. Otherwise, returns the current\n  // stack ID.\n  StackId Find(StackId stack_id, Label label) {\n    if (min_paren_ == kNoLabel || label < min_paren_ || label > max_paren_) {\n      return stack_id;  // Non-paren.\n    }\n    const auto it = paren_map_.find(label);\n    // Non-paren.\n    if (it == paren_map_.end()) return stack_id;\n    const auto paren_id = it->second;\n    // Open paren.\n    if (label == parens_[paren_id].first) {\n      auto &child_id = child_map_[std::make_pair(stack_id, label)];\n      if (child_id == 0) {  // Child not found; pushes label.\n        child_id = nodes_.size();\n        nodes_.push_back(StackNode(stack_id, paren_id));\n      }\n      return child_id;\n    }\n    const auto &node = nodes_[stack_id];\n    // Matching close paren.\n    if (paren_id == node.paren_id) return node.parent_id;\n    // Non-matching close paren.\n    return -1;\n  }\n\n  // Returns the stack ID obtained by popping the label at the top of the\n  // current stack ID.\n  StackId Pop(StackId stack_id) const { return nodes_[stack_id].parent_id; }\n\n  // Returns the paren ID at the top of the stack.\n  ssize_t Top(StackId stack_id) const { return nodes_[stack_id].paren_id; }\n\n  ssize_t ParenId(Label label) const {\n    const auto it = paren_map_.find(label);\n    if (it == paren_map_.end()) return -1;  // Non-paren.\n    return it->second;\n  }\n\n private:\n  struct ChildHash {\n    size_t operator()(const std::pair<StackId, Label> &pair) const {\n      static constexpr size_t prime = 7853;\n      return static_cast<size_t>(pair.first) +\n             static_cast<size_t>(pair.second) * prime;\n    }\n  };\n\n  std::vector<std::pair<Label, Label>> parens_;\n  std::vector<StackNode> nodes_;\n  std::unordered_map<Label, size_t> paren_map_;\n  // Child of stack node w.r.t label\n  std::unordered_map<std::pair<StackId, Label>, StackId, ChildHash> child_map_;\n  Label min_paren_;\n  Label max_paren_;\n};\n\n// State tuple for PDT expansion.\ntemplate <typename S, typename K>\nstruct PdtStateTuple {\n  using StateId = S;\n  using StackId = K;\n\n  StateId state_id;\n  StackId stack_id;\n\n  PdtStateTuple(StateId state_id = kNoStateId, StackId stack_id = -1)\n      : state_id(state_id), stack_id(stack_id) {}\n};\n\n// Equality of PDT state tuples.\ntemplate <typename S, typename K>\ninline bool operator==(const PdtStateTuple<S, K> &x,\n                       const PdtStateTuple<S, K> &y) {\n  if (&x == &y) return true;\n  return x.state_id == y.state_id && x.stack_id == y.stack_id;\n}\n\n// Hash function object for PDT state tuples\ntemplate <class T>\nclass PdtStateHash {\n public:\n  size_t operator()(const T &tuple) const {\n    static constexpr auto prime = 7853;\n    return tuple.state_id + tuple.stack_id * prime;\n  }\n};\n\n// Tuple to PDT state bijection.\ntemplate <class StateId, class StackId>\nclass PdtStateTable : public CompactHashStateTable<\n                          PdtStateTuple<StateId, StackId>,\n                          PdtStateHash<PdtStateTuple<StateId, StackId>>> {\n public:\n  PdtStateTable() {}\n\n  PdtStateTable(const PdtStateTable &other) {}\n\n private:\n  PdtStateTable &operator=(const PdtStateTable &) = delete;\n};\n\n}  // namespace fst\n\n#endif  // FST_EXTENSIONS_PDT_PDT_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/extensions/pdt/pdtlib.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// This is an experimental push-down transducer (PDT) library. A PDT is\n// encoded as an FST, where some transitions are labeled with open or close\n// parentheses. To be interpreted as a PDT, the parentheses must balance on a\n// path.\n\n#ifndef FST_EXTENSIONS_PDT_PDTLIB_H_\n#define FST_EXTENSIONS_PDT_PDTLIB_H_\n\n#include <fst/extensions/pdt/compose.h>\n#include <fst/extensions/pdt/expand.h>\n#include <fst/extensions/pdt/pdt.h>\n#include <fst/extensions/pdt/replace.h>\n#include <fst/extensions/pdt/reverse.h>\n#include <fst/extensions/pdt/shortest-path.h>\n\n#endif  // FST_EXTENSIONS_PDT_PDTLIB_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/extensions/pdt/pdtscript.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Convenience file for including all PDT operations at once, and/or\n// registering them for new arc types.\n\n#ifndef FST_EXTENSIONS_PDT_PDTSCRIPT_H_\n#define FST_EXTENSIONS_PDT_PDTSCRIPT_H_\n\n#include <algorithm>\n#include <utility>\n#include <vector>\n\n#include <fst/log.h>\n#include <fst/compose.h>  // for ComposeOptions\n#include <fst/util.h>\n\n#include <fst/script/arg-packs.h>\n#include <fst/script/fstscript.h>\n#include <fst/script/shortest-path.h>\n\n#include <fst/extensions/pdt/compose.h>\n#include <fst/extensions/pdt/expand.h>\n#include <fst/extensions/pdt/info.h>\n#include <fst/extensions/pdt/replace.h>\n#include <fst/extensions/pdt/reverse.h>\n#include <fst/extensions/pdt/shortest-path.h>\n\nnamespace fst {\nnamespace script {\n\nusing PdtComposeArgs =\n    std::tuple<const FstClass &, const FstClass &,\n               const std::vector<LabelPair> &, MutableFstClass *,\n               const PdtComposeOptions &, bool>;\n\ntemplate <class Arc>\nvoid PdtCompose(PdtComposeArgs *args) {\n  const Fst<Arc> &ifst1 = *(std::get<0>(*args).GetFst<Arc>());\n  const Fst<Arc> &ifst2 = *(std::get<1>(*args).GetFst<Arc>());\n  MutableFst<Arc> *ofst = std::get<3>(*args)->GetMutableFst<Arc>();\n  // In case Arc::Label is not the same as FstClass::Label, we make a\n  // copy. Truncation may occur if FstClass::Label has more precision than\n  // Arc::Label.\n  std::vector<std::pair<typename Arc::Label, typename Arc::Label>> typed_parens(\n      std::get<2>(*args).size());\n  std::copy(std::get<2>(*args).begin(), std::get<2>(*args).end(),\n            typed_parens.begin());\n  if (std::get<5>(*args)) {\n    Compose(ifst1, typed_parens, ifst2, ofst, std::get<4>(*args));\n  } else {\n    Compose(ifst1, ifst2, typed_parens, ofst, std::get<4>(*args));\n  }\n}\n\nvoid PdtCompose(const FstClass &ifst1, const FstClass &ifst2,\n                const std::vector<LabelPair> &parens,\n                MutableFstClass *ofst, const PdtComposeOptions &opts,\n                bool left_pdt);\n\nstruct PdtExpandOptions {\n  bool connect;\n  bool keep_parentheses;\n  const WeightClass &weight_threshold;\n\n  PdtExpandOptions(bool c, bool k, const WeightClass &w)\n      : connect(c), keep_parentheses(k), weight_threshold(w) {}\n};\n\nusing PdtExpandArgs =\n    std::tuple<const FstClass &, const std::vector<LabelPair> &,\n               MutableFstClass *, const PdtExpandOptions &>;\n\ntemplate <class Arc>\nvoid PdtExpand(PdtExpandArgs *args) {\n  const Fst<Arc> &fst = *(std::get<0>(*args).GetFst<Arc>());\n  MutableFst<Arc> *ofst = std::get<2>(*args)->GetMutableFst<Arc>();\n  // In case Arc::Label is not the same as FstClass::Label, we make a\n  // copy. Truncation may occur if FstClass::Label has more precision than\n  // Arc::Label.\n  std::vector<std::pair<typename Arc::Label, typename Arc::Label>> typed_parens(\n      std::get<1>(*args).size());\n  std::copy(std::get<1>(*args).begin(), std::get<1>(*args).end(),\n            typed_parens.begin());\n  Expand(fst, typed_parens, ofst,\n         fst::PdtExpandOptions<Arc>(\n             std::get<3>(*args).connect, std::get<3>(*args).keep_parentheses,\n             *(std::get<3>(*args)\n                   .weight_threshold.GetWeight<typename Arc::Weight>())));\n}\n\nvoid PdtExpand(const FstClass &ifst, const std::vector<LabelPair> &parens,\n               MutableFstClass *ofst, const PdtExpandOptions &opts);\n\nvoid PdtExpand(const FstClass &ifst, const std::vector<LabelPair> &parens,\n               MutableFstClass *ofst, bool connect, bool keep_parentheses,\n               const WeightClass &weight_threshold);\n\nusing PdtReplaceArgs =\n    std::tuple<const std::vector<LabelFstClassPair> &, MutableFstClass *,\n               std::vector<LabelPair> *, int64, PdtParserType, int64,\n               const string &, const string &>;\n\ntemplate <class Arc>\nvoid PdtReplace(PdtReplaceArgs *args) {\n  const auto &untyped_pairs = std::get<0>(*args);\n  auto size = untyped_pairs.size();\n  std::vector<std::pair<typename Arc::Label, const Fst<Arc> *>> typed_pairs(\n      size);\n  for (size_t i = 0; i < size; ++i) {\n    typed_pairs[i].first = untyped_pairs[i].first;\n    typed_pairs[i].second = untyped_pairs[i].second->GetFst<Arc>();\n  }\n  MutableFst<Arc> *ofst = std::get<1>(*args)->GetMutableFst<Arc>();\n  std::vector<std::pair<typename Arc::Label, typename Arc::Label>> typed_parens;\n  const PdtReplaceOptions<Arc> opts(std::get<3>(*args), std::get<4>(*args),\n                                    std::get<5>(*args), std::get<6>(*args),\n                                    std::get<7>(*args));\n  Replace(typed_pairs, ofst, &typed_parens, opts);\n  // Copies typed parens into arg3.\n  std::get<2>(*args)->resize(typed_parens.size());\n  std::copy(typed_parens.begin(), typed_parens.end(),\n            std::get<2>(*args)->begin());\n}\n\nvoid PdtReplace(const std::vector<LabelFstClassPair> &pairs,\n                MutableFstClass *ofst, std::vector<LabelPair> *parens,\n                int64 root, PdtParserType parser_type = PDT_LEFT_PARSER,\n                int64 start_paren_labels = kNoLabel,\n                const string &left_paren_prefix = \"(_\",\n                const string &right_paren_prefix = \"_)\");\n\nusing PdtReverseArgs =\n    std::tuple<const FstClass &, const std::vector<LabelPair> &,\n               MutableFstClass *>;\n\ntemplate <class Arc>\nvoid PdtReverse(PdtReverseArgs *args) {\n  const Fst<Arc> &fst = *(std::get<0>(*args).GetFst<Arc>());\n  MutableFst<Arc> *ofst = std::get<2>(*args)->GetMutableFst<Arc>();\n  // In case Arc::Label is not the same as FstClass::Label, we make a\n  // copy. Truncation may occur if FstClass::Label has more precision than\n  // Arc::Label.\n  std::vector<std::pair<typename Arc::Label, typename Arc::Label>> typed_parens(\n      std::get<1>(*args).size());\n  std::copy(std::get<1>(*args).begin(), std::get<1>(*args).end(),\n            typed_parens.begin());\n  Reverse(fst, typed_parens, ofst);\n}\n\nvoid PdtReverse(const FstClass &ifst, const std::vector<LabelPair> &,\n                MutableFstClass *ofst);\n\n// PDT SHORTESTPATH\n\nstruct PdtShortestPathOptions {\n  QueueType queue_type;\n  bool keep_parentheses;\n  bool path_gc;\n\n  PdtShortestPathOptions(QueueType qt = FIFO_QUEUE, bool kp = false,\n                         bool gc = true)\n      : queue_type(qt), keep_parentheses(kp), path_gc(gc) {}\n};\n\nusing PdtShortestPathArgs =\n    std::tuple<const FstClass &, const std::vector<LabelPair> &,\n               MutableFstClass *, const PdtShortestPathOptions &>;\n\ntemplate <class Arc>\nvoid PdtShortestPath(PdtShortestPathArgs *args) {\n  const Fst<Arc> &fst = *(std::get<0>(*args).GetFst<Arc>());\n  MutableFst<Arc> *ofst = std::get<2>(*args)->GetMutableFst<Arc>();\n  const PdtShortestPathOptions &opts = std::get<3>(*args);\n  // In case Arc::Label is not the same as FstClass::Label, we make a\n  // copy. Truncation may occur if FstClass::Label has more precision than\n  // Arc::Label.\n  std::vector<std::pair<typename Arc::Label, typename Arc::Label>> typed_parens(\n      std::get<1>(*args).size());\n  std::copy(std::get<1>(*args).begin(), std::get<1>(*args).end(),\n            typed_parens.begin());\n  switch (opts.queue_type) {\n    default:\n      FSTERROR() << \"Unknown queue type: \" << opts.queue_type;\n    case FIFO_QUEUE: {\n      using Queue = FifoQueue<typename Arc::StateId>;\n      fst::PdtShortestPathOptions<Arc, Queue> spopts(opts.keep_parentheses,\n                                                         opts.path_gc);\n      ShortestPath(fst, typed_parens, ofst, spopts);\n      return;\n    }\n    case LIFO_QUEUE: {\n      using Queue = LifoQueue<typename Arc::StateId>;\n      fst::PdtShortestPathOptions<Arc, Queue> spopts(opts.keep_parentheses,\n                                                         opts.path_gc);\n      ShortestPath(fst, typed_parens, ofst, spopts);\n      return;\n    }\n    case STATE_ORDER_QUEUE: {\n      using Queue = StateOrderQueue<typename Arc::StateId>;\n      fst::PdtShortestPathOptions<Arc, Queue> spopts(opts.keep_parentheses,\n                                                         opts.path_gc);\n      ShortestPath(fst, typed_parens, ofst, spopts);\n      return;\n    }\n  }\n}\n\nvoid PdtShortestPath(const FstClass &ifst,\n    const std::vector<LabelPair> &parens, MutableFstClass *ofst,\n    const PdtShortestPathOptions &opts = PdtShortestPathOptions());\n\n// PRINT INFO\n\nusing PrintPdtInfoArgs =\n    std::pair<const FstClass &, const std::vector<LabelPair> &>;\n\ntemplate <class Arc>\nvoid PrintPdtInfo(PrintPdtInfoArgs *args) {\n  const Fst<Arc> &fst = *(std::get<0>(*args).GetFst<Arc>());\n  // In case Arc::Label is not the same as FstClass::Label, we make a\n  // copy. Truncation may occur if FstClass::Label has more precision than\n  // Arc::Label.\n  std::vector<std::pair<typename Arc::Label, typename Arc::Label>> typed_parens(\n      std::get<1>(*args).size());\n  std::copy(std::get<1>(*args).begin(), std::get<1>(*args).end(),\n            typed_parens.begin());\n  PdtInfo<Arc> pdtinfo(fst, typed_parens);\n  PrintPdtInfo(pdtinfo);\n}\n\nvoid PrintPdtInfo(const FstClass &ifst, const std::vector<LabelPair> &parens);\n\n}  // namespace script\n}  // namespace fst\n\n#define REGISTER_FST_PDT_OPERATIONS(ArcType)                             \\\n  REGISTER_FST_OPERATION(PdtCompose, ArcType, PdtComposeArgs);           \\\n  REGISTER_FST_OPERATION(PdtExpand, ArcType, PdtExpandArgs);             \\\n  REGISTER_FST_OPERATION(PdtReplace, ArcType, PdtReplaceArgs);           \\\n  REGISTER_FST_OPERATION(PdtReverse, ArcType, PdtReverseArgs);           \\\n  REGISTER_FST_OPERATION(PdtShortestPath, ArcType, PdtShortestPathArgs); \\\n  REGISTER_FST_OPERATION(PrintPdtInfo, ArcType, PrintPdtInfoArgs)\n#endif  // FST_EXTENSIONS_PDT_PDTSCRIPT_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/extensions/pdt/replace.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Recursively replaces FST arcs with other FSTs, returning a PDT.\n\n#ifndef FST_EXTENSIONS_PDT_REPLACE_H_\n#define FST_EXTENSIONS_PDT_REPLACE_H_\n\n#include <map>\n#include <memory>\n#include <set>\n#include <unordered_map>\n#include <utility>\n#include <vector>\n\n#include <fst/replace.h>\n#include <fst/replace-util.h>\n#include <fst/symbol-table-ops.h>\n\nnamespace fst {\nnamespace internal {\n\n// Hash to paren IDs\ntemplate <typename S>\nstruct ReplaceParenHash {\n  size_t operator()(const std::pair<size_t, S> &paren) const {\n    static constexpr auto prime = 7853;\n    return paren.first + paren.second * prime;\n  }\n};\n\n}  // namespace internal\n\n// Parser types characterize the PDT construction method. When applied to a CFG,\n// each non-terminal is encoded as a DFA that accepts precisely the RHS's of\n// productions of that non-terminal. For parsing (rather than just recognition),\n// production numbers can used as outputs (placed as early as possible) in the\n// DFAs promoted to DFTs. For more information on the strongly regular\n// construction, see:\n//\n// Mohri, M., and Pereira, F. 1998. Dynamic compilation of weighted context-free\n// grammars. In Proc. ACL, pages 891-897.\nenum PdtParserType {\n  // Top-down construction. Applied to a simple LL(1) grammar (among others),\n  // gives a DPDA. If promoted to a DPDT, with outputs being production\n  // numbers, gives a leftmost derivation. Left recursive grammars are\n  // problematic in use.\n  PDT_LEFT_PARSER,\n\n  // Top-down construction. Similar to PDT_LEFT_PARSE except bounded-stack\n  // (expandable as an FST) result with regular or, more generally, strongly\n  // regular grammars. Epsilons may replace some parentheses, which may\n  // introduce some non-determinism.\n  PDT_LEFT_SR_PARSER,\n\n  /* TODO(riley):\n  // Bottom-up construction. Applied to a LR(0) grammar, gives a DPDA.\n  // If promoted to a DPDT, with outputs being the production nubmers,\n  // gives the reverse of a rightmost derivation.\n  PDT_RIGHT_PARSER,\n  */\n};\n\ntemplate <class Arc>\nstruct PdtReplaceOptions {\n  using Label = typename Arc::Label;\n\n  explicit PdtReplaceOptions(Label root,\n                             PdtParserType type = PDT_LEFT_PARSER,\n                             Label start_paren_labels = kNoLabel,\n                             string left_paren_prefix = \"(_\",\n                             string right_paren_prefix = \")_\") :\n      root(root), type(type), start_paren_labels(start_paren_labels),\n      left_paren_prefix(std::move(left_paren_prefix)),\n      right_paren_prefix(std::move(right_paren_prefix)) {}\n\n  Label root;\n  PdtParserType type;\n  Label start_paren_labels;\n  const string left_paren_prefix;\n  const string right_paren_prefix;\n};\n\n// PdtParser: Base PDT parser class common to specific parsers.\n\ntemplate <class Arc>\nclass PdtParser {\n public:\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n  using LabelFstPair = std::pair<Label, const Fst<Arc> *>;\n  using LabelPair = std::pair<Label, Label>;\n  using LabelStatePair = std::pair<Label, StateId>;\n  using StateWeightPair = std::pair<StateId, Weight>;\n  using ParenKey = std::pair<size_t, StateId>;\n  using ParenMap =\n      std::unordered_map<ParenKey, size_t, internal::ReplaceParenHash<StateId>>;\n\n  PdtParser(const std::vector<LabelFstPair> &fst_array,\n            const PdtReplaceOptions<Arc> &opts) :\n      root_(opts.root), start_paren_labels_(opts.start_paren_labels),\n      left_paren_prefix_(std::move(opts.left_paren_prefix)),\n      right_paren_prefix_(std::move(opts.right_paren_prefix)),\n      error_(false) {\n    for (size_t i = 0; i < fst_array.size(); ++i) {\n      if (!CompatSymbols(fst_array[0].second->InputSymbols(),\n                         fst_array[i].second->InputSymbols())) {\n        FSTERROR() << \"PdtParser: Input symbol table of input FST \" << i\n                   << \" does not match input symbol table of 0th input FST\";\n        error_ = true;\n      }\n      if (!CompatSymbols(fst_array[0].second->OutputSymbols(),\n                         fst_array[i].second->OutputSymbols())) {\n        FSTERROR() << \"PdtParser: Output symbol table of input FST \" << i\n                   << \" does not match input symbol table of 0th input FST\";\n        error_ = true;\n      }\n      fst_array_.emplace_back(fst_array[i].first, fst_array[i].second->Copy());\n      // Builds map from non-terminal label to FST ID.\n      label2id_[fst_array[i].first] = i;\n    }\n  }\n\n  virtual ~PdtParser() {\n    for (auto &pair : fst_array_) delete pair.second;\n  }\n\n  // Constructs the output PDT, dependent on the derived parser type.\n  virtual void GetParser(MutableFst<Arc> *ofst,\n                         std::vector<LabelPair> *parens) = 0;\n\n protected:\n  const std::vector<LabelFstPair> &FstArray() const { return fst_array_; }\n\n  Label Root() const { return root_; }\n\n  // Maps from non-terminal label to corresponding FST ID, or returns\n  // kNoStateId to signal lookup failure.\n  StateId Label2Id(Label l) const {\n    auto it = label2id_.find(l);\n    return it == label2id_.end() ? kNoStateId : it->second;\n  }\n\n  // Maps from output state to input FST label, state pair, or returns a\n  // (kNoLabel, kNoStateId) pair to signal lookup failure.\n  LabelStatePair GetLabelStatePair(StateId os) const {\n    if (os >= label_state_pairs_.size()) {\n      static const LabelStatePair no_pair(kNoLabel, kNoLabel);\n      return no_pair;\n    } else {\n      return label_state_pairs_[os];\n    }\n  }\n\n  // Maps to output state from input FST (label, state) pair, or returns\n  // kNoStateId to signal lookup failure.\n  StateId GetState(const LabelStatePair &lsp) const {\n    auto it = state_map_.find(lsp);\n    if (it == state_map_.end()) {\n      return kNoStateId;\n    } else {\n      return it->second;\n    }\n  }\n\n  // Builds single FST combining all referenced input FSTs, leaving in the\n  // non-termnals for now; also tabulates the PDT states that correspond to the\n  // start and final states of the input FSTs.\n  void CreateFst(MutableFst<Arc> *ofst, std::vector<StateId> *open_dest,\n                 std::vector<std::vector<StateWeightPair>> *close_src);\n\n  // Assigns parenthesis labels from total allocated paren IDs.\n  void AssignParenLabels(size_t total_nparens, std::vector<LabelPair> *parens) {\n    parens->clear();\n    for (size_t paren_id = 0; paren_id < total_nparens; ++paren_id) {\n      const auto open_paren = start_paren_labels_ + paren_id;\n      const auto close_paren = open_paren + total_nparens;\n      parens->emplace_back(open_paren, close_paren);\n    }\n  }\n\n  // Determines how non-terminal instances are assigned parentheses IDs.\n  virtual size_t AssignParenIds(const Fst<Arc> &ofst,\n                                ParenMap *paren_map) const = 0;\n\n  // Changes a non-terminal transition to an open parenthesis transition\n  // redirected to the PDT state specified in the open_dest argument, when\n  // indexed by the input FST ID for the non-terminal. Adds close parenthesis\n  // transitions (with specified weights) from the PDT states specified in the\n  // close_src argument, when indexed by the input FST ID for the non-terminal,\n  // to the former destination state of the non-terminal transition. The\n  // paren_map argument gives the parenthesis ID for a given non-terminal FST ID\n  // and destination state pair. The close_non_term_weight vector specifies\n  // non-terminals for which the non-terminal arc weight should be applied on\n  // the close parenthesis (multiplying the close_src weight above) rather than\n  // on the open parenthesis. If no paren ID is found, then an epsilon replaces\n  // the parenthesis that would carry the non-terminal arc weight and the other\n  // parenthesis is omitted (appropriate for the strongly-regular case).\n  void AddParensToFst(\n      const std::vector<LabelPair> &parens,\n      const ParenMap &paren_map,\n      const std::vector<StateId> &open_dest,\n      const std::vector<std::vector<StateWeightPair>> &close_src,\n      const std::vector<bool> &close_non_term_weight,\n      MutableFst<Arc> *ofst);\n\n  // Ensures that parentheses arcs are added to the symbol table.\n  void AddParensToSymbolTables(const std::vector<LabelPair> &parens,\n                               MutableFst<Arc> *ofst);\n\n private:\n  std::vector<LabelFstPair> fst_array_;\n  Label root_;\n  // Index to use for the first parenthesis.\n  Label start_paren_labels_;\n  const string left_paren_prefix_;\n  const string right_paren_prefix_;\n  // Maps from non-terminal label to FST ID.\n  std::unordered_map<Label, StateId> label2id_;\n  // Given an output state, specifies the input FST (label, state) pair.\n  std::vector<LabelStatePair> label_state_pairs_;\n  // Given an FST (label, state) pair, specifies the output FST state ID.\n  std::map<LabelStatePair, StateId> state_map_;\n  bool error_;\n};\n\ntemplate <class Arc>\nvoid PdtParser<Arc>::CreateFst(\n    MutableFst<Arc> *ofst, std::vector<StateId> *open_dest,\n    std::vector<std::vector<StateWeightPair>> *close_src) {\n  ofst->DeleteStates();\n  if (error_) {\n    ofst->SetProperties(kError, kError);\n    return;\n  }\n  open_dest->resize(fst_array_.size(), kNoStateId);\n  close_src->resize(fst_array_.size());\n  // Queue of non-terminals to replace.\n  std::deque<Label> non_term_queue;\n  non_term_queue.push_back(root_);\n  // Has a non-terminal been enqueued?\n  std::vector<bool> enqueued(fst_array_.size(), false);\n  enqueued[label2id_[root_]] = true;\n  Label max_label = kNoLabel;\n  for (StateId soff = 0; !non_term_queue.empty(); soff = ofst->NumStates()) {\n    const auto label = non_term_queue.front();\n    non_term_queue.pop_front();\n    StateId fst_id = Label2Id(label);\n    const auto *ifst = fst_array_[fst_id].second;\n    for (StateIterator<Fst<Arc>> siter(*ifst); !siter.Done(); siter.Next()) {\n      const auto is = siter.Value();\n      const auto os = ofst->AddState();\n      const LabelStatePair lsp(label, is);\n      label_state_pairs_.push_back(lsp);\n      state_map_[lsp] = os;\n      if (is == ifst->Start()) {\n        (*open_dest)[fst_id] = os;\n        if (label == root_) ofst->SetStart(os);\n      }\n      if (ifst->Final(is) != Weight::Zero()) {\n        if (label == root_) ofst->SetFinal(os, ifst->Final(is));\n        (*close_src)[fst_id].emplace_back(os, ifst->Final(is));\n      }\n      for (ArcIterator<Fst<Arc>> aiter(*ifst, is); !aiter.Done();\n           aiter.Next()) {\n        auto arc = aiter.Value();\n        arc.nextstate += soff;\n        if (max_label == kNoLabel || arc.olabel > max_label)\n          max_label = arc.olabel;\n        const auto nfst_id = Label2Id(arc.olabel);\n        if (nfst_id != kNoStateId) {\n          if (fst_array_[nfst_id].second->Start() == kNoStateId) continue;\n          if (!enqueued[nfst_id]) {\n            non_term_queue.push_back(arc.olabel);\n            enqueued[nfst_id] = true;\n          }\n        }\n        ofst->AddArc(os, arc);\n      }\n    }\n  }\n  if (start_paren_labels_ == kNoLabel)\n    start_paren_labels_ = max_label + 1;\n}\n\ntemplate <class Arc>\nvoid PdtParser<Arc>::AddParensToFst(\n    const std::vector<LabelPair> &parens,\n    const ParenMap &paren_map,\n    const std::vector<StateId> &open_dest,\n    const std::vector<std::vector<StateWeightPair>> &close_src,\n    const std::vector<bool> &close_non_term_weight,\n    MutableFst<Arc> *ofst) {\n  StateId dead_state = kNoStateId;\n  using MIter = MutableArcIterator<MutableFst<Arc>>;\n  for (StateIterator<Fst<Arc>> siter(*ofst); !siter.Done(); siter.Next()) {\n    StateId os = siter.Value();\n    std::unique_ptr<MIter> aiter(new MIter(ofst, os));\n    for (auto n = 0; !aiter->Done(); aiter->Next(), ++n) {\n      const auto arc = aiter->Value();  // A reference here may go stale.\n      StateId nfst_id = Label2Id(arc.olabel);\n      if (nfst_id != kNoStateId) {\n        // Gets parentheses.\n        const ParenKey paren_key(nfst_id, arc.nextstate);\n        auto it = paren_map.find(paren_key);\n        Label open_paren = 0;\n        Label close_paren = 0;\n        if (it != paren_map.end()) {\n          const auto paren_id = it->second;\n          open_paren = parens[paren_id].first;\n          close_paren = parens[paren_id].second;\n        }\n        // Sets open parenthesis.\n        if (open_paren != 0 || !close_non_term_weight[nfst_id]) {\n          const auto open_weight =\n              close_non_term_weight[nfst_id] ? Weight::One() : arc.weight;\n          const Arc sarc(open_paren, open_paren, open_weight,\n                         open_dest[nfst_id]);\n          aiter->SetValue(sarc);\n        } else {\n          if (dead_state == kNoStateId) {\n            dead_state = ofst->AddState();\n          }\n          const Arc sarc(0, 0, Weight::One(), dead_state);\n          aiter->SetValue(sarc);\n        }\n        // Adds close parentheses.\n        if (close_paren != 0 || close_non_term_weight[nfst_id]) {\n          for (size_t i = 0; i < close_src[nfst_id].size(); ++i) {\n            const auto &pair = close_src[nfst_id][i];\n            const auto close_weight = close_non_term_weight[nfst_id]\n                                          ? Times(arc.weight, pair.second)\n                                          : pair.second;\n            const Arc farc(close_paren, close_paren, close_weight,\n                           arc.nextstate);\n\n            ofst->AddArc(pair.first, farc);\n            if (os == pair.first) {  // Invalidated iterator.\n              aiter.reset(new MIter(ofst, os));\n              aiter->Seek(n);\n            }\n          }\n        }\n      }\n    }\n  }\n}\n\ntemplate <class Arc>\nvoid PdtParser<Arc>::AddParensToSymbolTables(\n    const std::vector<LabelPair> &parens, MutableFst<Arc> *ofst) {\n  auto size = parens.size();\n  if (ofst->InputSymbols()) {\n    if (!AddAuxiliarySymbols(left_paren_prefix_, start_paren_labels_, size,\n                             ofst->MutableInputSymbols())) {\n      ofst->SetProperties(kError, kError);\n      return;\n    }\n    if (!AddAuxiliarySymbols(right_paren_prefix_, start_paren_labels_ + size,\n                             size, ofst->MutableInputSymbols())) {\n      ofst->SetProperties(kError, kError);\n      return;\n    }\n  }\n  if (ofst->OutputSymbols()) {\n    if (!AddAuxiliarySymbols(left_paren_prefix_, start_paren_labels_, size,\n                             ofst->MutableOutputSymbols())) {\n      ofst->SetProperties(kError, kError);\n      return;\n    }\n    if (!AddAuxiliarySymbols(right_paren_prefix_, start_paren_labels_ + size,\n                             size, ofst->MutableOutputSymbols())) {\n      ofst->SetProperties(kError, kError);\n      return;\n    }\n  }\n}\n\n// Builds a PDT by recursive replacement top-down, where the call and return are\n// encoded in the parentheses.\ntemplate <class Arc>\nclass PdtLeftParser final : public PdtParser<Arc> {\n public:\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n  using LabelFstPair = typename PdtParser<Arc>::LabelFstPair;\n  using LabelPair = typename PdtParser<Arc>::LabelPair;\n  using LabelStatePair = typename PdtParser<Arc>::LabelStatePair;\n  using StateWeightPair = typename PdtParser<Arc>::StateWeightPair;\n  using ParenKey = typename PdtParser<Arc>::ParenKey;\n  using ParenMap = typename PdtParser<Arc>::ParenMap;\n\n  using PdtParser<Arc>::AddParensToFst;\n  using PdtParser<Arc>::AddParensToSymbolTables;\n  using PdtParser<Arc>::AssignParenLabels;\n  using PdtParser<Arc>::CreateFst;\n  using PdtParser<Arc>::FstArray;\n  using PdtParser<Arc>::GetLabelStatePair;\n  using PdtParser<Arc>::GetState;\n  using PdtParser<Arc>::Label2Id;\n  using PdtParser<Arc>::Root;\n\n  PdtLeftParser(const std::vector<LabelFstPair> &fst_array,\n                const PdtReplaceOptions<Arc> &opts) :\n      PdtParser<Arc>(fst_array, opts) { }\n\n  void GetParser(MutableFst<Arc> *ofst,\n                 std::vector<LabelPair> *parens) override;\n\n protected:\n  // Assigns a unique parenthesis ID for each non-terminal, destination\n  // state pair.\n  size_t AssignParenIds(const Fst<Arc> &ofst,\n                        ParenMap *paren_map) const override;\n};\n\ntemplate <class Arc>\nvoid PdtLeftParser<Arc>::GetParser(\n    MutableFst<Arc> *ofst,\n    std::vector<LabelPair> *parens) {\n  ofst->DeleteStates();\n  parens->clear();\n  const auto &fst_array = FstArray();\n  // Map that gives the paren ID for a (non-terminal, dest. state) pair\n  // (which can be unique).\n  ParenMap paren_map;\n  // Specifies the open parenthesis destination state for a given non-terminal.\n  // The source is the non-terminal instance source state.\n  std::vector<StateId> open_dest(fst_array.size(), kNoStateId);\n  // Specifies close parenthesis source states and weights for a given\n  // non-terminal. The destination is the non-terminal instance destination\n  // state.\n  std::vector<std::vector<StateWeightPair>> close_src(fst_array.size());\n  // Specifies non-terminals for which the non-terminal arc weight\n  // should be applied on the close parenthesis (multiplying the\n  // 'close_src' weight above) rather than on the open parenthesis.\n  std::vector<bool> close_non_term_weight(fst_array.size(), false);\n  CreateFst(ofst, &open_dest, &close_src);\n  auto total_nparens = AssignParenIds(*ofst, &paren_map);\n  AssignParenLabels(total_nparens, parens);\n  AddParensToFst(*parens, paren_map, open_dest, close_src,\n                 close_non_term_weight, ofst);\n  if (!fst_array.empty()) {\n    ofst->SetInputSymbols(fst_array[0].second->InputSymbols());\n    ofst->SetOutputSymbols(fst_array[0].second->OutputSymbols());\n  }\n  AddParensToSymbolTables(*parens, ofst);\n}\n\ntemplate <class Arc>\nsize_t PdtLeftParser<Arc>::AssignParenIds(\n    const Fst<Arc> &ofst,\n    ParenMap *paren_map) const {\n  // Number of distinct parenthesis pairs per FST.\n  std::vector<size_t> nparens(FstArray().size(), 0);\n  // Number of distinct parenthesis pairs overall.\n  size_t total_nparens = 0;\n  for (StateIterator<Fst<Arc>> siter(ofst); !siter.Done(); siter.Next()) {\n    const auto os = siter.Value();\n    for (ArcIterator<Fst<Arc>> aiter(ofst, os); !aiter.Done(); aiter.Next()) {\n      const auto &arc = aiter.Value();\n      const auto nfst_id = Label2Id(arc.olabel);\n      if (nfst_id != kNoStateId) {\n        const ParenKey paren_key(nfst_id, arc.nextstate);\n        auto it = paren_map->find(paren_key);\n        if (it == paren_map->end()) {\n          // Assigns new paren ID for this (FST, dest state) pair.\n          (*paren_map)[paren_key] = nparens[nfst_id]++;\n          if (nparens[nfst_id] > total_nparens)\n            total_nparens = nparens[nfst_id];\n        }\n      }\n    }\n  }\n  return total_nparens;\n}\n\n// Similar to PdtLeftParser but:\n//\n// 1. Uses epsilons rather than parentheses labels for any non-terminal\n//    instances within a left- (right-) linear dependency SCC,\n// 2. Allocates a paren ID uniquely for each such dependency SCC (rather than\n//    non-terminal = dependency state) and destination state.\ntemplate <class Arc>\nclass PdtLeftSRParser final : public PdtParser<Arc> {\n public:\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n  using LabelFstPair = typename PdtParser<Arc>::LabelFstPair;\n  using LabelPair = typename PdtParser<Arc>::LabelPair;\n  using LabelStatePair = typename PdtParser<Arc>::LabelStatePair;\n  using StateWeightPair = typename PdtParser<Arc>::StateWeightPair;\n  using ParenKey = typename PdtParser<Arc>::ParenKey;\n  using ParenMap = typename PdtParser<Arc>::ParenMap;\n\n  using PdtParser<Arc>::AddParensToFst;\n  using PdtParser<Arc>::AddParensToSymbolTables;\n  using PdtParser<Arc>::AssignParenLabels;\n  using PdtParser<Arc>::CreateFst;\n  using PdtParser<Arc>::FstArray;\n  using PdtParser<Arc>::GetLabelStatePair;\n  using PdtParser<Arc>::GetState;\n  using PdtParser<Arc>::Label2Id;\n  using PdtParser<Arc>::Root;\n\n  PdtLeftSRParser(const std::vector<LabelFstPair> &fst_array,\n                  const PdtReplaceOptions<Arc> &opts) :\n      PdtParser<Arc>(fst_array, opts),\n      replace_util_(fst_array, ReplaceUtilOptions(opts.root)) { }\n\n  void GetParser(MutableFst<Arc> *ofst,\n                 std::vector<LabelPair> *parens) override;\n\n protected:\n  // Assigns a unique parenthesis ID for each non-terminal, destination state\n  // pair when the non-terminal refers to a non-linear FST. Otherwise, assigns\n  // a unique parenthesis ID for each dependency SCC, destination state pair if\n  // the non-terminal instance is between\n  // SCCs. Otherwise does nothing.\n  size_t AssignParenIds(const Fst<Arc> &ofst,\n                        ParenMap *paren_map) const override;\n\n  // Returns dependency SCC for given label.\n  size_t SCC(Label label) const { return replace_util_.SCC(label); }\n\n  // Is a given dependency SCC left-linear?\n  bool SCCLeftLinear(size_t scc_id) const {\n    const auto ll_props = kReplaceSCCLeftLinear | kReplaceSCCNonTrivial;\n    const auto scc_props = replace_util_.SCCProperties(scc_id);\n    return (scc_props & ll_props) == ll_props;\n  }\n\n  // Is a given dependency SCC right-linear?\n  bool SCCRightLinear(size_t scc_id) const {\n    const auto lr_props = kReplaceSCCRightLinear | kReplaceSCCNonTrivial;\n    const auto scc_props = replace_util_.SCCProperties(scc_id);\n    return (scc_props & lr_props) == lr_props;\n  }\n\n  // Components of left- (right-) linear dependency SCC; empty o.w.\n  const std::vector<size_t> &SCCComps(size_t scc_id) const {\n    if (scc_comps_.empty()) GetSCCComps();\n    return scc_comps_[scc_id];\n  }\n\n  // Returns the representative state of an SCC. For left-linear grammars, it\n  // is one of the initial states. For right-linear grammars, it is one of the\n  // non-terminal destination states; otherwise, it is kNoStateId.\n  StateId RepState(size_t scc_id) const {\n    if (SCCComps(scc_id).empty()) return kNoStateId;\n    const auto fst_id = SCCComps(scc_id).front();\n    const auto &fst_array = FstArray();\n    const auto label = fst_array[fst_id].first;\n    const auto *ifst = fst_array[fst_id].second;\n    if (SCCLeftLinear(scc_id)) {\n      const LabelStatePair lsp(label, ifst->Start());\n      return GetState(lsp);\n    } else {  // Right-linear.\n      const LabelStatePair lsp(label, *NonTermDests(fst_id).begin());\n      return GetState(lsp);\n    }\n    return kNoStateId;\n  }\n\n private:\n  // Merges initial (final) states of in a left- (right-) linear dependency SCC\n  // after dealing with the non-terminal arc and final weights.\n  void ProcSCCs(MutableFst<Arc> *ofst,\n                std::vector<StateId> *open_dest,\n                std::vector<std::vector<StateWeightPair>> *close_src,\n                std::vector<bool> *close_non_term_weight) const;\n\n  // Computes components of left- (right-) linear dependency SCC.\n  void GetSCCComps() const {\n    const std::vector<LabelFstPair> &fst_array = FstArray();\n    for (size_t i = 0; i < fst_array.size(); ++i) {\n      const auto label = fst_array[i].first;\n      const auto scc_id = SCC(label);\n      if (scc_comps_.size() <= scc_id) scc_comps_.resize(scc_id + 1);\n      if (SCCLeftLinear(scc_id) || SCCRightLinear(scc_id)) {\n        scc_comps_[scc_id].push_back(i);\n      }\n    }\n  }\n\n  const std::set<StateId> &NonTermDests(StateId fst_id) const {\n    if (non_term_dests_.empty()) GetNonTermDests();\n    return non_term_dests_[fst_id];\n  }\n\n  // Finds non-terminal destination states for right-linear FSTS, or does\n  // nothing if not found.\n  void GetNonTermDests() const;\n\n  // Dependency SCC info.\n  mutable ReplaceUtil<Arc> replace_util_;\n  // Components of left- (right-) linear dependency SCCs, or empty otherwise.\n  mutable std::vector<std::vector<size_t>> scc_comps_;\n  // States that have non-terminals entering them for each (right-linear) FST.\n  mutable std::vector<std::set<StateId>> non_term_dests_;\n};\n\ntemplate <class Arc>\nvoid PdtLeftSRParser<Arc>::GetParser(\n    MutableFst<Arc> *ofst,\n    std::vector<LabelPair> *parens) {\n  ofst->DeleteStates();\n  parens->clear();\n  const auto &fst_array = FstArray();\n  // Map that gives the paren ID for a (non-terminal, dest. state) pair.\n  ParenMap paren_map;\n  // Specifies the open parenthesis destination state for a given non-terminal.\n  // The source is the non-terminal instance source state.\n  std::vector<StateId> open_dest(fst_array.size(), kNoStateId);\n  // Specifies close parenthesis source states and weights for a given\n  // non-terminal. The destination is the non-terminal instance destination\n  // state.\n  std::vector<std::vector<StateWeightPair>> close_src(fst_array.size());\n  // Specifies non-terminals for which the non-terminal arc weight should be\n  // applied on the close parenthesis (multiplying the close_src weight above)\n  // rather than on the open parenthesis.\n  std::vector<bool> close_non_term_weight(fst_array.size(), false);\n  CreateFst(ofst, &open_dest, &close_src);\n  ProcSCCs(ofst, &open_dest, &close_src, &close_non_term_weight);\n  const auto total_nparens = AssignParenIds(*ofst, &paren_map);\n  AssignParenLabels(total_nparens, parens);\n  AddParensToFst(*parens, paren_map, open_dest, close_src,\n                 close_non_term_weight, ofst);\n  if (!fst_array.empty()) {\n    ofst->SetInputSymbols(fst_array[0].second->InputSymbols());\n    ofst->SetOutputSymbols(fst_array[0].second->OutputSymbols());\n  }\n  AddParensToSymbolTables(*parens, ofst);\n  Connect(ofst);\n}\n\ntemplate <class Arc>\nvoid PdtLeftSRParser<Arc>::ProcSCCs(\n    MutableFst<Arc> *ofst,\n    std::vector<StateId> *open_dest,\n    std::vector<std::vector<StateWeightPair>> *close_src,\n    std::vector<bool> *close_non_term_weight) const {\n  const auto &fst_array = FstArray();\n  for (StateIterator<Fst<Arc>> siter(*ofst); !siter.Done(); siter.Next()) {\n    const auto os = siter.Value();\n    const auto label = GetLabelStatePair(os).first;\n    const auto is = GetLabelStatePair(os).second;\n    const auto fst_id = Label2Id(label);\n    const auto scc_id = SCC(label);\n    const auto rs = RepState(scc_id);\n    const auto *ifst = fst_array[fst_id].second;\n    // SCC LEFT-LINEAR: puts non-terminal weights on close parentheses. Merges\n    // initial states into SCC representative state and updates open_dest.\n    if (SCCLeftLinear(scc_id)) {\n      (*close_non_term_weight)[fst_id] = true;\n      if (is == ifst->Start() && os != rs) {\n        for (ArcIterator<Fst<Arc>> aiter(*ofst, os); !aiter.Done();\n             aiter.Next()) {\n          const auto &arc = aiter.Value();\n          ofst->AddArc(rs, arc);\n        }\n        ofst->DeleteArcs(os);\n        if (os == ofst->Start())\n          ofst->SetStart(rs);\n        (*open_dest)[fst_id] = rs;\n      }\n    }\n    // SCC RIGHT-LINEAR: pushes back final weights onto non-terminals, if\n    // possible, or adds weighted epsilons to the SCC representative state.\n    // Merges final states into SCC representative state and updates close_src.\n    if (SCCRightLinear(scc_id)) {\n      for (MutableArcIterator<MutableFst<Arc>> aiter(ofst, os); !aiter.Done();\n           aiter.Next()) {\n        auto arc = aiter.Value();\n        const auto idest = GetLabelStatePair(arc.nextstate).second;\n        if (NonTermDests(fst_id).count(idest) > 0) {\n          if (ofst->Final(arc.nextstate) != Weight::Zero()) {\n            ofst->SetFinal(arc.nextstate, Weight::Zero());\n            ofst->SetFinal(rs, Weight::One());\n          }\n          arc.weight = Times(arc.weight, ifst->Final(idest));\n          arc.nextstate = rs;\n          aiter.SetValue(arc);\n        }\n      }\n      const auto final_weight = ifst->Final(is);\n      if (final_weight != Weight::Zero() &&\n          NonTermDests(fst_id).count(is) == 0) {\n        ofst->AddArc(os, Arc(0, 0, final_weight, rs));\n        if (ofst->Final(os) != Weight::Zero()) {\n          ofst->SetFinal(os, Weight::Zero());\n          ofst->SetFinal(rs, Weight::One());\n        }\n      }\n      if (is == ifst->Start()) {\n        (*close_src)[fst_id].clear();\n        (*close_src)[fst_id].emplace_back(rs, Weight::One());\n      }\n    }\n  }\n}\n\ntemplate <class Arc>\nvoid PdtLeftSRParser<Arc>::GetNonTermDests() const {\n  const auto &fst_array = FstArray();\n  non_term_dests_.resize(fst_array.size());\n  for (size_t fst_id = 0; fst_id < fst_array.size(); ++fst_id) {\n    const auto label = fst_array[fst_id].first;\n    const auto scc_id = SCC(label);\n    if (SCCRightLinear(scc_id)) {\n      const auto *ifst = fst_array[fst_id].second;\n      for (StateIterator<Fst<Arc>> siter(*ifst); !siter.Done(); siter.Next()) {\n        const auto is = siter.Value();\n        for (ArcIterator<Fst<Arc>> aiter(*ifst, is); !aiter.Done();\n             aiter.Next()) {\n          const auto &arc = aiter.Value();\n          if (Label2Id(arc.olabel) != kNoStateId) {\n            non_term_dests_[fst_id].insert(arc.nextstate);\n          }\n        }\n      }\n    }\n  }\n}\n\ntemplate <class Arc>\nsize_t PdtLeftSRParser<Arc>::AssignParenIds(\n    const Fst<Arc> &ofst,\n    ParenMap *paren_map) const {\n  const auto &fst_array = FstArray();\n  // Number of distinct parenthesis pairs per FST.\n  std::vector<size_t> nparens(fst_array.size(), 0);\n  // Number of distinct parenthesis pairs overall.\n  size_t total_nparens = 0;\n  for (StateIterator<Fst<Arc>> siter(ofst); !siter.Done(); siter.Next()) {\n    const auto os = siter.Value();\n    const auto label = GetLabelStatePair(os).first;\n    const auto scc_id = SCC(label);\n    for (ArcIterator<Fst<Arc>> aiter(ofst, os); !aiter.Done(); aiter.Next()) {\n      const auto &arc = aiter.Value();\n      const auto nfst_id = Label2Id(arc.olabel);\n      if (nfst_id != kNoStateId) {\n        size_t nscc_id = SCC(arc.olabel);\n        bool nscc_linear = !SCCComps(nscc_id).empty();\n        // Assigns a parenthesis ID for the non-terminal transition\n        // if the non-terminal belongs to a (left-/right-) linear dependency\n        // SCC or if the transition is in an FST from a different SCC\n        if (!nscc_linear || scc_id != nscc_id) {\n          // For (left-/right-) linear SCCs instead of using nfst_id, we\n          // will use its SCC prototype pfst_id for assigning distinct\n          // parenthesis IDs.\n          const auto pfst_id =\n              nscc_linear ? SCCComps(nscc_id).front() : nfst_id;\n          ParenKey paren_key(pfst_id, arc.nextstate);\n          const auto it = paren_map->find(paren_key);\n          if (it == paren_map->end()) {\n            // Assigns new paren ID for this (FST/SCC, dest. state) pair.\n            if (nscc_linear) {\n              // This is mapping we'll need, but we also store (harmlessly)\n              // for the prototype below so we can easily keep count per SCC.\n              const ParenKey nparen_key(nfst_id, arc.nextstate);\n              (*paren_map)[nparen_key] = nparens[pfst_id];\n            }\n            (*paren_map)[paren_key] = nparens[pfst_id]++;\n            if (nparens[pfst_id] > total_nparens) {\n              total_nparens = nparens[pfst_id];\n            }\n          }\n        }\n      }\n    }\n  }\n  return total_nparens;\n}\n\n// Builds a pushdown transducer (PDT) from an RTN specification. The result is\n// a PDT written to a mutable FST where some transitions are labeled with\n// open or close parentheses. To be interpreted as a PDT, the parens must\n// balance on a path (see PdtExpand()). The open/close parenthesis label pairs\n// are returned in the parens argument.\ntemplate <class Arc>\nvoid Replace(\n    const std::vector<std::pair<typename Arc::Label, const Fst<Arc> *>>\n        &ifst_array,\n    MutableFst<Arc> *ofst,\n    std::vector<std::pair<typename Arc::Label, typename Arc::Label>> *parens,\n    const PdtReplaceOptions<Arc> &opts) {\n  switch (opts.type) {\n    case PDT_LEFT_PARSER:\n      {\n        PdtLeftParser<Arc> pr(ifst_array, opts);\n        pr.GetParser(ofst, parens);\n        return;\n      }\n    case PDT_LEFT_SR_PARSER:\n      {\n        PdtLeftSRParser<Arc> pr(ifst_array, opts);\n        pr.GetParser(ofst, parens);\n        return;\n      }\n    default:\n      FSTERROR() << \"Replace: Unknown PDT parser type: \" << opts.type;\n      ofst->DeleteStates();\n      ofst->SetProperties(kError, kError);\n      parens->clear();\n      return;\n  }\n}\n\n// Variant where the only user-controlled arguments is the root ID.\ntemplate <class Arc>\nvoid Replace(\n    const std::vector<std::pair<typename Arc::Label, const Fst<Arc> *>>\n        &ifst_array,\n    MutableFst<Arc> *ofst,\n    std::vector<std::pair<typename Arc::Label, typename Arc::Label>> *parens,\n    typename Arc::Label root) {\n  PdtReplaceOptions<Arc> opts(root);\n  Replace(ifst_array, ofst, parens, opts);\n}\n\n}  // namespace fst\n\n#endif  // FST_EXTENSIONS_PDT_REPLACE_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/extensions/pdt/reverse.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Expands a PDT to an FST.\n\n#ifndef FST_EXTENSIONS_PDT_REVERSE_H_\n#define FST_EXTENSIONS_PDT_REVERSE_H_\n\n#include <vector>\n\n#include <fst/mutable-fst.h>\n#include <fst/relabel.h>\n#include <fst/reverse.h>\n\nnamespace fst {\n\n// Reverses a pushdown transducer (PDT) encoded as an FST.\ntemplate <class Arc, class RevArc>\nvoid Reverse(const Fst<Arc> &ifst,\n             const std::vector<\n                 std::pair<typename Arc::Label, typename Arc::Label>> &parens,\n             MutableFst<RevArc> *ofst) {\n  using Label = typename Arc::Label;\n  // Reverses FST component.\n  Reverse(ifst, ofst);\n  // Exchanges open and close parenthesis pairs.\n  std::vector<std::pair<Label, Label>> relabel_pairs;\n  relabel_pairs.reserve(2 * parens.size());\n  for (const auto &pair : parens) {\n    relabel_pairs.emplace_back(pair.first, pair.second);\n    relabel_pairs.emplace_back(pair.second, pair.first);\n  }\n  Relabel(ofst, relabel_pairs, relabel_pairs);\n}\n\n}  // namespace fst\n\n#endif  // FST_EXTENSIONS_PDT_REVERSE_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/extensions/pdt/shortest-path.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Functions to find shortest paths in a PDT.\n\n#ifndef FST_EXTENSIONS_PDT_SHORTEST_PATH_H_\n#define FST_EXTENSIONS_PDT_SHORTEST_PATH_H_\n\n#include <stack>\n#include <unordered_map>\n#include <utility>\n#include <vector>\n\n#include <fst/log.h>\n\n#include <fst/extensions/pdt/paren.h>\n#include <fst/extensions/pdt/pdt.h>\n#include <fst/shortest-path.h>\n\nnamespace fst {\n\ntemplate <class Arc, class Queue>\nstruct PdtShortestPathOptions {\n  bool keep_parentheses;\n  bool path_gc;\n\n  PdtShortestPathOptions(bool keep_parentheses = false, bool path_gc = true)\n      : keep_parentheses(keep_parentheses), path_gc(path_gc) {}\n};\n\nnamespace internal {\n\n// Flags for shortest path data.\n\nconstexpr uint8 kPdtInited = 0x01;\nconstexpr uint8 kPdtFinal = 0x02;\nconstexpr uint8 kPdtMarked = 0x04;\n\n// Stores shortest path tree info Distance(), Parent(), and ArcParent()\n// information keyed on two types:\n//\n// 1. SearchState: This is a usual node in a shortest path tree but:\n//    a. is w.r.t a PDT search state (a pair of a PDT state and a \"start\" state,\n//    either the PDT start state or the destination state of an open\n//    parenthesis).\n//    b. the Distance() is from this \"start\" state to the search state.\n//    c. Parent().state is kNoLabel for the \"start\" state.\n//\n// 2. ParenSpec: This connects shortest path trees depending on the the\n// parenthesis taken. Given the parenthesis spec:\n//    a. the Distance() is from the Parent() \"start\" state to the parenthesis\n//    destination state.\n//    b. The ArcParent() is the parenthesis arc.\ntemplate <class Arc>\nclass PdtShortestPathData {\n public:\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  struct SearchState {\n    StateId state;  // PDT state.\n    StateId start;  // PDT paren \"start\" state.\n\n    SearchState(StateId s = kNoStateId, StateId t = kNoStateId)\n        : state(s), start(t) {}\n\n    bool operator==(const SearchState &other) const {\n      if (&other == this) return true;\n      return other.state == state && other.start == start;\n    }\n  };\n\n  // Specifies paren ID, source and dest \"start\" states of a paren. These are\n  // the \"start\" states of the respective sub-graphs.\n  struct ParenSpec {\n    ParenSpec(Label paren_id = kNoLabel, StateId src_start = kNoStateId,\n              StateId dest_start = kNoStateId)\n        : paren_id(paren_id), src_start(src_start), dest_start(dest_start) {}\n\n    Label paren_id;\n    StateId src_start;   // Sub-graph \"start\" state for paren source.\n    StateId dest_start;  // Sub-graph \"start\" state for paren dest.\n\n    bool operator==(const ParenSpec &other) const {\n      if (&other == this) return true;\n      return (other.paren_id == paren_id &&\n              other.src_start == other.src_start &&\n              other.dest_start == dest_start);\n    }\n  };\n\n  struct SearchData {\n    SearchData()\n        : distance(Weight::Zero()),\n          parent(kNoStateId, kNoStateId),\n          paren_id(kNoLabel),\n          flags(0) {}\n\n    Weight distance;     // Distance to this state from PDT \"start\" state.\n    SearchState parent;  // Parent state in shortest path tree.\n    int16 paren_id;      // If parent arc has paren, paren ID (or kNoLabel).\n    uint8 flags;         // First byte reserved for PdtShortestPathData use.\n  };\n\n  PdtShortestPathData(bool gc)\n      : gc_(gc), nstates_(0), ngc_(0), finished_(false) {}\n\n  ~PdtShortestPathData() {\n    VLOG(1) << \"opm size: \" << paren_map_.size();\n    VLOG(1) << \"# of search states: \" << nstates_;\n    if (gc_) VLOG(1) << \"# of GC'd search states: \" << ngc_;\n  }\n\n  void Clear() {\n    search_map_.clear();\n    search_multimap_.clear();\n    paren_map_.clear();\n    state_ = SearchState(kNoStateId, kNoStateId);\n    nstates_ = 0;\n    ngc_ = 0;\n  }\n\n  // TODO(kbg): Currently copying SearchState and passing a const reference to\n  // ParenSpec. Benchmark to confirm this is the right thing to do.\n\n  Weight Distance(SearchState s) const { return GetSearchData(s)->distance; }\n\n  Weight Distance(const ParenSpec &paren) const {\n    return GetSearchData(paren)->distance;\n  }\n\n  SearchState Parent(SearchState s) const { return GetSearchData(s)->parent; }\n\n  SearchState Parent(const ParenSpec &paren) const {\n    return GetSearchData(paren)->parent;\n  }\n\n  Label ParenId(SearchState s) const { return GetSearchData(s)->paren_id; }\n\n  uint8 Flags(SearchState s) const { return GetSearchData(s)->flags; }\n\n  void SetDistance(SearchState s, Weight weight) {\n    GetSearchData(s)->distance = std::move(weight);\n  }\n\n  void SetDistance(const ParenSpec &paren, Weight weight) {\n    GetSearchData(paren)->distance = std::move(weight);\n  }\n\n  void SetParent(SearchState s, SearchState p) { GetSearchData(s)->parent = p; }\n\n  void SetParent(const ParenSpec &paren, SearchState p) {\n    GetSearchData(paren)->parent = p;\n  }\n\n  void SetParenId(SearchState s, Label p) {\n    if (p >= 32768) {\n      FSTERROR() << \"PdtShortestPathData: Paren ID does not fit in an int16\";\n    }\n    GetSearchData(s)->paren_id = p;\n  }\n\n  void SetFlags(SearchState s, uint8 f, uint8 mask) {\n    auto *data = GetSearchData(s);\n    data->flags &= ~mask;\n    data->flags |= f & mask;\n  }\n\n  void GC(StateId s);\n\n  void Finish() { finished_ = true; }\n\n private:\n  // Hash for search state.\n  struct SearchStateHash {\n    size_t operator()(const SearchState &s) const {\n      static constexpr auto prime = 7853;\n      return s.state + s.start * prime;\n    }\n  };\n\n  // Hash for paren map.\n  struct ParenHash {\n    size_t operator()(const ParenSpec &paren) const {\n      static constexpr auto prime0 = 7853;\n      static constexpr auto prime1 = 7867;\n      return paren.paren_id + paren.src_start * prime0 +\n             paren.dest_start * prime1;\n    }\n  };\n\n  using SearchMap =\n      std::unordered_map<SearchState, SearchData, SearchStateHash>;\n\n  using SearchMultimap = std::unordered_multimap<StateId, StateId>;\n\n  // Hash map from paren spec to open paren data.\n  using ParenMap = std::unordered_map<ParenSpec, SearchData, ParenHash>;\n\n  SearchData *GetSearchData(SearchState s) const {\n    if (s == state_) return state_data_;\n    if (finished_) {\n      auto it = search_map_.find(s);\n      if (it == search_map_.end()) return &null_search_data_;\n      state_ = s;\n      return state_data_ = &(it->second);\n    } else {\n      state_ = s;\n      state_data_ = &search_map_[s];\n      if (!(state_data_->flags & kPdtInited)) {\n        ++nstates_;\n        if (gc_) search_multimap_.insert(std::make_pair(s.start, s.state));\n        state_data_->flags = kPdtInited;\n      }\n      return state_data_;\n    }\n  }\n\n  SearchData *GetSearchData(ParenSpec paren) const {\n    if (paren == paren_) return paren_data_;\n    if (finished_) {\n      auto it = paren_map_.find(paren);\n      if (it == paren_map_.end()) return &null_search_data_;\n      paren_ = paren;\n      return state_data_ = &(it->second);\n    } else {\n      paren_ = paren;\n      return paren_data_ = &paren_map_[paren];\n    }\n  }\n\n  mutable SearchMap search_map_;            // Maps from search state to data.\n  mutable SearchMultimap search_multimap_;  // Maps from \"start\" to subgraph.\n  mutable ParenMap paren_map_;              // Maps paren spec to search data.\n  mutable SearchState state_;               // Last state accessed.\n  mutable SearchData *state_data_;          // Last state data accessed.\n  mutable ParenSpec paren_;                 // Last paren spec accessed.\n  mutable SearchData *paren_data_;          // Last paren data accessed.\n  bool gc_;                                 // Allow GC?\n  mutable size_t nstates_;                  // Total number of search states.\n  size_t ngc_;                              // Number of GC'd search states.\n  mutable SearchData null_search_data_;     // Null search data.\n  bool finished_;                           // Read-only access when true.\n\n  PdtShortestPathData(const PdtShortestPathData &) = delete;\n  PdtShortestPathData &operator=(const PdtShortestPathData &) = delete;\n};\n\n// Deletes inaccessible search data from a given \"start\" (open paren dest)\n// state. Assumes \"final\" (close paren source or PDT final) states have\n// been flagged kPdtFinal.\ntemplate <class Arc>\nvoid PdtShortestPathData<Arc>::GC(StateId start) {\n  if (!gc_) return;\n  std::vector<StateId> finals;\n  for (auto it = search_multimap_.find(start);\n       it != search_multimap_.end() && it->first == start; ++it) {\n    const SearchState s(it->second, start);\n    if (search_map_[s].flags & kPdtFinal) finals.push_back(s.state);\n  }\n  // Mark phase.\n  for (const auto state : finals) {\n    SearchState ss(state, start);\n    while (ss.state != kNoLabel) {\n      auto &sdata = search_map_[ss];\n      if (sdata.flags & kPdtMarked) break;\n      sdata.flags |= kPdtMarked;\n      const auto p = sdata.parent;\n      if (p.start != start && p.start != kNoLabel) {  // Entering sub-subgraph.\n        const ParenSpec paren(sdata.paren_id, ss.start, p.start);\n        ss = paren_map_[paren].parent;\n      } else {\n        ss = p;\n      }\n    }\n  }\n  // Sweep phase.\n  auto it = search_multimap_.find(start);\n  while (it != search_multimap_.end() && it->first == start) {\n    const SearchState s(it->second, start);\n    auto mit = search_map_.find(s);\n    const SearchData &data = mit->second;\n    if (!(data.flags & kPdtMarked)) {\n      search_map_.erase(mit);\n      ++ngc_;\n    }\n    search_multimap_.erase(it++);\n  }\n}\n\n}  // namespace internal\n\n// This computes the single source shortest (balanced) path (SSSP) through a\n// weighted PDT that has a bounded stack (i.e., is expandable as an FST). It is\n// a generalization of the classic SSSP graph algorithm that removes a state s\n// from a queue (defined by a user-provided queue type) and relaxes the\n// destination states of transitions leaving s. In this PDT version, states that\n// have entering open parentheses are treated as source states for a sub-graph\n// SSSP problem with the shortest path up to the open parenthesis being first\n// saved. When a close parenthesis is then encountered any balancing open\n// parenthesis is examined for this saved information and multiplied back. In\n// this way, each sub-graph is entered only once rather than repeatedly. If\n// every state in the input PDT has the property that there is a unique \"start\"\n// state for it with entering open parentheses, then this algorithm is quite\n// straightforward. In general, this will not be the case, so the algorithm\n// (implicitly) creates a new graph where each state is a pair of an original\n// state and a possible parenthesis \"start\" state for that state.\ntemplate <class Arc, class Queue>\nclass PdtShortestPath {\n public:\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using SpData = internal::PdtShortestPathData<Arc>;\n  using SearchState = typename SpData::SearchState;\n  using ParenSpec = typename SpData::ParenSpec;\n  using CloseSourceIterator =\n      typename internal::PdtBalanceData<Arc>::SetIterator;\n\n  PdtShortestPath(const Fst<Arc> &ifst,\n                  const std::vector<std::pair<Label, Label>> &parens,\n                  const PdtShortestPathOptions<Arc, Queue> &opts)\n      : ifst_(ifst.Copy()),\n        parens_(parens),\n        keep_parens_(opts.keep_parentheses),\n        start_(ifst.Start()),\n        sp_data_(opts.path_gc),\n        error_(false) {\n    // TODO(kbg): Make this a compile-time static_assert once:\n    // 1) All weight properties are made constexpr for all weight types.\n    // 2) We have a pleasant way to \"deregister\" this oepration for non-path\n    //    semirings so an informative error message is produced. The best\n    //    solution will probably involve some kind of SFINAE magic.\n    if ((Weight::Properties() & (kPath | kRightSemiring)) !=\n        (kPath | kRightSemiring)) {\n      FSTERROR() << \"PdtShortestPath: Weight needs to have the path\"\n                 << \" property and be right distributive: \" << Weight::Type();\n      error_ = true;\n    }\n    for (Label i = 0; i < parens.size(); ++i) {\n      const auto &pair = parens[i];\n      paren_map_[pair.first] = i;\n      paren_map_[pair.second] = i;\n    }\n  }\n\n  ~PdtShortestPath() {\n    VLOG(1) << \"# of input states: \" << CountStates(*ifst_);\n    VLOG(1) << \"# of enqueued: \" << nenqueued_;\n    VLOG(1) << \"cpmm size: \" << close_paren_multimap_.size();\n  }\n\n  void ShortestPath(MutableFst<Arc> *ofst) {\n    Init(ofst);\n    GetDistance(start_);\n    GetPath();\n    sp_data_.Finish();\n    if (error_) ofst->SetProperties(kError, kError);\n  }\n\n  const internal::PdtShortestPathData<Arc> &GetShortestPathData() const {\n    return sp_data_;\n  }\n\n  internal::PdtBalanceData<Arc> *GetBalanceData() { return &balance_data_; }\n\n public:\n  // Hash multimap from close paren label to an paren arc.\n  using CloseParenMultimap =\n      std::unordered_multimap<internal::ParenState<Arc>, Arc,\n                              typename internal::ParenState<Arc>::Hash>;\n\n  const CloseParenMultimap &GetCloseParenMultimap() const {\n    return close_paren_multimap_;\n  }\n\n private:\n  void Init(MutableFst<Arc> *ofst);\n\n  void GetDistance(StateId start);\n\n  void ProcFinal(SearchState s);\n\n  void ProcArcs(SearchState s);\n\n  void ProcOpenParen(Label paren_id, SearchState s, StateId nexstate,\n                     const Weight &weight);\n\n  void ProcCloseParen(Label paren_id, SearchState s, const Weight &weight);\n\n  void ProcNonParen(SearchState s, StateId nextstate, const Weight &weight);\n\n  void Relax(SearchState s, SearchState t, StateId nextstate,\n             const Weight &weight, Label paren_id);\n\n  void Enqueue(SearchState d);\n\n  void GetPath();\n\n  Arc GetPathArc(SearchState s, SearchState p, Label paren_id, bool open);\n\n  std::unique_ptr<Fst<Arc>> ifst_;\n  MutableFst<Arc> *ofst_;\n  const std::vector<std::pair<Label, Label>> &parens_;\n  bool keep_parens_;\n  Queue *state_queue_;\n  StateId start_;\n  Weight fdistance_;\n  SearchState f_parent_;\n  SpData sp_data_;\n  std::unordered_map<Label, Label> paren_map_;\n  CloseParenMultimap close_paren_multimap_;\n  internal::PdtBalanceData<Arc> balance_data_;\n  ssize_t nenqueued_;\n  bool error_;\n\n  static constexpr uint8 kEnqueued = 0x10;\n  static constexpr uint8 kExpanded = 0x20;\n  static constexpr uint8 kFinished = 0x40;\n\n  static const Arc kNoArc;\n};\n\ntemplate <class Arc, class Queue>\nvoid PdtShortestPath<Arc, Queue>::Init(MutableFst<Arc> *ofst) {\n  ofst_ = ofst;\n  ofst->DeleteStates();\n  ofst->SetInputSymbols(ifst_->InputSymbols());\n  ofst->SetOutputSymbols(ifst_->OutputSymbols());\n  if (ifst_->Start() == kNoStateId) return;\n  fdistance_ = Weight::Zero();\n  f_parent_ = SearchState(kNoStateId, kNoStateId);\n  sp_data_.Clear();\n  close_paren_multimap_.clear();\n  balance_data_.Clear();\n  nenqueued_ = 0;\n  // Finds open parens per destination state and close parens per source state.\n  for (StateIterator<Fst<Arc>> siter(*ifst_); !siter.Done(); siter.Next()) {\n    const auto s = siter.Value();\n    for (ArcIterator<Fst<Arc>> aiter(*ifst_, s); !aiter.Done(); aiter.Next()) {\n      const auto &arc = aiter.Value();\n      const auto it = paren_map_.find(arc.ilabel);\n      if (it != paren_map_.end()) {  // Is a paren?\n        const auto paren_id = it->second;\n        if (arc.ilabel == parens_[paren_id].first) {  // Open paren.\n          balance_data_.OpenInsert(paren_id, arc.nextstate);\n        } else {  // Close paren.\n          const internal::ParenState<Arc> paren_state(paren_id, s);\n          close_paren_multimap_.emplace(paren_state, arc);\n        }\n      }\n    }\n  }\n}\n\n// Computes the shortest distance stored in a recursive way. Each sub-graph\n// (i.e., different paren \"start\" state) begins with weight One().\ntemplate <class Arc, class Queue>\nvoid PdtShortestPath<Arc, Queue>::GetDistance(StateId start) {\n  if (start == kNoStateId) return;\n  Queue state_queue;\n  state_queue_ = &state_queue;\n  const SearchState q(start, start);\n  Enqueue(q);\n  sp_data_.SetDistance(q, Weight::One());\n  while (!state_queue_->Empty()) {\n    const auto state = state_queue_->Head();\n    state_queue_->Dequeue();\n    const SearchState s(state, start);\n    sp_data_.SetFlags(s, 0, kEnqueued);\n    ProcFinal(s);\n    ProcArcs(s);\n    sp_data_.SetFlags(s, kExpanded, kExpanded);\n  }\n  sp_data_.SetFlags(q, kFinished, kFinished);\n  balance_data_.FinishInsert(start);\n  sp_data_.GC(start);\n}\n\n// Updates best complete path.\ntemplate <class Arc, class Queue>\nvoid PdtShortestPath<Arc, Queue>::ProcFinal(SearchState s) {\n  if (ifst_->Final(s.state) != Weight::Zero() && s.start == start_) {\n    const auto weight = Times(sp_data_.Distance(s), ifst_->Final(s.state));\n    if (fdistance_ != Plus(fdistance_, weight)) {\n      if (f_parent_.state != kNoStateId) {\n        sp_data_.SetFlags(f_parent_, 0, internal::kPdtFinal);\n      }\n      sp_data_.SetFlags(s, internal::kPdtFinal, internal::kPdtFinal);\n      fdistance_ = Plus(fdistance_, weight);\n      f_parent_ = s;\n    }\n  }\n}\n\n// Processes all arcs leaving the state s.\ntemplate <class Arc, class Queue>\nvoid PdtShortestPath<Arc, Queue>::ProcArcs(SearchState s) {\n  for (ArcIterator<Fst<Arc>> aiter(*ifst_, s.state); !aiter.Done();\n       aiter.Next()) {\n    const auto &arc = aiter.Value();\n    const auto weight = Times(sp_data_.Distance(s), arc.weight);\n    const auto it = paren_map_.find(arc.ilabel);\n    if (it != paren_map_.end()) {  // Is a paren?\n      const auto paren_id = it->second;\n      if (arc.ilabel == parens_[paren_id].first) {\n        ProcOpenParen(paren_id, s, arc.nextstate, weight);\n      } else {\n        ProcCloseParen(paren_id, s, weight);\n      }\n    } else {\n      ProcNonParen(s, arc.nextstate, weight);\n    }\n  }\n}\n\n// Saves the shortest path info for reaching this parenthesis and starts a new\n// SSSP in the sub-graph pointed to by the parenthesis if previously unvisited.\n// Otherwise it finds any previously encountered closing parentheses and relaxes\n// them using the recursively stored shortest distance to them.\ntemplate <class Arc, class Queue>\ninline void PdtShortestPath<Arc, Queue>::ProcOpenParen(Label paren_id,\n                                                       SearchState s,\n                                                       StateId nextstate,\n                                                       const Weight &weight) {\n  const SearchState d(nextstate, nextstate);\n  const ParenSpec paren(paren_id, s.start, d.start);\n  const auto pdist = sp_data_.Distance(paren);\n  if (pdist != Plus(pdist, weight)) {\n    sp_data_.SetDistance(paren, weight);\n    sp_data_.SetParent(paren, s);\n    const auto dist = sp_data_.Distance(d);\n    if (dist == Weight::Zero()) {\n      auto *state_queue = state_queue_;\n      GetDistance(d.start);\n      state_queue_ = state_queue;\n    } else if (!(sp_data_.Flags(d) & kFinished)) {\n      FSTERROR()\n          << \"PdtShortestPath: open parenthesis recursion: not bounded stack\";\n      error_ = true;\n    }\n    for (auto set_iter = balance_data_.Find(paren_id, nextstate);\n         !set_iter.Done(); set_iter.Next()) {\n      const SearchState cpstate(set_iter.Element(), d.start);\n      const internal::ParenState<Arc> paren_state(paren_id, cpstate.state);\n      for (auto cpit = close_paren_multimap_.find(paren_state);\n           cpit != close_paren_multimap_.end() && paren_state == cpit->first;\n           ++cpit) {\n        const auto &cparc = cpit->second;\n        const auto cpw =\n            Times(weight, Times(sp_data_.Distance(cpstate), cparc.weight));\n        Relax(cpstate, s, cparc.nextstate, cpw, paren_id);\n      }\n    }\n  }\n}\n\n// Saves the correspondence between each closing parenthesis and its balancing\n// open parenthesis info. Relaxes any close parenthesis destination state that\n// has a balancing previously encountered open parenthesis.\ntemplate <class Arc, class Queue>\ninline void PdtShortestPath<Arc, Queue>::ProcCloseParen(Label paren_id,\n                                                        SearchState s,\n                                                        const Weight &weight) {\n  const internal::ParenState<Arc> paren_state(paren_id, s.start);\n  if (!(sp_data_.Flags(s) & kExpanded)) {\n    balance_data_.CloseInsert(paren_id, s.start, s.state);\n    sp_data_.SetFlags(s, internal::kPdtFinal, internal::kPdtFinal);\n  }\n}\n\n// Classical relaxation for non-parentheses.\ntemplate <class Arc, class Queue>\ninline void PdtShortestPath<Arc, Queue>::ProcNonParen(SearchState s,\n                                                      StateId nextstate,\n                                                      const Weight &weight) {\n  Relax(s, s, nextstate, weight, kNoLabel);\n}\n\n// Classical relaxation on the search graph for an arc with destination state\n// nexstate from state s. State t is in the same sub-graph as nextstate (i.e.,\n// has the same paren \"start\").\ntemplate <class Arc, class Queue>\ninline void PdtShortestPath<Arc, Queue>::Relax(SearchState s, SearchState t,\n                                               StateId nextstate,\n                                               const Weight &weight,\n                                               Label paren_id) {\n  const SearchState d(nextstate, t.start);\n  Weight dist = sp_data_.Distance(d);\n  if (dist != Plus(dist, weight)) {\n    sp_data_.SetParent(d, s);\n    sp_data_.SetParenId(d, paren_id);\n    sp_data_.SetDistance(d, Plus(dist, weight));\n    Enqueue(d);\n  }\n}\n\ntemplate <class Arc, class Queue>\ninline void PdtShortestPath<Arc, Queue>::Enqueue(SearchState s) {\n  if (!(sp_data_.Flags(s) & kEnqueued)) {\n    state_queue_->Enqueue(s.state);\n    sp_data_.SetFlags(s, kEnqueued, kEnqueued);\n    ++nenqueued_;\n  } else {\n    state_queue_->Update(s.state);\n  }\n}\n\n// Follows parent pointers to find the shortest path. A stack is used since the\n// shortest distance is stored recursively.\ntemplate <class Arc, class Queue>\nvoid PdtShortestPath<Arc, Queue>::GetPath() {\n  SearchState s = f_parent_;\n  SearchState d = SearchState(kNoStateId, kNoStateId);\n  StateId s_p = kNoStateId;\n  StateId d_p = kNoStateId;\n  auto arc = kNoArc;\n  Label paren_id = kNoLabel;\n  std::stack<ParenSpec> paren_stack;\n  while (s.state != kNoStateId) {\n    d_p = s_p;\n    s_p = ofst_->AddState();\n    if (d.state == kNoStateId) {\n      ofst_->SetFinal(s_p, ifst_->Final(f_parent_.state));\n    } else {\n      if (paren_id != kNoLabel) {                     // Paren?\n        if (arc.ilabel == parens_[paren_id].first) {  // Open paren?\n          paren_stack.pop();\n        } else {  // Close paren?\n          const ParenSpec paren(paren_id, d.start, s.start);\n          paren_stack.push(paren);\n        }\n        if (!keep_parens_) arc.ilabel = arc.olabel = 0;\n      }\n      arc.nextstate = d_p;\n      ofst_->AddArc(s_p, arc);\n    }\n    d = s;\n    s = sp_data_.Parent(d);\n    paren_id = sp_data_.ParenId(d);\n    if (s.state != kNoStateId) {\n      arc = GetPathArc(s, d, paren_id, false);\n    } else if (!paren_stack.empty()) {\n      const ParenSpec paren = paren_stack.top();\n      s = sp_data_.Parent(paren);\n      paren_id = paren.paren_id;\n      arc = GetPathArc(s, d, paren_id, true);\n    }\n  }\n  ofst_->SetStart(s_p);\n  ofst_->SetProperties(\n      ShortestPathProperties(ofst_->Properties(kFstProperties, false)),\n      kFstProperties);\n}\n\n// Finds transition with least weight between two states with label matching\n// paren_id and open/close paren type or a non-paren if kNoLabel.\ntemplate <class Arc, class Queue>\nArc PdtShortestPath<Arc, Queue>::GetPathArc(SearchState s, SearchState d,\n                                            Label paren_id, bool open_paren) {\n  auto path_arc = kNoArc;\n  for (ArcIterator<Fst<Arc>> aiter(*ifst_, s.state); !aiter.Done();\n       aiter.Next()) {\n    const auto &arc = aiter.Value();\n    if (arc.nextstate != d.state) continue;\n    Label arc_paren_id = kNoLabel;\n    const auto it = paren_map_.find(arc.ilabel);\n    if (it != paren_map_.end()) {\n      arc_paren_id = it->second;\n      bool arc_open_paren = (arc.ilabel == parens_[arc_paren_id].first);\n      if (arc_open_paren != open_paren) continue;\n    }\n    if (arc_paren_id != paren_id) continue;\n    if (arc.weight == Plus(arc.weight, path_arc.weight)) path_arc = arc;\n  }\n  if (path_arc.nextstate == kNoStateId) {\n    FSTERROR() << \"PdtShortestPath::GetPathArc: Failed to find arc\";\n    error_ = true;\n  }\n  return path_arc;\n}\n\ntemplate <class Arc, class Queue>\nconst Arc PdtShortestPath<Arc, Queue>::kNoArc = Arc(kNoLabel, kNoLabel,\n                                                    Weight::Zero(), kNoStateId);\n\n// Functional variants.\n\ntemplate <class Arc, class Queue>\nvoid ShortestPath(\n    const Fst<Arc> &ifst,\n    const std::vector<std::pair<typename Arc::Label, typename Arc::Label>>\n        &parens,\n    MutableFst<Arc> *ofst, const PdtShortestPathOptions<Arc, Queue> &opts) {\n  PdtShortestPath<Arc, Queue> psp(ifst, parens, opts);\n  psp.ShortestPath(ofst);\n}\n\ntemplate <class Arc>\nvoid ShortestPath(\n    const Fst<Arc> &ifst,\n    const std::vector<std::pair<typename Arc::Label, typename Arc::Label>>\n        &parens,\n    MutableFst<Arc> *ofst) {\n  using Q = FifoQueue<typename Arc::StateId>;\n  const PdtShortestPathOptions<Arc, Q> opts;\n  PdtShortestPath<Arc, Q> psp(ifst, parens, opts);\n  psp.ShortestPath(ofst);\n}\n\n}  // namespace fst\n\n#endif  // FST_EXTENSIONS_PDT_SHORTEST_PATH_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/extensions/special/phi-fst.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#ifndef FST_EXTENSIONS_SPECIAL_PHI_FST_H_\n#define FST_EXTENSIONS_SPECIAL_PHI_FST_H_\n\n#include <memory>\n#include <string>\n\n#include <fst/const-fst.h>\n#include <fst/matcher-fst.h>\n#include <fst/matcher.h>\n\nDECLARE_int64(phi_fst_phi_label);\nDECLARE_bool(phi_fst_phi_loop);\nDECLARE_string(phi_fst_rewrite_mode);\n\nnamespace fst {\nnamespace internal {\n\ntemplate <class Label>\nclass PhiFstMatcherData {\n public:\n  PhiFstMatcherData(\n      Label phi_label = FLAGS_phi_fst_phi_label,\n      bool phi_loop = FLAGS_phi_fst_phi_loop,\n      MatcherRewriteMode rewrite_mode = RewriteMode(FLAGS_phi_fst_rewrite_mode))\n      : phi_label_(phi_label),\n        phi_loop_(phi_loop),\n        rewrite_mode_(rewrite_mode) {}\n\n  PhiFstMatcherData(const PhiFstMatcherData &data)\n      : phi_label_(data.phi_label_),\n        phi_loop_(data.phi_loop_),\n        rewrite_mode_(data.rewrite_mode_) {}\n\n  static PhiFstMatcherData<Label> *Read(std::istream &istrm,\n                                        const FstReadOptions &read) {\n    auto *data = new PhiFstMatcherData<Label>();\n    ReadType(istrm, &data->phi_label_);\n    ReadType(istrm, &data->phi_loop_);\n    int32 rewrite_mode;\n    ReadType(istrm, &rewrite_mode);\n    data->rewrite_mode_ = static_cast<MatcherRewriteMode>(rewrite_mode);\n    return data;\n  }\n\n  bool Write(std::ostream &ostrm, const FstWriteOptions &opts) const {\n    WriteType(ostrm, phi_label_);\n    WriteType(ostrm, phi_loop_);\n    WriteType(ostrm, static_cast<int32>(rewrite_mode_));\n    return !ostrm ? false : true;\n  }\n\n  Label PhiLabel() const { return phi_label_; }\n\n  bool PhiLoop() const { return phi_loop_; }\n\n  MatcherRewriteMode RewriteMode() const { return rewrite_mode_; }\n\n private:\n  static MatcherRewriteMode RewriteMode(const string &mode) {\n    if (mode == \"auto\") return MATCHER_REWRITE_AUTO;\n    if (mode == \"always\") return MATCHER_REWRITE_ALWAYS;\n    if (mode == \"never\") return MATCHER_REWRITE_NEVER;\n    LOG(WARNING) << \"PhiFst: Unknown rewrite mode: \" << mode << \". \"\n                 << \"Defaulting to auto.\";\n    return MATCHER_REWRITE_AUTO;\n  }\n\n  Label phi_label_;\n  bool phi_loop_;\n  MatcherRewriteMode rewrite_mode_;\n};\n\n}  // namespace internal\n\nconstexpr uint8 kPhiFstMatchInput = 0x01;   // Input matcher is PhiMatcher.\nconstexpr uint8 kPhiFstMatchOutput = 0x02;  // Output matcher is PhiMatcher.\n\ntemplate <class M, uint8 flags = kPhiFstMatchInput | kPhiFstMatchOutput>\nclass PhiFstMatcher : public PhiMatcher<M> {\n public:\n  using FST = typename M::FST;\n  using Arc = typename M::Arc;\n  using StateId = typename Arc::StateId;\n  using Label = typename Arc::Label;\n  using Weight = typename Arc::Weight;\n  using MatcherData = internal::PhiFstMatcherData<Label>;\n\n  enum : uint8 { kFlags = flags };\n\n  // This makes a copy of the FST.\n  PhiFstMatcher(const FST &fst, MatchType match_type,\n      std::shared_ptr<MatcherData> data = std::make_shared<MatcherData>())\n      : PhiMatcher<M>(fst, match_type,\n                      PhiLabel(match_type, data ? data->PhiLabel()\n                                                : MatcherData().PhiLabel()),\n                      data ? data->PhiLoop() : MatcherData().PhiLoop(),\n                      data ? data->RewriteMode() : MatcherData().RewriteMode()),\n        data_(data) {}\n\n  // This doesn't copy the FST.\n  PhiFstMatcher(const FST *fst, MatchType match_type,\n      std::shared_ptr<MatcherData> data = std::make_shared<MatcherData>())\n      : PhiMatcher<M>(fst, match_type,\n                      PhiLabel(match_type, data ? data->PhiLabel()\n                                                : MatcherData().PhiLabel()),\n                      data ? data->PhiLoop() : MatcherData().PhiLoop(),\n                      data ? data->RewriteMode() : MatcherData().RewriteMode()),\n        data_(data) {}\n\n  // This makes a copy of the FST.\n  PhiFstMatcher(const PhiFstMatcher<M, flags> &matcher, bool safe = false)\n      : PhiMatcher<M>(matcher, safe), data_(matcher.data_) {}\n\n  PhiFstMatcher<M, flags> *Copy(bool safe = false) const override {\n    return new PhiFstMatcher<M, flags>(*this, safe);\n  }\n\n  const MatcherData *GetData() const { return data_.get(); }\n\n  std::shared_ptr<MatcherData> GetSharedData() const { return data_; }\n\n private:\n  static Label PhiLabel(MatchType match_type, Label label) {\n    if (match_type == MATCH_INPUT && flags & kPhiFstMatchInput) return label;\n    if (match_type == MATCH_OUTPUT && flags & kPhiFstMatchOutput) return label;\n    return kNoLabel;\n  }\n\n  std::shared_ptr<MatcherData> data_;\n};\n\nextern const char phi_fst_type[];\nextern const char input_phi_fst_type[];\nextern const char output_phi_fst_type[];\n\nusing StdPhiFst =\n    MatcherFst<ConstFst<StdArc>, PhiFstMatcher<SortedMatcher<ConstFst<StdArc>>>,\n               phi_fst_type>;\n\nusing LogPhiFst =\n    MatcherFst<ConstFst<LogArc>, PhiFstMatcher<SortedMatcher<ConstFst<LogArc>>>,\n               phi_fst_type>;\n\nusing Log64PhiFst = MatcherFst<ConstFst<Log64Arc>,\n                               PhiFstMatcher<SortedMatcher<ConstFst<Log64Arc>>>,\n                               input_phi_fst_type>;\n\nusing StdInputPhiFst =\n    MatcherFst<ConstFst<StdArc>, PhiFstMatcher<SortedMatcher<ConstFst<StdArc>>,\n                                               kPhiFstMatchInput>,\n               input_phi_fst_type>;\n\nusing LogInputPhiFst =\n    MatcherFst<ConstFst<LogArc>, PhiFstMatcher<SortedMatcher<ConstFst<LogArc>>,\n                                               kPhiFstMatchInput>,\n               input_phi_fst_type>;\n\nusing Log64InputPhiFst = MatcherFst<\n    ConstFst<Log64Arc>,\n    PhiFstMatcher<SortedMatcher<ConstFst<Log64Arc>>, kPhiFstMatchInput>,\n    input_phi_fst_type>;\n\nusing StdOutputPhiFst =\n    MatcherFst<ConstFst<StdArc>, PhiFstMatcher<SortedMatcher<ConstFst<StdArc>>,\n                                               kPhiFstMatchOutput>,\n               output_phi_fst_type>;\n\nusing LogOutputPhiFst =\n    MatcherFst<ConstFst<LogArc>, PhiFstMatcher<SortedMatcher<ConstFst<LogArc>>,\n                                               kPhiFstMatchOutput>,\n               output_phi_fst_type>;\n\nusing Log64OutputPhiFst = MatcherFst<\n    ConstFst<Log64Arc>,\n    PhiFstMatcher<SortedMatcher<ConstFst<Log64Arc>>, kPhiFstMatchOutput>,\n    output_phi_fst_type>;\n\n}  // namespace fst\n\n#endif  // FST_EXTENSIONS_SPECIAL_PHI_FST_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/extensions/special/rho-fst.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#ifndef FST_EXTENSIONS_SPECIAL_RHO_FST_H_\n#define FST_EXTENSIONS_SPECIAL_RHO_FST_H_\n\n#include <memory>\n#include <string>\n\n#include <fst/const-fst.h>\n#include <fst/matcher-fst.h>\n#include <fst/matcher.h>\n\nDECLARE_int64(rho_fst_rho_label);\nDECLARE_string(rho_fst_rewrite_mode);\n\nnamespace fst {\nnamespace internal {\n\ntemplate <class Label>\nclass RhoFstMatcherData {\n public:\n  explicit RhoFstMatcherData(\n      Label rho_label = FLAGS_rho_fst_rho_label,\n      MatcherRewriteMode rewrite_mode = RewriteMode(FLAGS_rho_fst_rewrite_mode))\n      : rho_label_(rho_label), rewrite_mode_(rewrite_mode) {}\n\n  RhoFstMatcherData(const RhoFstMatcherData &data)\n      : rho_label_(data.rho_label_), rewrite_mode_(data.rewrite_mode_) {}\n\n  static RhoFstMatcherData<Label> *Read(std::istream &istrm,\n                                    const FstReadOptions &read) {\n    auto *data = new RhoFstMatcherData<Label>();\n    ReadType(istrm, &data->rho_label_);\n    int32 rewrite_mode;\n    ReadType(istrm, &rewrite_mode);\n    data->rewrite_mode_ = static_cast<MatcherRewriteMode>(rewrite_mode);\n    return data;\n  }\n\n  bool Write(std::ostream &ostrm, const FstWriteOptions &opts) const {\n    WriteType(ostrm, rho_label_);\n    WriteType(ostrm, static_cast<int32>(rewrite_mode_));\n    return !ostrm ? false : true;\n  }\n\n  Label RhoLabel() const { return rho_label_; }\n\n  MatcherRewriteMode RewriteMode() const { return rewrite_mode_; }\n\n private:\n  static MatcherRewriteMode RewriteMode(const string &mode) {\n    if (mode == \"auto\") return MATCHER_REWRITE_AUTO;\n    if (mode == \"always\") return MATCHER_REWRITE_ALWAYS;\n    if (mode == \"never\") return MATCHER_REWRITE_NEVER;\n    LOG(WARNING) << \"RhoFst: Unknown rewrite mode: \" << mode << \". \"\n                 << \"Defaulting to auto.\";\n    return MATCHER_REWRITE_AUTO;\n  }\n\n  Label rho_label_;\n  MatcherRewriteMode rewrite_mode_;\n};\n\n}  // namespace internal\n\nconstexpr uint8 kRhoFstMatchInput = 0x01;   // Input matcher is RhoMatcher.\nconstexpr uint8 kRhoFstMatchOutput = 0x02;  // Output matcher is RhoMatcher.\n\ntemplate <class M, uint8 flags = kRhoFstMatchInput | kRhoFstMatchOutput>\nclass RhoFstMatcher : public RhoMatcher<M> {\n public:\n  using FST = typename M::FST;\n  using Arc = typename M::Arc;\n  using StateId = typename Arc::StateId;\n  using Label = typename Arc::Label;\n  using Weight = typename Arc::Weight;\n  using MatcherData = internal::RhoFstMatcherData<Label>;\n\n  enum : uint8 { kFlags = flags };\n\n  // This makes a copy of the FST.\n  RhoFstMatcher(\n      const FST &fst, MatchType match_type,\n      std::shared_ptr<MatcherData> data = std::make_shared<MatcherData>())\n      : RhoMatcher<M>(fst, match_type,\n                      RhoLabel(match_type, data ? data->RhoLabel()\n                                                : MatcherData().RhoLabel()),\n                      data ? data->RewriteMode() : MatcherData().RewriteMode()),\n        data_(data) {}\n\n  // This doesn't copy the FST.\n  RhoFstMatcher(\n      const FST *fst, MatchType match_type,\n      std::shared_ptr<MatcherData> data = std::make_shared<MatcherData>())\n      : RhoMatcher<M>(fst, match_type,\n                      RhoLabel(match_type, data ? data->RhoLabel()\n                                                : MatcherData().RhoLabel()),\n                      data ? data->RewriteMode() : MatcherData().RewriteMode()),\n        data_(data) {}\n\n  // This makes a copy of the FST.\n  RhoFstMatcher(const RhoFstMatcher<M, flags> &matcher, bool safe = false)\n      : RhoMatcher<M>(matcher, safe), data_(matcher.data_) {}\n\n  RhoFstMatcher<M, flags> *Copy(bool safe = false) const override {\n    return new RhoFstMatcher<M, flags>(*this, safe);\n  }\n\n  const MatcherData *GetData() const { return data_.get(); }\n\n  std::shared_ptr<MatcherData> GetSharedData() const { return data_; }\n\n private:\n  static Label RhoLabel(MatchType match_type, Label label) {\n    if (match_type == MATCH_INPUT && flags & kRhoFstMatchInput) return label;\n    if (match_type == MATCH_OUTPUT && flags & kRhoFstMatchOutput) return label;\n    return kNoLabel;\n  }\n\n  std::shared_ptr<MatcherData> data_;\n};\n\nextern const char rho_fst_type[];\nextern const char input_rho_fst_type[];\nextern const char output_rho_fst_type[];\n\nusing StdRhoFst =\n    MatcherFst<ConstFst<StdArc>, RhoFstMatcher<SortedMatcher<ConstFst<StdArc>>>,\n               rho_fst_type>;\n\nusing LogRhoFst =\n    MatcherFst<ConstFst<LogArc>, RhoFstMatcher<SortedMatcher<ConstFst<LogArc>>>,\n               rho_fst_type>;\n\nusing Log64RhoFst = MatcherFst<ConstFst<Log64Arc>,\n                               RhoFstMatcher<SortedMatcher<ConstFst<Log64Arc>>>,\n                               input_rho_fst_type>;\n\nusing StdInputRhoFst =\n    MatcherFst<ConstFst<StdArc>, RhoFstMatcher<SortedMatcher<ConstFst<StdArc>>,\n                                               kRhoFstMatchInput>,\n               input_rho_fst_type>;\n\nusing LogInputRhoFst =\n    MatcherFst<ConstFst<LogArc>, RhoFstMatcher<SortedMatcher<ConstFst<LogArc>>,\n                                               kRhoFstMatchInput>,\n               input_rho_fst_type>;\n\nusing Log64InputRhoFst = MatcherFst<\n    ConstFst<Log64Arc>,\n    RhoFstMatcher<SortedMatcher<ConstFst<Log64Arc>>, kRhoFstMatchInput>,\n    input_rho_fst_type>;\n\nusing StdOutputRhoFst =\n    MatcherFst<ConstFst<StdArc>, RhoFstMatcher<SortedMatcher<ConstFst<StdArc>>,\n                                               kRhoFstMatchOutput>,\n               output_rho_fst_type>;\n\nusing LogOutputRhoFst =\n    MatcherFst<ConstFst<LogArc>, RhoFstMatcher<SortedMatcher<ConstFst<LogArc>>,\n                                               kRhoFstMatchOutput>,\n               output_rho_fst_type>;\n\nusing Log64OutputRhoFst = MatcherFst<\n    ConstFst<Log64Arc>,\n    RhoFstMatcher<SortedMatcher<ConstFst<Log64Arc>>, kRhoFstMatchOutput>,\n    output_rho_fst_type>;\n\n}  // namespace fst\n\n#endif  // FST_EXTENSIONS_SPECIAL_RHO_FST_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/extensions/special/sigma-fst.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#ifndef FST_EXTENSIONS_SPECIAL_SIGMA_FST_H_\n#define FST_EXTENSIONS_SPECIAL_SIGMA_FST_H_\n\n#include <memory>\n#include <string>\n\n#include <fst/const-fst.h>\n#include <fst/matcher-fst.h>\n#include <fst/matcher.h>\n\nDECLARE_int64(sigma_fst_sigma_label);\nDECLARE_string(sigma_fst_rewrite_mode);\n\nnamespace fst {\nnamespace internal {\n\ntemplate <class Label>\nclass SigmaFstMatcherData {\n public:\n  explicit SigmaFstMatcherData(Label sigma_label = FLAGS_sigma_fst_sigma_label,\n      MatcherRewriteMode rewrite_mode =\n                          RewriteMode(FLAGS_sigma_fst_rewrite_mode))\n      : sigma_label_(sigma_label), rewrite_mode_(rewrite_mode) {}\n\n  SigmaFstMatcherData(const SigmaFstMatcherData &data)\n      : sigma_label_(data.sigma_label_), rewrite_mode_(data.rewrite_mode_) {}\n\n  static SigmaFstMatcherData<Label> *Read(std::istream &istrm,\n                                      const FstReadOptions &read) {\n    auto *data = new SigmaFstMatcherData<Label>();\n    ReadType(istrm, &data->sigma_label_);\n    int32 rewrite_mode;\n    ReadType(istrm, &rewrite_mode);\n    data->rewrite_mode_ = static_cast<MatcherRewriteMode>(rewrite_mode);\n    return data;\n  }\n\n  bool Write(std::ostream &ostrm, const FstWriteOptions &opts) const {\n    WriteType(ostrm, sigma_label_);\n    WriteType(ostrm, static_cast<int32>(rewrite_mode_));\n    return !ostrm ? false : true;\n  }\n\n  Label SigmaLabel() const { return sigma_label_; }\n\n  MatcherRewriteMode RewriteMode() const { return rewrite_mode_; }\n\n private:\n  static MatcherRewriteMode RewriteMode(const string &mode) {\n    if (mode == \"auto\") return MATCHER_REWRITE_AUTO;\n    if (mode == \"always\") return MATCHER_REWRITE_ALWAYS;\n    if (mode == \"never\") return MATCHER_REWRITE_NEVER;\n    LOG(WARNING) << \"SigmaFst: Unknown rewrite mode: \" << mode << \". \"\n                 << \"Defaulting to auto.\";\n    return MATCHER_REWRITE_AUTO;\n  }\n\n  Label sigma_label_;\n  MatcherRewriteMode rewrite_mode_;\n};\n\n}  // namespace internal\n\nconstexpr uint8 kSigmaFstMatchInput = 0x01;   // Input matcher is SigmaMatcher.\nconstexpr uint8 kSigmaFstMatchOutput = 0x02;  // Output matcher is SigmaMatcher.\n\ntemplate <class M, uint8 flags = kSigmaFstMatchInput | kSigmaFstMatchOutput>\nclass SigmaFstMatcher : public SigmaMatcher<M> {\n public:\n  using FST = typename M::FST;\n  using Arc = typename M::Arc;\n  using StateId = typename Arc::StateId;\n  using Label = typename Arc::Label;\n  using Weight = typename Arc::Weight;\n  using MatcherData = internal::SigmaFstMatcherData<Label>;\n\n  enum : uint8 { kFlags = flags };\n\n  // This makes a copy of the FST.\n  SigmaFstMatcher(\n      const FST &fst, MatchType match_type,\n      std::shared_ptr<MatcherData> data = std::make_shared<MatcherData>())\n      : SigmaMatcher<M>(\n            fst, match_type,\n            SigmaLabel(match_type,\n                       data ? data->SigmaLabel() : MatcherData().SigmaLabel()),\n            data ? data->RewriteMode() : MatcherData().RewriteMode()),\n        data_(data) {}\n\n  // This doesn't copy the FST.\n  SigmaFstMatcher(\n      const FST *fst, MatchType match_type,\n      std::shared_ptr<MatcherData> data = std::make_shared<MatcherData>())\n      : SigmaMatcher<M>(\n            fst, match_type,\n            SigmaLabel(match_type,\n                       data ? data->SigmaLabel() : MatcherData().SigmaLabel()),\n            data ? data->RewriteMode() : MatcherData().RewriteMode()),\n        data_(data) {}\n\n  // This makes a copy of the FST.\n  SigmaFstMatcher(const SigmaFstMatcher<M, flags> &matcher, bool safe = false)\n      : SigmaMatcher<M>(matcher, safe), data_(matcher.data_) {}\n\n  SigmaFstMatcher<M, flags> *Copy(bool safe = false) const override {\n    return new SigmaFstMatcher<M, flags>(*this, safe);\n  }\n\n  const MatcherData *GetData() const { return data_.get(); }\n\n  std::shared_ptr<MatcherData> GetSharedData() const { return data_; }\n\n private:\n  static Label SigmaLabel(MatchType match_type, Label label) {\n    if (match_type == MATCH_INPUT && flags & kSigmaFstMatchInput) return label;\n    if (match_type == MATCH_OUTPUT && flags & kSigmaFstMatchOutput)\n      return label;\n    return kNoLabel;\n  }\n\n  std::shared_ptr<MatcherData> data_;\n};\n\nextern const char sigma_fst_type[];\nextern const char input_sigma_fst_type[];\nextern const char output_sigma_fst_type[];\n\nusing StdSigmaFst = MatcherFst<ConstFst<StdArc>,\n                               SigmaFstMatcher<SortedMatcher<ConstFst<StdArc>>>,\n                               sigma_fst_type>;\n\nusing LogSigmaFst = MatcherFst<ConstFst<LogArc>,\n                               SigmaFstMatcher<SortedMatcher<ConstFst<LogArc>>>,\n                               sigma_fst_type>;\n\nusing Log64SigmaFst =\n    MatcherFst<ConstFst<Log64Arc>,\n               SigmaFstMatcher<SortedMatcher<ConstFst<Log64Arc>>>,\n               input_sigma_fst_type>;\n\nusing StdInputSigmaFst = MatcherFst<\n    ConstFst<StdArc>,\n    SigmaFstMatcher<SortedMatcher<ConstFst<StdArc>>, kSigmaFstMatchInput>,\n    input_sigma_fst_type>;\n\nusing LogInputSigmaFst = MatcherFst<\n    ConstFst<LogArc>,\n    SigmaFstMatcher<SortedMatcher<ConstFst<LogArc>>, kSigmaFstMatchInput>,\n    input_sigma_fst_type>;\n\nusing Log64InputSigmaFst = MatcherFst<\n    ConstFst<Log64Arc>,\n    SigmaFstMatcher<SortedMatcher<ConstFst<Log64Arc>>, kSigmaFstMatchInput>,\n    input_sigma_fst_type>;\n\nusing StdOutputSigmaFst = MatcherFst<\n    ConstFst<StdArc>,\n    SigmaFstMatcher<SortedMatcher<ConstFst<StdArc>>, kSigmaFstMatchOutput>,\n    output_sigma_fst_type>;\n\nusing LogOutputSigmaFst = MatcherFst<\n    ConstFst<LogArc>,\n    SigmaFstMatcher<SortedMatcher<ConstFst<LogArc>>, kSigmaFstMatchOutput>,\n    output_sigma_fst_type>;\n\nusing Log64OutputSigmaFst = MatcherFst<\n    ConstFst<Log64Arc>,\n    SigmaFstMatcher<SortedMatcher<ConstFst<Log64Arc>>, kSigmaFstMatchOutput>,\n    output_sigma_fst_type>;\n\n}  // namespace fst\n\n#endif  // FST_EXTENSIONS_SPECIAL_SIGMA_FST_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/factor-weight.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Classes to factor weights in an FST.\n\n#ifndef FST_FACTOR_WEIGHT_H_\n#define FST_FACTOR_WEIGHT_H_\n\n#include <algorithm>\n#include <string>\n#include <unordered_map>\n#include <utility>\n#include <vector>\n\n#include <fst/log.h>\n\n#include <fst/cache.h>\n#include <fst/test-properties.h>\n\n\nnamespace fst {\n\nconstexpr uint32 kFactorFinalWeights = 0x00000001;\nconstexpr uint32 kFactorArcWeights = 0x00000002;\n\ntemplate <class Arc>\nstruct FactorWeightOptions : CacheOptions {\n  using Label = typename Arc::Label;\n\n  float delta;\n  uint32 mode;         // Factor arc weights and/or final weights.\n  Label final_ilabel;  // Input label of arc when factoring final weights.\n  Label final_olabel;  // Output label of arc when factoring final weights.\n  bool increment_final_ilabel;  // When factoring final w' results in > 1 arcs\n  bool increment_final_olabel;  // at state, increment labels to make distinct?\n\n  explicit FactorWeightOptions(const CacheOptions &opts, float delta = kDelta,\n                               uint32 mode = kFactorArcWeights |\n                                             kFactorFinalWeights,\n                               Label final_ilabel = 0, Label final_olabel = 0,\n                               bool increment_final_ilabel = false,\n                               bool increment_final_olabel = false)\n      : CacheOptions(opts),\n        delta(delta),\n        mode(mode),\n        final_ilabel(final_ilabel),\n        final_olabel(final_olabel),\n        increment_final_ilabel(increment_final_ilabel),\n        increment_final_olabel(increment_final_olabel) {}\n\n  explicit FactorWeightOptions(float delta = kDelta,\n                               uint32 mode = kFactorArcWeights |\n                                             kFactorFinalWeights,\n                               Label final_ilabel = 0, Label final_olabel = 0,\n                               bool increment_final_ilabel = false,\n                               bool increment_final_olabel = false)\n      : delta(delta),\n        mode(mode),\n        final_ilabel(final_ilabel),\n        final_olabel(final_olabel),\n        increment_final_ilabel(increment_final_ilabel),\n        increment_final_olabel(increment_final_olabel) {}\n};\n\n// A factor iterator takes as argument a weight w and returns a sequence of\n// pairs of weights (xi, yi) such that the sum of the products xi times yi is\n// equal to w. If w is fully factored, the iterator should return nothing.\n//\n// template <class W>\n// class FactorIterator {\n//  public:\n//   explicit FactorIterator(W w);\n//\n//   bool Done() const;\n//\n//   void Next();\n//\n//   std::pair<W, W> Value() const;\n//\n//   void Reset();\n// }\n\n// Factors trivially.\ntemplate <class W>\nclass IdentityFactor {\n public:\n  explicit IdentityFactor(const W &weight) {}\n\n  bool Done() const { return true; }\n\n  void Next() {}\n\n  std::pair<W, W> Value() const { return std::make_pair(W::One(), W::One()); }\n\n  void Reset() {}\n};\n\n// Factors a StringWeight w as 'ab' where 'a' is a label.\ntemplate <typename Label, StringType S = STRING_LEFT>\nclass StringFactor {\n public:\n  explicit StringFactor(const StringWeight<Label, S> &weight)\n      : weight_(weight), done_(weight.Size() <= 1) {}\n\n  bool Done() const { return done_; }\n\n  void Next() { done_ = true; }\n\n  std::pair<StringWeight<Label, S>, StringWeight<Label, S>> Value() const {\n    using Weight = StringWeight<Label, S>;\n    typename Weight::Iterator siter(weight_);\n    Weight w1(siter.Value());\n    Weight w2;\n    for (siter.Next(); !siter.Done(); siter.Next()) w2.PushBack(siter.Value());\n    return std::make_pair(w1, w2);\n  }\n\n  void Reset() { done_ = weight_.Size() <= 1; }\n\n private:\n  const StringWeight<Label, S> weight_;\n  bool done_;\n};\n\n// Factor a GallicWeight using StringFactor.\ntemplate <class Label, class W, GallicType G = GALLIC_LEFT>\nclass GallicFactor {\n public:\n  using GW = GallicWeight<Label, W, G>;\n\n  explicit GallicFactor(const GW &weight)\n      : weight_(weight), done_(weight.Value1().Size() <= 1) {}\n\n  bool Done() const { return done_; }\n\n  void Next() { done_ = true; }\n\n  std::pair<GW, GW> Value() const {\n    StringFactor<Label, GallicStringType(G)> siter(weight_.Value1());\n    GW w1(siter.Value().first, weight_.Value2());\n    GW w2(siter.Value().second, W::One());\n    return std::make_pair(w1, w2);\n  }\n\n  void Reset() { done_ = weight_.Value1().Size() <= 1; }\n\n private:\n  const GW weight_;\n  bool done_;\n};\n\n// Specialization for the (general) GALLIC type GallicWeight.\ntemplate <class Label, class W>\nclass GallicFactor<Label, W, GALLIC> {\n public:\n  using GW = GallicWeight<Label, W, GALLIC>;\n  using GRW = GallicWeight<Label, W, GALLIC_RESTRICT>;\n\n  explicit GallicFactor(const GW &weight)\n      : iter_(weight),\n        done_(weight.Size() == 0 ||\n              (weight.Size() == 1 && weight.Back().Value1().Size() <= 1)) {}\n\n  bool Done() const { return done_ || iter_.Done(); }\n\n  void Next() { iter_.Next(); }\n\n  void Reset() { iter_.Reset(); }\n\n  std::pair<GW, GW> Value() const {\n    const auto weight = iter_.Value();\n    StringFactor<Label, GallicStringType(GALLIC_RESTRICT)> siter(\n        weight.Value1());\n    GRW w1(siter.Value().first, weight.Value2());\n    GRW w2(siter.Value().second, W::One());\n    return std::make_pair(GW(w1), GW(w2));\n  }\n\n private:\n  UnionWeightIterator<GRW, GallicUnionWeightOptions<Label, W>> iter_;\n  bool done_;\n};\n\nnamespace internal {\n\n// Implementation class for FactorWeight\ntemplate <class Arc, class FactorIterator>\nclass FactorWeightFstImpl : public CacheImpl<Arc> {\n public:\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using FstImpl<Arc>::SetType;\n  using FstImpl<Arc>::SetProperties;\n  using FstImpl<Arc>::SetInputSymbols;\n  using FstImpl<Arc>::SetOutputSymbols;\n\n  using CacheBaseImpl<CacheState<Arc>>::PushArc;\n  using CacheBaseImpl<CacheState<Arc>>::HasStart;\n  using CacheBaseImpl<CacheState<Arc>>::HasFinal;\n  using CacheBaseImpl<CacheState<Arc>>::HasArcs;\n  using CacheBaseImpl<CacheState<Arc>>::SetArcs;\n  using CacheBaseImpl<CacheState<Arc>>::SetFinal;\n  using CacheBaseImpl<CacheState<Arc>>::SetStart;\n\n  struct Element {\n    Element() {}\n\n    Element(StateId s, Weight weight_) : state(s), weight(std::move(weight_)) {}\n\n    StateId state;  // Input state ID.\n    Weight weight;  // Residual weight.\n  };\n\n  FactorWeightFstImpl(const Fst<Arc> &fst, const FactorWeightOptions<Arc> &opts)\n      : CacheImpl<Arc>(opts),\n        fst_(fst.Copy()),\n        delta_(opts.delta),\n        mode_(opts.mode),\n        final_ilabel_(opts.final_ilabel),\n        final_olabel_(opts.final_olabel),\n        increment_final_ilabel_(opts.increment_final_ilabel),\n        increment_final_olabel_(opts.increment_final_olabel) {\n    SetType(\"factor_weight\");\n    const auto props = fst.Properties(kFstProperties, false);\n    SetProperties(FactorWeightProperties(props), kCopyProperties);\n    SetInputSymbols(fst.InputSymbols());\n    SetOutputSymbols(fst.OutputSymbols());\n    if (mode_ == 0) {\n      LOG(WARNING) << \"FactorWeightFst: Factor mode is set to 0; \"\n                   << \"factoring neither arc weights nor final weights\";\n    }\n  }\n\n  FactorWeightFstImpl(const FactorWeightFstImpl<Arc, FactorIterator> &impl)\n      : CacheImpl<Arc>(impl),\n        fst_(impl.fst_->Copy(true)),\n        delta_(impl.delta_),\n        mode_(impl.mode_),\n        final_ilabel_(impl.final_ilabel_),\n        final_olabel_(impl.final_olabel_),\n        increment_final_ilabel_(impl.increment_final_ilabel_),\n        increment_final_olabel_(impl.increment_final_olabel_) {\n    SetType(\"factor_weight\");\n    SetProperties(impl.Properties(), kCopyProperties);\n    SetInputSymbols(impl.InputSymbols());\n    SetOutputSymbols(impl.OutputSymbols());\n  }\n\n  StateId Start() {\n    if (!HasStart()) {\n      const auto s = fst_->Start();\n      if (s == kNoStateId) return kNoStateId;\n      SetStart(FindState(Element(fst_->Start(), Weight::One())));\n    }\n    return CacheImpl<Arc>::Start();\n  }\n\n  Weight Final(StateId s) {\n    if (!HasFinal(s)) {\n      const auto &element = elements_[s];\n      // TODO(sorenj): fix so cast is unnecessary\n      const auto weight =\n          element.state == kNoStateId\n              ? element.weight\n              : (Weight)Times(element.weight, fst_->Final(element.state));\n      FactorIterator siter(weight);\n      if (!(mode_ & kFactorFinalWeights) || siter.Done()) {\n        SetFinal(s, weight);\n      } else {\n        SetFinal(s, Weight::Zero());\n      }\n    }\n    return CacheImpl<Arc>::Final(s);\n  }\n\n  size_t NumArcs(StateId s) {\n    if (!HasArcs(s)) Expand(s);\n    return CacheImpl<Arc>::NumArcs(s);\n  }\n\n  size_t NumInputEpsilons(StateId s) {\n    if (!HasArcs(s)) Expand(s);\n    return CacheImpl<Arc>::NumInputEpsilons(s);\n  }\n\n  size_t NumOutputEpsilons(StateId s) {\n    if (!HasArcs(s)) Expand(s);\n    return CacheImpl<Arc>::NumOutputEpsilons(s);\n  }\n\n  uint64 Properties() const override { return Properties(kFstProperties); }\n\n  // Sets error if found, and returns other FST impl properties.\n  uint64 Properties(uint64 mask) const override {\n    if ((mask & kError) && fst_->Properties(kError, false)) {\n      SetProperties(kError, kError);\n    }\n    return FstImpl<Arc>::Properties(mask);\n  }\n\n  void InitArcIterator(StateId s, ArcIteratorData<Arc> *data) {\n    if (!HasArcs(s)) Expand(s);\n    CacheImpl<Arc>::InitArcIterator(s, data);\n  }\n\n  // Finds state corresponding to an element, creating new state if element not\n  // found.\n  StateId FindState(const Element &element) {\n    if (!(mode_ & kFactorArcWeights) && element.weight == Weight::One() &&\n        element.state != kNoStateId) {\n      while (unfactored_.size() <= element.state)\n        unfactored_.push_back(kNoStateId);\n      if (unfactored_[element.state] == kNoStateId) {\n        unfactored_[element.state] = elements_.size();\n        elements_.push_back(element);\n      }\n      return unfactored_[element.state];\n    } else {\n      const auto insert_result =\n          element_map_.insert(std::make_pair(element, elements_.size()));\n      if (insert_result.second) {\n        elements_.push_back(element);\n      }\n      return insert_result.first->second;\n    }\n  }\n\n  // Computes the outgoing transitions from a state, creating new destination\n  // states as needed.\n  void Expand(StateId s) {\n    const auto element = elements_[s];\n    if (element.state != kNoStateId) {\n      for (ArcIterator<Fst<Arc>> ait(*fst_, element.state); !ait.Done();\n           ait.Next()) {\n        const auto &arc = ait.Value();\n        const auto weight = Times(element.weight, arc.weight);\n        FactorIterator fiter(weight);\n        if (!(mode_ & kFactorArcWeights) || fiter.Done()) {\n          const auto dest = FindState(Element(arc.nextstate, Weight::One()));\n          PushArc(s, Arc(arc.ilabel, arc.olabel, weight, dest));\n        } else {\n          for (; !fiter.Done(); fiter.Next()) {\n            const auto &pair = fiter.Value();\n            const auto dest =\n                FindState(Element(arc.nextstate, pair.second.Quantize(delta_)));\n            PushArc(s, Arc(arc.ilabel, arc.olabel, pair.first, dest));\n          }\n        }\n      }\n    }\n    if ((mode_ & kFactorFinalWeights) &&\n        ((element.state == kNoStateId) ||\n         (fst_->Final(element.state) != Weight::Zero()))) {\n      const auto weight =\n          element.state == kNoStateId\n              ? element.weight\n              : Times(element.weight, fst_->Final(element.state));\n      auto ilabel = final_ilabel_;\n      auto olabel = final_olabel_;\n      for (FactorIterator fiter(weight); !fiter.Done(); fiter.Next()) {\n        const auto &pair = fiter.Value();\n        const auto dest =\n            FindState(Element(kNoStateId, pair.second.Quantize(delta_)));\n        PushArc(s, Arc(ilabel, olabel, pair.first, dest));\n        if (increment_final_ilabel_) ++ilabel;\n        if (increment_final_olabel_) ++olabel;\n      }\n    }\n    SetArcs(s);\n  }\n\n private:\n  // Equality function for Elements, assume weights have been quantized.\n  class ElementEqual {\n   public:\n    bool operator()(const Element &x, const Element &y) const {\n      return x.state == y.state && x.weight == y.weight;\n    }\n  };\n\n  // Hash function for Elements to Fst states.\n  class ElementKey {\n   public:\n    size_t operator()(const Element &x) const {\n      static constexpr auto prime = 7853;\n      return static_cast<size_t>(x.state * prime + x.weight.Hash());\n    }\n  };\n\n  using ElementMap =\n      std::unordered_map<Element, StateId, ElementKey, ElementEqual>;\n\n  std::unique_ptr<const Fst<Arc>> fst_;\n  float delta_;\n  uint32 mode_;         // Factoring arc and/or final weights.\n  Label final_ilabel_;  // ilabel of arc created when factoring final weights.\n  Label final_olabel_;  // olabel of arc created when factoring final weights.\n  bool increment_final_ilabel_;    // When factoring final weights results in\n  bool increment_final_olabel_;    // mutiple arcs, increment labels?\n  std::vector<Element> elements_;  // mapping from FST state to Element.\n  ElementMap element_map_;         // mapping from Element to FST state.\n  // Mapping between old/new StateId for states that do not need to be factored\n  // when mode_ is 0 or kFactorFinalWeights.\n  std::vector<StateId> unfactored_;\n};\n\n}  // namespace internal\n\n// FactorWeightFst takes as template parameter a FactorIterator as defined\n// above. The result of weight factoring is a transducer equivalent to the\n// input whose path weights have been factored according to the FactorIterator.\n// States and transitions will be added as necessary. The algorithm is a\n// generalization to arbitrary weights of the second step of the input\n// epsilon-normalization algorithm.\n//\n// This class attaches interface to implementation and handles reference\n// counting, delegating most methods to ImplToFst.\ntemplate <class A, class FactorIterator>\nclass FactorWeightFst\n    : public ImplToFst<internal::FactorWeightFstImpl<A, FactorIterator>> {\n public:\n  using Arc = A;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using Store = DefaultCacheStore<Arc>;\n  using State = typename Store::State;\n  using Impl = internal::FactorWeightFstImpl<Arc, FactorIterator>;\n\n  friend class ArcIterator<FactorWeightFst<Arc, FactorIterator>>;\n  friend class StateIterator<FactorWeightFst<Arc, FactorIterator>>;\n\n  explicit FactorWeightFst(const Fst<Arc> &fst)\n      : ImplToFst<Impl>(\n            std::make_shared<Impl>(fst, FactorWeightOptions<Arc>())) {}\n\n  FactorWeightFst(const Fst<Arc> &fst, const FactorWeightOptions<Arc> &opts)\n      : ImplToFst<Impl>(std::make_shared<Impl>(fst, opts)) {}\n\n  // See Fst<>::Copy() for doc.\n  FactorWeightFst(const FactorWeightFst<Arc, FactorIterator> &fst, bool copy)\n      : ImplToFst<Impl>(fst, copy) {}\n\n  // Get a copy of this FactorWeightFst. See Fst<>::Copy() for further doc.\n  FactorWeightFst<Arc, FactorIterator> *Copy(bool copy = false) const override {\n    return new FactorWeightFst<Arc, FactorIterator>(*this, copy);\n  }\n\n  inline void InitStateIterator(StateIteratorData<Arc> *data) const override;\n\n  void InitArcIterator(StateId s, ArcIteratorData<Arc> *data) const override {\n    GetMutableImpl()->InitArcIterator(s, data);\n  }\n\n private:\n  using ImplToFst<Impl>::GetImpl;\n  using ImplToFst<Impl>::GetMutableImpl;\n\n  FactorWeightFst &operator=(const FactorWeightFst &) = delete;\n};\n\n// Specialization for FactorWeightFst.\ntemplate <class Arc, class FactorIterator>\nclass StateIterator<FactorWeightFst<Arc, FactorIterator>>\n    : public CacheStateIterator<FactorWeightFst<Arc, FactorIterator>> {\n public:\n  explicit StateIterator(const FactorWeightFst<Arc, FactorIterator> &fst)\n      : CacheStateIterator<FactorWeightFst<Arc, FactorIterator>>(\n            fst, fst.GetMutableImpl()) {}\n};\n\n// Specialization for FactorWeightFst.\ntemplate <class Arc, class FactorIterator>\nclass ArcIterator<FactorWeightFst<Arc, FactorIterator>>\n    : public CacheArcIterator<FactorWeightFst<Arc, FactorIterator>> {\n public:\n  using StateId = typename Arc::StateId;\n\n  ArcIterator(const FactorWeightFst<Arc, FactorIterator> &fst, StateId s)\n      : CacheArcIterator<FactorWeightFst<Arc, FactorIterator>>(\n            fst.GetMutableImpl(), s) {\n    if (!fst.GetImpl()->HasArcs(s)) fst.GetMutableImpl()->Expand(s);\n  }\n};\n\ntemplate <class Arc, class FactorIterator>\ninline void FactorWeightFst<Arc, FactorIterator>::InitStateIterator(\n    StateIteratorData<Arc> *data) const {\n  data->base = new StateIterator<FactorWeightFst<Arc, FactorIterator>>(*this);\n}\n\n}  // namespace fst\n\n#endif  // FST_FACTOR_WEIGHT_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/filter-state.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Classes for storing filter state in various algorithms like composition.\n\n#ifndef FST_FILTER_STATE_H_\n#define FST_FILTER_STATE_H_\n\n#include <forward_list>\n#include <utility>\n\n#include <fst/fst-decl.h>  // For optional argument declarations\n#include <fst/fst.h>\n#include <fst/matcher.h>\n\n\nnamespace fst {\n\n// The filter state interface represents the state of a (e.g., composition)\n// filter.\n//\n// class FilterState {\n//  public:\n//   // Required constructors.\n//\n//   FilterState();\n//\n//   FilterState(const FilterState &fs);\n//\n//   // An invalid filter state.\n//   static const FilterState NoState();\n//\n//   // Maps state to integer for hashing.\n//   size_t Hash() const;\n//\n//   // Equality of filter states.\n//   bool operator==(const FilterState &fs) const;\n//\n//   // Inequality of filter states.\n//   bool operator!=(const FilterState &fs) const;\n//\n//   // Assignment to filter states.\n//   FilterState &operator=(const FilterState& fs);\n// };\n\n// Filter state that is a signed integral type.\ntemplate <typename T>\nclass IntegerFilterState {\n public:\n  IntegerFilterState() : state_(kNoStateId) {}\n\n  explicit IntegerFilterState(T s) : state_(s) {}\n\n  static const IntegerFilterState NoState() { return IntegerFilterState(); }\n\n  size_t Hash() const { return static_cast<size_t>(state_); }\n\n  bool operator==(const IntegerFilterState &fs) const {\n    return state_ == fs.state_;\n  }\n\n  bool operator!=(const IntegerFilterState &fs) const {\n    return state_ != fs.state_;\n  }\n\n  T GetState() const { return state_; }\n\n  void SetState(T state) { state_ = state; }\n\n private:\n  T state_;\n};\n\nusing CharFilterState = IntegerFilterState<signed char>;\nusing ShortFilterState = IntegerFilterState<short>;  // NOLINT\nusing IntFilterState = IntegerFilterState<int>;\n\n// Filter state that is a weight (class).\ntemplate <class W>\nclass WeightFilterState {\n public:\n  WeightFilterState() : weight_(W::Zero()) {}\n\n  explicit WeightFilterState(W weight) : weight_(std::move(weight)) {}\n\n  static const WeightFilterState NoState() { return WeightFilterState(); }\n\n  size_t Hash() const { return weight_.Hash(); }\n\n  bool operator==(const WeightFilterState &fs) const {\n    return weight_ == fs.weight_;\n  }\n\n  bool operator!=(const WeightFilterState &fs) const {\n    return weight_ != fs.weight_;\n  }\n\n  W GetWeight() const { return weight_; }\n\n  void SetWeight(W weight) { weight_ = std::move(weight); }\n\n private:\n  W weight_;\n};\n\n// Filter state is a list of signed integer types T. Order matters\n// for equality.\ntemplate <typename T>\nclass ListFilterState {\n public:\n  ListFilterState() {}\n\n  explicit ListFilterState(T s) { list_.push_front(s); }\n\n  static const ListFilterState NoState() { return ListFilterState(kNoStateId); }\n\n  size_t Hash() const {\n    size_t h = 0;\n    for (const auto &elem : list_) h ^= h << 1 ^ elem;\n    return h;\n  }\n\n  bool operator==(const ListFilterState &fs) const { return list_ == fs.list_; }\n\n  bool operator!=(const ListFilterState &fs) const { return list_ != fs.list_; }\n\n  const std::forward_list<T> &GetState() const { return list_; }\n\n  std::forward_list<T> *GetMutableState() { return &list_; }\n\n  void SetState(const std::forward_list<T> &state) { list_ = state; }\n\n private:\n  std::forward_list<T> list_;\n};\n\n// Filter state that is the combination of two filter states.\ntemplate <class FS1, class FS2>\nclass PairFilterState {\n public:\n  PairFilterState() : fs1_(FS1::NoState()), fs2_(FS2::NoState()) {}\n\n  PairFilterState(const FS1 &fs1, const FS2 &fs2) : fs1_(fs1), fs2_(fs2) {}\n\n  static const PairFilterState NoState() { return PairFilterState(); }\n\n  size_t Hash() const {\n    const auto h1 = fs1_.Hash();\n    static constexpr auto lshift = 5;\n    static constexpr auto rshift = CHAR_BIT * sizeof(size_t) - 5;\n    return h1 << lshift ^ h1 >> rshift ^ fs2_.Hash();\n  }\n\n  bool operator==(const PairFilterState &fs) const {\n    return fs1_ == fs.fs1_ && fs2_ == fs.fs2_;\n  }\n\n  bool operator!=(const PairFilterState &fs) const {\n    return fs1_ != fs.fs1_ || fs2_ != fs.fs2_;\n  }\n\n  const FS1 &GetState1() const { return fs1_; }\n\n  const FS2 &GetState2() const { return fs2_; }\n\n  void SetState(const FS1 &fs1, const FS2 &fs2) {\n    fs1_ = fs1;\n    fs2_ = fs2;\n  }\n\n private:\n  FS1 fs1_;\n  FS2 fs2_;\n};\n\n// Single non-blocking filter state.\nclass TrivialFilterState {\n public:\n  explicit TrivialFilterState(bool state = false) : state_(state) {}\n\n  static const TrivialFilterState NoState() { return TrivialFilterState(); }\n\n  size_t Hash() const { return 0; }\n\n  bool operator==(const TrivialFilterState &fs) const {\n    return state_ == fs.state_;\n  }\n\n  bool operator!=(const TrivialFilterState &fs) const {\n    return state_ != fs.state_;\n  }\n\n private:\n  bool state_;\n};\n\n}  // namespace fst\n\n#endif  // FST_FILTER_STATE_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/flags.h",
    "content": "// Licensed under the Apache License, Version 2.0 (the \"License\");\n// you may not use this file except in compliance with the License.\n// You may obtain a copy of the License at\n//\n//      http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n// See the License for the specific language governing permissions and\n// limitations under the License.\n//\n// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n// \n// Google-style flag handling declarations and inline definitions.\n\n#ifndef FST_LIB_FLAGS_H_\n#define FST_LIB_FLAGS_H_\n\n#include <cstdlib>\n\n#include <iostream>\n#include <map>\n#include <set>\n#include <sstream>\n#include <string>\n\n#include <fst/types.h>\n#include <fst/lock.h>\n\nusing std::string;\n\n// FLAGS USAGE:\n//\n// Definition example:\n//\n//    DEFINE_int32(length, 0, \"length\");\n//\n// This defines variable FLAGS_length, initialized to 0.\n//\n// Declaration example:\n//\n//    DECLARE_int32(length);\n//\n// SET_FLAGS() can be used to set flags from the command line\n// using, for example, '--length=2'.\n//\n// ShowUsage() can be used to print out command and flag usage.\n\n#define DECLARE_bool(name) extern bool FLAGS_ ## name\n#define DECLARE_string(name) extern string FLAGS_ ## name\n#define DECLARE_int32(name) extern int32 FLAGS_ ## name\n#define DECLARE_int64(name) extern int64 FLAGS_ ## name\n#define DECLARE_double(name) extern double FLAGS_ ## name\n\ntemplate <typename T>\nstruct FlagDescription {\n  FlagDescription(T *addr, const char *doc, const char *type,\n\t\t  const char *file, const T val)\n      : address(addr),\n    doc_string(doc),\n    type_name(type),\n    file_name(file),\n    default_value(val) {}\n\n  T *address;\n  const char *doc_string;\n  const char *type_name;\n  const char *file_name;\n  const T default_value;\n};\n\ntemplate <typename T>\nclass FlagRegister {\n public:\n  static FlagRegister<T> *GetRegister() {\n    static auto reg = new FlagRegister<T>;\n    return reg;\n  }\n\n  const FlagDescription<T> &GetFlagDescription(const string &name) const {\n    fst::MutexLock l(&flag_lock_);\n    auto it = flag_table_.find(name);\n    return it != flag_table_.end() ? it->second : 0;\n  }\n\n  void SetDescription(const string &name,\n                      const FlagDescription<T> &desc) {\n    fst::MutexLock l(&flag_lock_);\n    flag_table_.insert(make_pair(name, desc));\n  }\n\n  bool SetFlag(const string &val, bool *address) const {\n    if (val == \"true\" || val == \"1\" || val.empty()) {\n      *address = true;\n      return true;\n    } else if (val == \"false\" || val == \"0\") {\n      *address = false;\n      return true;\n    }\n    else {\n      return false;\n    }\n  }\n\n  bool SetFlag(const string &val, string *address) const {\n    *address = val;\n    return true;\n  }\n\n  bool SetFlag(const string &val, int32 *address) const {\n    char *p = 0;\n    *address = strtol(val.c_str(), &p, 0);\n    return !val.empty() && *p == '\\0';\n  }\n\n  bool SetFlag(const string &val, int64 *address) const {\n    char *p = 0;\n    *address = strtoll(val.c_str(), &p, 0);\n    return !val.empty() && *p == '\\0';\n  }\n\n  bool SetFlag(const string &val, double *address) const {\n    char *p = 0;\n    *address = strtod(val.c_str(), &p);\n    return !val.empty() && *p == '\\0';\n  }\n\n  bool SetFlag(const string &arg, const string &val) const {\n    for (typename std::map< string, FlagDescription<T> >::const_iterator it =\n           flag_table_.begin();\n         it != flag_table_.end();\n         ++it) {\n      const string &name = it->first;\n      const FlagDescription<T> &desc = it->second;\n      if (arg == name)\n        return SetFlag(val, desc.address);\n    }\n    return false;\n  }\n\n  void GetUsage(std::set<std::pair<string, string>> *usage_set) const {\n    for (auto it = flag_table_.begin(); it != flag_table_.end(); ++it) {\n      const string &name = it->first;\n      const FlagDescription<T> &desc = it->second;\n      string usage = \"  --\" + name;\n      usage += \": type = \";\n      usage += desc.type_name;\n      usage += \", default = \";\n      usage += GetDefault(desc.default_value) + \"\\n  \";\n      usage += desc.doc_string;\n      usage_set->insert(make_pair(desc.file_name, usage));\n    }\n  }\n\n private:\n  string GetDefault(bool default_value) const {\n    return default_value ? \"true\" : \"false\";\n  }\n\n  string GetDefault(const string &default_value) const {\n    return \"\\\"\" + default_value + \"\\\"\";\n  }\n\n  template <class V>\n  string GetDefault(const V &default_value) const {\n    std::ostringstream strm;\n    strm << default_value;\n    return strm.str();\n  }\n\n  mutable fst::Mutex flag_lock_;        // Multithreading lock.\n  std::map<string, FlagDescription<T>> flag_table_;\n};\n\ntemplate <typename T>\nclass FlagRegisterer {\n public:\n  FlagRegisterer(const string &name, const FlagDescription<T> &desc) {\n    auto registr = FlagRegister<T>::GetRegister();\n    registr->SetDescription(name, desc);\n  }\n\n private:\n  FlagRegisterer(const FlagRegisterer &) = delete;\n  FlagRegisterer &operator=(const FlagRegisterer &) = delete;\n};\n\n\n#define DEFINE_VAR(type, name, value, doc)                                \\\n  type FLAGS_ ## name = value;                                            \\\n  static FlagRegisterer<type>                                             \\\n  name ## _flags_registerer(#name, FlagDescription<type>(&FLAGS_ ## name, \\\n                                                         doc,             \\\n                                                         #type,           \\\n                                                         __FILE__,        \\\n                                                         value))\n\n#define DEFINE_bool(name, value, doc) DEFINE_VAR(bool, name, value, doc)\n#define DEFINE_string(name, value, doc) \\\n  DEFINE_VAR(string, name, value, doc)\n#define DEFINE_int32(name, value, doc) DEFINE_VAR(int32, name, value, doc)\n#define DEFINE_int64(name, value, doc) DEFINE_VAR(int64, name, value, doc)\n#define DEFINE_double(name, value, doc) DEFINE_VAR(double, name, value, doc)\n\n\n// Temporary directory.\nDECLARE_string(tmpdir);\n\nvoid SetFlags(const char *usage, int *argc, char ***argv, bool remove_flags,\n              const char *src = \"\");\n\n#define SET_FLAGS(usage, argc, argv, rmflags) \\\nSetFlags(usage, argc, argv, rmflags, __FILE__)\n\n// Deprecated; for backward compatibility.\ninline void InitFst(const char *usage, int *argc, char ***argv, bool rmflags) {\n  return SetFlags(usage, argc, argv, rmflags);\n}\n\nvoid ShowUsage(bool long_usage = true);\n\n#endif  // FST_LIB_FLAGS_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/float-weight.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Float weight set and associated semiring operation definitions.\n\n#ifndef FST_FLOAT_WEIGHT_H_\n#define FST_FLOAT_WEIGHT_H_\n\n#include <climits>\n#include <cmath>\n#include <cstdlib>\n#include <cstring>\n\n#include <algorithm>\n#include <limits>\n#include <sstream>\n#include <string>\n\n#include <fst/util.h>\n#include <fst/weight.h>\n\n\nnamespace fst {\n\n// Numeric limits class.\ntemplate <class T>\nclass FloatLimits {\n public:\n  static constexpr T PosInfinity() {\n    return std::numeric_limits<T>::infinity();\n  }\n\n  static constexpr T NegInfinity() { return -PosInfinity(); }\n\n  static constexpr T NumberBad() { return std::numeric_limits<T>::quiet_NaN(); }\n};\n\n// Weight class to be templated on floating-points types.\ntemplate <class T = float>\nclass FloatWeightTpl {\n public:\n  using ValueType = T;\n\n  FloatWeightTpl() {}\n\n  FloatWeightTpl(T f) : value_(f) {}\n\n  FloatWeightTpl(const FloatWeightTpl<T> &weight) : value_(weight.value_) {}\n\n  FloatWeightTpl<T> &operator=(const FloatWeightTpl<T> &weight) {\n    value_ = weight.value_;\n    return *this;\n  }\n\n  std::istream &Read(std::istream &strm) { return ReadType(strm, &value_); }\n\n  std::ostream &Write(std::ostream &strm) const {\n    return WriteType(strm, value_);\n  }\n\n  size_t Hash() const {\n    size_t hash = 0;\n    // Avoid using union, which would be undefined behavior.\n    // Use memcpy, similar to bit_cast, but sizes may be different.\n    // This should be optimized into a single move instruction by\n    // any reasonable compiler.\n    std::memcpy(&hash, &value_, std::min(sizeof(hash), sizeof(value_)));\n    return hash;\n  }\n\n  const T &Value() const { return value_; }\n\n protected:\n  void SetValue(const T &f) { value_ = f; }\n\n  static constexpr const char *GetPrecisionString() {\n    return sizeof(T) == 4\n               ? \"\"\n               : sizeof(T) == 1\n                     ? \"8\"\n                     : sizeof(T) == 2 ? \"16\"\n                                      : sizeof(T) == 8 ? \"64\" : \"unknown\";\n  }\n\n private:\n  T value_;\n};\n\n// Single-precision float weight.\nusing FloatWeight = FloatWeightTpl<float>;\n\ntemplate <class T>\ninline bool operator==(const FloatWeightTpl<T> &w1,\n                       const FloatWeightTpl<T> &w2) {\n  // Volatile qualifier thwarts over-aggressive compiler optimizations that\n  // lead to problems esp. with NaturalLess().\n  volatile T v1 = w1.Value();\n  volatile T v2 = w2.Value();\n  return v1 == v2;\n}\n\n// These seemingly unnecessary overloads are actually needed to make\n// comparisons like FloatWeightTpl<float> == float compile.  If only the\n// templated version exists, the FloatWeightTpl<float>(float) conversion\n// won't be found.\ninline bool operator==(const FloatWeightTpl<float> &w1,\n                       const FloatWeightTpl<float> &w2) {\n  return operator==<float>(w1, w2);\n}\n\ninline bool operator==(const FloatWeightTpl<double> &w1,\n                       const FloatWeightTpl<double> &w2) {\n  return operator==<double>(w1, w2);\n}\n\ntemplate <class T>\ninline bool operator!=(const FloatWeightTpl<T> &w1,\n                       const FloatWeightTpl<T> &w2) {\n  return !(w1 == w2);\n}\n\ninline bool operator!=(const FloatWeightTpl<float> &w1,\n                       const FloatWeightTpl<float> &w2) {\n  return operator!=<float>(w1, w2);\n}\n\ninline bool operator!=(const FloatWeightTpl<double> &w1,\n                       const FloatWeightTpl<double> &w2) {\n  return operator!=<double>(w1, w2);\n}\n\ntemplate <class T>\ninline bool ApproxEqual(const FloatWeightTpl<T> &w1,\n                        const FloatWeightTpl<T> &w2, float delta = kDelta) {\n  return w1.Value() <= w2.Value() + delta && w2.Value() <= w1.Value() + delta;\n}\n\ntemplate <class T>\ninline std::ostream &operator<<(std::ostream &strm,\n                                const FloatWeightTpl<T> &w) {\n  if (w.Value() == FloatLimits<T>::PosInfinity()) {\n    return strm << \"Infinity\";\n  } else if (w.Value() == FloatLimits<T>::NegInfinity()) {\n    return strm << \"-Infinity\";\n  } else if (w.Value() != w.Value()) {  // Fails for IEEE NaN.\n    return strm << \"BadNumber\";\n  } else {\n    return strm << w.Value();\n  }\n}\n\ntemplate <class T>\ninline std::istream &operator>>(std::istream &strm, FloatWeightTpl<T> &w) {\n  string s;\n  strm >> s;\n  if (s == \"Infinity\") {\n    w = FloatWeightTpl<T>(FloatLimits<T>::PosInfinity());\n  } else if (s == \"-Infinity\") {\n    w = FloatWeightTpl<T>(FloatLimits<T>::NegInfinity());\n  } else {\n    char *p;\n    T f = strtod(s.c_str(), &p);\n    if (p < s.c_str() + s.size()) {\n      strm.clear(std::ios::badbit);\n    } else {\n      w = FloatWeightTpl<T>(f);\n    }\n  }\n  return strm;\n}\n\n// Tropical semiring: (min, +, inf, 0).\ntemplate <class T>\nclass TropicalWeightTpl : public FloatWeightTpl<T> {\n public:\n  using typename FloatWeightTpl<T>::ValueType;\n  using FloatWeightTpl<T>::Value;\n  using ReverseWeight = TropicalWeightTpl<T>;\n  using Limits = FloatLimits<T>;\n\n  constexpr TropicalWeightTpl() : FloatWeightTpl<T>() {}\n\n  constexpr TropicalWeightTpl(T f) : FloatWeightTpl<T>(f) {}\n\n  constexpr TropicalWeightTpl(const TropicalWeightTpl<T> &weight)\n      : FloatWeightTpl<T>(weight) {}\n\n  static const TropicalWeightTpl<T> &Zero() {\n    static const TropicalWeightTpl zero(Limits::PosInfinity());\n    return zero;\n  }\n\n  static const TropicalWeightTpl<T> &One() {\n    static const TropicalWeightTpl one(0.0F);\n    return one;\n  }\n\n  static const TropicalWeightTpl<T> &NoWeight() {\n    static const TropicalWeightTpl no_weight(Limits::NumberBad());\n    return no_weight;\n  }\n\n  static const string &Type() {\n    static const string *const type =\n        new string(string(\"tropical\") +\n                   FloatWeightTpl<T>::GetPrecisionString());\n    return *type;\n  }\n\n  bool Member() const {\n    // First part fails for IEEE NaN.\n    return Value() == Value() && Value() != Limits::NegInfinity();\n  }\n\n  TropicalWeightTpl<T> Quantize(float delta = kDelta) const {\n    if (!Member() || Value() == Limits::PosInfinity()) {\n      return *this;\n    } else {\n      return TropicalWeightTpl<T>(floor(Value() / delta + 0.5F) * delta);\n    }\n  }\n\n  TropicalWeightTpl<T> Reverse() const { return *this; }\n\n  static constexpr uint64 Properties() {\n    return kLeftSemiring | kRightSemiring | kCommutative | kPath | kIdempotent;\n  }\n};\n\n// Single precision tropical weight.\nusing TropicalWeight = TropicalWeightTpl<float>;\n\ntemplate <class T>\ninline TropicalWeightTpl<T> Plus(const TropicalWeightTpl<T> &w1,\n                                 const TropicalWeightTpl<T> &w2) {\n  if (!w1.Member() || !w2.Member()) return TropicalWeightTpl<T>::NoWeight();\n  return w1.Value() < w2.Value() ? w1 : w2;\n}\n\n// See comment at operator==(FloatWeightTpl<float>, FloatWeightTpl<float>)\n// for why these overloads are present.\ninline TropicalWeightTpl<float> Plus(const TropicalWeightTpl<float> &w1,\n                                     const TropicalWeightTpl<float> &w2) {\n  return Plus<float>(w1, w2);\n}\n\ninline TropicalWeightTpl<double> Plus(const TropicalWeightTpl<double> &w1,\n                                      const TropicalWeightTpl<double> &w2) {\n  return Plus<double>(w1, w2);\n}\n\ntemplate <class T>\ninline TropicalWeightTpl<T> Times(const TropicalWeightTpl<T> &w1,\n                                  const TropicalWeightTpl<T> &w2) {\n  using Limits = FloatLimits<T>;\n  if (!w1.Member() || !w2.Member()) return TropicalWeightTpl<T>::NoWeight();\n  const T f1 = w1.Value();\n  const T f2 = w2.Value();\n  if (f1 == Limits::PosInfinity()) {\n    return w1;\n  } else if (f2 == Limits::PosInfinity()) {\n    return w2;\n  } else {\n    return TropicalWeightTpl<T>(f1 + f2);\n  }\n}\n\ninline TropicalWeightTpl<float> Times(const TropicalWeightTpl<float> &w1,\n                                      const TropicalWeightTpl<float> &w2) {\n  return Times<float>(w1, w2);\n}\n\ninline TropicalWeightTpl<double> Times(const TropicalWeightTpl<double> &w1,\n                                       const TropicalWeightTpl<double> &w2) {\n  return Times<double>(w1, w2);\n}\n\ntemplate <class T>\ninline TropicalWeightTpl<T> Divide(const TropicalWeightTpl<T> &w1,\n                                   const TropicalWeightTpl<T> &w2,\n                                   DivideType typ = DIVIDE_ANY) {\n  using Limits = FloatLimits<T>;\n  if (!w1.Member() || !w2.Member()) return TropicalWeightTpl<T>::NoWeight();\n  const T f1 = w1.Value();\n  const T f2 = w2.Value();\n  if (f2 == Limits::PosInfinity()) {\n    return Limits::NumberBad();\n  } else if (f1 == Limits::PosInfinity()) {\n    return Limits::PosInfinity();\n  } else {\n    return TropicalWeightTpl<T>(f1 - f2);\n  }\n}\n\ninline TropicalWeightTpl<float> Divide(const TropicalWeightTpl<float> &w1,\n                                       const TropicalWeightTpl<float> &w2,\n                                       DivideType typ = DIVIDE_ANY) {\n  return Divide<float>(w1, w2, typ);\n}\n\ninline TropicalWeightTpl<double> Divide(const TropicalWeightTpl<double> &w1,\n                                        const TropicalWeightTpl<double> &w2,\n                                        DivideType typ = DIVIDE_ANY) {\n  return Divide<double>(w1, w2, typ);\n}\n\ntemplate <class T, class V>\ninline TropicalWeightTpl<T> Power(const TropicalWeightTpl<T> &weight, V n) {\n  if (n == 0) {\n    return TropicalWeightTpl<T>::One();\n  } else if (weight == TropicalWeightTpl<T>::Zero()) {\n    return TropicalWeightTpl<T>::Zero();\n  }\n  return TropicalWeightTpl<T>(weight.Value() * n);\n}\n\n// Specializes the library-wide template to use the above implementation; rules\n// of function template instantiation require this be a full instantiation.\n\ntemplate <>\ninline TropicalWeightTpl<float> Power<TropicalWeightTpl<float>>(\n    const TropicalWeightTpl<float> &weight, size_t n) {\n  return Power<float, size_t>(weight, n);\n}\n\ntemplate <>\ninline TropicalWeightTpl<double> Power<TropicalWeightTpl<double>>(\n    const TropicalWeightTpl<double> &weight, size_t n) {\n  return Power<double, size_t>(weight, n);\n}\n\n\n// Log semiring: (log(e^-x + e^-y), +, inf, 0).\ntemplate <class T>\nclass LogWeightTpl : public FloatWeightTpl<T> {\n public:\n  using typename FloatWeightTpl<T>::ValueType;\n  using FloatWeightTpl<T>::Value;\n  using ReverseWeight = LogWeightTpl;\n  using Limits = FloatLimits<T>;\n\n  constexpr LogWeightTpl() : FloatWeightTpl<T>() {}\n\n  constexpr LogWeightTpl(T f) : FloatWeightTpl<T>(f) {}\n\n  constexpr LogWeightTpl(const LogWeightTpl<T> &weight)\n      : FloatWeightTpl<T>(weight) {}\n\n  static const LogWeightTpl &Zero() {\n    static const LogWeightTpl zero(Limits::PosInfinity());\n    return zero;\n  }\n\n  static const LogWeightTpl &One() {\n    static const LogWeightTpl one(0.0F);\n    return one;\n  }\n\n  static const LogWeightTpl &NoWeight() {\n    static const LogWeightTpl no_weight(Limits::NumberBad());\n    return no_weight;\n  }\n\n  static const string &Type() {\n    static const string *const type =\n        new string(string(\"log\") + FloatWeightTpl<T>::GetPrecisionString());\n    return *type;\n  }\n\n  bool Member() const {\n    // First part fails for IEEE NaN.\n    return Value() == Value() && Value() != Limits::NegInfinity();\n  }\n\n  LogWeightTpl<T> Quantize(float delta = kDelta) const {\n    if (!Member() || Value() == Limits::PosInfinity()) {\n      return *this;\n    } else {\n      return LogWeightTpl<T>(floor(Value() / delta + 0.5F) * delta);\n    }\n  }\n\n  LogWeightTpl<T> Reverse() const { return *this; }\n\n  static constexpr uint64 Properties() {\n    return kLeftSemiring | kRightSemiring | kCommutative;\n  }\n};\n\n// Single-precision log weight.\nusing LogWeight = LogWeightTpl<float>;\n\n// Double-precision log weight.\nusing Log64Weight = LogWeightTpl<double>;\n\nnamespace internal {\n\n// -log(e^-x + e^-y) = x - LogPosExp(y - x), assuming x >= 0.0.\ninline double LogPosExp(double x) {\n  DCHECK(!(x < 0));  // NB: NaN values are allowed.\n  return log1p(exp(-x));\n}\n\n// -log(e^-x - e^-y) = x - LogNegExp(y - x), assuming x > 0.0.\ninline double LogNegExp(double x) {\n  DCHECK_GT(x, 0);\n  return log1p(-exp(-x));\n}\n\n// a +_log b = -log(e^-a + e^-b) = KahanLogSum(a, b, ...).\n// Kahan compensated summation provides an error bound that is\n// independent of the number of addends. Assumes b >= a;\n// c is the compensation.\ninline double KahanLogSum(double a, double b, double *c) {\n  DCHECK_GE(b, a);\n  double y = -LogPosExp(b - a) - *c;\n  double t = a + y;\n  *c = (t - a) - y;\n  return t;\n}\n\n// a -_log b = -log(e^-a - e^-b) = KahanLogDiff(a, b, ...).\n// Kahan compensated summation provides an error bound that is\n// independent of the number of addends. Assumes b > a;\n// c is the compensation.\ninline double KahanLogDiff(double a, double b, double *c) {\n  DCHECK_GT(b, a);\n  double y = -LogNegExp(b - a) - *c;\n  double t = a + y;\n  *c = (t - a) - y;\n  return t;\n}\n\n}  // namespace internal\n\ntemplate <class T>\ninline LogWeightTpl<T> Plus(const LogWeightTpl<T> &w1,\n                            const LogWeightTpl<T> &w2) {\n  using Limits = FloatLimits<T>;\n  const T f1 = w1.Value();\n  const T f2 = w2.Value();\n  if (f1 == Limits::PosInfinity()) {\n    return w2;\n  } else if (f2 == Limits::PosInfinity()) {\n    return w1;\n  } else if (f1 > f2) {\n    return LogWeightTpl<T>(f2 - internal::LogPosExp(f1 - f2));\n  } else {\n    return LogWeightTpl<T>(f1 - internal::LogPosExp(f2 - f1));\n  }\n}\n\ninline LogWeightTpl<float> Plus(const LogWeightTpl<float> &w1,\n                                const LogWeightTpl<float> &w2) {\n  return Plus<float>(w1, w2);\n}\n\ninline LogWeightTpl<double> Plus(const LogWeightTpl<double> &w1,\n                                 const LogWeightTpl<double> &w2) {\n  return Plus<double>(w1, w2);\n}\n\ntemplate <class T>\ninline LogWeightTpl<T> Times(const LogWeightTpl<T> &w1,\n                             const LogWeightTpl<T> &w2) {\n  using Limits = FloatLimits<T>;\n  if (!w1.Member() || !w2.Member()) return LogWeightTpl<T>::NoWeight();\n  const T f1 = w1.Value();\n  const T f2 = w2.Value();\n  if (f1 == Limits::PosInfinity()) {\n    return w1;\n  } else if (f2 == Limits::PosInfinity()) {\n    return w2;\n  } else {\n    return LogWeightTpl<T>(f1 + f2);\n  }\n}\n\ninline LogWeightTpl<float> Times(const LogWeightTpl<float> &w1,\n                                 const LogWeightTpl<float> &w2) {\n  return Times<float>(w1, w2);\n}\n\ninline LogWeightTpl<double> Times(const LogWeightTpl<double> &w1,\n                                  const LogWeightTpl<double> &w2) {\n  return Times<double>(w1, w2);\n}\n\ntemplate <class T>\ninline LogWeightTpl<T> Divide(const LogWeightTpl<T> &w1,\n                              const LogWeightTpl<T> &w2,\n                              DivideType typ = DIVIDE_ANY) {\n  using Limits = FloatLimits<T>;\n  if (!w1.Member() || !w2.Member()) return LogWeightTpl<T>::NoWeight();\n  const T f1 = w1.Value();\n  const T f2 = w2.Value();\n  if (f2 == Limits::PosInfinity()) {\n    return Limits::NumberBad();\n  } else if (f1 == Limits::PosInfinity()) {\n    return Limits::PosInfinity();\n  } else {\n    return LogWeightTpl<T>(f1 - f2);\n  }\n}\n\ninline LogWeightTpl<float> Divide(const LogWeightTpl<float> &w1,\n                                  const LogWeightTpl<float> &w2,\n                                  DivideType typ = DIVIDE_ANY) {\n  return Divide<float>(w1, w2, typ);\n}\n\ninline LogWeightTpl<double> Divide(const LogWeightTpl<double> &w1,\n                                   const LogWeightTpl<double> &w2,\n                                   DivideType typ = DIVIDE_ANY) {\n  return Divide<double>(w1, w2, typ);\n}\n\ntemplate <class T, class V>\ninline LogWeightTpl<T> Power(const LogWeightTpl<T> &weight, V n) {\n  if (n == 0) {\n    return LogWeightTpl<T>::One();\n  } else if (weight == LogWeightTpl<T>::Zero()) {\n    return LogWeightTpl<T>::Zero();\n  }\n  return LogWeightTpl<T>(weight.Value() * n);\n}\n\n// Specializes the library-wide template to use the above implementation; rules\n// of function template instantiation require this be a full instantiation.\n\ntemplate <>\ninline LogWeightTpl<float> Power<LogWeightTpl<float>>(\n    const LogWeightTpl<float> &weight, size_t n) {\n  return Power<float, size_t>(weight, n);\n}\n\ntemplate <>\ninline LogWeightTpl<double> Power<LogWeightTpl<double>>(\n    const LogWeightTpl<double> &weight, size_t n) {\n  return Power<double, size_t>(weight, n);\n}\n\n// Specialization using the Kahan compensated summation.\ntemplate <class T>\nclass Adder<LogWeightTpl<T>> {\n public:\n  using Weight = LogWeightTpl<T>;\n\n  explicit Adder(Weight w = Weight::Zero())\n      : sum_(w.Value()),\n        c_(0.0) { }\n\n  Weight Add(const Weight &w) {\n    using Limits = FloatLimits<T>;\n    const T f = w.Value();\n    if (f == Limits::PosInfinity()) {\n      return Sum();\n    } else if (sum_ == Limits::PosInfinity()) {\n      sum_ = f;\n      c_ = 0.0;\n    } else if (f > sum_) {\n      sum_ = internal::KahanLogSum(sum_, f, &c_);\n    } else {\n      sum_ = internal::KahanLogSum(f, sum_, &c_);\n    }\n    return Sum();\n  }\n\n  Weight Sum() { return Weight(sum_); }\n\n  void Reset(Weight w = Weight::Zero()) {\n    sum_ = w.Value();\n    c_ = 0.0;\n  }\n\n private:\n  double sum_;\n  double c_;   // Kahan compensation.\n};\n\n// MinMax semiring: (min, max, inf, -inf).\ntemplate <class T>\nclass MinMaxWeightTpl : public FloatWeightTpl<T> {\n public:\n  using typename FloatWeightTpl<T>::ValueType;\n  using FloatWeightTpl<T>::Value;\n  using ReverseWeight = MinMaxWeightTpl<T>;\n  using Limits = FloatLimits<T>;\n\n  MinMaxWeightTpl() : FloatWeightTpl<T>() {}\n\n  MinMaxWeightTpl(T f) : FloatWeightTpl<T>(f) {}\n\n  MinMaxWeightTpl(const MinMaxWeightTpl<T> &weight)\n      : FloatWeightTpl<T>(weight) {}\n\n  static const MinMaxWeightTpl &Zero() {\n    static const MinMaxWeightTpl zero(Limits::PosInfinity());\n    return zero;\n  }\n\n  static const MinMaxWeightTpl &One() {\n    static const MinMaxWeightTpl one(Limits::NegInfinity());\n    return one;\n  }\n\n  static const MinMaxWeightTpl &NoWeight() {\n    static const MinMaxWeightTpl no_weight(Limits::NumberBad());\n    return no_weight;\n  }\n\n  static const string &Type() {\n    static const string *const type =\n        new string(string(\"minmax\") + FloatWeightTpl<T>::GetPrecisionString());\n    return *type;\n  }\n\n  // Fails for IEEE NaN.\n  bool Member() const { return Value() == Value(); }\n\n  MinMaxWeightTpl<T> Quantize(float delta = kDelta) const {\n    // If one of infinities, or a NaN.\n    if (!Member() ||\n        Value() == Limits::NegInfinity() || Value() == Limits::PosInfinity()) {\n      return *this;\n    } else {\n      return MinMaxWeightTpl<T>(floor(Value() / delta + 0.5F) * delta);\n    }\n  }\n\n  MinMaxWeightTpl<T> Reverse() const { return *this; }\n\n  static constexpr uint64 Properties() {\n    return kLeftSemiring | kRightSemiring | kCommutative | kIdempotent | kPath;\n  }\n};\n\n// Single-precision min-max weight.\nusing MinMaxWeight = MinMaxWeightTpl<float>;\n\n// Min.\ntemplate <class T>\ninline MinMaxWeightTpl<T> Plus(const MinMaxWeightTpl<T> &w1,\n                               const MinMaxWeightTpl<T> &w2) {\n  if (!w1.Member() || !w2.Member()) return MinMaxWeightTpl<T>::NoWeight();\n  return w1.Value() < w2.Value() ? w1 : w2;\n}\n\ninline MinMaxWeightTpl<float> Plus(const MinMaxWeightTpl<float> &w1,\n                                   const MinMaxWeightTpl<float> &w2) {\n  return Plus<float>(w1, w2);\n}\n\ninline MinMaxWeightTpl<double> Plus(const MinMaxWeightTpl<double> &w1,\n                                    const MinMaxWeightTpl<double> &w2) {\n  return Plus<double>(w1, w2);\n}\n\n// Max.\ntemplate <class T>\ninline MinMaxWeightTpl<T> Times(const MinMaxWeightTpl<T> &w1,\n                                const MinMaxWeightTpl<T> &w2) {\n  if (!w1.Member() || !w2.Member()) return MinMaxWeightTpl<T>::NoWeight();\n  return w1.Value() >= w2.Value() ? w1 : w2;\n}\n\ninline MinMaxWeightTpl<float> Times(const MinMaxWeightTpl<float> &w1,\n                                    const MinMaxWeightTpl<float> &w2) {\n  return Times<float>(w1, w2);\n}\n\ninline MinMaxWeightTpl<double> Times(const MinMaxWeightTpl<double> &w1,\n                                     const MinMaxWeightTpl<double> &w2) {\n  return Times<double>(w1, w2);\n}\n\n// Defined only for special cases.\ntemplate <class T>\ninline MinMaxWeightTpl<T> Divide(const MinMaxWeightTpl<T> &w1,\n                                 const MinMaxWeightTpl<T> &w2,\n                                 DivideType typ = DIVIDE_ANY) {\n  if (!w1.Member() || !w2.Member()) return MinMaxWeightTpl<T>::NoWeight();\n  // min(w1, x) = w2, w1 >= w2 => min(w1, x) = w2, x = w2.\n  return w1.Value() >= w2.Value() ? w1 : FloatLimits<T>::NumberBad();\n}\n\ninline MinMaxWeightTpl<float> Divide(const MinMaxWeightTpl<float> &w1,\n                                     const MinMaxWeightTpl<float> &w2,\n                                     DivideType typ = DIVIDE_ANY) {\n  return Divide<float>(w1, w2, typ);\n}\n\ninline MinMaxWeightTpl<double> Divide(const MinMaxWeightTpl<double> &w1,\n                                      const MinMaxWeightTpl<double> &w2,\n                                      DivideType typ = DIVIDE_ANY) {\n  return Divide<double>(w1, w2, typ);\n}\n\n// Converts to tropical.\ntemplate <>\nstruct WeightConvert<LogWeight, TropicalWeight> {\n  TropicalWeight operator()(const LogWeight &w) const { return w.Value(); }\n};\n\ntemplate <>\nstruct WeightConvert<Log64Weight, TropicalWeight> {\n  TropicalWeight operator()(const Log64Weight &w) const { return w.Value(); }\n};\n\n// Converts to log.\ntemplate <>\nstruct WeightConvert<TropicalWeight, LogWeight> {\n  LogWeight operator()(const TropicalWeight &w) const { return w.Value(); }\n};\n\ntemplate <>\nstruct WeightConvert<Log64Weight, LogWeight> {\n  LogWeight operator()(const Log64Weight &w) const { return w.Value(); }\n};\n\n// Converts to log64.\ntemplate <>\nstruct WeightConvert<TropicalWeight, Log64Weight> {\n  Log64Weight operator()(const TropicalWeight &w) const { return w.Value(); }\n};\n\ntemplate <>\nstruct WeightConvert<LogWeight, Log64Weight> {\n  Log64Weight operator()(const LogWeight &w) const { return w.Value(); }\n};\n\n// This function object returns random integers chosen from [0,\n// num_random_weights). The boolean 'allow_zero' determines whether Zero() and\n// zero divisors should be returned in the random weight generation. This is\n// intended primary for testing.\ntemplate <class Weight>\nclass FloatWeightGenerate {\n public:\n  explicit FloatWeightGenerate(\n      bool allow_zero = true,\n      const size_t num_random_weights = kNumRandomWeights)\n      : allow_zero_(allow_zero), num_random_weights_(num_random_weights) {}\n\n  Weight operator()() const {\n    const int n = rand() % (num_random_weights_ + allow_zero_);  // NOLINT\n    if (allow_zero_ && n == num_random_weights_) return Weight::Zero();\n    return Weight(n);\n  }\n\n private:\n  // Permits Zero() and zero divisors.\n  const bool allow_zero_;\n  // Number of alternative random weights.\n  const size_t num_random_weights_;\n};\n\ntemplate <class T>\nclass WeightGenerate<TropicalWeightTpl<T>>\n    : public FloatWeightGenerate<TropicalWeightTpl<T>> {\n public:\n  using Weight = TropicalWeightTpl<T>;\n  using Generate = FloatWeightGenerate<Weight>;\n\n  explicit WeightGenerate(bool allow_zero = true,\n                          size_t num_random_weights = kNumRandomWeights)\n      : Generate(allow_zero, num_random_weights) {}\n\n  Weight operator()() const { return Weight(Generate::operator()()); }\n};\n\ntemplate <class T>\nclass WeightGenerate<LogWeightTpl<T>>\n    : public FloatWeightGenerate<LogWeightTpl<T>> {\n public:\n  using Weight = LogWeightTpl<T>;\n  using Generate = FloatWeightGenerate<Weight>;\n\n  explicit WeightGenerate(bool allow_zero = true,\n                          size_t num_random_weights = kNumRandomWeights)\n      : Generate(allow_zero, num_random_weights) {}\n\n  Weight operator()() const { return Weight(Generate::operator()()); }\n};\n\n// This function object returns random integers chosen from [0,\n// num_random_weights). The boolean 'allow_zero' determines whether Zero() and\n// zero divisors should be returned in the random weight generation. This is\n// intended primary for testing.\ntemplate <class T>\nclass WeightGenerate<MinMaxWeightTpl<T>> {\n public:\n  using Weight = MinMaxWeightTpl<T>;\n\n  explicit WeightGenerate(bool allow_zero = true,\n                          size_t num_random_weights = kNumRandomWeights)\n      : allow_zero_(allow_zero), num_random_weights_(num_random_weights) {}\n\n  Weight operator()() const {\n    const int n = (rand() %  // NOLINT\n                   (2 * num_random_weights_ + allow_zero_)) -\n                  num_random_weights_;\n    if (allow_zero_ && n == num_random_weights_) {\n      return Weight::Zero();\n    } else if (n == -num_random_weights_) {\n      return Weight::One();\n    } else {\n      return Weight(n);\n    }\n  }\n\n private:\n  // Permits Zero() and zero divisors.\n  const bool allow_zero_;\n  // Number of alternative random weights.\n  const size_t num_random_weights_;\n};\n\n}  // namespace fst\n\n#endif  // FST_FLOAT_WEIGHT_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/fst-decl.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// This file contains declarations of classes in the Fst template library.\n\n#ifndef FST_FST_DECL_H_\n#define FST_FST_DECL_H_\n\n#include <sys/types.h>\n#include <memory>  // for allocator<>\n\n#include <fst/types.h>\n\nnamespace fst {\n\n// Symbol table and iterator.\n\nclass SymbolTable;\n\nclass SymbolTableIterator;\n\n// Weight templates and weights.\n\ntemplate <class T>\nclass FloatWeightTpl;\n\ntemplate <class T>\nclass TropicalWeightTpl;\n\ntemplate <class T>\nclass LogWeightTpl;\n\ntemplate <class T>\nclass MinMaxWeightTpl;\n\nusing FloatWeight = FloatWeightTpl<float>;\n\nusing TropicalWeight = TropicalWeightTpl<float>;\n\nusing LogWeight = LogWeightTpl<float>;\n\nusing MinMaxWeight = MinMaxWeightTpl<float>;\n\n// Arc templates and arcs.\n\ntemplate <class Weight>\nstruct ArcTpl;\n\nusing StdArc = ArcTpl<TropicalWeight>;\n\nusing LogArc = ArcTpl<LogWeight>;\n\n// Stores.\n\ntemplate <class Element, class U>\nclass DefaultCompactStore;\n\ntemplate <class Arc>\nclass DefaultCacheStore;\n\n// FST templates.\n\ntemplate <class Arc, class Compactor, class U = uint32,\n    class CompactStore = DefaultCompactStore<typename Compactor::Element, U>,\n    class CacheStore = DefaultCacheStore<Arc>>\nclass CompactFst;\n\ntemplate <class Arc, class U = uint32>\nclass ConstFst;\n\ntemplate <class Arc, class Weight, class Matcher>\nclass EditFst;\n\ntemplate <class Arc>\nclass ExpandedFst;\n\ntemplate <class Arc>\nclass Fst;\n\ntemplate <class Arc>\nclass MutableFst;\n\ntemplate <class Arc, class Allocator = std::allocator<Arc>>\nclass VectorState;\n\ntemplate <class Arc, class State = VectorState<Arc>>\nclass VectorFst;\n\ntemplate <class Arc, class U = ssize_t>\nclass DefaultReplaceStateTable;\n\n// On-the-fly operations.\n\ntemplate <class Arc, class Compare>\nclass ArcSortFst;\n\ntemplate <class Arc>\nclass ClosureFst;\n\ntemplate <class Arc, class Store = DefaultCacheStore<Arc>>\nclass ComposeFst;\n\ntemplate <class Arc>\nclass ConcatFst;\n\ntemplate <class Arc>\nclass DeterminizeFst;\n\ntemplate <class Arc>\nclass DifferenceFst;\n\ntemplate <class Arc>\nclass IntersectFst;\n\ntemplate <class Arc>\nclass InvertFst;\n\ntemplate <class AArc, class BArc, class Mapper>\nclass ArcMapFst;\n\ntemplate <class Arc>\nclass ProjectFst;\n\ntemplate <class AArc, class BArc, class Selector>\nclass RandGenFst;\n\ntemplate <class Arc>\nclass RelabelFst;\n\ntemplate <class Arc, class StateTable = DefaultReplaceStateTable<Arc>,\n          class Store = DefaultCacheStore<Arc>>\nclass ReplaceFst;\n\ntemplate <class Arc>\nclass RmEpsilonFst;\n\ntemplate <class Arc>\nclass UnionFst;\n\n// Heap.\n\ntemplate <class T, class Compare>\nclass Heap;\n\n// Compactors.\n\ntemplate <class Arc>\nclass AcceptorCompactor;\n\ntemplate <class Arc>\nclass StringCompactor;\n\ntemplate <class Arc>\nclass UnweightedAcceptorCompactor;\n\ntemplate <class Arc>\nclass UnweightedCompactor;\n\ntemplate <class Arc>\nclass WeightedStringCompactor;\n\n// Compact FSTs.\n\ntemplate <class Arc, class U = uint32>\nusing CompactStringFst = CompactFst<Arc, StringCompactor<Arc>, U>;\n\ntemplate <class Arc, class U = uint32>\nusing CompactWeightedStringFst =\n    CompactFst<Arc, WeightedStringCompactor<Arc>, U>;\n\ntemplate <class Arc, class U = uint32>\nusing CompactAcceptorFst = CompactFst<Arc, AcceptorCompactor<Arc>, U>;\n\ntemplate <class Arc, class U = uint32>\nusing CompactUnweightedFst = CompactFst<Arc, UnweightedCompactor<Arc>, U>;\n\ntemplate <class Arc, class U = uint32>\nusing CompactUnweightedAcceptorFst =\n    CompactFst<Arc, UnweightedAcceptorCompactor<Arc>, U>;\n\n// StdArc aliases for FSTs.\n\nusing StdConstFst = ConstFst<StdArc>;\nusing StdExpandedFst = ExpandedFst<StdArc>;\nusing StdFst = Fst<StdArc>;\nusing StdMutableFst = MutableFst<StdArc>;\nusing StdVectorFst = VectorFst<StdArc>;\n\n// StdArc aliases for on-the-fly operations.\n\ntemplate <class Compare>\nusing StdArcSortFst = ArcSortFst<StdArc, Compare>;\n\nusing StdClosureFst = ClosureFst<StdArc>;\n\nusing StdComposeFst = ComposeFst<StdArc>;\n\nusing StdConcatFst = ConcatFst<StdArc>;\n\nusing StdDeterminizeFst = DeterminizeFst<StdArc>;\n\nusing StdDifferenceFst = DifferenceFst<StdArc>;\n\nusing StdIntersectFst = IntersectFst<StdArc>;\n\nusing StdInvertFst = InvertFst<StdArc>;\n\nusing StdProjectFst = ProjectFst<StdArc>;\n\nusing StdRelabelFst = RelabelFst<StdArc>;\n\nusing StdReplaceFst = ReplaceFst<StdArc>;\n\nusing StdRmEpsilonFst = RmEpsilonFst<StdArc>;\n\nusing StdUnionFst = UnionFst<StdArc>;\n\n// Filter states.\n\ntemplate <class T>\nclass IntegerFilterState;\n\nusing CharFilterState = IntegerFilterState<signed char>;\n\nusing ShortFilterState = IntegerFilterState<short>;  // NOLINT\n\nusing IntFilterState = IntegerFilterState<int>;\n\n// Matchers and filters.\n\ntemplate <class FST>\nclass Matcher;\n\ntemplate <class Matcher1, class Matcher2 = Matcher1>\nclass NullComposeFilter;\n\ntemplate <class Matcher1, class Matcher2 = Matcher1>\nclass TrivialComposeFilter;\n\ntemplate <class Matcher1, class Matcher2 = Matcher1>\nclass SequenceComposeFilter;\n\ntemplate <class Matcher1, class Matcher2 = Matcher1>\nclass AltSequenceComposeFilter;\n\ntemplate <class Matcher1, class Matcher2 = Matcher1>\nclass MatchComposeFilter;\n\n}  // namespace fst\n\n#endif  // FST_FST_DECL_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/fst.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// FST abstract base class definition, state and arc iterator interface, and\n// suggested base implementation.\n\n#ifndef FST_FST_H_\n#define FST_FST_H_\n\n#include <sys/types.h>\n\n#include <cmath>\n#include <cstddef>\n\n#include <iostream>\n#include <memory>\n#include <sstream>\n#include <string>\n#include <utility>\n\n#include <fst/compat.h>\n#include <fst/flags.h>\n#include <fst/log.h>\n#include <fstream>\n\n#include <fst/arc.h>\n#include <fst/memory.h>\n#include <fst/properties.h>\n#include <fst/register.h>\n#include <fst/symbol-table.h>\n#include <fst/util.h>\n\n\nDECLARE_bool(fst_align);\n\nnamespace fst {\n\nbool IsFstHeader(std::istream &, const string &);\n\nclass FstHeader;\n\ntemplate <class Arc>\nstruct StateIteratorData;\n\ntemplate <class Arc>\nstruct ArcIteratorData;\n\ntemplate <class Arc>\nclass MatcherBase;\n\nstruct FstReadOptions {\n  // FileReadMode(s) are advisory, there are many conditions than prevent a\n  // file from being mapped, READ mode will be selected in these cases with\n  // a warning indicating why it was chosen.\n  enum FileReadMode { READ, MAP };\n\n  string source;                // Where you're reading from.\n  const FstHeader *header;      // Pointer to FST header; if non-zero, use\n                                // this info (don't read a stream header).\n  const SymbolTable *isymbols;  // Pointer to input symbols; if non-zero, use\n                                // this info (read and skip stream isymbols)\n  const SymbolTable *osymbols;  // Pointer to output symbols; if non-zero, use\n                                // this info (read and skip stream osymbols)\n  FileReadMode mode;            // Read or map files (advisory, if possible)\n  bool read_isymbols;           // Read isymbols, if any (default: true).\n  bool read_osymbols;           // Read osymbols, if any (default: true).\n\n  explicit FstReadOptions(const string &source = \"<unspecified>\",\n                          const FstHeader *header = nullptr,\n                          const SymbolTable *isymbols = nullptr,\n                          const SymbolTable *osymbols = nullptr);\n\n  explicit FstReadOptions(const string &source, const SymbolTable *isymbols,\n                          const SymbolTable *osymbols = nullptr);\n\n  // Helper function to convert strings FileReadModes into their enum value.\n  static FileReadMode ReadMode(const string &mode);\n\n  // Outputs a debug string for the FstReadOptions object.\n  string DebugString() const;\n};\n\nstruct FstWriteOptions {\n  string source;        // Where you're writing to.\n  bool write_header;    // Write the header?\n  bool write_isymbols;  // Write input symbols?\n  bool write_osymbols;  // Write output symbols?\n  bool align;           // Write data aligned (may fail on pipes)?\n  bool stream_write;    // Avoid seek operations in writing.\n\n  explicit FstWriteOptions(const string &source = \"<unspecifed>\",\n                           bool write_header = true, bool write_isymbols = true,\n                           bool write_osymbols = true,\n                           bool align = FLAGS_fst_align,\n                           bool stream_write = false)\n      : source(source),\n        write_header(write_header),\n        write_isymbols(write_isymbols),\n        write_osymbols(write_osymbols),\n        align(align),\n        stream_write(stream_write) {}\n};\n\n// Header class.\n//\n// This is the recommended file header representation.\n\nclass FstHeader {\n public:\n  enum {\n    HAS_ISYMBOLS = 0x1,  // Has input symbol table.\n    HAS_OSYMBOLS = 0x2,  // Has output symbol table.\n    IS_ALIGNED = 0x4,    // Memory-aligned (where appropriate).\n  } Flags;\n\n  FstHeader() : version_(0), flags_(0), properties_(0), start_(-1),\n      numstates_(0), numarcs_(0) {}\n\n  const string &FstType() const { return fsttype_; }\n\n  const string &ArcType() const { return arctype_; }\n\n  int32 Version() const { return version_; }\n\n  int32 GetFlags() const { return flags_; }\n\n  uint64 Properties() const { return properties_; }\n\n  int64 Start() const { return start_; }\n\n  int64 NumStates() const { return numstates_; }\n\n  int64 NumArcs() const { return numarcs_; }\n\n  void SetFstType(const string &type) { fsttype_ = type; }\n\n  void SetArcType(const string &type) { arctype_ = type; }\n\n  void SetVersion(int32 version) { version_ = version; }\n\n  void SetFlags(int32 flags) { flags_ = flags; }\n\n  void SetProperties(uint64 properties) { properties_ = properties; }\n\n  void SetStart(int64 start) { start_ = start; }\n\n  void SetNumStates(int64 numstates) { numstates_ = numstates; }\n\n  void SetNumArcs(int64 numarcs) { numarcs_ = numarcs; }\n\n  bool Read(std::istream &strm, const string &source,\n            bool rewind = false);\n\n  bool Write(std::ostream &strm, const string &source) const;\n\n  // Outputs a debug string for the FstHeader object.\n  string DebugString() const;\n\n private:\n  string fsttype_;     // E.g. \"vector\".\n  string arctype_;     // E.g. \"standard\".\n  int32 version_;      // Type version number.\n  int32 flags_;        // File format bits.\n  uint64 properties_;  // FST property bits.\n  int64 start_;        // Start state.\n  int64 numstates_;    // # of states.\n  int64 numarcs_;      // # of arcs.\n};\n\n// Specifies matcher action.\nenum MatchType {\n  MATCH_INPUT = 1,   // Match input label.\n  MATCH_OUTPUT = 2,  // Match output label.\n  MATCH_BOTH = 3,    // Match input or output label.\n  MATCH_NONE = 4,    // Match nothing.\n  MATCH_UNKNOWN = 5\n};  // Otherwise, match type unknown.\n\nconstexpr int kNoLabel = -1;    // Not a valid label.\nconstexpr int kNoStateId = -1;  // Not a valid state ID.\n\n// A generic FST, templated on the arc definition, with common-demoninator\n// methods (use StateIterator and ArcIterator to iterate over its states and\n// arcs).\ntemplate <class A>\nclass Fst {\n public:\n  using Arc = A;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  virtual ~Fst() {}\n\n  // Initial state.\n  virtual StateId Start() const = 0;\n\n  // State's final weight.\n  virtual Weight Final(StateId) const = 0;\n\n  // State's arc count.\n  virtual size_t NumArcs(StateId) const = 0;\n\n  // State's input epsilon count.\n  virtual size_t NumInputEpsilons(StateId) const = 0;\n\n  // State's output epsilon count.\n  virtual size_t NumOutputEpsilons(StateId) const = 0;\n\n  // Property bits. If test = false, return stored properties bits for mask\n  // (some possibly unknown); if test = true, return property bits for mask\n  // (computing o.w. unknown).\n  virtual uint64 Properties(uint64 mask, bool test) const = 0;\n\n  // FST type name.\n  virtual const string &Type() const = 0;\n\n  // Gets a copy of this Fst. The copying behaves as follows:\n  //\n  // (1) The copying is constant time if safe = false or if safe = true\n  // and is on an otherwise unaccessed FST.\n  //\n  // (2) If safe = true, the copy is thread-safe in that the original\n  // and copy can be safely accessed (but not necessarily mutated) by\n  // separate threads. For some FST types, 'Copy(true)' should only be\n  // called on an FST that has not otherwise been accessed. Behavior is\n  // otherwise undefined.\n  //\n  // (3) If a MutableFst is copied and then mutated, then the original is\n  // unmodified and vice versa (often by a copy-on-write on the initial\n  // mutation, which may not be constant time).\n  virtual Fst<Arc> *Copy(bool safe = false) const = 0;\n\n  // Reads an FST from an input stream; returns nullptr on error.\n  static Fst<Arc> *Read(std::istream &strm, const FstReadOptions &opts) {\n    FstReadOptions ropts(opts);\n    FstHeader hdr;\n    if (ropts.header) {\n      hdr = *opts.header;\n    } else {\n      if (!hdr.Read(strm, opts.source)) return nullptr;\n      ropts.header = &hdr;\n    }\n    const auto &fst_type = hdr.FstType();\n    const auto reader = FstRegister<Arc>::GetRegister()->GetReader(fst_type);\n    if (!reader) {\n      LOG(ERROR) << \"Fst::Read: Unknown FST type \" << fst_type\n                 << \" (arc type = \" << Arc::Type() << \"): \" << ropts.source;\n      return nullptr;\n    }\n    return reader(strm, ropts);\n  }\n\n  // Reads an FST from a file; returns nullptr on error. An empty filename\n  // results in reading from standard input.\n  static Fst<Arc> *Read(const string &filename) {\n    if (!filename.empty()) {\n      std::ifstream strm(filename,\n                              std::ios_base::in | std::ios_base::binary);\n      if (!strm) {\n        LOG(ERROR) << \"Fst::Read: Can't open file: \" << filename;\n        return nullptr;\n      }\n      return Read(strm, FstReadOptions(filename));\n    } else {\n      return Read(std::cin, FstReadOptions(\"standard input\"));\n    }\n  }\n\n  // Writes an FST to an output stream; returns false on error.\n  virtual bool Write(std::ostream &strm, const FstWriteOptions &opts) const {\n    LOG(ERROR) << \"Fst::Write: No write stream method for \" << Type()\n               << \" FST type\";\n    return false;\n  }\n\n  // Writes an FST to a file; returns false on error; an empty filename\n  // results in writing to standard output.\n  virtual bool Write(const string &filename) const {\n    LOG(ERROR) << \"Fst::Write: No write filename method for \" << Type()\n               << \" FST type\";\n    return false;\n  }\n\n  // Returns input label symbol table; return nullptr if not specified.\n  virtual const SymbolTable *InputSymbols() const = 0;\n\n  // Return output label symbol table; return nullptr if not specified.\n  virtual const SymbolTable *OutputSymbols() const = 0;\n\n  // For generic state iterator construction (not normally called directly by\n  // users). Does not copy the FST.\n  virtual void InitStateIterator(StateIteratorData<Arc> *data) const = 0;\n\n  // For generic arc iterator construction (not normally called directly by\n  // users). Does not copy the FST.\n  virtual void InitArcIterator(StateId s, ArcIteratorData<Arc> *data) const = 0;\n\n  // For generic matcher construction (not normally called directly by users).\n  // Does not copy the FST.\n  virtual MatcherBase<Arc> *InitMatcher(MatchType match_type) const;\n\n protected:\n  bool WriteFile(const string &filename) const {\n    if (!filename.empty()) {\n      std::ofstream strm(filename,\n                               std::ios_base::out | std::ios_base::binary);\n      if (!strm) {\n        LOG(ERROR) << \"Fst::Write: Can't open file: \" << filename;\n        return false;\n      }\n      bool val = Write(strm, FstWriteOptions(filename));\n      if (!val) LOG(ERROR) << \"Fst::Write failed: \" << filename;\n      return val;\n    } else {\n      return Write(std::cout, FstWriteOptions(\"standard output\"));\n    }\n  }\n};\n\n// A useful alias when using StdArc.\nusing StdFst = Fst<StdArc>;\n\n// State and arc iterator definitions.\n//\n// State iterator interface templated on the Arc definition; used for\n// StateIterator specializations returned by the InitStateIterator FST method.\ntemplate <class Arc>\nclass StateIteratorBase {\n public:\n  using StateId = typename Arc::StateId;\n\n  virtual ~StateIteratorBase() {}\n\n  // End of iterator?\n  virtual bool Done() const = 0;\n  // Returns current state (when !Done()).\n  virtual StateId Value() const = 0;\n  // Advances to next state (when !Done()).\n  virtual void Next() = 0;\n  // Resets to initial condition.\n  virtual void Reset() = 0;\n};\n\n// StateIterator initialization data.\n\ntemplate <class Arc>\nstruct StateIteratorData {\n  using StateId = typename Arc::StateId;\n\n  // Specialized iterator if non-zero.\n  StateIteratorBase<Arc> *base;\n  // Otherwise, the total number of states.\n  StateId nstates;\n\n  StateIteratorData() : base(nullptr), nstates(0) {}\n\n  StateIteratorData(const StateIteratorData &) = delete;\n  StateIteratorData &operator=(const StateIteratorData &) = delete;\n};\n\n// Generic state iterator, templated on the FST definition (a wrapper\n// around a pointer to a specific one). Here is a typical use:\n//\n//   for (StateIterator<StdFst> siter(fst);\n//        !siter.Done();\n//        siter.Next()) {\n//     StateId s = siter.Value();\n//     ...\n//   }\n// There is no copying of the FST.\ntemplate <class FST>\nclass StateIterator {\n public:\n  using Arc = typename FST::Arc;\n  using StateId = typename Arc::StateId;\n\n  explicit StateIterator(const FST &fst) : s_(0) {\n    fst.InitStateIterator(&data_);\n  }\n\n  ~StateIterator() { delete data_.base; }\n\n  bool Done() const {\n    return data_.base ? data_.base->Done() : s_ >= data_.nstates;\n  }\n\n  StateId Value() const { return data_.base ? data_.base->Value() : s_; }\n\n  void Next() {\n    if (data_.base) {\n      data_.base->Next();\n    } else {\n      ++s_;\n    }\n  }\n\n  void Reset() {\n    if (data_.base) {\n      data_.base->Reset();\n    } else {\n      s_ = 0;\n    }\n  }\n\n private:\n  StateIteratorData<Arc> data_;\n  StateId s_;\n};\n\n// Flags to control the behavior on an arc iterator.\nstatic constexpr uint32 kArcILabelValue =\n    0x0001;  // Value() gives valid ilabel.\nstatic constexpr uint32 kArcOLabelValue = 0x0002;  //  \"       \"     \" olabel.\nstatic constexpr uint32 kArcWeightValue = 0x0004;  //  \"       \"     \" weight.\nstatic constexpr uint32 kArcNextStateValue =\n    0x0008;                                    //  \"       \"     \" nextstate.\nstatic constexpr uint32 kArcNoCache = 0x0010;  // No need to cache arcs.\n\nstatic constexpr uint32 kArcValueFlags =\n    kArcILabelValue | kArcOLabelValue | kArcWeightValue | kArcNextStateValue;\n\nstatic constexpr uint32 kArcFlags = kArcValueFlags | kArcNoCache;\n\n// Arc iterator interface, templated on the arc definition; used for arc\n// iterator specializations that are returned by the InitArcIterator FST method.\ntemplate <class Arc>\nclass ArcIteratorBase {\n public:\n  using StateId = typename Arc::StateId;\n\n  virtual ~ArcIteratorBase() {}\n\n  // End of iterator?\n  virtual bool Done() const = 0;\n  // Returns current arc (when !Done()).\n  virtual const Arc &Value() const = 0;\n  // Advances to next arc (when !Done()).\n  virtual void Next() = 0;\n  // Returns current position.\n  virtual size_t Position() const = 0;\n  // Returns to initial condition.\n  virtual void Reset() = 0;\n  // Advances to arbitrary arc by position.\n  virtual void Seek(size_t) = 0;\n  // Returns current behavorial flags\n  virtual uint32 Flags() const = 0;\n  // Sets behavorial flags.\n  virtual void SetFlags(uint32, uint32) = 0;\n};\n\n// ArcIterator initialization data.\ntemplate <class Arc>\nstruct ArcIteratorData {\n  ArcIteratorData()\n      : base(nullptr), arcs(nullptr), narcs(0), ref_count(nullptr) {}\n\n  ArcIteratorData(const ArcIteratorData &) = delete;\n\n  ArcIteratorData &operator=(const ArcIteratorData &) = delete;\n\n  ArcIteratorBase<Arc> *base;  // Specialized iterator if non-zero.\n  const Arc *arcs;             // O.w. arcs pointer\n  size_t narcs;                // ... and arc count.\n  int *ref_count;              // ... and reference count if non-zero.\n};\n\n// Generic arc iterator, templated on the FST definition (a wrapper around a\n// pointer to a specific one). Here is a typical use:\n//\n//   for (ArcIterator<StdFst> aiter(fst, s);\n//        !aiter.Done();\n//         aiter.Next()) {\n//     StdArc &arc = aiter.Value();\n//     ...\n//   }\n// There is no copying of the FST.\ntemplate <class FST>\nclass ArcIterator {\n public:\n  using Arc = typename FST::Arc;\n  using StateId = typename Arc::StateId;\n\n  ArcIterator(const FST &fst, StateId s) : i_(0) {\n    fst.InitArcIterator(s, &data_);\n  }\n\n  explicit ArcIterator(const ArcIteratorData<Arc> &data) : data_(data), i_(0) {\n    if (data_.ref_count) ++(*data_.ref_count);\n  }\n\n  ~ArcIterator() {\n    if (data_.base) {\n      delete data_.base;\n    } else if (data_.ref_count) {\n      --(*data_.ref_count);\n    }\n  }\n\n  bool Done() const {\n    return data_.base ? data_.base->Done() : i_ >= data_.narcs;\n  }\n\n  const Arc &Value() const {\n    return data_.base ? data_.base->Value() : data_.arcs[i_];\n  }\n\n  void Next() {\n    if (data_.base) {\n      data_.base->Next();\n    } else {\n      ++i_;\n    }\n  }\n\n  void Reset() {\n    if (data_.base) {\n      data_.base->Reset();\n    } else {\n      i_ = 0;\n    }\n  }\n\n  void Seek(size_t a) {\n    if (data_.base) {\n      data_.base->Seek(a);\n    } else {\n      i_ = a;\n    }\n  }\n\n  size_t Position() const { return data_.base ? data_.base->Position() : i_; }\n\n  uint32 Flags() const {\n    if (data_.base) {\n      return data_.base->Flags();\n    } else {\n      return kArcValueFlags;\n    }\n  }\n\n  void SetFlags(uint32 flags, uint32 mask) {\n    if (data_.base) data_.base->SetFlags(flags, mask);\n  }\n\n private:\n  ArcIteratorData<Arc> data_;\n  size_t i_;\n};\n\n}  // namespace fst\n\n// ArcIterator placement operator new and destroy function; new needs to be in\n// the global namespace.\n\ntemplate <class FST>\nvoid *operator new(size_t size,\n                   fst::MemoryPool<fst::ArcIterator<FST>> *pool) {\n  return pool->Allocate();\n}\n\nnamespace fst {\n\ntemplate <class FST>\nvoid Destroy(ArcIterator<FST> *aiter, MemoryPool<ArcIterator<FST>> *pool) {\n  if (aiter) {\n    aiter->~ArcIterator<FST>();\n    pool->Free(aiter);\n  }\n}\n\n// Matcher definitions.\n\ntemplate <class Arc>\nMatcherBase<Arc> *Fst<Arc>::InitMatcher(MatchType match_type) const {\n  return nullptr;  // One should just use the default matcher.\n}\n\n// FST accessors, useful in high-performance applications.\n\nnamespace internal {\n\n// General case, requires non-abstract, 'final' methods. Use for inlining.\n\ntemplate <class F>\ninline typename F::Arc::Weight Final(const F &fst, typename F::Arc::StateId s) {\n  return fst.F::Final(s);\n}\n\ntemplate <class F>\ninline ssize_t NumArcs(const F &fst, typename F::Arc::StateId s) {\n  return fst.F::NumArcs(s);\n}\n\ntemplate <class F>\ninline ssize_t NumInputEpsilons(const F &fst, typename F::Arc::StateId s) {\n  return fst.F::NumInputEpsilons(s);\n}\n\ntemplate <class F>\ninline ssize_t NumOutputEpsilons(const F &fst, typename F::Arc::StateId s) {\n  return fst.F::NumOutputEpsilons(s);\n}\n\n// Fst<Arc> case, abstract methods.\n\ntemplate <class Arc>\ninline typename Arc::Weight Final(const Fst<Arc> &fst,\n                                  typename Arc::StateId s) {\n  return fst.Final(s);\n}\n\ntemplate <class Arc>\ninline size_t NumArcs(const Fst<Arc> &fst, typename Arc::StateId s) {\n  return fst.NumArcs(s);\n}\n\ntemplate <class Arc>\ninline size_t NumInputEpsilons(const Fst<Arc> &fst, typename Arc::StateId s) {\n  return fst.NumInputEpsilons(s);\n}\n\ntemplate <class Arc>\ninline size_t NumOutputEpsilons(const Fst<Arc> &fst, typename Arc::StateId s) {\n  return fst.NumOutputEpsilons(s);\n}\n\n// FST implementation base.\n//\n// This is the recommended FST implementation base class. It will handle\n// reference counts, property bits, type information and symbols.\n//\n// Users are discouraged, but not prohibited, from subclassing this outside the\n// FST library.\ntemplate <class Arc>\nclass FstImpl {\n public:\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  FstImpl() : properties_(0), type_(\"null\") {}\n\n  FstImpl(const FstImpl<Arc> &impl)\n      : properties_(impl.properties_),\n        type_(impl.type_),\n        isymbols_(impl.isymbols_ ? impl.isymbols_->Copy() : nullptr),\n        osymbols_(impl.osymbols_ ? impl.osymbols_->Copy() : nullptr) {}\n\n  virtual ~FstImpl() {}\n\n  const string &Type() const { return type_; }\n\n  void SetType(const string &type) { type_ = type; }\n\n  virtual uint64 Properties() const { return properties_; }\n\n  virtual uint64 Properties(uint64 mask) const { return properties_ & mask; }\n\n  void SetProperties(uint64 props) {\n    properties_ &= kError;  // kError can't be cleared.\n    properties_ |= props;\n  }\n\n  void SetProperties(uint64 props, uint64 mask) {\n    properties_ &= ~mask | kError;  // kError can't be cleared.\n    properties_ |= props & mask;\n  }\n\n  // Allows (only) setting error bit on const FST implementations.\n  void SetProperties(uint64 props, uint64 mask) const {\n    if (mask != kError) {\n      FSTERROR() << \"FstImpl::SetProperties() const: Can only set kError\";\n    }\n    properties_ |= kError;\n  }\n\n  const SymbolTable *InputSymbols() const { return isymbols_.get(); }\n\n  const SymbolTable *OutputSymbols() const { return osymbols_.get(); }\n\n  SymbolTable *InputSymbols() { return isymbols_.get(); }\n\n  SymbolTable *OutputSymbols() { return osymbols_.get(); }\n\n  void SetInputSymbols(const SymbolTable *isyms) {\n    isymbols_.reset(isyms ? isyms->Copy() : nullptr);\n  }\n\n  void SetOutputSymbols(const SymbolTable *osyms) {\n    osymbols_.reset(osyms ? osyms->Copy() : nullptr);\n  }\n\n  // Reads header and symbols from input stream, initializes FST, and returns\n  // the header. If opts.header is non-null, skips reading and uses the option\n  // value instead. If opts.[io]symbols is non-null, reads in (if present), but\n  // uses the option value.\n  bool ReadHeader(std::istream &strm, const FstReadOptions &opts,\n                  int min_version, FstHeader *hdr);\n\n  // Writes header and symbols to output stream. If opts.header is false, skips\n  // writing header. If opts.[io]symbols is false, skips writing those symbols.\n  // This method is needed for implementations that implement Write methods.\n  void WriteHeader(std::ostream &strm, const FstWriteOptions &opts,\n                   int version, FstHeader *hdr) const {\n    if (opts.write_header) {\n      hdr->SetFstType(type_);\n      hdr->SetArcType(Arc::Type());\n      hdr->SetVersion(version);\n      hdr->SetProperties(properties_);\n      int32 file_flags = 0;\n      if (isymbols_ && opts.write_isymbols) {\n        file_flags |= FstHeader::HAS_ISYMBOLS;\n      }\n      if (osymbols_ && opts.write_osymbols) {\n        file_flags |= FstHeader::HAS_OSYMBOLS;\n      }\n      if (opts.align) file_flags |= FstHeader::IS_ALIGNED;\n      hdr->SetFlags(file_flags);\n      hdr->Write(strm, opts.source);\n    }\n    if (isymbols_ && opts.write_isymbols) isymbols_->Write(strm);\n    if (osymbols_ && opts.write_osymbols) osymbols_->Write(strm);\n  }\n\n  // Writes out header and symbols to output stream. If opts.header is false,\n  // skips writing header. If opts.[io]symbols is false, skips writing those\n  // symbols. `type` is the FST type being written. This method is used in the\n  // cross-type serialization methods Fst::WriteFst.\n  static void WriteFstHeader(const Fst<Arc> &fst, std::ostream &strm,\n                             const FstWriteOptions &opts, int version,\n                             const string &type, uint64 properties,\n                             FstHeader *hdr) {\n    if (opts.write_header) {\n      hdr->SetFstType(type);\n      hdr->SetArcType(Arc::Type());\n      hdr->SetVersion(version);\n      hdr->SetProperties(properties);\n      int32 file_flags = 0;\n      if (fst.InputSymbols() && opts.write_isymbols) {\n        file_flags |= FstHeader::HAS_ISYMBOLS;\n      }\n      if (fst.OutputSymbols() && opts.write_osymbols) {\n        file_flags |= FstHeader::HAS_OSYMBOLS;\n      }\n      if (opts.align) file_flags |= FstHeader::IS_ALIGNED;\n      hdr->SetFlags(file_flags);\n      hdr->Write(strm, opts.source);\n    }\n    if (fst.InputSymbols() && opts.write_isymbols) {\n      fst.InputSymbols()->Write(strm);\n    }\n    if (fst.OutputSymbols() && opts.write_osymbols) {\n      fst.OutputSymbols()->Write(strm);\n    }\n  }\n\n  // In serialization routines where the header cannot be written until after\n  // the machine has been serialized, this routine can be called to seek to the\n  // beginning of the file an rewrite the header with updated fields. It\n  // repositions the file pointer back at the end of the file. Returns true on\n  // success, false on failure.\n  static bool UpdateFstHeader(const Fst<Arc> &fst, std::ostream &strm,\n                              const FstWriteOptions &opts, int version,\n                              const string &type, uint64 properties,\n                              FstHeader *hdr, size_t header_offset) {\n    strm.seekp(header_offset);\n    if (!strm) {\n      LOG(ERROR) << \"Fst::UpdateFstHeader: Write failed: \" << opts.source;\n      return false;\n    }\n    WriteFstHeader(fst, strm, opts, version, type, properties, hdr);\n    if (!strm) {\n      LOG(ERROR) << \"Fst::UpdateFstHeader: Write failed: \" << opts.source;\n      return false;\n    }\n    strm.seekp(0, std::ios_base::end);\n    if (!strm) {\n      LOG(ERROR) << \"Fst::UpdateFstHeader: Write failed: \" << opts.source;\n      return false;\n    }\n    return true;\n  }\n\n protected:\n  mutable uint64 properties_;  // Property bits.\n\n private:\n  string type_;  // Unique name of FST class.\n  std::unique_ptr<SymbolTable> isymbols_;\n  std::unique_ptr<SymbolTable> osymbols_;\n};\n\ntemplate <class Arc>\nbool FstImpl<Arc>::ReadHeader(std::istream &strm, const FstReadOptions &opts,\n                              int min_version, FstHeader *hdr) {\n  if (opts.header) {\n    *hdr = *opts.header;\n  } else if (!hdr->Read(strm, opts.source)) {\n    return false;\n  }\n  if (FLAGS_v >= 2) {\n    LOG(INFO) << \"FstImpl::ReadHeader: source: \" << opts.source\n              << \", fst_type: \" << hdr->FstType()\n              << \", arc_type: \" << Arc::Type()\n              << \", version: \" << hdr->Version()\n              << \", flags: \" << hdr->GetFlags();\n  }\n  if (hdr->FstType() != type_) {\n    LOG(ERROR) << \"FstImpl::ReadHeader: FST not of type \" << type_\n               << \": \" << opts.source;\n    return false;\n  }\n  if (hdr->ArcType() != Arc::Type()) {\n    LOG(ERROR) << \"FstImpl::ReadHeader: Arc not of type \" << Arc::Type()\n               << \": \" << opts.source;\n    return false;\n  }\n  if (hdr->Version() < min_version) {\n    LOG(ERROR) << \"FstImpl::ReadHeader: Obsolete \" << type_\n               << \" FST version: \" << opts.source;\n    return false;\n  }\n  properties_ = hdr->Properties();\n  if (hdr->GetFlags() & FstHeader::HAS_ISYMBOLS) {\n    isymbols_.reset(SymbolTable::Read(strm, opts.source));\n  }\n  // Deletes input symbol table.\n  if (!opts.read_isymbols) SetInputSymbols(nullptr);\n  if (hdr->GetFlags() & FstHeader::HAS_OSYMBOLS) {\n    osymbols_.reset(SymbolTable::Read(strm, opts.source));\n  }\n  // Deletes output symbol table.\n  if (!opts.read_osymbols) SetOutputSymbols(nullptr);\n  if (opts.isymbols) {\n    isymbols_.reset(opts.isymbols->Copy());\n  }\n  if (opts.osymbols) {\n    osymbols_.reset(opts.osymbols->Copy());\n  }\n  return true;\n}\n\n}  // namespace internal\n\ntemplate <class Arc>\nuint64 TestProperties(const Fst<Arc> &fst, uint64 mask, uint64 *known);\n\n// This is a helper class template useful for attaching an FST interface to\n// its implementation, handling reference counting.\ntemplate <class Impl, class FST = Fst<typename Impl::Arc>>\nclass ImplToFst : public FST {\n public:\n  using Arc = typename Impl::Arc;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n  using FST::operator=;\n\n  StateId Start() const override { return impl_->Start(); }\n\n  Weight Final(StateId s) const override { return impl_->Final(s); }\n\n  size_t NumArcs(StateId s) const override { return impl_->NumArcs(s); }\n\n  size_t NumInputEpsilons(StateId s) const override {\n    return impl_->NumInputEpsilons(s);\n  }\n\n  size_t NumOutputEpsilons(StateId s) const override {\n    return impl_->NumOutputEpsilons(s);\n  }\n\n  uint64 Properties(uint64 mask, bool test) const override {\n    if (test) {\n      uint64 knownprops, testprops = TestProperties(*this, mask, &knownprops);\n      impl_->SetProperties(testprops, knownprops);\n      return testprops & mask;\n    } else {\n      return impl_->Properties(mask);\n    }\n  }\n\n  const string &Type() const override { return impl_->Type(); }\n\n  const SymbolTable *InputSymbols() const override {\n    return impl_->InputSymbols();\n  }\n\n  const SymbolTable *OutputSymbols() const override {\n    return impl_->OutputSymbols();\n  }\n\n protected:\n  explicit ImplToFst(std::shared_ptr<Impl> impl) : impl_(std::move(impl)) {}\n\n  // This constructor presumes there is a copy constructor for the\n  // implementation.\n  ImplToFst(const ImplToFst<Impl, FST> &fst, bool safe) {\n    if (safe) {\n      impl_ = std::make_shared<Impl>(*(fst.impl_));\n    } else {\n      impl_ = fst.impl_;\n    }\n  }\n\n  // Returns raw pointers to the shared object.\n  const Impl *GetImpl() const { return impl_.get(); }\n\n  Impl *GetMutableImpl() const { return impl_.get(); }\n\n  // Returns a ref-counted smart poiner to the implementation.\n  std::shared_ptr<Impl> GetSharedImpl() const { return impl_; }\n\n  bool Unique() const { return impl_.unique(); }\n\n  void SetImpl(std::shared_ptr<Impl> impl) { impl_ = impl; }\n\n private:\n  template <class IFST, class OFST>\n  friend void Cast(const IFST &ifst, OFST *ofst);\n\n  std::shared_ptr<Impl> impl_;\n};\n\n// Converts FSTs by casting their implementations, where this makes sense\n// (which excludes implementations with weight-dependent virtual methods).\n// Must be a friend of the FST classes involved (currently the concrete FSTs:\n// ConstFst, CompactFst, and VectorFst). This can only be safely used for arc\n// types that have identical storage characteristics. As with an FST\n// copy constructor and Copy() method, this is a constant time operation\n// (but subject to copy-on-write if it is a MutableFst and modified).\ntemplate <class IFST, class OFST>\nvoid Cast(const IFST &ifst, OFST *ofst) {\n  using OImpl = typename OFST::Impl;\n  ofst->impl_ = std::shared_ptr<OImpl>(ifst.impl_,\n      reinterpret_cast<OImpl *>(ifst.impl_.get()));\n}\n\n// FST serialization.\n\ntemplate <class Arc>\nstring FstToString(const Fst<Arc> &fst,\n                   const FstWriteOptions &options =\n                       FstWriteOptions(\"FstToString\")) {\n  std::ostringstream ostrm;\n  fst.Write(ostrm, options);\n  return ostrm.str();\n}\n\ntemplate <class Arc>\nvoid FstToString(const Fst<Arc> &fst, string *result) {\n  *result = FstToString(fst);\n}\n\ntemplate <class Arc>\nvoid FstToString(const Fst<Arc> &fst, string *result,\n                 const FstWriteOptions &options) {\n  *result = FstToString(fst, options);\n}\n\ntemplate <class Arc>\nFst<Arc> *StringToFst(const string &s) {\n  std::istringstream istrm(s);\n  return Fst<Arc>::Read(istrm, FstReadOptions(\"StringToFst\"));\n}\n\n}  // namespace fst\n\n#endif  // FST_FST_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/fstlib.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// This is a library for constructing, combining, optimizing, and searching\n// \"weighted finite-state transducers\" (FSTs). Weighted finite-state transducers\n// are automata where each transition has an input label, an output label, and a\n// weight. The more familiar finite-state acceptor is represented as a\n// transducer with each transition's input and output the same. Finite-state\n// acceptors are used to represent sets of strings (specifically, \"regular\" or\n// \"rational sets\"); finite-state transducers are used to represent binary\n// relations between pairs of strings (specifically, \"rational transductions\").\n// The weights can be used to represent the cost of taking a particular\n// transition.\n//\n// In this library, transducers are templated on the Arc (transition)\n// definition, which allows changing the label, weight, and state ID sets.\n// Labels and state IDs are restricted to signed integral types but the weight\n// can be an arbitrary type whose members satisfy certain algebraic (\"semiring\")\n// properties.\n//\n// This convenience file includes all other FST header files.\n\n#ifndef FST_FSTLIB_H_\n#define FST_FSTLIB_H_\n\n\n// Abstract FST classes.\n#include <fst/expanded-fst.h>\n#include <fst/fst.h>\n#include <fst/mutable-fst.h>\n\n// Concrete FST classes.\n#include <fst/compact-fst.h>\n#include <fst/const-fst.h>\n#include <fst/edit-fst.h>\n#include <fst/vector-fst.h>\n\n// FST algorithms and delayed FST classes.\n#include <fst/arc-map.h>\n#include <fst/arcsort.h>\n#include <fst/closure.h>\n#include <fst/compose.h>\n#include <fst/concat.h>\n#include <fst/connect.h>\n#include <fst/determinize.h>\n#include <fst/difference.h>\n#include <fst/disambiguate.h>\n#include <fst/encode.h>\n#include <fst/epsnormalize.h>\n#include <fst/equal.h>\n#include <fst/equivalent.h>\n#include <fst/factor-weight.h>\n#include <fst/intersect.h>\n#include <fst/invert.h>\n#include <fst/isomorphic.h>\n#include <fst/map.h>\n#include <fst/minimize.h>\n#include <fst/project.h>\n#include <fst/prune.h>\n#include <fst/push.h>\n#include <fst/randequivalent.h>\n#include <fst/randgen.h>\n#include <fst/rational.h>\n#include <fst/relabel.h>\n#include <fst/replace.h>\n#include <fst/replace-util.h>\n#include <fst/reverse.h>\n#include <fst/reweight.h>\n#include <fst/rmepsilon.h>\n#include <fst/rmfinalepsilon.h>\n#include <fst/shortest-distance.h>\n#include <fst/shortest-path.h>\n#include <fst/state-map.h>\n#include <fst/statesort.h>\n#include <fst/synchronize.h>\n#include <fst/topsort.h>\n#include <fst/union.h>\n#include <fst/verify.h>\n#include <fst/visit.h>\n\n// Weights.\n#include <fst/expectation-weight.h>\n#include <fst/float-weight.h>\n#include <fst/lexicographic-weight.h>\n#include <fst/pair-weight.h>\n#include <fst/power-weight.h>\n#include <fst/product-weight.h>\n#include <fst/signed-log-weight.h>\n#include <fst/sparse-power-weight.h>\n#include <fst/sparse-tuple-weight.h>\n#include <fst/string-weight.h>\n#include <fst/tuple-weight.h>\n#include <fst/weight.h>\n\n// Auxiliary classes for composition.\n#include <fst/compose-filter.h>\n#include <fst/lookahead-filter.h>\n#include <fst/lookahead-matcher.h>\n#include <fst/matcher-fst.h>\n#include <fst/matcher.h>\n#include <fst/state-table.h>\n\n// Data structures.\n#include <fst/heap.h>\n#include <fst/interval-set.h>\n#include <fst/queue.h>\n#include <fst/union-find.h>\n\n// Miscellaneous.\n#include <fst/accumulator.h>\n#include <fst/add-on.h>\n#include <fst/arc.h>\n#include <fst/arcfilter.h>\n#include <fst/cache.h>\n#include <fst/complement.h>\n#include <fst/dfs-visit.h>\n#include <fst/generic-register.h>\n#include <fst/label-reachable.h>\n#include <fst/partition.h>\n#include <fst/properties.h>\n#include <fst/register.h>\n#include <fst/state-reachable.h>\n#include <fst/string.h>\n#include <fst/symbol-table.h>\n#include <fst/symbol-table-ops.h>\n#include <fst/test-properties.h>\n#include <fst/util.h>\n\n\n#endif  // FST_FSTLIB_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/generic-register.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#ifndef FST_GENERIC_REGISTER_H_\n#define FST_GENERIC_REGISTER_H_\n\n#ifndef FST_NO_DYNAMIC_LINKING\n#include <dlfcn.h>\n#include <fst/compat.h>\n#endif\n#include <map>\n#include <string>\n\n#include <fst/types.h>\n#include <fst/log.h>\n\n// Generic class representing a globally-stored correspondence between\n// objects of KeyType and EntryType.\n//\n// KeyType must:\n//\n// * be such as can be stored as a key in a std::map<>.\n// * be concatenable with a const char* with the + operator\n//   (or you must subclass and redefine LoadEntryFromSharedObject)\n//\n// EntryType must be default constructible.\n//\n// The third template parameter should be the type of a subclass of this class\n// (think CRTP). This is to allow GetRegister() to instantiate and return an\n// object of the appropriate type.\n\nnamespace fst {\n\ntemplate <class KeyType, class EntryType, class RegisterType>\nclass GenericRegister {\n public:\n  using Key = KeyType;\n  using Entry = EntryType;\n\n  static RegisterType *GetRegister() {\n    static auto reg = new RegisterType;\n    return reg;\n  }\n\n  void SetEntry(const KeyType &key, const EntryType &entry) {\n    MutexLock l(&register_lock_);\n    register_table_.insert(std::make_pair(key, entry));\n  }\n\n  EntryType GetEntry(const KeyType &key) const {\n    const auto *entry = LookupEntry(key);\n    if (entry) {\n      return *entry;\n    } else {\n      return LoadEntryFromSharedObject(key);\n    }\n  }\n\n  virtual ~GenericRegister() {}\n\n protected:\n  // Override this if you want to be able to load missing definitions from\n  // shared object files.\n  virtual EntryType LoadEntryFromSharedObject(const KeyType &key) const {\n#ifdef FST_NO_DYNAMIC_LINKING\n    return EntryType();\n#else\n    const auto so_filename = ConvertKeyToSoFilename(key);\n    void *handle = dlopen(so_filename.c_str(), RTLD_LAZY);\n    if (handle == nullptr) {\n      LOG(ERROR) << \"GenericRegister::GetEntry: \" << dlerror();\n      return EntryType();\n    }\n#ifdef RUN_MODULE_INITIALIZERS\n    RUN_MODULE_INITIALIZERS();\n#endif\n    // We assume that the DSO constructs a static object in its global scope\n    // that does the registration. Thus we need only load it, not call any\n    // methods.\n    const auto *entry = this->LookupEntry(key);\n    if (entry == nullptr) {\n      LOG(ERROR) << \"GenericRegister::GetEntry: \"\n                 << \"lookup failed in shared object: \" << so_filename;\n      return EntryType();\n    }\n    return *entry;\n#endif  // FST_NO_DYNAMIC_LINKING\n  }\n\n  // Override this to define how to turn a key into an SO filename.\n  virtual string ConvertKeyToSoFilename(const KeyType &key) const = 0;\n\n  virtual const EntryType *LookupEntry(const KeyType &key) const {\n    MutexLock l(&register_lock_);\n    const auto it = register_table_.find(key);\n    if (it != register_table_.end()) {\n      return &it->second;\n    } else {\n      return nullptr;\n    }\n  }\n\n private:\n  mutable Mutex register_lock_;\n  std::map<KeyType, EntryType> register_table_;\n};\n\n// Generic register-er class capable of creating new register entries in the\n// given RegisterType template parameter. This type must define types Key and\n// Entry, and have appropriate static GetRegister() and instance SetEntry()\n// functions. An easy way to accomplish this is to have RegisterType be the\n// type of a subclass of GenericRegister.\ntemplate <class RegisterType>\nclass GenericRegisterer {\n public:\n  using Key = typename RegisterType::Key;\n  using Entry = typename RegisterType::Entry;\n\n  GenericRegisterer(Key key, Entry entry) {\n    RegisterType::GetRegister()->SetEntry(key, entry);\n  }\n};\n\n}  // namespace fst\n\n#endif  // FST_GENERIC_REGISTER_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/heap.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Implementation of a heap as in STL, but allows tracking positions in heap\n// using a key. The key can be used to do an in-place update of values in the\n// heap.\n\n#ifndef FST_HEAP_H_\n#define FST_HEAP_H_\n\n#include <utility>\n#include <vector>\n\n#include <fst/compat.h>\nnamespace fst {\n\n// A templated heap implementation that supports in-place update of values.\n//\n// The templated heap implementation is a little different from the STL\n// priority_queue and the *_heap operations in STL. This heap supports\n// indexing of values in the heap via an associated key.\n//\n// Each value is internally associated with a key which is returned to the\n// calling functions on heap insert. This key can be used to later update\n// the specific value in the heap.\n//\n// T: the element type of the hash. It can be POD, Data or a pointer to Data.\n// Compare: comparison functor for determining min-heapness.\ntemplate <class T, class Compare>\nclass Heap {\n public:\n  using Value = T;\n\n  static constexpr int kNoKey = -1;\n\n  // Initializes with a specific comparator.\n  explicit Heap(Compare comp = Compare()) : comp_(comp), size_(0) {}\n\n  // Inserts a value into the heap.\n  int Insert(const Value &value) {\n    if (size_ < values_.size()) {\n      values_[size_] = value;\n      pos_[key_[size_]] = size_;\n    } else {\n      values_.push_back(value);\n      pos_.push_back(size_);\n      key_.push_back(size_);\n    }\n    ++size_;\n    return Insert(value, size_ - 1);\n  }\n\n  // Updates a value at position given by the key. The pos_ array is first\n  // indexed by the key. The position gives the position in the heap array.\n  // Once we have the position we can then use the standard heap operations\n  // to calculate the parent and child positions.\n  void Update(int key, const Value &value) {\n    const auto i = pos_[key];\n    const bool is_better = comp_(value, values_[Parent(i)]);\n    values_[i] = value;\n    if (is_better) {\n      Insert(value, i);\n    } else {\n      Heapify(i);\n    }\n  }\n\n  // Returns the least value.\n  Value Pop() {\n    Value top = values_.front();\n    Swap(0, size_-1);\n    size_--;\n    Heapify(0);\n    return top;\n  }\n\n  // Returns the least value w.r.t.  the comparison function from the\n  // heap.\n  const Value &Top() const { return values_.front(); }\n\n  // Returns the element for the given key.\n  const Value &Get(int key) const { return values_[pos_[key]]; }\n\n  // Checks if the heap is empty.\n  bool Empty() const { return size_ == 0; }\n\n  void Clear() { size_ = 0; }\n\n  int Size() const { return size_; }\n\n  void Reserve(int size) {\n    values_.reserve(size);\n    pos_.reserve(size);\n    key_.reserve(size);\n  }\n\n  const Compare &GetCompare() const { return comp_; }\n\n private:\n  // The following private routines are used in a supportive role\n  // for managing the heap and keeping the heap properties.\n\n  // Computes left child of parent.\n  static int Left(int i) {\n    return 2 * (i + 1) - 1;  // 0 -> 1, 1 -> 3\n  }\n\n  // Computes right child of parent.\n  static int Right(int i) {\n    return 2 * (i + 1);  // 0 -> 2, 1 -> 4\n  }\n\n  // Given a child computes parent.\n  static int Parent(int i) {\n    return (i - 1) / 2;  // 0 -> 0, 1 -> 0, 2 -> 0,  3 -> 1,  4 -> 1, ...\n  }\n\n  // Swaps a child and parent. Use to move element up/down tree. Note the use of\n  // a little trick here. When we swap we need to swap:\n  //\n  // - the value\n  // - the associated keys\n  // - the position of the value in the heap\n  void Swap(int j, int k) {\n    const auto tkey = key_[j];\n    pos_[key_[j] = key_[k]] = j;\n    pos_[key_[k] = tkey] = k;\n    using std::swap;\n    swap(values_[j], values_[k]);\n  }\n\n  // Heapifies the subtree rooted at index i.\n  void Heapify(int i) {\n    const auto l = Left(i);\n    const auto r = Right(i);\n    auto largest = (l < size_ && comp_(values_[l], values_[i])) ? l : i;\n    if (r < size_ && comp_(values_[r], values_[largest])) largest = r;\n    if (largest != i) {\n      Swap(i, largest);\n      Heapify(largest);\n    }\n  }\n\n  // Inserts (updates) element at subtree rooted at index i.\n  int Insert(const Value &value, int i) {\n    int p;\n    while (i > 0 && !comp_(values_[p = Parent(i)], value)) {\n      Swap(i, p);\n      i = p;\n    }\n    return key_[i];\n  }\n\n private:\n  const Compare comp_;\n\n  std::vector<int> pos_;\n  std::vector<int> key_;\n  std::vector<Value> values_;\n  int size_;\n};\n\ntemplate <class T, class Compare>\nconstexpr int Heap<T, Compare>::kNoKey;\n\n}  // namespace fst\n\n#endif  // FST_HEAP_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/icu.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// This library implements an unrestricted Thompson/Pike UTF-8 parser and\n// serializer.  UTF-8 is a restricted subset of this byte stream encoding. See\n// http://en.wikipedia.org/wiki/UTF-8 for a good description of the encoding\n// details.\n\n#ifndef FST_ICU_H_\n#define FST_ICU_H_\n\n#include <sstream>\n#include <vector>\n\n#include <fst/log.h>\n\nnamespace fst {\n\n// This function writes UTF-8 codepoints into a vector of Labels, truncating if\n// necessary. It is possible to use this sensibly with as little as 16 bits of\n// Label precision (i.e., when all characters are within the Basic Multilingual\n// Plane). With 21 bits, one can encode all UTF-8 codepoints, including those\n// from the various Astral Planes. Naturally, it is safe to use this with larger\n// Labels (e.g., 64 bits).\ntemplate <class Label>\nbool UTF8StringToLabels(const string &str, std::vector<Label> *labels) {\n  const auto *data = str.data();\n  const auto length = str.size();\n  for (size_t i = 0; i < length;) {\n    int c = data[i++] & 0xff;\n    if ((c & 0x80) == 0) {\n      labels->push_back(c);\n    } else {\n      if ((c & 0xc0) == 0x80) {\n        LOG(ERROR) << \"UTF8StringToLabels: Continuation byte as lead byte\";\n        return false;\n      }\n      int count =\n          (c >= 0xc0) + (c >= 0xe0) + (c >= 0xf0) + (c >= 0xf8) + (c >= 0xfc);\n      int32 code = c & ((1 << (6 - count)) - 1);\n      while (count != 0) {\n        if (i == length) {\n          LOG(ERROR) << \"UTF8StringToLabels: Truncated UTF-8 byte sequence\";\n          return false;\n        }\n        char cb = data[i++];\n        if ((cb & 0xc0) != 0x80) {\n          LOG(ERROR) << \"UTF8StringToLabels: Missing/invalid continuation byte\";\n          return false;\n        }\n        code = (code << 6) | (cb & 0x3f);\n        count--;\n      }\n      if (code < 0) {\n        // Should be unreachable.\n        LOG(ERROR) << \"UTF8StringToLabels: Invalid character found: \" << c;\n        return false;\n      }\n      labels->push_back(code);\n    }\n  }\n  return true;\n}\n\ntemplate <class Label>\nbool LabelsToUTF8String(const std::vector<Label> &labels, string *str) {\n  std::ostringstream ostr;\n  for (size_t i = 0; i < labels.size(); ++i) {\n    int32 code = labels[i];\n    if (code < 0) {\n      LOG(ERROR) << \"LabelsToUTF8String: Invalid character found: \" << code;\n      return false;\n    } else if (code < 0x80) {\n      ostr << static_cast<char>(code);\n    } else if (code < 0x800) {\n      ostr << static_cast<char>((code >> 6) | 0xc0);\n      ostr << static_cast<char>((code & 0x3f) | 0x80);\n    } else if (code < 0x10000) {\n      ostr << static_cast<char>((code >> 12) | 0xe0);\n      ostr << static_cast<char>(((code >> 6) & 0x3f) | 0x80);\n      ostr << static_cast<char>((code & 0x3f) | 0x80);\n    } else if (code < 0x200000) {\n      ostr << static_cast<char>((code >> 18) | 0xf0);\n      ostr << static_cast<char>(((code >> 12) & 0x3f) | 0x80);\n      ostr << static_cast<char>(((code >> 6) & 0x3f) | 0x80);\n      ostr << static_cast<char>((code & 0x3f) | 0x80);\n    } else if (code < 0x4000000) {\n      ostr << static_cast<char>((code >> 24) | 0xf8);\n      ostr << static_cast<char>(((code >> 18) & 0x3f) | 0x80);\n      ostr << static_cast<char>(((code >> 12) & 0x3f) | 0x80);\n      ostr << static_cast<char>(((code >> 6) & 0x3f) | 0x80);\n      ostr << static_cast<char>((code & 0x3f) | 0x80);\n    } else {\n      ostr << static_cast<char>((code >> 30) | 0xfc);\n      ostr << static_cast<char>(((code >> 24) & 0x3f) | 0x80);\n      ostr << static_cast<char>(((code >> 18) & 0x3f) | 0x80);\n      ostr << static_cast<char>(((code >> 12) & 0x3f) | 0x80);\n      ostr << static_cast<char>(((code >> 6) & 0x3f) | 0x80);\n      ostr << static_cast<char>((code & 0x3f) | 0x80);\n    }\n  }\n  *str = ostr.str();\n  return true;\n}\n\n}  // namespace fst\n\n#endif  // FST_ICU_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/intersect.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Class to compute the intersection of two FSAs.\n\n#ifndef FST_INTERSECT_H_\n#define FST_INTERSECT_H_\n\n#include <algorithm>\n#include <vector>\n\n#include <fst/log.h>\n\n#include <fst/cache.h>\n#include <fst/compose.h>\n\n\nnamespace fst {\n\nusing IntersectOptions = ComposeOptions;\n\ntemplate <class Arc, class M = Matcher<Fst<Arc>>,\n          class Filter = SequenceComposeFilter<M>,\n          class StateTable =\n              GenericComposeStateTable<Arc, typename Filter::FilterState>>\nstruct IntersectFstOptions\n    : public ComposeFstOptions<Arc, M, Filter, StateTable> {\n  IntersectFstOptions() {}\n\n  explicit IntersectFstOptions(const CacheOptions &opts, M *matcher1 = nullptr,\n                               M *matcher2 = nullptr, Filter *filter = nullptr,\n                               StateTable *state_table = nullptr)\n      : ComposeFstOptions<Arc, M, Filter, StateTable>(opts, matcher1, matcher2,\n                                                      filter, state_table) {}\n};\n\n// Computes the intersection (Hadamard product) of two FSAs. This version is a\n// delayed FST. Only strings that are in both automata are retained in the\n// result.\n//\n// The two arguments must be acceptors. One of the arguments must be\n// label-sorted.\n//\n// Complexity: same as ComposeFst.\n//\n// Caveats: same as ComposeFst.\ntemplate <class A>\nclass IntersectFst : public ComposeFst<A> {\n public:\n  using Arc = A;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using ComposeFst<A>::CreateBase;\n  using ComposeFst<A>::CreateBase1;\n  using ComposeFst<A>::Properties;\n\n  IntersectFst(const Fst<Arc> &fst1, const Fst<Arc> &fst2,\n               const CacheOptions &opts = CacheOptions())\n      : ComposeFst<Arc>(CreateBase(fst1, fst2, opts)) {\n    const bool acceptors =\n        fst1.Properties(kAcceptor, true) && fst2.Properties(kAcceptor, true);\n    if (!acceptors) {\n      FSTERROR() << \"IntersectFst: Input FSTs are not acceptors\";\n      GetMutableImpl()->SetProperties(kError);\n    }\n  }\n\n  template <class M, class Filter, class StateTable>\n  IntersectFst(const Fst<Arc> &fst1, const Fst<Arc> &fst2,\n               const IntersectFstOptions<Arc, M, Filter, StateTable> &opts)\n      : ComposeFst<Arc>(CreateBase1(fst1, fst2, opts)) {\n    const bool acceptors =\n        fst1.Properties(kAcceptor, true) && fst2.Properties(kAcceptor, true);\n    if (!acceptors) {\n      FSTERROR() << \"IntersectFst: input FSTs are not acceptors\";\n      GetMutableImpl()->SetProperties(kError);\n    }\n  }\n\n  // See Fst<>::Copy() for doc.\n  IntersectFst(const IntersectFst<Arc> &fst, bool safe = false)\n      : ComposeFst<Arc>(fst, safe) {}\n\n  // Get a copy of this IntersectFst. See Fst<>::Copy() for further doc.\n  IntersectFst<Arc> *Copy(bool safe = false) const override {\n    return new IntersectFst<Arc>(*this, safe);\n  }\n\n private:\n  using ImplToFst<internal::ComposeFstImplBase<A>>::GetImpl;\n  using ImplToFst<internal::ComposeFstImplBase<A>>::GetMutableImpl;\n};\n\n// Specialization for IntersectFst.\ntemplate <class Arc>\nclass StateIterator<IntersectFst<Arc>> : public StateIterator<ComposeFst<Arc>> {\n public:\n  explicit StateIterator(const IntersectFst<Arc> &fst)\n      : StateIterator<ComposeFst<Arc>>(fst) {}\n};\n\n// Specialization for IntersectFst.\ntemplate <class Arc>\nclass ArcIterator<IntersectFst<Arc>> : public ArcIterator<ComposeFst<Arc>> {\n public:\n  using StateId = typename Arc::StateId;\n\n  ArcIterator(const IntersectFst<Arc> &fst, StateId s)\n      : ArcIterator<ComposeFst<Arc>>(fst, s) {}\n};\n\n// Useful alias when using StdArc.\nusing StdIntersectFst = IntersectFst<StdArc>;\n\n// Computes the intersection (Hadamard product) of two FSAs. This version\n// writes the intersection to an output MurableFst. Only strings that are in\n// both automata are retained in the result.\n//\n// The two arguments must be acceptors. One of the arguments must be\n// label-sorted.\n//\n// Complexity: same as Compose.\n//\n// Caveats: same as Compose.\ntemplate <class Arc>\nvoid Intersect(const Fst<Arc> &ifst1, const Fst<Arc> &ifst2,\n               MutableFst<Arc> *ofst,\n               const IntersectOptions &opts = IntersectOptions()) {\n  using M = Matcher<Fst<Arc>>;\n  if (opts.filter_type == AUTO_FILTER) {\n    CacheOptions nopts;\n    nopts.gc_limit = 0;  // Cache only the last state for fastest copy.\n    *ofst = IntersectFst<Arc>(ifst1, ifst2, nopts);\n  } else if (opts.filter_type == SEQUENCE_FILTER) {\n    IntersectFstOptions<Arc> iopts;\n    iopts.gc_limit = 0;  // Cache only the last state for fastest copy.\n    *ofst = IntersectFst<Arc>(ifst1, ifst2, iopts);\n  } else if (opts.filter_type == ALT_SEQUENCE_FILTER) {\n    IntersectFstOptions<Arc, M, AltSequenceComposeFilter<M>> iopts;\n    iopts.gc_limit = 0;  // Cache only the last state for fastest copy.\n    *ofst = IntersectFst<Arc>(ifst1, ifst2, iopts);\n  } else if (opts.filter_type == MATCH_FILTER) {\n    IntersectFstOptions<Arc, M, MatchComposeFilter<M>> iopts;\n    iopts.gc_limit = 0;  // Cache only the last state for fastest copy.\n    *ofst = IntersectFst<Arc>(ifst1, ifst2, iopts);\n  }\n  if (opts.connect) Connect(ofst);\n}\n\n}  // namespace fst\n\n#endif  // FST_INTERSECT_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/interval-set.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Class to represent and operate on sets of intervals.\n\n#ifndef FST_INTERVAL_SET_H_\n#define FST_INTERVAL_SET_H_\n\n#include <algorithm>\n#include <iostream>\n#include <vector>\n\n\n#include <fst/util.h>\n\n\nnamespace fst {\n\n// Half-open integral interval [a, b) of signed integers of type T.\ntemplate <class T>\nstruct IntInterval {\n  T begin;\n  T end;\n\n  IntInterval() : begin(-1), end(-1) {}\n\n  IntInterval(T begin, T end) : begin(begin), end(end) {}\n\n  bool operator<(const IntInterval<T> &i) const {\n    return begin < i.begin || (begin == i.begin && end > i.end);\n  }\n\n  bool operator==(const IntInterval<T> &i) const {\n    return begin == i.begin && end == i.end;\n  }\n\n  bool operator!=(const IntInterval<T> &i) const {\n    return begin != i.begin || end != i.end;\n  }\n\n  std::istream &Read(std::istream &strm) {\n    T n;\n    ReadType(strm, &n);\n    begin = n;\n    ReadType(strm, &n);\n    end = n;\n    return strm;\n  }\n\n  std::ostream &Write(std::ostream &strm) const {\n    T n = begin;\n    WriteType(strm, n);\n    n = end;\n    WriteType(strm, n);\n    return strm;\n  }\n};\n\n// Stores IntIntervals<T> in a vector. In addition, keeps the count of points in\n// all intervals.\ntemplate <class T>\nclass VectorIntervalStore {\n public:\n  using Interval = IntInterval<T>;\n  using Iterator = typename std::vector<Interval>::const_iterator;\n\n  VectorIntervalStore() : count_(-1) {}\n\n  std::vector<Interval> *MutableIntervals() { return &intervals_; }\n\n  const Interval *Intervals() const { return intervals_.data(); }\n\n  T Size() const { return intervals_.size(); }\n\n  T Count() const { return count_; }\n\n  void SetCount(T count) { count_ = count; }\n\n  void Clear() {\n    intervals_.clear();\n    count_ = 0;\n  }\n\n  Iterator begin() const { return intervals_.begin(); }\n\n  Iterator end() const { return intervals_.end(); }\n\n  std::istream &Read(std::istream &strm) {\n    ReadType(strm, &intervals_);\n    return ReadType(strm, &count_);\n  }\n\n  std::ostream &Write(std::ostream &strm) const {\n    WriteType(strm, intervals_);\n    return WriteType(strm, count_);\n  }\n\n private:\n  std::vector<Interval> intervals_;\n  T count_;\n};\n\n// Stores and operates on a set of half-open integral intervals [a, b)\n// of signed integers of type T.\ntemplate <class T, class Store = VectorIntervalStore<T>>\nclass IntervalSet {\n public:\n  using Interval = IntInterval<T>;\n\n  template <class... A>\n  explicit IntervalSet(A... args) : intervals_(args...) {}\n\n  // Returns the interval set as a vector.\n  std::vector<Interval> *MutableIntervals() {\n    return intervals_.MutableIntervals();\n  }\n\n  // Returns a pointer to an array of Size() elements.\n  const Interval *Intervals() const { return intervals_.Intervals(); }\n\n  bool Empty() const { return Size() == 0; }\n\n  T Size() const { return intervals_.Size(); }\n\n  // Number of points in the intervals (undefined if not normalized).\n  T Count() const { return intervals_.Count(); }\n\n  void Clear() { intervals_.Clear(); }\n\n  // Adds an interval set to the set. The result may not be normalized.\n  void Union(const IntervalSet<T, Store> &iset) {\n    intervals_.MutableIntervals()->insert(intervals_.MutableIntervals()->end(),\n                                          iset.intervals_.begin(),\n                                          iset.intervals_.end());\n  }\n\n  // Requires intervals be normalized.\n  bool Member(T value) const {\n    const Interval interval(value, value);\n    auto lb = std::lower_bound(intervals_.begin(), intervals_.end(), interval);\n    if (lb == intervals_.begin()) return false;\n    return (--lb)->end > value;\n  }\n\n  // Requires intervals be normalized.\n  bool operator==(const IntervalSet<T, Store> &iset) const {\n    return Size() == iset.Size() &&\n           std::equal(intervals_.begin(), intervals_.end(),\n                      iset.intervals_.begin());\n  }\n\n  // Requires intervals be normalized.\n  bool operator!=(const IntervalSet<T, Store> &iset) const {\n    return Size() != iset.Size() ||\n           !std::equal(intervals_.begin(), intervals_.end(),\n                       iset.intervals_.begin());\n  }\n\n  bool Singleton() const {\n    return Size() == 1 &&\n           intervals_.begin()->begin + 1 == intervals_.begin()->end;\n  }\n\n  // Sorts, collapses overlapping and adjacent interals, and sets count.\n  void Normalize();\n\n  // Intersects an interval set with the set. Requires intervals be normalized.\n  // The result is normalized.\n  void Intersect(const IntervalSet<T, Store> &iset,\n                 IntervalSet<T, Store> *oset) const;\n\n  // Complements the set w.r.t [0, maxval). Requires intervals be normalized.\n  // The result is normalized.\n  void Complement(T maxval, IntervalSet<T, Store> *oset) const;\n\n  // Subtract an interval set from the set. Requires intervals be normalized.\n  // The result is normalized.\n  void Difference(const IntervalSet<T, Store> &iset,\n                  IntervalSet<T, Store> *oset) const;\n\n  // Determines if an interval set overlaps with the set. Requires intervals be\n  // normalized.\n  bool Overlaps(const IntervalSet<T, Store> &iset) const;\n\n  // Determines if an interval set overlaps with the set but neither is\n  // contained in the other. Requires intervals be normalized.\n  bool StrictlyOverlaps(const IntervalSet<T, Store> &iset) const;\n\n  // Determines if an interval set is contained within the set. Requires\n  // intervals be normalized.\n  bool Contains(const IntervalSet<T, Store> &iset) const;\n\n  std::istream &Read(std::istream &strm) { return intervals_.Read(strm); }\n\n  std::ostream &Write(std::ostream &strm) const {\n    return intervals_.Write(strm);\n  }\n\n  typename Store::Iterator begin() const { return intervals_.begin(); }\n\n  typename Store::Iterator end() const { return intervals_.end(); }\n\n private:\n  Store intervals_;\n};\n\n// Sorts, collapses overlapping and adjacent intervals, and sets count.\ntemplate <typename T, class Store>\nvoid IntervalSet<T, Store>::Normalize() {\n  auto &intervals = *intervals_.MutableIntervals();\n  std::sort(intervals.begin(), intervals.end());\n  T count = 0;\n  T size = 0;\n  for (T i = 0; i < intervals.size(); ++i) {\n    auto &inti = intervals[i];\n    if (inti.begin == inti.end) continue;\n    for (T j = i + 1; j < intervals.size(); ++j) {\n      auto &intj = intervals[j];\n      if (intj.begin > inti.end) break;\n      if (intj.end > inti.end) inti.end = intj.end;\n      ++i;\n    }\n    count += inti.end - inti.begin;\n    intervals[size++] = inti;\n  }\n  intervals.resize(size);\n  intervals_.SetCount(count);\n}\n\n// Intersects an interval set with the set. Requires intervals be normalized.\n// The result is normalized.\ntemplate <typename T, class Store>\nvoid IntervalSet<T, Store>::Intersect(const IntervalSet<T, Store> &iset,\n                                      IntervalSet<T, Store> *oset) const {\n  auto *ointervals = oset->MutableIntervals();\n  auto it1 = intervals_.begin();\n  auto it2 = iset.intervals_.begin();\n  ointervals->clear();\n  T count = 0;\n  while (it1 != intervals_.end() && it2 != iset.intervals_.end()) {\n    if (it1->end <= it2->begin) {\n      ++it1;\n    } else if (it2->end <= it1->begin) {\n      ++it2;\n    } else {\n      ointervals->emplace_back(std::max(it1->begin, it2->begin),\n                               std::min(it1->end, it2->end));\n      count += ointervals->back().end - ointervals->back().begin;\n      if (it1->end < it2->end) {\n        ++it1;\n      } else {\n        ++it2;\n      }\n    }\n  }\n  oset->intervals_.SetCount(count);\n}\n\n// Complements the set w.r.t [0, maxval). Requires intervals be normalized.\n// The result is normalized.\ntemplate <typename T, class Store>\nvoid IntervalSet<T, Store>::Complement(T maxval,\n                                       IntervalSet<T, Store> *oset) const {\n  auto *ointervals = oset->MutableIntervals();\n  ointervals->clear();\n  T count = 0;\n  Interval interval;\n  interval.begin = 0;\n  for (auto it = intervals_.begin(); it != intervals_.end(); ++it) {\n    interval.end = std::min(it->begin, maxval);\n    if ((interval.begin) < (interval.end)) {\n      ointervals->push_back(interval);\n      count += interval.end - interval.begin;\n    }\n    interval.begin = it->end;\n  }\n  interval.end = maxval;\n  if ((interval.begin) < (interval.end)) {\n    ointervals->push_back(interval);\n    count += interval.end - interval.begin;\n  }\n  oset->intervals_.SetCount(count);\n}\n\n// Subtract an interval set from the set. Requires intervals be normalized.\n// The result is normalized.\ntemplate <typename T, class Store>\nvoid IntervalSet<T, Store>::Difference(const IntervalSet<T, Store> &iset,\n                                       IntervalSet<T, Store> *oset) const {\n  if (Empty()) {\n    oset->MutableIntervals()->clear();\n    oset->intervals_.SetCount(0);\n  } else {\n    IntervalSet<T, Store> cset;\n    iset.Complement(intervals_.Intervals()[intervals_.Size() - 1].end, &cset);\n    Intersect(cset, oset);\n  }\n}\n\n// Determines if an interval set overlaps with the set. Requires intervals be\n// normalized.\ntemplate <typename T, class Store>\nbool IntervalSet<T, Store>::Overlaps(const IntervalSet<T, Store> &iset) const {\n  auto it1 = intervals_.begin();\n  auto it2 = iset.intervals_.begin();\n  while (it1 != intervals_.end() && it2 != iset.intervals_.end()) {\n    if (it1->end <= it2->begin) {\n      ++it1;\n    } else if (it2->end <= it1->begin) {\n      ++it2;\n    } else {\n      return true;\n    }\n  }\n  return false;\n}\n\n// Determines if an interval set overlaps with the set but neither is contained\n// in the other. Requires intervals be normalized.\ntemplate <typename T, class Store>\nbool IntervalSet<T, Store>::StrictlyOverlaps(\n    const IntervalSet<T, Store> &iset) const {\n  auto it1 = intervals_.begin();\n  auto it2 = iset.intervals_.begin();\n  bool only1 = false;    // Point in intervals_ but not intervals.\n  bool only2 = false;    // Point in intervals but not intervals_.\n  bool overlap = false;  // Point in both intervals_ and intervals.\n  while (it1 != intervals_.end() && it2 != iset.intervals_.end()) {\n    if (it1->end <= it2->begin) {  // no overlap - it1 first\n      only1 = true;\n      ++it1;\n    } else if (it2->end <= it1->begin) {  // no overlap - it2 first\n      only2 = true;\n      ++it2;\n    } else if (it2->begin == it1->begin && it2->end == it1->end) {  // equals\n      overlap = true;\n      ++it1;\n      ++it2;\n    } else if (it2->begin <= it1->begin && it2->end >= it1->end) {  // 1 c 2\n      only2 = true;\n      overlap = true;\n      ++it1;\n    } else if (it1->begin <= it2->begin && it1->end >= it2->end) {  // 2 c 1\n      only1 = true;\n      overlap = true;\n      ++it2;\n    } else {  // Strict overlap.\n      only1 = true;\n      only2 = true;\n      overlap = true;\n    }\n    if (only1 == true && only2 == true && overlap == true) return true;\n  }\n  if (it1 != intervals_.end()) only1 = true;\n  if (it2 != iset.intervals_.end()) only2 = true;\n  return only1 == true && only2 == true && overlap == true;\n}\n\n// Determines if an interval set is contained within the set. Requires intervals\n// be normalized.\ntemplate <typename T, class Store>\nbool IntervalSet<T, Store>::Contains(const IntervalSet<T, Store> &iset) const {\n  if (iset.Count() > Count()) return false;\n  auto it1 = intervals_.begin();\n  auto it2 = iset.intervals_.begin();\n  while (it1 != intervals_.end() && it2 != iset.intervals_.end()) {\n    if ((it1->end) <= (it2->begin)) {  // No overlap; it1 first.\n      ++it1;\n    } else if ((it2->begin) < (it1->begin) ||\n               (it2->end) > (it1->end)) {  // No C.\n      return false;\n    } else if (it2->end == it1->end) {\n      ++it1;\n      ++it2;\n    } else {\n      ++it2;\n    }\n  }\n  return it2 == iset.intervals_.end();\n}\n\ntemplate <typename T, class Store>\nstd::ostream &operator<<(std::ostream &strm, const IntervalSet<T, Store> &s) {\n  strm << \"{\";\n  for (T i = 0; i < s.Size(); ++i) {\n    if (i > 0) {\n      strm << \",\";\n    }\n    const auto &interval = s.Intervals()[i];\n    strm << \"[\" << interval.begin << \",\" << interval.end << \")\";\n  }\n  strm << \"}\";\n  return strm;\n}\n\n}  // namespace fst\n\n#endif  // FST_INTERVAL_SET_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/invert.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Functions and classes to invert an FST.\n\n#ifndef FST_INVERT_H_\n#define FST_INVERT_H_\n\n#include <fst/arc-map.h>\n#include <fst/mutable-fst.h>\n\n\nnamespace fst {\n\n// Mapper to implement inversion of an arc.\ntemplate <class A>\nstruct InvertMapper {\n  using FromArc = A;\n  using ToArc = A;\n\n  InvertMapper() {}\n\n  ToArc operator()(const FromArc &arc) const {\n    return ToArc(arc.olabel, arc.ilabel, arc.weight, arc.nextstate);\n  }\n\n  constexpr MapFinalAction FinalAction() const {\n     return MAP_NO_SUPERFINAL;\n  }\n\n  constexpr MapSymbolsAction InputSymbolsAction() const {\n    return MAP_CLEAR_SYMBOLS;\n  }\n\n  constexpr MapSymbolsAction OutputSymbolsAction() const {\n    return MAP_CLEAR_SYMBOLS;\n  }\n\n  uint64 Properties(uint64 props) const {\n    return InvertProperties(props);\n  }\n};\n\n// Inverts the transduction corresponding to an FST by exchanging the\n// FST's input and output labels.\n//\n// Complexity:\n//\n//   Time: O(V + E)\n//   Space: O(1)\n//\n// where V is the number of states and E is the number of arcs.\ntemplate <class Arc>\ninline void Invert(const Fst<Arc> &ifst, MutableFst<Arc> *ofst) {\n  std::unique_ptr<SymbolTable> input(\n      ifst.InputSymbols() ? ifst.InputSymbols()->Copy() : nullptr);\n  std::unique_ptr<SymbolTable> output(\n      ifst.OutputSymbols() ? ifst.OutputSymbols()->Copy() : nullptr);\n  ArcMap(ifst, ofst, InvertMapper<Arc>());\n  ofst->SetInputSymbols(output.get());\n  ofst->SetOutputSymbols(input.get());\n}\n\n// Destructive variant of the above.\ntemplate <class Arc>\ninline void Invert(MutableFst<Arc> *fst) {\n  std::unique_ptr<SymbolTable> input(\n      fst->InputSymbols() ? fst->InputSymbols()->Copy() : nullptr);\n  std::unique_ptr<SymbolTable> output(\n      fst->OutputSymbols() ? fst->OutputSymbols()->Copy() : nullptr);\n  ArcMap(fst, InvertMapper<Arc>());\n  fst->SetInputSymbols(output.get());\n  fst->SetOutputSymbols(input.get());\n}\n\n// Inverts the transduction corresponding to an FST by exchanging the\n// FST's input and output labels. This version is a delayed FST.\n//\n// Complexity:\n//\n//   Time: O(v + e)\n//   Space: O(1)\n//\n// where v is the number of states visited and e is the number of arcs visited.\n// Constant time and to visit an input state or arc is assumed and exclusive of\n// caching.\ntemplate <class A>\nclass InvertFst : public ArcMapFst<A, A, InvertMapper<A>> {\n public:\n  using Arc = A;\n\n  using Mapper = InvertMapper<Arc>;\n  using Impl = internal::ArcMapFstImpl<A, A, InvertMapper<A>>;\n\n  explicit InvertFst(const Fst<Arc> &fst)\n      : ArcMapFst<Arc, Arc, Mapper>(fst, Mapper()) {\n    GetMutableImpl()->SetOutputSymbols(fst.InputSymbols());\n    GetMutableImpl()->SetInputSymbols(fst.OutputSymbols());\n  }\n\n  // See Fst<>::Copy() for doc.\n  InvertFst(const InvertFst<Arc> &fst, bool safe = false)\n      : ArcMapFst<Arc, Arc, Mapper>(fst, safe) {}\n\n  // Get a copy of this InvertFst. See Fst<>::Copy() for further doc.\n  InvertFst<Arc> *Copy(bool safe = false) const override {\n    return new InvertFst(*this, safe);\n  }\n\n private:\n  using ImplToFst<Impl>::GetMutableImpl;\n};\n\n// Specialization for InvertFst.\ntemplate <class Arc>\nclass StateIterator<InvertFst<Arc>>\n    : public StateIterator<ArcMapFst<Arc, Arc, InvertMapper<Arc>>> {\n public:\n  explicit StateIterator(const InvertFst<Arc> &fst)\n      : StateIterator<ArcMapFst<Arc, Arc, InvertMapper<Arc>>>(fst) {}\n};\n\n// Specialization for InvertFst.\ntemplate <class Arc>\nclass ArcIterator<InvertFst<Arc>>\n    : public ArcIterator<ArcMapFst<Arc, Arc, InvertMapper<Arc>>> {\n public:\n  using StateId = typename Arc::StateId;\n\n  ArcIterator(const InvertFst<Arc> &fst, StateId s)\n      : ArcIterator<ArcMapFst<Arc, Arc, InvertMapper<Arc>>>(fst, s) {}\n};\n\n// Useful alias when using StdArc.\nusing StdInvertFst = InvertFst<StdArc>;\n\n}  // namespace fst\n\n#endif  // FST_INVERT_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/isomorphic.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Function to test two FSTs are isomorphic, i.e., they are equal up to a state\n// and arc re-ordering. FSTs should be deterministic when viewed as\n// unweighted automata.\n\n#ifndef FST_ISOMORPHIC_H_\n#define FST_ISOMORPHIC_H_\n\n#include <algorithm>\n#include <list>\n#include <type_traits>\n#include <vector>\n\n#include <fst/log.h>\n\n#include <fst/fst.h>\n\n\nnamespace fst {\nnamespace internal {\n\n// Orders weights for equality checking.\ntemplate <class Weight, typename std::enable_if<\n                            IsIdempotent<Weight>::value>::type * = nullptr>\nbool WeightCompare(const Weight &w1, const Weight &w2, float delta,\n                   bool *error) {\n  return NaturalLess<Weight>()(w1, w2);\n}\n\ntemplate <class Weight, typename std::enable_if<\n                            !IsIdempotent<Weight>::value>::type * = nullptr>\nbool WeightCompare(const Weight &w1, const Weight &w2, float delta,\n                   bool *error) {\n  // No natural order; use hash.\n  const auto q1 = w1.Quantize(delta);\n  const auto q2 = w2.Quantize(delta);\n  auto n1 = q1.Hash();\n  auto n2 = q2.Hash();\n  // Hash not unique; very unlikely to happen.\n  if (n1 == n2 && q1 != q2) {\n    VLOG(1) << \"Isomorphic: Weight hash collision\";\n    *error = true;\n  }\n  return n1 < n2;\n}\n\ntemplate <class Arc>\nclass Isomorphism {\n  using StateId = typename Arc::StateId;\n\n public:\n  Isomorphism(const Fst<Arc> &fst1, const Fst<Arc> &fst2, float delta)\n      : fst1_(fst1.Copy()),\n        fst2_(fst2.Copy()),\n        delta_(delta),\n        error_(false),\n        comp_(delta, &error_) {}\n\n  // Checks if input FSTs are isomorphic.\n  bool IsIsomorphic() {\n    if (fst1_->Start() == kNoStateId && fst2_->Start() == kNoStateId) {\n      return true;\n    }\n    if (fst1_->Start() == kNoStateId || fst2_->Start() == kNoStateId) {\n      return false;\n    }\n    PairState(fst1_->Start(), fst2_->Start());\n    while (!queue_.empty()) {\n      const auto &pr = queue_.front();\n      if (!IsIsomorphicState(pr.first, pr.second)) return false;\n      queue_.pop_front();\n    }\n    return true;\n  }\n\n  bool Error() const { return error_; }\n\n private:\n  // Orders arcs for equality checking.\n  class ArcCompare {\n   public:\n    ArcCompare(float delta, bool *error) : delta_(delta), error_(error) {}\n\n    bool operator()(const Arc &arc1, const Arc &arc2) const {\n      if (arc1.ilabel < arc2.ilabel) return true;\n      if (arc1.ilabel > arc2.ilabel) return false;\n      if (arc1.olabel < arc2.olabel) return true;\n      if (arc1.olabel > arc2.olabel) return false;\n      return WeightCompare(arc1.weight, arc2.weight, delta_, error_);\n    }\n\n   private:\n    float delta_;\n    bool *error_;\n  };\n\n  // Maintains state correspondences and queue.\n  bool PairState(StateId s1, StateId s2) {\n    if (state_pairs_.size() <= s1) state_pairs_.resize(s1 + 1, kNoStateId);\n    if (state_pairs_[s1] == s2) {\n      return true;  // already seen this pair\n    } else if (state_pairs_[s1] != kNoStateId) {\n      return false;  // s1 already paired with another s2\n    }\n    state_pairs_[s1] = s2;\n    queue_.push_back(std::make_pair(s1, s2));\n    return true;\n  }\n\n  // Checks if state pair is isomorphic\n  bool IsIsomorphicState(StateId s1, StateId s2);\n\n  std::unique_ptr<Fst<Arc>> fst1_;\n  std::unique_ptr<Fst<Arc>> fst2_;\n  float delta_;                          // Weight equality delta.\n  std::vector<Arc> arcs1_;               // For sorting arcs on FST1.\n  std::vector<Arc> arcs2_;               // For sorting arcs on FST2.\n  std::vector<StateId> state_pairs_;     // Maintains state correspondences.\n  std::list<std::pair<StateId, StateId>> queue_;  // Queue of state pairs.\n  bool error_;                           // Error flag.\n  ArcCompare comp_;\n};\n\ntemplate <class Arc>\nbool Isomorphism<Arc>::IsIsomorphicState(StateId s1, StateId s2) {\n  if (!ApproxEqual(fst1_->Final(s1), fst2_->Final(s2), delta_)) return false;\n  auto narcs1 = fst1_->NumArcs(s1);\n  auto narcs2 = fst2_->NumArcs(s2);\n  if (narcs1 != narcs2) return false;\n  ArcIterator<Fst<Arc>> aiter1(*fst1_, s1);\n  ArcIterator<Fst<Arc>> aiter2(*fst2_, s2);\n  arcs1_.clear();\n  arcs1_.reserve(narcs1);\n  arcs2_.clear();\n  arcs2_.reserve(narcs2);\n  for (; !aiter1.Done(); aiter1.Next(), aiter2.Next()) {\n    arcs1_.push_back(aiter1.Value());\n    arcs2_.push_back(aiter2.Value());\n  }\n  std::sort(arcs1_.begin(), arcs1_.end(), comp_);\n  std::sort(arcs2_.begin(), arcs2_.end(), comp_);\n  for (size_t i = 0; i < arcs1_.size(); ++i) {\n    const auto &arc1 = arcs1_[i];\n    const auto &arc2 = arcs2_[i];\n    if (arc1.ilabel != arc2.ilabel) return false;\n    if (arc1.olabel != arc2.olabel) return false;\n    if (!ApproxEqual(arc1.weight, arc2.weight, delta_)) return false;\n    if (!PairState(arc1.nextstate, arc2.nextstate)) return false;\n    if (i > 0) {  // Checks for non-determinism.\n      const auto &arc0 = arcs1_[i - 1];\n      if (arc1.ilabel == arc0.ilabel && arc1.olabel == arc0.olabel &&\n          ApproxEqual(arc1.weight, arc0.weight, delta_)) {\n        VLOG(1) << \"Isomorphic: Non-determinism as an unweighted automaton\";\n        error_ = true;\n        return false;\n      }\n    }\n  }\n  return true;\n}\n\n}  // namespace internal\n\n// Tests if two FSTs have the same states and arcs up to a reordering.\n// Inputs should be non-deterministic when viewed as unweighted automata.\ntemplate <class Arc>\nbool Isomorphic(const Fst<Arc> &fst1, const Fst<Arc> &fst2,\n                float delta = kDelta) {\n  internal::Isomorphism<Arc> iso(fst1, fst2, delta);\n  bool result = iso.IsIsomorphic();\n  if (iso.Error()) {\n    FSTERROR() << \"Isomorphic: Cannot determine if inputs are isomorphic\";\n    return false;\n  } else {\n    return result;\n  }\n}\n\n}  // namespace fst\n\n#endif  // FST_ISOMORPHIC_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/label-reachable.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Class to determine if a non-epsilon label can be read as the first\n// non-epsilon symbol along some path from a given state.\n\n#ifndef FST_LABEL_REACHABLE_H_\n#define FST_LABEL_REACHABLE_H_\n\n#include <unordered_map>\n#include <utility>\n#include <vector>\n\n#include <fst/log.h>\n\n#include <fst/accumulator.h>\n#include <fst/arcsort.h>\n#include <fst/interval-set.h>\n#include <fst/state-reachable.h>\n#include <fst/util.h>\n#include <fst/vector-fst.h>\n\n\nnamespace fst {\n\n// Stores shareable data for label reachable class copies.\ntemplate <typename Label>\nclass LabelReachableData {\n public:\n  using LabelIntervalSet = IntervalSet<Label>;\n  using Interval = typename LabelIntervalSet::Interval;\n\n  explicit LabelReachableData(bool reach_input, bool keep_relabel_data = true)\n      : reach_input_(reach_input),\n        keep_relabel_data_(keep_relabel_data),\n        have_relabel_data_(true),\n        final_label_(kNoLabel) {}\n\n  ~LabelReachableData() {}\n\n  bool ReachInput() const { return reach_input_; }\n\n  std::vector<LabelIntervalSet> *MutableIntervalSets() {\n    return &interval_sets_;\n  }\n\n  const LabelIntervalSet &GetIntervalSet(int s) const {\n    return interval_sets_[s];\n  }\n\n  int NumIntervalSets() const { return interval_sets_.size(); }\n\n  std::unordered_map<Label, Label> *Label2Index() {\n    if (!have_relabel_data_) {\n      FSTERROR() << \"LabelReachableData: No relabeling data\";\n    }\n    return &label2index_;\n  }\n\n  void SetFinalLabel(Label final_label) { final_label_ = final_label; }\n\n  Label FinalLabel() const { return final_label_; }\n\n  static LabelReachableData<Label> *Read(std::istream &istrm,\n                                         const FstReadOptions &opts) {\n    auto *data = new LabelReachableData<Label>();\n    ReadType(istrm, &data->reach_input_);\n    ReadType(istrm, &data->keep_relabel_data_);\n    data->have_relabel_data_ = data->keep_relabel_data_;\n    if (data->keep_relabel_data_) ReadType(istrm, &data->label2index_);\n    ReadType(istrm, &data->final_label_);\n    ReadType(istrm, &data->interval_sets_);\n    return data;\n  }\n\n  bool Write(std::ostream &ostrm, const FstWriteOptions &opts) const {\n    WriteType(ostrm, reach_input_);\n    WriteType(ostrm, keep_relabel_data_);\n    if (keep_relabel_data_) WriteType(ostrm, label2index_);\n    WriteType(ostrm, FinalLabel());\n    WriteType(ostrm, interval_sets_);\n    return true;\n  }\n\n private:\n  LabelReachableData() {}\n\n  bool reach_input_;                              // Input labels considered?\n  bool keep_relabel_data_;                        // Save label2index_ to file?\n  bool have_relabel_data_;                        // Using label2index_?\n  Label final_label_;                             // Final label.\n  std::unordered_map<Label, Label> label2index_;  // Finds index for a label.\n  std::vector<LabelIntervalSet> interval_sets_;   // Interval sets per state.\n};\n\n// Tests reachability of labels from a given state. If reach_input is true, then\n// input labels are considered, o.w. output labels are considered. To test for\n// reachability from a state s, first do SetState(s), then a label l can be\n// reached from state s of FST f iff Reach(r) is true where r = Relabel(l). The\n// relabeling is required to ensure a compact representation of the reachable\n// labels.\n\n// The whole FST can be relabeled instead with Relabel(&f, reach_input) so that\n// the test Reach(r) applies directly to the labels of the transformed FST f.\n// The relabeled FST will also be sorted appropriately for composition.\n//\n// Reachablity of a final state from state s (via an epsilon path) can be\n// tested with ReachFinal().\n//\n// Reachability can also be tested on the set of labels specified by an arc\n// iterator, useful for FST composition. In particular, Reach(aiter, ...) is\n// true if labels on the input (output) side of the transitions of the arc\n// iterator, when iter_input is true (false), can be reached from the state s.\n// The iterator labels must have already been relabeled.\n//\n// With the arc iterator test of reachability, the begin position, end position\n// and accumulated arc weight of the matches can be returned. The optional\n// template argument controls how reachable arc weights are accumulated. The\n// default uses semiring Plus(). Alternative ones can be used to distribute the\n// weights in composition in various ways.\ntemplate <class Arc, class Accumulator = DefaultAccumulator<Arc>,\n          class D = LabelReachableData<typename Arc::Label>>\nclass LabelReachable {\n public:\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n  using Data = D;\n\n  using LabelIntervalSet = typename Data::LabelIntervalSet;\n\n  using Interval = typename LabelIntervalSet::Interval;\n\n  LabelReachable(const Fst<Arc> &fst, bool reach_input,\n                 Accumulator *accumulator = nullptr,\n                 bool keep_relabel_data = true)\n      : fst_(new VectorFst<Arc>(fst)),\n        s_(kNoStateId),\n        data_(std::make_shared<Data>(reach_input, keep_relabel_data)),\n        accumulator_(accumulator ? accumulator : new Accumulator()),\n        ncalls_(0),\n        nintervals_(0),\n        reach_fst_input_(false),\n        error_(false) {\n    const auto ins = fst_->NumStates();\n    TransformFst();\n    FindIntervals(ins);\n    fst_.reset();\n  }\n\n  explicit LabelReachable(std::shared_ptr<Data> data,\n                          Accumulator *accumulator = nullptr)\n      : s_(kNoStateId),\n        data_(std::move(data)),\n        accumulator_(accumulator ? accumulator : new Accumulator()),\n        ncalls_(0),\n        nintervals_(0),\n        reach_fst_input_(false),\n        error_(false) {}\n\n  LabelReachable(const LabelReachable<Arc, Accumulator, Data> &reachable,\n                 bool safe = false)\n      : s_(kNoStateId),\n        data_(reachable.data_),\n        accumulator_(new Accumulator(*reachable.accumulator_, safe)),\n        ncalls_(0),\n        nintervals_(0),\n        reach_fst_input_(reachable.reach_fst_input_),\n        error_(reachable.error_) {}\n\n  ~LabelReachable() {\n    if (ncalls_ > 0) {\n      VLOG(2) << \"# of calls: \" << ncalls_;\n      VLOG(2) << \"# of intervals/call: \" << (nintervals_ / ncalls_);\n    }\n  }\n\n  // Relabels w.r.t labels that give compact label sets.\n  Label Relabel(Label label) {\n    if (label == 0 || error_) return label;\n    auto &label2index = *data_->Label2Index();\n    auto &relabel = label2index[label];\n    if (!relabel) relabel = label2index.size() + 1;  // Adds new label.\n    return relabel;\n  }\n\n  // Relabels FST w.r.t to labels that give compact label sets.\n  void Relabel(MutableFst<Arc> *fst, bool relabel_input) {\n    for (StateIterator<MutableFst<Arc>> siter(*fst); !siter.Done();\n         siter.Next()) {\n      for (MutableArcIterator<MutableFst<Arc>> aiter(fst, siter.Value());\n           !aiter.Done(); aiter.Next()) {\n        auto arc = aiter.Value();\n        if (relabel_input) {\n          arc.ilabel = Relabel(arc.ilabel);\n        } else {\n          arc.olabel = Relabel(arc.olabel);\n        }\n        aiter.SetValue(arc);\n      }\n    }\n    if (relabel_input) {\n      ArcSort(fst, ILabelCompare<Arc>());\n      fst->SetInputSymbols(nullptr);\n    } else {\n      ArcSort(fst, OLabelCompare<Arc>());\n      fst->SetOutputSymbols(nullptr);\n    }\n  }\n\n  // Returns relabeling pairs (cf. relabel.h::Relabel()). If avoid_collisions is\n  // true, extra pairs are added to ensure no collisions when relabeling\n  // automata that have labels unseen here.\n  void RelabelPairs(std::vector<std::pair<Label, Label>> *pairs,\n                    bool avoid_collisions = false) {\n    pairs->clear();\n    const auto &label2index = *data_->Label2Index();\n    // Maps labels to their new values in [1, label2index().size()].\n    for (auto it = label2index.begin(); it != label2index.end(); ++it) {\n      if (it->second != data_->FinalLabel()) {\n        pairs->push_back(std::make_pair(it->first, it->second));\n      }\n    }\n    if (avoid_collisions) {\n      // Ensures any label in [1, label2index().size()] is mapped either\n      // by the above step or to label2index() + 1 (to avoid collisions).\n      for (size_t i = 1; i <= label2index.size(); ++i) {\n        const auto it = label2index.find(i);\n        if (it == label2index.end() || it->second == data_->FinalLabel()) {\n          pairs->push_back(std::make_pair(i, label2index.size() + 1));\n        }\n      }\n    }\n  }\n\n  // Set current state. Optionally set state associated\n  // with arc iterator to be passed to Reach.\n  void SetState(StateId s, StateId aiter_s = kNoStateId) {\n    s_ = s;\n    if (aiter_s != kNoStateId) {\n      accumulator_->SetState(aiter_s);\n      if (accumulator_->Error()) error_ = true;\n    }\n  }\n\n  // Can reach this label from current state?\n  // Original labels must be transformed by the Relabel methods above.\n  bool Reach(Label label) const {\n    if (label == 0 || error_) return false;\n    return data_->GetIntervalSet(s_).Member(label);\n  }\n\n  // Can reach final state (via epsilon transitions) from this state?\n  bool ReachFinal() const {\n    if (error_) return false;\n    return data_->GetIntervalSet(s_).Member(data_->FinalLabel());\n  }\n\n  // Initialize with secondary FST to be used with Reach(Iterator,...).\n  // If reach_input = true, then arc input labels are considered in\n  // Reach(aiter, ...), o.w. output labels are considered. If copy is true, then\n  // the FST is a copy of the FST used in the previous call to this method\n  // (useful to avoid unnecessary updates).\n  template <class FST>\n  void ReachInit(const FST &fst, bool reach_input, bool copy = false) {\n    reach_fst_input_ = reach_input;\n    if (!fst.Properties(reach_fst_input_ ? kILabelSorted : kOLabelSorted,\n                        true)) {\n      FSTERROR() << \"LabelReachable::ReachInit: Fst is not sorted\";\n      error_ = true;\n    }\n    accumulator_->Init(fst, copy);\n    if (accumulator_->Error()) error_ = true;\n  }\n\n  // Can reach any arc iterator label between iterator positions\n  // aiter_begin and aiter_end?\n  // Arc iterator labels must be transformed by the Relabel methods\n  // above. If compute_weight is true, user may call ReachWeight().\n  template <class Iterator>\n  bool Reach(Iterator *aiter, ssize_t aiter_begin, ssize_t aiter_end,\n             bool compute_weight) {\n    if (error_) return false;\n    const auto &interval_set = data_->GetIntervalSet(s_);\n    ++ncalls_;\n    nintervals_ += interval_set.Size();\n    reach_begin_ = -1;\n    reach_end_ = -1;\n    reach_weight_ = Weight::Zero();\n    const auto flags = aiter->Flags();  // Save flags to restore them on exit.\n    aiter->SetFlags(kArcNoCache, kArcNoCache);  // Makes caching optional.\n    aiter->Seek(aiter_begin);\n    if (2 * (aiter_end - aiter_begin) < interval_set.Size()) {\n      // Checks each arc against intervals, setting arc iterator flags to only\n      // compute the ilabel or olabel values, since they are the only values\n      // required for most of the arcs processed.\n      aiter->SetFlags(reach_fst_input_ ? kArcILabelValue : kArcOLabelValue,\n                      kArcValueFlags);\n      Label reach_label = kNoLabel;\n      for (auto aiter_pos = aiter_begin; aiter_pos < aiter_end;\n           aiter->Next(), ++aiter_pos) {\n        const auto &arc = aiter->Value();\n        const auto label = reach_fst_input_ ? arc.ilabel : arc.olabel;\n        if (label == reach_label || Reach(label)) {\n          reach_label = label;\n          if (reach_begin_ < 0) reach_begin_ = aiter_pos;\n          reach_end_ = aiter_pos + 1;\n          if (compute_weight) {\n            if (!(aiter->Flags() & kArcWeightValue)) {\n              // If arc.weight wasn't computed by the call to aiter->Value()\n              // above, we need to call aiter->Value() again after having set\n              // the arc iterator flags to compute the arc weight value.\n              aiter->SetFlags(kArcWeightValue, kArcValueFlags);\n              const auto &arcb = aiter->Value();\n              // Call the accumulator.\n              reach_weight_ = accumulator_->Sum(reach_weight_, arcb.weight);\n              // Only ilabel or olabel required to process the following arcs.\n              aiter->SetFlags(\n                  reach_fst_input_ ? kArcILabelValue : kArcOLabelValue,\n                  kArcValueFlags);\n            } else {\n              // Calls the accumulator.\n              reach_weight_ = accumulator_->Sum(reach_weight_, arc.weight);\n            }\n          }\n        }\n      }\n    } else {\n      // Checks each interval against arcs.\n      auto begin_low = aiter_begin;\n      auto end_low = aiter_begin;\n      for (const auto &interval : interval_set) {\n        begin_low = LowerBound(aiter, end_low, aiter_end, interval.begin);\n        end_low = LowerBound(aiter, begin_low, aiter_end, interval.end);\n        if (end_low - begin_low > 0) {\n          if (reach_begin_ < 0) reach_begin_ = begin_low;\n          reach_end_ = end_low;\n          if (compute_weight) {\n            aiter->SetFlags(kArcWeightValue, kArcValueFlags);\n            reach_weight_ =\n                accumulator_->Sum(reach_weight_, aiter, begin_low, end_low);\n          }\n        }\n      }\n    }\n    aiter->SetFlags(flags, kArcFlags);  // Restores original flag values.\n    return reach_begin_ >= 0;\n  }\n\n  // Returns iterator position of first matching arc.\n  ssize_t ReachBegin() const { return reach_begin_; }\n\n  // Returns iterator position one past last matching arc.\n  ssize_t ReachEnd() const { return reach_end_; }\n\n  // Return the sum of the weights for matching arcs. Valid only if\n  // compute_weight was true in Reach() call.\n  Weight ReachWeight() const { return reach_weight_; }\n\n  // Access to the relabeling map. Excludes epsilon (0) label but\n  // includes kNoLabel that is used internally for super-final\n  // transitons.\n  const std::unordered_map<Label, Label> &Label2Index() const {\n    return *data_->Label2Index();\n  }\n\n  const Data *GetData() const { return data_.get(); }\n\n  std::shared_ptr<Data> GetSharedData() const { return data_; }\n\n  bool Error() const { return error_ || accumulator_->Error(); }\n\n private:\n  // Redirects labeled arcs (input or output labels determined by ReachInput())\n  // to new label-specific final states. Each original final state is\n  // redirected via a transition labeled with kNoLabel to a new\n  // kNoLabel-specific final state. Creates super-initial state for all states\n  // with zero in-degree.\n  void TransformFst() {\n    auto ins = fst_->NumStates();\n    auto ons = ins;\n    std::vector<ssize_t> indeg(ins, 0);\n    // Redirects labeled arcs to new final states.\n    for (StateId s = 0; s < ins; ++s) {\n      for (MutableArcIterator<VectorFst<Arc>> aiter(fst_.get(), s);\n           !aiter.Done(); aiter.Next()) {\n        auto arc = aiter.Value();\n        const auto label = data_->ReachInput() ? arc.ilabel : arc.olabel;\n        if (label) {\n          auto insert_result = label2state_.insert(std::make_pair(label, ons));\n          if (insert_result.second) {\n            indeg.push_back(0);\n            ++ons;\n          }\n          arc.nextstate = label2state_[label];\n          aiter.SetValue(arc);\n        }\n        ++indeg[arc.nextstate];  // Finds in-degrees for next step.\n      }\n      // Redirects final weights to new final state.\n      const auto final_weight = fst_->Final(s);\n      if (final_weight != Weight::Zero()) {\n        auto insert_result = label2state_.insert(std::make_pair(kNoLabel, ons));\n        if (insert_result.second) {\n          indeg.push_back(0);\n          ++ons;\n        }\n        Arc arc(kNoLabel, kNoLabel, final_weight, label2state_[kNoLabel]);\n        fst_->AddArc(s, arc);\n        ++indeg[arc.nextstate];  // Finds in-degrees for next step.\n        fst_->SetFinal(s, Weight::Zero());\n      }\n    }\n    // Adds new final states to the FST.\n    while (fst_->NumStates() < ons) {\n      StateId s = fst_->AddState();\n      fst_->SetFinal(s, Weight::One());\n    }\n    // Creates a super-initial state for all states with zero in-degree.\n    const auto start = fst_->AddState();\n    fst_->SetStart(start);\n    for (StateId s = 0; s < start; ++s) {\n      if (indeg[s] == 0) {\n        Arc arc(0, 0, Weight::One(), s);\n        fst_->AddArc(start, arc);\n      }\n    }\n  }\n\n  void FindIntervals(StateId ins) {\n    StateReachable<Arc, Label, LabelIntervalSet> state_reachable(*fst_);\n    if (state_reachable.Error()) {\n      error_ = true;\n      return;\n    }\n    auto &state2index = state_reachable.State2Index();\n    auto &interval_sets = *data_->MutableIntervalSets();\n    interval_sets = state_reachable.IntervalSets();\n    interval_sets.resize(ins);\n    auto &label2index = *data_->Label2Index();\n    for (const auto &kv : label2state_) {\n      Label i = state2index[kv.second];\n      label2index[kv.first] = i;\n      if (kv.first == kNoLabel) data_->SetFinalLabel(i);\n    }\n    label2state_.clear();\n    double nintervals = 0;\n    ssize_t non_intervals = 0;\n    for (StateId s = 0; s < ins; ++s) {\n      nintervals += interval_sets[s].Size();\n      if (interval_sets[s].Size() > 1) {\n        ++non_intervals;\n        VLOG(3) << \"state: \" << s\n                << \" # of intervals: \" << interval_sets[s].Size();\n      }\n    }\n    VLOG(2) << \"# of states: \" << ins;\n    VLOG(2) << \"# of intervals: \" << nintervals;\n    VLOG(2) << \"# of intervals/state: \" << nintervals / ins;\n    VLOG(2) << \"# of non-interval states: \" << non_intervals;\n  }\n\n  template <class Iterator>\n  ssize_t LowerBound(Iterator *aiter, ssize_t aiter_begin, ssize_t aiter_end,\n                     Label match_label) const {\n    // Only needs to compute the ilabel or olabel of arcs when performing the\n    // binary search.\n    aiter->SetFlags(reach_fst_input_ ? kArcILabelValue : kArcOLabelValue,\n                    kArcValueFlags);\n    ssize_t low = aiter_begin;\n    ssize_t high = aiter_end;\n    while (low < high) {\n      const ssize_t mid = low + (high - low) / 2;\n      aiter->Seek(mid);\n      auto label =\n          reach_fst_input_ ? aiter->Value().ilabel : aiter->Value().olabel;\n      if (label < match_label) {\n        low = mid + 1;\n      } else {\n        high = mid;\n      }\n    }\n    aiter->Seek(low);\n    aiter->SetFlags(kArcValueFlags, kArcValueFlags);\n    return low;\n  }\n\n  std::unique_ptr<VectorFst<Arc>> fst_;\n  // Current state\n  StateId s_;\n  // Finds final state for a label\n  std::unordered_map<Label, StateId> label2state_;\n  // Iterator position of first match.\n  ssize_t reach_begin_;\n  // Iterator position after last match.\n  ssize_t reach_end_;\n  // Gives weight sum of arc iterator arcs with reachable labels.\n  Weight reach_weight_;\n  // Shareable data between copies.\n  std::shared_ptr<Data> data_;\n  // Sums arc weights.\n  std::unique_ptr<Accumulator> accumulator_;\n  double ncalls_;\n  double nintervals_;\n  bool reach_fst_input_;\n  bool error_;\n};\n\n}  // namespace fst\n\n#endif  // FST_LABEL_REACHABLE_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/lexicographic-weight.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Lexicographic weight set and associated semiring operation definitions.\n//\n// A lexicographic weight is a sequence of weights, each of which must have the\n// path property and Times() must be (strongly) cancellative\n// (for all a,b,c != Zero(): Times(c, a) = Times(c, b) => a = b,\n// Times(a, c) = Times(b, c) => a = b).\n// The + operation on two weights a and b is the lexicographically\n// prior of a and b.\n\n#ifndef FST_LEXICOGRAPHIC_WEIGHT_H_\n#define FST_LEXICOGRAPHIC_WEIGHT_H_\n\n#include <cstdlib>\n\n#include <string>\n\n#include <fst/log.h>\n\n#include <fst/pair-weight.h>\n#include <fst/weight.h>\n\n\nnamespace fst {\n\ntemplate <class W1, class W2>\nclass LexicographicWeight : public PairWeight<W1, W2> {\n public:\n  using ReverseWeight = LexicographicWeight<typename W1::ReverseWeight,\n                                            typename W2::ReverseWeight>;\n\n  using PairWeight<W1, W2>::Value1;\n  using PairWeight<W1, W2>::Value2;\n  using PairWeight<W1, W2>::SetValue1;\n  using PairWeight<W1, W2>::SetValue2;\n  using PairWeight<W1, W2>::Zero;\n  using PairWeight<W1, W2>::One;\n  using PairWeight<W1, W2>::NoWeight;\n  using PairWeight<W1, W2>::Quantize;\n  using PairWeight<W1, W2>::Reverse;\n\n  LexicographicWeight() {}\n\n  explicit LexicographicWeight(const PairWeight<W1, W2> &w)\n      : PairWeight<W1, W2>(w) {}\n\n  LexicographicWeight(W1 w1, W2 w2) : PairWeight<W1, W2>(w1, w2) {\n    if ((W1::Properties() & kPath) != kPath) {\n      FSTERROR() << \"LexicographicWeight must \"\n                 << \"have the path property: \" << W1::Type();\n      SetValue1(W1::NoWeight());\n    }\n    if ((W2::Properties() & kPath) != kPath) {\n      FSTERROR() << \"LexicographicWeight must \"\n                 << \"have the path property: \" << W2::Type();\n      SetValue2(W2::NoWeight());\n    }\n  }\n\n  static const LexicographicWeight &Zero() {\n    static const LexicographicWeight zero(PairWeight<W1, W2>::Zero());\n    return zero;\n  }\n\n  static const LexicographicWeight &One() {\n    static const LexicographicWeight one(PairWeight<W1, W2>::One());\n    return one;\n  }\n\n  static const LexicographicWeight &NoWeight() {\n    static const LexicographicWeight no_weight(PairWeight<W1, W2>::NoWeight());\n    return no_weight;\n  }\n\n  static const string &Type() {\n    static const string *const type =\n        new string(W1::Type() + \"_LT_\" + W2::Type());\n    return *type;\n  }\n\n  bool Member() const {\n    if (!Value1().Member() || !Value2().Member()) return false;\n    // Lexicographic weights cannot mix zeroes and non-zeroes.\n    if (Value1() == W1::Zero() && Value2() == W2::Zero()) return true;\n    if (Value1() != W1::Zero() && Value2() != W2::Zero()) return true;\n    return false;\n  }\n\n  LexicographicWeight Quantize(float delta = kDelta) const {\n    return LexicographicWeight(PairWeight<W1, W2>::Quantize());\n  }\n\n  ReverseWeight Reverse() const {\n    return ReverseWeight(PairWeight<W1, W2>::Reverse());\n  }\n\n  static constexpr uint64 Properties() {\n    return W1::Properties() & W2::Properties() &\n           (kLeftSemiring | kRightSemiring | kPath | kIdempotent |\n            kCommutative);\n  }\n};\n\ntemplate <class W1, class W2>\ninline LexicographicWeight<W1, W2> Plus(const LexicographicWeight<W1, W2> &w,\n                                        const LexicographicWeight<W1, W2> &v) {\n  if (!w.Member() || !v.Member()) {\n    return LexicographicWeight<W1, W2>::NoWeight();\n  }\n  NaturalLess<W1> less1;\n  NaturalLess<W2> less2;\n  if (less1(w.Value1(), v.Value1())) return w;\n  if (less1(v.Value1(), w.Value1())) return v;\n  if (less2(w.Value2(), v.Value2())) return w;\n  if (less2(v.Value2(), w.Value2())) return v;\n  return w;\n}\n\ntemplate <class W1, class W2>\ninline LexicographicWeight<W1, W2> Times(const LexicographicWeight<W1, W2> &w,\n                                         const LexicographicWeight<W1, W2> &v) {\n  return LexicographicWeight<W1, W2>(Times(w.Value1(), v.Value1()),\n                                     Times(w.Value2(), v.Value2()));\n}\n\ntemplate <class W1, class W2>\ninline LexicographicWeight<W1, W2> Divide(const LexicographicWeight<W1, W2> &w,\n                                          const LexicographicWeight<W1, W2> &v,\n                                          DivideType typ = DIVIDE_ANY) {\n  return LexicographicWeight<W1, W2>(Divide(w.Value1(), v.Value1(), typ),\n                                     Divide(w.Value2(), v.Value2(), typ));\n}\n\n// This function object generates weights by calling the underlying generators\n// for the templated weight types, like all other pair weight types. However,\n// for lexicographic weights, we cannot generate zeroes for the two subweights\n// separately: weights are members iff both members are zero or both members\n// are non-zero. This is intended primarily for testing.\ntemplate <class W1, class W2>\nclass WeightGenerate<LexicographicWeight<W1, W2>> {\n public:\n  using Weight = LexicographicWeight<W1, W1>;\n  using Generate1 = WeightGenerate<W1>;\n  using Generate2 = WeightGenerate<W2>;\n\n  explicit WeightGenerate(bool allow_zero = true,\n                          size_t num_random_weights = kNumRandomWeights)\n      : generator1_(false, num_random_weights),\n        generator2_(false, num_random_weights), allow_zero_(allow_zero),\n        num_random_weights_(num_random_weights) {}\n\n  Weight operator()() const {\n    if (allow_zero_) {\n      const int n = rand() % (num_random_weights_ + 1);  // NOLINT\n      if (n == num_random_weights_) return Weight(W1::Zero(), W2::Zero());\n    }\n    return Weight(generator1_(), generator2_());\n  }\n\n private:\n  const Generate1 generator1_;\n  const Generate2 generator2_;\n  // Permits Zero() and zero divisors.\n  const bool allow_zero_;\n  // The number of alternative random weights.\n  const size_t num_random_weights_;\n};\n\n}  // namespace fst\n\n#endif  // FST_LEXICOGRAPHIC_WEIGHT_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/lock.h",
    "content": "// Licensed under the Apache License, Version 2.0 (the \"License\");\n// you may not use this file except in compliance with the License.\n// You may obtain a copy of the License at\n//\n//      http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n// See the License for the specific language governing permissions and\n// limitations under the License.\n//\n// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Google-compatibility locking declarations and inline definitions.\n\n#ifndef FST_LIB_LOCK_H_\n#define FST_LIB_LOCK_H_\n\n#include <mutex>\n\nnamespace fst {\n\nusing namespace std;\n\nclass Mutex {\n public:\n  Mutex() {}\n\n  inline void Lock() { mu_.lock(); }\n\n  inline void Unlock() { mu_.unlock(); }\n\n private:\n  std::mutex mu_;\n\n  Mutex(const Mutex &) = delete;\n  Mutex &operator=(const Mutex &) = delete;\n};\n\nclass MutexLock {\n public:\n  explicit MutexLock(Mutex *mu) : mu_(mu) { mu_->Lock(); }\n\n  ~MutexLock() { mu_->Unlock(); }\n\n private:\n  Mutex *mu_;\n\n  MutexLock(const MutexLock &) = delete;\n  MutexLock &operator=(const MutexLock &) = delete;\n};\n\n// Currently, we don't use a separate reader lock.\n// TODO(kbg): Implement this with std::shared_mutex once C++17 becomes widely\n// available.\nusing ReaderMutexLock = MutexLock;\n\n}  // namespace fst\n\n#endif  // FST_LIB_LOCK_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/log.h",
    "content": "// Licensed under the Apache License, Version 2.0 (the \"License\");\n// you may not use this file except in compliance with the License.\n// You may obtain a copy of the License at\n//\n//      http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n// See the License for the specific language governing permissions and\n// limitations under the License.\n//\n// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Google-style logging declarations and inline definitions.\n\n#ifndef FST_LIB_LOG_H_\n#define FST_LIB_LOG_H_\n\n#include <cassert>\n#include <iostream>\n#include <string>\n\n#include <fst/types.h>\n#include <fst/flags.h>\n\nusing std::string;\n\nDECLARE_int32(v);\n\nclass LogMessage {\n public:\n  LogMessage(const string &type) : fatal_(type == \"FATAL\") {\n    std::cerr << type << \": \";\n  }\n  ~LogMessage() {\n    std::cerr << std::endl;\n    if(fatal_)\n      exit(1);\n  }\n  std::ostream &stream() { return std::cerr; }\n\n private:\n  bool fatal_;\n};\n\n#define LOG(type) LogMessage(#type).stream()\n#define VLOG(level) if ((level) <= FLAGS_v) LOG(INFO)\n\n// Checks\ninline void FstCheck(bool x, const char* expr,\n                const char *file, int line) {\n  if (!x) {\n    LOG(FATAL) << \"Check failed: \\\"\" << expr\n               << \"\\\" file: \" << file\n               << \" line: \" << line;\n  }\n}\n\n#define CHECK(x) FstCheck(static_cast<bool>(x), #x, __FILE__, __LINE__)\n#define CHECK_EQ(x, y) CHECK((x) == (y))\n#define CHECK_LT(x, y) CHECK((x) < (y))\n#define CHECK_GT(x, y) CHECK((x) > (y))\n#define CHECK_LE(x, y) CHECK((x) <= (y))\n#define CHECK_GE(x, y) CHECK((x) >= (y))\n#define CHECK_NE(x, y) CHECK((x) != (y))\n\n// Debug checks\n#define DCHECK(x) assert(x)\n#define DCHECK_EQ(x, y) DCHECK((x) == (y))\n#define DCHECK_LT(x, y) DCHECK((x) < (y))\n#define DCHECK_GT(x, y) DCHECK((x) > (y))\n#define DCHECK_LE(x, y) DCHECK((x) <= (y))\n#define DCHECK_GE(x, y) DCHECK((x) >= (y))\n#define DCHECK_NE(x, y) DCHECK((x) != (y))\n\n\n// Ports\n#define ATTRIBUTE_DEPRECATED __attribute__((deprecated))\n\n#endif  // FST_LIB_LOG_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/lookahead-filter.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Composition filters to support lookahead matchers, useful for improving\n// composition efficiency with certain inputs.\n\n#ifndef FST_LOOKAHEAD_FILTER_H_\n#define FST_LOOKAHEAD_FILTER_H_\n\n#include <vector>\n\n#include <fst/log.h>\n\n#include <fst/filter-state.h>\n#include <fst/fst.h>\n#include <fst/lookahead-matcher.h>\n\n\nnamespace fst {\n\n// Identifies and verifies the capabilities of the matcher to be used for\n// lookahead with the composition filters below. This version is passed two\n// matchers.\ntemplate <class Matcher1, class Matcher2>\nMatchType LookAheadMatchType(const Matcher1 &m1, const Matcher2 &m2) {\n  const auto type1 = m1.Type(false);\n  const auto type2 = m2.Type(false);\n  if (type1 == MATCH_OUTPUT && m1.Flags() & kOutputLookAheadMatcher) {\n    return MATCH_OUTPUT;\n  } else if (type2 == MATCH_INPUT && m2.Flags() & kInputLookAheadMatcher) {\n    return MATCH_INPUT;\n  } else if (m1.Flags() & kOutputLookAheadMatcher &&\n             m1.Type(true) == MATCH_OUTPUT) {\n    return MATCH_OUTPUT;\n  } else if (m2.Flags() & kInputLookAheadMatcher &&\n             m2.Type(true) == MATCH_INPUT) {\n    return MATCH_INPUT;\n  } else {\n    return MATCH_NONE;\n  }\n}\n\n// Identifies and verifies the capabilities of the matcher to be used for\n// lookahead with the composition filters below. This version uses the FST's\n// default matchers.\ntemplate <class Arc>\nMatchType LookAheadMatchType(const Fst<Arc> &fst1, const Fst<Arc> &fst2) {\n  LookAheadMatcher<Fst<Arc>> matcher1(fst1, MATCH_OUTPUT);\n  LookAheadMatcher<Fst<Arc>> matcher2(fst2, MATCH_INPUT);\n  return LookAheadMatchType(matcher1, matcher2);\n}\n\n// LookAheadSelector is a helper class for selecting among possibly distinct\n// FST and matcher types without using a common base class. This lets us avoid\n// virtual function calls. It stores and returns the appropriate FSTs and\n// matcher for lookahead. It is templated on the matcher types. General case\n// has no methods.\ntemplate <class Matcher1, class Matcher2, MatchType MT>\nclass LookAheadSelector {};\n\n// Stores and returns the appropriate FST and matcher for lookahead. Specialized\n// for two matchers of same type with the (match) type argument determining\n// which is used for lookahead.\ntemplate <class Matcher, MatchType MT>\nclass LookAheadSelector<Matcher, Matcher, MT> {\n public:\n  using FST = typename Matcher::FST;\n\n  LookAheadSelector(Matcher *lmatcher1, Matcher *lmatcher2, MatchType type)\n      : lmatcher1_(lmatcher1->Copy()),\n        lmatcher2_(lmatcher2->Copy()),\n        type_(type) {}\n\n  LookAheadSelector(const LookAheadSelector<Matcher, Matcher, MT> &selector)\n      : lmatcher1_(selector.lmatcher1_->Copy()),\n        lmatcher2_(selector.lmatcher2_->Copy()),\n        type_(selector.type_) {}\n\n  const FST &GetFst() const {\n    return type_ == MATCH_OUTPUT ? lmatcher2_->GetFst() : lmatcher1_->GetFst();\n  }\n\n  Matcher *GetMatcher() const {\n    return type_ == MATCH_OUTPUT ? lmatcher1_.get() : lmatcher2_.get();\n  }\n\n private:\n  std::unique_ptr<Matcher> lmatcher1_;\n  std::unique_ptr<Matcher> lmatcher2_;\n  MatchType type_;\n};\n\n// Stores and returns the appropriate FST and matcher for lookahead.\n// Specialized for lookahead on input labels.\ntemplate <class Matcher1, class Matcher2>\nclass LookAheadSelector<Matcher1, Matcher2, MATCH_INPUT> {\n public:\n  using FST1 = typename Matcher1::FST;\n\n  LookAheadSelector(Matcher1 *lmatcher1, Matcher2 *lmatcher2, MatchType)\n      : fst_(lmatcher1->GetFst().Copy()), lmatcher_(lmatcher2->Copy()) {}\n\n  LookAheadSelector(\n      const LookAheadSelector<Matcher1, Matcher2, MATCH_INPUT> &selector)\n      : fst_(selector.fst_->Copy()), lmatcher_(selector.lmatcher_->Copy()) {}\n\n  const FST1 &GetFst() const { return *fst_; }\n\n  Matcher2 *GetMatcher() const { return lmatcher_.get(); }\n\n private:\n  std::unique_ptr<const FST1> fst_;\n  std::unique_ptr<Matcher2> lmatcher_;\n};\n\n// Stores and returns the appropriate FST and matcher for lookahead.\n// Specialized for lookahead on output labels.\ntemplate <class Matcher1, class Matcher2>\nclass LookAheadSelector<Matcher1, Matcher2, MATCH_OUTPUT> {\n public:\n  using FST2 = typename Matcher2::FST;\n\n  LookAheadSelector(Matcher1 *lmatcher1, Matcher2 *lmatcher2, MatchType)\n      : fst_(lmatcher2->GetFst().Copy()), lmatcher_(lmatcher1->Copy()) {}\n\n  LookAheadSelector(\n      const LookAheadSelector<Matcher1, Matcher2, MATCH_OUTPUT> &selector)\n      : fst_(selector.fst_->Copy()), lmatcher_(selector.lmatcher_->Copy()) {}\n\n  const FST2 &GetFst() const { return *fst_; }\n\n  Matcher1 *GetMatcher() const { return lmatcher_.get(); }\n\n private:\n  std::unique_ptr<const FST2> fst_;\n  std::unique_ptr<Matcher1> lmatcher_;\n};\n\n// This filter uses a lookahead matcher in FilterArc(arc1, arc2) to examine the\n// future of the composition state (arc1.nextstate, arc2.nextstate), blocking\n// moving forward when its determined to be\n// non-coaccessible. It is templated on an underlying filter, typically the\n// epsilon filter. Which matcher is the lookahead matcher is determined by the\n// template argument MT unless it is MATCH_BOTH. In that case, both matcher\n// arguments must be lookahead matchers of the same type and one will be\n// selected by LookAheadMatchType() based on their capability.\ntemplate <class Filter, class M1 = LookAheadMatcher<typename Filter::FST1>,\n          class M2 = M1, MatchType MT = MATCH_BOTH>\nclass LookAheadComposeFilter {\n public:\n  using Arc = typename Filter::Arc;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using FST1 = typename Filter::FST1;\n  using FST2 = typename Filter::FST2;\n  using Matcher1 = typename Filter::Matcher1;\n  using Matcher2 = typename Filter::Matcher2;\n  using FilterState = typename Filter::FilterState;\n\n  LookAheadComposeFilter(const FST1 &fst1, const FST2 &fst2, M1 *matcher1,\n                         M2 *matcher2)\n      : filter_(fst1, fst2, matcher1, matcher2),\n        lookahead_type_(MT == MATCH_BOTH\n                            ? LookAheadMatchType(*filter_.GetMatcher1(),\n                                                 *filter_.GetMatcher2())\n                            : MT),\n        selector_(filter_.GetMatcher1(), filter_.GetMatcher2(),\n                  lookahead_type_),\n        flags_(lookahead_type_ == MATCH_OUTPUT\n                   ? filter_.GetMatcher1()->Flags()\n                   : filter_.GetMatcher2()->Flags()) {\n    if (lookahead_type_ == MATCH_NONE) {\n      FSTERROR() << \"LookAheadComposeFilter: 1st argument cannot \"\n                 << \"match/look-ahead on output labels and 2nd argument \"\n                 << \"cannot match/look-ahead on input labels\";\n    }\n    selector_.GetMatcher()->InitLookAheadFst(selector_.GetFst());\n  }\n\n  LookAheadComposeFilter(\n      const LookAheadComposeFilter<Filter, M1, M2, MT> &filter,\n      bool safe = false)\n      : filter_(filter.filter_, safe),\n        lookahead_type_(filter.lookahead_type_),\n        selector_(filter_.GetMatcher1(), filter_.GetMatcher2(),\n                  lookahead_type_),\n        flags_(filter.flags_) {\n    selector_.GetMatcher()->InitLookAheadFst(selector_.GetFst(), true);\n  }\n\n  FilterState Start() const { return filter_.Start(); }\n\n  void SetState(StateId s1, StateId s2, const FilterState &fs) {\n    filter_.SetState(s1, s2, fs);\n  }\n\n  FilterState FilterArc(Arc *arc1, Arc *arc2) const {\n    lookahead_arc_ = false;\n    const FilterState &fs = filter_.FilterArc(arc1, arc2);\n    if (fs == FilterState::NoState()) return FilterState::NoState();\n    return LookAheadOutput() ? LookAheadFilterArc(arc1, arc2, fs)\n                             : LookAheadFilterArc(arc2, arc1, fs);\n  }\n\n  void FilterFinal(Weight *weight1, Weight *weight2) const {\n    filter_.FilterFinal(weight1, weight2);\n  }\n\n  // Returns matchers; ownership stays with filter.\n\n  Matcher1 *GetMatcher1() { return filter_.GetMatcher1(); }\n\n  Matcher2 *GetMatcher2() { return filter_.GetMatcher2(); }\n\n  const LookAheadSelector<Matcher1, Matcher2, MT> &Selector() const {\n    return selector_;\n  }\n\n  uint64 Properties(uint64 inprops) const {\n    auto outprops = filter_.Properties(inprops);\n    if (lookahead_type_ == MATCH_NONE) outprops |= kError;\n    return outprops;\n  }\n\n  uint32 LookAheadFlags() const { return flags_; }\n\n  bool LookAheadArc() const { return lookahead_arc_; }\n\n  bool LookAheadOutput() const {\n    if (MT == MATCH_OUTPUT) {\n      return true;\n    } else if (MT == MATCH_INPUT) {\n      return false;\n    } else if (lookahead_type_ == MATCH_OUTPUT) {\n      return true;\n    } else {\n      return false;\n    }\n  }\n\n private:\n  FilterState LookAheadFilterArc(Arc *arca, Arc *arcb,\n                                 const FilterState &fs) const {\n    auto &labela = LookAheadOutput() ? arca->olabel : arca->ilabel;\n    if (labela != 0 && !(flags_ & kLookAheadNonEpsilons)) return fs;\n    if (labela == 0 && !(flags_ & kLookAheadEpsilons)) return fs;\n    lookahead_arc_ = true;\n    selector_.GetMatcher()->SetState(arca->nextstate);\n    return selector_.GetMatcher()->LookAheadFst(selector_.GetFst(),\n                                                arcb->nextstate)\n               ? fs\n               : FilterState::NoState();\n  }\n\n  Filter filter_;             // Underlying filter.\n  MatchType lookahead_type_;  // Lookahead match type.\n  LookAheadSelector<Matcher1, Matcher2, MT> selector_;\n  uint32 flags_;                // Lookahead flags.\n  mutable bool lookahead_arc_;  // Look-ahead performed at last FilterArc()?\n\n  LookAheadComposeFilter &operator=(const LookAheadComposeFilter &) = delete;\n};\n\n// This filter adds weight-pushing to a lookahead composition filter using the\n// LookAheadWeight() method of matcher argument. It is templated on an\n// underlying lookahead filter, typically the basic lookahead filter.\n// Weight-pushing in composition brings weights forward as much as possible\n// based on the lookahead information.\ntemplate <class Filter, class M1 = LookAheadMatcher<typename Filter::FST1>,\n          class M2 = M1, MatchType MT = MATCH_BOTH>\nclass PushWeightsComposeFilter {\n public:\n  using Arc = typename Filter::Arc;\n  using StateId = typename Filter::StateId;\n  using Weight = typename Filter::Weight;\n\n  using FST1 = typename Filter::FST1;\n  using FST2 = typename Filter::FST2;\n  using Matcher1 = typename Filter::Matcher1;\n  using Matcher2 = typename Filter::Matcher2;\n\n  using FilterState1 = typename Filter::FilterState;\n  using FilterState2 = WeightFilterState<Weight>;\n  using FilterState = PairFilterState<FilterState1, FilterState2>;\n\n  PushWeightsComposeFilter(const FST1 &fst1, const FST2 &fst2, M1 *matcher1,\n                           M2 *matcher2)\n      : filter_(fst1, fst2, matcher1, matcher2), fs_(FilterState::NoState()) {}\n\n  PushWeightsComposeFilter(\n      const PushWeightsComposeFilter<Filter, M1, M2, MT> &filter,\n      bool safe = false)\n      : filter_(filter.filter_, safe), fs_(FilterState::NoState()) {}\n\n  FilterState Start() const {\n    return FilterState(filter_.Start(), FilterState2(Weight::One()));\n  }\n\n  void SetState(StateId s1, StateId s2, const FilterState &fs) {\n    fs_ = fs;\n    filter_.SetState(s1, s2, fs.GetState1());\n  }\n\n  FilterState FilterArc(Arc *arc1, Arc *arc2) const {\n    const auto &fs1 = filter_.FilterArc(arc1, arc2);\n    if (fs1 == FilterState1::NoState()) return FilterState::NoState();\n    if (!(LookAheadFlags() & kLookAheadWeight)) {\n      return FilterState(fs1, FilterState2(Weight::One()));\n    }\n    const auto &lweight = filter_.LookAheadArc()\n                              ? Selector().GetMatcher()->LookAheadWeight()\n                              : Weight::One();\n    const auto &fs2 = fs_.GetState2();\n    const auto &fweight = fs2.GetWeight();\n    // Disallows Zero() weight futures.\n    if (lweight == Weight::Zero()) return FilterState::NoState();\n    arc2->weight = Divide(Times(arc2->weight, lweight), fweight);\n    return FilterState(fs1, FilterState2(lweight.Quantize()));\n  }\n\n  void FilterFinal(Weight *weight1, Weight *weight2) const {\n    filter_.FilterFinal(weight1, weight2);\n    if (!(LookAheadFlags() & kLookAheadWeight) || *weight1 == Weight::Zero()) {\n      return;\n    }\n    const auto &fs2 = fs_.GetState2();\n    const auto &fweight = fs2.GetWeight();\n    *weight1 = Divide(*weight1, fweight);\n  }\n\n  // Returns matchers; ownership states with filter.\n\n  Matcher1 *GetMatcher1() { return filter_.GetMatcher1(); }\n\n  Matcher2 *GetMatcher2() { return filter_.GetMatcher2(); }\n\n  const LookAheadSelector<Matcher1, Matcher2, MT> &Selector() const {\n    return filter_.Selector();\n  }\n\n  uint32 LookAheadFlags() const { return filter_.LookAheadFlags(); }\n\n  bool LookAheadArc() const { return filter_.LookAheadArc(); }\n\n  bool LookAheadOutput() const { return filter_.LookAheadOutput(); }\n\n  uint64 Properties(uint64 props) const {\n    return filter_.Properties(props) & kWeightInvariantProperties;\n  }\n\n private:\n  Filter filter_;   // Underlying filter.\n  FilterState fs_;  // Current filter state.\n\n  PushWeightsComposeFilter &operator=(const PushWeightsComposeFilter &) =\n      delete;\n};\n\n// This filter adds label-pushing to a lookahead composition filter using the\n// LookAheadPrefix() method of the matcher argument. It is templated on an\n// underlying filter, typically the basic lookahead or weight-pushing lookahead\n// filter. Label-pushing in composition matches labels as early as possible\n// based on the lookahead information.\ntemplate <class Filter, class M1 = LookAheadMatcher<typename Filter::FST1>,\n          class M2 = M1, MatchType MT = MATCH_BOTH>\nclass PushLabelsComposeFilter {\n public:\n  using Arc = typename Filter::Arc;\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using FST1 = typename Filter::FST1;\n  using FST2 = typename Filter::FST2;\n  using Matcher1 = MultiEpsMatcher<typename Filter::Matcher1>;\n  using Matcher2 = MultiEpsMatcher<typename Filter::Matcher2>;\n  using FilterState1 = typename Filter::FilterState;\n  using FilterState2 = IntegerFilterState<Label>;\n  using FilterState = PairFilterState<FilterState1, FilterState2>;\n\n  PushLabelsComposeFilter(const FST1 &fst1, const FST2 &fst2, M1 *matcher1,\n                          M2 *matcher2)\n      : filter_(fst1, fst2, matcher1, matcher2),\n        fs_(FilterState::NoState()),\n        fst1_(filter_.GetMatcher1()->GetFst()),\n        fst2_(filter_.GetMatcher2()->GetFst()),\n        matcher1_(fst1_, MATCH_OUTPUT,\n                  filter_.LookAheadOutput() ? kMultiEpsList : kMultiEpsLoop,\n                  filter_.GetMatcher1(), false),\n        matcher2_(fst2_, MATCH_INPUT,\n                  filter_.LookAheadOutput() ? kMultiEpsLoop : kMultiEpsList,\n                  filter_.GetMatcher2(), false) {}\n\n  PushLabelsComposeFilter(\n      const PushLabelsComposeFilter<Filter, M1, M2, MT> &filter,\n      bool safe = false)\n      : filter_(filter.filter_, safe),\n        fs_(FilterState::NoState()),\n        fst1_(filter_.GetMatcher1()->GetFst()),\n        fst2_(filter_.GetMatcher2()->GetFst()),\n        matcher1_(fst1_, MATCH_OUTPUT,\n                  filter_.LookAheadOutput() ? kMultiEpsList : kMultiEpsLoop,\n                  filter_.GetMatcher1(), false),\n        matcher2_(fst2_, MATCH_INPUT,\n                  filter_.LookAheadOutput() ? kMultiEpsLoop : kMultiEpsList,\n                  filter_.GetMatcher2(), false) {}\n\n  FilterState Start() const {\n    return FilterState(filter_.Start(), FilterState2(kNoLabel));\n  }\n\n  void SetState(StateId s1, StateId s2, const FilterState &fs) {\n    fs_ = fs;\n    filter_.SetState(s1, s2, fs.GetState1());\n    if (!(LookAheadFlags() & kLookAheadPrefix)) return;\n    narcsa_ = LookAheadOutput() ? internal::NumArcs(fst1_, s1)\n                                : internal::NumArcs(fst2_, s2);\n    const auto &fs2 = fs_.GetState2();\n    const auto &flabel = fs2.GetState();\n    GetMatcher1()->ClearMultiEpsLabels();\n    GetMatcher2()->ClearMultiEpsLabels();\n    if (flabel != kNoLabel) {                   // Have a lookahead label?\n      GetMatcher1()->AddMultiEpsLabel(flabel);  // Yes, make it a multi-epsilon\n      GetMatcher2()->AddMultiEpsLabel(flabel);  // label so that it matches the\n    }                                           // implicit epsilon arc to be\n  }                                             // modified below when pushing.\n\n  FilterState FilterArc(Arc *arc1, Arc *arc2) const {\n    if (!(LookAheadFlags() & kLookAheadPrefix)) {\n      return FilterState(filter_.FilterArc(arc1, arc2), FilterState2(kNoLabel));\n    }\n    const auto &fs2 = fs_.GetState2();\n    const auto &flabel = fs2.GetState();\n    if (flabel != kNoLabel) {  // Have a lookahead label?\n      return LookAheadOutput() ? PushedLabelFilterArc(arc1, arc2, flabel)\n                               : PushedLabelFilterArc(arc2, arc1, flabel);\n    }\n    const auto &fs1 = filter_.FilterArc(arc1, arc2);\n    if (fs1 == FilterState1::NoState()) return FilterState::NoState();\n    if (!filter_.LookAheadArc())\n      return FilterState(fs1, FilterState2(kNoLabel));\n    return LookAheadOutput() ? PushLabelFilterArc(arc1, arc2, fs1)\n                             : PushLabelFilterArc(arc2, arc1, fs1);\n  }\n\n  void FilterFinal(Weight *weight1, Weight *weight2) const {\n    filter_.FilterFinal(weight1, weight2);\n    if (!(LookAheadFlags() & kLookAheadPrefix) || *weight1 == Weight::Zero()) {\n      return;\n    }\n    const auto &fs2 = fs_.GetState2();\n    const auto &flabel = fs2.GetState();\n    if (flabel != kNoLabel) *weight1 = Weight::Zero();\n  }\n\n  // Returns matchers; ownership states with filter.\n\n  Matcher1 *GetMatcher1() { return &matcher1_; }\n\n  Matcher2 *GetMatcher2() { return &matcher2_; }\n\n  uint64 Properties(uint64 iprops) const {\n    const auto oprops = filter_.Properties(iprops);\n    if (LookAheadOutput()) {\n      return oprops & kOLabelInvariantProperties;\n    } else {\n      return oprops & kILabelInvariantProperties;\n    }\n  }\n\n private:\n  const LookAheadSelector<typename Filter::Matcher1, typename Filter::Matcher2,\n                          MT>\n      &Selector() const {\n    return filter_.Selector();\n  }\n\n  // Consumes an already pushed label.\n  FilterState PushedLabelFilterArc(Arc *arca, Arc *arcb, Label flabel) const {\n    auto &labela = LookAheadOutput() ? arca->olabel : arca->ilabel;\n    const auto &labelb = LookAheadOutput() ? arcb->ilabel : arcb->olabel;\n    if (labelb != kNoLabel) {\n      return FilterState::NoState();  // Blocks non-(multi-)epsilon label\n    } else if (labela == flabel) {\n      labela = 0;  // Converts match to multi-epsilon to epsilon.\n      return Start();\n    } else if (labela == 0) {\n      if (narcsa_ == 1) return fs_;  // Takes epsilon, keeping state with label.\n      Selector().GetMatcher()->SetState(arca->nextstate);\n      if (Selector().GetMatcher()->LookAheadLabel(flabel)) {\n        return fs_;  // Takes epsilon, keeping state with label.\n      } else {\n        return FilterState::NoState();  // Blocks non-coaccessible path.\n      }\n    } else {\n      return FilterState::NoState();  // Blocks mismatch to multi-epsilon label.\n    }\n  }\n\n  // Pushes a label forward when possible.\n  FilterState PushLabelFilterArc(Arc *arca, Arc *arcb,\n                                 const FilterState1 &fs1) const {\n    auto &labela = LookAheadOutput() ? arca->olabel : arca->ilabel;\n    const auto &labelb = LookAheadOutput() ? arcb->olabel : arcb->ilabel;\n    if (labelb != 0) {  // No place to push.\n      return FilterState(fs1, FilterState2(kNoLabel));\n    }\n    if (labela != 0 &&  // Wrong lookahead prefix type?\n        LookAheadFlags() & kLookAheadNonEpsilonPrefix) {\n      return FilterState(fs1, FilterState2(kNoLabel));\n    }\n    Arc larc(kNoLabel, kNoLabel, Weight::Zero(), kNoStateId);\n    if (Selector().GetMatcher()->LookAheadPrefix(&larc)) {  // Have prefix arc?\n      labela = LookAheadOutput() ? larc.ilabel : larc.olabel;\n      arcb->ilabel = larc.ilabel;  // Goes forward on that arc,\n      arcb->olabel = larc.olabel;  // thus pushing the label.\n      arcb->weight = Times(arcb->weight, larc.weight);\n      arcb->nextstate = larc.nextstate;\n      return FilterState(fs1, FilterState2(labela));\n    } else {\n      return FilterState(fs1, FilterState2(kNoLabel));\n    }\n  }\n\n  uint32 LookAheadFlags() const { return filter_.LookAheadFlags(); }\n\n  bool LookAheadArc() const { return filter_.LookAheadArc(); }\n\n  bool LookAheadOutput() const { return filter_.LookAheadOutput(); }\n\n  Filter filter_;   // Underlying filter.\n  FilterState fs_;  // Current filter state.\n  const FST1 &fst1_;\n  const FST2 &fst2_;\n  Matcher1 matcher1_;  // Multi-epsilon matcher for fst1_.\n  Matcher2 matcher2_;  // Multi-epsilon matcher for fst2_.\n  ssize_t narcsa_;     // Number of arcs leaving look-ahead match FST.\n\n  PushLabelsComposeFilter &operator=(const PushLabelsComposeFilter &) = delete;\n};\n\n// Convenience class for setting up composition with a default lookahead matcher\n// and filter.\ntemplate <class Arc, MatchType type>\nclass DefaultLookAhead {\n public:\n  using M = Matcher<Fst<Arc>>;\n  using ComposeFilter = SequenceComposeFilter<M>;\n  using FstMatcher = M;\n};\n\n// Specializes for MATCH_INPUT to allow lookahead.\ntemplate <class Arc>\nclass DefaultLookAhead<Arc, MATCH_INPUT> {\n public:\n  using M = LookAheadMatcher<Fst<Arc>>;\n  using SF = SequenceComposeFilter<M>;\n  using ComposeFilter = LookAheadComposeFilter<SF, M>;\n  using FstMatcher = M;\n};\n\n// Specializes for MATCH_OUTPUT to allow lookahead.\ntemplate <class Arc>\nclass DefaultLookAhead<Arc, MATCH_OUTPUT> {\n public:\n  using M = LookAheadMatcher<Fst<Arc>>;\n  using SF = AltSequenceComposeFilter<M>;\n  using ComposeFilter = LookAheadComposeFilter<SF, M>;\n  using FstMatcher = M;\n};\n\n// Specializes for StdArc to allow weight and label pushing.\ntemplate <>\nclass DefaultLookAhead<StdArc, MATCH_INPUT> {\n public:\n  using M = LookAheadMatcher<Fst<StdArc>>;\n  using SF = SequenceComposeFilter<M>;\n  using LF = LookAheadComposeFilter<SF, M>;\n  using WF = PushWeightsComposeFilter<LF, M>;\n  using ComposeFilter = PushLabelsComposeFilter<WF, M>;\n  using FstMatcher = M;\n};\n\n// Specializes for StdArc to allow weight and label pushing.\ntemplate <>\nclass DefaultLookAhead<StdArc, MATCH_OUTPUT> {\n public:\n  using M = LookAheadMatcher<Fst<StdArc>>;\n  using SF = AltSequenceComposeFilter<M>;\n  using LF = LookAheadComposeFilter<SF, M>;\n  using WF = PushWeightsComposeFilter<LF, M>;\n  using ComposeFilter = PushLabelsComposeFilter<WF, M>;\n  using FstMatcher = M;\n};\n\n// Specializes for LogArc to allow weight and label pushing.\ntemplate <>\nclass DefaultLookAhead<LogArc, MATCH_INPUT> {\n public:\n  using M = LookAheadMatcher<Fst<LogArc>>;\n  using SF = SequenceComposeFilter<M>;\n  using LF = LookAheadComposeFilter<SF, M>;\n  using WF = PushWeightsComposeFilter<LF, M>;\n  using ComposeFilter = PushLabelsComposeFilter<WF, M>;\n  using FstMatcher = M;\n};\n\n// Specializes for LogArc to allow weight and label pushing.\ntemplate <>\nclass DefaultLookAhead<LogArc, MATCH_OUTPUT> {\n public:\n  using M = LookAheadMatcher<Fst<LogArc>>;\n  using SF = AltSequenceComposeFilter<M>;\n  using LF = LookAheadComposeFilter<SF, M>;\n  using WF = PushWeightsComposeFilter<LF, M>;\n  using ComposeFilter = PushLabelsComposeFilter<WF, M>;\n  using FstMatcher = M;\n};\n\n}  // namespace fst\n\n#endif  // FST_LOOKAHEAD_FILTER_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/lookahead-matcher.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Classes to add lookahead to FST matchers, useful for improving composition\n// efficiency with certain inputs.\n\n#ifndef FST_LOOKAHEAD_MATCHER_H_\n#define FST_LOOKAHEAD_MATCHER_H_\n\n#include <memory>\n#include <utility>\n#include <vector>\n\n#include <fst/flags.h>\n#include <fst/log.h>\n\n#include <fst/add-on.h>\n#include <fst/const-fst.h>\n#include <fst/fst.h>\n#include <fst/label-reachable.h>\n#include <fst/matcher.h>\n\n\nDECLARE_string(save_relabel_ipairs);\nDECLARE_string(save_relabel_opairs);\n\nnamespace fst {\n\n// Lookahead matches extend the matcher interface with following additional\n// methods:\n//\n// template <class FST>\n// class LookAheadMatcher {\n//  public:\n//   using Arc = typename FST::Arc;\n//   using Label = typename Arc::Label;\n//   using StateId = typename Arc::StateId;\n//   using Weight = typename Arc::Weight;\n//\n//  // Required constructors.\n//  // This makes a copy of the FST.\n//  LookAheadMatcher(const FST &fst, MatchType match_type);\n//  // This doesn't copy the FST.\n//  LookAheadMatcher(const FST *fst, MatchType match_type);\n//  // This makes a copy of the FST.\n//  // See Copy() below.\n//  LookAheadMatcher(const LookAheadMatcher &matcher, bool safe = false);\n//\n//   // If safe = true, the copy is thread-safe (except the lookahead FST is\n//   // preserved). See Fst<>::Copy() for further doc.\n//   LookaheadMatcher<FST> *Copy(bool safe = false) const override;\n\n//  // Below are methods for looking ahead for a match to a label and more\n//  // generally, to a rational set. Each returns false if there is definitely\n//  // not a match and returns true if there possibly is a match.\n//\n//  // Optionally pre-specifies the lookahead FST that will be passed to\n//  // LookAheadFst() for possible precomputation. If copy is true, then the FST\n//  // argument is a copy of the FST used in the previous call to this method\n//  // (to avoid unnecessary updates).\n//  void InitLookAheadFst(const Fst<Arc> &fst, bool copy = false) override;\n//\n//  // Are there paths from a state in the lookahead FST that can be read from\n//  // the curent matcher state?\n//  bool LookAheadFst(const Fst<Arc> &fst, StateId s) override;\n//\n//  // Can the label be read from the current matcher state after possibly\n//  // following epsilon transitions?\n//  bool LookAheadLabel(Label label) const override;\n//\n//  // The following methods allow looking ahead for an arbitrary rational set\n//  // of strings, specified by an FST and a state from which to begin the\n//  // matching. If the lookahead FST is a transducer, this looks on the side\n//  // different from the matcher's match_type (cf. composition).\n//  // Is there is a single non-epsilon arc found in the lookahead FST that\n//  // begins the path (after possibly following any epsilons) in the last call\n//  // to LookAheadFst? If so, return true and copy it to the arc argument;\n//  // otherwise, return false. Non-trivial implementations are useful for\n//  // label-pushing in composition.\n//  bool LookAheadPrefix(Arc *arc) override;\n//\n//  // Gives an estimate of the combined weight of the paths in the lookahead\n//  // and matcher FSTs for the last call to LookAheadFst. Non-trivial\n//  // implementations are useful for weight-pushing in composition.\n//  Weight LookAheadWeight() const override;\n// };\n\n// Look-ahead flags.\n// Matcher is a lookahead matcher when match_type is MATCH_INPUT.\nconstexpr uint32 kInputLookAheadMatcher = 0x00000010;\n\n// Matcher is a lookahead matcher when match_type is MATCH_OUTPUT.\nconstexpr uint32 kOutputLookAheadMatcher = 0x00000020;\n\n// Is a non-trivial implementation of LookAheadWeight() method defined and\n// if so, should it be used?\nconstexpr uint32 kLookAheadWeight = 0x00000040;\n\n// Is a non-trivial implementation of LookAheadPrefix() method defined and\n// if so, should it be used?\nconstexpr uint32 kLookAheadPrefix = 0x00000080;\n\n// Look-ahead of matcher FST non-epsilon arcs?\nconstexpr uint32 kLookAheadNonEpsilons = 0x00000100;\n\n// Look-ahead of matcher FST epsilon arcs?\nconstexpr uint32 kLookAheadEpsilons = 0x00000200;\n\n// Ignore epsilon paths for the lookahead prefix? This gives correct results in\n// composition only with an appropriate composition filter since it depends on\n// the filter blocking the ignored paths.\nconstexpr uint32 kLookAheadNonEpsilonPrefix = 0x00000400;\n\n// For LabelLookAheadMatcher, save relabeling data to file?\nconstexpr uint32 kLookAheadKeepRelabelData = 0x00000800;\n\n// Flags used for lookahead matchers.\nconstexpr uint32 kLookAheadFlags = 0x00000ff0;\n\n// LookAhead Matcher interface, templated on the Arc definition; used\n// for lookahead matcher specializations that are returned by the\n// InitMatcher() Fst method.\ntemplate <class Arc>\nclass LookAheadMatcherBase : public MatcherBase<Arc> {\n public:\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  virtual void InitLookAheadFst(const Fst<Arc> &, bool copy = false) = 0;\n  virtual bool LookAheadFst(const Fst<Arc> &, StateId) = 0;\n  virtual bool LookAheadLabel(Label) const = 0;\n\n  // Suggested concrete implementation of lookahead methods.\n\n  bool LookAheadPrefix(Arc *arc) const {\n    if (prefix_arc_.nextstate != kNoStateId) {\n      *arc = prefix_arc_;\n      return true;\n    } else {\n      return false;\n    }\n  }\n\n  Weight LookAheadWeight() const { return weight_; }\n\n protected:\n  // Concrete implementations for lookahead helper methods.\n\n  void ClearLookAheadWeight() { weight_ = Weight::One(); }\n\n  void SetLookAheadWeight(Weight weight) { weight_ = std::move(weight); }\n\n  void ClearLookAheadPrefix() { prefix_arc_.nextstate = kNoStateId; }\n\n  void SetLookAheadPrefix(Arc arc) { prefix_arc_ = std::move(arc); }\n\n private:\n  Arc prefix_arc_;\n  Weight weight_;\n};\n\n// Doesn't actually lookahead, just declares that the future looks good.\ntemplate <class M>\nclass TrivialLookAheadMatcher\n    : public LookAheadMatcherBase<typename M::FST::Arc> {\n public:\n  using FST = typename M::FST;\n  using Arc = typename FST::Arc;\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  // This makes a copy of the FST.\n  TrivialLookAheadMatcher(const FST &fst, MatchType match_type)\n      : matcher_(fst, match_type) {}\n\n  // This doesn't copy the FST.\n  TrivialLookAheadMatcher(const FST *fst, MatchType match_type)\n      : matcher_(fst, match_type) {}\n\n  // This makes a copy of the FST.\n  TrivialLookAheadMatcher(const TrivialLookAheadMatcher<M> &lmatcher,\n                          bool safe = false)\n      : matcher_(lmatcher.matcher_, safe) {}\n\n  TrivialLookAheadMatcher<M> *Copy(bool safe = false) const override {\n    return new TrivialLookAheadMatcher<M>(*this, safe);\n  }\n\n  MatchType Type(bool test) const override { return matcher_.Type(test); }\n\n  void SetState(StateId s) final { return matcher_.SetState(s); }\n\n  bool Find(Label label) final { return matcher_.Find(label); }\n\n  bool Done() const final { return matcher_.Done(); }\n\n  const Arc &Value() const final { return matcher_.Value(); }\n\n  void Next() final { matcher_.Next(); }\n\n  Weight Final(StateId s) const final { return matcher_.Final(s); }\n\n  ssize_t Priority(StateId s) final { return matcher_.Priority(s); }\n\n  const FST &GetFst() const override { return matcher_.GetFst(); }\n\n  uint64 Properties(uint64 props) const override {\n    return matcher_.Properties(props);\n  }\n\n  uint32 Flags() const override {\n    return matcher_.Flags() | kInputLookAheadMatcher | kOutputLookAheadMatcher;\n  }\n\n  // Lookahead methods (all trivial).\n\n  void InitLookAheadFst(const Fst<Arc> &fst, bool copy = false) override {}\n\n  bool LookAheadFst(const Fst<Arc> &, StateId) final { return true; }\n\n  bool LookAheadLabel(Label) const final { return true; }\n\n  bool LookAheadPrefix(Arc *) const { return false; }\n\n  Weight LookAheadWeight() const { return Weight::One(); }\n\n private:\n  M matcher_;\n};\n\n// Look-ahead of one transition. Template argument flags accepts flags to\n// control behavior.\ntemplate <class M,\n          uint32 flags = kLookAheadNonEpsilons | kLookAheadEpsilons |\n                         kLookAheadWeight | kLookAheadPrefix>\nclass ArcLookAheadMatcher : public LookAheadMatcherBase<typename M::FST::Arc> {\n public:\n  using FST = typename M::FST;\n  using Arc = typename FST::Arc;\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n  using MatcherData = NullAddOn;\n\n  using LookAheadMatcherBase<Arc>::ClearLookAheadWeight;\n  using LookAheadMatcherBase<Arc>::LookAheadWeight;\n  using LookAheadMatcherBase<Arc>::SetLookAheadWeight;\n  using LookAheadMatcherBase<Arc>::ClearLookAheadPrefix;\n  using LookAheadMatcherBase<Arc>::LookAheadPrefix;\n  using LookAheadMatcherBase<Arc>::SetLookAheadPrefix;\n\n  enum : uint32 { kFlags = flags };\n\n  // This makes a copy of the FST.\n  ArcLookAheadMatcher(\n      const FST &fst, MatchType match_type,\n      std::shared_ptr<MatcherData> data = std::shared_ptr<MatcherData>())\n      : matcher_(fst, match_type),\n        fst_(matcher_.GetFst()),\n        lfst_(nullptr),\n        state_(kNoStateId) {}\n\n  // This doesn't copy the FST.\n  ArcLookAheadMatcher(\n      const FST *fst, MatchType match_type,\n      std::shared_ptr<MatcherData> data = std::shared_ptr<MatcherData>())\n      : matcher_(fst, match_type),\n        fst_(matcher_.GetFst()),\n        lfst_(nullptr),\n        state_(kNoStateId) {}\n\n  // This makes a copy of the FST.\n  ArcLookAheadMatcher(const ArcLookAheadMatcher<M, flags> &lmatcher,\n                      bool safe = false)\n      : matcher_(lmatcher.matcher_, safe),\n        fst_(matcher_.GetFst()),\n        lfst_(lmatcher.lfst_),\n        state_(kNoStateId) {}\n\n  // General matcher methods.\n  ArcLookAheadMatcher<M, flags> *Copy(bool safe = false) const override {\n    return new ArcLookAheadMatcher<M, flags>(*this, safe);\n  }\n\n  MatchType Type(bool test) const override { return matcher_.Type(test); }\n\n  void SetState(StateId s) final {\n    state_ = s;\n    matcher_.SetState(s);\n  }\n\n  bool Find(Label label) final { return matcher_.Find(label); }\n\n  bool Done() const final { return matcher_.Done(); }\n\n  const Arc &Value() const final { return matcher_.Value(); }\n\n  void Next() final { matcher_.Next(); }\n\n  Weight Final(StateId s) const final { return matcher_.Final(s); }\n\n  ssize_t Priority(StateId s) final { return matcher_.Priority(s); }\n\n  const FST &GetFst() const override { return fst_; }\n\n  uint64 Properties(uint64 props) const override {\n    return matcher_.Properties(props);\n  }\n\n  uint32 Flags() const override {\n    return matcher_.Flags() | kInputLookAheadMatcher | kOutputLookAheadMatcher |\n           kFlags;\n  }\n\n  const MatcherData *GetData() const { return nullptr; }\n\n  std::shared_ptr<MatcherData> GetSharedData() const {\n    return std::shared_ptr<MatcherData>();\n  }\n\n  // Look-ahead methods.\n\n  void InitLookAheadFst(const Fst<Arc> &fst, bool copy = false) override {\n    lfst_ = &fst;\n  }\n\n  // Checks if there is a matching (possibly super-final) transition\n  // at (state_, s).\n  bool LookAheadFst(const Fst<Arc> &, StateId) final;\n\n  bool LookAheadLabel(Label label) const final { return matcher_.Find(label); }\n\n private:\n  mutable M matcher_;\n  const FST &fst_;        // Matcher FST.\n  const Fst<Arc> *lfst_;  // Look-ahead FST.\n  StateId state_;         // Matcher state.\n};\n\ntemplate <class M, uint32 flags>\nbool ArcLookAheadMatcher<M, flags>::LookAheadFst(const Fst<Arc> &fst,\n                                                 StateId s) {\n  if (&fst != lfst_) InitLookAheadFst(fst);\n  bool result = false;\n  ssize_t nprefix = 0;\n  if (kFlags & kLookAheadWeight) ClearLookAheadWeight();\n  if (kFlags & kLookAheadPrefix) ClearLookAheadPrefix();\n  if (fst_.Final(state_) != Weight::Zero() &&\n      lfst_->Final(s) != Weight::Zero()) {\n    if (!(kFlags & (kLookAheadWeight | kLookAheadPrefix))) return true;\n    ++nprefix;\n    if (kFlags & kLookAheadWeight) {\n      SetLookAheadWeight(\n          Plus(LookAheadWeight(), Times(fst_.Final(state_), lfst_->Final(s))));\n    }\n    result = true;\n  }\n  if (matcher_.Find(kNoLabel)) {\n    if (!(kFlags & (kLookAheadWeight | kLookAheadPrefix))) return true;\n    ++nprefix;\n    if (kFlags & kLookAheadWeight) {\n      for (; !matcher_.Done(); matcher_.Next()) {\n        SetLookAheadWeight(Plus(LookAheadWeight(), matcher_.Value().weight));\n      }\n    }\n    result = true;\n  }\n  for (ArcIterator<Fst<Arc>> aiter(*lfst_, s); !aiter.Done(); aiter.Next()) {\n    const auto &arc = aiter.Value();\n    Label label = kNoLabel;\n    switch (matcher_.Type(false)) {\n      case MATCH_INPUT:\n        label = arc.olabel;\n        break;\n      case MATCH_OUTPUT:\n        label = arc.ilabel;\n        break;\n      default:\n        FSTERROR() << \"ArcLookAheadMatcher::LookAheadFst: Bad match type\";\n        return true;\n    }\n    if (label == 0) {\n      if (!(kFlags & (kLookAheadWeight | kLookAheadPrefix))) return true;\n      if (!(kFlags & kLookAheadNonEpsilonPrefix)) ++nprefix;\n      if (kFlags & kLookAheadWeight) {\n        SetLookAheadWeight(Plus(LookAheadWeight(), arc.weight));\n      }\n      result = true;\n    } else if (matcher_.Find(label)) {\n      if (!(kFlags & (kLookAheadWeight | kLookAheadPrefix))) return true;\n      for (; !matcher_.Done(); matcher_.Next()) {\n        ++nprefix;\n        if (kFlags & kLookAheadWeight) {\n          SetLookAheadWeight(Plus(LookAheadWeight(),\n                                  Times(arc.weight, matcher_.Value().weight)));\n        }\n        if ((kFlags & kLookAheadPrefix) && nprefix == 1)\n          SetLookAheadPrefix(arc);\n      }\n      result = true;\n    }\n  }\n  if (kFlags & kLookAheadPrefix) {\n    if (nprefix == 1) {\n      ClearLookAheadWeight();  // Avoids double counting.\n    } else {\n      ClearLookAheadPrefix();\n    }\n  }\n  return result;\n}\n\n// Template argument flags accepts flags to control behavior. It must include\n// precisely one of kInputLookAheadMatcher or kOutputLookAheadMatcher.\ntemplate <class M,\n          uint32 flags = kLookAheadEpsilons | kLookAheadWeight |\n                         kLookAheadPrefix | kLookAheadNonEpsilonPrefix |\n                         kLookAheadKeepRelabelData,\n          class Accumulator = DefaultAccumulator<typename M::Arc>,\n          class Reachable = LabelReachable<typename M::Arc, Accumulator>>\nclass LabelLookAheadMatcher\n    : public LookAheadMatcherBase<typename M::FST::Arc> {\n public:\n  using FST = typename M::FST;\n  using Arc = typename FST::Arc;\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n  using MatcherData = typename Reachable::Data;\n\n  using LookAheadMatcherBase<Arc>::ClearLookAheadWeight;\n  using LookAheadMatcherBase<Arc>::LookAheadWeight;\n  using LookAheadMatcherBase<Arc>::SetLookAheadWeight;\n  using LookAheadMatcherBase<Arc>::ClearLookAheadPrefix;\n  using LookAheadMatcherBase<Arc>::LookAheadPrefix;\n  using LookAheadMatcherBase<Arc>::SetLookAheadPrefix;\n\n  enum : uint32 { kFlags = flags };\n\n  // This makes a copy of the FST.\n  LabelLookAheadMatcher(\n      const FST &fst, MatchType match_type,\n      std::shared_ptr<MatcherData> data = std::shared_ptr<MatcherData>(),\n      Accumulator *accumulator = nullptr)\n      : matcher_(fst, match_type),\n        lfst_(nullptr),\n        state_(kNoStateId),\n        error_(false) {\n    Init(fst, match_type, data, accumulator);\n  }\n\n  // This doesn't copy the FST.\n  LabelLookAheadMatcher(\n      const FST *fst, MatchType match_type,\n      std::shared_ptr<MatcherData> data = std::shared_ptr<MatcherData>(),\n      Accumulator *accumulator = nullptr)\n      : matcher_(fst, match_type),\n        lfst_(nullptr),\n        state_(kNoStateId),\n        error_(false) {\n    Init(*fst, match_type, data, accumulator);\n  }\n\n  // This makes a copy of the FST.\n  LabelLookAheadMatcher(\n      const LabelLookAheadMatcher<M, flags, Accumulator, Reachable> &lmatcher,\n      bool safe = false)\n      : matcher_(lmatcher.matcher_, safe),\n        lfst_(lmatcher.lfst_),\n        label_reachable_(lmatcher.label_reachable_\n                             ? new Reachable(*lmatcher.label_reachable_, safe)\n                             : nullptr),\n        state_(kNoStateId),\n        error_(lmatcher.error_) {}\n\n  LabelLookAheadMatcher<M, flags, Accumulator, Reachable> *Copy(\n      bool safe = false) const override {\n    return new LabelLookAheadMatcher<M, flags, Accumulator, Reachable>(*this,\n                                                                       safe);\n  }\n\n  MatchType Type(bool test) const override { return matcher_.Type(test); }\n\n  void SetState(StateId s) final {\n    if (state_ == s) return;\n    state_ = s;\n    match_set_state_ = false;\n    reach_set_state_ = false;\n  }\n\n  bool Find(Label label) final {\n    if (!match_set_state_) {\n      matcher_.SetState(state_);\n      match_set_state_ = true;\n    }\n    return matcher_.Find(label);\n  }\n\n  bool Done() const final { return matcher_.Done(); }\n\n  const Arc &Value() const final { return matcher_.Value(); }\n\n  void Next() final { matcher_.Next(); }\n\n  Weight Final(StateId s) const final { return matcher_.Final(s); }\n\n  ssize_t Priority(StateId s) final { return matcher_.Priority(s); }\n\n  const FST &GetFst() const override { return matcher_.GetFst(); }\n\n  uint64 Properties(uint64 inprops) const override {\n    auto outprops = matcher_.Properties(inprops);\n    if (error_ || (label_reachable_ && label_reachable_->Error())) {\n      outprops |= kError;\n    }\n    return outprops;\n  }\n\n  uint32 Flags() const override {\n    if (label_reachable_ && label_reachable_->GetData()->ReachInput()) {\n      return matcher_.Flags() | kFlags | kInputLookAheadMatcher;\n    } else if (label_reachable_ && !label_reachable_->GetData()->ReachInput()) {\n      return matcher_.Flags() | kFlags | kOutputLookAheadMatcher;\n    } else {\n      return matcher_.Flags();\n    }\n  }\n\n  const MatcherData *GetData() const {\n    return label_reachable_ ? label_reachable_->GetData() : nullptr;\n  };\n\n  std::shared_ptr<MatcherData> GetSharedData() const {\n    return label_reachable_ ? label_reachable_->GetSharedData()\n                            : std::shared_ptr<MatcherData>();\n  }\n  // Checks if there is a matching (possibly super-final) transition at\n  // (state_, s).\n  template <class LFST>\n  bool LookAheadFst(const LFST &fst, StateId s);\n\n  // Required to make class concrete.\n  bool LookAheadFst(const Fst<Arc> &fst, StateId s) final {\n    return LookAheadFst<Fst<Arc>>(fst, s);\n  }\n\n  void InitLookAheadFst(const Fst<Arc> &fst, bool copy = false) override {\n    lfst_ = &fst;\n    if (label_reachable_) {\n      const bool reach_input = Type(false) == MATCH_OUTPUT;\n      label_reachable_->ReachInit(fst, reach_input, copy);\n    }\n  }\n\n  template <class LFST>\n  void InitLookAheadFst(const LFST &fst, bool copy = false) {\n    lfst_ = static_cast<const Fst<Arc> *>(&fst);\n    if (label_reachable_) {\n      const bool reach_input = Type(false) == MATCH_OUTPUT;\n      label_reachable_->ReachInit(fst, reach_input, copy);\n    }\n  }\n\n  bool LookAheadLabel(Label label) const final {\n    if (label == 0) return true;\n    if (label_reachable_) {\n      if (!reach_set_state_) {\n        label_reachable_->SetState(state_);\n        reach_set_state_ = true;\n      }\n      return label_reachable_->Reach(label);\n    } else {\n      return true;\n    }\n  }\n\n private:\n  void Init(const FST &fst, MatchType match_type,\n            std::shared_ptr<MatcherData> data,\n            Accumulator *accumulator) {\n    if (!(kFlags & (kInputLookAheadMatcher | kOutputLookAheadMatcher))) {\n      FSTERROR() << \"LabelLookaheadMatcher: Bad matcher flags: \" << kFlags;\n      error_ = true;\n    }\n    const bool reach_input = match_type == MATCH_INPUT;\n    if (data) {\n      if (reach_input == data->ReachInput()) {\n        label_reachable_.reset(new Reachable(data, accumulator));\n      }\n    } else if ((reach_input && (kFlags & kInputLookAheadMatcher)) ||\n               (!reach_input && (kFlags & kOutputLookAheadMatcher))) {\n      label_reachable_.reset(new Reachable(fst, reach_input, accumulator,\n                                           kFlags & kLookAheadKeepRelabelData));\n    }\n  }\n\n  mutable M matcher_;\n  const Fst<Arc> *lfst_;                        // Look-ahead FST.\n  std::unique_ptr<Reachable> label_reachable_;  // Label reachability info.\n  StateId state_;                               // Matcher state.\n  bool match_set_state_;                        // matcher_.SetState called?\n  mutable bool reach_set_state_;                // reachable_.SetState called?\n  bool error_;                                  // Error encountered?\n};\n\ntemplate <class M, uint32 flags, class Accumulator, class Reachable>\ntemplate <class LFST>\ninline bool LabelLookAheadMatcher<M, flags, Accumulator,\n                                  Reachable>::LookAheadFst(const LFST &fst,\n                                                           StateId s) {\n  if (static_cast<const Fst<Arc> *>(&fst) != lfst_) InitLookAheadFst(fst);\n  ClearLookAheadWeight();\n  ClearLookAheadPrefix();\n  if (!label_reachable_) return true;\n  label_reachable_->SetState(state_, s);\n  reach_set_state_ = true;\n  bool compute_weight = kFlags & kLookAheadWeight;\n  bool compute_prefix = kFlags & kLookAheadPrefix;\n  ArcIterator<LFST> aiter(fst, s);\n  aiter.SetFlags(kArcNoCache, kArcNoCache);  // Makes caching optional.\n  const bool reach_arc = label_reachable_->Reach(\n      &aiter, 0, internal::NumArcs(*lfst_, s), compute_weight);\n  const auto lfinal = internal::Final(*lfst_, s);\n  const bool reach_final =\n      lfinal != Weight::Zero() && label_reachable_->ReachFinal();\n  if (reach_arc) {\n    const auto begin = label_reachable_->ReachBegin();\n    const auto end = label_reachable_->ReachEnd();\n    if (compute_prefix && end - begin == 1 && !reach_final) {\n      aiter.Seek(begin);\n      SetLookAheadPrefix(aiter.Value());\n      compute_weight = false;\n    } else if (compute_weight) {\n      SetLookAheadWeight(label_reachable_->ReachWeight());\n    }\n  }\n  if (reach_final && compute_weight) {\n    SetLookAheadWeight(reach_arc ? Plus(LookAheadWeight(), lfinal) : lfinal);\n  }\n  return reach_arc || reach_final;\n}\n\n// Label-lookahead relabeling class.\ntemplate <class Arc, class Data = LabelReachableData<typename Arc::Label>>\nclass LabelLookAheadRelabeler {\n public:\n  using Label = typename Arc::Label;\n  using Reachable = LabelReachable<Arc, DefaultAccumulator<Arc>, Data>;\n\n  // Relabels matcher FST (initialization function object).\n  template <typename Impl>\n  explicit LabelLookAheadRelabeler(std::shared_ptr<Impl> *impl);\n\n  // Relabels arbitrary FST. Class LFST should be a label-lookahead FST.\n  template <class LFST>\n  static void Relabel(MutableFst<Arc> *fst, const LFST &mfst,\n                      bool relabel_input) {\n    const auto *data = mfst.GetAddOn();\n    Reachable reachable(data->First() ? data->SharedFirst()\n                                      : data->SharedSecond());\n    reachable.Relabel(fst, relabel_input);\n  }\n\n  // Returns relabeling pairs (cf. relabel.h::Relabel()). Class LFST should be a\n  // label-lookahead FST. If avoid_collisions is true, extra pairs are added to\n  // ensure no collisions when relabeling automata that have labels unseen here.\n  template <class LFST>\n  static void RelabelPairs(const LFST &mfst,\n                           std::vector<std::pair<Label, Label>> *pairs,\n                           bool avoid_collisions = false) {\n    const auto *data = mfst.GetAddOn();\n    Reachable reachable(data->First() ? data->SharedFirst()\n                                      : data->SharedSecond());\n    reachable.RelabelPairs(pairs, avoid_collisions);\n  }\n};\n\ntemplate <class Arc, class Data>\ntemplate <typename Impl>\ninline LabelLookAheadRelabeler<Arc, Data>::LabelLookAheadRelabeler(\n    std::shared_ptr<Impl> *impl) {\n  Fst<Arc> &fst = (*impl)->GetFst();\n  auto data = (*impl)->GetSharedAddOn();\n  const auto name = (*impl)->Type();\n  const bool is_mutable = fst.Properties(kMutable, false);\n  std::unique_ptr<MutableFst<Arc>> mfst;\n  if (is_mutable) {\n    mfst.reset(static_cast<MutableFst<Arc> *>(&fst));\n  } else {\n    mfst.reset(new VectorFst<Arc>(fst));\n  }\n  if (data->First()) {  // reach_input.\n    Reachable reachable(data->SharedFirst());\n    reachable.Relabel(mfst.get(), true);\n    if (!FLAGS_save_relabel_ipairs.empty()) {\n      std::vector<std::pair<Label, Label>> pairs;\n      reachable.RelabelPairs(&pairs, true);\n      WriteLabelPairs(FLAGS_save_relabel_ipairs, pairs);\n    }\n  } else {\n    Reachable reachable(data->SharedSecond());\n    reachable.Relabel(mfst.get(), false);\n    if (!FLAGS_save_relabel_opairs.empty()) {\n      std::vector<std::pair<Label, Label>> pairs;\n      reachable.RelabelPairs(&pairs, true);\n      WriteLabelPairs(FLAGS_save_relabel_opairs, pairs);\n    }\n  }\n  if (!is_mutable) {\n    *impl = std::make_shared<Impl>(*mfst, name);\n    (*impl)->SetAddOn(data);\n  }\n}\n\n// Generic lookahead matcher, templated on the FST definition (a wrapper around\n// a pointer to specific one).\ntemplate <class F>\nclass LookAheadMatcher {\n public:\n  using FST = F;\n  using Arc = typename FST::Arc;\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n  using LBase = LookAheadMatcherBase<Arc>;\n\n  // This makes a copy of the FST.\n  LookAheadMatcher(const FST &fst, MatchType match_type)\n      : owned_fst_(fst.Copy()),\n        base_(owned_fst_->InitMatcher(match_type)),\n        lookahead_(false) {\n    if (!base_) base_.reset(new SortedMatcher<FST>(owned_fst_.get(),\n                                                   match_type));\n  }\n\n  // This doesn't copy the FST.\n  LookAheadMatcher(const FST *fst, MatchType match_type)\n      : base_(fst->InitMatcher(match_type)),\n        lookahead_(false) {\n    if (!base_) base_.reset(new SortedMatcher<FST>(fst, match_type));\n  }\n\n  // This makes a copy of the FST.\n  LookAheadMatcher(const LookAheadMatcher<FST> &matcher, bool safe = false)\n      : base_(matcher.base_->Copy(safe)),\n        lookahead_(matcher.lookahead_) { }\n\n  // Takes ownership of base.\n  explicit LookAheadMatcher(MatcherBase<Arc> *base)\n      : base_(base), lookahead_(false) {}\n\n  LookAheadMatcher<FST> *Copy(bool safe = false) const {\n    return new LookAheadMatcher<FST>(*this, safe);\n  }\n\n  MatchType Type(bool test) const { return base_->Type(test); }\n\n  void SetState(StateId s) { base_->SetState(s); }\n\n  bool Find(Label label) { return base_->Find(label); }\n\n  bool Done() const { return base_->Done(); }\n\n  const Arc &Value() const { return base_->Value(); }\n\n  void Next() { base_->Next(); }\n\n  Weight Final(StateId s) const { return base_->Final(s); }\n\n  ssize_t Priority(StateId s) { return base_->Priority(s); }\n\n  const FST &GetFst() const {\n    return static_cast<const FST &>(base_->GetFst());\n  }\n\n  uint64 Properties(uint64 props) const { return base_->Properties(props); }\n\n  uint32 Flags() const { return base_->Flags(); }\n\n  bool LookAheadLabel(Label label) const {\n    if (LookAheadCheck()) {\n      return static_cast<LBase *>(base_.get())->LookAheadLabel(label);\n    } else {\n      return true;\n    }\n  }\n\n  bool LookAheadFst(const Fst<Arc> &fst, StateId s) {\n    if (LookAheadCheck()) {\n      return static_cast<LBase *>(base_.get())->LookAheadFst(fst, s);\n    } else {\n      return true;\n    }\n  }\n\n  Weight LookAheadWeight() const {\n    if (LookAheadCheck()) {\n      return static_cast<LBase *>(base_.get())->LookAheadWeight();\n    } else {\n      return Weight::One();\n    }\n  }\n\n  bool LookAheadPrefix(Arc *arc) const {\n    if (LookAheadCheck()) {\n      return static_cast<LBase *>(base_.get())->LookAheadPrefix(arc);\n    } else {\n      return false;\n    }\n  }\n\n  void InitLookAheadFst(const Fst<Arc> &fst, bool copy = false) {\n    if (LookAheadCheck()) {\n      static_cast<LBase *>(base_.get())->InitLookAheadFst(fst, copy);\n    }\n  }\n\n private:\n  bool LookAheadCheck() const {\n    if (!lookahead_) {\n      lookahead_ =\n          base_->Flags() & (kInputLookAheadMatcher | kOutputLookAheadMatcher);\n      if (!lookahead_) {\n        FSTERROR() << \"LookAheadMatcher: No look-ahead matcher defined\";\n      }\n    }\n    return lookahead_;\n  }\n\n  std::unique_ptr<const FST> owned_fst_;\n  std::unique_ptr<MatcherBase<Arc>> base_;\n  mutable bool lookahead_;\n\n  LookAheadMatcher &operator=(const LookAheadMatcher &) = delete;\n};\n\n}  // namespace fst\n\n#endif  // FST_LOOKAHEAD_MATCHER_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/map.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Compatibility file for old-style Map() functions and MapFst class that have\n// been renamed to ArcMap (cf. StateMap).\n\n#ifndef FST_MAP_H_\n#define FST_MAP_H_\n\n\n#include <fst/arc-map.h>\n\n\nnamespace fst {\n\ntemplate <class A, class C>\nvoid Map(MutableFst<A> *fst, C *mapper) {\n  ArcMap(fst, mapper);\n}\n\ntemplate <class A, class C>\nvoid Map(MutableFst<A> *fst, C mapper) {\n  ArcMap(fst, mapper);\n}\n\ntemplate <class A, class B, class C>\nvoid Map(const Fst<A> &ifst, MutableFst<B> *ofst, C *mapper) {\n  ArcMap(ifst, ofst, mapper);\n}\n\ntemplate <class A, class B, class C>\nvoid Map(const Fst<A> &ifst, MutableFst<B> *ofst, C mapper) {\n  ArcMap(ifst, ofst, mapper);\n}\n\nusing MapFstOptions = ArcMapFstOptions;\n\ntemplate <class A, class B, class C>\nclass MapFst : public ArcMapFst<A, B, C> {\n public:\n  using FromArc = A;\n  using ToArc = B;\n\n  using StateId = typename ToArc::StateId;\n  using Weight = typename ToArc::Weight;\n\n  using State = CacheState<B>;\n\n  MapFst(const Fst<A> &fst, const C &mapper, const MapFstOptions &opts)\n      : ArcMapFst<A, B, C>(fst, mapper, opts) {}\n\n  MapFst(const Fst<A> &fst, C *mapper, const MapFstOptions &opts)\n      : ArcMapFst<A, B, C>(fst, mapper, opts) {}\n\n  MapFst(const Fst<A> &fst, const C &mapper)\n      : ArcMapFst<A, B, C>(fst, mapper) {}\n\n  MapFst(const Fst<A> &fst, C *mapper) : ArcMapFst<A, B, C>(fst, mapper) {}\n\n  // See Fst<>::Copy() for doc.\n  MapFst(const MapFst<A, B, C> &fst, bool safe = false)\n      : ArcMapFst<A, B, C>(fst, safe) {}\n\n  // Get a copy of this MapFst. See Fst<>::Copy() for further doc.\n  MapFst<A, B, C> *Copy(bool safe = false) const override {\n    return new MapFst(*this, safe);\n  }\n};\n\n// Specialization for MapFst.\ntemplate <class A, class B, class C>\nclass StateIterator<MapFst<A, B, C>>\n    : public StateIterator<ArcMapFst<A, B, C>> {\n public:\n  explicit StateIterator(const ArcMapFst<A, B, C> &fst)\n      : StateIterator<ArcMapFst<A, B, C>>(fst) {}\n};\n\n// Specialization for MapFst.\ntemplate <class A, class B, class C>\nclass ArcIterator<MapFst<A, B, C>> : public ArcIterator<ArcMapFst<A, B, C>> {\n public:\n  ArcIterator(const ArcMapFst<A, B, C> &fst, typename A::StateId s)\n      : ArcIterator<ArcMapFst<A, B, C>>(fst, s) {}\n};\n\n// For backwards compatibility only; use IdentityArcMapper otherwise.\ntemplate <class A>\nstruct IdentityMapper {\n  using FromArc = A;\n  using ToArc = A;\n\n  ToArc operator()(const FromArc &arc) const { return arc; }\n\n  constexpr MapFinalAction FinalAction() const { return MAP_NO_SUPERFINAL; }\n\n  constexpr MapSymbolsAction InputSymbolsAction() const {\n    return MAP_COPY_SYMBOLS;\n  }\n\n  constexpr MapSymbolsAction OutputSymbolsAction() const {\n    return MAP_COPY_SYMBOLS;\n  }\n\n  uint64 Properties(uint64 props) const { return props; }\n};\n\n}  // namespace fst\n\n#endif  // FST_MAP_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/mapped-file.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#ifndef FST_MAPPED_FILE_H_\n#define FST_MAPPED_FILE_H_\n\n#include <cstddef>\n#include <istream>\n#include <string>\n\n#include <fst/compat.h>\n#include <fst/flags.h>\n\nnamespace fst {\n\n// A memory region is a simple abstraction for allocated memory or data from\n// memory-mapped files. If mmap is null, then data represents an owned region\n// of size bytes. Otherwise, mmap and size refer to the mapping and data is a\n// casted pointer to a region contained within [mmap, mmap + size). If size is\n// 0, then mmap and data refer to a block of memory managed externally by some\n// other allocator. The offset is used when allocating memory to providing\n// padding for alignment.\nstruct MemoryRegion {\n  void *data;\n  void *mmap;\n  size_t size;\n  int offset;\n};\n\nclass MappedFile {\n public:\n  ~MappedFile();\n\n  void *mutable_data() const { return region_.data; }\n\n  const void *data() const { return region_.data; }\n\n  // Returns a MappedFile object that contains the contents of the input stream\n  // strm starting from the current file position with size bytes. The memorymap\n  // bool is advisory, and Map will default to allocating and reading. The\n  // source argument needs to contain the filename that was used to open the\n  // input stream.\n  static MappedFile *Map(std::istream *istrm, bool memorymap,\n                         const string &source, size_t size);\n\n  // Creates a MappedFile object with a new[]'ed block of memory of size. The\n  // align argument can be used to specify a desired block alignment.\n  // This is RECOMMENDED FOR INTERNAL USE ONLY as it may change in future\n  // releases.\n  static MappedFile *Allocate(size_t size, int align = kArchAlignment);\n\n  // Creates a MappedFile object pointing to a borrowed reference to data. This\n  // block of memory is not owned by the MappedFile object and will not be\n  // freed. This is RECOMMENDED FOR INTERNAL USE ONLY, may change in future\n  // releases.\n  static MappedFile *Borrow(void *data);\n\n  // Alignment required for mapping structures in bytes. Regions of memory that\n  // are not aligned upon a 128-bit boundary are read from the file instead.\n  // This is consistent with the alignment boundary set in ConstFst and\n  // CompactFst.\n  static constexpr int kArchAlignment = 16;\n\n  static constexpr size_t kMaxReadChunk = 256 * 1024 * 1024;  // 256 MB.\n\n private:\n  explicit MappedFile(const MemoryRegion &region);\n\n  MemoryRegion region_;\n  MappedFile(const MappedFile &) = delete;\n  MappedFile &operator=(const MappedFile &) = delete;\n};\n}  // namespace fst\n\n#endif  // FST_MAPPED_FILE_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/matcher-fst.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Class to add a matcher to an FST.\n\n#ifndef FST_MATCHER_FST_H_\n#define FST_MATCHER_FST_H_\n\n#include <memory>\n#include <string>\n\n#include <fst/add-on.h>\n#include <fst/const-fst.h>\n#include <fst/lookahead-matcher.h>\n\n\nnamespace fst {\n\n// Writeable matchers have the same interface as Matchers (as defined in\n// matcher.h) along with the following additional methods:\n//\n// template <class F>\n// class Matcher {\n//  public:\n//   using FST = F;\n//   ...\n//   using MatcherData = ...;   // Initialization data.\n//\n//   // Constructor with additional argument for external initialization data;\n//   // matcher increments its reference count on construction and decrements\n//   // the reference count, and deletes once the reference count has reached\n//   // zero.\n//   Matcher(const FST &fst, MatchType type, MatcherData *data);\n//\n//   // Returns pointer to initialization data that can be passed to a Matcher\n//   // constructor.\n//   MatcherData *GetData() const;\n// };\n\n// The matcher initialization data class must also provide the following\n// interface:\n//\n// class MatcherData {\n// public:\n//   // Required copy constructor.\n//   MatcherData(const MatcherData &);\n//\n//   // Required I/O methods.\n//   static MatcherData *Read(std::istream &istrm, const FstReadOptions &opts);\n//   bool Write(std::ostream &ostrm, const FstWriteOptions &opts) const;\n// };\n\n// Trivial (no-op) MatcherFst initializer functor.\ntemplate <class M>\nclass NullMatcherFstInit {\n public:\n  using MatcherData = typename M::MatcherData;\n  using Data = AddOnPair<MatcherData, MatcherData>;\n  using Impl = internal::AddOnImpl<typename M::FST, Data>;\n\n  explicit NullMatcherFstInit(std::shared_ptr<Impl> *) {}\n};\n\n// Class adding a matcher to an FST type. Creates a new FST whose name is given\n// by N. An optional functor Init can be used to initialize the FST. The Data\n// template parameter allows the user to select the type of the add-on.\ntemplate <\n    class F, class M, const char *Name, class Init = NullMatcherFstInit<M>,\n    class Data = AddOnPair<typename M::MatcherData, typename M::MatcherData>>\nclass MatcherFst : public ImplToExpandedFst<internal::AddOnImpl<F, Data>> {\n public:\n  using FST = F;\n  using Arc = typename FST::Arc;\n  using StateId = typename Arc::StateId;\n\n  using FstMatcher = M;\n  using MatcherData = typename FstMatcher::MatcherData;\n\n  using Impl = internal::AddOnImpl<FST, Data>;\n  using D = Data;\n\n  friend class StateIterator<MatcherFst<FST, FstMatcher, Name, Init, Data>>;\n  friend class ArcIterator<MatcherFst<FST, FstMatcher, Name, Init, Data>>;\n\n  MatcherFst() : ImplToExpandedFst<Impl>(std::make_shared<Impl>(FST(), Name)) {}\n\n  explicit MatcherFst(const FST &fst, std::shared_ptr<Data> data = nullptr)\n      : ImplToExpandedFst<Impl>(data ? CreateImpl(fst, Name, data)\n                                     : CreateDataAndImpl(fst, Name)) {}\n\n  explicit MatcherFst(const Fst<Arc> &fst)\n      : ImplToExpandedFst<Impl>(CreateDataAndImpl(fst, Name)) {}\n\n  // See Fst<>::Copy() for doc.\n  MatcherFst(const MatcherFst<FST, FstMatcher, Name, Init, Data> &fst,\n             bool safe = false)\n      : ImplToExpandedFst<Impl>(fst, safe) {}\n\n  // Get a copy of this MatcherFst. See Fst<>::Copy() for further doc.\n  MatcherFst<FST, FstMatcher, Name, Init, Data> *Copy(\n      bool safe = false) const override {\n    return new MatcherFst<FST, FstMatcher, Name, Init, Data>(*this, safe);\n  }\n\n  // Read a MatcherFst from an input stream; return nullptr on error\n  static MatcherFst<FST, M, Name, Init, Data> *Read(\n      std::istream &strm, const FstReadOptions &opts) {\n    auto *impl = Impl::Read(strm, opts);\n    return impl ? new MatcherFst<FST, FstMatcher, Name, Init, Data>(\n                      std::shared_ptr<Impl>(impl))\n                : nullptr;\n  }\n\n  // Read a MatcherFst from a file; return nullptr on error\n  // Empty filename reads from standard input\n  static MatcherFst<FST, FstMatcher, Name, Init, Data> *Read(\n      const string &filename) {\n    auto *impl = ImplToExpandedFst<Impl>::Read(filename);\n    return impl ? new MatcherFst<FST, FstMatcher, Name, Init, Data>(\n                      std::shared_ptr<Impl>(impl))\n                : nullptr;\n  }\n\n  bool Write(std::ostream &strm, const FstWriteOptions &opts) const override {\n    return GetImpl()->Write(strm, opts);\n  }\n\n  bool Write(const string &filename) const override {\n    return Fst<Arc>::WriteFile(filename);\n  }\n\n  void InitStateIterator(StateIteratorData<Arc> *data) const override {\n    return GetImpl()->InitStateIterator(data);\n  }\n\n  void InitArcIterator(StateId s, ArcIteratorData<Arc> *data) const override {\n    return GetImpl()->InitArcIterator(s, data);\n  }\n\n  FstMatcher *InitMatcher(MatchType match_type) const override {\n    return new FstMatcher(&GetFst(), match_type, GetSharedData(match_type));\n  }\n\n  const FST &GetFst() const { return GetImpl()->GetFst(); }\n\n  const Data *GetAddOn() const { return GetImpl()->GetAddOn(); }\n\n  std::shared_ptr<Data> GetSharedAddOn() const {\n    return GetImpl()->GetSharedAddOn();\n  }\n\n  const MatcherData *GetData(MatchType match_type) const {\n    const auto *data = GetAddOn();\n    return match_type == MATCH_INPUT ? data->First() : data->Second();\n  }\n\n  std::shared_ptr<MatcherData> GetSharedData(MatchType match_type) const {\n    const auto *data = GetAddOn();\n    return match_type == MATCH_INPUT ? data->SharedFirst()\n                                     : data->SharedSecond();\n  }\n\n protected:\n  using ImplToFst<Impl, ExpandedFst<Arc>>::GetImpl;\n\n  static std::shared_ptr<Impl> CreateDataAndImpl(const FST &fst,\n                                                 const string &name) {\n    FstMatcher imatcher(fst, MATCH_INPUT);\n    FstMatcher omatcher(fst, MATCH_OUTPUT);\n    return CreateImpl(fst, name,\n                      std::make_shared<Data>(imatcher.GetSharedData(),\n                                             omatcher.GetSharedData()));\n  }\n\n  static std::shared_ptr<Impl> CreateDataAndImpl(const Fst<Arc> &fst,\n                                                 const string &name) {\n    FST result(fst);\n    return CreateDataAndImpl(result, name);\n  }\n\n  static std::shared_ptr<Impl> CreateImpl(const FST &fst, const string &name,\n                                          std::shared_ptr<Data> data) {\n    auto impl = std::make_shared<Impl>(fst, name);\n    impl->SetAddOn(data);\n    Init init(&impl);\n    return impl;\n  }\n\n  explicit MatcherFst(std::shared_ptr<Impl> impl)\n      : ImplToExpandedFst<Impl>(impl) {}\n\n private:\n  MatcherFst &operator=(const MatcherFst &) = delete;\n};\n\n// Specialization for MatcherFst.\ntemplate <class FST, class M, const char *Name, class Init>\nclass StateIterator<MatcherFst<FST, M, Name, Init>>\n    : public StateIterator<FST> {\n public:\n  explicit StateIterator(const MatcherFst<FST, M, Name, Init> &fst)\n      : StateIterator<FST>(fst.GetImpl()->GetFst()) {}\n};\n\n// Specialization for MatcherFst.\ntemplate <class FST, class M, const char *Name, class Init>\nclass ArcIterator<MatcherFst<FST, M, Name, Init>> : public ArcIterator<FST> {\n public:\n  using StateId = typename FST::Arc::StateId;\n\n  ArcIterator(const MatcherFst<FST, M, Name, Init> &fst,\n              typename FST::Arc::StateId s)\n      : ArcIterator<FST>(fst.GetImpl()->GetFst(), s) {}\n};\n\n// Specialization for MatcherFst.\ntemplate <class F, class M, const char *Name, class Init>\nclass Matcher<MatcherFst<F, M, Name, Init>> {\n public:\n  using FST = MatcherFst<F, M, Name, Init>;\n  using Arc = typename F::Arc;\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n\n  Matcher(const FST &fst, MatchType match_type)\n      : matcher_(fst.InitMatcher(match_type)) {}\n\n  Matcher(const Matcher<FST> &matcher) : matcher_(matcher.matcher_->Copy()) {}\n\n  Matcher<FST> *Copy() const { return new Matcher<FST>(*this); }\n\n  MatchType Type(bool test) const { return matcher_->Type(test); }\n\n  void SetState(StateId s) { matcher_->SetState(s); }\n\n  bool Find(Label label) { return matcher_->Find(label); }\n\n  bool Done() const { return matcher_->Done(); }\n\n  const Arc &Value() const { return matcher_->Value(); }\n\n  void Next() { matcher_->Next(); }\n\n  uint64 Properties(uint64 props) const { return matcher_->Properties(props); }\n\n  uint32 Flags() const { return matcher_->Flags(); }\n\n private:\n  std::unique_ptr<M> matcher_;\n};\n\n// Specialization for MatcherFst.\ntemplate <class F, class M, const char *Name, class Init>\nclass LookAheadMatcher<MatcherFst<F, M, Name, Init>> {\n public:\n  using FST = MatcherFst<F, M, Name, Init>;\n  using Arc = typename F::Arc;\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  LookAheadMatcher(const FST &fst, MatchType match_type)\n      : matcher_(fst.InitMatcher(match_type)) {}\n\n  LookAheadMatcher(const LookAheadMatcher<FST> &matcher, bool safe = false)\n      : matcher_(matcher.matcher_->Copy(safe)) {}\n\n  // General matcher methods.\n  LookAheadMatcher<FST> *Copy(bool safe = false) const {\n    return new LookAheadMatcher<FST>(*this, safe);\n  }\n\n  MatchType Type(bool test) const { return matcher_->Type(test); }\n\n  void SetState(StateId s) { matcher_->SetState(s); }\n\n  bool Find(Label label) { return matcher_->Find(label); }\n\n  bool Done() const { return matcher_->Done(); }\n\n  const Arc &Value() const { return matcher_->Value(); }\n\n  void Next() { matcher_->Next(); }\n\n  const FST &GetFst() const { return matcher_->GetFst(); }\n\n  uint64 Properties(uint64 props) const { return matcher_->Properties(props); }\n\n  uint32 Flags() const { return matcher_->Flags(); }\n\n  bool LookAheadLabel(Label label) const {\n    return matcher_->LookAheadLabel(label);\n  }\n\n  bool LookAheadFst(const Fst<Arc> &fst, StateId s) {\n    return matcher_->LookAheadFst(fst, s);\n  }\n\n  Weight LookAheadWeight() const { return matcher_->LookAheadWeight(); }\n\n  bool LookAheadPrefix(Arc *arc) const {\n    return matcher_->LookAheadPrefix(arc);\n  }\n\n  void InitLookAheadFst(const Fst<Arc> &fst, bool copy = false) {\n    matcher_->InitLookAheadFst(fst, copy);\n  }\n\n private:\n  std::unique_ptr<M> matcher_;\n};\n\n// Useful aliases when using StdArc.\n\nextern const char arc_lookahead_fst_type[];\n\nusing StdArcLookAheadFst =\n    MatcherFst<ConstFst<StdArc>,\n               ArcLookAheadMatcher<SortedMatcher<ConstFst<StdArc>>>,\n               arc_lookahead_fst_type>;\n\nextern const char ilabel_lookahead_fst_type[];\nextern const char olabel_lookahead_fst_type[];\n\nconstexpr auto ilabel_lookahead_flags =\n    kInputLookAheadMatcher | kLookAheadWeight | kLookAheadPrefix |\n    kLookAheadEpsilons | kLookAheadNonEpsilonPrefix;\n\nconstexpr auto olabel_lookahead_flags =\n    kOutputLookAheadMatcher | kLookAheadWeight | kLookAheadPrefix |\n    kLookAheadEpsilons | kLookAheadNonEpsilonPrefix;\n\nusing StdILabelLookAheadFst = MatcherFst<\n    ConstFst<StdArc>,\n    LabelLookAheadMatcher<SortedMatcher<ConstFst<StdArc>>,\n                          ilabel_lookahead_flags, FastLogAccumulator<StdArc>>,\n    ilabel_lookahead_fst_type, LabelLookAheadRelabeler<StdArc>>;\n\nusing StdOLabelLookAheadFst = MatcherFst<\n    ConstFst<StdArc>,\n    LabelLookAheadMatcher<SortedMatcher<ConstFst<StdArc>>,\n                          olabel_lookahead_flags, FastLogAccumulator<StdArc>>,\n    olabel_lookahead_fst_type, LabelLookAheadRelabeler<StdArc>>;\n\n}  // namespace fst\n\n#endif  // FST_MATCHER_FST_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/matcher.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Classes to allow matching labels leaving FST states.\n\n#ifndef FST_MATCHER_H_\n#define FST_MATCHER_H_\n\n#include <algorithm>\n#include <unordered_map>\n#include <utility>\n\n#include <fst/log.h>\n\n#include <fst/mutable-fst.h>  // for all internal FST accessors.\n\n\nnamespace fst {\n\n// Matchers find and iterate through requested labels at FST states. In the\n// simplest form, these are just some associative map or search keyed on labels.\n// More generally, they may implement matching special labels that represent\n// sets of labels such as sigma (all), rho (rest), or phi (fail). The Matcher\n// interface is:\n//\n// template <class F>\n// class Matcher {\n//  public:\n//   using FST = F;\n//   using Arc = typename FST::Arc;\n//   using Label = typename Arc::Label;\n//   using StateId = typename Arc::StateId;\n//   using Weight = typename Arc::Weight;\n//\n//   // Required constructors. Note:\n//   // -- the constructors that copy the FST arg are useful for\n//   // letting the matcher manage the FST through copies\n//   // (esp with 'safe' copies); e.g. ComposeFst depends on this.\n//   // -- the constructor that does not copy is useful when the\n//   // the FST is mutated during the lifetime of the matcher\n//   // (o.w. the matcher would have its own unmutated deep copy).\n//\n//   // This makes a copy of the FST.\n//   Matcher(const FST &fst, MatchType type);\n//   // This doesn't copy the FST.\n//   Matcher(const FST *fst, MatchType type);\n//   // This makes a copy of the FST.\n//   // See Copy() below.\n//   Matcher(const Matcher &matcher, bool safe = false);\n//\n//   // If safe = true, the copy is thread-safe. See Fst<>::Copy() for\n//   // further doc.\n//   Matcher<FST> *Copy(bool safe = false) const override;\n//\n//   // Returns the match type that can be provided (depending on compatibility\n//   of the input FST). It is either the requested match type, MATCH_NONE, or\n//   MATCH_UNKNOWN. If test is false, a costly testing is avoided, but\n//   MATCH_UNKNOWN may be returned. If test is true, a definite answer is\n//   returned, but may involve more costly computation (e.g., visiting the FST).\n//   MatchType Type(bool test) const override;\n//\n//   // Specifies the current state.\n//   void SetState(StateId s) final;\n//\n//   // Finds matches to a label at the current state, returning true if a match\n//   // found. kNoLabel matches any non-consuming transitions, e.g., epsilon\n//   // transitions, which do not require a matching symbol.\n//   bool Find(Label label) final;\n//\n//   // Iterator methods. Note that initially and after SetState() these have\n//   undefined behavior until Find() is called.\n//\n//   bool Done() const final;\n//\n//   const Arc &Value() const final;\n//\n//   void Next() final;\n//\n//   // Returns final weight of a state.\n//   Weight Final(StateId) const final;\n//\n//   // Indicates preference for being the side used for matching in\n//   // composition. If the value is kRequirePriority, then it is\n//   // mandatory that it be used. Calling this method without passing the\n//   // current state of the matcher invalidates the state of the matcher.\n//   ssize_t Priority(StateId s) final;\n//\n//   // This specifies the known FST properties as viewed from this matcher. It\n//   // takes as argument the input FST's known properties.\n//   uint64 Properties(uint64 props) const override;\n//\n//   // Returns matcher flags.\n//   uint32 Flags() const override;\n//\n//   // Returns matcher FST.\n//   const FST &GetFst() const override;\n// };\n\n// Basic matcher flags.\n\n// Matcher needs to be used as the matching side in composition for\n// at least one state (has kRequirePriority).\nconstexpr uint32 kRequireMatch = 0x00000001;\n\n// Flags used for basic matchers (see also lookahead.h).\nconstexpr uint32 kMatcherFlags = kRequireMatch;\n\n// Matcher priority that is mandatory.\nconstexpr ssize_t kRequirePriority = -1;\n\n// Matcher interface, templated on the Arc definition; used for matcher\n// specializations that are returned by the InitMatcher FST method.\ntemplate <class A>\nclass MatcherBase {\n public:\n  using Arc = A;\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  virtual ~MatcherBase() {}\n\n  // Virtual interface.\n\n  virtual MatcherBase<Arc> *Copy(bool safe = false) const = 0;\n  virtual MatchType Type(bool) const = 0;\n  virtual void SetState(StateId) = 0;\n  virtual bool Find(Label) = 0;\n  virtual bool Done() const = 0;\n  virtual const Arc &Value() const = 0;\n  virtual void Next() = 0;\n  virtual const Fst<Arc> &GetFst() const = 0;\n  virtual uint64 Properties(uint64) const = 0;\n\n  // Trivial implementations that can be used by derived classes. Full\n  // devirtualization is expected for any derived class marked final.\n  virtual uint32 Flags() const { return 0; }\n\n  virtual Weight Final(StateId s) const { return internal::Final(GetFst(), s); }\n\n  virtual ssize_t Priority(StateId s) { return internal::NumArcs(GetFst(), s); }\n};\n\n// A matcher that expects sorted labels on the side to be matched.\n// If match_type == MATCH_INPUT, epsilons match the implicit self-loop\n// Arc(kNoLabel, 0, Weight::One(), current_state) as well as any\n// actual epsilon transitions. If match_type == MATCH_OUTPUT, then\n// Arc(0, kNoLabel, Weight::One(), current_state) is instead matched.\ntemplate <class F>\nclass SortedMatcher : public MatcherBase<typename F::Arc> {\n public:\n  using FST = F;\n  using Arc = typename FST::Arc;\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using MatcherBase<Arc>::Flags;\n  using MatcherBase<Arc>::Properties;\n\n  // Labels >= binary_label will be searched for by binary search;\n  // o.w. linear search is used.\n  // This makes a copy of the FST.\n  SortedMatcher(const FST &fst, MatchType match_type, Label binary_label = 1)\n      : SortedMatcher(fst.Copy(), match_type, binary_label) {\n    owned_fst_.reset(&fst_);\n  }\n\n  // Labels >= binary_label will be searched for by binary search;\n  // o.w. linear search is used.\n  // This doesn't copy the FST.\n  SortedMatcher(const FST *fst, MatchType match_type, Label binary_label = 1)\n      : fst_(*fst),\n        state_(kNoStateId),\n        aiter_(nullptr),\n        match_type_(match_type),\n        binary_label_(binary_label),\n        match_label_(kNoLabel),\n        narcs_(0),\n        loop_(kNoLabel, 0, Weight::One(), kNoStateId),\n        error_(false),\n        aiter_pool_(1) {\n    switch (match_type_) {\n      case MATCH_INPUT:\n      case MATCH_NONE:\n        break;\n      case MATCH_OUTPUT:\n        std::swap(loop_.ilabel, loop_.olabel);\n        break;\n      default:\n        FSTERROR() << \"SortedMatcher: Bad match type\";\n        match_type_ = MATCH_NONE;\n        error_ = true;\n    }\n  }\n\n  // This makes a copy of the FST.\n  SortedMatcher(const SortedMatcher<FST> &matcher, bool safe = false)\n      : owned_fst_(matcher.fst_.Copy(safe)),\n        fst_(*owned_fst_),\n        state_(kNoStateId),\n        aiter_(nullptr),\n        match_type_(matcher.match_type_),\n        binary_label_(matcher.binary_label_),\n        match_label_(kNoLabel),\n        narcs_(0),\n        loop_(matcher.loop_),\n        error_(matcher.error_),\n        aiter_pool_(1) {}\n\n  ~SortedMatcher() override { Destroy(aiter_, &aiter_pool_); }\n\n  SortedMatcher<FST> *Copy(bool safe = false) const override {\n    return new SortedMatcher<FST>(*this, safe);\n  }\n\n  MatchType Type(bool test) const override {\n    if (match_type_ == MATCH_NONE) return match_type_;\n    const auto true_prop =\n        match_type_ == MATCH_INPUT ? kILabelSorted : kOLabelSorted;\n    const auto false_prop =\n        match_type_ == MATCH_INPUT ? kNotILabelSorted : kNotOLabelSorted;\n    const auto props = fst_.Properties(true_prop | false_prop, test);\n    if (props & true_prop) {\n      return match_type_;\n    } else if (props & false_prop) {\n      return MATCH_NONE;\n    } else {\n      return MATCH_UNKNOWN;\n    }\n  }\n\n  void SetState(StateId s) final {\n    if (state_ == s) return;\n    state_ = s;\n    if (match_type_ == MATCH_NONE) {\n      FSTERROR() << \"SortedMatcher: Bad match type\";\n      error_ = true;\n    }\n    Destroy(aiter_, &aiter_pool_);\n    aiter_ = new (&aiter_pool_) ArcIterator<FST>(fst_, s);\n    aiter_->SetFlags(kArcNoCache, kArcNoCache);\n    narcs_ = internal::NumArcs(fst_, s);\n    loop_.nextstate = s;\n  }\n\n  bool Find(Label match_label) final {\n    exact_match_ = true;\n    if (error_) {\n      current_loop_ = false;\n      match_label_ = kNoLabel;\n      return false;\n    }\n    current_loop_ = match_label == 0;\n    match_label_ = match_label == kNoLabel ? 0 : match_label;\n    if (Search()) {\n      return true;\n    } else {\n      return current_loop_;\n    }\n  }\n\n  // Positions matcher to the first position where inserting match_label would\n  // maintain the sort order.\n  void LowerBound(Label label) {\n    exact_match_ = false;\n    current_loop_ = false;\n    if (error_) {\n      match_label_ = kNoLabel;\n      return;\n    }\n    match_label_ = label;\n    Search();\n  }\n\n  // After Find(), returns false if no more exact matches.\n  // After LowerBound(), returns false if no more arcs.\n  bool Done() const final {\n    if (current_loop_) return false;\n    if (aiter_->Done()) return true;\n    if (!exact_match_) return false;\n    aiter_->SetFlags(match_type_ == MATCH_INPUT ?\n        kArcILabelValue : kArcOLabelValue,\n        kArcValueFlags);\n    return GetLabel() != match_label_;\n  }\n\n  const Arc &Value() const final {\n    if (current_loop_) return loop_;\n    aiter_->SetFlags(kArcValueFlags, kArcValueFlags);\n    return aiter_->Value();\n  }\n\n  void Next() final {\n    if (current_loop_) {\n      current_loop_ = false;\n    } else {\n      aiter_->Next();\n    }\n  }\n\n  Weight Final(StateId s) const final {\n    return MatcherBase<Arc>::Final(s);\n  }\n\n  ssize_t Priority(StateId s) final {\n    return MatcherBase<Arc>::Priority(s);\n  }\n\n  const FST &GetFst() const override { return fst_; }\n\n  uint64 Properties(uint64 inprops) const override {\n    return inprops | (error_ ? kError : 0);\n  }\n\n  size_t Position() const { return aiter_ ? aiter_->Position() : 0; }\n\n private:\n  Label GetLabel() const {\n    const auto &arc = aiter_->Value();\n    return match_type_ == MATCH_INPUT ? arc.ilabel : arc.olabel;\n  }\n\n  bool BinarySearch();\n  bool LinearSearch();\n  bool Search();\n\n  std::unique_ptr<const FST> owned_fst_;   // FST ptr if owned.\n  const FST &fst_;           // FST for matching.\n  StateId state_;            // Matcher state.\n  ArcIterator<FST> *aiter_;  // Iterator for current state.\n  MatchType match_type_;     // Type of match to perform.\n  Label binary_label_;       // Least label for binary search.\n  Label match_label_;        // Current label to be matched.\n  size_t narcs_;             // Current state arc count.\n  Arc loop_;                 // For non-consuming symbols.\n  bool current_loop_;        // Current arc is the implicit loop.\n  bool exact_match_;         // Exact match or lower bound?\n  bool error_;               // Error encountered?\n  MemoryPool<ArcIterator<FST>> aiter_pool_;  // Pool of arc iterators.\n};\n\n// Returns true iff match to match_label_. The arc iterator is positioned at the\n// lower bound, that is, the first element greater than or equal to\n// match_label_, or the end if all elements are less than match_label_.\ntemplate <class FST>\ninline bool SortedMatcher<FST>::BinarySearch() {\n  size_t low = 0;\n  size_t high = narcs_;\n  while (low < high) {\n    const size_t mid = low + (high - low) / 2;\n    aiter_->Seek(mid);\n    if (GetLabel() < match_label_) {\n      low = mid + 1;\n    } else {\n      high = mid;\n    }\n  }\n\n  aiter_->Seek(low);\n  return low < narcs_ && GetLabel() == match_label_;\n}\n\n// Returns true iff match to match_label_, positioning arc iterator at lower\n// bound.\ntemplate <class FST>\ninline bool SortedMatcher<FST>::LinearSearch() {\n  for (aiter_->Reset(); !aiter_->Done(); aiter_->Next()) {\n    const auto label = GetLabel();\n    if (label == match_label_) return true;\n    if (label > match_label_) break;\n  }\n  return false;\n}\n\n// Returns true iff match to match_label_, positioning arc iterator at lower\n// bound.\ntemplate <class FST>\ninline bool SortedMatcher<FST>::Search() {\n  aiter_->SetFlags(match_type_ == MATCH_INPUT ?\n                   kArcILabelValue : kArcOLabelValue,\n                   kArcValueFlags);\n  if (match_label_ >= binary_label_) {\n    return BinarySearch();\n  } else {\n    return LinearSearch();\n  }\n}\n\n// A matcher that stores labels in a per-state hash table populated upon the\n// first visit to that state. Sorting is not required. Treatment of\n// epsilons are the same as with SortedMatcher.\ntemplate <class F>\nclass HashMatcher : public MatcherBase<typename F::Arc> {\n public:\n  using FST = F;\n  using Arc = typename FST::Arc;\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using MatcherBase<Arc>::Flags;\n  using MatcherBase<Arc>::Final;\n  using MatcherBase<Arc>::Priority;\n\n  // This makes a copy of the FST.\n  HashMatcher(const FST &fst, MatchType match_type)\n      : HashMatcher(fst.Copy(), match_type) {\n    owned_fst_.reset(&fst_);\n  }\n\n  // This doesn't copy the FST.\n  HashMatcher(const FST *fst, MatchType match_type)\n      : fst_(*fst),\n        state_(kNoStateId),\n        match_type_(match_type),\n        loop_(kNoLabel, 0, Weight::One(), kNoStateId),\n        error_(false) {\n    switch (match_type_) {\n      case MATCH_INPUT:\n      case MATCH_NONE:\n        break;\n      case MATCH_OUTPUT:\n        std::swap(loop_.ilabel, loop_.olabel);\n        break;\n      default:\n        FSTERROR() << \"HashMatcher: Bad match type\";\n        match_type_ = MATCH_NONE;\n        error_ = true;\n    }\n  }\n\n  // This makes a copy of the FST.\n  HashMatcher(const HashMatcher<FST> &matcher, bool safe = false)\n      : owned_fst_(matcher.fst_.Copy(safe)),\n        fst_(*owned_fst_),\n        state_(kNoStateId),\n        match_type_(matcher.match_type_),\n        loop_(matcher.loop_),\n        error_(matcher.error_) {}\n\n  HashMatcher<FST> *Copy(bool safe = false) const override {\n    return new HashMatcher<FST>(*this, safe);\n  }\n\n  // The argument is ignored as there are no relevant properties to test.\n  MatchType Type(bool test) const override { return match_type_; }\n\n  void SetState(StateId s) final;\n\n  bool Find(Label label) final {\n    current_loop_ = label == 0;\n    if (label == 0) {\n      Search(label);\n      return true;\n    }\n    if (label == kNoLabel) label = 0;\n    return Search(label);\n  }\n\n  bool Done() const final {\n    if (current_loop_) return false;\n    return label_it_ == label_end_;\n  }\n\n  const Arc &Value() const final {\n    if (current_loop_) return loop_;\n    aiter_->Seek(label_it_->second);\n    return aiter_->Value();\n  }\n\n  void Next() final {\n    if (current_loop_) {\n      current_loop_ = false;\n    } else {\n      ++label_it_;\n    }\n  }\n\n  const FST &GetFst() const override { return fst_; }\n\n  uint64 Properties(uint64 inprops) const override {\n    return inprops | (error_ ? kError : 0);\n  }\n\n private:\n  Label GetLabel() const {\n    const auto &arc = aiter_->Value();\n    return match_type_ == MATCH_INPUT ? arc.ilabel : arc.olabel;\n  }\n\n  bool Search(Label match_label);\n\n  using LabelTable = std::unordered_multimap<Label, size_t>;\n  using StateTable = std::unordered_map<StateId, LabelTable>;\n\n  std::unique_ptr<const FST> owned_fst_;  // ptr to FST if owned.\n  const FST &fst_;     // FST for matching.\n  StateId state_;      // Matcher state.\n  MatchType match_type_;\n  Arc loop_;            // The implicit loop itself.\n  bool current_loop_;   // Is the current arc the implicit loop?\n  bool error_;          // Error encountered?\n  std::unique_ptr<ArcIterator<FST>> aiter_;\n  StateTable state_table_;   // Table from states to label table.\n  LabelTable *label_table_;  // Pointer to current state's label table.\n  typename LabelTable::iterator label_it_;   // Position for label.\n  typename LabelTable::iterator label_end_;  // Position for last label + 1.\n};\n\ntemplate <class FST>\nvoid HashMatcher<FST>::SetState(typename FST::Arc::StateId s) {\n  if (state_ == s) return;\n  // Resets everything for the state.\n  state_ = s;\n  loop_.nextstate = state_;\n  aiter_.reset(new ArcIterator<FST>(fst_, state_));\n  if (match_type_ == MATCH_NONE) {\n    FSTERROR() << \"HashMatcher: Bad match type\";\n    error_ = true;\n  }\n  // Attempts to insert a new label table; if it already exists,\n  // no additional work is done and we simply return.\n  auto it_and_success = state_table_.emplace(state_, LabelTable());\n  if (!it_and_success.second) return;\n  // Otherwise, populate this new table.\n  // Sets instance's pointer to the label table for this state.\n  label_table_ = &(it_and_success.first->second);\n  // Populates the label table.\n  label_table_->reserve(internal::NumArcs(fst_, state_));\n  const auto aiter_flags =\n      (match_type_ == MATCH_INPUT ? kArcILabelValue : kArcOLabelValue) |\n      kArcNoCache;\n  aiter_->SetFlags(aiter_flags, kArcFlags);\n  for (; !aiter_->Done(); aiter_->Next()) {\n    label_table_->emplace(GetLabel(), aiter_->Position());\n  }\n  aiter_->SetFlags(kArcValueFlags, kArcValueFlags);\n}\n\ntemplate <class FST>\ninline bool HashMatcher<FST>::Search(typename FST::Arc::Label match_label) {\n  auto range = label_table_->equal_range(match_label);\n  if (range.first == range.second) return false;\n  label_it_ = range.first;\n  label_end_ = range.second;\n  aiter_->Seek(label_it_->second);\n  return true;\n}\n\n// Specifies whether we rewrite both the input and output sides during matching.\nenum MatcherRewriteMode {\n  MATCHER_REWRITE_AUTO = 0,  // Rewrites both sides iff acceptor.\n  MATCHER_REWRITE_ALWAYS,\n  MATCHER_REWRITE_NEVER\n};\n\n// For any requested label that doesn't match at a state, this matcher\n// considers the *unique* transition that matches the label 'phi_label'\n// (phi = 'fail'), and recursively looks for a match at its\n// destination.  When 'phi_loop' is true, if no match is found but a\n// phi self-loop is found, then the phi transition found is returned\n// with the phi_label rewritten as the requested label (both sides if\n// an acceptor, or if 'rewrite_both' is true and both input and output\n// labels of the found transition are 'phi_label').  If 'phi_label' is\n// kNoLabel, this special matching is not done.  PhiMatcher is\n// templated itself on a matcher, which is used to perform the\n// underlying matching.  By default, the underlying matcher is\n// constructed by PhiMatcher. The user can instead pass in this\n// object; in that case, PhiMatcher takes its ownership.\n// Phi non-determinism not supported. No non-consuming symbols other\n// than epsilon supported with the underlying template argument matcher.\ntemplate <class M>\nclass PhiMatcher : public MatcherBase<typename M::Arc> {\n public:\n  using FST = typename M::FST;\n  using Arc = typename FST::Arc;\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  // This makes a copy of the FST (w/o 'matcher' arg).\n  PhiMatcher(const FST &fst, MatchType match_type, Label phi_label = kNoLabel,\n             bool phi_loop = true,\n             MatcherRewriteMode rewrite_mode = MATCHER_REWRITE_AUTO,\n             M *matcher = nullptr)\n      : matcher_(matcher ? matcher : new M(fst, match_type)),\n        match_type_(match_type),\n        phi_label_(phi_label),\n        state_(kNoStateId),\n        phi_loop_(phi_loop),\n        error_(false) {\n    if (match_type == MATCH_BOTH) {\n      FSTERROR() << \"PhiMatcher: Bad match type\";\n      match_type_ = MATCH_NONE;\n      error_ = true;\n    }\n    if (rewrite_mode == MATCHER_REWRITE_AUTO) {\n      rewrite_both_ = fst.Properties(kAcceptor, true);\n    } else if (rewrite_mode == MATCHER_REWRITE_ALWAYS) {\n      rewrite_both_ = true;\n    } else {\n      rewrite_both_ = false;\n    }\n  }\n\n  // This doesn't copy the FST.\n  PhiMatcher(const FST *fst, MatchType match_type, Label phi_label = kNoLabel,\n             bool phi_loop = true,\n             MatcherRewriteMode rewrite_mode = MATCHER_REWRITE_AUTO,\n             M *matcher = nullptr)\n      : PhiMatcher(*fst, match_type, phi_label, phi_loop, rewrite_mode,\n                   matcher ? matcher : new M(fst, match_type)) { }\n\n\n  // This makes a copy of the FST.\n  PhiMatcher(const PhiMatcher<M> &matcher, bool safe = false)\n      : matcher_(new M(*matcher.matcher_, safe)),\n        match_type_(matcher.match_type_),\n        phi_label_(matcher.phi_label_),\n        rewrite_both_(matcher.rewrite_both_),\n        state_(kNoStateId),\n        phi_loop_(matcher.phi_loop_),\n        error_(matcher.error_) {}\n\n  PhiMatcher<M> *Copy(bool safe = false) const override {\n    return new PhiMatcher<M>(*this, safe);\n  }\n\n  MatchType Type(bool test) const override { return matcher_->Type(test); }\n\n  void SetState(StateId s) final {\n    if (state_ == s) return;\n    matcher_->SetState(s);\n    state_ = s;\n    has_phi_ = phi_label_ != kNoLabel;\n  }\n\n  bool Find(Label match_label) final;\n\n  bool Done() const final { return matcher_->Done(); }\n\n  const Arc &Value() const final {\n    if ((phi_match_ == kNoLabel) && (phi_weight_ == Weight::One())) {\n      return matcher_->Value();\n    } else if (phi_match_ == 0) {  // Virtual epsilon loop.\n      phi_arc_ = Arc(kNoLabel, 0, Weight::One(), state_);\n      if (match_type_ == MATCH_OUTPUT) {\n        std::swap(phi_arc_.ilabel, phi_arc_.olabel);\n      }\n      return phi_arc_;\n    } else {\n      phi_arc_ = matcher_->Value();\n      phi_arc_.weight = Times(phi_weight_, phi_arc_.weight);\n      if (phi_match_ != kNoLabel) {  // Phi loop match.\n        if (rewrite_both_) {\n          if (phi_arc_.ilabel == phi_label_) phi_arc_.ilabel = phi_match_;\n          if (phi_arc_.olabel == phi_label_) phi_arc_.olabel = phi_match_;\n        } else if (match_type_ == MATCH_INPUT) {\n          phi_arc_.ilabel = phi_match_;\n        } else {\n          phi_arc_.olabel = phi_match_;\n        }\n      }\n      return phi_arc_;\n    }\n  }\n\n  void Next() final { matcher_->Next(); }\n\n  Weight Final(StateId s) const final {\n    auto weight = matcher_->Final(s);\n    if (phi_label_ == kNoLabel || weight != Weight::Zero()) {\n      return weight;\n    }\n    weight = Weight::One();\n    matcher_->SetState(s);\n    while (matcher_->Final(s) == Weight::Zero()) {\n      if (!matcher_->Find(phi_label_ == 0 ? -1 : phi_label_)) break;\n      weight = Times(weight, matcher_->Value().weight);\n      if (s == matcher_->Value().nextstate) {\n        return Weight::Zero();  // Does not follow phi self-loops.\n      }\n      s = matcher_->Value().nextstate;\n      matcher_->SetState(s);\n    }\n    weight = Times(weight, matcher_->Final(s));\n    return weight;\n  }\n\n  ssize_t Priority(StateId s) final {\n    if (phi_label_ != kNoLabel) {\n      matcher_->SetState(s);\n      const bool has_phi = matcher_->Find(phi_label_ == 0 ? -1 : phi_label_);\n      return has_phi ? kRequirePriority : matcher_->Priority(s);\n    } else {\n      return matcher_->Priority(s);\n    }\n  }\n\n  const FST &GetFst() const override { return matcher_->GetFst(); }\n\n  uint64 Properties(uint64 props) const override;\n\n  uint32 Flags() const override {\n    if (phi_label_ == kNoLabel || match_type_ == MATCH_NONE) {\n      return matcher_->Flags();\n    }\n    return matcher_->Flags() | kRequireMatch;\n  }\n\n  Label PhiLabel() const { return phi_label_; }\n\n private:\n  mutable std::unique_ptr<M> matcher_;\n  MatchType match_type_;  // Type of match requested.\n  Label phi_label_;       // Label that represents the phi transition.\n  bool rewrite_both_;     // Rewrite both sides when both are phi_label_?\n  bool has_phi_;          // Are there possibly phis at the current state?\n  Label phi_match_;       // Current label that matches phi loop.\n  mutable Arc phi_arc_;   // Arc to return.\n  StateId state_;         // Matcher state.\n  Weight phi_weight_;     // Product of the weights of phi transitions taken.\n  bool phi_loop_;         // When true, phi self-loop are allowed and treated\n                          // as rho (required for Aho-Corasick).\n  bool error_;            // Error encountered?\n\n  PhiMatcher &operator=(const PhiMatcher &) = delete;\n};\n\ntemplate <class M>\ninline bool PhiMatcher<M>::Find(Label label) {\n  if (label == phi_label_ && phi_label_ != kNoLabel && phi_label_ != 0) {\n    FSTERROR() << \"PhiMatcher::Find: bad label (phi): \" << phi_label_;\n    error_ = true;\n    return false;\n  }\n  matcher_->SetState(state_);\n  phi_match_ = kNoLabel;\n  phi_weight_ = Weight::One();\n  // If phi_label_ == 0, there are no more true epsilon arcs.\n  if (phi_label_ == 0) {\n    if (label == kNoLabel) {\n      return false;\n    }\n    if (label == 0) {  // but a virtual epsilon loop needs to be returned.\n      if (!matcher_->Find(kNoLabel)) {\n        return matcher_->Find(0);\n      } else {\n        phi_match_ = 0;\n        return true;\n      }\n    }\n  }\n  if (!has_phi_ || label == 0 || label == kNoLabel) {\n    return matcher_->Find(label);\n  }\n  auto s = state_;\n  while (!matcher_->Find(label)) {\n    // Look for phi transition (if phi_label_ == 0, we need to look\n    // for -1 to avoid getting the virtual self-loop)\n    if (!matcher_->Find(phi_label_ == 0 ? -1 : phi_label_)) return false;\n    if (phi_loop_ && matcher_->Value().nextstate == s) {\n      phi_match_ = label;\n      return true;\n    }\n    phi_weight_ = Times(phi_weight_, matcher_->Value().weight);\n    s = matcher_->Value().nextstate;\n    matcher_->Next();\n    if (!matcher_->Done()) {\n      FSTERROR() << \"PhiMatcher: Phi non-determinism not supported\";\n      error_ = true;\n    }\n    matcher_->SetState(s);\n  }\n  return true;\n}\n\ntemplate <class M>\ninline uint64 PhiMatcher<M>::Properties(uint64 inprops) const {\n  auto outprops = matcher_->Properties(inprops);\n  if (error_) outprops |= kError;\n  if (match_type_ == MATCH_NONE) {\n    return outprops;\n  } else if (match_type_ == MATCH_INPUT) {\n    if (phi_label_ == 0) {\n      outprops &= ~kEpsilons | ~kIEpsilons | ~kOEpsilons;\n      outprops |= kNoEpsilons | kNoIEpsilons;\n    }\n    if (rewrite_both_) {\n      return outprops &\n             ~(kODeterministic | kNonODeterministic | kString | kILabelSorted |\n               kNotILabelSorted | kOLabelSorted | kNotOLabelSorted);\n    } else {\n      return outprops &\n             ~(kODeterministic | kAcceptor | kString | kILabelSorted |\n               kNotILabelSorted | kOLabelSorted | kNotOLabelSorted);\n    }\n  } else if (match_type_ == MATCH_OUTPUT) {\n    if (phi_label_ == 0) {\n      outprops &= ~kEpsilons | ~kIEpsilons | ~kOEpsilons;\n      outprops |= kNoEpsilons | kNoOEpsilons;\n    }\n    if (rewrite_both_) {\n      return outprops &\n             ~(kIDeterministic | kNonIDeterministic | kString | kILabelSorted |\n               kNotILabelSorted | kOLabelSorted | kNotOLabelSorted);\n    } else {\n      return outprops &\n             ~(kIDeterministic | kAcceptor | kString | kILabelSorted |\n               kNotILabelSorted | kOLabelSorted | kNotOLabelSorted);\n    }\n  } else {\n    // Shouldn't ever get here.\n    FSTERROR() << \"PhiMatcher: Bad match type: \" << match_type_;\n    return 0;\n  }\n}\n\n// For any requested label that doesn't match at a state, this matcher\n// considers all transitions that match the label 'rho_label' (rho =\n// 'rest').  Each such rho transition found is returned with the\n// rho_label rewritten as the requested label (both sides if an\n// acceptor, or if 'rewrite_both' is true and both input and output\n// labels of the found transition are 'rho_label').  If 'rho_label' is\n// kNoLabel, this special matching is not done.  RhoMatcher is\n// templated itself on a matcher, which is used to perform the\n// underlying matching.  By default, the underlying matcher is\n// constructed by RhoMatcher.  The user can instead pass in this\n// object; in that case, RhoMatcher takes its ownership.\n// No non-consuming symbols other than epsilon supported with\n// the underlying template argument matcher.\ntemplate <class M>\nclass RhoMatcher : public MatcherBase<typename M::Arc> {\n public:\n  using FST = typename M::FST;\n  using Arc = typename FST::Arc;\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  // This makes a copy of the FST (w/o 'matcher' arg).\n  RhoMatcher(const FST &fst, MatchType match_type, Label rho_label = kNoLabel,\n             MatcherRewriteMode rewrite_mode = MATCHER_REWRITE_AUTO,\n             M *matcher = nullptr)\n      : matcher_(matcher ? matcher : new M(fst, match_type)),\n        match_type_(match_type),\n        rho_label_(rho_label),\n        error_(false),\n        state_(kNoStateId),\n        has_rho_(false) {\n    if (match_type == MATCH_BOTH) {\n      FSTERROR() << \"RhoMatcher: Bad match type\";\n      match_type_ = MATCH_NONE;\n      error_ = true;\n    }\n    if (rho_label == 0) {\n      FSTERROR() << \"RhoMatcher: 0 cannot be used as rho_label\";\n      rho_label_ = kNoLabel;\n      error_ = true;\n    }\n    if (rewrite_mode == MATCHER_REWRITE_AUTO) {\n      rewrite_both_ = fst.Properties(kAcceptor, true);\n    } else if (rewrite_mode == MATCHER_REWRITE_ALWAYS) {\n      rewrite_both_ = true;\n    } else {\n      rewrite_both_ = false;\n    }\n  }\n\n  // This doesn't copy the FST.\n  RhoMatcher(const FST *fst, MatchType match_type, Label rho_label = kNoLabel,\n             MatcherRewriteMode rewrite_mode = MATCHER_REWRITE_AUTO,\n             M *matcher = nullptr)\n      : RhoMatcher(*fst, match_type, rho_label, rewrite_mode,\n                   matcher ? matcher : new M(fst, match_type)) { }\n\n  // This makes a copy of the FST.\n  RhoMatcher(const RhoMatcher<M> &matcher, bool safe = false)\n      : matcher_(new M(*matcher.matcher_, safe)),\n        match_type_(matcher.match_type_),\n        rho_label_(matcher.rho_label_),\n        rewrite_both_(matcher.rewrite_both_),\n        error_(matcher.error_),\n        state_(kNoStateId),\n        has_rho_(false) {}\n\n  RhoMatcher<M> *Copy(bool safe = false) const override {\n    return new RhoMatcher<M>(*this, safe);\n  }\n\n  MatchType Type(bool test) const override { return matcher_->Type(test); }\n\n  void SetState(StateId s) final {\n    if (state_ == s) return;\n    state_ = s;\n    matcher_->SetState(s);\n    has_rho_ = rho_label_ != kNoLabel;\n  }\n\n  bool Find(Label label) final {\n    if (label == rho_label_ && rho_label_ != kNoLabel) {\n      FSTERROR() << \"RhoMatcher::Find: bad label (rho)\";\n      error_ = true;\n      return false;\n    }\n    if (matcher_->Find(label)) {\n      rho_match_ = kNoLabel;\n      return true;\n    } else if (has_rho_ && label != 0 && label != kNoLabel &&\n               (has_rho_ = matcher_->Find(rho_label_))) {\n      rho_match_ = label;\n      return true;\n    } else {\n      return false;\n    }\n  }\n\n  bool Done() const final { return matcher_->Done(); }\n\n  const Arc &Value() const final {\n    if (rho_match_ == kNoLabel) {\n      return matcher_->Value();\n    } else {\n      rho_arc_ = matcher_->Value();\n      if (rewrite_both_) {\n        if (rho_arc_.ilabel == rho_label_) rho_arc_.ilabel = rho_match_;\n        if (rho_arc_.olabel == rho_label_) rho_arc_.olabel = rho_match_;\n      } else if (match_type_ == MATCH_INPUT) {\n        rho_arc_.ilabel = rho_match_;\n      } else {\n        rho_arc_.olabel = rho_match_;\n      }\n      return rho_arc_;\n    }\n  }\n\n  void Next() final { matcher_->Next(); }\n\n  Weight Final(StateId s) const final { return matcher_->Final(s); }\n\n  ssize_t Priority(StateId s) final {\n    state_ = s;\n    matcher_->SetState(s);\n    has_rho_ = matcher_->Find(rho_label_);\n    if (has_rho_) {\n      return kRequirePriority;\n    } else {\n      return matcher_->Priority(s);\n    }\n  }\n\n  const FST &GetFst() const override { return matcher_->GetFst(); }\n\n  uint64 Properties(uint64 props) const override;\n\n  uint32 Flags() const override {\n    if (rho_label_ == kNoLabel || match_type_ == MATCH_NONE) {\n      return matcher_->Flags();\n    }\n    return matcher_->Flags() | kRequireMatch;\n  }\n\n  Label RhoLabel() const { return rho_label_; }\n\n private:\n  std::unique_ptr<M> matcher_;\n  MatchType match_type_;  // Type of match requested.\n  Label rho_label_;       // Label that represents the rho transition\n  bool rewrite_both_;     // Rewrite both sides when both are rho_label_?\n  Label rho_match_;       // Current label that matches rho transition.\n  mutable Arc rho_arc_;   // Arc to return when rho match.\n  bool error_;            // Error encountered?\n  StateId state_;         // Matcher state.\n  bool has_rho_;          // Are there possibly rhos at the current state?\n};\n\ntemplate <class M>\ninline uint64 RhoMatcher<M>::Properties(uint64 inprops) const {\n  auto outprops = matcher_->Properties(inprops);\n  if (error_) outprops |= kError;\n  if (match_type_ == MATCH_NONE) {\n    return outprops;\n  } else if (match_type_ == MATCH_INPUT) {\n    if (rewrite_both_) {\n      return outprops &\n             ~(kODeterministic | kNonODeterministic | kString | kILabelSorted |\n               kNotILabelSorted | kOLabelSorted | kNotOLabelSorted);\n    } else {\n      return outprops &\n             ~(kODeterministic | kAcceptor | kString | kILabelSorted |\n               kNotILabelSorted);\n    }\n  } else if (match_type_ == MATCH_OUTPUT) {\n    if (rewrite_both_) {\n      return outprops &\n             ~(kIDeterministic | kNonIDeterministic | kString | kILabelSorted |\n               kNotILabelSorted | kOLabelSorted | kNotOLabelSorted);\n    } else {\n      return outprops &\n             ~(kIDeterministic | kAcceptor | kString | kOLabelSorted |\n               kNotOLabelSorted);\n    }\n  } else {\n    // Shouldn't ever get here.\n    FSTERROR() << \"RhoMatcher: Bad match type: \" << match_type_;\n    return 0;\n  }\n}\n\n// For any requested label, this matcher considers all transitions\n// that match the label 'sigma_label' (sigma = \"any\"), and this in\n// additions to transitions with the requested label.  Each such sigma\n// transition found is returned with the sigma_label rewritten as the\n// requested label (both sides if an acceptor, or if 'rewrite_both' is\n// true and both input and output labels of the found transition are\n// 'sigma_label').  If 'sigma_label' is kNoLabel, this special\n// matching is not done.  SigmaMatcher is templated itself on a\n// matcher, which is used to perform the underlying matching.  By\n// default, the underlying matcher is constructed by SigmaMatcher.\n// The user can instead pass in this object; in that case,\n// SigmaMatcher takes its ownership.  No non-consuming symbols other\n// than epsilon supported with the underlying template argument matcher.\ntemplate <class M>\nclass SigmaMatcher : public MatcherBase<typename M::Arc> {\n public:\n  using FST = typename M::FST;\n  using Arc = typename FST::Arc;\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  // This makes a copy of the FST (w/o 'matcher' arg).\n  SigmaMatcher(const FST &fst, MatchType match_type,\n               Label sigma_label = kNoLabel,\n               MatcherRewriteMode rewrite_mode = MATCHER_REWRITE_AUTO,\n               M *matcher = nullptr)\n      : matcher_(matcher ? matcher : new M(fst, match_type)),\n        match_type_(match_type),\n        sigma_label_(sigma_label),\n        error_(false),\n        state_(kNoStateId) {\n    if (match_type == MATCH_BOTH) {\n      FSTERROR() << \"SigmaMatcher: Bad match type\";\n      match_type_ = MATCH_NONE;\n      error_ = true;\n    }\n    if (sigma_label == 0) {\n      FSTERROR() << \"SigmaMatcher: 0 cannot be used as sigma_label\";\n      sigma_label_ = kNoLabel;\n      error_ = true;\n    }\n    if (rewrite_mode == MATCHER_REWRITE_AUTO) {\n      rewrite_both_ = fst.Properties(kAcceptor, true);\n    } else if (rewrite_mode == MATCHER_REWRITE_ALWAYS) {\n      rewrite_both_ = true;\n    } else {\n      rewrite_both_ = false;\n    }\n  }\n\n  // This doesn't copy the FST.\n  SigmaMatcher(const FST *fst, MatchType match_type,\n               Label sigma_label = kNoLabel,\n               MatcherRewriteMode rewrite_mode = MATCHER_REWRITE_AUTO,\n             M *matcher = nullptr)\n      : SigmaMatcher(*fst, match_type, sigma_label, rewrite_mode,\n                     matcher ? matcher : new M(fst, match_type)) { }\n\n  // This makes a copy of the FST.\n  SigmaMatcher(const SigmaMatcher<M> &matcher, bool safe = false)\n      : matcher_(new M(*matcher.matcher_, safe)),\n        match_type_(matcher.match_type_),\n        sigma_label_(matcher.sigma_label_),\n        rewrite_both_(matcher.rewrite_both_),\n        error_(matcher.error_),\n        state_(kNoStateId) {}\n\n  SigmaMatcher<M> *Copy(bool safe = false) const override {\n    return new SigmaMatcher<M>(*this, safe);\n  }\n\n  MatchType Type(bool test) const override { return matcher_->Type(test); }\n\n  void SetState(StateId s) final {\n    if (state_ == s) return;\n    state_ = s;\n    matcher_->SetState(s);\n    has_sigma_ =\n        (sigma_label_ != kNoLabel) ? matcher_->Find(sigma_label_) : false;\n  }\n\n  bool Find(Label match_label) final {\n    match_label_ = match_label;\n    if (match_label == sigma_label_ && sigma_label_ != kNoLabel) {\n      FSTERROR() << \"SigmaMatcher::Find: bad label (sigma)\";\n      error_ = true;\n      return false;\n    }\n    if (matcher_->Find(match_label)) {\n      sigma_match_ = kNoLabel;\n      return true;\n    } else if (has_sigma_ && match_label != 0 && match_label != kNoLabel &&\n               matcher_->Find(sigma_label_)) {\n      sigma_match_ = match_label;\n      return true;\n    } else {\n      return false;\n    }\n  }\n\n  bool Done() const final { return matcher_->Done(); }\n\n  const Arc &Value() const final {\n    if (sigma_match_ == kNoLabel) {\n      return matcher_->Value();\n    } else {\n      sigma_arc_ = matcher_->Value();\n      if (rewrite_both_) {\n        if (sigma_arc_.ilabel == sigma_label_) sigma_arc_.ilabel = sigma_match_;\n        if (sigma_arc_.olabel == sigma_label_) sigma_arc_.olabel = sigma_match_;\n      } else if (match_type_ == MATCH_INPUT) {\n        sigma_arc_.ilabel = sigma_match_;\n      } else {\n        sigma_arc_.olabel = sigma_match_;\n      }\n      return sigma_arc_;\n    }\n  }\n\n  void Next() final {\n    matcher_->Next();\n    if (matcher_->Done() && has_sigma_ && (sigma_match_ == kNoLabel) &&\n        (match_label_ > 0)) {\n      matcher_->Find(sigma_label_);\n      sigma_match_ = match_label_;\n    }\n  }\n\n  Weight Final(StateId s) const final { return matcher_->Final(s); }\n\n  ssize_t Priority(StateId s) final {\n    if (sigma_label_ != kNoLabel) {\n      SetState(s);\n      return has_sigma_ ? kRequirePriority : matcher_->Priority(s);\n    } else {\n      return matcher_->Priority(s);\n    }\n  }\n\n  const FST &GetFst() const override { return matcher_->GetFst(); }\n\n  uint64 Properties(uint64 props) const override;\n\n  uint32 Flags() const override {\n    if (sigma_label_ == kNoLabel || match_type_ == MATCH_NONE) {\n      return matcher_->Flags();\n    }\n    return matcher_->Flags() | kRequireMatch;\n  }\n\n  Label SigmaLabel() const { return sigma_label_; }\n\n private:\n  std::unique_ptr<M> matcher_;\n  MatchType match_type_;   // Type of match requested.\n  Label sigma_label_;      // Label that represents the sigma transition.\n  bool rewrite_both_;      // Rewrite both sides when both are sigma_label_?\n  bool has_sigma_;         // Are there sigmas at the current state?\n  Label sigma_match_;      // Current label that matches sigma transition.\n  mutable Arc sigma_arc_;  // Arc to return when sigma match.\n  Label match_label_;      // Label being matched.\n  bool error_;             // Error encountered?\n  StateId state_;          // Matcher state.\n};\n\ntemplate <class M>\ninline uint64 SigmaMatcher<M>::Properties(uint64 inprops) const {\n  auto outprops = matcher_->Properties(inprops);\n  if (error_) outprops |= kError;\n  if (match_type_ == MATCH_NONE) {\n    return outprops;\n  } else if (rewrite_both_) {\n    return outprops &\n           ~(kIDeterministic | kNonIDeterministic | kODeterministic |\n             kNonODeterministic | kILabelSorted | kNotILabelSorted |\n             kOLabelSorted | kNotOLabelSorted | kString);\n  } else if (match_type_ == MATCH_INPUT) {\n    return outprops &\n           ~(kIDeterministic | kNonIDeterministic | kODeterministic |\n             kNonODeterministic | kILabelSorted | kNotILabelSorted | kString |\n             kAcceptor);\n  } else if (match_type_ == MATCH_OUTPUT) {\n    return outprops &\n           ~(kIDeterministic | kNonIDeterministic | kODeterministic |\n             kNonODeterministic | kOLabelSorted | kNotOLabelSorted | kString |\n             kAcceptor);\n  } else {\n    // Shouldn't ever get here.\n    FSTERROR() << \"SigmaMatcher: Bad match type: \" << match_type_;\n    return 0;\n  }\n}\n\n// Flags for MultiEpsMatcher.\n\n// Return multi-epsilon arcs for Find(kNoLabel).\nconst uint32 kMultiEpsList = 0x00000001;\n\n// Return a kNolabel loop for Find(multi_eps).\nconst uint32 kMultiEpsLoop = 0x00000002;\n\n// MultiEpsMatcher: allows treating multiple non-0 labels as\n// non-consuming labels in addition to 0 that is always\n// non-consuming. Precise behavior controlled by 'flags' argument. By\n// default, the underlying matcher is constructed by\n// MultiEpsMatcher. The user can instead pass in this object; in that\n// case, MultiEpsMatcher takes its ownership iff 'own_matcher' is\n// true.\ntemplate <class M>\nclass MultiEpsMatcher {\n public:\n  using FST = typename M::FST;\n  using Arc = typename FST::Arc;\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  // This makes a copy of the FST (w/o 'matcher' arg).\n  MultiEpsMatcher(const FST &fst, MatchType match_type,\n                  uint32 flags = (kMultiEpsLoop | kMultiEpsList),\n                  M *matcher = nullptr, bool own_matcher = true)\n      : matcher_(matcher ? matcher : new M(fst, match_type)),\n        flags_(flags),\n        own_matcher_(matcher ? own_matcher : true) {\n    Init(match_type);\n  }\n\n  // This doesn't copy the FST.\n  MultiEpsMatcher(const FST *fst, MatchType match_type,\n                  uint32 flags = (kMultiEpsLoop | kMultiEpsList),\n                  M *matcher = nullptr, bool own_matcher = true)\n      : matcher_(matcher ? matcher : new M(fst, match_type)),\n        flags_(flags),\n        own_matcher_(matcher ? own_matcher : true) {\n    Init(match_type);\n  }\n\n  // This makes a copy of the FST.\n  MultiEpsMatcher(const MultiEpsMatcher<M> &matcher, bool safe = false)\n      : matcher_(new M(*matcher.matcher_, safe)),\n        flags_(matcher.flags_),\n        own_matcher_(true),\n        multi_eps_labels_(matcher.multi_eps_labels_),\n        loop_(matcher.loop_) {\n    loop_.nextstate = kNoStateId;\n  }\n\n  ~MultiEpsMatcher() {\n    if (own_matcher_) delete matcher_;\n  }\n\n  MultiEpsMatcher<M> *Copy(bool safe = false) const {\n    return new MultiEpsMatcher<M>(*this, safe);\n  }\n\n  MatchType Type(bool test) const { return matcher_->Type(test); }\n\n  void SetState(StateId state) {\n    matcher_->SetState(state);\n    loop_.nextstate = state;\n  }\n\n  bool Find(Label label);\n\n  bool Done() const { return done_; }\n\n  const Arc &Value() const { return current_loop_ ? loop_ : matcher_->Value(); }\n\n  void Next() {\n    if (!current_loop_) {\n      matcher_->Next();\n      done_ = matcher_->Done();\n      if (done_ && multi_eps_iter_ != multi_eps_labels_.End()) {\n        ++multi_eps_iter_;\n        while ((multi_eps_iter_ != multi_eps_labels_.End()) &&\n               !matcher_->Find(*multi_eps_iter_)) {\n          ++multi_eps_iter_;\n        }\n        if (multi_eps_iter_ != multi_eps_labels_.End()) {\n          done_ = false;\n        } else {\n          done_ = !matcher_->Find(kNoLabel);\n        }\n      }\n    } else {\n      done_ = true;\n    }\n  }\n\n  const FST &GetFst() const { return matcher_->GetFst(); }\n\n  uint64 Properties(uint64 props) const { return matcher_->Properties(props); }\n\n  const M *GetMatcher() const { return matcher_; }\n\n  Weight Final(StateId s) const { return matcher_->Final(s); }\n\n  uint32 Flags() const { return matcher_->Flags(); }\n\n  ssize_t Priority(StateId s) { return matcher_->Priority(s); }\n\n  void AddMultiEpsLabel(Label label) {\n    if (label == 0) {\n      FSTERROR() << \"MultiEpsMatcher: Bad multi-eps label: 0\";\n    } else {\n      multi_eps_labels_.Insert(label);\n    }\n  }\n\n  void RemoveMultiEpsLabel(Label label) {\n    if (label == 0) {\n      FSTERROR() << \"MultiEpsMatcher: Bad multi-eps label: 0\";\n    } else {\n      multi_eps_labels_.Erase(label);\n    }\n  }\n\n  void ClearMultiEpsLabels() { multi_eps_labels_.Clear(); }\n\n private:\n  void Init(MatchType match_type) {\n    if (match_type == MATCH_INPUT) {\n      loop_.ilabel = kNoLabel;\n      loop_.olabel = 0;\n    } else {\n      loop_.ilabel = 0;\n      loop_.olabel = kNoLabel;\n    }\n    loop_.weight = Weight::One();\n    loop_.nextstate = kNoStateId;\n  }\n\n  M *matcher_;\n  uint32 flags_;\n  bool own_matcher_;  // Does this class delete the matcher?\n\n  // Multi-eps label set.\n  CompactSet<Label, kNoLabel> multi_eps_labels_;\n  typename CompactSet<Label, kNoLabel>::const_iterator multi_eps_iter_;\n\n  bool current_loop_;  // Current arc is the implicit loop?\n  mutable Arc loop_;   // For non-consuming symbols.\n  bool done_;          // Matching done?\n\n  MultiEpsMatcher &operator=(const MultiEpsMatcher &) = delete;\n};\n\ntemplate <class M>\ninline bool MultiEpsMatcher<M>::Find(Label label) {\n  multi_eps_iter_ = multi_eps_labels_.End();\n  current_loop_ = false;\n  bool ret;\n  if (label == 0) {\n    ret = matcher_->Find(0);\n  } else if (label == kNoLabel) {\n    if (flags_ & kMultiEpsList) {\n      // Returns all non-consuming arcs (including epsilon).\n      multi_eps_iter_ = multi_eps_labels_.Begin();\n      while ((multi_eps_iter_ != multi_eps_labels_.End()) &&\n             !matcher_->Find(*multi_eps_iter_)) {\n        ++multi_eps_iter_;\n      }\n      if (multi_eps_iter_ != multi_eps_labels_.End()) {\n        ret = true;\n      } else {\n        ret = matcher_->Find(kNoLabel);\n      }\n    } else {\n      // Returns all epsilon arcs.\n      ret = matcher_->Find(kNoLabel);\n    }\n  } else if ((flags_ & kMultiEpsLoop) &&\n             multi_eps_labels_.Find(label) != multi_eps_labels_.End()) {\n    // Returns implicit loop.\n    current_loop_ = true;\n    ret = true;\n  } else {\n    ret = matcher_->Find(label);\n  }\n  done_ = !ret;\n  return ret;\n}\n\n// This class discards any implicit matches (e.g., the implicit epsilon\n// self-loops in the SortedMatcher). Matchers are most often used in\n// composition/intersection where the implicit matches are needed\n// e.g. for epsilon processing. However, if a matcher is simply being\n// used to look-up explicit label matches, this class saves the user\n// from having to check for and discard the unwanted implicit matches\n// themselves.\ntemplate <class M>\nclass ExplicitMatcher : public MatcherBase<typename M::Arc> {\n public:\n  using FST = typename M::FST;\n  using Arc = typename FST::Arc;\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  // This makes a copy of the FST.\n  ExplicitMatcher(const FST &fst, MatchType match_type, M *matcher = nullptr)\n      : matcher_(matcher ? matcher : new M(fst, match_type)),\n        match_type_(match_type),\n        error_(false) {}\n\n  // This doesn't copy the FST.\n  ExplicitMatcher(const FST *fst, MatchType match_type, M *matcher = nullptr)\n      : matcher_(matcher ? matcher : new M(fst, match_type)),\n        match_type_(match_type),\n        error_(false) {}\n\n  // This makes a copy of the FST.\n  ExplicitMatcher(const ExplicitMatcher<M> &matcher, bool safe = false)\n      : matcher_(new M(*matcher.matcher_, safe)),\n        match_type_(matcher.match_type_),\n        error_(matcher.error_) {}\n\n  ExplicitMatcher<M> *Copy(bool safe = false) const override {\n    return new ExplicitMatcher<M>(*this, safe);\n  }\n\n  MatchType Type(bool test) const override { return matcher_->Type(test); }\n\n  void SetState(StateId s) final { matcher_->SetState(s); }\n\n  bool Find(Label label) final {\n    matcher_->Find(label);\n    CheckArc();\n    return !Done();\n  }\n\n  bool Done() const final { return matcher_->Done(); }\n\n  const Arc &Value() const final { return matcher_->Value(); }\n\n  void Next() final {\n    matcher_->Next();\n    CheckArc();\n  }\n\n  Weight Final(StateId s) const final { return matcher_->Final(s); }\n\n  ssize_t Priority(StateId s) final { return matcher_->Priority(s); }\n\n  const FST &GetFst() const final { return matcher_->GetFst(); }\n\n  uint64 Properties(uint64 inprops) const override {\n    return matcher_->Properties(inprops);\n  }\n\n  const M *GetMatcher() const { return matcher_.get(); }\n\n  uint32 Flags() const override { return matcher_->Flags(); }\n\n private:\n  // Checks current arc if available and explicit. If not available, stops. If\n  // not explicit, checks next ones.\n  void CheckArc() {\n    for (; !matcher_->Done(); matcher_->Next()) {\n      const auto label = match_type_ == MATCH_INPUT ? matcher_->Value().ilabel\n                                                    : matcher_->Value().olabel;\n      if (label != kNoLabel) return;\n    }\n  }\n\n  std::unique_ptr<M> matcher_;\n  MatchType match_type_;  // Type of match requested.\n  bool error_;            // Error encountered?\n};\n\n// Generic matcher, templated on the FST definition.\n//\n// Here is a typical use:\n//\n//   Matcher<StdFst> matcher(fst, MATCH_INPUT);\n//   matcher.SetState(state);\n//   if (matcher.Find(label))\n//     for (; !matcher.Done(); matcher.Next()) {\n//       auto &arc = matcher.Value();\n//       ...\n//     }\ntemplate <class F>\nclass Matcher {\n public:\n  using FST = F;\n  using Arc = typename F::Arc;\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  // This makes a copy of the FST.\n  Matcher(const FST &fst, MatchType match_type)\n      : owned_fst_(fst.Copy()),\n        base_(owned_fst_->InitMatcher(match_type)) {\n    if (!base_) base_.reset(new SortedMatcher<FST>(owned_fst_.get(),\n                                                   match_type));\n  }\n\n  // This doesn't copy the FST.\n  Matcher(const FST *fst, MatchType match_type)\n      : base_(fst->InitMatcher(match_type)) {\n    if (!base_) base_.reset(new SortedMatcher<FST>(fst, match_type));\n  }\n\n  // This makes a copy of the FST.\n  Matcher(const Matcher<FST> &matcher, bool safe = false)\n      : base_(matcher.base_->Copy(safe)) { }\n\n  // Takes ownership of the provided matcher.\n  explicit Matcher(MatcherBase<Arc> *base_matcher)\n      : base_(base_matcher) { }\n\n  Matcher<FST> *Copy(bool safe = false) const {\n    return new Matcher<FST>(*this, safe);\n  }\n\n  MatchType Type(bool test) const { return base_->Type(test); }\n\n  void SetState(StateId s) { base_->SetState(s); }\n\n  bool Find(Label label) { return base_->Find(label); }\n\n  bool Done() const { return base_->Done(); }\n\n  const Arc &Value() const { return base_->Value(); }\n\n  void Next() { base_->Next(); }\n\n  const FST &GetFst() const {\n    return static_cast<const FST &>(base_->GetFst());\n  }\n\n  uint64 Properties(uint64 props) const { return base_->Properties(props); }\n\n  Weight Final(StateId s) const { return base_->Final(s); }\n\n  uint32 Flags() const { return base_->Flags() & kMatcherFlags; }\n\n  ssize_t Priority(StateId s) { return base_->Priority(s); }\n\n private:\n  std::unique_ptr<const FST> owned_fst_;\n  std::unique_ptr<MatcherBase<Arc>> base_;\n};\n\n}  // namespace fst\n\n#endif  // FST_MATCHER_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/memory.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// FST memory utilities.\n\n#ifndef FST_MEMORY_H_\n#define FST_MEMORY_H_\n\n#include <list>\n#include <memory>\n#include <utility>\n#include <vector>\n\n#include <fst/types.h>\n#include <fst/log.h>\n#include <fstream>\n\nnamespace fst {\n\n// Default block allocation size.\nconstexpr int kAllocSize = 64;\n\n// Minimum number of allocations per block.\nconstexpr int kAllocFit = 4;\n\n// Base class for MemoryArena that allows (e.g.) MemoryArenaCollection to\n// easily manipulate collections of variously sized arenas.\nclass MemoryArenaBase {\n public:\n  virtual ~MemoryArenaBase() {}\n  virtual size_t Size() const = 0;\n};\n\nnamespace internal {\n\n// Allocates 'size' unintialized memory chunks of size object_size from\n// underlying blocks of (at least) size 'block_size * object_size'.\n// All blocks are freed when this class is deleted. Result of allocate() will\n// be aligned to object_size.\ntemplate <size_t object_size>\nclass MemoryArenaImpl : public MemoryArenaBase {\n public:\n  enum { kObjectSize = object_size };\n\n  explicit MemoryArenaImpl(size_t block_size = kAllocSize)\n      : block_size_(block_size * kObjectSize), block_pos_(0) {\n    blocks_.emplace_front(new char[block_size_]);\n  }\n\n  void *Allocate(size_t size) {\n    const auto byte_size = size * kObjectSize;\n    if (byte_size * kAllocFit > block_size_) {\n      // Large block; adds new large block.\n      auto *ptr = new char[byte_size];\n      blocks_.emplace_back(ptr);\n      return ptr;\n    }\n    if (block_pos_ + byte_size > block_size_) {\n      // Doesn't fit; adds new standard block.\n      auto *ptr = new char[block_size_];\n      block_pos_ = 0;\n      blocks_.emplace_front(ptr);\n    }\n    // Fits; uses current block.\n    auto *ptr = blocks_.front().get() + block_pos_;\n    block_pos_ += byte_size;\n    return ptr;\n  }\n\n  size_t Size() const override { return kObjectSize; }\n\n private:\n  const size_t block_size_;  // Default block size in bytes.\n  size_t block_pos_;   // Current position in block in bytes.\n  std::list<std::unique_ptr<char[]>> blocks_;  // List of allocated blocks.\n};\n\n}  // namespace internal\n\ntemplate <typename T>\nusing MemoryArena = internal::MemoryArenaImpl<sizeof(T)>;\n\n// Base class for MemoryPool that allows (e.g.) MemoryPoolCollection to easily\n// manipulate collections of variously sized pools.\nclass MemoryPoolBase {\n public:\n  virtual ~MemoryPoolBase() {}\n  virtual size_t Size() const = 0;\n};\n\nnamespace internal {\n\n// Allocates and frees initially uninitialized memory chunks of size\n// object_size. Keeps an internal list of freed chunks that are reused (as is)\n// on the next allocation if available. Chunks are constructed in blocks of size\n// 'pool_size'.\ntemplate <size_t object_size>\nclass MemoryPoolImpl : public MemoryPoolBase {\n public:\n  enum { kObjectSize = object_size };\n\n  struct Link {\n    char buf[kObjectSize];\n    Link *next;\n  };\n\n  explicit MemoryPoolImpl(size_t pool_size)\n      : mem_arena_(pool_size), free_list_(nullptr) {}\n\n  void *Allocate() {\n    if (free_list_ == nullptr) {\n      auto *link = static_cast<Link *>(mem_arena_.Allocate(1));\n      link->next = nullptr;\n      return link;\n    } else {\n      auto *link = free_list_;\n      free_list_ = link->next;\n      return link;\n    }\n  }\n\n  void Free(void *ptr) {\n    if (ptr) {\n      auto *link = static_cast<Link *>(ptr);\n      link->next = free_list_;\n      free_list_ = link;\n    }\n  }\n\n  size_t Size() const override { return kObjectSize; }\n\n private:\n  MemoryArena<Link> mem_arena_;\n  Link *free_list_;\n\n  MemoryPoolImpl(const MemoryPoolImpl &) = delete;\n  MemoryPoolImpl &operator=(const MemoryPoolImpl &) = delete;\n};\n\n}  // namespace internal\n\n// Allocates and frees initially uninitialized memory chunks of size sizeof(T).\n// All memory is freed when the class is deleted. The result of Allocate() will\n// be suitably memory-aligned. Combined with placement operator new and destroy\n// functions for the T class, this can be used to improve allocation efficiency.\n// See nlp/fst/lib/visit.h (global new) and nlp/fst/lib/dfs-visit.h (class new)\n// for examples.\ntemplate <typename T>\nclass MemoryPool : public internal::MemoryPoolImpl<sizeof(T)> {\n public:\n  // 'pool_size' specifies the size of the initial pool and how it is extended.\n  MemoryPool(size_t pool_size = kAllocSize)\n      : internal::MemoryPoolImpl<sizeof(T)>(pool_size) {}\n};\n\n// Stores a collection of memory arenas.\nclass MemoryArenaCollection {\n public:\n  // 'block_size' specifies the block size of the arenas.\n  explicit MemoryArenaCollection(size_t block_size = kAllocSize)\n      : block_size_(block_size), ref_count_(1) {}\n\n  template <typename T>\n  MemoryArena<T> *Arena() {\n    if (sizeof(T) >= arenas_.size()) arenas_.resize(sizeof(T) + 1);\n    MemoryArenaBase *arena = arenas_[sizeof(T)].get();\n    if (arena == nullptr) {\n      arena = new MemoryArena<T>(block_size_);\n      arenas_[sizeof(T)].reset(arena);\n    }\n    return static_cast<MemoryArena<T> *>(arena);\n  }\n\n  size_t BlockSize() const { return block_size_; }\n\n  size_t RefCount() const { return ref_count_; }\n\n  size_t IncrRefCount() { return ++ref_count_; }\n\n  size_t DecrRefCount() { return --ref_count_; }\n\n private:\n  size_t block_size_;\n  size_t ref_count_;\n  std::vector<std::unique_ptr<MemoryArenaBase>> arenas_;\n};\n\n// Stores a collection of memory pools\nclass MemoryPoolCollection {\n public:\n  // 'pool_size' specifies the size of initial pool and how it is extended.\n  explicit MemoryPoolCollection(size_t pool_size = kAllocSize)\n      : pool_size_(pool_size), ref_count_(1) {}\n\n  template <typename T>\n  MemoryPool<T> *Pool() {\n    if (sizeof(T) >= pools_.size()) pools_.resize(sizeof(T) + 1);\n    MemoryPoolBase *pool = pools_[sizeof(T)].get();\n    if (pool == nullptr) {\n      pool = new MemoryPool<T>(pool_size_);\n      pools_[sizeof(T)].reset(pool);\n    }\n    return static_cast<MemoryPool<T> *>(pool);\n  }\n\n  size_t PoolSize() const { return pool_size_; }\n\n  size_t RefCount() const { return ref_count_; }\n\n  size_t IncrRefCount() { return ++ref_count_; }\n\n  size_t DecrRefCount() { return --ref_count_; }\n\n private:\n  size_t pool_size_;\n  size_t ref_count_;\n  std::vector<std::unique_ptr<MemoryPoolBase>> pools_;\n};\n\n// STL allocator using memory arenas. Memory is allocated from underlying\n// blocks of size 'block_size * sizeof(T)'. Memory is freed only when all\n// objects using this allocator are destroyed and there is otherwise no reuse\n// (unlike PoolAllocator).\n//\n// This allocator has object-local state so it should not be used with splicing\n// or swapping operations between objects created with different allocators nor\n// should it be used if copies must be thread-safe. The result of allocate()\n// will be suitably memory-aligned.\ntemplate <typename T>\nclass BlockAllocator {\n public:\n  using Allocator = std::allocator<T>;\n  using size_type = typename Allocator::size_type;\n  using difference_type = typename Allocator::difference_type;\n  using pointer = typename Allocator::pointer;\n  using const_pointer = typename Allocator::const_pointer;\n  using reference = typename Allocator::reference;\n  using const_reference = typename Allocator::const_reference;\n  using value_type = typename Allocator::value_type;\n\n  template <typename U>\n  struct rebind {\n    using other = BlockAllocator<U>;\n  };\n\n  explicit BlockAllocator(size_t block_size = kAllocSize)\n      : arenas_(new MemoryArenaCollection(block_size)) {}\n\n  BlockAllocator(const BlockAllocator<T> &arena_alloc)\n      : arenas_(arena_alloc.Arenas()) {\n    Arenas()->IncrRefCount();\n  }\n\n  template <typename U>\n  explicit BlockAllocator(const BlockAllocator<U> &arena_alloc)\n      : arenas_(arena_alloc.Arenas()) {\n    Arenas()->IncrRefCount();\n  }\n\n  ~BlockAllocator() {\n    if (Arenas()->DecrRefCount() == 0) delete Arenas();\n  }\n\n  pointer address(reference ref) const { return Allocator().address(ref); }\n\n  const_pointer address(const_reference ref) const {\n    return Allocator().address(ref);\n  }\n\n  size_type max_size() const { return Allocator().max_size(); }\n\n  template <class U, class... Args>\n  void construct(U *p, Args &&... args) {\n    Allocator().construct(p, std::forward<Args>(args)...);\n  }\n\n  void destroy(pointer p) { Allocator().destroy(p); }\n\n  pointer allocate(size_type n, const void *hint = nullptr) {\n    if (n * kAllocFit <= kAllocSize) {\n      return static_cast<pointer>(Arena()->Allocate(n));\n    } else {\n      return Allocator().allocate(n, hint);\n    }\n  }\n\n  void deallocate(pointer p, size_type n) {\n    if (n * kAllocFit > kAllocSize) Allocator().deallocate(p, n);\n  }\n\n  MemoryArenaCollection *Arenas() const { return arenas_; }\n\n private:\n  MemoryArena<T> *Arena() { return arenas_->Arena<T>(); }\n\n  MemoryArenaCollection *arenas_;\n\n  BlockAllocator<T> operator=(const BlockAllocator<T> &);\n};\n\ntemplate <typename T, typename U>\nbool operator==(const BlockAllocator<T> &alloc1,\n                const BlockAllocator<U> &alloc2) {\n  return false;\n}\n\ntemplate <typename T, typename U>\nbool operator!=(const BlockAllocator<T> &alloc1,\n                const BlockAllocator<U> &alloc2) {\n  return true;\n}\n\n// STL allocator using memory pools. Memory is allocated from underlying\n// blocks of size 'block_size * sizeof(T)'. Keeps an internal list of freed\n// chunks thare are reused on the next allocation.\n//\n// This allocator has object-local state so it should not be used with splicing\n// or swapping operations between objects created with different allocators nor\n// should it be used if copies must be thread-safe. The result of allocate()\n// will be suitably memory-aligned.\ntemplate <typename T>\nclass PoolAllocator {\n public:\n  using Allocator = std::allocator<T>;\n  using size_type = typename Allocator::size_type;\n  using difference_type = typename Allocator::difference_type;\n  using pointer = typename Allocator::pointer;\n  using const_pointer = typename Allocator::const_pointer;\n  using reference = typename Allocator::reference;\n  using const_reference = typename Allocator::const_reference;\n  using value_type = typename Allocator::value_type;\n\n  template <typename U>\n  struct rebind {\n    using other = PoolAllocator<U>;\n  };\n\n  explicit PoolAllocator(size_t pool_size = kAllocSize)\n      : pools_(new MemoryPoolCollection(pool_size)) {}\n\n  PoolAllocator(const PoolAllocator<T> &pool_alloc)\n      : pools_(pool_alloc.Pools()) {\n    Pools()->IncrRefCount();\n  }\n\n  template <typename U>\n  explicit PoolAllocator(const PoolAllocator<U> &pool_alloc)\n      : pools_(pool_alloc.Pools()) {\n    Pools()->IncrRefCount();\n  }\n\n  ~PoolAllocator() {\n    if (Pools()->DecrRefCount() == 0) delete Pools();\n  }\n\n  pointer address(reference ref) const { return Allocator().address(ref); }\n\n  const_pointer address(const_reference ref) const {\n    return Allocator().address(ref);\n  }\n\n  size_type max_size() const { return Allocator().max_size(); }\n\n  template <class U, class... Args>\n  void construct(U *p, Args &&... args) {\n    Allocator().construct(p, std::forward<Args>(args)...);\n  }\n\n  void destroy(pointer p) { Allocator().destroy(p); }\n\n  pointer allocate(size_type n, const void *hint = nullptr) {\n    if (n == 1) {\n      return static_cast<pointer>(Pool<1>()->Allocate());\n    } else if (n == 2) {\n      return static_cast<pointer>(Pool<2>()->Allocate());\n    } else if (n <= 4) {\n      return static_cast<pointer>(Pool<4>()->Allocate());\n    } else if (n <= 8) {\n      return static_cast<pointer>(Pool<8>()->Allocate());\n    } else if (n <= 16) {\n      return static_cast<pointer>(Pool<16>()->Allocate());\n    } else if (n <= 32) {\n      return static_cast<pointer>(Pool<32>()->Allocate());\n    } else if (n <= 64) {\n      return static_cast<pointer>(Pool<64>()->Allocate());\n    } else {\n      return Allocator().allocate(n, hint);\n    }\n  }\n\n  void deallocate(pointer p, size_type n) {\n    if (n == 1) {\n      Pool<1>()->Free(p);\n    } else if (n == 2) {\n      Pool<2>()->Free(p);\n    } else if (n <= 4) {\n      Pool<4>()->Free(p);\n    } else if (n <= 8) {\n      Pool<8>()->Free(p);\n    } else if (n <= 16) {\n      Pool<16>()->Free(p);\n    } else if (n <= 32) {\n      Pool<32>()->Free(p);\n    } else if (n <= 64) {\n      Pool<64>()->Free(p);\n    } else {\n      Allocator().deallocate(p, n);\n    }\n  }\n\n  MemoryPoolCollection *Pools() const { return pools_; }\n\n private:\n  template <int n>\n  struct TN {\n    T buf[n];\n  };\n\n  template <int n>\n  MemoryPool<TN<n>> *Pool() {\n    return pools_->Pool<TN<n>>();\n  }\n\n  MemoryPoolCollection *pools_;\n\n  PoolAllocator<T> operator=(const PoolAllocator<T> &);\n};\n\ntemplate <typename T, typename U>\nbool operator==(const PoolAllocator<T> &alloc1,\n                const PoolAllocator<U> &alloc2) {\n  return false;\n}\n\ntemplate <typename T, typename U>\nbool operator!=(const PoolAllocator<T> &alloc1,\n                const PoolAllocator<U> &alloc2) {\n  return true;\n}\n\n}  // namespace fst\n\n#endif  // FST_MEMORY_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/minimize.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Functions and classes to minimize an FST.\n\n#ifndef FST_MINIMIZE_H_\n#define FST_MINIMIZE_H_\n\n#include <cmath>\n\n#include <algorithm>\n#include <map>\n#include <queue>\n#include <utility>\n#include <vector>\n\n#include <fst/log.h>\n\n#include <fst/arcsort.h>\n#include <fst/connect.h>\n#include <fst/dfs-visit.h>\n#include <fst/encode.h>\n#include <fst/factor-weight.h>\n#include <fst/fst.h>\n#include <fst/mutable-fst.h>\n#include <fst/partition.h>\n#include <fst/push.h>\n#include <fst/queue.h>\n#include <fst/reverse.h>\n#include <fst/shortest-distance.h>\n#include <fst/state-map.h>\n\n\nnamespace fst {\nnamespace internal {\n\n// Comparator for creating partition.\ntemplate <class Arc>\nclass StateComparator {\n public:\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  StateComparator(const Fst<Arc> &fst, const Partition<StateId> &partition)\n      : fst_(fst), partition_(partition) {}\n\n  // Compares state x with state y based on sort criteria.\n  bool operator()(const StateId x, const StateId y) const {\n    // Checks for final state equivalence.\n    const auto xfinal = fst_.Final(x).Hash();\n    const auto yfinal = fst_.Final(y).Hash();\n    if (xfinal < yfinal) {\n      return true;\n    } else if (xfinal > yfinal) {\n      return false;\n    }\n    // Checks for number of arcs.\n    if (fst_.NumArcs(x) < fst_.NumArcs(y)) return true;\n    if (fst_.NumArcs(x) > fst_.NumArcs(y)) return false;\n    // If the number of arcs are equal, checks for arc match.\n    for (ArcIterator<Fst<Arc>> aiter1(fst_, x), aiter2(fst_, y);\n         !aiter1.Done() && !aiter2.Done(); aiter1.Next(), aiter2.Next()) {\n      const auto &arc1 = aiter1.Value();\n      const auto &arc2 = aiter2.Value();\n      if (arc1.ilabel < arc2.ilabel) return true;\n      if (arc1.ilabel > arc2.ilabel) return false;\n      if (partition_.ClassId(arc1.nextstate) <\n          partition_.ClassId(arc2.nextstate))\n        return true;\n      if (partition_.ClassId(arc1.nextstate) >\n          partition_.ClassId(arc2.nextstate))\n        return false;\n    }\n    return false;\n  }\n\n private:\n  const Fst<Arc> &fst_;\n  const Partition<StateId> &partition_;\n};\n\n// Computes equivalence classes for cyclic unweighted acceptors. For cyclic\n// minimization we use the classic Hopcroft minimization algorithm, which has\n// complexity O(E log V) where E is the number of arcs and V is the number of\n// states.\n//\n// For more information, see:\n//\n//  Hopcroft, J. 1971. An n Log n algorithm for minimizing states in a finite\n//  automaton. Ms, Stanford University.\n//\n// Note: the original presentation of the paper was for a finite automaton (==\n// deterministic, unweighted acceptor), but we also apply it to the\n// nondeterministic case, where it is also applicable as long as the semiring is\n// idempotent (if the semiring is not idempotent, there are some complexities\n// in keeping track of the weight when there are multiple arcs to states that\n// will be merged, and we don't deal with this).\ntemplate <class Arc, class Queue>\nclass CyclicMinimizer {\n public:\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using ClassId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n  using RevArc = ReverseArc<Arc>;\n\n  explicit CyclicMinimizer(const ExpandedFst<Arc> &fst) {\n    Initialize(fst);\n    Compute(fst);\n  }\n\n  const Partition<StateId> &GetPartition() const { return P_; }\n\n private:\n  // StateILabelHasher is a hashing object that computes a hash-function\n  // of an FST state that depends only on the set of ilabels on arcs leaving\n  // the state [note: it assumes that the arcs are ilabel-sorted].\n  // In order to work correctly for non-deterministic automata, multiple\n  // instances of the same ilabel count the same as a single instance.\n  class StateILabelHasher {\n   public:\n    explicit StateILabelHasher(const Fst<Arc> &fst) : fst_(fst) {}\n\n    using Label = typename Arc::Label;\n    using StateId = typename Arc::StateId;\n\n    size_t operator()(const StateId s) {\n      const size_t p1 = 7603;\n      const size_t p2 = 433024223;\n      size_t result = p2;\n      size_t current_ilabel = kNoLabel;\n      for (ArcIterator<Fst<Arc>> aiter(fst_, s); !aiter.Done(); aiter.Next()) {\n        Label this_ilabel = aiter.Value().ilabel;\n        if (this_ilabel != current_ilabel) {  // Ignores repeats.\n          result = p1 * result + this_ilabel;\n          current_ilabel = this_ilabel;\n        }\n      }\n      return result;\n    }\n\n   private:\n    const Fst<Arc> &fst_;\n  };\n\n  class ArcIterCompare {\n   public:\n    explicit ArcIterCompare(const Partition<StateId> &partition)\n        : partition_(partition) {}\n\n    ArcIterCompare(const ArcIterCompare &comp) : partition_(comp.partition_) {}\n\n    // Compares two iterators based on their input labels.\n    bool operator()(const ArcIterator<Fst<RevArc>> *x,\n                    const ArcIterator<Fst<RevArc>> *y) const {\n      const auto &xarc = x->Value();\n      const auto &yarc = y->Value();\n      return xarc.ilabel > yarc.ilabel;\n    }\n\n   private:\n    const Partition<StateId> &partition_;\n  };\n\n  using ArcIterQueue =\n      std::priority_queue<ArcIterator<Fst<RevArc>> *,\n                          std::vector<ArcIterator<Fst<RevArc>> *>,\n                          ArcIterCompare>;\n\n private:\n  // Prepartitions the space into equivalence classes. We ensure that final and\n  // non-final states always go into different equivalence classes, and we use\n  // class StateILabelHasher to make sure that most of the time, states with\n  // different sets of ilabels on arcs leaving them, go to different partitions.\n  // Note: for the O(n) guarantees we don't rely on the goodness of this\n  // hashing function---it just provides a bonus speedup.\n  void PrePartition(const ExpandedFst<Arc> &fst) {\n    VLOG(5) << \"PrePartition\";\n    StateId next_class = 0;\n    auto num_states = fst.NumStates();\n    // Allocates a temporary vector to store the initial class mappings, so that\n    // we can allocate the classes all at once.\n    std::vector<StateId> state_to_initial_class(num_states);\n    {\n      // We maintain two maps from hash-value to class---one for final states\n      // (final-prob == One()) and one for non-final states\n      // (final-prob == Zero()). We are processing unweighted acceptors, so the\n      // are the only two possible values.\n      using HashToClassMap = std::unordered_map<size_t, StateId>;\n      HashToClassMap hash_to_class_nonfinal;\n      HashToClassMap hash_to_class_final;\n      StateILabelHasher hasher(fst);\n      for (StateId s = 0; s < num_states; ++s) {\n        size_t hash = hasher(s);\n        HashToClassMap &this_map =\n            (fst.Final(s) != Weight::Zero() ? hash_to_class_final\n                                            : hash_to_class_nonfinal);\n        // Avoids two map lookups by using 'insert' instead of 'find'.\n        auto p = this_map.insert(std::make_pair(hash, next_class));\n        state_to_initial_class[s] = p.second ? next_class++ : p.first->second;\n      }\n      // Lets the unordered_maps go out of scope before we allocate the classes,\n      // to reduce the maximum amount of memory used.\n    }\n    P_.AllocateClasses(next_class);\n    for (StateId s = 0; s < num_states; ++s) {\n      P_.Add(s, state_to_initial_class[s]);\n    }\n    for (StateId c = 0; c < next_class; ++c) L_.Enqueue(c);\n    VLOG(5) << \"Initial Partition: \" << P_.NumClasses();\n  }\n\n  // Creates inverse transition Tr_ = rev(fst), loops over states in FST and\n  // splits on final, creating two blocks in the partition corresponding to\n  // final, non-final.\n  void Initialize(const ExpandedFst<Arc> &fst) {\n    // Constructs Tr.\n    Reverse(fst, &Tr_);\n    ILabelCompare<RevArc> ilabel_comp;\n    ArcSort(&Tr_, ilabel_comp);\n    // Tells the partition how many elements to allocate. The first state in\n    // Tr_ is super-final state.\n    P_.Initialize(Tr_.NumStates() - 1);\n    // Prepares initial partition.\n    PrePartition(fst);\n    // Allocates arc iterator queue.\n    ArcIterCompare comp(P_);\n    aiter_queue_.reset(new ArcIterQueue(comp));\n  }\n  // Partitions all classes with destination C.\n  void Split(ClassId C) {\n    // Prepares priority queue: opens arc iterator for each state in C, and\n    // inserts into priority queue.\n    for (PartitionIterator<StateId> siter(P_, C); !siter.Done(); siter.Next()) {\n      StateId s = siter.Value();\n      if (Tr_.NumArcs(s + 1)) {\n        aiter_queue_->push(new ArcIterator<Fst<RevArc>>(Tr_, s + 1));\n      }\n    }\n    // Now pops arc iterator from queue, splits entering equivalence class, and\n    // re-inserts updated iterator into queue.\n    Label prev_label = -1;\n    while (!aiter_queue_->empty()) {\n      std::unique_ptr<ArcIterator<Fst<RevArc>>> aiter(aiter_queue_->top());\n      aiter_queue_->pop();\n      if (aiter->Done()) continue;\n      const auto &arc = aiter->Value();\n      auto from_state = aiter->Value().nextstate - 1;\n      auto from_label = arc.ilabel;\n      if (prev_label != from_label) P_.FinalizeSplit(&L_);\n      auto from_class = P_.ClassId(from_state);\n      if (P_.ClassSize(from_class) > 1) P_.SplitOn(from_state);\n      prev_label = from_label;\n      aiter->Next();\n      if (!aiter->Done()) aiter_queue_->push(aiter.release());\n    }\n    P_.FinalizeSplit(&L_);\n  }\n\n  // Main loop for Hopcroft minimization.\n  void Compute(const Fst<Arc> &fst) {\n    // Processes active classes (FIFO, or FILO).\n    while (!L_.Empty()) {\n      const auto C = L_.Head();\n      L_.Dequeue();\n      Split(C);  // Splits on C, all labels in C.\n    }\n  }\n\n private:\n  // Partioning of states into equivalence classes.\n  Partition<StateId> P_;\n  // Set of active classes to be processed in partition P.\n  Queue L_;\n  // Reverses transition function.\n  VectorFst<RevArc> Tr_;\n  // Priority queue of open arc iterators for all states in the splitter\n  // equivalence class.\n  std::unique_ptr<ArcIterQueue> aiter_queue_;\n};\n\n// Computes equivalence classes for acyclic FST.\n//\n// Complexity:\n//\n//   O(E)\n//\n// where E is the number of arcs.\n//\n// For more information, see:\n//\n// Revuz, D. 1992. Minimization of acyclic deterministic automata in linear\n// time. Theoretical Computer Science 92(1): 181-189.\ntemplate <class Arc>\nclass AcyclicMinimizer {\n public:\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using ClassId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  explicit AcyclicMinimizer(const ExpandedFst<Arc> &fst) {\n    Initialize(fst);\n    Refine(fst);\n  }\n\n  const Partition<StateId> &GetPartition() { return partition_; }\n\n private:\n  // DFS visitor to compute the height (distance) to final state.\n  class HeightVisitor {\n   public:\n    HeightVisitor() : max_height_(0), num_states_(0) {}\n\n    // Invoked before DFS visit.\n    void InitVisit(const Fst<Arc> &fst) {}\n\n    // Invoked when state is discovered (2nd arg is DFS tree root).\n    bool InitState(StateId s, StateId root) {\n      // Extends height array and initialize height (distance) to 0.\n      for (StateId i = height_.size(); i <= s; ++i) height_.push_back(-1);\n      if (s >= num_states_) num_states_ = s + 1;\n      return true;\n    }\n\n    // Invoked when tree arc examined (to undiscovered state).\n    bool TreeArc(StateId s, const Arc &arc) { return true; }\n\n    // Invoked when back arc examined (to unfinished state).\n    bool BackArc(StateId s, const Arc &arc) { return true; }\n\n    // Invoked when forward or cross arc examined (to finished state).\n    bool ForwardOrCrossArc(StateId s, const Arc &arc) {\n      if (height_[arc.nextstate] + 1 > height_[s]) {\n        height_[s] = height_[arc.nextstate] + 1;\n      }\n      return true;\n    }\n\n    // Invoked when state finished (parent is kNoStateId for tree root).\n    void FinishState(StateId s, StateId parent, const Arc *parent_arc) {\n      if (height_[s] == -1) height_[s] = 0;\n      const auto h = height_[s] + 1;\n      if (parent >= 0) {\n        if (h > height_[parent]) height_[parent] = h;\n        if (h > max_height_) max_height_ = h;\n      }\n    }\n\n    // Invoked after DFS visit.\n    void FinishVisit() {}\n\n    size_t max_height() const { return max_height_; }\n\n    const std::vector<StateId> &height() const { return height_; }\n\n    size_t num_states() const { return num_states_; }\n\n   private:\n    std::vector<StateId> height_;\n    size_t max_height_;\n    size_t num_states_;\n  };\n\n private:\n  // Cluster states according to height (distance to final state)\n  void Initialize(const Fst<Arc> &fst) {\n    // Computes height (distance to final state).\n    HeightVisitor hvisitor;\n    DfsVisit(fst, &hvisitor);\n    // Creates initial partition based on height.\n    partition_.Initialize(hvisitor.num_states());\n    partition_.AllocateClasses(hvisitor.max_height() + 1);\n    const auto &hstates = hvisitor.height();\n    for (StateId s = 0; s < hstates.size(); ++s) partition_.Add(s, hstates[s]);\n  }\n\n  // Refines states based on arc sort (out degree, arc equivalence).\n  void Refine(const Fst<Arc> &fst) {\n    using EquivalenceMap = std::map<StateId, StateId, StateComparator<Arc>>;\n    StateComparator<Arc> comp(fst, partition_);\n    // Starts with tail (height = 0).\n    auto height = partition_.NumClasses();\n    for (StateId h = 0; h < height; ++h) {\n      EquivalenceMap equiv_classes(comp);\n      // Sorts states within equivalence class.\n      PartitionIterator<StateId> siter(partition_, h);\n      equiv_classes[siter.Value()] = h;\n      for (siter.Next(); !siter.Done(); siter.Next()) {\n        auto insert_result =\n            equiv_classes.insert(std::make_pair(siter.Value(), kNoStateId));\n        if (insert_result.second) {\n          insert_result.first->second = partition_.AddClass();\n        }\n      }\n      // Creates refined partition.\n      for (siter.Reset(); !siter.Done();) {\n        const auto s = siter.Value();\n        const auto old_class = partition_.ClassId(s);\n        const auto new_class = equiv_classes[s];\n        // A move operation can invalidate the iterator, so we first update\n        // the iterator to the next element before we move the current element\n        // out of the list.\n        siter.Next();\n        if (old_class != new_class) partition_.Move(s, new_class);\n      }\n    }\n  }\n\n private:\n  Partition<StateId> partition_;\n};\n\n// Given a partition and a Mutable FST, merges states of Fst in place (i.e.,\n// destructively). Merging works by taking the first state in a class of the\n// partition to be the representative state for the class. Each arc is then\n// reconnected to this state. All states in the class are merged by adding\n// their arcs to the representative state.\ntemplate <class Arc>\nvoid MergeStates(const Partition<typename Arc::StateId> &partition,\n                 MutableFst<Arc> *fst) {\n  using StateId = typename Arc::StateId;\n  std::vector<StateId> state_map(partition.NumClasses());\n  for (StateId i = 0; i < partition.NumClasses(); ++i) {\n    PartitionIterator<StateId> siter(partition, i);\n    state_map[i] = siter.Value();  // First state in partition.\n  }\n  // Relabels destination states.\n  for (StateId c = 0; c < partition.NumClasses(); ++c) {\n    for (PartitionIterator<StateId> siter(partition, c); !siter.Done();\n         siter.Next()) {\n      const auto s = siter.Value();\n      for (MutableArcIterator<MutableFst<Arc>> aiter(fst, s); !aiter.Done();\n           aiter.Next()) {\n        auto arc = aiter.Value();\n        arc.nextstate = state_map[partition.ClassId(arc.nextstate)];\n        if (s == state_map[c]) {  // For the first state, just sets destination.\n          aiter.SetValue(arc);\n        } else {\n          fst->AddArc(state_map[c], arc);\n        }\n      }\n    }\n  }\n  fst->SetStart(state_map[partition.ClassId(fst->Start())]);\n  Connect(fst);\n}\n\ntemplate <class Arc>\nvoid AcceptorMinimize(MutableFst<Arc> *fst,\n                      bool allow_acyclic_minimization = true) {\n  if (!(fst->Properties(kAcceptor | kUnweighted, true) ==\n        (kAcceptor | kUnweighted))) {\n    FSTERROR() << \"FST is not an unweighted acceptor\";\n    fst->SetProperties(kError, kError);\n    return;\n  }\n  // Connects FST before minimization, handles disconnected states.\n  Connect(fst);\n  if (fst->NumStates() == 0) return;\n  if (allow_acyclic_minimization && fst->Properties(kAcyclic, true)) {\n    // Acyclic minimization (Revuz).\n    VLOG(2) << \"Acyclic minimization\";\n    ArcSort(fst, ILabelCompare<Arc>());\n    AcyclicMinimizer<Arc> minimizer(*fst);\n    MergeStates(minimizer.GetPartition(), fst);\n  } else {\n    // Either the FST has cycles, or it's generated from non-deterministic input\n    // (which the Revuz algorithm can't handle), so use the cyclic minimization\n    // algorithm of Hopcroft.\n    VLOG(2) << \"Cyclic minimization\";\n    CyclicMinimizer<Arc, LifoQueue<typename Arc::StateId>> minimizer(*fst);\n    MergeStates(minimizer.GetPartition(), fst);\n  }\n  // Merges in appropriate semiring\n  ArcUniqueMapper<Arc> mapper(*fst);\n  StateMap(fst, mapper);\n}\n\n}  // namespace internal\n\n// In place minimization of deterministic weighted automata and transducers,\n// and also non-deterministic ones if they use an idempotent semiring.\n// For transducers, if the 'sfst' argument is not null, the algorithm\n// produces a compact factorization of the minimal transducer.\n//\n// In the acyclic deterministic case, we use an algorithm from Revuz that is\n// linear in the number of arcs (edges) in the machine.\n//\n// In the cyclic or non-deterministic case, we use the classical Hopcroft\n// minimization (which was presented for the deterministic case but which\n// also works for non-deterministic FSTs); this has complexity O(e log v).\n//\ntemplate <class Arc>\nvoid Minimize(MutableFst<Arc> *fst, MutableFst<Arc> *sfst = nullptr,\n              float delta = kShortestDelta, bool allow_nondet = false) {\n  using Weight = typename Arc::Weight;\n  const auto props = fst->Properties(\n      kAcceptor | kIDeterministic | kWeighted | kUnweighted, true);\n  bool allow_acyclic_minimization;\n  if (props & kIDeterministic) {\n    allow_acyclic_minimization = true;\n  } else {\n    // Our approach to minimization of non-deterministic FSTs will only work in\n    // idempotent semirings---for non-deterministic inputs, a state could have\n    // multiple transitions to states that will get merged, and we'd have to\n    // sum their weights. The algorithm doesn't handle that.\n    if (!(Weight::Properties() & kIdempotent)) {\n      fst->SetProperties(kError, kError);\n      FSTERROR() << \"Cannot minimize a non-deterministic FST over a \"\n                    \"non-idempotent semiring\";\n      return;\n    } else if (!allow_nondet) {\n      fst->SetProperties(kError, kError);\n      FSTERROR() << \"Refusing to minimize a non-deterministic FST with \"\n                 << \"allow_nondet = false\";\n      return;\n    }\n    // The Revuz algorithm won't work for nondeterministic inputs, so if the\n    // input is nondeterministic, we'll have to pass a bool saying not to use\n    // that algorithm. We check at this level rather than in AcceptorMinimize(),\n    // because it's possible that the FST at this level could be deterministic,\n    // but a harmless type of non-determinism could be introduced by Encode()\n    // (thanks to kEncodeWeights, if the FST has epsilons and has a final\n    // weight with weights equal to some epsilon arc.)\n    allow_acyclic_minimization = false;\n  }\n  if (!(props & kAcceptor)) {  // Weighted transducer.\n    VectorFst<GallicArc<Arc, GALLIC_LEFT>> gfst;\n    ArcMap(*fst, &gfst, ToGallicMapper<Arc, GALLIC_LEFT>());\n    fst->DeleteStates();\n    gfst.SetProperties(kAcceptor, kAcceptor);\n    Push(&gfst, REWEIGHT_TO_INITIAL, delta);\n    ArcMap(&gfst, QuantizeMapper<GallicArc<Arc, GALLIC_LEFT>>(delta));\n    EncodeMapper<GallicArc<Arc, GALLIC_LEFT>> encoder(\n        kEncodeLabels | kEncodeWeights, ENCODE);\n    Encode(&gfst, &encoder);\n    internal::AcceptorMinimize(&gfst, allow_acyclic_minimization);\n    Decode(&gfst, encoder);\n    if (!sfst) {\n      FactorWeightFst<GallicArc<Arc, GALLIC_LEFT>,\n                      GallicFactor<typename Arc::Label, Weight, GALLIC_LEFT>>\n          fwfst(gfst);\n      std::unique_ptr<SymbolTable> osyms(\n          fst->OutputSymbols() ? fst->OutputSymbols()->Copy() : nullptr);\n      ArcMap(fwfst, fst, FromGallicMapper<Arc, GALLIC_LEFT>());\n      fst->SetOutputSymbols(osyms.get());\n    } else {\n      sfst->SetOutputSymbols(fst->OutputSymbols());\n      GallicToNewSymbolsMapper<Arc, GALLIC_LEFT> mapper(sfst);\n      ArcMap(gfst, fst, &mapper);\n      fst->SetOutputSymbols(sfst->InputSymbols());\n    }\n  } else if (props & kWeighted) {  // Weighted acceptor.\n    Push(fst, REWEIGHT_TO_INITIAL, delta);\n    ArcMap(fst, QuantizeMapper<Arc>(delta));\n    EncodeMapper<Arc> encoder(kEncodeLabels | kEncodeWeights, ENCODE);\n    Encode(fst, &encoder);\n    internal::AcceptorMinimize(fst, allow_acyclic_minimization);\n    Decode(fst, encoder);\n  } else {  // Unweighted acceptor.\n    internal::AcceptorMinimize(fst, allow_acyclic_minimization);\n  }\n}\n\n}  // namespace fst\n\n#endif  // FST_MINIMIZE_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/mutable-fst.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Expanded FST augmented with mutators; interface class definition and\n// mutable arc iterator interface.\n\n#ifndef FST_MUTABLE_FST_H_\n#define FST_MUTABLE_FST_H_\n\n#include <stddef.h>\n#include <sys/types.h>\n\n#include <istream>\n#include <string>\n#include <utility>\n#include <vector>\n\n#include <fst/log.h>\n#include <fstream>\n\n#include <fst/expanded-fst.h>\n\n\nnamespace fst {\n\ntemplate <class Arc>\nstruct MutableArcIteratorData;\n\n// Abstract interface for an expanded FST which also supports mutation\n// operations. To modify arcs, use MutableArcIterator.\ntemplate <class A>\nclass MutableFst : public ExpandedFst<A> {\n public:\n  using Arc = A;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  virtual MutableFst<Arc> &operator=(const Fst<Arc> &fst) = 0;\n\n  MutableFst<Arc> &operator=(const MutableFst<Arc> &fst) {\n    return operator=(static_cast<const Fst<Arc> &>(fst));\n  }\n\n  // Sets the initial state.\n  virtual void SetStart(StateId) = 0;\n\n  // Sets a state's final weight.\n  virtual void SetFinal(StateId, Weight) = 0;\n\n  // Sets property bits w.r.t. mask.\n  virtual void SetProperties(uint64 props, uint64 mask) = 0;\n\n  // Adds a state and returns its ID.\n  virtual StateId AddState() = 0;\n\n  // Adds an arc to state.\n  virtual void AddArc(StateId, const Arc &arc) = 0;\n\n  // Deletes some states, preserving original StateId ordering.\n  virtual void DeleteStates(const std::vector<StateId> &) = 0;\n\n  // Delete all states.\n  virtual void DeleteStates() = 0;\n\n  // Delete some arcs at a given state.\n  virtual void DeleteArcs(StateId, size_t n) = 0;\n\n  // Delete all arcs at a given state.\n  virtual void DeleteArcs(StateId) = 0;\n\n  // Optional, best effort only.\n  virtual void ReserveStates(StateId n) {}\n\n  // Optional, best effort only.\n  virtual void ReserveArcs(StateId s, size_t n) {}\n\n  // Returns input label symbol table or nullptr if not specified.\n  const SymbolTable *InputSymbols() const override = 0;\n\n  // Returns output label symbol table or nullptr if not specified.\n  const SymbolTable *OutputSymbols() const override = 0;\n\n  // Returns input label symbol table or nullptr if not specified.\n  virtual SymbolTable *MutableInputSymbols() = 0;\n\n  // Returns output label symbol table or nullptr if not specified.\n  virtual SymbolTable *MutableOutputSymbols() = 0;\n\n  // Sets input label symbol table; pass nullptr to delete table.\n  virtual void SetInputSymbols(const SymbolTable *isyms) = 0;\n\n  // Sets output label symbol table; pass nullptr to delete table.\n  virtual void SetOutputSymbols(const SymbolTable *osyms) = 0;\n\n  // Gets a copy of this MutableFst. See Fst<>::Copy() for further doc.\n  MutableFst<A> *Copy(bool safe = false) const override = 0;\n\n  // Reads a MutableFst from an input stream, returning nullptr on error.\n  static MutableFst<Arc> *Read(std::istream &strm, const FstReadOptions &opts) {\n    FstReadOptions ropts(opts);\n    FstHeader hdr;\n    if (ropts.header) {\n      hdr = *opts.header;\n    } else {\n      if (!hdr.Read(strm, opts.source)) return nullptr;\n      ropts.header = &hdr;\n    }\n    if (!(hdr.Properties() & kMutable)) {\n      LOG(ERROR) << \"MutableFst::Read: Not a MutableFst: \" << ropts.source;\n      return nullptr;\n    }\n    const auto &fst_type = hdr.FstType();\n    const auto reader = FstRegister<Arc>::GetRegister()->GetReader(fst_type);\n    if (!reader) {\n      LOG(ERROR) << \"MutableFst::Read: Unknown FST type \\\"\" << fst_type\n                 << \"\\\" (arc type = \\\"\" << A::Type() << \"\\\"): \" << ropts.source;\n      return nullptr;\n    }\n    auto *fst = reader(strm, ropts);\n    if (!fst) return nullptr;\n    return static_cast<MutableFst<Arc> *>(fst);\n  }\n\n  // Reads a MutableFst from a file; returns nullptr on error. An empty\n  // filename results in reading from standard input. If convert is true,\n  // convert to a mutable FST subclass (given by convert_type) in the case\n  // that the input FST is non-mutable.\n  static MutableFst<Arc> *Read(const string &filename, bool convert = false,\n                               const string &convert_type = \"vector\") {\n    if (convert == false) {\n      if (!filename.empty()) {\n        std::ifstream strm(filename,\n                                std::ios_base::in | std::ios_base::binary);\n        if (!strm) {\n          LOG(ERROR) << \"MutableFst::Read: Can't open file: \" << filename;\n          return nullptr;\n        }\n        return Read(strm, FstReadOptions(filename));\n      } else {\n        return Read(std::cin, FstReadOptions(\"standard input\"));\n      }\n    } else {  // Converts to 'convert_type' if not mutable.\n      std::unique_ptr<Fst<Arc>> ifst(Fst<Arc>::Read(filename));\n      if (!ifst) return nullptr;\n      if (ifst->Properties(kMutable, false)) {\n        return static_cast<MutableFst<Arc> *>(ifst.release());\n      } else {\n        std::unique_ptr<Fst<Arc>> ofst(Convert(*ifst, convert_type));\n        ifst.reset();\n        if (!ofst) return nullptr;\n        if (!ofst->Properties(kMutable, false)) {\n          LOG(ERROR) << \"MutableFst: Bad convert type: \" << convert_type;\n        }\n        return static_cast<MutableFst<Arc> *>(ofst.release());\n      }\n    }\n  }\n\n  // For generic mutuble arc iterator construction; not normally called\n  // directly by users.\n  virtual void InitMutableArcIterator(StateId s,\n                                      MutableArcIteratorData<Arc> *data) = 0;\n};\n\n// Mutable arc iterator interface, templated on the Arc definition. This is\n// used by mutable arc iterator specializations that are returned by the\n// InitMutableArcIterator MutableFst method.\ntemplate <class Arc>\nclass MutableArcIteratorBase : public ArcIteratorBase<Arc> {\n public:\n  // Sets current arc.\n  virtual void SetValue(const Arc &) = 0;\n};\n\ntemplate <class Arc>\nstruct MutableArcIteratorData {\n  MutableArcIteratorBase<Arc> *base;  // Specific iterator.\n};\n\n// Generic mutable arc iterator, templated on the FST definition; a wrapper\n// around a pointer to a more specific one.\n//\n// Here is a typical use:\n//\n//   for (MutableArcIterator<StdFst> aiter(&fst, s);\n//        !aiter.Done();\n//         aiter.Next()) {\n//     StdArc arc = aiter.Value();\n//     arc.ilabel = 7;\n//     aiter.SetValue(arc);\n//     ...\n//   }\n//\n// This version requires function calls.\ntemplate <class FST>\nclass MutableArcIterator {\n public:\n  using Arc = typename FST::Arc;\n  using StateId = typename Arc::StateId;\n\n  MutableArcIterator(FST *fst, StateId s) {\n    fst->InitMutableArcIterator(s, &data_);\n  }\n\n  ~MutableArcIterator() { delete data_.base; }\n\n  bool Done() const { return data_.base->Done(); }\n\n  const Arc &Value() const { return data_.base->Value(); }\n\n  void Next() { data_.base->Next(); }\n\n  size_t Position() const { return data_.base->Position(); }\n\n  void Reset() { data_.base->Reset(); }\n\n  void Seek(size_t a) { data_.base->Seek(a); }\n\n  void SetValue(const Arc &arc) { data_.base->SetValue(arc); }\n\n  uint32 Flags() const { return data_.base->Flags(); }\n\n  void SetFlags(uint32 flags, uint32 mask) {\n    return data_.base->SetFlags(flags, mask);\n  }\n\n private:\n  MutableArcIteratorData<Arc> data_;\n\n  MutableArcIterator(const MutableArcIterator &) = delete;\n  MutableArcIterator &operator=(const MutableArcIterator &) = delete;\n};\n\nnamespace internal {\n\n// MutableFst<A> case: abstract methods.\ntemplate <class Arc>\ninline typename Arc::Weight Final(const MutableFst<Arc> &fst,\n                                  typename Arc::StateId s) {\n  return fst.Final(s);\n}\n\ntemplate <class Arc>\ninline ssize_t NumArcs(const MutableFst<Arc> &fst, typename Arc::StateId s) {\n  return fst.NumArcs(s);\n}\n\ntemplate <class Arc>\ninline ssize_t NumInputEpsilons(const MutableFst<Arc> &fst,\n                                typename Arc::StateId s) {\n  return fst.NumInputEpsilons(s);\n}\n\ntemplate <class Arc>\ninline ssize_t NumOutputEpsilons(const MutableFst<Arc> &fst,\n                                 typename Arc::StateId s) {\n  return fst.NumOutputEpsilons(s);\n}\n\n}  // namespace internal\n\n// A useful alias when using StdArc.\nusing StdMutableFst = MutableFst<StdArc>;\n\n// This is a helper class template useful for attaching a MutableFst interface\n// to its implementation, handling reference counting and COW semantics.\ntemplate <class Impl, class FST = MutableFst<typename Impl::Arc>>\nclass ImplToMutableFst : public ImplToExpandedFst<Impl, FST> {\n public:\n  using Arc = typename Impl::Arc;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using ImplToExpandedFst<Impl, FST>::operator=;\n\n  void SetStart(StateId s) override {\n    MutateCheck();\n    GetMutableImpl()->SetStart(s);\n  }\n\n  void SetFinal(StateId s, Weight weight) override {\n    MutateCheck();\n    GetMutableImpl()->SetFinal(s, std::move(weight));\n  }\n\n  void SetProperties(uint64 props, uint64 mask) override {\n    // Can skip mutate check if extrinsic properties don't change,\n    // since it is then safe to update all (shallow) copies\n    const auto exprops = kExtrinsicProperties & mask;\n    if (GetImpl()->Properties(exprops) != (props & exprops)) MutateCheck();\n    GetMutableImpl()->SetProperties(props, mask);\n  }\n\n  StateId AddState() override {\n    MutateCheck();\n    return GetMutableImpl()->AddState();\n  }\n\n  void AddArc(StateId s, const Arc &arc) override {\n    MutateCheck();\n    GetMutableImpl()->AddArc(s, arc);\n  }\n\n  void DeleteStates(const std::vector<StateId> &dstates) override {\n    MutateCheck();\n    GetMutableImpl()->DeleteStates(dstates);\n  }\n\n  void DeleteStates() override {\n    if (!Unique()) {\n      const auto *isymbols = GetImpl()->InputSymbols();\n      const auto *osymbols = GetImpl()->OutputSymbols();\n      SetImpl(std::make_shared<Impl>());\n      GetMutableImpl()->SetInputSymbols(isymbols);\n      GetMutableImpl()->SetOutputSymbols(osymbols);\n    } else {\n      GetMutableImpl()->DeleteStates();\n    }\n  }\n\n  void DeleteArcs(StateId s, size_t n) override {\n    MutateCheck();\n    GetMutableImpl()->DeleteArcs(s, n);\n  }\n\n  void DeleteArcs(StateId s) override {\n    MutateCheck();\n    GetMutableImpl()->DeleteArcs(s);\n  }\n\n  void ReserveStates(StateId s) override {\n    MutateCheck();\n    GetMutableImpl()->ReserveStates(s);\n  }\n\n  void ReserveArcs(StateId s, size_t n) override {\n    MutateCheck();\n    GetMutableImpl()->ReserveArcs(s, n);\n  }\n\n  const SymbolTable *InputSymbols() const override {\n    return GetImpl()->InputSymbols();\n  }\n\n  const SymbolTable *OutputSymbols() const override {\n    return GetImpl()->OutputSymbols();\n  }\n\n  SymbolTable *MutableInputSymbols() override {\n    MutateCheck();\n    return GetMutableImpl()->InputSymbols();\n  }\n\n  SymbolTable *MutableOutputSymbols() override {\n    MutateCheck();\n    return GetMutableImpl()->OutputSymbols();\n  }\n\n  void SetInputSymbols(const SymbolTable *isyms) override {\n    MutateCheck();\n    GetMutableImpl()->SetInputSymbols(isyms);\n  }\n\n  void SetOutputSymbols(const SymbolTable *osyms) override {\n    MutateCheck();\n    GetMutableImpl()->SetOutputSymbols(osyms);\n  }\n\n protected:\n  using ImplToExpandedFst<Impl, FST>::GetImpl;\n  using ImplToExpandedFst<Impl, FST>::GetMutableImpl;\n  using ImplToExpandedFst<Impl, FST>::Unique;\n  using ImplToExpandedFst<Impl, FST>::SetImpl;\n  using ImplToExpandedFst<Impl, FST>::InputSymbols;\n\n  explicit ImplToMutableFst(std::shared_ptr<Impl> impl)\n      : ImplToExpandedFst<Impl, FST>(impl) {}\n\n  ImplToMutableFst(const ImplToMutableFst<Impl, FST> &fst, bool safe)\n      : ImplToExpandedFst<Impl, FST>(fst, safe) {}\n\n  void MutateCheck() {\n    if (!Unique()) SetImpl(std::make_shared<Impl>(*this));\n  }\n};\n\n}  // namespace fst\n\n#endif  // FST_MUTABLE_FST_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/pair-weight.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Pair weight templated base class for weight classes that contain two weights\n// (e.g. Product, Lexicographic).\n\n#ifndef FST_PAIR_WEIGHT_H_\n#define FST_PAIR_WEIGHT_H_\n\n#include <climits>\n#include <stack>\n#include <string>\n#include <utility>\n\n#include <fst/flags.h>\n#include <fst/log.h>\n\n#include <fst/weight.h>\n\n\nnamespace fst {\n\ntemplate <class W1, class W2>\nclass PairWeight {\n public:\n  using ReverseWeight =\n      PairWeight<typename W1::ReverseWeight, typename W2::ReverseWeight>;\n\n  PairWeight() {}\n\n  PairWeight(const PairWeight &weight)\n      : value1_(weight.value1_), value2_(weight.value2_) {}\n\n  PairWeight(W1 w1, W2 w2) : value1_(std::move(w1)), value2_(std::move(w2)) {}\n\n  static const PairWeight<W1, W2> &Zero() {\n    static const PairWeight zero(W1::Zero(), W2::Zero());\n    return zero;\n  }\n\n  static const PairWeight<W1, W2> &One() {\n    static const PairWeight one(W1::One(), W2::One());\n    return one;\n  }\n\n  static const PairWeight<W1, W2> &NoWeight() {\n    static const PairWeight no_weight(W1::NoWeight(), W2::NoWeight());\n    return no_weight;\n  }\n\n  std::istream &Read(std::istream &strm) {\n    value1_.Read(strm);\n    return value2_.Read(strm);\n  }\n\n  std::ostream &Write(std::ostream &strm) const {\n    value1_.Write(strm);\n    return value2_.Write(strm);\n  }\n\n  PairWeight<W1, W2> &operator=(const PairWeight<W1, W2> &weight) {\n    value1_ = weight.Value1();\n    value2_ = weight.Value2();\n    return *this;\n  }\n\n  bool Member() const { return value1_.Member() && value2_.Member(); }\n\n  size_t Hash() const {\n    const auto h1 = value1_.Hash();\n    const auto h2 = value2_.Hash();\n    static constexpr int lshift = 5;\n    static constexpr int rshift = CHAR_BIT * sizeof(size_t) - 5;\n    return h1 << lshift ^ h1 >> rshift ^ h2;\n  }\n\n  PairWeight<W1, W2> Quantize(float delta = kDelta) const {\n    return PairWeight<W1, W2>(value1_.Quantize(delta), value2_.Quantize(delta));\n  }\n\n  ReverseWeight Reverse() const {\n    return ReverseWeight(value1_.Reverse(), value2_.Reverse());\n  }\n\n  const W1 &Value1() const { return value1_; }\n\n  const W2 &Value2() const { return value2_; }\n\n  void SetValue1(const W1 &weight) { value1_ = weight; }\n\n  void SetValue2(const W2 &weight) { value2_ = weight; }\n\n private:\n  W1 value1_;\n  W2 value2_;\n};\n\ntemplate <class W1, class W2>\ninline bool operator==(const PairWeight<W1, W2> &w1,\n                       const PairWeight<W1, W2> &w2) {\n  return w1.Value1() == w2.Value1() && w1.Value2() == w2.Value2();\n}\n\ntemplate <class W1, class W2>\ninline bool operator!=(const PairWeight<W1, W2> &w1,\n                       const PairWeight<W1, W2> &w2) {\n  return w1.Value1() != w2.Value1() || w1.Value2() != w2.Value2();\n}\n\ntemplate <class W1, class W2>\ninline bool ApproxEqual(const PairWeight<W1, W2> &w1,\n                        const PairWeight<W1, W2> &w2, float delta = kDelta) {\n  return ApproxEqual(w1.Value1(), w2.Value1(), delta) &&\n         ApproxEqual(w1.Value2(), w2.Value2(), delta);\n}\n\ntemplate <class W1, class W2>\ninline std::ostream &operator<<(std::ostream &strm,\n                                const PairWeight<W1, W2> &weight) {\n  CompositeWeightWriter writer(strm);\n  writer.WriteBegin();\n  writer.WriteElement(weight.Value1());\n  writer.WriteElement(weight.Value2());\n  writer.WriteEnd();\n  return strm;\n}\n\ntemplate <class W1, class W2>\ninline std::istream &operator>>(std::istream &strm,\n                                PairWeight<W1, W2> &weight) {\n  CompositeWeightReader reader(strm);\n  reader.ReadBegin();\n  W1 w1;\n  reader.ReadElement(&w1);\n  weight.SetValue1(w1);\n  W2 w2;\n  reader.ReadElement(&w2, true);\n  weight.SetValue2(w2);\n  reader.ReadEnd();\n  return strm;\n}\n\n// This function object returns weights by calling the underlying generators\n// and forming a pair. This is intended primarily for testing.\ntemplate <class W1, class W2>\nclass WeightGenerate<PairWeight<W1, W2>> {\n public:\n  using Weight = PairWeight<W1, W2>;\n  using Generate1 = WeightGenerate<W1>;\n  using Generate2 = WeightGenerate<W2>;\n\n  explicit WeightGenerate(bool allow_zero = true)\n      : generate1_(allow_zero), generate2_(allow_zero) {}\n\n  Weight operator()() const { return Weight(generate1_(), generate2_()); }\n\n private:\n  Generate1 generate1_;\n  Generate2 generate2_;\n};\n\n}  // namespace fst\n\n#endif  // FST_PAIR_WEIGHT_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/partition.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Functions and classes to create a partition of states.\n\n#ifndef FST_PARTITION_H_\n#define FST_PARTITION_H_\n\n#include <algorithm>\n#include <vector>\n\n\n#include <fst/queue.h>\n\n\nnamespace fst {\nnamespace internal {\n\ntemplate <typename T>\nclass PartitionIterator;\n\n// Defines a partitioning of elements, used to represent equivalence classes\n// for FST operations like minimization. T must be a signed integer type.\n//\n// The elements are numbered from 0 to num_elements - 1.\n// Initialize(num_elements) sets up the class for a given number of elements.\n// We maintain a partition of these elements into classes. The classes are also\n// numbered from zero; you can add a class with AddClass(), or add them in bulk\n// with AllocateClasses(num_classes). Initially the elements are not assigned\n// to any class; you set up the initial mapping from elements to classes by\n// calling Add(element_id, class_id). You can also move an element to a\n// different class by calling Move(element_id, class_id).\n//\n// We also support a rather specialized interface that allows you to efficiently\n// split classes in the Hopcroft minimization algorithm. This maintains a\n// binary partition of each class.  Let's call these, rather arbitrarily, the\n// 'yes' subset and the 'no' subset of each class, and assume that by default,\n// each element of a class is in its 'no' subset. When one calls\n// SplitOn(element_id), element_id is moved to the 'yes' subset of its class.\n// (If it was already in the 'yes' set, it just stays there). The aim is to\n// enable (later) splitting the class in two in time no greater than the time\n// already spent calling SplitOn() for that class. We keep a list of the classes\n// which have nonempty 'yes' sets, as visited_classes_. When one calls\n// FinalizeSplit(Queue *l), for each class in visited_classes_ whose 'yes'\n// and 'no' sets are both nonempty, it will create a new class consisting of\n// the smaller of the two subsets (and this class will be added to the queue),\n// and the old class will now be the larger of the two subsets. This call also\n// resets all the yes/no partitions so that everything is in the 'no' subsets.\n//\n// One cannot use the Move() function if SplitOn() has been called without\n// a subsequent call to FinalizeSplit()\ntemplate <typename T>\nclass Partition {\n public:\n  Partition() {}\n\n  explicit Partition(T num_elements) { Initialize(num_elements); }\n\n  // Creates an empty partition for num_elements. This means that the elements\n  // are not assigned to a class (i.e class_index = -1); you should set up the\n  // number of classes using AllocateClasses() or AddClass(), and allocate each\n  // element to a class by calling Add(element, class_id).\n  void Initialize(size_t num_elements) {\n    elements_.resize(num_elements);\n    classes_.reserve(num_elements);\n    classes_.clear();\n    yes_counter_ = 1;\n  }\n\n  // Adds a class; returns new number of classes.\n  T AddClass() {\n    auto num_classes = classes_.size();\n    classes_.resize(num_classes + 1);\n    return num_classes;\n  }\n\n  // Adds 'num_classes' new (empty) classes.\n  void AllocateClasses(T num_classes) {\n    classes_.resize(classes_.size() + num_classes);\n  }\n\n  // Adds element_id to class_id. element_id should already have been allocated\n  // by calling Initialize(num_elements)---or the constructor taking\n  // num_elements---with num_elements > element_id. element_id must not\n  // currently be a member of any class; once elements have been added to a\n  // class, use the Move() method to move them from one class to another.\n  void Add(T element_id, T class_id) {\n    auto &this_element = elements_[element_id];\n    auto &this_class = classes_[class_id];\n    ++this_class.size;\n    // Adds the element to the 'no' subset of the class.\n    auto no_head = this_class.no_head;\n    if (no_head >= 0) elements_[no_head].prev_element = element_id;\n    this_class.no_head = element_id;\n    this_element.class_id = class_id;\n    // Adds to the 'no' subset of the class.\n    this_element.yes = 0;\n    this_element.next_element = no_head;\n    this_element.prev_element = -1;\n  }\n\n  // Moves element_id from 'no' subset of its current class to 'no' subset of\n  // class class_id. This may not work correctly if you have called SplitOn()\n  // [for any element] and haven't subsequently called FinalizeSplit().\n  void Move(T element_id, T class_id) {\n    auto elements = &(elements_[0]);\n    auto &element = elements[element_id];\n    auto &old_class = classes_[element.class_id];\n    --old_class.size;\n    // Excises the element from the 'no' list of its old class, where it is\n    // assumed to be.\n    if (element.prev_element >= 0) {\n      elements[element.prev_element].next_element = element.next_element;\n    } else {\n      old_class.no_head = element.next_element;\n    }\n    if (element.next_element >= 0) {\n      elements[element.next_element].prev_element = element.prev_element;\n    }\n    // Adds to new class.\n    Add(element_id, class_id);\n  }\n\n  // Moves element_id to the 'yes' subset of its class if it was in the 'no'\n  // subset, and marks the class as having been visited.\n  void SplitOn(T element_id) {\n    auto elements = &(elements_[0]);\n    auto &element = elements[element_id];\n    if (element.yes == yes_counter_) {\n      return;  // Already in the 'yes' set; nothing to do.\n    }\n    auto class_id = element.class_id;\n    auto &this_class = classes_[class_id];\n    // Excises the element from the 'no' list of its class.\n    if (element.prev_element >= 0) {\n      elements[element.prev_element].next_element = element.next_element;\n    } else {\n      this_class.no_head = element.next_element;\n    }\n    if (element.next_element >= 0) {\n      elements[element.next_element].prev_element = element.prev_element;\n    }\n    // Adds the element to the 'yes' list.\n    if (this_class.yes_head >= 0) {\n      elements[this_class.yes_head].prev_element = element_id;\n    } else {\n      visited_classes_.push_back(class_id);\n    }\n    element.yes = yes_counter_;\n    element.next_element = this_class.yes_head;\n    element.prev_element = -1;\n    this_class.yes_head = element_id;\n    this_class.yes_size++;\n  }\n\n  // This should be called after one has possibly called SplitOn for one or more\n  // elements, thus moving those elements to the 'yes' subset for their class.\n  // For each class that has a nontrivial split (i.e., it's not the case that\n  // all members are in the 'yes' or 'no' subset), this function creates a new\n  // class containing the smaller of the two subsets of elements, leaving the\n  // larger group of elements in the old class. The identifier of the new class\n  // will be added to the queue provided as the pointer L. This method then\n  // moves all elements to the 'no' subset of their class.\n  template <class Queue>\n  void FinalizeSplit(Queue *queue) {\n    for (const auto &visited_class : visited_classes_) {\n      const auto new_class = SplitRefine(visited_class);\n      if (new_class != -1 && queue) queue->Enqueue(new_class);\n    }\n    visited_classes_.clear();\n    // Incrementation sets all the 'yes' members of the elements to false.\n    ++yes_counter_;\n  }\n\n  const T ClassId(T element_id) const { return elements_[element_id].class_id; }\n\n  const size_t ClassSize(T class_id) const { return classes_[class_id].size; }\n\n  const T NumClasses() const { return classes_.size(); }\n\n private:\n  friend class PartitionIterator<T>;\n\n  // Information about a given element.\n  struct Element {\n    T class_id;      // Class ID of this element.\n    T yes;           // This is to be interpreted as a bool, true if it's in the\n                     // 'yes' set of this class. The interpretation as bool is\n                     // (yes == yes_counter_ ? true : false).\n    T next_element;  // Next element in the 'no' list or 'yes' list of this\n                     // class, whichever of the two we belong to (think of\n                     // this as the 'next' in a doubly-linked list, although\n                     // it is an index into the elements array). Negative\n                     // values corresponds to null.\n    T prev_element;  // Previous element in the 'no' or 'yes' doubly linked\n                     // list. Negative values corresponds to null.\n  };\n\n  // Information about a given class.\n  struct Class {\n    Class() : size(0), yes_size(0), no_head(-1), yes_head(-1) {}\n    T size;      // Total number of elements in this class ('no' plus 'yes'\n                 // subsets).\n    T yes_size;  // Total number of elements of 'yes' subset of this class.\n    T no_head;   // Index of head element of doubly-linked list in 'no' subset.\n                 // Everything is in the 'no' subset until you call SplitOn().\n                 // -1 means no element.\n    T yes_head;  // Index of head element of doubly-linked list in 'yes' subset.\n                 // -1 means no element.\n  };\n\n  // This method, called from FinalizeSplit(), checks whether a class has to\n  // be split (a class will be split only if its 'yes' and 'no' subsets are\n  // both nonempty, but one can assume that since this function was called, the\n  // 'yes' subset is nonempty). It splits by taking the smaller subset and\n  // making it a new class, and leaving the larger subset of elements in the\n  // 'no' subset of the old class. It returns the new class if created, or -1\n  // if none was created.\n  T SplitRefine(T class_id) {\n    auto yes_size = classes_[class_id].yes_size;\n    auto size = classes_[class_id].size;\n    auto no_size = size - yes_size;\n    if (no_size == 0) {\n      // All members are in the 'yes' subset, so we don't have to create a new\n      // class, just move them all to the 'no' subset.\n      classes_[class_id].no_head = classes_[class_id].yes_head;\n      classes_[class_id].yes_head = -1;\n      classes_[class_id].yes_size = 0;\n      return -1;\n    } else {\n      auto new_class_id = classes_.size();\n      classes_.resize(classes_.size() + 1);\n      auto &old_class = classes_[class_id];\n      auto &new_class = classes_[new_class_id];\n      // The new_class will have the values from the constructor.\n      if (no_size < yes_size) {\n        // Moves the 'no' subset to new class ('no' subset).\n        new_class.no_head = old_class.no_head;\n        new_class.size = no_size;\n        // And makes the 'yes' subset of the old class ('no' subset).\n        old_class.no_head = old_class.yes_head;\n        old_class.yes_head = -1;\n        old_class.size = yes_size;\n        old_class.yes_size = 0;\n      } else {\n        // Moves the 'yes' subset to the new class (to the 'no' subset)\n        new_class.size = yes_size;\n        new_class.no_head = old_class.yes_head;\n        // Retains only the 'no' subset in the old class.\n        old_class.size = no_size;\n        old_class.yes_size = 0;\n        old_class.yes_head = -1;\n      }\n      auto elements = &(elements_[0]);\n      // Updates the 'class_id' of all the elements we moved.\n      for (auto e = new_class.no_head; e >= 0; e = elements[e].next_element) {\n        elements[e].class_id = new_class_id;\n      }\n      return new_class_id;\n    }\n  }\n\n  // elements_[i] contains all info about the i'th element.\n  std::vector<Element> elements_;\n  // classes_[i] contains all info about the i'th class.\n  std::vector<Class> classes_;\n  // Set of visited classes to be used in split refine.\n  std::vector<T> visited_classes_;\n  // yes_counter_ is used in interpreting the 'yes' members of class Element.\n  // If element.yes == yes_counter_, we interpret that element as being in the\n  // 'yes' subset of its class. This allows us to, in effect, set all those\n  // bools to false at a stroke by incrementing yes_counter_.\n  T yes_counter_;\n};\n\n// Iterates over members of the 'no' subset of a class in a partition. (When\n// this is used, everything is in the 'no' subset).\ntemplate <typename T>\nclass PartitionIterator {\n public:\n  using Element = typename Partition<T>::Element;\n\n  PartitionIterator(const Partition<T> &partition, T class_id)\n      : partition_(partition),\n        element_id_(partition_.classes_[class_id].no_head),\n        class_id_(class_id) {}\n\n  bool Done() { return element_id_ < 0; }\n\n  const T Value() { return element_id_; }\n\n  void Next() { element_id_ = partition_.elements_[element_id_].next_element; }\n\n  void Reset() { element_id_ = partition_.classes_[class_id_].no_head; }\n\n private:\n  const Partition<T> &partition_;\n  T element_id_;\n  T class_id_;\n};\n\n}  // namespace internal\n}  // namespace fst\n\n#endif  // FST_PARTITION_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/power-weight.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Cartesian power weight semiring operation definitions.\n\n#ifndef FST_POWER_WEIGHT_H_\n#define FST_POWER_WEIGHT_H_\n\n#include <string>\n\n#include <fst/tuple-weight.h>\n#include <fst/weight.h>\n\n\nnamespace fst {\n\n// Cartesian power semiring: W ^ n\n//\n// Forms:\n//  - a left semimodule when W is a left semiring,\n//  - a right semimodule when W is a right semiring,\n//  - a bisemimodule when W is a semiring,\n//    the free semimodule of rank n over W\n// The Times operation is overloaded to provide the left and right scalar\n// products.\ntemplate <class W, size_t n>\nclass PowerWeight : public TupleWeight<W, n> {\n public:\n  using ReverseWeight = PowerWeight<typename W::ReverseWeight, n>;\n\n  PowerWeight() {}\n\n  explicit PowerWeight(const TupleWeight<W, n> &weight)\n      : TupleWeight<W, n>(weight) {}\n\n  template <class Iterator>\n  PowerWeight(Iterator begin, Iterator end) : TupleWeight<W, n>(begin, end) {}\n\n  // Initialize component `index` to `weight`; initialize all other components\n  // to `default_weight`\n  PowerWeight(size_t index, const W &weight,\n              const W &default_weight = W::Zero())\n      : TupleWeight<W, n>(index, weight, default_weight) {}\n\n  static const PowerWeight &Zero() {\n    static const PowerWeight zero(TupleWeight<W, n>::Zero());\n    return zero;\n  }\n\n  static const PowerWeight &One() {\n    static const PowerWeight one(TupleWeight<W, n>::One());\n    return one;\n  }\n\n  static const PowerWeight &NoWeight() {\n    static const PowerWeight no_weight(TupleWeight<W, n>::NoWeight());\n    return no_weight;\n  }\n\n  static const string &Type() {\n    static const string *const type =\n        new string(W::Type() + \"_^\" + std::to_string(n));\n    return *type;\n  }\n\n  static constexpr uint64 Properties() {\n    return W::Properties() &\n           (kLeftSemiring | kRightSemiring | kCommutative | kIdempotent);\n  }\n\n  PowerWeight Quantize(float delta = kDelta) const {\n    return PowerWeight(TupleWeight<W, n>::Quantize(delta));\n  }\n\n  ReverseWeight Reverse() const {\n    return ReverseWeight(TupleWeight<W, n>::Reverse());\n  }\n};\n\n// Semiring plus operation.\ntemplate <class W, size_t n>\ninline PowerWeight<W, n> Plus(const PowerWeight<W, n> &w1,\n                              const PowerWeight<W, n> &w2) {\n  PowerWeight<W, n> result;\n  for (size_t i = 0; i < n; ++i) {\n    result.SetValue(i, Plus(w1.Value(i), w2.Value(i)));\n  }\n  return result;\n}\n\n// Semiring times operation.\ntemplate <class W, size_t n>\ninline PowerWeight<W, n> Times(const PowerWeight<W, n> &w1,\n                               const PowerWeight<W, n> &w2) {\n  PowerWeight<W, n> result;\n  for (size_t i = 0; i < n; ++i) {\n    result.SetValue(i, Times(w1.Value(i), w2.Value(i)));\n  }\n  return result;\n}\n\n// Semiring divide operation.\ntemplate <class W, size_t n>\ninline PowerWeight<W, n> Divide(const PowerWeight<W, n> &w1,\n                                const PowerWeight<W, n> &w2,\n                                DivideType type = DIVIDE_ANY) {\n  PowerWeight<W, n> result;\n  for (size_t i = 0; i < n; ++i) {\n    result.SetValue(i, Divide(w1.Value(i), w2.Value(i), type));\n  }\n  return result;\n}\n\n// Semimodule left scalar product.\ntemplate <class W, size_t n>\ninline PowerWeight<W, n> Times(const W &scalar,\n                               const PowerWeight<W, n> &weight) {\n  PowerWeight<W, n> result;\n  for (size_t i = 0; i < n; ++i) {\n    result.SetValue(i, Times(scalar, weight.Value(i)));\n  }\n  return result;\n}\n\n// Semimodule right scalar product.\ntemplate <class W, size_t n>\ninline PowerWeight<W, n> Times(const PowerWeight<W, n> &weight,\n                               const W &scalar) {\n  PowerWeight<W, n> result;\n  for (size_t i = 0; i < n; ++i) {\n    result.SetValue(i, Times(weight.Value(i), scalar));\n  }\n  return result;\n}\n\n// Semimodule dot product.\ntemplate <class W, size_t n>\ninline W DotProduct(const PowerWeight<W, n> &w1, const PowerWeight<W, n> &w2) {\n  W result(W::Zero());\n  for (size_t i = 0; i < n; ++i) {\n    result = Plus(result, Times(w1.Value(i), w2.Value(i)));\n  }\n  return result;\n}\n\n// This function object generates weights over the Cartesian power of rank\n// n over the underlying weight. This is intended primarily for testing.\ntemplate <class W, size_t n>\nclass WeightGenerate<PowerWeight<W, n>> {\n public:\n  using Weight = PowerWeight<W, n>;\n  using Generate = WeightGenerate<W>;\n\n  explicit WeightGenerate(bool allow_zero = true) : generate_(allow_zero) {}\n\n  Weight operator()() const {\n    Weight result;\n    for (size_t i = 0; i < n; ++i) result.SetValue(i, generate_());\n    return result;\n  }\n\n private:\n  Generate generate_;\n};\n\n}  // namespace fst\n\n#endif  // FST_POWER_WEIGHT_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/product-weight.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Product weight set and associated semiring operation definitions.\n\n#ifndef FST_PRODUCT_WEIGHT_H_\n#define FST_PRODUCT_WEIGHT_H_\n\n#include <string>\n#include <utility>\n\n#include <fst/pair-weight.h>\n#include <fst/weight.h>\n\n\nnamespace fst {\n\n// Product semiring: W1 * W2.\ntemplate <class W1, class W2>\nclass ProductWeight : public PairWeight<W1, W2> {\n public:\n  using ReverseWeight =\n      ProductWeight<typename W1::ReverseWeight, typename W2::ReverseWeight>;\n\n  ProductWeight() {}\n\n  explicit ProductWeight(const PairWeight<W1, W2> &weight)\n      : PairWeight<W1, W2>(weight) {}\n\n  ProductWeight(W1 w1, W2 w2)\n      : PairWeight<W1, W2>(std::move(w1), std::move(w2)) {}\n\n  static const ProductWeight &Zero() {\n    static const ProductWeight zero(PairWeight<W1, W2>::Zero());\n    return zero;\n  }\n\n  static const ProductWeight &One() {\n    static const ProductWeight one(PairWeight<W1, W2>::One());\n    return one;\n  }\n\n  static const ProductWeight &NoWeight() {\n    static const ProductWeight no_weight(PairWeight<W1, W2>::NoWeight());\n    return no_weight;\n  }\n\n  static const string &Type() {\n    static const string *const type =\n        new string(W1::Type() + \"_X_\" + W2::Type());\n    return *type;\n  }\n\n  static constexpr uint64 Properties() {\n    return W1::Properties() & W2::Properties() &\n           (kLeftSemiring | kRightSemiring | kCommutative | kIdempotent);\n  }\n\n  ProductWeight Quantize(float delta = kDelta) const {\n    return ProductWeight(PairWeight<W1, W2>::Quantize(delta));\n  }\n\n  ReverseWeight Reverse() const {\n    return ReverseWeight(PairWeight<W1, W2>::Reverse());\n  }\n};\n\ntemplate <class W1, class W2>\ninline ProductWeight<W1, W2> Plus(const ProductWeight<W1, W2> &w1,\n                                  const ProductWeight<W1, W2> &w2) {\n  return ProductWeight<W1, W2>(Plus(w1.Value1(), w2.Value1()),\n                               Plus(w1.Value2(), w2.Value2()));\n}\n\ntemplate <class W1, class W2>\ninline ProductWeight<W1, W2> Times(const ProductWeight<W1, W2> &w1,\n                                   const ProductWeight<W1, W2> &w2) {\n  return ProductWeight<W1, W2>(Times(w1.Value1(), w2.Value1()),\n                               Times(w1.Value2(), w2.Value2()));\n}\n\ntemplate <class W1, class W2>\ninline ProductWeight<W1, W2> Divide(const ProductWeight<W1, W2> &w1,\n                                    const ProductWeight<W1, W2> &w2,\n                                    DivideType typ = DIVIDE_ANY) {\n  return ProductWeight<W1, W2>(Divide(w1.Value1(), w2.Value1(), typ),\n                               Divide(w1.Value2(), w2.Value2(), typ));\n}\n\n// This function object generates weights by calling the underlying generators\n// for the template weight types, like all other pair weight types. This is\n// intended primarily for testing.\ntemplate <class W1, class W2>\nclass WeightGenerate<ProductWeight<W1, W2>> :\n    public WeightGenerate<PairWeight<W1, W2>> {\n public:\n  using Weight = ProductWeight<W1, W2>;\n  using Generate = WeightGenerate<PairWeight<W1, W2>>;\n\n  explicit WeightGenerate(bool allow_zero = true) : Generate(allow_zero) {}\n\n  Weight operator()() const { return Weight(Generate::operator()()); }\n};\n\n}  // namespace fst\n\n#endif  // FST_PRODUCT_WEIGHT_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/project.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Functions and classes to project an FST on to its domain or range.\n\n#ifndef FST_PROJECT_H_\n#define FST_PROJECT_H_\n\n#include <fst/arc-map.h>\n#include <fst/mutable-fst.h>\n\n\nnamespace fst {\n\n// This specifies whether to project on input or output.\nenum ProjectType { PROJECT_INPUT = 1, PROJECT_OUTPUT = 2 };\n\n// Mapper to implement projection per arc.\ntemplate <class A>\nclass ProjectMapper {\n public:\n  using FromArc = A;\n  using ToArc = A;\n\n  explicit ProjectMapper(ProjectType project_type)\n      : project_type_(project_type) {}\n\n  ToArc operator()(const FromArc &arc) const {\n    const auto label = project_type_ == PROJECT_INPUT ? arc.ilabel : arc.olabel;\n    return ToArc(label, label, arc.weight, arc.nextstate);\n  }\n\n  constexpr MapFinalAction FinalAction() const {\n    return MAP_NO_SUPERFINAL;\n  }\n\n  MapSymbolsAction InputSymbolsAction() const {\n    return project_type_ == PROJECT_INPUT ? MAP_COPY_SYMBOLS\n                                          : MAP_CLEAR_SYMBOLS;\n  }\n\n  MapSymbolsAction OutputSymbolsAction() const {\n    return project_type_ == PROJECT_OUTPUT ? MAP_COPY_SYMBOLS\n                                           : MAP_CLEAR_SYMBOLS;\n  }\n\n  uint64 Properties(uint64 props) const {\n    return ProjectProperties(props, project_type_ == PROJECT_INPUT);\n  }\n\n private:\n  const ProjectType project_type_;\n};\n\n// Projects an FST onto its domain or range by either copying each arcs' input\n// label to the output label or vice versa.\n//\n// Complexity:\n//\n//   Time: O(V + E)\n//   Space: O(1)\n//\n// where V is the number of states and E is the number of arcs.\ntemplate <class Arc>\ninline void Project(const Fst<Arc> &ifst, MutableFst<Arc> *ofst,\n                    ProjectType project_type) {\n  ArcMap(ifst, ofst, ProjectMapper<Arc>(project_type));\n  switch (project_type) {\n    case PROJECT_INPUT:\n      ofst->SetOutputSymbols(ifst.InputSymbols());\n      return;\n    case PROJECT_OUTPUT:\n      ofst->SetInputSymbols(ifst.OutputSymbols());\n      return;\n  }\n}\n\n// Destructive variant of the above.\ntemplate <class Arc>\ninline void Project(MutableFst<Arc> *fst, ProjectType project_type) {\n  ArcMap(fst, ProjectMapper<Arc>(project_type));\n  switch (project_type) {\n    case PROJECT_INPUT:\n      fst->SetOutputSymbols(fst->InputSymbols());\n      return;\n    case PROJECT_OUTPUT:\n      fst->SetInputSymbols(fst->OutputSymbols());\n      return;\n  }\n}\n\n// Projects an FST onto its domain or range by either copying each arc's input\n// label to the output label or vice versa. This version is a delayed FST.\n//\n// Complexity:\n//\n//   Time: O(v + e)\n//   Space: O(1)\n//\n// where v is the number of states visited and e is the number of arcs visited.\n// Constant time and to visit an input state or arc is assumed and exclusive of\n// caching.\ntemplate <class A>\nclass ProjectFst : public ArcMapFst<A, A, ProjectMapper<A>> {\n public:\n  using FromArc = A;\n  using ToArc = A;\n\n  using Impl = internal::ArcMapFstImpl<A, A, ProjectMapper<A>>;\n\n  ProjectFst(const Fst<A> &fst, ProjectType project_type)\n      : ArcMapFst<A, A, ProjectMapper<A>>(fst, ProjectMapper<A>(project_type)) {\n    if (project_type == PROJECT_INPUT) {\n      GetMutableImpl()->SetOutputSymbols(fst.InputSymbols());\n    }\n    if (project_type == PROJECT_OUTPUT) {\n      GetMutableImpl()->SetInputSymbols(fst.OutputSymbols());\n    }\n  }\n\n  // See Fst<>::Copy() for doc.\n  ProjectFst(const ProjectFst<A> &fst, bool safe = false)\n      : ArcMapFst<A, A, ProjectMapper<A>>(fst, safe) {}\n\n  // Gets a copy of this ProjectFst. See Fst<>::Copy() for further doc.\n  ProjectFst<A> *Copy(bool safe = false) const override {\n    return new ProjectFst(*this, safe);\n  }\n\n private:\n  using ImplToFst<Impl>::GetMutableImpl;\n};\n\n// Specialization for ProjectFst.\ntemplate <class A>\nclass StateIterator<ProjectFst<A>>\n    : public StateIterator<ArcMapFst<A, A, ProjectMapper<A>>> {\n public:\n  explicit StateIterator(const ProjectFst<A> &fst)\n      : StateIterator<ArcMapFst<A, A, ProjectMapper<A>>>(fst) {}\n};\n\n// Specialization for ProjectFst.\ntemplate <class A>\nclass ArcIterator<ProjectFst<A>>\n    : public ArcIterator<ArcMapFst<A, A, ProjectMapper<A>>> {\n public:\n  using StateId = typename A::StateId;\n\n  ArcIterator(const ProjectFst<A> &fst, StateId s)\n      : ArcIterator<ArcMapFst<A, A, ProjectMapper<A>>>(fst, s) {}\n};\n\n// Useful alias when using StdArc.\nusing StdProjectFst = ProjectFst<StdArc>;\n\n}  // namespace fst\n\n#endif  // FST_PROJECT_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/properties.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// FST property bits.\n\n#ifndef FST_PROPERTIES_H_\n#define FST_PROPERTIES_H_\n\n#include <sys/types.h>\n#include <vector>\n\n#include <fst/compat.h>\n\nnamespace fst {\n\n// The property bits here assert facts about an FST. If individual bits are\n// added, then the composite properties below, the property functions and\n// property names in properties.cc, and TestProperties() in test-properties.h\n// should be updated.\n\n// BINARY PROPERTIES\n//\n// For each property below, there is a single bit. If it is set, the property is\n// true. If it is not set, the property is false.\n\n// The Fst is an ExpandedFst.\nconstexpr uint64 kExpanded = 0x0000000000000001ULL;\n\n// The Fst is a MutableFst.\nconstexpr uint64 kMutable = 0x0000000000000002ULL;\n\n// An error was detected while constructing/using the FST.\nconstexpr uint64 kError = 0x0000000000000004ULL;\n\n// TRINARY PROPERTIES\n//\n// For each of these properties below there is a pair of property bits, one\n// positive and one negative. If the positive bit is set, the property is true.\n// If the negative bit is set, the property is false. If neither is set, the\n// property has unknown value. Both should never be simultaneously set. The\n// individual positive and negative bit pairs should be adjacent with the\n// positive bit at an odd and lower position.\n\n// ilabel == olabel for each arc.\nconstexpr uint64 kAcceptor = 0x0000000000010000ULL;\n// ilabel != olabel for some arc.\nconstexpr uint64 kNotAcceptor = 0x0000000000020000ULL;\n\n// ilabels unique leaving each state.\nconstexpr uint64 kIDeterministic = 0x0000000000040000ULL;\n// ilabels not unique leaving some state.\nconstexpr uint64 kNonIDeterministic = 0x0000000000080000ULL;\n\n// olabels unique leaving each state.\nconstexpr uint64 kODeterministic = 0x0000000000100000ULL;\n// olabels not unique leaving some state.\nconstexpr uint64 kNonODeterministic = 0x0000000000200000ULL;\n\n// FST has input/output epsilons.\nconstexpr uint64 kEpsilons = 0x0000000000400000ULL;\n// FST has no input/output epsilons.\nconstexpr uint64 kNoEpsilons = 0x0000000000800000ULL;\n\n// FST has input epsilons.\nconstexpr uint64 kIEpsilons = 0x0000000001000000ULL;\n// FST has no input epsilons.\nconstexpr uint64 kNoIEpsilons = 0x0000000002000000ULL;\n\n// FST has output epsilons.\nconstexpr uint64 kOEpsilons = 0x0000000004000000ULL;\n// FST has no output epsilons.\nconstexpr uint64 kNoOEpsilons = 0x0000000008000000ULL;\n\n// ilabels sorted wrt < for each state.\nconstexpr uint64 kILabelSorted = 0x0000000010000000ULL;\n// ilabels not sorted wrt < for some state.\nconstexpr uint64 kNotILabelSorted = 0x0000000020000000ULL;\n\n// olabels sorted wrt < for each state.\nconstexpr uint64 kOLabelSorted = 0x0000000040000000ULL;\n// olabels not sorted wrt < for some state.\nconstexpr uint64 kNotOLabelSorted = 0x0000000080000000ULL;\n\n// Non-trivial arc or final weights.\nconstexpr uint64 kWeighted = 0x0000000100000000ULL;\n// Only trivial arc and final weights.\nconstexpr uint64 kUnweighted = 0x0000000200000000ULL;\n\n// FST has cycles.\nconstexpr uint64 kCyclic = 0x0000000400000000ULL;\n// FST has no cycles.\nconstexpr uint64 kAcyclic = 0x0000000800000000ULL;\n\n// FST has cycles containing the initial state.\nconstexpr uint64 kInitialCyclic = 0x0000001000000000ULL;\n// FST has no cycles containing the initial state.\nconstexpr uint64 kInitialAcyclic = 0x0000002000000000ULL;\n\n// FST is topologically sorted.\nconstexpr uint64 kTopSorted = 0x0000004000000000ULL;\n// FST is not topologically sorted.\nconstexpr uint64 kNotTopSorted = 0x0000008000000000ULL;\n\n// All states reachable from the initial state.\nconstexpr uint64 kAccessible = 0x0000010000000000ULL;\n// Not all states reachable from the initial state.\nconstexpr uint64 kNotAccessible = 0x0000020000000000ULL;\n\n// All states can reach a final state.\nconstexpr uint64 kCoAccessible = 0x0000040000000000ULL;\n// Not all states can reach a final state.\nconstexpr uint64 kNotCoAccessible = 0x0000080000000000ULL;\n\n// If NumStates() > 0, then state 0 is initial, state NumStates() - 1 is final,\n// there is a transition from each non-final state i to state i + 1, and there\n// are no other transitions.\nconstexpr uint64 kString = 0x0000100000000000ULL;\n\n// Not a string FST.\nconstexpr uint64 kNotString = 0x0000200000000000ULL;\n\n// FST has least one weighted cycle.\nconstexpr uint64 kWeightedCycles = 0x0000400000000000ULL;\n\n// Only unweighted cycles.\nconstexpr uint64 kUnweightedCycles = 0x0000800000000000ULL;\n\n// COMPOSITE PROPERTIES\n\n// Properties of an empty machine.\nconstexpr uint64 kNullProperties =\n    kAcceptor | kIDeterministic | kODeterministic | kNoEpsilons | kNoIEpsilons |\n    kNoOEpsilons | kILabelSorted | kOLabelSorted | kUnweighted | kAcyclic |\n    kInitialAcyclic | kTopSorted | kAccessible | kCoAccessible | kString |\n    kUnweightedCycles;\n\n// Properties that are preserved when an FST is copied.\nconstexpr uint64 kCopyProperties =\n    kError | kAcceptor | kNotAcceptor | kIDeterministic | kNonIDeterministic |\n    kODeterministic | kNonODeterministic | kEpsilons | kNoEpsilons |\n    kIEpsilons | kNoIEpsilons | kOEpsilons | kNoOEpsilons | kILabelSorted |\n    kNotILabelSorted | kOLabelSorted | kNotOLabelSorted | kWeighted |\n    kUnweighted | kCyclic | kAcyclic | kInitialCyclic | kInitialAcyclic |\n    kTopSorted | kNotTopSorted | kAccessible | kNotAccessible | kCoAccessible |\n    kNotCoAccessible | kString | kNotString | kWeightedCycles |\n    kUnweightedCycles;\n\n// Properties that are intrinsic to the FST.\nconstexpr uint64 kIntrinsicProperties =\n    kExpanded | kMutable | kAcceptor | kNotAcceptor | kIDeterministic |\n    kNonIDeterministic | kODeterministic | kNonODeterministic | kEpsilons |\n    kNoEpsilons | kIEpsilons | kNoIEpsilons | kOEpsilons | kNoOEpsilons |\n    kILabelSorted | kNotILabelSorted | kOLabelSorted | kNotOLabelSorted |\n    kWeighted | kUnweighted | kCyclic | kAcyclic | kInitialCyclic |\n    kInitialAcyclic | kTopSorted | kNotTopSorted | kAccessible |\n    kNotAccessible | kCoAccessible | kNotCoAccessible | kString | kNotString |\n    kWeightedCycles | kUnweightedCycles;\n\n// Properties that are (potentially) extrinsic to the FST.\nconstexpr uint64 kExtrinsicProperties = kError;\n\n// Properties that are preserved when an FST start state is set.\nconstexpr uint64 kSetStartProperties =\n    kExpanded | kMutable | kError | kAcceptor | kNotAcceptor | kIDeterministic |\n    kNonIDeterministic | kODeterministic | kNonODeterministic | kEpsilons |\n    kNoEpsilons | kIEpsilons | kNoIEpsilons | kOEpsilons | kNoOEpsilons |\n    kILabelSorted | kNotILabelSorted | kOLabelSorted | kNotOLabelSorted |\n    kWeighted | kUnweighted | kCyclic | kAcyclic | kTopSorted | kNotTopSorted |\n    kCoAccessible | kNotCoAccessible | kWeightedCycles | kUnweightedCycles;\n\n// Properties that are preserved when an FST final weight is set.\nconstexpr uint64 kSetFinalProperties =\n    kExpanded | kMutable | kError | kAcceptor | kNotAcceptor | kIDeterministic |\n    kNonIDeterministic | kODeterministic | kNonODeterministic | kEpsilons |\n    kNoEpsilons | kIEpsilons | kNoIEpsilons | kOEpsilons | kNoOEpsilons |\n    kILabelSorted | kNotILabelSorted | kOLabelSorted | kNotOLabelSorted |\n    kCyclic | kAcyclic | kInitialCyclic | kInitialAcyclic | kTopSorted |\n    kNotTopSorted | kAccessible | kNotAccessible | kWeightedCycles |\n    kUnweightedCycles;\n\n// Properties that are preserved when an FST state is added.\nconstexpr uint64 kAddStateProperties =\n    kExpanded | kMutable | kError | kAcceptor | kNotAcceptor | kIDeterministic |\n    kNonIDeterministic | kODeterministic | kNonODeterministic | kEpsilons |\n    kNoEpsilons | kIEpsilons | kNoIEpsilons | kOEpsilons | kNoOEpsilons |\n    kILabelSorted | kNotILabelSorted | kOLabelSorted | kNotOLabelSorted |\n    kWeighted | kUnweighted | kCyclic | kAcyclic | kInitialCyclic |\n    kInitialAcyclic | kTopSorted | kNotTopSorted | kNotAccessible |\n    kNotCoAccessible | kNotString | kWeightedCycles | kUnweightedCycles;\n\n// Properties that are preserved when an FST arc is added.\nconstexpr uint64 kAddArcProperties =\n    kExpanded | kMutable | kError | kNotAcceptor | kNonIDeterministic |\n    kNonODeterministic | kEpsilons | kIEpsilons | kOEpsilons |\n    kNotILabelSorted | kNotOLabelSorted | kWeighted | kCyclic | kInitialCyclic |\n    kNotTopSorted | kAccessible | kCoAccessible | kWeightedCycles;\n\n// Properties that are preserved when an FST arc is set.\nconstexpr uint64 kSetArcProperties = kExpanded | kMutable | kError;\n\n// Properties that are preserved when FST states are deleted.\nconstexpr uint64 kDeleteStatesProperties =\n    kExpanded | kMutable | kError | kAcceptor | kIDeterministic |\n    kODeterministic | kNoEpsilons | kNoIEpsilons | kNoOEpsilons |\n    kILabelSorted | kOLabelSorted | kUnweighted | kAcyclic | kInitialAcyclic |\n    kTopSorted | kUnweightedCycles;\n\n// Properties that are preserved when FST arcs are deleted.\nconstexpr uint64 kDeleteArcsProperties =\n    kExpanded | kMutable | kError | kAcceptor | kIDeterministic |\n    kODeterministic | kNoEpsilons | kNoIEpsilons | kNoOEpsilons |\n    kILabelSorted | kOLabelSorted | kUnweighted | kAcyclic | kInitialAcyclic |\n    kTopSorted | kNotAccessible | kNotCoAccessible | kUnweightedCycles;\n\n// Properties that are preserved when an FST's states are reordered.\nconstexpr uint64 kStateSortProperties =\n    kExpanded | kMutable | kError | kAcceptor | kNotAcceptor | kIDeterministic |\n    kNonIDeterministic | kODeterministic | kNonODeterministic | kEpsilons |\n    kNoEpsilons | kIEpsilons | kNoIEpsilons | kOEpsilons | kNoOEpsilons |\n    kILabelSorted | kNotILabelSorted | kOLabelSorted | kNotOLabelSorted |\n    kWeighted | kUnweighted | kCyclic | kAcyclic | kInitialCyclic |\n    kInitialAcyclic | kAccessible | kNotAccessible | kCoAccessible |\n    kNotCoAccessible | kWeightedCycles | kUnweightedCycles;\n\n// Properties that are preserved when an FST's arcs are reordered.\nconstexpr uint64 kArcSortProperties =\n    kExpanded | kMutable | kError | kAcceptor | kNotAcceptor | kIDeterministic |\n    kNonIDeterministic | kODeterministic | kNonODeterministic | kEpsilons |\n    kNoEpsilons | kIEpsilons | kNoIEpsilons | kOEpsilons | kNoOEpsilons |\n    kWeighted | kUnweighted | kCyclic | kAcyclic | kInitialCyclic |\n    kInitialAcyclic | kTopSorted | kNotTopSorted | kAccessible |\n    kNotAccessible | kCoAccessible | kNotCoAccessible | kString | kNotString |\n    kWeightedCycles | kUnweightedCycles;\n\n// Properties that are preserved when an FST's input labels are changed.\nconstexpr uint64 kILabelInvariantProperties =\n    kExpanded | kMutable | kError | kODeterministic | kNonODeterministic |\n    kOEpsilons | kNoOEpsilons | kOLabelSorted | kNotOLabelSorted | kWeighted |\n    kUnweighted | kCyclic | kAcyclic | kInitialCyclic | kInitialAcyclic |\n    kTopSorted | kNotTopSorted | kAccessible | kNotAccessible | kCoAccessible |\n    kNotCoAccessible | kString | kNotString | kWeightedCycles |\n    kUnweightedCycles;\n\n// Properties that are preserved when an FST's output labels are changed.\nconstexpr uint64 kOLabelInvariantProperties =\n    kExpanded | kMutable | kError | kIDeterministic | kNonIDeterministic |\n    kIEpsilons | kNoIEpsilons | kILabelSorted | kNotILabelSorted | kWeighted |\n    kUnweighted | kCyclic | kAcyclic | kInitialCyclic | kInitialAcyclic |\n    kTopSorted | kNotTopSorted | kAccessible | kNotAccessible | kCoAccessible |\n    kNotCoAccessible | kString | kNotString | kWeightedCycles |\n    kUnweightedCycles;\n\n// Properties that are preserved when an FST's weights are changed. This\n// assumes that the set of states that are non-final is not changed.\nconstexpr uint64 kWeightInvariantProperties =\n    kExpanded | kMutable | kError | kAcceptor | kNotAcceptor | kIDeterministic |\n    kNonIDeterministic | kODeterministic | kNonODeterministic | kEpsilons |\n    kNoEpsilons | kIEpsilons | kNoIEpsilons | kOEpsilons | kNoOEpsilons |\n    kILabelSorted | kNotILabelSorted | kOLabelSorted | kNotOLabelSorted |\n    kCyclic | kAcyclic | kInitialCyclic | kInitialAcyclic | kTopSorted |\n    kNotTopSorted | kAccessible | kNotAccessible | kCoAccessible |\n    kNotCoAccessible | kString | kNotString;\n\n// Properties that are preserved when a superfinal state is added and an FST's\n// final weights are directed to it via new transitions.\nconstexpr uint64 kAddSuperFinalProperties =\n    kExpanded | kMutable | kError | kAcceptor | kNotAcceptor |\n    kNonIDeterministic | kNonODeterministic | kEpsilons | kIEpsilons |\n    kOEpsilons | kNotILabelSorted | kNotOLabelSorted | kWeighted | kUnweighted |\n    kCyclic | kAcyclic | kInitialCyclic | kInitialAcyclic | kNotTopSorted |\n    kNotAccessible | kCoAccessible | kNotCoAccessible | kNotString |\n    kWeightedCycles | kUnweightedCycles;\n\n// Properties that are preserved when a superfinal state is removed and the\n// epsilon transitions directed to it are made final weights.\nconstexpr uint64 kRmSuperFinalProperties =\n    kExpanded | kMutable | kError | kAcceptor | kNotAcceptor | kIDeterministic |\n    kODeterministic | kNoEpsilons | kNoIEpsilons | kNoOEpsilons |\n    kILabelSorted | kOLabelSorted | kWeighted | kUnweighted | kCyclic |\n    kAcyclic | kInitialCyclic | kInitialAcyclic | kTopSorted | kAccessible |\n    kCoAccessible | kNotCoAccessible | kString | kWeightedCycles |\n    kUnweightedCycles;\n\n// All binary properties.\nconstexpr uint64 kBinaryProperties = 0x0000000000000007ULL;\n\n// All trinary properties.\nconstexpr uint64 kTrinaryProperties = 0x0000ffffffff0000ULL;\n\n// COMPUTED PROPERTIES\n\n// 1st bit of trinary properties.\nconstexpr uint64 kPosTrinaryProperties = kTrinaryProperties &\n    0x5555555555555555ULL;\n\n// 2nd bit of trinary properties.\nconstexpr uint64 kNegTrinaryProperties = kTrinaryProperties &\n    0xaaaaaaaaaaaaaaaaULL;\n\n// All properties.\nconstexpr uint64 kFstProperties = kBinaryProperties | kTrinaryProperties;\n\n// PROPERTY FUNCTIONS and STRING NAMES (defined in properties.cc).\n\n// Below are functions for getting property bit vectors when executing\n// mutation operations.\ninline uint64 SetStartProperties(uint64 inprops);\n\ntemplate <typename Weight>\nuint64 SetFinalProperties(uint64 inprops, const Weight &old_weight,\n                          const Weight &new_weight);\n\ninline uint64 AddStateProperties(uint64 inprops);\n\ntemplate <typename A>\nuint64 AddArcProperties(uint64 inprops, typename A::StateId s, const A &arc,\n                        const A *prev_arc);\n\ninline uint64 DeleteStatesProperties(uint64 inprops);\n\ninline uint64 DeleteAllStatesProperties(uint64 inprops, uint64 staticProps);\n\ninline uint64 DeleteArcsProperties(uint64 inprops);\n\nuint64 ClosureProperties(uint64 inprops, bool star, bool delayed = false);\n\nuint64 ComplementProperties(uint64 inprops);\n\nuint64 ComposeProperties(uint64 inprops1, uint64 inprops2);\n\nuint64 ConcatProperties(uint64 inprops1, uint64 inprops2, bool delayed = false);\n\nuint64 DeterminizeProperties(uint64 inprops, bool has_subsequential_label,\n                             bool distinct_psubsequential_labels);\n\nuint64 FactorWeightProperties(uint64 inprops);\n\nuint64 InvertProperties(uint64 inprops);\n\nuint64 ProjectProperties(uint64 inprops, bool project_input);\n\nuint64 RandGenProperties(uint64 inprops, bool weighted);\n\nuint64 RelabelProperties(uint64 inprops);\n\nuint64 ReplaceProperties(const std::vector<uint64> &inprops, ssize_t root,\n                         bool epsilon_on_call, bool epsilon_on_return,\n                         bool out_epsilon_on_call, bool out_epsilon_on_return,\n                         bool replace_transducer, bool no_empty_fst,\n                         bool all_ilabel_sorted, bool all_olabel_sorted,\n                         bool all_negative_or_dense);\n\nuint64 ReverseProperties(uint64 inprops, bool has_superinitial);\n\nuint64 ReweightProperties(uint64 inprops);\n\nuint64 RmEpsilonProperties(uint64 inprops, bool delayed = false);\n\nuint64 ShortestPathProperties(uint64 props, bool tree = false);\n\nuint64 SynchronizeProperties(uint64 inprops);\n\nuint64 UnionProperties(uint64 inprops1, uint64 inprops2, bool delayed = false);\n\n// Definitions of inlined functions.\n\nuint64 SetStartProperties(uint64 inprops) {\n  auto outprops = inprops & kSetStartProperties;\n  if (inprops & kAcyclic) {\n    outprops |= kInitialAcyclic;\n  }\n  return outprops;\n}\n\nuint64 AddStateProperties(uint64 inprops) {\n  return inprops & kAddStateProperties;\n}\n\nuint64 DeleteStatesProperties(uint64 inprops) {\n  return inprops & kDeleteStatesProperties;\n}\n\nuint64 DeleteAllStatesProperties(uint64 inprops, uint64 staticprops) {\n  const auto outprops = inprops & kError;\n  return outprops | kNullProperties | staticprops;\n}\n\nuint64 DeleteArcsProperties(uint64 inprops) {\n  return inprops & kDeleteArcsProperties;\n}\n\n// Definitions of template functions.\n\ntemplate <typename Weight>\nuint64 SetFinalProperties(uint64 inprops, const Weight &old_weight,\n                          const Weight &new_weight) {\n  auto outprops = inprops;\n  if (old_weight != Weight::Zero() && old_weight != Weight::One()) {\n    outprops &= ~kWeighted;\n  }\n  if (new_weight != Weight::Zero() && new_weight != Weight::One()) {\n    outprops |= kWeighted;\n    outprops &= ~kUnweighted;\n  }\n  outprops &= kSetFinalProperties | kWeighted | kUnweighted;\n  return outprops;\n}\n\n/// Gets the properties for the MutableFst::AddArc method.\n///\n/// \\param inprops  the current properties of the FST\n/// \\param s        the ID of the state to which an arc is being added.\n/// \\param arc      the arc being added to the state with the specified ID\n/// \\param prev_arc the previously-added (or \"last\") arc of state s, or nullptr\n//                  if s currently has no arcs.\ntemplate <typename Arc>\nuint64 AddArcProperties(uint64 inprops, typename Arc::StateId s,\n                        const Arc &arc, const Arc *prev_arc) {\n  using Weight = typename Arc::Weight;\n  auto outprops = inprops;\n  if (arc.ilabel != arc.olabel) {\n    outprops |= kNotAcceptor;\n    outprops &= ~kAcceptor;\n  }\n  if (arc.ilabel == 0) {\n    outprops |= kIEpsilons;\n    outprops &= ~kNoIEpsilons;\n    if (arc.olabel == 0) {\n      outprops |= kEpsilons;\n      outprops &= ~kNoEpsilons;\n    }\n  }\n  if (arc.olabel == 0) {\n    outprops |= kOEpsilons;\n    outprops &= ~kNoOEpsilons;\n  }\n  if (prev_arc) {\n    if (prev_arc->ilabel > arc.ilabel) {\n      outprops |= kNotILabelSorted;\n      outprops &= ~kILabelSorted;\n    }\n    if (prev_arc->olabel > arc.olabel) {\n      outprops |= kNotOLabelSorted;\n      outprops &= ~kOLabelSorted;\n    }\n  }\n  if (arc.weight != Weight::Zero() && arc.weight != Weight::One()) {\n    outprops |= kWeighted;\n    outprops &= ~kUnweighted;\n  }\n  if (arc.nextstate <= s) {\n    outprops |= kNotTopSorted;\n    outprops &= ~kTopSorted;\n  }\n  outprops &= kAddArcProperties | kAcceptor | kNoEpsilons | kNoIEpsilons |\n              kNoOEpsilons | kILabelSorted | kOLabelSorted | kUnweighted |\n              kTopSorted;\n  if (outprops & kTopSorted) {\n    outprops |= kAcyclic | kInitialAcyclic;\n  }\n  return outprops;\n}\n\nextern const char *PropertyNames[];\n\n}  // namespace fst\n\n#endif  // FST_PROPERTIES_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/prune.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Functions implementing pruning.\n\n#ifndef FST_PRUNE_H_\n#define FST_PRUNE_H_\n\n#include <type_traits>\n#include <utility>\n#include <vector>\n\n#include <fst/log.h>\n\n#include <fst/arcfilter.h>\n#include <fst/heap.h>\n#include <fst/shortest-distance.h>\n\n\nnamespace fst {\nnamespace internal {\n\ntemplate <class StateId, class Weight>\nclass PruneCompare {\n public:\n  PruneCompare(const std::vector<Weight> &idistance,\n               const std::vector<Weight> &fdistance)\n      : idistance_(idistance), fdistance_(fdistance) {}\n\n  bool operator()(const StateId x, const StateId y) const {\n    const auto wx = Times(IDistance(x), FDistance(x));\n    const auto wy = Times(IDistance(y), FDistance(y));\n    return less_(wx, wy);\n  }\n\n private:\n  Weight IDistance(const StateId s) const {\n    return s < idistance_.size() ? idistance_[s] : Weight::Zero();\n  }\n\n  Weight FDistance(const StateId s) const {\n    return s < fdistance_.size() ? fdistance_[s] : Weight::Zero();\n  }\n\n  const std::vector<Weight> &idistance_;\n  const std::vector<Weight> &fdistance_;\n  NaturalLess<Weight> less_;\n};\n\n}  // namespace internal\n\ntemplate <class Arc, class ArcFilter>\nstruct PruneOptions {\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  PruneOptions(const Weight &weight_threshold, StateId state_threshold,\n               ArcFilter filter, std::vector<Weight> *distance = nullptr,\n               float delta = kDelta, bool threshold_initial = false)\n      : weight_threshold(std::move(weight_threshold)),\n        state_threshold(state_threshold),\n        filter(std::move(filter)),\n        distance(distance),\n        delta(delta),\n        threshold_initial(threshold_initial) {}\n\n  // Pruning weight threshold.\n  Weight weight_threshold;\n  // Pruning state threshold.\n  StateId state_threshold;\n  // Arc filter.\n  ArcFilter filter;\n  // If non-zero, passes in pre-computed shortest distance to final states.\n  const std::vector<Weight> *distance;\n  // Determines the degree of convergence required when computing shortest\n  // distances.\n  float delta;\n  // Determines if the shortest path weight is left (true) or right\n  // (false) multiplied by the threshold to get the limit for\n  // keeping a state or arc (matters if the semiring is not\n  // commutative).\n  bool threshold_initial;\n};\n\n// Pruning algorithm: this version modifies its input and it takes an options\n// class as an argument. After pruning the FST contains states and arcs that\n// belong to a successful path in the FST whose weight is no more than the\n// weight of the shortest path Times() the provided weight threshold. When the\n// state threshold is not kNoStateId, the output FST is further restricted to\n// have no more than the number of states in opts.state_threshold. Weights must\n// have the path property. The weight of any cycle needs to be bounded; i.e.,\n//\n//   Plus(weight, Weight::One()) == Weight::One()\ntemplate <class Arc, class ArcFilter,\n          typename std::enable_if<\n              (Arc::Weight::Properties() & kPath) == kPath>::type * = nullptr>\nvoid Prune(MutableFst<Arc> *fst, const PruneOptions<Arc, ArcFilter> &opts) {\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n  using StateHeap = Heap<StateId, internal::PruneCompare<StateId, Weight>>;\n  auto ns = fst->NumStates();\n  if (ns < 1) return;\n  std::vector<Weight> idistance(ns, Weight::Zero());\n  std::vector<Weight> tmp;\n  if (!opts.distance) {\n    tmp.reserve(ns);\n    ShortestDistance(*fst, &tmp, true, opts.delta);\n  }\n  const auto *fdistance = opts.distance ? opts.distance : &tmp;\n  if ((opts.state_threshold == 0) || (fdistance->size() <= fst->Start()) ||\n      ((*fdistance)[fst->Start()] == Weight::Zero())) {\n    fst->DeleteStates();\n    return;\n  }\n  internal::PruneCompare<StateId, Weight> compare(idistance, *fdistance);\n  StateHeap heap(compare);\n  std::vector<bool> visited(ns, false);\n  std::vector<size_t> enqueued(ns, StateHeap::kNoKey);\n  std::vector<StateId> dead;\n  dead.push_back(fst->AddState());\n  NaturalLess<Weight> less;\n  auto s = fst->Start();\n  const auto limit = opts.threshold_initial ?\n      Times(opts.weight_threshold, (*fdistance)[s]) :\n      Times((*fdistance)[s], opts.weight_threshold);\n  StateId num_visited = 0;\n\n  if (!less(limit, (*fdistance)[s])) {\n    idistance[s] = Weight::One();\n    enqueued[s] = heap.Insert(s);\n    ++num_visited;\n  }\n  while (!heap.Empty()) {\n    s = heap.Top();\n    heap.Pop();\n    enqueued[s] = StateHeap::kNoKey;\n    visited[s] = true;\n    if (less(limit, Times(idistance[s], fst->Final(s)))) {\n      fst->SetFinal(s, Weight::Zero());\n    }\n    for (MutableArcIterator<MutableFst<Arc>> aiter(fst, s); !aiter.Done();\n         aiter.Next()) {\n      auto arc = aiter.Value();  // Copy intended.\n      if (!opts.filter(arc)) continue;\n      const auto weight = Times(Times(idistance[s], arc.weight),\n                                arc.nextstate < fdistance->size() ?\n                                (*fdistance)[arc.nextstate] : Weight::Zero());\n      if (less(limit, weight)) {\n        arc.nextstate = dead[0];\n        aiter.SetValue(arc);\n        continue;\n      }\n      if (less(Times(idistance[s], arc.weight), idistance[arc.nextstate])) {\n        idistance[arc.nextstate] = Times(idistance[s], arc.weight);\n      }\n      if (visited[arc.nextstate]) continue;\n      if ((opts.state_threshold != kNoStateId) &&\n          (num_visited >= opts.state_threshold)) {\n        continue;\n      }\n      if (enqueued[arc.nextstate] == StateHeap::kNoKey) {\n        enqueued[arc.nextstate] = heap.Insert(arc.nextstate);\n        ++num_visited;\n      } else {\n        heap.Update(enqueued[arc.nextstate], arc.nextstate);\n      }\n    }\n  }\n  for (StateId i = 0; i < visited.size(); ++i) {\n    if (!visited[i]) dead.push_back(i);\n  }\n  fst->DeleteStates(dead);\n}\n\ntemplate <class Arc, class ArcFilter,\n          typename std::enable_if<\n              (Arc::Weight::Properties() & kPath) != kPath>::type * = nullptr>\nvoid Prune(MutableFst<Arc> *fst, const PruneOptions<Arc, ArcFilter> &) {\n  FSTERROR() << \"Prune: Weight needs to have the path property: \"\n             << Arc::Weight::Type();\n  fst->SetProperties(kError, kError);\n}\n\n// Pruning algorithm: this version modifies its input and takes the\n// pruning threshold as an argument. It deletes states and arcs in the\n// FST that do not belong to a successful path whose weight is more\n// than the weight of the shortest path Times() the provided weight\n// threshold. When the state threshold is not kNoStateId, the output\n// FST is further restricted to have no more than the number of states\n// in opts.state_threshold. Weights must have the path property. The\n// weight of any cycle needs to be bounded; i.e.,\n//\n//   Plus(weight, Weight::One()) == Weight::One()\ntemplate <class Arc>\nvoid Prune(MutableFst<Arc> *fst, typename Arc::Weight weight_threshold,\n           typename Arc::StateId state_threshold = kNoStateId,\n           float delta = kDelta) {\n  const PruneOptions<Arc, AnyArcFilter<Arc>> opts(\n      weight_threshold, state_threshold, AnyArcFilter<Arc>(), nullptr, delta);\n  Prune(fst, opts);\n}\n\n// Pruning algorithm: this version writes the pruned input FST to an\n// output MutableFst and it takes an options class as an argument. The\n// output FST contains states and arcs that belong to a successful\n// path in the input FST whose weight is more than the weight of the\n// shortest path Times() the provided weight threshold. When the state\n// threshold is not kNoStateId, the output FST is further restricted\n// to have no more than the number of states in\n// opts.state_threshold. Weights have the path property.  The weight\n// of any cycle needs to be bounded; i.e.,\n//\n//   Plus(weight, Weight::One()) == Weight::One()\ntemplate <class Arc, class ArcFilter,\n          typename std::enable_if<IsPath<typename Arc::Weight>::value>::type * =\n              nullptr>\nvoid Prune(const Fst<Arc> &ifst, MutableFst<Arc> *ofst,\n           const PruneOptions<Arc, ArcFilter> &opts) {\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n  using StateHeap = Heap<StateId, internal::PruneCompare<StateId, Weight>>;\n  ofst->DeleteStates();\n  ofst->SetInputSymbols(ifst.InputSymbols());\n  ofst->SetOutputSymbols(ifst.OutputSymbols());\n  if (ifst.Start() == kNoStateId) return;\n  NaturalLess<Weight> less;\n  if (less(opts.weight_threshold, Weight::One()) ||\n      (opts.state_threshold == 0)) {\n    return;\n  }\n  std::vector<Weight> idistance;\n  std::vector<Weight> tmp;\n  if (!opts.distance) ShortestDistance(ifst, &tmp, true, opts.delta);\n  const auto *fdistance = opts.distance ? opts.distance : &tmp;\n  if ((fdistance->size() <= ifst.Start()) ||\n      ((*fdistance)[ifst.Start()] == Weight::Zero())) {\n    return;\n  }\n  internal::PruneCompare<StateId, Weight> compare(idistance, *fdistance);\n  StateHeap heap(compare);\n  std::vector<StateId> copy;\n  std::vector<size_t> enqueued;\n  std::vector<bool> visited;\n  auto s = ifst.Start();\n  const auto limit = opts.threshold_initial ?\n      Times(opts.weight_threshold, (*fdistance)[s]) :\n      Times((*fdistance)[s], opts.weight_threshold);\n  while (copy.size() <= s) copy.push_back(kNoStateId);\n  copy[s] = ofst->AddState();\n  ofst->SetStart(copy[s]);\n  while (idistance.size() <= s) idistance.push_back(Weight::Zero());\n  idistance[s] = Weight::One();\n  while (enqueued.size() <= s) {\n    enqueued.push_back(StateHeap::kNoKey);\n    visited.push_back(false);\n  }\n  enqueued[s] = heap.Insert(s);\n  while (!heap.Empty()) {\n    s = heap.Top();\n    heap.Pop();\n    enqueued[s] = StateHeap::kNoKey;\n    visited[s] = true;\n    if (!less(limit, Times(idistance[s], ifst.Final(s)))) {\n      ofst->SetFinal(copy[s], ifst.Final(s));\n    }\n    for (ArcIterator<Fst<Arc>> aiter(ifst, s); !aiter.Done(); aiter.Next()) {\n      const auto &arc = aiter.Value();\n      if (!opts.filter(arc)) continue;\n      const auto weight = Times(Times(idistance[s], arc.weight),\n                                arc.nextstate < fdistance->size() ?\n                                (*fdistance)[arc.nextstate] : Weight::Zero());\n      if (less(limit, weight)) continue;\n      if ((opts.state_threshold != kNoStateId) &&\n          (ofst->NumStates() >= opts.state_threshold)) {\n        continue;\n      }\n      while (idistance.size() <= arc.nextstate) {\n        idistance.push_back(Weight::Zero());\n      }\n      if (less(Times(idistance[s], arc.weight), idistance[arc.nextstate])) {\n        idistance[arc.nextstate] = Times(idistance[s], arc.weight);\n      }\n      while (copy.size() <= arc.nextstate) copy.push_back(kNoStateId);\n      if (copy[arc.nextstate] == kNoStateId) {\n        copy[arc.nextstate] = ofst->AddState();\n      }\n      ofst->AddArc(copy[s], Arc(arc.ilabel, arc.olabel, arc.weight,\n                                copy[arc.nextstate]));\n      while (enqueued.size() <= arc.nextstate) {\n        enqueued.push_back(StateHeap::kNoKey);\n        visited.push_back(false);\n      }\n      if (visited[arc.nextstate]) continue;\n      if (enqueued[arc.nextstate] == StateHeap::kNoKey) {\n        enqueued[arc.nextstate] = heap.Insert(arc.nextstate);\n      } else {\n        heap.Update(enqueued[arc.nextstate], arc.nextstate);\n      }\n    }\n  }\n}\n\ntemplate <class Arc, class ArcFilter,\n          typename std::enable_if<!IsPath<typename Arc::Weight>::value>::type\n              * = nullptr>\nvoid Prune(const Fst<Arc> &, MutableFst<Arc> *ofst,\n           const PruneOptions<Arc, ArcFilter> &) {\n  FSTERROR() << \"Prune: Weight needs to have the path property: \"\n             << Arc::Weight::Type();\n  ofst->SetProperties(kError, kError);\n}\n\n// Pruning algorithm: this version writes the pruned input FST to an\n// output MutableFst and simply takes the pruning threshold as an\n// argument. The output FST contains states and arcs that belong to a\n// successful path in the input FST whose weight is no more than the\n// weight of the shortest path Times() the provided weight\n// threshold. When the state threshold is not kNoStateId, the output\n// FST is further restricted to have no more than the number of states\n// in opts.state_threshold. Weights must have the path property. The\n// weight of any cycle needs to be bounded; i.e.,\n//\n// Plus(weight, Weight::One()) = Weight::One();\ntemplate <class Arc>\nvoid Prune(const Fst<Arc> &ifst, MutableFst<Arc> *ofst,\n           typename Arc::Weight weight_threshold,\n           typename Arc::StateId state_threshold = kNoStateId,\n           float delta = kDelta) {\n  const PruneOptions<Arc, AnyArcFilter<Arc>> opts(\n      weight_threshold, state_threshold, AnyArcFilter<Arc>(), nullptr, delta);\n  Prune(ifst, ofst, opts);\n}\n\n}  // namespace fst\n\n#endif  // FST_PRUNE_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/push.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Class to reweight/push an FST, and utility functions to weigh and reweight\n// an FST.\n\n#ifndef FST_PUSH_H_\n#define FST_PUSH_H_\n\n#include <vector>\n\n#include <fst/log.h>\n\n#include <fst/arc-map.h>\n#include <fst/factor-weight.h>\n#include <fst/fst.h>\n#include <fst/reweight.h>\n#include <fst/shortest-distance.h>\n\n\nnamespace fst {\n\n// Computes the total weight (sum of the weights of all accepting paths) from\n// the output of ShortestDistance, using the shortest distance from the final\n// state when reverse is true and from the initial state otherwise.\ntemplate <class Arc>\ntypename Arc::Weight ComputeTotalWeight(\n    const Fst<Arc> &fst, const std::vector<typename Arc::Weight> &distance,\n    bool reverse) {\n  if (reverse) {\n    return fst.Start() < distance.size() ? distance[fst.Start()]\n                                         : Arc::Weight::Zero();\n  }\n  auto sum = Arc::Weight::Zero();\n  for (typename Arc::StateId s = 0; s < distance.size(); ++s) {\n    sum = Plus(sum, Times(distance[s], fst.Final(s)));\n  }\n  return sum;\n}\n\n// Divides the weight of every accepting path by a fixed weight. This weight\n// is also divided at the final state if at_final is true and at the initial\n// state otherwise.\ntemplate <class Arc>\nvoid RemoveWeight(MutableFst<Arc> *fst, const typename Arc::Weight &weight,\n                  bool at_final) {\n  using Weight = typename Arc::Weight;\n  if ((weight == Weight::One()) || (weight == Weight::Zero())) return;\n  if (at_final) {\n    for (StateIterator<MutableFst<Arc>> siter(*fst); !siter.Done();\n         siter.Next()) {\n      fst->SetFinal(siter.Value(),\n                    Divide(fst->Final(siter.Value()), weight, DIVIDE_RIGHT));\n    }\n  } else {\n    const auto start = fst->Start();\n    for (MutableArcIterator<MutableFst<Arc>> aiter(fst, start); !aiter.Done();\n         aiter.Next()) {\n      auto arc = aiter.Value();\n      arc.weight = Divide(arc.weight, weight, DIVIDE_LEFT);\n      aiter.SetValue(arc);\n    }\n    fst->SetFinal(start, Divide(fst->Final(start), weight, DIVIDE_LEFT));\n  }\n}\n\n// Pushes the weights in FST in the direction defined by TYPE. If\n// pushing towards the initial state, the sum of the weight of the\n// outgoing transitions and final weight at a non-initial state is\n// equal to One() in the resulting machine. If pushing towards the\n// final state, the same property holds on the reverse machine.\n//\n// Weight needs to be left distributive when pushing towards the\n// initial state and right distributive when pushing towards the final\n// states.\ntemplate <class Arc>\nvoid Push(MutableFst<Arc> *fst, ReweightType type, float delta = kDelta,\n          bool remove_total_weight = false) {\n  using Weight = typename Arc::Weight;\n  std::vector<Weight> distance;\n  ShortestDistance(*fst, &distance, type == REWEIGHT_TO_INITIAL, delta);\n  auto total_weight = Weight::One();\n  if (remove_total_weight) {\n    total_weight =\n        ComputeTotalWeight(*fst, distance, type == REWEIGHT_TO_INITIAL);\n  }\n  Reweight(fst, distance, type);\n  if (remove_total_weight) {\n    RemoveWeight(fst, total_weight, type == REWEIGHT_TO_FINAL);\n  }\n}\n\nconstexpr uint32 kPushWeights = 0x0001;\nconstexpr uint32 kPushLabels = 0x0002;\nconstexpr uint32 kPushRemoveTotalWeight = 0x0004;\nconstexpr uint32 kPushRemoveCommonAffix = 0x0008;\n\n// Pushes the weights and/or labels of the input FST into the output\n// mutable FST by pushing weights and/or labels (as determined by the\n// ptype argument) towards the initial state or final states (as\n// determined by the rtype template parameter). The weight type must\n// be left distributive when pushing weights towards the initial state, and\n// right distribution when pushing weights towards the final states.\ntemplate <class Arc, ReweightType rtype>\nvoid Push(const Fst<Arc> &ifst, MutableFst<Arc> *ofst, uint32 ptype,\n          float delta = kDelta) {\n  using Label = typename Arc::Label;\n  using Weight = typename Arc::Weight;\n  if ((ptype & (kPushWeights | kPushLabels)) == kPushWeights) {\n    *ofst = ifst;\n    Push(ofst, rtype, delta, ptype & kPushRemoveTotalWeight);\n  } else if (ptype & kPushLabels) {\n    const auto gtype =\n        rtype == REWEIGHT_TO_INITIAL ? GALLIC_LEFT : GALLIC_RIGHT;\n    using GallicWeight = typename GallicArc<Arc, gtype>::Weight;\n    std::vector<GallicWeight> gdistance;\n    VectorFst<GallicArc<Arc, gtype>> gfst;\n    ArcMap(ifst, &gfst, ToGallicMapper<Arc, gtype>());\n    if (ptype & kPushWeights) {\n      ShortestDistance(gfst, &gdistance, rtype == REWEIGHT_TO_INITIAL, delta);\n    } else {\n      ArcMapFst<Arc, Arc, RmWeightMapper<Arc>> uwfst(ifst,\n                                                      RmWeightMapper<Arc>());\n      ArcMapFst<Arc, GallicArc<Arc, gtype>, ToGallicMapper<Arc, gtype>> guwfst(\n          uwfst, ToGallicMapper<Arc, gtype>());\n      ShortestDistance(guwfst, &gdistance, rtype == REWEIGHT_TO_INITIAL, delta);\n    }\n    auto total_weight = GallicWeight::One();\n    if (ptype & (kPushRemoveTotalWeight | kPushRemoveCommonAffix)) {\n      total_weight =\n          ComputeTotalWeight(gfst, gdistance, rtype == REWEIGHT_TO_INITIAL);\n      total_weight = GallicWeight(\n          ptype & kPushRemoveCommonAffix\n              ? total_weight.Value1()\n              : StringWeight<Label, GallicStringType(gtype)>::One(),\n          ptype & kPushRemoveTotalWeight ? total_weight.Value2()\n                                         : Weight::One());\n    }\n    Reweight(&gfst, gdistance, rtype);\n    if (ptype & (kPushRemoveTotalWeight | kPushRemoveCommonAffix)) {\n      RemoveWeight(&gfst, total_weight, rtype == REWEIGHT_TO_FINAL);\n    }\n    FactorWeightFst<GallicArc<Arc, gtype>, GallicFactor<Label, Weight, gtype>>\n        fwfst(gfst);\n    ArcMap(fwfst, ofst, FromGallicMapper<Arc, gtype>());\n    ofst->SetOutputSymbols(ifst.OutputSymbols());\n  } else {\n    LOG(WARNING) << \"Push: pushing type is set to 0, so not pushing\";\n    *ofst = ifst;\n  }\n}\n\n}  // namespace fst\n\n#endif  // FST_PUSH_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/queue.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Functions and classes for various FST state queues with a unified interface.\n\n#ifndef FST_QUEUE_H_\n#define FST_QUEUE_H_\n\n#include <deque>\n#include <memory>\n#include <type_traits>\n#include <utility>\n#include <vector>\n\n#include <fst/log.h>\n\n#include <fst/arcfilter.h>\n#include <fst/connect.h>\n#include <fst/heap.h>\n#include <fst/topsort.h>\n\n\nnamespace fst {\n\n// The Queue interface is:\n//\n// template <class S>\n// class Queue {\n//  public:\n//   using StateId = S;\n//\n//   // Constructor: may need args (e.g., FST, comparator) for some queues.\n//   Queue(...) override;\n//\n//   // Returns the head of the queue.\n//   StateId Head() const override;\n//\n//   // Inserts a state.\n//   void Enqueue(StateId s) override;\n//\n//   // Removes the head of the queue.\n//   void Dequeue() override;\n//\n//   // Updates ordering of state s when weight changes, if necessary.\n//   void Update(StateId s) override;\n//\n//   // Is the queue empty?\n//   bool Empty() const override;\n//\n//   // Removes all states from the queue.\n//   void Clear() override;\n// };\n\n// State queue types.\nenum QueueType {\n  TRIVIAL_QUEUE = 0,         // Single state queue.\n  FIFO_QUEUE = 1,            // First-in, first-out queue.\n  LIFO_QUEUE = 2,            // Last-in, first-out queue.\n  SHORTEST_FIRST_QUEUE = 3,  // Shortest-first queue.\n  TOP_ORDER_QUEUE = 4,       // Topologically-ordered queue.\n  STATE_ORDER_QUEUE = 5,     // State ID-ordered queue.\n  SCC_QUEUE = 6,             // Component graph top-ordered meta-queue.\n  AUTO_QUEUE = 7,            // Auto-selected queue.\n  OTHER_QUEUE = 8\n};\n\n// QueueBase, templated on the StateId, is a virtual base class shared by all\n// queues considered by AutoQueue.\ntemplate <class S>\nclass QueueBase {\n public:\n  using StateId = S;\n\n  virtual ~QueueBase() {}\n\n  // Concrete implementation.\n\n  explicit QueueBase(QueueType type) : queue_type_(type), error_(false) {}\n\n  void SetError(bool error) { error_ = error; }\n\n  bool Error() const { return error_; }\n\n  QueueType Type() const { return queue_type_; }\n\n  // Virtual interface.\n\n  virtual StateId Head() const = 0;\n  virtual void Enqueue(StateId) = 0;\n  virtual void Dequeue() = 0;\n  virtual void Update(StateId) = 0;\n  virtual bool Empty() const = 0;\n  virtual void Clear() = 0;\n\n private:\n  QueueType queue_type_;\n  bool error_;\n};\n\n// Trivial queue discipline; one may enqueue at most one state at a time. It\n// can be used for strongly connected components with only one state and no\n// self-loops.\ntemplate <class S>\nclass TrivialQueue : public QueueBase<S> {\n public:\n  using StateId = S;\n\n  TrivialQueue() : QueueBase<StateId>(TRIVIAL_QUEUE), front_(kNoStateId) {}\n\n  virtual ~TrivialQueue() = default;\n\n  StateId Head() const final { return front_; }\n\n  void Enqueue(StateId s) final { front_ = s; }\n\n  void Dequeue() final { front_ = kNoStateId; }\n\n  void Update(StateId) final {}\n\n  bool Empty() const final { return front_ == kNoStateId; }\n\n  void Clear() final { front_ = kNoStateId; }\n\n private:\n  StateId front_;\n};\n\n// First-in, first-out queue discipline.\n//\n// This is not a final class.\ntemplate <class S>\nclass FifoQueue : public QueueBase<S> {\n public:\n  using StateId = S;\n\n  FifoQueue() : QueueBase<StateId>(FIFO_QUEUE) {}\n\n  virtual ~FifoQueue() = default;\n\n  StateId Head() const override { return queue_.back(); }\n\n  void Enqueue(StateId s) override { queue_.push_front(s); }\n\n  void Dequeue() override { queue_.pop_back(); }\n\n  void Update(StateId) override {}\n\n  bool Empty() const override { return queue_.empty(); }\n\n  void Clear() override { queue_.clear(); }\n\n private:\n  std::deque<StateId> queue_;\n};\n\n// Last-in, first-out queue discipline.\ntemplate <class S>\nclass LifoQueue : public QueueBase<S> {\n public:\n  using StateId = S;\n\n  LifoQueue() : QueueBase<StateId>(LIFO_QUEUE) {}\n\n  virtual ~LifoQueue() = default;\n\n  StateId Head() const final { return queue_.front(); }\n\n  void Enqueue(StateId s) final { queue_.push_front(s); }\n\n  void Dequeue() final { queue_.pop_front(); }\n\n  void Update(StateId) final {}\n\n  bool Empty() const final { return queue_.empty(); }\n\n  void Clear() final { queue_.clear(); }\n\n private:\n  std::deque<StateId> queue_;\n};\n\n// Shortest-first queue discipline, templated on the StateId and as well as a\n// comparison functor used to compare two StateIds. If a (single) state's order\n// changes, it can be reordered in the queue with a call to Update(). If update\n// is false, call to Update() does not reorder the queue.\n//\n// This is not a final class.\ntemplate <typename S, typename Compare, bool update = true>\nclass ShortestFirstQueue : public QueueBase<S> {\n public:\n  using StateId = S;\n\n  explicit ShortestFirstQueue(Compare comp)\n      : QueueBase<StateId>(SHORTEST_FIRST_QUEUE), heap_(comp) {}\n\n  virtual ~ShortestFirstQueue() = default;\n\n  StateId Head() const override { return heap_.Top(); }\n\n  void Enqueue(StateId s) override {\n    if (update) {\n      for (StateId i = key_.size(); i <= s; ++i) key_.push_back(kNoStateId);\n      key_[s] = heap_.Insert(s);\n    } else {\n      heap_.Insert(s);\n    }\n  }\n\n  void Dequeue() override {\n    if (update) {\n      key_[heap_.Pop()] = kNoStateId;\n    } else {\n      heap_.Pop();\n    }\n  }\n\n  void Update(StateId s) override {\n    if (!update) return;\n    if (s >= key_.size() || key_[s] == kNoStateId) {\n      Enqueue(s);\n    } else {\n      heap_.Update(key_[s], s);\n    }\n  }\n\n  bool Empty() const override { return heap_.Empty(); }\n\n  void Clear() override {\n    heap_.Clear();\n    if (update) key_.clear();\n  }\n\n  const Compare &GetCompare() const { return heap_.GetCompare(); }\n\n private:\n  Heap<StateId, Compare> heap_;\n  std::vector<ssize_t> key_;\n};\n\nnamespace internal {\n\n// Given a vector that maps from states to weights, and a comparison functor\n// for weights, this class defines a comparison function object between states.\ntemplate <typename StateId, typename Less>\nclass StateWeightCompare {\n public:\n  using Weight = typename Less::Weight;\n\n  StateWeightCompare(const std::vector<Weight> &weights, const Less &less)\n      : weights_(weights), less_(less) {}\n\n  bool operator()(const StateId s1, const StateId s2) const {\n    return less_(weights_[s1], weights_[s2]);\n  }\n\n private:\n  // Borrowed references.\n  const std::vector<Weight> &weights_;\n  const Less &less_;\n};\n\n}  // namespace internal\n\n// Shortest-first queue discipline, templated on the StateId and Weight, is\n// specialized to use the weight's natural order for the comparison function.\ntemplate <typename S, typename Weight>\nclass NaturalShortestFirstQueue final\n    : public ShortestFirstQueue<\n          S, internal::StateWeightCompare<S, NaturalLess<Weight>>> {\n public:\n  using StateId = S;\n  using Compare = internal::StateWeightCompare<StateId, NaturalLess<Weight>>;\n\n  explicit NaturalShortestFirstQueue(const std::vector<Weight> &distance)\n      : ShortestFirstQueue<StateId, Compare>(Compare(distance, less_)) {}\n\n  virtual ~NaturalShortestFirstQueue() = default;\n\n private:\n  // This is non-static because the constructor for non-idempotent weights will\n  // result in a an error.\n  const NaturalLess<Weight> less_{};\n};\n\n// Topological-order queue discipline, templated on the StateId. States are\n// ordered in the queue topologically. The FST must be acyclic.\ntemplate <class S>\nclass TopOrderQueue : public QueueBase<S> {\n public:\n  using StateId = S;\n\n  // This constructor computes the topological order. It accepts an arc filter\n  // to limit the transitions considered in that computation (e.g., only the\n  // epsilon graph).\n  template <class Arc, class ArcFilter>\n  TopOrderQueue(const Fst<Arc> &fst, ArcFilter filter)\n      : QueueBase<StateId>(TOP_ORDER_QUEUE),\n        front_(0),\n        back_(kNoStateId),\n        order_(0),\n        state_(0) {\n    bool acyclic;\n    TopOrderVisitor<Arc> top_order_visitor(&order_, &acyclic);\n    DfsVisit(fst, &top_order_visitor, filter);\n    if (!acyclic) {\n      FSTERROR() << \"TopOrderQueue: FST is not acyclic\";\n      QueueBase<S>::SetError(true);\n    }\n    state_.resize(order_.size(), kNoStateId);\n  }\n\n  // This constructor is passed the pre-computed topological order.\n  explicit TopOrderQueue(const std::vector<StateId> &order)\n      : QueueBase<StateId>(TOP_ORDER_QUEUE),\n        front_(0),\n        back_(kNoStateId),\n        order_(order),\n        state_(order.size(), kNoStateId) {}\n\n  virtual ~TopOrderQueue() = default;\n\n  StateId Head() const final { return state_[front_]; }\n\n  void Enqueue(StateId s) final {\n    if (front_ > back_) {\n      front_ = back_ = order_[s];\n    } else if (order_[s] > back_) {\n      back_ = order_[s];\n    } else if (order_[s] < front_) {\n      front_ = order_[s];\n    }\n    state_[order_[s]] = s;\n  }\n\n  void Dequeue() final {\n    state_[front_] = kNoStateId;\n    while ((front_ <= back_) && (state_[front_] == kNoStateId)) ++front_;\n  }\n\n  void Update(StateId) final {}\n\n  bool Empty() const final { return front_ > back_; }\n\n  void Clear() final {\n    for (StateId s = front_; s <= back_; ++s) state_[s] = kNoStateId;\n    back_ = kNoStateId;\n    front_ = 0;\n  }\n\n private:\n  StateId front_;\n  StateId back_;\n  std::vector<StateId> order_;\n  std::vector<StateId> state_;\n};\n\n// State order queue discipline, templated on the StateId. States are ordered in\n// the queue by state ID.\ntemplate <class S>\nclass StateOrderQueue : public QueueBase<S> {\n public:\n  using StateId = S;\n\n  StateOrderQueue()\n      : QueueBase<StateId>(STATE_ORDER_QUEUE), front_(0), back_(kNoStateId) {}\n\n  virtual ~StateOrderQueue() = default;\n\n  StateId Head() const final { return front_; }\n\n  void Enqueue(StateId s) final {\n    if (front_ > back_) {\n      front_ = back_ = s;\n    } else if (s > back_) {\n      back_ = s;\n    } else if (s < front_) {\n      front_ = s;\n    }\n    while (enqueued_.size() <= s) enqueued_.push_back(false);\n    enqueued_[s] = true;\n  }\n\n  void Dequeue() final {\n    enqueued_[front_] = false;\n    while ((front_ <= back_) && (enqueued_[front_] == false)) ++front_;\n  }\n\n  void Update(StateId) final {}\n\n  bool Empty() const final { return front_ > back_; }\n\n  void Clear() final {\n    for (StateId i = front_; i <= back_; ++i) enqueued_[i] = false;\n    front_ = 0;\n    back_ = kNoStateId;\n  }\n\n private:\n  StateId front_;\n  StateId back_;\n  std::vector<bool> enqueued_;\n};\n\n// SCC topological-order meta-queue discipline, templated on the StateId and a\n// queue used inside each SCC. It visits the SCCs of an FST in topological\n// order. Its constructor is passed the queues to to use within an SCC.\ntemplate <class S, class Queue>\nclass SccQueue : public QueueBase<S> {\n public:\n  using StateId = S;\n\n  // Constructor takes a vector specifying the SCC number per state and a\n  // vector giving the queue to use per SCC number.\n  SccQueue(const std::vector<StateId> &scc,\n           std::vector<std::unique_ptr<Queue>> *queue)\n      : QueueBase<StateId>(SCC_QUEUE),\n        queue_(queue),\n        scc_(scc),\n        front_(0),\n        back_(kNoStateId) {}\n\n  virtual ~SccQueue() = default;\n\n  StateId Head() const final {\n    while ((front_ <= back_) &&\n           (((*queue_)[front_] && (*queue_)[front_]->Empty()) ||\n            (((*queue_)[front_] == nullptr) &&\n             ((front_ >= trivial_queue_.size()) ||\n              (trivial_queue_[front_] == kNoStateId))))) {\n      ++front_;\n    }\n    if ((*queue_)[front_]) {\n      return (*queue_)[front_]->Head();\n    } else {\n      return trivial_queue_[front_];\n    }\n  }\n\n  void Enqueue(StateId s) final {\n    if (front_ > back_) {\n      front_ = back_ = scc_[s];\n    } else if (scc_[s] > back_) {\n      back_ = scc_[s];\n    } else if (scc_[s] < front_) {\n      front_ = scc_[s];\n    }\n    if ((*queue_)[scc_[s]]) {\n      (*queue_)[scc_[s]]->Enqueue(s);\n    } else {\n      while (trivial_queue_.size() <= scc_[s]) {\n        trivial_queue_.push_back(kNoStateId);\n      }\n      trivial_queue_[scc_[s]] = s;\n    }\n  }\n\n  void Dequeue() final {\n    if ((*queue_)[front_]) {\n      (*queue_)[front_]->Dequeue();\n    } else if (front_ < trivial_queue_.size()) {\n      trivial_queue_[front_] = kNoStateId;\n    }\n  }\n\n  void Update(StateId s) final {\n    if ((*queue_)[scc_[s]]) (*queue_)[scc_[s]]->Update(s);\n  }\n\n  bool Empty() const final {\n    // Queues SCC number back_ is not empty unless back_ == front_.\n    if (front_ < back_) {\n      return false;\n    } else if (front_ > back_) {\n      return true;\n    } else if ((*queue_)[front_]) {\n      return (*queue_)[front_]->Empty();\n    } else {\n      return (front_ >= trivial_queue_.size()) ||\n             (trivial_queue_[front_] == kNoStateId);\n    }\n  }\n\n  void Clear() final {\n    for (StateId i = front_; i <= back_; ++i) {\n      if ((*queue_)[i]) {\n        (*queue_)[i]->Clear();\n      } else if (i < trivial_queue_.size()) {\n        trivial_queue_[i] = kNoStateId;\n      }\n    }\n    front_ = 0;\n    back_ = kNoStateId;\n  }\n\n private:\n  std::vector<std::unique_ptr<Queue>> *queue_;\n  const std::vector<StateId> &scc_;\n  mutable StateId front_;\n  StateId back_;\n  std::vector<StateId> trivial_queue_;\n};\n\n// Automatic queue discipline. It selects a queue discipline for a given FST\n// based on its properties.\ntemplate <class S>\nclass AutoQueue : public QueueBase<S> {\n public:\n  using StateId = S;\n\n  // This constructor takes a state distance vector that, if non-null and if\n  // the Weight type has the path property, will entertain the shortest-first\n  // queue using the natural order w.r.t to the distance.\n  template <class Arc, class ArcFilter>\n  AutoQueue(const Fst<Arc> &fst,\n            const std::vector<typename Arc::Weight> *distance, ArcFilter filter)\n      : QueueBase<StateId>(AUTO_QUEUE) {\n    using Weight = typename Arc::Weight;\n    using Less = NaturalLess<Weight>;\n    using Compare = internal::StateWeightCompare<StateId, Less>;\n    // First checks if the FST is known to have these properties.\n    const auto props =\n        fst.Properties(kAcyclic | kCyclic | kTopSorted | kUnweighted, false);\n    if ((props & kTopSorted) || fst.Start() == kNoStateId) {\n      queue_.reset(new StateOrderQueue<StateId>());\n      VLOG(2) << \"AutoQueue: using state-order discipline\";\n    } else if (props & kAcyclic) {\n      queue_.reset(new TopOrderQueue<StateId>(fst, filter));\n      VLOG(2) << \"AutoQueue: using top-order discipline\";\n    } else if ((props & kUnweighted) && (Weight::Properties() & kIdempotent)) {\n      queue_.reset(new LifoQueue<StateId>());\n      VLOG(2) << \"AutoQueue: using LIFO discipline\";\n    } else {\n      uint64 properties;\n      // Decomposes into strongly-connected components.\n      SccVisitor<Arc> scc_visitor(&scc_, nullptr, nullptr, &properties);\n      DfsVisit(fst, &scc_visitor, filter);\n      auto nscc = *std::max_element(scc_.begin(), scc_.end()) + 1;\n      std::vector<QueueType> queue_types(nscc);\n      std::unique_ptr<Less> less;\n      std::unique_ptr<Compare> comp;\n      if (distance && (Weight::Properties() & kPath) == kPath) {\n        less.reset(new Less);\n        comp.reset(new Compare(*distance, *less));\n      }\n      // Finds the queue type to use per SCC.\n      bool unweighted;\n      bool all_trivial;\n      SccQueueType(fst, scc_, &queue_types, filter, less.get(), &all_trivial,\n                   &unweighted);\n      // If unweighted and semiring is idempotent, uses LIFO queue.\n      if (unweighted) {\n        queue_.reset(new LifoQueue<StateId>());\n        VLOG(2) << \"AutoQueue: using LIFO discipline\";\n        return;\n      }\n      // If all the SCC are trivial, the FST is acyclic and the scc number gives\n      // the topological order.\n      if (all_trivial) {\n        queue_.reset(new TopOrderQueue<StateId>(scc_));\n        VLOG(2) << \"AutoQueue: using top-order discipline\";\n        return;\n      }\n      VLOG(2) << \"AutoQueue: using SCC meta-discipline\";\n      queues_.resize(nscc);\n      for (StateId i = 0; i < nscc; ++i) {\n        switch (queue_types[i]) {\n          case TRIVIAL_QUEUE:\n            queues_[i].reset();\n            VLOG(3) << \"AutoQueue: SCC #\" << i << \": using trivial discipline\";\n            break;\n          case SHORTEST_FIRST_QUEUE:\n            queues_[i].reset(\n                new ShortestFirstQueue<StateId, Compare, false>(*comp));\n            VLOG(3) << \"AutoQueue: SCC #\" << i\n                    << \": using shortest-first discipline\";\n            break;\n          case LIFO_QUEUE:\n            queues_[i].reset(new LifoQueue<StateId>());\n            VLOG(3) << \"AutoQueue: SCC #\" << i << \": using LIFO discipline\";\n            break;\n          case FIFO_QUEUE:\n          default:\n            queues_[i].reset(new FifoQueue<StateId>());\n            VLOG(3) << \"AutoQueue: SCC #\" << i << \": using FIFO discipine\";\n            break;\n        }\n      }\n      queue_.reset(new SccQueue<StateId, QueueBase<StateId>>(scc_, &queues_));\n    }\n  }\n\n  virtual ~AutoQueue() = default;\n\n  StateId Head() const final { return queue_->Head(); }\n\n  void Enqueue(StateId s) final { queue_->Enqueue(s); }\n\n  void Dequeue() final { queue_->Dequeue(); }\n\n  void Update(StateId s) final { queue_->Update(s); }\n\n  bool Empty() const final { return queue_->Empty(); }\n\n  void Clear() final { queue_->Clear(); }\n\n private:\n  template <class Arc, class ArcFilter, class Less>\n  static void SccQueueType(const Fst<Arc> &fst, const std::vector<StateId> &scc,\n                           std::vector<QueueType> *queue_types,\n                           ArcFilter filter, Less *less, bool *all_trivial,\n                           bool *unweighted);\n\n  std::unique_ptr<QueueBase<StateId>> queue_;\n  std::vector<std::unique_ptr<QueueBase<StateId>>> queues_;\n  std::vector<StateId> scc_;\n};\n\n// Examines the states in an FST's strongly connected components and determines\n// which type of queue to use per SCC. Stores result as a vector of QueueTypes\n// which is assumed to have length equal to the number of SCCs. An arc filter\n// is used to limit the transitions considered (e.g., only the epsilon graph).\n// The argument all_trivial is set to true if every queue is the trivial queue.\n// The argument unweighted is set to true if the semiring is idempotent and all\n// the arc weights are equal to Zero() or One().\ntemplate <class StateId>\ntemplate <class Arc, class ArcFilter, class Less>\nvoid AutoQueue<StateId>::SccQueueType(const Fst<Arc> &fst,\n                                      const std::vector<StateId> &scc,\n                                      std::vector<QueueType> *queue_type,\n                                      ArcFilter filter, Less *less,\n                                      bool *all_trivial, bool *unweighted) {\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n  *all_trivial = true;\n  *unweighted = true;\n  for (StateId i = 0; i < queue_type->size(); ++i) {\n    (*queue_type)[i] = TRIVIAL_QUEUE;\n  }\n  for (StateIterator<Fst<Arc>> sit(fst); !sit.Done(); sit.Next()) {\n    const auto state = sit.Value();\n    for (ArcIterator<Fst<Arc>> ait(fst, state); !ait.Done(); ait.Next()) {\n      const auto &arc = ait.Value();\n      if (!filter(arc)) continue;\n      if (scc[state] == scc[arc.nextstate]) {\n        auto &type = (*queue_type)[scc[state]];\n        if (!less || ((*less)(arc.weight, Weight::One()))) {\n          type = FIFO_QUEUE;\n        } else if ((type == TRIVIAL_QUEUE) || (type == LIFO_QUEUE)) {\n          if (!(Weight::Properties() & kIdempotent) ||\n              (arc.weight != Weight::Zero() && arc.weight != Weight::One())) {\n            type = SHORTEST_FIRST_QUEUE;\n          } else {\n            type = LIFO_QUEUE;\n          }\n        }\n        if (type != TRIVIAL_QUEUE) *all_trivial = false;\n      }\n      if (!(Weight::Properties() & kIdempotent) ||\n          (arc.weight != Weight::Zero() && arc.weight != Weight::One())) {\n        *unweighted = false;\n      }\n    }\n  }\n}\n\n// An A* estimate is a function object that maps from a state ID to a an\n// estimate of the shortest distance to the final states.\n\n// A trivial A* estimate, yielding a queue which behaves the same in Dijkstra's\n// algorithm.\ntemplate <typename StateId, typename Weight>\nstruct TrivialAStarEstimate {\n  const Weight &operator()(StateId) const { return Weight::One(); }\n};\n\n// A non-trivial A* estimate using a vector of the estimated future costs.\ntemplate <typename StateId, typename Weight>\nclass NaturalAStarEstimate {\n public:\n  NaturalAStarEstimate(const std::vector<Weight> &beta) :\n          beta_(beta) {}\n\n  const Weight &operator()(StateId s) const { return beta_[s]; }\n\n private:\n  const std::vector<Weight> &beta_;\n};\n\n// Given a vector that maps from states to weights representing the shortest\n// distance from the initial state, a comparison function object between\n// weights, and an estimate of the shortest distance to the final states, this\n// class defines a comparison function object between states.\ntemplate <typename S, typename Less, typename Estimate>\nclass AStarWeightCompare {\n public:\n  using StateId = S;\n  using Weight = typename Less::Weight;\n\n  AStarWeightCompare(const std::vector<Weight> &weights, const Less &less,\n                     const Estimate &estimate)\n      : weights_(weights), less_(less), estimate_(estimate) {}\n\n  bool operator()(StateId s1, StateId s2) const {\n    const auto w1 = Times(weights_[s1], estimate_(s1));\n    const auto w2 = Times(weights_[s2], estimate_(s2));\n    return less_(w1, w2);\n  }\n\n  const Estimate &GetEstimate() const { return estimate_; }\n\n private:\n  const std::vector<Weight> &weights_;\n  const Less &less_;\n  const Estimate &estimate_;\n};\n\n// A* queue discipline templated on StateId, Weight, and Estimate.\ntemplate <typename S, typename Weight, typename Estimate>\nclass NaturalAStarQueue : public ShortestFirstQueue<\n          S, AStarWeightCompare<S, NaturalLess<Weight>, Estimate>> {\n public:\n  using StateId = S;\n  using Compare = AStarWeightCompare<StateId, NaturalLess<Weight>, Estimate>;\n\n  NaturalAStarQueue(const std::vector<Weight> &distance,\n                    const Estimate &estimate)\n      : ShortestFirstQueue<StateId, Compare>(\n            Compare(distance, less_, estimate)) {}\n\n  ~NaturalAStarQueue() = default;\n\n private:\n  // This is non-static because the constructor for non-idempotent weights will\n  // result in a an error.\n  const NaturalLess<Weight> less_{};\n};\n\n// A state equivalence class is a function object that maps from a state ID to\n// an equivalence class (state) ID. The trivial equivalence class maps a state\n// ID to itself.\ntemplate <typename StateId>\nstruct TrivialStateEquivClass {\n  StateId operator()(StateId s) const { return s; }\n};\n\n// Distance-based pruning queue discipline: Enqueues a state only when its\n// shortest distance (so far), as specified by distance, is less than (as\n// specified by comp) the shortest distance Times() the threshold to any state\n// in the same equivalence class, as specified by the functor class_func. The\n// underlying queue discipline is specified by queue. The ownership of queue is\n// given to this class.\n//\n// This is not a final class.\ntemplate <typename Queue, typename Less, typename ClassFnc>\nclass PruneQueue : public QueueBase<typename Queue::StateId> {\n public:\n  using StateId = typename Queue::StateId;\n  using Weight = typename Less::Weight;\n\n  PruneQueue(const std::vector<Weight> &distance, Queue *queue,\n             const Less &less, const ClassFnc &class_fnc, Weight threshold)\n      : QueueBase<StateId>(OTHER_QUEUE),\n        distance_(distance),\n        queue_(queue),\n        less_(less),\n        class_fnc_(class_fnc),\n        threshold_(std::move(threshold)) {}\n\n  virtual ~PruneQueue() = default;\n\n  StateId Head() const override { return queue_->Head(); }\n\n  void Enqueue(StateId s) override {\n    const auto c = class_fnc_(s);\n    if (c >= class_distance_.size()) {\n      class_distance_.resize(c + 1, Weight::Zero());\n    }\n    if (less_(distance_[s], class_distance_[c])) {\n      class_distance_[c] = distance_[s];\n    }\n    // Enqueues only if below threshold limit.\n    const auto limit = Times(class_distance_[c], threshold_);\n    if (less_(distance_[s], limit)) queue_->Enqueue(s);\n  }\n\n  void Dequeue() override { queue_->Dequeue(); }\n\n  void Update(StateId s) override {\n    const auto c = class_fnc_(s);\n    if (less_(distance_[s], class_distance_[c])) {\n      class_distance_[c] = distance_[s];\n    }\n    queue_->Update(s);\n  }\n\n  bool Empty() const override { return queue_->Empty(); }\n\n  void Clear() override { queue_->Clear(); }\n\n private:\n  const std::vector<Weight> &distance_;  // Shortest distance to state.\n  std::unique_ptr<Queue> queue_;\n  const Less &less_;                    // Borrowed reference.\n  const ClassFnc &class_fnc_;           // Equivalence class functor.\n  Weight threshold_;                    // Pruning weight threshold.\n  std::vector<Weight> class_distance_;  // Shortest distance to class.\n};\n\n// Pruning queue discipline (see above) using the weight's natural order for the\n// comparison function. The ownership of the queue argument is given to this\n// class.\ntemplate <typename Queue, typename Weight, typename ClassFnc>\nclass NaturalPruneQueue final\n    : public PruneQueue<Queue, NaturalLess<Weight>, ClassFnc> {\n public:\n  using StateId = typename Queue::StateId;\n\n  NaturalPruneQueue(const std::vector<Weight> &distance, Queue *queue,\n                    const ClassFnc &class_fnc, Weight threshold)\n      : PruneQueue<Queue, NaturalLess<Weight>, ClassFnc>(\n            distance, queue, NaturalLess<Weight>(), class_fnc, threshold) {}\n\n  virtual ~NaturalPruneQueue() = default;\n};\n\n// Filter-based pruning queue discipline: enqueues a state only if allowed by\n// the filter, specified by the state filter functor argument. The underlying\n// queue discipline is specified by the queue argument. The ownership of the\n// queue is given to this class.\ntemplate <typename Queue, typename Filter>\nclass FilterQueue : public QueueBase<typename Queue::StateId> {\n public:\n  using StateId = typename Queue::StateId;\n\n  FilterQueue(Queue *queue, const Filter &filter)\n      : QueueBase<StateId>(OTHER_QUEUE), queue_(queue), filter_(filter) {}\n\n  virtual ~FilterQueue() = default;\n\n  StateId Head() const final { return queue_->Head(); }\n\n  // Enqueues only if allowed by state filter.\n  void Enqueue(StateId s) final {\n    if (filter_(s)) queue_->Enqueue(s);\n  }\n\n  void Dequeue() final { queue_->Dequeue(); }\n\n  void Update(StateId s) final {}\n\n  bool Empty() const final { return queue_->Empty(); }\n\n  void Clear() final { queue_->Clear(); }\n\n private:\n  std::unique_ptr<Queue> queue_;\n  const Filter &filter_;\n};\n\n}  // namespace fst\n\n#endif  // FST_QUEUE_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/randequivalent.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Tests if two FSTS are equivalent by checking if random strings from one FST\n// are transduced the same by both FSTs.\n\n#ifndef FST_RANDEQUIVALENT_H_\n#define FST_RANDEQUIVALENT_H_\n\n#include <fst/log.h>\n\n#include <fst/arcsort.h>\n#include <fst/compose.h>\n#include <fst/project.h>\n#include <fst/randgen.h>\n#include <fst/shortest-distance.h>\n#include <fst/vector-fst.h>\n\n\nnamespace fst {\n\n// Test if two FSTs are stochastically equivalent by randomly generating\n// random paths through the FSTs.\n//\n// For each randomly generated path, the algorithm computes for each\n// of the two FSTs the sum of the weights of all the successful paths\n// sharing the same input and output labels as the considered randomly\n// generated path and checks that these two values are within a user-specified\n// delta. Returns optional error value (when FLAGS_error_fatal = false).\ntemplate <class Arc, class ArcSelector>\nbool RandEquivalent(const Fst<Arc> &fst1, const Fst<Arc> &fst2,\n                    int32 num_paths, float delta,\n                    const RandGenOptions<ArcSelector> &opts,\n                    bool *error = nullptr) {\n  using Weight = typename Arc::Weight;\n  if (error) *error = false;\n  // Checks that the symbol table are compatible.\n  if (!CompatSymbols(fst1.InputSymbols(), fst2.InputSymbols()) ||\n      !CompatSymbols(fst1.OutputSymbols(), fst2.OutputSymbols())) {\n    FSTERROR() << \"RandEquivalent: Input/output symbol tables of 1st \"\n               << \"argument do not match input/output symbol tables of 2nd \"\n               << \"argument\";\n    if (error) *error = true;\n    return false;\n  }\n  static const ILabelCompare<Arc> icomp;\n  static const OLabelCompare<Arc> ocomp;\n  VectorFst<Arc> sfst1(fst1);\n  VectorFst<Arc> sfst2(fst2);\n  Connect(&sfst1);\n  Connect(&sfst2);\n  ArcSort(&sfst1, icomp);\n  ArcSort(&sfst2, icomp);\n  bool result = true;\n  for (int32 n = 0; n < num_paths; ++n) {\n    VectorFst<Arc> path;\n    const auto &fst = rand() % 2 ? sfst1 : sfst2;  // NOLINT\n    RandGen(fst, &path, opts);\n    VectorFst<Arc> ipath(path);\n    VectorFst<Arc> opath(path);\n    Project(&ipath, PROJECT_INPUT);\n    Project(&opath, PROJECT_OUTPUT);\n    VectorFst<Arc> cfst1, pfst1;\n    Compose(ipath, sfst1, &cfst1);\n    ArcSort(&cfst1, ocomp);\n    Compose(cfst1, opath, &pfst1);\n    // Gives up if there are epsilon cycles in a non-idempotent semiring.\n    if (!(Weight::Properties() & kIdempotent) &&\n        pfst1.Properties(kCyclic, true)) {\n      continue;\n    }\n    const auto sum1 = ShortestDistance(pfst1);\n    VectorFst<Arc> cfst2;\n    Compose(ipath, sfst2, &cfst2);\n    ArcSort(&cfst2, ocomp);\n    VectorFst<Arc> pfst2;\n    Compose(cfst2, opath, &pfst2);\n    // Gives up if there are epsilon cycles in a non-idempotent semiring.\n    if (!(Weight::Properties() & kIdempotent) &&\n        pfst2.Properties(kCyclic, true)) {\n      continue;\n    }\n    const auto sum2 = ShortestDistance(pfst2);\n    if (!ApproxEqual(sum1, sum2, delta)) {\n      VLOG(1) << \"Sum1 = \" << sum1;\n      VLOG(1) << \"Sum2 = \" << sum2;\n      result = false;\n      break;\n    }\n  }\n  if (fst1.Properties(kError, false) || fst2.Properties(kError, false)) {\n    if (error) *error = true;\n    return false;\n  }\n  return result;\n}\n\n// Tests if two FSTs are equivalent by randomly generating a nnum_paths paths\n// (no longer than the path_length) using a user-specified seed, optionally\n// indicating an error setting an optional error argument to true.\ntemplate <class Arc>\nbool RandEquivalent(const Fst<Arc> &fst1, const Fst<Arc> &fst2, int32 num_paths,\n                    float delta = kDelta, time_t seed = time(nullptr),\n                    int32 max_length = std::numeric_limits<int32>::max(),\n                    bool *error = nullptr) {\n  const UniformArcSelector<Arc> uniform_selector(seed);\n  const RandGenOptions<UniformArcSelector<Arc>> opts(uniform_selector,\n                                                     max_length);\n  return RandEquivalent(fst1, fst2, num_paths, delta, opts, error);\n}\n\n}  // namespace fst\n\n#endif  // FST_RANDEQUIVALENT_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/randgen.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Classes and functions to generate random paths through an FST.\n\n#ifndef FST_RANDGEN_H_\n#define FST_RANDGEN_H_\n\n#include <math.h>\n#include <stddef.h>\n#include <limits>\n#include <map>\n#include <memory>\n#include <random>\n#include <utility>\n#include <vector>\n\n#include <fst/log.h>\n\n#include <fst/accumulator.h>\n#include <fst/cache.h>\n#include <fst/dfs-visit.h>\n#include <fst/float-weight.h>\n#include <fst/fst-decl.h>\n#include <fst/fst.h>\n#include <fst/mutable-fst.h>\n#include <fst/properties.h>\n#include <fst/util.h>\n#include <fst/weight.h>\n\nnamespace fst {\n\n// The RandGenFst class is roughly similar to ArcMapFst in that it takes two\n// template parameters denoting the input and output arc types. However, it also\n// takes an additional template parameter which specifies a sampler object which\n// samples (with replacement) arcs from an FST state. The sampler in turn takes\n// a template parameter for a selector object which actually chooses the arc.\n//\n// Arc selector functors are used to select a random transition given an FST\n// state s, returning a number N such that 0 <= N <= NumArcs(s). If N is\n// NumArcs(s), then the final weight is selected; otherwise the N-th arc is\n// selected. It is assumed these are not applied to any state which is neither\n// final nor has any arcs leaving it.\n\n// Randomly selects a transition using the uniform distribution. This class is\n// not thread-safe.\ntemplate <class Arc>\nclass UniformArcSelector {\n public:\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  // Constructs a selector with a non-deterministic seed.\n  UniformArcSelector() : rand_(std::random_device()()) {}\n  // Constructs a selector with a given seed.\n  explicit UniformArcSelector(uint64 seed) : rand_(seed) {}\n\n  size_t operator()(const Fst<Arc> &fst, StateId s) const {\n    const auto n = fst.NumArcs(s) + (fst.Final(s) != Weight::Zero());\n    return static_cast<size_t>(\n        std::uniform_int_distribution<>(0, n - 1)(rand_));\n  }\n\n private:\n  mutable std::mt19937_64 rand_;\n};\n\n// Randomly selects a transition w.r.t. the weights treated as negative log\n// probabilities after normalizing for the total weight leaving the state. Zero\n// transitions are disregarded. It assumed that Arc::Weight::Value() accesses\n// the floating point representation of the weight. This class is not\n// thread-safe.\ntemplate <class Arc>\nclass LogProbArcSelector {\n public:\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  // Constructs a selector with a non-deterministic seed.\n  LogProbArcSelector() : rand_(std::random_device()()) {}\n  // Constructs a selector with a given seed.\n  explicit LogProbArcSelector(uint64 seed) : rand_(seed) {}\n\n  size_t operator()(const Fst<Arc> &fst, StateId s) const {\n    // Finds total weight leaving state.\n    auto sum = Log64Weight::Zero();\n    ArcIterator<Fst<Arc>> aiter(fst, s);\n    for (; !aiter.Done(); aiter.Next()) {\n      const auto &arc = aiter.Value();\n      sum = Plus(sum, to_log_weight_(arc.weight));\n    }\n    sum = Plus(sum, to_log_weight_(fst.Final(s)));\n    const double threshold =\n        std::uniform_real_distribution<>(0, exp(-sum.Value()))(rand_);\n    auto p = Log64Weight::Zero();\n    size_t n = 0;\n    for (aiter.Reset(); !aiter.Done(); aiter.Next(), ++n) {\n      p = Plus(p, to_log_weight_(aiter.Value().weight));\n      if (exp(-p.Value()) > threshold) return n;\n    }\n    return n;\n  }\n\n private:\n  mutable std::mt19937_64 rand_;\n  WeightConvert<Weight, Log64Weight> to_log_weight_;\n};\n\n// Useful alias when using StdArc.\nusing StdArcSelector = LogProbArcSelector<StdArc>;\n\n// Same as LogProbArcSelector but use CacheLogAccumulator to cache the weight\n// accumulation computations. This class is not thread-safe.\ntemplate <class Arc>\nclass FastLogProbArcSelector : public LogProbArcSelector<Arc> {\n public:\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using LogProbArcSelector<Arc>::operator();\n\n  // Constructs a selector with a non-deterministic seed.\n  FastLogProbArcSelector() : seed_(std::random_device()()), rand_(seed_) {}\n  // Constructs a selector with a given seed.\n  explicit FastLogProbArcSelector(uint64 seed) : seed_(seed), rand_(seed_) {}\n\n  size_t operator()(const Fst<Arc> &fst, StateId s,\n                    CacheLogAccumulator<Arc> *accumulator) const {\n    accumulator->SetState(s);\n    ArcIterator<Fst<Arc>> aiter(fst, s);\n    // Finds total weight leaving state.\n    const double sum = to_log_weight_(accumulator->Sum(fst.Final(s), &aiter, 0,\n                                                       fst.NumArcs(s)))\n                           .Value();\n    const double r = -log(std::uniform_real_distribution<>(0, 1)(rand_));\n    Weight w = from_log_weight_(r + sum);\n    aiter.Reset();\n    return accumulator->LowerBound(w, &aiter);\n  }\n\n  uint64 Seed() const { return seed_; }\n\n private:\n  const uint64 seed_;\n  mutable std::mt19937_64 rand_;\n  WeightConvert<Weight, Log64Weight> to_log_weight_;\n  WeightConvert<Log64Weight, Weight> from_log_weight_;\n};\n\n// Random path state info maintained by RandGenFst and passed to samplers.\ntemplate <typename Arc>\nstruct RandState {\n  using StateId = typename Arc::StateId;\n\n  StateId state_id;  // Current input FST state.\n  size_t nsamples;   // Number of samples to be sampled at this state.\n  size_t length;     // Length of path to this random state.\n  size_t select;     // Previous sample arc selection.\n  const RandState<Arc> *parent;  // Previous random state on this path.\n\n  explicit RandState(StateId state_id, size_t nsamples = 0, size_t length = 0,\n                     size_t select = 0, const RandState<Arc> *parent = nullptr)\n      : state_id(state_id),\n        nsamples(nsamples),\n        length(length),\n        select(select),\n        parent(parent) {}\n\n  RandState() : RandState(kNoStateId) {}\n};\n\n// This class, given an arc selector, samples, with replacement, multiple random\n// transitions from an FST's state. This is a generic version with a\n// straightforward use of the arc selector. Specializations may be defined for\n// arc selectors for greater efficiency or special behavior.\ntemplate <class Arc, class Selector>\nclass ArcSampler {\n public:\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  // The max_length argument may be interpreted (or ignored) by a selector as\n  // it chooses. This generic version interprets this literally.\n  ArcSampler(const Fst<Arc> &fst, const Selector &selector,\n             int32 max_length = std::numeric_limits<int32>::max())\n      : fst_(fst), selector_(selector), max_length_(max_length) {}\n\n  // Allow updating FST argument; pass only if changed.\n  ArcSampler(const ArcSampler<Arc, Selector> &sampler,\n             const Fst<Arc> *fst = nullptr)\n      : fst_(fst ? *fst : sampler.fst_),\n        selector_(sampler.selector_),\n        max_length_(sampler.max_length_) {\n    Reset();\n  }\n\n  // Samples a fixed number of samples from the given state. The length argument\n  // specifies the length of the path to the state. Returns true if the samples\n  // were collected. No samples may be collected if either there are no\n  // transitions leaving the state and the state is non-final, or if the path\n  // length has been exceeded. Iterator members are provided to read the samples\n  // in the order in which they were collected.\n  bool Sample(const RandState<Arc> &rstate) {\n    sample_map_.clear();\n    if ((fst_.NumArcs(rstate.state_id) == 0 &&\n         fst_.Final(rstate.state_id) == Weight::Zero()) ||\n        rstate.length == max_length_) {\n      Reset();\n      return false;\n    }\n    for (size_t i = 0; i < rstate.nsamples; ++i) {\n      ++sample_map_[selector_(fst_, rstate.state_id)];\n    }\n    Reset();\n    return true;\n  }\n\n  // More samples?\n  bool Done() const { return sample_iter_ == sample_map_.end(); }\n\n  // Gets the next sample.\n  void Next() { ++sample_iter_; }\n\n  std::pair<size_t, size_t> Value() const { return *sample_iter_; }\n\n  void Reset() { sample_iter_ = sample_map_.begin(); }\n\n  bool Error() const { return false; }\n\n private:\n  const Fst<Arc> &fst_;\n  const Selector &selector_;\n  const int32 max_length_;\n\n  // Stores (N, K) as described for Value().\n  std::map<size_t, size_t> sample_map_;\n  std::map<size_t, size_t>::const_iterator sample_iter_;\n\n  ArcSampler<Arc, Selector> &operator=(const ArcSampler &) = delete;\n};\n\n// Samples one sample of num_to_sample dimensions from a multinomial\n// distribution parameterized by a vector of probabilities. The result\n// container should be pre-initialized (e.g., an empty map or a zeroed vector\n// sized the same as the vector of probabilities.\n// probs.size()).\ntemplate <class Result, class RNG>\nvoid OneMultinomialSample(const std::vector<double> &probs,\n                          size_t num_to_sample, Result *result, RNG *rng) {\n  // Left-over probability mass.\n  double norm = 0;\n  for (double p : probs) norm += p;\n  // Left-over number of samples needed.\n  for (size_t i = 0; i < probs.size(); ++i) {\n    size_t num_sampled = 0;\n    if (probs[i] > 0) {\n      std::binomial_distribution<> d(num_to_sample, probs[i] / norm);\n      num_sampled = d(*rng);\n    }\n    if (num_sampled != 0) (*result)[i] = num_sampled;\n    norm -= probs[i];\n    num_to_sample -= num_sampled;\n  }\n}\n\n// Specialization for FastLogProbArcSelector.\ntemplate <class Arc>\nclass ArcSampler<Arc, FastLogProbArcSelector<Arc>> {\n public:\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using Accumulator = CacheLogAccumulator<Arc>;\n  using Selector = FastLogProbArcSelector<Arc>;\n\n  ArcSampler(const Fst<Arc> &fst, const Selector &selector,\n             int32 max_length = std::numeric_limits<int32>::max())\n      : fst_(fst),\n        selector_(selector),\n        max_length_(max_length),\n        accumulator_(new Accumulator()) {\n    accumulator_->Init(fst);\n    rng_.seed(selector_.Seed());\n  }\n\n  ArcSampler(const ArcSampler<Arc, Selector> &sampler,\n             const Fst<Arc> *fst = nullptr)\n      : fst_(fst ? *fst : sampler.fst_),\n        selector_(sampler.selector_),\n        max_length_(sampler.max_length_) {\n    if (fst) {\n      accumulator_.reset(new Accumulator());\n      accumulator_->Init(*fst);\n    } else {  // Shallow copy.\n      accumulator_.reset(new Accumulator(*sampler.accumulator_));\n    }\n  }\n\n  bool Sample(const RandState<Arc> &rstate) {\n    sample_map_.clear();\n    if ((fst_.NumArcs(rstate.state_id) == 0 &&\n         fst_.Final(rstate.state_id) == Weight::Zero()) ||\n        rstate.length == max_length_) {\n      Reset();\n      return false;\n    }\n    if (fst_.NumArcs(rstate.state_id) + 1 < rstate.nsamples) {\n      MultinomialSample(rstate);\n      Reset();\n      return true;\n    }\n    for (size_t i = 0; i < rstate.nsamples; ++i) {\n      ++sample_map_[selector_(fst_, rstate.state_id, accumulator_.get())];\n    }\n    Reset();\n    return true;\n  }\n\n  bool Done() const { return sample_iter_ == sample_map_.end(); }\n\n  void Next() { ++sample_iter_; }\n\n  std::pair<size_t, size_t> Value() const { return *sample_iter_; }\n\n  void Reset() { sample_iter_ = sample_map_.begin(); }\n\n  bool Error() const { return accumulator_->Error(); }\n\n private:\n  using RNG = std::mt19937;\n\n  // Sample according to the multinomial distribution of rstate.nsamples draws\n  // from p_.\n  void MultinomialSample(const RandState<Arc> &rstate) {\n    p_.clear();\n    for (ArcIterator<Fst<Arc>> aiter(fst_, rstate.state_id); !aiter.Done();\n         aiter.Next()) {\n      p_.push_back(exp(-to_log_weight_(aiter.Value().weight).Value()));\n    }\n    if (fst_.Final(rstate.state_id) != Weight::Zero()) {\n      p_.push_back(exp(-to_log_weight_(fst_.Final(rstate.state_id)).Value()));\n    }\n    if (rstate.nsamples < std::numeric_limits<RNG::result_type>::max()) {\n      OneMultinomialSample(p_, rstate.nsamples, &sample_map_, &rng_);\n    } else {\n      for (size_t i = 0; i < p_.size(); ++i) {\n        sample_map_[i] = ceil(p_[i] * rstate.nsamples);\n      }\n    }\n  }\n\n  const Fst<Arc> &fst_;\n  const Selector &selector_;\n  const int32 max_length_;\n\n  // Stores (N, K) for Value().\n  std::map<size_t, size_t> sample_map_;\n  std::map<size_t, size_t>::const_iterator sample_iter_;\n\n  std::unique_ptr<Accumulator> accumulator_;\n  RNG rng_;                // Random number generator.\n  std::vector<double> p_;  // Multinomial parameters.\n  WeightConvert<Weight, Log64Weight> to_log_weight_;\n};\n\n// Options for random path generation with RandGenFst. The template argument is\n// a sampler, typically the class ArcSampler. Ownership of the sampler is taken\n// by RandGenFst.\ntemplate <class Sampler>\nstruct RandGenFstOptions : public CacheOptions {\n  Sampler *sampler;          // How to sample transitions at a state.\n  int32 npath;               // Number of paths to generate.\n  bool weighted;             // Is the output tree weighted by path count, or\n                             // is it just an unweighted DAG?\n  bool remove_total_weight;  // Remove total weight when output is weighted.\n\n  RandGenFstOptions(const CacheOptions &opts, Sampler *sampler, int32 npath = 1,\n                    bool weighted = true, bool remove_total_weight = false)\n      : CacheOptions(opts),\n        sampler(sampler),\n        npath(npath),\n        weighted(weighted),\n        remove_total_weight(remove_total_weight) {}\n};\n\nnamespace internal {\n\n// Implementation of RandGenFst.\ntemplate <class FromArc, class ToArc, class Sampler>\nclass RandGenFstImpl : public CacheImpl<ToArc> {\n public:\n  using FstImpl<ToArc>::SetType;\n  using FstImpl<ToArc>::SetProperties;\n  using FstImpl<ToArc>::SetInputSymbols;\n  using FstImpl<ToArc>::SetOutputSymbols;\n\n  using CacheBaseImpl<CacheState<ToArc>>::PushArc;\n  using CacheBaseImpl<CacheState<ToArc>>::HasArcs;\n  using CacheBaseImpl<CacheState<ToArc>>::HasFinal;\n  using CacheBaseImpl<CacheState<ToArc>>::HasStart;\n  using CacheBaseImpl<CacheState<ToArc>>::SetArcs;\n  using CacheBaseImpl<CacheState<ToArc>>::SetFinal;\n  using CacheBaseImpl<CacheState<ToArc>>::SetStart;\n\n  using Label = typename FromArc::Label;\n  using StateId = typename FromArc::StateId;\n  using FromWeight = typename FromArc::Weight;\n\n  using ToWeight = typename ToArc::Weight;\n\n  RandGenFstImpl(const Fst<FromArc> &fst,\n                 const RandGenFstOptions<Sampler> &opts)\n      : CacheImpl<ToArc>(opts),\n        fst_(fst.Copy()),\n        sampler_(opts.sampler),\n        npath_(opts.npath),\n        weighted_(opts.weighted),\n        remove_total_weight_(opts.remove_total_weight),\n        superfinal_(kNoLabel) {\n    SetType(\"randgen\");\n    SetProperties(\n        RandGenProperties(fst.Properties(kFstProperties, false), weighted_),\n        kCopyProperties);\n    SetInputSymbols(fst.InputSymbols());\n    SetOutputSymbols(fst.OutputSymbols());\n  }\n\n  RandGenFstImpl(const RandGenFstImpl &impl)\n      : CacheImpl<ToArc>(impl),\n        fst_(impl.fst_->Copy(true)),\n        sampler_(new Sampler(*impl.sampler_, fst_.get())),\n        npath_(impl.npath_),\n        weighted_(impl.weighted_),\n        superfinal_(kNoLabel) {\n    SetType(\"randgen\");\n    SetProperties(impl.Properties(), kCopyProperties);\n    SetInputSymbols(impl.InputSymbols());\n    SetOutputSymbols(impl.OutputSymbols());\n  }\n\n  StateId Start() {\n    if (!HasStart()) {\n      const auto s = fst_->Start();\n      if (s == kNoStateId) return kNoStateId;\n      SetStart(state_table_.size());\n      state_table_.emplace_back(\n          new RandState<FromArc>(s, npath_, 0, 0, nullptr));\n    }\n    return CacheImpl<ToArc>::Start();\n  }\n\n  ToWeight Final(StateId s) {\n    if (!HasFinal(s)) Expand(s);\n    return CacheImpl<ToArc>::Final(s);\n  }\n\n  size_t NumArcs(StateId s) {\n    if (!HasArcs(s)) Expand(s);\n    return CacheImpl<ToArc>::NumArcs(s);\n  }\n\n  size_t NumInputEpsilons(StateId s) {\n    if (!HasArcs(s)) Expand(s);\n    return CacheImpl<ToArc>::NumInputEpsilons(s);\n  }\n\n  size_t NumOutputEpsilons(StateId s) {\n    if (!HasArcs(s)) Expand(s);\n    return CacheImpl<ToArc>::NumOutputEpsilons(s);\n  }\n\n  uint64 Properties() const override { return Properties(kFstProperties); }\n\n  // Sets error if found, and returns other FST impl properties.\n  uint64 Properties(uint64 mask) const override {\n    if ((mask & kError) &&\n        (fst_->Properties(kError, false) || sampler_->Error())) {\n      SetProperties(kError, kError);\n    }\n    return FstImpl<ToArc>::Properties(mask);\n  }\n\n  void InitArcIterator(StateId s, ArcIteratorData<ToArc> *data) {\n    if (!HasArcs(s)) Expand(s);\n    CacheImpl<ToArc>::InitArcIterator(s, data);\n  }\n\n  // Computes the outgoing transitions from a state, creating new destination\n  // states as needed.\n  void Expand(StateId s) {\n    if (s == superfinal_) {\n      SetFinal(s, ToWeight::One());\n      SetArcs(s);\n      return;\n    }\n    SetFinal(s, ToWeight::Zero());\n    const auto &rstate = *state_table_[s];\n    sampler_->Sample(rstate);\n    ArcIterator<Fst<FromArc>> aiter(*fst_, rstate.state_id);\n    const auto narcs = fst_->NumArcs(rstate.state_id);\n    for (; !sampler_->Done(); sampler_->Next()) {\n      const auto &sample_pair = sampler_->Value();\n      const auto pos = sample_pair.first;\n      const auto count = sample_pair.second;\n      double prob = static_cast<double>(count) / rstate.nsamples;\n      if (pos < narcs) {  // Regular transition.\n        aiter.Seek(sample_pair.first);\n        const auto &aarc = aiter.Value();\n        const auto weight =\n            weighted_ ? to_weight_(Log64Weight(-log(prob))) : ToWeight::One();\n        const ToArc barc(aarc.ilabel, aarc.olabel, weight, state_table_.size());\n        PushArc(s, barc);\n        auto *nrstate = new RandState<FromArc>(aarc.nextstate, count,\n                                               rstate.length + 1, pos, &rstate);\n        state_table_.emplace_back(nrstate);\n      } else {  // Super-final transition.\n        if (weighted_) {\n          const auto weight =\n              remove_total_weight_\n                  ? to_weight_(Log64Weight(-log(prob)))\n                  : to_weight_(Log64Weight(-log(prob * npath_)));\n          SetFinal(s, weight);\n        } else {\n          if (superfinal_ == kNoLabel) {\n            superfinal_ = state_table_.size();\n            state_table_.emplace_back(\n                new RandState<FromArc>(kNoStateId, 0, 0, 0, nullptr));\n          }\n          for (size_t n = 0; n < count; ++n) {\n            const ToArc barc(0, 0, ToWeight::One(), superfinal_);\n            PushArc(s, barc);\n          }\n        }\n      }\n    }\n    SetArcs(s);\n  }\n\n private:\n  const std::unique_ptr<Fst<FromArc>> fst_;\n  std::unique_ptr<Sampler> sampler_;\n  const int32 npath_;\n  std::vector<std::unique_ptr<RandState<FromArc>>> state_table_;\n  const bool weighted_;\n  bool remove_total_weight_;\n  StateId superfinal_;\n  WeightConvert<Log64Weight, ToWeight> to_weight_;\n};\n\n}  // namespace internal\n\n// FST class to randomly generate paths through an FST, with details controlled\n// by RandGenOptionsFst. Output format is a tree weighted by the path count.\ntemplate <class FromArc, class ToArc, class Sampler>\nclass RandGenFst\n    : public ImplToFst<internal::RandGenFstImpl<FromArc, ToArc, Sampler>> {\n public:\n  using Label = typename FromArc::Label;\n  using StateId = typename FromArc::StateId;\n  using Weight = typename FromArc::Weight;\n\n  using Store = DefaultCacheStore<FromArc>;\n  using State = typename Store::State;\n\n  using Impl = internal::RandGenFstImpl<FromArc, ToArc, Sampler>;\n\n  friend class ArcIterator<RandGenFst<FromArc, ToArc, Sampler>>;\n  friend class StateIterator<RandGenFst<FromArc, ToArc, Sampler>>;\n\n  RandGenFst(const Fst<FromArc> &fst, const RandGenFstOptions<Sampler> &opts)\n      : ImplToFst<Impl>(std::make_shared<Impl>(fst, opts)) {}\n\n  // See Fst<>::Copy() for doc.\n  RandGenFst(const RandGenFst<FromArc, ToArc, Sampler> &fst, bool safe = false)\n      : ImplToFst<Impl>(fst, safe) {}\n\n  // Get a copy of this RandGenFst. See Fst<>::Copy() for further doc.\n  RandGenFst<FromArc, ToArc, Sampler> *Copy(bool safe = false) const override {\n    return new RandGenFst<FromArc, ToArc, Sampler>(*this, safe);\n  }\n\n  inline void InitStateIterator(StateIteratorData<ToArc> *data) const override;\n\n  void InitArcIterator(StateId s, ArcIteratorData<ToArc> *data) const override {\n    GetMutableImpl()->InitArcIterator(s, data);\n  }\n\n private:\n  using ImplToFst<Impl>::GetImpl;\n  using ImplToFst<Impl>::GetMutableImpl;\n\n  RandGenFst &operator=(const RandGenFst &) = delete;\n};\n\n// Specialization for RandGenFst.\ntemplate <class FromArc, class ToArc, class Sampler>\nclass StateIterator<RandGenFst<FromArc, ToArc, Sampler>>\n    : public CacheStateIterator<RandGenFst<FromArc, ToArc, Sampler>> {\n public:\n  explicit StateIterator(const RandGenFst<FromArc, ToArc, Sampler> &fst)\n      : CacheStateIterator<RandGenFst<FromArc, ToArc, Sampler>>(\n            fst, fst.GetMutableImpl()) {}\n};\n\n// Specialization for RandGenFst.\ntemplate <class FromArc, class ToArc, class Sampler>\nclass ArcIterator<RandGenFst<FromArc, ToArc, Sampler>>\n    : public CacheArcIterator<RandGenFst<FromArc, ToArc, Sampler>> {\n public:\n  using StateId = typename FromArc::StateId;\n\n  ArcIterator(const RandGenFst<FromArc, ToArc, Sampler> &fst, StateId s)\n      : CacheArcIterator<RandGenFst<FromArc, ToArc, Sampler>>(\n            fst.GetMutableImpl(), s) {\n    if (!fst.GetImpl()->HasArcs(s)) fst.GetMutableImpl()->Expand(s);\n  }\n};\n\ntemplate <class FromArc, class ToArc, class Sampler>\ninline void RandGenFst<FromArc, ToArc, Sampler>::InitStateIterator(\n    StateIteratorData<ToArc> *data) const {\n  data->base = new StateIterator<RandGenFst<FromArc, ToArc, Sampler>>(*this);\n}\n\n// Options for random path generation.\ntemplate <class Selector>\nstruct RandGenOptions {\n  const Selector &selector;  // How an arc is selected at a state.\n  int32 max_length;          // Maximum path length.\n  int32 npath;               // Number of paths to generate.\n  bool weighted;             // Is the output tree weighted by path count, or\n                             // is it just an unweighted DAG?\n  bool remove_total_weight;  // Remove total weight when output is weighted?\n\n  explicit RandGenOptions(const Selector &selector,\n                          int32 max_length = std::numeric_limits<int32>::max(),\n                          int32 npath = 1, bool weighted = false,\n                          bool remove_total_weight = false)\n      : selector(selector),\n        max_length(max_length),\n        npath(npath),\n        weighted(weighted),\n        remove_total_weight(remove_total_weight) {}\n};\n\nnamespace internal {\n\ntemplate <class FromArc, class ToArc>\nclass RandGenVisitor {\n public:\n  using StateId = typename FromArc::StateId;\n  using Weight = typename FromArc::Weight;\n\n  explicit RandGenVisitor(MutableFst<ToArc> *ofst) : ofst_(ofst) {}\n\n  void InitVisit(const Fst<FromArc> &ifst) {\n    ifst_ = &ifst;\n    ofst_->DeleteStates();\n    ofst_->SetInputSymbols(ifst.InputSymbols());\n    ofst_->SetOutputSymbols(ifst.OutputSymbols());\n    if (ifst.Properties(kError, false)) ofst_->SetProperties(kError, kError);\n    path_.clear();\n  }\n\n  constexpr bool InitState(StateId, StateId) const { return true; }\n\n  bool TreeArc(StateId, const ToArc &arc) {\n    if (ifst_->Final(arc.nextstate) == Weight::Zero()) {\n      path_.push_back(arc);\n    } else {\n      OutputPath();\n    }\n    return true;\n  }\n\n  bool BackArc(StateId, const FromArc &) {\n    FSTERROR() << \"RandGenVisitor: cyclic input\";\n    ofst_->SetProperties(kError, kError);\n    return false;\n  }\n\n  bool ForwardOrCrossArc(StateId, const FromArc &) {\n    OutputPath();\n    return true;\n  }\n\n  void FinishState(StateId s, StateId p, const FromArc *) {\n    if (p != kNoStateId && ifst_->Final(s) == Weight::Zero()) path_.pop_back();\n  }\n\n  void FinishVisit() {}\n\n private:\n  void OutputPath() {\n    if (ofst_->Start() == kNoStateId) {\n      const auto start = ofst_->AddState();\n      ofst_->SetStart(start);\n    }\n    auto src = ofst_->Start();\n    for (size_t i = 0; i < path_.size(); ++i) {\n      const auto dest = ofst_->AddState();\n      const ToArc arc(path_[i].ilabel, path_[i].olabel, Weight::One(), dest);\n      ofst_->AddArc(src, arc);\n      src = dest;\n    }\n    ofst_->SetFinal(src, Weight::One());\n  }\n\n  const Fst<FromArc> *ifst_;\n  MutableFst<ToArc> *ofst_;\n  std::vector<ToArc> path_;\n\n  RandGenVisitor(const RandGenVisitor &) = delete;\n  RandGenVisitor &operator=(const RandGenVisitor &) = delete;\n};\n\n}  // namespace internal\n\n// Randomly generate paths through an FST; details controlled by\n// RandGenOptions.\ntemplate <class FromArc, class ToArc, class Selector>\nvoid RandGen(const Fst<FromArc> &ifst, MutableFst<ToArc> *ofst,\n             const RandGenOptions<Selector> &opts) {\n  using State = typename ToArc::StateId;\n  using Weight = typename ToArc::Weight;\n  using Sampler = ArcSampler<FromArc, Selector>;\n  auto *sampler = new Sampler(ifst, opts.selector, opts.max_length);\n  RandGenFstOptions<Sampler> fopts(CacheOptions(true, 0), sampler, opts.npath,\n                                   opts.weighted, opts.remove_total_weight);\n  RandGenFst<FromArc, ToArc, Sampler> rfst(ifst, fopts);\n  if (opts.weighted) {\n    *ofst = rfst;\n  } else {\n    internal::RandGenVisitor<FromArc, ToArc> rand_visitor(ofst);\n    DfsVisit(rfst, &rand_visitor);\n  }\n}\n\n// Randomly generate a path through an FST with the uniform distribution\n// over the transitions.\ntemplate <class FromArc, class ToArc>\nvoid RandGen(const Fst<FromArc> &ifst, MutableFst<ToArc> *ofst) {\n  const UniformArcSelector<FromArc> uniform_selector;\n  RandGenOptions<UniformArcSelector<ToArc>> opts(uniform_selector);\n  RandGen(ifst, ofst, opts);\n}\n\n}  // namespace fst\n\n#endif  // FST_RANDGEN_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/rational.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// An FST implementation and base interface for delayed unions, concatenations,\n// and closures.\n\n#ifndef FST_RATIONAL_H_\n#define FST_RATIONAL_H_\n\n#include <algorithm>\n#include <string>\n#include <vector>\n\n#include <fst/mutable-fst.h>\n#include <fst/replace.h>\n#include <fst/test-properties.h>\n\n\nnamespace fst {\n\nusing RationalFstOptions = CacheOptions;\n\n// This specifies whether to add the empty string.\nenum ClosureType {\n  CLOSURE_STAR = 0,  // Add the empty string.\n  CLOSURE_PLUS = 1   // Don't add the empty string.\n};\n\ntemplate <class Arc>\nclass RationalFst;\n\ntemplate <class Arc>\nvoid Union(RationalFst<Arc> *fst1, const Fst<Arc> &fst2);\n\ntemplate <class Arc>\nvoid Concat(RationalFst<Arc> *fst1, const Fst<Arc> &fst2);\n\ntemplate <class Arc>\nvoid Concat(const Fst<Arc> &fst1, RationalFst<Arc> *fst2);\n\ntemplate <class Arc>\nvoid Closure(RationalFst<Arc> *fst, ClosureType closure_type);\n\nnamespace internal {\n\n// Implementation class for delayed unions, concatenations and closures.\ntemplate <class A>\nclass RationalFstImpl : public FstImpl<A> {\n public:\n  using Arc = A;\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using FstImpl<Arc>::SetType;\n  using FstImpl<Arc>::SetProperties;\n  using FstImpl<Arc>::WriteHeader;\n  using FstImpl<Arc>::SetInputSymbols;\n  using FstImpl<Arc>::SetOutputSymbols;\n\n  explicit RationalFstImpl(const RationalFstOptions &opts)\n      : nonterminals_(0), replace_options_(opts, 0) {\n    SetType(\"rational\");\n    fst_tuples_.push_back(std::make_pair(0, nullptr));\n  }\n\n  RationalFstImpl(const RationalFstImpl<Arc> &impl)\n      : rfst_(impl.rfst_),\n        nonterminals_(impl.nonterminals_),\n        replace_(impl.replace_ ? impl.replace_->Copy(true) : nullptr),\n        replace_options_(impl.replace_options_) {\n    SetType(\"rational\");\n    fst_tuples_.reserve(impl.fst_tuples_.size());\n    for (const auto &pair : impl.fst_tuples_) {\n      fst_tuples_.emplace_back(pair.first,\n                               pair.second ? pair.second->Copy(true) : nullptr);\n    }\n  }\n\n  ~RationalFstImpl() override {\n    for (auto &tuple : fst_tuples_) delete tuple.second;\n  }\n\n  StateId Start() { return Replace()->Start(); }\n\n  Weight Final(StateId s) { return Replace()->Final(s); }\n\n  size_t NumArcs(StateId s) { return Replace()->NumArcs(s); }\n\n  size_t NumInputEpsilons(StateId s) { return Replace()->NumInputEpsilons(s); }\n\n  size_t NumOutputEpsilons(StateId s) {\n    return Replace()->NumOutputEpsilons(s);\n  }\n\n  uint64 Properties() const override { return Properties(kFstProperties); }\n\n  // Sets error if found, and returns other FST impl properties.\n  uint64 Properties(uint64 mask) const override {\n    if ((mask & kError) && Replace()->Properties(kError, false)) {\n      SetProperties(kError, kError);\n    }\n    return FstImpl<Arc>::Properties(mask);\n  }\n\n  // Implementation of UnionFst(fst1, fst2).\n  void InitUnion(const Fst<Arc> &fst1, const Fst<Arc> &fst2) {\n    replace_.reset();\n    const auto props1 = fst1.Properties(kFstProperties, false);\n    const auto props2 = fst2.Properties(kFstProperties, false);\n    SetInputSymbols(fst1.InputSymbols());\n    SetOutputSymbols(fst1.OutputSymbols());\n    rfst_.AddState();\n    rfst_.AddState();\n    rfst_.SetStart(0);\n    rfst_.SetFinal(1, Weight::One());\n    rfst_.SetInputSymbols(fst1.InputSymbols());\n    rfst_.SetOutputSymbols(fst1.OutputSymbols());\n    nonterminals_ = 2;\n    rfst_.AddArc(0, Arc(0, -1, Weight::One(), 1));\n    rfst_.AddArc(0, Arc(0, -2, Weight::One(), 1));\n    fst_tuples_.push_back(std::make_pair(-1, fst1.Copy()));\n    fst_tuples_.push_back(std::make_pair(-2, fst2.Copy()));\n    SetProperties(UnionProperties(props1, props2, true), kCopyProperties);\n  }\n\n  // Implementation of ConcatFst(fst1, fst2).\n  void InitConcat(const Fst<Arc> &fst1, const Fst<Arc> &fst2) {\n    replace_.reset();\n    const auto props1 = fst1.Properties(kFstProperties, false);\n    const auto props2 = fst2.Properties(kFstProperties, false);\n    SetInputSymbols(fst1.InputSymbols());\n    SetOutputSymbols(fst1.OutputSymbols());\n    rfst_.AddState();\n    rfst_.AddState();\n    rfst_.AddState();\n    rfst_.SetStart(0);\n    rfst_.SetFinal(2, Weight::One());\n    rfst_.SetInputSymbols(fst1.InputSymbols());\n    rfst_.SetOutputSymbols(fst1.OutputSymbols());\n    nonterminals_ = 2;\n    rfst_.AddArc(0, Arc(0, -1, Weight::One(), 1));\n    rfst_.AddArc(1, Arc(0, -2, Weight::One(), 2));\n    fst_tuples_.push_back(std::make_pair(-1, fst1.Copy()));\n    fst_tuples_.push_back(std::make_pair(-2, fst2.Copy()));\n    SetProperties(ConcatProperties(props1, props2, true), kCopyProperties);\n  }\n\n  // Implementation of ClosureFst(fst, closure_type).\n  void InitClosure(const Fst<Arc> &fst, ClosureType closure_type) {\n    replace_.reset();\n    const auto props = fst.Properties(kFstProperties, false);\n    SetInputSymbols(fst.InputSymbols());\n    SetOutputSymbols(fst.OutputSymbols());\n    if (closure_type == CLOSURE_STAR) {\n      rfst_.AddState();\n      rfst_.SetStart(0);\n      rfst_.SetFinal(0, Weight::One());\n      rfst_.AddArc(0, Arc(0, -1, Weight::One(), 0));\n    } else {\n      rfst_.AddState();\n      rfst_.AddState();\n      rfst_.SetStart(0);\n      rfst_.SetFinal(1, Weight::One());\n      rfst_.AddArc(0, Arc(0, -1, Weight::One(), 1));\n      rfst_.AddArc(1, Arc(0, 0, Weight::One(), 0));\n    }\n    rfst_.SetInputSymbols(fst.InputSymbols());\n    rfst_.SetOutputSymbols(fst.OutputSymbols());\n    fst_tuples_.push_back(std::make_pair(-1, fst.Copy()));\n    nonterminals_ = 1;\n    SetProperties(ClosureProperties(props, closure_type == CLOSURE_STAR, true),\n                  kCopyProperties);\n  }\n\n  // Implementation of Union(Fst &, RationalFst *).\n  void AddUnion(const Fst<Arc> &fst) {\n    replace_.reset();\n    const auto props1 = FstImpl<A>::Properties();\n    const auto props2 = fst.Properties(kFstProperties, false);\n    VectorFst<Arc> afst;\n    afst.AddState();\n    afst.AddState();\n    afst.SetStart(0);\n    afst.SetFinal(1, Weight::One());\n    ++nonterminals_;\n    afst.AddArc(0, Arc(0, -nonterminals_, Weight::One(), 1));\n    Union(&rfst_, afst);\n    fst_tuples_.push_back(std::make_pair(-nonterminals_, fst.Copy()));\n    SetProperties(UnionProperties(props1, props2, true), kCopyProperties);\n  }\n\n  // Implementation of Concat(Fst &, RationalFst *).\n  void AddConcat(const Fst<Arc> &fst, bool append) {\n    replace_.reset();\n    const auto props1 = FstImpl<A>::Properties();\n    const auto props2 = fst.Properties(kFstProperties, false);\n    VectorFst<Arc> afst;\n    afst.AddState();\n    afst.AddState();\n    afst.SetStart(0);\n    afst.SetFinal(1, Weight::One());\n    ++nonterminals_;\n    afst.AddArc(0, Arc(0, -nonterminals_, Weight::One(), 1));\n    if (append) {\n      Concat(&rfst_, afst);\n    } else {\n      Concat(afst, &rfst_);\n    }\n    fst_tuples_.push_back(std::make_pair(-nonterminals_, fst.Copy()));\n    SetProperties(ConcatProperties(props1, props2, true), kCopyProperties);\n  }\n\n  // Implementation of Closure(RationalFst *, closure_type).\n  void AddClosure(ClosureType closure_type) {\n    replace_.reset();\n    const auto props = FstImpl<A>::Properties();\n    Closure(&rfst_, closure_type);\n    SetProperties(ClosureProperties(props, closure_type == CLOSURE_STAR, true),\n                  kCopyProperties);\n  }\n\n  // Returns the underlying ReplaceFst, preserving ownership of the underlying\n  // object.\n  ReplaceFst<Arc> *Replace() const {\n    if (!replace_) {\n      fst_tuples_[0].second = rfst_.Copy();\n      replace_.reset(new ReplaceFst<Arc>(fst_tuples_, replace_options_));\n    }\n    return replace_.get();\n  }\n\n private:\n  // Rational topology machine, using negative non-terminals.\n  VectorFst<Arc> rfst_;\n  // Number of nonterminals used.\n  Label nonterminals_;\n  // Contains the nonterminals and their corresponding FSTs.\n  mutable std::vector<std::pair<Label, const Fst<Arc> *>> fst_tuples_;\n  // Underlying ReplaceFst.\n  mutable std::unique_ptr<ReplaceFst<Arc>> replace_;\n  const ReplaceFstOptions<Arc> replace_options_;\n};\n\n}  // namespace internal\n\n// Parent class for the delayed rational operations (union, concatenation, and\n// closure). This class attaches interface to implementation and handles\n// reference counting, delegating most methods to ImplToFst.\ntemplate <class A>\nclass RationalFst : public ImplToFst<internal::RationalFstImpl<A>> {\n public:\n  using Arc = A;\n  using StateId = typename Arc::StateId;\n\n  using Impl = internal::RationalFstImpl<Arc>;\n\n  friend class StateIterator<RationalFst<Arc>>;\n  friend class ArcIterator<RationalFst<Arc>>;\n  friend void Union<>(RationalFst<Arc> *fst1, const Fst<Arc> &fst2);\n  friend void Concat<>(RationalFst<Arc> *fst1, const Fst<Arc> &fst2);\n  friend void Concat<>(const Fst<Arc> &fst1, RationalFst<Arc> *fst2);\n  friend void Closure<>(RationalFst<Arc> *fst, ClosureType closure_type);\n\n  void InitStateIterator(StateIteratorData<Arc> *data) const override {\n    GetImpl()->Replace()->InitStateIterator(data);\n  }\n\n  void InitArcIterator(StateId s, ArcIteratorData<Arc> *data) const override {\n    GetImpl()->Replace()->InitArcIterator(s, data);\n  }\n\n protected:\n  using ImplToFst<Impl>::GetImpl;\n\n  explicit RationalFst(const RationalFstOptions &opts = RationalFstOptions())\n      : ImplToFst<Impl>(std::make_shared<Impl>(opts)) {}\n\n  // See Fst<>::Copy() for doc.\n  RationalFst(const RationalFst<Arc> &fst, bool safe = false)\n      : ImplToFst<Impl>(fst, safe) {}\n\n private:\n  RationalFst &operator=(const RationalFst &) = delete;\n};\n\n// Specialization for RationalFst.\ntemplate <class Arc>\nclass StateIterator<RationalFst<Arc>> : public StateIterator<ReplaceFst<Arc>> {\n public:\n  explicit StateIterator(const RationalFst<Arc> &fst)\n      : StateIterator<ReplaceFst<Arc>>(*(fst.GetImpl()->Replace())) {}\n};\n\n// Specialization for RationalFst.\ntemplate <class Arc>\nclass ArcIterator<RationalFst<Arc>> : public CacheArcIterator<ReplaceFst<Arc>> {\n public:\n  using StateId = typename Arc::StateId;\n\n  ArcIterator(const RationalFst<Arc> &fst, StateId s)\n      : ArcIterator<ReplaceFst<Arc>>(*(fst.GetImpl()->Replace()), s) {}\n};\n\n}  // namespace fst\n\n#endif  // FST_RATIONAL_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/register.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Classes for registering derived FST for generic reading.\n\n#ifndef FST_REGISTER_H_\n#define FST_REGISTER_H_\n\n#include <string>\n#include <type_traits>\n\n\n#include <fst/compat.h>\n#include <fst/generic-register.h>\n#include <fst/util.h>\n\n\n#include <fst/types.h>\n#include <fst/log.h>\n\nnamespace fst {\n\ntemplate <class Arc>\nclass Fst;\n\nstruct FstReadOptions;\n\n// This class represents a single entry in a FstRegister\ntemplate <class Arc>\nstruct FstRegisterEntry {\n  using Reader = Fst<Arc> *(*)(std::istream &istrm, const FstReadOptions &opts);\n  using Converter = Fst<Arc> *(*)(const Fst<Arc> &fst);\n\n  Reader reader;\n  Converter converter;\n\n  explicit FstRegisterEntry(Reader reader = nullptr,\n                            Converter converter = nullptr)\n      : reader(reader), converter(converter) {}\n};\n\n// This class maintains the correspondence between a string describing\n// an FST type, and its reader and converter.\ntemplate <class Arc>\nclass FstRegister\n    : public GenericRegister<string, FstRegisterEntry<Arc>, FstRegister<Arc>> {\n public:\n  using Reader = typename FstRegisterEntry<Arc>::Reader;\n  using Converter = typename FstRegisterEntry<Arc>::Converter;\n\n  const Reader GetReader(const string &type) const {\n    return this->GetEntry(type).reader;\n  }\n\n  const Converter GetConverter(const string &type) const {\n    return this->GetEntry(type).converter;\n  }\n\n protected:\n  string ConvertKeyToSoFilename(const string &key) const override {\n    string legal_type(key);\n    ConvertToLegalCSymbol(&legal_type);\n    return legal_type + \"-fst.so\";\n  }\n};\n\n// This class registers an FST type for generic reading and creating.\n// The type must have a default constructor and a copy constructor from\n// Fst<Arc>.\ntemplate <class FST>\nclass FstRegisterer : public GenericRegisterer<FstRegister<typename FST::Arc>> {\n public:\n  using Arc = typename FST::Arc;\n  using Entry = typename FstRegister<Arc>::Entry;\n  using Reader = typename FstRegister<Arc>::Reader;\n\n  FstRegisterer()\n      : GenericRegisterer<FstRegister<typename FST::Arc>>(FST().Type(),\n                                                          BuildEntry()) {}\n\n private:\n  static Fst<Arc> *ReadGeneric(\n      std::istream &strm, const FstReadOptions &opts) {\n    static_assert(std::is_base_of<Fst<Arc>, FST>::value,\n                  \"FST class does not inherit from Fst<Arc>\");\n    return FST::Read(strm, opts);\n  }\n\n  static Entry BuildEntry() {\n    return Entry(&ReadGeneric, &FstRegisterer<FST>::Convert);\n  }\n\n  static Fst<Arc> *Convert(const Fst<Arc> &fst) { return new FST(fst); }\n};\n\n// Convenience macro to generate static FstRegisterer instance.\n#define REGISTER_FST(FST, Arc) \\\n  static fst::FstRegisterer<FST<Arc>> FST##_##Arc##_registerer\n\n// Converts an FST to the specified type.\ntemplate <class Arc>\nFst<Arc> *Convert(const Fst<Arc> &fst, const string &fst_type) {\n  auto *reg = FstRegister<Arc>::GetRegister();\n  const auto converter = reg->GetConverter(fst_type);\n  if (!converter) {\n    FSTERROR() << \"Fst::Convert: Unknown FST type \" << fst_type << \" (arc type \"\n               << Arc::Type() << \")\";\n    return nullptr;\n  }\n  return converter(fst);\n}\n\n}  // namespace fst\n\n#endif  // FST_REGISTER_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/relabel.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Functions and classes to relabel an FST (either on input or output).\n\n#ifndef FST_RELABEL_H_\n#define FST_RELABEL_H_\n\n#include <string>\n#include <unordered_map>\n#include <utility>\n#include <vector>\n\n#include <fst/log.h>\n\n#include <fst/cache.h>\n#include <fst/test-properties.h>\n\n\n#include <unordered_map>\n\nnamespace fst {\n\n// Relabels either the input labels or output labels. The old to\n// new labels are specified using a vector of std::pair<Label, Label>.\n// Any label associations not specified are assumed to be identity\n// mapping. The destination labels must be valid labels (e.g., not kNoLabel).\ntemplate <class Arc>\nvoid Relabel(\n    MutableFst<Arc> *fst,\n    const std::vector<std::pair<typename Arc::Label, typename Arc::Label>>\n        &ipairs,\n    const std::vector<std::pair<typename Arc::Label, typename Arc::Label>>\n        &opairs) {\n  using Label = typename Arc::Label;\n  const auto props = fst->Properties(kFstProperties, false);\n  // Constructs label-to-label maps.\n  std::unordered_map<Label, Label> input_map;\n  for (auto &ipair : ipairs) input_map[ipair.first] = ipair.second;\n  std::unordered_map<Label, Label> output_map;\n  for (auto &opair : opairs) output_map[opair.first] = opair.second;\n  for (StateIterator<MutableFst<Arc>> siter(*fst); !siter.Done();\n       siter.Next()) {\n    for (MutableArcIterator<MutableFst<Arc>> aiter(fst, siter.Value());\n         !aiter.Done(); aiter.Next()) {\n      auto arc = aiter.Value();\n      // Relabels input.\n      auto it = input_map.find(arc.ilabel);\n      if (it != input_map.end()) {\n        if (it->second == kNoLabel) {\n          FSTERROR() << \"Input symbol ID \" << arc.ilabel\n                     << \" missing from target vocabulary\";\n          fst->SetProperties(kError, kError);\n          return;\n        }\n        arc.ilabel = it->second;\n      }\n      // Relabels output.\n      it = output_map.find(arc.olabel);\n      if (it != output_map.end()) {\n        if (it->second == kNoLabel) {\n          FSTERROR() << \"Output symbol id \" << arc.olabel\n                     << \" missing from target vocabulary\";\n          fst->SetProperties(kError, kError);\n          return;\n        }\n        arc.olabel = it->second;\n      }\n      aiter.SetValue(arc);\n    }\n  }\n  fst->SetProperties(RelabelProperties(props), kFstProperties);\n}\n\n// Relabels either the input labels or output labels. The old to\n// new labels are specified using pairs of old and new symbol tables.\n// The tables must contain (at least) all labels on the appropriate side of the\n// FST. If the 'unknown_i(o)symbol' is non-empty, it is used to label any\n// missing symbol in new_i(o)symbols table.\ntemplate <class Arc>\nvoid Relabel(MutableFst<Arc> *fst,\n             const SymbolTable *old_isymbols, const SymbolTable *new_isymbols,\n             const string &unknown_isymbol, bool attach_new_isymbols,\n             const SymbolTable *old_osymbols, const SymbolTable *new_osymbols,\n             const string &unknown_osymbol, bool attach_new_osymbols) {\n  using Label = typename Arc::Label;\n  // Constructs vectors of input-side label pairs.\n  std::vector<std::pair<Label, Label>> ipairs;\n  if (old_isymbols && new_isymbols) {\n    size_t num_missing_syms = 0;\n    Label unknown_ilabel = kNoLabel;\n    if (!unknown_isymbol.empty()) {\n      unknown_ilabel = new_isymbols->Find(unknown_isymbol);\n      if (unknown_ilabel == kNoLabel) {\n        VLOG(1) << \"Input symbol '\" << unknown_isymbol\n                << \"' missing from target symbol table\";\n        ++num_missing_syms;\n      }\n    }\n\n    for (SymbolTableIterator siter(*old_isymbols); !siter.Done();\n         siter.Next()) {\n      const auto old_index = siter.Value();\n      const auto symbol = siter.Symbol();\n      auto new_index = new_isymbols->Find(siter.Symbol());\n      if (new_index == kNoLabel) {\n        if (unknown_ilabel != kNoLabel) {\n          new_index = unknown_ilabel;\n        } else {\n          VLOG(1) << \"Input symbol ID \" << old_index << \" symbol '\" << symbol\n                  << \"' missing from target symbol table\";\n          ++num_missing_syms;\n        }\n      }\n      ipairs.push_back(std::make_pair(old_index, new_index));\n    }\n    if (num_missing_syms > 0) {\n      LOG(WARNING) << \"Target symbol table missing: \" << num_missing_syms\n                   << \" input symbols\";\n    }\n    if (attach_new_isymbols) fst->SetInputSymbols(new_isymbols);\n  }\n  // Constructs vectors of output-side label pairs.\n  std::vector<std::pair<Label, Label>> opairs;\n  if (old_osymbols && new_osymbols) {\n    size_t num_missing_syms = 0;\n    Label unknown_olabel = kNoLabel;\n    if (!unknown_osymbol.empty()) {\n      unknown_olabel = new_osymbols->Find(unknown_osymbol);\n      if (unknown_olabel == kNoLabel) {\n        VLOG(1) << \"Output symbol '\" << unknown_osymbol\n                << \"' missing from target symbol table\";\n        ++num_missing_syms;\n      }\n    }\n\n    for (SymbolTableIterator siter(*old_osymbols); !siter.Done();\n         siter.Next()) {\n      const auto old_index = siter.Value();\n      const auto symbol = siter.Symbol();\n      auto new_index = new_osymbols->Find(siter.Symbol());\n      if (new_index == kNoLabel) {\n        if (unknown_olabel != kNoLabel) {\n          new_index = unknown_olabel;\n        } else {\n          VLOG(1) << \"Output symbol ID \" << old_index << \" symbol '\" << symbol\n                  << \"' missing from target symbol table\";\n          ++num_missing_syms;\n        }\n      }\n      opairs.push_back(std::make_pair(old_index, new_index));\n    }\n    if (num_missing_syms > 0) {\n      LOG(WARNING) << \"Target symbol table missing: \" << num_missing_syms\n                   << \" output symbols\";\n    }\n    if (attach_new_osymbols) fst->SetOutputSymbols(new_osymbols);\n  }\n  // Calls relabel using vector of relabel pairs.\n  Relabel(fst, ipairs, opairs);\n}\n\n// Same as previous but no special allowance for unknown symbols. Kept\n// for backward compat.\ntemplate <class Arc>\nvoid Relabel(MutableFst<Arc> *fst, const SymbolTable *old_isymbols,\n             const SymbolTable *new_isymbols, bool attach_new_isymbols,\n             const SymbolTable *old_osymbols, const SymbolTable *new_osymbols,\n             bool attach_new_osymbols) {\n  Relabel(fst,\n          old_isymbols, new_isymbols, \"\" /* no unknown isymbol */,\n          attach_new_isymbols,\n          old_osymbols, new_osymbols, \"\" /* no unknown ioymbol */,\n          attach_new_osymbols);\n}\n\n\n// Relabels either the input labels or output labels. The old to\n// new labels are specified using symbol tables. Any label associations not\n// specified are assumed to be identity mapping.\ntemplate <class Arc>\nvoid Relabel(MutableFst<Arc> *fst, const SymbolTable *new_isymbols,\n             const SymbolTable *new_osymbols) {\n  Relabel(fst, fst->InputSymbols(), new_isymbols, true, fst->OutputSymbols(),\n          new_osymbols, true);\n}\n\nusing RelabelFstOptions = CacheOptions;\n\ntemplate <class Arc>\nclass RelabelFst;\n\nnamespace internal {\n\n// Relabels an FST from one symbol set to another. Relabeling can either be on\n// input or output space. RelabelFst implements a delayed version of the\n// relabel. Arcs are relabeled on the fly and not cached; i.e., each request is\n// recomputed.\ntemplate <class Arc>\nclass RelabelFstImpl : public CacheImpl<Arc> {\n public:\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using Store = DefaultCacheStore<Arc>;\n  using State = typename Store::State;\n\n  using FstImpl<Arc>::SetType;\n  using FstImpl<Arc>::SetProperties;\n  using FstImpl<Arc>::WriteHeader;\n  using FstImpl<Arc>::SetInputSymbols;\n  using FstImpl<Arc>::SetOutputSymbols;\n\n  using CacheImpl<Arc>::PushArc;\n  using CacheImpl<Arc>::HasArcs;\n  using CacheImpl<Arc>::HasFinal;\n  using CacheImpl<Arc>::HasStart;\n  using CacheImpl<Arc>::SetArcs;\n  using CacheImpl<Arc>::SetFinal;\n  using CacheImpl<Arc>::SetStart;\n\n  friend class StateIterator<RelabelFst<Arc>>;\n\n  RelabelFstImpl(const Fst<Arc> &fst,\n                 const std::vector<std::pair<Label, Label>> &ipairs,\n                 const std::vector<std::pair<Label, Label>> &opairs,\n                 const RelabelFstOptions &opts)\n      : CacheImpl<Arc>(opts),\n        fst_(fst.Copy()),\n        relabel_input_(false),\n        relabel_output_(false) {\n    SetProperties(RelabelProperties(fst.Properties(kCopyProperties, false)));\n    SetType(\"relabel\");\n    // Creates input label map.\n    if (!ipairs.empty()) {\n      for (auto &ipair : ipairs) input_map_[ipair.first] = ipair.second;\n      relabel_input_ = true;\n    }\n    // Creates output label map.\n    if (!opairs.empty()) {\n      for (auto &opair : opairs) output_map_[opair.first] = opair.second;\n      relabel_output_ = true;\n    }\n  }\n\n  RelabelFstImpl(const Fst<Arc> &fst, const SymbolTable *old_isymbols,\n                 const SymbolTable *new_isymbols,\n                 const SymbolTable *old_osymbols,\n                 const SymbolTable *new_osymbols, const RelabelFstOptions &opts)\n      : CacheImpl<Arc>(opts),\n        fst_(fst.Copy()),\n        relabel_input_(false),\n        relabel_output_(false) {\n    SetType(\"relabel\");\n    SetProperties(RelabelProperties(fst.Properties(kCopyProperties, false)));\n    SetInputSymbols(old_isymbols);\n    SetOutputSymbols(old_osymbols);\n    if (old_isymbols && new_isymbols &&\n        old_isymbols->LabeledCheckSum() != new_isymbols->LabeledCheckSum()) {\n      for (SymbolTableIterator siter(*old_isymbols); !siter.Done();\n           siter.Next()) {\n        input_map_[siter.Value()] = new_isymbols->Find(siter.Symbol());\n      }\n      SetInputSymbols(new_isymbols);\n      relabel_input_ = true;\n    }\n    if (old_osymbols && new_osymbols &&\n        old_osymbols->LabeledCheckSum() != new_osymbols->LabeledCheckSum()) {\n      for (SymbolTableIterator siter(*old_osymbols); !siter.Done();\n           siter.Next()) {\n        output_map_[siter.Value()] = new_osymbols->Find(siter.Symbol());\n      }\n      SetOutputSymbols(new_osymbols);\n      relabel_output_ = true;\n    }\n  }\n\n  RelabelFstImpl(const RelabelFstImpl<Arc> &impl)\n      : CacheImpl<Arc>(impl),\n        fst_(impl.fst_->Copy(true)),\n        input_map_(impl.input_map_),\n        output_map_(impl.output_map_),\n        relabel_input_(impl.relabel_input_),\n        relabel_output_(impl.relabel_output_) {\n    SetType(\"relabel\");\n    SetProperties(impl.Properties(), kCopyProperties);\n    SetInputSymbols(impl.InputSymbols());\n    SetOutputSymbols(impl.OutputSymbols());\n  }\n\n  StateId Start() {\n    if (!HasStart()) SetStart(fst_->Start());\n    return CacheImpl<Arc>::Start();\n  }\n\n  Weight Final(StateId s) {\n    if (!HasFinal(s)) SetFinal(s, fst_->Final(s));\n    return CacheImpl<Arc>::Final(s);\n  }\n\n  size_t NumArcs(StateId s) {\n    if (!HasArcs(s)) Expand(s);\n    return CacheImpl<Arc>::NumArcs(s);\n  }\n\n  size_t NumInputEpsilons(StateId s) {\n    if (!HasArcs(s)) Expand(s);\n    return CacheImpl<Arc>::NumInputEpsilons(s);\n  }\n\n  size_t NumOutputEpsilons(StateId s) {\n    if (!HasArcs(s)) Expand(s);\n    return CacheImpl<Arc>::NumOutputEpsilons(s);\n  }\n\n  uint64 Properties() const override { return Properties(kFstProperties); }\n\n  // Sets error if found, and returns other FST impl properties.\n  uint64 Properties(uint64 mask) const override {\n    if ((mask & kError) && fst_->Properties(kError, false)) {\n      SetProperties(kError, kError);\n    }\n    return FstImpl<Arc>::Properties(mask);\n  }\n\n  void InitArcIterator(StateId s, ArcIteratorData<Arc> *data) {\n    if (!HasArcs(s)) Expand(s);\n    CacheImpl<Arc>::InitArcIterator(s, data);\n  }\n\n  void Expand(StateId s) {\n    for (ArcIterator<Fst<Arc>> aiter(*fst_, s); !aiter.Done(); aiter.Next()) {\n      auto arc = aiter.Value();\n      if (relabel_input_) {\n        auto it = input_map_.find(arc.ilabel);\n        if (it != input_map_.end()) arc.ilabel = it->second;\n      }\n      if (relabel_output_) {\n        auto it = output_map_.find(arc.olabel);\n        if (it != output_map_.end()) {\n          arc.olabel = it->second;\n        }\n      }\n      PushArc(s, arc);\n    }\n    SetArcs(s);\n  }\n\n private:\n  std::unique_ptr<const Fst<Arc>> fst_;\n\n  std::unordered_map<Label, Label> input_map_;\n  std::unordered_map<Label, Label> output_map_;\n  bool relabel_input_;\n  bool relabel_output_;\n};\n\n}  // namespace internal\n\n// This class attaches interface to implementation and handles\n// reference counting, delegating most methods to ImplToFst.\ntemplate <class A>\nclass RelabelFst : public ImplToFst<internal::RelabelFstImpl<A>> {\n public:\n  using Arc = A;\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using Store = DefaultCacheStore<Arc>;\n  using State = typename Store::State;\n  using Impl = internal::RelabelFstImpl<Arc>;\n\n  friend class ArcIterator<RelabelFst<A>>;\n  friend class StateIterator<RelabelFst<A>>;\n\n  RelabelFst(const Fst<Arc> &fst,\n             const std::vector<std::pair<Label, Label>> &ipairs,\n             const std::vector<std::pair<Label, Label>> &opairs,\n             const RelabelFstOptions &opts = RelabelFstOptions())\n      : ImplToFst<Impl>(std::make_shared<Impl>(fst, ipairs, opairs, opts)) {}\n\n  RelabelFst(const Fst<Arc> &fst, const SymbolTable *new_isymbols,\n             const SymbolTable *new_osymbols,\n             const RelabelFstOptions &opts = RelabelFstOptions())\n      : ImplToFst<Impl>(\n            std::make_shared<Impl>(fst, fst.InputSymbols(), new_isymbols,\n                                   fst.OutputSymbols(), new_osymbols, opts)) {}\n\n  RelabelFst(const Fst<Arc> &fst, const SymbolTable *old_isymbols,\n             const SymbolTable *new_isymbols, const SymbolTable *old_osymbols,\n             const SymbolTable *new_osymbols,\n             const RelabelFstOptions &opts = RelabelFstOptions())\n      : ImplToFst<Impl>(std::make_shared<Impl>(fst, old_isymbols, new_isymbols,\n                                               old_osymbols, new_osymbols,\n                                               opts)) {}\n\n  // See Fst<>::Copy() for doc.\n  RelabelFst(const RelabelFst<Arc> &fst, bool safe = false)\n      : ImplToFst<Impl>(fst, safe) {}\n\n  // Gets a copy of this RelabelFst. See Fst<>::Copy() for further doc.\n  RelabelFst<Arc> *Copy(bool safe = false) const override {\n    return new RelabelFst<Arc>(*this, safe);\n  }\n\n  void InitStateIterator(StateIteratorData<Arc> *data) const override;\n\n  void InitArcIterator(StateId s, ArcIteratorData<Arc> *data) const override {\n    return GetMutableImpl()->InitArcIterator(s, data);\n  }\n\n private:\n  using ImplToFst<Impl>::GetImpl;\n  using ImplToFst<Impl>::GetMutableImpl;\n\n  RelabelFst &operator=(const RelabelFst &) = delete;\n};\n\n// Specialization for RelabelFst.\ntemplate <class Arc>\nclass StateIterator<RelabelFst<Arc>> : public StateIteratorBase<Arc> {\n public:\n  using StateId = typename Arc::StateId;\n\n  explicit StateIterator(const RelabelFst<Arc> &fst)\n      : impl_(fst.GetImpl()), siter_(*impl_->fst_), s_(0) {}\n\n  bool Done() const final { return siter_.Done(); }\n\n  StateId Value() const final { return s_; }\n\n  void Next() final {\n    if (!siter_.Done()) {\n      ++s_;\n      siter_.Next();\n    }\n  }\n\n  void Reset() final {\n    s_ = 0;\n    siter_.Reset();\n  }\n\n private:\n  const internal::RelabelFstImpl<Arc>* impl_;\n  StateIterator<Fst<Arc>> siter_;\n  StateId s_;\n\n  StateIterator(const StateIterator &) = delete;\n  StateIterator &operator=(const StateIterator &) = delete;\n};\n\n// Specialization for RelabelFst.\ntemplate <class Arc>\nclass ArcIterator<RelabelFst<Arc>> : public CacheArcIterator<RelabelFst<Arc>> {\n public:\n  using StateId = typename Arc::StateId;\n\n  ArcIterator(const RelabelFst<Arc> &fst, StateId s)\n      : CacheArcIterator<RelabelFst<Arc>>(fst.GetMutableImpl(), s) {\n    if (!fst.GetImpl()->HasArcs(s)) fst.GetMutableImpl()->Expand(s);\n  }\n};\n\ntemplate <class Arc>\ninline void RelabelFst<Arc>::InitStateIterator(\n    StateIteratorData<Arc> *data) const {\n  data->base = new StateIterator<RelabelFst<Arc>>(*this);\n}\n\n// Useful alias when using StdArc.\nusing StdRelabelFst = RelabelFst<StdArc>;\n\n}  // namespace fst\n\n#endif  // FST_RELABEL_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/replace-util.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Utility classes for the recursive replacement of FSTs (RTNs).\n\n#ifndef FST_REPLACE_UTIL_H_\n#define FST_REPLACE_UTIL_H_\n\n#include <map>\n#include <unordered_map>\n#include <unordered_set>\n#include <vector>\n\n#include <fst/log.h>\n\n#include <fst/connect.h>\n#include <fst/mutable-fst.h>\n#include <fst/topsort.h>\n#include <fst/vector-fst.h>\n\n\nnamespace fst {\n\n// This specifies what labels to output on the call or return arc. Note that\n// REPLACE_LABEL_INPUT and REPLACE_LABEL_OUTPUT will produce transducers when\n// applied to acceptors.\nenum ReplaceLabelType {\n  // Epsilon labels on both input and output.\n  REPLACE_LABEL_NEITHER = 1,\n  // Non-epsilon labels on input and epsilon on output.\n  REPLACE_LABEL_INPUT = 2,\n  // Epsilon on input and non-epsilon on output.\n  REPLACE_LABEL_OUTPUT = 3,\n  // Non-epsilon labels on both input and output.\n  REPLACE_LABEL_BOTH = 4\n};\n\n// By default ReplaceUtil will copy the input label of the replace arc.\n// The call_label_type and return_label_type options specify how to manage\n// the labels of the call arc and the return arc of the replace FST\nstruct ReplaceUtilOptions {\n  int64 root;                          // Root rule for expansion.\n  ReplaceLabelType call_label_type;    // How to label call arc.\n  ReplaceLabelType return_label_type;  // How to label return arc.\n  int64 return_label;                  // Label to put on return arc.\n\n  explicit ReplaceUtilOptions(\n      int64 root = kNoLabel,\n      ReplaceLabelType call_label_type = REPLACE_LABEL_INPUT,\n      ReplaceLabelType return_label_type = REPLACE_LABEL_NEITHER,\n      int64 return_label = 0)\n      : root(root),\n        call_label_type(call_label_type),\n        return_label_type(return_label_type),\n        return_label(return_label) {}\n\n  // For backwards compatibility.\n  ReplaceUtilOptions(int64 root, bool epsilon_replace_arc)\n      : ReplaceUtilOptions(root,\n                           epsilon_replace_arc ? REPLACE_LABEL_NEITHER\n                                               : REPLACE_LABEL_INPUT) {}\n};\n\n// Every non-terminal on a path appears as the first label on that path in every\n// FST associated with a given SCC of the replace dependency graph. This would\n// be true if the SCC were formed from left-linear grammar rules.\nconstexpr uint8 kReplaceSCCLeftLinear = 0x01;\n// Every non-terminal on a path appears as the final label on that path in every\n// FST associated with a given SCC of the replace dependency graph. This would\n// be true if the SCC were formed from right-linear grammar rules.\nconstexpr uint8 kReplaceSCCRightLinear = 0x02;\n// The SCC in the replace dependency graph has more than one state or a\n// self-loop.\nconstexpr uint8 kReplaceSCCNonTrivial = 0x04;\n\n// Defined in replace.h.\ntemplate <class Arc>\nvoid Replace(\n    const std::vector<std::pair<typename Arc::Label, const Fst<Arc> *>> &,\n    MutableFst<Arc> *, const ReplaceUtilOptions &);\n\n// Utility class for the recursive replacement of FSTs (RTNs). The user provides\n// a set of label/FST pairs at construction. These are used by methods for\n// testing cyclic dependencies and connectedness and doing RTN connection and\n// specific FST replacement by label or for various optimization properties. The\n// modified results can be obtained with the GetFstPairs() or\n// GetMutableFstPairs() methods.\ntemplate <class Arc>\nclass ReplaceUtil {\n public:\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using FstPair = std::pair<Label, const Fst<Arc> *>;\n  using MutableFstPair = std::pair<Label, MutableFst<Arc> *>;\n  using NonTerminalHash = std::unordered_map<Label, Label>;\n\n  // Constructs from mutable FSTs; FST ownership is given to ReplaceUtil.\n  ReplaceUtil(const std::vector<MutableFstPair> &fst_pairs,\n              const ReplaceUtilOptions &opts);\n\n  // Constructs from FSTs; FST ownership is retained by caller.\n  ReplaceUtil(const std::vector<FstPair> &fst_pairs,\n              const ReplaceUtilOptions &opts);\n\n  // Constructs from ReplaceFst internals; FST ownership is retained by caller.\n  ReplaceUtil(const std::vector<std::unique_ptr<const Fst<Arc>>> &fst_array,\n              const NonTerminalHash &nonterminal_hash,\n              const ReplaceUtilOptions &opts);\n\n  ~ReplaceUtil() {\n    for (Label i = 0; i < fst_array_.size(); ++i) delete fst_array_[i];\n  }\n\n  // True if the non-terminal dependencies are cyclic. Cyclic dependencies will\n  // result in an unexpandable FST.\n  bool CyclicDependencies() const {\n    GetDependencies(false);\n    return depprops_ & kCyclic;\n  }\n\n  // Returns the strongly-connected component ID in the dependency graph of the\n  // replace FSTS.\n  StateId SCC(Label label) const {\n    GetDependencies(false);\n    const auto it = nonterminal_hash_.find(label);\n    if (it == nonterminal_hash_.end()) return kNoStateId;\n    return depscc_[it->second];\n  }\n\n  // Returns properties for the strongly-connected component in the dependency\n  // graph of the replace FSTs. If the SCC is kReplaceSCCLeftLinear or\n  // kReplaceSCCRightLinear, that SCC can be represented as finite-state despite\n  // any cyclic dependencies, but not by the usual replacement operation (see\n  // fst/extensions/pdt/replace.h).\n  uint8 SCCProperties(StateId scc_id) {\n    GetSCCProperties();\n    return depsccprops_[scc_id];\n  }\n\n  // Returns true if no useless FSTs, states or transitions are present in the\n  // RTN.\n  bool Connected() const {\n    GetDependencies(false);\n    uint64 props = kAccessible | kCoAccessible;\n    for (Label i = 0; i < fst_array_.size(); ++i) {\n      if (!fst_array_[i]) continue;\n      if (fst_array_[i]->Properties(props, true) != props || !depaccess_[i]) {\n        return false;\n      }\n    }\n    return true;\n  }\n\n  // Removes useless FSTs, states and transitions from the RTN.\n  void Connect();\n\n  // Replaces FSTs specified by labels, unless there are cyclic dependencies.\n  void ReplaceLabels(const std::vector<Label> &labels);\n\n  // Replaces FSTs that have at most nstates states, narcs arcs and nnonterm\n  // non-terminals (updating in reverse dependency order), unless there are\n  // cyclic dependencies.\n  void ReplaceBySize(size_t nstates, size_t narcs, size_t nnonterms);\n\n  // Replaces singleton FSTS, unless there are cyclic dependencies.\n  void ReplaceTrivial() { ReplaceBySize(2, 1, 1); }\n\n  // Replaces non-terminals that have at most ninstances instances (updating in\n  // dependency order), unless there are cyclic dependencies.\n  void ReplaceByInstances(size_t ninstances);\n\n  // Replaces non-terminals that have only one instance, unless there are cyclic\n  // dependencies.\n  void ReplaceUnique() { ReplaceByInstances(1); }\n\n  // Returns label/FST pairs, retaining FST ownership.\n  void GetFstPairs(std::vector<FstPair> *fst_pairs);\n\n  // Returns label/mutable FST pairs, giving FST ownership over to the caller.\n  void GetMutableFstPairs(std::vector<MutableFstPair> *mutable_fst_pairs);\n\n private:\n  // FST statistics.\n  struct ReplaceStats {\n    StateId nstates;  // Number of states.\n    StateId nfinal;   // Number of final states.\n    size_t narcs;     // Number of arcs.\n    Label nnonterms;  // Number of non-terminals in FST.\n    size_t nref;      // Number of non-terminal instances referring to this FST.\n    // Number of times that ith FST references this FST\n    std::map<Label, size_t> inref;\n    // Number of times that this FST references the ith FST\n    std::map<Label, size_t> outref;\n\n    ReplaceStats() : nstates(0), nfinal(0), narcs(0), nnonterms(0), nref(0) {}\n  };\n\n  // Checks that Mutable FSTs exists, creating them if necessary.\n  void CheckMutableFsts();\n\n  // Computes the dependency graph for the RTN, computing dependency statistics\n  // if stats is true.\n  void GetDependencies(bool stats) const;\n\n  void ClearDependencies() const {\n    depfst_.DeleteStates();\n    stats_.clear();\n    depprops_ = 0;\n    depsccprops_.clear();\n    have_stats_ = false;\n  }\n\n  // Gets topological order of dependencies, returning false with cyclic input.\n  bool GetTopOrder(const Fst<Arc> &fst, std::vector<Label> *toporder) const;\n\n  // Updates statistics to reflect the replacement of the jth FST.\n  void UpdateStats(Label j);\n\n  // Computes the properties for the strongly-connected component in the\n  // dependency graph of the replace FSTs.\n  void GetSCCProperties() const;\n\n  Label root_label_;                                  // Root non-terminal.\n  Label root_fst_;                                    // Root FST ID.\n  ReplaceLabelType call_label_type_;                  // See Replace().\n  ReplaceLabelType return_label_type_;                // See Replace().\n  int64 return_label_;                                // See Replace().\n  std::vector<const Fst<Arc> *> fst_array_;           // FST per ID.\n  std::vector<MutableFst<Arc> *> mutable_fst_array_;  // Mutable FST per ID.\n  std::vector<Label> nonterminal_array_;              // FST ID to non-terminal.\n  NonTerminalHash nonterminal_hash_;                  // Non-terminal to FST ID.\n  mutable VectorFst<Arc> depfst_;                     // FST ID dependencies.\n  mutable std::vector<StateId> depscc_;               // FST SCC ID.\n  mutable std::vector<bool> depaccess_;               // FST ID accessibility.\n  mutable uint64 depprops_;                           // Dependency FST props.\n  mutable bool have_stats_;                  // Have dependency statistics?\n  mutable std::vector<ReplaceStats> stats_;  // Per-FST statistics.\n  mutable std::vector<uint8> depsccprops_;   // SCC properties.\n  ReplaceUtil(const ReplaceUtil &) = delete;\n  ReplaceUtil &operator=(const ReplaceUtil &) = delete;\n};\n\ntemplate <class Arc>\nReplaceUtil<Arc>::ReplaceUtil(const std::vector<MutableFstPair> &fst_pairs,\n                              const ReplaceUtilOptions &opts)\n    : root_label_(opts.root),\n      call_label_type_(opts.call_label_type),\n      return_label_type_(opts.return_label_type),\n      return_label_(opts.return_label),\n      depprops_(0),\n      have_stats_(false) {\n  fst_array_.push_back(nullptr);\n  mutable_fst_array_.push_back(nullptr);\n  nonterminal_array_.push_back(kNoLabel);\n  for (const auto &fst_pair : fst_pairs) {\n    const auto label = fst_pair.first;\n    auto *fst = fst_pair.second;\n    nonterminal_hash_[label] = fst_array_.size();\n    nonterminal_array_.push_back(label);\n    fst_array_.push_back(fst);\n    mutable_fst_array_.push_back(fst);\n  }\n  root_fst_ = nonterminal_hash_[root_label_];\n  if (!root_fst_) {\n    FSTERROR() << \"ReplaceUtil: No root FST for label: \" << root_label_;\n  }\n}\n\ntemplate <class Arc>\nReplaceUtil<Arc>::ReplaceUtil(const std::vector<FstPair> &fst_pairs,\n                              const ReplaceUtilOptions &opts)\n    : root_label_(opts.root),\n      call_label_type_(opts.call_label_type),\n      return_label_type_(opts.return_label_type),\n      return_label_(opts.return_label),\n      depprops_(0),\n      have_stats_(false) {\n  fst_array_.push_back(nullptr);\n  nonterminal_array_.push_back(kNoLabel);\n  for (const auto &fst_pair : fst_pairs) {\n    const auto label = fst_pair.first;\n    const auto *fst = fst_pair.second;\n    nonterminal_hash_[label] = fst_array_.size();\n    nonterminal_array_.push_back(label);\n    fst_array_.push_back(fst->Copy());\n  }\n  root_fst_ = nonterminal_hash_[root_label_];\n  if (!root_fst_) {\n    FSTERROR() << \"ReplaceUtil: No root FST for label: \" << root_label_;\n  }\n}\n\ntemplate <class Arc>\nReplaceUtil<Arc>::ReplaceUtil(\n    const std::vector<std::unique_ptr<const Fst<Arc>>> &fst_array,\n    const NonTerminalHash &nonterminal_hash, const ReplaceUtilOptions &opts)\n    : root_fst_(opts.root),\n      call_label_type_(opts.call_label_type),\n      return_label_type_(opts.return_label_type),\n      return_label_(opts.return_label),\n      nonterminal_array_(fst_array.size()),\n      nonterminal_hash_(nonterminal_hash),\n      depprops_(0),\n      have_stats_(false) {\n  fst_array_.push_back(nullptr);\n  for (size_t i = 1; i < fst_array.size(); ++i) {\n    fst_array_.push_back(fst_array[i]->Copy());\n  }\n  for (auto it = nonterminal_hash.begin(); it != nonterminal_hash.end(); ++it) {\n    nonterminal_array_[it->second] = it->first;\n  }\n  root_label_ = nonterminal_array_[root_fst_];\n}\n\ntemplate <class Arc>\nvoid ReplaceUtil<Arc>::GetDependencies(bool stats) const {\n  if (depfst_.NumStates() > 0) {\n    if (stats && !have_stats_) {\n      ClearDependencies();\n    } else {\n      return;\n    }\n  }\n  have_stats_ = stats;\n  if (have_stats_) stats_.reserve(fst_array_.size());\n  for (Label i = 0; i < fst_array_.size(); ++i) {\n    depfst_.AddState();\n    depfst_.SetFinal(i, Weight::One());\n    if (have_stats_) stats_.push_back(ReplaceStats());\n  }\n  depfst_.SetStart(root_fst_);\n  // An arc from each state (representing the FST) to the state representing the\n  // FST being replaced\n  for (Label i = 0; i < fst_array_.size(); ++i) {\n    const auto *ifst = fst_array_[i];\n    if (!ifst) continue;\n    for (StateIterator<Fst<Arc>> siter(*ifst); !siter.Done(); siter.Next()) {\n      const auto s = siter.Value();\n      if (have_stats_) {\n        ++stats_[i].nstates;\n        if (ifst->Final(s) != Weight::Zero()) ++stats_[i].nfinal;\n      }\n      for (ArcIterator<Fst<Arc>> aiter(*ifst, s); !aiter.Done();\n           aiter.Next()) {\n        if (have_stats_) ++stats_[i].narcs;\n        const auto &arc = aiter.Value();\n        auto it = nonterminal_hash_.find(arc.olabel);\n        if (it != nonterminal_hash_.end()) {\n          const auto j = it->second;\n          depfst_.AddArc(i, Arc(arc.olabel, arc.olabel, Weight::One(), j));\n          if (have_stats_) {\n            ++stats_[i].nnonterms;\n            ++stats_[j].nref;\n            ++stats_[j].inref[i];\n            ++stats_[i].outref[j];\n          }\n        }\n      }\n    }\n  }\n  // Computes accessibility info.\n  SccVisitor<Arc> scc_visitor(&depscc_, &depaccess_, nullptr, &depprops_);\n  DfsVisit(depfst_, &scc_visitor);\n}\n\ntemplate <class Arc>\nvoid ReplaceUtil<Arc>::UpdateStats(Label j) {\n  if (!have_stats_) {\n    FSTERROR() << \"ReplaceUtil::UpdateStats: Stats not available\";\n    return;\n  }\n  if (j == root_fst_) return;  // Can't replace root.\n  for (auto in = stats_[j].inref.begin(); in != stats_[j].inref.end(); ++in) {\n    const auto i = in->first;\n    const auto ni = in->second;\n    stats_[i].nstates += stats_[j].nstates * ni;\n    stats_[i].narcs += (stats_[j].narcs + 1) * ni;\n    stats_[i].nnonterms += (stats_[j].nnonterms - 1) * ni;\n    stats_[i].outref.erase(j);\n    for (auto out = stats_[j].outref.begin(); out != stats_[j].outref.end();\n         ++out) {\n      const auto k = out->first;\n      const auto nk = out->second;\n      stats_[i].outref[k] += ni * nk;\n    }\n  }\n  for (auto out = stats_[j].outref.begin(); out != stats_[j].outref.end();\n       ++out) {\n    const auto k = out->first;\n    const auto nk = out->second;\n    stats_[k].nref -= nk;\n    stats_[k].inref.erase(j);\n    for (auto in = stats_[j].inref.begin(); in != stats_[j].inref.end(); ++in) {\n      const auto i = in->first;\n      const auto ni = in->second;\n      stats_[k].inref[i] += ni * nk;\n      stats_[k].nref += ni * nk;\n    }\n  }\n}\n\ntemplate <class Arc>\nvoid ReplaceUtil<Arc>::CheckMutableFsts() {\n  if (mutable_fst_array_.empty()) {\n    for (Label i = 0; i < fst_array_.size(); ++i) {\n      if (!fst_array_[i]) {\n        mutable_fst_array_.push_back(nullptr);\n      } else {\n        mutable_fst_array_.push_back(new VectorFst<Arc>(*fst_array_[i]));\n        delete fst_array_[i];\n        fst_array_[i] = mutable_fst_array_[i];\n      }\n    }\n  }\n}\n\ntemplate <class Arc>\nvoid ReplaceUtil<Arc>::Connect() {\n  CheckMutableFsts();\n  static constexpr auto props = kAccessible | kCoAccessible;\n  for (auto *mutable_fst : mutable_fst_array_) {\n    if (!mutable_fst) continue;\n    if (mutable_fst->Properties(props, false) != props) {\n      fst::Connect(mutable_fst);\n    }\n  }\n  GetDependencies(false);\n  for (Label i = 0; i < mutable_fst_array_.size(); ++i) {\n    auto *fst = mutable_fst_array_[i];\n    if (fst && !depaccess_[i]) {\n      delete fst;\n      fst_array_[i] = nullptr;\n      mutable_fst_array_[i] = nullptr;\n    }\n  }\n  ClearDependencies();\n}\n\ntemplate <class Arc>\nbool ReplaceUtil<Arc>::GetTopOrder(const Fst<Arc> &fst,\n                                   std::vector<Label> *toporder) const {\n  // Finds topological order of dependencies.\n  std::vector<StateId> order;\n  bool acyclic = false;\n  TopOrderVisitor<Arc> top_order_visitor(&order, &acyclic);\n  DfsVisit(fst, &top_order_visitor);\n  if (!acyclic) {\n    LOG(WARNING) << \"ReplaceUtil::GetTopOrder: Cyclical label dependencies\";\n    return false;\n  }\n  toporder->resize(order.size());\n  for (Label i = 0; i < order.size(); ++i) (*toporder)[order[i]] = i;\n  return true;\n}\n\ntemplate <class Arc>\nvoid ReplaceUtil<Arc>::ReplaceLabels(const std::vector<Label> &labels) {\n  CheckMutableFsts();\n  std::unordered_set<Label> label_set;\n  for (const auto label : labels) {\n    // Can't replace root.\n    if (label != root_label_) label_set.insert(label);\n  }\n  // Finds FST dependencies restricted to the labels requested.\n  GetDependencies(false);\n  VectorFst<Arc> pfst(depfst_);\n  for (StateId i = 0; i < pfst.NumStates(); ++i) {\n    std::vector<Arc> arcs;\n    for (ArcIterator<VectorFst<Arc>> aiter(pfst, i); !aiter.Done();\n         aiter.Next()) {\n      const auto &arc = aiter.Value();\n      const auto label = nonterminal_array_[arc.nextstate];\n      if (label_set.count(label) > 0) arcs.push_back(arc);\n    }\n    pfst.DeleteArcs(i);\n    for (const auto &arc : arcs) pfst.AddArc(i, arc);\n  }\n  std::vector<Label> toporder;\n  if (!GetTopOrder(pfst, &toporder)) {\n    ClearDependencies();\n    return;\n  }\n  // Visits FSTs in reverse topological order of dependencies and performs\n  // replacements.\n  for (Label o = toporder.size() - 1; o >= 0; --o) {\n    std::vector<FstPair> fst_pairs;\n    auto s = toporder[o];\n    for (ArcIterator<VectorFst<Arc>> aiter(pfst, s); !aiter.Done();\n         aiter.Next()) {\n      const auto &arc = aiter.Value();\n      const auto label = nonterminal_array_[arc.nextstate];\n      const auto *fst = fst_array_[arc.nextstate];\n      fst_pairs.push_back(std::make_pair(label, fst));\n    }\n    if (fst_pairs.empty()) continue;\n    const auto label = nonterminal_array_[s];\n    const auto *fst = fst_array_[s];\n    fst_pairs.push_back(std::make_pair(label, fst));\n    const ReplaceUtilOptions opts(label, call_label_type_, return_label_type_,\n                                  return_label_);\n    Replace(fst_pairs, mutable_fst_array_[s], opts);\n  }\n  ClearDependencies();\n}\n\ntemplate <class Arc>\nvoid ReplaceUtil<Arc>::ReplaceBySize(size_t nstates, size_t narcs,\n                                     size_t nnonterms) {\n  std::vector<Label> labels;\n  GetDependencies(true);\n  std::vector<Label> toporder;\n  if (!GetTopOrder(depfst_, &toporder)) {\n    ClearDependencies();\n    return;\n  }\n  for (Label o = toporder.size() - 1; o >= 0; --o) {\n    const auto j = toporder[o];\n    if (stats_[j].nstates <= nstates && stats_[j].narcs <= narcs &&\n        stats_[j].nnonterms <= nnonterms) {\n      labels.push_back(nonterminal_array_[j]);\n      UpdateStats(j);\n    }\n  }\n  ReplaceLabels(labels);\n}\n\ntemplate <class Arc>\nvoid ReplaceUtil<Arc>::ReplaceByInstances(size_t ninstances) {\n  std::vector<Label> labels;\n  GetDependencies(true);\n  std::vector<Label> toporder;\n  if (!GetTopOrder(depfst_, &toporder)) {\n    ClearDependencies();\n    return;\n  }\n  for (Label o = 0; o < toporder.size(); ++o) {\n    const auto j = toporder[o];\n    if (stats_[j].nref <= ninstances) {\n      labels.push_back(nonterminal_array_[j]);\n      UpdateStats(j);\n    }\n  }\n  ReplaceLabels(labels);\n}\n\ntemplate <class Arc>\nvoid ReplaceUtil<Arc>::GetFstPairs(std::vector<FstPair> *fst_pairs) {\n  CheckMutableFsts();\n  fst_pairs->clear();\n  for (Label i = 0; i < fst_array_.size(); ++i) {\n    const auto label = nonterminal_array_[i];\n    const auto *fst = fst_array_[i];\n    if (!fst) continue;\n    fst_pairs->push_back(std::make_pair(label, fst));\n  }\n}\n\ntemplate <class Arc>\nvoid ReplaceUtil<Arc>::GetMutableFstPairs(\n    std::vector<MutableFstPair> *mutable_fst_pairs) {\n  CheckMutableFsts();\n  mutable_fst_pairs->clear();\n  for (Label i = 0; i < mutable_fst_array_.size(); ++i) {\n    const auto label = nonterminal_array_[i];\n    const auto *fst = mutable_fst_array_[i];\n    if (!fst) continue;\n    mutable_fst_pairs->push_back(std::make_pair(label, fst->Copy()));\n  }\n}\n\ntemplate <class Arc>\nvoid ReplaceUtil<Arc>::GetSCCProperties() const {\n  if (!depsccprops_.empty()) return;\n  GetDependencies(false);\n  if (depscc_.empty()) return;\n  for (StateId scc = 0; scc < depscc_.size(); ++scc) {\n    depsccprops_.push_back(kReplaceSCCLeftLinear | kReplaceSCCRightLinear);\n  }\n  if (!(depprops_ & kCyclic)) return;  // No cyclic dependencies.\n  // Checks for self-loops in the dependency graph.\n  for (StateId scc = 0; scc < depscc_.size(); ++scc) {\n    for (ArcIterator<Fst<Arc> > aiter(depfst_, scc);\n         !aiter.Done(); aiter.Next()) {\n      const auto &arc = aiter.Value();\n      if (arc.nextstate == scc) {  // SCC has a self loop.\n        depsccprops_[scc] |= kReplaceSCCNonTrivial;\n      }\n    }\n  }\n  std::vector<bool> depscc_visited(depscc_.size(), false);\n  for (Label i = 0; i < fst_array_.size(); ++i) {\n    const auto *fst = fst_array_[i];\n    if (!fst) continue;\n    const auto depscc = depscc_[i];\n    if (depscc_visited[depscc]) {  // SCC has more than one state.\n      depsccprops_[depscc] |= kReplaceSCCNonTrivial;\n    }\n    depscc_visited[depscc] = true;\n    std::vector<StateId> fstscc;  // SCCs of the current FST.\n    uint64 fstprops;\n    SccVisitor<Arc> scc_visitor(&fstscc, nullptr, nullptr, &fstprops);\n    DfsVisit(*fst, &scc_visitor);\n    for (StateIterator<Fst<Arc>> siter(*fst); !siter.Done(); siter.Next()) {\n      const auto s = siter.Value();\n      for (ArcIterator<Fst<Arc>> aiter(*fst, s); !aiter.Done(); aiter.Next()) {\n        const auto &arc = aiter.Value();\n        auto it = nonterminal_hash_.find(arc.olabel);\n        if (it == nonterminal_hash_.end() || depscc_[it->second] != depscc) {\n          continue;  // Skips if a terminal or a non-terminal not in SCC.\n        }\n        const bool arc_in_cycle = fstscc[s] == fstscc[arc.nextstate];\n        // Left linear iff all non-terminals are initial.\n        if (s != fst->Start() || arc_in_cycle) {\n          depsccprops_[depscc] &= ~kReplaceSCCLeftLinear;\n        }\n        // Right linear iff all non-terminals are final.\n        if (fst->Final(arc.nextstate) == Weight::Zero() || arc_in_cycle) {\n          depsccprops_[depscc] &= ~kReplaceSCCRightLinear;\n        }\n      }\n    }\n  }\n}\n\n}  // namespace fst\n\n#endif  // FST_REPLACE_UTIL_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/replace.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Functions and classes for the recursive replacement of FSTs.\n\n#ifndef FST_REPLACE_H_\n#define FST_REPLACE_H_\n\n#include <set>\n#include <string>\n#include <unordered_map>\n#include <utility>\n#include <vector>\n\n#include <fst/log.h>\n\n#include <fst/cache.h>\n#include <fst/expanded-fst.h>\n#include <fst/fst-decl.h>  // For optional argument declarations.\n#include <fst/fst.h>\n#include <fst/matcher.h>\n#include <fst/replace-util.h>\n#include <fst/state-table.h>\n#include <fst/test-properties.h>\n\nnamespace fst {\n\n// Replace state tables have the form:\n//\n// template <class Arc, class P>\n// class ReplaceStateTable {\n//  public:\n//   using Label = typename Arc::Label Label;\n//   using StateId = typename Arc::StateId;\n//\n//   using PrefixId = P;\n//   using StateTuple = ReplaceStateTuple<StateId, PrefixId>;\n//   using StackPrefix = ReplaceStackPrefix<Label, StateId>;\n//\n//   // Required constructor.\n//   ReplaceStateTable(\n//       const std::vector<std::pair<Label, const Fst<Arc> *>> &fst_list,\n//       Label root);\n//\n//   // Required copy constructor that does not copy state.\n//   ReplaceStateTable(const ReplaceStateTable<Arc, PrefixId> &table);\n//\n//   // Looks up state ID by tuple, adding it if it doesn't exist.\n//   StateId FindState(const StateTuple &tuple);\n//\n//   // Looks up state tuple by ID.\n//   const StateTuple &Tuple(StateId id) const;\n//\n//   // Lookus up prefix ID by stack prefix, adding it if it doesn't exist.\n//   PrefixId FindPrefixId(const StackPrefix &stack_prefix);\n//\n//  // Looks up stack prefix by ID.\n//  const StackPrefix &GetStackPrefix(PrefixId id) const;\n// };\n\n// Tuple that uniquely defines a state in replace.\ntemplate <class S, class P>\nstruct ReplaceStateTuple {\n  using StateId = S;\n  using PrefixId = P;\n\n  ReplaceStateTuple(PrefixId prefix_id = -1, StateId fst_id = kNoStateId,\n                    StateId fst_state = kNoStateId)\n      : prefix_id(prefix_id), fst_id(fst_id), fst_state(fst_state) {}\n\n  PrefixId prefix_id;  // Index in prefix table.\n  StateId fst_id;      // Current FST being walked.\n  StateId fst_state;   // Current state in FST being walked (not to be\n                       // confused with the thse StateId of the combined FST).\n};\n\n// Equality of replace state tuples.\ntemplate <class StateId, class PrefixId>\ninline bool operator==(const ReplaceStateTuple<StateId, PrefixId> &x,\n                       const ReplaceStateTuple<StateId, PrefixId> &y) {\n  return x.prefix_id == y.prefix_id && x.fst_id == y.fst_id &&\n         x.fst_state == y.fst_state;\n}\n\n// Functor returning true for tuples corresponding to states in the root FST.\ntemplate <class StateId, class PrefixId>\nclass ReplaceRootSelector {\n public:\n  bool operator()(const ReplaceStateTuple<StateId, PrefixId> &tuple) const {\n    return tuple.prefix_id == 0;\n  }\n};\n\n// Functor for fingerprinting replace state tuples.\ntemplate <class StateId, class PrefixId>\nclass ReplaceFingerprint {\n public:\n  explicit ReplaceFingerprint(const std::vector<uint64> *size_array)\n      : size_array_(size_array) {}\n\n  uint64 operator()(const ReplaceStateTuple<StateId, PrefixId> &tuple) const {\n    return tuple.prefix_id * size_array_->back() +\n           size_array_->at(tuple.fst_id - 1) + tuple.fst_state;\n  }\n\n private:\n  const std::vector<uint64> *size_array_;\n};\n\n// Useful when the fst_state uniquely define the tuple.\ntemplate <class StateId, class PrefixId>\nclass ReplaceFstStateFingerprint {\n public:\n  uint64 operator()(const ReplaceStateTuple<StateId, PrefixId> &tuple) const {\n    return tuple.fst_state;\n  }\n};\n\n// A generic hash function for replace state tuples.\ntemplate <typename S, typename P>\nclass ReplaceHash {\n public:\n  size_t operator()(const ReplaceStateTuple<S, P>& t) const {\n    static constexpr size_t prime0 = 7853;\n    static constexpr size_t prime1 = 7867;\n    return t.prefix_id + t.fst_id * prime0 + t.fst_state * prime1;\n  }\n};\n\n// Container for stack prefix.\ntemplate <class Label, class StateId>\nclass ReplaceStackPrefix {\n public:\n  struct PrefixTuple {\n    PrefixTuple(Label fst_id = kNoLabel, StateId nextstate = kNoStateId)\n        : fst_id(fst_id), nextstate(nextstate) {}\n\n    Label fst_id;\n    StateId nextstate;\n  };\n\n  ReplaceStackPrefix() {}\n\n  ReplaceStackPrefix(const ReplaceStackPrefix &other)\n      : prefix_(other.prefix_) {}\n\n  void Push(StateId fst_id, StateId nextstate) {\n    prefix_.push_back(PrefixTuple(fst_id, nextstate));\n  }\n\n  void Pop() { prefix_.pop_back(); }\n\n  const PrefixTuple &Top() const { return prefix_[prefix_.size() - 1]; }\n\n  size_t Depth() const { return prefix_.size(); }\n\n public:\n  std::vector<PrefixTuple> prefix_;\n};\n\n// Equality stack prefix classes.\ntemplate <class Label, class StateId>\ninline bool operator==(const ReplaceStackPrefix<Label, StateId> &x,\n                       const ReplaceStackPrefix<Label, StateId> &y) {\n  if (x.prefix_.size() != y.prefix_.size()) return false;\n  for (size_t i = 0; i < x.prefix_.size(); ++i) {\n    if (x.prefix_[i].fst_id != y.prefix_[i].fst_id ||\n        x.prefix_[i].nextstate != y.prefix_[i].nextstate) {\n      return false;\n    }\n  }\n  return true;\n}\n\n// Hash function for stack prefix to prefix id.\ntemplate <class Label, class StateId>\nclass ReplaceStackPrefixHash {\n public:\n  size_t operator()(const ReplaceStackPrefix<Label, StateId> &prefix) const {\n    size_t sum = 0;\n    for (const auto &pair : prefix.prefix_) {\n      static constexpr size_t prime = 7863;\n      sum += pair.fst_id + pair.nextstate * prime;\n    }\n    return sum;\n  }\n};\n\n// Replace state tables.\n\n// A two-level state table for replace. Warning: calls CountStates to compute\n// the number of states of each component FST.\ntemplate <class Arc, class P = ssize_t>\nclass VectorHashReplaceStateTable {\n public:\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n\n  using PrefixId = P;\n\n  using StateTuple = ReplaceStateTuple<StateId, PrefixId>;\n  using StateTable =\n      VectorHashStateTable<ReplaceStateTuple<StateId, PrefixId>,\n                           ReplaceRootSelector<StateId, PrefixId>,\n                           ReplaceFstStateFingerprint<StateId, PrefixId>,\n                           ReplaceFingerprint<StateId, PrefixId>>;\n  using StackPrefix = ReplaceStackPrefix<Label, StateId>;\n  using StackPrefixTable =\n      CompactHashBiTable<PrefixId, StackPrefix,\n                         ReplaceStackPrefixHash<Label, StateId>>;\n\n  VectorHashReplaceStateTable(\n      const std::vector<std::pair<Label, const Fst<Arc> *>> &fst_list,\n      Label root)\n      : root_size_(0) {\n    size_array_.push_back(0);\n    for (const auto &fst_pair : fst_list) {\n      if (fst_pair.first == root) {\n        root_size_ = CountStates(*(fst_pair.second));\n        size_array_.push_back(size_array_.back());\n      } else {\n        size_array_.push_back(size_array_.back() +\n                              CountStates(*(fst_pair.second)));\n      }\n    }\n    state_table_.reset(\n        new StateTable(new ReplaceRootSelector<StateId, PrefixId>,\n                       new ReplaceFstStateFingerprint<StateId, PrefixId>,\n                       new ReplaceFingerprint<StateId, PrefixId>(&size_array_),\n                       root_size_, root_size_ + size_array_.back()));\n  }\n\n  VectorHashReplaceStateTable(\n      const VectorHashReplaceStateTable<Arc, PrefixId> &table)\n      : root_size_(table.root_size_),\n        size_array_(table.size_array_),\n        prefix_table_(table.prefix_table_) {\n    state_table_.reset(\n        new StateTable(new ReplaceRootSelector<StateId, PrefixId>,\n                       new ReplaceFstStateFingerprint<StateId, PrefixId>,\n                       new ReplaceFingerprint<StateId, PrefixId>(&size_array_),\n                       root_size_, root_size_ + size_array_.back()));\n  }\n\n  StateId FindState(const StateTuple &tuple) {\n    return state_table_->FindState(tuple);\n  }\n\n  const StateTuple &Tuple(StateId id) const { return state_table_->Tuple(id); }\n\n  PrefixId FindPrefixId(const StackPrefix &prefix) {\n    return prefix_table_.FindId(prefix);\n  }\n\n  const StackPrefix& GetStackPrefix(PrefixId id) const {\n    return prefix_table_.FindEntry(id);\n  }\n\n private:\n  StateId root_size_;\n  std::vector<uint64> size_array_;\n  std::unique_ptr<StateTable> state_table_;\n  StackPrefixTable prefix_table_;\n};\n\n// Default replace state table.\ntemplate <class Arc, class P /* = size_t */>\nclass DefaultReplaceStateTable\n    : public CompactHashStateTable<ReplaceStateTuple<typename Arc::StateId, P>,\n                                   ReplaceHash<typename Arc::StateId, P>> {\n public:\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n\n  using PrefixId = P;\n  using StateTuple = ReplaceStateTuple<StateId, PrefixId>;\n  using StateTable =\n      CompactHashStateTable<StateTuple, ReplaceHash<StateId, PrefixId>>;\n  using StackPrefix = ReplaceStackPrefix<Label, StateId>;\n  using StackPrefixTable =\n      CompactHashBiTable<PrefixId, StackPrefix,\n                         ReplaceStackPrefixHash<Label, StateId>>;\n\n  using StateTable::FindState;\n  using StateTable::Tuple;\n\n  DefaultReplaceStateTable(\n      const std::vector<std::pair<Label, const Fst<Arc> *>> &, Label) {}\n\n  DefaultReplaceStateTable(const DefaultReplaceStateTable<Arc, PrefixId> &table)\n      : StateTable(), prefix_table_(table.prefix_table_) {}\n\n  PrefixId FindPrefixId(const StackPrefix &prefix) {\n    return prefix_table_.FindId(prefix);\n  }\n\n  const StackPrefix &GetStackPrefix(PrefixId id) const {\n    return prefix_table_.FindEntry(id);\n  }\n\n private:\n  StackPrefixTable prefix_table_;\n};\n\n// By default ReplaceFst will copy the input label of the replace arc.\n// The call_label_type and return_label_type options specify how to manage\n// the labels of the call arc and the return arc of the replace FST\ntemplate <class Arc, class StateTable = DefaultReplaceStateTable<Arc>,\n          class CacheStore = DefaultCacheStore<Arc>>\nstruct ReplaceFstOptions : CacheImplOptions<CacheStore> {\n  using Label = typename Arc::Label;\n\n  // Index of root rule for expansion.\n  Label root;\n  // How to label call arc.\n  ReplaceLabelType call_label_type = REPLACE_LABEL_INPUT;\n  // How to label return arc.\n  ReplaceLabelType return_label_type = REPLACE_LABEL_NEITHER;\n  // Specifies output label to put on call arc; if kNoLabel, use existing label\n  // on call arc. Otherwise, use this field as the output label.\n  Label call_output_label = kNoLabel;\n  // Specifies label to put on return arc.\n  Label return_label = 0;\n  // Take ownership of input FSTs?\n  bool take_ownership = false;\n  // Pointer to optional pre-constructed state table.\n  StateTable *state_table = nullptr;\n\n  explicit ReplaceFstOptions(const CacheImplOptions<CacheStore> &opts,\n                             Label root = kNoLabel)\n      : CacheImplOptions<CacheStore>(opts), root(root) {}\n\n  explicit ReplaceFstOptions(const CacheOptions &opts, Label root = kNoLabel)\n      : CacheImplOptions<CacheStore>(opts), root(root) {}\n\n  // FIXME(kbg): There are too many constructors here. Come up with a consistent\n  // position for call_output_label (probably the very end) so that it is\n  // possible to express all the remaining constructors with a single\n  // default-argument constructor. Also move clients off of the \"backwards\n  // compatibility\" constructor, for good.\n\n  explicit ReplaceFstOptions(Label root) : root(root) {}\n\n  explicit ReplaceFstOptions(Label root, ReplaceLabelType call_label_type,\n                             ReplaceLabelType return_label_type,\n                             Label return_label)\n      : root(root),\n        call_label_type(call_label_type),\n        return_label_type(return_label_type),\n        return_label(return_label) {}\n\n  explicit ReplaceFstOptions(Label root, ReplaceLabelType call_label_type,\n                             ReplaceLabelType return_label_type,\n                             Label call_output_label, Label return_label)\n      : root(root),\n        call_label_type(call_label_type),\n        return_label_type(return_label_type),\n        call_output_label(call_output_label),\n        return_label(return_label) {}\n\n  explicit ReplaceFstOptions(const ReplaceUtilOptions &opts)\n      : ReplaceFstOptions(opts.root, opts.call_label_type,\n                          opts.return_label_type, opts.return_label) {}\n\n  ReplaceFstOptions() : root(kNoLabel) {}\n\n  // For backwards compatibility.\n  ReplaceFstOptions(int64 root, bool epsilon_replace_arc)\n      : root(root),\n        call_label_type(epsilon_replace_arc ? REPLACE_LABEL_NEITHER\n                                            : REPLACE_LABEL_INPUT),\n        call_output_label(epsilon_replace_arc ? 0 : kNoLabel) {}\n};\n\n\n// Forward declaration.\ntemplate <class Arc, class StateTable, class CacheStore>\nclass ReplaceFstMatcher;\n\ntemplate <class Arc>\nusing FstList = std::vector<std::pair<typename Arc::Label, const Fst<Arc> *>>;\n\n// Returns true if label type on arc results in epsilon input label.\ninline bool EpsilonOnInput(ReplaceLabelType label_type) {\n  return label_type == REPLACE_LABEL_NEITHER ||\n         label_type == REPLACE_LABEL_OUTPUT;\n}\n\n// Returns true if label type on arc results in epsilon input label.\ninline bool EpsilonOnOutput(ReplaceLabelType label_type) {\n  return label_type == REPLACE_LABEL_NEITHER ||\n         label_type == REPLACE_LABEL_INPUT;\n}\n\n// Returns true if for either the call or return arc ilabel != olabel.\ntemplate <class Label>\nbool ReplaceTransducer(ReplaceLabelType call_label_type,\n                       ReplaceLabelType return_label_type,\n                       Label call_output_label) {\n  return call_label_type == REPLACE_LABEL_INPUT ||\n         call_label_type == REPLACE_LABEL_OUTPUT ||\n         (call_label_type == REPLACE_LABEL_BOTH &&\n          call_output_label != kNoLabel) ||\n         return_label_type == REPLACE_LABEL_INPUT ||\n         return_label_type == REPLACE_LABEL_OUTPUT;\n}\n\ntemplate <class Arc>\nuint64 ReplaceFstProperties(typename Arc::Label root_label,\n                            const FstList<Arc> &fst_list,\n                            ReplaceLabelType call_label_type,\n                            ReplaceLabelType return_label_type,\n                            typename Arc::Label call_output_label,\n                            bool *sorted_and_non_empty) {\n  using Label = typename Arc::Label;\n  std::vector<uint64> inprops;\n  bool all_ilabel_sorted = true;\n  bool all_olabel_sorted = true;\n  bool all_non_empty = true;\n  // All nonterminals are negative?\n  bool all_negative = true;\n  // All nonterminals are positive and form a dense range containing 1?\n  bool dense_range = true;\n  Label root_fst_idx = 0;\n  for (Label i = 0; i < fst_list.size(); ++i) {\n    const auto label = fst_list[i].first;\n    if (label >= 0) all_negative = false;\n    if (label > fst_list.size() || label <= 0) dense_range = false;\n    if (label == root_label) root_fst_idx = i;\n    const auto *fst = fst_list[i].second;\n    if (fst->Start() == kNoStateId) all_non_empty = false;\n    if (!fst->Properties(kILabelSorted, false)) all_ilabel_sorted = false;\n    if (!fst->Properties(kOLabelSorted, false)) all_olabel_sorted = false;\n    inprops.push_back(fst->Properties(kCopyProperties, false));\n  }\n  const auto props = ReplaceProperties(\n      inprops, root_fst_idx, EpsilonOnInput(call_label_type),\n      EpsilonOnInput(return_label_type), EpsilonOnOutput(call_label_type),\n      EpsilonOnOutput(return_label_type),\n      ReplaceTransducer(call_label_type, return_label_type, call_output_label),\n      all_non_empty, all_ilabel_sorted, all_olabel_sorted,\n      all_negative || dense_range);\n  const bool sorted = props & (kILabelSorted | kOLabelSorted);\n  *sorted_and_non_empty = all_non_empty && sorted;\n  return props;\n}\n\nnamespace internal {\n\n// The replace implementation class supports a dynamic expansion of a recursive\n// transition network represented as label/FST pairs with dynamic replacable\n// arcs.\ntemplate <class Arc, class StateTable, class CacheStore>\nclass ReplaceFstImpl\n    : public CacheBaseImpl<typename CacheStore::State, CacheStore> {\n public:\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using State = typename CacheStore::State;\n  using CacheImpl = CacheBaseImpl<State, CacheStore>;\n  using PrefixId = typename StateTable::PrefixId;\n  using StateTuple = ReplaceStateTuple<StateId, PrefixId>;\n  using StackPrefix = ReplaceStackPrefix<Label, StateId>;\n  using NonTerminalHash = std::unordered_map<Label, Label>;\n\n  using FstImpl<Arc>::SetType;\n  using FstImpl<Arc>::SetProperties;\n  using FstImpl<Arc>::WriteHeader;\n  using FstImpl<Arc>::SetInputSymbols;\n  using FstImpl<Arc>::SetOutputSymbols;\n  using FstImpl<Arc>::InputSymbols;\n  using FstImpl<Arc>::OutputSymbols;\n\n  using CacheImpl::PushArc;\n  using CacheImpl::HasArcs;\n  using CacheImpl::HasFinal;\n  using CacheImpl::HasStart;\n  using CacheImpl::SetArcs;\n  using CacheImpl::SetFinal;\n  using CacheImpl::SetStart;\n\n  friend class ReplaceFstMatcher<Arc, StateTable, CacheStore>;\n\n  ReplaceFstImpl(const FstList<Arc> &fst_list,\n                 const ReplaceFstOptions<Arc, StateTable, CacheStore> &opts)\n      : CacheImpl(opts),\n        call_label_type_(opts.call_label_type),\n        return_label_type_(opts.return_label_type),\n        call_output_label_(opts.call_output_label),\n        return_label_(opts.return_label),\n        state_table_(opts.state_table ? opts.state_table\n                                      : new StateTable(fst_list, opts.root)) {\n    SetType(\"replace\");\n    // If the label is epsilon, then all replace label options are equivalent,\n    // so we set the label types to NEITHER for simplicity.\n    if (call_output_label_ == 0) call_label_type_ = REPLACE_LABEL_NEITHER;\n    if (return_label_ == 0) return_label_type_ = REPLACE_LABEL_NEITHER;\n    if (!fst_list.empty()) {\n      SetInputSymbols(fst_list[0].second->InputSymbols());\n      SetOutputSymbols(fst_list[0].second->OutputSymbols());\n    }\n    fst_array_.push_back(nullptr);\n    for (Label i = 0; i < fst_list.size(); ++i) {\n      const auto label = fst_list[i].first;\n      const auto *fst = fst_list[i].second;\n      nonterminal_hash_[label] = fst_array_.size();\n      nonterminal_set_.insert(label);\n      fst_array_.emplace_back(opts.take_ownership ? fst : fst->Copy());\n      if (i) {\n        if (!CompatSymbols(InputSymbols(), fst->InputSymbols())) {\n          FSTERROR() << \"ReplaceFstImpl: Input symbols of FST \" << i\n                     << \" do not match input symbols of base FST (0th FST)\";\n          SetProperties(kError, kError);\n        }\n        if (!CompatSymbols(OutputSymbols(), fst->OutputSymbols())) {\n          FSTERROR() << \"ReplaceFstImpl: Output symbols of FST \" << i\n                     << \" do not match output symbols of base FST (0th FST)\";\n          SetProperties(kError, kError);\n        }\n      }\n    }\n    const auto nonterminal = nonterminal_hash_[opts.root];\n    if ((nonterminal == 0) && (fst_array_.size() > 1)) {\n      FSTERROR() << \"ReplaceFstImpl: No FST corresponding to root label \"\n                 << opts.root << \" in the input tuple vector\";\n      SetProperties(kError, kError);\n    }\n    root_ = (nonterminal > 0) ? nonterminal : 1;\n    bool all_non_empty_and_sorted = false;\n    SetProperties(ReplaceFstProperties(opts.root, fst_list, call_label_type_,\n                                       return_label_type_, call_output_label_,\n                                       &all_non_empty_and_sorted));\n    // Enables optional caching as long as sorted and all non-empty.\n    always_cache_ = !all_non_empty_and_sorted;\n    VLOG(2) << \"ReplaceFstImpl::ReplaceFstImpl: always_cache = \"\n            << (always_cache_ ? \"true\" : \"false\");\n  }\n\n  ReplaceFstImpl(const ReplaceFstImpl &impl)\n      : CacheImpl(impl),\n        call_label_type_(impl.call_label_type_),\n        return_label_type_(impl.return_label_type_),\n        call_output_label_(impl.call_output_label_),\n        return_label_(impl.return_label_),\n        always_cache_(impl.always_cache_),\n        state_table_(new StateTable(*(impl.state_table_))),\n        nonterminal_set_(impl.nonterminal_set_),\n        nonterminal_hash_(impl.nonterminal_hash_),\n        root_(impl.root_) {\n    SetType(\"replace\");\n    SetProperties(impl.Properties(), kCopyProperties);\n    SetInputSymbols(impl.InputSymbols());\n    SetOutputSymbols(impl.OutputSymbols());\n    fst_array_.reserve(impl.fst_array_.size());\n    fst_array_.emplace_back(nullptr);\n    for (Label i = 1; i < impl.fst_array_.size(); ++i) {\n      fst_array_.emplace_back(impl.fst_array_[i]->Copy(true));\n    }\n  }\n\n  // Computes the dependency graph of the replace class and returns\n  // true if the dependencies are cyclic. Cyclic dependencies will result\n  // in an un-expandable FST.\n  bool CyclicDependencies() const {\n    const ReplaceUtilOptions opts(root_);\n    ReplaceUtil<Arc> replace_util(fst_array_, nonterminal_hash_, opts);\n    return replace_util.CyclicDependencies();\n  }\n\n  StateId Start() {\n    if (!HasStart()) {\n      if (fst_array_.size() == 1) {\n        SetStart(kNoStateId);\n        return kNoStateId;\n      } else {\n        const auto fst_start = fst_array_[root_]->Start();\n        if (fst_start == kNoStateId) return kNoStateId;\n        const auto prefix = GetPrefixId(StackPrefix());\n        const auto start =\n            state_table_->FindState(StateTuple(prefix, root_, fst_start));\n        SetStart(start);\n        return start;\n      }\n    } else {\n      return CacheImpl::Start();\n    }\n  }\n\n  Weight Final(StateId s) {\n    if (HasFinal(s)) return CacheImpl::Final(s);\n    const auto &tuple = state_table_->Tuple(s);\n    auto weight = Weight::Zero();\n    if (tuple.prefix_id == 0) {\n      const auto fst_state = tuple.fst_state;\n      weight = fst_array_[tuple.fst_id]->Final(fst_state);\n    }\n    if (always_cache_ || HasArcs(s)) SetFinal(s, weight);\n    return weight;\n  }\n\n  size_t NumArcs(StateId s) {\n    if (HasArcs(s)) {\n      return CacheImpl::NumArcs(s);\n    } else if (always_cache_) {  // If always caching, expands and caches state.\n      Expand(s);\n      return CacheImpl::NumArcs(s);\n    } else {  // Otherwise computes the number of arcs without expanding.\n      const auto tuple = state_table_->Tuple(s);\n      if (tuple.fst_state == kNoStateId) return 0;\n      auto num_arcs = fst_array_[tuple.fst_id]->NumArcs(tuple.fst_state);\n      if (ComputeFinalArc(tuple, nullptr)) ++num_arcs;\n      return num_arcs;\n    }\n  }\n\n  // Returns whether a given label is a non-terminal.\n  bool IsNonTerminal(Label label) const {\n    if (label < *nonterminal_set_.begin() ||\n        label > *nonterminal_set_.rbegin()) {\n      return false;\n    } else {\n      return nonterminal_hash_.count(label);\n    }\n    // TODO(allauzen): be smarter and take advantage of all_dense or\n    // all_negative. Also use this in ComputeArc. This would require changes to\n    // Replace so that recursing into an empty FST lead to a non co-accessible\n    // state instead of deleting the arc as done currently. The current use\n    // correct, since labels are sorted if all_non_empty is true.\n  }\n\n  size_t NumInputEpsilons(StateId s) {\n    if (HasArcs(s)) {\n      return CacheImpl::NumInputEpsilons(s);\n    } else if (always_cache_ || !Properties(kILabelSorted)) {\n      // If always caching or if the number of input epsilons is too expensive\n      // to compute without caching (i.e., not ilabel-sorted), then expands and\n      // caches state.\n      Expand(s);\n      return CacheImpl::NumInputEpsilons(s);\n    } else {\n      // Otherwise, computes the number of input epsilons without caching.\n      const auto tuple = state_table_->Tuple(s);\n      if (tuple.fst_state == kNoStateId) return 0;\n      size_t num = 0;\n      if (!EpsilonOnInput(call_label_type_)) {\n        // If EpsilonOnInput(c) is false, all input epsilon arcs\n        // are also input epsilons arcs in the underlying machine.\n        num = fst_array_[tuple.fst_id]->NumInputEpsilons(tuple.fst_state);\n      } else {\n        // Otherwise, one need to consider that all non-terminal arcs\n        // in the underlying machine also become input epsilon arc.\n        ArcIterator<Fst<Arc>> aiter(*fst_array_[tuple.fst_id], tuple.fst_state);\n        for (; !aiter.Done() && ((aiter.Value().ilabel == 0) ||\n                                 IsNonTerminal(aiter.Value().olabel));\n             aiter.Next()) {\n          ++num;\n        }\n      }\n      if (EpsilonOnInput(return_label_type_) &&\n          ComputeFinalArc(tuple, nullptr)) {\n        ++num;\n      }\n      return num;\n    }\n  }\n\n  size_t NumOutputEpsilons(StateId s) {\n    if (HasArcs(s)) {\n      return CacheImpl::NumOutputEpsilons(s);\n    } else if (always_cache_ || !Properties(kOLabelSorted)) {\n      // If always caching or if the number of output epsilons is too expensive\n      // to compute without caching (i.e., not olabel-sorted), then expands and\n      // caches state.\n      Expand(s);\n      return CacheImpl::NumOutputEpsilons(s);\n    } else {\n      // Otherwise, computes the number of output epsilons without caching.\n      const auto tuple = state_table_->Tuple(s);\n      if (tuple.fst_state == kNoStateId) return 0;\n      size_t num = 0;\n      if (!EpsilonOnOutput(call_label_type_)) {\n        // If EpsilonOnOutput(c) is false, all output epsilon arcs are also\n        // output epsilons arcs in the underlying machine.\n        num = fst_array_[tuple.fst_id]->NumOutputEpsilons(tuple.fst_state);\n      } else {\n        // Otherwise, one need to consider that all non-terminal arcs in the\n        // underlying machine also become output epsilon arc.\n        ArcIterator<Fst<Arc>> aiter(*fst_array_[tuple.fst_id], tuple.fst_state);\n        for (; !aiter.Done() && ((aiter.Value().olabel == 0) ||\n                                 IsNonTerminal(aiter.Value().olabel));\n             aiter.Next()) {\n          ++num;\n        }\n      }\n      if (EpsilonOnOutput(return_label_type_) &&\n          ComputeFinalArc(tuple, nullptr)) {\n        ++num;\n      }\n      return num;\n    }\n  }\n\n  uint64 Properties() const override { return Properties(kFstProperties); }\n\n  // Sets error if found, and returns other FST impl properties.\n  uint64 Properties(uint64 mask) const override {\n    if (mask & kError) {\n      for (Label i = 1; i < fst_array_.size(); ++i) {\n        if (fst_array_[i]->Properties(kError, false)) {\n          SetProperties(kError, kError);\n        }\n      }\n    }\n    return FstImpl<Arc>::Properties(mask);\n  }\n\n  // Returns the base arc iterator, and if arcs have not been computed yet,\n  // extends and recurses for new arcs.\n  void InitArcIterator(StateId s, ArcIteratorData<Arc> *data) {\n    if (!HasArcs(s)) Expand(s);\n    CacheImpl::InitArcIterator(s, data);\n    // TODO(allauzen): Set behaviour of generic iterator.\n    // Warning: ArcIterator<ReplaceFst<A>>::InitCache() relies on current\n    // behaviour.\n  }\n\n  // Extends current state (walk arcs one level deep).\n  void Expand(StateId s) {\n    const auto tuple = state_table_->Tuple(s);\n    if (tuple.fst_state == kNoStateId) {  // Local FST is empty.\n      SetArcs(s);\n      return;\n    }\n    ArcIterator<Fst<Arc>> aiter(*fst_array_[tuple.fst_id], tuple.fst_state);\n    Arc arc;\n    // Creates a final arc when needed.\n    if (ComputeFinalArc(tuple, &arc)) PushArc(s, arc);\n    // Expands all arcs leaving the state.\n    for (; !aiter.Done(); aiter.Next()) {\n      if (ComputeArc(tuple, aiter.Value(), &arc)) PushArc(s, arc);\n    }\n    SetArcs(s);\n  }\n\n  void Expand(StateId s, const StateTuple &tuple,\n              const ArcIteratorData<Arc> &data) {\n    if (tuple.fst_state == kNoStateId) {  // Local FST is empty.\n      SetArcs(s);\n      return;\n    }\n    ArcIterator<Fst<Arc>> aiter(data);\n    Arc arc;\n    // Creates a final arc when needed.\n    if (ComputeFinalArc(tuple, &arc)) AddArc(s, arc);\n    // Expands all arcs leaving the state.\n    for (; !aiter.Done(); aiter.Next()) {\n      if (ComputeArc(tuple, aiter.Value(), &arc)) AddArc(s, arc);\n    }\n    SetArcs(s);\n  }\n\n  // If acpp is null, only returns true if a final arcp is required, but does\n  // not actually compute it.\n  bool ComputeFinalArc(const StateTuple &tuple, Arc *arcp,\n                       uint32 flags = kArcValueFlags) {\n    const auto fst_state = tuple.fst_state;\n    if (fst_state == kNoStateId) return false;\n    // If state is final, pops the stack.\n    if (fst_array_[tuple.fst_id]->Final(fst_state) != Weight::Zero() &&\n        tuple.prefix_id) {\n      if (arcp) {\n        arcp->ilabel = (EpsilonOnInput(return_label_type_)) ? 0 : return_label_;\n        arcp->olabel =\n            (EpsilonOnOutput(return_label_type_)) ? 0 : return_label_;\n        if (flags & kArcNextStateValue) {\n          const auto &stack = state_table_->GetStackPrefix(tuple.prefix_id);\n          const auto prefix_id = PopPrefix(stack);\n          const auto &top = stack.Top();\n          arcp->nextstate = state_table_->FindState(\n              StateTuple(prefix_id, top.fst_id, top.nextstate));\n        }\n        if (flags & kArcWeightValue) {\n          arcp->weight = fst_array_[tuple.fst_id]->Final(fst_state);\n        }\n      }\n      return true;\n    } else {\n      return false;\n    }\n  }\n\n  // Computes an arc in the FST corresponding to one in the underlying machine.\n  // Returns false if the underlying arc corresponds to no arc in the resulting\n  // FST.\n  bool ComputeArc(const StateTuple &tuple, const Arc &arc, Arc *arcp,\n                  uint32 flags = kArcValueFlags) {\n    if (!EpsilonOnInput(call_label_type_) &&\n        (flags == (flags & (kArcILabelValue | kArcWeightValue)))) {\n      *arcp = arc;\n      return true;\n    }\n    if (arc.olabel == 0 || arc.olabel < *nonterminal_set_.begin() ||\n        arc.olabel > *nonterminal_set_.rbegin()) {  // Expands local FST.\n      const auto nextstate =\n          flags & kArcNextStateValue\n              ? state_table_->FindState(\n                    StateTuple(tuple.prefix_id, tuple.fst_id, arc.nextstate))\n              : kNoStateId;\n      *arcp = Arc(arc.ilabel, arc.olabel, arc.weight, nextstate);\n    } else {\n      // Checks for non-terminal.\n      const auto it = nonterminal_hash_.find(arc.olabel);\n      if (it != nonterminal_hash_.end()) {  // Recurses into non-terminal.\n        const auto nonterminal = it->second;\n        const auto nt_prefix =\n            PushPrefix(state_table_->GetStackPrefix(tuple.prefix_id),\n                       tuple.fst_id, arc.nextstate);\n        // If the start state is valid, replace; othewise, the arc is implicitly\n        // deleted.\n        const auto nt_start = fst_array_[nonterminal]->Start();\n        if (nt_start != kNoStateId) {\n          const auto nt_nextstate = flags & kArcNextStateValue\n                                        ? state_table_->FindState(StateTuple(\n                                              nt_prefix, nonterminal, nt_start))\n                                        : kNoStateId;\n          const auto ilabel =\n              (EpsilonOnInput(call_label_type_)) ? 0 : arc.ilabel;\n          const auto olabel =\n              (EpsilonOnOutput(call_label_type_))\n                  ? 0\n                  : ((call_output_label_ == kNoLabel) ? arc.olabel\n                                                      : call_output_label_);\n          *arcp = Arc(ilabel, olabel, arc.weight, nt_nextstate);\n        } else {\n          return false;\n        }\n      } else {\n        const auto nextstate =\n            flags & kArcNextStateValue\n                ? state_table_->FindState(\n                      StateTuple(tuple.prefix_id, tuple.fst_id, arc.nextstate))\n                : kNoStateId;\n        *arcp = Arc(arc.ilabel, arc.olabel, arc.weight, nextstate);\n      }\n    }\n    return true;\n  }\n\n  // Returns the arc iterator flags supported by this FST.\n  uint32 ArcIteratorFlags() const {\n    uint32 flags = kArcValueFlags;\n    if (!always_cache_) flags |= kArcNoCache;\n    return flags;\n  }\n\n  StateTable *GetStateTable() const { return state_table_.get(); }\n\n  const Fst<Arc> *GetFst(Label fst_id) const {\n    return fst_array_[fst_id].get();\n  }\n\n  Label GetFstId(Label nonterminal) const {\n    const auto it = nonterminal_hash_.find(nonterminal);\n    if (it == nonterminal_hash_.end()) {\n      FSTERROR() << \"ReplaceFstImpl::GetFstId: Nonterminal not found: \"\n                 << nonterminal;\n    }\n    return it->second;\n  }\n\n  // Returns true if label type on call arc results in epsilon input label.\n  bool EpsilonOnCallInput() { return EpsilonOnInput(call_label_type_); }\n\n private:\n  // The unique index into stack prefix table.\n  PrefixId GetPrefixId(const StackPrefix &prefix) {\n    return state_table_->FindPrefixId(prefix);\n  }\n\n  // The prefix ID after a stack pop.\n  PrefixId PopPrefix(StackPrefix prefix) {\n    prefix.Pop();\n    return GetPrefixId(prefix);\n  }\n\n  // The prefix ID after a stack push.\n  PrefixId PushPrefix(StackPrefix prefix, Label fst_id, StateId nextstate) {\n    prefix.Push(fst_id, nextstate);\n    return GetPrefixId(prefix);\n  }\n\n  // Runtime options\n  ReplaceLabelType call_label_type_;    // How to label call arc.\n  ReplaceLabelType return_label_type_;  // How to label return arc.\n  int64 call_output_label_;  // Specifies output label to put on call arc\n  int64 return_label_;       // Specifies label to put on return arc.\n  bool always_cache_;        // Disable optional caching of arc iterator?\n\n  // State table.\n  std::unique_ptr<StateTable> state_table_;\n\n  // Replace components.\n  std::set<Label> nonterminal_set_;\n  NonTerminalHash nonterminal_hash_;\n  std::vector<std::unique_ptr<const Fst<Arc>>> fst_array_;\n  Label root_;\n};\n\n}  // namespace internal\n\n//\n// ReplaceFst supports dynamic replacement of arcs in one FST with another FST.\n// This replacement is recursive. ReplaceFst can be used to support a variety of\n// delayed constructions such as recursive\n// transition networks, union, or closure. It is constructed with an array of\n// FST(s). One FST represents the root (or topology) machine. The root FST\n// refers to other FSTs by recursively replacing arcs labeled as non-terminals\n// with the matching non-terminal FST. Currently the ReplaceFst uses the output\n// symbols of the arcs to determine whether the arc is a non-terminal arc or\n// not. A non-terminal can be any label that is not a non-zero terminal label in\n// the output alphabet.\n//\n// Note that the constructor uses a vector of pairs. These correspond to the\n// tuple of non-terminal Label and corresponding FST. For example to implement\n// the closure operation we need 2 FSTs. The first root FST is a single\n// self-loop arc on the start state.\n//\n// The ReplaceFst class supports an optionally caching arc iterator.\n//\n// The ReplaceFst needs to be built such that it is known to be ilabel- or\n// olabel-sorted (see usage below).\n//\n// Observe that Matcher<Fst<A>> will use the optionally caching arc iterator\n// when available (the FST is ilabel-sorted and matching on the input, or the\n// FST is olabel -orted and matching on the output).  In order to obtain the\n// most efficient behaviour, it is recommended to set call_label_type to\n// REPLACE_LABEL_INPUT or REPLACE_LABEL_BOTH and return_label_type to\n// REPLACE_LABEL_OUTPUT or REPLACE_LABEL_NEITHER. This means that the call arc\n// does not have epsilon on the input side and the return arc has epsilon on the\n// input side) and matching on the input side.\n//\n// This class attaches interface to implementation and handles reference\n// counting, delegating most methods to ImplToFst.\ntemplate <class A, class T /* = DefaultReplaceStateTable<A> */,\n          class CacheStore /* = DefaultCacheStore<A> */>\nclass ReplaceFst\n    : public ImplToFst<internal::ReplaceFstImpl<A, T, CacheStore>> {\n public:\n  using Arc = A;\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using StateTable = T;\n  using Store = CacheStore;\n  using State = typename CacheStore::State;\n  using Impl = internal::ReplaceFstImpl<Arc, StateTable, CacheStore>;\n  using CacheImpl = internal::CacheBaseImpl<State, CacheStore>;\n\n  using ImplToFst<Impl>::Properties;\n\n  friend class ArcIterator<ReplaceFst<Arc, StateTable, CacheStore>>;\n  friend class StateIterator<ReplaceFst<Arc, StateTable, CacheStore>>;\n  friend class ReplaceFstMatcher<Arc, StateTable, CacheStore>;\n\n  ReplaceFst(const std::vector<std::pair<Label, const Fst<Arc> *>> &fst_array,\n             Label root)\n      : ImplToFst<Impl>(std::make_shared<Impl>(\n            fst_array, ReplaceFstOptions<Arc, StateTable, CacheStore>(root))) {}\n\n  ReplaceFst(const std::vector<std::pair<Label, const Fst<Arc> *>> &fst_array,\n             const ReplaceFstOptions<Arc, StateTable, CacheStore> &opts)\n      : ImplToFst<Impl>(std::make_shared<Impl>(fst_array, opts)) {}\n\n  // See Fst<>::Copy() for doc.\n  ReplaceFst(const ReplaceFst<Arc, StateTable, CacheStore> &fst,\n             bool safe = false)\n      : ImplToFst<Impl>(fst, safe) {}\n\n  // Get a copy of this ReplaceFst. See Fst<>::Copy() for further doc.\n  ReplaceFst<Arc, StateTable, CacheStore> *Copy(\n      bool safe = false) const override {\n    return new ReplaceFst<Arc, StateTable, CacheStore>(*this, safe);\n  }\n\n  inline void InitStateIterator(StateIteratorData<Arc> *data) const override;\n\n  void InitArcIterator(StateId s, ArcIteratorData<Arc> *data) const override {\n    GetMutableImpl()->InitArcIterator(s, data);\n  }\n\n  MatcherBase<Arc> *InitMatcher(MatchType match_type) const override {\n    if ((GetImpl()->ArcIteratorFlags() & kArcNoCache) &&\n        ((match_type == MATCH_INPUT && Properties(kILabelSorted, false)) ||\n         (match_type == MATCH_OUTPUT && Properties(kOLabelSorted, false)))) {\n      return new ReplaceFstMatcher<Arc, StateTable, CacheStore>\n          (this, match_type);\n    } else {\n      VLOG(2) << \"Not using replace matcher\";\n      return nullptr;\n    }\n  }\n\n  bool CyclicDependencies() const { return GetImpl()->CyclicDependencies(); }\n\n  const StateTable &GetStateTable() const {\n    return *GetImpl()->GetStateTable();\n  }\n\n  const Fst<Arc> &GetFst(Label nonterminal) const {\n    return *GetImpl()->GetFst(GetImpl()->GetFstId(nonterminal));\n  }\n\n private:\n  using ImplToFst<Impl>::GetImpl;\n  using ImplToFst<Impl>::GetMutableImpl;\n\n  ReplaceFst &operator=(const ReplaceFst &) = delete;\n};\n\n// Specialization for ReplaceFst.\ntemplate <class Arc, class StateTable, class CacheStore>\nclass StateIterator<ReplaceFst<Arc, StateTable, CacheStore>>\n    : public CacheStateIterator<ReplaceFst<Arc, StateTable, CacheStore>> {\n public:\n  explicit StateIterator(const ReplaceFst<Arc, StateTable, CacheStore> &fst)\n      : CacheStateIterator<ReplaceFst<Arc, StateTable, CacheStore>>(\n            fst, fst.GetMutableImpl()) {}\n};\n\n// Specialization for ReplaceFst, implementing optional caching. It is be used\n// as follows:\n//\n//   ReplaceFst<A> replace;\n//   ArcIterator<ReplaceFst<A>> aiter(replace, s);\n//   // Note: ArcIterator< Fst<A>> is always a caching arc iterator.\n//   aiter.SetFlags(kArcNoCache, kArcNoCache);\n//   // Uses the arc iterator, no arc will be cached, no state will be expanded.\n//   // Arc flags can be used to decide which component of the arc need to be\n//   computed.\n//   aiter.SetFlags(kArcILabelValue, kArcValueFlags);\n//   // Wants the ilabel for this arc.\n//   aiter.Value();  // Does not compute the destination state.\n//   aiter.Next();\n//   aiter.SetFlags(kArcNextStateValue, kArcNextStateValue);\n//   // Wants the ilabel and next state for this arc.\n//   aiter.Value();  // Does compute the destination state and inserts it\n//                   // in the replace state table.\n//   // No additional arcs have been cached at this point.\ntemplate <class Arc, class StateTable, class CacheStore>\nclass ArcIterator<ReplaceFst<Arc, StateTable, CacheStore>> {\n public:\n  using StateId = typename Arc::StateId;\n\n  using StateTuple = typename StateTable::StateTuple;\n\n  ArcIterator(const ReplaceFst<Arc, StateTable, CacheStore> &fst, StateId s)\n      : fst_(fst),\n        s_(s),\n        pos_(0),\n        offset_(0),\n        flags_(kArcValueFlags),\n        arcs_(nullptr),\n        data_flags_(0),\n        final_flags_(0) {\n    cache_data_.ref_count = nullptr;\n    local_data_.ref_count = nullptr;\n    // If FST does not support optional caching, forces caching.\n    if (!(fst_.GetImpl()->ArcIteratorFlags() & kArcNoCache) &&\n        !(fst_.GetImpl()->HasArcs(s_))) {\n      fst_.GetMutableImpl()->Expand(s_);\n    }\n    // If state is already cached, use cached arcs array.\n    if (fst_.GetImpl()->HasArcs(s_)) {\n      (fst_.GetImpl())\n          ->internal::template CacheBaseImpl<\n              typename CacheStore::State,\n              CacheStore>::InitArcIterator(s_, &cache_data_);\n      num_arcs_ = cache_data_.narcs;\n      arcs_ = cache_data_.arcs;      // arcs_ is a pointer to the cached arcs.\n      data_flags_ = kArcValueFlags;  // All the arc member values are valid.\n    } else {  // Otherwise delay decision until Value() is called.\n      tuple_ = fst_.GetImpl()->GetStateTable()->Tuple(s_);\n      if (tuple_.fst_state == kNoStateId) {\n        num_arcs_ = 0;\n      } else {\n        // The decision to cache or not to cache has been defered until Value()\n        // or\n        // SetFlags() is called. However, the arc iterator is set up now to be\n        // ready for non-caching in order to keep the Value() method simple and\n        // efficient.\n        const auto *rfst = fst_.GetImpl()->GetFst(tuple_.fst_id);\n        rfst->InitArcIterator(tuple_.fst_state, &local_data_);\n        // arcs_ is a pointer to the arcs in the underlying machine.\n        arcs_ = local_data_.arcs;\n        // Computes the final arc (but not its destination state) if a final arc\n        // is required.\n        bool has_final_arc = fst_.GetMutableImpl()->ComputeFinalArc(\n            tuple_, &final_arc_, kArcValueFlags & ~kArcNextStateValue);\n        // Sets the arc value flags that hold for final_arc_.\n        final_flags_ = kArcValueFlags & ~kArcNextStateValue;\n        // Computes the number of arcs.\n        num_arcs_ = local_data_.narcs;\n        if (has_final_arc) ++num_arcs_;\n        // Sets the offset between the underlying arc positions and the\n        // positions\n        // in the arc iterator.\n        offset_ = num_arcs_ - local_data_.narcs;\n        // Defers the decision to cache or not until Value() or SetFlags() is\n        // called.\n        data_flags_ = 0;\n      }\n    }\n  }\n\n  ~ArcIterator() {\n    if (cache_data_.ref_count) --(*cache_data_.ref_count);\n    if (local_data_.ref_count) --(*local_data_.ref_count);\n  }\n\n  void ExpandAndCache() const  {\n    // TODO(allauzen): revisit this.\n    // fst_.GetImpl()->Expand(s_, tuple_, local_data_);\n    // (fst_.GetImpl())->CacheImpl<A>*>::InitArcIterator(s_,\n    //                                               &cache_data_);\n    //\n    fst_.InitArcIterator(s_, &cache_data_);  // Expand and cache state.\n    arcs_ = cache_data_.arcs;      // arcs_ is a pointer to the cached arcs.\n    data_flags_ = kArcValueFlags;  // All the arc member values are valid.\n    offset_ = 0;                   // No offset.\n  }\n\n  void Init() {\n    if (flags_ & kArcNoCache) {  // If caching is disabled\n      // arcs_ is a pointer to the arcs in the underlying machine.\n      arcs_ = local_data_.arcs;\n      // Sets the arcs value flags that hold for arcs_.\n      data_flags_ = kArcWeightValue;\n      if (!fst_.GetMutableImpl()->EpsilonOnCallInput()) {\n        data_flags_ |= kArcILabelValue;\n      }\n      // Sets the offset between the underlying arc positions and the positions\n      // in the arc iterator.\n      offset_ = num_arcs_ - local_data_.narcs;\n    } else {\n      ExpandAndCache();\n    }\n  }\n\n  bool Done() const { return pos_ >= num_arcs_; }\n\n  const Arc &Value() const {\n    // If data_flags_ is 0, non-caching was not requested.\n    if (!data_flags_) {\n      // TODO(allauzen): Revisit this.\n      if (flags_ & kArcNoCache) {\n        // Should never happen.\n        FSTERROR() << \"ReplaceFst: Inconsistent arc iterator flags\";\n      }\n      ExpandAndCache();\n    }\n    if (pos_ - offset_ >= 0) {  // The requested arc is not the final arc.\n      const auto &arc = arcs_[pos_ - offset_];\n      if ((data_flags_ & flags_) == (flags_ & kArcValueFlags)) {\n        // If the value flags match the recquired value flags then returns the\n        // arc.\n        return arc;\n      } else {\n        // Otherwise, compute the corresponding arc on-the-fly.\n        fst_.GetMutableImpl()->ComputeArc(tuple_, arc, &arc_,\n                                          flags_ & kArcValueFlags);\n        return arc_;\n      }\n    } else {  // The requested arc is the final arc.\n      if ((final_flags_ & flags_) != (flags_ & kArcValueFlags)) {\n        // If the arc value flags that hold for the final arc do not match the\n        // requested value flags, then\n        // final_arc_ needs to be updated.\n        fst_.GetMutableImpl()->ComputeFinalArc(tuple_, &final_arc_,\n                                               flags_ & kArcValueFlags);\n        final_flags_ = flags_ & kArcValueFlags;\n      }\n      return final_arc_;\n    }\n  }\n\n  void Next() { ++pos_; }\n\n  size_t Position() const { return pos_; }\n\n  void Reset() { pos_ = 0; }\n\n  void Seek(size_t pos) { pos_ = pos; }\n\n  uint32 Flags() const { return flags_; }\n\n  void SetFlags(uint32 flags, uint32 mask) {\n    // Updates the flags taking into account what flags are supported\n    // by the FST.\n    flags_ &= ~mask;\n    flags_ |= (flags & fst_.GetImpl()->ArcIteratorFlags());\n    // If non-caching is not requested (and caching has not already been\n    // performed), then flush data_flags_ to request caching during the next\n    // call to Value().\n    if (!(flags_ & kArcNoCache) && data_flags_ != kArcValueFlags) {\n      if (!fst_.GetImpl()->HasArcs(s_)) data_flags_ = 0;\n    }\n    // If data_flags_ has been flushed but non-caching is requested before\n    // calling Value(), then set up the iterator for non-caching.\n    if ((flags & kArcNoCache) && (!data_flags_)) Init();\n  }\n\n private:\n  const ReplaceFst<Arc, StateTable, CacheStore> &fst_;  // Reference to the FST.\n  StateId s_;                                           // State in the FST.\n  mutable StateTuple tuple_;  // Tuple corresponding to state_.\n\n  ssize_t pos_;             // Current position.\n  mutable ssize_t offset_;  // Offset between position in iterator and in arcs_.\n  ssize_t num_arcs_;        // Number of arcs at state_.\n  uint32 flags_;            // Behavorial flags for the arc iterator\n  mutable Arc arc_;         // Memory to temporarily store computed arcs.\n\n  mutable ArcIteratorData<Arc> cache_data_;  // Arc iterator data in cache.\n  mutable ArcIteratorData<Arc> local_data_;  // Arc iterator data in local FST.\n\n  mutable const Arc *arcs_;     // Array of arcs.\n  mutable uint32 data_flags_;   // Arc value flags valid for data in arcs_.\n  mutable Arc final_arc_;       // Final arc (when required).\n  mutable uint32 final_flags_;  // Arc value flags valid for final_arc_.\n\n  ArcIterator(const ArcIterator &) = delete;\n  ArcIterator &operator=(const ArcIterator &) = delete;\n};\n\ntemplate <class Arc, class StateTable, class CacheStore>\nclass ReplaceFstMatcher : public MatcherBase<Arc> {\n public:\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using FST = ReplaceFst<Arc, StateTable, CacheStore>;\n  using LocalMatcher = MultiEpsMatcher<Matcher<Fst<Arc>>>;\n\n  using StateTuple = typename StateTable::StateTuple;\n\n  // This makes a copy of the FST.\n  ReplaceFstMatcher(const ReplaceFst<Arc, StateTable, CacheStore> &fst,\n                    MatchType match_type)\n      : owned_fst_(fst.Copy()),\n        fst_(*owned_fst_),\n        impl_(fst_.GetMutableImpl()),\n        s_(fst::kNoStateId),\n        match_type_(match_type),\n        current_loop_(false),\n        final_arc_(false),\n        loop_(kNoLabel, 0, Weight::One(), kNoStateId) {\n    if (match_type_ == fst::MATCH_OUTPUT) {\n      std::swap(loop_.ilabel, loop_.olabel);\n    }\n    InitMatchers();\n  }\n\n  // This doesn't copy the FST.\n  ReplaceFstMatcher(const ReplaceFst<Arc, StateTable, CacheStore> *fst,\n                    MatchType match_type)\n      : fst_(*fst),\n        impl_(fst_.GetMutableImpl()),\n        s_(fst::kNoStateId),\n        match_type_(match_type),\n        current_loop_(false),\n        final_arc_(false),\n        loop_(kNoLabel, 0, Weight::One(), kNoStateId) {\n    if (match_type_ == fst::MATCH_OUTPUT) {\n      std::swap(loop_.ilabel, loop_.olabel);\n    }\n    InitMatchers();\n  }\n\n  // This makes a copy of the FST.\n  ReplaceFstMatcher(\n      const ReplaceFstMatcher<Arc, StateTable, CacheStore> &matcher,\n      bool safe = false)\n      : owned_fst_(matcher.fst_.Copy(safe)),\n        fst_(*owned_fst_),\n        impl_(fst_.GetMutableImpl()),\n        s_(fst::kNoStateId),\n        match_type_(matcher.match_type_),\n        current_loop_(false),\n        final_arc_(false),\n        loop_(fst::kNoLabel, 0, Weight::One(), fst::kNoStateId) {\n    if (match_type_ == fst::MATCH_OUTPUT) {\n      std::swap(loop_.ilabel, loop_.olabel);\n    }\n    InitMatchers();\n  }\n\n  // Creates a local matcher for each component FST in the RTN. LocalMatcher is\n  // a multi-epsilon wrapper matcher. MultiEpsilonMatcher is used to match each\n  // non-terminal arc, since these non-terminal\n  // turn into epsilons on recursion.\n  void InitMatchers() {\n    const auto &fst_array = impl_->fst_array_;\n    matcher_.resize(fst_array.size());\n    for (Label i = 0; i < fst_array.size(); ++i) {\n      if (fst_array[i]) {\n        matcher_[i].reset(\n            new LocalMatcher(*fst_array[i], match_type_, kMultiEpsList));\n        auto it = impl_->nonterminal_set_.begin();\n        for (; it != impl_->nonterminal_set_.end(); ++it) {\n          matcher_[i]->AddMultiEpsLabel(*it);\n        }\n      }\n    }\n  }\n\n  ReplaceFstMatcher<Arc, StateTable, CacheStore> *Copy(\n      bool safe = false) const override {\n    return new ReplaceFstMatcher<Arc, StateTable, CacheStore>(*this, safe);\n  }\n\n  MatchType Type(bool test) const override {\n    if (match_type_ == MATCH_NONE) return match_type_;\n    const auto true_prop =\n        match_type_ == MATCH_INPUT ? kILabelSorted : kOLabelSorted;\n    const auto false_prop =\n        match_type_ == MATCH_INPUT ? kNotILabelSorted : kNotOLabelSorted;\n    const auto props = fst_.Properties(true_prop | false_prop, test);\n    if (props & true_prop) {\n      return match_type_;\n    } else if (props & false_prop) {\n      return MATCH_NONE;\n    } else {\n      return MATCH_UNKNOWN;\n    }\n  }\n\n  const Fst<Arc> &GetFst() const override { return fst_; }\n\n  uint64 Properties(uint64 props) const override { return props; }\n\n  // Sets the state from which our matching happens.\n  void SetState(StateId s) final {\n    if (s_ == s) return;\n    s_ = s;\n    tuple_ = impl_->GetStateTable()->Tuple(s_);\n    if (tuple_.fst_state == kNoStateId) {\n      done_ = true;\n      return;\n    }\n    // Gets current matcher, used for non-epsilon matching.\n    current_matcher_ = matcher_[tuple_.fst_id].get();\n    current_matcher_->SetState(tuple_.fst_state);\n    loop_.nextstate = s_;\n    final_arc_ = false;\n  }\n\n  // Searches for label from previous set state. If label == 0, first\n  // hallucinate an epsilon loop; otherwise use the underlying matcher to\n  // search for the label or epsilons. Note since the ReplaceFst recursion\n  // on non-terminal arcs causes epsilon transitions to be created we use\n  // MultiEpsilonMatcher to search for possible matches of non-terminals. If the\n  // component FST\n  // reaches a final state we also need to add the exiting final arc.\n  bool Find(Label label) final {\n    bool found = false;\n    label_ = label;\n    if (label_ == 0 || label_ == kNoLabel) {\n      // Computes loop directly, avoiding Replace::ComputeArc.\n      if (label_ == 0) {\n        current_loop_ = true;\n        found = true;\n      }\n      // Searches for matching multi-epsilons.\n      final_arc_ = impl_->ComputeFinalArc(tuple_, nullptr);\n      found = current_matcher_->Find(kNoLabel) || final_arc_ || found;\n    } else {\n      // Searches on a sub machine directly using sub machine matcher.\n      found = current_matcher_->Find(label_);\n    }\n    return found;\n  }\n\n  bool Done() const final {\n    return !current_loop_ && !final_arc_ && current_matcher_->Done();\n  }\n\n  const Arc &Value() const final {\n    if (current_loop_) return loop_;\n    if (final_arc_) {\n      impl_->ComputeFinalArc(tuple_, &arc_);\n      return arc_;\n    }\n    const auto &component_arc = current_matcher_->Value();\n    impl_->ComputeArc(tuple_, component_arc, &arc_);\n    return arc_;\n  }\n\n  void Next() final {\n    if (current_loop_) {\n      current_loop_ = false;\n      return;\n    }\n    if (final_arc_) {\n      final_arc_ = false;\n      return;\n    }\n    current_matcher_->Next();\n  }\n\n  ssize_t Priority(StateId s) final { return fst_.NumArcs(s); }\n\n private:\n  std::unique_ptr<const ReplaceFst<Arc, StateTable, CacheStore>> owned_fst_;\n  const ReplaceFst<Arc, StateTable, CacheStore> &fst_;\n  internal::ReplaceFstImpl<Arc, StateTable, CacheStore> *impl_;\n  LocalMatcher *current_matcher_;\n  std::vector<std::unique_ptr<LocalMatcher>> matcher_;\n  StateId s_;             // Current state.\n  Label label_;           // Current label.\n  MatchType match_type_;  // Supplied by caller.\n  mutable bool done_;\n  mutable bool current_loop_;  // Current arc is the implicit loop.\n  mutable bool final_arc_;     // Current arc for exiting recursion.\n  mutable StateTuple tuple_;   // Tuple corresponding to state_.\n  mutable Arc arc_;\n  Arc loop_;\n\n  ReplaceFstMatcher &operator=(const ReplaceFstMatcher &) = delete;\n};\n\ntemplate <class Arc, class StateTable, class CacheStore>\ninline void ReplaceFst<Arc, StateTable, CacheStore>::InitStateIterator(\n    StateIteratorData<Arc> *data) const {\n  data->base =\n      new StateIterator<ReplaceFst<Arc, StateTable, CacheStore>>(*this);\n}\n\nusing StdReplaceFst = ReplaceFst<StdArc>;\n\n// Recursively replaces arcs in the root FSTs with other FSTs.\n// This version writes the result of replacement to an output MutableFst.\n//\n// Replace supports replacement of arcs in one Fst with another FST. This\n// replacement is recursive. Replace takes an array of FST(s). One FST\n// represents the root (or topology) machine. The root FST refers to other FSTs\n// by recursively replacing arcs labeled as non-terminals with the matching\n// non-terminal FST. Currently Replace uses the output symbols of the arcs to\n// determine whether the arc is a non-terminal arc or not. A non-terminal can be\n// any label that is not a non-zero terminal label in the output alphabet.\n//\n// Note that input argument is a vector of pairs. These correspond to the tuple\n// of non-terminal Label and corresponding FST.\ntemplate <class Arc>\nvoid Replace(const std::vector<std::pair<typename Arc::Label, const Fst<Arc> *>>\n                 &ifst_array,\n             MutableFst<Arc> *ofst,\n             ReplaceFstOptions<Arc> opts = ReplaceFstOptions<Arc>()) {\n  opts.gc = true;\n  opts.gc_limit = 0;  // Caches only the last state for fastest copy.\n  *ofst = ReplaceFst<Arc>(ifst_array, opts);\n}\n\ntemplate <class Arc>\nvoid Replace(const std::vector<std::pair<typename Arc::Label, const Fst<Arc> *>>\n                 &ifst_array,\n             MutableFst<Arc> *ofst, const ReplaceUtilOptions &opts) {\n  Replace(ifst_array, ofst, ReplaceFstOptions<Arc>(opts));\n}\n\n// For backwards compatibility.\ntemplate <class Arc>\nvoid Replace(const std::vector<std::pair<typename Arc::Label, const Fst<Arc> *>>\n                 &ifst_array,\n             MutableFst<Arc> *ofst, typename Arc::Label root,\n             bool epsilon_on_replace) {\n  Replace(ifst_array, ofst, ReplaceFstOptions<Arc>(root, epsilon_on_replace));\n}\n\ntemplate <class Arc>\nvoid Replace(const std::vector<std::pair<typename Arc::Label, const Fst<Arc> *>>\n                 &ifst_array,\n             MutableFst<Arc> *ofst, typename Arc::Label root) {\n  Replace(ifst_array, ofst, ReplaceFstOptions<Arc>(root));\n}\n\n}  // namespace fst\n\n#endif  // FST_REPLACE_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/reverse.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Functions and classes to sort arcs in an FST.\n\n#ifndef FST_REVERSE_H_\n#define FST_REVERSE_H_\n\n#include <algorithm>\n#include <vector>\n\n#include <fst/cache.h>\n\n\nnamespace fst {\n\n// Reverses an FST. The reversed result is written to an output mutable FST.\n// If A transduces string x to y with weight a, then the reverse of A\n// transduces the reverse of x to the reverse of y with weight a.Reverse().\n//\n// Typically, a = a.Reverse() and an arc is its own reverse (e.g., for\n// TropicalWeight or LogWeight). In general, e.g., when the weights only form a\n// left or right semiring, the output arc type must match the input arc type\n// except having the reversed Weight type.\n//\n// When require_superinitial is false, a superinitial state is not created in\n// the reversed FST iff the input FST has exactly one final state (which becomes\n// the initial state of the reversed FST) with a final weight of semiring One,\n// or if it does not belong to any cycle. When require_superinitial is true, a\n// superinitial state is always created.\ntemplate <class FromArc, class ToArc>\nvoid Reverse(const Fst<FromArc> &ifst, MutableFst<ToArc> *ofst,\n             bool require_superinitial = true) {\n  using StateId = typename FromArc::StateId;\n  using FromWeight = typename FromArc::Weight;\n  using ToWeight = typename ToArc::Weight;\n  ofst->DeleteStates();\n  ofst->SetInputSymbols(ifst.InputSymbols());\n  ofst->SetOutputSymbols(ifst.OutputSymbols());\n  if (ifst.Properties(kExpanded, false)) {\n    ofst->ReserveStates(CountStates(ifst) + 1);\n  }\n  StateId istart = ifst.Start();\n  StateId ostart = kNoStateId;\n  StateId offset = 0;\n  uint64 dfs_iprops = 0;\n  uint64 dfs_oprops = 0;\n  if (!require_superinitial) {\n    for (StateIterator<Fst<FromArc>> siter(ifst); !siter.Done(); siter.Next()) {\n      const auto s = siter.Value();\n      if (ifst.Final(s) == FromWeight::Zero()) continue;\n      if (ostart != kNoStateId) {\n        ostart = kNoStateId;\n        break;\n      } else {\n        ostart = s;\n      }\n    }\n    if (ostart != kNoStateId && ifst.Final(ostart) != FromWeight::One()) {\n      std::vector<StateId> scc;\n      SccVisitor<FromArc> scc_visitor(&scc, nullptr, nullptr, &dfs_iprops);\n      DfsVisit(ifst, &scc_visitor);\n      if (count(scc.begin(), scc.end(), scc[ostart]) > 1) {\n        ostart = kNoStateId;\n      } else {\n        for (ArcIterator<Fst<FromArc>> aiter(ifst, ostart); !aiter.Done();\n             aiter.Next()) {\n          if (aiter.Value().nextstate == ostart) {\n            ostart = kNoStateId;\n            break;\n          }\n        }\n      }\n      if (ostart != kNoStateId) dfs_oprops = kInitialAcyclic;\n    }\n  }\n  if (ostart == kNoStateId) {  // Super-initial requested or needed.\n    ostart = ofst->AddState();\n    offset = 1;\n  }\n  for (StateIterator<Fst<FromArc>> siter(ifst); !siter.Done(); siter.Next()) {\n    const auto is = siter.Value();\n    const auto os = is + offset;\n    while (ofst->NumStates() <= os) ofst->AddState();\n    if (is == istart) ofst->SetFinal(os, ToWeight::One());\n    const auto weight = ifst.Final(is);\n    if ((weight != FromWeight::Zero()) && (offset == 1)) {\n      const ToArc oarc(0, 0, weight.Reverse(), os);\n      ofst->AddArc(0, oarc);\n    }\n    for (ArcIterator<Fst<FromArc>> aiter(ifst, is); !aiter.Done();\n         aiter.Next()) {\n      const auto &iarc = aiter.Value();\n      const auto nos = iarc.nextstate + offset;\n      auto weight = iarc.weight.Reverse();\n      if (!offset && (nos == ostart)) {\n        weight = Times(ifst.Final(ostart).Reverse(), weight);\n      }\n      const ToArc oarc(iarc.ilabel, iarc.olabel, weight, os);\n      while (ofst->NumStates() <= nos) ofst->AddState();\n      ofst->AddArc(nos, oarc);\n    }\n  }\n  ofst->SetStart(ostart);\n  if (offset == 0 && ostart == istart) {\n    ofst->SetFinal(ostart, ifst.Final(ostart).Reverse());\n  }\n  const auto iprops = ifst.Properties(kCopyProperties, false) | dfs_iprops;\n  const auto oprops = ofst->Properties(kFstProperties, false) | dfs_oprops;\n  ofst->SetProperties(ReverseProperties(iprops, offset == 1) | oprops,\n                      kFstProperties);\n}\n\n}  // namespace fst\n\n#endif  // FST_REVERSE_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/reweight.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Function to reweight an FST.\n\n#ifndef FST_REWEIGHT_H_\n#define FST_REWEIGHT_H_\n\n#include <vector>\n#include <fst/log.h>\n\n#include <fst/mutable-fst.h>\n\n\nnamespace fst {\n\nenum ReweightType { REWEIGHT_TO_INITIAL, REWEIGHT_TO_FINAL };\n\n// Reweights an FST according to a vector of potentials in a given direction.\n// The weight must be left distributive when reweighting towards the initial\n// state and right distributive when reweighting towards the final states.\n//\n// An arc of weight w, with an origin state of potential p and destination state\n// of potential q, is reweighted by p^-1 \\otimes (w \\otimes q) when reweighting\n// torwards the initial state, and by (p \\otimes w) \\otimes q^-1 when\n// reweighting towards the final states.\ntemplate <class Arc>\nvoid Reweight(MutableFst<Arc> *fst,\n              const std::vector<typename Arc::Weight> &potential,\n              ReweightType type) {\n  using Weight = typename Arc::Weight;\n  if (fst->NumStates() == 0) return;\n  // TODO(kbg): Make this a compile-time static_assert once we have a pleasant\n  // way to \"deregister\" this operation for non-distributive semirings so an\n  // informative error message is produced.\n  if (type == REWEIGHT_TO_FINAL && !(Weight::Properties() & kRightSemiring)) {\n    FSTERROR() << \"Reweight: Reweighting to the final states requires \"\n               << \"Weight to be right distributive: \" << Weight::Type();\n    fst->SetProperties(kError, kError);\n    return;\n  }\n  // TODO(kbg): Make this a compile-time static_assert once we have a pleasant\n  // way to \"deregister\" this operation for non-distributive semirings so an\n  // informative error message is produced.\n  if (type == REWEIGHT_TO_INITIAL && !(Weight::Properties() & kLeftSemiring)) {\n    FSTERROR() << \"Reweight: Reweighting to the initial state requires \"\n               << \"Weight to be left distributive: \" << Weight::Type();\n    fst->SetProperties(kError, kError);\n    return;\n  }\n  StateIterator<MutableFst<Arc>> siter(*fst);\n  for (; !siter.Done(); siter.Next()) {\n    const auto s = siter.Value();\n    if (s == potential.size()) break;\n    const auto &weight = potential[s];\n    if (weight != Weight::Zero()) {\n      for (MutableArcIterator<MutableFst<Arc>> aiter(fst, s); !aiter.Done();\n           aiter.Next()) {\n        auto arc = aiter.Value();\n        if (arc.nextstate >= potential.size()) continue;\n        const auto &nextweight = potential[arc.nextstate];\n        if (nextweight == Weight::Zero()) continue;\n        if (type == REWEIGHT_TO_INITIAL) {\n          arc.weight =\n              Divide(Times(arc.weight, nextweight), weight, DIVIDE_LEFT);\n        }\n        if (type == REWEIGHT_TO_FINAL) {\n          arc.weight =\n              Divide(Times(weight, arc.weight), nextweight, DIVIDE_RIGHT);\n        }\n        aiter.SetValue(arc);\n      }\n      if (type == REWEIGHT_TO_INITIAL) {\n        fst->SetFinal(s, Divide(fst->Final(s), weight, DIVIDE_LEFT));\n      }\n    }\n    if (type == REWEIGHT_TO_FINAL) {\n      fst->SetFinal(s, Times(weight, fst->Final(s)));\n    }\n  }\n  // This handles elements past the end of the potentials array.\n  for (; !siter.Done(); siter.Next()) {\n    const auto s = siter.Value();\n    if (type == REWEIGHT_TO_FINAL) {\n      fst->SetFinal(s, Times(Weight::Zero(), fst->Final(s)));\n    }\n  }\n  const auto startweight = fst->Start() < potential.size()\n                               ? potential[fst->Start()]\n                               : Weight::Zero();\n  if ((startweight != Weight::One()) && (startweight != Weight::Zero())) {\n    if (fst->Properties(kInitialAcyclic, true) & kInitialAcyclic) {\n      const auto s = fst->Start();\n      for (MutableArcIterator<MutableFst<Arc>> aiter(fst, s); !aiter.Done();\n           aiter.Next()) {\n        auto arc = aiter.Value();\n        if (type == REWEIGHT_TO_INITIAL) {\n          arc.weight = Times(startweight, arc.weight);\n        } else {\n          arc.weight = Times(Divide(Weight::One(), startweight, DIVIDE_RIGHT),\n                             arc.weight);\n        }\n        aiter.SetValue(arc);\n      }\n      if (type == REWEIGHT_TO_INITIAL) {\n        fst->SetFinal(s, Times(startweight, fst->Final(s)));\n      } else {\n        fst->SetFinal(s, Times(Divide(Weight::One(), startweight, DIVIDE_RIGHT),\n                               fst->Final(s)));\n      }\n    } else {\n      const auto s = fst->AddState();\n      const auto weight =\n          (type == REWEIGHT_TO_INITIAL)\n              ? startweight\n              : Divide(Weight::One(), startweight, DIVIDE_RIGHT);\n      fst->AddArc(s, Arc(0, 0, weight, fst->Start()));\n      fst->SetStart(s);\n    }\n  }\n  fst->SetProperties(ReweightProperties(fst->Properties(kFstProperties, false)),\n                     kFstProperties);\n}\n\n}  // namespace fst\n\n#endif  // FST_REWEIGHT_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/rmepsilon.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Functions and classes that implemement epsilon-removal.\n\n#ifndef FST_RMEPSILON_H_\n#define FST_RMEPSILON_H_\n\n#include <forward_list>\n#include <stack>\n#include <string>\n#include <unordered_map>\n#include <utility>\n#include <vector>\n\n#include <fst/log.h>\n\n#include <fst/arcfilter.h>\n#include <fst/cache.h>\n#include <fst/connect.h>\n#include <fst/factor-weight.h>\n#include <fst/invert.h>\n#include <fst/prune.h>\n#include <fst/queue.h>\n#include <fst/shortest-distance.h>\n#include <fst/topsort.h>\n\n\nnamespace fst {\n\ntemplate <class Arc, class Queue>\nclass RmEpsilonOptions\n    : public ShortestDistanceOptions<Arc, Queue, EpsilonArcFilter<Arc>> {\n public:\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  bool connect;             // Connect output\n  Weight weight_threshold;  // Pruning weight threshold.\n  StateId state_threshold;  // Pruning state threshold.\n\n  explicit RmEpsilonOptions(Queue *queue, float delta = kShortestDelta,\n                            bool connect = true,\n                            Weight weight_threshold = Weight::Zero(),\n                            StateId state_threshold = kNoStateId)\n      : ShortestDistanceOptions<Arc, Queue, EpsilonArcFilter<Arc>>(\n            queue, EpsilonArcFilter<Arc>(), kNoStateId, delta),\n        connect(connect),\n        weight_threshold(std::move(weight_threshold)),\n        state_threshold(state_threshold) {}\n};\n\nnamespace internal {\n\n// Computation state of the epsilon-removal algorithm.\ntemplate <class Arc, class Queue>\nclass RmEpsilonState {\n public:\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  RmEpsilonState(const Fst<Arc> &fst, std::vector<Weight> *distance,\n                 const RmEpsilonOptions<Arc, Queue> &opts)\n      : fst_(fst),\n        distance_(distance),\n        sd_state_(fst_, distance, opts, true),\n        expand_id_(0) {}\n\n  void Expand(StateId s);\n\n  std::vector<Arc> &Arcs() { return arcs_; }\n\n  const Weight &Final() const { return final_; }\n\n  bool Error() const { return sd_state_.Error(); }\n\n private:\n  struct Element {\n    Label ilabel;\n    Label olabel;\n    StateId nextstate;\n\n    Element() {}\n\n    Element(Label ilabel, Label olabel, StateId nexstate)\n        : ilabel(ilabel), olabel(olabel), nextstate(nexstate) {}\n  };\n\n  struct ElementHash {\n   public:\n    size_t operator()(const Element &element) const {\n      static constexpr size_t prime0 = 7853;\n      static constexpr size_t prime1 = 7867;\n      return static_cast<size_t>(element.nextstate) +\n             static_cast<size_t>(element.ilabel) * prime0 +\n             static_cast<size_t>(element.olabel) * prime1;\n    }\n  };\n\n  class ElementEqual {\n   public:\n    bool operator()(const Element &e1, const Element &e2) const {\n      return (e1.ilabel == e2.ilabel) && (e1.olabel == e2.olabel) &&\n             (e1.nextstate == e2.nextstate);\n    }\n  };\n\n  using ElementMap = std::unordered_map<Element, std::pair<StateId, size_t>,\n                                        ElementHash, ElementEqual>;\n\n  const Fst<Arc> &fst_;\n  // Distance from state being expanded in epsilon-closure.\n  std::vector<Weight> *distance_;\n  // Shortest distance algorithm computation state.\n  internal::ShortestDistanceState<Arc, Queue, EpsilonArcFilter<Arc>> sd_state_;\n  // Maps an element to a pair corresponding to a position in the arcs vector\n  // of the state being expanded. The element corresopnds to the position in\n  // the arcs_ vector if p.first is equal to the state being expanded.\n  ElementMap element_map_;\n  EpsilonArcFilter<Arc> eps_filter_;\n  std::stack<StateId> eps_queue_;  // Queue used to visit the epsilon-closure.\n  std::vector<bool> visited_;      // True if the state has been visited.\n  std::forward_list<StateId> visited_states_;  // List of visited states.\n  std::vector<Arc> arcs_;                      // Arcs of state being expanded.\n  Weight final_;       // Final weight of state being expanded.\n  StateId expand_id_;  // Unique ID for each call to Expand\n\n  RmEpsilonState(const RmEpsilonState &) = delete;\n  RmEpsilonState &operator=(const RmEpsilonState &) = delete;\n};\n\ntemplate <class Arc, class Queue>\nvoid RmEpsilonState<Arc, Queue>::Expand(typename Arc::StateId source) {\n  final_ = Weight::Zero();\n  arcs_.clear();\n  sd_state_.ShortestDistance(source);\n  if (sd_state_.Error()) return;\n  eps_queue_.push(source);\n  while (!eps_queue_.empty()) {\n    const auto state = eps_queue_.top();\n    eps_queue_.pop();\n    while (visited_.size() <= state) visited_.push_back(false);\n    if (visited_[state]) continue;\n    visited_[state] = true;\n    visited_states_.push_front(state);\n    for (ArcIterator<Fst<Arc>> aiter(fst_, state); !aiter.Done();\n         aiter.Next()) {\n      auto arc = aiter.Value();\n      arc.weight = Times((*distance_)[state], arc.weight);\n      if (eps_filter_(arc)) {\n        while (visited_.size() <= arc.nextstate) visited_.push_back(false);\n        if (!visited_[arc.nextstate]) eps_queue_.push(arc.nextstate);\n      } else {\n        const Element element(arc.ilabel, arc.olabel, arc.nextstate);\n        auto insert_result = element_map_.insert(\n            std::make_pair(element, std::make_pair(expand_id_, arcs_.size())));\n        if (insert_result.second) {\n          arcs_.push_back(arc);\n        } else {\n          if (insert_result.first->second.first == expand_id_) {\n            auto &weight = arcs_[insert_result.first->second.second].weight;\n            weight = Plus(weight, arc.weight);\n          } else {\n            insert_result.first->second.first = expand_id_;\n            insert_result.first->second.second = arcs_.size();\n            arcs_.push_back(arc);\n          }\n        }\n      }\n    }\n    final_ = Plus(final_, Times((*distance_)[state], fst_.Final(state)));\n  }\n  while (!visited_states_.empty()) {\n    visited_[visited_states_.front()] = false;\n    visited_states_.pop_front();\n  }\n  ++expand_id_;\n}\n\n}  // namespace internal\n\n// Removes epsilon-transitions (when both the input and output label are an\n// epsilon) from a transducer. The result will be an equivalent FST that has no\n// such epsilon transitions. This version modifies its input. It allows fine\n// control via the options argument; see below for a simpler interface.\n//\n// The distance vector will be used to hold the shortest distances during the\n// epsilon-closure computation. The state queue discipline and convergence delta\n// are taken in the options argument.\ntemplate <class Arc, class Queue>\nvoid RmEpsilon(MutableFst<Arc> *fst,\n               std::vector<typename Arc::Weight> *distance,\n               const RmEpsilonOptions<Arc, Queue> &opts) {\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n  if (fst->Start() == kNoStateId) return;\n  // noneps_in[s] will be set to true iff s admits a non-epsilon incoming\n  // transition or is the start state.\n  std::vector<bool> noneps_in(fst->NumStates(), false);\n  noneps_in[fst->Start()] = true;\n  for (size_t i = 0; i < fst->NumStates(); ++i) {\n    for (ArcIterator<Fst<Arc>> aiter(*fst, i); !aiter.Done(); aiter.Next()) {\n      const auto &arc = aiter.Value();\n      if (arc.ilabel != 0 || arc.olabel != 0) {\n        noneps_in[arc.nextstate] = true;\n      }\n    }\n  }\n  // States sorted in topological order when (acyclic) or generic topological\n  // order (cyclic).\n  std::vector<StateId> states;\n  states.reserve(fst->NumStates());\n  if (fst->Properties(kTopSorted, false) & kTopSorted) {\n    for (size_t i = 0; i < fst->NumStates(); i++) states.push_back(i);\n  } else if (fst->Properties(kAcyclic, false) & kAcyclic) {\n    std::vector<StateId> order;\n    bool acyclic;\n    TopOrderVisitor<Arc> top_order_visitor(&order, &acyclic);\n    DfsVisit(*fst, &top_order_visitor, EpsilonArcFilter<Arc>());\n    // Sanity check: should be acyclic if property bit is set.\n    if (!acyclic) {\n      FSTERROR() << \"RmEpsilon: Inconsistent acyclic property bit\";\n      fst->SetProperties(kError, kError);\n      return;\n    }\n    states.resize(order.size());\n    for (StateId i = 0; i < order.size(); i++) states[order[i]] = i;\n  } else {\n    uint64 props;\n    std::vector<StateId> scc;\n    SccVisitor<Arc> scc_visitor(&scc, nullptr, nullptr, &props);\n    DfsVisit(*fst, &scc_visitor, EpsilonArcFilter<Arc>());\n    std::vector<StateId> first(scc.size(), kNoStateId);\n    std::vector<StateId> next(scc.size(), kNoStateId);\n    for (StateId i = 0; i < scc.size(); i++) {\n      if (first[scc[i]] != kNoStateId) next[i] = first[scc[i]];\n      first[scc[i]] = i;\n    }\n    for (StateId i = 0; i < first.size(); i++) {\n      for (auto j = first[i]; j != kNoStateId; j = next[j]) {\n        states.push_back(j);\n      }\n    }\n  }\n  internal::RmEpsilonState<Arc, Queue> rmeps_state(*fst, distance, opts);\n  while (!states.empty()) {\n    const auto state = states.back();\n    states.pop_back();\n    if (!noneps_in[state] &&\n        (opts.connect || opts.weight_threshold != Weight::Zero() ||\n         opts.state_threshold != kNoStateId)) {\n      continue;\n    }\n    rmeps_state.Expand(state);\n    fst->SetFinal(state, rmeps_state.Final());\n    fst->DeleteArcs(state);\n    auto &arcs = rmeps_state.Arcs();\n    fst->ReserveArcs(state, arcs.size());\n    while (!arcs.empty()) {\n      fst->AddArc(state, arcs.back());\n      arcs.pop_back();\n    }\n  }\n  if (opts.connect || opts.weight_threshold != Weight::Zero() ||\n      opts.state_threshold != kNoStateId) {\n    for (size_t s = 0; s < fst->NumStates(); ++s) {\n      if (!noneps_in[s]) fst->DeleteArcs(s);\n    }\n  }\n  if (rmeps_state.Error()) fst->SetProperties(kError, kError);\n  fst->SetProperties(\n      RmEpsilonProperties(fst->Properties(kFstProperties, false)),\n      kFstProperties);\n  if (opts.weight_threshold != Weight::Zero() ||\n      opts.state_threshold != kNoStateId) {\n    Prune(fst, opts.weight_threshold, opts.state_threshold);\n  }\n  if (opts.connect && opts.weight_threshold == Weight::Zero() &&\n      opts.state_threshold == kNoStateId) {\n    Connect(fst);\n  }\n}\n\n// Removes epsilon-transitions (when both the input and output label\n// are an epsilon) from a transducer. The result will be an equivalent\n// FST that has no such epsilon transitions. This version modifies its\n// input. It has a simplified interface; see above for a version that\n// allows finer control.\n//\n// Complexity:\n//\n// - Time:\n//\n//   Unweighted: O(v^2 + ve).\n//   Acyclic: O(v^2 + V e).\n//   Tropical semiring: O(v^2 log V + ve).\n//   General: exponential.\n//\n// - Space: O(vE)\n//\n// where v is the number of states visited and e is the number of arcs visited.\n//\n// For more information, see:\n//\n// Mohri, M. 2002. Generic epsilon-removal and input epsilon-normalization\n// algorithms for weighted transducers. International Journal of Computer\n// Science 13(1): 129-143.\ntemplate <class Arc>\nvoid RmEpsilon(MutableFst<Arc> *fst, bool connect = true,\n               typename Arc::Weight weight_threshold = Arc::Weight::Zero(),\n               typename Arc::StateId state_threshold = kNoStateId,\n               float delta = kShortestDelta) {\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n  std::vector<Weight> distance;\n  AutoQueue<StateId> state_queue(*fst, &distance, EpsilonArcFilter<Arc>());\n  RmEpsilonOptions<Arc, AutoQueue<StateId>> opts(\n      &state_queue, delta, connect, weight_threshold, state_threshold);\n  RmEpsilon(fst, &distance, opts);\n}\n\nstruct RmEpsilonFstOptions : CacheOptions {\n  float delta;\n\n  explicit RmEpsilonFstOptions(const CacheOptions &opts,\n                               float delta = kShortestDelta)\n      : CacheOptions(opts), delta(delta) {}\n\n  explicit RmEpsilonFstOptions(float delta = kShortestDelta) : delta(delta) {}\n};\n\nnamespace internal {\n\n// Implementation of delayed RmEpsilonFst.\ntemplate <class Arc>\nclass RmEpsilonFstImpl : public CacheImpl<Arc> {\n public:\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using Store = DefaultCacheStore<Arc>;\n  using State = typename Store::State;\n\n  using FstImpl<Arc>::Properties;\n  using FstImpl<Arc>::SetType;\n  using FstImpl<Arc>::SetProperties;\n  using FstImpl<Arc>::SetInputSymbols;\n  using FstImpl<Arc>::SetOutputSymbols;\n\n  using CacheBaseImpl<CacheState<Arc>>::HasArcs;\n  using CacheBaseImpl<CacheState<Arc>>::HasFinal;\n  using CacheBaseImpl<CacheState<Arc>>::HasStart;\n  using CacheBaseImpl<CacheState<Arc>>::PushArc;\n  using CacheBaseImpl<CacheState<Arc>>::SetArcs;\n  using CacheBaseImpl<CacheState<Arc>>::SetFinal;\n  using CacheBaseImpl<CacheState<Arc>>::SetStart;\n\n  RmEpsilonFstImpl(const Fst<Arc> &fst, const RmEpsilonFstOptions &opts)\n      : CacheImpl<Arc>(opts),\n        fst_(fst.Copy()),\n        delta_(opts.delta),\n        rmeps_state_(\n            *fst_, &distance_,\n            RmEpsilonOptions<Arc, FifoQueue<StateId>>(&queue_, delta_, false)) {\n    SetType(\"rmepsilon\");\n    SetProperties(\n        RmEpsilonProperties(fst.Properties(kFstProperties, false), true),\n        kCopyProperties);\n    SetInputSymbols(fst.InputSymbols());\n    SetOutputSymbols(fst.OutputSymbols());\n  }\n\n  RmEpsilonFstImpl(const RmEpsilonFstImpl &impl)\n      : CacheImpl<Arc>(impl),\n        fst_(impl.fst_->Copy(true)),\n        delta_(impl.delta_),\n        rmeps_state_(\n            *fst_, &distance_,\n            RmEpsilonOptions<Arc, FifoQueue<StateId>>(&queue_, delta_, false)) {\n    SetType(\"rmepsilon\");\n    SetProperties(impl.Properties(), kCopyProperties);\n    SetInputSymbols(impl.InputSymbols());\n    SetOutputSymbols(impl.OutputSymbols());\n  }\n\n  StateId Start() {\n    if (!HasStart()) SetStart(fst_->Start());\n    return CacheImpl<Arc>::Start();\n  }\n\n  Weight Final(StateId s) {\n    if (!HasFinal(s)) Expand(s);\n    return CacheImpl<Arc>::Final(s);\n  }\n\n  size_t NumArcs(StateId s) {\n    if (!HasArcs(s)) Expand(s);\n    return CacheImpl<Arc>::NumArcs(s);\n  }\n\n  size_t NumInputEpsilons(StateId s) {\n    if (!HasArcs(s)) Expand(s);\n    return CacheImpl<Arc>::NumInputEpsilons(s);\n  }\n\n  size_t NumOutputEpsilons(StateId s) {\n    if (!HasArcs(s)) Expand(s);\n    return CacheImpl<Arc>::NumOutputEpsilons(s);\n  }\n\n  uint64 Properties() const override { return Properties(kFstProperties); }\n\n  // Sets error if found and returns other FST impl properties.\n  uint64 Properties(uint64 mask) const override {\n    if ((mask & kError) &&\n        (fst_->Properties(kError, false) || rmeps_state_.Error())) {\n      SetProperties(kError, kError);\n    }\n    return FstImpl<Arc>::Properties(mask);\n  }\n\n  void InitArcIterator(StateId s, ArcIteratorData<Arc> *data) {\n    if (!HasArcs(s)) Expand(s);\n    CacheImpl<Arc>::InitArcIterator(s, data);\n  }\n\n  void Expand(StateId s) {\n    rmeps_state_.Expand(s);\n    SetFinal(s, rmeps_state_.Final());\n    auto &arcs = rmeps_state_.Arcs();\n    while (!arcs.empty()) {\n      PushArc(s, arcs.back());\n      arcs.pop_back();\n    }\n    SetArcs(s);\n  }\n\n private:\n  std::unique_ptr<const Fst<Arc>> fst_;\n  float delta_;\n  std::vector<Weight> distance_;\n  FifoQueue<StateId> queue_;\n  internal::RmEpsilonState<Arc, FifoQueue<StateId>> rmeps_state_;\n};\n\n}  // namespace internal\n\n// Removes epsilon-transitions (when both the input and output label are an\n// epsilon) from a transducer. The result will be an equivalent FST that has no\n// such epsilon transitions. This version is a\n// delayed FST.\n//\n// Complexity:\n//\n// - Time:\n//   Unweighted: O(v^2 + ve).\n//   General: exponential.\n//\n// - Space: O(vE)\n//\n// where v is the number of states visited and e is the number of arcs visited.\n// Constant time to visit an input state or arc is assumed and exclusive of\n// caching.\n//\n// For more information, see:\n//\n// Mohri, M. 2002. Generic epsilon-removal and input epsilon-normalization\n// algorithms for weighted transducers. International Journal of Computer\n// Science 13(1): 129-143.\n//\n// This class attaches interface to implementation and handles\n// reference counting, delegating most methods to ImplToFst.\ntemplate <class A>\nclass RmEpsilonFst : public ImplToFst<internal::RmEpsilonFstImpl<A>> {\n public:\n  using Arc = A;\n  using StateId = typename Arc::StateId;\n\n  using Store = DefaultCacheStore<Arc>;\n  using State = typename Store::State;\n  using Impl = internal::RmEpsilonFstImpl<Arc>;\n\n  friend class ArcIterator<RmEpsilonFst<Arc>>;\n  friend class StateIterator<RmEpsilonFst<Arc>>;\n\n  explicit RmEpsilonFst(const Fst<Arc> &fst)\n      : ImplToFst<Impl>(std::make_shared<Impl>(fst, RmEpsilonFstOptions())) {}\n\n  RmEpsilonFst(const Fst<A> &fst, const RmEpsilonFstOptions &opts)\n      : ImplToFst<Impl>(std::make_shared<Impl>(fst, opts)) {}\n\n  // See Fst<>::Copy() for doc.\n  RmEpsilonFst(const RmEpsilonFst<Arc> &fst, bool safe = false)\n      : ImplToFst<Impl>(fst, safe) {}\n\n  // Get a copy of this RmEpsilonFst. See Fst<>::Copy() for further doc.\n  RmEpsilonFst<Arc> *Copy(bool safe = false) const override {\n    return new RmEpsilonFst<Arc>(*this, safe);\n  }\n\n  inline void InitStateIterator(StateIteratorData<Arc> *data) const override;\n\n  void InitArcIterator(StateId s, ArcIteratorData<Arc> *data) const override {\n    GetMutableImpl()->InitArcIterator(s, data);\n  }\n\n private:\n  using ImplToFst<Impl>::GetImpl;\n  using ImplToFst<Impl>::GetMutableImpl;\n\n  RmEpsilonFst &operator=(const RmEpsilonFst &) = delete;\n};\n\n// Specialization for RmEpsilonFst.\ntemplate <class Arc>\nclass StateIterator<RmEpsilonFst<Arc>>\n    : public CacheStateIterator<RmEpsilonFst<Arc>> {\n public:\n  explicit StateIterator(const RmEpsilonFst<Arc> &fst)\n      : CacheStateIterator<RmEpsilonFst<Arc>>(fst, fst.GetMutableImpl()) {}\n};\n\n// Specialization for RmEpsilonFst.\ntemplate <class Arc>\nclass ArcIterator<RmEpsilonFst<Arc>>\n    : public CacheArcIterator<RmEpsilonFst<Arc>> {\n public:\n  using StateId = typename Arc::StateId;\n\n  ArcIterator(const RmEpsilonFst<Arc> &fst, StateId s)\n      : CacheArcIterator<RmEpsilonFst<Arc>>(fst.GetMutableImpl(), s) {\n    if (!fst.GetImpl()->HasArcs(s)) fst.GetMutableImpl()->Expand(s);\n  }\n};\n\ntemplate <class Arc>\ninline void RmEpsilonFst<Arc>::InitStateIterator(\n    StateIteratorData<Arc> *data) const {\n  data->base = new StateIterator<RmEpsilonFst<Arc>>(*this);\n}\n\n// Useful alias when using StdArc.\nusing StdRmEpsilonFst = RmEpsilonFst<StdArc>;\n\n}  // namespace fst\n\n#endif  // FST_RMEPSILON_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/rmfinalepsilon.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Function to remove of final states that have epsilon-only input arcs.\n\n#ifndef FST_RMFINALEPSILON_H_\n#define FST_RMFINALEPSILON_H_\n\n#include <unordered_set>\n#include <vector>\n\n#include <fst/connect.h>\n#include <fst/mutable-fst.h>\n\n\nnamespace fst {\n\n// Removes final states that have epsilon-only input arcs.\ntemplate <class Arc>\nvoid RmFinalEpsilon(MutableFst<Arc> *fst) {\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n  // Determines the coaccesibility of states.\n  std::vector<bool> access;\n  std::vector<bool> coaccess;\n  uint64 props = 0;\n  SccVisitor<Arc> scc_visitor(nullptr, &access, &coaccess, &props);\n  DfsVisit(*fst, &scc_visitor);\n  // Finds potential list of removable final states. These are final states that\n  // have no outgoing transitions or final states that have a non-coaccessible\n  // future.\n  std::unordered_set<StateId> finals;\n  for (StateIterator<Fst<Arc>> siter(*fst); !siter.Done(); siter.Next()) {\n    const auto s = siter.Value();\n    if (fst->Final(s) != Weight::Zero()) {\n      bool future_coaccess = false;\n      for (ArcIterator<Fst<Arc>> aiter(*fst, s); !aiter.Done(); aiter.Next()) {\n        const auto &arc = aiter.Value();\n        if (coaccess[arc.nextstate]) {\n          future_coaccess = true;\n          break;\n        }\n      }\n      if (!future_coaccess) finals.insert(s);\n    }\n  }\n  // Moves the final weight.\n  std::vector<Arc> arcs;\n  for (StateIterator<Fst<Arc>> siter(*fst); !siter.Done(); siter.Next()) {\n    const auto s = siter.Value();\n    auto weight = fst->Final(s);\n    arcs.clear();\n    for (ArcIterator<Fst<Arc>> aiter(*fst, s); !aiter.Done(); aiter.Next()) {\n      const auto &arc = aiter.Value();\n      // Next state is in the list of finals.\n      if (finals.find(arc.nextstate) != finals.end()) {\n        // Sums up all epsilon arcs.\n        if (arc.ilabel == 0 && arc.olabel == 0) {\n          weight = Plus(Times(fst->Final(arc.nextstate), arc.weight), weight);\n        } else {\n          arcs.push_back(arc);\n        }\n      } else {\n        arcs.push_back(arc);\n      }\n    }\n    // If some arcs (epsilon arcs) were deleted, delete all arcs and add back\n    // only the non-epsilon arcs.\n    if (arcs.size() < fst->NumArcs(s)) {\n      fst->DeleteArcs(s);\n      fst->SetFinal(s, weight);\n      for (const auto &arc : arcs) fst->AddArc(s, arc);\n    }\n  }\n  Connect(fst);\n}\n\n}  // namespace fst\n\n#endif  // FST_RMFINALEPSILON_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/script/arc-class.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#ifndef FST_SCRIPT_ARC_CLASS_H_\n#define FST_SCRIPT_ARC_CLASS_H_\n\n#include <fst/script/weight-class.h>\n\nnamespace fst {\nnamespace script {\n\n// A struct representing an arc while ignoring arc type. It is passed as an\n// argument to AddArc.\n\nstruct ArcClass {\n  template <class Arc>\n  explicit ArcClass(const Arc &arc)\n      : ilabel(arc.ilabel), olabel(arc.olabel), weight(arc.weight),\n        nextstate(arc.nextstate) {}\n\n  ArcClass(int64 ilabel, int64 olabel, const WeightClass &weight,\n           int64 nextstate)\n      : ilabel(ilabel), olabel(olabel), weight(weight), nextstate(nextstate) {}\n\n  template <class Arc>\n  Arc GetArc() const {\n    return Arc(ilabel, olabel, *(weight.GetWeight<typename Arc::Weight>()),\n               nextstate);\n  }\n\n  int64 ilabel;\n  int64 olabel;\n  WeightClass weight;\n  int64 nextstate;\n};\n\n}  // namespace script\n}  // namespace fst\n\n#endif  // FST_SCRIPT_ARC_CLASS_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/script/arciterator-class.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#ifndef FST_SCRIPT_ARCITERATOR_CLASS_H_\n#define FST_SCRIPT_ARCITERATOR_CLASS_H_\n\n#include <memory>\n#include <utility>\n\n#include <fst/fstlib.h>\n#include <fst/script/fst-class.h>\n\n// Scripting API support for ArcIterator.\n//\n// A call to Value() causes the underlying arc to be used to construct the\n// associated ArcClass.\n\nnamespace fst {\nnamespace script {\n\n// Non-mutable arc iterators.\n\n// Virtual interface implemented by each concrete ArcIteratorImpl<F>.\nclass ArcIteratorImplBase {\n public:\n  virtual bool Done() const = 0;\n  virtual uint32 Flags() const = 0;\n  virtual void Next() = 0;\n  virtual size_t Position() const = 0;\n  virtual void Reset() = 0;\n  virtual void Seek(size_t a) = 0;\n  virtual void SetFlags(uint32 flags, uint32 mask) = 0;\n  virtual ArcClass Value() const = 0;\n  virtual ~ArcIteratorImplBase() {}\n};\n\n// Templated implementation.\ntemplate <class Arc>\nclass ArcIteratorClassImpl : public ArcIteratorImplBase {\n public:\n  explicit ArcIteratorClassImpl(const Fst<Arc> &fst, int64 s)\n      : aiter_(fst, s) {}\n\n  bool Done() const final { return aiter_.Done(); }\n\n  uint32 Flags() const final { return aiter_.Flags(); }\n\n  void Next() final { aiter_.Next(); }\n\n  size_t Position() const final { return aiter_.Position(); }\n\n  void Reset() final { aiter_.Reset(); }\n\n  void Seek(size_t a) final { aiter_.Seek(a); }\n\n  void SetFlags(uint32 flags, uint32 mask) final {\n    aiter_.SetFlags(flags, mask);\n  }\n\n  // This is returned by value because it has not yet been constructed, and\n  // is likely to participate in return-value optimization.\n  ArcClass Value() const final { return ArcClass(aiter_.Value()); }\n\n  ~ArcIteratorClassImpl() final {}\n\n private:\n  ArcIterator<Fst<Arc>> aiter_;\n};\n\nclass ArcIteratorClass;\n\nusing InitArcIteratorClassArgs =\n    std::tuple<const FstClass &, int64, ArcIteratorClass *>;\n\n// Untemplated user-facing class holding a templated pimpl.\nclass ArcIteratorClass {\n public:\n  ArcIteratorClass(const FstClass &fst, int64 s);\n\n  template <class Arc>\n  ArcIteratorClass(const Fst<Arc> &fst, int64 s)\n      : impl_(new ArcIteratorClassImpl<Arc>(fst, s)) {}\n\n  bool Done() const { return impl_->Done(); }\n\n  uint32 Flags() const { return impl_->Flags(); }\n\n  void Next() { impl_->Next(); }\n\n  size_t Position() const { return impl_->Position(); }\n\n  void Reset() { impl_->Reset(); }\n\n  void Seek(size_t a) { impl_->Seek(a); }\n\n  void SetFlags(uint32 flags, uint32 mask) { impl_->SetFlags(flags, mask); }\n\n  ArcClass Value() const { return impl_->Value(); }\n\n  template <class Arc>\n  friend void InitArcIteratorClass(InitArcIteratorClassArgs *args);\n\n private:\n  std::unique_ptr<ArcIteratorImplBase> impl_;\n};\n\ntemplate <class Arc>\nvoid InitArcIteratorClass(InitArcIteratorClassArgs *args) {\n  const Fst<Arc> &fst = *(std::get<0>(*args).GetFst<Arc>());\n  std::get<2>(*args)->impl_.reset(\n      new ArcIteratorClassImpl<Arc>(fst, std::get<1>(*args)));\n}\n\n// Mutable arc iterators.\n\n// Virtual interface implemented by each concrete MutableArcIteratorImpl<F>.\nclass MutableArcIteratorImplBase : public ArcIteratorImplBase {\n public:\n  virtual void SetValue(const ArcClass &) = 0;\n\n  ~MutableArcIteratorImplBase() override {}\n};\n\n// Templated implementation.\ntemplate <class Arc>\nclass MutableArcIteratorClassImpl\n    : public MutableArcIteratorImplBase {\n public:\n  explicit MutableArcIteratorClassImpl(MutableFst<Arc> *fst, int64 s)\n      : aiter_(fst, s) {}\n\n  bool Done() const final { return aiter_.Done(); }\n\n  uint32 Flags() const final { return aiter_.Flags(); }\n\n  void Next() final { aiter_.Next(); }\n\n  size_t Position() const final { return aiter_.Position(); }\n\n  void Reset() final { aiter_.Reset(); }\n\n  void Seek(size_t a) final { aiter_.Seek(a); }\n\n  void SetFlags(uint32 flags, uint32 mask) final {\n    aiter_.SetFlags(flags, mask);\n  }\n\n  void SetValue(const Arc &arc) { aiter_.SetValue(arc); }\n\n  void SetValue(const ArcClass &ac) final { aiter_.SetValue(ac.GetArc<Arc>()); }\n\n  // This is returned by value because it has not yet been constructed, and\n  // is likely to participate in return-value optimization.\n  ArcClass Value() const final { return ArcClass(aiter_.Value()); }\n\n  ~MutableArcIteratorClassImpl() override {}\n\n private:\n  MutableArcIterator<MutableFst<Arc>> aiter_;\n};\n\nclass MutableArcIteratorClass;\n\nusing InitMutableArcIteratorClassArgs =\n    std::tuple<MutableFstClass *, int64, MutableArcIteratorClass *>;\n\n// Untemplated user-facing class holding a templated pimpl.\nclass MutableArcIteratorClass {\n public:\n  MutableArcIteratorClass(MutableFstClass *fst, int64 s);\n\n  template <class Arc>\n  MutableArcIteratorClass(MutableFst<Arc> *fst, int64 s)\n      : impl_(new MutableArcIteratorClassImpl<Arc>(fst, s)) {}\n\n  bool Done() const { return impl_->Done(); }\n\n  uint32 Flags() const { return impl_->Flags(); }\n\n  void Next() { impl_->Next(); }\n\n  size_t Position() const { return impl_->Position(); }\n\n  void Reset() { impl_->Reset(); }\n\n  void Seek(size_t a) { impl_->Seek(a); }\n\n  void SetFlags(uint32 flags, uint32 mask) { impl_->SetFlags(flags, mask); }\n\n  void SetValue(const ArcClass &ac) { impl_->SetValue(ac); }\n\n  ArcClass Value() const { return impl_->Value(); }\n\n  template <class Arc>\n  friend void InitMutableArcIteratorClass(\n      InitMutableArcIteratorClassArgs *args);\n\n private:\n  std::unique_ptr<MutableArcIteratorImplBase> impl_;\n};\n\ntemplate <class Arc>\nvoid InitMutableArcIteratorClass(InitMutableArcIteratorClassArgs *args) {\n  MutableFst<Arc> *fst = std::get<0>(*args)->GetMutableFst<Arc>();\n  std::get<2>(*args)->impl_.reset(\n      new MutableArcIteratorClassImpl<Arc>(fst, std::get<1>(*args)));\n}\n\n}  // namespace script\n}  // namespace fst\n\n#endif  // FST_SCRIPT_ARCITERATOR_CLASS_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/script/arcsort.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#ifndef FST_SCRIPT_ARCSORT_H_\n#define FST_SCRIPT_ARCSORT_H_\n\n#include <utility>\n\n#include <fst/arcsort.h>\n#include <fst/script/fst-class.h>\n\nnamespace fst {\nnamespace script {\n\nenum ArcSortType {\n  ILABEL_SORT,\n  OLABEL_SORT\n};\n\nusing ArcSortArgs = std::pair<MutableFstClass *, ArcSortType>;\n\ntemplate <class Arc>\nvoid ArcSort(ArcSortArgs *args) {\n  MutableFst<Arc> *fst = std::get<0>(*args)->GetMutableFst<Arc>();\n  switch (std::get<1>(*args)) {\n    case ILABEL_SORT: {\n      const ILabelCompare<Arc> icomp;\n      ArcSort(fst, icomp);\n      return;\n    }\n    case OLABEL_SORT: {\n      const OLabelCompare<Arc> ocomp;\n      ArcSort(fst, ocomp);\n      return;\n    }\n  }\n}\n\nvoid ArcSort(MutableFstClass *ofst, ArcSortType);\n\n}  // namespace script\n}  // namespace fst\n\n#endif  // FST_SCRIPT_ARCSORT_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/script/arg-packs.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// std::pair and std::tuple are used for the arguments of FstClass operations.\n//\n// If a function with a return value is required, use the WithReturnValue\n// template as follows:\n//\n// WithReturnValue<bool, std::tuple<...>>\n\n#ifndef FST_SCRIPT_ARG_PACKS_H_\n#define FST_SCRIPT_ARG_PACKS_H_\n\n#include <type_traits>\n\nnamespace fst {\nnamespace script {\n\n// Tack this on to an existing type to add a return value. The syntax for\n// accessing the args is then slightly more stilted, as you must do an extra\n// member access (since the args are stored as a member of this class).\n\ntemplate <class Retval, class ArgTuple>\nstruct WithReturnValue {\n  // Avoid reference-to-reference if ArgTuple is a reference.\n  using Args = typename std::remove_reference<ArgTuple>::type;\n\n  Retval retval;\n  const Args &args;\n\n  explicit WithReturnValue(const Args &args) : args(args) {}\n};\n\n}  // namespace script\n}  // namespace fst\n\n#endif  // FST_SCRIPT_ARG_PACKS_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/script/closure.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#ifndef FST_SCRIPT_CLOSURE_H_\n#define FST_SCRIPT_CLOSURE_H_\n\n#include <utility>\n\n#include <fst/closure.h>\n#include <fst/script/fst-class.h>\n\nnamespace fst {\nnamespace script {\n\nusing ClosureArgs = std::pair<MutableFstClass *, const ClosureType>;\n\ntemplate <class Arc>\nvoid Closure(ClosureArgs *args) {\n  MutableFst<Arc> *fst = std::get<0>(*args)->GetMutableFst<Arc>();\n  Closure(fst, std::get<1>(*args));\n}\n\nvoid Closure(MutableFstClass *ofst, ClosureType closure_type);\n\n}  // namespace script\n}  // namespace fst\n\n#endif  // FST_SCRIPT_CLOSURE_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/script/compile-impl.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Class to to compile a binary FST from textual input.\n\n#ifndef FST_SCRIPT_COMPILE_IMPL_H_\n#define FST_SCRIPT_COMPILE_IMPL_H_\n\n#include <iostream>\n#include <memory>\n#include <sstream>\n#include <string>\n#include <vector>\n\n#include <fst/fst.h>\n#include <fst/util.h>\n#include <fst/vector-fst.h>\n#include <unordered_map>\n\nDECLARE_string(fst_field_separator);\n\nnamespace fst {\n\n// Compile a binary Fst from textual input, helper class for fstcompile.cc\n// WARNING: Stand-alone use of this class not recommended, most code should\n// read/write using the binary format which is much more efficient.\ntemplate <class Arc>\nclass FstCompiler {\n public:\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  // WARNING: use of negative labels not recommended as it may cause conflicts.\n  // If add_symbols_ is true, then the symbols will be dynamically added to the\n  // symbol tables. This is only useful if you set the (i/o)keep flag to attach\n  // the final symbol table, or use the accessors. (The input symbol tables are\n  // const and therefore not changed.)\n  FstCompiler(std::istream &istrm, const string &source,  // NOLINT\n              const SymbolTable *isyms, const SymbolTable *osyms,\n              const SymbolTable *ssyms, bool accep, bool ikeep,\n              bool okeep, bool nkeep, bool allow_negative_labels = false) {\n    std::unique_ptr<SymbolTable> misyms(isyms ? isyms->Copy() : nullptr);\n    std::unique_ptr<SymbolTable> mosyms(osyms ? osyms->Copy() : nullptr);\n    std::unique_ptr<SymbolTable> mssyms(ssyms ? ssyms->Copy() : nullptr);\n    Init(istrm, source, misyms.get(), mosyms.get(), mssyms.get(), accep,\n         ikeep, okeep, nkeep, allow_negative_labels, false);\n  }\n\n  FstCompiler(std::istream &istrm, const string &source,  // NOLINT\n              SymbolTable *isyms, SymbolTable *osyms, SymbolTable *ssyms,\n              bool accep, bool ikeep, bool okeep, bool nkeep,\n              bool allow_negative_labels, bool add_symbols) {\n    Init(istrm, source, isyms, osyms, ssyms, accep, ikeep, okeep, nkeep,\n         allow_negative_labels, add_symbols);\n  }\n\n  void Init(std::istream &istrm, const string &source,  // NOLINT\n            SymbolTable *isyms, SymbolTable *osyms, SymbolTable *ssyms,\n            bool accep, bool ikeep, bool okeep, bool nkeep,\n            bool allow_negative_labels, bool add_symbols) {\n    nline_ = 0;\n    source_ = source;\n    isyms_ = isyms;\n    osyms_ = osyms;\n    ssyms_ = ssyms;\n    nstates_ = 0;\n    keep_state_numbering_ = nkeep;\n    allow_negative_labels_ = allow_negative_labels;\n    add_symbols_ = add_symbols;\n    bool start_state_populated = false;\n    char line[kLineLen];\n    const string separator = FLAGS_fst_field_separator + \"\\n\";\n    while (istrm.getline(line, kLineLen)) {\n      ++nline_;\n      std::vector<char *> col;\n      SplitString(line, separator.c_str(), &col, true);\n      if (col.empty() || col[0][0] == '\\0')\n        continue;\n      if (col.size() > 5 || (col.size() > 4 && accep) ||\n          (col.size() == 3 && !accep)) {\n        FSTERROR() << \"FstCompiler: Bad number of columns, source = \" << source_\n                   << \", line = \" << nline_;\n        fst_.SetProperties(kError, kError);\n        return;\n      }\n      StateId s = StrToStateId(col[0]);\n      while (s >= fst_.NumStates()) fst_.AddState();\n      if (!start_state_populated) {\n        fst_.SetStart(s);\n        start_state_populated = true;\n      }\n\n      Arc arc;\n      StateId d = s;\n      switch (col.size()) {\n        case 1:\n          fst_.SetFinal(s, Weight::One());\n          break;\n        case 2:\n          fst_.SetFinal(s, StrToWeight(col[1], true));\n          break;\n        case 3:\n          arc.nextstate = d = StrToStateId(col[1]);\n          arc.ilabel = StrToILabel(col[2]);\n          arc.olabel = arc.ilabel;\n          arc.weight = Weight::One();\n          fst_.AddArc(s, arc);\n          break;\n        case 4:\n          arc.nextstate = d = StrToStateId(col[1]);\n          arc.ilabel = StrToILabel(col[2]);\n          if (accep) {\n            arc.olabel = arc.ilabel;\n            arc.weight = StrToWeight(col[3], true);\n          } else {\n            arc.olabel = StrToOLabel(col[3]);\n            arc.weight = Weight::One();\n          }\n          fst_.AddArc(s, arc);\n          break;\n        case 5:\n          arc.nextstate = d = StrToStateId(col[1]);\n          arc.ilabel = StrToILabel(col[2]);\n          arc.olabel = StrToOLabel(col[3]);\n          arc.weight = StrToWeight(col[4], true);\n          fst_.AddArc(s, arc);\n      }\n      while (d >= fst_.NumStates()) fst_.AddState();\n    }\n    if (ikeep) fst_.SetInputSymbols(isyms);\n    if (okeep) fst_.SetOutputSymbols(osyms);\n  }\n\n  const VectorFst<Arc> &Fst() const { return fst_; }\n\n private:\n  // Maximum line length in text file.\n  static constexpr int kLineLen = 8096;\n\n  StateId StrToId(const char *s, SymbolTable *syms, const char *name,\n                  bool allow_negative = false) const {\n    StateId n = 0;\n    if (syms) {\n      n = (add_symbols_) ? syms->AddSymbol(s) : syms->Find(s);\n      if (n == -1 || (!allow_negative && n < 0)) {\n        FSTERROR() << \"FstCompiler: Symbol \\\"\" << s\n                   << \"\\\" is not mapped to any integer \" << name\n                   << \", symbol table = \" << syms->Name()\n                   << \", source = \" << source_ << \", line = \" << nline_;\n        fst_.SetProperties(kError, kError);\n      }\n    } else {\n      char *p;\n      n = strtoll(s, &p, 10);\n      if (p < s + strlen(s) || (!allow_negative && n < 0)) {\n        FSTERROR() << \"FstCompiler: Bad \" << name << \" integer = \\\"\" << s\n                   << \"\\\", source = \" << source_ << \", line = \" << nline_;\n        fst_.SetProperties(kError, kError);\n      }\n    }\n    return n;\n  }\n\n  StateId StrToStateId(const char *s) {\n    StateId n = StrToId(s, ssyms_, \"state ID\");\n    if (keep_state_numbering_) return n;\n    // Remaps state IDs to make dense set.\n    const auto it = states_.find(n);\n    if (it == states_.end()) {\n      states_[n] = nstates_;\n      return nstates_++;\n    } else {\n      return it->second;\n    }\n  }\n\n  StateId StrToILabel(const char *s) const {\n    return StrToId(s, isyms_, \"arc ilabel\", allow_negative_labels_);\n  }\n\n  StateId StrToOLabel(const char *s) const {\n    return StrToId(s, osyms_, \"arc olabel\", allow_negative_labels_);\n  }\n\n  Weight StrToWeight(const char *s, bool allow_zero) const {\n    Weight w;\n    std::istringstream strm(s);\n    strm >> w;\n    if (!strm || (!allow_zero && w == Weight::Zero())) {\n      FSTERROR() << \"FstCompiler: Bad weight = \\\"\" << s\n                 << \"\\\", source = \" << source_ << \", line = \" << nline_;\n      fst_.SetProperties(kError, kError);\n      w = Weight::NoWeight();\n    }\n    return w;\n  }\n\n  mutable VectorFst<Arc> fst_;\n  size_t nline_;\n  string source_;       // Text FST source name.\n  SymbolTable *isyms_;  // ilabel symbol table (not owned).\n  SymbolTable *osyms_;  // olabel symbol table (not owned).\n  SymbolTable *ssyms_;  // slabel symbol table (not owned).\n  std::unordered_map<StateId, StateId> states_;  // State ID map.\n  StateId nstates_;                              // Number of seen states.\n  bool keep_state_numbering_;\n  bool allow_negative_labels_;  // Not recommended; may cause conflicts.\n  bool add_symbols_;            // Add to symbol tables on-the fly.\n\n  FstCompiler(const FstCompiler &) = delete;\n  FstCompiler &operator=(const FstCompiler &) = delete;\n};\n\n}  // namespace fst\n\n#endif  // FST_SCRIPT_COMPILE_IMPL_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/script/compile.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#ifndef FST_SCRIPT_COMPILE_H_\n#define FST_SCRIPT_COMPILE_H_\n\n#include <istream>\n#include <memory>\n\n#include <fst/script/arg-packs.h>\n#include <fst/script/compile-impl.h>\n#include <fst/script/fst-class.h>\n\nnamespace fst {\nnamespace script {\n\n// This operation exists in two forms. 1 is a void operation which writes the\n// compiled machine to disk; 2 returns an FstClass. I/O should normally be done\n// using the binary format for efficiency, so users are STRONGLY ENCOURAGED to\n// use 1 or to construct FSTs using the C++ FST mutation operations.\n\n// Note: it is safe to pass these strings as references because\n// this struct is only used to pass them deeper in the call graph.\n// Be sure you understand why this is so before using this struct\n// for anything else!\nstruct CompileFstInnerArgs {\n  std::istream &istrm;\n  const string &source;\n  const string &fst_type;\n  const fst::SymbolTable *isyms;\n  const fst::SymbolTable *osyms;\n  const fst::SymbolTable *ssyms;\n  const bool accep;\n  const bool ikeep;\n  const bool okeep;\n  const bool nkeep;\n  const bool allow_negative_labels;\n\n  CompileFstInnerArgs(std::istream &istrm, const string &source,\n                      const string &fst_type, const fst::SymbolTable *isyms,\n                      const fst::SymbolTable *osyms,\n                      const fst::SymbolTable *ssyms, bool accep, bool ikeep,\n                      bool okeep, bool nkeep,\n                      bool allow_negative_labels = false)\n      : istrm(istrm),\n        source(source),\n        fst_type(fst_type),\n        isyms(isyms),\n        osyms(osyms),\n        ssyms(ssyms),\n        accep(accep),\n        ikeep(ikeep),\n        okeep(okeep),\n        nkeep(nkeep),\n        allow_negative_labels(allow_negative_labels) {}\n};\n\nusing CompileFstArgs = WithReturnValue<FstClass *, CompileFstInnerArgs>;\n\ntemplate <class Arc>\nvoid CompileFstInternal(CompileFstArgs *args) {\n  using fst::Convert;\n  using fst::Fst;\n  using fst::FstCompiler;\n  FstCompiler<Arc> fstcompiler(\n      args->args.istrm, args->args.source, args->args.isyms, args->args.osyms,\n      args->args.ssyms, args->args.accep, args->args.ikeep, args->args.okeep,\n      args->args.nkeep, args->args.allow_negative_labels);\n  const Fst<Arc> *fst = &fstcompiler.Fst();\n  std::unique_ptr<const Fst<Arc>> owned_fst;\n  if (args->args.fst_type != \"vector\") {\n    owned_fst.reset(Convert<Arc>(*fst, args->args.fst_type));\n    if (!owned_fst) {\n      FSTERROR() << \"Failed to convert FST to desired type: \"\n                 << args->args.fst_type;\n    }\n    fst = owned_fst.get();\n  }\n  args->retval = fst ? new FstClass(*fst) : nullptr;\n}\n\nvoid CompileFst(std::istream &istrm, const string &source, const string &dest,\n                const string &fst_type, const string &arc_type,\n                const SymbolTable *isyms, const SymbolTable *osyms,\n                const SymbolTable *ssyms, bool accep, bool ikeep, bool okeep,\n                bool nkeep, bool allow_negative_labels);\n\nFstClass *CompileFstInternal(std::istream &istrm, const string &source,\n                             const string &fst_type, const string &arc_type,\n                             const SymbolTable *isyms, const SymbolTable *osyms,\n                             const SymbolTable *ssyms, bool accep, bool ikeep,\n                             bool okeep, bool nkeep,\n                             bool allow_negative_labels);\n\n}  // namespace script\n}  // namespace fst\n\n#endif  // FST_SCRIPT_COMPILE_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/script/compose.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#ifndef FST_SCRIPT_COMPOSE_H_\n#define FST_SCRIPT_COMPOSE_H_\n\n#include <tuple>\n\n#include <fst/compose.h>\n#include <fst/script/fst-class.h>\n\nnamespace fst {\nnamespace script {\n\nusing ComposeArgs = std::tuple<const FstClass &, const FstClass &,\n                               MutableFstClass *, const ComposeOptions &>;\n\ntemplate <class Arc>\nvoid Compose(ComposeArgs *args) {\n  const Fst<Arc> &ifst1 = *(std::get<0>(*args).GetFst<Arc>());\n  const Fst<Arc> &ifst2 = *(std::get<1>(*args).GetFst<Arc>());\n  MutableFst<Arc> *ofst = std::get<2>(*args)->GetMutableFst<Arc>();\n  const auto &opts = std::get<3>(*args);\n  Compose(ifst1, ifst2, ofst, opts);\n}\n\nvoid Compose(const FstClass &ifst1, const FstClass &ifst2,\n             MutableFstClass *ofst,\n             const ComposeOptions &opts = ComposeOptions());\n\n}  // namespace script\n}  // namespace fst\n\n#endif  // FST_SCRIPT_COMPOSE_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/script/concat.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#ifndef FST_SCRIPT_CONCAT_H_\n#define FST_SCRIPT_CONCAT_H_\n\n#include <utility>\n\n#include <fst/concat.h>\n#include <fst/script/fst-class.h>\n\nnamespace fst {\nnamespace script {\n\nusing ConcatArgs1 = std::pair<MutableFstClass *, const FstClass &>;\n\ntemplate <class Arc>\nvoid Concat(ConcatArgs1 *args) {\n  MutableFst<Arc> *ofst = std::get<0>(*args)->GetMutableFst<Arc>();\n  const Fst<Arc> &ifst = *(std::get<1>(*args).GetFst<Arc>());\n  Concat(ofst, ifst);\n}\n\nusing ConcatArgs2 = std::pair<const FstClass &, MutableFstClass *>;\n\ntemplate <class Arc>\nvoid Concat(ConcatArgs2 *args) {\n  const Fst<Arc> &ifst = *(std::get<0>(*args).GetFst<Arc>());\n  MutableFst<Arc> *ofst = std::get<1>(*args)->GetMutableFst<Arc>();\n  Concat(ifst, ofst);\n}\n\nvoid Concat(MutableFstClass *ofst, const FstClass &ifst);\n\nvoid Concat(const FstClass &ifst, MutableFstClass *ofst);\n\n}  // namespace script\n}  // namespace fst\n\n#endif  // FST_SCRIPT_CONCAT_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/script/connect.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#ifndef FST_SCRIPT_CONNECT_H_\n#define FST_SCRIPT_CONNECT_H_\n\n#include <fst/connect.h>\n#include <fst/script/fst-class.h>\n\nnamespace fst {\nnamespace script {\n\ntemplate <class Arc>\nvoid Connect(MutableFstClass *fst) {\n  Connect(fst->GetMutableFst<Arc>());\n}\n\nvoid Connect(MutableFstClass *fst);\n\n}  // namespace script\n}  // namespace fst\n\n#endif  // FST_SCRIPT_CONNECT_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/script/convert.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#ifndef FST_SCRIPT_CONVERT_H_\n#define FST_SCRIPT_CONVERT_H_\n\n#include <memory>\n#include <string>\n#include <utility>\n\n#include <fst/register.h>\n#include <fst/script/arg-packs.h>\n#include <fst/script/fst-class.h>\n\nnamespace fst {\nnamespace script {\n\nusing ConvertInnerArgs = std::pair<const FstClass &, const string &>;\n\nusing ConvertArgs = WithReturnValue<FstClass *, ConvertInnerArgs>;\n\ntemplate <class Arc>\nvoid Convert(ConvertArgs *args) {\n  const Fst<Arc> &fst = *(std::get<0>(args->args).GetFst<Arc>());\n  const string &new_type = std::get<1>(args->args);\n  std::unique_ptr<Fst<Arc>> result(Convert(fst, new_type));\n  args->retval = result ? new FstClass(*result) : nullptr;\n}\n\nFstClass *Convert(const FstClass &fst, const string &new_type);\n\n}  // namespace script\n}  // namespace fst\n\n#endif  // FST_SCRIPT_CONVERT_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/script/decode.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#ifndef FST_SCRIPT_DECODE_H_\n#define FST_SCRIPT_DECODE_H_\n\n#include <memory>\n#include <string>\n#include <utility>\n\n#include <fst/encode.h>\n#include <fst/script/encodemapper-class.h>\n#include <fst/script/fst-class.h>\n\nnamespace fst {\nnamespace script {\n\nusing DecodeArgs1 = std::pair<MutableFstClass *, const string &>;\n\ntemplate <class Arc>\nvoid Decode(DecodeArgs1 *args) {\n  MutableFst<Arc> *fst = std::get<0>(*args)->GetMutableFst<Arc>();\n  std::unique_ptr<EncodeMapper<Arc>> decoder(\n      EncodeMapper<Arc>::Read(std::get<1>(*args), DECODE));\n  if (!decoder) {\n    fst->SetProperties(kError, kError);\n    return;\n  }\n  Decode(fst, *decoder);\n}\n\nusing DecodeArgs2 = std::pair<MutableFstClass *, const EncodeMapperClass &>;\n\ntemplate <class Arc>\nvoid Decode(DecodeArgs2 *args) {\n  MutableFst<Arc> *fst = std::get<0>(*args)->GetMutableFst<Arc>();\n  const EncodeMapper<Arc> &encoder =\n      *(std::get<1>(*args).GetEncodeMapper<Arc>());\n  Decode(fst, encoder);\n}\n\nvoid Decode(MutableFstClass *fst, const string &coder_fname);\n\nvoid Decode(MutableFstClass *fst, const EncodeMapperClass &encoder);\n\n}  // namespace script\n}  // namespace fst\n\n#endif  // FST_SCRIPT_DECODE_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/script/determinize.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#ifndef FST_SCRIPT_DETERMINIZE_H_\n#define FST_SCRIPT_DETERMINIZE_H_\n\n#include <tuple>\n\n#include <fst/determinize.h>\n#include <fst/script/fst-class.h>\n#include <fst/script/weight-class.h>\n\nnamespace fst {\nnamespace script {\n\nstruct DeterminizeOptions {\n  const float delta;\n  const WeightClass &weight_threshold;\n  const int64 state_threshold;\n  const int64 subsequential_label;\n  const DeterminizeType det_type;\n  const bool increment_subsequential_label;\n\n  DeterminizeOptions(float delta, const WeightClass &weight_threshold,\n                     int64 state_threshold = kNoStateId,\n                     int64 subsequential_label = 0,\n                     DeterminizeType det_type = DETERMINIZE_FUNCTIONAL,\n                     bool increment_subsequential_label = false)\n      : delta(delta),\n        weight_threshold(weight_threshold),\n        state_threshold(state_threshold),\n        subsequential_label(subsequential_label),\n        det_type(det_type),\n        increment_subsequential_label(increment_subsequential_label) {}\n};\n\nusing DeterminizeArgs = std::tuple<const FstClass &, MutableFstClass *,\n                                   const DeterminizeOptions &>;\n\ntemplate <class Arc>\nvoid Determinize(DeterminizeArgs *args) {\n  using Weight = typename Arc::Weight;\n  const Fst<Arc> &ifst = *(std::get<0>(*args).GetFst<Arc>());\n  MutableFst<Arc> *ofst = std::get<1>(*args)->GetMutableFst<Arc>();\n  const auto &opts = std::get<2>(*args);\n  const auto weight_threshold = *(opts.weight_threshold.GetWeight<Weight>());\n  const fst::DeterminizeOptions<Arc> detargs(opts.delta, weight_threshold,\n      opts.state_threshold, opts.subsequential_label, opts.det_type,\n      opts.increment_subsequential_label);\n  Determinize(ifst, ofst, detargs);\n}\n\nvoid Determinize(const FstClass &ifst, MutableFstClass *ofst,\n                 const DeterminizeOptions &opts);\n\n}  // namespace script\n}  // namespace fst\n\n#endif  // FST_SCRIPT_DETERMINIZE_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/script/difference.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#ifndef FST_SCRIPT_DIFFERENCE_H_\n#define FST_SCRIPT_DIFFERENCE_H_\n\n#include <tuple>\n\n#include <fst/difference.h>\n#include <fst/script/compose.h>\n#include <fst/script/fst-class.h>\n\nnamespace fst {\nnamespace script {\n\nusing DifferenceArgs = std::tuple<const FstClass &, const FstClass &,\n                                  MutableFstClass *, const ComposeOptions &>;\n\ntemplate <class Arc>\nvoid Difference(DifferenceArgs *args) {\n  const Fst<Arc> &ifst1 = *(std::get<0>(*args).GetFst<Arc>());\n  const Fst<Arc> &ifst2 = *(std::get<1>(*args).GetFst<Arc>());\n  MutableFst<Arc> *ofst = std::get<2>(*args)->GetMutableFst<Arc>();\n  const auto &opts = std::get<3>(*args);\n  Difference(ifst1, ifst2, ofst, opts);\n}\n\nvoid Difference(const FstClass &ifst1, const FstClass &ifst2,\n                MutableFstClass *ofst,\n                const ComposeOptions &opts = ComposeOptions());\n\n}  // namespace script\n}  // namespace fst\n\n#endif  // FST_SCRIPT_DIFFERENCE_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/script/disambiguate.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#ifndef FST_SCRIPT_DISAMBIGUATE_H_\n#define FST_SCRIPT_DISAMBIGUATE_H_\n\n#include <tuple>\n#include <utility>\n\n#include <fst/disambiguate.h>\n#include <fst/script/fst-class.h>\n#include <fst/script/weight-class.h>\n\nnamespace fst {\nnamespace script {\n\nstruct DisambiguateOptions {\n  const float delta;\n  const WeightClass &weight_threshold;\n  const int64 state_threshold;\n  const int64 subsequential_label;\n\n  DisambiguateOptions(float delta, const WeightClass &weight_threshold,\n                      int64 state_threshold = kNoStateId,\n                      int64 subsequential_label = 0)\n      : delta(delta),\n        weight_threshold(weight_threshold),\n        state_threshold(state_threshold),\n        subsequential_label(subsequential_label) {}\n};\n\nusing DisambiguateArgs = std::tuple<const FstClass &, MutableFstClass *,\n                                     const DisambiguateOptions &>;\n\ntemplate <class Arc>\nvoid Disambiguate(DisambiguateArgs *args) {\n  using Weight = typename Arc::Weight;\n  const Fst<Arc> &ifst = *(std::get<0>(*args).GetFst<Arc>());\n  MutableFst<Arc> *ofst = std::get<1>(*args)->GetMutableFst<Arc>();\n  const auto &opts = std::get<2>(*args);\n  const auto weight_threshold = *(opts.weight_threshold.GetWeight<Weight>());\n  const fst::DisambiguateOptions<Arc> disargs(opts.delta, weight_threshold,\n                                                  opts.state_threshold,\n                                                  opts.subsequential_label);\n  Disambiguate(ifst, ofst, disargs);\n}\n\nvoid Disambiguate(const FstClass &ifst, MutableFstClass *ofst,\n                  const DisambiguateOptions &opts);\n\n}  // namespace script\n}  // namespace fst\n\n#endif  // FST_SCRIPT_DISAMBIGUATE_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/script/draw-impl.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Class to draw a binary FST by producing a text file in dot format, a helper\n// class to fstdraw.cc.\n\n#ifndef FST_SCRIPT_DRAW_IMPL_H_\n#define FST_SCRIPT_DRAW_IMPL_H_\n\n#include <ostream>\n#include <sstream>\n#include <string>\n\n#include <fst/fst.h>\n#include <fst/util.h>\n#include <fst/script/fst-class.h>\n\nnamespace fst {\n\n// Print a binary FST in GraphViz textual format (helper class for fstdraw.cc).\n// WARNING: Stand-alone use not recommend.\ntemplate <class Arc>\nclass FstDrawer {\n public:\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  FstDrawer(const Fst<Arc> &fst, const SymbolTable *isyms,\n            const SymbolTable *osyms, const SymbolTable *ssyms, bool accep,\n            const string &title, float width, float height, bool portrait,\n            bool vertical, float ranksep, float nodesep, int fontsize,\n            int precision, const string &float_format, bool show_weight_one)\n      : fst_(fst),\n        isyms_(isyms),\n        osyms_(osyms),\n        ssyms_(ssyms),\n        accep_(accep && fst.Properties(kAcceptor, true)),\n        ostrm_(nullptr),\n        title_(title),\n        width_(width),\n        height_(height),\n        portrait_(portrait),\n        vertical_(vertical),\n        ranksep_(ranksep),\n        nodesep_(nodesep),\n        fontsize_(fontsize),\n        precision_(precision),\n        float_format_(float_format),\n        show_weight_one_(show_weight_one) {}\n\n  // Draws FST to an output buffer.\n  void Draw(std::ostream *strm, const string &dest) {\n    ostrm_ = strm;\n    SetStreamState(ostrm_);\n    dest_ = dest;\n    StateId start = fst_.Start();\n    if (start == kNoStateId) return;\n    PrintString(\"digraph FST {\\n\");\n    if (vertical_) {\n      PrintString(\"rankdir = BT;\\n\");\n    } else {\n      PrintString(\"rankdir = LR;\\n\");\n    }\n    PrintString(\"size = \\\"\");\n    Print(width_);\n    PrintString(\",\");\n    Print(height_);\n    PrintString(\"\\\";\\n\");\n    if (!dest_.empty()) PrintString(\"label = \\\"\" + title_ + \"\\\";\\n\");\n    PrintString(\"center = 1;\\n\");\n    if (portrait_) {\n      PrintString(\"orientation = Portrait;\\n\");\n    } else {\n      PrintString(\"orientation = Landscape;\\n\");\n    }\n    PrintString(\"ranksep = \\\"\");\n    Print(ranksep_);\n    PrintString(\"\\\";\\n\");\n    PrintString(\"nodesep = \\\"\");\n    Print(nodesep_);\n    PrintString(\"\\\";\\n\");\n    // Initial state first.\n    DrawState(start);\n    for (StateIterator<Fst<Arc>> siter(fst_); !siter.Done(); siter.Next()) {\n      const auto s = siter.Value();\n      if (s != start) DrawState(s);\n    }\n    PrintString(\"}\\n\");\n  }\n\n private:\n  void SetStreamState(std::ostream* strm) const {\n    strm->precision(precision_);\n    if (float_format_ == \"e\")\n        strm->setf(std::ios_base::scientific, std::ios_base::floatfield);\n    if (float_format_ == \"f\")\n        strm->setf(std::ios_base::fixed, std::ios_base::floatfield);\n    // O.w. defaults to \"g\" per standard lib.\n  }\n\n  void PrintString(const string &str) const { *ostrm_ << str; }\n\n  // Escapes backslash and double quote if these occur in the string. Dot will\n  // not deal gracefully with these if they are not escaped.\n  static string Escape(const string &str) {\n    string ns;\n    for (char c : str) {\n      if (c == '\\\\' || c == '\"') ns.push_back('\\\\');\n      ns.push_back(c);\n    }\n    return ns;\n  }\n\n  void PrintId(StateId id, const SymbolTable *syms, const char *name) const {\n    if (syms) {\n      auto symbol = syms->Find(id);\n      if (symbol.empty()) {\n        FSTERROR() << \"FstDrawer: Integer \" << id\n                   << \" is not mapped to any textual symbol\"\n                   << \", symbol table = \" << syms->Name()\n                   << \", destination = \" << dest_;\n        symbol = \"?\";\n      }\n      PrintString(Escape(symbol));\n    } else {\n      PrintString(std::to_string(id));\n    }\n  }\n\n  void PrintStateId(StateId s) const { PrintId(s, ssyms_, \"state ID\"); }\n\n  void PrintILabel(Label label) const {\n    PrintId(label, isyms_, \"arc input label\");\n  }\n\n  void PrintOLabel(Label label) const {\n    PrintId(label, osyms_, \"arc output label\");\n  }\n\n  void PrintWeight(Weight w) const {\n    // Weight may have double quote characters in it, so escape it.\n    PrintString(Escape(ToString(w)));\n  }\n\n  template <class T>\n  void Print(T t) const { *ostrm_ << t; }\n\n  template <class T>\n  string ToString(T t) const {\n    std::stringstream ss;\n    SetStreamState(&ss);\n    ss << t;\n    return ss.str();\n  }\n\n  void DrawState(StateId s) const {\n    Print(s);\n    PrintString(\" [label = \\\"\");\n    PrintStateId(s);\n    const auto weight = fst_.Final(s);\n    if (weight != Weight::Zero()) {\n      if (show_weight_one_ || (weight != Weight::One())) {\n        PrintString(\"/\");\n        PrintWeight(weight);\n      }\n      PrintString(\"\\\", shape = doublecircle,\");\n    } else {\n      PrintString(\"\\\", shape = circle,\");\n    }\n    if (s == fst_.Start()) {\n      PrintString(\" style = bold,\");\n    } else {\n      PrintString(\" style = solid,\");\n    }\n    PrintString(\" fontsize = \");\n    Print(fontsize_);\n    PrintString(\"]\\n\");\n    for (ArcIterator<Fst<Arc>> aiter(fst_, s); !aiter.Done(); aiter.Next()) {\n      const auto &arc = aiter.Value();\n      PrintString(\"\\t\");\n      Print(s);\n      PrintString(\" -> \");\n      Print(arc.nextstate);\n      PrintString(\" [label = \\\"\");\n      PrintILabel(arc.ilabel);\n      if (!accep_) {\n        PrintString(\":\");\n        PrintOLabel(arc.olabel);\n      }\n      if (show_weight_one_ || (arc.weight != Weight::One())) {\n        PrintString(\"/\");\n        PrintWeight(arc.weight);\n      }\n      PrintString(\"\\\", fontsize = \");\n      Print(fontsize_);\n      PrintString(\"];\\n\");\n    }\n  }\n\n  const Fst<Arc> &fst_;\n  const SymbolTable *isyms_;  // ilabel symbol table.\n  const SymbolTable *osyms_;  // olabel symbol table.\n  const SymbolTable *ssyms_;  // slabel symbol table.\n  bool accep_;                // Print as acceptor when possible.\n  std::ostream *ostrm_;       // Drawn FST destination.\n  string dest_;               // Drawn FST destination name.\n\n  string title_;\n  float width_;\n  float height_;\n  bool portrait_;\n  bool vertical_;\n  float ranksep_;\n  float nodesep_;\n  int fontsize_;\n  int precision_;\n  string float_format_;\n  bool show_weight_one_;\n\n  FstDrawer(const FstDrawer &) = delete;\n  FstDrawer &operator=(const FstDrawer &) = delete;\n};\n\n}  // namespace fst\n\n#endif  // FST_SCRIPT_DRAW_IMPL_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/script/draw.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#ifndef FST_SCRIPT_DRAW_H_\n#define FST_SCRIPT_DRAW_H_\n\n#include <ostream>\n\n#include <fst/script/draw-impl.h>\n#include <fst/script/fst-class.h>\n\nnamespace fst {\nnamespace script {\n\n// Note: it is safe to pass these strings as references because\n// this struct is only used to pass them deeper in the call graph.\n// Be sure you understand why this is so before using this struct\n// for anything else!\nstruct FstDrawerArgs {\n  const FstClass &fst;\n  const SymbolTable *isyms;\n  const SymbolTable *osyms;\n  const SymbolTable *ssyms;\n  const bool accep;\n  const string &title;\n  const float width;\n  const float height;\n  const bool portrait;\n  const bool vertical;\n  const float ranksep;\n  const float nodesep;\n  const int fontsize;\n  const int precision;\n  const string &float_format;  // NOLINT\n  const bool show_weight_one;\n  std::ostream *ostrm;\n  const string &dest;\n\n  FstDrawerArgs(const FstClass &fst, const SymbolTable *isyms,\n                const SymbolTable *osyms, const SymbolTable *ssyms, bool accep,\n                const string &title, float width, float height, bool portrait,\n                bool vertical, float ranksep, float nodesep, int fontsize,\n                int precision, const string &float_format,\n                bool show_weight_one, std::ostream *ostrm,  const string &dest)\n      : fst(fst),\n        isyms(isyms),\n        osyms(osyms),\n        ssyms(ssyms),\n        accep(accep),\n        title(title),\n        width(width),\n        height(height),\n        portrait(portrait),\n        vertical(vertical),\n        ranksep(ranksep),\n        nodesep(nodesep),\n        fontsize(fontsize),\n        precision(precision),\n        float_format(float_format),\n        show_weight_one(show_weight_one),\n        ostrm(ostrm),\n        dest(dest) {}\n};\n\ntemplate <class Arc>\nvoid DrawFst(FstDrawerArgs *args) {\n  const Fst<Arc> &fst = *(args->fst.GetFst<Arc>());\n  FstDrawer<Arc> fstdrawer(fst, args->isyms, args->osyms, args->ssyms,\n      args->accep, args->title, args->width, args->height, args->portrait,\n      args->vertical, args->ranksep, args->nodesep, args->fontsize,\n      args->precision, args->float_format, args->show_weight_one);\n  fstdrawer.Draw(args->ostrm, args->dest);\n}\n\nvoid DrawFst(const FstClass &fst, const SymbolTable *isyms,\n             const SymbolTable *osyms, const SymbolTable *ssyms, bool accep,\n             const string &title, float width, float height, bool portrait,\n             bool vertical, float ranksep, float nodesep, int fontsize,\n             int precision, const string &float_format, bool show_weight_one,\n             std::ostream *ostrm, const string &dest);\n\n}  // namespace script\n}  // namespace fst\n\n#endif  // FST_SCRIPT_DRAW_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/script/encode.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#ifndef FST_SCRIPT_ENCODE_H_\n#define FST_SCRIPT_ENCODE_H_\n\n#include <memory>\n#include <string>\n#include <tuple>\n#include <utility>\n\n#include <fst/encode.h>\n#include <fst/script/encodemapper-class.h>\n#include <fst/script/fst-class.h>\n\nnamespace fst {\nnamespace script {\n\nusing EncodeArgs1 = std::tuple<MutableFstClass *, uint32, bool, const string &>;\n\ntemplate <class Arc>\nvoid Encode(EncodeArgs1 *args) {\n  MutableFst<Arc> *fst = std::get<0>(*args)->GetMutableFst<Arc>();\n  const string &coder_fname = std::get<3>(*args);\n  // If true, reuse encode from disk. If false, make a new encoder and just use\n  // the filename argument as the destination state.\n  std::unique_ptr<EncodeMapper<Arc>> encoder(\n      std::get<2>(*args) ? EncodeMapper<Arc>::Read(coder_fname, ENCODE)\n                         : new EncodeMapper<Arc>(std::get<1>(*args), ENCODE));\n  Encode(fst, encoder.get());\n  if (!std::get<2>(*args)) encoder->Write(coder_fname);\n}\n\nusing EncodeArgs2 = std::pair<MutableFstClass *, EncodeMapperClass *>;\n\ntemplate <class Arc>\nvoid Encode(EncodeArgs2 *args) {\n  MutableFst<Arc> *fst = std::get<0>(*args)->GetMutableFst<Arc>();\n  EncodeMapper<Arc> *encoder = std::get<1>(*args)->GetEncodeMapper<Arc>();\n  Encode(fst, encoder);\n}\n\nvoid Encode(MutableFstClass *fst, uint32 flags, bool reuse_encoder,\n            const string &coder_fname);\n\nvoid Encode(MutableFstClass *fst, EncodeMapperClass *encoder);\n\n}  // namespace script\n}  // namespace fst\n\n#endif  // FST_SCRIPT_ENCODE_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/script/encodemapper-class.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#ifndef FST_SCRIPT_ENCODEMAPPER_CLASS_H_\n#define FST_SCRIPT_ENCODEMAPPER_CLASS_H_\n\n#include <memory>\n#include <string>\n#include <iostream>\n\n#include <fst/fstlib.h>\n#include <fst/script/arc-class.h>\n#include <fst/script/fst-class.h>\n\n// Scripting API support for EncodeMapper.\n\nnamespace fst {\nnamespace script {\n\n// Virtual interface implemented by each concrete EncodeMapperClassImpl<A>.\nclass EncodeMapperImplBase {\n public:\n  // Returns an encoded ArcClass.\n  virtual ArcClass operator()(const ArcClass &a) = 0;\n  virtual const string &ArcType() const = 0;\n  virtual uint32 Flags() const = 0;\n  virtual uint64 Properties(uint64 inprops) = 0;\n  virtual EncodeType Type() const = 0;\n  virtual const SymbolTable *InputSymbols() const = 0;\n  virtual const SymbolTable *OutputSymbols() const = 0;\n  virtual void SetInputSymbols(const SymbolTable *syms) = 0;\n  virtual void SetOutputSymbols(const SymbolTable *syms) = 0;\n  virtual const string &WeightType() const = 0;\n  virtual ~EncodeMapperImplBase() {}\n};\n\n// Templated implementation.\ntemplate <class Arc>\nclass EncodeMapperClassImpl : public EncodeMapperImplBase {\n public:\n  EncodeMapperClassImpl(uint32 flags, EncodeType type)\n      : encoder_(flags, type) {}\n\n  ArcClass operator()(const ArcClass &a) final;\n\n  const string &ArcType() const final { return Arc::Type(); }\n\n  uint32 Flags() const final { return encoder_.Flags(); }\n\n  uint64 Properties(uint64 inprops) final {\n    return encoder_.Properties(inprops);\n  }\n\n  EncodeType Type() const final { return encoder_.Type(); }\n\n  const SymbolTable *InputSymbols() const final {\n    return encoder_.InputSymbols();\n  }\n\n  const SymbolTable *OutputSymbols() const final {\n    return encoder_.OutputSymbols();\n  }\n\n  void SetInputSymbols(const SymbolTable *syms) final {\n    encoder_.SetInputSymbols(syms);\n  }\n\n  void SetOutputSymbols(const SymbolTable *syms) final {\n    encoder_.SetOutputSymbols(syms);\n  }\n\n  const string &WeightType() const final { return Arc::Weight::Type(); }\n\n  ~EncodeMapperClassImpl() override {}\n\n  EncodeMapper<Arc> *GetImpl() const { return &encoder_; }\n\n  EncodeMapper<Arc> *GetImpl() { return &encoder_; }\n\n private:\n  EncodeMapper<Arc> encoder_;\n};\n\n// This is returned by value because it is very likely to undergo return-value\n// optimization.\ntemplate <class Arc>\ninline ArcClass EncodeMapperClassImpl<Arc>::operator()(const ArcClass &a) {\n  Arc arc(a.ilabel, a.olabel, *(a.weight.GetWeight<typename Arc::Weight>()),\n          a.nextstate);\n  return ArcClass(encoder_(arc));\n}\n\nclass EncodeMapperClass;\n\nusing InitEncodeMapperClassArgs =\n    std::tuple<uint32, EncodeType, EncodeMapperClass *>;\n\nclass EncodeMapperClass {\n public:\n  EncodeMapperClass(const string &arc_type, uint32 flags, EncodeType type);\n\n  template <class Arc>\n  EncodeMapperClass(uint32 flags, EncodeType type)\n      : impl_(new EncodeMapperClassImpl<Arc>(flags, type)) {}\n\n  ArcClass operator()(const ArcClass &arc) { return (*impl_)(arc); }\n\n  const string &ArcType() const { return impl_->ArcType(); }\n\n  uint32 Flags() const { return impl_->Flags(); }\n\n  uint64 Properties(uint64 inprops) { return impl_->Properties(inprops); }\n\n  EncodeType Type() const { return impl_->Type(); }\n\n  const SymbolTable *InputSymbols() const { return impl_->InputSymbols(); }\n\n  const SymbolTable *OutputSymbols() const { return impl_->OutputSymbols(); }\n\n  void SetInputSymbols(const SymbolTable *syms) {\n    impl_->SetInputSymbols(syms);\n  }\n\n  void SetOutputSymbols(const SymbolTable *syms) {\n    impl_->SetOutputSymbols(syms);\n  }\n\n  const string &WeightType() const { return impl_->WeightType(); }\n\n  template <class Arc>\n  friend void InitEncodeMapperClass(InitEncodeMapperClassArgs *args);\n\n  // Naturally, this exists in non-const and const forms. Encoding arcs or FSTs\n  // mutates the underlying encoder; decoding them does not.\n\n  template <class Arc>\n  EncodeMapper<Arc> *GetEncodeMapper() {\n    if (Arc::Type() != ArcType()) {\n      return nullptr;\n    } else {\n      auto *typed_impl = static_cast<EncodeMapperClassImpl<Arc> *>(impl_.get());\n      return typed_impl->GetImpl();\n    }\n  }\n\n  template <class Arc>\n  const EncodeMapper<Arc> *GetEncodeMapper() const {\n    if (Arc::Type() != ArcType()) {\n      return nullptr;\n    } else {\n      auto *typed_impl = static_cast<EncodeMapperClassImpl<Arc> *>(impl_.get());\n      return typed_impl->GetImpl();\n    }\n  }\n\n private:\n  std::unique_ptr<EncodeMapperImplBase> impl_;\n};\n\ntemplate <class Arc>\nvoid InitEncodeMapperClass(InitEncodeMapperClassArgs *args) {\n  std::get<2>(*args)->impl_.reset(\n      new EncodeMapperClassImpl<Arc>(std::get<0>(*args), std::get<1>(*args)));\n}\n\n}  // namespace script\n}  // namespace fst\n\n#endif  // FST_SCRIPT_ENCODEMAPPER_CLASS_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/script/epsnormalize.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#ifndef FST_SCRIPT_EPSNORMALIZE_H_\n#define FST_SCRIPT_EPSNORMALIZE_H_\n\n#include <tuple>\n\n#include <fst/epsnormalize.h>\n#include <fst/script/fst-class.h>\n\nnamespace fst {\nnamespace script {\n\nusing EpsNormalizeArgs = std::tuple<const FstClass &, MutableFstClass *,\n                                    EpsNormalizeType>;\n\ntemplate <class Arc>\nvoid EpsNormalize(EpsNormalizeArgs *args) {\n  const Fst<Arc> &ifst = *(std::get<0>(*args).GetFst<Arc>());\n  MutableFst<Arc> *ofst = std::get<1>(*args)->GetMutableFst<Arc>();\n  EpsNormalize(ifst, ofst, std::get<2>(*args));\n}\n\nvoid EpsNormalize(const FstClass &ifst, MutableFstClass *ofst,\n                  EpsNormalizeType norm_type = EPS_NORM_INPUT);\n\n}  // namespace script\n}  // namespace fst\n\n#endif  // FST_SCRIPT_EPSNORMALIZE_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/script/equal.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#ifndef FST_SCRIPT_EQUAL_H_\n#define FST_SCRIPT_EQUAL_H_\n\n#include <tuple>\n\n#include <fst/equal.h>\n#include <fst/script/arg-packs.h>\n#include <fst/script/fst-class.h>\n\nnamespace fst {\nnamespace script {\n\nusing EqualInnerArgs = std::tuple<const FstClass &, const FstClass &, float>;\n\nusing EqualArgs = WithReturnValue<bool, EqualInnerArgs>;\n\ntemplate <class Arc>\nvoid Equal(EqualArgs *args) {\n  const Fst<Arc> &fst1 = *(std::get<0>(args->args).GetFst<Arc>());\n  const Fst<Arc> &fst2 = *(std::get<1>(args->args).GetFst<Arc>());\n  args->retval = Equal(fst1, fst2, std::get<2>(args->args));\n}\n\nbool Equal(const FstClass &fst1, const FstClass &fst2, float delta = kDelta);\n\n}  // namespace script\n}  // namespace fst\n\n#endif  // FST_SCRIPT_EQUAL_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/script/equivalent.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#ifndef FST_SCRIPT_EQUIVALENT_H_\n#define FST_SCRIPT_EQUIVALENT_H_\n\n#include <tuple>\n\n#include <fst/equivalent.h>\n#include <fst/script/arg-packs.h>\n#include <fst/script/fst-class.h>\n\nnamespace fst {\nnamespace script {\n\nusing EquivalentInnerArgs = std::tuple<const FstClass &, const FstClass &,\n                                       float>;\n\nusing EquivalentArgs = WithReturnValue<bool, EquivalentInnerArgs>;\n\ntemplate <class Arc>\nvoid Equivalent(EquivalentArgs *args) {\n  const Fst<Arc> &fst1 = *(std::get<0>(args->args).GetFst<Arc>());\n  const Fst<Arc> &fst2 = *(std::get<1>(args->args).GetFst<Arc>());\n  args->retval = Equivalent(fst1, fst2, std::get<2>(args->args));\n}\n\nbool Equivalent(const FstClass &fst1, const FstClass &fst2,\n                float delta = kDelta);\n\n}  // namespace script\n}  // namespace fst\n\n#endif  // FST_SCRIPT_EQUIVALENT_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/script/fst-class.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#ifndef FST_SCRIPT_FST_CLASS_H_\n#define FST_SCRIPT_FST_CLASS_H_\n\n#include <algorithm>\n#include <limits>\n#include <string>\n#include <type_traits>\n\n#include <fst/expanded-fst.h>\n#include <fst/fst.h>\n#include <fst/mutable-fst.h>\n#include <fst/vector-fst.h>\n#include <fst/script/arc-class.h>\n#include <fst/script/weight-class.h>\n\n// Classes to support \"boxing\" all existing types of FST arcs in a single\n// FstClass which hides the arc types. This allows clients to load\n// and work with FSTs without knowing the arc type. These classes are only\n// recommended for use in high-level scripting applications. Most users should\n// use the lower-level templated versions corresponding to these classes.\n\nnamespace fst {\nnamespace script {\n\n// Abstract base class defining the set of functionalities implemented in all\n// impls and passed through by all bases. Below FstClassBase the class\n// hierarchy bifurcates; FstClassImplBase serves as the base class for all\n// implementations (of which FstClassImpl is currently the only one) and\n// FstClass serves as the base class for all interfaces.\n\nclass FstClassBase {\n public:\n  virtual const string &ArcType() const = 0;\n  virtual WeightClass Final(int64) const = 0;\n  virtual const string &FstType() const = 0;\n  virtual const SymbolTable *InputSymbols() const = 0;\n  virtual size_t NumArcs(int64) const = 0;\n  virtual size_t NumInputEpsilons(int64) const = 0;\n  virtual size_t NumOutputEpsilons(int64) const = 0;\n  virtual const SymbolTable *OutputSymbols() const = 0;\n  virtual uint64 Properties(uint64, bool) const = 0;\n  virtual int64 Start() const = 0;\n  virtual const string &WeightType() const = 0;\n  virtual bool ValidStateId(int64) const = 0;\n  virtual bool Write(const string &) const = 0;\n  virtual bool Write(std::ostream &, const string &) const = 0;\n  virtual ~FstClassBase() {}\n};\n\n// Adds all the MutableFst methods.\nclass FstClassImplBase : public FstClassBase {\n public:\n  virtual bool AddArc(int64, const ArcClass &) = 0;\n  virtual int64 AddState() = 0;\n  virtual FstClassImplBase *Copy() = 0;\n  virtual bool DeleteArcs(int64, size_t) = 0;\n  virtual bool DeleteArcs(int64) = 0;\n  virtual bool DeleteStates(const std::vector<int64> &) = 0;\n  virtual void DeleteStates() = 0;\n  virtual SymbolTable *MutableInputSymbols() = 0;\n  virtual SymbolTable *MutableOutputSymbols() = 0;\n  virtual int64 NumStates() const = 0;\n  virtual bool ReserveArcs(int64, size_t) = 0;\n  virtual void ReserveStates(int64) = 0;\n  virtual void SetInputSymbols(SymbolTable *) = 0;\n  virtual bool SetFinal(int64, const WeightClass &) = 0;\n  virtual void SetOutputSymbols(SymbolTable *) = 0;\n  virtual void SetProperties(uint64, uint64) = 0;\n  virtual bool SetStart(int64) = 0;\n  ~FstClassImplBase() override {}\n};\n\n// Containiner class wrapping an Fst<Arc>, hiding its arc type. Whether this\n// Fst<Arc> pointer refers to a special kind of FST (e.g. a MutableFst) is\n// known by the type of interface class that owns the pointer to this\n// container.\n\ntemplate <class Arc>\nclass FstClassImpl : public FstClassImplBase {\n public:\n  explicit FstClassImpl(Fst<Arc> *impl, bool should_own = false)\n      : impl_(should_own ? impl : impl->Copy()) {}\n\n  explicit FstClassImpl(const Fst<Arc> &impl) : impl_(impl.Copy()) {}\n\n  // Warning: calling this method casts the FST to a mutable FST.\n  bool AddArc(int64 s, const ArcClass &ac) final {\n    if (!ValidStateId(s)) return false;\n    // Note that we do not check that the destination state is valid, so users\n    // can add arcs before they add the corresponding states. Verify can be\n    // used to determine whether any arc has a nonexisting destination.\n    Arc arc(ac.ilabel, ac.olabel, *ac.weight.GetWeight<typename Arc::Weight>(),\n            ac.nextstate);\n    static_cast<MutableFst<Arc> *>(impl_.get())->AddArc(s, arc);\n    return true;\n  }\n\n  // Warning: calling this method casts the FST to a mutable FST.\n  int64 AddState() final {\n    return static_cast<MutableFst<Arc> *>(impl_.get())->AddState();\n  }\n\n  const string &ArcType() const final { return Arc::Type(); }\n\n  FstClassImpl *Copy() final { return new FstClassImpl<Arc>(impl_.get()); }\n\n  // Warning: calling this method casts the FST to a mutable FST.\n  bool DeleteArcs(int64 s, size_t n) final {\n    if (!ValidStateId(s)) return false;\n    static_cast<MutableFst<Arc> *>(impl_.get())->DeleteArcs(s, n);\n    return true;\n  }\n\n  // Warning: calling this method casts the FST to a mutable FST.\n  bool DeleteArcs(int64 s) final {\n    if (!ValidStateId(s)) return false;\n    static_cast<MutableFst<Arc> *>(impl_.get())->DeleteArcs(s);\n    return true;\n  }\n\n  // Warning: calling this method casts the FST to a mutable FST.\n  bool DeleteStates(const std::vector<int64> &dstates) final {\n    for (const auto &state : dstates)\n      if (!ValidStateId(state)) return false;\n    // Warning: calling this method with any integers beyond the precision of\n    // the underlying FST will result in truncation.\n    std::vector<typename Arc::StateId> typed_dstates(dstates.size());\n    std::copy(dstates.begin(), dstates.end(), typed_dstates.begin());\n    static_cast<MutableFst<Arc> *>(impl_.get())->DeleteStates(typed_dstates);\n    return true;\n  }\n\n  // Warning: calling this method casts the FST to a mutable FST.\n  void DeleteStates() final {\n    static_cast<MutableFst<Arc> *>(impl_.get())->DeleteStates();\n  }\n\n  WeightClass Final(int64 s) const final {\n    if (!ValidStateId(s)) return WeightClass::NoWeight(WeightType());\n    WeightClass w(impl_->Final(s));\n    return w;\n  }\n\n  const string &FstType() const final { return impl_->Type(); }\n\n  const SymbolTable *InputSymbols() const final {\n    return impl_->InputSymbols();\n  }\n\n  // Warning: calling this method casts the FST to a mutable FST.\n  SymbolTable *MutableInputSymbols() final {\n    return static_cast<MutableFst<Arc> *>(impl_.get())->MutableInputSymbols();\n  }\n\n  // Warning: calling this method casts the FST to a mutable FST.\n  SymbolTable *MutableOutputSymbols() final {\n    return static_cast<MutableFst<Arc> *>(impl_.get())->MutableOutputSymbols();\n  }\n\n  // Signals failure by returning size_t max.\n  size_t NumArcs(int64 s) const final {\n    return ValidStateId(s) ? impl_->NumArcs(s)\n                           : std::numeric_limits<size_t>::max();\n  }\n\n  // Signals failure by returning size_t max.\n  size_t NumInputEpsilons(int64 s) const final {\n    return ValidStateId(s) ? impl_->NumInputEpsilons(s)\n                           : std::numeric_limits<size_t>::max();\n  }\n\n  // Signals failure by returning size_t max.\n  size_t NumOutputEpsilons(int64 s) const final {\n    return ValidStateId(s) ? impl_->NumOutputEpsilons(s)\n                           : std::numeric_limits<size_t>::max();\n  }\n\n  // Warning: calling this method casts the FST to a mutable FST.\n  int64 NumStates() const final {\n    return static_cast<MutableFst<Arc> *>(impl_.get())->NumStates();\n  }\n\n  uint64 Properties(uint64 mask, bool test) const final {\n    return impl_->Properties(mask, test);\n  }\n\n  // Warning: calling this method casts the FST to a mutable FST.\n  bool ReserveArcs(int64 s, size_t n) final {\n    if (!ValidStateId(s)) return false;\n    static_cast<MutableFst<Arc> *>(impl_.get())->ReserveArcs(s, n);\n    return true;\n  }\n\n  // Warning: calling this method casts the FST to a mutable FST.\n  void ReserveStates(int64 s) final {\n    static_cast<MutableFst<Arc> *>(impl_.get())->ReserveStates(s);\n  }\n\n  const SymbolTable *OutputSymbols() const final {\n    return impl_->OutputSymbols();\n  }\n\n  // Warning: calling this method casts the FST to a mutable FST.\n  void SetInputSymbols(SymbolTable *isyms) final {\n    static_cast<MutableFst<Arc> *>(impl_.get())->SetInputSymbols(isyms);\n  }\n\n  // Warning: calling this method casts the FST to a mutable FST.\n  bool SetFinal(int64 s, const WeightClass &weight) final {\n    if (!ValidStateId(s)) return false;\n    static_cast<MutableFst<Arc> *>(impl_.get())\n        ->SetFinal(s, *weight.GetWeight<typename Arc::Weight>());\n    return true;\n  }\n\n  // Warning: calling this method casts the FST to a mutable FST.\n  void SetOutputSymbols(SymbolTable *osyms) final {\n    static_cast<MutableFst<Arc> *>(impl_.get())->SetOutputSymbols(osyms);\n  }\n\n  // Warning: calling this method casts the FST to a mutable FST.\n  void SetProperties(uint64 props, uint64 mask) final {\n    static_cast<MutableFst<Arc> *>(impl_.get())->SetProperties(props, mask);\n  }\n\n  // Warning: calling this method casts the FST to a mutable FST.\n  bool SetStart(int64 s) final {\n    if (!ValidStateId(s)) return false;\n    static_cast<MutableFst<Arc> *>(impl_.get())->SetStart(s);\n    return true;\n  }\n\n  int64 Start() const final { return impl_->Start(); }\n\n  bool ValidStateId(int64 s) const final {\n    // This cowardly refuses to count states if the FST is not yet expanded.\n    if (!Properties(kExpanded, true)) {\n      FSTERROR() << \"Cannot get number of states for unexpanded FST\";\n      return false;\n    }\n    // If the FST is already expanded, CountStates calls NumStates.\n    if (s < 0 || s >= CountStates(*impl_)) {\n      FSTERROR() << \"State ID \" << s << \" not valid\";\n      return false;\n    }\n    return true;\n  }\n\n  const string &WeightType() const final { return Arc::Weight::Type(); }\n\n  bool Write(const string &fname) const final { return impl_->Write(fname); }\n\n  bool Write(std::ostream &ostr, const string &fname) const final {\n    const FstWriteOptions opts(fname);\n    return impl_->Write(ostr, opts);\n  }\n\n  ~FstClassImpl() override {}\n\n  Fst<Arc> *GetImpl() const { return impl_.get(); }\n\n private:\n  std::unique_ptr<Fst<Arc>> impl_;\n};\n\n// BASE CLASS DEFINITIONS\n\nclass MutableFstClass;\n\nclass FstClass : public FstClassBase {\n public:\n  FstClass() : impl_(nullptr) {}\n\n  template <class Arc>\n  explicit FstClass(const Fst<Arc> &fst) : impl_(new FstClassImpl<Arc>(fst)) {}\n\n  FstClass(const FstClass &other)\n      : impl_(other.impl_ == nullptr ? nullptr : other.impl_->Copy()) {}\n\n  FstClass &operator=(const FstClass &other) {\n    impl_.reset(other.impl_ == nullptr ? nullptr : other.impl_->Copy());\n    return *this;\n  }\n\n  WeightClass Final(int64 s) const final { return impl_->Final(s); }\n\n  const string &ArcType() const final { return impl_->ArcType(); }\n\n  const string &FstType() const final { return impl_->FstType(); }\n\n  const SymbolTable *InputSymbols() const final {\n    return impl_->InputSymbols();\n  }\n\n  size_t NumArcs(int64 s) const final { return impl_->NumArcs(s); }\n\n  size_t NumInputEpsilons(int64 s) const final {\n    return impl_->NumInputEpsilons(s);\n  }\n\n  size_t NumOutputEpsilons(int64 s) const final {\n    return impl_->NumOutputEpsilons(s);\n  }\n\n  const SymbolTable *OutputSymbols() const final {\n    return impl_->OutputSymbols();\n  }\n\n  uint64 Properties(uint64 mask, bool test) const final {\n    // Special handling for FSTs with a null impl.\n    if (!impl_) return kError & mask;\n    return impl_->Properties(mask, test);\n  }\n\n  static FstClass *Read(const string &fname);\n\n  static FstClass *Read(std::istream &istrm, const string &source);\n\n  int64 Start() const final { return impl_->Start(); }\n\n  bool ValidStateId(int64 s) const final { return impl_->ValidStateId(s); }\n\n  const string &WeightType() const final { return impl_->WeightType(); }\n\n  // Helper that logs an ERROR if the weight type of an FST and a WeightClass\n  // don't match.\n\n  bool WeightTypesMatch(const WeightClass &weight, const string &op_name) const;\n\n  bool Write(const string &fname) const final { return impl_->Write(fname); }\n\n  bool Write(std::ostream &ostr, const string &fname) const final {\n    return impl_->Write(ostr, fname);\n  }\n\n  ~FstClass() override {}\n\n  // These methods are required by IO registration.\n\n  template <class Arc>\n  static FstClassImplBase *Convert(const FstClass &other) {\n    FSTERROR() << \"Doesn't make sense to convert any class to type FstClass\";\n    return nullptr;\n  }\n\n  template <class Arc>\n  static FstClassImplBase *Create() {\n    FSTERROR() << \"Doesn't make sense to create an FstClass with a \"\n               << \"particular arc type\";\n    return nullptr;\n  }\n\n  template <class Arc>\n  const Fst<Arc> *GetFst() const {\n    if (Arc::Type() != ArcType()) {\n      return nullptr;\n    } else {\n      FstClassImpl<Arc> *typed_impl =\n          static_cast<FstClassImpl<Arc> *>(impl_.get());\n      return typed_impl->GetImpl();\n    }\n  }\n\n  template <class Arc>\n  static FstClass *Read(std::istream &stream, const FstReadOptions &opts) {\n    if (!opts.header) {\n      LOG(ERROR) << \"FstClass::Read: Options header not specified\";\n      return nullptr;\n    }\n    const FstHeader &hdr = *opts.header;\n    if (hdr.Properties() & kMutable) {\n      return ReadTypedFst<MutableFstClass, MutableFst<Arc>>(stream, opts);\n    } else {\n      return ReadTypedFst<FstClass, Fst<Arc>>(stream, opts);\n    }\n  }\n\n protected:\n  explicit FstClass(FstClassImplBase *impl) : impl_(impl) {}\n\n  const FstClassImplBase *GetImpl() const { return impl_.get(); }\n\n  FstClassImplBase *GetImpl() { return impl_.get(); }\n\n  // Generic template method for reading an arc-templated FST of type\n  // UnderlyingT, and returning it wrapped as FstClassT, with appropriat\n  // error checking. Called from arc-templated Read() static methods.\n  template <class FstClassT, class UnderlyingT>\n  static FstClassT *ReadTypedFst(std::istream &stream,\n                                 const FstReadOptions &opts) {\n    std::unique_ptr<UnderlyingT> u(UnderlyingT::Read(stream, opts));\n    return u ? new FstClassT(*u) : nullptr;\n  }\n\n private:\n  std::unique_ptr<FstClassImplBase> impl_;\n};\n\n// Specific types of FstClass with special properties\n\nclass MutableFstClass : public FstClass {\n public:\n  bool AddArc(int64 s, const ArcClass &ac) {\n    if (!WeightTypesMatch(ac.weight, \"AddArc\")) return false;\n    return GetImpl()->AddArc(s, ac);\n  }\n\n  int64 AddState() { return GetImpl()->AddState(); }\n\n  bool DeleteArcs(int64 s, size_t n) { return GetImpl()->DeleteArcs(s, n); }\n\n  bool DeleteArcs(int64 s) { return GetImpl()->DeleteArcs(s); }\n\n  bool DeleteStates(const std::vector<int64> &dstates) {\n    return GetImpl()->DeleteStates(dstates);\n  }\n\n  void DeleteStates() { GetImpl()->DeleteStates(); }\n\n  SymbolTable *MutableInputSymbols() {\n    return GetImpl()->MutableInputSymbols();\n  }\n\n  SymbolTable *MutableOutputSymbols() {\n    return GetImpl()->MutableOutputSymbols();\n  }\n\n  int64 NumStates() const { return GetImpl()->NumStates(); }\n\n  bool ReserveArcs(int64 s, size_t n) { return GetImpl()->ReserveArcs(s, n); }\n\n  void ReserveStates(int64 s) { GetImpl()->ReserveStates(s); }\n\n  static MutableFstClass *Read(const string &fname, bool convert = false);\n\n  void SetInputSymbols(SymbolTable *isyms) {\n    GetImpl()->SetInputSymbols(isyms);\n  }\n\n  bool SetFinal(int64 s, const WeightClass &weight) {\n    if (!WeightTypesMatch(weight, \"SetFinal\")) return false;\n    return GetImpl()->SetFinal(s, weight);\n  }\n\n  void SetOutputSymbols(SymbolTable *osyms) {\n    GetImpl()->SetOutputSymbols(osyms);\n  }\n\n  void SetProperties(uint64 props, uint64 mask) {\n    GetImpl()->SetProperties(props, mask);\n  }\n\n  bool SetStart(int64 s) { return GetImpl()->SetStart(s); }\n\n  template <class Arc>\n  explicit MutableFstClass(const MutableFst<Arc> &fst) : FstClass(fst) {}\n\n  // These methods are required by IO registration.\n\n  template <class Arc>\n  static FstClassImplBase *Convert(const FstClass &other) {\n    FSTERROR() << \"Doesn't make sense to convert any class to type \"\n               << \"MutableFstClass\";\n    return nullptr;\n  }\n\n  template <class Arc>\n  static FstClassImplBase *Create() {\n    FSTERROR() << \"Doesn't make sense to create a MutableFstClass with a \"\n               << \"particular arc type\";\n    return nullptr;\n  }\n\n  template <class Arc>\n  MutableFst<Arc> *GetMutableFst() {\n    Fst<Arc> *fst = const_cast<Fst<Arc> *>(this->GetFst<Arc>());\n    MutableFst<Arc> *mfst = static_cast<MutableFst<Arc> *>(fst);\n    return mfst;\n  }\n\n  template <class Arc>\n  static MutableFstClass *Read(std::istream &stream,\n                               const FstReadOptions &opts) {\n    std::unique_ptr<MutableFst<Arc>> mfst(MutableFst<Arc>::Read(stream, opts));\n    return mfst ? new MutableFstClass(*mfst) : nullptr;\n  }\n\n protected:\n  explicit MutableFstClass(FstClassImplBase *impl) : FstClass(impl) {}\n};\n\nclass VectorFstClass : public MutableFstClass {\n public:\n  explicit VectorFstClass(FstClassImplBase *impl) : MutableFstClass(impl) {}\n\n  explicit VectorFstClass(const FstClass &other);\n\n  explicit VectorFstClass(const string &arc_type);\n\n  static VectorFstClass *Read(const string &fname);\n\n  template <class Arc>\n  static VectorFstClass *Read(std::istream &stream,\n                              const FstReadOptions &opts) {\n    std::unique_ptr<VectorFst<Arc>> mfst(VectorFst<Arc>::Read(stream, opts));\n    return mfst ? new VectorFstClass(*mfst) : nullptr;\n  }\n\n  template <class Arc>\n  explicit VectorFstClass(const VectorFst<Arc> &fst) : MutableFstClass(fst) {}\n\n  template <class Arc>\n  static FstClassImplBase *Convert(const FstClass &other) {\n    return new FstClassImpl<Arc>(new VectorFst<Arc>(*other.GetFst<Arc>()),\n                                 true);\n  }\n\n  template <class Arc>\n  static FstClassImplBase *Create() {\n    return new FstClassImpl<Arc>(new VectorFst<Arc>(), true);\n  }\n};\n\n}  // namespace script\n}  // namespace fst\n\n#endif  // FST_SCRIPT_FST_CLASS_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/script/fstscript-decl.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Forward declarations for the FST and FST script classes.\n\n#ifndef FST_SCRIPT_FSTSCRIPT_DECL_H_\n#define FST_SCRIPT_FSTSCRIPT_DECL_H_\n\n#include <fst/fst-decl.h>\n\nnamespace fst {\nnamespace script {\n\nclass ArcClass;\n\nclass ArcIteratorClass;\nclass MutableArcIteratorClass;\n\nclass EncodeMapperClass;\n\nclass FstClass;\nclass MutableFstClass;\nclass VectorFstClass;\n\nclass StateIteratorClass;\n\nclass WeightClass;\n\n}  // namespace script\n}  // namespace fst;\n\n#endif  // FST_SCRIPT_FSTSCRIPT_DECL_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/script/fstscript.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// The FST script interface permits users to interact with FSTs without knowing\n// their arc type. It does this by mapping compile-time polymorphism (in the\n// form of a arc-templated FST types) onto a shared virtual interface. It also\n// supports arc extension via a DSO interface. Due to the overhead of virtual\n// dispatch and registered function lookups, the script API is somewhat slower\n// then library API provided by types like StdVectorFst, but has the advantage\n// that it is designed not to crash (and to provide useful debugging\n// information) upon common user errors like passing invalid indices or\n// attempting comparison of incompatible FSTs. It is used both by the FST\n// binaries and the Python extension.\n//\n// This header includes all of the FST script functionality.\n\n#ifndef FST_SCRIPT_FSTSCRIPT_H_\n#define FST_SCRIPT_FSTSCRIPT_H_\n\n// Major classes\n#include <fst/script/arciterator-class.h>\n#include <fst/script/encodemapper-class.h>\n#include <fst/script/fst-class.h>\n#include <fst/script/stateiterator-class.h>\n#include <fst/script/text-io.h>\n#include <fst/script/weight-class.h>\n\n// Flag-to-enum parsers.\n#include <fst/script/getters.h>\n// Templates like Operation<> and Apply<>.\n#include <fst/script/script-impl.h>\n\n// Operations.\n#include <fst/script/arcsort.h>\n#include <fst/script/closure.h>\n#include <fst/script/compile.h>\n#include <fst/script/compose.h>\n#include <fst/script/concat.h>\n#include <fst/script/connect.h>\n#include <fst/script/convert.h>\n#include <fst/script/decode.h>\n#include <fst/script/determinize.h>\n#include <fst/script/difference.h>\n#include <fst/script/disambiguate.h>\n#include <fst/script/draw.h>\n#include <fst/script/encode.h>\n#include <fst/script/epsnormalize.h>\n#include <fst/script/equal.h>\n#include <fst/script/equivalent.h>\n#include <fst/script/info.h>\n#include <fst/script/intersect.h>\n#include <fst/script/invert.h>\n#include <fst/script/isomorphic.h>\n#include <fst/script/map.h>\n#include <fst/script/minimize.h>\n#include <fst/script/print.h>\n#include <fst/script/project.h>\n#include <fst/script/prune.h>\n#include <fst/script/push.h>\n#include <fst/script/randequivalent.h>\n#include <fst/script/randgen.h>\n#include <fst/script/relabel.h>\n#include <fst/script/replace.h>\n#include <fst/script/reverse.h>\n#include <fst/script/reweight.h>\n#include <fst/script/rmepsilon.h>\n#include <fst/script/shortest-distance.h>\n#include <fst/script/shortest-path.h>\n#include <fst/script/synchronize.h>\n#include <fst/script/topsort.h>\n#include <fst/script/union.h>\n#include <fst/script/verify.h>\n\n// This class is necessary because registering each of the operations\n// separately overfills the stack, as there's so many of them.\nnamespace fst {\nnamespace script {\n\ntemplate <class Arc>\nclass AllFstOperationsRegisterer {\n public:\n  AllFstOperationsRegisterer() {\n    RegisterBatch1();\n    RegisterBatch2();\n  }\n\n private:\n  void RegisterBatch1() {\n    REGISTER_FST_OPERATION(ArcSort, Arc, ArcSortArgs);\n    REGISTER_FST_OPERATION(Closure, Arc, ClosureArgs);\n    REGISTER_FST_OPERATION(CompileFstInternal, Arc, CompileFstArgs);\n    REGISTER_FST_OPERATION(Compose, Arc, ComposeArgs);\n    REGISTER_FST_OPERATION(Concat, Arc, ConcatArgs1);\n    REGISTER_FST_OPERATION(Concat, Arc, ConcatArgs2);\n    REGISTER_FST_OPERATION(Connect, Arc, MutableFstClass);\n    REGISTER_FST_OPERATION(Convert, Arc, ConvertArgs);\n    REGISTER_FST_OPERATION(Decode, Arc, DecodeArgs1);\n    REGISTER_FST_OPERATION(Decode, Arc, DecodeArgs2);\n    REGISTER_FST_OPERATION(Determinize, Arc, DeterminizeArgs);\n    REGISTER_FST_OPERATION(Difference, Arc, DifferenceArgs);\n    REGISTER_FST_OPERATION(Disambiguate, Arc, DisambiguateArgs);\n    REGISTER_FST_OPERATION(DrawFst, Arc, FstDrawerArgs);\n    REGISTER_FST_OPERATION(Encode, Arc, EncodeArgs1);\n    REGISTER_FST_OPERATION(Encode, Arc, EncodeArgs2);\n    REGISTER_FST_OPERATION(EpsNormalize, Arc, EpsNormalizeArgs);\n    REGISTER_FST_OPERATION(Equal, Arc, EqualArgs);\n    REGISTER_FST_OPERATION(Equivalent, Arc, EquivalentArgs);\n    REGISTER_FST_OPERATION(PrintFstInfo, Arc, InfoArgs);\n    REGISTER_FST_OPERATION(GetFstInfo, Arc, GetInfoArgs);\n    REGISTER_FST_OPERATION(InitArcIteratorClass, Arc,\n                           InitArcIteratorClassArgs);\n    REGISTER_FST_OPERATION(InitEncodeMapperClass, Arc,\n                           InitEncodeMapperClassArgs);\n    REGISTER_FST_OPERATION(InitMutableArcIteratorClass, Arc,\n                           InitMutableArcIteratorClassArgs);\n    REGISTER_FST_OPERATION(InitStateIteratorClass, Arc,\n                           InitStateIteratorClassArgs);\n  }\n\n  void RegisterBatch2() {\n    REGISTER_FST_OPERATION(Intersect, Arc, IntersectArgs);\n    REGISTER_FST_OPERATION(Invert, Arc, MutableFstClass);\n    REGISTER_FST_OPERATION(Map, Arc, MapArgs);\n    REGISTER_FST_OPERATION(Minimize, Arc, MinimizeArgs);\n    REGISTER_FST_OPERATION(PrintFst, Arc, FstPrinterArgs);\n    REGISTER_FST_OPERATION(Project, Arc, ProjectArgs);\n    REGISTER_FST_OPERATION(Prune, Arc, PruneArgs1);\n    REGISTER_FST_OPERATION(Prune, Arc, PruneArgs2);\n    REGISTER_FST_OPERATION(Push, Arc, PushArgs1);\n    REGISTER_FST_OPERATION(Push, Arc, PushArgs2);\n    REGISTER_FST_OPERATION(RandEquivalent, Arc, RandEquivalentArgs);\n    REGISTER_FST_OPERATION(RandGen, Arc, RandGenArgs);\n    REGISTER_FST_OPERATION(Relabel, Arc, RelabelArgs1);\n    REGISTER_FST_OPERATION(Relabel, Arc, RelabelArgs2);\n    REGISTER_FST_OPERATION(Replace, Arc, ReplaceArgs);\n    REGISTER_FST_OPERATION(Reverse, Arc, ReverseArgs);\n    REGISTER_FST_OPERATION(Reweight, Arc, ReweightArgs);\n    REGISTER_FST_OPERATION(RmEpsilon, Arc, RmEpsilonArgs);\n    REGISTER_FST_OPERATION(ShortestDistance, Arc, ShortestDistanceArgs1);\n    REGISTER_FST_OPERATION(ShortestDistance, Arc, ShortestDistanceArgs2);\n    REGISTER_FST_OPERATION(ShortestPath, Arc, ShortestPathArgs);\n    REGISTER_FST_OPERATION(Synchronize, Arc, SynchronizeArgs);\n    REGISTER_FST_OPERATION(TopSort, Arc, TopSortArgs);\n    REGISTER_FST_OPERATION(Union, Arc, UnionArgs);\n    REGISTER_FST_OPERATION(Verify, Arc, VerifyArgs);\n  }\n};\n\n}  // namespace script\n}  // namespace fst\n\n#define REGISTER_FST_OPERATIONS(Arc) \\\n  AllFstOperationsRegisterer<Arc> register_all_fst_operations##Arc;\n\n#endif  // FST_SCRIPT_FSTSCRIPT_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/script/getters.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Getters for converting command-line arguments into the appropriate enums\n// or bitmasks, with the simplest ones defined as inline.\n\n#ifndef FST_SCRIPT_GETTERS_H_\n#define FST_SCRIPT_GETTERS_H_\n\n#include <string>\n\n#include <fst/compose.h>          // For ComposeFilter.\n#include <fst/determinize.h>      // For DeterminizeType.\n#include <fst/encode.h>           // For kEncodeLabels (etc.).\n#include <fst/epsnormalize.h>     // For EpsNormalizeType.\n#include <fst/project.h>          // For ProjectType.\n#include <fst/push.h>             // For kPushWeights (etc.).\n#include <fst/queue.h>            // For QueueType.\n#include <fst/rational.h>         // For ClosureType.\n#include <fst/script/arcsort.h>       // For ArcSortType.\n#include <fst/script/map.h>           // For MapType.\n#include <fst/script/script-impl.h>   // For RandArcSelection.\n\n#include <fst/log.h>\n\nnamespace fst {\nnamespace script {\n\nbool GetArcSortType(const string &str, ArcSortType *sort_type);\n\ninline ClosureType GetClosureType(bool closure_plus) {\n  return closure_plus ? CLOSURE_PLUS : CLOSURE_STAR;\n}\n\nbool GetComposeFilter(const string &str, ComposeFilter *compose_filter);\n\nbool GetDeterminizeType(const string &str, DeterminizeType *det_type);\n\ninline uint32 GetEncodeFlags(bool encode_labels, bool encode_weights) {\n  return (encode_labels ? kEncodeLabels : 0) |\n         (encode_weights ? kEncodeWeights : 0);\n}\n\ninline EpsNormalizeType GetEpsNormalizeType(bool eps_norm_output) {\n  return eps_norm_output ? EPS_NORM_OUTPUT : EPS_NORM_INPUT;\n}\n\nbool GetMapType(const string &str, MapType *map_type);\n\ninline ProjectType GetProjectType(bool project_output) {\n  return project_output ? PROJECT_OUTPUT : PROJECT_INPUT;\n}\n\ninline uint32 GetPushFlags(bool push_weights, bool push_labels,\n                           bool remove_total_weight, bool remove_common_affix) {\n  return ((push_weights ? kPushWeights : 0) |\n          (push_labels ? kPushLabels : 0) |\n          (remove_total_weight ? kPushRemoveTotalWeight : 0) |\n          (remove_common_affix ? kPushRemoveCommonAffix : 0));\n}\n\nbool GetQueueType(const string &str, QueueType *queue_type);\n\nbool GetRandArcSelection(const string &str, RandArcSelection *ras);\n\nbool GetReplaceLabelType(const string &str, bool epsilon_on_replace,\n                         ReplaceLabelType *rlt);\n\ninline ReweightType GetReweightType(bool to_final) {\n  return to_final ? REWEIGHT_TO_FINAL : REWEIGHT_TO_INITIAL;\n}\n\n}  // namespace script\n}  // namespace fst\n\n#endif  // FST_SCRIPT_GETTERS_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/script/info-impl.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Class to compute various information about FSTs, a helper class for\n// fstinfo.cc.\n\n#ifndef FST_SCRIPT_INFO_IMPL_H_\n#define FST_SCRIPT_INFO_IMPL_H_\n\n#include <map>\n#include <string>\n#include <vector>\n\n#include <fst/connect.h>\n#include <fst/dfs-visit.h>\n#include <fst/fst.h>\n#include <fst/lookahead-matcher.h>\n#include <fst/matcher.h>\n#include <fst/queue.h>\n#include <fst/test-properties.h>\n#include <fst/verify.h>\n#include <fst/visit.h>\n\nnamespace fst {\n\n// Compute various information about FSTs, helper class for fstinfo.cc.\n// WARNING: Stand-alone use of this class is not recommended, most code\n// should call directly the relevant library functions: Fst<Arc>::NumStates,\n// Fst<Arc>::NumArcs, TestProperties, etc.\nclass FstInfo {\n public:\n  FstInfo() {}\n\n  // When info_type is \"short\" (or \"auto\" and not an ExpandedFst) then only\n  // minimal info is computed and can be requested.\n  template <typename Arc>\n  FstInfo(const Fst<Arc> &fst, bool test_properties,\n          const string &arc_filter_type = \"any\",\n          const string &info_type = \"auto\", bool verify = true)\n      : fst_type_(fst.Type()),\n        input_symbols_(fst.InputSymbols() ? fst.InputSymbols()->Name()\n                                          : \"none\"),\n        output_symbols_(fst.OutputSymbols() ? fst.OutputSymbols()->Name()\n                                            : \"none\"),\n        nstates_(0),\n        narcs_(0),\n        start_(kNoStateId),\n        nfinal_(0),\n        nepsilons_(0),\n        niepsilons_(0),\n        noepsilons_(0),\n        ilabel_mult_(0.0),\n        olabel_mult_(0.0),\n        naccess_(0),\n        ncoaccess_(0),\n        nconnect_(0),\n        ncc_(0),\n        nscc_(0),\n        input_match_type_(MATCH_NONE),\n        output_match_type_(MATCH_NONE),\n        input_lookahead_(false),\n        output_lookahead_(false),\n        properties_(0),\n        arc_filter_type_(arc_filter_type),\n        long_info_(true),\n        arc_type_(Arc::Type()) {\n    using Label = typename Arc::Label;\n    using StateId = typename Arc::StateId;\n    using Weight = typename Arc::Weight;\n    if (info_type == \"long\") {\n      long_info_ = true;\n    } else if (info_type == \"short\") {\n      long_info_ = false;\n    } else if (info_type == \"auto\") {\n      long_info_ = fst.Properties(kExpanded, false);\n    } else {\n      FSTERROR() << \"Bad info type: \" << info_type;\n      return;\n    }\n    if (!long_info_) return;\n    // If the FST is not sane, we return.\n    if (verify && !Verify(fst)) {\n      FSTERROR() << \"FstInfo: Verify: FST not well-formed\";\n      return;\n    }\n    start_ = fst.Start();\n    properties_ = fst.Properties(kFstProperties, test_properties);\n    for (StateIterator<Fst<Arc>> siter(fst); !siter.Done(); siter.Next()) {\n      ++nstates_;\n      const auto s = siter.Value();\n      if (fst.Final(s) != Weight::Zero()) ++nfinal_;\n      std::map<Label, size_t> ilabel_count;\n      std::map<Label, size_t> olabel_count;\n      for (ArcIterator<Fst<Arc>> aiter(fst, s); !aiter.Done(); aiter.Next()) {\n        const auto &arc = aiter.Value();\n        ++narcs_;\n        if (arc.ilabel == 0 && arc.olabel == 0) ++nepsilons_;\n        if (arc.ilabel == 0) ++niepsilons_;\n        if (arc.olabel == 0) ++noepsilons_;\n        ++ilabel_count[arc.ilabel];\n        ++olabel_count[arc.olabel];\n      }\n      for (auto it = ilabel_count.begin(); it != ilabel_count.end(); ++it) {\n        ilabel_mult_ += it->second * it->second;\n      }\n      for (auto it = olabel_count.begin(); it != olabel_count.end(); ++it) {\n        olabel_mult_ += it->second * it->second;\n      }\n    }\n    if (narcs_ > 0) {\n      ilabel_mult_ /= narcs_;\n      olabel_mult_ /= narcs_;\n    }\n    {\n      std::vector<StateId> cc;\n      CcVisitor<Arc> cc_visitor(&cc);\n      FifoQueue<StateId> fifo_queue;\n      if (arc_filter_type == \"any\") {\n        Visit(fst, &cc_visitor, &fifo_queue);\n      } else if (arc_filter_type == \"epsilon\") {\n        Visit(fst, &cc_visitor, &fifo_queue, EpsilonArcFilter<Arc>());\n      } else if (arc_filter_type == \"iepsilon\") {\n        Visit(fst, &cc_visitor, &fifo_queue, InputEpsilonArcFilter<Arc>());\n      } else if (arc_filter_type == \"oepsilon\") {\n        Visit(fst, &cc_visitor, &fifo_queue, OutputEpsilonArcFilter<Arc>());\n      } else {\n        FSTERROR() << \"Bad arc filter type: \" << arc_filter_type;\n        return;\n      }\n      for (StateId s = 0; s < cc.size(); ++s) {\n        if (cc[s] >= ncc_) ncc_ = cc[s] + 1;\n      }\n    }\n    {\n      std::vector<StateId> scc;\n      std::vector<bool> access, coaccess;\n      uint64 props = 0;\n      SccVisitor<Arc> scc_visitor(&scc, &access, &coaccess, &props);\n      if (arc_filter_type == \"any\") {\n        DfsVisit(fst, &scc_visitor);\n      } else if (arc_filter_type == \"epsilon\") {\n        DfsVisit(fst, &scc_visitor, EpsilonArcFilter<Arc>());\n      } else if (arc_filter_type == \"iepsilon\") {\n        DfsVisit(fst, &scc_visitor, InputEpsilonArcFilter<Arc>());\n      } else if (arc_filter_type == \"oepsilon\") {\n        DfsVisit(fst, &scc_visitor, OutputEpsilonArcFilter<Arc>());\n      } else {\n        FSTERROR() << \"Bad arc filter type: \" << arc_filter_type;\n        return;\n      }\n      for (StateId s = 0; s < scc.size(); ++s) {\n        if (access[s]) ++naccess_;\n        if (coaccess[s]) ++ncoaccess_;\n        if (access[s] && coaccess[s]) ++nconnect_;\n        if (scc[s] >= nscc_) nscc_ = scc[s] + 1;\n      }\n    }\n    LookAheadMatcher<Fst<Arc>> imatcher(fst, MATCH_INPUT);\n    input_match_type_ = imatcher.Type(test_properties);\n    input_lookahead_ = imatcher.Flags() & kInputLookAheadMatcher;\n    LookAheadMatcher<Fst<Arc>> omatcher(fst, MATCH_OUTPUT);\n    output_match_type_ = omatcher.Type(test_properties);\n    output_lookahead_ = omatcher.Flags() & kOutputLookAheadMatcher;\n  }\n\n  // Short info.\n\n  const string &FstType() const { return fst_type_; }\n\n  const string &ArcType() const { return arc_type_; }\n\n  const string &InputSymbols() const { return input_symbols_; }\n\n  const string &OutputSymbols() const { return output_symbols_; }\n\n  bool LongInfo() const { return long_info_; }\n\n  const string &ArcFilterType() const { return arc_filter_type_; }\n\n  // Long info.\n\n  MatchType InputMatchType() const {\n    CheckLong();\n    return input_match_type_;\n  }\n\n  MatchType OutputMatchType() const {\n    CheckLong();\n    return output_match_type_;\n  }\n\n  bool InputLookAhead() const {\n    CheckLong();\n    return input_lookahead_;\n  }\n\n  bool OutputLookAhead() const {\n    CheckLong();\n    return output_lookahead_;\n  }\n\n  int64 NumStates() const {\n    CheckLong();\n    return nstates_;\n  }\n\n  size_t NumArcs() const {\n    CheckLong();\n    return narcs_;\n  }\n\n  int64 Start() const {\n    CheckLong();\n    return start_;\n  }\n\n  size_t NumFinal() const {\n    CheckLong();\n    return nfinal_;\n  }\n\n  size_t NumEpsilons() const {\n    CheckLong();\n    return nepsilons_;\n  }\n\n  size_t NumInputEpsilons() const {\n    CheckLong();\n    return niepsilons_;\n  }\n\n  size_t NumOutputEpsilons() const {\n    CheckLong();\n    return noepsilons_;\n  }\n\n  double InputLabelMultiplicity() const {\n    CheckLong();\n    return ilabel_mult_;\n  }\n\n  double OutputLabelMultiplicity() const {\n    CheckLong();\n    return olabel_mult_;\n  }\n\n  size_t NumAccessible() const {\n    CheckLong();\n    return naccess_;\n  }\n\n  size_t NumCoAccessible() const {\n    CheckLong();\n    return ncoaccess_;\n  }\n\n  size_t NumConnected() const {\n    CheckLong();\n    return nconnect_;\n  }\n\n  size_t NumCc() const {\n    CheckLong();\n    return ncc_;\n  }\n\n  size_t NumScc() const {\n    CheckLong();\n    return nscc_;\n  }\n\n  uint64 Properties() const {\n    CheckLong();\n    return properties_;\n  }\n\n private:\n  void CheckLong() const {\n    if (!long_info_)\n      FSTERROR() << \"FstInfo: Method only available with long info signature\";\n  }\n\n  string fst_type_;\n  string input_symbols_;\n  string output_symbols_;\n  int64 nstates_;\n  size_t narcs_;\n  int64 start_;\n  size_t nfinal_;\n  size_t nepsilons_;\n  size_t niepsilons_;\n  size_t noepsilons_;\n  double ilabel_mult_;\n  double olabel_mult_;\n  size_t naccess_;\n  size_t ncoaccess_;\n  size_t nconnect_;\n  size_t ncc_;\n  size_t nscc_;\n  MatchType input_match_type_;\n  MatchType output_match_type_;\n  bool input_lookahead_;\n  bool output_lookahead_;\n  uint64 properties_;\n  string arc_filter_type_;\n  bool long_info_;\n  string arc_type_;\n};\n\nvoid PrintFstInfoImpl(const FstInfo &fstinfo, bool pipe = false);\n\n}  // namespace fst\n\n#endif  // FST_SCRIPT_INFO_IMPL_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/script/info.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#ifndef FST_SCRIPT_INFO_H_\n#define FST_SCRIPT_INFO_H_\n\n#include <string>\n#include <tuple>\n\n#include <fst/script/arg-packs.h>\n#include <fst/script/fst-class.h>\n#include <fst/script/info-impl.h>\n\nnamespace fst {\nnamespace script {\n\nusing InfoArgs = std::tuple<const FstClass &, bool, const string &,\n                            const string &, bool, bool>;\n\ntemplate <class Arc>\nvoid PrintFstInfo(InfoArgs *args) {\n  const Fst<Arc> &fst = *(std::get<0>(*args).GetFst<Arc>());\n  const FstInfo fstinfo(fst, std::get<1>(*args), std::get<2>(*args),\n                        std::get<3>(*args), std::get<4>(*args));\n  PrintFstInfoImpl(fstinfo, std::get<5>(*args));\n  if (std::get<5>(*args)) fst.Write(\"\");\n}\n\nvoid PrintFstInfo(const FstClass &f, bool test_properties,\n                  const string &arc_filter, const string &info_type, bool pipe,\n                  bool verify);\n\nusing GetInfoArgs = std::tuple<const FstClass &, bool, const string &,\n                               const string &, bool, FstInfo *>;\n\ntemplate <class Arc>\nvoid GetFstInfo(GetInfoArgs *args) {\n  const Fst<Arc> &fst = *(std::get<0>(*args).GetFst<Arc>());\n  *(std::get<5>(*args)) = FstInfo(fst, std::get<1>(*args), std::get<2>(*args),\n                                  std::get<3>(*args), std::get<4>(*args));\n}\n\nvoid GetFstInfo(const FstClass &fst, bool test_properties,\n                const string &arc_filter, const string &info_type, bool verify,\n                FstInfo *info);\n\n}  // namespace script\n}  // namespace fst\n\n#endif  // FST_SCRIPT_INFO_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/script/intersect.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#ifndef FST_SCRIPT_INTERSECT_H_\n#define FST_SCRIPT_INTERSECT_H_\n\n#include <tuple>\n\n#include <fst/intersect.h>\n#include <fst/script/compose.h>\n#include <fst/script/fst-class.h>\n\nnamespace fst {\nnamespace script {\n\nusing IntersectArgs = std::tuple<const FstClass &, const FstClass &,\n                                 MutableFstClass *, const ComposeOptions &>;\n\ntemplate <class Arc>\nvoid Intersect(IntersectArgs *args) {\n  const Fst<Arc> &ifst1 = *(std::get<0>(*args).GetFst<Arc>());\n  const Fst<Arc> &ifst2 = *(std::get<1>(*args).GetFst<Arc>());\n  MutableFst<Arc> *ofst = std::get<2>(*args)->GetMutableFst<Arc>();\n  const auto &opts = std::get<3>(*args);\n  Intersect(ifst1, ifst2, ofst, opts);\n}\n\nvoid Intersect(const FstClass &ifst, const FstClass &ifst2,\n               MutableFstClass *ofst,\n               const ComposeOptions &opts = ComposeOptions());\n\n}  // namespace script\n}  // namespace fst\n\n#endif  // FST_SCRIPT_INTERSECT_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/script/invert.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#ifndef FST_SCRIPT_INVERT_H_\n#define FST_SCRIPT_INVERT_H_\n\n#include <fst/invert.h>\n#include <fst/script/fst-class.h>\n\nnamespace fst {\nnamespace script {\n\ntemplate <class Arc>\nvoid Invert(MutableFstClass *fst) {\n  Invert(fst->GetMutableFst<Arc>());\n}\n\nvoid Invert(MutableFstClass *fst);\n\n}  // namespace script\n}  // namespace fst\n\n#endif  // FST_SCRIPT_INVERT_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/script/isomorphic.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#ifndef FST_SCRIPT_ISOMORPHIC_H_\n#define FST_SCRIPT_ISOMORPHIC_H_\n\n#include <tuple>\n\n#include <fst/isomorphic.h>\n#include <fst/script/arg-packs.h>\n#include <fst/script/fst-class.h>\n\nnamespace fst {\nnamespace script {\n\nusing IsomorphicInnerArgs = std::tuple<const FstClass &, const FstClass &,\n                                       float>;\n\nusing IsomorphicArgs = WithReturnValue<bool, IsomorphicInnerArgs>;\n\ntemplate <class Arc>\nvoid Isomorphic(IsomorphicArgs *args) {\n  const Fst<Arc> &fst1 = *(std::get<0>(args->args).GetFst<Arc>());\n  const Fst<Arc> &fst2 = *(std::get<1>(args->args).GetFst<Arc>());\n  args->retval = Isomorphic(fst1, fst2, std::get<2>(args->args));\n}\n\nbool Isomorphic(const FstClass &fst1, const FstClass &fst2,\n                float delta = kDelta);\n\n}  // namespace script\n}  // namespace fst\n\n#endif  // FST_SCRIPT_ISOMORPHIC_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/script/map.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#ifndef FST_SCRIPT_MAP_H_\n#define FST_SCRIPT_MAP_H_\n\n#include <memory>\n#include <tuple>\n\n#include <fst/arc-map.h>\n#include <fst/state-map.h>\n#include <fst/script/arg-packs.h>\n#include <fst/script/fst-class.h>\n#include <fst/script/weight-class.h>\n\nnamespace fst {\nnamespace script {\n\ntemplate <class M>\nFst<typename M::ToArc> *ArcMap(const Fst<typename M::FromArc> &fst,\n                               const M &mapper) {\n  using ToArc = typename M::ToArc;\n  auto *ofst = new VectorFst<ToArc>;\n  ArcMap(fst, ofst, mapper);\n  return ofst;\n}\n\ntemplate <class M>\nFst<typename M::ToArc> *StateMap(const Fst<typename M::FromArc> &fst,\n                                 const M &mapper) {\n  using ToArc = typename M::ToArc;\n  auto *ofst = new VectorFst<ToArc>;\n  StateMap(fst, ofst, mapper);\n  return ofst;\n}\n\nenum MapType {\n  ARC_SUM_MAPPER,\n  ARC_UNIQUE_MAPPER,\n  IDENTITY_MAPPER,\n  INPUT_EPSILON_MAPPER,\n  INVERT_MAPPER,\n  OUTPUT_EPSILON_MAPPER,\n  PLUS_MAPPER,\n  POWER_MAPPER,\n  QUANTIZE_MAPPER,\n  RMWEIGHT_MAPPER,\n  SUPERFINAL_MAPPER,\n  TIMES_MAPPER,\n  TO_LOG_MAPPER,\n  TO_LOG64_MAPPER,\n  TO_STD_MAPPER\n};\n\nusing MapInnerArgs =\n    std::tuple<const FstClass &, MapType, float, double, const WeightClass &>;\n\nusing MapArgs = WithReturnValue<FstClass *, MapInnerArgs>;\n\ntemplate <class Arc>\nvoid Map(MapArgs *args) {\n  using Weight = typename Arc::Weight;\n  const Fst<Arc> &ifst = *(std::get<0>(args->args).GetFst<Arc>());\n  const auto map_type = std::get<1>(args->args);\n  switch (map_type) {\n    case ARC_SUM_MAPPER: {\n      std::unique_ptr<Fst<Arc>> ofst(StateMap(ifst, ArcSumMapper<Arc>(ifst)));\n      args->retval = new FstClass(*ofst);\n      return;\n    }\n    case ARC_UNIQUE_MAPPER: {\n      std::unique_ptr<Fst<Arc>> ofst(\n          StateMap(ifst, ArcUniqueMapper<Arc>(ifst)));\n      args->retval = new FstClass(*ofst);\n      return;\n    }\n    case IDENTITY_MAPPER: {\n      std::unique_ptr<Fst<Arc>> ofst(ArcMap(ifst, IdentityArcMapper<Arc>()));\n      args->retval = new FstClass(*ofst);\n      return;\n    }\n    case INPUT_EPSILON_MAPPER: {\n      std::unique_ptr<Fst<Arc>> ofst(ArcMap(ifst, InputEpsilonMapper<Arc>()));\n      args->retval = new FstClass(*ofst);\n      return;\n    }\n    case INVERT_MAPPER: {\n      std::unique_ptr<Fst<Arc>> ofst(ArcMap(ifst, InvertWeightMapper<Arc>()));\n      args->retval = new FstClass(*ofst);\n      return;\n    }\n    case OUTPUT_EPSILON_MAPPER: {\n      std::unique_ptr<Fst<Arc>> ofst(ArcMap(ifst, OutputEpsilonMapper<Arc>()));\n      args->retval = new FstClass(*ofst);\n      return;\n    }\n    case PLUS_MAPPER: {\n      const auto weight = *(std::get<4>(args->args).GetWeight<Weight>());\n      std::unique_ptr<Fst<Arc>> ofst(ArcMap(ifst, PlusMapper<Arc>(weight)));\n      args->retval = new FstClass(*ofst);\n      return;\n    }\n    case POWER_MAPPER: {\n      const auto power = std::get<3>(args->args);\n      std::unique_ptr<Fst<Arc>> ofst(ArcMap(ifst, PowerMapper<Arc>(power)));\n      args->retval = new FstClass(*ofst);\n      return;\n    }\n    case QUANTIZE_MAPPER: {\n      const auto delta = std::get<2>(args->args);\n      std::unique_ptr<Fst<Arc>> ofst(ArcMap(ifst, QuantizeMapper<Arc>(delta)));\n      args->retval = new FstClass(*ofst);\n      return;\n    }\n    case RMWEIGHT_MAPPER: {\n      std::unique_ptr<Fst<Arc>> ofst(ArcMap(ifst, RmWeightMapper<Arc>()));\n      args->retval = new FstClass(*ofst);\n      return;\n    }\n    case SUPERFINAL_MAPPER: {\n      std::unique_ptr<Fst<Arc>> ofst(ArcMap(ifst, SuperFinalMapper<Arc>()));\n      args->retval = new FstClass(*ofst);\n      return;\n    }\n    case TIMES_MAPPER: {\n      const auto weight = *(std::get<4>(args->args).GetWeight<Weight>());\n      std::unique_ptr<Fst<Arc>> ofst(ArcMap(ifst, TimesMapper<Arc>(weight)));\n      args->retval = new FstClass(*ofst);\n      return;\n    }\n    case TO_LOG_MAPPER: {\n      std::unique_ptr<Fst<LogArc>> ofst(\n          ArcMap(ifst, WeightConvertMapper<Arc, LogArc>()));\n      args->retval = new FstClass(*ofst);\n      return;\n    }\n    case TO_LOG64_MAPPER: {\n      std::unique_ptr<Fst<Log64Arc>> ofst(\n          ArcMap(ifst, WeightConvertMapper<Arc, Log64Arc>()));\n      args->retval = new FstClass(*ofst);\n      return;\n    }\n    case TO_STD_MAPPER: {\n      std::unique_ptr<Fst<StdArc>> ofst(\n          ArcMap(ifst, WeightConvertMapper<Arc, StdArc>()));\n      args->retval = new FstClass(*ofst);\n      return;\n    }\n  }\n}\n\nFstClass *Map(const FstClass &ifst, MapType map_type, float delta, double power,\n              const WeightClass &weight);\n\n}  // namespace script\n}  // namespace fst\n\n#endif  // FST_SCRIPT_MAP_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/script/minimize.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#ifndef FST_SCRIPT_MINIMIZE_H_\n#define FST_SCRIPT_MINIMIZE_H_\n\n#include <tuple>\n\n#include <fst/minimize.h>\n#include <fst/script/fst-class.h>\n\nnamespace fst {\nnamespace script {\n\nusing MinimizeArgs = std::tuple<MutableFstClass *, MutableFstClass *, float,\n                                bool>;\n\ntemplate <class Arc>\nvoid Minimize(MinimizeArgs *args) {\n  MutableFst<Arc> *ofst1 = std::get<0>(*args)->GetMutableFst<Arc>();\n  MutableFst<Arc> *ofst2 = (std::get<1>(*args) ?\n                            std::get<1>(*args)->GetMutableFst<Arc>() :\n                            nullptr);\n  Minimize(ofst1, ofst2, std::get<2>(*args), std::get<3>(*args));\n}\n\nvoid Minimize(MutableFstClass *ofst1, MutableFstClass *ofst2 = nullptr,\n              float delta = kShortestDelta, bool allow_nondet = false);\n\n}  // namespace script\n}  // namespace fst\n\n#endif  // FST_SCRIPT_MINIMIZE_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/script/print-impl.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Stand-alone class to print out binary FSTs in the AT&T format, a helper\n// class for fstprint.cc.\n\n#ifndef FST_SCRIPT_PRINT_IMPL_H_\n#define FST_SCRIPT_PRINT_IMPL_H_\n\n#include <ostream>\n#include <sstream>\n#include <string>\n\n#include <fst/fstlib.h>\n#include <fst/util.h>\n\nDECLARE_string(fst_field_separator);\n\nnamespace fst {\n\n// Print a binary FST in textual format (helper class for fstprint.cc).\n// WARNING: Stand-alone use of this class not recommended, most code should\n// read/write using the binary format which is much more efficient.\ntemplate <class Arc>\nclass FstPrinter {\n public:\n  using StateId = typename Arc::StateId;\n  using Label = typename Arc::Label;\n  using Weight = typename Arc::Weight;\n\n  FstPrinter(const Fst<Arc> &fst, const SymbolTable *isyms,\n             const SymbolTable *osyms, const SymbolTable *ssyms, bool accep,\n             bool show_weight_one, const string &field_separator,\n             const string &missing_symbol = \"\")\n      : fst_(fst),\n        isyms_(isyms),\n        osyms_(osyms),\n        ssyms_(ssyms),\n        accep_(accep && fst.Properties(kAcceptor, true)),\n        ostrm_(nullptr),\n        show_weight_one_(show_weight_one),\n        sep_(field_separator),\n        missing_symbol_(missing_symbol) {}\n\n  // Prints FST to an output stream.\n  void Print(std::ostream *ostrm, const string &dest) {\n    ostrm_ = ostrm;\n    dest_ = dest;\n    const auto start = fst_.Start();\n    if (start == kNoStateId) return;\n    // Initial state first.\n    PrintState(start);\n    for (StateIterator<Fst<Arc>> siter(fst_); !siter.Done(); siter.Next()) {\n      const auto s = siter.Value();\n      if (s != start) PrintState(s);\n    }\n  }\n\n private:\n  void PrintId(StateId id, const SymbolTable *syms, const char *name) const {\n    if (syms) {\n      string symbol = syms->Find(id);\n      if (symbol.empty()) {\n        if (missing_symbol_.empty()) {\n          FSTERROR() << \"FstPrinter: Integer \" << id\n                     << \" is not mapped to any textual symbol\"\n                     << \", symbol table = \" << syms->Name()\n                     << \", destination = \" << dest_;\n          symbol = \"?\";\n        } else {\n          symbol = missing_symbol_;\n        }\n      }\n      *ostrm_ << symbol;\n    } else {\n      *ostrm_ << id;\n    }\n  }\n\n  void PrintStateId(StateId s) const { PrintId(s, ssyms_, \"state ID\"); }\n\n  void PrintILabel(Label l) const { PrintId(l, isyms_, \"arc input label\"); }\n\n  void PrintOLabel(Label l) const { PrintId(l, osyms_, \"arc output label\"); }\n\n  void PrintState(StateId s) const {\n    bool output = false;\n    for (ArcIterator<Fst<Arc>> aiter(fst_, s); !aiter.Done(); aiter.Next()) {\n      const auto &arc = aiter.Value();\n      PrintStateId(s);\n      *ostrm_ << sep_;\n      PrintStateId(arc.nextstate);\n      *ostrm_ << sep_;\n      PrintILabel(arc.ilabel);\n      if (!accep_) {\n        *ostrm_ << sep_;\n        PrintOLabel(arc.olabel);\n      }\n      if (show_weight_one_ || arc.weight != Weight::One())\n        *ostrm_ << sep_ << arc.weight;\n      *ostrm_ << \"\\n\";\n      output = true;\n    }\n    const auto weight = fst_.Final(s);\n    if (weight != Weight::Zero() || !output) {\n      PrintStateId(s);\n      if (show_weight_one_ || weight != Weight::One()) {\n        *ostrm_ << sep_ << weight;\n      }\n      *ostrm_ << \"\\n\";\n    }\n  }\n\n  const Fst<Arc> &fst_;\n  const SymbolTable *isyms_;  // ilabel symbol table.\n  const SymbolTable *osyms_;  // olabel symbol table.\n  const SymbolTable *ssyms_;  // slabel symbol table.\n  bool accep_;                // Print as acceptor when possible?\n  std::ostream *ostrm_;       // Text FST destination.\n  string dest_;               // Text FST destination name.\n  bool show_weight_one_;      // Print weights equal to Weight::One()?\n  string sep_;                // Separator character between fields.\n  string missing_symbol_;     // Symbol to print when lookup fails (default\n                              // \"\" means raise error).\n                              //\n  FstPrinter(const FstPrinter &) = delete;\n  FstPrinter &operator=(const FstPrinter &) = delete;\n};\n\n}  // namespace fst\n\n#endif  // FST_SCRIPT_PRINT_IMPL_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/script/print.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#ifndef FST_SCRIPT_PRINT_H_\n#define FST_SCRIPT_PRINT_H_\n\n#include <ostream>\n\n#include <fst/flags.h>\n#include <fst/script/fst-class.h>\n#include <fst/script/print-impl.h>\n\nDECLARE_string(fst_field_separator);\n\nnamespace fst {\nnamespace script {\n\n// Note: it is safe to pass these strings as references because\n// this struct is only used to pass them deeper in the call graph.\n// Be sure you understand why this is so before using this struct\n// for anything else!\nstruct FstPrinterArgs {\n  const FstClass &fst;\n  const SymbolTable *isyms;\n  const SymbolTable *osyms;\n  const SymbolTable *ssyms;\n  const bool accept;\n  const bool show_weight_one;\n  std::ostream *ostrm;\n  const string &dest;\n  const string &sep;  // NOLINT\n  const string &missing_symbol;\n\n  FstPrinterArgs(const FstClass &fst, const SymbolTable *isyms,\n                 const SymbolTable *osyms, const SymbolTable *ssyms,\n                 bool accept, bool show_weight_one, std::ostream *ostrm,\n                 const string &dest, const string &sep,\n                 const string &missing_sym = \"\")\n      : fst(fst),\n        isyms(isyms),\n        osyms(osyms),\n        ssyms(ssyms),\n        accept(accept),\n        show_weight_one(show_weight_one),\n        ostrm(ostrm),\n        dest(dest),\n        sep(sep),\n        missing_symbol(missing_sym) {}\n};\n\ntemplate <class Arc>\nvoid PrintFst(FstPrinterArgs *args) {\n  const Fst<Arc> &fst = *(args->fst.GetFst<Arc>());\n  FstPrinter<Arc> fstprinter(fst, args->isyms, args->osyms, args->ssyms,\n                             args->accept, args->show_weight_one, args->sep,\n                             args->missing_symbol);\n  fstprinter.Print(args->ostrm, args->dest);\n}\n\nvoid PrintFst(const FstClass &fst, std::ostream &ostrm, const string &dest,\n              const SymbolTable *isyms, const SymbolTable *osyms,\n              const SymbolTable *ssyms, bool accept, bool show_weight_one,\n              const string &missing_sym = \"\");\n\n// The same, but with more sensible defaults.\ntemplate <class Arc>\nvoid PrintFst(const Fst<Arc> &fst, std::ostream &ostrm, const string &dest = \"\",\n              const SymbolTable *isyms = nullptr,\n              const SymbolTable *osyms = nullptr,\n              const SymbolTable *ssyms = nullptr) {\n  const string sep = FLAGS_fst_field_separator.substr(0, 1);\n  FstPrinter<Arc> fstprinter(fst, isyms, osyms, ssyms, true, true, sep);\n  fstprinter.Print(&ostrm, dest);\n}\n\n}  // namespace script\n}  // namespace fst\n\n#endif  // FST_SCRIPT_PRINT_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/script/project.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#ifndef FST_SCRIPT_PROJECT_H_\n#define FST_SCRIPT_PROJECT_H_\n\n#include <utility>\n\n#include <fst/project.h>\n#include <fst/script/fst-class.h>\n\nnamespace fst {\nnamespace script {\n\nusing ProjectArgs = std::pair<MutableFstClass *, ProjectType>;\n\ntemplate <class Arc>\nvoid Project(ProjectArgs *args) {\n  MutableFst<Arc> *fst = std::get<0>(*args)->GetMutableFst<Arc>();\n  Project(fst, std::get<1>(*args));\n}\n\nvoid Project(MutableFstClass *fst, ProjectType project_type);\n\n}  // namespace script\n}  // namespace fst\n\n#endif  // FST_SCRIPT_PROJECT_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/script/prune.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#ifndef FST_SCRIPT_PRUNE_H_\n#define FST_SCRIPT_PRUNE_H_\n\n#include <tuple>\n#include <utility>\n\n#include <fst/prune.h>\n#include <fst/script/fst-class.h>\n#include <fst/script/weight-class.h>\n\nnamespace fst {\nnamespace script {\n\nusing PruneArgs1 = std::tuple<const FstClass &, MutableFstClass *,\n                              const WeightClass &, int64, float>;\n\ntemplate <class Arc>\nvoid Prune(PruneArgs1 *args) {\n  using Weight = typename Arc::Weight;\n  const Fst<Arc> &ifst = *(std::get<0>(*args).GetFst<Arc>());\n  MutableFst<Arc> *ofst = std::get<1>(*args)->GetMutableFst<Arc>();\n  const auto weight_threshold = *(std::get<2>(*args).GetWeight<Weight>());\n  Prune(ifst, ofst, weight_threshold, std::get<3>(*args), std::get<4>(*args));\n}\n\nusing PruneArgs2 = std::tuple<MutableFstClass *, const WeightClass &, int64,\n                               float>;\n\ntemplate <class Arc>\nvoid Prune(PruneArgs2 *args) {\n  using Weight = typename Arc::Weight;\n  MutableFst<Arc> *fst = std::get<0>(*args)->GetMutableFst<Arc>();\n  const auto weight_threshold = *(std::get<1>(*args).GetWeight<Weight>());\n  Prune(fst, weight_threshold, std::get<2>(*args), std::get<3>(*args));\n}\n\nvoid Prune(const FstClass &ifst, MutableFstClass *ofst,\n           const WeightClass &weight_threshold,\n           int64 state_threshold = kNoStateId,\n           float delta = kDelta);\n\nvoid Prune(MutableFstClass *fst, const WeightClass &weight_threshold,\n           int64 state_threshold = kNoStateId, float delta = kDelta);\n\n}  // namespace script\n}  // namespace fst\n\n#endif  // FST_SCRIPT_PRUNE_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/script/push.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#ifndef FST_SCRIPT_PUSH_H_\n#define FST_SCRIPT_PUSH_H_\n\n#include <tuple>\n\n#include <fst/push.h>\n#include <fst/script/fst-class.h>\n\nnamespace fst {\nnamespace script {\n\nusing PushArgs1 = std::tuple<MutableFstClass *, ReweightType, float, bool>;\n\ntemplate <class Arc>\nvoid Push(PushArgs1 *args) {\n  MutableFst<Arc> *fst = std::get<0>(*args)->GetMutableFst<Arc>();\n  Push(fst, std::get<1>(*args), std::get<2>(*args), std::get<3>(*args));\n}\n\nusing PushArgs2 = std::tuple<const FstClass &, MutableFstClass *, uint32,\n                             ReweightType, float>;\n\ntemplate <class Arc>\nvoid Push(PushArgs2 *args) {\n  const Fst<Arc> &ifst = *(std::get<0>(*args).GetFst<Arc>());\n  MutableFst<Arc> *ofst = std::get<1>(*args)->GetMutableFst<Arc>();\n  switch (std::get<3>(*args)) {\n    case REWEIGHT_TO_FINAL: {\n      Push<Arc, REWEIGHT_TO_FINAL>(ifst, ofst, std::get<2>(*args),\n                                   std::get<4>(*args));\n      return;\n    }\n    case REWEIGHT_TO_INITIAL: {\n      Push<Arc, REWEIGHT_TO_INITIAL>(ifst, ofst, std::get<2>(*args),\n                                     std::get<4>(*args));\n      return;\n    }\n  }\n}\n\nvoid Push(MutableFstClass *fst, ReweightType rew_type, float delta = kDelta,\n          bool remove_total_weight = false);\n\nvoid Push(const FstClass &ifst, MutableFstClass *ofst, uint32 flags,\n          ReweightType rew_type, float delta = kDelta);\n\n}  // namespace script\n}  // namespace fst\n\n#endif  // FST_SCRIPT_PUSH_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/script/randequivalent.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#ifndef FST_SCRIPT_RANDEQUIVALENT_H_\n#define FST_SCRIPT_RANDEQUIVALENT_H_\n\n#include <climits>\n#include <ctime>\n\n#include <tuple>\n\n#include <fst/randequivalent.h>\n#include <fst/script/arg-packs.h>\n#include <fst/script/fst-class.h>\n#include <fst/script/script-impl.h>\n\nnamespace fst {\nnamespace script {\n\nusing RandEquivalentInnerArgs = std::tuple<const FstClass &, const FstClass &,\n    int32, float, time_t, const RandGenOptions<RandArcSelection> &>;\n\nusing RandEquivalentArgs = WithReturnValue<bool, RandEquivalentInnerArgs>;\n\ntemplate <class Arc>\nvoid RandEquivalent(RandEquivalentArgs *args) {\n  const Fst<Arc> &fst1 = *(std::get<0>(args->args).GetFst<Arc>());\n  const Fst<Arc> &fst2 = *(std::get<1>(args->args).GetFst<Arc>());\n  const auto seed = std::get<4>(args->args);\n  const auto &opts = std::get<5>(args->args);\n  switch (opts.selector) {\n    case UNIFORM_ARC_SELECTOR: {\n      const UniformArcSelector<Arc> selector(seed);\n      const RandGenOptions<UniformArcSelector<Arc>> ropts(selector,\n                                                          opts.max_length);\n      args->retval = RandEquivalent(fst1, fst2, std::get<2>(args->args),\n                                    std::get<3>(args->args), ropts);\n      return;\n    }\n    case FAST_LOG_PROB_ARC_SELECTOR: {\n      const FastLogProbArcSelector<Arc> selector(seed);\n      const RandGenOptions<FastLogProbArcSelector<Arc>> ropts(selector,\n                                                              opts.max_length);\n      args->retval = RandEquivalent(fst1, fst2, std::get<2>(args->args),\n                                    std::get<3>(args->args), ropts);\n      return;\n    }\n    case LOG_PROB_ARC_SELECTOR: {\n      const LogProbArcSelector<Arc> selector(seed);\n      const RandGenOptions<LogProbArcSelector<Arc>> ropts(selector,\n                                                          opts.max_length);\n      args->retval = RandEquivalent(fst1, fst2, std::get<2>(args->args),\n                                    std::get<3>(args->args), ropts);\n      return;\n    }\n  }\n}\n\nbool RandEquivalent(const FstClass &fst1, const FstClass &fst2, int32 npath = 1,\n    float delta = kDelta, time_t seed = time(nullptr),\n    const RandGenOptions<RandArcSelection> &opts =\n        RandGenOptions<RandArcSelection>(UNIFORM_ARC_SELECTOR));\n\n}  // namespace script\n}  // namespace fst\n\n#endif  // FST_SCRIPT_RANDEQUIVALENT_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/script/randgen.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#ifndef FST_SCRIPT_RANDGEN_H_\n#define FST_SCRIPT_RANDGEN_H_\n\n#include <ctime>\n\n#include <tuple>\n\n#include <fst/randgen.h>\n#include <fst/script/fst-class.h>\n#include <fst/script/script-impl.h>\n\nnamespace fst {\nnamespace script {\n\nusing RandGenArgs = std::tuple<const FstClass &, MutableFstClass *, time_t,\n                               const RandGenOptions<RandArcSelection> &>;\n\ntemplate <class Arc>\nvoid RandGen(RandGenArgs *args) {\n  const Fst<Arc> &ifst = *(std::get<0>(*args).GetFst<Arc>());\n  MutableFst<Arc> *ofst = std::get<1>(*args)->GetMutableFst<Arc>();\n  const time_t seed = std::get<2>(*args);\n  const auto &opts = std::get<3>(*args);\n  switch (opts.selector) {\n    case UNIFORM_ARC_SELECTOR: {\n      const UniformArcSelector<Arc> selector(seed);\n      const RandGenOptions<UniformArcSelector<Arc>> ropts(\n          selector, opts.max_length, opts.npath, opts.weighted,\n          opts.remove_total_weight);\n      RandGen(ifst, ofst, ropts);\n      return;\n    }\n    case FAST_LOG_PROB_ARC_SELECTOR: {\n      const FastLogProbArcSelector<Arc> selector(seed);\n      const RandGenOptions<FastLogProbArcSelector<Arc>> ropts(\n          selector, opts.max_length, opts.npath, opts.weighted,\n          opts.remove_total_weight);\n      RandGen(ifst, ofst, ropts);\n      return;\n    }\n    case LOG_PROB_ARC_SELECTOR: {\n      const LogProbArcSelector<Arc> selector(seed);\n      const RandGenOptions<LogProbArcSelector<Arc>> ropts(\n          selector, opts.max_length, opts.npath, opts.weighted,\n          opts.remove_total_weight);\n      RandGen(ifst, ofst, ropts);\n      return;\n    }\n  }\n}\n\nvoid RandGen(const FstClass &ifst, MutableFstClass *ofst,\n             time_t seed = time(nullptr),\n             const RandGenOptions<RandArcSelection> &opts =\n                 RandGenOptions<RandArcSelection>(UNIFORM_ARC_SELECTOR));\n\n}  // namespace script\n}  // namespace fst\n\n#endif  // FST_SCRIPT_RANDGEN_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/script/register.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#ifndef FST_SCRIPT_REGISTER_H_\n#define FST_SCRIPT_REGISTER_H_\n\n#include <istream>\n#include <string>\n\n#include <fst/generic-register.h>\n#include <fst/script/fst-class.h>\n#include <fst/script/weight-class.h>\n\n// Holds methods and classes responsible for maintaining\n// the register for FstClass arc types.\n\nnamespace fst {\nnamespace script {\n\n// Registers for reading and converting various kinds of FST classes.\n\n// This class definition is to avoid a nested class definition inside the\n// IORegistration struct.\n\ntemplate <class Reader, class Creator, class Converter>\nstruct FstClassRegEntry {\n  Reader reader;\n  Creator creator;\n  Converter converter;\n\n  FstClassRegEntry(Reader r, Creator cr, Converter co)\n      : reader(r), creator(cr), converter(co) {}\n\n  FstClassRegEntry()\n      : reader(NullReader), creator(NullCreator), converter(NullConverter) {}\n\n  // Null-returning reader, creator, and converter, used when registry lookup\n  // fails.\n\n  template <class FstClassType>\n  static FstClassType *NullReader(std::istream &strm,\n                                  const FstReadOptions &opts) {\n    return nullptr;\n  }\n\n  static FstClassImplBase *NullCreator() { return nullptr; }\n\n  static FstClassImplBase *NullConverter(const FstClass &other) {\n    return nullptr;\n  }\n};\n\ntemplate <class Reader, class Creator, class Converter>\nclass FstClassIORegister\n    : public GenericRegister<string,\n                             FstClassRegEntry<Reader, Creator, Converter>,\n                             FstClassIORegister<Reader, Creator, Converter>> {\n public:\n  Reader GetReader(const string &arc_type) const {\n    return this->GetEntry(arc_type).reader;\n  }\n\n  Creator GetCreator(const string &arc_type) const {\n    return this->GetEntry(arc_type).creator;\n  }\n\n  Converter GetConverter(const string &arc_type) const {\n    return this->GetEntry(arc_type).converter;\n  }\n\n protected:\n  string ConvertKeyToSoFilename(const string &key) const final {\n    string legal_type(key);\n    ConvertToLegalCSymbol(&legal_type);\n    return legal_type + \"-arc.so\";\n  }\n};\n\n// Struct containing everything needed to register a particular type\n// of FST class (e.g., a plain FstClass, or a MutableFstClass, etc.).\ntemplate <class FstClassType>\nstruct IORegistration {\n  using Reader = FstClassType *(*)(std::istream &stream,\n                                   const FstReadOptions &opts);\n\n  using Creator = FstClassImplBase *(*)();\n\n  using Converter = FstClassImplBase *(*)(const FstClass &other);\n\n  using Entry = FstClassRegEntry<Reader, Creator, Converter>;\n\n  // FST class Register.\n  using Register = FstClassIORegister<Reader, Creator, Converter>;\n\n  // FST class Register-er.\n  using Registerer =\n      GenericRegisterer<FstClassIORegister<Reader, Creator, Converter>>;\n};\n\n#define REGISTER_FST_CLASS(Class, Arc)                                   \\\n  static IORegistration<Class>::Registerer Class##_##Arc##_registerer(   \\\n      Arc::Type(),                                                       \\\n      IORegistration<Class>::Entry(Class::Read<Arc>, Class::Create<Arc>, \\\n                                   Class::Convert<Arc>))\n\n#define REGISTER_FST_CLASSES(Arc)           \\\n  REGISTER_FST_CLASS(FstClass, Arc);        \\\n  REGISTER_FST_CLASS(MutableFstClass, Arc); \\\n  REGISTER_FST_CLASS(VectorFstClass, Arc);\n\n}  // namespace script\n}  // namespace fst\n\n#endif  // FST_SCRIPT_REGISTER_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/script/relabel.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#ifndef FST_SCRIPT_RELABEL_H_\n#define FST_SCRIPT_RELABEL_H_\n\n#include <algorithm>\n#include <tuple>\n#include <utility>\n#include <vector>\n\n#include <fst/relabel.h>\n#include <fst/script/fst-class.h>\n\nnamespace fst {\nnamespace script {\n\nusing RelabelArgs1 = std::tuple<MutableFstClass *, const SymbolTable *,\n                                const SymbolTable *, const string &, bool,\n                                const SymbolTable *, const SymbolTable *,\n                                const string &, bool>;\n\ntemplate <class Arc>\nvoid Relabel(RelabelArgs1 *args) {\n  MutableFst<Arc> *ofst = std::get<0>(*args)->GetMutableFst<Arc>();\n  Relabel(ofst, std::get<1>(*args), std::get<2>(*args), std::get<3>(*args),\n          std::get<4>(*args), std::get<5>(*args), std::get<6>(*args),\n          std::get<7>(*args), std::get<8>(*args));\n}\n\nusing LabelPair = std::pair<int64, int64>;\n\nusing RelabelArgs2 = std::tuple<MutableFstClass *,\n                                const std::vector<LabelPair> &,\n                                const std::vector<LabelPair> &>;\n\ntemplate <class Arc>\nvoid Relabel(RelabelArgs2 *args) {\n  MutableFst<Arc> *ofst = std::get<0>(*args)->GetMutableFst<Arc>();\n  using LabelPair = std::pair<typename Arc::Label, typename Arc::Label>;\n  // In case the MutableFstClass::Label is not the same as Arc::Label,\n  // make a copy.\n  std::vector<LabelPair> typed_ipairs(std::get<1>(*args).size());\n  std::copy(std::get<1>(*args).begin(), std::get<1>(*args).end(),\n            typed_ipairs.begin());\n  std::vector<LabelPair> typed_opairs(std::get<2>(*args).size());\n  std::copy(std::get<2>(*args).begin(), std::get<2>(*args).end(),\n            typed_opairs.begin());\n  Relabel(ofst, typed_ipairs, typed_opairs);\n}\n\nvoid Relabel(MutableFstClass *ofst,\n             const SymbolTable *old_isymbols, const SymbolTable *new_isymbols,\n             const string &unknown_isymbol,  bool attach_new_isymbols,\n             const SymbolTable *old_osymbols, const SymbolTable *new_osymbols,\n             const string &unknown_osymbol, bool attach_new_osymbols);\n\nvoid Relabel(MutableFstClass *ofst, const std::vector<LabelPair> &ipairs,\n             const std::vector<LabelPair> &opairs);\n\n}  // namespace script\n}  // namespace fst\n\n#endif  // FST_SCRIPT_RELABEL_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/script/replace.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#ifndef FST_SCRIPT_REPLACE_H_\n#define FST_SCRIPT_REPLACE_H_\n\n#include <tuple>\n#include <utility>\n#include <vector>\n\n#include <fst/replace.h>\n#include <fst/script/fst-class.h>\n\nnamespace fst {\nnamespace script {\n\nstruct ReplaceOptions {\n  const int64 root;                          // Root rule for expansion.\n  const ReplaceLabelType call_label_type;    // How to label call arc.\n  const ReplaceLabelType return_label_type;  // How to label return arc.\n  const int64 return_label;                  // Specifies return arc label.\n\n  explicit ReplaceOptions(int64 root,\n      ReplaceLabelType call_label_type = REPLACE_LABEL_INPUT,\n      ReplaceLabelType return_label_type = REPLACE_LABEL_NEITHER,\n      int64 return_label = 0)\n      : root(root),\n        call_label_type(call_label_type),\n        return_label_type(return_label_type),\n        return_label(return_label) {}\n};\n\nusing LabelFstClassPair = std::pair<int64, const FstClass *>;\n\nusing ReplaceArgs = std::tuple<const std::vector<LabelFstClassPair> &,\n                               MutableFstClass *, const ReplaceOptions &>;\n\ntemplate <class Arc>\nvoid Replace(ReplaceArgs *args) {\n  using LabelFstPair = std::pair<typename Arc::Label, const Fst<Arc> *>;\n  // Now that we know the arc type, we construct a vector of\n  // std::pair<real label, real fst> that the real Replace will use.\n  const auto &untyped_pairs = std::get<0>(*args);\n  std::vector<LabelFstPair> typed_pairs;\n  typed_pairs.reserve(untyped_pairs.size());\n  for (const auto &untyped_pair : untyped_pairs) {\n    typed_pairs.emplace_back(untyped_pair.first,  // Converts label.\n                             untyped_pair.second->GetFst<Arc>());\n  }\n  MutableFst<Arc> *ofst = std::get<1>(*args)->GetMutableFst<Arc>();\n  const auto &opts = std::get<2>(*args);\n  ReplaceFstOptions<Arc> typed_opts(opts.root, opts.call_label_type,\n                                    opts.return_label_type, opts.return_label);\n  ReplaceFst<Arc> rfst(typed_pairs, typed_opts);\n  // Checks for cyclic dependencies before attempting expansion.\n  if (rfst.CyclicDependencies()) {\n    FSTERROR() << \"Replace: Cyclic dependencies detected; cannot expand\";\n    ofst->SetProperties(kError, kError);\n    return;\n  }\n  typed_opts.gc = true;     // Caching options to speed up batch copy.\n  typed_opts.gc_limit = 0;\n  *ofst = rfst;\n}\n\nvoid Replace(const std::vector<LabelFstClassPair> &pairs,\n             MutableFstClass *ofst, const ReplaceOptions &opts);\n\n}  // namespace script\n}  // namespace fst\n\n#endif  // FST_SCRIPT_REPLACE_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/script/reverse.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#ifndef FST_SCRIPT_REVERSE_H_\n#define FST_SCRIPT_REVERSE_H_\n\n#include <tuple>\n\n#include <fst/reverse.h>\n#include <fst/script/fst-class.h>\n\nnamespace fst {\nnamespace script {\n\nusing ReverseArgs = std::tuple<const FstClass &, MutableFstClass *, bool>;\n\ntemplate <class Arc>\nvoid Reverse(ReverseArgs *args) {\n  const Fst<Arc> &ifst = *(std::get<0>(*args).GetFst<Arc>());\n  MutableFst<Arc> *ofst = std::get<1>(*args)->GetMutableFst<Arc>();\n  Reverse(ifst, ofst, std::get<2>(*args));\n}\n\nvoid Reverse(const FstClass &ifst, MutableFstClass *ofst,\n             bool require_superinitial = true);\n\n}  // namespace script\n}  // namespace fst\n\n#endif  // FST_SCRIPT_REVERSE_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/script/reweight.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#ifndef FST_SCRIPT_REWEIGHT_H_\n#define FST_SCRIPT_REWEIGHT_H_\n\n#include <tuple>\n#include <vector>\n\n#include <fst/reweight.h>\n#include <fst/script/fst-class.h>\n#include <fst/script/script-impl.h>\n#include <fst/script/weight-class.h>\n\nnamespace fst {\nnamespace script {\n\nusing ReweightArgs = std::tuple<MutableFstClass *,\n                                const std::vector<WeightClass> &, ReweightType>;\n\ntemplate <class Arc>\nvoid Reweight(ReweightArgs *args) {\n  using Weight = typename Arc::Weight;\n  MutableFst<Arc> *fst = std::get<0>(*args)->GetMutableFst<Arc>();\n  const std::vector<WeightClass> &potentials = std::get<1>(*args);\n  std::vector<Weight> typed_potentials;\n  internal::CopyWeights(potentials, &typed_potentials);\n  Reweight(fst, typed_potentials, std::get<2>(*args));\n}\n\nvoid Reweight(MutableFstClass *fst, const std::vector<WeightClass> &potentials,\n              ReweightType reweight_type);\n\n}  // namespace script\n}  // namespace fst\n\n#endif  // FST_SCRIPT_REWEIGHT_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/script/rmepsilon.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#ifndef FST_SCRIPT_RMEPSILON_H_\n#define FST_SCRIPT_RMEPSILON_H_\n\n#include <utility>\n#include <vector>\n\n#include <fst/queue.h>\n#include <fst/rmepsilon.h>\n#include <fst/script/fst-class.h>\n#include <fst/script/shortest-distance.h>\n#include <fst/script/weight-class.h>\n\nnamespace fst {\nnamespace script {\n\nstruct RmEpsilonOptions : public ShortestDistanceOptions {\n  const bool connect;\n  const WeightClass &weight_threshold;\n  const int64 state_threshold;\n\n  RmEpsilonOptions(QueueType queue_type, bool connect,\n                   const WeightClass &weight_threshold,\n                   int64 state_threshold = kNoStateId, float delta = kDelta)\n      : ShortestDistanceOptions(queue_type, EPSILON_ARC_FILTER, kNoStateId,\n                                delta),\n        connect(connect),\n        weight_threshold(weight_threshold),\n        state_threshold(state_threshold) {}\n};\n\nnamespace internal {\n\n// Code to implement switching on queue types.\n\ntemplate <class Arc, class Queue>\nvoid RmEpsilon(MutableFst<Arc> *fst,\n               std::vector<typename Arc::Weight> *distance,\n               const RmEpsilonOptions &opts, Queue *queue) {\n  using Weight = typename Arc::Weight;\n  const fst::RmEpsilonOptions<Arc, Queue> ropts(\n      queue, opts.delta, opts.connect,\n      *opts.weight_threshold.GetWeight<Weight>(), opts.state_threshold);\n  RmEpsilon(fst, distance, ropts);\n}\n\ntemplate <class Arc>\nvoid RmEpsilon(MutableFst<Arc> *fst, const RmEpsilonOptions &opts) {\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n  std::vector<Weight> distance;\n  switch (opts.queue_type) {\n    case AUTO_QUEUE: {\n      AutoQueue<StateId> queue(*fst, &distance, EpsilonArcFilter<Arc>());\n      RmEpsilon(fst, &distance, opts, &queue);\n      return;\n    }\n    case FIFO_QUEUE: {\n      FifoQueue<StateId> queue;\n      RmEpsilon(fst, &distance, opts, &queue);\n      return;\n    }\n    case LIFO_QUEUE: {\n      LifoQueue<StateId> queue;\n      RmEpsilon(fst, &distance, opts, &queue);\n      return;\n    }\n    case SHORTEST_FIRST_QUEUE: {\n      NaturalShortestFirstQueue<StateId, Weight> queue(distance);\n      RmEpsilon(fst, &distance, opts, &queue);\n      return;\n    }\n    case STATE_ORDER_QUEUE: {\n      StateOrderQueue<StateId> queue;\n      RmEpsilon(fst, &distance, opts, &queue);\n      return;\n    }\n    case TOP_ORDER_QUEUE: {\n      TopOrderQueue<StateId> queue(*fst, EpsilonArcFilter<Arc>());\n      internal::RmEpsilon(fst, &distance, opts, &queue);\n      return;\n    }\n    default: {\n      FSTERROR() << \"RmEpsilon: Unknown queue type: \" << opts.queue_type;\n      fst->SetProperties(kError, kError);\n      return;\n    }\n  }\n}\n\n}  // namespace internal\n\nusing RmEpsilonArgs = std::pair<MutableFstClass *, const RmEpsilonOptions &>;\n\ntemplate <class Arc>\nvoid RmEpsilon(RmEpsilonArgs *args) {\n  MutableFst<Arc> *fst = std::get<0>(*args)->GetMutableFst<Arc>();\n  const auto &opts = std::get<1>(*args);\n  internal::RmEpsilon(fst, opts);\n}\n\nvoid RmEpsilon(MutableFstClass *fst, const RmEpsilonOptions &opts);\n\n}  // namespace script\n}  // namespace fst\n\n#endif  // FST_SCRIPT_RMEPSILON_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/script/script-impl.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// This file defines the registration mechanism for new operations.\n// These operations are designed to enable scripts to work with FST classes\n// at a high level.\n//\n// If you have a new arc type and want these operations to work with FSTs\n// with that arc type, see below for the registration steps\n// you must take.\n//\n// These methods are only recommended for use in high-level scripting\n// applications. Most users should use the lower-level templated versions\n// corresponding to these.\n//\n// If you have a new arc type you'd like these operations to work with,\n// use the REGISTER_FST_OPERATIONS macro defined in fstscript.h.\n//\n// If you have a custom operation you'd like to define, you need four\n// components. In the following, assume you want to create a new operation\n// with the signature\n//\n//    void Foo(const FstClass &ifst, MutableFstClass *ofst);\n//\n//  You need:\n//\n//  1) A way to bundle the args that your new Foo operation will take, as\n//     a single struct. The template structs in arg-packs.h provide a handy\n//     way to do this. In Foo's case, that might look like this:\n//\n//       using FooArgs = std::pair<const FstClass &, MutableFstClass *>;\n//\n//     Note: this package of args is going to be passed by non-const pointer.\n//\n//  2) A function template that is able to perform Foo, given the args and\n//     arc type. Yours might look like this:\n//\n//       template<class Arc>\n//       void Foo(FooArgs *args) {\n//          // Pulls out the actual, arc-templated FSTs.\n//          const Fst<Arc> &ifst = std::get<0>(*args).GetFst<Arc>();\n//          MutableFst<Arc> *ofst = std::get<1>(*args)->GetMutableFst<Arc>();\n//          // Actually perform Foo on ifst and ofst.\n//       }\n//\n//  3) a client-facing function for your operation. This would look like\n//     the following:\n//\n//     void Foo(const FstClass &ifst, MutableFstClass *ofst) {\n//       // Check that the arc types of the FSTs match\n//       if (!ArcTypesMatch(ifst, *ofst, \"Foo\")) return;\n//       // package the args\n//       FooArgs args(ifst, ofst);\n//       // Finally, call the operation\n//       Apply<Operation<FooArgs>>(\"Foo\", ifst->ArcType(), &args);\n//     }\n//\n//  The Apply<> function template takes care of the link between 2 and 3,\n//  provided you also have:\n//\n//  4) A registration for your new operation, on the arc types you care about.\n//     This can be provided easily by the REGISTER_FST_OPERATION macro in\n//     operations.h:\n//\n//       REGISTER_FST_OPERATION(Foo, StdArc, FooArgs);\n//       REGISTER_FST_OPERATION(Foo, MyArc, FooArgs);\n//       // .. etc\n//\n//\n//  That's it! Now when you call Foo(const FstClass &, MutableFstClass *),\n//  it dispatches (in #3) via the Apply<> function to the correct\n//  instantiation of the template function in #2.\n//\n\n#ifndef FST_SCRIPT_SCRIPT_IMPL_H_\n#define FST_SCRIPT_SCRIPT_IMPL_H_\n\n// This file contains general-purpose templates which are used in the\n// implementation of the operations.\n\n#include <string>\n#include <utility>\n\n#include <fst/generic-register.h>\n#include <fst/script/fst-class.h>\n\n#include <fst/log.h>\n\nnamespace fst {\nnamespace script {\n\nenum RandArcSelection {\n  UNIFORM_ARC_SELECTOR,\n  LOG_PROB_ARC_SELECTOR,\n  FAST_LOG_PROB_ARC_SELECTOR\n};\n\n// A generic register for operations with various kinds of signatures.\n// Needed since every function signature requires a new registration class.\n// The std::pair<string, string> is understood to be the operation name and arc\n// type; subclasses (or typedefs) need only provide the operation signature.\n\ntemplate <class OperationSignature>\nclass GenericOperationRegister\n    : public GenericRegister<std::pair<string, string>, OperationSignature,\n                             GenericOperationRegister<OperationSignature>> {\n public:\n  void RegisterOperation(const string &operation_name, const string &arc_type,\n                         OperationSignature op) {\n    this->SetEntry(std::make_pair(operation_name, arc_type), op);\n  }\n\n  OperationSignature GetOperation(const string &operation_name,\n                                  const string &arc_type) {\n    return this->GetEntry(std::make_pair(operation_name, arc_type));\n  }\n\n protected:\n  string ConvertKeyToSoFilename(\n      const std::pair<string, string> &key) const final {\n    // Uses the old-style FST for now.\n    string legal_type(key.second);  // The arc type.\n    ConvertToLegalCSymbol(&legal_type);\n    return legal_type + \"-arc.so\";\n  }\n};\n\n// Operation package: everything you need to register a new type of operation.\n// The ArgPack should be the type that's passed into each wrapped function;\n// for instance, it might be a struct containing all the args. It's always\n// passed by pointer, so const members should be used to enforce constness where\n// it's needed. Return values should be implemented as a member of ArgPack as\n// well.\n\ntemplate <class Args>\nstruct Operation {\n  using ArgPack = Args;\n\n  using OpType = void (*)(ArgPack *args);\n\n  // The register (hash) type.\n  using Register = GenericOperationRegister<OpType>;\n\n  // The register-er type\n  using Registerer = GenericRegisterer<Register>;\n};\n\n// Macro for registering new types of operations.\n\n#define REGISTER_FST_OPERATION(Op, Arc, ArgPack)               \\\n  static fst::script::Operation<ArgPack>::Registerer       \\\n      arc_dispatched_operation_##ArgPack##Op##Arc##_registerer \\\n      (std::make_pair(#Op, Arc::Type()), Op<Arc>)\n\n// Template function to apply an operation by name.\n\ntemplate <class OpReg>\nvoid Apply(const string &op_name, const string &arc_type,\n           typename OpReg::ArgPack *args) {\n  const auto op = OpReg::Register::GetRegister()->GetOperation(op_name,\n                                                               arc_type);\n  if (!op) {\n    FSTERROR() << \"No operation found for \" << op_name << \" on \"\n               << \"arc type \" << arc_type;\n    return;\n  }\n  op(args);\n}\n\nnamespace internal {\n\n// Helper that logs to ERROR if the arc types of m and n don't match,\n// assuming that both m and n implement .ArcType(). The op_name argument is\n// used to construct the error message.\ntemplate <class M, class N>\nbool ArcTypesMatch(const M &m, const N &n, const string &op_name) {\n  if (m.ArcType() != n.ArcType()) {\n    FSTERROR() << \"Arguments with non-matching arc types passed to \"\n               << op_name << \":\\t\" << m.ArcType() << \" and \" << n.ArcType();\n    return false;\n  }\n  return true;\n}\n\n// From untyped to typed weights.\ntemplate <class Weight>\nvoid CopyWeights(const std::vector<WeightClass> &weights,\n                 std::vector<Weight> *typed_weights) {\n  typed_weights->clear();\n  typed_weights->reserve(weights.size());\n  for (const auto &weight : weights) {\n    typed_weights->push_back(*weight.GetWeight<Weight>());\n  }\n}\n\n// From typed to untyped weights.\ntemplate <class Weight>\nvoid CopyWeights(const std::vector<Weight> &typed_weights,\n                 std::vector<WeightClass> *weights) {\n  weights->clear();\n  weights->reserve(typed_weights.size());\n  for (const auto &typed_weight : typed_weights) {\n    weights->emplace_back(typed_weight);\n  }\n}\n\n}  // namespace internal\n}  // namespace script\n}  // namespace fst\n\n#endif  // FST_SCRIPT_SCRIPT_IMPL_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/script/shortest-distance.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#ifndef FST_SCRIPT_SHORTEST_DISTANCE_H_\n#define FST_SCRIPT_SHORTEST_DISTANCE_H_\n\n#include <tuple>\n#include <vector>\n\n#include <fst/queue.h>\n#include <fst/shortest-distance.h>\n#include <fst/script/fst-class.h>\n#include <fst/script/prune.h>\n#include <fst/script/script-impl.h>\n#include <fst/script/weight-class.h>\n\nnamespace fst {\nnamespace script {\n\nenum ArcFilterType {\n  ANY_ARC_FILTER,\n  EPSILON_ARC_FILTER,\n  INPUT_EPSILON_ARC_FILTER,\n  OUTPUT_EPSILON_ARC_FILTER\n};\n\nstruct ShortestDistanceOptions {\n  const QueueType queue_type;\n  const ArcFilterType arc_filter_type;\n  const int64 source;\n  const float delta;\n\n  ShortestDistanceOptions(QueueType queue_type, ArcFilterType arc_filter_type,\n                          int64 source, float delta)\n      : queue_type(queue_type),\n        arc_filter_type(arc_filter_type),\n        source(source),\n        delta(delta) {}\n};\n\nnamespace internal {\n\n// Code to implement switching on queue and arc filter types.\n\ntemplate <class Arc, class Queue, class ArcFilter>\nstruct QueueConstructor {\n  using Weight = typename Arc::Weight;\n\n  static Queue *Construct(const Fst<Arc> &, const std::vector<Weight> *) {\n    return new Queue();\n  }\n};\n\n// Specializations to support queues with different constructors.\n\ntemplate <class Arc, class ArcFilter>\nstruct QueueConstructor<Arc, AutoQueue<typename Arc::StateId>, ArcFilter> {\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  //  template<class Arc, class ArcFilter>\n  static AutoQueue<StateId> *Construct(const Fst<Arc> &fst,\n                                       const std::vector<Weight> *distance) {\n    return new AutoQueue<StateId>(fst, distance, ArcFilter());\n  }\n};\n\ntemplate <class Arc, class ArcFilter>\nstruct QueueConstructor<\n    Arc, NaturalShortestFirstQueue<typename Arc::StateId, typename Arc::Weight>,\n    ArcFilter> {\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  static NaturalShortestFirstQueue<StateId, Weight> *Construct(\n      const Fst<Arc> &, const std::vector<Weight> *distance) {\n    return new NaturalShortestFirstQueue<StateId, Weight>(*distance);\n  }\n};\n\ntemplate <class Arc, class ArcFilter>\nstruct QueueConstructor<Arc, TopOrderQueue<typename Arc::StateId>, ArcFilter> {\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  static TopOrderQueue<StateId> *Construct(const Fst<Arc> &fst,\n                                           const std::vector<Weight> *) {\n    return new TopOrderQueue<StateId>(fst, ArcFilter());\n  }\n};\n\ntemplate <class Arc, class Queue, class ArcFilter>\nvoid ShortestDistance(const Fst<Arc> &fst,\n                      std::vector<typename Arc::Weight> *distance,\n                      const ShortestDistanceOptions &opts) {\n  std::unique_ptr<Queue> queue(\n      QueueConstructor<Arc, Queue, ArcFilter>::Construct(fst, distance));\n  const fst::ShortestDistanceOptions<Arc, Queue, ArcFilter> sopts(\n      queue.get(), ArcFilter(), opts.source, opts.delta);\n  ShortestDistance(fst, distance, sopts);\n}\n\ntemplate <class Arc, class Queue>\nvoid ShortestDistance(const Fst<Arc> &fst,\n                      std::vector<typename Arc::Weight> *distance,\n                      const ShortestDistanceOptions &opts) {\n  switch (opts.arc_filter_type) {\n    case ANY_ARC_FILTER: {\n      ShortestDistance<Arc, Queue, AnyArcFilter<Arc>>(fst, distance, opts);\n      return;\n    }\n    case EPSILON_ARC_FILTER: {\n      ShortestDistance<Arc, Queue, EpsilonArcFilter<Arc>>(fst, distance, opts);\n      return;\n    }\n    case INPUT_EPSILON_ARC_FILTER: {\n      ShortestDistance<Arc, Queue, InputEpsilonArcFilter<Arc>>(fst, distance,\n                                                               opts);\n      return;\n    }\n    case OUTPUT_EPSILON_ARC_FILTER: {\n      ShortestDistance<Arc, Queue, OutputEpsilonArcFilter<Arc>>(fst, distance,\n                                                                opts);\n      return;\n    }\n    default: {\n      FSTERROR() << \"ShortestDistance: Unknown arc filter type: \"\n                 << opts.arc_filter_type;\n      distance->clear();\n      distance->resize(1, Arc::Weight::NoWeight());\n      return;\n    }\n  }\n}\n\n}  // namespace internal\n\nusing ShortestDistanceArgs1 =\n    std::tuple<const FstClass &, std::vector<WeightClass> *,\n               const ShortestDistanceOptions &>;\n\ntemplate <class Arc>\nvoid ShortestDistance(ShortestDistanceArgs1 *args) {\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n  const Fst<Arc> &fst = *(std::get<0>(*args).GetFst<Arc>());\n  const auto &opts = std::get<2>(*args);\n  std::vector<Weight> typed_distance;\n  switch (opts.queue_type) {\n    case AUTO_QUEUE: {\n      internal::ShortestDistance<Arc, AutoQueue<StateId>>(fst, &typed_distance,\n                                                          opts);\n      break;\n    }\n    case FIFO_QUEUE: {\n      internal::ShortestDistance<Arc, FifoQueue<StateId>>(fst, &typed_distance,\n                                                          opts);\n      break;\n    }\n    case LIFO_QUEUE: {\n      internal::ShortestDistance<Arc, LifoQueue<StateId>>(fst, &typed_distance,\n                                                          opts);\n      break;\n    }\n    case SHORTEST_FIRST_QUEUE: {\n      internal::ShortestDistance<Arc,\n                                 NaturalShortestFirstQueue<StateId, Weight>>(\n          fst, &typed_distance, opts);\n      break;\n    }\n    case STATE_ORDER_QUEUE: {\n      internal::ShortestDistance<Arc, StateOrderQueue<StateId>>(\n          fst, &typed_distance, opts);\n      break;\n    }\n    case TOP_ORDER_QUEUE: {\n      internal::ShortestDistance<Arc, TopOrderQueue<StateId>>(\n          fst, &typed_distance, opts);\n      break;\n    }\n    default: {\n      FSTERROR() << \"ShortestDistance: Unknown queue type: \" << opts.queue_type;\n      typed_distance.clear();\n      typed_distance.resize(1, Arc::Weight::NoWeight());\n      break;\n    }\n  }\n  internal::CopyWeights(typed_distance, std::get<1>(*args));\n}\n\nusing ShortestDistanceArgs2 =\n    std::tuple<const FstClass &, std::vector<WeightClass> *, bool, double>;\n\ntemplate <class Arc>\nvoid ShortestDistance(ShortestDistanceArgs2 *args) {\n  using Weight = typename Arc::Weight;\n  const Fst<Arc> &fst = *(std::get<0>(*args).GetFst<Arc>());\n  std::vector<Weight> typed_distance;\n  ShortestDistance(fst, &typed_distance, std::get<2>(*args),\n                   std::get<3>(*args));\n  internal::CopyWeights(typed_distance, std::get<1>(*args));\n}\n\nvoid ShortestDistance(const FstClass &fst, std::vector<WeightClass> *distance,\n                      const ShortestDistanceOptions &opts);\n\nvoid ShortestDistance(const FstClass &ifst, std::vector<WeightClass> *distance,\n                      bool reverse = false,\n                      double delta = fst::kShortestDelta);\n\n}  // namespace script\n}  // namespace fst\n\n#endif  // FST_SCRIPT_SHORTEST_DISTANCE_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/script/shortest-path.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#ifndef FST_SCRIPT_SHORTEST_PATH_H_\n#define FST_SCRIPT_SHORTEST_PATH_H_\n\n#include <memory>\n#include <vector>\n\n#include <fst/shortest-path.h>\n#include <fst/script/fst-class.h>\n#include <fst/script/shortest-distance.h>\n#include <fst/script/weight-class.h>\n\nnamespace fst {\nnamespace script {\n\n// Slightly simplified interface: `has_distance` and `first_path` are disabled.\n\nstruct ShortestPathOptions : public ShortestDistanceOptions {\n  const int32 nshortest;\n  const bool unique;\n  const WeightClass &weight_threshold;\n  const int64 state_threshold;\n\n  ShortestPathOptions(QueueType queue_type, int32 nshortest, bool unique,\n                      float delta, const WeightClass &weight_threshold,\n                      int64 state_threshold = kNoStateId)\n      : ShortestDistanceOptions(queue_type, ANY_ARC_FILTER, kNoStateId, delta),\n        nshortest(nshortest),\n        unique(unique),\n        weight_threshold(weight_threshold),\n        state_threshold(state_threshold) {}\n};\n\nnamespace internal {\n\n// Code to implement switching on queue types.\n\ntemplate <class Arc, class Queue>\nvoid ShortestPath(const Fst<Arc> &ifst, MutableFst<Arc> *ofst,\n                  std::vector<typename Arc::Weight> *distance,\n                  const ShortestPathOptions &opts) {\n  using ArcFilter = AnyArcFilter<Arc>;\n  using Weight = typename Arc::Weight;\n  const std::unique_ptr<Queue> queue(\n      QueueConstructor<Arc, Queue, ArcFilter>::Construct(ifst, distance));\n  const fst::ShortestPathOptions<Arc, Queue, ArcFilter> sopts(\n      queue.get(), ArcFilter(), opts.nshortest, opts.unique,\n      /* has_distance=*/false, opts.delta, /* first_path=*/false,\n      *opts.weight_threshold.GetWeight<Weight>(), opts.state_threshold);\n  ShortestPath(ifst, ofst, distance, sopts);\n}\n\ntemplate <class Arc>\nvoid ShortestPath(const Fst<Arc> &ifst, MutableFst<Arc> *ofst,\n                  const ShortestPathOptions &opts) {\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n  std::vector<Weight> distance;\n  switch (opts.queue_type) {\n    case AUTO_QUEUE: {\n      ShortestPath<Arc, AutoQueue<StateId>>(ifst, ofst, &distance, opts);\n      return;\n    }\n    case FIFO_QUEUE: {\n      ShortestPath<Arc, FifoQueue<StateId>>(ifst, ofst, &distance, opts);\n      return;\n    }\n    case LIFO_QUEUE: {\n      ShortestPath<Arc, LifoQueue<StateId>>(ifst, ofst, &distance, opts);\n      return;\n    }\n    case SHORTEST_FIRST_QUEUE: {\n      ShortestPath<Arc, NaturalShortestFirstQueue<StateId, Weight>>(ifst, ofst,\n                                                                    &distance,\n                                                                    opts);\n      return;\n    }\n    case STATE_ORDER_QUEUE: {\n      ShortestPath<Arc, StateOrderQueue<StateId>>(ifst, ofst, &distance, opts);\n      return;\n    }\n    case TOP_ORDER_QUEUE: {\n      ShortestPath<Arc, TopOrderQueue<StateId>>(ifst, ofst, &distance, opts);\n      return;\n    }\n    default: {\n      FSTERROR() << \"ShortestPath: Unknown queue type: \"\n                 << opts.queue_type;\n      ofst->SetProperties(kError, kError);\n      return;\n    }\n  }\n}\n\n}  // namespace internal\n\nusing ShortestPathArgs = std::tuple<const FstClass &, MutableFstClass *,\n                                    const ShortestPathOptions &>;\n\ntemplate <class Arc>\nvoid ShortestPath(ShortestPathArgs *args) {\n  const Fst<Arc> &ifst = *(std::get<0>(*args).GetFst<Arc>());\n  MutableFst<Arc> *ofst = std::get<1>(*args)->GetMutableFst<Arc>();\n  const ShortestPathOptions &opts = std::get<2>(*args);\n  internal::ShortestPath(ifst, ofst, opts);\n}\n\nvoid ShortestPath(const FstClass &ifst, MutableFstClass *ofst,\n                  const ShortestPathOptions &opts);\n\n}  // namespace script\n}  // namespace fst\n\n#endif  // FST_SCRIPT_SHORTEST_PATH_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/script/stateiterator-class.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#ifndef FST_SCRIPT_STATEITERATOR_CLASS_H_\n#define FST_SCRIPT_STATEITERATOR_CLASS_H_\n\n#include <memory>\n\n#include <fst/fstlib.h>\n#include <fst/script/fst-class.h>\n\n// Scripting API support for StateIterator.\n\nnamespace fst {\nnamespace script {\n\n// Virtual interface implemented by each concrete StateIteratorImpl<F>.\nclass StateIteratorImplBase {\n public:\n  virtual bool Done() const = 0;\n  virtual int64 Value() const = 0;\n  virtual void Next() = 0;\n  virtual void Reset() = 0;\n  virtual ~StateIteratorImplBase() {}\n};\n\n// Templated implementation.\ntemplate <class Arc>\nclass StateIteratorClassImpl : public StateIteratorImplBase {\n public:\n  explicit StateIteratorClassImpl(const Fst<Arc> &fst) : siter_(fst) {}\n\n  bool Done() const final { return siter_.Done(); }\n\n  int64 Value() const final { return siter_.Value(); }\n\n  void Next() final { siter_.Next(); }\n\n  void Reset() final { siter_.Reset(); }\n\n  ~StateIteratorClassImpl() override {}\n\n private:\n  StateIterator<Fst<Arc>> siter_;\n};\n\nclass StateIteratorClass;\n\nusing InitStateIteratorClassArgs =\n    std::pair<const FstClass &, StateIteratorClass *>;\n\n// Untemplated user-facing class holding a templated pimpl.\nclass StateIteratorClass {\n public:\n  explicit StateIteratorClass(const FstClass &fst);\n\n  template <class Arc>\n  explicit StateIteratorClass(const Fst<Arc> &fst)\n      : impl_(new StateIteratorClassImpl<Arc>(fst)) {}\n\n  bool Done() const { return impl_->Done(); }\n\n  int64 Value() const { return impl_->Value(); }\n\n  void Next() { impl_->Next(); }\n\n  void Reset() { impl_->Reset(); }\n\n  template <class Arc>\n  friend void InitStateIteratorClass(InitStateIteratorClassArgs *args);\n\n private:\n  std::unique_ptr<StateIteratorImplBase> impl_;\n};\n\ntemplate <class Arc>\nvoid InitStateIteratorClass(InitStateIteratorClassArgs *args) {\n  const Fst<Arc> &fst = *(std::get<0>(*args).GetFst<Arc>());\n  std::get<1>(*args)->impl_.reset(new StateIteratorClassImpl<Arc>(fst));\n}\n\n}  // namespace script\n}  // namespace fst\n\n#endif  // FST_SCRIPT_STATEITERATOR_CLASS_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/script/synchronize.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#ifndef FST_SCRIPT_SYNCHRONIZE_H_\n#define FST_SCRIPT_SYNCHRONIZE_H_\n\n#include <utility>\n\n#include <fst/synchronize.h>\n#include <fst/script/fst-class.h>\n\nnamespace fst {\nnamespace script {\n\nusing SynchronizeArgs = std::pair<const FstClass &, MutableFstClass *>;\n\ntemplate <class Arc>\nvoid Synchronize(SynchronizeArgs *args) {\n  const Fst<Arc> &ifst = *(std::get<0>(*args).GetFst<Arc>());\n  MutableFst<Arc> *ofst = std::get<1>(*args)->GetMutableFst<Arc>();\n  Synchronize(ifst, ofst);\n}\n\nvoid Synchronize(const FstClass &ifst, MutableFstClass *ofst);\n\n}  // namespace script\n}  // namespace fst\n\n#endif  // FST_SCRIPT_SYNCHRONIZE_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/script/text-io.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Utilities for reading and writing textual strings representing states,\n// labels, and weights and files specifying label-label pairs and potentials\n// (state-weight pairs).\n\n#ifndef FST_SCRIPT_TEXT_IO_H__\n#define FST_SCRIPT_TEXT_IO_H__\n\n#include <string>\n#include <vector>\n\n#include <fst/script/weight-class.h>\n\nnamespace fst {\nnamespace script {\n\nbool ReadPotentials(const string &weight_type, const string &filename,\n                    std::vector<WeightClass> *potentials);\n\nbool WritePotentials(const string &filename,\n                     const std::vector<WeightClass> &potentials);\n\n}  // namespace script\n}  // namespace fst\n\n#endif  // FST_SCRIPT_TEXT_IO_H__\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/script/topsort.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#ifndef FST_SCRIPT_TOPSORT_H_\n#define FST_SCRIPT_TOPSORT_H_\n\n#include <fst/topsort.h>\n#include <fst/script/arg-packs.h>\n#include <fst/script/fst-class.h>\n\nnamespace fst {\nnamespace script {\n\nusing TopSortArgs = WithReturnValue<bool, MutableFstClass *>;\n\ntemplate <class Arc>\nvoid TopSort(TopSortArgs *args) {\n  args->retval = TopSort(args->args->GetMutableFst<Arc>());\n}\n\nbool TopSort(MutableFstClass *fst);\n\n}  // namespace script\n}  // namespace fst\n\n#endif  // FST_SCRIPT_TOPSORT_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/script/union.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#ifndef FST_SCRIPT_UNION_H_\n#define FST_SCRIPT_UNION_H_\n\n#include <utility>\n\n#include <fst/union.h>\n#include <fst/script/fst-class.h>\n\nnamespace fst {\nnamespace script {\n\nusing UnionArgs = std::pair<MutableFstClass *, const FstClass &>;\n\ntemplate <class Arc>\nvoid Union(UnionArgs *args) {\n  MutableFst<Arc> *fst1 = std::get<0>(*args)->GetMutableFst<Arc>();\n  const Fst<Arc> &fst2 = *(std::get<1>(*args).GetFst<Arc>());\n  Union(fst1, fst2);\n}\n\nvoid Union(MutableFstClass *fst1, const FstClass &fst2);\n\n}  // namespace script\n}  // namespace fst\n\n#endif  // FST_SCRIPT_UNION_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/script/verify.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#ifndef FST_SCRIPT_VERIFY_H_\n#define FST_SCRIPT_VERIFY_H_\n\n#include <fst/verify.h>\n#include <fst/script/arg-packs.h>\n#include <fst/script/fst-class.h>\n\nnamespace fst {\nnamespace script {\n\nusing VerifyArgs = WithReturnValue<bool, const FstClass &>;\n\ntemplate <class Arc>\nvoid Verify(VerifyArgs *args) {\n  const Fst<Arc> &fst = *(args->args.GetFst<Arc>());\n  args->retval = Verify(fst);\n}\n\nbool Verify(const FstClass &fst);\n\n}  // namespace script\n}  // namespace fst\n\n#endif  // FST_SCRIPT_VERIFY_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/script/weight-class.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Represents a generic weight in an FST; that is, represents a specific type\n// of weight underneath while hiding that type from a client.\n\n#ifndef FST_SCRIPT_WEIGHT_CLASS_H_\n#define FST_SCRIPT_WEIGHT_CLASS_H_\n\n#include <memory>\n#include <ostream>\n#include <string>\n\n#include <fst/arc.h>\n#include <fst/generic-register.h>\n#include <fst/util.h>\n#include <fst/weight.h>\n\nnamespace fst {\nnamespace script {\n\nclass WeightImplBase {\n public:\n  virtual WeightImplBase *Copy() const = 0;\n  virtual void Print(std::ostream *o) const = 0;\n  virtual const string &Type() const = 0;\n  virtual string ToString() const = 0;\n  virtual bool operator==(const WeightImplBase &other) const = 0;\n  virtual bool operator!=(const WeightImplBase &other) const = 0;\n  virtual WeightImplBase &PlusEq(const WeightImplBase &other) = 0;\n  virtual WeightImplBase &TimesEq(const WeightImplBase &other) = 0;\n  virtual WeightImplBase &DivideEq(const WeightImplBase &other) = 0;\n  virtual WeightImplBase &PowerEq(size_t n) = 0;\n  virtual ~WeightImplBase() {}\n};\n\ntemplate <class W>\nclass WeightClassImpl : public WeightImplBase {\n public:\n  explicit WeightClassImpl(const W &weight) : weight_(weight) {}\n\n  WeightClassImpl<W> *Copy() const final {\n    return new WeightClassImpl<W>(weight_);\n  }\n\n  const string &Type() const final { return W::Type(); }\n\n  void Print(std::ostream *ostrm) const final { *ostrm << weight_; }\n\n  string ToString() const final {\n    string str;\n    WeightToStr(weight_, &str);\n    return str;\n  }\n\n  bool operator==(const WeightImplBase &other) const final {\n    const auto *typed_other = static_cast<const WeightClassImpl<W> *>(&other);\n    return weight_ == typed_other->weight_;\n  }\n\n  bool operator!=(const WeightImplBase &other) const final {\n    return !(*this == other);\n  }\n\n  WeightClassImpl<W> &PlusEq(const WeightImplBase &other) final {\n    const auto *typed_other = static_cast<const WeightClassImpl<W> *>(&other);\n    weight_ = Plus(weight_, typed_other->weight_);\n    return *this;\n  }\n\n  WeightClassImpl<W> &TimesEq(const WeightImplBase &other) final {\n    const auto *typed_other = static_cast<const WeightClassImpl<W> *>(&other);\n    weight_ = Times(weight_, typed_other->weight_);\n    return *this;\n  }\n\n  WeightClassImpl<W> &DivideEq(const WeightImplBase &other) final {\n    const auto *typed_other = static_cast<const WeightClassImpl<W> *>(&other);\n    weight_ = Divide(weight_, typed_other->weight_);\n    return *this;\n  }\n\n  WeightClassImpl<W> &PowerEq(size_t n) final {\n    weight_ = Power<W>(weight_, n);\n    return *this;\n  }\n\n  W *GetImpl() { return &weight_; }\n\n private:\n  W weight_;\n};\n\n\nclass WeightClass {\n public:\n  WeightClass() = default;\n\n  template <class W>\n  explicit WeightClass(const W &weight)\n      : impl_(new WeightClassImpl<W>(weight)) {}\n\n  template <class W>\n  explicit WeightClass(const WeightClassImpl<W> &impl)\n      : impl_(new WeightClassImpl<W>(impl)) {}\n\n  WeightClass(const string &weight_type, const string &weight_str);\n\n  WeightClass(const WeightClass &other)\n      : impl_(other.impl_ ? other.impl_->Copy() : nullptr) {}\n\n  WeightClass &operator=(const WeightClass &other) {\n    impl_.reset(other.impl_ ? other.impl_->Copy() : nullptr);\n    return *this;\n  }\n\n  static constexpr const char *__ZERO__ = \"__ZERO__\";  // NOLINT\n\n  static WeightClass Zero(const string &weight_type);\n\n  static constexpr const char *__ONE__ = \"__ONE__\";  // NOLINT\n\n  static WeightClass One(const string &weight_type);\n\n  static constexpr const char *__NOWEIGHT__ = \"__NOWEIGHT__\";  // NOLINT\n\n  static WeightClass NoWeight(const string &weight_type);\n\n  template <class W>\n  const W *GetWeight() const {\n    if (W::Type() != impl_->Type()) {\n       return nullptr;\n    } else {\n      auto *typed_impl = static_cast<WeightClassImpl<W> *>(impl_.get());\n      return typed_impl->GetImpl();\n    }\n  }\n\n  string ToString() const { return (impl_) ? impl_->ToString() : \"none\"; }\n\n  const string &Type() const {\n    if (impl_) return impl_->Type();\n    static const string *const no_type = new string(\"none\");\n    return *no_type;\n  }\n\n  bool WeightTypesMatch(const WeightClass &other, const string &op_name) const;\n\n  friend bool operator==(const WeightClass &lhs, const WeightClass &rhs);\n\n  friend WeightClass Plus(const WeightClass &lhs, const WeightClass &rhs);\n\n  friend WeightClass Times(const WeightClass &lhs, const WeightClass &rhs);\n\n  friend WeightClass Divide(const WeightClass &lhs, const WeightClass &rhs);\n\n  friend WeightClass Power(const WeightClass &w, size_t n);\n\n private:\n  const WeightImplBase *GetImpl() const { return impl_.get(); }\n\n  WeightImplBase *GetImpl() { return impl_.get(); }\n\n  std::unique_ptr<WeightImplBase> impl_;\n\n  friend std::ostream &operator<<(std::ostream &o, const WeightClass &c);\n};\n\nbool operator==(const WeightClass &lhs, const WeightClass &rhs);\n\nbool operator!=(const WeightClass &lhs, const WeightClass &rhs);\n\nWeightClass Plus(const WeightClass &lhs, const WeightClass &rhs);\n\nWeightClass Times(const WeightClass &lhs, const WeightClass &rhs);\n\nWeightClass Divide(const WeightClass &lhs, const WeightClass &rhs);\n\nWeightClass Power(const WeightClass &w, size_t n);\n\nstd::ostream &operator<<(std::ostream &o, const WeightClass &c);\n\n// Registration for generic weight types.\n\nusing StrToWeightImplBaseT = WeightImplBase *(*)(const string &str,\n                                                 const string &src,\n                                                 size_t nline);\n\ntemplate <class W>\nWeightImplBase *StrToWeightImplBase(const string &str, const string &src,\n                                    size_t nline) {\n  if (str == WeightClass::__ZERO__)\n    return new WeightClassImpl<W>(W::Zero());\n  else if (str == WeightClass::__ONE__)\n    return new WeightClassImpl<W>(W::One());\n  else if (str == WeightClass::__NOWEIGHT__)\n    return new WeightClassImpl<W>(W::NoWeight());\n  return new WeightClassImpl<W>(StrToWeight<W>(str, src, nline));\n}\n\nclass WeightClassRegister : public GenericRegister<string, StrToWeightImplBaseT,\n                                                   WeightClassRegister> {\n protected:\n  string ConvertKeyToSoFilename(const string &key) const final {\n    string legal_type(key);\n    ConvertToLegalCSymbol(&legal_type);\n    return legal_type + \".so\";\n  }\n};\n\nusing WeightClassRegisterer = GenericRegisterer<WeightClassRegister>;\n\n// Internal version; needs to be called by wrapper in order for macro args to\n// expand.\n#define REGISTER_FST_WEIGHT__(Weight, line)                \\\n  static WeightClassRegisterer weight_registerer##_##line( \\\n      Weight::Type(), StrToWeightImplBase<Weight>)\n\n// This layer is where __FILE__ and __LINE__ are expanded.\n#define REGISTER_FST_WEIGHT_EXPANDER(Weight, line) \\\n  REGISTER_FST_WEIGHT__(Weight, line)\n\n// Macro for registering new weight types; clients call this.\n#define REGISTER_FST_WEIGHT(Weight) \\\n  REGISTER_FST_WEIGHT_EXPANDER(Weight, __LINE__)\n\n}  // namespace script\n}  // namespace fst\n\n#endif  // FST_SCRIPT_WEIGHT_CLASS_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/set-weight.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Weights consisting of sets (of integral Labels) and\n// associated semiring operation definitions using intersect\n// and union.\n\n#ifndef FST_SET_WEIGHT_H_\n#define FST_SET_WEIGHT_H_\n\n#include <cstdlib>\n\n#include <algorithm>\n#include <list>\n#include <string>\n#include <vector>\n\n#include <fst/union-weight.h>\n#include <fst/weight.h>\n\n\nnamespace fst {\n\nconstexpr int kSetEmpty = 0;         // Label for the empty set.\nconstexpr int kSetUniv = -1;         // Label for the universal set.\nconstexpr int kSetBad = -2;          // Label for a non-set.\nconstexpr char kSetSeparator = '_';  // Label separator in sets.\n\n// Determines whether to use (intersect, union) or (union, intersect)\n// as (+, *) for the semiring. SET_INTERSECT_UNION_RESTRICTED is a\n// restricted version of (intersect, union) that requires summed\n// arguments to be equal (or an error is signalled), useful for\n// algorithms that require a unique labelled path weight.  SET_BOOLEAN\n// treats all non-Zero() elements as equivalent (with Zero() ==\n// UnivSet()), useful for algorithms that don't really depend on the\n// detailed sets.\nenum SetType { SET_INTERSECT_UNION = 0,\n               SET_UNION_INTERSECT = 1,\n               SET_INTERSECT_UNION_RESTRICT = 2,\n               SET_BOOLEAN = 3 };\n\ntemplate <class>\nclass SetWeightIterator;\n\n// Set semiring of integral labels.\ntemplate <typename Label_, SetType S = SET_INTERSECT_UNION>\nclass SetWeight {\n public:\n  using Label = Label_;\n  using ReverseWeight = SetWeight<Label, S>;\n  using Iterator = SetWeightIterator<SetWeight>;\n  friend class SetWeightIterator<SetWeight>;\n  // Allow type-converting copy and move constructors private access.\n  template <typename L2, SetType S2>\n  friend class SetWeight;\n\n  SetWeight() {}\n\n  // Input should be positive, sorted and unique.\n  template <typename Iterator>\n  SetWeight(const Iterator &begin, const Iterator &end) {\n    for (auto iter = begin; iter != end; ++iter) PushBack(*iter);\n  }\n\n  // Input should be positive. (Non-positive value has\n  // special internal meaning w.r.t. integral constants above.)\n  explicit SetWeight(Label label) { PushBack(label); }\n\n  template <SetType S2>\n  explicit SetWeight(const SetWeight<Label, S2> &w)\n    : first_(w.first_), rest_(w.rest_) {}\n\n  template <SetType S2>\n  explicit SetWeight(SetWeight<Label, S2> &&w)\n    : first_(w.first_), rest_(std::move(w.rest_)) { w.Clear(); }\n\n  template <SetType S2>\n  SetWeight &operator=(const SetWeight<Label, S2> &w) {\n    first_ = w.first_;\n    rest_ = w.rest_;\n    return *this;\n  }\n\n  template <SetType S2>\n  SetWeight &operator=(SetWeight<Label, S2> &&w) {\n    first_ = w.first_;\n    rest_ = std::move(w.rest_);\n    w.Clear();\n    return *this;\n  }\n\n  static const SetWeight &Zero() {\n    return S == SET_UNION_INTERSECT ? EmptySet() : UnivSet();\n  }\n\n  static const SetWeight &One() {\n    return S == SET_UNION_INTERSECT ? UnivSet() : EmptySet();\n  }\n\n  static const SetWeight &NoWeight() {\n    static const auto *const no_weight = new SetWeight(Label(kSetBad));\n    return *no_weight;\n  }\n\n  static const string &Type() {\n    static const string *const type = new string(\n        S == SET_UNION_INTERSECT\n        ? \"union_intersect_set\"\n        : (S == SET_INTERSECT_UNION\n           ? \"intersect_union_set\"\n           : (S == SET_INTERSECT_UNION_RESTRICT\n              ? \"restricted_set_intersect_union\"\n              : \"boolean_set\")));\n    return *type;\n  }\n\n  bool Member() const;\n\n  std::istream &Read(std::istream &strm);\n\n  std::ostream &Write(std::ostream &strm) const;\n\n  size_t Hash() const;\n\n  SetWeight Quantize(float delta = kDelta) const { return *this; }\n\n  ReverseWeight Reverse() const;\n\n  static constexpr uint64 Properties() {\n    return kIdempotent | kLeftSemiring | kRightSemiring | kCommutative;\n  }\n\n  // These operations combined with the SetWeightIterator\n  // provide the access and mutation of the set internal elements.\n\n  // The empty set.\n  static const SetWeight &EmptySet() {\n    static const auto *const empty = new SetWeight(Label(kSetEmpty));\n    return *empty;\n  }\n\n  // The univeral set.\n  static const SetWeight &UnivSet() {\n    static const auto *const univ = new SetWeight(Label(kSetUniv));\n    return *univ;\n  }\n\n  // Clear existing SetWeight.\n  void Clear() {\n    first_ = kSetEmpty;\n    rest_.clear();\n  }\n\n  size_t Size() const { return first_ == kSetEmpty ? 0 : rest_.size() + 1; }\n\n  Label Back() {\n    if (rest_.empty()) {\n      return first_;\n    } else {\n      return rest_.back();\n    }\n  }\n\n  // Caller must add in sort order and be unique (or error signalled).\n  // Input should also be positive. Non-positive value (for the first\n  // push) has special internal meaning w.r.t. integral constants above.\n  void PushBack(Label label) {\n    if (first_ == kSetEmpty) {\n      first_ = label;\n    } else {\n      if (label <= Back() || label <= 0) {\n        FSTERROR() << \"SetWeight: labels must be positive, added\"\n                   << \" in sort order and be unique.\";\n        rest_.push_back(Label(kSetBad));\n      }\n      rest_.push_back(label);\n    }\n  }\n\n private:\n  Label first_ = kSetEmpty;  // First label in set (kSetEmpty if empty).\n  std::list<Label> rest_;    // Remaining labels in set.\n};\n\n// Traverses set in forward direction.\ntemplate <class SetWeight_>\nclass SetWeightIterator {\n public:\n  using Weight = SetWeight_;\n  using Label = typename Weight::Label;\n\n  explicit SetWeightIterator(const Weight &w)\n      : first_(w.first_), rest_(w.rest_), init_(true), iter_(rest_.begin()) {}\n\n  bool Done() const {\n    if (init_) {\n      return first_ == kSetEmpty;\n    } else {\n      return iter_ == rest_.end();\n    }\n  }\n\n  const Label &Value() const { return init_ ? first_ : *iter_; }\n\n  void Next() {\n    if (init_) {\n      init_ = false;\n    } else {\n      ++iter_;\n    }\n  }\n\n  void Reset() {\n    init_ = true;\n    iter_ = rest_.begin();\n  }\n\n private:\n  const Label &first_;\n  const decltype(Weight::rest_) &rest_;\n  bool init_;  // In the initialized state?\n  typename decltype(Weight::rest_)::const_iterator iter_;\n};\n\n\n// SetWeight member functions follow that require SetWeightIterator\n\ntemplate <typename Label, SetType S>\ninline std::istream &SetWeight<Label, S>::Read(std::istream &strm) {\n  Clear();\n  int32 size;\n  ReadType(strm, &size);\n  for (int32 i = 0; i < size; ++i) {\n    Label label;\n    ReadType(strm, &label);\n    PushBack(label);\n  }\n  return strm;\n}\n\ntemplate <typename Label, SetType S>\ninline std::ostream &SetWeight<Label, S>::Write(std::ostream &strm) const {\n  const int32 size = Size();\n  WriteType(strm, size);\n  for (Iterator iter(*this); !iter.Done(); iter.Next()) {\n    WriteType(strm, iter.Value());\n  }\n  return strm;\n}\n\ntemplate <typename Label, SetType S>\ninline bool SetWeight<Label, S>::Member() const {\n  Iterator iter(*this);\n  return iter.Value() != Label(kSetBad);\n}\n\ntemplate <typename Label, SetType S>\ninline typename SetWeight<Label, S>::ReverseWeight\nSetWeight<Label, S>::Reverse() const {\n  return *this;\n}\n\ntemplate <typename Label, SetType S>\ninline size_t SetWeight<Label, S>::Hash() const {\n  using Weight = SetWeight<Label, S>;\n  if (S == SET_BOOLEAN) {\n    return *this == Weight::Zero() ? 0 : 1;\n  } else {\n    size_t h = 0;\n    for (Iterator iter(*this); !iter.Done(); iter.Next()) {\n      h ^= h << 1 ^ iter.Value();\n    }\n    return h;\n  }\n}\n\n// Default ==\ntemplate <typename Label, SetType S>\ninline bool operator==(const SetWeight<Label, S> &w1,\n                       const SetWeight<Label, S> &w2) {\n  if (w1.Size() != w2.Size()) return false;\n  using Iterator = typename SetWeight<Label, S>::Iterator;\n  Iterator iter1(w1);\n  Iterator iter2(w2);\n  for (; !iter1.Done(); iter1.Next(), iter2.Next()) {\n    if (iter1.Value() != iter2.Value()) return false;\n  }\n  return true;\n}\n\n// Boolean ==\ntemplate <typename Label>\ninline bool operator==(const SetWeight<Label, SET_BOOLEAN> &w1,\n                       const SetWeight<Label, SET_BOOLEAN> &w2) {\n  // x == kSetEmpty if x \\nin {kUnivSet, kSetBad}\n  if (!w1.Member() || !w2.Member()) return false;\n  using Iterator = typename SetWeight<Label, SET_BOOLEAN>::Iterator;\n  Iterator iter1(w1);\n  Iterator iter2(w2);\n  Label label1 = iter1.Done() ? kSetEmpty : iter1.Value();\n  Label label2 = iter2.Done() ? kSetEmpty : iter2.Value();\n  if (label1 == kSetUniv) return label2 == kSetUniv;\n  if (label2 == kSetUniv) return label1 == kSetUniv;\n  return true;\n}\n\ntemplate <typename Label, SetType S>\ninline bool operator!=(const SetWeight<Label, S> &w1,\n                       const SetWeight<Label, S> &w2) {\n  return !(w1 == w2);\n}\n\ntemplate <typename Label, SetType S>\ninline bool ApproxEqual(const SetWeight<Label, S> &w1,\n                        const SetWeight<Label, S> &w2,\n                        float delta = kDelta) {\n  return w1 == w2;\n}\n\ntemplate <typename Label, SetType S>\ninline std::ostream &operator<<(std::ostream &strm,\n                                const SetWeight<Label, S> &weight) {\n  typename SetWeight<Label, S>::Iterator iter(weight);\n  if (iter.Done()) {\n    return strm << \"EmptySet\";\n  } else if (iter.Value() == Label(kSetUniv)) {\n    return strm << \"UnivSet\";\n  } else if (iter.Value() == Label(kSetBad)) {\n    return strm << \"BadSet\";\n  } else {\n    for (size_t i = 0; !iter.Done(); ++i, iter.Next()) {\n      if (i > 0) strm << kSetSeparator;\n      strm << iter.Value();\n    }\n  }\n  return strm;\n}\n\ntemplate <typename Label, SetType S>\ninline std::istream &operator>>(std::istream &strm,\n                                SetWeight<Label, S> &weight) {\n  string str;\n  strm >> str;\n  using Weight = SetWeight<Label, S>;\n  if (str == \"EmptySet\") {\n    weight = Weight(Label(kSetEmpty));\n  } else if (str == \"UnivSet\") {\n    weight = Weight(Label(kSetUniv));\n  } else {\n    weight.Clear();\n    char *p = nullptr;\n    for (const char *cs = str.c_str(); !p || *p != '\\0'; cs = p + 1) {\n      const Label label = strtoll(cs, &p, 10);\n      if (p == cs || (*p != 0 && *p != kSetSeparator)) {\n        strm.clear(std::ios::badbit);\n        break;\n      }\n      weight.PushBack(label);\n    }\n  }\n  return strm;\n}\n\ntemplate <typename Label, SetType S>\ninline SetWeight<Label, S> Union(\n    const SetWeight<Label, S> &w1,\n    const SetWeight<Label, S> &w2) {\n  using Weight = SetWeight<Label, S>;\n  using Iterator = typename SetWeight<Label, S>::Iterator;\n  if (!w1.Member() || !w2.Member()) return Weight::NoWeight();\n  if (w1 == Weight::EmptySet()) return w2;\n  if (w2 == Weight::EmptySet()) return w1;\n  if (w1 == Weight::UnivSet()) return w1;\n  if (w2 == Weight::UnivSet()) return w2;\n  Iterator it1(w1);\n  Iterator it2(w2);\n  Weight result;\n  while (!it1.Done() && !it2.Done()) {\n    const auto v1 = it1.Value();\n    const auto v2 = it2.Value();\n    if (v1 < v2) {\n      result.PushBack(v1);\n      it1.Next();\n    } else if (v1 > v2) {\n      result.PushBack(v2);\n      it2.Next();\n    } else {\n      result.PushBack(v1);\n      it1.Next();\n      it2.Next();\n    }\n  }\n  for (; !it1.Done(); it1.Next()) result.PushBack(it1.Value());\n  for (; !it2.Done(); it2.Next()) result.PushBack(it2.Value());\n  return result;\n}\n\ntemplate <typename Label, SetType S>\ninline SetWeight<Label, S> Intersect(\n    const SetWeight<Label, S> &w1,\n    const SetWeight<Label, S> &w2) {\n  using Weight = SetWeight<Label, S>;\n  using Iterator = typename SetWeight<Label, S>::Iterator;\n  if (!w1.Member() || !w2.Member()) return Weight::NoWeight();\n  if (w1 == Weight::EmptySet()) return w1;\n  if (w2 == Weight::EmptySet()) return w2;\n  if (w1 == Weight::UnivSet()) return w2;\n  if (w2 == Weight::UnivSet()) return w1;\n  Iterator it1(w1);\n  Iterator it2(w2);\n  Weight result;\n  while (!it1.Done() && !it2.Done()) {\n    const auto v1 = it1.Value();\n    const auto v2 = it2.Value();\n    if (v1 < v2) {\n      it1.Next();\n    } else if (v1 > v2) {\n      it2.Next();\n    } else {\n      result.PushBack(v1);\n      it1.Next();\n      it2.Next();\n    }\n  }\n  return result;\n}\n\ntemplate <typename Label, SetType S>\ninline SetWeight<Label, S> Difference(\n    const SetWeight<Label, S> &w1,\n    const SetWeight<Label, S> &w2) {\n  using Weight = SetWeight<Label, S>;\n  using Iterator = typename SetWeight<Label, S>::Iterator;\n  if (!w1.Member() || !w2.Member()) return Weight::NoWeight();\n  if (w1 == Weight::EmptySet()) return w1;\n  if (w2 == Weight::EmptySet()) return w1;\n  if (w2 == Weight::UnivSet()) return Weight::EmptySet();\n  Iterator it1(w1);\n  Iterator it2(w2);\n  Weight result;\n  while (!it1.Done() && !it2.Done()) {\n    const auto v1 = it1.Value();\n    const auto v2 = it2.Value();\n    if (v1 < v2) {\n      result.PushBack(v1);\n      it1.Next();\n    } else if (v1 > v2) {\n      it2.Next();\n    } else {\n      it1.Next();\n      it2.Next();\n    }\n  }\n  for (; !it1.Done(); it1.Next()) result.PushBack(it1.Value());\n  return result;\n}\n\n// Default: Plus = Intersect.\ntemplate <typename Label, SetType S>\ninline SetWeight<Label, S> Plus(\n    const SetWeight<Label, S> &w1,\n    const SetWeight<Label, S> &w2) {\n  return Intersect(w1, w2);\n}\n\n// Plus = Union.\ntemplate <typename Label>\ninline SetWeight<Label, SET_UNION_INTERSECT> Plus(\n    const SetWeight<Label, SET_UNION_INTERSECT> &w1,\n    const SetWeight<Label, SET_UNION_INTERSECT> &w2) {\n  return Union(w1, w2);\n}\n\n// Plus = Set equality is required (for non-Zero() input). The\n// restriction is useful (e.g., in determinization) to ensure the input\n// has a unique labelled path weight.\ntemplate <typename Label>\ninline SetWeight<Label, SET_INTERSECT_UNION_RESTRICT> Plus(\n    const SetWeight<Label, SET_INTERSECT_UNION_RESTRICT> &w1,\n    const SetWeight<Label, SET_INTERSECT_UNION_RESTRICT> &w2) {\n  using Weight = SetWeight<Label, SET_INTERSECT_UNION_RESTRICT>;\n  if (!w1.Member() || !w2.Member()) return Weight::NoWeight();\n  if (w1 == Weight::Zero()) return w2;\n  if (w2 == Weight::Zero()) return w1;\n  if (w1 != w2) {\n    FSTERROR() << \"SetWeight::Plus: Unequal arguments \"\n               << \"(non-unique labelled path weights?)\"\n               << \" w1 = \" << w1 << \" w2 = \" << w2;\n    return Weight::NoWeight();\n  }\n  return w1;\n}\n\n// Plus = Or.\ntemplate <typename Label>\ninline SetWeight<Label, SET_BOOLEAN> Plus(\n    const SetWeight<Label, SET_BOOLEAN> &w1,\n    const SetWeight<Label, SET_BOOLEAN> &w2) {\n  using Weight = SetWeight<Label, SET_BOOLEAN>;\n  if (!w1.Member() || !w2.Member()) return Weight::NoWeight();\n  if (w1 == Weight::One()) return w1;\n  if (w2 == Weight::One()) return w2;\n  return Weight::Zero();\n}\n\n// Default: Times = Union.\ntemplate <typename Label, SetType S>\ninline SetWeight<Label, S> Times(\n    const SetWeight<Label, S> &w1,\n    const SetWeight<Label, S> &w2) {\n  return Union(w1, w2);\n}\n\n// Times = Intersect.\ntemplate <typename Label>\ninline SetWeight<Label, SET_UNION_INTERSECT> Times(\n    const SetWeight<Label, SET_UNION_INTERSECT> &w1,\n    const SetWeight<Label, SET_UNION_INTERSECT> &w2) {\n  return Intersect(w1, w2);\n}\n\n// Times = And.\ntemplate <typename Label>\ninline SetWeight<Label, SET_BOOLEAN> Times(\n    const SetWeight<Label, SET_BOOLEAN> &w1,\n    const SetWeight<Label, SET_BOOLEAN> &w2) {\n  using Weight = SetWeight<Label, SET_BOOLEAN>;\n  if (!w1.Member() || !w2.Member()) return Weight::NoWeight();\n  if (w1 == Weight::One()) return w2;\n  return w1;\n}\n\n// Divide = Difference.\ntemplate <typename Label, SetType S>\ninline SetWeight<Label, S> Divide(const SetWeight<Label, S> &w1,\n                                  const SetWeight<Label, S> &w2,\n                                  DivideType divide_type = DIVIDE_ANY) {\n  return Difference(w1, w2);\n}\n\n// Divide = dividend (or the universal set if the\n// dividend == divisor).\ntemplate <typename Label>\ninline SetWeight<Label, SET_UNION_INTERSECT> Divide(\n    const SetWeight<Label, SET_UNION_INTERSECT> &w1,\n    const SetWeight<Label, SET_UNION_INTERSECT> &w2,\n    DivideType divide_type = DIVIDE_ANY) {\n  using Weight = SetWeight<Label, SET_UNION_INTERSECT>;\n  if (!w1.Member() || !w2.Member()) return Weight::NoWeight();\n  if (w1 == w2) return Weight::UnivSet();\n  return w1;\n}\n\n// Divide = Or Not.\ntemplate <typename Label>\ninline SetWeight<Label, SET_BOOLEAN> Divide(\n    const SetWeight<Label, SET_BOOLEAN> &w1,\n    const SetWeight<Label, SET_BOOLEAN> &w2,\n    DivideType divide_type = DIVIDE_ANY) {\n  using Weight = SetWeight<Label, SET_BOOLEAN>;\n  if (!w1.Member() || !w2.Member()) return Weight::NoWeight();\n  if (w1 == Weight::One()) return w1;\n  if (w2 == Weight::Zero()) return Weight::One();\n  return Weight::Zero();\n}\n\n// Converts between different set types.\ntemplate <typename Label, SetType S1, SetType S2>\nstruct WeightConvert<SetWeight<Label, S1>, SetWeight<Label, S2>> {\n  SetWeight<Label, S2> operator()(const SetWeight<Label, S1> &w1) const {\n    using Iterator = SetWeightIterator<SetWeight<Label, S1>>;\n    SetWeight<Label, S2> w2;\n    for (Iterator iter(w1); !iter.Done(); iter.Next())\n      w2.PushBack(iter.Value());\n    return w2;\n  }\n};\n\n// This function object generates SetWeights that are random integer sets\n// from {1, ... , alphabet_size}^{0, max_set_length} U { Zero }. This is\n// intended primarily for testing.\ntemplate <class Label, SetType S>\nclass WeightGenerate<SetWeight<Label, S>> {\n public:\n  using Weight = SetWeight<Label, S>;\n\n  explicit WeightGenerate(bool allow_zero = true,\n                          size_t alphabet_size = kNumRandomWeights,\n                          size_t max_set_length = kNumRandomWeights)\n      : allow_zero_(allow_zero),\n        alphabet_size_(alphabet_size),\n        max_set_length_(max_set_length) {}\n\n  Weight operator()() const {\n    const size_t n = rand() % (max_set_length_ + allow_zero_);  // NOLINT\n    if (allow_zero_ && n == max_set_length_) return Weight::Zero();\n    std::vector<Label> labels;\n    for (size_t i = 0; i < n; ++i) {\n      labels.push_back(rand() % alphabet_size_ + 1);  // NOLINT\n    }\n    std::sort(labels.begin(), labels.end());\n    const auto labels_end = std::unique(labels.begin(), labels.end());\n    labels.resize(labels_end - labels.begin());\n    return Weight(labels.begin(), labels.end());\n  }\n\n private:\n  // Permits Zero() and zero divisors.\n  const bool allow_zero_;\n  // Alphabet size for random weights.\n  const size_t alphabet_size_;\n  // Number of alternative random weights.\n  const size_t max_set_length_;\n};\n\n}  // namespace fst\n\n#endif  // FST_SET_WEIGHT_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/shortest-distance.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Functions and classes to find shortest distance in an FST.\n\n#ifndef FST_SHORTEST_DISTANCE_H_\n#define FST_SHORTEST_DISTANCE_H_\n\n#include <deque>\n#include <vector>\n\n#include <fst/log.h>\n\n#include <fst/arcfilter.h>\n#include <fst/cache.h>\n#include <fst/queue.h>\n#include <fst/reverse.h>\n#include <fst/test-properties.h>\n\n\nnamespace fst {\n\n// A representable float for shortest distance and shortest path algorithms.\nconstexpr float kShortestDelta = 1e-6;\n\ntemplate <class Arc, class Queue, class ArcFilter>\nstruct ShortestDistanceOptions {\n  using StateId = typename Arc::StateId;\n\n  Queue *state_queue;    // Queue discipline used; owned by caller.\n  ArcFilter arc_filter;  // Arc filter (e.g., limit to only epsilon graph).\n  StateId source;        // If kNoStateId, use the FST's initial state.\n  float delta;           // Determines the degree of convergence required\n  bool first_path;       // For a semiring with the path property (o.w.\n                         // undefined), compute the shortest-distances along\n                         // along the first path to a final state found\n                         // by the algorithm. That path is the shortest-path\n                         // only if the FST has a unique final state (or all\n                         // the final states have the same final weight), the\n                         // queue discipline is shortest-first and all the\n                         // weights in the FST are between One() and Zero()\n                         // according to NaturalLess.\n\n  ShortestDistanceOptions(Queue *state_queue, ArcFilter arc_filter,\n                          StateId source = kNoStateId,\n                          float delta = kShortestDelta)\n      : state_queue(state_queue),\n        arc_filter(arc_filter),\n        source(source),\n        delta(delta),\n        first_path(false) {}\n};\n\nnamespace internal {\n\n// Computation state of the shortest-distance algorithm. Reusable information\n// is maintained across calls to member function ShortestDistance(source) when\n// retain is true for improved efficiency when calling multiple times from\n// different source states (e.g., in epsilon removal). Contrary to the usual\n// conventions, fst may not be freed before this class. Vector distance\n// should not be modified by the user between these calls. The Error() method\n// returns true iff an error was encountered.\ntemplate <class Arc, class Queue, class ArcFilter>\nclass ShortestDistanceState {\n public:\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  ShortestDistanceState(\n      const Fst<Arc> &fst, std::vector<Weight> *distance,\n      const ShortestDistanceOptions<Arc, Queue, ArcFilter> &opts, bool retain)\n      : fst_(fst),\n        distance_(distance),\n        state_queue_(opts.state_queue),\n        arc_filter_(opts.arc_filter),\n        delta_(opts.delta),\n        first_path_(opts.first_path),\n        retain_(retain),\n        source_id_(0),\n        error_(false) {\n    distance_->clear();\n  }\n\n  void ShortestDistance(StateId source);\n\n  bool Error() const { return error_; }\n\n private:\n  const Fst<Arc> &fst_;\n  std::vector<Weight> *distance_;\n  Queue *state_queue_;\n  ArcFilter arc_filter_;\n  const float delta_;\n  const bool first_path_;\n  const bool retain_;  // Retain and reuse information across calls.\n\n  std::vector<Adder<Weight>> adder_;   // Sums distance_ accurately.\n  std::vector<Adder<Weight>> radder_;  // Relaxation distance.\n  std::vector<bool> enqueued_;         // Is state enqueued?\n  std::vector<StateId> sources_;       // Source ID for ith state in distance_,\n                                       // (r)adder_, and enqueued_ if retained.\n  StateId source_id_;                  // Unique ID characterizing each call.\n  bool error_;\n};\n\n// Compute the shortest distance; if source is kNoStateId, uses the initial\n// state of the FST.\ntemplate <class Arc, class Queue, class ArcFilter>\nvoid ShortestDistanceState<Arc, Queue, ArcFilter>::ShortestDistance(\n    StateId source) {\n  if (fst_.Start() == kNoStateId) {\n    if (fst_.Properties(kError, false)) error_ = true;\n    return;\n  }\n  if (!(Weight::Properties() & kRightSemiring)) {\n    FSTERROR() << \"ShortestDistance: Weight needs to be right distributive: \"\n               << Weight::Type();\n    error_ = true;\n    return;\n  }\n  if (first_path_ && !(Weight::Properties() & kPath)) {\n    FSTERROR() << \"ShortestDistance: The first_path option is disallowed when \"\n               << \"Weight does not have the path property: \" << Weight::Type();\n    error_ = true;\n    return;\n  }\n  state_queue_->Clear();\n  if (!retain_) {\n    distance_->clear();\n    adder_.clear();\n    radder_.clear();\n    enqueued_.clear();\n  }\n  if (source == kNoStateId) source = fst_.Start();\n  while (distance_->size() <= source) {\n    distance_->push_back(Weight::Zero());\n    adder_.push_back(Adder<Weight>());\n    radder_.push_back(Adder<Weight>());\n    enqueued_.push_back(false);\n  }\n  if (retain_) {\n    while (sources_.size() <= source) sources_.push_back(kNoStateId);\n    sources_[source] = source_id_;\n  }\n  (*distance_)[source] = Weight::One();\n  adder_[source].Reset(Weight::One());\n  radder_[source].Reset(Weight::One());\n  enqueued_[source] = true;\n  state_queue_->Enqueue(source);\n  while (!state_queue_->Empty()) {\n    const auto state = state_queue_->Head();\n    state_queue_->Dequeue();\n    while (distance_->size() <= state) {\n      distance_->push_back(Weight::Zero());\n      adder_.push_back(Adder<Weight>());\n      radder_.push_back(Adder<Weight>());\n      enqueued_.push_back(false);\n    }\n    if (first_path_ && (fst_.Final(state) != Weight::Zero())) break;\n    enqueued_[state] = false;\n    const auto r = radder_[state].Sum();\n    radder_[state].Reset();\n    for (ArcIterator<Fst<Arc>> aiter(fst_, state); !aiter.Done();\n         aiter.Next()) {\n      const auto &arc = aiter.Value();\n      if (!arc_filter_(arc)) continue;\n      while (distance_->size() <= arc.nextstate) {\n        distance_->push_back(Weight::Zero());\n        adder_.push_back(Adder<Weight>());\n        radder_.push_back(Adder<Weight>());\n        enqueued_.push_back(false);\n      }\n      if (retain_) {\n        while (sources_.size() <= arc.nextstate) sources_.push_back(kNoStateId);\n        if (sources_[arc.nextstate] != source_id_) {\n          (*distance_)[arc.nextstate] = Weight::Zero();\n          adder_[arc.nextstate].Reset();\n          radder_[arc.nextstate].Reset();\n          enqueued_[arc.nextstate] = false;\n          sources_[arc.nextstate] = source_id_;\n        }\n      }\n      auto &nd = (*distance_)[arc.nextstate];\n      auto &na = adder_[arc.nextstate];\n      auto &nr = radder_[arc.nextstate];\n      auto weight = Times(r, arc.weight);\n      if (!ApproxEqual(nd, Plus(nd, weight), delta_)) {\n        nd = na.Add(weight);\n        nr.Add(weight);\n        if (!nd.Member() || !nr.Sum().Member()) {\n          error_ = true;\n          return;\n        }\n        if (!enqueued_[arc.nextstate]) {\n          state_queue_->Enqueue(arc.nextstate);\n          enqueued_[arc.nextstate] = true;\n        } else {\n          state_queue_->Update(arc.nextstate);\n        }\n      }\n    }\n  }\n  ++source_id_;\n  if (fst_.Properties(kError, false)) error_ = true;\n}\n\n}  // namespace internal\n\n// Shortest-distance algorithm: this version allows fine control\n// via the options argument. See below for a simpler interface.\n//\n// This computes the shortest distance from the opts.source state to each\n// visited state S and stores the value in the distance vector. An\n// nvisited state S has distance Zero(), which will be stored in the\n// distance vector if S is less than the maximum visited state. The state\n// queue discipline, arc filter, and convergence delta are taken in the\n// options argument. The distance vector will contain a unique element for\n// which Member() is false if an error was encountered.\n//\n// The weights must must be right distributive and k-closed (i.e., 1 +\n// x + x^2 + ... + x^(k +1) = 1 + x + x^2 + ... + x^k).\n//\n// Complexity:\n//\n// Depends on properties of the semiring and the queue discipline.\n//\n// For more information, see:\n//\n// Mohri, M. 2002. Semiring framework and algorithms for shortest-distance\n// problems, Journal of Automata, Languages and\n// Combinatorics 7(3): 321-350, 2002.\ntemplate <class Arc, class Queue, class ArcFilter>\nvoid ShortestDistance(\n    const Fst<Arc> &fst, std::vector<typename Arc::Weight> *distance,\n    const ShortestDistanceOptions<Arc, Queue, ArcFilter> &opts) {\n  internal::ShortestDistanceState<Arc, Queue, ArcFilter> sd_state(fst, distance,\n                                                                  opts, false);\n  sd_state.ShortestDistance(opts.source);\n  if (sd_state.Error()) {\n    distance->clear();\n    distance->resize(1, Arc::Weight::NoWeight());\n  }\n}\n\n// Shortest-distance algorithm: simplified interface. See above for a version\n// that permits finer control.\n//\n// If reverse is false, this computes the shortest distance from the initial\n// state to each state S and stores the value in the distance vector. If\n// reverse is true, this computes the shortest distance from each state to the\n// final states. An unvisited state S has distance Zero(), which will be stored\n// in the distance vector if S is less than the maximum visited state. The\n// state queue discipline is automatically-selected. The distance vector will\n// contain a unique element for which Member() is false if an error was\n// encountered.\n//\n// The weights must must be right (left) distributive if reverse is false (true)\n// and k-closed (i.e., 1 + x + x^2 + ... + x^(k +1) = 1 + x + x^2 + ... + x^k).\n//\n// Arc weights must satisfy the property that the sum of the weights of one or\n// more paths from some state S to T is never Zero(). In particular, arc weights\n// are never Zero().\n//\n// Complexity:\n//\n// Depends on properties of the semiring and the queue discipline.\n//\n// For more information, see:\n//\n// Mohri, M. 2002. Semiring framework and algorithms for\n// shortest-distance problems, Journal of Automata, Languages and\n// Combinatorics 7(3): 321-350, 2002.\ntemplate <class Arc>\nvoid ShortestDistance(const Fst<Arc> &fst,\n                      std::vector<typename Arc::Weight> *distance,\n                      bool reverse = false, float delta = kShortestDelta) {\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n  if (!reverse) {\n    AnyArcFilter<Arc> arc_filter;\n    AutoQueue<StateId> state_queue(fst, distance, arc_filter);\n    const ShortestDistanceOptions<Arc, AutoQueue<StateId>, AnyArcFilter<Arc>>\n        opts(&state_queue, arc_filter, kNoStateId, delta);\n    ShortestDistance(fst, distance, opts);\n  } else {\n    using ReverseArc = ReverseArc<Arc>;\n    using ReverseWeight = typename ReverseArc::Weight;\n    AnyArcFilter<ReverseArc> rarc_filter;\n    VectorFst<ReverseArc> rfst;\n    Reverse(fst, &rfst);\n    std::vector<ReverseWeight> rdistance;\n    AutoQueue<StateId> state_queue(rfst, &rdistance, rarc_filter);\n    const ShortestDistanceOptions<ReverseArc, AutoQueue<StateId>,\n                                  AnyArcFilter<ReverseArc>>\n        ropts(&state_queue, rarc_filter, kNoStateId, delta);\n    ShortestDistance(rfst, &rdistance, ropts);\n    distance->clear();\n    if (rdistance.size() == 1 && !rdistance[0].Member()) {\n      distance->resize(1, Arc::Weight::NoWeight());\n      return;\n    }\n    while (distance->size() < rdistance.size() - 1) {\n      distance->push_back(rdistance[distance->size() + 1].Reverse());\n    }\n  }\n}\n\n// Return the sum of the weight of all successful paths in an FST, i.e., the\n// shortest-distance from the initial state to the final states. Returns a\n// weight such that Member() is false if an error was encountered.\ntemplate <class Arc>\ntypename Arc::Weight ShortestDistance(const Fst<Arc> &fst,\n                                      float delta = kShortestDelta) {\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n  std::vector<Weight> distance;\n  if (Weight::Properties() & kRightSemiring) {\n    ShortestDistance(fst, &distance, false, delta);\n    if (distance.size() == 1 && !distance[0].Member()) {\n      return Arc::Weight::NoWeight();\n    }\n    Adder<Weight> adder;  // maintains cumulative sum accurately\n    for (StateId state = 0; state < distance.size(); ++state) {\n      adder.Add(Times(distance[state], fst.Final(state)));\n    }\n    return adder.Sum();\n  } else {\n    ShortestDistance(fst, &distance, true, delta);\n    const auto state = fst.Start();\n    if (distance.size() == 1 && !distance[0].Member()) {\n      return Arc::Weight::NoWeight();\n    }\n    return state != kNoStateId && state < distance.size() ? distance[state]\n                                                          : Weight::Zero();\n  }\n}\n\n}  // namespace fst\n\n#endif  // FST_SHORTEST_DISTANCE_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/shortest-path.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Functions to find shortest paths in an FST.\n\n#ifndef FST_SHORTEST_PATH_H_\n#define FST_SHORTEST_PATH_H_\n\n#include <functional>\n#include <type_traits>\n#include <utility>\n#include <vector>\n\n#include <fst/log.h>\n\n#include <fst/cache.h>\n#include <fst/determinize.h>\n#include <fst/queue.h>\n#include <fst/shortest-distance.h>\n#include <fst/test-properties.h>\n\n\nnamespace fst {\n\ntemplate <class Arc, class Queue, class ArcFilter>\nstruct ShortestPathOptions\n    : public ShortestDistanceOptions<Arc, Queue, ArcFilter> {\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  int32 nshortest;    // Returns n-shortest paths.\n  bool unique;        // Only returns paths with distinct input strings.\n  bool has_distance;  // Distance vector already contains the\n                      // shortest distance from the initial state.\n  bool first_path;    // Single shortest path stops after finding the first\n                      // path to a final state; that path is the shortest path\n                      // only when:\n                      // (1) using the ShortestFirstQueue with all the weights\n                      // in the FST being between One() and Zero() according to\n                      // NaturalLess or when\n                      // (2) using the NaturalAStarQueue with an admissible\n                      // and consistent estimate.\n  Weight weight_threshold;  // Pruning weight threshold.\n  StateId state_threshold;  // Pruning state threshold.\n\n  ShortestPathOptions(Queue *queue, ArcFilter filter, int32 nshortest = 1,\n                      bool unique = false, bool has_distance = false,\n                      float delta = kShortestDelta, bool first_path = false,\n                      Weight weight_threshold = Weight::Zero(),\n                      StateId state_threshold = kNoStateId)\n      : ShortestDistanceOptions<Arc, Queue, ArcFilter>(queue, filter,\n                                                       kNoStateId, delta),\n        nshortest(nshortest),\n        unique(unique),\n        has_distance(has_distance),\n        first_path(first_path),\n        weight_threshold(std::move(weight_threshold)),\n        state_threshold(state_threshold) {}\n};\n\nnamespace internal {\n\nconstexpr size_t kNoArc = -1;\n\n// Helper function for SingleShortestPath building the shortest path as a left-\n// to-right machine backwards from the best final state. It takes the input\n// FST passed to SingleShortestPath and the parent vector and f_parent returned\n// by that function, and builds the result into the provided output mutable FS\n// This is not normally called by users; see ShortestPath instead.\ntemplate <class Arc>\nvoid SingleShortestPathBacktrace(\n    const Fst<Arc> &ifst, MutableFst<Arc> *ofst,\n    const std::vector<std::pair<typename Arc::StateId, size_t>> &parent,\n    typename Arc::StateId f_parent) {\n  using StateId = typename Arc::StateId;\n  ofst->DeleteStates();\n  ofst->SetInputSymbols(ifst.InputSymbols());\n  ofst->SetOutputSymbols(ifst.OutputSymbols());\n  StateId s_p = kNoStateId;\n  StateId d_p = kNoStateId;\n  for (StateId state = f_parent, d = kNoStateId; state != kNoStateId;\n       d = state, state = parent[state].first) {\n    d_p = s_p;\n    s_p = ofst->AddState();\n    if (d == kNoStateId) {\n      ofst->SetFinal(s_p, ifst.Final(f_parent));\n    } else {\n      ArcIterator<Fst<Arc>> aiter(ifst, state);\n      aiter.Seek(parent[d].second);\n      auto arc = aiter.Value();\n      arc.nextstate = d_p;\n      ofst->AddArc(s_p, arc);\n    }\n  }\n  ofst->SetStart(s_p);\n  if (ifst.Properties(kError, false)) ofst->SetProperties(kError, kError);\n  ofst->SetProperties(\n      ShortestPathProperties(ofst->Properties(kFstProperties, false), true),\n      kFstProperties);\n}\n\n// Helper function for SingleShortestPath building a tree of shortest paths to\n// every final state in the input FST. It takes the input FST and parent values\n// computed by SingleShortestPath and builds into the output mutable FST the\n// subtree of ifst that consists only of the best paths to all final states.\n// This is not normally called by users; see ShortestPath instead.\ntemplate <class Arc>\nvoid SingleShortestTree(\n    const Fst<Arc> &ifst, MutableFst<Arc> *ofst,\n    const std::vector<std::pair<typename Arc::StateId, size_t>> &parent) {\n  ofst->DeleteStates();\n  ofst->SetInputSymbols(ifst.InputSymbols());\n  ofst->SetOutputSymbols(ifst.OutputSymbols());\n  ofst->SetStart(ifst.Start());\n  for (StateIterator<Fst<Arc>> siter(ifst); !siter.Done(); siter.Next()) {\n    ofst->AddState();\n    ofst->SetFinal(siter.Value(), ifst.Final(siter.Value()));\n  }\n  for (const auto &pair : parent) {\n    if (pair.first != kNoStateId && pair.second != kNoArc) {\n      ArcIterator<Fst<Arc>> aiter(ifst, pair.first);\n      aiter.Seek(pair.second);\n      ofst->AddArc(pair.first, aiter.Value());\n    }\n  }\n  if (ifst.Properties(kError, false)) ofst->SetProperties(kError, kError);\n  ofst->SetProperties(\n      ShortestPathProperties(ofst->Properties(kFstProperties, false), true),\n      kFstProperties);\n}\n\n// Implements the stopping criterion when ShortestPathOptions::first_path\n// is set to true:\n//   operator()(s, d, f) == true\n//   iff every successful path through state 's' has a cost greater or equal\n//   to 'f' under the assumption that 'd' is the shortest distance to state 's'.\n// Correct when using the ShortestFirstQueue with all the weights in the FST\n// being between One() and Zero() according to NaturalLess\ntemplate <typename S, typename W, typename Queue>\nstruct FirstPathSelect {\n  FirstPathSelect(const Queue &) {}\n  bool operator()(S s, W d, W f) const { return f == Plus(d, f); }\n};\n\n// Specialisation for A*.\n// Correct when the estimate is admissible and consistent.\ntemplate <typename S, typename W, typename Estimate>\nclass FirstPathSelect<S, W, NaturalAStarQueue<S, W, Estimate>> {\n public:\n  using Queue = NaturalAStarQueue<S, W, Estimate>;\n\n  FirstPathSelect(const Queue &state_queue)\n    : estimate_(state_queue.GetCompare().GetEstimate()) {}\n\n  bool operator()(S s, W d, W f) const {\n    return f == Plus(Times(d, estimate_(s)), f);\n  }\n\n private:\n  const Estimate &estimate_;\n};\n\n// Shortest-path algorithm. It builds the output mutable FST so that it contains\n// the shortest path in the input FST; distance returns the shortest distances\n// from the source state to each state in the input FST, and the options struct\n// is\n// used to specify options such as the queue discipline, the arc filter and\n// delta. The super_final option is an output parameter indicating the final\n// state, and the parent argument is used for the storage of the backtrace path\n// for each state 1 to n, (i.e., the best previous state and the arc that\n// transition to state n.) The shortest path is the lowest weight path w.r.t.\n// the natural semiring order. The weights need to be right distributive and\n// have the path (kPath) property. False is returned if an error is encountered.\n//\n// This is not normally called by users; see ShortestPath instead (with n = 1).\ntemplate <class Arc, class Queue, class ArcFilter>\nbool SingleShortestPath(\n    const Fst<Arc> &ifst, std::vector<typename Arc::Weight> *distance,\n    const ShortestPathOptions<Arc, Queue, ArcFilter> &opts,\n    typename Arc::StateId *f_parent,\n    std::vector<std::pair<typename Arc::StateId, size_t>> *parent) {\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n  static_assert(IsPath<Weight>::value, \"Weight must have path property.\");\n  static_assert((Weight::Properties() & kRightSemiring) == kRightSemiring,\n                \"Weight must be right distributive.\");\n  parent->clear();\n  *f_parent = kNoStateId;\n  if (ifst.Start() == kNoStateId) return true;\n  std::vector<bool> enqueued;\n  auto state_queue = opts.state_queue;\n  const auto source = (opts.source == kNoStateId) ? ifst.Start() : opts.source;\n  bool final_seen = false;\n  auto f_distance = Weight::Zero();\n  distance->clear();\n  state_queue->Clear();\n  while (distance->size() < source) {\n    distance->push_back(Weight::Zero());\n    enqueued.push_back(false);\n    parent->push_back(std::make_pair(kNoStateId, kNoArc));\n  }\n  distance->push_back(Weight::One());\n  parent->push_back(std::make_pair(kNoStateId, kNoArc));\n  state_queue->Enqueue(source);\n  enqueued.push_back(true);\n  while (!state_queue->Empty()) {\n    const auto s = state_queue->Head();\n    state_queue->Dequeue();\n    enqueued[s] = false;\n    const auto sd = (*distance)[s];\n    // If we are using a shortest queue, no other path is going to be shorter\n    // than f_distance at this point.\n    using FirstPath = FirstPathSelect<StateId, Weight, Queue>;\n    if (opts.first_path && final_seen &&\n        FirstPath(*state_queue)(s, sd, f_distance)) {\n      break;\n    }\n    if (ifst.Final(s) != Weight::Zero()) {\n      const auto plus = Plus(f_distance, Times(sd, ifst.Final(s)));\n      if (f_distance != plus) {\n        f_distance = plus;\n        *f_parent = s;\n      }\n      if (!f_distance.Member()) return false;\n      final_seen = true;\n    }\n    for (ArcIterator<Fst<Arc>> aiter(ifst, s); !aiter.Done(); aiter.Next()) {\n      const auto &arc = aiter.Value();\n      while (distance->size() <= arc.nextstate) {\n        distance->push_back(Weight::Zero());\n        enqueued.push_back(false);\n        parent->push_back(std::make_pair(kNoStateId, kNoArc));\n      }\n      auto &nd = (*distance)[arc.nextstate];\n      const auto weight = Times(sd, arc.weight);\n      if (nd != Plus(nd, weight)) {\n        nd = Plus(nd, weight);\n        if (!nd.Member()) return false;\n        (*parent)[arc.nextstate] = std::make_pair(s, aiter.Position());\n        if (!enqueued[arc.nextstate]) {\n          state_queue->Enqueue(arc.nextstate);\n          enqueued[arc.nextstate] = true;\n        } else {\n          state_queue->Update(arc.nextstate);\n        }\n      }\n    }\n  }\n  return true;\n}\n\ntemplate <class StateId, class Weight>\nclass ShortestPathCompare {\n public:\n  ShortestPathCompare(const std::vector<std::pair<StateId, Weight>> &pairs,\n                      const std::vector<Weight> &distance, StateId superfinal,\n                      float delta)\n      : pairs_(pairs),\n        distance_(distance),\n        superfinal_(superfinal),\n        delta_(delta) {}\n\n  bool operator()(const StateId x, const StateId y) const {\n    const auto &px = pairs_[x];\n    const auto &py = pairs_[y];\n    const auto wx = Times(PWeight(px.first), px.second);\n    const auto wy = Times(PWeight(py.first), py.second);\n    // Penalize complete paths to ensure correct results with inexact weights.\n    // This forms a strict weak order so long as ApproxEqual(a, b) =>\n    // ApproxEqual(a, c) for all c s.t. less_(a, c) && less_(c, b).\n    if (px.first == superfinal_ && py.first != superfinal_) {\n      return less_(wy, wx) || ApproxEqual(wx, wy, delta_);\n    } else if (py.first == superfinal_ && px.first != superfinal_) {\n      return less_(wy, wx) && !ApproxEqual(wx, wy, delta_);\n    } else {\n      return less_(wy, wx);\n    }\n  }\n\n private:\n  Weight PWeight(StateId state) const {\n    return (state == superfinal_)\n               ? Weight::One()\n               : (state < distance_.size()) ? distance_[state] : Weight::Zero();\n  }\n\n  const std::vector<std::pair<StateId, Weight>> &pairs_;\n  const std::vector<Weight> &distance_;\n  const StateId superfinal_;\n  const float delta_;\n  NaturalLess<Weight> less_;\n};\n\n// N-Shortest-path algorithm: implements the core n-shortest path algorithm.\n// The output is built reversed. See below for versions with more options and\n// *not reversed*.\n//\n// The output mutable FST contains the REVERSE of n'shortest paths in the input\n// FST; distance must contain the shortest distance from each state to a final\n// state in the input FST; delta is the convergence delta.\n//\n// The n-shortest paths are the n-lowest weight paths w.r.t. the natural\n// semiring order. The single path that can be read from the ith of at most n\n// transitions leaving the initial state of the input FST is the ith shortest\n// path. Disregarding the initial state and initial transitions, the\n// n-shortest paths, in fact, form a tree rooted at the single final state.\n//\n// The weights need to be left and right distributive (kSemiring) and have the\n// path (kPath) property.\n//\n// Arc weights must satisfy the property that the sum of the weights of one or\n// more paths from some state S to T is never Zero(). In particular, arc weights\n// are never Zero().\n//\n// For more information, see:\n//\n// Mohri, M, and Riley, M. 2002. An efficient algorithm for the n-best-strings\n// problem. In Proc. ICSLP.\n//\n// The algorithm relies on the shortest-distance algorithm. There are some\n// issues with the pseudo-code as written in the paper (viz., line 11).\n//\n// IMPLEMENTATION NOTE: The input FST can be a delayed FST and at any state in\n// its expansion the values of distance vector need only be defined at that time\n// for the states that are known to exist.\ntemplate <class Arc, class RevArc>\nvoid NShortestPath(const Fst<RevArc> &ifst, MutableFst<Arc> *ofst,\n                   const std::vector<typename Arc::Weight> &distance,\n                   int32 nshortest, float delta = kShortestDelta,\n                   typename Arc::Weight weight_threshold = Arc::Weight::Zero(),\n                   typename Arc::StateId state_threshold = kNoStateId) {\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n  using Pair = std::pair<StateId, Weight>;\n  static_assert((Weight::Properties() & kPath) == kPath,\n                \"Weight must have path property.\");\n  static_assert((Weight::Properties() & kSemiring) == kSemiring,\n                \"Weight must be distributive.\");\n  if (nshortest <= 0) return;\n  ofst->DeleteStates();\n  ofst->SetInputSymbols(ifst.InputSymbols());\n  ofst->SetOutputSymbols(ifst.OutputSymbols());\n  // Each state in ofst corresponds to a path with weight w from the initial\n  // state of ifst to a state s in ifst, that can be characterized by a pair\n  // (s, w). The vector pairs maps each state in ofst to the corresponding\n  // pair maps states in ofst to the corresponding pair (s, w).\n  std::vector<Pair> pairs;\n  // The supefinal state is denoted by kNoStateId. The distance from the\n  // superfinal state to the final state is semiring One, so\n  // `distance[kNoStateId]` is not needed.\n  const ShortestPathCompare<StateId, Weight> compare(pairs, distance,\n                                                     kNoStateId, delta);\n  const NaturalLess<Weight> less;\n  if (ifst.Start() == kNoStateId || distance.size() <= ifst.Start() ||\n      distance[ifst.Start()] == Weight::Zero() ||\n      less(weight_threshold, Weight::One()) || state_threshold == 0) {\n    if (ifst.Properties(kError, false)) ofst->SetProperties(kError, kError);\n    return;\n  }\n  ofst->SetStart(ofst->AddState());\n  const auto final_state = ofst->AddState();\n  ofst->SetFinal(final_state, Weight::One());\n  while (pairs.size() <= final_state) {\n    pairs.push_back(std::make_pair(kNoStateId, Weight::Zero()));\n  }\n  pairs[final_state] = std::make_pair(ifst.Start(), Weight::One());\n  std::vector<StateId> heap;\n  heap.push_back(final_state);\n  const auto limit = Times(distance[ifst.Start()], weight_threshold);\n  // r[s + 1], s state in fst, is the number of states in ofst which\n  // corresponding pair contains s, i.e., it is number of paths computed so far\n  // to s. Valid for s == kNoStateId (the superfinal state).\n  std::vector<int> r;\n  while (!heap.empty()) {\n    std::pop_heap(heap.begin(), heap.end(), compare);\n    const auto state = heap.back();\n    const auto p = pairs[state];\n    heap.pop_back();\n    const auto d =\n        (p.first == kNoStateId)\n            ? Weight::One()\n            : (p.first < distance.size()) ? distance[p.first] : Weight::Zero();\n    if (less(limit, Times(d, p.second)) ||\n        (state_threshold != kNoStateId &&\n         ofst->NumStates() >= state_threshold)) {\n      continue;\n    }\n    while (r.size() <= p.first + 1) r.push_back(0);\n    ++r[p.first + 1];\n    if (p.first == kNoStateId) {\n      ofst->AddArc(ofst->Start(), Arc(0, 0, Weight::One(), state));\n    }\n    if ((p.first == kNoStateId) && (r[p.first + 1] == nshortest)) break;\n    if (r[p.first + 1] > nshortest) continue;\n    if (p.first == kNoStateId) continue;\n    for (ArcIterator<Fst<RevArc>> aiter(ifst, p.first); !aiter.Done();\n         aiter.Next()) {\n      const auto &rarc = aiter.Value();\n      Arc arc(rarc.ilabel, rarc.olabel, rarc.weight.Reverse(), rarc.nextstate);\n      const auto weight = Times(p.second, arc.weight);\n      const auto next = ofst->AddState();\n      pairs.push_back(std::make_pair(arc.nextstate, weight));\n      arc.nextstate = state;\n      ofst->AddArc(next, arc);\n      heap.push_back(next);\n      std::push_heap(heap.begin(), heap.end(), compare);\n    }\n    const auto final_weight = ifst.Final(p.first).Reverse();\n    if (final_weight != Weight::Zero()) {\n      const auto weight = Times(p.second, final_weight);\n      const auto next = ofst->AddState();\n      pairs.push_back(std::make_pair(kNoStateId, weight));\n      ofst->AddArc(next, Arc(0, 0, final_weight, state));\n      heap.push_back(next);\n      std::push_heap(heap.begin(), heap.end(), compare);\n    }\n  }\n  Connect(ofst);\n  if (ifst.Properties(kError, false)) ofst->SetProperties(kError, kError);\n  ofst->SetProperties(\n      ShortestPathProperties(ofst->Properties(kFstProperties, false)),\n      kFstProperties);\n}\n\n}  // namespace internal\n\n// N-Shortest-path algorithm: this version allows finer control via the options\n// argument. See below for a simpler interface. The output mutable FST contains\n// the n-shortest paths in the input FST; the distance argument is used to\n// return the shortest distances from the source state to each state in the\n// input FST, and the options struct is used to specify the number of paths to\n// return, whether they need to have distinct input strings, the queue\n// discipline, the arc filter and the convergence delta.\n//\n// The n-shortest paths are the n-lowest weight paths w.r.t. the natural\n// semiring order. The single path that can be read from the ith of at most n\n// transitions leaving the initial state of the output FST is the ith shortest\n// path.\n// Disregarding the initial state and initial transitions, The n-shortest paths,\n// in fact, form a tree rooted at the single final state.\n//\n// The weights need to be right distributive and have the path (kPath) property.\n// They need to be left distributive as well for nshortest > 1.\n//\n// For more information, see:\n//\n// Mohri, M, and Riley, M. 2002. An efficient algorithm for the n-best-strings\n// problem. In Proc. ICSLP.\n//\n// The algorithm relies on the shortest-distance algorithm. There are some\n// issues with the pseudo-code as written in the paper (viz., line 11).\ntemplate <class Arc, class Queue, class ArcFilter,\n          typename std::enable_if<IsPath<typename Arc::Weight>::value>::type * =\n              nullptr>\nvoid ShortestPath(const Fst<Arc> &ifst, MutableFst<Arc> *ofst,\n                  std::vector<typename Arc::Weight> *distance,\n                  const ShortestPathOptions<Arc, Queue, ArcFilter> &opts) {\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n  using RevArc = ReverseArc<Arc>;\n  if (opts.nshortest == 1) {\n    std::vector<std::pair<StateId, size_t>> parent;\n    StateId f_parent;\n    if (internal::SingleShortestPath(ifst, distance, opts, &f_parent,\n                                     &parent)) {\n      internal::SingleShortestPathBacktrace(ifst, ofst, parent, f_parent);\n    } else {\n      ofst->SetProperties(kError, kError);\n    }\n    return;\n  }\n  if (opts.nshortest <= 0) return;\n  if (!opts.has_distance) {\n    ShortestDistance(ifst, distance, opts);\n    if (distance->size() == 1 && !(*distance)[0].Member()) {\n      ofst->SetProperties(kError, kError);\n      return;\n    }\n  }\n  // Algorithm works on the reverse of 'fst'; 'distance' is the distance to the\n  // final state in 'rfst', 'ofst' is built as the reverse of the tree of\n  // n-shortest path in 'rfst'.\n  VectorFst<RevArc> rfst;\n  Reverse(ifst, &rfst);\n  auto d = Weight::Zero();\n  for (ArcIterator<VectorFst<RevArc>> aiter(rfst, 0); !aiter.Done();\n       aiter.Next()) {\n    const auto &arc = aiter.Value();\n    const auto state = arc.nextstate - 1;\n    if (state < distance->size()) {\n      d = Plus(d, Times(arc.weight.Reverse(), (*distance)[state]));\n    }\n  }\n  // TODO(kbg): Avoid this expensive vector operation.\n  distance->insert(distance->begin(), d);\n  if (!opts.unique) {\n    internal::NShortestPath(rfst, ofst, *distance, opts.nshortest, opts.delta,\n                            opts.weight_threshold, opts.state_threshold);\n  } else {\n    std::vector<Weight> ddistance;\n    DeterminizeFstOptions<RevArc> dopts(opts.delta);\n    DeterminizeFst<RevArc> dfst(rfst, distance, &ddistance, dopts);\n    internal::NShortestPath(dfst, ofst, ddistance, opts.nshortest, opts.delta,\n                            opts.weight_threshold, opts.state_threshold);\n  }\n  // TODO(kbg): Avoid this expensive vector operation.\n  distance->erase(distance->begin());\n}\n\ntemplate <class Arc, class Queue, class ArcFilter,\n          typename std::enable_if<!IsPath<typename Arc::Weight>::value>::type\n              * = nullptr>\nvoid ShortestPath(const Fst<Arc> &, MutableFst<Arc> *ofst,\n                  std::vector<typename Arc::Weight> *,\n                  const ShortestPathOptions<Arc, Queue, ArcFilter> &) {\n  FSTERROR() << \"ShortestPath: Weight needs to have the \"\n             << \"path property and be distributive: \" << Arc::Weight::Type();\n  ofst->SetProperties(kError, kError);\n}\n\n// Shortest-path algorithm: simplified interface. See above for a version that\n// allows finer control. The output mutable FST contains the n-shortest paths\n// in the input FST. The queue discipline is automatically selected. When unique\n// is true, only paths with distinct input label sequences are returned.\n//\n// The n-shortest paths are the n-lowest weight paths w.r.t. the natural\n// semiring order. The single path that can be read from the ith of at most n\n// transitions leaving the initial state of the output FST is the ith best path.\n// The weights need to be right distributive and have the path (kPath) property.\ntemplate <class Arc>\nvoid ShortestPath(const Fst<Arc> &ifst, MutableFst<Arc> *ofst,\n                  int32 nshortest = 1, bool unique = false,\n                  bool first_path = false,\n                  typename Arc::Weight weight_threshold = Arc::Weight::Zero(),\n                  typename Arc::StateId state_threshold = kNoStateId,\n                  float delta = kShortestDelta) {\n  using StateId = typename Arc::StateId;\n  std::vector<typename Arc::Weight> distance;\n  AnyArcFilter<Arc> arc_filter;\n  AutoQueue<StateId> state_queue(ifst, &distance, arc_filter);\n  const ShortestPathOptions<Arc, AutoQueue<StateId>, AnyArcFilter<Arc>> opts(\n      &state_queue, arc_filter, nshortest, unique, false, delta, first_path,\n      weight_threshold, state_threshold);\n  ShortestPath(ifst, ofst, &distance, opts);\n}\n\n}  // namespace fst\n\n#endif  // FST_SHORTEST_PATH_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/signed-log-weight.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// LogWeight along with sign information that represents the value X in the\n// linear domain as <sign(X), -ln(|X|)>\n//\n// The sign is a TropicalWeight:\n//  positive, TropicalWeight.Value() > 0.0, recommended value 1.0\n//  negative, TropicalWeight.Value() <= 0.0, recommended value -1.0\n\n#ifndef FST_SIGNED_LOG_WEIGHT_H_\n#define FST_SIGNED_LOG_WEIGHT_H_\n\n#include <cstdlib>\n\n#include <fst/float-weight.h>\n#include <fst/pair-weight.h>\n#include <fst/product-weight.h>\n\n\nnamespace fst {\ntemplate <class T>\nclass SignedLogWeightTpl : public PairWeight<TropicalWeight, LogWeightTpl<T>> {\n public:\n  using X1 = TropicalWeight;\n  using X2 = LogWeightTpl<T>;\n  using ReverseWeight = SignedLogWeightTpl;\n\n  using PairWeight<X1, X2>::Value1;\n  using PairWeight<X1, X2>::Value2;\n\n  SignedLogWeightTpl() : PairWeight<X1, X2>() {}\n\n  SignedLogWeightTpl(const SignedLogWeightTpl &w) : PairWeight<X1, X2>(w) {}\n\n  explicit SignedLogWeightTpl(const PairWeight<X1, X2> &w)\n      : PairWeight<X1, X2>(w) {}\n\n  SignedLogWeightTpl(const X1 &x1, const X2 &x2) : PairWeight<X1, X2>(x1, x2) {}\n\n  static const SignedLogWeightTpl &Zero() {\n    static const SignedLogWeightTpl zero(X1(1.0), X2::Zero());\n    return zero;\n  }\n\n  static const SignedLogWeightTpl &One() {\n    static const SignedLogWeightTpl one(X1(1.0), X2::One());\n    return one;\n  }\n\n  static const SignedLogWeightTpl &NoWeight() {\n    static const SignedLogWeightTpl no_weight(X1(1.0), X2::NoWeight());\n    return no_weight;\n  }\n\n  static const string &Type() {\n    static const string *const type =\n        new string(\"signed_log_\" + X1::Type() + \"_\" + X2::Type());\n    return *type;\n  }\n\n  SignedLogWeightTpl Quantize(float delta = kDelta) const {\n    return SignedLogWeightTpl(PairWeight<X1, X2>::Quantize(delta));\n  }\n\n  ReverseWeight Reverse() const {\n    return SignedLogWeightTpl(PairWeight<X1, X2>::Reverse());\n  }\n\n  bool Member() const { return PairWeight<X1, X2>::Member(); }\n\n  // Neither idempotent nor path.\n  static constexpr uint64 Properties() {\n    return kLeftSemiring | kRightSemiring | kCommutative;\n  }\n\n  size_t Hash() const {\n    size_t h1;\n    if (Value2() == X2::Zero() || Value1().Value() > 0.0) {\n      h1 = TropicalWeight(1.0).Hash();\n    } else {\n      h1 = TropicalWeight(-1.0).Hash();\n    }\n    size_t h2 = Value2().Hash();\n    static constexpr int lshift = 5;\n    static constexpr int rshift = CHAR_BIT * sizeof(size_t) - 5;\n    return h1 << lshift ^ h1 >> rshift ^ h2;\n  }\n};\n\ntemplate <class T>\ninline SignedLogWeightTpl<T> Plus(const SignedLogWeightTpl<T> &w1,\n                                  const SignedLogWeightTpl<T> &w2) {\n  using X1 = TropicalWeight;\n  using X2 = LogWeightTpl<T>;\n  if (!w1.Member() || !w2.Member()) return SignedLogWeightTpl<T>::NoWeight();\n  const auto s1 = w1.Value1().Value() > 0.0;\n  const auto s2 = w2.Value1().Value() > 0.0;\n  const bool equal = (s1 == s2);\n  const auto f1 = w1.Value2().Value();\n  const auto f2 = w2.Value2().Value();\n  if (f1 == FloatLimits<T>::PosInfinity()) {\n    return w2;\n  } else if (f2 == FloatLimits<T>::PosInfinity()) {\n    return w1;\n  } else if (f1 == f2) {\n    if (equal) {\n      return SignedLogWeightTpl<T>(X1(w1.Value1()), X2(f2 - log(2.0F)));\n    } else {\n      return SignedLogWeightTpl<T>::Zero();\n    }\n  } else if (f1 > f2) {\n    if (equal) {\n      return SignedLogWeightTpl<T>(X1(w1.Value1()),\n                                   X2(f2 - internal::LogPosExp(f1 - f2)));\n    } else {\n      return SignedLogWeightTpl<T>(X1(w2.Value1()),\n                                   X2((f2 - internal::LogNegExp(f1 - f2))));\n    }\n  } else {\n    if (equal) {\n      return SignedLogWeightTpl<T>(X1(w2.Value1()),\n                                   X2((f1 - internal::LogPosExp(f2 - f1))));\n    } else {\n      return SignedLogWeightTpl<T>(X1(w1.Value1()),\n                                   X2((f1 - internal::LogNegExp(f2 - f1))));\n    }\n  }\n}\n\ntemplate <class T>\ninline SignedLogWeightTpl<T> Minus(const SignedLogWeightTpl<T> &w1,\n                                   const SignedLogWeightTpl<T> &w2) {\n  SignedLogWeightTpl<T> minus_w2(-w2.Value1().Value(), w2.Value2());\n  return Plus(w1, minus_w2);\n}\n\ntemplate <class T>\ninline SignedLogWeightTpl<T> Times(const SignedLogWeightTpl<T> &w1,\n                                   const SignedLogWeightTpl<T> &w2) {\n  using X2 = LogWeightTpl<T>;\n  if (!w1.Member() || !w2.Member()) return SignedLogWeightTpl<T>::NoWeight();\n  const auto s1 = w1.Value1().Value() > 0.0;\n  const auto s2 = w2.Value1().Value() > 0.0;\n  const auto f1 = w1.Value2().Value();\n  const auto f2 = w2.Value2().Value();\n  if (s1 == s2) {\n    return SignedLogWeightTpl<T>(TropicalWeight(1.0), X2(f1 + f2));\n  } else {\n    return SignedLogWeightTpl<T>(TropicalWeight(-1.0), X2(f1 + f2));\n  }\n}\n\ntemplate <class T>\ninline SignedLogWeightTpl<T> Divide(const SignedLogWeightTpl<T> &w1,\n                                    const SignedLogWeightTpl<T> &w2,\n                                    DivideType typ = DIVIDE_ANY) {\n  using X2 = LogWeightTpl<T>;\n  if (!w1.Member() || !w2.Member()) return SignedLogWeightTpl<T>::NoWeight();\n  const auto s1 = w1.Value1().Value() > 0.0;\n  const auto s2 = w2.Value1().Value() > 0.0;\n  const auto f1 = w1.Value2().Value();\n  const auto f2 = w2.Value2().Value();\n  if (f2 == FloatLimits<T>::PosInfinity()) {\n    return SignedLogWeightTpl<T>(TropicalWeight(1.0),\n                                 X2(FloatLimits<T>::NumberBad()));\n  } else if (f1 == FloatLimits<T>::PosInfinity()) {\n    return SignedLogWeightTpl<T>(TropicalWeight(1.0),\n                                 X2(FloatLimits<T>::PosInfinity()));\n  } else if (s1 == s2) {\n    return SignedLogWeightTpl<T>(TropicalWeight(1.0), X2(f1 - f2));\n  } else {\n    return SignedLogWeightTpl<T>(TropicalWeight(-1.0), X2(f1 - f2));\n  }\n}\n\ntemplate <class T>\ninline bool ApproxEqual(const SignedLogWeightTpl<T> &w1,\n                        const SignedLogWeightTpl<T> &w2, float delta = kDelta) {\n  const auto s1 = w1.Value1().Value() > 0.0;\n  const auto s2 = w2.Value1().Value() > 0.0;\n  if (s1 == s2) {\n    return ApproxEqual(w1.Value2(), w2.Value2(), delta);\n  } else {\n    return w1.Value2() == LogWeightTpl<T>::Zero() &&\n           w2.Value2() == LogWeightTpl<T>::Zero();\n  }\n}\n\ntemplate <class T>\ninline bool operator==(const SignedLogWeightTpl<T> &w1,\n                       const SignedLogWeightTpl<T> &w2) {\n  const auto s1 = w1.Value1().Value() > 0.0;\n  const auto s2 = w2.Value1().Value() > 0.0;\n  if (s1 == s2) {\n    return w1.Value2() == w2.Value2();\n  } else {\n    return (w1.Value2() == LogWeightTpl<T>::Zero()) &&\n           (w2.Value2() == LogWeightTpl<T>::Zero());\n  }\n}\n\n// Single-precision signed-log weight.\nusing SignedLogWeight = SignedLogWeightTpl<float>;\n\n// Double-precision signed-log weight.\nusing SignedLog64Weight = SignedLogWeightTpl<double>;\n\ntemplate <class W1, class W2>\nbool SignedLogConvertCheck(W1 weight) {\n  if (weight.Value1().Value() < 0.0) {\n    FSTERROR() << \"WeightConvert: Can't convert weight \" << weight\n               << \" from \" << W1::Type() << \" to \" << W2::Type();\n    return false;\n  }\n  return true;\n}\n\n// Specialization using the Kahan compensated summation\ntemplate <class T>\nclass Adder<SignedLogWeightTpl<T>> {\n public:\n  using Weight = SignedLogWeightTpl<T>;\n  using X1 = TropicalWeight;\n  using X2 = LogWeightTpl<T>;\n\n  explicit Adder(Weight w = Weight::Zero())\n     : ssum_(w.Value1().Value() > 0.0),\n        sum_(w.Value2().Value()),\n        c_(0.0) { }\n\n  Weight Add(const Weight &w) {\n    const auto sw = w.Value1().Value() > 0.0;\n    const auto f = w.Value2().Value();\n    const bool equal = (ssum_ == sw);\n\n    if (!Sum().Member() || f == FloatLimits<T>::PosInfinity()) {\n      return Sum();\n    } else if (!w.Member() || sum_ == FloatLimits<T>::PosInfinity()) {\n      sum_ = f;\n      ssum_ = sw;\n      c_ = 0.0;\n    } else if (f == sum_) {\n      if (equal) {\n        sum_ = internal::KahanLogSum(sum_, f, &c_);\n      } else {\n        sum_ = FloatLimits<T>::PosInfinity();\n        ssum_ = true;\n        c_ = 0.0;\n      }\n    } else if (f > sum_) {\n      if (equal) {\n        sum_ = internal::KahanLogSum(sum_, f, &c_);\n      } else {\n        sum_ = internal::KahanLogDiff(sum_, f, &c_);\n      }\n    } else {\n      if (equal) {\n        sum_ = internal::KahanLogSum(f, sum_, &c_);\n      } else {\n        sum_ = internal::KahanLogDiff(f, sum_, &c_);\n        ssum_ = sw;\n      }\n    }\n    return Sum();\n  }\n\n  Weight Sum() { return Weight(X1(ssum_ ? 1.0 : -1.0), X2(sum_)); }\n\n  void Reset(Weight w = Weight::Zero()) {\n    ssum_ = w.Value1().Value() > 0.0;\n    sum_ = w.Value2().Value();\n    c_ = 0.0;\n  }\n\n private:\n  bool ssum_;   // true iff sign of sum is positive\n  double sum_;  // unsigned sum\n  double c_;    // Kahan compensation\n};\n\n// Converts to tropical.\ntemplate <>\nstruct WeightConvert<SignedLogWeight, TropicalWeight> {\n  TropicalWeight operator()(const SignedLogWeight &weight) const {\n    if (!SignedLogConvertCheck<SignedLogWeight, TropicalWeight>(weight)) {\n      return TropicalWeight::NoWeight();\n    }\n    return TropicalWeight(weight.Value2().Value());\n  }\n};\n\ntemplate <>\nstruct WeightConvert<SignedLog64Weight, TropicalWeight> {\n  TropicalWeight operator()(const SignedLog64Weight &weight) const {\n    if (!SignedLogConvertCheck<SignedLog64Weight, TropicalWeight>(weight)) {\n      return TropicalWeight::NoWeight();\n    }\n    return TropicalWeight(weight.Value2().Value());\n  }\n};\n\n// Converts to log.\ntemplate <>\nstruct WeightConvert<SignedLogWeight, LogWeight> {\n  LogWeight operator()(const SignedLogWeight &weight) const {\n    if (!SignedLogConvertCheck<SignedLogWeight, LogWeight>(weight)) {\n      return LogWeight::NoWeight();\n    }\n    return LogWeight(weight.Value2().Value());\n  }\n};\n\ntemplate <>\nstruct WeightConvert<SignedLog64Weight, LogWeight> {\n  LogWeight operator()(const SignedLog64Weight &weight) const {\n    if (!SignedLogConvertCheck<SignedLog64Weight, LogWeight>(weight)) {\n      return LogWeight::NoWeight();\n    }\n    return LogWeight(weight.Value2().Value());\n  }\n};\n\n// Converts to log64.\ntemplate <>\nstruct WeightConvert<SignedLogWeight, Log64Weight> {\n  Log64Weight operator()(const SignedLogWeight &weight) const {\n    if (!SignedLogConvertCheck<SignedLogWeight, Log64Weight>(weight)) {\n      return Log64Weight::NoWeight();\n    }\n    return Log64Weight(weight.Value2().Value());\n  }\n};\n\ntemplate <>\nstruct WeightConvert<SignedLog64Weight, Log64Weight> {\n  Log64Weight operator()(const SignedLog64Weight &weight) const {\n    if (!SignedLogConvertCheck<SignedLog64Weight, Log64Weight>(weight)) {\n      return Log64Weight::NoWeight();\n    }\n    return Log64Weight(weight.Value2().Value());\n  }\n};\n\n// Converts to signed log.\ntemplate <>\nstruct WeightConvert<TropicalWeight, SignedLogWeight> {\n  SignedLogWeight operator()(const TropicalWeight &weight) const {\n    return SignedLogWeight(1.0, weight.Value());\n  }\n};\n\ntemplate <>\nstruct WeightConvert<LogWeight, SignedLogWeight> {\n  SignedLogWeight operator()(const LogWeight &weight) const {\n    return SignedLogWeight(1.0, weight.Value());\n  }\n};\n\ntemplate <>\nstruct WeightConvert<Log64Weight, SignedLogWeight> {\n  SignedLogWeight operator()(const Log64Weight &weight) const {\n    return SignedLogWeight(1.0, weight.Value());\n  }\n};\n\ntemplate <>\nstruct WeightConvert<SignedLog64Weight, SignedLogWeight> {\n  SignedLogWeight operator()(const SignedLog64Weight &weight) const {\n    return SignedLogWeight(weight.Value1(), weight.Value2().Value());\n  }\n};\n\n// Converts to signed log64.\ntemplate <>\nstruct WeightConvert<TropicalWeight, SignedLog64Weight> {\n  SignedLog64Weight operator()(const TropicalWeight &weight) const {\n    return SignedLog64Weight(1.0, weight.Value());\n  }\n};\n\ntemplate <>\nstruct WeightConvert<LogWeight, SignedLog64Weight> {\n  SignedLog64Weight operator()(const LogWeight &weight) const {\n    return SignedLog64Weight(1.0, weight.Value());\n  }\n};\n\ntemplate <>\nstruct WeightConvert<Log64Weight, SignedLog64Weight> {\n  SignedLog64Weight operator()(const Log64Weight &weight) const {\n    return SignedLog64Weight(1.0, weight.Value());\n  }\n};\n\ntemplate <>\nstruct WeightConvert<SignedLogWeight, SignedLog64Weight> {\n  SignedLog64Weight operator()(const SignedLogWeight &weight) const {\n    return SignedLog64Weight(weight.Value1(), weight.Value2().Value());\n  }\n};\n\n// This function object returns SignedLogWeightTpl<T>'s that are random integers\n// chosen from [0, num_random_weights) times a random sign. This is intended\n// primarily for testing.\ntemplate <class T>\nclass WeightGenerate<SignedLogWeightTpl<T>> {\n public:\n  using Weight = SignedLogWeightTpl<T>;\n  using X1 = typename Weight::X1;\n  using X2 = typename Weight::X2;\n\n  explicit WeightGenerate(bool allow_zero = true,\n                          size_t num_random_weights = kNumRandomWeights)\n    : allow_zero_(allow_zero), num_random_weights_(num_random_weights) {}\n\n  Weight operator()() const {\n    static const X1 negative_one(-1.0);\n    static const X1 positive_one(+1.0);\n    const int m = rand() % 2;                                    // NOLINT\n    const int n = rand() % (num_random_weights_ + allow_zero_);  // NOLINT\n    return Weight((m == 0) ? negative_one : positive_one,\n                  (allow_zero_ && n == num_random_weights_) ?\n                   X2::Zero() : X2(n));\n  }\n\n private:\n  // Permits Zero() and zero divisors.\n  const bool allow_zero_;\n  // Number of alternative random weights.\n  const size_t num_random_weights_;\n};\n\n}  // namespace fst\n\n#endif  // FST_SIGNED_LOG_WEIGHT_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/sparse-power-weight.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Cartesian power weight semiring operation definitions, using\n// SparseTupleWeight as underlying representation.\n\n#ifndef FST_SPARSE_POWER_WEIGHT_H_\n#define FST_SPARSE_POWER_WEIGHT_H_\n\n#include <climits>\n#include <string>\n\n#include <fst/sparse-tuple-weight.h>\n#include <fst/weight.h>\n\n\nnamespace fst {\n\n// Sparse cartesian power semiring: W ^ n\n//\n// Forms:\n//\n//  - a left semimodule when W is a left semiring,\n//  - a right semimodule when W is a right semiring,\n//  - a bisemimodule when W is a semiring,\n//    the free semimodule of rank n over W\n//\n// The Times operation is overloaded to provide the left and right scalar\n// products.\n//\n// K is the key value type. kNoKey (-1) is reserved for internal use\ntemplate <class W, class K = int>\nclass SparsePowerWeight : public SparseTupleWeight<W, K> {\n public:\n  using ReverseWeight = SparsePowerWeight<typename W::ReverseWeight, K>;\n\n  SparsePowerWeight() {}\n\n  explicit SparsePowerWeight(const SparseTupleWeight<W, K> &weight)\n      : SparseTupleWeight<W, K>(weight) {}\n\n  template <class Iterator>\n  SparsePowerWeight(Iterator begin, Iterator end)\n      : SparseTupleWeight<W, K>(begin, end) {}\n\n  // Initialize component `key` to `weight`, with `default_weight` for all\n  // other components.\n  SparsePowerWeight(const K &key, const W &weight,\n                    const W &default_weight = W::Zero())\n      : SparseTupleWeight<W, K>(key, weight, default_weight) {}\n\n  static const SparsePowerWeight &Zero() {\n    static const SparsePowerWeight zero(SparseTupleWeight<W, K>::Zero());\n    return zero;\n  }\n\n  static const SparsePowerWeight &One() {\n    static const SparsePowerWeight one(SparseTupleWeight<W, K>::One());\n    return one;\n  }\n\n  static const SparsePowerWeight &NoWeight() {\n    static const SparsePowerWeight no_weight(\n        SparseTupleWeight<W, K>::NoWeight());\n    return no_weight;\n  }\n\n  // Overide this: Overwrite the Type method to reflect the key type if using\n  // a non-default key type.\n  static const string &Type() {\n    static const string *const type = [] {\n      string type = W::Type() + \"_^n\";\n      if (sizeof(K) != sizeof(uint32)) {\n        type += \"_\" + std::to_string(CHAR_BIT * sizeof(K));\n      }\n      return new string(type);\n    }();\n    return *type;\n  }\n\n  static constexpr uint64 Properties() {\n    return W::Properties() &\n           (kLeftSemiring | kRightSemiring | kCommutative | kIdempotent);\n  }\n\n  SparsePowerWeight Quantize(float delta = kDelta) const {\n    return SparsePowerWeight(SparseTupleWeight<W, K>::Quantize(delta));\n  }\n\n  ReverseWeight Reverse() const {\n    return ReverseWeight(SparseTupleWeight<W, K>::Reverse());\n  }\n};\n\ntemplate <class W, class K, class M>\ninline SparsePowerWeight<W, K> SparsePowerWeightMap(\n    const SparsePowerWeight<W, K> &w1,\n    const SparsePowerWeight<W, K> &w2,\n    const M &operator_mapper) {\n  SparsePowerWeight<W, K> result;\n  SparseTupleWeightMap(&result, w1, w2, operator_mapper);\n  return result;\n}\n\n// Semimodule plus operation.\ntemplate <class W, class K>\ninline SparsePowerWeight<W, K> Plus(const SparsePowerWeight<W, K> &w1,\n                                    const SparsePowerWeight<W, K> &w2) {\n  return SparsePowerWeightMap(w1, w2, [](const K &k, const W &v1, const W &v2) {\n    return Plus(v1, v2);\n  });\n}\n\n// Semimodule times operation.\ntemplate <class W, class K>\ninline SparsePowerWeight<W, K> Times(const SparsePowerWeight<W, K> &w1,\n                                     const SparsePowerWeight<W, K> &w2) {\n  return SparsePowerWeightMap(w1, w2, [](const K &k, const W &v1, const W &v2) {\n    return Times(v1, v2);\n  });\n}\n\n// Semimodule divide operation.\ntemplate <class W, class K>\ninline SparsePowerWeight<W, K> Divide(const SparsePowerWeight<W, K> &w1,\n                                      const SparsePowerWeight<W, K> &w2,\n                                      DivideType type = DIVIDE_ANY) {\n  return SparsePowerWeightMap(w1, w2,\n                              [type](const K &k, const W &v1, const W &v2) {\n                                return Divide(v1, v2, type);\n                              });\n}\n\n// Semimodule dot product operation.\ntemplate <class W, class K>\ninline const W &DotProduct(const SparsePowerWeight<W, K> &w1,\n                           const SparsePowerWeight<W, K> &w2) {\n  const SparsePowerWeight<W, K> product = Times(w1, w2);\n  W result(W::Zero());\n  for (SparseTupleWeightIterator<W, K> it(product); !it.Done(); it.Next()) {\n    result = Plus(result, it.Value().second);\n  }\n  return result;\n}\n\ntemplate <class W, class K>\ninline bool ApproxEqual(const SparsePowerWeight<W, K> &w1,\n                        const SparsePowerWeight<W, K> &w2,\n                        float delta = kDelta) {\n  auto result = SparsePowerWeightMap(\n      w1, w2, [delta](const K &k, const W &v1, const W &v2) {\n        return ApproxEqual(v1, v2, delta) ? W::One() : W::Zero();\n      });\n  return result == SparsePowerWeight<W, K>::One();\n}\n\ntemplate <class W, class K>\ninline SparsePowerWeight<W, K> Times(const W &k,\n                                     const SparsePowerWeight<W, K> &w2) {\n  const SparseTupleWeight<W, K> t2(k);\n  const SparsePowerWeight<W, K> w1(t2);\n  return Times(w1, w2);\n}\n\ntemplate <class W, class K>\ninline SparsePowerWeight<W, K> Times(const SparsePowerWeight<W, K> &w1,\n                                     const W &k) {\n  const SparseTupleWeight<W, K> t2(k);\n  const SparsePowerWeight<W, K> w2(t2);\n  return Times(w1, w2);\n}\n\ntemplate <class W, class K>\ninline SparsePowerWeight<W, K> Divide(const SparsePowerWeight<W, K> &w1,\n                                      const W &k,\n                                      DivideType divide_type = DIVIDE_ANY) {\n  const SparseTupleWeight<W, K> t2(k);\n  const SparsePowerWeight<W, K> w2(t2);\n  return Divide(w1, w2, divide_type);\n}\n\n// This function object generates weights over the Cartesian power of rank\n// n over the underlying weight. This is intended primarily for testing.\ntemplate <class W, class K>\nclass WeightGenerate<SparsePowerWeight<W, K>> {\n public:\n  using Weight = SparsePowerWeight<W, K>;\n  using Generate = WeightGenerate<W>;\n\n  explicit WeightGenerate(bool allow_zero = true,\n                          size_t sparse_power_rank = 3)\n      : generate_(allow_zero), sparse_power_rank_(sparse_power_rank) {}\n\n  Weight operator()() const {\n    Weight weight;\n    for (size_t i = 1; i <= sparse_power_rank_; ++i) {\n      weight.PushBack(i, generate_(), true);\n    }\n    return weight;\n  }\n\n private:\n  const Generate generate_;\n  const size_t sparse_power_rank_;\n};\n\n}  // namespace fst\n\n#endif  // FST_SPARSE_POWER_WEIGHT_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/sparse-tuple-weight.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Sparse version of tuple-weight, based on tuple-weight.h.\n// Internally stores sparse key, value pairs in linked list. The default value\n// element is the assumed value of unset keys. Internal singleton\n// implementation that stores first key, value pair as a initialized member\n// variable to avoid unnecessary allocation on heap. Use\n// SparseTupleWeightIterator to iterate through the key,value pairs. Note:\n// this does NOT iterate through the default value.\n//\n// Sparse tuple weight set operation definitions.\n\n#ifndef FST_SPARSE_TUPLE_WEIGHT_H_\n#define FST_SPARSE_TUPLE_WEIGHT_H_\n\n#include <algorithm>\n#include <list>\n#include <stack>\n#include <string>\n#include <unordered_map>\n#include <utility>\n\n\n#include <fst/weight.h>\n\n\nnamespace fst {\n\ntemplate <class W, class K>\nclass SparseTupleWeightIterator;\n\n// Arbitrary dimension tuple weight, stored as a sorted linked-list.\n// W is any weight class, and K is the key value type. kNoKey (-1) is reserved\n// for internal use.\ntemplate <class W, class K = int>\nclass SparseTupleWeight {\n public:\n  using ReverseWeight = SparseTupleWeight<typename W::ReverseWeight, K>;\n\n  using Iterator = SparseTupleWeightIterator<W, K>;\n  using Pair = std::pair<K, W>;\n  using Weight = W;\n  using Index = K;\n\n  constexpr static K kNoKey = -1;\n\n  SparseTupleWeight() { Init(); }\n\n  template <class Iterator>\n  SparseTupleWeight(Iterator begin, Iterator end) {\n    Init();\n    // Assumes input iterator is sorted.\n    for (auto it = begin; it != end; ++it) PushBack(*it);\n  }\n\n  // Initialize component `key` to `weight`, with `default_weight` for all\n  // other components.\n  SparseTupleWeight(const K &key, const W &weight, const W &default_weight)\n      : default_(default_weight),\n        first_(weight == default_weight ? kNoKey : key, weight) {}\n\n  explicit SparseTupleWeight(const W &weight) { Init(weight); }\n\n  SparseTupleWeight(const SparseTupleWeight &weight) {\n    Init(weight.DefaultValue());\n    SetDefaultValue(weight.DefaultValue());\n    for (Iterator it(weight); !it.Done(); it.Next()) {\n      PushBack(it.Value());\n    }\n  }\n\n  SparseTupleWeight(SparseTupleWeight &&weight)\n    // Don't move the default, so weight.default_ is still valid.\n    : default_(weight.default_), first_(std::move(weight.first_)),\n      rest_(std::move(weight.rest_)) {\n    // move leaves the source in a valid but unspecified state.\n    // Make sure the source weight is empty.\n    weight.first_ = Pair(kNoKey, W::NoWeight());\n    weight.rest_.clear();\n  }\n\n  static const SparseTupleWeight &Zero() {\n    static const SparseTupleWeight zero(W::Zero());\n    return zero;\n  }\n\n  static const SparseTupleWeight &One() {\n    static const SparseTupleWeight one(W::One());\n    return one;\n  }\n\n  static const SparseTupleWeight &NoWeight() {\n    static const SparseTupleWeight no_weight(W::NoWeight());\n    return no_weight;\n  }\n\n  std::istream &Read(std::istream &strm) {\n    ReadType(strm, &default_);\n    ReadType(strm, &first_);\n    return ReadType(strm, &rest_);\n  }\n\n  std::ostream &Write(std::ostream &strm) const {\n    WriteType(strm, default_);\n    WriteType(strm, first_);\n    return WriteType(strm, rest_);\n  }\n\n  SparseTupleWeight &operator=(const SparseTupleWeight &weight) {\n    if (this == &weight) return *this;  // Checks for identity.\n    Init(weight.DefaultValue());\n    for (Iterator it(weight); !it.Done(); it.Next()) {\n      PushBack(it.Value());\n    }\n    return *this;\n  }\n\n  SparseTupleWeight &operator=(SparseTupleWeight &&weight) {\n    if (this == &weight) return *this;  // Checks for identity.\n    default_ = weight.default_;\n    std::swap(first_, weight.first_);\n    std::swap(rest_, weight.rest_);\n    return *this;\n  }\n\n  bool Member() const {\n    if (!DefaultValue().Member()) return false;\n    for (Iterator it(*this); !it.Done(); it.Next()) {\n      if (!it.Value().second.Member()) return false;\n    }\n    return true;\n  }\n\n  // Assumes H() function exists for the hash of the key value.\n  size_t Hash() const {\n    size_t h = 0;\n    static const std::hash<K> H;\n    for (Iterator it(*this); !it.Done(); it.Next()) {\n      h = 5 * h + H(it.Value().first);\n      h = 13 * h + it.Value().second.Hash();\n    }\n    return h;\n  }\n\n  SparseTupleWeight Quantize(float delta = kDelta) const {\n    SparseTupleWeight weight;\n    for (Iterator it(*this); !it.Done(); it.Next()) {\n      weight.PushBack(it.Value().first, it.Value().second.Quantize(delta));\n    }\n    return weight;\n  }\n\n  ReverseWeight Reverse() const {\n    SparseTupleWeight weight;\n    for (Iterator it(*this); !it.Done(); it.Next()) {\n      weight.PushBack(it.Value().first, it.Value().second.Reverse());\n    }\n    return ReverseWeight(weight);\n  }\n\n  void Init(const W &default_value = W::Zero()) {\n    first_ = Pair(kNoKey, W::NoWeight());\n    // Initialized to the reserved key value.\n    default_ = default_value;\n    rest_.clear();\n  }\n\n  size_t Size() const {\n    if (first_.first == kNoKey) {\n      return 0;\n    } else {\n      return rest_.size() + 1;\n    }\n  }\n\n  inline void PushBack(const K &key, const W &weight,\n                       bool default_value_check = true) {\n    PushBack(std::make_pair(key, weight), default_value_check);\n  }\n\n  inline void PushBack(const Pair &pair, bool default_value_check = true) {\n    if (default_value_check && pair.second == default_) return;\n    if (first_.first == kNoKey) {\n      first_ = pair;\n    } else {\n      rest_.push_back(pair);\n    }\n  }\n\n  // Returns the `key`-th component, or the default value if not set.\n  const W &Value(const K &key) const {\n    // TODO(rybach): Consider binary search.\n    Iterator iter(*this);\n    for (; !iter.Done() && iter.Value().first < key; iter.Next()) continue;\n    return !iter.Done() && iter.Value().first == key ? iter.Value().second\n                                                     : DefaultValue();\n  }\n\n  void SetValue(const K &key, const W &w) {\n    if (w == DefaultValue()) {\n      ClearValue(key);\n    } else {\n      SetValueToNonDefault(key, w);\n    }\n  }\n\n  void SetDefaultValue(const W &value) { default_ = value; }\n\n  const W &DefaultValue() const { return default_; }\n\n private:\n  void SetValueToNonDefault(const K &key, const W &w) {\n    // Don't use SparseTupleWeightIterator, since that's const.\n    if (first_.first == kNoKey) {\n      first_ = Pair(key, w);\n    } else if (key < first_.first) {\n      rest_.push_front(first_);\n      first_ = Pair(key, w);\n    } else if (key == first_.first) {\n      first_.second = w;\n    } else {\n      const auto i =\n          std::find_if(rest_.begin(), rest_.end(),\n                       [key](const Pair &p) { return p.first >= key; });\n      if (i != rest_.end() && i->first == key) {\n        i->second = w;\n      } else {\n        rest_.insert(i, Pair(key, w));\n      }\n    }\n  }\n\n  // Removes the weight value for `key`, having the effect of setting\n  // it to `DefaultValue()`.\n  void ClearValue(const K &key) {\n    if (key == first_.first) {\n      if (!rest_.empty()) {\n        first_ = rest_.front();\n        rest_.pop_front();\n      } else {\n        first_.first = kNoKey;\n      }\n    } else if (key > first_.first) {\n      const auto i =\n          std::find_if(rest_.begin(), rest_.end(),\n                       [key](const Pair &p) { return p.first >= key; });\n      if (i != rest_.end() && i->first == key) {\n        rest_.erase(i);\n      }\n    }\n  }\n\n  // Assumed default value of uninitialized keys, by default W::Zero().\n  W default_;\n\n  // Key values pairs are first stored in first_, then fill rest_ this way we\n  // can avoid dynamic allocation in the common case where the weight is a\n  // single key/value pair.\n  Pair first_;\n  std::list<Pair> rest_;\n\n  friend class SparseTupleWeightIterator<W, K>;\n};\n\n// Declare storage for kNoKey since it is passed by reference.\ntemplate <class W, class K>\nconstexpr K SparseTupleWeight<W, K>::kNoKey;\n\ntemplate <class W, class K>\nclass SparseTupleWeightIterator {\n public:\n  using Pair = typename SparseTupleWeight<W, K>::Pair;\n  using const_iterator = typename std::list<Pair>::const_iterator;\n  using iterator = typename std::list<Pair>::iterator;\n\n  explicit SparseTupleWeightIterator(const SparseTupleWeight<W, K> &weight)\n      : first_(weight.first_),\n        rest_(weight.rest_),\n        init_(true),\n        iter_(rest_.begin()) {}\n\n  bool Done() const {\n    if (init_) {\n      return first_.first == SparseTupleWeight<W, K>::kNoKey;\n    } else {\n      return iter_ == rest_.end();\n    }\n  }\n\n  const Pair &Value() const { return init_ ? first_ : *iter_; }\n\n  void Next() {\n    if (init_) {\n      init_ = false;\n    } else {\n      ++iter_;\n    }\n  }\n\n  void Reset() {\n    init_ = true;\n    iter_ = rest_.begin();\n  }\n\n private:\n  const Pair &first_;\n  const std::list<Pair> &rest_;\n  bool init_;  // In the initialized state?\n  const_iterator iter_;\n};\n\n// M must be callable as a function W(K, W, W).\n// K will be kNoKey when mapping the default value.\ntemplate <class W, class K, class M>\ninline void SparseTupleWeightMap(SparseTupleWeight<W, K> *result,\n                                 const SparseTupleWeight<W, K> &w1,\n                                 const SparseTupleWeight<W, K> &w2,\n                                 const M &operator_mapper) {\n  SparseTupleWeightIterator<W, K> w1_it(w1);\n  SparseTupleWeightIterator<W, K> w2_it(w2);\n  const auto &v1_def = w1.DefaultValue();\n  const auto &v2_def = w2.DefaultValue();\n  result->SetDefaultValue(\n      operator_mapper(SparseTupleWeight<W, K>::kNoKey, v1_def, v2_def));\n  while (!w1_it.Done() || !w2_it.Done()) {\n    const auto &k1 = (w1_it.Done()) ? w2_it.Value().first : w1_it.Value().first;\n    const auto &k2 = (w2_it.Done()) ? w1_it.Value().first : w2_it.Value().first;\n    const auto &v1 = (w1_it.Done()) ? v1_def : w1_it.Value().second;\n    const auto &v2 = (w2_it.Done()) ? v2_def : w2_it.Value().second;\n    if (k1 == k2) {\n      result->PushBack(k1, operator_mapper(k1, v1, v2));\n      if (!w1_it.Done()) w1_it.Next();\n      if (!w2_it.Done()) w2_it.Next();\n    } else if (k1 < k2) {\n      result->PushBack(k1, operator_mapper(k1, v1, v2_def));\n      w1_it.Next();\n    } else {\n      result->PushBack(k2, operator_mapper(k2, v1_def, v2));\n      w2_it.Next();\n    }\n  }\n}\n\ntemplate <class W, class K>\ninline bool operator==(const SparseTupleWeight<W, K> &w1,\n                       const SparseTupleWeight<W, K> &w2) {\n  const auto &v1_def = w1.DefaultValue();\n  const auto &v2_def = w2.DefaultValue();\n  if (v1_def != v2_def) return false;\n  SparseTupleWeightIterator<W, K> w1_it(w1);\n  SparseTupleWeightIterator<W, K> w2_it(w2);\n  while (!w1_it.Done() || !w2_it.Done()) {\n    const auto &k1 = (w1_it.Done()) ? w2_it.Value().first : w1_it.Value().first;\n    const auto &k2 = (w2_it.Done()) ? w1_it.Value().first : w2_it.Value().first;\n    const auto &v1 = (w1_it.Done()) ? v1_def : w1_it.Value().second;\n    const auto &v2 = (w2_it.Done()) ? v2_def : w2_it.Value().second;\n    if (k1 == k2) {\n      if (v1 != v2) return false;\n      if (!w1_it.Done()) w1_it.Next();\n      if (!w2_it.Done()) w2_it.Next();\n    } else if (k1 < k2) {\n      if (v1 != v2_def) return false;\n      w1_it.Next();\n    } else {\n      if (v1_def != v2) return false;\n      w2_it.Next();\n    }\n  }\n  return true;\n}\n\ntemplate <class W, class K>\ninline bool operator!=(const SparseTupleWeight<W, K> &w1,\n                       const SparseTupleWeight<W, K> &w2) {\n  return !(w1 == w2);\n}\n\ntemplate <class W, class K>\ninline std::ostream &operator<<(std::ostream &strm,\n                                const SparseTupleWeight<W, K> &weight) {\n  CompositeWeightWriter writer(strm);\n  writer.WriteBegin();\n  writer.WriteElement(weight.DefaultValue());\n  for (SparseTupleWeightIterator<W, K> it(weight); !it.Done(); it.Next()) {\n    writer.WriteElement(it.Value().first);\n    writer.WriteElement(it.Value().second);\n  }\n  writer.WriteEnd();\n  return strm;\n}\n\ntemplate <class W, class K>\ninline std::istream &operator>>(std::istream &strm,\n                                SparseTupleWeight<W, K> &weight) {\n  CompositeWeightReader reader(strm);\n  reader.ReadBegin();\n  W def;\n  bool more = reader.ReadElement(&def);\n  weight.Init(def);\n  while (more) {\n    K key;\n    reader.ReadElement(&key);\n    W v;\n    more = reader.ReadElement(&v);\n    weight.PushBack(key, v);\n  }\n  reader.ReadEnd();\n  return strm;\n}\n\n}  // namespace fst\n\n#endif  // FST_SPARSE_TUPLE_WEIGHT_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/state-map.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Class to map over/transform states e.g., sort transitions.\n//\n// Consider using when operation does not change the number of states.\n\n#ifndef FST_STATE_MAP_H_\n#define FST_STATE_MAP_H_\n\n#include <algorithm>\n#include <string>\n#include <utility>\n\n#include <fst/log.h>\n\n#include <fst/arc-map.h>\n#include <fst/cache.h>\n#include <fst/mutable-fst.h>\n\n\nnamespace fst {\n\n// StateMapper Interface. The class determines how states are mapped; useful for\n// implementing operations that do not change the number of states.\n//\n// class StateMapper {\n//  public:\n//   using FromArc = A;\n//   using ToArc = B;\n//\n//   // Typical constructor.\n//   StateMapper(const Fst<A> &fst);\n//\n//   // Required copy constructor that allows updating FST argument;\n//   // pass only if relevant and changed.\n//   StateMapper(const StateMapper &mapper, const Fst<A> *fst = 0);\n//\n//   // Specifies initial state of result.\n//   B::StateId Start() const;\n//   // Specifies state's final weight in result.\n//   B::Weight Final(B::StateId state) const;\n//\n//   // These methods iterate through a state's arcs in result.\n//\n//   // Specifies state to iterate over.\n//   void SetState(B::StateId state);\n//\n//   // End of arcs?\n//   bool Done() const;\n//\n//   // Current arc.\n//   const B &Value() const;\n//\n//   // Advances to next arc (when !Done)\n//   void Next();\n//\n//   // Specifies input symbol table action the mapper requires (see above).\n//   MapSymbolsAction InputSymbolsAction() const;\n//\n//   // Specifies output symbol table action the mapper requires (see above).\n//   MapSymbolsAction OutputSymbolsAction() const;\n//\n//   // This specifies the known properties of an FST mapped by this\n//   // mapper. It takes as argument the input FST's known properties.\n//   uint64 Properties(uint64 props) const;\n// };\n//\n// We include a various state map versions below. One dimension of variation is\n// whether the mapping mutates its input, writes to a new result FST, or is an\n// on-the-fly Fst. Another dimension is how we pass the mapper. We allow passing\n// the mapper by pointer for cases that we need to change the state of the\n// user's mapper. We also include map versions that pass the mapper by value or\n// const reference when this suffices.\n\n// Maps an arc type A using a mapper function object C, passed by pointer. This\n// version modifies the input FST.\ntemplate <class A, class C>\nvoid StateMap(MutableFst<A> *fst, C *mapper) {\n  if (mapper->InputSymbolsAction() == MAP_CLEAR_SYMBOLS) {\n    fst->SetInputSymbols(nullptr);\n  }\n  if (mapper->OutputSymbolsAction() == MAP_CLEAR_SYMBOLS) {\n    fst->SetOutputSymbols(nullptr);\n  }\n  if (fst->Start() == kNoStateId) return;\n  const auto props = fst->Properties(kFstProperties, false);\n  fst->SetStart(mapper->Start());\n  for (StateIterator<Fst<A>> siter(*fst); !siter.Done(); siter.Next()) {\n    const auto state = siter.Value();\n    mapper->SetState(state);\n    fst->DeleteArcs(state);\n    for (; !mapper->Done(); mapper->Next()) {\n      fst->AddArc(state, mapper->Value());\n    }\n    fst->SetFinal(state, mapper->Final(state));\n  }\n  fst->SetProperties(mapper->Properties(props), kFstProperties);\n}\n\n// Maps an arc type A using a mapper function object C, passed by value.\n// This version modifies the input FST.\ntemplate <class A, class C>\nvoid StateMap(MutableFst<A> *fst, C mapper) {\n  StateMap(fst, &mapper);\n}\n\n// Maps an arc type A to an arc type B using mapper functor C, passed by\n// pointer. This version writes to an output FST.\ntemplate <class A, class B, class C>\nvoid StateMap(const Fst<A> &ifst, MutableFst<B> *ofst, C *mapper) {\n  ofst->DeleteStates();\n  if (mapper->InputSymbolsAction() == MAP_COPY_SYMBOLS) {\n    ofst->SetInputSymbols(ifst.InputSymbols());\n  } else if (mapper->InputSymbolsAction() == MAP_CLEAR_SYMBOLS) {\n    ofst->SetInputSymbols(nullptr);\n  }\n  if (mapper->OutputSymbolsAction() == MAP_COPY_SYMBOLS) {\n    ofst->SetOutputSymbols(ifst.OutputSymbols());\n  } else if (mapper->OutputSymbolsAction() == MAP_CLEAR_SYMBOLS) {\n    ofst->SetOutputSymbols(nullptr);\n  }\n  const auto iprops = ifst.Properties(kCopyProperties, false);\n  if (ifst.Start() == kNoStateId) {\n    if (iprops & kError) ofst->SetProperties(kError, kError);\n    return;\n  }\n  // Adds all states.\n  if (ifst.Properties(kExpanded, false)) ofst->ReserveStates(CountStates(ifst));\n  for (StateIterator<Fst<A>> siter(ifst); !siter.Done(); siter.Next()) {\n    ofst->AddState();\n  }\n  ofst->SetStart(mapper->Start());\n  for (StateIterator<Fst<A>> siter(ifst); !siter.Done(); siter.Next()) {\n    const auto state = siter.Value();\n    mapper->SetState(state);\n    for (; !mapper->Done(); mapper->Next()) {\n      ofst->AddArc(state, mapper->Value());\n    }\n    ofst->SetFinal(state, mapper->Final(state));\n  }\n  const auto oprops = ofst->Properties(kFstProperties, false);\n  ofst->SetProperties(mapper->Properties(iprops) | oprops, kFstProperties);\n}\n\n// Maps an arc type A to an arc type B using mapper functor object C, passed by\n// value. This version writes to an output FST.\ntemplate <class A, class B, class C>\nvoid StateMap(const Fst<A> &ifst, MutableFst<B> *ofst, C mapper) {\n  StateMap(ifst, ofst, &mapper);\n}\n\nusing StateMapFstOptions = CacheOptions;\n\ntemplate <class A, class B, class C>\nclass StateMapFst;\n\n// Facade around StateIteratorBase<A> inheriting from StateIteratorBase<B>.\ntemplate <class A, class B>\nclass StateMapStateIteratorBase : public StateIteratorBase<B> {\n public:\n  using Arc = B;\n  using StateId = typename Arc::StateId;\n\n  explicit StateMapStateIteratorBase(StateIteratorBase<A> *base)\n      : base_(base) {}\n\n  bool Done() const final { return base_->Done(); }\n\n  StateId Value() const final { return base_->Value(); }\n\n  void Next() final { base_->Next(); }\n\n  void Reset() final { base_->Reset(); }\n\n private:\n  std::unique_ptr<StateIteratorBase<A>> base_;\n\n  StateMapStateIteratorBase() = delete;\n};\n\nnamespace internal {\n\n// Implementation of delayed StateMapFst.\ntemplate <class A, class B, class C>\nclass StateMapFstImpl : public CacheImpl<B> {\n public:\n  using Arc = B;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using FstImpl<B>::SetType;\n  using FstImpl<B>::SetProperties;\n  using FstImpl<B>::SetInputSymbols;\n  using FstImpl<B>::SetOutputSymbols;\n\n  using CacheImpl<B>::PushArc;\n  using CacheImpl<B>::HasArcs;\n  using CacheImpl<B>::HasFinal;\n  using CacheImpl<B>::HasStart;\n  using CacheImpl<B>::SetArcs;\n  using CacheImpl<B>::SetFinal;\n  using CacheImpl<B>::SetStart;\n\n  friend class StateIterator<StateMapFst<A, B, C>>;\n\n  StateMapFstImpl(const Fst<A> &fst, const C &mapper,\n                  const StateMapFstOptions &opts)\n      : CacheImpl<B>(opts),\n        fst_(fst.Copy()),\n        mapper_(new C(mapper, fst_.get())),\n        own_mapper_(true) {\n    Init();\n  }\n\n  StateMapFstImpl(const Fst<A> &fst, C *mapper, const StateMapFstOptions &opts)\n      : CacheImpl<B>(opts),\n        fst_(fst.Copy()),\n        mapper_(mapper),\n        own_mapper_(false) {\n    Init();\n  }\n\n  StateMapFstImpl(const StateMapFstImpl<A, B, C> &impl)\n      : CacheImpl<B>(impl),\n        fst_(impl.fst_->Copy(true)),\n        mapper_(new C(*impl.mapper_, fst_.get())),\n        own_mapper_(true) {\n    Init();\n  }\n\n  ~StateMapFstImpl() override {\n    if (own_mapper_) delete mapper_;\n  }\n\n  StateId Start() {\n    if (!HasStart()) SetStart(mapper_->Start());\n    return CacheImpl<B>::Start();\n  }\n\n  Weight Final(StateId state) {\n    if (!HasFinal(state)) SetFinal(state, mapper_->Final(state));\n    return CacheImpl<B>::Final(state);\n  }\n\n  size_t NumArcs(StateId state) {\n    if (!HasArcs(state)) Expand(state);\n    return CacheImpl<B>::NumArcs(state);\n  }\n\n  size_t NumInputEpsilons(StateId state) {\n    if (!HasArcs(state)) Expand(state);\n    return CacheImpl<B>::NumInputEpsilons(state);\n  }\n\n  size_t NumOutputEpsilons(StateId state) {\n    if (!HasArcs(state)) Expand(state);\n    return CacheImpl<B>::NumOutputEpsilons(state);\n  }\n\n  void InitStateIterator(StateIteratorData<B> *datb) const {\n    StateIteratorData<A> data;\n    fst_->InitStateIterator(&data);\n    datb->base = data.base ? new StateMapStateIteratorBase<A, B>(data.base)\n        : nullptr;\n    datb->nstates = data.nstates;\n  }\n\n  void InitArcIterator(StateId state, ArcIteratorData<B> *data) {\n    if (!HasArcs(state)) Expand(state);\n    CacheImpl<B>::InitArcIterator(state, data);\n  }\n\n  uint64 Properties() const override { return Properties(kFstProperties); }\n\n  uint64 Properties(uint64 mask) const override {\n    if ((mask & kError) && (fst_->Properties(kError, false) ||\n                            (mapper_->Properties(0) & kError))) {\n      SetProperties(kError, kError);\n    }\n    return FstImpl<Arc>::Properties(mask);\n  }\n\n  void Expand(StateId state) {\n    // Adds exiting arcs.\n    for (mapper_->SetState(state); !mapper_->Done(); mapper_->Next()) {\n      PushArc(state, mapper_->Value());\n    }\n    SetArcs(state);\n  }\n\n  const Fst<A> *GetFst() const { return fst_.get(); }\n\n private:\n  void Init() {\n    SetType(\"statemap\");\n    if (mapper_->InputSymbolsAction() == MAP_COPY_SYMBOLS) {\n      SetInputSymbols(fst_->InputSymbols());\n    } else if (mapper_->InputSymbolsAction() == MAP_CLEAR_SYMBOLS) {\n      SetInputSymbols(nullptr);\n    }\n    if (mapper_->OutputSymbolsAction() == MAP_COPY_SYMBOLS) {\n      SetOutputSymbols(fst_->OutputSymbols());\n    } else if (mapper_->OutputSymbolsAction() == MAP_CLEAR_SYMBOLS) {\n      SetOutputSymbols(nullptr);\n    }\n    const auto props = fst_->Properties(kCopyProperties, false);\n    SetProperties(mapper_->Properties(props));\n  }\n\n  std::unique_ptr<const Fst<A>> fst_;\n  C *mapper_;\n  bool own_mapper_;\n};\n\n}  // namespace internal\n\n// Maps an arc type A to an arc type B using Mapper function object\n// C. This version is a delayed FST.\ntemplate <class A, class B, class C>\nclass StateMapFst : public ImplToFst<internal::StateMapFstImpl<A, B, C>> {\n public:\n  friend class ArcIterator<StateMapFst<A, B, C>>;\n\n  using Arc = B;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n  using Store = DefaultCacheStore<Arc>;\n  using State = typename Store::State;\n  using Impl = internal::StateMapFstImpl<A, B, C>;\n\n  StateMapFst(const Fst<A> &fst, const C &mapper,\n              const StateMapFstOptions &opts)\n      : ImplToFst<Impl>(std::make_shared<Impl>(fst, mapper, opts)) {}\n\n  StateMapFst(const Fst<A> &fst, C *mapper, const StateMapFstOptions &opts)\n      : ImplToFst<Impl>(std::make_shared<Impl>(fst, mapper, opts)) {}\n\n  StateMapFst(const Fst<A> &fst, const C &mapper)\n      : ImplToFst<Impl>(\n            std::make_shared<Impl>(fst, mapper, StateMapFstOptions())) {}\n\n  StateMapFst(const Fst<A> &fst, C *mapper)\n      : ImplToFst<Impl>(\n            std::make_shared<Impl>(fst, mapper, StateMapFstOptions())) {}\n\n  // See Fst<>::Copy() for doc.\n  StateMapFst(const StateMapFst<A, B, C> &fst, bool safe = false)\n      : ImplToFst<Impl>(fst, safe) {}\n\n  // Get a copy of this StateMapFst. See Fst<>::Copy() for further doc.\n  StateMapFst<A, B, C> *Copy(bool safe = false) const override {\n    return new StateMapFst<A, B, C>(*this, safe);\n  }\n\n  void InitStateIterator(StateIteratorData<B> *data) const override {\n    GetImpl()->InitStateIterator(data);\n  }\n\n  void InitArcIterator(StateId state, ArcIteratorData<B> *data) const override {\n    GetMutableImpl()->InitArcIterator(state, data);\n  }\n\n protected:\n  using ImplToFst<Impl>::GetImpl;\n  using ImplToFst<Impl>::GetMutableImpl;\n\n private:\n  StateMapFst &operator=(const StateMapFst &) = delete;\n};\n\n// Specialization for StateMapFst.\ntemplate <class A, class B, class C>\nclass ArcIterator<StateMapFst<A, B, C>>\n    : public CacheArcIterator<StateMapFst<A, B, C>> {\n public:\n  using StateId = typename A::StateId;\n\n  ArcIterator(const StateMapFst<A, B, C> &fst, StateId state)\n      : CacheArcIterator<StateMapFst<A, B, C>>(fst.GetMutableImpl(), state) {\n    if (!fst.GetImpl()->HasArcs(state)) fst.GetMutableImpl()->Expand(state);\n  }\n};\n\n// Utility mappers.\n\n// Mapper that returns its input.\ntemplate <class Arc>\nclass IdentityStateMapper {\n public:\n  using FromArc = Arc;\n  using ToArc = Arc;\n\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  explicit IdentityStateMapper(const Fst<Arc> &fst) : fst_(fst) {}\n\n  // Allows updating FST argument; pass only if changed.\n  IdentityStateMapper(const IdentityStateMapper<Arc> &mapper,\n                      const Fst<Arc> *fst = nullptr)\n      : fst_(fst ? *fst : mapper.fst_) {}\n\n  StateId Start() const { return fst_.Start(); }\n\n  Weight Final(StateId state) const { return fst_.Final(state); }\n\n  void SetState(StateId state) {\n    aiter_.reset(new ArcIterator<Fst<Arc>>(fst_, state));\n  }\n\n  bool Done() const { return aiter_->Done(); }\n\n  const Arc &Value() const { return aiter_->Value(); }\n\n  void Next() { aiter_->Next(); }\n\n  constexpr MapSymbolsAction InputSymbolsAction() const {\n    return MAP_COPY_SYMBOLS;\n  }\n\n  constexpr MapSymbolsAction OutputSymbolsAction() const {\n    return MAP_COPY_SYMBOLS;\n  }\n\n  uint64 Properties(uint64 props) const { return props; }\n\n private:\n  const Fst<Arc> &fst_;\n  std::unique_ptr<ArcIterator<Fst<Arc>>> aiter_;\n};\n\ntemplate <class Arc>\nclass ArcSumMapper {\n public:\n  using FromArc = Arc;\n  using ToArc = Arc;\n\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  explicit ArcSumMapper(const Fst<Arc> &fst) : fst_(fst), i_(0) {}\n\n  // Allows updating FST argument; pass only if changed.\n  ArcSumMapper(const ArcSumMapper<Arc> &mapper, const Fst<Arc> *fst = nullptr)\n      : fst_(fst ? *fst : mapper.fst_), i_(0) {}\n\n  StateId Start() const { return fst_.Start(); }\n\n  Weight Final(StateId state) const { return fst_.Final(state); }\n\n  void SetState(StateId state) {\n    i_ = 0;\n    arcs_.clear();\n    arcs_.reserve(fst_.NumArcs(state));\n    for (ArcIterator<Fst<Arc>> aiter(fst_, state); !aiter.Done();\n         aiter.Next()) {\n      arcs_.push_back(aiter.Value());\n    }\n    // First sorts the exiting arcs by input label, output label and destination\n    // state and then sums weights of arcs with the same input label, output\n    // label, and destination state.\n    std::sort(arcs_.begin(), arcs_.end(), comp_);\n    size_t narcs = 0;\n    for (const auto &arc : arcs_) {\n      if (narcs > 0 && equal_(arc, arcs_[narcs - 1])) {\n        arcs_[narcs - 1].weight = Plus(arcs_[narcs - 1].weight, arc.weight);\n      } else {\n        arcs_[narcs] = arc;\n        ++narcs;\n      }\n    }\n    arcs_.resize(narcs);\n  }\n\n  bool Done() const { return i_ >= arcs_.size(); }\n\n  const Arc &Value() const { return arcs_[i_]; }\n\n  void Next() { ++i_; }\n\n  constexpr MapSymbolsAction InputSymbolsAction() const {\n    return MAP_COPY_SYMBOLS;\n  }\n\n  constexpr MapSymbolsAction OutputSymbolsAction() const {\n    return MAP_COPY_SYMBOLS;\n  }\n\n  uint64 Properties(uint64 props) const {\n    return props & kArcSortProperties & kDeleteArcsProperties &\n           kWeightInvariantProperties;\n  }\n\n private:\n  struct Compare {\n    bool operator()(const Arc &x, const Arc &y) const {\n      if (x.ilabel < y.ilabel) return true;\n      if (x.ilabel > y.ilabel) return false;\n      if (x.olabel < y.olabel) return true;\n      if (x.olabel > y.olabel) return false;\n      if (x.nextstate < y.nextstate) return true;\n      if (x.nextstate > y.nextstate) return false;\n      return false;\n    }\n  };\n\n  struct Equal {\n    bool operator()(const Arc &x, const Arc &y) const {\n      return (x.ilabel == y.ilabel && x.olabel == y.olabel &&\n              x.nextstate == y.nextstate);\n    }\n  };\n\n  const Fst<Arc> &fst_;\n  Compare comp_;\n  Equal equal_;\n  std::vector<Arc> arcs_;\n  ssize_t i_;  // Current arc position.\n\n  ArcSumMapper &operator=(const ArcSumMapper &) = delete;\n};\n\ntemplate <class Arc>\nclass ArcUniqueMapper {\n public:\n  using FromArc = Arc;\n  using ToArc = Arc;\n\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  explicit ArcUniqueMapper(const Fst<Arc> &fst) : fst_(fst), i_(0) {}\n\n  // Allows updating FST argument; pass only if changed.\n  ArcUniqueMapper(const ArcUniqueMapper<Arc> &mapper,\n                  const Fst<Arc> *fst = nullptr)\n      : fst_(fst ? *fst : mapper.fst_), i_(0) {}\n\n  StateId Start() const { return fst_.Start(); }\n\n  Weight Final(StateId state) const { return fst_.Final(state); }\n\n  void SetState(StateId state) {\n    i_ = 0;\n    arcs_.clear();\n    arcs_.reserve(fst_.NumArcs(state));\n    for (ArcIterator<Fst<Arc>> aiter(fst_, state); !aiter.Done();\n         aiter.Next()) {\n      arcs_.push_back(aiter.Value());\n    }\n    // First sorts the exiting arcs by input label, output label and destination\n    // state and then uniques identical arcs.\n    std::sort(arcs_.begin(), arcs_.end(), comp_);\n    arcs_.erase(std::unique(arcs_.begin(), arcs_.end(), equal_), arcs_.end());\n  }\n\n  bool Done() const { return i_ >= arcs_.size(); }\n\n  const Arc &Value() const { return arcs_[i_]; }\n\n  void Next() { ++i_; }\n\n  constexpr MapSymbolsAction InputSymbolsAction() const {\n    return MAP_COPY_SYMBOLS;\n  }\n\n  constexpr MapSymbolsAction OutputSymbolsAction() const {\n    return MAP_COPY_SYMBOLS;\n  }\n\n  uint64 Properties(uint64 props) const {\n    return props & kArcSortProperties & kDeleteArcsProperties;\n  }\n\n private:\n  struct Compare {\n    bool operator()(const Arc &x, const Arc &y) const {\n      if (x.ilabel < y.ilabel) return true;\n      if (x.ilabel > y.ilabel) return false;\n      if (x.olabel < y.olabel) return true;\n      if (x.olabel > y.olabel) return false;\n      if (x.nextstate < y.nextstate) return true;\n      if (x.nextstate > y.nextstate) return false;\n      return false;\n    }\n  };\n\n  struct Equal {\n    bool operator()(const Arc &x, const Arc &y) const {\n      return (x.ilabel == y.ilabel && x.olabel == y.olabel &&\n              x.nextstate == y.nextstate && x.weight == y.weight);\n    }\n  };\n\n  const Fst<Arc> &fst_;\n  Compare comp_;\n  Equal equal_;\n  std::vector<Arc> arcs_;\n  size_t i_;  // Current arc position.\n\n  ArcUniqueMapper &operator=(const ArcUniqueMapper &) = delete;\n};\n\n// Useful aliases when using StdArc.\n\nusing StdArcSumMapper = ArcSumMapper<StdArc>;\n\nusing StdArcUniqueMapper = ArcUniqueMapper<StdArc>;\n\n}  // namespace fst\n\n#endif  // FST_STATE_MAP_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/state-reachable.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Class to determine whether a given (final) state can be reached from some\n// other given state.\n\n#ifndef FST_STATE_REACHABLE_H_\n#define FST_STATE_REACHABLE_H_\n\n#include <vector>\n\n#include <fst/log.h>\n\n#include <fst/connect.h>\n#include <fst/dfs-visit.h>\n#include <fst/fst.h>\n#include <fst/interval-set.h>\n#include <fst/vector-fst.h>\n\n\nnamespace fst {\n\n// Computes the (final) states reachable from a given state in an FST. After\n// this visitor has been called, a final state f can be reached from a state\n// s iff (*isets)[s].Member(state2index[f]) is true, where (*isets[s]) is a\n// set of half-open inteval of final state indices and state2index[f] maps from\n// a final state to its index. If state2index is empty, it is filled-in with\n// suitable indices. If it is non-empty, those indices are used; in this case,\n// the final states must have out-degree 0.\ntemplate <class Arc, class I = typename Arc::StateId, class S = IntervalSet<I>>\nclass IntervalReachVisitor {\n public:\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using Index = I;\n  using ISet = S;\n  using Interval = typename ISet::Interval;\n\n  IntervalReachVisitor(const Fst<Arc> &fst, std::vector<S> *isets,\n                       std::vector<Index> *state2index)\n      : fst_(fst),\n        isets_(isets),\n        state2index_(state2index),\n        index_(state2index->empty() ? 1 : -1),\n        error_(false) {\n    isets_->clear();\n  }\n\n  void InitVisit(const Fst<Arc> &) { error_ = false; }\n\n  bool InitState(StateId s, StateId r) {\n    while (isets_->size() <= s) isets_->push_back(S());\n    while (state2index_->size() <= s) state2index_->push_back(-1);\n    if (fst_.Final(s) != Weight::Zero()) {\n      // Create tree interval.\n      auto *intervals = (*isets_)[s].MutableIntervals();\n      if (index_ < 0) {  // Uses state2index_ map to set index.\n        if (fst_.NumArcs(s) > 0) {\n          FSTERROR() << \"IntervalReachVisitor: state2index map must be empty \"\n                     << \"for this FST\";\n          error_ = true;\n          return false;\n        }\n        const auto index = (*state2index_)[s];\n        if (index < 0) {\n          FSTERROR() << \"IntervalReachVisitor: state2index map incomplete\";\n          error_ = true;\n          return false;\n        }\n        intervals->push_back(Interval(index, index + 1));\n      } else {  // Use pre-order index.\n        intervals->push_back(Interval(index_, index_ + 1));\n        (*state2index_)[s] = index_++;\n      }\n    }\n    return true;\n  }\n\n  constexpr bool TreeArc(StateId, const Arc &) const { return true; }\n\n  bool BackArc(StateId s, const Arc &arc) {\n    FSTERROR() << \"IntervalReachVisitor: Cyclic input\";\n    error_ = true;\n    return false;\n  }\n\n  bool ForwardOrCrossArc(StateId s, const Arc &arc) {\n    // Non-tree interval.\n    (*isets_)[s].Union((*isets_)[arc.nextstate]);\n    return true;\n  }\n\n  void FinishState(StateId s, StateId p, const Arc *) {\n    if (index_ >= 0 && fst_.Final(s) != Weight::Zero()) {\n      auto *intervals = (*isets_)[s].MutableIntervals();\n      (*intervals)[0].end = index_;  // Updates tree interval end.\n    }\n    (*isets_)[s].Normalize();\n    if (p != kNoStateId) {\n      (*isets_)[p].Union((*isets_)[s]);  // Propagates intervals to parent.\n    }\n  }\n\n  void FinishVisit() {}\n\n  bool Error() const { return error_; }\n\n private:\n  const Fst<Arc> &fst_;\n  std::vector<ISet> *isets_;\n  std::vector<Index> *state2index_;\n  Index index_;\n  bool error_;\n};\n\n// Tests reachability of final states from a given state. To test for\n// reachability from a state s, first do SetState(s). Then a final state f can\n// be reached from state s of FST iff Reach(f) is true. The input can be cyclic,\n// but no cycle may contain a final state.\ntemplate <class Arc, class I = typename Arc::StateId, class S = IntervalSet<I>>\nclass StateReachable {\n public:\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using Index = I;\n  using ISet = S;\n  using Interval = typename ISet::Interval;\n\n  explicit StateReachable(const Fst<Arc> &fst) : error_(false) {\n    if (fst.Properties(kAcyclic, true)) {\n      AcyclicStateReachable(fst);\n    } else {\n      CyclicStateReachable(fst);\n    }\n  }\n\n  explicit StateReachable(const StateReachable<Arc> &reachable) {\n    FSTERROR() << \"Copy constructor for state reachable class \"\n               << \"not implemented.\";\n    error_ = true;\n  }\n\n  // Sets current state.\n  void SetState(StateId s) { s_ = s; }\n\n  // Can reach this final state from current state?\n  bool Reach(StateId s) {\n    if (s >= state2index_.size()) return false;\n    const auto i = state2index_[s];\n    if (i < 0) {\n      FSTERROR() << \"StateReachable: State non-final: \" << s;\n      error_ = true;\n      return false;\n    }\n    return isets_[s_].Member(i);\n  }\n\n  // Access to the state-to-index mapping. Unassigned states have index -1.\n  std::vector<Index> &State2Index() { return state2index_; }\n\n  // Access to the interval sets. These specify the reachability to the final\n  // states as intervals of the final state indices.\n  const std::vector<ISet> &IntervalSets() { return isets_; }\n\n  bool Error() const { return error_; }\n\n private:\n  void AcyclicStateReachable(const Fst<Arc> &fst) {\n    IntervalReachVisitor<Arc, StateId, ISet> reach_visitor(fst, &isets_,\n                                                           &state2index_);\n    DfsVisit(fst, &reach_visitor);\n    if (reach_visitor.Error()) error_ = true;\n  }\n\n  void CyclicStateReachable(const Fst<Arc> &fst) {\n    // Finds state reachability on the acyclic condensation FST.\n    VectorFst<Arc> cfst;\n    std::vector<StateId> scc;\n    Condense(fst, &cfst, &scc);\n    StateReachable reachable(cfst);\n    if (reachable.Error()) {\n      error_ = true;\n      return;\n    }\n    // Gets the number of states per SCC.\n    std::vector<size_t> nscc;\n    for (StateId s = 0; s < scc.size(); ++s) {\n      const auto c = scc[s];\n      while (c >= nscc.size()) nscc.push_back(0);\n      ++nscc[c];\n    }\n    // Constructs the interval sets and state index mapping for the original\n    // FST from the condensation FST.\n    state2index_.resize(scc.size(), -1);\n    isets_.resize(scc.size());\n    for (StateId s = 0; s < scc.size(); ++s) {\n      const auto c = scc[s];\n      isets_[s] = reachable.IntervalSets()[c];\n      state2index_[s] = reachable.State2Index()[c];\n      // Checks that each final state in an input FST is not contained in a\n      // cycle (i.e., not in a non-trivial SCC).\n      if (cfst.Final(c) != Weight::Zero() && nscc[c] > 1) {\n        FSTERROR() << \"StateReachable: Final state contained in a cycle\";\n        error_ = true;\n        return;\n      }\n    }\n  }\n\n  StateId s_;                       // Current state.\n  std::vector<ISet> isets_;         // Interval sets per state.\n  std::vector<Index> state2index_;  // Finds index for a final state.\n  bool error_;\n\n  StateReachable &operator=(const StateReachable &) = delete;\n};\n\n}  // namespace fst\n\n#endif  // FST_STATE_REACHABLE_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/state-table.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Classes for representing the mapping between state tuples and state IDs.\n\n#ifndef FST_STATE_TABLE_H_\n#define FST_STATE_TABLE_H_\n\n#include <deque>\n#include <utility>\n#include <vector>\n\n#include <fst/log.h>\n\n#include <fst/bi-table.h>\n#include <fst/expanded-fst.h>\n#include <fst/filter-state.h>\n\n\nnamespace fst {\n\n// State tables determine the bijective mapping between state tuples (e.g., in\n// composition, triples of two FST states and a composition filter state) and\n// their corresponding state IDs. They are classes, templated on state tuples,\n// with the following interface:\n//\n// template <class T>\n// class StateTable {\n//  public:\n//   using StateTuple = T;\n//\n//   // Required constructors.\n//   StateTable();\n//\n//   StateTable(const StateTable &);\n//\n//   // Looks up state ID by tuple. If it doesn't exist, then add it.\n//   StateId FindState(const StateTuple &tuple);\n//\n//   // Looks up state tuple by state ID.\n//   const StateTuple<StateId> &Tuple(StateId s) const;\n//\n//   // # of stored tuples.\n//   StateId Size() const;\n// };\n//\n// A state tuple has the form:\n//\n// template <class S>\n// struct StateTuple {\n//   using StateId = S;\n//\n//   // Required constructors.\n//\n//   StateTuple();\n//\n//   StateTuple(const StateTuple &tuple);\n// };\n\n// An implementation using a hash map for the tuple to state ID mapping. The\n// state tuple T must support operator==.\ntemplate <class T, class H>\nclass HashStateTable : public HashBiTable<typename T::StateId, T, H> {\n public:\n  using StateTuple = T;\n  using StateId = typename StateTuple::StateId;\n\n  using HashBiTable<StateId, StateTuple, H>::FindId;\n  using HashBiTable<StateId, StateTuple, H>::FindEntry;\n  using HashBiTable<StateId, StateTuple, H>::Size;\n\n  HashStateTable() : HashBiTable<StateId, StateTuple, H>() {}\n\n  explicit HashStateTable(size_t table_size)\n      : HashBiTable<StateId, StateTuple, H>(table_size) {}\n\n  StateId FindState(const StateTuple &tuple) { return FindId(tuple); }\n\n  const StateTuple &Tuple(StateId s) const { return FindEntry(s); }\n};\n\n// An implementation using a hash map for the tuple to state ID mapping. The\n// state tuple T must support operator==.\ntemplate <class T, class H>\nclass CompactHashStateTable\n    : public CompactHashBiTable<typename T::StateId, T, H> {\n public:\n  using StateTuple = T;\n  using StateId = typename StateTuple::StateId;\n\n  using CompactHashBiTable<StateId, StateTuple, H>::FindId;\n  using CompactHashBiTable<StateId, StateTuple, H>::FindEntry;\n  using CompactHashBiTable<StateId, StateTuple, H>::Size;\n\n  CompactHashStateTable() : CompactHashBiTable<StateId, StateTuple, H>() {}\n\n  explicit CompactHashStateTable(size_t table_size)\n      : CompactHashBiTable<StateId, StateTuple, H>(table_size) {}\n\n  StateId FindState(const StateTuple &tuple) { return FindId(tuple); }\n\n  const StateTuple &Tuple(StateId s) const { return FindEntry(s); }\n};\n\n// An implementation using a vector for the tuple to state mapping. It is\n// passed a fingerprint functor that should fingerprint tuples uniquely to an\n// integer that can used as a vector index. Normally, VectorStateTable\n// constructs the fingerprint functor. Alternately, the user can pass this\n// object, in which case the table takes ownership.\ntemplate <class T, class FP>\nclass VectorStateTable : public VectorBiTable<typename T::StateId, T, FP> {\n public:\n  using StateTuple = T;\n  using StateId = typename StateTuple::StateId;\n\n  using VectorBiTable<StateId, StateTuple, FP>::FindId;\n  using VectorBiTable<StateId, StateTuple, FP>::FindEntry;\n  using VectorBiTable<StateId, StateTuple, FP>::Size;\n  using VectorBiTable<StateId, StateTuple, FP>::Fingerprint;\n\n  explicit VectorStateTable(FP *fingerprint = nullptr, size_t table_size = 0)\n      : VectorBiTable<StateId, StateTuple, FP>(fingerprint, table_size) {}\n\n  StateId FindState(const StateTuple &tuple) { return FindId(tuple); }\n\n  const StateTuple &Tuple(StateId s) const { return FindEntry(s); }\n};\n\n// An implementation using a vector and a compact hash table. The selection\n// functor returns true for tuples to be hashed in the vector. The fingerprint\n// functor should fingerprint tuples uniquely to an integer that can be used as\n// a vector index. A hash functor is used when hashing tuples into the compact\n// hash table.\ntemplate <class T, class Select, class FP, class H>\nclass VectorHashStateTable\n    : public VectorHashBiTable<typename T::StateId, T, Select, FP, H> {\n public:\n  using StateTuple = T;\n  using StateId = typename StateTuple::StateId;\n\n  using VectorHashBiTable<StateId, StateTuple, Select, FP, H>::FindId;\n  using VectorHashBiTable<StateId, StateTuple, Select, FP, H>::FindEntry;\n  using VectorHashBiTable<StateId, StateTuple, Select, FP, H>::Size;\n  using VectorHashBiTable<StateId, StateTuple, Select, FP, H>::Selector;\n  using VectorHashBiTable<StateId, StateTuple, Select, FP, H>::Fingerprint;\n  using VectorHashBiTable<StateId, StateTuple, Select, FP, H>::Hash;\n\n  VectorHashStateTable(Select *select, FP *fingerprint, H *hash,\n                       size_t vector_size = 0, size_t tuple_size = 0)\n      : VectorHashBiTable<StateId, StateTuple, Select, FP, H>(\n            select, fingerprint, hash, vector_size, tuple_size) {}\n\n  StateId FindState(const StateTuple &tuple) { return FindId(tuple); }\n\n  const StateTuple &Tuple(StateId s) const { return FindEntry(s); }\n};\n\n// An implementation using a hash map to map from tuples to state IDs. This\n// version permits erasing of states. The state tuple's default constructor\n// must produce a tuple that will never be seen and the table must suppor\n// operator==.\ntemplate <class T, class H>\nclass ErasableStateTable : public ErasableBiTable<typename T::StateId, T, H> {\n public:\n  using StateTuple = T;\n  using StateId = typename StateTuple::StateId;\n\n  using ErasableBiTable<StateId, StateTuple, H>::FindId;\n  using ErasableBiTable<StateId, StateTuple, H>::FindEntry;\n  using ErasableBiTable<StateId, StateTuple, H>::Size;\n  using ErasableBiTable<StateId, StateTuple, H>::Erase;\n\n  ErasableStateTable() : ErasableBiTable<StateId, StateTuple, H>() {}\n\n  StateId FindState(const StateTuple &tuple) { return FindId(tuple); }\n\n  const StateTuple &Tuple(StateId s) const { return FindEntry(s); }\n};\n\n// The composition state table has the form:\n//\n// template <class Arc, class FilterState>\n// class ComposeStateTable {\n//  public:\n//   using StateId = typename Arc::StateId;\n//\n//   // Required constructors.\n//\n//   ComposeStateTable(const Fst<Arc> &fst1, const Fst<Arc> &fst2);\n//   ComposeStateTable(const ComposeStateTable<Arc, FilterState> &table);\n//\n//   // Looks up a state ID by tuple, adding it if doesn't exist.\n//   StateId FindState(const StateTuple &tuple);\n//\n//   // Looks up a tuple by state ID.\n//   const ComposeStateTuple<StateId> &Tuple(StateId s) const;\n//\n//   // The number of of stored tuples.\n//   StateId Size() const;\n//\n//   // Return true if error was encountered.\n//   bool Error() const;\n// };\n//\n// The following interface is used to represent the composition state.\n//\n// template <class S, class FS>\n// class CompositionStateTuple {\n//  public:\n//   using StateId = typename StateId;\n//   using FS = FilterState;\n//\n//   // Required constructors.\n//   StateTuple();\n//   StateTuple(StateId s1, StateId s2, const FilterState &fs);\n//\n//   StateId StateId1() const;\n//   StateId StateId2() const;\n//\n//   FilterState GetFilterState() const;\n//\n//   std::pair<StateId, StateId> StatePair() const;\n//\n//   size_t Hash() const;\n//\n//   friend bool operator==(const StateTuple& x, const StateTuple &y);\n// }\n//\ntemplate <typename S, typename FS>\nclass DefaultComposeStateTuple {\n public:\n  using StateId = S;\n  using FilterState = FS;\n\n  DefaultComposeStateTuple()\n      : state_pair_(kNoStateId, kNoStateId), fs_(FilterState::NoState()) {}\n\n  DefaultComposeStateTuple(StateId s1, StateId s2, const FilterState &fs)\n      : state_pair_(s1, s2), fs_(fs) {}\n\n  StateId StateId1() const { return state_pair_.first; }\n\n  StateId StateId2() const { return state_pair_.second; }\n\n  FilterState GetFilterState() const { return fs_; }\n\n  const std::pair<StateId, StateId> &StatePair() const { return state_pair_; }\n\n  friend bool operator==(const DefaultComposeStateTuple &x,\n                         const DefaultComposeStateTuple &y) {\n    return (&x == &y) || (x.state_pair_ == y.state_pair_ && x.fs_ == y.fs_);\n  }\n\n  size_t Hash() const {\n    return static_cast<size_t>(StateId1()) +\n           static_cast<size_t>(StateId2()) * 7853u +\n           GetFilterState().Hash() * 7867u;\n  }\n\n private:\n  std::pair<StateId, StateId> state_pair_;\n  FilterState fs_;  // State of composition filter.\n};\n\n// Specialization for TrivialFilterState that does not explicitely store the\n// filter state since it is always the unique non-blocking state.\ntemplate <typename S>\nclass DefaultComposeStateTuple<S, TrivialFilterState> {\n public:\n  using StateId = S;\n  using FilterState = TrivialFilterState;\n\n  DefaultComposeStateTuple()\n      : state_pair_(kNoStateId, kNoStateId) {}\n\n  DefaultComposeStateTuple(StateId s1, StateId s2, const FilterState &)\n      : state_pair_(s1, s2) {}\n\n  StateId StateId1() const { return state_pair_.first; }\n\n  StateId StateId2() const { return state_pair_.second; }\n\n  FilterState GetFilterState() const { return FilterState(true); }\n\n  const std::pair<StateId, StateId> &StatePair() const { return state_pair_; }\n\n  friend bool operator==(const DefaultComposeStateTuple &x,\n                         const DefaultComposeStateTuple &y) {\n    return (&x == &y) || (x.state_pair_ == y.state_pair_);\n  }\n\n  size_t Hash() const { return StateId1() + StateId2() * 7853; }\n\n private:\n  std::pair<StateId, StateId> state_pair_;\n};\n\n// Hashing of composition state tuples.\ntemplate <typename T>\nclass ComposeHash {\n public:\n  size_t operator()(const T &t) const { return t.Hash(); }\n};\n\n// A HashStateTable over composition tuples.\ntemplate <typename Arc, typename FilterState,\n          typename StateTuple =\n              DefaultComposeStateTuple<typename Arc::StateId, FilterState>,\n          typename StateTable =\n              CompactHashStateTable<StateTuple, ComposeHash<StateTuple>>>\nclass GenericComposeStateTable : public StateTable {\n public:\n  using StateId = typename Arc::StateId;\n\n  GenericComposeStateTable(const Fst<Arc> &fst1, const Fst<Arc> &fst2) {}\n\n  GenericComposeStateTable(const Fst<Arc> &fst1, const Fst<Arc> &fst2,\n                           size_t table_size)\n      : StateTable(table_size) {}\n\n  constexpr bool Error() const { return false; }\n\n private:\n  GenericComposeStateTable &operator=(const GenericComposeStateTable &table) =\n      delete;\n};\n\n//  Fingerprint for general composition tuples.\ntemplate <typename StateTuple>\nclass ComposeFingerprint {\n public:\n  using StateId = typename StateTuple::StateId;\n\n  // Required but suboptimal constructor.\n  ComposeFingerprint() : mult1_(8192), mult2_(8192) {\n    LOG(WARNING) << \"TupleFingerprint: # of FST states should be provided.\";\n  }\n\n  // Constructor is provided the sizes of the input FSTs.\n  ComposeFingerprint(StateId nstates1, StateId nstates2)\n      : mult1_(nstates1), mult2_(nstates1 * nstates2) {}\n\n  size_t operator()(const StateTuple &tuple) {\n    return tuple.StateId1() + tuple.StateId2() * mult1_ +\n           tuple.GetFilterState().Hash() * mult2_;\n  }\n\n private:\n  const ssize_t mult1_;\n  const ssize_t mult2_;\n};\n\n// Useful when the first composition state determines the tuple.\ntemplate <typename StateTuple>\nclass ComposeState1Fingerprint {\n public:\n  size_t operator()(const StateTuple &tuple) { return tuple.StateId1(); }\n};\n\n// Useful when the second composition state determines the tuple.\ntemplate <typename StateTuple>\nclass ComposeState2Fingerprint {\n public:\n  size_t operator()(const StateTuple &tuple) { return tuple.StateId2(); }\n};\n\n// A VectorStateTable over composition tuples. This can be used when the\n// product of number of states in FST1 and FST2 (and the composition filter\n// state hash) is manageable. If the FSTs are not expanded FSTs, they will\n// first have their states counted.\ntemplate <typename Arc, typename StateTuple>\nclass ProductComposeStateTable\n    : public VectorStateTable<StateTuple, ComposeFingerprint<StateTuple>> {\n public:\n  using StateId = typename Arc::StateId;\n  using StateTable =\n      VectorStateTable<StateTuple, ComposeFingerprint<StateTuple>>;\n\n  ProductComposeStateTable(const Fst<Arc> &fst1, const Fst<Arc> &fst2,\n                           size_t table_size = 0)\n      : StateTable(new ComposeFingerprint<StateTuple>(CountStates(fst1),\n                                                      CountStates(fst2)),\n                   table_size) {}\n\n  ProductComposeStateTable(\n      const ProductComposeStateTable<Arc, StateTuple> &table)\n      : StateTable(new ComposeFingerprint<StateTuple>(table.Fingerprint())) {}\n\n  constexpr bool Error() const { return false; }\n\n private:\n  ProductComposeStateTable &operator=(const ProductComposeStateTable &table) =\n      delete;\n};\n\n// A vector-backed table over composition tuples which can be used when the\n// first FST is a string (i.e., satisfies kString property) and the second is\n// deterministic and epsilon-free. It should be used with a composition filter\n// that creates at most one filter state per tuple under these conditions (e.g.,\n// SequenceComposeFilter or MatchComposeFilter).\ntemplate <typename Arc, typename StateTuple>\nclass StringDetComposeStateTable\n    : public VectorStateTable<StateTuple,\n                              ComposeState1Fingerprint<StateTuple>> {\n public:\n  using StateId = typename Arc::StateId;\n  using StateTable =\n      VectorStateTable<StateTuple, ComposeState1Fingerprint<StateTuple>>;\n\n  StringDetComposeStateTable(const Fst<Arc> &fst1, const Fst<Arc> &fst2)\n      : error_(false) {\n    static constexpr auto props2 = kIDeterministic | kNoIEpsilons;\n    if (fst1.Properties(kString, true) != kString) {\n      FSTERROR() << \"StringDetComposeStateTable: 1st FST is not a string\";\n      error_ = true;\n    } else if (fst2.Properties(props2, true) != props2) {\n      FSTERROR() << \"StringDetComposeStateTable: 2nd FST is not deterministic \"\n                    \"and epsilon-free\";\n      error_ = true;\n    }\n  }\n\n  StringDetComposeStateTable(\n      const StringDetComposeStateTable<Arc, StateTuple> &table)\n      : StateTable(table), error_(table.error_) {}\n\n  bool Error() const { return error_; }\n\n private:\n  bool error_;\n\n  StringDetComposeStateTable &operator=(const StringDetComposeStateTable &) =\n      delete;\n};\n\n// A vector-backed table over composition tuples which can be used when the\n// first FST is deterministic and epsilon-free and the second is a string (i.e.,\n// satisfies kString). It should be used with a composition filter that creates\n// at most one filter state per tuple under these conditions (e.g.,\n// SequenceComposeFilter or MatchComposeFilter).\ntemplate <typename Arc, typename StateTuple>\nclass DetStringComposeStateTable\n    : public VectorStateTable<StateTuple,\n                              ComposeState2Fingerprint<StateTuple>> {\n public:\n  using StateId = typename Arc::StateId;\n  using StateTable =\n      VectorStateTable<StateTuple, ComposeState2Fingerprint<StateTuple>>;\n\n  DetStringComposeStateTable(const Fst<Arc> &fst1, const Fst<Arc> &fst2)\n      : error_(false) {\n    static constexpr auto props = kODeterministic | kNoOEpsilons;\n    if (fst1.Properties(props, true) != props) {\n      FSTERROR() << \"StringDetComposeStateTable: 1st FST is not \"\n                 << \"input-deterministic and epsilon-free\";\n      error_ = true;\n    } else if (fst2.Properties(kString, true) != kString) {\n      FSTERROR() << \"DetStringComposeStateTable: 2nd FST is not a string\";\n      error_ = true;\n    }\n  }\n\n  DetStringComposeStateTable(\n      const DetStringComposeStateTable<Arc, StateTuple> &table)\n      : StateTable(table), error_(table.error_) {}\n\n  bool Error() const { return error_; }\n\n private:\n  bool error_;\n\n  DetStringComposeStateTable &operator=(const DetStringComposeStateTable &) =\n      delete;\n};\n\n// An erasable table over composition tuples. The Erase(StateId) method can be\n// called if the user either is sure that composition will never return to that\n// tuple or doesn't care that if it does, it is assigned a new state ID.\ntemplate <typename Arc, typename StateTuple>\nclass ErasableComposeStateTable\n    : public ErasableStateTable<StateTuple, ComposeHash<StateTuple>> {\n public:\n  ErasableComposeStateTable(const Fst<Arc> &fst1, const Fst<Arc> &fst2) {}\n\n  constexpr bool Error() const { return false; }\n\n private:\n  ErasableComposeStateTable &operator=(const ErasableComposeStateTable &table) =\n      delete;\n};\n\n}  // namespace fst\n\n#endif  // FST_STATE_TABLE_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/statesort.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Function to sort states of an FST.\n\n#ifndef FST_STATESORT_H_\n#define FST_STATESORT_H_\n\n#include <algorithm>\n#include <vector>\n\n#include <fst/log.h>\n\n#include <fst/mutable-fst.h>\n\n\nnamespace fst {\n\n// Sorts the input states of an FST. order[i] gives the the state ID after\n// sorting that corresponds to the state ID i before sorting; it must\n// therefore be a permutation of the input FST's states ID sequence.\ntemplate <class Arc>\nvoid StateSort(MutableFst<Arc> *fst,\n               const std::vector<typename Arc::StateId> &order) {\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n  if (order.size() != fst->NumStates()) {\n    FSTERROR() << \"StateSort: Bad order vector size: \" << order.size();\n    fst->SetProperties(kError, kError);\n    return;\n  }\n  if (fst->Start() == kNoStateId) return;\n  const auto props = fst->Properties(kStateSortProperties, false);\n  std::vector<bool> done(order.size(), false);\n  std::vector<Arc> arcsa;\n  std::vector<Arc> arcsb;\n  fst->SetStart(order[fst->Start()]);\n  for (StateIterator<MutableFst<Arc>> siter(*fst); !siter.Done();\n       siter.Next()) {\n    auto s1 = siter.Value();\n    StateId s2;\n    if (done[s1]) continue;\n    auto final1 = fst->Final(s1);\n    auto final2 = Weight::Zero();\n    arcsa.clear();\n    for (ArcIterator<MutableFst<Arc>> aiter(*fst, s1); !aiter.Done();\n         aiter.Next()) {\n      arcsa.push_back(aiter.Value());\n    }\n    for (; !done[s1]; s1 = s2, final1 = final2, std::swap(arcsa, arcsb)) {\n      s2 = order[s1];\n      if (!done[s2]) {\n        final2 = fst->Final(s2);\n        arcsb.clear();\n        for (ArcIterator<MutableFst<Arc>> aiter(*fst, s2); !aiter.Done();\n             aiter.Next()) {\n          arcsb.push_back(aiter.Value());\n        }\n      }\n      fst->SetFinal(s2, final1);\n      fst->DeleteArcs(s2);\n      for (auto arc : arcsa) {  // Copy intended.\n        arc.nextstate = order[arc.nextstate];\n        fst->AddArc(s2, arc);\n      }\n      done[s1] = true;\n    }\n  }\n  fst->SetProperties(props, kFstProperties);\n}\n\n}  // namespace fst\n\n#endif  // FST_STATESORT_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/string-weight.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// String weight set and associated semiring operation definitions.\n\n#ifndef FST_STRING_WEIGHT_H_\n#define FST_STRING_WEIGHT_H_\n\n#include <cstdlib>\n\n#include <list>\n#include <string>\n#include <vector>\n\n#include <fst/product-weight.h>\n#include <fst/union-weight.h>\n#include <fst/weight.h>\n\n\nnamespace fst {\n\nconstexpr int kStringInfinity = -1;     // Label for the infinite string.\nconstexpr int kStringBad = -2;          // Label for a non-string.\nconstexpr char kStringSeparator = '_';  // Label separator in strings.\n\n// Determines whether to use left or right string semiring.  Includes a\n// 'restricted' version that signals an error if proper prefixes/suffixes\n// would otherwise be returned by Plus, useful with various\n// algorithms that require functional transducer input with the\n// string semirings.\nenum StringType { STRING_LEFT = 0, STRING_RIGHT = 1, STRING_RESTRICT = 2 };\n\nconstexpr StringType ReverseStringType(StringType s) {\n  return s == STRING_LEFT ? STRING_RIGHT\n                          : (s == STRING_RIGHT ? STRING_LEFT : STRING_RESTRICT);\n}\n\ntemplate <class>\nclass StringWeightIterator;\ntemplate <class>\nclass StringWeightReverseIterator;\n\n// String semiring: (longest_common_prefix/suffix, ., Infinity, Epsilon)\ntemplate <typename Label_, StringType S = STRING_LEFT>\nclass StringWeight {\n public:\n  using Label = Label_;\n  using ReverseWeight = StringWeight<Label, ReverseStringType(S)>;\n  using Iterator = StringWeightIterator<StringWeight>;\n  using ReverseIterator = StringWeightReverseIterator<StringWeight>;\n\n  friend class StringWeightIterator<StringWeight>;\n  friend class StringWeightReverseIterator<StringWeight>;\n\n  StringWeight() {}\n\n  template <typename Iterator>\n  StringWeight(const Iterator &begin, const Iterator &end) {\n    for (auto iter = begin; iter != end; ++iter) PushBack(*iter);\n  }\n\n  explicit StringWeight(Label label) { PushBack(label); }\n\n  static const StringWeight &Zero() {\n    static const auto *const zero = new StringWeight(Label(kStringInfinity));\n    return *zero;\n  }\n\n  static const StringWeight &One() {\n    static const auto *const one = new StringWeight();\n    return *one;\n  }\n\n  static const StringWeight &NoWeight() {\n    static const auto *const no_weight = new StringWeight(Label(kStringBad));\n    return *no_weight;\n  }\n\n  static const string &Type() {\n    static const string *const type = new string(\n        S == STRING_LEFT\n            ? \"left_string\"\n            : (S == STRING_RIGHT ? \"right_string\" : \"restricted_string\"));\n    return *type;\n  }\n\n  bool Member() const;\n\n  std::istream &Read(std::istream &strm);\n\n  std::ostream &Write(std::ostream &strm) const;\n\n  size_t Hash() const;\n\n  StringWeight Quantize(float delta = kDelta) const { return *this; }\n\n  ReverseWeight Reverse() const;\n\n  static constexpr uint64 Properties() {\n    return kIdempotent |\n           (S == STRING_LEFT ? kLeftSemiring\n                             : (S == STRING_RIGHT\n                                    ? kRightSemiring\n                                    : /* S == STRING_RESTRICT */ kLeftSemiring |\n                                          kRightSemiring));\n  }\n\n  // These operations combined with the StringWeightIterator and\n  // StringWeightReverseIterator provide the access and mutation of the string\n  // internal elements.\n\n  // Clear existing StringWeight.\n  void Clear() {\n    first_ = 0;\n    rest_.clear();\n  }\n\n  size_t Size() const { return first_ ? rest_.size() + 1 : 0; }\n\n  void PushFront(Label label) {\n    if (first_) rest_.push_front(first_);\n    first_ = label;\n  }\n\n  void PushBack(Label label) {\n    if (!first_) {\n      first_ = label;\n    } else {\n      rest_.push_back(label);\n    }\n  }\n\n private:\n  Label first_ = 0;        // First label in string (0 if empty).\n  std::list<Label> rest_;  // Remaining labels in string.\n};\n\n// Traverses string in forward direction.\ntemplate <class StringWeight_>\nclass StringWeightIterator {\n public:\n  using Weight = StringWeight_;\n  using Label = typename Weight::Label;\n\n  explicit StringWeightIterator(const Weight &w)\n      : first_(w.first_), rest_(w.rest_), init_(true), iter_(rest_.begin()) {}\n\n  bool Done() const {\n    if (init_) {\n      return first_ == 0;\n    } else {\n      return iter_ == rest_.end();\n    }\n  }\n\n  const Label &Value() const { return init_ ? first_ : *iter_; }\n\n  void Next() {\n    if (init_) {\n      init_ = false;\n    } else {\n      ++iter_;\n    }\n  }\n\n  void Reset() {\n    init_ = true;\n    iter_ = rest_.begin();\n  }\n\n private:\n  const Label &first_;\n  const decltype(Weight::rest_) &rest_;\n  bool init_;  // In the initialized state?\n  typename decltype(Weight::rest_)::const_iterator iter_;\n};\n\n// Traverses string in backward direction.\ntemplate <class StringWeight_>\nclass StringWeightReverseIterator {\n public:\n  using Weight = StringWeight_;\n  using Label = typename Weight::Label;\n\n  explicit StringWeightReverseIterator(const Weight &w)\n      : first_(w.first_),\n        rest_(w.rest_),\n        fin_(first_ == Label()),\n        iter_(rest_.rbegin()) {}\n\n  bool Done() const { return fin_; }\n\n  const Label &Value() const { return iter_ == rest_.rend() ? first_ : *iter_; }\n\n  void Next() {\n    if (iter_ == rest_.rend()) {\n      fin_ = true;\n    } else {\n      ++iter_;\n    }\n  }\n\n  void Reset() {\n    fin_ = false;\n    iter_ = rest_.rbegin();\n  }\n\n private:\n  const Label &first_;\n  const decltype(Weight::rest_) &rest_;\n  bool fin_;  // In the final state?\n  typename decltype(Weight::rest_)::const_reverse_iterator iter_;\n};\n\n// StringWeight member functions follow that require\n// StringWeightIterator or StringWeightReverseIterator.\n\ntemplate <typename Label, StringType S>\ninline std::istream &StringWeight<Label, S>::Read(std::istream &strm) {\n  Clear();\n  int32 size;\n  ReadType(strm, &size);\n  for (int32 i = 0; i < size; ++i) {\n    Label label;\n    ReadType(strm, &label);\n    PushBack(label);\n  }\n  return strm;\n}\n\ntemplate <typename Label, StringType S>\ninline std::ostream &StringWeight<Label, S>::Write(std::ostream &strm) const {\n  const int32 size = Size();\n  WriteType(strm, size);\n  for (Iterator iter(*this); !iter.Done(); iter.Next()) {\n    WriteType(strm, iter.Value());\n  }\n  return strm;\n}\n\ntemplate <typename Label, StringType S>\ninline bool StringWeight<Label, S>::Member() const {\n  Iterator iter(*this);\n  return iter.Value() != Label(kStringBad);\n}\n\ntemplate <typename Label, StringType S>\ninline typename StringWeight<Label, S>::ReverseWeight\nStringWeight<Label, S>::Reverse() const {\n  ReverseWeight rweight;\n  for (Iterator iter(*this); !iter.Done(); iter.Next()) {\n    rweight.PushFront(iter.Value());\n  }\n  return rweight;\n}\n\ntemplate <typename Label, StringType S>\ninline size_t StringWeight<Label, S>::Hash() const {\n  size_t h = 0;\n  for (Iterator iter(*this); !iter.Done(); iter.Next()) {\n    h ^= h << 1 ^ iter.Value();\n  }\n  return h;\n}\n\ntemplate <typename Label, StringType S>\ninline bool operator==(const StringWeight<Label, S> &w1,\n                       const StringWeight<Label, S> &w2) {\n  if (w1.Size() != w2.Size()) return false;\n  using Iterator = typename StringWeight<Label, S>::Iterator;\n  Iterator iter1(w1);\n  Iterator iter2(w2);\n  for (; !iter1.Done(); iter1.Next(), iter2.Next()) {\n    if (iter1.Value() != iter2.Value()) return false;\n  }\n  return true;\n}\n\ntemplate <typename Label, StringType S>\ninline bool operator!=(const StringWeight<Label, S> &w1,\n                       const StringWeight<Label, S> &w2) {\n  return !(w1 == w2);\n}\n\ntemplate <typename Label, StringType S>\ninline bool ApproxEqual(const StringWeight<Label, S> &w1,\n                        const StringWeight<Label, S> &w2,\n                        float delta = kDelta) {\n  return w1 == w2;\n}\n\ntemplate <typename Label, StringType S>\ninline std::ostream &operator<<(std::ostream &strm,\n                                const StringWeight<Label, S> &weight) {\n  typename StringWeight<Label, S>::Iterator iter(weight);\n  if (iter.Done()) {\n    return strm << \"Epsilon\";\n  } else if (iter.Value() == Label(kStringInfinity)) {\n    return strm << \"Infinity\";\n  } else if (iter.Value() == Label(kStringBad)) {\n    return strm << \"BadString\";\n  } else {\n    for (size_t i = 0; !iter.Done(); ++i, iter.Next()) {\n      if (i > 0) strm << kStringSeparator;\n      strm << iter.Value();\n    }\n  }\n  return strm;\n}\n\ntemplate <typename Label, StringType S>\ninline std::istream &operator>>(std::istream &strm,\n                                StringWeight<Label, S> &weight) {\n  string str;\n  strm >> str;\n  using Weight = StringWeight<Label, S>;\n  if (str == \"Infinity\") {\n    weight = Weight::Zero();\n  } else if (str == \"Epsilon\") {\n    weight = Weight::One();\n  } else {\n    weight.Clear();\n    char *p = nullptr;\n    for (const char *cs = str.c_str(); !p || *p != '\\0'; cs = p + 1) {\n      const Label label = strtoll(cs, &p, 10);\n      if (p == cs || (*p != 0 && *p != kStringSeparator)) {\n        strm.clear(std::ios::badbit);\n        break;\n      }\n      weight.PushBack(label);\n    }\n  }\n  return strm;\n}\n\n// Default is for the restricted string semiring. String equality is required\n// (for non-Zero() input). The restriction is used (e.g., in determinization)\n// to ensure the input is functional.\ntemplate <typename Label, StringType S>\ninline StringWeight<Label, S> Plus(const StringWeight<Label, S> &w1,\n                                   const StringWeight<Label, S> &w2) {\n  using Weight = StringWeight<Label, S>;\n  if (!w1.Member() || !w2.Member()) return Weight::NoWeight();\n  if (w1 == Weight::Zero()) return w2;\n  if (w2 == Weight::Zero()) return w1;\n  if (w1 != w2) {\n    FSTERROR() << \"StringWeight::Plus: Unequal arguments \"\n               << \"(non-functional FST?)\"\n               << \" w1 = \" << w1 << \" w2 = \" << w2;\n    return Weight::NoWeight();\n  }\n  return w1;\n}\n\n// Longest common prefix for left string semiring.\ntemplate <typename Label>\ninline StringWeight<Label, STRING_LEFT> Plus(\n    const StringWeight<Label, STRING_LEFT> &w1,\n    const StringWeight<Label, STRING_LEFT> &w2) {\n  using Weight = StringWeight<Label, STRING_LEFT>;\n  if (!w1.Member() || !w2.Member()) return Weight::NoWeight();\n  if (w1 == Weight::Zero()) return w2;\n  if (w2 == Weight::Zero()) return w1;\n  Weight sum;\n  typename Weight::Iterator iter1(w1);\n  typename Weight::Iterator iter2(w2);\n  for (; !iter1.Done() && !iter2.Done() && iter1.Value() == iter2.Value();\n       iter1.Next(), iter2.Next()) {\n    sum.PushBack(iter1.Value());\n  }\n  return sum;\n}\n\n// Longest common suffix for right string semiring.\ntemplate <typename Label>\ninline StringWeight<Label, STRING_RIGHT> Plus(\n    const StringWeight<Label, STRING_RIGHT> &w1,\n    const StringWeight<Label, STRING_RIGHT> &w2) {\n  using Weight = StringWeight<Label, STRING_RIGHT>;\n  if (!w1.Member() || !w2.Member()) return Weight::NoWeight();\n  if (w1 == Weight::Zero()) return w2;\n  if (w2 == Weight::Zero()) return w1;\n  Weight sum;\n  typename Weight::ReverseIterator iter1(w1);\n  typename Weight::ReverseIterator iter2(w2);\n  for (; !iter1.Done() && !iter2.Done() && iter1.Value() == iter2.Value();\n       iter1.Next(), iter2.Next()) {\n    sum.PushFront(iter1.Value());\n  }\n  return sum;\n}\n\ntemplate <typename Label, StringType S>\ninline StringWeight<Label, S> Times(const StringWeight<Label, S> &w1,\n                                    const StringWeight<Label, S> &w2) {\n  using Weight = StringWeight<Label, S>;\n  if (!w1.Member() || !w2.Member()) return Weight::NoWeight();\n  if (w1 == Weight::Zero() || w2 == Weight::Zero()) return Weight::Zero();\n  Weight product(w1);\n  for (typename Weight::Iterator iter(w2); !iter.Done(); iter.Next()) {\n    product.PushBack(iter.Value());\n  }\n  return product;\n}\n\n// Left division in a left string semiring.\ntemplate <typename Label, StringType S>\ninline StringWeight<Label, S> DivideLeft(const StringWeight<Label, S> &w1,\n                                         const StringWeight<Label, S> &w2) {\n  using Weight = StringWeight<Label, S>;\n  if (!w1.Member() || !w2.Member()) return Weight::NoWeight();\n  if (w2 == Weight::Zero()) {\n    return Weight(Label(kStringBad));\n  } else if (w1 == Weight::Zero()) {\n    return Weight::Zero();\n  }\n  Weight result;\n  typename Weight::Iterator iter(w1);\n  size_t i = 0;\n  for (; !iter.Done() && i < w2.Size(); iter.Next(), ++i) {\n  }\n  for (; !iter.Done(); iter.Next()) result.PushBack(iter.Value());\n  return result;\n}\n\n// Right division in a right string semiring.\ntemplate <typename Label, StringType S>\ninline StringWeight<Label, S> DivideRight(const StringWeight<Label, S> &w1,\n                                          const StringWeight<Label, S> &w2) {\n  using Weight = StringWeight<Label, S>;\n  if (!w1.Member() || !w2.Member()) return Weight::NoWeight();\n  if (w2 == Weight::Zero()) {\n    return Weight(Label(kStringBad));\n  } else if (w1 == Weight::Zero()) {\n    return Weight::Zero();\n  }\n  Weight result;\n  typename Weight::ReverseIterator iter(w1);\n  size_t i = 0;\n  for (; !iter.Done() && i < w2.Size(); iter.Next(), ++i) {\n  }\n  for (; !iter.Done(); iter.Next()) result.PushFront(iter.Value());\n  return result;\n}\n\n// Default is the restricted string semiring.\ntemplate <typename Label, StringType S>\ninline StringWeight<Label, S> Divide(const StringWeight<Label, S> &w1,\n                                     const StringWeight<Label, S> &w2,\n                                     DivideType divide_type) {\n  using Weight = StringWeight<Label, S>;\n  if (divide_type == DIVIDE_LEFT) {\n    return DivideLeft(w1, w2);\n  } else if (divide_type == DIVIDE_RIGHT) {\n    return DivideRight(w1, w2);\n  } else {\n    FSTERROR() << \"StringWeight::Divide: \"\n               << \"Only explicit left or right division is defined \"\n               << \"for the \" << Weight::Type() << \" semiring\";\n    return Weight::NoWeight();\n  }\n}\n\n// Left division in the left string semiring.\ntemplate <typename Label>\ninline StringWeight<Label, STRING_LEFT> Divide(\n    const StringWeight<Label, STRING_LEFT> &w1,\n    const StringWeight<Label, STRING_LEFT> &w2, DivideType divide_type) {\n  if (divide_type != DIVIDE_LEFT) {\n    FSTERROR() << \"StringWeight::Divide: Only left division is defined \"\n               << \"for the left string semiring\";\n    return StringWeight<Label, STRING_LEFT>::NoWeight();\n  }\n  return DivideLeft(w1, w2);\n}\n\n// Right division in the right string semiring.\ntemplate <typename Label>\ninline StringWeight<Label, STRING_RIGHT> Divide(\n    const StringWeight<Label, STRING_RIGHT> &w1,\n    const StringWeight<Label, STRING_RIGHT> &w2, DivideType divide_type) {\n  if (divide_type != DIVIDE_RIGHT) {\n    FSTERROR() << \"StringWeight::Divide: Only right division is defined \"\n               << \"for the right string semiring\";\n    return StringWeight<Label, STRING_RIGHT>::NoWeight();\n  }\n  return DivideRight(w1, w2);\n}\n\n// This function object generates StringWeights that are random integer strings\n// from {1, ... , alphabet_size)^{0, max_string_length} U { Zero }. This is\n// intended primarily for testing.\ntemplate <class Label, StringType S>\nclass WeightGenerate<StringWeight<Label, S>> {\n public:\n  using Weight = StringWeight<Label, S>;\n\n  explicit WeightGenerate(bool allow_zero = true,\n                          size_t alphabet_size = kNumRandomWeights,\n                          size_t max_string_length = kNumRandomWeights)\n      : allow_zero_(allow_zero),\n        alphabet_size_(alphabet_size),\n        max_string_length_(max_string_length) {}\n\n  Weight operator()() const {\n    size_t n = rand() % (max_string_length_ + allow_zero_);  // NOLINT\n    if (allow_zero_ && n == max_string_length_) return Weight::Zero();\n    std::vector<Label> labels;\n    labels.reserve(n);\n    for (size_t i = 0; i < n; ++i) {\n      labels.push_back(rand() % alphabet_size_ + 1);  // NOLINT\n    }\n    return Weight(labels.begin(), labels.end());\n  }\n\n private:\n  // Permits Zero() and zero divisors.\n  const bool allow_zero_;\n  // Alphabet size for random weights.\n  const size_t alphabet_size_;\n  // Number of alternative random weights.\n  const size_t max_string_length_;\n};\n\n// Determines whether to use left, right, or (general) gallic semiring. Includes\n// a restricted version that signals an error if proper string prefixes or\n// suffixes would otherwise be returned by string Plus. This is useful with\n// algorithms that require functional transducer input. Also includes min\n// version that changes the Plus to keep only the lowest W weight string.\nenum GallicType {\n  GALLIC_LEFT = 0,\n  GALLIC_RIGHT = 1,\n  GALLIC_RESTRICT = 2,\n  GALLIC_MIN = 3,\n  GALLIC = 4\n};\n\nconstexpr StringType GallicStringType(GallicType g) {\n  return g == GALLIC_LEFT\n             ? STRING_LEFT\n             : (g == GALLIC_RIGHT ? STRING_RIGHT : STRING_RESTRICT);\n}\n\nconstexpr GallicType ReverseGallicType(GallicType g) {\n  return g == GALLIC_LEFT\n             ? GALLIC_RIGHT\n             : (g == GALLIC_RIGHT\n                    ? GALLIC_LEFT\n                    : (g == GALLIC_RESTRICT\n                           ? GALLIC_RESTRICT\n                           : (g == GALLIC_MIN ? GALLIC_MIN : GALLIC)));\n}\n\n// Product of string weight and an arbitraryy weight.\ntemplate <class Label, class W, GallicType G = GALLIC_LEFT>\nstruct GallicWeight\n    : public ProductWeight<StringWeight<Label, GallicStringType(G)>, W> {\n  using ReverseWeight =\n      GallicWeight<Label, typename W::ReverseWeight, ReverseGallicType(G)>;\n  using SW = StringWeight<Label, GallicStringType(G)>;\n\n  using ProductWeight<SW, W>::Properties;\n\n  GallicWeight() {}\n\n  GallicWeight(SW w1, W w2) : ProductWeight<SW, W>(w1, w2) {}\n\n  explicit GallicWeight(const string &s, int *nread = nullptr)\n      : ProductWeight<SW, W>(s, nread) {}\n\n  explicit GallicWeight(const ProductWeight<SW, W> &w)\n      : ProductWeight<SW, W>(w) {}\n\n  static const GallicWeight &Zero() {\n    static const GallicWeight zero(ProductWeight<SW, W>::Zero());\n    return zero;\n  }\n\n  static const GallicWeight &One() {\n    static const GallicWeight one(ProductWeight<SW, W>::One());\n    return one;\n  }\n\n  static const GallicWeight &NoWeight() {\n    static const GallicWeight no_weight(ProductWeight<SW, W>::NoWeight());\n    return no_weight;\n  }\n\n  static const string &Type() {\n    static const string *const type = new string(\n        G == GALLIC_LEFT\n            ? \"left_gallic\"\n            : (G == GALLIC_RIGHT\n                   ? \"right_gallic\"\n                   : (G == GALLIC_RESTRICT\n                          ? \"restricted_gallic\"\n                          : (G == GALLIC_MIN ? \"min_gallic\" : \"gallic\"))));\n    return *type;\n  }\n\n  GallicWeight Quantize(float delta = kDelta) const {\n    return GallicWeight(ProductWeight<SW, W>::Quantize(delta));\n  }\n\n  ReverseWeight Reverse() const {\n    return ReverseWeight(ProductWeight<SW, W>::Reverse());\n  }\n};\n\n// Default plus.\ntemplate <class Label, class W, GallicType G>\ninline GallicWeight<Label, W, G> Plus(const GallicWeight<Label, W, G> &w,\n                                      const GallicWeight<Label, W, G> &v) {\n  return GallicWeight<Label, W, G>(Plus(w.Value1(), v.Value1()),\n                                   Plus(w.Value2(), v.Value2()));\n}\n\n// Min gallic plus.\ntemplate <class Label, class W>\ninline GallicWeight<Label, W, GALLIC_MIN> Plus(\n    const GallicWeight<Label, W, GALLIC_MIN> &w1,\n    const GallicWeight<Label, W, GALLIC_MIN> &w2) {\n  static const NaturalLess<W> less;\n  return less(w1.Value2(), w2.Value2()) ? w1 : w2;\n}\n\ntemplate <class Label, class W, GallicType G>\ninline GallicWeight<Label, W, G> Times(const GallicWeight<Label, W, G> &w,\n                                       const GallicWeight<Label, W, G> &v) {\n  return GallicWeight<Label, W, G>(Times(w.Value1(), v.Value1()),\n                                   Times(w.Value2(), v.Value2()));\n}\n\ntemplate <class Label, class W, GallicType G>\ninline GallicWeight<Label, W, G> Divide(const GallicWeight<Label, W, G> &w,\n                                        const GallicWeight<Label, W, G> &v,\n                                        DivideType divide_type = DIVIDE_ANY) {\n  return GallicWeight<Label, W, G>(Divide(w.Value1(), v.Value1(), divide_type),\n                                   Divide(w.Value2(), v.Value2(), divide_type));\n}\n\n// This function object generates gallic weights by calling an underlying\n// product weight generator. This is intended primarily for testing.\ntemplate <class Label, class W, GallicType G>\nclass WeightGenerate<GallicWeight<Label, W, G>>\n    : public WeightGenerate<\n          ProductWeight<StringWeight<Label, GallicStringType(G)>, W>> {\n public:\n  using Weight = GallicWeight<Label, W, G>;\n  using Generate = WeightGenerate<\n      ProductWeight<StringWeight<Label, GallicStringType(G)>, W>>;\n\n  explicit WeightGenerate(bool allow_zero = true) : generate_(allow_zero) {}\n\n  Weight operator()() const { return Weight(generate_()); }\n\n private:\n  const Generate generate_;\n};\n\n// Union weight options for (general) GALLIC type.\ntemplate <class Label, class W>\nstruct GallicUnionWeightOptions {\n  using ReverseOptions = GallicUnionWeightOptions<Label, W>;\n  using GW = GallicWeight<Label, W, GALLIC_RESTRICT>;\n  using SW = StringWeight<Label, GallicStringType(GALLIC_RESTRICT)>;\n  using SI = StringWeightIterator<SW>;\n\n  // Military order.\n  struct Compare {\n    bool operator()(const GW &w1, const GW &w2) const {\n      const SW &s1 = w1.Value1();\n      const SW &s2 = w2.Value1();\n      if (s1.Size() < s2.Size()) return true;\n      if (s1.Size() > s2.Size()) return false;\n      SI iter1(s1);\n      SI iter2(s2);\n      while (!iter1.Done()) {\n        const auto l1 = iter1.Value();\n        const auto l2 = iter2.Value();\n        if (l1 < l2) return true;\n        if (l1 > l2) return false;\n        iter1.Next();\n        iter2.Next();\n      }\n      return false;\n    }\n  };\n\n  // Adds W weights when string part equal.\n  struct Merge {\n    GW operator()(const GW &w1, const GW &w2) const {\n      return GW(w1.Value1(), Plus(w1.Value2(), w2.Value2()));\n    }\n  };\n};\n\n// Specialization for the (general) GALLIC type.\ntemplate <class Label, class W>\nstruct GallicWeight<Label, W, GALLIC>\n    : public UnionWeight<GallicWeight<Label, W, GALLIC_RESTRICT>,\n                         GallicUnionWeightOptions<Label, W>> {\n  using GW = GallicWeight<Label, W, GALLIC_RESTRICT>;\n  using SW = StringWeight<Label, GallicStringType(GALLIC_RESTRICT)>;\n  using SI = StringWeightIterator<SW>;\n  using UW = UnionWeight<GW, GallicUnionWeightOptions<Label, W>>;\n  using UI = UnionWeightIterator<GW, GallicUnionWeightOptions<Label, W>>;\n  using ReverseWeight = GallicWeight<Label, W, GALLIC>;\n\n  using UW::Properties;\n\n  GallicWeight() {}\n\n  // Copy constructor.\n  GallicWeight(const UW &weight) : UW(weight) {}  // NOLINT\n\n  // Singleton constructors: create a GALLIC weight containing a single\n  // GALLIC_RESTRICT weight. Takes as argument (1) a GALLIC_RESTRICT weight or\n  // (2) the two components of a GALLIC_RESTRICT weight.\n  explicit GallicWeight(const GW &weight) : UW(weight) {}\n\n  GallicWeight(SW w1, W w2) : UW(GW(w1, w2)) {}\n\n  explicit GallicWeight(const string &str, int *nread = nullptr)\n      : UW(str, nread) {}\n\n  static const GallicWeight<Label, W, GALLIC> &Zero() {\n    static const GallicWeight<Label, W, GALLIC> zero(UW::Zero());\n    return zero;\n  }\n\n  static const GallicWeight<Label, W, GALLIC> &One() {\n    static const GallicWeight<Label, W, GALLIC> one(UW::One());\n    return one;\n  }\n\n  static const GallicWeight<Label, W, GALLIC> &NoWeight() {\n    static const GallicWeight<Label, W, GALLIC> no_weight(UW::NoWeight());\n    return no_weight;\n  }\n\n  static const string &Type() {\n    static const string *const type = new string(\"gallic\");\n    return *type;\n  }\n\n  GallicWeight<Label, W, GALLIC> Quantize(float delta = kDelta) const {\n    return UW::Quantize(delta);\n  }\n\n  ReverseWeight Reverse() const { return UW::Reverse(); }\n};\n\n// (General) gallic plus.\ntemplate <class Label, class W>\ninline GallicWeight<Label, W, GALLIC> Plus(\n    const GallicWeight<Label, W, GALLIC> &w1,\n    const GallicWeight<Label, W, GALLIC> &w2) {\n  using GW = GallicWeight<Label, W, GALLIC_RESTRICT>;\n  using UW = UnionWeight<GW, GallicUnionWeightOptions<Label, W>>;\n  return Plus(static_cast<UW>(w1), static_cast<UW>(w2));\n}\n\n// (General) gallic times.\ntemplate <class Label, class W>\ninline GallicWeight<Label, W, GALLIC> Times(\n    const GallicWeight<Label, W, GALLIC> &w1,\n    const GallicWeight<Label, W, GALLIC> &w2) {\n  using GW = GallicWeight<Label, W, GALLIC_RESTRICT>;\n  using UW = UnionWeight<GW, GallicUnionWeightOptions<Label, W>>;\n  return Times(static_cast<UW>(w1), static_cast<UW>(w2));\n}\n\n// (General) gallic divide.\ntemplate <class Label, class W>\ninline GallicWeight<Label, W, GALLIC> Divide(\n    const GallicWeight<Label, W, GALLIC> &w1,\n    const GallicWeight<Label, W, GALLIC> &w2,\n    DivideType divide_type = DIVIDE_ANY) {\n  using GW = GallicWeight<Label, W, GALLIC_RESTRICT>;\n  using UW = UnionWeight<GW, GallicUnionWeightOptions<Label, W>>;\n  return Divide(static_cast<UW>(w1), static_cast<UW>(w2), divide_type);\n}\n\n// This function object generates gallic weights by calling an underlying\n// union weight generator. This is intended primarily for testing.\ntemplate <class Label, class W>\nclass WeightGenerate<GallicWeight<Label, W, GALLIC>>\n    : public WeightGenerate<UnionWeight<GallicWeight<Label, W, GALLIC_RESTRICT>,\n                                        GallicUnionWeightOptions<Label, W>>> {\n public:\n  using Weight = GallicWeight<Label, W, GALLIC>;\n  using Generate =\n      WeightGenerate<UnionWeight<GallicWeight<Label, W, GALLIC_RESTRICT>,\n                                 GallicUnionWeightOptions<Label, W>>>;\n\n  explicit WeightGenerate(bool allow_zero = true) : generate_(allow_zero) {}\n\n  Weight operator()() const { return Weight(generate_()); }\n\n private:\n  const Generate generate_;\n};\n\n}  // namespace fst\n\n#endif  // FST_STRING_WEIGHT_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/string.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Utilities to convert strings into FSTs.\n\n#ifndef FST_STRING_H_\n#define FST_STRING_H_\n\n#include <memory>\n#include <sstream>\n#include <string>\n#include <vector>\n\n#include <fst/flags.h>\n#include <fst/log.h>\n\n#include <fst/compact-fst.h>\n#include <fst/icu.h>\n#include <fst/mutable-fst.h>\n#include <fst/util.h>\n\n\nDECLARE_string(fst_field_separator);\n\nnamespace fst {\n\nenum StringTokenType { SYMBOL = 1, BYTE = 2, UTF8 = 3 };\n\nnamespace internal {\n\ntemplate <class Label>\nbool ConvertSymbolToLabel(const char *str, const SymbolTable *syms,\n                          Label unknown_label, bool allow_negative,\n                          Label *output) {\n  int64 n;\n  if (syms) {\n    n = syms->Find(str);\n    if ((n == -1) && (unknown_label != kNoLabel)) n = unknown_label;\n    if (n == -1 || (!allow_negative && n < 0)) {\n      VLOG(1) << \"ConvertSymbolToLabel: Symbol \\\"\" << str\n              << \"\\\" is not mapped to any integer label, symbol table = \"\n              << syms->Name();\n      return false;\n    }\n  } else {\n    char *p;\n    n = strtoll(str, &p, 10);\n    if (p < str + strlen(str) || (!allow_negative && n < 0)) {\n      VLOG(1) << \"ConvertSymbolToLabel: Bad label integer \"\n              << \"= \\\"\" << str << \"\\\"\";\n      return false;\n    }\n  }\n  *output = n;\n  return true;\n}\n\ntemplate <class Label>\nbool ConvertStringToLabels(const string &str, StringTokenType token_type,\n                           const SymbolTable *syms, Label unknown_label,\n                           bool allow_negative, std::vector<Label> *labels) {\n  labels->clear();\n  if (token_type == StringTokenType::BYTE) {\n    for (const char c : str) labels->push_back(c);\n  } else if (token_type == StringTokenType::UTF8) {\n    return UTF8StringToLabels(str, labels);\n  } else {\n    std::unique_ptr<char[]> c_str(new char[str.size() + 1]);\n    str.copy(c_str.get(), str.size());\n    c_str[str.size()] = 0;\n    std::vector<char *> vec;\n    const string separator = \"\\n\" + FLAGS_fst_field_separator;\n    SplitString(c_str.get(), separator.c_str(), &vec, true);\n    for (const char *c : vec) {\n      Label label;\n      if (!ConvertSymbolToLabel(c, syms, unknown_label, allow_negative,\n                                &label)) {\n        return false;\n      }\n      labels->push_back(label);\n    }\n  }\n  return true;\n}\n\n}  // namespace internal\n\n// Functor for compiling a string in an FST.\ntemplate <class Arc>\nclass StringCompiler {\n public:\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  explicit StringCompiler(StringTokenType token_type,\n                          const SymbolTable *syms = nullptr,\n                          Label unknown_label = kNoLabel,\n                          bool allow_negative = false)\n      : token_type_(token_type),\n        syms_(syms),\n        unknown_label_(unknown_label),\n        allow_negative_(allow_negative) {}\n\n  // Compiles string into an FST.\n  template <class FST>\n  bool operator()(const string &str, FST *fst) const {\n    std::vector<Label> labels;\n    if (!internal::ConvertStringToLabels(str, token_type_, syms_,\n                                         unknown_label_, allow_negative_,\n                                         &labels)) {\n      return false;\n    }\n    Compile(labels, fst);\n    return true;\n  }\n\n  template <class FST>\n  bool operator()(const string &str, FST *fst, Weight weight) const {\n    std::vector<Label> labels;\n    if (!internal::ConvertStringToLabels(str, token_type_, syms_,\n                                         unknown_label_, allow_negative_,\n                                         &labels)) {\n      return false;\n    }\n    Compile(labels, fst, std::move(weight));\n    return true;\n  }\n\n private:\n  void Compile(const std::vector<Label> &labels, MutableFst<Arc> *fst,\n               Weight weight = Weight::One()) const {\n    fst->DeleteStates();\n    while (fst->NumStates() <= labels.size()) fst->AddState();\n    for (StateId i = 0; i < labels.size(); ++i) {\n      fst->AddArc(i, Arc(labels[i], labels[i], Weight::One(), i + 1));\n    }\n    fst->SetStart(0);\n    fst->SetFinal(labels.size(), std::move(weight));\n  }\n\n  template <class Unsigned>\n  void Compile(const std::vector<Label> &labels,\n               CompactStringFst<Arc, Unsigned> *fst) const {\n    fst->SetCompactElements(labels.begin(), labels.end());\n  }\n\n  template <class Unsigned>\n  void Compile(const std::vector<Label> &labels,\n               CompactWeightedStringFst<Arc, Unsigned> *fst,\n               const Weight &weight = Weight::One()) const {\n    std::vector<std::pair<Label, Weight>> compacts;\n    compacts.reserve(labels.size() + 1);\n    for (StateId i = 0; i < static_cast<StateId>(labels.size()) - 1; ++i) {\n      compacts.emplace_back(labels[i], Weight::One());\n    }\n    compacts.emplace_back(!labels.empty() ? labels.back() : kNoLabel, weight);\n    fst->SetCompactElements(compacts.begin(), compacts.end());\n  }\n\n  const StringTokenType token_type_;\n  const SymbolTable *syms_;    // Symbol table (used when token type is symbol).\n  const Label unknown_label_;  // Label for token missing from symbol table.\n  const bool allow_negative_;  // Negative labels allowed?\n\n  StringCompiler(const StringCompiler &) = delete;\n  StringCompiler &operator=(const StringCompiler &) = delete;\n};\n\n// Functor for printing a string FST as a string.\ntemplate <class Arc>\nclass StringPrinter {\n public:\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  explicit StringPrinter(StringTokenType token_type,\n                         const SymbolTable *syms = nullptr)\n      : token_type_(token_type), syms_(syms) {}\n\n  // Converts the FST into a string.\n  bool operator()(const Fst<Arc> &fst, string *result) {\n    if (!FstToLabels(fst)) {\n      VLOG(1) << \"StringPrinter::operator(): FST is not a string\";\n      return false;\n    }\n    result->clear();\n    if (token_type_ == StringTokenType::SYMBOL) {\n      std::stringstream sstrm;\n      for (size_t i = 0; i < labels_.size(); ++i) {\n        if (i) sstrm << *(FLAGS_fst_field_separator.rbegin());\n        if (!PrintLabel(labels_[i], sstrm)) return false;\n      }\n      *result = sstrm.str();\n    } else if (token_type_ == StringTokenType::BYTE) {\n      result->reserve(labels_.size());\n      for (size_t i = 0; i < labels_.size(); ++i) result->push_back(labels_[i]);\n    } else if (token_type_ == StringTokenType::UTF8) {\n      return LabelsToUTF8String(labels_, result);\n    } else {\n      VLOG(1) << \"StringPrinter::operator(): Unknown token type: \"\n              << token_type_;\n      return false;\n    }\n    return true;\n  }\n\n private:\n  bool FstToLabels(const Fst<Arc> &fst) {\n    labels_.clear();\n    auto s = fst.Start();\n    if (s == kNoStateId) {\n      VLOG(2) << \"StringPrinter::FstToLabels: Invalid starting state for \"\n              << \"string FST\";\n      return false;\n    }\n    while (fst.Final(s) == Weight::Zero()) {\n      ArcIterator<Fst<Arc>> aiter(fst, s);\n      if (aiter.Done()) {\n        VLOG(2) << \"StringPrinter::FstToLabels: String FST traversal does \"\n                << \"not reach final state\";\n        return false;\n      }\n      const auto &arc = aiter.Value();\n      labels_.push_back(arc.olabel);\n      s = arc.nextstate;\n      if (s == kNoStateId) {\n        VLOG(2) << \"StringPrinter::FstToLabels: Transition to invalid state\";\n        return false;\n      }\n      aiter.Next();\n      if (!aiter.Done()) {\n        VLOG(2) << \"StringPrinter::FstToLabels: State with multiple \"\n                << \"outgoing arcs found\";\n        return false;\n      }\n    }\n    return true;\n  }\n\n  bool PrintLabel(Label label, std::ostream &ostrm) {\n    if (syms_) {\n      const auto symbol = syms_->Find(label);\n      if (symbol == \"\") {\n        VLOG(2) << \"StringPrinter::PrintLabel: Integer \" << label << \" is not \"\n                << \"mapped to any textual symbol, symbol table = \"\n                << syms_->Name();\n        return false;\n      }\n      ostrm << symbol;\n    } else {\n      ostrm << label;\n    }\n    return true;\n  }\n\n  const StringTokenType token_type_;\n  const SymbolTable *syms_;    // Symbol table (used when token type is symbol).\n  std::vector<Label> labels_;  // Input FST labels.\n\n  StringPrinter(const StringPrinter &) = delete;\n  StringPrinter &operator=(const StringPrinter &) = delete;\n};\n\n}  // namespace fst\n\n#endif  // FST_STRING_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/symbol-table-ops.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#ifndef FST_SYMBOL_TABLE_OPS_H_\n#define FST_SYMBOL_TABLE_OPS_H_\n\n#include <string>\n#include <unordered_set>\n#include <vector>\n\n\n#include <fst/fst.h>\n#include <fst/symbol-table.h>\n\n\nnamespace fst {\n\n// Returns a minimal symbol table containing only symbols referenced by the\n// passed fst.  Symbols preserve their original numbering, so fst does not\n// require relabeling.\ntemplate <class Arc>\nSymbolTable *PruneSymbolTable(const Fst<Arc> &fst, const SymbolTable &syms,\n                              bool input) {\n  std::unordered_set<typename Arc::Label> seen;\n  seen.insert(0);  // Always keep epsilon.\n  for (StateIterator<Fst<Arc>> siter(fst); !siter.Done(); siter.Next()) {\n    for (ArcIterator<Fst<Arc>> aiter(fst, siter.Value()); !aiter.Done();\n         aiter.Next()) {\n      const auto sym = (input) ? aiter.Value().ilabel : aiter.Value().olabel;\n      seen.insert(sym);\n    }\n  }\n  auto *pruned = new SymbolTable(syms.Name() + \"_pruned\");\n  for (SymbolTableIterator stiter(syms); !stiter.Done(); stiter.Next()) {\n    const auto label = stiter.Value();\n    if (seen.count(label)) pruned->AddSymbol(stiter.Symbol(), label);\n  }\n  return pruned;\n}\n\n// Relabels a symbol table to make it a contiguous mapping.\nSymbolTable *CompactSymbolTable(const SymbolTable &syms);\n\n// Merges two SymbolTables, all symbols from left will be merged into right\n// with the same ids.  Symbols in right that have conflicting ids with those\n// in left will be assigned to value assigned from the left SymbolTable.\n// The returned symbol table will never modify symbol assignments from the left\n// side, but may do so on the right.  If right_relabel_output is non-NULL, it\n// will be assigned true if the symbols from the right table needed to be\n// reassigned.\n// A potential use case is to Compose two Fst's that have different symbol\n// tables.  You can reconcile them in the following way:\n//   Fst<Arc> a, b;\n//   bool relabel;\n//   std::unique_ptr<SymbolTable> bnew(MergeSymbolTable(a.OutputSymbols(),\n//                                     b.InputSymbols(), &relabel);\n//   if (relabel) {\n//     Relabel(b, bnew.get(), nullptr);\n//   }\n//   b.SetInputSymbols(bnew);\nSymbolTable *MergeSymbolTable(const SymbolTable &left, const SymbolTable &right,\n                              bool *right_relabel_output = nullptr);\n\n// Read the symbol table from any Fst::Read()able file, without loading the\n// corresponding Fst.  Returns nullptr if the Fst does not contain a symbol\n// table or the symbol table cannot be read.\nSymbolTable *FstReadSymbols(const string &filename, bool input);\n\n// Adds a contiguous range of symbols to a symbol table using a simple prefix\n// for the string, returning false if the inserted symbol string clashes with\n// any currently present.\nbool AddAuxiliarySymbols(const string &prefix, int64 start_label,\n                         int64 nlabels, SymbolTable *syms);\n\n}  // namespace fst\n#endif  // FST_SYMBOL_TABLE_OPS_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/symbol-table.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Classes to provide symbol-to-integer and integer-to-symbol mappings.\n\n#ifndef FST_SYMBOL_TABLE_H_\n#define FST_SYMBOL_TABLE_H_\n\n#include <cstring>\n#include <functional>\n#include <ios>\n#include <iostream>\n#include <memory>\n#include <sstream>\n#include <string>\n#include <utility>\n#include <vector>\n\n#include <fst/compat.h>\n#include <fst/flags.h>\n#include <fst/log.h>\n#include <fstream>\n#include <map>\n\nDECLARE_bool(fst_compat_symbols);\n\nnamespace fst {\n\nconstexpr int64 kNoSymbol = -1;\n\n// WARNING: Reading via symbol table read options should\n//          not be used. This is a temporary work around for\n//          reading symbol ranges of previously stored symbol sets.\nstruct SymbolTableReadOptions {\n  SymbolTableReadOptions() {}\n\n  SymbolTableReadOptions(\n      std::vector<std::pair<int64, int64>> string_hash_ranges,\n      const string &source)\n      : string_hash_ranges(std::move(string_hash_ranges)), source(source) {}\n\n  std::vector<std::pair<int64, int64>> string_hash_ranges;\n  string source;\n};\n\nstruct SymbolTableTextOptions {\n  explicit SymbolTableTextOptions(bool allow_negative_labels = false);\n\n  bool allow_negative_labels;\n  string fst_field_separator;\n};\n\nnamespace internal {\n\n// List of symbols with a dense hash for looking up symbol index.\n// Hash uses linear probe, rehashes at 0.75% occupancy, avg 6 bytes overhead\n// per entry.  Rehash in place from symbol list.\n//\n// Symbols are stored as c strings to avoid adding memory overhead, but the\n// performance penalty for this is high because rehash must call strlen on\n// every symbol.  AddSymbol can be another 2x faster if symbol lengths were\n// stored.\nclass DenseSymbolMap {\n public:\n  DenseSymbolMap();\n\n  DenseSymbolMap(const DenseSymbolMap &x);\n\n  ~DenseSymbolMap();\n\n  std::pair<int64, bool> InsertOrFind(const string &key);\n\n  int64 Find(const string &key) const;\n\n  const size_t size() const { return symbols_.size(); }\n\n  const string GetSymbol(size_t idx) const {\n    return string(symbols_[idx], strlen(symbols_[idx]));\n  }\n\n  void RemoveSymbol(size_t idx);\n\n private:\n  // num_buckets must be power of 2.\n  void Rehash(size_t num_buckets);\n\n  const char* NewSymbol(const string &sym);\n\n  int64 empty_;\n  std::vector<const char *> symbols_;\n  std::hash<string> str_hash_;\n  std::vector<int64> buckets_;\n  uint64 hash_mask_;\n};\n\nclass SymbolTableImpl {\n public:\n  explicit SymbolTableImpl(const string &name)\n      : name_(name),\n        available_key_(0),\n        dense_key_limit_(0),\n        check_sum_finalized_(false) {}\n\n  SymbolTableImpl(const SymbolTableImpl &impl)\n      : name_(impl.name_),\n        available_key_(impl.available_key_),\n        dense_key_limit_(impl.dense_key_limit_),\n        symbols_(impl.symbols_),\n        idx_key_(impl.idx_key_),\n        key_map_(impl.key_map_),\n        check_sum_finalized_(false) {}\n\n  int64 AddSymbol(const string &symbol, int64 key);\n\n  int64 AddSymbol(const string &symbol) {\n    return AddSymbol(symbol, available_key_);\n  }\n\n  // Removes the symbol with the given key. The removal is costly\n  // (O(NumSymbols)) and may reduce the efficiency of Find() because of a\n  // potentially reduced size of the dense key interval.\n  void RemoveSymbol(int64 key);\n\n  static SymbolTableImpl *ReadText(\n      std::istream &strm, const string &name,\n      const SymbolTableTextOptions &opts = SymbolTableTextOptions());\n\n  static SymbolTableImpl* Read(std::istream &strm,\n                               const SymbolTableReadOptions &opts);\n\n  bool Write(std::ostream &strm) const;\n\n  // Return the string associated with the key. If the key is out of\n  // range (<0, >max), return an empty string.\n  string Find(int64 key) const {\n    int64 idx = key;\n    if (key < 0 || key >= dense_key_limit_) {\n      const auto it = key_map_.find(key);\n      if (it == key_map_.end()) return \"\";\n      idx = it->second;\n    }\n    if (idx < 0 || idx >= symbols_.size()) return \"\";\n    return symbols_.GetSymbol(idx);\n  }\n\n  // Returns the key associated with the symbol; if the symbol\n  // does not exists, returns kNoSymbol.\n  int64 Find(const string &symbol) const {\n    int64 idx = symbols_.Find(symbol);\n    if (idx == kNoSymbol || idx < dense_key_limit_) return idx;\n    return idx_key_[idx - dense_key_limit_];\n  }\n\n  bool Member(int64 key) const { return !Find(key).empty(); }\n\n  bool Member(const string &symbol) const { return Find(symbol) != kNoSymbol; }\n\n  int64 GetNthKey(ssize_t pos) const {\n    if (pos < 0 || pos >= symbols_.size()) return kNoSymbol;\n    if (pos < dense_key_limit_) return pos;\n    return Find(symbols_.GetSymbol(pos));\n  }\n\n  const string &Name() const { return name_; }\n\n  void SetName(const string &new_name) { name_ = new_name; }\n\n  const string &CheckSum() const {\n    MaybeRecomputeCheckSum();\n    return check_sum_string_;\n  }\n\n  const string &LabeledCheckSum() const {\n    MaybeRecomputeCheckSum();\n    return labeled_check_sum_string_;\n  }\n\n  int64 AvailableKey() const { return available_key_; }\n\n  size_t NumSymbols() const { return symbols_.size(); }\n\n private:\n  // Recomputes the checksums (both of them) if we've had changes since the last\n  // computation (i.e., if check_sum_finalized_ is false).\n  // Takes ~2.5 microseconds (dbg) or ~230 nanoseconds (opt) on a 2.67GHz Xeon\n  // if the checksum is up-to-date (requiring no recomputation).\n  void MaybeRecomputeCheckSum() const;\n\n  string name_;\n  int64 available_key_;\n  int64 dense_key_limit_;\n\n  DenseSymbolMap symbols_;\n  // Maps index to key for index >= dense_key_limit:\n  //   key = idx_key_[index - dense_key_limit]\n  std::vector<int64> idx_key_;\n  // Maps key to index for key >= dense_key_limit_.\n  //  index = key_map_[key]\n  std::map<int64, int64> key_map_;\n\n  mutable bool check_sum_finalized_;\n  mutable string check_sum_string_;\n  mutable string labeled_check_sum_string_;\n  mutable Mutex check_sum_mutex_;\n};\n\n}  // namespace internal\n\n// Symbol (string) to integer (and reverse) mapping.\n//\n// The SymbolTable implements the mappings of labels to strings and reverse.\n// SymbolTables are used to describe the alphabet of the input and output\n// labels for arcs in a Finite State Transducer.\n//\n// SymbolTables are reference-counted and can therefore be shared across\n// multiple machines. For example a language model grammar G, with a\n// SymbolTable for the words in the language model can share this symbol\n// table with the lexical representation L o G.\nclass SymbolTable {\n public:\n  // Constructs symbol table with an optional name.\n  explicit SymbolTable(const string &name = \"<unspecified>\")\n      : impl_(std::make_shared<internal::SymbolTableImpl>(name)) {}\n\n  virtual ~SymbolTable() {}\n\n  // Reads a text representation of the symbol table from an istream. Pass a\n  // name to give the resulting SymbolTable.\n  static SymbolTable *ReadText(\n      std::istream &strm, const string &name,\n      const SymbolTableTextOptions &opts = SymbolTableTextOptions()) {\n    auto *impl = internal::SymbolTableImpl::ReadText(strm, name, opts);\n    return impl ? new SymbolTable(impl) : nullptr;\n  }\n\n  // Reads a text representation of the symbol table.\n  static SymbolTable *ReadText(const string &filename,\n      const SymbolTableTextOptions &opts = SymbolTableTextOptions()) {\n    std::ifstream strm(filename, std::ios_base::in);\n    if (!strm.good()) {\n      LOG(ERROR) << \"SymbolTable::ReadText: Can't open file \" << filename;\n      return nullptr;\n    }\n    return ReadText(strm, filename, opts);\n  }\n\n  // WARNING: Reading via symbol table read options should not be used. This is\n  // a temporary work-around.\n  static SymbolTable* Read(std::istream &strm,\n                           const SymbolTableReadOptions &opts) {\n    auto *impl = internal::SymbolTableImpl::Read(strm, opts);\n    return (impl) ? new SymbolTable(impl) : nullptr;\n  }\n\n  // Reads a binary dump of the symbol table from a stream.\n  static SymbolTable *Read(std::istream &strm,\n                           const string &source) {\n    SymbolTableReadOptions opts;\n    opts.source = source;\n    return Read(strm, opts);\n  }\n\n  // Reads a binary dump of the symbol table.\n  static SymbolTable *Read(const string& filename) {\n    std::ifstream strm(filename,\n                            std::ios_base::in | std::ios_base::binary);\n    if (!strm.good()) {\n      LOG(ERROR) << \"SymbolTable::Read: Can't open file \" << filename;\n      return nullptr;\n    }\n    return Read(strm, filename);\n  }\n\n  //--------------------------------------------------------\n  // Derivable Interface (final)\n  //--------------------------------------------------------\n  // Creates a reference counted copy.\n  virtual SymbolTable *Copy() const { return new SymbolTable(*this); }\n\n  // Adds a symbol with given key to table. A symbol table also keeps track of\n  // the last available key (highest key value in the symbol table).\n  virtual int64 AddSymbol(const string &symbol, int64 key) {\n    MutateCheck();\n    return impl_->AddSymbol(symbol, key);\n  }\n\n  // Adds a symbol to the table. The associated value key is automatically\n  // assigned by the symbol table.\n  virtual int64 AddSymbol(const string &symbol) {\n    MutateCheck();\n    return impl_->AddSymbol(symbol);\n  }\n\n  // Adds another symbol table to this table. All key values will be offset\n  // by the current available key (highest key value in the symbol table).\n  // Note string symbols with the same key value will still have the same\n  // key value after the symbol table has been merged, but a different\n  // value. Adding symbol tables do not result in changes in the base table.\n  virtual void AddTable(const SymbolTable &table);\n\n  virtual void RemoveSymbol(int64 key) {\n    MutateCheck();\n    return impl_->RemoveSymbol(key);\n  }\n\n  // Returns the name of the symbol table.\n  virtual const string &Name() const { return impl_->Name(); }\n\n  // Sets the name of the symbol table.\n  virtual void SetName(const string &new_name) {\n    MutateCheck();\n    impl_->SetName(new_name);\n  }\n\n  // Return the label-agnostic MD5 check-sum for this table. All new symbols\n  // added to the table will result in an updated checksum. Deprecated.\n  virtual const string &CheckSum() const { return impl_->CheckSum(); }\n\n  // Same as CheckSum(), but returns an label-dependent version.\n  virtual const string &LabeledCheckSum() const {\n    return impl_->LabeledCheckSum();\n  }\n\n  virtual bool Write(std::ostream &strm) const { return impl_->Write(strm); }\n\n  bool Write(const string &filename) const {\n    std::ofstream strm(filename,\n                             std::ios_base::out | std::ios_base::binary);\n    if (!strm.good()) {\n      LOG(ERROR) << \"SymbolTable::Write: Can't open file \" << filename;\n      return false;\n    }\n    return Write(strm);\n  }\n\n  // Dump a text representation of the symbol table via a stream.\n  virtual bool WriteText(std::ostream &strm,\n      const SymbolTableTextOptions &opts = SymbolTableTextOptions()) const;\n\n  // Dump an text representation of the symbol table.\n  bool WriteText(const string &filename) const {\n    std::ofstream strm(filename);\n    if (!strm.good()) {\n      LOG(ERROR) << \"SymbolTable::WriteText: Can't open file \" << filename;\n      return false;\n    }\n    return WriteText(strm);\n  }\n\n  // Returns the string associated with the key; if the key is out of\n  // range (<0, >max), returns an empty string.\n  virtual string Find(int64 key) const { return impl_->Find(key); }\n\n  // Returns the key associated with the symbol; if the symbol does not exist,\n  // kNoSymbol is returned.\n  virtual int64 Find(const string &symbol) const { return impl_->Find(symbol); }\n\n  // Returns the key associated with the symbol; if the symbol does not exist,\n  // kNoSymbol is returned.\n  virtual int64 Find(const char *symbol) const { return impl_->Find(symbol); }\n\n  virtual bool Member(int64 key) const { return impl_->Member(key); }\n\n  virtual bool Member(const string &symbol) const {\n    return impl_->Member(symbol);\n  }\n\n  // Returns the current available key (i.e., highest key + 1) in the symbol\n  // table.\n  virtual int64 AvailableKey() const { return impl_->AvailableKey(); }\n\n  // Returns the current number of symbols in table (not necessarily equal to\n  // AvailableKey()).\n  virtual size_t NumSymbols() const { return impl_->NumSymbols(); }\n\n  virtual int64 GetNthKey(ssize_t pos) const { return impl_->GetNthKey(pos); }\n\n private:\n  explicit SymbolTable(internal::SymbolTableImpl *impl) : impl_(impl) {}\n\n  void MutateCheck() {\n    if (!impl_.unique()) impl_.reset(new internal::SymbolTableImpl(*impl_));\n  }\n\n  const internal::SymbolTableImpl *Impl() const { return impl_.get(); }\n\n private:\n  std::shared_ptr<internal::SymbolTableImpl> impl_;\n};\n\n// Iterator class for symbols in a symbol table.\nclass SymbolTableIterator {\n public:\n  explicit SymbolTableIterator(const SymbolTable &table)\n      : table_(table),\n        pos_(0),\n        nsymbols_(table.NumSymbols()),\n        key_(table.GetNthKey(0)) {}\n\n  ~SymbolTableIterator() {}\n\n  // Returns whether iterator is done.\n  bool Done() const { return (pos_ == nsymbols_); }\n\n  // Return the key of the current symbol.\n  int64 Value() const { return key_; }\n\n  // Return the string of the current symbol.\n  string Symbol() const { return table_.Find(key_); }\n\n  // Advances iterator.\n  void Next() {\n    ++pos_;\n    if (pos_ < nsymbols_) key_ = table_.GetNthKey(pos_);\n  }\n\n  // Resets iterator.\n  void Reset() {\n    pos_ = 0;\n    key_ = table_.GetNthKey(0);\n  }\n\n private:\n  const SymbolTable &table_;\n  ssize_t pos_;\n  size_t nsymbols_;\n  int64 key_;\n};\n\n// Relabels a symbol table as specified by the input vector of pairs\n// (old label, new label). The new symbol table only retains symbols\n// for which a relabeling is explicitly specified.\n//\n// TODO(allauzen): consider adding options to allow for some form of implicit\n// identity relabeling.\ntemplate <class Label>\nSymbolTable *RelabelSymbolTable(const SymbolTable *table,\n    const std::vector<std::pair<Label, Label>> &pairs) {\n  auto new_table = new SymbolTable(table->Name().empty() ?\n      string() : (string(\"relabeled_\") + table->Name()));\n  for (const auto &pair : pairs) {\n    new_table->AddSymbol(table->Find(pair.first), pair.second);\n  }\n  return new_table;\n}\n\n// Returns true if the two symbol tables have equal checksums. Passing in\n// nullptr for either table always returns true.\nbool CompatSymbols(const SymbolTable *syms1, const SymbolTable *syms2,\n                   bool warning = true);\n\n// Symbol Table serialization.\n\nvoid SymbolTableToString(const SymbolTable *table, string *result);\n\nSymbolTable *StringToSymbolTable(const string &str);\n\n}  // namespace fst\n\n#endif  // FST_SYMBOL_TABLE_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/synchronize.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Synchronize an FST with bounded delay.\n\n#ifndef FST_SYNCHRONIZE_H_\n#define FST_SYNCHRONIZE_H_\n\n#include <algorithm>\n#include <string>\n#include <unordered_map>\n#include <unordered_set>\n#include <utility>\n#include <vector>\n\n#include <fst/cache.h>\n#include <fst/test-properties.h>\n\n\nnamespace fst {\n\nusing SynchronizeFstOptions = CacheOptions;\n\nnamespace internal {\n\n// Implementation class for SynchronizeFst.\n// TODO(kbg,sorenj): Refactor to guarantee thread-safety.\n\ntemplate <class Arc>\nclass SynchronizeFstImpl : public CacheImpl<Arc> {\n public:\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using FstImpl<Arc>::SetType;\n  using FstImpl<Arc>::SetProperties;\n  using FstImpl<Arc>::SetInputSymbols;\n  using FstImpl<Arc>::SetOutputSymbols;\n\n  using CacheBaseImpl<CacheState<Arc>>::PushArc;\n  using CacheBaseImpl<CacheState<Arc>>::HasArcs;\n  using CacheBaseImpl<CacheState<Arc>>::HasFinal;\n  using CacheBaseImpl<CacheState<Arc>>::HasStart;\n  using CacheBaseImpl<CacheState<Arc>>::SetArcs;\n  using CacheBaseImpl<CacheState<Arc>>::SetFinal;\n  using CacheBaseImpl<CacheState<Arc>>::SetStart;\n\n  using String = basic_string<Label>;\n\n  struct Element {\n    Element() {}\n\n    Element(StateId state_, const String *i, const String *o)\n        : state(state_), istring(i), ostring(o) {}\n\n    StateId state;          // Input state ID.\n    const String *istring;  // Residual input labels.\n    const String *ostring;  // Residual output labels.\n    // Residual strings are represented by const pointers to\n    // basic_string<Label> and are stored in a hash_set. The pointed\n    // memory is owned by the hash_set string_set_.\n  };\n\n  SynchronizeFstImpl(const Fst<Arc> &fst, const SynchronizeFstOptions &opts)\n      : CacheImpl<Arc>(opts), fst_(fst.Copy()) {\n    SetType(\"synchronize\");\n    const auto props = fst.Properties(kFstProperties, false);\n    SetProperties(SynchronizeProperties(props), kCopyProperties);\n    SetInputSymbols(fst.InputSymbols());\n    SetOutputSymbols(fst.OutputSymbols());\n  }\n\n  SynchronizeFstImpl(const SynchronizeFstImpl &impl)\n      : CacheImpl<Arc>(impl), fst_(impl.fst_->Copy(true)) {\n    SetType(\"synchronize\");\n    SetProperties(impl.Properties(), kCopyProperties);\n    SetInputSymbols(impl.InputSymbols());\n    SetOutputSymbols(impl.OutputSymbols());\n  }\n\n  ~SynchronizeFstImpl() override {\n    for (const auto *ptr : string_set_) delete ptr;\n  }\n\n  StateId Start() {\n    if (!HasStart()) {\n      auto start = fst_->Start();\n      if (start == kNoStateId) return kNoStateId;\n      const auto *empty = FindString(new String());\n      start = FindState(Element(fst_->Start(), empty, empty));\n      SetStart(start);\n    }\n    return CacheImpl<Arc>::Start();\n  }\n\n  Weight Final(StateId s) {\n    if (!HasFinal(s)) {\n      const auto &element = elements_[s];\n      const auto weight = element.state == kNoStateId\n                              ? Weight::One()\n                              : fst_->Final(element.state);\n      if ((weight != Weight::Zero()) && (element.istring)->empty() &&\n          (element.ostring)->empty()) {\n        SetFinal(s, weight);\n      } else {\n        SetFinal(s, Weight::Zero());\n      }\n    }\n    return CacheImpl<Arc>::Final(s);\n  }\n\n  size_t NumArcs(StateId s) {\n    if (!HasArcs(s)) Expand(s);\n    return CacheImpl<Arc>::NumArcs(s);\n  }\n\n  size_t NumInputEpsilons(StateId s) {\n    if (!HasArcs(s)) Expand(s);\n    return CacheImpl<Arc>::NumInputEpsilons(s);\n  }\n\n  size_t NumOutputEpsilons(StateId s) {\n    if (!HasArcs(s)) Expand(s);\n    return CacheImpl<Arc>::NumOutputEpsilons(s);\n  }\n\n  uint64 Properties() const override { return Properties(kFstProperties); }\n\n  // Sets error if found, returning other FST impl properties.\n  uint64 Properties(uint64 mask) const override {\n    if ((mask & kError) && fst_->Properties(kError, false)) {\n      SetProperties(kError, kError);\n    }\n    return FstImpl<Arc>::Properties(mask);\n  }\n\n  void InitArcIterator(StateId s, ArcIteratorData<Arc> *data) {\n    if (!HasArcs(s)) Expand(s);\n    CacheImpl<Arc>::InitArcIterator(s, data);\n  }\n\n  // Returns the first character of the string obtained by concatenating the\n  // string and the label.\n  Label Car(const String *str, Label label = 0) const {\n    if (!str->empty()) {\n      return (*str)[0];\n    } else {\n      return label;\n    }\n  }\n\n  // Computes the residual string obtained by removing the first\n  // character in the concatenation of the string and the label.\n  const String *Cdr(const String *str, Label label = 0) {\n    auto *r = new String();\n    for (size_t i = 1; i < str->size(); ++i) r->push_back((*str)[i]);\n    if (label && !(str->empty())) r->push_back(label);\n    return FindString(r);\n  }\n\n  // Computes the concatenation of the string and the label.\n  const String *Concat(const String *str, Label label = 0) {\n    auto *r = new String();\n    for (size_t i = 0; i < str->size(); ++i) r->push_back((*str)[i]);\n    if (label) r->push_back(label);\n    return FindString(r);\n  }\n\n  // Tests if the concatenation of the string and label is empty.\n  bool Empty(const String *str, Label label = 0) const {\n    if (str->empty()) {\n      return label == 0;\n    } else {\n      return false;\n    }\n  }\n\n  // Finds the string pointed by s in the hash set. Transfers the pointer\n  // ownership to the hash set.\n  const String *FindString(const String *str) {\n    const auto insert_result = string_set_.insert(str);\n    if (!insert_result.second) {\n      delete str;\n    }\n    return *insert_result.first;\n  }\n\n  // Finds state corresponding to an element. Creates new state if element\n  // is not found.\n  StateId FindState(const Element &element) {\n    const auto insert_result =\n        element_map_.insert(std::make_pair(element, elements_.size()));\n    if (insert_result.second) {\n      elements_.push_back(element);\n    }\n    return insert_result.first->second;\n  }\n\n  // Computes the outgoing transitions from a state, creating new destination\n  // states as needed.\n  void Expand(StateId s) {\n    const auto element = elements_[s];\n    if (element.state != kNoStateId) {\n      for (ArcIterator<Fst<Arc>> aiter(*fst_, element.state); !aiter.Done();\n           aiter.Next()) {\n        const auto &arc = aiter.Value();\n        if (!Empty(element.istring, arc.ilabel) &&\n            !Empty(element.ostring, arc.olabel)) {\n          const auto *istring = Cdr(element.istring, arc.ilabel);\n          const auto *ostring = Cdr(element.ostring, arc.olabel);\n          PushArc(s, Arc(Car(element.istring, arc.ilabel),\n                         Car(element.ostring, arc.olabel), arc.weight,\n                         FindState(Element(arc.nextstate, istring, ostring))));\n        } else {\n          const auto *istring = Concat(element.istring, arc.ilabel);\n          const auto *ostring = Concat(element.ostring, arc.olabel);\n          PushArc(s, Arc(0, 0, arc.weight,\n                         FindState(Element(arc.nextstate, istring, ostring))));\n        }\n      }\n    }\n    const auto weight = element.state == kNoStateId\n                            ? Weight::One()\n                            : fst_->Final(element.state);\n    if ((weight != Weight::Zero()) &&\n        ((element.istring)->size() + (element.ostring)->size() > 0)) {\n      const auto *istring = Cdr(element.istring);\n      const auto *ostring = Cdr(element.ostring);\n      PushArc(s, Arc(Car(element.istring), Car(element.ostring), weight,\n                     FindState(Element(kNoStateId, istring, ostring))));\n    }\n    SetArcs(s);\n  }\n\n private:\n  // Equality function for Elements; assumes strings have been hashed.\n  class ElementEqual {\n   public:\n    bool operator()(const Element &x, const Element &y) const {\n      return x.state == y.state && x.istring == y.istring &&\n             x.ostring == y.ostring;\n    }\n  };\n\n  // Hash function for Elements to FST states.\n  class ElementKey {\n   public:\n    size_t operator()(const Element &x) const {\n      size_t key = x.state;\n      key = (key << 1) ^ (x.istring)->size();\n      for (size_t i = 0; i < (x.istring)->size(); ++i) {\n        key = (key << 1) ^ (*x.istring)[i];\n      }\n      key = (key << 1) ^ (x.ostring)->size();\n      for (size_t i = 0; i < (x.ostring)->size(); ++i) {\n        key = (key << 1) ^ (*x.ostring)[i];\n      }\n      return key;\n    }\n  };\n\n  // Equality function for strings.\n  class StringEqual {\n   public:\n    bool operator()(const String *const &x, const String *const &y) const {\n      if (x->size() != y->size()) return false;\n      for (size_t i = 0; i < x->size(); ++i) {\n        if ((*x)[i] != (*y)[i]) return false;\n      }\n      return true;\n    }\n  };\n\n  // Hash function for set of strings\n  class StringKey {\n   public:\n    size_t operator()(const String *const &x) const {\n      size_t key = x->size();\n      for (size_t i = 0; i < x->size(); ++i) key = (key << 1) ^ (*x)[i];\n      return key;\n    }\n  };\n\n  using ElementMap =\n      std::unordered_map<Element, StateId, ElementKey, ElementEqual>;\n  using StringSet = std::unordered_set<const String *, StringKey, StringEqual>;\n\n  std::unique_ptr<const Fst<Arc>> fst_;\n  std::vector<Element> elements_;  // Maps FST state to Elements.\n  ElementMap element_map_;         // Maps Elements to FST state.\n  StringSet string_set_;\n};\n\n}  // namespace internal\n\n// Synchronizes a transducer. This version is a delayed FST. The result is an\n// equivalent FST that has the property that during the traversal of a path,\n// the delay is either zero or strictly increasing, where the delay is the\n// difference between the number of non-epsilon output labels and input labels\n// along the path.\n//\n// For the algorithm to terminate, the input transducer must have bounded\n// delay, i.e., the delay of every cycle must be zero.\n//\n// Complexity:\n//\n// - A has bounded delay: exponential.\n// - A does not have bounded delay: does not terminate.\n//\n// For more information, see:\n//\n// Mohri, M. 2003. Edit-distance of weighted automata: General definitions and\n// algorithms. International Journal of Computer Science 14(6): 957-982.\n//\n// This class attaches interface to implementation and handles reference\n// counting, delegating most methods to ImplToFst.\ntemplate <class A>\nclass SynchronizeFst : public ImplToFst<internal::SynchronizeFstImpl<A>> {\n public:\n  using Arc = A;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using Store = DefaultCacheStore<Arc>;\n  using State = typename Store::State;\n  using Impl = internal::SynchronizeFstImpl<A>;\n\n  friend class ArcIterator<SynchronizeFst<A>>;\n  friend class StateIterator<SynchronizeFst<A>>;\n\n  explicit SynchronizeFst(\n      const Fst<A> &fst,\n      const SynchronizeFstOptions &opts = SynchronizeFstOptions())\n      : ImplToFst<Impl>(std::make_shared<Impl>(fst, opts)) {}\n\n  // See Fst<>::Copy() for doc.\n  SynchronizeFst(const SynchronizeFst<Arc> &fst, bool safe = false)\n      : ImplToFst<Impl>(fst, safe) {}\n\n  // Gets a copy of this SynchronizeFst. See Fst<>::Copy() for further doc.\n  SynchronizeFst<Arc> *Copy(bool safe = false) const override {\n    return new SynchronizeFst<Arc>(*this, safe);\n  }\n\n  inline void InitStateIterator(StateIteratorData<Arc> *data) const override;\n\n  void InitArcIterator(StateId s, ArcIteratorData<Arc> *data) const override {\n    GetMutableImpl()->InitArcIterator(s, data);\n  }\n\n private:\n  using ImplToFst<Impl>::GetImpl;\n  using ImplToFst<Impl>::GetMutableImpl;\n\n  SynchronizeFst &operator=(const SynchronizeFst &) = delete;\n};\n\n// Specialization for SynchronizeFst.\ntemplate <class Arc>\nclass StateIterator<SynchronizeFst<Arc>>\n    : public CacheStateIterator<SynchronizeFst<Arc>> {\n public:\n  explicit StateIterator(const SynchronizeFst<Arc> &fst)\n      : CacheStateIterator<SynchronizeFst<Arc>>(fst, fst.GetMutableImpl()) {}\n};\n\n// Specialization for SynchronizeFst.\ntemplate <class Arc>\nclass ArcIterator<SynchronizeFst<Arc>>\n    : public CacheArcIterator<SynchronizeFst<Arc>> {\n public:\n  using StateId = typename Arc::StateId;\n\n  ArcIterator(const SynchronizeFst<Arc> &fst, StateId s)\n      : CacheArcIterator<SynchronizeFst<Arc>>(fst.GetMutableImpl(), s) {\n    if (!fst.GetImpl()->HasArcs(s)) fst.GetMutableImpl()->Expand(s);\n  }\n};\n\ntemplate <class Arc>\ninline void SynchronizeFst<Arc>::InitStateIterator(\n    StateIteratorData<Arc> *data) const {\n  data->base = new StateIterator<SynchronizeFst<Arc>>(*this);\n}\n\n// Synchronizes a transducer. This version writes the synchronized result to a\n// MutableFst. The result will be an equivalent FST that has the property that\n// during the traversal of a path, the delay is either zero or strictly\n// increasing, where the delay is the difference between the number of\n// non-epsilon output labels and input labels along the path.\n//\n// For the algorithm to terminate, the input transducer must have bounded\n// delay, i.e., the delay of every cycle must be zero.\n//\n// Complexity:\n//\n// - A has bounded delay: exponential.\n// - A does not have bounded delay: does not terminate.\n//\n// For more information, see:\n//\n// Mohri, M. 2003. Edit-distance of weighted automata: General definitions and\n// algorithms. International Journal of Computer Science 14(6): 957-982.\ntemplate <class Arc>\nvoid Synchronize(const Fst<Arc> &ifst, MutableFst<Arc> *ofst) {\n  // Caches only the last state for fastest copy.\n  const SynchronizeFstOptions opts(FLAGS_fst_default_cache_gc, 0);\n  *ofst = SynchronizeFst<Arc>(ifst, opts);\n}\n\n}  // namespace fst\n\n#endif  // FST_SYNCHRONIZE_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/test-properties.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Functions to manipulate and test property bits.\n\n#ifndef FST_TEST_PROPERTIES_H_\n#define FST_TEST_PROPERTIES_H_\n\n#include <unordered_set>\n\n#include <fst/flags.h>\n#include <fst/log.h>\n\n#include <fst/connect.h>\n#include <fst/dfs-visit.h>\n\n\nDECLARE_bool(fst_verify_properties);\n\nnamespace fst {\n// namespace internal {\n\n// For a binary property, the bit is always returned set. For a trinary (i.e.,\n// two-bit) property, both bits are returned set iff either corresponding input\n// bit is set.\ninline uint64 KnownProperties(uint64 props) {\n  return kBinaryProperties | (props & kTrinaryProperties) |\n         ((props & kPosTrinaryProperties) << 1) |\n         ((props & kNegTrinaryProperties) >> 1);\n}\n\n// Tests compatibility between two sets of properties.\ninline bool CompatProperties(uint64 props1, uint64 props2) {\n  const auto known_props1 = KnownProperties(props1);\n  const auto known_props2 = KnownProperties(props2);\n  const auto known_props = known_props1 & known_props2;\n  const auto incompat_props = (props1 & known_props) ^ (props2 & known_props);\n  if (incompat_props) {\n    uint64 prop = 1;\n    for (int i = 0; i < 64; ++i, prop <<= 1) {\n      if (prop & incompat_props) {\n        LOG(ERROR) << \"CompatProperties: Mismatch: \" << PropertyNames[i]\n                   << \": props1 = \" << (props1 & prop ? \"true\" : \"false\")\n                   << \", props2 = \" << (props2 & prop ? \"true\" : \"false\");\n      }\n    }\n    return false;\n  } else {\n    return true;\n  }\n}\n\n// Computes FST property values defined in properties.h. The value of each\n// property indicated in the mask will be determined and returned (these will\n// never be unknown here). In the course of determining the properties\n// specifically requested in the mask, certain other properties may be\n// determined (those with little additional expense) and their values will be\n// returned as well. The complete set of known properties (whether true or\n// false) determined by this operation will be assigned to the the value pointed\n// to by KNOWN. If 'use_stored' is true, pre-computed FST properties may be used\n// when possible. 'mask & required_mask' is used to determine whether the stored\n// propertoes can be used. This routine is seldom called directly; instead it is\n// used to implement fst.Properties(mask, true).\ntemplate <class Arc>\nuint64 ComputeProperties(const Fst<Arc> &fst, uint64 mask, uint64 *known,\n                         bool use_stored) {\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n  const auto fst_props = fst.Properties(kFstProperties, false);  // FST-stored.\n  // Check stored FST properties first if allowed.\n  if (use_stored) {\n    const auto known_props = KnownProperties(fst_props);\n    // If FST contains required info, return it.\n    if ((known_props & mask) == mask) {\n      if (known) *known = known_props;\n      return fst_props;\n    }\n  }\n  // Computes (trinary) properties explicitly.\n  // Initialize with binary properties (already known).\n  uint64 comp_props = fst_props & kBinaryProperties;\n  // Computes these trinary properties with a DFS. We compute only those that\n  // need a DFS here, since we otherwise would like to avoid a DFS since its\n  // stack could grow large.\n  uint64 dfs_props = kCyclic | kAcyclic | kInitialCyclic | kInitialAcyclic |\n                     kAccessible | kNotAccessible | kCoAccessible |\n                     kNotCoAccessible;\n  std::vector<StateId> scc;\n  if (mask & (dfs_props | kWeightedCycles | kUnweightedCycles)) {\n    SccVisitor<Arc> scc_visitor(&scc, nullptr, nullptr, &comp_props);\n    DfsVisit(fst, &scc_visitor);\n  }\n  // Computes any remaining trinary properties via a state and arcs iterations\n  if (mask & ~(kBinaryProperties | dfs_props)) {\n    comp_props |= kAcceptor | kNoEpsilons | kNoIEpsilons | kNoOEpsilons |\n                  kILabelSorted | kOLabelSorted | kUnweighted | kTopSorted |\n                  kString;\n    if (mask & (kIDeterministic | kNonIDeterministic)) {\n      comp_props |= kIDeterministic;\n    }\n    if (mask & (kODeterministic | kNonODeterministic)) {\n      comp_props |= kODeterministic;\n    }\n    if (mask & (dfs_props | kWeightedCycles | kUnweightedCycles)) {\n      comp_props |= kUnweightedCycles;\n    }\n    std::unique_ptr<std::unordered_set<Label>> ilabels;\n    std::unique_ptr<std::unordered_set<Label>> olabels;\n    StateId nfinal = 0;\n    for (StateIterator<Fst<Arc>> siter(fst); !siter.Done(); siter.Next()) {\n      StateId s = siter.Value();\n      Arc prev_arc;\n      // Creates these only if we need to.\n      if (mask & (kIDeterministic | kNonIDeterministic)) {\n        ilabels.reset(new std::unordered_set<Label>());\n      }\n      if (mask & (kODeterministic | kNonODeterministic)) {\n        olabels.reset(new std::unordered_set<Label>());\n      }\n      bool first_arc = true;\n      for (ArcIterator<Fst<Arc>> aiter(fst, s); !aiter.Done(); aiter.Next()) {\n        const auto &arc = aiter.Value();\n        if (ilabels && ilabels->find(arc.ilabel) != ilabels->end()) {\n          comp_props |= kNonIDeterministic;\n          comp_props &= ~kIDeterministic;\n        }\n        if (olabels && olabels->find(arc.olabel) != olabels->end()) {\n          comp_props |= kNonODeterministic;\n          comp_props &= ~kODeterministic;\n        }\n        if (arc.ilabel != arc.olabel) {\n          comp_props |= kNotAcceptor;\n          comp_props &= ~kAcceptor;\n        }\n        if (arc.ilabel == 0 && arc.olabel == 0) {\n          comp_props |= kEpsilons;\n          comp_props &= ~kNoEpsilons;\n        }\n        if (arc.ilabel == 0) {\n          comp_props |= kIEpsilons;\n          comp_props &= ~kNoIEpsilons;\n        }\n        if (arc.olabel == 0) {\n          comp_props |= kOEpsilons;\n          comp_props &= ~kNoOEpsilons;\n        }\n        if (!first_arc) {\n          if (arc.ilabel < prev_arc.ilabel) {\n            comp_props |= kNotILabelSorted;\n            comp_props &= ~kILabelSorted;\n          }\n          if (arc.olabel < prev_arc.olabel) {\n            comp_props |= kNotOLabelSorted;\n            comp_props &= ~kOLabelSorted;\n          }\n        }\n        if (arc.weight != Weight::One() && arc.weight != Weight::Zero()) {\n          comp_props |= kWeighted;\n          comp_props &= ~kUnweighted;\n          if ((comp_props & kUnweightedCycles) &&\n              scc[s] == scc[arc.nextstate]) {\n            comp_props |= kWeightedCycles;\n            comp_props &= ~kUnweightedCycles;\n          }\n        }\n        if (arc.nextstate <= s) {\n          comp_props |= kNotTopSorted;\n          comp_props &= ~kTopSorted;\n        }\n        if (arc.nextstate != s + 1) {\n          comp_props |= kNotString;\n          comp_props &= ~kString;\n        }\n        prev_arc = arc;\n        first_arc = false;\n        if (ilabels) ilabels->insert(arc.ilabel);\n        if (olabels) olabels->insert(arc.olabel);\n      }\n\n      if (nfinal > 0) {  // Final state not last.\n        comp_props |= kNotString;\n        comp_props &= ~kString;\n      }\n      const auto final_weight = fst.Final(s);\n      if (final_weight != Weight::Zero()) {  // Final state.\n        if (final_weight != Weight::One()) {\n          comp_props |= kWeighted;\n          comp_props &= ~kUnweighted;\n        }\n        ++nfinal;\n      } else {  // Non-final state.\n        if (fst.NumArcs(s) != 1) {\n          comp_props |= kNotString;\n          comp_props &= ~kString;\n        }\n      }\n    }\n    if (fst.Start() != kNoStateId && fst.Start() != 0) {\n      comp_props |= kNotString;\n      comp_props &= ~kString;\n    }\n  }\n  if (known) *known = KnownProperties(comp_props);\n  return comp_props;\n}\n\n// This is a wrapper around ComputeProperties that will cause a fatal error if\n// the stored properties and the computed properties are incompatible when\n// FLAGS_fst_verify_properties is true. This routine is seldom called directly;\n// instead it is used to implement fst.Properties(mask, true).\ntemplate <class Arc>\nuint64 TestProperties(const Fst<Arc> &fst, uint64 mask, uint64 *known) {\n  if (FLAGS_fst_verify_properties) {\n    const auto stored_props = fst.Properties(kFstProperties, false);\n    const auto computed_props = ComputeProperties(fst, mask, known, false);\n    if (!CompatProperties(stored_props, computed_props)) {\n      FSTERROR() << \"TestProperties: stored FST properties incorrect\"\n                 << \" (stored: props1, computed: props2)\";\n    }\n    return computed_props;\n  } else {\n    return ComputeProperties(fst, mask, known, true);\n  }\n}\n\n// If all the properties of 'fst' corresponding to 'check_mask' are known,\n// returns the stored properties. Otherwise, the properties corresponding to\n// both 'check_mask' and 'test_mask' are computed. This is used to check for\n// newly-added properties that might not be set in old binary files.\ntemplate <class Arc>\nuint64 CheckProperties(const Fst<Arc> &fst, uint64 check_mask,\n                       uint64 test_mask) {\n  auto props = fst.Properties(kFstProperties, false);\n  if (FLAGS_fst_verify_properties) {\n    props = TestProperties(fst, check_mask | test_mask, nullptr);\n  } else if ((KnownProperties(props) & check_mask) != check_mask) {\n    props = ComputeProperties(fst, check_mask | test_mask, nullptr, false);\n  }\n  return props & (check_mask | test_mask);\n}\n\n//}  // namespace internal\n}  // namespace fst\n\n#endif  // FST_TEST_PROPERTIES_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/topsort.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Topological sort of FSTs.\n\n#ifndef FST_TOPSORT_H_\n#define FST_TOPSORT_H_\n\n#include <memory>\n#include <vector>\n\n\n#include <fst/dfs-visit.h>\n#include <fst/fst.h>\n#include <fst/statesort.h>\n\n\nnamespace fst {\n\n// DFS visitor class to return topological ordering.\ntemplate <class Arc>\nclass TopOrderVisitor {\n public:\n  using StateId = typename Arc::StateId;\n\n  // If acyclic, order[i] gives the topological position of StateId i;\n  // otherwise it is unchanged. acyclic_ will be true iff the FST has no\n  // cycles. The caller retains ownership of the state order vector.\n  TopOrderVisitor(std::vector<StateId> *order, bool *acyclic)\n      : order_(order), acyclic_(acyclic) {}\n\n  void InitVisit(const Fst<Arc> &fst) {\n    finish_.reset(new std::vector<StateId>());\n    *acyclic_ = true;\n  }\n\n  constexpr bool InitState(StateId, StateId) const { return true; }\n\n  constexpr bool TreeArc(StateId, const Arc &) const { return true; }\n\n  bool BackArc(StateId, const Arc &) { return (*acyclic_ = false); }\n\n  constexpr bool ForwardOrCrossArc(StateId, const Arc &) const { return true; }\n\n  void FinishState(StateId s, StateId, const Arc *) { finish_->push_back(s); }\n\n  void FinishVisit() {\n    if (*acyclic_) {\n      order_->clear();\n      for (StateId s = 0; s < finish_->size(); ++s) {\n        order_->push_back(kNoStateId);\n      }\n      for (StateId s = 0; s < finish_->size(); ++s) {\n        (*order_)[(*finish_)[finish_->size() - s - 1]] = s;\n      }\n    }\n    finish_.reset();\n  }\n\n private:\n  std::vector<StateId> *order_;\n  bool *acyclic_;\n  // States in finish-time order.\n  std::unique_ptr<std::vector<StateId>> finish_;\n};\n\n// Topologically sorts its input if acyclic, modifying it. Otherwise, the input\n// is unchanged. When sorted, all transitions are from lower to higher state\n// IDs.\n//\n// Complexity:\n//\n//   Time:  O(V + E)\n//   Space: O(V + E)\n//\n// where V is the number of states and E is the number of arcs.\ntemplate <class Arc>\nbool TopSort(MutableFst<Arc> *fst) {\n  std::vector<typename Arc::StateId> order;\n  bool acyclic;\n  TopOrderVisitor<Arc> top_order_visitor(&order, &acyclic);\n  DfsVisit(*fst, &top_order_visitor);\n  if (acyclic) {\n    StateSort(fst, order);\n    fst->SetProperties(kAcyclic | kInitialAcyclic | kTopSorted,\n                       kAcyclic | kInitialAcyclic | kTopSorted);\n  } else {\n    fst->SetProperties(kCyclic | kNotTopSorted, kCyclic | kNotTopSorted);\n  }\n  return acyclic;\n}\n\n}  // namespace fst\n\n#endif  // FST_TOPSORT_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/tuple-weight.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Tuple weight set operation definitions.\n\n#ifndef FST_TUPLE_WEIGHT_H_\n#define FST_TUPLE_WEIGHT_H_\n\n#include <algorithm>\n#include <array>\n#include <functional>\n#include <string>\n#include <vector>\n\n#include <fst/flags.h>\n#include <fst/log.h>\n\n#include <fst/weight.h>\n\n\nnamespace fst {\n\n// n-tuple weight, element of the n-th Cartesian power of W.\ntemplate <class W, size_t n>\nclass TupleWeight {\n public:\n  using ReverseWeight = TupleWeight<typename W::ReverseWeight, n>;\n\n  using Weight = W;\n  using Index = size_t;\n\n  TupleWeight(const TupleWeight &other) { values_ = other.values_; }\n\n  TupleWeight<W, n> &operator=(const TupleWeight<W, n> &other) {\n    values_ = other.values_;\n    return *this;\n  }\n\n  template <class Iterator>\n  TupleWeight(Iterator begin, Iterator end) {\n    std::copy(begin, end, values_.begin());\n  }\n\n  explicit TupleWeight(const W &weight = W::Zero()) { values_.fill(weight); }\n\n  // Initialize component `index` to `weight`; initialize all other components\n  // to `default_weight`\n  TupleWeight(Index index, const W &weight, const W &default_weight)\n      : TupleWeight(default_weight) {\n    values_[index] = weight;\n  }\n\n  static const TupleWeight<W, n> &Zero() {\n    static const TupleWeight<W, n> zero(W::Zero());\n    return zero;\n  }\n\n  static const TupleWeight<W, n> &One() {\n    static const TupleWeight<W, n> one(W::One());\n    return one;\n  }\n\n  static const TupleWeight<W, n> &NoWeight() {\n    static const TupleWeight<W, n> no_weight(W::NoWeight());\n    return no_weight;\n  }\n\n  constexpr static size_t Length() { return n; }\n\n  std::istream &Read(std::istream &istrm) {\n    for (size_t i = 0; i < n; ++i) values_[i].Read(istrm);\n    return istrm;\n  }\n\n  std::ostream &Write(std::ostream &ostrm) const {\n    for (size_t i = 0; i < n; ++i) values_[i].Write(ostrm);\n    return ostrm;\n  }\n\n  bool Member() const {\n    return std::all_of(values_.begin(), values_.end(),\n                       std::mem_fn(&W::Member));\n  }\n\n  size_t Hash() const {\n    uint64 hash = 0;\n    for (size_t i = 0; i < n; ++i) hash = 5 * hash + values_[i].Hash();\n    return size_t(hash);\n  }\n\n  TupleWeight<W, n> Quantize(float delta = kDelta) const {\n    TupleWeight<W, n> weight;\n    for (size_t i = 0; i < n; ++i) {\n      weight.values_[i] = values_[i].Quantize(delta);\n    }\n    return weight;\n  }\n\n  ReverseWeight Reverse() const {\n    TupleWeight<W, n> w;\n    for (size_t i = 0; i < n; ++i) w.values_[i] = values_[i].Reverse();\n    return w;\n  }\n\n  const W &Value(size_t i) const { return values_[i]; }\n\n  void SetValue(size_t i, const W &w) { values_[i] = w; }\n\n private:\n  std::array<W, n> values_;\n};\n\ntemplate <class W, size_t n>\ninline bool operator==(const TupleWeight<W, n> &w1,\n                       const TupleWeight<W, n> &w2) {\n  for (size_t i = 0; i < n; ++i) {\n    if (w1.Value(i) != w2.Value(i)) return false;\n  }\n  return true;\n}\n\ntemplate <class W, size_t n>\ninline bool operator!=(const TupleWeight<W, n> &w1,\n                       const TupleWeight<W, n> &w2) {\n  for (size_t i = 0; i < n; ++i) {\n    if (w1.Value(i) != w2.Value(i)) return true;\n  }\n  return false;\n}\n\ntemplate <class W, size_t n>\ninline bool ApproxEqual(const TupleWeight<W, n> &w1,\n                        const TupleWeight<W, n> &w2, float delta = kDelta) {\n  for (size_t i = 0; i < n; ++i) {\n    if (!ApproxEqual(w1.Value(i), w2.Value(i), delta)) return false;\n  }\n  return true;\n}\n\ntemplate <class W, size_t n>\ninline std::ostream &operator<<(std::ostream &strm,\n                                const TupleWeight<W, n> &w) {\n  CompositeWeightWriter writer(strm);\n  writer.WriteBegin();\n  for (size_t i = 0; i < n; ++i) writer.WriteElement(w.Value(i));\n  writer.WriteEnd();\n  return strm;\n}\n\ntemplate <class W, size_t n>\ninline std::istream &operator>>(std::istream &strm, TupleWeight<W, n> &w) {\n  CompositeWeightReader reader(strm);\n  reader.ReadBegin();\n  W v;\n  // Reads first n-1 elements.\n  static_assert(n > 0, \"Size must be positive.\");\n  for (size_t i = 0; i < n - 1; ++i) {\n    reader.ReadElement(&v);\n    w.SetValue(i, v);\n  }\n  // Reads n-th element.\n  reader.ReadElement(&v, true);\n  w.SetValue(n - 1, v);\n  reader.ReadEnd();\n  return strm;\n}\n\n}  // namespace fst\n\n#endif  // FST_TUPLE_WEIGHT_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/types.h",
    "content": "// Licensed under the Apache License, Version 2.0 (the \"License\");\n// you may not use this file except in compliance with the License.\n// You may obtain a copy of the License at\n//\n//      http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n// See the License for the specific language governing permissions and\n// limitations under the License.\n//\n// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Various type definitions (mostly for Google compatibility).\n\n#include <cstdlib>       // for ssize_t.\n#include <cstdint>       // for ?int*_t.\n\n#ifndef FST_LIB_TYPES_H_\n#define FST_LIB_TYPES_H_\n\nusing int8 = int8_t;\nusing int16 = int16_t;\nusing int32 = int32_t;\nusing int64 = int64_t;\n\nusing uint8 = uint8_t;\nusing uint16 = uint16_t;\nusing uint32 = uint32_t;\nusing uint64 = uint64_t;\n\n#endif  // FST_LIB_TYPES_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/union-find.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Union-find algorithm for dense sets of non-negative integers, implemented\n// using disjoint tree forests with rank heuristics and path compression.\n\n#ifndef FST_UNION_FIND_H_\n#define FST_UNION_FIND_H_\n\n#include <stack>\n#include <vector>\n\nnamespace fst {\n\n// Union-Find algorithm for dense sets of non-negative integers.\ntemplate <class T>\nclass UnionFind {\n public:\n  // Creates a disjoint set forest for the range [0; max); 'fail' is a value\n  // indicating that an element hasn't been initialized using MakeSet(...).\n  // The upper bound of the range can be reset (increased) using MakeSet(...).\n  UnionFind(T max, T fail) : parent_(max, fail), rank_(max), fail_(fail) {}\n\n  // Finds the representative of the set 'item' belongs to, performing path\n  // compression if necessary.\n  T FindSet(T item) {\n    if (item >= parent_.size() || item == fail_ || parent_[item] == fail_) {\n      return fail_;\n    }\n    auto *p = &parent_[item];\n    for (; *p != item; item = *p, p = &parent_[item]) exec_stack_.push(p);\n    for (; !exec_stack_.empty(); exec_stack_.pop()) *exec_stack_.top() = *p;\n    return *p;\n  }\n\n  // Creates the (destructive) union of the sets x and y belong to.\n  void Union(T x, T y) { Link(FindSet(x), FindSet(y)); }\n\n  // Initialization of an element: creates a singleton set containing 'item'.\n  // The range [0; max) is reset if item >= max.\n  T MakeSet(T item) {\n    if (item >= parent_.size()) {\n      // New value in parent_ should be initialized to fail_.\n      const auto nitem = item > 0 ? 2 * item : 2;\n      parent_.resize(nitem, fail_);\n      rank_.resize(nitem);\n    }\n    parent_[item] = item;\n    return item;\n  }\n\n  // Initialization of all elements starting from 0 to max - 1 to distinct sets.\n  void MakeAllSet(T max) {\n    parent_.resize(max);\n    for (T item = 0; item < max; ++item) parent_[item] = item;\n  }\n\n private:\n  // Links trees rooted in 'x' and 'y'.\n  void Link(T x, T y) {\n    if (x == y) return;\n    if (rank_[x] > rank_[y]) {\n      parent_[y] = x;\n    } else {\n      parent_[x] = y;\n      if (rank_[x] == rank_[y]) {\n        ++rank_[y];\n      }\n    }\n  }\n\n  UnionFind(const UnionFind &) = delete;\n\n  UnionFind &operator=(const UnionFind &) = delete;\n\n  std::vector<T> parent_;       // Parent nodes.\n  std::vector<int> rank_;       // Rank of an element = min. depth in tree.\n  T fail_;                      // Value indicating lookup failure.\n  std::stack<T *> exec_stack_;  // Used for path compression.\n};\n\n}  // namespace fst\n\n#endif  // FST_UNION_FIND_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/union-weight.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Union weight set and associated semiring operation definitions.\n//\n// TODO(riley): add in normalizer functor\n\n#ifndef FST_UNION_WEIGHT_H_\n#define FST_UNION_WEIGHT_H_\n\n#include <cstdlib>\n\n#include <iostream>\n#include <list>\n#include <sstream>\n#include <string>\n#include <utility>\n\n#include <fst/weight.h>\n\n\nnamespace fst {\n\n// Example UnionWeightOptions for UnionWeight template below. The Merge\n// operation is used to collapse elements of the set and the Compare function\n// to efficiently implement the merge. In the simplest case, merge would just\n// apply with equality of set elements so the result is a set (and not a\n// multiset). More generally, this can be used to maintain the multiplicity or\n// other such weight associated with the set elements (cf. Gallic weights).\n\n// template <class W>\n// struct UnionWeightOptions {\n//   // Comparison function C is a total order on W that is monotonic w.r.t. to\n//   // Times: for all a, b,c != Zero(): C(a, b) => C(ca, cb) and is\n//   // anti-monotonic w.r.rt to Divide: C(a, b) => C(c/b, c/a).\n//   //\n//   // For all a, b: only one of C(a, b), C(b, a) or a ~ b must true where\n//   // ~ is an equivalence relation on W. Also we require a ~ b iff\n//   // a.Reverse() ~ b.Reverse().\n//   using Compare = NaturalLess<W>;\n//\n//   // How to combine two weights if a ~ b as above. For all a, b: a ~ b =>\n//   // merge(a, b) ~ a, Merge must define a semiring endomorphism from the\n//   // unmerged weight sets to the merged weight sets.\n//   struct Merge {\n//     W operator()(const W &w1, const W &w2) const { return w1; }\n//   };\n//\n//   // For ReverseWeight.\n//   using ReverseOptions = UnionWeightOptions<ReverseWeight>;\n// };\n\ntemplate <class W, class O>\nclass UnionWeight;\n\ntemplate <class W, class O>\nclass UnionWeightIterator;\n\ntemplate <class W, class O>\nclass UnionWeightReverseIterator;\n\ntemplate <class W, class O>\nbool operator==(const UnionWeight<W, O> &, const UnionWeight<W, O> &);\n\n// Semiring that uses Times() and One() from W and union and the empty set\n// for Plus() and Zero(), respectively. Template argument O specifies the union\n// weight options as above.\ntemplate <class W, class O>\nclass UnionWeight {\n public:\n  using Weight = W;\n  using Compare = typename O::Compare;\n  using Merge = typename O::Merge;\n\n  using ReverseWeight =\n      UnionWeight<typename W::ReverseWeight, typename O::ReverseOptions>;\n\n  friend class UnionWeightIterator<W, O>;\n  friend class UnionWeightReverseIterator<W, O>;\n  friend bool operator==\n      <>(const UnionWeight<W, O> &, const UnionWeight<W, O> &);\n\n  // Sets represented as first_ weight + rest_ weights. Uses first_ as\n  // NoWeight() to indicate the union weight Zero() ask the empty set. Uses\n  // rest_ containing NoWeight() to indicate the union weight NoWeight().\n  UnionWeight() : first_(W::NoWeight()) {}\n\n  explicit UnionWeight(W weight) : first_(weight) {\n    if (weight == W::NoWeight()) rest_.push_back(weight);\n  }\n\n  static const UnionWeight<W, O> &Zero() {\n    static const UnionWeight<W, O> zero(W::NoWeight());\n    return zero;\n  }\n\n  static const UnionWeight<W, O> &One() {\n    static const UnionWeight<W, O> one(W::One());\n    return one;\n  }\n\n  static const UnionWeight<W, O> &NoWeight() {\n    static const UnionWeight<W, O> no_weight(W::Zero(), W::NoWeight());\n    return no_weight;\n  }\n\n  static const string &Type() {\n    static const string *const type = new string(W::Type() + \"_union\");\n    return *type;\n  }\n\n  static constexpr uint64 Properties() {\n    return W::Properties() &\n           (kLeftSemiring | kRightSemiring | kCommutative | kIdempotent);\n  }\n\n  bool Member() const;\n\n  std::istream &Read(std::istream &strm);\n\n  std::ostream &Write(std::ostream &strm) const;\n\n  size_t Hash() const;\n\n  UnionWeight<W, O> Quantize(float delta = kDelta) const;\n\n  ReverseWeight Reverse() const;\n\n  // These operations combined with the UnionWeightIterator and\n  // UnionWeightReverseIterator provide the access and mutation of the union\n  // weight internal elements.\n\n  // Common initializer among constructors; clears existing UnionWeight.\n  void Clear() {\n    first_ = W::NoWeight();\n    rest_.clear();\n  }\n\n  size_t Size() const { return first_.Member() ? rest_.size() + 1 : 0; }\n\n  const W &Back() const { return rest_.empty() ? first_ : rest_.back(); }\n\n  // When srt is true, assumes elements added sorted w.r.t Compare and merging\n  // of weights performed as needed. Otherwise, just ensures first_ is the\n  // least element wrt Compare.\n  void PushBack(W weight, bool srt);\n\n  // Sorts the elements of the set. Assumes that first_, if present, is the\n  // least element.\n  void Sort() { rest_.sort(comp_); }\n\n private:\n  W &Back() {\n    if (rest_.empty()) {\n      return first_;\n    } else {\n      return rest_.back();\n    }\n  }\n\n  UnionWeight(W w1, W w2) : first_(std::move(w1)), rest_(1, std::move(w2)) {}\n\n  W first_;            // First weight in set.\n  std::list<W> rest_;  // Remaining weights in set.\n  Compare comp_;\n  Merge merge_;\n};\n\ntemplate <class W, class O>\nvoid UnionWeight<W, O>::PushBack(W weight, bool srt) {\n  if (!weight.Member()) {\n    rest_.push_back(std::move(weight));\n  } else if (!first_.Member()) {\n    first_ = std::move(weight);\n  } else if (srt) {\n    auto &back = Back();\n    if (comp_(back, weight)) {\n      rest_.push_back(std::move(weight));\n    } else {\n      back = merge_(back, std::move(weight));\n    }\n  } else {\n    if (comp_(first_, weight)) {\n      rest_.push_back(std::move(weight));\n    } else {\n      rest_.push_back(first_);\n      first_ = std::move(weight);\n    }\n  }\n}\n\n// Traverses union weight in the forward direction.\ntemplate <class W, class O>\nclass UnionWeightIterator {\n public:\n  explicit UnionWeightIterator(const UnionWeight<W, O> &weight)\n      : first_(weight.first_),\n        rest_(weight.rest_),\n        init_(true),\n        it_(rest_.begin()) {}\n\n  bool Done() const { return init_ ? !first_.Member() : it_ == rest_.end(); }\n\n  const W &Value() const { return init_ ? first_ : *it_; }\n\n  void Next() {\n    if (init_) {\n      init_ = false;\n    } else {\n      ++it_;\n    }\n  }\n\n  void Reset() {\n    init_ = true;\n    it_ = rest_.begin();\n  }\n\n private:\n  const W &first_;\n  const std::list<W> &rest_;\n  bool init_;  // in the initialized state?\n  typename std::list<W>::const_iterator it_;\n};\n\n// Traverses union weight in backward direction.\ntemplate <typename L, class O>\nclass UnionWeightReverseIterator {\n public:\n  explicit UnionWeightReverseIterator(const UnionWeight<L, O> &weight)\n      : first_(weight.first_),\n        rest_(weight.rest_),\n        fin_(!first_.Member()),\n        it_(rest_.rbegin()) {}\n\n  bool Done() const { return fin_; }\n\n  const L &Value() const { return it_ == rest_.rend() ? first_ : *it_; }\n\n  void Next() {\n    if (it_ == rest_.rend()) {\n      fin_ = true;\n    } else {\n      ++it_;\n    }\n  }\n\n  void Reset() {\n    fin_ = !first_.Member();\n    it_ = rest_.rbegin();\n  }\n\n private:\n  const L &first_;\n  const std::list<L> &rest_;\n  bool fin_;  // in the final state?\n  typename std::list<L>::const_reverse_iterator it_;\n};\n\n// UnionWeight member functions follow that require UnionWeightIterator.\ntemplate <class W, class O>\ninline std::istream &UnionWeight<W, O>::Read(std::istream &istrm) {\n  Clear();\n  int32 size;\n  ReadType(istrm, &size);\n  for (int i = 0; i < size; ++i) {\n    W weight;\n    ReadType(istrm, &weight);\n    PushBack(weight, true);\n  }\n  return istrm;\n}\n\ntemplate <class W, class O>\ninline std::ostream &UnionWeight<W, O>::Write(std::ostream &ostrm) const {\n  const int32 size = Size();\n  WriteType(ostrm, size);\n  for (UnionWeightIterator<W, O> it(*this); !it.Done(); it.Next()) {\n    WriteType(ostrm, it.Value());\n  }\n  return ostrm;\n}\n\ntemplate <class W, class O>\ninline bool UnionWeight<W, O>::Member() const {\n  if (Size() <= 1) return true;\n  for (UnionWeightIterator<W, O> it(*this); !it.Done(); it.Next()) {\n    if (!it.Value().Member()) return false;\n  }\n  return true;\n}\n\ntemplate <class W, class O>\ninline UnionWeight<W, O> UnionWeight<W, O>::Quantize(float delta) const {\n  UnionWeight<W, O> weight;\n  for (UnionWeightIterator<W, O> it(*this); !it.Done(); it.Next()) {\n    weight.PushBack(it.Value().Quantize(delta), true);\n  }\n  return weight;\n}\n\ntemplate <class W, class O>\ninline typename UnionWeight<W, O>::ReverseWeight UnionWeight<W, O>::Reverse()\n    const {\n  ReverseWeight weight;\n  for (UnionWeightIterator<W, O> it(*this); !it.Done(); it.Next()) {\n    weight.PushBack(it.Value().Reverse(), false);\n  }\n  weight.Sort();\n  return weight;\n}\n\ntemplate <class W, class O>\ninline size_t UnionWeight<W, O>::Hash() const {\n  size_t h = 0;\n  static constexpr int lshift = 5;\n  static constexpr int rshift = CHAR_BIT * sizeof(size_t) - lshift;\n  for (UnionWeightIterator<W, O> it(*this); !it.Done(); it.Next()) {\n    h = h << lshift ^ h >> rshift ^ it.Value().Hash();\n  }\n  return h;\n}\n\n// Requires union weight has been canonicalized.\ntemplate <class W, class O>\ninline bool operator==(const UnionWeight<W, O> &w1,\n                       const UnionWeight<W, O> &w2) {\n  if (w1.Size() != w2.Size()) return false;\n  UnionWeightIterator<W, O> it1(w1);\n  UnionWeightIterator<W, O> it2(w2);\n  for (; !it1.Done(); it1.Next(), it2.Next()) {\n    if (it1.Value() != it2.Value()) return false;\n  }\n  return true;\n}\n\n// Requires union weight has been canonicalized.\ntemplate <class W, class O>\ninline bool operator!=(const UnionWeight<W, O> &w1,\n                       const UnionWeight<W, O> &w2) {\n  return !(w1 == w2);\n}\n\n// Requires union weight has been canonicalized.\ntemplate <class W, class O>\ninline bool ApproxEqual(const UnionWeight<W, O> &w1,\n                        const UnionWeight<W, O> &w2, float delta = kDelta) {\n  if (w1.Size() != w2.Size()) return false;\n  UnionWeightIterator<W, O> it1(w1);\n  UnionWeightIterator<W, O> it2(w2);\n  for (; !it1.Done(); it1.Next(), it2.Next()) {\n    if (!ApproxEqual(it1.Value(), it2.Value(), delta)) return false;\n  }\n  return true;\n}\n\ntemplate <class W, class O>\ninline std::ostream &operator<<(std::ostream &ostrm,\n                                const UnionWeight<W, O> &weight) {\n  UnionWeightIterator<W, O> it(weight);\n  if (it.Done()) {\n    return ostrm << \"EmptySet\";\n  } else if (!weight.Member()) {\n    return ostrm << \"BadSet\";\n  } else {\n    CompositeWeightWriter writer(ostrm);\n    writer.WriteBegin();\n    for (; !it.Done(); it.Next()) writer.WriteElement(it.Value());\n    writer.WriteEnd();\n  }\n  return ostrm;\n}\n\ntemplate <class W, class O>\ninline std::istream &operator>>(std::istream &istrm,\n                                UnionWeight<W, O> &weight) {\n  string s;\n  istrm >> s;\n  if (s == \"EmptySet\") {\n    weight = UnionWeight<W, O>::Zero();\n  } else if (s == \"BadSet\") {\n    weight = UnionWeight<W, O>::NoWeight();\n  } else {\n    weight = UnionWeight<W, O>::Zero();\n    std::istringstream sstrm(s);\n    CompositeWeightReader reader(sstrm);\n    reader.ReadBegin();\n    bool more = true;\n    while (more) {\n      W v;\n      more = reader.ReadElement(&v);\n      weight.PushBack(v, true);\n    }\n    reader.ReadEnd();\n  }\n  return istrm;\n}\n\ntemplate <class W, class O>\ninline UnionWeight<W, O> Plus(const UnionWeight<W, O> &w1,\n                              const UnionWeight<W, O> &w2) {\n  if (!w1.Member() || !w2.Member()) return UnionWeight<W, O>::NoWeight();\n  if (w1 == UnionWeight<W, O>::Zero()) return w2;\n  if (w2 == UnionWeight<W, O>::Zero()) return w1;\n  UnionWeightIterator<W, O> it1(w1);\n  UnionWeightIterator<W, O> it2(w2);\n  UnionWeight<W, O> sum;\n  typename O::Compare comp;\n  while (!it1.Done() && !it2.Done()) {\n    const auto v1 = it1.Value();\n    const auto v2 = it2.Value();\n    if (comp(v1, v2)) {\n      sum.PushBack(v1, true);\n      it1.Next();\n    } else {\n      sum.PushBack(v2, true);\n      it2.Next();\n    }\n  }\n  for (; !it1.Done(); it1.Next()) sum.PushBack(it1.Value(), true);\n  for (; !it2.Done(); it2.Next()) sum.PushBack(it2.Value(), true);\n  return sum;\n}\n\ntemplate <class W, class O>\ninline UnionWeight<W, O> Times(const UnionWeight<W, O> &w1,\n                               const UnionWeight<W, O> &w2) {\n  if (!w1.Member() || !w2.Member()) return UnionWeight<W, O>::NoWeight();\n  if (w1 == UnionWeight<W, O>::Zero() || w2 == UnionWeight<W, O>::Zero()) {\n    return UnionWeight<W, O>::Zero();\n  }\n  UnionWeightIterator<W, O> it1(w1);\n  UnionWeightIterator<W, O> it2(w2);\n  UnionWeight<W, O> prod1;\n  for (; !it1.Done(); it1.Next()) {\n    UnionWeight<W, O> prod2;\n    for (; !it2.Done(); it2.Next()) {\n      prod2.PushBack(Times(it1.Value(), it2.Value()), true);\n    }\n    prod1 = Plus(prod1, prod2);\n    it2.Reset();\n  }\n  return prod1;\n}\n\ntemplate <class W, class O>\ninline UnionWeight<W, O> Divide(const UnionWeight<W, O> &w1,\n                                const UnionWeight<W, O> &w2, DivideType typ) {\n  if (!w1.Member() || !w2.Member()) return UnionWeight<W, O>::NoWeight();\n  if (w1 == UnionWeight<W, O>::Zero() || w2 == UnionWeight<W, O>::Zero()) {\n    return UnionWeight<W, O>::Zero();\n  }\n  UnionWeightIterator<W, O> it1(w1);\n  UnionWeightReverseIterator<W, O> it2(w2);\n  UnionWeight<W, O> quot;\n  if (w1.Size() == 1) {\n    for (; !it2.Done(); it2.Next()) {\n      quot.PushBack(Divide(it1.Value(), it2.Value(), typ), true);\n    }\n  } else if (w2.Size() == 1) {\n    for (; !it1.Done(); it1.Next()) {\n      quot.PushBack(Divide(it1.Value(), it2.Value(), typ), true);\n    }\n  } else {\n    quot = UnionWeight<W, O>::NoWeight();\n  }\n  return quot;\n}\n\n// This function object generates weights over the union of weights for the\n// underlying generators for the template weight types. This is intended\n// primarily for testing.\ntemplate <class W, class O>\nclass WeightGenerate<UnionWeight<W, O>> {\n public:\n  using Weight = UnionWeight<W, O>;\n  using Generate = WeightGenerate<W>;\n\n  explicit WeightGenerate(bool allow_zero = true,\n                          size_t num_random_weights = kNumRandomWeights)\n      : generate_(false), allow_zero_(allow_zero),\n        num_random_weights_(num_random_weights) {}\n\n  Weight operator()() const {\n    const int n = rand() % (num_random_weights_ + 1);  // NOLINT\n    if (allow_zero_ && n == num_random_weights_) {\n      return Weight::Zero();\n    } else if (n % 2 == 0) {\n      return Weight(generate_());\n    } else {\n      return Plus(Weight(generate_()), Weight(generate_()));\n    }\n  }\n\n private:\n  Generate generate_;\n  // Permits Zero() and zero divisors.\n  bool allow_zero_;\n  // The number of alternative random weights.\n  const size_t num_random_weights_;\n};\n\n}  // namespace fst\n\n#endif  // FST_UNION_WEIGHT_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/union.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Functions and classes to compute the union of two FSTs.\n\n#ifndef FST_UNION_H_\n#define FST_UNION_H_\n\n#include <algorithm>\n#include <vector>\n\n#include <fst/mutable-fst.h>\n#include <fst/rational.h>\n\n\nnamespace fst {\n\n// Computes the union (sum) of two FSTs. This version writes the union to an\n// output MutableFst. If A transduces string x to y with weight a and B\n// transduces string w to v with weight b, then their union transduces x to y\n// with weight a and w to v with weight b.\n//\n// Complexity:\n//\n//   Time: (V_2 + E_2)\n//   Space: O(V_2 + E_2)\n//\n// where Vi is the number of states, and Ei is the number of arcs, in the ith\n// FST.\ntemplate <class Arc>\nvoid Union(MutableFst<Arc> *fst1, const Fst<Arc> &fst2) {\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n  // Checks for symbol table compatibility.\n  if (!CompatSymbols(fst1->InputSymbols(), fst2.InputSymbols()) ||\n      !CompatSymbols(fst1->OutputSymbols(), fst2.OutputSymbols())) {\n    FSTERROR() << \"Union: Input/output symbol tables of 1st argument \"\n               << \"do not match input/output symbol tables of 2nd argument\";\n    fst1->SetProperties(kError, kError);\n    return;\n  }\n  const auto numstates1 = fst1->NumStates();\n  const bool initial_acyclic1 = fst1->Properties(kInitialAcyclic, true);\n  const auto props1 = fst1->Properties(kFstProperties, false);\n  const auto props2 = fst2.Properties(kFstProperties, false);\n  const auto start2 = fst2.Start();\n  if (start2 == kNoStateId) {\n    if (props2 & kError) fst1->SetProperties(kError, kError);\n    return;\n  }\n  if (fst2.Properties(kExpanded, false)) {\n    fst1->ReserveStates(numstates1 + CountStates(fst2) +\n                        (initial_acyclic1 ? 0 : 1));\n  }\n  for (StateIterator<Fst<Arc>> siter(fst2); !siter.Done(); siter.Next()) {\n    const auto s1 = fst1->AddState();\n    const auto s2 = siter.Value();\n    fst1->SetFinal(s1, fst2.Final(s2));\n    fst1->ReserveArcs(s1, fst2.NumArcs(s2));\n    for (ArcIterator<Fst<Arc>> aiter(fst2, s2); !aiter.Done(); aiter.Next()) {\n      auto arc = aiter.Value();  // Copy intended.\n      arc.nextstate += numstates1;\n      fst1->AddArc(s1, arc);\n    }\n  }\n  const auto start1 = fst1->Start();\n  if (start1 == kNoStateId) {\n    fst1->SetStart(start2);\n    fst1->SetProperties(props2, kCopyProperties);\n    return;\n  }\n  if (initial_acyclic1) {\n    fst1->AddArc(start1, Arc(0, 0, Weight::One(), start2 + numstates1));\n  } else {\n    const auto nstart1 = fst1->AddState();\n    fst1->SetStart(nstart1);\n    fst1->AddArc(nstart1, Arc(0, 0, Weight::One(), start1));\n    fst1->AddArc(nstart1, Arc(0, 0, Weight::One(), start2 + numstates1));\n  }\n  fst1->SetProperties(UnionProperties(props1, props2), kFstProperties);\n}\n\n// Computes the union of two FSTs, modifying the RationalFst argument.\ntemplate <class Arc>\nvoid Union(RationalFst<Arc> *fst1, const Fst<Arc> &fst2) {\n  fst1->GetMutableImpl()->AddUnion(fst2);\n}\n\nusing UnionFstOptions = RationalFstOptions;\n\n// Computes the union (sum) of two FSTs. This version is a delayed FST. If A\n// transduces string x to y with weight a and B transduces string w to v with\n// weight b, then their union transduces x to y with weight a and w to v with\n// weight b.\n//\n// Complexity:\n//\n//   Time: O(v_1 + e_1 + v_2 + e_2)\n//   Space: O(v_1 + v_2)\n//\n// where vi is the number of states visited, and ei is the number of arcs\n// visited, in the ith FST. Constant time and space to visit an input state or\n// arc is assumed and exclusive of caching.\ntemplate <class A>\nclass UnionFst : public RationalFst<A> {\n public:\n  using Arc = A;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  UnionFst(const Fst<Arc> &fst1, const Fst<Arc> &fst2) {\n    GetMutableImpl()->InitUnion(fst1, fst2);\n  }\n\n  UnionFst(const Fst<Arc> &fst1, const Fst<Arc> &fst2,\n           const UnionFstOptions &opts)\n      : RationalFst<Arc>(opts) {\n    GetMutableImpl()->InitUnion(fst1, fst2);\n  }\n\n  // See Fst<>::Copy() for doc.\n  UnionFst(const UnionFst<Arc> &fst, bool safe = false)\n      : RationalFst<Arc>(fst, safe) {}\n\n  // Gets a copy of this UnionFst. See Fst<>::Copy() for further doc.\n  UnionFst<Arc> *Copy(bool safe = false) const override {\n    return new UnionFst<Arc>(*this, safe);\n  }\n\n private:\n  using ImplToFst<internal::RationalFstImpl<Arc>>::GetImpl;\n  using ImplToFst<internal::RationalFstImpl<Arc>>::GetMutableImpl;\n};\n\n// Specialization for UnionFst.\ntemplate <class Arc>\nclass StateIterator<UnionFst<Arc>> : public StateIterator<RationalFst<Arc>> {\n public:\n  explicit StateIterator(const UnionFst<Arc> &fst)\n      : StateIterator<RationalFst<Arc>>(fst) {}\n};\n\n// Specialization for UnionFst.\ntemplate <class Arc>\nclass ArcIterator<UnionFst<Arc>> : public ArcIterator<RationalFst<Arc>> {\n public:\n  using StateId = typename Arc::StateId;\n\n  ArcIterator(const UnionFst<Arc> &fst, StateId s)\n      : ArcIterator<RationalFst<Arc>>(fst, s) {}\n};\n\nusing StdUnionFst = UnionFst<StdArc>;\n\n}  // namespace fst\n\n#endif  // FST_UNION_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/util.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// FST utility inline definitions.\n\n#ifndef FST_UTIL_H_\n#define FST_UTIL_H_\n\n#include <iostream>\n#include <iterator>\n#include <list>\n#include <map>\n#include <set>\n#include <sstream>\n#include <string>\n#include <type_traits>\n#include <unordered_map>\n#include <unordered_set>\n#include <utility>\n#include <vector>\n\n#include <fst/compat.h>\n#include <fst/types.h>\n#include <fst/log.h>\n#include <fstream>\n\n#include <fst/flags.h>\n\n\n// Utility for error handling.\n\nDECLARE_bool(fst_error_fatal);\n\n#define FSTERROR() \\\n  (FLAGS_fst_error_fatal ? LOG(FATAL) : LOG(ERROR))\n\nnamespace fst {\n\n// Utility for type I/O.\n\n// Reads types from an input stream.\n\n// Generic case.\ntemplate <class T,\n    typename std::enable_if<std::is_class<T>::value, T>::type* = nullptr>\ninline std::istream &ReadType(std::istream &strm, T *t) {\n  return t->Read(strm);\n}\n\n// Numeric (boolean, integral, floating-point) case.\ntemplate <class T,\n    typename std::enable_if<std::is_arithmetic<T>::value, T>::type* = nullptr>\ninline std::istream &ReadType(std::istream &strm, T *t) {\n  return strm.read(reinterpret_cast<char *>(t), sizeof(T)); \\\n}\n\n// String case.\ninline std::istream &ReadType(std::istream &strm, string *s) {  // NOLINT\n  s->clear();\n  int32 ns = 0;\n  strm.read(reinterpret_cast<char *>(&ns), sizeof(ns));\n  for (int32 i = 0; i < ns; ++i) {\n    char c;\n    strm.read(&c, 1);\n    *s += c;\n  }\n  return strm;\n}\n\n// Declares types that can be read from an input stream.\ntemplate <class... T>\nstd::istream &ReadType(std::istream &strm, std::vector<T...> *c);\ntemplate <class... T>\nstd::istream &ReadType(std::istream &strm, std::list<T...> *c);\ntemplate <class... T>\nstd::istream &ReadType(std::istream &strm, std::set<T...> *c);\ntemplate <class... T>\nstd::istream &ReadType(std::istream &strm, std::map<T...> *c);\ntemplate <class... T>\nstd::istream &ReadType(std::istream &strm, std::unordered_map<T...> *c);\ntemplate <class... T>\nstd::istream &ReadType(std::istream &strm, std::unordered_set<T...> *c);\n\n// Pair case.\ntemplate <typename S, typename T>\ninline std::istream &ReadType(std::istream &strm, std::pair<S, T> *p) {\n  ReadType(strm, &p->first);\n  ReadType(strm, &p->second);\n  return strm;\n}\n\ntemplate <typename S, typename T>\ninline std::istream &ReadType(std::istream &strm, std::pair<const S, T> *p) {\n  ReadType(strm, const_cast<S *>(&p->first));\n  ReadType(strm, &p->second);\n  return strm;\n}\n\nnamespace internal {\ntemplate <class C, class ReserveFn>\nstd::istream &ReadContainerType(std::istream &strm, C *c, ReserveFn reserve) {\n  c->clear();\n  int64 n = 0;\n  ReadType(strm, &n);\n  reserve(c, n);\n  auto insert = std::inserter(*c, c->begin());\n  for (int64 i = 0; i < n; ++i) {\n    typename C::value_type value;\n    ReadType(strm, &value);\n    *insert = value;\n  }\n  return strm;\n}\n}  // namespace internal\n\ntemplate <class... T>\nstd::istream &ReadType(std::istream &strm, std::vector<T...> *c) {\n  return internal::ReadContainerType(\n      strm, c, [](decltype(c) v, int n) { v->reserve(n); });\n}\n\ntemplate <class... T>\nstd::istream &ReadType(std::istream &strm, std::list<T...> *c) {\n  return internal::ReadContainerType(strm, c, [](decltype(c) v, int n) {});\n}\n\ntemplate <class... T>\nstd::istream &ReadType(std::istream &strm, std::set<T...> *c) {\n  return internal::ReadContainerType(strm, c, [](decltype(c) v, int n) {});\n}\n\ntemplate <class... T>\nstd::istream &ReadType(std::istream &strm, std::map<T...> *c) {\n  return internal::ReadContainerType(strm, c, [](decltype(c) v, int n) {});\n}\n\ntemplate <class... T>\nstd::istream &ReadType(std::istream &strm, std::unordered_set<T...> *c) {\n  return internal::ReadContainerType(\n      strm, c, [](decltype(c) v, int n) { v->reserve(n); });\n}\n\ntemplate <class... T>\nstd::istream &ReadType(std::istream &strm, std::unordered_map<T...> *c) {\n  return internal::ReadContainerType(\n      strm, c, [](decltype(c) v, int n) { v->reserve(n); });\n}\n\n// Writes types to an output stream.\n\n// Generic case.\ntemplate <class T,\n    typename std::enable_if<std::is_class<T>::value, T>::type* = nullptr>\ninline std::ostream &WriteType(std::ostream &strm, const T t) {\n  t.Write(strm);\n  return strm;\n}\n\n// Numeric (boolean, integral, floating-point) case.\ntemplate <class T,\n    typename std::enable_if<std::is_arithmetic<T>::value, T>::type* = nullptr>\ninline std::ostream &WriteType(std::ostream &strm, const T t) {\n  return strm.write(reinterpret_cast<const char *>(&t), sizeof(T));\n}\n\n// String case.\ninline std::ostream &WriteType(std::ostream &strm, const string &s) {  // NOLINT\n  int32 ns = s.size();\n  strm.write(reinterpret_cast<const char *>(&ns), sizeof(ns));\n  return strm.write(s.data(), ns);\n}\n\n// Declares types that can be written to an output stream.\n\ntemplate <typename... T>\nstd::ostream &WriteType(std::ostream &strm, const std::vector<T...> &c);\ntemplate <typename... T>\nstd::ostream &WriteType(std::ostream &strm, const std::list<T...> &c);\ntemplate <typename... T>\nstd::ostream &WriteType(std::ostream &strm, const std::set<T...> &c);\ntemplate <typename... T>\nstd::ostream &WriteType(std::ostream &strm, const std::map<T...> &c);\ntemplate <typename... T>\nstd::ostream &WriteType(std::ostream &strm, const std::unordered_map<T...> &c);\ntemplate <typename... T>\nstd::ostream &WriteType(std::ostream &strm, const std::unordered_set<T...> &c);\n\n// Pair case.\ntemplate <typename S, typename T>\ninline std::ostream &WriteType(std::ostream &strm,\n                               const std::pair<S, T> &p) {  // NOLINT\n  WriteType(strm, p.first);\n  WriteType(strm, p.second);\n  return strm;\n}\n\nnamespace internal {\ntemplate <class C>\nstd::ostream &WriteContainer(std::ostream &strm, const C &c) {\n  const int64 n = c.size();\n  WriteType(strm, n);\n  for (const auto &e : c) {\n    WriteType(strm, e);\n  }\n  return strm;\n}\n}  // namespace internal\n\ntemplate <typename... T>\nstd::ostream &WriteType(std::ostream &strm, const std::vector<T...> &c) {\n  return internal::WriteContainer(strm, c);\n}\n\ntemplate <typename... T>\nstd::ostream &WriteType(std::ostream &strm, const std::list<T...> &c) {\n  return internal::WriteContainer(strm, c);\n}\n\ntemplate <typename... T>\nstd::ostream &WriteType(std::ostream &strm, const std::set<T...> &c) {\n  return internal::WriteContainer(strm, c);\n}\n\ntemplate <typename... T>\nstd::ostream &WriteType(std::ostream &strm, const std::map<T...> &c) {\n  return internal::WriteContainer(strm, c);\n}\n\ntemplate <typename... T>\nstd::ostream &WriteType(std::ostream &strm, const std::unordered_map<T...> &c) {\n  return internal::WriteContainer(strm, c);\n}\n\ntemplate <typename... T>\nstd::ostream &WriteType(std::ostream &strm, const std::unordered_set<T...> &c) {\n  return internal::WriteContainer(strm, c);\n}\n\n// Utilities for converting between int64 or Weight and string.\n\nint64 StrToInt64(const string &s, const string &src, size_t nline,\n                 bool allow_negative, bool *error = nullptr);\n\ntemplate <typename Weight>\nWeight StrToWeight(const string &s, const string &src, size_t nline) {\n  Weight w;\n  std::istringstream strm(s);\n  strm >> w;\n  if (!strm) {\n    FSTERROR() << \"StrToWeight: Bad weight = \\\"\" << s << \"\\\", source = \" << src\n               << \", line = \" << nline;\n    return Weight::NoWeight();\n  }\n  return w;\n}\n\ntemplate <typename Weight>\nvoid WeightToStr(Weight w, string *s) {\n  std::ostringstream strm;\n  strm.precision(9);\n  strm << w;\n  s->append(strm.str().data(), strm.str().size());\n}\n\n// Utilities for reading/writing integer pairs (typically labels)\n\n// Modifies line using a vector of pointers to a buffer beginning with line.\nvoid SplitString(char *line, const char *delim, std::vector<char *> *vec,\n                 bool omit_empty_strings);\n\ntemplate <typename I>\nbool ReadIntPairs(const string &filename, std::vector<std::pair<I, I>> *pairs,\n                  bool allow_negative = false) {\n  std::ifstream strm(filename, std::ios_base::in);\n  if (!strm) {\n    LOG(ERROR) << \"ReadIntPairs: Can't open file: \" << filename;\n    return false;\n  }\n  const int kLineLen = 8096;\n  char line[kLineLen];\n  size_t nline = 0;\n  pairs->clear();\n  while (strm.getline(line, kLineLen)) {\n    ++nline;\n    std::vector<char *> col;\n    SplitString(line, \"\\n\\t \", &col, true);\n    // empty line or comment?\n    if (col.empty() || col[0][0] == '\\0' || col[0][0] == '#') continue;\n    if (col.size() != 2) {\n      LOG(ERROR) << \"ReadIntPairs: Bad number of columns, \"\n                 << \"file = \" << filename << \", line = \" << nline;\n      return false;\n    }\n    bool err;\n    I i1 = StrToInt64(col[0], filename, nline, allow_negative, &err);\n    if (err) return false;\n    I i2 = StrToInt64(col[1], filename, nline, allow_negative, &err);\n    if (err) return false;\n    pairs->push_back(std::make_pair(i1, i2));\n  }\n  return true;\n}\n\ntemplate <typename I>\nbool WriteIntPairs(const string &filename,\n                   const std::vector<std::pair<I, I>> &pairs) {\n  std::ostream *strm = &std::cout;\n  if (!filename.empty()) {\n    strm = new std::ofstream(filename);\n    if (!*strm) {\n      LOG(ERROR) << \"WriteIntPairs: Can't open file: \" << filename;\n      return false;\n    }\n  }\n  for (ssize_t n = 0; n < pairs.size(); ++n) {\n    *strm << pairs[n].first << \"\\t\" << pairs[n].second << \"\\n\";\n  }\n  if (!*strm) {\n    LOG(ERROR) << \"WriteIntPairs: Write failed: \"\n               << (filename.empty() ? \"standard output\" : filename);\n    return false;\n  }\n  if (strm != &std::cout) delete strm;\n  return true;\n}\n\n// Utilities for reading/writing label pairs.\n\ntemplate <typename Label>\nbool ReadLabelPairs(const string &filename,\n                    std::vector<std::pair<Label, Label>> *pairs,\n                    bool allow_negative = false) {\n  return ReadIntPairs(filename, pairs, allow_negative);\n}\n\ntemplate <typename Label>\nbool WriteLabelPairs(const string &filename,\n                     const std::vector<std::pair<Label, Label>> &pairs) {\n  return WriteIntPairs(filename, pairs);\n}\n\n// Utilities for converting a type name to a legal C symbol.\n\nvoid ConvertToLegalCSymbol(string *s);\n\n// Utilities for stream I/O.\n\nbool AlignInput(std::istream &strm);\nbool AlignOutput(std::ostream &strm);\n\n// An associative container for which testing membership is faster than an STL\n// set if members are restricted to an interval that excludes most non-members.\n// A Key must have ==, !=, and < operators defined. Element NoKey should be a\n// key that marks an uninitialized key and is otherwise unused. Find() returns\n// an STL const_iterator to the match found, otherwise it equals End().\ntemplate <class Key, Key NoKey>\nclass CompactSet {\n public:\n  using const_iterator = typename std::set<Key>::const_iterator;\n\n  CompactSet() : min_key_(NoKey), max_key_(NoKey) {}\n\n  CompactSet(const CompactSet<Key, NoKey> &compact_set)\n      : set_(compact_set.set_),\n        min_key_(compact_set.min_key_),\n        max_key_(compact_set.max_key_) {}\n\n  void Insert(Key key) {\n    set_.insert(key);\n    if (min_key_ == NoKey || key < min_key_) min_key_ = key;\n    if (max_key_ == NoKey || max_key_ < key) max_key_ = key;\n  }\n\n  void Erase(Key key) {\n    set_.erase(key);\n    if (set_.empty()) {\n      min_key_ = max_key_ = NoKey;\n    } else if (key == min_key_) {\n      ++min_key_;\n    } else if (key == max_key_) {\n      --max_key_;\n    }\n  }\n\n  void Clear() {\n    set_.clear();\n    min_key_ = max_key_ = NoKey;\n  }\n\n  const_iterator Find(Key key) const {\n    if (min_key_ == NoKey || key < min_key_ || max_key_ < key) {\n      return set_.end();\n    } else {\n      return set_.find(key);\n    }\n  }\n\n  bool Member(Key key) const {\n    if (min_key_ == NoKey || key < min_key_ || max_key_ < key) {\n      return false;  // out of range\n    } else if (min_key_ != NoKey && max_key_ + 1 == min_key_ + set_.size()) {\n      return true;  // dense range\n    } else {\n      return set_.count(key);\n    }\n  }\n\n  const_iterator Begin() const { return set_.begin(); }\n\n  const_iterator End() const { return set_.end(); }\n\n  // All stored keys are greater than or equal to this value.\n  Key LowerBound() const { return min_key_; }\n\n  // All stored keys are less than or equal to this value.\n  Key UpperBound() const { return max_key_; }\n\n private:\n  std::set<Key> set_;\n  Key min_key_;\n  Key max_key_;\n\n  void operator=(const CompactSet &) = delete;\n};\n\n}  // namespace fst\n\n#endif  // FST_UTIL_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/vector-fst.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Simple concrete, mutable FST whose states and arcs are stored in STL vectors.\n\n#ifndef FST_VECTOR_FST_H_\n#define FST_VECTOR_FST_H_\n\n#include <string>\n#include <utility>\n#include <vector>\n\n#include <fst/log.h>\n\n#include <fst/fst-decl.h>  // For optional argument declarations\n#include <fst/mutable-fst.h>\n#include <fst/test-properties.h>\n\n\nnamespace fst {\n\ntemplate <class A, class S>\nclass VectorFst;\n\ntemplate <class F, class G>\nvoid Cast(const F &, G *);\n\n// Arcs (of type A) implemented by an STL vector per state. M specifies Arc\n// allocator (default declared in fst-decl.h).\ntemplate <class A, class M /* = std::allocator<A> */>\nclass VectorState {\n public:\n  using Arc = A;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n  using ArcAllocator = M;\n  using StateAllocator =\n      typename ArcAllocator::template rebind<VectorState<Arc, M>>::other;\n\n  // Provide STL allocator for arcs.\n  explicit VectorState(const ArcAllocator &alloc)\n      : final_(Weight::Zero()), niepsilons_(0), noepsilons_(0), arcs_(alloc) {}\n\n  VectorState(const VectorState<A, M> &state, const ArcAllocator &alloc)\n      : final_(state.Final()),\n        niepsilons_(state.NumInputEpsilons()),\n        noepsilons_(state.NumOutputEpsilons()),\n        arcs_(state.arcs_.begin(), state.arcs_.end(), alloc) {}\n\n  void Reset() {\n    final_ = Weight::Zero();\n    niepsilons_ = 0;\n    noepsilons_ = 0;\n    arcs_.clear();\n  }\n\n  Weight Final() const { return final_; }\n\n  size_t NumInputEpsilons() const { return niepsilons_; }\n\n  size_t NumOutputEpsilons() const { return noepsilons_; }\n\n  size_t NumArcs() const { return arcs_.size(); }\n\n  const Arc &GetArc(size_t n) const { return arcs_[n]; }\n\n  const Arc *Arcs() const { return !arcs_.empty() ? &arcs_[0] : nullptr; }\n\n  Arc *MutableArcs() { return !arcs_.empty() ? &arcs_[0] : nullptr; }\n\n  void ReserveArcs(size_t n) { arcs_.reserve(n); }\n\n  void SetFinal(Weight weight) { final_ = std::move(weight); }\n\n  void SetNumInputEpsilons(size_t n) { niepsilons_ = n; }\n\n  void SetNumOutputEpsilons(size_t n) { noepsilons_ = n; }\n\n  void AddArc(const Arc &arc) {\n    if (arc.ilabel == 0) ++niepsilons_;\n    if (arc.olabel == 0) ++noepsilons_;\n    arcs_.push_back(arc);\n  }\n\n  void SetArc(const Arc &arc, size_t n) {\n    if (arcs_[n].ilabel == 0) --niepsilons_;\n    if (arcs_[n].olabel == 0) --noepsilons_;\n    if (arc.ilabel == 0) ++niepsilons_;\n    if (arc.olabel == 0) ++noepsilons_;\n    arcs_[n] = arc;\n  }\n\n  void DeleteArcs() {\n    niepsilons_ = 0;\n    noepsilons_ = 0;\n    arcs_.clear();\n  }\n\n  void DeleteArcs(size_t n) {\n    for (size_t i = 0; i < n; ++i) {\n      if (arcs_.back().ilabel == 0) --niepsilons_;\n      if (arcs_.back().olabel == 0) --noepsilons_;\n      arcs_.pop_back();\n    }\n  }\n\n  // For state class allocation.\n  void *operator new(size_t size, StateAllocator *alloc) {\n    return alloc->allocate(1);\n  }\n\n  // For state destruction and memory freeing.\n  static void Destroy(VectorState<A, M> *state, StateAllocator *alloc) {\n    if (state) {\n      state->~VectorState<A, M>();\n      alloc->deallocate(state, 1);\n    }\n  }\n\n private:\n  Weight final_;                       // Final weight.\n  size_t niepsilons_;                  // # of input epsilons\n  size_t noepsilons_;                  // # of output epsilons\n  std::vector<A, ArcAllocator> arcs_;  // Arc container.\n};\n\nnamespace internal {\n\n// States are implemented by STL vectors, templated on the\n// State definition. This does not manage the Fst properties.\ntemplate <class S>\nclass VectorFstBaseImpl : public FstImpl<typename S::Arc> {\n public:\n  using State = S;\n  using Arc = typename State::Arc;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  VectorFstBaseImpl() : start_(kNoStateId) {}\n\n  ~VectorFstBaseImpl() override {\n    for (StateId s = 0; s < states_.size(); ++s) {\n      State::Destroy(states_[s], &state_alloc_);\n    }\n  }\n\n  StateId Start() const { return start_; }\n\n  Weight Final(StateId state) const { return states_[state]->Final(); }\n\n  StateId NumStates() const { return states_.size(); }\n\n  size_t NumArcs(StateId state) const { return states_[state]->NumArcs(); }\n\n  size_t NumInputEpsilons(StateId state) const {\n    return GetState(state)->NumInputEpsilons();\n  }\n\n  size_t NumOutputEpsilons(StateId state) const {\n    return GetState(state)->NumOutputEpsilons();\n  }\n\n  void SetStart(StateId state) { start_ = state; }\n\n  void SetFinal(StateId state, Weight weight) {\n    states_[state]->SetFinal(std::move(weight));\n  }\n\n  StateId AddState() {\n    states_.push_back(new (&state_alloc_) State(arc_alloc_));\n    return states_.size() - 1;\n  }\n\n  StateId AddState(State *state) {\n    states_.push_back(state);\n    return states_.size() - 1;\n  }\n\n  void AddArc(StateId state, const Arc &arc) { states_[state]->AddArc(arc); }\n\n  void DeleteStates(const std::vector<StateId> &dstates) {\n    std::vector<StateId> newid(states_.size(), 0);\n    for (StateId i = 0; i < dstates.size(); ++i) newid[dstates[i]] = kNoStateId;\n    StateId nstates = 0;\n    for (StateId state = 0; state < states_.size(); ++state) {\n      if (newid[state] != kNoStateId) {\n        newid[state] = nstates;\n        if (state != nstates) states_[nstates] = states_[state];\n        ++nstates;\n      } else {\n        State::Destroy(states_[state], &state_alloc_);\n      }\n    }\n    states_.resize(nstates);\n    for (StateId state = 0; state < states_.size(); ++state) {\n      auto *arcs = states_[state]->MutableArcs();\n      size_t narcs = 0;\n      auto nieps = states_[state]->NumInputEpsilons();\n      auto noeps = states_[state]->NumOutputEpsilons();\n      for (size_t i = 0; i < states_[state]->NumArcs(); ++i) {\n        const auto t = newid[arcs[i].nextstate];\n        if (t != kNoStateId) {\n          arcs[i].nextstate = t;\n          if (i != narcs) arcs[narcs] = arcs[i];\n          ++narcs;\n        } else {\n          if (arcs[i].ilabel == 0) --nieps;\n          if (arcs[i].olabel == 0) --noeps;\n        }\n      }\n      states_[state]->DeleteArcs(states_[state]->NumArcs() - narcs);\n      states_[state]->SetNumInputEpsilons(nieps);\n      states_[state]->SetNumOutputEpsilons(noeps);\n    }\n    if (Start() != kNoStateId) SetStart(newid[Start()]);\n  }\n\n  void DeleteStates() {\n    for (StateId state = 0; state < states_.size(); ++state) {\n      State::Destroy(states_[state], &state_alloc_);\n    }\n    states_.clear();\n    SetStart(kNoStateId);\n  }\n\n  void DeleteArcs(StateId state, size_t n) { states_[state]->DeleteArcs(n); }\n\n  void DeleteArcs(StateId state) { states_[state]->DeleteArcs(); }\n\n  State *GetState(StateId state) { return states_[state]; }\n\n  const State *GetState(StateId state) const { return states_[state]; }\n\n  void SetState(StateId state, State *vstate) { states_[state] = vstate; }\n\n  void ReserveStates(StateId n) { states_.reserve(n); }\n\n  void ReserveArcs(StateId state, size_t n) { states_[state]->ReserveArcs(n); }\n\n  // Provide information needed for generic state iterator.\n  void InitStateIterator(StateIteratorData<Arc> *data) const {\n    data->base = nullptr;\n    data->nstates = states_.size();\n  }\n\n  // Provide information needed for generic arc iterator.\n  void InitArcIterator(StateId state, ArcIteratorData<Arc> *data) const {\n    data->base = nullptr;\n    data->narcs = states_[state]->NumArcs();\n    data->arcs = states_[state]->Arcs();\n    data->ref_count = nullptr;\n  }\n\n private:\n  std::vector<State *> states_;                 // States represenation.\n  StateId start_;                               // Initial state.\n  typename State::StateAllocator state_alloc_;  // For state allocation.\n  typename State::ArcAllocator arc_alloc_;      // For arc allocation.\n\n  VectorFstBaseImpl(const VectorFstBaseImpl &) = delete;\n  VectorFstBaseImpl &operator=(const VectorFstBaseImpl &) = delete;\n};\n\n// This is a VectorFstBaseImpl container that holds VectorStates and manages FST\n// properties.\ntemplate <class S>\nclass VectorFstImpl : public VectorFstBaseImpl<S> {\n public:\n  using State = S;\n  using Arc = typename State::Arc;\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using FstImpl<Arc>::SetInputSymbols;\n  using FstImpl<Arc>::SetOutputSymbols;\n  using FstImpl<Arc>::SetType;\n  using FstImpl<Arc>::SetProperties;\n  using FstImpl<Arc>::Properties;\n\n  using VectorFstBaseImpl<S>::Start;\n  using VectorFstBaseImpl<S>::NumStates;\n  using VectorFstBaseImpl<S>::GetState;\n  using VectorFstBaseImpl<S>::ReserveArcs;\n\n  friend class MutableArcIterator<VectorFst<Arc, S>>;\n\n  using BaseImpl = VectorFstBaseImpl<S>;\n\n  VectorFstImpl() {\n    SetType(\"vector\");\n    SetProperties(kNullProperties | kStaticProperties);\n  }\n\n  explicit VectorFstImpl(const Fst<Arc> &fst);\n\n  static VectorFstImpl<S> *Read(std::istream &strm, const FstReadOptions &opts);\n\n  void SetStart(StateId state) {\n    BaseImpl::SetStart(state);\n    SetProperties(SetStartProperties(Properties()));\n  }\n\n  void SetFinal(StateId state, Weight weight) {\n    const auto old_weight = BaseImpl::Final(state);\n    const auto properties =\n        SetFinalProperties(Properties(), old_weight, weight);\n    BaseImpl::SetFinal(state, std::move(weight));\n    SetProperties(properties);\n  }\n\n  StateId AddState() {\n    const auto state = BaseImpl::AddState();\n    SetProperties(AddStateProperties(Properties()));\n    return state;\n  }\n\n  void AddArc(StateId state, const Arc &arc) {\n    auto *vstate = GetState(state);\n    const auto *parc = vstate->NumArcs() == 0\n                           ? nullptr\n                           : &(vstate->GetArc(vstate->NumArcs() - 1));\n    SetProperties(AddArcProperties(Properties(), state, arc, parc));\n    BaseImpl::AddArc(state, arc);\n  }\n\n  void DeleteStates(const std::vector<StateId> &dstates) {\n    BaseImpl::DeleteStates(dstates);\n    SetProperties(DeleteStatesProperties(Properties()));\n  }\n\n  void DeleteStates() {\n    BaseImpl::DeleteStates();\n    SetProperties(DeleteAllStatesProperties(Properties(), kStaticProperties));\n  }\n\n  void DeleteArcs(StateId state, size_t n) {\n    BaseImpl::DeleteArcs(state, n);\n    SetProperties(DeleteArcsProperties(Properties()));\n  }\n\n  void DeleteArcs(StateId state) {\n    BaseImpl::DeleteArcs(state);\n    SetProperties(DeleteArcsProperties(Properties()));\n  }\n\n  // Properties always true of this FST class\n  static constexpr uint64 kStaticProperties = kExpanded | kMutable;\n\n private:\n  // Minimum file format version supported.\n  static constexpr int kMinFileVersion = 2;\n};\n\ntemplate <class S>\nconstexpr uint64 VectorFstImpl<S>::kStaticProperties;\n\ntemplate <class S>\nconstexpr int VectorFstImpl<S>::kMinFileVersion;\n\ntemplate <class S>\nVectorFstImpl<S>::VectorFstImpl(const Fst<Arc> &fst) {\n  SetType(\"vector\");\n  SetInputSymbols(fst.InputSymbols());\n  SetOutputSymbols(fst.OutputSymbols());\n  BaseImpl::SetStart(fst.Start());\n  if (fst.Properties(kExpanded, false)) {\n    BaseImpl::ReserveStates(CountStates(fst));\n  }\n  for (StateIterator<Fst<Arc>> siter(fst); !siter.Done(); siter.Next()) {\n    const auto state = siter.Value();\n    BaseImpl::AddState();\n    BaseImpl::SetFinal(state, fst.Final(state));\n    ReserveArcs(state, fst.NumArcs(state));\n    for (ArcIterator<Fst<Arc>> aiter(fst, state); !aiter.Done(); aiter.Next()) {\n      const auto &arc = aiter.Value();\n      BaseImpl::AddArc(state, arc);\n    }\n  }\n  SetProperties(fst.Properties(kCopyProperties, false) | kStaticProperties);\n}\n\ntemplate <class S>\nVectorFstImpl<S> *VectorFstImpl<S>::Read(std::istream &strm,\n                                         const FstReadOptions &opts) {\n  std::unique_ptr<VectorFstImpl<S>> impl(new VectorFstImpl());\n  FstHeader hdr;\n  if (!impl->ReadHeader(strm, opts, kMinFileVersion, &hdr)) return nullptr;\n  impl->BaseImpl::SetStart(hdr.Start());\n  if (hdr.NumStates() != kNoStateId) impl->ReserveStates(hdr.NumStates());\n  StateId state = 0;\n  for (; hdr.NumStates() == kNoStateId || state < hdr.NumStates(); ++state) {\n    Weight weight;\n    if (!weight.Read(strm)) break;\n    impl->BaseImpl::AddState();\n    auto *vstate = impl->GetState(state);\n    vstate->SetFinal(weight);\n    int64 narcs;\n    ReadType(strm, &narcs);\n    if (!strm) {\n      LOG(ERROR) << \"VectorFst::Read: Read failed: \" << opts.source;\n      return nullptr;\n    }\n    impl->ReserveArcs(state, narcs);\n    for (int64 i = 0; i < narcs; ++i) {\n      Arc arc;\n      ReadType(strm, &arc.ilabel);\n      ReadType(strm, &arc.olabel);\n      arc.weight.Read(strm);\n      ReadType(strm, &arc.nextstate);\n      if (!strm) {\n        LOG(ERROR) << \"VectorFst::Read: Read failed: \" << opts.source;\n        return nullptr;\n      }\n      impl->BaseImpl::AddArc(state, arc);\n    }\n  }\n  if (hdr.NumStates() != kNoStateId && state != hdr.NumStates()) {\n    LOG(ERROR) << \"VectorFst::Read: Unexpected end of file: \" << opts.source;\n    return nullptr;\n  }\n  return impl.release();\n}\n\n}  // namespace internal\n\n// Simple concrete, mutable FST. This class attaches interface to implementation\n// and handles reference counting, delegating most methods to ImplToMutableFst.\n// Also supports ReserveStates and ReserveArcs methods (cf. STL vector methods).\n// The second optional template argument gives the State definition.\ntemplate <class A, class S /* = VectorState<A> */>\nclass VectorFst : public ImplToMutableFst<internal::VectorFstImpl<S>> {\n public:\n  using Arc = A;\n  using StateId = typename Arc::StateId;\n\n  using State = S;\n  using Impl = internal::VectorFstImpl<State>;\n\n  friend class StateIterator<VectorFst<Arc, State>>;\n  friend class ArcIterator<VectorFst<Arc, State>>;\n  friend class MutableArcIterator<VectorFst<A, S>>;\n\n  template <class F, class G>\n  friend void Cast(const F &, G *);\n\n  VectorFst() : ImplToMutableFst<Impl>(std::make_shared<Impl>()) {}\n\n  explicit VectorFst(const Fst<Arc> &fst)\n      : ImplToMutableFst<Impl>(std::make_shared<Impl>(fst)) {}\n\n  VectorFst(const VectorFst<Arc, State> &fst, bool safe = false)\n      : ImplToMutableFst<Impl>(fst) {}\n\n  // Get a copy of this VectorFst. See Fst<>::Copy() for further doc.\n  VectorFst<Arc, State> *Copy(bool safe = false) const override {\n    return new VectorFst<Arc, State>(*this, safe);\n  }\n\n  VectorFst<Arc, State> &operator=(const VectorFst<Arc, State> &fst) {\n    SetImpl(fst.GetSharedImpl());\n    return *this;\n  }\n\n  VectorFst<Arc, State> &operator=(const Fst<Arc> &fst) override {\n    if (this != &fst) SetImpl(std::make_shared<Impl>(fst));\n    return *this;\n  }\n\n  // Reads a VectorFst from an input stream, returning nullptr on error.\n  static VectorFst<Arc, State> *Read(std::istream &strm,\n                                     const FstReadOptions &opts) {\n    auto *impl = Impl::Read(strm, opts);\n    return impl ? new VectorFst<Arc, State>(std::shared_ptr<Impl>(impl))\n                : nullptr;\n  }\n\n  // Read a VectorFst from a file, returning nullptr on error; empty filename\n  // reads from standard input.\n  static VectorFst<Arc, State> *Read(const string &filename) {\n    auto *impl = ImplToExpandedFst<Impl, MutableFst<Arc>>::Read(filename);\n    return impl ? new VectorFst<Arc, State>(std::shared_ptr<Impl>(impl))\n                : nullptr;\n  }\n\n  bool Write(std::ostream &strm, const FstWriteOptions &opts) const override {\n    return WriteFst(*this, strm, opts);\n  }\n\n  bool Write(const string &filename) const override {\n    return Fst<Arc>::WriteFile(filename);\n  }\n\n  template <class FST>\n  static bool WriteFst(const FST &fst, std::ostream &strm,\n                       const FstWriteOptions &opts);\n\n  void InitStateIterator(StateIteratorData<Arc> *data) const override {\n    GetImpl()->InitStateIterator(data);\n  }\n\n  void InitArcIterator(StateId s, ArcIteratorData<Arc> *data) const override {\n    GetImpl()->InitArcIterator(s, data);\n  }\n\n  inline void InitMutableArcIterator(StateId s,\n                                     MutableArcIteratorData<Arc> *) override;\n\n  using ImplToMutableFst<Impl, MutableFst<Arc>>::ReserveArcs;\n  using ImplToMutableFst<Impl, MutableFst<Arc>>::ReserveStates;\n\n private:\n  using ImplToMutableFst<Impl, MutableFst<Arc>>::GetImpl;\n  using ImplToMutableFst<Impl, MutableFst<Arc>>::MutateCheck;\n  using ImplToMutableFst<Impl, MutableFst<Arc>>::SetImpl;\n\n  explicit VectorFst(std::shared_ptr<Impl> impl)\n      : ImplToMutableFst<Impl>(impl) {}\n};\n\n// Writes FST to file in Vector format, potentially with a pass over the machine\n// before writing to compute number of states.\ntemplate <class Arc, class State>\ntemplate <class FST>\nbool VectorFst<Arc, State>::WriteFst(const FST &fst, std::ostream &strm,\n                                     const FstWriteOptions &opts) {\n  static constexpr int file_version = 2;\n  bool update_header = true;\n  FstHeader hdr;\n  hdr.SetStart(fst.Start());\n  hdr.SetNumStates(kNoStateId);\n  size_t start_offset = 0;\n  if (fst.Properties(kExpanded, false) || opts.stream_write ||\n      (start_offset = strm.tellp()) != -1) {\n    hdr.SetNumStates(CountStates(fst));\n    update_header = false;\n  }\n  const auto properties =\n      fst.Properties(kCopyProperties, false) | Impl::kStaticProperties;\n  internal::FstImpl<Arc>::WriteFstHeader(fst, strm, opts, file_version,\n                                         \"vector\", properties, &hdr);\n  StateId num_states = 0;\n  for (StateIterator<FST> siter(fst); !siter.Done(); siter.Next()) {\n    const auto s = siter.Value();\n    fst.Final(s).Write(strm);\n    const int64 narcs = fst.NumArcs(s);\n    WriteType(strm, narcs);\n    for (ArcIterator<FST> aiter(fst, s); !aiter.Done(); aiter.Next()) {\n      const auto &arc = aiter.Value();\n      WriteType(strm, arc.ilabel);\n      WriteType(strm, arc.olabel);\n      arc.weight.Write(strm);\n      WriteType(strm, arc.nextstate);\n    }\n    ++num_states;\n  }\n  strm.flush();\n  if (!strm) {\n    LOG(ERROR) << \"VectorFst::Write: Write failed: \" << opts.source;\n    return false;\n  }\n  if (update_header) {\n    hdr.SetNumStates(num_states);\n    return internal::FstImpl<Arc>::UpdateFstHeader(\n        fst, strm, opts, file_version, \"vector\", properties, &hdr,\n        start_offset);\n  } else {\n    if (num_states != hdr.NumStates()) {\n      LOG(ERROR) << \"Inconsistent number of states observed during write\";\n      return false;\n    }\n  }\n  return true;\n}\n\n// Specialization for VectorFst; see generic version in fst.h for sample usage\n// (but use the VectorFst type instead). This version should inline.\ntemplate <class Arc, class State>\nclass StateIterator<VectorFst<Arc, State>> {\n public:\n  using StateId = typename Arc::StateId;\n\n  explicit StateIterator(const VectorFst<Arc, State> &fst)\n      : nstates_(fst.GetImpl()->NumStates()), s_(0) {}\n\n  bool Done() const { return s_ >= nstates_; }\n\n  StateId Value() const { return s_; }\n\n  void Next() { ++s_; }\n\n  void Reset() { s_ = 0; }\n\n private:\n  const StateId nstates_;\n  StateId s_;\n};\n\n// Specialization for VectorFst; see generic version in fst.h for sample usage\n// (but use the VectorFst type instead). This version should inline.\ntemplate <class Arc, class State>\nclass ArcIterator<VectorFst<Arc, State>> {\n public:\n  using StateId = typename Arc::StateId;\n\n  ArcIterator(const VectorFst<Arc, State> &fst, StateId s)\n      : arcs_(fst.GetImpl()->GetState(s)->Arcs()),\n        narcs_(fst.GetImpl()->GetState(s)->NumArcs()),\n        i_(0) {}\n\n  bool Done() const { return i_ >= narcs_; }\n\n  const Arc &Value() const { return arcs_[i_]; }\n\n  void Next() { ++i_; }\n\n  void Reset() { i_ = 0; }\n\n  void Seek(size_t a) { i_ = a; }\n\n  size_t Position() const { return i_; }\n\n  constexpr uint32 Flags() const { return kArcValueFlags; }\n\n  void SetFlags(uint32, uint32) {}\n\n private:\n  const Arc *arcs_;\n  size_t narcs_;\n  size_t i_;\n};\n\n// Specialization for VectorFst; see generic version in mutable-fst.h for sample\n// usage (but use the VectorFst type instead). This version should inline.\ntemplate <class Arc, class State>\nclass MutableArcIterator<VectorFst<Arc, State>>\n    : public MutableArcIteratorBase<Arc> {\n public:\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  MutableArcIterator(VectorFst<Arc, State> *fst, StateId s) : i_(0) {\n    fst->MutateCheck();\n    state_ = fst->GetMutableImpl()->GetState(s);\n    properties_ = &fst->GetImpl()->properties_;\n  }\n\n  bool Done() const final { return i_ >= state_->NumArcs(); }\n\n  const Arc &Value() const final { return state_->GetArc(i_); }\n\n  void Next() final { ++i_; }\n\n  size_t Position() const final { return i_; }\n\n  void Reset() final { i_ = 0; }\n\n  void Seek(size_t a) final { i_ = a; }\n\n  void SetValue(const Arc &arc) final {\n    const auto &oarc = state_->GetArc(i_);\n    if (oarc.ilabel != oarc.olabel) *properties_ &= ~kNotAcceptor;\n    if (oarc.ilabel == 0) {\n      *properties_ &= ~kIEpsilons;\n      if (oarc.olabel == 0) *properties_ &= ~kEpsilons;\n    }\n    if (oarc.olabel == 0) *properties_ &= ~kOEpsilons;\n    if (oarc.weight != Weight::Zero() && oarc.weight != Weight::One()) {\n      *properties_ &= ~kWeighted;\n    }\n    state_->SetArc(arc, i_);\n    if (arc.ilabel != arc.olabel) {\n      *properties_ |= kNotAcceptor;\n      *properties_ &= ~kAcceptor;\n    }\n    if (arc.ilabel == 0) {\n      *properties_ |= kIEpsilons;\n      *properties_ &= ~kNoIEpsilons;\n      if (arc.olabel == 0) {\n        *properties_ |= kEpsilons;\n        *properties_ &= ~kNoEpsilons;\n      }\n    }\n    if (arc.olabel == 0) {\n      *properties_ |= kOEpsilons;\n      *properties_ &= ~kNoOEpsilons;\n    }\n    if (arc.weight != Weight::Zero() && arc.weight != Weight::One()) {\n      *properties_ |= kWeighted;\n      *properties_ &= ~kUnweighted;\n    }\n    *properties_ &= kSetArcProperties | kAcceptor | kNotAcceptor | kEpsilons |\n                    kNoEpsilons | kIEpsilons | kNoIEpsilons | kOEpsilons |\n                    kNoOEpsilons | kWeighted | kUnweighted;\n  }\n\n  uint32 Flags() const final { return kArcValueFlags; }\n\n  void SetFlags(uint32, uint32) final {}\n\n private:\n  State *state_;\n  uint64 *properties_;\n  size_t i_;\n};\n\n// Provides information needed for the generic mutable arc iterator.\ntemplate <class Arc, class State>\ninline void VectorFst<Arc, State>::InitMutableArcIterator(\n    StateId s, MutableArcIteratorData<Arc> *data) {\n  data->base = new MutableArcIterator<VectorFst<Arc, State>>(this, s);\n}\n\n// A useful alias when using StdArc.\nusing StdVectorFst = VectorFst<StdArc>;\n\n}  // namespace fst\n\n#endif  // FST_VECTOR_FST_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/verify.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Function to verify an FST's contents.\n\n#ifndef FST_VERIFY_H_\n#define FST_VERIFY_H_\n\n#include <fst/log.h>\n\n#include <fst/fst.h>\n#include <fst/test-properties.h>\n\n\nnamespace fst {\n\n// Verifies that an Fst's contents are sane.\ntemplate <class Arc>\nbool Verify(const Fst<Arc> &fst, bool allow_negative_labels = false) {\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n  const auto start = fst.Start();\n  const auto *isyms = fst.InputSymbols();\n  const auto *osyms = fst.OutputSymbols();\n  // Count states\n  StateId ns = 0;\n  for (StateIterator<Fst<Arc>> siter(fst); !siter.Done(); siter.Next()) ++ns;\n  if (start == kNoStateId && ns > 0) {\n    LOG(ERROR) << \"Verify: FST start state ID not set\";\n    return false;\n  } else if (start >= ns) {\n    LOG(ERROR) << \"Verify: FST start state ID exceeds number of states\";\n    return false;\n  }\n  for (StateIterator<Fst<Arc>> siter(fst); !siter.Done(); siter.Next()) {\n    auto state = siter.Value();\n    size_t na = 0;\n    for (ArcIterator<Fst<Arc>> aiter(fst, state); !aiter.Done(); aiter.Next()) {\n      const auto &arc = aiter.Value();\n      if (!allow_negative_labels && arc.ilabel < 0) {\n        LOG(ERROR) << \"Verify: FST input label ID of arc at position \" << na\n                   << \" of state \" << state << \" is negative\";\n        return false;\n      } else if (isyms && isyms->Find(arc.ilabel) == \"\") {\n        LOG(ERROR) << \"Verify: FST input label ID \" << arc.ilabel\n                   << \" of arc at position \" << na << \" of state \" << state\n                   << \" is missing from input symbol table \\\"\" << isyms->Name()\n                   << \"\\\"\";\n        return false;\n      } else if (!allow_negative_labels && arc.olabel < 0) {\n        LOG(ERROR) << \"Verify: FST output label ID of arc at position \" << na\n                   << \" of state \" << state << \" is negative\";\n        return false;\n      } else if (osyms && osyms->Find(arc.olabel) == \"\") {\n        LOG(ERROR) << \"Verify: FST output label ID \" << arc.olabel\n                   << \" of arc at position \" << na << \" of state \" << state\n                   << \" is missing from output symbol table \\\"\" << osyms->Name()\n                   << \"\\\"\";\n        return false;\n      } else if (!arc.weight.Member()) {\n        LOG(ERROR) << \"Verify: FST weight of arc at position \" << na\n                   << \" of state \" << state << \" is invalid\";\n        return false;\n      } else if (arc.nextstate < 0) {\n        LOG(ERROR) << \"Verify: FST destination state ID of arc at position \"\n                   << na << \" of state \" << state << \" is negative\";\n        return false;\n      } else if (arc.nextstate >= ns) {\n        LOG(ERROR) << \"Verify: FST destination state ID of arc at position \"\n                   << na << \" of state \" << state\n                   << \" exceeds number of states\";\n        return false;\n      }\n      ++na;\n    }\n    if (!fst.Final(state).Member()) {\n      LOG(ERROR) << \"Verify: FST final weight of state \" << state\n                 << \" is invalid\";\n      return false;\n    }\n  }\n  const auto fst_props = fst.Properties(kFstProperties, false);\n  if (fst_props & kError) {\n    LOG(ERROR) << \"Verify: FST error property is set\";\n    return false;\n  }\n  uint64 known_props;\n  uint64 test_props =\n      ComputeProperties(fst, kFstProperties, &known_props, false);\n  if (!CompatProperties(fst_props, test_props)) {\n    LOG(ERROR) << \"Verify: Stored FST properties incorrect \"\n               << \"(props1 = stored props, props2 = tested)\";\n    return false;\n  } else {\n    return true;\n  }\n}\n\n}  // namespace fst\n\n#endif  // FST_VERIFY_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/visit.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Queue-dependent visitation of finite-state transducers. See also dfs-visit.h.\n\n#ifndef FST_VISIT_H_\n#define FST_VISIT_H_\n\n\n#include <fst/arcfilter.h>\n#include <fst/mutable-fst.h>\n\n\nnamespace fst {\n\n// Visitor Interface: class determining actions taken during a visit. If any of\n// the boolean member functions return false, the visit is aborted by first\n// calling FinishState() on all unfinished (grey) states and then calling\n// FinishVisit().\n//\n// Note this is more general than the visitor interface in dfs-visit.h but lacks\n// some DFS-specific behavior.\n//\n// template <class Arc>\n// class Visitor {\n//  public:\n//   using StateId = typename Arc::StateId;\n//\n//   Visitor(T *return_data);\n//\n//   // Invoked before visit.\n//   void InitVisit(const Fst<Arc> &fst);\n//\n//   // Invoked when state discovered (2nd arg is visitation root).\n//   bool InitState(StateId s, StateId root);\n//\n//   // Invoked when arc to white/undiscovered state examined.\n//   bool WhiteArc(StateId s, const Arc &arc);\n//\n//   // Invoked when arc to grey/unfinished state examined.\n//   bool GreyArc(StateId s, const Arc &arc);\n//\n//   // Invoked when arc to black/finished state examined.\n//   bool BlackArc(StateId s, const Arc &arc);\n//\n//   // Invoked when state finished.\n//   void FinishState(StateId s);\n//\n//   // Invoked after visit.\n//   void FinishVisit();\n// };\n\n// Performs queue-dependent visitation. Visitor class argument determines\n// actions and contains any return data. ArcFilter determines arcs that are\n// considered. If 'access_only' is true, performs visitation only to states\n// accessible from the initial state.\ntemplate <class FST, class Visitor, class Queue, class ArcFilter>\nvoid Visit(const FST &fst, Visitor *visitor, Queue *queue, ArcFilter filter,\n           bool access_only = false) {\n  using Arc = typename FST::Arc;\n  using StateId = typename Arc::StateId;\n  visitor->InitVisit(fst);\n  const auto start = fst.Start();\n  if (start == kNoStateId) {\n    visitor->FinishVisit();\n    return;\n  }\n  // An FST's state's visit color.\n  static constexpr uint8 kWhiteState = 0x01;  // Undiscovered.\n  static constexpr uint8 kGreyState = 0x02;   // Discovered & unfinished.\n  static constexpr uint8 kBlackState = 0x04;  // Finished.\n  // We destroy an iterator as soon as possible and mark it so.\n  static constexpr uint8 kArcIterDone = 0x08;\n  std::vector<uint8> state_status;\n  std::vector<ArcIterator<FST> *> arc_iterator;\n  MemoryPool<ArcIterator<FST>> aiter_pool;\n  StateId nstates = start + 1;  // Number of known states in general case.\n  bool expanded = false;\n  if (fst.Properties(kExpanded, false)) {  // Tests if expanded, then uses\n    nstates = CountStates(fst);            // ExpandedFst::NumStates().\n    expanded = true;\n  }\n  state_status.resize(nstates, kWhiteState);\n  arc_iterator.resize(nstates);\n  StateIterator<Fst<Arc>> siter(fst);\n  // Continues visit while true.\n  bool visit = true;\n  // Iterates over trees in visit forest.\n  for (auto root = start; visit && root < nstates;) {\n    visit = visitor->InitState(root, root);\n    state_status[root] = kGreyState;\n    queue->Enqueue(root);\n    while (!queue->Empty()) {\n      auto state = queue->Head();\n      if (state >= state_status.size()) {\n        nstates = state + 1;\n        state_status.resize(nstates, kWhiteState);\n        arc_iterator.resize(nstates);\n      }\n      // Creates arc iterator if needed.\n      if (!arc_iterator[state] && !(state_status[state] & kArcIterDone) &&\n          visit) {\n        arc_iterator[state] = new (&aiter_pool) ArcIterator<FST>(fst, state);\n      }\n      // Deletes arc iterator if done.\n      auto *aiter = arc_iterator[state];\n      if ((aiter && aiter->Done()) || !visit) {\n        Destroy(aiter, &aiter_pool);\n        arc_iterator[state] = nullptr;\n        state_status[state] |= kArcIterDone;\n      }\n      // Dequeues state and marks black if done.\n      if (state_status[state] & kArcIterDone) {\n        queue->Dequeue();\n        visitor->FinishState(state);\n        state_status[state] = kBlackState;\n        continue;\n      }\n      const auto &arc = aiter->Value();\n      if (arc.nextstate >= state_status.size()) {\n        nstates = arc.nextstate + 1;\n        state_status.resize(nstates, kWhiteState);\n        arc_iterator.resize(nstates);\n      }\n      // Visits respective arc types.\n      if (filter(arc)) {\n        // Enqueues destination state and marks grey if white.\n        if (state_status[arc.nextstate] == kWhiteState) {\n          visit = visitor->WhiteArc(state, arc);\n          if (!visit) continue;\n          visit = visitor->InitState(arc.nextstate, root);\n          state_status[arc.nextstate] = kGreyState;\n          queue->Enqueue(arc.nextstate);\n        } else if (state_status[arc.nextstate] == kBlackState) {\n          visit = visitor->BlackArc(state, arc);\n        } else {\n          visit = visitor->GreyArc(state, arc);\n        }\n      }\n      aiter->Next();\n      // Destroys an iterator ASAP for efficiency.\n      if (aiter->Done()) {\n        Destroy(aiter, &aiter_pool);\n        arc_iterator[state] = nullptr;\n        state_status[state] |= kArcIterDone;\n      }\n    }\n    if (access_only) break;\n    // Finds next tree root.\n    for (root = (root == start) ? 0 : root + 1;\n         root < nstates && state_status[root] != kWhiteState; ++root) {\n    }\n    // Check for a state beyond the largest known state.\n    if (!expanded && root == nstates) {\n      for (; !siter.Done(); siter.Next()) {\n        if (siter.Value() == nstates) {\n          ++nstates;\n          state_status.push_back(kWhiteState);\n          arc_iterator.push_back(nullptr);\n          break;\n        }\n      }\n    }\n  }\n  visitor->FinishVisit();\n}\n\ntemplate <class Arc, class Visitor, class Queue>\ninline void Visit(const Fst<Arc> &fst, Visitor *visitor, Queue *queue) {\n  Visit(fst, visitor, queue, AnyArcFilter<Arc>());\n}\n\n// Copies input FST to mutable FST following queue order.\ntemplate <class A>\nclass CopyVisitor {\n public:\n  using Arc = A;\n  using StateId = typename Arc::StateId;\n\n  explicit CopyVisitor(MutableFst<Arc> *ofst) : ifst_(nullptr), ofst_(ofst) {}\n\n  void InitVisit(const Fst<A> &ifst) {\n    ifst_ = &ifst;\n    ofst_->DeleteStates();\n    ofst_->SetStart(ifst_->Start());\n  }\n\n  bool InitState(StateId state, StateId) {\n    while (ofst_->NumStates() <= state) ofst_->AddState();\n    return true;\n  }\n\n  bool WhiteArc(StateId state, const Arc &arc) {\n    ofst_->AddArc(state, arc);\n    return true;\n  }\n\n  bool GreyArc(StateId state, const Arc &arc) {\n    ofst_->AddArc(state, arc);\n    return true;\n  }\n\n  bool BlackArc(StateId state, const Arc &arc) {\n    ofst_->AddArc(state, arc);\n    return true;\n  }\n\n  void FinishState(StateId state) {\n    ofst_->SetFinal(state, ifst_->Final(state));\n  }\n\n  void FinishVisit() {}\n\n private:\n  const Fst<Arc> *ifst_;\n  MutableFst<Arc> *ofst_;\n};\n\n// Visits input FST up to a state limit following queue order.\ntemplate <class A>\nclass PartialVisitor {\n public:\n  using Arc = A;\n  using StateId = typename Arc::StateId;\n\n  explicit PartialVisitor(StateId maxvisit)\n      : fst_(nullptr), maxvisit_(maxvisit) {}\n\n  void InitVisit(const Fst<A> &ifst) {\n    fst_ = &ifst;\n    ninit_ = 0;\n    nfinish_ = 0;\n  }\n\n  bool InitState(StateId state, StateId root) {\n    ++ninit_;\n    return ninit_ <= maxvisit_;\n  }\n\n  bool WhiteArc(StateId state, const Arc &arc) { return true; }\n\n  bool GreyArc(StateId state, const Arc &arc) { return true; }\n\n  bool BlackArc(StateId state, const Arc &arc) { return true; }\n\n  void FinishState(StateId state) {\n    fst_->Final(state);  // Visits super-final arc.\n    ++nfinish_;\n  }\n\n  void FinishVisit() {}\n\n  StateId NumInitialized() { return ninit_; }\n\n  StateId NumFinished() { return nfinish_; }\n\n private:\n  const Fst<Arc> *fst_;\n  StateId maxvisit_;\n  StateId ninit_;\n  StateId nfinish_;\n};\n\n// Copies input FST to mutable FST up to a state limit following queue order.\ntemplate <class A>\nclass PartialCopyVisitor : public CopyVisitor<A> {\n public:\n  using Arc = A;\n  using StateId = typename Arc::StateId;\n\n  using CopyVisitor<A>::WhiteArc;\n\n  PartialCopyVisitor(MutableFst<Arc> *ofst, StateId maxvisit,\n                     bool copy_grey = true, bool copy_black = true)\n      : CopyVisitor<A>(ofst), maxvisit_(maxvisit),\n        copy_grey_(copy_grey), copy_black_(copy_black) {}\n\n  void InitVisit(const Fst<A> &ifst) {\n    CopyVisitor<A>::InitVisit(ifst);\n    ninit_ = 0;\n    nfinish_ = 0;\n  }\n\n  bool InitState(StateId state, StateId root) {\n    CopyVisitor<A>::InitState(state, root);\n    ++ninit_;\n    return ninit_ <= maxvisit_;\n  }\n\n  bool GreyArc(StateId state, const Arc &arc) {\n    if (copy_grey_) return CopyVisitor<A>::GreyArc(state, arc);\n    return true;\n  }\n\n  bool BlackArc(StateId state, const Arc &arc) {\n    if (copy_black_) return CopyVisitor<A>::BlackArc(state, arc);\n    return true;\n  }\n\n  void FinishState(StateId state) {\n    CopyVisitor<A>::FinishState(state);\n    ++nfinish_;\n  }\n\n  void FinishVisit() {}\n\n  StateId NumInitialized() { return ninit_; }\n\n  StateId NumFinished() { return nfinish_; }\n\n private:\n  StateId maxvisit_;\n  StateId ninit_;\n  StateId nfinish_;\n  const bool copy_grey_;\n  const bool copy_black_;\n};\n\n}  // namespace fst\n\n#endif  // FST_VISIT_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/include/fst/weight.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// General weight set and associated semiring operation definitions.\n\n#ifndef FST_WEIGHT_H_\n#define FST_WEIGHT_H_\n\n#include <cctype>\n#include <cmath>\n#include <iostream>\n#include <sstream>\n#include <type_traits>\n#include <utility>\n\n#include <fst/compat.h>\n#include <fst/log.h>\n\n#include <fst/util.h>\n\n\nDECLARE_string(fst_weight_parentheses);\nDECLARE_string(fst_weight_separator);\n\nnamespace fst {\n\n// A semiring is specified by two binary operations Plus and Times and two\n// designated elements Zero and One with the following properties:\n//\n//   Plus: associative, commutative, and has Zero as its identity.\n//\n//   Times: associative and has identity One, distributes w.r.t. Plus, and\n//     has Zero as an annihilator:\n//          Times(Zero(), a) == Times(a, Zero()) = Zero().\n//\n// A left semiring distributes on the left; a right semiring is similarly\n// defined.\n//\n// A Weight class must have binary functions Plus and Times and static member\n// functions Zero() and One() and these must form (at least) a left or right\n// semiring.\n//\n// In addition, the following should be defined for a Weight:\n//\n//   Member: predicate on set membership.\n//\n//   NoWeight: static member function that returns an element that is\n//      not a set member; used to signal an error.\n//\n//   >>: reads textual representation of a weight.\n//\n//   <<: prints textual representation of a weight.\n//\n//   Read(istream &istrm): reads binary representation of a weight.\n//\n//   Write(ostream &ostrm): writes binary representation of a weight.\n//\n//   Hash: maps weight to size_t.\n//\n//   ApproxEqual: approximate equality (for inexact weights)\n//\n//   Quantize: quantizes w.r.t delta (for inexact weights)\n//\n//   Divide: for all a, b, c s.t. Times(a, b) == c\n//\n//     --> b' = Divide(c, a, DIVIDE_LEFT) if a left semiring, b'.Member()\n//      and Times(a, b') == c\n//     --> a' = Divide(c, b, DIVIDE_RIGHT) if a right semiring, a'.Member()\n//      and Times(a', b) == c\n//     --> b' = Divide(c, a) = Divide(c, a, DIVIDE_ANY) =\n//      Divide(c, a, DIVIDE_LEFT) = Divide(c, a, DIVIDE_RIGHT) if a\n//      commutative semiring, b'.Member() and Times(a, b') = Times(b', a) = c\n//\n//   ReverseWeight: the type of the corresponding reverse weight.\n//\n//     Typically the same type as Weight for a (both left and right) semiring.\n//     For the left string semiring, it is the right string semiring.\n//\n//   Reverse: a mapping from Weight to ReverseWeight s.t.\n//\n//     --> Reverse(Reverse(a)) = a\n//     --> Reverse(Plus(a, b)) = Plus(Reverse(a), Reverse(b))\n//     --> Reverse(Times(a, b)) = Times(Reverse(b), Reverse(a))\n//     Typically the identity mapping in a (both left and right) semiring.\n//     In the left string semiring, it maps to the reverse string in the right\n//     string semiring.\n//\n//   Properties: specifies additional properties that hold:\n//      LeftSemiring: indicates weights form a left semiring.\n//      RightSemiring: indicates weights form a right semiring.\n//      Commutative: for all a,b: Times(a,b) == Times(b,a)\n//      Idempotent: for all a: Plus(a, a) == a.\n//      Path: for all a, b: Plus(a, b) == a or Plus(a, b) == b.\n\n// CONSTANT DEFINITIONS\n\n// A representable float near .001.\nconstexpr float kDelta = 1.0F / 1024.0F;\n\n// For all a, b, c: Times(c, Plus(a, b)) = Plus(Times(c, a), Times(c, b)).\nconstexpr uint64 kLeftSemiring = 0x0000000000000001ULL;\n\n// For all a, b, c: Times(Plus(a, b), c) = Plus(Times(a, c), Times(b, c)).\nconstexpr uint64 kRightSemiring = 0x0000000000000002ULL;\n\nconstexpr uint64 kSemiring = kLeftSemiring | kRightSemiring;\n\n// For all a, b: Times(a, b) = Times(b, a).\nconstexpr uint64 kCommutative = 0x0000000000000004ULL;\n\n// For all a: Plus(a, a) = a.\nconstexpr uint64 kIdempotent = 0x0000000000000008ULL;\n\n// For all a, b: Plus(a, b) = a or Plus(a, b) = b.\nconstexpr uint64 kPath = 0x0000000000000010ULL;\n\n// For random weight generation: default number of distinct weights.\n// This is also used for a few other weight generation defaults.\nconstexpr size_t kNumRandomWeights = 5;\n\n// Weight property boolean constants needed for SFINAE.\n\ntemplate <class W>\nusing IsIdempotent = std::integral_constant<bool,\n    (W::Properties() & kIdempotent) != 0>;\n\ntemplate <class W>\nusing IsPath = std::integral_constant<bool, (W::Properties() & kPath) != 0>;\n\n// Determines direction of division.\nenum DivideType {\n  DIVIDE_LEFT,   // left division\n  DIVIDE_RIGHT,  // right division\n  DIVIDE_ANY\n};  // division in a commutative semiring\n\n// NATURAL ORDER\n//\n// By definition:\n//\n//                 a <= b iff a + b = a\n//\n// The natural order is a negative partial order iff the semiring is\n// idempotent. It is trivially monotonic for plus. It is left\n// (resp. right) monotonic for times iff the semiring is left\n// (resp. right) distributive. It is a total order iff the semiring\n// has the path property.\n//\n// For more information, see:\n//\n// Mohri, M. 2002. Semiring framework and algorithms for shortest-distance\n// problems, Journal of Automata, Languages and\n// Combinatorics 7(3): 321-350, 2002.\n//\n// We define the strict version of this order below.\n\n// Declares the template with a second parameter determining whether or not it\n// can actually be constructed.\ntemplate <class W, class IdempotentType = void>\nclass NaturalLess;\n\n// Variant for idempotent weights.\ntemplate <class W>\nclass NaturalLess<W, typename std::enable_if<IsIdempotent<W>::value>::type> {\n public:\n  using Weight = W;\n\n  NaturalLess() {}\n\n  bool operator()(const Weight &w1, const Weight &w2) const {\n    return w1 != w2 && Plus(w1, w2) == w1;\n  }\n};\n\n// Non-constructible variant for non-idempotent weights.\ntemplate <class W>\nclass NaturalLess<W, typename std::enable_if<!IsIdempotent<W>::value>::type> {\n public:\n  using Weight = W;\n\n  // TODO(kbg): Trace down anywhere this is being instantiated, then add a\n  // static_assert to prevent this from being instantiated.\n  NaturalLess() {\n    FSTERROR() << \"NaturalLess: Weight type is not idempotent: \" << W::Type();\n  }\n\n  bool operator()(const Weight &, const Weight &) const { return false; }\n};\n\n// Power is the iterated product for arbitrary semirings such that Power(w, 0)\n// is One() for the semiring, and Power(w, n) = Times(Power(w, n - 1), w).\ntemplate <class Weight>\nWeight Power(const Weight &weight, size_t n) {\n  auto result = Weight::One();\n  for (size_t i = 0; i < n; ++i) result = Times(result, weight);\n  return result;\n}\n\n// Simple default adder class. Specializations might be more complex.\ntemplate <class Weight>\nclass Adder {\n public:\n  explicit Adder(Weight w = Weight::Zero()) : sum_(w) { }\n\n  Weight Add(const Weight &w) {\n    sum_ = Plus(sum_, w);\n    return sum_;\n  }\n\n  Weight Sum() { return sum_; }\n\n  void Reset(Weight w = Weight::Zero()) { sum_ = w; }\n\n private:\n  Weight sum_;\n};\n\n// General weight converter: raises error.\ntemplate <class W1, class W2>\nstruct WeightConvert {\n  W2 operator()(W1 w1) const {\n    FSTERROR() << \"WeightConvert: Can't convert weight from \\\"\" << W1::Type()\n               << \"\\\" to \\\"\" << W2::Type();\n    return W2::NoWeight();\n  }\n};\n\n// Specialized weight converter to self.\ntemplate <class W>\nstruct WeightConvert<W, W> {\n  W operator()(W weight) const { return weight; }\n};\n\n// General random weight generator: raises error.\ntemplate <class W>\nstruct WeightGenerate {\n  W operator()() const {\n    FSTERROR() << \"WeightGenerate: No random generator for \" << W::Type();\n    return W::NoWeight();\n  }\n};\n\nnamespace internal {\n\nclass CompositeWeightIO {\n public:\n  CompositeWeightIO();\n  CompositeWeightIO(char separator, std::pair<char, char> parentheses);\n\n  std::pair<char, char> parentheses() const {\n    return {open_paren_, close_paren_};\n  }\n  char separator() const { return separator_; }\n\n  bool error() const { return error_; }\n\n protected:\n  const char separator_;\n  const char open_paren_;\n  const char close_paren_;\n\n private:\n  bool error_;\n};\n\n}  // namespace internal\n\n// Helper class for writing textual composite weights.\nclass CompositeWeightWriter : public internal::CompositeWeightIO {\n public:\n  // Uses configuration from flags (FLAGS_fst_weight_separator,\n  // FLAGS_fst_weight_parentheses).\n  explicit CompositeWeightWriter(std::ostream &ostrm);\n\n  // parentheses defines the opening and closing parenthesis characters.\n  // Set parentheses = {0, 0} to disable writing parenthesis.\n  CompositeWeightWriter(std::ostream &ostrm, char separator,\n                        std::pair<char, char> parentheses);\n\n  CompositeWeightWriter(const CompositeWeightWriter &) = delete;\n  CompositeWeightWriter &operator=(const CompositeWeightWriter &) = delete;\n\n  // Writes open parenthesis to a stream if option selected.\n  void WriteBegin();\n\n  // Writes element to a stream.\n  template <class T>\n  void WriteElement(const T &comp) {\n    if (i_++ > 0) ostrm_ << separator_;\n    ostrm_ << comp;\n  }\n\n  // Writes close parenthesis to a stream if option selected.\n  void WriteEnd();\n\n private:\n  std::ostream &ostrm_;\n  int i_ = 0;  // Element position.\n};\n\n// Helper class for reading textual composite weights. Elements are separated by\n// a separator character. There must be at least one element per textual\n// representation.  Parentheses characters should be set if the composite\n// weights themselves contain composite weights to ensure proper parsing.\nclass CompositeWeightReader : public internal::CompositeWeightIO {\n public:\n  // Uses configuration from flags (FLAGS_fst_weight_separator,\n  // FLAGS_fst_weight_parentheses).\n  explicit CompositeWeightReader(std::istream &istrm);\n\n  // parentheses defines the opening and closing parenthesis characters.\n  // Set parentheses = {0, 0} to disable reading parenthesis.\n  CompositeWeightReader(std::istream &istrm, char separator,\n                        std::pair<char, char> parentheses);\n\n  CompositeWeightReader(const CompositeWeightReader &) = delete;\n  CompositeWeightReader &operator=(const CompositeWeightReader &) = delete;\n\n  // Reads open parenthesis from a stream if option selected.\n  void ReadBegin();\n\n  // Reads element from a stream. The second argument, when true, indicates that\n  // this will be the last element (allowing more forgiving formatting of the\n  // last element). Returns false when last element is read.\n  template <class T>\n  bool ReadElement(T *comp, bool last = false);\n\n  // Finalizes reading.\n  void ReadEnd();\n\n private:\n  std::istream &istrm_;  // Input stream.\n  int c_ = 0;            // Last character read, or EOF.\n  int depth_ = 0;        // Weight parentheses depth.\n};\n\ntemplate <class T>\ninline bool CompositeWeightReader::ReadElement(T *comp, bool last) {\n  string s;\n  const bool has_parens = open_paren_ != 0;\n  while ((c_ != std::istream::traits_type::eof()) && !std::isspace(c_) &&\n         (c_ != separator_ || depth_ > 1 || last) &&\n         (c_ != close_paren_ || depth_ != 1)) {\n    s += c_;\n    // If parentheses encountered before separator, they must be matched.\n    if (has_parens && c_ == open_paren_) {\n      ++depth_;\n    } else if (has_parens && c_ == close_paren_) {\n      // Failure on unmatched parentheses.\n      if (depth_ == 0) {\n        FSTERROR() << \"CompositeWeightReader: Unmatched close paren: \"\n                   << \"Is the fst_weight_parentheses flag set correctly?\";\n        istrm_.clear(std::ios::badbit);\n        return false;\n      }\n      --depth_;\n    }\n    c_ = istrm_.get();\n  }\n  if (s.empty()) {\n    FSTERROR() << \"CompositeWeightReader: Empty element: \"\n               << \"Is the fst_weight_parentheses flag set correctly?\";\n    istrm_.clear(std::ios::badbit);\n    return false;\n  }\n  std::istringstream istrm(s);\n  istrm >> *comp;\n  // Skips separator/close parenthesis.\n  if (c_ != std::istream::traits_type::eof() && !std::isspace(c_)) {\n    c_ = istrm_.get();\n  }\n  const bool is_eof = c_ == std::istream::traits_type::eof();\n  // Clears fail bit if just EOF.\n  if (is_eof && !istrm_.bad()) istrm_.clear(std::ios::eofbit);\n  return !is_eof && !std::isspace(c_);\n}\n\n}  // namespace fst\n\n#endif  // FST_WEIGHT_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/lib/Makefile.am",
    "content": "AM_CPPFLAGS = -I$(srcdir)/../include $(ICU_CPPFLAGS)\n\nlib_LTLIBRARIES = libfst.la\nlibfst_la_SOURCES = compat.cc flags.cc fst.cc fst-types.cc mapped-file.cc \\\n                    properties.cc symbol-table.cc symbol-table-ops.cc \\\n                    weight.cc util.cc\nlibfst_la_LDFLAGS = -version-info 10:0:0\nlibfst_la_LIBADD = $(DL_LIBS)\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/lib/Makefile.in",
    "content": "# Makefile.in generated by automake 1.14.1 from Makefile.am.\n# @configure_input@\n\n# Copyright (C) 1994-2013 Free Software Foundation, Inc.\n\n# This Makefile.in is free software; the Free Software Foundation\n# gives unlimited permission to copy and/or distribute it,\n# with or without modifications, as long as this notice is preserved.\n\n# This program is distributed in the hope that it will be useful,\n# but WITHOUT ANY WARRANTY, to the extent permitted by law; without\n# even the implied warranty of MERCHANTABILITY or FITNESS FOR A\n# PARTICULAR PURPOSE.\n\n@SET_MAKE@\n\nVPATH = @srcdir@\nam__is_gnu_make = test -n '$(MAKEFILE_LIST)' && test -n '$(MAKELEVEL)'\nam__make_running_with_option = \\\n  case $${target_option-} in \\\n      ?) ;; \\\n      *) echo \"am__make_running_with_option: internal error: invalid\" \\\n              \"target option '$${target_option-}' specified\" >&2; \\\n         exit 1;; \\\n  esac; \\\n  has_opt=no; \\\n  sane_makeflags=$$MAKEFLAGS; \\\n  if $(am__is_gnu_make); then \\\n    sane_makeflags=$$MFLAGS; \\\n  else \\\n    case $$MAKEFLAGS in \\\n      *\\\\[\\ \\\t]*) \\\n        bs=\\\\; \\\n        sane_makeflags=`printf '%s\\n' \"$$MAKEFLAGS\" \\\n          | sed \"s/$$bs$$bs[$$bs $$bs\t]*//g\"`;; \\\n    esac; \\\n  fi; \\\n  skip_next=no; \\\n  strip_trailopt () \\\n  { \\\n    flg=`printf '%s\\n' \"$$flg\" | sed \"s/$$1.*$$//\"`; \\\n  }; \\\n  for flg in $$sane_makeflags; do \\\n    test $$skip_next = yes && { skip_next=no; continue; }; \\\n    case $$flg in \\\n      *=*|--*) continue;; \\\n        -*I) strip_trailopt 'I'; skip_next=yes;; \\\n      -*I?*) strip_trailopt 'I';; \\\n        -*O) strip_trailopt 'O'; skip_next=yes;; \\\n      -*O?*) strip_trailopt 'O';; \\\n        -*l) strip_trailopt 'l'; skip_next=yes;; \\\n      -*l?*) strip_trailopt 'l';; \\\n      -[dEDm]) skip_next=yes;; \\\n      -[JT]) skip_next=yes;; \\\n    esac; \\\n    case $$flg in \\\n      *$$target_option*) has_opt=yes; break;; \\\n    esac; \\\n  done; \\\n  test $$has_opt = yes\nam__make_dryrun = (target_option=n; $(am__make_running_with_option))\nam__make_keepgoing = (target_option=k; $(am__make_running_with_option))\npkgdatadir = $(datadir)/@PACKAGE@\npkgincludedir = $(includedir)/@PACKAGE@\npkglibdir = $(libdir)/@PACKAGE@\npkglibexecdir = $(libexecdir)/@PACKAGE@\nam__cd = CDPATH=\"$${ZSH_VERSION+.}$(PATH_SEPARATOR)\" && cd\ninstall_sh_DATA = $(install_sh) -c -m 644\ninstall_sh_PROGRAM = $(install_sh) -c\ninstall_sh_SCRIPT = $(install_sh) -c\nINSTALL_HEADER = $(INSTALL_DATA)\ntransform = $(program_transform_name)\nNORMAL_INSTALL = :\nPRE_INSTALL = :\nPOST_INSTALL = :\nNORMAL_UNINSTALL = :\nPRE_UNINSTALL = :\nPOST_UNINSTALL = :\nbuild_triplet = @build@\nhost_triplet = @host@\nsubdir = src/lib\nDIST_COMMON = $(srcdir)/Makefile.in $(srcdir)/Makefile.am \\\n\t$(top_srcdir)/depcomp\nACLOCAL_M4 = $(top_srcdir)/aclocal.m4\nam__aclocal_m4_deps = $(top_srcdir)/m4/ac_python_devel.m4 \\\n\t$(top_srcdir)/m4/libtool.m4 $(top_srcdir)/m4/ltoptions.m4 \\\n\t$(top_srcdir)/m4/ltsugar.m4 $(top_srcdir)/m4/ltversion.m4 \\\n\t$(top_srcdir)/m4/lt~obsolete.m4 $(top_srcdir)/configure.ac\nam__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \\\n\t$(ACLOCAL_M4)\nmkinstalldirs = $(install_sh) -d\nCONFIG_HEADER = $(top_builddir)/config.h \\\n\t$(top_builddir)/src/include/fst/config.h\nCONFIG_CLEAN_FILES =\nCONFIG_CLEAN_VPATH_FILES =\nam__vpath_adj_setup = srcdirstrip=`echo \"$(srcdir)\" | sed 's|.|.|g'`;\nam__vpath_adj = case $$p in \\\n    $(srcdir)/*) f=`echo \"$$p\" | sed \"s|^$$srcdirstrip/||\"`;; \\\n    *) f=$$p;; \\\n  esac;\nam__strip_dir = f=`echo $$p | sed -e 's|^.*/||'`;\nam__install_max = 40\nam__nobase_strip_setup = \\\n  srcdirstrip=`echo \"$(srcdir)\" | sed 's/[].[^$$\\\\*|]/\\\\\\\\&/g'`\nam__nobase_strip = \\\n  for p in $$list; do echo \"$$p\"; done | sed -e \"s|$$srcdirstrip/||\"\nam__nobase_list = $(am__nobase_strip_setup); \\\n  for p in $$list; do echo \"$$p $$p\"; done | \\\n  sed \"s| $$srcdirstrip/| |;\"' / .*\\//!s/ .*/ ./; s,\\( .*\\)/[^/]*$$,\\1,' | \\\n  $(AWK) 'BEGIN { files[\".\"] = \"\" } { files[$$2] = files[$$2] \" \" $$1; \\\n    if (++n[$$2] == $(am__install_max)) \\\n      { print $$2, files[$$2]; n[$$2] = 0; files[$$2] = \"\" } } \\\n    END { for (dir in files) print dir, files[dir] }'\nam__base_list = \\\n  sed '$$!N;$$!N;$$!N;$$!N;$$!N;$$!N;$$!N;s/\\n/ /g' | \\\n  sed '$$!N;$$!N;$$!N;$$!N;s/\\n/ /g'\nam__uninstall_files_from_dir = { \\\n  test -z \"$$files\" \\\n    || { test ! -d \"$$dir\" && test ! -f \"$$dir\" && test ! -r \"$$dir\"; } \\\n    || { echo \" ( cd '$$dir' && rm -f\" $$files \")\"; \\\n         $(am__cd) \"$$dir\" && rm -f $$files; }; \\\n  }\nam__installdirs = \"$(DESTDIR)$(libdir)\"\nLTLIBRARIES = $(lib_LTLIBRARIES)\nam__DEPENDENCIES_1 =\nlibfst_la_DEPENDENCIES = $(am__DEPENDENCIES_1)\nam_libfst_la_OBJECTS = compat.lo flags.lo fst.lo fst-types.lo \\\n\tmapped-file.lo properties.lo symbol-table.lo \\\n\tsymbol-table-ops.lo weight.lo util.lo\nlibfst_la_OBJECTS = $(am_libfst_la_OBJECTS)\nAM_V_lt = $(am__v_lt_@AM_V@)\nam__v_lt_ = $(am__v_lt_@AM_DEFAULT_V@)\nam__v_lt_0 = --silent\nam__v_lt_1 = \nlibfst_la_LINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \\\n\t$(LIBTOOLFLAGS) --mode=link $(CXXLD) $(AM_CXXFLAGS) \\\n\t$(CXXFLAGS) $(libfst_la_LDFLAGS) $(LDFLAGS) -o $@\nAM_V_P = $(am__v_P_@AM_V@)\nam__v_P_ = $(am__v_P_@AM_DEFAULT_V@)\nam__v_P_0 = false\nam__v_P_1 = :\nAM_V_GEN = $(am__v_GEN_@AM_V@)\nam__v_GEN_ = $(am__v_GEN_@AM_DEFAULT_V@)\nam__v_GEN_0 = @echo \"  GEN     \" $@;\nam__v_GEN_1 = \nAM_V_at = $(am__v_at_@AM_V@)\nam__v_at_ = $(am__v_at_@AM_DEFAULT_V@)\nam__v_at_0 = @\nam__v_at_1 = \nDEFAULT_INCLUDES = \ndepcomp = $(SHELL) $(top_srcdir)/depcomp\nam__depfiles_maybe = depfiles\nam__mv = mv -f\nCXXCOMPILE = $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) \\\n\t$(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS)\nLTCXXCOMPILE = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \\\n\t$(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) \\\n\t$(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) \\\n\t$(AM_CXXFLAGS) $(CXXFLAGS)\nAM_V_CXX = $(am__v_CXX_@AM_V@)\nam__v_CXX_ = $(am__v_CXX_@AM_DEFAULT_V@)\nam__v_CXX_0 = @echo \"  CXX     \" $@;\nam__v_CXX_1 = \nCXXLD = $(CXX)\nCXXLINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \\\n\t$(LIBTOOLFLAGS) --mode=link $(CXXLD) $(AM_CXXFLAGS) \\\n\t$(CXXFLAGS) $(AM_LDFLAGS) $(LDFLAGS) -o $@\nAM_V_CXXLD = $(am__v_CXXLD_@AM_V@)\nam__v_CXXLD_ = $(am__v_CXXLD_@AM_DEFAULT_V@)\nam__v_CXXLD_0 = @echo \"  CXXLD   \" $@;\nam__v_CXXLD_1 = \nSOURCES = $(libfst_la_SOURCES)\nDIST_SOURCES = $(libfst_la_SOURCES)\nam__can_run_installinfo = \\\n  case $$AM_UPDATE_INFO_DIR in \\\n    n|no|NO) false;; \\\n    *) (install-info --version) >/dev/null 2>&1;; \\\n  esac\nam__tagged_files = $(HEADERS) $(SOURCES) $(TAGS_FILES) $(LISP)\n# Read a list of newline-separated strings from the standard input,\n# and print each of them once, without duplicates.  Input order is\n# *not* preserved.\nam__uniquify_input = $(AWK) '\\\n  BEGIN { nonempty = 0; } \\\n  { items[$$0] = 1; nonempty = 1; } \\\n  END { if (nonempty) { for (i in items) print i; }; } \\\n'\n# Make sure the list of sources is unique.  This is necessary because,\n# e.g., the same source file might be shared among _SOURCES variables\n# for different programs/libraries.\nam__define_uniq_tagged_files = \\\n  list='$(am__tagged_files)'; \\\n  unique=`for i in $$list; do \\\n    if test -f \"$$i\"; then echo $$i; else echo $(srcdir)/$$i; fi; \\\n  done | $(am__uniquify_input)`\nETAGS = etags\nCTAGS = ctags\nDISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST)\nACLOCAL = @ACLOCAL@\nAMTAR = @AMTAR@\nAM_DEFAULT_VERBOSITY = @AM_DEFAULT_VERBOSITY@\nAR = @AR@\nAUTOCONF = @AUTOCONF@\nAUTOHEADER = @AUTOHEADER@\nAUTOMAKE = @AUTOMAKE@\nAWK = @AWK@\nCC = @CC@\nCCDEPMODE = @CCDEPMODE@\nCFLAGS = @CFLAGS@\nCPP = @CPP@\nCPPFLAGS = @CPPFLAGS@\nCXX = @CXX@\nCXXCPP = @CXXCPP@\nCXXDEPMODE = @CXXDEPMODE@\nCXXFLAGS = @CXXFLAGS@\nCYGPATH_W = @CYGPATH_W@\nDEFS = @DEFS@\nDEPDIR = @DEPDIR@\nDLLTOOL = @DLLTOOL@\nDL_LIBS = @DL_LIBS@\nDSYMUTIL = @DSYMUTIL@\nDUMPBIN = @DUMPBIN@\nECHO_C = @ECHO_C@\nECHO_N = @ECHO_N@\nECHO_T = @ECHO_T@\nEGREP = @EGREP@\nEXEEXT = @EXEEXT@\nFGREP = @FGREP@\nGREP = @GREP@\nINSTALL = @INSTALL@\nINSTALL_DATA = @INSTALL_DATA@\nINSTALL_PROGRAM = @INSTALL_PROGRAM@\nINSTALL_SCRIPT = @INSTALL_SCRIPT@\nINSTALL_STRIP_PROGRAM = @INSTALL_STRIP_PROGRAM@\nLD = @LD@\nLDFLAGS = @LDFLAGS@\nLIBOBJS = @LIBOBJS@\nLIBS = @LIBS@\nLIBTOOL = @LIBTOOL@\nLIPO = @LIPO@\nLN_S = @LN_S@\nLTLIBOBJS = @LTLIBOBJS@\nMAKEINFO = @MAKEINFO@\nMANIFEST_TOOL = @MANIFEST_TOOL@\nMKDIR_P = @MKDIR_P@\nNM = @NM@\nNMEDIT = @NMEDIT@\nOBJDUMP = @OBJDUMP@\nOBJEXT = @OBJEXT@\nOTOOL = @OTOOL@\nOTOOL64 = @OTOOL64@\nPACKAGE = @PACKAGE@\nPACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@\nPACKAGE_NAME = @PACKAGE_NAME@\nPACKAGE_STRING = @PACKAGE_STRING@\nPACKAGE_TARNAME = @PACKAGE_TARNAME@\nPACKAGE_URL = @PACKAGE_URL@\nPACKAGE_VERSION = @PACKAGE_VERSION@\nPATH_SEPARATOR = @PATH_SEPARATOR@\nPYTHON = @PYTHON@\nPYTHON_CPPFLAGS = @PYTHON_CPPFLAGS@\nPYTHON_EXEC_PREFIX = @PYTHON_EXEC_PREFIX@\nPYTHON_EXTRA_LDFLAGS = @PYTHON_EXTRA_LDFLAGS@\nPYTHON_EXTRA_LIBS = @PYTHON_EXTRA_LIBS@\nPYTHON_LDFLAGS = @PYTHON_LDFLAGS@\nPYTHON_PLATFORM = @PYTHON_PLATFORM@\nPYTHON_PREFIX = @PYTHON_PREFIX@\nPYTHON_SITE_PKG = @PYTHON_SITE_PKG@\nPYTHON_VERSION = @PYTHON_VERSION@\nRANLIB = @RANLIB@\nSED = @SED@\nSET_MAKE = @SET_MAKE@\nSHELL = @SHELL@\nSTRIP = @STRIP@\nVERSION = @VERSION@\nabs_builddir = @abs_builddir@\nabs_srcdir = @abs_srcdir@\nabs_top_builddir = @abs_top_builddir@\nabs_top_srcdir = @abs_top_srcdir@\nac_ct_AR = @ac_ct_AR@\nac_ct_CC = @ac_ct_CC@\nac_ct_CXX = @ac_ct_CXX@\nac_ct_DUMPBIN = @ac_ct_DUMPBIN@\nam__include = @am__include@\nam__leading_dot = @am__leading_dot@\nam__quote = @am__quote@\nam__tar = @am__tar@\nam__untar = @am__untar@\nbindir = @bindir@\nbuild = @build@\nbuild_alias = @build_alias@\nbuild_cpu = @build_cpu@\nbuild_os = @build_os@\nbuild_vendor = @build_vendor@\nbuilddir = @builddir@\ndatadir = @datadir@\ndatarootdir = @datarootdir@\ndocdir = @docdir@\ndvidir = @dvidir@\nexec_prefix = @exec_prefix@\nhost = @host@\nhost_alias = @host_alias@\nhost_cpu = @host_cpu@\nhost_os = @host_os@\nhost_vendor = @host_vendor@\nhtmldir = @htmldir@\nincludedir = @includedir@\ninfodir = @infodir@\ninstall_sh = @install_sh@\nlibdir = @libdir@\nlibexecdir = @libexecdir@\nlibfstdir = @libfstdir@\nlocaledir = @localedir@\nlocalstatedir = @localstatedir@\nmandir = @mandir@\nmkdir_p = @mkdir_p@\noldincludedir = @oldincludedir@\npdfdir = @pdfdir@\npkgpyexecdir = @pkgpyexecdir@\npkgpythondir = @pkgpythondir@\nprefix = @prefix@\nprogram_transform_name = @program_transform_name@\npsdir = @psdir@\npyexecdir = @pyexecdir@\npythondir = @pythondir@\nsbindir = @sbindir@\nsharedstatedir = @sharedstatedir@\nsrcdir = @srcdir@\nsysconfdir = @sysconfdir@\ntarget_alias = @target_alias@\ntop_build_prefix = @top_build_prefix@\ntop_builddir = @top_builddir@\ntop_srcdir = @top_srcdir@\nAM_CPPFLAGS = -I$(srcdir)/../include $(ICU_CPPFLAGS)\nlib_LTLIBRARIES = libfst.la\nlibfst_la_SOURCES = compat.cc flags.cc fst.cc fst-types.cc mapped-file.cc \\\n                    properties.cc symbol-table.cc symbol-table-ops.cc \\\n                    weight.cc util.cc\n\nlibfst_la_LDFLAGS = -version-info 10:0:0\nlibfst_la_LIBADD = $(DL_LIBS)\nall: all-am\n\n.SUFFIXES:\n.SUFFIXES: .cc .lo .o .obj\n$(srcdir)/Makefile.in:  $(srcdir)/Makefile.am  $(am__configure_deps)\n\t@for dep in $?; do \\\n\t  case '$(am__configure_deps)' in \\\n\t    *$$dep*) \\\n\t      ( cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh ) \\\n\t        && { if test -f $@; then exit 0; else break; fi; }; \\\n\t      exit 1;; \\\n\t  esac; \\\n\tdone; \\\n\techo ' cd $(top_srcdir) && $(AUTOMAKE) --foreign src/lib/Makefile'; \\\n\t$(am__cd) $(top_srcdir) && \\\n\t  $(AUTOMAKE) --foreign src/lib/Makefile\n.PRECIOUS: Makefile\nMakefile: $(srcdir)/Makefile.in $(top_builddir)/config.status\n\t@case '$?' in \\\n\t  *config.status*) \\\n\t    cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh;; \\\n\t  *) \\\n\t    echo ' cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe)'; \\\n\t    cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe);; \\\n\tesac;\n\n$(top_builddir)/config.status: $(top_srcdir)/configure $(CONFIG_STATUS_DEPENDENCIES)\n\tcd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh\n\n$(top_srcdir)/configure:  $(am__configure_deps)\n\tcd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh\n$(ACLOCAL_M4):  $(am__aclocal_m4_deps)\n\tcd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh\n$(am__aclocal_m4_deps):\n\ninstall-libLTLIBRARIES: $(lib_LTLIBRARIES)\n\t@$(NORMAL_INSTALL)\n\t@list='$(lib_LTLIBRARIES)'; test -n \"$(libdir)\" || list=; \\\n\tlist2=; for p in $$list; do \\\n\t  if test -f $$p; then \\\n\t    list2=\"$$list2 $$p\"; \\\n\t  else :; fi; \\\n\tdone; \\\n\ttest -z \"$$list2\" || { \\\n\t  echo \" $(MKDIR_P) '$(DESTDIR)$(libdir)'\"; \\\n\t  $(MKDIR_P) \"$(DESTDIR)$(libdir)\" || exit 1; \\\n\t  echo \" $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) $$list2 '$(DESTDIR)$(libdir)'\"; \\\n\t  $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) $$list2 \"$(DESTDIR)$(libdir)\"; \\\n\t}\n\nuninstall-libLTLIBRARIES:\n\t@$(NORMAL_UNINSTALL)\n\t@list='$(lib_LTLIBRARIES)'; test -n \"$(libdir)\" || list=; \\\n\tfor p in $$list; do \\\n\t  $(am__strip_dir) \\\n\t  echo \" $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=uninstall rm -f '$(DESTDIR)$(libdir)/$$f'\"; \\\n\t  $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=uninstall rm -f \"$(DESTDIR)$(libdir)/$$f\"; \\\n\tdone\n\nclean-libLTLIBRARIES:\n\t-test -z \"$(lib_LTLIBRARIES)\" || rm -f $(lib_LTLIBRARIES)\n\t@list='$(lib_LTLIBRARIES)'; \\\n\tlocs=`for p in $$list; do echo $$p; done | \\\n\t      sed 's|^[^/]*$$|.|; s|/[^/]*$$||; s|$$|/so_locations|' | \\\n\t      sort -u`; \\\n\ttest -z \"$$locs\" || { \\\n\t  echo rm -f $${locs}; \\\n\t  rm -f $${locs}; \\\n\t}\n\nlibfst.la: $(libfst_la_OBJECTS) $(libfst_la_DEPENDENCIES) $(EXTRA_libfst_la_DEPENDENCIES) \n\t$(AM_V_CXXLD)$(libfst_la_LINK) -rpath $(libdir) $(libfst_la_OBJECTS) $(libfst_la_LIBADD) $(LIBS)\n\nmostlyclean-compile:\n\t-rm -f *.$(OBJEXT)\n\ndistclean-compile:\n\t-rm -f *.tab.c\n\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/compat.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/flags.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fst-types.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fst.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/mapped-file.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/properties.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/symbol-table-ops.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/symbol-table.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/util.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/weight.Plo@am__quote@\n\n.cc.o:\n@am__fastdepCXX_TRUE@\t$(AM_V_CXX)depbase=`echo $@ | sed 's|[^/]*$$|$(DEPDIR)/&|;s|\\.o$$||'`;\\\n@am__fastdepCXX_TRUE@\t$(CXXCOMPILE) -MT $@ -MD -MP -MF $$depbase.Tpo -c -o $@ $< &&\\\n@am__fastdepCXX_TRUE@\t$(am__mv) $$depbase.Tpo $$depbase.Po\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\t$(AM_V_CXX)source='$<' object='$@' libtool=no @AMDEPBACKSLASH@\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\tDEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@\n@am__fastdepCXX_FALSE@\t$(AM_V_CXX@am__nodep@)$(CXXCOMPILE) -c -o $@ $<\n\n.cc.obj:\n@am__fastdepCXX_TRUE@\t$(AM_V_CXX)depbase=`echo $@ | sed 's|[^/]*$$|$(DEPDIR)/&|;s|\\.obj$$||'`;\\\n@am__fastdepCXX_TRUE@\t$(CXXCOMPILE) -MT $@ -MD -MP -MF $$depbase.Tpo -c -o $@ `$(CYGPATH_W) '$<'` &&\\\n@am__fastdepCXX_TRUE@\t$(am__mv) $$depbase.Tpo $$depbase.Po\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\t$(AM_V_CXX)source='$<' object='$@' libtool=no @AMDEPBACKSLASH@\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\tDEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@\n@am__fastdepCXX_FALSE@\t$(AM_V_CXX@am__nodep@)$(CXXCOMPILE) -c -o $@ `$(CYGPATH_W) '$<'`\n\n.cc.lo:\n@am__fastdepCXX_TRUE@\t$(AM_V_CXX)depbase=`echo $@ | sed 's|[^/]*$$|$(DEPDIR)/&|;s|\\.lo$$||'`;\\\n@am__fastdepCXX_TRUE@\t$(LTCXXCOMPILE) -MT $@ -MD -MP -MF $$depbase.Tpo -c -o $@ $< &&\\\n@am__fastdepCXX_TRUE@\t$(am__mv) $$depbase.Tpo $$depbase.Plo\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\t$(AM_V_CXX)source='$<' object='$@' libtool=yes @AMDEPBACKSLASH@\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\tDEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@\n@am__fastdepCXX_FALSE@\t$(AM_V_CXX@am__nodep@)$(LTCXXCOMPILE) -c -o $@ $<\n\nmostlyclean-libtool:\n\t-rm -f *.lo\n\nclean-libtool:\n\t-rm -rf .libs _libs\n\nID: $(am__tagged_files)\n\t$(am__define_uniq_tagged_files); mkid -fID $$unique\ntags: tags-am\nTAGS: tags\n\ntags-am: $(TAGS_DEPENDENCIES) $(am__tagged_files)\n\tset x; \\\n\there=`pwd`; \\\n\t$(am__define_uniq_tagged_files); \\\n\tshift; \\\n\tif test -z \"$(ETAGS_ARGS)$$*$$unique\"; then :; else \\\n\t  test -n \"$$unique\" || unique=$$empty_fix; \\\n\t  if test $$# -gt 0; then \\\n\t    $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \\\n\t      \"$$@\" $$unique; \\\n\t  else \\\n\t    $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \\\n\t      $$unique; \\\n\t  fi; \\\n\tfi\nctags: ctags-am\n\nCTAGS: ctags\nctags-am: $(TAGS_DEPENDENCIES) $(am__tagged_files)\n\t$(am__define_uniq_tagged_files); \\\n\ttest -z \"$(CTAGS_ARGS)$$unique\" \\\n\t  || $(CTAGS) $(CTAGSFLAGS) $(AM_CTAGSFLAGS) $(CTAGS_ARGS) \\\n\t     $$unique\n\nGTAGS:\n\there=`$(am__cd) $(top_builddir) && pwd` \\\n\t  && $(am__cd) $(top_srcdir) \\\n\t  && gtags -i $(GTAGS_ARGS) \"$$here\"\ncscopelist: cscopelist-am\n\ncscopelist-am: $(am__tagged_files)\n\tlist='$(am__tagged_files)'; \\\n\tcase \"$(srcdir)\" in \\\n\t  [\\\\/]* | ?:[\\\\/]*) sdir=\"$(srcdir)\" ;; \\\n\t  *) sdir=$(subdir)/$(srcdir) ;; \\\n\tesac; \\\n\tfor i in $$list; do \\\n\t  if test -f \"$$i\"; then \\\n\t    echo \"$(subdir)/$$i\"; \\\n\t  else \\\n\t    echo \"$$sdir/$$i\"; \\\n\t  fi; \\\n\tdone >> $(top_builddir)/cscope.files\n\ndistclean-tags:\n\t-rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags\n\ndistdir: $(DISTFILES)\n\t@srcdirstrip=`echo \"$(srcdir)\" | sed 's/[].[^$$\\\\*]/\\\\\\\\&/g'`; \\\n\ttopsrcdirstrip=`echo \"$(top_srcdir)\" | sed 's/[].[^$$\\\\*]/\\\\\\\\&/g'`; \\\n\tlist='$(DISTFILES)'; \\\n\t  dist_files=`for file in $$list; do echo $$file; done | \\\n\t  sed -e \"s|^$$srcdirstrip/||;t\" \\\n\t      -e \"s|^$$topsrcdirstrip/|$(top_builddir)/|;t\"`; \\\n\tcase $$dist_files in \\\n\t  */*) $(MKDIR_P) `echo \"$$dist_files\" | \\\n\t\t\t   sed '/\\//!d;s|^|$(distdir)/|;s,/[^/]*$$,,' | \\\n\t\t\t   sort -u` ;; \\\n\tesac; \\\n\tfor file in $$dist_files; do \\\n\t  if test -f $$file || test -d $$file; then d=.; else d=$(srcdir); fi; \\\n\t  if test -d $$d/$$file; then \\\n\t    dir=`echo \"/$$file\" | sed -e 's,/[^/]*$$,,'`; \\\n\t    if test -d \"$(distdir)/$$file\"; then \\\n\t      find \"$(distdir)/$$file\" -type d ! -perm -700 -exec chmod u+rwx {} \\;; \\\n\t    fi; \\\n\t    if test -d $(srcdir)/$$file && test $$d != $(srcdir); then \\\n\t      cp -fpR $(srcdir)/$$file \"$(distdir)$$dir\" || exit 1; \\\n\t      find \"$(distdir)/$$file\" -type d ! -perm -700 -exec chmod u+rwx {} \\;; \\\n\t    fi; \\\n\t    cp -fpR $$d/$$file \"$(distdir)$$dir\" || exit 1; \\\n\t  else \\\n\t    test -f \"$(distdir)/$$file\" \\\n\t    || cp -p $$d/$$file \"$(distdir)/$$file\" \\\n\t    || exit 1; \\\n\t  fi; \\\n\tdone\ncheck-am: all-am\ncheck: check-am\nall-am: Makefile $(LTLIBRARIES)\ninstalldirs:\n\tfor dir in \"$(DESTDIR)$(libdir)\"; do \\\n\t  test -z \"$$dir\" || $(MKDIR_P) \"$$dir\"; \\\n\tdone\ninstall: install-am\ninstall-exec: install-exec-am\ninstall-data: install-data-am\nuninstall: uninstall-am\n\ninstall-am: all-am\n\t@$(MAKE) $(AM_MAKEFLAGS) install-exec-am install-data-am\n\ninstallcheck: installcheck-am\ninstall-strip:\n\tif test -z '$(STRIP)'; then \\\n\t  $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" \\\n\t    install_sh_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" INSTALL_STRIP_FLAG=-s \\\n\t      install; \\\n\telse \\\n\t  $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" \\\n\t    install_sh_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" INSTALL_STRIP_FLAG=-s \\\n\t    \"INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'\" install; \\\n\tfi\nmostlyclean-generic:\n\nclean-generic:\n\ndistclean-generic:\n\t-test -z \"$(CONFIG_CLEAN_FILES)\" || rm -f $(CONFIG_CLEAN_FILES)\n\t-test . = \"$(srcdir)\" || test -z \"$(CONFIG_CLEAN_VPATH_FILES)\" || rm -f $(CONFIG_CLEAN_VPATH_FILES)\n\nmaintainer-clean-generic:\n\t@echo \"This command is intended for maintainers to use\"\n\t@echo \"it deletes files that may require special tools to rebuild.\"\nclean: clean-am\n\nclean-am: clean-generic clean-libLTLIBRARIES clean-libtool \\\n\tmostlyclean-am\n\ndistclean: distclean-am\n\t-rm -rf ./$(DEPDIR)\n\t-rm -f Makefile\ndistclean-am: clean-am distclean-compile distclean-generic \\\n\tdistclean-tags\n\ndvi: dvi-am\n\ndvi-am:\n\nhtml: html-am\n\nhtml-am:\n\ninfo: info-am\n\ninfo-am:\n\ninstall-data-am:\n\ninstall-dvi: install-dvi-am\n\ninstall-dvi-am:\n\ninstall-exec-am: install-libLTLIBRARIES\n\ninstall-html: install-html-am\n\ninstall-html-am:\n\ninstall-info: install-info-am\n\ninstall-info-am:\n\ninstall-man:\n\ninstall-pdf: install-pdf-am\n\ninstall-pdf-am:\n\ninstall-ps: install-ps-am\n\ninstall-ps-am:\n\ninstallcheck-am:\n\nmaintainer-clean: maintainer-clean-am\n\t-rm -rf ./$(DEPDIR)\n\t-rm -f Makefile\nmaintainer-clean-am: distclean-am maintainer-clean-generic\n\nmostlyclean: mostlyclean-am\n\nmostlyclean-am: mostlyclean-compile mostlyclean-generic \\\n\tmostlyclean-libtool\n\npdf: pdf-am\n\npdf-am:\n\nps: ps-am\n\nps-am:\n\nuninstall-am: uninstall-libLTLIBRARIES\n\n.MAKE: install-am install-strip\n\n.PHONY: CTAGS GTAGS TAGS all all-am check check-am clean clean-generic \\\n\tclean-libLTLIBRARIES clean-libtool cscopelist-am ctags \\\n\tctags-am distclean distclean-compile distclean-generic \\\n\tdistclean-libtool distclean-tags distdir dvi dvi-am html \\\n\thtml-am info info-am install install-am install-data \\\n\tinstall-data-am install-dvi install-dvi-am install-exec \\\n\tinstall-exec-am install-html install-html-am install-info \\\n\tinstall-info-am install-libLTLIBRARIES install-man install-pdf \\\n\tinstall-pdf-am install-ps install-ps-am install-strip \\\n\tinstallcheck installcheck-am installdirs maintainer-clean \\\n\tmaintainer-clean-generic mostlyclean mostlyclean-compile \\\n\tmostlyclean-generic mostlyclean-libtool pdf pdf-am ps ps-am \\\n\ttags tags-am uninstall uninstall-am uninstall-libLTLIBRARIES\n\n\n# Tell versions [3.59,3.63) of GNU make to not export all variables.\n# Otherwise a system limit (for SysV at least) may be exceeded.\n.NOEXPORT:\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/lib/compat.cc",
    "content": "// compat.cc\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n// you may not use this file except in compliance with the License.\n// You may obtain a copy of the License at\n//\n//      http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n// See the License for the specific language governing permissions and\n// limitations under the License.\n//\n// Author: riley@google.com (Michael Riley)\n//\n// \\file\n// Google compatibility definitions.\n\n#include <cstring>\n#include <fst/compat.h>\n\nusing namespace std;\n\nvoid FailedNewHandler() {\n  cerr << \"Memory allocation failed\\n\";\n  exit(1);\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/lib/flags.cc",
    "content": "// Licensed under the Apache License, Version 2.0 (the \"License\");\n// you may not use this file except in compliance with the License.\n// You may obtain a copy of the License at\n//\n//      http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n// See the License for the specific language governing permissions and\n// limitations under the License.\n//\n// Google-style flag handling definitions.\n\n#include <fst/compat.h>\n#include <fst/flags.h>\n\nstatic const char *private_tmpdir = getenv(\"TMPDIR\");\n\nDEFINE_int32(v, 0, \"verbosity level\");\nDEFINE_bool(help, false, \"show usage information\");\nDEFINE_bool(helpshort, false, \"show brief usage information\");\nDEFINE_string(tmpdir, private_tmpdir ? private_tmpdir : \"/tmp\",\n              \"temporary directory\");\n\nusing namespace std;\n\nstatic string flag_usage;\nstatic string prog_src;\n\nvoid SetFlags(const char *usage, int *argc, char ***argv,\n              bool remove_flags, const char *src) {\n  flag_usage = usage;\n  prog_src = src;\n  int index = 1;\n  for (; index < *argc; ++index) {\n    string argval = (*argv)[index];\n    if (argval[0] != '-' || argval == \"-\") break;\n    while (argval[0] == '-') argval = argval.substr(1);  // Removes initial '-'.\n    string arg = argval;\n    string val = \"\";\n    // Splits argval (arg=val) into arg and val.\n    auto pos = argval.find(\"=\");\n    if (pos != string::npos) {\n      arg = argval.substr(0, pos);\n      val = argval.substr(pos + 1);\n    }\n    auto bool_register = FlagRegister<bool>::GetRegister();\n    if (bool_register->SetFlag(arg, val))\n      continue;\n    auto string_register = FlagRegister<string>::GetRegister();\n    if (string_register->SetFlag(arg, val))\n      continue;\n    auto int32_register = FlagRegister<int32>::GetRegister();\n    if (int32_register->SetFlag(arg, val))\n      continue;\n    auto int64_register = FlagRegister<int64>::GetRegister();\n    if (int64_register->SetFlag(arg, val))\n      continue;\n    auto double_register = FlagRegister<double>::GetRegister();\n    if (double_register->SetFlag(arg, val))\n      continue;\n    LOG(FATAL) << \"SetFlags: Bad option: \" << (*argv)[index];\n  }\n  if (remove_flags) {\n    for (auto i = 0; i < *argc - index; ++i) {\n      (*argv)[i + 1] = (*argv)[i + index];\n    }\n    *argc -= index - 1;\n  }\n  if (FLAGS_help) {\n    ShowUsage(true);\n    exit(1);\n  }\n  if (FLAGS_helpshort) {\n    ShowUsage(false);\n    exit(1);\n  }\n}\n\n// If flag is defined in file 'src' and 'in_src' true or is not\n// defined in file 'src' and 'in_src' is false, then print usage.\nstatic void\nShowUsageRestrict(const std::set<pair<string, string>> &usage_set,\n\t\t  const string &src, bool in_src, bool show_file) {\n  string old_file;\n  bool file_out = false;\n  bool usage_out = false;\n  for (const auto &pair : usage_set) {\n    const auto &file = pair.first;\n    const auto &usage = pair.second;\n    bool match = file == src;\n    if ((match && !in_src) || (!match && in_src)) continue;\n    if (file != old_file) {\n      if (show_file) {\n        if (file_out) cout << \"\\n\";\n\t    cout << \"Flags from: \" << file << \"\\n\";\n        file_out = true;\n      }\n      old_file = file;\n    }\n    cout << usage << \"\\n\";\n    usage_out = true;\n  }\n  if (usage_out) cout << \"\\n\";\n}\n\nvoid ShowUsage(bool long_usage) {\n  std::set<pair<string, string>> usage_set;\n  cout << flag_usage << \"\\n\";\n  auto bool_register = FlagRegister<bool>::GetRegister();\n  bool_register->GetUsage(&usage_set);\n  auto string_register = FlagRegister<string>::GetRegister();\n  string_register->GetUsage(&usage_set);\n  auto int32_register = FlagRegister<int32>::GetRegister();\n  int32_register->GetUsage(&usage_set);\n  auto int64_register = FlagRegister<int64>::GetRegister();\n  int64_register->GetUsage(&usage_set);\n  auto double_register = FlagRegister<double>::GetRegister();\n  double_register->GetUsage(&usage_set);\n  if (!prog_src.empty()) {\n    cout << \"PROGRAM FLAGS:\\n\\n\";\n    ShowUsageRestrict(usage_set, prog_src, true, false);\n  }\n  if (!long_usage) return;\n  if (!prog_src.empty()) cout << \"LIBRARY FLAGS:\\n\\n\";\n  ShowUsageRestrict(usage_set, prog_src, false, true);\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/lib/fst-types.cc",
    "content": "// Registration of common Fst and arc types.\n\n#include <fst/arc.h>\n#include <fst/compact-fst.h>\n#include <fst/const-fst.h>\n#include <fst/edit-fst.h>\n#include <fst/register.h>\n#include <fst/vector-fst.h>\n\nnamespace fst {\n\n// Registers VectorFst, ConstFst and EditFst for common arcs types.\nREGISTER_FST(VectorFst, StdArc);\nREGISTER_FST(VectorFst, LogArc);\nREGISTER_FST(VectorFst, Log64Arc);\nREGISTER_FST(ConstFst, StdArc);\nREGISTER_FST(ConstFst, LogArc);\nREGISTER_FST(ConstFst, Log64Arc);\nREGISTER_FST(EditFst, StdArc);\nREGISTER_FST(EditFst, LogArc);\nREGISTER_FST(EditFst, Log64Arc);\n\n// Register CompactFst for common arcs with the default (uint32) size type\nREGISTER_FST(CompactStringFst, StdArc);\nREGISTER_FST(CompactStringFst, LogArc);\nREGISTER_FST(CompactWeightedStringFst, StdArc);\nREGISTER_FST(CompactWeightedStringFst, LogArc);\nREGISTER_FST(CompactAcceptorFst, StdArc);\nREGISTER_FST(CompactAcceptorFst, LogArc);\nREGISTER_FST(CompactUnweightedFst, StdArc);\nREGISTER_FST(CompactUnweightedFst, LogArc);\nREGISTER_FST(CompactUnweightedAcceptorFst, StdArc);\nREGISTER_FST(CompactUnweightedAcceptorFst, LogArc);\n\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/lib/fst.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// FST definitions.\n\n#include <fst/fst.h>\n\n#include <sstream>\n\n#include <fst/flags.h>\n#include <fst/log.h>\n#include <fst/matcher-fst.h>  // declarations of *_lookahead_fst_type\n\n// FST flag definitions.\n\nDEFINE_bool(fst_verify_properties, false,\n            \"Verify FST properties queried by TestProperties\");\n\nDEFINE_bool(fst_default_cache_gc, true, \"Enable garbage collection of cache\");\n\nDEFINE_int64(fst_default_cache_gc_limit, 1 << 20LL,\n             \"Cache byte size that triggers garbage collection\");\n\nDEFINE_bool(fst_align, false, \"Write FST data aligned where appropriate\");\n\nDEFINE_string(save_relabel_ipairs, \"\", \"Save input relabel pairs to file\");\nDEFINE_string(save_relabel_opairs, \"\", \"Save output relabel pairs to file\");\n\nDEFINE_string(fst_read_mode, \"read\",\n              \"Default file reading mode for mappable files\");\n\nnamespace fst {\n\n// FST type definitions for lookahead FSTs.\nconst char arc_lookahead_fst_type[] = \"arc_lookahead\";\nconst char ilabel_lookahead_fst_type[] = \"ilabel_lookahead\";\nconst char olabel_lookahead_fst_type[] = \"olabel_lookahead\";\n\n// Identifies stream data as an FST (and its endianity).\nconstexpr int32 kFstMagicNumber = 2125659606;\n\n// Checks for FST magic number in stream, to indicate caller function that the\n// stream content is an FST header.\nbool IsFstHeader(std::istream &strm, const string &source) {\n  int64 pos = strm.tellg();\n  bool match = true;\n  int32 magic_number = 0;\n  ReadType(strm, &magic_number);\n  if (magic_number != kFstMagicNumber) {\n      match = false;\n  }\n  strm.seekg(pos);\n  return match;\n}\n\n// Checks FST magic number and reads in the header; if rewind = true,\n// the stream is repositioned before call if possible.\nbool FstHeader::Read(std::istream &strm, const string &source, bool rewind) {\n  int64 pos = 0;\n  if (rewind) pos = strm.tellg();\n  int32 magic_number = 0;\n  ReadType(strm, &magic_number);\n  if (magic_number != kFstMagicNumber) {\n      LOG(ERROR) << \"FstHeader::Read: Bad FST header: \" << source;\n      if (rewind) strm.seekg(pos);\n      return false;\n  }\n  ReadType(strm, &fsttype_);\n  ReadType(strm, &arctype_);\n  ReadType(strm, &version_);\n  ReadType(strm, &flags_);\n  ReadType(strm, &properties_);\n  ReadType(strm, &start_);\n  ReadType(strm, &numstates_);\n  ReadType(strm, &numarcs_);\n  if (!strm) {\n    LOG(ERROR) << \"FstHeader::Read: Read failed: \" << source;\n    return false;\n  }\n  if (rewind) strm.seekg(pos);\n  return true;\n}\n\n// Writes FST magic number and FST header.\nbool FstHeader::Write(std::ostream &strm, const string &source) const {\n  WriteType(strm, kFstMagicNumber);\n  WriteType(strm, fsttype_);\n  WriteType(strm, arctype_);\n  WriteType(strm, version_);\n  WriteType(strm, flags_);\n  WriteType(strm, properties_);\n  WriteType(strm, start_);\n  WriteType(strm, numstates_);\n  WriteType(strm, numarcs_);\n  return true;\n}\n\nstring FstHeader::DebugString() const {\n  std::ostringstream ostrm;\n  ostrm << \"fsttype: \\\"\" << fsttype_ << \"\\\" arctype: \\\"\" << arctype_\n        << \"\\\" version: \\\"\" << version_ << \"\\\" flags: \\\"\" << flags_\n        << \"\\\" properties: \\\"\" << properties_ << \"\\\" start: \\\"\" << start_\n        << \"\\\" numstates: \\\"\" << numstates_ << \"\\\" numarcs: \\\"\" << numarcs_\n        << \"\\\"\";\n  return ostrm.str();\n}\n\nFstReadOptions::FstReadOptions(const string &source, const FstHeader *header,\n                               const SymbolTable *isymbols,\n                               const SymbolTable *osymbols)\n    : source(source),\n      header(header),\n      isymbols(isymbols),\n      osymbols(osymbols),\n      read_isymbols(true),\n      read_osymbols(true) {\n  mode = ReadMode(FLAGS_fst_read_mode);\n}\n\nFstReadOptions::FstReadOptions(const string &source,\n                               const SymbolTable *isymbols,\n                               const SymbolTable *osymbols)\n    : source(source),\n      header(nullptr),\n      isymbols(isymbols),\n      osymbols(osymbols),\n      read_isymbols(true),\n      read_osymbols(true) {\n  mode = ReadMode(FLAGS_fst_read_mode);\n}\n\nFstReadOptions::FileReadMode FstReadOptions::ReadMode(const string &mode) {\n  if (mode == \"read\") return READ;\n  if (mode == \"map\") return MAP;\n  LOG(ERROR) << \"Unknown file read mode \" << mode;\n  return READ;\n}\n\nstring FstReadOptions::DebugString() const {\n  std::ostringstream ostrm;\n  ostrm << \"source: \\\"\" << source << \"\\\" mode: \\\"\"\n        << (mode == READ ? \"READ\" : \"MAP\") << \"\\\" read_isymbols: \\\"\"\n        << (read_isymbols ? \"true\" : \"false\") << \"\\\" read_osymbols: \\\"\"\n        << (read_osymbols ? \"true\" : \"false\") << \"\\\" header: \\\"\"\n        << (header ? \"set\" : \"null\") << \"\\\" isymbols: \\\"\"\n        << (isymbols ? \"set\" : \"null\") << \"\\\" osymbols: \\\"\"\n        << (osymbols ? \"set\" : \"null\") << \"\\\"\";\n  return ostrm.str();\n}\n\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/lib/mapped-file.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n\n#include <fst/mapped-file.h>\n\n#include <errno.h>\n#include <fcntl.h>\n#include <sys/mman.h>\n#include <unistd.h>\n\n#include <algorithm>\n#include <ios>\n#include <memory>\n\n#include <fst/log.h>\n\nnamespace fst {\n\nMappedFile::MappedFile(const MemoryRegion &region) : region_(region) {}\n\nMappedFile::~MappedFile() {\n  if (region_.size != 0) {\n    if (region_.mmap) {\n      VLOG(1) << \"munmap'ed \" << region_.size << \" bytes at \" << region_.mmap;\n      if (munmap(region_.mmap, region_.size) != 0) {\n        LOG(ERROR) << \"Failed to unmap region: \" << strerror(errno);\n      }\n    } else {\n      if (region_.data) {\n        operator delete(static_cast<char *>(region_.data) - region_.offset);\n      }\n    }\n  }\n}\n\nMappedFile *MappedFile::Map(std::istream *istrm, bool memorymap,\n                            const string &source, size_t size) {\n  const auto spos = istrm->tellg();\n  VLOG(1) << \"memorymap: \" << (memorymap ? \"true\" : \"false\") << \" source: \\\"\"\n          << source << \"\\\"\"\n          << \" size: \" << size << \" offset: \" << spos;\n  if (memorymap && spos >= 0 && spos % kArchAlignment == 0) {\n    const size_t pos = spos;\n    int fd = open(source.c_str(), O_RDONLY);\n    if (fd != -1) {\n      const int pagesize = sysconf(_SC_PAGESIZE);\n      const off_t offset = pos % pagesize;\n      const off_t upsize = size + offset;\n      void *map =\n          mmap(nullptr, upsize, PROT_READ, MAP_SHARED, fd, pos - offset);\n      auto *data = reinterpret_cast<char *>(map);\n      if (close(fd) == 0 && map != MAP_FAILED) {\n        MemoryRegion region;\n        region.mmap = map;\n        region.size = upsize;\n        region.data = reinterpret_cast<void *>(data + offset);\n        region.offset = offset;\n        std::unique_ptr<MappedFile> mmf(new MappedFile(region));\n        istrm->seekg(pos + size, std::ios::beg);\n        if (istrm) {\n          VLOG(1) << \"mmap'ed region of \" << size << \" at offset \" << pos\n                  << \" from \" << source << \" to addr \" << map;\n          return mmf.release();\n        }\n      } else {\n        LOG(INFO) << \"Mapping of file failed: \" << strerror(errno);\n      }\n    }\n  }\n  // If all else fails, reads from the file into the allocated buffer.\n  if (memorymap) {\n    LOG(WARNING) << \"File mapping at offset \" << spos << \" of file \" << source\n                 << \" could not be honored, reading instead\";\n  }\n  // Reads the file into the buffer in chunks not larger than kMaxReadChunk.\n  std::unique_ptr<MappedFile> mf(Allocate(size));\n  auto *buffer = reinterpret_cast<char *>(mf->mutable_data());\n  while (size > 0) {\n    const auto next_size = std::min(size, kMaxReadChunk);\n    const auto current_pos = istrm->tellg();\n    if (!istrm->read(buffer, next_size)) {\n      LOG(ERROR) << \"Failed to read \" << next_size << \" bytes at offset \"\n                 << current_pos << \"from \\\"\" << source << \"\\\"\";\n      return nullptr;\n    }\n    size -= next_size;\n    buffer += next_size;\n    VLOG(2) << \"Read \" << next_size << \" bytes. \" << size << \" remaining\";\n  }\n  return mf.release();\n}\n\nMappedFile *MappedFile::Allocate(size_t size, int align) {\n  MemoryRegion region;\n  region.data = nullptr;\n  region.offset = 0;\n  if (size > 0) {\n    char *buffer = static_cast<char *>(operator new(size + align));\n    size_t address = reinterpret_cast<size_t>(buffer);\n    region.offset = kArchAlignment - (address % align);\n    region.data = buffer + region.offset;\n  }\n  region.mmap = nullptr;\n  region.size = size;\n  return new MappedFile(region);\n}\n\nMappedFile *MappedFile::Borrow(void *data) {\n  MemoryRegion region;\n  region.data = data;\n  region.mmap = data;\n  region.size = 0;\n  region.offset = 0;\n  return new MappedFile(region);\n}\n\nconstexpr int MappedFile::kArchAlignment;\n\nconstexpr size_t MappedFile::kMaxReadChunk;\n\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/lib/properties.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Functions for updating property bits for various FST operations and\n// string names of the properties.\n\n#include <fst/properties.h>\n\n#include <stddef.h>\n#include <vector>\n\nnamespace fst {\n\n// These functions determine the properties associated with the FST result of\n// various finite-state operations. The property arguments correspond to the\n// operation's FST arguments. The properties returned assume the operation\n// modifies its first argument. Bitwise-and this result with kCopyProperties for\n// the case when a new (possibly delayed) FST is instead constructed.\n\n// Properties for a concatenatively-closed FST.\nuint64 ClosureProperties(uint64 inprops, bool star, bool delayed) {\n  auto outprops = (kError | kAcceptor | kUnweighted | kAccessible) & inprops;\n  if (inprops & kUnweighted) outprops |= kUnweightedCycles;\n  if (!delayed) {\n    outprops |=\n        (kExpanded | kMutable | kCoAccessible | kNotTopSorted | kNotString) &\n        inprops;\n  }\n  if (!delayed || inprops & kAccessible) {\n    outprops |= (kNotAcceptor | kNonIDeterministic | kNonODeterministic |\n                 kNotILabelSorted | kNotOLabelSorted | kWeighted |\n                 kWeightedCycles | kNotAccessible | kNotCoAccessible) & inprops;\n    if ((inprops & kWeighted) && (inprops & kAccessible) &&\n        (inprops & kCoAccessible)) {\n        outprops |= kWeightedCycles;\n    }\n  }\n  return outprops;\n}\n\n// Properties for a complemented FST.\nuint64 ComplementProperties(uint64 inprops) {\n  auto outprops = kAcceptor | kUnweighted | kUnweightedCycles | kNoEpsilons |\n                  kNoIEpsilons | kNoOEpsilons | kIDeterministic |\n                  kODeterministic | kAccessible;\n  outprops |=\n      (kError | kILabelSorted | kOLabelSorted | kInitialCyclic) & inprops;\n  if (inprops & kAccessible) {\n    outprops |= kNotILabelSorted | kNotOLabelSorted | kCyclic;\n  }\n  return outprops;\n}\n\n// Properties for a composed FST.\nuint64 ComposeProperties(uint64 inprops1, uint64 inprops2) {\n  auto outprops = kError & (inprops1 | inprops2);\n  if (inprops1 & kAcceptor && inprops2 & kAcceptor) {\n    outprops |= kAcceptor | kAccessible;\n    outprops |= (kNoEpsilons | kNoIEpsilons | kNoOEpsilons | kAcyclic |\n                 kInitialAcyclic) &\n                inprops1 & inprops2;\n    if (kNoIEpsilons & inprops1 & inprops2) {\n      outprops |= (kIDeterministic | kODeterministic) & inprops1 & inprops2;\n    }\n  } else {\n    outprops |= kAccessible;\n    outprops |= (kAcceptor | kNoIEpsilons | kAcyclic | kInitialAcyclic) &\n                inprops1 & inprops2;\n    if (kNoIEpsilons & inprops1 & inprops2) {\n      outprops |= kIDeterministic & inprops1 & inprops2;\n    }\n  }\n  return outprops;\n}\n\n// Properties for a concatenated FST.\nuint64 ConcatProperties(uint64 inprops1, uint64 inprops2, bool delayed) {\n  auto outprops = (kAcceptor | kUnweighted | kUnweightedCycles | kAcyclic) &\n                  inprops1 & inprops2;\n  outprops |= kError & (inprops1 | inprops2);\n  const bool empty1 = delayed;  // Can the first FST be the empty machine?\n  const bool empty2 = delayed;  // Can the second FST be the empty machine?\n  if (!delayed) {\n    outprops |= (kExpanded | kMutable | kNotTopSorted | kNotString) & inprops1;\n    outprops |= (kNotTopSorted | kNotString) & inprops2;\n  }\n  if (!empty1) outprops |= (kInitialAcyclic | kInitialCyclic) & inprops1;\n  if (!delayed || inprops1 & kAccessible) {\n    outprops |= (kNotAcceptor | kNonIDeterministic | kNonODeterministic |\n                 kEpsilons | kIEpsilons | kOEpsilons | kNotILabelSorted |\n                 kNotOLabelSorted | kWeighted | kWeightedCycles | kCyclic |\n                 kNotAccessible | kNotCoAccessible) &\n                inprops1;\n  }\n  if ((inprops1 & (kAccessible | kCoAccessible)) ==\n          (kAccessible | kCoAccessible) &&\n      !empty1) {\n    outprops |= kAccessible & inprops2;\n    if (!empty2) outprops |= kCoAccessible & inprops2;\n    if (!delayed || inprops2 & kAccessible) {\n      outprops |= (kNotAcceptor | kNonIDeterministic | kNonODeterministic |\n                   kEpsilons | kIEpsilons | kOEpsilons | kNotILabelSorted |\n                   kNotOLabelSorted | kWeighted | kWeightedCycles | kCyclic |\n                   kNotAccessible | kNotCoAccessible) &\n                  inprops2;\n    }\n  }\n  return outprops;\n}\n\n// Properties for a determinized FST.\nuint64 DeterminizeProperties(uint64 inprops, bool has_subsequential_label,\n                             bool distinct_psubsequential_labels) {\n  auto outprops = kAccessible;\n  if ((kAcceptor & inprops) ||\n      ((kNoIEpsilons & inprops) && distinct_psubsequential_labels) ||\n      (has_subsequential_label && distinct_psubsequential_labels)) {\n    outprops |= kIDeterministic;\n  }\n  outprops |= (kError | kAcceptor | kAcyclic | kInitialAcyclic | kCoAccessible |\n               kString) &\n              inprops;\n  if ((inprops & kNoIEpsilons) && distinct_psubsequential_labels) {\n    outprops |= kNoEpsilons & inprops;\n  }\n  if (inprops & kAccessible) {\n    outprops |= (kIEpsilons | kOEpsilons | kCyclic) & inprops;\n  }\n  if (inprops & kAcceptor) outprops |= (kNoIEpsilons | kNoOEpsilons) & inprops;\n  if ((inprops & kNoIEpsilons) && has_subsequential_label) {\n    outprops |= kNoIEpsilons;\n  }\n  return outprops;\n}\n\n// Properties for factored weight FST.\nuint64 FactorWeightProperties(uint64 inprops) {\n  auto outprops = (kExpanded | kMutable | kError | kAcceptor | kAcyclic |\n                   kAccessible | kCoAccessible) &\n                  inprops;\n  if (inprops & kAccessible) {\n    outprops |= (kNotAcceptor | kNonIDeterministic | kNonODeterministic |\n                 kEpsilons | kIEpsilons | kOEpsilons | kCyclic |\n                 kNotILabelSorted | kNotOLabelSorted) &\n                inprops;\n  }\n  return outprops;\n}\n\n// Properties for an inverted FST.\nuint64 InvertProperties(uint64 inprops) {\n  auto outprops = (kExpanded | kMutable | kError | kAcceptor | kNotAcceptor |\n                   kEpsilons | kNoEpsilons | kWeighted | kUnweighted |\n                   kWeightedCycles | kUnweightedCycles | kCyclic | kAcyclic |\n                   kInitialCyclic | kInitialAcyclic | kTopSorted |\n                   kNotTopSorted | kAccessible | kNotAccessible |\n                   kCoAccessible | kNotCoAccessible | kString | kNotString) &\n                  inprops;\n  if (kIDeterministic & inprops) outprops |= kODeterministic;\n  if (kNonIDeterministic & inprops) outprops |= kNonODeterministic;\n  if (kODeterministic & inprops) outprops |= kIDeterministic;\n  if (kNonODeterministic & inprops) outprops |= kNonIDeterministic;\n\n  if (kIEpsilons & inprops) outprops |= kOEpsilons;\n  if (kNoIEpsilons & inprops) outprops |= kNoOEpsilons;\n  if (kOEpsilons & inprops) outprops |= kIEpsilons;\n  if (kNoOEpsilons & inprops) outprops |= kNoIEpsilons;\n\n  if (kILabelSorted & inprops) outprops |= kOLabelSorted;\n  if (kNotILabelSorted & inprops) outprops |= kNotOLabelSorted;\n  if (kOLabelSorted & inprops) outprops |= kILabelSorted;\n  if (kNotOLabelSorted & inprops) outprops |= kNotILabelSorted;\n  return outprops;\n}\n\n// Properties for a projected FST.\nuint64 ProjectProperties(uint64 inprops, bool project_input) {\n  auto outprops = kAcceptor;\n  outprops |= (kExpanded | kMutable | kError | kWeighted | kUnweighted |\n               kWeightedCycles | kUnweightedCycles |\n               kCyclic | kAcyclic | kInitialCyclic | kInitialAcyclic |\n               kTopSorted | kNotTopSorted | kAccessible | kNotAccessible |\n               kCoAccessible | kNotCoAccessible | kString | kNotString) &\n              inprops;\n  if (project_input) {\n    outprops |= (kIDeterministic | kNonIDeterministic | kIEpsilons |\n                 kNoIEpsilons | kILabelSorted | kNotILabelSorted) &\n                inprops;\n\n    if (kIDeterministic & inprops) outprops |= kODeterministic;\n    if (kNonIDeterministic & inprops) outprops |= kNonODeterministic;\n\n    if (kIEpsilons & inprops) outprops |= kOEpsilons | kEpsilons;\n    if (kNoIEpsilons & inprops) outprops |= kNoOEpsilons | kNoEpsilons;\n\n    if (kILabelSorted & inprops) outprops |= kOLabelSorted;\n    if (kNotILabelSorted & inprops) outprops |= kNotOLabelSorted;\n  } else {\n    outprops |= (kODeterministic | kNonODeterministic | kOEpsilons |\n                 kNoOEpsilons | kOLabelSorted | kNotOLabelSorted) &\n                inprops;\n\n    if (kODeterministic & inprops) outprops |= kIDeterministic;\n    if (kNonODeterministic & inprops) outprops |= kNonIDeterministic;\n\n    if (kOEpsilons & inprops) outprops |= kIEpsilons | kEpsilons;\n    if (kNoOEpsilons & inprops) outprops |= kNoIEpsilons | kNoEpsilons;\n\n    if (kOLabelSorted & inprops) outprops |= kILabelSorted;\n    if (kNotOLabelSorted & inprops) outprops |= kNotILabelSorted;\n  }\n  return outprops;\n}\n\n// Properties for a randgen FST.\nuint64 RandGenProperties(uint64 inprops, bool weighted) {\n  auto outprops = kAcyclic | kInitialAcyclic | kAccessible | kUnweightedCycles;\n  outprops |= inprops & kError;\n  if (weighted) {\n    outprops |= kTopSorted;\n    outprops |=\n        (kAcceptor | kNoEpsilons | kNoIEpsilons | kNoOEpsilons |\n         kIDeterministic | kODeterministic | kILabelSorted | kOLabelSorted) &\n        inprops;\n  } else {\n    outprops |= kUnweighted;\n    outprops |= (kAcceptor | kILabelSorted | kOLabelSorted) & inprops;\n  }\n  return outprops;\n}\n\n// Properties for a replace FST.\nuint64 ReplaceProperties(const std::vector<uint64>& inprops, ssize_t root,\n                         bool epsilon_on_call, bool epsilon_on_return,\n                         bool out_epsilon_on_call, bool out_epsilon_on_return,\n                         bool replace_transducer, bool no_empty_fsts,\n                         bool all_ilabel_sorted, bool all_olabel_sorted,\n                         bool all_negative_or_dense) {\n  if (inprops.empty()) return kNullProperties;\n  uint64 outprops = 0;\n  for (auto inprop : inprops) outprops |= kError & inprop;\n  uint64 access_props = no_empty_fsts ? kAccessible | kCoAccessible : 0;\n  for (auto inprop : inprops) {\n    access_props &= (inprop & (kAccessible | kCoAccessible));\n  }\n  if (access_props == (kAccessible | kCoAccessible)) {\n    outprops |= access_props;\n    if (inprops[root] & kInitialCyclic) outprops |= kInitialCyclic;\n    uint64 props = 0;\n    bool string = true;\n    for (auto inprop : inprops) {\n      if (replace_transducer) props |= kNotAcceptor & inprop;\n      props |= (kNonIDeterministic | kNonODeterministic | kEpsilons |\n                kIEpsilons | kOEpsilons | kWeighted | kWeightedCycles |\n                kCyclic | kNotTopSorted | kNotString) & inprop;\n      if (!(inprop & kString)) string = false;\n    }\n    outprops |= props;\n    if (string) outprops |= kString;\n  }\n  bool acceptor = !replace_transducer;\n  bool ideterministic = !epsilon_on_call && epsilon_on_return;\n  bool no_iepsilons = !epsilon_on_call && !epsilon_on_return;\n  bool acyclic = true;\n  bool unweighted = true;\n  for (size_t i = 0; i < inprops.size(); ++i) {\n    if (!(inprops[i] & kAcceptor)) acceptor = false;\n    if (!(inprops[i] & kIDeterministic)) ideterministic = false;\n    if (!(inprops[i] & kNoIEpsilons)) no_iepsilons = false;\n    if (!(inprops[i] & kAcyclic)) acyclic = false;\n    if (!(inprops[i] & kUnweighted)) unweighted = false;\n    if (i != root && !(inprops[i] & kNoIEpsilons)) ideterministic = false;\n  }\n  if (acceptor) outprops |= kAcceptor;\n  if (ideterministic) outprops |= kIDeterministic;\n  if (no_iepsilons) outprops |= kNoIEpsilons;\n  if (acyclic) outprops |= kAcyclic;\n  if (unweighted) outprops |= kUnweighted;\n  if (inprops[root] & kInitialAcyclic) outprops |= kInitialAcyclic;\n  // We assume that all terminals are positive. The resulting ReplaceFst is\n  // known to be kILabelSorted when: (1) all sub-FSTs are kILabelSorted, (2) the\n  // input label of the return arc is epsilon, and (3) one of the 3 following\n  // conditions is satisfied:\n  //\n  //  1. the input label of the call arc is not epsilon\n  //  2. all non-terminals are negative, or\n  //  3. all non-terninals are positive and form a dense range containing 1.\n  if (all_ilabel_sorted && epsilon_on_return &&\n      (!epsilon_on_call || all_negative_or_dense)) {\n    outprops |= kILabelSorted;\n  }\n  // Similarly, the resulting ReplaceFst is known to be kOLabelSorted when: (1)\n  // all sub-FSTs are kOLabelSorted, (2) the output label of the return arc is\n  // epsilon, and (3) one of the 3 following conditions is satisfied:\n  //\n  //  1. the output label of the call arc is not epsilon\n  //  2. all non-terminals are negative, or\n  //  3. all non-terninals are positive and form a dense range containing 1.\n  if (all_olabel_sorted && out_epsilon_on_return &&\n      (!out_epsilon_on_call || all_negative_or_dense)) {\n    outprops |= kOLabelSorted;\n  }\n  return outprops;\n}\n\n// Properties for a relabeled FST.\nuint64 RelabelProperties(uint64 inprops) {\n  static constexpr auto outprops =\n      kExpanded | kMutable | kError | kWeighted | kUnweighted |\n      kWeightedCycles | kUnweightedCycles | kCyclic | kAcyclic |\n      kInitialCyclic | kInitialAcyclic | kTopSorted | kNotTopSorted |\n      kAccessible | kNotAccessible | kCoAccessible | kNotCoAccessible |\n      kString | kNotString;\n  return outprops & inprops;\n}\n\n// Properties for a reversed FST (the superinitial state limits this set).\nuint64 ReverseProperties(uint64 inprops, bool has_superinitial) {\n  auto outprops = (kExpanded | kMutable | kError | kAcceptor | kNotAcceptor |\n                   kEpsilons | kIEpsilons | kOEpsilons | kUnweighted | kCyclic |\n                   kAcyclic | kWeightedCycles | kUnweightedCycles) &\n                  inprops;\n  if (has_superinitial) outprops |= kWeighted & inprops;\n  return outprops;\n}\n\n// Properties for re-weighted FST.\nuint64 ReweightProperties(uint64 inprops) {\n  auto outprops = inprops & kWeightInvariantProperties;\n  outprops = outprops & ~kCoAccessible;\n  return outprops;\n}\n\n// Properties for an epsilon-removed FST.\nuint64 RmEpsilonProperties(uint64 inprops, bool delayed) {\n  auto outprops = kNoEpsilons;\n  outprops |= (kError | kAcceptor | kAcyclic | kInitialAcyclic) & inprops;\n  if (inprops & kAcceptor) outprops |= kNoIEpsilons | kNoOEpsilons;\n  if (!delayed) {\n    outprops |= kExpanded | kMutable;\n    outprops |= kTopSorted & inprops;\n  }\n  if (!delayed || inprops & kAccessible) outprops |= kNotAcceptor & inprops;\n  return outprops;\n}\n\n// Properties for shortest path. This function computes how the properties of\n// the output of shortest path need to be updated, given that 'props' is already\n// known.\nuint64 ShortestPathProperties(uint64 props, bool tree) {\n  auto outprops =\n      props | kAcyclic | kInitialAcyclic | kAccessible | kUnweightedCycles;\n  if (!tree) outprops |= kCoAccessible;\n  return outprops;\n}\n\n// Properties for a synchronized FST.\nuint64 SynchronizeProperties(uint64 inprops) {\n  auto outprops = (kError | kAcceptor | kAcyclic | kAccessible | kCoAccessible |\n                   kUnweighted | kUnweightedCycles) &\n                  inprops;\n  if (inprops & kAccessible) {\n    outprops |= (kCyclic | kNotCoAccessible | kWeighted | kWeightedCycles) &\n        inprops;\n  }\n  return outprops;\n}\n\n// Properties for a unioned FST.\nuint64 UnionProperties(uint64 inprops1, uint64 inprops2, bool delayed) {\n  auto outprops =\n      (kAcceptor | kUnweighted | kUnweightedCycles | kAcyclic | kAccessible) &\n      inprops1 & inprops2;\n  outprops |= kError & (inprops1 | inprops2);\n  outprops |= kInitialAcyclic;\n  bool empty1 = delayed;  // Can the first FST be the empty machine?\n  bool empty2 = delayed;  // Can the second FST be the empty machine?\n  if (!delayed) {\n    outprops |= (kExpanded | kMutable | kNotTopSorted) & inprops1;\n    outprops |= kNotTopSorted & inprops2;\n  }\n  if (!empty1 && !empty2) {\n    outprops |= kEpsilons | kIEpsilons | kOEpsilons;\n    outprops |= kCoAccessible & inprops1 & inprops2;\n  }\n  // Note kNotCoAccessible does not hold because of kInitialAcyclic option.\n  if (!delayed || inprops1 & kAccessible) {\n    outprops |=\n        (kNotAcceptor | kNonIDeterministic | kNonODeterministic | kEpsilons |\n         kIEpsilons | kOEpsilons | kNotILabelSorted | kNotOLabelSorted |\n         kWeighted | kWeightedCycles | kCyclic | kNotAccessible) &\n        inprops1;\n  }\n  if (!delayed || inprops2 & kAccessible) {\n    outprops |= (kNotAcceptor | kNonIDeterministic | kNonODeterministic |\n                 kEpsilons | kIEpsilons | kOEpsilons | kNotILabelSorted |\n                 kNotOLabelSorted | kWeighted | kWeightedCycles | kCyclic |\n                 kNotAccessible | kNotCoAccessible) &\n                inprops2;\n  }\n  return outprops;\n}\n\n// Property string names (indexed by bit position).\nconst char* PropertyNames[] = {\n    // Binary.\n    \"expanded\", \"mutable\", \"error\", \"\", \"\", \"\", \"\", \"\", \"\", \"\", \"\", \"\", \"\", \"\",\n    \"\", \"\",\n    // Ternary.\n    \"acceptor\", \"not acceptor\", \"input deterministic\",\n    \"non input deterministic\", \"output deterministic\",\n    \"non output deterministic\", \"input/output epsilons\",\n    \"no input/output epsilons\", \"input epsilons\", \"no input epsilons\",\n    \"output epsilons\", \"no output epsilons\", \"input label sorted\",\n    \"not input label sorted\", \"output label sorted\", \"not output label sorted\",\n    \"weighted\", \"unweighted\", \"cyclic\", \"acyclic\", \"cyclic at initial state\",\n    \"acyclic at initial state\", \"top sorted\", \"not top sorted\", \"accessible\",\n    \"not accessible\", \"coaccessible\", \"not coaccessible\", \"string\",\n    \"not string\", \"weighted cycles\", \"unweighted cycles\"};\n\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/lib/symbol-table-ops.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n\n#include <fst/symbol-table-ops.h>\n\n#include <string>\n\nnamespace fst {\n\nSymbolTable *MergeSymbolTable(const SymbolTable &left, const SymbolTable &right,\n                              bool *right_relabel_output) {\n  // MergeSymbolTable detects several special cases.  It will return a reference\n  // copied version of SymbolTable of left or right if either symbol table is\n  // a superset of the other.\n  std::unique_ptr<SymbolTable> merged(\n      new SymbolTable(\"merge_\" + left.Name() + \"_\" + right.Name()));\n  // Copies everything from the left symbol table.\n  bool left_has_all = true;\n  bool right_has_all = true;\n  bool relabel = false;\n  for (SymbolTableIterator liter(left); !liter.Done(); liter.Next()) {\n    merged->AddSymbol(liter.Symbol(), liter.Value());\n    if (right_has_all) {\n      int64 key = right.Find(liter.Symbol());\n      if (key == -1) {\n        right_has_all = false;\n      } else if (!relabel && key != liter.Value()) {\n        relabel = true;\n      }\n    }\n  }\n  if (right_has_all) {\n    if (right_relabel_output) *right_relabel_output = relabel;\n    return right.Copy();\n  }\n  // add all symbols we can from right symbol table\n  std::vector<string> conflicts;\n  for (SymbolTableIterator riter(right); !riter.Done(); riter.Next()) {\n    int64 key = merged->Find(riter.Symbol());\n    if (key != -1) {\n      // Symbol already exists, maybe with different value\n      if (key != riter.Value()) relabel = true;\n      continue;\n    }\n    // Symbol doesn't exist from left\n    left_has_all = false;\n    if (!merged->Find(riter.Value()).empty()) {\n      // we can't add this where we want to, add it later, in order\n      conflicts.push_back(riter.Symbol());\n      continue;\n    }\n    // there is a hole and we can add this symbol with its id\n    merged->AddSymbol(riter.Symbol(), riter.Value());\n  }\n  if (right_relabel_output) *right_relabel_output = relabel;\n  if (left_has_all) return left.Copy();\n  // Add all symbols that conflicted, in order\n  for (const auto &conflict : conflicts) merged->AddSymbol(conflict);\n  return merged.release();\n}\n\nSymbolTable *CompactSymbolTable(const SymbolTable &syms) {\n  std::map<int64, string> sorted;\n  SymbolTableIterator stiter(syms);\n  for (; !stiter.Done(); stiter.Next()) {\n    sorted[stiter.Value()] = stiter.Symbol();\n  }\n  auto *compact = new SymbolTable(syms.Name() + \"_compact\");\n  int64 newkey = 0;\n  for (const auto &kv : sorted) compact->AddSymbol(kv.second, newkey++);\n  return compact;\n}\n\nSymbolTable *FstReadSymbols(const string &filename, bool input_symbols) {\n  std::ifstream in(filename, std::ios_base::in | std::ios_base::binary);\n  if (!in) {\n    LOG(ERROR) << \"FstReadSymbols: Can't open file \" << filename;\n    return nullptr;\n  }\n  FstHeader hdr;\n  if (!hdr.Read(in, filename)) {\n    LOG(ERROR) << \"FstReadSymbols: Couldn't read header from \" << filename;\n    return nullptr;\n  }\n  if (hdr.GetFlags() & FstHeader::HAS_ISYMBOLS) {\n    std::unique_ptr<SymbolTable> isymbols(SymbolTable::Read(in, filename));\n    if (isymbols == nullptr) {\n      LOG(ERROR) << \"FstReadSymbols: Couldn't read input symbols from \"\n                 << filename;\n      return nullptr;\n    }\n    if (input_symbols) return isymbols.release();\n  }\n  if (hdr.GetFlags() & FstHeader::HAS_OSYMBOLS) {\n    std::unique_ptr<SymbolTable> osymbols(SymbolTable::Read(in, filename));\n    if (osymbols == nullptr) {\n      LOG(ERROR) << \"FstReadSymbols: Couldn't read output symbols from \"\n                 << filename;\n      return nullptr;\n    }\n    if (!input_symbols) return osymbols.release();\n  }\n  LOG(ERROR) << \"FstReadSymbols: The file \" << filename\n             << \" doesn't contain the requested symbols\";\n  return nullptr;\n}\n\nbool AddAuxiliarySymbols(const string &prefix, int64 start_label,\n                         int64 nlabels, SymbolTable *syms) {\n  for (int64 i = 0; i < nlabels; ++i) {\n    auto index = i + start_label;\n    if (index != syms->AddSymbol(prefix + std::to_string(i), index)) {\n      FSTERROR() << \"AddAuxiliarySymbols: Symbol table clash\";\n      return false;\n    }\n  }\n  return true;\n}\n\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/lib/symbol-table.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Classes to provide symbol-to-integer and integer-to-symbol mappings.\n\n#include <fst/symbol-table.h>\n\n#include <fst/flags.h>\n#include <fst/log.h>\n\n#include <fstream>\n#include <fst/util.h>\n\nDEFINE_bool(fst_compat_symbols, true,\n            \"Require symbol tables to match when appropriate\");\nDEFINE_string(fst_field_separator, \"\\t \",\n              \"Set of characters used as a separator between printed fields\");\n\nnamespace fst {\n\n// Maximum line length in textual symbols file.\nstatic constexpr int kLineLen = 8096;\n\n// Identifies stream data as a symbol table (and its endianity).\nstatic constexpr int32 kSymbolTableMagicNumber = 2125658996;\n\nSymbolTableTextOptions::SymbolTableTextOptions(bool allow_negative_labels)\n    : allow_negative_labels(allow_negative_labels),\n      fst_field_separator(FLAGS_fst_field_separator) {}\n\nnamespace internal {\n\nSymbolTableImpl *SymbolTableImpl::ReadText(std::istream &strm,\n                                           const string &filename,\n                                           const SymbolTableTextOptions &opts) {\n  std::unique_ptr<SymbolTableImpl> impl(new SymbolTableImpl(filename));\n  int64 nline = 0;\n  char line[kLineLen];\n  while (!strm.getline(line, kLineLen).fail()) {\n    ++nline;\n    std::vector<char *> col;\n    auto separator = opts.fst_field_separator + \"\\n\";\n    SplitString(line, separator.c_str(), &col, true);\n    if (col.empty()) continue;  // Empty line.\n    if (col.size() != 2) {\n      LOG(ERROR) << \"SymbolTable::ReadText: Bad number of columns (\"\n                 << col.size() << \"), \"\n                 << \"file = \" << filename << \", line = \" << nline << \":<\"\n                 << line << \">\";\n      return nullptr;\n    }\n    const char *symbol = col[0];\n    const char *value = col[1];\n    char *p;\n    const auto key = strtoll(value, &p, 10);\n    if (p < value + strlen(value) || (!opts.allow_negative_labels && key < 0) ||\n        key == kNoSymbol) {\n      LOG(ERROR) << \"SymbolTable::ReadText: Bad non-negative integer \\\"\"\n                 << value << \"\\\", \"\n                 << \"file = \" << filename << \", line = \" << nline;\n      return nullptr;\n    }\n    impl->AddSymbol(symbol, key);\n  }\n  return impl.release();\n}\n\nvoid SymbolTableImpl::MaybeRecomputeCheckSum() const {\n  {\n    ReaderMutexLock check_sum_lock(&check_sum_mutex_);\n    if (check_sum_finalized_) return;\n  }\n  // We'll acquire an exclusive lock to recompute the checksums.\n  MutexLock check_sum_lock(&check_sum_mutex_);\n  if (check_sum_finalized_) {  // Another thread (coming in around the same time\n    return;                    // might have done it already). So we recheck.\n  }\n  // Calculates the original label-agnostic checksum.\n  CheckSummer check_sum;\n  for (size_t i = 0; i < symbols_.size(); ++i) {\n    const auto &symbol = symbols_.GetSymbol(i);\n    check_sum.Update(symbol.data(), symbol.size());\n    check_sum.Update(\"\", 1);\n  }\n  check_sum_string_ = check_sum.Digest();\n  // Calculates the safer, label-dependent checksum.\n  CheckSummer labeled_check_sum;\n  for (int64 i = 0; i < dense_key_limit_; ++i) {\n    std::ostringstream line;\n    line << symbols_.GetSymbol(i) << '\\t' << i;\n    labeled_check_sum.Update(line.str().data(), line.str().size());\n  }\n  using citer = map<int64, int64>::const_iterator;\n  for (citer it = key_map_.begin(); it != key_map_.end(); ++it) {\n    // TODO(tombagby, 2013-11-22) This line maintains a bug that ignores\n    // negative labels in the checksum that too many tests rely on.\n    if (it->first < dense_key_limit_) continue;\n    std::ostringstream line;\n    line << symbols_.GetSymbol(it->second) << '\\t' << it->first;\n    labeled_check_sum.Update(line.str().data(), line.str().size());\n  }\n  labeled_check_sum_string_ = labeled_check_sum.Digest();\n  check_sum_finalized_ = true;\n}\n\nint64 SymbolTableImpl::AddSymbol(const string &symbol, int64 key) {\n  if (key == kNoSymbol) return key;\n  const std::pair<int64, bool> &insert_key = symbols_.InsertOrFind(symbol);\n  if (!insert_key.second) {\n    auto key_already = GetNthKey(insert_key.first);\n    if (key_already == key) return key;\n    VLOG(1) << \"SymbolTable::AddSymbol: symbol = \" << symbol\n            << \" already in symbol_map_ with key = \" << key_already\n            << \" but supplied new key = \" << key << \" (ignoring new key)\";\n    return key_already;\n  }\n  if (key == (symbols_.size() - 1) && key == dense_key_limit_) {\n    ++dense_key_limit_;\n  } else {\n    idx_key_.push_back(key);\n    key_map_[key] = symbols_.size() - 1;\n  }\n  if (key >= available_key_) available_key_ = key + 1;\n  check_sum_finalized_ = false;\n  return key;\n}\n\n// TODO(rybach): Consider a more efficient implementation which re-uses holes in\n// the dense-key range or re-arranges the dense-key range from time to time.\nvoid SymbolTableImpl::RemoveSymbol(const int64 key) {\n  auto idx = key;\n  if (key < 0 || key >= dense_key_limit_) {\n    auto iter = key_map_.find(key);\n    if (iter == key_map_.end()) return;\n    idx = iter->second;\n    key_map_.erase(iter);\n  }\n  if (idx < 0 || idx >= symbols_.size()) return;\n  symbols_.RemoveSymbol(idx);\n  // Removed one symbol, all indexes > idx are shifted by -1.\n  for (auto &k : key_map_) {\n    if (k.second > idx) --k.second;\n  }\n  if (key >= 0 && key < dense_key_limit_) {\n    // Removal puts a hole in the dense key range. Adjusts range to [0, key).\n    const auto new_dense_key_limit = key;\n    for (int64 i = key + 1; i < dense_key_limit_; ++i) {\n      key_map_[i] = i - 1;\n    }\n    // Moves existing values in idx_key to new place.\n    idx_key_.resize(symbols_.size() - new_dense_key_limit);\n    for (int64 i = symbols_.size(); i >= dense_key_limit_; --i) {\n      idx_key_[i - new_dense_key_limit - 1] = idx_key_[i - dense_key_limit_];\n    }\n    // Adds indexes for previously dense keys.\n    for (int64 i = new_dense_key_limit; i < dense_key_limit_ - 1; ++i) {\n      idx_key_[i - new_dense_key_limit] = i + 1;\n    }\n    dense_key_limit_ = new_dense_key_limit;\n  } else {\n    // Remove entry for removed index in idx_key.\n    for (int64 i = idx - dense_key_limit_; i < idx_key_.size() - 1; ++i) {\n      idx_key_[i] = idx_key_[i + 1];\n    }\n    idx_key_.pop_back();\n  }\n  if (key == available_key_ - 1) available_key_ = key;\n}\n\nSymbolTableImpl *SymbolTableImpl::Read(std::istream &strm,\n                                       const SymbolTableReadOptions &opts) {\n  int32 magic_number = 0;\n  ReadType(strm, &magic_number);\n  if (strm.fail()) {\n    LOG(ERROR) << \"SymbolTable::Read: Read failed\";\n    return nullptr;\n  }\n  string name;\n  ReadType(strm, &name);\n  std::unique_ptr<SymbolTableImpl> impl(new SymbolTableImpl(name));\n  ReadType(strm, &impl->available_key_);\n  int64 size;\n  ReadType(strm, &size);\n  if (strm.fail()) {\n    LOG(ERROR) << \"SymbolTable::Read: Read failed\";\n    return nullptr;\n  }\n  string symbol;\n  int64 key;\n  impl->check_sum_finalized_ = false;\n  for (int64 i = 0; i < size; ++i) {\n    ReadType(strm, &symbol);\n    ReadType(strm, &key);\n    if (strm.fail()) {\n      LOG(ERROR) << \"SymbolTable::Read: Read failed\";\n      return nullptr;\n    }\n    impl->AddSymbol(symbol, key);\n  }\n  return impl.release();\n}\n\nbool SymbolTableImpl::Write(std::ostream &strm) const {\n  WriteType(strm, kSymbolTableMagicNumber);\n  WriteType(strm, name_);\n  WriteType(strm, available_key_);\n  int64 size = symbols_.size();\n  WriteType(strm, size);\n  for (int64 i = 0; i < size; ++i) {\n    auto key = (i < dense_key_limit_) ? i : idx_key_[i - dense_key_limit_];\n    WriteType(strm, symbols_.GetSymbol(i));\n    WriteType(strm, key);\n  }\n  strm.flush();\n  if (strm.fail()) {\n    LOG(ERROR) << \"SymbolTable::Write: Write failed\";\n    return false;\n  }\n  return true;\n}\n\n}  // namespace internal\n\nvoid SymbolTable::AddTable(const SymbolTable &table) {\n  MutateCheck();\n  for (SymbolTableIterator iter(table); !iter.Done(); iter.Next()) {\n    impl_->AddSymbol(iter.Symbol());\n  }\n}\n\nbool SymbolTable::WriteText(std::ostream &strm,\n                            const SymbolTableTextOptions &opts) const {\n  if (opts.fst_field_separator.empty()) {\n    LOG(ERROR) << \"Missing required field separator\";\n    return false;\n  }\n  bool once_only = false;\n  for (SymbolTableIterator iter(*this); !iter.Done(); iter.Next()) {\n    std::ostringstream line;\n    if (iter.Value() < 0 && !opts.allow_negative_labels && !once_only) {\n      LOG(WARNING) << \"Negative symbol table entry when not allowed\";\n      once_only = true;\n    }\n    line << iter.Symbol() << opts.fst_field_separator[0] << iter.Value()\n         << '\\n';\n    strm.write(line.str().data(), line.str().length());\n  }\n  return true;\n}\n\nnamespace internal {\n\nDenseSymbolMap::DenseSymbolMap()\n    : empty_(-1), buckets_(1 << 4), hash_mask_(buckets_.size() - 1) {\n  std::uninitialized_fill(buckets_.begin(), buckets_.end(), empty_);\n}\n\nDenseSymbolMap::DenseSymbolMap(const DenseSymbolMap &x)\n    : empty_(-1),\n      symbols_(x.symbols_.size()),\n      buckets_(x.buckets_),\n      hash_mask_(x.hash_mask_) {\n  for (size_t i = 0; i < symbols_.size(); ++i) {\n    const auto sz = strlen(x.symbols_[i]) + 1;\n    auto *cpy = new char[sz];\n    memcpy(cpy, x.symbols_[i], sz);\n    symbols_[i] = cpy;\n  }\n}\n\nDenseSymbolMap::~DenseSymbolMap() {\n  for (size_t i = 0; i < symbols_.size(); ++i) {\n    delete[] symbols_[i];\n  }\n}\n\nstd::pair<int64, bool> DenseSymbolMap::InsertOrFind(const string &key) {\n  static constexpr float kMaxOccupancyRatio = 0.75;  // Grows when 75% full.\n  if (symbols_.size() >= kMaxOccupancyRatio * buckets_.size()) {\n    Rehash(buckets_.size() * 2);\n  }\n  size_t idx = str_hash_(key) & hash_mask_;\n  while (buckets_[idx] != empty_) {\n    const auto stored_value = buckets_[idx];\n    if (!strcmp(symbols_[stored_value], key.c_str())) {\n      return {stored_value, false};\n    }\n    idx = (idx + 1) & hash_mask_;\n  }\n  auto next = symbols_.size();\n  buckets_[idx] = next;\n  symbols_.push_back(NewSymbol(key));\n  return {next, true};\n}\n\nint64 DenseSymbolMap::Find(const string &key) const {\n  size_t idx = str_hash_(key) & hash_mask_;\n  while (buckets_[idx] != empty_) {\n    const auto stored_value = buckets_[idx];\n    if (!strcmp(symbols_[stored_value], key.c_str())) {\n      return stored_value;\n    }\n    idx = (idx + 1) & hash_mask_;\n  }\n  return buckets_[idx];\n}\n\nvoid DenseSymbolMap::Rehash(size_t num_buckets) {\n  buckets_.resize(num_buckets);\n  hash_mask_ = buckets_.size() - 1;\n  std::uninitialized_fill(buckets_.begin(), buckets_.end(), empty_);\n  for (size_t i = 0; i < symbols_.size(); ++i) {\n    size_t idx = str_hash_(string(symbols_[i])) & hash_mask_;\n    while (buckets_[idx] != empty_) {\n      idx = (idx + 1) & hash_mask_;\n    }\n    buckets_[idx] = i;\n  }\n}\n\nconst char *DenseSymbolMap::NewSymbol(const string &sym) {\n  auto num = sym.size() + 1;\n  auto newstr = new char[num];\n  memcpy(newstr, sym.c_str(), num);\n  return newstr;\n}\n\nvoid DenseSymbolMap::RemoveSymbol(size_t idx) {\n  delete[] symbols_[idx];\n  symbols_.erase(symbols_.begin() + idx);\n  Rehash(buckets_.size());\n}\n\n}  // namespace internal\n\nbool CompatSymbols(const SymbolTable *syms1, const SymbolTable *syms2,\n                   bool warning) {\n  // Flag can explicitly override this check.\n  if (!FLAGS_fst_compat_symbols) return true;\n  if (syms1 && syms2 &&\n      (syms1->LabeledCheckSum() != syms2->LabeledCheckSum())) {\n    if (warning) {\n      LOG(WARNING) << \"CompatSymbols: Symbol table checksums do not match. \"\n                   << \"Table sizes are \" << syms1->NumSymbols() << \" and \"\n                   << syms2->NumSymbols();\n    }\n    return false;\n  } else {\n    return true;\n  }\n}\n\nvoid SymbolTableToString(const SymbolTable *table, string *result) {\n  std::ostringstream ostrm;\n  table->Write(ostrm);\n  *result = ostrm.str();\n}\n\nSymbolTable *StringToSymbolTable(const string &str) {\n  std::istringstream istrm(str);\n  return SymbolTable::Read(istrm, SymbolTableReadOptions());\n}\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/lib/util.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// FST utility definitions.\n\n#include <fst/util.h>\n#include <cctype>\n#include <sstream>\n#include <string>\n#include <fst/flags.h>\n#include <fst/log.h>\n#include <fst/mapped-file.h>\n\n// Utility flag definitions\n\nDEFINE_bool(fst_error_fatal, true,\n            \"FST errors are fatal; o.w. return objects flagged as bad: \"\n            \"e.g., FSTs: kError property set, FST weights: not a Member()\");\n\nnamespace fst {\n\nvoid SplitString(char *full, const char *delim, std::vector<char *> *vec,\n                 bool omit_empty_strings) {\n  char *p = full;\n  while (p) {\n    if ((p = strpbrk(full, delim))) {\n      p[0] = '\\0';\n    }\n    if (!omit_empty_strings || full[0] != '\\0') vec->push_back(full);\n    if (p) full = p + 1;\n  }\n}\n\nint64 StrToInt64(const string &s, const string &src, size_t nline,\n                 bool allow_negative, bool *error) {\n  int64 n;\n  const char *cs = s.c_str();\n  char *p;\n  if (error) *error = false;\n  n = strtoll(cs, &p, 10);\n  if (p < cs + s.size() || (!allow_negative && n < 0)) {\n    FSTERROR() << \"StrToInt64: Bad integer = \" << s << \"\\\", source = \" << src\n               << \", line = \" << nline;\n    if (error) *error = true;\n    return 0;\n  }\n  return n;\n}\n\nvoid ConvertToLegalCSymbol(string *s) {\n  for (auto it = s->begin(); it != s->end(); ++it) {\n    if (!isalnum(*it)) {\n      *it = '_';\n    }\n  }\n}\n\n// Skips over input characters to align to 'align' bytes. Returns false if can't\n// align.\nbool AlignInput(std::istream &strm) {\n  char c;\n  for (int i = 0; i < MappedFile::kArchAlignment; ++i) {\n    int64 pos = strm.tellg();\n    if (pos < 0) {\n      LOG(ERROR) << \"AlignInput: Can't determine stream position\";\n      return false;\n    }\n    if (pos % MappedFile::kArchAlignment == 0) break;\n    strm.read(&c, 1);\n  }\n  return true;\n}\n\n// Write null output characters to align to 'align' bytes. Returns false if\n// can't align.\nbool AlignOutput(std::ostream &strm) {\n  for (int i = 0; i < MappedFile::kArchAlignment; ++i) {\n    int64 pos = strm.tellp();\n    if (pos < 0) {\n      LOG(ERROR) << \"AlignOutput: Can't determine stream position\";\n      return false;\n    }\n    if (pos % MappedFile::kArchAlignment == 0) break;\n    strm.write(\"\", 1);\n  }\n  return true;\n}\n\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/lib/weight.cc",
    "content": "#include <fst/weight.h>\n\nDEFINE_string(fst_weight_separator, \",\",\n              \"Character separator between printed composite weights; \"\n              \"must be a single character\");\n\nDEFINE_string(fst_weight_parentheses, \"\",\n              \"Characters enclosing the first weight of a printed composite \"\n              \"weight (e.g., pair weight, tuple weight and derived classes) to \"\n              \"ensure proper I/O of nested composite weights; \"\n              \"must have size 0 (none) or 2 (open and close parenthesis)\");\n\nnamespace fst {\n\nnamespace internal {\n\nCompositeWeightIO::CompositeWeightIO(char separator,\n                                     std::pair<char, char> parentheses)\n    : separator_(separator),\n      open_paren_(parentheses.first),\n      close_paren_(parentheses.second),\n      error_(false) {\n  if ((open_paren_ == 0 || close_paren_ == 0) && open_paren_ != close_paren_) {\n    FSTERROR() << \"Invalid configuration of weight parentheses: \"\n               << static_cast<int>(open_paren_) << \" \"\n               << static_cast<int>(close_paren_);\n    error_ = true;\n  }\n}\n\nCompositeWeightIO::CompositeWeightIO()\n    : CompositeWeightIO(FLAGS_fst_weight_separator.empty()\n                            ? 0\n                            : FLAGS_fst_weight_separator.front(),\n                        {FLAGS_fst_weight_parentheses.empty()\n                             ? 0\n                             : FLAGS_fst_weight_parentheses[0],\n                         FLAGS_fst_weight_parentheses.size() < 2\n                             ? 0\n                             : FLAGS_fst_weight_parentheses[1]}) {\n  if (FLAGS_fst_weight_separator.size() != 1) {\n    FSTERROR() << \"CompositeWeight: \"\n               << \"FLAGS_fst_weight_separator.size() is not equal to 1\";\n    error_ = true;\n  }\n  if (!FLAGS_fst_weight_parentheses.empty() &&\n      FLAGS_fst_weight_parentheses.size() != 2) {\n    FSTERROR() << \"CompositeWeight: \"\n               << \"FLAGS_fst_weight_parentheses.size() is not equal to 2\";\n    error_ = true;\n  }\n}\n\n}  // namespace internal\n\nCompositeWeightWriter::CompositeWeightWriter(std::ostream &ostrm)\n    : ostrm_(ostrm) {\n  if (error()) ostrm.clear(std::ios::badbit);\n}\n\nCompositeWeightWriter::CompositeWeightWriter(std::ostream &ostrm,\n                                             char separator,\n                                             std::pair<char, char> parentheses)\n    : internal::CompositeWeightIO(separator, parentheses), ostrm_(ostrm) {\n  if (error()) ostrm_.clear(std::ios::badbit);\n}\n\nvoid CompositeWeightWriter::WriteBegin() {\n  if (open_paren_ != 0) {\n    ostrm_ << open_paren_;\n  }\n}\n\nvoid CompositeWeightWriter::WriteEnd() {\n  if (close_paren_ != 0) {\n    ostrm_ << close_paren_;\n  }\n}\n\nCompositeWeightReader::CompositeWeightReader(std::istream &istrm)\n    : istrm_(istrm) {\n  if (error()) istrm_.clear(std::ios::badbit);\n}\n\nCompositeWeightReader::CompositeWeightReader(std::istream &istrm,\n                                             char separator,\n                                             std::pair<char, char> parentheses)\n    : internal::CompositeWeightIO(separator, parentheses), istrm_(istrm) {\n  if (error()) istrm_.clear(std::ios::badbit);\n}\n\nvoid CompositeWeightReader::ReadBegin() {\n  do {  // Skips whitespace.\n    c_ = istrm_.get();\n  } while (std::isspace(c_));\n  if (open_paren_ != 0) {\n    if (c_ != open_paren_) {\n      FSTERROR() << \"CompositeWeightReader: Open paren missing: \"\n                 << \"fst_weight_parentheses flag set correcty?\";\n      istrm_.clear(std::ios::badbit);\n      return;\n    }\n    ++depth_;\n    c_ = istrm_.get();\n  }\n}\n\nvoid CompositeWeightReader::ReadEnd() {\n  if (c_ != EOF && !std::isspace(c_)) {\n    FSTERROR() << \"CompositeWeightReader: excess character: '\"\n               << static_cast<char>(c_)\n               << \"': fst_weight_parentheses flag set correcty?\";\n    istrm_.clear(std::ios::badbit);\n  }\n}\n\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/script/Makefile.am",
    "content": "AM_CPPFLAGS = -I$(srcdir)/../include $(ICU_CPPFLAGS)\n\nif HAVE_SCRIPT\nlib_LTLIBRARIES = libfstscript.la\nlibfstscript_la_SOURCES = arciterator-class.cc arcsort.cc closure.cc        \\\ncompile.cc compose.cc concat.cc connect.cc convert.cc decode.cc             \\\ndeterminize.cc difference.cc disambiguate.cc draw.cc encode.cc              \\\nencodemapper-class.cc epsnormalize.cc equal.cc equivalent.cc fst-class.cc   \\\ngetters.cc info-impl.cc info.cc intersect.cc invert.cc isomorphic.cc map.cc \\\nminimize.cc print.cc project.cc prune.cc push.cc randequivalent.cc          \\\nrandgen.cc relabel.cc replace.cc reverse.cc reweight.cc rmepsilon.cc        \\\nshortest-distance.cc shortest-path.cc stateiterator-class.cc synchronize.cc \\\ntext-io.cc topsort.cc union.cc weight-class.cc verify.cc\n\nlibfstscript_la_LIBADD = ../lib/libfst.la -lm $(DL_LIBS)\nlibfstscript_la_LDFLAGS = -version-info 10:0:0\nendif\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/script/Makefile.in",
    "content": "# Makefile.in generated by automake 1.14.1 from Makefile.am.\n# @configure_input@\n\n# Copyright (C) 1994-2013 Free Software Foundation, Inc.\n\n# This Makefile.in is free software; the Free Software Foundation\n# gives unlimited permission to copy and/or distribute it,\n# with or without modifications, as long as this notice is preserved.\n\n# This program is distributed in the hope that it will be useful,\n# but WITHOUT ANY WARRANTY, to the extent permitted by law; without\n# even the implied warranty of MERCHANTABILITY or FITNESS FOR A\n# PARTICULAR PURPOSE.\n\n@SET_MAKE@\n\nVPATH = @srcdir@\nam__is_gnu_make = test -n '$(MAKEFILE_LIST)' && test -n '$(MAKELEVEL)'\nam__make_running_with_option = \\\n  case $${target_option-} in \\\n      ?) ;; \\\n      *) echo \"am__make_running_with_option: internal error: invalid\" \\\n              \"target option '$${target_option-}' specified\" >&2; \\\n         exit 1;; \\\n  esac; \\\n  has_opt=no; \\\n  sane_makeflags=$$MAKEFLAGS; \\\n  if $(am__is_gnu_make); then \\\n    sane_makeflags=$$MFLAGS; \\\n  else \\\n    case $$MAKEFLAGS in \\\n      *\\\\[\\ \\\t]*) \\\n        bs=\\\\; \\\n        sane_makeflags=`printf '%s\\n' \"$$MAKEFLAGS\" \\\n          | sed \"s/$$bs$$bs[$$bs $$bs\t]*//g\"`;; \\\n    esac; \\\n  fi; \\\n  skip_next=no; \\\n  strip_trailopt () \\\n  { \\\n    flg=`printf '%s\\n' \"$$flg\" | sed \"s/$$1.*$$//\"`; \\\n  }; \\\n  for flg in $$sane_makeflags; do \\\n    test $$skip_next = yes && { skip_next=no; continue; }; \\\n    case $$flg in \\\n      *=*|--*) continue;; \\\n        -*I) strip_trailopt 'I'; skip_next=yes;; \\\n      -*I?*) strip_trailopt 'I';; \\\n        -*O) strip_trailopt 'O'; skip_next=yes;; \\\n      -*O?*) strip_trailopt 'O';; \\\n        -*l) strip_trailopt 'l'; skip_next=yes;; \\\n      -*l?*) strip_trailopt 'l';; \\\n      -[dEDm]) skip_next=yes;; \\\n      -[JT]) skip_next=yes;; \\\n    esac; \\\n    case $$flg in \\\n      *$$target_option*) has_opt=yes; break;; \\\n    esac; \\\n  done; \\\n  test $$has_opt = yes\nam__make_dryrun = (target_option=n; $(am__make_running_with_option))\nam__make_keepgoing = (target_option=k; $(am__make_running_with_option))\npkgdatadir = $(datadir)/@PACKAGE@\npkgincludedir = $(includedir)/@PACKAGE@\npkglibdir = $(libdir)/@PACKAGE@\npkglibexecdir = $(libexecdir)/@PACKAGE@\nam__cd = CDPATH=\"$${ZSH_VERSION+.}$(PATH_SEPARATOR)\" && cd\ninstall_sh_DATA = $(install_sh) -c -m 644\ninstall_sh_PROGRAM = $(install_sh) -c\ninstall_sh_SCRIPT = $(install_sh) -c\nINSTALL_HEADER = $(INSTALL_DATA)\ntransform = $(program_transform_name)\nNORMAL_INSTALL = :\nPRE_INSTALL = :\nPOST_INSTALL = :\nNORMAL_UNINSTALL = :\nPRE_UNINSTALL = :\nPOST_UNINSTALL = :\nbuild_triplet = @build@\nhost_triplet = @host@\nsubdir = src/script\nDIST_COMMON = $(srcdir)/Makefile.in $(srcdir)/Makefile.am \\\n\t$(top_srcdir)/depcomp\nACLOCAL_M4 = $(top_srcdir)/aclocal.m4\nam__aclocal_m4_deps = $(top_srcdir)/m4/ac_python_devel.m4 \\\n\t$(top_srcdir)/m4/libtool.m4 $(top_srcdir)/m4/ltoptions.m4 \\\n\t$(top_srcdir)/m4/ltsugar.m4 $(top_srcdir)/m4/ltversion.m4 \\\n\t$(top_srcdir)/m4/lt~obsolete.m4 $(top_srcdir)/configure.ac\nam__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \\\n\t$(ACLOCAL_M4)\nmkinstalldirs = $(install_sh) -d\nCONFIG_HEADER = $(top_builddir)/config.h \\\n\t$(top_builddir)/src/include/fst/config.h\nCONFIG_CLEAN_FILES =\nCONFIG_CLEAN_VPATH_FILES =\nam__vpath_adj_setup = srcdirstrip=`echo \"$(srcdir)\" | sed 's|.|.|g'`;\nam__vpath_adj = case $$p in \\\n    $(srcdir)/*) f=`echo \"$$p\" | sed \"s|^$$srcdirstrip/||\"`;; \\\n    *) f=$$p;; \\\n  esac;\nam__strip_dir = f=`echo $$p | sed -e 's|^.*/||'`;\nam__install_max = 40\nam__nobase_strip_setup = \\\n  srcdirstrip=`echo \"$(srcdir)\" | sed 's/[].[^$$\\\\*|]/\\\\\\\\&/g'`\nam__nobase_strip = \\\n  for p in $$list; do echo \"$$p\"; done | sed -e \"s|$$srcdirstrip/||\"\nam__nobase_list = $(am__nobase_strip_setup); \\\n  for p in $$list; do echo \"$$p $$p\"; done | \\\n  sed \"s| $$srcdirstrip/| |;\"' / .*\\//!s/ .*/ ./; s,\\( .*\\)/[^/]*$$,\\1,' | \\\n  $(AWK) 'BEGIN { files[\".\"] = \"\" } { files[$$2] = files[$$2] \" \" $$1; \\\n    if (++n[$$2] == $(am__install_max)) \\\n      { print $$2, files[$$2]; n[$$2] = 0; files[$$2] = \"\" } } \\\n    END { for (dir in files) print dir, files[dir] }'\nam__base_list = \\\n  sed '$$!N;$$!N;$$!N;$$!N;$$!N;$$!N;$$!N;s/\\n/ /g' | \\\n  sed '$$!N;$$!N;$$!N;$$!N;s/\\n/ /g'\nam__uninstall_files_from_dir = { \\\n  test -z \"$$files\" \\\n    || { test ! -d \"$$dir\" && test ! -f \"$$dir\" && test ! -r \"$$dir\"; } \\\n    || { echo \" ( cd '$$dir' && rm -f\" $$files \")\"; \\\n         $(am__cd) \"$$dir\" && rm -f $$files; }; \\\n  }\nam__installdirs = \"$(DESTDIR)$(libdir)\"\nLTLIBRARIES = $(lib_LTLIBRARIES)\nam__DEPENDENCIES_1 =\n@HAVE_SCRIPT_TRUE@libfstscript_la_DEPENDENCIES = ../lib/libfst.la \\\n@HAVE_SCRIPT_TRUE@\t$(am__DEPENDENCIES_1)\nam__libfstscript_la_SOURCES_DIST = arciterator-class.cc arcsort.cc \\\n\tclosure.cc compile.cc compose.cc concat.cc connect.cc \\\n\tconvert.cc decode.cc determinize.cc difference.cc \\\n\tdisambiguate.cc draw.cc encode.cc encodemapper-class.cc \\\n\tepsnormalize.cc equal.cc equivalent.cc fst-class.cc getters.cc \\\n\tinfo-impl.cc info.cc intersect.cc invert.cc isomorphic.cc \\\n\tmap.cc minimize.cc print.cc project.cc prune.cc push.cc \\\n\trandequivalent.cc randgen.cc relabel.cc replace.cc reverse.cc \\\n\treweight.cc rmepsilon.cc shortest-distance.cc shortest-path.cc \\\n\tstateiterator-class.cc synchronize.cc text-io.cc topsort.cc \\\n\tunion.cc weight-class.cc verify.cc\n@HAVE_SCRIPT_TRUE@am_libfstscript_la_OBJECTS = arciterator-class.lo \\\n@HAVE_SCRIPT_TRUE@\tarcsort.lo closure.lo compile.lo compose.lo \\\n@HAVE_SCRIPT_TRUE@\tconcat.lo connect.lo convert.lo decode.lo \\\n@HAVE_SCRIPT_TRUE@\tdeterminize.lo difference.lo disambiguate.lo \\\n@HAVE_SCRIPT_TRUE@\tdraw.lo encode.lo encodemapper-class.lo \\\n@HAVE_SCRIPT_TRUE@\tepsnormalize.lo equal.lo equivalent.lo \\\n@HAVE_SCRIPT_TRUE@\tfst-class.lo getters.lo info-impl.lo info.lo \\\n@HAVE_SCRIPT_TRUE@\tintersect.lo invert.lo isomorphic.lo map.lo \\\n@HAVE_SCRIPT_TRUE@\tminimize.lo print.lo project.lo prune.lo \\\n@HAVE_SCRIPT_TRUE@\tpush.lo randequivalent.lo randgen.lo \\\n@HAVE_SCRIPT_TRUE@\trelabel.lo replace.lo reverse.lo reweight.lo \\\n@HAVE_SCRIPT_TRUE@\trmepsilon.lo shortest-distance.lo \\\n@HAVE_SCRIPT_TRUE@\tshortest-path.lo stateiterator-class.lo \\\n@HAVE_SCRIPT_TRUE@\tsynchronize.lo text-io.lo topsort.lo \\\n@HAVE_SCRIPT_TRUE@\tunion.lo weight-class.lo verify.lo\nlibfstscript_la_OBJECTS = $(am_libfstscript_la_OBJECTS)\nAM_V_lt = $(am__v_lt_@AM_V@)\nam__v_lt_ = $(am__v_lt_@AM_DEFAULT_V@)\nam__v_lt_0 = --silent\nam__v_lt_1 = \nlibfstscript_la_LINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX \\\n\t$(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=link $(CXXLD) \\\n\t$(AM_CXXFLAGS) $(CXXFLAGS) $(libfstscript_la_LDFLAGS) \\\n\t$(LDFLAGS) -o $@\n@HAVE_SCRIPT_TRUE@am_libfstscript_la_rpath = -rpath $(libdir)\nAM_V_P = $(am__v_P_@AM_V@)\nam__v_P_ = $(am__v_P_@AM_DEFAULT_V@)\nam__v_P_0 = false\nam__v_P_1 = :\nAM_V_GEN = $(am__v_GEN_@AM_V@)\nam__v_GEN_ = $(am__v_GEN_@AM_DEFAULT_V@)\nam__v_GEN_0 = @echo \"  GEN     \" $@;\nam__v_GEN_1 = \nAM_V_at = $(am__v_at_@AM_V@)\nam__v_at_ = $(am__v_at_@AM_DEFAULT_V@)\nam__v_at_0 = @\nam__v_at_1 = \nDEFAULT_INCLUDES = \ndepcomp = $(SHELL) $(top_srcdir)/depcomp\nam__depfiles_maybe = depfiles\nam__mv = mv -f\nCXXCOMPILE = $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) \\\n\t$(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS)\nLTCXXCOMPILE = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \\\n\t$(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) \\\n\t$(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) \\\n\t$(AM_CXXFLAGS) $(CXXFLAGS)\nAM_V_CXX = $(am__v_CXX_@AM_V@)\nam__v_CXX_ = $(am__v_CXX_@AM_DEFAULT_V@)\nam__v_CXX_0 = @echo \"  CXX     \" $@;\nam__v_CXX_1 = \nCXXLD = $(CXX)\nCXXLINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \\\n\t$(LIBTOOLFLAGS) --mode=link $(CXXLD) $(AM_CXXFLAGS) \\\n\t$(CXXFLAGS) $(AM_LDFLAGS) $(LDFLAGS) -o $@\nAM_V_CXXLD = $(am__v_CXXLD_@AM_V@)\nam__v_CXXLD_ = $(am__v_CXXLD_@AM_DEFAULT_V@)\nam__v_CXXLD_0 = @echo \"  CXXLD   \" $@;\nam__v_CXXLD_1 = \nSOURCES = $(libfstscript_la_SOURCES)\nDIST_SOURCES = $(am__libfstscript_la_SOURCES_DIST)\nam__can_run_installinfo = \\\n  case $$AM_UPDATE_INFO_DIR in \\\n    n|no|NO) false;; \\\n    *) (install-info --version) >/dev/null 2>&1;; \\\n  esac\nam__tagged_files = $(HEADERS) $(SOURCES) $(TAGS_FILES) $(LISP)\n# Read a list of newline-separated strings from the standard input,\n# and print each of them once, without duplicates.  Input order is\n# *not* preserved.\nam__uniquify_input = $(AWK) '\\\n  BEGIN { nonempty = 0; } \\\n  { items[$$0] = 1; nonempty = 1; } \\\n  END { if (nonempty) { for (i in items) print i; }; } \\\n'\n# Make sure the list of sources is unique.  This is necessary because,\n# e.g., the same source file might be shared among _SOURCES variables\n# for different programs/libraries.\nam__define_uniq_tagged_files = \\\n  list='$(am__tagged_files)'; \\\n  unique=`for i in $$list; do \\\n    if test -f \"$$i\"; then echo $$i; else echo $(srcdir)/$$i; fi; \\\n  done | $(am__uniquify_input)`\nETAGS = etags\nCTAGS = ctags\nDISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST)\nACLOCAL = @ACLOCAL@\nAMTAR = @AMTAR@\nAM_DEFAULT_VERBOSITY = @AM_DEFAULT_VERBOSITY@\nAR = @AR@\nAUTOCONF = @AUTOCONF@\nAUTOHEADER = @AUTOHEADER@\nAUTOMAKE = @AUTOMAKE@\nAWK = @AWK@\nCC = @CC@\nCCDEPMODE = @CCDEPMODE@\nCFLAGS = @CFLAGS@\nCPP = @CPP@\nCPPFLAGS = @CPPFLAGS@\nCXX = @CXX@\nCXXCPP = @CXXCPP@\nCXXDEPMODE = @CXXDEPMODE@\nCXXFLAGS = @CXXFLAGS@\nCYGPATH_W = @CYGPATH_W@\nDEFS = @DEFS@\nDEPDIR = @DEPDIR@\nDLLTOOL = @DLLTOOL@\nDL_LIBS = @DL_LIBS@\nDSYMUTIL = @DSYMUTIL@\nDUMPBIN = @DUMPBIN@\nECHO_C = @ECHO_C@\nECHO_N = @ECHO_N@\nECHO_T = @ECHO_T@\nEGREP = @EGREP@\nEXEEXT = @EXEEXT@\nFGREP = @FGREP@\nGREP = @GREP@\nINSTALL = @INSTALL@\nINSTALL_DATA = @INSTALL_DATA@\nINSTALL_PROGRAM = @INSTALL_PROGRAM@\nINSTALL_SCRIPT = @INSTALL_SCRIPT@\nINSTALL_STRIP_PROGRAM = @INSTALL_STRIP_PROGRAM@\nLD = @LD@\nLDFLAGS = @LDFLAGS@\nLIBOBJS = @LIBOBJS@\nLIBS = @LIBS@\nLIBTOOL = @LIBTOOL@\nLIPO = @LIPO@\nLN_S = @LN_S@\nLTLIBOBJS = @LTLIBOBJS@\nMAKEINFO = @MAKEINFO@\nMANIFEST_TOOL = @MANIFEST_TOOL@\nMKDIR_P = @MKDIR_P@\nNM = @NM@\nNMEDIT = @NMEDIT@\nOBJDUMP = @OBJDUMP@\nOBJEXT = @OBJEXT@\nOTOOL = @OTOOL@\nOTOOL64 = @OTOOL64@\nPACKAGE = @PACKAGE@\nPACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@\nPACKAGE_NAME = @PACKAGE_NAME@\nPACKAGE_STRING = @PACKAGE_STRING@\nPACKAGE_TARNAME = @PACKAGE_TARNAME@\nPACKAGE_URL = @PACKAGE_URL@\nPACKAGE_VERSION = @PACKAGE_VERSION@\nPATH_SEPARATOR = @PATH_SEPARATOR@\nPYTHON = @PYTHON@\nPYTHON_CPPFLAGS = @PYTHON_CPPFLAGS@\nPYTHON_EXEC_PREFIX = @PYTHON_EXEC_PREFIX@\nPYTHON_EXTRA_LDFLAGS = @PYTHON_EXTRA_LDFLAGS@\nPYTHON_EXTRA_LIBS = @PYTHON_EXTRA_LIBS@\nPYTHON_LDFLAGS = @PYTHON_LDFLAGS@\nPYTHON_PLATFORM = @PYTHON_PLATFORM@\nPYTHON_PREFIX = @PYTHON_PREFIX@\nPYTHON_SITE_PKG = @PYTHON_SITE_PKG@\nPYTHON_VERSION = @PYTHON_VERSION@\nRANLIB = @RANLIB@\nSED = @SED@\nSET_MAKE = @SET_MAKE@\nSHELL = @SHELL@\nSTRIP = @STRIP@\nVERSION = @VERSION@\nabs_builddir = @abs_builddir@\nabs_srcdir = @abs_srcdir@\nabs_top_builddir = @abs_top_builddir@\nabs_top_srcdir = @abs_top_srcdir@\nac_ct_AR = @ac_ct_AR@\nac_ct_CC = @ac_ct_CC@\nac_ct_CXX = @ac_ct_CXX@\nac_ct_DUMPBIN = @ac_ct_DUMPBIN@\nam__include = @am__include@\nam__leading_dot = @am__leading_dot@\nam__quote = @am__quote@\nam__tar = @am__tar@\nam__untar = @am__untar@\nbindir = @bindir@\nbuild = @build@\nbuild_alias = @build_alias@\nbuild_cpu = @build_cpu@\nbuild_os = @build_os@\nbuild_vendor = @build_vendor@\nbuilddir = @builddir@\ndatadir = @datadir@\ndatarootdir = @datarootdir@\ndocdir = @docdir@\ndvidir = @dvidir@\nexec_prefix = @exec_prefix@\nhost = @host@\nhost_alias = @host_alias@\nhost_cpu = @host_cpu@\nhost_os = @host_os@\nhost_vendor = @host_vendor@\nhtmldir = @htmldir@\nincludedir = @includedir@\ninfodir = @infodir@\ninstall_sh = @install_sh@\nlibdir = @libdir@\nlibexecdir = @libexecdir@\nlibfstdir = @libfstdir@\nlocaledir = @localedir@\nlocalstatedir = @localstatedir@\nmandir = @mandir@\nmkdir_p = @mkdir_p@\noldincludedir = @oldincludedir@\npdfdir = @pdfdir@\npkgpyexecdir = @pkgpyexecdir@\npkgpythondir = @pkgpythondir@\nprefix = @prefix@\nprogram_transform_name = @program_transform_name@\npsdir = @psdir@\npyexecdir = @pyexecdir@\npythondir = @pythondir@\nsbindir = @sbindir@\nsharedstatedir = @sharedstatedir@\nsrcdir = @srcdir@\nsysconfdir = @sysconfdir@\ntarget_alias = @target_alias@\ntop_build_prefix = @top_build_prefix@\ntop_builddir = @top_builddir@\ntop_srcdir = @top_srcdir@\nAM_CPPFLAGS = -I$(srcdir)/../include $(ICU_CPPFLAGS)\n@HAVE_SCRIPT_TRUE@lib_LTLIBRARIES = libfstscript.la\n@HAVE_SCRIPT_TRUE@libfstscript_la_SOURCES = arciterator-class.cc arcsort.cc closure.cc        \\\n@HAVE_SCRIPT_TRUE@compile.cc compose.cc concat.cc connect.cc convert.cc decode.cc             \\\n@HAVE_SCRIPT_TRUE@determinize.cc difference.cc disambiguate.cc draw.cc encode.cc              \\\n@HAVE_SCRIPT_TRUE@encodemapper-class.cc epsnormalize.cc equal.cc equivalent.cc fst-class.cc   \\\n@HAVE_SCRIPT_TRUE@getters.cc info-impl.cc info.cc intersect.cc invert.cc isomorphic.cc map.cc \\\n@HAVE_SCRIPT_TRUE@minimize.cc print.cc project.cc prune.cc push.cc randequivalent.cc          \\\n@HAVE_SCRIPT_TRUE@randgen.cc relabel.cc replace.cc reverse.cc reweight.cc rmepsilon.cc        \\\n@HAVE_SCRIPT_TRUE@shortest-distance.cc shortest-path.cc stateiterator-class.cc synchronize.cc \\\n@HAVE_SCRIPT_TRUE@text-io.cc topsort.cc union.cc weight-class.cc verify.cc\n\n@HAVE_SCRIPT_TRUE@libfstscript_la_LIBADD = ../lib/libfst.la -lm $(DL_LIBS)\n@HAVE_SCRIPT_TRUE@libfstscript_la_LDFLAGS = -version-info 10:0:0\nall: all-am\n\n.SUFFIXES:\n.SUFFIXES: .cc .lo .o .obj\n$(srcdir)/Makefile.in:  $(srcdir)/Makefile.am  $(am__configure_deps)\n\t@for dep in $?; do \\\n\t  case '$(am__configure_deps)' in \\\n\t    *$$dep*) \\\n\t      ( cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh ) \\\n\t        && { if test -f $@; then exit 0; else break; fi; }; \\\n\t      exit 1;; \\\n\t  esac; \\\n\tdone; \\\n\techo ' cd $(top_srcdir) && $(AUTOMAKE) --foreign src/script/Makefile'; \\\n\t$(am__cd) $(top_srcdir) && \\\n\t  $(AUTOMAKE) --foreign src/script/Makefile\n.PRECIOUS: Makefile\nMakefile: $(srcdir)/Makefile.in $(top_builddir)/config.status\n\t@case '$?' in \\\n\t  *config.status*) \\\n\t    cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh;; \\\n\t  *) \\\n\t    echo ' cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe)'; \\\n\t    cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe);; \\\n\tesac;\n\n$(top_builddir)/config.status: $(top_srcdir)/configure $(CONFIG_STATUS_DEPENDENCIES)\n\tcd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh\n\n$(top_srcdir)/configure:  $(am__configure_deps)\n\tcd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh\n$(ACLOCAL_M4):  $(am__aclocal_m4_deps)\n\tcd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh\n$(am__aclocal_m4_deps):\n\ninstall-libLTLIBRARIES: $(lib_LTLIBRARIES)\n\t@$(NORMAL_INSTALL)\n\t@list='$(lib_LTLIBRARIES)'; test -n \"$(libdir)\" || list=; \\\n\tlist2=; for p in $$list; do \\\n\t  if test -f $$p; then \\\n\t    list2=\"$$list2 $$p\"; \\\n\t  else :; fi; \\\n\tdone; \\\n\ttest -z \"$$list2\" || { \\\n\t  echo \" $(MKDIR_P) '$(DESTDIR)$(libdir)'\"; \\\n\t  $(MKDIR_P) \"$(DESTDIR)$(libdir)\" || exit 1; \\\n\t  echo \" $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) $$list2 '$(DESTDIR)$(libdir)'\"; \\\n\t  $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) $$list2 \"$(DESTDIR)$(libdir)\"; \\\n\t}\n\nuninstall-libLTLIBRARIES:\n\t@$(NORMAL_UNINSTALL)\n\t@list='$(lib_LTLIBRARIES)'; test -n \"$(libdir)\" || list=; \\\n\tfor p in $$list; do \\\n\t  $(am__strip_dir) \\\n\t  echo \" $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=uninstall rm -f '$(DESTDIR)$(libdir)/$$f'\"; \\\n\t  $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=uninstall rm -f \"$(DESTDIR)$(libdir)/$$f\"; \\\n\tdone\n\nclean-libLTLIBRARIES:\n\t-test -z \"$(lib_LTLIBRARIES)\" || rm -f $(lib_LTLIBRARIES)\n\t@list='$(lib_LTLIBRARIES)'; \\\n\tlocs=`for p in $$list; do echo $$p; done | \\\n\t      sed 's|^[^/]*$$|.|; s|/[^/]*$$||; s|$$|/so_locations|' | \\\n\t      sort -u`; \\\n\ttest -z \"$$locs\" || { \\\n\t  echo rm -f $${locs}; \\\n\t  rm -f $${locs}; \\\n\t}\n\nlibfstscript.la: $(libfstscript_la_OBJECTS) $(libfstscript_la_DEPENDENCIES) $(EXTRA_libfstscript_la_DEPENDENCIES) \n\t$(AM_V_CXXLD)$(libfstscript_la_LINK) $(am_libfstscript_la_rpath) $(libfstscript_la_OBJECTS) $(libfstscript_la_LIBADD) $(LIBS)\n\nmostlyclean-compile:\n\t-rm -f *.$(OBJEXT)\n\ndistclean-compile:\n\t-rm -f *.tab.c\n\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/arciterator-class.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/arcsort.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/closure.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/compile.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/compose.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/concat.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/connect.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/convert.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/decode.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/determinize.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/difference.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/disambiguate.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/draw.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/encode.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/encodemapper-class.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/epsnormalize.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/equal.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/equivalent.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fst-class.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/getters.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/info-impl.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/info.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/intersect.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/invert.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/isomorphic.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/map.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/minimize.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/print.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/project.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/prune.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/push.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/randequivalent.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/randgen.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/relabel.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/replace.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/reverse.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/reweight.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/rmepsilon.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/shortest-distance.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/shortest-path.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/stateiterator-class.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/synchronize.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/text-io.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/topsort.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/union.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/verify.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/weight-class.Plo@am__quote@\n\n.cc.o:\n@am__fastdepCXX_TRUE@\t$(AM_V_CXX)depbase=`echo $@ | sed 's|[^/]*$$|$(DEPDIR)/&|;s|\\.o$$||'`;\\\n@am__fastdepCXX_TRUE@\t$(CXXCOMPILE) -MT $@ -MD -MP -MF $$depbase.Tpo -c -o $@ $< &&\\\n@am__fastdepCXX_TRUE@\t$(am__mv) $$depbase.Tpo $$depbase.Po\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\t$(AM_V_CXX)source='$<' object='$@' libtool=no @AMDEPBACKSLASH@\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\tDEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@\n@am__fastdepCXX_FALSE@\t$(AM_V_CXX@am__nodep@)$(CXXCOMPILE) -c -o $@ $<\n\n.cc.obj:\n@am__fastdepCXX_TRUE@\t$(AM_V_CXX)depbase=`echo $@ | sed 's|[^/]*$$|$(DEPDIR)/&|;s|\\.obj$$||'`;\\\n@am__fastdepCXX_TRUE@\t$(CXXCOMPILE) -MT $@ -MD -MP -MF $$depbase.Tpo -c -o $@ `$(CYGPATH_W) '$<'` &&\\\n@am__fastdepCXX_TRUE@\t$(am__mv) $$depbase.Tpo $$depbase.Po\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\t$(AM_V_CXX)source='$<' object='$@' libtool=no @AMDEPBACKSLASH@\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\tDEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@\n@am__fastdepCXX_FALSE@\t$(AM_V_CXX@am__nodep@)$(CXXCOMPILE) -c -o $@ `$(CYGPATH_W) '$<'`\n\n.cc.lo:\n@am__fastdepCXX_TRUE@\t$(AM_V_CXX)depbase=`echo $@ | sed 's|[^/]*$$|$(DEPDIR)/&|;s|\\.lo$$||'`;\\\n@am__fastdepCXX_TRUE@\t$(LTCXXCOMPILE) -MT $@ -MD -MP -MF $$depbase.Tpo -c -o $@ $< &&\\\n@am__fastdepCXX_TRUE@\t$(am__mv) $$depbase.Tpo $$depbase.Plo\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\t$(AM_V_CXX)source='$<' object='$@' libtool=yes @AMDEPBACKSLASH@\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\tDEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@\n@am__fastdepCXX_FALSE@\t$(AM_V_CXX@am__nodep@)$(LTCXXCOMPILE) -c -o $@ $<\n\nmostlyclean-libtool:\n\t-rm -f *.lo\n\nclean-libtool:\n\t-rm -rf .libs _libs\n\nID: $(am__tagged_files)\n\t$(am__define_uniq_tagged_files); mkid -fID $$unique\ntags: tags-am\nTAGS: tags\n\ntags-am: $(TAGS_DEPENDENCIES) $(am__tagged_files)\n\tset x; \\\n\there=`pwd`; \\\n\t$(am__define_uniq_tagged_files); \\\n\tshift; \\\n\tif test -z \"$(ETAGS_ARGS)$$*$$unique\"; then :; else \\\n\t  test -n \"$$unique\" || unique=$$empty_fix; \\\n\t  if test $$# -gt 0; then \\\n\t    $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \\\n\t      \"$$@\" $$unique; \\\n\t  else \\\n\t    $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \\\n\t      $$unique; \\\n\t  fi; \\\n\tfi\nctags: ctags-am\n\nCTAGS: ctags\nctags-am: $(TAGS_DEPENDENCIES) $(am__tagged_files)\n\t$(am__define_uniq_tagged_files); \\\n\ttest -z \"$(CTAGS_ARGS)$$unique\" \\\n\t  || $(CTAGS) $(CTAGSFLAGS) $(AM_CTAGSFLAGS) $(CTAGS_ARGS) \\\n\t     $$unique\n\nGTAGS:\n\there=`$(am__cd) $(top_builddir) && pwd` \\\n\t  && $(am__cd) $(top_srcdir) \\\n\t  && gtags -i $(GTAGS_ARGS) \"$$here\"\ncscopelist: cscopelist-am\n\ncscopelist-am: $(am__tagged_files)\n\tlist='$(am__tagged_files)'; \\\n\tcase \"$(srcdir)\" in \\\n\t  [\\\\/]* | ?:[\\\\/]*) sdir=\"$(srcdir)\" ;; \\\n\t  *) sdir=$(subdir)/$(srcdir) ;; \\\n\tesac; \\\n\tfor i in $$list; do \\\n\t  if test -f \"$$i\"; then \\\n\t    echo \"$(subdir)/$$i\"; \\\n\t  else \\\n\t    echo \"$$sdir/$$i\"; \\\n\t  fi; \\\n\tdone >> $(top_builddir)/cscope.files\n\ndistclean-tags:\n\t-rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags\n\ndistdir: $(DISTFILES)\n\t@srcdirstrip=`echo \"$(srcdir)\" | sed 's/[].[^$$\\\\*]/\\\\\\\\&/g'`; \\\n\ttopsrcdirstrip=`echo \"$(top_srcdir)\" | sed 's/[].[^$$\\\\*]/\\\\\\\\&/g'`; \\\n\tlist='$(DISTFILES)'; \\\n\t  dist_files=`for file in $$list; do echo $$file; done | \\\n\t  sed -e \"s|^$$srcdirstrip/||;t\" \\\n\t      -e \"s|^$$topsrcdirstrip/|$(top_builddir)/|;t\"`; \\\n\tcase $$dist_files in \\\n\t  */*) $(MKDIR_P) `echo \"$$dist_files\" | \\\n\t\t\t   sed '/\\//!d;s|^|$(distdir)/|;s,/[^/]*$$,,' | \\\n\t\t\t   sort -u` ;; \\\n\tesac; \\\n\tfor file in $$dist_files; do \\\n\t  if test -f $$file || test -d $$file; then d=.; else d=$(srcdir); fi; \\\n\t  if test -d $$d/$$file; then \\\n\t    dir=`echo \"/$$file\" | sed -e 's,/[^/]*$$,,'`; \\\n\t    if test -d \"$(distdir)/$$file\"; then \\\n\t      find \"$(distdir)/$$file\" -type d ! -perm -700 -exec chmod u+rwx {} \\;; \\\n\t    fi; \\\n\t    if test -d $(srcdir)/$$file && test $$d != $(srcdir); then \\\n\t      cp -fpR $(srcdir)/$$file \"$(distdir)$$dir\" || exit 1; \\\n\t      find \"$(distdir)/$$file\" -type d ! -perm -700 -exec chmod u+rwx {} \\;; \\\n\t    fi; \\\n\t    cp -fpR $$d/$$file \"$(distdir)$$dir\" || exit 1; \\\n\t  else \\\n\t    test -f \"$(distdir)/$$file\" \\\n\t    || cp -p $$d/$$file \"$(distdir)/$$file\" \\\n\t    || exit 1; \\\n\t  fi; \\\n\tdone\ncheck-am: all-am\ncheck: check-am\nall-am: Makefile $(LTLIBRARIES)\ninstalldirs:\n\tfor dir in \"$(DESTDIR)$(libdir)\"; do \\\n\t  test -z \"$$dir\" || $(MKDIR_P) \"$$dir\"; \\\n\tdone\ninstall: install-am\ninstall-exec: install-exec-am\ninstall-data: install-data-am\nuninstall: uninstall-am\n\ninstall-am: all-am\n\t@$(MAKE) $(AM_MAKEFLAGS) install-exec-am install-data-am\n\ninstallcheck: installcheck-am\ninstall-strip:\n\tif test -z '$(STRIP)'; then \\\n\t  $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" \\\n\t    install_sh_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" INSTALL_STRIP_FLAG=-s \\\n\t      install; \\\n\telse \\\n\t  $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" \\\n\t    install_sh_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" INSTALL_STRIP_FLAG=-s \\\n\t    \"INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'\" install; \\\n\tfi\nmostlyclean-generic:\n\nclean-generic:\n\ndistclean-generic:\n\t-test -z \"$(CONFIG_CLEAN_FILES)\" || rm -f $(CONFIG_CLEAN_FILES)\n\t-test . = \"$(srcdir)\" || test -z \"$(CONFIG_CLEAN_VPATH_FILES)\" || rm -f $(CONFIG_CLEAN_VPATH_FILES)\n\nmaintainer-clean-generic:\n\t@echo \"This command is intended for maintainers to use\"\n\t@echo \"it deletes files that may require special tools to rebuild.\"\nclean: clean-am\n\nclean-am: clean-generic clean-libLTLIBRARIES clean-libtool \\\n\tmostlyclean-am\n\ndistclean: distclean-am\n\t-rm -rf ./$(DEPDIR)\n\t-rm -f Makefile\ndistclean-am: clean-am distclean-compile distclean-generic \\\n\tdistclean-tags\n\ndvi: dvi-am\n\ndvi-am:\n\nhtml: html-am\n\nhtml-am:\n\ninfo: info-am\n\ninfo-am:\n\ninstall-data-am:\n\ninstall-dvi: install-dvi-am\n\ninstall-dvi-am:\n\ninstall-exec-am: install-libLTLIBRARIES\n\ninstall-html: install-html-am\n\ninstall-html-am:\n\ninstall-info: install-info-am\n\ninstall-info-am:\n\ninstall-man:\n\ninstall-pdf: install-pdf-am\n\ninstall-pdf-am:\n\ninstall-ps: install-ps-am\n\ninstall-ps-am:\n\ninstallcheck-am:\n\nmaintainer-clean: maintainer-clean-am\n\t-rm -rf ./$(DEPDIR)\n\t-rm -f Makefile\nmaintainer-clean-am: distclean-am maintainer-clean-generic\n\nmostlyclean: mostlyclean-am\n\nmostlyclean-am: mostlyclean-compile mostlyclean-generic \\\n\tmostlyclean-libtool\n\npdf: pdf-am\n\npdf-am:\n\nps: ps-am\n\nps-am:\n\nuninstall-am: uninstall-libLTLIBRARIES\n\n.MAKE: install-am install-strip\n\n.PHONY: CTAGS GTAGS TAGS all all-am check check-am clean clean-generic \\\n\tclean-libLTLIBRARIES clean-libtool cscopelist-am ctags \\\n\tctags-am distclean distclean-compile distclean-generic \\\n\tdistclean-libtool distclean-tags distdir dvi dvi-am html \\\n\thtml-am info info-am install install-am install-data \\\n\tinstall-data-am install-dvi install-dvi-am install-exec \\\n\tinstall-exec-am install-html install-html-am install-info \\\n\tinstall-info-am install-libLTLIBRARIES install-man install-pdf \\\n\tinstall-pdf-am install-ps install-ps-am install-strip \\\n\tinstallcheck installcheck-am installdirs maintainer-clean \\\n\tmaintainer-clean-generic mostlyclean mostlyclean-compile \\\n\tmostlyclean-generic mostlyclean-libtool pdf pdf-am ps ps-am \\\n\ttags tags-am uninstall uninstall-am uninstall-libLTLIBRARIES\n\n\n# Tell versions [3.59,3.63) of GNU make to not export all variables.\n# Otherwise a system limit (for SysV at least) may be exceeded.\n.NOEXPORT:\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/script/arciterator-class.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/script/arciterator-class.h>\n#include <fst/script/script-impl.h>\n\nnamespace fst {\nnamespace script {\n\nArcIteratorClass::ArcIteratorClass(const FstClass &fst, int64 s)\n    : impl_(nullptr) {\n  InitArcIteratorClassArgs args(fst, s, this);\n  Apply<Operation<InitArcIteratorClassArgs>>(\"InitArcIteratorClass\",\n                                             fst.ArcType(), &args);\n}\n\nMutableArcIteratorClass::MutableArcIteratorClass(MutableFstClass *fst,\n                                                 int64 s) : impl_(nullptr) {\n  InitMutableArcIteratorClassArgs args(fst, s, this);\n  Apply<Operation<InitMutableArcIteratorClassArgs>>(\n      \"InitMutableArcIteratorClass\", fst->ArcType(), &args);\n}\n\nREGISTER_FST_OPERATION(InitArcIteratorClass, StdArc, InitArcIteratorClassArgs);\nREGISTER_FST_OPERATION(InitArcIteratorClass, LogArc, InitArcIteratorClassArgs);\nREGISTER_FST_OPERATION(InitArcIteratorClass, Log64Arc,\n                       InitArcIteratorClassArgs);\n\nREGISTER_FST_OPERATION(InitMutableArcIteratorClass, StdArc,\n                       InitMutableArcIteratorClassArgs);\nREGISTER_FST_OPERATION(InitMutableArcIteratorClass, LogArc,\n                       InitMutableArcIteratorClassArgs);\nREGISTER_FST_OPERATION(InitMutableArcIteratorClass, Log64Arc,\n                       InitMutableArcIteratorClassArgs);\n\n}  // namespace script\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/script/arcsort.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/script/fst-class.h>\n#include <fst/script/arcsort.h>\n#include <fst/script/script-impl.h>\n\nnamespace fst {\nnamespace script {\n\nvoid ArcSort(MutableFstClass *fst, ArcSortType sort_type) {\n  ArcSortArgs args(fst, sort_type);\n  Apply<Operation<ArcSortArgs>>(\"ArcSort\", fst->ArcType(), &args);\n}\n\nREGISTER_FST_OPERATION(ArcSort, StdArc, ArcSortArgs);\nREGISTER_FST_OPERATION(ArcSort, LogArc, ArcSortArgs);\nREGISTER_FST_OPERATION(ArcSort, Log64Arc, ArcSortArgs);\n\n}  // namespace script\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/script/closure.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/script/fst-class.h>\n#include <fst/script/closure.h>\n#include <fst/script/script-impl.h>\n\nnamespace fst {\nnamespace script {\n\nvoid Closure(MutableFstClass *fst, ClosureType closure_type) {\n  ClosureArgs args(fst, closure_type);\n  Apply<Operation<ClosureArgs>>(\"Closure\", fst->ArcType(), &args);\n}\n\nREGISTER_FST_OPERATION(Closure, StdArc, ClosureArgs);\nREGISTER_FST_OPERATION(Closure, LogArc, ClosureArgs);\nREGISTER_FST_OPERATION(Closure, Log64Arc, ClosureArgs);\n\n}  // namespace script\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/script/compile.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <istream>\n#include <string>\n\n#include <fst/script/compile.h>\n#include <fst/script/fst-class.h>\n#include <fst/script/script-impl.h>\n\nnamespace fst {\nnamespace script {\n\nvoid CompileFst(std::istream &istrm, const string &source, const string &dest,\n                const string &fst_type, const string &arc_type,\n                const SymbolTable *isyms, const SymbolTable *osyms,\n                const SymbolTable *ssyms, bool accep, bool ikeep, bool okeep,\n                bool nkeep, bool allow_negative_labels) {\n  std::unique_ptr<FstClass> fst(\n      CompileFstInternal(istrm, source, fst_type, arc_type, isyms, osyms, ssyms,\n                         accep, ikeep, okeep, nkeep, allow_negative_labels));\n  fst->Write(dest);\n}\n\nFstClass *CompileFstInternal(std::istream &istrm, const string &source,\n                             const string &fst_type, const string &arc_type,\n                             const SymbolTable *isyms, const SymbolTable *osyms,\n                             const SymbolTable *ssyms, bool accep, bool ikeep,\n                             bool okeep, bool nkeep,\n                             bool allow_negative_labels) {\n  CompileFstInnerArgs iargs(istrm, source, fst_type, isyms, osyms, ssyms, accep,\n                            ikeep, okeep, nkeep, allow_negative_labels);\n  CompileFstArgs args(iargs);\n  Apply<Operation<CompileFstArgs>>(\"CompileFstInternal\", arc_type, &args);\n  return args.retval;\n}\n\n// This registers 2; 1 does not require registration.\nREGISTER_FST_OPERATION(CompileFstInternal, StdArc, CompileFstArgs);\nREGISTER_FST_OPERATION(CompileFstInternal, LogArc, CompileFstArgs);\nREGISTER_FST_OPERATION(CompileFstInternal, Log64Arc, CompileFstArgs);\n\n}  // namespace script\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/script/compose.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/script/fst-class.h>\n#include <fst/script/compose.h>\n#include <fst/script/script-impl.h>\n\nnamespace fst {\nnamespace script {\n\nvoid Compose(const FstClass &ifst1, const FstClass &ifst2,\n             MutableFstClass *ofst, const ComposeOptions &opts) {\n  if (!internal::ArcTypesMatch(ifst1, ifst2, \"Compose\") ||\n      !internal::ArcTypesMatch(*ofst, ifst1, \"Compose\")) {\n    ofst->SetProperties(kError, kError);\n    return;\n  }\n  ComposeArgs args(ifst1, ifst2, ofst, opts);\n  Apply<Operation<ComposeArgs>>(\"Compose\", ifst1.ArcType(), &args);\n}\n\nREGISTER_FST_OPERATION(Compose, StdArc, ComposeArgs);\nREGISTER_FST_OPERATION(Compose, LogArc, ComposeArgs);\nREGISTER_FST_OPERATION(Compose, Log64Arc, ComposeArgs);\n\n}  // namespace script\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/script/concat.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/script/fst-class.h>\n#include <fst/script/concat.h>\n#include <fst/script/script-impl.h>\n\nnamespace fst {\nnamespace script {\n\n// 1\nvoid Concat(MutableFstClass *ofst, const FstClass &ifst) {\n  if (!internal::ArcTypesMatch(*ofst, ifst, \"Concat\")) {\n    ofst->SetProperties(kError, kError);\n    return;\n  }\n  ConcatArgs1 args(ofst, ifst);\n  Apply<Operation<ConcatArgs1>>(\"Concat\", ofst->ArcType(), &args);\n}\n\n// 2\nvoid Concat(const FstClass &ifst, MutableFstClass *ofst) {\n  if (!internal::ArcTypesMatch(ifst, *ofst, \"Concat\")) {\n    ofst->SetProperties(kError, kError);\n    return;\n  }\n  ConcatArgs2 args(ifst, ofst);\n  Apply<Operation<ConcatArgs2>>(\"Concat\", ofst->ArcType(), &args);\n}\n\nREGISTER_FST_OPERATION(Concat, StdArc, ConcatArgs1);\nREGISTER_FST_OPERATION(Concat, LogArc, ConcatArgs1);\nREGISTER_FST_OPERATION(Concat, Log64Arc, ConcatArgs1);\n\nREGISTER_FST_OPERATION(Concat, StdArc, ConcatArgs2);\nREGISTER_FST_OPERATION(Concat, LogArc, ConcatArgs2);\nREGISTER_FST_OPERATION(Concat, Log64Arc, ConcatArgs2);\n\n}  // namespace script\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/script/connect.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/script/fst-class.h>\n#include <fst/script/connect.h>\n#include <fst/script/script-impl.h>\n\nnamespace fst {\nnamespace script {\n\nvoid Connect(MutableFstClass *fst) {\n  Apply<Operation<MutableFstClass>>(\"Connect\", fst->ArcType(), fst);\n}\n\nREGISTER_FST_OPERATION(Connect, StdArc, MutableFstClass);\nREGISTER_FST_OPERATION(Connect, LogArc, MutableFstClass);\nREGISTER_FST_OPERATION(Connect, Log64Arc, MutableFstClass);\n\n}  // namespace script\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/script/convert.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/script/fst-class.h>\n#include <fst/script/convert.h>\n#include <fst/script/script-impl.h>\n\nnamespace fst {\nnamespace script {\n\nFstClass *Convert(const FstClass &ifst, const string &new_type) {\n  ConvertInnerArgs iargs(ifst, new_type);\n  ConvertArgs args(iargs);\n  Apply<Operation<ConvertArgs>>(\"Convert\", ifst.ArcType(), &args);\n  return args.retval;\n}\n\nREGISTER_FST_OPERATION(Convert, StdArc, ConvertArgs);\nREGISTER_FST_OPERATION(Convert, LogArc, ConvertArgs);\nREGISTER_FST_OPERATION(Convert, Log64Arc, ConvertArgs);\n\n}  // namespace script\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/script/decode.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/script/fst-class.h>\n#include <fst/encode.h>\n#include <fst/script/decode.h>\n#include <fst/script/script-impl.h>\n\nnamespace fst {\nnamespace script {\n\nvoid Decode(MutableFstClass *fst, const string &coder_fname) {\n  DecodeArgs1 args(fst, coder_fname);\n  Apply<Operation<DecodeArgs1>>(\"Decode\", fst->ArcType(), &args);\n}\n\nvoid Decode(MutableFstClass *fst, const EncodeMapperClass &encoder) {\n  if (!internal::ArcTypesMatch(*fst, encoder, \"Decode\")) {\n    fst->SetProperties(kError, kError);\n    return;\n  }\n  DecodeArgs2 args(fst, encoder);\n  Apply<Operation<DecodeArgs2>>(\"Decode\", fst->ArcType(), &args);\n}\n\nREGISTER_FST_OPERATION(Decode, StdArc, DecodeArgs1);\nREGISTER_FST_OPERATION(Decode, LogArc, DecodeArgs1);\nREGISTER_FST_OPERATION(Decode, Log64Arc, DecodeArgs1);\n\nREGISTER_FST_OPERATION(Decode, StdArc, DecodeArgs2);\nREGISTER_FST_OPERATION(Decode, LogArc, DecodeArgs2);\nREGISTER_FST_OPERATION(Decode, Log64Arc, DecodeArgs2);\n\n}  // namespace script\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/script/determinize.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/script/fst-class.h>\n#include <fst/script/determinize.h>\n#include <fst/script/script-impl.h>\n\nnamespace fst {\nnamespace script {\n\nvoid Determinize(const FstClass &ifst, MutableFstClass *ofst,\n                 const DeterminizeOptions &opts) {\n  if (!internal::ArcTypesMatch(ifst, *ofst, \"Determinize\") ||\n      !ofst->WeightTypesMatch(opts.weight_threshold, \"Determinize\")) {\n    ofst->SetProperties(kError, kError);\n    return;\n  }\n  DeterminizeArgs args(ifst, ofst, opts);\n  Apply<Operation<DeterminizeArgs>>(\"Determinize\", ifst.ArcType(), &args);\n}\n\nREGISTER_FST_OPERATION(Determinize, StdArc, DeterminizeArgs);\nREGISTER_FST_OPERATION(Determinize, LogArc, DeterminizeArgs);\nREGISTER_FST_OPERATION(Determinize, Log64Arc, DeterminizeArgs);\n\n}  // namespace script\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/script/difference.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/script/fst-class.h>\n#include <fst/script/difference.h>\n#include <fst/script/script-impl.h>\n\nnamespace fst {\nnamespace script {\n\nvoid Difference(const FstClass &ifst1, const FstClass &ifst2,\n                MutableFstClass *ofst, const ComposeOptions &opts) {\n  if (!internal::ArcTypesMatch(ifst1, ifst2, \"Difference\") ||\n      !internal::ArcTypesMatch(*ofst, ifst1, \"Difference\")) {\n    ofst->SetProperties(kError, kError);\n    return;\n  }\n  DifferenceArgs args(ifst1, ifst2, ofst, opts);\n  Apply<Operation<DifferenceArgs>>(\"Difference\", ifst1.ArcType(), &args);\n}\n\nREGISTER_FST_OPERATION(Difference, StdArc, DifferenceArgs);\nREGISTER_FST_OPERATION(Difference, LogArc, DifferenceArgs);\nREGISTER_FST_OPERATION(Difference, Log64Arc, DifferenceArgs);\n\n}  // namespace script\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/script/disambiguate.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/script/fst-class.h>\n#include <fst/script/disambiguate.h>\n#include <fst/script/script-impl.h>\n\nnamespace fst {\nnamespace script {\n\nvoid Disambiguate(const FstClass &ifst, MutableFstClass *ofst,\n                  const DisambiguateOptions &opts) {\n  if (!internal::ArcTypesMatch(ifst, *ofst, \"Disambiguate\") ||\n      !ofst->WeightTypesMatch(opts.weight_threshold, \"Disambiguate\")) {\n    ofst->SetProperties(kError, kError);\n    return;\n  }\n  DisambiguateArgs args(ifst, ofst, opts);\n  Apply<Operation<DisambiguateArgs>>(\"Disambiguate\", ifst.ArcType(), &args);\n}\n\nREGISTER_FST_OPERATION(Disambiguate, StdArc, DisambiguateArgs);\nREGISTER_FST_OPERATION(Disambiguate, LogArc, DisambiguateArgs);\nREGISTER_FST_OPERATION(Disambiguate, Log64Arc, DisambiguateArgs);\n\n}  // namespace script\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/script/draw.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <ostream>\n#include <string>\n\n#include <fst/script/draw.h>\n#include <fst/script/fst-class.h>\n#include <fst/script/script-impl.h>\n\nnamespace fst {\nnamespace script {\n\nvoid DrawFst(const FstClass &fst, const SymbolTable *isyms,\n             const SymbolTable *osyms, const SymbolTable *ssyms, bool accep,\n             const string &title, float width, float height, bool portrait,\n             bool vertical, float ranksep, float nodesep, int fontsize,\n             int precision, const string &float_format, bool show_weight_one,\n             std::ostream *ostrm, const string &dest) {\n  FstDrawerArgs args(fst, isyms, osyms, ssyms, accep, title, width, height,\n                     portrait, vertical, ranksep, nodesep, fontsize, precision,\n                     float_format, show_weight_one, ostrm, dest);\n  Apply<Operation<FstDrawerArgs>>(\"DrawFst\", fst.ArcType(), &args);\n}\n\nREGISTER_FST_OPERATION(DrawFst, StdArc, FstDrawerArgs);\nREGISTER_FST_OPERATION(DrawFst, LogArc, FstDrawerArgs);\nREGISTER_FST_OPERATION(DrawFst, Log64Arc, FstDrawerArgs);\n\n}  // namespace script\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/script/encode.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/script/fst-class.h>\n#include <fst/encode.h>\n#include <fst/script/encode.h>\n#include <fst/script/script-impl.h>\n\nnamespace fst {\nnamespace script {\n\nvoid Encode(MutableFstClass *fst, uint32 flags, bool reuse_encoder,\n            const string &coder_fname) {\n  EncodeArgs1 args(fst, flags, reuse_encoder, coder_fname);\n  Apply<Operation<EncodeArgs1>>(\"Encode\", fst->ArcType(), &args);\n}\n\nvoid Encode(MutableFstClass *fst, EncodeMapperClass *encoder) {\n  if (!internal::ArcTypesMatch(*fst, *encoder, \"Encode\")) {\n    fst->SetProperties(kError, kError);\n    return;\n  }\n  EncodeArgs2 args(fst, encoder);\n  Apply<Operation<EncodeArgs2>>(\"Encode\", fst->ArcType(), &args);\n}\n\nREGISTER_FST_OPERATION(Encode, StdArc, EncodeArgs1);\nREGISTER_FST_OPERATION(Encode, LogArc, EncodeArgs1);\nREGISTER_FST_OPERATION(Encode, Log64Arc, EncodeArgs1);\n\nREGISTER_FST_OPERATION(Encode, StdArc, EncodeArgs2);\nREGISTER_FST_OPERATION(Encode, LogArc, EncodeArgs2);\nREGISTER_FST_OPERATION(Encode, Log64Arc, EncodeArgs2);\n\n}  // namespace script\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/script/encodemapper-class.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/script/encodemapper-class.h>\n#include <fst/script/script-impl.h>\n\nnamespace fst {\nnamespace script {\n\nEncodeMapperClass::EncodeMapperClass(const string &arc_type, uint32 flags,\n                                      EncodeType type) : impl_(nullptr) {\n  InitEncodeMapperClassArgs args(flags, type, this);\n  Apply<Operation<InitEncodeMapperClassArgs>>(\"InitEncodeMapperClass\",\n                                              arc_type, &args);\n}\n\nREGISTER_FST_OPERATION(InitEncodeMapperClass, StdArc,\n                       InitEncodeMapperClassArgs);\nREGISTER_FST_OPERATION(InitEncodeMapperClass, LogArc,\n                       InitEncodeMapperClassArgs);\nREGISTER_FST_OPERATION(InitEncodeMapperClass, Log64Arc,\n                       InitEncodeMapperClassArgs);\n\n}  // namespace script\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/script/epsnormalize.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/script/fst-class.h>\n#include <fst/script/epsnormalize.h>\n#include <fst/script/script-impl.h>\n\nnamespace fst {\nnamespace script {\n\nvoid EpsNormalize(const FstClass &ifst, MutableFstClass *ofst,\n                  EpsNormalizeType norm_type) {\n  if (!internal::ArcTypesMatch(ifst, *ofst, \"EpsNormalize\")) {\n    ofst->SetProperties(kError, kError);\n    return;\n  }\n  EpsNormalizeArgs args(ifst, ofst, norm_type);\n  Apply<Operation<EpsNormalizeArgs>>(\"EpsNormalize\", ifst.ArcType(), &args);\n}\n\nREGISTER_FST_OPERATION(EpsNormalize, StdArc, EpsNormalizeArgs);\nREGISTER_FST_OPERATION(EpsNormalize, LogArc, EpsNormalizeArgs);\nREGISTER_FST_OPERATION(EpsNormalize, Log64Arc, EpsNormalizeArgs);\n\n}  // namespace script\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/script/equal.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/script/fst-class.h>\n#include <fst/script/equal.h>\n#include <fst/script/script-impl.h>\n\nnamespace fst {\nnamespace script {\n\nbool Equal(const FstClass &fst1, const FstClass &fst2, float delta) {\n  if (!internal::ArcTypesMatch(fst1, fst2, \"Equal\")) return false;\n  EqualInnerArgs iargs(fst1, fst2, delta);\n  EqualArgs args(iargs);\n  Apply<Operation<EqualArgs>>(\"Equal\", fst1.ArcType(), &args);\n  return args.retval;\n}\n\nREGISTER_FST_OPERATION(Equal, StdArc, EqualArgs);\nREGISTER_FST_OPERATION(Equal, LogArc, EqualArgs);\nREGISTER_FST_OPERATION(Equal, Log64Arc, EqualArgs);\n\n}  // namespace script\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/script/equivalent.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/script/fst-class.h>\n#include <fst/script/equivalent.h>\n#include <fst/script/script-impl.h>\n\nnamespace fst {\nnamespace script {\n\nbool Equivalent(const FstClass &fst1, const FstClass &fst2, float delta) {\n  if (!internal::ArcTypesMatch(fst1, fst2, \"Equivalent\")) return false;\n  EquivalentInnerArgs iargs(fst1, fst2, delta);\n  EquivalentArgs args(iargs);\n  Apply<Operation<EquivalentArgs>>(\"Equivalent\", fst1.ArcType(), &args);\n  return args.retval;\n}\n\nREGISTER_FST_OPERATION(Equivalent, StdArc, EquivalentArgs);\nREGISTER_FST_OPERATION(Equivalent, LogArc, EquivalentArgs);\nREGISTER_FST_OPERATION(Equivalent, Log64Arc, EquivalentArgs);\n\n}  // namespace script\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/script/fst-class.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// These classes are only recommended for use in high-level scripting\n// applications. Most users should use the lower-level templated versions\n// corresponding to these classes.\n\n#include <istream>\n\n#include <fst/log.h>\n\n#include <fst/equal.h>\n#include <fst/fst-decl.h>\n#include <fst/reverse.h>\n#include <fst/union.h>\n#include <fst/script/fst-class.h>\n#include <fst/script/register.h>\n\nnamespace fst {\nnamespace script {\n\n// Registration.\n\nREGISTER_FST_CLASSES(StdArc);\nREGISTER_FST_CLASSES(LogArc);\nREGISTER_FST_CLASSES(Log64Arc);\n\n// FstClass methods.\n\nnamespace {\n\ntemplate <class F>\nF *ReadFst(std::istream &istrm, const string &fname) {\n  if (!istrm) {\n    LOG(ERROR) << \"ReadFst: Can't open file: \" << fname;\n    return nullptr;\n  }\n  FstHeader hdr;\n  if (!hdr.Read(istrm, fname)) return nullptr;\n  const FstReadOptions read_options(fname, &hdr);\n  const auto &arc_type = hdr.ArcType();\n  static const auto *io_register = IORegistration<F>::Register::GetRegister();\n  const auto reader = io_register->GetReader(arc_type);\n  if (!reader) {\n    LOG(ERROR) << \"ReadFst: Unknown arc type: \" << arc_type;\n    return nullptr;\n  }\n  return reader(istrm, read_options);\n}\n\n}  // namespace\n\nFstClass *FstClass::Read(const string &fname) {\n  if (!fname.empty()) {\n    std::ifstream istrm(fname, std::ios_base::in | std::ios_base::binary);\n    return ReadFst<FstClass>(istrm, fname);\n  } else {\n    return ReadFst<FstClass>(std::cin, \"standard input\");\n  }\n}\n\nFstClass *FstClass::Read(std::istream &istrm, const string &source) {\n  return ReadFst<FstClass>(istrm, source);\n}\n\nbool FstClass::WeightTypesMatch(const WeightClass &weight,\n                                const string &op_name) const {\n  if (WeightType() != weight.Type()) {\n    FSTERROR() << \"FST and weight with non-matching weight types passed to \"\n               << op_name << \": \" << WeightType() << \" and \" << weight.Type();\n    return false;\n  }\n  return true;\n}\n\n// MutableFstClass methods.\n\nMutableFstClass *MutableFstClass::Read(const string &fname, bool convert) {\n  if (convert == false) {\n    if (!fname.empty()) {\n      std::ifstream in(fname, std::ios_base::in | std::ios_base::binary);\n      return ReadFst<MutableFstClass>(in, fname);\n    } else {\n      return ReadFst<MutableFstClass>(std::cin, \"standard input\");\n    }\n  } else {  // Converts to VectorFstClass if not mutable.\n    std::unique_ptr<FstClass> ifst(FstClass::Read(fname));\n    if (!ifst) return nullptr;\n    if (ifst->Properties(kMutable, false) == kMutable) {\n      return static_cast<MutableFstClass *>(ifst.release());\n    } else {\n      return new VectorFstClass(*ifst.release());\n    }\n  }\n}\n\n// VectorFstClass methods.\n\nVectorFstClass *VectorFstClass::Read(const string &fname) {\n  if (!fname.empty()) {\n    std::ifstream in(fname, std::ios_base::in | std::ios_base::binary);\n    return ReadFst<VectorFstClass>(in, fname);\n  } else {\n    return ReadFst<VectorFstClass>(std::cin, \"standard input\");\n  }\n}\n\nIORegistration<VectorFstClass>::Entry GetVFSTRegisterEntry(\n    const string &arc_type) {\n  static const auto *io_register =\n      IORegistration<VectorFstClass>::Register::GetRegister();\n  return io_register->GetEntry(arc_type);\n}\n\nVectorFstClass::VectorFstClass(const string &arc_type)\n    : MutableFstClass(GetVFSTRegisterEntry(arc_type).creator()) {\n  if (Properties(kError, true) == kError) {\n    FSTERROR() << \"VectorFstClass: Unknown arc type: \" << arc_type;\n  }\n}\n\nVectorFstClass::VectorFstClass(const FstClass &other)\n    : MutableFstClass(GetVFSTRegisterEntry(other.ArcType()).converter(other)) {}\n\n}  // namespace script\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/script/getters.cc",
    "content": "#include <fst/script/getters.h>\n\nnamespace fst {\nnamespace script {\n\nbool GetArcSortType(const string &str, ArcSortType *sort_type) {\n  if (str == \"ilabel\") {\n    *sort_type = ILABEL_SORT;\n  } else if (str == \"olabel\") {\n    *sort_type = OLABEL_SORT;\n  } else {\n    return false;\n  }\n  return true;\n}\n\nbool GetComposeFilter(const string &str, ComposeFilter *compose_filter) {\n  if (str == \"alt_sequence\") {\n    *compose_filter = ALT_SEQUENCE_FILTER;\n  } else if (str == \"auto\") {\n    *compose_filter = AUTO_FILTER;\n  } else if (str == \"match\") {\n    *compose_filter = MATCH_FILTER;\n  } else if (str == \"null\") {\n    *compose_filter = NULL_FILTER;\n  } else if (str == \"sequence\") {\n    *compose_filter = SEQUENCE_FILTER;\n  } else if (str == \"trivial\") {\n    *compose_filter = TRIVIAL_FILTER;\n  } else {\n    return false;\n  }\n  return true;\n}\n\nbool GetDeterminizeType(const string &str, DeterminizeType *det_type) {\n  if (str == \"functional\") {\n    *det_type = DETERMINIZE_FUNCTIONAL;\n  } else if (str == \"nonfunctional\") {\n    *det_type = DETERMINIZE_NONFUNCTIONAL;\n  } else if (str == \"disambiguate\") {\n    *det_type = DETERMINIZE_DISAMBIGUATE;\n  } else {\n    return false;\n  }\n  return true;\n}\n\nbool GetMapType(const string &str, MapType *map_type) {\n  if (str == \"arc_sum\") {\n    *map_type = ARC_SUM_MAPPER;\n  } else if (str == \"arc_unique\") {\n    *map_type = ARC_UNIQUE_MAPPER;\n  } else if (str == \"identity\") {\n    *map_type = IDENTITY_MAPPER;\n  } else if (str == \"input_epsilon\") {\n    *map_type = INPUT_EPSILON_MAPPER;\n  } else if (str == \"invert\") {\n    *map_type = INVERT_MAPPER;\n  } else if (str == \"output_epsilon\") {\n    *map_type = OUTPUT_EPSILON_MAPPER;\n  } else if (str == \"plus\") {\n    *map_type = PLUS_MAPPER;\n  } else if (str == \"power\") {\n    *map_type = POWER_MAPPER;\n  } else if (str == \"quantize\") {\n    *map_type = QUANTIZE_MAPPER;\n  } else if (str == \"rmweight\") {\n    *map_type = RMWEIGHT_MAPPER;\n  } else if (str == \"superfinal\") {\n    *map_type = SUPERFINAL_MAPPER;\n  } else if (str == \"times\") {\n    *map_type = TIMES_MAPPER;\n  } else if (str == \"to_log\") {\n    *map_type = TO_LOG_MAPPER;\n  } else if (str == \"to_log64\") {\n    *map_type = TO_LOG64_MAPPER;\n  } else if (str == \"to_std\" || str == \"to_standard\") {\n    *map_type = TO_STD_MAPPER;\n  } else {\n    return false;\n  }\n  return true;\n}\n\nbool GetRandArcSelection(const string &str, RandArcSelection *ras) {\n  if (str == \"uniform\") {\n    *ras = UNIFORM_ARC_SELECTOR;\n  } else if (str == \"log_prob\") {\n    *ras = LOG_PROB_ARC_SELECTOR;\n  } else if (str == \"fast_log_prob\") {\n    *ras = FAST_LOG_PROB_ARC_SELECTOR;\n  } else {\n    return false;\n  }\n  return true;\n}\n\nbool GetQueueType(const string &str, QueueType *queue_type) {\n  if (str == \"auto\") {\n    *queue_type = AUTO_QUEUE;\n  } else if (str == \"fifo\") {\n    *queue_type = FIFO_QUEUE;\n  } else if (str == \"lifo\") {\n    *queue_type = LIFO_QUEUE;\n  } else if (str == \"shortest\") {\n    *queue_type = SHORTEST_FIRST_QUEUE;\n  } else if (str == \"state\") {\n    *queue_type = STATE_ORDER_QUEUE;\n  } else if (str == \"top\") {\n    *queue_type = TOP_ORDER_QUEUE;\n  } else {\n    return false;\n  }\n  return true;\n}\n\nbool GetReplaceLabelType(const string &str, bool epsilon_on_replace,\n                         ReplaceLabelType *rlt) {\n  if (epsilon_on_replace || str == \"neither\") {\n    *rlt = REPLACE_LABEL_NEITHER;\n  } else if (str == \"input\") {\n    *rlt = REPLACE_LABEL_INPUT;\n  } else if (str == \"output\") {\n    *rlt = REPLACE_LABEL_OUTPUT;\n  } else if (str == \"both\") {\n    *rlt = REPLACE_LABEL_BOTH;\n  } else {\n    return false;\n  }\n  return true;\n}\n\n}  // namespace script\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/script/info-impl.cc",
    "content": "#include <fst/script/info-impl.h>\n\nnamespace fst {\n\nvoid PrintFstInfoImpl(const FstInfo &fstinfo, bool pipe) {\n  std::ostream &ostrm = pipe ? std::cerr : std::cout;\n  const auto old = ostrm.setf(std::ios::left);\n  ostrm.width(50);\n  ostrm << \"fst type\" << fstinfo.FstType() << std::endl;\n  ostrm.width(50);\n  ostrm << \"arc type\" << fstinfo.ArcType() << std::endl;\n  ostrm.width(50);\n  ostrm << \"input symbol table\" << fstinfo.InputSymbols() << std::endl;\n  ostrm.width(50);\n  ostrm << \"output symbol table\" << fstinfo.OutputSymbols() << std::endl;\n  if (!fstinfo.LongInfo()) {\n    ostrm.setf(old);\n    return;\n  }\n  ostrm.width(50);\n  ostrm << \"# of states\" << fstinfo.NumStates() << std::endl;\n  ostrm.width(50);\n  ostrm << \"# of arcs\" << fstinfo.NumArcs() << std::endl;\n  ostrm.width(50);\n  ostrm << \"initial state\" << fstinfo.Start() << std::endl;\n  ostrm.width(50);\n  ostrm << \"# of final states\" << fstinfo.NumFinal() << std::endl;\n  ostrm.width(50);\n  ostrm << \"# of input/output epsilons\" << fstinfo.NumEpsilons() << std::endl;\n  ostrm.width(50);\n  ostrm << \"# of input epsilons\" << fstinfo.NumInputEpsilons() << std::endl;\n  ostrm.width(50);\n  ostrm << \"# of output epsilons\" << fstinfo.NumOutputEpsilons() << std::endl;\n  ostrm.width(50);\n  ostrm << \"input label multiplicity\" << fstinfo.InputLabelMultiplicity()\n        << std::endl;\n  ostrm.width(50);\n  ostrm << \"output label multiplicity\" << fstinfo.OutputLabelMultiplicity()\n        << std::endl;\n  ostrm.width(50);\n  string arc_type = \"\";\n  if (fstinfo.ArcFilterType() == \"epsilon\")\n    arc_type = \"epsilon \";\n  else if (fstinfo.ArcFilterType() == \"iepsilon\")\n    arc_type = \"input-epsilon \";\n  else if (fstinfo.ArcFilterType() == \"oepsilon\")\n    arc_type = \"output-epsilon \";\n  const auto accessible_label = \"# of \" + arc_type + \"accessible states\";\n  ostrm.width(50);\n  ostrm << accessible_label << fstinfo.NumAccessible() << std::endl;\n  const auto coaccessible_label = \"# of \" + arc_type + \"coaccessible states\";\n  ostrm.width(50);\n  ostrm << coaccessible_label << fstinfo.NumCoAccessible() << std::endl;\n  const auto connected_label = \"# of \" + arc_type + \"connected states\";\n  ostrm.width(50);\n  ostrm << connected_label << fstinfo.NumConnected() << std::endl;\n  const auto numcc_label = \"# of \" + arc_type + \"connected components\";\n  ostrm.width(50);\n  ostrm << numcc_label << fstinfo.NumCc() << std::endl;\n  const auto numscc_label = \"# of \" + arc_type + \"strongly conn components\";\n  ostrm.width(50);\n  ostrm << numscc_label << fstinfo.NumScc() << std::endl;\n  ostrm.width(50);\n  ostrm << \"input matcher\"\n        << (fstinfo.InputMatchType() == MATCH_INPUT\n                ? 'y'\n                : fstinfo.InputMatchType() == MATCH_NONE ? 'n' : '?')\n        << std::endl;\n  ostrm.width(50);\n  ostrm << \"output matcher\"\n        << (fstinfo.OutputMatchType() == MATCH_OUTPUT\n                ? 'y'\n                : fstinfo.OutputMatchType() == MATCH_NONE ? 'n' : '?')\n        << std::endl;\n  ostrm.width(50);\n  ostrm << \"input lookahead\" << (fstinfo.InputLookAhead() ? 'y' : 'n')\n        << std::endl;\n  ostrm.width(50);\n  ostrm << \"output lookahead\" << (fstinfo.OutputLookAhead() ? 'y' : 'n')\n        << std::endl;\n  uint64 prop = 1;\n  for (auto i = 0; i < 64; ++i, prop <<= 1) {\n    if (prop & kBinaryProperties) {\n      char value = 'n';\n      if (fstinfo.Properties() & prop) value = 'y';\n      ostrm.width(50);\n      ostrm << PropertyNames[i] << value << std::endl;\n    } else if (prop & kPosTrinaryProperties) {\n      char value = '?';\n      if (fstinfo.Properties() & prop)\n        value = 'y';\n      else if (fstinfo.Properties() & prop << 1)\n        value = 'n';\n      ostrm.width(50);\n      ostrm << PropertyNames[i] << value << std::endl;\n    }\n  }\n  ostrm.setf(old);\n}\n\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/script/info.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <string>\n\n#include <fst/script/fst-class.h>\n#include <fst/script/info.h>\n#include <fst/script/script-impl.h>\n\nnamespace fst {\nnamespace script {\n\nvoid PrintFstInfo(const FstClass &fst, bool test_properties,\n                  const string &arc_filter, const string &info_type, bool pipe,\n                  bool verify) {\n  InfoArgs args(fst, test_properties, arc_filter, info_type, pipe, verify);\n  Apply<Operation<InfoArgs>>(\"PrintFstInfo\", fst.ArcType(), &args);\n}\n\nvoid GetFstInfo(const FstClass &fst, bool test_properties,\n                const string &arc_filter, const string &info_type, bool verify,\n                FstInfo *result) {\n  GetInfoArgs args(fst, test_properties, arc_filter, info_type, verify, result);\n  Apply<Operation<GetInfoArgs>>(\"GetFstInfo\", fst.ArcType(), &args);\n}\n\nREGISTER_FST_OPERATION(PrintFstInfo, StdArc, InfoArgs);\nREGISTER_FST_OPERATION(PrintFstInfo, LogArc, InfoArgs);\nREGISTER_FST_OPERATION(PrintFstInfo, Log64Arc, InfoArgs);\n\nREGISTER_FST_OPERATION(GetFstInfo, StdArc, GetInfoArgs);\nREGISTER_FST_OPERATION(GetFstInfo, LogArc, GetInfoArgs);\nREGISTER_FST_OPERATION(GetFstInfo, Log64Arc, GetInfoArgs);\n\n}  // namespace script\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/script/intersect.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/script/fst-class.h>\n#include <fst/script/intersect.h>\n#include <fst/script/script-impl.h>\n\nnamespace fst {\nnamespace script {\n\nvoid Intersect(const FstClass &ifst1, const FstClass &ifst2,\n               MutableFstClass *ofst, const ComposeOptions &opts) {\n  if (!internal::ArcTypesMatch(ifst1, ifst2, \"Intersect\") ||\n      !internal::ArcTypesMatch(*ofst, ifst1, \"Intersect\")) {\n    ofst->SetProperties(kError, kError);\n    return;\n  }\n  IntersectArgs args(ifst1, ifst2, ofst, opts);\n  Apply<Operation<IntersectArgs>>(\"Intersect\", ifst1.ArcType(), &args);\n}\n\nREGISTER_FST_OPERATION(Intersect, StdArc, IntersectArgs);\nREGISTER_FST_OPERATION(Intersect, LogArc, IntersectArgs);\nREGISTER_FST_OPERATION(Intersect, Log64Arc, IntersectArgs);\n\n}  // namespace script\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/script/invert.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/script/fst-class.h>\n#include <fst/script/invert.h>\n#include <fst/script/script-impl.h>\n\nnamespace fst {\nnamespace script {\n\nvoid Invert(MutableFstClass *fst) {\n  Apply<Operation<MutableFstClass>>(\"Invert\", fst->ArcType(), fst);\n}\n\nREGISTER_FST_OPERATION(Invert, StdArc, MutableFstClass);\nREGISTER_FST_OPERATION(Invert, LogArc, MutableFstClass);\nREGISTER_FST_OPERATION(Invert, Log64Arc, MutableFstClass);\n\n}  // namespace script\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/script/isomorphic.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/script/fst-class.h>\n#include <fst/script/isomorphic.h>\n#include <fst/script/script-impl.h>\n\nnamespace fst {\nnamespace script {\n\nbool Isomorphic(const FstClass &fst1, const FstClass &fst2, float delta) {\n  if (!internal::ArcTypesMatch(fst1, fst2, \"Isomorphic\")) return false;\n  IsomorphicInnerArgs iargs(fst1, fst2, delta);\n  IsomorphicArgs args(iargs);\n  Apply<Operation<IsomorphicArgs>>(\"Isomorphic\", fst1.ArcType(), &args);\n  return args.retval;\n}\n\nREGISTER_FST_OPERATION(Isomorphic, StdArc, IsomorphicArgs);\nREGISTER_FST_OPERATION(Isomorphic, LogArc, IsomorphicArgs);\nREGISTER_FST_OPERATION(Isomorphic, Log64Arc, IsomorphicArgs);\n\n}  // namespace script\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/script/map.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/script/fst-class.h>\n#include <fst/script/map.h>\n#include <fst/script/script-impl.h>\n\nnamespace fst {\nnamespace script {\n\nFstClass *Map(const FstClass &ifst, MapType map_type, float delta, double power,\n              const WeightClass &weight) {\n  if (!ifst.WeightTypesMatch(weight, \"Map\")) return nullptr;\n  MapInnerArgs iargs(ifst, map_type, delta, power, weight);\n  MapArgs args(iargs);\n  Apply<Operation<MapArgs>>(\"Map\", ifst.ArcType(), &args);\n  return args.retval;\n}\n\nREGISTER_FST_OPERATION(Map, StdArc, MapArgs);\nREGISTER_FST_OPERATION(Map, LogArc, MapArgs);\nREGISTER_FST_OPERATION(Map, Log64Arc, MapArgs);\n\n}  // namespace script\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/script/minimize.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/script/fst-class.h>\n#include <fst/script/minimize.h>\n#include <fst/script/script-impl.h>\n\nnamespace fst {\nnamespace script {\n\nvoid Minimize(MutableFstClass *ofst1, MutableFstClass *ofst2, float delta,\n              bool allow_nondet) {\n  if (ofst2 && !internal::ArcTypesMatch(*ofst1, *ofst2, \"Minimize\")) {\n    ofst1->SetProperties(kError, kError);\n    ofst2->SetProperties(kError, kError);\n    return;\n  }\n  MinimizeArgs args(ofst1, ofst2, delta, allow_nondet);\n  Apply<Operation<MinimizeArgs>>(\"Minimize\", ofst1->ArcType(), &args);\n}\n\nREGISTER_FST_OPERATION(Minimize, StdArc, MinimizeArgs);\nREGISTER_FST_OPERATION(Minimize, LogArc, MinimizeArgs);\nREGISTER_FST_OPERATION(Minimize, Log64Arc, MinimizeArgs);\n\n}  // namespace script\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/script/print.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <ostream>\n#include <string>\n\n#include <fst/script/fst-class.h>\n#include <fst/script/print.h>\n#include <fst/script/script-impl.h>\n\nnamespace fst {\nnamespace script {\n\nvoid PrintFst(const FstClass &fst, std::ostream &ostrm, const string &dest,\n              const SymbolTable *isyms, const SymbolTable *osyms,\n              const SymbolTable *ssyms, bool accept, bool show_weight_one,\n              const string &missing_sym) {\n  const auto sep = FLAGS_fst_field_separator.substr(0, 1);\n  FstPrinterArgs args(fst, isyms, osyms, ssyms, accept, show_weight_one, &ostrm,\n                      dest, sep, missing_sym);\n  Apply<Operation<FstPrinterArgs>>(\"PrintFst\", fst.ArcType(), &args);\n}\n\nREGISTER_FST_OPERATION(PrintFst, StdArc, FstPrinterArgs);\nREGISTER_FST_OPERATION(PrintFst, LogArc, FstPrinterArgs);\nREGISTER_FST_OPERATION(PrintFst, Log64Arc, FstPrinterArgs);\n\n}  // namespace script\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/script/project.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/script/fst-class.h>\n#include <fst/script/project.h>\n#include <fst/script/script-impl.h>\n\nnamespace fst {\nnamespace script {\n\n\nvoid Project(MutableFstClass *ofst, ProjectType project_type) {\n  ProjectArgs args(ofst, project_type);\n  Apply<Operation<ProjectArgs>>(\"Project\", ofst->ArcType(), &args);\n}\n\nREGISTER_FST_OPERATION(Project, StdArc, ProjectArgs);\nREGISTER_FST_OPERATION(Project, LogArc, ProjectArgs);\nREGISTER_FST_OPERATION(Project, Log64Arc, ProjectArgs);\n\n}  // namespace script\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/script/prune.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/script/fst-class.h>\n#include <fst/script/prune.h>\n#include <fst/script/script-impl.h>\n\nnamespace fst {\nnamespace script {\n\nvoid Prune(const FstClass &ifst, MutableFstClass *ofst,\n           const WeightClass &weight_threshold,\n           int64 state_threshold, float delta) {\n  if (!internal::ArcTypesMatch(ifst, *ofst, \"Prune\") ||\n      !ofst->WeightTypesMatch(weight_threshold, \"Prune\")) {\n    ofst->SetProperties(kError, kError);\n    return;\n  }\n  PruneArgs1 args(ifst, ofst, weight_threshold, state_threshold, delta);\n  Apply<Operation<PruneArgs1>>(\"Prune\", ifst.ArcType(), &args);\n}\n\nvoid Prune(MutableFstClass *fst, const WeightClass &weight_threshold,\n           int64 state_threshold, float delta) {\n  if (!fst->WeightTypesMatch(weight_threshold, \"Prune\")) {\n    fst->SetProperties(kError, kError);\n    return;\n  }\n  PruneArgs2 args(fst, weight_threshold, state_threshold, delta);\n  Apply<Operation<PruneArgs2>>(\"Prune\", fst->ArcType(), &args);\n}\n\nREGISTER_FST_OPERATION(Prune, StdArc, PruneArgs1);\nREGISTER_FST_OPERATION(Prune, LogArc, PruneArgs1);\nREGISTER_FST_OPERATION(Prune, Log64Arc, PruneArgs1);\n\nREGISTER_FST_OPERATION(Prune, StdArc, PruneArgs2);\nREGISTER_FST_OPERATION(Prune, LogArc, PruneArgs2);\nREGISTER_FST_OPERATION(Prune, Log64Arc, PruneArgs2);\n\n}  // namespace script\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/script/push.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/script/fst-class.h>\n#include <fst/script/push.h>\n#include <fst/script/script-impl.h>\n\nnamespace fst {\nnamespace script {\n\nvoid Push(MutableFstClass *fst, ReweightType rew_type, float delta,\n          bool remove_total_weight) {\n  PushArgs1 args(fst, rew_type, delta, remove_total_weight);\n  Apply<Operation<PushArgs1>>(\"Push\", fst->ArcType(), &args);\n}\n\nvoid Push(const FstClass &ifst, MutableFstClass *ofst, uint32 flags,\n          ReweightType rew_type, float delta) {\n  if (!internal::ArcTypesMatch(ifst, *ofst, \"Push\")) {\n    ofst->SetProperties(kError, kError);\n    return;\n  }\n  PushArgs2 args(ifst, ofst, flags, rew_type, delta);\n  Apply<Operation<PushArgs2>>(\"Push\", ifst.ArcType(), &args);\n}\n\nREGISTER_FST_OPERATION(Push, StdArc, PushArgs1);\nREGISTER_FST_OPERATION(Push, LogArc, PushArgs1);\nREGISTER_FST_OPERATION(Push, Log64Arc, PushArgs1);\n\nREGISTER_FST_OPERATION(Push, StdArc, PushArgs2);\nREGISTER_FST_OPERATION(Push, LogArc, PushArgs2);\nREGISTER_FST_OPERATION(Push, Log64Arc, PushArgs2);\n\n}  // namespace script\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/script/randequivalent.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/script/fst-class.h>\n#include <fst/script/randequivalent.h>\n#include <fst/script/script-impl.h>\n\nnamespace fst {\nnamespace script {\n\nbool RandEquivalent(const FstClass &fst1, const FstClass &fst2, int32 npath,\n                    float delta, time_t seed,\n                    const RandGenOptions<RandArcSelection> &opts) {\n  if (!internal::ArcTypesMatch(fst1, fst2, \"RandEquivalent\")) return false;\n  RandEquivalentInnerArgs iargs(fst1, fst2, npath, delta, seed, opts);\n  RandEquivalentArgs args(iargs);\n  Apply<Operation<RandEquivalentArgs>>(\"RandEquivalent\", fst1.ArcType(), &args);\n  return args.retval;\n}\n\nREGISTER_FST_OPERATION(RandEquivalent, StdArc, RandEquivalentArgs);\nREGISTER_FST_OPERATION(RandEquivalent, LogArc, RandEquivalentArgs);\nREGISTER_FST_OPERATION(RandEquivalent, Log64Arc, RandEquivalentArgs);\n\n}  // namespace script\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/script/randgen.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/script/fst-class.h>\n#include <fst/script/randgen.h>\n#include <fst/script/script-impl.h>\n\nnamespace fst {\nnamespace script {\n\nvoid RandGen(const FstClass &ifst, MutableFstClass *ofst, time_t seed,\n             const RandGenOptions<RandArcSelection> &opts) {\n  if (!internal::ArcTypesMatch(ifst, *ofst, \"RandGen\")) {\n    ofst->SetProperties(kError, kError);\n    return;\n  }\n  RandGenArgs args(ifst, ofst, seed, opts);\n  Apply<Operation<RandGenArgs>>(\"RandGen\", ifst.ArcType(), &args);\n}\n\nREGISTER_FST_OPERATION(RandGen, StdArc, RandGenArgs);\nREGISTER_FST_OPERATION(RandGen, LogArc, RandGenArgs);\nREGISTER_FST_OPERATION(RandGen, Log64Arc, RandGenArgs);\n\n}  // namespace script\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/script/relabel.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/script/fst-class.h>\n#include <fst/script/relabel.h>\n#include <fst/script/script-impl.h>\n\nnamespace fst {\nnamespace script {\n\nvoid Relabel(MutableFstClass *ofst,\n             const SymbolTable *old_isyms, const SymbolTable *relabel_isyms,\n             const string &unknown_isymbol, bool attach_new_isyms,\n             const SymbolTable *old_osyms, const SymbolTable *relabel_osyms,\n             const string &unknown_osymbol, bool attach_new_osyms) {\n  RelabelArgs1 args(ofst, old_isyms, relabel_isyms, unknown_isymbol,\n                    attach_new_isyms, old_osyms, relabel_osyms,\n                    unknown_osymbol, attach_new_osyms);\n  Apply<Operation<RelabelArgs1>>(\"Relabel\", ofst->ArcType(), &args);\n}\n\nvoid Relabel(MutableFstClass *ofst, const std::vector<LabelPair> &ipairs,\n             const std::vector<LabelPair> &opairs) {\n  RelabelArgs2 args(ofst, ipairs, opairs);\n  Apply<Operation<RelabelArgs2>>(\"Relabel\", ofst->ArcType(), &args);\n}\n\nREGISTER_FST_OPERATION(Relabel, StdArc, RelabelArgs1);\nREGISTER_FST_OPERATION(Relabel, LogArc, RelabelArgs1);\nREGISTER_FST_OPERATION(Relabel, Log64Arc, RelabelArgs1);\n\nREGISTER_FST_OPERATION(Relabel, StdArc, RelabelArgs2);\nREGISTER_FST_OPERATION(Relabel, LogArc, RelabelArgs2);\nREGISTER_FST_OPERATION(Relabel, Log64Arc, RelabelArgs2);\n\n}  // namespace script\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/script/replace.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/script/fst-class.h>\n#include <fst/script/replace.h>\n#include <fst/script/script-impl.h>\n\nnamespace fst {\nnamespace script {\n\nvoid Replace(const std::vector<LabelFstClassPair> &pairs, MutableFstClass *ofst,\n             const ReplaceOptions &opts) {\n  if (!pairs.empty()) {\n    for (auto it = pairs.begin(); it != pairs.end() - 1; ++it) {\n      if (!internal::ArcTypesMatch(*it->second, *(it + 1)->second, \"Replace\")) {\n        ofst->SetProperties(kError, kError);\n        return;\n      }\n    }\n    if (!internal::ArcTypesMatch(*pairs[0].second, *ofst, \"Replace\")) {\n      ofst->SetProperties(kError, kError);\n      return;\n    }\n  }\n  ReplaceArgs args(pairs, ofst, opts);\n  Apply<Operation<ReplaceArgs>>(\"Replace\", ofst->ArcType(), &args);\n}\n\nREGISTER_FST_OPERATION(Replace, StdArc, ReplaceArgs);\nREGISTER_FST_OPERATION(Replace, LogArc, ReplaceArgs);\nREGISTER_FST_OPERATION(Replace, Log64Arc, ReplaceArgs);\n\n}  // namespace script\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/script/reverse.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/script/fst-class.h>\n#include <fst/script/reverse.h>\n#include <fst/script/script-impl.h>\n\nnamespace fst {\nnamespace script {\n\nvoid Reverse(const FstClass &ifst, MutableFstClass *ofst,\n             bool require_superinitial) {\n  if (!internal::ArcTypesMatch(ifst, *ofst, \"Reverse\")) {\n    ofst->SetProperties(kError, kError);\n    return;\n  }\n  ReverseArgs args(ifst, ofst, require_superinitial);\n  Apply<Operation<ReverseArgs>>(\"Reverse\", ifst.ArcType(), &args);\n}\n\nREGISTER_FST_OPERATION(Reverse, StdArc, ReverseArgs);\nREGISTER_FST_OPERATION(Reverse, LogArc, ReverseArgs);\nREGISTER_FST_OPERATION(Reverse, Log64Arc, ReverseArgs);\n\n}  // namespace script\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/script/reweight.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/script/fst-class.h>\n#include <fst/script/reweight.h>\n#include <fst/script/script-impl.h>\n\nnamespace fst {\nnamespace script {\n\nvoid Reweight(MutableFstClass *fst, const std::vector<WeightClass> &potential,\n              ReweightType reweight_type) {\n  ReweightArgs args(fst, potential, reweight_type);\n  Apply<Operation<ReweightArgs>>(\"Reweight\", fst->ArcType(), &args);\n}\n\nREGISTER_FST_OPERATION(Reweight, StdArc, ReweightArgs);\nREGISTER_FST_OPERATION(Reweight, LogArc, ReweightArgs);\nREGISTER_FST_OPERATION(Reweight, Log64Arc, ReweightArgs);\n\n}  // namespace script\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/script/rmepsilon.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/script/fst-class.h>\n#include <fst/script/rmepsilon.h>\n#include <fst/script/script-impl.h>\n\nnamespace fst {\nnamespace script {\n\nvoid RmEpsilon(MutableFstClass *fst, const RmEpsilonOptions &opts) {\n  if (!fst->WeightTypesMatch(opts.weight_threshold, \"RmEpsilon\")) {\n    fst->SetProperties(kError, kError);\n    return;\n  }\n  RmEpsilonArgs args(fst, opts);\n  Apply<Operation<RmEpsilonArgs>>(\"RmEpsilon\", fst->ArcType(), &args);\n}\n\nREGISTER_FST_OPERATION(RmEpsilon, StdArc, RmEpsilonArgs);\nREGISTER_FST_OPERATION(RmEpsilon, LogArc, RmEpsilonArgs);\nREGISTER_FST_OPERATION(RmEpsilon, Log64Arc, RmEpsilonArgs);\n\n}  // namespace script\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/script/shortest-distance.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/script/fst-class.h>\n#include <fst/script/script-impl.h>\n#include <fst/script/shortest-distance.h>\n\nnamespace fst {\nnamespace script {\n\nvoid ShortestDistance(const FstClass &fst, std::vector<WeightClass> *distance,\n                      const ShortestDistanceOptions &opts) {\n  ShortestDistanceArgs1 args(fst, distance, opts);\n  Apply<Operation<ShortestDistanceArgs1>>(\"ShortestDistance\", fst.ArcType(),\n                                          &args);\n}\n\nvoid ShortestDistance(const FstClass &ifst, std::vector<WeightClass> *distance,\n                      bool reverse, double delta) {\n  ShortestDistanceArgs2 args(ifst, distance, reverse, delta);\n  Apply<Operation<ShortestDistanceArgs2>>(\"ShortestDistance\", ifst.ArcType(),\n                                          &args);\n}\n\nREGISTER_FST_OPERATION(ShortestDistance, StdArc, ShortestDistanceArgs1);\nREGISTER_FST_OPERATION(ShortestDistance, LogArc, ShortestDistanceArgs1);\nREGISTER_FST_OPERATION(ShortestDistance, Log64Arc, ShortestDistanceArgs1);\n\nREGISTER_FST_OPERATION(ShortestDistance, StdArc, ShortestDistanceArgs2);\nREGISTER_FST_OPERATION(ShortestDistance, LogArc, ShortestDistanceArgs2);\nREGISTER_FST_OPERATION(ShortestDistance, Log64Arc, ShortestDistanceArgs2);\n\n}  // namespace script\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/script/shortest-path.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/script/fst-class.h>\n#include <fst/script/script-impl.h>\n#include <fst/script/shortest-path.h>\n\nnamespace fst {\nnamespace script {\n\nvoid ShortestPath(const FstClass &ifst, MutableFstClass *ofst,\n                  const ShortestPathOptions &opts) {\n  if (!internal::ArcTypesMatch(ifst, *ofst, \"ShortestPath\")) {\n    ofst->SetProperties(kError, kError);\n    return;\n  }\n  ShortestPathArgs args(ifst, ofst, opts);\n  Apply<Operation<ShortestPathArgs>>(\"ShortestPath\", ifst.ArcType(), &args);\n}\n\nREGISTER_FST_OPERATION(ShortestPath, StdArc, ShortestPathArgs);\nREGISTER_FST_OPERATION(ShortestPath, LogArc, ShortestPathArgs);\nREGISTER_FST_OPERATION(ShortestPath, Log64Arc, ShortestPathArgs);\n\n}  // namespace script\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/script/stateiterator-class.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/script/script-impl.h>\n#include <fst/script/stateiterator-class.h>\n\nnamespace fst {\nnamespace script {\n\nStateIteratorClass::StateIteratorClass(const FstClass &fst) : impl_(nullptr) {\n  InitStateIteratorClassArgs args(fst, this);\n  Apply<Operation<InitStateIteratorClassArgs>>(\"InitStateIteratorClass\",\n                                               fst.ArcType(), &args);\n}\n\nREGISTER_FST_OPERATION(InitStateIteratorClass, StdArc,\n                       InitStateIteratorClassArgs);\nREGISTER_FST_OPERATION(InitStateIteratorClass, LogArc,\n                       InitStateIteratorClassArgs);\nREGISTER_FST_OPERATION(InitStateIteratorClass, Log64Arc,\n                       InitStateIteratorClassArgs);\n\n}  // namespace script\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/script/synchronize.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/script/fst-class.h>\n#include <fst/script/script-impl.h>\n#include <fst/script/synchronize.h>\n\nnamespace fst {\nnamespace script {\n\nvoid Synchronize(const FstClass &ifst, MutableFstClass *ofst) {\n  if (!internal::ArcTypesMatch(ifst, *ofst, \"Synchronize\")) {\n    ofst->SetProperties(kError, kError);\n    return;\n  }\n  SynchronizeArgs args(ifst, ofst);\n  Apply<Operation<SynchronizeArgs>>(\"Synchronize\", ifst.ArcType(), &args);\n}\n\nREGISTER_FST_OPERATION(Synchronize, StdArc, SynchronizeArgs);\nREGISTER_FST_OPERATION(Synchronize, LogArc, SynchronizeArgs);\nREGISTER_FST_OPERATION(Synchronize, Log64Arc, SynchronizeArgs);\n\n}  // namespace script\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/script/text-io.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/script/text-io.h>\n\n#include <cstring>\n#include <fstream>\n#include <ostream>\n#include <sstream>\n#include <utility>\n\n#include <fst/log.h>\n#include <fstream>\n#include <fst/util.h>\n\nnamespace fst {\nnamespace script {\n\n// Reads vector of weights; returns true on success.\nbool ReadPotentials(const string &weight_type, const string &filename,\n                    std::vector<WeightClass> *potentials) {\n  std::ifstream istrm(filename);\n  if (!istrm.good()) {\n    LOG(ERROR) << \"ReadPotentials: Can't open file: \" << filename;\n    return false;\n  }\n  static constexpr int kLineLen = 8096;\n  char line[kLineLen];\n  size_t nline = 0;\n  potentials->clear();\n  while (!istrm.getline(line, kLineLen).fail()) {\n    ++nline;\n    std::vector<char *> col;\n    SplitString(line, \"\\n\\t \", &col, true);\n    if (col.empty() || col[0][0] == '\\0') continue;\n    if (col.size() != 2) {\n      FSTERROR() << \"ReadPotentials: Bad number of columns, \"\n                 << \"file = \" << filename << \", line = \" << nline;\n      return false;\n    }\n    const ssize_t s = StrToInt64(col[0], filename, nline, false);\n    const WeightClass weight(weight_type, col[1]);\n    while (potentials->size() <= s) {\n      potentials->push_back(WeightClass::Zero(weight_type));\n    }\n    potentials->back() = weight;\n  }\n  return true;\n}\n\n// Writes vector of weights; returns true on success.\nbool WritePotentials(const string &filename,\n                     const std::vector<WeightClass> &potentials) {\n  std::ofstream ostrm;\n  if (!filename.empty()) {\n    ostrm.open(filename);\n    if (!ostrm.good()) {\n      LOG(ERROR) << \"WritePotentials: Can't open file: \" << filename;\n      return false;\n    }\n  }\n  std::ostream &strm = ostrm.is_open() ? ostrm : std::cout;\n  strm.precision(9);\n  for (size_t s = 0; s < potentials.size(); ++s) {\n    strm << s << \"\\t\" << potentials[s] << \"\\n\";\n  }\n  if (strm.fail()) {\n    LOG(ERROR) << \"WritePotentials: Write failed: \"\n               << (filename.empty() ? \"standard output\" : filename);\n    return false;\n  }\n  return true;\n}\n\n}  // namespace script\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/script/topsort.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/script/fst-class.h>\n#include <fst/script/script-impl.h>\n#include <fst/script/topsort.h>\n\nnamespace fst {\nnamespace script {\n\nbool TopSort(MutableFstClass *fst) {\n  TopSortArgs args(fst);\n  Apply<Operation<TopSortArgs>>(\"TopSort\", fst->ArcType(), &args);\n  return args.retval;\n}\n\nREGISTER_FST_OPERATION(TopSort, StdArc, TopSortArgs);\nREGISTER_FST_OPERATION(TopSort, LogArc, TopSortArgs);\nREGISTER_FST_OPERATION(TopSort, Log64Arc, TopSortArgs);\n\n}  // namespace script\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/script/union.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/script/fst-class.h>\n#include <fst/script/script-impl.h>\n#include <fst/script/union.h>\n\nnamespace fst {\nnamespace script {\n\nvoid Union(MutableFstClass *fst1, const FstClass &fst2) {\n  if (!internal::ArcTypesMatch(*fst1, fst2, \"Union\")) {\n    fst1->SetProperties(kError, kError);\n    return;\n  }\n  UnionArgs args(fst1, fst2);\n  Apply<Operation<UnionArgs>>(\"Union\", fst1->ArcType(), &args);\n}\n\nREGISTER_FST_OPERATION(Union, StdArc, UnionArgs);\nREGISTER_FST_OPERATION(Union, LogArc, UnionArgs);\nREGISTER_FST_OPERATION(Union, Log64Arc, UnionArgs);\n\n}  // namespace script\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/script/verify.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/script/fst-class.h>\n#include <fst/script/script-impl.h>\n#include <fst/script/verify.h>\n\nnamespace fst {\nnamespace script {\n\nbool Verify(const FstClass &fst) {\n  VerifyArgs args(fst);\n  Apply<Operation<VerifyArgs>>(\"Verify\", fst.ArcType(), &args);\n  return args.retval;\n}\n\nREGISTER_FST_OPERATION(Verify, StdArc, VerifyArgs);\nREGISTER_FST_OPERATION(Verify, LogArc, VerifyArgs);\nREGISTER_FST_OPERATION(Verify, Log64Arc, VerifyArgs);\n\n}  // namespace script\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/script/weight-class.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/script/weight-class.h>\n\nnamespace fst {\nnamespace script {\n\nREGISTER_FST_WEIGHT(StdArc::Weight);\nREGISTER_FST_WEIGHT(LogArc::Weight);\nREGISTER_FST_WEIGHT(Log64Arc::Weight);\n\nWeightClass::WeightClass(const string &weight_type, const string &weight_str) {\n  WeightClassRegister *reg = WeightClassRegister::GetRegister();\n  StrToWeightImplBaseT stw = reg->GetEntry(weight_type);\n  if (!stw) {\n    FSTERROR() << \"Unknown weight type: \" << weight_type;\n    impl_.reset();\n    return;\n  }\n  impl_.reset(stw(weight_str, \"WeightClass\", 0));\n}\n\nWeightClass WeightClass::Zero(const string &weight_type) {\n  return WeightClass(weight_type, __ZERO__);\n}\n\nWeightClass WeightClass::One(const string &weight_type) {\n  return WeightClass(weight_type, __ONE__);\n}\n\nWeightClass WeightClass::NoWeight(const string &weight_type) {\n  return WeightClass(weight_type, __NOWEIGHT__);\n}\n\nbool WeightClass::WeightTypesMatch(const WeightClass &other,\n                                   const string &op_name) const {\n  if (Type() != other.Type()) {\n    FSTERROR() << \"Weights with non-matching types passed to \" << op_name\n               << \": \" << Type() << \" and \" << other.Type();\n    return false;\n  }\n  return true;\n}\n\nbool operator==(const WeightClass &lhs, const WeightClass &rhs) {\n  const auto *lhs_impl = lhs.GetImpl();\n  const auto *rhs_impl = rhs.GetImpl();\n  if (!(lhs_impl && rhs_impl && lhs.WeightTypesMatch(rhs, \"operator==\"))) {\n    return false;\n  }\n  return *lhs_impl == *rhs_impl;\n}\n\nbool operator!=(const WeightClass &lhs, const WeightClass &rhs) {\n  return !(lhs == rhs);\n}\n\nWeightClass Plus(const WeightClass &lhs, const WeightClass &rhs) {\n  const auto *rhs_impl = rhs.GetImpl();\n  if (!(lhs.GetImpl() && rhs_impl && lhs.WeightTypesMatch(rhs, \"Plus\"))) {\n    return WeightClass();\n  }\n  WeightClass result(lhs);\n  result.GetImpl()->PlusEq(*rhs_impl);\n  return result;\n}\n\nWeightClass Times(const WeightClass &lhs, const WeightClass &rhs) {\n  const auto *rhs_impl = rhs.GetImpl();\n  if (!(lhs.GetImpl() && rhs_impl && lhs.WeightTypesMatch(rhs, \"Plus\"))) {\n    return WeightClass();\n  }\n  WeightClass result(lhs);\n  result.GetImpl()->TimesEq(*rhs_impl);\n  return result;\n}\n\nWeightClass Divide(const WeightClass &lhs, const WeightClass &rhs) {\n  const auto *rhs_impl = rhs.GetImpl();\n  if (!(lhs.GetImpl() && rhs_impl && lhs.WeightTypesMatch(rhs, \"Divide\"))) {\n    return WeightClass();\n  }\n  WeightClass result(lhs);\n  result.GetImpl()->DivideEq(*rhs_impl);\n  return result;\n}\n\nWeightClass Power(const WeightClass &weight, size_t n) {\n  if (!weight.GetImpl()) return WeightClass();\n  WeightClass result(weight);\n  result.GetImpl()->PowerEq(n);\n  return result;\n}\n\nstd::ostream &operator<<(std::ostream &ostrm, const WeightClass &weight) {\n  weight.impl_->Print(&ostrm);\n  return ostrm;\n}\n\n}  // namespace script\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/test/Makefile.am",
    "content": "AM_CPPFLAGS = -I$(srcdir)/../include $(ICU_CPPFLAGS)\nLDADD = ../lib/libfst.la -lm $(DL_LIBS)\n\ncheck_PROGRAMS = fst_test weight_test\n\nfst_test_SOURCES = fst_test.cc fst_test.h\n\nweight_test_SOURCES = weight_test.cc weight-tester.h\n\nalgo_test_SOURCES = algo_test.cc algo_test.h rand-fst.h\n\ncheck_PROGRAMS += algo_test_log\nalgo_test_log_SOURCES = $(algo_test_SOURCES)\nalgo_test_log_CPPFLAGS = -DTEST_LOG $(AM_CPPFLAGS)\n\ncheck_PROGRAMS += algo_test_tropical\nalgo_test_tropical_SOURCES = $(algo_test_SOURCES)\nalgo_test_tropical_CPPFLAGS = -DTEST_TROPICAL $(AM_CPPFLAGS)\n\ncheck_PROGRAMS += algo_test_minmax\nalgo_test_minmax_SOURCES = $(algo_test_SOURCES)\nalgo_test_minmax_CPPFLAGS = -DTEST_MINMAX $(AM_CPPFLAGS)\n\ncheck_PROGRAMS += algo_test_lexicographic\nalgo_test_lexicographic_SOURCES = $(algo_test_SOURCES)\nalgo_test_lexicographic_CPPFLAGS = -DTEST_LEXICOGRAPHIC $(AM_CPPFLAGS)\n\ncheck_PROGRAMS += algo_test_power\nalgo_test_power_SOURCES = $(algo_test_SOURCES)\nalgo_test_power_CPPFLAGS = -DTEST_POWER $(AM_CPPFLAGS)\n\nTESTS = $(check_PROGRAMS)\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/test/Makefile.in",
    "content": "# Makefile.in generated by automake 1.14.1 from Makefile.am.\n# @configure_input@\n\n# Copyright (C) 1994-2013 Free Software Foundation, Inc.\n\n# This Makefile.in is free software; the Free Software Foundation\n# gives unlimited permission to copy and/or distribute it,\n# with or without modifications, as long as this notice is preserved.\n\n# This program is distributed in the hope that it will be useful,\n# but WITHOUT ANY WARRANTY, to the extent permitted by law; without\n# even the implied warranty of MERCHANTABILITY or FITNESS FOR A\n# PARTICULAR PURPOSE.\n\n@SET_MAKE@\nVPATH = @srcdir@\nam__is_gnu_make = test -n '$(MAKEFILE_LIST)' && test -n '$(MAKELEVEL)'\nam__make_running_with_option = \\\n  case $${target_option-} in \\\n      ?) ;; \\\n      *) echo \"am__make_running_with_option: internal error: invalid\" \\\n              \"target option '$${target_option-}' specified\" >&2; \\\n         exit 1;; \\\n  esac; \\\n  has_opt=no; \\\n  sane_makeflags=$$MAKEFLAGS; \\\n  if $(am__is_gnu_make); then \\\n    sane_makeflags=$$MFLAGS; \\\n  else \\\n    case $$MAKEFLAGS in \\\n      *\\\\[\\ \\\t]*) \\\n        bs=\\\\; \\\n        sane_makeflags=`printf '%s\\n' \"$$MAKEFLAGS\" \\\n          | sed \"s/$$bs$$bs[$$bs $$bs\t]*//g\"`;; \\\n    esac; \\\n  fi; \\\n  skip_next=no; \\\n  strip_trailopt () \\\n  { \\\n    flg=`printf '%s\\n' \"$$flg\" | sed \"s/$$1.*$$//\"`; \\\n  }; \\\n  for flg in $$sane_makeflags; do \\\n    test $$skip_next = yes && { skip_next=no; continue; }; \\\n    case $$flg in \\\n      *=*|--*) continue;; \\\n        -*I) strip_trailopt 'I'; skip_next=yes;; \\\n      -*I?*) strip_trailopt 'I';; \\\n        -*O) strip_trailopt 'O'; skip_next=yes;; \\\n      -*O?*) strip_trailopt 'O';; \\\n        -*l) strip_trailopt 'l'; skip_next=yes;; \\\n      -*l?*) strip_trailopt 'l';; \\\n      -[dEDm]) skip_next=yes;; \\\n      -[JT]) skip_next=yes;; \\\n    esac; \\\n    case $$flg in \\\n      *$$target_option*) has_opt=yes; break;; \\\n    esac; \\\n  done; \\\n  test $$has_opt = yes\nam__make_dryrun = (target_option=n; $(am__make_running_with_option))\nam__make_keepgoing = (target_option=k; $(am__make_running_with_option))\npkgdatadir = $(datadir)/@PACKAGE@\npkgincludedir = $(includedir)/@PACKAGE@\npkglibdir = $(libdir)/@PACKAGE@\npkglibexecdir = $(libexecdir)/@PACKAGE@\nam__cd = CDPATH=\"$${ZSH_VERSION+.}$(PATH_SEPARATOR)\" && cd\ninstall_sh_DATA = $(install_sh) -c -m 644\ninstall_sh_PROGRAM = $(install_sh) -c\ninstall_sh_SCRIPT = $(install_sh) -c\nINSTALL_HEADER = $(INSTALL_DATA)\ntransform = $(program_transform_name)\nNORMAL_INSTALL = :\nPRE_INSTALL = :\nPOST_INSTALL = :\nNORMAL_UNINSTALL = :\nPRE_UNINSTALL = :\nPOST_UNINSTALL = :\nbuild_triplet = @build@\nhost_triplet = @host@\ncheck_PROGRAMS = fst_test$(EXEEXT) weight_test$(EXEEXT) \\\n\talgo_test_log$(EXEEXT) algo_test_tropical$(EXEEXT) \\\n\talgo_test_minmax$(EXEEXT) algo_test_lexicographic$(EXEEXT) \\\n\talgo_test_power$(EXEEXT)\nsubdir = src/test\nDIST_COMMON = $(srcdir)/Makefile.in $(srcdir)/Makefile.am \\\n\t$(top_srcdir)/depcomp $(top_srcdir)/test-driver\nACLOCAL_M4 = $(top_srcdir)/aclocal.m4\nam__aclocal_m4_deps = $(top_srcdir)/m4/ac_python_devel.m4 \\\n\t$(top_srcdir)/m4/libtool.m4 $(top_srcdir)/m4/ltoptions.m4 \\\n\t$(top_srcdir)/m4/ltsugar.m4 $(top_srcdir)/m4/ltversion.m4 \\\n\t$(top_srcdir)/m4/lt~obsolete.m4 $(top_srcdir)/configure.ac\nam__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \\\n\t$(ACLOCAL_M4)\nmkinstalldirs = $(install_sh) -d\nCONFIG_HEADER = $(top_builddir)/config.h \\\n\t$(top_builddir)/src/include/fst/config.h\nCONFIG_CLEAN_FILES =\nCONFIG_CLEAN_VPATH_FILES =\nam__objects_1 = algo_test_lexicographic-algo_test.$(OBJEXT)\nam_algo_test_lexicographic_OBJECTS = $(am__objects_1)\nalgo_test_lexicographic_OBJECTS =  \\\n\t$(am_algo_test_lexicographic_OBJECTS)\nalgo_test_lexicographic_LDADD = $(LDADD)\nam__DEPENDENCIES_1 =\nalgo_test_lexicographic_DEPENDENCIES = ../lib/libfst.la \\\n\t$(am__DEPENDENCIES_1)\nAM_V_lt = $(am__v_lt_@AM_V@)\nam__v_lt_ = $(am__v_lt_@AM_DEFAULT_V@)\nam__v_lt_0 = --silent\nam__v_lt_1 = \nam__objects_2 = algo_test_log-algo_test.$(OBJEXT)\nam_algo_test_log_OBJECTS = $(am__objects_2)\nalgo_test_log_OBJECTS = $(am_algo_test_log_OBJECTS)\nalgo_test_log_LDADD = $(LDADD)\nalgo_test_log_DEPENDENCIES = ../lib/libfst.la $(am__DEPENDENCIES_1)\nam__objects_3 = algo_test_minmax-algo_test.$(OBJEXT)\nam_algo_test_minmax_OBJECTS = $(am__objects_3)\nalgo_test_minmax_OBJECTS = $(am_algo_test_minmax_OBJECTS)\nalgo_test_minmax_LDADD = $(LDADD)\nalgo_test_minmax_DEPENDENCIES = ../lib/libfst.la $(am__DEPENDENCIES_1)\nam__objects_4 = algo_test_power-algo_test.$(OBJEXT)\nam_algo_test_power_OBJECTS = $(am__objects_4)\nalgo_test_power_OBJECTS = $(am_algo_test_power_OBJECTS)\nalgo_test_power_LDADD = $(LDADD)\nalgo_test_power_DEPENDENCIES = ../lib/libfst.la $(am__DEPENDENCIES_1)\nam__objects_5 = algo_test_tropical-algo_test.$(OBJEXT)\nam_algo_test_tropical_OBJECTS = $(am__objects_5)\nalgo_test_tropical_OBJECTS = $(am_algo_test_tropical_OBJECTS)\nalgo_test_tropical_LDADD = $(LDADD)\nalgo_test_tropical_DEPENDENCIES = ../lib/libfst.la \\\n\t$(am__DEPENDENCIES_1)\nam_fst_test_OBJECTS = fst_test.$(OBJEXT)\nfst_test_OBJECTS = $(am_fst_test_OBJECTS)\nfst_test_LDADD = $(LDADD)\nfst_test_DEPENDENCIES = ../lib/libfst.la $(am__DEPENDENCIES_1)\nam_weight_test_OBJECTS = weight_test.$(OBJEXT)\nweight_test_OBJECTS = $(am_weight_test_OBJECTS)\nweight_test_LDADD = $(LDADD)\nweight_test_DEPENDENCIES = ../lib/libfst.la $(am__DEPENDENCIES_1)\nAM_V_P = $(am__v_P_@AM_V@)\nam__v_P_ = $(am__v_P_@AM_DEFAULT_V@)\nam__v_P_0 = false\nam__v_P_1 = :\nAM_V_GEN = $(am__v_GEN_@AM_V@)\nam__v_GEN_ = $(am__v_GEN_@AM_DEFAULT_V@)\nam__v_GEN_0 = @echo \"  GEN     \" $@;\nam__v_GEN_1 = \nAM_V_at = $(am__v_at_@AM_V@)\nam__v_at_ = $(am__v_at_@AM_DEFAULT_V@)\nam__v_at_0 = @\nam__v_at_1 = \nDEFAULT_INCLUDES = \ndepcomp = $(SHELL) $(top_srcdir)/depcomp\nam__depfiles_maybe = depfiles\nam__mv = mv -f\nCXXCOMPILE = $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) \\\n\t$(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS)\nLTCXXCOMPILE = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \\\n\t$(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) \\\n\t$(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) \\\n\t$(AM_CXXFLAGS) $(CXXFLAGS)\nAM_V_CXX = $(am__v_CXX_@AM_V@)\nam__v_CXX_ = $(am__v_CXX_@AM_DEFAULT_V@)\nam__v_CXX_0 = @echo \"  CXX     \" $@;\nam__v_CXX_1 = \nCXXLD = $(CXX)\nCXXLINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \\\n\t$(LIBTOOLFLAGS) --mode=link $(CXXLD) $(AM_CXXFLAGS) \\\n\t$(CXXFLAGS) $(AM_LDFLAGS) $(LDFLAGS) -o $@\nAM_V_CXXLD = $(am__v_CXXLD_@AM_V@)\nam__v_CXXLD_ = $(am__v_CXXLD_@AM_DEFAULT_V@)\nam__v_CXXLD_0 = @echo \"  CXXLD   \" $@;\nam__v_CXXLD_1 = \nCOMPILE = $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) \\\n\t$(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS)\nLTCOMPILE = $(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) \\\n\t$(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) \\\n\t$(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) \\\n\t$(AM_CFLAGS) $(CFLAGS)\nAM_V_CC = $(am__v_CC_@AM_V@)\nam__v_CC_ = $(am__v_CC_@AM_DEFAULT_V@)\nam__v_CC_0 = @echo \"  CC      \" $@;\nam__v_CC_1 = \nCCLD = $(CC)\nLINK = $(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) \\\n\t$(LIBTOOLFLAGS) --mode=link $(CCLD) $(AM_CFLAGS) $(CFLAGS) \\\n\t$(AM_LDFLAGS) $(LDFLAGS) -o $@\nAM_V_CCLD = $(am__v_CCLD_@AM_V@)\nam__v_CCLD_ = $(am__v_CCLD_@AM_DEFAULT_V@)\nam__v_CCLD_0 = @echo \"  CCLD    \" $@;\nam__v_CCLD_1 = \nSOURCES = $(algo_test_lexicographic_SOURCES) $(algo_test_log_SOURCES) \\\n\t$(algo_test_minmax_SOURCES) $(algo_test_power_SOURCES) \\\n\t$(algo_test_tropical_SOURCES) $(fst_test_SOURCES) \\\n\t$(weight_test_SOURCES)\nDIST_SOURCES = $(algo_test_lexicographic_SOURCES) \\\n\t$(algo_test_log_SOURCES) $(algo_test_minmax_SOURCES) \\\n\t$(algo_test_power_SOURCES) $(algo_test_tropical_SOURCES) \\\n\t$(fst_test_SOURCES) $(weight_test_SOURCES)\nam__can_run_installinfo = \\\n  case $$AM_UPDATE_INFO_DIR in \\\n    n|no|NO) false;; \\\n    *) (install-info --version) >/dev/null 2>&1;; \\\n  esac\nam__tagged_files = $(HEADERS) $(SOURCES) $(TAGS_FILES) $(LISP)\n# Read a list of newline-separated strings from the standard input,\n# and print each of them once, without duplicates.  Input order is\n# *not* preserved.\nam__uniquify_input = $(AWK) '\\\n  BEGIN { nonempty = 0; } \\\n  { items[$$0] = 1; nonempty = 1; } \\\n  END { if (nonempty) { for (i in items) print i; }; } \\\n'\n# Make sure the list of sources is unique.  This is necessary because,\n# e.g., the same source file might be shared among _SOURCES variables\n# for different programs/libraries.\nam__define_uniq_tagged_files = \\\n  list='$(am__tagged_files)'; \\\n  unique=`for i in $$list; do \\\n    if test -f \"$$i\"; then echo $$i; else echo $(srcdir)/$$i; fi; \\\n  done | $(am__uniquify_input)`\nETAGS = etags\nCTAGS = ctags\nam__tty_colors_dummy = \\\n  mgn= red= grn= lgn= blu= brg= std=; \\\n  am__color_tests=no\nam__tty_colors = { \\\n  $(am__tty_colors_dummy); \\\n  if test \"X$(AM_COLOR_TESTS)\" = Xno; then \\\n    am__color_tests=no; \\\n  elif test \"X$(AM_COLOR_TESTS)\" = Xalways; then \\\n    am__color_tests=yes; \\\n  elif test \"X$$TERM\" != Xdumb && { test -t 1; } 2>/dev/null; then \\\n    am__color_tests=yes; \\\n  fi; \\\n  if test $$am__color_tests = yes; then \\\n    red='\u001b[0;31m'; \\\n    grn='\u001b[0;32m'; \\\n    lgn='\u001b[1;32m'; \\\n    blu='\u001b[1;34m'; \\\n    mgn='\u001b[0;35m'; \\\n    brg='\u001b[1m'; \\\n    std='\u001b[m'; \\\n  fi; \\\n}\nam__vpath_adj_setup = srcdirstrip=`echo \"$(srcdir)\" | sed 's|.|.|g'`;\nam__vpath_adj = case $$p in \\\n    $(srcdir)/*) f=`echo \"$$p\" | sed \"s|^$$srcdirstrip/||\"`;; \\\n    *) f=$$p;; \\\n  esac;\nam__strip_dir = f=`echo $$p | sed -e 's|^.*/||'`;\nam__install_max = 40\nam__nobase_strip_setup = \\\n  srcdirstrip=`echo \"$(srcdir)\" | sed 's/[].[^$$\\\\*|]/\\\\\\\\&/g'`\nam__nobase_strip = \\\n  for p in $$list; do echo \"$$p\"; done | sed -e \"s|$$srcdirstrip/||\"\nam__nobase_list = $(am__nobase_strip_setup); \\\n  for p in $$list; do echo \"$$p $$p\"; done | \\\n  sed \"s| $$srcdirstrip/| |;\"' / .*\\//!s/ .*/ ./; s,\\( .*\\)/[^/]*$$,\\1,' | \\\n  $(AWK) 'BEGIN { files[\".\"] = \"\" } { files[$$2] = files[$$2] \" \" $$1; \\\n    if (++n[$$2] == $(am__install_max)) \\\n      { print $$2, files[$$2]; n[$$2] = 0; files[$$2] = \"\" } } \\\n    END { for (dir in files) print dir, files[dir] }'\nam__base_list = \\\n  sed '$$!N;$$!N;$$!N;$$!N;$$!N;$$!N;$$!N;s/\\n/ /g' | \\\n  sed '$$!N;$$!N;$$!N;$$!N;s/\\n/ /g'\nam__uninstall_files_from_dir = { \\\n  test -z \"$$files\" \\\n    || { test ! -d \"$$dir\" && test ! -f \"$$dir\" && test ! -r \"$$dir\"; } \\\n    || { echo \" ( cd '$$dir' && rm -f\" $$files \")\"; \\\n         $(am__cd) \"$$dir\" && rm -f $$files; }; \\\n  }\nam__recheck_rx = ^[ \t]*:recheck:[ \t]*\nam__global_test_result_rx = ^[ \t]*:global-test-result:[ \t]*\nam__copy_in_global_log_rx = ^[ \t]*:copy-in-global-log:[ \t]*\n# A command that, given a newline-separated list of test names on the\n# standard input, print the name of the tests that are to be re-run\n# upon \"make recheck\".\nam__list_recheck_tests = $(AWK) '{ \\\n  recheck = 1; \\\n  while ((rc = (getline line < ($$0 \".trs\"))) != 0) \\\n    { \\\n      if (rc < 0) \\\n        { \\\n          if ((getline line2 < ($$0 \".log\")) < 0) \\\n\t    recheck = 0; \\\n          break; \\\n        } \\\n      else if (line ~ /$(am__recheck_rx)[nN][Oo]/) \\\n        { \\\n          recheck = 0; \\\n          break; \\\n        } \\\n      else if (line ~ /$(am__recheck_rx)[yY][eE][sS]/) \\\n        { \\\n          break; \\\n        } \\\n    }; \\\n  if (recheck) \\\n    print $$0; \\\n  close ($$0 \".trs\"); \\\n  close ($$0 \".log\"); \\\n}'\n# A command that, given a newline-separated list of test names on the\n# standard input, create the global log from their .trs and .log files.\nam__create_global_log = $(AWK) ' \\\nfunction fatal(msg) \\\n{ \\\n  print \"fatal: making $@: \" msg | \"cat >&2\"; \\\n  exit 1; \\\n} \\\nfunction rst_section(header) \\\n{ \\\n  print header; \\\n  len = length(header); \\\n  for (i = 1; i <= len; i = i + 1) \\\n    printf \"=\"; \\\n  printf \"\\n\\n\"; \\\n} \\\n{ \\\n  copy_in_global_log = 1; \\\n  global_test_result = \"RUN\"; \\\n  while ((rc = (getline line < ($$0 \".trs\"))) != 0) \\\n    { \\\n      if (rc < 0) \\\n         fatal(\"failed to read from \" $$0 \".trs\"); \\\n      if (line ~ /$(am__global_test_result_rx)/) \\\n        { \\\n          sub(\"$(am__global_test_result_rx)\", \"\", line); \\\n          sub(\"[ \t]*$$\", \"\", line); \\\n          global_test_result = line; \\\n        } \\\n      else if (line ~ /$(am__copy_in_global_log_rx)[nN][oO]/) \\\n        copy_in_global_log = 0; \\\n    }; \\\n  if (copy_in_global_log) \\\n    { \\\n      rst_section(global_test_result \": \" $$0); \\\n      while ((rc = (getline line < ($$0 \".log\"))) != 0) \\\n      { \\\n        if (rc < 0) \\\n          fatal(\"failed to read from \" $$0 \".log\"); \\\n        print line; \\\n      }; \\\n      printf \"\\n\"; \\\n    }; \\\n  close ($$0 \".trs\"); \\\n  close ($$0 \".log\"); \\\n}'\n# Restructured Text title.\nam__rst_title = { sed 's/.*/   &   /;h;s/./=/g;p;x;s/ *$$//;p;g' && echo; }\n# Solaris 10 'make', and several other traditional 'make' implementations,\n# pass \"-e\" to $(SHELL), and POSIX 2008 even requires this.  Work around it\n# by disabling -e (using the XSI extension \"set +e\") if it's set.\nam__sh_e_setup = case $$- in *e*) set +e;; esac\n# Default flags passed to test drivers.\nam__common_driver_flags = \\\n  --color-tests \"$$am__color_tests\" \\\n  --enable-hard-errors \"$$am__enable_hard_errors\" \\\n  --expect-failure \"$$am__expect_failure\"\n# To be inserted before the command running the test.  Creates the\n# directory for the log if needed.  Stores in $dir the directory\n# containing $f, in $tst the test, in $log the log.  Executes the\n# developer- defined test setup AM_TESTS_ENVIRONMENT (if any), and\n# passes TESTS_ENVIRONMENT.  Set up options for the wrapper that\n# will run the test scripts (or their associated LOG_COMPILER, if\n# thy have one).\nam__check_pre = \\\n$(am__sh_e_setup);\t\t\t\t\t\\\n$(am__vpath_adj_setup) $(am__vpath_adj)\t\t\t\\\n$(am__tty_colors);\t\t\t\t\t\\\nsrcdir=$(srcdir); export srcdir;\t\t\t\\\ncase \"$@\" in\t\t\t\t\t\t\\\n  */*) am__odir=`echo \"./$@\" | sed 's|/[^/]*$$||'`;;\t\\\n    *) am__odir=.;; \t\t\t\t\t\\\nesac;\t\t\t\t\t\t\t\\\ntest \"x$$am__odir\" = x\".\" || test -d \"$$am__odir\" \t\\\n  || $(MKDIR_P) \"$$am__odir\" || exit $$?;\t\t\\\nif test -f \"./$$f\"; then dir=./;\t\t\t\\\nelif test -f \"$$f\"; then dir=;\t\t\t\t\\\nelse dir=\"$(srcdir)/\"; fi;\t\t\t\t\\\ntst=$$dir$$f; log='$@'; \t\t\t\t\\\nif test -n '$(DISABLE_HARD_ERRORS)'; then\t\t\\\n  am__enable_hard_errors=no; \t\t\t\t\\\nelse\t\t\t\t\t\t\t\\\n  am__enable_hard_errors=yes; \t\t\t\t\\\nfi; \t\t\t\t\t\t\t\\\ncase \" $(XFAIL_TESTS) \" in\t\t\t\t\\\n  *[\\ \\\t]$$f[\\ \\\t]* | *[\\ \\\t]$$dir$$f[\\ \\\t]*) \\\n    am__expect_failure=yes;;\t\t\t\t\\\n  *)\t\t\t\t\t\t\t\\\n    am__expect_failure=no;;\t\t\t\t\\\nesac; \t\t\t\t\t\t\t\\\n$(AM_TESTS_ENVIRONMENT) $(TESTS_ENVIRONMENT)\n# A shell command to get the names of the tests scripts with any registered\n# extension removed (i.e., equivalently, the names of the test logs, with\n# the '.log' extension removed).  The result is saved in the shell variable\n# '$bases'.  This honors runtime overriding of TESTS and TEST_LOGS.  Sadly,\n# we cannot use something simpler, involving e.g., \"$(TEST_LOGS:.log=)\",\n# since that might cause problem with VPATH rewrites for suffix-less tests.\n# See also 'test-harness-vpath-rewrite.sh' and 'test-trs-basic.sh'.\nam__set_TESTS_bases = \\\n  bases='$(TEST_LOGS)'; \\\n  bases=`for i in $$bases; do echo $$i; done | sed 's/\\.log$$//'`; \\\n  bases=`echo $$bases`\nRECHECK_LOGS = $(TEST_LOGS)\nAM_RECURSIVE_TARGETS = check recheck\nTEST_SUITE_LOG = test-suite.log\nTEST_EXTENSIONS = @EXEEXT@ .test\nLOG_DRIVER = $(SHELL) $(top_srcdir)/test-driver\nLOG_COMPILE = $(LOG_COMPILER) $(AM_LOG_FLAGS) $(LOG_FLAGS)\nam__set_b = \\\n  case '$@' in \\\n    */*) \\\n      case '$*' in \\\n        */*) b='$*';; \\\n          *) b=`echo '$@' | sed 's/\\.log$$//'`; \\\n       esac;; \\\n    *) \\\n      b='$*';; \\\n  esac\nam__test_logs1 = $(TESTS:=.log)\nam__test_logs2 = $(am__test_logs1:@EXEEXT@.log=.log)\nTEST_LOGS = $(am__test_logs2:.test.log=.log)\nTEST_LOG_DRIVER = $(SHELL) $(top_srcdir)/test-driver\nTEST_LOG_COMPILE = $(TEST_LOG_COMPILER) $(AM_TEST_LOG_FLAGS) \\\n\t$(TEST_LOG_FLAGS)\nDISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST)\nACLOCAL = @ACLOCAL@\nAMTAR = @AMTAR@\nAM_DEFAULT_VERBOSITY = @AM_DEFAULT_VERBOSITY@\nAR = @AR@\nAUTOCONF = @AUTOCONF@\nAUTOHEADER = @AUTOHEADER@\nAUTOMAKE = @AUTOMAKE@\nAWK = @AWK@\nCC = @CC@\nCCDEPMODE = @CCDEPMODE@\nCFLAGS = @CFLAGS@\nCPP = @CPP@\nCPPFLAGS = @CPPFLAGS@\nCXX = @CXX@\nCXXCPP = @CXXCPP@\nCXXDEPMODE = @CXXDEPMODE@\nCXXFLAGS = @CXXFLAGS@\nCYGPATH_W = @CYGPATH_W@\nDEFS = @DEFS@\nDEPDIR = @DEPDIR@\nDLLTOOL = @DLLTOOL@\nDL_LIBS = @DL_LIBS@\nDSYMUTIL = @DSYMUTIL@\nDUMPBIN = @DUMPBIN@\nECHO_C = @ECHO_C@\nECHO_N = @ECHO_N@\nECHO_T = @ECHO_T@\nEGREP = @EGREP@\nEXEEXT = @EXEEXT@\nFGREP = @FGREP@\nGREP = @GREP@\nINSTALL = @INSTALL@\nINSTALL_DATA = @INSTALL_DATA@\nINSTALL_PROGRAM = @INSTALL_PROGRAM@\nINSTALL_SCRIPT = @INSTALL_SCRIPT@\nINSTALL_STRIP_PROGRAM = @INSTALL_STRIP_PROGRAM@\nLD = @LD@\nLDFLAGS = @LDFLAGS@\nLIBOBJS = @LIBOBJS@\nLIBS = @LIBS@\nLIBTOOL = @LIBTOOL@\nLIPO = @LIPO@\nLN_S = @LN_S@\nLTLIBOBJS = @LTLIBOBJS@\nMAKEINFO = @MAKEINFO@\nMANIFEST_TOOL = @MANIFEST_TOOL@\nMKDIR_P = @MKDIR_P@\nNM = @NM@\nNMEDIT = @NMEDIT@\nOBJDUMP = @OBJDUMP@\nOBJEXT = @OBJEXT@\nOTOOL = @OTOOL@\nOTOOL64 = @OTOOL64@\nPACKAGE = @PACKAGE@\nPACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@\nPACKAGE_NAME = @PACKAGE_NAME@\nPACKAGE_STRING = @PACKAGE_STRING@\nPACKAGE_TARNAME = @PACKAGE_TARNAME@\nPACKAGE_URL = @PACKAGE_URL@\nPACKAGE_VERSION = @PACKAGE_VERSION@\nPATH_SEPARATOR = @PATH_SEPARATOR@\nPYTHON = @PYTHON@\nPYTHON_CPPFLAGS = @PYTHON_CPPFLAGS@\nPYTHON_EXEC_PREFIX = @PYTHON_EXEC_PREFIX@\nPYTHON_EXTRA_LDFLAGS = @PYTHON_EXTRA_LDFLAGS@\nPYTHON_EXTRA_LIBS = @PYTHON_EXTRA_LIBS@\nPYTHON_LDFLAGS = @PYTHON_LDFLAGS@\nPYTHON_PLATFORM = @PYTHON_PLATFORM@\nPYTHON_PREFIX = @PYTHON_PREFIX@\nPYTHON_SITE_PKG = @PYTHON_SITE_PKG@\nPYTHON_VERSION = @PYTHON_VERSION@\nRANLIB = @RANLIB@\nSED = @SED@\nSET_MAKE = @SET_MAKE@\nSHELL = @SHELL@\nSTRIP = @STRIP@\nVERSION = @VERSION@\nabs_builddir = @abs_builddir@\nabs_srcdir = @abs_srcdir@\nabs_top_builddir = @abs_top_builddir@\nabs_top_srcdir = @abs_top_srcdir@\nac_ct_AR = @ac_ct_AR@\nac_ct_CC = @ac_ct_CC@\nac_ct_CXX = @ac_ct_CXX@\nac_ct_DUMPBIN = @ac_ct_DUMPBIN@\nam__include = @am__include@\nam__leading_dot = @am__leading_dot@\nam__quote = @am__quote@\nam__tar = @am__tar@\nam__untar = @am__untar@\nbindir = @bindir@\nbuild = @build@\nbuild_alias = @build_alias@\nbuild_cpu = @build_cpu@\nbuild_os = @build_os@\nbuild_vendor = @build_vendor@\nbuilddir = @builddir@\ndatadir = @datadir@\ndatarootdir = @datarootdir@\ndocdir = @docdir@\ndvidir = @dvidir@\nexec_prefix = @exec_prefix@\nhost = @host@\nhost_alias = @host_alias@\nhost_cpu = @host_cpu@\nhost_os = @host_os@\nhost_vendor = @host_vendor@\nhtmldir = @htmldir@\nincludedir = @includedir@\ninfodir = @infodir@\ninstall_sh = @install_sh@\nlibdir = @libdir@\nlibexecdir = @libexecdir@\nlibfstdir = @libfstdir@\nlocaledir = @localedir@\nlocalstatedir = @localstatedir@\nmandir = @mandir@\nmkdir_p = @mkdir_p@\noldincludedir = @oldincludedir@\npdfdir = @pdfdir@\npkgpyexecdir = @pkgpyexecdir@\npkgpythondir = @pkgpythondir@\nprefix = @prefix@\nprogram_transform_name = @program_transform_name@\npsdir = @psdir@\npyexecdir = @pyexecdir@\npythondir = @pythondir@\nsbindir = @sbindir@\nsharedstatedir = @sharedstatedir@\nsrcdir = @srcdir@\nsysconfdir = @sysconfdir@\ntarget_alias = @target_alias@\ntop_build_prefix = @top_build_prefix@\ntop_builddir = @top_builddir@\ntop_srcdir = @top_srcdir@\nAM_CPPFLAGS = -I$(srcdir)/../include $(ICU_CPPFLAGS)\nLDADD = ../lib/libfst.la -lm $(DL_LIBS)\nfst_test_SOURCES = fst_test.cc fst_test.h\nweight_test_SOURCES = weight_test.cc weight-tester.h\nalgo_test_SOURCES = algo_test.cc algo_test.h rand-fst.h\nalgo_test_log_SOURCES = $(algo_test_SOURCES)\nalgo_test_log_CPPFLAGS = -DTEST_LOG $(AM_CPPFLAGS)\nalgo_test_tropical_SOURCES = $(algo_test_SOURCES)\nalgo_test_tropical_CPPFLAGS = -DTEST_TROPICAL $(AM_CPPFLAGS)\nalgo_test_minmax_SOURCES = $(algo_test_SOURCES)\nalgo_test_minmax_CPPFLAGS = -DTEST_MINMAX $(AM_CPPFLAGS)\nalgo_test_lexicographic_SOURCES = $(algo_test_SOURCES)\nalgo_test_lexicographic_CPPFLAGS = -DTEST_LEXICOGRAPHIC $(AM_CPPFLAGS)\nalgo_test_power_SOURCES = $(algo_test_SOURCES)\nalgo_test_power_CPPFLAGS = -DTEST_POWER $(AM_CPPFLAGS)\nTESTS = $(check_PROGRAMS)\nall: all-am\n\n.SUFFIXES:\n.SUFFIXES: .cc .lo .log .o .obj .test .test$(EXEEXT) .trs\n$(srcdir)/Makefile.in:  $(srcdir)/Makefile.am  $(am__configure_deps)\n\t@for dep in $?; do \\\n\t  case '$(am__configure_deps)' in \\\n\t    *$$dep*) \\\n\t      ( cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh ) \\\n\t        && { if test -f $@; then exit 0; else break; fi; }; \\\n\t      exit 1;; \\\n\t  esac; \\\n\tdone; \\\n\techo ' cd $(top_srcdir) && $(AUTOMAKE) --foreign src/test/Makefile'; \\\n\t$(am__cd) $(top_srcdir) && \\\n\t  $(AUTOMAKE) --foreign src/test/Makefile\n.PRECIOUS: Makefile\nMakefile: $(srcdir)/Makefile.in $(top_builddir)/config.status\n\t@case '$?' in \\\n\t  *config.status*) \\\n\t    cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh;; \\\n\t  *) \\\n\t    echo ' cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe)'; \\\n\t    cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe);; \\\n\tesac;\n\n$(top_builddir)/config.status: $(top_srcdir)/configure $(CONFIG_STATUS_DEPENDENCIES)\n\tcd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh\n\n$(top_srcdir)/configure:  $(am__configure_deps)\n\tcd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh\n$(ACLOCAL_M4):  $(am__aclocal_m4_deps)\n\tcd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh\n$(am__aclocal_m4_deps):\n\nclean-checkPROGRAMS:\n\t@list='$(check_PROGRAMS)'; test -n \"$$list\" || exit 0; \\\n\techo \" rm -f\" $$list; \\\n\trm -f $$list || exit $$?; \\\n\ttest -n \"$(EXEEXT)\" || exit 0; \\\n\tlist=`for p in $$list; do echo \"$$p\"; done | sed 's/$(EXEEXT)$$//'`; \\\n\techo \" rm -f\" $$list; \\\n\trm -f $$list\n\nalgo_test_lexicographic$(EXEEXT): $(algo_test_lexicographic_OBJECTS) $(algo_test_lexicographic_DEPENDENCIES) $(EXTRA_algo_test_lexicographic_DEPENDENCIES) \n\t@rm -f algo_test_lexicographic$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(algo_test_lexicographic_OBJECTS) $(algo_test_lexicographic_LDADD) $(LIBS)\n\nalgo_test_log$(EXEEXT): $(algo_test_log_OBJECTS) $(algo_test_log_DEPENDENCIES) $(EXTRA_algo_test_log_DEPENDENCIES) \n\t@rm -f algo_test_log$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(algo_test_log_OBJECTS) $(algo_test_log_LDADD) $(LIBS)\n\nalgo_test_minmax$(EXEEXT): $(algo_test_minmax_OBJECTS) $(algo_test_minmax_DEPENDENCIES) $(EXTRA_algo_test_minmax_DEPENDENCIES) \n\t@rm -f algo_test_minmax$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(algo_test_minmax_OBJECTS) $(algo_test_minmax_LDADD) $(LIBS)\n\nalgo_test_power$(EXEEXT): $(algo_test_power_OBJECTS) $(algo_test_power_DEPENDENCIES) $(EXTRA_algo_test_power_DEPENDENCIES) \n\t@rm -f algo_test_power$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(algo_test_power_OBJECTS) $(algo_test_power_LDADD) $(LIBS)\n\nalgo_test_tropical$(EXEEXT): $(algo_test_tropical_OBJECTS) $(algo_test_tropical_DEPENDENCIES) $(EXTRA_algo_test_tropical_DEPENDENCIES) \n\t@rm -f algo_test_tropical$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(algo_test_tropical_OBJECTS) $(algo_test_tropical_LDADD) $(LIBS)\n\nfst_test$(EXEEXT): $(fst_test_OBJECTS) $(fst_test_DEPENDENCIES) $(EXTRA_fst_test_DEPENDENCIES) \n\t@rm -f fst_test$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(fst_test_OBJECTS) $(fst_test_LDADD) $(LIBS)\n\nweight_test$(EXEEXT): $(weight_test_OBJECTS) $(weight_test_DEPENDENCIES) $(EXTRA_weight_test_DEPENDENCIES) \n\t@rm -f weight_test$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(weight_test_OBJECTS) $(weight_test_LDADD) $(LIBS)\n\nmostlyclean-compile:\n\t-rm -f *.$(OBJEXT)\n\ndistclean-compile:\n\t-rm -f *.tab.c\n\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/algo_test_lexicographic-algo_test.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/algo_test_log-algo_test.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/algo_test_minmax-algo_test.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/algo_test_power-algo_test.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/algo_test_tropical-algo_test.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fst_test.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/weight_test.Po@am__quote@\n\n.cc.o:\n@am__fastdepCXX_TRUE@\t$(AM_V_CXX)depbase=`echo $@ | sed 's|[^/]*$$|$(DEPDIR)/&|;s|\\.o$$||'`;\\\n@am__fastdepCXX_TRUE@\t$(CXXCOMPILE) -MT $@ -MD -MP -MF $$depbase.Tpo -c -o $@ $< &&\\\n@am__fastdepCXX_TRUE@\t$(am__mv) $$depbase.Tpo $$depbase.Po\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\t$(AM_V_CXX)source='$<' object='$@' libtool=no @AMDEPBACKSLASH@\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\tDEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@\n@am__fastdepCXX_FALSE@\t$(AM_V_CXX@am__nodep@)$(CXXCOMPILE) -c -o $@ $<\n\n.cc.obj:\n@am__fastdepCXX_TRUE@\t$(AM_V_CXX)depbase=`echo $@ | sed 's|[^/]*$$|$(DEPDIR)/&|;s|\\.obj$$||'`;\\\n@am__fastdepCXX_TRUE@\t$(CXXCOMPILE) -MT $@ -MD -MP -MF $$depbase.Tpo -c -o $@ `$(CYGPATH_W) '$<'` &&\\\n@am__fastdepCXX_TRUE@\t$(am__mv) $$depbase.Tpo $$depbase.Po\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\t$(AM_V_CXX)source='$<' object='$@' libtool=no @AMDEPBACKSLASH@\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\tDEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@\n@am__fastdepCXX_FALSE@\t$(AM_V_CXX@am__nodep@)$(CXXCOMPILE) -c -o $@ `$(CYGPATH_W) '$<'`\n\n.cc.lo:\n@am__fastdepCXX_TRUE@\t$(AM_V_CXX)depbase=`echo $@ | sed 's|[^/]*$$|$(DEPDIR)/&|;s|\\.lo$$||'`;\\\n@am__fastdepCXX_TRUE@\t$(LTCXXCOMPILE) -MT $@ -MD -MP -MF $$depbase.Tpo -c -o $@ $< &&\\\n@am__fastdepCXX_TRUE@\t$(am__mv) $$depbase.Tpo $$depbase.Plo\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\t$(AM_V_CXX)source='$<' object='$@' libtool=yes @AMDEPBACKSLASH@\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\tDEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@\n@am__fastdepCXX_FALSE@\t$(AM_V_CXX@am__nodep@)$(LTCXXCOMPILE) -c -o $@ $<\n\nalgo_test_lexicographic-algo_test.o: algo_test.cc\n@am__fastdepCXX_TRUE@\t$(AM_V_CXX)$(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(algo_test_lexicographic_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -MT algo_test_lexicographic-algo_test.o -MD -MP -MF $(DEPDIR)/algo_test_lexicographic-algo_test.Tpo -c -o algo_test_lexicographic-algo_test.o `test -f 'algo_test.cc' || echo '$(srcdir)/'`algo_test.cc\n@am__fastdepCXX_TRUE@\t$(AM_V_at)$(am__mv) $(DEPDIR)/algo_test_lexicographic-algo_test.Tpo $(DEPDIR)/algo_test_lexicographic-algo_test.Po\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\t$(AM_V_CXX)source='algo_test.cc' object='algo_test_lexicographic-algo_test.o' libtool=no @AMDEPBACKSLASH@\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\tDEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@\n@am__fastdepCXX_FALSE@\t$(AM_V_CXX@am__nodep@)$(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(algo_test_lexicographic_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -c -o algo_test_lexicographic-algo_test.o `test -f 'algo_test.cc' || echo '$(srcdir)/'`algo_test.cc\n\nalgo_test_lexicographic-algo_test.obj: algo_test.cc\n@am__fastdepCXX_TRUE@\t$(AM_V_CXX)$(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(algo_test_lexicographic_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -MT algo_test_lexicographic-algo_test.obj -MD -MP -MF $(DEPDIR)/algo_test_lexicographic-algo_test.Tpo -c -o algo_test_lexicographic-algo_test.obj `if test -f 'algo_test.cc'; then $(CYGPATH_W) 'algo_test.cc'; else $(CYGPATH_W) '$(srcdir)/algo_test.cc'; fi`\n@am__fastdepCXX_TRUE@\t$(AM_V_at)$(am__mv) $(DEPDIR)/algo_test_lexicographic-algo_test.Tpo $(DEPDIR)/algo_test_lexicographic-algo_test.Po\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\t$(AM_V_CXX)source='algo_test.cc' object='algo_test_lexicographic-algo_test.obj' libtool=no @AMDEPBACKSLASH@\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\tDEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@\n@am__fastdepCXX_FALSE@\t$(AM_V_CXX@am__nodep@)$(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(algo_test_lexicographic_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -c -o algo_test_lexicographic-algo_test.obj `if test -f 'algo_test.cc'; then $(CYGPATH_W) 'algo_test.cc'; else $(CYGPATH_W) '$(srcdir)/algo_test.cc'; fi`\n\nalgo_test_log-algo_test.o: algo_test.cc\n@am__fastdepCXX_TRUE@\t$(AM_V_CXX)$(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(algo_test_log_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -MT algo_test_log-algo_test.o -MD -MP -MF $(DEPDIR)/algo_test_log-algo_test.Tpo -c -o algo_test_log-algo_test.o `test -f 'algo_test.cc' || echo '$(srcdir)/'`algo_test.cc\n@am__fastdepCXX_TRUE@\t$(AM_V_at)$(am__mv) $(DEPDIR)/algo_test_log-algo_test.Tpo $(DEPDIR)/algo_test_log-algo_test.Po\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\t$(AM_V_CXX)source='algo_test.cc' object='algo_test_log-algo_test.o' libtool=no @AMDEPBACKSLASH@\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\tDEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@\n@am__fastdepCXX_FALSE@\t$(AM_V_CXX@am__nodep@)$(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(algo_test_log_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -c -o algo_test_log-algo_test.o `test -f 'algo_test.cc' || echo '$(srcdir)/'`algo_test.cc\n\nalgo_test_log-algo_test.obj: algo_test.cc\n@am__fastdepCXX_TRUE@\t$(AM_V_CXX)$(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(algo_test_log_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -MT algo_test_log-algo_test.obj -MD -MP -MF $(DEPDIR)/algo_test_log-algo_test.Tpo -c -o algo_test_log-algo_test.obj `if test -f 'algo_test.cc'; then $(CYGPATH_W) 'algo_test.cc'; else $(CYGPATH_W) '$(srcdir)/algo_test.cc'; fi`\n@am__fastdepCXX_TRUE@\t$(AM_V_at)$(am__mv) $(DEPDIR)/algo_test_log-algo_test.Tpo $(DEPDIR)/algo_test_log-algo_test.Po\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\t$(AM_V_CXX)source='algo_test.cc' object='algo_test_log-algo_test.obj' libtool=no @AMDEPBACKSLASH@\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\tDEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@\n@am__fastdepCXX_FALSE@\t$(AM_V_CXX@am__nodep@)$(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(algo_test_log_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -c -o algo_test_log-algo_test.obj `if test -f 'algo_test.cc'; then $(CYGPATH_W) 'algo_test.cc'; else $(CYGPATH_W) '$(srcdir)/algo_test.cc'; fi`\n\nalgo_test_minmax-algo_test.o: algo_test.cc\n@am__fastdepCXX_TRUE@\t$(AM_V_CXX)$(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(algo_test_minmax_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -MT algo_test_minmax-algo_test.o -MD -MP -MF $(DEPDIR)/algo_test_minmax-algo_test.Tpo -c -o algo_test_minmax-algo_test.o `test -f 'algo_test.cc' || echo '$(srcdir)/'`algo_test.cc\n@am__fastdepCXX_TRUE@\t$(AM_V_at)$(am__mv) $(DEPDIR)/algo_test_minmax-algo_test.Tpo $(DEPDIR)/algo_test_minmax-algo_test.Po\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\t$(AM_V_CXX)source='algo_test.cc' object='algo_test_minmax-algo_test.o' libtool=no @AMDEPBACKSLASH@\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\tDEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@\n@am__fastdepCXX_FALSE@\t$(AM_V_CXX@am__nodep@)$(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(algo_test_minmax_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -c -o algo_test_minmax-algo_test.o `test -f 'algo_test.cc' || echo '$(srcdir)/'`algo_test.cc\n\nalgo_test_minmax-algo_test.obj: algo_test.cc\n@am__fastdepCXX_TRUE@\t$(AM_V_CXX)$(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(algo_test_minmax_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -MT algo_test_minmax-algo_test.obj -MD -MP -MF $(DEPDIR)/algo_test_minmax-algo_test.Tpo -c -o algo_test_minmax-algo_test.obj `if test -f 'algo_test.cc'; then $(CYGPATH_W) 'algo_test.cc'; else $(CYGPATH_W) '$(srcdir)/algo_test.cc'; fi`\n@am__fastdepCXX_TRUE@\t$(AM_V_at)$(am__mv) $(DEPDIR)/algo_test_minmax-algo_test.Tpo $(DEPDIR)/algo_test_minmax-algo_test.Po\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\t$(AM_V_CXX)source='algo_test.cc' object='algo_test_minmax-algo_test.obj' libtool=no @AMDEPBACKSLASH@\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\tDEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@\n@am__fastdepCXX_FALSE@\t$(AM_V_CXX@am__nodep@)$(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(algo_test_minmax_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -c -o algo_test_minmax-algo_test.obj `if test -f 'algo_test.cc'; then $(CYGPATH_W) 'algo_test.cc'; else $(CYGPATH_W) '$(srcdir)/algo_test.cc'; fi`\n\nalgo_test_power-algo_test.o: algo_test.cc\n@am__fastdepCXX_TRUE@\t$(AM_V_CXX)$(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(algo_test_power_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -MT algo_test_power-algo_test.o -MD -MP -MF $(DEPDIR)/algo_test_power-algo_test.Tpo -c -o algo_test_power-algo_test.o `test -f 'algo_test.cc' || echo '$(srcdir)/'`algo_test.cc\n@am__fastdepCXX_TRUE@\t$(AM_V_at)$(am__mv) $(DEPDIR)/algo_test_power-algo_test.Tpo $(DEPDIR)/algo_test_power-algo_test.Po\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\t$(AM_V_CXX)source='algo_test.cc' object='algo_test_power-algo_test.o' libtool=no @AMDEPBACKSLASH@\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\tDEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@\n@am__fastdepCXX_FALSE@\t$(AM_V_CXX@am__nodep@)$(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(algo_test_power_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -c -o algo_test_power-algo_test.o `test -f 'algo_test.cc' || echo '$(srcdir)/'`algo_test.cc\n\nalgo_test_power-algo_test.obj: algo_test.cc\n@am__fastdepCXX_TRUE@\t$(AM_V_CXX)$(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(algo_test_power_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -MT algo_test_power-algo_test.obj -MD -MP -MF $(DEPDIR)/algo_test_power-algo_test.Tpo -c -o algo_test_power-algo_test.obj `if test -f 'algo_test.cc'; then $(CYGPATH_W) 'algo_test.cc'; else $(CYGPATH_W) '$(srcdir)/algo_test.cc'; fi`\n@am__fastdepCXX_TRUE@\t$(AM_V_at)$(am__mv) $(DEPDIR)/algo_test_power-algo_test.Tpo $(DEPDIR)/algo_test_power-algo_test.Po\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\t$(AM_V_CXX)source='algo_test.cc' object='algo_test_power-algo_test.obj' libtool=no @AMDEPBACKSLASH@\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\tDEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@\n@am__fastdepCXX_FALSE@\t$(AM_V_CXX@am__nodep@)$(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(algo_test_power_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -c -o algo_test_power-algo_test.obj `if test -f 'algo_test.cc'; then $(CYGPATH_W) 'algo_test.cc'; else $(CYGPATH_W) '$(srcdir)/algo_test.cc'; fi`\n\nalgo_test_tropical-algo_test.o: algo_test.cc\n@am__fastdepCXX_TRUE@\t$(AM_V_CXX)$(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(algo_test_tropical_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -MT algo_test_tropical-algo_test.o -MD -MP -MF $(DEPDIR)/algo_test_tropical-algo_test.Tpo -c -o algo_test_tropical-algo_test.o `test -f 'algo_test.cc' || echo '$(srcdir)/'`algo_test.cc\n@am__fastdepCXX_TRUE@\t$(AM_V_at)$(am__mv) $(DEPDIR)/algo_test_tropical-algo_test.Tpo $(DEPDIR)/algo_test_tropical-algo_test.Po\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\t$(AM_V_CXX)source='algo_test.cc' object='algo_test_tropical-algo_test.o' libtool=no @AMDEPBACKSLASH@\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\tDEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@\n@am__fastdepCXX_FALSE@\t$(AM_V_CXX@am__nodep@)$(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(algo_test_tropical_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -c -o algo_test_tropical-algo_test.o `test -f 'algo_test.cc' || echo '$(srcdir)/'`algo_test.cc\n\nalgo_test_tropical-algo_test.obj: algo_test.cc\n@am__fastdepCXX_TRUE@\t$(AM_V_CXX)$(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(algo_test_tropical_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -MT algo_test_tropical-algo_test.obj -MD -MP -MF $(DEPDIR)/algo_test_tropical-algo_test.Tpo -c -o algo_test_tropical-algo_test.obj `if test -f 'algo_test.cc'; then $(CYGPATH_W) 'algo_test.cc'; else $(CYGPATH_W) '$(srcdir)/algo_test.cc'; fi`\n@am__fastdepCXX_TRUE@\t$(AM_V_at)$(am__mv) $(DEPDIR)/algo_test_tropical-algo_test.Tpo $(DEPDIR)/algo_test_tropical-algo_test.Po\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\t$(AM_V_CXX)source='algo_test.cc' object='algo_test_tropical-algo_test.obj' libtool=no @AMDEPBACKSLASH@\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\tDEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@\n@am__fastdepCXX_FALSE@\t$(AM_V_CXX@am__nodep@)$(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(algo_test_tropical_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -c -o algo_test_tropical-algo_test.obj `if test -f 'algo_test.cc'; then $(CYGPATH_W) 'algo_test.cc'; else $(CYGPATH_W) '$(srcdir)/algo_test.cc'; fi`\n\nmostlyclean-libtool:\n\t-rm -f *.lo\n\nclean-libtool:\n\t-rm -rf .libs _libs\n\nID: $(am__tagged_files)\n\t$(am__define_uniq_tagged_files); mkid -fID $$unique\ntags: tags-am\nTAGS: tags\n\ntags-am: $(TAGS_DEPENDENCIES) $(am__tagged_files)\n\tset x; \\\n\there=`pwd`; \\\n\t$(am__define_uniq_tagged_files); \\\n\tshift; \\\n\tif test -z \"$(ETAGS_ARGS)$$*$$unique\"; then :; else \\\n\t  test -n \"$$unique\" || unique=$$empty_fix; \\\n\t  if test $$# -gt 0; then \\\n\t    $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \\\n\t      \"$$@\" $$unique; \\\n\t  else \\\n\t    $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \\\n\t      $$unique; \\\n\t  fi; \\\n\tfi\nctags: ctags-am\n\nCTAGS: ctags\nctags-am: $(TAGS_DEPENDENCIES) $(am__tagged_files)\n\t$(am__define_uniq_tagged_files); \\\n\ttest -z \"$(CTAGS_ARGS)$$unique\" \\\n\t  || $(CTAGS) $(CTAGSFLAGS) $(AM_CTAGSFLAGS) $(CTAGS_ARGS) \\\n\t     $$unique\n\nGTAGS:\n\there=`$(am__cd) $(top_builddir) && pwd` \\\n\t  && $(am__cd) $(top_srcdir) \\\n\t  && gtags -i $(GTAGS_ARGS) \"$$here\"\ncscopelist: cscopelist-am\n\ncscopelist-am: $(am__tagged_files)\n\tlist='$(am__tagged_files)'; \\\n\tcase \"$(srcdir)\" in \\\n\t  [\\\\/]* | ?:[\\\\/]*) sdir=\"$(srcdir)\" ;; \\\n\t  *) sdir=$(subdir)/$(srcdir) ;; \\\n\tesac; \\\n\tfor i in $$list; do \\\n\t  if test -f \"$$i\"; then \\\n\t    echo \"$(subdir)/$$i\"; \\\n\t  else \\\n\t    echo \"$$sdir/$$i\"; \\\n\t  fi; \\\n\tdone >> $(top_builddir)/cscope.files\n\ndistclean-tags:\n\t-rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags\n\n# Recover from deleted '.trs' file; this should ensure that\n# \"rm -f foo.log; make foo.trs\" re-run 'foo.test', and re-create\n# both 'foo.log' and 'foo.trs'.  Break the recipe in two subshells\n# to avoid problems with \"make -n\".\n.log.trs:\n\trm -f $< $@\n\t$(MAKE) $(AM_MAKEFLAGS) $<\n\n# Leading 'am--fnord' is there to ensure the list of targets does not\n# expand to empty, as could happen e.g. with make check TESTS=''.\nam--fnord $(TEST_LOGS) $(TEST_LOGS:.log=.trs): $(am__force_recheck)\nam--force-recheck:\n\t@:\n\n$(TEST_SUITE_LOG): $(TEST_LOGS)\n\t@$(am__set_TESTS_bases); \\\n\tam__f_ok () { test -f \"$$1\" && test -r \"$$1\"; }; \\\n\tredo_bases=`for i in $$bases; do \\\n\t              am__f_ok $$i.trs && am__f_ok $$i.log || echo $$i; \\\n\t            done`; \\\n\tif test -n \"$$redo_bases\"; then \\\n\t  redo_logs=`for i in $$redo_bases; do echo $$i.log; done`; \\\n\t  redo_results=`for i in $$redo_bases; do echo $$i.trs; done`; \\\n\t  if $(am__make_dryrun); then :; else \\\n\t    rm -f $$redo_logs && rm -f $$redo_results || exit 1; \\\n\t  fi; \\\n\tfi; \\\n\tif test -n \"$$am__remaking_logs\"; then \\\n\t  echo \"fatal: making $(TEST_SUITE_LOG): possible infinite\" \\\n\t       \"recursion detected\" >&2; \\\n\telse \\\n\t  am__remaking_logs=yes $(MAKE) $(AM_MAKEFLAGS) $$redo_logs; \\\n\tfi; \\\n\tif $(am__make_dryrun); then :; else \\\n\t  st=0;  \\\n\t  errmsg=\"fatal: making $(TEST_SUITE_LOG): failed to create\"; \\\n\t  for i in $$redo_bases; do \\\n\t    test -f $$i.trs && test -r $$i.trs \\\n\t      || { echo \"$$errmsg $$i.trs\" >&2; st=1; }; \\\n\t    test -f $$i.log && test -r $$i.log \\\n\t      || { echo \"$$errmsg $$i.log\" >&2; st=1; }; \\\n\t  done; \\\n\t  test $$st -eq 0 || exit 1; \\\n\tfi\n\t@$(am__sh_e_setup); $(am__tty_colors); $(am__set_TESTS_bases); \\\n\tws='[ \t]'; \\\n\tresults=`for b in $$bases; do echo $$b.trs; done`; \\\n\ttest -n \"$$results\" || results=/dev/null; \\\n\tall=`  grep \"^$$ws*:test-result:\"           $$results | wc -l`; \\\n\tpass=` grep \"^$$ws*:test-result:$$ws*PASS\"  $$results | wc -l`; \\\n\tfail=` grep \"^$$ws*:test-result:$$ws*FAIL\"  $$results | wc -l`; \\\n\tskip=` grep \"^$$ws*:test-result:$$ws*SKIP\"  $$results | wc -l`; \\\n\txfail=`grep \"^$$ws*:test-result:$$ws*XFAIL\" $$results | wc -l`; \\\n\txpass=`grep \"^$$ws*:test-result:$$ws*XPASS\" $$results | wc -l`; \\\n\terror=`grep \"^$$ws*:test-result:$$ws*ERROR\" $$results | wc -l`; \\\n\tif test `expr $$fail + $$xpass + $$error` -eq 0; then \\\n\t  success=true; \\\n\telse \\\n\t  success=false; \\\n\tfi; \\\n\tbr='==================='; br=$$br$$br$$br$$br; \\\n\tresult_count () \\\n\t{ \\\n\t    if test x\"$$1\" = x\"--maybe-color\"; then \\\n\t      maybe_colorize=yes; \\\n\t    elif test x\"$$1\" = x\"--no-color\"; then \\\n\t      maybe_colorize=no; \\\n\t    else \\\n\t      echo \"$@: invalid 'result_count' usage\" >&2; exit 4; \\\n\t    fi; \\\n\t    shift; \\\n\t    desc=$$1 count=$$2; \\\n\t    if test $$maybe_colorize = yes && test $$count -gt 0; then \\\n\t      color_start=$$3 color_end=$$std; \\\n\t    else \\\n\t      color_start= color_end=; \\\n\t    fi; \\\n\t    echo \"$${color_start}# $$desc $$count$${color_end}\"; \\\n\t}; \\\n\tcreate_testsuite_report () \\\n\t{ \\\n\t  result_count $$1 \"TOTAL:\" $$all   \"$$brg\"; \\\n\t  result_count $$1 \"PASS: \" $$pass  \"$$grn\"; \\\n\t  result_count $$1 \"SKIP: \" $$skip  \"$$blu\"; \\\n\t  result_count $$1 \"XFAIL:\" $$xfail \"$$lgn\"; \\\n\t  result_count $$1 \"FAIL: \" $$fail  \"$$red\"; \\\n\t  result_count $$1 \"XPASS:\" $$xpass \"$$red\"; \\\n\t  result_count $$1 \"ERROR:\" $$error \"$$mgn\"; \\\n\t}; \\\n\t{\t\t\t\t\t\t\t\t\\\n\t  echo \"$(PACKAGE_STRING): $(subdir)/$(TEST_SUITE_LOG)\" |\t\\\n\t    $(am__rst_title);\t\t\t\t\t\t\\\n\t  create_testsuite_report --no-color;\t\t\t\t\\\n\t  echo;\t\t\t\t\t\t\t\t\\\n\t  echo \".. contents:: :depth: 2\";\t\t\t\t\\\n\t  echo;\t\t\t\t\t\t\t\t\\\n\t  for b in $$bases; do echo $$b; done\t\t\t\t\\\n\t    | $(am__create_global_log);\t\t\t\t\t\\\n\t} >$(TEST_SUITE_LOG).tmp || exit 1;\t\t\t\t\\\n\tmv $(TEST_SUITE_LOG).tmp $(TEST_SUITE_LOG);\t\t\t\\\n\tif $$success; then\t\t\t\t\t\t\\\n\t  col=\"$$grn\";\t\t\t\t\t\t\t\\\n\t else\t\t\t\t\t\t\t\t\\\n\t  col=\"$$red\";\t\t\t\t\t\t\t\\\n\t  test x\"$$VERBOSE\" = x || cat $(TEST_SUITE_LOG);\t\t\\\n\tfi;\t\t\t\t\t\t\t\t\\\n\techo \"$${col}$$br$${std}\"; \t\t\t\t\t\\\n\techo \"$${col}Testsuite summary for $(PACKAGE_STRING)$${std}\";\t\\\n\techo \"$${col}$$br$${std}\"; \t\t\t\t\t\\\n\tcreate_testsuite_report --maybe-color;\t\t\t\t\\\n\techo \"$$col$$br$$std\";\t\t\t\t\t\t\\\n\tif $$success; then :; else\t\t\t\t\t\\\n\t  echo \"$${col}See $(subdir)/$(TEST_SUITE_LOG)$${std}\";\t\t\\\n\t  if test -n \"$(PACKAGE_BUGREPORT)\"; then\t\t\t\\\n\t    echo \"$${col}Please report to $(PACKAGE_BUGREPORT)$${std}\";\t\\\n\t  fi;\t\t\t\t\t\t\t\t\\\n\t  echo \"$$col$$br$$std\";\t\t\t\t\t\\\n\tfi;\t\t\t\t\t\t\t\t\\\n\t$$success || exit 1\n\ncheck-TESTS:\n\t@list='$(RECHECK_LOGS)';           test -z \"$$list\" || rm -f $$list\n\t@list='$(RECHECK_LOGS:.log=.trs)'; test -z \"$$list\" || rm -f $$list\n\t@test -z \"$(TEST_SUITE_LOG)\" || rm -f $(TEST_SUITE_LOG)\n\t@set +e; $(am__set_TESTS_bases); \\\n\tlog_list=`for i in $$bases; do echo $$i.log; done`; \\\n\ttrs_list=`for i in $$bases; do echo $$i.trs; done`; \\\n\tlog_list=`echo $$log_list`; trs_list=`echo $$trs_list`; \\\n\t$(MAKE) $(AM_MAKEFLAGS) $(TEST_SUITE_LOG) TEST_LOGS=\"$$log_list\"; \\\n\texit $$?;\nrecheck: all $(check_PROGRAMS)\n\t@test -z \"$(TEST_SUITE_LOG)\" || rm -f $(TEST_SUITE_LOG)\n\t@set +e; $(am__set_TESTS_bases); \\\n\tbases=`for i in $$bases; do echo $$i; done \\\n\t         | $(am__list_recheck_tests)` || exit 1; \\\n\tlog_list=`for i in $$bases; do echo $$i.log; done`; \\\n\tlog_list=`echo $$log_list`; \\\n\t$(MAKE) $(AM_MAKEFLAGS) $(TEST_SUITE_LOG) \\\n\t        am__force_recheck=am--force-recheck \\\n\t        TEST_LOGS=\"$$log_list\"; \\\n\texit $$?\nfst_test.log: fst_test$(EXEEXT)\n\t@p='fst_test$(EXEEXT)'; \\\n\tb='fst_test'; \\\n\t$(am__check_pre) $(LOG_DRIVER) --test-name \"$$f\" \\\n\t--log-file $$b.log --trs-file $$b.trs \\\n\t$(am__common_driver_flags) $(AM_LOG_DRIVER_FLAGS) $(LOG_DRIVER_FLAGS) -- $(LOG_COMPILE) \\\n\t\"$$tst\" $(AM_TESTS_FD_REDIRECT)\nweight_test.log: weight_test$(EXEEXT)\n\t@p='weight_test$(EXEEXT)'; \\\n\tb='weight_test'; \\\n\t$(am__check_pre) $(LOG_DRIVER) --test-name \"$$f\" \\\n\t--log-file $$b.log --trs-file $$b.trs \\\n\t$(am__common_driver_flags) $(AM_LOG_DRIVER_FLAGS) $(LOG_DRIVER_FLAGS) -- $(LOG_COMPILE) \\\n\t\"$$tst\" $(AM_TESTS_FD_REDIRECT)\nalgo_test_log.log: algo_test_log$(EXEEXT)\n\t@p='algo_test_log$(EXEEXT)'; \\\n\tb='algo_test_log'; \\\n\t$(am__check_pre) $(LOG_DRIVER) --test-name \"$$f\" \\\n\t--log-file $$b.log --trs-file $$b.trs \\\n\t$(am__common_driver_flags) $(AM_LOG_DRIVER_FLAGS) $(LOG_DRIVER_FLAGS) -- $(LOG_COMPILE) \\\n\t\"$$tst\" $(AM_TESTS_FD_REDIRECT)\nalgo_test_tropical.log: algo_test_tropical$(EXEEXT)\n\t@p='algo_test_tropical$(EXEEXT)'; \\\n\tb='algo_test_tropical'; \\\n\t$(am__check_pre) $(LOG_DRIVER) --test-name \"$$f\" \\\n\t--log-file $$b.log --trs-file $$b.trs \\\n\t$(am__common_driver_flags) $(AM_LOG_DRIVER_FLAGS) $(LOG_DRIVER_FLAGS) -- $(LOG_COMPILE) \\\n\t\"$$tst\" $(AM_TESTS_FD_REDIRECT)\nalgo_test_minmax.log: algo_test_minmax$(EXEEXT)\n\t@p='algo_test_minmax$(EXEEXT)'; \\\n\tb='algo_test_minmax'; \\\n\t$(am__check_pre) $(LOG_DRIVER) --test-name \"$$f\" \\\n\t--log-file $$b.log --trs-file $$b.trs \\\n\t$(am__common_driver_flags) $(AM_LOG_DRIVER_FLAGS) $(LOG_DRIVER_FLAGS) -- $(LOG_COMPILE) \\\n\t\"$$tst\" $(AM_TESTS_FD_REDIRECT)\nalgo_test_lexicographic.log: algo_test_lexicographic$(EXEEXT)\n\t@p='algo_test_lexicographic$(EXEEXT)'; \\\n\tb='algo_test_lexicographic'; \\\n\t$(am__check_pre) $(LOG_DRIVER) --test-name \"$$f\" \\\n\t--log-file $$b.log --trs-file $$b.trs \\\n\t$(am__common_driver_flags) $(AM_LOG_DRIVER_FLAGS) $(LOG_DRIVER_FLAGS) -- $(LOG_COMPILE) \\\n\t\"$$tst\" $(AM_TESTS_FD_REDIRECT)\nalgo_test_power.log: algo_test_power$(EXEEXT)\n\t@p='algo_test_power$(EXEEXT)'; \\\n\tb='algo_test_power'; \\\n\t$(am__check_pre) $(LOG_DRIVER) --test-name \"$$f\" \\\n\t--log-file $$b.log --trs-file $$b.trs \\\n\t$(am__common_driver_flags) $(AM_LOG_DRIVER_FLAGS) $(LOG_DRIVER_FLAGS) -- $(LOG_COMPILE) \\\n\t\"$$tst\" $(AM_TESTS_FD_REDIRECT)\n.test.log:\n\t@p='$<'; \\\n\t$(am__set_b); \\\n\t$(am__check_pre) $(TEST_LOG_DRIVER) --test-name \"$$f\" \\\n\t--log-file $$b.log --trs-file $$b.trs \\\n\t$(am__common_driver_flags) $(AM_TEST_LOG_DRIVER_FLAGS) $(TEST_LOG_DRIVER_FLAGS) -- $(TEST_LOG_COMPILE) \\\n\t\"$$tst\" $(AM_TESTS_FD_REDIRECT)\n@am__EXEEXT_TRUE@.test$(EXEEXT).log:\n@am__EXEEXT_TRUE@\t@p='$<'; \\\n@am__EXEEXT_TRUE@\t$(am__set_b); \\\n@am__EXEEXT_TRUE@\t$(am__check_pre) $(TEST_LOG_DRIVER) --test-name \"$$f\" \\\n@am__EXEEXT_TRUE@\t--log-file $$b.log --trs-file $$b.trs \\\n@am__EXEEXT_TRUE@\t$(am__common_driver_flags) $(AM_TEST_LOG_DRIVER_FLAGS) $(TEST_LOG_DRIVER_FLAGS) -- $(TEST_LOG_COMPILE) \\\n@am__EXEEXT_TRUE@\t\"$$tst\" $(AM_TESTS_FD_REDIRECT)\n\ndistdir: $(DISTFILES)\n\t@srcdirstrip=`echo \"$(srcdir)\" | sed 's/[].[^$$\\\\*]/\\\\\\\\&/g'`; \\\n\ttopsrcdirstrip=`echo \"$(top_srcdir)\" | sed 's/[].[^$$\\\\*]/\\\\\\\\&/g'`; \\\n\tlist='$(DISTFILES)'; \\\n\t  dist_files=`for file in $$list; do echo $$file; done | \\\n\t  sed -e \"s|^$$srcdirstrip/||;t\" \\\n\t      -e \"s|^$$topsrcdirstrip/|$(top_builddir)/|;t\"`; \\\n\tcase $$dist_files in \\\n\t  */*) $(MKDIR_P) `echo \"$$dist_files\" | \\\n\t\t\t   sed '/\\//!d;s|^|$(distdir)/|;s,/[^/]*$$,,' | \\\n\t\t\t   sort -u` ;; \\\n\tesac; \\\n\tfor file in $$dist_files; do \\\n\t  if test -f $$file || test -d $$file; then d=.; else d=$(srcdir); fi; \\\n\t  if test -d $$d/$$file; then \\\n\t    dir=`echo \"/$$file\" | sed -e 's,/[^/]*$$,,'`; \\\n\t    if test -d \"$(distdir)/$$file\"; then \\\n\t      find \"$(distdir)/$$file\" -type d ! -perm -700 -exec chmod u+rwx {} \\;; \\\n\t    fi; \\\n\t    if test -d $(srcdir)/$$file && test $$d != $(srcdir); then \\\n\t      cp -fpR $(srcdir)/$$file \"$(distdir)$$dir\" || exit 1; \\\n\t      find \"$(distdir)/$$file\" -type d ! -perm -700 -exec chmod u+rwx {} \\;; \\\n\t    fi; \\\n\t    cp -fpR $$d/$$file \"$(distdir)$$dir\" || exit 1; \\\n\t  else \\\n\t    test -f \"$(distdir)/$$file\" \\\n\t    || cp -p $$d/$$file \"$(distdir)/$$file\" \\\n\t    || exit 1; \\\n\t  fi; \\\n\tdone\ncheck-am: all-am\n\t$(MAKE) $(AM_MAKEFLAGS) $(check_PROGRAMS)\n\t$(MAKE) $(AM_MAKEFLAGS) check-TESTS\ncheck: check-am\nall-am: Makefile\ninstalldirs:\ninstall: install-am\ninstall-exec: install-exec-am\ninstall-data: install-data-am\nuninstall: uninstall-am\n\ninstall-am: all-am\n\t@$(MAKE) $(AM_MAKEFLAGS) install-exec-am install-data-am\n\ninstallcheck: installcheck-am\ninstall-strip:\n\tif test -z '$(STRIP)'; then \\\n\t  $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" \\\n\t    install_sh_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" INSTALL_STRIP_FLAG=-s \\\n\t      install; \\\n\telse \\\n\t  $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" \\\n\t    install_sh_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" INSTALL_STRIP_FLAG=-s \\\n\t    \"INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'\" install; \\\n\tfi\nmostlyclean-generic:\n\t-test -z \"$(TEST_LOGS)\" || rm -f $(TEST_LOGS)\n\t-test -z \"$(TEST_LOGS:.log=.trs)\" || rm -f $(TEST_LOGS:.log=.trs)\n\t-test -z \"$(TEST_SUITE_LOG)\" || rm -f $(TEST_SUITE_LOG)\n\nclean-generic:\n\ndistclean-generic:\n\t-test -z \"$(CONFIG_CLEAN_FILES)\" || rm -f $(CONFIG_CLEAN_FILES)\n\t-test . = \"$(srcdir)\" || test -z \"$(CONFIG_CLEAN_VPATH_FILES)\" || rm -f $(CONFIG_CLEAN_VPATH_FILES)\n\nmaintainer-clean-generic:\n\t@echo \"This command is intended for maintainers to use\"\n\t@echo \"it deletes files that may require special tools to rebuild.\"\nclean: clean-am\n\nclean-am: clean-checkPROGRAMS clean-generic clean-libtool \\\n\tmostlyclean-am\n\ndistclean: distclean-am\n\t-rm -rf ./$(DEPDIR)\n\t-rm -f Makefile\ndistclean-am: clean-am distclean-compile distclean-generic \\\n\tdistclean-tags\n\ndvi: dvi-am\n\ndvi-am:\n\nhtml: html-am\n\nhtml-am:\n\ninfo: info-am\n\ninfo-am:\n\ninstall-data-am:\n\ninstall-dvi: install-dvi-am\n\ninstall-dvi-am:\n\ninstall-exec-am:\n\ninstall-html: install-html-am\n\ninstall-html-am:\n\ninstall-info: install-info-am\n\ninstall-info-am:\n\ninstall-man:\n\ninstall-pdf: install-pdf-am\n\ninstall-pdf-am:\n\ninstall-ps: install-ps-am\n\ninstall-ps-am:\n\ninstallcheck-am:\n\nmaintainer-clean: maintainer-clean-am\n\t-rm -rf ./$(DEPDIR)\n\t-rm -f Makefile\nmaintainer-clean-am: distclean-am maintainer-clean-generic\n\nmostlyclean: mostlyclean-am\n\nmostlyclean-am: mostlyclean-compile mostlyclean-generic \\\n\tmostlyclean-libtool\n\npdf: pdf-am\n\npdf-am:\n\nps: ps-am\n\nps-am:\n\nuninstall-am:\n\n.MAKE: check-am install-am install-strip\n\n.PHONY: CTAGS GTAGS TAGS all all-am check check-TESTS check-am clean \\\n\tclean-checkPROGRAMS clean-generic clean-libtool cscopelist-am \\\n\tctags ctags-am distclean distclean-compile distclean-generic \\\n\tdistclean-libtool distclean-tags distdir dvi dvi-am html \\\n\thtml-am info info-am install install-am install-data \\\n\tinstall-data-am install-dvi install-dvi-am install-exec \\\n\tinstall-exec-am install-html install-html-am install-info \\\n\tinstall-info-am install-man install-pdf install-pdf-am \\\n\tinstall-ps install-ps-am install-strip installcheck \\\n\tinstallcheck-am installdirs maintainer-clean \\\n\tmaintainer-clean-generic mostlyclean mostlyclean-compile \\\n\tmostlyclean-generic mostlyclean-libtool pdf pdf-am ps ps-am \\\n\trecheck tags tags-am uninstall uninstall-am\n\n\n# Tell versions [3.59,3.63) of GNU make to not export all variables.\n# Otherwise a system limit (for SysV at least) may be exceeded.\n.NOEXPORT:\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/test/algo_test.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Regression test for various FST algorithms.\n\n#include \"./algo_test.h\"\n\n#include <cstdlib>\n\n#include <vector>\n\n#include <fst/flags.h>\n\n// DEFINEs determine which semirings are tested; these are controlled by\n// the `defines` attributes of the associated build rules.\n\nDEFINE_int32(seed, -1, \"random seed\");\nDEFINE_int32(repeat, 25, \"number of test repetitions\");\n\nusing fst::AlgoTester;\nusing fst::ArcTpl;\nusing fst::GallicArc;\nusing fst::GallicWeight;\nusing fst::LexicographicArc;\nusing fst::LexicographicWeight;\nusing fst::LogArc;\nusing fst::LogWeight;\nusing fst::MinMaxArc;\nusing fst::MinMaxWeight;\nusing fst::PowerWeight;\nusing fst::STRING_LEFT;\nusing fst::STRING_RIGHT;\nusing fst::StdArc;\nusing fst::StringArc;\nusing fst::StringWeight;\nusing fst::TropicalWeight;\nusing fst::WeightGenerate;\n\nint main(int argc, char **argv) {\n  FLAGS_fst_verify_properties = true;\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(argv[0], &argc, &argv, true);\n\n  static const int kCacheGcLimit = 20;\n\n  srand(FLAGS_seed);\n  LOG(INFO) << \"Seed = \" << FLAGS_seed;\n\n  FLAGS_fst_default_cache_gc = rand() % 2;\n  FLAGS_fst_default_cache_gc_limit = rand() % kCacheGcLimit;\n  VLOG(1) << \"default_cache_gc:\" << FLAGS_fst_default_cache_gc;\n  VLOG(1) << \"default_cache_gc_limit:\" << FLAGS_fst_default_cache_gc_limit;\n\n#ifdef TEST_TROPICAL\n  using TropicalWeightGenerate = WeightGenerate<TropicalWeight>;\n  TropicalWeightGenerate tropical_generator(false);\n  AlgoTester<StdArc, TropicalWeightGenerate> tropical_tester(\n      tropical_generator, FLAGS_seed);\n  tropical_tester.Test();\n#endif  // TEST_TROPICAL\n\n#ifdef TEST_LOG\n  using LogWeightGenerate = WeightGenerate<LogWeight>;\n  LogWeightGenerate log_generator(false);\n  AlgoTester<LogArc, LogWeightGenerate> log_tester(log_generator, FLAGS_seed);\n  log_tester.Test();\n#endif  // TEST_LOG\n\n#ifdef TEST_MINMAX\n  using MinMaxWeightGenerate = WeightGenerate<MinMaxWeight>;\n  MinMaxWeightGenerate minmax_generator(false);\n  AlgoTester<MinMaxArc, MinMaxWeightGenerate> minmax_tester(minmax_generator,\n                                                             FLAGS_seed);\n  minmax_tester.Test();\n#endif\n\n#ifdef TEST_LEFT_STRING\n  using StringWeightGenerate = WeightGenerate<StringWeight<int, STRING_LEFT>>;\n  StringWeightGenerate left_string_generator(false);\n  AlgoTester<StringArc<>, StringWeightGenerate> left_string_tester(\n      left_string_generator, FLAGS_seed);\n  left_string_tester.Test();\n#endif  // TEST_LEFT_STRING\n\n#ifdef TEST_RIGHT_STRING\n  using StringWeightGenerate =\n      WeightGenerate<StringWeight<int, STRING_RIGHT>>;\n  StringWeightGenerate right_string_generator(false);\n  AlgoTester<StringArc<STRING_RIGHT>, StringWeightGenerate>\n      right_string_tester(right_string_generator, FLAGS_seed);\n  right_string_tester.Test();\n#endif  // TEST_RIGHT_STRING\n\n#ifdef TEST_GALLIC\n  using StdGallicArc = GallicArc<StdArc>;\n  using TropicalGallicWeightGenerate =\n      WeightGenerate<GallicWeight<int, TropicalWeight>>;\n  TropicalGallicWeightGenerate tropical_gallic_generator(false);\n  AlgoTester<StdGallicArc, TropicalGallicWeightGenerate> gallic_tester(\n      tropical_gallic_generator, FLAGS_seed);\n  gallic_tester.Test();\n#endif  // TEST_GALLIC\n\n#ifdef TEST_LEXICOGRAPHIC\n  using TropicalLexicographicArc =\n      LexicographicArc<TropicalWeight, TropicalWeight>;\n  using TropicalLexicographicWeightGenerate =\n      WeightGenerate<LexicographicWeight<TropicalWeight, TropicalWeight>>;\n  TropicalLexicographicWeightGenerate lexicographic_generator(false);\n  AlgoTester<TropicalLexicographicArc, TropicalLexicographicWeightGenerate>\n      lexicographic_tester(lexicographic_generator, FLAGS_seed);\n  lexicographic_tester.Test();\n#endif  // TEST_LEXICOGRAPHIC\n\n#ifdef TEST_POWER\n  using TropicalCubeWeight = PowerWeight<TropicalWeight, 3>;\n  using TropicalCubeArc = ArcTpl<TropicalCubeWeight>;\n  using TropicalCubeWeightGenerate = WeightGenerate<TropicalCubeWeight>;\n  TropicalCubeWeightGenerate tropical_cube_generator(false);\n  AlgoTester<TropicalCubeArc, TropicalCubeWeightGenerate> tropical_cube_tester(\n      tropical_cube_generator, FLAGS_seed);\n  tropical_cube_tester.Test();\n#endif  // TEST_POWER\n\n  std::cout << \"PASS\" << std::endl;\n\n  return 0;\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/test/algo_test.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Regression test for various FST algorithms.\n\n#ifndef FST_TEST_ALGO_TEST_H_\n#define FST_TEST_ALGO_TEST_H_\n\n#include <fst/log.h>\n\n#include <fst/fstlib.h>\n#include \"./rand-fst.h\"\n\nDECLARE_int32(repeat);  // defined in ./algo_test.cc\n\nnamespace fst {\n\n// Mapper to change input and output label of every transition into\n// epsilons.\ntemplate <class A>\nclass EpsMapper {\n public:\n  EpsMapper() {}\n\n  A operator()(const A &arc) const {\n    return A(0, 0, arc.weight, arc.nextstate);\n  }\n\n  uint64 Properties(uint64 props) const {\n    props &= ~kNotAcceptor;\n    props |= kAcceptor;\n    props &= ~kNoIEpsilons & ~kNoOEpsilons & ~kNoEpsilons;\n    props |= kIEpsilons | kOEpsilons | kEpsilons;\n    props &= ~kNotILabelSorted & ~kNotOLabelSorted;\n    props |= kILabelSorted | kOLabelSorted;\n    return props;\n  }\n\n  MapFinalAction FinalAction() const { return MAP_NO_SUPERFINAL; }\n\n  MapSymbolsAction InputSymbolsAction() const { return MAP_COPY_SYMBOLS; }\n\n  MapSymbolsAction OutputSymbolsAction() const { return MAP_COPY_SYMBOLS; }\n};\n\n// Generic - no lookahead.\ntemplate <class Arc>\nvoid LookAheadCompose(const Fst<Arc> &ifst1, const Fst<Arc> &ifst2,\n                      MutableFst<Arc> *ofst) {\n  Compose(ifst1, ifst2, ofst);\n}\n\n// Specialized and epsilon olabel acyclic - lookahead.\nvoid LookAheadCompose(const Fst<StdArc> &ifst1, const Fst<StdArc> &ifst2,\n                      MutableFst<StdArc> *ofst) {\n  std::vector<StdArc::StateId> order;\n  bool acyclic;\n  TopOrderVisitor<StdArc> visitor(&order, &acyclic);\n  DfsVisit(ifst1, &visitor, OutputEpsilonArcFilter<StdArc>());\n  if (acyclic) {  // no ifst1 output epsilon cycles?\n    StdOLabelLookAheadFst lfst1(ifst1);\n    StdVectorFst lfst2(ifst2);\n    LabelLookAheadRelabeler<StdArc>::Relabel(&lfst2, lfst1, true);\n    Compose(lfst1, lfst2, ofst);\n  } else {\n    Compose(ifst1, ifst2, ofst);\n  }\n}\n\n// This class tests a variety of identities and properties that must\n// hold for various algorithms on weighted FSTs.\ntemplate <class Arc, class WeightGenerator>\nclass WeightedTester {\n public:\n  typedef typename Arc::Label Label;\n  typedef typename Arc::StateId StateId;\n  typedef typename Arc::Weight Weight;\n\n  WeightedTester(time_t seed, const Fst<Arc> &zero_fst, const Fst<Arc> &one_fst,\n                 const Fst<Arc> &univ_fst, WeightGenerator *weight_generator)\n      : seed_(seed),\n        zero_fst_(zero_fst),\n        one_fst_(one_fst),\n        univ_fst_(univ_fst),\n        weight_generator_(weight_generator) {}\n\n  void Test(const Fst<Arc> &T1, const Fst<Arc> &T2, const Fst<Arc> &T3) {\n    TestRational(T1, T2, T3);\n    TestMap(T1);\n    TestCompose(T1, T2, T3);\n    TestSort(T1);\n    TestOptimize(T1);\n    TestSearch(T1);\n  }\n\n private:\n  // Tests rational operations with identities\n  void TestRational(const Fst<Arc> &T1, const Fst<Arc> &T2,\n                    const Fst<Arc> &T3) {\n    {\n      VLOG(1) << \"Check destructive and delayed union are equivalent.\";\n      VectorFst<Arc> U1(T1);\n      Union(&U1, T2);\n      UnionFst<Arc> U2(T1, T2);\n      CHECK(Equiv(U1, U2));\n    }\n\n    {\n      VLOG(1) << \"Check destructive and delayed concatenation are equivalent.\";\n      VectorFst<Arc> C1(T1);\n      Concat(&C1, T2);\n      ConcatFst<Arc> C2(T1, T2);\n      CHECK(Equiv(C1, C2));\n      VectorFst<Arc> C3(T2);\n      Concat(T1, &C3);\n      CHECK(Equiv(C3, C2));\n    }\n\n    {\n      VLOG(1) << \"Check destructive and delayed closure* are equivalent.\";\n      VectorFst<Arc> C1(T1);\n      Closure(&C1, CLOSURE_STAR);\n      ClosureFst<Arc> C2(T1, CLOSURE_STAR);\n      CHECK(Equiv(C1, C2));\n    }\n\n    {\n      VLOG(1) << \"Check destructive and delayed closure+ are equivalent.\";\n      VectorFst<Arc> C1(T1);\n      Closure(&C1, CLOSURE_PLUS);\n      ClosureFst<Arc> C2(T1, CLOSURE_PLUS);\n      CHECK(Equiv(C1, C2));\n    }\n\n    {\n      VLOG(1) << \"Check union is associative (destructive).\";\n      VectorFst<Arc> U1(T1);\n      Union(&U1, T2);\n      Union(&U1, T3);\n\n      VectorFst<Arc> U3(T2);\n      Union(&U3, T3);\n      VectorFst<Arc> U4(T1);\n      Union(&U4, U3);\n\n      CHECK(Equiv(U1, U4));\n    }\n\n    {\n      VLOG(1) << \"Check union is associative (delayed).\";\n      UnionFst<Arc> U1(T1, T2);\n      UnionFst<Arc> U2(U1, T3);\n\n      UnionFst<Arc> U3(T2, T3);\n      UnionFst<Arc> U4(T1, U3);\n\n      CHECK(Equiv(U2, U4));\n    }\n\n    {\n      VLOG(1) << \"Check union is associative (destructive delayed).\";\n      UnionFst<Arc> U1(T1, T2);\n      Union(&U1, T3);\n\n      UnionFst<Arc> U3(T2, T3);\n      UnionFst<Arc> U4(T1, U3);\n\n      CHECK(Equiv(U1, U4));\n    }\n\n    {\n      VLOG(1) << \"Check concatenation is associative (destructive).\";\n      VectorFst<Arc> C1(T1);\n      Concat(&C1, T2);\n      Concat(&C1, T3);\n\n      VectorFst<Arc> C3(T2);\n      Concat(&C3, T3);\n      VectorFst<Arc> C4(T1);\n      Concat(&C4, C3);\n\n      CHECK(Equiv(C1, C4));\n    }\n\n    {\n      VLOG(1) << \"Check concatenation is associative (delayed).\";\n      ConcatFst<Arc> C1(T1, T2);\n      ConcatFst<Arc> C2(C1, T3);\n\n      ConcatFst<Arc> C3(T2, T3);\n      ConcatFst<Arc> C4(T1, C3);\n\n      CHECK(Equiv(C2, C4));\n    }\n\n    {\n      VLOG(1) << \"Check concatenation is associative (destructive delayed).\";\n      ConcatFst<Arc> C1(T1, T2);\n      Concat(&C1, T3);\n\n      ConcatFst<Arc> C3(T2, T3);\n      ConcatFst<Arc> C4(T1, C3);\n\n      CHECK(Equiv(C1, C4));\n    }\n\n    if (Weight::Properties() & kLeftSemiring) {\n      VLOG(1) << \"Check concatenation left distributes\"\n              << \" over union (destructive).\";\n\n      VectorFst<Arc> U1(T1);\n      Union(&U1, T2);\n      VectorFst<Arc> C1(T3);\n      Concat(&C1, U1);\n\n      VectorFst<Arc> C2(T3);\n      Concat(&C2, T1);\n      VectorFst<Arc> C3(T3);\n      Concat(&C3, T2);\n      VectorFst<Arc> U2(C2);\n      Union(&U2, C3);\n\n      CHECK(Equiv(C1, U2));\n    }\n\n    if (Weight::Properties() & kRightSemiring) {\n      VLOG(1) << \"Check concatenation right distributes\"\n              << \" over union (destructive).\";\n      VectorFst<Arc> U1(T1);\n      Union(&U1, T2);\n      VectorFst<Arc> C1(U1);\n      Concat(&C1, T3);\n\n      VectorFst<Arc> C2(T1);\n      Concat(&C2, T3);\n      VectorFst<Arc> C3(T2);\n      Concat(&C3, T3);\n      VectorFst<Arc> U2(C2);\n      Union(&U2, C3);\n\n      CHECK(Equiv(C1, U2));\n    }\n\n    if (Weight::Properties() & kLeftSemiring) {\n      VLOG(1) << \"Check concatenation left distributes over union (delayed).\";\n      UnionFst<Arc> U1(T1, T2);\n      ConcatFst<Arc> C1(T3, U1);\n\n      ConcatFst<Arc> C2(T3, T1);\n      ConcatFst<Arc> C3(T3, T2);\n      UnionFst<Arc> U2(C2, C3);\n\n      CHECK(Equiv(C1, U2));\n    }\n\n    if (Weight::Properties() & kRightSemiring) {\n      VLOG(1) << \"Check concatenation right distributes over union (delayed).\";\n      UnionFst<Arc> U1(T1, T2);\n      ConcatFst<Arc> C1(U1, T3);\n\n      ConcatFst<Arc> C2(T1, T3);\n      ConcatFst<Arc> C3(T2, T3);\n      UnionFst<Arc> U2(C2, C3);\n\n      CHECK(Equiv(C1, U2));\n    }\n\n    if (Weight::Properties() & kLeftSemiring) {\n      VLOG(1) << \"Check T T* == T+ (destructive).\";\n      VectorFst<Arc> S(T1);\n      Closure(&S, CLOSURE_STAR);\n      VectorFst<Arc> C(T1);\n      Concat(&C, S);\n\n      VectorFst<Arc> P(T1);\n      Closure(&P, CLOSURE_PLUS);\n\n      CHECK(Equiv(C, P));\n    }\n\n    if (Weight::Properties() & kRightSemiring) {\n      VLOG(1) << \"Check T* T == T+ (destructive).\";\n      VectorFst<Arc> S(T1);\n      Closure(&S, CLOSURE_STAR);\n      VectorFst<Arc> C(S);\n      Concat(&C, T1);\n\n      VectorFst<Arc> P(T1);\n      Closure(&P, CLOSURE_PLUS);\n\n      CHECK(Equiv(C, P));\n    }\n\n    if (Weight::Properties() & kLeftSemiring) {\n      VLOG(1) << \"Check T T* == T+ (delayed).\";\n      ClosureFst<Arc> S(T1, CLOSURE_STAR);\n      ConcatFst<Arc> C(T1, S);\n\n      ClosureFst<Arc> P(T1, CLOSURE_PLUS);\n\n      CHECK(Equiv(C, P));\n    }\n\n    if (Weight::Properties() & kRightSemiring) {\n      VLOG(1) << \"Check T* T == T+ (delayed).\";\n      ClosureFst<Arc> S(T1, CLOSURE_STAR);\n      ConcatFst<Arc> C(S, T1);\n\n      ClosureFst<Arc> P(T1, CLOSURE_PLUS);\n\n      CHECK(Equiv(C, P));\n    }\n  }\n\n  // Tests map-based operations.\n  void TestMap(const Fst<Arc> &T) {\n    {\n      VLOG(1) << \"Check destructive and delayed projection are equivalent.\";\n      VectorFst<Arc> P1(T);\n      Project(&P1, PROJECT_INPUT);\n      ProjectFst<Arc> P2(T, PROJECT_INPUT);\n      CHECK(Equiv(P1, P2));\n    }\n\n    {\n      VLOG(1) << \"Check destructive and delayed inversion are equivalent.\";\n      VectorFst<Arc> I1(T);\n      Invert(&I1);\n      InvertFst<Arc> I2(T);\n      CHECK(Equiv(I1, I2));\n    }\n\n    {\n      VLOG(1) << \"Check Pi_1(T) = Pi_2(T^-1) (destructive).\";\n      VectorFst<Arc> P1(T);\n      VectorFst<Arc> I1(T);\n      Project(&P1, PROJECT_INPUT);\n      Invert(&I1);\n      Project(&I1, PROJECT_OUTPUT);\n      CHECK(Equiv(P1, I1));\n    }\n\n    {\n      VLOG(1) << \"Check Pi_2(T) = Pi_1(T^-1) (destructive).\";\n      VectorFst<Arc> P1(T);\n      VectorFst<Arc> I1(T);\n      Project(&P1, PROJECT_OUTPUT);\n      Invert(&I1);\n      Project(&I1, PROJECT_INPUT);\n      CHECK(Equiv(P1, I1));\n    }\n\n    {\n      VLOG(1) << \"Check Pi_1(T) = Pi_2(T^-1) (delayed).\";\n      ProjectFst<Arc> P1(T, PROJECT_INPUT);\n      InvertFst<Arc> I1(T);\n      ProjectFst<Arc> P2(I1, PROJECT_OUTPUT);\n      CHECK(Equiv(P1, P2));\n    }\n\n    {\n      VLOG(1) << \"Check Pi_2(T) = Pi_1(T^-1) (delayed).\";\n      ProjectFst<Arc> P1(T, PROJECT_OUTPUT);\n      InvertFst<Arc> I1(T);\n      ProjectFst<Arc> P2(I1, PROJECT_INPUT);\n      CHECK(Equiv(P1, P2));\n    }\n\n    {\n      VLOG(1) << \"Check destructive relabeling\";\n      static const int kNumLabels = 10;\n      // set up relabeling pairs\n      std::vector<Label> labelset(kNumLabels);\n      for (size_t i = 0; i < kNumLabels; ++i) labelset[i] = i;\n      for (size_t i = 0; i < kNumLabels; ++i) {\n        using std::swap;\n        swap(labelset[i], labelset[rand() % kNumLabels]);\n      }\n\n      std::vector<std::pair<Label, Label>> ipairs1(kNumLabels);\n      std::vector<std::pair<Label, Label>> opairs1(kNumLabels);\n      for (size_t i = 0; i < kNumLabels; ++i) {\n        ipairs1[i] = std::make_pair(i, labelset[i]);\n        opairs1[i] = std::make_pair(labelset[i], i);\n      }\n      VectorFst<Arc> R(T);\n      Relabel(&R, ipairs1, opairs1);\n\n      std::vector<std::pair<Label, Label>> ipairs2(kNumLabels);\n      std::vector<std::pair<Label, Label>> opairs2(kNumLabels);\n      for (size_t i = 0; i < kNumLabels; ++i) {\n        ipairs2[i] = std::make_pair(labelset[i], i);\n        opairs2[i] = std::make_pair(i, labelset[i]);\n      }\n      Relabel(&R, ipairs2, opairs2);\n      CHECK(Equiv(R, T));\n\n      VLOG(1) << \"Check on-the-fly relabeling\";\n      RelabelFst<Arc> Rdelay(T, ipairs1, opairs1);\n\n      RelabelFst<Arc> RRdelay(Rdelay, ipairs2, opairs2);\n      CHECK(Equiv(RRdelay, T));\n    }\n\n    {\n      VLOG(1) << \"Check encoding/decoding (destructive).\";\n      VectorFst<Arc> D(T);\n      uint32 encode_props = 0;\n      if (rand() % 2) encode_props |= kEncodeLabels;\n      if (rand() % 2) encode_props |= kEncodeWeights;\n      EncodeMapper<Arc> encoder(encode_props, ENCODE);\n      Encode(&D, &encoder);\n      Decode(&D, encoder);\n      CHECK(Equiv(D, T));\n    }\n\n    {\n      VLOG(1) << \"Check encoding/decoding (delayed).\";\n      uint32 encode_props = 0;\n      if (rand() % 2) encode_props |= kEncodeLabels;\n      if (rand() % 2) encode_props |= kEncodeWeights;\n      EncodeMapper<Arc> encoder(encode_props, ENCODE);\n      EncodeFst<Arc> E(T, &encoder);\n      VectorFst<Arc> Encoded(E);\n      DecodeFst<Arc> D(Encoded, encoder);\n      CHECK(Equiv(D, T));\n    }\n\n    {\n      VLOG(1) << \"Check gallic mappers (constructive).\";\n      ToGallicMapper<Arc> to_mapper;\n      FromGallicMapper<Arc> from_mapper;\n      VectorFst<GallicArc<Arc>> G;\n      VectorFst<Arc> F;\n      ArcMap(T, &G, to_mapper);\n      ArcMap(G, &F, from_mapper);\n      CHECK(Equiv(T, F));\n    }\n\n    {\n      VLOG(1) << \"Check gallic mappers (delayed).\";\n      ToGallicMapper<Arc> to_mapper;\n      FromGallicMapper<Arc> from_mapper;\n      ArcMapFst<Arc, GallicArc<Arc>, ToGallicMapper<Arc>> G(T, to_mapper);\n      ArcMapFst<GallicArc<Arc>, Arc, FromGallicMapper<Arc>> F(G, from_mapper);\n      CHECK(Equiv(T, F));\n    }\n  }\n\n  // Tests compose-based operations.\n  void TestCompose(const Fst<Arc> &T1, const Fst<Arc> &T2, const Fst<Arc> &T3) {\n    if (!(Weight::Properties() & kCommutative)) return;\n\n    VectorFst<Arc> S1(T1);\n    VectorFst<Arc> S2(T2);\n    VectorFst<Arc> S3(T3);\n\n    ILabelCompare<Arc> icomp;\n    OLabelCompare<Arc> ocomp;\n\n    ArcSort(&S1, ocomp);\n    ArcSort(&S2, ocomp);\n    ArcSort(&S3, icomp);\n\n    {\n      VLOG(1) << \"Check composition is associative.\";\n      ComposeFst<Arc> C1(S1, S2);\n      ComposeFst<Arc> C2(C1, S3);\n      ComposeFst<Arc> C3(S2, S3);\n      ComposeFst<Arc> C4(S1, C3);\n\n      CHECK(Equiv(C2, C4));\n    }\n\n    {\n      VLOG(1) << \"Check composition left distributes over union.\";\n      UnionFst<Arc> U1(S2, S3);\n      ComposeFst<Arc> C1(S1, U1);\n\n      ComposeFst<Arc> C2(S1, S2);\n      ComposeFst<Arc> C3(S1, S3);\n      UnionFst<Arc> U2(C2, C3);\n\n      CHECK(Equiv(C1, U2));\n    }\n\n    {\n      VLOG(1) << \"Check composition right distributes over union.\";\n      UnionFst<Arc> U1(S1, S2);\n      ComposeFst<Arc> C1(U1, S3);\n\n      ComposeFst<Arc> C2(S1, S3);\n      ComposeFst<Arc> C3(S2, S3);\n      UnionFst<Arc> U2(C2, C3);\n\n      CHECK(Equiv(C1, U2));\n    }\n\n    VectorFst<Arc> A1(S1);\n    VectorFst<Arc> A2(S2);\n    VectorFst<Arc> A3(S3);\n    Project(&A1, PROJECT_OUTPUT);\n    Project(&A2, PROJECT_INPUT);\n    Project(&A3, PROJECT_INPUT);\n\n    {\n      VLOG(1) << \"Check intersection is commutative.\";\n      IntersectFst<Arc> I1(A1, A2);\n      IntersectFst<Arc> I2(A2, A1);\n      CHECK(Equiv(I1, I2));\n    }\n\n    {\n      VLOG(1) << \"Check all epsilon filters leads to equivalent results.\";\n      typedef Matcher<Fst<Arc>> M;\n      ComposeFst<Arc> C1(S1, S2);\n      ComposeFst<Arc> C2(\n          S1, S2, ComposeFstOptions<Arc, M, AltSequenceComposeFilter<M>>());\n      ComposeFst<Arc> C3(S1, S2,\n                         ComposeFstOptions<Arc, M, MatchComposeFilter<M>>());\n\n      CHECK(Equiv(C1, C2));\n      CHECK(Equiv(C1, C3));\n\n      if ((Weight::Properties() & kIdempotent) ||\n          S1.Properties(kNoOEpsilons, false) ||\n          S2.Properties(kNoIEpsilons, false)) {\n        ComposeFst<Arc> C4(\n            S1, S2, ComposeFstOptions<Arc, M, TrivialComposeFilter<M>>());\n        CHECK(Equiv(C1, C4));\n      }\n\n      if (S1.Properties(kNoOEpsilons, false) &&\n          S2.Properties(kNoIEpsilons, false)) {\n        ComposeFst<Arc> C5(S1, S2,\n                           ComposeFstOptions<Arc, M, NullComposeFilter<M>>());\n        CHECK(Equiv(C1, C5));\n      }\n    }\n\n    {\n      VLOG(1) << \"Check look-ahead filters lead to equivalent results.\";\n      VectorFst<Arc> C1, C2;\n      Compose(S1, S2, &C1);\n      LookAheadCompose(S1, S2, &C2);\n      CHECK(Equiv(C1, C2));\n    }\n  }\n\n  // Tests sorting operations\n  void TestSort(const Fst<Arc> &T) {\n    ILabelCompare<Arc> icomp;\n    OLabelCompare<Arc> ocomp;\n\n    {\n      VLOG(1) << \"Check arc sorted Fst is equivalent to its input.\";\n      VectorFst<Arc> S1(T);\n      ArcSort(&S1, icomp);\n      CHECK(Equiv(T, S1));\n    }\n\n    {\n      VLOG(1) << \"Check destructive and delayed arcsort are equivalent.\";\n      VectorFst<Arc> S1(T);\n      ArcSort(&S1, icomp);\n      ArcSortFst<Arc, ILabelCompare<Arc>> S2(T, icomp);\n      CHECK(Equiv(S1, S2));\n    }\n\n    {\n      VLOG(1) << \"Check ilabel sorting vs. olabel sorting with inversions.\";\n      VectorFst<Arc> S1(T);\n      VectorFst<Arc> S2(T);\n      ArcSort(&S1, icomp);\n      Invert(&S2);\n      ArcSort(&S2, ocomp);\n      Invert(&S2);\n      CHECK(Equiv(S1, S2));\n    }\n\n    {\n      VLOG(1) << \"Check topologically sorted Fst is equivalent to its input.\";\n      VectorFst<Arc> S1(T);\n      TopSort(&S1);\n      CHECK(Equiv(T, S1));\n    }\n\n    {\n      VLOG(1) << \"Check reverse(reverse(T)) = T\";\n      for (int i = 0; i < 2; ++i) {\n        VectorFst<ReverseArc<Arc>> R1;\n        VectorFst<Arc> R2;\n        bool require_superinitial = i == 1;\n        Reverse(T, &R1, require_superinitial);\n        Reverse(R1, &R2, require_superinitial);\n        CHECK(Equiv(T, R2));\n      }\n    }\n  }\n\n  // Tests optimization operations\n  void TestOptimize(const Fst<Arc> &T) {\n    uint64 tprops = T.Properties(kFstProperties, true);\n    uint64 wprops = Weight::Properties();\n\n    VectorFst<Arc> A(T);\n    Project(&A, PROJECT_INPUT);\n    {\n      VLOG(1) << \"Check connected FST is equivalent to its input.\";\n      VectorFst<Arc> C1(T);\n      Connect(&C1);\n      CHECK(Equiv(T, C1));\n    }\n\n    if ((wprops & kSemiring) == kSemiring &&\n        (tprops & kAcyclic || wprops & kIdempotent)) {\n      VLOG(1) << \"Check epsilon-removed FST is equivalent to its input.\";\n      VectorFst<Arc> R1(T);\n      RmEpsilon(&R1);\n      CHECK(Equiv(T, R1));\n\n      VLOG(1) << \"Check destructive and delayed epsilon removal\"\n              << \"are equivalent.\";\n      RmEpsilonFst<Arc> R2(T);\n      CHECK(Equiv(R1, R2));\n\n      VLOG(1) << \"Check an FST with a large proportion\"\n              << \" of epsilon transitions:\";\n      // Maps all transitions of T to epsilon-transitions and append\n      // a non-epsilon transition.\n      VectorFst<Arc> U;\n      ArcMap(T, &U, EpsMapper<Arc>());\n      VectorFst<Arc> V;\n      V.SetStart(V.AddState());\n      Arc arc(1, 1, Weight::One(), V.AddState());\n      V.AddArc(V.Start(), arc);\n      V.SetFinal(arc.nextstate, Weight::One());\n      Concat(&U, V);\n      // Check that epsilon-removal preserves the shortest-distance\n      // from the initial state to the final states.\n      std::vector<Weight> d;\n      ShortestDistance(U, &d, true);\n      Weight w = U.Start() < d.size() ? d[U.Start()] : Weight::Zero();\n      VectorFst<Arc> U1(U);\n      RmEpsilon(&U1);\n      ShortestDistance(U1, &d, true);\n      Weight w1 = U1.Start() < d.size() ? d[U1.Start()] : Weight::Zero();\n      CHECK(ApproxEqual(w, w1, kTestDelta));\n      RmEpsilonFst<Arc> U2(U);\n      ShortestDistance(U2, &d, true);\n      Weight w2 = U2.Start() < d.size() ? d[U2.Start()] : Weight::Zero();\n      CHECK(ApproxEqual(w, w2, kTestDelta));\n    }\n\n    if ((wprops & kSemiring) == kSemiring && tprops & kAcyclic) {\n      VLOG(1) << \"Check determinized FSA is equivalent to its input.\";\n      DeterminizeFst<Arc> D(A);\n      CHECK(Equiv(A, D));\n\n      {\n        VLOG(1) << \"Check determinized FST is equivalent to its input.\";\n        DeterminizeFstOptions<Arc> opts;\n        opts.type = DETERMINIZE_NONFUNCTIONAL;\n        DeterminizeFst<Arc> DT(T, opts);\n        CHECK(Equiv(T, DT));\n      }\n\n      if ((wprops & (kPath | kCommutative)) == (kPath | kCommutative)) {\n        VLOG(1) << \"Check pruning in determinization\";\n        VectorFst<Arc> P;\n        Weight threshold = (*weight_generator_)();\n        DeterminizeOptions<Arc> opts;\n        opts.weight_threshold = threshold;\n        Determinize(A, &P, opts);\n        CHECK(P.Properties(kIDeterministic, true));\n        CHECK(PruneEquiv(A, P, threshold));\n      }\n\n      if ((wprops & kPath) == kPath) {\n        VLOG(1) << \"Check min-determinization\";\n\n        // Ensures no input epsilons\n        VectorFst<Arc> R(T);\n        std::vector<std::pair<Label, Label>> ipairs, opairs;\n        ipairs.push_back(std::pair<Label, Label>(0, 1));\n        Relabel(&R, ipairs, opairs);\n\n        VectorFst<Arc> M;\n        DeterminizeOptions<Arc> opts;\n        opts.type = DETERMINIZE_DISAMBIGUATE;\n        Determinize(R, &M, opts);\n        CHECK(M.Properties(kIDeterministic, true));\n        CHECK(MinRelated(M, R));\n      }\n\n      int n;\n      {\n        VLOG(1) << \"Check size(min(det(A))) <= size(det(A))\"\n                << \" and  min(det(A)) equiv det(A)\";\n        VectorFst<Arc> M(D);\n        n = M.NumStates();\n        Minimize(&M, static_cast<MutableFst<Arc> *>(nullptr), kDelta);\n        CHECK(Equiv(D, M));\n        CHECK(M.NumStates() <= n);\n        n = M.NumStates();\n      }\n\n      if (n && (wprops & kIdempotent) == kIdempotent &&\n          A.Properties(kNoEpsilons, true)) {\n        VLOG(1) << \"Check that Revuz's algorithm leads to the\"\n                << \" same number of states as Brozozowski's algorithm\";\n\n        // Skip test if A is the empty machine or contains epsilons or\n        // if the semiring is not idempotent (to avoid floating point\n        // errors)\n        VectorFst<Arc> R;\n        Reverse(A, &R);\n        RmEpsilon(&R);\n        DeterminizeFst<Arc> DR(R);\n        VectorFst<Arc> RD;\n        Reverse(DR, &RD);\n        DeterminizeFst<Arc> DRD(RD);\n        VectorFst<Arc> M(DRD);\n        CHECK_EQ(n + 1, M.NumStates());  // Accounts for the epsilon transition\n                                         // to the initial state\n      }\n    }\n\n    if ((wprops & kSemiring) == kSemiring && tprops & kAcyclic) {\n      VLOG(1) << \"Check disambiguated FSA is equivalent to its input.\";\n      VectorFst<Arc> R(A), D;\n      RmEpsilon(&R);\n      Disambiguate(R, &D);\n      CHECK(Equiv(R, D));\n      VLOG(1) << \"Check disambiguated FSA is unambiguous\";\n      CHECK(Unambiguous(D));\n\n      /* TODO(riley): find out why this fails\n      if ((wprops & (kPath | kCommutative)) == (kPath | kCommutative)) {\n        VLOG(1)  << \"Check pruning in disambiguation\";\n        VectorFst<Arc> P;\n        Weight threshold = (*weight_generator_)();\n        DisambiguateOptions<Arc> opts;\n        opts.weight_threshold = threshold;\n        Disambiguate(R, &P, opts);\n        CHECK(Unambiguous(P));\n        CHECK(PruneEquiv(A, P, threshold));\n      }\n      */\n    }\n\n    if (Arc::Type() == LogArc::Type() || Arc::Type() == StdArc::Type()) {\n      VLOG(1) << \"Check reweight(T) equiv T\";\n      std::vector<Weight> potential;\n      VectorFst<Arc> RI(T);\n      VectorFst<Arc> RF(T);\n      while (potential.size() < RI.NumStates())\n        potential.push_back((*weight_generator_)());\n\n      Reweight(&RI, potential, REWEIGHT_TO_INITIAL);\n      CHECK(Equiv(T, RI));\n\n      Reweight(&RF, potential, REWEIGHT_TO_FINAL);\n      CHECK(Equiv(T, RF));\n    }\n\n    if ((wprops & kIdempotent) || (tprops & kAcyclic)) {\n      VLOG(1) << \"Check pushed FST is equivalent to input FST.\";\n      // Pushing towards the final state.\n      if (wprops & kRightSemiring) {\n        VectorFst<Arc> P1;\n        Push<Arc, REWEIGHT_TO_FINAL>(T, &P1, kPushLabels);\n        CHECK(Equiv(T, P1));\n\n        VectorFst<Arc> P2;\n        Push<Arc, REWEIGHT_TO_FINAL>(T, &P2, kPushWeights);\n        CHECK(Equiv(T, P2));\n\n        VectorFst<Arc> P3;\n        Push<Arc, REWEIGHT_TO_FINAL>(T, &P3, kPushLabels | kPushWeights);\n        CHECK(Equiv(T, P3));\n      }\n\n      // Pushing towards the initial state.\n      if (wprops & kLeftSemiring) {\n        VectorFst<Arc> P1;\n        Push<Arc, REWEIGHT_TO_INITIAL>(T, &P1, kPushLabels);\n        CHECK(Equiv(T, P1));\n\n        VectorFst<Arc> P2;\n        Push<Arc, REWEIGHT_TO_INITIAL>(T, &P2, kPushWeights);\n        CHECK(Equiv(T, P2));\n        VectorFst<Arc> P3;\n        Push<Arc, REWEIGHT_TO_INITIAL>(T, &P3, kPushLabels | kPushWeights);\n        CHECK(Equiv(T, P3));\n      }\n    }\n\n    if ((wprops & (kPath | kCommutative)) == (kPath | kCommutative)) {\n      VLOG(1) << \"Check pruning algorithm\";\n      {\n        VLOG(1) << \"Check equiv. of constructive and destructive algorithms\";\n        Weight thresold = (*weight_generator_)();\n        VectorFst<Arc> P1(T);\n        Prune(&P1, thresold);\n        VectorFst<Arc> P2;\n        Prune(T, &P2, thresold);\n        CHECK(Equiv(P1, P2));\n      }\n\n      {\n        VLOG(1) << \"Check prune(reverse) equiv reverse(prune)\";\n        Weight thresold = (*weight_generator_)();\n        VectorFst<ReverseArc<Arc>> R;\n        VectorFst<Arc> P1(T);\n        VectorFst<Arc> P2;\n        Prune(&P1, thresold);\n        Reverse(T, &R);\n        Prune(&R, thresold.Reverse());\n        Reverse(R, &P2);\n        CHECK(Equiv(P1, P2));\n      }\n      {\n        VLOG(1) << \"Check: ShortestDistance(A - prune(A))\"\n                << \" > ShortestDistance(A) times Threshold\";\n        Weight threshold = (*weight_generator_)();\n        VectorFst<Arc> P;\n        Prune(A, &P, threshold);\n        CHECK(PruneEquiv(A, P, threshold));\n      }\n    }\n    if (tprops & kAcyclic) {\n      VLOG(1) << \"Check synchronize(T) equiv T\";\n      SynchronizeFst<Arc> S(T);\n      CHECK(Equiv(T, S));\n    }\n  }\n\n  // Tests search operations\n  void TestSearch(const Fst<Arc> &T) {\n    uint64 wprops = Weight::Properties();\n\n    VectorFst<Arc> A(T);\n    Project(&A, PROJECT_INPUT);\n\n    if ((wprops & (kPath | kRightSemiring)) == (kPath | kRightSemiring)) {\n      VLOG(1) << \"Check 1-best weight.\";\n      VectorFst<Arc> path;\n      ShortestPath(T, &path);\n      Weight tsum = ShortestDistance(T);\n      Weight psum = ShortestDistance(path);\n      CHECK(ApproxEqual(tsum, psum, kTestDelta));\n    }\n\n    if ((wprops & (kPath | kSemiring)) == (kPath | kSemiring)) {\n      VLOG(1) << \"Check n-best weights\";\n      VectorFst<Arc> R(A);\n      RmEpsilon(&R, /*connect=*/ true, Arc::Weight::Zero(), kNoStateId,\n                kDelta);\n      int nshortest = rand() % kNumRandomShortestPaths + 2;\n      VectorFst<Arc> paths;\n      ShortestPath(R, &paths, nshortest, /*unique=*/ true,\n                   /*first_path=*/ false, Weight::Zero(), kNumShortestStates,\n                   kDelta);\n      std::vector<Weight> distance;\n      ShortestDistance(paths, &distance, true, kDelta);\n      StateId pstart = paths.Start();\n      if (pstart != kNoStateId) {\n        ArcIterator<Fst<Arc>> piter(paths, pstart);\n        for (; !piter.Done(); piter.Next()) {\n          StateId s = piter.Value().nextstate;\n          Weight nsum = s < distance.size()\n                            ? Times(piter.Value().weight, distance[s])\n                            : Weight::Zero();\n          VectorFst<Arc> path;\n          ShortestPath(R, &path, 1, false, false, Weight::Zero(), kNoStateId,\n                       kDelta);\n          Weight dsum = ShortestDistance(path, kDelta);\n          CHECK(ApproxEqual(nsum, dsum, kTestDelta));\n          ArcMap(&path, RmWeightMapper<Arc>());\n          VectorFst<Arc> S;\n          Difference(R, path, &S);\n          R = S;\n        }\n      }\n    }\n  }\n\n  // Tests if two FSTS are equivalent by checking if random\n  // strings from one FST are transduced the same by both FSTs.\n  template <class A>\n  bool Equiv(const Fst<A> &fst1, const Fst<A> &fst2) {\n    VLOG(1) << \"Check FSTs for sanity (including property bits).\";\n    CHECK(Verify(fst1));\n    CHECK(Verify(fst2));\n\n    // Ensures seed used once per instantiation.\n    static UniformArcSelector<A> uniform_selector(seed_);\n    RandGenOptions<UniformArcSelector<A>> opts(uniform_selector,\n                                               kRandomPathLength);\n    return RandEquivalent(fst1, fst2, kNumRandomPaths, kTestDelta, opts);\n  }\n\n  // Tests FSA is unambiguous\n  bool Unambiguous(const Fst<Arc> &fst) {\n    VectorFst<StdArc> sfst, dfst;\n    VectorFst<LogArc> lfst1, lfst2;\n    Map(fst, &sfst, RmWeightMapper<Arc, StdArc>());\n    Determinize(sfst, &dfst);\n    Map(fst, &lfst1, RmWeightMapper<Arc, LogArc>());\n    Map(dfst, &lfst2, RmWeightMapper<StdArc, LogArc>());\n    return Equiv(lfst1, lfst2);\n  }\n\n  // Ensures input-epsilon free transducers fst1 and fst2 have the\n  // same domain and that for each string pair '(is, os)' in fst1,\n  // '(is, os)' is the minimum weight match to 'is' in fst2.\n  template <class A>\n  bool MinRelated(const Fst<A> &fst1, const Fst<A> &fst2) {\n    // Same domain\n    VectorFst<Arc> P1(fst1), P2(fst2);\n    Project(&P1, PROJECT_INPUT);\n    Project(&P2, PROJECT_INPUT);\n    if (!Equiv(P1, P2)) {\n      LOG(ERROR) << \"Inputs not equivalent\";\n      return false;\n    }\n\n    // Ensures seed used once per instantiation.\n    static UniformArcSelector<A> uniform_selector(seed_);\n    RandGenOptions<UniformArcSelector<A>> opts(uniform_selector,\n                                               kRandomPathLength);\n\n    VectorFst<Arc> path, paths1, paths2;\n    for (ssize_t n = 0; n < kNumRandomPaths; ++n) {\n      RandGen(fst1, &path, opts);\n      Invert(&path);\n      Map(&path, RmWeightMapper<Arc>());\n      Compose(path, fst2, &paths1);\n      Weight sum1 = ShortestDistance(paths1);\n      Compose(paths1, path, &paths2);\n      Weight sum2 = ShortestDistance(paths2);\n      if (!ApproxEqual(Plus(sum1, sum2), sum2, kTestDelta)) {\n        LOG(ERROR) << \"Sums not equivalent: \" << sum1 << \" \" << sum2;\n        return false;\n      }\n    }\n    return true;\n  }\n\n  // Tests ShortestDistance(A - P) >=\n  // ShortestDistance(A) times Threshold.\n  template <class A>\n  bool PruneEquiv(const Fst<A> &fst, const Fst<A> &pfst, Weight threshold) {\n    VLOG(1) << \"Check FSTs for sanity (including property bits).\";\n    CHECK(Verify(fst));\n    CHECK(Verify(pfst));\n\n    DifferenceFst<Arc> D(fst, DeterminizeFst<Arc>(RmEpsilonFst<Arc>(\n                                  ArcMapFst<Arc, Arc, RmWeightMapper<Arc>>(\n                                      pfst, RmWeightMapper<Arc>()))));\n    Weight sum1 = Times(ShortestDistance(fst), threshold);\n    Weight sum2 = ShortestDistance(D);\n    return ApproxEqual(Plus(sum1, sum2), sum1, kTestDelta);\n  }\n\n  // Random seed.\n  int seed_;\n  // FST with no states\n  VectorFst<Arc> zero_fst_;\n  // FST with one state that accepts epsilon.\n  VectorFst<Arc> one_fst_;\n  // FST with one state that accepts all strings.\n  VectorFst<Arc> univ_fst_;\n  // Generates weights used in testing.\n  WeightGenerator *weight_generator_;\n  // Maximum random path length.\n  static const int kRandomPathLength;\n  // Number of random paths to explore.\n  static const int kNumRandomPaths;\n  // Maximum number of nshortest paths.\n  static const int kNumRandomShortestPaths;\n  // Maximum number of nshortest states.\n  static const int kNumShortestStates;\n  // Delta for equivalence tests.\n  static const float kTestDelta;\n\n  WeightedTester(const WeightedTester &) = delete;\n  WeightedTester &operator=(const WeightedTester &) = delete;\n};\n\ntemplate <class A, class WG>\nconst int WeightedTester<A, WG>::kRandomPathLength = 25;\n\ntemplate <class A, class WG>\nconst int WeightedTester<A, WG>::kNumRandomPaths = 100;\n\ntemplate <class A, class WG>\nconst int WeightedTester<A, WG>::kNumRandomShortestPaths = 100;\n\ntemplate <class A, class WG>\nconst int WeightedTester<A, WG>::kNumShortestStates = 10000;\n\ntemplate <class A, class WG>\nconst float WeightedTester<A, WG>::kTestDelta = .05;\n\n// This class tests a variety of identities and properties that must\n// hold for various algorithms on unweighted FSAs and that are not tested\n// by WeightedTester. Only the specialization does anything interesting.\ntemplate <class Arc>\nclass UnweightedTester {\n public:\n  UnweightedTester(const Fst<Arc> &zero_fsa, const Fst<Arc> &one_fsa,\n                   const Fst<Arc> &univ_fsa) {}\n\n  void Test(const Fst<Arc> &A1, const Fst<Arc> &A2, const Fst<Arc> &A3) {}\n};\n\n// Specialization for StdArc. This should work for any commutative,\n// idempotent semiring when restricted to the unweighted case\n// (being isomorphic to the boolean semiring).\ntemplate <>\nclass UnweightedTester<StdArc> {\n public:\n  typedef StdArc Arc;\n  typedef Arc::Label Label;\n  typedef Arc::StateId StateId;\n  typedef Arc::Weight Weight;\n\n  UnweightedTester(const Fst<Arc> &zero_fsa, const Fst<Arc> &one_fsa,\n                   const Fst<Arc> &univ_fsa)\n      : zero_fsa_(zero_fsa), one_fsa_(one_fsa), univ_fsa_(univ_fsa) {}\n\n  void Test(const Fst<Arc> &A1, const Fst<Arc> &A2, const Fst<Arc> &A3) {\n    TestRational(A1, A2, A3);\n    TestIntersect(A1, A2, A3);\n    TestOptimize(A1);\n  }\n\n private:\n  // Tests rational operations with identities\n  void TestRational(const Fst<Arc> &A1, const Fst<Arc> &A2,\n                    const Fst<Arc> &A3) {\n    {\n      VLOG(1) << \"Check the union contains its arguments (destructive).\";\n      VectorFst<Arc> U(A1);\n      Union(&U, A2);\n\n      CHECK(Subset(A1, U));\n      CHECK(Subset(A2, U));\n    }\n\n    {\n      VLOG(1) << \"Check the union contains its arguments (delayed).\";\n      UnionFst<Arc> U(A1, A2);\n\n      CHECK(Subset(A1, U));\n      CHECK(Subset(A2, U));\n    }\n\n    {\n      VLOG(1) << \"Check if A^n c A* (destructive).\";\n      VectorFst<Arc> C(one_fsa_);\n      int n = rand() % 5;\n      for (int i = 0; i < n; ++i) Concat(&C, A1);\n\n      VectorFst<Arc> S(A1);\n      Closure(&S, CLOSURE_STAR);\n      CHECK(Subset(C, S));\n    }\n\n    {\n      VLOG(1) << \"Check if A^n c A* (delayed).\";\n      int n = rand() % 5;\n      Fst<Arc> *C = new VectorFst<Arc>(one_fsa_);\n      for (int i = 0; i < n; ++i) {\n        ConcatFst<Arc> *F = new ConcatFst<Arc>(*C, A1);\n        delete C;\n        C = F;\n      }\n      ClosureFst<Arc> S(A1, CLOSURE_STAR);\n      CHECK(Subset(*C, S));\n      delete C;\n    }\n  }\n\n  // Tests intersect-based operations.\n  void TestIntersect(const Fst<Arc> &A1, const Fst<Arc> &A2,\n                     const Fst<Arc> &A3) {\n    VectorFst<Arc> S1(A1);\n    VectorFst<Arc> S2(A2);\n    VectorFst<Arc> S3(A3);\n\n    ILabelCompare<Arc> comp;\n\n    ArcSort(&S1, comp);\n    ArcSort(&S2, comp);\n    ArcSort(&S3, comp);\n\n    {\n      VLOG(1) << \"Check the intersection is contained in its arguments.\";\n      IntersectFst<Arc> I1(S1, S2);\n      CHECK(Subset(I1, S1));\n      CHECK(Subset(I1, S2));\n    }\n\n    {\n      VLOG(1) << \"Check union distributes over intersection.\";\n      IntersectFst<Arc> I1(S1, S2);\n      UnionFst<Arc> U1(I1, S3);\n\n      UnionFst<Arc> U2(S1, S3);\n      UnionFst<Arc> U3(S2, S3);\n      ArcSortFst<Arc, ILabelCompare<Arc>> S4(U3, comp);\n      IntersectFst<Arc> I2(U2, S4);\n\n      CHECK(Equiv(U1, I2));\n    }\n\n    VectorFst<Arc> C1;\n    VectorFst<Arc> C2;\n    Complement(S1, &C1);\n    Complement(S2, &C2);\n    ArcSort(&C1, comp);\n    ArcSort(&C2, comp);\n\n    {\n      VLOG(1) << \"Check S U S' = Sigma*\";\n      UnionFst<Arc> U(S1, C1);\n      CHECK(Equiv(U, univ_fsa_));\n    }\n\n    {\n      VLOG(1) << \"Check S n S' = {}\";\n      IntersectFst<Arc> I(S1, C1);\n      CHECK(Equiv(I, zero_fsa_));\n    }\n\n    {\n      VLOG(1) << \"Check (S1' U S2') == (S1 n S2)'\";\n      UnionFst<Arc> U(C1, C2);\n\n      IntersectFst<Arc> I(S1, S2);\n      VectorFst<Arc> C3;\n      Complement(I, &C3);\n      CHECK(Equiv(U, C3));\n    }\n\n    {\n      VLOG(1) << \"Check (S1' n S2') == (S1 U S2)'\";\n      IntersectFst<Arc> I(C1, C2);\n\n      UnionFst<Arc> U(S1, S2);\n      VectorFst<Arc> C3;\n      Complement(U, &C3);\n      CHECK(Equiv(I, C3));\n    }\n  }\n\n  // Tests optimization operations\n  void TestOptimize(const Fst<Arc> &A) {\n    {\n      VLOG(1) << \"Check determinized FSA is equivalent to its input.\";\n      DeterminizeFst<Arc> D(A);\n      CHECK(Equiv(A, D));\n    }\n\n    {\n      VLOG(1) << \"Check disambiguated FSA is equivalent to its input.\";\n      VectorFst<Arc> R(A), D;\n      RmEpsilon(&R);\n\n      Disambiguate(R, &D);\n      CHECK(Equiv(R, D));\n    }\n\n    {\n      VLOG(1) << \"Check minimized FSA is equivalent to its input.\";\n      int n;\n      {\n        RmEpsilonFst<Arc> R(A);\n        DeterminizeFst<Arc> D(R);\n        VectorFst<Arc> M(D);\n        Minimize(&M, static_cast<MutableFst<Arc> *>(nullptr), kDelta);\n        CHECK(Equiv(A, M));\n        n = M.NumStates();\n      }\n\n      if (n) {  // Skip test if A is the empty machine\n        VLOG(1) << \"Check that Hopcroft's and Revuz's algorithms lead to the\"\n                << \" same number of states as Brozozowski's algorithm\";\n        VectorFst<Arc> R;\n        Reverse(A, &R);\n        RmEpsilon(&R);\n        DeterminizeFst<Arc> DR(R);\n        VectorFst<Arc> RD;\n        Reverse(DR, &RD);\n        DeterminizeFst<Arc> DRD(RD);\n        VectorFst<Arc> M(DRD);\n        CHECK_EQ(n + 1, M.NumStates());  // Accounts for the epsilon transition\n                                         // to the initial state\n      }\n    }\n  }\n\n  // Tests if two FSAS are equivalent.\n  bool Equiv(const Fst<Arc> &fsa1, const Fst<Arc> &fsa2) {\n    VLOG(1) << \"Check FSAs for sanity (including property bits).\";\n    CHECK(Verify(fsa1));\n    CHECK(Verify(fsa2));\n\n    VectorFst<Arc> vfsa1(fsa1);\n    VectorFst<Arc> vfsa2(fsa2);\n    RmEpsilon(&vfsa1);\n    RmEpsilon(&vfsa2);\n    DeterminizeFst<Arc> dfa1(vfsa1);\n    DeterminizeFst<Arc> dfa2(vfsa2);\n\n    // Test equivalence using union-find algorithm\n    bool equiv1 = Equivalent(dfa1, dfa2);\n\n    // Test equivalence by checking if (S1 - S2) U (S2 - S1) is empty\n    ILabelCompare<Arc> comp;\n    VectorFst<Arc> sdfa1(dfa1);\n    ArcSort(&sdfa1, comp);\n    VectorFst<Arc> sdfa2(dfa2);\n    ArcSort(&sdfa2, comp);\n\n    DifferenceFst<Arc> dfsa1(sdfa1, sdfa2);\n    DifferenceFst<Arc> dfsa2(sdfa2, sdfa1);\n\n    VectorFst<Arc> ufsa(dfsa1);\n    Union(&ufsa, dfsa2);\n    Connect(&ufsa);\n    bool equiv2 = ufsa.NumStates() == 0;\n\n    // Check two equivalence tests match\n    CHECK((equiv1 && equiv2) || (!equiv1 && !equiv2));\n\n    return equiv1;\n  }\n\n  // Tests if FSA1 is a subset of FSA2 (disregarding weights).\n  bool Subset(const Fst<Arc> &fsa1, const Fst<Arc> &fsa2) {\n    VLOG(1) << \"Check FSAs (incl. property bits) for sanity\";\n    CHECK(Verify(fsa1));\n    CHECK(Verify(fsa2));\n\n    VectorFst<StdArc> vfsa1;\n    VectorFst<StdArc> vfsa2;\n    RmEpsilon(&vfsa1);\n    RmEpsilon(&vfsa2);\n    ILabelCompare<StdArc> comp;\n    ArcSort(&vfsa1, comp);\n    ArcSort(&vfsa2, comp);\n    IntersectFst<StdArc> ifsa(vfsa1, vfsa2);\n    DeterminizeFst<StdArc> dfa1(vfsa1);\n    DeterminizeFst<StdArc> dfa2(ifsa);\n    return Equivalent(dfa1, dfa2);\n  }\n\n  // Returns complement Fsa\n  void Complement(const Fst<Arc> &ifsa, MutableFst<Arc> *ofsa) {\n    RmEpsilonFst<Arc> rfsa(ifsa);\n    DeterminizeFst<Arc> dfa(rfsa);\n    DifferenceFst<Arc> cfsa(univ_fsa_, dfa);\n    *ofsa = cfsa;\n  }\n\n  // FSA with no states\n  VectorFst<Arc> zero_fsa_;\n\n  // FSA with one state that accepts epsilon.\n  VectorFst<Arc> one_fsa_;\n\n  // FSA with one state that accepts all strings.\n  VectorFst<Arc> univ_fsa_;\n};\n\n// This class tests a variety of identities and properties that must\n// hold for various FST algorithms. It randomly generates FSTs, using\n// function object 'weight_generator' to select weights. 'WeightTester'\n// and 'UnweightedTester' are then called.\ntemplate <class Arc, class WeightGenerator>\nclass AlgoTester {\n public:\n  typedef typename Arc::Label Label;\n  typedef typename Arc::StateId StateId;\n  typedef typename Arc::Weight Weight;\n\n  AlgoTester(WeightGenerator generator, int seed)\n      : weight_generator_(generator) {\n    one_fst_.AddState();\n    one_fst_.SetStart(0);\n    one_fst_.SetFinal(0, Weight::One());\n\n    univ_fst_.AddState();\n    univ_fst_.SetStart(0);\n    univ_fst_.SetFinal(0, Weight::One());\n    for (int i = 0; i < kNumRandomLabels; ++i)\n      univ_fst_.AddArc(0, Arc(i, i, Weight::One(), 0));\n\n    weighted_tester_ = new WeightedTester<Arc, WeightGenerator>(\n        seed, zero_fst_, one_fst_, univ_fst_, &weight_generator_);\n\n    unweighted_tester_ =\n        new UnweightedTester<Arc>(zero_fst_, one_fst_, univ_fst_);\n  }\n\n  ~AlgoTester() {\n    delete weighted_tester_;\n    delete unweighted_tester_;\n  }\n\n  void MakeRandFst(MutableFst<Arc> *fst) {\n    RandFst<Arc, WeightGenerator>(kNumRandomStates, kNumRandomArcs,\n                                  kNumRandomLabels, kAcyclicProb,\n                                  &weight_generator_, fst);\n  }\n\n  void Test() {\n    VLOG(1) << \"weight type = \" << Weight::Type();\n\n    for (int i = 0; i < FLAGS_repeat; ++i) {\n      // Random transducers\n      VectorFst<Arc> T1;\n      VectorFst<Arc> T2;\n      VectorFst<Arc> T3;\n      MakeRandFst(&T1);\n      MakeRandFst(&T2);\n      MakeRandFst(&T3);\n      weighted_tester_->Test(T1, T2, T3);\n\n      VectorFst<Arc> A1(T1);\n      VectorFst<Arc> A2(T2);\n      VectorFst<Arc> A3(T3);\n      Project(&A1, PROJECT_OUTPUT);\n      Project(&A2, PROJECT_INPUT);\n      Project(&A3, PROJECT_INPUT);\n      ArcMap(&A1, rm_weight_mapper_);\n      ArcMap(&A2, rm_weight_mapper_);\n      ArcMap(&A3, rm_weight_mapper_);\n      unweighted_tester_->Test(A1, A2, A3);\n    }\n  }\n\n private:\n  // Generates weights used in testing.\n  WeightGenerator weight_generator_;\n\n  // FST with no states\n  VectorFst<Arc> zero_fst_;\n\n  // FST with one state that accepts epsilon.\n  VectorFst<Arc> one_fst_;\n\n  // FST with one state that accepts all strings.\n  VectorFst<Arc> univ_fst_;\n\n  // Tests weighted FSTs\n  WeightedTester<Arc, WeightGenerator> *weighted_tester_;\n\n  // Tests unweighted FSTs\n  UnweightedTester<Arc> *unweighted_tester_;\n\n  // Mapper to remove weights from an Fst\n  RmWeightMapper<Arc> rm_weight_mapper_;\n\n  // Maximum number of states in random test Fst.\n  static const int kNumRandomStates;\n\n  // Maximum number of arcs in random test Fst.\n  static const int kNumRandomArcs;\n\n  // Number of alternative random labels.\n  static const int kNumRandomLabels;\n\n  // Probability to force an acyclic Fst\n  static const float kAcyclicProb;\n\n  // Maximum random path length.\n  static const int kRandomPathLength;\n\n  // Number of random paths to explore.\n  static const int kNumRandomPaths;\n\n  AlgoTester(const AlgoTester &) = delete;\n  AlgoTester &operator=(const AlgoTester &) = delete;\n};\n\ntemplate <class A, class G>\nconst int AlgoTester<A, G>::kNumRandomStates = 10;\n\ntemplate <class A, class G>\nconst int AlgoTester<A, G>::kNumRandomArcs = 25;\n\ntemplate <class A, class G>\nconst int AlgoTester<A, G>::kNumRandomLabels = 5;\n\ntemplate <class A, class G>\nconst float AlgoTester<A, G>::kAcyclicProb = .25;\n\ntemplate <class A, class G>\nconst int AlgoTester<A, G>::kRandomPathLength = 25;\n\ntemplate <class A, class G>\nconst int AlgoTester<A, G>::kNumRandomPaths = 100;\n\n}  // namespace fst\n\n#endif  // FST_TEST_ALGO_TEST_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/test/fst_test.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Regression test for FST classes.\n\n#include \"./fst_test.h\"\n\n#include <utility>\n\n#include <fst/flags.h>\n#include <fst/log.h>\n#include <fst/compact-fst.h>\n#include <fst/const-fst.h>\n#include <fst/edit-fst.h>\n#include <fst/matcher-fst.h>\n\nnamespace fst {\nnamespace {\n\n// A user-defined arc type.\nstruct CustomArc {\n  typedef int16 Label;\n  typedef ProductWeight<TropicalWeight, LogWeight> Weight;\n  typedef int64 StateId;\n\n  CustomArc(Label i, Label o, Weight w, StateId s)\n      : ilabel(i), olabel(o), weight(std::move(w)), nextstate(s) {}\n  CustomArc() {}\n\n  static const string &Type() {  // Arc type name\n    static const string *const type = new string(\"my\");\n    return *type;\n  }\n\n  Label ilabel;       // Transition input label\n  Label olabel;       // Transition output label\n  Weight weight;      // Transition weight\n  StateId nextstate;  // Transition destination state\n};\n\n// A user-defined compactor for test FST.\ntemplate <class A>\nclass CustomCompactor {\n public:\n  typedef A Arc;\n  typedef typename A::Label Label;\n  typedef typename A::StateId StateId;\n  typedef typename A::Weight Weight;\n  typedef std::pair<Label, Weight> Element;\n\n  Element Compact(StateId s, const A &arc) const {\n    return std::make_pair(arc.ilabel, arc.weight);\n  }\n\n  Arc Expand(StateId s, const Element &p, uint32 f = kArcValueFlags) const {\n    return p.first == kNoLabel ? Arc(kNoLabel, kNoLabel, p.second, kNoStateId)\n                               : Arc(p.first, 0, p.second, s);\n  }\n\n  ssize_t Size() const { return -1; }\n\n  uint64 Properties() const { return 0ULL; }\n\n  bool Compatible(const Fst<A> &fst) const { return true; }\n\n  static const string &Type() {\n    static const string *const type = new string(\"my\");\n    return *type;\n  }\n\n  bool Write(std::ostream &strm) const { return true; }\n\n  static CustomCompactor *Read(std::istream &strm) {\n    return new CustomCompactor;\n  }\n};\n\nREGISTER_FST(VectorFst, CustomArc);\nREGISTER_FST(ConstFst, CustomArc);\nstatic fst::FstRegisterer<CompactFst<StdArc, CustomCompactor<StdArc>>>\n    CompactFst_StdArc_CustomCompactor_registerer;\nstatic fst::FstRegisterer<CompactFst<CustomArc, CustomCompactor<CustomArc>>>\n    CompactFst_CustomArc_CustomCompactor_registerer;\nstatic fst::FstRegisterer<ConstFst<StdArc, uint16>>\n    ConstFst_StdArc_uint16_registerer;\nstatic fst::FstRegisterer<\n    CompactFst<StdArc, CustomCompactor<StdArc>, uint16>>\n    CompactFst_StdArc_CustomCompactor_uint16_registerer;\n\n}  // namespace\n}  // namespace fst\n\nusing fst::FstTester;\nusing fst::VectorFst;\nusing fst::ConstFst;\nusing fst::MatcherFst;\nusing fst::CompactFst;\nusing fst::Fst;\nusing fst::StdArc;\nusing fst::CustomArc;\nusing fst::CustomCompactor;\nusing fst::StdArcLookAheadFst;\nusing fst::EditFst;\n\nint main(int argc, char **argv) {\n  FLAGS_fst_verify_properties = true;\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(argv[0], &argc, &argv, true);\n\n  // VectorFst<StdArc> tests\n  {\n    FstTester<VectorFst<StdArc>> std_vector_tester;\n    std_vector_tester.TestBase();\n    std_vector_tester.TestExpanded();\n    std_vector_tester.TestAssign();\n    std_vector_tester.TestCopy();\n    std_vector_tester.TestIO();\n    std_vector_tester.TestMutable();\n  }\n\n  // ConstFst<StdArc> tests\n  {\n    FstTester<ConstFst<StdArc>> std_const_tester;\n    std_const_tester.TestBase();\n    std_const_tester.TestExpanded();\n    std_const_tester.TestCopy();\n    std_const_tester.TestIO();\n  }\n\n  // CompactFst<StdArc, CustomCompactor<StdArc>>\n  {\n    FstTester<CompactFst<StdArc, CustomCompactor<StdArc>>> std_compact_tester;\n    std_compact_tester.TestBase();\n    std_compact_tester.TestExpanded();\n    std_compact_tester.TestCopy();\n    std_compact_tester.TestIO();\n  }\n\n  // VectorFst<CustomArc> tests\n  {\n    FstTester<VectorFst<CustomArc>> std_vector_tester;\n    std_vector_tester.TestBase();\n    std_vector_tester.TestExpanded();\n    std_vector_tester.TestAssign();\n    std_vector_tester.TestCopy();\n    std_vector_tester.TestIO();\n    std_vector_tester.TestMutable();\n  }\n\n  // ConstFst<CustomArc> tests\n  {\n    FstTester<ConstFst<CustomArc>> std_const_tester;\n    std_const_tester.TestBase();\n    std_const_tester.TestExpanded();\n    std_const_tester.TestCopy();\n    std_const_tester.TestIO();\n  }\n\n  // CompactFst<CustomArc, CustomCompactor<CustomArc>>\n  {\n    FstTester<CompactFst<CustomArc, CustomCompactor<CustomArc>>>\n        std_compact_tester;\n    std_compact_tester.TestBase();\n    std_compact_tester.TestExpanded();\n    std_compact_tester.TestCopy();\n    std_compact_tester.TestIO();\n  }\n\n  // ConstFst<StdArc, uint16> tests\n  {\n    FstTester<ConstFst<StdArc, uint16>> std_const_tester;\n    std_const_tester.TestBase();\n    std_const_tester.TestExpanded();\n    std_const_tester.TestCopy();\n    std_const_tester.TestIO();\n  }\n\n  // CompactFst<StdArc, CustomCompactor<StdArc>, uint16>\n  {\n    FstTester<CompactFst<StdArc, CustomCompactor<StdArc>, uint16>>\n        std_compact_tester;\n    std_compact_tester.TestBase();\n    std_compact_tester.TestExpanded();\n    std_compact_tester.TestCopy();\n    std_compact_tester.TestIO();\n  }\n\n  // FstTester<StdArcLookAheadFst>\n  {\n    FstTester<StdArcLookAheadFst> std_matcher_tester;\n    std_matcher_tester.TestBase();\n    std_matcher_tester.TestExpanded();\n    std_matcher_tester.TestCopy();\n  }\n\n  // EditFst<StdArc> tests\n  {\n    FstTester<EditFst<StdArc>> std_edit_tester;\n    std_edit_tester.TestBase();\n    std_edit_tester.TestExpanded();\n    std_edit_tester.TestAssign();\n    std_edit_tester.TestCopy();\n    std_edit_tester.TestMutable();\n  }\n\n  std::cout << \"PASS\" << std::endl;\n\n  return 0;\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/test/fst_test.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Regression test for FST classes.\n\n#ifndef FST_TEST_FST_TEST_H_\n#define FST_TEST_FST_TEST_H_\n\n#include <fst/equal.h>\n#include <fstream>\n#include <fst/matcher.h>\n#include <fst/vector-fst.h>\n#include <fst/verify.h>\n\nDECLARE_string(tmpdir);\n\nnamespace fst {\n\n// This tests an Fst F that is assumed to have a copy method from an\n// arbitrary Fst. Some test functions make further assumptions mostly\n// obvious from their name. These tests are written as member temple\n// functions that take a test fst as its argument so that different\n// Fsts in the interface hierarchy can be tested separately and so\n// that we can instantiate only those tests that make sense for a\n// particular Fst.\ntemplate <class F>\nclass FstTester {\n public:\n  typedef typename F::Arc Arc;\n  typedef typename Arc::StateId StateId;\n  typedef typename Arc::Weight Weight;\n  typedef typename Arc::Label Label;\n\n  FstTester() {\n    VectorFst<Arc> vfst;\n    InitFst(&vfst, 128);\n    testfst_ = new F(vfst);\n  }\n\n  explicit FstTester(F *testfst) : testfst_(testfst) {}\n\n  ~FstTester() { delete testfst_; }\n\n  // This verifies the contents described in InitFst() using\n  // methods defined in a generic Fst.\n  template <class G>\n  void TestBase(const G &fst) const {\n    CHECK(Verify(fst));\n    CHECK_EQ(fst.Start(), 0);\n    StateId ns = 0;\n    StateIterator<G> siter(fst);\n    Matcher<G> matcher(fst, MATCH_INPUT);\n    MatchType match_type = matcher.Type(true);\n    for (; !siter.Done(); siter.Next()) {\n    }\n    for (siter.Reset(); !siter.Done(); siter.Next()) {\n      StateId s = siter.Value();\n      matcher.SetState(s);\n      CHECK_EQ(fst.Final(s), NthWeight(s));\n      size_t na = 0;\n      ArcIterator<G> aiter(fst, s);\n      for (; !aiter.Done(); aiter.Next()) {\n      }\n      for (aiter.Reset(); !aiter.Done(); aiter.Next()) {\n        ++na;\n        const Arc &arc = aiter.Value();\n        CHECK_EQ(arc.ilabel, na);\n        CHECK_EQ(arc.olabel, 0);\n        CHECK_EQ(arc.weight, NthWeight(na));\n        CHECK_EQ(arc.nextstate, s);\n        if (match_type == MATCH_INPUT) {\n          CHECK(matcher.Find(arc.ilabel));\n          CHECK_EQ(matcher.Value().ilabel, arc.ilabel);\n        }\n      }\n      CHECK_EQ(na, s);\n      CHECK_EQ(na, aiter.Position());\n      CHECK_EQ(fst.NumArcs(s), s);\n      CHECK_EQ(fst.NumInputEpsilons(s), 0);\n      CHECK_EQ(fst.NumOutputEpsilons(s), s);\n      CHECK(!matcher.Find(s + 1));     // out-of-range\n      CHECK(!matcher.Find(kNoLabel));  // no explicit epsilons\n      CHECK(matcher.Find(0));\n      CHECK_EQ(matcher.Value().ilabel, kNoLabel);  // implicit epsilon loop\n      ++ns;\n    }\n    CHECK(fst.Properties(kNotAcceptor, true));\n    CHECK(fst.Properties(kOEpsilons, true));\n  }\n\n  void TestBase() const { TestBase(*testfst_); }\n\n  // This verifies methods specfic to an ExpandedFst.\n  template <class G>\n  void TestExpanded(const G &fst) const {\n    StateId ns = 0;\n    for (StateIterator<G> siter(fst); !siter.Done(); siter.Next()) {\n      ++ns;\n    }\n    CHECK_EQ(fst.NumStates(), ns);\n    CHECK(fst.Properties(kExpanded, false));\n  }\n\n  void TestExpanded() const { TestExpanded(*testfst_); }\n\n  // This verifies methods specific to a MutableFst.\n  template <class G>\n  void TestMutable(G *fst) const {\n    for (StateIterator<G> siter(*fst); !siter.Done(); siter.Next()) {\n      StateId s = siter.Value();\n      size_t na = 0;\n      size_t ni = fst->NumInputEpsilons(s);\n      MutableArcIterator<G> aiter(fst, s);\n      for (; !aiter.Done(); aiter.Next()) {\n      }\n      for (aiter.Reset(); !aiter.Done(); aiter.Next()) {\n        ++na;\n        Arc arc = aiter.Value();\n        arc.ilabel = 0;\n        aiter.SetValue(arc);\n        arc = aiter.Value();\n        CHECK_EQ(arc.ilabel, 0);\n        CHECK_EQ(fst->NumInputEpsilons(s), ni + 1);\n        arc.ilabel = na;\n        aiter.SetValue(arc);\n        CHECK_EQ(fst->NumInputEpsilons(s), ni);\n      }\n    }\n\n    G *cfst1 = fst->Copy();\n    cfst1->DeleteStates();\n    CHECK_EQ(cfst1->NumStates(), 0);\n    delete cfst1;\n\n    G *cfst2 = fst->Copy();\n    for (StateIterator<G> siter(*cfst2); !siter.Done(); siter.Next()) {\n      StateId s = siter.Value();\n      cfst2->DeleteArcs(s);\n      CHECK_EQ(cfst2->NumArcs(s), 0);\n      CHECK_EQ(cfst2->NumInputEpsilons(s), 0);\n      CHECK_EQ(cfst2->NumOutputEpsilons(s), 0);\n    }\n    delete cfst2;\n  }\n\n  void TestMutable() { TestMutable(testfst_); }\n\n  // This verifies the copy methods.\n  template <class G>\n  void TestAssign(G *fst) const {\n    // Assignment from G\n    G afst1;\n    afst1 = *fst;\n    CHECK(Equal(*fst, afst1));\n\n    // Assignment from Fst\n    G afst2;\n    afst2 = *static_cast<const Fst<Arc> *>(fst);\n    CHECK(Equal(*fst, afst2));\n\n    // Assignment from self\n    afst2.operator=(afst2);\n    CHECK(Equal(*fst, afst2));\n  }\n\n  void TestAssign() { TestAssign(testfst_); }\n\n  // This verifies the copy methods.\n  template <class G>\n  void TestCopy(const G &fst) const {\n    // Copy from G\n    G c1fst(fst);\n    TestBase(c1fst);\n\n    // Copy from Fst\n    const G c2fst(static_cast<const Fst<Arc> &>(fst));\n    TestBase(c2fst);\n\n    // Copy from self\n    const G *c3fst = fst.Copy();\n    TestBase(*c3fst);\n    delete c3fst;\n  }\n\n  void TestCopy() const { TestCopy(*testfst_); }\n\n  // This verifies the read/write methods.\n  template <class G>\n  void TestIO(const G &fst) const {\n    const string filename = FLAGS_tmpdir + \"/test.fst\";\n    const string aligned = FLAGS_tmpdir + \"/aligned.fst\";\n    {\n      // write/read\n      CHECK(fst.Write(filename));\n      G *ffst = G::Read(filename);\n      CHECK(ffst);\n      TestBase(*ffst);\n      delete ffst;\n    }\n\n    {\n      // generic read/cast/test\n      Fst<Arc> *gfst = Fst<Arc>::Read(filename);\n      CHECK(gfst);\n      G *dfst = static_cast<G *>(gfst);\n      TestBase(*dfst);\n\n      // generic write/read/test\n      CHECK(gfst->Write(filename));\n      Fst<Arc> *hfst = Fst<Arc>::Read(filename);\n      CHECK(hfst);\n      TestBase(*hfst);\n      delete gfst;\n      delete hfst;\n    }\n\n    {\n      // check mmaping by first writing the file with the aligned attribute set\n      {\n        std::ofstream ostr(aligned);\n        FstWriteOptions opts;\n        opts.source = aligned;\n        opts.align = true;\n        CHECK(fst.Write(ostr, opts));\n      }\n      std::ifstream istr(aligned);\n      FstReadOptions opts;\n      opts.mode = FstReadOptions::ReadMode(\"map\");\n      opts.source = aligned;\n      G *gfst = G::Read(istr, opts);\n      CHECK(gfst);\n      TestBase(*gfst);\n      delete gfst;\n    }\n\n    // check mmaping of unaligned files to make sure it does not fail.\n    {\n      {\n        std::ofstream ostr(aligned);\n        FstWriteOptions opts;\n        opts.source = aligned;\n        opts.align = false;\n        CHECK(fst.Write(ostr, opts));\n      }\n      std::ifstream istr(aligned);\n      FstReadOptions opts;\n      opts.mode = FstReadOptions::ReadMode(\"map\");\n      opts.source = aligned;\n      G *gfst = G::Read(istr, opts);\n      CHECK(gfst);\n      TestBase(*gfst);\n      delete gfst;\n    }\n\n    // expanded write/read/test\n    if (fst.Properties(kExpanded, false)) {\n      ExpandedFst<Arc> *efst = ExpandedFst<Arc>::Read(filename);\n      CHECK(efst);\n      TestBase(*efst);\n      TestExpanded(*efst);\n      delete efst;\n    }\n\n    // mutable write/read/test\n    if (fst.Properties(kMutable, false)) {\n      MutableFst<Arc> *mfst = MutableFst<Arc>::Read(filename);\n      CHECK(mfst);\n      TestBase(*mfst);\n      TestExpanded(*mfst);\n      TestMutable(mfst);\n      delete mfst;\n    }\n  }\n\n  void TestIO() const { TestIO(*testfst_); }\n\n private:\n  // This constructs test FSTs. Given a mutable FST, will leave\n  // the FST as follows:\n  // (I) NumStates() = nstates\n  // (II) Start() = 0\n  // (III) Final(s) =  NthWeight(s)\n  // (IV) For state s:\n  //     (a) NumArcs(s) == s\n  //     (b) For ith arc of s:\n  //         (1) ilabel = i\n  //         (2) olabel = 0\n  //         (3) weight = NthWeight(i)\n  //         (4) nextstate = s\n  void InitFst(MutableFst<Arc> *fst, size_t nstates) const {\n    fst->DeleteStates();\n    CHECK_GT(nstates, 0);\n\n    for (StateId s = 0; s < nstates; ++s) {\n      fst->AddState();\n      fst->SetFinal(s, NthWeight(s));\n      for (size_t i = 1; i <= s; ++i) {\n        Arc arc(i, 0, NthWeight(i), s);\n        fst->AddArc(s, arc);\n      }\n    }\n\n    fst->SetStart(0);\n  }\n\n  // Generates One() + ... + One() (n times)\n  Weight NthWeight(int n) const {\n    Weight w = Weight::Zero();\n    for (int i = 0; i < n; ++i) w = Plus(w, Weight::One());\n    return w;\n  }\n\n  F *testfst_;  // what we're testing\n};\n\n}  // namespace fst\n\n#endif  // FST_TEST_FST_TEST_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/test/rand-fst.h",
    "content": "#ifndef FST_TEST_RAND_FST_H_\n#define FST_TEST_RAND_FST_H_\n\n#include <fst/log.h>\n#include <fst/mutable-fst.h>\n#include <fst/verify.h>\n\nnamespace fst {\n\n// Generates a random FST.\ntemplate <class Arc, class WeightGenerator>\nvoid RandFst(const int num_random_states, const int num_random_arcs,\n             const int num_random_labels, const float acyclic_prob,\n             WeightGenerator *weight_generator, MutableFst<Arc> *fst) {\n  typedef typename Arc::Label Label;\n  typedef typename Arc::StateId StateId;\n  typedef typename Arc::Weight Weight;\n\n  // Determines direction of the arcs wrt state numbering. This way we\n  // can force acyclicity when desired.\n  enum ArcDirection {\n    ANY_DIRECTION = 0,\n    FORWARD_DIRECTION = 1,\n    REVERSE_DIRECTION = 2,\n    NUM_DIRECTIONS = 3\n  };\n\n  ArcDirection arc_direction = ANY_DIRECTION;\n  if (rand() / (RAND_MAX + 1.0) < acyclic_prob)\n    arc_direction = rand() % 2 ? FORWARD_DIRECTION : REVERSE_DIRECTION;\n\n  fst->DeleteStates();\n  StateId ns = rand() % num_random_states;\n\n  if (ns == 0) return;\n  for (StateId s = 0; s < ns; ++s) fst->AddState();\n\n  StateId start = rand() % ns;\n  fst->SetStart(start);\n\n  size_t na = rand() % num_random_arcs;\n  for (size_t n = 0; n < na; ++n) {\n    StateId s = rand() % ns;\n    Arc arc;\n    arc.ilabel = rand() % num_random_labels;\n    arc.olabel = rand() % num_random_labels;\n    arc.weight = (*weight_generator)();\n    arc.nextstate = rand() % ns;\n\n    if ((arc_direction == FORWARD_DIRECTION ||\n         arc_direction == REVERSE_DIRECTION) &&\n        s == arc.nextstate) {\n      continue;  // skips self-loops\n    }\n\n    if ((arc_direction == FORWARD_DIRECTION && s > arc.nextstate) ||\n        (arc_direction == REVERSE_DIRECTION && s < arc.nextstate)) {\n      StateId t = s;  // reverses arcs\n      s = arc.nextstate;\n      arc.nextstate = t;\n    }\n\n    fst->AddArc(s, arc);\n  }\n\n  StateId nf = rand() % (ns + 1);\n  for (StateId n = 0; n < nf; ++n) {\n    StateId s = rand() % ns;\n    Weight final = (*weight_generator)();\n    fst->SetFinal(s, final);\n  }\n  VLOG(1) << \"Check FST for sanity (including property bits).\";\n  CHECK(Verify(*fst));\n\n  // Get/compute all properties.\n  uint64 props = fst->Properties(kFstProperties, true);\n\n  // Select random set of properties to be unknown.\n  uint64 mask = 0;\n  for (int n = 0; n < 8; ++n) {\n    mask |= rand() & 0xff;\n    mask <<= 8;\n  }\n  mask &= ~kTrinaryProperties;\n  fst->SetProperties(props & ~mask, mask);\n}\n\n}  // namespace fst\n\n#endif  // FST_TEST_RAND_FST_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/test/weight-tester.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Utility class for regression testing of FST weights.\n\n#ifndef FST_TEST_WEIGHT_TESTER_H_\n#define FST_TEST_WEIGHT_TESTER_H_\n\n#include <iostream>\n#include <sstream>\n\n#include <utility>\n\n#include <fst/log.h>\n#include <fst/weight.h>\n\nnamespace fst {\n\n// This class tests a variety of identities and properties that must\n// hold for the Weight class to be well-defined. It calls function object\n// WEIGHT_GENERATOR to select weights that are used in the tests.\ntemplate <class Weight, class WeightGenerator>\nclass WeightTester {\n public:\n  WeightTester(WeightGenerator generator)\n      : weight_generator_(std::move(generator)) {}\n\n  void Test(int iterations, bool test_division = true) {\n    for (int i = 0; i < iterations; ++i) {\n      // Selects the test weights.\n      const Weight w1(weight_generator_());\n      const Weight w2(weight_generator_());\n      const Weight w3(weight_generator_());\n\n      VLOG(1) << \"weight type = \" << Weight::Type();\n      VLOG(1) << \"w1 = \" << w1;\n      VLOG(1) << \"w2 = \" << w2;\n      VLOG(1) << \"w3 = \" << w3;\n\n      TestSemiring(w1, w2, w3);\n      if (test_division) TestDivision(w1, w2);\n      TestReverse(w1, w2);\n      TestEquality(w1, w2, w3);\n      TestIO(w1);\n      TestCopy(w1);\n    }\n  }\n\n private:\n  // Note in the tests below we use ApproxEqual rather than == and add\n  // kDelta to inequalities where the weights might be inexact.\n\n  // Tests (Plus, Times, Zero, One) defines a commutative semiring.\n  void TestSemiring(Weight w1, Weight w2, Weight w3) {\n    // Checks that the operations are closed.\n    CHECK(Plus(w1, w2).Member());\n    CHECK(Times(w1, w2).Member());\n\n    // Checks that the operations are associative.\n    CHECK(ApproxEqual(Plus(w1, Plus(w2, w3)), Plus(Plus(w1, w2), w3)));\n    CHECK(ApproxEqual(Times(w1, Times(w2, w3)), Times(Times(w1, w2), w3)));\n\n    // Checks the identity elements.\n    CHECK(Plus(w1, Weight::Zero()) == w1);\n    CHECK(Plus(Weight::Zero(), w1) == w1);\n    CHECK(Times(w1, Weight::One()) == w1);\n    CHECK(Times(Weight::One(), w1) == w1);\n\n    // Check the no weight element.\n    CHECK(!Weight::NoWeight().Member());\n    CHECK(!Plus(w1, Weight::NoWeight()).Member());\n    CHECK(!Plus(Weight::NoWeight(), w1).Member());\n    CHECK(!Times(w1, Weight::NoWeight()).Member());\n    CHECK(!Times(Weight::NoWeight(), w1).Member());\n\n    // Checks that the operations commute.\n    CHECK(ApproxEqual(Plus(w1, w2), Plus(w2, w1)));\n\n    if (Weight::Properties() & kCommutative)\n      CHECK(ApproxEqual(Times(w1, w2), Times(w2, w1)));\n\n    // Checks Zero() is the annihilator.\n    CHECK(Times(w1, Weight::Zero()) == Weight::Zero());\n    CHECK(Times(Weight::Zero(), w1) == Weight::Zero());\n\n    // Check Power(w, 0) is Weight::One()\n    CHECK(Power(w1, 0) == Weight::One());\n\n    // Check Power(w, 1) is w\n    CHECK(Power(w1, 1) == w1);\n\n    // Check Power(w, 3) is Times(w, Times(w, w))\n    CHECK(Power(w1, 3) == Times(w1, Times(w1, w1)));\n\n    // Checks distributivity.\n    if (Weight::Properties() & kLeftSemiring) {\n      CHECK(ApproxEqual(Times(w1, Plus(w2, w3)),\n                        Plus(Times(w1, w2), Times(w1, w3))));\n    }\n    if (Weight::Properties() & kRightSemiring)\n      CHECK(ApproxEqual(Times(Plus(w1, w2), w3),\n                        Plus(Times(w1, w3), Times(w2, w3))));\n\n    if (Weight::Properties() & kIdempotent) CHECK(Plus(w1, w1) == w1);\n\n    if (Weight::Properties() & kPath)\n      CHECK(Plus(w1, w2) == w1 || Plus(w1, w2) == w2);\n\n    // Ensure weights form a left or right semiring.\n    CHECK(Weight::Properties() & (kLeftSemiring | kRightSemiring));\n\n    // Check when Times() is commutative that it is marked as a semiring.\n    if (Weight::Properties() & kCommutative)\n      CHECK(Weight::Properties() & kSemiring);\n  }\n\n  // Tests division operation.\n  void TestDivision(Weight w1, Weight w2) {\n    Weight p = Times(w1, w2);\n\n    if (Weight::Properties() & kLeftSemiring) {\n      Weight d = Divide(p, w1, DIVIDE_LEFT);\n      if (d.Member()) CHECK(ApproxEqual(p, Times(w1, d)));\n      CHECK(!Divide(w1, Weight::NoWeight(), DIVIDE_LEFT).Member());\n      CHECK(!Divide(Weight::NoWeight(), w1, DIVIDE_LEFT).Member());\n    }\n\n    if (Weight::Properties() & kRightSemiring) {\n      Weight d = Divide(p, w2, DIVIDE_RIGHT);\n      if (d.Member()) CHECK(ApproxEqual(p, Times(d, w2)));\n      CHECK(!Divide(w1, Weight::NoWeight(), DIVIDE_RIGHT).Member());\n      CHECK(!Divide(Weight::NoWeight(), w1, DIVIDE_RIGHT).Member());\n    }\n\n    if (Weight::Properties() & kCommutative) {\n      Weight d = Divide(p, w1, DIVIDE_RIGHT);\n      if (d.Member()) CHECK(ApproxEqual(p, Times(d, w1)));\n    }\n  }\n\n  // Tests reverse operation.\n  void TestReverse(Weight w1, Weight w2) {\n    typedef typename Weight::ReverseWeight ReverseWeight;\n\n    ReverseWeight rw1 = w1.Reverse();\n    ReverseWeight rw2 = w2.Reverse();\n\n    CHECK(rw1.Reverse() == w1);\n    CHECK(Plus(w1, w2).Reverse() == Plus(rw1, rw2));\n    CHECK(Times(w1, w2).Reverse() == Times(rw2, rw1));\n  }\n\n  // Tests == is an equivalence relation.\n  void TestEquality(Weight w1, Weight w2, Weight w3) {\n    // Checks reflexivity.\n    CHECK(w1 == w1);\n\n    // Checks symmetry.\n    CHECK((w1 == w2) == (w2 == w1));\n\n    // Checks transitivity.\n    if (w1 == w2 && w2 == w3) CHECK(w1 == w3);\n  }\n\n  // Tests binary serialization and textual I/O.\n  void TestIO(Weight w) {\n    // Tests binary I/O\n    {\n      std::ostringstream os;\n      w.Write(os);\n      os.flush();\n      std::istringstream is(os.str());\n      Weight v;\n      v.Read(is);\n      CHECK_EQ(w, v);\n    }\n\n    // Tests textual I/O.\n    {\n      std::ostringstream os;\n      os << w;\n      std::istringstream is(os.str());\n      Weight v(Weight::One());\n      is >> v;\n      CHECK(ApproxEqual(w, v));\n    }\n  }\n\n  // Tests copy constructor and assignment operator\n  void TestCopy(Weight w) {\n    Weight x = w;\n    CHECK(w == x);\n\n    x = Weight(w);\n    CHECK(w == x);\n\n    x.operator=(x);\n    CHECK(w == x);\n  }\n\n  // Generates weights used in testing.\n  WeightGenerator weight_generator_;\n};\n\n}  // namespace fst\n\n#endif  // FST_TEST_WEIGHT_TESTER_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/src/test/weight_test.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Regression test for FST weights.\n\n#include <cstdlib>\n#include <ctime>\n\n#include <fst/flags.h>\n#include <fst/log.h>\n#include <fst/expectation-weight.h>\n#include <fst/float-weight.h>\n#include <fst/lexicographic-weight.h>\n#include <fst/power-weight.h>\n#include <fst/product-weight.h>\n#include <fst/set-weight.h>\n#include <fst/signed-log-weight.h>\n#include <fst/sparse-power-weight.h>\n#include <fst/string-weight.h>\n#include <fst/union-weight.h>\n#include \"./weight-tester.h\"\n\nDEFINE_int32(seed, -1, \"random seed\");\nDEFINE_int32(repeat, 10000, \"number of test repetitions\");\n\nnamespace {\n\nusing fst::Adder;\nusing fst::ExpectationWeight;\nusing fst::GALLIC;\nusing fst::GallicWeight;\nusing fst::LexicographicWeight;\nusing fst::LogWeight;\nusing fst::LogWeightTpl;\nusing fst::MinMaxWeight;\nusing fst::MinMaxWeightTpl;\nusing fst::NaturalLess;\nusing fst::PowerWeight;\nusing fst::ProductWeight;\nusing fst::SetWeight;\nusing fst::SET_INTERSECT_UNION;\nusing fst::SET_UNION_INTERSECT;\nusing fst::SET_BOOLEAN;\nusing fst::SignedLogWeight;\nusing fst::SignedLogWeightTpl;\nusing fst::SparsePowerWeight;\nusing fst::StringWeight;\nusing fst::STRING_LEFT;\nusing fst::STRING_RIGHT;\nusing fst::TropicalWeight;\nusing fst::TropicalWeightTpl;\nusing fst::UnionWeight;\nusing fst::WeightConvert;\nusing fst::WeightGenerate;\nusing fst::WeightTester;\n\ntemplate <class T>\nvoid TestTemplatedWeights(int repeat) {\n  using TropicalWeightGenerate = WeightGenerate<TropicalWeightTpl<T>>;\n  TropicalWeightGenerate tropical_generate;\n  WeightTester<TropicalWeightTpl<T>, TropicalWeightGenerate> tropical_tester(\n      tropical_generate);\n  tropical_tester.Test(repeat);\n\n  using LogWeightGenerate = WeightGenerate<LogWeightTpl<T>>;\n  LogWeightGenerate log_generate;\n  WeightTester<LogWeightTpl<T>, LogWeightGenerate> log_tester(log_generate);\n  log_tester.Test(repeat);\n\n  using MinMaxWeightGenerate = WeightGenerate<MinMaxWeightTpl<T>>;\n  MinMaxWeightGenerate minmax_generate(true);\n  WeightTester<MinMaxWeightTpl<T>, MinMaxWeightGenerate> minmax_tester(\n      minmax_generate);\n  minmax_tester.Test(repeat);\n\n  using SignedLogWeightGenerate = WeightGenerate<SignedLogWeightTpl<T>>;\n  SignedLogWeightGenerate signedlog_generate;\n  WeightTester<SignedLogWeightTpl<T>, SignedLogWeightGenerate>\n      signedlog_tester(signedlog_generate);\n  signedlog_tester.Test(repeat);\n}\n\ntemplate <class Weight>\nvoid TestAdder(int n) {\n  Weight sum = Weight::Zero();\n  Adder<Weight> adder;\n  for (int i = 0; i < n; ++i) {\n    sum = Plus(sum, Weight::One());\n    adder.Add(Weight::One());\n  }\n  CHECK(ApproxEqual(sum, adder.Sum()));\n}\n\ntemplate <class Weight>\nvoid TestSignedAdder(int n) {\n  Weight sum = Weight::Zero();\n  Adder<Weight> adder;\n  const Weight minus_one = Minus(Weight::Zero(), Weight::One());\n  for (int i = 0; i < n; ++i) {\n    if (i < n/4 || i > 3*n/4) {\n      sum = Plus(sum, Weight::One());\n      adder.Add(Weight::One());\n    } else {\n      sum = Minus(sum, Weight::One());\n      adder.Add(minus_one);\n    }\n  }\n  CHECK(ApproxEqual(sum, adder.Sum()));\n}\n\ntemplate <typename Weight1, typename Weight2>\nvoid TestWeightConversion(Weight1 w1) {\n  // Tests round-trp conversion.\n  WeightConvert<Weight2, Weight1> to_w1_;\n  WeightConvert<Weight1, Weight2> to_w2_;\n  Weight2 w2 = to_w2_(w1);\n  Weight1 nw1 = to_w1_(w2);\n  CHECK_EQ(w1, nw1);\n}\n\ntemplate <typename FromWeight, typename ToWeight>\nvoid TestWeightCopy(FromWeight w) {\n  // Test copy constructor.\n  const ToWeight to_copied(w);\n  const FromWeight roundtrip_copied(to_copied);\n  CHECK_EQ(w, roundtrip_copied);\n\n  // Test copy assign.\n  ToWeight to_copy_assigned;\n  to_copy_assigned = w;\n  CHECK_EQ(to_copied, to_copy_assigned);\n\n  FromWeight roundtrip_copy_assigned;\n  roundtrip_copy_assigned = to_copy_assigned;\n  CHECK_EQ(w, roundtrip_copy_assigned);\n}\n\ntemplate <typename FromWeight, typename ToWeight>\nvoid TestWeightMove(FromWeight w) {\n  // Assume FromWeight -> FromWeight copy works.\n  const FromWeight orig(w);\n  ToWeight to_moved(std::move(w));\n  const FromWeight roundtrip_moved(std::move(to_moved));\n  CHECK_EQ(orig, roundtrip_moved);\n\n  // Test move assign.\n  w = orig;\n  ToWeight to_move_assigned;\n  to_move_assigned = std::move(w);\n  FromWeight roundtrip_move_assigned;\n  roundtrip_move_assigned = std::move(to_move_assigned);\n  CHECK_EQ(orig, roundtrip_move_assigned);\n}\n\ntemplate <class Weight>\nvoid TestImplicitConversion() {\n  // Only test a few of the operations; assumes they are implemented with the\n  // same pattern.\n  CHECK(Weight(2.0f) == 2.0f);\n  CHECK(Weight(2.0) == 2.0);\n  CHECK(2.0f == Weight(2.0f));\n  CHECK(2.0 == Weight(2.0));\n\n  CHECK_EQ(Weight::Zero(), Times(Weight::Zero(), 3.0f));\n  CHECK_EQ(Weight::Zero(), Times(Weight::Zero(), 3.0));\n  CHECK_EQ(Weight::Zero(), Times(3.0, Weight::Zero()));\n\n  CHECK_EQ(Weight(3.0), Plus(Weight::Zero(), 3.0f));\n  CHECK_EQ(Weight(3.0), Plus(Weight::Zero(), 3.0));\n  CHECK_EQ(Weight(3.0), Plus(3.0, Weight::Zero()));\n}\n\nvoid TestPowerWeightGetSetValue() {\n  PowerWeight<LogWeight, 3> w;\n  // LogWeight has unspecified initial value, so don't check it.\n  w.SetValue(0, LogWeight(2));\n  w.SetValue(1, LogWeight(3));\n  CHECK_EQ(LogWeight(2), w.Value(0));\n  CHECK_EQ(LogWeight(3), w.Value(1));\n}\n\nvoid TestSparsePowerWeightGetSetValue() {\n  const LogWeight default_value(17);\n  SparsePowerWeight<LogWeight> w;\n  w.SetDefaultValue(default_value);\n\n  // All gets should be the default.\n  CHECK_EQ(default_value, w.Value(0));\n  CHECK_EQ(default_value, w.Value(100));\n\n  // First set should fill first_.\n  w.SetValue(10, LogWeight(10));\n  CHECK_EQ(LogWeight(10), w.Value(10));\n  w.SetValue(10, LogWeight(20));\n  CHECK_EQ(LogWeight(20), w.Value(10));\n\n  // Add a smaller index.\n  w.SetValue(5, LogWeight(5));\n  CHECK_EQ(LogWeight(5), w.Value(5));\n  CHECK_EQ(LogWeight(20), w.Value(10));\n\n  // Add some larger indices.\n  w.SetValue(30, LogWeight(30));\n  CHECK_EQ(LogWeight(5), w.Value(5));\n  CHECK_EQ(LogWeight(20), w.Value(10));\n  CHECK_EQ(LogWeight(30), w.Value(30));\n\n  w.SetValue(29, LogWeight(29));\n  CHECK_EQ(LogWeight(5), w.Value(5));\n  CHECK_EQ(LogWeight(20), w.Value(10));\n  CHECK_EQ(LogWeight(29), w.Value(29));\n  CHECK_EQ(LogWeight(30), w.Value(30));\n\n  w.SetValue(31, LogWeight(31));\n  CHECK_EQ(LogWeight(5), w.Value(5));\n  CHECK_EQ(LogWeight(20), w.Value(10));\n  CHECK_EQ(LogWeight(29), w.Value(29));\n  CHECK_EQ(LogWeight(30), w.Value(30));\n  CHECK_EQ(LogWeight(31), w.Value(31));\n\n  // Replace a value.\n  w.SetValue(30, LogWeight(60));\n  CHECK_EQ(LogWeight(60), w.Value(30));\n\n  // Replace a value with the default.\n  CHECK_EQ(5, w.Size());\n  w.SetValue(30, default_value);\n  CHECK_EQ(default_value, w.Value(30));\n  CHECK_EQ(4, w.Size());\n\n  // Replace lowest index by the default value.\n  w.SetValue(5, default_value);\n  CHECK_EQ(default_value, w.Value(5));\n  CHECK_EQ(3, w.Size());\n\n  // Clear out everything.\n  w.SetValue(31, default_value);\n  w.SetValue(29, default_value);\n  w.SetValue(10, default_value);\n  CHECK_EQ(0, w.Size());\n\n  CHECK_EQ(default_value, w.Value(5));\n  CHECK_EQ(default_value, w.Value(10));\n  CHECK_EQ(default_value, w.Value(29));\n  CHECK_EQ(default_value, w.Value(30));\n  CHECK_EQ(default_value, w.Value(31));\n}\n\n}  // namespace\n\nint main(int argc, char **argv) {\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(argv[0], &argc, &argv, true);\n\n  LOG(INFO) << \"Seed = \" << FLAGS_seed;\n  srand(FLAGS_seed);\n\n  TestTemplatedWeights<float>(FLAGS_repeat);\n  TestTemplatedWeights<double>(FLAGS_repeat);\n  FLAGS_fst_weight_parentheses = \"()\";\n  TestTemplatedWeights<float>(FLAGS_repeat);\n  TestTemplatedWeights<double>(FLAGS_repeat);\n  FLAGS_fst_weight_parentheses = \"\";\n\n  // Makes sure type names for templated weights are consistent.\n  CHECK(TropicalWeight::Type() == \"tropical\");\n  CHECK(TropicalWeightTpl<double>::Type() != TropicalWeightTpl<float>::Type());\n  CHECK(LogWeight::Type() == \"log\");\n  CHECK(LogWeightTpl<double>::Type() != LogWeightTpl<float>::Type());\n  TropicalWeightTpl<double> w(2.0);\n  TropicalWeight tw(2.0);\n\n  TestAdder<TropicalWeight>(1000);\n  TestAdder<LogWeight>(1000);\n  TestSignedAdder<SignedLogWeight>(1000);\n\n  TestImplicitConversion<LogWeight>();\n  TestImplicitConversion<TropicalWeight>();\n  TestImplicitConversion<MinMaxWeight>();\n\n  TestWeightConversion<TropicalWeight, LogWeight>(2.0);\n\n  using LeftStringWeight = StringWeight<int>;\n  using LeftStringWeightGenerate = WeightGenerate<LeftStringWeight>;\n  LeftStringWeightGenerate left_string_generate;\n  WeightTester<LeftStringWeight, LeftStringWeightGenerate> left_string_tester(\n      left_string_generate);\n  left_string_tester.Test(FLAGS_repeat);\n\n  using RightStringWeight = StringWeight<int, STRING_RIGHT>;\n  using RightStringWeightGenerate = WeightGenerate<RightStringWeight>;\n  RightStringWeightGenerate right_string_generate;\n  WeightTester<RightStringWeight, RightStringWeightGenerate>\n      right_string_tester(right_string_generate);\n  right_string_tester.Test(FLAGS_repeat);\n\n  // STRING_RESTRICT not tested since it requires equal strings,\n  // so would fail.\n\n  using IUSetWeight = SetWeight<int, SET_INTERSECT_UNION>;\n  using IUSetWeightGenerate = WeightGenerate<IUSetWeight>;\n  IUSetWeightGenerate iu_set_generate;\n  WeightTester<IUSetWeight, IUSetWeightGenerate>\n      iu_set_tester(iu_set_generate);\n  iu_set_tester.Test(FLAGS_repeat);\n\n  using UISetWeight = SetWeight<int, SET_UNION_INTERSECT>;\n  using UISetWeightGenerate = WeightGenerate<UISetWeight>;\n  UISetWeightGenerate ui_set_generate;\n  WeightTester<UISetWeight, UISetWeightGenerate>\n      ui_set_tester(ui_set_generate);\n  ui_set_tester.Test(FLAGS_repeat);\n\n  // SET_INTERSECT_UNION_RESTRICT not tested since it requires equal sets,\n  // so would fail.\n\n  using BoolSetWeight = SetWeight<int, SET_BOOLEAN>;\n  using BoolSetWeightGenerate = WeightGenerate<BoolSetWeight>;\n  BoolSetWeightGenerate bool_set_generate;\n  WeightTester<BoolSetWeight, BoolSetWeightGenerate>\n      bool_set_tester(bool_set_generate);\n  bool_set_tester.Test(FLAGS_repeat);\n\n  TestWeightConversion<IUSetWeight, UISetWeight>(iu_set_generate());\n\n  TestWeightCopy<IUSetWeight, UISetWeight>(iu_set_generate());\n  TestWeightCopy<IUSetWeight, BoolSetWeight>(iu_set_generate());\n  TestWeightCopy<UISetWeight, IUSetWeight>(ui_set_generate());\n  TestWeightCopy<UISetWeight, BoolSetWeight>(ui_set_generate());\n  TestWeightCopy<BoolSetWeight, IUSetWeight>(bool_set_generate());\n  TestWeightCopy<BoolSetWeight, UISetWeight>(bool_set_generate());\n\n  TestWeightMove<IUSetWeight, UISetWeight>(iu_set_generate());\n  TestWeightMove<IUSetWeight, BoolSetWeight>(iu_set_generate());\n  TestWeightMove<UISetWeight, IUSetWeight>(ui_set_generate());\n  TestWeightMove<UISetWeight, BoolSetWeight>(ui_set_generate());\n  TestWeightMove<BoolSetWeight, IUSetWeight>(bool_set_generate());\n  TestWeightMove<BoolSetWeight, UISetWeight>(bool_set_generate());\n\n  // COMPOSITE WEIGHTS AND TESTERS - DEFINITIONS\n\n  using TropicalGallicWeight = GallicWeight<int, TropicalWeight>;\n  using TropicalGallicWeightGenerate = WeightGenerate<TropicalGallicWeight>;\n  TropicalGallicWeightGenerate tropical_gallic_generate(true);\n  WeightTester<TropicalGallicWeight, TropicalGallicWeightGenerate>\n      tropical_gallic_tester(tropical_gallic_generate);\n\n  using TropicalGenGallicWeight = GallicWeight<int, TropicalWeight, GALLIC>;\n  using TropicalGenGallicWeightGenerate =\n      WeightGenerate<TropicalGenGallicWeight>;\n  TropicalGenGallicWeightGenerate tropical_gen_gallic_generate(false);\n  WeightTester<TropicalGenGallicWeight, TropicalGenGallicWeightGenerate>\n      tropical_gen_gallic_tester(tropical_gen_gallic_generate);\n\n  using TropicalProductWeight = ProductWeight<TropicalWeight, TropicalWeight>;\n  using TropicalProductWeightGenerate = WeightGenerate<TropicalProductWeight>;\n  TropicalProductWeightGenerate tropical_product_generate;\n  WeightTester<TropicalProductWeight, TropicalProductWeightGenerate>\n      tropical_product_tester(tropical_product_generate);\n\n  using TropicalLexicographicWeight =\n      LexicographicWeight<TropicalWeight, TropicalWeight>;\n  using TropicalLexicographicWeightGenerate =\n      WeightGenerate<TropicalLexicographicWeight>;\n  TropicalLexicographicWeightGenerate tropical_lexicographic_generate;\n  WeightTester<TropicalLexicographicWeight,\n               TropicalLexicographicWeightGenerate>\n      tropical_lexicographic_tester(tropical_lexicographic_generate);\n\n  using TropicalCubeWeight = PowerWeight<TropicalWeight, 3>;\n  using TropicalCubeWeightGenerate = WeightGenerate<TropicalCubeWeight>;\n  TropicalCubeWeightGenerate tropical_cube_generate;\n  WeightTester<TropicalCubeWeight, TropicalCubeWeightGenerate>\n      tropical_cube_tester(tropical_cube_generate);\n\n  using FirstNestedProductWeight =\n      ProductWeight<TropicalProductWeight, TropicalWeight>;\n  using FirstNestedProductWeightGenerate =\n      WeightGenerate<FirstNestedProductWeight>;\n  FirstNestedProductWeightGenerate first_nested_product_generate;\n  WeightTester<FirstNestedProductWeight, FirstNestedProductWeightGenerate>\n      first_nested_product_tester(first_nested_product_generate);\n\n  using SecondNestedProductWeight =\n      ProductWeight<TropicalWeight, TropicalProductWeight>;\n  using SecondNestedProductWeightGenerate =\n      WeightGenerate<SecondNestedProductWeight>;\n  SecondNestedProductWeightGenerate second_nested_product_generate;\n  WeightTester<SecondNestedProductWeight, SecondNestedProductWeightGenerate>\n      second_nested_product_tester(second_nested_product_generate);\n\n  using NestedProductCubeWeight = PowerWeight<FirstNestedProductWeight, 3>;\n  using NestedProductCubeWeightGenerate =\n      WeightGenerate<NestedProductCubeWeight>;\n  NestedProductCubeWeightGenerate nested_product_cube_generate;\n  WeightTester<NestedProductCubeWeight, NestedProductCubeWeightGenerate>\n      nested_product_cube_tester(nested_product_cube_generate);\n\n  using SparseNestedProductCubeWeight =\n      SparsePowerWeight<NestedProductCubeWeight, size_t>;\n  using SparseNestedProductCubeWeightGenerate =\n      WeightGenerate<SparseNestedProductCubeWeight>;\n  SparseNestedProductCubeWeightGenerate sparse_nested_product_cube_generate;\n  WeightTester<SparseNestedProductCubeWeight,\n               SparseNestedProductCubeWeightGenerate>\n      sparse_nested_product_cube_tester(sparse_nested_product_cube_generate);\n\n  using LogSparsePowerWeight = SparsePowerWeight<LogWeight, size_t>;\n  using LogSparsePowerWeightGenerate = WeightGenerate<LogSparsePowerWeight>;\n  LogSparsePowerWeightGenerate log_sparse_power_generate;\n  WeightTester<LogSparsePowerWeight, LogSparsePowerWeightGenerate>\n      log_sparse_power_tester(log_sparse_power_generate);\n\n  using LogLogExpectationWeight = ExpectationWeight<LogWeight, LogWeight>;\n  using LogLogExpectationWeightGenerate =\n      WeightGenerate<LogLogExpectationWeight>;\n  LogLogExpectationWeightGenerate log_log_expectation_generate;\n  WeightTester<LogLogExpectationWeight, LogLogExpectationWeightGenerate>\n      log_log_expectation_tester(log_log_expectation_generate);\n\n  using LogLogSparseExpectationWeight =\n      ExpectationWeight<LogWeight, LogSparsePowerWeight>;\n  using LogLogSparseExpectationWeightGenerate =\n      WeightGenerate<LogLogSparseExpectationWeight>;\n  LogLogSparseExpectationWeightGenerate log_log_sparse_expectation_generate;\n  WeightTester<LogLogSparseExpectationWeight,\n               LogLogSparseExpectationWeightGenerate>\n      log_log_sparse_expectation_tester(log_log_sparse_expectation_generate);\n\n  struct UnionWeightOptions {\n    using Compare = NaturalLess<TropicalWeight>;\n\n    struct Merge {\n      TropicalWeight operator()(const TropicalWeight &w1,\n                                const TropicalWeight &w2) const {\n        return w1;\n      }\n    };\n\n    using ReverseOptions = UnionWeightOptions;\n  };\n\n  using TropicalUnionWeight = UnionWeight<TropicalWeight, UnionWeightOptions>;\n  using TropicalUnionWeightGenerate = WeightGenerate<TropicalUnionWeight>;\n  TropicalUnionWeightGenerate tropical_union_generate;\n  WeightTester<TropicalUnionWeight, TropicalUnionWeightGenerate>\n      tropical_union_tester(tropical_union_generate);\n\n  // COMPOSITE WEIGHTS AND TESTERS - TESTING\n\n  // Tests composite weight I/O with parentheses.\n  FLAGS_fst_weight_parentheses = \"()\";\n\n  // Unnested composite.\n  tropical_gallic_tester.Test(FLAGS_repeat);\n  tropical_gen_gallic_tester.Test(FLAGS_repeat);\n  tropical_product_tester.Test(FLAGS_repeat);\n  tropical_lexicographic_tester.Test(FLAGS_repeat);\n  tropical_cube_tester.Test(FLAGS_repeat);\n  log_sparse_power_tester.Test(FLAGS_repeat);\n  log_log_expectation_tester.Test(FLAGS_repeat, false);\n  tropical_union_tester.Test(FLAGS_repeat, false);\n\n  // Nested composite.\n  first_nested_product_tester.Test(FLAGS_repeat);\n  second_nested_product_tester.Test(5);\n  nested_product_cube_tester.Test(FLAGS_repeat);\n  sparse_nested_product_cube_tester.Test(FLAGS_repeat);\n  log_log_sparse_expectation_tester.Test(FLAGS_repeat, false);\n\n  // ... and tests composite weight I/O without parentheses.\n  FLAGS_fst_weight_parentheses = \"\";\n\n  // Unnested composite.\n  tropical_gallic_tester.Test(FLAGS_repeat);\n  tropical_product_tester.Test(FLAGS_repeat);\n  tropical_lexicographic_tester.Test(FLAGS_repeat);\n  tropical_cube_tester.Test(FLAGS_repeat);\n  log_sparse_power_tester.Test(FLAGS_repeat);\n  log_log_expectation_tester.Test(FLAGS_repeat, false);\n  tropical_union_tester.Test(FLAGS_repeat, false);\n\n  // Nested composite.\n  second_nested_product_tester.Test(FLAGS_repeat);\n  log_log_sparse_expectation_tester.Test(FLAGS_repeat, false);\n\n  TestPowerWeightGetSetValue();\n  TestSparsePowerWeightGetSetValue();\n\n  std::cout << \"PASS\" << std::endl;\n\n  return 0;\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.7/test-driver",
    "content": "#! /bin/sh\n# test-driver - basic testsuite driver script.\n\nscriptversion=2013-07-13.22; # UTC\n\n# Copyright (C) 2011-2013 Free Software Foundation, Inc.\n#\n# This program is free software; you can redistribute it and/or modify\n# it under the terms of the GNU General Public License as published by\n# the Free Software Foundation; either version 2, or (at your option)\n# any later version.\n#\n# This program is distributed in the hope that it will be useful,\n# but WITHOUT ANY WARRANTY; without even the implied warranty of\n# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n# GNU General Public License for more details.\n#\n# You should have received a copy of the GNU General Public License\n# along with this program.  If not, see <http://www.gnu.org/licenses/>.\n\n# As a special exception to the GNU General Public License, if you\n# distribute this file as part of a program that contains a\n# configuration script generated by Autoconf, you may include it under\n# the same distribution terms that you use for the rest of that program.\n\n# This file is maintained in Automake, please report\n# bugs to <bug-automake@gnu.org> or send patches to\n# <automake-patches@gnu.org>.\n\n# Make unconditional expansion of undefined variables an error.  This\n# helps a lot in preventing typo-related bugs.\nset -u\n\nusage_error ()\n{\n  echo \"$0: $*\" >&2\n  print_usage >&2\n  exit 2\n}\n\nprint_usage ()\n{\n  cat <<END\nUsage:\n  test-driver --test-name=NAME --log-file=PATH --trs-file=PATH\n              [--expect-failure={yes|no}] [--color-tests={yes|no}]\n              [--enable-hard-errors={yes|no}] [--]\n              TEST-SCRIPT [TEST-SCRIPT-ARGUMENTS]\nThe '--test-name', '--log-file' and '--trs-file' options are mandatory.\nEND\n}\n\ntest_name= # Used for reporting.\nlog_file=  # Where to save the output of the test script.\ntrs_file=  # Where to save the metadata of the test run.\nexpect_failure=no\ncolor_tests=no\nenable_hard_errors=yes\nwhile test $# -gt 0; do\n  case $1 in\n  --help) print_usage; exit $?;;\n  --version) echo \"test-driver $scriptversion\"; exit $?;;\n  --test-name) test_name=$2; shift;;\n  --log-file) log_file=$2; shift;;\n  --trs-file) trs_file=$2; shift;;\n  --color-tests) color_tests=$2; shift;;\n  --expect-failure) expect_failure=$2; shift;;\n  --enable-hard-errors) enable_hard_errors=$2; shift;;\n  --) shift; break;;\n  -*) usage_error \"invalid option: '$1'\";;\n   *) break;;\n  esac\n  shift\ndone\n\nmissing_opts=\ntest x\"$test_name\" = x && missing_opts=\"$missing_opts --test-name\"\ntest x\"$log_file\"  = x && missing_opts=\"$missing_opts --log-file\"\ntest x\"$trs_file\"  = x && missing_opts=\"$missing_opts --trs-file\"\nif test x\"$missing_opts\" != x; then\n  usage_error \"the following mandatory options are missing:$missing_opts\"\nfi\n\nif test $# -eq 0; then\n  usage_error \"missing argument\"\nfi\n\nif test $color_tests = yes; then\n  # Keep this in sync with 'lib/am/check.am:$(am__tty_colors)'.\n  red='\u001b[0;31m' # Red.\n  grn='\u001b[0;32m' # Green.\n  lgn='\u001b[1;32m' # Light green.\n  blu='\u001b[1;34m' # Blue.\n  mgn='\u001b[0;35m' # Magenta.\n  std='\u001b[m'     # No color.\nelse\n  red= grn= lgn= blu= mgn= std=\nfi\n\ndo_exit='rm -f $log_file $trs_file; (exit $st); exit $st'\ntrap \"st=129; $do_exit\" 1\ntrap \"st=130; $do_exit\" 2\ntrap \"st=141; $do_exit\" 13\ntrap \"st=143; $do_exit\" 15\n\n# Test script is run here.\n\"$@\" >$log_file 2>&1\nestatus=$?\nif test $enable_hard_errors = no && test $estatus -eq 99; then\n  estatus=1\nfi\n\ncase $estatus:$expect_failure in\n  0:yes) col=$red res=XPASS recheck=yes gcopy=yes;;\n  0:*)   col=$grn res=PASS  recheck=no  gcopy=no;;\n  77:*)  col=$blu res=SKIP  recheck=no  gcopy=yes;;\n  99:*)  col=$mgn res=ERROR recheck=yes gcopy=yes;;\n  *:yes) col=$lgn res=XFAIL recheck=no  gcopy=yes;;\n  *:*)   col=$red res=FAIL  recheck=yes gcopy=yes;;\nesac\n\n# Report outcome to console.\necho \"${col}${res}${std}: $test_name\"\n\n# Register the test result, and other relevant metadata.\necho \":test-result: $res\" > $trs_file\necho \":global-test-result: $res\" >> $trs_file\necho \":recheck: $recheck\" >> $trs_file\necho \":copy-in-global-log: $gcopy\" >> $trs_file\n\n# Local Variables:\n# mode: shell-script\n# sh-indentation: 2\n# eval: (add-hook 'write-file-hooks 'time-stamp)\n# time-stamp-start: \"scriptversion=\"\n# time-stamp-format: \"%:y-%02m-%02d.%02H\"\n# time-stamp-time-zone: \"UTC\"\n# time-stamp-end: \"; # UTC\"\n# End:\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/.gitignore",
    "content": "# Ignore extensionless files\n!*.*\n!*/\n\n# Other patterns\n/config.h\n/config.log\n/config.status\n.deps/\n.libs/\n.dirstamp\n*.la\n*.lo\n*.o\n\n# Windows-specific files\n.vs/\n*.VC.db\nWin32/\nx64/\nDebug/\nRelease/\nobj/\n/bin/\n*.binlog\n*proj.user\n/cmake\n/cmake64\n/CMakeSettings.json\n/*.zip"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/AUTHORS",
    "content": "Principal Contacts:\n\nCyril Allauzen     <allauzen@google.com>\nMichael Riley      <riley@google.com>\n\nContributors:\n\nThese contributions range from fundamental algorithmic contributions (e.g.,\nMehryar Mohri) to implementation of core components and extensions.\n\nTom Bagby\nDan Bikel\nKyle Gorman\nMartin Jansche\nBoulos Harb\nMehryar Mohri\nDan Povey\nKasturi Raghavan\nJacob Ratkiewicz\nJesse Rosenstock\nJohan Schalkwyk\nMasha Shugrina\nWojtek Skut\nJeffrey Sorensen\nRichard Sproat\nAnanda Theertha Suresh\nTerry Tai\nKe Wu\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/CMakeLists.txt",
    "content": "project(openfst)\ninclude(CTest)\nfind_package(ICU COMPONENTS data i18n io  test tu uc)\nif (ICU_FOUND)\n  include_directories(${ICU_INCLUDE_DIRS})\n  set(LIBS ${LIBS} ${ICU_LIBRARIES})\nendif (ICU_FOUND)\n\nfind_package(ZLIB)\nif (ZLIB_FOUND) \n  include_directories(${ZLIB_INCLUDE_DIRECTORIES})\n  set(ZLIBS ${ZLIB_LIBRARIES})\nendif (ZLIB_FOUND)\n\ncmake_minimum_required(VERSION 3.1)\nset(CMAKE_MACOSX_RPATH 1)\nset(CMAKE_CXX_STANDARD 11)\n\nif (WIN32)\n  add_definitions(/bigobj)\n  set(WHOLEFST \"/WHOLEARCHIVE:fst\")\n  set(CMAKE_EXE_LINKER_FLAGS \"${CMAKE_EXE_LINKER_FLAGS} ${WHOLEFST}\")\n  #set(CMAKE_WINDOWS_EXPORT_ALL_SYMBOLS 1)\n  #this must be disabled unless the previous option (CMAKE_WINDOWS_EXPORT_ALL_SYMBOLS) is enabled\n  option(BUILD_SHARED_LIBS \"Build shared libraries\" OFF)\nelse()\n  option(BUILD_SHARED_LIBS \"Build shared libraries\" ON)\nendif (WIN32)\n\nset(SOVERSION \"10\")\nOPTION(BUILD_USE_SOLUTION_FOLDERS \"Enable grouping of projects in VS\" ON) \nSET_PROPERTY(GLOBAL PROPERTY USE_FOLDERS ${BUILD_USE_SOLUTION_FOLDERS}) \n\n\noption(HAVE_BIN          \"Build the fst binaries\" ON)\noption(HAVE_SCRIPT       \"Build the fstscript\" ON)\noption(HAVE_COMPACT      \"Build compact\" ON)\noption(HAVE_COMPRESS \"Build compress\" OFF)\noption(HAVE_CONST   \"Build const\" ON)\noption(HAVE_FAR  \"Build far\" ON)\noption(HAVE_GRM \"Build grm\" ON)\noption(HAVE_PDT \"Build pdt\" ON)\noption(HAVE_MPDT \"Build mpdt\" ON)\noption(HAVE_LINEAR \"Build linear\" ON)\noption(HAVE_LOOKAHEAD \"Build lookahead\" ON)\noption(HAVE_NGRAM \"Build ngram\" ON)\noption(HAVE_PYTHON \"Build python\" OFF)\noption(HAVE_SPECIAL \"Build special\" ON)\n\nadd_subdirectory(src)\n\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/COPYING",
    "content": "Licensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use these files except in compliance with the License.\nYou may obtain a copy of the License at\n\n    http://www.apache.org/licenses/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n\nCopyright 2005-2018 Google, Inc.\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/INSTALL",
    "content": "Installation Instructions\n*************************\n\nCopyright (C) 1994, 1995, 1996, 1999, 2000, 2001, 2002, 2004, 2005,\n2006, 2007 Free Software Foundation, Inc.\n\nThis file is free documentation; the Free Software Foundation gives\nunlimited permission to copy, distribute and modify it.\n\nBasic Installation\n==================\n\nBriefly, the shell commands `./configure; make; make install' should\nconfigure, build, and install this package.  The following\nmore-detailed instructions are generic; see the `README' file for\ninstructions specific to this package.\n\n   The `configure' shell script attempts to guess correct values for\nvarious system-dependent variables used during compilation.  It uses\nthose values to create a `Makefile' in each directory of the package.\nIt may also create one or more `.h' files containing system-dependent\ndefinitions.  Finally, it creates a shell script `config.status' that\nyou can run in the future to recreate the current configuration, and a\nfile `config.log' containing compiler output (useful mainly for\ndebugging `configure').\n\n   It can also use an optional file (typically called `config.cache'\nand enabled with `--cache-file=config.cache' or simply `-C') that saves\nthe results of its tests to speed up reconfiguring.  Caching is\ndisabled by default to prevent problems with accidental use of stale\ncache files.\n\n   If you need to do unusual things to compile the package, please try\nto figure out how `configure' could check whether to do them, and mail\ndiffs or instructions to the address given in the `README' so they can\nbe considered for the next release.  If you are using the cache, and at\nsome point `config.cache' contains results you don't want to keep, you\nmay remove or edit it.\n\n   The file `configure.ac' (or `configure.in') is used to create\n`configure' by a program called `autoconf'.  You need `configure.ac' if\nyou want to change it or regenerate `configure' using a newer version\nof `autoconf'.\n\nThe simplest way to compile this package is:\n\n  1. `cd' to the directory containing the package's source code and type\n     `./configure' to configure the package for your system.\n\n     Running `configure' might take a while.  While running, it prints\n     some messages telling which features it is checking for.\n\n  2. Type `make' to compile the package.\n\n  3. Optionally, type `make check' to run any self-tests that come with\n     the package.\n\n  4. Type `make install' to install the programs and any data files and\n     documentation.\n\n  5. You can remove the program binaries and object files from the\n     source code directory by typing `make clean'.  To also remove the\n     files that `configure' created (so you can compile the package for\n     a different kind of computer), type `make distclean'.  There is\n     also a `make maintainer-clean' target, but that is intended mainly\n     for the package's developers.  If you use it, you may have to get\n     all sorts of other programs in order to regenerate files that came\n     with the distribution.\n\n  6. Often, you can also type `make uninstall' to remove the installed\n     files again.\n\nCompilers and Options\n=====================\n\nSome systems require unusual options for compilation or linking that the\n`configure' script does not know about.  Run `./configure --help' for\ndetails on some of the pertinent environment variables.\n\n   You can give `configure' initial values for configuration parameters\nby setting variables in the command line or in the environment.  Here\nis an example:\n\n     ./configure CC=c99 CFLAGS=-g LIBS=-lposix\n\n   *Note Defining Variables::, for more details.\n\nCompiling For Multiple Architectures\n====================================\n\nYou can compile the package for more than one kind of computer at the\nsame time, by placing the object files for each architecture in their\nown directory.  To do this, you can use GNU `make'.  `cd' to the\ndirectory where you want the object files and executables to go and run\nthe `configure' script.  `configure' automatically checks for the\nsource code in the directory that `configure' is in and in `..'.\n\n   With a non-GNU `make', it is safer to compile the package for one\narchitecture at a time in the source code directory.  After you have\ninstalled the package for one architecture, use `make distclean' before\nreconfiguring for another architecture.\n\nInstallation Names\n==================\n\nBy default, `make install' installs the package's commands under\n`/usr/local/bin', include files under `/usr/local/include', etc.  You\ncan specify an installation prefix other than `/usr/local' by giving\n`configure' the option `--prefix=PREFIX'.\n\n   You can specify separate installation prefixes for\narchitecture-specific files and architecture-independent files.  If you\npass the option `--exec-prefix=PREFIX' to `configure', the package uses\nPREFIX as the prefix for installing programs and libraries.\nDocumentation and other data files still use the regular prefix.\n\n   In addition, if you use an unusual directory layout you can give\noptions like `--bindir=DIR' to specify different values for particular\nkinds of files.  Run `configure --help' for a list of the directories\nyou can set and what kinds of files go in them.\n\n   If the package supports it, you can cause programs to be installed\nwith an extra prefix or suffix on their names by giving `configure' the\noption `--program-prefix=PREFIX' or `--program-suffix=SUFFIX'.\n\nOptional Features\n=================\n\nSome packages pay attention to `--enable-FEATURE' options to\n`configure', where FEATURE indicates an optional part of the package.\nThey may also pay attention to `--with-PACKAGE' options, where PACKAGE\nis something like `gnu-as' or `x' (for the X Window System).  The\n`README' should mention any `--enable-' and `--with-' options that the\npackage recognizes.\n\n   For packages that use the X Window System, `configure' can usually\nfind the X include and library files automatically, but if it doesn't,\nyou can use the `configure' options `--x-includes=DIR' and\n`--x-libraries=DIR' to specify their locations.\n\nSpecifying the System Type\n==========================\n\nThere may be some features `configure' cannot figure out automatically,\nbut needs to determine by the type of machine the package will run on.\nUsually, assuming the package is built to be run on the _same_\narchitectures, `configure' can figure that out, but if it prints a\nmessage saying it cannot guess the machine type, give it the\n`--build=TYPE' option.  TYPE can either be a short name for the system\ntype, such as `sun4', or a canonical name which has the form:\n\n     CPU-COMPANY-SYSTEM\n\nwhere SYSTEM can have one of these forms:\n\n     OS KERNEL-OS\n\n   See the file `config.sub' for the possible values of each field.  If\n`config.sub' isn't included in this package, then this package doesn't\nneed to know the machine type.\n\n   If you are _building_ compiler tools for cross-compiling, you should\nuse the option `--target=TYPE' to select the type of system they will\nproduce code for.\n\n   If you want to _use_ a cross compiler, that generates code for a\nplatform different from the build platform, you should specify the\n\"host\" platform (i.e., that on which the generated programs will\neventually be run) with `--host=TYPE'.\n\nSharing Defaults\n================\n\nIf you want to set default values for `configure' scripts to share, you\ncan create a site shell script called `config.site' that gives default\nvalues for variables like `CC', `cache_file', and `prefix'.\n`configure' looks for `PREFIX/share/config.site' if it exists, then\n`PREFIX/etc/config.site' if it exists.  Or, you can set the\n`CONFIG_SITE' environment variable to the location of the site script.\nA warning: not all `configure' scripts look for a site script.\n\nDefining Variables\n==================\n\nVariables not defined in a site shell script can be set in the\nenvironment passed to `configure'.  However, some packages may run\nconfigure again during the build, and the customized values of these\nvariables may be lost.  In order to avoid this problem, you should set\nthem in the `configure' command line, using `VAR=value'.  For example:\n\n     ./configure CC=/usr/local2/bin/gcc\n\ncauses the specified `gcc' to be used as the C compiler (unless it is\noverridden in the site shell script).\n\nUnfortunately, this technique does not work for `CONFIG_SHELL' due to\nan Autoconf bug.  Until the bug is fixed you can use this workaround:\n\n     CONFIG_SHELL=/bin/bash /bin/bash ./configure CONFIG_SHELL=/bin/bash\n\n`configure' Invocation\n======================\n\n`configure' recognizes the following options to control how it operates.\n\n`--help'\n`-h'\n     Print a summary of the options to `configure', and exit.\n\n`--version'\n`-V'\n     Print the version of Autoconf used to generate the `configure'\n     script, and exit.\n\n`--cache-file=FILE'\n     Enable the cache: use and save the results of the tests in FILE,\n     traditionally `config.cache'.  FILE defaults to `/dev/null' to\n     disable caching.\n\n`--config-cache'\n`-C'\n     Alias for `--cache-file=config.cache'.\n\n`--quiet'\n`--silent'\n`-q'\n     Do not print messages saying which checks are being made.  To\n     suppress all normal output, redirect it to `/dev/null' (any error\n     messages will still be shown).\n\n`--srcdir=DIR'\n     Look for the package's source code in directory DIR.  Usually\n     `configure' can determine that directory automatically.\n\n`configure' also accepts some other, not widely useful, options.  Run\n`configure --help' for more details.\n\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/Makefile.am",
    "content": "SUBDIRS = src\nACLOCAL_AMFLAGS = -I m4\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/Makefile.in",
    "content": "# Makefile.in generated by automake 1.15.1 from Makefile.am.\n# @configure_input@\n\n# Copyright (C) 1994-2017 Free Software Foundation, Inc.\n\n# This Makefile.in is free software; the Free Software Foundation\n# gives unlimited permission to copy and/or distribute it,\n# with or without modifications, as long as this notice is preserved.\n\n# This program is distributed in the hope that it will be useful,\n# but WITHOUT ANY WARRANTY, to the extent permitted by law; without\n# even the implied warranty of MERCHANTABILITY or FITNESS FOR A\n# PARTICULAR PURPOSE.\n\n@SET_MAKE@\nVPATH = @srcdir@\nam__is_gnu_make = { \\\n  if test -z '$(MAKELEVEL)'; then \\\n    false; \\\n  elif test -n '$(MAKE_HOST)'; then \\\n    true; \\\n  elif test -n '$(MAKE_VERSION)' && test -n '$(CURDIR)'; then \\\n    true; \\\n  else \\\n    false; \\\n  fi; \\\n}\nam__make_running_with_option = \\\n  case $${target_option-} in \\\n      ?) ;; \\\n      *) echo \"am__make_running_with_option: internal error: invalid\" \\\n              \"target option '$${target_option-}' specified\" >&2; \\\n         exit 1;; \\\n  esac; \\\n  has_opt=no; \\\n  sane_makeflags=$$MAKEFLAGS; \\\n  if $(am__is_gnu_make); then \\\n    sane_makeflags=$$MFLAGS; \\\n  else \\\n    case $$MAKEFLAGS in \\\n      *\\\\[\\ \\\t]*) \\\n        bs=\\\\; \\\n        sane_makeflags=`printf '%s\\n' \"$$MAKEFLAGS\" \\\n          | sed \"s/$$bs$$bs[$$bs $$bs\t]*//g\"`;; \\\n    esac; \\\n  fi; \\\n  skip_next=no; \\\n  strip_trailopt () \\\n  { \\\n    flg=`printf '%s\\n' \"$$flg\" | sed \"s/$$1.*$$//\"`; \\\n  }; \\\n  for flg in $$sane_makeflags; do \\\n    test $$skip_next = yes && { skip_next=no; continue; }; \\\n    case $$flg in \\\n      *=*|--*) continue;; \\\n        -*I) strip_trailopt 'I'; skip_next=yes;; \\\n      -*I?*) strip_trailopt 'I';; \\\n        -*O) strip_trailopt 'O'; skip_next=yes;; \\\n      -*O?*) strip_trailopt 'O';; \\\n        -*l) strip_trailopt 'l'; skip_next=yes;; \\\n      -*l?*) strip_trailopt 'l';; \\\n      -[dEDm]) skip_next=yes;; \\\n      -[JT]) skip_next=yes;; \\\n    esac; \\\n    case $$flg in \\\n      *$$target_option*) has_opt=yes; break;; \\\n    esac; \\\n  done; \\\n  test $$has_opt = yes\nam__make_dryrun = (target_option=n; $(am__make_running_with_option))\nam__make_keepgoing = (target_option=k; $(am__make_running_with_option))\npkgdatadir = $(datadir)/@PACKAGE@\npkgincludedir = $(includedir)/@PACKAGE@\npkglibdir = $(libdir)/@PACKAGE@\npkglibexecdir = $(libexecdir)/@PACKAGE@\nam__cd = CDPATH=\"$${ZSH_VERSION+.}$(PATH_SEPARATOR)\" && cd\ninstall_sh_DATA = $(install_sh) -c -m 644\ninstall_sh_PROGRAM = $(install_sh) -c\ninstall_sh_SCRIPT = $(install_sh) -c\nINSTALL_HEADER = $(INSTALL_DATA)\ntransform = $(program_transform_name)\nNORMAL_INSTALL = :\nPRE_INSTALL = :\nPOST_INSTALL = :\nNORMAL_UNINSTALL = :\nPRE_UNINSTALL = :\nPOST_UNINSTALL = :\nbuild_triplet = @build@\nhost_triplet = @host@\nsubdir = .\nACLOCAL_M4 = $(top_srcdir)/aclocal.m4\nam__aclocal_m4_deps = $(top_srcdir)/m4/ac_python_devel.m4 \\\n\t$(top_srcdir)/m4/libtool.m4 $(top_srcdir)/m4/ltoptions.m4 \\\n\t$(top_srcdir)/m4/ltsugar.m4 $(top_srcdir)/m4/ltversion.m4 \\\n\t$(top_srcdir)/m4/lt~obsolete.m4 $(top_srcdir)/configure.ac\nam__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \\\n\t$(ACLOCAL_M4)\nDIST_COMMON = $(srcdir)/Makefile.am $(top_srcdir)/configure \\\n\t$(am__configure_deps) $(am__DIST_COMMON)\nam__CONFIG_DISTCLEAN_FILES = config.status config.cache config.log \\\n configure.lineno config.status.lineno\nmkinstalldirs = $(install_sh) -d\nCONFIG_HEADER = config.h $(top_builddir)/src/include/fst/config.h\nCONFIG_CLEAN_FILES =\nCONFIG_CLEAN_VPATH_FILES =\nAM_V_P = $(am__v_P_@AM_V@)\nam__v_P_ = $(am__v_P_@AM_DEFAULT_V@)\nam__v_P_0 = false\nam__v_P_1 = :\nAM_V_GEN = $(am__v_GEN_@AM_V@)\nam__v_GEN_ = $(am__v_GEN_@AM_DEFAULT_V@)\nam__v_GEN_0 = @echo \"  GEN     \" $@;\nam__v_GEN_1 = \nAM_V_at = $(am__v_at_@AM_V@)\nam__v_at_ = $(am__v_at_@AM_DEFAULT_V@)\nam__v_at_0 = @\nam__v_at_1 = \nSOURCES =\nDIST_SOURCES =\nRECURSIVE_TARGETS = all-recursive check-recursive cscopelist-recursive \\\n\tctags-recursive dvi-recursive html-recursive info-recursive \\\n\tinstall-data-recursive install-dvi-recursive \\\n\tinstall-exec-recursive install-html-recursive \\\n\tinstall-info-recursive install-pdf-recursive \\\n\tinstall-ps-recursive install-recursive installcheck-recursive \\\n\tinstalldirs-recursive pdf-recursive ps-recursive \\\n\ttags-recursive uninstall-recursive\nam__can_run_installinfo = \\\n  case $$AM_UPDATE_INFO_DIR in \\\n    n|no|NO) false;; \\\n    *) (install-info --version) >/dev/null 2>&1;; \\\n  esac\nRECURSIVE_CLEAN_TARGETS = mostlyclean-recursive clean-recursive\t\\\n  distclean-recursive maintainer-clean-recursive\nam__recursive_targets = \\\n  $(RECURSIVE_TARGETS) \\\n  $(RECURSIVE_CLEAN_TARGETS) \\\n  $(am__extra_recursive_targets)\nAM_RECURSIVE_TARGETS = $(am__recursive_targets:-recursive=) TAGS CTAGS \\\n\tcscope distdir dist dist-all distcheck\nam__tagged_files = $(HEADERS) $(SOURCES) $(TAGS_FILES) \\\n\t$(LISP)config.h.in\n# Read a list of newline-separated strings from the standard input,\n# and print each of them once, without duplicates.  Input order is\n# *not* preserved.\nam__uniquify_input = $(AWK) '\\\n  BEGIN { nonempty = 0; } \\\n  { items[$$0] = 1; nonempty = 1; } \\\n  END { if (nonempty) { for (i in items) print i; }; } \\\n'\n# Make sure the list of sources is unique.  This is necessary because,\n# e.g., the same source file might be shared among _SOURCES variables\n# for different programs/libraries.\nam__define_uniq_tagged_files = \\\n  list='$(am__tagged_files)'; \\\n  unique=`for i in $$list; do \\\n    if test -f \"$$i\"; then echo $$i; else echo $(srcdir)/$$i; fi; \\\n  done | $(am__uniquify_input)`\nETAGS = etags\nCTAGS = ctags\nCSCOPE = cscope\nDIST_SUBDIRS = $(SUBDIRS)\nam__DIST_COMMON = $(srcdir)/Makefile.in $(srcdir)/config.h.in \\\n\t$(top_srcdir)/src/include/fst/config.h.in AUTHORS COPYING \\\n\tINSTALL NEWS README ar-lib compile config.guess config.sub \\\n\tinstall-sh ltmain.sh missing\nDISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST)\ndistdir = $(PACKAGE)-$(VERSION)\ntop_distdir = $(distdir)\nam__remove_distdir = \\\n  if test -d \"$(distdir)\"; then \\\n    find \"$(distdir)\" -type d ! -perm -200 -exec chmod u+w {} ';' \\\n      && rm -rf \"$(distdir)\" \\\n      || { sleep 5 && rm -rf \"$(distdir)\"; }; \\\n  else :; fi\nam__post_remove_distdir = $(am__remove_distdir)\nam__relativize = \\\n  dir0=`pwd`; \\\n  sed_first='s,^\\([^/]*\\)/.*$$,\\1,'; \\\n  sed_rest='s,^[^/]*/*,,'; \\\n  sed_last='s,^.*/\\([^/]*\\)$$,\\1,'; \\\n  sed_butlast='s,/*[^/]*$$,,'; \\\n  while test -n \"$$dir1\"; do \\\n    first=`echo \"$$dir1\" | sed -e \"$$sed_first\"`; \\\n    if test \"$$first\" != \".\"; then \\\n      if test \"$$first\" = \"..\"; then \\\n        dir2=`echo \"$$dir0\" | sed -e \"$$sed_last\"`/\"$$dir2\"; \\\n        dir0=`echo \"$$dir0\" | sed -e \"$$sed_butlast\"`; \\\n      else \\\n        first2=`echo \"$$dir2\" | sed -e \"$$sed_first\"`; \\\n        if test \"$$first2\" = \"$$first\"; then \\\n          dir2=`echo \"$$dir2\" | sed -e \"$$sed_rest\"`; \\\n        else \\\n          dir2=\"../$$dir2\"; \\\n        fi; \\\n        dir0=\"$$dir0\"/\"$$first\"; \\\n      fi; \\\n    fi; \\\n    dir1=`echo \"$$dir1\" | sed -e \"$$sed_rest\"`; \\\n  done; \\\n  reldir=\"$$dir2\"\nDIST_ARCHIVES = $(distdir).tar.gz\nGZIP_ENV = --best\nDIST_TARGETS = dist-gzip\ndistuninstallcheck_listfiles = find . -type f -print\nam__distuninstallcheck_listfiles = $(distuninstallcheck_listfiles) \\\n  | sed 's|^\\./|$(prefix)/|' | grep -v '$(infodir)/dir$$'\ndistcleancheck_listfiles = find . -type f -print\nACLOCAL = @ACLOCAL@\nAMTAR = @AMTAR@\nAM_DEFAULT_VERBOSITY = @AM_DEFAULT_VERBOSITY@\nAR = @AR@\nAUTOCONF = @AUTOCONF@\nAUTOHEADER = @AUTOHEADER@\nAUTOMAKE = @AUTOMAKE@\nAWK = @AWK@\nCC = @CC@\nCCDEPMODE = @CCDEPMODE@\nCFLAGS = @CFLAGS@\nCPP = @CPP@\nCPPFLAGS = @CPPFLAGS@\nCXX = @CXX@\nCXXCPP = @CXXCPP@\nCXXDEPMODE = @CXXDEPMODE@\nCXXFLAGS = @CXXFLAGS@\nCYGPATH_W = @CYGPATH_W@\nDEFS = @DEFS@\nDEPDIR = @DEPDIR@\nDLLTOOL = @DLLTOOL@\nDL_LIBS = @DL_LIBS@\nDSYMUTIL = @DSYMUTIL@\nDUMPBIN = @DUMPBIN@\nECHO_C = @ECHO_C@\nECHO_N = @ECHO_N@\nECHO_T = @ECHO_T@\nEGREP = @EGREP@\nEXEEXT = @EXEEXT@\nFGREP = @FGREP@\nGREP = @GREP@\nINSTALL = @INSTALL@\nINSTALL_DATA = @INSTALL_DATA@\nINSTALL_PROGRAM = @INSTALL_PROGRAM@\nINSTALL_SCRIPT = @INSTALL_SCRIPT@\nINSTALL_STRIP_PROGRAM = @INSTALL_STRIP_PROGRAM@\nLD = @LD@\nLDFLAGS = @LDFLAGS@\nLIBOBJS = @LIBOBJS@\nLIBS = @LIBS@\nLIBTOOL = @LIBTOOL@\nLIPO = @LIPO@\nLN_S = @LN_S@\nLTLIBOBJS = @LTLIBOBJS@\nLT_SYS_LIBRARY_PATH = @LT_SYS_LIBRARY_PATH@\nMAKEINFO = @MAKEINFO@\nMANIFEST_TOOL = @MANIFEST_TOOL@\nMKDIR_P = @MKDIR_P@\nNM = @NM@\nNMEDIT = @NMEDIT@\nOBJDUMP = @OBJDUMP@\nOBJEXT = @OBJEXT@\nOTOOL = @OTOOL@\nOTOOL64 = @OTOOL64@\nPACKAGE = @PACKAGE@\nPACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@\nPACKAGE_NAME = @PACKAGE_NAME@\nPACKAGE_STRING = @PACKAGE_STRING@\nPACKAGE_TARNAME = @PACKAGE_TARNAME@\nPACKAGE_URL = @PACKAGE_URL@\nPACKAGE_VERSION = @PACKAGE_VERSION@\nPATH_SEPARATOR = @PATH_SEPARATOR@\nPYTHON = @PYTHON@\nPYTHON_CPPFLAGS = @PYTHON_CPPFLAGS@\nPYTHON_EXEC_PREFIX = @PYTHON_EXEC_PREFIX@\nPYTHON_EXTRA_LDFLAGS = @PYTHON_EXTRA_LDFLAGS@\nPYTHON_EXTRA_LIBS = @PYTHON_EXTRA_LIBS@\nPYTHON_LDFLAGS = @PYTHON_LDFLAGS@\nPYTHON_PLATFORM = @PYTHON_PLATFORM@\nPYTHON_PREFIX = @PYTHON_PREFIX@\nPYTHON_SITE_PKG = @PYTHON_SITE_PKG@\nPYTHON_VERSION = @PYTHON_VERSION@\nRANLIB = @RANLIB@\nSED = @SED@\nSET_MAKE = @SET_MAKE@\nSHELL = @SHELL@\nSTRIP = @STRIP@\nVERSION = @VERSION@\nabs_builddir = @abs_builddir@\nabs_srcdir = @abs_srcdir@\nabs_top_builddir = @abs_top_builddir@\nabs_top_srcdir = @abs_top_srcdir@\nac_ct_AR = @ac_ct_AR@\nac_ct_CC = @ac_ct_CC@\nac_ct_CXX = @ac_ct_CXX@\nac_ct_DUMPBIN = @ac_ct_DUMPBIN@\nam__include = @am__include@\nam__leading_dot = @am__leading_dot@\nam__quote = @am__quote@\nam__tar = @am__tar@\nam__untar = @am__untar@\nbindir = @bindir@\nbuild = @build@\nbuild_alias = @build_alias@\nbuild_cpu = @build_cpu@\nbuild_os = @build_os@\nbuild_vendor = @build_vendor@\nbuilddir = @builddir@\ndatadir = @datadir@\ndatarootdir = @datarootdir@\ndocdir = @docdir@\ndvidir = @dvidir@\nexec_prefix = @exec_prefix@\nhost = @host@\nhost_alias = @host_alias@\nhost_cpu = @host_cpu@\nhost_os = @host_os@\nhost_vendor = @host_vendor@\nhtmldir = @htmldir@\nincludedir = @includedir@\ninfodir = @infodir@\ninstall_sh = @install_sh@\nlibdir = @libdir@\nlibexecdir = @libexecdir@\nlibfstdir = @libfstdir@\nlocaledir = @localedir@\nlocalstatedir = @localstatedir@\nmandir = @mandir@\nmkdir_p = @mkdir_p@\noldincludedir = @oldincludedir@\npdfdir = @pdfdir@\npkgpyexecdir = @pkgpyexecdir@\npkgpythondir = @pkgpythondir@\nprefix = @prefix@\nprogram_transform_name = @program_transform_name@\npsdir = @psdir@\npyexecdir = @pyexecdir@\npythondir = @pythondir@\nrunstatedir = @runstatedir@\nsbindir = @sbindir@\nsharedstatedir = @sharedstatedir@\nsrcdir = @srcdir@\nsysconfdir = @sysconfdir@\ntarget_alias = @target_alias@\ntop_build_prefix = @top_build_prefix@\ntop_builddir = @top_builddir@\ntop_srcdir = @top_srcdir@\nSUBDIRS = src\nACLOCAL_AMFLAGS = -I m4\nall: config.h\n\t$(MAKE) $(AM_MAKEFLAGS) all-recursive\n\n.SUFFIXES:\nam--refresh: Makefile\n\t@:\n$(srcdir)/Makefile.in:  $(srcdir)/Makefile.am  $(am__configure_deps)\n\t@for dep in $?; do \\\n\t  case '$(am__configure_deps)' in \\\n\t    *$$dep*) \\\n\t      echo ' cd $(srcdir) && $(AUTOMAKE) --foreign'; \\\n\t      $(am__cd) $(srcdir) && $(AUTOMAKE) --foreign \\\n\t\t&& exit 0; \\\n\t      exit 1;; \\\n\t  esac; \\\n\tdone; \\\n\techo ' cd $(top_srcdir) && $(AUTOMAKE) --foreign Makefile'; \\\n\t$(am__cd) $(top_srcdir) && \\\n\t  $(AUTOMAKE) --foreign Makefile\nMakefile: $(srcdir)/Makefile.in $(top_builddir)/config.status\n\t@case '$?' in \\\n\t  *config.status*) \\\n\t    echo ' $(SHELL) ./config.status'; \\\n\t    $(SHELL) ./config.status;; \\\n\t  *) \\\n\t    echo ' cd $(top_builddir) && $(SHELL) ./config.status $@ $(am__depfiles_maybe)'; \\\n\t    cd $(top_builddir) && $(SHELL) ./config.status $@ $(am__depfiles_maybe);; \\\n\tesac;\n\n$(top_builddir)/config.status: $(top_srcdir)/configure $(CONFIG_STATUS_DEPENDENCIES)\n\t$(SHELL) ./config.status --recheck\n\n$(top_srcdir)/configure:  $(am__configure_deps)\n\t$(am__cd) $(srcdir) && $(AUTOCONF)\n$(ACLOCAL_M4):  $(am__aclocal_m4_deps)\n\t$(am__cd) $(srcdir) && $(ACLOCAL) $(ACLOCAL_AMFLAGS)\n$(am__aclocal_m4_deps):\n\nconfig.h: stamp-h1\n\t@test -f $@ || rm -f stamp-h1\n\t@test -f $@ || $(MAKE) $(AM_MAKEFLAGS) stamp-h1\n\nstamp-h1: $(srcdir)/config.h.in $(top_builddir)/config.status\n\t@rm -f stamp-h1\n\tcd $(top_builddir) && $(SHELL) ./config.status config.h\n$(srcdir)/config.h.in:  $(am__configure_deps) \n\t($(am__cd) $(top_srcdir) && $(AUTOHEADER))\n\trm -f stamp-h1\n\ttouch $@\n\nsrc/include/fst/config.h: src/include/fst/stamp-h2\n\t@test -f $@ || rm -f src/include/fst/stamp-h2\n\t@test -f $@ || $(MAKE) $(AM_MAKEFLAGS) src/include/fst/stamp-h2\n\nsrc/include/fst/stamp-h2: $(top_srcdir)/src/include/fst/config.h.in $(top_builddir)/config.status\n\t@rm -f src/include/fst/stamp-h2\n\tcd $(top_builddir) && $(SHELL) ./config.status src/include/fst/config.h\n\ndistclean-hdr:\n\t-rm -f config.h stamp-h1 src/include/fst/config.h src/include/fst/stamp-h2\n\nmostlyclean-libtool:\n\t-rm -f *.lo\n\nclean-libtool:\n\t-rm -rf .libs _libs\n\ndistclean-libtool:\n\t-rm -f libtool config.lt\n\n# This directory's subdirectories are mostly independent; you can cd\n# into them and run 'make' without going through this Makefile.\n# To change the values of 'make' variables: instead of editing Makefiles,\n# (1) if the variable is set in 'config.status', edit 'config.status'\n#     (which will cause the Makefiles to be regenerated when you run 'make');\n# (2) otherwise, pass the desired values on the 'make' command line.\n$(am__recursive_targets):\n\t@fail=; \\\n\tif $(am__make_keepgoing); then \\\n\t  failcom='fail=yes'; \\\n\telse \\\n\t  failcom='exit 1'; \\\n\tfi; \\\n\tdot_seen=no; \\\n\ttarget=`echo $@ | sed s/-recursive//`; \\\n\tcase \"$@\" in \\\n\t  distclean-* | maintainer-clean-*) list='$(DIST_SUBDIRS)' ;; \\\n\t  *) list='$(SUBDIRS)' ;; \\\n\tesac; \\\n\tfor subdir in $$list; do \\\n\t  echo \"Making $$target in $$subdir\"; \\\n\t  if test \"$$subdir\" = \".\"; then \\\n\t    dot_seen=yes; \\\n\t    local_target=\"$$target-am\"; \\\n\t  else \\\n\t    local_target=\"$$target\"; \\\n\t  fi; \\\n\t  ($(am__cd) $$subdir && $(MAKE) $(AM_MAKEFLAGS) $$local_target) \\\n\t  || eval $$failcom; \\\n\tdone; \\\n\tif test \"$$dot_seen\" = \"no\"; then \\\n\t  $(MAKE) $(AM_MAKEFLAGS) \"$$target-am\" || exit 1; \\\n\tfi; test -z \"$$fail\"\n\nID: $(am__tagged_files)\n\t$(am__define_uniq_tagged_files); mkid -fID $$unique\ntags: tags-recursive\nTAGS: tags\n\ntags-am: $(TAGS_DEPENDENCIES) $(am__tagged_files)\n\tset x; \\\n\there=`pwd`; \\\n\tif ($(ETAGS) --etags-include --version) >/dev/null 2>&1; then \\\n\t  include_option=--etags-include; \\\n\t  empty_fix=.; \\\n\telse \\\n\t  include_option=--include; \\\n\t  empty_fix=; \\\n\tfi; \\\n\tlist='$(SUBDIRS)'; for subdir in $$list; do \\\n\t  if test \"$$subdir\" = .; then :; else \\\n\t    test ! -f $$subdir/TAGS || \\\n\t      set \"$$@\" \"$$include_option=$$here/$$subdir/TAGS\"; \\\n\t  fi; \\\n\tdone; \\\n\t$(am__define_uniq_tagged_files); \\\n\tshift; \\\n\tif test -z \"$(ETAGS_ARGS)$$*$$unique\"; then :; else \\\n\t  test -n \"$$unique\" || unique=$$empty_fix; \\\n\t  if test $$# -gt 0; then \\\n\t    $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \\\n\t      \"$$@\" $$unique; \\\n\t  else \\\n\t    $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \\\n\t      $$unique; \\\n\t  fi; \\\n\tfi\nctags: ctags-recursive\n\nCTAGS: ctags\nctags-am: $(TAGS_DEPENDENCIES) $(am__tagged_files)\n\t$(am__define_uniq_tagged_files); \\\n\ttest -z \"$(CTAGS_ARGS)$$unique\" \\\n\t  || $(CTAGS) $(CTAGSFLAGS) $(AM_CTAGSFLAGS) $(CTAGS_ARGS) \\\n\t     $$unique\n\nGTAGS:\n\there=`$(am__cd) $(top_builddir) && pwd` \\\n\t  && $(am__cd) $(top_srcdir) \\\n\t  && gtags -i $(GTAGS_ARGS) \"$$here\"\ncscope: cscope.files\n\ttest ! -s cscope.files \\\n\t  || $(CSCOPE) -b -q $(AM_CSCOPEFLAGS) $(CSCOPEFLAGS) -i cscope.files $(CSCOPE_ARGS)\nclean-cscope:\n\t-rm -f cscope.files\ncscope.files: clean-cscope cscopelist\ncscopelist: cscopelist-recursive\n\ncscopelist-am: $(am__tagged_files)\n\tlist='$(am__tagged_files)'; \\\n\tcase \"$(srcdir)\" in \\\n\t  [\\\\/]* | ?:[\\\\/]*) sdir=\"$(srcdir)\" ;; \\\n\t  *) sdir=$(subdir)/$(srcdir) ;; \\\n\tesac; \\\n\tfor i in $$list; do \\\n\t  if test -f \"$$i\"; then \\\n\t    echo \"$(subdir)/$$i\"; \\\n\t  else \\\n\t    echo \"$$sdir/$$i\"; \\\n\t  fi; \\\n\tdone >> $(top_builddir)/cscope.files\n\ndistclean-tags:\n\t-rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags\n\t-rm -f cscope.out cscope.in.out cscope.po.out cscope.files\n\ndistdir: $(DISTFILES)\n\t$(am__remove_distdir)\n\ttest -d \"$(distdir)\" || mkdir \"$(distdir)\"\n\t@srcdirstrip=`echo \"$(srcdir)\" | sed 's/[].[^$$\\\\*]/\\\\\\\\&/g'`; \\\n\ttopsrcdirstrip=`echo \"$(top_srcdir)\" | sed 's/[].[^$$\\\\*]/\\\\\\\\&/g'`; \\\n\tlist='$(DISTFILES)'; \\\n\t  dist_files=`for file in $$list; do echo $$file; done | \\\n\t  sed -e \"s|^$$srcdirstrip/||;t\" \\\n\t      -e \"s|^$$topsrcdirstrip/|$(top_builddir)/|;t\"`; \\\n\tcase $$dist_files in \\\n\t  */*) $(MKDIR_P) `echo \"$$dist_files\" | \\\n\t\t\t   sed '/\\//!d;s|^|$(distdir)/|;s,/[^/]*$$,,' | \\\n\t\t\t   sort -u` ;; \\\n\tesac; \\\n\tfor file in $$dist_files; do \\\n\t  if test -f $$file || test -d $$file; then d=.; else d=$(srcdir); fi; \\\n\t  if test -d $$d/$$file; then \\\n\t    dir=`echo \"/$$file\" | sed -e 's,/[^/]*$$,,'`; \\\n\t    if test -d \"$(distdir)/$$file\"; then \\\n\t      find \"$(distdir)/$$file\" -type d ! -perm -700 -exec chmod u+rwx {} \\;; \\\n\t    fi; \\\n\t    if test -d $(srcdir)/$$file && test $$d != $(srcdir); then \\\n\t      cp -fpR $(srcdir)/$$file \"$(distdir)$$dir\" || exit 1; \\\n\t      find \"$(distdir)/$$file\" -type d ! -perm -700 -exec chmod u+rwx {} \\;; \\\n\t    fi; \\\n\t    cp -fpR $$d/$$file \"$(distdir)$$dir\" || exit 1; \\\n\t  else \\\n\t    test -f \"$(distdir)/$$file\" \\\n\t    || cp -p $$d/$$file \"$(distdir)/$$file\" \\\n\t    || exit 1; \\\n\t  fi; \\\n\tdone\n\t@list='$(DIST_SUBDIRS)'; for subdir in $$list; do \\\n\t  if test \"$$subdir\" = .; then :; else \\\n\t    $(am__make_dryrun) \\\n\t      || test -d \"$(distdir)/$$subdir\" \\\n\t      || $(MKDIR_P) \"$(distdir)/$$subdir\" \\\n\t      || exit 1; \\\n\t    dir1=$$subdir; dir2=\"$(distdir)/$$subdir\"; \\\n\t    $(am__relativize); \\\n\t    new_distdir=$$reldir; \\\n\t    dir1=$$subdir; dir2=\"$(top_distdir)\"; \\\n\t    $(am__relativize); \\\n\t    new_top_distdir=$$reldir; \\\n\t    echo \" (cd $$subdir && $(MAKE) $(AM_MAKEFLAGS) top_distdir=\"$$new_top_distdir\" distdir=\"$$new_distdir\" \\\\\"; \\\n\t    echo \"     am__remove_distdir=: am__skip_length_check=: am__skip_mode_fix=: distdir)\"; \\\n\t    ($(am__cd) $$subdir && \\\n\t      $(MAKE) $(AM_MAKEFLAGS) \\\n\t        top_distdir=\"$$new_top_distdir\" \\\n\t        distdir=\"$$new_distdir\" \\\n\t\tam__remove_distdir=: \\\n\t\tam__skip_length_check=: \\\n\t\tam__skip_mode_fix=: \\\n\t        distdir) \\\n\t      || exit 1; \\\n\t  fi; \\\n\tdone\n\t-test -n \"$(am__skip_mode_fix)\" \\\n\t|| find \"$(distdir)\" -type d ! -perm -755 \\\n\t\t-exec chmod u+rwx,go+rx {} \\; -o \\\n\t  ! -type d ! -perm -444 -links 1 -exec chmod a+r {} \\; -o \\\n\t  ! -type d ! -perm -400 -exec chmod a+r {} \\; -o \\\n\t  ! -type d ! -perm -444 -exec $(install_sh) -c -m a+r {} {} \\; \\\n\t|| chmod -R a+r \"$(distdir)\"\ndist-gzip: distdir\n\ttardir=$(distdir) && $(am__tar) | eval GZIP= gzip $(GZIP_ENV) -c >$(distdir).tar.gz\n\t$(am__post_remove_distdir)\n\ndist-bzip2: distdir\n\ttardir=$(distdir) && $(am__tar) | BZIP2=$${BZIP2--9} bzip2 -c >$(distdir).tar.bz2\n\t$(am__post_remove_distdir)\n\ndist-lzip: distdir\n\ttardir=$(distdir) && $(am__tar) | lzip -c $${LZIP_OPT--9} >$(distdir).tar.lz\n\t$(am__post_remove_distdir)\n\ndist-xz: distdir\n\ttardir=$(distdir) && $(am__tar) | XZ_OPT=$${XZ_OPT--e} xz -c >$(distdir).tar.xz\n\t$(am__post_remove_distdir)\n\ndist-tarZ: distdir\n\t@echo WARNING: \"Support for distribution archives compressed with\" \\\n\t\t       \"legacy program 'compress' is deprecated.\" >&2\n\t@echo WARNING: \"It will be removed altogether in Automake 2.0\" >&2\n\ttardir=$(distdir) && $(am__tar) | compress -c >$(distdir).tar.Z\n\t$(am__post_remove_distdir)\n\ndist-shar: distdir\n\t@echo WARNING: \"Support for shar distribution archives is\" \\\n\t               \"deprecated.\" >&2\n\t@echo WARNING: \"It will be removed altogether in Automake 2.0\" >&2\n\tshar $(distdir) | eval GZIP= gzip $(GZIP_ENV) -c >$(distdir).shar.gz\n\t$(am__post_remove_distdir)\n\ndist-zip: distdir\n\t-rm -f $(distdir).zip\n\tzip -rq $(distdir).zip $(distdir)\n\t$(am__post_remove_distdir)\n\ndist dist-all:\n\t$(MAKE) $(AM_MAKEFLAGS) $(DIST_TARGETS) am__post_remove_distdir='@:'\n\t$(am__post_remove_distdir)\n\n# This target untars the dist file and tries a VPATH configuration.  Then\n# it guarantees that the distribution is self-contained by making another\n# tarfile.\ndistcheck: dist\n\tcase '$(DIST_ARCHIVES)' in \\\n\t*.tar.gz*) \\\n\t  eval GZIP= gzip $(GZIP_ENV) -dc $(distdir).tar.gz | $(am__untar) ;;\\\n\t*.tar.bz2*) \\\n\t  bzip2 -dc $(distdir).tar.bz2 | $(am__untar) ;;\\\n\t*.tar.lz*) \\\n\t  lzip -dc $(distdir).tar.lz | $(am__untar) ;;\\\n\t*.tar.xz*) \\\n\t  xz -dc $(distdir).tar.xz | $(am__untar) ;;\\\n\t*.tar.Z*) \\\n\t  uncompress -c $(distdir).tar.Z | $(am__untar) ;;\\\n\t*.shar.gz*) \\\n\t  eval GZIP= gzip $(GZIP_ENV) -dc $(distdir).shar.gz | unshar ;;\\\n\t*.zip*) \\\n\t  unzip $(distdir).zip ;;\\\n\tesac\n\tchmod -R a-w $(distdir)\n\tchmod u+w $(distdir)\n\tmkdir $(distdir)/_build $(distdir)/_build/sub $(distdir)/_inst\n\tchmod a-w $(distdir)\n\ttest -d $(distdir)/_build || exit 0; \\\n\tdc_install_base=`$(am__cd) $(distdir)/_inst && pwd | sed -e 's,^[^:\\\\/]:[\\\\/],/,'` \\\n\t  && dc_destdir=\"$${TMPDIR-/tmp}/am-dc-$$$$/\" \\\n\t  && am__cwd=`pwd` \\\n\t  && $(am__cd) $(distdir)/_build/sub \\\n\t  && ../../configure \\\n\t    $(AM_DISTCHECK_CONFIGURE_FLAGS) \\\n\t    $(DISTCHECK_CONFIGURE_FLAGS) \\\n\t    --srcdir=../.. --prefix=\"$$dc_install_base\" \\\n\t  && $(MAKE) $(AM_MAKEFLAGS) \\\n\t  && $(MAKE) $(AM_MAKEFLAGS) dvi \\\n\t  && $(MAKE) $(AM_MAKEFLAGS) check \\\n\t  && $(MAKE) $(AM_MAKEFLAGS) install \\\n\t  && $(MAKE) $(AM_MAKEFLAGS) installcheck \\\n\t  && $(MAKE) $(AM_MAKEFLAGS) uninstall \\\n\t  && $(MAKE) $(AM_MAKEFLAGS) distuninstallcheck_dir=\"$$dc_install_base\" \\\n\t        distuninstallcheck \\\n\t  && chmod -R a-w \"$$dc_install_base\" \\\n\t  && ({ \\\n\t       (cd ../.. && umask 077 && mkdir \"$$dc_destdir\") \\\n\t       && $(MAKE) $(AM_MAKEFLAGS) DESTDIR=\"$$dc_destdir\" install \\\n\t       && $(MAKE) $(AM_MAKEFLAGS) DESTDIR=\"$$dc_destdir\" uninstall \\\n\t       && $(MAKE) $(AM_MAKEFLAGS) DESTDIR=\"$$dc_destdir\" \\\n\t            distuninstallcheck_dir=\"$$dc_destdir\" distuninstallcheck; \\\n\t      } || { rm -rf \"$$dc_destdir\"; exit 1; }) \\\n\t  && rm -rf \"$$dc_destdir\" \\\n\t  && $(MAKE) $(AM_MAKEFLAGS) dist \\\n\t  && rm -rf $(DIST_ARCHIVES) \\\n\t  && $(MAKE) $(AM_MAKEFLAGS) distcleancheck \\\n\t  && cd \"$$am__cwd\" \\\n\t  || exit 1\n\t$(am__post_remove_distdir)\n\t@(echo \"$(distdir) archives ready for distribution: \"; \\\n\t  list='$(DIST_ARCHIVES)'; for i in $$list; do echo $$i; done) | \\\n\t  sed -e 1h -e 1s/./=/g -e 1p -e 1x -e '$$p' -e '$$x'\ndistuninstallcheck:\n\t@test -n '$(distuninstallcheck_dir)' || { \\\n\t  echo 'ERROR: trying to run $@ with an empty' \\\n\t       '$$(distuninstallcheck_dir)' >&2; \\\n\t  exit 1; \\\n\t}; \\\n\t$(am__cd) '$(distuninstallcheck_dir)' || { \\\n\t  echo 'ERROR: cannot chdir into $(distuninstallcheck_dir)' >&2; \\\n\t  exit 1; \\\n\t}; \\\n\ttest `$(am__distuninstallcheck_listfiles) | wc -l` -eq 0 \\\n\t   || { echo \"ERROR: files left after uninstall:\" ; \\\n\t        if test -n \"$(DESTDIR)\"; then \\\n\t          echo \"  (check DESTDIR support)\"; \\\n\t        fi ; \\\n\t        $(distuninstallcheck_listfiles) ; \\\n\t        exit 1; } >&2\ndistcleancheck: distclean\n\t@if test '$(srcdir)' = . ; then \\\n\t  echo \"ERROR: distcleancheck can only run from a VPATH build\" ; \\\n\t  exit 1 ; \\\n\tfi\n\t@test `$(distcleancheck_listfiles) | wc -l` -eq 0 \\\n\t  || { echo \"ERROR: files left in build directory after distclean:\" ; \\\n\t       $(distcleancheck_listfiles) ; \\\n\t       exit 1; } >&2\ncheck-am: all-am\ncheck: check-recursive\nall-am: Makefile config.h\ninstalldirs: installdirs-recursive\ninstalldirs-am:\ninstall: install-recursive\ninstall-exec: install-exec-recursive\ninstall-data: install-data-recursive\nuninstall: uninstall-recursive\n\ninstall-am: all-am\n\t@$(MAKE) $(AM_MAKEFLAGS) install-exec-am install-data-am\n\ninstallcheck: installcheck-recursive\ninstall-strip:\n\tif test -z '$(STRIP)'; then \\\n\t  $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" \\\n\t    install_sh_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" INSTALL_STRIP_FLAG=-s \\\n\t      install; \\\n\telse \\\n\t  $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" \\\n\t    install_sh_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" INSTALL_STRIP_FLAG=-s \\\n\t    \"INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'\" install; \\\n\tfi\nmostlyclean-generic:\n\nclean-generic:\n\ndistclean-generic:\n\t-test -z \"$(CONFIG_CLEAN_FILES)\" || rm -f $(CONFIG_CLEAN_FILES)\n\t-test . = \"$(srcdir)\" || test -z \"$(CONFIG_CLEAN_VPATH_FILES)\" || rm -f $(CONFIG_CLEAN_VPATH_FILES)\n\nmaintainer-clean-generic:\n\t@echo \"This command is intended for maintainers to use\"\n\t@echo \"it deletes files that may require special tools to rebuild.\"\nclean: clean-recursive\n\nclean-am: clean-generic clean-libtool mostlyclean-am\n\ndistclean: distclean-recursive\n\t-rm -f $(am__CONFIG_DISTCLEAN_FILES)\n\t-rm -f Makefile\ndistclean-am: clean-am distclean-generic distclean-hdr \\\n\tdistclean-libtool distclean-tags\n\ndvi: dvi-recursive\n\ndvi-am:\n\nhtml: html-recursive\n\nhtml-am:\n\ninfo: info-recursive\n\ninfo-am:\n\ninstall-data-am:\n\ninstall-dvi: install-dvi-recursive\n\ninstall-dvi-am:\n\ninstall-exec-am:\n\ninstall-html: install-html-recursive\n\ninstall-html-am:\n\ninstall-info: install-info-recursive\n\ninstall-info-am:\n\ninstall-man:\n\ninstall-pdf: install-pdf-recursive\n\ninstall-pdf-am:\n\ninstall-ps: install-ps-recursive\n\ninstall-ps-am:\n\ninstallcheck-am:\n\nmaintainer-clean: maintainer-clean-recursive\n\t-rm -f $(am__CONFIG_DISTCLEAN_FILES)\n\t-rm -rf $(top_srcdir)/autom4te.cache\n\t-rm -f Makefile\nmaintainer-clean-am: distclean-am maintainer-clean-generic\n\nmostlyclean: mostlyclean-recursive\n\nmostlyclean-am: mostlyclean-generic mostlyclean-libtool\n\npdf: pdf-recursive\n\npdf-am:\n\nps: ps-recursive\n\nps-am:\n\nuninstall-am:\n\n.MAKE: $(am__recursive_targets) all install-am install-strip\n\n.PHONY: $(am__recursive_targets) CTAGS GTAGS TAGS all all-am \\\n\tam--refresh check check-am clean clean-cscope clean-generic \\\n\tclean-libtool cscope cscopelist-am ctags ctags-am dist \\\n\tdist-all dist-bzip2 dist-gzip dist-lzip dist-shar dist-tarZ \\\n\tdist-xz dist-zip distcheck distclean distclean-generic \\\n\tdistclean-hdr distclean-libtool distclean-tags distcleancheck \\\n\tdistdir distuninstallcheck dvi dvi-am html html-am info \\\n\tinfo-am install install-am install-data install-data-am \\\n\tinstall-dvi install-dvi-am install-exec install-exec-am \\\n\tinstall-html install-html-am install-info install-info-am \\\n\tinstall-man install-pdf install-pdf-am install-ps \\\n\tinstall-ps-am install-strip installcheck installcheck-am \\\n\tinstalldirs installdirs-am maintainer-clean \\\n\tmaintainer-clean-generic mostlyclean mostlyclean-generic \\\n\tmostlyclean-libtool pdf pdf-am ps ps-am tags tags-am uninstall \\\n\tuninstall-am\n\n.PRECIOUS: Makefile\n\n\n# Tell versions [3.59,3.63) of GNU make to not export all variables.\n# Otherwise a system limit (for SysV at least) may be exceeded.\n.NOEXPORT:\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/NEWS",
    "content": "OpenFst: Release 1.6\n    * Optimized label lookup in SymbolTable (1.6.9)\n    * Fixed PROGRAM_FLAGS documentation string in binaries (1.6.8)\n    * Fixed handling of symbol tables in EpsNormalize (1.6.8)\n    * Fixed HashMatcher issues with SetState() and Find() consistency (1.6.8)\n    * Fixed error reporting when FST arc type unknown (1.6.8)\n    * The `first_path` option to ShortestPath is now optimal for A* (1.6.7)\n    * Renames SymbolTable::kNoSymbol to kNoSymbol (1.6.7)\n    * Exposes PowerMapper to the scripting API (1.6.7)\n    * Fixes linking of the special SOs (1.6.7)\n    * Fixes error handling in HashMatcher (1.6.6)\n    * Adds kShortestDelta for operations dependent on shortest-distance (1.6.6)\n    * Adds Python methods for (un)pickling and (de)serializing FSTs (1.6.6)\n    * Adds constructive variants of Invert and Project (1.6.6)\n    * Increases code sharing in MemoryPool/MemoryArena (1.6.6)\n    * Improves consistency of matcher FST ownership (1.6.6)\n    * Adds non-trivial A* estimator class (1.6.6)\n    * Prevents unreachable code generation in libfstscript (1.6.5)\n    * Adds move constructors for non-trivial weight types (1.6.5)\n    * Standardizes method names for tuple weight types (1.6.5)\n    * Eliminates undefined behavior in weight hashing (1.6.5)\n    * Optimizes binary search in SortedMatcher (1.6.5)\n    * Adds SetWeight (1.6.5)\n    * Fixes typing error in Python FAR reader (1.6.4)\n    * Removes restriction that Prune argument have commutative weights (1.6.3)\n    * Improves configuration of CompositeWeight readers and writers (1.6.3)\n    * Improves accuracy of ShortestDistance summation (1.6.3)\n    * SetFinal now \"moves\" its weight argument (1.6.3)\n    * Exposes ArcIterator and EncodeMapper flags in Python (1.6.3)\n    * Properly sets return codes in FST binaries (1.6.3)\n    * Eliminates StringWeight macros (1.6.3)\n    * Finalizes most virtual method overrides (1.6.2)\n    * Fixes missing includes of <fst/log.h> (1.6.1)\n    * Adds float format support to FST drawing (1.6.1)\n    * Extensive modernization for C++11 style (1.6.0)\n    * Many classes and constants moved into an internal namespace (1.6.0)\n    * Adds HashMatcher (1.6.0)\n    * Adds Member method to SymbolTable (1.6.0)\n    * Adds the \"special\" extension and the fstspecial binary; this is similar to\n      fstconvert but accepts arguments for specifying special labels (phi, rho,\n      and sigma) of FSTs (1.6.0)\n    * Exposes allow_negative_label option for Python symbol tables (1.6.0)\n\nOpenFst: Release 1.5\n    * Added p-subsequential determinization (1.5.0)\n    * Generalized epsilon normalization to non-functional case (1.5.0)\n    * Added general gallic (plus is union) semiring (1.5.0)\n    * Added FST compression extension (1.5.0)\n    * Added Python extension (1.5.0)\n    * Added multiple pushdown transducer (MPDT) support (1.5.0)\n    * Fixed Isomorphic function (1.5.0)\n    * Added final method to matchers (1.5.0)\n    * Fixed various compiler issues (1.5.0)\n    * Fixed missing Isomorphic components (1.5.0)\n    * Added UnionWeight (1.5.0)\n    * Added InputEpsilonMapper and OutputEpsilonMapper arc mappers (1.5.1)\n    * Added TrivialComposeFilter for more efficient composition when one\n      of the arguments is epsilon-free (1.5.1)\n    * Added properties bits kUnweightedCycles and kWeightedCycles (1.5.1)\n    * Added missing const qualification to (1.5.1):\n      - SymbolTableIterator access\n      - EncodeMapper writing to file\n      - EncodeMapper SymbolTable access\n    * Replaced internal custom reference-counting (RefCounter) with\n      C++11 smart pointers where possible, and fixed associated\n      reference-counting bugs (1.5.1)\n    * When calling DeleteStates on a MutableFst with a shared impl, the impl\n      is set to a new empty impl rather than copying and deleting (1.5.1)\n    * Prepended `Pdt` to the Expand libraries and classes in the PDT\n      extension, and prepended `MPdt` to the Expand libraries and classes\n      in the MPDT extension, so that both can be used in the same compilation\n      unit (1.5.1)\n    * Added option to PDT Replace for compiling a strongly-regular RTN into a\n      bounded-stack PDT (1.5.1)\n    * Improved symbol table support for PDT Replace, including automatic\n      generation of parentheses symbols (1.5.1)\n    * Improvements to scripting API (1.5.1):\n      - Added methods for FST access and mutation\n      - Added additional checks for arc/weight compatibility\n      - WeightClass::One and WeightClass::Zero now require a specified weight\n        type at time of construction\n      - Improved VectorFstClass constructors\n      - Added linear-time check for cyclic dependencies in Replace\n      - Added EncodeMapperClass, a template-free box for an EncodeMapper\n    * Improvements to the binaries (1.5.1):\n      - Fixed no-op --precision flag to fstdraw (1.5.1)\n      - Fixed no-op --file_list_input flag to farcreate (1.5.1)\n    * Improvements to the Python extension (1.5.1):\n      - Added methods for creating an empty mutable FST\n      - Added methods for FST access via state and arc iteration\n      - Added FST compilation from arclists (cf. fstcompile)\n      - Added FST printing and drawing\n      - Added FarReader and FarWriter classes.\n    * FarReader's GetFst method now returns a pointer (1.5.2)\n    * Fixed FSTERROR macro (1.5.2)\n    * Fixed build flags for dlopen (1.5.2)\n    * Consolidated Python extension into single module (1.5.2)\n    * Python add_arc now takes an Arc object (1.5.2)\n    * Adds optional minimization of non-deterministic FSTs (1.5.3)\n    * Mutation methods of the Python Fst object now support chaining (1.5.3)\n    * Scripting API and Python weight objects now support semiring arithmetic\n      (1.5.3)\n    * Adds RemoveSymbol method to SymbolTable (1.5.4)\n    * Prevents underflow when using LogProbArcSelector in random generation\n      (1.5.4)\n    * Makes random weight generators a single template class (1.5.4)\n    * Makes weight Properties constexpr where possible (1.5.4)\n    * Adds check for error when opening files when compiling strings into FARs\n      (1.5.4)\n    * Adds routines for parsing string flags to the scripting API (1.5.4)\n\nOpenFst: Release 1.4\n    * Port to C++11 (1.4.0)\n    * Disambiguate function added (1.4.0)\n    * Isomorphic function added (1.4.0)\n    * Matcher interface augmented with Priority method.\n    * Special matchers (rho/sigma/phi) can match special symbols\n      on both input FSTs in composition/intersection provided at each\n      state pair they only match one side (1.4.0)\n    * Added ExplicitMatcher to suppress implicit matches (e.g. epsilon\n      self-loops) (1.4.0)\n    * Linear{Tagger,Classifier}Fst extensions added (1.4.0).\n    * Generalized state-reachable to work when input is cyclic (so long as no\n      final state is in a cycle). This ensures label-reachable (and hence label\n      lookahead) works with cyclic input (1.4.0)\n    * Added Condense to build the condensation graph (SCCs condensed to single\n      states) of an FST (1.4.0).\n    * Added an option to Reverse to specify whether a super-initial state\n      should always be created (1.4.0).\n    * Fixed bugs in FirstCacheStore, PowerWeight, and StringCompiler (1.4.0).\n    * Changed SymbolTable to use faster data structure (1.4.0).\n    * Added 'min' disambiguation in determinizaton to keep only the minimum\n      output in a non-functional transducer when plus=min/max\n      (flag --disambiguate_output) (1.4.1)\n    * Compiler issues in linear-fst fixed (1.4.1)\n\nOpenFst: Release 1.3\n    * Support for non-fatal exits on errors: (1.3.1)\n      - Added FLAGS_fst_error_fatal: FST errors are\n        fatal if true (default); o.w. return objects flagged as bad:\n        e.g., FSTs - kError\n        prop. true, FST weights - not a Member().\n      - Added kError property bit signifying bad FST\n      - Added  NoWeight() method to FST weight requirements that returns\n        weight that is not a Member().\n    * Various improvements to the FAR extensions (1.3.1)\n      - a single FST is now a FAR type\n      - FLAGS_initial_symbols: Uses the symbol table from the\n        first FST in the archive for all entries\"\n      - Input/output to standard input/output for some FAR and arc types\n    * --with-icu configuration option no longer needed (1.3.1)\n    * Improved flags usage esp. if use SET_FLAGS not SetFlags/InitFst (1.3.2)\n    * Added 'fst' as possible far writer type (1.3.2)\n    * phi matcher can now accept 0 as the phi label (1.3.2)\n    * Added ngram-fst extension (1.3.2)\n    * Improved performance of PDT composition (1.3.3)\n    * Memory-map support (1.3.3)\n    * Fixed cross-FST serialization issues (1.3.3)\n    * Fixed NGramFst off-by-one issue (1.3.3)\n    * farextract now allows one to specify a list of comma-separated keys,\n      including key ranges (1.3.3)\n    * Fixed bug in PDT replace that could cause close paren IDs to collide\n      with open paren IDs (1.3.4)\n\nOpenFst: Release 1.2\n    * Added lookahead matching and filtering for faster composition\n    * Added EditFst for mutation of o.w. immutable FSTs\n    * Added script sub-namespace defining type FstClass, a non-templated\n      Fst<Arc> to hold the arc template type internally. This and FST\n      operations on it allow easier I/O and scripting at the cost of some\n      runtime dispatching.\n    * Added per-arc-iterator control of Fst caching.\n    * Added PowerWeight and Power Arc.\n    * Added SparsePowerWeight and SparsePowerArc (1.2.4)\n    * Added SignedLogWeight and SignedLogArc (1.2.4)\n    * Added ExpectationWeight and ExpectationArc (1.2.4)\n    * Added AStarQueue, PruneQueue and NaturalPruneQueue disciplines (1.2.6)\n    * Added Log64Weight and Log64Arc to FST library throughout, including \n      support throughout scripts/bins/dsos (1.2.8)\n    * Added delayed RandGenFst that outputs tree of paths weighted\n      by count (1.2.8)\n    * Added fstsymbols shell-level command\n    * Added total weight removal option to pushing\n    * Changed methods for symbol table mutation:\n      use MutableInputSymbols()/MutableOutputSymbols().\n    * Numerous efficiency improvements esp in composition, replace, and caching\n    * Made \"fstmap\" handle semiring conversion by adding \"to_std\", \"to_log\"\n      and \"to_log64\" as supported 'map_type' arguments (1.2.8).\n    * Made the destructive implementation of RmEpsilon skip over states\n      admitting no non-epsilon incoming transition (1.2.8).\n    * Fixed numerous bugs (1.2 through 1.2.9) including:\n      - improper types of some approximation deltas\n      - sub-optimal hashing functions\n      - issues in internal reuse of shortest distance\n      - hashing bug in FloatWeight\n      - bug in shortest path queue\n      - symbol table checksumming issues\n      - various C++ standards issues\n      - Visit() behavior when visitation aborted\n      - Decode() hash performance bug (1.2.1)\n      - EditFst::Copy(bool) method when the boolean parameter is true (1.2.7)\n      - SymbolTable memory leak in Invert() (1.2.8)\n      - Added escaping of \" and \\ in labels in fstdraw, needed for dot to\n        function properly (1.2.8)\n      - Fixed handling of final weight of start state in fstpush (1.2.8)\n      - Added FST_LL_FORMAT to fix 64-bit integer printf issues (1.2.9)\n      - Fixed missing <functional> includes (1.2.9)\n      - Fixed reused local variable names (1.2.9)\n      - Fixed passing string by reference in FstDraw args (1.2.9)\n    * Added extensions directories including:\n      - finite-state archive (FAR) utilities,\n        added stlist format supporting writing/reading to/from standard out/in\n        at the library-level (1.2.8)\n      - compact fsts\n      - lookahead fsts\n      - pushdown transducers (improved in 1.2.1 through 1.2.7).\n    * Added StateMap/StateMapFst; renamed Map/MapFst to ArcMap/ArcMapFst;\n      map/MapFst retained (but deprecated) (1.2.9)\n    * Deleted ArcSum() and ArcMerge; use StateMap w/ ArcSumMapper and\n      ArcUniqueMapper (1.2.9).\n    * Incremented version of ConstFst/CompactFsts to stop memory alignment\n      that fails on pipes. Made old version raises errors when read on\n      pipes (1.2.9).\n    * Improved determinize hash (1.2.9)\n    * Removed stdio uses (1.2.10)\n    * Fixed library ordering issues esp. with newer GNU build tools (1.2.10)\n\nOpenFst: Release 1.1\n    * Added compat.h to src/include/fst to fix missing defines\n    * Fixed bug in acyclic minimization that led to non-minimal\n      (but equivalent) results\n    * Fixed missing FST typedef in various matchers in matcher.h\n      so that they can be cascaded\n    * Opened file streams binary where appropriate\n\nOpenFst: Release 1.0 (Additions to beta version):\n    * Matcher class added for matching labels at FST states. Includes\n      special matchers for sigma (any), rho ('rest'), and phi ('fail')\n      labels.\n    * Composition generalized with arbitrary filters, matchers, and state\n      tables.\n    * Sequence and matching composition filters provided. (see compose.h,\n      compose-filter.h, matcher.h, state-table.h)\n    * Unique n-best (see shortest-path.h)\n    * Pruning in determinization and epsilon removal (see determinize.h,\n      rmepsilon.h)\n    * New Fst class:\n       * Compact Fsts for space-efficient representation (see compact-fst.h)\n    * New Weight classes:\n       * MinMax\n       * Lexicographic\n    * Miscellaneous bug fixes\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/README",
    "content": "OpenFst: Release 1.6.9.\n\nOpenFst is a library for constructing, combining, optimizing, and searching\nweighted finite-state transducers (FSTs).\n\nREQUIREMENTS:\n  This version is known to work under Linux using g++ (>= 4.7) and OS X using\n  XCode (>= 5). It is expected to work wherever adequate POSIX (dlopen,\n  ssize_t, basename), C99 (snprintf, strtoll, <stdint.h>), and C++11\n  (<unordered_set>, <unordered_map>, <forward_list>) support is available.\n\nINSTALLATION:\n  Follow the generic GNU build system instructions in ./INSTALL. We\n  recommend configuring with --enable-static=no for faster compiles.\n\n  Optional features:\n\n  --enable-bin             Enable fst::script and executables (def: yes)\n  --enable-compact-fsts    Enable CompactFst extensions (def: no)\n  --enable-compress        Enable compression extension (def: no)\n  --enable-const-fsts      Enable ConstFst extensions (def: no)\n  --enable-far             Enable FAR extensions (def: no)\n  --enable-grm             Enable all dependencies of OpenGrm (def: no)\n  --enable-linear-fsts     Enable LinearTagger/ClassifierFst extensions (def: no)\n  --enable-lookahead-fsts  Enable LookAheadFst extensions (def: no)\n  --enable-mpdt            Enable MPDT extensions (def: no)\n  --enable-ngram-fsts      Enable NGramFst extensions (def: no)\n  --enable-pdt             Enable PDT extensions (def: no)\n  --enable-python          Enable Python extension (def: no)\n  --enable-special         Enable special-matcher extensions (def: no)\n\n  Configuring with --enable-bin=no gives very fast compiles, but excludes the\n  command line utilities.\n\n  Configuring with --enable-python will attempt to install the Python module to\n  whichever site-packages (or dist-packages, on Debian or Ubuntu) is found\n  during configuration.\n\n  The flag --with-libfstdir specifies where FST extensions should be installed;\n  it defaults to ${libdir}/fst.\n\n  Compiling with -Wall -Wno-sign-compare under g++ should give no warnings from\n  this library.\n\n  If you encounter an error about loading shared objects when attempting to use\n  the library immediately after installation, (e.g, `...cannot open shared\n  object file...`) you may need to refresh your system's shared object cache.\n  On Linux, this is accomplished by invoking ldconfig; the corresponding command\n  on OS X is called update_dyld_shared_cache. Both of these require superuser\n  privileges (and so should be executed with sudo).\n\nUSAGE:\n  Assuming you've installed under the default /usr/local, the FST binaries are\n  found on /usr/local/bin.\n\n  To use in your own program, include <fst/fstlib.h> and compile with \n  -I/usr/local/include. The compiler must support C++11 (for g++ add the flag\n  -std=c++11). Link against /usr/local/lib/libfst.so and -ldl. Set your\n  LD_LIBRARY_PATH (or equivalent) to contain /usr/local/lib. The linking is,\n  by default, dynamic so that the Fst and Arc type DSO extensions can be used\n  correctly if desired. Any extensions will be found under /usr/local/lib/fst\n  or /usr/local/include/fst/extensions.\n\nDOCUMENTATION:\n  See www.openfst.org for general documentation.\n  See ./NEWS for updates since the last release.\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/README.md",
    "content": "# OpenFST port for Windows\n\nOpenFst is a library for constructing, combining, optimizing, and searching\nweighted finite-state transducers (FSTs), maintained by Google and released\nunder the [Apache 2.0 license](./COPYING). The home page for the library is\nlocated at http://openfst.org/. Check the [original README file](./README)\nfor the current version, as we are not updating this file with the current\nrelease version. Make sure also to check the [NEWS](./NEWS) file for the\nlatest changes.\n\n## Releases\n\nWe track [original releases](http://www.openfst.org/twiki/bin/view/FST/FstDownload)\nof the library, and try to keep [ours](https://github.com/kkm000/openfst/releases)\nin step. Sometimes we may skip a release, but we strive for that to be rather an\nexception. With each release, we drop a set of pre-built .exe files compiled for\nthe x64 architecture and optimized for execution speed. We use the latest\nMicrosoft compilers for it, so you may find you need to download and install the\nlatest Microsoft C runtime. See [Microsoft KB2977003](https://support.microsoft.com/help/2977003/)\nfor instructions.\n\nWe do not release pre-built libraries, however, because Microsoft compiler ABI\nchanges between versions, and is different for Debug and Release builds. You\nmust build a library matching your toolset on your own.\n\n## Build\n\nThere are two build options: Visual Studio and CMake. We maintain a set of\nbuild scripts for both. You will need a recent enough Visual Studio for either\nbuild flavor. Microsoft provides an option to download the free Visual Studio\n[Community Edition](https://visualstudio.microsoft.com/downloads/), which is\nadequate.\n\n### Visual Studio\n\nOpen `openfst.sln`, then read the comments in files under the \"READ ME BEFORE\nBUILD\" solution folder. Generally, you may just hit Build and get the\nlibraries, unless you need fine-tuning, such as selecting a different toolset,\nor want to build with MSBuild from command line. The solutions builds only\nstatic libraries, with debug information embedded in C7 format for the\nsimplicity of use. Set the platform to `x86` or `x64` to build a respective\n32- or 64-bit version of the library and tools.\n\nThe `bin` project builds multiple executable files by invoking itself\nrecursively once for each executable. All .vcxproj files have been scripted and\nare maintained by hand. It takes a long time to build in Release mode. If you\nonly need the libfst library, build it alone from the Project Explorer.\n\nAll build outputs are placed into the `build_output` directory under the\nsolution root.\n\n### CMake\n\nFollow the normal CMake build procedure to generate build files. With CMake you\nhave an option of building dynamic libraries shared by the executables.\n\n## Limitations\n\n* Memory-mapped files are not supported (we may add the support in the future\n  though), because it is very system-dependent. OpenFST supports reading e. g.\n  CompactFST files into allocated memoty when memory mapping is not compiled in.\n* Dynamic registration of arc and FST types is not supported in the Visual Studio\n  project versions (as they build only static libraries). CMake build does not\n  have this limitation. Due to ABI being specific to Microsoft compiler version,\n  dynamically registered types must be compiled with strictly the same compiler\n  of the same major version, and mostly same build flags. This is quite hard to\n  get right, and is not recommended.\n\n## Structure of the repository and tagging\n\nThe `original` branch contains only imported original OpenFST files, with one\nexception of .gitignore file added. Tags of the form `orig/1.6.9.1` specify the\nversion and revision number of the library. Every commit on the `orignal` branch\ncontains the source URL for the tarball release of OpenFST that was committed.\nThe last version point corresponds to the revision of OpenFST version. Most (but\nnot all) of the versions has had only one revision, and therefore end in `.1`.\nThe `winport` branch contains the port, with corresponding tags of the form\n`win/1.6.9.1`.\n\nYou can review the changes to source code only with the git command e. g.\n\n`git diff orig/1.6.9.1..win/1.6.9.1 -- \"*.cc\" \"*.h\"`\n\nThe GitHub interface does not provide filtering by extension, so you will see\nall CMakefiles and MSBuild files added, but it may be useful if you want to\nexamine changes in a particular file.\n\nWe try to keep changes to an absolute minimum. Most of them are due to\nincompatibilities between the gcc and cl compilers, and only a minor portion\nis due to the differences between the Linux and Windows platforms.\n\n## Maintainers\n\nThe repository is maintained by [@kkm000](https://github.com/kkm000) and\n[@jtrmal](https://github.com/jtrmal).\n\nOpen an issue to let us know if you discover a problem with the port. We react\nto them promptly. Be sure to include a problem description, error text id any,\nand the compiler or Visual Studio version (and CMake version, if you use it).\nDo not hesitate to ask questions. We will try to help you.\n\nSince we do not (by the definition of port) extend the OpenFST library itself,\nplease contact its authors with questions and suggestions related to the\noriginal library. If in doubt, contact both teams.\n\nAlso let us know if you have a related development that you believe should be\nlinked to from this file.\n\n---\n\n_Copyright (c) 2008-current Google Inc._  \n_Copyright (c) 2016-current SmartAction LLC (kkm)_  \n_Copyright (c) 2016-current Johns Hopkins University (J. Trmal)_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/README.mozilla",
    "content": "openfst-1.6.9-win source downloaded from https://github.com/kkm000/openfst on 2018/12/10\n\nThis corresponds to https://github.com/kkm000/openfst/commit/d4dd88e17393454e252d4644b39cf496a8cd9cac\n\nThe following procedure was needed to compile with BAZEL 0.17.2:\n\nUsed VS CODE to rename the following types:\n    uint64 -> uint64_t\n    uint32 -> uint32_t\n    uint16 -> uint16_t"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/aclocal.m4",
    "content": "# generated automatically by aclocal 1.15.1 -*- Autoconf -*-\n\n# Copyright (C) 1996-2017 Free Software Foundation, Inc.\n\n# This file is free software; the Free Software Foundation\n# gives unlimited permission to copy and/or distribute it,\n# with or without modifications, as long as this notice is preserved.\n\n# This program is distributed in the hope that it will be useful,\n# but WITHOUT ANY WARRANTY, to the extent permitted by law; without\n# even the implied warranty of MERCHANTABILITY or FITNESS FOR A\n# PARTICULAR PURPOSE.\n\nm4_ifndef([AC_CONFIG_MACRO_DIRS], [m4_defun([_AM_CONFIG_MACRO_DIRS], [])m4_defun([AC_CONFIG_MACRO_DIRS], [_AM_CONFIG_MACRO_DIRS($@)])])\nm4_ifndef([AC_AUTOCONF_VERSION],\n  [m4_copy([m4_PACKAGE_VERSION], [AC_AUTOCONF_VERSION])])dnl\nm4_if(m4_defn([AC_AUTOCONF_VERSION]), [2.69],,\n[m4_warning([this file was generated for autoconf 2.69.\nYou have another version of autoconf.  It may work, but is not guaranteed to.\nIf you have problems, you may need to regenerate the build system entirely.\nTo do so, use the procedure documented by the package, typically 'autoreconf'.])])\n\n# Copyright (C) 2002-2017 Free Software Foundation, Inc.\n#\n# This file is free software; the Free Software Foundation\n# gives unlimited permission to copy and/or distribute it,\n# with or without modifications, as long as this notice is preserved.\n\n# AM_AUTOMAKE_VERSION(VERSION)\n# ----------------------------\n# Automake X.Y traces this macro to ensure aclocal.m4 has been\n# generated from the m4 files accompanying Automake X.Y.\n# (This private macro should not be called outside this file.)\nAC_DEFUN([AM_AUTOMAKE_VERSION],\n[am__api_version='1.15'\ndnl Some users find AM_AUTOMAKE_VERSION and mistake it for a way to\ndnl require some minimum version.  Point them to the right macro.\nm4_if([$1], [1.15.1], [],\n      [AC_FATAL([Do not call $0, use AM_INIT_AUTOMAKE([$1]).])])dnl\n])\n\n# _AM_AUTOCONF_VERSION(VERSION)\n# -----------------------------\n# aclocal traces this macro to find the Autoconf version.\n# This is a private macro too.  Using m4_define simplifies\n# the logic in aclocal, which can simply ignore this definition.\nm4_define([_AM_AUTOCONF_VERSION], [])\n\n# AM_SET_CURRENT_AUTOMAKE_VERSION\n# -------------------------------\n# Call AM_AUTOMAKE_VERSION and AM_AUTOMAKE_VERSION so they can be traced.\n# This function is AC_REQUIREd by AM_INIT_AUTOMAKE.\nAC_DEFUN([AM_SET_CURRENT_AUTOMAKE_VERSION],\n[AM_AUTOMAKE_VERSION([1.15.1])dnl\nm4_ifndef([AC_AUTOCONF_VERSION],\n  [m4_copy([m4_PACKAGE_VERSION], [AC_AUTOCONF_VERSION])])dnl\n_AM_AUTOCONF_VERSION(m4_defn([AC_AUTOCONF_VERSION]))])\n\n# Copyright (C) 2011-2017 Free Software Foundation, Inc.\n#\n# This file is free software; the Free Software Foundation\n# gives unlimited permission to copy and/or distribute it,\n# with or without modifications, as long as this notice is preserved.\n\n# AM_PROG_AR([ACT-IF-FAIL])\n# -------------------------\n# Try to determine the archiver interface, and trigger the ar-lib wrapper\n# if it is needed.  If the detection of archiver interface fails, run\n# ACT-IF-FAIL (default is to abort configure with a proper error message).\nAC_DEFUN([AM_PROG_AR],\n[AC_BEFORE([$0], [LT_INIT])dnl\nAC_BEFORE([$0], [AC_PROG_LIBTOOL])dnl\nAC_REQUIRE([AM_AUX_DIR_EXPAND])dnl\nAC_REQUIRE_AUX_FILE([ar-lib])dnl\nAC_CHECK_TOOLS([AR], [ar lib \"link -lib\"], [false])\n: ${AR=ar}\n\nAC_CACHE_CHECK([the archiver ($AR) interface], [am_cv_ar_interface],\n  [AC_LANG_PUSH([C])\n   am_cv_ar_interface=ar\n   AC_COMPILE_IFELSE([AC_LANG_SOURCE([[int some_variable = 0;]])],\n     [am_ar_try='$AR cru libconftest.a conftest.$ac_objext >&AS_MESSAGE_LOG_FD'\n      AC_TRY_EVAL([am_ar_try])\n      if test \"$ac_status\" -eq 0; then\n        am_cv_ar_interface=ar\n      else\n        am_ar_try='$AR -NOLOGO -OUT:conftest.lib conftest.$ac_objext >&AS_MESSAGE_LOG_FD'\n        AC_TRY_EVAL([am_ar_try])\n        if test \"$ac_status\" -eq 0; then\n          am_cv_ar_interface=lib\n        else\n          am_cv_ar_interface=unknown\n        fi\n      fi\n      rm -f conftest.lib libconftest.a\n     ])\n   AC_LANG_POP([C])])\n\ncase $am_cv_ar_interface in\nar)\n  ;;\nlib)\n  # Microsoft lib, so override with the ar-lib wrapper script.\n  # FIXME: It is wrong to rewrite AR.\n  # But if we don't then we get into trouble of one sort or another.\n  # A longer-term fix would be to have automake use am__AR in this case,\n  # and then we could set am__AR=\"$am_aux_dir/ar-lib \\$(AR)\" or something\n  # similar.\n  AR=\"$am_aux_dir/ar-lib $AR\"\n  ;;\nunknown)\n  m4_default([$1],\n             [AC_MSG_ERROR([could not determine $AR interface])])\n  ;;\nesac\nAC_SUBST([AR])dnl\n])\n\n# AM_AUX_DIR_EXPAND                                         -*- Autoconf -*-\n\n# Copyright (C) 2001-2017 Free Software Foundation, Inc.\n#\n# This file is free software; the Free Software Foundation\n# gives unlimited permission to copy and/or distribute it,\n# with or without modifications, as long as this notice is preserved.\n\n# For projects using AC_CONFIG_AUX_DIR([foo]), Autoconf sets\n# $ac_aux_dir to '$srcdir/foo'.  In other projects, it is set to\n# '$srcdir', '$srcdir/..', or '$srcdir/../..'.\n#\n# Of course, Automake must honor this variable whenever it calls a\n# tool from the auxiliary directory.  The problem is that $srcdir (and\n# therefore $ac_aux_dir as well) can be either absolute or relative,\n# depending on how configure is run.  This is pretty annoying, since\n# it makes $ac_aux_dir quite unusable in subdirectories: in the top\n# source directory, any form will work fine, but in subdirectories a\n# relative path needs to be adjusted first.\n#\n# $ac_aux_dir/missing\n#    fails when called from a subdirectory if $ac_aux_dir is relative\n# $top_srcdir/$ac_aux_dir/missing\n#    fails if $ac_aux_dir is absolute,\n#    fails when called from a subdirectory in a VPATH build with\n#          a relative $ac_aux_dir\n#\n# The reason of the latter failure is that $top_srcdir and $ac_aux_dir\n# are both prefixed by $srcdir.  In an in-source build this is usually\n# harmless because $srcdir is '.', but things will broke when you\n# start a VPATH build or use an absolute $srcdir.\n#\n# So we could use something similar to $top_srcdir/$ac_aux_dir/missing,\n# iff we strip the leading $srcdir from $ac_aux_dir.  That would be:\n#   am_aux_dir='\\$(top_srcdir)/'`expr \"$ac_aux_dir\" : \"$srcdir//*\\(.*\\)\"`\n# and then we would define $MISSING as\n#   MISSING=\"\\${SHELL} $am_aux_dir/missing\"\n# This will work as long as MISSING is not called from configure, because\n# unfortunately $(top_srcdir) has no meaning in configure.\n# However there are other variables, like CC, which are often used in\n# configure, and could therefore not use this \"fixed\" $ac_aux_dir.\n#\n# Another solution, used here, is to always expand $ac_aux_dir to an\n# absolute PATH.  The drawback is that using absolute paths prevent a\n# configured tree to be moved without reconfiguration.\n\nAC_DEFUN([AM_AUX_DIR_EXPAND],\n[AC_REQUIRE([AC_CONFIG_AUX_DIR_DEFAULT])dnl\n# Expand $ac_aux_dir to an absolute path.\nam_aux_dir=`cd \"$ac_aux_dir\" && pwd`\n])\n\n# AM_CONDITIONAL                                            -*- Autoconf -*-\n\n# Copyright (C) 1997-2017 Free Software Foundation, Inc.\n#\n# This file is free software; the Free Software Foundation\n# gives unlimited permission to copy and/or distribute it,\n# with or without modifications, as long as this notice is preserved.\n\n# AM_CONDITIONAL(NAME, SHELL-CONDITION)\n# -------------------------------------\n# Define a conditional.\nAC_DEFUN([AM_CONDITIONAL],\n[AC_PREREQ([2.52])dnl\n m4_if([$1], [TRUE],  [AC_FATAL([$0: invalid condition: $1])],\n       [$1], [FALSE], [AC_FATAL([$0: invalid condition: $1])])dnl\nAC_SUBST([$1_TRUE])dnl\nAC_SUBST([$1_FALSE])dnl\n_AM_SUBST_NOTMAKE([$1_TRUE])dnl\n_AM_SUBST_NOTMAKE([$1_FALSE])dnl\nm4_define([_AM_COND_VALUE_$1], [$2])dnl\nif $2; then\n  $1_TRUE=\n  $1_FALSE='#'\nelse\n  $1_TRUE='#'\n  $1_FALSE=\nfi\nAC_CONFIG_COMMANDS_PRE(\n[if test -z \"${$1_TRUE}\" && test -z \"${$1_FALSE}\"; then\n  AC_MSG_ERROR([[conditional \"$1\" was never defined.\nUsually this means the macro was only invoked conditionally.]])\nfi])])\n\n# Copyright (C) 1999-2017 Free Software Foundation, Inc.\n#\n# This file is free software; the Free Software Foundation\n# gives unlimited permission to copy and/or distribute it,\n# with or without modifications, as long as this notice is preserved.\n\n\n# There are a few dirty hacks below to avoid letting 'AC_PROG_CC' be\n# written in clear, in which case automake, when reading aclocal.m4,\n# will think it sees a *use*, and therefore will trigger all it's\n# C support machinery.  Also note that it means that autoscan, seeing\n# CC etc. in the Makefile, will ask for an AC_PROG_CC use...\n\n\n# _AM_DEPENDENCIES(NAME)\n# ----------------------\n# See how the compiler implements dependency checking.\n# NAME is \"CC\", \"CXX\", \"OBJC\", \"OBJCXX\", \"UPC\", or \"GJC\".\n# We try a few techniques and use that to set a single cache variable.\n#\n# We don't AC_REQUIRE the corresponding AC_PROG_CC since the latter was\n# modified to invoke _AM_DEPENDENCIES(CC); we would have a circular\n# dependency, and given that the user is not expected to run this macro,\n# just rely on AC_PROG_CC.\nAC_DEFUN([_AM_DEPENDENCIES],\n[AC_REQUIRE([AM_SET_DEPDIR])dnl\nAC_REQUIRE([AM_OUTPUT_DEPENDENCY_COMMANDS])dnl\nAC_REQUIRE([AM_MAKE_INCLUDE])dnl\nAC_REQUIRE([AM_DEP_TRACK])dnl\n\nm4_if([$1], [CC],   [depcc=\"$CC\"   am_compiler_list=],\n      [$1], [CXX],  [depcc=\"$CXX\"  am_compiler_list=],\n      [$1], [OBJC], [depcc=\"$OBJC\" am_compiler_list='gcc3 gcc'],\n      [$1], [OBJCXX], [depcc=\"$OBJCXX\" am_compiler_list='gcc3 gcc'],\n      [$1], [UPC],  [depcc=\"$UPC\"  am_compiler_list=],\n      [$1], [GCJ],  [depcc=\"$GCJ\"  am_compiler_list='gcc3 gcc'],\n                    [depcc=\"$$1\"   am_compiler_list=])\n\nAC_CACHE_CHECK([dependency style of $depcc],\n               [am_cv_$1_dependencies_compiler_type],\n[if test -z \"$AMDEP_TRUE\" && test -f \"$am_depcomp\"; then\n  # We make a subdir and do the tests there.  Otherwise we can end up\n  # making bogus files that we don't know about and never remove.  For\n  # instance it was reported that on HP-UX the gcc test will end up\n  # making a dummy file named 'D' -- because '-MD' means \"put the output\n  # in D\".\n  rm -rf conftest.dir\n  mkdir conftest.dir\n  # Copy depcomp to subdir because otherwise we won't find it if we're\n  # using a relative directory.\n  cp \"$am_depcomp\" conftest.dir\n  cd conftest.dir\n  # We will build objects and dependencies in a subdirectory because\n  # it helps to detect inapplicable dependency modes.  For instance\n  # both Tru64's cc and ICC support -MD to output dependencies as a\n  # side effect of compilation, but ICC will put the dependencies in\n  # the current directory while Tru64 will put them in the object\n  # directory.\n  mkdir sub\n\n  am_cv_$1_dependencies_compiler_type=none\n  if test \"$am_compiler_list\" = \"\"; then\n     am_compiler_list=`sed -n ['s/^#*\\([a-zA-Z0-9]*\\))$/\\1/p'] < ./depcomp`\n  fi\n  am__universal=false\n  m4_case([$1], [CC],\n    [case \" $depcc \" in #(\n     *\\ -arch\\ *\\ -arch\\ *) am__universal=true ;;\n     esac],\n    [CXX],\n    [case \" $depcc \" in #(\n     *\\ -arch\\ *\\ -arch\\ *) am__universal=true ;;\n     esac])\n\n  for depmode in $am_compiler_list; do\n    # Setup a source with many dependencies, because some compilers\n    # like to wrap large dependency lists on column 80 (with \\), and\n    # we should not choose a depcomp mode which is confused by this.\n    #\n    # We need to recreate these files for each test, as the compiler may\n    # overwrite some of them when testing with obscure command lines.\n    # This happens at least with the AIX C compiler.\n    : > sub/conftest.c\n    for i in 1 2 3 4 5 6; do\n      echo '#include \"conftst'$i'.h\"' >> sub/conftest.c\n      # Using \": > sub/conftst$i.h\" creates only sub/conftst1.h with\n      # Solaris 10 /bin/sh.\n      echo '/* dummy */' > sub/conftst$i.h\n    done\n    echo \"${am__include} ${am__quote}sub/conftest.Po${am__quote}\" > confmf\n\n    # We check with '-c' and '-o' for the sake of the \"dashmstdout\"\n    # mode.  It turns out that the SunPro C++ compiler does not properly\n    # handle '-M -o', and we need to detect this.  Also, some Intel\n    # versions had trouble with output in subdirs.\n    am__obj=sub/conftest.${OBJEXT-o}\n    am__minus_obj=\"-o $am__obj\"\n    case $depmode in\n    gcc)\n      # This depmode causes a compiler race in universal mode.\n      test \"$am__universal\" = false || continue\n      ;;\n    nosideeffect)\n      # After this tag, mechanisms are not by side-effect, so they'll\n      # only be used when explicitly requested.\n      if test \"x$enable_dependency_tracking\" = xyes; then\n\tcontinue\n      else\n\tbreak\n      fi\n      ;;\n    msvc7 | msvc7msys | msvisualcpp | msvcmsys)\n      # This compiler won't grok '-c -o', but also, the minuso test has\n      # not run yet.  These depmodes are late enough in the game, and\n      # so weak that their functioning should not be impacted.\n      am__obj=conftest.${OBJEXT-o}\n      am__minus_obj=\n      ;;\n    none) break ;;\n    esac\n    if depmode=$depmode \\\n       source=sub/conftest.c object=$am__obj \\\n       depfile=sub/conftest.Po tmpdepfile=sub/conftest.TPo \\\n       $SHELL ./depcomp $depcc -c $am__minus_obj sub/conftest.c \\\n         >/dev/null 2>conftest.err &&\n       grep sub/conftst1.h sub/conftest.Po > /dev/null 2>&1 &&\n       grep sub/conftst6.h sub/conftest.Po > /dev/null 2>&1 &&\n       grep $am__obj sub/conftest.Po > /dev/null 2>&1 &&\n       ${MAKE-make} -s -f confmf > /dev/null 2>&1; then\n      # icc doesn't choke on unknown options, it will just issue warnings\n      # or remarks (even with -Werror).  So we grep stderr for any message\n      # that says an option was ignored or not supported.\n      # When given -MP, icc 7.0 and 7.1 complain thusly:\n      #   icc: Command line warning: ignoring option '-M'; no argument required\n      # The diagnosis changed in icc 8.0:\n      #   icc: Command line remark: option '-MP' not supported\n      if (grep 'ignoring option' conftest.err ||\n          grep 'not supported' conftest.err) >/dev/null 2>&1; then :; else\n        am_cv_$1_dependencies_compiler_type=$depmode\n        break\n      fi\n    fi\n  done\n\n  cd ..\n  rm -rf conftest.dir\nelse\n  am_cv_$1_dependencies_compiler_type=none\nfi\n])\nAC_SUBST([$1DEPMODE], [depmode=$am_cv_$1_dependencies_compiler_type])\nAM_CONDITIONAL([am__fastdep$1], [\n  test \"x$enable_dependency_tracking\" != xno \\\n  && test \"$am_cv_$1_dependencies_compiler_type\" = gcc3])\n])\n\n\n# AM_SET_DEPDIR\n# -------------\n# Choose a directory name for dependency files.\n# This macro is AC_REQUIREd in _AM_DEPENDENCIES.\nAC_DEFUN([AM_SET_DEPDIR],\n[AC_REQUIRE([AM_SET_LEADING_DOT])dnl\nAC_SUBST([DEPDIR], [\"${am__leading_dot}deps\"])dnl\n])\n\n\n# AM_DEP_TRACK\n# ------------\nAC_DEFUN([AM_DEP_TRACK],\n[AC_ARG_ENABLE([dependency-tracking], [dnl\nAS_HELP_STRING(\n  [--enable-dependency-tracking],\n  [do not reject slow dependency extractors])\nAS_HELP_STRING(\n  [--disable-dependency-tracking],\n  [speeds up one-time build])])\nif test \"x$enable_dependency_tracking\" != xno; then\n  am_depcomp=\"$ac_aux_dir/depcomp\"\n  AMDEPBACKSLASH='\\'\n  am__nodep='_no'\nfi\nAM_CONDITIONAL([AMDEP], [test \"x$enable_dependency_tracking\" != xno])\nAC_SUBST([AMDEPBACKSLASH])dnl\n_AM_SUBST_NOTMAKE([AMDEPBACKSLASH])dnl\nAC_SUBST([am__nodep])dnl\n_AM_SUBST_NOTMAKE([am__nodep])dnl\n])\n\n# Generate code to set up dependency tracking.              -*- Autoconf -*-\n\n# Copyright (C) 1999-2017 Free Software Foundation, Inc.\n#\n# This file is free software; the Free Software Foundation\n# gives unlimited permission to copy and/or distribute it,\n# with or without modifications, as long as this notice is preserved.\n\n\n# _AM_OUTPUT_DEPENDENCY_COMMANDS\n# ------------------------------\nAC_DEFUN([_AM_OUTPUT_DEPENDENCY_COMMANDS],\n[{\n  # Older Autoconf quotes --file arguments for eval, but not when files\n  # are listed without --file.  Let's play safe and only enable the eval\n  # if we detect the quoting.\n  case $CONFIG_FILES in\n  *\\'*) eval set x \"$CONFIG_FILES\" ;;\n  *)   set x $CONFIG_FILES ;;\n  esac\n  shift\n  for mf\n  do\n    # Strip MF so we end up with the name of the file.\n    mf=`echo \"$mf\" | sed -e 's/:.*$//'`\n    # Check whether this is an Automake generated Makefile or not.\n    # We used to match only the files named 'Makefile.in', but\n    # some people rename them; so instead we look at the file content.\n    # Grep'ing the first line is not enough: some people post-process\n    # each Makefile.in and add a new line on top of each file to say so.\n    # Grep'ing the whole file is not good either: AIX grep has a line\n    # limit of 2048, but all sed's we know have understand at least 4000.\n    if sed -n 's,^#.*generated by automake.*,X,p' \"$mf\" | grep X >/dev/null 2>&1; then\n      dirpart=`AS_DIRNAME(\"$mf\")`\n    else\n      continue\n    fi\n    # Extract the definition of DEPDIR, am__include, and am__quote\n    # from the Makefile without running 'make'.\n    DEPDIR=`sed -n 's/^DEPDIR = //p' < \"$mf\"`\n    test -z \"$DEPDIR\" && continue\n    am__include=`sed -n 's/^am__include = //p' < \"$mf\"`\n    test -z \"$am__include\" && continue\n    am__quote=`sed -n 's/^am__quote = //p' < \"$mf\"`\n    # Find all dependency output files, they are included files with\n    # $(DEPDIR) in their names.  We invoke sed twice because it is the\n    # simplest approach to changing $(DEPDIR) to its actual value in the\n    # expansion.\n    for file in `sed -n \"\n      s/^$am__include $am__quote\\(.*(DEPDIR).*\\)$am__quote\"'$/\\1/p' <\"$mf\" | \\\n\t sed -e 's/\\$(DEPDIR)/'\"$DEPDIR\"'/g'`; do\n      # Make sure the directory exists.\n      test -f \"$dirpart/$file\" && continue\n      fdir=`AS_DIRNAME([\"$file\"])`\n      AS_MKDIR_P([$dirpart/$fdir])\n      # echo \"creating $dirpart/$file\"\n      echo '# dummy' > \"$dirpart/$file\"\n    done\n  done\n}\n])# _AM_OUTPUT_DEPENDENCY_COMMANDS\n\n\n# AM_OUTPUT_DEPENDENCY_COMMANDS\n# -----------------------------\n# This macro should only be invoked once -- use via AC_REQUIRE.\n#\n# This code is only required when automatic dependency tracking\n# is enabled.  FIXME.  This creates each '.P' file that we will\n# need in order to bootstrap the dependency handling code.\nAC_DEFUN([AM_OUTPUT_DEPENDENCY_COMMANDS],\n[AC_CONFIG_COMMANDS([depfiles],\n     [test x\"$AMDEP_TRUE\" != x\"\" || _AM_OUTPUT_DEPENDENCY_COMMANDS],\n     [AMDEP_TRUE=\"$AMDEP_TRUE\" ac_aux_dir=\"$ac_aux_dir\"])\n])\n\n# Do all the work for Automake.                             -*- Autoconf -*-\n\n# Copyright (C) 1996-2017 Free Software Foundation, Inc.\n#\n# This file is free software; the Free Software Foundation\n# gives unlimited permission to copy and/or distribute it,\n# with or without modifications, as long as this notice is preserved.\n\n# This macro actually does too much.  Some checks are only needed if\n# your package does certain things.  But this isn't really a big deal.\n\ndnl Redefine AC_PROG_CC to automatically invoke _AM_PROG_CC_C_O.\nm4_define([AC_PROG_CC],\nm4_defn([AC_PROG_CC])\n[_AM_PROG_CC_C_O\n])\n\n# AM_INIT_AUTOMAKE(PACKAGE, VERSION, [NO-DEFINE])\n# AM_INIT_AUTOMAKE([OPTIONS])\n# -----------------------------------------------\n# The call with PACKAGE and VERSION arguments is the old style\n# call (pre autoconf-2.50), which is being phased out.  PACKAGE\n# and VERSION should now be passed to AC_INIT and removed from\n# the call to AM_INIT_AUTOMAKE.\n# We support both call styles for the transition.  After\n# the next Automake release, Autoconf can make the AC_INIT\n# arguments mandatory, and then we can depend on a new Autoconf\n# release and drop the old call support.\nAC_DEFUN([AM_INIT_AUTOMAKE],\n[AC_PREREQ([2.65])dnl\ndnl Autoconf wants to disallow AM_ names.  We explicitly allow\ndnl the ones we care about.\nm4_pattern_allow([^AM_[A-Z]+FLAGS$])dnl\nAC_REQUIRE([AM_SET_CURRENT_AUTOMAKE_VERSION])dnl\nAC_REQUIRE([AC_PROG_INSTALL])dnl\nif test \"`cd $srcdir && pwd`\" != \"`pwd`\"; then\n  # Use -I$(srcdir) only when $(srcdir) != ., so that make's output\n  # is not polluted with repeated \"-I.\"\n  AC_SUBST([am__isrc], [' -I$(srcdir)'])_AM_SUBST_NOTMAKE([am__isrc])dnl\n  # test to see if srcdir already configured\n  if test -f $srcdir/config.status; then\n    AC_MSG_ERROR([source directory already configured; run \"make distclean\" there first])\n  fi\nfi\n\n# test whether we have cygpath\nif test -z \"$CYGPATH_W\"; then\n  if (cygpath --version) >/dev/null 2>/dev/null; then\n    CYGPATH_W='cygpath -w'\n  else\n    CYGPATH_W=echo\n  fi\nfi\nAC_SUBST([CYGPATH_W])\n\n# Define the identity of the package.\ndnl Distinguish between old-style and new-style calls.\nm4_ifval([$2],\n[AC_DIAGNOSE([obsolete],\n             [$0: two- and three-arguments forms are deprecated.])\nm4_ifval([$3], [_AM_SET_OPTION([no-define])])dnl\n AC_SUBST([PACKAGE], [$1])dnl\n AC_SUBST([VERSION], [$2])],\n[_AM_SET_OPTIONS([$1])dnl\ndnl Diagnose old-style AC_INIT with new-style AM_AUTOMAKE_INIT.\nm4_if(\n  m4_ifdef([AC_PACKAGE_NAME], [ok]):m4_ifdef([AC_PACKAGE_VERSION], [ok]),\n  [ok:ok],,\n  [m4_fatal([AC_INIT should be called with package and version arguments])])dnl\n AC_SUBST([PACKAGE], ['AC_PACKAGE_TARNAME'])dnl\n AC_SUBST([VERSION], ['AC_PACKAGE_VERSION'])])dnl\n\n_AM_IF_OPTION([no-define],,\n[AC_DEFINE_UNQUOTED([PACKAGE], [\"$PACKAGE\"], [Name of package])\n AC_DEFINE_UNQUOTED([VERSION], [\"$VERSION\"], [Version number of package])])dnl\n\n# Some tools Automake needs.\nAC_REQUIRE([AM_SANITY_CHECK])dnl\nAC_REQUIRE([AC_ARG_PROGRAM])dnl\nAM_MISSING_PROG([ACLOCAL], [aclocal-${am__api_version}])\nAM_MISSING_PROG([AUTOCONF], [autoconf])\nAM_MISSING_PROG([AUTOMAKE], [automake-${am__api_version}])\nAM_MISSING_PROG([AUTOHEADER], [autoheader])\nAM_MISSING_PROG([MAKEINFO], [makeinfo])\nAC_REQUIRE([AM_PROG_INSTALL_SH])dnl\nAC_REQUIRE([AM_PROG_INSTALL_STRIP])dnl\nAC_REQUIRE([AC_PROG_MKDIR_P])dnl\n# For better backward compatibility.  To be removed once Automake 1.9.x\n# dies out for good.  For more background, see:\n# <http://lists.gnu.org/archive/html/automake/2012-07/msg00001.html>\n# <http://lists.gnu.org/archive/html/automake/2012-07/msg00014.html>\nAC_SUBST([mkdir_p], ['$(MKDIR_P)'])\n# We need awk for the \"check\" target (and possibly the TAP driver).  The\n# system \"awk\" is bad on some platforms.\nAC_REQUIRE([AC_PROG_AWK])dnl\nAC_REQUIRE([AC_PROG_MAKE_SET])dnl\nAC_REQUIRE([AM_SET_LEADING_DOT])dnl\n_AM_IF_OPTION([tar-ustar], [_AM_PROG_TAR([ustar])],\n\t      [_AM_IF_OPTION([tar-pax], [_AM_PROG_TAR([pax])],\n\t\t\t     [_AM_PROG_TAR([v7])])])\n_AM_IF_OPTION([no-dependencies],,\n[AC_PROVIDE_IFELSE([AC_PROG_CC],\n\t\t  [_AM_DEPENDENCIES([CC])],\n\t\t  [m4_define([AC_PROG_CC],\n\t\t\t     m4_defn([AC_PROG_CC])[_AM_DEPENDENCIES([CC])])])dnl\nAC_PROVIDE_IFELSE([AC_PROG_CXX],\n\t\t  [_AM_DEPENDENCIES([CXX])],\n\t\t  [m4_define([AC_PROG_CXX],\n\t\t\t     m4_defn([AC_PROG_CXX])[_AM_DEPENDENCIES([CXX])])])dnl\nAC_PROVIDE_IFELSE([AC_PROG_OBJC],\n\t\t  [_AM_DEPENDENCIES([OBJC])],\n\t\t  [m4_define([AC_PROG_OBJC],\n\t\t\t     m4_defn([AC_PROG_OBJC])[_AM_DEPENDENCIES([OBJC])])])dnl\nAC_PROVIDE_IFELSE([AC_PROG_OBJCXX],\n\t\t  [_AM_DEPENDENCIES([OBJCXX])],\n\t\t  [m4_define([AC_PROG_OBJCXX],\n\t\t\t     m4_defn([AC_PROG_OBJCXX])[_AM_DEPENDENCIES([OBJCXX])])])dnl\n])\nAC_REQUIRE([AM_SILENT_RULES])dnl\ndnl The testsuite driver may need to know about EXEEXT, so add the\ndnl 'am__EXEEXT' conditional if _AM_COMPILER_EXEEXT was seen.  This\ndnl macro is hooked onto _AC_COMPILER_EXEEXT early, see below.\nAC_CONFIG_COMMANDS_PRE(dnl\n[m4_provide_if([_AM_COMPILER_EXEEXT],\n  [AM_CONDITIONAL([am__EXEEXT], [test -n \"$EXEEXT\"])])])dnl\n\n# POSIX will say in a future version that running \"rm -f\" with no argument\n# is OK; and we want to be able to make that assumption in our Makefile\n# recipes.  So use an aggressive probe to check that the usage we want is\n# actually supported \"in the wild\" to an acceptable degree.\n# See automake bug#10828.\n# To make any issue more visible, cause the running configure to be aborted\n# by default if the 'rm' program in use doesn't match our expectations; the\n# user can still override this though.\nif rm -f && rm -fr && rm -rf; then : OK; else\n  cat >&2 <<'END'\nOops!\n\nYour 'rm' program seems unable to run without file operands specified\non the command line, even when the '-f' option is present.  This is contrary\nto the behaviour of most rm programs out there, and not conforming with\nthe upcoming POSIX standard: <http://austingroupbugs.net/view.php?id=542>\n\nPlease tell bug-automake@gnu.org about your system, including the value\nof your $PATH and any error possibly output before this message.  This\ncan help us improve future automake versions.\n\nEND\n  if test x\"$ACCEPT_INFERIOR_RM_PROGRAM\" = x\"yes\"; then\n    echo 'Configuration will proceed anyway, since you have set the' >&2\n    echo 'ACCEPT_INFERIOR_RM_PROGRAM variable to \"yes\"' >&2\n    echo >&2\n  else\n    cat >&2 <<'END'\nAborting the configuration process, to ensure you take notice of the issue.\n\nYou can download and install GNU coreutils to get an 'rm' implementation\nthat behaves properly: <http://www.gnu.org/software/coreutils/>.\n\nIf you want to complete the configuration process using your problematic\n'rm' anyway, export the environment variable ACCEPT_INFERIOR_RM_PROGRAM\nto \"yes\", and re-run configure.\n\nEND\n    AC_MSG_ERROR([Your 'rm' program is bad, sorry.])\n  fi\nfi\ndnl The trailing newline in this macro's definition is deliberate, for\ndnl backward compatibility and to allow trailing 'dnl'-style comments\ndnl after the AM_INIT_AUTOMAKE invocation. See automake bug#16841.\n])\n\ndnl Hook into '_AC_COMPILER_EXEEXT' early to learn its expansion.  Do not\ndnl add the conditional right here, as _AC_COMPILER_EXEEXT may be further\ndnl mangled by Autoconf and run in a shell conditional statement.\nm4_define([_AC_COMPILER_EXEEXT],\nm4_defn([_AC_COMPILER_EXEEXT])[m4_provide([_AM_COMPILER_EXEEXT])])\n\n# When config.status generates a header, we must update the stamp-h file.\n# This file resides in the same directory as the config header\n# that is generated.  The stamp files are numbered to have different names.\n\n# Autoconf calls _AC_AM_CONFIG_HEADER_HOOK (when defined) in the\n# loop where config.status creates the headers, so we can generate\n# our stamp files there.\nAC_DEFUN([_AC_AM_CONFIG_HEADER_HOOK],\n[# Compute $1's index in $config_headers.\n_am_arg=$1\n_am_stamp_count=1\nfor _am_header in $config_headers :; do\n  case $_am_header in\n    $_am_arg | $_am_arg:* )\n      break ;;\n    * )\n      _am_stamp_count=`expr $_am_stamp_count + 1` ;;\n  esac\ndone\necho \"timestamp for $_am_arg\" >`AS_DIRNAME([\"$_am_arg\"])`/stamp-h[]$_am_stamp_count])\n\n# Copyright (C) 2001-2017 Free Software Foundation, Inc.\n#\n# This file is free software; the Free Software Foundation\n# gives unlimited permission to copy and/or distribute it,\n# with or without modifications, as long as this notice is preserved.\n\n# AM_PROG_INSTALL_SH\n# ------------------\n# Define $install_sh.\nAC_DEFUN([AM_PROG_INSTALL_SH],\n[AC_REQUIRE([AM_AUX_DIR_EXPAND])dnl\nif test x\"${install_sh+set}\" != xset; then\n  case $am_aux_dir in\n  *\\ * | *\\\t*)\n    install_sh=\"\\${SHELL} '$am_aux_dir/install-sh'\" ;;\n  *)\n    install_sh=\"\\${SHELL} $am_aux_dir/install-sh\"\n  esac\nfi\nAC_SUBST([install_sh])])\n\n# Copyright (C) 2003-2017 Free Software Foundation, Inc.\n#\n# This file is free software; the Free Software Foundation\n# gives unlimited permission to copy and/or distribute it,\n# with or without modifications, as long as this notice is preserved.\n\n# Check whether the underlying file-system supports filenames\n# with a leading dot.  For instance MS-DOS doesn't.\nAC_DEFUN([AM_SET_LEADING_DOT],\n[rm -rf .tst 2>/dev/null\nmkdir .tst 2>/dev/null\nif test -d .tst; then\n  am__leading_dot=.\nelse\n  am__leading_dot=_\nfi\nrmdir .tst 2>/dev/null\nAC_SUBST([am__leading_dot])])\n\n# Check to see how 'make' treats includes.\t            -*- Autoconf -*-\n\n# Copyright (C) 2001-2017 Free Software Foundation, Inc.\n#\n# This file is free software; the Free Software Foundation\n# gives unlimited permission to copy and/or distribute it,\n# with or without modifications, as long as this notice is preserved.\n\n# AM_MAKE_INCLUDE()\n# -----------------\n# Check to see how make treats includes.\nAC_DEFUN([AM_MAKE_INCLUDE],\n[am_make=${MAKE-make}\ncat > confinc << 'END'\nam__doit:\n\t@echo this is the am__doit target\n.PHONY: am__doit\nEND\n# If we don't find an include directive, just comment out the code.\nAC_MSG_CHECKING([for style of include used by $am_make])\nam__include=\"#\"\nam__quote=\n_am_result=none\n# First try GNU make style include.\necho \"include confinc\" > confmf\n# Ignore all kinds of additional output from 'make'.\ncase `$am_make -s -f confmf 2> /dev/null` in #(\n*the\\ am__doit\\ target*)\n  am__include=include\n  am__quote=\n  _am_result=GNU\n  ;;\nesac\n# Now try BSD make style include.\nif test \"$am__include\" = \"#\"; then\n   echo '.include \"confinc\"' > confmf\n   case `$am_make -s -f confmf 2> /dev/null` in #(\n   *the\\ am__doit\\ target*)\n     am__include=.include\n     am__quote=\"\\\"\"\n     _am_result=BSD\n     ;;\n   esac\nfi\nAC_SUBST([am__include])\nAC_SUBST([am__quote])\nAC_MSG_RESULT([$_am_result])\nrm -f confinc confmf\n])\n\n# Fake the existence of programs that GNU maintainers use.  -*- Autoconf -*-\n\n# Copyright (C) 1997-2017 Free Software Foundation, Inc.\n#\n# This file is free software; the Free Software Foundation\n# gives unlimited permission to copy and/or distribute it,\n# with or without modifications, as long as this notice is preserved.\n\n# AM_MISSING_PROG(NAME, PROGRAM)\n# ------------------------------\nAC_DEFUN([AM_MISSING_PROG],\n[AC_REQUIRE([AM_MISSING_HAS_RUN])\n$1=${$1-\"${am_missing_run}$2\"}\nAC_SUBST($1)])\n\n# AM_MISSING_HAS_RUN\n# ------------------\n# Define MISSING if not defined so far and test if it is modern enough.\n# If it is, set am_missing_run to use it, otherwise, to nothing.\nAC_DEFUN([AM_MISSING_HAS_RUN],\n[AC_REQUIRE([AM_AUX_DIR_EXPAND])dnl\nAC_REQUIRE_AUX_FILE([missing])dnl\nif test x\"${MISSING+set}\" != xset; then\n  case $am_aux_dir in\n  *\\ * | *\\\t*)\n    MISSING=\"\\${SHELL} \\\"$am_aux_dir/missing\\\"\" ;;\n  *)\n    MISSING=\"\\${SHELL} $am_aux_dir/missing\" ;;\n  esac\nfi\n# Use eval to expand $SHELL\nif eval \"$MISSING --is-lightweight\"; then\n  am_missing_run=\"$MISSING \"\nelse\n  am_missing_run=\n  AC_MSG_WARN(['missing' script is too old or missing])\nfi\n])\n\n# Helper functions for option handling.                     -*- Autoconf -*-\n\n# Copyright (C) 2001-2017 Free Software Foundation, Inc.\n#\n# This file is free software; the Free Software Foundation\n# gives unlimited permission to copy and/or distribute it,\n# with or without modifications, as long as this notice is preserved.\n\n# _AM_MANGLE_OPTION(NAME)\n# -----------------------\nAC_DEFUN([_AM_MANGLE_OPTION],\n[[_AM_OPTION_]m4_bpatsubst($1, [[^a-zA-Z0-9_]], [_])])\n\n# _AM_SET_OPTION(NAME)\n# --------------------\n# Set option NAME.  Presently that only means defining a flag for this option.\nAC_DEFUN([_AM_SET_OPTION],\n[m4_define(_AM_MANGLE_OPTION([$1]), [1])])\n\n# _AM_SET_OPTIONS(OPTIONS)\n# ------------------------\n# OPTIONS is a space-separated list of Automake options.\nAC_DEFUN([_AM_SET_OPTIONS],\n[m4_foreach_w([_AM_Option], [$1], [_AM_SET_OPTION(_AM_Option)])])\n\n# _AM_IF_OPTION(OPTION, IF-SET, [IF-NOT-SET])\n# -------------------------------------------\n# Execute IF-SET if OPTION is set, IF-NOT-SET otherwise.\nAC_DEFUN([_AM_IF_OPTION],\n[m4_ifset(_AM_MANGLE_OPTION([$1]), [$2], [$3])])\n\n# Copyright (C) 1999-2017 Free Software Foundation, Inc.\n#\n# This file is free software; the Free Software Foundation\n# gives unlimited permission to copy and/or distribute it,\n# with or without modifications, as long as this notice is preserved.\n\n# _AM_PROG_CC_C_O\n# ---------------\n# Like AC_PROG_CC_C_O, but changed for automake.  We rewrite AC_PROG_CC\n# to automatically call this.\nAC_DEFUN([_AM_PROG_CC_C_O],\n[AC_REQUIRE([AM_AUX_DIR_EXPAND])dnl\nAC_REQUIRE_AUX_FILE([compile])dnl\nAC_LANG_PUSH([C])dnl\nAC_CACHE_CHECK(\n  [whether $CC understands -c and -o together],\n  [am_cv_prog_cc_c_o],\n  [AC_LANG_CONFTEST([AC_LANG_PROGRAM([])])\n  # Make sure it works both with $CC and with simple cc.\n  # Following AC_PROG_CC_C_O, we do the test twice because some\n  # compilers refuse to overwrite an existing .o file with -o,\n  # though they will create one.\n  am_cv_prog_cc_c_o=yes\n  for am_i in 1 2; do\n    if AM_RUN_LOG([$CC -c conftest.$ac_ext -o conftest2.$ac_objext]) \\\n         && test -f conftest2.$ac_objext; then\n      : OK\n    else\n      am_cv_prog_cc_c_o=no\n      break\n    fi\n  done\n  rm -f core conftest*\n  unset am_i])\nif test \"$am_cv_prog_cc_c_o\" != yes; then\n   # Losing compiler, so override with the script.\n   # FIXME: It is wrong to rewrite CC.\n   # But if we don't then we get into trouble of one sort or another.\n   # A longer-term fix would be to have automake use am__CC in this case,\n   # and then we could set am__CC=\"\\$(top_srcdir)/compile \\$(CC)\"\n   CC=\"$am_aux_dir/compile $CC\"\nfi\nAC_LANG_POP([C])])\n\n# For backward compatibility.\nAC_DEFUN_ONCE([AM_PROG_CC_C_O], [AC_REQUIRE([AC_PROG_CC])])\n\n# Copyright (C) 1999-2017 Free Software Foundation, Inc.\n#\n# This file is free software; the Free Software Foundation\n# gives unlimited permission to copy and/or distribute it,\n# with or without modifications, as long as this notice is preserved.\n\n\n# AM_PATH_PYTHON([MINIMUM-VERSION], [ACTION-IF-FOUND], [ACTION-IF-NOT-FOUND])\n# ---------------------------------------------------------------------------\n# Adds support for distributing Python modules and packages.  To\n# install modules, copy them to $(pythondir), using the python_PYTHON\n# automake variable.  To install a package with the same name as the\n# automake package, install to $(pkgpythondir), or use the\n# pkgpython_PYTHON automake variable.\n#\n# The variables $(pyexecdir) and $(pkgpyexecdir) are provided as\n# locations to install python extension modules (shared libraries).\n# Another macro is required to find the appropriate flags to compile\n# extension modules.\n#\n# If your package is configured with a different prefix to python,\n# users will have to add the install directory to the PYTHONPATH\n# environment variable, or create a .pth file (see the python\n# documentation for details).\n#\n# If the MINIMUM-VERSION argument is passed, AM_PATH_PYTHON will\n# cause an error if the version of python installed on the system\n# doesn't meet the requirement.  MINIMUM-VERSION should consist of\n# numbers and dots only.\nAC_DEFUN([AM_PATH_PYTHON],\n [\n  dnl Find a Python interpreter.  Python versions prior to 2.0 are not\n  dnl supported. (2.0 was released on October 16, 2000).\n  dnl FIXME: Remove the need to hard-code Python versions here.\n  m4_define_default([_AM_PYTHON_INTERPRETER_LIST],\n[python python2 python3 python3.8 python3.7 python3.6 python3.5 python3.4 python3.3 python3.2 python3.1 python3.0 python2.7 dnl\n python2.6 python2.5 python2.4 python2.3 python2.2 python2.1 python2.0])\n\n  AC_ARG_VAR([PYTHON], [the Python interpreter])\n\n  m4_if([$1],[],[\n    dnl No version check is needed.\n    # Find any Python interpreter.\n    if test -z \"$PYTHON\"; then\n      AC_PATH_PROGS([PYTHON], _AM_PYTHON_INTERPRETER_LIST, :)\n    fi\n    am_display_PYTHON=python\n  ], [\n    dnl A version check is needed.\n    if test -n \"$PYTHON\"; then\n      # If the user set $PYTHON, use it and don't search something else.\n      AC_MSG_CHECKING([whether $PYTHON version is >= $1])\n      AM_PYTHON_CHECK_VERSION([$PYTHON], [$1],\n\t\t\t      [AC_MSG_RESULT([yes])],\n\t\t\t      [AC_MSG_RESULT([no])\n\t\t\t       AC_MSG_ERROR([Python interpreter is too old])])\n      am_display_PYTHON=$PYTHON\n    else\n      # Otherwise, try each interpreter until we find one that satisfies\n      # VERSION.\n      AC_CACHE_CHECK([for a Python interpreter with version >= $1],\n\t[am_cv_pathless_PYTHON],[\n\tfor am_cv_pathless_PYTHON in _AM_PYTHON_INTERPRETER_LIST none; do\n\t  test \"$am_cv_pathless_PYTHON\" = none && break\n\t  AM_PYTHON_CHECK_VERSION([$am_cv_pathless_PYTHON], [$1], [break])\n\tdone])\n      # Set $PYTHON to the absolute path of $am_cv_pathless_PYTHON.\n      if test \"$am_cv_pathless_PYTHON\" = none; then\n\tPYTHON=:\n      else\n        AC_PATH_PROG([PYTHON], [$am_cv_pathless_PYTHON])\n      fi\n      am_display_PYTHON=$am_cv_pathless_PYTHON\n    fi\n  ])\n\n  if test \"$PYTHON\" = :; then\n  dnl Run any user-specified action, or abort.\n    m4_default([$3], [AC_MSG_ERROR([no suitable Python interpreter found])])\n  else\n\n  dnl Query Python for its version number.  Getting [:3] seems to be\n  dnl the best way to do this; it's what \"site.py\" does in the standard\n  dnl library.\n\n  AC_CACHE_CHECK([for $am_display_PYTHON version], [am_cv_python_version],\n    [am_cv_python_version=`$PYTHON -c \"import sys; sys.stdout.write(sys.version[[:3]])\"`])\n  AC_SUBST([PYTHON_VERSION], [$am_cv_python_version])\n\n  dnl Use the values of $prefix and $exec_prefix for the corresponding\n  dnl values of PYTHON_PREFIX and PYTHON_EXEC_PREFIX.  These are made\n  dnl distinct variables so they can be overridden if need be.  However,\n  dnl general consensus is that you shouldn't need this ability.\n\n  AC_SUBST([PYTHON_PREFIX], ['${prefix}'])\n  AC_SUBST([PYTHON_EXEC_PREFIX], ['${exec_prefix}'])\n\n  dnl At times (like when building shared libraries) you may want\n  dnl to know which OS platform Python thinks this is.\n\n  AC_CACHE_CHECK([for $am_display_PYTHON platform], [am_cv_python_platform],\n    [am_cv_python_platform=`$PYTHON -c \"import sys; sys.stdout.write(sys.platform)\"`])\n  AC_SUBST([PYTHON_PLATFORM], [$am_cv_python_platform])\n\n  # Just factor out some code duplication.\n  am_python_setup_sysconfig=\"\\\nimport sys\n# Prefer sysconfig over distutils.sysconfig, for better compatibility\n# with python 3.x.  See automake bug#10227.\ntry:\n    import sysconfig\nexcept ImportError:\n    can_use_sysconfig = 0\nelse:\n    can_use_sysconfig = 1\n# Can't use sysconfig in CPython 2.7, since it's broken in virtualenvs:\n# <https://github.com/pypa/virtualenv/issues/118>\ntry:\n    from platform import python_implementation\n    if python_implementation() == 'CPython' and sys.version[[:3]] == '2.7':\n        can_use_sysconfig = 0\nexcept ImportError:\n    pass\"\n\n  dnl Set up 4 directories:\n\n  dnl pythondir -- where to install python scripts.  This is the\n  dnl   site-packages directory, not the python standard library\n  dnl   directory like in previous automake betas.  This behavior\n  dnl   is more consistent with lispdir.m4 for example.\n  dnl Query distutils for this directory.\n  AC_CACHE_CHECK([for $am_display_PYTHON script directory],\n    [am_cv_python_pythondir],\n    [if test \"x$prefix\" = xNONE\n     then\n       am_py_prefix=$ac_default_prefix\n     else\n       am_py_prefix=$prefix\n     fi\n     am_cv_python_pythondir=`$PYTHON -c \"\n$am_python_setup_sysconfig\nif can_use_sysconfig:\n    sitedir = sysconfig.get_path('purelib', vars={'base':'$am_py_prefix'})\nelse:\n    from distutils import sysconfig\n    sitedir = sysconfig.get_python_lib(0, 0, prefix='$am_py_prefix')\nsys.stdout.write(sitedir)\"`\n     case $am_cv_python_pythondir in\n     $am_py_prefix*)\n       am__strip_prefix=`echo \"$am_py_prefix\" | sed 's|.|.|g'`\n       am_cv_python_pythondir=`echo \"$am_cv_python_pythondir\" | sed \"s,^$am__strip_prefix,$PYTHON_PREFIX,\"`\n       ;;\n     *)\n       case $am_py_prefix in\n         /usr|/System*) ;;\n         *)\n\t  am_cv_python_pythondir=$PYTHON_PREFIX/lib/python$PYTHON_VERSION/site-packages\n\t  ;;\n       esac\n       ;;\n     esac\n    ])\n  AC_SUBST([pythondir], [$am_cv_python_pythondir])\n\n  dnl pkgpythondir -- $PACKAGE directory under pythondir.  Was\n  dnl   PYTHON_SITE_PACKAGE in previous betas, but this naming is\n  dnl   more consistent with the rest of automake.\n\n  AC_SUBST([pkgpythondir], [\\${pythondir}/$PACKAGE])\n\n  dnl pyexecdir -- directory for installing python extension modules\n  dnl   (shared libraries)\n  dnl Query distutils for this directory.\n  AC_CACHE_CHECK([for $am_display_PYTHON extension module directory],\n    [am_cv_python_pyexecdir],\n    [if test \"x$exec_prefix\" = xNONE\n     then\n       am_py_exec_prefix=$am_py_prefix\n     else\n       am_py_exec_prefix=$exec_prefix\n     fi\n     am_cv_python_pyexecdir=`$PYTHON -c \"\n$am_python_setup_sysconfig\nif can_use_sysconfig:\n    sitedir = sysconfig.get_path('platlib', vars={'platbase':'$am_py_prefix'})\nelse:\n    from distutils import sysconfig\n    sitedir = sysconfig.get_python_lib(1, 0, prefix='$am_py_prefix')\nsys.stdout.write(sitedir)\"`\n     case $am_cv_python_pyexecdir in\n     $am_py_exec_prefix*)\n       am__strip_prefix=`echo \"$am_py_exec_prefix\" | sed 's|.|.|g'`\n       am_cv_python_pyexecdir=`echo \"$am_cv_python_pyexecdir\" | sed \"s,^$am__strip_prefix,$PYTHON_EXEC_PREFIX,\"`\n       ;;\n     *)\n       case $am_py_exec_prefix in\n         /usr|/System*) ;;\n         *)\n\t   am_cv_python_pyexecdir=$PYTHON_EXEC_PREFIX/lib/python$PYTHON_VERSION/site-packages\n\t   ;;\n       esac\n       ;;\n     esac\n    ])\n  AC_SUBST([pyexecdir], [$am_cv_python_pyexecdir])\n\n  dnl pkgpyexecdir -- $(pyexecdir)/$(PACKAGE)\n\n  AC_SUBST([pkgpyexecdir], [\\${pyexecdir}/$PACKAGE])\n\n  dnl Run any user-specified action.\n  $2\n  fi\n\n])\n\n\n# AM_PYTHON_CHECK_VERSION(PROG, VERSION, [ACTION-IF-TRUE], [ACTION-IF-FALSE])\n# ---------------------------------------------------------------------------\n# Run ACTION-IF-TRUE if the Python interpreter PROG has version >= VERSION.\n# Run ACTION-IF-FALSE otherwise.\n# This test uses sys.hexversion instead of the string equivalent (first\n# word of sys.version), in order to cope with versions such as 2.2c1.\n# This supports Python 2.0 or higher. (2.0 was released on October 16, 2000).\nAC_DEFUN([AM_PYTHON_CHECK_VERSION],\n [prog=\"import sys\n# split strings by '.' and convert to numeric.  Append some zeros\n# because we need at least 4 digits for the hex conversion.\n# map returns an iterator in Python 3.0 and a list in 2.x\nminver = list(map(int, '$2'.split('.'))) + [[0, 0, 0]]\nminverhex = 0\n# xrange is not present in Python 3.0 and range returns an iterator\nfor i in list(range(0, 4)): minverhex = (minverhex << 8) + minver[[i]]\nsys.exit(sys.hexversion < minverhex)\"\n  AS_IF([AM_RUN_LOG([$1 -c \"$prog\"])], [$3], [$4])])\n\n# Copyright (C) 2001-2017 Free Software Foundation, Inc.\n#\n# This file is free software; the Free Software Foundation\n# gives unlimited permission to copy and/or distribute it,\n# with or without modifications, as long as this notice is preserved.\n\n# AM_RUN_LOG(COMMAND)\n# -------------------\n# Run COMMAND, save the exit status in ac_status, and log it.\n# (This has been adapted from Autoconf's _AC_RUN_LOG macro.)\nAC_DEFUN([AM_RUN_LOG],\n[{ echo \"$as_me:$LINENO: $1\" >&AS_MESSAGE_LOG_FD\n   ($1) >&AS_MESSAGE_LOG_FD 2>&AS_MESSAGE_LOG_FD\n   ac_status=$?\n   echo \"$as_me:$LINENO: \\$? = $ac_status\" >&AS_MESSAGE_LOG_FD\n   (exit $ac_status); }])\n\n# Check to make sure that the build environment is sane.    -*- Autoconf -*-\n\n# Copyright (C) 1996-2017 Free Software Foundation, Inc.\n#\n# This file is free software; the Free Software Foundation\n# gives unlimited permission to copy and/or distribute it,\n# with or without modifications, as long as this notice is preserved.\n\n# AM_SANITY_CHECK\n# ---------------\nAC_DEFUN([AM_SANITY_CHECK],\n[AC_MSG_CHECKING([whether build environment is sane])\n# Reject unsafe characters in $srcdir or the absolute working directory\n# name.  Accept space and tab only in the latter.\nam_lf='\n'\ncase `pwd` in\n  *[[\\\\\\\"\\#\\$\\&\\'\\`$am_lf]]*)\n    AC_MSG_ERROR([unsafe absolute working directory name]);;\nesac\ncase $srcdir in\n  *[[\\\\\\\"\\#\\$\\&\\'\\`$am_lf\\ \\\t]]*)\n    AC_MSG_ERROR([unsafe srcdir value: '$srcdir']);;\nesac\n\n# Do 'set' in a subshell so we don't clobber the current shell's\n# arguments.  Must try -L first in case configure is actually a\n# symlink; some systems play weird games with the mod time of symlinks\n# (eg FreeBSD returns the mod time of the symlink's containing\n# directory).\nif (\n   am_has_slept=no\n   for am_try in 1 2; do\n     echo \"timestamp, slept: $am_has_slept\" > conftest.file\n     set X `ls -Lt \"$srcdir/configure\" conftest.file 2> /dev/null`\n     if test \"$[*]\" = \"X\"; then\n\t# -L didn't work.\n\tset X `ls -t \"$srcdir/configure\" conftest.file`\n     fi\n     if test \"$[*]\" != \"X $srcdir/configure conftest.file\" \\\n\t&& test \"$[*]\" != \"X conftest.file $srcdir/configure\"; then\n\n\t# If neither matched, then we have a broken ls.  This can happen\n\t# if, for instance, CONFIG_SHELL is bash and it inherits a\n\t# broken ls alias from the environment.  This has actually\n\t# happened.  Such a system could not be considered \"sane\".\n\tAC_MSG_ERROR([ls -t appears to fail.  Make sure there is not a broken\n  alias in your environment])\n     fi\n     if test \"$[2]\" = conftest.file || test $am_try -eq 2; then\n       break\n     fi\n     # Just in case.\n     sleep 1\n     am_has_slept=yes\n   done\n   test \"$[2]\" = conftest.file\n   )\nthen\n   # Ok.\n   :\nelse\n   AC_MSG_ERROR([newly created file is older than distributed files!\nCheck your system clock])\nfi\nAC_MSG_RESULT([yes])\n# If we didn't sleep, we still need to ensure time stamps of config.status and\n# generated files are strictly newer.\nam_sleep_pid=\nif grep 'slept: no' conftest.file >/dev/null 2>&1; then\n  ( sleep 1 ) &\n  am_sleep_pid=$!\nfi\nAC_CONFIG_COMMANDS_PRE(\n  [AC_MSG_CHECKING([that generated files are newer than configure])\n   if test -n \"$am_sleep_pid\"; then\n     # Hide warnings about reused PIDs.\n     wait $am_sleep_pid 2>/dev/null\n   fi\n   AC_MSG_RESULT([done])])\nrm -f conftest.file\n])\n\n# Copyright (C) 2009-2017 Free Software Foundation, Inc.\n#\n# This file is free software; the Free Software Foundation\n# gives unlimited permission to copy and/or distribute it,\n# with or without modifications, as long as this notice is preserved.\n\n# AM_SILENT_RULES([DEFAULT])\n# --------------------------\n# Enable less verbose build rules; with the default set to DEFAULT\n# (\"yes\" being less verbose, \"no\" or empty being verbose).\nAC_DEFUN([AM_SILENT_RULES],\n[AC_ARG_ENABLE([silent-rules], [dnl\nAS_HELP_STRING(\n  [--enable-silent-rules],\n  [less verbose build output (undo: \"make V=1\")])\nAS_HELP_STRING(\n  [--disable-silent-rules],\n  [verbose build output (undo: \"make V=0\")])dnl\n])\ncase $enable_silent_rules in @%:@ (((\n  yes) AM_DEFAULT_VERBOSITY=0;;\n   no) AM_DEFAULT_VERBOSITY=1;;\n    *) AM_DEFAULT_VERBOSITY=m4_if([$1], [yes], [0], [1]);;\nesac\ndnl\ndnl A few 'make' implementations (e.g., NonStop OS and NextStep)\ndnl do not support nested variable expansions.\ndnl See automake bug#9928 and bug#10237.\nam_make=${MAKE-make}\nAC_CACHE_CHECK([whether $am_make supports nested variables],\n   [am_cv_make_support_nested_variables],\n   [if AS_ECHO([['TRUE=$(BAR$(V))\nBAR0=false\nBAR1=true\nV=1\nam__doit:\n\t@$(TRUE)\n.PHONY: am__doit']]) | $am_make -f - >/dev/null 2>&1; then\n  am_cv_make_support_nested_variables=yes\nelse\n  am_cv_make_support_nested_variables=no\nfi])\nif test $am_cv_make_support_nested_variables = yes; then\n  dnl Using '$V' instead of '$(V)' breaks IRIX make.\n  AM_V='$(V)'\n  AM_DEFAULT_V='$(AM_DEFAULT_VERBOSITY)'\nelse\n  AM_V=$AM_DEFAULT_VERBOSITY\n  AM_DEFAULT_V=$AM_DEFAULT_VERBOSITY\nfi\nAC_SUBST([AM_V])dnl\nAM_SUBST_NOTMAKE([AM_V])dnl\nAC_SUBST([AM_DEFAULT_V])dnl\nAM_SUBST_NOTMAKE([AM_DEFAULT_V])dnl\nAC_SUBST([AM_DEFAULT_VERBOSITY])dnl\nAM_BACKSLASH='\\'\nAC_SUBST([AM_BACKSLASH])dnl\n_AM_SUBST_NOTMAKE([AM_BACKSLASH])dnl\n])\n\n# Copyright (C) 2001-2017 Free Software Foundation, Inc.\n#\n# This file is free software; the Free Software Foundation\n# gives unlimited permission to copy and/or distribute it,\n# with or without modifications, as long as this notice is preserved.\n\n# AM_PROG_INSTALL_STRIP\n# ---------------------\n# One issue with vendor 'install' (even GNU) is that you can't\n# specify the program used to strip binaries.  This is especially\n# annoying in cross-compiling environments, where the build's strip\n# is unlikely to handle the host's binaries.\n# Fortunately install-sh will honor a STRIPPROG variable, so we\n# always use install-sh in \"make install-strip\", and initialize\n# STRIPPROG with the value of the STRIP variable (set by the user).\nAC_DEFUN([AM_PROG_INSTALL_STRIP],\n[AC_REQUIRE([AM_PROG_INSTALL_SH])dnl\n# Installed binaries are usually stripped using 'strip' when the user\n# run \"make install-strip\".  However 'strip' might not be the right\n# tool to use in cross-compilation environments, therefore Automake\n# will honor the 'STRIP' environment variable to overrule this program.\ndnl Don't test for $cross_compiling = yes, because it might be 'maybe'.\nif test \"$cross_compiling\" != no; then\n  AC_CHECK_TOOL([STRIP], [strip], :)\nfi\nINSTALL_STRIP_PROGRAM=\"\\$(install_sh) -c -s\"\nAC_SUBST([INSTALL_STRIP_PROGRAM])])\n\n# Copyright (C) 2006-2017 Free Software Foundation, Inc.\n#\n# This file is free software; the Free Software Foundation\n# gives unlimited permission to copy and/or distribute it,\n# with or without modifications, as long as this notice is preserved.\n\n# _AM_SUBST_NOTMAKE(VARIABLE)\n# ---------------------------\n# Prevent Automake from outputting VARIABLE = @VARIABLE@ in Makefile.in.\n# This macro is traced by Automake.\nAC_DEFUN([_AM_SUBST_NOTMAKE])\n\n# AM_SUBST_NOTMAKE(VARIABLE)\n# --------------------------\n# Public sister of _AM_SUBST_NOTMAKE.\nAC_DEFUN([AM_SUBST_NOTMAKE], [_AM_SUBST_NOTMAKE($@)])\n\n# Check how to create a tarball.                            -*- Autoconf -*-\n\n# Copyright (C) 2004-2017 Free Software Foundation, Inc.\n#\n# This file is free software; the Free Software Foundation\n# gives unlimited permission to copy and/or distribute it,\n# with or without modifications, as long as this notice is preserved.\n\n# _AM_PROG_TAR(FORMAT)\n# --------------------\n# Check how to create a tarball in format FORMAT.\n# FORMAT should be one of 'v7', 'ustar', or 'pax'.\n#\n# Substitute a variable $(am__tar) that is a command\n# writing to stdout a FORMAT-tarball containing the directory\n# $tardir.\n#     tardir=directory && $(am__tar) > result.tar\n#\n# Substitute a variable $(am__untar) that extract such\n# a tarball read from stdin.\n#     $(am__untar) < result.tar\n#\nAC_DEFUN([_AM_PROG_TAR],\n[# Always define AMTAR for backward compatibility.  Yes, it's still used\n# in the wild :-(  We should find a proper way to deprecate it ...\nAC_SUBST([AMTAR], ['$${TAR-tar}'])\n\n# We'll loop over all known methods to create a tar archive until one works.\n_am_tools='gnutar m4_if([$1], [ustar], [plaintar]) pax cpio none'\n\nm4_if([$1], [v7],\n  [am__tar='$${TAR-tar} chof - \"$$tardir\"' am__untar='$${TAR-tar} xf -'],\n\n  [m4_case([$1],\n    [ustar],\n     [# The POSIX 1988 'ustar' format is defined with fixed-size fields.\n      # There is notably a 21 bits limit for the UID and the GID.  In fact,\n      # the 'pax' utility can hang on bigger UID/GID (see automake bug#8343\n      # and bug#13588).\n      am_max_uid=2097151 # 2^21 - 1\n      am_max_gid=$am_max_uid\n      # The $UID and $GID variables are not portable, so we need to resort\n      # to the POSIX-mandated id(1) utility.  Errors in the 'id' calls\n      # below are definitely unexpected, so allow the users to see them\n      # (that is, avoid stderr redirection).\n      am_uid=`id -u || echo unknown`\n      am_gid=`id -g || echo unknown`\n      AC_MSG_CHECKING([whether UID '$am_uid' is supported by ustar format])\n      if test $am_uid -le $am_max_uid; then\n         AC_MSG_RESULT([yes])\n      else\n         AC_MSG_RESULT([no])\n         _am_tools=none\n      fi\n      AC_MSG_CHECKING([whether GID '$am_gid' is supported by ustar format])\n      if test $am_gid -le $am_max_gid; then\n         AC_MSG_RESULT([yes])\n      else\n        AC_MSG_RESULT([no])\n        _am_tools=none\n      fi],\n\n  [pax],\n    [],\n\n  [m4_fatal([Unknown tar format])])\n\n  AC_MSG_CHECKING([how to create a $1 tar archive])\n\n  # Go ahead even if we have the value already cached.  We do so because we\n  # need to set the values for the 'am__tar' and 'am__untar' variables.\n  _am_tools=${am_cv_prog_tar_$1-$_am_tools}\n\n  for _am_tool in $_am_tools; do\n    case $_am_tool in\n    gnutar)\n      for _am_tar in tar gnutar gtar; do\n        AM_RUN_LOG([$_am_tar --version]) && break\n      done\n      am__tar=\"$_am_tar --format=m4_if([$1], [pax], [posix], [$1]) -chf - \"'\"$$tardir\"'\n      am__tar_=\"$_am_tar --format=m4_if([$1], [pax], [posix], [$1]) -chf - \"'\"$tardir\"'\n      am__untar=\"$_am_tar -xf -\"\n      ;;\n    plaintar)\n      # Must skip GNU tar: if it does not support --format= it doesn't create\n      # ustar tarball either.\n      (tar --version) >/dev/null 2>&1 && continue\n      am__tar='tar chf - \"$$tardir\"'\n      am__tar_='tar chf - \"$tardir\"'\n      am__untar='tar xf -'\n      ;;\n    pax)\n      am__tar='pax -L -x $1 -w \"$$tardir\"'\n      am__tar_='pax -L -x $1 -w \"$tardir\"'\n      am__untar='pax -r'\n      ;;\n    cpio)\n      am__tar='find \"$$tardir\" -print | cpio -o -H $1 -L'\n      am__tar_='find \"$tardir\" -print | cpio -o -H $1 -L'\n      am__untar='cpio -i -H $1 -d'\n      ;;\n    none)\n      am__tar=false\n      am__tar_=false\n      am__untar=false\n      ;;\n    esac\n\n    # If the value was cached, stop now.  We just wanted to have am__tar\n    # and am__untar set.\n    test -n \"${am_cv_prog_tar_$1}\" && break\n\n    # tar/untar a dummy directory, and stop if the command works.\n    rm -rf conftest.dir\n    mkdir conftest.dir\n    echo GrepMe > conftest.dir/file\n    AM_RUN_LOG([tardir=conftest.dir && eval $am__tar_ >conftest.tar])\n    rm -rf conftest.dir\n    if test -s conftest.tar; then\n      AM_RUN_LOG([$am__untar <conftest.tar])\n      AM_RUN_LOG([cat conftest.dir/file])\n      grep GrepMe conftest.dir/file >/dev/null 2>&1 && break\n    fi\n  done\n  rm -rf conftest.dir\n\n  AC_CACHE_VAL([am_cv_prog_tar_$1], [am_cv_prog_tar_$1=$_am_tool])\n  AC_MSG_RESULT([$am_cv_prog_tar_$1])])\n\nAC_SUBST([am__tar])\nAC_SUBST([am__untar])\n]) # _AM_PROG_TAR\n\nm4_include([m4/ac_python_devel.m4])\nm4_include([m4/libtool.m4])\nm4_include([m4/ltoptions.m4])\nm4_include([m4/ltsugar.m4])\nm4_include([m4/ltversion.m4])\nm4_include([m4/lt~obsolete.m4])\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/ar-lib",
    "content": "#! /bin/sh\n# Wrapper for Microsoft lib.exe\n\nme=ar-lib\nscriptversion=2012-03-01.08; # UTC\n\n# Copyright (C) 2010-2017 Free Software Foundation, Inc.\n# Written by Peter Rosin <peda@lysator.liu.se>.\n#\n# This program is free software; you can redistribute it and/or modify\n# it under the terms of the GNU General Public License as published by\n# the Free Software Foundation; either version 2, or (at your option)\n# any later version.\n#\n# This program is distributed in the hope that it will be useful,\n# but WITHOUT ANY WARRANTY; without even the implied warranty of\n# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n# GNU General Public License for more details.\n#\n# You should have received a copy of the GNU General Public License\n# along with this program.  If not, see <http://www.gnu.org/licenses/>.\n\n# As a special exception to the GNU General Public License, if you\n# distribute this file as part of a program that contains a\n# configuration script generated by Autoconf, you may include it under\n# the same distribution terms that you use for the rest of that program.\n\n# This file is maintained in Automake, please report\n# bugs to <bug-automake@gnu.org> or send patches to\n# <automake-patches@gnu.org>.\n\n\n# func_error message\nfunc_error ()\n{\n  echo \"$me: $1\" 1>&2\n  exit 1\n}\n\nfile_conv=\n\n# func_file_conv build_file\n# Convert a $build file to $host form and store it in $file\n# Currently only supports Windows hosts.\nfunc_file_conv ()\n{\n  file=$1\n  case $file in\n    / | /[!/]*) # absolute file, and not a UNC file\n      if test -z \"$file_conv\"; then\n\t# lazily determine how to convert abs files\n\tcase `uname -s` in\n\t  MINGW*)\n\t    file_conv=mingw\n\t    ;;\n\t  CYGWIN*)\n\t    file_conv=cygwin\n\t    ;;\n\t  *)\n\t    file_conv=wine\n\t    ;;\n\tesac\n      fi\n      case $file_conv in\n\tmingw)\n\t  file=`cmd //C echo \"$file \" | sed -e 's/\"\\(.*\\) \" *$/\\1/'`\n\t  ;;\n\tcygwin)\n\t  file=`cygpath -m \"$file\" || echo \"$file\"`\n\t  ;;\n\twine)\n\t  file=`winepath -w \"$file\" || echo \"$file\"`\n\t  ;;\n      esac\n      ;;\n  esac\n}\n\n# func_at_file at_file operation archive\n# Iterate over all members in AT_FILE performing OPERATION on ARCHIVE\n# for each of them.\n# When interpreting the content of the @FILE, do NOT use func_file_conv,\n# since the user would need to supply preconverted file names to\n# binutils ar, at least for MinGW.\nfunc_at_file ()\n{\n  operation=$2\n  archive=$3\n  at_file_contents=`cat \"$1\"`\n  eval set x \"$at_file_contents\"\n  shift\n\n  for member\n  do\n    $AR -NOLOGO $operation:\"$member\" \"$archive\" || exit $?\n  done\n}\n\ncase $1 in\n  '')\n     func_error \"no command.  Try '$0 --help' for more information.\"\n     ;;\n  -h | --h*)\n    cat <<EOF\nUsage: $me [--help] [--version] PROGRAM ACTION ARCHIVE [MEMBER...]\n\nMembers may be specified in a file named with @FILE.\nEOF\n    exit $?\n    ;;\n  -v | --v*)\n    echo \"$me, version $scriptversion\"\n    exit $?\n    ;;\nesac\n\nif test $# -lt 3; then\n  func_error \"you must specify a program, an action and an archive\"\nfi\n\nAR=$1\nshift\nwhile :\ndo\n  if test $# -lt 2; then\n    func_error \"you must specify a program, an action and an archive\"\n  fi\n  case $1 in\n    -lib | -LIB \\\n    | -ltcg | -LTCG \\\n    | -machine* | -MACHINE* \\\n    | -subsystem* | -SUBSYSTEM* \\\n    | -verbose | -VERBOSE \\\n    | -wx* | -WX* )\n      AR=\"$AR $1\"\n      shift\n      ;;\n    *)\n      action=$1\n      shift\n      break\n      ;;\n  esac\ndone\norig_archive=$1\nshift\nfunc_file_conv \"$orig_archive\"\narchive=$file\n\n# strip leading dash in $action\naction=${action#-}\n\ndelete=\nextract=\nlist=\nquick=\nreplace=\nindex=\ncreate=\n\nwhile test -n \"$action\"\ndo\n  case $action in\n    d*) delete=yes  ;;\n    x*) extract=yes ;;\n    t*) list=yes    ;;\n    q*) quick=yes   ;;\n    r*) replace=yes ;;\n    s*) index=yes   ;;\n    S*)             ;; # the index is always updated implicitly\n    c*) create=yes  ;;\n    u*)             ;; # TODO: don't ignore the update modifier\n    v*)             ;; # TODO: don't ignore the verbose modifier\n    *)\n      func_error \"unknown action specified\"\n      ;;\n  esac\n  action=${action#?}\ndone\n\ncase $delete$extract$list$quick$replace,$index in\n  yes,* | ,yes)\n    ;;\n  yesyes*)\n    func_error \"more than one action specified\"\n    ;;\n  *)\n    func_error \"no action specified\"\n    ;;\nesac\n\nif test -n \"$delete\"; then\n  if test ! -f \"$orig_archive\"; then\n    func_error \"archive not found\"\n  fi\n  for member\n  do\n    case $1 in\n      @*)\n        func_at_file \"${1#@}\" -REMOVE \"$archive\"\n        ;;\n      *)\n        func_file_conv \"$1\"\n        $AR -NOLOGO -REMOVE:\"$file\" \"$archive\" || exit $?\n        ;;\n    esac\n  done\n\nelif test -n \"$extract\"; then\n  if test ! -f \"$orig_archive\"; then\n    func_error \"archive not found\"\n  fi\n  if test $# -gt 0; then\n    for member\n    do\n      case $1 in\n        @*)\n          func_at_file \"${1#@}\" -EXTRACT \"$archive\"\n          ;;\n        *)\n          func_file_conv \"$1\"\n          $AR -NOLOGO -EXTRACT:\"$file\" \"$archive\" || exit $?\n          ;;\n      esac\n    done\n  else\n    $AR -NOLOGO -LIST \"$archive\" | sed -e 's/\\\\/\\\\\\\\/g' | while read member\n    do\n      $AR -NOLOGO -EXTRACT:\"$member\" \"$archive\" || exit $?\n    done\n  fi\n\nelif test -n \"$quick$replace\"; then\n  if test ! -f \"$orig_archive\"; then\n    if test -z \"$create\"; then\n      echo \"$me: creating $orig_archive\"\n    fi\n    orig_archive=\n  else\n    orig_archive=$archive\n  fi\n\n  for member\n  do\n    case $1 in\n    @*)\n      func_file_conv \"${1#@}\"\n      set x \"$@\" \"@$file\"\n      ;;\n    *)\n      func_file_conv \"$1\"\n      set x \"$@\" \"$file\"\n      ;;\n    esac\n    shift\n    shift\n  done\n\n  if test -n \"$orig_archive\"; then\n    $AR -NOLOGO -OUT:\"$archive\" \"$orig_archive\" \"$@\" || exit $?\n  else\n    $AR -NOLOGO -OUT:\"$archive\" \"$@\" || exit $?\n  fi\n\nelif test -n \"$list\"; then\n  if test ! -f \"$orig_archive\"; then\n    func_error \"archive not found\"\n  fi\n  $AR -NOLOGO -LIST \"$archive\" || exit $?\nfi\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/compile",
    "content": "#! /bin/sh\n# Wrapper for compilers which do not understand '-c -o'.\n\nscriptversion=2012-10-14.11; # UTC\n\n# Copyright (C) 1999-2014 Free Software Foundation, Inc.\n# Written by Tom Tromey <tromey@cygnus.com>.\n#\n# This program is free software; you can redistribute it and/or modify\n# it under the terms of the GNU General Public License as published by\n# the Free Software Foundation; either version 2, or (at your option)\n# any later version.\n#\n# This program is distributed in the hope that it will be useful,\n# but WITHOUT ANY WARRANTY; without even the implied warranty of\n# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n# GNU General Public License for more details.\n#\n# You should have received a copy of the GNU General Public License\n# along with this program.  If not, see <http://www.gnu.org/licenses/>.\n\n# As a special exception to the GNU General Public License, if you\n# distribute this file as part of a program that contains a\n# configuration script generated by Autoconf, you may include it under\n# the same distribution terms that you use for the rest of that program.\n\n# This file is maintained in Automake, please report\n# bugs to <bug-automake@gnu.org> or send patches to\n# <automake-patches@gnu.org>.\n\nnl='\n'\n\n# We need space, tab and new line, in precisely that order.  Quoting is\n# there to prevent tools from complaining about whitespace usage.\nIFS=\" \"\"\t$nl\"\n\nfile_conv=\n\n# func_file_conv build_file lazy\n# Convert a $build file to $host form and store it in $file\n# Currently only supports Windows hosts. If the determined conversion\n# type is listed in (the comma separated) LAZY, no conversion will\n# take place.\nfunc_file_conv ()\n{\n  file=$1\n  case $file in\n    / | /[!/]*) # absolute file, and not a UNC file\n      if test -z \"$file_conv\"; then\n\t# lazily determine how to convert abs files\n\tcase `uname -s` in\n\t  MINGW*)\n\t    file_conv=mingw\n\t    ;;\n\t  CYGWIN*)\n\t    file_conv=cygwin\n\t    ;;\n\t  *)\n\t    file_conv=wine\n\t    ;;\n\tesac\n      fi\n      case $file_conv/,$2, in\n\t*,$file_conv,*)\n\t  ;;\n\tmingw/*)\n\t  file=`cmd //C echo \"$file \" | sed -e 's/\"\\(.*\\) \" *$/\\1/'`\n\t  ;;\n\tcygwin/*)\n\t  file=`cygpath -m \"$file\" || echo \"$file\"`\n\t  ;;\n\twine/*)\n\t  file=`winepath -w \"$file\" || echo \"$file\"`\n\t  ;;\n      esac\n      ;;\n  esac\n}\n\n# func_cl_dashL linkdir\n# Make cl look for libraries in LINKDIR\nfunc_cl_dashL ()\n{\n  func_file_conv \"$1\"\n  if test -z \"$lib_path\"; then\n    lib_path=$file\n  else\n    lib_path=\"$lib_path;$file\"\n  fi\n  linker_opts=\"$linker_opts -LIBPATH:$file\"\n}\n\n# func_cl_dashl library\n# Do a library search-path lookup for cl\nfunc_cl_dashl ()\n{\n  lib=$1\n  found=no\n  save_IFS=$IFS\n  IFS=';'\n  for dir in $lib_path $LIB\n  do\n    IFS=$save_IFS\n    if $shared && test -f \"$dir/$lib.dll.lib\"; then\n      found=yes\n      lib=$dir/$lib.dll.lib\n      break\n    fi\n    if test -f \"$dir/$lib.lib\"; then\n      found=yes\n      lib=$dir/$lib.lib\n      break\n    fi\n    if test -f \"$dir/lib$lib.a\"; then\n      found=yes\n      lib=$dir/lib$lib.a\n      break\n    fi\n  done\n  IFS=$save_IFS\n\n  if test \"$found\" != yes; then\n    lib=$lib.lib\n  fi\n}\n\n# func_cl_wrapper cl arg...\n# Adjust compile command to suit cl\nfunc_cl_wrapper ()\n{\n  # Assume a capable shell\n  lib_path=\n  shared=:\n  linker_opts=\n  for arg\n  do\n    if test -n \"$eat\"; then\n      eat=\n    else\n      case $1 in\n\t-o)\n\t  # configure might choose to run compile as 'compile cc -o foo foo.c'.\n\t  eat=1\n\t  case $2 in\n\t    *.o | *.[oO][bB][jJ])\n\t      func_file_conv \"$2\"\n\t      set x \"$@\" -Fo\"$file\"\n\t      shift\n\t      ;;\n\t    *)\n\t      func_file_conv \"$2\"\n\t      set x \"$@\" -Fe\"$file\"\n\t      shift\n\t      ;;\n\t  esac\n\t  ;;\n\t-I)\n\t  eat=1\n\t  func_file_conv \"$2\" mingw\n\t  set x \"$@\" -I\"$file\"\n\t  shift\n\t  ;;\n\t-I*)\n\t  func_file_conv \"${1#-I}\" mingw\n\t  set x \"$@\" -I\"$file\"\n\t  shift\n\t  ;;\n\t-l)\n\t  eat=1\n\t  func_cl_dashl \"$2\"\n\t  set x \"$@\" \"$lib\"\n\t  shift\n\t  ;;\n\t-l*)\n\t  func_cl_dashl \"${1#-l}\"\n\t  set x \"$@\" \"$lib\"\n\t  shift\n\t  ;;\n\t-L)\n\t  eat=1\n\t  func_cl_dashL \"$2\"\n\t  ;;\n\t-L*)\n\t  func_cl_dashL \"${1#-L}\"\n\t  ;;\n\t-static)\n\t  shared=false\n\t  ;;\n\t-Wl,*)\n\t  arg=${1#-Wl,}\n\t  save_ifs=\"$IFS\"; IFS=','\n\t  for flag in $arg; do\n\t    IFS=\"$save_ifs\"\n\t    linker_opts=\"$linker_opts $flag\"\n\t  done\n\t  IFS=\"$save_ifs\"\n\t  ;;\n\t-Xlinker)\n\t  eat=1\n\t  linker_opts=\"$linker_opts $2\"\n\t  ;;\n\t-*)\n\t  set x \"$@\" \"$1\"\n\t  shift\n\t  ;;\n\t*.cc | *.CC | *.cxx | *.CXX | *.[cC]++)\n\t  func_file_conv \"$1\"\n\t  set x \"$@\" -Tp\"$file\"\n\t  shift\n\t  ;;\n\t*.c | *.cpp | *.CPP | *.lib | *.LIB | *.Lib | *.OBJ | *.obj | *.[oO])\n\t  func_file_conv \"$1\" mingw\n\t  set x \"$@\" \"$file\"\n\t  shift\n\t  ;;\n\t*)\n\t  set x \"$@\" \"$1\"\n\t  shift\n\t  ;;\n      esac\n    fi\n    shift\n  done\n  if test -n \"$linker_opts\"; then\n    linker_opts=\"-link$linker_opts\"\n  fi\n  exec \"$@\" $linker_opts\n  exit 1\n}\n\neat=\n\ncase $1 in\n  '')\n     echo \"$0: No command.  Try '$0 --help' for more information.\" 1>&2\n     exit 1;\n     ;;\n  -h | --h*)\n    cat <<\\EOF\nUsage: compile [--help] [--version] PROGRAM [ARGS]\n\nWrapper for compilers which do not understand '-c -o'.\nRemove '-o dest.o' from ARGS, run PROGRAM with the remaining\narguments, and rename the output as expected.\n\nIf you are trying to build a whole package this is not the\nright script to run: please start by reading the file 'INSTALL'.\n\nReport bugs to <bug-automake@gnu.org>.\nEOF\n    exit $?\n    ;;\n  -v | --v*)\n    echo \"compile $scriptversion\"\n    exit $?\n    ;;\n  cl | *[/\\\\]cl | cl.exe | *[/\\\\]cl.exe )\n    func_cl_wrapper \"$@\"      # Doesn't return...\n    ;;\nesac\n\nofile=\ncfile=\n\nfor arg\ndo\n  if test -n \"$eat\"; then\n    eat=\n  else\n    case $1 in\n      -o)\n\t# configure might choose to run compile as 'compile cc -o foo foo.c'.\n\t# So we strip '-o arg' only if arg is an object.\n\teat=1\n\tcase $2 in\n\t  *.o | *.obj)\n\t    ofile=$2\n\t    ;;\n\t  *)\n\t    set x \"$@\" -o \"$2\"\n\t    shift\n\t    ;;\n\tesac\n\t;;\n      *.c)\n\tcfile=$1\n\tset x \"$@\" \"$1\"\n\tshift\n\t;;\n      *)\n\tset x \"$@\" \"$1\"\n\tshift\n\t;;\n    esac\n  fi\n  shift\ndone\n\nif test -z \"$ofile\" || test -z \"$cfile\"; then\n  # If no '-o' option was seen then we might have been invoked from a\n  # pattern rule where we don't need one.  That is ok -- this is a\n  # normal compilation that the losing compiler can handle.  If no\n  # '.c' file was seen then we are probably linking.  That is also\n  # ok.\n  exec \"$@\"\nfi\n\n# Name of file we expect compiler to create.\ncofile=`echo \"$cfile\" | sed 's|^.*[\\\\/]||; s|^[a-zA-Z]:||; s/\\.c$/.o/'`\n\n# Create the lock directory.\n# Note: use '[/\\\\:.-]' here to ensure that we don't use the same name\n# that we are using for the .o file.  Also, base the name on the expected\n# object file name, since that is what matters with a parallel build.\nlockdir=`echo \"$cofile\" | sed -e 's|[/\\\\:.-]|_|g'`.d\nwhile true; do\n  if mkdir \"$lockdir\" >/dev/null 2>&1; then\n    break\n  fi\n  sleep 1\ndone\n# FIXME: race condition here if user kills between mkdir and trap.\ntrap \"rmdir '$lockdir'; exit 1\" 1 2 15\n\n# Run the compile.\n\"$@\"\nret=$?\n\nif test -f \"$cofile\"; then\n  test \"$cofile\" = \"$ofile\" || mv \"$cofile\" \"$ofile\"\nelif test -f \"${cofile}bj\"; then\n  test \"${cofile}bj\" = \"$ofile\" || mv \"${cofile}bj\" \"$ofile\"\nfi\n\nrmdir \"$lockdir\"\nexit $ret\n\n# Local Variables:\n# mode: shell-script\n# sh-indentation: 2\n# eval: (add-hook 'write-file-hooks 'time-stamp)\n# time-stamp-start: \"scriptversion=\"\n# time-stamp-format: \"%:y-%02m-%02d.%02H\"\n# time-stamp-time-zone: \"UTC\"\n# time-stamp-end: \"; # UTC\"\n# End:\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/config.guess",
    "content": "#! /bin/sh\n# Attempt to guess a canonical system name.\n#   Copyright 1992-2017 Free Software Foundation, Inc.\n\ntimestamp='2017-11-07'\n\n# This file is free software; you can redistribute it and/or modify it\n# under the terms of the GNU General Public License as published by\n# the Free Software Foundation; either version 3 of the License, or\n# (at your option) any later version.\n#\n# This program is distributed in the hope that it will be useful, but\n# WITHOUT ANY WARRANTY; without even the implied warranty of\n# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n# General Public License for more details.\n#\n# You should have received a copy of the GNU General Public License\n# along with this program; if not, see <https://www.gnu.org/licenses/>.\n#\n# As a special exception to the GNU General Public License, if you\n# distribute this file as part of a program that contains a\n# configuration script generated by Autoconf, you may include it under\n# the same distribution terms that you use for the rest of that\n# program.  This Exception is an additional permission under section 7\n# of the GNU General Public License, version 3 (\"GPLv3\").\n#\n# Originally written by Per Bothner; maintained since 2000 by Ben Elliston.\n#\n# You can get the latest version of this script from:\n# https://git.savannah.gnu.org/gitweb/?p=config.git;a=blob_plain;f=config.guess\n#\n# Please send patches to <config-patches@gnu.org>.\n\n\nme=`echo \"$0\" | sed -e 's,.*/,,'`\n\nusage=\"\\\nUsage: $0 [OPTION]\n\nOutput the configuration name of the system \\`$me' is run on.\n\nOptions:\n  -h, --help         print this help, then exit\n  -t, --time-stamp   print date of last modification, then exit\n  -v, --version      print version number, then exit\n\nReport bugs and patches to <config-patches@gnu.org>.\"\n\nversion=\"\\\nGNU config.guess ($timestamp)\n\nOriginally written by Per Bothner.\nCopyright 1992-2017 Free Software Foundation, Inc.\n\nThis is free software; see the source for copying conditions.  There is NO\nwarranty; not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.\"\n\nhelp=\"\nTry \\`$me --help' for more information.\"\n\n# Parse command line\nwhile test $# -gt 0 ; do\n  case $1 in\n    --time-stamp | --time* | -t )\n       echo \"$timestamp\" ; exit ;;\n    --version | -v )\n       echo \"$version\" ; exit ;;\n    --help | --h* | -h )\n       echo \"$usage\"; exit ;;\n    -- )     # Stop option processing\n       shift; break ;;\n    - )\t# Use stdin as input.\n       break ;;\n    -* )\n       echo \"$me: invalid option $1$help\" >&2\n       exit 1 ;;\n    * )\n       break ;;\n  esac\ndone\n\nif test $# != 0; then\n  echo \"$me: too many arguments$help\" >&2\n  exit 1\nfi\n\ntrap 'exit 1' 1 2 15\n\n# CC_FOR_BUILD -- compiler used by this script. Note that the use of a\n# compiler to aid in system detection is discouraged as it requires\n# temporary files to be created and, as you can see below, it is a\n# headache to deal with in a portable fashion.\n\n# Historically, `CC_FOR_BUILD' used to be named `HOST_CC'. We still\n# use `HOST_CC' if defined, but it is deprecated.\n\n# Portable tmp directory creation inspired by the Autoconf team.\n\nset_cc_for_build='\ntrap \"exitcode=\\$?; (rm -f \\$tmpfiles 2>/dev/null; rmdir \\$tmp 2>/dev/null) && exit \\$exitcode\" 0 ;\ntrap \"rm -f \\$tmpfiles 2>/dev/null; rmdir \\$tmp 2>/dev/null; exit 1\" 1 2 13 15 ;\n: ${TMPDIR=/tmp} ;\n { tmp=`(umask 077 && mktemp -d \"$TMPDIR/cgXXXXXX\") 2>/dev/null` && test -n \"$tmp\" && test -d \"$tmp\" ; } ||\n { test -n \"$RANDOM\" && tmp=$TMPDIR/cg$$-$RANDOM && (umask 077 && mkdir $tmp) ; } ||\n { tmp=$TMPDIR/cg-$$ && (umask 077 && mkdir $tmp) && echo \"Warning: creating insecure temp directory\" >&2 ; } ||\n { echo \"$me: cannot create a temporary directory in $TMPDIR\" >&2 ; exit 1 ; } ;\ndummy=$tmp/dummy ;\ntmpfiles=\"$dummy.c $dummy.o $dummy.rel $dummy\" ;\ncase $CC_FOR_BUILD,$HOST_CC,$CC in\n ,,)    echo \"int x;\" > $dummy.c ;\n\tfor c in cc gcc c89 c99 ; do\n\t  if ($c -c -o $dummy.o $dummy.c) >/dev/null 2>&1 ; then\n\t     CC_FOR_BUILD=\"$c\"; break ;\n\t  fi ;\n\tdone ;\n\tif test x\"$CC_FOR_BUILD\" = x ; then\n\t  CC_FOR_BUILD=no_compiler_found ;\n\tfi\n\t;;\n ,,*)   CC_FOR_BUILD=$CC ;;\n ,*,*)  CC_FOR_BUILD=$HOST_CC ;;\nesac ; set_cc_for_build= ;'\n\n# This is needed to find uname on a Pyramid OSx when run in the BSD universe.\n# (ghazi@noc.rutgers.edu 1994-08-24)\nif (test -f /.attbin/uname) >/dev/null 2>&1 ; then\n\tPATH=$PATH:/.attbin ; export PATH\nfi\n\nUNAME_MACHINE=`(uname -m) 2>/dev/null` || UNAME_MACHINE=unknown\nUNAME_RELEASE=`(uname -r) 2>/dev/null` || UNAME_RELEASE=unknown\nUNAME_SYSTEM=`(uname -s) 2>/dev/null`  || UNAME_SYSTEM=unknown\nUNAME_VERSION=`(uname -v) 2>/dev/null` || UNAME_VERSION=unknown\n\ncase \"${UNAME_SYSTEM}\" in\nLinux|GNU|GNU/*)\n\t# If the system lacks a compiler, then just pick glibc.\n\t# We could probably try harder.\n\tLIBC=gnu\n\n\teval $set_cc_for_build\n\tcat <<-EOF > $dummy.c\n\t#include <features.h>\n\t#if defined(__UCLIBC__)\n\tLIBC=uclibc\n\t#elif defined(__dietlibc__)\n\tLIBC=dietlibc\n\t#else\n\tLIBC=gnu\n\t#endif\n\tEOF\n\teval `$CC_FOR_BUILD -E $dummy.c 2>/dev/null | grep '^LIBC' | sed 's, ,,g'`\n\t;;\nesac\n\n# Note: order is significant - the case branches are not exclusive.\n\ncase \"${UNAME_MACHINE}:${UNAME_SYSTEM}:${UNAME_RELEASE}:${UNAME_VERSION}\" in\n    *:NetBSD:*:*)\n\t# NetBSD (nbsd) targets should (where applicable) match one or\n\t# more of the tuples: *-*-netbsdelf*, *-*-netbsdaout*,\n\t# *-*-netbsdecoff* and *-*-netbsd*.  For targets that recently\n\t# switched to ELF, *-*-netbsd* would select the old\n\t# object file format.  This provides both forward\n\t# compatibility and a consistent mechanism for selecting the\n\t# object file format.\n\t#\n\t# Note: NetBSD doesn't particularly care about the vendor\n\t# portion of the name.  We always set it to \"unknown\".\n\tsysctl=\"sysctl -n hw.machine_arch\"\n\tUNAME_MACHINE_ARCH=`(uname -p 2>/dev/null || \\\n\t    /sbin/$sysctl 2>/dev/null || \\\n\t    /usr/sbin/$sysctl 2>/dev/null || \\\n\t    echo unknown)`\n\tcase \"${UNAME_MACHINE_ARCH}\" in\n\t    armeb) machine=armeb-unknown ;;\n\t    arm*) machine=arm-unknown ;;\n\t    sh3el) machine=shl-unknown ;;\n\t    sh3eb) machine=sh-unknown ;;\n\t    sh5el) machine=sh5le-unknown ;;\n\t    earmv*)\n\t\tarch=`echo ${UNAME_MACHINE_ARCH} | sed -e 's,^e\\(armv[0-9]\\).*$,\\1,'`\n\t\tendian=`echo ${UNAME_MACHINE_ARCH} | sed -ne 's,^.*\\(eb\\)$,\\1,p'`\n\t\tmachine=${arch}${endian}-unknown\n\t\t;;\n\t    *) machine=${UNAME_MACHINE_ARCH}-unknown ;;\n\tesac\n\t# The Operating System including object format, if it has switched\n\t# to ELF recently (or will in the future) and ABI.\n\tcase \"${UNAME_MACHINE_ARCH}\" in\n\t    earm*)\n\t\tos=netbsdelf\n\t\t;;\n\t    arm*|i386|m68k|ns32k|sh3*|sparc|vax)\n\t\teval $set_cc_for_build\n\t\tif echo __ELF__ | $CC_FOR_BUILD -E - 2>/dev/null \\\n\t\t\t| grep -q __ELF__\n\t\tthen\n\t\t    # Once all utilities can be ECOFF (netbsdecoff) or a.out (netbsdaout).\n\t\t    # Return netbsd for either.  FIX?\n\t\t    os=netbsd\n\t\telse\n\t\t    os=netbsdelf\n\t\tfi\n\t\t;;\n\t    *)\n\t\tos=netbsd\n\t\t;;\n\tesac\n\t# Determine ABI tags.\n\tcase \"${UNAME_MACHINE_ARCH}\" in\n\t    earm*)\n\t\texpr='s/^earmv[0-9]/-eabi/;s/eb$//'\n\t\tabi=`echo ${UNAME_MACHINE_ARCH} | sed -e \"$expr\"`\n\t\t;;\n\tesac\n\t# The OS release\n\t# Debian GNU/NetBSD machines have a different userland, and\n\t# thus, need a distinct triplet. However, they do not need\n\t# kernel version information, so it can be replaced with a\n\t# suitable tag, in the style of linux-gnu.\n\tcase \"${UNAME_VERSION}\" in\n\t    Debian*)\n\t\trelease='-gnu'\n\t\t;;\n\t    *)\n\t\trelease=`echo ${UNAME_RELEASE} | sed -e 's/[-_].*//' | cut -d. -f1,2`\n\t\t;;\n\tesac\n\t# Since CPU_TYPE-MANUFACTURER-KERNEL-OPERATING_SYSTEM:\n\t# contains redundant information, the shorter form:\n\t# CPU_TYPE-MANUFACTURER-OPERATING_SYSTEM is used.\n\techo \"${machine}-${os}${release}${abi}\"\n\texit ;;\n    *:Bitrig:*:*)\n\tUNAME_MACHINE_ARCH=`arch | sed 's/Bitrig.//'`\n\techo ${UNAME_MACHINE_ARCH}-unknown-bitrig${UNAME_RELEASE}\n\texit ;;\n    *:OpenBSD:*:*)\n\tUNAME_MACHINE_ARCH=`arch | sed 's/OpenBSD.//'`\n\techo ${UNAME_MACHINE_ARCH}-unknown-openbsd${UNAME_RELEASE}\n\texit ;;\n    *:LibertyBSD:*:*)\n\tUNAME_MACHINE_ARCH=`arch | sed 's/^.*BSD\\.//'`\n\techo ${UNAME_MACHINE_ARCH}-unknown-libertybsd${UNAME_RELEASE}\n\texit ;;\n    *:MidnightBSD:*:*)\n\techo ${UNAME_MACHINE}-unknown-midnightbsd${UNAME_RELEASE}\n\texit ;;\n    *:ekkoBSD:*:*)\n\techo ${UNAME_MACHINE}-unknown-ekkobsd${UNAME_RELEASE}\n\texit ;;\n    *:SolidBSD:*:*)\n\techo ${UNAME_MACHINE}-unknown-solidbsd${UNAME_RELEASE}\n\texit ;;\n    macppc:MirBSD:*:*)\n\techo powerpc-unknown-mirbsd${UNAME_RELEASE}\n\texit ;;\n    *:MirBSD:*:*)\n\techo ${UNAME_MACHINE}-unknown-mirbsd${UNAME_RELEASE}\n\texit ;;\n    *:Sortix:*:*)\n\techo ${UNAME_MACHINE}-unknown-sortix\n\texit ;;\n    *:Redox:*:*)\n\techo ${UNAME_MACHINE}-unknown-redox\n\texit ;;\n    alpha:OSF1:*:*)\n\tcase $UNAME_RELEASE in\n\t*4.0)\n\t\tUNAME_RELEASE=`/usr/sbin/sizer -v | awk '{print $3}'`\n\t\t;;\n\t*5.*)\n\t\tUNAME_RELEASE=`/usr/sbin/sizer -v | awk '{print $4}'`\n\t\t;;\n\tesac\n\t# According to Compaq, /usr/sbin/psrinfo has been available on\n\t# OSF/1 and Tru64 systems produced since 1995.  I hope that\n\t# covers most systems running today.  This code pipes the CPU\n\t# types through head -n 1, so we only detect the type of CPU 0.\n\tALPHA_CPU_TYPE=`/usr/sbin/psrinfo -v | sed -n -e 's/^  The alpha \\(.*\\) processor.*$/\\1/p' | head -n 1`\n\tcase \"$ALPHA_CPU_TYPE\" in\n\t    \"EV4 (21064)\")\n\t\tUNAME_MACHINE=alpha ;;\n\t    \"EV4.5 (21064)\")\n\t\tUNAME_MACHINE=alpha ;;\n\t    \"LCA4 (21066/21068)\")\n\t\tUNAME_MACHINE=alpha ;;\n\t    \"EV5 (21164)\")\n\t\tUNAME_MACHINE=alphaev5 ;;\n\t    \"EV5.6 (21164A)\")\n\t\tUNAME_MACHINE=alphaev56 ;;\n\t    \"EV5.6 (21164PC)\")\n\t\tUNAME_MACHINE=alphapca56 ;;\n\t    \"EV5.7 (21164PC)\")\n\t\tUNAME_MACHINE=alphapca57 ;;\n\t    \"EV6 (21264)\")\n\t\tUNAME_MACHINE=alphaev6 ;;\n\t    \"EV6.7 (21264A)\")\n\t\tUNAME_MACHINE=alphaev67 ;;\n\t    \"EV6.8CB (21264C)\")\n\t\tUNAME_MACHINE=alphaev68 ;;\n\t    \"EV6.8AL (21264B)\")\n\t\tUNAME_MACHINE=alphaev68 ;;\n\t    \"EV6.8CX (21264D)\")\n\t\tUNAME_MACHINE=alphaev68 ;;\n\t    \"EV6.9A (21264/EV69A)\")\n\t\tUNAME_MACHINE=alphaev69 ;;\n\t    \"EV7 (21364)\")\n\t\tUNAME_MACHINE=alphaev7 ;;\n\t    \"EV7.9 (21364A)\")\n\t\tUNAME_MACHINE=alphaev79 ;;\n\tesac\n\t# A Pn.n version is a patched version.\n\t# A Vn.n version is a released version.\n\t# A Tn.n version is a released field test version.\n\t# A Xn.n version is an unreleased experimental baselevel.\n\t# 1.2 uses \"1.2\" for uname -r.\n\techo ${UNAME_MACHINE}-dec-osf`echo ${UNAME_RELEASE} | sed -e 's/^[PVTX]//' | tr ABCDEFGHIJKLMNOPQRSTUVWXYZ abcdefghijklmnopqrstuvwxyz`\n\t# Reset EXIT trap before exiting to avoid spurious non-zero exit code.\n\texitcode=$?\n\ttrap '' 0\n\texit $exitcode ;;\n    Amiga*:UNIX_System_V:4.0:*)\n\techo m68k-unknown-sysv4\n\texit ;;\n    *:[Aa]miga[Oo][Ss]:*:*)\n\techo ${UNAME_MACHINE}-unknown-amigaos\n\texit ;;\n    *:[Mm]orph[Oo][Ss]:*:*)\n\techo ${UNAME_MACHINE}-unknown-morphos\n\texit ;;\n    *:OS/390:*:*)\n\techo i370-ibm-openedition\n\texit ;;\n    *:z/VM:*:*)\n\techo s390-ibm-zvmoe\n\texit ;;\n    *:OS400:*:*)\n\techo powerpc-ibm-os400\n\texit ;;\n    arm:RISC*:1.[012]*:*|arm:riscix:1.[012]*:*)\n\techo arm-acorn-riscix${UNAME_RELEASE}\n\texit ;;\n    arm*:riscos:*:*|arm*:RISCOS:*:*)\n\techo arm-unknown-riscos\n\texit ;;\n    SR2?01:HI-UX/MPP:*:* | SR8000:HI-UX/MPP:*:*)\n\techo hppa1.1-hitachi-hiuxmpp\n\texit ;;\n    Pyramid*:OSx*:*:* | MIS*:OSx*:*:* | MIS*:SMP_DC-OSx*:*:*)\n\t# akee@wpdis03.wpafb.af.mil (Earle F. Ake) contributed MIS and NILE.\n\tif test \"`(/bin/universe) 2>/dev/null`\" = att ; then\n\t\techo pyramid-pyramid-sysv3\n\telse\n\t\techo pyramid-pyramid-bsd\n\tfi\n\texit ;;\n    NILE*:*:*:dcosx)\n\techo pyramid-pyramid-svr4\n\texit ;;\n    DRS?6000:unix:4.0:6*)\n\techo sparc-icl-nx6\n\texit ;;\n    DRS?6000:UNIX_SV:4.2*:7* | DRS?6000:isis:4.2*:7*)\n\tcase `/usr/bin/uname -p` in\n\t    sparc) echo sparc-icl-nx7; exit ;;\n\tesac ;;\n    s390x:SunOS:*:*)\n\techo ${UNAME_MACHINE}-ibm-solaris2`echo ${UNAME_RELEASE}|sed -e 's/[^.]*//'`\n\texit ;;\n    sun4H:SunOS:5.*:*)\n\techo sparc-hal-solaris2`echo ${UNAME_RELEASE}|sed -e 's/[^.]*//'`\n\texit ;;\n    sun4*:SunOS:5.*:* | tadpole*:SunOS:5.*:*)\n\techo sparc-sun-solaris2`echo ${UNAME_RELEASE}|sed -e 's/[^.]*//'`\n\texit ;;\n    i86pc:AuroraUX:5.*:* | i86xen:AuroraUX:5.*:*)\n\techo i386-pc-auroraux${UNAME_RELEASE}\n\texit ;;\n    i86pc:SunOS:5.*:* | i86xen:SunOS:5.*:*)\n\teval $set_cc_for_build\n\tSUN_ARCH=i386\n\t# If there is a compiler, see if it is configured for 64-bit objects.\n\t# Note that the Sun cc does not turn __LP64__ into 1 like gcc does.\n\t# This test works for both compilers.\n\tif [ \"$CC_FOR_BUILD\" != no_compiler_found ]; then\n\t    if (echo '#ifdef __amd64'; echo IS_64BIT_ARCH; echo '#endif') | \\\n\t\t(CCOPTS=\"\" $CC_FOR_BUILD -E - 2>/dev/null) | \\\n\t\tgrep IS_64BIT_ARCH >/dev/null\n\t    then\n\t\tSUN_ARCH=x86_64\n\t    fi\n\tfi\n\techo ${SUN_ARCH}-pc-solaris2`echo ${UNAME_RELEASE}|sed -e 's/[^.]*//'`\n\texit ;;\n    sun4*:SunOS:6*:*)\n\t# According to config.sub, this is the proper way to canonicalize\n\t# SunOS6.  Hard to guess exactly what SunOS6 will be like, but\n\t# it's likely to be more like Solaris than SunOS4.\n\techo sparc-sun-solaris3`echo ${UNAME_RELEASE}|sed -e 's/[^.]*//'`\n\texit ;;\n    sun4*:SunOS:*:*)\n\tcase \"`/usr/bin/arch -k`\" in\n\t    Series*|S4*)\n\t\tUNAME_RELEASE=`uname -v`\n\t\t;;\n\tesac\n\t# Japanese Language versions have a version number like `4.1.3-JL'.\n\techo sparc-sun-sunos`echo ${UNAME_RELEASE}|sed -e 's/-/_/'`\n\texit ;;\n    sun3*:SunOS:*:*)\n\techo m68k-sun-sunos${UNAME_RELEASE}\n\texit ;;\n    sun*:*:4.2BSD:*)\n\tUNAME_RELEASE=`(sed 1q /etc/motd | awk '{print substr($5,1,3)}') 2>/dev/null`\n\ttest \"x${UNAME_RELEASE}\" = x && UNAME_RELEASE=3\n\tcase \"`/bin/arch`\" in\n\t    sun3)\n\t\techo m68k-sun-sunos${UNAME_RELEASE}\n\t\t;;\n\t    sun4)\n\t\techo sparc-sun-sunos${UNAME_RELEASE}\n\t\t;;\n\tesac\n\texit ;;\n    aushp:SunOS:*:*)\n\techo sparc-auspex-sunos${UNAME_RELEASE}\n\texit ;;\n    # The situation for MiNT is a little confusing.  The machine name\n    # can be virtually everything (everything which is not\n    # \"atarist\" or \"atariste\" at least should have a processor\n    # > m68000).  The system name ranges from \"MiNT\" over \"FreeMiNT\"\n    # to the lowercase version \"mint\" (or \"freemint\").  Finally\n    # the system name \"TOS\" denotes a system which is actually not\n    # MiNT.  But MiNT is downward compatible to TOS, so this should\n    # be no problem.\n    atarist[e]:*MiNT:*:* | atarist[e]:*mint:*:* | atarist[e]:*TOS:*:*)\n\techo m68k-atari-mint${UNAME_RELEASE}\n\texit ;;\n    atari*:*MiNT:*:* | atari*:*mint:*:* | atarist[e]:*TOS:*:*)\n\techo m68k-atari-mint${UNAME_RELEASE}\n\texit ;;\n    *falcon*:*MiNT:*:* | *falcon*:*mint:*:* | *falcon*:*TOS:*:*)\n\techo m68k-atari-mint${UNAME_RELEASE}\n\texit ;;\n    milan*:*MiNT:*:* | milan*:*mint:*:* | *milan*:*TOS:*:*)\n\techo m68k-milan-mint${UNAME_RELEASE}\n\texit ;;\n    hades*:*MiNT:*:* | hades*:*mint:*:* | *hades*:*TOS:*:*)\n\techo m68k-hades-mint${UNAME_RELEASE}\n\texit ;;\n    *:*MiNT:*:* | *:*mint:*:* | *:*TOS:*:*)\n\techo m68k-unknown-mint${UNAME_RELEASE}\n\texit ;;\n    m68k:machten:*:*)\n\techo m68k-apple-machten${UNAME_RELEASE}\n\texit ;;\n    powerpc:machten:*:*)\n\techo powerpc-apple-machten${UNAME_RELEASE}\n\texit ;;\n    RISC*:Mach:*:*)\n\techo mips-dec-mach_bsd4.3\n\texit ;;\n    RISC*:ULTRIX:*:*)\n\techo mips-dec-ultrix${UNAME_RELEASE}\n\texit ;;\n    VAX*:ULTRIX*:*:*)\n\techo vax-dec-ultrix${UNAME_RELEASE}\n\texit ;;\n    2020:CLIX:*:* | 2430:CLIX:*:*)\n\techo clipper-intergraph-clix${UNAME_RELEASE}\n\texit ;;\n    mips:*:*:UMIPS | mips:*:*:RISCos)\n\teval $set_cc_for_build\n\tsed 's/^\t//' << EOF >$dummy.c\n#ifdef __cplusplus\n#include <stdio.h>  /* for printf() prototype */\n\tint main (int argc, char *argv[]) {\n#else\n\tint main (argc, argv) int argc; char *argv[]; {\n#endif\n\t#if defined (host_mips) && defined (MIPSEB)\n\t#if defined (SYSTYPE_SYSV)\n\t  printf (\"mips-mips-riscos%ssysv\\\\n\", argv[1]); exit (0);\n\t#endif\n\t#if defined (SYSTYPE_SVR4)\n\t  printf (\"mips-mips-riscos%ssvr4\\\\n\", argv[1]); exit (0);\n\t#endif\n\t#if defined (SYSTYPE_BSD43) || defined(SYSTYPE_BSD)\n\t  printf (\"mips-mips-riscos%sbsd\\\\n\", argv[1]); exit (0);\n\t#endif\n\t#endif\n\t  exit (-1);\n\t}\nEOF\n\t$CC_FOR_BUILD -o $dummy $dummy.c &&\n\t  dummyarg=`echo \"${UNAME_RELEASE}\" | sed -n 's/\\([0-9]*\\).*/\\1/p'` &&\n\t  SYSTEM_NAME=`$dummy $dummyarg` &&\n\t    { echo \"$SYSTEM_NAME\"; exit; }\n\techo mips-mips-riscos${UNAME_RELEASE}\n\texit ;;\n    Motorola:PowerMAX_OS:*:*)\n\techo powerpc-motorola-powermax\n\texit ;;\n    Motorola:*:4.3:PL8-*)\n\techo powerpc-harris-powermax\n\texit ;;\n    Night_Hawk:*:*:PowerMAX_OS | Synergy:PowerMAX_OS:*:*)\n\techo powerpc-harris-powermax\n\texit ;;\n    Night_Hawk:Power_UNIX:*:*)\n\techo powerpc-harris-powerunix\n\texit ;;\n    m88k:CX/UX:7*:*)\n\techo m88k-harris-cxux7\n\texit ;;\n    m88k:*:4*:R4*)\n\techo m88k-motorola-sysv4\n\texit ;;\n    m88k:*:3*:R3*)\n\techo m88k-motorola-sysv3\n\texit ;;\n    AViiON:dgux:*:*)\n\t# DG/UX returns AViiON for all architectures\n\tUNAME_PROCESSOR=`/usr/bin/uname -p`\n\tif [ $UNAME_PROCESSOR = mc88100 ] || [ $UNAME_PROCESSOR = mc88110 ]\n\tthen\n\t    if [ ${TARGET_BINARY_INTERFACE}x = m88kdguxelfx ] || \\\n\t       [ ${TARGET_BINARY_INTERFACE}x = x ]\n\t    then\n\t\techo m88k-dg-dgux${UNAME_RELEASE}\n\t    else\n\t\techo m88k-dg-dguxbcs${UNAME_RELEASE}\n\t    fi\n\telse\n\t    echo i586-dg-dgux${UNAME_RELEASE}\n\tfi\n\texit ;;\n    M88*:DolphinOS:*:*)\t# DolphinOS (SVR3)\n\techo m88k-dolphin-sysv3\n\texit ;;\n    M88*:*:R3*:*)\n\t# Delta 88k system running SVR3\n\techo m88k-motorola-sysv3\n\texit ;;\n    XD88*:*:*:*) # Tektronix XD88 system running UTekV (SVR3)\n\techo m88k-tektronix-sysv3\n\texit ;;\n    Tek43[0-9][0-9]:UTek:*:*) # Tektronix 4300 system running UTek (BSD)\n\techo m68k-tektronix-bsd\n\texit ;;\n    *:IRIX*:*:*)\n\techo mips-sgi-irix`echo ${UNAME_RELEASE}|sed -e 's/-/_/g'`\n\texit ;;\n    ????????:AIX?:[12].1:2)   # AIX 2.2.1 or AIX 2.1.1 is RT/PC AIX.\n\techo romp-ibm-aix     # uname -m gives an 8 hex-code CPU id\n\texit ;;               # Note that: echo \"'`uname -s`'\" gives 'AIX '\n    i*86:AIX:*:*)\n\techo i386-ibm-aix\n\texit ;;\n    ia64:AIX:*:*)\n\tif [ -x /usr/bin/oslevel ] ; then\n\t\tIBM_REV=`/usr/bin/oslevel`\n\telse\n\t\tIBM_REV=${UNAME_VERSION}.${UNAME_RELEASE}\n\tfi\n\techo ${UNAME_MACHINE}-ibm-aix${IBM_REV}\n\texit ;;\n    *:AIX:2:3)\n\tif grep bos325 /usr/include/stdio.h >/dev/null 2>&1; then\n\t\teval $set_cc_for_build\n\t\tsed 's/^\t\t//' << EOF >$dummy.c\n\t\t#include <sys/systemcfg.h>\n\n\t\tmain()\n\t\t\t{\n\t\t\tif (!__power_pc())\n\t\t\t\texit(1);\n\t\t\tputs(\"powerpc-ibm-aix3.2.5\");\n\t\t\texit(0);\n\t\t\t}\nEOF\n\t\tif $CC_FOR_BUILD -o $dummy $dummy.c && SYSTEM_NAME=`$dummy`\n\t\tthen\n\t\t\techo \"$SYSTEM_NAME\"\n\t\telse\n\t\t\techo rs6000-ibm-aix3.2.5\n\t\tfi\n\telif grep bos324 /usr/include/stdio.h >/dev/null 2>&1; then\n\t\techo rs6000-ibm-aix3.2.4\n\telse\n\t\techo rs6000-ibm-aix3.2\n\tfi\n\texit ;;\n    *:AIX:*:[4567])\n\tIBM_CPU_ID=`/usr/sbin/lsdev -C -c processor -S available | sed 1q | awk '{ print $1 }'`\n\tif /usr/sbin/lsattr -El ${IBM_CPU_ID} | grep ' POWER' >/dev/null 2>&1; then\n\t\tIBM_ARCH=rs6000\n\telse\n\t\tIBM_ARCH=powerpc\n\tfi\n\tif [ -x /usr/bin/lslpp ] ; then\n\t\tIBM_REV=`/usr/bin/lslpp -Lqc bos.rte.libc |\n\t\t\t   awk -F: '{ print $3 }' | sed s/[0-9]*$/0/`\n\telse\n\t\tIBM_REV=${UNAME_VERSION}.${UNAME_RELEASE}\n\tfi\n\techo ${IBM_ARCH}-ibm-aix${IBM_REV}\n\texit ;;\n    *:AIX:*:*)\n\techo rs6000-ibm-aix\n\texit ;;\n    ibmrt:4.4BSD:*|romp-ibm:4.4BSD:*)\n\techo romp-ibm-bsd4.4\n\texit ;;\n    ibmrt:*BSD:*|romp-ibm:BSD:*)            # covers RT/PC BSD and\n\techo romp-ibm-bsd${UNAME_RELEASE}   # 4.3 with uname added to\n\texit ;;                             # report: romp-ibm BSD 4.3\n    *:BOSX:*:*)\n\techo rs6000-bull-bosx\n\texit ;;\n    DPX/2?00:B.O.S.:*:*)\n\techo m68k-bull-sysv3\n\texit ;;\n    9000/[34]??:4.3bsd:1.*:*)\n\techo m68k-hp-bsd\n\texit ;;\n    hp300:4.4BSD:*:* | 9000/[34]??:4.3bsd:2.*:*)\n\techo m68k-hp-bsd4.4\n\texit ;;\n    9000/[34678]??:HP-UX:*:*)\n\tHPUX_REV=`echo ${UNAME_RELEASE}|sed -e 's/[^.]*.[0B]*//'`\n\tcase \"${UNAME_MACHINE}\" in\n\t    9000/31?)            HP_ARCH=m68000 ;;\n\t    9000/[34]??)         HP_ARCH=m68k ;;\n\t    9000/[678][0-9][0-9])\n\t\tif [ -x /usr/bin/getconf ]; then\n\t\t    sc_cpu_version=`/usr/bin/getconf SC_CPU_VERSION 2>/dev/null`\n\t\t    sc_kernel_bits=`/usr/bin/getconf SC_KERNEL_BITS 2>/dev/null`\n\t\t    case \"${sc_cpu_version}\" in\n\t\t      523) HP_ARCH=hppa1.0 ;; # CPU_PA_RISC1_0\n\t\t      528) HP_ARCH=hppa1.1 ;; # CPU_PA_RISC1_1\n\t\t      532)                      # CPU_PA_RISC2_0\n\t\t\tcase \"${sc_kernel_bits}\" in\n\t\t\t  32) HP_ARCH=hppa2.0n ;;\n\t\t\t  64) HP_ARCH=hppa2.0w ;;\n\t\t\t  '') HP_ARCH=hppa2.0 ;;   # HP-UX 10.20\n\t\t\tesac ;;\n\t\t    esac\n\t\tfi\n\t\tif [ \"${HP_ARCH}\" = \"\" ]; then\n\t\t    eval $set_cc_for_build\n\t\t    sed 's/^\t\t//' << EOF >$dummy.c\n\n\t\t#define _HPUX_SOURCE\n\t\t#include <stdlib.h>\n\t\t#include <unistd.h>\n\n\t\tint main ()\n\t\t{\n\t\t#if defined(_SC_KERNEL_BITS)\n\t\t    long bits = sysconf(_SC_KERNEL_BITS);\n\t\t#endif\n\t\t    long cpu  = sysconf (_SC_CPU_VERSION);\n\n\t\t    switch (cpu)\n\t\t\t{\n\t\t\tcase CPU_PA_RISC1_0: puts (\"hppa1.0\"); break;\n\t\t\tcase CPU_PA_RISC1_1: puts (\"hppa1.1\"); break;\n\t\t\tcase CPU_PA_RISC2_0:\n\t\t#if defined(_SC_KERNEL_BITS)\n\t\t\t    switch (bits)\n\t\t\t\t{\n\t\t\t\tcase 64: puts (\"hppa2.0w\"); break;\n\t\t\t\tcase 32: puts (\"hppa2.0n\"); break;\n\t\t\t\tdefault: puts (\"hppa2.0\"); break;\n\t\t\t\t} break;\n\t\t#else  /* !defined(_SC_KERNEL_BITS) */\n\t\t\t    puts (\"hppa2.0\"); break;\n\t\t#endif\n\t\t\tdefault: puts (\"hppa1.0\"); break;\n\t\t\t}\n\t\t    exit (0);\n\t\t}\nEOF\n\t\t    (CCOPTS=\"\" $CC_FOR_BUILD -o $dummy $dummy.c 2>/dev/null) && HP_ARCH=`$dummy`\n\t\t    test -z \"$HP_ARCH\" && HP_ARCH=hppa\n\t\tfi ;;\n\tesac\n\tif [ ${HP_ARCH} = hppa2.0w ]\n\tthen\n\t    eval $set_cc_for_build\n\n\t    # hppa2.0w-hp-hpux* has a 64-bit kernel and a compiler generating\n\t    # 32-bit code.  hppa64-hp-hpux* has the same kernel and a compiler\n\t    # generating 64-bit code.  GNU and HP use different nomenclature:\n\t    #\n\t    # $ CC_FOR_BUILD=cc ./config.guess\n\t    # => hppa2.0w-hp-hpux11.23\n\t    # $ CC_FOR_BUILD=\"cc +DA2.0w\" ./config.guess\n\t    # => hppa64-hp-hpux11.23\n\n\t    if echo __LP64__ | (CCOPTS=\"\" $CC_FOR_BUILD -E - 2>/dev/null) |\n\t\tgrep -q __LP64__\n\t    then\n\t\tHP_ARCH=hppa2.0w\n\t    else\n\t\tHP_ARCH=hppa64\n\t    fi\n\tfi\n\techo ${HP_ARCH}-hp-hpux${HPUX_REV}\n\texit ;;\n    ia64:HP-UX:*:*)\n\tHPUX_REV=`echo ${UNAME_RELEASE}|sed -e 's/[^.]*.[0B]*//'`\n\techo ia64-hp-hpux${HPUX_REV}\n\texit ;;\n    3050*:HI-UX:*:*)\n\teval $set_cc_for_build\n\tsed 's/^\t//' << EOF >$dummy.c\n\t#include <unistd.h>\n\tint\n\tmain ()\n\t{\n\t  long cpu = sysconf (_SC_CPU_VERSION);\n\t  /* The order matters, because CPU_IS_HP_MC68K erroneously returns\n\t     true for CPU_PA_RISC1_0.  CPU_IS_PA_RISC returns correct\n\t     results, however.  */\n\t  if (CPU_IS_PA_RISC (cpu))\n\t    {\n\t      switch (cpu)\n\t\t{\n\t\t  case CPU_PA_RISC1_0: puts (\"hppa1.0-hitachi-hiuxwe2\"); break;\n\t\t  case CPU_PA_RISC1_1: puts (\"hppa1.1-hitachi-hiuxwe2\"); break;\n\t\t  case CPU_PA_RISC2_0: puts (\"hppa2.0-hitachi-hiuxwe2\"); break;\n\t\t  default: puts (\"hppa-hitachi-hiuxwe2\"); break;\n\t\t}\n\t    }\n\t  else if (CPU_IS_HP_MC68K (cpu))\n\t    puts (\"m68k-hitachi-hiuxwe2\");\n\t  else puts (\"unknown-hitachi-hiuxwe2\");\n\t  exit (0);\n\t}\nEOF\n\t$CC_FOR_BUILD -o $dummy $dummy.c && SYSTEM_NAME=`$dummy` &&\n\t\t{ echo \"$SYSTEM_NAME\"; exit; }\n\techo unknown-hitachi-hiuxwe2\n\texit ;;\n    9000/7??:4.3bsd:*:* | 9000/8?[79]:4.3bsd:*:*)\n\techo hppa1.1-hp-bsd\n\texit ;;\n    9000/8??:4.3bsd:*:*)\n\techo hppa1.0-hp-bsd\n\texit ;;\n    *9??*:MPE/iX:*:* | *3000*:MPE/iX:*:*)\n\techo hppa1.0-hp-mpeix\n\texit ;;\n    hp7??:OSF1:*:* | hp8?[79]:OSF1:*:*)\n\techo hppa1.1-hp-osf\n\texit ;;\n    hp8??:OSF1:*:*)\n\techo hppa1.0-hp-osf\n\texit ;;\n    i*86:OSF1:*:*)\n\tif [ -x /usr/sbin/sysversion ] ; then\n\t    echo ${UNAME_MACHINE}-unknown-osf1mk\n\telse\n\t    echo ${UNAME_MACHINE}-unknown-osf1\n\tfi\n\texit ;;\n    parisc*:Lites*:*:*)\n\techo hppa1.1-hp-lites\n\texit ;;\n    C1*:ConvexOS:*:* | convex:ConvexOS:C1*:*)\n\techo c1-convex-bsd\n\texit ;;\n    C2*:ConvexOS:*:* | convex:ConvexOS:C2*:*)\n\tif getsysinfo -f scalar_acc\n\tthen echo c32-convex-bsd\n\telse echo c2-convex-bsd\n\tfi\n\texit ;;\n    C34*:ConvexOS:*:* | convex:ConvexOS:C34*:*)\n\techo c34-convex-bsd\n\texit ;;\n    C38*:ConvexOS:*:* | convex:ConvexOS:C38*:*)\n\techo c38-convex-bsd\n\texit ;;\n    C4*:ConvexOS:*:* | convex:ConvexOS:C4*:*)\n\techo c4-convex-bsd\n\texit ;;\n    CRAY*Y-MP:*:*:*)\n\techo ymp-cray-unicos${UNAME_RELEASE} | sed -e 's/\\.[^.]*$/.X/'\n\texit ;;\n    CRAY*[A-Z]90:*:*:*)\n\techo ${UNAME_MACHINE}-cray-unicos${UNAME_RELEASE} \\\n\t| sed -e 's/CRAY.*\\([A-Z]90\\)/\\1/' \\\n\t      -e y/ABCDEFGHIJKLMNOPQRSTUVWXYZ/abcdefghijklmnopqrstuvwxyz/ \\\n\t      -e 's/\\.[^.]*$/.X/'\n\texit ;;\n    CRAY*TS:*:*:*)\n\techo t90-cray-unicos${UNAME_RELEASE} | sed -e 's/\\.[^.]*$/.X/'\n\texit ;;\n    CRAY*T3E:*:*:*)\n\techo alphaev5-cray-unicosmk${UNAME_RELEASE} | sed -e 's/\\.[^.]*$/.X/'\n\texit ;;\n    CRAY*SV1:*:*:*)\n\techo sv1-cray-unicos${UNAME_RELEASE} | sed -e 's/\\.[^.]*$/.X/'\n\texit ;;\n    *:UNICOS/mp:*:*)\n\techo craynv-cray-unicosmp${UNAME_RELEASE} | sed -e 's/\\.[^.]*$/.X/'\n\texit ;;\n    F30[01]:UNIX_System_V:*:* | F700:UNIX_System_V:*:*)\n\tFUJITSU_PROC=`uname -m | tr ABCDEFGHIJKLMNOPQRSTUVWXYZ abcdefghijklmnopqrstuvwxyz`\n\tFUJITSU_SYS=`uname -p | tr ABCDEFGHIJKLMNOPQRSTUVWXYZ abcdefghijklmnopqrstuvwxyz | sed -e 's/\\///'`\n\tFUJITSU_REL=`echo ${UNAME_RELEASE} | sed -e 's/ /_/'`\n\techo \"${FUJITSU_PROC}-fujitsu-${FUJITSU_SYS}${FUJITSU_REL}\"\n\texit ;;\n    5000:UNIX_System_V:4.*:*)\n\tFUJITSU_SYS=`uname -p | tr ABCDEFGHIJKLMNOPQRSTUVWXYZ abcdefghijklmnopqrstuvwxyz | sed -e 's/\\///'`\n\tFUJITSU_REL=`echo ${UNAME_RELEASE} | tr ABCDEFGHIJKLMNOPQRSTUVWXYZ abcdefghijklmnopqrstuvwxyz | sed -e 's/ /_/'`\n\techo \"sparc-fujitsu-${FUJITSU_SYS}${FUJITSU_REL}\"\n\texit ;;\n    i*86:BSD/386:*:* | i*86:BSD/OS:*:* | *:Ascend\\ Embedded/OS:*:*)\n\techo ${UNAME_MACHINE}-pc-bsdi${UNAME_RELEASE}\n\texit ;;\n    sparc*:BSD/OS:*:*)\n\techo sparc-unknown-bsdi${UNAME_RELEASE}\n\texit ;;\n    *:BSD/OS:*:*)\n\techo ${UNAME_MACHINE}-unknown-bsdi${UNAME_RELEASE}\n\texit ;;\n    *:FreeBSD:*:*)\n\tUNAME_PROCESSOR=`/usr/bin/uname -p`\n\tcase ${UNAME_PROCESSOR} in\n\t    amd64)\n\t\tUNAME_PROCESSOR=x86_64 ;;\n\t    i386)\n\t\tUNAME_PROCESSOR=i586 ;;\n\tesac\n\techo ${UNAME_PROCESSOR}-unknown-freebsd`echo ${UNAME_RELEASE}|sed -e 's/[-(].*//'`\n\texit ;;\n    i*:CYGWIN*:*)\n\techo ${UNAME_MACHINE}-pc-cygwin\n\texit ;;\n    *:MINGW64*:*)\n\techo ${UNAME_MACHINE}-pc-mingw64\n\texit ;;\n    *:MINGW*:*)\n\techo ${UNAME_MACHINE}-pc-mingw32\n\texit ;;\n    *:MSYS*:*)\n\techo ${UNAME_MACHINE}-pc-msys\n\texit ;;\n    i*:PW*:*)\n\techo ${UNAME_MACHINE}-pc-pw32\n\texit ;;\n    *:Interix*:*)\n\tcase ${UNAME_MACHINE} in\n\t    x86)\n\t\techo i586-pc-interix${UNAME_RELEASE}\n\t\texit ;;\n\t    authenticamd | genuineintel | EM64T)\n\t\techo x86_64-unknown-interix${UNAME_RELEASE}\n\t\texit ;;\n\t    IA64)\n\t\techo ia64-unknown-interix${UNAME_RELEASE}\n\t\texit ;;\n\tesac ;;\n    i*:UWIN*:*)\n\techo ${UNAME_MACHINE}-pc-uwin\n\texit ;;\n    amd64:CYGWIN*:*:* | x86_64:CYGWIN*:*:*)\n\techo x86_64-unknown-cygwin\n\texit ;;\n    prep*:SunOS:5.*:*)\n\techo powerpcle-unknown-solaris2`echo ${UNAME_RELEASE}|sed -e 's/[^.]*//'`\n\texit ;;\n    *:GNU:*:*)\n\t# the GNU system\n\techo `echo ${UNAME_MACHINE}|sed -e 's,[-/].*$,,'`-unknown-${LIBC}`echo ${UNAME_RELEASE}|sed -e 's,/.*$,,'`\n\texit ;;\n    *:GNU/*:*:*)\n\t# other systems with GNU libc and userland\n\techo ${UNAME_MACHINE}-unknown-`echo ${UNAME_SYSTEM} | sed 's,^[^/]*/,,' | tr \"[:upper:]\" \"[:lower:]\"``echo ${UNAME_RELEASE}|sed -e 's/[-(].*//'`-${LIBC}\n\texit ;;\n    i*86:Minix:*:*)\n\techo ${UNAME_MACHINE}-pc-minix\n\texit ;;\n    aarch64:Linux:*:*)\n\techo ${UNAME_MACHINE}-unknown-linux-${LIBC}\n\texit ;;\n    aarch64_be:Linux:*:*)\n\tUNAME_MACHINE=aarch64_be\n\techo ${UNAME_MACHINE}-unknown-linux-${LIBC}\n\texit ;;\n    alpha:Linux:*:*)\n\tcase `sed -n '/^cpu model/s/^.*: \\(.*\\)/\\1/p' < /proc/cpuinfo` in\n\t  EV5)   UNAME_MACHINE=alphaev5 ;;\n\t  EV56)  UNAME_MACHINE=alphaev56 ;;\n\t  PCA56) UNAME_MACHINE=alphapca56 ;;\n\t  PCA57) UNAME_MACHINE=alphapca56 ;;\n\t  EV6)   UNAME_MACHINE=alphaev6 ;;\n\t  EV67)  UNAME_MACHINE=alphaev67 ;;\n\t  EV68*) UNAME_MACHINE=alphaev68 ;;\n\tesac\n\tobjdump --private-headers /bin/sh | grep -q ld.so.1\n\tif test \"$?\" = 0 ; then LIBC=gnulibc1 ; fi\n\techo ${UNAME_MACHINE}-unknown-linux-${LIBC}\n\texit ;;\n    arc:Linux:*:* | arceb:Linux:*:*)\n\techo ${UNAME_MACHINE}-unknown-linux-${LIBC}\n\texit ;;\n    arm*:Linux:*:*)\n\teval $set_cc_for_build\n\tif echo __ARM_EABI__ | $CC_FOR_BUILD -E - 2>/dev/null \\\n\t    | grep -q __ARM_EABI__\n\tthen\n\t    echo ${UNAME_MACHINE}-unknown-linux-${LIBC}\n\telse\n\t    if echo __ARM_PCS_VFP | $CC_FOR_BUILD -E - 2>/dev/null \\\n\t\t| grep -q __ARM_PCS_VFP\n\t    then\n\t\techo ${UNAME_MACHINE}-unknown-linux-${LIBC}eabi\n\t    else\n\t\techo ${UNAME_MACHINE}-unknown-linux-${LIBC}eabihf\n\t    fi\n\tfi\n\texit ;;\n    avr32*:Linux:*:*)\n\techo ${UNAME_MACHINE}-unknown-linux-${LIBC}\n\texit ;;\n    cris:Linux:*:*)\n\techo ${UNAME_MACHINE}-axis-linux-${LIBC}\n\texit ;;\n    crisv32:Linux:*:*)\n\techo ${UNAME_MACHINE}-axis-linux-${LIBC}\n\texit ;;\n    e2k:Linux:*:*)\n\techo ${UNAME_MACHINE}-unknown-linux-${LIBC}\n\texit ;;\n    frv:Linux:*:*)\n\techo ${UNAME_MACHINE}-unknown-linux-${LIBC}\n\texit ;;\n    hexagon:Linux:*:*)\n\techo ${UNAME_MACHINE}-unknown-linux-${LIBC}\n\texit ;;\n    i*86:Linux:*:*)\n\techo ${UNAME_MACHINE}-pc-linux-${LIBC}\n\texit ;;\n    ia64:Linux:*:*)\n\techo ${UNAME_MACHINE}-unknown-linux-${LIBC}\n\texit ;;\n    k1om:Linux:*:*)\n\techo ${UNAME_MACHINE}-unknown-linux-${LIBC}\n\texit ;;\n    m32r*:Linux:*:*)\n\techo ${UNAME_MACHINE}-unknown-linux-${LIBC}\n\texit ;;\n    m68*:Linux:*:*)\n\techo ${UNAME_MACHINE}-unknown-linux-${LIBC}\n\texit ;;\n    mips:Linux:*:* | mips64:Linux:*:*)\n\teval $set_cc_for_build\n\tsed 's/^\t//' << EOF >$dummy.c\n\t#undef CPU\n\t#undef ${UNAME_MACHINE}\n\t#undef ${UNAME_MACHINE}el\n\t#if defined(__MIPSEL__) || defined(__MIPSEL) || defined(_MIPSEL) || defined(MIPSEL)\n\tCPU=${UNAME_MACHINE}el\n\t#else\n\t#if defined(__MIPSEB__) || defined(__MIPSEB) || defined(_MIPSEB) || defined(MIPSEB)\n\tCPU=${UNAME_MACHINE}\n\t#else\n\tCPU=\n\t#endif\n\t#endif\nEOF\n\teval `$CC_FOR_BUILD -E $dummy.c 2>/dev/null | grep '^CPU'`\n\ttest x\"${CPU}\" != x && { echo \"${CPU}-unknown-linux-${LIBC}\"; exit; }\n\t;;\n    mips64el:Linux:*:*)\n\techo ${UNAME_MACHINE}-unknown-linux-${LIBC}\n\texit ;;\n    openrisc*:Linux:*:*)\n\techo or1k-unknown-linux-${LIBC}\n\texit ;;\n    or32:Linux:*:* | or1k*:Linux:*:*)\n\techo ${UNAME_MACHINE}-unknown-linux-${LIBC}\n\texit ;;\n    padre:Linux:*:*)\n\techo sparc-unknown-linux-${LIBC}\n\texit ;;\n    parisc64:Linux:*:* | hppa64:Linux:*:*)\n\techo hppa64-unknown-linux-${LIBC}\n\texit ;;\n    parisc:Linux:*:* | hppa:Linux:*:*)\n\t# Look for CPU level\n\tcase `grep '^cpu[^a-z]*:' /proc/cpuinfo 2>/dev/null | cut -d' ' -f2` in\n\t  PA7*) echo hppa1.1-unknown-linux-${LIBC} ;;\n\t  PA8*) echo hppa2.0-unknown-linux-${LIBC} ;;\n\t  *)    echo hppa-unknown-linux-${LIBC} ;;\n\tesac\n\texit ;;\n    ppc64:Linux:*:*)\n\techo powerpc64-unknown-linux-${LIBC}\n\texit ;;\n    ppc:Linux:*:*)\n\techo powerpc-unknown-linux-${LIBC}\n\texit ;;\n    ppc64le:Linux:*:*)\n\techo powerpc64le-unknown-linux-${LIBC}\n\texit ;;\n    ppcle:Linux:*:*)\n\techo powerpcle-unknown-linux-${LIBC}\n\texit ;;\n    riscv32:Linux:*:* | riscv64:Linux:*:*)\n\techo ${UNAME_MACHINE}-unknown-linux-${LIBC}\n\texit ;;\n    s390:Linux:*:* | s390x:Linux:*:*)\n\techo ${UNAME_MACHINE}-ibm-linux-${LIBC}\n\texit ;;\n    sh64*:Linux:*:*)\n\techo ${UNAME_MACHINE}-unknown-linux-${LIBC}\n\texit ;;\n    sh*:Linux:*:*)\n\techo ${UNAME_MACHINE}-unknown-linux-${LIBC}\n\texit ;;\n    sparc:Linux:*:* | sparc64:Linux:*:*)\n\techo ${UNAME_MACHINE}-unknown-linux-${LIBC}\n\texit ;;\n    tile*:Linux:*:*)\n\techo ${UNAME_MACHINE}-unknown-linux-${LIBC}\n\texit ;;\n    vax:Linux:*:*)\n\techo ${UNAME_MACHINE}-dec-linux-${LIBC}\n\texit ;;\n    x86_64:Linux:*:*)\n\techo ${UNAME_MACHINE}-pc-linux-${LIBC}\n\texit ;;\n    xtensa*:Linux:*:*)\n\techo ${UNAME_MACHINE}-unknown-linux-${LIBC}\n\texit ;;\n    i*86:DYNIX/ptx:4*:*)\n\t# ptx 4.0 does uname -s correctly, with DYNIX/ptx in there.\n\t# earlier versions are messed up and put the nodename in both\n\t# sysname and nodename.\n\techo i386-sequent-sysv4\n\texit ;;\n    i*86:UNIX_SV:4.2MP:2.*)\n\t# Unixware is an offshoot of SVR4, but it has its own version\n\t# number series starting with 2...\n\t# I am not positive that other SVR4 systems won't match this,\n\t# I just have to hope.  -- rms.\n\t# Use sysv4.2uw... so that sysv4* matches it.\n\techo ${UNAME_MACHINE}-pc-sysv4.2uw${UNAME_VERSION}\n\texit ;;\n    i*86:OS/2:*:*)\n\t# If we were able to find `uname', then EMX Unix compatibility\n\t# is probably installed.\n\techo ${UNAME_MACHINE}-pc-os2-emx\n\texit ;;\n    i*86:XTS-300:*:STOP)\n\techo ${UNAME_MACHINE}-unknown-stop\n\texit ;;\n    i*86:atheos:*:*)\n\techo ${UNAME_MACHINE}-unknown-atheos\n\texit ;;\n    i*86:syllable:*:*)\n\techo ${UNAME_MACHINE}-pc-syllable\n\texit ;;\n    i*86:LynxOS:2.*:* | i*86:LynxOS:3.[01]*:* | i*86:LynxOS:4.[02]*:*)\n\techo i386-unknown-lynxos${UNAME_RELEASE}\n\texit ;;\n    i*86:*DOS:*:*)\n\techo ${UNAME_MACHINE}-pc-msdosdjgpp\n\texit ;;\n    i*86:*:4.*:*)\n\tUNAME_REL=`echo ${UNAME_RELEASE} | sed 's/\\/MP$//'`\n\tif grep Novell /usr/include/link.h >/dev/null 2>/dev/null; then\n\t\techo ${UNAME_MACHINE}-univel-sysv${UNAME_REL}\n\telse\n\t\techo ${UNAME_MACHINE}-pc-sysv${UNAME_REL}\n\tfi\n\texit ;;\n    i*86:*:5:[678]*)\n\t# UnixWare 7.x, OpenUNIX and OpenServer 6.\n\tcase `/bin/uname -X | grep \"^Machine\"` in\n\t    *486*)\t     UNAME_MACHINE=i486 ;;\n\t    *Pentium)\t     UNAME_MACHINE=i586 ;;\n\t    *Pent*|*Celeron) UNAME_MACHINE=i686 ;;\n\tesac\n\techo ${UNAME_MACHINE}-unknown-sysv${UNAME_RELEASE}${UNAME_SYSTEM}${UNAME_VERSION}\n\texit ;;\n    i*86:*:3.2:*)\n\tif test -f /usr/options/cb.name; then\n\t\tUNAME_REL=`sed -n 's/.*Version //p' </usr/options/cb.name`\n\t\techo ${UNAME_MACHINE}-pc-isc$UNAME_REL\n\telif /bin/uname -X 2>/dev/null >/dev/null ; then\n\t\tUNAME_REL=`(/bin/uname -X|grep Release|sed -e 's/.*= //')`\n\t\t(/bin/uname -X|grep i80486 >/dev/null) && UNAME_MACHINE=i486\n\t\t(/bin/uname -X|grep '^Machine.*Pentium' >/dev/null) \\\n\t\t\t&& UNAME_MACHINE=i586\n\t\t(/bin/uname -X|grep '^Machine.*Pent *II' >/dev/null) \\\n\t\t\t&& UNAME_MACHINE=i686\n\t\t(/bin/uname -X|grep '^Machine.*Pentium Pro' >/dev/null) \\\n\t\t\t&& UNAME_MACHINE=i686\n\t\techo ${UNAME_MACHINE}-pc-sco$UNAME_REL\n\telse\n\t\techo ${UNAME_MACHINE}-pc-sysv32\n\tfi\n\texit ;;\n    pc:*:*:*)\n\t# Left here for compatibility:\n\t# uname -m prints for DJGPP always 'pc', but it prints nothing about\n\t# the processor, so we play safe by assuming i586.\n\t# Note: whatever this is, it MUST be the same as what config.sub\n\t# prints for the \"djgpp\" host, or else GDB configure will decide that\n\t# this is a cross-build.\n\techo i586-pc-msdosdjgpp\n\texit ;;\n    Intel:Mach:3*:*)\n\techo i386-pc-mach3\n\texit ;;\n    paragon:*:*:*)\n\techo i860-intel-osf1\n\texit ;;\n    i860:*:4.*:*) # i860-SVR4\n\tif grep Stardent /usr/include/sys/uadmin.h >/dev/null 2>&1 ; then\n\t  echo i860-stardent-sysv${UNAME_RELEASE} # Stardent Vistra i860-SVR4\n\telse # Add other i860-SVR4 vendors below as they are discovered.\n\t  echo i860-unknown-sysv${UNAME_RELEASE}  # Unknown i860-SVR4\n\tfi\n\texit ;;\n    mini*:CTIX:SYS*5:*)\n\t# \"miniframe\"\n\techo m68010-convergent-sysv\n\texit ;;\n    mc68k:UNIX:SYSTEM5:3.51m)\n\techo m68k-convergent-sysv\n\texit ;;\n    M680?0:D-NIX:5.3:*)\n\techo m68k-diab-dnix\n\texit ;;\n    M68*:*:R3V[5678]*:*)\n\ttest -r /sysV68 && { echo 'm68k-motorola-sysv'; exit; } ;;\n    3[345]??:*:4.0:3.0 | 3[34]??A:*:4.0:3.0 | 3[34]??,*:*:4.0:3.0 | 3[34]??/*:*:4.0:3.0 | 4400:*:4.0:3.0 | 4850:*:4.0:3.0 | SKA40:*:4.0:3.0 | SDS2:*:4.0:3.0 | SHG2:*:4.0:3.0 | S7501*:*:4.0:3.0)\n\tOS_REL=''\n\ttest -r /etc/.relid \\\n\t&& OS_REL=.`sed -n 's/[^ ]* [^ ]* \\([0-9][0-9]\\).*/\\1/p' < /etc/.relid`\n\t/bin/uname -p 2>/dev/null | grep 86 >/dev/null \\\n\t  && { echo i486-ncr-sysv4.3${OS_REL}; exit; }\n\t/bin/uname -p 2>/dev/null | /bin/grep entium >/dev/null \\\n\t  && { echo i586-ncr-sysv4.3${OS_REL}; exit; } ;;\n    3[34]??:*:4.0:* | 3[34]??,*:*:4.0:*)\n\t/bin/uname -p 2>/dev/null | grep 86 >/dev/null \\\n\t  && { echo i486-ncr-sysv4; exit; } ;;\n    NCR*:*:4.2:* | MPRAS*:*:4.2:*)\n\tOS_REL='.3'\n\ttest -r /etc/.relid \\\n\t    && OS_REL=.`sed -n 's/[^ ]* [^ ]* \\([0-9][0-9]\\).*/\\1/p' < /etc/.relid`\n\t/bin/uname -p 2>/dev/null | grep 86 >/dev/null \\\n\t    && { echo i486-ncr-sysv4.3${OS_REL}; exit; }\n\t/bin/uname -p 2>/dev/null | /bin/grep entium >/dev/null \\\n\t    && { echo i586-ncr-sysv4.3${OS_REL}; exit; }\n\t/bin/uname -p 2>/dev/null | /bin/grep pteron >/dev/null \\\n\t    && { echo i586-ncr-sysv4.3${OS_REL}; exit; } ;;\n    m68*:LynxOS:2.*:* | m68*:LynxOS:3.0*:*)\n\techo m68k-unknown-lynxos${UNAME_RELEASE}\n\texit ;;\n    mc68030:UNIX_System_V:4.*:*)\n\techo m68k-atari-sysv4\n\texit ;;\n    TSUNAMI:LynxOS:2.*:*)\n\techo sparc-unknown-lynxos${UNAME_RELEASE}\n\texit ;;\n    rs6000:LynxOS:2.*:*)\n\techo rs6000-unknown-lynxos${UNAME_RELEASE}\n\texit ;;\n    PowerPC:LynxOS:2.*:* | PowerPC:LynxOS:3.[01]*:* | PowerPC:LynxOS:4.[02]*:*)\n\techo powerpc-unknown-lynxos${UNAME_RELEASE}\n\texit ;;\n    SM[BE]S:UNIX_SV:*:*)\n\techo mips-dde-sysv${UNAME_RELEASE}\n\texit ;;\n    RM*:ReliantUNIX-*:*:*)\n\techo mips-sni-sysv4\n\texit ;;\n    RM*:SINIX-*:*:*)\n\techo mips-sni-sysv4\n\texit ;;\n    *:SINIX-*:*:*)\n\tif uname -p 2>/dev/null >/dev/null ; then\n\t\tUNAME_MACHINE=`(uname -p) 2>/dev/null`\n\t\techo ${UNAME_MACHINE}-sni-sysv4\n\telse\n\t\techo ns32k-sni-sysv\n\tfi\n\texit ;;\n    PENTIUM:*:4.0*:*)\t# Unisys `ClearPath HMP IX 4000' SVR4/MP effort\n\t\t\t# says <Richard.M.Bartel@ccMail.Census.GOV>\n\techo i586-unisys-sysv4\n\texit ;;\n    *:UNIX_System_V:4*:FTX*)\n\t# From Gerald Hewes <hewes@openmarket.com>.\n\t# How about differentiating between stratus architectures? -djm\n\techo hppa1.1-stratus-sysv4\n\texit ;;\n    *:*:*:FTX*)\n\t# From seanf@swdc.stratus.com.\n\techo i860-stratus-sysv4\n\texit ;;\n    i*86:VOS:*:*)\n\t# From Paul.Green@stratus.com.\n\techo ${UNAME_MACHINE}-stratus-vos\n\texit ;;\n    *:VOS:*:*)\n\t# From Paul.Green@stratus.com.\n\techo hppa1.1-stratus-vos\n\texit ;;\n    mc68*:A/UX:*:*)\n\techo m68k-apple-aux${UNAME_RELEASE}\n\texit ;;\n    news*:NEWS-OS:6*:*)\n\techo mips-sony-newsos6\n\texit ;;\n    R[34]000:*System_V*:*:* | R4000:UNIX_SYSV:*:* | R*000:UNIX_SV:*:*)\n\tif [ -d /usr/nec ]; then\n\t\techo mips-nec-sysv${UNAME_RELEASE}\n\telse\n\t\techo mips-unknown-sysv${UNAME_RELEASE}\n\tfi\n\texit ;;\n    BeBox:BeOS:*:*)\t# BeOS running on hardware made by Be, PPC only.\n\techo powerpc-be-beos\n\texit ;;\n    BeMac:BeOS:*:*)\t# BeOS running on Mac or Mac clone, PPC only.\n\techo powerpc-apple-beos\n\texit ;;\n    BePC:BeOS:*:*)\t# BeOS running on Intel PC compatible.\n\techo i586-pc-beos\n\texit ;;\n    BePC:Haiku:*:*)\t# Haiku running on Intel PC compatible.\n\techo i586-pc-haiku\n\texit ;;\n    x86_64:Haiku:*:*)\n\techo x86_64-unknown-haiku\n\texit ;;\n    SX-4:SUPER-UX:*:*)\n\techo sx4-nec-superux${UNAME_RELEASE}\n\texit ;;\n    SX-5:SUPER-UX:*:*)\n\techo sx5-nec-superux${UNAME_RELEASE}\n\texit ;;\n    SX-6:SUPER-UX:*:*)\n\techo sx6-nec-superux${UNAME_RELEASE}\n\texit ;;\n    SX-7:SUPER-UX:*:*)\n\techo sx7-nec-superux${UNAME_RELEASE}\n\texit ;;\n    SX-8:SUPER-UX:*:*)\n\techo sx8-nec-superux${UNAME_RELEASE}\n\texit ;;\n    SX-8R:SUPER-UX:*:*)\n\techo sx8r-nec-superux${UNAME_RELEASE}\n\texit ;;\n    SX-ACE:SUPER-UX:*:*)\n\techo sxace-nec-superux${UNAME_RELEASE}\n\texit ;;\n    Power*:Rhapsody:*:*)\n\techo powerpc-apple-rhapsody${UNAME_RELEASE}\n\texit ;;\n    *:Rhapsody:*:*)\n\techo ${UNAME_MACHINE}-apple-rhapsody${UNAME_RELEASE}\n\texit ;;\n    *:Darwin:*:*)\n\tUNAME_PROCESSOR=`uname -p` || UNAME_PROCESSOR=unknown\n\teval $set_cc_for_build\n\tif test \"$UNAME_PROCESSOR\" = unknown ; then\n\t    UNAME_PROCESSOR=powerpc\n\tfi\n\tif test `echo \"$UNAME_RELEASE\" | sed -e 's/\\..*//'` -le 10 ; then\n\t    if [ \"$CC_FOR_BUILD\" != no_compiler_found ]; then\n\t\tif (echo '#ifdef __LP64__'; echo IS_64BIT_ARCH; echo '#endif') | \\\n\t\t       (CCOPTS=\"\" $CC_FOR_BUILD -E - 2>/dev/null) | \\\n\t\t       grep IS_64BIT_ARCH >/dev/null\n\t\tthen\n\t\t    case $UNAME_PROCESSOR in\n\t\t\ti386) UNAME_PROCESSOR=x86_64 ;;\n\t\t\tpowerpc) UNAME_PROCESSOR=powerpc64 ;;\n\t\t    esac\n\t\tfi\n\t\t# On 10.4-10.6 one might compile for PowerPC via gcc -arch ppc\n\t\tif (echo '#ifdef __POWERPC__'; echo IS_PPC; echo '#endif') | \\\n\t\t       (CCOPTS=\"\" $CC_FOR_BUILD -E - 2>/dev/null) | \\\n\t\t       grep IS_PPC >/dev/null\n\t\tthen\n\t\t    UNAME_PROCESSOR=powerpc\n\t\tfi\n\t    fi\n\telif test \"$UNAME_PROCESSOR\" = i386 ; then\n\t    # Avoid executing cc on OS X 10.9, as it ships with a stub\n\t    # that puts up a graphical alert prompting to install\n\t    # developer tools.  Any system running Mac OS X 10.7 or\n\t    # later (Darwin 11 and later) is required to have a 64-bit\n\t    # processor. This is not true of the ARM version of Darwin\n\t    # that Apple uses in portable devices.\n\t    UNAME_PROCESSOR=x86_64\n\tfi\n\techo ${UNAME_PROCESSOR}-apple-darwin${UNAME_RELEASE}\n\texit ;;\n    *:procnto*:*:* | *:QNX:[0123456789]*:*)\n\tUNAME_PROCESSOR=`uname -p`\n\tif test \"$UNAME_PROCESSOR\" = x86; then\n\t\tUNAME_PROCESSOR=i386\n\t\tUNAME_MACHINE=pc\n\tfi\n\techo ${UNAME_PROCESSOR}-${UNAME_MACHINE}-nto-qnx${UNAME_RELEASE}\n\texit ;;\n    *:QNX:*:4*)\n\techo i386-pc-qnx\n\texit ;;\n    NEO-*:NONSTOP_KERNEL:*:*)\n\techo neo-tandem-nsk${UNAME_RELEASE}\n\texit ;;\n    NSE-*:NONSTOP_KERNEL:*:*)\n\techo nse-tandem-nsk${UNAME_RELEASE}\n\texit ;;\n    NSR-*:NONSTOP_KERNEL:*:*)\n\techo nsr-tandem-nsk${UNAME_RELEASE}\n\texit ;;\n    NSX-*:NONSTOP_KERNEL:*:*)\n\techo nsx-tandem-nsk${UNAME_RELEASE}\n\texit ;;\n    *:NonStop-UX:*:*)\n\techo mips-compaq-nonstopux\n\texit ;;\n    BS2000:POSIX*:*:*)\n\techo bs2000-siemens-sysv\n\texit ;;\n    DS/*:UNIX_System_V:*:*)\n\techo ${UNAME_MACHINE}-${UNAME_SYSTEM}-${UNAME_RELEASE}\n\texit ;;\n    *:Plan9:*:*)\n\t# \"uname -m\" is not consistent, so use $cputype instead. 386\n\t# is converted to i386 for consistency with other x86\n\t# operating systems.\n\tif test \"$cputype\" = 386; then\n\t    UNAME_MACHINE=i386\n\telse\n\t    UNAME_MACHINE=\"$cputype\"\n\tfi\n\techo ${UNAME_MACHINE}-unknown-plan9\n\texit ;;\n    *:TOPS-10:*:*)\n\techo pdp10-unknown-tops10\n\texit ;;\n    *:TENEX:*:*)\n\techo pdp10-unknown-tenex\n\texit ;;\n    KS10:TOPS-20:*:* | KL10:TOPS-20:*:* | TYPE4:TOPS-20:*:*)\n\techo pdp10-dec-tops20\n\texit ;;\n    XKL-1:TOPS-20:*:* | TYPE5:TOPS-20:*:*)\n\techo pdp10-xkl-tops20\n\texit ;;\n    *:TOPS-20:*:*)\n\techo pdp10-unknown-tops20\n\texit ;;\n    *:ITS:*:*)\n\techo pdp10-unknown-its\n\texit ;;\n    SEI:*:*:SEIUX)\n\techo mips-sei-seiux${UNAME_RELEASE}\n\texit ;;\n    *:DragonFly:*:*)\n\techo ${UNAME_MACHINE}-unknown-dragonfly`echo ${UNAME_RELEASE}|sed -e 's/[-(].*//'`\n\texit ;;\n    *:*VMS:*:*)\n\tUNAME_MACHINE=`(uname -p) 2>/dev/null`\n\tcase \"${UNAME_MACHINE}\" in\n\t    A*) echo alpha-dec-vms ; exit ;;\n\t    I*) echo ia64-dec-vms ; exit ;;\n\t    V*) echo vax-dec-vms ; exit ;;\n\tesac ;;\n    *:XENIX:*:SysV)\n\techo i386-pc-xenix\n\texit ;;\n    i*86:skyos:*:*)\n\techo ${UNAME_MACHINE}-pc-skyos`echo ${UNAME_RELEASE} | sed -e 's/ .*$//'`\n\texit ;;\n    i*86:rdos:*:*)\n\techo ${UNAME_MACHINE}-pc-rdos\n\texit ;;\n    i*86:AROS:*:*)\n\techo ${UNAME_MACHINE}-pc-aros\n\texit ;;\n    x86_64:VMkernel:*:*)\n\techo ${UNAME_MACHINE}-unknown-esx\n\texit ;;\n    amd64:Isilon\\ OneFS:*:*)\n\techo x86_64-unknown-onefs\n\texit ;;\nesac\n\necho \"$0: unable to guess system type\" >&2\n\ncase \"${UNAME_MACHINE}:${UNAME_SYSTEM}\" in\n    mips:Linux | mips64:Linux)\n\t# If we got here on MIPS GNU/Linux, output extra information.\n\tcat >&2 <<EOF\n\nNOTE: MIPS GNU/Linux systems require a C compiler to fully recognize\nthe system type. Please install a C compiler and try again.\nEOF\n\t;;\nesac\n\ncat >&2 <<EOF\n\nThis script (version $timestamp), has failed to recognize the\noperating system you are using. If your script is old, overwrite *all*\ncopies of config.guess and config.sub with the latest versions from:\n\n  https://git.savannah.gnu.org/gitweb/?p=config.git;a=blob_plain;f=config.guess\nand\n  https://git.savannah.gnu.org/gitweb/?p=config.git;a=blob_plain;f=config.sub\n\nIf $0 has already been updated, send the following data and any\ninformation you think might be pertinent to config-patches@gnu.org to\nprovide the necessary information to handle your system.\n\nconfig.guess timestamp = $timestamp\n\nuname -m = `(uname -m) 2>/dev/null || echo unknown`\nuname -r = `(uname -r) 2>/dev/null || echo unknown`\nuname -s = `(uname -s) 2>/dev/null || echo unknown`\nuname -v = `(uname -v) 2>/dev/null || echo unknown`\n\n/usr/bin/uname -p = `(/usr/bin/uname -p) 2>/dev/null`\n/bin/uname -X     = `(/bin/uname -X) 2>/dev/null`\n\nhostinfo               = `(hostinfo) 2>/dev/null`\n/bin/universe          = `(/bin/universe) 2>/dev/null`\n/usr/bin/arch -k       = `(/usr/bin/arch -k) 2>/dev/null`\n/bin/arch              = `(/bin/arch) 2>/dev/null`\n/usr/bin/oslevel       = `(/usr/bin/oslevel) 2>/dev/null`\n/usr/convex/getsysinfo = `(/usr/convex/getsysinfo) 2>/dev/null`\n\nUNAME_MACHINE = ${UNAME_MACHINE}\nUNAME_RELEASE = ${UNAME_RELEASE}\nUNAME_SYSTEM  = ${UNAME_SYSTEM}\nUNAME_VERSION = ${UNAME_VERSION}\nEOF\n\nexit 1\n\n# Local variables:\n# eval: (add-hook 'write-file-functions 'time-stamp)\n# time-stamp-start: \"timestamp='\"\n# time-stamp-format: \"%:y-%02m-%02d\"\n# time-stamp-end: \"'\"\n# End:\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/config.h.in",
    "content": "/* config.h.in.  Generated from configure.ac by autoheader.  */\n\n/* Define to 1 if you have the <dlfcn.h> header file. */\n#undef HAVE_DLFCN_H\n\n/* Define to 1 if you have the <inttypes.h> header file. */\n#undef HAVE_INTTYPES_H\n\n/* Define to 1 if you have the <memory.h> header file. */\n#undef HAVE_MEMORY_H\n\n/* Define to 1 if you have the <stdint.h> header file. */\n#undef HAVE_STDINT_H\n\n/* Define to 1 if you have the <stdlib.h> header file. */\n#undef HAVE_STDLIB_H\n\n/* Define to 1 if you have the <strings.h> header file. */\n#undef HAVE_STRINGS_H\n\n/* Define to 1 if you have the <string.h> header file. */\n#undef HAVE_STRING_H\n\n/* Define to 1 if you have the <sys/stat.h> header file. */\n#undef HAVE_SYS_STAT_H\n\n/* Define to 1 if you have the <sys/types.h> header file. */\n#undef HAVE_SYS_TYPES_H\n\n/* Define to 1 if you have the <unistd.h> header file. */\n#undef HAVE_UNISTD_H\n\n/* Define to the sub-directory where libtool stores uninstalled libraries. */\n#undef LT_OBJDIR\n\n/* Name of package */\n#undef PACKAGE\n\n/* Define to the address where bug reports for this package should be sent. */\n#undef PACKAGE_BUGREPORT\n\n/* Define to the full name of this package. */\n#undef PACKAGE_NAME\n\n/* Define to the full name and version of this package. */\n#undef PACKAGE_STRING\n\n/* Define to the one symbol short name of this package. */\n#undef PACKAGE_TARNAME\n\n/* Define to the home page for this package. */\n#undef PACKAGE_URL\n\n/* Define to the version of this package. */\n#undef PACKAGE_VERSION\n\n/* Define to 1 if you have the ANSI C header files. */\n#undef STDC_HEADERS\n\n/* Version number of package */\n#undef VERSION\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/config.sub",
    "content": "#! /bin/sh\n# Configuration validation subroutine script.\n#   Copyright 1992-2017 Free Software Foundation, Inc.\n\ntimestamp='2017-11-23'\n\n# This file is free software; you can redistribute it and/or modify it\n# under the terms of the GNU General Public License as published by\n# the Free Software Foundation; either version 3 of the License, or\n# (at your option) any later version.\n#\n# This program is distributed in the hope that it will be useful, but\n# WITHOUT ANY WARRANTY; without even the implied warranty of\n# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n# General Public License for more details.\n#\n# You should have received a copy of the GNU General Public License\n# along with this program; if not, see <https://www.gnu.org/licenses/>.\n#\n# As a special exception to the GNU General Public License, if you\n# distribute this file as part of a program that contains a\n# configuration script generated by Autoconf, you may include it under\n# the same distribution terms that you use for the rest of that\n# program.  This Exception is an additional permission under section 7\n# of the GNU General Public License, version 3 (\"GPLv3\").\n\n\n# Please send patches to <config-patches@gnu.org>.\n#\n# Configuration subroutine to validate and canonicalize a configuration type.\n# Supply the specified configuration type as an argument.\n# If it is invalid, we print an error message on stderr and exit with code 1.\n# Otherwise, we print the canonical config type on stdout and succeed.\n\n# You can get the latest version of this script from:\n# https://git.savannah.gnu.org/gitweb/?p=config.git;a=blob_plain;f=config.sub\n\n# This file is supposed to be the same for all GNU packages\n# and recognize all the CPU types, system types and aliases\n# that are meaningful with *any* GNU software.\n# Each package is responsible for reporting which valid configurations\n# it does not support.  The user should be able to distinguish\n# a failure to support a valid configuration from a meaningless\n# configuration.\n\n# The goal of this file is to map all the various variations of a given\n# machine specification into a single specification in the form:\n#\tCPU_TYPE-MANUFACTURER-OPERATING_SYSTEM\n# or in some cases, the newer four-part form:\n#\tCPU_TYPE-MANUFACTURER-KERNEL-OPERATING_SYSTEM\n# It is wrong to echo any other type of specification.\n\nme=`echo \"$0\" | sed -e 's,.*/,,'`\n\nusage=\"\\\nUsage: $0 [OPTION] CPU-MFR-OPSYS or ALIAS\n\nCanonicalize a configuration name.\n\nOptions:\n  -h, --help         print this help, then exit\n  -t, --time-stamp   print date of last modification, then exit\n  -v, --version      print version number, then exit\n\nReport bugs and patches to <config-patches@gnu.org>.\"\n\nversion=\"\\\nGNU config.sub ($timestamp)\n\nCopyright 1992-2017 Free Software Foundation, Inc.\n\nThis is free software; see the source for copying conditions.  There is NO\nwarranty; not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.\"\n\nhelp=\"\nTry \\`$me --help' for more information.\"\n\n# Parse command line\nwhile test $# -gt 0 ; do\n  case $1 in\n    --time-stamp | --time* | -t )\n       echo \"$timestamp\" ; exit ;;\n    --version | -v )\n       echo \"$version\" ; exit ;;\n    --help | --h* | -h )\n       echo \"$usage\"; exit ;;\n    -- )     # Stop option processing\n       shift; break ;;\n    - )\t# Use stdin as input.\n       break ;;\n    -* )\n       echo \"$me: invalid option $1$help\"\n       exit 1 ;;\n\n    *local*)\n       # First pass through any local machine types.\n       echo $1\n       exit ;;\n\n    * )\n       break ;;\n  esac\ndone\n\ncase $# in\n 0) echo \"$me: missing argument$help\" >&2\n    exit 1;;\n 1) ;;\n *) echo \"$me: too many arguments$help\" >&2\n    exit 1;;\nesac\n\n# Separate what the user gave into CPU-COMPANY and OS or KERNEL-OS (if any).\n# Here we must recognize all the valid KERNEL-OS combinations.\nmaybe_os=`echo $1 | sed 's/^\\(.*\\)-\\([^-]*-[^-]*\\)$/\\2/'`\ncase $maybe_os in\n  nto-qnx* | linux-gnu* | linux-android* | linux-dietlibc | linux-newlib* | \\\n  linux-musl* | linux-uclibc* | uclinux-uclibc* | uclinux-gnu* | kfreebsd*-gnu* | \\\n  knetbsd*-gnu* | netbsd*-gnu* | netbsd*-eabi* | \\\n  kopensolaris*-gnu* | cloudabi*-eabi* | \\\n  storm-chaos* | os2-emx* | rtmk-nova*)\n    os=-$maybe_os\n    basic_machine=`echo $1 | sed 's/^\\(.*\\)-\\([^-]*-[^-]*\\)$/\\1/'`\n    ;;\n  android-linux)\n    os=-linux-android\n    basic_machine=`echo $1 | sed 's/^\\(.*\\)-\\([^-]*-[^-]*\\)$/\\1/'`-unknown\n    ;;\n  *)\n    basic_machine=`echo $1 | sed 's/-[^-]*$//'`\n    if [ $basic_machine != $1 ]\n    then os=`echo $1 | sed 's/.*-/-/'`\n    else os=; fi\n    ;;\nesac\n\n### Let's recognize common machines as not being operating systems so\n### that things like config.sub decstation-3100 work.  We also\n### recognize some manufacturers as not being operating systems, so we\n### can provide default operating systems below.\ncase $os in\n\t-sun*os*)\n\t\t# Prevent following clause from handling this invalid input.\n\t\t;;\n\t-dec* | -mips* | -sequent* | -encore* | -pc532* | -sgi* | -sony* | \\\n\t-att* | -7300* | -3300* | -delta* | -motorola* | -sun[234]* | \\\n\t-unicom* | -ibm* | -next | -hp | -isi* | -apollo | -altos* | \\\n\t-convergent* | -ncr* | -news | -32* | -3600* | -3100* | -hitachi* |\\\n\t-c[123]* | -convex* | -sun | -crds | -omron* | -dg | -ultra | -tti* | \\\n\t-harris | -dolphin | -highlevel | -gould | -cbm | -ns | -masscomp | \\\n\t-apple | -axis | -knuth | -cray | -microblaze*)\n\t\tos=\n\t\tbasic_machine=$1\n\t\t;;\n\t-bluegene*)\n\t\tos=-cnk\n\t\t;;\n\t-sim | -cisco | -oki | -wec | -winbond)\n\t\tos=\n\t\tbasic_machine=$1\n\t\t;;\n\t-scout)\n\t\t;;\n\t-wrs)\n\t\tos=-vxworks\n\t\tbasic_machine=$1\n\t\t;;\n\t-chorusos*)\n\t\tos=-chorusos\n\t\tbasic_machine=$1\n\t\t;;\n\t-chorusrdb)\n\t\tos=-chorusrdb\n\t\tbasic_machine=$1\n\t\t;;\n\t-hiux*)\n\t\tos=-hiuxwe2\n\t\t;;\n\t-sco6)\n\t\tos=-sco5v6\n\t\tbasic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'`\n\t\t;;\n\t-sco5)\n\t\tos=-sco3.2v5\n\t\tbasic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'`\n\t\t;;\n\t-sco4)\n\t\tos=-sco3.2v4\n\t\tbasic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'`\n\t\t;;\n\t-sco3.2.[4-9]*)\n\t\tos=`echo $os | sed -e 's/sco3.2./sco3.2v/'`\n\t\tbasic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'`\n\t\t;;\n\t-sco3.2v[4-9]*)\n\t\t# Don't forget version if it is 3.2v4 or newer.\n\t\tbasic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'`\n\t\t;;\n\t-sco5v6*)\n\t\t# Don't forget version if it is 3.2v4 or newer.\n\t\tbasic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'`\n\t\t;;\n\t-sco*)\n\t\tos=-sco3.2v2\n\t\tbasic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'`\n\t\t;;\n\t-udk*)\n\t\tbasic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'`\n\t\t;;\n\t-isc)\n\t\tos=-isc2.2\n\t\tbasic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'`\n\t\t;;\n\t-clix*)\n\t\tbasic_machine=clipper-intergraph\n\t\t;;\n\t-isc*)\n\t\tbasic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'`\n\t\t;;\n\t-lynx*178)\n\t\tos=-lynxos178\n\t\t;;\n\t-lynx*5)\n\t\tos=-lynxos5\n\t\t;;\n\t-lynx*)\n\t\tos=-lynxos\n\t\t;;\n\t-ptx*)\n\t\tbasic_machine=`echo $1 | sed -e 's/86-.*/86-sequent/'`\n\t\t;;\n\t-psos*)\n\t\tos=-psos\n\t\t;;\n\t-mint | -mint[0-9]*)\n\t\tbasic_machine=m68k-atari\n\t\tos=-mint\n\t\t;;\nesac\n\n# Decode aliases for certain CPU-COMPANY combinations.\ncase $basic_machine in\n\t# Recognize the basic CPU types without company name.\n\t# Some are omitted here because they have special meanings below.\n\t1750a | 580 \\\n\t| a29k \\\n\t| aarch64 | aarch64_be \\\n\t| alpha | alphaev[4-8] | alphaev56 | alphaev6[78] | alphapca5[67] \\\n\t| alpha64 | alpha64ev[4-8] | alpha64ev56 | alpha64ev6[78] | alpha64pca5[67] \\\n\t| am33_2.0 \\\n\t| arc | arceb \\\n\t| arm | arm[bl]e | arme[lb] | armv[2-8] | armv[3-8][lb] | armv7[arm] \\\n\t| avr | avr32 \\\n\t| ba \\\n\t| be32 | be64 \\\n\t| bfin \\\n\t| c4x | c8051 | clipper \\\n\t| d10v | d30v | dlx | dsp16xx \\\n\t| e2k | epiphany \\\n\t| fido | fr30 | frv | ft32 \\\n\t| h8300 | h8500 | hppa | hppa1.[01] | hppa2.0 | hppa2.0[nw] | hppa64 \\\n\t| hexagon \\\n\t| i370 | i860 | i960 | ia16 | ia64 \\\n\t| ip2k | iq2000 \\\n\t| k1om \\\n\t| le32 | le64 \\\n\t| lm32 \\\n\t| m32c | m32r | m32rle | m68000 | m68k | m88k \\\n\t| maxq | mb | microblaze | microblazeel | mcore | mep | metag \\\n\t| mips | mipsbe | mipseb | mipsel | mipsle \\\n\t| mips16 \\\n\t| mips64 | mips64el \\\n\t| mips64octeon | mips64octeonel \\\n\t| mips64orion | mips64orionel \\\n\t| mips64r5900 | mips64r5900el \\\n\t| mips64vr | mips64vrel \\\n\t| mips64vr4100 | mips64vr4100el \\\n\t| mips64vr4300 | mips64vr4300el \\\n\t| mips64vr5000 | mips64vr5000el \\\n\t| mips64vr5900 | mips64vr5900el \\\n\t| mipsisa32 | mipsisa32el \\\n\t| mipsisa32r2 | mipsisa32r2el \\\n\t| mipsisa32r6 | mipsisa32r6el \\\n\t| mipsisa64 | mipsisa64el \\\n\t| mipsisa64r2 | mipsisa64r2el \\\n\t| mipsisa64r6 | mipsisa64r6el \\\n\t| mipsisa64sb1 | mipsisa64sb1el \\\n\t| mipsisa64sr71k | mipsisa64sr71kel \\\n\t| mipsr5900 | mipsr5900el \\\n\t| mipstx39 | mipstx39el \\\n\t| mn10200 | mn10300 \\\n\t| moxie \\\n\t| mt \\\n\t| msp430 \\\n\t| nds32 | nds32le | nds32be \\\n\t| nios | nios2 | nios2eb | nios2el \\\n\t| ns16k | ns32k \\\n\t| open8 | or1k | or1knd | or32 \\\n\t| pdp10 | pdp11 | pj | pjl \\\n\t| powerpc | powerpc64 | powerpc64le | powerpcle \\\n\t| pru \\\n\t| pyramid \\\n\t| riscv32 | riscv64 \\\n\t| rl78 | rx \\\n\t| score \\\n\t| sh | sh[1234] | sh[24]a | sh[24]aeb | sh[23]e | sh[234]eb | sheb | shbe | shle | sh[1234]le | sh3ele \\\n\t| sh64 | sh64le \\\n\t| sparc | sparc64 | sparc64b | sparc64v | sparc86x | sparclet | sparclite \\\n\t| sparcv8 | sparcv9 | sparcv9b | sparcv9v \\\n\t| spu \\\n\t| tahoe | tic4x | tic54x | tic55x | tic6x | tic80 | tron \\\n\t| ubicom32 \\\n\t| v850 | v850e | v850e1 | v850e2 | v850es | v850e2v3 \\\n\t| visium \\\n\t| wasm32 \\\n\t| x86 | xc16x | xstormy16 | xtensa \\\n\t| z8k | z80)\n\t\tbasic_machine=$basic_machine-unknown\n\t\t;;\n\tc54x)\n\t\tbasic_machine=tic54x-unknown\n\t\t;;\n\tc55x)\n\t\tbasic_machine=tic55x-unknown\n\t\t;;\n\tc6x)\n\t\tbasic_machine=tic6x-unknown\n\t\t;;\n\tleon|leon[3-9])\n\t\tbasic_machine=sparc-$basic_machine\n\t\t;;\n\tm6811 | m68hc11 | m6812 | m68hc12 | m68hcs12x | nvptx | picochip)\n\t\tbasic_machine=$basic_machine-unknown\n\t\tos=-none\n\t\t;;\n\tm88110 | m680[12346]0 | m683?2 | m68360 | m5200 | v70 | w65 | z8k)\n\t\t;;\n\tms1)\n\t\tbasic_machine=mt-unknown\n\t\t;;\n\n\tstrongarm | thumb | xscale)\n\t\tbasic_machine=arm-unknown\n\t\t;;\n\txgate)\n\t\tbasic_machine=$basic_machine-unknown\n\t\tos=-none\n\t\t;;\n\txscaleeb)\n\t\tbasic_machine=armeb-unknown\n\t\t;;\n\n\txscaleel)\n\t\tbasic_machine=armel-unknown\n\t\t;;\n\n\t# We use `pc' rather than `unknown'\n\t# because (1) that's what they normally are, and\n\t# (2) the word \"unknown\" tends to confuse beginning users.\n\ti*86 | x86_64)\n\t  basic_machine=$basic_machine-pc\n\t  ;;\n\t# Object if more than one company name word.\n\t*-*-*)\n\t\techo Invalid configuration \\`$1\\': machine \\`$basic_machine\\' not recognized 1>&2\n\t\texit 1\n\t\t;;\n\t# Recognize the basic CPU types with company name.\n\t580-* \\\n\t| a29k-* \\\n\t| aarch64-* | aarch64_be-* \\\n\t| alpha-* | alphaev[4-8]-* | alphaev56-* | alphaev6[78]-* \\\n\t| alpha64-* | alpha64ev[4-8]-* | alpha64ev56-* | alpha64ev6[78]-* \\\n\t| alphapca5[67]-* | alpha64pca5[67]-* | arc-* | arceb-* \\\n\t| arm-*  | armbe-* | armle-* | armeb-* | armv*-* \\\n\t| avr-* | avr32-* \\\n\t| ba-* \\\n\t| be32-* | be64-* \\\n\t| bfin-* | bs2000-* \\\n\t| c[123]* | c30-* | [cjt]90-* | c4x-* \\\n\t| c8051-* | clipper-* | craynv-* | cydra-* \\\n\t| d10v-* | d30v-* | dlx-* \\\n\t| e2k-* | elxsi-* \\\n\t| f30[01]-* | f700-* | fido-* | fr30-* | frv-* | fx80-* \\\n\t| h8300-* | h8500-* \\\n\t| hppa-* | hppa1.[01]-* | hppa2.0-* | hppa2.0[nw]-* | hppa64-* \\\n\t| hexagon-* \\\n\t| i*86-* | i860-* | i960-* | ia16-* | ia64-* \\\n\t| ip2k-* | iq2000-* \\\n\t| k1om-* \\\n\t| le32-* | le64-* \\\n\t| lm32-* \\\n\t| m32c-* | m32r-* | m32rle-* \\\n\t| m68000-* | m680[012346]0-* | m68360-* | m683?2-* | m68k-* \\\n\t| m88110-* | m88k-* | maxq-* | mcore-* | metag-* \\\n\t| microblaze-* | microblazeel-* \\\n\t| mips-* | mipsbe-* | mipseb-* | mipsel-* | mipsle-* \\\n\t| mips16-* \\\n\t| mips64-* | mips64el-* \\\n\t| mips64octeon-* | mips64octeonel-* \\\n\t| mips64orion-* | mips64orionel-* \\\n\t| mips64r5900-* | mips64r5900el-* \\\n\t| mips64vr-* | mips64vrel-* \\\n\t| mips64vr4100-* | mips64vr4100el-* \\\n\t| mips64vr4300-* | mips64vr4300el-* \\\n\t| mips64vr5000-* | mips64vr5000el-* \\\n\t| mips64vr5900-* | mips64vr5900el-* \\\n\t| mipsisa32-* | mipsisa32el-* \\\n\t| mipsisa32r2-* | mipsisa32r2el-* \\\n\t| mipsisa32r6-* | mipsisa32r6el-* \\\n\t| mipsisa64-* | mipsisa64el-* \\\n\t| mipsisa64r2-* | mipsisa64r2el-* \\\n\t| mipsisa64r6-* | mipsisa64r6el-* \\\n\t| mipsisa64sb1-* | mipsisa64sb1el-* \\\n\t| mipsisa64sr71k-* | mipsisa64sr71kel-* \\\n\t| mipsr5900-* | mipsr5900el-* \\\n\t| mipstx39-* | mipstx39el-* \\\n\t| mmix-* \\\n\t| mt-* \\\n\t| msp430-* \\\n\t| nds32-* | nds32le-* | nds32be-* \\\n\t| nios-* | nios2-* | nios2eb-* | nios2el-* \\\n\t| none-* | np1-* | ns16k-* | ns32k-* \\\n\t| open8-* \\\n\t| or1k*-* \\\n\t| orion-* \\\n\t| pdp10-* | pdp11-* | pj-* | pjl-* | pn-* | power-* \\\n\t| powerpc-* | powerpc64-* | powerpc64le-* | powerpcle-* \\\n\t| pru-* \\\n\t| pyramid-* \\\n\t| riscv32-* | riscv64-* \\\n\t| rl78-* | romp-* | rs6000-* | rx-* \\\n\t| sh-* | sh[1234]-* | sh[24]a-* | sh[24]aeb-* | sh[23]e-* | sh[34]eb-* | sheb-* | shbe-* \\\n\t| shle-* | sh[1234]le-* | sh3ele-* | sh64-* | sh64le-* \\\n\t| sparc-* | sparc64-* | sparc64b-* | sparc64v-* | sparc86x-* | sparclet-* \\\n\t| sparclite-* \\\n\t| sparcv8-* | sparcv9-* | sparcv9b-* | sparcv9v-* | sv1-* | sx*-* \\\n\t| tahoe-* \\\n\t| tic30-* | tic4x-* | tic54x-* | tic55x-* | tic6x-* | tic80-* \\\n\t| tile*-* \\\n\t| tron-* \\\n\t| ubicom32-* \\\n\t| v850-* | v850e-* | v850e1-* | v850es-* | v850e2-* | v850e2v3-* \\\n\t| vax-* \\\n\t| visium-* \\\n\t| wasm32-* \\\n\t| we32k-* \\\n\t| x86-* | x86_64-* | xc16x-* | xps100-* \\\n\t| xstormy16-* | xtensa*-* \\\n\t| ymp-* \\\n\t| z8k-* | z80-*)\n\t\t;;\n\t# Recognize the basic CPU types without company name, with glob match.\n\txtensa*)\n\t\tbasic_machine=$basic_machine-unknown\n\t\t;;\n\t# Recognize the various machine names and aliases which stand\n\t# for a CPU type and a company and sometimes even an OS.\n\t386bsd)\n\t\tbasic_machine=i386-unknown\n\t\tos=-bsd\n\t\t;;\n\t3b1 | 7300 | 7300-att | att-7300 | pc7300 | safari | unixpc)\n\t\tbasic_machine=m68000-att\n\t\t;;\n\t3b*)\n\t\tbasic_machine=we32k-att\n\t\t;;\n\ta29khif)\n\t\tbasic_machine=a29k-amd\n\t\tos=-udi\n\t\t;;\n\tabacus)\n\t\tbasic_machine=abacus-unknown\n\t\t;;\n\tadobe68k)\n\t\tbasic_machine=m68010-adobe\n\t\tos=-scout\n\t\t;;\n\talliant | fx80)\n\t\tbasic_machine=fx80-alliant\n\t\t;;\n\taltos | altos3068)\n\t\tbasic_machine=m68k-altos\n\t\t;;\n\tam29k)\n\t\tbasic_machine=a29k-none\n\t\tos=-bsd\n\t\t;;\n\tamd64)\n\t\tbasic_machine=x86_64-pc\n\t\t;;\n\tamd64-*)\n\t\tbasic_machine=x86_64-`echo $basic_machine | sed 's/^[^-]*-//'`\n\t\t;;\n\tamdahl)\n\t\tbasic_machine=580-amdahl\n\t\tos=-sysv\n\t\t;;\n\tamiga | amiga-*)\n\t\tbasic_machine=m68k-unknown\n\t\t;;\n\tamigaos | amigados)\n\t\tbasic_machine=m68k-unknown\n\t\tos=-amigaos\n\t\t;;\n\tamigaunix | amix)\n\t\tbasic_machine=m68k-unknown\n\t\tos=-sysv4\n\t\t;;\n\tapollo68)\n\t\tbasic_machine=m68k-apollo\n\t\tos=-sysv\n\t\t;;\n\tapollo68bsd)\n\t\tbasic_machine=m68k-apollo\n\t\tos=-bsd\n\t\t;;\n\taros)\n\t\tbasic_machine=i386-pc\n\t\tos=-aros\n\t\t;;\n\tasmjs)\n\t\tbasic_machine=asmjs-unknown\n\t\t;;\n\taux)\n\t\tbasic_machine=m68k-apple\n\t\tos=-aux\n\t\t;;\n\tbalance)\n\t\tbasic_machine=ns32k-sequent\n\t\tos=-dynix\n\t\t;;\n\tblackfin)\n\t\tbasic_machine=bfin-unknown\n\t\tos=-linux\n\t\t;;\n\tblackfin-*)\n\t\tbasic_machine=bfin-`echo $basic_machine | sed 's/^[^-]*-//'`\n\t\tos=-linux\n\t\t;;\n\tbluegene*)\n\t\tbasic_machine=powerpc-ibm\n\t\tos=-cnk\n\t\t;;\n\tc54x-*)\n\t\tbasic_machine=tic54x-`echo $basic_machine | sed 's/^[^-]*-//'`\n\t\t;;\n\tc55x-*)\n\t\tbasic_machine=tic55x-`echo $basic_machine | sed 's/^[^-]*-//'`\n\t\t;;\n\tc6x-*)\n\t\tbasic_machine=tic6x-`echo $basic_machine | sed 's/^[^-]*-//'`\n\t\t;;\n\tc90)\n\t\tbasic_machine=c90-cray\n\t\tos=-unicos\n\t\t;;\n\tcegcc)\n\t\tbasic_machine=arm-unknown\n\t\tos=-cegcc\n\t\t;;\n\tconvex-c1)\n\t\tbasic_machine=c1-convex\n\t\tos=-bsd\n\t\t;;\n\tconvex-c2)\n\t\tbasic_machine=c2-convex\n\t\tos=-bsd\n\t\t;;\n\tconvex-c32)\n\t\tbasic_machine=c32-convex\n\t\tos=-bsd\n\t\t;;\n\tconvex-c34)\n\t\tbasic_machine=c34-convex\n\t\tos=-bsd\n\t\t;;\n\tconvex-c38)\n\t\tbasic_machine=c38-convex\n\t\tos=-bsd\n\t\t;;\n\tcray | j90)\n\t\tbasic_machine=j90-cray\n\t\tos=-unicos\n\t\t;;\n\tcraynv)\n\t\tbasic_machine=craynv-cray\n\t\tos=-unicosmp\n\t\t;;\n\tcr16 | cr16-*)\n\t\tbasic_machine=cr16-unknown\n\t\tos=-elf\n\t\t;;\n\tcrds | unos)\n\t\tbasic_machine=m68k-crds\n\t\t;;\n\tcrisv32 | crisv32-* | etraxfs*)\n\t\tbasic_machine=crisv32-axis\n\t\t;;\n\tcris | cris-* | etrax*)\n\t\tbasic_machine=cris-axis\n\t\t;;\n\tcrx)\n\t\tbasic_machine=crx-unknown\n\t\tos=-elf\n\t\t;;\n\tda30 | da30-*)\n\t\tbasic_machine=m68k-da30\n\t\t;;\n\tdecstation | decstation-3100 | pmax | pmax-* | pmin | dec3100 | decstatn)\n\t\tbasic_machine=mips-dec\n\t\t;;\n\tdecsystem10* | dec10*)\n\t\tbasic_machine=pdp10-dec\n\t\tos=-tops10\n\t\t;;\n\tdecsystem20* | dec20*)\n\t\tbasic_machine=pdp10-dec\n\t\tos=-tops20\n\t\t;;\n\tdelta | 3300 | motorola-3300 | motorola-delta \\\n\t      | 3300-motorola | delta-motorola)\n\t\tbasic_machine=m68k-motorola\n\t\t;;\n\tdelta88)\n\t\tbasic_machine=m88k-motorola\n\t\tos=-sysv3\n\t\t;;\n\tdicos)\n\t\tbasic_machine=i686-pc\n\t\tos=-dicos\n\t\t;;\n\tdjgpp)\n\t\tbasic_machine=i586-pc\n\t\tos=-msdosdjgpp\n\t\t;;\n\tdpx20 | dpx20-*)\n\t\tbasic_machine=rs6000-bull\n\t\tos=-bosx\n\t\t;;\n\tdpx2*)\n\t\tbasic_machine=m68k-bull\n\t\tos=-sysv3\n\t\t;;\n\te500v[12])\n\t\tbasic_machine=powerpc-unknown\n\t\tos=$os\"spe\"\n\t\t;;\n\te500v[12]-*)\n\t\tbasic_machine=powerpc-`echo $basic_machine | sed 's/^[^-]*-//'`\n\t\tos=$os\"spe\"\n\t\t;;\n\tebmon29k)\n\t\tbasic_machine=a29k-amd\n\t\tos=-ebmon\n\t\t;;\n\telxsi)\n\t\tbasic_machine=elxsi-elxsi\n\t\tos=-bsd\n\t\t;;\n\tencore | umax | mmax)\n\t\tbasic_machine=ns32k-encore\n\t\t;;\n\tes1800 | OSE68k | ose68k | ose | OSE)\n\t\tbasic_machine=m68k-ericsson\n\t\tos=-ose\n\t\t;;\n\tfx2800)\n\t\tbasic_machine=i860-alliant\n\t\t;;\n\tgenix)\n\t\tbasic_machine=ns32k-ns\n\t\t;;\n\tgmicro)\n\t\tbasic_machine=tron-gmicro\n\t\tos=-sysv\n\t\t;;\n\tgo32)\n\t\tbasic_machine=i386-pc\n\t\tos=-go32\n\t\t;;\n\th3050r* | hiux*)\n\t\tbasic_machine=hppa1.1-hitachi\n\t\tos=-hiuxwe2\n\t\t;;\n\th8300hms)\n\t\tbasic_machine=h8300-hitachi\n\t\tos=-hms\n\t\t;;\n\th8300xray)\n\t\tbasic_machine=h8300-hitachi\n\t\tos=-xray\n\t\t;;\n\th8500hms)\n\t\tbasic_machine=h8500-hitachi\n\t\tos=-hms\n\t\t;;\n\tharris)\n\t\tbasic_machine=m88k-harris\n\t\tos=-sysv3\n\t\t;;\n\thp300-*)\n\t\tbasic_machine=m68k-hp\n\t\t;;\n\thp300bsd)\n\t\tbasic_machine=m68k-hp\n\t\tos=-bsd\n\t\t;;\n\thp300hpux)\n\t\tbasic_machine=m68k-hp\n\t\tos=-hpux\n\t\t;;\n\thp3k9[0-9][0-9] | hp9[0-9][0-9])\n\t\tbasic_machine=hppa1.0-hp\n\t\t;;\n\thp9k2[0-9][0-9] | hp9k31[0-9])\n\t\tbasic_machine=m68000-hp\n\t\t;;\n\thp9k3[2-9][0-9])\n\t\tbasic_machine=m68k-hp\n\t\t;;\n\thp9k6[0-9][0-9] | hp6[0-9][0-9])\n\t\tbasic_machine=hppa1.0-hp\n\t\t;;\n\thp9k7[0-79][0-9] | hp7[0-79][0-9])\n\t\tbasic_machine=hppa1.1-hp\n\t\t;;\n\thp9k78[0-9] | hp78[0-9])\n\t\t# FIXME: really hppa2.0-hp\n\t\tbasic_machine=hppa1.1-hp\n\t\t;;\n\thp9k8[67]1 | hp8[67]1 | hp9k80[24] | hp80[24] | hp9k8[78]9 | hp8[78]9 | hp9k893 | hp893)\n\t\t# FIXME: really hppa2.0-hp\n\t\tbasic_machine=hppa1.1-hp\n\t\t;;\n\thp9k8[0-9][13679] | hp8[0-9][13679])\n\t\tbasic_machine=hppa1.1-hp\n\t\t;;\n\thp9k8[0-9][0-9] | hp8[0-9][0-9])\n\t\tbasic_machine=hppa1.0-hp\n\t\t;;\n\thppa-next)\n\t\tos=-nextstep3\n\t\t;;\n\thppaosf)\n\t\tbasic_machine=hppa1.1-hp\n\t\tos=-osf\n\t\t;;\n\thppro)\n\t\tbasic_machine=hppa1.1-hp\n\t\tos=-proelf\n\t\t;;\n\ti370-ibm* | ibm*)\n\t\tbasic_machine=i370-ibm\n\t\t;;\n\ti*86v32)\n\t\tbasic_machine=`echo $1 | sed -e 's/86.*/86-pc/'`\n\t\tos=-sysv32\n\t\t;;\n\ti*86v4*)\n\t\tbasic_machine=`echo $1 | sed -e 's/86.*/86-pc/'`\n\t\tos=-sysv4\n\t\t;;\n\ti*86v)\n\t\tbasic_machine=`echo $1 | sed -e 's/86.*/86-pc/'`\n\t\tos=-sysv\n\t\t;;\n\ti*86sol2)\n\t\tbasic_machine=`echo $1 | sed -e 's/86.*/86-pc/'`\n\t\tos=-solaris2\n\t\t;;\n\ti386mach)\n\t\tbasic_machine=i386-mach\n\t\tos=-mach\n\t\t;;\n\ti386-vsta | vsta)\n\t\tbasic_machine=i386-unknown\n\t\tos=-vsta\n\t\t;;\n\tiris | iris4d)\n\t\tbasic_machine=mips-sgi\n\t\tcase $os in\n\t\t    -irix*)\n\t\t\t;;\n\t\t    *)\n\t\t\tos=-irix4\n\t\t\t;;\n\t\tesac\n\t\t;;\n\tisi68 | isi)\n\t\tbasic_machine=m68k-isi\n\t\tos=-sysv\n\t\t;;\n\tleon-*|leon[3-9]-*)\n\t\tbasic_machine=sparc-`echo $basic_machine | sed 's/-.*//'`\n\t\t;;\n\tm68knommu)\n\t\tbasic_machine=m68k-unknown\n\t\tos=-linux\n\t\t;;\n\tm68knommu-*)\n\t\tbasic_machine=m68k-`echo $basic_machine | sed 's/^[^-]*-//'`\n\t\tos=-linux\n\t\t;;\n\tm88k-omron*)\n\t\tbasic_machine=m88k-omron\n\t\t;;\n\tmagnum | m3230)\n\t\tbasic_machine=mips-mips\n\t\tos=-sysv\n\t\t;;\n\tmerlin)\n\t\tbasic_machine=ns32k-utek\n\t\tos=-sysv\n\t\t;;\n\tmicroblaze*)\n\t\tbasic_machine=microblaze-xilinx\n\t\t;;\n\tmingw64)\n\t\tbasic_machine=x86_64-pc\n\t\tos=-mingw64\n\t\t;;\n\tmingw32)\n\t\tbasic_machine=i686-pc\n\t\tos=-mingw32\n\t\t;;\n\tmingw32ce)\n\t\tbasic_machine=arm-unknown\n\t\tos=-mingw32ce\n\t\t;;\n\tminiframe)\n\t\tbasic_machine=m68000-convergent\n\t\t;;\n\t*mint | -mint[0-9]* | *MiNT | *MiNT[0-9]*)\n\t\tbasic_machine=m68k-atari\n\t\tos=-mint\n\t\t;;\n\tmips3*-*)\n\t\tbasic_machine=`echo $basic_machine | sed -e 's/mips3/mips64/'`\n\t\t;;\n\tmips3*)\n\t\tbasic_machine=`echo $basic_machine | sed -e 's/mips3/mips64/'`-unknown\n\t\t;;\n\tmonitor)\n\t\tbasic_machine=m68k-rom68k\n\t\tos=-coff\n\t\t;;\n\tmorphos)\n\t\tbasic_machine=powerpc-unknown\n\t\tos=-morphos\n\t\t;;\n\tmoxiebox)\n\t\tbasic_machine=moxie-unknown\n\t\tos=-moxiebox\n\t\t;;\n\tmsdos)\n\t\tbasic_machine=i386-pc\n\t\tos=-msdos\n\t\t;;\n\tms1-*)\n\t\tbasic_machine=`echo $basic_machine | sed -e 's/ms1-/mt-/'`\n\t\t;;\n\tmsys)\n\t\tbasic_machine=i686-pc\n\t\tos=-msys\n\t\t;;\n\tmvs)\n\t\tbasic_machine=i370-ibm\n\t\tos=-mvs\n\t\t;;\n\tnacl)\n\t\tbasic_machine=le32-unknown\n\t\tos=-nacl\n\t\t;;\n\tncr3000)\n\t\tbasic_machine=i486-ncr\n\t\tos=-sysv4\n\t\t;;\n\tnetbsd386)\n\t\tbasic_machine=i386-unknown\n\t\tos=-netbsd\n\t\t;;\n\tnetwinder)\n\t\tbasic_machine=armv4l-rebel\n\t\tos=-linux\n\t\t;;\n\tnews | news700 | news800 | news900)\n\t\tbasic_machine=m68k-sony\n\t\tos=-newsos\n\t\t;;\n\tnews1000)\n\t\tbasic_machine=m68030-sony\n\t\tos=-newsos\n\t\t;;\n\tnews-3600 | risc-news)\n\t\tbasic_machine=mips-sony\n\t\tos=-newsos\n\t\t;;\n\tnecv70)\n\t\tbasic_machine=v70-nec\n\t\tos=-sysv\n\t\t;;\n\tnext | m*-next)\n\t\tbasic_machine=m68k-next\n\t\tcase $os in\n\t\t    -nextstep* )\n\t\t\t;;\n\t\t    -ns2*)\n\t\t      os=-nextstep2\n\t\t\t;;\n\t\t    *)\n\t\t      os=-nextstep3\n\t\t\t;;\n\t\tesac\n\t\t;;\n\tnh3000)\n\t\tbasic_machine=m68k-harris\n\t\tos=-cxux\n\t\t;;\n\tnh[45]000)\n\t\tbasic_machine=m88k-harris\n\t\tos=-cxux\n\t\t;;\n\tnindy960)\n\t\tbasic_machine=i960-intel\n\t\tos=-nindy\n\t\t;;\n\tmon960)\n\t\tbasic_machine=i960-intel\n\t\tos=-mon960\n\t\t;;\n\tnonstopux)\n\t\tbasic_machine=mips-compaq\n\t\tos=-nonstopux\n\t\t;;\n\tnp1)\n\t\tbasic_machine=np1-gould\n\t\t;;\n\tneo-tandem)\n\t\tbasic_machine=neo-tandem\n\t\t;;\n\tnse-tandem)\n\t\tbasic_machine=nse-tandem\n\t\t;;\n\tnsr-tandem)\n\t\tbasic_machine=nsr-tandem\n\t\t;;\n\tnsx-tandem)\n\t\tbasic_machine=nsx-tandem\n\t\t;;\n\top50n-* | op60c-*)\n\t\tbasic_machine=hppa1.1-oki\n\t\tos=-proelf\n\t\t;;\n\topenrisc | openrisc-*)\n\t\tbasic_machine=or32-unknown\n\t\t;;\n\tos400)\n\t\tbasic_machine=powerpc-ibm\n\t\tos=-os400\n\t\t;;\n\tOSE68000 | ose68000)\n\t\tbasic_machine=m68000-ericsson\n\t\tos=-ose\n\t\t;;\n\tos68k)\n\t\tbasic_machine=m68k-none\n\t\tos=-os68k\n\t\t;;\n\tpa-hitachi)\n\t\tbasic_machine=hppa1.1-hitachi\n\t\tos=-hiuxwe2\n\t\t;;\n\tparagon)\n\t\tbasic_machine=i860-intel\n\t\tos=-osf\n\t\t;;\n\tparisc)\n\t\tbasic_machine=hppa-unknown\n\t\tos=-linux\n\t\t;;\n\tparisc-*)\n\t\tbasic_machine=hppa-`echo $basic_machine | sed 's/^[^-]*-//'`\n\t\tos=-linux\n\t\t;;\n\tpbd)\n\t\tbasic_machine=sparc-tti\n\t\t;;\n\tpbb)\n\t\tbasic_machine=m68k-tti\n\t\t;;\n\tpc532 | pc532-*)\n\t\tbasic_machine=ns32k-pc532\n\t\t;;\n\tpc98)\n\t\tbasic_machine=i386-pc\n\t\t;;\n\tpc98-*)\n\t\tbasic_machine=i386-`echo $basic_machine | sed 's/^[^-]*-//'`\n\t\t;;\n\tpentium | p5 | k5 | k6 | nexgen | viac3)\n\t\tbasic_machine=i586-pc\n\t\t;;\n\tpentiumpro | p6 | 6x86 | athlon | athlon_*)\n\t\tbasic_machine=i686-pc\n\t\t;;\n\tpentiumii | pentium2 | pentiumiii | pentium3)\n\t\tbasic_machine=i686-pc\n\t\t;;\n\tpentium4)\n\t\tbasic_machine=i786-pc\n\t\t;;\n\tpentium-* | p5-* | k5-* | k6-* | nexgen-* | viac3-*)\n\t\tbasic_machine=i586-`echo $basic_machine | sed 's/^[^-]*-//'`\n\t\t;;\n\tpentiumpro-* | p6-* | 6x86-* | athlon-*)\n\t\tbasic_machine=i686-`echo $basic_machine | sed 's/^[^-]*-//'`\n\t\t;;\n\tpentiumii-* | pentium2-* | pentiumiii-* | pentium3-*)\n\t\tbasic_machine=i686-`echo $basic_machine | sed 's/^[^-]*-//'`\n\t\t;;\n\tpentium4-*)\n\t\tbasic_machine=i786-`echo $basic_machine | sed 's/^[^-]*-//'`\n\t\t;;\n\tpn)\n\t\tbasic_machine=pn-gould\n\t\t;;\n\tpower)\tbasic_machine=power-ibm\n\t\t;;\n\tppc | ppcbe)\tbasic_machine=powerpc-unknown\n\t\t;;\n\tppc-* | ppcbe-*)\n\t\tbasic_machine=powerpc-`echo $basic_machine | sed 's/^[^-]*-//'`\n\t\t;;\n\tppcle | powerpclittle)\n\t\tbasic_machine=powerpcle-unknown\n\t\t;;\n\tppcle-* | powerpclittle-*)\n\t\tbasic_machine=powerpcle-`echo $basic_machine | sed 's/^[^-]*-//'`\n\t\t;;\n\tppc64)\tbasic_machine=powerpc64-unknown\n\t\t;;\n\tppc64-*) basic_machine=powerpc64-`echo $basic_machine | sed 's/^[^-]*-//'`\n\t\t;;\n\tppc64le | powerpc64little)\n\t\tbasic_machine=powerpc64le-unknown\n\t\t;;\n\tppc64le-* | powerpc64little-*)\n\t\tbasic_machine=powerpc64le-`echo $basic_machine | sed 's/^[^-]*-//'`\n\t\t;;\n\tps2)\n\t\tbasic_machine=i386-ibm\n\t\t;;\n\tpw32)\n\t\tbasic_machine=i586-unknown\n\t\tos=-pw32\n\t\t;;\n\trdos | rdos64)\n\t\tbasic_machine=x86_64-pc\n\t\tos=-rdos\n\t\t;;\n\trdos32)\n\t\tbasic_machine=i386-pc\n\t\tos=-rdos\n\t\t;;\n\trom68k)\n\t\tbasic_machine=m68k-rom68k\n\t\tos=-coff\n\t\t;;\n\trm[46]00)\n\t\tbasic_machine=mips-siemens\n\t\t;;\n\trtpc | rtpc-*)\n\t\tbasic_machine=romp-ibm\n\t\t;;\n\ts390 | s390-*)\n\t\tbasic_machine=s390-ibm\n\t\t;;\n\ts390x | s390x-*)\n\t\tbasic_machine=s390x-ibm\n\t\t;;\n\tsa29200)\n\t\tbasic_machine=a29k-amd\n\t\tos=-udi\n\t\t;;\n\tsb1)\n\t\tbasic_machine=mipsisa64sb1-unknown\n\t\t;;\n\tsb1el)\n\t\tbasic_machine=mipsisa64sb1el-unknown\n\t\t;;\n\tsde)\n\t\tbasic_machine=mipsisa32-sde\n\t\tos=-elf\n\t\t;;\n\tsei)\n\t\tbasic_machine=mips-sei\n\t\tos=-seiux\n\t\t;;\n\tsequent)\n\t\tbasic_machine=i386-sequent\n\t\t;;\n\tsh)\n\t\tbasic_machine=sh-hitachi\n\t\tos=-hms\n\t\t;;\n\tsh5el)\n\t\tbasic_machine=sh5le-unknown\n\t\t;;\n\tsh64)\n\t\tbasic_machine=sh64-unknown\n\t\t;;\n\tsparclite-wrs | simso-wrs)\n\t\tbasic_machine=sparclite-wrs\n\t\tos=-vxworks\n\t\t;;\n\tsps7)\n\t\tbasic_machine=m68k-bull\n\t\tos=-sysv2\n\t\t;;\n\tspur)\n\t\tbasic_machine=spur-unknown\n\t\t;;\n\tst2000)\n\t\tbasic_machine=m68k-tandem\n\t\t;;\n\tstratus)\n\t\tbasic_machine=i860-stratus\n\t\tos=-sysv4\n\t\t;;\n\tstrongarm-* | thumb-*)\n\t\tbasic_machine=arm-`echo $basic_machine | sed 's/^[^-]*-//'`\n\t\t;;\n\tsun2)\n\t\tbasic_machine=m68000-sun\n\t\t;;\n\tsun2os3)\n\t\tbasic_machine=m68000-sun\n\t\tos=-sunos3\n\t\t;;\n\tsun2os4)\n\t\tbasic_machine=m68000-sun\n\t\tos=-sunos4\n\t\t;;\n\tsun3os3)\n\t\tbasic_machine=m68k-sun\n\t\tos=-sunos3\n\t\t;;\n\tsun3os4)\n\t\tbasic_machine=m68k-sun\n\t\tos=-sunos4\n\t\t;;\n\tsun4os3)\n\t\tbasic_machine=sparc-sun\n\t\tos=-sunos3\n\t\t;;\n\tsun4os4)\n\t\tbasic_machine=sparc-sun\n\t\tos=-sunos4\n\t\t;;\n\tsun4sol2)\n\t\tbasic_machine=sparc-sun\n\t\tos=-solaris2\n\t\t;;\n\tsun3 | sun3-*)\n\t\tbasic_machine=m68k-sun\n\t\t;;\n\tsun4)\n\t\tbasic_machine=sparc-sun\n\t\t;;\n\tsun386 | sun386i | roadrunner)\n\t\tbasic_machine=i386-sun\n\t\t;;\n\tsv1)\n\t\tbasic_machine=sv1-cray\n\t\tos=-unicos\n\t\t;;\n\tsymmetry)\n\t\tbasic_machine=i386-sequent\n\t\tos=-dynix\n\t\t;;\n\tt3e)\n\t\tbasic_machine=alphaev5-cray\n\t\tos=-unicos\n\t\t;;\n\tt90)\n\t\tbasic_machine=t90-cray\n\t\tos=-unicos\n\t\t;;\n\ttile*)\n\t\tbasic_machine=$basic_machine-unknown\n\t\tos=-linux-gnu\n\t\t;;\n\ttx39)\n\t\tbasic_machine=mipstx39-unknown\n\t\t;;\n\ttx39el)\n\t\tbasic_machine=mipstx39el-unknown\n\t\t;;\n\ttoad1)\n\t\tbasic_machine=pdp10-xkl\n\t\tos=-tops20\n\t\t;;\n\ttower | tower-32)\n\t\tbasic_machine=m68k-ncr\n\t\t;;\n\ttpf)\n\t\tbasic_machine=s390x-ibm\n\t\tos=-tpf\n\t\t;;\n\tudi29k)\n\t\tbasic_machine=a29k-amd\n\t\tos=-udi\n\t\t;;\n\tultra3)\n\t\tbasic_machine=a29k-nyu\n\t\tos=-sym1\n\t\t;;\n\tv810 | necv810)\n\t\tbasic_machine=v810-nec\n\t\tos=-none\n\t\t;;\n\tvaxv)\n\t\tbasic_machine=vax-dec\n\t\tos=-sysv\n\t\t;;\n\tvms)\n\t\tbasic_machine=vax-dec\n\t\tos=-vms\n\t\t;;\n\tvpp*|vx|vx-*)\n\t\tbasic_machine=f301-fujitsu\n\t\t;;\n\tvxworks960)\n\t\tbasic_machine=i960-wrs\n\t\tos=-vxworks\n\t\t;;\n\tvxworks68)\n\t\tbasic_machine=m68k-wrs\n\t\tos=-vxworks\n\t\t;;\n\tvxworks29k)\n\t\tbasic_machine=a29k-wrs\n\t\tos=-vxworks\n\t\t;;\n\twasm32)\n\t\tbasic_machine=wasm32-unknown\n\t\t;;\n\tw65*)\n\t\tbasic_machine=w65-wdc\n\t\tos=-none\n\t\t;;\n\tw89k-*)\n\t\tbasic_machine=hppa1.1-winbond\n\t\tos=-proelf\n\t\t;;\n\tx64)\n\t\tbasic_machine=x86_64-pc\n\t\t;;\n\txbox)\n\t\tbasic_machine=i686-pc\n\t\tos=-mingw32\n\t\t;;\n\txps | xps100)\n\t\tbasic_machine=xps100-honeywell\n\t\t;;\n\txscale-* | xscalee[bl]-*)\n\t\tbasic_machine=`echo $basic_machine | sed 's/^xscale/arm/'`\n\t\t;;\n\tymp)\n\t\tbasic_machine=ymp-cray\n\t\tos=-unicos\n\t\t;;\n\tz8k-*-coff)\n\t\tbasic_machine=z8k-unknown\n\t\tos=-sim\n\t\t;;\n\tz80-*-coff)\n\t\tbasic_machine=z80-unknown\n\t\tos=-sim\n\t\t;;\n\tnone)\n\t\tbasic_machine=none-none\n\t\tos=-none\n\t\t;;\n\n# Here we handle the default manufacturer of certain CPU types.  It is in\n# some cases the only manufacturer, in others, it is the most popular.\n\tw89k)\n\t\tbasic_machine=hppa1.1-winbond\n\t\t;;\n\top50n)\n\t\tbasic_machine=hppa1.1-oki\n\t\t;;\n\top60c)\n\t\tbasic_machine=hppa1.1-oki\n\t\t;;\n\tromp)\n\t\tbasic_machine=romp-ibm\n\t\t;;\n\tmmix)\n\t\tbasic_machine=mmix-knuth\n\t\t;;\n\trs6000)\n\t\tbasic_machine=rs6000-ibm\n\t\t;;\n\tvax)\n\t\tbasic_machine=vax-dec\n\t\t;;\n\tpdp10)\n\t\t# there are many clones, so DEC is not a safe bet\n\t\tbasic_machine=pdp10-unknown\n\t\t;;\n\tpdp11)\n\t\tbasic_machine=pdp11-dec\n\t\t;;\n\twe32k)\n\t\tbasic_machine=we32k-att\n\t\t;;\n\tsh[1234] | sh[24]a | sh[24]aeb | sh[34]eb | sh[1234]le | sh[23]ele)\n\t\tbasic_machine=sh-unknown\n\t\t;;\n\tsparc | sparcv8 | sparcv9 | sparcv9b | sparcv9v)\n\t\tbasic_machine=sparc-sun\n\t\t;;\n\tcydra)\n\t\tbasic_machine=cydra-cydrome\n\t\t;;\n\torion)\n\t\tbasic_machine=orion-highlevel\n\t\t;;\n\torion105)\n\t\tbasic_machine=clipper-highlevel\n\t\t;;\n\tmac | mpw | mac-mpw)\n\t\tbasic_machine=m68k-apple\n\t\t;;\n\tpmac | pmac-mpw)\n\t\tbasic_machine=powerpc-apple\n\t\t;;\n\t*-unknown)\n\t\t# Make sure to match an already-canonicalized machine name.\n\t\t;;\n\t*)\n\t\techo Invalid configuration \\`$1\\': machine \\`$basic_machine\\' not recognized 1>&2\n\t\texit 1\n\t\t;;\nesac\n\n# Here we canonicalize certain aliases for manufacturers.\ncase $basic_machine in\n\t*-digital*)\n\t\tbasic_machine=`echo $basic_machine | sed 's/digital.*/dec/'`\n\t\t;;\n\t*-commodore*)\n\t\tbasic_machine=`echo $basic_machine | sed 's/commodore.*/cbm/'`\n\t\t;;\n\t*)\n\t\t;;\nesac\n\n# Decode manufacturer-specific aliases for certain operating systems.\n\nif [ x\"$os\" != x\"\" ]\nthen\ncase $os in\n\t# First match some system type aliases that might get confused\n\t# with valid system types.\n\t# -solaris* is a basic system type, with this one exception.\n\t-auroraux)\n\t\tos=-auroraux\n\t\t;;\n\t-solaris1 | -solaris1.*)\n\t\tos=`echo $os | sed -e 's|solaris1|sunos4|'`\n\t\t;;\n\t-solaris)\n\t\tos=-solaris2\n\t\t;;\n\t-svr4*)\n\t\tos=-sysv4\n\t\t;;\n\t-unixware*)\n\t\tos=-sysv4.2uw\n\t\t;;\n\t-gnu/linux*)\n\t\tos=`echo $os | sed -e 's|gnu/linux|linux-gnu|'`\n\t\t;;\n\t# Now accept the basic system types.\n\t# The portable systems comes first.\n\t# Each alternative MUST end in a * to match a version number.\n\t# -sysv* is not here because it comes later, after sysvr4.\n\t-gnu* | -bsd* | -mach* | -minix* | -genix* | -ultrix* | -irix* \\\n\t      | -*vms* | -sco* | -esix* | -isc* | -aix* | -cnk* | -sunos | -sunos[34]*\\\n\t      | -hpux* | -unos* | -osf* | -luna* | -dgux* | -auroraux* | -solaris* \\\n\t      | -sym* | -kopensolaris* | -plan9* \\\n\t      | -amigaos* | -amigados* | -msdos* | -newsos* | -unicos* | -aof* \\\n\t      | -aos* | -aros* | -cloudabi* | -sortix* \\\n\t      | -nindy* | -vxsim* | -vxworks* | -ebmon* | -hms* | -mvs* \\\n\t      | -clix* | -riscos* | -uniplus* | -iris* | -rtu* | -xenix* \\\n\t      | -hiux* | -386bsd* | -knetbsd* | -mirbsd* | -netbsd* \\\n\t      | -bitrig* | -openbsd* | -solidbsd* | -libertybsd* \\\n\t      | -ekkobsd* | -kfreebsd* | -freebsd* | -riscix* | -lynxos* \\\n\t      | -bosx* | -nextstep* | -cxux* | -aout* | -elf* | -oabi* \\\n\t      | -ptx* | -coff* | -ecoff* | -winnt* | -domain* | -vsta* \\\n\t      | -udi* | -eabi* | -lites* | -ieee* | -go32* | -aux* \\\n\t      | -chorusos* | -chorusrdb* | -cegcc* | -glidix* \\\n\t      | -cygwin* | -msys* | -pe* | -psos* | -moss* | -proelf* | -rtems* \\\n\t      | -midipix* | -mingw32* | -mingw64* | -linux-gnu* | -linux-android* \\\n\t      | -linux-newlib* | -linux-musl* | -linux-uclibc* \\\n\t      | -uxpv* | -beos* | -mpeix* | -udk* | -moxiebox* \\\n\t      | -interix* | -uwin* | -mks* | -rhapsody* | -darwin* | -opened* \\\n\t      | -openstep* | -oskit* | -conix* | -pw32* | -nonstopux* \\\n\t      | -storm-chaos* | -tops10* | -tenex* | -tops20* | -its* \\\n\t      | -os2* | -vos* | -palmos* | -uclinux* | -nucleus* \\\n\t      | -morphos* | -superux* | -rtmk* | -rtmk-nova* | -windiss* \\\n\t      | -powermax* | -dnix* | -nx6 | -nx7 | -sei* | -dragonfly* \\\n\t      | -skyos* | -haiku* | -rdos* | -toppers* | -drops* | -es* \\\n\t      | -onefs* | -tirtos* | -phoenix* | -fuchsia* | -redox*)\n\t# Remember, each alternative MUST END IN *, to match a version number.\n\t\t;;\n\t-qnx*)\n\t\tcase $basic_machine in\n\t\t    x86-* | i*86-*)\n\t\t\t;;\n\t\t    *)\n\t\t\tos=-nto$os\n\t\t\t;;\n\t\tesac\n\t\t;;\n\t-nto-qnx*)\n\t\t;;\n\t-nto*)\n\t\tos=`echo $os | sed -e 's|nto|nto-qnx|'`\n\t\t;;\n\t-sim | -es1800* | -hms* | -xray | -os68k* | -none* | -v88r* \\\n\t      | -windows* | -osx | -abug | -netware* | -os9* | -beos* | -haiku* \\\n\t      | -macos* | -mpw* | -magic* | -mmixware* | -mon960* | -lnews*)\n\t\t;;\n\t-mac*)\n\t\tos=`echo $os | sed -e 's|mac|macos|'`\n\t\t;;\n\t-linux-dietlibc)\n\t\tos=-linux-dietlibc\n\t\t;;\n\t-linux*)\n\t\tos=`echo $os | sed -e 's|linux|linux-gnu|'`\n\t\t;;\n\t-sunos5*)\n\t\tos=`echo $os | sed -e 's|sunos5|solaris2|'`\n\t\t;;\n\t-sunos6*)\n\t\tos=`echo $os | sed -e 's|sunos6|solaris3|'`\n\t\t;;\n\t-opened*)\n\t\tos=-openedition\n\t\t;;\n\t-os400*)\n\t\tos=-os400\n\t\t;;\n\t-wince*)\n\t\tos=-wince\n\t\t;;\n\t-osfrose*)\n\t\tos=-osfrose\n\t\t;;\n\t-osf*)\n\t\tos=-osf\n\t\t;;\n\t-utek*)\n\t\tos=-bsd\n\t\t;;\n\t-dynix*)\n\t\tos=-bsd\n\t\t;;\n\t-acis*)\n\t\tos=-aos\n\t\t;;\n\t-atheos*)\n\t\tos=-atheos\n\t\t;;\n\t-syllable*)\n\t\tos=-syllable\n\t\t;;\n\t-386bsd)\n\t\tos=-bsd\n\t\t;;\n\t-ctix* | -uts*)\n\t\tos=-sysv\n\t\t;;\n\t-nova*)\n\t\tos=-rtmk-nova\n\t\t;;\n\t-ns2)\n\t\tos=-nextstep2\n\t\t;;\n\t-nsk*)\n\t\tos=-nsk\n\t\t;;\n\t# Preserve the version number of sinix5.\n\t-sinix5.*)\n\t\tos=`echo $os | sed -e 's|sinix|sysv|'`\n\t\t;;\n\t-sinix*)\n\t\tos=-sysv4\n\t\t;;\n\t-tpf*)\n\t\tos=-tpf\n\t\t;;\n\t-triton*)\n\t\tos=-sysv3\n\t\t;;\n\t-oss*)\n\t\tos=-sysv3\n\t\t;;\n\t-svr4)\n\t\tos=-sysv4\n\t\t;;\n\t-svr3)\n\t\tos=-sysv3\n\t\t;;\n\t-sysvr4)\n\t\tos=-sysv4\n\t\t;;\n\t# This must come after -sysvr4.\n\t-sysv*)\n\t\t;;\n\t-ose*)\n\t\tos=-ose\n\t\t;;\n\t-es1800*)\n\t\tos=-ose\n\t\t;;\n\t-xenix)\n\t\tos=-xenix\n\t\t;;\n\t-*mint | -mint[0-9]* | -*MiNT | -MiNT[0-9]*)\n\t\tos=-mint\n\t\t;;\n\t-aros*)\n\t\tos=-aros\n\t\t;;\n\t-zvmoe)\n\t\tos=-zvmoe\n\t\t;;\n\t-dicos*)\n\t\tos=-dicos\n\t\t;;\n\t-pikeos*)\n\t\t# Until real need of OS specific support for\n\t\t# particular features comes up, bare metal\n\t\t# configurations are quite functional.\n\t\tcase $basic_machine in\n\t\t    arm*)\n\t\t\tos=-eabi\n\t\t\t;;\n\t\t    *)\n\t\t\tos=-elf\n\t\t\t;;\n\t\tesac\n\t\t;;\n\t-nacl*)\n\t\t;;\n\t-ios)\n\t\t;;\n\t-none)\n\t\t;;\n\t*)\n\t\t# Get rid of the `-' at the beginning of $os.\n\t\tos=`echo $os | sed 's/[^-]*-//'`\n\t\techo Invalid configuration \\`$1\\': system \\`$os\\' not recognized 1>&2\n\t\texit 1\n\t\t;;\nesac\nelse\n\n# Here we handle the default operating systems that come with various machines.\n# The value should be what the vendor currently ships out the door with their\n# machine or put another way, the most popular os provided with the machine.\n\n# Note that if you're going to try to match \"-MANUFACTURER\" here (say,\n# \"-sun\"), then you have to tell the case statement up towards the top\n# that MANUFACTURER isn't an operating system.  Otherwise, code above\n# will signal an error saying that MANUFACTURER isn't an operating\n# system, and we'll never get to this point.\n\ncase $basic_machine in\n\tscore-*)\n\t\tos=-elf\n\t\t;;\n\tspu-*)\n\t\tos=-elf\n\t\t;;\n\t*-acorn)\n\t\tos=-riscix1.2\n\t\t;;\n\tarm*-rebel)\n\t\tos=-linux\n\t\t;;\n\tarm*-semi)\n\t\tos=-aout\n\t\t;;\n\tc4x-* | tic4x-*)\n\t\tos=-coff\n\t\t;;\n\tc8051-*)\n\t\tos=-elf\n\t\t;;\n\thexagon-*)\n\t\tos=-elf\n\t\t;;\n\ttic54x-*)\n\t\tos=-coff\n\t\t;;\n\ttic55x-*)\n\t\tos=-coff\n\t\t;;\n\ttic6x-*)\n\t\tos=-coff\n\t\t;;\n\t# This must come before the *-dec entry.\n\tpdp10-*)\n\t\tos=-tops20\n\t\t;;\n\tpdp11-*)\n\t\tos=-none\n\t\t;;\n\t*-dec | vax-*)\n\t\tos=-ultrix4.2\n\t\t;;\n\tm68*-apollo)\n\t\tos=-domain\n\t\t;;\n\ti386-sun)\n\t\tos=-sunos4.0.2\n\t\t;;\n\tm68000-sun)\n\t\tos=-sunos3\n\t\t;;\n\tm68*-cisco)\n\t\tos=-aout\n\t\t;;\n\tmep-*)\n\t\tos=-elf\n\t\t;;\n\tmips*-cisco)\n\t\tos=-elf\n\t\t;;\n\tmips*-*)\n\t\tos=-elf\n\t\t;;\n\tor32-*)\n\t\tos=-coff\n\t\t;;\n\t*-tti)\t# must be before sparc entry or we get the wrong os.\n\t\tos=-sysv3\n\t\t;;\n\tsparc-* | *-sun)\n\t\tos=-sunos4.1.1\n\t\t;;\n\tpru-*)\n\t\tos=-elf\n\t\t;;\n\t*-be)\n\t\tos=-beos\n\t\t;;\n\t*-haiku)\n\t\tos=-haiku\n\t\t;;\n\t*-ibm)\n\t\tos=-aix\n\t\t;;\n\t*-knuth)\n\t\tos=-mmixware\n\t\t;;\n\t*-wec)\n\t\tos=-proelf\n\t\t;;\n\t*-winbond)\n\t\tos=-proelf\n\t\t;;\n\t*-oki)\n\t\tos=-proelf\n\t\t;;\n\t*-hp)\n\t\tos=-hpux\n\t\t;;\n\t*-hitachi)\n\t\tos=-hiux\n\t\t;;\n\ti860-* | *-att | *-ncr | *-altos | *-motorola | *-convergent)\n\t\tos=-sysv\n\t\t;;\n\t*-cbm)\n\t\tos=-amigaos\n\t\t;;\n\t*-dg)\n\t\tos=-dgux\n\t\t;;\n\t*-dolphin)\n\t\tos=-sysv3\n\t\t;;\n\tm68k-ccur)\n\t\tos=-rtu\n\t\t;;\n\tm88k-omron*)\n\t\tos=-luna\n\t\t;;\n\t*-next)\n\t\tos=-nextstep\n\t\t;;\n\t*-sequent)\n\t\tos=-ptx\n\t\t;;\n\t*-crds)\n\t\tos=-unos\n\t\t;;\n\t*-ns)\n\t\tos=-genix\n\t\t;;\n\ti370-*)\n\t\tos=-mvs\n\t\t;;\n\t*-next)\n\t\tos=-nextstep3\n\t\t;;\n\t*-gould)\n\t\tos=-sysv\n\t\t;;\n\t*-highlevel)\n\t\tos=-bsd\n\t\t;;\n\t*-encore)\n\t\tos=-bsd\n\t\t;;\n\t*-sgi)\n\t\tos=-irix\n\t\t;;\n\t*-siemens)\n\t\tos=-sysv4\n\t\t;;\n\t*-masscomp)\n\t\tos=-rtu\n\t\t;;\n\tf30[01]-fujitsu | f700-fujitsu)\n\t\tos=-uxpv\n\t\t;;\n\t*-rom68k)\n\t\tos=-coff\n\t\t;;\n\t*-*bug)\n\t\tos=-coff\n\t\t;;\n\t*-apple)\n\t\tos=-macos\n\t\t;;\n\t*-atari*)\n\t\tos=-mint\n\t\t;;\n\t*)\n\t\tos=-none\n\t\t;;\nesac\nfi\n\n# Here we handle the case where we know the os, and the CPU type, but not the\n# manufacturer.  We pick the logical manufacturer.\nvendor=unknown\ncase $basic_machine in\n\t*-unknown)\n\t\tcase $os in\n\t\t\t-riscix*)\n\t\t\t\tvendor=acorn\n\t\t\t\t;;\n\t\t\t-sunos*)\n\t\t\t\tvendor=sun\n\t\t\t\t;;\n\t\t\t-cnk*|-aix*)\n\t\t\t\tvendor=ibm\n\t\t\t\t;;\n\t\t\t-beos*)\n\t\t\t\tvendor=be\n\t\t\t\t;;\n\t\t\t-hpux*)\n\t\t\t\tvendor=hp\n\t\t\t\t;;\n\t\t\t-mpeix*)\n\t\t\t\tvendor=hp\n\t\t\t\t;;\n\t\t\t-hiux*)\n\t\t\t\tvendor=hitachi\n\t\t\t\t;;\n\t\t\t-unos*)\n\t\t\t\tvendor=crds\n\t\t\t\t;;\n\t\t\t-dgux*)\n\t\t\t\tvendor=dg\n\t\t\t\t;;\n\t\t\t-luna*)\n\t\t\t\tvendor=omron\n\t\t\t\t;;\n\t\t\t-genix*)\n\t\t\t\tvendor=ns\n\t\t\t\t;;\n\t\t\t-mvs* | -opened*)\n\t\t\t\tvendor=ibm\n\t\t\t\t;;\n\t\t\t-os400*)\n\t\t\t\tvendor=ibm\n\t\t\t\t;;\n\t\t\t-ptx*)\n\t\t\t\tvendor=sequent\n\t\t\t\t;;\n\t\t\t-tpf*)\n\t\t\t\tvendor=ibm\n\t\t\t\t;;\n\t\t\t-vxsim* | -vxworks* | -windiss*)\n\t\t\t\tvendor=wrs\n\t\t\t\t;;\n\t\t\t-aux*)\n\t\t\t\tvendor=apple\n\t\t\t\t;;\n\t\t\t-hms*)\n\t\t\t\tvendor=hitachi\n\t\t\t\t;;\n\t\t\t-mpw* | -macos*)\n\t\t\t\tvendor=apple\n\t\t\t\t;;\n\t\t\t-*mint | -mint[0-9]* | -*MiNT | -MiNT[0-9]*)\n\t\t\t\tvendor=atari\n\t\t\t\t;;\n\t\t\t-vos*)\n\t\t\t\tvendor=stratus\n\t\t\t\t;;\n\t\tesac\n\t\tbasic_machine=`echo $basic_machine | sed \"s/unknown/$vendor/\"`\n\t\t;;\nesac\n\necho $basic_machine$os\nexit\n\n# Local variables:\n# eval: (add-hook 'write-file-functions 'time-stamp)\n# time-stamp-start: \"timestamp='\"\n# time-stamp-format: \"%:y-%02m-%02d\"\n# time-stamp-end: \"'\"\n# End:\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/configure",
    "content": "#! /bin/sh\n# Guess values for system-dependent variables and create Makefiles.\n# Generated by GNU Autoconf 2.69 for OpenFst 1.6.9.\n#\n# Report bugs to <help@www.openfst.org>.\n#\n#\n# Copyright (C) 1992-1996, 1998-2012 Free Software Foundation, Inc.\n#\n#\n# This configure script is free software; the Free Software Foundation\n# gives unlimited permission to copy, distribute and modify it.\n## -------------------- ##\n## M4sh Initialization. ##\n## -------------------- ##\n\n# Be more Bourne compatible\nDUALCASE=1; export DUALCASE # for MKS sh\nif test -n \"${ZSH_VERSION+set}\" && (emulate sh) >/dev/null 2>&1; then :\n  emulate sh\n  NULLCMD=:\n  # Pre-4.2 versions of Zsh do word splitting on ${1+\"$@\"}, which\n  # is contrary to our usage.  Disable this feature.\n  alias -g '${1+\"$@\"}'='\"$@\"'\n  setopt NO_GLOB_SUBST\nelse\n  case `(set -o) 2>/dev/null` in #(\n  *posix*) :\n    set -o posix ;; #(\n  *) :\n     ;;\nesac\nfi\n\n\nas_nl='\n'\nexport as_nl\n# Printing a long string crashes Solaris 7 /usr/bin/printf.\nas_echo='\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\'\nas_echo=$as_echo$as_echo$as_echo$as_echo$as_echo\nas_echo=$as_echo$as_echo$as_echo$as_echo$as_echo$as_echo\n# Prefer a ksh shell builtin over an external printf program on Solaris,\n# but without wasting forks for bash or zsh.\nif test -z \"$BASH_VERSION$ZSH_VERSION\" \\\n    && (test \"X`print -r -- $as_echo`\" = \"X$as_echo\") 2>/dev/null; then\n  as_echo='print -r --'\n  as_echo_n='print -rn --'\nelif (test \"X`printf %s $as_echo`\" = \"X$as_echo\") 2>/dev/null; then\n  as_echo='printf %s\\n'\n  as_echo_n='printf %s'\nelse\n  if test \"X`(/usr/ucb/echo -n -n $as_echo) 2>/dev/null`\" = \"X-n $as_echo\"; then\n    as_echo_body='eval /usr/ucb/echo -n \"$1$as_nl\"'\n    as_echo_n='/usr/ucb/echo -n'\n  else\n    as_echo_body='eval expr \"X$1\" : \"X\\\\(.*\\\\)\"'\n    as_echo_n_body='eval\n      arg=$1;\n      case $arg in #(\n      *\"$as_nl\"*)\n\texpr \"X$arg\" : \"X\\\\(.*\\\\)$as_nl\";\n\targ=`expr \"X$arg\" : \".*$as_nl\\\\(.*\\\\)\"`;;\n      esac;\n      expr \"X$arg\" : \"X\\\\(.*\\\\)\" | tr -d \"$as_nl\"\n    '\n    export as_echo_n_body\n    as_echo_n='sh -c $as_echo_n_body as_echo'\n  fi\n  export as_echo_body\n  as_echo='sh -c $as_echo_body as_echo'\nfi\n\n# The user is always right.\nif test \"${PATH_SEPARATOR+set}\" != set; then\n  PATH_SEPARATOR=:\n  (PATH='/bin;/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 && {\n    (PATH='/bin:/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 ||\n      PATH_SEPARATOR=';'\n  }\nfi\n\n\n# IFS\n# We need space, tab and new line, in precisely that order.  Quoting is\n# there to prevent editors from complaining about space-tab.\n# (If _AS_PATH_WALK were called with IFS unset, it would disable word\n# splitting by setting IFS to empty value.)\nIFS=\" \"\"\t$as_nl\"\n\n# Find who we are.  Look in the path if we contain no directory separator.\nas_myself=\ncase $0 in #((\n  *[\\\\/]* ) as_myself=$0 ;;\n  *) as_save_IFS=$IFS; IFS=$PATH_SEPARATOR\nfor as_dir in $PATH\ndo\n  IFS=$as_save_IFS\n  test -z \"$as_dir\" && as_dir=.\n    test -r \"$as_dir/$0\" && as_myself=$as_dir/$0 && break\n  done\nIFS=$as_save_IFS\n\n     ;;\nesac\n# We did not find ourselves, most probably we were run as `sh COMMAND'\n# in which case we are not to be found in the path.\nif test \"x$as_myself\" = x; then\n  as_myself=$0\nfi\nif test ! -f \"$as_myself\"; then\n  $as_echo \"$as_myself: error: cannot find myself; rerun with an absolute file name\" >&2\n  exit 1\nfi\n\n# Unset variables that we do not need and which cause bugs (e.g. in\n# pre-3.0 UWIN ksh).  But do not cause bugs in bash 2.01; the \"|| exit 1\"\n# suppresses any \"Segmentation fault\" message there.  '((' could\n# trigger a bug in pdksh 5.2.14.\nfor as_var in BASH_ENV ENV MAIL MAILPATH\ndo eval test x\\${$as_var+set} = xset \\\n  && ( (unset $as_var) || exit 1) >/dev/null 2>&1 && unset $as_var || :\ndone\nPS1='$ '\nPS2='> '\nPS4='+ '\n\n# NLS nuisances.\nLC_ALL=C\nexport LC_ALL\nLANGUAGE=C\nexport LANGUAGE\n\n# CDPATH.\n(unset CDPATH) >/dev/null 2>&1 && unset CDPATH\n\n# Use a proper internal environment variable to ensure we don't fall\n  # into an infinite loop, continuously re-executing ourselves.\n  if test x\"${_as_can_reexec}\" != xno && test \"x$CONFIG_SHELL\" != x; then\n    _as_can_reexec=no; export _as_can_reexec;\n    # We cannot yet assume a decent shell, so we have to provide a\n# neutralization value for shells without unset; and this also\n# works around shells that cannot unset nonexistent variables.\n# Preserve -v and -x to the replacement shell.\nBASH_ENV=/dev/null\nENV=/dev/null\n(unset BASH_ENV) >/dev/null 2>&1 && unset BASH_ENV ENV\ncase $- in # ((((\n  *v*x* | *x*v* ) as_opts=-vx ;;\n  *v* ) as_opts=-v ;;\n  *x* ) as_opts=-x ;;\n  * ) as_opts= ;;\nesac\nexec $CONFIG_SHELL $as_opts \"$as_myself\" ${1+\"$@\"}\n# Admittedly, this is quite paranoid, since all the known shells bail\n# out after a failed `exec'.\n$as_echo \"$0: could not re-execute with $CONFIG_SHELL\" >&2\nas_fn_exit 255\n  fi\n  # We don't want this to propagate to other subprocesses.\n          { _as_can_reexec=; unset _as_can_reexec;}\nif test \"x$CONFIG_SHELL\" = x; then\n  as_bourne_compatible=\"if test -n \\\"\\${ZSH_VERSION+set}\\\" && (emulate sh) >/dev/null 2>&1; then :\n  emulate sh\n  NULLCMD=:\n  # Pre-4.2 versions of Zsh do word splitting on \\${1+\\\"\\$@\\\"}, which\n  # is contrary to our usage.  Disable this feature.\n  alias -g '\\${1+\\\"\\$@\\\"}'='\\\"\\$@\\\"'\n  setopt NO_GLOB_SUBST\nelse\n  case \\`(set -o) 2>/dev/null\\` in #(\n  *posix*) :\n    set -o posix ;; #(\n  *) :\n     ;;\nesac\nfi\n\"\n  as_required=\"as_fn_return () { (exit \\$1); }\nas_fn_success () { as_fn_return 0; }\nas_fn_failure () { as_fn_return 1; }\nas_fn_ret_success () { return 0; }\nas_fn_ret_failure () { return 1; }\n\nexitcode=0\nas_fn_success || { exitcode=1; echo as_fn_success failed.; }\nas_fn_failure && { exitcode=1; echo as_fn_failure succeeded.; }\nas_fn_ret_success || { exitcode=1; echo as_fn_ret_success failed.; }\nas_fn_ret_failure && { exitcode=1; echo as_fn_ret_failure succeeded.; }\nif ( set x; as_fn_ret_success y && test x = \\\"\\$1\\\" ); then :\n\nelse\n  exitcode=1; echo positional parameters were not saved.\nfi\ntest x\\$exitcode = x0 || exit 1\ntest -x / || exit 1\"\n  as_suggested=\"  as_lineno_1=\";as_suggested=$as_suggested$LINENO;as_suggested=$as_suggested\" as_lineno_1a=\\$LINENO\n  as_lineno_2=\";as_suggested=$as_suggested$LINENO;as_suggested=$as_suggested\" as_lineno_2a=\\$LINENO\n  eval 'test \\\"x\\$as_lineno_1'\\$as_run'\\\" != \\\"x\\$as_lineno_2'\\$as_run'\\\" &&\n  test \\\"x\\`expr \\$as_lineno_1'\\$as_run' + 1\\`\\\" = \\\"x\\$as_lineno_2'\\$as_run'\\\"' || exit 1\n\n  test -n \\\"\\${ZSH_VERSION+set}\\${BASH_VERSION+set}\\\" || (\n    ECHO='\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\'\n    ECHO=\\$ECHO\\$ECHO\\$ECHO\\$ECHO\\$ECHO\n    ECHO=\\$ECHO\\$ECHO\\$ECHO\\$ECHO\\$ECHO\\$ECHO\n    PATH=/empty FPATH=/empty; export PATH FPATH\n    test \\\"X\\`printf %s \\$ECHO\\`\\\" = \\\"X\\$ECHO\\\" \\\\\n      || test \\\"X\\`print -r -- \\$ECHO\\`\\\" = \\\"X\\$ECHO\\\" ) || exit 1\ntest \\$(( 1 + 1 )) = 2 || exit 1\"\n  if (eval \"$as_required\") 2>/dev/null; then :\n  as_have_required=yes\nelse\n  as_have_required=no\nfi\n  if test x$as_have_required = xyes && (eval \"$as_suggested\") 2>/dev/null; then :\n\nelse\n  as_save_IFS=$IFS; IFS=$PATH_SEPARATOR\nas_found=false\nfor as_dir in /bin$PATH_SEPARATOR/usr/bin$PATH_SEPARATOR$PATH\ndo\n  IFS=$as_save_IFS\n  test -z \"$as_dir\" && as_dir=.\n  as_found=:\n  case $as_dir in #(\n\t /*)\n\t   for as_base in sh bash ksh sh5; do\n\t     # Try only shells that exist, to save several forks.\n\t     as_shell=$as_dir/$as_base\n\t     if { test -f \"$as_shell\" || test -f \"$as_shell.exe\"; } &&\n\t\t    { $as_echo \"$as_bourne_compatible\"\"$as_required\" | as_run=a \"$as_shell\"; } 2>/dev/null; then :\n  CONFIG_SHELL=$as_shell as_have_required=yes\n\t\t   if { $as_echo \"$as_bourne_compatible\"\"$as_suggested\" | as_run=a \"$as_shell\"; } 2>/dev/null; then :\n  break 2\nfi\nfi\n\t   done;;\n       esac\n  as_found=false\ndone\n$as_found || { if { test -f \"$SHELL\" || test -f \"$SHELL.exe\"; } &&\n\t      { $as_echo \"$as_bourne_compatible\"\"$as_required\" | as_run=a \"$SHELL\"; } 2>/dev/null; then :\n  CONFIG_SHELL=$SHELL as_have_required=yes\nfi; }\nIFS=$as_save_IFS\n\n\n      if test \"x$CONFIG_SHELL\" != x; then :\n  export CONFIG_SHELL\n             # We cannot yet assume a decent shell, so we have to provide a\n# neutralization value for shells without unset; and this also\n# works around shells that cannot unset nonexistent variables.\n# Preserve -v and -x to the replacement shell.\nBASH_ENV=/dev/null\nENV=/dev/null\n(unset BASH_ENV) >/dev/null 2>&1 && unset BASH_ENV ENV\ncase $- in # ((((\n  *v*x* | *x*v* ) as_opts=-vx ;;\n  *v* ) as_opts=-v ;;\n  *x* ) as_opts=-x ;;\n  * ) as_opts= ;;\nesac\nexec $CONFIG_SHELL $as_opts \"$as_myself\" ${1+\"$@\"}\n# Admittedly, this is quite paranoid, since all the known shells bail\n# out after a failed `exec'.\n$as_echo \"$0: could not re-execute with $CONFIG_SHELL\" >&2\nexit 255\nfi\n\n    if test x$as_have_required = xno; then :\n  $as_echo \"$0: This script requires a shell more modern than all\"\n  $as_echo \"$0: the shells that I found on your system.\"\n  if test x${ZSH_VERSION+set} = xset ; then\n    $as_echo \"$0: In particular, zsh $ZSH_VERSION has bugs and should\"\n    $as_echo \"$0: be upgraded to zsh 4.3.4 or later.\"\n  else\n    $as_echo \"$0: Please tell bug-autoconf@gnu.org and\n$0: help@www.openfst.org about your system, including any\n$0: error possibly output before this message. Then install\n$0: a modern shell, or manually run the script under such a\n$0: shell if you do have one.\"\n  fi\n  exit 1\nfi\nfi\nfi\nSHELL=${CONFIG_SHELL-/bin/sh}\nexport SHELL\n# Unset more variables known to interfere with behavior of common tools.\nCLICOLOR_FORCE= GREP_OPTIONS=\nunset CLICOLOR_FORCE GREP_OPTIONS\n\n## --------------------- ##\n## M4sh Shell Functions. ##\n## --------------------- ##\n# as_fn_unset VAR\n# ---------------\n# Portably unset VAR.\nas_fn_unset ()\n{\n  { eval $1=; unset $1;}\n}\nas_unset=as_fn_unset\n\n# as_fn_set_status STATUS\n# -----------------------\n# Set $? to STATUS, without forking.\nas_fn_set_status ()\n{\n  return $1\n} # as_fn_set_status\n\n# as_fn_exit STATUS\n# -----------------\n# Exit the shell with STATUS, even in a \"trap 0\" or \"set -e\" context.\nas_fn_exit ()\n{\n  set +e\n  as_fn_set_status $1\n  exit $1\n} # as_fn_exit\n\n# as_fn_mkdir_p\n# -------------\n# Create \"$as_dir\" as a directory, including parents if necessary.\nas_fn_mkdir_p ()\n{\n\n  case $as_dir in #(\n  -*) as_dir=./$as_dir;;\n  esac\n  test -d \"$as_dir\" || eval $as_mkdir_p || {\n    as_dirs=\n    while :; do\n      case $as_dir in #(\n      *\\'*) as_qdir=`$as_echo \"$as_dir\" | sed \"s/'/'\\\\\\\\\\\\\\\\''/g\"`;; #'(\n      *) as_qdir=$as_dir;;\n      esac\n      as_dirs=\"'$as_qdir' $as_dirs\"\n      as_dir=`$as_dirname -- \"$as_dir\" ||\n$as_expr X\"$as_dir\" : 'X\\(.*[^/]\\)//*[^/][^/]*/*$' \\| \\\n\t X\"$as_dir\" : 'X\\(//\\)[^/]' \\| \\\n\t X\"$as_dir\" : 'X\\(//\\)$' \\| \\\n\t X\"$as_dir\" : 'X\\(/\\)' \\| . 2>/dev/null ||\n$as_echo X\"$as_dir\" |\n    sed '/^X\\(.*[^/]\\)\\/\\/*[^/][^/]*\\/*$/{\n\t    s//\\1/\n\t    q\n\t  }\n\t  /^X\\(\\/\\/\\)[^/].*/{\n\t    s//\\1/\n\t    q\n\t  }\n\t  /^X\\(\\/\\/\\)$/{\n\t    s//\\1/\n\t    q\n\t  }\n\t  /^X\\(\\/\\).*/{\n\t    s//\\1/\n\t    q\n\t  }\n\t  s/.*/./; q'`\n      test -d \"$as_dir\" && break\n    done\n    test -z \"$as_dirs\" || eval \"mkdir $as_dirs\"\n  } || test -d \"$as_dir\" || as_fn_error $? \"cannot create directory $as_dir\"\n\n\n} # as_fn_mkdir_p\n\n# as_fn_executable_p FILE\n# -----------------------\n# Test if FILE is an executable regular file.\nas_fn_executable_p ()\n{\n  test -f \"$1\" && test -x \"$1\"\n} # as_fn_executable_p\n# as_fn_append VAR VALUE\n# ----------------------\n# Append the text in VALUE to the end of the definition contained in VAR. Take\n# advantage of any shell optimizations that allow amortized linear growth over\n# repeated appends, instead of the typical quadratic growth present in naive\n# implementations.\nif (eval \"as_var=1; as_var+=2; test x\\$as_var = x12\") 2>/dev/null; then :\n  eval 'as_fn_append ()\n  {\n    eval $1+=\\$2\n  }'\nelse\n  as_fn_append ()\n  {\n    eval $1=\\$$1\\$2\n  }\nfi # as_fn_append\n\n# as_fn_arith ARG...\n# ------------------\n# Perform arithmetic evaluation on the ARGs, and store the result in the\n# global $as_val. Take advantage of shells that can avoid forks. The arguments\n# must be portable across $(()) and expr.\nif (eval \"test \\$(( 1 + 1 )) = 2\") 2>/dev/null; then :\n  eval 'as_fn_arith ()\n  {\n    as_val=$(( $* ))\n  }'\nelse\n  as_fn_arith ()\n  {\n    as_val=`expr \"$@\" || test $? -eq 1`\n  }\nfi # as_fn_arith\n\n\n# as_fn_error STATUS ERROR [LINENO LOG_FD]\n# ----------------------------------------\n# Output \"`basename $0`: error: ERROR\" to stderr. If LINENO and LOG_FD are\n# provided, also output the error to LOG_FD, referencing LINENO. Then exit the\n# script with STATUS, using 1 if that was 0.\nas_fn_error ()\n{\n  as_status=$1; test $as_status -eq 0 && as_status=1\n  if test \"$4\"; then\n    as_lineno=${as_lineno-\"$3\"} as_lineno_stack=as_lineno_stack=$as_lineno_stack\n    $as_echo \"$as_me:${as_lineno-$LINENO}: error: $2\" >&$4\n  fi\n  $as_echo \"$as_me: error: $2\" >&2\n  as_fn_exit $as_status\n} # as_fn_error\n\nif expr a : '\\(a\\)' >/dev/null 2>&1 &&\n   test \"X`expr 00001 : '.*\\(...\\)'`\" = X001; then\n  as_expr=expr\nelse\n  as_expr=false\nfi\n\nif (basename -- /) >/dev/null 2>&1 && test \"X`basename -- / 2>&1`\" = \"X/\"; then\n  as_basename=basename\nelse\n  as_basename=false\nfi\n\nif (as_dir=`dirname -- /` && test \"X$as_dir\" = X/) >/dev/null 2>&1; then\n  as_dirname=dirname\nelse\n  as_dirname=false\nfi\n\nas_me=`$as_basename -- \"$0\" ||\n$as_expr X/\"$0\" : '.*/\\([^/][^/]*\\)/*$' \\| \\\n\t X\"$0\" : 'X\\(//\\)$' \\| \\\n\t X\"$0\" : 'X\\(/\\)' \\| . 2>/dev/null ||\n$as_echo X/\"$0\" |\n    sed '/^.*\\/\\([^/][^/]*\\)\\/*$/{\n\t    s//\\1/\n\t    q\n\t  }\n\t  /^X\\/\\(\\/\\/\\)$/{\n\t    s//\\1/\n\t    q\n\t  }\n\t  /^X\\/\\(\\/\\).*/{\n\t    s//\\1/\n\t    q\n\t  }\n\t  s/.*/./; q'`\n\n# Avoid depending upon Character Ranges.\nas_cr_letters='abcdefghijklmnopqrstuvwxyz'\nas_cr_LETTERS='ABCDEFGHIJKLMNOPQRSTUVWXYZ'\nas_cr_Letters=$as_cr_letters$as_cr_LETTERS\nas_cr_digits='0123456789'\nas_cr_alnum=$as_cr_Letters$as_cr_digits\n\n\n  as_lineno_1=$LINENO as_lineno_1a=$LINENO\n  as_lineno_2=$LINENO as_lineno_2a=$LINENO\n  eval 'test \"x$as_lineno_1'$as_run'\" != \"x$as_lineno_2'$as_run'\" &&\n  test \"x`expr $as_lineno_1'$as_run' + 1`\" = \"x$as_lineno_2'$as_run'\"' || {\n  # Blame Lee E. McMahon (1931-1989) for sed's syntax.  :-)\n  sed -n '\n    p\n    /[$]LINENO/=\n  ' <$as_myself |\n    sed '\n      s/[$]LINENO.*/&-/\n      t lineno\n      b\n      :lineno\n      N\n      :loop\n      s/[$]LINENO\\([^'$as_cr_alnum'_].*\\n\\)\\(.*\\)/\\2\\1\\2/\n      t loop\n      s/-\\n.*//\n    ' >$as_me.lineno &&\n  chmod +x \"$as_me.lineno\" ||\n    { $as_echo \"$as_me: error: cannot create $as_me.lineno; rerun with a POSIX shell\" >&2; as_fn_exit 1; }\n\n  # If we had to re-execute with $CONFIG_SHELL, we're ensured to have\n  # already done that, so ensure we don't try to do so again and fall\n  # in an infinite loop.  This has already happened in practice.\n  _as_can_reexec=no; export _as_can_reexec\n  # Don't try to exec as it changes $[0], causing all sort of problems\n  # (the dirname of $[0] is not the place where we might find the\n  # original and so on.  Autoconf is especially sensitive to this).\n  . \"./$as_me.lineno\"\n  # Exit status is that of the last command.\n  exit\n}\n\nECHO_C= ECHO_N= ECHO_T=\ncase `echo -n x` in #(((((\n-n*)\n  case `echo 'xy\\c'` in\n  *c*) ECHO_T='\t';;\t# ECHO_T is single tab character.\n  xy)  ECHO_C='\\c';;\n  *)   echo `echo ksh88 bug on AIX 6.1` > /dev/null\n       ECHO_T='\t';;\n  esac;;\n*)\n  ECHO_N='-n';;\nesac\n\nrm -f conf$$ conf$$.exe conf$$.file\nif test -d conf$$.dir; then\n  rm -f conf$$.dir/conf$$.file\nelse\n  rm -f conf$$.dir\n  mkdir conf$$.dir 2>/dev/null\nfi\nif (echo >conf$$.file) 2>/dev/null; then\n  if ln -s conf$$.file conf$$ 2>/dev/null; then\n    as_ln_s='ln -s'\n    # ... but there are two gotchas:\n    # 1) On MSYS, both `ln -s file dir' and `ln file dir' fail.\n    # 2) DJGPP < 2.04 has no symlinks; `ln -s' creates a wrapper executable.\n    # In both cases, we have to default to `cp -pR'.\n    ln -s conf$$.file conf$$.dir 2>/dev/null && test ! -f conf$$.exe ||\n      as_ln_s='cp -pR'\n  elif ln conf$$.file conf$$ 2>/dev/null; then\n    as_ln_s=ln\n  else\n    as_ln_s='cp -pR'\n  fi\nelse\n  as_ln_s='cp -pR'\nfi\nrm -f conf$$ conf$$.exe conf$$.dir/conf$$.file conf$$.file\nrmdir conf$$.dir 2>/dev/null\n\nif mkdir -p . 2>/dev/null; then\n  as_mkdir_p='mkdir -p \"$as_dir\"'\nelse\n  test -d ./-p && rmdir ./-p\n  as_mkdir_p=false\nfi\n\nas_test_x='test -x'\nas_executable_p=as_fn_executable_p\n\n# Sed expression to map a string onto a valid CPP name.\nas_tr_cpp=\"eval sed 'y%*$as_cr_letters%P$as_cr_LETTERS%;s%[^_$as_cr_alnum]%_%g'\"\n\n# Sed expression to map a string onto a valid variable name.\nas_tr_sh=\"eval sed 'y%*+%pp%;s%[^_$as_cr_alnum]%_%g'\"\n\nSHELL=${CONFIG_SHELL-/bin/sh}\n\n\ntest -n \"$DJDIR\" || exec 7<&0 </dev/null\nexec 6>&1\n\n# Name of the host.\n# hostname on some systems (SVR3.2, old GNU/Linux) returns a bogus exit status,\n# so uname gets run too.\nac_hostname=`(hostname || uname -n) 2>/dev/null | sed 1q`\n\n#\n# Initializations.\n#\nac_default_prefix=/usr/local\nac_clean_files=\nac_config_libobj_dir=.\nLIBOBJS=\ncross_compiling=no\nsubdirs=\nMFLAGS=\nMAKEFLAGS=\n\n# Identity of this package.\nPACKAGE_NAME='OpenFst'\nPACKAGE_TARNAME='openfst'\nPACKAGE_VERSION='1.6.9'\nPACKAGE_STRING='OpenFst 1.6.9'\nPACKAGE_BUGREPORT='help@www.openfst.org'\nPACKAGE_URL=''\n\n# Factoring default headers for most tests.\nac_includes_default=\"\\\n#include <stdio.h>\n#ifdef HAVE_SYS_TYPES_H\n# include <sys/types.h>\n#endif\n#ifdef HAVE_SYS_STAT_H\n# include <sys/stat.h>\n#endif\n#ifdef STDC_HEADERS\n# include <stdlib.h>\n# include <stddef.h>\n#else\n# ifdef HAVE_STDLIB_H\n#  include <stdlib.h>\n# endif\n#endif\n#ifdef HAVE_STRING_H\n# if !defined STDC_HEADERS && defined HAVE_MEMORY_H\n#  include <memory.h>\n# endif\n# include <string.h>\n#endif\n#ifdef HAVE_STRINGS_H\n# include <strings.h>\n#endif\n#ifdef HAVE_INTTYPES_H\n# include <inttypes.h>\n#endif\n#ifdef HAVE_STDINT_H\n# include <stdint.h>\n#endif\n#ifdef HAVE_UNISTD_H\n# include <unistd.h>\n#endif\"\n\nac_unique_file=\"src/lib/fst.cc\"\nac_subst_vars='am__EXEEXT_FALSE\nam__EXEEXT_TRUE\nLTLIBOBJS\nLIBOBJS\nDL_LIBS\nlibfstdir\nHAVE_GRM_FALSE\nHAVE_GRM_TRUE\nHAVE_SCRIPT_FALSE\nHAVE_SCRIPT_TRUE\nHAVE_BIN_FALSE\nHAVE_BIN_TRUE\nHAVE_SPECIAL_FALSE\nHAVE_SPECIAL_TRUE\nPYTHON_EXTRA_LDFLAGS\nPYTHON_EXTRA_LIBS\nPYTHON_SITE_PKG\nPYTHON_LDFLAGS\nPYTHON_CPPFLAGS\npkgpyexecdir\npyexecdir\npkgpythondir\npythondir\nPYTHON_PLATFORM\nPYTHON_EXEC_PREFIX\nPYTHON_PREFIX\nPYTHON_VERSION\nPYTHON\nHAVE_PYTHON_FALSE\nHAVE_PYTHON_TRUE\nHAVE_PDT_FALSE\nHAVE_PDT_TRUE\nHAVE_NGRAM_FALSE\nHAVE_NGRAM_TRUE\nHAVE_MPDT_FALSE\nHAVE_MPDT_TRUE\nHAVE_LOOKAHEAD_FALSE\nHAVE_LOOKAHEAD_TRUE\nHAVE_LINEAR_FALSE\nHAVE_LINEAR_TRUE\nHAVE_FAR_FALSE\nHAVE_FAR_TRUE\nHAVE_CONST_FALSE\nHAVE_CONST_TRUE\nHAVE_COMPRESS_FALSE\nHAVE_COMPRESS_TRUE\nHAVE_COMPACT_FALSE\nHAVE_COMPACT_TRUE\nCXXCPP\nCPP\nLT_SYS_LIBRARY_PATH\nOTOOL64\nOTOOL\nLIPO\nNMEDIT\nDSYMUTIL\nMANIFEST_TOOL\nRANLIB\nDLLTOOL\nOBJDUMP\nLN_S\nNM\nac_ct_DUMPBIN\nDUMPBIN\nLD\nFGREP\nEGREP\nGREP\nSED\nhost_os\nhost_vendor\nhost_cpu\nhost\nbuild_os\nbuild_vendor\nbuild_cpu\nbuild\nLIBTOOL\nam__fastdepCXX_FALSE\nam__fastdepCXX_TRUE\nCXXDEPMODE\nac_ct_CXX\nCXXFLAGS\nCXX\nam__fastdepCC_FALSE\nam__fastdepCC_TRUE\nCCDEPMODE\nam__nodep\nAMDEPBACKSLASH\nAMDEP_FALSE\nAMDEP_TRUE\nam__quote\nam__include\nDEPDIR\nOBJEXT\nEXEEXT\nac_ct_CC\nCPPFLAGS\nLDFLAGS\nCFLAGS\nCC\nac_ct_AR\nAR\nAM_BACKSLASH\nAM_DEFAULT_VERBOSITY\nAM_DEFAULT_V\nAM_V\nam__untar\nam__tar\nAMTAR\nam__leading_dot\nSET_MAKE\nAWK\nmkdir_p\nMKDIR_P\nINSTALL_STRIP_PROGRAM\nSTRIP\ninstall_sh\nMAKEINFO\nAUTOHEADER\nAUTOMAKE\nAUTOCONF\nACLOCAL\nVERSION\nPACKAGE\nCYGPATH_W\nam__isrc\nINSTALL_DATA\nINSTALL_SCRIPT\nINSTALL_PROGRAM\ntarget_alias\nhost_alias\nbuild_alias\nLIBS\nECHO_T\nECHO_N\nECHO_C\nDEFS\nmandir\nlocaledir\nlibdir\npsdir\npdfdir\ndvidir\nhtmldir\ninfodir\ndocdir\noldincludedir\nincludedir\nrunstatedir\nlocalstatedir\nsharedstatedir\nsysconfdir\ndatadir\ndatarootdir\nlibexecdir\nsbindir\nbindir\nprogram_transform_name\nprefix\nexec_prefix\nPACKAGE_URL\nPACKAGE_BUGREPORT\nPACKAGE_STRING\nPACKAGE_VERSION\nPACKAGE_TARNAME\nPACKAGE_NAME\nPATH_SEPARATOR\nSHELL'\nac_subst_files=''\nac_user_opts='\nenable_option_checking\nenable_silent_rules\nenable_dependency_tracking\nenable_static\nenable_shared\nwith_pic\nenable_fast_install\nwith_aix_soname\nwith_gnu_ld\nwith_sysroot\nenable_libtool_lock\nenable_compact_fsts\nenable_compress\nenable_const_fsts\nenable_far\nenable_linear_fsts\nenable_lookahead_fsts\nenable_mpdt\nenable_ngram_fsts\nenable_pdt\nenable_python\nenable_special\nenable_bin\nenable_grm\nwith_libfstdir\n'\n      ac_precious_vars='build_alias\nhost_alias\ntarget_alias\nCC\nCFLAGS\nLDFLAGS\nLIBS\nCPPFLAGS\nCXX\nCXXFLAGS\nCCC\nLT_SYS_LIBRARY_PATH\nCPP\nCXXCPP\nPYTHON\nPYTHON_VERSION'\n\n\n# Initialize some variables set by options.\nac_init_help=\nac_init_version=false\nac_unrecognized_opts=\nac_unrecognized_sep=\n# The variables have the same names as the options, with\n# dashes changed to underlines.\ncache_file=/dev/null\nexec_prefix=NONE\nno_create=\nno_recursion=\nprefix=NONE\nprogram_prefix=NONE\nprogram_suffix=NONE\nprogram_transform_name=s,x,x,\nsilent=\nsite=\nsrcdir=\nverbose=\nx_includes=NONE\nx_libraries=NONE\n\n# Installation directory options.\n# These are left unexpanded so users can \"make install exec_prefix=/foo\"\n# and all the variables that are supposed to be based on exec_prefix\n# by default will actually change.\n# Use braces instead of parens because sh, perl, etc. also accept them.\n# (The list follows the same order as the GNU Coding Standards.)\nbindir='${exec_prefix}/bin'\nsbindir='${exec_prefix}/sbin'\nlibexecdir='${exec_prefix}/libexec'\ndatarootdir='${prefix}/share'\ndatadir='${datarootdir}'\nsysconfdir='${prefix}/etc'\nsharedstatedir='${prefix}/com'\nlocalstatedir='${prefix}/var'\nrunstatedir='${localstatedir}/run'\nincludedir='${prefix}/include'\noldincludedir='/usr/include'\ndocdir='${datarootdir}/doc/${PACKAGE_TARNAME}'\ninfodir='${datarootdir}/info'\nhtmldir='${docdir}'\ndvidir='${docdir}'\npdfdir='${docdir}'\npsdir='${docdir}'\nlibdir='${exec_prefix}/lib'\nlocaledir='${datarootdir}/locale'\nmandir='${datarootdir}/man'\n\nac_prev=\nac_dashdash=\nfor ac_option\ndo\n  # If the previous option needs an argument, assign it.\n  if test -n \"$ac_prev\"; then\n    eval $ac_prev=\\$ac_option\n    ac_prev=\n    continue\n  fi\n\n  case $ac_option in\n  *=?*) ac_optarg=`expr \"X$ac_option\" : '[^=]*=\\(.*\\)'` ;;\n  *=)   ac_optarg= ;;\n  *)    ac_optarg=yes ;;\n  esac\n\n  # Accept the important Cygnus configure options, so we can diagnose typos.\n\n  case $ac_dashdash$ac_option in\n  --)\n    ac_dashdash=yes ;;\n\n  -bindir | --bindir | --bindi | --bind | --bin | --bi)\n    ac_prev=bindir ;;\n  -bindir=* | --bindir=* | --bindi=* | --bind=* | --bin=* | --bi=*)\n    bindir=$ac_optarg ;;\n\n  -build | --build | --buil | --bui | --bu)\n    ac_prev=build_alias ;;\n  -build=* | --build=* | --buil=* | --bui=* | --bu=*)\n    build_alias=$ac_optarg ;;\n\n  -cache-file | --cache-file | --cache-fil | --cache-fi \\\n  | --cache-f | --cache- | --cache | --cach | --cac | --ca | --c)\n    ac_prev=cache_file ;;\n  -cache-file=* | --cache-file=* | --cache-fil=* | --cache-fi=* \\\n  | --cache-f=* | --cache-=* | --cache=* | --cach=* | --cac=* | --ca=* | --c=*)\n    cache_file=$ac_optarg ;;\n\n  --config-cache | -C)\n    cache_file=config.cache ;;\n\n  -datadir | --datadir | --datadi | --datad)\n    ac_prev=datadir ;;\n  -datadir=* | --datadir=* | --datadi=* | --datad=*)\n    datadir=$ac_optarg ;;\n\n  -datarootdir | --datarootdir | --datarootdi | --datarootd | --dataroot \\\n  | --dataroo | --dataro | --datar)\n    ac_prev=datarootdir ;;\n  -datarootdir=* | --datarootdir=* | --datarootdi=* | --datarootd=* \\\n  | --dataroot=* | --dataroo=* | --dataro=* | --datar=*)\n    datarootdir=$ac_optarg ;;\n\n  -disable-* | --disable-*)\n    ac_useropt=`expr \"x$ac_option\" : 'x-*disable-\\(.*\\)'`\n    # Reject names that are not valid shell variable names.\n    expr \"x$ac_useropt\" : \".*[^-+._$as_cr_alnum]\" >/dev/null &&\n      as_fn_error $? \"invalid feature name: $ac_useropt\"\n    ac_useropt_orig=$ac_useropt\n    ac_useropt=`$as_echo \"$ac_useropt\" | sed 's/[-+.]/_/g'`\n    case $ac_user_opts in\n      *\"\n\"enable_$ac_useropt\"\n\"*) ;;\n      *) ac_unrecognized_opts=\"$ac_unrecognized_opts$ac_unrecognized_sep--disable-$ac_useropt_orig\"\n\t ac_unrecognized_sep=', ';;\n    esac\n    eval enable_$ac_useropt=no ;;\n\n  -docdir | --docdir | --docdi | --doc | --do)\n    ac_prev=docdir ;;\n  -docdir=* | --docdir=* | --docdi=* | --doc=* | --do=*)\n    docdir=$ac_optarg ;;\n\n  -dvidir | --dvidir | --dvidi | --dvid | --dvi | --dv)\n    ac_prev=dvidir ;;\n  -dvidir=* | --dvidir=* | --dvidi=* | --dvid=* | --dvi=* | --dv=*)\n    dvidir=$ac_optarg ;;\n\n  -enable-* | --enable-*)\n    ac_useropt=`expr \"x$ac_option\" : 'x-*enable-\\([^=]*\\)'`\n    # Reject names that are not valid shell variable names.\n    expr \"x$ac_useropt\" : \".*[^-+._$as_cr_alnum]\" >/dev/null &&\n      as_fn_error $? \"invalid feature name: $ac_useropt\"\n    ac_useropt_orig=$ac_useropt\n    ac_useropt=`$as_echo \"$ac_useropt\" | sed 's/[-+.]/_/g'`\n    case $ac_user_opts in\n      *\"\n\"enable_$ac_useropt\"\n\"*) ;;\n      *) ac_unrecognized_opts=\"$ac_unrecognized_opts$ac_unrecognized_sep--enable-$ac_useropt_orig\"\n\t ac_unrecognized_sep=', ';;\n    esac\n    eval enable_$ac_useropt=\\$ac_optarg ;;\n\n  -exec-prefix | --exec_prefix | --exec-prefix | --exec-prefi \\\n  | --exec-pref | --exec-pre | --exec-pr | --exec-p | --exec- \\\n  | --exec | --exe | --ex)\n    ac_prev=exec_prefix ;;\n  -exec-prefix=* | --exec_prefix=* | --exec-prefix=* | --exec-prefi=* \\\n  | --exec-pref=* | --exec-pre=* | --exec-pr=* | --exec-p=* | --exec-=* \\\n  | --exec=* | --exe=* | --ex=*)\n    exec_prefix=$ac_optarg ;;\n\n  -gas | --gas | --ga | --g)\n    # Obsolete; use --with-gas.\n    with_gas=yes ;;\n\n  -help | --help | --hel | --he | -h)\n    ac_init_help=long ;;\n  -help=r* | --help=r* | --hel=r* | --he=r* | -hr*)\n    ac_init_help=recursive ;;\n  -help=s* | --help=s* | --hel=s* | --he=s* | -hs*)\n    ac_init_help=short ;;\n\n  -host | --host | --hos | --ho)\n    ac_prev=host_alias ;;\n  -host=* | --host=* | --hos=* | --ho=*)\n    host_alias=$ac_optarg ;;\n\n  -htmldir | --htmldir | --htmldi | --htmld | --html | --htm | --ht)\n    ac_prev=htmldir ;;\n  -htmldir=* | --htmldir=* | --htmldi=* | --htmld=* | --html=* | --htm=* \\\n  | --ht=*)\n    htmldir=$ac_optarg ;;\n\n  -includedir | --includedir | --includedi | --included | --include \\\n  | --includ | --inclu | --incl | --inc)\n    ac_prev=includedir ;;\n  -includedir=* | --includedir=* | --includedi=* | --included=* | --include=* \\\n  | --includ=* | --inclu=* | --incl=* | --inc=*)\n    includedir=$ac_optarg ;;\n\n  -infodir | --infodir | --infodi | --infod | --info | --inf)\n    ac_prev=infodir ;;\n  -infodir=* | --infodir=* | --infodi=* | --infod=* | --info=* | --inf=*)\n    infodir=$ac_optarg ;;\n\n  -libdir | --libdir | --libdi | --libd)\n    ac_prev=libdir ;;\n  -libdir=* | --libdir=* | --libdi=* | --libd=*)\n    libdir=$ac_optarg ;;\n\n  -libexecdir | --libexecdir | --libexecdi | --libexecd | --libexec \\\n  | --libexe | --libex | --libe)\n    ac_prev=libexecdir ;;\n  -libexecdir=* | --libexecdir=* | --libexecdi=* | --libexecd=* | --libexec=* \\\n  | --libexe=* | --libex=* | --libe=*)\n    libexecdir=$ac_optarg ;;\n\n  -localedir | --localedir | --localedi | --localed | --locale)\n    ac_prev=localedir ;;\n  -localedir=* | --localedir=* | --localedi=* | --localed=* | --locale=*)\n    localedir=$ac_optarg ;;\n\n  -localstatedir | --localstatedir | --localstatedi | --localstated \\\n  | --localstate | --localstat | --localsta | --localst | --locals)\n    ac_prev=localstatedir ;;\n  -localstatedir=* | --localstatedir=* | --localstatedi=* | --localstated=* \\\n  | --localstate=* | --localstat=* | --localsta=* | --localst=* | --locals=*)\n    localstatedir=$ac_optarg ;;\n\n  -mandir | --mandir | --mandi | --mand | --man | --ma | --m)\n    ac_prev=mandir ;;\n  -mandir=* | --mandir=* | --mandi=* | --mand=* | --man=* | --ma=* | --m=*)\n    mandir=$ac_optarg ;;\n\n  -nfp | --nfp | --nf)\n    # Obsolete; use --without-fp.\n    with_fp=no ;;\n\n  -no-create | --no-create | --no-creat | --no-crea | --no-cre \\\n  | --no-cr | --no-c | -n)\n    no_create=yes ;;\n\n  -no-recursion | --no-recursion | --no-recursio | --no-recursi \\\n  | --no-recurs | --no-recur | --no-recu | --no-rec | --no-re | --no-r)\n    no_recursion=yes ;;\n\n  -oldincludedir | --oldincludedir | --oldincludedi | --oldincluded \\\n  | --oldinclude | --oldinclud | --oldinclu | --oldincl | --oldinc \\\n  | --oldin | --oldi | --old | --ol | --o)\n    ac_prev=oldincludedir ;;\n  -oldincludedir=* | --oldincludedir=* | --oldincludedi=* | --oldincluded=* \\\n  | --oldinclude=* | --oldinclud=* | --oldinclu=* | --oldincl=* | --oldinc=* \\\n  | --oldin=* | --oldi=* | --old=* | --ol=* | --o=*)\n    oldincludedir=$ac_optarg ;;\n\n  -prefix | --prefix | --prefi | --pref | --pre | --pr | --p)\n    ac_prev=prefix ;;\n  -prefix=* | --prefix=* | --prefi=* | --pref=* | --pre=* | --pr=* | --p=*)\n    prefix=$ac_optarg ;;\n\n  -program-prefix | --program-prefix | --program-prefi | --program-pref \\\n  | --program-pre | --program-pr | --program-p)\n    ac_prev=program_prefix ;;\n  -program-prefix=* | --program-prefix=* | --program-prefi=* \\\n  | --program-pref=* | --program-pre=* | --program-pr=* | --program-p=*)\n    program_prefix=$ac_optarg ;;\n\n  -program-suffix | --program-suffix | --program-suffi | --program-suff \\\n  | --program-suf | --program-su | --program-s)\n    ac_prev=program_suffix ;;\n  -program-suffix=* | --program-suffix=* | --program-suffi=* \\\n  | --program-suff=* | --program-suf=* | --program-su=* | --program-s=*)\n    program_suffix=$ac_optarg ;;\n\n  -program-transform-name | --program-transform-name \\\n  | --program-transform-nam | --program-transform-na \\\n  | --program-transform-n | --program-transform- \\\n  | --program-transform | --program-transfor \\\n  | --program-transfo | --program-transf \\\n  | --program-trans | --program-tran \\\n  | --progr-tra | --program-tr | --program-t)\n    ac_prev=program_transform_name ;;\n  -program-transform-name=* | --program-transform-name=* \\\n  | --program-transform-nam=* | --program-transform-na=* \\\n  | --program-transform-n=* | --program-transform-=* \\\n  | --program-transform=* | --program-transfor=* \\\n  | --program-transfo=* | --program-transf=* \\\n  | --program-trans=* | --program-tran=* \\\n  | --progr-tra=* | --program-tr=* | --program-t=*)\n    program_transform_name=$ac_optarg ;;\n\n  -pdfdir | --pdfdir | --pdfdi | --pdfd | --pdf | --pd)\n    ac_prev=pdfdir ;;\n  -pdfdir=* | --pdfdir=* | --pdfdi=* | --pdfd=* | --pdf=* | --pd=*)\n    pdfdir=$ac_optarg ;;\n\n  -psdir | --psdir | --psdi | --psd | --ps)\n    ac_prev=psdir ;;\n  -psdir=* | --psdir=* | --psdi=* | --psd=* | --ps=*)\n    psdir=$ac_optarg ;;\n\n  -q | -quiet | --quiet | --quie | --qui | --qu | --q \\\n  | -silent | --silent | --silen | --sile | --sil)\n    silent=yes ;;\n\n  -runstatedir | --runstatedir | --runstatedi | --runstated \\\n  | --runstate | --runstat | --runsta | --runst | --runs \\\n  | --run | --ru | --r)\n    ac_prev=runstatedir ;;\n  -runstatedir=* | --runstatedir=* | --runstatedi=* | --runstated=* \\\n  | --runstate=* | --runstat=* | --runsta=* | --runst=* | --runs=* \\\n  | --run=* | --ru=* | --r=*)\n    runstatedir=$ac_optarg ;;\n\n  -sbindir | --sbindir | --sbindi | --sbind | --sbin | --sbi | --sb)\n    ac_prev=sbindir ;;\n  -sbindir=* | --sbindir=* | --sbindi=* | --sbind=* | --sbin=* \\\n  | --sbi=* | --sb=*)\n    sbindir=$ac_optarg ;;\n\n  -sharedstatedir | --sharedstatedir | --sharedstatedi \\\n  | --sharedstated | --sharedstate | --sharedstat | --sharedsta \\\n  | --sharedst | --shareds | --shared | --share | --shar \\\n  | --sha | --sh)\n    ac_prev=sharedstatedir ;;\n  -sharedstatedir=* | --sharedstatedir=* | --sharedstatedi=* \\\n  | --sharedstated=* | --sharedstate=* | --sharedstat=* | --sharedsta=* \\\n  | --sharedst=* | --shareds=* | --shared=* | --share=* | --shar=* \\\n  | --sha=* | --sh=*)\n    sharedstatedir=$ac_optarg ;;\n\n  -site | --site | --sit)\n    ac_prev=site ;;\n  -site=* | --site=* | --sit=*)\n    site=$ac_optarg ;;\n\n  -srcdir | --srcdir | --srcdi | --srcd | --src | --sr)\n    ac_prev=srcdir ;;\n  -srcdir=* | --srcdir=* | --srcdi=* | --srcd=* | --src=* | --sr=*)\n    srcdir=$ac_optarg ;;\n\n  -sysconfdir | --sysconfdir | --sysconfdi | --sysconfd | --sysconf \\\n  | --syscon | --sysco | --sysc | --sys | --sy)\n    ac_prev=sysconfdir ;;\n  -sysconfdir=* | --sysconfdir=* | --sysconfdi=* | --sysconfd=* | --sysconf=* \\\n  | --syscon=* | --sysco=* | --sysc=* | --sys=* | --sy=*)\n    sysconfdir=$ac_optarg ;;\n\n  -target | --target | --targe | --targ | --tar | --ta | --t)\n    ac_prev=target_alias ;;\n  -target=* | --target=* | --targe=* | --targ=* | --tar=* | --ta=* | --t=*)\n    target_alias=$ac_optarg ;;\n\n  -v | -verbose | --verbose | --verbos | --verbo | --verb)\n    verbose=yes ;;\n\n  -version | --version | --versio | --versi | --vers | -V)\n    ac_init_version=: ;;\n\n  -with-* | --with-*)\n    ac_useropt=`expr \"x$ac_option\" : 'x-*with-\\([^=]*\\)'`\n    # Reject names that are not valid shell variable names.\n    expr \"x$ac_useropt\" : \".*[^-+._$as_cr_alnum]\" >/dev/null &&\n      as_fn_error $? \"invalid package name: $ac_useropt\"\n    ac_useropt_orig=$ac_useropt\n    ac_useropt=`$as_echo \"$ac_useropt\" | sed 's/[-+.]/_/g'`\n    case $ac_user_opts in\n      *\"\n\"with_$ac_useropt\"\n\"*) ;;\n      *) ac_unrecognized_opts=\"$ac_unrecognized_opts$ac_unrecognized_sep--with-$ac_useropt_orig\"\n\t ac_unrecognized_sep=', ';;\n    esac\n    eval with_$ac_useropt=\\$ac_optarg ;;\n\n  -without-* | --without-*)\n    ac_useropt=`expr \"x$ac_option\" : 'x-*without-\\(.*\\)'`\n    # Reject names that are not valid shell variable names.\n    expr \"x$ac_useropt\" : \".*[^-+._$as_cr_alnum]\" >/dev/null &&\n      as_fn_error $? \"invalid package name: $ac_useropt\"\n    ac_useropt_orig=$ac_useropt\n    ac_useropt=`$as_echo \"$ac_useropt\" | sed 's/[-+.]/_/g'`\n    case $ac_user_opts in\n      *\"\n\"with_$ac_useropt\"\n\"*) ;;\n      *) ac_unrecognized_opts=\"$ac_unrecognized_opts$ac_unrecognized_sep--without-$ac_useropt_orig\"\n\t ac_unrecognized_sep=', ';;\n    esac\n    eval with_$ac_useropt=no ;;\n\n  --x)\n    # Obsolete; use --with-x.\n    with_x=yes ;;\n\n  -x-includes | --x-includes | --x-include | --x-includ | --x-inclu \\\n  | --x-incl | --x-inc | --x-in | --x-i)\n    ac_prev=x_includes ;;\n  -x-includes=* | --x-includes=* | --x-include=* | --x-includ=* | --x-inclu=* \\\n  | --x-incl=* | --x-inc=* | --x-in=* | --x-i=*)\n    x_includes=$ac_optarg ;;\n\n  -x-libraries | --x-libraries | --x-librarie | --x-librari \\\n  | --x-librar | --x-libra | --x-libr | --x-lib | --x-li | --x-l)\n    ac_prev=x_libraries ;;\n  -x-libraries=* | --x-libraries=* | --x-librarie=* | --x-librari=* \\\n  | --x-librar=* | --x-libra=* | --x-libr=* | --x-lib=* | --x-li=* | --x-l=*)\n    x_libraries=$ac_optarg ;;\n\n  -*) as_fn_error $? \"unrecognized option: \\`$ac_option'\nTry \\`$0 --help' for more information\"\n    ;;\n\n  *=*)\n    ac_envvar=`expr \"x$ac_option\" : 'x\\([^=]*\\)='`\n    # Reject names that are not valid shell variable names.\n    case $ac_envvar in #(\n      '' | [0-9]* | *[!_$as_cr_alnum]* )\n      as_fn_error $? \"invalid variable name: \\`$ac_envvar'\" ;;\n    esac\n    eval $ac_envvar=\\$ac_optarg\n    export $ac_envvar ;;\n\n  *)\n    # FIXME: should be removed in autoconf 3.0.\n    $as_echo \"$as_me: WARNING: you should use --build, --host, --target\" >&2\n    expr \"x$ac_option\" : \".*[^-._$as_cr_alnum]\" >/dev/null &&\n      $as_echo \"$as_me: WARNING: invalid host type: $ac_option\" >&2\n    : \"${build_alias=$ac_option} ${host_alias=$ac_option} ${target_alias=$ac_option}\"\n    ;;\n\n  esac\ndone\n\nif test -n \"$ac_prev\"; then\n  ac_option=--`echo $ac_prev | sed 's/_/-/g'`\n  as_fn_error $? \"missing argument to $ac_option\"\nfi\n\nif test -n \"$ac_unrecognized_opts\"; then\n  case $enable_option_checking in\n    no) ;;\n    fatal) as_fn_error $? \"unrecognized options: $ac_unrecognized_opts\" ;;\n    *)     $as_echo \"$as_me: WARNING: unrecognized options: $ac_unrecognized_opts\" >&2 ;;\n  esac\nfi\n\n# Check all directory arguments for consistency.\nfor ac_var in\texec_prefix prefix bindir sbindir libexecdir datarootdir \\\n\t\tdatadir sysconfdir sharedstatedir localstatedir includedir \\\n\t\toldincludedir docdir infodir htmldir dvidir pdfdir psdir \\\n\t\tlibdir localedir mandir runstatedir\ndo\n  eval ac_val=\\$$ac_var\n  # Remove trailing slashes.\n  case $ac_val in\n    */ )\n      ac_val=`expr \"X$ac_val\" : 'X\\(.*[^/]\\)' \\| \"X$ac_val\" : 'X\\(.*\\)'`\n      eval $ac_var=\\$ac_val;;\n  esac\n  # Be sure to have absolute directory names.\n  case $ac_val in\n    [\\\\/$]* | ?:[\\\\/]* )  continue;;\n    NONE | '' ) case $ac_var in *prefix ) continue;; esac;;\n  esac\n  as_fn_error $? \"expected an absolute directory name for --$ac_var: $ac_val\"\ndone\n\n# There might be people who depend on the old broken behavior: `$host'\n# used to hold the argument of --host etc.\n# FIXME: To remove some day.\nbuild=$build_alias\nhost=$host_alias\ntarget=$target_alias\n\n# FIXME: To remove some day.\nif test \"x$host_alias\" != x; then\n  if test \"x$build_alias\" = x; then\n    cross_compiling=maybe\n  elif test \"x$build_alias\" != \"x$host_alias\"; then\n    cross_compiling=yes\n  fi\nfi\n\nac_tool_prefix=\ntest -n \"$host_alias\" && ac_tool_prefix=$host_alias-\n\ntest \"$silent\" = yes && exec 6>/dev/null\n\n\nac_pwd=`pwd` && test -n \"$ac_pwd\" &&\nac_ls_di=`ls -di .` &&\nac_pwd_ls_di=`cd \"$ac_pwd\" && ls -di .` ||\n  as_fn_error $? \"working directory cannot be determined\"\ntest \"X$ac_ls_di\" = \"X$ac_pwd_ls_di\" ||\n  as_fn_error $? \"pwd does not report name of working directory\"\n\n\n# Find the source files, if location was not specified.\nif test -z \"$srcdir\"; then\n  ac_srcdir_defaulted=yes\n  # Try the directory containing this script, then the parent directory.\n  ac_confdir=`$as_dirname -- \"$as_myself\" ||\n$as_expr X\"$as_myself\" : 'X\\(.*[^/]\\)//*[^/][^/]*/*$' \\| \\\n\t X\"$as_myself\" : 'X\\(//\\)[^/]' \\| \\\n\t X\"$as_myself\" : 'X\\(//\\)$' \\| \\\n\t X\"$as_myself\" : 'X\\(/\\)' \\| . 2>/dev/null ||\n$as_echo X\"$as_myself\" |\n    sed '/^X\\(.*[^/]\\)\\/\\/*[^/][^/]*\\/*$/{\n\t    s//\\1/\n\t    q\n\t  }\n\t  /^X\\(\\/\\/\\)[^/].*/{\n\t    s//\\1/\n\t    q\n\t  }\n\t  /^X\\(\\/\\/\\)$/{\n\t    s//\\1/\n\t    q\n\t  }\n\t  /^X\\(\\/\\).*/{\n\t    s//\\1/\n\t    q\n\t  }\n\t  s/.*/./; q'`\n  srcdir=$ac_confdir\n  if test ! -r \"$srcdir/$ac_unique_file\"; then\n    srcdir=..\n  fi\nelse\n  ac_srcdir_defaulted=no\nfi\nif test ! -r \"$srcdir/$ac_unique_file\"; then\n  test \"$ac_srcdir_defaulted\" = yes && srcdir=\"$ac_confdir or ..\"\n  as_fn_error $? \"cannot find sources ($ac_unique_file) in $srcdir\"\nfi\nac_msg=\"sources are in $srcdir, but \\`cd $srcdir' does not work\"\nac_abs_confdir=`(\n\tcd \"$srcdir\" && test -r \"./$ac_unique_file\" || as_fn_error $? \"$ac_msg\"\n\tpwd)`\n# When building in place, set srcdir=.\nif test \"$ac_abs_confdir\" = \"$ac_pwd\"; then\n  srcdir=.\nfi\n# Remove unnecessary trailing slashes from srcdir.\n# Double slashes in file names in object file debugging info\n# mess up M-x gdb in Emacs.\ncase $srcdir in\n*/) srcdir=`expr \"X$srcdir\" : 'X\\(.*[^/]\\)' \\| \"X$srcdir\" : 'X\\(.*\\)'`;;\nesac\nfor ac_var in $ac_precious_vars; do\n  eval ac_env_${ac_var}_set=\\${${ac_var}+set}\n  eval ac_env_${ac_var}_value=\\$${ac_var}\n  eval ac_cv_env_${ac_var}_set=\\${${ac_var}+set}\n  eval ac_cv_env_${ac_var}_value=\\$${ac_var}\ndone\n\n#\n# Report the --help message.\n#\nif test \"$ac_init_help\" = \"long\"; then\n  # Omit some internal or obsolete options to make the list less imposing.\n  # This message is too long to be a string in the A/UX 3.1 sh.\n  cat <<_ACEOF\n\\`configure' configures OpenFst 1.6.9 to adapt to many kinds of systems.\n\nUsage: $0 [OPTION]... [VAR=VALUE]...\n\nTo assign environment variables (e.g., CC, CFLAGS...), specify them as\nVAR=VALUE.  See below for descriptions of some of the useful variables.\n\nDefaults for the options are specified in brackets.\n\nConfiguration:\n  -h, --help              display this help and exit\n      --help=short        display options specific to this package\n      --help=recursive    display the short help of all the included packages\n  -V, --version           display version information and exit\n  -q, --quiet, --silent   do not print \\`checking ...' messages\n      --cache-file=FILE   cache test results in FILE [disabled]\n  -C, --config-cache      alias for \\`--cache-file=config.cache'\n  -n, --no-create         do not create output files\n      --srcdir=DIR        find the sources in DIR [configure dir or \\`..']\n\nInstallation directories:\n  --prefix=PREFIX         install architecture-independent files in PREFIX\n                          [$ac_default_prefix]\n  --exec-prefix=EPREFIX   install architecture-dependent files in EPREFIX\n                          [PREFIX]\n\nBy default, \\`make install' will install all the files in\n\\`$ac_default_prefix/bin', \\`$ac_default_prefix/lib' etc.  You can specify\nan installation prefix other than \\`$ac_default_prefix' using \\`--prefix',\nfor instance \\`--prefix=\\$HOME'.\n\nFor better control, use the options below.\n\nFine tuning of the installation directories:\n  --bindir=DIR            user executables [EPREFIX/bin]\n  --sbindir=DIR           system admin executables [EPREFIX/sbin]\n  --libexecdir=DIR        program executables [EPREFIX/libexec]\n  --sysconfdir=DIR        read-only single-machine data [PREFIX/etc]\n  --sharedstatedir=DIR    modifiable architecture-independent data [PREFIX/com]\n  --localstatedir=DIR     modifiable single-machine data [PREFIX/var]\n  --runstatedir=DIR       modifiable per-process data [LOCALSTATEDIR/run]\n  --libdir=DIR            object code libraries [EPREFIX/lib]\n  --includedir=DIR        C header files [PREFIX/include]\n  --oldincludedir=DIR     C header files for non-gcc [/usr/include]\n  --datarootdir=DIR       read-only arch.-independent data root [PREFIX/share]\n  --datadir=DIR           read-only architecture-independent data [DATAROOTDIR]\n  --infodir=DIR           info documentation [DATAROOTDIR/info]\n  --localedir=DIR         locale-dependent data [DATAROOTDIR/locale]\n  --mandir=DIR            man documentation [DATAROOTDIR/man]\n  --docdir=DIR            documentation root [DATAROOTDIR/doc/openfst]\n  --htmldir=DIR           html documentation [DOCDIR]\n  --dvidir=DIR            dvi documentation [DOCDIR]\n  --pdfdir=DIR            pdf documentation [DOCDIR]\n  --psdir=DIR             ps documentation [DOCDIR]\n_ACEOF\n\n  cat <<\\_ACEOF\n\nProgram names:\n  --program-prefix=PREFIX            prepend PREFIX to installed program names\n  --program-suffix=SUFFIX            append SUFFIX to installed program names\n  --program-transform-name=PROGRAM   run sed PROGRAM on installed program names\n\nSystem types:\n  --build=BUILD     configure for building on BUILD [guessed]\n  --host=HOST       cross-compile to build programs to run on HOST [BUILD]\n_ACEOF\nfi\n\nif test -n \"$ac_init_help\"; then\n  case $ac_init_help in\n     short | recursive ) echo \"Configuration of OpenFst 1.6.9:\";;\n   esac\n  cat <<\\_ACEOF\n\nOptional Features:\n  --disable-option-checking  ignore unrecognized --enable/--with options\n  --disable-FEATURE       do not include FEATURE (same as --enable-FEATURE=no)\n  --enable-FEATURE[=ARG]  include FEATURE [ARG=yes]\n  --enable-silent-rules   less verbose build output (undo: \"make V=1\")\n  --disable-silent-rules  verbose build output (undo: \"make V=0\")\n  --enable-dependency-tracking\n                          do not reject slow dependency extractors\n  --disable-dependency-tracking\n                          speeds up one-time build\n  --enable-static[=PKGS]  build static libraries [default=no]\n  --enable-shared[=PKGS]  build shared libraries [default=yes]\n  --enable-fast-install[=PKGS]\n                          optimize for fast installation [default=yes]\n  --disable-libtool-lock  avoid locking (might break parallel builds)\n  --enable-compact-fsts   enable CompactFst extensions\n  --enable-compress       enable compression extension\n  --enable-const-fsts     enable ConstFst extensions\n  --enable-far            enable FAR extensions\n  --enable-linear-fsts    enable LinearTagger/ClassifierFst extensions\n  --enable-lookahead-fsts enable LookAheadFst extensions\n  --enable-mpdt           enable MPDT extensions\n  --enable-ngram-fsts     enable NGramFst extension\n  --enable-pdt            enable PDT extensions\n  --enable-python         enable Python extensions\n  --enable-special        enable special-matcher extensions\n  --enable-bin            enable fst::script and command-line binaries\n  --enable-grm            enable all dependencies of OpenGrm\n\nOptional Packages:\n  --with-PACKAGE[=ARG]    use PACKAGE [ARG=yes]\n  --without-PACKAGE       do not use PACKAGE (same as --with-PACKAGE=no)\n  --with-pic[=PKGS]       try to use only PIC/non-PIC objects [default=use\n                          both]\n  --with-aix-soname=aix|svr4|both\n                          shared library versioning (aka \"SONAME\") variant to\n                          provide on AIX, [default=aix].\n  --with-gnu-ld           assume the C compiler uses GNU ld [default=no]\n  --with-sysroot[=DIR]    Search for dependent libraries within DIR (or the\n                          compiler's sysroot if not specified).\n--with-libfstdir=DIR fst dynamic extensions [LIBDIR/fst]\n\nSome influential environment variables:\n  CC          C compiler command\n  CFLAGS      C compiler flags\n  LDFLAGS     linker flags, e.g. -L<lib dir> if you have libraries in a\n              nonstandard directory <lib dir>\n  LIBS        libraries to pass to the linker, e.g. -l<library>\n  CPPFLAGS    (Objective) C/C++ preprocessor flags, e.g. -I<include dir> if\n              you have headers in a nonstandard directory <include dir>\n  CXX         C++ compiler command\n  CXXFLAGS    C++ compiler flags\n  LT_SYS_LIBRARY_PATH\n              User-defined run-time library search path.\n  CPP         C preprocessor\n  CXXCPP      C++ preprocessor\n  PYTHON      the Python interpreter\n  PYTHON_VERSION\n              The installed Python version to use, for example '2.3'. This\n              string will be appended to the Python interpreter canonical\n              name.\n\nUse these variables to override the choices made by `configure' or to help\nit to find libraries and programs with nonstandard names/locations.\n\nReport bugs to <help@www.openfst.org>.\n_ACEOF\nac_status=$?\nfi\n\nif test \"$ac_init_help\" = \"recursive\"; then\n  # If there are subdirs, report their specific --help.\n  for ac_dir in : $ac_subdirs_all; do test \"x$ac_dir\" = x: && continue\n    test -d \"$ac_dir\" ||\n      { cd \"$srcdir\" && ac_pwd=`pwd` && srcdir=. && test -d \"$ac_dir\"; } ||\n      continue\n    ac_builddir=.\n\ncase \"$ac_dir\" in\n.) ac_dir_suffix= ac_top_builddir_sub=. ac_top_build_prefix= ;;\n*)\n  ac_dir_suffix=/`$as_echo \"$ac_dir\" | sed 's|^\\.[\\\\/]||'`\n  # A \"..\" for each directory in $ac_dir_suffix.\n  ac_top_builddir_sub=`$as_echo \"$ac_dir_suffix\" | sed 's|/[^\\\\/]*|/..|g;s|/||'`\n  case $ac_top_builddir_sub in\n  \"\") ac_top_builddir_sub=. ac_top_build_prefix= ;;\n  *)  ac_top_build_prefix=$ac_top_builddir_sub/ ;;\n  esac ;;\nesac\nac_abs_top_builddir=$ac_pwd\nac_abs_builddir=$ac_pwd$ac_dir_suffix\n# for backward compatibility:\nac_top_builddir=$ac_top_build_prefix\n\ncase $srcdir in\n  .)  # We are building in place.\n    ac_srcdir=.\n    ac_top_srcdir=$ac_top_builddir_sub\n    ac_abs_top_srcdir=$ac_pwd ;;\n  [\\\\/]* | ?:[\\\\/]* )  # Absolute name.\n    ac_srcdir=$srcdir$ac_dir_suffix;\n    ac_top_srcdir=$srcdir\n    ac_abs_top_srcdir=$srcdir ;;\n  *) # Relative name.\n    ac_srcdir=$ac_top_build_prefix$srcdir$ac_dir_suffix\n    ac_top_srcdir=$ac_top_build_prefix$srcdir\n    ac_abs_top_srcdir=$ac_pwd/$srcdir ;;\nesac\nac_abs_srcdir=$ac_abs_top_srcdir$ac_dir_suffix\n\n    cd \"$ac_dir\" || { ac_status=$?; continue; }\n    # Check for guested configure.\n    if test -f \"$ac_srcdir/configure.gnu\"; then\n      echo &&\n      $SHELL \"$ac_srcdir/configure.gnu\" --help=recursive\n    elif test -f \"$ac_srcdir/configure\"; then\n      echo &&\n      $SHELL \"$ac_srcdir/configure\" --help=recursive\n    else\n      $as_echo \"$as_me: WARNING: no configuration information is in $ac_dir\" >&2\n    fi || ac_status=$?\n    cd \"$ac_pwd\" || { ac_status=$?; break; }\n  done\nfi\n\ntest -n \"$ac_init_help\" && exit $ac_status\nif $ac_init_version; then\n  cat <<\\_ACEOF\nOpenFst configure 1.6.9\ngenerated by GNU Autoconf 2.69\n\nCopyright (C) 2012 Free Software Foundation, Inc.\nThis configure script is free software; the Free Software Foundation\ngives unlimited permission to copy, distribute and modify it.\n_ACEOF\n  exit\nfi\n\n## ------------------------ ##\n## Autoconf initialization. ##\n## ------------------------ ##\n\n# ac_fn_c_try_compile LINENO\n# --------------------------\n# Try to compile conftest.$ac_ext, and return whether this succeeded.\nac_fn_c_try_compile ()\n{\n  as_lineno=${as_lineno-\"$1\"} as_lineno_stack=as_lineno_stack=$as_lineno_stack\n  rm -f conftest.$ac_objext\n  if { { ac_try=\"$ac_compile\"\ncase \"(($ac_try\" in\n  *\\\"* | *\\`* | *\\\\*) ac_try_echo=\\$ac_try;;\n  *) ac_try_echo=$ac_try;;\nesac\neval ac_try_echo=\"\\\"\\$as_me:${as_lineno-$LINENO}: $ac_try_echo\\\"\"\n$as_echo \"$ac_try_echo\"; } >&5\n  (eval \"$ac_compile\") 2>conftest.err\n  ac_status=$?\n  if test -s conftest.err; then\n    grep -v '^ *+' conftest.err >conftest.er1\n    cat conftest.er1 >&5\n    mv -f conftest.er1 conftest.err\n  fi\n  $as_echo \"$as_me:${as_lineno-$LINENO}: \\$? = $ac_status\" >&5\n  test $ac_status = 0; } && {\n\t test -z \"$ac_c_werror_flag\" ||\n\t test ! -s conftest.err\n       } && test -s conftest.$ac_objext; then :\n  ac_retval=0\nelse\n  $as_echo \"$as_me: failed program was:\" >&5\nsed 's/^/| /' conftest.$ac_ext >&5\n\n\tac_retval=1\nfi\n  eval $as_lineno_stack; ${as_lineno_stack:+:} unset as_lineno\n  as_fn_set_status $ac_retval\n\n} # ac_fn_c_try_compile\n\n# ac_fn_cxx_try_compile LINENO\n# ----------------------------\n# Try to compile conftest.$ac_ext, and return whether this succeeded.\nac_fn_cxx_try_compile ()\n{\n  as_lineno=${as_lineno-\"$1\"} as_lineno_stack=as_lineno_stack=$as_lineno_stack\n  rm -f conftest.$ac_objext\n  if { { ac_try=\"$ac_compile\"\ncase \"(($ac_try\" in\n  *\\\"* | *\\`* | *\\\\*) ac_try_echo=\\$ac_try;;\n  *) ac_try_echo=$ac_try;;\nesac\neval ac_try_echo=\"\\\"\\$as_me:${as_lineno-$LINENO}: $ac_try_echo\\\"\"\n$as_echo \"$ac_try_echo\"; } >&5\n  (eval \"$ac_compile\") 2>conftest.err\n  ac_status=$?\n  if test -s conftest.err; then\n    grep -v '^ *+' conftest.err >conftest.er1\n    cat conftest.er1 >&5\n    mv -f conftest.er1 conftest.err\n  fi\n  $as_echo \"$as_me:${as_lineno-$LINENO}: \\$? = $ac_status\" >&5\n  test $ac_status = 0; } && {\n\t test -z \"$ac_cxx_werror_flag\" ||\n\t test ! -s conftest.err\n       } && test -s conftest.$ac_objext; then :\n  ac_retval=0\nelse\n  $as_echo \"$as_me: failed program was:\" >&5\nsed 's/^/| /' conftest.$ac_ext >&5\n\n\tac_retval=1\nfi\n  eval $as_lineno_stack; ${as_lineno_stack:+:} unset as_lineno\n  as_fn_set_status $ac_retval\n\n} # ac_fn_cxx_try_compile\n\n# ac_fn_c_try_link LINENO\n# -----------------------\n# Try to link conftest.$ac_ext, and return whether this succeeded.\nac_fn_c_try_link ()\n{\n  as_lineno=${as_lineno-\"$1\"} as_lineno_stack=as_lineno_stack=$as_lineno_stack\n  rm -f conftest.$ac_objext conftest$ac_exeext\n  if { { ac_try=\"$ac_link\"\ncase \"(($ac_try\" in\n  *\\\"* | *\\`* | *\\\\*) ac_try_echo=\\$ac_try;;\n  *) ac_try_echo=$ac_try;;\nesac\neval ac_try_echo=\"\\\"\\$as_me:${as_lineno-$LINENO}: $ac_try_echo\\\"\"\n$as_echo \"$ac_try_echo\"; } >&5\n  (eval \"$ac_link\") 2>conftest.err\n  ac_status=$?\n  if test -s conftest.err; then\n    grep -v '^ *+' conftest.err >conftest.er1\n    cat conftest.er1 >&5\n    mv -f conftest.er1 conftest.err\n  fi\n  $as_echo \"$as_me:${as_lineno-$LINENO}: \\$? = $ac_status\" >&5\n  test $ac_status = 0; } && {\n\t test -z \"$ac_c_werror_flag\" ||\n\t test ! -s conftest.err\n       } && test -s conftest$ac_exeext && {\n\t test \"$cross_compiling\" = yes ||\n\t test -x conftest$ac_exeext\n       }; then :\n  ac_retval=0\nelse\n  $as_echo \"$as_me: failed program was:\" >&5\nsed 's/^/| /' conftest.$ac_ext >&5\n\n\tac_retval=1\nfi\n  # Delete the IPA/IPO (Inter Procedural Analysis/Optimization) information\n  # created by the PGI compiler (conftest_ipa8_conftest.oo), as it would\n  # interfere with the next link command; also delete a directory that is\n  # left behind by Apple's compiler.  We do this before executing the actions.\n  rm -rf conftest.dSYM conftest_ipa8_conftest.oo\n  eval $as_lineno_stack; ${as_lineno_stack:+:} unset as_lineno\n  as_fn_set_status $ac_retval\n\n} # ac_fn_c_try_link\n\n# ac_fn_c_check_header_compile LINENO HEADER VAR INCLUDES\n# -------------------------------------------------------\n# Tests whether HEADER exists and can be compiled using the include files in\n# INCLUDES, setting the cache variable VAR accordingly.\nac_fn_c_check_header_compile ()\n{\n  as_lineno=${as_lineno-\"$1\"} as_lineno_stack=as_lineno_stack=$as_lineno_stack\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: checking for $2\" >&5\n$as_echo_n \"checking for $2... \" >&6; }\nif eval \\${$3+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  cat confdefs.h - <<_ACEOF >conftest.$ac_ext\n/* end confdefs.h.  */\n$4\n#include <$2>\n_ACEOF\nif ac_fn_c_try_compile \"$LINENO\"; then :\n  eval \"$3=yes\"\nelse\n  eval \"$3=no\"\nfi\nrm -f core conftest.err conftest.$ac_objext conftest.$ac_ext\nfi\neval ac_res=\\$$3\n\t       { $as_echo \"$as_me:${as_lineno-$LINENO}: result: $ac_res\" >&5\n$as_echo \"$ac_res\" >&6; }\n  eval $as_lineno_stack; ${as_lineno_stack:+:} unset as_lineno\n\n} # ac_fn_c_check_header_compile\n\n# ac_fn_c_try_cpp LINENO\n# ----------------------\n# Try to preprocess conftest.$ac_ext, and return whether this succeeded.\nac_fn_c_try_cpp ()\n{\n  as_lineno=${as_lineno-\"$1\"} as_lineno_stack=as_lineno_stack=$as_lineno_stack\n  if { { ac_try=\"$ac_cpp conftest.$ac_ext\"\ncase \"(($ac_try\" in\n  *\\\"* | *\\`* | *\\\\*) ac_try_echo=\\$ac_try;;\n  *) ac_try_echo=$ac_try;;\nesac\neval ac_try_echo=\"\\\"\\$as_me:${as_lineno-$LINENO}: $ac_try_echo\\\"\"\n$as_echo \"$ac_try_echo\"; } >&5\n  (eval \"$ac_cpp conftest.$ac_ext\") 2>conftest.err\n  ac_status=$?\n  if test -s conftest.err; then\n    grep -v '^ *+' conftest.err >conftest.er1\n    cat conftest.er1 >&5\n    mv -f conftest.er1 conftest.err\n  fi\n  $as_echo \"$as_me:${as_lineno-$LINENO}: \\$? = $ac_status\" >&5\n  test $ac_status = 0; } > conftest.i && {\n\t test -z \"$ac_c_preproc_warn_flag$ac_c_werror_flag\" ||\n\t test ! -s conftest.err\n       }; then :\n  ac_retval=0\nelse\n  $as_echo \"$as_me: failed program was:\" >&5\nsed 's/^/| /' conftest.$ac_ext >&5\n\n    ac_retval=1\nfi\n  eval $as_lineno_stack; ${as_lineno_stack:+:} unset as_lineno\n  as_fn_set_status $ac_retval\n\n} # ac_fn_c_try_cpp\n\n# ac_fn_c_try_run LINENO\n# ----------------------\n# Try to link conftest.$ac_ext, and return whether this succeeded. Assumes\n# that executables *can* be run.\nac_fn_c_try_run ()\n{\n  as_lineno=${as_lineno-\"$1\"} as_lineno_stack=as_lineno_stack=$as_lineno_stack\n  if { { ac_try=\"$ac_link\"\ncase \"(($ac_try\" in\n  *\\\"* | *\\`* | *\\\\*) ac_try_echo=\\$ac_try;;\n  *) ac_try_echo=$ac_try;;\nesac\neval ac_try_echo=\"\\\"\\$as_me:${as_lineno-$LINENO}: $ac_try_echo\\\"\"\n$as_echo \"$ac_try_echo\"; } >&5\n  (eval \"$ac_link\") 2>&5\n  ac_status=$?\n  $as_echo \"$as_me:${as_lineno-$LINENO}: \\$? = $ac_status\" >&5\n  test $ac_status = 0; } && { ac_try='./conftest$ac_exeext'\n  { { case \"(($ac_try\" in\n  *\\\"* | *\\`* | *\\\\*) ac_try_echo=\\$ac_try;;\n  *) ac_try_echo=$ac_try;;\nesac\neval ac_try_echo=\"\\\"\\$as_me:${as_lineno-$LINENO}: $ac_try_echo\\\"\"\n$as_echo \"$ac_try_echo\"; } >&5\n  (eval \"$ac_try\") 2>&5\n  ac_status=$?\n  $as_echo \"$as_me:${as_lineno-$LINENO}: \\$? = $ac_status\" >&5\n  test $ac_status = 0; }; }; then :\n  ac_retval=0\nelse\n  $as_echo \"$as_me: program exited with status $ac_status\" >&5\n       $as_echo \"$as_me: failed program was:\" >&5\nsed 's/^/| /' conftest.$ac_ext >&5\n\n       ac_retval=$ac_status\nfi\n  rm -rf conftest.dSYM conftest_ipa8_conftest.oo\n  eval $as_lineno_stack; ${as_lineno_stack:+:} unset as_lineno\n  as_fn_set_status $ac_retval\n\n} # ac_fn_c_try_run\n\n# ac_fn_c_check_func LINENO FUNC VAR\n# ----------------------------------\n# Tests whether FUNC exists, setting the cache variable VAR accordingly\nac_fn_c_check_func ()\n{\n  as_lineno=${as_lineno-\"$1\"} as_lineno_stack=as_lineno_stack=$as_lineno_stack\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: checking for $2\" >&5\n$as_echo_n \"checking for $2... \" >&6; }\nif eval \\${$3+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  cat confdefs.h - <<_ACEOF >conftest.$ac_ext\n/* end confdefs.h.  */\n/* Define $2 to an innocuous variant, in case <limits.h> declares $2.\n   For example, HP-UX 11i <limits.h> declares gettimeofday.  */\n#define $2 innocuous_$2\n\n/* System header to define __stub macros and hopefully few prototypes,\n    which can conflict with char $2 (); below.\n    Prefer <limits.h> to <assert.h> if __STDC__ is defined, since\n    <limits.h> exists even on freestanding compilers.  */\n\n#ifdef __STDC__\n# include <limits.h>\n#else\n# include <assert.h>\n#endif\n\n#undef $2\n\n/* Override any GCC internal prototype to avoid an error.\n   Use char because int might match the return type of a GCC\n   builtin and then its argument prototype would still apply.  */\n#ifdef __cplusplus\nextern \"C\"\n#endif\nchar $2 ();\n/* The GNU C library defines this for functions which it implements\n    to always fail with ENOSYS.  Some functions are actually named\n    something starting with __ and the normal name is an alias.  */\n#if defined __stub_$2 || defined __stub___$2\nchoke me\n#endif\n\nint\nmain ()\n{\nreturn $2 ();\n  ;\n  return 0;\n}\n_ACEOF\nif ac_fn_c_try_link \"$LINENO\"; then :\n  eval \"$3=yes\"\nelse\n  eval \"$3=no\"\nfi\nrm -f core conftest.err conftest.$ac_objext \\\n    conftest$ac_exeext conftest.$ac_ext\nfi\neval ac_res=\\$$3\n\t       { $as_echo \"$as_me:${as_lineno-$LINENO}: result: $ac_res\" >&5\n$as_echo \"$ac_res\" >&6; }\n  eval $as_lineno_stack; ${as_lineno_stack:+:} unset as_lineno\n\n} # ac_fn_c_check_func\n\n# ac_fn_cxx_try_cpp LINENO\n# ------------------------\n# Try to preprocess conftest.$ac_ext, and return whether this succeeded.\nac_fn_cxx_try_cpp ()\n{\n  as_lineno=${as_lineno-\"$1\"} as_lineno_stack=as_lineno_stack=$as_lineno_stack\n  if { { ac_try=\"$ac_cpp conftest.$ac_ext\"\ncase \"(($ac_try\" in\n  *\\\"* | *\\`* | *\\\\*) ac_try_echo=\\$ac_try;;\n  *) ac_try_echo=$ac_try;;\nesac\neval ac_try_echo=\"\\\"\\$as_me:${as_lineno-$LINENO}: $ac_try_echo\\\"\"\n$as_echo \"$ac_try_echo\"; } >&5\n  (eval \"$ac_cpp conftest.$ac_ext\") 2>conftest.err\n  ac_status=$?\n  if test -s conftest.err; then\n    grep -v '^ *+' conftest.err >conftest.er1\n    cat conftest.er1 >&5\n    mv -f conftest.er1 conftest.err\n  fi\n  $as_echo \"$as_me:${as_lineno-$LINENO}: \\$? = $ac_status\" >&5\n  test $ac_status = 0; } > conftest.i && {\n\t test -z \"$ac_cxx_preproc_warn_flag$ac_cxx_werror_flag\" ||\n\t test ! -s conftest.err\n       }; then :\n  ac_retval=0\nelse\n  $as_echo \"$as_me: failed program was:\" >&5\nsed 's/^/| /' conftest.$ac_ext >&5\n\n    ac_retval=1\nfi\n  eval $as_lineno_stack; ${as_lineno_stack:+:} unset as_lineno\n  as_fn_set_status $ac_retval\n\n} # ac_fn_cxx_try_cpp\n\n# ac_fn_cxx_try_link LINENO\n# -------------------------\n# Try to link conftest.$ac_ext, and return whether this succeeded.\nac_fn_cxx_try_link ()\n{\n  as_lineno=${as_lineno-\"$1\"} as_lineno_stack=as_lineno_stack=$as_lineno_stack\n  rm -f conftest.$ac_objext conftest$ac_exeext\n  if { { ac_try=\"$ac_link\"\ncase \"(($ac_try\" in\n  *\\\"* | *\\`* | *\\\\*) ac_try_echo=\\$ac_try;;\n  *) ac_try_echo=$ac_try;;\nesac\neval ac_try_echo=\"\\\"\\$as_me:${as_lineno-$LINENO}: $ac_try_echo\\\"\"\n$as_echo \"$ac_try_echo\"; } >&5\n  (eval \"$ac_link\") 2>conftest.err\n  ac_status=$?\n  if test -s conftest.err; then\n    grep -v '^ *+' conftest.err >conftest.er1\n    cat conftest.er1 >&5\n    mv -f conftest.er1 conftest.err\n  fi\n  $as_echo \"$as_me:${as_lineno-$LINENO}: \\$? = $ac_status\" >&5\n  test $ac_status = 0; } && {\n\t test -z \"$ac_cxx_werror_flag\" ||\n\t test ! -s conftest.err\n       } && test -s conftest$ac_exeext && {\n\t test \"$cross_compiling\" = yes ||\n\t test -x conftest$ac_exeext\n       }; then :\n  ac_retval=0\nelse\n  $as_echo \"$as_me: failed program was:\" >&5\nsed 's/^/| /' conftest.$ac_ext >&5\n\n\tac_retval=1\nfi\n  # Delete the IPA/IPO (Inter Procedural Analysis/Optimization) information\n  # created by the PGI compiler (conftest_ipa8_conftest.oo), as it would\n  # interfere with the next link command; also delete a directory that is\n  # left behind by Apple's compiler.  We do this before executing the actions.\n  rm -rf conftest.dSYM conftest_ipa8_conftest.oo\n  eval $as_lineno_stack; ${as_lineno_stack:+:} unset as_lineno\n  as_fn_set_status $ac_retval\n\n} # ac_fn_cxx_try_link\ncat >config.log <<_ACEOF\nThis file contains any messages produced by compilers while\nrunning configure, to aid debugging if configure makes a mistake.\n\nIt was created by OpenFst $as_me 1.6.9, which was\ngenerated by GNU Autoconf 2.69.  Invocation command line was\n\n  $ $0 $@\n\n_ACEOF\nexec 5>>config.log\n{\ncat <<_ASUNAME\n## --------- ##\n## Platform. ##\n## --------- ##\n\nhostname = `(hostname || uname -n) 2>/dev/null | sed 1q`\nuname -m = `(uname -m) 2>/dev/null || echo unknown`\nuname -r = `(uname -r) 2>/dev/null || echo unknown`\nuname -s = `(uname -s) 2>/dev/null || echo unknown`\nuname -v = `(uname -v) 2>/dev/null || echo unknown`\n\n/usr/bin/uname -p = `(/usr/bin/uname -p) 2>/dev/null || echo unknown`\n/bin/uname -X     = `(/bin/uname -X) 2>/dev/null     || echo unknown`\n\n/bin/arch              = `(/bin/arch) 2>/dev/null              || echo unknown`\n/usr/bin/arch -k       = `(/usr/bin/arch -k) 2>/dev/null       || echo unknown`\n/usr/convex/getsysinfo = `(/usr/convex/getsysinfo) 2>/dev/null || echo unknown`\n/usr/bin/hostinfo      = `(/usr/bin/hostinfo) 2>/dev/null      || echo unknown`\n/bin/machine           = `(/bin/machine) 2>/dev/null           || echo unknown`\n/usr/bin/oslevel       = `(/usr/bin/oslevel) 2>/dev/null       || echo unknown`\n/bin/universe          = `(/bin/universe) 2>/dev/null          || echo unknown`\n\n_ASUNAME\n\nas_save_IFS=$IFS; IFS=$PATH_SEPARATOR\nfor as_dir in $PATH\ndo\n  IFS=$as_save_IFS\n  test -z \"$as_dir\" && as_dir=.\n    $as_echo \"PATH: $as_dir\"\n  done\nIFS=$as_save_IFS\n\n} >&5\n\ncat >&5 <<_ACEOF\n\n\n## ----------- ##\n## Core tests. ##\n## ----------- ##\n\n_ACEOF\n\n\n# Keep a trace of the command line.\n# Strip out --no-create and --no-recursion so they do not pile up.\n# Strip out --silent because we don't want to record it for future runs.\n# Also quote any args containing shell meta-characters.\n# Make two passes to allow for proper duplicate-argument suppression.\nac_configure_args=\nac_configure_args0=\nac_configure_args1=\nac_must_keep_next=false\nfor ac_pass in 1 2\ndo\n  for ac_arg\n  do\n    case $ac_arg in\n    -no-create | --no-c* | -n | -no-recursion | --no-r*) continue ;;\n    -q | -quiet | --quiet | --quie | --qui | --qu | --q \\\n    | -silent | --silent | --silen | --sile | --sil)\n      continue ;;\n    *\\'*)\n      ac_arg=`$as_echo \"$ac_arg\" | sed \"s/'/'\\\\\\\\\\\\\\\\''/g\"` ;;\n    esac\n    case $ac_pass in\n    1) as_fn_append ac_configure_args0 \" '$ac_arg'\" ;;\n    2)\n      as_fn_append ac_configure_args1 \" '$ac_arg'\"\n      if test $ac_must_keep_next = true; then\n\tac_must_keep_next=false # Got value, back to normal.\n      else\n\tcase $ac_arg in\n\t  *=* | --config-cache | -C | -disable-* | --disable-* \\\n\t  | -enable-* | --enable-* | -gas | --g* | -nfp | --nf* \\\n\t  | -q | -quiet | --q* | -silent | --sil* | -v | -verb* \\\n\t  | -with-* | --with-* | -without-* | --without-* | --x)\n\t    case \"$ac_configure_args0 \" in\n\t      \"$ac_configure_args1\"*\" '$ac_arg' \"* ) continue ;;\n\t    esac\n\t    ;;\n\t  -* ) ac_must_keep_next=true ;;\n\tesac\n      fi\n      as_fn_append ac_configure_args \" '$ac_arg'\"\n      ;;\n    esac\n  done\ndone\n{ ac_configure_args0=; unset ac_configure_args0;}\n{ ac_configure_args1=; unset ac_configure_args1;}\n\n# When interrupted or exit'd, cleanup temporary files, and complete\n# config.log.  We remove comments because anyway the quotes in there\n# would cause problems or look ugly.\n# WARNING: Use '\\'' to represent an apostrophe within the trap.\n# WARNING: Do not start the trap code with a newline, due to a FreeBSD 4.0 bug.\ntrap 'exit_status=$?\n  # Save into config.log some information that might help in debugging.\n  {\n    echo\n\n    $as_echo \"## ---------------- ##\n## Cache variables. ##\n## ---------------- ##\"\n    echo\n    # The following way of writing the cache mishandles newlines in values,\n(\n  for ac_var in `(set) 2>&1 | sed -n '\\''s/^\\([a-zA-Z_][a-zA-Z0-9_]*\\)=.*/\\1/p'\\''`; do\n    eval ac_val=\\$$ac_var\n    case $ac_val in #(\n    *${as_nl}*)\n      case $ac_var in #(\n      *_cv_*) { $as_echo \"$as_me:${as_lineno-$LINENO}: WARNING: cache variable $ac_var contains a newline\" >&5\n$as_echo \"$as_me: WARNING: cache variable $ac_var contains a newline\" >&2;} ;;\n      esac\n      case $ac_var in #(\n      _ | IFS | as_nl) ;; #(\n      BASH_ARGV | BASH_SOURCE) eval $ac_var= ;; #(\n      *) { eval $ac_var=; unset $ac_var;} ;;\n      esac ;;\n    esac\n  done\n  (set) 2>&1 |\n    case $as_nl`(ac_space='\\'' '\\''; set) 2>&1` in #(\n    *${as_nl}ac_space=\\ *)\n      sed -n \\\n\t\"s/'\\''/'\\''\\\\\\\\'\\'''\\''/g;\n\t  s/^\\\\([_$as_cr_alnum]*_cv_[_$as_cr_alnum]*\\\\)=\\\\(.*\\\\)/\\\\1='\\''\\\\2'\\''/p\"\n      ;; #(\n    *)\n      sed -n \"/^[_$as_cr_alnum]*_cv_[_$as_cr_alnum]*=/p\"\n      ;;\n    esac |\n    sort\n)\n    echo\n\n    $as_echo \"## ----------------- ##\n## Output variables. ##\n## ----------------- ##\"\n    echo\n    for ac_var in $ac_subst_vars\n    do\n      eval ac_val=\\$$ac_var\n      case $ac_val in\n      *\\'\\''*) ac_val=`$as_echo \"$ac_val\" | sed \"s/'\\''/'\\''\\\\\\\\\\\\\\\\'\\'''\\''/g\"`;;\n      esac\n      $as_echo \"$ac_var='\\''$ac_val'\\''\"\n    done | sort\n    echo\n\n    if test -n \"$ac_subst_files\"; then\n      $as_echo \"## ------------------- ##\n## File substitutions. ##\n## ------------------- ##\"\n      echo\n      for ac_var in $ac_subst_files\n      do\n\teval ac_val=\\$$ac_var\n\tcase $ac_val in\n\t*\\'\\''*) ac_val=`$as_echo \"$ac_val\" | sed \"s/'\\''/'\\''\\\\\\\\\\\\\\\\'\\'''\\''/g\"`;;\n\tesac\n\t$as_echo \"$ac_var='\\''$ac_val'\\''\"\n      done | sort\n      echo\n    fi\n\n    if test -s confdefs.h; then\n      $as_echo \"## ----------- ##\n## confdefs.h. ##\n## ----------- ##\"\n      echo\n      cat confdefs.h\n      echo\n    fi\n    test \"$ac_signal\" != 0 &&\n      $as_echo \"$as_me: caught signal $ac_signal\"\n    $as_echo \"$as_me: exit $exit_status\"\n  } >&5\n  rm -f core *.core core.conftest.* &&\n    rm -f -r conftest* confdefs* conf$$* $ac_clean_files &&\n    exit $exit_status\n' 0\nfor ac_signal in 1 2 13 15; do\n  trap 'ac_signal='$ac_signal'; as_fn_exit 1' $ac_signal\ndone\nac_signal=0\n\n# confdefs.h avoids OS command line length limits that DEFS can exceed.\nrm -f -r conftest* confdefs.h\n\n$as_echo \"/* confdefs.h */\" > confdefs.h\n\n# Predefined preprocessor variables.\n\ncat >>confdefs.h <<_ACEOF\n#define PACKAGE_NAME \"$PACKAGE_NAME\"\n_ACEOF\n\ncat >>confdefs.h <<_ACEOF\n#define PACKAGE_TARNAME \"$PACKAGE_TARNAME\"\n_ACEOF\n\ncat >>confdefs.h <<_ACEOF\n#define PACKAGE_VERSION \"$PACKAGE_VERSION\"\n_ACEOF\n\ncat >>confdefs.h <<_ACEOF\n#define PACKAGE_STRING \"$PACKAGE_STRING\"\n_ACEOF\n\ncat >>confdefs.h <<_ACEOF\n#define PACKAGE_BUGREPORT \"$PACKAGE_BUGREPORT\"\n_ACEOF\n\ncat >>confdefs.h <<_ACEOF\n#define PACKAGE_URL \"$PACKAGE_URL\"\n_ACEOF\n\n\n# Let the site file select an alternate cache file if it wants to.\n# Prefer an explicitly selected file to automatically selected ones.\nac_site_file1=NONE\nac_site_file2=NONE\nif test -n \"$CONFIG_SITE\"; then\n  # We do not want a PATH search for config.site.\n  case $CONFIG_SITE in #((\n    -*)  ac_site_file1=./$CONFIG_SITE;;\n    */*) ac_site_file1=$CONFIG_SITE;;\n    *)   ac_site_file1=./$CONFIG_SITE;;\n  esac\nelif test \"x$prefix\" != xNONE; then\n  ac_site_file1=$prefix/share/config.site\n  ac_site_file2=$prefix/etc/config.site\nelse\n  ac_site_file1=$ac_default_prefix/share/config.site\n  ac_site_file2=$ac_default_prefix/etc/config.site\nfi\nfor ac_site_file in \"$ac_site_file1\" \"$ac_site_file2\"\ndo\n  test \"x$ac_site_file\" = xNONE && continue\n  if test /dev/null != \"$ac_site_file\" && test -r \"$ac_site_file\"; then\n    { $as_echo \"$as_me:${as_lineno-$LINENO}: loading site script $ac_site_file\" >&5\n$as_echo \"$as_me: loading site script $ac_site_file\" >&6;}\n    sed 's/^/| /' \"$ac_site_file\" >&5\n    . \"$ac_site_file\" \\\n      || { { $as_echo \"$as_me:${as_lineno-$LINENO}: error: in \\`$ac_pwd':\" >&5\n$as_echo \"$as_me: error: in \\`$ac_pwd':\" >&2;}\nas_fn_error $? \"failed to load site script $ac_site_file\nSee \\`config.log' for more details\" \"$LINENO\" 5; }\n  fi\ndone\n\nif test -r \"$cache_file\"; then\n  # Some versions of bash will fail to source /dev/null (special files\n  # actually), so we avoid doing that.  DJGPP emulates it as a regular file.\n  if test /dev/null != \"$cache_file\" && test -f \"$cache_file\"; then\n    { $as_echo \"$as_me:${as_lineno-$LINENO}: loading cache $cache_file\" >&5\n$as_echo \"$as_me: loading cache $cache_file\" >&6;}\n    case $cache_file in\n      [\\\\/]* | ?:[\\\\/]* ) . \"$cache_file\";;\n      *)                      . \"./$cache_file\";;\n    esac\n  fi\nelse\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: creating cache $cache_file\" >&5\n$as_echo \"$as_me: creating cache $cache_file\" >&6;}\n  >$cache_file\nfi\n\n# Check that the precious variables saved in the cache have kept the same\n# value.\nac_cache_corrupted=false\nfor ac_var in $ac_precious_vars; do\n  eval ac_old_set=\\$ac_cv_env_${ac_var}_set\n  eval ac_new_set=\\$ac_env_${ac_var}_set\n  eval ac_old_val=\\$ac_cv_env_${ac_var}_value\n  eval ac_new_val=\\$ac_env_${ac_var}_value\n  case $ac_old_set,$ac_new_set in\n    set,)\n      { $as_echo \"$as_me:${as_lineno-$LINENO}: error: \\`$ac_var' was set to \\`$ac_old_val' in the previous run\" >&5\n$as_echo \"$as_me: error: \\`$ac_var' was set to \\`$ac_old_val' in the previous run\" >&2;}\n      ac_cache_corrupted=: ;;\n    ,set)\n      { $as_echo \"$as_me:${as_lineno-$LINENO}: error: \\`$ac_var' was not set in the previous run\" >&5\n$as_echo \"$as_me: error: \\`$ac_var' was not set in the previous run\" >&2;}\n      ac_cache_corrupted=: ;;\n    ,);;\n    *)\n      if test \"x$ac_old_val\" != \"x$ac_new_val\"; then\n\t# differences in whitespace do not lead to failure.\n\tac_old_val_w=`echo x $ac_old_val`\n\tac_new_val_w=`echo x $ac_new_val`\n\tif test \"$ac_old_val_w\" != \"$ac_new_val_w\"; then\n\t  { $as_echo \"$as_me:${as_lineno-$LINENO}: error: \\`$ac_var' has changed since the previous run:\" >&5\n$as_echo \"$as_me: error: \\`$ac_var' has changed since the previous run:\" >&2;}\n\t  ac_cache_corrupted=:\n\telse\n\t  { $as_echo \"$as_me:${as_lineno-$LINENO}: warning: ignoring whitespace changes in \\`$ac_var' since the previous run:\" >&5\n$as_echo \"$as_me: warning: ignoring whitespace changes in \\`$ac_var' since the previous run:\" >&2;}\n\t  eval $ac_var=\\$ac_old_val\n\tfi\n\t{ $as_echo \"$as_me:${as_lineno-$LINENO}:   former value:  \\`$ac_old_val'\" >&5\n$as_echo \"$as_me:   former value:  \\`$ac_old_val'\" >&2;}\n\t{ $as_echo \"$as_me:${as_lineno-$LINENO}:   current value: \\`$ac_new_val'\" >&5\n$as_echo \"$as_me:   current value: \\`$ac_new_val'\" >&2;}\n      fi;;\n  esac\n  # Pass precious variables to config.status.\n  if test \"$ac_new_set\" = set; then\n    case $ac_new_val in\n    *\\'*) ac_arg=$ac_var=`$as_echo \"$ac_new_val\" | sed \"s/'/'\\\\\\\\\\\\\\\\''/g\"` ;;\n    *) ac_arg=$ac_var=$ac_new_val ;;\n    esac\n    case \" $ac_configure_args \" in\n      *\" '$ac_arg' \"*) ;; # Avoid dups.  Use of quotes ensures accuracy.\n      *) as_fn_append ac_configure_args \" '$ac_arg'\" ;;\n    esac\n  fi\ndone\nif $ac_cache_corrupted; then\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: error: in \\`$ac_pwd':\" >&5\n$as_echo \"$as_me: error: in \\`$ac_pwd':\" >&2;}\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: error: changes in the environment can compromise the build\" >&5\n$as_echo \"$as_me: error: changes in the environment can compromise the build\" >&2;}\n  as_fn_error $? \"run \\`make distclean' and/or \\`rm $cache_file' and start over\" \"$LINENO\" 5\nfi\n## -------------------- ##\n## Main body of script. ##\n## -------------------- ##\n\nac_ext=c\nac_cpp='$CPP $CPPFLAGS'\nac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5'\nac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5'\nac_compiler_gnu=$ac_cv_c_compiler_gnu\n\n\nam__api_version='1.15'\n\nac_aux_dir=\nfor ac_dir in \"$srcdir\" \"$srcdir/..\" \"$srcdir/../..\"; do\n  if test -f \"$ac_dir/install-sh\"; then\n    ac_aux_dir=$ac_dir\n    ac_install_sh=\"$ac_aux_dir/install-sh -c\"\n    break\n  elif test -f \"$ac_dir/install.sh\"; then\n    ac_aux_dir=$ac_dir\n    ac_install_sh=\"$ac_aux_dir/install.sh -c\"\n    break\n  elif test -f \"$ac_dir/shtool\"; then\n    ac_aux_dir=$ac_dir\n    ac_install_sh=\"$ac_aux_dir/shtool install -c\"\n    break\n  fi\ndone\nif test -z \"$ac_aux_dir\"; then\n  as_fn_error $? \"cannot find install-sh, install.sh, or shtool in \\\"$srcdir\\\" \\\"$srcdir/..\\\" \\\"$srcdir/../..\\\"\" \"$LINENO\" 5\nfi\n\n# These three variables are undocumented and unsupported,\n# and are intended to be withdrawn in a future Autoconf release.\n# They can cause serious problems if a builder's source tree is in a directory\n# whose full name contains unusual characters.\nac_config_guess=\"$SHELL $ac_aux_dir/config.guess\"  # Please don't use this var.\nac_config_sub=\"$SHELL $ac_aux_dir/config.sub\"  # Please don't use this var.\nac_configure=\"$SHELL $ac_aux_dir/configure\"  # Please don't use this var.\n\n\n# Find a good install program.  We prefer a C program (faster),\n# so one script is as good as another.  But avoid the broken or\n# incompatible versions:\n# SysV /etc/install, /usr/sbin/install\n# SunOS /usr/etc/install\n# IRIX /sbin/install\n# AIX /bin/install\n# AmigaOS /C/install, which installs bootblocks on floppy discs\n# AIX 4 /usr/bin/installbsd, which doesn't work without a -g flag\n# AFS /usr/afsws/bin/install, which mishandles nonexistent args\n# SVR4 /usr/ucb/install, which tries to use the nonexistent group \"staff\"\n# OS/2's system install, which has a completely different semantic\n# ./install, which can be erroneously created by make from ./install.sh.\n# Reject install programs that cannot install multiple files.\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for a BSD-compatible install\" >&5\n$as_echo_n \"checking for a BSD-compatible install... \" >&6; }\nif test -z \"$INSTALL\"; then\nif ${ac_cv_path_install+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  as_save_IFS=$IFS; IFS=$PATH_SEPARATOR\nfor as_dir in $PATH\ndo\n  IFS=$as_save_IFS\n  test -z \"$as_dir\" && as_dir=.\n    # Account for people who put trailing slashes in PATH elements.\ncase $as_dir/ in #((\n  ./ | .// | /[cC]/* | \\\n  /etc/* | /usr/sbin/* | /usr/etc/* | /sbin/* | /usr/afsws/bin/* | \\\n  ?:[\\\\/]os2[\\\\/]install[\\\\/]* | ?:[\\\\/]OS2[\\\\/]INSTALL[\\\\/]* | \\\n  /usr/ucb/* ) ;;\n  *)\n    # OSF1 and SCO ODT 3.0 have their own names for install.\n    # Don't use installbsd from OSF since it installs stuff as root\n    # by default.\n    for ac_prog in ginstall scoinst install; do\n      for ac_exec_ext in '' $ac_executable_extensions; do\n\tif as_fn_executable_p \"$as_dir/$ac_prog$ac_exec_ext\"; then\n\t  if test $ac_prog = install &&\n\t    grep dspmsg \"$as_dir/$ac_prog$ac_exec_ext\" >/dev/null 2>&1; then\n\t    # AIX install.  It has an incompatible calling convention.\n\t    :\n\t  elif test $ac_prog = install &&\n\t    grep pwplus \"$as_dir/$ac_prog$ac_exec_ext\" >/dev/null 2>&1; then\n\t    # program-specific install script used by HP pwplus--don't use.\n\t    :\n\t  else\n\t    rm -rf conftest.one conftest.two conftest.dir\n\t    echo one > conftest.one\n\t    echo two > conftest.two\n\t    mkdir conftest.dir\n\t    if \"$as_dir/$ac_prog$ac_exec_ext\" -c conftest.one conftest.two \"`pwd`/conftest.dir\" &&\n\t      test -s conftest.one && test -s conftest.two &&\n\t      test -s conftest.dir/conftest.one &&\n\t      test -s conftest.dir/conftest.two\n\t    then\n\t      ac_cv_path_install=\"$as_dir/$ac_prog$ac_exec_ext -c\"\n\t      break 3\n\t    fi\n\t  fi\n\tfi\n      done\n    done\n    ;;\nesac\n\n  done\nIFS=$as_save_IFS\n\nrm -rf conftest.one conftest.two conftest.dir\n\nfi\n  if test \"${ac_cv_path_install+set}\" = set; then\n    INSTALL=$ac_cv_path_install\n  else\n    # As a last resort, use the slow shell script.  Don't cache a\n    # value for INSTALL within a source directory, because that will\n    # break other packages using the cache if that directory is\n    # removed, or if the value is a relative name.\n    INSTALL=$ac_install_sh\n  fi\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $INSTALL\" >&5\n$as_echo \"$INSTALL\" >&6; }\n\n# Use test -z because SunOS4 sh mishandles braces in ${var-val}.\n# It thinks the first close brace ends the variable substitution.\ntest -z \"$INSTALL_PROGRAM\" && INSTALL_PROGRAM='${INSTALL}'\n\ntest -z \"$INSTALL_SCRIPT\" && INSTALL_SCRIPT='${INSTALL}'\n\ntest -z \"$INSTALL_DATA\" && INSTALL_DATA='${INSTALL} -m 644'\n\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking whether build environment is sane\" >&5\n$as_echo_n \"checking whether build environment is sane... \" >&6; }\n# Reject unsafe characters in $srcdir or the absolute working directory\n# name.  Accept space and tab only in the latter.\nam_lf='\n'\ncase `pwd` in\n  *[\\\\\\\"\\#\\$\\&\\'\\`$am_lf]*)\n    as_fn_error $? \"unsafe absolute working directory name\" \"$LINENO\" 5;;\nesac\ncase $srcdir in\n  *[\\\\\\\"\\#\\$\\&\\'\\`$am_lf\\ \\\t]*)\n    as_fn_error $? \"unsafe srcdir value: '$srcdir'\" \"$LINENO\" 5;;\nesac\n\n# Do 'set' in a subshell so we don't clobber the current shell's\n# arguments.  Must try -L first in case configure is actually a\n# symlink; some systems play weird games with the mod time of symlinks\n# (eg FreeBSD returns the mod time of the symlink's containing\n# directory).\nif (\n   am_has_slept=no\n   for am_try in 1 2; do\n     echo \"timestamp, slept: $am_has_slept\" > conftest.file\n     set X `ls -Lt \"$srcdir/configure\" conftest.file 2> /dev/null`\n     if test \"$*\" = \"X\"; then\n\t# -L didn't work.\n\tset X `ls -t \"$srcdir/configure\" conftest.file`\n     fi\n     if test \"$*\" != \"X $srcdir/configure conftest.file\" \\\n\t&& test \"$*\" != \"X conftest.file $srcdir/configure\"; then\n\n\t# If neither matched, then we have a broken ls.  This can happen\n\t# if, for instance, CONFIG_SHELL is bash and it inherits a\n\t# broken ls alias from the environment.  This has actually\n\t# happened.  Such a system could not be considered \"sane\".\n\tas_fn_error $? \"ls -t appears to fail.  Make sure there is not a broken\n  alias in your environment\" \"$LINENO\" 5\n     fi\n     if test \"$2\" = conftest.file || test $am_try -eq 2; then\n       break\n     fi\n     # Just in case.\n     sleep 1\n     am_has_slept=yes\n   done\n   test \"$2\" = conftest.file\n   )\nthen\n   # Ok.\n   :\nelse\n   as_fn_error $? \"newly created file is older than distributed files!\nCheck your system clock\" \"$LINENO\" 5\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: yes\" >&5\n$as_echo \"yes\" >&6; }\n# If we didn't sleep, we still need to ensure time stamps of config.status and\n# generated files are strictly newer.\nam_sleep_pid=\nif grep 'slept: no' conftest.file >/dev/null 2>&1; then\n  ( sleep 1 ) &\n  am_sleep_pid=$!\nfi\n\nrm -f conftest.file\n\ntest \"$program_prefix\" != NONE &&\n  program_transform_name=\"s&^&$program_prefix&;$program_transform_name\"\n# Use a double $ so make ignores it.\ntest \"$program_suffix\" != NONE &&\n  program_transform_name=\"s&\\$&$program_suffix&;$program_transform_name\"\n# Double any \\ or $.\n# By default was `s,x,x', remove it if useless.\nac_script='s/[\\\\$]/&&/g;s/;s,x,x,$//'\nprogram_transform_name=`$as_echo \"$program_transform_name\" | sed \"$ac_script\"`\n\n# Expand $ac_aux_dir to an absolute path.\nam_aux_dir=`cd \"$ac_aux_dir\" && pwd`\n\nif test x\"${MISSING+set}\" != xset; then\n  case $am_aux_dir in\n  *\\ * | *\\\t*)\n    MISSING=\"\\${SHELL} \\\"$am_aux_dir/missing\\\"\" ;;\n  *)\n    MISSING=\"\\${SHELL} $am_aux_dir/missing\" ;;\n  esac\nfi\n# Use eval to expand $SHELL\nif eval \"$MISSING --is-lightweight\"; then\n  am_missing_run=\"$MISSING \"\nelse\n  am_missing_run=\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: WARNING: 'missing' script is too old or missing\" >&5\n$as_echo \"$as_me: WARNING: 'missing' script is too old or missing\" >&2;}\nfi\n\nif test x\"${install_sh+set}\" != xset; then\n  case $am_aux_dir in\n  *\\ * | *\\\t*)\n    install_sh=\"\\${SHELL} '$am_aux_dir/install-sh'\" ;;\n  *)\n    install_sh=\"\\${SHELL} $am_aux_dir/install-sh\"\n  esac\nfi\n\n# Installed binaries are usually stripped using 'strip' when the user\n# run \"make install-strip\".  However 'strip' might not be the right\n# tool to use in cross-compilation environments, therefore Automake\n# will honor the 'STRIP' environment variable to overrule this program.\nif test \"$cross_compiling\" != no; then\n  if test -n \"$ac_tool_prefix\"; then\n  # Extract the first word of \"${ac_tool_prefix}strip\", so it can be a program name with args.\nset dummy ${ac_tool_prefix}strip; ac_word=$2\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for $ac_word\" >&5\n$as_echo_n \"checking for $ac_word... \" >&6; }\nif ${ac_cv_prog_STRIP+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  if test -n \"$STRIP\"; then\n  ac_cv_prog_STRIP=\"$STRIP\" # Let the user override the test.\nelse\nas_save_IFS=$IFS; IFS=$PATH_SEPARATOR\nfor as_dir in $PATH\ndo\n  IFS=$as_save_IFS\n  test -z \"$as_dir\" && as_dir=.\n    for ac_exec_ext in '' $ac_executable_extensions; do\n  if as_fn_executable_p \"$as_dir/$ac_word$ac_exec_ext\"; then\n    ac_cv_prog_STRIP=\"${ac_tool_prefix}strip\"\n    $as_echo \"$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext\" >&5\n    break 2\n  fi\ndone\n  done\nIFS=$as_save_IFS\n\nfi\nfi\nSTRIP=$ac_cv_prog_STRIP\nif test -n \"$STRIP\"; then\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: $STRIP\" >&5\n$as_echo \"$STRIP\" >&6; }\nelse\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: no\" >&5\n$as_echo \"no\" >&6; }\nfi\n\n\nfi\nif test -z \"$ac_cv_prog_STRIP\"; then\n  ac_ct_STRIP=$STRIP\n  # Extract the first word of \"strip\", so it can be a program name with args.\nset dummy strip; ac_word=$2\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for $ac_word\" >&5\n$as_echo_n \"checking for $ac_word... \" >&6; }\nif ${ac_cv_prog_ac_ct_STRIP+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  if test -n \"$ac_ct_STRIP\"; then\n  ac_cv_prog_ac_ct_STRIP=\"$ac_ct_STRIP\" # Let the user override the test.\nelse\nas_save_IFS=$IFS; IFS=$PATH_SEPARATOR\nfor as_dir in $PATH\ndo\n  IFS=$as_save_IFS\n  test -z \"$as_dir\" && as_dir=.\n    for ac_exec_ext in '' $ac_executable_extensions; do\n  if as_fn_executable_p \"$as_dir/$ac_word$ac_exec_ext\"; then\n    ac_cv_prog_ac_ct_STRIP=\"strip\"\n    $as_echo \"$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext\" >&5\n    break 2\n  fi\ndone\n  done\nIFS=$as_save_IFS\n\nfi\nfi\nac_ct_STRIP=$ac_cv_prog_ac_ct_STRIP\nif test -n \"$ac_ct_STRIP\"; then\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: $ac_ct_STRIP\" >&5\n$as_echo \"$ac_ct_STRIP\" >&6; }\nelse\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: no\" >&5\n$as_echo \"no\" >&6; }\nfi\n\n  if test \"x$ac_ct_STRIP\" = x; then\n    STRIP=\":\"\n  else\n    case $cross_compiling:$ac_tool_warned in\nyes:)\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet\" >&5\n$as_echo \"$as_me: WARNING: using cross tools not prefixed with host triplet\" >&2;}\nac_tool_warned=yes ;;\nesac\n    STRIP=$ac_ct_STRIP\n  fi\nelse\n  STRIP=\"$ac_cv_prog_STRIP\"\nfi\n\nfi\nINSTALL_STRIP_PROGRAM=\"\\$(install_sh) -c -s\"\n\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for a thread-safe mkdir -p\" >&5\n$as_echo_n \"checking for a thread-safe mkdir -p... \" >&6; }\nif test -z \"$MKDIR_P\"; then\n  if ${ac_cv_path_mkdir+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  as_save_IFS=$IFS; IFS=$PATH_SEPARATOR\nfor as_dir in $PATH$PATH_SEPARATOR/opt/sfw/bin\ndo\n  IFS=$as_save_IFS\n  test -z \"$as_dir\" && as_dir=.\n    for ac_prog in mkdir gmkdir; do\n\t for ac_exec_ext in '' $ac_executable_extensions; do\n\t   as_fn_executable_p \"$as_dir/$ac_prog$ac_exec_ext\" || continue\n\t   case `\"$as_dir/$ac_prog$ac_exec_ext\" --version 2>&1` in #(\n\t     'mkdir (GNU coreutils) '* | \\\n\t     'mkdir (coreutils) '* | \\\n\t     'mkdir (fileutils) '4.1*)\n\t       ac_cv_path_mkdir=$as_dir/$ac_prog$ac_exec_ext\n\t       break 3;;\n\t   esac\n\t done\n       done\n  done\nIFS=$as_save_IFS\n\nfi\n\n  test -d ./--version && rmdir ./--version\n  if test \"${ac_cv_path_mkdir+set}\" = set; then\n    MKDIR_P=\"$ac_cv_path_mkdir -p\"\n  else\n    # As a last resort, use the slow shell script.  Don't cache a\n    # value for MKDIR_P within a source directory, because that will\n    # break other packages using the cache if that directory is\n    # removed, or if the value is a relative name.\n    MKDIR_P=\"$ac_install_sh -d\"\n  fi\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $MKDIR_P\" >&5\n$as_echo \"$MKDIR_P\" >&6; }\n\nfor ac_prog in gawk mawk nawk awk\ndo\n  # Extract the first word of \"$ac_prog\", so it can be a program name with args.\nset dummy $ac_prog; ac_word=$2\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for $ac_word\" >&5\n$as_echo_n \"checking for $ac_word... \" >&6; }\nif ${ac_cv_prog_AWK+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  if test -n \"$AWK\"; then\n  ac_cv_prog_AWK=\"$AWK\" # Let the user override the test.\nelse\nas_save_IFS=$IFS; IFS=$PATH_SEPARATOR\nfor as_dir in $PATH\ndo\n  IFS=$as_save_IFS\n  test -z \"$as_dir\" && as_dir=.\n    for ac_exec_ext in '' $ac_executable_extensions; do\n  if as_fn_executable_p \"$as_dir/$ac_word$ac_exec_ext\"; then\n    ac_cv_prog_AWK=\"$ac_prog\"\n    $as_echo \"$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext\" >&5\n    break 2\n  fi\ndone\n  done\nIFS=$as_save_IFS\n\nfi\nfi\nAWK=$ac_cv_prog_AWK\nif test -n \"$AWK\"; then\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: $AWK\" >&5\n$as_echo \"$AWK\" >&6; }\nelse\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: no\" >&5\n$as_echo \"no\" >&6; }\nfi\n\n\n  test -n \"$AWK\" && break\ndone\n\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking whether ${MAKE-make} sets \\$(MAKE)\" >&5\n$as_echo_n \"checking whether ${MAKE-make} sets \\$(MAKE)... \" >&6; }\nset x ${MAKE-make}\nac_make=`$as_echo \"$2\" | sed 's/+/p/g; s/[^a-zA-Z0-9_]/_/g'`\nif eval \\${ac_cv_prog_make_${ac_make}_set+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  cat >conftest.make <<\\_ACEOF\nSHELL = /bin/sh\nall:\n\t@echo '@@@%%%=$(MAKE)=@@@%%%'\n_ACEOF\n# GNU make sometimes prints \"make[1]: Entering ...\", which would confuse us.\ncase `${MAKE-make} -f conftest.make 2>/dev/null` in\n  *@@@%%%=?*=@@@%%%*)\n    eval ac_cv_prog_make_${ac_make}_set=yes;;\n  *)\n    eval ac_cv_prog_make_${ac_make}_set=no;;\nesac\nrm -f conftest.make\nfi\nif eval test \\$ac_cv_prog_make_${ac_make}_set = yes; then\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: yes\" >&5\n$as_echo \"yes\" >&6; }\n  SET_MAKE=\nelse\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: no\" >&5\n$as_echo \"no\" >&6; }\n  SET_MAKE=\"MAKE=${MAKE-make}\"\nfi\n\nrm -rf .tst 2>/dev/null\nmkdir .tst 2>/dev/null\nif test -d .tst; then\n  am__leading_dot=.\nelse\n  am__leading_dot=_\nfi\nrmdir .tst 2>/dev/null\n\n# Check whether --enable-silent-rules was given.\nif test \"${enable_silent_rules+set}\" = set; then :\n  enableval=$enable_silent_rules;\nfi\n\ncase $enable_silent_rules in # (((\n  yes) AM_DEFAULT_VERBOSITY=0;;\n   no) AM_DEFAULT_VERBOSITY=1;;\n    *) AM_DEFAULT_VERBOSITY=1;;\nesac\nam_make=${MAKE-make}\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking whether $am_make supports nested variables\" >&5\n$as_echo_n \"checking whether $am_make supports nested variables... \" >&6; }\nif ${am_cv_make_support_nested_variables+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  if $as_echo 'TRUE=$(BAR$(V))\nBAR0=false\nBAR1=true\nV=1\nam__doit:\n\t@$(TRUE)\n.PHONY: am__doit' | $am_make -f - >/dev/null 2>&1; then\n  am_cv_make_support_nested_variables=yes\nelse\n  am_cv_make_support_nested_variables=no\nfi\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $am_cv_make_support_nested_variables\" >&5\n$as_echo \"$am_cv_make_support_nested_variables\" >&6; }\nif test $am_cv_make_support_nested_variables = yes; then\n    AM_V='$(V)'\n  AM_DEFAULT_V='$(AM_DEFAULT_VERBOSITY)'\nelse\n  AM_V=$AM_DEFAULT_VERBOSITY\n  AM_DEFAULT_V=$AM_DEFAULT_VERBOSITY\nfi\nAM_BACKSLASH='\\'\n\nif test \"`cd $srcdir && pwd`\" != \"`pwd`\"; then\n  # Use -I$(srcdir) only when $(srcdir) != ., so that make's output\n  # is not polluted with repeated \"-I.\"\n  am__isrc=' -I$(srcdir)'\n  # test to see if srcdir already configured\n  if test -f $srcdir/config.status; then\n    as_fn_error $? \"source directory already configured; run \\\"make distclean\\\" there first\" \"$LINENO\" 5\n  fi\nfi\n\n# test whether we have cygpath\nif test -z \"$CYGPATH_W\"; then\n  if (cygpath --version) >/dev/null 2>/dev/null; then\n    CYGPATH_W='cygpath -w'\n  else\n    CYGPATH_W=echo\n  fi\nfi\n\n\n# Define the identity of the package.\n PACKAGE='openfst'\n VERSION='1.6.9'\n\n\ncat >>confdefs.h <<_ACEOF\n#define PACKAGE \"$PACKAGE\"\n_ACEOF\n\n\ncat >>confdefs.h <<_ACEOF\n#define VERSION \"$VERSION\"\n_ACEOF\n\n# Some tools Automake needs.\n\nACLOCAL=${ACLOCAL-\"${am_missing_run}aclocal-${am__api_version}\"}\n\n\nAUTOCONF=${AUTOCONF-\"${am_missing_run}autoconf\"}\n\n\nAUTOMAKE=${AUTOMAKE-\"${am_missing_run}automake-${am__api_version}\"}\n\n\nAUTOHEADER=${AUTOHEADER-\"${am_missing_run}autoheader\"}\n\n\nMAKEINFO=${MAKEINFO-\"${am_missing_run}makeinfo\"}\n\n# For better backward compatibility.  To be removed once Automake 1.9.x\n# dies out for good.  For more background, see:\n# <http://lists.gnu.org/archive/html/automake/2012-07/msg00001.html>\n# <http://lists.gnu.org/archive/html/automake/2012-07/msg00014.html>\nmkdir_p='$(MKDIR_P)'\n\n# We need awk for the \"check\" target (and possibly the TAP driver).  The\n# system \"awk\" is bad on some platforms.\n# Always define AMTAR for backward compatibility.  Yes, it's still used\n# in the wild :-(  We should find a proper way to deprecate it ...\nAMTAR='$${TAR-tar}'\n\n\n# We'll loop over all known methods to create a tar archive until one works.\n_am_tools='gnutar  pax cpio none'\n\nam__tar='$${TAR-tar} chof - \"$$tardir\"' am__untar='$${TAR-tar} xf -'\n\n\n\n\n\n\n# POSIX will say in a future version that running \"rm -f\" with no argument\n# is OK; and we want to be able to make that assumption in our Makefile\n# recipes.  So use an aggressive probe to check that the usage we want is\n# actually supported \"in the wild\" to an acceptable degree.\n# See automake bug#10828.\n# To make any issue more visible, cause the running configure to be aborted\n# by default if the 'rm' program in use doesn't match our expectations; the\n# user can still override this though.\nif rm -f && rm -fr && rm -rf; then : OK; else\n  cat >&2 <<'END'\nOops!\n\nYour 'rm' program seems unable to run without file operands specified\non the command line, even when the '-f' option is present.  This is contrary\nto the behaviour of most rm programs out there, and not conforming with\nthe upcoming POSIX standard: <http://austingroupbugs.net/view.php?id=542>\n\nPlease tell bug-automake@gnu.org about your system, including the value\nof your $PATH and any error possibly output before this message.  This\ncan help us improve future automake versions.\n\nEND\n  if test x\"$ACCEPT_INFERIOR_RM_PROGRAM\" = x\"yes\"; then\n    echo 'Configuration will proceed anyway, since you have set the' >&2\n    echo 'ACCEPT_INFERIOR_RM_PROGRAM variable to \"yes\"' >&2\n    echo >&2\n  else\n    cat >&2 <<'END'\nAborting the configuration process, to ensure you take notice of the issue.\n\nYou can download and install GNU coreutils to get an 'rm' implementation\nthat behaves properly: <http://www.gnu.org/software/coreutils/>.\n\nIf you want to complete the configuration process using your problematic\n'rm' anyway, export the environment variable ACCEPT_INFERIOR_RM_PROGRAM\nto \"yes\", and re-run configure.\n\nEND\n    as_fn_error $? \"Your 'rm' program is bad, sorry.\" \"$LINENO\" 5\n  fi\nfi\n\nDEPDIR=\"${am__leading_dot}deps\"\n\nac_config_commands=\"$ac_config_commands depfiles\"\n\n\nam_make=${MAKE-make}\ncat > confinc << 'END'\nam__doit:\n\t@echo this is the am__doit target\n.PHONY: am__doit\nEND\n# If we don't find an include directive, just comment out the code.\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for style of include used by $am_make\" >&5\n$as_echo_n \"checking for style of include used by $am_make... \" >&6; }\nam__include=\"#\"\nam__quote=\n_am_result=none\n# First try GNU make style include.\necho \"include confinc\" > confmf\n# Ignore all kinds of additional output from 'make'.\ncase `$am_make -s -f confmf 2> /dev/null` in #(\n*the\\ am__doit\\ target*)\n  am__include=include\n  am__quote=\n  _am_result=GNU\n  ;;\nesac\n# Now try BSD make style include.\nif test \"$am__include\" = \"#\"; then\n   echo '.include \"confinc\"' > confmf\n   case `$am_make -s -f confmf 2> /dev/null` in #(\n   *the\\ am__doit\\ target*)\n     am__include=.include\n     am__quote=\"\\\"\"\n     _am_result=BSD\n     ;;\n   esac\nfi\n\n\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $_am_result\" >&5\n$as_echo \"$_am_result\" >&6; }\nrm -f confinc confmf\n\n# Check whether --enable-dependency-tracking was given.\nif test \"${enable_dependency_tracking+set}\" = set; then :\n  enableval=$enable_dependency_tracking;\nfi\n\nif test \"x$enable_dependency_tracking\" != xno; then\n  am_depcomp=\"$ac_aux_dir/depcomp\"\n  AMDEPBACKSLASH='\\'\n  am__nodep='_no'\nfi\n if test \"x$enable_dependency_tracking\" != xno; then\n  AMDEP_TRUE=\n  AMDEP_FALSE='#'\nelse\n  AMDEP_TRUE='#'\n  AMDEP_FALSE=\nfi\n\n\nac_ext=c\nac_cpp='$CPP $CPPFLAGS'\nac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5'\nac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5'\nac_compiler_gnu=$ac_cv_c_compiler_gnu\nif test -n \"$ac_tool_prefix\"; then\n  # Extract the first word of \"${ac_tool_prefix}gcc\", so it can be a program name with args.\nset dummy ${ac_tool_prefix}gcc; ac_word=$2\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for $ac_word\" >&5\n$as_echo_n \"checking for $ac_word... \" >&6; }\nif ${ac_cv_prog_CC+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  if test -n \"$CC\"; then\n  ac_cv_prog_CC=\"$CC\" # Let the user override the test.\nelse\nas_save_IFS=$IFS; IFS=$PATH_SEPARATOR\nfor as_dir in $PATH\ndo\n  IFS=$as_save_IFS\n  test -z \"$as_dir\" && as_dir=.\n    for ac_exec_ext in '' $ac_executable_extensions; do\n  if as_fn_executable_p \"$as_dir/$ac_word$ac_exec_ext\"; then\n    ac_cv_prog_CC=\"${ac_tool_prefix}gcc\"\n    $as_echo \"$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext\" >&5\n    break 2\n  fi\ndone\n  done\nIFS=$as_save_IFS\n\nfi\nfi\nCC=$ac_cv_prog_CC\nif test -n \"$CC\"; then\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: $CC\" >&5\n$as_echo \"$CC\" >&6; }\nelse\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: no\" >&5\n$as_echo \"no\" >&6; }\nfi\n\n\nfi\nif test -z \"$ac_cv_prog_CC\"; then\n  ac_ct_CC=$CC\n  # Extract the first word of \"gcc\", so it can be a program name with args.\nset dummy gcc; ac_word=$2\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for $ac_word\" >&5\n$as_echo_n \"checking for $ac_word... \" >&6; }\nif ${ac_cv_prog_ac_ct_CC+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  if test -n \"$ac_ct_CC\"; then\n  ac_cv_prog_ac_ct_CC=\"$ac_ct_CC\" # Let the user override the test.\nelse\nas_save_IFS=$IFS; IFS=$PATH_SEPARATOR\nfor as_dir in $PATH\ndo\n  IFS=$as_save_IFS\n  test -z \"$as_dir\" && as_dir=.\n    for ac_exec_ext in '' $ac_executable_extensions; do\n  if as_fn_executable_p \"$as_dir/$ac_word$ac_exec_ext\"; then\n    ac_cv_prog_ac_ct_CC=\"gcc\"\n    $as_echo \"$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext\" >&5\n    break 2\n  fi\ndone\n  done\nIFS=$as_save_IFS\n\nfi\nfi\nac_ct_CC=$ac_cv_prog_ac_ct_CC\nif test -n \"$ac_ct_CC\"; then\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: $ac_ct_CC\" >&5\n$as_echo \"$ac_ct_CC\" >&6; }\nelse\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: no\" >&5\n$as_echo \"no\" >&6; }\nfi\n\n  if test \"x$ac_ct_CC\" = x; then\n    CC=\"\"\n  else\n    case $cross_compiling:$ac_tool_warned in\nyes:)\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet\" >&5\n$as_echo \"$as_me: WARNING: using cross tools not prefixed with host triplet\" >&2;}\nac_tool_warned=yes ;;\nesac\n    CC=$ac_ct_CC\n  fi\nelse\n  CC=\"$ac_cv_prog_CC\"\nfi\n\nif test -z \"$CC\"; then\n          if test -n \"$ac_tool_prefix\"; then\n    # Extract the first word of \"${ac_tool_prefix}cc\", so it can be a program name with args.\nset dummy ${ac_tool_prefix}cc; ac_word=$2\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for $ac_word\" >&5\n$as_echo_n \"checking for $ac_word... \" >&6; }\nif ${ac_cv_prog_CC+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  if test -n \"$CC\"; then\n  ac_cv_prog_CC=\"$CC\" # Let the user override the test.\nelse\nas_save_IFS=$IFS; IFS=$PATH_SEPARATOR\nfor as_dir in $PATH\ndo\n  IFS=$as_save_IFS\n  test -z \"$as_dir\" && as_dir=.\n    for ac_exec_ext in '' $ac_executable_extensions; do\n  if as_fn_executable_p \"$as_dir/$ac_word$ac_exec_ext\"; then\n    ac_cv_prog_CC=\"${ac_tool_prefix}cc\"\n    $as_echo \"$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext\" >&5\n    break 2\n  fi\ndone\n  done\nIFS=$as_save_IFS\n\nfi\nfi\nCC=$ac_cv_prog_CC\nif test -n \"$CC\"; then\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: $CC\" >&5\n$as_echo \"$CC\" >&6; }\nelse\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: no\" >&5\n$as_echo \"no\" >&6; }\nfi\n\n\n  fi\nfi\nif test -z \"$CC\"; then\n  # Extract the first word of \"cc\", so it can be a program name with args.\nset dummy cc; ac_word=$2\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for $ac_word\" >&5\n$as_echo_n \"checking for $ac_word... \" >&6; }\nif ${ac_cv_prog_CC+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  if test -n \"$CC\"; then\n  ac_cv_prog_CC=\"$CC\" # Let the user override the test.\nelse\n  ac_prog_rejected=no\nas_save_IFS=$IFS; IFS=$PATH_SEPARATOR\nfor as_dir in $PATH\ndo\n  IFS=$as_save_IFS\n  test -z \"$as_dir\" && as_dir=.\n    for ac_exec_ext in '' $ac_executable_extensions; do\n  if as_fn_executable_p \"$as_dir/$ac_word$ac_exec_ext\"; then\n    if test \"$as_dir/$ac_word$ac_exec_ext\" = \"/usr/ucb/cc\"; then\n       ac_prog_rejected=yes\n       continue\n     fi\n    ac_cv_prog_CC=\"cc\"\n    $as_echo \"$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext\" >&5\n    break 2\n  fi\ndone\n  done\nIFS=$as_save_IFS\n\nif test $ac_prog_rejected = yes; then\n  # We found a bogon in the path, so make sure we never use it.\n  set dummy $ac_cv_prog_CC\n  shift\n  if test $# != 0; then\n    # We chose a different compiler from the bogus one.\n    # However, it has the same basename, so the bogon will be chosen\n    # first if we set CC to just the basename; use the full file name.\n    shift\n    ac_cv_prog_CC=\"$as_dir/$ac_word${1+' '}$@\"\n  fi\nfi\nfi\nfi\nCC=$ac_cv_prog_CC\nif test -n \"$CC\"; then\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: $CC\" >&5\n$as_echo \"$CC\" >&6; }\nelse\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: no\" >&5\n$as_echo \"no\" >&6; }\nfi\n\n\nfi\nif test -z \"$CC\"; then\n  if test -n \"$ac_tool_prefix\"; then\n  for ac_prog in cl.exe\n  do\n    # Extract the first word of \"$ac_tool_prefix$ac_prog\", so it can be a program name with args.\nset dummy $ac_tool_prefix$ac_prog; ac_word=$2\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for $ac_word\" >&5\n$as_echo_n \"checking for $ac_word... \" >&6; }\nif ${ac_cv_prog_CC+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  if test -n \"$CC\"; then\n  ac_cv_prog_CC=\"$CC\" # Let the user override the test.\nelse\nas_save_IFS=$IFS; IFS=$PATH_SEPARATOR\nfor as_dir in $PATH\ndo\n  IFS=$as_save_IFS\n  test -z \"$as_dir\" && as_dir=.\n    for ac_exec_ext in '' $ac_executable_extensions; do\n  if as_fn_executable_p \"$as_dir/$ac_word$ac_exec_ext\"; then\n    ac_cv_prog_CC=\"$ac_tool_prefix$ac_prog\"\n    $as_echo \"$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext\" >&5\n    break 2\n  fi\ndone\n  done\nIFS=$as_save_IFS\n\nfi\nfi\nCC=$ac_cv_prog_CC\nif test -n \"$CC\"; then\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: $CC\" >&5\n$as_echo \"$CC\" >&6; }\nelse\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: no\" >&5\n$as_echo \"no\" >&6; }\nfi\n\n\n    test -n \"$CC\" && break\n  done\nfi\nif test -z \"$CC\"; then\n  ac_ct_CC=$CC\n  for ac_prog in cl.exe\ndo\n  # Extract the first word of \"$ac_prog\", so it can be a program name with args.\nset dummy $ac_prog; ac_word=$2\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for $ac_word\" >&5\n$as_echo_n \"checking for $ac_word... \" >&6; }\nif ${ac_cv_prog_ac_ct_CC+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  if test -n \"$ac_ct_CC\"; then\n  ac_cv_prog_ac_ct_CC=\"$ac_ct_CC\" # Let the user override the test.\nelse\nas_save_IFS=$IFS; IFS=$PATH_SEPARATOR\nfor as_dir in $PATH\ndo\n  IFS=$as_save_IFS\n  test -z \"$as_dir\" && as_dir=.\n    for ac_exec_ext in '' $ac_executable_extensions; do\n  if as_fn_executable_p \"$as_dir/$ac_word$ac_exec_ext\"; then\n    ac_cv_prog_ac_ct_CC=\"$ac_prog\"\n    $as_echo \"$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext\" >&5\n    break 2\n  fi\ndone\n  done\nIFS=$as_save_IFS\n\nfi\nfi\nac_ct_CC=$ac_cv_prog_ac_ct_CC\nif test -n \"$ac_ct_CC\"; then\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: $ac_ct_CC\" >&5\n$as_echo \"$ac_ct_CC\" >&6; }\nelse\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: no\" >&5\n$as_echo \"no\" >&6; }\nfi\n\n\n  test -n \"$ac_ct_CC\" && break\ndone\n\n  if test \"x$ac_ct_CC\" = x; then\n    CC=\"\"\n  else\n    case $cross_compiling:$ac_tool_warned in\nyes:)\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet\" >&5\n$as_echo \"$as_me: WARNING: using cross tools not prefixed with host triplet\" >&2;}\nac_tool_warned=yes ;;\nesac\n    CC=$ac_ct_CC\n  fi\nfi\n\nfi\n\n\ntest -z \"$CC\" && { { $as_echo \"$as_me:${as_lineno-$LINENO}: error: in \\`$ac_pwd':\" >&5\n$as_echo \"$as_me: error: in \\`$ac_pwd':\" >&2;}\nas_fn_error $? \"no acceptable C compiler found in \\$PATH\nSee \\`config.log' for more details\" \"$LINENO\" 5; }\n\n# Provide some information about the compiler.\n$as_echo \"$as_me:${as_lineno-$LINENO}: checking for C compiler version\" >&5\nset X $ac_compile\nac_compiler=$2\nfor ac_option in --version -v -V -qversion; do\n  { { ac_try=\"$ac_compiler $ac_option >&5\"\ncase \"(($ac_try\" in\n  *\\\"* | *\\`* | *\\\\*) ac_try_echo=\\$ac_try;;\n  *) ac_try_echo=$ac_try;;\nesac\neval ac_try_echo=\"\\\"\\$as_me:${as_lineno-$LINENO}: $ac_try_echo\\\"\"\n$as_echo \"$ac_try_echo\"; } >&5\n  (eval \"$ac_compiler $ac_option >&5\") 2>conftest.err\n  ac_status=$?\n  if test -s conftest.err; then\n    sed '10a\\\n... rest of stderr output deleted ...\n         10q' conftest.err >conftest.er1\n    cat conftest.er1 >&5\n  fi\n  rm -f conftest.er1 conftest.err\n  $as_echo \"$as_me:${as_lineno-$LINENO}: \\$? = $ac_status\" >&5\n  test $ac_status = 0; }\ndone\n\ncat confdefs.h - <<_ACEOF >conftest.$ac_ext\n/* end confdefs.h.  */\n\nint\nmain ()\n{\n\n  ;\n  return 0;\n}\n_ACEOF\nac_clean_files_save=$ac_clean_files\nac_clean_files=\"$ac_clean_files a.out a.out.dSYM a.exe b.out\"\n# Try to create an executable without -o first, disregard a.out.\n# It will help us diagnose broken compilers, and finding out an intuition\n# of exeext.\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking whether the C compiler works\" >&5\n$as_echo_n \"checking whether the C compiler works... \" >&6; }\nac_link_default=`$as_echo \"$ac_link\" | sed 's/ -o *conftest[^ ]*//'`\n\n# The possible output files:\nac_files=\"a.out conftest.exe conftest a.exe a_out.exe b.out conftest.*\"\n\nac_rmfiles=\nfor ac_file in $ac_files\ndo\n  case $ac_file in\n    *.$ac_ext | *.xcoff | *.tds | *.d | *.pdb | *.xSYM | *.bb | *.bbg | *.map | *.inf | *.dSYM | *.o | *.obj ) ;;\n    * ) ac_rmfiles=\"$ac_rmfiles $ac_file\";;\n  esac\ndone\nrm -f $ac_rmfiles\n\nif { { ac_try=\"$ac_link_default\"\ncase \"(($ac_try\" in\n  *\\\"* | *\\`* | *\\\\*) ac_try_echo=\\$ac_try;;\n  *) ac_try_echo=$ac_try;;\nesac\neval ac_try_echo=\"\\\"\\$as_me:${as_lineno-$LINENO}: $ac_try_echo\\\"\"\n$as_echo \"$ac_try_echo\"; } >&5\n  (eval \"$ac_link_default\") 2>&5\n  ac_status=$?\n  $as_echo \"$as_me:${as_lineno-$LINENO}: \\$? = $ac_status\" >&5\n  test $ac_status = 0; }; then :\n  # Autoconf-2.13 could set the ac_cv_exeext variable to `no'.\n# So ignore a value of `no', otherwise this would lead to `EXEEXT = no'\n# in a Makefile.  We should not override ac_cv_exeext if it was cached,\n# so that the user can short-circuit this test for compilers unknown to\n# Autoconf.\nfor ac_file in $ac_files ''\ndo\n  test -f \"$ac_file\" || continue\n  case $ac_file in\n    *.$ac_ext | *.xcoff | *.tds | *.d | *.pdb | *.xSYM | *.bb | *.bbg | *.map | *.inf | *.dSYM | *.o | *.obj )\n\t;;\n    [ab].out )\n\t# We found the default executable, but exeext='' is most\n\t# certainly right.\n\tbreak;;\n    *.* )\n\tif test \"${ac_cv_exeext+set}\" = set && test \"$ac_cv_exeext\" != no;\n\tthen :; else\n\t   ac_cv_exeext=`expr \"$ac_file\" : '[^.]*\\(\\..*\\)'`\n\tfi\n\t# We set ac_cv_exeext here because the later test for it is not\n\t# safe: cross compilers may not add the suffix if given an `-o'\n\t# argument, so we may need to know it at that point already.\n\t# Even if this section looks crufty: it has the advantage of\n\t# actually working.\n\tbreak;;\n    * )\n\tbreak;;\n  esac\ndone\ntest \"$ac_cv_exeext\" = no && ac_cv_exeext=\n\nelse\n  ac_file=''\nfi\nif test -z \"$ac_file\"; then :\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: no\" >&5\n$as_echo \"no\" >&6; }\n$as_echo \"$as_me: failed program was:\" >&5\nsed 's/^/| /' conftest.$ac_ext >&5\n\n{ { $as_echo \"$as_me:${as_lineno-$LINENO}: error: in \\`$ac_pwd':\" >&5\n$as_echo \"$as_me: error: in \\`$ac_pwd':\" >&2;}\nas_fn_error 77 \"C compiler cannot create executables\nSee \\`config.log' for more details\" \"$LINENO\" 5; }\nelse\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: yes\" >&5\n$as_echo \"yes\" >&6; }\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for C compiler default output file name\" >&5\n$as_echo_n \"checking for C compiler default output file name... \" >&6; }\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $ac_file\" >&5\n$as_echo \"$ac_file\" >&6; }\nac_exeext=$ac_cv_exeext\n\nrm -f -r a.out a.out.dSYM a.exe conftest$ac_cv_exeext b.out\nac_clean_files=$ac_clean_files_save\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for suffix of executables\" >&5\n$as_echo_n \"checking for suffix of executables... \" >&6; }\nif { { ac_try=\"$ac_link\"\ncase \"(($ac_try\" in\n  *\\\"* | *\\`* | *\\\\*) ac_try_echo=\\$ac_try;;\n  *) ac_try_echo=$ac_try;;\nesac\neval ac_try_echo=\"\\\"\\$as_me:${as_lineno-$LINENO}: $ac_try_echo\\\"\"\n$as_echo \"$ac_try_echo\"; } >&5\n  (eval \"$ac_link\") 2>&5\n  ac_status=$?\n  $as_echo \"$as_me:${as_lineno-$LINENO}: \\$? = $ac_status\" >&5\n  test $ac_status = 0; }; then :\n  # If both `conftest.exe' and `conftest' are `present' (well, observable)\n# catch `conftest.exe'.  For instance with Cygwin, `ls conftest' will\n# work properly (i.e., refer to `conftest.exe'), while it won't with\n# `rm'.\nfor ac_file in conftest.exe conftest conftest.*; do\n  test -f \"$ac_file\" || continue\n  case $ac_file in\n    *.$ac_ext | *.xcoff | *.tds | *.d | *.pdb | *.xSYM | *.bb | *.bbg | *.map | *.inf | *.dSYM | *.o | *.obj ) ;;\n    *.* ) ac_cv_exeext=`expr \"$ac_file\" : '[^.]*\\(\\..*\\)'`\n\t  break;;\n    * ) break;;\n  esac\ndone\nelse\n  { { $as_echo \"$as_me:${as_lineno-$LINENO}: error: in \\`$ac_pwd':\" >&5\n$as_echo \"$as_me: error: in \\`$ac_pwd':\" >&2;}\nas_fn_error $? \"cannot compute suffix of executables: cannot compile and link\nSee \\`config.log' for more details\" \"$LINENO\" 5; }\nfi\nrm -f conftest conftest$ac_cv_exeext\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $ac_cv_exeext\" >&5\n$as_echo \"$ac_cv_exeext\" >&6; }\n\nrm -f conftest.$ac_ext\nEXEEXT=$ac_cv_exeext\nac_exeext=$EXEEXT\ncat confdefs.h - <<_ACEOF >conftest.$ac_ext\n/* end confdefs.h.  */\n#include <stdio.h>\nint\nmain ()\n{\nFILE *f = fopen (\"conftest.out\", \"w\");\n return ferror (f) || fclose (f) != 0;\n\n  ;\n  return 0;\n}\n_ACEOF\nac_clean_files=\"$ac_clean_files conftest.out\"\n# Check that the compiler produces executables we can run.  If not, either\n# the compiler is broken, or we cross compile.\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking whether we are cross compiling\" >&5\n$as_echo_n \"checking whether we are cross compiling... \" >&6; }\nif test \"$cross_compiling\" != yes; then\n  { { ac_try=\"$ac_link\"\ncase \"(($ac_try\" in\n  *\\\"* | *\\`* | *\\\\*) ac_try_echo=\\$ac_try;;\n  *) ac_try_echo=$ac_try;;\nesac\neval ac_try_echo=\"\\\"\\$as_me:${as_lineno-$LINENO}: $ac_try_echo\\\"\"\n$as_echo \"$ac_try_echo\"; } >&5\n  (eval \"$ac_link\") 2>&5\n  ac_status=$?\n  $as_echo \"$as_me:${as_lineno-$LINENO}: \\$? = $ac_status\" >&5\n  test $ac_status = 0; }\n  if { ac_try='./conftest$ac_cv_exeext'\n  { { case \"(($ac_try\" in\n  *\\\"* | *\\`* | *\\\\*) ac_try_echo=\\$ac_try;;\n  *) ac_try_echo=$ac_try;;\nesac\neval ac_try_echo=\"\\\"\\$as_me:${as_lineno-$LINENO}: $ac_try_echo\\\"\"\n$as_echo \"$ac_try_echo\"; } >&5\n  (eval \"$ac_try\") 2>&5\n  ac_status=$?\n  $as_echo \"$as_me:${as_lineno-$LINENO}: \\$? = $ac_status\" >&5\n  test $ac_status = 0; }; }; then\n    cross_compiling=no\n  else\n    if test \"$cross_compiling\" = maybe; then\n\tcross_compiling=yes\n    else\n\t{ { $as_echo \"$as_me:${as_lineno-$LINENO}: error: in \\`$ac_pwd':\" >&5\n$as_echo \"$as_me: error: in \\`$ac_pwd':\" >&2;}\nas_fn_error $? \"cannot run C compiled programs.\nIf you meant to cross compile, use \\`--host'.\nSee \\`config.log' for more details\" \"$LINENO\" 5; }\n    fi\n  fi\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $cross_compiling\" >&5\n$as_echo \"$cross_compiling\" >&6; }\n\nrm -f conftest.$ac_ext conftest$ac_cv_exeext conftest.out\nac_clean_files=$ac_clean_files_save\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for suffix of object files\" >&5\n$as_echo_n \"checking for suffix of object files... \" >&6; }\nif ${ac_cv_objext+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  cat confdefs.h - <<_ACEOF >conftest.$ac_ext\n/* end confdefs.h.  */\n\nint\nmain ()\n{\n\n  ;\n  return 0;\n}\n_ACEOF\nrm -f conftest.o conftest.obj\nif { { ac_try=\"$ac_compile\"\ncase \"(($ac_try\" in\n  *\\\"* | *\\`* | *\\\\*) ac_try_echo=\\$ac_try;;\n  *) ac_try_echo=$ac_try;;\nesac\neval ac_try_echo=\"\\\"\\$as_me:${as_lineno-$LINENO}: $ac_try_echo\\\"\"\n$as_echo \"$ac_try_echo\"; } >&5\n  (eval \"$ac_compile\") 2>&5\n  ac_status=$?\n  $as_echo \"$as_me:${as_lineno-$LINENO}: \\$? = $ac_status\" >&5\n  test $ac_status = 0; }; then :\n  for ac_file in conftest.o conftest.obj conftest.*; do\n  test -f \"$ac_file\" || continue;\n  case $ac_file in\n    *.$ac_ext | *.xcoff | *.tds | *.d | *.pdb | *.xSYM | *.bb | *.bbg | *.map | *.inf | *.dSYM ) ;;\n    *) ac_cv_objext=`expr \"$ac_file\" : '.*\\.\\(.*\\)'`\n       break;;\n  esac\ndone\nelse\n  $as_echo \"$as_me: failed program was:\" >&5\nsed 's/^/| /' conftest.$ac_ext >&5\n\n{ { $as_echo \"$as_me:${as_lineno-$LINENO}: error: in \\`$ac_pwd':\" >&5\n$as_echo \"$as_me: error: in \\`$ac_pwd':\" >&2;}\nas_fn_error $? \"cannot compute suffix of object files: cannot compile\nSee \\`config.log' for more details\" \"$LINENO\" 5; }\nfi\nrm -f conftest.$ac_cv_objext conftest.$ac_ext\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $ac_cv_objext\" >&5\n$as_echo \"$ac_cv_objext\" >&6; }\nOBJEXT=$ac_cv_objext\nac_objext=$OBJEXT\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking whether we are using the GNU C compiler\" >&5\n$as_echo_n \"checking whether we are using the GNU C compiler... \" >&6; }\nif ${ac_cv_c_compiler_gnu+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  cat confdefs.h - <<_ACEOF >conftest.$ac_ext\n/* end confdefs.h.  */\n\nint\nmain ()\n{\n#ifndef __GNUC__\n       choke me\n#endif\n\n  ;\n  return 0;\n}\n_ACEOF\nif ac_fn_c_try_compile \"$LINENO\"; then :\n  ac_compiler_gnu=yes\nelse\n  ac_compiler_gnu=no\nfi\nrm -f core conftest.err conftest.$ac_objext conftest.$ac_ext\nac_cv_c_compiler_gnu=$ac_compiler_gnu\n\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $ac_cv_c_compiler_gnu\" >&5\n$as_echo \"$ac_cv_c_compiler_gnu\" >&6; }\nif test $ac_compiler_gnu = yes; then\n  GCC=yes\nelse\n  GCC=\nfi\nac_test_CFLAGS=${CFLAGS+set}\nac_save_CFLAGS=$CFLAGS\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking whether $CC accepts -g\" >&5\n$as_echo_n \"checking whether $CC accepts -g... \" >&6; }\nif ${ac_cv_prog_cc_g+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  ac_save_c_werror_flag=$ac_c_werror_flag\n   ac_c_werror_flag=yes\n   ac_cv_prog_cc_g=no\n   CFLAGS=\"-g\"\n   cat confdefs.h - <<_ACEOF >conftest.$ac_ext\n/* end confdefs.h.  */\n\nint\nmain ()\n{\n\n  ;\n  return 0;\n}\n_ACEOF\nif ac_fn_c_try_compile \"$LINENO\"; then :\n  ac_cv_prog_cc_g=yes\nelse\n  CFLAGS=\"\"\n      cat confdefs.h - <<_ACEOF >conftest.$ac_ext\n/* end confdefs.h.  */\n\nint\nmain ()\n{\n\n  ;\n  return 0;\n}\n_ACEOF\nif ac_fn_c_try_compile \"$LINENO\"; then :\n\nelse\n  ac_c_werror_flag=$ac_save_c_werror_flag\n\t CFLAGS=\"-g\"\n\t cat confdefs.h - <<_ACEOF >conftest.$ac_ext\n/* end confdefs.h.  */\n\nint\nmain ()\n{\n\n  ;\n  return 0;\n}\n_ACEOF\nif ac_fn_c_try_compile \"$LINENO\"; then :\n  ac_cv_prog_cc_g=yes\nfi\nrm -f core conftest.err conftest.$ac_objext conftest.$ac_ext\nfi\nrm -f core conftest.err conftest.$ac_objext conftest.$ac_ext\nfi\nrm -f core conftest.err conftest.$ac_objext conftest.$ac_ext\n   ac_c_werror_flag=$ac_save_c_werror_flag\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $ac_cv_prog_cc_g\" >&5\n$as_echo \"$ac_cv_prog_cc_g\" >&6; }\nif test \"$ac_test_CFLAGS\" = set; then\n  CFLAGS=$ac_save_CFLAGS\nelif test $ac_cv_prog_cc_g = yes; then\n  if test \"$GCC\" = yes; then\n    CFLAGS=\"-g -O2\"\n  else\n    CFLAGS=\"-g\"\n  fi\nelse\n  if test \"$GCC\" = yes; then\n    CFLAGS=\"-O2\"\n  else\n    CFLAGS=\n  fi\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for $CC option to accept ISO C89\" >&5\n$as_echo_n \"checking for $CC option to accept ISO C89... \" >&6; }\nif ${ac_cv_prog_cc_c89+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  ac_cv_prog_cc_c89=no\nac_save_CC=$CC\ncat confdefs.h - <<_ACEOF >conftest.$ac_ext\n/* end confdefs.h.  */\n#include <stdarg.h>\n#include <stdio.h>\nstruct stat;\n/* Most of the following tests are stolen from RCS 5.7's src/conf.sh.  */\nstruct buf { int x; };\nFILE * (*rcsopen) (struct buf *, struct stat *, int);\nstatic char *e (p, i)\n     char **p;\n     int i;\n{\n  return p[i];\n}\nstatic char *f (char * (*g) (char **, int), char **p, ...)\n{\n  char *s;\n  va_list v;\n  va_start (v,p);\n  s = g (p, va_arg (v,int));\n  va_end (v);\n  return s;\n}\n\n/* OSF 4.0 Compaq cc is some sort of almost-ANSI by default.  It has\n   function prototypes and stuff, but not '\\xHH' hex character constants.\n   These don't provoke an error unfortunately, instead are silently treated\n   as 'x'.  The following induces an error, until -std is added to get\n   proper ANSI mode.  Curiously '\\x00'!='x' always comes out true, for an\n   array size at least.  It's necessary to write '\\x00'==0 to get something\n   that's true only with -std.  */\nint osf4_cc_array ['\\x00' == 0 ? 1 : -1];\n\n/* IBM C 6 for AIX is almost-ANSI by default, but it replaces macro parameters\n   inside strings and character constants.  */\n#define FOO(x) 'x'\nint xlc6_cc_array[FOO(a) == 'x' ? 1 : -1];\n\nint test (int i, double x);\nstruct s1 {int (*f) (int a);};\nstruct s2 {int (*f) (double a);};\nint pairnames (int, char **, FILE *(*)(struct buf *, struct stat *, int), int, int);\nint argc;\nchar **argv;\nint\nmain ()\n{\nreturn f (e, argv, 0) != argv[0]  ||  f (e, argv, 1) != argv[1];\n  ;\n  return 0;\n}\n_ACEOF\nfor ac_arg in '' -qlanglvl=extc89 -qlanglvl=ansi -std \\\n\t-Ae \"-Aa -D_HPUX_SOURCE\" \"-Xc -D__EXTENSIONS__\"\ndo\n  CC=\"$ac_save_CC $ac_arg\"\n  if ac_fn_c_try_compile \"$LINENO\"; then :\n  ac_cv_prog_cc_c89=$ac_arg\nfi\nrm -f core conftest.err conftest.$ac_objext\n  test \"x$ac_cv_prog_cc_c89\" != \"xno\" && break\ndone\nrm -f conftest.$ac_ext\nCC=$ac_save_CC\n\nfi\n# AC_CACHE_VAL\ncase \"x$ac_cv_prog_cc_c89\" in\n  x)\n    { $as_echo \"$as_me:${as_lineno-$LINENO}: result: none needed\" >&5\n$as_echo \"none needed\" >&6; } ;;\n  xno)\n    { $as_echo \"$as_me:${as_lineno-$LINENO}: result: unsupported\" >&5\n$as_echo \"unsupported\" >&6; } ;;\n  *)\n    CC=\"$CC $ac_cv_prog_cc_c89\"\n    { $as_echo \"$as_me:${as_lineno-$LINENO}: result: $ac_cv_prog_cc_c89\" >&5\n$as_echo \"$ac_cv_prog_cc_c89\" >&6; } ;;\nesac\nif test \"x$ac_cv_prog_cc_c89\" != xno; then :\n\nfi\n\nac_ext=c\nac_cpp='$CPP $CPPFLAGS'\nac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5'\nac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5'\nac_compiler_gnu=$ac_cv_c_compiler_gnu\n\nac_ext=c\nac_cpp='$CPP $CPPFLAGS'\nac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5'\nac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5'\nac_compiler_gnu=$ac_cv_c_compiler_gnu\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking whether $CC understands -c and -o together\" >&5\n$as_echo_n \"checking whether $CC understands -c and -o together... \" >&6; }\nif ${am_cv_prog_cc_c_o+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  cat confdefs.h - <<_ACEOF >conftest.$ac_ext\n/* end confdefs.h.  */\n\nint\nmain ()\n{\n\n  ;\n  return 0;\n}\n_ACEOF\n  # Make sure it works both with $CC and with simple cc.\n  # Following AC_PROG_CC_C_O, we do the test twice because some\n  # compilers refuse to overwrite an existing .o file with -o,\n  # though they will create one.\n  am_cv_prog_cc_c_o=yes\n  for am_i in 1 2; do\n    if { echo \"$as_me:$LINENO: $CC -c conftest.$ac_ext -o conftest2.$ac_objext\" >&5\n   ($CC -c conftest.$ac_ext -o conftest2.$ac_objext) >&5 2>&5\n   ac_status=$?\n   echo \"$as_me:$LINENO: \\$? = $ac_status\" >&5\n   (exit $ac_status); } \\\n         && test -f conftest2.$ac_objext; then\n      : OK\n    else\n      am_cv_prog_cc_c_o=no\n      break\n    fi\n  done\n  rm -f core conftest*\n  unset am_i\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $am_cv_prog_cc_c_o\" >&5\n$as_echo \"$am_cv_prog_cc_c_o\" >&6; }\nif test \"$am_cv_prog_cc_c_o\" != yes; then\n   # Losing compiler, so override with the script.\n   # FIXME: It is wrong to rewrite CC.\n   # But if we don't then we get into trouble of one sort or another.\n   # A longer-term fix would be to have automake use am__CC in this case,\n   # and then we could set am__CC=\"\\$(top_srcdir)/compile \\$(CC)\"\n   CC=\"$am_aux_dir/compile $CC\"\nfi\nac_ext=c\nac_cpp='$CPP $CPPFLAGS'\nac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5'\nac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5'\nac_compiler_gnu=$ac_cv_c_compiler_gnu\n\n\ndepcc=\"$CC\"   am_compiler_list=\n\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking dependency style of $depcc\" >&5\n$as_echo_n \"checking dependency style of $depcc... \" >&6; }\nif ${am_cv_CC_dependencies_compiler_type+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  if test -z \"$AMDEP_TRUE\" && test -f \"$am_depcomp\"; then\n  # We make a subdir and do the tests there.  Otherwise we can end up\n  # making bogus files that we don't know about and never remove.  For\n  # instance it was reported that on HP-UX the gcc test will end up\n  # making a dummy file named 'D' -- because '-MD' means \"put the output\n  # in D\".\n  rm -rf conftest.dir\n  mkdir conftest.dir\n  # Copy depcomp to subdir because otherwise we won't find it if we're\n  # using a relative directory.\n  cp \"$am_depcomp\" conftest.dir\n  cd conftest.dir\n  # We will build objects and dependencies in a subdirectory because\n  # it helps to detect inapplicable dependency modes.  For instance\n  # both Tru64's cc and ICC support -MD to output dependencies as a\n  # side effect of compilation, but ICC will put the dependencies in\n  # the current directory while Tru64 will put them in the object\n  # directory.\n  mkdir sub\n\n  am_cv_CC_dependencies_compiler_type=none\n  if test \"$am_compiler_list\" = \"\"; then\n     am_compiler_list=`sed -n 's/^#*\\([a-zA-Z0-9]*\\))$/\\1/p' < ./depcomp`\n  fi\n  am__universal=false\n  case \" $depcc \" in #(\n     *\\ -arch\\ *\\ -arch\\ *) am__universal=true ;;\n     esac\n\n  for depmode in $am_compiler_list; do\n    # Setup a source with many dependencies, because some compilers\n    # like to wrap large dependency lists on column 80 (with \\), and\n    # we should not choose a depcomp mode which is confused by this.\n    #\n    # We need to recreate these files for each test, as the compiler may\n    # overwrite some of them when testing with obscure command lines.\n    # This happens at least with the AIX C compiler.\n    : > sub/conftest.c\n    for i in 1 2 3 4 5 6; do\n      echo '#include \"conftst'$i'.h\"' >> sub/conftest.c\n      # Using \": > sub/conftst$i.h\" creates only sub/conftst1.h with\n      # Solaris 10 /bin/sh.\n      echo '/* dummy */' > sub/conftst$i.h\n    done\n    echo \"${am__include} ${am__quote}sub/conftest.Po${am__quote}\" > confmf\n\n    # We check with '-c' and '-o' for the sake of the \"dashmstdout\"\n    # mode.  It turns out that the SunPro C++ compiler does not properly\n    # handle '-M -o', and we need to detect this.  Also, some Intel\n    # versions had trouble with output in subdirs.\n    am__obj=sub/conftest.${OBJEXT-o}\n    am__minus_obj=\"-o $am__obj\"\n    case $depmode in\n    gcc)\n      # This depmode causes a compiler race in universal mode.\n      test \"$am__universal\" = false || continue\n      ;;\n    nosideeffect)\n      # After this tag, mechanisms are not by side-effect, so they'll\n      # only be used when explicitly requested.\n      if test \"x$enable_dependency_tracking\" = xyes; then\n\tcontinue\n      else\n\tbreak\n      fi\n      ;;\n    msvc7 | msvc7msys | msvisualcpp | msvcmsys)\n      # This compiler won't grok '-c -o', but also, the minuso test has\n      # not run yet.  These depmodes are late enough in the game, and\n      # so weak that their functioning should not be impacted.\n      am__obj=conftest.${OBJEXT-o}\n      am__minus_obj=\n      ;;\n    none) break ;;\n    esac\n    if depmode=$depmode \\\n       source=sub/conftest.c object=$am__obj \\\n       depfile=sub/conftest.Po tmpdepfile=sub/conftest.TPo \\\n       $SHELL ./depcomp $depcc -c $am__minus_obj sub/conftest.c \\\n         >/dev/null 2>conftest.err &&\n       grep sub/conftst1.h sub/conftest.Po > /dev/null 2>&1 &&\n       grep sub/conftst6.h sub/conftest.Po > /dev/null 2>&1 &&\n       grep $am__obj sub/conftest.Po > /dev/null 2>&1 &&\n       ${MAKE-make} -s -f confmf > /dev/null 2>&1; then\n      # icc doesn't choke on unknown options, it will just issue warnings\n      # or remarks (even with -Werror).  So we grep stderr for any message\n      # that says an option was ignored or not supported.\n      # When given -MP, icc 7.0 and 7.1 complain thusly:\n      #   icc: Command line warning: ignoring option '-M'; no argument required\n      # The diagnosis changed in icc 8.0:\n      #   icc: Command line remark: option '-MP' not supported\n      if (grep 'ignoring option' conftest.err ||\n          grep 'not supported' conftest.err) >/dev/null 2>&1; then :; else\n        am_cv_CC_dependencies_compiler_type=$depmode\n        break\n      fi\n    fi\n  done\n\n  cd ..\n  rm -rf conftest.dir\nelse\n  am_cv_CC_dependencies_compiler_type=none\nfi\n\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $am_cv_CC_dependencies_compiler_type\" >&5\n$as_echo \"$am_cv_CC_dependencies_compiler_type\" >&6; }\nCCDEPMODE=depmode=$am_cv_CC_dependencies_compiler_type\n\n if\n  test \"x$enable_dependency_tracking\" != xno \\\n  && test \"$am_cv_CC_dependencies_compiler_type\" = gcc3; then\n  am__fastdepCC_TRUE=\n  am__fastdepCC_FALSE='#'\nelse\n  am__fastdepCC_TRUE='#'\n  am__fastdepCC_FALSE=\nfi\n\n\n\nif test -n \"$ac_tool_prefix\"; then\n  for ac_prog in ar lib \"link -lib\"\n  do\n    # Extract the first word of \"$ac_tool_prefix$ac_prog\", so it can be a program name with args.\nset dummy $ac_tool_prefix$ac_prog; ac_word=$2\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for $ac_word\" >&5\n$as_echo_n \"checking for $ac_word... \" >&6; }\nif ${ac_cv_prog_AR+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  if test -n \"$AR\"; then\n  ac_cv_prog_AR=\"$AR\" # Let the user override the test.\nelse\nas_save_IFS=$IFS; IFS=$PATH_SEPARATOR\nfor as_dir in $PATH\ndo\n  IFS=$as_save_IFS\n  test -z \"$as_dir\" && as_dir=.\n    for ac_exec_ext in '' $ac_executable_extensions; do\n  if as_fn_executable_p \"$as_dir/$ac_word$ac_exec_ext\"; then\n    ac_cv_prog_AR=\"$ac_tool_prefix$ac_prog\"\n    $as_echo \"$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext\" >&5\n    break 2\n  fi\ndone\n  done\nIFS=$as_save_IFS\n\nfi\nfi\nAR=$ac_cv_prog_AR\nif test -n \"$AR\"; then\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: $AR\" >&5\n$as_echo \"$AR\" >&6; }\nelse\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: no\" >&5\n$as_echo \"no\" >&6; }\nfi\n\n\n    test -n \"$AR\" && break\n  done\nfi\nif test -z \"$AR\"; then\n  ac_ct_AR=$AR\n  for ac_prog in ar lib \"link -lib\"\ndo\n  # Extract the first word of \"$ac_prog\", so it can be a program name with args.\nset dummy $ac_prog; ac_word=$2\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for $ac_word\" >&5\n$as_echo_n \"checking for $ac_word... \" >&6; }\nif ${ac_cv_prog_ac_ct_AR+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  if test -n \"$ac_ct_AR\"; then\n  ac_cv_prog_ac_ct_AR=\"$ac_ct_AR\" # Let the user override the test.\nelse\nas_save_IFS=$IFS; IFS=$PATH_SEPARATOR\nfor as_dir in $PATH\ndo\n  IFS=$as_save_IFS\n  test -z \"$as_dir\" && as_dir=.\n    for ac_exec_ext in '' $ac_executable_extensions; do\n  if as_fn_executable_p \"$as_dir/$ac_word$ac_exec_ext\"; then\n    ac_cv_prog_ac_ct_AR=\"$ac_prog\"\n    $as_echo \"$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext\" >&5\n    break 2\n  fi\ndone\n  done\nIFS=$as_save_IFS\n\nfi\nfi\nac_ct_AR=$ac_cv_prog_ac_ct_AR\nif test -n \"$ac_ct_AR\"; then\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: $ac_ct_AR\" >&5\n$as_echo \"$ac_ct_AR\" >&6; }\nelse\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: no\" >&5\n$as_echo \"no\" >&6; }\nfi\n\n\n  test -n \"$ac_ct_AR\" && break\ndone\n\n  if test \"x$ac_ct_AR\" = x; then\n    AR=\"false\"\n  else\n    case $cross_compiling:$ac_tool_warned in\nyes:)\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet\" >&5\n$as_echo \"$as_me: WARNING: using cross tools not prefixed with host triplet\" >&2;}\nac_tool_warned=yes ;;\nesac\n    AR=$ac_ct_AR\n  fi\nfi\n\n: ${AR=ar}\n\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking the archiver ($AR) interface\" >&5\n$as_echo_n \"checking the archiver ($AR) interface... \" >&6; }\nif ${am_cv_ar_interface+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  ac_ext=c\nac_cpp='$CPP $CPPFLAGS'\nac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5'\nac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5'\nac_compiler_gnu=$ac_cv_c_compiler_gnu\n\n   am_cv_ar_interface=ar\n   cat confdefs.h - <<_ACEOF >conftest.$ac_ext\n/* end confdefs.h.  */\nint some_variable = 0;\n_ACEOF\nif ac_fn_c_try_compile \"$LINENO\"; then :\n  am_ar_try='$AR cru libconftest.a conftest.$ac_objext >&5'\n      { { eval echo \"\\\"\\$as_me\\\":${as_lineno-$LINENO}: \\\"$am_ar_try\\\"\"; } >&5\n  (eval $am_ar_try) 2>&5\n  ac_status=$?\n  $as_echo \"$as_me:${as_lineno-$LINENO}: \\$? = $ac_status\" >&5\n  test $ac_status = 0; }\n      if test \"$ac_status\" -eq 0; then\n        am_cv_ar_interface=ar\n      else\n        am_ar_try='$AR -NOLOGO -OUT:conftest.lib conftest.$ac_objext >&5'\n        { { eval echo \"\\\"\\$as_me\\\":${as_lineno-$LINENO}: \\\"$am_ar_try\\\"\"; } >&5\n  (eval $am_ar_try) 2>&5\n  ac_status=$?\n  $as_echo \"$as_me:${as_lineno-$LINENO}: \\$? = $ac_status\" >&5\n  test $ac_status = 0; }\n        if test \"$ac_status\" -eq 0; then\n          am_cv_ar_interface=lib\n        else\n          am_cv_ar_interface=unknown\n        fi\n      fi\n      rm -f conftest.lib libconftest.a\n\nfi\nrm -f core conftest.err conftest.$ac_objext conftest.$ac_ext\n   ac_ext=c\nac_cpp='$CPP $CPPFLAGS'\nac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5'\nac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5'\nac_compiler_gnu=$ac_cv_c_compiler_gnu\n\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $am_cv_ar_interface\" >&5\n$as_echo \"$am_cv_ar_interface\" >&6; }\n\ncase $am_cv_ar_interface in\nar)\n  ;;\nlib)\n  # Microsoft lib, so override with the ar-lib wrapper script.\n  # FIXME: It is wrong to rewrite AR.\n  # But if we don't then we get into trouble of one sort or another.\n  # A longer-term fix would be to have automake use am__AR in this case,\n  # and then we could set am__AR=\"$am_aux_dir/ar-lib \\$(AR)\" or something\n  # similar.\n  AR=\"$am_aux_dir/ar-lib $AR\"\n  ;;\nunknown)\n  as_fn_error $? \"could not determine $AR interface\" \"$LINENO\" 5\n  ;;\nesac\n\n\n# OpenFst does not throw exceptions, so we do not generate exception handling\n# code. However, users are free to re-enable exception handling.\n# OpenFst assumes char is unsigned; -fsigned-char is likely unsafe.\nCPPFLAGS=\"$CPPFLAGS -fno-exceptions -funsigned-char\"\nCXXFLAGS=\"$CXXFLAGS -std=c++11\"\n\nac_ext=cpp\nac_cpp='$CXXCPP $CPPFLAGS'\nac_compile='$CXX -c $CXXFLAGS $CPPFLAGS conftest.$ac_ext >&5'\nac_link='$CXX -o conftest$ac_exeext $CXXFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5'\nac_compiler_gnu=$ac_cv_cxx_compiler_gnu\nif test -z \"$CXX\"; then\n  if test -n \"$CCC\"; then\n    CXX=$CCC\n  else\n    if test -n \"$ac_tool_prefix\"; then\n  for ac_prog in g++ c++ gpp aCC CC cxx cc++ cl.exe FCC KCC RCC xlC_r xlC\n  do\n    # Extract the first word of \"$ac_tool_prefix$ac_prog\", so it can be a program name with args.\nset dummy $ac_tool_prefix$ac_prog; ac_word=$2\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for $ac_word\" >&5\n$as_echo_n \"checking for $ac_word... \" >&6; }\nif ${ac_cv_prog_CXX+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  if test -n \"$CXX\"; then\n  ac_cv_prog_CXX=\"$CXX\" # Let the user override the test.\nelse\nas_save_IFS=$IFS; IFS=$PATH_SEPARATOR\nfor as_dir in $PATH\ndo\n  IFS=$as_save_IFS\n  test -z \"$as_dir\" && as_dir=.\n    for ac_exec_ext in '' $ac_executable_extensions; do\n  if as_fn_executable_p \"$as_dir/$ac_word$ac_exec_ext\"; then\n    ac_cv_prog_CXX=\"$ac_tool_prefix$ac_prog\"\n    $as_echo \"$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext\" >&5\n    break 2\n  fi\ndone\n  done\nIFS=$as_save_IFS\n\nfi\nfi\nCXX=$ac_cv_prog_CXX\nif test -n \"$CXX\"; then\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: $CXX\" >&5\n$as_echo \"$CXX\" >&6; }\nelse\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: no\" >&5\n$as_echo \"no\" >&6; }\nfi\n\n\n    test -n \"$CXX\" && break\n  done\nfi\nif test -z \"$CXX\"; then\n  ac_ct_CXX=$CXX\n  for ac_prog in g++ c++ gpp aCC CC cxx cc++ cl.exe FCC KCC RCC xlC_r xlC\ndo\n  # Extract the first word of \"$ac_prog\", so it can be a program name with args.\nset dummy $ac_prog; ac_word=$2\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for $ac_word\" >&5\n$as_echo_n \"checking for $ac_word... \" >&6; }\nif ${ac_cv_prog_ac_ct_CXX+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  if test -n \"$ac_ct_CXX\"; then\n  ac_cv_prog_ac_ct_CXX=\"$ac_ct_CXX\" # Let the user override the test.\nelse\nas_save_IFS=$IFS; IFS=$PATH_SEPARATOR\nfor as_dir in $PATH\ndo\n  IFS=$as_save_IFS\n  test -z \"$as_dir\" && as_dir=.\n    for ac_exec_ext in '' $ac_executable_extensions; do\n  if as_fn_executable_p \"$as_dir/$ac_word$ac_exec_ext\"; then\n    ac_cv_prog_ac_ct_CXX=\"$ac_prog\"\n    $as_echo \"$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext\" >&5\n    break 2\n  fi\ndone\n  done\nIFS=$as_save_IFS\n\nfi\nfi\nac_ct_CXX=$ac_cv_prog_ac_ct_CXX\nif test -n \"$ac_ct_CXX\"; then\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: $ac_ct_CXX\" >&5\n$as_echo \"$ac_ct_CXX\" >&6; }\nelse\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: no\" >&5\n$as_echo \"no\" >&6; }\nfi\n\n\n  test -n \"$ac_ct_CXX\" && break\ndone\n\n  if test \"x$ac_ct_CXX\" = x; then\n    CXX=\"g++\"\n  else\n    case $cross_compiling:$ac_tool_warned in\nyes:)\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet\" >&5\n$as_echo \"$as_me: WARNING: using cross tools not prefixed with host triplet\" >&2;}\nac_tool_warned=yes ;;\nesac\n    CXX=$ac_ct_CXX\n  fi\nfi\n\n  fi\nfi\n# Provide some information about the compiler.\n$as_echo \"$as_me:${as_lineno-$LINENO}: checking for C++ compiler version\" >&5\nset X $ac_compile\nac_compiler=$2\nfor ac_option in --version -v -V -qversion; do\n  { { ac_try=\"$ac_compiler $ac_option >&5\"\ncase \"(($ac_try\" in\n  *\\\"* | *\\`* | *\\\\*) ac_try_echo=\\$ac_try;;\n  *) ac_try_echo=$ac_try;;\nesac\neval ac_try_echo=\"\\\"\\$as_me:${as_lineno-$LINENO}: $ac_try_echo\\\"\"\n$as_echo \"$ac_try_echo\"; } >&5\n  (eval \"$ac_compiler $ac_option >&5\") 2>conftest.err\n  ac_status=$?\n  if test -s conftest.err; then\n    sed '10a\\\n... rest of stderr output deleted ...\n         10q' conftest.err >conftest.er1\n    cat conftest.er1 >&5\n  fi\n  rm -f conftest.er1 conftest.err\n  $as_echo \"$as_me:${as_lineno-$LINENO}: \\$? = $ac_status\" >&5\n  test $ac_status = 0; }\ndone\n\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking whether we are using the GNU C++ compiler\" >&5\n$as_echo_n \"checking whether we are using the GNU C++ compiler... \" >&6; }\nif ${ac_cv_cxx_compiler_gnu+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  cat confdefs.h - <<_ACEOF >conftest.$ac_ext\n/* end confdefs.h.  */\n\nint\nmain ()\n{\n#ifndef __GNUC__\n       choke me\n#endif\n\n  ;\n  return 0;\n}\n_ACEOF\nif ac_fn_cxx_try_compile \"$LINENO\"; then :\n  ac_compiler_gnu=yes\nelse\n  ac_compiler_gnu=no\nfi\nrm -f core conftest.err conftest.$ac_objext conftest.$ac_ext\nac_cv_cxx_compiler_gnu=$ac_compiler_gnu\n\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $ac_cv_cxx_compiler_gnu\" >&5\n$as_echo \"$ac_cv_cxx_compiler_gnu\" >&6; }\nif test $ac_compiler_gnu = yes; then\n  GXX=yes\nelse\n  GXX=\nfi\nac_test_CXXFLAGS=${CXXFLAGS+set}\nac_save_CXXFLAGS=$CXXFLAGS\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking whether $CXX accepts -g\" >&5\n$as_echo_n \"checking whether $CXX accepts -g... \" >&6; }\nif ${ac_cv_prog_cxx_g+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  ac_save_cxx_werror_flag=$ac_cxx_werror_flag\n   ac_cxx_werror_flag=yes\n   ac_cv_prog_cxx_g=no\n   CXXFLAGS=\"-g\"\n   cat confdefs.h - <<_ACEOF >conftest.$ac_ext\n/* end confdefs.h.  */\n\nint\nmain ()\n{\n\n  ;\n  return 0;\n}\n_ACEOF\nif ac_fn_cxx_try_compile \"$LINENO\"; then :\n  ac_cv_prog_cxx_g=yes\nelse\n  CXXFLAGS=\"\"\n      cat confdefs.h - <<_ACEOF >conftest.$ac_ext\n/* end confdefs.h.  */\n\nint\nmain ()\n{\n\n  ;\n  return 0;\n}\n_ACEOF\nif ac_fn_cxx_try_compile \"$LINENO\"; then :\n\nelse\n  ac_cxx_werror_flag=$ac_save_cxx_werror_flag\n\t CXXFLAGS=\"-g\"\n\t cat confdefs.h - <<_ACEOF >conftest.$ac_ext\n/* end confdefs.h.  */\n\nint\nmain ()\n{\n\n  ;\n  return 0;\n}\n_ACEOF\nif ac_fn_cxx_try_compile \"$LINENO\"; then :\n  ac_cv_prog_cxx_g=yes\nfi\nrm -f core conftest.err conftest.$ac_objext conftest.$ac_ext\nfi\nrm -f core conftest.err conftest.$ac_objext conftest.$ac_ext\nfi\nrm -f core conftest.err conftest.$ac_objext conftest.$ac_ext\n   ac_cxx_werror_flag=$ac_save_cxx_werror_flag\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $ac_cv_prog_cxx_g\" >&5\n$as_echo \"$ac_cv_prog_cxx_g\" >&6; }\nif test \"$ac_test_CXXFLAGS\" = set; then\n  CXXFLAGS=$ac_save_CXXFLAGS\nelif test $ac_cv_prog_cxx_g = yes; then\n  if test \"$GXX\" = yes; then\n    CXXFLAGS=\"-g -O2\"\n  else\n    CXXFLAGS=\"-g\"\n  fi\nelse\n  if test \"$GXX\" = yes; then\n    CXXFLAGS=\"-O2\"\n  else\n    CXXFLAGS=\n  fi\nfi\nac_ext=c\nac_cpp='$CPP $CPPFLAGS'\nac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5'\nac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5'\nac_compiler_gnu=$ac_cv_c_compiler_gnu\n\ndepcc=\"$CXX\"  am_compiler_list=\n\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking dependency style of $depcc\" >&5\n$as_echo_n \"checking dependency style of $depcc... \" >&6; }\nif ${am_cv_CXX_dependencies_compiler_type+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  if test -z \"$AMDEP_TRUE\" && test -f \"$am_depcomp\"; then\n  # We make a subdir and do the tests there.  Otherwise we can end up\n  # making bogus files that we don't know about and never remove.  For\n  # instance it was reported that on HP-UX the gcc test will end up\n  # making a dummy file named 'D' -- because '-MD' means \"put the output\n  # in D\".\n  rm -rf conftest.dir\n  mkdir conftest.dir\n  # Copy depcomp to subdir because otherwise we won't find it if we're\n  # using a relative directory.\n  cp \"$am_depcomp\" conftest.dir\n  cd conftest.dir\n  # We will build objects and dependencies in a subdirectory because\n  # it helps to detect inapplicable dependency modes.  For instance\n  # both Tru64's cc and ICC support -MD to output dependencies as a\n  # side effect of compilation, but ICC will put the dependencies in\n  # the current directory while Tru64 will put them in the object\n  # directory.\n  mkdir sub\n\n  am_cv_CXX_dependencies_compiler_type=none\n  if test \"$am_compiler_list\" = \"\"; then\n     am_compiler_list=`sed -n 's/^#*\\([a-zA-Z0-9]*\\))$/\\1/p' < ./depcomp`\n  fi\n  am__universal=false\n  case \" $depcc \" in #(\n     *\\ -arch\\ *\\ -arch\\ *) am__universal=true ;;\n     esac\n\n  for depmode in $am_compiler_list; do\n    # Setup a source with many dependencies, because some compilers\n    # like to wrap large dependency lists on column 80 (with \\), and\n    # we should not choose a depcomp mode which is confused by this.\n    #\n    # We need to recreate these files for each test, as the compiler may\n    # overwrite some of them when testing with obscure command lines.\n    # This happens at least with the AIX C compiler.\n    : > sub/conftest.c\n    for i in 1 2 3 4 5 6; do\n      echo '#include \"conftst'$i'.h\"' >> sub/conftest.c\n      # Using \": > sub/conftst$i.h\" creates only sub/conftst1.h with\n      # Solaris 10 /bin/sh.\n      echo '/* dummy */' > sub/conftst$i.h\n    done\n    echo \"${am__include} ${am__quote}sub/conftest.Po${am__quote}\" > confmf\n\n    # We check with '-c' and '-o' for the sake of the \"dashmstdout\"\n    # mode.  It turns out that the SunPro C++ compiler does not properly\n    # handle '-M -o', and we need to detect this.  Also, some Intel\n    # versions had trouble with output in subdirs.\n    am__obj=sub/conftest.${OBJEXT-o}\n    am__minus_obj=\"-o $am__obj\"\n    case $depmode in\n    gcc)\n      # This depmode causes a compiler race in universal mode.\n      test \"$am__universal\" = false || continue\n      ;;\n    nosideeffect)\n      # After this tag, mechanisms are not by side-effect, so they'll\n      # only be used when explicitly requested.\n      if test \"x$enable_dependency_tracking\" = xyes; then\n\tcontinue\n      else\n\tbreak\n      fi\n      ;;\n    msvc7 | msvc7msys | msvisualcpp | msvcmsys)\n      # This compiler won't grok '-c -o', but also, the minuso test has\n      # not run yet.  These depmodes are late enough in the game, and\n      # so weak that their functioning should not be impacted.\n      am__obj=conftest.${OBJEXT-o}\n      am__minus_obj=\n      ;;\n    none) break ;;\n    esac\n    if depmode=$depmode \\\n       source=sub/conftest.c object=$am__obj \\\n       depfile=sub/conftest.Po tmpdepfile=sub/conftest.TPo \\\n       $SHELL ./depcomp $depcc -c $am__minus_obj sub/conftest.c \\\n         >/dev/null 2>conftest.err &&\n       grep sub/conftst1.h sub/conftest.Po > /dev/null 2>&1 &&\n       grep sub/conftst6.h sub/conftest.Po > /dev/null 2>&1 &&\n       grep $am__obj sub/conftest.Po > /dev/null 2>&1 &&\n       ${MAKE-make} -s -f confmf > /dev/null 2>&1; then\n      # icc doesn't choke on unknown options, it will just issue warnings\n      # or remarks (even with -Werror).  So we grep stderr for any message\n      # that says an option was ignored or not supported.\n      # When given -MP, icc 7.0 and 7.1 complain thusly:\n      #   icc: Command line warning: ignoring option '-M'; no argument required\n      # The diagnosis changed in icc 8.0:\n      #   icc: Command line remark: option '-MP' not supported\n      if (grep 'ignoring option' conftest.err ||\n          grep 'not supported' conftest.err) >/dev/null 2>&1; then :; else\n        am_cv_CXX_dependencies_compiler_type=$depmode\n        break\n      fi\n    fi\n  done\n\n  cd ..\n  rm -rf conftest.dir\nelse\n  am_cv_CXX_dependencies_compiler_type=none\nfi\n\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $am_cv_CXX_dependencies_compiler_type\" >&5\n$as_echo \"$am_cv_CXX_dependencies_compiler_type\" >&6; }\nCXXDEPMODE=depmode=$am_cv_CXX_dependencies_compiler_type\n\n if\n  test \"x$enable_dependency_tracking\" != xno \\\n  && test \"$am_cv_CXX_dependencies_compiler_type\" = gcc3; then\n  am__fastdepCXX_TRUE=\n  am__fastdepCXX_FALSE='#'\nelse\n  am__fastdepCXX_TRUE='#'\n  am__fastdepCXX_FALSE=\nfi\n\n\n# Check whether --enable-static was given.\nif test \"${enable_static+set}\" = set; then :\n  enableval=$enable_static; p=${PACKAGE-default}\n    case $enableval in\n    yes) enable_static=yes ;;\n    no) enable_static=no ;;\n    *)\n     enable_static=no\n      # Look at the argument we got.  We use all the common list separators.\n      lt_save_ifs=$IFS; IFS=$IFS$PATH_SEPARATOR,\n      for pkg in $enableval; do\n\tIFS=$lt_save_ifs\n\tif test \"X$pkg\" = \"X$p\"; then\n\t  enable_static=yes\n\tfi\n      done\n      IFS=$lt_save_ifs\n      ;;\n    esac\nelse\n  enable_static=no\nfi\n\n\n\n\n\n\n\n\n\ncase `pwd` in\n  *\\ * | *\\\t*)\n    { $as_echo \"$as_me:${as_lineno-$LINENO}: WARNING: Libtool does not cope well with whitespace in \\`pwd\\`\" >&5\n$as_echo \"$as_me: WARNING: Libtool does not cope well with whitespace in \\`pwd\\`\" >&2;} ;;\nesac\n\n\n\nmacro_version='2.4.6'\nmacro_revision='2.4.6'\n\n\n\n\n\n\n\n\n\n\n\n\n\nltmain=$ac_aux_dir/ltmain.sh\n\n# Make sure we can run config.sub.\n$SHELL \"$ac_aux_dir/config.sub\" sun4 >/dev/null 2>&1 ||\n  as_fn_error $? \"cannot run $SHELL $ac_aux_dir/config.sub\" \"$LINENO\" 5\n\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking build system type\" >&5\n$as_echo_n \"checking build system type... \" >&6; }\nif ${ac_cv_build+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  ac_build_alias=$build_alias\ntest \"x$ac_build_alias\" = x &&\n  ac_build_alias=`$SHELL \"$ac_aux_dir/config.guess\"`\ntest \"x$ac_build_alias\" = x &&\n  as_fn_error $? \"cannot guess build type; you must specify one\" \"$LINENO\" 5\nac_cv_build=`$SHELL \"$ac_aux_dir/config.sub\" $ac_build_alias` ||\n  as_fn_error $? \"$SHELL $ac_aux_dir/config.sub $ac_build_alias failed\" \"$LINENO\" 5\n\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $ac_cv_build\" >&5\n$as_echo \"$ac_cv_build\" >&6; }\ncase $ac_cv_build in\n*-*-*) ;;\n*) as_fn_error $? \"invalid value of canonical build\" \"$LINENO\" 5;;\nesac\nbuild=$ac_cv_build\nac_save_IFS=$IFS; IFS='-'\nset x $ac_cv_build\nshift\nbuild_cpu=$1\nbuild_vendor=$2\nshift; shift\n# Remember, the first character of IFS is used to create $*,\n# except with old shells:\nbuild_os=$*\nIFS=$ac_save_IFS\ncase $build_os in *\\ *) build_os=`echo \"$build_os\" | sed 's/ /-/g'`;; esac\n\n\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking host system type\" >&5\n$as_echo_n \"checking host system type... \" >&6; }\nif ${ac_cv_host+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  if test \"x$host_alias\" = x; then\n  ac_cv_host=$ac_cv_build\nelse\n  ac_cv_host=`$SHELL \"$ac_aux_dir/config.sub\" $host_alias` ||\n    as_fn_error $? \"$SHELL $ac_aux_dir/config.sub $host_alias failed\" \"$LINENO\" 5\nfi\n\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $ac_cv_host\" >&5\n$as_echo \"$ac_cv_host\" >&6; }\ncase $ac_cv_host in\n*-*-*) ;;\n*) as_fn_error $? \"invalid value of canonical host\" \"$LINENO\" 5;;\nesac\nhost=$ac_cv_host\nac_save_IFS=$IFS; IFS='-'\nset x $ac_cv_host\nshift\nhost_cpu=$1\nhost_vendor=$2\nshift; shift\n# Remember, the first character of IFS is used to create $*,\n# except with old shells:\nhost_os=$*\nIFS=$ac_save_IFS\ncase $host_os in *\\ *) host_os=`echo \"$host_os\" | sed 's/ /-/g'`;; esac\n\n\n# Backslashify metacharacters that are still active within\n# double-quoted strings.\nsed_quote_subst='s/\\([\"`$\\\\]\\)/\\\\\\1/g'\n\n# Same as above, but do not quote variable references.\ndouble_quote_subst='s/\\([\"`\\\\]\\)/\\\\\\1/g'\n\n# Sed substitution to delay expansion of an escaped shell variable in a\n# double_quote_subst'ed string.\ndelay_variable_subst='s/\\\\\\\\\\\\\\\\\\\\\\$/\\\\\\\\\\\\$/g'\n\n# Sed substitution to delay expansion of an escaped single quote.\ndelay_single_quote_subst='s/'\\''/'\\'\\\\\\\\\\\\\\'\\''/g'\n\n# Sed substitution to avoid accidental globbing in evaled expressions\nno_glob_subst='s/\\*/\\\\\\*/g'\n\nECHO='\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\'\nECHO=$ECHO$ECHO$ECHO$ECHO$ECHO\nECHO=$ECHO$ECHO$ECHO$ECHO$ECHO$ECHO\n\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking how to print strings\" >&5\n$as_echo_n \"checking how to print strings... \" >&6; }\n# Test print first, because it will be a builtin if present.\nif test \"X`( print -r -- -n ) 2>/dev/null`\" = X-n && \\\n   test \"X`print -r -- $ECHO 2>/dev/null`\" = \"X$ECHO\"; then\n  ECHO='print -r --'\nelif test \"X`printf %s $ECHO 2>/dev/null`\" = \"X$ECHO\"; then\n  ECHO='printf %s\\n'\nelse\n  # Use this function as a fallback that always works.\n  func_fallback_echo ()\n  {\n    eval 'cat <<_LTECHO_EOF\n$1\n_LTECHO_EOF'\n  }\n  ECHO='func_fallback_echo'\nfi\n\n# func_echo_all arg...\n# Invoke $ECHO with all args, space-separated.\nfunc_echo_all ()\n{\n    $ECHO \"\"\n}\n\ncase $ECHO in\n  printf*) { $as_echo \"$as_me:${as_lineno-$LINENO}: result: printf\" >&5\n$as_echo \"printf\" >&6; } ;;\n  print*) { $as_echo \"$as_me:${as_lineno-$LINENO}: result: print -r\" >&5\n$as_echo \"print -r\" >&6; } ;;\n  *) { $as_echo \"$as_me:${as_lineno-$LINENO}: result: cat\" >&5\n$as_echo \"cat\" >&6; } ;;\nesac\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for a sed that does not truncate output\" >&5\n$as_echo_n \"checking for a sed that does not truncate output... \" >&6; }\nif ${ac_cv_path_SED+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n            ac_script=s/aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa/bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb/\n     for ac_i in 1 2 3 4 5 6 7; do\n       ac_script=\"$ac_script$as_nl$ac_script\"\n     done\n     echo \"$ac_script\" 2>/dev/null | sed 99q >conftest.sed\n     { ac_script=; unset ac_script;}\n     if test -z \"$SED\"; then\n  ac_path_SED_found=false\n  # Loop through the user's path and test for each of PROGNAME-LIST\n  as_save_IFS=$IFS; IFS=$PATH_SEPARATOR\nfor as_dir in $PATH\ndo\n  IFS=$as_save_IFS\n  test -z \"$as_dir\" && as_dir=.\n    for ac_prog in sed gsed; do\n    for ac_exec_ext in '' $ac_executable_extensions; do\n      ac_path_SED=\"$as_dir/$ac_prog$ac_exec_ext\"\n      as_fn_executable_p \"$ac_path_SED\" || continue\n# Check for GNU ac_path_SED and select it if it is found.\n  # Check for GNU $ac_path_SED\ncase `\"$ac_path_SED\" --version 2>&1` in\n*GNU*)\n  ac_cv_path_SED=\"$ac_path_SED\" ac_path_SED_found=:;;\n*)\n  ac_count=0\n  $as_echo_n 0123456789 >\"conftest.in\"\n  while :\n  do\n    cat \"conftest.in\" \"conftest.in\" >\"conftest.tmp\"\n    mv \"conftest.tmp\" \"conftest.in\"\n    cp \"conftest.in\" \"conftest.nl\"\n    $as_echo '' >> \"conftest.nl\"\n    \"$ac_path_SED\" -f conftest.sed < \"conftest.nl\" >\"conftest.out\" 2>/dev/null || break\n    diff \"conftest.out\" \"conftest.nl\" >/dev/null 2>&1 || break\n    as_fn_arith $ac_count + 1 && ac_count=$as_val\n    if test $ac_count -gt ${ac_path_SED_max-0}; then\n      # Best one so far, save it but keep looking for a better one\n      ac_cv_path_SED=\"$ac_path_SED\"\n      ac_path_SED_max=$ac_count\n    fi\n    # 10*(2^10) chars as input seems more than enough\n    test $ac_count -gt 10 && break\n  done\n  rm -f conftest.in conftest.tmp conftest.nl conftest.out;;\nesac\n\n      $ac_path_SED_found && break 3\n    done\n  done\n  done\nIFS=$as_save_IFS\n  if test -z \"$ac_cv_path_SED\"; then\n    as_fn_error $? \"no acceptable sed could be found in \\$PATH\" \"$LINENO\" 5\n  fi\nelse\n  ac_cv_path_SED=$SED\nfi\n\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $ac_cv_path_SED\" >&5\n$as_echo \"$ac_cv_path_SED\" >&6; }\n SED=\"$ac_cv_path_SED\"\n  rm -f conftest.sed\n\ntest -z \"$SED\" && SED=sed\nXsed=\"$SED -e 1s/^X//\"\n\n\n\n\n\n\n\n\n\n\n\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for grep that handles long lines and -e\" >&5\n$as_echo_n \"checking for grep that handles long lines and -e... \" >&6; }\nif ${ac_cv_path_GREP+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  if test -z \"$GREP\"; then\n  ac_path_GREP_found=false\n  # Loop through the user's path and test for each of PROGNAME-LIST\n  as_save_IFS=$IFS; IFS=$PATH_SEPARATOR\nfor as_dir in $PATH$PATH_SEPARATOR/usr/xpg4/bin\ndo\n  IFS=$as_save_IFS\n  test -z \"$as_dir\" && as_dir=.\n    for ac_prog in grep ggrep; do\n    for ac_exec_ext in '' $ac_executable_extensions; do\n      ac_path_GREP=\"$as_dir/$ac_prog$ac_exec_ext\"\n      as_fn_executable_p \"$ac_path_GREP\" || continue\n# Check for GNU ac_path_GREP and select it if it is found.\n  # Check for GNU $ac_path_GREP\ncase `\"$ac_path_GREP\" --version 2>&1` in\n*GNU*)\n  ac_cv_path_GREP=\"$ac_path_GREP\" ac_path_GREP_found=:;;\n*)\n  ac_count=0\n  $as_echo_n 0123456789 >\"conftest.in\"\n  while :\n  do\n    cat \"conftest.in\" \"conftest.in\" >\"conftest.tmp\"\n    mv \"conftest.tmp\" \"conftest.in\"\n    cp \"conftest.in\" \"conftest.nl\"\n    $as_echo 'GREP' >> \"conftest.nl\"\n    \"$ac_path_GREP\" -e 'GREP$' -e '-(cannot match)-' < \"conftest.nl\" >\"conftest.out\" 2>/dev/null || break\n    diff \"conftest.out\" \"conftest.nl\" >/dev/null 2>&1 || break\n    as_fn_arith $ac_count + 1 && ac_count=$as_val\n    if test $ac_count -gt ${ac_path_GREP_max-0}; then\n      # Best one so far, save it but keep looking for a better one\n      ac_cv_path_GREP=\"$ac_path_GREP\"\n      ac_path_GREP_max=$ac_count\n    fi\n    # 10*(2^10) chars as input seems more than enough\n    test $ac_count -gt 10 && break\n  done\n  rm -f conftest.in conftest.tmp conftest.nl conftest.out;;\nesac\n\n      $ac_path_GREP_found && break 3\n    done\n  done\n  done\nIFS=$as_save_IFS\n  if test -z \"$ac_cv_path_GREP\"; then\n    as_fn_error $? \"no acceptable grep could be found in $PATH$PATH_SEPARATOR/usr/xpg4/bin\" \"$LINENO\" 5\n  fi\nelse\n  ac_cv_path_GREP=$GREP\nfi\n\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $ac_cv_path_GREP\" >&5\n$as_echo \"$ac_cv_path_GREP\" >&6; }\n GREP=\"$ac_cv_path_GREP\"\n\n\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for egrep\" >&5\n$as_echo_n \"checking for egrep... \" >&6; }\nif ${ac_cv_path_EGREP+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  if echo a | $GREP -E '(a|b)' >/dev/null 2>&1\n   then ac_cv_path_EGREP=\"$GREP -E\"\n   else\n     if test -z \"$EGREP\"; then\n  ac_path_EGREP_found=false\n  # Loop through the user's path and test for each of PROGNAME-LIST\n  as_save_IFS=$IFS; IFS=$PATH_SEPARATOR\nfor as_dir in $PATH$PATH_SEPARATOR/usr/xpg4/bin\ndo\n  IFS=$as_save_IFS\n  test -z \"$as_dir\" && as_dir=.\n    for ac_prog in egrep; do\n    for ac_exec_ext in '' $ac_executable_extensions; do\n      ac_path_EGREP=\"$as_dir/$ac_prog$ac_exec_ext\"\n      as_fn_executable_p \"$ac_path_EGREP\" || continue\n# Check for GNU ac_path_EGREP and select it if it is found.\n  # Check for GNU $ac_path_EGREP\ncase `\"$ac_path_EGREP\" --version 2>&1` in\n*GNU*)\n  ac_cv_path_EGREP=\"$ac_path_EGREP\" ac_path_EGREP_found=:;;\n*)\n  ac_count=0\n  $as_echo_n 0123456789 >\"conftest.in\"\n  while :\n  do\n    cat \"conftest.in\" \"conftest.in\" >\"conftest.tmp\"\n    mv \"conftest.tmp\" \"conftest.in\"\n    cp \"conftest.in\" \"conftest.nl\"\n    $as_echo 'EGREP' >> \"conftest.nl\"\n    \"$ac_path_EGREP\" 'EGREP$' < \"conftest.nl\" >\"conftest.out\" 2>/dev/null || break\n    diff \"conftest.out\" \"conftest.nl\" >/dev/null 2>&1 || break\n    as_fn_arith $ac_count + 1 && ac_count=$as_val\n    if test $ac_count -gt ${ac_path_EGREP_max-0}; then\n      # Best one so far, save it but keep looking for a better one\n      ac_cv_path_EGREP=\"$ac_path_EGREP\"\n      ac_path_EGREP_max=$ac_count\n    fi\n    # 10*(2^10) chars as input seems more than enough\n    test $ac_count -gt 10 && break\n  done\n  rm -f conftest.in conftest.tmp conftest.nl conftest.out;;\nesac\n\n      $ac_path_EGREP_found && break 3\n    done\n  done\n  done\nIFS=$as_save_IFS\n  if test -z \"$ac_cv_path_EGREP\"; then\n    as_fn_error $? \"no acceptable egrep could be found in $PATH$PATH_SEPARATOR/usr/xpg4/bin\" \"$LINENO\" 5\n  fi\nelse\n  ac_cv_path_EGREP=$EGREP\nfi\n\n   fi\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $ac_cv_path_EGREP\" >&5\n$as_echo \"$ac_cv_path_EGREP\" >&6; }\n EGREP=\"$ac_cv_path_EGREP\"\n\n\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for fgrep\" >&5\n$as_echo_n \"checking for fgrep... \" >&6; }\nif ${ac_cv_path_FGREP+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  if echo 'ab*c' | $GREP -F 'ab*c' >/dev/null 2>&1\n   then ac_cv_path_FGREP=\"$GREP -F\"\n   else\n     if test -z \"$FGREP\"; then\n  ac_path_FGREP_found=false\n  # Loop through the user's path and test for each of PROGNAME-LIST\n  as_save_IFS=$IFS; IFS=$PATH_SEPARATOR\nfor as_dir in $PATH$PATH_SEPARATOR/usr/xpg4/bin\ndo\n  IFS=$as_save_IFS\n  test -z \"$as_dir\" && as_dir=.\n    for ac_prog in fgrep; do\n    for ac_exec_ext in '' $ac_executable_extensions; do\n      ac_path_FGREP=\"$as_dir/$ac_prog$ac_exec_ext\"\n      as_fn_executable_p \"$ac_path_FGREP\" || continue\n# Check for GNU ac_path_FGREP and select it if it is found.\n  # Check for GNU $ac_path_FGREP\ncase `\"$ac_path_FGREP\" --version 2>&1` in\n*GNU*)\n  ac_cv_path_FGREP=\"$ac_path_FGREP\" ac_path_FGREP_found=:;;\n*)\n  ac_count=0\n  $as_echo_n 0123456789 >\"conftest.in\"\n  while :\n  do\n    cat \"conftest.in\" \"conftest.in\" >\"conftest.tmp\"\n    mv \"conftest.tmp\" \"conftest.in\"\n    cp \"conftest.in\" \"conftest.nl\"\n    $as_echo 'FGREP' >> \"conftest.nl\"\n    \"$ac_path_FGREP\" FGREP < \"conftest.nl\" >\"conftest.out\" 2>/dev/null || break\n    diff \"conftest.out\" \"conftest.nl\" >/dev/null 2>&1 || break\n    as_fn_arith $ac_count + 1 && ac_count=$as_val\n    if test $ac_count -gt ${ac_path_FGREP_max-0}; then\n      # Best one so far, save it but keep looking for a better one\n      ac_cv_path_FGREP=\"$ac_path_FGREP\"\n      ac_path_FGREP_max=$ac_count\n    fi\n    # 10*(2^10) chars as input seems more than enough\n    test $ac_count -gt 10 && break\n  done\n  rm -f conftest.in conftest.tmp conftest.nl conftest.out;;\nesac\n\n      $ac_path_FGREP_found && break 3\n    done\n  done\n  done\nIFS=$as_save_IFS\n  if test -z \"$ac_cv_path_FGREP\"; then\n    as_fn_error $? \"no acceptable fgrep could be found in $PATH$PATH_SEPARATOR/usr/xpg4/bin\" \"$LINENO\" 5\n  fi\nelse\n  ac_cv_path_FGREP=$FGREP\nfi\n\n   fi\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $ac_cv_path_FGREP\" >&5\n$as_echo \"$ac_cv_path_FGREP\" >&6; }\n FGREP=\"$ac_cv_path_FGREP\"\n\n\ntest -z \"$GREP\" && GREP=grep\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n# Check whether --with-gnu-ld was given.\nif test \"${with_gnu_ld+set}\" = set; then :\n  withval=$with_gnu_ld; test no = \"$withval\" || with_gnu_ld=yes\nelse\n  with_gnu_ld=no\nfi\n\nac_prog=ld\nif test yes = \"$GCC\"; then\n  # Check if gcc -print-prog-name=ld gives a path.\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: checking for ld used by $CC\" >&5\n$as_echo_n \"checking for ld used by $CC... \" >&6; }\n  case $host in\n  *-*-mingw*)\n    # gcc leaves a trailing carriage return, which upsets mingw\n    ac_prog=`($CC -print-prog-name=ld) 2>&5 | tr -d '\\015'` ;;\n  *)\n    ac_prog=`($CC -print-prog-name=ld) 2>&5` ;;\n  esac\n  case $ac_prog in\n    # Accept absolute paths.\n    [\\\\/]* | ?:[\\\\/]*)\n      re_direlt='/[^/][^/]*/\\.\\./'\n      # Canonicalize the pathname of ld\n      ac_prog=`$ECHO \"$ac_prog\"| $SED 's%\\\\\\\\%/%g'`\n      while $ECHO \"$ac_prog\" | $GREP \"$re_direlt\" > /dev/null 2>&1; do\n\tac_prog=`$ECHO $ac_prog| $SED \"s%$re_direlt%/%\"`\n      done\n      test -z \"$LD\" && LD=$ac_prog\n      ;;\n  \"\")\n    # If it fails, then pretend we aren't using GCC.\n    ac_prog=ld\n    ;;\n  *)\n    # If it is relative, then search for the first ld in PATH.\n    with_gnu_ld=unknown\n    ;;\n  esac\nelif test yes = \"$with_gnu_ld\"; then\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: checking for GNU ld\" >&5\n$as_echo_n \"checking for GNU ld... \" >&6; }\nelse\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: checking for non-GNU ld\" >&5\n$as_echo_n \"checking for non-GNU ld... \" >&6; }\nfi\nif ${lt_cv_path_LD+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  if test -z \"$LD\"; then\n  lt_save_ifs=$IFS; IFS=$PATH_SEPARATOR\n  for ac_dir in $PATH; do\n    IFS=$lt_save_ifs\n    test -z \"$ac_dir\" && ac_dir=.\n    if test -f \"$ac_dir/$ac_prog\" || test -f \"$ac_dir/$ac_prog$ac_exeext\"; then\n      lt_cv_path_LD=$ac_dir/$ac_prog\n      # Check to see if the program is GNU ld.  I'd rather use --version,\n      # but apparently some variants of GNU ld only accept -v.\n      # Break only if it was the GNU/non-GNU ld that we prefer.\n      case `\"$lt_cv_path_LD\" -v 2>&1 </dev/null` in\n      *GNU* | *'with BFD'*)\n\ttest no != \"$with_gnu_ld\" && break\n\t;;\n      *)\n\ttest yes != \"$with_gnu_ld\" && break\n\t;;\n      esac\n    fi\n  done\n  IFS=$lt_save_ifs\nelse\n  lt_cv_path_LD=$LD # Let the user override the test with a path.\nfi\nfi\n\nLD=$lt_cv_path_LD\nif test -n \"$LD\"; then\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: $LD\" >&5\n$as_echo \"$LD\" >&6; }\nelse\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: no\" >&5\n$as_echo \"no\" >&6; }\nfi\ntest -z \"$LD\" && as_fn_error $? \"no acceptable ld found in \\$PATH\" \"$LINENO\" 5\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking if the linker ($LD) is GNU ld\" >&5\n$as_echo_n \"checking if the linker ($LD) is GNU ld... \" >&6; }\nif ${lt_cv_prog_gnu_ld+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  # I'd rather use --version here, but apparently some GNU lds only accept -v.\ncase `$LD -v 2>&1 </dev/null` in\n*GNU* | *'with BFD'*)\n  lt_cv_prog_gnu_ld=yes\n  ;;\n*)\n  lt_cv_prog_gnu_ld=no\n  ;;\nesac\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $lt_cv_prog_gnu_ld\" >&5\n$as_echo \"$lt_cv_prog_gnu_ld\" >&6; }\nwith_gnu_ld=$lt_cv_prog_gnu_ld\n\n\n\n\n\n\n\n\n\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for BSD- or MS-compatible name lister (nm)\" >&5\n$as_echo_n \"checking for BSD- or MS-compatible name lister (nm)... \" >&6; }\nif ${lt_cv_path_NM+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  if test -n \"$NM\"; then\n  # Let the user override the test.\n  lt_cv_path_NM=$NM\nelse\n  lt_nm_to_check=${ac_tool_prefix}nm\n  if test -n \"$ac_tool_prefix\" && test \"$build\" = \"$host\"; then\n    lt_nm_to_check=\"$lt_nm_to_check nm\"\n  fi\n  for lt_tmp_nm in $lt_nm_to_check; do\n    lt_save_ifs=$IFS; IFS=$PATH_SEPARATOR\n    for ac_dir in $PATH /usr/ccs/bin/elf /usr/ccs/bin /usr/ucb /bin; do\n      IFS=$lt_save_ifs\n      test -z \"$ac_dir\" && ac_dir=.\n      tmp_nm=$ac_dir/$lt_tmp_nm\n      if test -f \"$tmp_nm\" || test -f \"$tmp_nm$ac_exeext\"; then\n\t# Check to see if the nm accepts a BSD-compat flag.\n\t# Adding the 'sed 1q' prevents false positives on HP-UX, which says:\n\t#   nm: unknown option \"B\" ignored\n\t# Tru64's nm complains that /dev/null is an invalid object file\n\t# MSYS converts /dev/null to NUL, MinGW nm treats NUL as empty\n\tcase $build_os in\n\tmingw*) lt_bad_file=conftest.nm/nofile ;;\n\t*) lt_bad_file=/dev/null ;;\n\tesac\n\tcase `\"$tmp_nm\" -B $lt_bad_file 2>&1 | sed '1q'` in\n\t*$lt_bad_file* | *'Invalid file or object type'*)\n\t  lt_cv_path_NM=\"$tmp_nm -B\"\n\t  break 2\n\t  ;;\n\t*)\n\t  case `\"$tmp_nm\" -p /dev/null 2>&1 | sed '1q'` in\n\t  */dev/null*)\n\t    lt_cv_path_NM=\"$tmp_nm -p\"\n\t    break 2\n\t    ;;\n\t  *)\n\t    lt_cv_path_NM=${lt_cv_path_NM=\"$tmp_nm\"} # keep the first match, but\n\t    continue # so that we can try to find one that supports BSD flags\n\t    ;;\n\t  esac\n\t  ;;\n\tesac\n      fi\n    done\n    IFS=$lt_save_ifs\n  done\n  : ${lt_cv_path_NM=no}\nfi\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $lt_cv_path_NM\" >&5\n$as_echo \"$lt_cv_path_NM\" >&6; }\nif test no != \"$lt_cv_path_NM\"; then\n  NM=$lt_cv_path_NM\nelse\n  # Didn't find any BSD compatible name lister, look for dumpbin.\n  if test -n \"$DUMPBIN\"; then :\n    # Let the user override the test.\n  else\n    if test -n \"$ac_tool_prefix\"; then\n  for ac_prog in dumpbin \"link -dump\"\n  do\n    # Extract the first word of \"$ac_tool_prefix$ac_prog\", so it can be a program name with args.\nset dummy $ac_tool_prefix$ac_prog; ac_word=$2\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for $ac_word\" >&5\n$as_echo_n \"checking for $ac_word... \" >&6; }\nif ${ac_cv_prog_DUMPBIN+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  if test -n \"$DUMPBIN\"; then\n  ac_cv_prog_DUMPBIN=\"$DUMPBIN\" # Let the user override the test.\nelse\nas_save_IFS=$IFS; IFS=$PATH_SEPARATOR\nfor as_dir in $PATH\ndo\n  IFS=$as_save_IFS\n  test -z \"$as_dir\" && as_dir=.\n    for ac_exec_ext in '' $ac_executable_extensions; do\n  if as_fn_executable_p \"$as_dir/$ac_word$ac_exec_ext\"; then\n    ac_cv_prog_DUMPBIN=\"$ac_tool_prefix$ac_prog\"\n    $as_echo \"$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext\" >&5\n    break 2\n  fi\ndone\n  done\nIFS=$as_save_IFS\n\nfi\nfi\nDUMPBIN=$ac_cv_prog_DUMPBIN\nif test -n \"$DUMPBIN\"; then\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: $DUMPBIN\" >&5\n$as_echo \"$DUMPBIN\" >&6; }\nelse\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: no\" >&5\n$as_echo \"no\" >&6; }\nfi\n\n\n    test -n \"$DUMPBIN\" && break\n  done\nfi\nif test -z \"$DUMPBIN\"; then\n  ac_ct_DUMPBIN=$DUMPBIN\n  for ac_prog in dumpbin \"link -dump\"\ndo\n  # Extract the first word of \"$ac_prog\", so it can be a program name with args.\nset dummy $ac_prog; ac_word=$2\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for $ac_word\" >&5\n$as_echo_n \"checking for $ac_word... \" >&6; }\nif ${ac_cv_prog_ac_ct_DUMPBIN+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  if test -n \"$ac_ct_DUMPBIN\"; then\n  ac_cv_prog_ac_ct_DUMPBIN=\"$ac_ct_DUMPBIN\" # Let the user override the test.\nelse\nas_save_IFS=$IFS; IFS=$PATH_SEPARATOR\nfor as_dir in $PATH\ndo\n  IFS=$as_save_IFS\n  test -z \"$as_dir\" && as_dir=.\n    for ac_exec_ext in '' $ac_executable_extensions; do\n  if as_fn_executable_p \"$as_dir/$ac_word$ac_exec_ext\"; then\n    ac_cv_prog_ac_ct_DUMPBIN=\"$ac_prog\"\n    $as_echo \"$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext\" >&5\n    break 2\n  fi\ndone\n  done\nIFS=$as_save_IFS\n\nfi\nfi\nac_ct_DUMPBIN=$ac_cv_prog_ac_ct_DUMPBIN\nif test -n \"$ac_ct_DUMPBIN\"; then\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: $ac_ct_DUMPBIN\" >&5\n$as_echo \"$ac_ct_DUMPBIN\" >&6; }\nelse\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: no\" >&5\n$as_echo \"no\" >&6; }\nfi\n\n\n  test -n \"$ac_ct_DUMPBIN\" && break\ndone\n\n  if test \"x$ac_ct_DUMPBIN\" = x; then\n    DUMPBIN=\":\"\n  else\n    case $cross_compiling:$ac_tool_warned in\nyes:)\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet\" >&5\n$as_echo \"$as_me: WARNING: using cross tools not prefixed with host triplet\" >&2;}\nac_tool_warned=yes ;;\nesac\n    DUMPBIN=$ac_ct_DUMPBIN\n  fi\nfi\n\n    case `$DUMPBIN -symbols -headers /dev/null 2>&1 | sed '1q'` in\n    *COFF*)\n      DUMPBIN=\"$DUMPBIN -symbols -headers\"\n      ;;\n    *)\n      DUMPBIN=:\n      ;;\n    esac\n  fi\n\n  if test : != \"$DUMPBIN\"; then\n    NM=$DUMPBIN\n  fi\nfi\ntest -z \"$NM\" && NM=nm\n\n\n\n\n\n\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking the name lister ($NM) interface\" >&5\n$as_echo_n \"checking the name lister ($NM) interface... \" >&6; }\nif ${lt_cv_nm_interface+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  lt_cv_nm_interface=\"BSD nm\"\n  echo \"int some_variable = 0;\" > conftest.$ac_ext\n  (eval echo \"\\\"\\$as_me:$LINENO: $ac_compile\\\"\" >&5)\n  (eval \"$ac_compile\" 2>conftest.err)\n  cat conftest.err >&5\n  (eval echo \"\\\"\\$as_me:$LINENO: $NM \\\\\\\"conftest.$ac_objext\\\\\\\"\\\"\" >&5)\n  (eval \"$NM \\\"conftest.$ac_objext\\\"\" 2>conftest.err > conftest.out)\n  cat conftest.err >&5\n  (eval echo \"\\\"\\$as_me:$LINENO: output\\\"\" >&5)\n  cat conftest.out >&5\n  if $GREP 'External.*some_variable' conftest.out > /dev/null; then\n    lt_cv_nm_interface=\"MS dumpbin\"\n  fi\n  rm -f conftest*\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $lt_cv_nm_interface\" >&5\n$as_echo \"$lt_cv_nm_interface\" >&6; }\n\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking whether ln -s works\" >&5\n$as_echo_n \"checking whether ln -s works... \" >&6; }\nLN_S=$as_ln_s\nif test \"$LN_S\" = \"ln -s\"; then\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: yes\" >&5\n$as_echo \"yes\" >&6; }\nelse\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: no, using $LN_S\" >&5\n$as_echo \"no, using $LN_S\" >&6; }\nfi\n\n# find the maximum length of command line arguments\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking the maximum length of command line arguments\" >&5\n$as_echo_n \"checking the maximum length of command line arguments... \" >&6; }\nif ${lt_cv_sys_max_cmd_len+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n    i=0\n  teststring=ABCD\n\n  case $build_os in\n  msdosdjgpp*)\n    # On DJGPP, this test can blow up pretty badly due to problems in libc\n    # (any single argument exceeding 2000 bytes causes a buffer overrun\n    # during glob expansion).  Even if it were fixed, the result of this\n    # check would be larger than it should be.\n    lt_cv_sys_max_cmd_len=12288;    # 12K is about right\n    ;;\n\n  gnu*)\n    # Under GNU Hurd, this test is not required because there is\n    # no limit to the length of command line arguments.\n    # Libtool will interpret -1 as no limit whatsoever\n    lt_cv_sys_max_cmd_len=-1;\n    ;;\n\n  cygwin* | mingw* | cegcc*)\n    # On Win9x/ME, this test blows up -- it succeeds, but takes\n    # about 5 minutes as the teststring grows exponentially.\n    # Worse, since 9x/ME are not pre-emptively multitasking,\n    # you end up with a \"frozen\" computer, even though with patience\n    # the test eventually succeeds (with a max line length of 256k).\n    # Instead, let's just punt: use the minimum linelength reported by\n    # all of the supported platforms: 8192 (on NT/2K/XP).\n    lt_cv_sys_max_cmd_len=8192;\n    ;;\n\n  mint*)\n    # On MiNT this can take a long time and run out of memory.\n    lt_cv_sys_max_cmd_len=8192;\n    ;;\n\n  amigaos*)\n    # On AmigaOS with pdksh, this test takes hours, literally.\n    # So we just punt and use a minimum line length of 8192.\n    lt_cv_sys_max_cmd_len=8192;\n    ;;\n\n  bitrig* | darwin* | dragonfly* | freebsd* | netbsd* | openbsd*)\n    # This has been around since 386BSD, at least.  Likely further.\n    if test -x /sbin/sysctl; then\n      lt_cv_sys_max_cmd_len=`/sbin/sysctl -n kern.argmax`\n    elif test -x /usr/sbin/sysctl; then\n      lt_cv_sys_max_cmd_len=`/usr/sbin/sysctl -n kern.argmax`\n    else\n      lt_cv_sys_max_cmd_len=65536\t# usable default for all BSDs\n    fi\n    # And add a safety zone\n    lt_cv_sys_max_cmd_len=`expr $lt_cv_sys_max_cmd_len \\/ 4`\n    lt_cv_sys_max_cmd_len=`expr $lt_cv_sys_max_cmd_len \\* 3`\n    ;;\n\n  interix*)\n    # We know the value 262144 and hardcode it with a safety zone (like BSD)\n    lt_cv_sys_max_cmd_len=196608\n    ;;\n\n  os2*)\n    # The test takes a long time on OS/2.\n    lt_cv_sys_max_cmd_len=8192\n    ;;\n\n  osf*)\n    # Dr. Hans Ekkehard Plesser reports seeing a kernel panic running configure\n    # due to this test when exec_disable_arg_limit is 1 on Tru64. It is not\n    # nice to cause kernel panics so lets avoid the loop below.\n    # First set a reasonable default.\n    lt_cv_sys_max_cmd_len=16384\n    #\n    if test -x /sbin/sysconfig; then\n      case `/sbin/sysconfig -q proc exec_disable_arg_limit` in\n        *1*) lt_cv_sys_max_cmd_len=-1 ;;\n      esac\n    fi\n    ;;\n  sco3.2v5*)\n    lt_cv_sys_max_cmd_len=102400\n    ;;\n  sysv5* | sco5v6* | sysv4.2uw2*)\n    kargmax=`grep ARG_MAX /etc/conf/cf.d/stune 2>/dev/null`\n    if test -n \"$kargmax\"; then\n      lt_cv_sys_max_cmd_len=`echo $kargmax | sed 's/.*[\t ]//'`\n    else\n      lt_cv_sys_max_cmd_len=32768\n    fi\n    ;;\n  *)\n    lt_cv_sys_max_cmd_len=`(getconf ARG_MAX) 2> /dev/null`\n    if test -n \"$lt_cv_sys_max_cmd_len\" && \\\n       test undefined != \"$lt_cv_sys_max_cmd_len\"; then\n      lt_cv_sys_max_cmd_len=`expr $lt_cv_sys_max_cmd_len \\/ 4`\n      lt_cv_sys_max_cmd_len=`expr $lt_cv_sys_max_cmd_len \\* 3`\n    else\n      # Make teststring a little bigger before we do anything with it.\n      # a 1K string should be a reasonable start.\n      for i in 1 2 3 4 5 6 7 8; do\n        teststring=$teststring$teststring\n      done\n      SHELL=${SHELL-${CONFIG_SHELL-/bin/sh}}\n      # If test is not a shell built-in, we'll probably end up computing a\n      # maximum length that is only half of the actual maximum length, but\n      # we can't tell.\n      while { test X`env echo \"$teststring$teststring\" 2>/dev/null` \\\n\t         = \"X$teststring$teststring\"; } >/dev/null 2>&1 &&\n\t      test 17 != \"$i\" # 1/2 MB should be enough\n      do\n        i=`expr $i + 1`\n        teststring=$teststring$teststring\n      done\n      # Only check the string length outside the loop.\n      lt_cv_sys_max_cmd_len=`expr \"X$teststring\" : \".*\" 2>&1`\n      teststring=\n      # Add a significant safety factor because C++ compilers can tack on\n      # massive amounts of additional arguments before passing them to the\n      # linker.  It appears as though 1/2 is a usable value.\n      lt_cv_sys_max_cmd_len=`expr $lt_cv_sys_max_cmd_len \\/ 2`\n    fi\n    ;;\n  esac\n\nfi\n\nif test -n \"$lt_cv_sys_max_cmd_len\"; then\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: $lt_cv_sys_max_cmd_len\" >&5\n$as_echo \"$lt_cv_sys_max_cmd_len\" >&6; }\nelse\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: none\" >&5\n$as_echo \"none\" >&6; }\nfi\nmax_cmd_len=$lt_cv_sys_max_cmd_len\n\n\n\n\n\n\n: ${CP=\"cp -f\"}\n: ${MV=\"mv -f\"}\n: ${RM=\"rm -f\"}\n\nif ( (MAIL=60; unset MAIL) || exit) >/dev/null 2>&1; then\n  lt_unset=unset\nelse\n  lt_unset=false\nfi\n\n\n\n\n\n# test EBCDIC or ASCII\ncase `echo X|tr X '\\101'` in\n A) # ASCII based system\n    # \\n is not interpreted correctly by Solaris 8 /usr/ucb/tr\n  lt_SP2NL='tr \\040 \\012'\n  lt_NL2SP='tr \\015\\012 \\040\\040'\n  ;;\n *) # EBCDIC based system\n  lt_SP2NL='tr \\100 \\n'\n  lt_NL2SP='tr \\r\\n \\100\\100'\n  ;;\nesac\n\n\n\n\n\n\n\n\n\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking how to convert $build file names to $host format\" >&5\n$as_echo_n \"checking how to convert $build file names to $host format... \" >&6; }\nif ${lt_cv_to_host_file_cmd+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  case $host in\n  *-*-mingw* )\n    case $build in\n      *-*-mingw* ) # actually msys\n        lt_cv_to_host_file_cmd=func_convert_file_msys_to_w32\n        ;;\n      *-*-cygwin* )\n        lt_cv_to_host_file_cmd=func_convert_file_cygwin_to_w32\n        ;;\n      * ) # otherwise, assume *nix\n        lt_cv_to_host_file_cmd=func_convert_file_nix_to_w32\n        ;;\n    esac\n    ;;\n  *-*-cygwin* )\n    case $build in\n      *-*-mingw* ) # actually msys\n        lt_cv_to_host_file_cmd=func_convert_file_msys_to_cygwin\n        ;;\n      *-*-cygwin* )\n        lt_cv_to_host_file_cmd=func_convert_file_noop\n        ;;\n      * ) # otherwise, assume *nix\n        lt_cv_to_host_file_cmd=func_convert_file_nix_to_cygwin\n        ;;\n    esac\n    ;;\n  * ) # unhandled hosts (and \"normal\" native builds)\n    lt_cv_to_host_file_cmd=func_convert_file_noop\n    ;;\nesac\n\nfi\n\nto_host_file_cmd=$lt_cv_to_host_file_cmd\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $lt_cv_to_host_file_cmd\" >&5\n$as_echo \"$lt_cv_to_host_file_cmd\" >&6; }\n\n\n\n\n\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking how to convert $build file names to toolchain format\" >&5\n$as_echo_n \"checking how to convert $build file names to toolchain format... \" >&6; }\nif ${lt_cv_to_tool_file_cmd+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  #assume ordinary cross tools, or native build.\nlt_cv_to_tool_file_cmd=func_convert_file_noop\ncase $host in\n  *-*-mingw* )\n    case $build in\n      *-*-mingw* ) # actually msys\n        lt_cv_to_tool_file_cmd=func_convert_file_msys_to_w32\n        ;;\n    esac\n    ;;\nesac\n\nfi\n\nto_tool_file_cmd=$lt_cv_to_tool_file_cmd\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $lt_cv_to_tool_file_cmd\" >&5\n$as_echo \"$lt_cv_to_tool_file_cmd\" >&6; }\n\n\n\n\n\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for $LD option to reload object files\" >&5\n$as_echo_n \"checking for $LD option to reload object files... \" >&6; }\nif ${lt_cv_ld_reload_flag+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  lt_cv_ld_reload_flag='-r'\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $lt_cv_ld_reload_flag\" >&5\n$as_echo \"$lt_cv_ld_reload_flag\" >&6; }\nreload_flag=$lt_cv_ld_reload_flag\ncase $reload_flag in\n\"\" | \" \"*) ;;\n*) reload_flag=\" $reload_flag\" ;;\nesac\nreload_cmds='$LD$reload_flag -o $output$reload_objs'\ncase $host_os in\n  cygwin* | mingw* | pw32* | cegcc*)\n    if test yes != \"$GCC\"; then\n      reload_cmds=false\n    fi\n    ;;\n  darwin*)\n    if test yes = \"$GCC\"; then\n      reload_cmds='$LTCC $LTCFLAGS -nostdlib $wl-r -o $output$reload_objs'\n    else\n      reload_cmds='$LD$reload_flag -o $output$reload_objs'\n    fi\n    ;;\nesac\n\n\n\n\n\n\n\n\n\nif test -n \"$ac_tool_prefix\"; then\n  # Extract the first word of \"${ac_tool_prefix}objdump\", so it can be a program name with args.\nset dummy ${ac_tool_prefix}objdump; ac_word=$2\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for $ac_word\" >&5\n$as_echo_n \"checking for $ac_word... \" >&6; }\nif ${ac_cv_prog_OBJDUMP+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  if test -n \"$OBJDUMP\"; then\n  ac_cv_prog_OBJDUMP=\"$OBJDUMP\" # Let the user override the test.\nelse\nas_save_IFS=$IFS; IFS=$PATH_SEPARATOR\nfor as_dir in $PATH\ndo\n  IFS=$as_save_IFS\n  test -z \"$as_dir\" && as_dir=.\n    for ac_exec_ext in '' $ac_executable_extensions; do\n  if as_fn_executable_p \"$as_dir/$ac_word$ac_exec_ext\"; then\n    ac_cv_prog_OBJDUMP=\"${ac_tool_prefix}objdump\"\n    $as_echo \"$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext\" >&5\n    break 2\n  fi\ndone\n  done\nIFS=$as_save_IFS\n\nfi\nfi\nOBJDUMP=$ac_cv_prog_OBJDUMP\nif test -n \"$OBJDUMP\"; then\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: $OBJDUMP\" >&5\n$as_echo \"$OBJDUMP\" >&6; }\nelse\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: no\" >&5\n$as_echo \"no\" >&6; }\nfi\n\n\nfi\nif test -z \"$ac_cv_prog_OBJDUMP\"; then\n  ac_ct_OBJDUMP=$OBJDUMP\n  # Extract the first word of \"objdump\", so it can be a program name with args.\nset dummy objdump; ac_word=$2\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for $ac_word\" >&5\n$as_echo_n \"checking for $ac_word... \" >&6; }\nif ${ac_cv_prog_ac_ct_OBJDUMP+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  if test -n \"$ac_ct_OBJDUMP\"; then\n  ac_cv_prog_ac_ct_OBJDUMP=\"$ac_ct_OBJDUMP\" # Let the user override the test.\nelse\nas_save_IFS=$IFS; IFS=$PATH_SEPARATOR\nfor as_dir in $PATH\ndo\n  IFS=$as_save_IFS\n  test -z \"$as_dir\" && as_dir=.\n    for ac_exec_ext in '' $ac_executable_extensions; do\n  if as_fn_executable_p \"$as_dir/$ac_word$ac_exec_ext\"; then\n    ac_cv_prog_ac_ct_OBJDUMP=\"objdump\"\n    $as_echo \"$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext\" >&5\n    break 2\n  fi\ndone\n  done\nIFS=$as_save_IFS\n\nfi\nfi\nac_ct_OBJDUMP=$ac_cv_prog_ac_ct_OBJDUMP\nif test -n \"$ac_ct_OBJDUMP\"; then\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: $ac_ct_OBJDUMP\" >&5\n$as_echo \"$ac_ct_OBJDUMP\" >&6; }\nelse\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: no\" >&5\n$as_echo \"no\" >&6; }\nfi\n\n  if test \"x$ac_ct_OBJDUMP\" = x; then\n    OBJDUMP=\"false\"\n  else\n    case $cross_compiling:$ac_tool_warned in\nyes:)\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet\" >&5\n$as_echo \"$as_me: WARNING: using cross tools not prefixed with host triplet\" >&2;}\nac_tool_warned=yes ;;\nesac\n    OBJDUMP=$ac_ct_OBJDUMP\n  fi\nelse\n  OBJDUMP=\"$ac_cv_prog_OBJDUMP\"\nfi\n\ntest -z \"$OBJDUMP\" && OBJDUMP=objdump\n\n\n\n\n\n\n\n\n\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking how to recognize dependent libraries\" >&5\n$as_echo_n \"checking how to recognize dependent libraries... \" >&6; }\nif ${lt_cv_deplibs_check_method+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  lt_cv_file_magic_cmd='$MAGIC_CMD'\nlt_cv_file_magic_test_file=\nlt_cv_deplibs_check_method='unknown'\n# Need to set the preceding variable on all platforms that support\n# interlibrary dependencies.\n# 'none' -- dependencies not supported.\n# 'unknown' -- same as none, but documents that we really don't know.\n# 'pass_all' -- all dependencies passed with no checks.\n# 'test_compile' -- check by making test program.\n# 'file_magic [[regex]]' -- check by looking for files in library path\n# that responds to the $file_magic_cmd with a given extended regex.\n# If you have 'file' or equivalent on your system and you're not sure\n# whether 'pass_all' will *always* work, you probably want this one.\n\ncase $host_os in\naix[4-9]*)\n  lt_cv_deplibs_check_method=pass_all\n  ;;\n\nbeos*)\n  lt_cv_deplibs_check_method=pass_all\n  ;;\n\nbsdi[45]*)\n  lt_cv_deplibs_check_method='file_magic ELF [0-9][0-9]*-bit [ML]SB (shared object|dynamic lib)'\n  lt_cv_file_magic_cmd='/usr/bin/file -L'\n  lt_cv_file_magic_test_file=/shlib/libc.so\n  ;;\n\ncygwin*)\n  # func_win32_libid is a shell function defined in ltmain.sh\n  lt_cv_deplibs_check_method='file_magic ^x86 archive import|^x86 DLL'\n  lt_cv_file_magic_cmd='func_win32_libid'\n  ;;\n\nmingw* | pw32*)\n  # Base MSYS/MinGW do not provide the 'file' command needed by\n  # func_win32_libid shell function, so use a weaker test based on 'objdump',\n  # unless we find 'file', for example because we are cross-compiling.\n  if ( file / ) >/dev/null 2>&1; then\n    lt_cv_deplibs_check_method='file_magic ^x86 archive import|^x86 DLL'\n    lt_cv_file_magic_cmd='func_win32_libid'\n  else\n    # Keep this pattern in sync with the one in func_win32_libid.\n    lt_cv_deplibs_check_method='file_magic file format (pei*-i386(.*architecture: i386)?|pe-arm-wince|pe-x86-64)'\n    lt_cv_file_magic_cmd='$OBJDUMP -f'\n  fi\n  ;;\n\ncegcc*)\n  # use the weaker test based on 'objdump'. See mingw*.\n  lt_cv_deplibs_check_method='file_magic file format pe-arm-.*little(.*architecture: arm)?'\n  lt_cv_file_magic_cmd='$OBJDUMP -f'\n  ;;\n\ndarwin* | rhapsody*)\n  lt_cv_deplibs_check_method=pass_all\n  ;;\n\nfreebsd* | dragonfly*)\n  if echo __ELF__ | $CC -E - | $GREP __ELF__ > /dev/null; then\n    case $host_cpu in\n    i*86 )\n      # Not sure whether the presence of OpenBSD here was a mistake.\n      # Let's accept both of them until this is cleared up.\n      lt_cv_deplibs_check_method='file_magic (FreeBSD|OpenBSD|DragonFly)/i[3-9]86 (compact )?demand paged shared library'\n      lt_cv_file_magic_cmd=/usr/bin/file\n      lt_cv_file_magic_test_file=`echo /usr/lib/libc.so.*`\n      ;;\n    esac\n  else\n    lt_cv_deplibs_check_method=pass_all\n  fi\n  ;;\n\nhaiku*)\n  lt_cv_deplibs_check_method=pass_all\n  ;;\n\nhpux10.20* | hpux11*)\n  lt_cv_file_magic_cmd=/usr/bin/file\n  case $host_cpu in\n  ia64*)\n    lt_cv_deplibs_check_method='file_magic (s[0-9][0-9][0-9]|ELF-[0-9][0-9]) shared object file - IA64'\n    lt_cv_file_magic_test_file=/usr/lib/hpux32/libc.so\n    ;;\n  hppa*64*)\n    lt_cv_deplibs_check_method='file_magic (s[0-9][0-9][0-9]|ELF[ -][0-9][0-9])(-bit)?( [LM]SB)? shared object( file)?[, -]* PA-RISC [0-9]\\.[0-9]'\n    lt_cv_file_magic_test_file=/usr/lib/pa20_64/libc.sl\n    ;;\n  *)\n    lt_cv_deplibs_check_method='file_magic (s[0-9][0-9][0-9]|PA-RISC[0-9]\\.[0-9]) shared library'\n    lt_cv_file_magic_test_file=/usr/lib/libc.sl\n    ;;\n  esac\n  ;;\n\ninterix[3-9]*)\n  # PIC code is broken on Interix 3.x, that's why |\\.a not |_pic\\.a here\n  lt_cv_deplibs_check_method='match_pattern /lib[^/]+(\\.so|\\.a)$'\n  ;;\n\nirix5* | irix6* | nonstopux*)\n  case $LD in\n  *-32|*\"-32 \") libmagic=32-bit;;\n  *-n32|*\"-n32 \") libmagic=N32;;\n  *-64|*\"-64 \") libmagic=64-bit;;\n  *) libmagic=never-match;;\n  esac\n  lt_cv_deplibs_check_method=pass_all\n  ;;\n\n# This must be glibc/ELF.\nlinux* | k*bsd*-gnu | kopensolaris*-gnu | gnu*)\n  lt_cv_deplibs_check_method=pass_all\n  ;;\n\nnetbsd* | netbsdelf*-gnu)\n  if echo __ELF__ | $CC -E - | $GREP __ELF__ > /dev/null; then\n    lt_cv_deplibs_check_method='match_pattern /lib[^/]+(\\.so\\.[0-9]+\\.[0-9]+|_pic\\.a)$'\n  else\n    lt_cv_deplibs_check_method='match_pattern /lib[^/]+(\\.so|_pic\\.a)$'\n  fi\n  ;;\n\nnewos6*)\n  lt_cv_deplibs_check_method='file_magic ELF [0-9][0-9]*-bit [ML]SB (executable|dynamic lib)'\n  lt_cv_file_magic_cmd=/usr/bin/file\n  lt_cv_file_magic_test_file=/usr/lib/libnls.so\n  ;;\n\n*nto* | *qnx*)\n  lt_cv_deplibs_check_method=pass_all\n  ;;\n\nopenbsd* | bitrig*)\n  if test -z \"`echo __ELF__ | $CC -E - | $GREP __ELF__`\"; then\n    lt_cv_deplibs_check_method='match_pattern /lib[^/]+(\\.so\\.[0-9]+\\.[0-9]+|\\.so|_pic\\.a)$'\n  else\n    lt_cv_deplibs_check_method='match_pattern /lib[^/]+(\\.so\\.[0-9]+\\.[0-9]+|_pic\\.a)$'\n  fi\n  ;;\n\nosf3* | osf4* | osf5*)\n  lt_cv_deplibs_check_method=pass_all\n  ;;\n\nrdos*)\n  lt_cv_deplibs_check_method=pass_all\n  ;;\n\nsolaris*)\n  lt_cv_deplibs_check_method=pass_all\n  ;;\n\nsysv5* | sco3.2v5* | sco5v6* | unixware* | OpenUNIX* | sysv4*uw2*)\n  lt_cv_deplibs_check_method=pass_all\n  ;;\n\nsysv4 | sysv4.3*)\n  case $host_vendor in\n  motorola)\n    lt_cv_deplibs_check_method='file_magic ELF [0-9][0-9]*-bit [ML]SB (shared object|dynamic lib) M[0-9][0-9]* Version [0-9]'\n    lt_cv_file_magic_test_file=`echo /usr/lib/libc.so*`\n    ;;\n  ncr)\n    lt_cv_deplibs_check_method=pass_all\n    ;;\n  sequent)\n    lt_cv_file_magic_cmd='/bin/file'\n    lt_cv_deplibs_check_method='file_magic ELF [0-9][0-9]*-bit [LM]SB (shared object|dynamic lib )'\n    ;;\n  sni)\n    lt_cv_file_magic_cmd='/bin/file'\n    lt_cv_deplibs_check_method=\"file_magic ELF [0-9][0-9]*-bit [LM]SB dynamic lib\"\n    lt_cv_file_magic_test_file=/lib/libc.so\n    ;;\n  siemens)\n    lt_cv_deplibs_check_method=pass_all\n    ;;\n  pc)\n    lt_cv_deplibs_check_method=pass_all\n    ;;\n  esac\n  ;;\n\ntpf*)\n  lt_cv_deplibs_check_method=pass_all\n  ;;\nos2*)\n  lt_cv_deplibs_check_method=pass_all\n  ;;\nesac\n\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $lt_cv_deplibs_check_method\" >&5\n$as_echo \"$lt_cv_deplibs_check_method\" >&6; }\n\nfile_magic_glob=\nwant_nocaseglob=no\nif test \"$build\" = \"$host\"; then\n  case $host_os in\n  mingw* | pw32*)\n    if ( shopt | grep nocaseglob ) >/dev/null 2>&1; then\n      want_nocaseglob=yes\n    else\n      file_magic_glob=`echo aAbBcCdDeEfFgGhHiIjJkKlLmMnNoOpPqQrRsStTuUvVwWxXyYzZ | $SED -e \"s/\\(..\\)/s\\/[\\1]\\/[\\1]\\/g;/g\"`\n    fi\n    ;;\n  esac\nfi\n\nfile_magic_cmd=$lt_cv_file_magic_cmd\ndeplibs_check_method=$lt_cv_deplibs_check_method\ntest -z \"$deplibs_check_method\" && deplibs_check_method=unknown\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\nif test -n \"$ac_tool_prefix\"; then\n  # Extract the first word of \"${ac_tool_prefix}dlltool\", so it can be a program name with args.\nset dummy ${ac_tool_prefix}dlltool; ac_word=$2\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for $ac_word\" >&5\n$as_echo_n \"checking for $ac_word... \" >&6; }\nif ${ac_cv_prog_DLLTOOL+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  if test -n \"$DLLTOOL\"; then\n  ac_cv_prog_DLLTOOL=\"$DLLTOOL\" # Let the user override the test.\nelse\nas_save_IFS=$IFS; IFS=$PATH_SEPARATOR\nfor as_dir in $PATH\ndo\n  IFS=$as_save_IFS\n  test -z \"$as_dir\" && as_dir=.\n    for ac_exec_ext in '' $ac_executable_extensions; do\n  if as_fn_executable_p \"$as_dir/$ac_word$ac_exec_ext\"; then\n    ac_cv_prog_DLLTOOL=\"${ac_tool_prefix}dlltool\"\n    $as_echo \"$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext\" >&5\n    break 2\n  fi\ndone\n  done\nIFS=$as_save_IFS\n\nfi\nfi\nDLLTOOL=$ac_cv_prog_DLLTOOL\nif test -n \"$DLLTOOL\"; then\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: $DLLTOOL\" >&5\n$as_echo \"$DLLTOOL\" >&6; }\nelse\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: no\" >&5\n$as_echo \"no\" >&6; }\nfi\n\n\nfi\nif test -z \"$ac_cv_prog_DLLTOOL\"; then\n  ac_ct_DLLTOOL=$DLLTOOL\n  # Extract the first word of \"dlltool\", so it can be a program name with args.\nset dummy dlltool; ac_word=$2\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for $ac_word\" >&5\n$as_echo_n \"checking for $ac_word... \" >&6; }\nif ${ac_cv_prog_ac_ct_DLLTOOL+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  if test -n \"$ac_ct_DLLTOOL\"; then\n  ac_cv_prog_ac_ct_DLLTOOL=\"$ac_ct_DLLTOOL\" # Let the user override the test.\nelse\nas_save_IFS=$IFS; IFS=$PATH_SEPARATOR\nfor as_dir in $PATH\ndo\n  IFS=$as_save_IFS\n  test -z \"$as_dir\" && as_dir=.\n    for ac_exec_ext in '' $ac_executable_extensions; do\n  if as_fn_executable_p \"$as_dir/$ac_word$ac_exec_ext\"; then\n    ac_cv_prog_ac_ct_DLLTOOL=\"dlltool\"\n    $as_echo \"$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext\" >&5\n    break 2\n  fi\ndone\n  done\nIFS=$as_save_IFS\n\nfi\nfi\nac_ct_DLLTOOL=$ac_cv_prog_ac_ct_DLLTOOL\nif test -n \"$ac_ct_DLLTOOL\"; then\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: $ac_ct_DLLTOOL\" >&5\n$as_echo \"$ac_ct_DLLTOOL\" >&6; }\nelse\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: no\" >&5\n$as_echo \"no\" >&6; }\nfi\n\n  if test \"x$ac_ct_DLLTOOL\" = x; then\n    DLLTOOL=\"false\"\n  else\n    case $cross_compiling:$ac_tool_warned in\nyes:)\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet\" >&5\n$as_echo \"$as_me: WARNING: using cross tools not prefixed with host triplet\" >&2;}\nac_tool_warned=yes ;;\nesac\n    DLLTOOL=$ac_ct_DLLTOOL\n  fi\nelse\n  DLLTOOL=\"$ac_cv_prog_DLLTOOL\"\nfi\n\ntest -z \"$DLLTOOL\" && DLLTOOL=dlltool\n\n\n\n\n\n\n\n\n\n\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking how to associate runtime and link libraries\" >&5\n$as_echo_n \"checking how to associate runtime and link libraries... \" >&6; }\nif ${lt_cv_sharedlib_from_linklib_cmd+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  lt_cv_sharedlib_from_linklib_cmd='unknown'\n\ncase $host_os in\ncygwin* | mingw* | pw32* | cegcc*)\n  # two different shell functions defined in ltmain.sh;\n  # decide which one to use based on capabilities of $DLLTOOL\n  case `$DLLTOOL --help 2>&1` in\n  *--identify-strict*)\n    lt_cv_sharedlib_from_linklib_cmd=func_cygming_dll_for_implib\n    ;;\n  *)\n    lt_cv_sharedlib_from_linklib_cmd=func_cygming_dll_for_implib_fallback\n    ;;\n  esac\n  ;;\n*)\n  # fallback: assume linklib IS sharedlib\n  lt_cv_sharedlib_from_linklib_cmd=$ECHO\n  ;;\nesac\n\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $lt_cv_sharedlib_from_linklib_cmd\" >&5\n$as_echo \"$lt_cv_sharedlib_from_linklib_cmd\" >&6; }\nsharedlib_from_linklib_cmd=$lt_cv_sharedlib_from_linklib_cmd\ntest -z \"$sharedlib_from_linklib_cmd\" && sharedlib_from_linklib_cmd=$ECHO\n\n\n\n\n\n\n\nif test -n \"$ac_tool_prefix\"; then\n  for ac_prog in ar\n  do\n    # Extract the first word of \"$ac_tool_prefix$ac_prog\", so it can be a program name with args.\nset dummy $ac_tool_prefix$ac_prog; ac_word=$2\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for $ac_word\" >&5\n$as_echo_n \"checking for $ac_word... \" >&6; }\nif ${ac_cv_prog_AR+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  if test -n \"$AR\"; then\n  ac_cv_prog_AR=\"$AR\" # Let the user override the test.\nelse\nas_save_IFS=$IFS; IFS=$PATH_SEPARATOR\nfor as_dir in $PATH\ndo\n  IFS=$as_save_IFS\n  test -z \"$as_dir\" && as_dir=.\n    for ac_exec_ext in '' $ac_executable_extensions; do\n  if as_fn_executable_p \"$as_dir/$ac_word$ac_exec_ext\"; then\n    ac_cv_prog_AR=\"$ac_tool_prefix$ac_prog\"\n    $as_echo \"$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext\" >&5\n    break 2\n  fi\ndone\n  done\nIFS=$as_save_IFS\n\nfi\nfi\nAR=$ac_cv_prog_AR\nif test -n \"$AR\"; then\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: $AR\" >&5\n$as_echo \"$AR\" >&6; }\nelse\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: no\" >&5\n$as_echo \"no\" >&6; }\nfi\n\n\n    test -n \"$AR\" && break\n  done\nfi\nif test -z \"$AR\"; then\n  ac_ct_AR=$AR\n  for ac_prog in ar\ndo\n  # Extract the first word of \"$ac_prog\", so it can be a program name with args.\nset dummy $ac_prog; ac_word=$2\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for $ac_word\" >&5\n$as_echo_n \"checking for $ac_word... \" >&6; }\nif ${ac_cv_prog_ac_ct_AR+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  if test -n \"$ac_ct_AR\"; then\n  ac_cv_prog_ac_ct_AR=\"$ac_ct_AR\" # Let the user override the test.\nelse\nas_save_IFS=$IFS; IFS=$PATH_SEPARATOR\nfor as_dir in $PATH\ndo\n  IFS=$as_save_IFS\n  test -z \"$as_dir\" && as_dir=.\n    for ac_exec_ext in '' $ac_executable_extensions; do\n  if as_fn_executable_p \"$as_dir/$ac_word$ac_exec_ext\"; then\n    ac_cv_prog_ac_ct_AR=\"$ac_prog\"\n    $as_echo \"$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext\" >&5\n    break 2\n  fi\ndone\n  done\nIFS=$as_save_IFS\n\nfi\nfi\nac_ct_AR=$ac_cv_prog_ac_ct_AR\nif test -n \"$ac_ct_AR\"; then\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: $ac_ct_AR\" >&5\n$as_echo \"$ac_ct_AR\" >&6; }\nelse\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: no\" >&5\n$as_echo \"no\" >&6; }\nfi\n\n\n  test -n \"$ac_ct_AR\" && break\ndone\n\n  if test \"x$ac_ct_AR\" = x; then\n    AR=\"false\"\n  else\n    case $cross_compiling:$ac_tool_warned in\nyes:)\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet\" >&5\n$as_echo \"$as_me: WARNING: using cross tools not prefixed with host triplet\" >&2;}\nac_tool_warned=yes ;;\nesac\n    AR=$ac_ct_AR\n  fi\nfi\n\n: ${AR=ar}\n: ${AR_FLAGS=cru}\n\n\n\n\n\n\n\n\n\n\n\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for archiver @FILE support\" >&5\n$as_echo_n \"checking for archiver @FILE support... \" >&6; }\nif ${lt_cv_ar_at_file+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  lt_cv_ar_at_file=no\n   cat confdefs.h - <<_ACEOF >conftest.$ac_ext\n/* end confdefs.h.  */\n\nint\nmain ()\n{\n\n  ;\n  return 0;\n}\n_ACEOF\nif ac_fn_c_try_compile \"$LINENO\"; then :\n  echo conftest.$ac_objext > conftest.lst\n      lt_ar_try='$AR $AR_FLAGS libconftest.a @conftest.lst >&5'\n      { { eval echo \"\\\"\\$as_me\\\":${as_lineno-$LINENO}: \\\"$lt_ar_try\\\"\"; } >&5\n  (eval $lt_ar_try) 2>&5\n  ac_status=$?\n  $as_echo \"$as_me:${as_lineno-$LINENO}: \\$? = $ac_status\" >&5\n  test $ac_status = 0; }\n      if test 0 -eq \"$ac_status\"; then\n\t# Ensure the archiver fails upon bogus file names.\n\trm -f conftest.$ac_objext libconftest.a\n\t{ { eval echo \"\\\"\\$as_me\\\":${as_lineno-$LINENO}: \\\"$lt_ar_try\\\"\"; } >&5\n  (eval $lt_ar_try) 2>&5\n  ac_status=$?\n  $as_echo \"$as_me:${as_lineno-$LINENO}: \\$? = $ac_status\" >&5\n  test $ac_status = 0; }\n\tif test 0 -ne \"$ac_status\"; then\n          lt_cv_ar_at_file=@\n        fi\n      fi\n      rm -f conftest.* libconftest.a\n\nfi\nrm -f core conftest.err conftest.$ac_objext conftest.$ac_ext\n\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $lt_cv_ar_at_file\" >&5\n$as_echo \"$lt_cv_ar_at_file\" >&6; }\n\nif test no = \"$lt_cv_ar_at_file\"; then\n  archiver_list_spec=\nelse\n  archiver_list_spec=$lt_cv_ar_at_file\nfi\n\n\n\n\n\n\n\nif test -n \"$ac_tool_prefix\"; then\n  # Extract the first word of \"${ac_tool_prefix}strip\", so it can be a program name with args.\nset dummy ${ac_tool_prefix}strip; ac_word=$2\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for $ac_word\" >&5\n$as_echo_n \"checking for $ac_word... \" >&6; }\nif ${ac_cv_prog_STRIP+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  if test -n \"$STRIP\"; then\n  ac_cv_prog_STRIP=\"$STRIP\" # Let the user override the test.\nelse\nas_save_IFS=$IFS; IFS=$PATH_SEPARATOR\nfor as_dir in $PATH\ndo\n  IFS=$as_save_IFS\n  test -z \"$as_dir\" && as_dir=.\n    for ac_exec_ext in '' $ac_executable_extensions; do\n  if as_fn_executable_p \"$as_dir/$ac_word$ac_exec_ext\"; then\n    ac_cv_prog_STRIP=\"${ac_tool_prefix}strip\"\n    $as_echo \"$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext\" >&5\n    break 2\n  fi\ndone\n  done\nIFS=$as_save_IFS\n\nfi\nfi\nSTRIP=$ac_cv_prog_STRIP\nif test -n \"$STRIP\"; then\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: $STRIP\" >&5\n$as_echo \"$STRIP\" >&6; }\nelse\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: no\" >&5\n$as_echo \"no\" >&6; }\nfi\n\n\nfi\nif test -z \"$ac_cv_prog_STRIP\"; then\n  ac_ct_STRIP=$STRIP\n  # Extract the first word of \"strip\", so it can be a program name with args.\nset dummy strip; ac_word=$2\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for $ac_word\" >&5\n$as_echo_n \"checking for $ac_word... \" >&6; }\nif ${ac_cv_prog_ac_ct_STRIP+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  if test -n \"$ac_ct_STRIP\"; then\n  ac_cv_prog_ac_ct_STRIP=\"$ac_ct_STRIP\" # Let the user override the test.\nelse\nas_save_IFS=$IFS; IFS=$PATH_SEPARATOR\nfor as_dir in $PATH\ndo\n  IFS=$as_save_IFS\n  test -z \"$as_dir\" && as_dir=.\n    for ac_exec_ext in '' $ac_executable_extensions; do\n  if as_fn_executable_p \"$as_dir/$ac_word$ac_exec_ext\"; then\n    ac_cv_prog_ac_ct_STRIP=\"strip\"\n    $as_echo \"$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext\" >&5\n    break 2\n  fi\ndone\n  done\nIFS=$as_save_IFS\n\nfi\nfi\nac_ct_STRIP=$ac_cv_prog_ac_ct_STRIP\nif test -n \"$ac_ct_STRIP\"; then\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: $ac_ct_STRIP\" >&5\n$as_echo \"$ac_ct_STRIP\" >&6; }\nelse\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: no\" >&5\n$as_echo \"no\" >&6; }\nfi\n\n  if test \"x$ac_ct_STRIP\" = x; then\n    STRIP=\":\"\n  else\n    case $cross_compiling:$ac_tool_warned in\nyes:)\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet\" >&5\n$as_echo \"$as_me: WARNING: using cross tools not prefixed with host triplet\" >&2;}\nac_tool_warned=yes ;;\nesac\n    STRIP=$ac_ct_STRIP\n  fi\nelse\n  STRIP=\"$ac_cv_prog_STRIP\"\nfi\n\ntest -z \"$STRIP\" && STRIP=:\n\n\n\n\n\n\nif test -n \"$ac_tool_prefix\"; then\n  # Extract the first word of \"${ac_tool_prefix}ranlib\", so it can be a program name with args.\nset dummy ${ac_tool_prefix}ranlib; ac_word=$2\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for $ac_word\" >&5\n$as_echo_n \"checking for $ac_word... \" >&6; }\nif ${ac_cv_prog_RANLIB+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  if test -n \"$RANLIB\"; then\n  ac_cv_prog_RANLIB=\"$RANLIB\" # Let the user override the test.\nelse\nas_save_IFS=$IFS; IFS=$PATH_SEPARATOR\nfor as_dir in $PATH\ndo\n  IFS=$as_save_IFS\n  test -z \"$as_dir\" && as_dir=.\n    for ac_exec_ext in '' $ac_executable_extensions; do\n  if as_fn_executable_p \"$as_dir/$ac_word$ac_exec_ext\"; then\n    ac_cv_prog_RANLIB=\"${ac_tool_prefix}ranlib\"\n    $as_echo \"$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext\" >&5\n    break 2\n  fi\ndone\n  done\nIFS=$as_save_IFS\n\nfi\nfi\nRANLIB=$ac_cv_prog_RANLIB\nif test -n \"$RANLIB\"; then\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: $RANLIB\" >&5\n$as_echo \"$RANLIB\" >&6; }\nelse\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: no\" >&5\n$as_echo \"no\" >&6; }\nfi\n\n\nfi\nif test -z \"$ac_cv_prog_RANLIB\"; then\n  ac_ct_RANLIB=$RANLIB\n  # Extract the first word of \"ranlib\", so it can be a program name with args.\nset dummy ranlib; ac_word=$2\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for $ac_word\" >&5\n$as_echo_n \"checking for $ac_word... \" >&6; }\nif ${ac_cv_prog_ac_ct_RANLIB+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  if test -n \"$ac_ct_RANLIB\"; then\n  ac_cv_prog_ac_ct_RANLIB=\"$ac_ct_RANLIB\" # Let the user override the test.\nelse\nas_save_IFS=$IFS; IFS=$PATH_SEPARATOR\nfor as_dir in $PATH\ndo\n  IFS=$as_save_IFS\n  test -z \"$as_dir\" && as_dir=.\n    for ac_exec_ext in '' $ac_executable_extensions; do\n  if as_fn_executable_p \"$as_dir/$ac_word$ac_exec_ext\"; then\n    ac_cv_prog_ac_ct_RANLIB=\"ranlib\"\n    $as_echo \"$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext\" >&5\n    break 2\n  fi\ndone\n  done\nIFS=$as_save_IFS\n\nfi\nfi\nac_ct_RANLIB=$ac_cv_prog_ac_ct_RANLIB\nif test -n \"$ac_ct_RANLIB\"; then\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: $ac_ct_RANLIB\" >&5\n$as_echo \"$ac_ct_RANLIB\" >&6; }\nelse\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: no\" >&5\n$as_echo \"no\" >&6; }\nfi\n\n  if test \"x$ac_ct_RANLIB\" = x; then\n    RANLIB=\":\"\n  else\n    case $cross_compiling:$ac_tool_warned in\nyes:)\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet\" >&5\n$as_echo \"$as_me: WARNING: using cross tools not prefixed with host triplet\" >&2;}\nac_tool_warned=yes ;;\nesac\n    RANLIB=$ac_ct_RANLIB\n  fi\nelse\n  RANLIB=\"$ac_cv_prog_RANLIB\"\nfi\n\ntest -z \"$RANLIB\" && RANLIB=:\n\n\n\n\n\n\n# Determine commands to create old-style static archives.\nold_archive_cmds='$AR $AR_FLAGS $oldlib$oldobjs'\nold_postinstall_cmds='chmod 644 $oldlib'\nold_postuninstall_cmds=\n\nif test -n \"$RANLIB\"; then\n  case $host_os in\n  bitrig* | openbsd*)\n    old_postinstall_cmds=\"$old_postinstall_cmds~\\$RANLIB -t \\$tool_oldlib\"\n    ;;\n  *)\n    old_postinstall_cmds=\"$old_postinstall_cmds~\\$RANLIB \\$tool_oldlib\"\n    ;;\n  esac\n  old_archive_cmds=\"$old_archive_cmds~\\$RANLIB \\$tool_oldlib\"\nfi\n\ncase $host_os in\n  darwin*)\n    lock_old_archive_extraction=yes ;;\n  *)\n    lock_old_archive_extraction=no ;;\nesac\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n# If no C compiler was specified, use CC.\nLTCC=${LTCC-\"$CC\"}\n\n# If no C compiler flags were specified, use CFLAGS.\nLTCFLAGS=${LTCFLAGS-\"$CFLAGS\"}\n\n# Allow CC to be a program name with arguments.\ncompiler=$CC\n\n\n# Check for command to grab the raw symbol name followed by C symbol from nm.\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking command to parse $NM output from $compiler object\" >&5\n$as_echo_n \"checking command to parse $NM output from $compiler object... \" >&6; }\nif ${lt_cv_sys_global_symbol_pipe+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n\n# These are sane defaults that work on at least a few old systems.\n# [They come from Ultrix.  What could be older than Ultrix?!! ;)]\n\n# Character class describing NM global symbol codes.\nsymcode='[BCDEGRST]'\n\n# Regexp to match symbols that can be accessed directly from C.\nsympat='\\([_A-Za-z][_A-Za-z0-9]*\\)'\n\n# Define system-specific variables.\ncase $host_os in\naix*)\n  symcode='[BCDT]'\n  ;;\ncygwin* | mingw* | pw32* | cegcc*)\n  symcode='[ABCDGISTW]'\n  ;;\nhpux*)\n  if test ia64 = \"$host_cpu\"; then\n    symcode='[ABCDEGRST]'\n  fi\n  ;;\nirix* | nonstopux*)\n  symcode='[BCDEGRST]'\n  ;;\nosf*)\n  symcode='[BCDEGQRST]'\n  ;;\nsolaris*)\n  symcode='[BDRT]'\n  ;;\nsco3.2v5*)\n  symcode='[DT]'\n  ;;\nsysv4.2uw2*)\n  symcode='[DT]'\n  ;;\nsysv5* | sco5v6* | unixware* | OpenUNIX*)\n  symcode='[ABDT]'\n  ;;\nsysv4)\n  symcode='[DFNSTU]'\n  ;;\nesac\n\n# If we're using GNU nm, then use its standard symbol codes.\ncase `$NM -V 2>&1` in\n*GNU* | *'with BFD'*)\n  symcode='[ABCDGIRSTW]' ;;\nesac\n\nif test \"$lt_cv_nm_interface\" = \"MS dumpbin\"; then\n  # Gets list of data symbols to import.\n  lt_cv_sys_global_symbol_to_import=\"sed -n -e 's/^I .* \\(.*\\)$/\\1/p'\"\n  # Adjust the below global symbol transforms to fixup imported variables.\n  lt_cdecl_hook=\" -e 's/^I .* \\(.*\\)$/extern __declspec(dllimport) char \\1;/p'\"\n  lt_c_name_hook=\" -e 's/^I .* \\(.*\\)$/  {\\\"\\1\\\", (void *) 0},/p'\"\n  lt_c_name_lib_hook=\"\\\n  -e 's/^I .* \\(lib.*\\)$/  {\\\"\\1\\\", (void *) 0},/p'\\\n  -e 's/^I .* \\(.*\\)$/  {\\\"lib\\1\\\", (void *) 0},/p'\"\nelse\n  # Disable hooks by default.\n  lt_cv_sys_global_symbol_to_import=\n  lt_cdecl_hook=\n  lt_c_name_hook=\n  lt_c_name_lib_hook=\nfi\n\n# Transform an extracted symbol line into a proper C declaration.\n# Some systems (esp. on ia64) link data and code symbols differently,\n# so use this general approach.\nlt_cv_sys_global_symbol_to_cdecl=\"sed -n\"\\\n$lt_cdecl_hook\\\n\" -e 's/^T .* \\(.*\\)$/extern int \\1();/p'\"\\\n\" -e 's/^$symcode$symcode* .* \\(.*\\)$/extern char \\1;/p'\"\n\n# Transform an extracted symbol line into symbol name and symbol address\nlt_cv_sys_global_symbol_to_c_name_address=\"sed -n\"\\\n$lt_c_name_hook\\\n\" -e 's/^: \\(.*\\) .*$/  {\\\"\\1\\\", (void *) 0},/p'\"\\\n\" -e 's/^$symcode$symcode* .* \\(.*\\)$/  {\\\"\\1\\\", (void *) \\&\\1},/p'\"\n\n# Transform an extracted symbol line into symbol name with lib prefix and\n# symbol address.\nlt_cv_sys_global_symbol_to_c_name_address_lib_prefix=\"sed -n\"\\\n$lt_c_name_lib_hook\\\n\" -e 's/^: \\(.*\\) .*$/  {\\\"\\1\\\", (void *) 0},/p'\"\\\n\" -e 's/^$symcode$symcode* .* \\(lib.*\\)$/  {\\\"\\1\\\", (void *) \\&\\1},/p'\"\\\n\" -e 's/^$symcode$symcode* .* \\(.*\\)$/  {\\\"lib\\1\\\", (void *) \\&\\1},/p'\"\n\n# Handle CRLF in mingw tool chain\nopt_cr=\ncase $build_os in\nmingw*)\n  opt_cr=`$ECHO 'x\\{0,1\\}' | tr x '\\015'` # option cr in regexp\n  ;;\nesac\n\n# Try without a prefix underscore, then with it.\nfor ac_symprfx in \"\" \"_\"; do\n\n  # Transform symcode, sympat, and symprfx into a raw symbol and a C symbol.\n  symxfrm=\"\\\\1 $ac_symprfx\\\\2 \\\\2\"\n\n  # Write the raw and C identifiers.\n  if test \"$lt_cv_nm_interface\" = \"MS dumpbin\"; then\n    # Fake it for dumpbin and say T for any non-static function,\n    # D for any global variable and I for any imported variable.\n    # Also find C++ and __fastcall symbols from MSVC++,\n    # which start with @ or ?.\n    lt_cv_sys_global_symbol_pipe=\"$AWK '\"\\\n\"     {last_section=section; section=\\$ 3};\"\\\n\"     /^COFF SYMBOL TABLE/{for(i in hide) delete hide[i]};\"\\\n\"     /Section length .*#relocs.*(pick any)/{hide[last_section]=1};\"\\\n\"     /^ *Symbol name *: /{split(\\$ 0,sn,\\\":\\\"); si=substr(sn[2],2)};\"\\\n\"     /^ *Type *: code/{print \\\"T\\\",si,substr(si,length(prfx))};\"\\\n\"     /^ *Type *: data/{print \\\"I\\\",si,substr(si,length(prfx))};\"\\\n\"     \\$ 0!~/External *\\|/{next};\"\\\n\"     / 0+ UNDEF /{next}; / UNDEF \\([^|]\\)*()/{next};\"\\\n\"     {if(hide[section]) next};\"\\\n\"     {f=\\\"D\\\"}; \\$ 0~/\\(\\).*\\|/{f=\\\"T\\\"};\"\\\n\"     {split(\\$ 0,a,/\\||\\r/); split(a[2],s)};\"\\\n\"     s[1]~/^[@?]/{print f,s[1],s[1]; next};\"\\\n\"     s[1]~prfx {split(s[1],t,\\\"@\\\"); print f,t[1],substr(t[1],length(prfx))}\"\\\n\"     ' prfx=^$ac_symprfx\"\n  else\n    lt_cv_sys_global_symbol_pipe=\"sed -n -e 's/^.*[\t ]\\($symcode$symcode*\\)[\t ][\t ]*$ac_symprfx$sympat$opt_cr$/$symxfrm/p'\"\n  fi\n  lt_cv_sys_global_symbol_pipe=\"$lt_cv_sys_global_symbol_pipe | sed '/ __gnu_lto/d'\"\n\n  # Check to see that the pipe works correctly.\n  pipe_works=no\n\n  rm -f conftest*\n  cat > conftest.$ac_ext <<_LT_EOF\n#ifdef __cplusplus\nextern \"C\" {\n#endif\nchar nm_test_var;\nvoid nm_test_func(void);\nvoid nm_test_func(void){}\n#ifdef __cplusplus\n}\n#endif\nint main(){nm_test_var='a';nm_test_func();return(0);}\n_LT_EOF\n\n  if { { eval echo \"\\\"\\$as_me\\\":${as_lineno-$LINENO}: \\\"$ac_compile\\\"\"; } >&5\n  (eval $ac_compile) 2>&5\n  ac_status=$?\n  $as_echo \"$as_me:${as_lineno-$LINENO}: \\$? = $ac_status\" >&5\n  test $ac_status = 0; }; then\n    # Now try to grab the symbols.\n    nlist=conftest.nm\n    if { { eval echo \"\\\"\\$as_me\\\":${as_lineno-$LINENO}: \\\"$NM conftest.$ac_objext \\| \"$lt_cv_sys_global_symbol_pipe\" \\> $nlist\\\"\"; } >&5\n  (eval $NM conftest.$ac_objext \\| \"$lt_cv_sys_global_symbol_pipe\" \\> $nlist) 2>&5\n  ac_status=$?\n  $as_echo \"$as_me:${as_lineno-$LINENO}: \\$? = $ac_status\" >&5\n  test $ac_status = 0; } && test -s \"$nlist\"; then\n      # Try sorting and uniquifying the output.\n      if sort \"$nlist\" | uniq > \"$nlist\"T; then\n\tmv -f \"$nlist\"T \"$nlist\"\n      else\n\trm -f \"$nlist\"T\n      fi\n\n      # Make sure that we snagged all the symbols we need.\n      if $GREP ' nm_test_var$' \"$nlist\" >/dev/null; then\n\tif $GREP ' nm_test_func$' \"$nlist\" >/dev/null; then\n\t  cat <<_LT_EOF > conftest.$ac_ext\n/* Keep this code in sync between libtool.m4, ltmain, lt_system.h, and tests.  */\n#if defined _WIN32 || defined __CYGWIN__ || defined _WIN32_WCE\n/* DATA imports from DLLs on WIN32 can't be const, because runtime\n   relocations are performed -- see ld's documentation on pseudo-relocs.  */\n# define LT_DLSYM_CONST\n#elif defined __osf__\n/* This system does not cope well with relocations in const data.  */\n# define LT_DLSYM_CONST\n#else\n# define LT_DLSYM_CONST const\n#endif\n\n#ifdef __cplusplus\nextern \"C\" {\n#endif\n\n_LT_EOF\n\t  # Now generate the symbol file.\n\t  eval \"$lt_cv_sys_global_symbol_to_cdecl\"' < \"$nlist\" | $GREP -v main >> conftest.$ac_ext'\n\n\t  cat <<_LT_EOF >> conftest.$ac_ext\n\n/* The mapping between symbol names and symbols.  */\nLT_DLSYM_CONST struct {\n  const char *name;\n  void       *address;\n}\nlt__PROGRAM__LTX_preloaded_symbols[] =\n{\n  { \"@PROGRAM@\", (void *) 0 },\n_LT_EOF\n\t  $SED \"s/^$symcode$symcode* .* \\(.*\\)$/  {\\\"\\1\\\", (void *) \\&\\1},/\" < \"$nlist\" | $GREP -v main >> conftest.$ac_ext\n\t  cat <<\\_LT_EOF >> conftest.$ac_ext\n  {0, (void *) 0}\n};\n\n/* This works around a problem in FreeBSD linker */\n#ifdef FREEBSD_WORKAROUND\nstatic const void *lt_preloaded_setup() {\n  return lt__PROGRAM__LTX_preloaded_symbols;\n}\n#endif\n\n#ifdef __cplusplus\n}\n#endif\n_LT_EOF\n\t  # Now try linking the two files.\n\t  mv conftest.$ac_objext conftstm.$ac_objext\n\t  lt_globsym_save_LIBS=$LIBS\n\t  lt_globsym_save_CFLAGS=$CFLAGS\n\t  LIBS=conftstm.$ac_objext\n\t  CFLAGS=\"$CFLAGS$lt_prog_compiler_no_builtin_flag\"\n\t  if { { eval echo \"\\\"\\$as_me\\\":${as_lineno-$LINENO}: \\\"$ac_link\\\"\"; } >&5\n  (eval $ac_link) 2>&5\n  ac_status=$?\n  $as_echo \"$as_me:${as_lineno-$LINENO}: \\$? = $ac_status\" >&5\n  test $ac_status = 0; } && test -s conftest$ac_exeext; then\n\t    pipe_works=yes\n\t  fi\n\t  LIBS=$lt_globsym_save_LIBS\n\t  CFLAGS=$lt_globsym_save_CFLAGS\n\telse\n\t  echo \"cannot find nm_test_func in $nlist\" >&5\n\tfi\n      else\n\techo \"cannot find nm_test_var in $nlist\" >&5\n      fi\n    else\n      echo \"cannot run $lt_cv_sys_global_symbol_pipe\" >&5\n    fi\n  else\n    echo \"$progname: failed program was:\" >&5\n    cat conftest.$ac_ext >&5\n  fi\n  rm -rf conftest* conftst*\n\n  # Do not use the global_symbol_pipe unless it works.\n  if test yes = \"$pipe_works\"; then\n    break\n  else\n    lt_cv_sys_global_symbol_pipe=\n  fi\ndone\n\nfi\n\nif test -z \"$lt_cv_sys_global_symbol_pipe\"; then\n  lt_cv_sys_global_symbol_to_cdecl=\nfi\nif test -z \"$lt_cv_sys_global_symbol_pipe$lt_cv_sys_global_symbol_to_cdecl\"; then\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: failed\" >&5\n$as_echo \"failed\" >&6; }\nelse\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: ok\" >&5\n$as_echo \"ok\" >&6; }\nfi\n\n# Response file support.\nif test \"$lt_cv_nm_interface\" = \"MS dumpbin\"; then\n  nm_file_list_spec='@'\nelif $NM --help 2>/dev/null | grep '[@]FILE' >/dev/null; then\n  nm_file_list_spec='@'\nfi\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for sysroot\" >&5\n$as_echo_n \"checking for sysroot... \" >&6; }\n\n# Check whether --with-sysroot was given.\nif test \"${with_sysroot+set}\" = set; then :\n  withval=$with_sysroot;\nelse\n  with_sysroot=no\nfi\n\n\nlt_sysroot=\ncase $with_sysroot in #(\n yes)\n   if test yes = \"$GCC\"; then\n     lt_sysroot=`$CC --print-sysroot 2>/dev/null`\n   fi\n   ;; #(\n /*)\n   lt_sysroot=`echo \"$with_sysroot\" | sed -e \"$sed_quote_subst\"`\n   ;; #(\n no|'')\n   ;; #(\n *)\n   { $as_echo \"$as_me:${as_lineno-$LINENO}: result: $with_sysroot\" >&5\n$as_echo \"$with_sysroot\" >&6; }\n   as_fn_error $? \"The sysroot must be an absolute path.\" \"$LINENO\" 5\n   ;;\nesac\n\n { $as_echo \"$as_me:${as_lineno-$LINENO}: result: ${lt_sysroot:-no}\" >&5\n$as_echo \"${lt_sysroot:-no}\" >&6; }\n\n\n\n\n\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for a working dd\" >&5\n$as_echo_n \"checking for a working dd... \" >&6; }\nif ${ac_cv_path_lt_DD+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  printf 0123456789abcdef0123456789abcdef >conftest.i\ncat conftest.i conftest.i >conftest2.i\n: ${lt_DD:=$DD}\nif test -z \"$lt_DD\"; then\n  ac_path_lt_DD_found=false\n  # Loop through the user's path and test for each of PROGNAME-LIST\n  as_save_IFS=$IFS; IFS=$PATH_SEPARATOR\nfor as_dir in $PATH\ndo\n  IFS=$as_save_IFS\n  test -z \"$as_dir\" && as_dir=.\n    for ac_prog in dd; do\n    for ac_exec_ext in '' $ac_executable_extensions; do\n      ac_path_lt_DD=\"$as_dir/$ac_prog$ac_exec_ext\"\n      as_fn_executable_p \"$ac_path_lt_DD\" || continue\nif \"$ac_path_lt_DD\" bs=32 count=1 <conftest2.i >conftest.out 2>/dev/null; then\n  cmp -s conftest.i conftest.out \\\n  && ac_cv_path_lt_DD=\"$ac_path_lt_DD\" ac_path_lt_DD_found=:\nfi\n      $ac_path_lt_DD_found && break 3\n    done\n  done\n  done\nIFS=$as_save_IFS\n  if test -z \"$ac_cv_path_lt_DD\"; then\n    :\n  fi\nelse\n  ac_cv_path_lt_DD=$lt_DD\nfi\n\nrm -f conftest.i conftest2.i conftest.out\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $ac_cv_path_lt_DD\" >&5\n$as_echo \"$ac_cv_path_lt_DD\" >&6; }\n\n\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking how to truncate binary pipes\" >&5\n$as_echo_n \"checking how to truncate binary pipes... \" >&6; }\nif ${lt_cv_truncate_bin+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  printf 0123456789abcdef0123456789abcdef >conftest.i\ncat conftest.i conftest.i >conftest2.i\nlt_cv_truncate_bin=\nif \"$ac_cv_path_lt_DD\" bs=32 count=1 <conftest2.i >conftest.out 2>/dev/null; then\n  cmp -s conftest.i conftest.out \\\n  && lt_cv_truncate_bin=\"$ac_cv_path_lt_DD bs=4096 count=1\"\nfi\nrm -f conftest.i conftest2.i conftest.out\ntest -z \"$lt_cv_truncate_bin\" && lt_cv_truncate_bin=\"$SED -e 4q\"\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $lt_cv_truncate_bin\" >&5\n$as_echo \"$lt_cv_truncate_bin\" >&6; }\n\n\n\n\n\n\n\n# Calculate cc_basename.  Skip known compiler wrappers and cross-prefix.\nfunc_cc_basename ()\n{\n    for cc_temp in $*\"\"; do\n      case $cc_temp in\n        compile | *[\\\\/]compile | ccache | *[\\\\/]ccache ) ;;\n        distcc | *[\\\\/]distcc | purify | *[\\\\/]purify ) ;;\n        \\-*) ;;\n        *) break;;\n      esac\n    done\n    func_cc_basename_result=`$ECHO \"$cc_temp\" | $SED \"s%.*/%%; s%^$host_alias-%%\"`\n}\n\n# Check whether --enable-libtool-lock was given.\nif test \"${enable_libtool_lock+set}\" = set; then :\n  enableval=$enable_libtool_lock;\nfi\n\ntest no = \"$enable_libtool_lock\" || enable_libtool_lock=yes\n\n# Some flags need to be propagated to the compiler or linker for good\n# libtool support.\ncase $host in\nia64-*-hpux*)\n  # Find out what ABI is being produced by ac_compile, and set mode\n  # options accordingly.\n  echo 'int i;' > conftest.$ac_ext\n  if { { eval echo \"\\\"\\$as_me\\\":${as_lineno-$LINENO}: \\\"$ac_compile\\\"\"; } >&5\n  (eval $ac_compile) 2>&5\n  ac_status=$?\n  $as_echo \"$as_me:${as_lineno-$LINENO}: \\$? = $ac_status\" >&5\n  test $ac_status = 0; }; then\n    case `/usr/bin/file conftest.$ac_objext` in\n      *ELF-32*)\n\tHPUX_IA64_MODE=32\n\t;;\n      *ELF-64*)\n\tHPUX_IA64_MODE=64\n\t;;\n    esac\n  fi\n  rm -rf conftest*\n  ;;\n*-*-irix6*)\n  # Find out what ABI is being produced by ac_compile, and set linker\n  # options accordingly.\n  echo '#line '$LINENO' \"configure\"' > conftest.$ac_ext\n  if { { eval echo \"\\\"\\$as_me\\\":${as_lineno-$LINENO}: \\\"$ac_compile\\\"\"; } >&5\n  (eval $ac_compile) 2>&5\n  ac_status=$?\n  $as_echo \"$as_me:${as_lineno-$LINENO}: \\$? = $ac_status\" >&5\n  test $ac_status = 0; }; then\n    if test yes = \"$lt_cv_prog_gnu_ld\"; then\n      case `/usr/bin/file conftest.$ac_objext` in\n\t*32-bit*)\n\t  LD=\"${LD-ld} -melf32bsmip\"\n\t  ;;\n\t*N32*)\n\t  LD=\"${LD-ld} -melf32bmipn32\"\n\t  ;;\n\t*64-bit*)\n\t  LD=\"${LD-ld} -melf64bmip\"\n\t;;\n      esac\n    else\n      case `/usr/bin/file conftest.$ac_objext` in\n\t*32-bit*)\n\t  LD=\"${LD-ld} -32\"\n\t  ;;\n\t*N32*)\n\t  LD=\"${LD-ld} -n32\"\n\t  ;;\n\t*64-bit*)\n\t  LD=\"${LD-ld} -64\"\n\t  ;;\n      esac\n    fi\n  fi\n  rm -rf conftest*\n  ;;\n\nmips64*-*linux*)\n  # Find out what ABI is being produced by ac_compile, and set linker\n  # options accordingly.\n  echo '#line '$LINENO' \"configure\"' > conftest.$ac_ext\n  if { { eval echo \"\\\"\\$as_me\\\":${as_lineno-$LINENO}: \\\"$ac_compile\\\"\"; } >&5\n  (eval $ac_compile) 2>&5\n  ac_status=$?\n  $as_echo \"$as_me:${as_lineno-$LINENO}: \\$? = $ac_status\" >&5\n  test $ac_status = 0; }; then\n    emul=elf\n    case `/usr/bin/file conftest.$ac_objext` in\n      *32-bit*)\n\temul=\"${emul}32\"\n\t;;\n      *64-bit*)\n\temul=\"${emul}64\"\n\t;;\n    esac\n    case `/usr/bin/file conftest.$ac_objext` in\n      *MSB*)\n\temul=\"${emul}btsmip\"\n\t;;\n      *LSB*)\n\temul=\"${emul}ltsmip\"\n\t;;\n    esac\n    case `/usr/bin/file conftest.$ac_objext` in\n      *N32*)\n\temul=\"${emul}n32\"\n\t;;\n    esac\n    LD=\"${LD-ld} -m $emul\"\n  fi\n  rm -rf conftest*\n  ;;\n\nx86_64-*kfreebsd*-gnu|x86_64-*linux*|powerpc*-*linux*| \\\ns390*-*linux*|s390*-*tpf*|sparc*-*linux*)\n  # Find out what ABI is being produced by ac_compile, and set linker\n  # options accordingly.  Note that the listed cases only cover the\n  # situations where additional linker options are needed (such as when\n  # doing 32-bit compilation for a host where ld defaults to 64-bit, or\n  # vice versa); the common cases where no linker options are needed do\n  # not appear in the list.\n  echo 'int i;' > conftest.$ac_ext\n  if { { eval echo \"\\\"\\$as_me\\\":${as_lineno-$LINENO}: \\\"$ac_compile\\\"\"; } >&5\n  (eval $ac_compile) 2>&5\n  ac_status=$?\n  $as_echo \"$as_me:${as_lineno-$LINENO}: \\$? = $ac_status\" >&5\n  test $ac_status = 0; }; then\n    case `/usr/bin/file conftest.o` in\n      *32-bit*)\n\tcase $host in\n\t  x86_64-*kfreebsd*-gnu)\n\t    LD=\"${LD-ld} -m elf_i386_fbsd\"\n\t    ;;\n\t  x86_64-*linux*)\n\t    case `/usr/bin/file conftest.o` in\n\t      *x86-64*)\n\t\tLD=\"${LD-ld} -m elf32_x86_64\"\n\t\t;;\n\t      *)\n\t\tLD=\"${LD-ld} -m elf_i386\"\n\t\t;;\n\t    esac\n\t    ;;\n\t  powerpc64le-*linux*)\n\t    LD=\"${LD-ld} -m elf32lppclinux\"\n\t    ;;\n\t  powerpc64-*linux*)\n\t    LD=\"${LD-ld} -m elf32ppclinux\"\n\t    ;;\n\t  s390x-*linux*)\n\t    LD=\"${LD-ld} -m elf_s390\"\n\t    ;;\n\t  sparc64-*linux*)\n\t    LD=\"${LD-ld} -m elf32_sparc\"\n\t    ;;\n\tesac\n\t;;\n      *64-bit*)\n\tcase $host in\n\t  x86_64-*kfreebsd*-gnu)\n\t    LD=\"${LD-ld} -m elf_x86_64_fbsd\"\n\t    ;;\n\t  x86_64-*linux*)\n\t    LD=\"${LD-ld} -m elf_x86_64\"\n\t    ;;\n\t  powerpcle-*linux*)\n\t    LD=\"${LD-ld} -m elf64lppc\"\n\t    ;;\n\t  powerpc-*linux*)\n\t    LD=\"${LD-ld} -m elf64ppc\"\n\t    ;;\n\t  s390*-*linux*|s390*-*tpf*)\n\t    LD=\"${LD-ld} -m elf64_s390\"\n\t    ;;\n\t  sparc*-*linux*)\n\t    LD=\"${LD-ld} -m elf64_sparc\"\n\t    ;;\n\tesac\n\t;;\n    esac\n  fi\n  rm -rf conftest*\n  ;;\n\n*-*-sco3.2v5*)\n  # On SCO OpenServer 5, we need -belf to get full-featured binaries.\n  SAVE_CFLAGS=$CFLAGS\n  CFLAGS=\"$CFLAGS -belf\"\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: checking whether the C compiler needs -belf\" >&5\n$as_echo_n \"checking whether the C compiler needs -belf... \" >&6; }\nif ${lt_cv_cc_needs_belf+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  ac_ext=c\nac_cpp='$CPP $CPPFLAGS'\nac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5'\nac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5'\nac_compiler_gnu=$ac_cv_c_compiler_gnu\n\n     cat confdefs.h - <<_ACEOF >conftest.$ac_ext\n/* end confdefs.h.  */\n\nint\nmain ()\n{\n\n  ;\n  return 0;\n}\n_ACEOF\nif ac_fn_c_try_link \"$LINENO\"; then :\n  lt_cv_cc_needs_belf=yes\nelse\n  lt_cv_cc_needs_belf=no\nfi\nrm -f core conftest.err conftest.$ac_objext \\\n    conftest$ac_exeext conftest.$ac_ext\n     ac_ext=c\nac_cpp='$CPP $CPPFLAGS'\nac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5'\nac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5'\nac_compiler_gnu=$ac_cv_c_compiler_gnu\n\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $lt_cv_cc_needs_belf\" >&5\n$as_echo \"$lt_cv_cc_needs_belf\" >&6; }\n  if test yes != \"$lt_cv_cc_needs_belf\"; then\n    # this is probably gcc 2.8.0, egcs 1.0 or newer; no need for -belf\n    CFLAGS=$SAVE_CFLAGS\n  fi\n  ;;\n*-*solaris*)\n  # Find out what ABI is being produced by ac_compile, and set linker\n  # options accordingly.\n  echo 'int i;' > conftest.$ac_ext\n  if { { eval echo \"\\\"\\$as_me\\\":${as_lineno-$LINENO}: \\\"$ac_compile\\\"\"; } >&5\n  (eval $ac_compile) 2>&5\n  ac_status=$?\n  $as_echo \"$as_me:${as_lineno-$LINENO}: \\$? = $ac_status\" >&5\n  test $ac_status = 0; }; then\n    case `/usr/bin/file conftest.o` in\n    *64-bit*)\n      case $lt_cv_prog_gnu_ld in\n      yes*)\n        case $host in\n        i?86-*-solaris*|x86_64-*-solaris*)\n          LD=\"${LD-ld} -m elf_x86_64\"\n          ;;\n        sparc*-*-solaris*)\n          LD=\"${LD-ld} -m elf64_sparc\"\n          ;;\n        esac\n        # GNU ld 2.21 introduced _sol2 emulations.  Use them if available.\n        if ${LD-ld} -V | grep _sol2 >/dev/null 2>&1; then\n          LD=${LD-ld}_sol2\n        fi\n        ;;\n      *)\n\tif ${LD-ld} -64 -r -o conftest2.o conftest.o >/dev/null 2>&1; then\n\t  LD=\"${LD-ld} -64\"\n\tfi\n\t;;\n      esac\n      ;;\n    esac\n  fi\n  rm -rf conftest*\n  ;;\nesac\n\nneed_locks=$enable_libtool_lock\n\nif test -n \"$ac_tool_prefix\"; then\n  # Extract the first word of \"${ac_tool_prefix}mt\", so it can be a program name with args.\nset dummy ${ac_tool_prefix}mt; ac_word=$2\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for $ac_word\" >&5\n$as_echo_n \"checking for $ac_word... \" >&6; }\nif ${ac_cv_prog_MANIFEST_TOOL+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  if test -n \"$MANIFEST_TOOL\"; then\n  ac_cv_prog_MANIFEST_TOOL=\"$MANIFEST_TOOL\" # Let the user override the test.\nelse\nas_save_IFS=$IFS; IFS=$PATH_SEPARATOR\nfor as_dir in $PATH\ndo\n  IFS=$as_save_IFS\n  test -z \"$as_dir\" && as_dir=.\n    for ac_exec_ext in '' $ac_executable_extensions; do\n  if as_fn_executable_p \"$as_dir/$ac_word$ac_exec_ext\"; then\n    ac_cv_prog_MANIFEST_TOOL=\"${ac_tool_prefix}mt\"\n    $as_echo \"$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext\" >&5\n    break 2\n  fi\ndone\n  done\nIFS=$as_save_IFS\n\nfi\nfi\nMANIFEST_TOOL=$ac_cv_prog_MANIFEST_TOOL\nif test -n \"$MANIFEST_TOOL\"; then\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: $MANIFEST_TOOL\" >&5\n$as_echo \"$MANIFEST_TOOL\" >&6; }\nelse\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: no\" >&5\n$as_echo \"no\" >&6; }\nfi\n\n\nfi\nif test -z \"$ac_cv_prog_MANIFEST_TOOL\"; then\n  ac_ct_MANIFEST_TOOL=$MANIFEST_TOOL\n  # Extract the first word of \"mt\", so it can be a program name with args.\nset dummy mt; ac_word=$2\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for $ac_word\" >&5\n$as_echo_n \"checking for $ac_word... \" >&6; }\nif ${ac_cv_prog_ac_ct_MANIFEST_TOOL+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  if test -n \"$ac_ct_MANIFEST_TOOL\"; then\n  ac_cv_prog_ac_ct_MANIFEST_TOOL=\"$ac_ct_MANIFEST_TOOL\" # Let the user override the test.\nelse\nas_save_IFS=$IFS; IFS=$PATH_SEPARATOR\nfor as_dir in $PATH\ndo\n  IFS=$as_save_IFS\n  test -z \"$as_dir\" && as_dir=.\n    for ac_exec_ext in '' $ac_executable_extensions; do\n  if as_fn_executable_p \"$as_dir/$ac_word$ac_exec_ext\"; then\n    ac_cv_prog_ac_ct_MANIFEST_TOOL=\"mt\"\n    $as_echo \"$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext\" >&5\n    break 2\n  fi\ndone\n  done\nIFS=$as_save_IFS\n\nfi\nfi\nac_ct_MANIFEST_TOOL=$ac_cv_prog_ac_ct_MANIFEST_TOOL\nif test -n \"$ac_ct_MANIFEST_TOOL\"; then\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: $ac_ct_MANIFEST_TOOL\" >&5\n$as_echo \"$ac_ct_MANIFEST_TOOL\" >&6; }\nelse\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: no\" >&5\n$as_echo \"no\" >&6; }\nfi\n\n  if test \"x$ac_ct_MANIFEST_TOOL\" = x; then\n    MANIFEST_TOOL=\":\"\n  else\n    case $cross_compiling:$ac_tool_warned in\nyes:)\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet\" >&5\n$as_echo \"$as_me: WARNING: using cross tools not prefixed with host triplet\" >&2;}\nac_tool_warned=yes ;;\nesac\n    MANIFEST_TOOL=$ac_ct_MANIFEST_TOOL\n  fi\nelse\n  MANIFEST_TOOL=\"$ac_cv_prog_MANIFEST_TOOL\"\nfi\n\ntest -z \"$MANIFEST_TOOL\" && MANIFEST_TOOL=mt\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking if $MANIFEST_TOOL is a manifest tool\" >&5\n$as_echo_n \"checking if $MANIFEST_TOOL is a manifest tool... \" >&6; }\nif ${lt_cv_path_mainfest_tool+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  lt_cv_path_mainfest_tool=no\n  echo \"$as_me:$LINENO: $MANIFEST_TOOL '-?'\" >&5\n  $MANIFEST_TOOL '-?' 2>conftest.err > conftest.out\n  cat conftest.err >&5\n  if $GREP 'Manifest Tool' conftest.out > /dev/null; then\n    lt_cv_path_mainfest_tool=yes\n  fi\n  rm -f conftest*\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $lt_cv_path_mainfest_tool\" >&5\n$as_echo \"$lt_cv_path_mainfest_tool\" >&6; }\nif test yes != \"$lt_cv_path_mainfest_tool\"; then\n  MANIFEST_TOOL=:\nfi\n\n\n\n\n\n\n  case $host_os in\n    rhapsody* | darwin*)\n    if test -n \"$ac_tool_prefix\"; then\n  # Extract the first word of \"${ac_tool_prefix}dsymutil\", so it can be a program name with args.\nset dummy ${ac_tool_prefix}dsymutil; ac_word=$2\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for $ac_word\" >&5\n$as_echo_n \"checking for $ac_word... \" >&6; }\nif ${ac_cv_prog_DSYMUTIL+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  if test -n \"$DSYMUTIL\"; then\n  ac_cv_prog_DSYMUTIL=\"$DSYMUTIL\" # Let the user override the test.\nelse\nas_save_IFS=$IFS; IFS=$PATH_SEPARATOR\nfor as_dir in $PATH\ndo\n  IFS=$as_save_IFS\n  test -z \"$as_dir\" && as_dir=.\n    for ac_exec_ext in '' $ac_executable_extensions; do\n  if as_fn_executable_p \"$as_dir/$ac_word$ac_exec_ext\"; then\n    ac_cv_prog_DSYMUTIL=\"${ac_tool_prefix}dsymutil\"\n    $as_echo \"$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext\" >&5\n    break 2\n  fi\ndone\n  done\nIFS=$as_save_IFS\n\nfi\nfi\nDSYMUTIL=$ac_cv_prog_DSYMUTIL\nif test -n \"$DSYMUTIL\"; then\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: $DSYMUTIL\" >&5\n$as_echo \"$DSYMUTIL\" >&6; }\nelse\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: no\" >&5\n$as_echo \"no\" >&6; }\nfi\n\n\nfi\nif test -z \"$ac_cv_prog_DSYMUTIL\"; then\n  ac_ct_DSYMUTIL=$DSYMUTIL\n  # Extract the first word of \"dsymutil\", so it can be a program name with args.\nset dummy dsymutil; ac_word=$2\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for $ac_word\" >&5\n$as_echo_n \"checking for $ac_word... \" >&6; }\nif ${ac_cv_prog_ac_ct_DSYMUTIL+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  if test -n \"$ac_ct_DSYMUTIL\"; then\n  ac_cv_prog_ac_ct_DSYMUTIL=\"$ac_ct_DSYMUTIL\" # Let the user override the test.\nelse\nas_save_IFS=$IFS; IFS=$PATH_SEPARATOR\nfor as_dir in $PATH\ndo\n  IFS=$as_save_IFS\n  test -z \"$as_dir\" && as_dir=.\n    for ac_exec_ext in '' $ac_executable_extensions; do\n  if as_fn_executable_p \"$as_dir/$ac_word$ac_exec_ext\"; then\n    ac_cv_prog_ac_ct_DSYMUTIL=\"dsymutil\"\n    $as_echo \"$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext\" >&5\n    break 2\n  fi\ndone\n  done\nIFS=$as_save_IFS\n\nfi\nfi\nac_ct_DSYMUTIL=$ac_cv_prog_ac_ct_DSYMUTIL\nif test -n \"$ac_ct_DSYMUTIL\"; then\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: $ac_ct_DSYMUTIL\" >&5\n$as_echo \"$ac_ct_DSYMUTIL\" >&6; }\nelse\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: no\" >&5\n$as_echo \"no\" >&6; }\nfi\n\n  if test \"x$ac_ct_DSYMUTIL\" = x; then\n    DSYMUTIL=\":\"\n  else\n    case $cross_compiling:$ac_tool_warned in\nyes:)\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet\" >&5\n$as_echo \"$as_me: WARNING: using cross tools not prefixed with host triplet\" >&2;}\nac_tool_warned=yes ;;\nesac\n    DSYMUTIL=$ac_ct_DSYMUTIL\n  fi\nelse\n  DSYMUTIL=\"$ac_cv_prog_DSYMUTIL\"\nfi\n\n    if test -n \"$ac_tool_prefix\"; then\n  # Extract the first word of \"${ac_tool_prefix}nmedit\", so it can be a program name with args.\nset dummy ${ac_tool_prefix}nmedit; ac_word=$2\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for $ac_word\" >&5\n$as_echo_n \"checking for $ac_word... \" >&6; }\nif ${ac_cv_prog_NMEDIT+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  if test -n \"$NMEDIT\"; then\n  ac_cv_prog_NMEDIT=\"$NMEDIT\" # Let the user override the test.\nelse\nas_save_IFS=$IFS; IFS=$PATH_SEPARATOR\nfor as_dir in $PATH\ndo\n  IFS=$as_save_IFS\n  test -z \"$as_dir\" && as_dir=.\n    for ac_exec_ext in '' $ac_executable_extensions; do\n  if as_fn_executable_p \"$as_dir/$ac_word$ac_exec_ext\"; then\n    ac_cv_prog_NMEDIT=\"${ac_tool_prefix}nmedit\"\n    $as_echo \"$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext\" >&5\n    break 2\n  fi\ndone\n  done\nIFS=$as_save_IFS\n\nfi\nfi\nNMEDIT=$ac_cv_prog_NMEDIT\nif test -n \"$NMEDIT\"; then\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: $NMEDIT\" >&5\n$as_echo \"$NMEDIT\" >&6; }\nelse\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: no\" >&5\n$as_echo \"no\" >&6; }\nfi\n\n\nfi\nif test -z \"$ac_cv_prog_NMEDIT\"; then\n  ac_ct_NMEDIT=$NMEDIT\n  # Extract the first word of \"nmedit\", so it can be a program name with args.\nset dummy nmedit; ac_word=$2\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for $ac_word\" >&5\n$as_echo_n \"checking for $ac_word... \" >&6; }\nif ${ac_cv_prog_ac_ct_NMEDIT+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  if test -n \"$ac_ct_NMEDIT\"; then\n  ac_cv_prog_ac_ct_NMEDIT=\"$ac_ct_NMEDIT\" # Let the user override the test.\nelse\nas_save_IFS=$IFS; IFS=$PATH_SEPARATOR\nfor as_dir in $PATH\ndo\n  IFS=$as_save_IFS\n  test -z \"$as_dir\" && as_dir=.\n    for ac_exec_ext in '' $ac_executable_extensions; do\n  if as_fn_executable_p \"$as_dir/$ac_word$ac_exec_ext\"; then\n    ac_cv_prog_ac_ct_NMEDIT=\"nmedit\"\n    $as_echo \"$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext\" >&5\n    break 2\n  fi\ndone\n  done\nIFS=$as_save_IFS\n\nfi\nfi\nac_ct_NMEDIT=$ac_cv_prog_ac_ct_NMEDIT\nif test -n \"$ac_ct_NMEDIT\"; then\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: $ac_ct_NMEDIT\" >&5\n$as_echo \"$ac_ct_NMEDIT\" >&6; }\nelse\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: no\" >&5\n$as_echo \"no\" >&6; }\nfi\n\n  if test \"x$ac_ct_NMEDIT\" = x; then\n    NMEDIT=\":\"\n  else\n    case $cross_compiling:$ac_tool_warned in\nyes:)\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet\" >&5\n$as_echo \"$as_me: WARNING: using cross tools not prefixed with host triplet\" >&2;}\nac_tool_warned=yes ;;\nesac\n    NMEDIT=$ac_ct_NMEDIT\n  fi\nelse\n  NMEDIT=\"$ac_cv_prog_NMEDIT\"\nfi\n\n    if test -n \"$ac_tool_prefix\"; then\n  # Extract the first word of \"${ac_tool_prefix}lipo\", so it can be a program name with args.\nset dummy ${ac_tool_prefix}lipo; ac_word=$2\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for $ac_word\" >&5\n$as_echo_n \"checking for $ac_word... \" >&6; }\nif ${ac_cv_prog_LIPO+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  if test -n \"$LIPO\"; then\n  ac_cv_prog_LIPO=\"$LIPO\" # Let the user override the test.\nelse\nas_save_IFS=$IFS; IFS=$PATH_SEPARATOR\nfor as_dir in $PATH\ndo\n  IFS=$as_save_IFS\n  test -z \"$as_dir\" && as_dir=.\n    for ac_exec_ext in '' $ac_executable_extensions; do\n  if as_fn_executable_p \"$as_dir/$ac_word$ac_exec_ext\"; then\n    ac_cv_prog_LIPO=\"${ac_tool_prefix}lipo\"\n    $as_echo \"$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext\" >&5\n    break 2\n  fi\ndone\n  done\nIFS=$as_save_IFS\n\nfi\nfi\nLIPO=$ac_cv_prog_LIPO\nif test -n \"$LIPO\"; then\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: $LIPO\" >&5\n$as_echo \"$LIPO\" >&6; }\nelse\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: no\" >&5\n$as_echo \"no\" >&6; }\nfi\n\n\nfi\nif test -z \"$ac_cv_prog_LIPO\"; then\n  ac_ct_LIPO=$LIPO\n  # Extract the first word of \"lipo\", so it can be a program name with args.\nset dummy lipo; ac_word=$2\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for $ac_word\" >&5\n$as_echo_n \"checking for $ac_word... \" >&6; }\nif ${ac_cv_prog_ac_ct_LIPO+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  if test -n \"$ac_ct_LIPO\"; then\n  ac_cv_prog_ac_ct_LIPO=\"$ac_ct_LIPO\" # Let the user override the test.\nelse\nas_save_IFS=$IFS; IFS=$PATH_SEPARATOR\nfor as_dir in $PATH\ndo\n  IFS=$as_save_IFS\n  test -z \"$as_dir\" && as_dir=.\n    for ac_exec_ext in '' $ac_executable_extensions; do\n  if as_fn_executable_p \"$as_dir/$ac_word$ac_exec_ext\"; then\n    ac_cv_prog_ac_ct_LIPO=\"lipo\"\n    $as_echo \"$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext\" >&5\n    break 2\n  fi\ndone\n  done\nIFS=$as_save_IFS\n\nfi\nfi\nac_ct_LIPO=$ac_cv_prog_ac_ct_LIPO\nif test -n \"$ac_ct_LIPO\"; then\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: $ac_ct_LIPO\" >&5\n$as_echo \"$ac_ct_LIPO\" >&6; }\nelse\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: no\" >&5\n$as_echo \"no\" >&6; }\nfi\n\n  if test \"x$ac_ct_LIPO\" = x; then\n    LIPO=\":\"\n  else\n    case $cross_compiling:$ac_tool_warned in\nyes:)\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet\" >&5\n$as_echo \"$as_me: WARNING: using cross tools not prefixed with host triplet\" >&2;}\nac_tool_warned=yes ;;\nesac\n    LIPO=$ac_ct_LIPO\n  fi\nelse\n  LIPO=\"$ac_cv_prog_LIPO\"\nfi\n\n    if test -n \"$ac_tool_prefix\"; then\n  # Extract the first word of \"${ac_tool_prefix}otool\", so it can be a program name with args.\nset dummy ${ac_tool_prefix}otool; ac_word=$2\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for $ac_word\" >&5\n$as_echo_n \"checking for $ac_word... \" >&6; }\nif ${ac_cv_prog_OTOOL+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  if test -n \"$OTOOL\"; then\n  ac_cv_prog_OTOOL=\"$OTOOL\" # Let the user override the test.\nelse\nas_save_IFS=$IFS; IFS=$PATH_SEPARATOR\nfor as_dir in $PATH\ndo\n  IFS=$as_save_IFS\n  test -z \"$as_dir\" && as_dir=.\n    for ac_exec_ext in '' $ac_executable_extensions; do\n  if as_fn_executable_p \"$as_dir/$ac_word$ac_exec_ext\"; then\n    ac_cv_prog_OTOOL=\"${ac_tool_prefix}otool\"\n    $as_echo \"$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext\" >&5\n    break 2\n  fi\ndone\n  done\nIFS=$as_save_IFS\n\nfi\nfi\nOTOOL=$ac_cv_prog_OTOOL\nif test -n \"$OTOOL\"; then\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: $OTOOL\" >&5\n$as_echo \"$OTOOL\" >&6; }\nelse\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: no\" >&5\n$as_echo \"no\" >&6; }\nfi\n\n\nfi\nif test -z \"$ac_cv_prog_OTOOL\"; then\n  ac_ct_OTOOL=$OTOOL\n  # Extract the first word of \"otool\", so it can be a program name with args.\nset dummy otool; ac_word=$2\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for $ac_word\" >&5\n$as_echo_n \"checking for $ac_word... \" >&6; }\nif ${ac_cv_prog_ac_ct_OTOOL+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  if test -n \"$ac_ct_OTOOL\"; then\n  ac_cv_prog_ac_ct_OTOOL=\"$ac_ct_OTOOL\" # Let the user override the test.\nelse\nas_save_IFS=$IFS; IFS=$PATH_SEPARATOR\nfor as_dir in $PATH\ndo\n  IFS=$as_save_IFS\n  test -z \"$as_dir\" && as_dir=.\n    for ac_exec_ext in '' $ac_executable_extensions; do\n  if as_fn_executable_p \"$as_dir/$ac_word$ac_exec_ext\"; then\n    ac_cv_prog_ac_ct_OTOOL=\"otool\"\n    $as_echo \"$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext\" >&5\n    break 2\n  fi\ndone\n  done\nIFS=$as_save_IFS\n\nfi\nfi\nac_ct_OTOOL=$ac_cv_prog_ac_ct_OTOOL\nif test -n \"$ac_ct_OTOOL\"; then\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: $ac_ct_OTOOL\" >&5\n$as_echo \"$ac_ct_OTOOL\" >&6; }\nelse\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: no\" >&5\n$as_echo \"no\" >&6; }\nfi\n\n  if test \"x$ac_ct_OTOOL\" = x; then\n    OTOOL=\":\"\n  else\n    case $cross_compiling:$ac_tool_warned in\nyes:)\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet\" >&5\n$as_echo \"$as_me: WARNING: using cross tools not prefixed with host triplet\" >&2;}\nac_tool_warned=yes ;;\nesac\n    OTOOL=$ac_ct_OTOOL\n  fi\nelse\n  OTOOL=\"$ac_cv_prog_OTOOL\"\nfi\n\n    if test -n \"$ac_tool_prefix\"; then\n  # Extract the first word of \"${ac_tool_prefix}otool64\", so it can be a program name with args.\nset dummy ${ac_tool_prefix}otool64; ac_word=$2\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for $ac_word\" >&5\n$as_echo_n \"checking for $ac_word... \" >&6; }\nif ${ac_cv_prog_OTOOL64+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  if test -n \"$OTOOL64\"; then\n  ac_cv_prog_OTOOL64=\"$OTOOL64\" # Let the user override the test.\nelse\nas_save_IFS=$IFS; IFS=$PATH_SEPARATOR\nfor as_dir in $PATH\ndo\n  IFS=$as_save_IFS\n  test -z \"$as_dir\" && as_dir=.\n    for ac_exec_ext in '' $ac_executable_extensions; do\n  if as_fn_executable_p \"$as_dir/$ac_word$ac_exec_ext\"; then\n    ac_cv_prog_OTOOL64=\"${ac_tool_prefix}otool64\"\n    $as_echo \"$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext\" >&5\n    break 2\n  fi\ndone\n  done\nIFS=$as_save_IFS\n\nfi\nfi\nOTOOL64=$ac_cv_prog_OTOOL64\nif test -n \"$OTOOL64\"; then\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: $OTOOL64\" >&5\n$as_echo \"$OTOOL64\" >&6; }\nelse\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: no\" >&5\n$as_echo \"no\" >&6; }\nfi\n\n\nfi\nif test -z \"$ac_cv_prog_OTOOL64\"; then\n  ac_ct_OTOOL64=$OTOOL64\n  # Extract the first word of \"otool64\", so it can be a program name with args.\nset dummy otool64; ac_word=$2\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for $ac_word\" >&5\n$as_echo_n \"checking for $ac_word... \" >&6; }\nif ${ac_cv_prog_ac_ct_OTOOL64+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  if test -n \"$ac_ct_OTOOL64\"; then\n  ac_cv_prog_ac_ct_OTOOL64=\"$ac_ct_OTOOL64\" # Let the user override the test.\nelse\nas_save_IFS=$IFS; IFS=$PATH_SEPARATOR\nfor as_dir in $PATH\ndo\n  IFS=$as_save_IFS\n  test -z \"$as_dir\" && as_dir=.\n    for ac_exec_ext in '' $ac_executable_extensions; do\n  if as_fn_executable_p \"$as_dir/$ac_word$ac_exec_ext\"; then\n    ac_cv_prog_ac_ct_OTOOL64=\"otool64\"\n    $as_echo \"$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext\" >&5\n    break 2\n  fi\ndone\n  done\nIFS=$as_save_IFS\n\nfi\nfi\nac_ct_OTOOL64=$ac_cv_prog_ac_ct_OTOOL64\nif test -n \"$ac_ct_OTOOL64\"; then\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: $ac_ct_OTOOL64\" >&5\n$as_echo \"$ac_ct_OTOOL64\" >&6; }\nelse\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: no\" >&5\n$as_echo \"no\" >&6; }\nfi\n\n  if test \"x$ac_ct_OTOOL64\" = x; then\n    OTOOL64=\":\"\n  else\n    case $cross_compiling:$ac_tool_warned in\nyes:)\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet\" >&5\n$as_echo \"$as_me: WARNING: using cross tools not prefixed with host triplet\" >&2;}\nac_tool_warned=yes ;;\nesac\n    OTOOL64=$ac_ct_OTOOL64\n  fi\nelse\n  OTOOL64=\"$ac_cv_prog_OTOOL64\"\nfi\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n    { $as_echo \"$as_me:${as_lineno-$LINENO}: checking for -single_module linker flag\" >&5\n$as_echo_n \"checking for -single_module linker flag... \" >&6; }\nif ${lt_cv_apple_cc_single_mod+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  lt_cv_apple_cc_single_mod=no\n      if test -z \"$LT_MULTI_MODULE\"; then\n\t# By default we will add the -single_module flag. You can override\n\t# by either setting the environment variable LT_MULTI_MODULE\n\t# non-empty at configure time, or by adding -multi_module to the\n\t# link flags.\n\trm -rf libconftest.dylib*\n\techo \"int foo(void){return 1;}\" > conftest.c\n\techo \"$LTCC $LTCFLAGS $LDFLAGS -o libconftest.dylib \\\n-dynamiclib -Wl,-single_module conftest.c\" >&5\n\t$LTCC $LTCFLAGS $LDFLAGS -o libconftest.dylib \\\n\t  -dynamiclib -Wl,-single_module conftest.c 2>conftest.err\n        _lt_result=$?\n\t# If there is a non-empty error log, and \"single_module\"\n\t# appears in it, assume the flag caused a linker warning\n        if test -s conftest.err && $GREP single_module conftest.err; then\n\t  cat conftest.err >&5\n\t# Otherwise, if the output was created with a 0 exit code from\n\t# the compiler, it worked.\n\telif test -f libconftest.dylib && test 0 = \"$_lt_result\"; then\n\t  lt_cv_apple_cc_single_mod=yes\n\telse\n\t  cat conftest.err >&5\n\tfi\n\trm -rf libconftest.dylib*\n\trm -f conftest.*\n      fi\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $lt_cv_apple_cc_single_mod\" >&5\n$as_echo \"$lt_cv_apple_cc_single_mod\" >&6; }\n\n    { $as_echo \"$as_me:${as_lineno-$LINENO}: checking for -exported_symbols_list linker flag\" >&5\n$as_echo_n \"checking for -exported_symbols_list linker flag... \" >&6; }\nif ${lt_cv_ld_exported_symbols_list+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  lt_cv_ld_exported_symbols_list=no\n      save_LDFLAGS=$LDFLAGS\n      echo \"_main\" > conftest.sym\n      LDFLAGS=\"$LDFLAGS -Wl,-exported_symbols_list,conftest.sym\"\n      cat confdefs.h - <<_ACEOF >conftest.$ac_ext\n/* end confdefs.h.  */\n\nint\nmain ()\n{\n\n  ;\n  return 0;\n}\n_ACEOF\nif ac_fn_c_try_link \"$LINENO\"; then :\n  lt_cv_ld_exported_symbols_list=yes\nelse\n  lt_cv_ld_exported_symbols_list=no\nfi\nrm -f core conftest.err conftest.$ac_objext \\\n    conftest$ac_exeext conftest.$ac_ext\n\tLDFLAGS=$save_LDFLAGS\n\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $lt_cv_ld_exported_symbols_list\" >&5\n$as_echo \"$lt_cv_ld_exported_symbols_list\" >&6; }\n\n    { $as_echo \"$as_me:${as_lineno-$LINENO}: checking for -force_load linker flag\" >&5\n$as_echo_n \"checking for -force_load linker flag... \" >&6; }\nif ${lt_cv_ld_force_load+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  lt_cv_ld_force_load=no\n      cat > conftest.c << _LT_EOF\nint forced_loaded() { return 2;}\n_LT_EOF\n      echo \"$LTCC $LTCFLAGS -c -o conftest.o conftest.c\" >&5\n      $LTCC $LTCFLAGS -c -o conftest.o conftest.c 2>&5\n      echo \"$AR cru libconftest.a conftest.o\" >&5\n      $AR cru libconftest.a conftest.o 2>&5\n      echo \"$RANLIB libconftest.a\" >&5\n      $RANLIB libconftest.a 2>&5\n      cat > conftest.c << _LT_EOF\nint main() { return 0;}\n_LT_EOF\n      echo \"$LTCC $LTCFLAGS $LDFLAGS -o conftest conftest.c -Wl,-force_load,./libconftest.a\" >&5\n      $LTCC $LTCFLAGS $LDFLAGS -o conftest conftest.c -Wl,-force_load,./libconftest.a 2>conftest.err\n      _lt_result=$?\n      if test -s conftest.err && $GREP force_load conftest.err; then\n\tcat conftest.err >&5\n      elif test -f conftest && test 0 = \"$_lt_result\" && $GREP forced_load conftest >/dev/null 2>&1; then\n\tlt_cv_ld_force_load=yes\n      else\n\tcat conftest.err >&5\n      fi\n        rm -f conftest.err libconftest.a conftest conftest.c\n        rm -rf conftest.dSYM\n\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $lt_cv_ld_force_load\" >&5\n$as_echo \"$lt_cv_ld_force_load\" >&6; }\n    case $host_os in\n    rhapsody* | darwin1.[012])\n      _lt_dar_allow_undefined='$wl-undefined ${wl}suppress' ;;\n    darwin1.*)\n      _lt_dar_allow_undefined='$wl-flat_namespace $wl-undefined ${wl}suppress' ;;\n    darwin*) # darwin 5.x on\n      # if running on 10.5 or later, the deployment target defaults\n      # to the OS version, if on x86, and 10.4, the deployment\n      # target defaults to 10.4. Don't you love it?\n      case ${MACOSX_DEPLOYMENT_TARGET-10.0},$host in\n\t10.0,*86*-darwin8*|10.0,*-darwin[91]*)\n\t  _lt_dar_allow_undefined='$wl-undefined ${wl}dynamic_lookup' ;;\n\t10.[012][,.]*)\n\t  _lt_dar_allow_undefined='$wl-flat_namespace $wl-undefined ${wl}suppress' ;;\n\t10.*)\n\t  _lt_dar_allow_undefined='$wl-undefined ${wl}dynamic_lookup' ;;\n      esac\n    ;;\n  esac\n    if test yes = \"$lt_cv_apple_cc_single_mod\"; then\n      _lt_dar_single_mod='$single_module'\n    fi\n    if test yes = \"$lt_cv_ld_exported_symbols_list\"; then\n      _lt_dar_export_syms=' $wl-exported_symbols_list,$output_objdir/$libname-symbols.expsym'\n    else\n      _lt_dar_export_syms='~$NMEDIT -s $output_objdir/$libname-symbols.expsym $lib'\n    fi\n    if test : != \"$DSYMUTIL\" && test no = \"$lt_cv_ld_force_load\"; then\n      _lt_dsymutil='~$DSYMUTIL $lib || :'\n    else\n      _lt_dsymutil=\n    fi\n    ;;\n  esac\n\n# func_munge_path_list VARIABLE PATH\n# -----------------------------------\n# VARIABLE is name of variable containing _space_ separated list of\n# directories to be munged by the contents of PATH, which is string\n# having a format:\n# \"DIR[:DIR]:\"\n#       string \"DIR[ DIR]\" will be prepended to VARIABLE\n# \":DIR[:DIR]\"\n#       string \"DIR[ DIR]\" will be appended to VARIABLE\n# \"DIRP[:DIRP]::[DIRA:]DIRA\"\n#       string \"DIRP[ DIRP]\" will be prepended to VARIABLE and string\n#       \"DIRA[ DIRA]\" will be appended to VARIABLE\n# \"DIR[:DIR]\"\n#       VARIABLE will be replaced by \"DIR[ DIR]\"\nfunc_munge_path_list ()\n{\n    case x$2 in\n    x)\n        ;;\n    *:)\n        eval $1=\\\"`$ECHO $2 | $SED 's/:/ /g'` \\$$1\\\"\n        ;;\n    x:*)\n        eval $1=\\\"\\$$1 `$ECHO $2 | $SED 's/:/ /g'`\\\"\n        ;;\n    *::*)\n        eval $1=\\\"\\$$1\\ `$ECHO $2 | $SED -e 's/.*:://' -e 's/:/ /g'`\\\"\n        eval $1=\\\"`$ECHO $2 | $SED -e 's/::.*//' -e 's/:/ /g'`\\ \\$$1\\\"\n        ;;\n    *)\n        eval $1=\\\"`$ECHO $2 | $SED 's/:/ /g'`\\\"\n        ;;\n    esac\n}\n\nac_ext=c\nac_cpp='$CPP $CPPFLAGS'\nac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5'\nac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5'\nac_compiler_gnu=$ac_cv_c_compiler_gnu\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking how to run the C preprocessor\" >&5\n$as_echo_n \"checking how to run the C preprocessor... \" >&6; }\n# On Suns, sometimes $CPP names a directory.\nif test -n \"$CPP\" && test -d \"$CPP\"; then\n  CPP=\nfi\nif test -z \"$CPP\"; then\n  if ${ac_cv_prog_CPP+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n      # Double quotes because CPP needs to be expanded\n    for CPP in \"$CC -E\" \"$CC -E -traditional-cpp\" \"/lib/cpp\"\n    do\n      ac_preproc_ok=false\nfor ac_c_preproc_warn_flag in '' yes\ndo\n  # Use a header file that comes with gcc, so configuring glibc\n  # with a fresh cross-compiler works.\n  # Prefer <limits.h> to <assert.h> if __STDC__ is defined, since\n  # <limits.h> exists even on freestanding compilers.\n  # On the NeXT, cc -E runs the code through the compiler's parser,\n  # not just through cpp. \"Syntax error\" is here to catch this case.\n  cat confdefs.h - <<_ACEOF >conftest.$ac_ext\n/* end confdefs.h.  */\n#ifdef __STDC__\n# include <limits.h>\n#else\n# include <assert.h>\n#endif\n\t\t     Syntax error\n_ACEOF\nif ac_fn_c_try_cpp \"$LINENO\"; then :\n\nelse\n  # Broken: fails on valid input.\ncontinue\nfi\nrm -f conftest.err conftest.i conftest.$ac_ext\n\n  # OK, works on sane cases.  Now check whether nonexistent headers\n  # can be detected and how.\n  cat confdefs.h - <<_ACEOF >conftest.$ac_ext\n/* end confdefs.h.  */\n#include <ac_nonexistent.h>\n_ACEOF\nif ac_fn_c_try_cpp \"$LINENO\"; then :\n  # Broken: success on invalid input.\ncontinue\nelse\n  # Passes both tests.\nac_preproc_ok=:\nbreak\nfi\nrm -f conftest.err conftest.i conftest.$ac_ext\n\ndone\n# Because of `break', _AC_PREPROC_IFELSE's cleaning code was skipped.\nrm -f conftest.i conftest.err conftest.$ac_ext\nif $ac_preproc_ok; then :\n  break\nfi\n\n    done\n    ac_cv_prog_CPP=$CPP\n\nfi\n  CPP=$ac_cv_prog_CPP\nelse\n  ac_cv_prog_CPP=$CPP\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $CPP\" >&5\n$as_echo \"$CPP\" >&6; }\nac_preproc_ok=false\nfor ac_c_preproc_warn_flag in '' yes\ndo\n  # Use a header file that comes with gcc, so configuring glibc\n  # with a fresh cross-compiler works.\n  # Prefer <limits.h> to <assert.h> if __STDC__ is defined, since\n  # <limits.h> exists even on freestanding compilers.\n  # On the NeXT, cc -E runs the code through the compiler's parser,\n  # not just through cpp. \"Syntax error\" is here to catch this case.\n  cat confdefs.h - <<_ACEOF >conftest.$ac_ext\n/* end confdefs.h.  */\n#ifdef __STDC__\n# include <limits.h>\n#else\n# include <assert.h>\n#endif\n\t\t     Syntax error\n_ACEOF\nif ac_fn_c_try_cpp \"$LINENO\"; then :\n\nelse\n  # Broken: fails on valid input.\ncontinue\nfi\nrm -f conftest.err conftest.i conftest.$ac_ext\n\n  # OK, works on sane cases.  Now check whether nonexistent headers\n  # can be detected and how.\n  cat confdefs.h - <<_ACEOF >conftest.$ac_ext\n/* end confdefs.h.  */\n#include <ac_nonexistent.h>\n_ACEOF\nif ac_fn_c_try_cpp \"$LINENO\"; then :\n  # Broken: success on invalid input.\ncontinue\nelse\n  # Passes both tests.\nac_preproc_ok=:\nbreak\nfi\nrm -f conftest.err conftest.i conftest.$ac_ext\n\ndone\n# Because of `break', _AC_PREPROC_IFELSE's cleaning code was skipped.\nrm -f conftest.i conftest.err conftest.$ac_ext\nif $ac_preproc_ok; then :\n\nelse\n  { { $as_echo \"$as_me:${as_lineno-$LINENO}: error: in \\`$ac_pwd':\" >&5\n$as_echo \"$as_me: error: in \\`$ac_pwd':\" >&2;}\nas_fn_error $? \"C preprocessor \\\"$CPP\\\" fails sanity check\nSee \\`config.log' for more details\" \"$LINENO\" 5; }\nfi\n\nac_ext=c\nac_cpp='$CPP $CPPFLAGS'\nac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5'\nac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5'\nac_compiler_gnu=$ac_cv_c_compiler_gnu\n\n\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for ANSI C header files\" >&5\n$as_echo_n \"checking for ANSI C header files... \" >&6; }\nif ${ac_cv_header_stdc+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  cat confdefs.h - <<_ACEOF >conftest.$ac_ext\n/* end confdefs.h.  */\n#include <stdlib.h>\n#include <stdarg.h>\n#include <string.h>\n#include <float.h>\n\nint\nmain ()\n{\n\n  ;\n  return 0;\n}\n_ACEOF\nif ac_fn_c_try_compile \"$LINENO\"; then :\n  ac_cv_header_stdc=yes\nelse\n  ac_cv_header_stdc=no\nfi\nrm -f core conftest.err conftest.$ac_objext conftest.$ac_ext\n\nif test $ac_cv_header_stdc = yes; then\n  # SunOS 4.x string.h does not declare mem*, contrary to ANSI.\n  cat confdefs.h - <<_ACEOF >conftest.$ac_ext\n/* end confdefs.h.  */\n#include <string.h>\n\n_ACEOF\nif (eval \"$ac_cpp conftest.$ac_ext\") 2>&5 |\n  $EGREP \"memchr\" >/dev/null 2>&1; then :\n\nelse\n  ac_cv_header_stdc=no\nfi\nrm -f conftest*\n\nfi\n\nif test $ac_cv_header_stdc = yes; then\n  # ISC 2.0.2 stdlib.h does not declare free, contrary to ANSI.\n  cat confdefs.h - <<_ACEOF >conftest.$ac_ext\n/* end confdefs.h.  */\n#include <stdlib.h>\n\n_ACEOF\nif (eval \"$ac_cpp conftest.$ac_ext\") 2>&5 |\n  $EGREP \"free\" >/dev/null 2>&1; then :\n\nelse\n  ac_cv_header_stdc=no\nfi\nrm -f conftest*\n\nfi\n\nif test $ac_cv_header_stdc = yes; then\n  # /bin/cc in Irix-4.0.5 gets non-ANSI ctype macros unless using -ansi.\n  if test \"$cross_compiling\" = yes; then :\n  :\nelse\n  cat confdefs.h - <<_ACEOF >conftest.$ac_ext\n/* end confdefs.h.  */\n#include <ctype.h>\n#include <stdlib.h>\n#if ((' ' & 0x0FF) == 0x020)\n# define ISLOWER(c) ('a' <= (c) && (c) <= 'z')\n# define TOUPPER(c) (ISLOWER(c) ? 'A' + ((c) - 'a') : (c))\n#else\n# define ISLOWER(c) \\\n\t\t   (('a' <= (c) && (c) <= 'i') \\\n\t\t     || ('j' <= (c) && (c) <= 'r') \\\n\t\t     || ('s' <= (c) && (c) <= 'z'))\n# define TOUPPER(c) (ISLOWER(c) ? ((c) | 0x40) : (c))\n#endif\n\n#define XOR(e, f) (((e) && !(f)) || (!(e) && (f)))\nint\nmain ()\n{\n  int i;\n  for (i = 0; i < 256; i++)\n    if (XOR (islower (i), ISLOWER (i))\n\t|| toupper (i) != TOUPPER (i))\n      return 2;\n  return 0;\n}\n_ACEOF\nif ac_fn_c_try_run \"$LINENO\"; then :\n\nelse\n  ac_cv_header_stdc=no\nfi\nrm -f core *.core core.conftest.* gmon.out bb.out conftest$ac_exeext \\\n  conftest.$ac_objext conftest.beam conftest.$ac_ext\nfi\n\nfi\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $ac_cv_header_stdc\" >&5\n$as_echo \"$ac_cv_header_stdc\" >&6; }\nif test $ac_cv_header_stdc = yes; then\n\n$as_echo \"#define STDC_HEADERS 1\" >>confdefs.h\n\nfi\n\n# On IRIX 5.3, sys/types and inttypes.h are conflicting.\nfor ac_header in sys/types.h sys/stat.h stdlib.h string.h memory.h strings.h \\\n\t\t  inttypes.h stdint.h unistd.h\ndo :\n  as_ac_Header=`$as_echo \"ac_cv_header_$ac_header\" | $as_tr_sh`\nac_fn_c_check_header_compile \"$LINENO\" \"$ac_header\" \"$as_ac_Header\" \"$ac_includes_default\n\"\nif eval test \\\"x\\$\"$as_ac_Header\"\\\" = x\"yes\"; then :\n  cat >>confdefs.h <<_ACEOF\n#define `$as_echo \"HAVE_$ac_header\" | $as_tr_cpp` 1\n_ACEOF\n\nfi\n\ndone\n\n\nfor ac_header in dlfcn.h\ndo :\n  ac_fn_c_check_header_compile \"$LINENO\" \"dlfcn.h\" \"ac_cv_header_dlfcn_h\" \"$ac_includes_default\n\"\nif test \"x$ac_cv_header_dlfcn_h\" = xyes; then :\n  cat >>confdefs.h <<_ACEOF\n#define HAVE_DLFCN_H 1\n_ACEOF\n\nfi\n\ndone\n\n\n\n\nfunc_stripname_cnf ()\n{\n  case $2 in\n  .*) func_stripname_result=`$ECHO \"$3\" | $SED \"s%^$1%%; s%\\\\\\\\$2\\$%%\"`;;\n  *)  func_stripname_result=`$ECHO \"$3\" | $SED \"s%^$1%%; s%$2\\$%%\"`;;\n  esac\n} # func_stripname_cnf\n\n\n\n\n\n# Set options\n\n\n\n        enable_dlopen=no\n\n\n  enable_win32_dll=no\n\n\n            # Check whether --enable-shared was given.\nif test \"${enable_shared+set}\" = set; then :\n  enableval=$enable_shared; p=${PACKAGE-default}\n    case $enableval in\n    yes) enable_shared=yes ;;\n    no) enable_shared=no ;;\n    *)\n      enable_shared=no\n      # Look at the argument we got.  We use all the common list separators.\n      lt_save_ifs=$IFS; IFS=$IFS$PATH_SEPARATOR,\n      for pkg in $enableval; do\n\tIFS=$lt_save_ifs\n\tif test \"X$pkg\" = \"X$p\"; then\n\t  enable_shared=yes\n\tfi\n      done\n      IFS=$lt_save_ifs\n      ;;\n    esac\nelse\n  enable_shared=yes\nfi\n\n\n\n\n\n\n\n\n\n\n\n# Check whether --with-pic was given.\nif test \"${with_pic+set}\" = set; then :\n  withval=$with_pic; lt_p=${PACKAGE-default}\n    case $withval in\n    yes|no) pic_mode=$withval ;;\n    *)\n      pic_mode=default\n      # Look at the argument we got.  We use all the common list separators.\n      lt_save_ifs=$IFS; IFS=$IFS$PATH_SEPARATOR,\n      for lt_pkg in $withval; do\n\tIFS=$lt_save_ifs\n\tif test \"X$lt_pkg\" = \"X$lt_p\"; then\n\t  pic_mode=yes\n\tfi\n      done\n      IFS=$lt_save_ifs\n      ;;\n    esac\nelse\n  pic_mode=default\nfi\n\n\n\n\n\n\n\n\n  # Check whether --enable-fast-install was given.\nif test \"${enable_fast_install+set}\" = set; then :\n  enableval=$enable_fast_install; p=${PACKAGE-default}\n    case $enableval in\n    yes) enable_fast_install=yes ;;\n    no) enable_fast_install=no ;;\n    *)\n      enable_fast_install=no\n      # Look at the argument we got.  We use all the common list separators.\n      lt_save_ifs=$IFS; IFS=$IFS$PATH_SEPARATOR,\n      for pkg in $enableval; do\n\tIFS=$lt_save_ifs\n\tif test \"X$pkg\" = \"X$p\"; then\n\t  enable_fast_install=yes\n\tfi\n      done\n      IFS=$lt_save_ifs\n      ;;\n    esac\nelse\n  enable_fast_install=yes\nfi\n\n\n\n\n\n\n\n\n  shared_archive_member_spec=\ncase $host,$enable_shared in\npower*-*-aix[5-9]*,yes)\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: checking which variant of shared library versioning to provide\" >&5\n$as_echo_n \"checking which variant of shared library versioning to provide... \" >&6; }\n\n# Check whether --with-aix-soname was given.\nif test \"${with_aix_soname+set}\" = set; then :\n  withval=$with_aix_soname; case $withval in\n    aix|svr4|both)\n      ;;\n    *)\n      as_fn_error $? \"Unknown argument to --with-aix-soname\" \"$LINENO\" 5\n      ;;\n    esac\n    lt_cv_with_aix_soname=$with_aix_soname\nelse\n  if ${lt_cv_with_aix_soname+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  lt_cv_with_aix_soname=aix\nfi\n\n    with_aix_soname=$lt_cv_with_aix_soname\nfi\n\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: $with_aix_soname\" >&5\n$as_echo \"$with_aix_soname\" >&6; }\n  if test aix != \"$with_aix_soname\"; then\n    # For the AIX way of multilib, we name the shared archive member\n    # based on the bitwidth used, traditionally 'shr.o' or 'shr_64.o',\n    # and 'shr.imp' or 'shr_64.imp', respectively, for the Import File.\n    # Even when GNU compilers ignore OBJECT_MODE but need '-maix64' flag,\n    # the AIX toolchain works better with OBJECT_MODE set (default 32).\n    if test 64 = \"${OBJECT_MODE-32}\"; then\n      shared_archive_member_spec=shr_64\n    else\n      shared_archive_member_spec=shr\n    fi\n  fi\n  ;;\n*)\n  with_aix_soname=aix\n  ;;\nesac\n\n\n\n\n\n\n\n\n\n\n# This can be used to rebuild libtool when needed\nLIBTOOL_DEPS=$ltmain\n\n# Always use our own libtool.\nLIBTOOL='$(SHELL) $(top_builddir)/libtool'\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\ntest -z \"$LN_S\" && LN_S=\"ln -s\"\n\n\n\n\n\n\n\n\n\n\n\n\n\n\nif test -n \"${ZSH_VERSION+set}\"; then\n   setopt NO_GLOB_SUBST\nfi\n\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for objdir\" >&5\n$as_echo_n \"checking for objdir... \" >&6; }\nif ${lt_cv_objdir+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  rm -f .libs 2>/dev/null\nmkdir .libs 2>/dev/null\nif test -d .libs; then\n  lt_cv_objdir=.libs\nelse\n  # MS-DOS does not allow filenames that begin with a dot.\n  lt_cv_objdir=_libs\nfi\nrmdir .libs 2>/dev/null\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $lt_cv_objdir\" >&5\n$as_echo \"$lt_cv_objdir\" >&6; }\nobjdir=$lt_cv_objdir\n\n\n\n\n\ncat >>confdefs.h <<_ACEOF\n#define LT_OBJDIR \"$lt_cv_objdir/\"\n_ACEOF\n\n\n\n\ncase $host_os in\naix3*)\n  # AIX sometimes has problems with the GCC collect2 program.  For some\n  # reason, if we set the COLLECT_NAMES environment variable, the problems\n  # vanish in a puff of smoke.\n  if test set != \"${COLLECT_NAMES+set}\"; then\n    COLLECT_NAMES=\n    export COLLECT_NAMES\n  fi\n  ;;\nesac\n\n# Global variables:\nofile=libtool\ncan_build_shared=yes\n\n# All known linkers require a '.a' archive for static linking (except MSVC,\n# which needs '.lib').\nlibext=a\n\nwith_gnu_ld=$lt_cv_prog_gnu_ld\n\nold_CC=$CC\nold_CFLAGS=$CFLAGS\n\n# Set sane defaults for various variables\ntest -z \"$CC\" && CC=cc\ntest -z \"$LTCC\" && LTCC=$CC\ntest -z \"$LTCFLAGS\" && LTCFLAGS=$CFLAGS\ntest -z \"$LD\" && LD=ld\ntest -z \"$ac_objext\" && ac_objext=o\n\nfunc_cc_basename $compiler\ncc_basename=$func_cc_basename_result\n\n\n# Only perform the check for file, if the check method requires it\ntest -z \"$MAGIC_CMD\" && MAGIC_CMD=file\ncase $deplibs_check_method in\nfile_magic*)\n  if test \"$file_magic_cmd\" = '$MAGIC_CMD'; then\n    { $as_echo \"$as_me:${as_lineno-$LINENO}: checking for ${ac_tool_prefix}file\" >&5\n$as_echo_n \"checking for ${ac_tool_prefix}file... \" >&6; }\nif ${lt_cv_path_MAGIC_CMD+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  case $MAGIC_CMD in\n[\\\\/*] |  ?:[\\\\/]*)\n  lt_cv_path_MAGIC_CMD=$MAGIC_CMD # Let the user override the test with a path.\n  ;;\n*)\n  lt_save_MAGIC_CMD=$MAGIC_CMD\n  lt_save_ifs=$IFS; IFS=$PATH_SEPARATOR\n  ac_dummy=\"/usr/bin$PATH_SEPARATOR$PATH\"\n  for ac_dir in $ac_dummy; do\n    IFS=$lt_save_ifs\n    test -z \"$ac_dir\" && ac_dir=.\n    if test -f \"$ac_dir/${ac_tool_prefix}file\"; then\n      lt_cv_path_MAGIC_CMD=$ac_dir/\"${ac_tool_prefix}file\"\n      if test -n \"$file_magic_test_file\"; then\n\tcase $deplibs_check_method in\n\t\"file_magic \"*)\n\t  file_magic_regex=`expr \"$deplibs_check_method\" : \"file_magic \\(.*\\)\"`\n\t  MAGIC_CMD=$lt_cv_path_MAGIC_CMD\n\t  if eval $file_magic_cmd \\$file_magic_test_file 2> /dev/null |\n\t    $EGREP \"$file_magic_regex\" > /dev/null; then\n\t    :\n\t  else\n\t    cat <<_LT_EOF 1>&2\n\n*** Warning: the command libtool uses to detect shared libraries,\n*** $file_magic_cmd, produces output that libtool cannot recognize.\n*** The result is that libtool may fail to recognize shared libraries\n*** as such.  This will affect the creation of libtool libraries that\n*** depend on shared libraries, but programs linked with such libtool\n*** libraries will work regardless of this problem.  Nevertheless, you\n*** may want to report the problem to your system manager and/or to\n*** bug-libtool@gnu.org\n\n_LT_EOF\n\t  fi ;;\n\tesac\n      fi\n      break\n    fi\n  done\n  IFS=$lt_save_ifs\n  MAGIC_CMD=$lt_save_MAGIC_CMD\n  ;;\nesac\nfi\n\nMAGIC_CMD=$lt_cv_path_MAGIC_CMD\nif test -n \"$MAGIC_CMD\"; then\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: $MAGIC_CMD\" >&5\n$as_echo \"$MAGIC_CMD\" >&6; }\nelse\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: no\" >&5\n$as_echo \"no\" >&6; }\nfi\n\n\n\n\n\nif test -z \"$lt_cv_path_MAGIC_CMD\"; then\n  if test -n \"$ac_tool_prefix\"; then\n    { $as_echo \"$as_me:${as_lineno-$LINENO}: checking for file\" >&5\n$as_echo_n \"checking for file... \" >&6; }\nif ${lt_cv_path_MAGIC_CMD+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  case $MAGIC_CMD in\n[\\\\/*] |  ?:[\\\\/]*)\n  lt_cv_path_MAGIC_CMD=$MAGIC_CMD # Let the user override the test with a path.\n  ;;\n*)\n  lt_save_MAGIC_CMD=$MAGIC_CMD\n  lt_save_ifs=$IFS; IFS=$PATH_SEPARATOR\n  ac_dummy=\"/usr/bin$PATH_SEPARATOR$PATH\"\n  for ac_dir in $ac_dummy; do\n    IFS=$lt_save_ifs\n    test -z \"$ac_dir\" && ac_dir=.\n    if test -f \"$ac_dir/file\"; then\n      lt_cv_path_MAGIC_CMD=$ac_dir/\"file\"\n      if test -n \"$file_magic_test_file\"; then\n\tcase $deplibs_check_method in\n\t\"file_magic \"*)\n\t  file_magic_regex=`expr \"$deplibs_check_method\" : \"file_magic \\(.*\\)\"`\n\t  MAGIC_CMD=$lt_cv_path_MAGIC_CMD\n\t  if eval $file_magic_cmd \\$file_magic_test_file 2> /dev/null |\n\t    $EGREP \"$file_magic_regex\" > /dev/null; then\n\t    :\n\t  else\n\t    cat <<_LT_EOF 1>&2\n\n*** Warning: the command libtool uses to detect shared libraries,\n*** $file_magic_cmd, produces output that libtool cannot recognize.\n*** The result is that libtool may fail to recognize shared libraries\n*** as such.  This will affect the creation of libtool libraries that\n*** depend on shared libraries, but programs linked with such libtool\n*** libraries will work regardless of this problem.  Nevertheless, you\n*** may want to report the problem to your system manager and/or to\n*** bug-libtool@gnu.org\n\n_LT_EOF\n\t  fi ;;\n\tesac\n      fi\n      break\n    fi\n  done\n  IFS=$lt_save_ifs\n  MAGIC_CMD=$lt_save_MAGIC_CMD\n  ;;\nesac\nfi\n\nMAGIC_CMD=$lt_cv_path_MAGIC_CMD\nif test -n \"$MAGIC_CMD\"; then\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: $MAGIC_CMD\" >&5\n$as_echo \"$MAGIC_CMD\" >&6; }\nelse\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: no\" >&5\n$as_echo \"no\" >&6; }\nfi\n\n\n  else\n    MAGIC_CMD=:\n  fi\nfi\n\n  fi\n  ;;\nesac\n\n# Use C for the default configuration in the libtool script\n\nlt_save_CC=$CC\nac_ext=c\nac_cpp='$CPP $CPPFLAGS'\nac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5'\nac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5'\nac_compiler_gnu=$ac_cv_c_compiler_gnu\n\n\n# Source file extension for C test sources.\nac_ext=c\n\n# Object file extension for compiled C test sources.\nobjext=o\nobjext=$objext\n\n# Code to be used in simple compile tests\nlt_simple_compile_test_code=\"int some_variable = 0;\"\n\n# Code to be used in simple link tests\nlt_simple_link_test_code='int main(){return(0);}'\n\n\n\n\n\n\n\n# If no C compiler was specified, use CC.\nLTCC=${LTCC-\"$CC\"}\n\n# If no C compiler flags were specified, use CFLAGS.\nLTCFLAGS=${LTCFLAGS-\"$CFLAGS\"}\n\n# Allow CC to be a program name with arguments.\ncompiler=$CC\n\n# Save the default compiler, since it gets overwritten when the other\n# tags are being tested, and _LT_TAGVAR(compiler, []) is a NOP.\ncompiler_DEFAULT=$CC\n\n# save warnings/boilerplate of simple test code\nac_outfile=conftest.$ac_objext\necho \"$lt_simple_compile_test_code\" >conftest.$ac_ext\neval \"$ac_compile\" 2>&1 >/dev/null | $SED '/^$/d; /^ *+/d' >conftest.err\n_lt_compiler_boilerplate=`cat conftest.err`\n$RM conftest*\n\nac_outfile=conftest.$ac_objext\necho \"$lt_simple_link_test_code\" >conftest.$ac_ext\neval \"$ac_link\" 2>&1 >/dev/null | $SED '/^$/d; /^ *+/d' >conftest.err\n_lt_linker_boilerplate=`cat conftest.err`\n$RM -r conftest*\n\n\n## CAVEAT EMPTOR:\n## There is no encapsulation within the following macros, do not change\n## the running order or otherwise move them around unless you know exactly\n## what you are doing...\nif test -n \"$compiler\"; then\n\nlt_prog_compiler_no_builtin_flag=\n\nif test yes = \"$GCC\"; then\n  case $cc_basename in\n  nvcc*)\n    lt_prog_compiler_no_builtin_flag=' -Xcompiler -fno-builtin' ;;\n  *)\n    lt_prog_compiler_no_builtin_flag=' -fno-builtin' ;;\n  esac\n\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: checking if $compiler supports -fno-rtti -fno-exceptions\" >&5\n$as_echo_n \"checking if $compiler supports -fno-rtti -fno-exceptions... \" >&6; }\nif ${lt_cv_prog_compiler_rtti_exceptions+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  lt_cv_prog_compiler_rtti_exceptions=no\n   ac_outfile=conftest.$ac_objext\n   echo \"$lt_simple_compile_test_code\" > conftest.$ac_ext\n   lt_compiler_flag=\"-fno-rtti -fno-exceptions\"  ## exclude from sc_useless_quotes_in_assignment\n   # Insert the option either (1) after the last *FLAGS variable, or\n   # (2) before a word containing \"conftest.\", or (3) at the end.\n   # Note that $ac_compile itself does not contain backslashes and begins\n   # with a dollar sign (not a hyphen), so the echo should work correctly.\n   # The option is referenced via a variable to avoid confusing sed.\n   lt_compile=`echo \"$ac_compile\" | $SED \\\n   -e 's:.*FLAGS}\\{0,1\\} :&$lt_compiler_flag :; t' \\\n   -e 's: [^ ]*conftest\\.: $lt_compiler_flag&:; t' \\\n   -e 's:$: $lt_compiler_flag:'`\n   (eval echo \"\\\"\\$as_me:$LINENO: $lt_compile\\\"\" >&5)\n   (eval \"$lt_compile\" 2>conftest.err)\n   ac_status=$?\n   cat conftest.err >&5\n   echo \"$as_me:$LINENO: \\$? = $ac_status\" >&5\n   if (exit $ac_status) && test -s \"$ac_outfile\"; then\n     # The compiler can only warn and ignore the option if not recognized\n     # So say no if there are warnings other than the usual output.\n     $ECHO \"$_lt_compiler_boilerplate\" | $SED '/^$/d' >conftest.exp\n     $SED '/^$/d; /^ *+/d' conftest.err >conftest.er2\n     if test ! -s conftest.er2 || diff conftest.exp conftest.er2 >/dev/null; then\n       lt_cv_prog_compiler_rtti_exceptions=yes\n     fi\n   fi\n   $RM conftest*\n\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $lt_cv_prog_compiler_rtti_exceptions\" >&5\n$as_echo \"$lt_cv_prog_compiler_rtti_exceptions\" >&6; }\n\nif test yes = \"$lt_cv_prog_compiler_rtti_exceptions\"; then\n    lt_prog_compiler_no_builtin_flag=\"$lt_prog_compiler_no_builtin_flag -fno-rtti -fno-exceptions\"\nelse\n    :\nfi\n\nfi\n\n\n\n\n\n\n  lt_prog_compiler_wl=\nlt_prog_compiler_pic=\nlt_prog_compiler_static=\n\n\n  if test yes = \"$GCC\"; then\n    lt_prog_compiler_wl='-Wl,'\n    lt_prog_compiler_static='-static'\n\n    case $host_os in\n      aix*)\n      # All AIX code is PIC.\n      if test ia64 = \"$host_cpu\"; then\n\t# AIX 5 now supports IA64 processor\n\tlt_prog_compiler_static='-Bstatic'\n      fi\n      lt_prog_compiler_pic='-fPIC'\n      ;;\n\n    amigaos*)\n      case $host_cpu in\n      powerpc)\n            # see comment about AmigaOS4 .so support\n            lt_prog_compiler_pic='-fPIC'\n        ;;\n      m68k)\n            # FIXME: we need at least 68020 code to build shared libraries, but\n            # adding the '-m68020' flag to GCC prevents building anything better,\n            # like '-m68040'.\n            lt_prog_compiler_pic='-m68020 -resident32 -malways-restore-a4'\n        ;;\n      esac\n      ;;\n\n    beos* | irix5* | irix6* | nonstopux* | osf3* | osf4* | osf5*)\n      # PIC is the default for these OSes.\n      ;;\n\n    mingw* | cygwin* | pw32* | os2* | cegcc*)\n      # This hack is so that the source file can tell whether it is being\n      # built for inclusion in a dll (and should export symbols for example).\n      # Although the cygwin gcc ignores -fPIC, still need this for old-style\n      # (--disable-auto-import) libraries\n      lt_prog_compiler_pic='-DDLL_EXPORT'\n      case $host_os in\n      os2*)\n\tlt_prog_compiler_static='$wl-static'\n\t;;\n      esac\n      ;;\n\n    darwin* | rhapsody*)\n      # PIC is the default on this platform\n      # Common symbols not allowed in MH_DYLIB files\n      lt_prog_compiler_pic='-fno-common'\n      ;;\n\n    haiku*)\n      # PIC is the default for Haiku.\n      # The \"-static\" flag exists, but is broken.\n      lt_prog_compiler_static=\n      ;;\n\n    hpux*)\n      # PIC is the default for 64-bit PA HP-UX, but not for 32-bit\n      # PA HP-UX.  On IA64 HP-UX, PIC is the default but the pic flag\n      # sets the default TLS model and affects inlining.\n      case $host_cpu in\n      hppa*64*)\n\t# +Z the default\n\t;;\n      *)\n\tlt_prog_compiler_pic='-fPIC'\n\t;;\n      esac\n      ;;\n\n    interix[3-9]*)\n      # Interix 3.x gcc -fpic/-fPIC options generate broken code.\n      # Instead, we relocate shared libraries at runtime.\n      ;;\n\n    msdosdjgpp*)\n      # Just because we use GCC doesn't mean we suddenly get shared libraries\n      # on systems that don't support them.\n      lt_prog_compiler_can_build_shared=no\n      enable_shared=no\n      ;;\n\n    *nto* | *qnx*)\n      # QNX uses GNU C++, but need to define -shared option too, otherwise\n      # it will coredump.\n      lt_prog_compiler_pic='-fPIC -shared'\n      ;;\n\n    sysv4*MP*)\n      if test -d /usr/nec; then\n\tlt_prog_compiler_pic=-Kconform_pic\n      fi\n      ;;\n\n    *)\n      lt_prog_compiler_pic='-fPIC'\n      ;;\n    esac\n\n    case $cc_basename in\n    nvcc*) # Cuda Compiler Driver 2.2\n      lt_prog_compiler_wl='-Xlinker '\n      if test -n \"$lt_prog_compiler_pic\"; then\n        lt_prog_compiler_pic=\"-Xcompiler $lt_prog_compiler_pic\"\n      fi\n      ;;\n    esac\n  else\n    # PORTME Check for flag to pass linker flags through the system compiler.\n    case $host_os in\n    aix*)\n      lt_prog_compiler_wl='-Wl,'\n      if test ia64 = \"$host_cpu\"; then\n\t# AIX 5 now supports IA64 processor\n\tlt_prog_compiler_static='-Bstatic'\n      else\n\tlt_prog_compiler_static='-bnso -bI:/lib/syscalls.exp'\n      fi\n      ;;\n\n    darwin* | rhapsody*)\n      # PIC is the default on this platform\n      # Common symbols not allowed in MH_DYLIB files\n      lt_prog_compiler_pic='-fno-common'\n      case $cc_basename in\n      nagfor*)\n        # NAG Fortran compiler\n        lt_prog_compiler_wl='-Wl,-Wl,,'\n        lt_prog_compiler_pic='-PIC'\n        lt_prog_compiler_static='-Bstatic'\n        ;;\n      esac\n      ;;\n\n    mingw* | cygwin* | pw32* | os2* | cegcc*)\n      # This hack is so that the source file can tell whether it is being\n      # built for inclusion in a dll (and should export symbols for example).\n      lt_prog_compiler_pic='-DDLL_EXPORT'\n      case $host_os in\n      os2*)\n\tlt_prog_compiler_static='$wl-static'\n\t;;\n      esac\n      ;;\n\n    hpux9* | hpux10* | hpux11*)\n      lt_prog_compiler_wl='-Wl,'\n      # PIC is the default for IA64 HP-UX and 64-bit HP-UX, but\n      # not for PA HP-UX.\n      case $host_cpu in\n      hppa*64*|ia64*)\n\t# +Z the default\n\t;;\n      *)\n\tlt_prog_compiler_pic='+Z'\n\t;;\n      esac\n      # Is there a better lt_prog_compiler_static that works with the bundled CC?\n      lt_prog_compiler_static='$wl-a ${wl}archive'\n      ;;\n\n    irix5* | irix6* | nonstopux*)\n      lt_prog_compiler_wl='-Wl,'\n      # PIC (with -KPIC) is the default.\n      lt_prog_compiler_static='-non_shared'\n      ;;\n\n    linux* | k*bsd*-gnu | kopensolaris*-gnu | gnu*)\n      case $cc_basename in\n      # old Intel for x86_64, which still supported -KPIC.\n      ecc*)\n\tlt_prog_compiler_wl='-Wl,'\n\tlt_prog_compiler_pic='-KPIC'\n\tlt_prog_compiler_static='-static'\n        ;;\n      # icc used to be incompatible with GCC.\n      # ICC 10 doesn't accept -KPIC any more.\n      icc* | ifort*)\n\tlt_prog_compiler_wl='-Wl,'\n\tlt_prog_compiler_pic='-fPIC'\n\tlt_prog_compiler_static='-static'\n        ;;\n      # Lahey Fortran 8.1.\n      lf95*)\n\tlt_prog_compiler_wl='-Wl,'\n\tlt_prog_compiler_pic='--shared'\n\tlt_prog_compiler_static='--static'\n\t;;\n      nagfor*)\n\t# NAG Fortran compiler\n\tlt_prog_compiler_wl='-Wl,-Wl,,'\n\tlt_prog_compiler_pic='-PIC'\n\tlt_prog_compiler_static='-Bstatic'\n\t;;\n      tcc*)\n\t# Fabrice Bellard et al's Tiny C Compiler\n\tlt_prog_compiler_wl='-Wl,'\n\tlt_prog_compiler_pic='-fPIC'\n\tlt_prog_compiler_static='-static'\n\t;;\n      pgcc* | pgf77* | pgf90* | pgf95* | pgfortran*)\n        # Portland Group compilers (*not* the Pentium gcc compiler,\n\t# which looks to be a dead project)\n\tlt_prog_compiler_wl='-Wl,'\n\tlt_prog_compiler_pic='-fpic'\n\tlt_prog_compiler_static='-Bstatic'\n        ;;\n      ccc*)\n        lt_prog_compiler_wl='-Wl,'\n        # All Alpha code is PIC.\n        lt_prog_compiler_static='-non_shared'\n        ;;\n      xl* | bgxl* | bgf* | mpixl*)\n\t# IBM XL C 8.0/Fortran 10.1, 11.1 on PPC and BlueGene\n\tlt_prog_compiler_wl='-Wl,'\n\tlt_prog_compiler_pic='-qpic'\n\tlt_prog_compiler_static='-qstaticlink'\n\t;;\n      *)\n\tcase `$CC -V 2>&1 | sed 5q` in\n\t*Sun\\ Ceres\\ Fortran* | *Sun*Fortran*\\ [1-7].* | *Sun*Fortran*\\ 8.[0-3]*)\n\t  # Sun Fortran 8.3 passes all unrecognized flags to the linker\n\t  lt_prog_compiler_pic='-KPIC'\n\t  lt_prog_compiler_static='-Bstatic'\n\t  lt_prog_compiler_wl=''\n\t  ;;\n\t*Sun\\ F* | *Sun*Fortran*)\n\t  lt_prog_compiler_pic='-KPIC'\n\t  lt_prog_compiler_static='-Bstatic'\n\t  lt_prog_compiler_wl='-Qoption ld '\n\t  ;;\n\t*Sun\\ C*)\n\t  # Sun C 5.9\n\t  lt_prog_compiler_pic='-KPIC'\n\t  lt_prog_compiler_static='-Bstatic'\n\t  lt_prog_compiler_wl='-Wl,'\n\t  ;;\n        *Intel*\\ [CF]*Compiler*)\n\t  lt_prog_compiler_wl='-Wl,'\n\t  lt_prog_compiler_pic='-fPIC'\n\t  lt_prog_compiler_static='-static'\n\t  ;;\n\t*Portland\\ Group*)\n\t  lt_prog_compiler_wl='-Wl,'\n\t  lt_prog_compiler_pic='-fpic'\n\t  lt_prog_compiler_static='-Bstatic'\n\t  ;;\n\tesac\n\t;;\n      esac\n      ;;\n\n    newsos6)\n      lt_prog_compiler_pic='-KPIC'\n      lt_prog_compiler_static='-Bstatic'\n      ;;\n\n    *nto* | *qnx*)\n      # QNX uses GNU C++, but need to define -shared option too, otherwise\n      # it will coredump.\n      lt_prog_compiler_pic='-fPIC -shared'\n      ;;\n\n    osf3* | osf4* | osf5*)\n      lt_prog_compiler_wl='-Wl,'\n      # All OSF/1 code is PIC.\n      lt_prog_compiler_static='-non_shared'\n      ;;\n\n    rdos*)\n      lt_prog_compiler_static='-non_shared'\n      ;;\n\n    solaris*)\n      lt_prog_compiler_pic='-KPIC'\n      lt_prog_compiler_static='-Bstatic'\n      case $cc_basename in\n      f77* | f90* | f95* | sunf77* | sunf90* | sunf95*)\n\tlt_prog_compiler_wl='-Qoption ld ';;\n      *)\n\tlt_prog_compiler_wl='-Wl,';;\n      esac\n      ;;\n\n    sunos4*)\n      lt_prog_compiler_wl='-Qoption ld '\n      lt_prog_compiler_pic='-PIC'\n      lt_prog_compiler_static='-Bstatic'\n      ;;\n\n    sysv4 | sysv4.2uw2* | sysv4.3*)\n      lt_prog_compiler_wl='-Wl,'\n      lt_prog_compiler_pic='-KPIC'\n      lt_prog_compiler_static='-Bstatic'\n      ;;\n\n    sysv4*MP*)\n      if test -d /usr/nec; then\n\tlt_prog_compiler_pic='-Kconform_pic'\n\tlt_prog_compiler_static='-Bstatic'\n      fi\n      ;;\n\n    sysv5* | unixware* | sco3.2v5* | sco5v6* | OpenUNIX*)\n      lt_prog_compiler_wl='-Wl,'\n      lt_prog_compiler_pic='-KPIC'\n      lt_prog_compiler_static='-Bstatic'\n      ;;\n\n    unicos*)\n      lt_prog_compiler_wl='-Wl,'\n      lt_prog_compiler_can_build_shared=no\n      ;;\n\n    uts4*)\n      lt_prog_compiler_pic='-pic'\n      lt_prog_compiler_static='-Bstatic'\n      ;;\n\n    *)\n      lt_prog_compiler_can_build_shared=no\n      ;;\n    esac\n  fi\n\ncase $host_os in\n  # For platforms that do not support PIC, -DPIC is meaningless:\n  *djgpp*)\n    lt_prog_compiler_pic=\n    ;;\n  *)\n    lt_prog_compiler_pic=\"$lt_prog_compiler_pic -DPIC\"\n    ;;\nesac\n\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for $compiler option to produce PIC\" >&5\n$as_echo_n \"checking for $compiler option to produce PIC... \" >&6; }\nif ${lt_cv_prog_compiler_pic+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  lt_cv_prog_compiler_pic=$lt_prog_compiler_pic\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $lt_cv_prog_compiler_pic\" >&5\n$as_echo \"$lt_cv_prog_compiler_pic\" >&6; }\nlt_prog_compiler_pic=$lt_cv_prog_compiler_pic\n\n#\n# Check to make sure the PIC flag actually works.\n#\nif test -n \"$lt_prog_compiler_pic\"; then\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: checking if $compiler PIC flag $lt_prog_compiler_pic works\" >&5\n$as_echo_n \"checking if $compiler PIC flag $lt_prog_compiler_pic works... \" >&6; }\nif ${lt_cv_prog_compiler_pic_works+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  lt_cv_prog_compiler_pic_works=no\n   ac_outfile=conftest.$ac_objext\n   echo \"$lt_simple_compile_test_code\" > conftest.$ac_ext\n   lt_compiler_flag=\"$lt_prog_compiler_pic -DPIC\"  ## exclude from sc_useless_quotes_in_assignment\n   # Insert the option either (1) after the last *FLAGS variable, or\n   # (2) before a word containing \"conftest.\", or (3) at the end.\n   # Note that $ac_compile itself does not contain backslashes and begins\n   # with a dollar sign (not a hyphen), so the echo should work correctly.\n   # The option is referenced via a variable to avoid confusing sed.\n   lt_compile=`echo \"$ac_compile\" | $SED \\\n   -e 's:.*FLAGS}\\{0,1\\} :&$lt_compiler_flag :; t' \\\n   -e 's: [^ ]*conftest\\.: $lt_compiler_flag&:; t' \\\n   -e 's:$: $lt_compiler_flag:'`\n   (eval echo \"\\\"\\$as_me:$LINENO: $lt_compile\\\"\" >&5)\n   (eval \"$lt_compile\" 2>conftest.err)\n   ac_status=$?\n   cat conftest.err >&5\n   echo \"$as_me:$LINENO: \\$? = $ac_status\" >&5\n   if (exit $ac_status) && test -s \"$ac_outfile\"; then\n     # The compiler can only warn and ignore the option if not recognized\n     # So say no if there are warnings other than the usual output.\n     $ECHO \"$_lt_compiler_boilerplate\" | $SED '/^$/d' >conftest.exp\n     $SED '/^$/d; /^ *+/d' conftest.err >conftest.er2\n     if test ! -s conftest.er2 || diff conftest.exp conftest.er2 >/dev/null; then\n       lt_cv_prog_compiler_pic_works=yes\n     fi\n   fi\n   $RM conftest*\n\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $lt_cv_prog_compiler_pic_works\" >&5\n$as_echo \"$lt_cv_prog_compiler_pic_works\" >&6; }\n\nif test yes = \"$lt_cv_prog_compiler_pic_works\"; then\n    case $lt_prog_compiler_pic in\n     \"\" | \" \"*) ;;\n     *) lt_prog_compiler_pic=\" $lt_prog_compiler_pic\" ;;\n     esac\nelse\n    lt_prog_compiler_pic=\n     lt_prog_compiler_can_build_shared=no\nfi\n\nfi\n\n\n\n\n\n\n\n\n\n\n\n#\n# Check to make sure the static flag actually works.\n#\nwl=$lt_prog_compiler_wl eval lt_tmp_static_flag=\\\"$lt_prog_compiler_static\\\"\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking if $compiler static flag $lt_tmp_static_flag works\" >&5\n$as_echo_n \"checking if $compiler static flag $lt_tmp_static_flag works... \" >&6; }\nif ${lt_cv_prog_compiler_static_works+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  lt_cv_prog_compiler_static_works=no\n   save_LDFLAGS=$LDFLAGS\n   LDFLAGS=\"$LDFLAGS $lt_tmp_static_flag\"\n   echo \"$lt_simple_link_test_code\" > conftest.$ac_ext\n   if (eval $ac_link 2>conftest.err) && test -s conftest$ac_exeext; then\n     # The linker can only warn and ignore the option if not recognized\n     # So say no if there are warnings\n     if test -s conftest.err; then\n       # Append any errors to the config.log.\n       cat conftest.err 1>&5\n       $ECHO \"$_lt_linker_boilerplate\" | $SED '/^$/d' > conftest.exp\n       $SED '/^$/d; /^ *+/d' conftest.err >conftest.er2\n       if diff conftest.exp conftest.er2 >/dev/null; then\n         lt_cv_prog_compiler_static_works=yes\n       fi\n     else\n       lt_cv_prog_compiler_static_works=yes\n     fi\n   fi\n   $RM -r conftest*\n   LDFLAGS=$save_LDFLAGS\n\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $lt_cv_prog_compiler_static_works\" >&5\n$as_echo \"$lt_cv_prog_compiler_static_works\" >&6; }\n\nif test yes = \"$lt_cv_prog_compiler_static_works\"; then\n    :\nelse\n    lt_prog_compiler_static=\nfi\n\n\n\n\n\n\n\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: checking if $compiler supports -c -o file.$ac_objext\" >&5\n$as_echo_n \"checking if $compiler supports -c -o file.$ac_objext... \" >&6; }\nif ${lt_cv_prog_compiler_c_o+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  lt_cv_prog_compiler_c_o=no\n   $RM -r conftest 2>/dev/null\n   mkdir conftest\n   cd conftest\n   mkdir out\n   echo \"$lt_simple_compile_test_code\" > conftest.$ac_ext\n\n   lt_compiler_flag=\"-o out/conftest2.$ac_objext\"\n   # Insert the option either (1) after the last *FLAGS variable, or\n   # (2) before a word containing \"conftest.\", or (3) at the end.\n   # Note that $ac_compile itself does not contain backslashes and begins\n   # with a dollar sign (not a hyphen), so the echo should work correctly.\n   lt_compile=`echo \"$ac_compile\" | $SED \\\n   -e 's:.*FLAGS}\\{0,1\\} :&$lt_compiler_flag :; t' \\\n   -e 's: [^ ]*conftest\\.: $lt_compiler_flag&:; t' \\\n   -e 's:$: $lt_compiler_flag:'`\n   (eval echo \"\\\"\\$as_me:$LINENO: $lt_compile\\\"\" >&5)\n   (eval \"$lt_compile\" 2>out/conftest.err)\n   ac_status=$?\n   cat out/conftest.err >&5\n   echo \"$as_me:$LINENO: \\$? = $ac_status\" >&5\n   if (exit $ac_status) && test -s out/conftest2.$ac_objext\n   then\n     # The compiler can only warn and ignore the option if not recognized\n     # So say no if there are warnings\n     $ECHO \"$_lt_compiler_boilerplate\" | $SED '/^$/d' > out/conftest.exp\n     $SED '/^$/d; /^ *+/d' out/conftest.err >out/conftest.er2\n     if test ! -s out/conftest.er2 || diff out/conftest.exp out/conftest.er2 >/dev/null; then\n       lt_cv_prog_compiler_c_o=yes\n     fi\n   fi\n   chmod u+w . 2>&5\n   $RM conftest*\n   # SGI C++ compiler will create directory out/ii_files/ for\n   # template instantiation\n   test -d out/ii_files && $RM out/ii_files/* && rmdir out/ii_files\n   $RM out/* && rmdir out\n   cd ..\n   $RM -r conftest\n   $RM conftest*\n\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $lt_cv_prog_compiler_c_o\" >&5\n$as_echo \"$lt_cv_prog_compiler_c_o\" >&6; }\n\n\n\n\n\n\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: checking if $compiler supports -c -o file.$ac_objext\" >&5\n$as_echo_n \"checking if $compiler supports -c -o file.$ac_objext... \" >&6; }\nif ${lt_cv_prog_compiler_c_o+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  lt_cv_prog_compiler_c_o=no\n   $RM -r conftest 2>/dev/null\n   mkdir conftest\n   cd conftest\n   mkdir out\n   echo \"$lt_simple_compile_test_code\" > conftest.$ac_ext\n\n   lt_compiler_flag=\"-o out/conftest2.$ac_objext\"\n   # Insert the option either (1) after the last *FLAGS variable, or\n   # (2) before a word containing \"conftest.\", or (3) at the end.\n   # Note that $ac_compile itself does not contain backslashes and begins\n   # with a dollar sign (not a hyphen), so the echo should work correctly.\n   lt_compile=`echo \"$ac_compile\" | $SED \\\n   -e 's:.*FLAGS}\\{0,1\\} :&$lt_compiler_flag :; t' \\\n   -e 's: [^ ]*conftest\\.: $lt_compiler_flag&:; t' \\\n   -e 's:$: $lt_compiler_flag:'`\n   (eval echo \"\\\"\\$as_me:$LINENO: $lt_compile\\\"\" >&5)\n   (eval \"$lt_compile\" 2>out/conftest.err)\n   ac_status=$?\n   cat out/conftest.err >&5\n   echo \"$as_me:$LINENO: \\$? = $ac_status\" >&5\n   if (exit $ac_status) && test -s out/conftest2.$ac_objext\n   then\n     # The compiler can only warn and ignore the option if not recognized\n     # So say no if there are warnings\n     $ECHO \"$_lt_compiler_boilerplate\" | $SED '/^$/d' > out/conftest.exp\n     $SED '/^$/d; /^ *+/d' out/conftest.err >out/conftest.er2\n     if test ! -s out/conftest.er2 || diff out/conftest.exp out/conftest.er2 >/dev/null; then\n       lt_cv_prog_compiler_c_o=yes\n     fi\n   fi\n   chmod u+w . 2>&5\n   $RM conftest*\n   # SGI C++ compiler will create directory out/ii_files/ for\n   # template instantiation\n   test -d out/ii_files && $RM out/ii_files/* && rmdir out/ii_files\n   $RM out/* && rmdir out\n   cd ..\n   $RM -r conftest\n   $RM conftest*\n\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $lt_cv_prog_compiler_c_o\" >&5\n$as_echo \"$lt_cv_prog_compiler_c_o\" >&6; }\n\n\n\n\nhard_links=nottested\nif test no = \"$lt_cv_prog_compiler_c_o\" && test no != \"$need_locks\"; then\n  # do not overwrite the value of need_locks provided by the user\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: checking if we can lock with hard links\" >&5\n$as_echo_n \"checking if we can lock with hard links... \" >&6; }\n  hard_links=yes\n  $RM conftest*\n  ln conftest.a conftest.b 2>/dev/null && hard_links=no\n  touch conftest.a\n  ln conftest.a conftest.b 2>&5 || hard_links=no\n  ln conftest.a conftest.b 2>/dev/null && hard_links=no\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: $hard_links\" >&5\n$as_echo \"$hard_links\" >&6; }\n  if test no = \"$hard_links\"; then\n    { $as_echo \"$as_me:${as_lineno-$LINENO}: WARNING: '$CC' does not support '-c -o', so 'make -j' may be unsafe\" >&5\n$as_echo \"$as_me: WARNING: '$CC' does not support '-c -o', so 'make -j' may be unsafe\" >&2;}\n    need_locks=warn\n  fi\nelse\n  need_locks=no\nfi\n\n\n\n\n\n\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: checking whether the $compiler linker ($LD) supports shared libraries\" >&5\n$as_echo_n \"checking whether the $compiler linker ($LD) supports shared libraries... \" >&6; }\n\n  runpath_var=\n  allow_undefined_flag=\n  always_export_symbols=no\n  archive_cmds=\n  archive_expsym_cmds=\n  compiler_needs_object=no\n  enable_shared_with_static_runtimes=no\n  export_dynamic_flag_spec=\n  export_symbols_cmds='$NM $libobjs $convenience | $global_symbol_pipe | $SED '\\''s/.* //'\\'' | sort | uniq > $export_symbols'\n  hardcode_automatic=no\n  hardcode_direct=no\n  hardcode_direct_absolute=no\n  hardcode_libdir_flag_spec=\n  hardcode_libdir_separator=\n  hardcode_minus_L=no\n  hardcode_shlibpath_var=unsupported\n  inherit_rpath=no\n  link_all_deplibs=unknown\n  module_cmds=\n  module_expsym_cmds=\n  old_archive_from_new_cmds=\n  old_archive_from_expsyms_cmds=\n  thread_safe_flag_spec=\n  whole_archive_flag_spec=\n  # include_expsyms should be a list of space-separated symbols to be *always*\n  # included in the symbol list\n  include_expsyms=\n  # exclude_expsyms can be an extended regexp of symbols to exclude\n  # it will be wrapped by ' (' and ')$', so one must not match beginning or\n  # end of line.  Example: 'a|bc|.*d.*' will exclude the symbols 'a' and 'bc',\n  # as well as any symbol that contains 'd'.\n  exclude_expsyms='_GLOBAL_OFFSET_TABLE_|_GLOBAL__F[ID]_.*'\n  # Although _GLOBAL_OFFSET_TABLE_ is a valid symbol C name, most a.out\n  # platforms (ab)use it in PIC code, but their linkers get confused if\n  # the symbol is explicitly referenced.  Since portable code cannot\n  # rely on this symbol name, it's probably fine to never include it in\n  # preloaded symbol tables.\n  # Exclude shared library initialization/finalization symbols.\n  extract_expsyms_cmds=\n\n  case $host_os in\n  cygwin* | mingw* | pw32* | cegcc*)\n    # FIXME: the MSVC++ port hasn't been tested in a loooong time\n    # When not using gcc, we currently assume that we are using\n    # Microsoft Visual C++.\n    if test yes != \"$GCC\"; then\n      with_gnu_ld=no\n    fi\n    ;;\n  interix*)\n    # we just hope/assume this is gcc and not c89 (= MSVC++)\n    with_gnu_ld=yes\n    ;;\n  openbsd* | bitrig*)\n    with_gnu_ld=no\n    ;;\n  linux* | k*bsd*-gnu | gnu*)\n    link_all_deplibs=no\n    ;;\n  esac\n\n  ld_shlibs=yes\n\n  # On some targets, GNU ld is compatible enough with the native linker\n  # that we're better off using the native interface for both.\n  lt_use_gnu_ld_interface=no\n  if test yes = \"$with_gnu_ld\"; then\n    case $host_os in\n      aix*)\n\t# The AIX port of GNU ld has always aspired to compatibility\n\t# with the native linker.  However, as the warning in the GNU ld\n\t# block says, versions before 2.19.5* couldn't really create working\n\t# shared libraries, regardless of the interface used.\n\tcase `$LD -v 2>&1` in\n\t  *\\ \\(GNU\\ Binutils\\)\\ 2.19.5*) ;;\n\t  *\\ \\(GNU\\ Binutils\\)\\ 2.[2-9]*) ;;\n\t  *\\ \\(GNU\\ Binutils\\)\\ [3-9]*) ;;\n\t  *)\n\t    lt_use_gnu_ld_interface=yes\n\t    ;;\n\tesac\n\t;;\n      *)\n\tlt_use_gnu_ld_interface=yes\n\t;;\n    esac\n  fi\n\n  if test yes = \"$lt_use_gnu_ld_interface\"; then\n    # If archive_cmds runs LD, not CC, wlarc should be empty\n    wlarc='$wl'\n\n    # Set some defaults for GNU ld with shared library support. These\n    # are reset later if shared libraries are not supported. Putting them\n    # here allows them to be overridden if necessary.\n    runpath_var=LD_RUN_PATH\n    hardcode_libdir_flag_spec='$wl-rpath $wl$libdir'\n    export_dynamic_flag_spec='$wl--export-dynamic'\n    # ancient GNU ld didn't support --whole-archive et. al.\n    if $LD --help 2>&1 | $GREP 'no-whole-archive' > /dev/null; then\n      whole_archive_flag_spec=$wlarc'--whole-archive$convenience '$wlarc'--no-whole-archive'\n    else\n      whole_archive_flag_spec=\n    fi\n    supports_anon_versioning=no\n    case `$LD -v | $SED -e 's/(^)\\+)\\s\\+//' 2>&1` in\n      *GNU\\ gold*) supports_anon_versioning=yes ;;\n      *\\ [01].* | *\\ 2.[0-9].* | *\\ 2.10.*) ;; # catch versions < 2.11\n      *\\ 2.11.93.0.2\\ *) supports_anon_versioning=yes ;; # RH7.3 ...\n      *\\ 2.11.92.0.12\\ *) supports_anon_versioning=yes ;; # Mandrake 8.2 ...\n      *\\ 2.11.*) ;; # other 2.11 versions\n      *) supports_anon_versioning=yes ;;\n    esac\n\n    # See if GNU ld supports shared libraries.\n    case $host_os in\n    aix[3-9]*)\n      # On AIX/PPC, the GNU linker is very broken\n      if test ia64 != \"$host_cpu\"; then\n\tld_shlibs=no\n\tcat <<_LT_EOF 1>&2\n\n*** Warning: the GNU linker, at least up to release 2.19, is reported\n*** to be unable to reliably create shared libraries on AIX.\n*** Therefore, libtool is disabling shared libraries support.  If you\n*** really care for shared libraries, you may want to install binutils\n*** 2.20 or above, or modify your PATH so that a non-GNU linker is found.\n*** You will then need to restart the configuration process.\n\n_LT_EOF\n      fi\n      ;;\n\n    amigaos*)\n      case $host_cpu in\n      powerpc)\n            # see comment about AmigaOS4 .so support\n            archive_cmds='$CC -shared $libobjs $deplibs $compiler_flags $wl-soname $wl$soname -o $lib'\n            archive_expsym_cmds=''\n        ;;\n      m68k)\n            archive_cmds='$RM $output_objdir/a2ixlibrary.data~$ECHO \"#define NAME $libname\" > $output_objdir/a2ixlibrary.data~$ECHO \"#define LIBRARY_ID 1\" >> $output_objdir/a2ixlibrary.data~$ECHO \"#define VERSION $major\" >> $output_objdir/a2ixlibrary.data~$ECHO \"#define REVISION $revision\" >> $output_objdir/a2ixlibrary.data~$AR $AR_FLAGS $lib $libobjs~$RANLIB $lib~(cd $output_objdir && a2ixlibrary -32)'\n            hardcode_libdir_flag_spec='-L$libdir'\n            hardcode_minus_L=yes\n        ;;\n      esac\n      ;;\n\n    beos*)\n      if $LD --help 2>&1 | $GREP ': supported targets:.* elf' > /dev/null; then\n\tallow_undefined_flag=unsupported\n\t# Joseph Beckenbach <jrb3@best.com> says some releases of gcc\n\t# support --undefined.  This deserves some investigation.  FIXME\n\tarchive_cmds='$CC -nostart $libobjs $deplibs $compiler_flags $wl-soname $wl$soname -o $lib'\n      else\n\tld_shlibs=no\n      fi\n      ;;\n\n    cygwin* | mingw* | pw32* | cegcc*)\n      # _LT_TAGVAR(hardcode_libdir_flag_spec, ) is actually meaningless,\n      # as there is no search path for DLLs.\n      hardcode_libdir_flag_spec='-L$libdir'\n      export_dynamic_flag_spec='$wl--export-all-symbols'\n      allow_undefined_flag=unsupported\n      always_export_symbols=no\n      enable_shared_with_static_runtimes=yes\n      export_symbols_cmds='$NM $libobjs $convenience | $global_symbol_pipe | $SED -e '\\''/^[BCDGRS][ ]/s/.*[ ]\\([^ ]*\\)/\\1 DATA/;s/^.*[ ]__nm__\\([^ ]*\\)[ ][^ ]*/\\1 DATA/;/^I[ ]/d;/^[AITW][ ]/s/.* //'\\'' | sort | uniq > $export_symbols'\n      exclude_expsyms='[_]+GLOBAL_OFFSET_TABLE_|[_]+GLOBAL__[FID]_.*|[_]+head_[A-Za-z0-9_]+_dll|[A-Za-z0-9_]+_dll_iname'\n\n      if $LD --help 2>&1 | $GREP 'auto-import' > /dev/null; then\n        archive_cmds='$CC -shared $libobjs $deplibs $compiler_flags -o $output_objdir/$soname $wl--enable-auto-image-base -Xlinker --out-implib -Xlinker $lib'\n\t# If the export-symbols file already is a .def file, use it as\n\t# is; otherwise, prepend EXPORTS...\n\tarchive_expsym_cmds='if   test DEF = \"`$SED -n     -e '\\''s/^[\t ]*//'\\''     -e '\\''/^\\(;.*\\)*$/d'\\''     -e '\\''s/^\\(EXPORTS\\|LIBRARY\\)\\([\t ].*\\)*$/DEF/p'\\''     -e q     $export_symbols`\" ; then\n          cp $export_symbols $output_objdir/$soname.def;\n        else\n          echo EXPORTS > $output_objdir/$soname.def;\n          cat $export_symbols >> $output_objdir/$soname.def;\n        fi~\n        $CC -shared $output_objdir/$soname.def $libobjs $deplibs $compiler_flags -o $output_objdir/$soname $wl--enable-auto-image-base -Xlinker --out-implib -Xlinker $lib'\n      else\n\tld_shlibs=no\n      fi\n      ;;\n\n    haiku*)\n      archive_cmds='$CC -shared $libobjs $deplibs $compiler_flags $wl-soname $wl$soname -o $lib'\n      link_all_deplibs=yes\n      ;;\n\n    os2*)\n      hardcode_libdir_flag_spec='-L$libdir'\n      hardcode_minus_L=yes\n      allow_undefined_flag=unsupported\n      shrext_cmds=.dll\n      archive_cmds='$ECHO \"LIBRARY ${soname%$shared_ext} INITINSTANCE TERMINSTANCE\" > $output_objdir/$libname.def~\n\t$ECHO \"DESCRIPTION \\\"$libname\\\"\" >> $output_objdir/$libname.def~\n\t$ECHO \"DATA MULTIPLE NONSHARED\" >> $output_objdir/$libname.def~\n\t$ECHO EXPORTS >> $output_objdir/$libname.def~\n\temxexp $libobjs | $SED /\"_DLL_InitTerm\"/d >> $output_objdir/$libname.def~\n\t$CC -Zdll -Zcrtdll -o $output_objdir/$soname $libobjs $deplibs $compiler_flags $output_objdir/$libname.def~\n\temximp -o $lib $output_objdir/$libname.def'\n      archive_expsym_cmds='$ECHO \"LIBRARY ${soname%$shared_ext} INITINSTANCE TERMINSTANCE\" > $output_objdir/$libname.def~\n\t$ECHO \"DESCRIPTION \\\"$libname\\\"\" >> $output_objdir/$libname.def~\n\t$ECHO \"DATA MULTIPLE NONSHARED\" >> $output_objdir/$libname.def~\n\t$ECHO EXPORTS >> $output_objdir/$libname.def~\n\tprefix_cmds=\"$SED\"~\n\tif test EXPORTS = \"`$SED 1q $export_symbols`\"; then\n\t  prefix_cmds=\"$prefix_cmds -e 1d\";\n\tfi~\n\tprefix_cmds=\"$prefix_cmds -e \\\"s/^\\(.*\\)$/_\\1/g\\\"\"~\n\tcat $export_symbols | $prefix_cmds >> $output_objdir/$libname.def~\n\t$CC -Zdll -Zcrtdll -o $output_objdir/$soname $libobjs $deplibs $compiler_flags $output_objdir/$libname.def~\n\temximp -o $lib $output_objdir/$libname.def'\n      old_archive_From_new_cmds='emximp -o $output_objdir/${libname}_dll.a $output_objdir/$libname.def'\n      enable_shared_with_static_runtimes=yes\n      ;;\n\n    interix[3-9]*)\n      hardcode_direct=no\n      hardcode_shlibpath_var=no\n      hardcode_libdir_flag_spec='$wl-rpath,$libdir'\n      export_dynamic_flag_spec='$wl-E'\n      # Hack: On Interix 3.x, we cannot compile PIC because of a broken gcc.\n      # Instead, shared libraries are loaded at an image base (0x10000000 by\n      # default) and relocated if they conflict, which is a slow very memory\n      # consuming and fragmenting process.  To avoid this, we pick a random,\n      # 256 KiB-aligned image base between 0x50000000 and 0x6FFC0000 at link\n      # time.  Moving up from 0x10000000 also allows more sbrk(2) space.\n      archive_cmds='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags $wl-h,$soname $wl--image-base,`expr ${RANDOM-$$} % 4096 / 2 \\* 262144 + 1342177280` -o $lib'\n      archive_expsym_cmds='sed \"s|^|_|\" $export_symbols >$output_objdir/$soname.expsym~$CC -shared $pic_flag $libobjs $deplibs $compiler_flags $wl-h,$soname $wl--retain-symbols-file,$output_objdir/$soname.expsym $wl--image-base,`expr ${RANDOM-$$} % 4096 / 2 \\* 262144 + 1342177280` -o $lib'\n      ;;\n\n    gnu* | linux* | tpf* | k*bsd*-gnu | kopensolaris*-gnu)\n      tmp_diet=no\n      if test linux-dietlibc = \"$host_os\"; then\n\tcase $cc_basename in\n\t  diet\\ *) tmp_diet=yes;;\t# linux-dietlibc with static linking (!diet-dyn)\n\tesac\n      fi\n      if $LD --help 2>&1 | $EGREP ': supported targets:.* elf' > /dev/null \\\n\t && test no = \"$tmp_diet\"\n      then\n\ttmp_addflag=' $pic_flag'\n\ttmp_sharedflag='-shared'\n\tcase $cc_basename,$host_cpu in\n        pgcc*)\t\t\t\t# Portland Group C compiler\n\t  whole_archive_flag_spec='$wl--whole-archive`for conv in $convenience\\\"\\\"; do test  -n \\\"$conv\\\" && new_convenience=\\\"$new_convenience,$conv\\\"; done; func_echo_all \\\"$new_convenience\\\"` $wl--no-whole-archive'\n\t  tmp_addflag=' $pic_flag'\n\t  ;;\n\tpgf77* | pgf90* | pgf95* | pgfortran*)\n\t\t\t\t\t# Portland Group f77 and f90 compilers\n\t  whole_archive_flag_spec='$wl--whole-archive`for conv in $convenience\\\"\\\"; do test  -n \\\"$conv\\\" && new_convenience=\\\"$new_convenience,$conv\\\"; done; func_echo_all \\\"$new_convenience\\\"` $wl--no-whole-archive'\n\t  tmp_addflag=' $pic_flag -Mnomain' ;;\n\tecc*,ia64* | icc*,ia64*)\t# Intel C compiler on ia64\n\t  tmp_addflag=' -i_dynamic' ;;\n\tefc*,ia64* | ifort*,ia64*)\t# Intel Fortran compiler on ia64\n\t  tmp_addflag=' -i_dynamic -nofor_main' ;;\n\tifc* | ifort*)\t\t\t# Intel Fortran compiler\n\t  tmp_addflag=' -nofor_main' ;;\n\tlf95*)\t\t\t\t# Lahey Fortran 8.1\n\t  whole_archive_flag_spec=\n\t  tmp_sharedflag='--shared' ;;\n        nagfor*)                        # NAGFOR 5.3\n          tmp_sharedflag='-Wl,-shared' ;;\n\txl[cC]* | bgxl[cC]* | mpixl[cC]*) # IBM XL C 8.0 on PPC (deal with xlf below)\n\t  tmp_sharedflag='-qmkshrobj'\n\t  tmp_addflag= ;;\n\tnvcc*)\t# Cuda Compiler Driver 2.2\n\t  whole_archive_flag_spec='$wl--whole-archive`for conv in $convenience\\\"\\\"; do test  -n \\\"$conv\\\" && new_convenience=\\\"$new_convenience,$conv\\\"; done; func_echo_all \\\"$new_convenience\\\"` $wl--no-whole-archive'\n\t  compiler_needs_object=yes\n\t  ;;\n\tesac\n\tcase `$CC -V 2>&1 | sed 5q` in\n\t*Sun\\ C*)\t\t\t# Sun C 5.9\n\t  whole_archive_flag_spec='$wl--whole-archive`new_convenience=; for conv in $convenience\\\"\\\"; do test -z \\\"$conv\\\" || new_convenience=\\\"$new_convenience,$conv\\\"; done; func_echo_all \\\"$new_convenience\\\"` $wl--no-whole-archive'\n\t  compiler_needs_object=yes\n\t  tmp_sharedflag='-G' ;;\n\t*Sun\\ F*)\t\t\t# Sun Fortran 8.3\n\t  tmp_sharedflag='-G' ;;\n\tesac\n\tarchive_cmds='$CC '\"$tmp_sharedflag\"\"$tmp_addflag\"' $libobjs $deplibs $compiler_flags $wl-soname $wl$soname -o $lib'\n\n        if test yes = \"$supports_anon_versioning\"; then\n          archive_expsym_cmds='echo \"{ global:\" > $output_objdir/$libname.ver~\n            cat $export_symbols | sed -e \"s/\\(.*\\)/\\1;/\" >> $output_objdir/$libname.ver~\n            echo \"local: *; };\" >> $output_objdir/$libname.ver~\n            $CC '\"$tmp_sharedflag\"\"$tmp_addflag\"' $libobjs $deplibs $compiler_flags $wl-soname $wl$soname $wl-version-script $wl$output_objdir/$libname.ver -o $lib'\n        fi\n\n\tcase $cc_basename in\n\ttcc*)\n\t  export_dynamic_flag_spec='-rdynamic'\n\t  ;;\n\txlf* | bgf* | bgxlf* | mpixlf*)\n\t  # IBM XL Fortran 10.1 on PPC cannot create shared libs itself\n\t  whole_archive_flag_spec='--whole-archive$convenience --no-whole-archive'\n\t  hardcode_libdir_flag_spec='$wl-rpath $wl$libdir'\n\t  archive_cmds='$LD -shared $libobjs $deplibs $linker_flags -soname $soname -o $lib'\n\t  if test yes = \"$supports_anon_versioning\"; then\n\t    archive_expsym_cmds='echo \"{ global:\" > $output_objdir/$libname.ver~\n              cat $export_symbols | sed -e \"s/\\(.*\\)/\\1;/\" >> $output_objdir/$libname.ver~\n              echo \"local: *; };\" >> $output_objdir/$libname.ver~\n              $LD -shared $libobjs $deplibs $linker_flags -soname $soname -version-script $output_objdir/$libname.ver -o $lib'\n\t  fi\n\t  ;;\n\tesac\n      else\n        ld_shlibs=no\n      fi\n      ;;\n\n    netbsd* | netbsdelf*-gnu)\n      if echo __ELF__ | $CC -E - | $GREP __ELF__ >/dev/null; then\n\tarchive_cmds='$LD -Bshareable $libobjs $deplibs $linker_flags -o $lib'\n\twlarc=\n      else\n\tarchive_cmds='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags $wl-soname $wl$soname -o $lib'\n\tarchive_expsym_cmds='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags $wl-soname $wl$soname $wl-retain-symbols-file $wl$export_symbols -o $lib'\n      fi\n      ;;\n\n    solaris*)\n      if $LD -v 2>&1 | $GREP 'BFD 2\\.8' > /dev/null; then\n\tld_shlibs=no\n\tcat <<_LT_EOF 1>&2\n\n*** Warning: The releases 2.8.* of the GNU linker cannot reliably\n*** create shared libraries on Solaris systems.  Therefore, libtool\n*** is disabling shared libraries support.  We urge you to upgrade GNU\n*** binutils to release 2.9.1 or newer.  Another option is to modify\n*** your PATH or compiler configuration so that the native linker is\n*** used, and then restart.\n\n_LT_EOF\n      elif $LD --help 2>&1 | $GREP ': supported targets:.* elf' > /dev/null; then\n\tarchive_cmds='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags $wl-soname $wl$soname -o $lib'\n\tarchive_expsym_cmds='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags $wl-soname $wl$soname $wl-retain-symbols-file $wl$export_symbols -o $lib'\n      else\n\tld_shlibs=no\n      fi\n      ;;\n\n    sysv5* | sco3.2v5* | sco5v6* | unixware* | OpenUNIX*)\n      case `$LD -v 2>&1` in\n        *\\ [01].* | *\\ 2.[0-9].* | *\\ 2.1[0-5].*)\n\tld_shlibs=no\n\tcat <<_LT_EOF 1>&2\n\n*** Warning: Releases of the GNU linker prior to 2.16.91.0.3 cannot\n*** reliably create shared libraries on SCO systems.  Therefore, libtool\n*** is disabling shared libraries support.  We urge you to upgrade GNU\n*** binutils to release 2.16.91.0.3 or newer.  Another option is to modify\n*** your PATH or compiler configuration so that the native linker is\n*** used, and then restart.\n\n_LT_EOF\n\t;;\n\t*)\n\t  # For security reasons, it is highly recommended that you always\n\t  # use absolute paths for naming shared libraries, and exclude the\n\t  # DT_RUNPATH tag from executables and libraries.  But doing so\n\t  # requires that you compile everything twice, which is a pain.\n\t  if $LD --help 2>&1 | $GREP ': supported targets:.* elf' > /dev/null; then\n\t    hardcode_libdir_flag_spec='$wl-rpath $wl$libdir'\n\t    archive_cmds='$CC -shared $libobjs $deplibs $compiler_flags $wl-soname $wl$soname -o $lib'\n\t    archive_expsym_cmds='$CC -shared $libobjs $deplibs $compiler_flags $wl-soname $wl$soname $wl-retain-symbols-file $wl$export_symbols -o $lib'\n\t  else\n\t    ld_shlibs=no\n\t  fi\n\t;;\n      esac\n      ;;\n\n    sunos4*)\n      archive_cmds='$LD -assert pure-text -Bshareable -o $lib $libobjs $deplibs $linker_flags'\n      wlarc=\n      hardcode_direct=yes\n      hardcode_shlibpath_var=no\n      ;;\n\n    *)\n      if $LD --help 2>&1 | $GREP ': supported targets:.* elf' > /dev/null; then\n\tarchive_cmds='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags $wl-soname $wl$soname -o $lib'\n\tarchive_expsym_cmds='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags $wl-soname $wl$soname $wl-retain-symbols-file $wl$export_symbols -o $lib'\n      else\n\tld_shlibs=no\n      fi\n      ;;\n    esac\n\n    if test no = \"$ld_shlibs\"; then\n      runpath_var=\n      hardcode_libdir_flag_spec=\n      export_dynamic_flag_spec=\n      whole_archive_flag_spec=\n    fi\n  else\n    # PORTME fill in a description of your system's linker (not GNU ld)\n    case $host_os in\n    aix3*)\n      allow_undefined_flag=unsupported\n      always_export_symbols=yes\n      archive_expsym_cmds='$LD -o $output_objdir/$soname $libobjs $deplibs $linker_flags -bE:$export_symbols -T512 -H512 -bM:SRE~$AR $AR_FLAGS $lib $output_objdir/$soname'\n      # Note: this linker hardcodes the directories in LIBPATH if there\n      # are no directories specified by -L.\n      hardcode_minus_L=yes\n      if test yes = \"$GCC\" && test -z \"$lt_prog_compiler_static\"; then\n\t# Neither direct hardcoding nor static linking is supported with a\n\t# broken collect2.\n\thardcode_direct=unsupported\n      fi\n      ;;\n\n    aix[4-9]*)\n      if test ia64 = \"$host_cpu\"; then\n\t# On IA64, the linker does run time linking by default, so we don't\n\t# have to do anything special.\n\taix_use_runtimelinking=no\n\texp_sym_flag='-Bexport'\n\tno_entry_flag=\n      else\n\t# If we're using GNU nm, then we don't want the \"-C\" option.\n\t# -C means demangle to GNU nm, but means don't demangle to AIX nm.\n\t# Without the \"-l\" option, or with the \"-B\" option, AIX nm treats\n\t# weak defined symbols like other global defined symbols, whereas\n\t# GNU nm marks them as \"W\".\n\t# While the 'weak' keyword is ignored in the Export File, we need\n\t# it in the Import File for the 'aix-soname' feature, so we have\n\t# to replace the \"-B\" option with \"-P\" for AIX nm.\n\tif $NM -V 2>&1 | $GREP 'GNU' > /dev/null; then\n\t  export_symbols_cmds='$NM -Bpg $libobjs $convenience | awk '\\''{ if (((\\$ 2 == \"T\") || (\\$ 2 == \"D\") || (\\$ 2 == \"B\") || (\\$ 2 == \"W\")) && (substr(\\$ 3,1,1) != \".\")) { if (\\$ 2 == \"W\") { print \\$ 3 \" weak\" } else { print \\$ 3 } } }'\\'' | sort -u > $export_symbols'\n\telse\n\t  export_symbols_cmds='`func_echo_all $NM | $SED -e '\\''s/B\\([^B]*\\)$/P\\1/'\\''` -PCpgl $libobjs $convenience | awk '\\''{ if (((\\$ 2 == \"T\") || (\\$ 2 == \"D\") || (\\$ 2 == \"B\") || (\\$ 2 == \"W\") || (\\$ 2 == \"V\") || (\\$ 2 == \"Z\")) && (substr(\\$ 1,1,1) != \".\")) { if ((\\$ 2 == \"W\") || (\\$ 2 == \"V\") || (\\$ 2 == \"Z\")) { print \\$ 1 \" weak\" } else { print \\$ 1 } } }'\\'' | sort -u > $export_symbols'\n\tfi\n\taix_use_runtimelinking=no\n\n\t# Test if we are trying to use run time linking or normal\n\t# AIX style linking. If -brtl is somewhere in LDFLAGS, we\n\t# have runtime linking enabled, and use it for executables.\n\t# For shared libraries, we enable/disable runtime linking\n\t# depending on the kind of the shared library created -\n\t# when \"with_aix_soname,aix_use_runtimelinking\" is:\n\t# \"aix,no\"   lib.a(lib.so.V) shared, rtl:no,  for executables\n\t# \"aix,yes\"  lib.so          shared, rtl:yes, for executables\n\t#            lib.a           static archive\n\t# \"both,no\"  lib.so.V(shr.o) shared, rtl:yes\n\t#            lib.a(lib.so.V) shared, rtl:no,  for executables\n\t# \"both,yes\" lib.so.V(shr.o) shared, rtl:yes, for executables\n\t#            lib.a(lib.so.V) shared, rtl:no\n\t# \"svr4,*\"   lib.so.V(shr.o) shared, rtl:yes, for executables\n\t#            lib.a           static archive\n\tcase $host_os in aix4.[23]|aix4.[23].*|aix[5-9]*)\n\t  for ld_flag in $LDFLAGS; do\n\t  if (test x-brtl = \"x$ld_flag\" || test x-Wl,-brtl = \"x$ld_flag\"); then\n\t    aix_use_runtimelinking=yes\n\t    break\n\t  fi\n\t  done\n\t  if test svr4,no = \"$with_aix_soname,$aix_use_runtimelinking\"; then\n\t    # With aix-soname=svr4, we create the lib.so.V shared archives only,\n\t    # so we don't have lib.a shared libs to link our executables.\n\t    # We have to force runtime linking in this case.\n\t    aix_use_runtimelinking=yes\n\t    LDFLAGS=\"$LDFLAGS -Wl,-brtl\"\n\t  fi\n\t  ;;\n\tesac\n\n\texp_sym_flag='-bexport'\n\tno_entry_flag='-bnoentry'\n      fi\n\n      # When large executables or shared objects are built, AIX ld can\n      # have problems creating the table of contents.  If linking a library\n      # or program results in \"error TOC overflow\" add -mminimal-toc to\n      # CXXFLAGS/CFLAGS for g++/gcc.  In the cases where that is not\n      # enough to fix the problem, add -Wl,-bbigtoc to LDFLAGS.\n\n      archive_cmds=''\n      hardcode_direct=yes\n      hardcode_direct_absolute=yes\n      hardcode_libdir_separator=':'\n      link_all_deplibs=yes\n      file_list_spec='$wl-f,'\n      case $with_aix_soname,$aix_use_runtimelinking in\n      aix,*) ;; # traditional, no import file\n      svr4,* | *,yes) # use import file\n\t# The Import File defines what to hardcode.\n\thardcode_direct=no\n\thardcode_direct_absolute=no\n\t;;\n      esac\n\n      if test yes = \"$GCC\"; then\n\tcase $host_os in aix4.[012]|aix4.[012].*)\n\t# We only want to do this on AIX 4.2 and lower, the check\n\t# below for broken collect2 doesn't work under 4.3+\n\t  collect2name=`$CC -print-prog-name=collect2`\n\t  if test -f \"$collect2name\" &&\n\t   strings \"$collect2name\" | $GREP resolve_lib_name >/dev/null\n\t  then\n\t  # We have reworked collect2\n\t  :\n\t  else\n\t  # We have old collect2\n\t  hardcode_direct=unsupported\n\t  # It fails to find uninstalled libraries when the uninstalled\n\t  # path is not listed in the libpath.  Setting hardcode_minus_L\n\t  # to unsupported forces relinking\n\t  hardcode_minus_L=yes\n\t  hardcode_libdir_flag_spec='-L$libdir'\n\t  hardcode_libdir_separator=\n\t  fi\n\t  ;;\n\tesac\n\tshared_flag='-shared'\n\tif test yes = \"$aix_use_runtimelinking\"; then\n\t  shared_flag=\"$shared_flag \"'$wl-G'\n\tfi\n\t# Need to ensure runtime linking is disabled for the traditional\n\t# shared library, or the linker may eventually find shared libraries\n\t# /with/ Import File - we do not want to mix them.\n\tshared_flag_aix='-shared'\n\tshared_flag_svr4='-shared $wl-G'\n      else\n\t# not using gcc\n\tif test ia64 = \"$host_cpu\"; then\n\t# VisualAge C++, Version 5.5 for AIX 5L for IA-64, Beta 3 Release\n\t# chokes on -Wl,-G. The following line is correct:\n\t  shared_flag='-G'\n\telse\n\t  if test yes = \"$aix_use_runtimelinking\"; then\n\t    shared_flag='$wl-G'\n\t  else\n\t    shared_flag='$wl-bM:SRE'\n\t  fi\n\t  shared_flag_aix='$wl-bM:SRE'\n\t  shared_flag_svr4='$wl-G'\n\tfi\n      fi\n\n      export_dynamic_flag_spec='$wl-bexpall'\n      # It seems that -bexpall does not export symbols beginning with\n      # underscore (_), so it is better to generate a list of symbols to export.\n      always_export_symbols=yes\n      if test aix,yes = \"$with_aix_soname,$aix_use_runtimelinking\"; then\n\t# Warning - without using the other runtime loading flags (-brtl),\n\t# -berok will link without error, but may produce a broken library.\n\tallow_undefined_flag='-berok'\n        # Determine the default libpath from the value encoded in an\n        # empty executable.\n        if test set = \"${lt_cv_aix_libpath+set}\"; then\n  aix_libpath=$lt_cv_aix_libpath\nelse\n  if ${lt_cv_aix_libpath_+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  cat confdefs.h - <<_ACEOF >conftest.$ac_ext\n/* end confdefs.h.  */\n\nint\nmain ()\n{\n\n  ;\n  return 0;\n}\n_ACEOF\nif ac_fn_c_try_link \"$LINENO\"; then :\n\n  lt_aix_libpath_sed='\n      /Import File Strings/,/^$/ {\n\t  /^0/ {\n\t      s/^0  *\\([^ ]*\\) *$/\\1/\n\t      p\n\t  }\n      }'\n  lt_cv_aix_libpath_=`dump -H conftest$ac_exeext 2>/dev/null | $SED -n -e \"$lt_aix_libpath_sed\"`\n  # Check for a 64-bit object if we didn't find anything.\n  if test -z \"$lt_cv_aix_libpath_\"; then\n    lt_cv_aix_libpath_=`dump -HX64 conftest$ac_exeext 2>/dev/null | $SED -n -e \"$lt_aix_libpath_sed\"`\n  fi\nfi\nrm -f core conftest.err conftest.$ac_objext \\\n    conftest$ac_exeext conftest.$ac_ext\n  if test -z \"$lt_cv_aix_libpath_\"; then\n    lt_cv_aix_libpath_=/usr/lib:/lib\n  fi\n\nfi\n\n  aix_libpath=$lt_cv_aix_libpath_\nfi\n\n        hardcode_libdir_flag_spec='$wl-blibpath:$libdir:'\"$aix_libpath\"\n        archive_expsym_cmds='$CC -o $output_objdir/$soname $libobjs $deplibs $wl'$no_entry_flag' $compiler_flags `if test -n \"$allow_undefined_flag\"; then func_echo_all \"$wl$allow_undefined_flag\"; else :; fi` $wl'$exp_sym_flag:\\$export_symbols' '$shared_flag\n      else\n\tif test ia64 = \"$host_cpu\"; then\n\t  hardcode_libdir_flag_spec='$wl-R $libdir:/usr/lib:/lib'\n\t  allow_undefined_flag=\"-z nodefs\"\n\t  archive_expsym_cmds=\"\\$CC $shared_flag\"' -o $output_objdir/$soname $libobjs $deplibs '\"\\$wl$no_entry_flag\"' $compiler_flags $wl$allow_undefined_flag '\"\\$wl$exp_sym_flag:\\$export_symbols\"\n\telse\n\t # Determine the default libpath from the value encoded in an\n\t # empty executable.\n\t if test set = \"${lt_cv_aix_libpath+set}\"; then\n  aix_libpath=$lt_cv_aix_libpath\nelse\n  if ${lt_cv_aix_libpath_+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  cat confdefs.h - <<_ACEOF >conftest.$ac_ext\n/* end confdefs.h.  */\n\nint\nmain ()\n{\n\n  ;\n  return 0;\n}\n_ACEOF\nif ac_fn_c_try_link \"$LINENO\"; then :\n\n  lt_aix_libpath_sed='\n      /Import File Strings/,/^$/ {\n\t  /^0/ {\n\t      s/^0  *\\([^ ]*\\) *$/\\1/\n\t      p\n\t  }\n      }'\n  lt_cv_aix_libpath_=`dump -H conftest$ac_exeext 2>/dev/null | $SED -n -e \"$lt_aix_libpath_sed\"`\n  # Check for a 64-bit object if we didn't find anything.\n  if test -z \"$lt_cv_aix_libpath_\"; then\n    lt_cv_aix_libpath_=`dump -HX64 conftest$ac_exeext 2>/dev/null | $SED -n -e \"$lt_aix_libpath_sed\"`\n  fi\nfi\nrm -f core conftest.err conftest.$ac_objext \\\n    conftest$ac_exeext conftest.$ac_ext\n  if test -z \"$lt_cv_aix_libpath_\"; then\n    lt_cv_aix_libpath_=/usr/lib:/lib\n  fi\n\nfi\n\n  aix_libpath=$lt_cv_aix_libpath_\nfi\n\n\t hardcode_libdir_flag_spec='$wl-blibpath:$libdir:'\"$aix_libpath\"\n\t  # Warning - without using the other run time loading flags,\n\t  # -berok will link without error, but may produce a broken library.\n\t  no_undefined_flag=' $wl-bernotok'\n\t  allow_undefined_flag=' $wl-berok'\n\t  if test yes = \"$with_gnu_ld\"; then\n\t    # We only use this code for GNU lds that support --whole-archive.\n\t    whole_archive_flag_spec='$wl--whole-archive$convenience $wl--no-whole-archive'\n\t  else\n\t    # Exported symbols can be pulled into shared objects from archives\n\t    whole_archive_flag_spec='$convenience'\n\t  fi\n\t  archive_cmds_need_lc=yes\n\t  archive_expsym_cmds='$RM -r $output_objdir/$realname.d~$MKDIR $output_objdir/$realname.d'\n\t  # -brtl affects multiple linker settings, -berok does not and is overridden later\n\t  compiler_flags_filtered='`func_echo_all \"$compiler_flags \" | $SED -e \"s%-brtl\\\\([, ]\\\\)%-berok\\\\1%g\"`'\n\t  if test svr4 != \"$with_aix_soname\"; then\n\t    # This is similar to how AIX traditionally builds its shared libraries.\n\t    archive_expsym_cmds=\"$archive_expsym_cmds\"'~$CC '$shared_flag_aix' -o $output_objdir/$realname.d/$soname $libobjs $deplibs $wl-bnoentry '$compiler_flags_filtered'$wl-bE:$export_symbols$allow_undefined_flag~$AR $AR_FLAGS $output_objdir/$libname$release.a $output_objdir/$realname.d/$soname'\n\t  fi\n\t  if test aix != \"$with_aix_soname\"; then\n\t    archive_expsym_cmds=\"$archive_expsym_cmds\"'~$CC '$shared_flag_svr4' -o $output_objdir/$realname.d/$shared_archive_member_spec.o $libobjs $deplibs $wl-bnoentry '$compiler_flags_filtered'$wl-bE:$export_symbols$allow_undefined_flag~$STRIP -e $output_objdir/$realname.d/$shared_archive_member_spec.o~( func_echo_all \"#! $soname($shared_archive_member_spec.o)\"; if test shr_64 = \"$shared_archive_member_spec\"; then func_echo_all \"# 64\"; else func_echo_all \"# 32\"; fi; cat $export_symbols ) > $output_objdir/$realname.d/$shared_archive_member_spec.imp~$AR $AR_FLAGS $output_objdir/$soname $output_objdir/$realname.d/$shared_archive_member_spec.o $output_objdir/$realname.d/$shared_archive_member_spec.imp'\n\t  else\n\t    # used by -dlpreopen to get the symbols\n\t    archive_expsym_cmds=\"$archive_expsym_cmds\"'~$MV  $output_objdir/$realname.d/$soname $output_objdir'\n\t  fi\n\t  archive_expsym_cmds=\"$archive_expsym_cmds\"'~$RM -r $output_objdir/$realname.d'\n\tfi\n      fi\n      ;;\n\n    amigaos*)\n      case $host_cpu in\n      powerpc)\n            # see comment about AmigaOS4 .so support\n            archive_cmds='$CC -shared $libobjs $deplibs $compiler_flags $wl-soname $wl$soname -o $lib'\n            archive_expsym_cmds=''\n        ;;\n      m68k)\n            archive_cmds='$RM $output_objdir/a2ixlibrary.data~$ECHO \"#define NAME $libname\" > $output_objdir/a2ixlibrary.data~$ECHO \"#define LIBRARY_ID 1\" >> $output_objdir/a2ixlibrary.data~$ECHO \"#define VERSION $major\" >> $output_objdir/a2ixlibrary.data~$ECHO \"#define REVISION $revision\" >> $output_objdir/a2ixlibrary.data~$AR $AR_FLAGS $lib $libobjs~$RANLIB $lib~(cd $output_objdir && a2ixlibrary -32)'\n            hardcode_libdir_flag_spec='-L$libdir'\n            hardcode_minus_L=yes\n        ;;\n      esac\n      ;;\n\n    bsdi[45]*)\n      export_dynamic_flag_spec=-rdynamic\n      ;;\n\n    cygwin* | mingw* | pw32* | cegcc*)\n      # When not using gcc, we currently assume that we are using\n      # Microsoft Visual C++.\n      # hardcode_libdir_flag_spec is actually meaningless, as there is\n      # no search path for DLLs.\n      case $cc_basename in\n      cl*)\n\t# Native MSVC\n\thardcode_libdir_flag_spec=' '\n\tallow_undefined_flag=unsupported\n\talways_export_symbols=yes\n\tfile_list_spec='@'\n\t# Tell ltmain to make .lib files, not .a files.\n\tlibext=lib\n\t# Tell ltmain to make .dll files, not .so files.\n\tshrext_cmds=.dll\n\t# FIXME: Setting linknames here is a bad hack.\n\tarchive_cmds='$CC -o $output_objdir/$soname $libobjs $compiler_flags $deplibs -Wl,-DLL,-IMPLIB:\"$tool_output_objdir$libname.dll.lib\"~linknames='\n\tarchive_expsym_cmds='if   test DEF = \"`$SED -n     -e '\\''s/^[\t ]*//'\\''     -e '\\''/^\\(;.*\\)*$/d'\\''     -e '\\''s/^\\(EXPORTS\\|LIBRARY\\)\\([\t ].*\\)*$/DEF/p'\\''     -e q     $export_symbols`\" ; then\n            cp \"$export_symbols\" \"$output_objdir/$soname.def\";\n            echo \"$tool_output_objdir$soname.def\" > \"$output_objdir/$soname.exp\";\n          else\n            $SED -e '\\''s/^/-link -EXPORT:/'\\'' < $export_symbols > $output_objdir/$soname.exp;\n          fi~\n          $CC -o $tool_output_objdir$soname $libobjs $compiler_flags $deplibs \"@$tool_output_objdir$soname.exp\" -Wl,-DLL,-IMPLIB:\"$tool_output_objdir$libname.dll.lib\"~\n          linknames='\n\t# The linker will not automatically build a static lib if we build a DLL.\n\t# _LT_TAGVAR(old_archive_from_new_cmds, )='true'\n\tenable_shared_with_static_runtimes=yes\n\texclude_expsyms='_NULL_IMPORT_DESCRIPTOR|_IMPORT_DESCRIPTOR_.*'\n\texport_symbols_cmds='$NM $libobjs $convenience | $global_symbol_pipe | $SED -e '\\''/^[BCDGRS][ ]/s/.*[ ]\\([^ ]*\\)/\\1,DATA/'\\'' | $SED -e '\\''/^[AITW][ ]/s/.*[ ]//'\\'' | sort | uniq > $export_symbols'\n\t# Don't use ranlib\n\told_postinstall_cmds='chmod 644 $oldlib'\n\tpostlink_cmds='lt_outputfile=\"@OUTPUT@\"~\n          lt_tool_outputfile=\"@TOOL_OUTPUT@\"~\n          case $lt_outputfile in\n            *.exe|*.EXE) ;;\n            *)\n              lt_outputfile=$lt_outputfile.exe\n              lt_tool_outputfile=$lt_tool_outputfile.exe\n              ;;\n          esac~\n          if test : != \"$MANIFEST_TOOL\" && test -f \"$lt_outputfile.manifest\"; then\n            $MANIFEST_TOOL -manifest \"$lt_tool_outputfile.manifest\" -outputresource:\"$lt_tool_outputfile\" || exit 1;\n            $RM \"$lt_outputfile.manifest\";\n          fi'\n\t;;\n      *)\n\t# Assume MSVC wrapper\n\thardcode_libdir_flag_spec=' '\n\tallow_undefined_flag=unsupported\n\t# Tell ltmain to make .lib files, not .a files.\n\tlibext=lib\n\t# Tell ltmain to make .dll files, not .so files.\n\tshrext_cmds=.dll\n\t# FIXME: Setting linknames here is a bad hack.\n\tarchive_cmds='$CC -o $lib $libobjs $compiler_flags `func_echo_all \"$deplibs\" | $SED '\\''s/ -lc$//'\\''` -link -dll~linknames='\n\t# The linker will automatically build a .lib file if we build a DLL.\n\told_archive_from_new_cmds='true'\n\t# FIXME: Should let the user specify the lib program.\n\told_archive_cmds='lib -OUT:$oldlib$oldobjs$old_deplibs'\n\tenable_shared_with_static_runtimes=yes\n\t;;\n      esac\n      ;;\n\n    darwin* | rhapsody*)\n\n\n  archive_cmds_need_lc=no\n  hardcode_direct=no\n  hardcode_automatic=yes\n  hardcode_shlibpath_var=unsupported\n  if test yes = \"$lt_cv_ld_force_load\"; then\n    whole_archive_flag_spec='`for conv in $convenience\\\"\\\"; do test  -n \\\"$conv\\\" && new_convenience=\\\"$new_convenience $wl-force_load,$conv\\\"; done; func_echo_all \\\"$new_convenience\\\"`'\n\n  else\n    whole_archive_flag_spec=''\n  fi\n  link_all_deplibs=yes\n  allow_undefined_flag=$_lt_dar_allow_undefined\n  case $cc_basename in\n     ifort*|nagfor*) _lt_dar_can_shared=yes ;;\n     *) _lt_dar_can_shared=$GCC ;;\n  esac\n  if test yes = \"$_lt_dar_can_shared\"; then\n    output_verbose_link_cmd=func_echo_all\n    archive_cmds=\"\\$CC -dynamiclib \\$allow_undefined_flag -o \\$lib \\$libobjs \\$deplibs \\$compiler_flags -install_name \\$rpath/\\$soname \\$verstring $_lt_dar_single_mod$_lt_dsymutil\"\n    module_cmds=\"\\$CC \\$allow_undefined_flag -o \\$lib -bundle \\$libobjs \\$deplibs \\$compiler_flags$_lt_dsymutil\"\n    archive_expsym_cmds=\"sed 's|^|_|' < \\$export_symbols > \\$output_objdir/\\$libname-symbols.expsym~\\$CC -dynamiclib \\$allow_undefined_flag -o \\$lib \\$libobjs \\$deplibs \\$compiler_flags -install_name \\$rpath/\\$soname \\$verstring $_lt_dar_single_mod$_lt_dar_export_syms$_lt_dsymutil\"\n    module_expsym_cmds=\"sed -e 's|^|_|' < \\$export_symbols > \\$output_objdir/\\$libname-symbols.expsym~\\$CC \\$allow_undefined_flag -o \\$lib -bundle \\$libobjs \\$deplibs \\$compiler_flags$_lt_dar_export_syms$_lt_dsymutil\"\n\n  else\n  ld_shlibs=no\n  fi\n\n      ;;\n\n    dgux*)\n      archive_cmds='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags'\n      hardcode_libdir_flag_spec='-L$libdir'\n      hardcode_shlibpath_var=no\n      ;;\n\n    # FreeBSD 2.2.[012] allows us to include c++rt0.o to get C++ constructor\n    # support.  Future versions do this automatically, but an explicit c++rt0.o\n    # does not break anything, and helps significantly (at the cost of a little\n    # extra space).\n    freebsd2.2*)\n      archive_cmds='$LD -Bshareable -o $lib $libobjs $deplibs $linker_flags /usr/lib/c++rt0.o'\n      hardcode_libdir_flag_spec='-R$libdir'\n      hardcode_direct=yes\n      hardcode_shlibpath_var=no\n      ;;\n\n    # Unfortunately, older versions of FreeBSD 2 do not have this feature.\n    freebsd2.*)\n      archive_cmds='$LD -Bshareable -o $lib $libobjs $deplibs $linker_flags'\n      hardcode_direct=yes\n      hardcode_minus_L=yes\n      hardcode_shlibpath_var=no\n      ;;\n\n    # FreeBSD 3 and greater uses gcc -shared to do shared libraries.\n    freebsd* | dragonfly*)\n      archive_cmds='$CC -shared $pic_flag -o $lib $libobjs $deplibs $compiler_flags'\n      hardcode_libdir_flag_spec='-R$libdir'\n      hardcode_direct=yes\n      hardcode_shlibpath_var=no\n      ;;\n\n    hpux9*)\n      if test yes = \"$GCC\"; then\n\tarchive_cmds='$RM $output_objdir/$soname~$CC -shared $pic_flag $wl+b $wl$install_libdir -o $output_objdir/$soname $libobjs $deplibs $compiler_flags~test \"x$output_objdir/$soname\" = \"x$lib\" || mv $output_objdir/$soname $lib'\n      else\n\tarchive_cmds='$RM $output_objdir/$soname~$LD -b +b $install_libdir -o $output_objdir/$soname $libobjs $deplibs $linker_flags~test \"x$output_objdir/$soname\" = \"x$lib\" || mv $output_objdir/$soname $lib'\n      fi\n      hardcode_libdir_flag_spec='$wl+b $wl$libdir'\n      hardcode_libdir_separator=:\n      hardcode_direct=yes\n\n      # hardcode_minus_L: Not really in the search PATH,\n      # but as the default location of the library.\n      hardcode_minus_L=yes\n      export_dynamic_flag_spec='$wl-E'\n      ;;\n\n    hpux10*)\n      if test yes,no = \"$GCC,$with_gnu_ld\"; then\n\tarchive_cmds='$CC -shared $pic_flag $wl+h $wl$soname $wl+b $wl$install_libdir -o $lib $libobjs $deplibs $compiler_flags'\n      else\n\tarchive_cmds='$LD -b +h $soname +b $install_libdir -o $lib $libobjs $deplibs $linker_flags'\n      fi\n      if test no = \"$with_gnu_ld\"; then\n\thardcode_libdir_flag_spec='$wl+b $wl$libdir'\n\thardcode_libdir_separator=:\n\thardcode_direct=yes\n\thardcode_direct_absolute=yes\n\texport_dynamic_flag_spec='$wl-E'\n\t# hardcode_minus_L: Not really in the search PATH,\n\t# but as the default location of the library.\n\thardcode_minus_L=yes\n      fi\n      ;;\n\n    hpux11*)\n      if test yes,no = \"$GCC,$with_gnu_ld\"; then\n\tcase $host_cpu in\n\thppa*64*)\n\t  archive_cmds='$CC -shared $wl+h $wl$soname -o $lib $libobjs $deplibs $compiler_flags'\n\t  ;;\n\tia64*)\n\t  archive_cmds='$CC -shared $pic_flag $wl+h $wl$soname $wl+nodefaultrpath -o $lib $libobjs $deplibs $compiler_flags'\n\t  ;;\n\t*)\n\t  archive_cmds='$CC -shared $pic_flag $wl+h $wl$soname $wl+b $wl$install_libdir -o $lib $libobjs $deplibs $compiler_flags'\n\t  ;;\n\tesac\n      else\n\tcase $host_cpu in\n\thppa*64*)\n\t  archive_cmds='$CC -b $wl+h $wl$soname -o $lib $libobjs $deplibs $compiler_flags'\n\t  ;;\n\tia64*)\n\t  archive_cmds='$CC -b $wl+h $wl$soname $wl+nodefaultrpath -o $lib $libobjs $deplibs $compiler_flags'\n\t  ;;\n\t*)\n\n\t  # Older versions of the 11.00 compiler do not understand -b yet\n\t  # (HP92453-01 A.11.01.20 doesn't, HP92453-01 B.11.X.35175-35176.GP does)\n\t  { $as_echo \"$as_me:${as_lineno-$LINENO}: checking if $CC understands -b\" >&5\n$as_echo_n \"checking if $CC understands -b... \" >&6; }\nif ${lt_cv_prog_compiler__b+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  lt_cv_prog_compiler__b=no\n   save_LDFLAGS=$LDFLAGS\n   LDFLAGS=\"$LDFLAGS -b\"\n   echo \"$lt_simple_link_test_code\" > conftest.$ac_ext\n   if (eval $ac_link 2>conftest.err) && test -s conftest$ac_exeext; then\n     # The linker can only warn and ignore the option if not recognized\n     # So say no if there are warnings\n     if test -s conftest.err; then\n       # Append any errors to the config.log.\n       cat conftest.err 1>&5\n       $ECHO \"$_lt_linker_boilerplate\" | $SED '/^$/d' > conftest.exp\n       $SED '/^$/d; /^ *+/d' conftest.err >conftest.er2\n       if diff conftest.exp conftest.er2 >/dev/null; then\n         lt_cv_prog_compiler__b=yes\n       fi\n     else\n       lt_cv_prog_compiler__b=yes\n     fi\n   fi\n   $RM -r conftest*\n   LDFLAGS=$save_LDFLAGS\n\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $lt_cv_prog_compiler__b\" >&5\n$as_echo \"$lt_cv_prog_compiler__b\" >&6; }\n\nif test yes = \"$lt_cv_prog_compiler__b\"; then\n    archive_cmds='$CC -b $wl+h $wl$soname $wl+b $wl$install_libdir -o $lib $libobjs $deplibs $compiler_flags'\nelse\n    archive_cmds='$LD -b +h $soname +b $install_libdir -o $lib $libobjs $deplibs $linker_flags'\nfi\n\n\t  ;;\n\tesac\n      fi\n      if test no = \"$with_gnu_ld\"; then\n\thardcode_libdir_flag_spec='$wl+b $wl$libdir'\n\thardcode_libdir_separator=:\n\n\tcase $host_cpu in\n\thppa*64*|ia64*)\n\t  hardcode_direct=no\n\t  hardcode_shlibpath_var=no\n\t  ;;\n\t*)\n\t  hardcode_direct=yes\n\t  hardcode_direct_absolute=yes\n\t  export_dynamic_flag_spec='$wl-E'\n\n\t  # hardcode_minus_L: Not really in the search PATH,\n\t  # but as the default location of the library.\n\t  hardcode_minus_L=yes\n\t  ;;\n\tesac\n      fi\n      ;;\n\n    irix5* | irix6* | nonstopux*)\n      if test yes = \"$GCC\"; then\n\tarchive_cmds='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags $wl-soname $wl$soname `test -n \"$verstring\" && func_echo_all \"$wl-set_version $wl$verstring\"` $wl-update_registry $wl$output_objdir/so_locations -o $lib'\n\t# Try to use the -exported_symbol ld option, if it does not\n\t# work, assume that -exports_file does not work either and\n\t# implicitly export all symbols.\n\t# This should be the same for all languages, so no per-tag cache variable.\n\t{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking whether the $host_os linker accepts -exported_symbol\" >&5\n$as_echo_n \"checking whether the $host_os linker accepts -exported_symbol... \" >&6; }\nif ${lt_cv_irix_exported_symbol+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  save_LDFLAGS=$LDFLAGS\n\t   LDFLAGS=\"$LDFLAGS -shared $wl-exported_symbol ${wl}foo $wl-update_registry $wl/dev/null\"\n\t   cat confdefs.h - <<_ACEOF >conftest.$ac_ext\n/* end confdefs.h.  */\nint foo (void) { return 0; }\n_ACEOF\nif ac_fn_c_try_link \"$LINENO\"; then :\n  lt_cv_irix_exported_symbol=yes\nelse\n  lt_cv_irix_exported_symbol=no\nfi\nrm -f core conftest.err conftest.$ac_objext \\\n    conftest$ac_exeext conftest.$ac_ext\n           LDFLAGS=$save_LDFLAGS\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $lt_cv_irix_exported_symbol\" >&5\n$as_echo \"$lt_cv_irix_exported_symbol\" >&6; }\n\tif test yes = \"$lt_cv_irix_exported_symbol\"; then\n          archive_expsym_cmds='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags $wl-soname $wl$soname `test -n \"$verstring\" && func_echo_all \"$wl-set_version $wl$verstring\"` $wl-update_registry $wl$output_objdir/so_locations $wl-exports_file $wl$export_symbols -o $lib'\n\tfi\n\tlink_all_deplibs=no\n      else\n\tarchive_cmds='$CC -shared $libobjs $deplibs $compiler_flags -soname $soname `test -n \"$verstring\" && func_echo_all \"-set_version $verstring\"` -update_registry $output_objdir/so_locations -o $lib'\n\tarchive_expsym_cmds='$CC -shared $libobjs $deplibs $compiler_flags -soname $soname `test -n \"$verstring\" && func_echo_all \"-set_version $verstring\"` -update_registry $output_objdir/so_locations -exports_file $export_symbols -o $lib'\n      fi\n      archive_cmds_need_lc='no'\n      hardcode_libdir_flag_spec='$wl-rpath $wl$libdir'\n      hardcode_libdir_separator=:\n      inherit_rpath=yes\n      link_all_deplibs=yes\n      ;;\n\n    linux*)\n      case $cc_basename in\n      tcc*)\n\t# Fabrice Bellard et al's Tiny C Compiler\n\tld_shlibs=yes\n\tarchive_cmds='$CC -shared $pic_flag -o $lib $libobjs $deplibs $compiler_flags'\n\t;;\n      esac\n      ;;\n\n    netbsd* | netbsdelf*-gnu)\n      if echo __ELF__ | $CC -E - | $GREP __ELF__ >/dev/null; then\n\tarchive_cmds='$LD -Bshareable -o $lib $libobjs $deplibs $linker_flags'  # a.out\n      else\n\tarchive_cmds='$LD -shared -o $lib $libobjs $deplibs $linker_flags'      # ELF\n      fi\n      hardcode_libdir_flag_spec='-R$libdir'\n      hardcode_direct=yes\n      hardcode_shlibpath_var=no\n      ;;\n\n    newsos6)\n      archive_cmds='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags'\n      hardcode_direct=yes\n      hardcode_libdir_flag_spec='$wl-rpath $wl$libdir'\n      hardcode_libdir_separator=:\n      hardcode_shlibpath_var=no\n      ;;\n\n    *nto* | *qnx*)\n      ;;\n\n    openbsd* | bitrig*)\n      if test -f /usr/libexec/ld.so; then\n\thardcode_direct=yes\n\thardcode_shlibpath_var=no\n\thardcode_direct_absolute=yes\n\tif test -z \"`echo __ELF__ | $CC -E - | $GREP __ELF__`\"; then\n\t  archive_cmds='$CC -shared $pic_flag -o $lib $libobjs $deplibs $compiler_flags'\n\t  archive_expsym_cmds='$CC -shared $pic_flag -o $lib $libobjs $deplibs $compiler_flags $wl-retain-symbols-file,$export_symbols'\n\t  hardcode_libdir_flag_spec='$wl-rpath,$libdir'\n\t  export_dynamic_flag_spec='$wl-E'\n\telse\n\t  archive_cmds='$CC -shared $pic_flag -o $lib $libobjs $deplibs $compiler_flags'\n\t  hardcode_libdir_flag_spec='$wl-rpath,$libdir'\n\tfi\n      else\n\tld_shlibs=no\n      fi\n      ;;\n\n    os2*)\n      hardcode_libdir_flag_spec='-L$libdir'\n      hardcode_minus_L=yes\n      allow_undefined_flag=unsupported\n      shrext_cmds=.dll\n      archive_cmds='$ECHO \"LIBRARY ${soname%$shared_ext} INITINSTANCE TERMINSTANCE\" > $output_objdir/$libname.def~\n\t$ECHO \"DESCRIPTION \\\"$libname\\\"\" >> $output_objdir/$libname.def~\n\t$ECHO \"DATA MULTIPLE NONSHARED\" >> $output_objdir/$libname.def~\n\t$ECHO EXPORTS >> $output_objdir/$libname.def~\n\temxexp $libobjs | $SED /\"_DLL_InitTerm\"/d >> $output_objdir/$libname.def~\n\t$CC -Zdll -Zcrtdll -o $output_objdir/$soname $libobjs $deplibs $compiler_flags $output_objdir/$libname.def~\n\temximp -o $lib $output_objdir/$libname.def'\n      archive_expsym_cmds='$ECHO \"LIBRARY ${soname%$shared_ext} INITINSTANCE TERMINSTANCE\" > $output_objdir/$libname.def~\n\t$ECHO \"DESCRIPTION \\\"$libname\\\"\" >> $output_objdir/$libname.def~\n\t$ECHO \"DATA MULTIPLE NONSHARED\" >> $output_objdir/$libname.def~\n\t$ECHO EXPORTS >> $output_objdir/$libname.def~\n\tprefix_cmds=\"$SED\"~\n\tif test EXPORTS = \"`$SED 1q $export_symbols`\"; then\n\t  prefix_cmds=\"$prefix_cmds -e 1d\";\n\tfi~\n\tprefix_cmds=\"$prefix_cmds -e \\\"s/^\\(.*\\)$/_\\1/g\\\"\"~\n\tcat $export_symbols | $prefix_cmds >> $output_objdir/$libname.def~\n\t$CC -Zdll -Zcrtdll -o $output_objdir/$soname $libobjs $deplibs $compiler_flags $output_objdir/$libname.def~\n\temximp -o $lib $output_objdir/$libname.def'\n      old_archive_From_new_cmds='emximp -o $output_objdir/${libname}_dll.a $output_objdir/$libname.def'\n      enable_shared_with_static_runtimes=yes\n      ;;\n\n    osf3*)\n      if test yes = \"$GCC\"; then\n\tallow_undefined_flag=' $wl-expect_unresolved $wl\\*'\n\tarchive_cmds='$CC -shared$allow_undefined_flag $libobjs $deplibs $compiler_flags $wl-soname $wl$soname `test -n \"$verstring\" && func_echo_all \"$wl-set_version $wl$verstring\"` $wl-update_registry $wl$output_objdir/so_locations -o $lib'\n      else\n\tallow_undefined_flag=' -expect_unresolved \\*'\n\tarchive_cmds='$CC -shared$allow_undefined_flag $libobjs $deplibs $compiler_flags -soname $soname `test -n \"$verstring\" && func_echo_all \"-set_version $verstring\"` -update_registry $output_objdir/so_locations -o $lib'\n      fi\n      archive_cmds_need_lc='no'\n      hardcode_libdir_flag_spec='$wl-rpath $wl$libdir'\n      hardcode_libdir_separator=:\n      ;;\n\n    osf4* | osf5*)\t# as osf3* with the addition of -msym flag\n      if test yes = \"$GCC\"; then\n\tallow_undefined_flag=' $wl-expect_unresolved $wl\\*'\n\tarchive_cmds='$CC -shared$allow_undefined_flag $pic_flag $libobjs $deplibs $compiler_flags $wl-msym $wl-soname $wl$soname `test -n \"$verstring\" && func_echo_all \"$wl-set_version $wl$verstring\"` $wl-update_registry $wl$output_objdir/so_locations -o $lib'\n\thardcode_libdir_flag_spec='$wl-rpath $wl$libdir'\n      else\n\tallow_undefined_flag=' -expect_unresolved \\*'\n\tarchive_cmds='$CC -shared$allow_undefined_flag $libobjs $deplibs $compiler_flags -msym -soname $soname `test -n \"$verstring\" && func_echo_all \"-set_version $verstring\"` -update_registry $output_objdir/so_locations -o $lib'\n\tarchive_expsym_cmds='for i in `cat $export_symbols`; do printf \"%s %s\\\\n\" -exported_symbol \"\\$i\" >> $lib.exp; done; printf \"%s\\\\n\" \"-hidden\">> $lib.exp~\n          $CC -shared$allow_undefined_flag $wl-input $wl$lib.exp $compiler_flags $libobjs $deplibs -soname $soname `test -n \"$verstring\" && $ECHO \"-set_version $verstring\"` -update_registry $output_objdir/so_locations -o $lib~$RM $lib.exp'\n\n\t# Both c and cxx compiler support -rpath directly\n\thardcode_libdir_flag_spec='-rpath $libdir'\n      fi\n      archive_cmds_need_lc='no'\n      hardcode_libdir_separator=:\n      ;;\n\n    solaris*)\n      no_undefined_flag=' -z defs'\n      if test yes = \"$GCC\"; then\n\twlarc='$wl'\n\tarchive_cmds='$CC -shared $pic_flag $wl-z ${wl}text $wl-h $wl$soname -o $lib $libobjs $deplibs $compiler_flags'\n\tarchive_expsym_cmds='echo \"{ global:\" > $lib.exp~cat $export_symbols | $SED -e \"s/\\(.*\\)/\\1;/\" >> $lib.exp~echo \"local: *; };\" >> $lib.exp~\n          $CC -shared $pic_flag $wl-z ${wl}text $wl-M $wl$lib.exp $wl-h $wl$soname -o $lib $libobjs $deplibs $compiler_flags~$RM $lib.exp'\n      else\n\tcase `$CC -V 2>&1` in\n\t*\"Compilers 5.0\"*)\n\t  wlarc=''\n\t  archive_cmds='$LD -G$allow_undefined_flag -h $soname -o $lib $libobjs $deplibs $linker_flags'\n\t  archive_expsym_cmds='echo \"{ global:\" > $lib.exp~cat $export_symbols | $SED -e \"s/\\(.*\\)/\\1;/\" >> $lib.exp~echo \"local: *; };\" >> $lib.exp~\n            $LD -G$allow_undefined_flag -M $lib.exp -h $soname -o $lib $libobjs $deplibs $linker_flags~$RM $lib.exp'\n\t  ;;\n\t*)\n\t  wlarc='$wl'\n\t  archive_cmds='$CC -G$allow_undefined_flag -h $soname -o $lib $libobjs $deplibs $compiler_flags'\n\t  archive_expsym_cmds='echo \"{ global:\" > $lib.exp~cat $export_symbols | $SED -e \"s/\\(.*\\)/\\1;/\" >> $lib.exp~echo \"local: *; };\" >> $lib.exp~\n            $CC -G$allow_undefined_flag -M $lib.exp -h $soname -o $lib $libobjs $deplibs $compiler_flags~$RM $lib.exp'\n\t  ;;\n\tesac\n      fi\n      hardcode_libdir_flag_spec='-R$libdir'\n      hardcode_shlibpath_var=no\n      case $host_os in\n      solaris2.[0-5] | solaris2.[0-5].*) ;;\n      *)\n\t# The compiler driver will combine and reorder linker options,\n\t# but understands '-z linker_flag'.  GCC discards it without '$wl',\n\t# but is careful enough not to reorder.\n\t# Supported since Solaris 2.6 (maybe 2.5.1?)\n\tif test yes = \"$GCC\"; then\n\t  whole_archive_flag_spec='$wl-z ${wl}allextract$convenience $wl-z ${wl}defaultextract'\n\telse\n\t  whole_archive_flag_spec='-z allextract$convenience -z defaultextract'\n\tfi\n\t;;\n      esac\n      link_all_deplibs=yes\n      ;;\n\n    sunos4*)\n      if test sequent = \"$host_vendor\"; then\n\t# Use $CC to link under sequent, because it throws in some extra .o\n\t# files that make .init and .fini sections work.\n\tarchive_cmds='$CC -G $wl-h $soname -o $lib $libobjs $deplibs $compiler_flags'\n      else\n\tarchive_cmds='$LD -assert pure-text -Bstatic -o $lib $libobjs $deplibs $linker_flags'\n      fi\n      hardcode_libdir_flag_spec='-L$libdir'\n      hardcode_direct=yes\n      hardcode_minus_L=yes\n      hardcode_shlibpath_var=no\n      ;;\n\n    sysv4)\n      case $host_vendor in\n\tsni)\n\t  archive_cmds='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags'\n\t  hardcode_direct=yes # is this really true???\n\t;;\n\tsiemens)\n\t  ## LD is ld it makes a PLAMLIB\n\t  ## CC just makes a GrossModule.\n\t  archive_cmds='$LD -G -o $lib $libobjs $deplibs $linker_flags'\n\t  reload_cmds='$CC -r -o $output$reload_objs'\n\t  hardcode_direct=no\n        ;;\n\tmotorola)\n\t  archive_cmds='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags'\n\t  hardcode_direct=no #Motorola manual says yes, but my tests say they lie\n\t;;\n      esac\n      runpath_var='LD_RUN_PATH'\n      hardcode_shlibpath_var=no\n      ;;\n\n    sysv4.3*)\n      archive_cmds='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags'\n      hardcode_shlibpath_var=no\n      export_dynamic_flag_spec='-Bexport'\n      ;;\n\n    sysv4*MP*)\n      if test -d /usr/nec; then\n\tarchive_cmds='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags'\n\thardcode_shlibpath_var=no\n\trunpath_var=LD_RUN_PATH\n\thardcode_runpath_var=yes\n\tld_shlibs=yes\n      fi\n      ;;\n\n    sysv4*uw2* | sysv5OpenUNIX* | sysv5UnixWare7.[01].[10]* | unixware7* | sco3.2v5.0.[024]*)\n      no_undefined_flag='$wl-z,text'\n      archive_cmds_need_lc=no\n      hardcode_shlibpath_var=no\n      runpath_var='LD_RUN_PATH'\n\n      if test yes = \"$GCC\"; then\n\tarchive_cmds='$CC -shared $wl-h,$soname -o $lib $libobjs $deplibs $compiler_flags'\n\tarchive_expsym_cmds='$CC -shared $wl-Bexport:$export_symbols $wl-h,$soname -o $lib $libobjs $deplibs $compiler_flags'\n      else\n\tarchive_cmds='$CC -G $wl-h,$soname -o $lib $libobjs $deplibs $compiler_flags'\n\tarchive_expsym_cmds='$CC -G $wl-Bexport:$export_symbols $wl-h,$soname -o $lib $libobjs $deplibs $compiler_flags'\n      fi\n      ;;\n\n    sysv5* | sco3.2v5* | sco5v6*)\n      # Note: We CANNOT use -z defs as we might desire, because we do not\n      # link with -lc, and that would cause any symbols used from libc to\n      # always be unresolved, which means just about no library would\n      # ever link correctly.  If we're not using GNU ld we use -z text\n      # though, which does catch some bad symbols but isn't as heavy-handed\n      # as -z defs.\n      no_undefined_flag='$wl-z,text'\n      allow_undefined_flag='$wl-z,nodefs'\n      archive_cmds_need_lc=no\n      hardcode_shlibpath_var=no\n      hardcode_libdir_flag_spec='$wl-R,$libdir'\n      hardcode_libdir_separator=':'\n      link_all_deplibs=yes\n      export_dynamic_flag_spec='$wl-Bexport'\n      runpath_var='LD_RUN_PATH'\n\n      if test yes = \"$GCC\"; then\n\tarchive_cmds='$CC -shared $wl-h,$soname -o $lib $libobjs $deplibs $compiler_flags'\n\tarchive_expsym_cmds='$CC -shared $wl-Bexport:$export_symbols $wl-h,$soname -o $lib $libobjs $deplibs $compiler_flags'\n      else\n\tarchive_cmds='$CC -G $wl-h,$soname -o $lib $libobjs $deplibs $compiler_flags'\n\tarchive_expsym_cmds='$CC -G $wl-Bexport:$export_symbols $wl-h,$soname -o $lib $libobjs $deplibs $compiler_flags'\n      fi\n      ;;\n\n    uts4*)\n      archive_cmds='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags'\n      hardcode_libdir_flag_spec='-L$libdir'\n      hardcode_shlibpath_var=no\n      ;;\n\n    *)\n      ld_shlibs=no\n      ;;\n    esac\n\n    if test sni = \"$host_vendor\"; then\n      case $host in\n      sysv4 | sysv4.2uw2* | sysv4.3* | sysv5*)\n\texport_dynamic_flag_spec='$wl-Blargedynsym'\n\t;;\n      esac\n    fi\n  fi\n\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $ld_shlibs\" >&5\n$as_echo \"$ld_shlibs\" >&6; }\ntest no = \"$ld_shlibs\" && can_build_shared=no\n\nwith_gnu_ld=$with_gnu_ld\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n#\n# Do we need to explicitly link libc?\n#\ncase \"x$archive_cmds_need_lc\" in\nx|xyes)\n  # Assume -lc should be added\n  archive_cmds_need_lc=yes\n\n  if test yes,yes = \"$GCC,$enable_shared\"; then\n    case $archive_cmds in\n    *'~'*)\n      # FIXME: we may have to deal with multi-command sequences.\n      ;;\n    '$CC '*)\n      # Test whether the compiler implicitly links with -lc since on some\n      # systems, -lgcc has to come before -lc. If gcc already passes -lc\n      # to ld, don't add -lc before -lgcc.\n      { $as_echo \"$as_me:${as_lineno-$LINENO}: checking whether -lc should be explicitly linked in\" >&5\n$as_echo_n \"checking whether -lc should be explicitly linked in... \" >&6; }\nif ${lt_cv_archive_cmds_need_lc+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  $RM conftest*\n\techo \"$lt_simple_compile_test_code\" > conftest.$ac_ext\n\n\tif { { eval echo \"\\\"\\$as_me\\\":${as_lineno-$LINENO}: \\\"$ac_compile\\\"\"; } >&5\n  (eval $ac_compile) 2>&5\n  ac_status=$?\n  $as_echo \"$as_me:${as_lineno-$LINENO}: \\$? = $ac_status\" >&5\n  test $ac_status = 0; } 2>conftest.err; then\n\t  soname=conftest\n\t  lib=conftest\n\t  libobjs=conftest.$ac_objext\n\t  deplibs=\n\t  wl=$lt_prog_compiler_wl\n\t  pic_flag=$lt_prog_compiler_pic\n\t  compiler_flags=-v\n\t  linker_flags=-v\n\t  verstring=\n\t  output_objdir=.\n\t  libname=conftest\n\t  lt_save_allow_undefined_flag=$allow_undefined_flag\n\t  allow_undefined_flag=\n\t  if { { eval echo \"\\\"\\$as_me\\\":${as_lineno-$LINENO}: \\\"$archive_cmds 2\\>\\&1 \\| $GREP \\\" -lc \\\" \\>/dev/null 2\\>\\&1\\\"\"; } >&5\n  (eval $archive_cmds 2\\>\\&1 \\| $GREP \\\" -lc \\\" \\>/dev/null 2\\>\\&1) 2>&5\n  ac_status=$?\n  $as_echo \"$as_me:${as_lineno-$LINENO}: \\$? = $ac_status\" >&5\n  test $ac_status = 0; }\n\t  then\n\t    lt_cv_archive_cmds_need_lc=no\n\t  else\n\t    lt_cv_archive_cmds_need_lc=yes\n\t  fi\n\t  allow_undefined_flag=$lt_save_allow_undefined_flag\n\telse\n\t  cat conftest.err 1>&5\n\tfi\n\t$RM conftest*\n\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $lt_cv_archive_cmds_need_lc\" >&5\n$as_echo \"$lt_cv_archive_cmds_need_lc\" >&6; }\n      archive_cmds_need_lc=$lt_cv_archive_cmds_need_lc\n      ;;\n    esac\n  fi\n  ;;\nesac\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: checking dynamic linker characteristics\" >&5\n$as_echo_n \"checking dynamic linker characteristics... \" >&6; }\n\nif test yes = \"$GCC\"; then\n  case $host_os in\n    darwin*) lt_awk_arg='/^libraries:/,/LR/' ;;\n    *) lt_awk_arg='/^libraries:/' ;;\n  esac\n  case $host_os in\n    mingw* | cegcc*) lt_sed_strip_eq='s|=\\([A-Za-z]:\\)|\\1|g' ;;\n    *) lt_sed_strip_eq='s|=/|/|g' ;;\n  esac\n  lt_search_path_spec=`$CC -print-search-dirs | awk $lt_awk_arg | $SED -e \"s/^libraries://\" -e $lt_sed_strip_eq`\n  case $lt_search_path_spec in\n  *\\;*)\n    # if the path contains \";\" then we assume it to be the separator\n    # otherwise default to the standard path separator (i.e. \":\") - it is\n    # assumed that no part of a normal pathname contains \";\" but that should\n    # okay in the real world where \";\" in dirpaths is itself problematic.\n    lt_search_path_spec=`$ECHO \"$lt_search_path_spec\" | $SED 's/;/ /g'`\n    ;;\n  *)\n    lt_search_path_spec=`$ECHO \"$lt_search_path_spec\" | $SED \"s/$PATH_SEPARATOR/ /g\"`\n    ;;\n  esac\n  # Ok, now we have the path, separated by spaces, we can step through it\n  # and add multilib dir if necessary...\n  lt_tmp_lt_search_path_spec=\n  lt_multi_os_dir=/`$CC $CPPFLAGS $CFLAGS $LDFLAGS -print-multi-os-directory 2>/dev/null`\n  # ...but if some path component already ends with the multilib dir we assume\n  # that all is fine and trust -print-search-dirs as is (GCC 4.2? or newer).\n  case \"$lt_multi_os_dir; $lt_search_path_spec \" in\n  \"/; \"* | \"/.; \"* | \"/./; \"* | *\"$lt_multi_os_dir \"* | *\"$lt_multi_os_dir/ \"*)\n    lt_multi_os_dir=\n    ;;\n  esac\n  for lt_sys_path in $lt_search_path_spec; do\n    if test -d \"$lt_sys_path$lt_multi_os_dir\"; then\n      lt_tmp_lt_search_path_spec=\"$lt_tmp_lt_search_path_spec $lt_sys_path$lt_multi_os_dir\"\n    elif test -n \"$lt_multi_os_dir\"; then\n      test -d \"$lt_sys_path\" && \\\n\tlt_tmp_lt_search_path_spec=\"$lt_tmp_lt_search_path_spec $lt_sys_path\"\n    fi\n  done\n  lt_search_path_spec=`$ECHO \"$lt_tmp_lt_search_path_spec\" | awk '\nBEGIN {RS = \" \"; FS = \"/|\\n\";} {\n  lt_foo = \"\";\n  lt_count = 0;\n  for (lt_i = NF; lt_i > 0; lt_i--) {\n    if ($lt_i != \"\" && $lt_i != \".\") {\n      if ($lt_i == \"..\") {\n        lt_count++;\n      } else {\n        if (lt_count == 0) {\n          lt_foo = \"/\" $lt_i lt_foo;\n        } else {\n          lt_count--;\n        }\n      }\n    }\n  }\n  if (lt_foo != \"\") { lt_freq[lt_foo]++; }\n  if (lt_freq[lt_foo] == 1) { print lt_foo; }\n}'`\n  # AWK program above erroneously prepends '/' to C:/dos/paths\n  # for these hosts.\n  case $host_os in\n    mingw* | cegcc*) lt_search_path_spec=`$ECHO \"$lt_search_path_spec\" |\\\n      $SED 's|/\\([A-Za-z]:\\)|\\1|g'` ;;\n  esac\n  sys_lib_search_path_spec=`$ECHO \"$lt_search_path_spec\" | $lt_NL2SP`\nelse\n  sys_lib_search_path_spec=\"/lib /usr/lib /usr/local/lib\"\nfi\nlibrary_names_spec=\nlibname_spec='lib$name'\nsoname_spec=\nshrext_cmds=.so\npostinstall_cmds=\npostuninstall_cmds=\nfinish_cmds=\nfinish_eval=\nshlibpath_var=\nshlibpath_overrides_runpath=unknown\nversion_type=none\ndynamic_linker=\"$host_os ld.so\"\nsys_lib_dlsearch_path_spec=\"/lib /usr/lib\"\nneed_lib_prefix=unknown\nhardcode_into_libs=no\n\n# when you set need_version to no, make sure it does not cause -set_version\n# flags to be left without arguments\nneed_version=unknown\n\n\n\ncase $host_os in\naix3*)\n  version_type=linux # correct to gnu/linux during the next big refactor\n  library_names_spec='$libname$release$shared_ext$versuffix $libname.a'\n  shlibpath_var=LIBPATH\n\n  # AIX 3 has no versioning support, so we append a major version to the name.\n  soname_spec='$libname$release$shared_ext$major'\n  ;;\n\naix[4-9]*)\n  version_type=linux # correct to gnu/linux during the next big refactor\n  need_lib_prefix=no\n  need_version=no\n  hardcode_into_libs=yes\n  if test ia64 = \"$host_cpu\"; then\n    # AIX 5 supports IA64\n    library_names_spec='$libname$release$shared_ext$major $libname$release$shared_ext$versuffix $libname$shared_ext'\n    shlibpath_var=LD_LIBRARY_PATH\n  else\n    # With GCC up to 2.95.x, collect2 would create an import file\n    # for dependence libraries.  The import file would start with\n    # the line '#! .'.  This would cause the generated library to\n    # depend on '.', always an invalid library.  This was fixed in\n    # development snapshots of GCC prior to 3.0.\n    case $host_os in\n      aix4 | aix4.[01] | aix4.[01].*)\n      if { echo '#if __GNUC__ > 2 || (__GNUC__ == 2 && __GNUC_MINOR__ >= 97)'\n\t   echo ' yes '\n\t   echo '#endif'; } | $CC -E - | $GREP yes > /dev/null; then\n\t:\n      else\n\tcan_build_shared=no\n      fi\n      ;;\n    esac\n    # Using Import Files as archive members, it is possible to support\n    # filename-based versioning of shared library archives on AIX. While\n    # this would work for both with and without runtime linking, it will\n    # prevent static linking of such archives. So we do filename-based\n    # shared library versioning with .so extension only, which is used\n    # when both runtime linking and shared linking is enabled.\n    # Unfortunately, runtime linking may impact performance, so we do\n    # not want this to be the default eventually. Also, we use the\n    # versioned .so libs for executables only if there is the -brtl\n    # linker flag in LDFLAGS as well, or --with-aix-soname=svr4 only.\n    # To allow for filename-based versioning support, we need to create\n    # libNAME.so.V as an archive file, containing:\n    # *) an Import File, referring to the versioned filename of the\n    #    archive as well as the shared archive member, telling the\n    #    bitwidth (32 or 64) of that shared object, and providing the\n    #    list of exported symbols of that shared object, eventually\n    #    decorated with the 'weak' keyword\n    # *) the shared object with the F_LOADONLY flag set, to really avoid\n    #    it being seen by the linker.\n    # At run time we better use the real file rather than another symlink,\n    # but for link time we create the symlink libNAME.so -> libNAME.so.V\n\n    case $with_aix_soname,$aix_use_runtimelinking in\n    # AIX (on Power*) has no versioning support, so currently we cannot hardcode correct\n    # soname into executable. Probably we can add versioning support to\n    # collect2, so additional links can be useful in future.\n    aix,yes) # traditional libtool\n      dynamic_linker='AIX unversionable lib.so'\n      # If using run time linking (on AIX 4.2 or later) use lib<name>.so\n      # instead of lib<name>.a to let people know that these are not\n      # typical AIX shared libraries.\n      library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext'\n      ;;\n    aix,no) # traditional AIX only\n      dynamic_linker='AIX lib.a(lib.so.V)'\n      # We preserve .a as extension for shared libraries through AIX4.2\n      # and later when we are not doing run time linking.\n      library_names_spec='$libname$release.a $libname.a'\n      soname_spec='$libname$release$shared_ext$major'\n      ;;\n    svr4,*) # full svr4 only\n      dynamic_linker=\"AIX lib.so.V($shared_archive_member_spec.o)\"\n      library_names_spec='$libname$release$shared_ext$major $libname$shared_ext'\n      # We do not specify a path in Import Files, so LIBPATH fires.\n      shlibpath_overrides_runpath=yes\n      ;;\n    *,yes) # both, prefer svr4\n      dynamic_linker=\"AIX lib.so.V($shared_archive_member_spec.o), lib.a(lib.so.V)\"\n      library_names_spec='$libname$release$shared_ext$major $libname$shared_ext'\n      # unpreferred sharedlib libNAME.a needs extra handling\n      postinstall_cmds='test -n \"$linkname\" || linkname=\"$realname\"~func_stripname \"\" \".so\" \"$linkname\"~$install_shared_prog \"$dir/$func_stripname_result.$libext\" \"$destdir/$func_stripname_result.$libext\"~test -z \"$tstripme\" || test -z \"$striplib\" || $striplib \"$destdir/$func_stripname_result.$libext\"'\n      postuninstall_cmds='for n in $library_names $old_library; do :; done~func_stripname \"\" \".so\" \"$n\"~test \"$func_stripname_result\" = \"$n\" || func_append rmfiles \" $odir/$func_stripname_result.$libext\"'\n      # We do not specify a path in Import Files, so LIBPATH fires.\n      shlibpath_overrides_runpath=yes\n      ;;\n    *,no) # both, prefer aix\n      dynamic_linker=\"AIX lib.a(lib.so.V), lib.so.V($shared_archive_member_spec.o)\"\n      library_names_spec='$libname$release.a $libname.a'\n      soname_spec='$libname$release$shared_ext$major'\n      # unpreferred sharedlib libNAME.so.V and symlink libNAME.so need extra handling\n      postinstall_cmds='test -z \"$dlname\" || $install_shared_prog $dir/$dlname $destdir/$dlname~test -z \"$tstripme\" || test -z \"$striplib\" || $striplib $destdir/$dlname~test -n \"$linkname\" || linkname=$realname~func_stripname \"\" \".a\" \"$linkname\"~(cd \"$destdir\" && $LN_S -f $dlname $func_stripname_result.so)'\n      postuninstall_cmds='test -z \"$dlname\" || func_append rmfiles \" $odir/$dlname\"~for n in $old_library $library_names; do :; done~func_stripname \"\" \".a\" \"$n\"~func_append rmfiles \" $odir/$func_stripname_result.so\"'\n      ;;\n    esac\n    shlibpath_var=LIBPATH\n  fi\n  ;;\n\namigaos*)\n  case $host_cpu in\n  powerpc)\n    # Since July 2007 AmigaOS4 officially supports .so libraries.\n    # When compiling the executable, add -use-dynld -Lsobjs: to the compileline.\n    library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext'\n    ;;\n  m68k)\n    library_names_spec='$libname.ixlibrary $libname.a'\n    # Create ${libname}_ixlibrary.a entries in /sys/libs.\n    finish_eval='for lib in `ls $libdir/*.ixlibrary 2>/dev/null`; do libname=`func_echo_all \"$lib\" | $SED '\\''s%^.*/\\([^/]*\\)\\.ixlibrary$%\\1%'\\''`; $RM /sys/libs/${libname}_ixlibrary.a; $show \"cd /sys/libs && $LN_S $lib ${libname}_ixlibrary.a\"; cd /sys/libs && $LN_S $lib ${libname}_ixlibrary.a || exit 1; done'\n    ;;\n  esac\n  ;;\n\nbeos*)\n  library_names_spec='$libname$shared_ext'\n  dynamic_linker=\"$host_os ld.so\"\n  shlibpath_var=LIBRARY_PATH\n  ;;\n\nbsdi[45]*)\n  version_type=linux # correct to gnu/linux during the next big refactor\n  need_version=no\n  library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext'\n  soname_spec='$libname$release$shared_ext$major'\n  finish_cmds='PATH=\"\\$PATH:/sbin\" ldconfig $libdir'\n  shlibpath_var=LD_LIBRARY_PATH\n  sys_lib_search_path_spec=\"/shlib /usr/lib /usr/X11/lib /usr/contrib/lib /lib /usr/local/lib\"\n  sys_lib_dlsearch_path_spec=\"/shlib /usr/lib /usr/local/lib\"\n  # the default ld.so.conf also contains /usr/contrib/lib and\n  # /usr/X11R6/lib (/usr/X11 is a link to /usr/X11R6), but let us allow\n  # libtool to hard-code these into programs\n  ;;\n\ncygwin* | mingw* | pw32* | cegcc*)\n  version_type=windows\n  shrext_cmds=.dll\n  need_version=no\n  need_lib_prefix=no\n\n  case $GCC,$cc_basename in\n  yes,*)\n    # gcc\n    library_names_spec='$libname.dll.a'\n    # DLL is installed to $(libdir)/../bin by postinstall_cmds\n    postinstall_cmds='base_file=`basename \\$file`~\n      dlpath=`$SHELL 2>&1 -c '\\''. $dir/'\\''\\$base_file'\\''i; echo \\$dlname'\\''`~\n      dldir=$destdir/`dirname \\$dlpath`~\n      test -d \\$dldir || mkdir -p \\$dldir~\n      $install_prog $dir/$dlname \\$dldir/$dlname~\n      chmod a+x \\$dldir/$dlname~\n      if test -n '\\''$stripme'\\'' && test -n '\\''$striplib'\\''; then\n        eval '\\''$striplib \\$dldir/$dlname'\\'' || exit \\$?;\n      fi'\n    postuninstall_cmds='dldll=`$SHELL 2>&1 -c '\\''. $file; echo \\$dlname'\\''`~\n      dlpath=$dir/\\$dldll~\n       $RM \\$dlpath'\n    shlibpath_overrides_runpath=yes\n\n    case $host_os in\n    cygwin*)\n      # Cygwin DLLs use 'cyg' prefix rather than 'lib'\n      soname_spec='`echo $libname | sed -e 's/^lib/cyg/'``echo $release | $SED -e 's/[.]/-/g'`$versuffix$shared_ext'\n\n      sys_lib_search_path_spec=\"$sys_lib_search_path_spec /usr/lib/w32api\"\n      ;;\n    mingw* | cegcc*)\n      # MinGW DLLs use traditional 'lib' prefix\n      soname_spec='$libname`echo $release | $SED -e 's/[.]/-/g'`$versuffix$shared_ext'\n      ;;\n    pw32*)\n      # pw32 DLLs use 'pw' prefix rather than 'lib'\n      library_names_spec='`echo $libname | sed -e 's/^lib/pw/'``echo $release | $SED -e 's/[.]/-/g'`$versuffix$shared_ext'\n      ;;\n    esac\n    dynamic_linker='Win32 ld.exe'\n    ;;\n\n  *,cl*)\n    # Native MSVC\n    libname_spec='$name'\n    soname_spec='$libname`echo $release | $SED -e 's/[.]/-/g'`$versuffix$shared_ext'\n    library_names_spec='$libname.dll.lib'\n\n    case $build_os in\n    mingw*)\n      sys_lib_search_path_spec=\n      lt_save_ifs=$IFS\n      IFS=';'\n      for lt_path in $LIB\n      do\n        IFS=$lt_save_ifs\n        # Let DOS variable expansion print the short 8.3 style file name.\n        lt_path=`cd \"$lt_path\" 2>/dev/null && cmd //C \"for %i in (\".\") do @echo %~si\"`\n        sys_lib_search_path_spec=\"$sys_lib_search_path_spec $lt_path\"\n      done\n      IFS=$lt_save_ifs\n      # Convert to MSYS style.\n      sys_lib_search_path_spec=`$ECHO \"$sys_lib_search_path_spec\" | sed -e 's|\\\\\\\\|/|g' -e 's| \\\\([a-zA-Z]\\\\):| /\\\\1|g' -e 's|^ ||'`\n      ;;\n    cygwin*)\n      # Convert to unix form, then to dos form, then back to unix form\n      # but this time dos style (no spaces!) so that the unix form looks\n      # like /cygdrive/c/PROGRA~1:/cygdr...\n      sys_lib_search_path_spec=`cygpath --path --unix \"$LIB\"`\n      sys_lib_search_path_spec=`cygpath --path --dos \"$sys_lib_search_path_spec\" 2>/dev/null`\n      sys_lib_search_path_spec=`cygpath --path --unix \"$sys_lib_search_path_spec\" | $SED -e \"s/$PATH_SEPARATOR/ /g\"`\n      ;;\n    *)\n      sys_lib_search_path_spec=$LIB\n      if $ECHO \"$sys_lib_search_path_spec\" | $GREP ';[c-zC-Z]:/' >/dev/null; then\n        # It is most probably a Windows format PATH.\n        sys_lib_search_path_spec=`$ECHO \"$sys_lib_search_path_spec\" | $SED -e 's/;/ /g'`\n      else\n        sys_lib_search_path_spec=`$ECHO \"$sys_lib_search_path_spec\" | $SED -e \"s/$PATH_SEPARATOR/ /g\"`\n      fi\n      # FIXME: find the short name or the path components, as spaces are\n      # common. (e.g. \"Program Files\" -> \"PROGRA~1\")\n      ;;\n    esac\n\n    # DLL is installed to $(libdir)/../bin by postinstall_cmds\n    postinstall_cmds='base_file=`basename \\$file`~\n      dlpath=`$SHELL 2>&1 -c '\\''. $dir/'\\''\\$base_file'\\''i; echo \\$dlname'\\''`~\n      dldir=$destdir/`dirname \\$dlpath`~\n      test -d \\$dldir || mkdir -p \\$dldir~\n      $install_prog $dir/$dlname \\$dldir/$dlname'\n    postuninstall_cmds='dldll=`$SHELL 2>&1 -c '\\''. $file; echo \\$dlname'\\''`~\n      dlpath=$dir/\\$dldll~\n       $RM \\$dlpath'\n    shlibpath_overrides_runpath=yes\n    dynamic_linker='Win32 link.exe'\n    ;;\n\n  *)\n    # Assume MSVC wrapper\n    library_names_spec='$libname`echo $release | $SED -e 's/[.]/-/g'`$versuffix$shared_ext $libname.lib'\n    dynamic_linker='Win32 ld.exe'\n    ;;\n  esac\n  # FIXME: first we should search . and the directory the executable is in\n  shlibpath_var=PATH\n  ;;\n\ndarwin* | rhapsody*)\n  dynamic_linker=\"$host_os dyld\"\n  version_type=darwin\n  need_lib_prefix=no\n  need_version=no\n  library_names_spec='$libname$release$major$shared_ext $libname$shared_ext'\n  soname_spec='$libname$release$major$shared_ext'\n  shlibpath_overrides_runpath=yes\n  shlibpath_var=DYLD_LIBRARY_PATH\n  shrext_cmds='`test .$module = .yes && echo .so || echo .dylib`'\n\n  sys_lib_search_path_spec=\"$sys_lib_search_path_spec /usr/local/lib\"\n  sys_lib_dlsearch_path_spec='/usr/local/lib /lib /usr/lib'\n  ;;\n\ndgux*)\n  version_type=linux # correct to gnu/linux during the next big refactor\n  need_lib_prefix=no\n  need_version=no\n  library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext'\n  soname_spec='$libname$release$shared_ext$major'\n  shlibpath_var=LD_LIBRARY_PATH\n  ;;\n\nfreebsd* | dragonfly*)\n  # DragonFly does not have aout.  When/if they implement a new\n  # versioning mechanism, adjust this.\n  if test -x /usr/bin/objformat; then\n    objformat=`/usr/bin/objformat`\n  else\n    case $host_os in\n    freebsd[23].*) objformat=aout ;;\n    *) objformat=elf ;;\n    esac\n  fi\n  version_type=freebsd-$objformat\n  case $version_type in\n    freebsd-elf*)\n      library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext'\n      soname_spec='$libname$release$shared_ext$major'\n      need_version=no\n      need_lib_prefix=no\n      ;;\n    freebsd-*)\n      library_names_spec='$libname$release$shared_ext$versuffix $libname$shared_ext$versuffix'\n      need_version=yes\n      ;;\n  esac\n  shlibpath_var=LD_LIBRARY_PATH\n  case $host_os in\n  freebsd2.*)\n    shlibpath_overrides_runpath=yes\n    ;;\n  freebsd3.[01]* | freebsdelf3.[01]*)\n    shlibpath_overrides_runpath=yes\n    hardcode_into_libs=yes\n    ;;\n  freebsd3.[2-9]* | freebsdelf3.[2-9]* | \\\n  freebsd4.[0-5] | freebsdelf4.[0-5] | freebsd4.1.1 | freebsdelf4.1.1)\n    shlibpath_overrides_runpath=no\n    hardcode_into_libs=yes\n    ;;\n  *) # from 4.6 on, and DragonFly\n    shlibpath_overrides_runpath=yes\n    hardcode_into_libs=yes\n    ;;\n  esac\n  ;;\n\nhaiku*)\n  version_type=linux # correct to gnu/linux during the next big refactor\n  need_lib_prefix=no\n  need_version=no\n  dynamic_linker=\"$host_os runtime_loader\"\n  library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext'\n  soname_spec='$libname$release$shared_ext$major'\n  shlibpath_var=LIBRARY_PATH\n  shlibpath_overrides_runpath=no\n  sys_lib_dlsearch_path_spec='/boot/home/config/lib /boot/common/lib /boot/system/lib'\n  hardcode_into_libs=yes\n  ;;\n\nhpux9* | hpux10* | hpux11*)\n  # Give a soname corresponding to the major version so that dld.sl refuses to\n  # link against other versions.\n  version_type=sunos\n  need_lib_prefix=no\n  need_version=no\n  case $host_cpu in\n  ia64*)\n    shrext_cmds='.so'\n    hardcode_into_libs=yes\n    dynamic_linker=\"$host_os dld.so\"\n    shlibpath_var=LD_LIBRARY_PATH\n    shlibpath_overrides_runpath=yes # Unless +noenvvar is specified.\n    library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext'\n    soname_spec='$libname$release$shared_ext$major'\n    if test 32 = \"$HPUX_IA64_MODE\"; then\n      sys_lib_search_path_spec=\"/usr/lib/hpux32 /usr/local/lib/hpux32 /usr/local/lib\"\n      sys_lib_dlsearch_path_spec=/usr/lib/hpux32\n    else\n      sys_lib_search_path_spec=\"/usr/lib/hpux64 /usr/local/lib/hpux64\"\n      sys_lib_dlsearch_path_spec=/usr/lib/hpux64\n    fi\n    ;;\n  hppa*64*)\n    shrext_cmds='.sl'\n    hardcode_into_libs=yes\n    dynamic_linker=\"$host_os dld.sl\"\n    shlibpath_var=LD_LIBRARY_PATH # How should we handle SHLIB_PATH\n    shlibpath_overrides_runpath=yes # Unless +noenvvar is specified.\n    library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext'\n    soname_spec='$libname$release$shared_ext$major'\n    sys_lib_search_path_spec=\"/usr/lib/pa20_64 /usr/ccs/lib/pa20_64\"\n    sys_lib_dlsearch_path_spec=$sys_lib_search_path_spec\n    ;;\n  *)\n    shrext_cmds='.sl'\n    dynamic_linker=\"$host_os dld.sl\"\n    shlibpath_var=SHLIB_PATH\n    shlibpath_overrides_runpath=no # +s is required to enable SHLIB_PATH\n    library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext'\n    soname_spec='$libname$release$shared_ext$major'\n    ;;\n  esac\n  # HP-UX runs *really* slowly unless shared libraries are mode 555, ...\n  postinstall_cmds='chmod 555 $lib'\n  # or fails outright, so override atomically:\n  install_override_mode=555\n  ;;\n\ninterix[3-9]*)\n  version_type=linux # correct to gnu/linux during the next big refactor\n  need_lib_prefix=no\n  need_version=no\n  library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext'\n  soname_spec='$libname$release$shared_ext$major'\n  dynamic_linker='Interix 3.x ld.so.1 (PE, like ELF)'\n  shlibpath_var=LD_LIBRARY_PATH\n  shlibpath_overrides_runpath=no\n  hardcode_into_libs=yes\n  ;;\n\nirix5* | irix6* | nonstopux*)\n  case $host_os in\n    nonstopux*) version_type=nonstopux ;;\n    *)\n\tif test yes = \"$lt_cv_prog_gnu_ld\"; then\n\t\tversion_type=linux # correct to gnu/linux during the next big refactor\n\telse\n\t\tversion_type=irix\n\tfi ;;\n  esac\n  need_lib_prefix=no\n  need_version=no\n  soname_spec='$libname$release$shared_ext$major'\n  library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$release$shared_ext $libname$shared_ext'\n  case $host_os in\n  irix5* | nonstopux*)\n    libsuff= shlibsuff=\n    ;;\n  *)\n    case $LD in # libtool.m4 will add one of these switches to LD\n    *-32|*\"-32 \"|*-melf32bsmip|*\"-melf32bsmip \")\n      libsuff= shlibsuff= libmagic=32-bit;;\n    *-n32|*\"-n32 \"|*-melf32bmipn32|*\"-melf32bmipn32 \")\n      libsuff=32 shlibsuff=N32 libmagic=N32;;\n    *-64|*\"-64 \"|*-melf64bmip|*\"-melf64bmip \")\n      libsuff=64 shlibsuff=64 libmagic=64-bit;;\n    *) libsuff= shlibsuff= libmagic=never-match;;\n    esac\n    ;;\n  esac\n  shlibpath_var=LD_LIBRARY${shlibsuff}_PATH\n  shlibpath_overrides_runpath=no\n  sys_lib_search_path_spec=\"/usr/lib$libsuff /lib$libsuff /usr/local/lib$libsuff\"\n  sys_lib_dlsearch_path_spec=\"/usr/lib$libsuff /lib$libsuff\"\n  hardcode_into_libs=yes\n  ;;\n\n# No shared lib support for Linux oldld, aout, or coff.\nlinux*oldld* | linux*aout* | linux*coff*)\n  dynamic_linker=no\n  ;;\n\nlinux*android*)\n  version_type=none # Android doesn't support versioned libraries.\n  need_lib_prefix=no\n  need_version=no\n  library_names_spec='$libname$release$shared_ext'\n  soname_spec='$libname$release$shared_ext'\n  finish_cmds=\n  shlibpath_var=LD_LIBRARY_PATH\n  shlibpath_overrides_runpath=yes\n\n  # This implies no fast_install, which is unacceptable.\n  # Some rework will be needed to allow for fast_install\n  # before this can be enabled.\n  hardcode_into_libs=yes\n\n  dynamic_linker='Android linker'\n  # Don't embed -rpath directories since the linker doesn't support them.\n  hardcode_libdir_flag_spec='-L$libdir'\n  ;;\n\n# This must be glibc/ELF.\nlinux* | k*bsd*-gnu | kopensolaris*-gnu | gnu*)\n  version_type=linux # correct to gnu/linux during the next big refactor\n  need_lib_prefix=no\n  need_version=no\n  library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext'\n  soname_spec='$libname$release$shared_ext$major'\n  finish_cmds='PATH=\"\\$PATH:/sbin\" ldconfig -n $libdir'\n  shlibpath_var=LD_LIBRARY_PATH\n  shlibpath_overrides_runpath=no\n\n  # Some binutils ld are patched to set DT_RUNPATH\n  if ${lt_cv_shlibpath_overrides_runpath+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  lt_cv_shlibpath_overrides_runpath=no\n    save_LDFLAGS=$LDFLAGS\n    save_libdir=$libdir\n    eval \"libdir=/foo; wl=\\\"$lt_prog_compiler_wl\\\"; \\\n\t LDFLAGS=\\\"\\$LDFLAGS $hardcode_libdir_flag_spec\\\"\"\n    cat confdefs.h - <<_ACEOF >conftest.$ac_ext\n/* end confdefs.h.  */\n\nint\nmain ()\n{\n\n  ;\n  return 0;\n}\n_ACEOF\nif ac_fn_c_try_link \"$LINENO\"; then :\n  if  ($OBJDUMP -p conftest$ac_exeext) 2>/dev/null | grep \"RUNPATH.*$libdir\" >/dev/null; then :\n  lt_cv_shlibpath_overrides_runpath=yes\nfi\nfi\nrm -f core conftest.err conftest.$ac_objext \\\n    conftest$ac_exeext conftest.$ac_ext\n    LDFLAGS=$save_LDFLAGS\n    libdir=$save_libdir\n\nfi\n\n  shlibpath_overrides_runpath=$lt_cv_shlibpath_overrides_runpath\n\n  # This implies no fast_install, which is unacceptable.\n  # Some rework will be needed to allow for fast_install\n  # before this can be enabled.\n  hardcode_into_libs=yes\n\n  # Ideally, we could use ldconfig to report *all* directores which are\n  # searched for libraries, however this is still not possible.  Aside from not\n  # being certain /sbin/ldconfig is available, command\n  # 'ldconfig -N -X -v | grep ^/' on 64bit Fedora does not report /usr/lib64,\n  # even though it is searched at run-time.  Try to do the best guess by\n  # appending ld.so.conf contents (and includes) to the search path.\n  if test -f /etc/ld.so.conf; then\n    lt_ld_extra=`awk '/^include / { system(sprintf(\"cd /etc; cat %s 2>/dev/null\", \\$2)); skip = 1; } { if (!skip) print \\$0; skip = 0; }' < /etc/ld.so.conf | $SED -e 's/#.*//;/^[\t ]*hwcap[\t ]/d;s/[:,\t]/ /g;s/=[^=]*$//;s/=[^= ]* / /g;s/\"//g;/^$/d' | tr '\\n' ' '`\n    sys_lib_dlsearch_path_spec=\"/lib /usr/lib $lt_ld_extra\"\n  fi\n\n  # We used to test for /lib/ld.so.1 and disable shared libraries on\n  # powerpc, because MkLinux only supported shared libraries with the\n  # GNU dynamic linker.  Since this was broken with cross compilers,\n  # most powerpc-linux boxes support dynamic linking these days and\n  # people can always --disable-shared, the test was removed, and we\n  # assume the GNU/Linux dynamic linker is in use.\n  dynamic_linker='GNU/Linux ld.so'\n  ;;\n\nnetbsdelf*-gnu)\n  version_type=linux\n  need_lib_prefix=no\n  need_version=no\n  library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${shared_ext}'\n  soname_spec='${libname}${release}${shared_ext}$major'\n  shlibpath_var=LD_LIBRARY_PATH\n  shlibpath_overrides_runpath=no\n  hardcode_into_libs=yes\n  dynamic_linker='NetBSD ld.elf_so'\n  ;;\n\nnetbsd*)\n  version_type=sunos\n  need_lib_prefix=no\n  need_version=no\n  if echo __ELF__ | $CC -E - | $GREP __ELF__ >/dev/null; then\n    library_names_spec='$libname$release$shared_ext$versuffix $libname$shared_ext$versuffix'\n    finish_cmds='PATH=\"\\$PATH:/sbin\" ldconfig -m $libdir'\n    dynamic_linker='NetBSD (a.out) ld.so'\n  else\n    library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext'\n    soname_spec='$libname$release$shared_ext$major'\n    dynamic_linker='NetBSD ld.elf_so'\n  fi\n  shlibpath_var=LD_LIBRARY_PATH\n  shlibpath_overrides_runpath=yes\n  hardcode_into_libs=yes\n  ;;\n\nnewsos6)\n  version_type=linux # correct to gnu/linux during the next big refactor\n  library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext'\n  shlibpath_var=LD_LIBRARY_PATH\n  shlibpath_overrides_runpath=yes\n  ;;\n\n*nto* | *qnx*)\n  version_type=qnx\n  need_lib_prefix=no\n  need_version=no\n  library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext'\n  soname_spec='$libname$release$shared_ext$major'\n  shlibpath_var=LD_LIBRARY_PATH\n  shlibpath_overrides_runpath=no\n  hardcode_into_libs=yes\n  dynamic_linker='ldqnx.so'\n  ;;\n\nopenbsd* | bitrig*)\n  version_type=sunos\n  sys_lib_dlsearch_path_spec=/usr/lib\n  need_lib_prefix=no\n  if test -z \"`echo __ELF__ | $CC -E - | $GREP __ELF__`\"; then\n    need_version=no\n  else\n    need_version=yes\n  fi\n  library_names_spec='$libname$release$shared_ext$versuffix $libname$shared_ext$versuffix'\n  finish_cmds='PATH=\"\\$PATH:/sbin\" ldconfig -m $libdir'\n  shlibpath_var=LD_LIBRARY_PATH\n  shlibpath_overrides_runpath=yes\n  ;;\n\nos2*)\n  libname_spec='$name'\n  version_type=windows\n  shrext_cmds=.dll\n  need_version=no\n  need_lib_prefix=no\n  # OS/2 can only load a DLL with a base name of 8 characters or less.\n  soname_spec='`test -n \"$os2dllname\" && libname=\"$os2dllname\";\n    v=$($ECHO $release$versuffix | tr -d .-);\n    n=$($ECHO $libname | cut -b -$((8 - ${#v})) | tr . _);\n    $ECHO $n$v`$shared_ext'\n  library_names_spec='${libname}_dll.$libext'\n  dynamic_linker='OS/2 ld.exe'\n  shlibpath_var=BEGINLIBPATH\n  sys_lib_search_path_spec=\"/lib /usr/lib /usr/local/lib\"\n  sys_lib_dlsearch_path_spec=$sys_lib_search_path_spec\n  postinstall_cmds='base_file=`basename \\$file`~\n    dlpath=`$SHELL 2>&1 -c '\\''. $dir/'\\''\\$base_file'\\''i; $ECHO \\$dlname'\\''`~\n    dldir=$destdir/`dirname \\$dlpath`~\n    test -d \\$dldir || mkdir -p \\$dldir~\n    $install_prog $dir/$dlname \\$dldir/$dlname~\n    chmod a+x \\$dldir/$dlname~\n    if test -n '\\''$stripme'\\'' && test -n '\\''$striplib'\\''; then\n      eval '\\''$striplib \\$dldir/$dlname'\\'' || exit \\$?;\n    fi'\n  postuninstall_cmds='dldll=`$SHELL 2>&1 -c '\\''. $file; $ECHO \\$dlname'\\''`~\n    dlpath=$dir/\\$dldll~\n    $RM \\$dlpath'\n  ;;\n\nosf3* | osf4* | osf5*)\n  version_type=osf\n  need_lib_prefix=no\n  need_version=no\n  soname_spec='$libname$release$shared_ext$major'\n  library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext'\n  shlibpath_var=LD_LIBRARY_PATH\n  sys_lib_search_path_spec=\"/usr/shlib /usr/ccs/lib /usr/lib/cmplrs/cc /usr/lib /usr/local/lib /var/shlib\"\n  sys_lib_dlsearch_path_spec=$sys_lib_search_path_spec\n  ;;\n\nrdos*)\n  dynamic_linker=no\n  ;;\n\nsolaris*)\n  version_type=linux # correct to gnu/linux during the next big refactor\n  need_lib_prefix=no\n  need_version=no\n  library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext'\n  soname_spec='$libname$release$shared_ext$major'\n  shlibpath_var=LD_LIBRARY_PATH\n  shlibpath_overrides_runpath=yes\n  hardcode_into_libs=yes\n  # ldd complains unless libraries are executable\n  postinstall_cmds='chmod +x $lib'\n  ;;\n\nsunos4*)\n  version_type=sunos\n  library_names_spec='$libname$release$shared_ext$versuffix $libname$shared_ext$versuffix'\n  finish_cmds='PATH=\"\\$PATH:/usr/etc\" ldconfig $libdir'\n  shlibpath_var=LD_LIBRARY_PATH\n  shlibpath_overrides_runpath=yes\n  if test yes = \"$with_gnu_ld\"; then\n    need_lib_prefix=no\n  fi\n  need_version=yes\n  ;;\n\nsysv4 | sysv4.3*)\n  version_type=linux # correct to gnu/linux during the next big refactor\n  library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext'\n  soname_spec='$libname$release$shared_ext$major'\n  shlibpath_var=LD_LIBRARY_PATH\n  case $host_vendor in\n    sni)\n      shlibpath_overrides_runpath=no\n      need_lib_prefix=no\n      runpath_var=LD_RUN_PATH\n      ;;\n    siemens)\n      need_lib_prefix=no\n      ;;\n    motorola)\n      need_lib_prefix=no\n      need_version=no\n      shlibpath_overrides_runpath=no\n      sys_lib_search_path_spec='/lib /usr/lib /usr/ccs/lib'\n      ;;\n  esac\n  ;;\n\nsysv4*MP*)\n  if test -d /usr/nec; then\n    version_type=linux # correct to gnu/linux during the next big refactor\n    library_names_spec='$libname$shared_ext.$versuffix $libname$shared_ext.$major $libname$shared_ext'\n    soname_spec='$libname$shared_ext.$major'\n    shlibpath_var=LD_LIBRARY_PATH\n  fi\n  ;;\n\nsysv5* | sco3.2v5* | sco5v6* | unixware* | OpenUNIX* | sysv4*uw2*)\n  version_type=sco\n  need_lib_prefix=no\n  need_version=no\n  library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext $libname$shared_ext'\n  soname_spec='$libname$release$shared_ext$major'\n  shlibpath_var=LD_LIBRARY_PATH\n  shlibpath_overrides_runpath=yes\n  hardcode_into_libs=yes\n  if test yes = \"$with_gnu_ld\"; then\n    sys_lib_search_path_spec='/usr/local/lib /usr/gnu/lib /usr/ccs/lib /usr/lib /lib'\n  else\n    sys_lib_search_path_spec='/usr/ccs/lib /usr/lib'\n    case $host_os in\n      sco3.2v5*)\n        sys_lib_search_path_spec=\"$sys_lib_search_path_spec /lib\"\n\t;;\n    esac\n  fi\n  sys_lib_dlsearch_path_spec='/usr/lib'\n  ;;\n\ntpf*)\n  # TPF is a cross-target only.  Preferred cross-host = GNU/Linux.\n  version_type=linux # correct to gnu/linux during the next big refactor\n  need_lib_prefix=no\n  need_version=no\n  library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext'\n  shlibpath_var=LD_LIBRARY_PATH\n  shlibpath_overrides_runpath=no\n  hardcode_into_libs=yes\n  ;;\n\nuts4*)\n  version_type=linux # correct to gnu/linux during the next big refactor\n  library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext'\n  soname_spec='$libname$release$shared_ext$major'\n  shlibpath_var=LD_LIBRARY_PATH\n  ;;\n\n*)\n  dynamic_linker=no\n  ;;\nesac\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $dynamic_linker\" >&5\n$as_echo \"$dynamic_linker\" >&6; }\ntest no = \"$dynamic_linker\" && can_build_shared=no\n\nvariables_saved_for_relink=\"PATH $shlibpath_var $runpath_var\"\nif test yes = \"$GCC\"; then\n  variables_saved_for_relink=\"$variables_saved_for_relink GCC_EXEC_PREFIX COMPILER_PATH LIBRARY_PATH\"\nfi\n\nif test set = \"${lt_cv_sys_lib_search_path_spec+set}\"; then\n  sys_lib_search_path_spec=$lt_cv_sys_lib_search_path_spec\nfi\n\nif test set = \"${lt_cv_sys_lib_dlsearch_path_spec+set}\"; then\n  sys_lib_dlsearch_path_spec=$lt_cv_sys_lib_dlsearch_path_spec\nfi\n\n# remember unaugmented sys_lib_dlsearch_path content for libtool script decls...\nconfigure_time_dlsearch_path=$sys_lib_dlsearch_path_spec\n\n# ... but it needs LT_SYS_LIBRARY_PATH munging for other configure-time code\nfunc_munge_path_list sys_lib_dlsearch_path_spec \"$LT_SYS_LIBRARY_PATH\"\n\n# to be used as default LT_SYS_LIBRARY_PATH value in generated libtool\nconfigure_time_lt_sys_library_path=$LT_SYS_LIBRARY_PATH\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: checking how to hardcode library paths into programs\" >&5\n$as_echo_n \"checking how to hardcode library paths into programs... \" >&6; }\nhardcode_action=\nif test -n \"$hardcode_libdir_flag_spec\" ||\n   test -n \"$runpath_var\" ||\n   test yes = \"$hardcode_automatic\"; then\n\n  # We can hardcode non-existent directories.\n  if test no != \"$hardcode_direct\" &&\n     # If the only mechanism to avoid hardcoding is shlibpath_var, we\n     # have to relink, otherwise we might link with an installed library\n     # when we should be linking with a yet-to-be-installed one\n     ## test no != \"$_LT_TAGVAR(hardcode_shlibpath_var, )\" &&\n     test no != \"$hardcode_minus_L\"; then\n    # Linking always hardcodes the temporary library directory.\n    hardcode_action=relink\n  else\n    # We can link without hardcoding, and we can hardcode nonexisting dirs.\n    hardcode_action=immediate\n  fi\nelse\n  # We cannot hardcode anything, or else we can only hardcode existing\n  # directories.\n  hardcode_action=unsupported\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $hardcode_action\" >&5\n$as_echo \"$hardcode_action\" >&6; }\n\nif test relink = \"$hardcode_action\" ||\n   test yes = \"$inherit_rpath\"; then\n  # Fast installation is not supported\n  enable_fast_install=no\nelif test yes = \"$shlibpath_overrides_runpath\" ||\n     test no = \"$enable_shared\"; then\n  # Fast installation is not necessary\n  enable_fast_install=needless\nfi\n\n\n\n\n\n\n  if test yes != \"$enable_dlopen\"; then\n  enable_dlopen=unknown\n  enable_dlopen_self=unknown\n  enable_dlopen_self_static=unknown\nelse\n  lt_cv_dlopen=no\n  lt_cv_dlopen_libs=\n\n  case $host_os in\n  beos*)\n    lt_cv_dlopen=load_add_on\n    lt_cv_dlopen_libs=\n    lt_cv_dlopen_self=yes\n    ;;\n\n  mingw* | pw32* | cegcc*)\n    lt_cv_dlopen=LoadLibrary\n    lt_cv_dlopen_libs=\n    ;;\n\n  cygwin*)\n    lt_cv_dlopen=dlopen\n    lt_cv_dlopen_libs=\n    ;;\n\n  darwin*)\n    # if libdl is installed we need to link against it\n    { $as_echo \"$as_me:${as_lineno-$LINENO}: checking for dlopen in -ldl\" >&5\n$as_echo_n \"checking for dlopen in -ldl... \" >&6; }\nif ${ac_cv_lib_dl_dlopen+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  ac_check_lib_save_LIBS=$LIBS\nLIBS=\"-ldl  $LIBS\"\ncat confdefs.h - <<_ACEOF >conftest.$ac_ext\n/* end confdefs.h.  */\n\n/* Override any GCC internal prototype to avoid an error.\n   Use char because int might match the return type of a GCC\n   builtin and then its argument prototype would still apply.  */\n#ifdef __cplusplus\nextern \"C\"\n#endif\nchar dlopen ();\nint\nmain ()\n{\nreturn dlopen ();\n  ;\n  return 0;\n}\n_ACEOF\nif ac_fn_c_try_link \"$LINENO\"; then :\n  ac_cv_lib_dl_dlopen=yes\nelse\n  ac_cv_lib_dl_dlopen=no\nfi\nrm -f core conftest.err conftest.$ac_objext \\\n    conftest$ac_exeext conftest.$ac_ext\nLIBS=$ac_check_lib_save_LIBS\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_dl_dlopen\" >&5\n$as_echo \"$ac_cv_lib_dl_dlopen\" >&6; }\nif test \"x$ac_cv_lib_dl_dlopen\" = xyes; then :\n  lt_cv_dlopen=dlopen lt_cv_dlopen_libs=-ldl\nelse\n\n    lt_cv_dlopen=dyld\n    lt_cv_dlopen_libs=\n    lt_cv_dlopen_self=yes\n\nfi\n\n    ;;\n\n  tpf*)\n    # Don't try to run any link tests for TPF.  We know it's impossible\n    # because TPF is a cross-compiler, and we know how we open DSOs.\n    lt_cv_dlopen=dlopen\n    lt_cv_dlopen_libs=\n    lt_cv_dlopen_self=no\n    ;;\n\n  *)\n    ac_fn_c_check_func \"$LINENO\" \"shl_load\" \"ac_cv_func_shl_load\"\nif test \"x$ac_cv_func_shl_load\" = xyes; then :\n  lt_cv_dlopen=shl_load\nelse\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: checking for shl_load in -ldld\" >&5\n$as_echo_n \"checking for shl_load in -ldld... \" >&6; }\nif ${ac_cv_lib_dld_shl_load+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  ac_check_lib_save_LIBS=$LIBS\nLIBS=\"-ldld  $LIBS\"\ncat confdefs.h - <<_ACEOF >conftest.$ac_ext\n/* end confdefs.h.  */\n\n/* Override any GCC internal prototype to avoid an error.\n   Use char because int might match the return type of a GCC\n   builtin and then its argument prototype would still apply.  */\n#ifdef __cplusplus\nextern \"C\"\n#endif\nchar shl_load ();\nint\nmain ()\n{\nreturn shl_load ();\n  ;\n  return 0;\n}\n_ACEOF\nif ac_fn_c_try_link \"$LINENO\"; then :\n  ac_cv_lib_dld_shl_load=yes\nelse\n  ac_cv_lib_dld_shl_load=no\nfi\nrm -f core conftest.err conftest.$ac_objext \\\n    conftest$ac_exeext conftest.$ac_ext\nLIBS=$ac_check_lib_save_LIBS\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_dld_shl_load\" >&5\n$as_echo \"$ac_cv_lib_dld_shl_load\" >&6; }\nif test \"x$ac_cv_lib_dld_shl_load\" = xyes; then :\n  lt_cv_dlopen=shl_load lt_cv_dlopen_libs=-ldld\nelse\n  ac_fn_c_check_func \"$LINENO\" \"dlopen\" \"ac_cv_func_dlopen\"\nif test \"x$ac_cv_func_dlopen\" = xyes; then :\n  lt_cv_dlopen=dlopen\nelse\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: checking for dlopen in -ldl\" >&5\n$as_echo_n \"checking for dlopen in -ldl... \" >&6; }\nif ${ac_cv_lib_dl_dlopen+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  ac_check_lib_save_LIBS=$LIBS\nLIBS=\"-ldl  $LIBS\"\ncat confdefs.h - <<_ACEOF >conftest.$ac_ext\n/* end confdefs.h.  */\n\n/* Override any GCC internal prototype to avoid an error.\n   Use char because int might match the return type of a GCC\n   builtin and then its argument prototype would still apply.  */\n#ifdef __cplusplus\nextern \"C\"\n#endif\nchar dlopen ();\nint\nmain ()\n{\nreturn dlopen ();\n  ;\n  return 0;\n}\n_ACEOF\nif ac_fn_c_try_link \"$LINENO\"; then :\n  ac_cv_lib_dl_dlopen=yes\nelse\n  ac_cv_lib_dl_dlopen=no\nfi\nrm -f core conftest.err conftest.$ac_objext \\\n    conftest$ac_exeext conftest.$ac_ext\nLIBS=$ac_check_lib_save_LIBS\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_dl_dlopen\" >&5\n$as_echo \"$ac_cv_lib_dl_dlopen\" >&6; }\nif test \"x$ac_cv_lib_dl_dlopen\" = xyes; then :\n  lt_cv_dlopen=dlopen lt_cv_dlopen_libs=-ldl\nelse\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: checking for dlopen in -lsvld\" >&5\n$as_echo_n \"checking for dlopen in -lsvld... \" >&6; }\nif ${ac_cv_lib_svld_dlopen+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  ac_check_lib_save_LIBS=$LIBS\nLIBS=\"-lsvld  $LIBS\"\ncat confdefs.h - <<_ACEOF >conftest.$ac_ext\n/* end confdefs.h.  */\n\n/* Override any GCC internal prototype to avoid an error.\n   Use char because int might match the return type of a GCC\n   builtin and then its argument prototype would still apply.  */\n#ifdef __cplusplus\nextern \"C\"\n#endif\nchar dlopen ();\nint\nmain ()\n{\nreturn dlopen ();\n  ;\n  return 0;\n}\n_ACEOF\nif ac_fn_c_try_link \"$LINENO\"; then :\n  ac_cv_lib_svld_dlopen=yes\nelse\n  ac_cv_lib_svld_dlopen=no\nfi\nrm -f core conftest.err conftest.$ac_objext \\\n    conftest$ac_exeext conftest.$ac_ext\nLIBS=$ac_check_lib_save_LIBS\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_svld_dlopen\" >&5\n$as_echo \"$ac_cv_lib_svld_dlopen\" >&6; }\nif test \"x$ac_cv_lib_svld_dlopen\" = xyes; then :\n  lt_cv_dlopen=dlopen lt_cv_dlopen_libs=-lsvld\nelse\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: checking for dld_link in -ldld\" >&5\n$as_echo_n \"checking for dld_link in -ldld... \" >&6; }\nif ${ac_cv_lib_dld_dld_link+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  ac_check_lib_save_LIBS=$LIBS\nLIBS=\"-ldld  $LIBS\"\ncat confdefs.h - <<_ACEOF >conftest.$ac_ext\n/* end confdefs.h.  */\n\n/* Override any GCC internal prototype to avoid an error.\n   Use char because int might match the return type of a GCC\n   builtin and then its argument prototype would still apply.  */\n#ifdef __cplusplus\nextern \"C\"\n#endif\nchar dld_link ();\nint\nmain ()\n{\nreturn dld_link ();\n  ;\n  return 0;\n}\n_ACEOF\nif ac_fn_c_try_link \"$LINENO\"; then :\n  ac_cv_lib_dld_dld_link=yes\nelse\n  ac_cv_lib_dld_dld_link=no\nfi\nrm -f core conftest.err conftest.$ac_objext \\\n    conftest$ac_exeext conftest.$ac_ext\nLIBS=$ac_check_lib_save_LIBS\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_dld_dld_link\" >&5\n$as_echo \"$ac_cv_lib_dld_dld_link\" >&6; }\nif test \"x$ac_cv_lib_dld_dld_link\" = xyes; then :\n  lt_cv_dlopen=dld_link lt_cv_dlopen_libs=-ldld\nfi\n\n\nfi\n\n\nfi\n\n\nfi\n\n\nfi\n\n\nfi\n\n    ;;\n  esac\n\n  if test no = \"$lt_cv_dlopen\"; then\n    enable_dlopen=no\n  else\n    enable_dlopen=yes\n  fi\n\n  case $lt_cv_dlopen in\n  dlopen)\n    save_CPPFLAGS=$CPPFLAGS\n    test yes = \"$ac_cv_header_dlfcn_h\" && CPPFLAGS=\"$CPPFLAGS -DHAVE_DLFCN_H\"\n\n    save_LDFLAGS=$LDFLAGS\n    wl=$lt_prog_compiler_wl eval LDFLAGS=\\\"\\$LDFLAGS $export_dynamic_flag_spec\\\"\n\n    save_LIBS=$LIBS\n    LIBS=\"$lt_cv_dlopen_libs $LIBS\"\n\n    { $as_echo \"$as_me:${as_lineno-$LINENO}: checking whether a program can dlopen itself\" >&5\n$as_echo_n \"checking whether a program can dlopen itself... \" >&6; }\nif ${lt_cv_dlopen_self+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  \t  if test yes = \"$cross_compiling\"; then :\n  lt_cv_dlopen_self=cross\nelse\n  lt_dlunknown=0; lt_dlno_uscore=1; lt_dlneed_uscore=2\n  lt_status=$lt_dlunknown\n  cat > conftest.$ac_ext <<_LT_EOF\n#line $LINENO \"configure\"\n#include \"confdefs.h\"\n\n#if HAVE_DLFCN_H\n#include <dlfcn.h>\n#endif\n\n#include <stdio.h>\n\n#ifdef RTLD_GLOBAL\n#  define LT_DLGLOBAL\t\tRTLD_GLOBAL\n#else\n#  ifdef DL_GLOBAL\n#    define LT_DLGLOBAL\t\tDL_GLOBAL\n#  else\n#    define LT_DLGLOBAL\t\t0\n#  endif\n#endif\n\n/* We may have to define LT_DLLAZY_OR_NOW in the command line if we\n   find out it does not work in some platform. */\n#ifndef LT_DLLAZY_OR_NOW\n#  ifdef RTLD_LAZY\n#    define LT_DLLAZY_OR_NOW\t\tRTLD_LAZY\n#  else\n#    ifdef DL_LAZY\n#      define LT_DLLAZY_OR_NOW\t\tDL_LAZY\n#    else\n#      ifdef RTLD_NOW\n#        define LT_DLLAZY_OR_NOW\tRTLD_NOW\n#      else\n#        ifdef DL_NOW\n#          define LT_DLLAZY_OR_NOW\tDL_NOW\n#        else\n#          define LT_DLLAZY_OR_NOW\t0\n#        endif\n#      endif\n#    endif\n#  endif\n#endif\n\n/* When -fvisibility=hidden is used, assume the code has been annotated\n   correspondingly for the symbols needed.  */\n#if defined __GNUC__ && (((__GNUC__ == 3) && (__GNUC_MINOR__ >= 3)) || (__GNUC__ > 3))\nint fnord () __attribute__((visibility(\"default\")));\n#endif\n\nint fnord () { return 42; }\nint main ()\n{\n  void *self = dlopen (0, LT_DLGLOBAL|LT_DLLAZY_OR_NOW);\n  int status = $lt_dlunknown;\n\n  if (self)\n    {\n      if (dlsym (self,\"fnord\"))       status = $lt_dlno_uscore;\n      else\n        {\n\t  if (dlsym( self,\"_fnord\"))  status = $lt_dlneed_uscore;\n          else puts (dlerror ());\n\t}\n      /* dlclose (self); */\n    }\n  else\n    puts (dlerror ());\n\n  return status;\n}\n_LT_EOF\n  if { { eval echo \"\\\"\\$as_me\\\":${as_lineno-$LINENO}: \\\"$ac_link\\\"\"; } >&5\n  (eval $ac_link) 2>&5\n  ac_status=$?\n  $as_echo \"$as_me:${as_lineno-$LINENO}: \\$? = $ac_status\" >&5\n  test $ac_status = 0; } && test -s \"conftest$ac_exeext\" 2>/dev/null; then\n    (./conftest; exit; ) >&5 2>/dev/null\n    lt_status=$?\n    case x$lt_status in\n      x$lt_dlno_uscore) lt_cv_dlopen_self=yes ;;\n      x$lt_dlneed_uscore) lt_cv_dlopen_self=yes ;;\n      x$lt_dlunknown|x*) lt_cv_dlopen_self=no ;;\n    esac\n  else :\n    # compilation failed\n    lt_cv_dlopen_self=no\n  fi\nfi\nrm -fr conftest*\n\n\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $lt_cv_dlopen_self\" >&5\n$as_echo \"$lt_cv_dlopen_self\" >&6; }\n\n    if test yes = \"$lt_cv_dlopen_self\"; then\n      wl=$lt_prog_compiler_wl eval LDFLAGS=\\\"\\$LDFLAGS $lt_prog_compiler_static\\\"\n      { $as_echo \"$as_me:${as_lineno-$LINENO}: checking whether a statically linked program can dlopen itself\" >&5\n$as_echo_n \"checking whether a statically linked program can dlopen itself... \" >&6; }\nif ${lt_cv_dlopen_self_static+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  \t  if test yes = \"$cross_compiling\"; then :\n  lt_cv_dlopen_self_static=cross\nelse\n  lt_dlunknown=0; lt_dlno_uscore=1; lt_dlneed_uscore=2\n  lt_status=$lt_dlunknown\n  cat > conftest.$ac_ext <<_LT_EOF\n#line $LINENO \"configure\"\n#include \"confdefs.h\"\n\n#if HAVE_DLFCN_H\n#include <dlfcn.h>\n#endif\n\n#include <stdio.h>\n\n#ifdef RTLD_GLOBAL\n#  define LT_DLGLOBAL\t\tRTLD_GLOBAL\n#else\n#  ifdef DL_GLOBAL\n#    define LT_DLGLOBAL\t\tDL_GLOBAL\n#  else\n#    define LT_DLGLOBAL\t\t0\n#  endif\n#endif\n\n/* We may have to define LT_DLLAZY_OR_NOW in the command line if we\n   find out it does not work in some platform. */\n#ifndef LT_DLLAZY_OR_NOW\n#  ifdef RTLD_LAZY\n#    define LT_DLLAZY_OR_NOW\t\tRTLD_LAZY\n#  else\n#    ifdef DL_LAZY\n#      define LT_DLLAZY_OR_NOW\t\tDL_LAZY\n#    else\n#      ifdef RTLD_NOW\n#        define LT_DLLAZY_OR_NOW\tRTLD_NOW\n#      else\n#        ifdef DL_NOW\n#          define LT_DLLAZY_OR_NOW\tDL_NOW\n#        else\n#          define LT_DLLAZY_OR_NOW\t0\n#        endif\n#      endif\n#    endif\n#  endif\n#endif\n\n/* When -fvisibility=hidden is used, assume the code has been annotated\n   correspondingly for the symbols needed.  */\n#if defined __GNUC__ && (((__GNUC__ == 3) && (__GNUC_MINOR__ >= 3)) || (__GNUC__ > 3))\nint fnord () __attribute__((visibility(\"default\")));\n#endif\n\nint fnord () { return 42; }\nint main ()\n{\n  void *self = dlopen (0, LT_DLGLOBAL|LT_DLLAZY_OR_NOW);\n  int status = $lt_dlunknown;\n\n  if (self)\n    {\n      if (dlsym (self,\"fnord\"))       status = $lt_dlno_uscore;\n      else\n        {\n\t  if (dlsym( self,\"_fnord\"))  status = $lt_dlneed_uscore;\n          else puts (dlerror ());\n\t}\n      /* dlclose (self); */\n    }\n  else\n    puts (dlerror ());\n\n  return status;\n}\n_LT_EOF\n  if { { eval echo \"\\\"\\$as_me\\\":${as_lineno-$LINENO}: \\\"$ac_link\\\"\"; } >&5\n  (eval $ac_link) 2>&5\n  ac_status=$?\n  $as_echo \"$as_me:${as_lineno-$LINENO}: \\$? = $ac_status\" >&5\n  test $ac_status = 0; } && test -s \"conftest$ac_exeext\" 2>/dev/null; then\n    (./conftest; exit; ) >&5 2>/dev/null\n    lt_status=$?\n    case x$lt_status in\n      x$lt_dlno_uscore) lt_cv_dlopen_self_static=yes ;;\n      x$lt_dlneed_uscore) lt_cv_dlopen_self_static=yes ;;\n      x$lt_dlunknown|x*) lt_cv_dlopen_self_static=no ;;\n    esac\n  else :\n    # compilation failed\n    lt_cv_dlopen_self_static=no\n  fi\nfi\nrm -fr conftest*\n\n\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $lt_cv_dlopen_self_static\" >&5\n$as_echo \"$lt_cv_dlopen_self_static\" >&6; }\n    fi\n\n    CPPFLAGS=$save_CPPFLAGS\n    LDFLAGS=$save_LDFLAGS\n    LIBS=$save_LIBS\n    ;;\n  esac\n\n  case $lt_cv_dlopen_self in\n  yes|no) enable_dlopen_self=$lt_cv_dlopen_self ;;\n  *) enable_dlopen_self=unknown ;;\n  esac\n\n  case $lt_cv_dlopen_self_static in\n  yes|no) enable_dlopen_self_static=$lt_cv_dlopen_self_static ;;\n  *) enable_dlopen_self_static=unknown ;;\n  esac\nfi\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\nstriplib=\nold_striplib=\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking whether stripping libraries is possible\" >&5\n$as_echo_n \"checking whether stripping libraries is possible... \" >&6; }\nif test -n \"$STRIP\" && $STRIP -V 2>&1 | $GREP \"GNU strip\" >/dev/null; then\n  test -z \"$old_striplib\" && old_striplib=\"$STRIP --strip-debug\"\n  test -z \"$striplib\" && striplib=\"$STRIP --strip-unneeded\"\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: yes\" >&5\n$as_echo \"yes\" >&6; }\nelse\n# FIXME - insert some real tests, host_os isn't really good enough\n  case $host_os in\n  darwin*)\n    if test -n \"$STRIP\"; then\n      striplib=\"$STRIP -x\"\n      old_striplib=\"$STRIP -S\"\n      { $as_echo \"$as_me:${as_lineno-$LINENO}: result: yes\" >&5\n$as_echo \"yes\" >&6; }\n    else\n      { $as_echo \"$as_me:${as_lineno-$LINENO}: result: no\" >&5\n$as_echo \"no\" >&6; }\n    fi\n    ;;\n  *)\n    { $as_echo \"$as_me:${as_lineno-$LINENO}: result: no\" >&5\n$as_echo \"no\" >&6; }\n    ;;\n  esac\nfi\n\n\n\n\n\n\n\n\n\n\n\n\n  # Report what library types will actually be built\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: checking if libtool supports shared libraries\" >&5\n$as_echo_n \"checking if libtool supports shared libraries... \" >&6; }\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: $can_build_shared\" >&5\n$as_echo \"$can_build_shared\" >&6; }\n\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: checking whether to build shared libraries\" >&5\n$as_echo_n \"checking whether to build shared libraries... \" >&6; }\n  test no = \"$can_build_shared\" && enable_shared=no\n\n  # On AIX, shared libraries and static libraries use the same namespace, and\n  # are all built from PIC.\n  case $host_os in\n  aix3*)\n    test yes = \"$enable_shared\" && enable_static=no\n    if test -n \"$RANLIB\"; then\n      archive_cmds=\"$archive_cmds~\\$RANLIB \\$lib\"\n      postinstall_cmds='$RANLIB $lib'\n    fi\n    ;;\n\n  aix[4-9]*)\n    if test ia64 != \"$host_cpu\"; then\n      case $enable_shared,$with_aix_soname,$aix_use_runtimelinking in\n      yes,aix,yes) ;;\t\t\t# shared object as lib.so file only\n      yes,svr4,*) ;;\t\t\t# shared object as lib.so archive member only\n      yes,*) enable_static=no ;;\t# shared object in lib.a archive as well\n      esac\n    fi\n    ;;\n  esac\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: $enable_shared\" >&5\n$as_echo \"$enable_shared\" >&6; }\n\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: checking whether to build static libraries\" >&5\n$as_echo_n \"checking whether to build static libraries... \" >&6; }\n  # Make sure either enable_shared or enable_static is yes.\n  test yes = \"$enable_shared\" || enable_static=yes\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: $enable_static\" >&5\n$as_echo \"$enable_static\" >&6; }\n\n\n\n\nfi\nac_ext=c\nac_cpp='$CPP $CPPFLAGS'\nac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5'\nac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5'\nac_compiler_gnu=$ac_cv_c_compiler_gnu\n\nCC=$lt_save_CC\n\n      if test -n \"$CXX\" && ( test no != \"$CXX\" &&\n    ( (test g++ = \"$CXX\" && `g++ -v >/dev/null 2>&1` ) ||\n    (test g++ != \"$CXX\"))); then\n  ac_ext=cpp\nac_cpp='$CXXCPP $CPPFLAGS'\nac_compile='$CXX -c $CXXFLAGS $CPPFLAGS conftest.$ac_ext >&5'\nac_link='$CXX -o conftest$ac_exeext $CXXFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5'\nac_compiler_gnu=$ac_cv_cxx_compiler_gnu\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking how to run the C++ preprocessor\" >&5\n$as_echo_n \"checking how to run the C++ preprocessor... \" >&6; }\nif test -z \"$CXXCPP\"; then\n  if ${ac_cv_prog_CXXCPP+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n      # Double quotes because CXXCPP needs to be expanded\n    for CXXCPP in \"$CXX -E\" \"/lib/cpp\"\n    do\n      ac_preproc_ok=false\nfor ac_cxx_preproc_warn_flag in '' yes\ndo\n  # Use a header file that comes with gcc, so configuring glibc\n  # with a fresh cross-compiler works.\n  # Prefer <limits.h> to <assert.h> if __STDC__ is defined, since\n  # <limits.h> exists even on freestanding compilers.\n  # On the NeXT, cc -E runs the code through the compiler's parser,\n  # not just through cpp. \"Syntax error\" is here to catch this case.\n  cat confdefs.h - <<_ACEOF >conftest.$ac_ext\n/* end confdefs.h.  */\n#ifdef __STDC__\n# include <limits.h>\n#else\n# include <assert.h>\n#endif\n\t\t     Syntax error\n_ACEOF\nif ac_fn_cxx_try_cpp \"$LINENO\"; then :\n\nelse\n  # Broken: fails on valid input.\ncontinue\nfi\nrm -f conftest.err conftest.i conftest.$ac_ext\n\n  # OK, works on sane cases.  Now check whether nonexistent headers\n  # can be detected and how.\n  cat confdefs.h - <<_ACEOF >conftest.$ac_ext\n/* end confdefs.h.  */\n#include <ac_nonexistent.h>\n_ACEOF\nif ac_fn_cxx_try_cpp \"$LINENO\"; then :\n  # Broken: success on invalid input.\ncontinue\nelse\n  # Passes both tests.\nac_preproc_ok=:\nbreak\nfi\nrm -f conftest.err conftest.i conftest.$ac_ext\n\ndone\n# Because of `break', _AC_PREPROC_IFELSE's cleaning code was skipped.\nrm -f conftest.i conftest.err conftest.$ac_ext\nif $ac_preproc_ok; then :\n  break\nfi\n\n    done\n    ac_cv_prog_CXXCPP=$CXXCPP\n\nfi\n  CXXCPP=$ac_cv_prog_CXXCPP\nelse\n  ac_cv_prog_CXXCPP=$CXXCPP\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $CXXCPP\" >&5\n$as_echo \"$CXXCPP\" >&6; }\nac_preproc_ok=false\nfor ac_cxx_preproc_warn_flag in '' yes\ndo\n  # Use a header file that comes with gcc, so configuring glibc\n  # with a fresh cross-compiler works.\n  # Prefer <limits.h> to <assert.h> if __STDC__ is defined, since\n  # <limits.h> exists even on freestanding compilers.\n  # On the NeXT, cc -E runs the code through the compiler's parser,\n  # not just through cpp. \"Syntax error\" is here to catch this case.\n  cat confdefs.h - <<_ACEOF >conftest.$ac_ext\n/* end confdefs.h.  */\n#ifdef __STDC__\n# include <limits.h>\n#else\n# include <assert.h>\n#endif\n\t\t     Syntax error\n_ACEOF\nif ac_fn_cxx_try_cpp \"$LINENO\"; then :\n\nelse\n  # Broken: fails on valid input.\ncontinue\nfi\nrm -f conftest.err conftest.i conftest.$ac_ext\n\n  # OK, works on sane cases.  Now check whether nonexistent headers\n  # can be detected and how.\n  cat confdefs.h - <<_ACEOF >conftest.$ac_ext\n/* end confdefs.h.  */\n#include <ac_nonexistent.h>\n_ACEOF\nif ac_fn_cxx_try_cpp \"$LINENO\"; then :\n  # Broken: success on invalid input.\ncontinue\nelse\n  # Passes both tests.\nac_preproc_ok=:\nbreak\nfi\nrm -f conftest.err conftest.i conftest.$ac_ext\n\ndone\n# Because of `break', _AC_PREPROC_IFELSE's cleaning code was skipped.\nrm -f conftest.i conftest.err conftest.$ac_ext\nif $ac_preproc_ok; then :\n\nelse\n  { { $as_echo \"$as_me:${as_lineno-$LINENO}: error: in \\`$ac_pwd':\" >&5\n$as_echo \"$as_me: error: in \\`$ac_pwd':\" >&2;}\nas_fn_error $? \"C++ preprocessor \\\"$CXXCPP\\\" fails sanity check\nSee \\`config.log' for more details\" \"$LINENO\" 5; }\nfi\n\nac_ext=c\nac_cpp='$CPP $CPPFLAGS'\nac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5'\nac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5'\nac_compiler_gnu=$ac_cv_c_compiler_gnu\n\nelse\n  _lt_caught_CXX_error=yes\nfi\n\nac_ext=cpp\nac_cpp='$CXXCPP $CPPFLAGS'\nac_compile='$CXX -c $CXXFLAGS $CPPFLAGS conftest.$ac_ext >&5'\nac_link='$CXX -o conftest$ac_exeext $CXXFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5'\nac_compiler_gnu=$ac_cv_cxx_compiler_gnu\n\narchive_cmds_need_lc_CXX=no\nallow_undefined_flag_CXX=\nalways_export_symbols_CXX=no\narchive_expsym_cmds_CXX=\ncompiler_needs_object_CXX=no\nexport_dynamic_flag_spec_CXX=\nhardcode_direct_CXX=no\nhardcode_direct_absolute_CXX=no\nhardcode_libdir_flag_spec_CXX=\nhardcode_libdir_separator_CXX=\nhardcode_minus_L_CXX=no\nhardcode_shlibpath_var_CXX=unsupported\nhardcode_automatic_CXX=no\ninherit_rpath_CXX=no\nmodule_cmds_CXX=\nmodule_expsym_cmds_CXX=\nlink_all_deplibs_CXX=unknown\nold_archive_cmds_CXX=$old_archive_cmds\nreload_flag_CXX=$reload_flag\nreload_cmds_CXX=$reload_cmds\nno_undefined_flag_CXX=\nwhole_archive_flag_spec_CXX=\nenable_shared_with_static_runtimes_CXX=no\n\n# Source file extension for C++ test sources.\nac_ext=cpp\n\n# Object file extension for compiled C++ test sources.\nobjext=o\nobjext_CXX=$objext\n\n# No sense in running all these tests if we already determined that\n# the CXX compiler isn't working.  Some variables (like enable_shared)\n# are currently assumed to apply to all compilers on this platform,\n# and will be corrupted by setting them based on a non-working compiler.\nif test yes != \"$_lt_caught_CXX_error\"; then\n  # Code to be used in simple compile tests\n  lt_simple_compile_test_code=\"int some_variable = 0;\"\n\n  # Code to be used in simple link tests\n  lt_simple_link_test_code='int main(int, char *[]) { return(0); }'\n\n  # ltmain only uses $CC for tagged configurations so make sure $CC is set.\n\n\n\n\n\n\n# If no C compiler was specified, use CC.\nLTCC=${LTCC-\"$CC\"}\n\n# If no C compiler flags were specified, use CFLAGS.\nLTCFLAGS=${LTCFLAGS-\"$CFLAGS\"}\n\n# Allow CC to be a program name with arguments.\ncompiler=$CC\n\n\n  # save warnings/boilerplate of simple test code\n  ac_outfile=conftest.$ac_objext\necho \"$lt_simple_compile_test_code\" >conftest.$ac_ext\neval \"$ac_compile\" 2>&1 >/dev/null | $SED '/^$/d; /^ *+/d' >conftest.err\n_lt_compiler_boilerplate=`cat conftest.err`\n$RM conftest*\n\n  ac_outfile=conftest.$ac_objext\necho \"$lt_simple_link_test_code\" >conftest.$ac_ext\neval \"$ac_link\" 2>&1 >/dev/null | $SED '/^$/d; /^ *+/d' >conftest.err\n_lt_linker_boilerplate=`cat conftest.err`\n$RM -r conftest*\n\n\n  # Allow CC to be a program name with arguments.\n  lt_save_CC=$CC\n  lt_save_CFLAGS=$CFLAGS\n  lt_save_LD=$LD\n  lt_save_GCC=$GCC\n  GCC=$GXX\n  lt_save_with_gnu_ld=$with_gnu_ld\n  lt_save_path_LD=$lt_cv_path_LD\n  if test -n \"${lt_cv_prog_gnu_ldcxx+set}\"; then\n    lt_cv_prog_gnu_ld=$lt_cv_prog_gnu_ldcxx\n  else\n    $as_unset lt_cv_prog_gnu_ld\n  fi\n  if test -n \"${lt_cv_path_LDCXX+set}\"; then\n    lt_cv_path_LD=$lt_cv_path_LDCXX\n  else\n    $as_unset lt_cv_path_LD\n  fi\n  test -z \"${LDCXX+set}\" || LD=$LDCXX\n  CC=${CXX-\"c++\"}\n  CFLAGS=$CXXFLAGS\n  compiler=$CC\n  compiler_CXX=$CC\n  func_cc_basename $compiler\ncc_basename=$func_cc_basename_result\n\n\n  if test -n \"$compiler\"; then\n    # We don't want -fno-exception when compiling C++ code, so set the\n    # no_builtin_flag separately\n    if test yes = \"$GXX\"; then\n      lt_prog_compiler_no_builtin_flag_CXX=' -fno-builtin'\n    else\n      lt_prog_compiler_no_builtin_flag_CXX=\n    fi\n\n    if test yes = \"$GXX\"; then\n      # Set up default GNU C++ configuration\n\n\n\n# Check whether --with-gnu-ld was given.\nif test \"${with_gnu_ld+set}\" = set; then :\n  withval=$with_gnu_ld; test no = \"$withval\" || with_gnu_ld=yes\nelse\n  with_gnu_ld=no\nfi\n\nac_prog=ld\nif test yes = \"$GCC\"; then\n  # Check if gcc -print-prog-name=ld gives a path.\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: checking for ld used by $CC\" >&5\n$as_echo_n \"checking for ld used by $CC... \" >&6; }\n  case $host in\n  *-*-mingw*)\n    # gcc leaves a trailing carriage return, which upsets mingw\n    ac_prog=`($CC -print-prog-name=ld) 2>&5 | tr -d '\\015'` ;;\n  *)\n    ac_prog=`($CC -print-prog-name=ld) 2>&5` ;;\n  esac\n  case $ac_prog in\n    # Accept absolute paths.\n    [\\\\/]* | ?:[\\\\/]*)\n      re_direlt='/[^/][^/]*/\\.\\./'\n      # Canonicalize the pathname of ld\n      ac_prog=`$ECHO \"$ac_prog\"| $SED 's%\\\\\\\\%/%g'`\n      while $ECHO \"$ac_prog\" | $GREP \"$re_direlt\" > /dev/null 2>&1; do\n\tac_prog=`$ECHO $ac_prog| $SED \"s%$re_direlt%/%\"`\n      done\n      test -z \"$LD\" && LD=$ac_prog\n      ;;\n  \"\")\n    # If it fails, then pretend we aren't using GCC.\n    ac_prog=ld\n    ;;\n  *)\n    # If it is relative, then search for the first ld in PATH.\n    with_gnu_ld=unknown\n    ;;\n  esac\nelif test yes = \"$with_gnu_ld\"; then\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: checking for GNU ld\" >&5\n$as_echo_n \"checking for GNU ld... \" >&6; }\nelse\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: checking for non-GNU ld\" >&5\n$as_echo_n \"checking for non-GNU ld... \" >&6; }\nfi\nif ${lt_cv_path_LD+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  if test -z \"$LD\"; then\n  lt_save_ifs=$IFS; IFS=$PATH_SEPARATOR\n  for ac_dir in $PATH; do\n    IFS=$lt_save_ifs\n    test -z \"$ac_dir\" && ac_dir=.\n    if test -f \"$ac_dir/$ac_prog\" || test -f \"$ac_dir/$ac_prog$ac_exeext\"; then\n      lt_cv_path_LD=$ac_dir/$ac_prog\n      # Check to see if the program is GNU ld.  I'd rather use --version,\n      # but apparently some variants of GNU ld only accept -v.\n      # Break only if it was the GNU/non-GNU ld that we prefer.\n      case `\"$lt_cv_path_LD\" -v 2>&1 </dev/null` in\n      *GNU* | *'with BFD'*)\n\ttest no != \"$with_gnu_ld\" && break\n\t;;\n      *)\n\ttest yes != \"$with_gnu_ld\" && break\n\t;;\n      esac\n    fi\n  done\n  IFS=$lt_save_ifs\nelse\n  lt_cv_path_LD=$LD # Let the user override the test with a path.\nfi\nfi\n\nLD=$lt_cv_path_LD\nif test -n \"$LD\"; then\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: $LD\" >&5\n$as_echo \"$LD\" >&6; }\nelse\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: no\" >&5\n$as_echo \"no\" >&6; }\nfi\ntest -z \"$LD\" && as_fn_error $? \"no acceptable ld found in \\$PATH\" \"$LINENO\" 5\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking if the linker ($LD) is GNU ld\" >&5\n$as_echo_n \"checking if the linker ($LD) is GNU ld... \" >&6; }\nif ${lt_cv_prog_gnu_ld+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  # I'd rather use --version here, but apparently some GNU lds only accept -v.\ncase `$LD -v 2>&1 </dev/null` in\n*GNU* | *'with BFD'*)\n  lt_cv_prog_gnu_ld=yes\n  ;;\n*)\n  lt_cv_prog_gnu_ld=no\n  ;;\nesac\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $lt_cv_prog_gnu_ld\" >&5\n$as_echo \"$lt_cv_prog_gnu_ld\" >&6; }\nwith_gnu_ld=$lt_cv_prog_gnu_ld\n\n\n\n\n\n\n\n      # Check if GNU C++ uses GNU ld as the underlying linker, since the\n      # archiving commands below assume that GNU ld is being used.\n      if test yes = \"$with_gnu_ld\"; then\n        archive_cmds_CXX='$CC $pic_flag -shared -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags $wl-soname $wl$soname -o $lib'\n        archive_expsym_cmds_CXX='$CC $pic_flag -shared -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags $wl-soname $wl$soname $wl-retain-symbols-file $wl$export_symbols -o $lib'\n\n        hardcode_libdir_flag_spec_CXX='$wl-rpath $wl$libdir'\n        export_dynamic_flag_spec_CXX='$wl--export-dynamic'\n\n        # If archive_cmds runs LD, not CC, wlarc should be empty\n        # XXX I think wlarc can be eliminated in ltcf-cxx, but I need to\n        #     investigate it a little bit more. (MM)\n        wlarc='$wl'\n\n        # ancient GNU ld didn't support --whole-archive et. al.\n        if eval \"`$CC -print-prog-name=ld` --help 2>&1\" |\n\t  $GREP 'no-whole-archive' > /dev/null; then\n          whole_archive_flag_spec_CXX=$wlarc'--whole-archive$convenience '$wlarc'--no-whole-archive'\n        else\n          whole_archive_flag_spec_CXX=\n        fi\n      else\n        with_gnu_ld=no\n        wlarc=\n\n        # A generic and very simple default shared library creation\n        # command for GNU C++ for the case where it uses the native\n        # linker, instead of GNU ld.  If possible, this setting should\n        # overridden to take advantage of the native linker features on\n        # the platform it is being used on.\n        archive_cmds_CXX='$CC -shared -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -o $lib'\n      fi\n\n      # Commands to make compiler produce verbose output that lists\n      # what \"hidden\" libraries, object files and flags are used when\n      # linking a shared library.\n      output_verbose_link_cmd='$CC -shared $CFLAGS -v conftest.$objext 2>&1 | $GREP -v \"^Configured with:\" | $GREP \"\\-L\"'\n\n    else\n      GXX=no\n      with_gnu_ld=no\n      wlarc=\n    fi\n\n    # PORTME: fill in a description of your system's C++ link characteristics\n    { $as_echo \"$as_me:${as_lineno-$LINENO}: checking whether the $compiler linker ($LD) supports shared libraries\" >&5\n$as_echo_n \"checking whether the $compiler linker ($LD) supports shared libraries... \" >&6; }\n    ld_shlibs_CXX=yes\n    case $host_os in\n      aix3*)\n        # FIXME: insert proper C++ library support\n        ld_shlibs_CXX=no\n        ;;\n      aix[4-9]*)\n        if test ia64 = \"$host_cpu\"; then\n          # On IA64, the linker does run time linking by default, so we don't\n          # have to do anything special.\n          aix_use_runtimelinking=no\n          exp_sym_flag='-Bexport'\n          no_entry_flag=\n        else\n          aix_use_runtimelinking=no\n\n          # Test if we are trying to use run time linking or normal\n          # AIX style linking. If -brtl is somewhere in LDFLAGS, we\n          # have runtime linking enabled, and use it for executables.\n          # For shared libraries, we enable/disable runtime linking\n          # depending on the kind of the shared library created -\n          # when \"with_aix_soname,aix_use_runtimelinking\" is:\n          # \"aix,no\"   lib.a(lib.so.V) shared, rtl:no,  for executables\n          # \"aix,yes\"  lib.so          shared, rtl:yes, for executables\n          #            lib.a           static archive\n          # \"both,no\"  lib.so.V(shr.o) shared, rtl:yes\n          #            lib.a(lib.so.V) shared, rtl:no,  for executables\n          # \"both,yes\" lib.so.V(shr.o) shared, rtl:yes, for executables\n          #            lib.a(lib.so.V) shared, rtl:no\n          # \"svr4,*\"   lib.so.V(shr.o) shared, rtl:yes, for executables\n          #            lib.a           static archive\n          case $host_os in aix4.[23]|aix4.[23].*|aix[5-9]*)\n\t    for ld_flag in $LDFLAGS; do\n\t      case $ld_flag in\n\t      *-brtl*)\n\t        aix_use_runtimelinking=yes\n\t        break\n\t        ;;\n\t      esac\n\t    done\n\t    if test svr4,no = \"$with_aix_soname,$aix_use_runtimelinking\"; then\n\t      # With aix-soname=svr4, we create the lib.so.V shared archives only,\n\t      # so we don't have lib.a shared libs to link our executables.\n\t      # We have to force runtime linking in this case.\n\t      aix_use_runtimelinking=yes\n\t      LDFLAGS=\"$LDFLAGS -Wl,-brtl\"\n\t    fi\n\t    ;;\n          esac\n\n          exp_sym_flag='-bexport'\n          no_entry_flag='-bnoentry'\n        fi\n\n        # When large executables or shared objects are built, AIX ld can\n        # have problems creating the table of contents.  If linking a library\n        # or program results in \"error TOC overflow\" add -mminimal-toc to\n        # CXXFLAGS/CFLAGS for g++/gcc.  In the cases where that is not\n        # enough to fix the problem, add -Wl,-bbigtoc to LDFLAGS.\n\n        archive_cmds_CXX=''\n        hardcode_direct_CXX=yes\n        hardcode_direct_absolute_CXX=yes\n        hardcode_libdir_separator_CXX=':'\n        link_all_deplibs_CXX=yes\n        file_list_spec_CXX='$wl-f,'\n        case $with_aix_soname,$aix_use_runtimelinking in\n        aix,*) ;;\t# no import file\n        svr4,* | *,yes) # use import file\n          # The Import File defines what to hardcode.\n          hardcode_direct_CXX=no\n          hardcode_direct_absolute_CXX=no\n          ;;\n        esac\n\n        if test yes = \"$GXX\"; then\n          case $host_os in aix4.[012]|aix4.[012].*)\n          # We only want to do this on AIX 4.2 and lower, the check\n          # below for broken collect2 doesn't work under 4.3+\n\t  collect2name=`$CC -print-prog-name=collect2`\n\t  if test -f \"$collect2name\" &&\n\t     strings \"$collect2name\" | $GREP resolve_lib_name >/dev/null\n\t  then\n\t    # We have reworked collect2\n\t    :\n\t  else\n\t    # We have old collect2\n\t    hardcode_direct_CXX=unsupported\n\t    # It fails to find uninstalled libraries when the uninstalled\n\t    # path is not listed in the libpath.  Setting hardcode_minus_L\n\t    # to unsupported forces relinking\n\t    hardcode_minus_L_CXX=yes\n\t    hardcode_libdir_flag_spec_CXX='-L$libdir'\n\t    hardcode_libdir_separator_CXX=\n\t  fi\n          esac\n          shared_flag='-shared'\n\t  if test yes = \"$aix_use_runtimelinking\"; then\n\t    shared_flag=$shared_flag' $wl-G'\n\t  fi\n\t  # Need to ensure runtime linking is disabled for the traditional\n\t  # shared library, or the linker may eventually find shared libraries\n\t  # /with/ Import File - we do not want to mix them.\n\t  shared_flag_aix='-shared'\n\t  shared_flag_svr4='-shared $wl-G'\n        else\n          # not using gcc\n          if test ia64 = \"$host_cpu\"; then\n\t  # VisualAge C++, Version 5.5 for AIX 5L for IA-64, Beta 3 Release\n\t  # chokes on -Wl,-G. The following line is correct:\n\t  shared_flag='-G'\n          else\n\t    if test yes = \"$aix_use_runtimelinking\"; then\n\t      shared_flag='$wl-G'\n\t    else\n\t      shared_flag='$wl-bM:SRE'\n\t    fi\n\t    shared_flag_aix='$wl-bM:SRE'\n\t    shared_flag_svr4='$wl-G'\n          fi\n        fi\n\n        export_dynamic_flag_spec_CXX='$wl-bexpall'\n        # It seems that -bexpall does not export symbols beginning with\n        # underscore (_), so it is better to generate a list of symbols to\n\t# export.\n        always_export_symbols_CXX=yes\n\tif test aix,yes = \"$with_aix_soname,$aix_use_runtimelinking\"; then\n          # Warning - without using the other runtime loading flags (-brtl),\n          # -berok will link without error, but may produce a broken library.\n          # The \"-G\" linker flag allows undefined symbols.\n          no_undefined_flag_CXX='-bernotok'\n          # Determine the default libpath from the value encoded in an empty\n          # executable.\n          if test set = \"${lt_cv_aix_libpath+set}\"; then\n  aix_libpath=$lt_cv_aix_libpath\nelse\n  if ${lt_cv_aix_libpath__CXX+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  cat confdefs.h - <<_ACEOF >conftest.$ac_ext\n/* end confdefs.h.  */\n\nint\nmain ()\n{\n\n  ;\n  return 0;\n}\n_ACEOF\nif ac_fn_cxx_try_link \"$LINENO\"; then :\n\n  lt_aix_libpath_sed='\n      /Import File Strings/,/^$/ {\n\t  /^0/ {\n\t      s/^0  *\\([^ ]*\\) *$/\\1/\n\t      p\n\t  }\n      }'\n  lt_cv_aix_libpath__CXX=`dump -H conftest$ac_exeext 2>/dev/null | $SED -n -e \"$lt_aix_libpath_sed\"`\n  # Check for a 64-bit object if we didn't find anything.\n  if test -z \"$lt_cv_aix_libpath__CXX\"; then\n    lt_cv_aix_libpath__CXX=`dump -HX64 conftest$ac_exeext 2>/dev/null | $SED -n -e \"$lt_aix_libpath_sed\"`\n  fi\nfi\nrm -f core conftest.err conftest.$ac_objext \\\n    conftest$ac_exeext conftest.$ac_ext\n  if test -z \"$lt_cv_aix_libpath__CXX\"; then\n    lt_cv_aix_libpath__CXX=/usr/lib:/lib\n  fi\n\nfi\n\n  aix_libpath=$lt_cv_aix_libpath__CXX\nfi\n\n          hardcode_libdir_flag_spec_CXX='$wl-blibpath:$libdir:'\"$aix_libpath\"\n\n          archive_expsym_cmds_CXX='$CC -o $output_objdir/$soname $libobjs $deplibs $wl'$no_entry_flag' $compiler_flags `if test -n \"$allow_undefined_flag\"; then func_echo_all \"$wl$allow_undefined_flag\"; else :; fi` $wl'$exp_sym_flag:\\$export_symbols' '$shared_flag\n        else\n          if test ia64 = \"$host_cpu\"; then\n\t    hardcode_libdir_flag_spec_CXX='$wl-R $libdir:/usr/lib:/lib'\n\t    allow_undefined_flag_CXX=\"-z nodefs\"\n\t    archive_expsym_cmds_CXX=\"\\$CC $shared_flag\"' -o $output_objdir/$soname $libobjs $deplibs '\"\\$wl$no_entry_flag\"' $compiler_flags $wl$allow_undefined_flag '\"\\$wl$exp_sym_flag:\\$export_symbols\"\n          else\n\t    # Determine the default libpath from the value encoded in an\n\t    # empty executable.\n\t    if test set = \"${lt_cv_aix_libpath+set}\"; then\n  aix_libpath=$lt_cv_aix_libpath\nelse\n  if ${lt_cv_aix_libpath__CXX+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  cat confdefs.h - <<_ACEOF >conftest.$ac_ext\n/* end confdefs.h.  */\n\nint\nmain ()\n{\n\n  ;\n  return 0;\n}\n_ACEOF\nif ac_fn_cxx_try_link \"$LINENO\"; then :\n\n  lt_aix_libpath_sed='\n      /Import File Strings/,/^$/ {\n\t  /^0/ {\n\t      s/^0  *\\([^ ]*\\) *$/\\1/\n\t      p\n\t  }\n      }'\n  lt_cv_aix_libpath__CXX=`dump -H conftest$ac_exeext 2>/dev/null | $SED -n -e \"$lt_aix_libpath_sed\"`\n  # Check for a 64-bit object if we didn't find anything.\n  if test -z \"$lt_cv_aix_libpath__CXX\"; then\n    lt_cv_aix_libpath__CXX=`dump -HX64 conftest$ac_exeext 2>/dev/null | $SED -n -e \"$lt_aix_libpath_sed\"`\n  fi\nfi\nrm -f core conftest.err conftest.$ac_objext \\\n    conftest$ac_exeext conftest.$ac_ext\n  if test -z \"$lt_cv_aix_libpath__CXX\"; then\n    lt_cv_aix_libpath__CXX=/usr/lib:/lib\n  fi\n\nfi\n\n  aix_libpath=$lt_cv_aix_libpath__CXX\nfi\n\n\t    hardcode_libdir_flag_spec_CXX='$wl-blibpath:$libdir:'\"$aix_libpath\"\n\t    # Warning - without using the other run time loading flags,\n\t    # -berok will link without error, but may produce a broken library.\n\t    no_undefined_flag_CXX=' $wl-bernotok'\n\t    allow_undefined_flag_CXX=' $wl-berok'\n\t    if test yes = \"$with_gnu_ld\"; then\n\t      # We only use this code for GNU lds that support --whole-archive.\n\t      whole_archive_flag_spec_CXX='$wl--whole-archive$convenience $wl--no-whole-archive'\n\t    else\n\t      # Exported symbols can be pulled into shared objects from archives\n\t      whole_archive_flag_spec_CXX='$convenience'\n\t    fi\n\t    archive_cmds_need_lc_CXX=yes\n\t    archive_expsym_cmds_CXX='$RM -r $output_objdir/$realname.d~$MKDIR $output_objdir/$realname.d'\n\t    # -brtl affects multiple linker settings, -berok does not and is overridden later\n\t    compiler_flags_filtered='`func_echo_all \"$compiler_flags \" | $SED -e \"s%-brtl\\\\([, ]\\\\)%-berok\\\\1%g\"`'\n\t    if test svr4 != \"$with_aix_soname\"; then\n\t      # This is similar to how AIX traditionally builds its shared\n\t      # libraries. Need -bnortl late, we may have -brtl in LDFLAGS.\n\t      archive_expsym_cmds_CXX=\"$archive_expsym_cmds_CXX\"'~$CC '$shared_flag_aix' -o $output_objdir/$realname.d/$soname $libobjs $deplibs $wl-bnoentry '$compiler_flags_filtered'$wl-bE:$export_symbols$allow_undefined_flag~$AR $AR_FLAGS $output_objdir/$libname$release.a $output_objdir/$realname.d/$soname'\n\t    fi\n\t    if test aix != \"$with_aix_soname\"; then\n\t      archive_expsym_cmds_CXX=\"$archive_expsym_cmds_CXX\"'~$CC '$shared_flag_svr4' -o $output_objdir/$realname.d/$shared_archive_member_spec.o $libobjs $deplibs $wl-bnoentry '$compiler_flags_filtered'$wl-bE:$export_symbols$allow_undefined_flag~$STRIP -e $output_objdir/$realname.d/$shared_archive_member_spec.o~( func_echo_all \"#! $soname($shared_archive_member_spec.o)\"; if test shr_64 = \"$shared_archive_member_spec\"; then func_echo_all \"# 64\"; else func_echo_all \"# 32\"; fi; cat $export_symbols ) > $output_objdir/$realname.d/$shared_archive_member_spec.imp~$AR $AR_FLAGS $output_objdir/$soname $output_objdir/$realname.d/$shared_archive_member_spec.o $output_objdir/$realname.d/$shared_archive_member_spec.imp'\n\t    else\n\t      # used by -dlpreopen to get the symbols\n\t      archive_expsym_cmds_CXX=\"$archive_expsym_cmds_CXX\"'~$MV  $output_objdir/$realname.d/$soname $output_objdir'\n\t    fi\n\t    archive_expsym_cmds_CXX=\"$archive_expsym_cmds_CXX\"'~$RM -r $output_objdir/$realname.d'\n          fi\n        fi\n        ;;\n\n      beos*)\n\tif $LD --help 2>&1 | $GREP ': supported targets:.* elf' > /dev/null; then\n\t  allow_undefined_flag_CXX=unsupported\n\t  # Joseph Beckenbach <jrb3@best.com> says some releases of gcc\n\t  # support --undefined.  This deserves some investigation.  FIXME\n\t  archive_cmds_CXX='$CC -nostart $libobjs $deplibs $compiler_flags $wl-soname $wl$soname -o $lib'\n\telse\n\t  ld_shlibs_CXX=no\n\tfi\n\t;;\n\n      chorus*)\n        case $cc_basename in\n          *)\n\t  # FIXME: insert proper C++ library support\n\t  ld_shlibs_CXX=no\n\t  ;;\n        esac\n        ;;\n\n      cygwin* | mingw* | pw32* | cegcc*)\n\tcase $GXX,$cc_basename in\n\t,cl* | no,cl*)\n\t  # Native MSVC\n\t  # hardcode_libdir_flag_spec is actually meaningless, as there is\n\t  # no search path for DLLs.\n\t  hardcode_libdir_flag_spec_CXX=' '\n\t  allow_undefined_flag_CXX=unsupported\n\t  always_export_symbols_CXX=yes\n\t  file_list_spec_CXX='@'\n\t  # Tell ltmain to make .lib files, not .a files.\n\t  libext=lib\n\t  # Tell ltmain to make .dll files, not .so files.\n\t  shrext_cmds=.dll\n\t  # FIXME: Setting linknames here is a bad hack.\n\t  archive_cmds_CXX='$CC -o $output_objdir/$soname $libobjs $compiler_flags $deplibs -Wl,-DLL,-IMPLIB:\"$tool_output_objdir$libname.dll.lib\"~linknames='\n\t  archive_expsym_cmds_CXX='if   test DEF = \"`$SED -n     -e '\\''s/^[\t ]*//'\\''     -e '\\''/^\\(;.*\\)*$/d'\\''     -e '\\''s/^\\(EXPORTS\\|LIBRARY\\)\\([\t ].*\\)*$/DEF/p'\\''     -e q     $export_symbols`\" ; then\n              cp \"$export_symbols\" \"$output_objdir/$soname.def\";\n              echo \"$tool_output_objdir$soname.def\" > \"$output_objdir/$soname.exp\";\n            else\n              $SED -e '\\''s/^/-link -EXPORT:/'\\'' < $export_symbols > $output_objdir/$soname.exp;\n            fi~\n            $CC -o $tool_output_objdir$soname $libobjs $compiler_flags $deplibs \"@$tool_output_objdir$soname.exp\" -Wl,-DLL,-IMPLIB:\"$tool_output_objdir$libname.dll.lib\"~\n            linknames='\n\t  # The linker will not automatically build a static lib if we build a DLL.\n\t  # _LT_TAGVAR(old_archive_from_new_cmds, CXX)='true'\n\t  enable_shared_with_static_runtimes_CXX=yes\n\t  # Don't use ranlib\n\t  old_postinstall_cmds_CXX='chmod 644 $oldlib'\n\t  postlink_cmds_CXX='lt_outputfile=\"@OUTPUT@\"~\n            lt_tool_outputfile=\"@TOOL_OUTPUT@\"~\n            case $lt_outputfile in\n              *.exe|*.EXE) ;;\n              *)\n                lt_outputfile=$lt_outputfile.exe\n                lt_tool_outputfile=$lt_tool_outputfile.exe\n                ;;\n            esac~\n            func_to_tool_file \"$lt_outputfile\"~\n            if test : != \"$MANIFEST_TOOL\" && test -f \"$lt_outputfile.manifest\"; then\n              $MANIFEST_TOOL -manifest \"$lt_tool_outputfile.manifest\" -outputresource:\"$lt_tool_outputfile\" || exit 1;\n              $RM \"$lt_outputfile.manifest\";\n            fi'\n\t  ;;\n\t*)\n\t  # g++\n\t  # _LT_TAGVAR(hardcode_libdir_flag_spec, CXX) is actually meaningless,\n\t  # as there is no search path for DLLs.\n\t  hardcode_libdir_flag_spec_CXX='-L$libdir'\n\t  export_dynamic_flag_spec_CXX='$wl--export-all-symbols'\n\t  allow_undefined_flag_CXX=unsupported\n\t  always_export_symbols_CXX=no\n\t  enable_shared_with_static_runtimes_CXX=yes\n\n\t  if $LD --help 2>&1 | $GREP 'auto-import' > /dev/null; then\n\t    archive_cmds_CXX='$CC -shared -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -o $output_objdir/$soname $wl--enable-auto-image-base -Xlinker --out-implib -Xlinker $lib'\n\t    # If the export-symbols file already is a .def file, use it as\n\t    # is; otherwise, prepend EXPORTS...\n\t    archive_expsym_cmds_CXX='if   test DEF = \"`$SED -n     -e '\\''s/^[\t ]*//'\\''     -e '\\''/^\\(;.*\\)*$/d'\\''     -e '\\''s/^\\(EXPORTS\\|LIBRARY\\)\\([\t ].*\\)*$/DEF/p'\\''     -e q     $export_symbols`\" ; then\n              cp $export_symbols $output_objdir/$soname.def;\n            else\n              echo EXPORTS > $output_objdir/$soname.def;\n              cat $export_symbols >> $output_objdir/$soname.def;\n            fi~\n            $CC -shared -nostdlib $output_objdir/$soname.def $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -o $output_objdir/$soname $wl--enable-auto-image-base -Xlinker --out-implib -Xlinker $lib'\n\t  else\n\t    ld_shlibs_CXX=no\n\t  fi\n\t  ;;\n\tesac\n\t;;\n      darwin* | rhapsody*)\n\n\n  archive_cmds_need_lc_CXX=no\n  hardcode_direct_CXX=no\n  hardcode_automatic_CXX=yes\n  hardcode_shlibpath_var_CXX=unsupported\n  if test yes = \"$lt_cv_ld_force_load\"; then\n    whole_archive_flag_spec_CXX='`for conv in $convenience\\\"\\\"; do test  -n \\\"$conv\\\" && new_convenience=\\\"$new_convenience $wl-force_load,$conv\\\"; done; func_echo_all \\\"$new_convenience\\\"`'\n\n  else\n    whole_archive_flag_spec_CXX=''\n  fi\n  link_all_deplibs_CXX=yes\n  allow_undefined_flag_CXX=$_lt_dar_allow_undefined\n  case $cc_basename in\n     ifort*|nagfor*) _lt_dar_can_shared=yes ;;\n     *) _lt_dar_can_shared=$GCC ;;\n  esac\n  if test yes = \"$_lt_dar_can_shared\"; then\n    output_verbose_link_cmd=func_echo_all\n    archive_cmds_CXX=\"\\$CC -dynamiclib \\$allow_undefined_flag -o \\$lib \\$libobjs \\$deplibs \\$compiler_flags -install_name \\$rpath/\\$soname \\$verstring $_lt_dar_single_mod$_lt_dsymutil\"\n    module_cmds_CXX=\"\\$CC \\$allow_undefined_flag -o \\$lib -bundle \\$libobjs \\$deplibs \\$compiler_flags$_lt_dsymutil\"\n    archive_expsym_cmds_CXX=\"sed 's|^|_|' < \\$export_symbols > \\$output_objdir/\\$libname-symbols.expsym~\\$CC -dynamiclib \\$allow_undefined_flag -o \\$lib \\$libobjs \\$deplibs \\$compiler_flags -install_name \\$rpath/\\$soname \\$verstring $_lt_dar_single_mod$_lt_dar_export_syms$_lt_dsymutil\"\n    module_expsym_cmds_CXX=\"sed -e 's|^|_|' < \\$export_symbols > \\$output_objdir/\\$libname-symbols.expsym~\\$CC \\$allow_undefined_flag -o \\$lib -bundle \\$libobjs \\$deplibs \\$compiler_flags$_lt_dar_export_syms$_lt_dsymutil\"\n       if test yes != \"$lt_cv_apple_cc_single_mod\"; then\n      archive_cmds_CXX=\"\\$CC -r -keep_private_externs -nostdlib -o \\$lib-master.o \\$libobjs~\\$CC -dynamiclib \\$allow_undefined_flag -o \\$lib \\$lib-master.o \\$deplibs \\$compiler_flags -install_name \\$rpath/\\$soname \\$verstring$_lt_dsymutil\"\n      archive_expsym_cmds_CXX=\"sed 's|^|_|' < \\$export_symbols > \\$output_objdir/\\$libname-symbols.expsym~\\$CC -r -keep_private_externs -nostdlib -o \\$lib-master.o \\$libobjs~\\$CC -dynamiclib \\$allow_undefined_flag -o \\$lib \\$lib-master.o \\$deplibs \\$compiler_flags -install_name \\$rpath/\\$soname \\$verstring$_lt_dar_export_syms$_lt_dsymutil\"\n    fi\n\n  else\n  ld_shlibs_CXX=no\n  fi\n\n\t;;\n\n      os2*)\n\thardcode_libdir_flag_spec_CXX='-L$libdir'\n\thardcode_minus_L_CXX=yes\n\tallow_undefined_flag_CXX=unsupported\n\tshrext_cmds=.dll\n\tarchive_cmds_CXX='$ECHO \"LIBRARY ${soname%$shared_ext} INITINSTANCE TERMINSTANCE\" > $output_objdir/$libname.def~\n\t  $ECHO \"DESCRIPTION \\\"$libname\\\"\" >> $output_objdir/$libname.def~\n\t  $ECHO \"DATA MULTIPLE NONSHARED\" >> $output_objdir/$libname.def~\n\t  $ECHO EXPORTS >> $output_objdir/$libname.def~\n\t  emxexp $libobjs | $SED /\"_DLL_InitTerm\"/d >> $output_objdir/$libname.def~\n\t  $CC -Zdll -Zcrtdll -o $output_objdir/$soname $libobjs $deplibs $compiler_flags $output_objdir/$libname.def~\n\t  emximp -o $lib $output_objdir/$libname.def'\n\tarchive_expsym_cmds_CXX='$ECHO \"LIBRARY ${soname%$shared_ext} INITINSTANCE TERMINSTANCE\" > $output_objdir/$libname.def~\n\t  $ECHO \"DESCRIPTION \\\"$libname\\\"\" >> $output_objdir/$libname.def~\n\t  $ECHO \"DATA MULTIPLE NONSHARED\" >> $output_objdir/$libname.def~\n\t  $ECHO EXPORTS >> $output_objdir/$libname.def~\n\t  prefix_cmds=\"$SED\"~\n\t  if test EXPORTS = \"`$SED 1q $export_symbols`\"; then\n\t    prefix_cmds=\"$prefix_cmds -e 1d\";\n\t  fi~\n\t  prefix_cmds=\"$prefix_cmds -e \\\"s/^\\(.*\\)$/_\\1/g\\\"\"~\n\t  cat $export_symbols | $prefix_cmds >> $output_objdir/$libname.def~\n\t  $CC -Zdll -Zcrtdll -o $output_objdir/$soname $libobjs $deplibs $compiler_flags $output_objdir/$libname.def~\n\t  emximp -o $lib $output_objdir/$libname.def'\n\told_archive_From_new_cmds_CXX='emximp -o $output_objdir/${libname}_dll.a $output_objdir/$libname.def'\n\tenable_shared_with_static_runtimes_CXX=yes\n\t;;\n\n      dgux*)\n        case $cc_basename in\n          ec++*)\n\t    # FIXME: insert proper C++ library support\n\t    ld_shlibs_CXX=no\n\t    ;;\n          ghcx*)\n\t    # Green Hills C++ Compiler\n\t    # FIXME: insert proper C++ library support\n\t    ld_shlibs_CXX=no\n\t    ;;\n          *)\n\t    # FIXME: insert proper C++ library support\n\t    ld_shlibs_CXX=no\n\t    ;;\n        esac\n        ;;\n\n      freebsd2.*)\n        # C++ shared libraries reported to be fairly broken before\n\t# switch to ELF\n        ld_shlibs_CXX=no\n        ;;\n\n      freebsd-elf*)\n        archive_cmds_need_lc_CXX=no\n        ;;\n\n      freebsd* | dragonfly*)\n        # FreeBSD 3 and later use GNU C++ and GNU ld with standard ELF\n        # conventions\n        ld_shlibs_CXX=yes\n        ;;\n\n      haiku*)\n        archive_cmds_CXX='$CC -shared $libobjs $deplibs $compiler_flags $wl-soname $wl$soname -o $lib'\n        link_all_deplibs_CXX=yes\n        ;;\n\n      hpux9*)\n        hardcode_libdir_flag_spec_CXX='$wl+b $wl$libdir'\n        hardcode_libdir_separator_CXX=:\n        export_dynamic_flag_spec_CXX='$wl-E'\n        hardcode_direct_CXX=yes\n        hardcode_minus_L_CXX=yes # Not in the search PATH,\n\t\t\t\t             # but as the default\n\t\t\t\t             # location of the library.\n\n        case $cc_basename in\n          CC*)\n            # FIXME: insert proper C++ library support\n            ld_shlibs_CXX=no\n            ;;\n          aCC*)\n            archive_cmds_CXX='$RM $output_objdir/$soname~$CC -b $wl+b $wl$install_libdir -o $output_objdir/$soname $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags~test \"x$output_objdir/$soname\" = \"x$lib\" || mv $output_objdir/$soname $lib'\n            # Commands to make compiler produce verbose output that lists\n            # what \"hidden\" libraries, object files and flags are used when\n            # linking a shared library.\n            #\n            # There doesn't appear to be a way to prevent this compiler from\n            # explicitly linking system object files so we need to strip them\n            # from the output so that they don't get included in the library\n            # dependencies.\n            output_verbose_link_cmd='templist=`($CC -b $CFLAGS -v conftest.$objext 2>&1) | $EGREP \"\\-L\"`; list= ; for z in $templist; do case $z in conftest.$objext) list=\"$list $z\";; *.$objext);; *) list=\"$list $z\";;esac; done; func_echo_all \"$list\"'\n            ;;\n          *)\n            if test yes = \"$GXX\"; then\n              archive_cmds_CXX='$RM $output_objdir/$soname~$CC -shared -nostdlib $pic_flag $wl+b $wl$install_libdir -o $output_objdir/$soname $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags~test \"x$output_objdir/$soname\" = \"x$lib\" || mv $output_objdir/$soname $lib'\n            else\n              # FIXME: insert proper C++ library support\n              ld_shlibs_CXX=no\n            fi\n            ;;\n        esac\n        ;;\n\n      hpux10*|hpux11*)\n        if test no = \"$with_gnu_ld\"; then\n\t  hardcode_libdir_flag_spec_CXX='$wl+b $wl$libdir'\n\t  hardcode_libdir_separator_CXX=:\n\n          case $host_cpu in\n            hppa*64*|ia64*)\n              ;;\n            *)\n\t      export_dynamic_flag_spec_CXX='$wl-E'\n              ;;\n          esac\n        fi\n        case $host_cpu in\n          hppa*64*|ia64*)\n            hardcode_direct_CXX=no\n            hardcode_shlibpath_var_CXX=no\n            ;;\n          *)\n            hardcode_direct_CXX=yes\n            hardcode_direct_absolute_CXX=yes\n            hardcode_minus_L_CXX=yes # Not in the search PATH,\n\t\t\t\t\t         # but as the default\n\t\t\t\t\t         # location of the library.\n            ;;\n        esac\n\n        case $cc_basename in\n          CC*)\n\t    # FIXME: insert proper C++ library support\n\t    ld_shlibs_CXX=no\n\t    ;;\n          aCC*)\n\t    case $host_cpu in\n\t      hppa*64*)\n\t        archive_cmds_CXX='$CC -b $wl+h $wl$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags'\n\t        ;;\n\t      ia64*)\n\t        archive_cmds_CXX='$CC -b $wl+h $wl$soname $wl+nodefaultrpath -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags'\n\t        ;;\n\t      *)\n\t        archive_cmds_CXX='$CC -b $wl+h $wl$soname $wl+b $wl$install_libdir -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags'\n\t        ;;\n\t    esac\n\t    # Commands to make compiler produce verbose output that lists\n\t    # what \"hidden\" libraries, object files and flags are used when\n\t    # linking a shared library.\n\t    #\n\t    # There doesn't appear to be a way to prevent this compiler from\n\t    # explicitly linking system object files so we need to strip them\n\t    # from the output so that they don't get included in the library\n\t    # dependencies.\n\t    output_verbose_link_cmd='templist=`($CC -b $CFLAGS -v conftest.$objext 2>&1) | $GREP \"\\-L\"`; list= ; for z in $templist; do case $z in conftest.$objext) list=\"$list $z\";; *.$objext);; *) list=\"$list $z\";;esac; done; func_echo_all \"$list\"'\n\t    ;;\n          *)\n\t    if test yes = \"$GXX\"; then\n\t      if test no = \"$with_gnu_ld\"; then\n\t        case $host_cpu in\n\t          hppa*64*)\n\t            archive_cmds_CXX='$CC -shared -nostdlib -fPIC $wl+h $wl$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags'\n\t            ;;\n\t          ia64*)\n\t            archive_cmds_CXX='$CC -shared -nostdlib $pic_flag $wl+h $wl$soname $wl+nodefaultrpath -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags'\n\t            ;;\n\t          *)\n\t            archive_cmds_CXX='$CC -shared -nostdlib $pic_flag $wl+h $wl$soname $wl+b $wl$install_libdir -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags'\n\t            ;;\n\t        esac\n\t      fi\n\t    else\n\t      # FIXME: insert proper C++ library support\n\t      ld_shlibs_CXX=no\n\t    fi\n\t    ;;\n        esac\n        ;;\n\n      interix[3-9]*)\n\thardcode_direct_CXX=no\n\thardcode_shlibpath_var_CXX=no\n\thardcode_libdir_flag_spec_CXX='$wl-rpath,$libdir'\n\texport_dynamic_flag_spec_CXX='$wl-E'\n\t# Hack: On Interix 3.x, we cannot compile PIC because of a broken gcc.\n\t# Instead, shared libraries are loaded at an image base (0x10000000 by\n\t# default) and relocated if they conflict, which is a slow very memory\n\t# consuming and fragmenting process.  To avoid this, we pick a random,\n\t# 256 KiB-aligned image base between 0x50000000 and 0x6FFC0000 at link\n\t# time.  Moving up from 0x10000000 also allows more sbrk(2) space.\n\tarchive_cmds_CXX='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags $wl-h,$soname $wl--image-base,`expr ${RANDOM-$$} % 4096 / 2 \\* 262144 + 1342177280` -o $lib'\n\tarchive_expsym_cmds_CXX='sed \"s|^|_|\" $export_symbols >$output_objdir/$soname.expsym~$CC -shared $pic_flag $libobjs $deplibs $compiler_flags $wl-h,$soname $wl--retain-symbols-file,$output_objdir/$soname.expsym $wl--image-base,`expr ${RANDOM-$$} % 4096 / 2 \\* 262144 + 1342177280` -o $lib'\n\t;;\n      irix5* | irix6*)\n        case $cc_basename in\n          CC*)\n\t    # SGI C++\n\t    archive_cmds_CXX='$CC -shared -all -multigot $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -soname $soname `test -n \"$verstring\" && func_echo_all \"-set_version $verstring\"` -update_registry $output_objdir/so_locations -o $lib'\n\n\t    # Archives containing C++ object files must be created using\n\t    # \"CC -ar\", where \"CC\" is the IRIX C++ compiler.  This is\n\t    # necessary to make sure instantiated templates are included\n\t    # in the archive.\n\t    old_archive_cmds_CXX='$CC -ar -WR,-u -o $oldlib $oldobjs'\n\t    ;;\n          *)\n\t    if test yes = \"$GXX\"; then\n\t      if test no = \"$with_gnu_ld\"; then\n\t        archive_cmds_CXX='$CC -shared $pic_flag -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags $wl-soname $wl$soname `test -n \"$verstring\" && func_echo_all \"$wl-set_version $wl$verstring\"` $wl-update_registry $wl$output_objdir/so_locations -o $lib'\n\t      else\n\t        archive_cmds_CXX='$CC -shared $pic_flag -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags $wl-soname $wl$soname `test -n \"$verstring\" && func_echo_all \"$wl-set_version $wl$verstring\"` -o $lib'\n\t      fi\n\t    fi\n\t    link_all_deplibs_CXX=yes\n\t    ;;\n        esac\n        hardcode_libdir_flag_spec_CXX='$wl-rpath $wl$libdir'\n        hardcode_libdir_separator_CXX=:\n        inherit_rpath_CXX=yes\n        ;;\n\n      linux* | k*bsd*-gnu | kopensolaris*-gnu | gnu*)\n        case $cc_basename in\n          KCC*)\n\t    # Kuck and Associates, Inc. (KAI) C++ Compiler\n\n\t    # KCC will only create a shared library if the output file\n\t    # ends with \".so\" (or \".sl\" for HP-UX), so rename the library\n\t    # to its proper name (with version) after linking.\n\t    archive_cmds_CXX='tempext=`echo $shared_ext | $SED -e '\\''s/\\([^()0-9A-Za-z{}]\\)/\\\\\\\\\\1/g'\\''`; templib=`echo $lib | $SED -e \"s/\\$tempext\\..*/.so/\"`; $CC $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags --soname $soname -o \\$templib; mv \\$templib $lib'\n\t    archive_expsym_cmds_CXX='tempext=`echo $shared_ext | $SED -e '\\''s/\\([^()0-9A-Za-z{}]\\)/\\\\\\\\\\1/g'\\''`; templib=`echo $lib | $SED -e \"s/\\$tempext\\..*/.so/\"`; $CC $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags --soname $soname -o \\$templib $wl-retain-symbols-file,$export_symbols; mv \\$templib $lib'\n\t    # Commands to make compiler produce verbose output that lists\n\t    # what \"hidden\" libraries, object files and flags are used when\n\t    # linking a shared library.\n\t    #\n\t    # There doesn't appear to be a way to prevent this compiler from\n\t    # explicitly linking system object files so we need to strip them\n\t    # from the output so that they don't get included in the library\n\t    # dependencies.\n\t    output_verbose_link_cmd='templist=`$CC $CFLAGS -v conftest.$objext -o libconftest$shared_ext 2>&1 | $GREP \"ld\"`; rm -f libconftest$shared_ext; list= ; for z in $templist; do case $z in conftest.$objext) list=\"$list $z\";; *.$objext);; *) list=\"$list $z\";;esac; done; func_echo_all \"$list\"'\n\n\t    hardcode_libdir_flag_spec_CXX='$wl-rpath,$libdir'\n\t    export_dynamic_flag_spec_CXX='$wl--export-dynamic'\n\n\t    # Archives containing C++ object files must be created using\n\t    # \"CC -Bstatic\", where \"CC\" is the KAI C++ compiler.\n\t    old_archive_cmds_CXX='$CC -Bstatic -o $oldlib $oldobjs'\n\t    ;;\n\t  icpc* | ecpc* )\n\t    # Intel C++\n\t    with_gnu_ld=yes\n\t    # version 8.0 and above of icpc choke on multiply defined symbols\n\t    # if we add $predep_objects and $postdep_objects, however 7.1 and\n\t    # earlier do not add the objects themselves.\n\t    case `$CC -V 2>&1` in\n\t      *\"Version 7.\"*)\n\t        archive_cmds_CXX='$CC -shared $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags $wl-soname $wl$soname -o $lib'\n\t\tarchive_expsym_cmds_CXX='$CC -shared $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags $wl-soname $wl$soname $wl-retain-symbols-file $wl$export_symbols -o $lib'\n\t\t;;\n\t      *)  # Version 8.0 or newer\n\t        tmp_idyn=\n\t        case $host_cpu in\n\t\t  ia64*) tmp_idyn=' -i_dynamic';;\n\t\tesac\n\t        archive_cmds_CXX='$CC -shared'\"$tmp_idyn\"' $libobjs $deplibs $compiler_flags $wl-soname $wl$soname -o $lib'\n\t\tarchive_expsym_cmds_CXX='$CC -shared'\"$tmp_idyn\"' $libobjs $deplibs $compiler_flags $wl-soname $wl$soname $wl-retain-symbols-file $wl$export_symbols -o $lib'\n\t\t;;\n\t    esac\n\t    archive_cmds_need_lc_CXX=no\n\t    hardcode_libdir_flag_spec_CXX='$wl-rpath,$libdir'\n\t    export_dynamic_flag_spec_CXX='$wl--export-dynamic'\n\t    whole_archive_flag_spec_CXX='$wl--whole-archive$convenience $wl--no-whole-archive'\n\t    ;;\n          pgCC* | pgcpp*)\n            # Portland Group C++ compiler\n\t    case `$CC -V` in\n\t    *pgCC\\ [1-5].* | *pgcpp\\ [1-5].*)\n\t      prelink_cmds_CXX='tpldir=Template.dir~\n               rm -rf $tpldir~\n               $CC --prelink_objects --instantiation_dir $tpldir $objs $libobjs $compile_deplibs~\n               compile_command=\"$compile_command `find $tpldir -name \\*.o | sort | $NL2SP`\"'\n\t      old_archive_cmds_CXX='tpldir=Template.dir~\n                rm -rf $tpldir~\n                $CC --prelink_objects --instantiation_dir $tpldir $oldobjs$old_deplibs~\n                $AR $AR_FLAGS $oldlib$oldobjs$old_deplibs `find $tpldir -name \\*.o | sort | $NL2SP`~\n                $RANLIB $oldlib'\n\t      archive_cmds_CXX='tpldir=Template.dir~\n                rm -rf $tpldir~\n                $CC --prelink_objects --instantiation_dir $tpldir $predep_objects $libobjs $deplibs $convenience $postdep_objects~\n                $CC -shared $pic_flag $predep_objects $libobjs $deplibs `find $tpldir -name \\*.o | sort | $NL2SP` $postdep_objects $compiler_flags $wl-soname $wl$soname -o $lib'\n\t      archive_expsym_cmds_CXX='tpldir=Template.dir~\n                rm -rf $tpldir~\n                $CC --prelink_objects --instantiation_dir $tpldir $predep_objects $libobjs $deplibs $convenience $postdep_objects~\n                $CC -shared $pic_flag $predep_objects $libobjs $deplibs `find $tpldir -name \\*.o | sort | $NL2SP` $postdep_objects $compiler_flags $wl-soname $wl$soname $wl-retain-symbols-file $wl$export_symbols -o $lib'\n\t      ;;\n\t    *) # Version 6 and above use weak symbols\n\t      archive_cmds_CXX='$CC -shared $pic_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags $wl-soname $wl$soname -o $lib'\n\t      archive_expsym_cmds_CXX='$CC -shared $pic_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags $wl-soname $wl$soname $wl-retain-symbols-file $wl$export_symbols -o $lib'\n\t      ;;\n\t    esac\n\n\t    hardcode_libdir_flag_spec_CXX='$wl--rpath $wl$libdir'\n\t    export_dynamic_flag_spec_CXX='$wl--export-dynamic'\n\t    whole_archive_flag_spec_CXX='$wl--whole-archive`for conv in $convenience\\\"\\\"; do test  -n \\\"$conv\\\" && new_convenience=\\\"$new_convenience,$conv\\\"; done; func_echo_all \\\"$new_convenience\\\"` $wl--no-whole-archive'\n            ;;\n\t  cxx*)\n\t    # Compaq C++\n\t    archive_cmds_CXX='$CC -shared $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags $wl-soname $wl$soname -o $lib'\n\t    archive_expsym_cmds_CXX='$CC -shared $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags $wl-soname $wl$soname  -o $lib $wl-retain-symbols-file $wl$export_symbols'\n\n\t    runpath_var=LD_RUN_PATH\n\t    hardcode_libdir_flag_spec_CXX='-rpath $libdir'\n\t    hardcode_libdir_separator_CXX=:\n\n\t    # Commands to make compiler produce verbose output that lists\n\t    # what \"hidden\" libraries, object files and flags are used when\n\t    # linking a shared library.\n\t    #\n\t    # There doesn't appear to be a way to prevent this compiler from\n\t    # explicitly linking system object files so we need to strip them\n\t    # from the output so that they don't get included in the library\n\t    # dependencies.\n\t    output_verbose_link_cmd='templist=`$CC -shared $CFLAGS -v conftest.$objext 2>&1 | $GREP \"ld\"`; templist=`func_echo_all \"$templist\" | $SED \"s/\\(^.*ld.*\\)\\( .*ld .*$\\)/\\1/\"`; list= ; for z in $templist; do case $z in conftest.$objext) list=\"$list $z\";; *.$objext);; *) list=\"$list $z\";;esac; done; func_echo_all \"X$list\" | $Xsed'\n\t    ;;\n\t  xl* | mpixl* | bgxl*)\n\t    # IBM XL 8.0 on PPC, with GNU ld\n\t    hardcode_libdir_flag_spec_CXX='$wl-rpath $wl$libdir'\n\t    export_dynamic_flag_spec_CXX='$wl--export-dynamic'\n\t    archive_cmds_CXX='$CC -qmkshrobj $libobjs $deplibs $compiler_flags $wl-soname $wl$soname -o $lib'\n\t    if test yes = \"$supports_anon_versioning\"; then\n\t      archive_expsym_cmds_CXX='echo \"{ global:\" > $output_objdir/$libname.ver~\n                cat $export_symbols | sed -e \"s/\\(.*\\)/\\1;/\" >> $output_objdir/$libname.ver~\n                echo \"local: *; };\" >> $output_objdir/$libname.ver~\n                $CC -qmkshrobj $libobjs $deplibs $compiler_flags $wl-soname $wl$soname $wl-version-script $wl$output_objdir/$libname.ver -o $lib'\n\t    fi\n\t    ;;\n\t  *)\n\t    case `$CC -V 2>&1 | sed 5q` in\n\t    *Sun\\ C*)\n\t      # Sun C++ 5.9\n\t      no_undefined_flag_CXX=' -zdefs'\n\t      archive_cmds_CXX='$CC -G$allow_undefined_flag -h$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags'\n\t      archive_expsym_cmds_CXX='$CC -G$allow_undefined_flag -h$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags $wl-retain-symbols-file $wl$export_symbols'\n\t      hardcode_libdir_flag_spec_CXX='-R$libdir'\n\t      whole_archive_flag_spec_CXX='$wl--whole-archive`new_convenience=; for conv in $convenience\\\"\\\"; do test -z \\\"$conv\\\" || new_convenience=\\\"$new_convenience,$conv\\\"; done; func_echo_all \\\"$new_convenience\\\"` $wl--no-whole-archive'\n\t      compiler_needs_object_CXX=yes\n\n\t      # Not sure whether something based on\n\t      # $CC $CFLAGS -v conftest.$objext -o libconftest$shared_ext 2>&1\n\t      # would be better.\n\t      output_verbose_link_cmd='func_echo_all'\n\n\t      # Archives containing C++ object files must be created using\n\t      # \"CC -xar\", where \"CC\" is the Sun C++ compiler.  This is\n\t      # necessary to make sure instantiated templates are included\n\t      # in the archive.\n\t      old_archive_cmds_CXX='$CC -xar -o $oldlib $oldobjs'\n\t      ;;\n\t    esac\n\t    ;;\n\tesac\n\t;;\n\n      lynxos*)\n        # FIXME: insert proper C++ library support\n\tld_shlibs_CXX=no\n\t;;\n\n      m88k*)\n        # FIXME: insert proper C++ library support\n        ld_shlibs_CXX=no\n\t;;\n\n      mvs*)\n        case $cc_basename in\n          cxx*)\n\t    # FIXME: insert proper C++ library support\n\t    ld_shlibs_CXX=no\n\t    ;;\n\t  *)\n\t    # FIXME: insert proper C++ library support\n\t    ld_shlibs_CXX=no\n\t    ;;\n\tesac\n\t;;\n\n      netbsd*)\n        if echo __ELF__ | $CC -E - | $GREP __ELF__ >/dev/null; then\n\t  archive_cmds_CXX='$LD -Bshareable  -o $lib $predep_objects $libobjs $deplibs $postdep_objects $linker_flags'\n\t  wlarc=\n\t  hardcode_libdir_flag_spec_CXX='-R$libdir'\n\t  hardcode_direct_CXX=yes\n\t  hardcode_shlibpath_var_CXX=no\n\tfi\n\t# Workaround some broken pre-1.5 toolchains\n\toutput_verbose_link_cmd='$CC -shared $CFLAGS -v conftest.$objext 2>&1 | $GREP conftest.$objext | $SED -e \"s:-lgcc -lc -lgcc::\"'\n\t;;\n\n      *nto* | *qnx*)\n        ld_shlibs_CXX=yes\n\t;;\n\n      openbsd* | bitrig*)\n\tif test -f /usr/libexec/ld.so; then\n\t  hardcode_direct_CXX=yes\n\t  hardcode_shlibpath_var_CXX=no\n\t  hardcode_direct_absolute_CXX=yes\n\t  archive_cmds_CXX='$CC -shared $pic_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -o $lib'\n\t  hardcode_libdir_flag_spec_CXX='$wl-rpath,$libdir'\n\t  if test -z \"`echo __ELF__ | $CC -E - | grep __ELF__`\"; then\n\t    archive_expsym_cmds_CXX='$CC -shared $pic_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags $wl-retain-symbols-file,$export_symbols -o $lib'\n\t    export_dynamic_flag_spec_CXX='$wl-E'\n\t    whole_archive_flag_spec_CXX=$wlarc'--whole-archive$convenience '$wlarc'--no-whole-archive'\n\t  fi\n\t  output_verbose_link_cmd=func_echo_all\n\telse\n\t  ld_shlibs_CXX=no\n\tfi\n\t;;\n\n      osf3* | osf4* | osf5*)\n        case $cc_basename in\n          KCC*)\n\t    # Kuck and Associates, Inc. (KAI) C++ Compiler\n\n\t    # KCC will only create a shared library if the output file\n\t    # ends with \".so\" (or \".sl\" for HP-UX), so rename the library\n\t    # to its proper name (with version) after linking.\n\t    archive_cmds_CXX='tempext=`echo $shared_ext | $SED -e '\\''s/\\([^()0-9A-Za-z{}]\\)/\\\\\\\\\\1/g'\\''`; templib=`echo \"$lib\" | $SED -e \"s/\\$tempext\\..*/.so/\"`; $CC $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags --soname $soname -o \\$templib; mv \\$templib $lib'\n\n\t    hardcode_libdir_flag_spec_CXX='$wl-rpath,$libdir'\n\t    hardcode_libdir_separator_CXX=:\n\n\t    # Archives containing C++ object files must be created using\n\t    # the KAI C++ compiler.\n\t    case $host in\n\t      osf3*) old_archive_cmds_CXX='$CC -Bstatic -o $oldlib $oldobjs' ;;\n\t      *) old_archive_cmds_CXX='$CC -o $oldlib $oldobjs' ;;\n\t    esac\n\t    ;;\n          RCC*)\n\t    # Rational C++ 2.4.1\n\t    # FIXME: insert proper C++ library support\n\t    ld_shlibs_CXX=no\n\t    ;;\n          cxx*)\n\t    case $host in\n\t      osf3*)\n\t        allow_undefined_flag_CXX=' $wl-expect_unresolved $wl\\*'\n\t        archive_cmds_CXX='$CC -shared$allow_undefined_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags $wl-soname $soname `test -n \"$verstring\" && func_echo_all \"$wl-set_version $verstring\"` -update_registry $output_objdir/so_locations -o $lib'\n\t        hardcode_libdir_flag_spec_CXX='$wl-rpath $wl$libdir'\n\t\t;;\n\t      *)\n\t        allow_undefined_flag_CXX=' -expect_unresolved \\*'\n\t        archive_cmds_CXX='$CC -shared$allow_undefined_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -msym -soname $soname `test -n \"$verstring\" && func_echo_all \"-set_version $verstring\"` -update_registry $output_objdir/so_locations -o $lib'\n\t        archive_expsym_cmds_CXX='for i in `cat $export_symbols`; do printf \"%s %s\\\\n\" -exported_symbol \"\\$i\" >> $lib.exp; done~\n                  echo \"-hidden\">> $lib.exp~\n                  $CC -shared$allow_undefined_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -msym -soname $soname $wl-input $wl$lib.exp  `test -n \"$verstring\" && $ECHO \"-set_version $verstring\"` -update_registry $output_objdir/so_locations -o $lib~\n                  $RM $lib.exp'\n\t        hardcode_libdir_flag_spec_CXX='-rpath $libdir'\n\t\t;;\n\t    esac\n\n\t    hardcode_libdir_separator_CXX=:\n\n\t    # Commands to make compiler produce verbose output that lists\n\t    # what \"hidden\" libraries, object files and flags are used when\n\t    # linking a shared library.\n\t    #\n\t    # There doesn't appear to be a way to prevent this compiler from\n\t    # explicitly linking system object files so we need to strip them\n\t    # from the output so that they don't get included in the library\n\t    # dependencies.\n\t    output_verbose_link_cmd='templist=`$CC -shared $CFLAGS -v conftest.$objext 2>&1 | $GREP \"ld\" | $GREP -v \"ld:\"`; templist=`func_echo_all \"$templist\" | $SED \"s/\\(^.*ld.*\\)\\( .*ld.*$\\)/\\1/\"`; list= ; for z in $templist; do case $z in conftest.$objext) list=\"$list $z\";; *.$objext);; *) list=\"$list $z\";;esac; done; func_echo_all \"$list\"'\n\t    ;;\n\t  *)\n\t    if test yes,no = \"$GXX,$with_gnu_ld\"; then\n\t      allow_undefined_flag_CXX=' $wl-expect_unresolved $wl\\*'\n\t      case $host in\n\t        osf3*)\n\t          archive_cmds_CXX='$CC -shared -nostdlib $allow_undefined_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags $wl-soname $wl$soname `test -n \"$verstring\" && func_echo_all \"$wl-set_version $wl$verstring\"` $wl-update_registry $wl$output_objdir/so_locations -o $lib'\n\t\t  ;;\n\t        *)\n\t          archive_cmds_CXX='$CC -shared $pic_flag -nostdlib $allow_undefined_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags $wl-msym $wl-soname $wl$soname `test -n \"$verstring\" && func_echo_all \"$wl-set_version $wl$verstring\"` $wl-update_registry $wl$output_objdir/so_locations -o $lib'\n\t\t  ;;\n\t      esac\n\n\t      hardcode_libdir_flag_spec_CXX='$wl-rpath $wl$libdir'\n\t      hardcode_libdir_separator_CXX=:\n\n\t      # Commands to make compiler produce verbose output that lists\n\t      # what \"hidden\" libraries, object files and flags are used when\n\t      # linking a shared library.\n\t      output_verbose_link_cmd='$CC -shared $CFLAGS -v conftest.$objext 2>&1 | $GREP -v \"^Configured with:\" | $GREP \"\\-L\"'\n\n\t    else\n\t      # FIXME: insert proper C++ library support\n\t      ld_shlibs_CXX=no\n\t    fi\n\t    ;;\n        esac\n        ;;\n\n      psos*)\n        # FIXME: insert proper C++ library support\n        ld_shlibs_CXX=no\n        ;;\n\n      sunos4*)\n        case $cc_basename in\n          CC*)\n\t    # Sun C++ 4.x\n\t    # FIXME: insert proper C++ library support\n\t    ld_shlibs_CXX=no\n\t    ;;\n          lcc*)\n\t    # Lucid\n\t    # FIXME: insert proper C++ library support\n\t    ld_shlibs_CXX=no\n\t    ;;\n          *)\n\t    # FIXME: insert proper C++ library support\n\t    ld_shlibs_CXX=no\n\t    ;;\n        esac\n        ;;\n\n      solaris*)\n        case $cc_basename in\n          CC* | sunCC*)\n\t    # Sun C++ 4.2, 5.x and Centerline C++\n            archive_cmds_need_lc_CXX=yes\n\t    no_undefined_flag_CXX=' -zdefs'\n\t    archive_cmds_CXX='$CC -G$allow_undefined_flag -h$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags'\n\t    archive_expsym_cmds_CXX='echo \"{ global:\" > $lib.exp~cat $export_symbols | $SED -e \"s/\\(.*\\)/\\1;/\" >> $lib.exp~echo \"local: *; };\" >> $lib.exp~\n              $CC -G$allow_undefined_flag $wl-M $wl$lib.exp -h$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags~$RM $lib.exp'\n\n\t    hardcode_libdir_flag_spec_CXX='-R$libdir'\n\t    hardcode_shlibpath_var_CXX=no\n\t    case $host_os in\n\t      solaris2.[0-5] | solaris2.[0-5].*) ;;\n\t      *)\n\t\t# The compiler driver will combine and reorder linker options,\n\t\t# but understands '-z linker_flag'.\n\t        # Supported since Solaris 2.6 (maybe 2.5.1?)\n\t\twhole_archive_flag_spec_CXX='-z allextract$convenience -z defaultextract'\n\t        ;;\n\t    esac\n\t    link_all_deplibs_CXX=yes\n\n\t    output_verbose_link_cmd='func_echo_all'\n\n\t    # Archives containing C++ object files must be created using\n\t    # \"CC -xar\", where \"CC\" is the Sun C++ compiler.  This is\n\t    # necessary to make sure instantiated templates are included\n\t    # in the archive.\n\t    old_archive_cmds_CXX='$CC -xar -o $oldlib $oldobjs'\n\t    ;;\n          gcx*)\n\t    # Green Hills C++ Compiler\n\t    archive_cmds_CXX='$CC -shared $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags $wl-h $wl$soname -o $lib'\n\n\t    # The C++ compiler must be used to create the archive.\n\t    old_archive_cmds_CXX='$CC $LDFLAGS -archive -o $oldlib $oldobjs'\n\t    ;;\n          *)\n\t    # GNU C++ compiler with Solaris linker\n\t    if test yes,no = \"$GXX,$with_gnu_ld\"; then\n\t      no_undefined_flag_CXX=' $wl-z ${wl}defs'\n\t      if $CC --version | $GREP -v '^2\\.7' > /dev/null; then\n\t        archive_cmds_CXX='$CC -shared $pic_flag -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags $wl-h $wl$soname -o $lib'\n\t        archive_expsym_cmds_CXX='echo \"{ global:\" > $lib.exp~cat $export_symbols | $SED -e \"s/\\(.*\\)/\\1;/\" >> $lib.exp~echo \"local: *; };\" >> $lib.exp~\n                  $CC -shared $pic_flag -nostdlib $wl-M $wl$lib.exp $wl-h $wl$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags~$RM $lib.exp'\n\n\t        # Commands to make compiler produce verbose output that lists\n\t        # what \"hidden\" libraries, object files and flags are used when\n\t        # linking a shared library.\n\t        output_verbose_link_cmd='$CC -shared $CFLAGS -v conftest.$objext 2>&1 | $GREP -v \"^Configured with:\" | $GREP \"\\-L\"'\n\t      else\n\t        # g++ 2.7 appears to require '-G' NOT '-shared' on this\n\t        # platform.\n\t        archive_cmds_CXX='$CC -G -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags $wl-h $wl$soname -o $lib'\n\t        archive_expsym_cmds_CXX='echo \"{ global:\" > $lib.exp~cat $export_symbols | $SED -e \"s/\\(.*\\)/\\1;/\" >> $lib.exp~echo \"local: *; };\" >> $lib.exp~\n                  $CC -G -nostdlib $wl-M $wl$lib.exp $wl-h $wl$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags~$RM $lib.exp'\n\n\t        # Commands to make compiler produce verbose output that lists\n\t        # what \"hidden\" libraries, object files and flags are used when\n\t        # linking a shared library.\n\t        output_verbose_link_cmd='$CC -G $CFLAGS -v conftest.$objext 2>&1 | $GREP -v \"^Configured with:\" | $GREP \"\\-L\"'\n\t      fi\n\n\t      hardcode_libdir_flag_spec_CXX='$wl-R $wl$libdir'\n\t      case $host_os in\n\t\tsolaris2.[0-5] | solaris2.[0-5].*) ;;\n\t\t*)\n\t\t  whole_archive_flag_spec_CXX='$wl-z ${wl}allextract$convenience $wl-z ${wl}defaultextract'\n\t\t  ;;\n\t      esac\n\t    fi\n\t    ;;\n        esac\n        ;;\n\n    sysv4*uw2* | sysv5OpenUNIX* | sysv5UnixWare7.[01].[10]* | unixware7* | sco3.2v5.0.[024]*)\n      no_undefined_flag_CXX='$wl-z,text'\n      archive_cmds_need_lc_CXX=no\n      hardcode_shlibpath_var_CXX=no\n      runpath_var='LD_RUN_PATH'\n\n      case $cc_basename in\n        CC*)\n\t  archive_cmds_CXX='$CC -G $wl-h,$soname -o $lib $libobjs $deplibs $compiler_flags'\n\t  archive_expsym_cmds_CXX='$CC -G $wl-Bexport:$export_symbols $wl-h,$soname -o $lib $libobjs $deplibs $compiler_flags'\n\t  ;;\n\t*)\n\t  archive_cmds_CXX='$CC -shared $wl-h,$soname -o $lib $libobjs $deplibs $compiler_flags'\n\t  archive_expsym_cmds_CXX='$CC -shared $wl-Bexport:$export_symbols $wl-h,$soname -o $lib $libobjs $deplibs $compiler_flags'\n\t  ;;\n      esac\n      ;;\n\n      sysv5* | sco3.2v5* | sco5v6*)\n\t# Note: We CANNOT use -z defs as we might desire, because we do not\n\t# link with -lc, and that would cause any symbols used from libc to\n\t# always be unresolved, which means just about no library would\n\t# ever link correctly.  If we're not using GNU ld we use -z text\n\t# though, which does catch some bad symbols but isn't as heavy-handed\n\t# as -z defs.\n\tno_undefined_flag_CXX='$wl-z,text'\n\tallow_undefined_flag_CXX='$wl-z,nodefs'\n\tarchive_cmds_need_lc_CXX=no\n\thardcode_shlibpath_var_CXX=no\n\thardcode_libdir_flag_spec_CXX='$wl-R,$libdir'\n\thardcode_libdir_separator_CXX=':'\n\tlink_all_deplibs_CXX=yes\n\texport_dynamic_flag_spec_CXX='$wl-Bexport'\n\trunpath_var='LD_RUN_PATH'\n\n\tcase $cc_basename in\n          CC*)\n\t    archive_cmds_CXX='$CC -G $wl-h,$soname -o $lib $libobjs $deplibs $compiler_flags'\n\t    archive_expsym_cmds_CXX='$CC -G $wl-Bexport:$export_symbols $wl-h,$soname -o $lib $libobjs $deplibs $compiler_flags'\n\t    old_archive_cmds_CXX='$CC -Tprelink_objects $oldobjs~\n              '\"$old_archive_cmds_CXX\"\n\t    reload_cmds_CXX='$CC -Tprelink_objects $reload_objs~\n              '\"$reload_cmds_CXX\"\n\t    ;;\n\t  *)\n\t    archive_cmds_CXX='$CC -shared $wl-h,$soname -o $lib $libobjs $deplibs $compiler_flags'\n\t    archive_expsym_cmds_CXX='$CC -shared $wl-Bexport:$export_symbols $wl-h,$soname -o $lib $libobjs $deplibs $compiler_flags'\n\t    ;;\n\tesac\n      ;;\n\n      tandem*)\n        case $cc_basename in\n          NCC*)\n\t    # NonStop-UX NCC 3.20\n\t    # FIXME: insert proper C++ library support\n\t    ld_shlibs_CXX=no\n\t    ;;\n          *)\n\t    # FIXME: insert proper C++ library support\n\t    ld_shlibs_CXX=no\n\t    ;;\n        esac\n        ;;\n\n      vxworks*)\n        # FIXME: insert proper C++ library support\n        ld_shlibs_CXX=no\n        ;;\n\n      *)\n        # FIXME: insert proper C++ library support\n        ld_shlibs_CXX=no\n        ;;\n    esac\n\n    { $as_echo \"$as_me:${as_lineno-$LINENO}: result: $ld_shlibs_CXX\" >&5\n$as_echo \"$ld_shlibs_CXX\" >&6; }\n    test no = \"$ld_shlibs_CXX\" && can_build_shared=no\n\n    GCC_CXX=$GXX\n    LD_CXX=$LD\n\n    ## CAVEAT EMPTOR:\n    ## There is no encapsulation within the following macros, do not change\n    ## the running order or otherwise move them around unless you know exactly\n    ## what you are doing...\n    # Dependencies to place before and after the object being linked:\npredep_objects_CXX=\npostdep_objects_CXX=\npredeps_CXX=\npostdeps_CXX=\ncompiler_lib_search_path_CXX=\n\ncat > conftest.$ac_ext <<_LT_EOF\nclass Foo\n{\npublic:\n  Foo (void) { a = 0; }\nprivate:\n  int a;\n};\n_LT_EOF\n\n\n_lt_libdeps_save_CFLAGS=$CFLAGS\ncase \"$CC $CFLAGS \" in #(\n*\\ -flto*\\ *) CFLAGS=\"$CFLAGS -fno-lto\" ;;\n*\\ -fwhopr*\\ *) CFLAGS=\"$CFLAGS -fno-whopr\" ;;\n*\\ -fuse-linker-plugin*\\ *) CFLAGS=\"$CFLAGS -fno-use-linker-plugin\" ;;\nesac\n\nif { { eval echo \"\\\"\\$as_me\\\":${as_lineno-$LINENO}: \\\"$ac_compile\\\"\"; } >&5\n  (eval $ac_compile) 2>&5\n  ac_status=$?\n  $as_echo \"$as_me:${as_lineno-$LINENO}: \\$? = $ac_status\" >&5\n  test $ac_status = 0; }; then\n  # Parse the compiler output and extract the necessary\n  # objects, libraries and library flags.\n\n  # Sentinel used to keep track of whether or not we are before\n  # the conftest object file.\n  pre_test_object_deps_done=no\n\n  for p in `eval \"$output_verbose_link_cmd\"`; do\n    case $prev$p in\n\n    -L* | -R* | -l*)\n       # Some compilers place space between \"-{L,R}\" and the path.\n       # Remove the space.\n       if test x-L = \"$p\" ||\n          test x-R = \"$p\"; then\n\t prev=$p\n\t continue\n       fi\n\n       # Expand the sysroot to ease extracting the directories later.\n       if test -z \"$prev\"; then\n         case $p in\n         -L*) func_stripname_cnf '-L' '' \"$p\"; prev=-L; p=$func_stripname_result ;;\n         -R*) func_stripname_cnf '-R' '' \"$p\"; prev=-R; p=$func_stripname_result ;;\n         -l*) func_stripname_cnf '-l' '' \"$p\"; prev=-l; p=$func_stripname_result ;;\n         esac\n       fi\n       case $p in\n       =*) func_stripname_cnf '=' '' \"$p\"; p=$lt_sysroot$func_stripname_result ;;\n       esac\n       if test no = \"$pre_test_object_deps_done\"; then\n\t case $prev in\n\t -L | -R)\n\t   # Internal compiler library paths should come after those\n\t   # provided the user.  The postdeps already come after the\n\t   # user supplied libs so there is no need to process them.\n\t   if test -z \"$compiler_lib_search_path_CXX\"; then\n\t     compiler_lib_search_path_CXX=$prev$p\n\t   else\n\t     compiler_lib_search_path_CXX=\"${compiler_lib_search_path_CXX} $prev$p\"\n\t   fi\n\t   ;;\n\t # The \"-l\" case would never come before the object being\n\t # linked, so don't bother handling this case.\n\t esac\n       else\n\t if test -z \"$postdeps_CXX\"; then\n\t   postdeps_CXX=$prev$p\n\t else\n\t   postdeps_CXX=\"${postdeps_CXX} $prev$p\"\n\t fi\n       fi\n       prev=\n       ;;\n\n    *.lto.$objext) ;; # Ignore GCC LTO objects\n    *.$objext)\n       # This assumes that the test object file only shows up\n       # once in the compiler output.\n       if test \"$p\" = \"conftest.$objext\"; then\n\t pre_test_object_deps_done=yes\n\t continue\n       fi\n\n       if test no = \"$pre_test_object_deps_done\"; then\n\t if test -z \"$predep_objects_CXX\"; then\n\t   predep_objects_CXX=$p\n\t else\n\t   predep_objects_CXX=\"$predep_objects_CXX $p\"\n\t fi\n       else\n\t if test -z \"$postdep_objects_CXX\"; then\n\t   postdep_objects_CXX=$p\n\t else\n\t   postdep_objects_CXX=\"$postdep_objects_CXX $p\"\n\t fi\n       fi\n       ;;\n\n    *) ;; # Ignore the rest.\n\n    esac\n  done\n\n  # Clean up.\n  rm -f a.out a.exe\nelse\n  echo \"libtool.m4: error: problem compiling CXX test program\"\nfi\n\n$RM -f confest.$objext\nCFLAGS=$_lt_libdeps_save_CFLAGS\n\n# PORTME: override above test on systems where it is broken\ncase $host_os in\ninterix[3-9]*)\n  # Interix 3.5 installs completely hosed .la files for C++, so rather than\n  # hack all around it, let's just trust \"g++\" to DTRT.\n  predep_objects_CXX=\n  postdep_objects_CXX=\n  postdeps_CXX=\n  ;;\nesac\n\n\ncase \" $postdeps_CXX \" in\n*\" -lc \"*) archive_cmds_need_lc_CXX=no ;;\nesac\n compiler_lib_search_dirs_CXX=\nif test -n \"${compiler_lib_search_path_CXX}\"; then\n compiler_lib_search_dirs_CXX=`echo \" ${compiler_lib_search_path_CXX}\" | $SED -e 's! -L! !g' -e 's!^ !!'`\nfi\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n    lt_prog_compiler_wl_CXX=\nlt_prog_compiler_pic_CXX=\nlt_prog_compiler_static_CXX=\n\n\n  # C++ specific cases for pic, static, wl, etc.\n  if test yes = \"$GXX\"; then\n    lt_prog_compiler_wl_CXX='-Wl,'\n    lt_prog_compiler_static_CXX='-static'\n\n    case $host_os in\n    aix*)\n      # All AIX code is PIC.\n      if test ia64 = \"$host_cpu\"; then\n\t# AIX 5 now supports IA64 processor\n\tlt_prog_compiler_static_CXX='-Bstatic'\n      fi\n      lt_prog_compiler_pic_CXX='-fPIC'\n      ;;\n\n    amigaos*)\n      case $host_cpu in\n      powerpc)\n            # see comment about AmigaOS4 .so support\n            lt_prog_compiler_pic_CXX='-fPIC'\n        ;;\n      m68k)\n            # FIXME: we need at least 68020 code to build shared libraries, but\n            # adding the '-m68020' flag to GCC prevents building anything better,\n            # like '-m68040'.\n            lt_prog_compiler_pic_CXX='-m68020 -resident32 -malways-restore-a4'\n        ;;\n      esac\n      ;;\n\n    beos* | irix5* | irix6* | nonstopux* | osf3* | osf4* | osf5*)\n      # PIC is the default for these OSes.\n      ;;\n    mingw* | cygwin* | os2* | pw32* | cegcc*)\n      # This hack is so that the source file can tell whether it is being\n      # built for inclusion in a dll (and should export symbols for example).\n      # Although the cygwin gcc ignores -fPIC, still need this for old-style\n      # (--disable-auto-import) libraries\n      lt_prog_compiler_pic_CXX='-DDLL_EXPORT'\n      case $host_os in\n      os2*)\n\tlt_prog_compiler_static_CXX='$wl-static'\n\t;;\n      esac\n      ;;\n    darwin* | rhapsody*)\n      # PIC is the default on this platform\n      # Common symbols not allowed in MH_DYLIB files\n      lt_prog_compiler_pic_CXX='-fno-common'\n      ;;\n    *djgpp*)\n      # DJGPP does not support shared libraries at all\n      lt_prog_compiler_pic_CXX=\n      ;;\n    haiku*)\n      # PIC is the default for Haiku.\n      # The \"-static\" flag exists, but is broken.\n      lt_prog_compiler_static_CXX=\n      ;;\n    interix[3-9]*)\n      # Interix 3.x gcc -fpic/-fPIC options generate broken code.\n      # Instead, we relocate shared libraries at runtime.\n      ;;\n    sysv4*MP*)\n      if test -d /usr/nec; then\n\tlt_prog_compiler_pic_CXX=-Kconform_pic\n      fi\n      ;;\n    hpux*)\n      # PIC is the default for 64-bit PA HP-UX, but not for 32-bit\n      # PA HP-UX.  On IA64 HP-UX, PIC is the default but the pic flag\n      # sets the default TLS model and affects inlining.\n      case $host_cpu in\n      hppa*64*)\n\t;;\n      *)\n\tlt_prog_compiler_pic_CXX='-fPIC'\n\t;;\n      esac\n      ;;\n    *qnx* | *nto*)\n      # QNX uses GNU C++, but need to define -shared option too, otherwise\n      # it will coredump.\n      lt_prog_compiler_pic_CXX='-fPIC -shared'\n      ;;\n    *)\n      lt_prog_compiler_pic_CXX='-fPIC'\n      ;;\n    esac\n  else\n    case $host_os in\n      aix[4-9]*)\n\t# All AIX code is PIC.\n\tif test ia64 = \"$host_cpu\"; then\n\t  # AIX 5 now supports IA64 processor\n\t  lt_prog_compiler_static_CXX='-Bstatic'\n\telse\n\t  lt_prog_compiler_static_CXX='-bnso -bI:/lib/syscalls.exp'\n\tfi\n\t;;\n      chorus*)\n\tcase $cc_basename in\n\tcxch68*)\n\t  # Green Hills C++ Compiler\n\t  # _LT_TAGVAR(lt_prog_compiler_static, CXX)=\"--no_auto_instantiation -u __main -u __premain -u _abort -r $COOL_DIR/lib/libOrb.a $MVME_DIR/lib/CC/libC.a $MVME_DIR/lib/classix/libcx.s.a\"\n\t  ;;\n\tesac\n\t;;\n      mingw* | cygwin* | os2* | pw32* | cegcc*)\n\t# This hack is so that the source file can tell whether it is being\n\t# built for inclusion in a dll (and should export symbols for example).\n\tlt_prog_compiler_pic_CXX='-DDLL_EXPORT'\n\t;;\n      dgux*)\n\tcase $cc_basename in\n\t  ec++*)\n\t    lt_prog_compiler_pic_CXX='-KPIC'\n\t    ;;\n\t  ghcx*)\n\t    # Green Hills C++ Compiler\n\t    lt_prog_compiler_pic_CXX='-pic'\n\t    ;;\n\t  *)\n\t    ;;\n\tesac\n\t;;\n      freebsd* | dragonfly*)\n\t# FreeBSD uses GNU C++\n\t;;\n      hpux9* | hpux10* | hpux11*)\n\tcase $cc_basename in\n\t  CC*)\n\t    lt_prog_compiler_wl_CXX='-Wl,'\n\t    lt_prog_compiler_static_CXX='$wl-a ${wl}archive'\n\t    if test ia64 != \"$host_cpu\"; then\n\t      lt_prog_compiler_pic_CXX='+Z'\n\t    fi\n\t    ;;\n\t  aCC*)\n\t    lt_prog_compiler_wl_CXX='-Wl,'\n\t    lt_prog_compiler_static_CXX='$wl-a ${wl}archive'\n\t    case $host_cpu in\n\t    hppa*64*|ia64*)\n\t      # +Z the default\n\t      ;;\n\t    *)\n\t      lt_prog_compiler_pic_CXX='+Z'\n\t      ;;\n\t    esac\n\t    ;;\n\t  *)\n\t    ;;\n\tesac\n\t;;\n      interix*)\n\t# This is c89, which is MS Visual C++ (no shared libs)\n\t# Anyone wants to do a port?\n\t;;\n      irix5* | irix6* | nonstopux*)\n\tcase $cc_basename in\n\t  CC*)\n\t    lt_prog_compiler_wl_CXX='-Wl,'\n\t    lt_prog_compiler_static_CXX='-non_shared'\n\t    # CC pic flag -KPIC is the default.\n\t    ;;\n\t  *)\n\t    ;;\n\tesac\n\t;;\n      linux* | k*bsd*-gnu | kopensolaris*-gnu | gnu*)\n\tcase $cc_basename in\n\t  KCC*)\n\t    # KAI C++ Compiler\n\t    lt_prog_compiler_wl_CXX='--backend -Wl,'\n\t    lt_prog_compiler_pic_CXX='-fPIC'\n\t    ;;\n\t  ecpc* )\n\t    # old Intel C++ for x86_64, which still supported -KPIC.\n\t    lt_prog_compiler_wl_CXX='-Wl,'\n\t    lt_prog_compiler_pic_CXX='-KPIC'\n\t    lt_prog_compiler_static_CXX='-static'\n\t    ;;\n\t  icpc* )\n\t    # Intel C++, used to be incompatible with GCC.\n\t    # ICC 10 doesn't accept -KPIC any more.\n\t    lt_prog_compiler_wl_CXX='-Wl,'\n\t    lt_prog_compiler_pic_CXX='-fPIC'\n\t    lt_prog_compiler_static_CXX='-static'\n\t    ;;\n\t  pgCC* | pgcpp*)\n\t    # Portland Group C++ compiler\n\t    lt_prog_compiler_wl_CXX='-Wl,'\n\t    lt_prog_compiler_pic_CXX='-fpic'\n\t    lt_prog_compiler_static_CXX='-Bstatic'\n\t    ;;\n\t  cxx*)\n\t    # Compaq C++\n\t    # Make sure the PIC flag is empty.  It appears that all Alpha\n\t    # Linux and Compaq Tru64 Unix objects are PIC.\n\t    lt_prog_compiler_pic_CXX=\n\t    lt_prog_compiler_static_CXX='-non_shared'\n\t    ;;\n\t  xlc* | xlC* | bgxl[cC]* | mpixl[cC]*)\n\t    # IBM XL 8.0, 9.0 on PPC and BlueGene\n\t    lt_prog_compiler_wl_CXX='-Wl,'\n\t    lt_prog_compiler_pic_CXX='-qpic'\n\t    lt_prog_compiler_static_CXX='-qstaticlink'\n\t    ;;\n\t  *)\n\t    case `$CC -V 2>&1 | sed 5q` in\n\t    *Sun\\ C*)\n\t      # Sun C++ 5.9\n\t      lt_prog_compiler_pic_CXX='-KPIC'\n\t      lt_prog_compiler_static_CXX='-Bstatic'\n\t      lt_prog_compiler_wl_CXX='-Qoption ld '\n\t      ;;\n\t    esac\n\t    ;;\n\tesac\n\t;;\n      lynxos*)\n\t;;\n      m88k*)\n\t;;\n      mvs*)\n\tcase $cc_basename in\n\t  cxx*)\n\t    lt_prog_compiler_pic_CXX='-W c,exportall'\n\t    ;;\n\t  *)\n\t    ;;\n\tesac\n\t;;\n      netbsd* | netbsdelf*-gnu)\n\t;;\n      *qnx* | *nto*)\n        # QNX uses GNU C++, but need to define -shared option too, otherwise\n        # it will coredump.\n        lt_prog_compiler_pic_CXX='-fPIC -shared'\n        ;;\n      osf3* | osf4* | osf5*)\n\tcase $cc_basename in\n\t  KCC*)\n\t    lt_prog_compiler_wl_CXX='--backend -Wl,'\n\t    ;;\n\t  RCC*)\n\t    # Rational C++ 2.4.1\n\t    lt_prog_compiler_pic_CXX='-pic'\n\t    ;;\n\t  cxx*)\n\t    # Digital/Compaq C++\n\t    lt_prog_compiler_wl_CXX='-Wl,'\n\t    # Make sure the PIC flag is empty.  It appears that all Alpha\n\t    # Linux and Compaq Tru64 Unix objects are PIC.\n\t    lt_prog_compiler_pic_CXX=\n\t    lt_prog_compiler_static_CXX='-non_shared'\n\t    ;;\n\t  *)\n\t    ;;\n\tesac\n\t;;\n      psos*)\n\t;;\n      solaris*)\n\tcase $cc_basename in\n\t  CC* | sunCC*)\n\t    # Sun C++ 4.2, 5.x and Centerline C++\n\t    lt_prog_compiler_pic_CXX='-KPIC'\n\t    lt_prog_compiler_static_CXX='-Bstatic'\n\t    lt_prog_compiler_wl_CXX='-Qoption ld '\n\t    ;;\n\t  gcx*)\n\t    # Green Hills C++ Compiler\n\t    lt_prog_compiler_pic_CXX='-PIC'\n\t    ;;\n\t  *)\n\t    ;;\n\tesac\n\t;;\n      sunos4*)\n\tcase $cc_basename in\n\t  CC*)\n\t    # Sun C++ 4.x\n\t    lt_prog_compiler_pic_CXX='-pic'\n\t    lt_prog_compiler_static_CXX='-Bstatic'\n\t    ;;\n\t  lcc*)\n\t    # Lucid\n\t    lt_prog_compiler_pic_CXX='-pic'\n\t    ;;\n\t  *)\n\t    ;;\n\tesac\n\t;;\n      sysv5* | unixware* | sco3.2v5* | sco5v6* | OpenUNIX*)\n\tcase $cc_basename in\n\t  CC*)\n\t    lt_prog_compiler_wl_CXX='-Wl,'\n\t    lt_prog_compiler_pic_CXX='-KPIC'\n\t    lt_prog_compiler_static_CXX='-Bstatic'\n\t    ;;\n\tesac\n\t;;\n      tandem*)\n\tcase $cc_basename in\n\t  NCC*)\n\t    # NonStop-UX NCC 3.20\n\t    lt_prog_compiler_pic_CXX='-KPIC'\n\t    ;;\n\t  *)\n\t    ;;\n\tesac\n\t;;\n      vxworks*)\n\t;;\n      *)\n\tlt_prog_compiler_can_build_shared_CXX=no\n\t;;\n    esac\n  fi\n\ncase $host_os in\n  # For platforms that do not support PIC, -DPIC is meaningless:\n  *djgpp*)\n    lt_prog_compiler_pic_CXX=\n    ;;\n  *)\n    lt_prog_compiler_pic_CXX=\"$lt_prog_compiler_pic_CXX -DPIC\"\n    ;;\nesac\n\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for $compiler option to produce PIC\" >&5\n$as_echo_n \"checking for $compiler option to produce PIC... \" >&6; }\nif ${lt_cv_prog_compiler_pic_CXX+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  lt_cv_prog_compiler_pic_CXX=$lt_prog_compiler_pic_CXX\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $lt_cv_prog_compiler_pic_CXX\" >&5\n$as_echo \"$lt_cv_prog_compiler_pic_CXX\" >&6; }\nlt_prog_compiler_pic_CXX=$lt_cv_prog_compiler_pic_CXX\n\n#\n# Check to make sure the PIC flag actually works.\n#\nif test -n \"$lt_prog_compiler_pic_CXX\"; then\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: checking if $compiler PIC flag $lt_prog_compiler_pic_CXX works\" >&5\n$as_echo_n \"checking if $compiler PIC flag $lt_prog_compiler_pic_CXX works... \" >&6; }\nif ${lt_cv_prog_compiler_pic_works_CXX+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  lt_cv_prog_compiler_pic_works_CXX=no\n   ac_outfile=conftest.$ac_objext\n   echo \"$lt_simple_compile_test_code\" > conftest.$ac_ext\n   lt_compiler_flag=\"$lt_prog_compiler_pic_CXX -DPIC\"  ## exclude from sc_useless_quotes_in_assignment\n   # Insert the option either (1) after the last *FLAGS variable, or\n   # (2) before a word containing \"conftest.\", or (3) at the end.\n   # Note that $ac_compile itself does not contain backslashes and begins\n   # with a dollar sign (not a hyphen), so the echo should work correctly.\n   # The option is referenced via a variable to avoid confusing sed.\n   lt_compile=`echo \"$ac_compile\" | $SED \\\n   -e 's:.*FLAGS}\\{0,1\\} :&$lt_compiler_flag :; t' \\\n   -e 's: [^ ]*conftest\\.: $lt_compiler_flag&:; t' \\\n   -e 's:$: $lt_compiler_flag:'`\n   (eval echo \"\\\"\\$as_me:$LINENO: $lt_compile\\\"\" >&5)\n   (eval \"$lt_compile\" 2>conftest.err)\n   ac_status=$?\n   cat conftest.err >&5\n   echo \"$as_me:$LINENO: \\$? = $ac_status\" >&5\n   if (exit $ac_status) && test -s \"$ac_outfile\"; then\n     # The compiler can only warn and ignore the option if not recognized\n     # So say no if there are warnings other than the usual output.\n     $ECHO \"$_lt_compiler_boilerplate\" | $SED '/^$/d' >conftest.exp\n     $SED '/^$/d; /^ *+/d' conftest.err >conftest.er2\n     if test ! -s conftest.er2 || diff conftest.exp conftest.er2 >/dev/null; then\n       lt_cv_prog_compiler_pic_works_CXX=yes\n     fi\n   fi\n   $RM conftest*\n\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $lt_cv_prog_compiler_pic_works_CXX\" >&5\n$as_echo \"$lt_cv_prog_compiler_pic_works_CXX\" >&6; }\n\nif test yes = \"$lt_cv_prog_compiler_pic_works_CXX\"; then\n    case $lt_prog_compiler_pic_CXX in\n     \"\" | \" \"*) ;;\n     *) lt_prog_compiler_pic_CXX=\" $lt_prog_compiler_pic_CXX\" ;;\n     esac\nelse\n    lt_prog_compiler_pic_CXX=\n     lt_prog_compiler_can_build_shared_CXX=no\nfi\n\nfi\n\n\n\n\n\n#\n# Check to make sure the static flag actually works.\n#\nwl=$lt_prog_compiler_wl_CXX eval lt_tmp_static_flag=\\\"$lt_prog_compiler_static_CXX\\\"\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking if $compiler static flag $lt_tmp_static_flag works\" >&5\n$as_echo_n \"checking if $compiler static flag $lt_tmp_static_flag works... \" >&6; }\nif ${lt_cv_prog_compiler_static_works_CXX+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  lt_cv_prog_compiler_static_works_CXX=no\n   save_LDFLAGS=$LDFLAGS\n   LDFLAGS=\"$LDFLAGS $lt_tmp_static_flag\"\n   echo \"$lt_simple_link_test_code\" > conftest.$ac_ext\n   if (eval $ac_link 2>conftest.err) && test -s conftest$ac_exeext; then\n     # The linker can only warn and ignore the option if not recognized\n     # So say no if there are warnings\n     if test -s conftest.err; then\n       # Append any errors to the config.log.\n       cat conftest.err 1>&5\n       $ECHO \"$_lt_linker_boilerplate\" | $SED '/^$/d' > conftest.exp\n       $SED '/^$/d; /^ *+/d' conftest.err >conftest.er2\n       if diff conftest.exp conftest.er2 >/dev/null; then\n         lt_cv_prog_compiler_static_works_CXX=yes\n       fi\n     else\n       lt_cv_prog_compiler_static_works_CXX=yes\n     fi\n   fi\n   $RM -r conftest*\n   LDFLAGS=$save_LDFLAGS\n\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $lt_cv_prog_compiler_static_works_CXX\" >&5\n$as_echo \"$lt_cv_prog_compiler_static_works_CXX\" >&6; }\n\nif test yes = \"$lt_cv_prog_compiler_static_works_CXX\"; then\n    :\nelse\n    lt_prog_compiler_static_CXX=\nfi\n\n\n\n\n    { $as_echo \"$as_me:${as_lineno-$LINENO}: checking if $compiler supports -c -o file.$ac_objext\" >&5\n$as_echo_n \"checking if $compiler supports -c -o file.$ac_objext... \" >&6; }\nif ${lt_cv_prog_compiler_c_o_CXX+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  lt_cv_prog_compiler_c_o_CXX=no\n   $RM -r conftest 2>/dev/null\n   mkdir conftest\n   cd conftest\n   mkdir out\n   echo \"$lt_simple_compile_test_code\" > conftest.$ac_ext\n\n   lt_compiler_flag=\"-o out/conftest2.$ac_objext\"\n   # Insert the option either (1) after the last *FLAGS variable, or\n   # (2) before a word containing \"conftest.\", or (3) at the end.\n   # Note that $ac_compile itself does not contain backslashes and begins\n   # with a dollar sign (not a hyphen), so the echo should work correctly.\n   lt_compile=`echo \"$ac_compile\" | $SED \\\n   -e 's:.*FLAGS}\\{0,1\\} :&$lt_compiler_flag :; t' \\\n   -e 's: [^ ]*conftest\\.: $lt_compiler_flag&:; t' \\\n   -e 's:$: $lt_compiler_flag:'`\n   (eval echo \"\\\"\\$as_me:$LINENO: $lt_compile\\\"\" >&5)\n   (eval \"$lt_compile\" 2>out/conftest.err)\n   ac_status=$?\n   cat out/conftest.err >&5\n   echo \"$as_me:$LINENO: \\$? = $ac_status\" >&5\n   if (exit $ac_status) && test -s out/conftest2.$ac_objext\n   then\n     # The compiler can only warn and ignore the option if not recognized\n     # So say no if there are warnings\n     $ECHO \"$_lt_compiler_boilerplate\" | $SED '/^$/d' > out/conftest.exp\n     $SED '/^$/d; /^ *+/d' out/conftest.err >out/conftest.er2\n     if test ! -s out/conftest.er2 || diff out/conftest.exp out/conftest.er2 >/dev/null; then\n       lt_cv_prog_compiler_c_o_CXX=yes\n     fi\n   fi\n   chmod u+w . 2>&5\n   $RM conftest*\n   # SGI C++ compiler will create directory out/ii_files/ for\n   # template instantiation\n   test -d out/ii_files && $RM out/ii_files/* && rmdir out/ii_files\n   $RM out/* && rmdir out\n   cd ..\n   $RM -r conftest\n   $RM conftest*\n\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $lt_cv_prog_compiler_c_o_CXX\" >&5\n$as_echo \"$lt_cv_prog_compiler_c_o_CXX\" >&6; }\n\n\n\n    { $as_echo \"$as_me:${as_lineno-$LINENO}: checking if $compiler supports -c -o file.$ac_objext\" >&5\n$as_echo_n \"checking if $compiler supports -c -o file.$ac_objext... \" >&6; }\nif ${lt_cv_prog_compiler_c_o_CXX+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  lt_cv_prog_compiler_c_o_CXX=no\n   $RM -r conftest 2>/dev/null\n   mkdir conftest\n   cd conftest\n   mkdir out\n   echo \"$lt_simple_compile_test_code\" > conftest.$ac_ext\n\n   lt_compiler_flag=\"-o out/conftest2.$ac_objext\"\n   # Insert the option either (1) after the last *FLAGS variable, or\n   # (2) before a word containing \"conftest.\", or (3) at the end.\n   # Note that $ac_compile itself does not contain backslashes and begins\n   # with a dollar sign (not a hyphen), so the echo should work correctly.\n   lt_compile=`echo \"$ac_compile\" | $SED \\\n   -e 's:.*FLAGS}\\{0,1\\} :&$lt_compiler_flag :; t' \\\n   -e 's: [^ ]*conftest\\.: $lt_compiler_flag&:; t' \\\n   -e 's:$: $lt_compiler_flag:'`\n   (eval echo \"\\\"\\$as_me:$LINENO: $lt_compile\\\"\" >&5)\n   (eval \"$lt_compile\" 2>out/conftest.err)\n   ac_status=$?\n   cat out/conftest.err >&5\n   echo \"$as_me:$LINENO: \\$? = $ac_status\" >&5\n   if (exit $ac_status) && test -s out/conftest2.$ac_objext\n   then\n     # The compiler can only warn and ignore the option if not recognized\n     # So say no if there are warnings\n     $ECHO \"$_lt_compiler_boilerplate\" | $SED '/^$/d' > out/conftest.exp\n     $SED '/^$/d; /^ *+/d' out/conftest.err >out/conftest.er2\n     if test ! -s out/conftest.er2 || diff out/conftest.exp out/conftest.er2 >/dev/null; then\n       lt_cv_prog_compiler_c_o_CXX=yes\n     fi\n   fi\n   chmod u+w . 2>&5\n   $RM conftest*\n   # SGI C++ compiler will create directory out/ii_files/ for\n   # template instantiation\n   test -d out/ii_files && $RM out/ii_files/* && rmdir out/ii_files\n   $RM out/* && rmdir out\n   cd ..\n   $RM -r conftest\n   $RM conftest*\n\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $lt_cv_prog_compiler_c_o_CXX\" >&5\n$as_echo \"$lt_cv_prog_compiler_c_o_CXX\" >&6; }\n\n\n\n\nhard_links=nottested\nif test no = \"$lt_cv_prog_compiler_c_o_CXX\" && test no != \"$need_locks\"; then\n  # do not overwrite the value of need_locks provided by the user\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: checking if we can lock with hard links\" >&5\n$as_echo_n \"checking if we can lock with hard links... \" >&6; }\n  hard_links=yes\n  $RM conftest*\n  ln conftest.a conftest.b 2>/dev/null && hard_links=no\n  touch conftest.a\n  ln conftest.a conftest.b 2>&5 || hard_links=no\n  ln conftest.a conftest.b 2>/dev/null && hard_links=no\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: $hard_links\" >&5\n$as_echo \"$hard_links\" >&6; }\n  if test no = \"$hard_links\"; then\n    { $as_echo \"$as_me:${as_lineno-$LINENO}: WARNING: '$CC' does not support '-c -o', so 'make -j' may be unsafe\" >&5\n$as_echo \"$as_me: WARNING: '$CC' does not support '-c -o', so 'make -j' may be unsafe\" >&2;}\n    need_locks=warn\n  fi\nelse\n  need_locks=no\nfi\n\n\n\n    { $as_echo \"$as_me:${as_lineno-$LINENO}: checking whether the $compiler linker ($LD) supports shared libraries\" >&5\n$as_echo_n \"checking whether the $compiler linker ($LD) supports shared libraries... \" >&6; }\n\n  export_symbols_cmds_CXX='$NM $libobjs $convenience | $global_symbol_pipe | $SED '\\''s/.* //'\\'' | sort | uniq > $export_symbols'\n  exclude_expsyms_CXX='_GLOBAL_OFFSET_TABLE_|_GLOBAL__F[ID]_.*'\n  case $host_os in\n  aix[4-9]*)\n    # If we're using GNU nm, then we don't want the \"-C\" option.\n    # -C means demangle to GNU nm, but means don't demangle to AIX nm.\n    # Without the \"-l\" option, or with the \"-B\" option, AIX nm treats\n    # weak defined symbols like other global defined symbols, whereas\n    # GNU nm marks them as \"W\".\n    # While the 'weak' keyword is ignored in the Export File, we need\n    # it in the Import File for the 'aix-soname' feature, so we have\n    # to replace the \"-B\" option with \"-P\" for AIX nm.\n    if $NM -V 2>&1 | $GREP 'GNU' > /dev/null; then\n      export_symbols_cmds_CXX='$NM -Bpg $libobjs $convenience | awk '\\''{ if (((\\$ 2 == \"T\") || (\\$ 2 == \"D\") || (\\$ 2 == \"B\") || (\\$ 2 == \"W\")) && (substr(\\$ 3,1,1) != \".\")) { if (\\$ 2 == \"W\") { print \\$ 3 \" weak\" } else { print \\$ 3 } } }'\\'' | sort -u > $export_symbols'\n    else\n      export_symbols_cmds_CXX='`func_echo_all $NM | $SED -e '\\''s/B\\([^B]*\\)$/P\\1/'\\''` -PCpgl $libobjs $convenience | awk '\\''{ if (((\\$ 2 == \"T\") || (\\$ 2 == \"D\") || (\\$ 2 == \"B\") || (\\$ 2 == \"W\") || (\\$ 2 == \"V\") || (\\$ 2 == \"Z\")) && (substr(\\$ 1,1,1) != \".\")) { if ((\\$ 2 == \"W\") || (\\$ 2 == \"V\") || (\\$ 2 == \"Z\")) { print \\$ 1 \" weak\" } else { print \\$ 1 } } }'\\'' | sort -u > $export_symbols'\n    fi\n    ;;\n  pw32*)\n    export_symbols_cmds_CXX=$ltdll_cmds\n    ;;\n  cygwin* | mingw* | cegcc*)\n    case $cc_basename in\n    cl*)\n      exclude_expsyms_CXX='_NULL_IMPORT_DESCRIPTOR|_IMPORT_DESCRIPTOR_.*'\n      ;;\n    *)\n      export_symbols_cmds_CXX='$NM $libobjs $convenience | $global_symbol_pipe | $SED -e '\\''/^[BCDGRS][ ]/s/.*[ ]\\([^ ]*\\)/\\1 DATA/;s/^.*[ ]__nm__\\([^ ]*\\)[ ][^ ]*/\\1 DATA/;/^I[ ]/d;/^[AITW][ ]/s/.* //'\\'' | sort | uniq > $export_symbols'\n      exclude_expsyms_CXX='[_]+GLOBAL_OFFSET_TABLE_|[_]+GLOBAL__[FID]_.*|[_]+head_[A-Za-z0-9_]+_dll|[A-Za-z0-9_]+_dll_iname'\n      ;;\n    esac\n    ;;\n  linux* | k*bsd*-gnu | gnu*)\n    link_all_deplibs_CXX=no\n    ;;\n  *)\n    export_symbols_cmds_CXX='$NM $libobjs $convenience | $global_symbol_pipe | $SED '\\''s/.* //'\\'' | sort | uniq > $export_symbols'\n    ;;\n  esac\n\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $ld_shlibs_CXX\" >&5\n$as_echo \"$ld_shlibs_CXX\" >&6; }\ntest no = \"$ld_shlibs_CXX\" && can_build_shared=no\n\nwith_gnu_ld_CXX=$with_gnu_ld\n\n\n\n\n\n\n#\n# Do we need to explicitly link libc?\n#\ncase \"x$archive_cmds_need_lc_CXX\" in\nx|xyes)\n  # Assume -lc should be added\n  archive_cmds_need_lc_CXX=yes\n\n  if test yes,yes = \"$GCC,$enable_shared\"; then\n    case $archive_cmds_CXX in\n    *'~'*)\n      # FIXME: we may have to deal with multi-command sequences.\n      ;;\n    '$CC '*)\n      # Test whether the compiler implicitly links with -lc since on some\n      # systems, -lgcc has to come before -lc. If gcc already passes -lc\n      # to ld, don't add -lc before -lgcc.\n      { $as_echo \"$as_me:${as_lineno-$LINENO}: checking whether -lc should be explicitly linked in\" >&5\n$as_echo_n \"checking whether -lc should be explicitly linked in... \" >&6; }\nif ${lt_cv_archive_cmds_need_lc_CXX+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  $RM conftest*\n\techo \"$lt_simple_compile_test_code\" > conftest.$ac_ext\n\n\tif { { eval echo \"\\\"\\$as_me\\\":${as_lineno-$LINENO}: \\\"$ac_compile\\\"\"; } >&5\n  (eval $ac_compile) 2>&5\n  ac_status=$?\n  $as_echo \"$as_me:${as_lineno-$LINENO}: \\$? = $ac_status\" >&5\n  test $ac_status = 0; } 2>conftest.err; then\n\t  soname=conftest\n\t  lib=conftest\n\t  libobjs=conftest.$ac_objext\n\t  deplibs=\n\t  wl=$lt_prog_compiler_wl_CXX\n\t  pic_flag=$lt_prog_compiler_pic_CXX\n\t  compiler_flags=-v\n\t  linker_flags=-v\n\t  verstring=\n\t  output_objdir=.\n\t  libname=conftest\n\t  lt_save_allow_undefined_flag=$allow_undefined_flag_CXX\n\t  allow_undefined_flag_CXX=\n\t  if { { eval echo \"\\\"\\$as_me\\\":${as_lineno-$LINENO}: \\\"$archive_cmds_CXX 2\\>\\&1 \\| $GREP \\\" -lc \\\" \\>/dev/null 2\\>\\&1\\\"\"; } >&5\n  (eval $archive_cmds_CXX 2\\>\\&1 \\| $GREP \\\" -lc \\\" \\>/dev/null 2\\>\\&1) 2>&5\n  ac_status=$?\n  $as_echo \"$as_me:${as_lineno-$LINENO}: \\$? = $ac_status\" >&5\n  test $ac_status = 0; }\n\t  then\n\t    lt_cv_archive_cmds_need_lc_CXX=no\n\t  else\n\t    lt_cv_archive_cmds_need_lc_CXX=yes\n\t  fi\n\t  allow_undefined_flag_CXX=$lt_save_allow_undefined_flag\n\telse\n\t  cat conftest.err 1>&5\n\tfi\n\t$RM conftest*\n\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $lt_cv_archive_cmds_need_lc_CXX\" >&5\n$as_echo \"$lt_cv_archive_cmds_need_lc_CXX\" >&6; }\n      archive_cmds_need_lc_CXX=$lt_cv_archive_cmds_need_lc_CXX\n      ;;\n    esac\n  fi\n  ;;\nesac\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n    { $as_echo \"$as_me:${as_lineno-$LINENO}: checking dynamic linker characteristics\" >&5\n$as_echo_n \"checking dynamic linker characteristics... \" >&6; }\n\nlibrary_names_spec=\nlibname_spec='lib$name'\nsoname_spec=\nshrext_cmds=.so\npostinstall_cmds=\npostuninstall_cmds=\nfinish_cmds=\nfinish_eval=\nshlibpath_var=\nshlibpath_overrides_runpath=unknown\nversion_type=none\ndynamic_linker=\"$host_os ld.so\"\nsys_lib_dlsearch_path_spec=\"/lib /usr/lib\"\nneed_lib_prefix=unknown\nhardcode_into_libs=no\n\n# when you set need_version to no, make sure it does not cause -set_version\n# flags to be left without arguments\nneed_version=unknown\n\n\n\ncase $host_os in\naix3*)\n  version_type=linux # correct to gnu/linux during the next big refactor\n  library_names_spec='$libname$release$shared_ext$versuffix $libname.a'\n  shlibpath_var=LIBPATH\n\n  # AIX 3 has no versioning support, so we append a major version to the name.\n  soname_spec='$libname$release$shared_ext$major'\n  ;;\n\naix[4-9]*)\n  version_type=linux # correct to gnu/linux during the next big refactor\n  need_lib_prefix=no\n  need_version=no\n  hardcode_into_libs=yes\n  if test ia64 = \"$host_cpu\"; then\n    # AIX 5 supports IA64\n    library_names_spec='$libname$release$shared_ext$major $libname$release$shared_ext$versuffix $libname$shared_ext'\n    shlibpath_var=LD_LIBRARY_PATH\n  else\n    # With GCC up to 2.95.x, collect2 would create an import file\n    # for dependence libraries.  The import file would start with\n    # the line '#! .'.  This would cause the generated library to\n    # depend on '.', always an invalid library.  This was fixed in\n    # development snapshots of GCC prior to 3.0.\n    case $host_os in\n      aix4 | aix4.[01] | aix4.[01].*)\n      if { echo '#if __GNUC__ > 2 || (__GNUC__ == 2 && __GNUC_MINOR__ >= 97)'\n\t   echo ' yes '\n\t   echo '#endif'; } | $CC -E - | $GREP yes > /dev/null; then\n\t:\n      else\n\tcan_build_shared=no\n      fi\n      ;;\n    esac\n    # Using Import Files as archive members, it is possible to support\n    # filename-based versioning of shared library archives on AIX. While\n    # this would work for both with and without runtime linking, it will\n    # prevent static linking of such archives. So we do filename-based\n    # shared library versioning with .so extension only, which is used\n    # when both runtime linking and shared linking is enabled.\n    # Unfortunately, runtime linking may impact performance, so we do\n    # not want this to be the default eventually. Also, we use the\n    # versioned .so libs for executables only if there is the -brtl\n    # linker flag in LDFLAGS as well, or --with-aix-soname=svr4 only.\n    # To allow for filename-based versioning support, we need to create\n    # libNAME.so.V as an archive file, containing:\n    # *) an Import File, referring to the versioned filename of the\n    #    archive as well as the shared archive member, telling the\n    #    bitwidth (32 or 64) of that shared object, and providing the\n    #    list of exported symbols of that shared object, eventually\n    #    decorated with the 'weak' keyword\n    # *) the shared object with the F_LOADONLY flag set, to really avoid\n    #    it being seen by the linker.\n    # At run time we better use the real file rather than another symlink,\n    # but for link time we create the symlink libNAME.so -> libNAME.so.V\n\n    case $with_aix_soname,$aix_use_runtimelinking in\n    # AIX (on Power*) has no versioning support, so currently we cannot hardcode correct\n    # soname into executable. Probably we can add versioning support to\n    # collect2, so additional links can be useful in future.\n    aix,yes) # traditional libtool\n      dynamic_linker='AIX unversionable lib.so'\n      # If using run time linking (on AIX 4.2 or later) use lib<name>.so\n      # instead of lib<name>.a to let people know that these are not\n      # typical AIX shared libraries.\n      library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext'\n      ;;\n    aix,no) # traditional AIX only\n      dynamic_linker='AIX lib.a(lib.so.V)'\n      # We preserve .a as extension for shared libraries through AIX4.2\n      # and later when we are not doing run time linking.\n      library_names_spec='$libname$release.a $libname.a'\n      soname_spec='$libname$release$shared_ext$major'\n      ;;\n    svr4,*) # full svr4 only\n      dynamic_linker=\"AIX lib.so.V($shared_archive_member_spec.o)\"\n      library_names_spec='$libname$release$shared_ext$major $libname$shared_ext'\n      # We do not specify a path in Import Files, so LIBPATH fires.\n      shlibpath_overrides_runpath=yes\n      ;;\n    *,yes) # both, prefer svr4\n      dynamic_linker=\"AIX lib.so.V($shared_archive_member_spec.o), lib.a(lib.so.V)\"\n      library_names_spec='$libname$release$shared_ext$major $libname$shared_ext'\n      # unpreferred sharedlib libNAME.a needs extra handling\n      postinstall_cmds='test -n \"$linkname\" || linkname=\"$realname\"~func_stripname \"\" \".so\" \"$linkname\"~$install_shared_prog \"$dir/$func_stripname_result.$libext\" \"$destdir/$func_stripname_result.$libext\"~test -z \"$tstripme\" || test -z \"$striplib\" || $striplib \"$destdir/$func_stripname_result.$libext\"'\n      postuninstall_cmds='for n in $library_names $old_library; do :; done~func_stripname \"\" \".so\" \"$n\"~test \"$func_stripname_result\" = \"$n\" || func_append rmfiles \" $odir/$func_stripname_result.$libext\"'\n      # We do not specify a path in Import Files, so LIBPATH fires.\n      shlibpath_overrides_runpath=yes\n      ;;\n    *,no) # both, prefer aix\n      dynamic_linker=\"AIX lib.a(lib.so.V), lib.so.V($shared_archive_member_spec.o)\"\n      library_names_spec='$libname$release.a $libname.a'\n      soname_spec='$libname$release$shared_ext$major'\n      # unpreferred sharedlib libNAME.so.V and symlink libNAME.so need extra handling\n      postinstall_cmds='test -z \"$dlname\" || $install_shared_prog $dir/$dlname $destdir/$dlname~test -z \"$tstripme\" || test -z \"$striplib\" || $striplib $destdir/$dlname~test -n \"$linkname\" || linkname=$realname~func_stripname \"\" \".a\" \"$linkname\"~(cd \"$destdir\" && $LN_S -f $dlname $func_stripname_result.so)'\n      postuninstall_cmds='test -z \"$dlname\" || func_append rmfiles \" $odir/$dlname\"~for n in $old_library $library_names; do :; done~func_stripname \"\" \".a\" \"$n\"~func_append rmfiles \" $odir/$func_stripname_result.so\"'\n      ;;\n    esac\n    shlibpath_var=LIBPATH\n  fi\n  ;;\n\namigaos*)\n  case $host_cpu in\n  powerpc)\n    # Since July 2007 AmigaOS4 officially supports .so libraries.\n    # When compiling the executable, add -use-dynld -Lsobjs: to the compileline.\n    library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext'\n    ;;\n  m68k)\n    library_names_spec='$libname.ixlibrary $libname.a'\n    # Create ${libname}_ixlibrary.a entries in /sys/libs.\n    finish_eval='for lib in `ls $libdir/*.ixlibrary 2>/dev/null`; do libname=`func_echo_all \"$lib\" | $SED '\\''s%^.*/\\([^/]*\\)\\.ixlibrary$%\\1%'\\''`; $RM /sys/libs/${libname}_ixlibrary.a; $show \"cd /sys/libs && $LN_S $lib ${libname}_ixlibrary.a\"; cd /sys/libs && $LN_S $lib ${libname}_ixlibrary.a || exit 1; done'\n    ;;\n  esac\n  ;;\n\nbeos*)\n  library_names_spec='$libname$shared_ext'\n  dynamic_linker=\"$host_os ld.so\"\n  shlibpath_var=LIBRARY_PATH\n  ;;\n\nbsdi[45]*)\n  version_type=linux # correct to gnu/linux during the next big refactor\n  need_version=no\n  library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext'\n  soname_spec='$libname$release$shared_ext$major'\n  finish_cmds='PATH=\"\\$PATH:/sbin\" ldconfig $libdir'\n  shlibpath_var=LD_LIBRARY_PATH\n  sys_lib_search_path_spec=\"/shlib /usr/lib /usr/X11/lib /usr/contrib/lib /lib /usr/local/lib\"\n  sys_lib_dlsearch_path_spec=\"/shlib /usr/lib /usr/local/lib\"\n  # the default ld.so.conf also contains /usr/contrib/lib and\n  # /usr/X11R6/lib (/usr/X11 is a link to /usr/X11R6), but let us allow\n  # libtool to hard-code these into programs\n  ;;\n\ncygwin* | mingw* | pw32* | cegcc*)\n  version_type=windows\n  shrext_cmds=.dll\n  need_version=no\n  need_lib_prefix=no\n\n  case $GCC,$cc_basename in\n  yes,*)\n    # gcc\n    library_names_spec='$libname.dll.a'\n    # DLL is installed to $(libdir)/../bin by postinstall_cmds\n    postinstall_cmds='base_file=`basename \\$file`~\n      dlpath=`$SHELL 2>&1 -c '\\''. $dir/'\\''\\$base_file'\\''i; echo \\$dlname'\\''`~\n      dldir=$destdir/`dirname \\$dlpath`~\n      test -d \\$dldir || mkdir -p \\$dldir~\n      $install_prog $dir/$dlname \\$dldir/$dlname~\n      chmod a+x \\$dldir/$dlname~\n      if test -n '\\''$stripme'\\'' && test -n '\\''$striplib'\\''; then\n        eval '\\''$striplib \\$dldir/$dlname'\\'' || exit \\$?;\n      fi'\n    postuninstall_cmds='dldll=`$SHELL 2>&1 -c '\\''. $file; echo \\$dlname'\\''`~\n      dlpath=$dir/\\$dldll~\n       $RM \\$dlpath'\n    shlibpath_overrides_runpath=yes\n\n    case $host_os in\n    cygwin*)\n      # Cygwin DLLs use 'cyg' prefix rather than 'lib'\n      soname_spec='`echo $libname | sed -e 's/^lib/cyg/'``echo $release | $SED -e 's/[.]/-/g'`$versuffix$shared_ext'\n\n      ;;\n    mingw* | cegcc*)\n      # MinGW DLLs use traditional 'lib' prefix\n      soname_spec='$libname`echo $release | $SED -e 's/[.]/-/g'`$versuffix$shared_ext'\n      ;;\n    pw32*)\n      # pw32 DLLs use 'pw' prefix rather than 'lib'\n      library_names_spec='`echo $libname | sed -e 's/^lib/pw/'``echo $release | $SED -e 's/[.]/-/g'`$versuffix$shared_ext'\n      ;;\n    esac\n    dynamic_linker='Win32 ld.exe'\n    ;;\n\n  *,cl*)\n    # Native MSVC\n    libname_spec='$name'\n    soname_spec='$libname`echo $release | $SED -e 's/[.]/-/g'`$versuffix$shared_ext'\n    library_names_spec='$libname.dll.lib'\n\n    case $build_os in\n    mingw*)\n      sys_lib_search_path_spec=\n      lt_save_ifs=$IFS\n      IFS=';'\n      for lt_path in $LIB\n      do\n        IFS=$lt_save_ifs\n        # Let DOS variable expansion print the short 8.3 style file name.\n        lt_path=`cd \"$lt_path\" 2>/dev/null && cmd //C \"for %i in (\".\") do @echo %~si\"`\n        sys_lib_search_path_spec=\"$sys_lib_search_path_spec $lt_path\"\n      done\n      IFS=$lt_save_ifs\n      # Convert to MSYS style.\n      sys_lib_search_path_spec=`$ECHO \"$sys_lib_search_path_spec\" | sed -e 's|\\\\\\\\|/|g' -e 's| \\\\([a-zA-Z]\\\\):| /\\\\1|g' -e 's|^ ||'`\n      ;;\n    cygwin*)\n      # Convert to unix form, then to dos form, then back to unix form\n      # but this time dos style (no spaces!) so that the unix form looks\n      # like /cygdrive/c/PROGRA~1:/cygdr...\n      sys_lib_search_path_spec=`cygpath --path --unix \"$LIB\"`\n      sys_lib_search_path_spec=`cygpath --path --dos \"$sys_lib_search_path_spec\" 2>/dev/null`\n      sys_lib_search_path_spec=`cygpath --path --unix \"$sys_lib_search_path_spec\" | $SED -e \"s/$PATH_SEPARATOR/ /g\"`\n      ;;\n    *)\n      sys_lib_search_path_spec=$LIB\n      if $ECHO \"$sys_lib_search_path_spec\" | $GREP ';[c-zC-Z]:/' >/dev/null; then\n        # It is most probably a Windows format PATH.\n        sys_lib_search_path_spec=`$ECHO \"$sys_lib_search_path_spec\" | $SED -e 's/;/ /g'`\n      else\n        sys_lib_search_path_spec=`$ECHO \"$sys_lib_search_path_spec\" | $SED -e \"s/$PATH_SEPARATOR/ /g\"`\n      fi\n      # FIXME: find the short name or the path components, as spaces are\n      # common. (e.g. \"Program Files\" -> \"PROGRA~1\")\n      ;;\n    esac\n\n    # DLL is installed to $(libdir)/../bin by postinstall_cmds\n    postinstall_cmds='base_file=`basename \\$file`~\n      dlpath=`$SHELL 2>&1 -c '\\''. $dir/'\\''\\$base_file'\\''i; echo \\$dlname'\\''`~\n      dldir=$destdir/`dirname \\$dlpath`~\n      test -d \\$dldir || mkdir -p \\$dldir~\n      $install_prog $dir/$dlname \\$dldir/$dlname'\n    postuninstall_cmds='dldll=`$SHELL 2>&1 -c '\\''. $file; echo \\$dlname'\\''`~\n      dlpath=$dir/\\$dldll~\n       $RM \\$dlpath'\n    shlibpath_overrides_runpath=yes\n    dynamic_linker='Win32 link.exe'\n    ;;\n\n  *)\n    # Assume MSVC wrapper\n    library_names_spec='$libname`echo $release | $SED -e 's/[.]/-/g'`$versuffix$shared_ext $libname.lib'\n    dynamic_linker='Win32 ld.exe'\n    ;;\n  esac\n  # FIXME: first we should search . and the directory the executable is in\n  shlibpath_var=PATH\n  ;;\n\ndarwin* | rhapsody*)\n  dynamic_linker=\"$host_os dyld\"\n  version_type=darwin\n  need_lib_prefix=no\n  need_version=no\n  library_names_spec='$libname$release$major$shared_ext $libname$shared_ext'\n  soname_spec='$libname$release$major$shared_ext'\n  shlibpath_overrides_runpath=yes\n  shlibpath_var=DYLD_LIBRARY_PATH\n  shrext_cmds='`test .$module = .yes && echo .so || echo .dylib`'\n\n  sys_lib_dlsearch_path_spec='/usr/local/lib /lib /usr/lib'\n  ;;\n\ndgux*)\n  version_type=linux # correct to gnu/linux during the next big refactor\n  need_lib_prefix=no\n  need_version=no\n  library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext'\n  soname_spec='$libname$release$shared_ext$major'\n  shlibpath_var=LD_LIBRARY_PATH\n  ;;\n\nfreebsd* | dragonfly*)\n  # DragonFly does not have aout.  When/if they implement a new\n  # versioning mechanism, adjust this.\n  if test -x /usr/bin/objformat; then\n    objformat=`/usr/bin/objformat`\n  else\n    case $host_os in\n    freebsd[23].*) objformat=aout ;;\n    *) objformat=elf ;;\n    esac\n  fi\n  version_type=freebsd-$objformat\n  case $version_type in\n    freebsd-elf*)\n      library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext'\n      soname_spec='$libname$release$shared_ext$major'\n      need_version=no\n      need_lib_prefix=no\n      ;;\n    freebsd-*)\n      library_names_spec='$libname$release$shared_ext$versuffix $libname$shared_ext$versuffix'\n      need_version=yes\n      ;;\n  esac\n  shlibpath_var=LD_LIBRARY_PATH\n  case $host_os in\n  freebsd2.*)\n    shlibpath_overrides_runpath=yes\n    ;;\n  freebsd3.[01]* | freebsdelf3.[01]*)\n    shlibpath_overrides_runpath=yes\n    hardcode_into_libs=yes\n    ;;\n  freebsd3.[2-9]* | freebsdelf3.[2-9]* | \\\n  freebsd4.[0-5] | freebsdelf4.[0-5] | freebsd4.1.1 | freebsdelf4.1.1)\n    shlibpath_overrides_runpath=no\n    hardcode_into_libs=yes\n    ;;\n  *) # from 4.6 on, and DragonFly\n    shlibpath_overrides_runpath=yes\n    hardcode_into_libs=yes\n    ;;\n  esac\n  ;;\n\nhaiku*)\n  version_type=linux # correct to gnu/linux during the next big refactor\n  need_lib_prefix=no\n  need_version=no\n  dynamic_linker=\"$host_os runtime_loader\"\n  library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext'\n  soname_spec='$libname$release$shared_ext$major'\n  shlibpath_var=LIBRARY_PATH\n  shlibpath_overrides_runpath=no\n  sys_lib_dlsearch_path_spec='/boot/home/config/lib /boot/common/lib /boot/system/lib'\n  hardcode_into_libs=yes\n  ;;\n\nhpux9* | hpux10* | hpux11*)\n  # Give a soname corresponding to the major version so that dld.sl refuses to\n  # link against other versions.\n  version_type=sunos\n  need_lib_prefix=no\n  need_version=no\n  case $host_cpu in\n  ia64*)\n    shrext_cmds='.so'\n    hardcode_into_libs=yes\n    dynamic_linker=\"$host_os dld.so\"\n    shlibpath_var=LD_LIBRARY_PATH\n    shlibpath_overrides_runpath=yes # Unless +noenvvar is specified.\n    library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext'\n    soname_spec='$libname$release$shared_ext$major'\n    if test 32 = \"$HPUX_IA64_MODE\"; then\n      sys_lib_search_path_spec=\"/usr/lib/hpux32 /usr/local/lib/hpux32 /usr/local/lib\"\n      sys_lib_dlsearch_path_spec=/usr/lib/hpux32\n    else\n      sys_lib_search_path_spec=\"/usr/lib/hpux64 /usr/local/lib/hpux64\"\n      sys_lib_dlsearch_path_spec=/usr/lib/hpux64\n    fi\n    ;;\n  hppa*64*)\n    shrext_cmds='.sl'\n    hardcode_into_libs=yes\n    dynamic_linker=\"$host_os dld.sl\"\n    shlibpath_var=LD_LIBRARY_PATH # How should we handle SHLIB_PATH\n    shlibpath_overrides_runpath=yes # Unless +noenvvar is specified.\n    library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext'\n    soname_spec='$libname$release$shared_ext$major'\n    sys_lib_search_path_spec=\"/usr/lib/pa20_64 /usr/ccs/lib/pa20_64\"\n    sys_lib_dlsearch_path_spec=$sys_lib_search_path_spec\n    ;;\n  *)\n    shrext_cmds='.sl'\n    dynamic_linker=\"$host_os dld.sl\"\n    shlibpath_var=SHLIB_PATH\n    shlibpath_overrides_runpath=no # +s is required to enable SHLIB_PATH\n    library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext'\n    soname_spec='$libname$release$shared_ext$major'\n    ;;\n  esac\n  # HP-UX runs *really* slowly unless shared libraries are mode 555, ...\n  postinstall_cmds='chmod 555 $lib'\n  # or fails outright, so override atomically:\n  install_override_mode=555\n  ;;\n\ninterix[3-9]*)\n  version_type=linux # correct to gnu/linux during the next big refactor\n  need_lib_prefix=no\n  need_version=no\n  library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext'\n  soname_spec='$libname$release$shared_ext$major'\n  dynamic_linker='Interix 3.x ld.so.1 (PE, like ELF)'\n  shlibpath_var=LD_LIBRARY_PATH\n  shlibpath_overrides_runpath=no\n  hardcode_into_libs=yes\n  ;;\n\nirix5* | irix6* | nonstopux*)\n  case $host_os in\n    nonstopux*) version_type=nonstopux ;;\n    *)\n\tif test yes = \"$lt_cv_prog_gnu_ld\"; then\n\t\tversion_type=linux # correct to gnu/linux during the next big refactor\n\telse\n\t\tversion_type=irix\n\tfi ;;\n  esac\n  need_lib_prefix=no\n  need_version=no\n  soname_spec='$libname$release$shared_ext$major'\n  library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$release$shared_ext $libname$shared_ext'\n  case $host_os in\n  irix5* | nonstopux*)\n    libsuff= shlibsuff=\n    ;;\n  *)\n    case $LD in # libtool.m4 will add one of these switches to LD\n    *-32|*\"-32 \"|*-melf32bsmip|*\"-melf32bsmip \")\n      libsuff= shlibsuff= libmagic=32-bit;;\n    *-n32|*\"-n32 \"|*-melf32bmipn32|*\"-melf32bmipn32 \")\n      libsuff=32 shlibsuff=N32 libmagic=N32;;\n    *-64|*\"-64 \"|*-melf64bmip|*\"-melf64bmip \")\n      libsuff=64 shlibsuff=64 libmagic=64-bit;;\n    *) libsuff= shlibsuff= libmagic=never-match;;\n    esac\n    ;;\n  esac\n  shlibpath_var=LD_LIBRARY${shlibsuff}_PATH\n  shlibpath_overrides_runpath=no\n  sys_lib_search_path_spec=\"/usr/lib$libsuff /lib$libsuff /usr/local/lib$libsuff\"\n  sys_lib_dlsearch_path_spec=\"/usr/lib$libsuff /lib$libsuff\"\n  hardcode_into_libs=yes\n  ;;\n\n# No shared lib support for Linux oldld, aout, or coff.\nlinux*oldld* | linux*aout* | linux*coff*)\n  dynamic_linker=no\n  ;;\n\nlinux*android*)\n  version_type=none # Android doesn't support versioned libraries.\n  need_lib_prefix=no\n  need_version=no\n  library_names_spec='$libname$release$shared_ext'\n  soname_spec='$libname$release$shared_ext'\n  finish_cmds=\n  shlibpath_var=LD_LIBRARY_PATH\n  shlibpath_overrides_runpath=yes\n\n  # This implies no fast_install, which is unacceptable.\n  # Some rework will be needed to allow for fast_install\n  # before this can be enabled.\n  hardcode_into_libs=yes\n\n  dynamic_linker='Android linker'\n  # Don't embed -rpath directories since the linker doesn't support them.\n  hardcode_libdir_flag_spec_CXX='-L$libdir'\n  ;;\n\n# This must be glibc/ELF.\nlinux* | k*bsd*-gnu | kopensolaris*-gnu | gnu*)\n  version_type=linux # correct to gnu/linux during the next big refactor\n  need_lib_prefix=no\n  need_version=no\n  library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext'\n  soname_spec='$libname$release$shared_ext$major'\n  finish_cmds='PATH=\"\\$PATH:/sbin\" ldconfig -n $libdir'\n  shlibpath_var=LD_LIBRARY_PATH\n  shlibpath_overrides_runpath=no\n\n  # Some binutils ld are patched to set DT_RUNPATH\n  if ${lt_cv_shlibpath_overrides_runpath+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  lt_cv_shlibpath_overrides_runpath=no\n    save_LDFLAGS=$LDFLAGS\n    save_libdir=$libdir\n    eval \"libdir=/foo; wl=\\\"$lt_prog_compiler_wl_CXX\\\"; \\\n\t LDFLAGS=\\\"\\$LDFLAGS $hardcode_libdir_flag_spec_CXX\\\"\"\n    cat confdefs.h - <<_ACEOF >conftest.$ac_ext\n/* end confdefs.h.  */\n\nint\nmain ()\n{\n\n  ;\n  return 0;\n}\n_ACEOF\nif ac_fn_cxx_try_link \"$LINENO\"; then :\n  if  ($OBJDUMP -p conftest$ac_exeext) 2>/dev/null | grep \"RUNPATH.*$libdir\" >/dev/null; then :\n  lt_cv_shlibpath_overrides_runpath=yes\nfi\nfi\nrm -f core conftest.err conftest.$ac_objext \\\n    conftest$ac_exeext conftest.$ac_ext\n    LDFLAGS=$save_LDFLAGS\n    libdir=$save_libdir\n\nfi\n\n  shlibpath_overrides_runpath=$lt_cv_shlibpath_overrides_runpath\n\n  # This implies no fast_install, which is unacceptable.\n  # Some rework will be needed to allow for fast_install\n  # before this can be enabled.\n  hardcode_into_libs=yes\n\n  # Ideally, we could use ldconfig to report *all* directores which are\n  # searched for libraries, however this is still not possible.  Aside from not\n  # being certain /sbin/ldconfig is available, command\n  # 'ldconfig -N -X -v | grep ^/' on 64bit Fedora does not report /usr/lib64,\n  # even though it is searched at run-time.  Try to do the best guess by\n  # appending ld.so.conf contents (and includes) to the search path.\n  if test -f /etc/ld.so.conf; then\n    lt_ld_extra=`awk '/^include / { system(sprintf(\"cd /etc; cat %s 2>/dev/null\", \\$2)); skip = 1; } { if (!skip) print \\$0; skip = 0; }' < /etc/ld.so.conf | $SED -e 's/#.*//;/^[\t ]*hwcap[\t ]/d;s/[:,\t]/ /g;s/=[^=]*$//;s/=[^= ]* / /g;s/\"//g;/^$/d' | tr '\\n' ' '`\n    sys_lib_dlsearch_path_spec=\"/lib /usr/lib $lt_ld_extra\"\n  fi\n\n  # We used to test for /lib/ld.so.1 and disable shared libraries on\n  # powerpc, because MkLinux only supported shared libraries with the\n  # GNU dynamic linker.  Since this was broken with cross compilers,\n  # most powerpc-linux boxes support dynamic linking these days and\n  # people can always --disable-shared, the test was removed, and we\n  # assume the GNU/Linux dynamic linker is in use.\n  dynamic_linker='GNU/Linux ld.so'\n  ;;\n\nnetbsdelf*-gnu)\n  version_type=linux\n  need_lib_prefix=no\n  need_version=no\n  library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${shared_ext}'\n  soname_spec='${libname}${release}${shared_ext}$major'\n  shlibpath_var=LD_LIBRARY_PATH\n  shlibpath_overrides_runpath=no\n  hardcode_into_libs=yes\n  dynamic_linker='NetBSD ld.elf_so'\n  ;;\n\nnetbsd*)\n  version_type=sunos\n  need_lib_prefix=no\n  need_version=no\n  if echo __ELF__ | $CC -E - | $GREP __ELF__ >/dev/null; then\n    library_names_spec='$libname$release$shared_ext$versuffix $libname$shared_ext$versuffix'\n    finish_cmds='PATH=\"\\$PATH:/sbin\" ldconfig -m $libdir'\n    dynamic_linker='NetBSD (a.out) ld.so'\n  else\n    library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext'\n    soname_spec='$libname$release$shared_ext$major'\n    dynamic_linker='NetBSD ld.elf_so'\n  fi\n  shlibpath_var=LD_LIBRARY_PATH\n  shlibpath_overrides_runpath=yes\n  hardcode_into_libs=yes\n  ;;\n\nnewsos6)\n  version_type=linux # correct to gnu/linux during the next big refactor\n  library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext'\n  shlibpath_var=LD_LIBRARY_PATH\n  shlibpath_overrides_runpath=yes\n  ;;\n\n*nto* | *qnx*)\n  version_type=qnx\n  need_lib_prefix=no\n  need_version=no\n  library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext'\n  soname_spec='$libname$release$shared_ext$major'\n  shlibpath_var=LD_LIBRARY_PATH\n  shlibpath_overrides_runpath=no\n  hardcode_into_libs=yes\n  dynamic_linker='ldqnx.so'\n  ;;\n\nopenbsd* | bitrig*)\n  version_type=sunos\n  sys_lib_dlsearch_path_spec=/usr/lib\n  need_lib_prefix=no\n  if test -z \"`echo __ELF__ | $CC -E - | $GREP __ELF__`\"; then\n    need_version=no\n  else\n    need_version=yes\n  fi\n  library_names_spec='$libname$release$shared_ext$versuffix $libname$shared_ext$versuffix'\n  finish_cmds='PATH=\"\\$PATH:/sbin\" ldconfig -m $libdir'\n  shlibpath_var=LD_LIBRARY_PATH\n  shlibpath_overrides_runpath=yes\n  ;;\n\nos2*)\n  libname_spec='$name'\n  version_type=windows\n  shrext_cmds=.dll\n  need_version=no\n  need_lib_prefix=no\n  # OS/2 can only load a DLL with a base name of 8 characters or less.\n  soname_spec='`test -n \"$os2dllname\" && libname=\"$os2dllname\";\n    v=$($ECHO $release$versuffix | tr -d .-);\n    n=$($ECHO $libname | cut -b -$((8 - ${#v})) | tr . _);\n    $ECHO $n$v`$shared_ext'\n  library_names_spec='${libname}_dll.$libext'\n  dynamic_linker='OS/2 ld.exe'\n  shlibpath_var=BEGINLIBPATH\n  sys_lib_search_path_spec=\"/lib /usr/lib /usr/local/lib\"\n  sys_lib_dlsearch_path_spec=$sys_lib_search_path_spec\n  postinstall_cmds='base_file=`basename \\$file`~\n    dlpath=`$SHELL 2>&1 -c '\\''. $dir/'\\''\\$base_file'\\''i; $ECHO \\$dlname'\\''`~\n    dldir=$destdir/`dirname \\$dlpath`~\n    test -d \\$dldir || mkdir -p \\$dldir~\n    $install_prog $dir/$dlname \\$dldir/$dlname~\n    chmod a+x \\$dldir/$dlname~\n    if test -n '\\''$stripme'\\'' && test -n '\\''$striplib'\\''; then\n      eval '\\''$striplib \\$dldir/$dlname'\\'' || exit \\$?;\n    fi'\n  postuninstall_cmds='dldll=`$SHELL 2>&1 -c '\\''. $file; $ECHO \\$dlname'\\''`~\n    dlpath=$dir/\\$dldll~\n    $RM \\$dlpath'\n  ;;\n\nosf3* | osf4* | osf5*)\n  version_type=osf\n  need_lib_prefix=no\n  need_version=no\n  soname_spec='$libname$release$shared_ext$major'\n  library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext'\n  shlibpath_var=LD_LIBRARY_PATH\n  sys_lib_search_path_spec=\"/usr/shlib /usr/ccs/lib /usr/lib/cmplrs/cc /usr/lib /usr/local/lib /var/shlib\"\n  sys_lib_dlsearch_path_spec=$sys_lib_search_path_spec\n  ;;\n\nrdos*)\n  dynamic_linker=no\n  ;;\n\nsolaris*)\n  version_type=linux # correct to gnu/linux during the next big refactor\n  need_lib_prefix=no\n  need_version=no\n  library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext'\n  soname_spec='$libname$release$shared_ext$major'\n  shlibpath_var=LD_LIBRARY_PATH\n  shlibpath_overrides_runpath=yes\n  hardcode_into_libs=yes\n  # ldd complains unless libraries are executable\n  postinstall_cmds='chmod +x $lib'\n  ;;\n\nsunos4*)\n  version_type=sunos\n  library_names_spec='$libname$release$shared_ext$versuffix $libname$shared_ext$versuffix'\n  finish_cmds='PATH=\"\\$PATH:/usr/etc\" ldconfig $libdir'\n  shlibpath_var=LD_LIBRARY_PATH\n  shlibpath_overrides_runpath=yes\n  if test yes = \"$with_gnu_ld\"; then\n    need_lib_prefix=no\n  fi\n  need_version=yes\n  ;;\n\nsysv4 | sysv4.3*)\n  version_type=linux # correct to gnu/linux during the next big refactor\n  library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext'\n  soname_spec='$libname$release$shared_ext$major'\n  shlibpath_var=LD_LIBRARY_PATH\n  case $host_vendor in\n    sni)\n      shlibpath_overrides_runpath=no\n      need_lib_prefix=no\n      runpath_var=LD_RUN_PATH\n      ;;\n    siemens)\n      need_lib_prefix=no\n      ;;\n    motorola)\n      need_lib_prefix=no\n      need_version=no\n      shlibpath_overrides_runpath=no\n      sys_lib_search_path_spec='/lib /usr/lib /usr/ccs/lib'\n      ;;\n  esac\n  ;;\n\nsysv4*MP*)\n  if test -d /usr/nec; then\n    version_type=linux # correct to gnu/linux during the next big refactor\n    library_names_spec='$libname$shared_ext.$versuffix $libname$shared_ext.$major $libname$shared_ext'\n    soname_spec='$libname$shared_ext.$major'\n    shlibpath_var=LD_LIBRARY_PATH\n  fi\n  ;;\n\nsysv5* | sco3.2v5* | sco5v6* | unixware* | OpenUNIX* | sysv4*uw2*)\n  version_type=sco\n  need_lib_prefix=no\n  need_version=no\n  library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext $libname$shared_ext'\n  soname_spec='$libname$release$shared_ext$major'\n  shlibpath_var=LD_LIBRARY_PATH\n  shlibpath_overrides_runpath=yes\n  hardcode_into_libs=yes\n  if test yes = \"$with_gnu_ld\"; then\n    sys_lib_search_path_spec='/usr/local/lib /usr/gnu/lib /usr/ccs/lib /usr/lib /lib'\n  else\n    sys_lib_search_path_spec='/usr/ccs/lib /usr/lib'\n    case $host_os in\n      sco3.2v5*)\n        sys_lib_search_path_spec=\"$sys_lib_search_path_spec /lib\"\n\t;;\n    esac\n  fi\n  sys_lib_dlsearch_path_spec='/usr/lib'\n  ;;\n\ntpf*)\n  # TPF is a cross-target only.  Preferred cross-host = GNU/Linux.\n  version_type=linux # correct to gnu/linux during the next big refactor\n  need_lib_prefix=no\n  need_version=no\n  library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext'\n  shlibpath_var=LD_LIBRARY_PATH\n  shlibpath_overrides_runpath=no\n  hardcode_into_libs=yes\n  ;;\n\nuts4*)\n  version_type=linux # correct to gnu/linux during the next big refactor\n  library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext'\n  soname_spec='$libname$release$shared_ext$major'\n  shlibpath_var=LD_LIBRARY_PATH\n  ;;\n\n*)\n  dynamic_linker=no\n  ;;\nesac\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $dynamic_linker\" >&5\n$as_echo \"$dynamic_linker\" >&6; }\ntest no = \"$dynamic_linker\" && can_build_shared=no\n\nvariables_saved_for_relink=\"PATH $shlibpath_var $runpath_var\"\nif test yes = \"$GCC\"; then\n  variables_saved_for_relink=\"$variables_saved_for_relink GCC_EXEC_PREFIX COMPILER_PATH LIBRARY_PATH\"\nfi\n\nif test set = \"${lt_cv_sys_lib_search_path_spec+set}\"; then\n  sys_lib_search_path_spec=$lt_cv_sys_lib_search_path_spec\nfi\n\nif test set = \"${lt_cv_sys_lib_dlsearch_path_spec+set}\"; then\n  sys_lib_dlsearch_path_spec=$lt_cv_sys_lib_dlsearch_path_spec\nfi\n\n# remember unaugmented sys_lib_dlsearch_path content for libtool script decls...\nconfigure_time_dlsearch_path=$sys_lib_dlsearch_path_spec\n\n# ... but it needs LT_SYS_LIBRARY_PATH munging for other configure-time code\nfunc_munge_path_list sys_lib_dlsearch_path_spec \"$LT_SYS_LIBRARY_PATH\"\n\n# to be used as default LT_SYS_LIBRARY_PATH value in generated libtool\nconfigure_time_lt_sys_library_path=$LT_SYS_LIBRARY_PATH\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n    { $as_echo \"$as_me:${as_lineno-$LINENO}: checking how to hardcode library paths into programs\" >&5\n$as_echo_n \"checking how to hardcode library paths into programs... \" >&6; }\nhardcode_action_CXX=\nif test -n \"$hardcode_libdir_flag_spec_CXX\" ||\n   test -n \"$runpath_var_CXX\" ||\n   test yes = \"$hardcode_automatic_CXX\"; then\n\n  # We can hardcode non-existent directories.\n  if test no != \"$hardcode_direct_CXX\" &&\n     # If the only mechanism to avoid hardcoding is shlibpath_var, we\n     # have to relink, otherwise we might link with an installed library\n     # when we should be linking with a yet-to-be-installed one\n     ## test no != \"$_LT_TAGVAR(hardcode_shlibpath_var, CXX)\" &&\n     test no != \"$hardcode_minus_L_CXX\"; then\n    # Linking always hardcodes the temporary library directory.\n    hardcode_action_CXX=relink\n  else\n    # We can link without hardcoding, and we can hardcode nonexisting dirs.\n    hardcode_action_CXX=immediate\n  fi\nelse\n  # We cannot hardcode anything, or else we can only hardcode existing\n  # directories.\n  hardcode_action_CXX=unsupported\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $hardcode_action_CXX\" >&5\n$as_echo \"$hardcode_action_CXX\" >&6; }\n\nif test relink = \"$hardcode_action_CXX\" ||\n   test yes = \"$inherit_rpath_CXX\"; then\n  # Fast installation is not supported\n  enable_fast_install=no\nelif test yes = \"$shlibpath_overrides_runpath\" ||\n     test no = \"$enable_shared\"; then\n  # Fast installation is not necessary\n  enable_fast_install=needless\nfi\n\n\n\n\n\n\n\n  fi # test -n \"$compiler\"\n\n  CC=$lt_save_CC\n  CFLAGS=$lt_save_CFLAGS\n  LDCXX=$LD\n  LD=$lt_save_LD\n  GCC=$lt_save_GCC\n  with_gnu_ld=$lt_save_with_gnu_ld\n  lt_cv_path_LDCXX=$lt_cv_path_LD\n  lt_cv_path_LD=$lt_save_path_LD\n  lt_cv_prog_gnu_ldcxx=$lt_cv_prog_gnu_ld\n  lt_cv_prog_gnu_ld=$lt_save_with_gnu_ld\nfi # test yes != \"$_lt_caught_CXX_error\"\n\nac_ext=c\nac_cpp='$CPP $CPPFLAGS'\nac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5'\nac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5'\nac_compiler_gnu=$ac_cv_c_compiler_gnu\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n        ac_config_commands=\"$ac_config_commands libtool\"\n\n\n\n\n# Only expand once:\n\n\n\nac_config_headers=\"$ac_config_headers config.h src/include/fst/config.h\"\n\n\nac_config_files=\"$ac_config_files Makefile src/Makefile src/include/Makefile src/lib/Makefile src/bin/Makefile src/test/Makefile src/extensions/Makefile src/extensions/compact/Makefile src/extensions/compress/Makefile src/extensions/const/Makefile src/extensions/far/Makefile src/extensions/linear/Makefile src/extensions/lookahead/Makefile src/extensions/mpdt/Makefile src/extensions/ngram/Makefile src/extensions/pdt/Makefile src/extensions/python/Makefile src/extensions/special/Makefile src/script/Makefile\"\n\n\nac_ext=cpp\nac_cpp='$CXXCPP $CPPFLAGS'\nac_compile='$CXX -c $CXXFLAGS $CPPFLAGS conftest.$ac_ext >&5'\nac_link='$CXX -o conftest$ac_exeext $CXXFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5'\nac_compiler_gnu=$ac_cv_cxx_compiler_gnu\n\n\n# Check whether --enable-compact-fsts was given.\nif test \"${enable_compact_fsts+set}\" = set; then :\n  enableval=$enable_compact_fsts;\nelse\n  enable_compact_fsts=no\nfi\n\n if test \"x$enable_compact_fsts\" != xno; then\n  HAVE_COMPACT_TRUE=\n  HAVE_COMPACT_FALSE='#'\nelse\n  HAVE_COMPACT_TRUE='#'\n  HAVE_COMPACT_FALSE=\nfi\n\n\n# Check whether --enable-compress was given.\nif test \"${enable_compress+set}\" = set; then :\n  enableval=$enable_compress;\nelse\n  enable_compress=no\nfi\n\n if test \"x$enable_compress\" != xno; then\n  HAVE_COMPRESS_TRUE=\n  HAVE_COMPRESS_FALSE='#'\nelse\n  HAVE_COMPRESS_TRUE='#'\n  HAVE_COMPRESS_FALSE=\nfi\n\n\n# Check whether --enable-const-fsts was given.\nif test \"${enable_const_fsts+set}\" = set; then :\n  enableval=$enable_const_fsts;\nelse\n  enable_const_fsts=no\nfi\n\n if test \"x$enable_const_fsts\" != xno; then\n  HAVE_CONST_TRUE=\n  HAVE_CONST_FALSE='#'\nelse\n  HAVE_CONST_TRUE='#'\n  HAVE_CONST_FALSE=\nfi\n\n\n# Check whether --enable-far was given.\nif test \"${enable_far+set}\" = set; then :\n  enableval=$enable_far;\nelse\n  enable_far=no\nfi\n\n if test \"x$enable_far\" != xno; then\n  HAVE_FAR_TRUE=\n  HAVE_FAR_FALSE='#'\nelse\n  HAVE_FAR_TRUE='#'\n  HAVE_FAR_FALSE=\nfi\n\n\n# Check whether --enable-linear-fsts was given.\nif test \"${enable_linear_fsts+set}\" = set; then :\n  enableval=$enable_linear_fsts;\nelse\n  enable_linear_fsts=no\nfi\n\n if test \"x$enable_linear_fsts\" != xno; then\n  HAVE_LINEAR_TRUE=\n  HAVE_LINEAR_FALSE='#'\nelse\n  HAVE_LINEAR_TRUE='#'\n  HAVE_LINEAR_FALSE=\nfi\n\n\n# Check whether --enable-lookahead-fsts was given.\nif test \"${enable_lookahead_fsts+set}\" = set; then :\n  enableval=$enable_lookahead_fsts;\nelse\n  enable_lookahead_fsts=no\nfi\n\n if test \"x$enable_lookahead_fsts\" != xno; then\n  HAVE_LOOKAHEAD_TRUE=\n  HAVE_LOOKAHEAD_FALSE='#'\nelse\n  HAVE_LOOKAHEAD_TRUE='#'\n  HAVE_LOOKAHEAD_FALSE=\nfi\n\n\n# Check whether --enable-mpdt was given.\nif test \"${enable_mpdt+set}\" = set; then :\n  enableval=$enable_mpdt;\nelse\n  enable_mpdt=no\nfi\n\n if test \"x$enable_mpdt\" != xno; then\n  HAVE_MPDT_TRUE=\n  HAVE_MPDT_FALSE='#'\nelse\n  HAVE_MPDT_TRUE='#'\n  HAVE_MPDT_FALSE=\nfi\n\n\n# Check whether --enable-ngram-fsts was given.\nif test \"${enable_ngram_fsts+set}\" = set; then :\n  enableval=$enable_ngram_fsts;\nelse\n  enable_ngram_fsts=no\nfi\n\n if test \"x$enable_ngram_fsts\" != xno; then\n  HAVE_NGRAM_TRUE=\n  HAVE_NGRAM_FALSE='#'\nelse\n  HAVE_NGRAM_TRUE='#'\n  HAVE_NGRAM_FALSE=\nfi\n\n\n# Check whether --enable-pdt was given.\nif test \"${enable_pdt+set}\" = set; then :\n  enableval=$enable_pdt;\nelse\n  enable_pdt=no\nfi\n\n if test \"x$enable_pdt\" != xno; then\n  HAVE_PDT_TRUE=\n  HAVE_PDT_FALSE='#'\nelse\n  HAVE_PDT_TRUE='#'\n  HAVE_PDT_FALSE=\nfi\n\n\n# Check whether --enable-python was given.\nif test \"${enable_python+set}\" = set; then :\n  enableval=$enable_python;\nelse\n  enable_python=no\nfi\n\n if test \"x$enable_python\" != xno; then\n  HAVE_PYTHON_TRUE=\n  HAVE_PYTHON_FALSE='#'\nelse\n  HAVE_PYTHON_TRUE='#'\n  HAVE_PYTHON_FALSE=\nfi\n\nif test \"x$enable_python\" != xno; then\n\n\n\n\n\n\n        if test -n \"$PYTHON\"; then\n      # If the user set $PYTHON, use it and don't search something else.\n      { $as_echo \"$as_me:${as_lineno-$LINENO}: checking whether $PYTHON version is >= 2.7\" >&5\n$as_echo_n \"checking whether $PYTHON version is >= 2.7... \" >&6; }\n      prog=\"import sys\n# split strings by '.' and convert to numeric.  Append some zeros\n# because we need at least 4 digits for the hex conversion.\n# map returns an iterator in Python 3.0 and a list in 2.x\nminver = list(map(int, '2.7'.split('.'))) + [0, 0, 0]\nminverhex = 0\n# xrange is not present in Python 3.0 and range returns an iterator\nfor i in list(range(0, 4)): minverhex = (minverhex << 8) + minver[i]\nsys.exit(sys.hexversion < minverhex)\"\n  if { echo \"$as_me:$LINENO: $PYTHON -c \"$prog\"\" >&5\n   ($PYTHON -c \"$prog\") >&5 2>&5\n   ac_status=$?\n   echo \"$as_me:$LINENO: \\$? = $ac_status\" >&5\n   (exit $ac_status); }; then :\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: yes\" >&5\n$as_echo \"yes\" >&6; }\nelse\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: no\" >&5\n$as_echo \"no\" >&6; }\n\t\t\t       as_fn_error $? \"Python interpreter is too old\" \"$LINENO\" 5\nfi\n      am_display_PYTHON=$PYTHON\n    else\n      # Otherwise, try each interpreter until we find one that satisfies\n      # VERSION.\n      { $as_echo \"$as_me:${as_lineno-$LINENO}: checking for a Python interpreter with version >= 2.7\" >&5\n$as_echo_n \"checking for a Python interpreter with version >= 2.7... \" >&6; }\nif ${am_cv_pathless_PYTHON+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n\n\tfor am_cv_pathless_PYTHON in python python2 python3 python3.8 python3.7 python3.6 python3.5 python3.4 python3.3 python3.2 python3.1 python3.0 python2.7  python2.6 python2.5 python2.4 python2.3 python2.2 python2.1 python2.0 none; do\n\t  test \"$am_cv_pathless_PYTHON\" = none && break\n\t  prog=\"import sys\n# split strings by '.' and convert to numeric.  Append some zeros\n# because we need at least 4 digits for the hex conversion.\n# map returns an iterator in Python 3.0 and a list in 2.x\nminver = list(map(int, '2.7'.split('.'))) + [0, 0, 0]\nminverhex = 0\n# xrange is not present in Python 3.0 and range returns an iterator\nfor i in list(range(0, 4)): minverhex = (minverhex << 8) + minver[i]\nsys.exit(sys.hexversion < minverhex)\"\n  if { echo \"$as_me:$LINENO: $am_cv_pathless_PYTHON -c \"$prog\"\" >&5\n   ($am_cv_pathless_PYTHON -c \"$prog\") >&5 2>&5\n   ac_status=$?\n   echo \"$as_me:$LINENO: \\$? = $ac_status\" >&5\n   (exit $ac_status); }; then :\n  break\nfi\n\tdone\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $am_cv_pathless_PYTHON\" >&5\n$as_echo \"$am_cv_pathless_PYTHON\" >&6; }\n      # Set $PYTHON to the absolute path of $am_cv_pathless_PYTHON.\n      if test \"$am_cv_pathless_PYTHON\" = none; then\n\tPYTHON=:\n      else\n        # Extract the first word of \"$am_cv_pathless_PYTHON\", so it can be a program name with args.\nset dummy $am_cv_pathless_PYTHON; ac_word=$2\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for $ac_word\" >&5\n$as_echo_n \"checking for $ac_word... \" >&6; }\nif ${ac_cv_path_PYTHON+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  case $PYTHON in\n  [\\\\/]* | ?:[\\\\/]*)\n  ac_cv_path_PYTHON=\"$PYTHON\" # Let the user override the test with a path.\n  ;;\n  *)\n  as_save_IFS=$IFS; IFS=$PATH_SEPARATOR\nfor as_dir in $PATH\ndo\n  IFS=$as_save_IFS\n  test -z \"$as_dir\" && as_dir=.\n    for ac_exec_ext in '' $ac_executable_extensions; do\n  if as_fn_executable_p \"$as_dir/$ac_word$ac_exec_ext\"; then\n    ac_cv_path_PYTHON=\"$as_dir/$ac_word$ac_exec_ext\"\n    $as_echo \"$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext\" >&5\n    break 2\n  fi\ndone\n  done\nIFS=$as_save_IFS\n\n  ;;\nesac\nfi\nPYTHON=$ac_cv_path_PYTHON\nif test -n \"$PYTHON\"; then\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: $PYTHON\" >&5\n$as_echo \"$PYTHON\" >&6; }\nelse\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: no\" >&5\n$as_echo \"no\" >&6; }\nfi\n\n\n      fi\n      am_display_PYTHON=$am_cv_pathless_PYTHON\n    fi\n\n\n  if test \"$PYTHON\" = :; then\n      as_fn_error $? \"no suitable Python interpreter found\" \"$LINENO\" 5\n  else\n\n\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: checking for $am_display_PYTHON version\" >&5\n$as_echo_n \"checking for $am_display_PYTHON version... \" >&6; }\nif ${am_cv_python_version+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  am_cv_python_version=`$PYTHON -c \"import sys; sys.stdout.write(sys.version[:3])\"`\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $am_cv_python_version\" >&5\n$as_echo \"$am_cv_python_version\" >&6; }\n  PYTHON_VERSION=$am_cv_python_version\n\n\n\n  PYTHON_PREFIX='${prefix}'\n\n  PYTHON_EXEC_PREFIX='${exec_prefix}'\n\n\n\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: checking for $am_display_PYTHON platform\" >&5\n$as_echo_n \"checking for $am_display_PYTHON platform... \" >&6; }\nif ${am_cv_python_platform+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  am_cv_python_platform=`$PYTHON -c \"import sys; sys.stdout.write(sys.platform)\"`\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $am_cv_python_platform\" >&5\n$as_echo \"$am_cv_python_platform\" >&6; }\n  PYTHON_PLATFORM=$am_cv_python_platform\n\n\n  # Just factor out some code duplication.\n  am_python_setup_sysconfig=\"\\\nimport sys\n# Prefer sysconfig over distutils.sysconfig, for better compatibility\n# with python 3.x.  See automake bug#10227.\ntry:\n    import sysconfig\nexcept ImportError:\n    can_use_sysconfig = 0\nelse:\n    can_use_sysconfig = 1\n# Can't use sysconfig in CPython 2.7, since it's broken in virtualenvs:\n# <https://github.com/pypa/virtualenv/issues/118>\ntry:\n    from platform import python_implementation\n    if python_implementation() == 'CPython' and sys.version[:3] == '2.7':\n        can_use_sysconfig = 0\nexcept ImportError:\n    pass\"\n\n\n            { $as_echo \"$as_me:${as_lineno-$LINENO}: checking for $am_display_PYTHON script directory\" >&5\n$as_echo_n \"checking for $am_display_PYTHON script directory... \" >&6; }\nif ${am_cv_python_pythondir+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  if test \"x$prefix\" = xNONE\n     then\n       am_py_prefix=$ac_default_prefix\n     else\n       am_py_prefix=$prefix\n     fi\n     am_cv_python_pythondir=`$PYTHON -c \"\n$am_python_setup_sysconfig\nif can_use_sysconfig:\n    sitedir = sysconfig.get_path('purelib', vars={'base':'$am_py_prefix'})\nelse:\n    from distutils import sysconfig\n    sitedir = sysconfig.get_python_lib(0, 0, prefix='$am_py_prefix')\nsys.stdout.write(sitedir)\"`\n     case $am_cv_python_pythondir in\n     $am_py_prefix*)\n       am__strip_prefix=`echo \"$am_py_prefix\" | sed 's|.|.|g'`\n       am_cv_python_pythondir=`echo \"$am_cv_python_pythondir\" | sed \"s,^$am__strip_prefix,$PYTHON_PREFIX,\"`\n       ;;\n     *)\n       case $am_py_prefix in\n         /usr|/System*) ;;\n         *)\n\t  am_cv_python_pythondir=$PYTHON_PREFIX/lib/python$PYTHON_VERSION/site-packages\n\t  ;;\n       esac\n       ;;\n     esac\n\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $am_cv_python_pythondir\" >&5\n$as_echo \"$am_cv_python_pythondir\" >&6; }\n  pythondir=$am_cv_python_pythondir\n\n\n\n  pkgpythondir=\\${pythondir}/$PACKAGE\n\n\n        { $as_echo \"$as_me:${as_lineno-$LINENO}: checking for $am_display_PYTHON extension module directory\" >&5\n$as_echo_n \"checking for $am_display_PYTHON extension module directory... \" >&6; }\nif ${am_cv_python_pyexecdir+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  if test \"x$exec_prefix\" = xNONE\n     then\n       am_py_exec_prefix=$am_py_prefix\n     else\n       am_py_exec_prefix=$exec_prefix\n     fi\n     am_cv_python_pyexecdir=`$PYTHON -c \"\n$am_python_setup_sysconfig\nif can_use_sysconfig:\n    sitedir = sysconfig.get_path('platlib', vars={'platbase':'$am_py_prefix'})\nelse:\n    from distutils import sysconfig\n    sitedir = sysconfig.get_python_lib(1, 0, prefix='$am_py_prefix')\nsys.stdout.write(sitedir)\"`\n     case $am_cv_python_pyexecdir in\n     $am_py_exec_prefix*)\n       am__strip_prefix=`echo \"$am_py_exec_prefix\" | sed 's|.|.|g'`\n       am_cv_python_pyexecdir=`echo \"$am_cv_python_pyexecdir\" | sed \"s,^$am__strip_prefix,$PYTHON_EXEC_PREFIX,\"`\n       ;;\n     *)\n       case $am_py_exec_prefix in\n         /usr|/System*) ;;\n         *)\n\t   am_cv_python_pyexecdir=$PYTHON_EXEC_PREFIX/lib/python$PYTHON_VERSION/site-packages\n\t   ;;\n       esac\n       ;;\n     esac\n\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $am_cv_python_pyexecdir\" >&5\n$as_echo \"$am_cv_python_pyexecdir\" >&6; }\n  pyexecdir=$am_cv_python_pyexecdir\n\n\n\n  pkgpyexecdir=\\${pyexecdir}/$PACKAGE\n\n\n\n  fi\n\n\n\n\t#\n\t# Allow the use of a (user set) custom python version\n\t#\n\n\n\t# Extract the first word of \"python[$PYTHON_VERSION]\", so it can be a program name with args.\nset dummy python$PYTHON_VERSION; ac_word=$2\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for $ac_word\" >&5\n$as_echo_n \"checking for $ac_word... \" >&6; }\nif ${ac_cv_path_PYTHON+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  case $PYTHON in\n  [\\\\/]* | ?:[\\\\/]*)\n  ac_cv_path_PYTHON=\"$PYTHON\" # Let the user override the test with a path.\n  ;;\n  *)\n  as_save_IFS=$IFS; IFS=$PATH_SEPARATOR\nfor as_dir in $PATH\ndo\n  IFS=$as_save_IFS\n  test -z \"$as_dir\" && as_dir=.\n    for ac_exec_ext in '' $ac_executable_extensions; do\n  if as_fn_executable_p \"$as_dir/$ac_word$ac_exec_ext\"; then\n    ac_cv_path_PYTHON=\"$as_dir/$ac_word$ac_exec_ext\"\n    $as_echo \"$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext\" >&5\n    break 2\n  fi\ndone\n  done\nIFS=$as_save_IFS\n\n  ;;\nesac\nfi\nPYTHON=$ac_cv_path_PYTHON\nif test -n \"$PYTHON\"; then\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: $PYTHON\" >&5\n$as_echo \"$PYTHON\" >&6; }\nelse\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: result: no\" >&5\n$as_echo \"no\" >&6; }\nfi\n\n\n\tif test -z \"$PYTHON\"; then\n\t   as_fn_error $? \"Cannot find python$PYTHON_VERSION in your system path\" \"$LINENO\" 5\n\t   PYTHON_VERSION=\"\"\n\tfi\n\n\t#\n\t# Check for a version of Python >= 2.1.0\n\t#\n\t{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for a version of Python >= '2.1.0'\" >&5\n$as_echo_n \"checking for a version of Python >= '2.1.0'... \" >&6; }\n\tac_supports_python_ver=`$PYTHON -c \"import sys, string; \\\n\t\tver = string.split(sys.version)[0]; \\\n\t\tprint ver >= '2.1.0'\"`\n\tif test \"$ac_supports_python_ver\" != \"True\"; then\n\t\tif test -z \"$PYTHON_NOVERSIONCHECK\"; then\n\t\t\t{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: no\" >&5\n$as_echo \"no\" >&6; }\n\t\t\t{ { $as_echo \"$as_me:${as_lineno-$LINENO}: error: in \\`$ac_pwd':\" >&5\n$as_echo \"$as_me: error: in \\`$ac_pwd':\" >&2;}\nas_fn_error $? \"\nThis version of the AC_PYTHON_DEVEL macro\ndoesn't work properly with versions of Python before\n2.1.0. You may need to re-run configure, setting the\nvariables PYTHON_CPPFLAGS, PYTHON_LDFLAGS, PYTHON_SITE_PKG,\nPYTHON_EXTRA_LIBS and PYTHON_EXTRA_LDFLAGS by hand.\nMoreover, to disable this check, set PYTHON_NOVERSIONCHECK\nto something else than an empty string.\n\nSee \\`config.log' for more details\" \"$LINENO\" 5; }\n\t\telse\n\t\t\t{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: skip at user request\" >&5\n$as_echo \"skip at user request\" >&6; }\n\t\tfi\n\telse\n\t\t{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: yes\" >&5\n$as_echo \"yes\" >&6; }\n\tfi\n\n\t#\n\t# if the macro parameter ``version'' is set, honour it\n\t#\n\tif test -n \">= '2.7'\"; then\n\t\t{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for a version of Python >= '2.7'\" >&5\n$as_echo_n \"checking for a version of Python >= '2.7'... \" >&6; }\n\t\tac_supports_python_ver=`$PYTHON -c \"import sys, string; \\\n\t\t\tver = string.split(sys.version)[0]; \\\n\t\t\tprint ver >= '2.7'\"`\n\t\tif test \"$ac_supports_python_ver\" = \"True\"; then\n\t   \t   { $as_echo \"$as_me:${as_lineno-$LINENO}: result: yes\" >&5\n$as_echo \"yes\" >&6; }\n\t\telse\n\t\t\t{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: no\" >&5\n$as_echo \"no\" >&6; }\n\t\t\tas_fn_error $? \"this package requires Python >= '2.7'.\nIf you have it installed, but it isn't the default Python\ninterpreter in your system path, please pass the PYTHON_VERSION\nvariable to configure. See \\`\\`configure --help'' for reference.\n\" \"$LINENO\" 5\n\t\t\tPYTHON_VERSION=\"\"\n\t\tfi\n\tfi\n\n\t#\n\t# Check if you have distutils, else fail\n\t#\n\t{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for the distutils Python package\" >&5\n$as_echo_n \"checking for the distutils Python package... \" >&6; }\n\tac_distutils_result=`$PYTHON -c \"import distutils\" 2>&1`\n\tif test -z \"$ac_distutils_result\"; then\n\t\t{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: yes\" >&5\n$as_echo \"yes\" >&6; }\n\telse\n\t\t{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: no\" >&5\n$as_echo \"no\" >&6; }\n\t\tas_fn_error $? \"cannot import Python module \\\"distutils\\\".\nPlease check your Python installation. The error was:\n$ac_distutils_result\" \"$LINENO\" 5\n\t\tPYTHON_VERSION=\"\"\n\tfi\n\n\t#\n\t# Check for Python include path\n\t#\n\t{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for Python include path\" >&5\n$as_echo_n \"checking for Python include path... \" >&6; }\n\tif test -z \"$PYTHON_CPPFLAGS\"; then\n\t\tpython_path=`$PYTHON -c \"import distutils.sysconfig; \\\n           \t\tprint distutils.sysconfig.get_python_inc();\"`\n\t\tif test -n \"${python_path}\"; then\n\t\t   \tpython_path=\"-I$python_path\"\n\t\tfi\n\t\tPYTHON_CPPFLAGS=$python_path\n\tfi\n\t{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $PYTHON_CPPFLAGS\" >&5\n$as_echo \"$PYTHON_CPPFLAGS\" >&6; }\n\n\n\t#\n\t# Check for Python library path\n\t#\n\t{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for Python library path\" >&5\n$as_echo_n \"checking for Python library path... \" >&6; }\n\tif test -z \"$PYTHON_LDFLAGS\"; then\n\t\t# (makes two attempts to ensure we've got a version number\n\t\t# from the interpreter)\n\t\tpy_version=`$PYTHON -c \"from distutils.sysconfig import *; \\\n\t\t\tfrom string import join; \\\n\t\t\tprint join(get_config_vars('VERSION'))\"`\n\t\tif test \"$py_version\" == \"None\"; then\n\t\t\tif test -n \"$PYTHON_VERSION\"; then\n\t\t\t\tpy_version=$PYTHON_VERSION\n\t\t\telse\n\t\t\t\tpy_version=`$PYTHON -c \"import sys; \\\n\t\t\t\t\tprint sys.version[:3]\"`\n\t\t\tfi\n\t\tfi\n\n\t\tPYTHON_LDFLAGS=`$PYTHON -c \"from distutils.sysconfig import *; \\\n\t\t\tfrom string import join; \\\n\t\t\tprint '-L' + get_python_lib(0,1), \\\n\t\t      \t'-lpython';\"`$py_version\n\tfi\n\t{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $PYTHON_LDFLAGS\" >&5\n$as_echo \"$PYTHON_LDFLAGS\" >&6; }\n\n\n\t#\n\t# Check for site packages\n\t#\n\t{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for Python site-packages path\" >&5\n$as_echo_n \"checking for Python site-packages path... \" >&6; }\n\tif test -z \"$PYTHON_SITE_PKG\"; then\n\t\tPYTHON_SITE_PKG=`$PYTHON -c \"import distutils.sysconfig; \\\n\t\t        print distutils.sysconfig.get_python_lib(0,0);\"`\n\tfi\n\t{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $PYTHON_SITE_PKG\" >&5\n$as_echo \"$PYTHON_SITE_PKG\" >&6; }\n\n\n\t#\n\t# libraries which must be linked in when embedding\n\t#\n\t{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking python extra libraries\" >&5\n$as_echo_n \"checking python extra libraries... \" >&6; }\n\tif test -z \"$PYTHON_EXTRA_LIBS\"; then\n\t   PYTHON_EXTRA_LIBS=`$PYTHON -c \"import distutils.sysconfig; \\\n                conf = distutils.sysconfig.get_config_var; \\\n                print conf('LOCALMODLIBS'), conf('LIBS')\"`\n\tfi\n\t{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $PYTHON_EXTRA_LIBS\" >&5\n$as_echo \"$PYTHON_EXTRA_LIBS\" >&6; }\n\n\n\t#\n\t# linking flags needed when embedding\n\t#\n\t{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking python extra linking flags\" >&5\n$as_echo_n \"checking python extra linking flags... \" >&6; }\n\tif test -z \"$PYTHON_EXTRA_LDFLAGS\"; then\n\t\tPYTHON_EXTRA_LDFLAGS=`$PYTHON -c \"import distutils.sysconfig; \\\n\t\t\tconf = distutils.sysconfig.get_config_var; \\\n\t\t\tprint conf('LINKFORSHARED')\"`\n\tfi\n\t{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $PYTHON_EXTRA_LDFLAGS\" >&5\n$as_echo \"$PYTHON_EXTRA_LDFLAGS\" >&6; }\n\n\n\t#\n\t# final check to see if everything compiles alright\n\t#\n\t{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking consistency of all components of python development environment\" >&5\n$as_echo_n \"checking consistency of all components of python development environment... \" >&6; }\n\tac_ext=c\nac_cpp='$CPP $CPPFLAGS'\nac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5'\nac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5'\nac_compiler_gnu=$ac_cv_c_compiler_gnu\n\n\t# save current global flags\n\tLIBS=\"$ac_save_LIBS $PYTHON_LDFLAGS\"\n\tCPPFLAGS=\"$ac_save_CPPFLAGS $PYTHON_CPPFLAGS\"\n\tcat confdefs.h - <<_ACEOF >conftest.$ac_ext\n/* end confdefs.h.  */\n\n\t\t#include <Python.h>\n\nint\nmain ()\n{\n\n\t\tPy_Initialize();\n\n  ;\n  return 0;\n}\n_ACEOF\nif ac_fn_c_try_link \"$LINENO\"; then :\n  pythonexists=yes\nelse\n  pythonexists=no\nfi\nrm -f core conftest.err conftest.$ac_objext \\\n    conftest$ac_exeext conftest.$ac_ext\n\n\t{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $pythonexists\" >&5\n$as_echo \"$pythonexists\" >&6; }\n\n        if test ! \"$pythonexists\" = \"yes\"; then\n\t   as_fn_error $? \"\n  Could not link test program to Python. Maybe the main Python library has been\n  installed in some non-standard library path. If so, pass it to configure,\n  via the LDFLAGS environment variable.\n  Example: ./configure LDFLAGS=\\\"-L/usr/non-standard-path/python/lib\\\"\n  ============================================================================\n   ERROR!\n   You probably have to install the development version of the Python package\n   for your distribution.  The exact name of this package varies among them.\n  ============================================================================\n\t   \" \"$LINENO\" 5\n\t  PYTHON_VERSION=\"\"\n\tfi\n\tac_ext=cpp\nac_cpp='$CXXCPP $CPPFLAGS'\nac_compile='$CXX -c $CXXFLAGS $CPPFLAGS conftest.$ac_ext >&5'\nac_link='$CXX -o conftest$ac_exeext $CXXFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5'\nac_compiler_gnu=$ac_cv_cxx_compiler_gnu\n\n\t# turn back to default flags\n\tCPPFLAGS=\"$ac_save_CPPFLAGS\"\n\tLIBS=\"$ac_save_LIBS\"\n\n\t#\n\t# all done!\n\t#\n\nfi\n\n# Check whether --enable-special was given.\nif test \"${enable_special+set}\" = set; then :\n  enableval=$enable_special;\nelse\n  enable_special=no\nfi\n\n if test \"x$enable_special\" != xno; then\n  HAVE_SPECIAL_TRUE=\n  HAVE_SPECIAL_FALSE='#'\nelse\n  HAVE_SPECIAL_TRUE='#'\n  HAVE_SPECIAL_FALSE=\nfi\n\n\n# --enable-bin enables script and bin \"extensions\".\n# Check whether --enable-bin was given.\nif test \"${enable_bin+set}\" = set; then :\n  enableval=$enable_bin;\nelse\n  enable_bin=yes\nfi\n\n if test \"x$enable_bin\" != xno; then\n  HAVE_BIN_TRUE=\n  HAVE_BIN_FALSE='#'\nelse\n  HAVE_BIN_TRUE='#'\n  HAVE_BIN_FALSE=\nfi\n\n if test \"x$enable_bin\" != xno; then\n  HAVE_SCRIPT_TRUE=\n  HAVE_SCRIPT_FALSE='#'\nelse\n  HAVE_SCRIPT_TRUE='#'\n  HAVE_SCRIPT_FALSE=\nfi\n\n\n# --enable-grm enables dependencies of OpenGrm: far, mpdt, and pdt.\n# Check whether --enable-grm was given.\nif test \"${enable_grm+set}\" = set; then :\n  enableval=$enable_grm;\nelse\n  enable_grm=no\nfi\n\n if test \"x$enable_grm\" != xno; then\n  HAVE_GRM_TRUE=\n  HAVE_GRM_FALSE='#'\nelse\n  HAVE_GRM_TRUE='#'\n  HAVE_GRM_FALSE=\nfi\n\n\n\n# Check whether --with-libfstdir was given.\nif test \"${with_libfstdir+set}\" = set; then :\n  withval=$with_libfstdir;\nelse\n  with_libfstdir=${libdir}/fst\nfi\n\n\nlibfstdir=$with_libfstdir\n\n\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking for dlopen in -ldl\" >&5\n$as_echo_n \"checking for dlopen in -ldl... \" >&6; }\nif ${ac_cv_lib_dl_dlopen+:} false; then :\n  $as_echo_n \"(cached) \" >&6\nelse\n  ac_check_lib_save_LIBS=$LIBS\nLIBS=\"-ldl  $LIBS\"\ncat confdefs.h - <<_ACEOF >conftest.$ac_ext\n/* end confdefs.h.  */\n\n/* Override any GCC internal prototype to avoid an error.\n   Use char because int might match the return type of a GCC\n   builtin and then its argument prototype would still apply.  */\n#ifdef __cplusplus\nextern \"C\"\n#endif\nchar dlopen ();\nint\nmain ()\n{\nreturn dlopen ();\n  ;\n  return 0;\n}\n_ACEOF\nif ac_fn_cxx_try_link \"$LINENO\"; then :\n  ac_cv_lib_dl_dlopen=yes\nelse\n  ac_cv_lib_dl_dlopen=no\nfi\nrm -f core conftest.err conftest.$ac_objext \\\n    conftest$ac_exeext conftest.$ac_ext\nLIBS=$ac_check_lib_save_LIBS\nfi\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_dl_dlopen\" >&5\n$as_echo \"$ac_cv_lib_dl_dlopen\" >&6; }\nif test \"x$ac_cv_lib_dl_dlopen\" = xyes; then :\n  DL_LIBS=-ldl\nfi\n\n\n\ncat >confcache <<\\_ACEOF\n# This file is a shell script that caches the results of configure\n# tests run on this system so they can be shared between configure\n# scripts and configure runs, see configure's option --config-cache.\n# It is not useful on other systems.  If it contains results you don't\n# want to keep, you may remove or edit it.\n#\n# config.status only pays attention to the cache file if you give it\n# the --recheck option to rerun configure.\n#\n# `ac_cv_env_foo' variables (set or unset) will be overridden when\n# loading this file, other *unset* `ac_cv_foo' will be assigned the\n# following values.\n\n_ACEOF\n\n# The following way of writing the cache mishandles newlines in values,\n# but we know of no workaround that is simple, portable, and efficient.\n# So, we kill variables containing newlines.\n# Ultrix sh set writes to stderr and can't be redirected directly,\n# and sets the high bit in the cache file unless we assign to the vars.\n(\n  for ac_var in `(set) 2>&1 | sed -n 's/^\\([a-zA-Z_][a-zA-Z0-9_]*\\)=.*/\\1/p'`; do\n    eval ac_val=\\$$ac_var\n    case $ac_val in #(\n    *${as_nl}*)\n      case $ac_var in #(\n      *_cv_*) { $as_echo \"$as_me:${as_lineno-$LINENO}: WARNING: cache variable $ac_var contains a newline\" >&5\n$as_echo \"$as_me: WARNING: cache variable $ac_var contains a newline\" >&2;} ;;\n      esac\n      case $ac_var in #(\n      _ | IFS | as_nl) ;; #(\n      BASH_ARGV | BASH_SOURCE) eval $ac_var= ;; #(\n      *) { eval $ac_var=; unset $ac_var;} ;;\n      esac ;;\n    esac\n  done\n\n  (set) 2>&1 |\n    case $as_nl`(ac_space=' '; set) 2>&1` in #(\n    *${as_nl}ac_space=\\ *)\n      # `set' does not quote correctly, so add quotes: double-quote\n      # substitution turns \\\\\\\\ into \\\\, and sed turns \\\\ into \\.\n      sed -n \\\n\t\"s/'/'\\\\\\\\''/g;\n\t  s/^\\\\([_$as_cr_alnum]*_cv_[_$as_cr_alnum]*\\\\)=\\\\(.*\\\\)/\\\\1='\\\\2'/p\"\n      ;; #(\n    *)\n      # `set' quotes correctly as required by POSIX, so do not add quotes.\n      sed -n \"/^[_$as_cr_alnum]*_cv_[_$as_cr_alnum]*=/p\"\n      ;;\n    esac |\n    sort\n) |\n  sed '\n     /^ac_cv_env_/b end\n     t clear\n     :clear\n     s/^\\([^=]*\\)=\\(.*[{}].*\\)$/test \"${\\1+set}\" = set || &/\n     t end\n     s/^\\([^=]*\\)=\\(.*\\)$/\\1=${\\1=\\2}/\n     :end' >>confcache\nif diff \"$cache_file\" confcache >/dev/null 2>&1; then :; else\n  if test -w \"$cache_file\"; then\n    if test \"x$cache_file\" != \"x/dev/null\"; then\n      { $as_echo \"$as_me:${as_lineno-$LINENO}: updating cache $cache_file\" >&5\n$as_echo \"$as_me: updating cache $cache_file\" >&6;}\n      if test ! -f \"$cache_file\" || test -h \"$cache_file\"; then\n\tcat confcache >\"$cache_file\"\n      else\n        case $cache_file in #(\n        */* | ?:*)\n\t  mv -f confcache \"$cache_file\"$$ &&\n\t  mv -f \"$cache_file\"$$ \"$cache_file\" ;; #(\n        *)\n\t  mv -f confcache \"$cache_file\" ;;\n\tesac\n      fi\n    fi\n  else\n    { $as_echo \"$as_me:${as_lineno-$LINENO}: not updating unwritable cache $cache_file\" >&5\n$as_echo \"$as_me: not updating unwritable cache $cache_file\" >&6;}\n  fi\nfi\nrm -f confcache\n\ntest \"x$prefix\" = xNONE && prefix=$ac_default_prefix\n# Let make expand exec_prefix.\ntest \"x$exec_prefix\" = xNONE && exec_prefix='${prefix}'\n\nDEFS=-DHAVE_CONFIG_H\n\nac_libobjs=\nac_ltlibobjs=\nU=\nfor ac_i in : $LIBOBJS; do test \"x$ac_i\" = x: && continue\n  # 1. Remove the extension, and $U if already installed.\n  ac_script='s/\\$U\\././;s/\\.o$//;s/\\.obj$//'\n  ac_i=`$as_echo \"$ac_i\" | sed \"$ac_script\"`\n  # 2. Prepend LIBOBJDIR.  When used with automake>=1.10 LIBOBJDIR\n  #    will be set to the directory where LIBOBJS objects are built.\n  as_fn_append ac_libobjs \" \\${LIBOBJDIR}$ac_i\\$U.$ac_objext\"\n  as_fn_append ac_ltlibobjs \" \\${LIBOBJDIR}$ac_i\"'$U.lo'\ndone\nLIBOBJS=$ac_libobjs\n\nLTLIBOBJS=$ac_ltlibobjs\n\n\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: checking that generated files are newer than configure\" >&5\n$as_echo_n \"checking that generated files are newer than configure... \" >&6; }\n   if test -n \"$am_sleep_pid\"; then\n     # Hide warnings about reused PIDs.\n     wait $am_sleep_pid 2>/dev/null\n   fi\n   { $as_echo \"$as_me:${as_lineno-$LINENO}: result: done\" >&5\n$as_echo \"done\" >&6; }\n if test -n \"$EXEEXT\"; then\n  am__EXEEXT_TRUE=\n  am__EXEEXT_FALSE='#'\nelse\n  am__EXEEXT_TRUE='#'\n  am__EXEEXT_FALSE=\nfi\n\nif test -z \"${AMDEP_TRUE}\" && test -z \"${AMDEP_FALSE}\"; then\n  as_fn_error $? \"conditional \\\"AMDEP\\\" was never defined.\nUsually this means the macro was only invoked conditionally.\" \"$LINENO\" 5\nfi\nif test -z \"${am__fastdepCC_TRUE}\" && test -z \"${am__fastdepCC_FALSE}\"; then\n  as_fn_error $? \"conditional \\\"am__fastdepCC\\\" was never defined.\nUsually this means the macro was only invoked conditionally.\" \"$LINENO\" 5\nfi\nif test -z \"${am__fastdepCXX_TRUE}\" && test -z \"${am__fastdepCXX_FALSE}\"; then\n  as_fn_error $? \"conditional \\\"am__fastdepCXX\\\" was never defined.\nUsually this means the macro was only invoked conditionally.\" \"$LINENO\" 5\nfi\nif test -z \"${HAVE_COMPACT_TRUE}\" && test -z \"${HAVE_COMPACT_FALSE}\"; then\n  as_fn_error $? \"conditional \\\"HAVE_COMPACT\\\" was never defined.\nUsually this means the macro was only invoked conditionally.\" \"$LINENO\" 5\nfi\nif test -z \"${HAVE_COMPRESS_TRUE}\" && test -z \"${HAVE_COMPRESS_FALSE}\"; then\n  as_fn_error $? \"conditional \\\"HAVE_COMPRESS\\\" was never defined.\nUsually this means the macro was only invoked conditionally.\" \"$LINENO\" 5\nfi\nif test -z \"${HAVE_CONST_TRUE}\" && test -z \"${HAVE_CONST_FALSE}\"; then\n  as_fn_error $? \"conditional \\\"HAVE_CONST\\\" was never defined.\nUsually this means the macro was only invoked conditionally.\" \"$LINENO\" 5\nfi\nif test -z \"${HAVE_FAR_TRUE}\" && test -z \"${HAVE_FAR_FALSE}\"; then\n  as_fn_error $? \"conditional \\\"HAVE_FAR\\\" was never defined.\nUsually this means the macro was only invoked conditionally.\" \"$LINENO\" 5\nfi\nif test -z \"${HAVE_LINEAR_TRUE}\" && test -z \"${HAVE_LINEAR_FALSE}\"; then\n  as_fn_error $? \"conditional \\\"HAVE_LINEAR\\\" was never defined.\nUsually this means the macro was only invoked conditionally.\" \"$LINENO\" 5\nfi\nif test -z \"${HAVE_LOOKAHEAD_TRUE}\" && test -z \"${HAVE_LOOKAHEAD_FALSE}\"; then\n  as_fn_error $? \"conditional \\\"HAVE_LOOKAHEAD\\\" was never defined.\nUsually this means the macro was only invoked conditionally.\" \"$LINENO\" 5\nfi\nif test -z \"${HAVE_MPDT_TRUE}\" && test -z \"${HAVE_MPDT_FALSE}\"; then\n  as_fn_error $? \"conditional \\\"HAVE_MPDT\\\" was never defined.\nUsually this means the macro was only invoked conditionally.\" \"$LINENO\" 5\nfi\nif test -z \"${HAVE_NGRAM_TRUE}\" && test -z \"${HAVE_NGRAM_FALSE}\"; then\n  as_fn_error $? \"conditional \\\"HAVE_NGRAM\\\" was never defined.\nUsually this means the macro was only invoked conditionally.\" \"$LINENO\" 5\nfi\nif test -z \"${HAVE_PDT_TRUE}\" && test -z \"${HAVE_PDT_FALSE}\"; then\n  as_fn_error $? \"conditional \\\"HAVE_PDT\\\" was never defined.\nUsually this means the macro was only invoked conditionally.\" \"$LINENO\" 5\nfi\nif test -z \"${HAVE_PYTHON_TRUE}\" && test -z \"${HAVE_PYTHON_FALSE}\"; then\n  as_fn_error $? \"conditional \\\"HAVE_PYTHON\\\" was never defined.\nUsually this means the macro was only invoked conditionally.\" \"$LINENO\" 5\nfi\nif test -z \"${HAVE_SPECIAL_TRUE}\" && test -z \"${HAVE_SPECIAL_FALSE}\"; then\n  as_fn_error $? \"conditional \\\"HAVE_SPECIAL\\\" was never defined.\nUsually this means the macro was only invoked conditionally.\" \"$LINENO\" 5\nfi\nif test -z \"${HAVE_BIN_TRUE}\" && test -z \"${HAVE_BIN_FALSE}\"; then\n  as_fn_error $? \"conditional \\\"HAVE_BIN\\\" was never defined.\nUsually this means the macro was only invoked conditionally.\" \"$LINENO\" 5\nfi\nif test -z \"${HAVE_SCRIPT_TRUE}\" && test -z \"${HAVE_SCRIPT_FALSE}\"; then\n  as_fn_error $? \"conditional \\\"HAVE_SCRIPT\\\" was never defined.\nUsually this means the macro was only invoked conditionally.\" \"$LINENO\" 5\nfi\nif test -z \"${HAVE_GRM_TRUE}\" && test -z \"${HAVE_GRM_FALSE}\"; then\n  as_fn_error $? \"conditional \\\"HAVE_GRM\\\" was never defined.\nUsually this means the macro was only invoked conditionally.\" \"$LINENO\" 5\nfi\n\n: \"${CONFIG_STATUS=./config.status}\"\nac_write_fail=0\nac_clean_files_save=$ac_clean_files\nac_clean_files=\"$ac_clean_files $CONFIG_STATUS\"\n{ $as_echo \"$as_me:${as_lineno-$LINENO}: creating $CONFIG_STATUS\" >&5\n$as_echo \"$as_me: creating $CONFIG_STATUS\" >&6;}\nas_write_fail=0\ncat >$CONFIG_STATUS <<_ASEOF || as_write_fail=1\n#! $SHELL\n# Generated by $as_me.\n# Run this file to recreate the current configuration.\n# Compiler output produced by configure, useful for debugging\n# configure, is in config.log if it exists.\n\ndebug=false\nac_cs_recheck=false\nac_cs_silent=false\n\nSHELL=\\${CONFIG_SHELL-$SHELL}\nexport SHELL\n_ASEOF\ncat >>$CONFIG_STATUS <<\\_ASEOF || as_write_fail=1\n## -------------------- ##\n## M4sh Initialization. ##\n## -------------------- ##\n\n# Be more Bourne compatible\nDUALCASE=1; export DUALCASE # for MKS sh\nif test -n \"${ZSH_VERSION+set}\" && (emulate sh) >/dev/null 2>&1; then :\n  emulate sh\n  NULLCMD=:\n  # Pre-4.2 versions of Zsh do word splitting on ${1+\"$@\"}, which\n  # is contrary to our usage.  Disable this feature.\n  alias -g '${1+\"$@\"}'='\"$@\"'\n  setopt NO_GLOB_SUBST\nelse\n  case `(set -o) 2>/dev/null` in #(\n  *posix*) :\n    set -o posix ;; #(\n  *) :\n     ;;\nesac\nfi\n\n\nas_nl='\n'\nexport as_nl\n# Printing a long string crashes Solaris 7 /usr/bin/printf.\nas_echo='\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\'\nas_echo=$as_echo$as_echo$as_echo$as_echo$as_echo\nas_echo=$as_echo$as_echo$as_echo$as_echo$as_echo$as_echo\n# Prefer a ksh shell builtin over an external printf program on Solaris,\n# but without wasting forks for bash or zsh.\nif test -z \"$BASH_VERSION$ZSH_VERSION\" \\\n    && (test \"X`print -r -- $as_echo`\" = \"X$as_echo\") 2>/dev/null; then\n  as_echo='print -r --'\n  as_echo_n='print -rn --'\nelif (test \"X`printf %s $as_echo`\" = \"X$as_echo\") 2>/dev/null; then\n  as_echo='printf %s\\n'\n  as_echo_n='printf %s'\nelse\n  if test \"X`(/usr/ucb/echo -n -n $as_echo) 2>/dev/null`\" = \"X-n $as_echo\"; then\n    as_echo_body='eval /usr/ucb/echo -n \"$1$as_nl\"'\n    as_echo_n='/usr/ucb/echo -n'\n  else\n    as_echo_body='eval expr \"X$1\" : \"X\\\\(.*\\\\)\"'\n    as_echo_n_body='eval\n      arg=$1;\n      case $arg in #(\n      *\"$as_nl\"*)\n\texpr \"X$arg\" : \"X\\\\(.*\\\\)$as_nl\";\n\targ=`expr \"X$arg\" : \".*$as_nl\\\\(.*\\\\)\"`;;\n      esac;\n      expr \"X$arg\" : \"X\\\\(.*\\\\)\" | tr -d \"$as_nl\"\n    '\n    export as_echo_n_body\n    as_echo_n='sh -c $as_echo_n_body as_echo'\n  fi\n  export as_echo_body\n  as_echo='sh -c $as_echo_body as_echo'\nfi\n\n# The user is always right.\nif test \"${PATH_SEPARATOR+set}\" != set; then\n  PATH_SEPARATOR=:\n  (PATH='/bin;/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 && {\n    (PATH='/bin:/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 ||\n      PATH_SEPARATOR=';'\n  }\nfi\n\n\n# IFS\n# We need space, tab and new line, in precisely that order.  Quoting is\n# there to prevent editors from complaining about space-tab.\n# (If _AS_PATH_WALK were called with IFS unset, it would disable word\n# splitting by setting IFS to empty value.)\nIFS=\" \"\"\t$as_nl\"\n\n# Find who we are.  Look in the path if we contain no directory separator.\nas_myself=\ncase $0 in #((\n  *[\\\\/]* ) as_myself=$0 ;;\n  *) as_save_IFS=$IFS; IFS=$PATH_SEPARATOR\nfor as_dir in $PATH\ndo\n  IFS=$as_save_IFS\n  test -z \"$as_dir\" && as_dir=.\n    test -r \"$as_dir/$0\" && as_myself=$as_dir/$0 && break\n  done\nIFS=$as_save_IFS\n\n     ;;\nesac\n# We did not find ourselves, most probably we were run as `sh COMMAND'\n# in which case we are not to be found in the path.\nif test \"x$as_myself\" = x; then\n  as_myself=$0\nfi\nif test ! -f \"$as_myself\"; then\n  $as_echo \"$as_myself: error: cannot find myself; rerun with an absolute file name\" >&2\n  exit 1\nfi\n\n# Unset variables that we do not need and which cause bugs (e.g. in\n# pre-3.0 UWIN ksh).  But do not cause bugs in bash 2.01; the \"|| exit 1\"\n# suppresses any \"Segmentation fault\" message there.  '((' could\n# trigger a bug in pdksh 5.2.14.\nfor as_var in BASH_ENV ENV MAIL MAILPATH\ndo eval test x\\${$as_var+set} = xset \\\n  && ( (unset $as_var) || exit 1) >/dev/null 2>&1 && unset $as_var || :\ndone\nPS1='$ '\nPS2='> '\nPS4='+ '\n\n# NLS nuisances.\nLC_ALL=C\nexport LC_ALL\nLANGUAGE=C\nexport LANGUAGE\n\n# CDPATH.\n(unset CDPATH) >/dev/null 2>&1 && unset CDPATH\n\n\n# as_fn_error STATUS ERROR [LINENO LOG_FD]\n# ----------------------------------------\n# Output \"`basename $0`: error: ERROR\" to stderr. If LINENO and LOG_FD are\n# provided, also output the error to LOG_FD, referencing LINENO. Then exit the\n# script with STATUS, using 1 if that was 0.\nas_fn_error ()\n{\n  as_status=$1; test $as_status -eq 0 && as_status=1\n  if test \"$4\"; then\n    as_lineno=${as_lineno-\"$3\"} as_lineno_stack=as_lineno_stack=$as_lineno_stack\n    $as_echo \"$as_me:${as_lineno-$LINENO}: error: $2\" >&$4\n  fi\n  $as_echo \"$as_me: error: $2\" >&2\n  as_fn_exit $as_status\n} # as_fn_error\n\n\n# as_fn_set_status STATUS\n# -----------------------\n# Set $? to STATUS, without forking.\nas_fn_set_status ()\n{\n  return $1\n} # as_fn_set_status\n\n# as_fn_exit STATUS\n# -----------------\n# Exit the shell with STATUS, even in a \"trap 0\" or \"set -e\" context.\nas_fn_exit ()\n{\n  set +e\n  as_fn_set_status $1\n  exit $1\n} # as_fn_exit\n\n# as_fn_unset VAR\n# ---------------\n# Portably unset VAR.\nas_fn_unset ()\n{\n  { eval $1=; unset $1;}\n}\nas_unset=as_fn_unset\n# as_fn_append VAR VALUE\n# ----------------------\n# Append the text in VALUE to the end of the definition contained in VAR. Take\n# advantage of any shell optimizations that allow amortized linear growth over\n# repeated appends, instead of the typical quadratic growth present in naive\n# implementations.\nif (eval \"as_var=1; as_var+=2; test x\\$as_var = x12\") 2>/dev/null; then :\n  eval 'as_fn_append ()\n  {\n    eval $1+=\\$2\n  }'\nelse\n  as_fn_append ()\n  {\n    eval $1=\\$$1\\$2\n  }\nfi # as_fn_append\n\n# as_fn_arith ARG...\n# ------------------\n# Perform arithmetic evaluation on the ARGs, and store the result in the\n# global $as_val. Take advantage of shells that can avoid forks. The arguments\n# must be portable across $(()) and expr.\nif (eval \"test \\$(( 1 + 1 )) = 2\") 2>/dev/null; then :\n  eval 'as_fn_arith ()\n  {\n    as_val=$(( $* ))\n  }'\nelse\n  as_fn_arith ()\n  {\n    as_val=`expr \"$@\" || test $? -eq 1`\n  }\nfi # as_fn_arith\n\n\nif expr a : '\\(a\\)' >/dev/null 2>&1 &&\n   test \"X`expr 00001 : '.*\\(...\\)'`\" = X001; then\n  as_expr=expr\nelse\n  as_expr=false\nfi\n\nif (basename -- /) >/dev/null 2>&1 && test \"X`basename -- / 2>&1`\" = \"X/\"; then\n  as_basename=basename\nelse\n  as_basename=false\nfi\n\nif (as_dir=`dirname -- /` && test \"X$as_dir\" = X/) >/dev/null 2>&1; then\n  as_dirname=dirname\nelse\n  as_dirname=false\nfi\n\nas_me=`$as_basename -- \"$0\" ||\n$as_expr X/\"$0\" : '.*/\\([^/][^/]*\\)/*$' \\| \\\n\t X\"$0\" : 'X\\(//\\)$' \\| \\\n\t X\"$0\" : 'X\\(/\\)' \\| . 2>/dev/null ||\n$as_echo X/\"$0\" |\n    sed '/^.*\\/\\([^/][^/]*\\)\\/*$/{\n\t    s//\\1/\n\t    q\n\t  }\n\t  /^X\\/\\(\\/\\/\\)$/{\n\t    s//\\1/\n\t    q\n\t  }\n\t  /^X\\/\\(\\/\\).*/{\n\t    s//\\1/\n\t    q\n\t  }\n\t  s/.*/./; q'`\n\n# Avoid depending upon Character Ranges.\nas_cr_letters='abcdefghijklmnopqrstuvwxyz'\nas_cr_LETTERS='ABCDEFGHIJKLMNOPQRSTUVWXYZ'\nas_cr_Letters=$as_cr_letters$as_cr_LETTERS\nas_cr_digits='0123456789'\nas_cr_alnum=$as_cr_Letters$as_cr_digits\n\nECHO_C= ECHO_N= ECHO_T=\ncase `echo -n x` in #(((((\n-n*)\n  case `echo 'xy\\c'` in\n  *c*) ECHO_T='\t';;\t# ECHO_T is single tab character.\n  xy)  ECHO_C='\\c';;\n  *)   echo `echo ksh88 bug on AIX 6.1` > /dev/null\n       ECHO_T='\t';;\n  esac;;\n*)\n  ECHO_N='-n';;\nesac\n\nrm -f conf$$ conf$$.exe conf$$.file\nif test -d conf$$.dir; then\n  rm -f conf$$.dir/conf$$.file\nelse\n  rm -f conf$$.dir\n  mkdir conf$$.dir 2>/dev/null\nfi\nif (echo >conf$$.file) 2>/dev/null; then\n  if ln -s conf$$.file conf$$ 2>/dev/null; then\n    as_ln_s='ln -s'\n    # ... but there are two gotchas:\n    # 1) On MSYS, both `ln -s file dir' and `ln file dir' fail.\n    # 2) DJGPP < 2.04 has no symlinks; `ln -s' creates a wrapper executable.\n    # In both cases, we have to default to `cp -pR'.\n    ln -s conf$$.file conf$$.dir 2>/dev/null && test ! -f conf$$.exe ||\n      as_ln_s='cp -pR'\n  elif ln conf$$.file conf$$ 2>/dev/null; then\n    as_ln_s=ln\n  else\n    as_ln_s='cp -pR'\n  fi\nelse\n  as_ln_s='cp -pR'\nfi\nrm -f conf$$ conf$$.exe conf$$.dir/conf$$.file conf$$.file\nrmdir conf$$.dir 2>/dev/null\n\n\n# as_fn_mkdir_p\n# -------------\n# Create \"$as_dir\" as a directory, including parents if necessary.\nas_fn_mkdir_p ()\n{\n\n  case $as_dir in #(\n  -*) as_dir=./$as_dir;;\n  esac\n  test -d \"$as_dir\" || eval $as_mkdir_p || {\n    as_dirs=\n    while :; do\n      case $as_dir in #(\n      *\\'*) as_qdir=`$as_echo \"$as_dir\" | sed \"s/'/'\\\\\\\\\\\\\\\\''/g\"`;; #'(\n      *) as_qdir=$as_dir;;\n      esac\n      as_dirs=\"'$as_qdir' $as_dirs\"\n      as_dir=`$as_dirname -- \"$as_dir\" ||\n$as_expr X\"$as_dir\" : 'X\\(.*[^/]\\)//*[^/][^/]*/*$' \\| \\\n\t X\"$as_dir\" : 'X\\(//\\)[^/]' \\| \\\n\t X\"$as_dir\" : 'X\\(//\\)$' \\| \\\n\t X\"$as_dir\" : 'X\\(/\\)' \\| . 2>/dev/null ||\n$as_echo X\"$as_dir\" |\n    sed '/^X\\(.*[^/]\\)\\/\\/*[^/][^/]*\\/*$/{\n\t    s//\\1/\n\t    q\n\t  }\n\t  /^X\\(\\/\\/\\)[^/].*/{\n\t    s//\\1/\n\t    q\n\t  }\n\t  /^X\\(\\/\\/\\)$/{\n\t    s//\\1/\n\t    q\n\t  }\n\t  /^X\\(\\/\\).*/{\n\t    s//\\1/\n\t    q\n\t  }\n\t  s/.*/./; q'`\n      test -d \"$as_dir\" && break\n    done\n    test -z \"$as_dirs\" || eval \"mkdir $as_dirs\"\n  } || test -d \"$as_dir\" || as_fn_error $? \"cannot create directory $as_dir\"\n\n\n} # as_fn_mkdir_p\nif mkdir -p . 2>/dev/null; then\n  as_mkdir_p='mkdir -p \"$as_dir\"'\nelse\n  test -d ./-p && rmdir ./-p\n  as_mkdir_p=false\nfi\n\n\n# as_fn_executable_p FILE\n# -----------------------\n# Test if FILE is an executable regular file.\nas_fn_executable_p ()\n{\n  test -f \"$1\" && test -x \"$1\"\n} # as_fn_executable_p\nas_test_x='test -x'\nas_executable_p=as_fn_executable_p\n\n# Sed expression to map a string onto a valid CPP name.\nas_tr_cpp=\"eval sed 'y%*$as_cr_letters%P$as_cr_LETTERS%;s%[^_$as_cr_alnum]%_%g'\"\n\n# Sed expression to map a string onto a valid variable name.\nas_tr_sh=\"eval sed 'y%*+%pp%;s%[^_$as_cr_alnum]%_%g'\"\n\n\nexec 6>&1\n## ----------------------------------- ##\n## Main body of $CONFIG_STATUS script. ##\n## ----------------------------------- ##\n_ASEOF\ntest $as_write_fail = 0 && chmod +x $CONFIG_STATUS || ac_write_fail=1\n\ncat >>$CONFIG_STATUS <<\\_ACEOF || ac_write_fail=1\n# Save the log message, to keep $0 and so on meaningful, and to\n# report actual input values of CONFIG_FILES etc. instead of their\n# values after options handling.\nac_log=\"\nThis file was extended by OpenFst $as_me 1.6.9, which was\ngenerated by GNU Autoconf 2.69.  Invocation command line was\n\n  CONFIG_FILES    = $CONFIG_FILES\n  CONFIG_HEADERS  = $CONFIG_HEADERS\n  CONFIG_LINKS    = $CONFIG_LINKS\n  CONFIG_COMMANDS = $CONFIG_COMMANDS\n  $ $0 $@\n\non `(hostname || uname -n) 2>/dev/null | sed 1q`\n\"\n\n_ACEOF\n\ncase $ac_config_files in *\"\n\"*) set x $ac_config_files; shift; ac_config_files=$*;;\nesac\n\ncase $ac_config_headers in *\"\n\"*) set x $ac_config_headers; shift; ac_config_headers=$*;;\nesac\n\n\ncat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1\n# Files that config.status was made for.\nconfig_files=\"$ac_config_files\"\nconfig_headers=\"$ac_config_headers\"\nconfig_commands=\"$ac_config_commands\"\n\n_ACEOF\n\ncat >>$CONFIG_STATUS <<\\_ACEOF || ac_write_fail=1\nac_cs_usage=\"\\\n\\`$as_me' instantiates files and other configuration actions\nfrom templates according to the current configuration.  Unless the files\nand actions are specified as TAGs, all are instantiated by default.\n\nUsage: $0 [OPTION]... [TAG]...\n\n  -h, --help       print this help, then exit\n  -V, --version    print version number and configuration settings, then exit\n      --config     print configuration, then exit\n  -q, --quiet, --silent\n                   do not print progress messages\n  -d, --debug      don't remove temporary files\n      --recheck    update $as_me by reconfiguring in the same conditions\n      --file=FILE[:TEMPLATE]\n                   instantiate the configuration file FILE\n      --header=FILE[:TEMPLATE]\n                   instantiate the configuration header FILE\n\nConfiguration files:\n$config_files\n\nConfiguration headers:\n$config_headers\n\nConfiguration commands:\n$config_commands\n\nReport bugs to <help@www.openfst.org>.\"\n\n_ACEOF\ncat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1\nac_cs_config=\"`$as_echo \"$ac_configure_args\" | sed 's/^ //; s/[\\\\\"\"\\`\\$]/\\\\\\\\&/g'`\"\nac_cs_version=\"\\\\\nOpenFst config.status 1.6.9\nconfigured by $0, generated by GNU Autoconf 2.69,\n  with options \\\\\"\\$ac_cs_config\\\\\"\n\nCopyright (C) 2012 Free Software Foundation, Inc.\nThis config.status script is free software; the Free Software Foundation\ngives unlimited permission to copy, distribute and modify it.\"\n\nac_pwd='$ac_pwd'\nsrcdir='$srcdir'\nINSTALL='$INSTALL'\nMKDIR_P='$MKDIR_P'\nAWK='$AWK'\ntest -n \"\\$AWK\" || AWK=awk\n_ACEOF\n\ncat >>$CONFIG_STATUS <<\\_ACEOF || ac_write_fail=1\n# The default lists apply if the user does not specify any file.\nac_need_defaults=:\nwhile test $# != 0\ndo\n  case $1 in\n  --*=?*)\n    ac_option=`expr \"X$1\" : 'X\\([^=]*\\)='`\n    ac_optarg=`expr \"X$1\" : 'X[^=]*=\\(.*\\)'`\n    ac_shift=:\n    ;;\n  --*=)\n    ac_option=`expr \"X$1\" : 'X\\([^=]*\\)='`\n    ac_optarg=\n    ac_shift=:\n    ;;\n  *)\n    ac_option=$1\n    ac_optarg=$2\n    ac_shift=shift\n    ;;\n  esac\n\n  case $ac_option in\n  # Handling of the options.\n  -recheck | --recheck | --rechec | --reche | --rech | --rec | --re | --r)\n    ac_cs_recheck=: ;;\n  --version | --versio | --versi | --vers | --ver | --ve | --v | -V )\n    $as_echo \"$ac_cs_version\"; exit ;;\n  --config | --confi | --conf | --con | --co | --c )\n    $as_echo \"$ac_cs_config\"; exit ;;\n  --debug | --debu | --deb | --de | --d | -d )\n    debug=: ;;\n  --file | --fil | --fi | --f )\n    $ac_shift\n    case $ac_optarg in\n    *\\'*) ac_optarg=`$as_echo \"$ac_optarg\" | sed \"s/'/'\\\\\\\\\\\\\\\\''/g\"` ;;\n    '') as_fn_error $? \"missing file argument\" ;;\n    esac\n    as_fn_append CONFIG_FILES \" '$ac_optarg'\"\n    ac_need_defaults=false;;\n  --header | --heade | --head | --hea )\n    $ac_shift\n    case $ac_optarg in\n    *\\'*) ac_optarg=`$as_echo \"$ac_optarg\" | sed \"s/'/'\\\\\\\\\\\\\\\\''/g\"` ;;\n    esac\n    as_fn_append CONFIG_HEADERS \" '$ac_optarg'\"\n    ac_need_defaults=false;;\n  --he | --h)\n    # Conflict between --help and --header\n    as_fn_error $? \"ambiguous option: \\`$1'\nTry \\`$0 --help' for more information.\";;\n  --help | --hel | -h )\n    $as_echo \"$ac_cs_usage\"; exit ;;\n  -q | -quiet | --quiet | --quie | --qui | --qu | --q \\\n  | -silent | --silent | --silen | --sile | --sil | --si | --s)\n    ac_cs_silent=: ;;\n\n  # This is an error.\n  -*) as_fn_error $? \"unrecognized option: \\`$1'\nTry \\`$0 --help' for more information.\" ;;\n\n  *) as_fn_append ac_config_targets \" $1\"\n     ac_need_defaults=false ;;\n\n  esac\n  shift\ndone\n\nac_configure_extra_args=\n\nif $ac_cs_silent; then\n  exec 6>/dev/null\n  ac_configure_extra_args=\"$ac_configure_extra_args --silent\"\nfi\n\n_ACEOF\ncat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1\nif \\$ac_cs_recheck; then\n  set X $SHELL '$0' $ac_configure_args \\$ac_configure_extra_args --no-create --no-recursion\n  shift\n  \\$as_echo \"running CONFIG_SHELL=$SHELL \\$*\" >&6\n  CONFIG_SHELL='$SHELL'\n  export CONFIG_SHELL\n  exec \"\\$@\"\nfi\n\n_ACEOF\ncat >>$CONFIG_STATUS <<\\_ACEOF || ac_write_fail=1\nexec 5>>config.log\n{\n  echo\n  sed 'h;s/./-/g;s/^.../## /;s/...$/ ##/;p;x;p;x' <<_ASBOX\n## Running $as_me. ##\n_ASBOX\n  $as_echo \"$ac_log\"\n} >&5\n\n_ACEOF\ncat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1\n#\n# INIT-COMMANDS\n#\nAMDEP_TRUE=\"$AMDEP_TRUE\" ac_aux_dir=\"$ac_aux_dir\"\n\n\n# The HP-UX ksh and POSIX shell print the target directory to stdout\n# if CDPATH is set.\n(unset CDPATH) >/dev/null 2>&1 && unset CDPATH\n\nsed_quote_subst='$sed_quote_subst'\ndouble_quote_subst='$double_quote_subst'\ndelay_variable_subst='$delay_variable_subst'\nenable_static='`$ECHO \"$enable_static\" | $SED \"$delay_single_quote_subst\"`'\nmacro_version='`$ECHO \"$macro_version\" | $SED \"$delay_single_quote_subst\"`'\nmacro_revision='`$ECHO \"$macro_revision\" | $SED \"$delay_single_quote_subst\"`'\nenable_shared='`$ECHO \"$enable_shared\" | $SED \"$delay_single_quote_subst\"`'\npic_mode='`$ECHO \"$pic_mode\" | $SED \"$delay_single_quote_subst\"`'\nenable_fast_install='`$ECHO \"$enable_fast_install\" | $SED \"$delay_single_quote_subst\"`'\nshared_archive_member_spec='`$ECHO \"$shared_archive_member_spec\" | $SED \"$delay_single_quote_subst\"`'\nSHELL='`$ECHO \"$SHELL\" | $SED \"$delay_single_quote_subst\"`'\nECHO='`$ECHO \"$ECHO\" | $SED \"$delay_single_quote_subst\"`'\nPATH_SEPARATOR='`$ECHO \"$PATH_SEPARATOR\" | $SED \"$delay_single_quote_subst\"`'\nhost_alias='`$ECHO \"$host_alias\" | $SED \"$delay_single_quote_subst\"`'\nhost='`$ECHO \"$host\" | $SED \"$delay_single_quote_subst\"`'\nhost_os='`$ECHO \"$host_os\" | $SED \"$delay_single_quote_subst\"`'\nbuild_alias='`$ECHO \"$build_alias\" | $SED \"$delay_single_quote_subst\"`'\nbuild='`$ECHO \"$build\" | $SED \"$delay_single_quote_subst\"`'\nbuild_os='`$ECHO \"$build_os\" | $SED \"$delay_single_quote_subst\"`'\nSED='`$ECHO \"$SED\" | $SED \"$delay_single_quote_subst\"`'\nXsed='`$ECHO \"$Xsed\" | $SED \"$delay_single_quote_subst\"`'\nGREP='`$ECHO \"$GREP\" | $SED \"$delay_single_quote_subst\"`'\nEGREP='`$ECHO \"$EGREP\" | $SED \"$delay_single_quote_subst\"`'\nFGREP='`$ECHO \"$FGREP\" | $SED \"$delay_single_quote_subst\"`'\nLD='`$ECHO \"$LD\" | $SED \"$delay_single_quote_subst\"`'\nNM='`$ECHO \"$NM\" | $SED \"$delay_single_quote_subst\"`'\nLN_S='`$ECHO \"$LN_S\" | $SED \"$delay_single_quote_subst\"`'\nmax_cmd_len='`$ECHO \"$max_cmd_len\" | $SED \"$delay_single_quote_subst\"`'\nac_objext='`$ECHO \"$ac_objext\" | $SED \"$delay_single_quote_subst\"`'\nexeext='`$ECHO \"$exeext\" | $SED \"$delay_single_quote_subst\"`'\nlt_unset='`$ECHO \"$lt_unset\" | $SED \"$delay_single_quote_subst\"`'\nlt_SP2NL='`$ECHO \"$lt_SP2NL\" | $SED \"$delay_single_quote_subst\"`'\nlt_NL2SP='`$ECHO \"$lt_NL2SP\" | $SED \"$delay_single_quote_subst\"`'\nlt_cv_to_host_file_cmd='`$ECHO \"$lt_cv_to_host_file_cmd\" | $SED \"$delay_single_quote_subst\"`'\nlt_cv_to_tool_file_cmd='`$ECHO \"$lt_cv_to_tool_file_cmd\" | $SED \"$delay_single_quote_subst\"`'\nreload_flag='`$ECHO \"$reload_flag\" | $SED \"$delay_single_quote_subst\"`'\nreload_cmds='`$ECHO \"$reload_cmds\" | $SED \"$delay_single_quote_subst\"`'\nOBJDUMP='`$ECHO \"$OBJDUMP\" | $SED \"$delay_single_quote_subst\"`'\ndeplibs_check_method='`$ECHO \"$deplibs_check_method\" | $SED \"$delay_single_quote_subst\"`'\nfile_magic_cmd='`$ECHO \"$file_magic_cmd\" | $SED \"$delay_single_quote_subst\"`'\nfile_magic_glob='`$ECHO \"$file_magic_glob\" | $SED \"$delay_single_quote_subst\"`'\nwant_nocaseglob='`$ECHO \"$want_nocaseglob\" | $SED \"$delay_single_quote_subst\"`'\nDLLTOOL='`$ECHO \"$DLLTOOL\" | $SED \"$delay_single_quote_subst\"`'\nsharedlib_from_linklib_cmd='`$ECHO \"$sharedlib_from_linklib_cmd\" | $SED \"$delay_single_quote_subst\"`'\nAR='`$ECHO \"$AR\" | $SED \"$delay_single_quote_subst\"`'\nAR_FLAGS='`$ECHO \"$AR_FLAGS\" | $SED \"$delay_single_quote_subst\"`'\narchiver_list_spec='`$ECHO \"$archiver_list_spec\" | $SED \"$delay_single_quote_subst\"`'\nSTRIP='`$ECHO \"$STRIP\" | $SED \"$delay_single_quote_subst\"`'\nRANLIB='`$ECHO \"$RANLIB\" | $SED \"$delay_single_quote_subst\"`'\nold_postinstall_cmds='`$ECHO \"$old_postinstall_cmds\" | $SED \"$delay_single_quote_subst\"`'\nold_postuninstall_cmds='`$ECHO \"$old_postuninstall_cmds\" | $SED \"$delay_single_quote_subst\"`'\nold_archive_cmds='`$ECHO \"$old_archive_cmds\" | $SED \"$delay_single_quote_subst\"`'\nlock_old_archive_extraction='`$ECHO \"$lock_old_archive_extraction\" | $SED \"$delay_single_quote_subst\"`'\nCC='`$ECHO \"$CC\" | $SED \"$delay_single_quote_subst\"`'\nCFLAGS='`$ECHO \"$CFLAGS\" | $SED \"$delay_single_quote_subst\"`'\ncompiler='`$ECHO \"$compiler\" | $SED \"$delay_single_quote_subst\"`'\nGCC='`$ECHO \"$GCC\" | $SED \"$delay_single_quote_subst\"`'\nlt_cv_sys_global_symbol_pipe='`$ECHO \"$lt_cv_sys_global_symbol_pipe\" | $SED \"$delay_single_quote_subst\"`'\nlt_cv_sys_global_symbol_to_cdecl='`$ECHO \"$lt_cv_sys_global_symbol_to_cdecl\" | $SED \"$delay_single_quote_subst\"`'\nlt_cv_sys_global_symbol_to_import='`$ECHO \"$lt_cv_sys_global_symbol_to_import\" | $SED \"$delay_single_quote_subst\"`'\nlt_cv_sys_global_symbol_to_c_name_address='`$ECHO \"$lt_cv_sys_global_symbol_to_c_name_address\" | $SED \"$delay_single_quote_subst\"`'\nlt_cv_sys_global_symbol_to_c_name_address_lib_prefix='`$ECHO \"$lt_cv_sys_global_symbol_to_c_name_address_lib_prefix\" | $SED \"$delay_single_quote_subst\"`'\nlt_cv_nm_interface='`$ECHO \"$lt_cv_nm_interface\" | $SED \"$delay_single_quote_subst\"`'\nnm_file_list_spec='`$ECHO \"$nm_file_list_spec\" | $SED \"$delay_single_quote_subst\"`'\nlt_sysroot='`$ECHO \"$lt_sysroot\" | $SED \"$delay_single_quote_subst\"`'\nlt_cv_truncate_bin='`$ECHO \"$lt_cv_truncate_bin\" | $SED \"$delay_single_quote_subst\"`'\nobjdir='`$ECHO \"$objdir\" | $SED \"$delay_single_quote_subst\"`'\nMAGIC_CMD='`$ECHO \"$MAGIC_CMD\" | $SED \"$delay_single_quote_subst\"`'\nlt_prog_compiler_no_builtin_flag='`$ECHO \"$lt_prog_compiler_no_builtin_flag\" | $SED \"$delay_single_quote_subst\"`'\nlt_prog_compiler_pic='`$ECHO \"$lt_prog_compiler_pic\" | $SED \"$delay_single_quote_subst\"`'\nlt_prog_compiler_wl='`$ECHO \"$lt_prog_compiler_wl\" | $SED \"$delay_single_quote_subst\"`'\nlt_prog_compiler_static='`$ECHO \"$lt_prog_compiler_static\" | $SED \"$delay_single_quote_subst\"`'\nlt_cv_prog_compiler_c_o='`$ECHO \"$lt_cv_prog_compiler_c_o\" | $SED \"$delay_single_quote_subst\"`'\nneed_locks='`$ECHO \"$need_locks\" | $SED \"$delay_single_quote_subst\"`'\nMANIFEST_TOOL='`$ECHO \"$MANIFEST_TOOL\" | $SED \"$delay_single_quote_subst\"`'\nDSYMUTIL='`$ECHO \"$DSYMUTIL\" | $SED \"$delay_single_quote_subst\"`'\nNMEDIT='`$ECHO \"$NMEDIT\" | $SED \"$delay_single_quote_subst\"`'\nLIPO='`$ECHO \"$LIPO\" | $SED \"$delay_single_quote_subst\"`'\nOTOOL='`$ECHO \"$OTOOL\" | $SED \"$delay_single_quote_subst\"`'\nOTOOL64='`$ECHO \"$OTOOL64\" | $SED \"$delay_single_quote_subst\"`'\nlibext='`$ECHO \"$libext\" | $SED \"$delay_single_quote_subst\"`'\nshrext_cmds='`$ECHO \"$shrext_cmds\" | $SED \"$delay_single_quote_subst\"`'\nextract_expsyms_cmds='`$ECHO \"$extract_expsyms_cmds\" | $SED \"$delay_single_quote_subst\"`'\narchive_cmds_need_lc='`$ECHO \"$archive_cmds_need_lc\" | $SED \"$delay_single_quote_subst\"`'\nenable_shared_with_static_runtimes='`$ECHO \"$enable_shared_with_static_runtimes\" | $SED \"$delay_single_quote_subst\"`'\nexport_dynamic_flag_spec='`$ECHO \"$export_dynamic_flag_spec\" | $SED \"$delay_single_quote_subst\"`'\nwhole_archive_flag_spec='`$ECHO \"$whole_archive_flag_spec\" | $SED \"$delay_single_quote_subst\"`'\ncompiler_needs_object='`$ECHO \"$compiler_needs_object\" | $SED \"$delay_single_quote_subst\"`'\nold_archive_from_new_cmds='`$ECHO \"$old_archive_from_new_cmds\" | $SED \"$delay_single_quote_subst\"`'\nold_archive_from_expsyms_cmds='`$ECHO \"$old_archive_from_expsyms_cmds\" | $SED \"$delay_single_quote_subst\"`'\narchive_cmds='`$ECHO \"$archive_cmds\" | $SED \"$delay_single_quote_subst\"`'\narchive_expsym_cmds='`$ECHO \"$archive_expsym_cmds\" | $SED \"$delay_single_quote_subst\"`'\nmodule_cmds='`$ECHO \"$module_cmds\" | $SED \"$delay_single_quote_subst\"`'\nmodule_expsym_cmds='`$ECHO \"$module_expsym_cmds\" | $SED \"$delay_single_quote_subst\"`'\nwith_gnu_ld='`$ECHO \"$with_gnu_ld\" | $SED \"$delay_single_quote_subst\"`'\nallow_undefined_flag='`$ECHO \"$allow_undefined_flag\" | $SED \"$delay_single_quote_subst\"`'\nno_undefined_flag='`$ECHO \"$no_undefined_flag\" | $SED \"$delay_single_quote_subst\"`'\nhardcode_libdir_flag_spec='`$ECHO \"$hardcode_libdir_flag_spec\" | $SED \"$delay_single_quote_subst\"`'\nhardcode_libdir_separator='`$ECHO \"$hardcode_libdir_separator\" | $SED \"$delay_single_quote_subst\"`'\nhardcode_direct='`$ECHO \"$hardcode_direct\" | $SED \"$delay_single_quote_subst\"`'\nhardcode_direct_absolute='`$ECHO \"$hardcode_direct_absolute\" | $SED \"$delay_single_quote_subst\"`'\nhardcode_minus_L='`$ECHO \"$hardcode_minus_L\" | $SED \"$delay_single_quote_subst\"`'\nhardcode_shlibpath_var='`$ECHO \"$hardcode_shlibpath_var\" | $SED \"$delay_single_quote_subst\"`'\nhardcode_automatic='`$ECHO \"$hardcode_automatic\" | $SED \"$delay_single_quote_subst\"`'\ninherit_rpath='`$ECHO \"$inherit_rpath\" | $SED \"$delay_single_quote_subst\"`'\nlink_all_deplibs='`$ECHO \"$link_all_deplibs\" | $SED \"$delay_single_quote_subst\"`'\nalways_export_symbols='`$ECHO \"$always_export_symbols\" | $SED \"$delay_single_quote_subst\"`'\nexport_symbols_cmds='`$ECHO \"$export_symbols_cmds\" | $SED \"$delay_single_quote_subst\"`'\nexclude_expsyms='`$ECHO \"$exclude_expsyms\" | $SED \"$delay_single_quote_subst\"`'\ninclude_expsyms='`$ECHO \"$include_expsyms\" | $SED \"$delay_single_quote_subst\"`'\nprelink_cmds='`$ECHO \"$prelink_cmds\" | $SED \"$delay_single_quote_subst\"`'\npostlink_cmds='`$ECHO \"$postlink_cmds\" | $SED \"$delay_single_quote_subst\"`'\nfile_list_spec='`$ECHO \"$file_list_spec\" | $SED \"$delay_single_quote_subst\"`'\nvariables_saved_for_relink='`$ECHO \"$variables_saved_for_relink\" | $SED \"$delay_single_quote_subst\"`'\nneed_lib_prefix='`$ECHO \"$need_lib_prefix\" | $SED \"$delay_single_quote_subst\"`'\nneed_version='`$ECHO \"$need_version\" | $SED \"$delay_single_quote_subst\"`'\nversion_type='`$ECHO \"$version_type\" | $SED \"$delay_single_quote_subst\"`'\nrunpath_var='`$ECHO \"$runpath_var\" | $SED \"$delay_single_quote_subst\"`'\nshlibpath_var='`$ECHO \"$shlibpath_var\" | $SED \"$delay_single_quote_subst\"`'\nshlibpath_overrides_runpath='`$ECHO \"$shlibpath_overrides_runpath\" | $SED \"$delay_single_quote_subst\"`'\nlibname_spec='`$ECHO \"$libname_spec\" | $SED \"$delay_single_quote_subst\"`'\nlibrary_names_spec='`$ECHO \"$library_names_spec\" | $SED \"$delay_single_quote_subst\"`'\nsoname_spec='`$ECHO \"$soname_spec\" | $SED \"$delay_single_quote_subst\"`'\ninstall_override_mode='`$ECHO \"$install_override_mode\" | $SED \"$delay_single_quote_subst\"`'\npostinstall_cmds='`$ECHO \"$postinstall_cmds\" | $SED \"$delay_single_quote_subst\"`'\npostuninstall_cmds='`$ECHO \"$postuninstall_cmds\" | $SED \"$delay_single_quote_subst\"`'\nfinish_cmds='`$ECHO \"$finish_cmds\" | $SED \"$delay_single_quote_subst\"`'\nfinish_eval='`$ECHO \"$finish_eval\" | $SED \"$delay_single_quote_subst\"`'\nhardcode_into_libs='`$ECHO \"$hardcode_into_libs\" | $SED \"$delay_single_quote_subst\"`'\nsys_lib_search_path_spec='`$ECHO \"$sys_lib_search_path_spec\" | $SED \"$delay_single_quote_subst\"`'\nconfigure_time_dlsearch_path='`$ECHO \"$configure_time_dlsearch_path\" | $SED \"$delay_single_quote_subst\"`'\nconfigure_time_lt_sys_library_path='`$ECHO \"$configure_time_lt_sys_library_path\" | $SED \"$delay_single_quote_subst\"`'\nhardcode_action='`$ECHO \"$hardcode_action\" | $SED \"$delay_single_quote_subst\"`'\nenable_dlopen='`$ECHO \"$enable_dlopen\" | $SED \"$delay_single_quote_subst\"`'\nenable_dlopen_self='`$ECHO \"$enable_dlopen_self\" | $SED \"$delay_single_quote_subst\"`'\nenable_dlopen_self_static='`$ECHO \"$enable_dlopen_self_static\" | $SED \"$delay_single_quote_subst\"`'\nold_striplib='`$ECHO \"$old_striplib\" | $SED \"$delay_single_quote_subst\"`'\nstriplib='`$ECHO \"$striplib\" | $SED \"$delay_single_quote_subst\"`'\ncompiler_lib_search_dirs='`$ECHO \"$compiler_lib_search_dirs\" | $SED \"$delay_single_quote_subst\"`'\npredep_objects='`$ECHO \"$predep_objects\" | $SED \"$delay_single_quote_subst\"`'\npostdep_objects='`$ECHO \"$postdep_objects\" | $SED \"$delay_single_quote_subst\"`'\npredeps='`$ECHO \"$predeps\" | $SED \"$delay_single_quote_subst\"`'\npostdeps='`$ECHO \"$postdeps\" | $SED \"$delay_single_quote_subst\"`'\ncompiler_lib_search_path='`$ECHO \"$compiler_lib_search_path\" | $SED \"$delay_single_quote_subst\"`'\nLD_CXX='`$ECHO \"$LD_CXX\" | $SED \"$delay_single_quote_subst\"`'\nreload_flag_CXX='`$ECHO \"$reload_flag_CXX\" | $SED \"$delay_single_quote_subst\"`'\nreload_cmds_CXX='`$ECHO \"$reload_cmds_CXX\" | $SED \"$delay_single_quote_subst\"`'\nold_archive_cmds_CXX='`$ECHO \"$old_archive_cmds_CXX\" | $SED \"$delay_single_quote_subst\"`'\ncompiler_CXX='`$ECHO \"$compiler_CXX\" | $SED \"$delay_single_quote_subst\"`'\nGCC_CXX='`$ECHO \"$GCC_CXX\" | $SED \"$delay_single_quote_subst\"`'\nlt_prog_compiler_no_builtin_flag_CXX='`$ECHO \"$lt_prog_compiler_no_builtin_flag_CXX\" | $SED \"$delay_single_quote_subst\"`'\nlt_prog_compiler_pic_CXX='`$ECHO \"$lt_prog_compiler_pic_CXX\" | $SED \"$delay_single_quote_subst\"`'\nlt_prog_compiler_wl_CXX='`$ECHO \"$lt_prog_compiler_wl_CXX\" | $SED \"$delay_single_quote_subst\"`'\nlt_prog_compiler_static_CXX='`$ECHO \"$lt_prog_compiler_static_CXX\" | $SED \"$delay_single_quote_subst\"`'\nlt_cv_prog_compiler_c_o_CXX='`$ECHO \"$lt_cv_prog_compiler_c_o_CXX\" | $SED \"$delay_single_quote_subst\"`'\narchive_cmds_need_lc_CXX='`$ECHO \"$archive_cmds_need_lc_CXX\" | $SED \"$delay_single_quote_subst\"`'\nenable_shared_with_static_runtimes_CXX='`$ECHO \"$enable_shared_with_static_runtimes_CXX\" | $SED \"$delay_single_quote_subst\"`'\nexport_dynamic_flag_spec_CXX='`$ECHO \"$export_dynamic_flag_spec_CXX\" | $SED \"$delay_single_quote_subst\"`'\nwhole_archive_flag_spec_CXX='`$ECHO \"$whole_archive_flag_spec_CXX\" | $SED \"$delay_single_quote_subst\"`'\ncompiler_needs_object_CXX='`$ECHO \"$compiler_needs_object_CXX\" | $SED \"$delay_single_quote_subst\"`'\nold_archive_from_new_cmds_CXX='`$ECHO \"$old_archive_from_new_cmds_CXX\" | $SED \"$delay_single_quote_subst\"`'\nold_archive_from_expsyms_cmds_CXX='`$ECHO \"$old_archive_from_expsyms_cmds_CXX\" | $SED \"$delay_single_quote_subst\"`'\narchive_cmds_CXX='`$ECHO \"$archive_cmds_CXX\" | $SED \"$delay_single_quote_subst\"`'\narchive_expsym_cmds_CXX='`$ECHO \"$archive_expsym_cmds_CXX\" | $SED \"$delay_single_quote_subst\"`'\nmodule_cmds_CXX='`$ECHO \"$module_cmds_CXX\" | $SED \"$delay_single_quote_subst\"`'\nmodule_expsym_cmds_CXX='`$ECHO \"$module_expsym_cmds_CXX\" | $SED \"$delay_single_quote_subst\"`'\nwith_gnu_ld_CXX='`$ECHO \"$with_gnu_ld_CXX\" | $SED \"$delay_single_quote_subst\"`'\nallow_undefined_flag_CXX='`$ECHO \"$allow_undefined_flag_CXX\" | $SED \"$delay_single_quote_subst\"`'\nno_undefined_flag_CXX='`$ECHO \"$no_undefined_flag_CXX\" | $SED \"$delay_single_quote_subst\"`'\nhardcode_libdir_flag_spec_CXX='`$ECHO \"$hardcode_libdir_flag_spec_CXX\" | $SED \"$delay_single_quote_subst\"`'\nhardcode_libdir_separator_CXX='`$ECHO \"$hardcode_libdir_separator_CXX\" | $SED \"$delay_single_quote_subst\"`'\nhardcode_direct_CXX='`$ECHO \"$hardcode_direct_CXX\" | $SED \"$delay_single_quote_subst\"`'\nhardcode_direct_absolute_CXX='`$ECHO \"$hardcode_direct_absolute_CXX\" | $SED \"$delay_single_quote_subst\"`'\nhardcode_minus_L_CXX='`$ECHO \"$hardcode_minus_L_CXX\" | $SED \"$delay_single_quote_subst\"`'\nhardcode_shlibpath_var_CXX='`$ECHO \"$hardcode_shlibpath_var_CXX\" | $SED \"$delay_single_quote_subst\"`'\nhardcode_automatic_CXX='`$ECHO \"$hardcode_automatic_CXX\" | $SED \"$delay_single_quote_subst\"`'\ninherit_rpath_CXX='`$ECHO \"$inherit_rpath_CXX\" | $SED \"$delay_single_quote_subst\"`'\nlink_all_deplibs_CXX='`$ECHO \"$link_all_deplibs_CXX\" | $SED \"$delay_single_quote_subst\"`'\nalways_export_symbols_CXX='`$ECHO \"$always_export_symbols_CXX\" | $SED \"$delay_single_quote_subst\"`'\nexport_symbols_cmds_CXX='`$ECHO \"$export_symbols_cmds_CXX\" | $SED \"$delay_single_quote_subst\"`'\nexclude_expsyms_CXX='`$ECHO \"$exclude_expsyms_CXX\" | $SED \"$delay_single_quote_subst\"`'\ninclude_expsyms_CXX='`$ECHO \"$include_expsyms_CXX\" | $SED \"$delay_single_quote_subst\"`'\nprelink_cmds_CXX='`$ECHO \"$prelink_cmds_CXX\" | $SED \"$delay_single_quote_subst\"`'\npostlink_cmds_CXX='`$ECHO \"$postlink_cmds_CXX\" | $SED \"$delay_single_quote_subst\"`'\nfile_list_spec_CXX='`$ECHO \"$file_list_spec_CXX\" | $SED \"$delay_single_quote_subst\"`'\nhardcode_action_CXX='`$ECHO \"$hardcode_action_CXX\" | $SED \"$delay_single_quote_subst\"`'\ncompiler_lib_search_dirs_CXX='`$ECHO \"$compiler_lib_search_dirs_CXX\" | $SED \"$delay_single_quote_subst\"`'\npredep_objects_CXX='`$ECHO \"$predep_objects_CXX\" | $SED \"$delay_single_quote_subst\"`'\npostdep_objects_CXX='`$ECHO \"$postdep_objects_CXX\" | $SED \"$delay_single_quote_subst\"`'\npredeps_CXX='`$ECHO \"$predeps_CXX\" | $SED \"$delay_single_quote_subst\"`'\npostdeps_CXX='`$ECHO \"$postdeps_CXX\" | $SED \"$delay_single_quote_subst\"`'\ncompiler_lib_search_path_CXX='`$ECHO \"$compiler_lib_search_path_CXX\" | $SED \"$delay_single_quote_subst\"`'\n\nLTCC='$LTCC'\nLTCFLAGS='$LTCFLAGS'\ncompiler='$compiler_DEFAULT'\n\n# A function that is used when there is no print builtin or printf.\nfunc_fallback_echo ()\n{\n  eval 'cat <<_LTECHO_EOF\n\\$1\n_LTECHO_EOF'\n}\n\n# Quote evaled strings.\nfor var in SHELL \\\nECHO \\\nPATH_SEPARATOR \\\nSED \\\nGREP \\\nEGREP \\\nFGREP \\\nLD \\\nNM \\\nLN_S \\\nlt_SP2NL \\\nlt_NL2SP \\\nreload_flag \\\nOBJDUMP \\\ndeplibs_check_method \\\nfile_magic_cmd \\\nfile_magic_glob \\\nwant_nocaseglob \\\nDLLTOOL \\\nsharedlib_from_linklib_cmd \\\nAR \\\nAR_FLAGS \\\narchiver_list_spec \\\nSTRIP \\\nRANLIB \\\nCC \\\nCFLAGS \\\ncompiler \\\nlt_cv_sys_global_symbol_pipe \\\nlt_cv_sys_global_symbol_to_cdecl \\\nlt_cv_sys_global_symbol_to_import \\\nlt_cv_sys_global_symbol_to_c_name_address \\\nlt_cv_sys_global_symbol_to_c_name_address_lib_prefix \\\nlt_cv_nm_interface \\\nnm_file_list_spec \\\nlt_cv_truncate_bin \\\nlt_prog_compiler_no_builtin_flag \\\nlt_prog_compiler_pic \\\nlt_prog_compiler_wl \\\nlt_prog_compiler_static \\\nlt_cv_prog_compiler_c_o \\\nneed_locks \\\nMANIFEST_TOOL \\\nDSYMUTIL \\\nNMEDIT \\\nLIPO \\\nOTOOL \\\nOTOOL64 \\\nshrext_cmds \\\nexport_dynamic_flag_spec \\\nwhole_archive_flag_spec \\\ncompiler_needs_object \\\nwith_gnu_ld \\\nallow_undefined_flag \\\nno_undefined_flag \\\nhardcode_libdir_flag_spec \\\nhardcode_libdir_separator \\\nexclude_expsyms \\\ninclude_expsyms \\\nfile_list_spec \\\nvariables_saved_for_relink \\\nlibname_spec \\\nlibrary_names_spec \\\nsoname_spec \\\ninstall_override_mode \\\nfinish_eval \\\nold_striplib \\\nstriplib \\\ncompiler_lib_search_dirs \\\npredep_objects \\\npostdep_objects \\\npredeps \\\npostdeps \\\ncompiler_lib_search_path \\\nLD_CXX \\\nreload_flag_CXX \\\ncompiler_CXX \\\nlt_prog_compiler_no_builtin_flag_CXX \\\nlt_prog_compiler_pic_CXX \\\nlt_prog_compiler_wl_CXX \\\nlt_prog_compiler_static_CXX \\\nlt_cv_prog_compiler_c_o_CXX \\\nexport_dynamic_flag_spec_CXX \\\nwhole_archive_flag_spec_CXX \\\ncompiler_needs_object_CXX \\\nwith_gnu_ld_CXX \\\nallow_undefined_flag_CXX \\\nno_undefined_flag_CXX \\\nhardcode_libdir_flag_spec_CXX \\\nhardcode_libdir_separator_CXX \\\nexclude_expsyms_CXX \\\ninclude_expsyms_CXX \\\nfile_list_spec_CXX \\\ncompiler_lib_search_dirs_CXX \\\npredep_objects_CXX \\\npostdep_objects_CXX \\\npredeps_CXX \\\npostdeps_CXX \\\ncompiler_lib_search_path_CXX; do\n    case \\`eval \\\\\\\\\\$ECHO \\\\\\\\\"\"\\\\\\\\\\$\\$var\"\\\\\\\\\"\\` in\n    *[\\\\\\\\\\\\\\`\\\\\"\\\\\\$]*)\n      eval \"lt_\\$var=\\\\\\\\\\\\\"\\\\\\`\\\\\\$ECHO \\\\\"\\\\\\$\\$var\\\\\" | \\\\\\$SED \\\\\"\\\\\\$sed_quote_subst\\\\\"\\\\\\`\\\\\\\\\\\\\"\" ## exclude from sc_prohibit_nested_quotes\n      ;;\n    *)\n      eval \"lt_\\$var=\\\\\\\\\\\\\"\\\\\\$\\$var\\\\\\\\\\\\\"\"\n      ;;\n    esac\ndone\n\n# Double-quote double-evaled strings.\nfor var in reload_cmds \\\nold_postinstall_cmds \\\nold_postuninstall_cmds \\\nold_archive_cmds \\\nextract_expsyms_cmds \\\nold_archive_from_new_cmds \\\nold_archive_from_expsyms_cmds \\\narchive_cmds \\\narchive_expsym_cmds \\\nmodule_cmds \\\nmodule_expsym_cmds \\\nexport_symbols_cmds \\\nprelink_cmds \\\npostlink_cmds \\\npostinstall_cmds \\\npostuninstall_cmds \\\nfinish_cmds \\\nsys_lib_search_path_spec \\\nconfigure_time_dlsearch_path \\\nconfigure_time_lt_sys_library_path \\\nreload_cmds_CXX \\\nold_archive_cmds_CXX \\\nold_archive_from_new_cmds_CXX \\\nold_archive_from_expsyms_cmds_CXX \\\narchive_cmds_CXX \\\narchive_expsym_cmds_CXX \\\nmodule_cmds_CXX \\\nmodule_expsym_cmds_CXX \\\nexport_symbols_cmds_CXX \\\nprelink_cmds_CXX \\\npostlink_cmds_CXX; do\n    case \\`eval \\\\\\\\\\$ECHO \\\\\\\\\"\"\\\\\\\\\\$\\$var\"\\\\\\\\\"\\` in\n    *[\\\\\\\\\\\\\\`\\\\\"\\\\\\$]*)\n      eval \"lt_\\$var=\\\\\\\\\\\\\"\\\\\\`\\\\\\$ECHO \\\\\"\\\\\\$\\$var\\\\\" | \\\\\\$SED -e \\\\\"\\\\\\$double_quote_subst\\\\\" -e \\\\\"\\\\\\$sed_quote_subst\\\\\" -e \\\\\"\\\\\\$delay_variable_subst\\\\\"\\\\\\`\\\\\\\\\\\\\"\" ## exclude from sc_prohibit_nested_quotes\n      ;;\n    *)\n      eval \"lt_\\$var=\\\\\\\\\\\\\"\\\\\\$\\$var\\\\\\\\\\\\\"\"\n      ;;\n    esac\ndone\n\nac_aux_dir='$ac_aux_dir'\n\n# See if we are running on zsh, and set the options that allow our\n# commands through without removal of \\ escapes INIT.\nif test -n \"\\${ZSH_VERSION+set}\"; then\n   setopt NO_GLOB_SUBST\nfi\n\n\n    PACKAGE='$PACKAGE'\n    VERSION='$VERSION'\n    RM='$RM'\n    ofile='$ofile'\n\n\n\n\n\n\n_ACEOF\n\ncat >>$CONFIG_STATUS <<\\_ACEOF || ac_write_fail=1\n\n# Handling of arguments.\nfor ac_config_target in $ac_config_targets\ndo\n  case $ac_config_target in\n    \"depfiles\") CONFIG_COMMANDS=\"$CONFIG_COMMANDS depfiles\" ;;\n    \"libtool\") CONFIG_COMMANDS=\"$CONFIG_COMMANDS libtool\" ;;\n    \"config.h\") CONFIG_HEADERS=\"$CONFIG_HEADERS config.h\" ;;\n    \"src/include/fst/config.h\") CONFIG_HEADERS=\"$CONFIG_HEADERS src/include/fst/config.h\" ;;\n    \"Makefile\") CONFIG_FILES=\"$CONFIG_FILES Makefile\" ;;\n    \"src/Makefile\") CONFIG_FILES=\"$CONFIG_FILES src/Makefile\" ;;\n    \"src/include/Makefile\") CONFIG_FILES=\"$CONFIG_FILES src/include/Makefile\" ;;\n    \"src/lib/Makefile\") CONFIG_FILES=\"$CONFIG_FILES src/lib/Makefile\" ;;\n    \"src/bin/Makefile\") CONFIG_FILES=\"$CONFIG_FILES src/bin/Makefile\" ;;\n    \"src/test/Makefile\") CONFIG_FILES=\"$CONFIG_FILES src/test/Makefile\" ;;\n    \"src/extensions/Makefile\") CONFIG_FILES=\"$CONFIG_FILES src/extensions/Makefile\" ;;\n    \"src/extensions/compact/Makefile\") CONFIG_FILES=\"$CONFIG_FILES src/extensions/compact/Makefile\" ;;\n    \"src/extensions/compress/Makefile\") CONFIG_FILES=\"$CONFIG_FILES src/extensions/compress/Makefile\" ;;\n    \"src/extensions/const/Makefile\") CONFIG_FILES=\"$CONFIG_FILES src/extensions/const/Makefile\" ;;\n    \"src/extensions/far/Makefile\") CONFIG_FILES=\"$CONFIG_FILES src/extensions/far/Makefile\" ;;\n    \"src/extensions/linear/Makefile\") CONFIG_FILES=\"$CONFIG_FILES src/extensions/linear/Makefile\" ;;\n    \"src/extensions/lookahead/Makefile\") CONFIG_FILES=\"$CONFIG_FILES src/extensions/lookahead/Makefile\" ;;\n    \"src/extensions/mpdt/Makefile\") CONFIG_FILES=\"$CONFIG_FILES src/extensions/mpdt/Makefile\" ;;\n    \"src/extensions/ngram/Makefile\") CONFIG_FILES=\"$CONFIG_FILES src/extensions/ngram/Makefile\" ;;\n    \"src/extensions/pdt/Makefile\") CONFIG_FILES=\"$CONFIG_FILES src/extensions/pdt/Makefile\" ;;\n    \"src/extensions/python/Makefile\") CONFIG_FILES=\"$CONFIG_FILES src/extensions/python/Makefile\" ;;\n    \"src/extensions/special/Makefile\") CONFIG_FILES=\"$CONFIG_FILES src/extensions/special/Makefile\" ;;\n    \"src/script/Makefile\") CONFIG_FILES=\"$CONFIG_FILES src/script/Makefile\" ;;\n\n  *) as_fn_error $? \"invalid argument: \\`$ac_config_target'\" \"$LINENO\" 5;;\n  esac\ndone\n\n\n# If the user did not use the arguments to specify the items to instantiate,\n# then the envvar interface is used.  Set only those that are not.\n# We use the long form for the default assignment because of an extremely\n# bizarre bug on SunOS 4.1.3.\nif $ac_need_defaults; then\n  test \"${CONFIG_FILES+set}\" = set || CONFIG_FILES=$config_files\n  test \"${CONFIG_HEADERS+set}\" = set || CONFIG_HEADERS=$config_headers\n  test \"${CONFIG_COMMANDS+set}\" = set || CONFIG_COMMANDS=$config_commands\nfi\n\n# Have a temporary directory for convenience.  Make it in the build tree\n# simply because there is no reason against having it here, and in addition,\n# creating and moving files from /tmp can sometimes cause problems.\n# Hook for its removal unless debugging.\n# Note that there is a small window in which the directory will not be cleaned:\n# after its creation but before its name has been assigned to `$tmp'.\n$debug ||\n{\n  tmp= ac_tmp=\n  trap 'exit_status=$?\n  : \"${ac_tmp:=$tmp}\"\n  { test ! -d \"$ac_tmp\" || rm -fr \"$ac_tmp\"; } && exit $exit_status\n' 0\n  trap 'as_fn_exit 1' 1 2 13 15\n}\n# Create a (secure) tmp directory for tmp files.\n\n{\n  tmp=`(umask 077 && mktemp -d \"./confXXXXXX\") 2>/dev/null` &&\n  test -d \"$tmp\"\n}  ||\n{\n  tmp=./conf$$-$RANDOM\n  (umask 077 && mkdir \"$tmp\")\n} || as_fn_error $? \"cannot create a temporary directory in .\" \"$LINENO\" 5\nac_tmp=$tmp\n\n# Set up the scripts for CONFIG_FILES section.\n# No need to generate them if there are no CONFIG_FILES.\n# This happens for instance with `./config.status config.h'.\nif test -n \"$CONFIG_FILES\"; then\n\n\nac_cr=`echo X | tr X '\\015'`\n# On cygwin, bash can eat \\r inside `` if the user requested igncr.\n# But we know of no other shell where ac_cr would be empty at this\n# point, so we can use a bashism as a fallback.\nif test \"x$ac_cr\" = x; then\n  eval ac_cr=\\$\\'\\\\r\\'\nfi\nac_cs_awk_cr=`$AWK 'BEGIN { print \"a\\rb\" }' </dev/null 2>/dev/null`\nif test \"$ac_cs_awk_cr\" = \"a${ac_cr}b\"; then\n  ac_cs_awk_cr='\\\\r'\nelse\n  ac_cs_awk_cr=$ac_cr\nfi\n\necho 'BEGIN {' >\"$ac_tmp/subs1.awk\" &&\n_ACEOF\n\n\n{\n  echo \"cat >conf$$subs.awk <<_ACEOF\" &&\n  echo \"$ac_subst_vars\" | sed 's/.*/&!$&$ac_delim/' &&\n  echo \"_ACEOF\"\n} >conf$$subs.sh ||\n  as_fn_error $? \"could not make $CONFIG_STATUS\" \"$LINENO\" 5\nac_delim_num=`echo \"$ac_subst_vars\" | grep -c '^'`\nac_delim='%!_!# '\nfor ac_last_try in false false false false false :; do\n  . ./conf$$subs.sh ||\n    as_fn_error $? \"could not make $CONFIG_STATUS\" \"$LINENO\" 5\n\n  ac_delim_n=`sed -n \"s/.*$ac_delim\\$/X/p\" conf$$subs.awk | grep -c X`\n  if test $ac_delim_n = $ac_delim_num; then\n    break\n  elif $ac_last_try; then\n    as_fn_error $? \"could not make $CONFIG_STATUS\" \"$LINENO\" 5\n  else\n    ac_delim=\"$ac_delim!$ac_delim _$ac_delim!! \"\n  fi\ndone\nrm -f conf$$subs.sh\n\ncat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1\ncat >>\"\\$ac_tmp/subs1.awk\" <<\\\\_ACAWK &&\n_ACEOF\nsed -n '\nh\ns/^/S[\"/; s/!.*/\"]=/\np\ng\ns/^[^!]*!//\n:repl\nt repl\ns/'\"$ac_delim\"'$//\nt delim\n:nl\nh\ns/\\(.\\{148\\}\\)..*/\\1/\nt more1\ns/[\"\\\\]/\\\\&/g; s/^/\"/; s/$/\\\\n\"\\\\/\np\nn\nb repl\n:more1\ns/[\"\\\\]/\\\\&/g; s/^/\"/; s/$/\"\\\\/\np\ng\ns/.\\{148\\}//\nt nl\n:delim\nh\ns/\\(.\\{148\\}\\)..*/\\1/\nt more2\ns/[\"\\\\]/\\\\&/g; s/^/\"/; s/$/\"/\np\nb\n:more2\ns/[\"\\\\]/\\\\&/g; s/^/\"/; s/$/\"\\\\/\np\ng\ns/.\\{148\\}//\nt delim\n' <conf$$subs.awk | sed '\n/^[^\"\"]/{\n  N\n  s/\\n//\n}\n' >>$CONFIG_STATUS || ac_write_fail=1\nrm -f conf$$subs.awk\ncat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1\n_ACAWK\ncat >>\"\\$ac_tmp/subs1.awk\" <<_ACAWK &&\n  for (key in S) S_is_set[key] = 1\n  FS = \"\u0007\"\n\n}\n{\n  line = $ 0\n  nfields = split(line, field, \"@\")\n  substed = 0\n  len = length(field[1])\n  for (i = 2; i < nfields; i++) {\n    key = field[i]\n    keylen = length(key)\n    if (S_is_set[key]) {\n      value = S[key]\n      line = substr(line, 1, len) \"\" value \"\" substr(line, len + keylen + 3)\n      len += length(value) + length(field[++i])\n      substed = 1\n    } else\n      len += 1 + keylen\n  }\n\n  print line\n}\n\n_ACAWK\n_ACEOF\ncat >>$CONFIG_STATUS <<\\_ACEOF || ac_write_fail=1\nif sed \"s/$ac_cr//\" < /dev/null > /dev/null 2>&1; then\n  sed \"s/$ac_cr\\$//; s/$ac_cr/$ac_cs_awk_cr/g\"\nelse\n  cat\nfi < \"$ac_tmp/subs1.awk\" > \"$ac_tmp/subs.awk\" \\\n  || as_fn_error $? \"could not setup config files machinery\" \"$LINENO\" 5\n_ACEOF\n\n# VPATH may cause trouble with some makes, so we remove sole $(srcdir),\n# ${srcdir} and @srcdir@ entries from VPATH if srcdir is \".\", strip leading and\n# trailing colons and then remove the whole line if VPATH becomes empty\n# (actually we leave an empty line to preserve line numbers).\nif test \"x$srcdir\" = x.; then\n  ac_vpsub='/^[\t ]*VPATH[\t ]*=[\t ]*/{\nh\ns///\ns/^/:/\ns/[\t ]*$/:/\ns/:\\$(srcdir):/:/g\ns/:\\${srcdir}:/:/g\ns/:@srcdir@:/:/g\ns/^:*//\ns/:*$//\nx\ns/\\(=[\t ]*\\).*/\\1/\nG\ns/\\n//\ns/^[^=]*=[\t ]*$//\n}'\nfi\n\ncat >>$CONFIG_STATUS <<\\_ACEOF || ac_write_fail=1\nfi # test -n \"$CONFIG_FILES\"\n\n# Set up the scripts for CONFIG_HEADERS section.\n# No need to generate them if there are no CONFIG_HEADERS.\n# This happens for instance with `./config.status Makefile'.\nif test -n \"$CONFIG_HEADERS\"; then\ncat >\"$ac_tmp/defines.awk\" <<\\_ACAWK ||\nBEGIN {\n_ACEOF\n\n# Transform confdefs.h into an awk script `defines.awk', embedded as\n# here-document in config.status, that substitutes the proper values into\n# config.h.in to produce config.h.\n\n# Create a delimiter string that does not exist in confdefs.h, to ease\n# handling of long lines.\nac_delim='%!_!# '\nfor ac_last_try in false false :; do\n  ac_tt=`sed -n \"/$ac_delim/p\" confdefs.h`\n  if test -z \"$ac_tt\"; then\n    break\n  elif $ac_last_try; then\n    as_fn_error $? \"could not make $CONFIG_HEADERS\" \"$LINENO\" 5\n  else\n    ac_delim=\"$ac_delim!$ac_delim _$ac_delim!! \"\n  fi\ndone\n\n# For the awk script, D is an array of macro values keyed by name,\n# likewise P contains macro parameters if any.  Preserve backslash\n# newline sequences.\n\nac_word_re=[_$as_cr_Letters][_$as_cr_alnum]*\nsed -n '\ns/.\\{148\\}/&'\"$ac_delim\"'/g\nt rset\n:rset\ns/^[\t ]*#[\t ]*define[\t ][\t ]*/ /\nt def\nd\n:def\ns/\\\\$//\nt bsnl\ns/[\"\\\\]/\\\\&/g\ns/^ \\('\"$ac_word_re\"'\\)\\(([^()]*)\\)[\t ]*\\(.*\\)/P[\"\\1\"]=\"\\2\"\\\nD[\"\\1\"]=\" \\3\"/p\ns/^ \\('\"$ac_word_re\"'\\)[\t ]*\\(.*\\)/D[\"\\1\"]=\" \\2\"/p\nd\n:bsnl\ns/[\"\\\\]/\\\\&/g\ns/^ \\('\"$ac_word_re\"'\\)\\(([^()]*)\\)[\t ]*\\(.*\\)/P[\"\\1\"]=\"\\2\"\\\nD[\"\\1\"]=\" \\3\\\\\\\\\\\\n\"\\\\/p\nt cont\ns/^ \\('\"$ac_word_re\"'\\)[\t ]*\\(.*\\)/D[\"\\1\"]=\" \\2\\\\\\\\\\\\n\"\\\\/p\nt cont\nd\n:cont\nn\ns/.\\{148\\}/&'\"$ac_delim\"'/g\nt clear\n:clear\ns/\\\\$//\nt bsnlc\ns/[\"\\\\]/\\\\&/g; s/^/\"/; s/$/\"/p\nd\n:bsnlc\ns/[\"\\\\]/\\\\&/g; s/^/\"/; s/$/\\\\\\\\\\\\n\"\\\\/p\nb cont\n' <confdefs.h | sed '\ns/'\"$ac_delim\"'/\"\\\\\\\n\"/g' >>$CONFIG_STATUS || ac_write_fail=1\n\ncat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1\n  for (key in D) D_is_set[key] = 1\n  FS = \"\u0007\"\n}\n/^[\\t ]*#[\\t ]*(define|undef)[\\t ]+$ac_word_re([\\t (]|\\$)/ {\n  line = \\$ 0\n  split(line, arg, \" \")\n  if (arg[1] == \"#\") {\n    defundef = arg[2]\n    mac1 = arg[3]\n  } else {\n    defundef = substr(arg[1], 2)\n    mac1 = arg[2]\n  }\n  split(mac1, mac2, \"(\") #)\n  macro = mac2[1]\n  prefix = substr(line, 1, index(line, defundef) - 1)\n  if (D_is_set[macro]) {\n    # Preserve the white space surrounding the \"#\".\n    print prefix \"define\", macro P[macro] D[macro]\n    next\n  } else {\n    # Replace #undef with comments.  This is necessary, for example,\n    # in the case of _POSIX_SOURCE, which is predefined and required\n    # on some systems where configure will not decide to define it.\n    if (defundef == \"undef\") {\n      print \"/*\", prefix defundef, macro, \"*/\"\n      next\n    }\n  }\n}\n{ print }\n_ACAWK\n_ACEOF\ncat >>$CONFIG_STATUS <<\\_ACEOF || ac_write_fail=1\n  as_fn_error $? \"could not setup config headers machinery\" \"$LINENO\" 5\nfi # test -n \"$CONFIG_HEADERS\"\n\n\neval set X \"  :F $CONFIG_FILES  :H $CONFIG_HEADERS    :C $CONFIG_COMMANDS\"\nshift\nfor ac_tag\ndo\n  case $ac_tag in\n  :[FHLC]) ac_mode=$ac_tag; continue;;\n  esac\n  case $ac_mode$ac_tag in\n  :[FHL]*:*);;\n  :L* | :C*:*) as_fn_error $? \"invalid tag \\`$ac_tag'\" \"$LINENO\" 5;;\n  :[FH]-) ac_tag=-:-;;\n  :[FH]*) ac_tag=$ac_tag:$ac_tag.in;;\n  esac\n  ac_save_IFS=$IFS\n  IFS=:\n  set x $ac_tag\n  IFS=$ac_save_IFS\n  shift\n  ac_file=$1\n  shift\n\n  case $ac_mode in\n  :L) ac_source=$1;;\n  :[FH])\n    ac_file_inputs=\n    for ac_f\n    do\n      case $ac_f in\n      -) ac_f=\"$ac_tmp/stdin\";;\n      *) # Look for the file first in the build tree, then in the source tree\n\t # (if the path is not absolute).  The absolute path cannot be DOS-style,\n\t # because $ac_f cannot contain `:'.\n\t test -f \"$ac_f\" ||\n\t   case $ac_f in\n\t   [\\\\/$]*) false;;\n\t   *) test -f \"$srcdir/$ac_f\" && ac_f=\"$srcdir/$ac_f\";;\n\t   esac ||\n\t   as_fn_error 1 \"cannot find input file: \\`$ac_f'\" \"$LINENO\" 5;;\n      esac\n      case $ac_f in *\\'*) ac_f=`$as_echo \"$ac_f\" | sed \"s/'/'\\\\\\\\\\\\\\\\''/g\"`;; esac\n      as_fn_append ac_file_inputs \" '$ac_f'\"\n    done\n\n    # Let's still pretend it is `configure' which instantiates (i.e., don't\n    # use $as_me), people would be surprised to read:\n    #    /* config.h.  Generated by config.status.  */\n    configure_input='Generated from '`\n\t  $as_echo \"$*\" | sed 's|^[^:]*/||;s|:[^:]*/|, |g'\n\t`' by configure.'\n    if test x\"$ac_file\" != x-; then\n      configure_input=\"$ac_file.  $configure_input\"\n      { $as_echo \"$as_me:${as_lineno-$LINENO}: creating $ac_file\" >&5\n$as_echo \"$as_me: creating $ac_file\" >&6;}\n    fi\n    # Neutralize special characters interpreted by sed in replacement strings.\n    case $configure_input in #(\n    *\\&* | *\\|* | *\\\\* )\n       ac_sed_conf_input=`$as_echo \"$configure_input\" |\n       sed 's/[\\\\\\\\&|]/\\\\\\\\&/g'`;; #(\n    *) ac_sed_conf_input=$configure_input;;\n    esac\n\n    case $ac_tag in\n    *:-:* | *:-) cat >\"$ac_tmp/stdin\" \\\n      || as_fn_error $? \"could not create $ac_file\" \"$LINENO\" 5 ;;\n    esac\n    ;;\n  esac\n\n  ac_dir=`$as_dirname -- \"$ac_file\" ||\n$as_expr X\"$ac_file\" : 'X\\(.*[^/]\\)//*[^/][^/]*/*$' \\| \\\n\t X\"$ac_file\" : 'X\\(//\\)[^/]' \\| \\\n\t X\"$ac_file\" : 'X\\(//\\)$' \\| \\\n\t X\"$ac_file\" : 'X\\(/\\)' \\| . 2>/dev/null ||\n$as_echo X\"$ac_file\" |\n    sed '/^X\\(.*[^/]\\)\\/\\/*[^/][^/]*\\/*$/{\n\t    s//\\1/\n\t    q\n\t  }\n\t  /^X\\(\\/\\/\\)[^/].*/{\n\t    s//\\1/\n\t    q\n\t  }\n\t  /^X\\(\\/\\/\\)$/{\n\t    s//\\1/\n\t    q\n\t  }\n\t  /^X\\(\\/\\).*/{\n\t    s//\\1/\n\t    q\n\t  }\n\t  s/.*/./; q'`\n  as_dir=\"$ac_dir\"; as_fn_mkdir_p\n  ac_builddir=.\n\ncase \"$ac_dir\" in\n.) ac_dir_suffix= ac_top_builddir_sub=. ac_top_build_prefix= ;;\n*)\n  ac_dir_suffix=/`$as_echo \"$ac_dir\" | sed 's|^\\.[\\\\/]||'`\n  # A \"..\" for each directory in $ac_dir_suffix.\n  ac_top_builddir_sub=`$as_echo \"$ac_dir_suffix\" | sed 's|/[^\\\\/]*|/..|g;s|/||'`\n  case $ac_top_builddir_sub in\n  \"\") ac_top_builddir_sub=. ac_top_build_prefix= ;;\n  *)  ac_top_build_prefix=$ac_top_builddir_sub/ ;;\n  esac ;;\nesac\nac_abs_top_builddir=$ac_pwd\nac_abs_builddir=$ac_pwd$ac_dir_suffix\n# for backward compatibility:\nac_top_builddir=$ac_top_build_prefix\n\ncase $srcdir in\n  .)  # We are building in place.\n    ac_srcdir=.\n    ac_top_srcdir=$ac_top_builddir_sub\n    ac_abs_top_srcdir=$ac_pwd ;;\n  [\\\\/]* | ?:[\\\\/]* )  # Absolute name.\n    ac_srcdir=$srcdir$ac_dir_suffix;\n    ac_top_srcdir=$srcdir\n    ac_abs_top_srcdir=$srcdir ;;\n  *) # Relative name.\n    ac_srcdir=$ac_top_build_prefix$srcdir$ac_dir_suffix\n    ac_top_srcdir=$ac_top_build_prefix$srcdir\n    ac_abs_top_srcdir=$ac_pwd/$srcdir ;;\nesac\nac_abs_srcdir=$ac_abs_top_srcdir$ac_dir_suffix\n\n\n  case $ac_mode in\n  :F)\n  #\n  # CONFIG_FILE\n  #\n\n  case $INSTALL in\n  [\\\\/$]* | ?:[\\\\/]* ) ac_INSTALL=$INSTALL ;;\n  *) ac_INSTALL=$ac_top_build_prefix$INSTALL ;;\n  esac\n  ac_MKDIR_P=$MKDIR_P\n  case $MKDIR_P in\n  [\\\\/$]* | ?:[\\\\/]* ) ;;\n  */*) ac_MKDIR_P=$ac_top_build_prefix$MKDIR_P ;;\n  esac\n_ACEOF\n\ncat >>$CONFIG_STATUS <<\\_ACEOF || ac_write_fail=1\n# If the template does not know about datarootdir, expand it.\n# FIXME: This hack should be removed a few years after 2.60.\nac_datarootdir_hack=; ac_datarootdir_seen=\nac_sed_dataroot='\n/datarootdir/ {\n  p\n  q\n}\n/@datadir@/p\n/@docdir@/p\n/@infodir@/p\n/@localedir@/p\n/@mandir@/p'\ncase `eval \"sed -n \\\"\\$ac_sed_dataroot\\\" $ac_file_inputs\"` in\n*datarootdir*) ac_datarootdir_seen=yes;;\n*@datadir@*|*@docdir@*|*@infodir@*|*@localedir@*|*@mandir@*)\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: WARNING: $ac_file_inputs seems to ignore the --datarootdir setting\" >&5\n$as_echo \"$as_me: WARNING: $ac_file_inputs seems to ignore the --datarootdir setting\" >&2;}\n_ACEOF\ncat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1\n  ac_datarootdir_hack='\n  s&@datadir@&$datadir&g\n  s&@docdir@&$docdir&g\n  s&@infodir@&$infodir&g\n  s&@localedir@&$localedir&g\n  s&@mandir@&$mandir&g\n  s&\\\\\\${datarootdir}&$datarootdir&g' ;;\nesac\n_ACEOF\n\n# Neutralize VPATH when `$srcdir' = `.'.\n# Shell code in configure.ac might set extrasub.\n# FIXME: do we really want to maintain this feature?\ncat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1\nac_sed_extra=\"$ac_vpsub\n$extrasub\n_ACEOF\ncat >>$CONFIG_STATUS <<\\_ACEOF || ac_write_fail=1\n:t\n/@[a-zA-Z_][a-zA-Z_0-9]*@/!b\ns|@configure_input@|$ac_sed_conf_input|;t t\ns&@top_builddir@&$ac_top_builddir_sub&;t t\ns&@top_build_prefix@&$ac_top_build_prefix&;t t\ns&@srcdir@&$ac_srcdir&;t t\ns&@abs_srcdir@&$ac_abs_srcdir&;t t\ns&@top_srcdir@&$ac_top_srcdir&;t t\ns&@abs_top_srcdir@&$ac_abs_top_srcdir&;t t\ns&@builddir@&$ac_builddir&;t t\ns&@abs_builddir@&$ac_abs_builddir&;t t\ns&@abs_top_builddir@&$ac_abs_top_builddir&;t t\ns&@INSTALL@&$ac_INSTALL&;t t\ns&@MKDIR_P@&$ac_MKDIR_P&;t t\n$ac_datarootdir_hack\n\"\neval sed \\\"\\$ac_sed_extra\\\" \"$ac_file_inputs\" | $AWK -f \"$ac_tmp/subs.awk\" \\\n  >$ac_tmp/out || as_fn_error $? \"could not create $ac_file\" \"$LINENO\" 5\n\ntest -z \"$ac_datarootdir_hack$ac_datarootdir_seen\" &&\n  { ac_out=`sed -n '/\\${datarootdir}/p' \"$ac_tmp/out\"`; test -n \"$ac_out\"; } &&\n  { ac_out=`sed -n '/^[\t ]*datarootdir[\t ]*:*=/p' \\\n      \"$ac_tmp/out\"`; test -z \"$ac_out\"; } &&\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: WARNING: $ac_file contains a reference to the variable \\`datarootdir'\nwhich seems to be undefined.  Please make sure it is defined\" >&5\n$as_echo \"$as_me: WARNING: $ac_file contains a reference to the variable \\`datarootdir'\nwhich seems to be undefined.  Please make sure it is defined\" >&2;}\n\n  rm -f \"$ac_tmp/stdin\"\n  case $ac_file in\n  -) cat \"$ac_tmp/out\" && rm -f \"$ac_tmp/out\";;\n  *) rm -f \"$ac_file\" && mv \"$ac_tmp/out\" \"$ac_file\";;\n  esac \\\n  || as_fn_error $? \"could not create $ac_file\" \"$LINENO\" 5\n ;;\n  :H)\n  #\n  # CONFIG_HEADER\n  #\n  if test x\"$ac_file\" != x-; then\n    {\n      $as_echo \"/* $configure_input  */\" \\\n      && eval '$AWK -f \"$ac_tmp/defines.awk\"' \"$ac_file_inputs\"\n    } >\"$ac_tmp/config.h\" \\\n      || as_fn_error $? \"could not create $ac_file\" \"$LINENO\" 5\n    if diff \"$ac_file\" \"$ac_tmp/config.h\" >/dev/null 2>&1; then\n      { $as_echo \"$as_me:${as_lineno-$LINENO}: $ac_file is unchanged\" >&5\n$as_echo \"$as_me: $ac_file is unchanged\" >&6;}\n    else\n      rm -f \"$ac_file\"\n      mv \"$ac_tmp/config.h\" \"$ac_file\" \\\n\t|| as_fn_error $? \"could not create $ac_file\" \"$LINENO\" 5\n    fi\n  else\n    $as_echo \"/* $configure_input  */\" \\\n      && eval '$AWK -f \"$ac_tmp/defines.awk\"' \"$ac_file_inputs\" \\\n      || as_fn_error $? \"could not create -\" \"$LINENO\" 5\n  fi\n# Compute \"$ac_file\"'s index in $config_headers.\n_am_arg=\"$ac_file\"\n_am_stamp_count=1\nfor _am_header in $config_headers :; do\n  case $_am_header in\n    $_am_arg | $_am_arg:* )\n      break ;;\n    * )\n      _am_stamp_count=`expr $_am_stamp_count + 1` ;;\n  esac\ndone\necho \"timestamp for $_am_arg\" >`$as_dirname -- \"$_am_arg\" ||\n$as_expr X\"$_am_arg\" : 'X\\(.*[^/]\\)//*[^/][^/]*/*$' \\| \\\n\t X\"$_am_arg\" : 'X\\(//\\)[^/]' \\| \\\n\t X\"$_am_arg\" : 'X\\(//\\)$' \\| \\\n\t X\"$_am_arg\" : 'X\\(/\\)' \\| . 2>/dev/null ||\n$as_echo X\"$_am_arg\" |\n    sed '/^X\\(.*[^/]\\)\\/\\/*[^/][^/]*\\/*$/{\n\t    s//\\1/\n\t    q\n\t  }\n\t  /^X\\(\\/\\/\\)[^/].*/{\n\t    s//\\1/\n\t    q\n\t  }\n\t  /^X\\(\\/\\/\\)$/{\n\t    s//\\1/\n\t    q\n\t  }\n\t  /^X\\(\\/\\).*/{\n\t    s//\\1/\n\t    q\n\t  }\n\t  s/.*/./; q'`/stamp-h$_am_stamp_count\n ;;\n\n  :C)  { $as_echo \"$as_me:${as_lineno-$LINENO}: executing $ac_file commands\" >&5\n$as_echo \"$as_me: executing $ac_file commands\" >&6;}\n ;;\n  esac\n\n\n  case $ac_file$ac_mode in\n    \"depfiles\":C) test x\"$AMDEP_TRUE\" != x\"\" || {\n  # Older Autoconf quotes --file arguments for eval, but not when files\n  # are listed without --file.  Let's play safe and only enable the eval\n  # if we detect the quoting.\n  case $CONFIG_FILES in\n  *\\'*) eval set x \"$CONFIG_FILES\" ;;\n  *)   set x $CONFIG_FILES ;;\n  esac\n  shift\n  for mf\n  do\n    # Strip MF so we end up with the name of the file.\n    mf=`echo \"$mf\" | sed -e 's/:.*$//'`\n    # Check whether this is an Automake generated Makefile or not.\n    # We used to match only the files named 'Makefile.in', but\n    # some people rename them; so instead we look at the file content.\n    # Grep'ing the first line is not enough: some people post-process\n    # each Makefile.in and add a new line on top of each file to say so.\n    # Grep'ing the whole file is not good either: AIX grep has a line\n    # limit of 2048, but all sed's we know have understand at least 4000.\n    if sed -n 's,^#.*generated by automake.*,X,p' \"$mf\" | grep X >/dev/null 2>&1; then\n      dirpart=`$as_dirname -- \"$mf\" ||\n$as_expr X\"$mf\" : 'X\\(.*[^/]\\)//*[^/][^/]*/*$' \\| \\\n\t X\"$mf\" : 'X\\(//\\)[^/]' \\| \\\n\t X\"$mf\" : 'X\\(//\\)$' \\| \\\n\t X\"$mf\" : 'X\\(/\\)' \\| . 2>/dev/null ||\n$as_echo X\"$mf\" |\n    sed '/^X\\(.*[^/]\\)\\/\\/*[^/][^/]*\\/*$/{\n\t    s//\\1/\n\t    q\n\t  }\n\t  /^X\\(\\/\\/\\)[^/].*/{\n\t    s//\\1/\n\t    q\n\t  }\n\t  /^X\\(\\/\\/\\)$/{\n\t    s//\\1/\n\t    q\n\t  }\n\t  /^X\\(\\/\\).*/{\n\t    s//\\1/\n\t    q\n\t  }\n\t  s/.*/./; q'`\n    else\n      continue\n    fi\n    # Extract the definition of DEPDIR, am__include, and am__quote\n    # from the Makefile without running 'make'.\n    DEPDIR=`sed -n 's/^DEPDIR = //p' < \"$mf\"`\n    test -z \"$DEPDIR\" && continue\n    am__include=`sed -n 's/^am__include = //p' < \"$mf\"`\n    test -z \"$am__include\" && continue\n    am__quote=`sed -n 's/^am__quote = //p' < \"$mf\"`\n    # Find all dependency output files, they are included files with\n    # $(DEPDIR) in their names.  We invoke sed twice because it is the\n    # simplest approach to changing $(DEPDIR) to its actual value in the\n    # expansion.\n    for file in `sed -n \"\n      s/^$am__include $am__quote\\(.*(DEPDIR).*\\)$am__quote\"'$/\\1/p' <\"$mf\" | \\\n\t sed -e 's/\\$(DEPDIR)/'\"$DEPDIR\"'/g'`; do\n      # Make sure the directory exists.\n      test -f \"$dirpart/$file\" && continue\n      fdir=`$as_dirname -- \"$file\" ||\n$as_expr X\"$file\" : 'X\\(.*[^/]\\)//*[^/][^/]*/*$' \\| \\\n\t X\"$file\" : 'X\\(//\\)[^/]' \\| \\\n\t X\"$file\" : 'X\\(//\\)$' \\| \\\n\t X\"$file\" : 'X\\(/\\)' \\| . 2>/dev/null ||\n$as_echo X\"$file\" |\n    sed '/^X\\(.*[^/]\\)\\/\\/*[^/][^/]*\\/*$/{\n\t    s//\\1/\n\t    q\n\t  }\n\t  /^X\\(\\/\\/\\)[^/].*/{\n\t    s//\\1/\n\t    q\n\t  }\n\t  /^X\\(\\/\\/\\)$/{\n\t    s//\\1/\n\t    q\n\t  }\n\t  /^X\\(\\/\\).*/{\n\t    s//\\1/\n\t    q\n\t  }\n\t  s/.*/./; q'`\n      as_dir=$dirpart/$fdir; as_fn_mkdir_p\n      # echo \"creating $dirpart/$file\"\n      echo '# dummy' > \"$dirpart/$file\"\n    done\n  done\n}\n ;;\n    \"libtool\":C)\n\n    # See if we are running on zsh, and set the options that allow our\n    # commands through without removal of \\ escapes.\n    if test -n \"${ZSH_VERSION+set}\"; then\n      setopt NO_GLOB_SUBST\n    fi\n\n    cfgfile=${ofile}T\n    trap \"$RM \\\"$cfgfile\\\"; exit 1\" 1 2 15\n    $RM \"$cfgfile\"\n\n    cat <<_LT_EOF >> \"$cfgfile\"\n#! $SHELL\n# Generated automatically by $as_me ($PACKAGE) $VERSION\n# NOTE: Changes made to this file will be lost: look at ltmain.sh.\n\n# Provide generalized library-building support services.\n# Written by Gordon Matzigkeit, 1996\n\n# Copyright (C) 2014 Free Software Foundation, Inc.\n# This is free software; see the source for copying conditions.  There is NO\n# warranty; not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.\n\n# GNU Libtool is free software; you can redistribute it and/or modify\n# it under the terms of the GNU General Public License as published by\n# the Free Software Foundation; either version 2 of of the License, or\n# (at your option) any later version.\n#\n# As a special exception to the GNU General Public License, if you\n# distribute this file as part of a program or library that is built\n# using GNU Libtool, you may include this file under the  same\n# distribution terms that you use for the rest of that program.\n#\n# GNU Libtool is distributed in the hope that it will be useful, but\n# WITHOUT ANY WARRANTY; without even the implied warranty of\n# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n# GNU General Public License for more details.\n#\n# You should have received a copy of the GNU General Public License\n# along with this program.  If not, see <http://www.gnu.org/licenses/>.\n\n\n# The names of the tagged configurations supported by this script.\navailable_tags='CXX '\n\n# Configured defaults for sys_lib_dlsearch_path munging.\n: \\${LT_SYS_LIBRARY_PATH=\"$configure_time_lt_sys_library_path\"}\n\n# ### BEGIN LIBTOOL CONFIG\n\n# Whether or not to build static libraries.\nbuild_old_libs=$enable_static\n\n# Which release of libtool.m4 was used?\nmacro_version=$macro_version\nmacro_revision=$macro_revision\n\n# Whether or not to build shared libraries.\nbuild_libtool_libs=$enable_shared\n\n# What type of objects to build.\npic_mode=$pic_mode\n\n# Whether or not to optimize for fast installation.\nfast_install=$enable_fast_install\n\n# Shared archive member basename,for filename based shared library versioning on AIX.\nshared_archive_member_spec=$shared_archive_member_spec\n\n# Shell to use when invoking shell scripts.\nSHELL=$lt_SHELL\n\n# An echo program that protects backslashes.\nECHO=$lt_ECHO\n\n# The PATH separator for the build system.\nPATH_SEPARATOR=$lt_PATH_SEPARATOR\n\n# The host system.\nhost_alias=$host_alias\nhost=$host\nhost_os=$host_os\n\n# The build system.\nbuild_alias=$build_alias\nbuild=$build\nbuild_os=$build_os\n\n# A sed program that does not truncate output.\nSED=$lt_SED\n\n# Sed that helps us avoid accidentally triggering echo(1) options like -n.\nXsed=\"\\$SED -e 1s/^X//\"\n\n# A grep program that handles long lines.\nGREP=$lt_GREP\n\n# An ERE matcher.\nEGREP=$lt_EGREP\n\n# A literal string matcher.\nFGREP=$lt_FGREP\n\n# A BSD- or MS-compatible name lister.\nNM=$lt_NM\n\n# Whether we need soft or hard links.\nLN_S=$lt_LN_S\n\n# What is the maximum length of a command?\nmax_cmd_len=$max_cmd_len\n\n# Object file suffix (normally \"o\").\nobjext=$ac_objext\n\n# Executable file suffix (normally \"\").\nexeext=$exeext\n\n# whether the shell understands \"unset\".\nlt_unset=$lt_unset\n\n# turn spaces into newlines.\nSP2NL=$lt_lt_SP2NL\n\n# turn newlines into spaces.\nNL2SP=$lt_lt_NL2SP\n\n# convert \\$build file names to \\$host format.\nto_host_file_cmd=$lt_cv_to_host_file_cmd\n\n# convert \\$build files to toolchain format.\nto_tool_file_cmd=$lt_cv_to_tool_file_cmd\n\n# An object symbol dumper.\nOBJDUMP=$lt_OBJDUMP\n\n# Method to check whether dependent libraries are shared objects.\ndeplibs_check_method=$lt_deplibs_check_method\n\n# Command to use when deplibs_check_method = \"file_magic\".\nfile_magic_cmd=$lt_file_magic_cmd\n\n# How to find potential files when deplibs_check_method = \"file_magic\".\nfile_magic_glob=$lt_file_magic_glob\n\n# Find potential files using nocaseglob when deplibs_check_method = \"file_magic\".\nwant_nocaseglob=$lt_want_nocaseglob\n\n# DLL creation program.\nDLLTOOL=$lt_DLLTOOL\n\n# Command to associate shared and link libraries.\nsharedlib_from_linklib_cmd=$lt_sharedlib_from_linklib_cmd\n\n# The archiver.\nAR=$lt_AR\n\n# Flags to create an archive.\nAR_FLAGS=$lt_AR_FLAGS\n\n# How to feed a file listing to the archiver.\narchiver_list_spec=$lt_archiver_list_spec\n\n# A symbol stripping program.\nSTRIP=$lt_STRIP\n\n# Commands used to install an old-style archive.\nRANLIB=$lt_RANLIB\nold_postinstall_cmds=$lt_old_postinstall_cmds\nold_postuninstall_cmds=$lt_old_postuninstall_cmds\n\n# Whether to use a lock for old archive extraction.\nlock_old_archive_extraction=$lock_old_archive_extraction\n\n# A C compiler.\nLTCC=$lt_CC\n\n# LTCC compiler flags.\nLTCFLAGS=$lt_CFLAGS\n\n# Take the output of nm and produce a listing of raw symbols and C names.\nglobal_symbol_pipe=$lt_lt_cv_sys_global_symbol_pipe\n\n# Transform the output of nm in a proper C declaration.\nglobal_symbol_to_cdecl=$lt_lt_cv_sys_global_symbol_to_cdecl\n\n# Transform the output of nm into a list of symbols to manually relocate.\nglobal_symbol_to_import=$lt_lt_cv_sys_global_symbol_to_import\n\n# Transform the output of nm in a C name address pair.\nglobal_symbol_to_c_name_address=$lt_lt_cv_sys_global_symbol_to_c_name_address\n\n# Transform the output of nm in a C name address pair when lib prefix is needed.\nglobal_symbol_to_c_name_address_lib_prefix=$lt_lt_cv_sys_global_symbol_to_c_name_address_lib_prefix\n\n# The name lister interface.\nnm_interface=$lt_lt_cv_nm_interface\n\n# Specify filename containing input files for \\$NM.\nnm_file_list_spec=$lt_nm_file_list_spec\n\n# The root where to search for dependent libraries,and where our libraries should be installed.\nlt_sysroot=$lt_sysroot\n\n# Command to truncate a binary pipe.\nlt_truncate_bin=$lt_lt_cv_truncate_bin\n\n# The name of the directory that contains temporary libtool files.\nobjdir=$objdir\n\n# Used to examine libraries when file_magic_cmd begins with \"file\".\nMAGIC_CMD=$MAGIC_CMD\n\n# Must we lock files when doing compilation?\nneed_locks=$lt_need_locks\n\n# Manifest tool.\nMANIFEST_TOOL=$lt_MANIFEST_TOOL\n\n# Tool to manipulate archived DWARF debug symbol files on Mac OS X.\nDSYMUTIL=$lt_DSYMUTIL\n\n# Tool to change global to local symbols on Mac OS X.\nNMEDIT=$lt_NMEDIT\n\n# Tool to manipulate fat objects and archives on Mac OS X.\nLIPO=$lt_LIPO\n\n# ldd/readelf like tool for Mach-O binaries on Mac OS X.\nOTOOL=$lt_OTOOL\n\n# ldd/readelf like tool for 64 bit Mach-O binaries on Mac OS X 10.4.\nOTOOL64=$lt_OTOOL64\n\n# Old archive suffix (normally \"a\").\nlibext=$libext\n\n# Shared library suffix (normally \".so\").\nshrext_cmds=$lt_shrext_cmds\n\n# The commands to extract the exported symbol list from a shared archive.\nextract_expsyms_cmds=$lt_extract_expsyms_cmds\n\n# Variables whose values should be saved in libtool wrapper scripts and\n# restored at link time.\nvariables_saved_for_relink=$lt_variables_saved_for_relink\n\n# Do we need the \"lib\" prefix for modules?\nneed_lib_prefix=$need_lib_prefix\n\n# Do we need a version for libraries?\nneed_version=$need_version\n\n# Library versioning type.\nversion_type=$version_type\n\n# Shared library runtime path variable.\nrunpath_var=$runpath_var\n\n# Shared library path variable.\nshlibpath_var=$shlibpath_var\n\n# Is shlibpath searched before the hard-coded library search path?\nshlibpath_overrides_runpath=$shlibpath_overrides_runpath\n\n# Format of library name prefix.\nlibname_spec=$lt_libname_spec\n\n# List of archive names.  First name is the real one, the rest are links.\n# The last name is the one that the linker finds with -lNAME\nlibrary_names_spec=$lt_library_names_spec\n\n# The coded name of the library, if different from the real name.\nsoname_spec=$lt_soname_spec\n\n# Permission mode override for installation of shared libraries.\ninstall_override_mode=$lt_install_override_mode\n\n# Command to use after installation of a shared archive.\npostinstall_cmds=$lt_postinstall_cmds\n\n# Command to use after uninstallation of a shared archive.\npostuninstall_cmds=$lt_postuninstall_cmds\n\n# Commands used to finish a libtool library installation in a directory.\nfinish_cmds=$lt_finish_cmds\n\n# As \"finish_cmds\", except a single script fragment to be evaled but\n# not shown.\nfinish_eval=$lt_finish_eval\n\n# Whether we should hardcode library paths into libraries.\nhardcode_into_libs=$hardcode_into_libs\n\n# Compile-time system search path for libraries.\nsys_lib_search_path_spec=$lt_sys_lib_search_path_spec\n\n# Detected run-time system search path for libraries.\nsys_lib_dlsearch_path_spec=$lt_configure_time_dlsearch_path\n\n# Explicit LT_SYS_LIBRARY_PATH set during ./configure time.\nconfigure_time_lt_sys_library_path=$lt_configure_time_lt_sys_library_path\n\n# Whether dlopen is supported.\ndlopen_support=$enable_dlopen\n\n# Whether dlopen of programs is supported.\ndlopen_self=$enable_dlopen_self\n\n# Whether dlopen of statically linked programs is supported.\ndlopen_self_static=$enable_dlopen_self_static\n\n# Commands to strip libraries.\nold_striplib=$lt_old_striplib\nstriplib=$lt_striplib\n\n\n# The linker used to build libraries.\nLD=$lt_LD\n\n# How to create reloadable object files.\nreload_flag=$lt_reload_flag\nreload_cmds=$lt_reload_cmds\n\n# Commands used to build an old-style archive.\nold_archive_cmds=$lt_old_archive_cmds\n\n# A language specific compiler.\nCC=$lt_compiler\n\n# Is the compiler the GNU compiler?\nwith_gcc=$GCC\n\n# Compiler flag to turn off builtin functions.\nno_builtin_flag=$lt_lt_prog_compiler_no_builtin_flag\n\n# Additional compiler flags for building library objects.\npic_flag=$lt_lt_prog_compiler_pic\n\n# How to pass a linker flag through the compiler.\nwl=$lt_lt_prog_compiler_wl\n\n# Compiler flag to prevent dynamic linking.\nlink_static_flag=$lt_lt_prog_compiler_static\n\n# Does compiler simultaneously support -c and -o options?\ncompiler_c_o=$lt_lt_cv_prog_compiler_c_o\n\n# Whether or not to add -lc for building shared libraries.\nbuild_libtool_need_lc=$archive_cmds_need_lc\n\n# Whether or not to disallow shared libs when runtime libs are static.\nallow_libtool_libs_with_static_runtimes=$enable_shared_with_static_runtimes\n\n# Compiler flag to allow reflexive dlopens.\nexport_dynamic_flag_spec=$lt_export_dynamic_flag_spec\n\n# Compiler flag to generate shared objects directly from archives.\nwhole_archive_flag_spec=$lt_whole_archive_flag_spec\n\n# Whether the compiler copes with passing no objects directly.\ncompiler_needs_object=$lt_compiler_needs_object\n\n# Create an old-style archive from a shared archive.\nold_archive_from_new_cmds=$lt_old_archive_from_new_cmds\n\n# Create a temporary old-style archive to link instead of a shared archive.\nold_archive_from_expsyms_cmds=$lt_old_archive_from_expsyms_cmds\n\n# Commands used to build a shared archive.\narchive_cmds=$lt_archive_cmds\narchive_expsym_cmds=$lt_archive_expsym_cmds\n\n# Commands used to build a loadable module if different from building\n# a shared archive.\nmodule_cmds=$lt_module_cmds\nmodule_expsym_cmds=$lt_module_expsym_cmds\n\n# Whether we are building with GNU ld or not.\nwith_gnu_ld=$lt_with_gnu_ld\n\n# Flag that allows shared libraries with undefined symbols to be built.\nallow_undefined_flag=$lt_allow_undefined_flag\n\n# Flag that enforces no undefined symbols.\nno_undefined_flag=$lt_no_undefined_flag\n\n# Flag to hardcode \\$libdir into a binary during linking.\n# This must work even if \\$libdir does not exist\nhardcode_libdir_flag_spec=$lt_hardcode_libdir_flag_spec\n\n# Whether we need a single \"-rpath\" flag with a separated argument.\nhardcode_libdir_separator=$lt_hardcode_libdir_separator\n\n# Set to \"yes\" if using DIR/libNAME\\$shared_ext during linking hardcodes\n# DIR into the resulting binary.\nhardcode_direct=$hardcode_direct\n\n# Set to \"yes\" if using DIR/libNAME\\$shared_ext during linking hardcodes\n# DIR into the resulting binary and the resulting library dependency is\n# \"absolute\",i.e impossible to change by setting \\$shlibpath_var if the\n# library is relocated.\nhardcode_direct_absolute=$hardcode_direct_absolute\n\n# Set to \"yes\" if using the -LDIR flag during linking hardcodes DIR\n# into the resulting binary.\nhardcode_minus_L=$hardcode_minus_L\n\n# Set to \"yes\" if using SHLIBPATH_VAR=DIR during linking hardcodes DIR\n# into the resulting binary.\nhardcode_shlibpath_var=$hardcode_shlibpath_var\n\n# Set to \"yes\" if building a shared library automatically hardcodes DIR\n# into the library and all subsequent libraries and executables linked\n# against it.\nhardcode_automatic=$hardcode_automatic\n\n# Set to yes if linker adds runtime paths of dependent libraries\n# to runtime path list.\ninherit_rpath=$inherit_rpath\n\n# Whether libtool must link a program against all its dependency libraries.\nlink_all_deplibs=$link_all_deplibs\n\n# Set to \"yes\" if exported symbols are required.\nalways_export_symbols=$always_export_symbols\n\n# The commands to list exported symbols.\nexport_symbols_cmds=$lt_export_symbols_cmds\n\n# Symbols that should not be listed in the preloaded symbols.\nexclude_expsyms=$lt_exclude_expsyms\n\n# Symbols that must always be exported.\ninclude_expsyms=$lt_include_expsyms\n\n# Commands necessary for linking programs (against libraries) with templates.\nprelink_cmds=$lt_prelink_cmds\n\n# Commands necessary for finishing linking programs.\npostlink_cmds=$lt_postlink_cmds\n\n# Specify filename containing input files.\nfile_list_spec=$lt_file_list_spec\n\n# How to hardcode a shared library path into an executable.\nhardcode_action=$hardcode_action\n\n# The directories searched by this compiler when creating a shared library.\ncompiler_lib_search_dirs=$lt_compiler_lib_search_dirs\n\n# Dependencies to place before and after the objects being linked to\n# create a shared library.\npredep_objects=$lt_predep_objects\npostdep_objects=$lt_postdep_objects\npredeps=$lt_predeps\npostdeps=$lt_postdeps\n\n# The library search path used internally by the compiler when linking\n# a shared library.\ncompiler_lib_search_path=$lt_compiler_lib_search_path\n\n# ### END LIBTOOL CONFIG\n\n_LT_EOF\n\n    cat <<'_LT_EOF' >> \"$cfgfile\"\n\n# ### BEGIN FUNCTIONS SHARED WITH CONFIGURE\n\n# func_munge_path_list VARIABLE PATH\n# -----------------------------------\n# VARIABLE is name of variable containing _space_ separated list of\n# directories to be munged by the contents of PATH, which is string\n# having a format:\n# \"DIR[:DIR]:\"\n#       string \"DIR[ DIR]\" will be prepended to VARIABLE\n# \":DIR[:DIR]\"\n#       string \"DIR[ DIR]\" will be appended to VARIABLE\n# \"DIRP[:DIRP]::[DIRA:]DIRA\"\n#       string \"DIRP[ DIRP]\" will be prepended to VARIABLE and string\n#       \"DIRA[ DIRA]\" will be appended to VARIABLE\n# \"DIR[:DIR]\"\n#       VARIABLE will be replaced by \"DIR[ DIR]\"\nfunc_munge_path_list ()\n{\n    case x$2 in\n    x)\n        ;;\n    *:)\n        eval $1=\\\"`$ECHO $2 | $SED 's/:/ /g'` \\$$1\\\"\n        ;;\n    x:*)\n        eval $1=\\\"\\$$1 `$ECHO $2 | $SED 's/:/ /g'`\\\"\n        ;;\n    *::*)\n        eval $1=\\\"\\$$1\\ `$ECHO $2 | $SED -e 's/.*:://' -e 's/:/ /g'`\\\"\n        eval $1=\\\"`$ECHO $2 | $SED -e 's/::.*//' -e 's/:/ /g'`\\ \\$$1\\\"\n        ;;\n    *)\n        eval $1=\\\"`$ECHO $2 | $SED 's/:/ /g'`\\\"\n        ;;\n    esac\n}\n\n\n# Calculate cc_basename.  Skip known compiler wrappers and cross-prefix.\nfunc_cc_basename ()\n{\n    for cc_temp in $*\"\"; do\n      case $cc_temp in\n        compile | *[\\\\/]compile | ccache | *[\\\\/]ccache ) ;;\n        distcc | *[\\\\/]distcc | purify | *[\\\\/]purify ) ;;\n        \\-*) ;;\n        *) break;;\n      esac\n    done\n    func_cc_basename_result=`$ECHO \"$cc_temp\" | $SED \"s%.*/%%; s%^$host_alias-%%\"`\n}\n\n\n# ### END FUNCTIONS SHARED WITH CONFIGURE\n\n_LT_EOF\n\n  case $host_os in\n  aix3*)\n    cat <<\\_LT_EOF >> \"$cfgfile\"\n# AIX sometimes has problems with the GCC collect2 program.  For some\n# reason, if we set the COLLECT_NAMES environment variable, the problems\n# vanish in a puff of smoke.\nif test set != \"${COLLECT_NAMES+set}\"; then\n  COLLECT_NAMES=\n  export COLLECT_NAMES\nfi\n_LT_EOF\n    ;;\n  esac\n\n\nltmain=$ac_aux_dir/ltmain.sh\n\n\n  # We use sed instead of cat because bash on DJGPP gets confused if\n  # if finds mixed CR/LF and LF-only lines.  Since sed operates in\n  # text mode, it properly converts lines to CR/LF.  This bash problem\n  # is reportedly fixed, but why not run on old versions too?\n  sed '$q' \"$ltmain\" >> \"$cfgfile\" \\\n     || (rm -f \"$cfgfile\"; exit 1)\n\n   mv -f \"$cfgfile\" \"$ofile\" ||\n    (rm -f \"$ofile\" && cp \"$cfgfile\" \"$ofile\" && rm -f \"$cfgfile\")\n  chmod +x \"$ofile\"\n\n\n    cat <<_LT_EOF >> \"$ofile\"\n\n# ### BEGIN LIBTOOL TAG CONFIG: CXX\n\n# The linker used to build libraries.\nLD=$lt_LD_CXX\n\n# How to create reloadable object files.\nreload_flag=$lt_reload_flag_CXX\nreload_cmds=$lt_reload_cmds_CXX\n\n# Commands used to build an old-style archive.\nold_archive_cmds=$lt_old_archive_cmds_CXX\n\n# A language specific compiler.\nCC=$lt_compiler_CXX\n\n# Is the compiler the GNU compiler?\nwith_gcc=$GCC_CXX\n\n# Compiler flag to turn off builtin functions.\nno_builtin_flag=$lt_lt_prog_compiler_no_builtin_flag_CXX\n\n# Additional compiler flags for building library objects.\npic_flag=$lt_lt_prog_compiler_pic_CXX\n\n# How to pass a linker flag through the compiler.\nwl=$lt_lt_prog_compiler_wl_CXX\n\n# Compiler flag to prevent dynamic linking.\nlink_static_flag=$lt_lt_prog_compiler_static_CXX\n\n# Does compiler simultaneously support -c and -o options?\ncompiler_c_o=$lt_lt_cv_prog_compiler_c_o_CXX\n\n# Whether or not to add -lc for building shared libraries.\nbuild_libtool_need_lc=$archive_cmds_need_lc_CXX\n\n# Whether or not to disallow shared libs when runtime libs are static.\nallow_libtool_libs_with_static_runtimes=$enable_shared_with_static_runtimes_CXX\n\n# Compiler flag to allow reflexive dlopens.\nexport_dynamic_flag_spec=$lt_export_dynamic_flag_spec_CXX\n\n# Compiler flag to generate shared objects directly from archives.\nwhole_archive_flag_spec=$lt_whole_archive_flag_spec_CXX\n\n# Whether the compiler copes with passing no objects directly.\ncompiler_needs_object=$lt_compiler_needs_object_CXX\n\n# Create an old-style archive from a shared archive.\nold_archive_from_new_cmds=$lt_old_archive_from_new_cmds_CXX\n\n# Create a temporary old-style archive to link instead of a shared archive.\nold_archive_from_expsyms_cmds=$lt_old_archive_from_expsyms_cmds_CXX\n\n# Commands used to build a shared archive.\narchive_cmds=$lt_archive_cmds_CXX\narchive_expsym_cmds=$lt_archive_expsym_cmds_CXX\n\n# Commands used to build a loadable module if different from building\n# a shared archive.\nmodule_cmds=$lt_module_cmds_CXX\nmodule_expsym_cmds=$lt_module_expsym_cmds_CXX\n\n# Whether we are building with GNU ld or not.\nwith_gnu_ld=$lt_with_gnu_ld_CXX\n\n# Flag that allows shared libraries with undefined symbols to be built.\nallow_undefined_flag=$lt_allow_undefined_flag_CXX\n\n# Flag that enforces no undefined symbols.\nno_undefined_flag=$lt_no_undefined_flag_CXX\n\n# Flag to hardcode \\$libdir into a binary during linking.\n# This must work even if \\$libdir does not exist\nhardcode_libdir_flag_spec=$lt_hardcode_libdir_flag_spec_CXX\n\n# Whether we need a single \"-rpath\" flag with a separated argument.\nhardcode_libdir_separator=$lt_hardcode_libdir_separator_CXX\n\n# Set to \"yes\" if using DIR/libNAME\\$shared_ext during linking hardcodes\n# DIR into the resulting binary.\nhardcode_direct=$hardcode_direct_CXX\n\n# Set to \"yes\" if using DIR/libNAME\\$shared_ext during linking hardcodes\n# DIR into the resulting binary and the resulting library dependency is\n# \"absolute\",i.e impossible to change by setting \\$shlibpath_var if the\n# library is relocated.\nhardcode_direct_absolute=$hardcode_direct_absolute_CXX\n\n# Set to \"yes\" if using the -LDIR flag during linking hardcodes DIR\n# into the resulting binary.\nhardcode_minus_L=$hardcode_minus_L_CXX\n\n# Set to \"yes\" if using SHLIBPATH_VAR=DIR during linking hardcodes DIR\n# into the resulting binary.\nhardcode_shlibpath_var=$hardcode_shlibpath_var_CXX\n\n# Set to \"yes\" if building a shared library automatically hardcodes DIR\n# into the library and all subsequent libraries and executables linked\n# against it.\nhardcode_automatic=$hardcode_automatic_CXX\n\n# Set to yes if linker adds runtime paths of dependent libraries\n# to runtime path list.\ninherit_rpath=$inherit_rpath_CXX\n\n# Whether libtool must link a program against all its dependency libraries.\nlink_all_deplibs=$link_all_deplibs_CXX\n\n# Set to \"yes\" if exported symbols are required.\nalways_export_symbols=$always_export_symbols_CXX\n\n# The commands to list exported symbols.\nexport_symbols_cmds=$lt_export_symbols_cmds_CXX\n\n# Symbols that should not be listed in the preloaded symbols.\nexclude_expsyms=$lt_exclude_expsyms_CXX\n\n# Symbols that must always be exported.\ninclude_expsyms=$lt_include_expsyms_CXX\n\n# Commands necessary for linking programs (against libraries) with templates.\nprelink_cmds=$lt_prelink_cmds_CXX\n\n# Commands necessary for finishing linking programs.\npostlink_cmds=$lt_postlink_cmds_CXX\n\n# Specify filename containing input files.\nfile_list_spec=$lt_file_list_spec_CXX\n\n# How to hardcode a shared library path into an executable.\nhardcode_action=$hardcode_action_CXX\n\n# The directories searched by this compiler when creating a shared library.\ncompiler_lib_search_dirs=$lt_compiler_lib_search_dirs_CXX\n\n# Dependencies to place before and after the objects being linked to\n# create a shared library.\npredep_objects=$lt_predep_objects_CXX\npostdep_objects=$lt_postdep_objects_CXX\npredeps=$lt_predeps_CXX\npostdeps=$lt_postdeps_CXX\n\n# The library search path used internally by the compiler when linking\n# a shared library.\ncompiler_lib_search_path=$lt_compiler_lib_search_path_CXX\n\n# ### END LIBTOOL TAG CONFIG: CXX\n_LT_EOF\n\n ;;\n\n  esac\ndone # for ac_tag\n\n\nas_fn_exit 0\n_ACEOF\nac_clean_files=$ac_clean_files_save\n\ntest $ac_write_fail = 0 ||\n  as_fn_error $? \"write failure creating $CONFIG_STATUS\" \"$LINENO\" 5\n\n\n# configure is writing to config.log, and then calls config.status.\n# config.status does its own redirection, appending to config.log.\n# Unfortunately, on DOS this fails, as config.log is still kept open\n# by configure, so config.status won't be able to write to it; its\n# output is simply discarded.  So we exec the FD to /dev/null,\n# effectively closing config.log, so it can be properly (re)opened and\n# appended to by config.status.  When coming back to configure, we\n# need to make the FD available again.\nif test \"$no_create\" != yes; then\n  ac_cs_success=:\n  ac_config_status_args=\n  test \"$silent\" = yes &&\n    ac_config_status_args=\"$ac_config_status_args --quiet\"\n  exec 5>/dev/null\n  $SHELL $CONFIG_STATUS $ac_config_status_args || ac_cs_success=false\n  exec 5>>config.log\n  # Use ||, not &&, to avoid exiting from the if with $? = 1, which\n  # would make configure fail if this is the last instruction.\n  $ac_cs_success || as_fn_exit 1\nfi\nif test -n \"$ac_unrecognized_opts\" && test \"$enable_option_checking\" != no; then\n  { $as_echo \"$as_me:${as_lineno-$LINENO}: WARNING: unrecognized options: $ac_unrecognized_opts\" >&5\n$as_echo \"$as_me: WARNING: unrecognized options: $ac_unrecognized_opts\" >&2;}\nfi\n\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/configure.ac",
    "content": "AC_INIT([OpenFst], [1.6.9], [help@www.openfst.org])\nAM_INIT_AUTOMAKE([foreign nostdinc -Wall -Werror subdir-objects])\nAM_PROG_AR\n\n# OpenFst does not throw exceptions, so we do not generate exception handling\n# code. However, users are free to re-enable exception handling.\n# OpenFst assumes char is unsigned; -fsigned-char is likely unsafe.\nCPPFLAGS=\"$CPPFLAGS -fno-exceptions -funsigned-char\"\nCXXFLAGS=\"$CXXFLAGS -std=c++11\"\n\nAC_PROG_CXX\nAC_DISABLE_STATIC\nAC_PROG_LIBTOOL\n\nAC_CONFIG_HEADERS([config.h src/include/fst/config.h])\nAC_CONFIG_SRCDIR([src/lib/fst.cc])\nAC_CONFIG_FILES([\n  Makefile\n  src/Makefile\n  src/include/Makefile\n  src/lib/Makefile\n  src/bin/Makefile\n  src/test/Makefile\n  src/extensions/Makefile\n  src/extensions/compact/Makefile\n  src/extensions/compress/Makefile\n  src/extensions/const/Makefile\n  src/extensions/far/Makefile\n  src/extensions/linear/Makefile\n  src/extensions/lookahead/Makefile\n  src/extensions/mpdt/Makefile\n  src/extensions/ngram/Makefile\n  src/extensions/pdt/Makefile\n  src/extensions/python/Makefile\n  src/extensions/special/Makefile\n  src/script/Makefile\n])\nAC_CONFIG_MACRO_DIR([m4])\nAC_LANG([C++])\n\nAC_ARG_ENABLE([compact-fsts],\n              [AS_HELP_STRING([--enable-compact-fsts],\n              [enable CompactFst extensions])],\n              [],\n              [enable_compact_fsts=no])\nAM_CONDITIONAL([HAVE_COMPACT], [test \"x$enable_compact_fsts\" != xno])\n\nAC_ARG_ENABLE([compress],\n              [AS_HELP_STRING([--enable-compress],\n              [enable compression extension])],\n              [],\n              [enable_compress=no])\nAM_CONDITIONAL([HAVE_COMPRESS], [test \"x$enable_compress\" != xno])\n\nAC_ARG_ENABLE([const-fsts],\n              [AS_HELP_STRING([--enable-const-fsts],\n              [enable ConstFst extensions])],\n              [],\n              [enable_const_fsts=no])\nAM_CONDITIONAL([HAVE_CONST], [test \"x$enable_const_fsts\" != xno])\n\nAC_ARG_ENABLE([far],\n              [AS_HELP_STRING([--enable-far], [enable FAR extensions])],\n              [],\n              [enable_far=no])\nAM_CONDITIONAL([HAVE_FAR], [test \"x$enable_far\" != xno])\n\nAC_ARG_ENABLE([linear-fsts],\n              [AS_HELP_STRING([--enable-linear-fsts],\n              [enable LinearTagger/ClassifierFst extensions])],\n              [],\n              [enable_linear_fsts=no])\nAM_CONDITIONAL([HAVE_LINEAR], [test \"x$enable_linear_fsts\" != xno])\n\nAC_ARG_ENABLE([lookahead-fsts],\n              [AS_HELP_STRING([--enable-lookahead-fsts],\n              [enable LookAheadFst extensions])],\n              [],\n              [enable_lookahead_fsts=no])\nAM_CONDITIONAL([HAVE_LOOKAHEAD], [test \"x$enable_lookahead_fsts\" != xno])\n\nAC_ARG_ENABLE([mpdt],\n              [AS_HELP_STRING([--enable-mpdt],\n              [enable MPDT extensions])],\n              [],\n              [enable_mpdt=no])\nAM_CONDITIONAL([HAVE_MPDT], [test \"x$enable_mpdt\" != xno])\n\nAC_ARG_ENABLE([ngram-fsts],\n              [AS_HELP_STRING([--enable-ngram-fsts],\n              [enable NGramFst extension])],\n              [],\n              [enable_ngram_fsts=no])\nAM_CONDITIONAL([HAVE_NGRAM], [test \"x$enable_ngram_fsts\" != xno])\n\nAC_ARG_ENABLE([pdt],\n              [AS_HELP_STRING([--enable-pdt],\n              [enable PDT extensions])],\n              [],\n              [enable_pdt=no])\nAM_CONDITIONAL([HAVE_PDT], [test \"x$enable_pdt\" != xno])\n\nAC_ARG_ENABLE([python],\n              [AS_HELP_STRING([--enable-python],\n              [enable Python extensions])],\n              [],\n              [enable_python=no])\nAM_CONDITIONAL([HAVE_PYTHON], [test \"x$enable_python\" != xno])\nif test \"x$enable_python\" != xno; then\n  AM_PATH_PYTHON(2.7)\n  AC_PYTHON_DEVEL([>= '2.7'])\nfi\n\nAC_ARG_ENABLE([special],\n              [AS_HELP_STRING([--enable-special],\n              [enable special-matcher extensions])],\n              [],\n              [enable_special=no])\nAM_CONDITIONAL([HAVE_SPECIAL], [test \"x$enable_special\" != xno])\n\n# --enable-bin enables script and bin \"extensions\".\nAC_ARG_ENABLE([bin],\n              [AS_HELP_STRING([--enable-bin],\n              [enable fst::script and command-line binaries])],\n              [],\n              [enable_bin=yes])\nAM_CONDITIONAL([HAVE_BIN], [test \"x$enable_bin\" != xno])\nAM_CONDITIONAL([HAVE_SCRIPT], [test \"x$enable_bin\" != xno])\n\n# --enable-grm enables dependencies of OpenGrm: far, mpdt, and pdt.\nAC_ARG_ENABLE([grm],\n              [AS_HELP_STRING([--enable-grm],\n              [enable all dependencies of OpenGrm])],\n              [],\n              [enable_grm=no])\nAM_CONDITIONAL([HAVE_GRM], [test \"x$enable_grm\" != xno])\n\nAC_ARG_WITH([libfstdir],\n[--with-libfstdir[=DIR] fst dynamic extensions [[LIBDIR/fst]]],\n[], [with_libfstdir=[${libdir}/fst]])\n\nAC_SUBST([libfstdir], $with_libfstdir)\n\nAC_CHECK_LIB([dl], dlopen, [DL_LIBS=-ldl])\nAC_SUBST([DL_LIBS])\n\nAC_OUTPUT\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/depcomp",
    "content": "#! /bin/sh\n# depcomp - compile a program generating dependencies as side-effects\n\nscriptversion=2016-01-11.22; # UTC\n\n# Copyright (C) 1999-2017 Free Software Foundation, Inc.\n\n# This program is free software; you can redistribute it and/or modify\n# it under the terms of the GNU General Public License as published by\n# the Free Software Foundation; either version 2, or (at your option)\n# any later version.\n\n# This program is distributed in the hope that it will be useful,\n# but WITHOUT ANY WARRANTY; without even the implied warranty of\n# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n# GNU General Public License for more details.\n\n# You should have received a copy of the GNU General Public License\n# along with this program.  If not, see <http://www.gnu.org/licenses/>.\n\n# As a special exception to the GNU General Public License, if you\n# distribute this file as part of a program that contains a\n# configuration script generated by Autoconf, you may include it under\n# the same distribution terms that you use for the rest of that program.\n\n# Originally written by Alexandre Oliva <oliva@dcc.unicamp.br>.\n\ncase $1 in\n  '')\n    echo \"$0: No command.  Try '$0 --help' for more information.\" 1>&2\n    exit 1;\n    ;;\n  -h | --h*)\n    cat <<\\EOF\nUsage: depcomp [--help] [--version] PROGRAM [ARGS]\n\nRun PROGRAMS ARGS to compile a file, generating dependencies\nas side-effects.\n\nEnvironment variables:\n  depmode     Dependency tracking mode.\n  source      Source file read by 'PROGRAMS ARGS'.\n  object      Object file output by 'PROGRAMS ARGS'.\n  DEPDIR      directory where to store dependencies.\n  depfile     Dependency file to output.\n  tmpdepfile  Temporary file to use when outputting dependencies.\n  libtool     Whether libtool is used (yes/no).\n\nReport bugs to <bug-automake@gnu.org>.\nEOF\n    exit $?\n    ;;\n  -v | --v*)\n    echo \"depcomp $scriptversion\"\n    exit $?\n    ;;\nesac\n\n# Get the directory component of the given path, and save it in the\n# global variables '$dir'.  Note that this directory component will\n# be either empty or ending with a '/' character.  This is deliberate.\nset_dir_from ()\n{\n  case $1 in\n    */*) dir=`echo \"$1\" | sed -e 's|/[^/]*$|/|'`;;\n      *) dir=;;\n  esac\n}\n\n# Get the suffix-stripped basename of the given path, and save it the\n# global variable '$base'.\nset_base_from ()\n{\n  base=`echo \"$1\" | sed -e 's|^.*/||' -e 's/\\.[^.]*$//'`\n}\n\n# If no dependency file was actually created by the compiler invocation,\n# we still have to create a dummy depfile, to avoid errors with the\n# Makefile \"include basename.Plo\" scheme.\nmake_dummy_depfile ()\n{\n  echo \"#dummy\" > \"$depfile\"\n}\n\n# Factor out some common post-processing of the generated depfile.\n# Requires the auxiliary global variable '$tmpdepfile' to be set.\naix_post_process_depfile ()\n{\n  # If the compiler actually managed to produce a dependency file,\n  # post-process it.\n  if test -f \"$tmpdepfile\"; then\n    # Each line is of the form 'foo.o: dependency.h'.\n    # Do two passes, one to just change these to\n    #   $object: dependency.h\n    # and one to simply output\n    #   dependency.h:\n    # which is needed to avoid the deleted-header problem.\n    { sed -e \"s,^.*\\.[$lower]*:,$object:,\" < \"$tmpdepfile\"\n      sed -e \"s,^.*\\.[$lower]*:[$tab ]*,,\" -e 's,$,:,' < \"$tmpdepfile\"\n    } > \"$depfile\"\n    rm -f \"$tmpdepfile\"\n  else\n    make_dummy_depfile\n  fi\n}\n\n# A tabulation character.\ntab='\t'\n# A newline character.\nnl='\n'\n# Character ranges might be problematic outside the C locale.\n# These definitions help.\nupper=ABCDEFGHIJKLMNOPQRSTUVWXYZ\nlower=abcdefghijklmnopqrstuvwxyz\ndigits=0123456789\nalpha=${upper}${lower}\n\nif test -z \"$depmode\" || test -z \"$source\" || test -z \"$object\"; then\n  echo \"depcomp: Variables source, object and depmode must be set\" 1>&2\n  exit 1\nfi\n\n# Dependencies for sub/bar.o or sub/bar.obj go into sub/.deps/bar.Po.\ndepfile=${depfile-`echo \"$object\" |\n  sed 's|[^\\\\/]*$|'${DEPDIR-.deps}'/&|;s|\\.\\([^.]*\\)$|.P\\1|;s|Pobj$|Po|'`}\ntmpdepfile=${tmpdepfile-`echo \"$depfile\" | sed 's/\\.\\([^.]*\\)$/.T\\1/'`}\n\nrm -f \"$tmpdepfile\"\n\n# Avoid interferences from the environment.\ngccflag= dashmflag=\n\n# Some modes work just like other modes, but use different flags.  We\n# parameterize here, but still list the modes in the big case below,\n# to make depend.m4 easier to write.  Note that we *cannot* use a case\n# here, because this file can only contain one case statement.\nif test \"$depmode\" = hp; then\n  # HP compiler uses -M and no extra arg.\n  gccflag=-M\n  depmode=gcc\nfi\n\nif test \"$depmode\" = dashXmstdout; then\n  # This is just like dashmstdout with a different argument.\n  dashmflag=-xM\n  depmode=dashmstdout\nfi\n\ncygpath_u=\"cygpath -u -f -\"\nif test \"$depmode\" = msvcmsys; then\n  # This is just like msvisualcpp but w/o cygpath translation.\n  # Just convert the backslash-escaped backslashes to single forward\n  # slashes to satisfy depend.m4\n  cygpath_u='sed s,\\\\\\\\,/,g'\n  depmode=msvisualcpp\nfi\n\nif test \"$depmode\" = msvc7msys; then\n  # This is just like msvc7 but w/o cygpath translation.\n  # Just convert the backslash-escaped backslashes to single forward\n  # slashes to satisfy depend.m4\n  cygpath_u='sed s,\\\\\\\\,/,g'\n  depmode=msvc7\nfi\n\nif test \"$depmode\" = xlc; then\n  # IBM C/C++ Compilers xlc/xlC can output gcc-like dependency information.\n  gccflag=-qmakedep=gcc,-MF\n  depmode=gcc\nfi\n\ncase \"$depmode\" in\ngcc3)\n## gcc 3 implements dependency tracking that does exactly what\n## we want.  Yay!  Note: for some reason libtool 1.4 doesn't like\n## it if -MD -MP comes after the -MF stuff.  Hmm.\n## Unfortunately, FreeBSD c89 acceptance of flags depends upon\n## the command line argument order; so add the flags where they\n## appear in depend2.am.  Note that the slowdown incurred here\n## affects only configure: in makefiles, %FASTDEP% shortcuts this.\n  for arg\n  do\n    case $arg in\n    -c) set fnord \"$@\" -MT \"$object\" -MD -MP -MF \"$tmpdepfile\" \"$arg\" ;;\n    *)  set fnord \"$@\" \"$arg\" ;;\n    esac\n    shift # fnord\n    shift # $arg\n  done\n  \"$@\"\n  stat=$?\n  if test $stat -ne 0; then\n    rm -f \"$tmpdepfile\"\n    exit $stat\n  fi\n  mv \"$tmpdepfile\" \"$depfile\"\n  ;;\n\ngcc)\n## Note that this doesn't just cater to obsosete pre-3.x GCC compilers.\n## but also to in-use compilers like IMB xlc/xlC and the HP C compiler.\n## (see the conditional assignment to $gccflag above).\n## There are various ways to get dependency output from gcc.  Here's\n## why we pick this rather obscure method:\n## - Don't want to use -MD because we'd like the dependencies to end\n##   up in a subdir.  Having to rename by hand is ugly.\n##   (We might end up doing this anyway to support other compilers.)\n## - The DEPENDENCIES_OUTPUT environment variable makes gcc act like\n##   -MM, not -M (despite what the docs say).  Also, it might not be\n##   supported by the other compilers which use the 'gcc' depmode.\n## - Using -M directly means running the compiler twice (even worse\n##   than renaming).\n  if test -z \"$gccflag\"; then\n    gccflag=-MD,\n  fi\n  \"$@\" -Wp,\"$gccflag$tmpdepfile\"\n  stat=$?\n  if test $stat -ne 0; then\n    rm -f \"$tmpdepfile\"\n    exit $stat\n  fi\n  rm -f \"$depfile\"\n  echo \"$object : \\\\\" > \"$depfile\"\n  # The second -e expression handles DOS-style file names with drive\n  # letters.\n  sed -e 's/^[^:]*: / /' \\\n      -e 's/^['$alpha']:\\/[^:]*: / /' < \"$tmpdepfile\" >> \"$depfile\"\n## This next piece of magic avoids the \"deleted header file\" problem.\n## The problem is that when a header file which appears in a .P file\n## is deleted, the dependency causes make to die (because there is\n## typically no way to rebuild the header).  We avoid this by adding\n## dummy dependencies for each header file.  Too bad gcc doesn't do\n## this for us directly.\n## Some versions of gcc put a space before the ':'.  On the theory\n## that the space means something, we add a space to the output as\n## well.  hp depmode also adds that space, but also prefixes the VPATH\n## to the object.  Take care to not repeat it in the output.\n## Some versions of the HPUX 10.20 sed can't process this invocation\n## correctly.  Breaking it into two sed invocations is a workaround.\n  tr ' ' \"$nl\" < \"$tmpdepfile\" \\\n    | sed -e 's/^\\\\$//' -e '/^$/d' -e \"s|.*$object$||\" -e '/:$/d' \\\n    | sed -e 's/$/ :/' >> \"$depfile\"\n  rm -f \"$tmpdepfile\"\n  ;;\n\nhp)\n  # This case exists only to let depend.m4 do its work.  It works by\n  # looking at the text of this script.  This case will never be run,\n  # since it is checked for above.\n  exit 1\n  ;;\n\nsgi)\n  if test \"$libtool\" = yes; then\n    \"$@\" \"-Wp,-MDupdate,$tmpdepfile\"\n  else\n    \"$@\" -MDupdate \"$tmpdepfile\"\n  fi\n  stat=$?\n  if test $stat -ne 0; then\n    rm -f \"$tmpdepfile\"\n    exit $stat\n  fi\n  rm -f \"$depfile\"\n\n  if test -f \"$tmpdepfile\"; then  # yes, the sourcefile depend on other files\n    echo \"$object : \\\\\" > \"$depfile\"\n    # Clip off the initial element (the dependent).  Don't try to be\n    # clever and replace this with sed code, as IRIX sed won't handle\n    # lines with more than a fixed number of characters (4096 in\n    # IRIX 6.2 sed, 8192 in IRIX 6.5).  We also remove comment lines;\n    # the IRIX cc adds comments like '#:fec' to the end of the\n    # dependency line.\n    tr ' ' \"$nl\" < \"$tmpdepfile\" \\\n      | sed -e 's/^.*\\.o://' -e 's/#.*$//' -e '/^$/ d' \\\n      | tr \"$nl\" ' ' >> \"$depfile\"\n    echo >> \"$depfile\"\n    # The second pass generates a dummy entry for each header file.\n    tr ' ' \"$nl\" < \"$tmpdepfile\" \\\n      | sed -e 's/^.*\\.o://' -e 's/#.*$//' -e '/^$/ d' -e 's/$/:/' \\\n      >> \"$depfile\"\n  else\n    make_dummy_depfile\n  fi\n  rm -f \"$tmpdepfile\"\n  ;;\n\nxlc)\n  # This case exists only to let depend.m4 do its work.  It works by\n  # looking at the text of this script.  This case will never be run,\n  # since it is checked for above.\n  exit 1\n  ;;\n\naix)\n  # The C for AIX Compiler uses -M and outputs the dependencies\n  # in a .u file.  In older versions, this file always lives in the\n  # current directory.  Also, the AIX compiler puts '$object:' at the\n  # start of each line; $object doesn't have directory information.\n  # Version 6 uses the directory in both cases.\n  set_dir_from \"$object\"\n  set_base_from \"$object\"\n  if test \"$libtool\" = yes; then\n    tmpdepfile1=$dir$base.u\n    tmpdepfile2=$base.u\n    tmpdepfile3=$dir.libs/$base.u\n    \"$@\" -Wc,-M\n  else\n    tmpdepfile1=$dir$base.u\n    tmpdepfile2=$dir$base.u\n    tmpdepfile3=$dir$base.u\n    \"$@\" -M\n  fi\n  stat=$?\n  if test $stat -ne 0; then\n    rm -f \"$tmpdepfile1\" \"$tmpdepfile2\" \"$tmpdepfile3\"\n    exit $stat\n  fi\n\n  for tmpdepfile in \"$tmpdepfile1\" \"$tmpdepfile2\" \"$tmpdepfile3\"\n  do\n    test -f \"$tmpdepfile\" && break\n  done\n  aix_post_process_depfile\n  ;;\n\ntcc)\n  # tcc (Tiny C Compiler) understand '-MD -MF file' since version 0.9.26\n  # FIXME: That version still under development at the moment of writing.\n  #        Make that this statement remains true also for stable, released\n  #        versions.\n  # It will wrap lines (doesn't matter whether long or short) with a\n  # trailing '\\', as in:\n  #\n  #   foo.o : \\\n  #    foo.c \\\n  #    foo.h \\\n  #\n  # It will put a trailing '\\' even on the last line, and will use leading\n  # spaces rather than leading tabs (at least since its commit 0394caf7\n  # \"Emit spaces for -MD\").\n  \"$@\" -MD -MF \"$tmpdepfile\"\n  stat=$?\n  if test $stat -ne 0; then\n    rm -f \"$tmpdepfile\"\n    exit $stat\n  fi\n  rm -f \"$depfile\"\n  # Each non-empty line is of the form 'foo.o : \\' or ' dep.h \\'.\n  # We have to change lines of the first kind to '$object: \\'.\n  sed -e \"s|.*:|$object :|\" < \"$tmpdepfile\" > \"$depfile\"\n  # And for each line of the second kind, we have to emit a 'dep.h:'\n  # dummy dependency, to avoid the deleted-header problem.\n  sed -n -e 's|^  *\\(.*\\) *\\\\$|\\1:|p' < \"$tmpdepfile\" >> \"$depfile\"\n  rm -f \"$tmpdepfile\"\n  ;;\n\n## The order of this option in the case statement is important, since the\n## shell code in configure will try each of these formats in the order\n## listed in this file.  A plain '-MD' option would be understood by many\n## compilers, so we must ensure this comes after the gcc and icc options.\npgcc)\n  # Portland's C compiler understands '-MD'.\n  # Will always output deps to 'file.d' where file is the root name of the\n  # source file under compilation, even if file resides in a subdirectory.\n  # The object file name does not affect the name of the '.d' file.\n  # pgcc 10.2 will output\n  #    foo.o: sub/foo.c sub/foo.h\n  # and will wrap long lines using '\\' :\n  #    foo.o: sub/foo.c ... \\\n  #     sub/foo.h ... \\\n  #     ...\n  set_dir_from \"$object\"\n  # Use the source, not the object, to determine the base name, since\n  # that's sadly what pgcc will do too.\n  set_base_from \"$source\"\n  tmpdepfile=$base.d\n\n  # For projects that build the same source file twice into different object\n  # files, the pgcc approach of using the *source* file root name can cause\n  # problems in parallel builds.  Use a locking strategy to avoid stomping on\n  # the same $tmpdepfile.\n  lockdir=$base.d-lock\n  trap \"\n    echo '$0: caught signal, cleaning up...' >&2\n    rmdir '$lockdir'\n    exit 1\n  \" 1 2 13 15\n  numtries=100\n  i=$numtries\n  while test $i -gt 0; do\n    # mkdir is a portable test-and-set.\n    if mkdir \"$lockdir\" 2>/dev/null; then\n      # This process acquired the lock.\n      \"$@\" -MD\n      stat=$?\n      # Release the lock.\n      rmdir \"$lockdir\"\n      break\n    else\n      # If the lock is being held by a different process, wait\n      # until the winning process is done or we timeout.\n      while test -d \"$lockdir\" && test $i -gt 0; do\n        sleep 1\n        i=`expr $i - 1`\n      done\n    fi\n    i=`expr $i - 1`\n  done\n  trap - 1 2 13 15\n  if test $i -le 0; then\n    echo \"$0: failed to acquire lock after $numtries attempts\" >&2\n    echo \"$0: check lockdir '$lockdir'\" >&2\n    exit 1\n  fi\n\n  if test $stat -ne 0; then\n    rm -f \"$tmpdepfile\"\n    exit $stat\n  fi\n  rm -f \"$depfile\"\n  # Each line is of the form `foo.o: dependent.h',\n  # or `foo.o: dep1.h dep2.h \\', or ` dep3.h dep4.h \\'.\n  # Do two passes, one to just change these to\n  # `$object: dependent.h' and one to simply `dependent.h:'.\n  sed \"s,^[^:]*:,$object :,\" < \"$tmpdepfile\" > \"$depfile\"\n  # Some versions of the HPUX 10.20 sed can't process this invocation\n  # correctly.  Breaking it into two sed invocations is a workaround.\n  sed 's,^[^:]*: \\(.*\\)$,\\1,;s/^\\\\$//;/^$/d;/:$/d' < \"$tmpdepfile\" \\\n    | sed -e 's/$/ :/' >> \"$depfile\"\n  rm -f \"$tmpdepfile\"\n  ;;\n\nhp2)\n  # The \"hp\" stanza above does not work with aCC (C++) and HP's ia64\n  # compilers, which have integrated preprocessors.  The correct option\n  # to use with these is +Maked; it writes dependencies to a file named\n  # 'foo.d', which lands next to the object file, wherever that\n  # happens to be.\n  # Much of this is similar to the tru64 case; see comments there.\n  set_dir_from  \"$object\"\n  set_base_from \"$object\"\n  if test \"$libtool\" = yes; then\n    tmpdepfile1=$dir$base.d\n    tmpdepfile2=$dir.libs/$base.d\n    \"$@\" -Wc,+Maked\n  else\n    tmpdepfile1=$dir$base.d\n    tmpdepfile2=$dir$base.d\n    \"$@\" +Maked\n  fi\n  stat=$?\n  if test $stat -ne 0; then\n     rm -f \"$tmpdepfile1\" \"$tmpdepfile2\"\n     exit $stat\n  fi\n\n  for tmpdepfile in \"$tmpdepfile1\" \"$tmpdepfile2\"\n  do\n    test -f \"$tmpdepfile\" && break\n  done\n  if test -f \"$tmpdepfile\"; then\n    sed -e \"s,^.*\\.[$lower]*:,$object:,\" \"$tmpdepfile\" > \"$depfile\"\n    # Add 'dependent.h:' lines.\n    sed -ne '2,${\n               s/^ *//\n               s/ \\\\*$//\n               s/$/:/\n               p\n             }' \"$tmpdepfile\" >> \"$depfile\"\n  else\n    make_dummy_depfile\n  fi\n  rm -f \"$tmpdepfile\" \"$tmpdepfile2\"\n  ;;\n\ntru64)\n  # The Tru64 compiler uses -MD to generate dependencies as a side\n  # effect.  'cc -MD -o foo.o ...' puts the dependencies into 'foo.o.d'.\n  # At least on Alpha/Redhat 6.1, Compaq CCC V6.2-504 seems to put\n  # dependencies in 'foo.d' instead, so we check for that too.\n  # Subdirectories are respected.\n  set_dir_from  \"$object\"\n  set_base_from \"$object\"\n\n  if test \"$libtool\" = yes; then\n    # Libtool generates 2 separate objects for the 2 libraries.  These\n    # two compilations output dependencies in $dir.libs/$base.o.d and\n    # in $dir$base.o.d.  We have to check for both files, because\n    # one of the two compilations can be disabled.  We should prefer\n    # $dir$base.o.d over $dir.libs/$base.o.d because the latter is\n    # automatically cleaned when .libs/ is deleted, while ignoring\n    # the former would cause a distcleancheck panic.\n    tmpdepfile1=$dir$base.o.d          # libtool 1.5\n    tmpdepfile2=$dir.libs/$base.o.d    # Likewise.\n    tmpdepfile3=$dir.libs/$base.d      # Compaq CCC V6.2-504\n    \"$@\" -Wc,-MD\n  else\n    tmpdepfile1=$dir$base.d\n    tmpdepfile2=$dir$base.d\n    tmpdepfile3=$dir$base.d\n    \"$@\" -MD\n  fi\n\n  stat=$?\n  if test $stat -ne 0; then\n    rm -f \"$tmpdepfile1\" \"$tmpdepfile2\" \"$tmpdepfile3\"\n    exit $stat\n  fi\n\n  for tmpdepfile in \"$tmpdepfile1\" \"$tmpdepfile2\" \"$tmpdepfile3\"\n  do\n    test -f \"$tmpdepfile\" && break\n  done\n  # Same post-processing that is required for AIX mode.\n  aix_post_process_depfile\n  ;;\n\nmsvc7)\n  if test \"$libtool\" = yes; then\n    showIncludes=-Wc,-showIncludes\n  else\n    showIncludes=-showIncludes\n  fi\n  \"$@\" $showIncludes > \"$tmpdepfile\"\n  stat=$?\n  grep -v '^Note: including file: ' \"$tmpdepfile\"\n  if test $stat -ne 0; then\n    rm -f \"$tmpdepfile\"\n    exit $stat\n  fi\n  rm -f \"$depfile\"\n  echo \"$object : \\\\\" > \"$depfile\"\n  # The first sed program below extracts the file names and escapes\n  # backslashes for cygpath.  The second sed program outputs the file\n  # name when reading, but also accumulates all include files in the\n  # hold buffer in order to output them again at the end.  This only\n  # works with sed implementations that can handle large buffers.\n  sed < \"$tmpdepfile\" -n '\n/^Note: including file:  *\\(.*\\)/ {\n  s//\\1/\n  s/\\\\/\\\\\\\\/g\n  p\n}' | $cygpath_u | sort -u | sed -n '\ns/ /\\\\ /g\ns/\\(.*\\)/'\"$tab\"'\\1 \\\\/p\ns/.\\(.*\\) \\\\/\\1:/\nH\n$ {\n  s/.*/'\"$tab\"'/\n  G\n  p\n}' >> \"$depfile\"\n  echo >> \"$depfile\" # make sure the fragment doesn't end with a backslash\n  rm -f \"$tmpdepfile\"\n  ;;\n\nmsvc7msys)\n  # This case exists only to let depend.m4 do its work.  It works by\n  # looking at the text of this script.  This case will never be run,\n  # since it is checked for above.\n  exit 1\n  ;;\n\n#nosideeffect)\n  # This comment above is used by automake to tell side-effect\n  # dependency tracking mechanisms from slower ones.\n\ndashmstdout)\n  # Important note: in order to support this mode, a compiler *must*\n  # always write the preprocessed file to stdout, regardless of -o.\n  \"$@\" || exit $?\n\n  # Remove the call to Libtool.\n  if test \"$libtool\" = yes; then\n    while test \"X$1\" != 'X--mode=compile'; do\n      shift\n    done\n    shift\n  fi\n\n  # Remove '-o $object'.\n  IFS=\" \"\n  for arg\n  do\n    case $arg in\n    -o)\n      shift\n      ;;\n    $object)\n      shift\n      ;;\n    *)\n      set fnord \"$@\" \"$arg\"\n      shift # fnord\n      shift # $arg\n      ;;\n    esac\n  done\n\n  test -z \"$dashmflag\" && dashmflag=-M\n  # Require at least two characters before searching for ':'\n  # in the target name.  This is to cope with DOS-style filenames:\n  # a dependency such as 'c:/foo/bar' could be seen as target 'c' otherwise.\n  \"$@\" $dashmflag |\n    sed \"s|^[$tab ]*[^:$tab ][^:][^:]*:[$tab ]*|$object: |\" > \"$tmpdepfile\"\n  rm -f \"$depfile\"\n  cat < \"$tmpdepfile\" > \"$depfile\"\n  # Some versions of the HPUX 10.20 sed can't process this sed invocation\n  # correctly.  Breaking it into two sed invocations is a workaround.\n  tr ' ' \"$nl\" < \"$tmpdepfile\" \\\n    | sed -e 's/^\\\\$//' -e '/^$/d' -e '/:$/d' \\\n    | sed -e 's/$/ :/' >> \"$depfile\"\n  rm -f \"$tmpdepfile\"\n  ;;\n\ndashXmstdout)\n  # This case only exists to satisfy depend.m4.  It is never actually\n  # run, as this mode is specially recognized in the preamble.\n  exit 1\n  ;;\n\nmakedepend)\n  \"$@\" || exit $?\n  # Remove any Libtool call\n  if test \"$libtool\" = yes; then\n    while test \"X$1\" != 'X--mode=compile'; do\n      shift\n    done\n    shift\n  fi\n  # X makedepend\n  shift\n  cleared=no eat=no\n  for arg\n  do\n    case $cleared in\n    no)\n      set \"\"; shift\n      cleared=yes ;;\n    esac\n    if test $eat = yes; then\n      eat=no\n      continue\n    fi\n    case \"$arg\" in\n    -D*|-I*)\n      set fnord \"$@\" \"$arg\"; shift ;;\n    # Strip any option that makedepend may not understand.  Remove\n    # the object too, otherwise makedepend will parse it as a source file.\n    -arch)\n      eat=yes ;;\n    -*|$object)\n      ;;\n    *)\n      set fnord \"$@\" \"$arg\"; shift ;;\n    esac\n  done\n  obj_suffix=`echo \"$object\" | sed 's/^.*\\././'`\n  touch \"$tmpdepfile\"\n  ${MAKEDEPEND-makedepend} -o\"$obj_suffix\" -f\"$tmpdepfile\" \"$@\"\n  rm -f \"$depfile\"\n  # makedepend may prepend the VPATH from the source file name to the object.\n  # No need to regex-escape $object, excess matching of '.' is harmless.\n  sed \"s|^.*\\($object *:\\)|\\1|\" \"$tmpdepfile\" > \"$depfile\"\n  # Some versions of the HPUX 10.20 sed can't process the last invocation\n  # correctly.  Breaking it into two sed invocations is a workaround.\n  sed '1,2d' \"$tmpdepfile\" \\\n    | tr ' ' \"$nl\" \\\n    | sed -e 's/^\\\\$//' -e '/^$/d' -e '/:$/d' \\\n    | sed -e 's/$/ :/' >> \"$depfile\"\n  rm -f \"$tmpdepfile\" \"$tmpdepfile\".bak\n  ;;\n\ncpp)\n  # Important note: in order to support this mode, a compiler *must*\n  # always write the preprocessed file to stdout.\n  \"$@\" || exit $?\n\n  # Remove the call to Libtool.\n  if test \"$libtool\" = yes; then\n    while test \"X$1\" != 'X--mode=compile'; do\n      shift\n    done\n    shift\n  fi\n\n  # Remove '-o $object'.\n  IFS=\" \"\n  for arg\n  do\n    case $arg in\n    -o)\n      shift\n      ;;\n    $object)\n      shift\n      ;;\n    *)\n      set fnord \"$@\" \"$arg\"\n      shift # fnord\n      shift # $arg\n      ;;\n    esac\n  done\n\n  \"$@\" -E \\\n    | sed -n -e '/^# [0-9][0-9]* \"\\([^\"]*\\)\".*/ s:: \\1 \\\\:p' \\\n             -e '/^#line [0-9][0-9]* \"\\([^\"]*\\)\".*/ s:: \\1 \\\\:p' \\\n    | sed '$ s: \\\\$::' > \"$tmpdepfile\"\n  rm -f \"$depfile\"\n  echo \"$object : \\\\\" > \"$depfile\"\n  cat < \"$tmpdepfile\" >> \"$depfile\"\n  sed < \"$tmpdepfile\" '/^$/d;s/^ //;s/ \\\\$//;s/$/ :/' >> \"$depfile\"\n  rm -f \"$tmpdepfile\"\n  ;;\n\nmsvisualcpp)\n  # Important note: in order to support this mode, a compiler *must*\n  # always write the preprocessed file to stdout.\n  \"$@\" || exit $?\n\n  # Remove the call to Libtool.\n  if test \"$libtool\" = yes; then\n    while test \"X$1\" != 'X--mode=compile'; do\n      shift\n    done\n    shift\n  fi\n\n  IFS=\" \"\n  for arg\n  do\n    case \"$arg\" in\n    -o)\n      shift\n      ;;\n    $object)\n      shift\n      ;;\n    \"-Gm\"|\"/Gm\"|\"-Gi\"|\"/Gi\"|\"-ZI\"|\"/ZI\")\n        set fnord \"$@\"\n        shift\n        shift\n        ;;\n    *)\n        set fnord \"$@\" \"$arg\"\n        shift\n        shift\n        ;;\n    esac\n  done\n  \"$@\" -E 2>/dev/null |\n  sed -n '/^#line [0-9][0-9]* \"\\([^\"]*\\)\"/ s::\\1:p' | $cygpath_u | sort -u > \"$tmpdepfile\"\n  rm -f \"$depfile\"\n  echo \"$object : \\\\\" > \"$depfile\"\n  sed < \"$tmpdepfile\" -n -e 's% %\\\\ %g' -e '/^\\(.*\\)$/ s::'\"$tab\"'\\1 \\\\:p' >> \"$depfile\"\n  echo \"$tab\" >> \"$depfile\"\n  sed < \"$tmpdepfile\" -n -e 's% %\\\\ %g' -e '/^\\(.*\\)$/ s::\\1\\::p' >> \"$depfile\"\n  rm -f \"$tmpdepfile\"\n  ;;\n\nmsvcmsys)\n  # This case exists only to let depend.m4 do its work.  It works by\n  # looking at the text of this script.  This case will never be run,\n  # since it is checked for above.\n  exit 1\n  ;;\n\nnone)\n  exec \"$@\"\n  ;;\n\n*)\n  echo \"Unknown depmode $depmode\" 1>&2\n  exit 1\n  ;;\nesac\n\nexit 0\n\n# Local Variables:\n# mode: shell-script\n# sh-indentation: 2\n# eval: (add-hook 'write-file-hooks 'time-stamp)\n# time-stamp-start: \"scriptversion=\"\n# time-stamp-format: \"%:y-%02m-%02d.%02H\"\n# time-stamp-time-zone: \"UTC0\"\n# time-stamp-end: \"; # UTC\"\n# End:\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/install-sh",
    "content": "#!/bin/sh\n# install - install a program, script, or datafile\n\nscriptversion=2014-09-12.12; # UTC\n\n# This originates from X11R5 (mit/util/scripts/install.sh), which was\n# later released in X11R6 (xc/config/util/install.sh) with the\n# following copyright and license.\n#\n# Copyright (C) 1994 X Consortium\n#\n# Permission is hereby granted, free of charge, to any person obtaining a copy\n# of this software and associated documentation files (the \"Software\"), to\n# deal in the Software without restriction, including without limitation the\n# rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n# sell copies of the Software, and to permit persons to whom the Software is\n# furnished to do so, subject to the following conditions:\n#\n# The above copyright notice and this permission notice shall be included in\n# all copies or substantial portions of the Software.\n#\n# THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n# IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n# FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.  IN NO EVENT SHALL THE\n# X CONSORTIUM BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN\n# AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNEC-\n# TION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n#\n# Except as contained in this notice, the name of the X Consortium shall not\n# be used in advertising or otherwise to promote the sale, use or other deal-\n# ings in this Software without prior written authorization from the X Consor-\n# tium.\n#\n#\n# FSF changes to this file are in the public domain.\n#\n# Calling this script install-sh is preferred over install.sh, to prevent\n# 'make' implicit rules from creating a file called install from it\n# when there is no Makefile.\n#\n# This script is compatible with the BSD install script, but was written\n# from scratch.\n\ntab='\t'\nnl='\n'\nIFS=\" $tab$nl\"\n\n# Set DOITPROG to \"echo\" to test this script.\n\ndoit=${DOITPROG-}\ndoit_exec=${doit:-exec}\n\n# Put in absolute file names if you don't have them in your path;\n# or use environment vars.\n\nchgrpprog=${CHGRPPROG-chgrp}\nchmodprog=${CHMODPROG-chmod}\nchownprog=${CHOWNPROG-chown}\ncmpprog=${CMPPROG-cmp}\ncpprog=${CPPROG-cp}\nmkdirprog=${MKDIRPROG-mkdir}\nmvprog=${MVPROG-mv}\nrmprog=${RMPROG-rm}\nstripprog=${STRIPPROG-strip}\n\nposix_mkdir=\n\n# Desired mode of installed file.\nmode=0755\n\nchgrpcmd=\nchmodcmd=$chmodprog\nchowncmd=\nmvcmd=$mvprog\nrmcmd=\"$rmprog -f\"\nstripcmd=\n\nsrc=\ndst=\ndir_arg=\ndst_arg=\n\ncopy_on_change=false\nis_target_a_directory=possibly\n\nusage=\"\\\nUsage: $0 [OPTION]... [-T] SRCFILE DSTFILE\n   or: $0 [OPTION]... SRCFILES... DIRECTORY\n   or: $0 [OPTION]... -t DIRECTORY SRCFILES...\n   or: $0 [OPTION]... -d DIRECTORIES...\n\nIn the 1st form, copy SRCFILE to DSTFILE.\nIn the 2nd and 3rd, copy all SRCFILES to DIRECTORY.\nIn the 4th, create DIRECTORIES.\n\nOptions:\n     --help     display this help and exit.\n     --version  display version info and exit.\n\n  -c            (ignored)\n  -C            install only if different (preserve the last data modification time)\n  -d            create directories instead of installing files.\n  -g GROUP      $chgrpprog installed files to GROUP.\n  -m MODE       $chmodprog installed files to MODE.\n  -o USER       $chownprog installed files to USER.\n  -s            $stripprog installed files.\n  -t DIRECTORY  install into DIRECTORY.\n  -T            report an error if DSTFILE is a directory.\n\nEnvironment variables override the default commands:\n  CHGRPPROG CHMODPROG CHOWNPROG CMPPROG CPPROG MKDIRPROG MVPROG\n  RMPROG STRIPPROG\n\"\n\nwhile test $# -ne 0; do\n  case $1 in\n    -c) ;;\n\n    -C) copy_on_change=true;;\n\n    -d) dir_arg=true;;\n\n    -g) chgrpcmd=\"$chgrpprog $2\"\n        shift;;\n\n    --help) echo \"$usage\"; exit $?;;\n\n    -m) mode=$2\n        case $mode in\n          *' '* | *\"$tab\"* | *\"$nl\"* | *'*'* | *'?'* | *'['*)\n            echo \"$0: invalid mode: $mode\" >&2\n            exit 1;;\n        esac\n        shift;;\n\n    -o) chowncmd=\"$chownprog $2\"\n        shift;;\n\n    -s) stripcmd=$stripprog;;\n\n    -t)\n        is_target_a_directory=always\n        dst_arg=$2\n        # Protect names problematic for 'test' and other utilities.\n        case $dst_arg in\n          -* | [=\\(\\)!]) dst_arg=./$dst_arg;;\n        esac\n        shift;;\n\n    -T) is_target_a_directory=never;;\n\n    --version) echo \"$0 $scriptversion\"; exit $?;;\n\n    --) shift\n        break;;\n\n    -*) echo \"$0: invalid option: $1\" >&2\n        exit 1;;\n\n    *)  break;;\n  esac\n  shift\ndone\n\n# We allow the use of options -d and -T together, by making -d\n# take the precedence; this is for compatibility with GNU install.\n\nif test -n \"$dir_arg\"; then\n  if test -n \"$dst_arg\"; then\n    echo \"$0: target directory not allowed when installing a directory.\" >&2\n    exit 1\n  fi\nfi\n\nif test $# -ne 0 && test -z \"$dir_arg$dst_arg\"; then\n  # When -d is used, all remaining arguments are directories to create.\n  # When -t is used, the destination is already specified.\n  # Otherwise, the last argument is the destination.  Remove it from $@.\n  for arg\n  do\n    if test -n \"$dst_arg\"; then\n      # $@ is not empty: it contains at least $arg.\n      set fnord \"$@\" \"$dst_arg\"\n      shift # fnord\n    fi\n    shift # arg\n    dst_arg=$arg\n    # Protect names problematic for 'test' and other utilities.\n    case $dst_arg in\n      -* | [=\\(\\)!]) dst_arg=./$dst_arg;;\n    esac\n  done\nfi\n\nif test $# -eq 0; then\n  if test -z \"$dir_arg\"; then\n    echo \"$0: no input file specified.\" >&2\n    exit 1\n  fi\n  # It's OK to call 'install-sh -d' without argument.\n  # This can happen when creating conditional directories.\n  exit 0\nfi\n\nif test -z \"$dir_arg\"; then\n  if test $# -gt 1 || test \"$is_target_a_directory\" = always; then\n    if test ! -d \"$dst_arg\"; then\n      echo \"$0: $dst_arg: Is not a directory.\" >&2\n      exit 1\n    fi\n  fi\nfi\n\nif test -z \"$dir_arg\"; then\n  do_exit='(exit $ret); exit $ret'\n  trap \"ret=129; $do_exit\" 1\n  trap \"ret=130; $do_exit\" 2\n  trap \"ret=141; $do_exit\" 13\n  trap \"ret=143; $do_exit\" 15\n\n  # Set umask so as not to create temps with too-generous modes.\n  # However, 'strip' requires both read and write access to temps.\n  case $mode in\n    # Optimize common cases.\n    *644) cp_umask=133;;\n    *755) cp_umask=22;;\n\n    *[0-7])\n      if test -z \"$stripcmd\"; then\n        u_plus_rw=\n      else\n        u_plus_rw='% 200'\n      fi\n      cp_umask=`expr '(' 777 - $mode % 1000 ')' $u_plus_rw`;;\n    *)\n      if test -z \"$stripcmd\"; then\n        u_plus_rw=\n      else\n        u_plus_rw=,u+rw\n      fi\n      cp_umask=$mode$u_plus_rw;;\n  esac\nfi\n\nfor src\ndo\n  # Protect names problematic for 'test' and other utilities.\n  case $src in\n    -* | [=\\(\\)!]) src=./$src;;\n  esac\n\n  if test -n \"$dir_arg\"; then\n    dst=$src\n    dstdir=$dst\n    test -d \"$dstdir\"\n    dstdir_status=$?\n  else\n\n    # Waiting for this to be detected by the \"$cpprog $src $dsttmp\" command\n    # might cause directories to be created, which would be especially bad\n    # if $src (and thus $dsttmp) contains '*'.\n    if test ! -f \"$src\" && test ! -d \"$src\"; then\n      echo \"$0: $src does not exist.\" >&2\n      exit 1\n    fi\n\n    if test -z \"$dst_arg\"; then\n      echo \"$0: no destination specified.\" >&2\n      exit 1\n    fi\n    dst=$dst_arg\n\n    # If destination is a directory, append the input filename; won't work\n    # if double slashes aren't ignored.\n    if test -d \"$dst\"; then\n      if test \"$is_target_a_directory\" = never; then\n        echo \"$0: $dst_arg: Is a directory\" >&2\n        exit 1\n      fi\n      dstdir=$dst\n      dst=$dstdir/`basename \"$src\"`\n      dstdir_status=0\n    else\n      dstdir=`dirname \"$dst\"`\n      test -d \"$dstdir\"\n      dstdir_status=$?\n    fi\n  fi\n\n  obsolete_mkdir_used=false\n\n  if test $dstdir_status != 0; then\n    case $posix_mkdir in\n      '')\n        # Create intermediate dirs using mode 755 as modified by the umask.\n        # This is like FreeBSD 'install' as of 1997-10-28.\n        umask=`umask`\n        case $stripcmd.$umask in\n          # Optimize common cases.\n          *[2367][2367]) mkdir_umask=$umask;;\n          .*0[02][02] | .[02][02] | .[02]) mkdir_umask=22;;\n\n          *[0-7])\n            mkdir_umask=`expr $umask + 22 \\\n              - $umask % 100 % 40 + $umask % 20 \\\n              - $umask % 10 % 4 + $umask % 2\n            `;;\n          *) mkdir_umask=$umask,go-w;;\n        esac\n\n        # With -d, create the new directory with the user-specified mode.\n        # Otherwise, rely on $mkdir_umask.\n        if test -n \"$dir_arg\"; then\n          mkdir_mode=-m$mode\n        else\n          mkdir_mode=\n        fi\n\n        posix_mkdir=false\n        case $umask in\n          *[123567][0-7][0-7])\n            # POSIX mkdir -p sets u+wx bits regardless of umask, which\n            # is incompatible with FreeBSD 'install' when (umask & 300) != 0.\n            ;;\n          *)\n            # $RANDOM is not portable (e.g. dash);  use it when possible to\n            # lower collision chance\n            tmpdir=${TMPDIR-/tmp}/ins$RANDOM-$$\n            trap 'ret=$?; rmdir \"$tmpdir/a/b\" \"$tmpdir/a\" \"$tmpdir\" 2>/dev/null; exit $ret' 0\n\n            # As \"mkdir -p\" follows symlinks and we work in /tmp possibly;  so\n            # create the $tmpdir first (and fail if unsuccessful) to make sure\n            # that nobody tries to guess the $tmpdir name.\n            if (umask $mkdir_umask &&\n                $mkdirprog $mkdir_mode \"$tmpdir\" &&\n                exec $mkdirprog $mkdir_mode -p -- \"$tmpdir/a/b\") >/dev/null 2>&1\n            then\n              if test -z \"$dir_arg\" || {\n                   # Check for POSIX incompatibilities with -m.\n                   # HP-UX 11.23 and IRIX 6.5 mkdir -m -p sets group- or\n                   # other-writable bit of parent directory when it shouldn't.\n                   # FreeBSD 6.1 mkdir -m -p sets mode of existing directory.\n                   test_tmpdir=\"$tmpdir/a\"\n                   ls_ld_tmpdir=`ls -ld \"$test_tmpdir\"`\n                   case $ls_ld_tmpdir in\n                     d????-?r-*) different_mode=700;;\n                     d????-?--*) different_mode=755;;\n                     *) false;;\n                   esac &&\n                   $mkdirprog -m$different_mode -p -- \"$test_tmpdir\" && {\n                     ls_ld_tmpdir_1=`ls -ld \"$test_tmpdir\"`\n                     test \"$ls_ld_tmpdir\" = \"$ls_ld_tmpdir_1\"\n                   }\n                 }\n              then posix_mkdir=:\n              fi\n              rmdir \"$tmpdir/a/b\" \"$tmpdir/a\" \"$tmpdir\"\n            else\n              # Remove any dirs left behind by ancient mkdir implementations.\n              rmdir ./$mkdir_mode ./-p ./-- \"$tmpdir\" 2>/dev/null\n            fi\n            trap '' 0;;\n        esac;;\n    esac\n\n    if\n      $posix_mkdir && (\n        umask $mkdir_umask &&\n        $doit_exec $mkdirprog $mkdir_mode -p -- \"$dstdir\"\n      )\n    then :\n    else\n\n      # The umask is ridiculous, or mkdir does not conform to POSIX,\n      # or it failed possibly due to a race condition.  Create the\n      # directory the slow way, step by step, checking for races as we go.\n\n      case $dstdir in\n        /*) prefix='/';;\n        [-=\\(\\)!]*) prefix='./';;\n        *)  prefix='';;\n      esac\n\n      oIFS=$IFS\n      IFS=/\n      set -f\n      set fnord $dstdir\n      shift\n      set +f\n      IFS=$oIFS\n\n      prefixes=\n\n      for d\n      do\n        test X\"$d\" = X && continue\n\n        prefix=$prefix$d\n        if test -d \"$prefix\"; then\n          prefixes=\n        else\n          if $posix_mkdir; then\n            (umask=$mkdir_umask &&\n             $doit_exec $mkdirprog $mkdir_mode -p -- \"$dstdir\") && break\n            # Don't fail if two instances are running concurrently.\n            test -d \"$prefix\" || exit 1\n          else\n            case $prefix in\n              *\\'*) qprefix=`echo \"$prefix\" | sed \"s/'/'\\\\\\\\\\\\\\\\''/g\"`;;\n              *) qprefix=$prefix;;\n            esac\n            prefixes=\"$prefixes '$qprefix'\"\n          fi\n        fi\n        prefix=$prefix/\n      done\n\n      if test -n \"$prefixes\"; then\n        # Don't fail if two instances are running concurrently.\n        (umask $mkdir_umask &&\n         eval \"\\$doit_exec \\$mkdirprog $prefixes\") ||\n          test -d \"$dstdir\" || exit 1\n        obsolete_mkdir_used=true\n      fi\n    fi\n  fi\n\n  if test -n \"$dir_arg\"; then\n    { test -z \"$chowncmd\" || $doit $chowncmd \"$dst\"; } &&\n    { test -z \"$chgrpcmd\" || $doit $chgrpcmd \"$dst\"; } &&\n    { test \"$obsolete_mkdir_used$chowncmd$chgrpcmd\" = false ||\n      test -z \"$chmodcmd\" || $doit $chmodcmd $mode \"$dst\"; } || exit 1\n  else\n\n    # Make a couple of temp file names in the proper directory.\n    dsttmp=$dstdir/_inst.$$_\n    rmtmp=$dstdir/_rm.$$_\n\n    # Trap to clean up those temp files at exit.\n    trap 'ret=$?; rm -f \"$dsttmp\" \"$rmtmp\" && exit $ret' 0\n\n    # Copy the file name to the temp name.\n    (umask $cp_umask && $doit_exec $cpprog \"$src\" \"$dsttmp\") &&\n\n    # and set any options; do chmod last to preserve setuid bits.\n    #\n    # If any of these fail, we abort the whole thing.  If we want to\n    # ignore errors from any of these, just make sure not to ignore\n    # errors from the above \"$doit $cpprog $src $dsttmp\" command.\n    #\n    { test -z \"$chowncmd\" || $doit $chowncmd \"$dsttmp\"; } &&\n    { test -z \"$chgrpcmd\" || $doit $chgrpcmd \"$dsttmp\"; } &&\n    { test -z \"$stripcmd\" || $doit $stripcmd \"$dsttmp\"; } &&\n    { test -z \"$chmodcmd\" || $doit $chmodcmd $mode \"$dsttmp\"; } &&\n\n    # If -C, don't bother to copy if it wouldn't change the file.\n    if $copy_on_change &&\n       old=`LC_ALL=C ls -dlL \"$dst\"     2>/dev/null` &&\n       new=`LC_ALL=C ls -dlL \"$dsttmp\"  2>/dev/null` &&\n       set -f &&\n       set X $old && old=:$2:$4:$5:$6 &&\n       set X $new && new=:$2:$4:$5:$6 &&\n       set +f &&\n       test \"$old\" = \"$new\" &&\n       $cmpprog \"$dst\" \"$dsttmp\" >/dev/null 2>&1\n    then\n      rm -f \"$dsttmp\"\n    else\n      # Rename the file to the real destination.\n      $doit $mvcmd -f \"$dsttmp\" \"$dst\" 2>/dev/null ||\n\n      # The rename failed, perhaps because mv can't rename something else\n      # to itself, or perhaps because mv is so ancient that it does not\n      # support -f.\n      {\n        # Now remove or move aside any old file at destination location.\n        # We try this two ways since rm can't unlink itself on some\n        # systems and the destination file might be busy for other\n        # reasons.  In this case, the final cleanup might fail but the new\n        # file should still install successfully.\n        {\n          test ! -f \"$dst\" ||\n          $doit $rmcmd -f \"$dst\" 2>/dev/null ||\n          { $doit $mvcmd -f \"$dst\" \"$rmtmp\" 2>/dev/null &&\n            { $doit $rmcmd -f \"$rmtmp\" 2>/dev/null; :; }\n          } ||\n          { echo \"$0: cannot unlink or rename $dst\" >&2\n            (exit 1); exit 1\n          }\n        } &&\n\n        # Now rename the file to the real destination.\n        $doit $mvcmd \"$dsttmp\" \"$dst\"\n      }\n    fi || exit 1\n\n    trap '' 0\n  fi\ndone\n\n# Local variables:\n# eval: (add-hook 'write-file-hooks 'time-stamp)\n# time-stamp-start: \"scriptversion=\"\n# time-stamp-format: \"%:y-%02m-%02d.%02H\"\n# time-stamp-time-zone: \"UTC\"\n# time-stamp-end: \"; # UTC\"\n# End:\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/ltmain.sh",
    "content": "#! /bin/sh\n## DO NOT EDIT - This file generated from ./build-aux/ltmain.in\n##               by inline-source v2014-01-03.01\n\n# libtool (GNU libtool) 2.4.6\n# Provide generalized library-building support services.\n# Written by Gordon Matzigkeit <gord@gnu.ai.mit.edu>, 1996\n\n# Copyright (C) 1996-2015 Free Software Foundation, Inc.\n# This is free software; see the source for copying conditions.  There is NO\n# warranty; not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.\n\n# GNU Libtool is free software; you can redistribute it and/or modify\n# it under the terms of the GNU General Public License as published by\n# the Free Software Foundation; either version 2 of the License, or\n# (at your option) any later version.\n#\n# As a special exception to the GNU General Public License,\n# if you distribute this file as part of a program or library that\n# is built using GNU Libtool, you may include this file under the\n# same distribution terms that you use for the rest of that program.\n#\n# GNU Libtool is distributed in the hope that it will be useful, but\n# WITHOUT ANY WARRANTY; without even the implied warranty of\n# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n# General Public License for more details.\n#\n# You should have received a copy of the GNU General Public License\n# along with this program.  If not, see <http://www.gnu.org/licenses/>.\n\n\nPROGRAM=libtool\nPACKAGE=libtool\nVERSION=\"2.4.6 Debian-2.4.6-2\"\npackage_revision=2.4.6\n\n\n## ------ ##\n## Usage. ##\n## ------ ##\n\n# Run './libtool --help' for help with using this script from the\n# command line.\n\n\n## ------------------------------- ##\n## User overridable command paths. ##\n## ------------------------------- ##\n\n# After configure completes, it has a better idea of some of the\n# shell tools we need than the defaults used by the functions shared\n# with bootstrap, so set those here where they can still be over-\n# ridden by the user, but otherwise take precedence.\n\n: ${AUTOCONF=\"autoconf\"}\n: ${AUTOMAKE=\"automake\"}\n\n\n## -------------------------- ##\n## Source external libraries. ##\n## -------------------------- ##\n\n# Much of our low-level functionality needs to be sourced from external\n# libraries, which are installed to $pkgauxdir.\n\n# Set a version string for this script.\nscriptversion=2015-01-20.17; # UTC\n\n# General shell script boiler plate, and helper functions.\n# Written by Gary V. Vaughan, 2004\n\n# Copyright (C) 2004-2015 Free Software Foundation, Inc.\n# This is free software; see the source for copying conditions.  There is NO\n# warranty; not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.\n\n# This program is free software; you can redistribute it and/or modify\n# it under the terms of the GNU General Public License as published by\n# the Free Software Foundation; either version 3 of the License, or\n# (at your option) any later version.\n\n# As a special exception to the GNU General Public License, if you distribute\n# this file as part of a program or library that is built using GNU Libtool,\n# you may include this file under the same distribution terms that you use\n# for the rest of that program.\n\n# This program is distributed in the hope that it will be useful,\n# but WITHOUT ANY WARRANTY; without even the implied warranty of\n# MERCHANTABILITY or FITNES FOR A PARTICULAR PURPOSE. See the GNU\n# General Public License for more details.\n\n# You should have received a copy of the GNU General Public License\n# along with this program. If not, see <http://www.gnu.org/licenses/>.\n\n# Please report bugs or propose patches to gary@gnu.org.\n\n\n## ------ ##\n## Usage. ##\n## ------ ##\n\n# Evaluate this file near the top of your script to gain access to\n# the functions and variables defined here:\n#\n#   . `echo \"$0\" | ${SED-sed} 's|[^/]*$||'`/build-aux/funclib.sh\n#\n# If you need to override any of the default environment variable\n# settings, do that before evaluating this file.\n\n\n## -------------------- ##\n## Shell normalisation. ##\n## -------------------- ##\n\n# Some shells need a little help to be as Bourne compatible as possible.\n# Before doing anything else, make sure all that help has been provided!\n\nDUALCASE=1; export DUALCASE # for MKS sh\nif test -n \"${ZSH_VERSION+set}\" && (emulate sh) >/dev/null 2>&1; then :\n  emulate sh\n  NULLCMD=:\n  # Pre-4.2 versions of Zsh do word splitting on ${1+\"$@\"}, which\n  # is contrary to our usage.  Disable this feature.\n  alias -g '${1+\"$@\"}'='\"$@\"'\n  setopt NO_GLOB_SUBST\nelse\n  case `(set -o) 2>/dev/null` in *posix*) set -o posix ;; esac\nfi\n\n# NLS nuisances: We save the old values in case they are required later.\n_G_user_locale=\n_G_safe_locale=\nfor _G_var in LANG LANGUAGE LC_ALL LC_CTYPE LC_COLLATE LC_MESSAGES\ndo\n  eval \"if test set = \\\"\\${$_G_var+set}\\\"; then\n          save_$_G_var=\\$$_G_var\n          $_G_var=C\n\t  export $_G_var\n\t  _G_user_locale=\\\"$_G_var=\\\\\\$save_\\$_G_var; \\$_G_user_locale\\\"\n\t  _G_safe_locale=\\\"$_G_var=C; \\$_G_safe_locale\\\"\n\tfi\"\ndone\n\n# CDPATH.\n(unset CDPATH) >/dev/null 2>&1 && unset CDPATH\n\n# Make sure IFS has a sensible default\nsp=' '\nnl='\n'\nIFS=\"$sp\t$nl\"\n\n# There are apparently some retarded systems that use ';' as a PATH separator!\nif test \"${PATH_SEPARATOR+set}\" != set; then\n  PATH_SEPARATOR=:\n  (PATH='/bin;/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 && {\n    (PATH='/bin:/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 ||\n      PATH_SEPARATOR=';'\n  }\nfi\n\n\n\n## ------------------------- ##\n## Locate command utilities. ##\n## ------------------------- ##\n\n\n# func_executable_p FILE\n# ----------------------\n# Check that FILE is an executable regular file.\nfunc_executable_p ()\n{\n    test -f \"$1\" && test -x \"$1\"\n}\n\n\n# func_path_progs PROGS_LIST CHECK_FUNC [PATH]\n# --------------------------------------------\n# Search for either a program that responds to --version with output\n# containing \"GNU\", or else returned by CHECK_FUNC otherwise, by\n# trying all the directories in PATH with each of the elements of\n# PROGS_LIST.\n#\n# CHECK_FUNC should accept the path to a candidate program, and\n# set $func_check_prog_result if it truncates its output less than\n# $_G_path_prog_max characters.\nfunc_path_progs ()\n{\n    _G_progs_list=$1\n    _G_check_func=$2\n    _G_PATH=${3-\"$PATH\"}\n\n    _G_path_prog_max=0\n    _G_path_prog_found=false\n    _G_save_IFS=$IFS; IFS=${PATH_SEPARATOR-:}\n    for _G_dir in $_G_PATH; do\n      IFS=$_G_save_IFS\n      test -z \"$_G_dir\" && _G_dir=.\n      for _G_prog_name in $_G_progs_list; do\n        for _exeext in '' .EXE; do\n          _G_path_prog=$_G_dir/$_G_prog_name$_exeext\n          func_executable_p \"$_G_path_prog\" || continue\n          case `\"$_G_path_prog\" --version 2>&1` in\n            *GNU*) func_path_progs_result=$_G_path_prog _G_path_prog_found=: ;;\n            *)     $_G_check_func $_G_path_prog\n\t\t   func_path_progs_result=$func_check_prog_result\n\t\t   ;;\n          esac\n          $_G_path_prog_found && break 3\n        done\n      done\n    done\n    IFS=$_G_save_IFS\n    test -z \"$func_path_progs_result\" && {\n      echo \"no acceptable sed could be found in \\$PATH\" >&2\n      exit 1\n    }\n}\n\n\n# We want to be able to use the functions in this file before configure\n# has figured out where the best binaries are kept, which means we have\n# to search for them ourselves - except when the results are already set\n# where we skip the searches.\n\n# Unless the user overrides by setting SED, search the path for either GNU\n# sed, or the sed that truncates its output the least.\ntest -z \"$SED\" && {\n  _G_sed_script=s/aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa/bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb/\n  for _G_i in 1 2 3 4 5 6 7; do\n    _G_sed_script=$_G_sed_script$nl$_G_sed_script\n  done\n  echo \"$_G_sed_script\" 2>/dev/null | sed 99q >conftest.sed\n  _G_sed_script=\n\n  func_check_prog_sed ()\n  {\n    _G_path_prog=$1\n\n    _G_count=0\n    printf 0123456789 >conftest.in\n    while :\n    do\n      cat conftest.in conftest.in >conftest.tmp\n      mv conftest.tmp conftest.in\n      cp conftest.in conftest.nl\n      echo '' >> conftest.nl\n      \"$_G_path_prog\" -f conftest.sed <conftest.nl >conftest.out 2>/dev/null || break\n      diff conftest.out conftest.nl >/dev/null 2>&1 || break\n      _G_count=`expr $_G_count + 1`\n      if test \"$_G_count\" -gt \"$_G_path_prog_max\"; then\n        # Best one so far, save it but keep looking for a better one\n        func_check_prog_result=$_G_path_prog\n        _G_path_prog_max=$_G_count\n      fi\n      # 10*(2^10) chars as input seems more than enough\n      test 10 -lt \"$_G_count\" && break\n    done\n    rm -f conftest.in conftest.tmp conftest.nl conftest.out\n  }\n\n  func_path_progs \"sed gsed\" func_check_prog_sed $PATH:/usr/xpg4/bin\n  rm -f conftest.sed\n  SED=$func_path_progs_result\n}\n\n\n# Unless the user overrides by setting GREP, search the path for either GNU\n# grep, or the grep that truncates its output the least.\ntest -z \"$GREP\" && {\n  func_check_prog_grep ()\n  {\n    _G_path_prog=$1\n\n    _G_count=0\n    _G_path_prog_max=0\n    printf 0123456789 >conftest.in\n    while :\n    do\n      cat conftest.in conftest.in >conftest.tmp\n      mv conftest.tmp conftest.in\n      cp conftest.in conftest.nl\n      echo 'GREP' >> conftest.nl\n      \"$_G_path_prog\" -e 'GREP$' -e '-(cannot match)-' <conftest.nl >conftest.out 2>/dev/null || break\n      diff conftest.out conftest.nl >/dev/null 2>&1 || break\n      _G_count=`expr $_G_count + 1`\n      if test \"$_G_count\" -gt \"$_G_path_prog_max\"; then\n        # Best one so far, save it but keep looking for a better one\n        func_check_prog_result=$_G_path_prog\n        _G_path_prog_max=$_G_count\n      fi\n      # 10*(2^10) chars as input seems more than enough\n      test 10 -lt \"$_G_count\" && break\n    done\n    rm -f conftest.in conftest.tmp conftest.nl conftest.out\n  }\n\n  func_path_progs \"grep ggrep\" func_check_prog_grep $PATH:/usr/xpg4/bin\n  GREP=$func_path_progs_result\n}\n\n\n## ------------------------------- ##\n## User overridable command paths. ##\n## ------------------------------- ##\n\n# All uppercase variable names are used for environment variables.  These\n# variables can be overridden by the user before calling a script that\n# uses them if a suitable command of that name is not already available\n# in the command search PATH.\n\n: ${CP=\"cp -f\"}\n: ${ECHO=\"printf %s\\n\"}\n: ${EGREP=\"$GREP -E\"}\n: ${FGREP=\"$GREP -F\"}\n: ${LN_S=\"ln -s\"}\n: ${MAKE=\"make\"}\n: ${MKDIR=\"mkdir\"}\n: ${MV=\"mv -f\"}\n: ${RM=\"rm -f\"}\n: ${SHELL=\"${CONFIG_SHELL-/bin/sh}\"}\n\n\n## -------------------- ##\n## Useful sed snippets. ##\n## -------------------- ##\n\nsed_dirname='s|/[^/]*$||'\nsed_basename='s|^.*/||'\n\n# Sed substitution that helps us do robust quoting.  It backslashifies\n# metacharacters that are still active within double-quoted strings.\nsed_quote_subst='s|\\([`\"$\\\\]\\)|\\\\\\1|g'\n\n# Same as above, but do not quote variable references.\nsed_double_quote_subst='s/\\([\"`\\\\]\\)/\\\\\\1/g'\n\n# Sed substitution that turns a string into a regex matching for the\n# string literally.\nsed_make_literal_regex='s|[].[^$\\\\*\\/]|\\\\&|g'\n\n# Sed substitution that converts a w32 file name or path\n# that contains forward slashes, into one that contains\n# (escaped) backslashes.  A very naive implementation.\nsed_naive_backslashify='s|\\\\\\\\*|\\\\|g;s|/|\\\\|g;s|\\\\|\\\\\\\\|g'\n\n# Re-'\\' parameter expansions in output of sed_double_quote_subst that\n# were '\\'-ed in input to the same.  If an odd number of '\\' preceded a\n# '$' in input to sed_double_quote_subst, that '$' was protected from\n# expansion.  Since each input '\\' is now two '\\'s, look for any number\n# of runs of four '\\'s followed by two '\\'s and then a '$'.  '\\' that '$'.\n_G_bs='\\\\'\n_G_bs2='\\\\\\\\'\n_G_bs4='\\\\\\\\\\\\\\\\'\n_G_dollar='\\$'\nsed_double_backslash=\"\\\n  s/$_G_bs4/&\\\\\n/g\n  s/^$_G_bs2$_G_dollar/$_G_bs&/\n  s/\\\\([^$_G_bs]\\\\)$_G_bs2$_G_dollar/\\\\1$_G_bs2$_G_bs$_G_dollar/g\n  s/\\n//g\"\n\n\n## ----------------- ##\n## Global variables. ##\n## ----------------- ##\n\n# Except for the global variables explicitly listed below, the following\n# functions in the '^func_' namespace, and the '^require_' namespace\n# variables initialised in the 'Resource management' section, sourcing\n# this file will not pollute your global namespace with anything\n# else. There's no portable way to scope variables in Bourne shell\n# though, so actually running these functions will sometimes place\n# results into a variable named after the function, and often use\n# temporary variables in the '^_G_' namespace. If you are careful to\n# avoid using those namespaces casually in your sourcing script, things\n# should continue to work as you expect. And, of course, you can freely\n# overwrite any of the functions or variables defined here before\n# calling anything to customize them.\n\nEXIT_SUCCESS=0\nEXIT_FAILURE=1\nEXIT_MISMATCH=63  # $? = 63 is used to indicate version mismatch to missing.\nEXIT_SKIP=77\t  # $? = 77 is used to indicate a skipped test to automake.\n\n# Allow overriding, eg assuming that you follow the convention of\n# putting '$debug_cmd' at the start of all your functions, you can get\n# bash to show function call trace with:\n#\n#    debug_cmd='eval echo \"${FUNCNAME[0]} $*\" >&2' bash your-script-name\ndebug_cmd=${debug_cmd-\":\"}\nexit_cmd=:\n\n# By convention, finish your script with:\n#\n#    exit $exit_status\n#\n# so that you can set exit_status to non-zero if you want to indicate\n# something went wrong during execution without actually bailing out at\n# the point of failure.\nexit_status=$EXIT_SUCCESS\n\n# Work around backward compatibility issue on IRIX 6.5. On IRIX 6.4+, sh\n# is ksh but when the shell is invoked as \"sh\" and the current value of\n# the _XPG environment variable is not equal to 1 (one), the special\n# positional parameter $0, within a function call, is the name of the\n# function.\nprogpath=$0\n\n# The name of this program.\nprogname=`$ECHO \"$progpath\" |$SED \"$sed_basename\"`\n\n# Make sure we have an absolute progpath for reexecution:\ncase $progpath in\n  [\\\\/]*|[A-Za-z]:\\\\*) ;;\n  *[\\\\/]*)\n     progdir=`$ECHO \"$progpath\" |$SED \"$sed_dirname\"`\n     progdir=`cd \"$progdir\" && pwd`\n     progpath=$progdir/$progname\n     ;;\n  *)\n     _G_IFS=$IFS\n     IFS=${PATH_SEPARATOR-:}\n     for progdir in $PATH; do\n       IFS=$_G_IFS\n       test -x \"$progdir/$progname\" && break\n     done\n     IFS=$_G_IFS\n     test -n \"$progdir\" || progdir=`pwd`\n     progpath=$progdir/$progname\n     ;;\nesac\n\n\n## ----------------- ##\n## Standard options. ##\n## ----------------- ##\n\n# The following options affect the operation of the functions defined\n# below, and should be set appropriately depending on run-time para-\n# meters passed on the command line.\n\nopt_dry_run=false\nopt_quiet=false\nopt_verbose=false\n\n# Categories 'all' and 'none' are always available.  Append any others\n# you will pass as the first argument to func_warning from your own\n# code.\nwarning_categories=\n\n# By default, display warnings according to 'opt_warning_types'.  Set\n# 'warning_func'  to ':' to elide all warnings, or func_fatal_error to\n# treat the next displayed warning as a fatal error.\nwarning_func=func_warn_and_continue\n\n# Set to 'all' to display all warnings, 'none' to suppress all\n# warnings, or a space delimited list of some subset of\n# 'warning_categories' to display only the listed warnings.\nopt_warning_types=all\n\n\n## -------------------- ##\n## Resource management. ##\n## -------------------- ##\n\n# This section contains definitions for functions that each ensure a\n# particular resource (a file, or a non-empty configuration variable for\n# example) is available, and if appropriate to extract default values\n# from pertinent package files. Call them using their associated\n# 'require_*' variable to ensure that they are executed, at most, once.\n#\n# It's entirely deliberate that calling these functions can set\n# variables that don't obey the namespace limitations obeyed by the rest\n# of this file, in order that that they be as useful as possible to\n# callers.\n\n\n# require_term_colors\n# -------------------\n# Allow display of bold text on terminals that support it.\nrequire_term_colors=func_require_term_colors\nfunc_require_term_colors ()\n{\n    $debug_cmd\n\n    test -t 1 && {\n      # COLORTERM and USE_ANSI_COLORS environment variables take\n      # precedence, because most terminfo databases neglect to describe\n      # whether color sequences are supported.\n      test -n \"${COLORTERM+set}\" && : ${USE_ANSI_COLORS=\"1\"}\n\n      if test 1 = \"$USE_ANSI_COLORS\"; then\n        # Standard ANSI escape sequences\n        tc_reset='\u001b[0m'\n        tc_bold='\u001b[1m';   tc_standout='\u001b[7m'\n        tc_red='\u001b[31m';   tc_green='\u001b[32m'\n        tc_blue='\u001b[34m';  tc_cyan='\u001b[36m'\n      else\n        # Otherwise trust the terminfo database after all.\n        test -n \"`tput sgr0 2>/dev/null`\" && {\n          tc_reset=`tput sgr0`\n          test -n \"`tput bold 2>/dev/null`\" && tc_bold=`tput bold`\n          tc_standout=$tc_bold\n          test -n \"`tput smso 2>/dev/null`\" && tc_standout=`tput smso`\n          test -n \"`tput setaf 1 2>/dev/null`\" && tc_red=`tput setaf 1`\n          test -n \"`tput setaf 2 2>/dev/null`\" && tc_green=`tput setaf 2`\n          test -n \"`tput setaf 4 2>/dev/null`\" && tc_blue=`tput setaf 4`\n          test -n \"`tput setaf 5 2>/dev/null`\" && tc_cyan=`tput setaf 5`\n        }\n      fi\n    }\n\n    require_term_colors=:\n}\n\n\n## ----------------- ##\n## Function library. ##\n## ----------------- ##\n\n# This section contains a variety of useful functions to call in your\n# scripts. Take note of the portable wrappers for features provided by\n# some modern shells, which will fall back to slower equivalents on\n# less featureful shells.\n\n\n# func_append VAR VALUE\n# ---------------------\n# Append VALUE onto the existing contents of VAR.\n\n  # We should try to minimise forks, especially on Windows where they are\n  # unreasonably slow, so skip the feature probes when bash or zsh are\n  # being used:\n  if test set = \"${BASH_VERSION+set}${ZSH_VERSION+set}\"; then\n    : ${_G_HAVE_ARITH_OP=\"yes\"}\n    : ${_G_HAVE_XSI_OPS=\"yes\"}\n    # The += operator was introduced in bash 3.1\n    case $BASH_VERSION in\n      [12].* | 3.0 | 3.0*) ;;\n      *)\n        : ${_G_HAVE_PLUSEQ_OP=\"yes\"}\n        ;;\n    esac\n  fi\n\n  # _G_HAVE_PLUSEQ_OP\n  # Can be empty, in which case the shell is probed, \"yes\" if += is\n  # useable or anything else if it does not work.\n  test -z \"$_G_HAVE_PLUSEQ_OP\" \\\n    && (eval 'x=a; x+=\" b\"; test \"a b\" = \"$x\"') 2>/dev/null \\\n    && _G_HAVE_PLUSEQ_OP=yes\n\nif test yes = \"$_G_HAVE_PLUSEQ_OP\"\nthen\n  # This is an XSI compatible shell, allowing a faster implementation...\n  eval 'func_append ()\n  {\n    $debug_cmd\n\n    eval \"$1+=\\$2\"\n  }'\nelse\n  # ...otherwise fall back to using expr, which is often a shell builtin.\n  func_append ()\n  {\n    $debug_cmd\n\n    eval \"$1=\\$$1\\$2\"\n  }\nfi\n\n\n# func_append_quoted VAR VALUE\n# ----------------------------\n# Quote VALUE and append to the end of shell variable VAR, separated\n# by a space.\nif test yes = \"$_G_HAVE_PLUSEQ_OP\"; then\n  eval 'func_append_quoted ()\n  {\n    $debug_cmd\n\n    func_quote_for_eval \"$2\"\n    eval \"$1+=\\\\ \\$func_quote_for_eval_result\"\n  }'\nelse\n  func_append_quoted ()\n  {\n    $debug_cmd\n\n    func_quote_for_eval \"$2\"\n    eval \"$1=\\$$1\\\\ \\$func_quote_for_eval_result\"\n  }\nfi\n\n\n# func_append_uniq VAR VALUE\n# --------------------------\n# Append unique VALUE onto the existing contents of VAR, assuming\n# entries are delimited by the first character of VALUE.  For example:\n#\n#   func_append_uniq options \" --another-option option-argument\"\n#\n# will only append to $options if \" --another-option option-argument \"\n# is not already present somewhere in $options already (note spaces at\n# each end implied by leading space in second argument).\nfunc_append_uniq ()\n{\n    $debug_cmd\n\n    eval _G_current_value='`$ECHO $'$1'`'\n    _G_delim=`expr \"$2\" : '\\(.\\)'`\n\n    case $_G_delim$_G_current_value$_G_delim in\n      *\"$2$_G_delim\"*) ;;\n      *) func_append \"$@\" ;;\n    esac\n}\n\n\n# func_arith TERM...\n# ------------------\n# Set func_arith_result to the result of evaluating TERMs.\n  test -z \"$_G_HAVE_ARITH_OP\" \\\n    && (eval 'test 2 = $(( 1 + 1 ))') 2>/dev/null \\\n    && _G_HAVE_ARITH_OP=yes\n\nif test yes = \"$_G_HAVE_ARITH_OP\"; then\n  eval 'func_arith ()\n  {\n    $debug_cmd\n\n    func_arith_result=$(( $* ))\n  }'\nelse\n  func_arith ()\n  {\n    $debug_cmd\n\n    func_arith_result=`expr \"$@\"`\n  }\nfi\n\n\n# func_basename FILE\n# ------------------\n# Set func_basename_result to FILE with everything up to and including\n# the last / stripped.\nif test yes = \"$_G_HAVE_XSI_OPS\"; then\n  # If this shell supports suffix pattern removal, then use it to avoid\n  # forking. Hide the definitions single quotes in case the shell chokes\n  # on unsupported syntax...\n  _b='func_basename_result=${1##*/}'\n  _d='case $1 in\n        */*) func_dirname_result=${1%/*}$2 ;;\n        *  ) func_dirname_result=$3        ;;\n      esac'\n\nelse\n  # ...otherwise fall back to using sed.\n  _b='func_basename_result=`$ECHO \"$1\" |$SED \"$sed_basename\"`'\n  _d='func_dirname_result=`$ECHO \"$1\"  |$SED \"$sed_dirname\"`\n      if test \"X$func_dirname_result\" = \"X$1\"; then\n        func_dirname_result=$3\n      else\n        func_append func_dirname_result \"$2\"\n      fi'\nfi\n\neval 'func_basename ()\n{\n    $debug_cmd\n\n    '\"$_b\"'\n}'\n\n\n# func_dirname FILE APPEND NONDIR_REPLACEMENT\n# -------------------------------------------\n# Compute the dirname of FILE.  If nonempty, add APPEND to the result,\n# otherwise set result to NONDIR_REPLACEMENT.\neval 'func_dirname ()\n{\n    $debug_cmd\n\n    '\"$_d\"'\n}'\n\n\n# func_dirname_and_basename FILE APPEND NONDIR_REPLACEMENT\n# --------------------------------------------------------\n# Perform func_basename and func_dirname in a single function\n# call:\n#   dirname:  Compute the dirname of FILE.  If nonempty,\n#             add APPEND to the result, otherwise set result\n#             to NONDIR_REPLACEMENT.\n#             value returned in \"$func_dirname_result\"\n#   basename: Compute filename of FILE.\n#             value retuned in \"$func_basename_result\"\n# For efficiency, we do not delegate to the functions above but instead\n# duplicate the functionality here.\neval 'func_dirname_and_basename ()\n{\n    $debug_cmd\n\n    '\"$_b\"'\n    '\"$_d\"'\n}'\n\n\n# func_echo ARG...\n# ----------------\n# Echo program name prefixed message.\nfunc_echo ()\n{\n    $debug_cmd\n\n    _G_message=$*\n\n    func_echo_IFS=$IFS\n    IFS=$nl\n    for _G_line in $_G_message; do\n      IFS=$func_echo_IFS\n      $ECHO \"$progname: $_G_line\"\n    done\n    IFS=$func_echo_IFS\n}\n\n\n# func_echo_all ARG...\n# --------------------\n# Invoke $ECHO with all args, space-separated.\nfunc_echo_all ()\n{\n    $ECHO \"$*\"\n}\n\n\n# func_echo_infix_1 INFIX ARG...\n# ------------------------------\n# Echo program name, followed by INFIX on the first line, with any\n# additional lines not showing INFIX.\nfunc_echo_infix_1 ()\n{\n    $debug_cmd\n\n    $require_term_colors\n\n    _G_infix=$1; shift\n    _G_indent=$_G_infix\n    _G_prefix=\"$progname: $_G_infix: \"\n    _G_message=$*\n\n    # Strip color escape sequences before counting printable length\n    for _G_tc in \"$tc_reset\" \"$tc_bold\" \"$tc_standout\" \"$tc_red\" \"$tc_green\" \"$tc_blue\" \"$tc_cyan\"\n    do\n      test -n \"$_G_tc\" && {\n        _G_esc_tc=`$ECHO \"$_G_tc\" | $SED \"$sed_make_literal_regex\"`\n        _G_indent=`$ECHO \"$_G_indent\" | $SED \"s|$_G_esc_tc||g\"`\n      }\n    done\n    _G_indent=\"$progname: \"`echo \"$_G_indent\" | $SED 's|.| |g'`\"  \" ## exclude from sc_prohibit_nested_quotes\n\n    func_echo_infix_1_IFS=$IFS\n    IFS=$nl\n    for _G_line in $_G_message; do\n      IFS=$func_echo_infix_1_IFS\n      $ECHO \"$_G_prefix$tc_bold$_G_line$tc_reset\" >&2\n      _G_prefix=$_G_indent\n    done\n    IFS=$func_echo_infix_1_IFS\n}\n\n\n# func_error ARG...\n# -----------------\n# Echo program name prefixed message to standard error.\nfunc_error ()\n{\n    $debug_cmd\n\n    $require_term_colors\n\n    func_echo_infix_1 \"  $tc_standout${tc_red}error$tc_reset\" \"$*\" >&2\n}\n\n\n# func_fatal_error ARG...\n# -----------------------\n# Echo program name prefixed message to standard error, and exit.\nfunc_fatal_error ()\n{\n    $debug_cmd\n\n    func_error \"$*\"\n    exit $EXIT_FAILURE\n}\n\n\n# func_grep EXPRESSION FILENAME\n# -----------------------------\n# Check whether EXPRESSION matches any line of FILENAME, without output.\nfunc_grep ()\n{\n    $debug_cmd\n\n    $GREP \"$1\" \"$2\" >/dev/null 2>&1\n}\n\n\n# func_len STRING\n# ---------------\n# Set func_len_result to the length of STRING. STRING may not\n# start with a hyphen.\n  test -z \"$_G_HAVE_XSI_OPS\" \\\n    && (eval 'x=a/b/c;\n      test 5aa/bb/cc = \"${#x}${x%%/*}${x%/*}${x#*/}${x##*/}\"') 2>/dev/null \\\n    && _G_HAVE_XSI_OPS=yes\n\nif test yes = \"$_G_HAVE_XSI_OPS\"; then\n  eval 'func_len ()\n  {\n    $debug_cmd\n\n    func_len_result=${#1}\n  }'\nelse\n  func_len ()\n  {\n    $debug_cmd\n\n    func_len_result=`expr \"$1\" : \".*\" 2>/dev/null || echo $max_cmd_len`\n  }\nfi\n\n\n# func_mkdir_p DIRECTORY-PATH\n# ---------------------------\n# Make sure the entire path to DIRECTORY-PATH is available.\nfunc_mkdir_p ()\n{\n    $debug_cmd\n\n    _G_directory_path=$1\n    _G_dir_list=\n\n    if test -n \"$_G_directory_path\" && test : != \"$opt_dry_run\"; then\n\n      # Protect directory names starting with '-'\n      case $_G_directory_path in\n        -*) _G_directory_path=./$_G_directory_path ;;\n      esac\n\n      # While some portion of DIR does not yet exist...\n      while test ! -d \"$_G_directory_path\"; do\n        # ...make a list in topmost first order.  Use a colon delimited\n\t# list incase some portion of path contains whitespace.\n        _G_dir_list=$_G_directory_path:$_G_dir_list\n\n        # If the last portion added has no slash in it, the list is done\n        case $_G_directory_path in */*) ;; *) break ;; esac\n\n        # ...otherwise throw away the child directory and loop\n        _G_directory_path=`$ECHO \"$_G_directory_path\" | $SED -e \"$sed_dirname\"`\n      done\n      _G_dir_list=`$ECHO \"$_G_dir_list\" | $SED 's|:*$||'`\n\n      func_mkdir_p_IFS=$IFS; IFS=:\n      for _G_dir in $_G_dir_list; do\n\tIFS=$func_mkdir_p_IFS\n        # mkdir can fail with a 'File exist' error if two processes\n        # try to create one of the directories concurrently.  Don't\n        # stop in that case!\n        $MKDIR \"$_G_dir\" 2>/dev/null || :\n      done\n      IFS=$func_mkdir_p_IFS\n\n      # Bail out if we (or some other process) failed to create a directory.\n      test -d \"$_G_directory_path\" || \\\n        func_fatal_error \"Failed to create '$1'\"\n    fi\n}\n\n\n# func_mktempdir [BASENAME]\n# -------------------------\n# Make a temporary directory that won't clash with other running\n# libtool processes, and avoids race conditions if possible.  If\n# given, BASENAME is the basename for that directory.\nfunc_mktempdir ()\n{\n    $debug_cmd\n\n    _G_template=${TMPDIR-/tmp}/${1-$progname}\n\n    if test : = \"$opt_dry_run\"; then\n      # Return a directory name, but don't create it in dry-run mode\n      _G_tmpdir=$_G_template-$$\n    else\n\n      # If mktemp works, use that first and foremost\n      _G_tmpdir=`mktemp -d \"$_G_template-XXXXXXXX\" 2>/dev/null`\n\n      if test ! -d \"$_G_tmpdir\"; then\n        # Failing that, at least try and use $RANDOM to avoid a race\n        _G_tmpdir=$_G_template-${RANDOM-0}$$\n\n        func_mktempdir_umask=`umask`\n        umask 0077\n        $MKDIR \"$_G_tmpdir\"\n        umask $func_mktempdir_umask\n      fi\n\n      # If we're not in dry-run mode, bomb out on failure\n      test -d \"$_G_tmpdir\" || \\\n        func_fatal_error \"cannot create temporary directory '$_G_tmpdir'\"\n    fi\n\n    $ECHO \"$_G_tmpdir\"\n}\n\n\n# func_normal_abspath PATH\n# ------------------------\n# Remove doubled-up and trailing slashes, \".\" path components,\n# and cancel out any \"..\" path components in PATH after making\n# it an absolute path.\nfunc_normal_abspath ()\n{\n    $debug_cmd\n\n    # These SED scripts presuppose an absolute path with a trailing slash.\n    _G_pathcar='s|^/\\([^/]*\\).*$|\\1|'\n    _G_pathcdr='s|^/[^/]*||'\n    _G_removedotparts=':dotsl\n\t\ts|/\\./|/|g\n\t\tt dotsl\n\t\ts|/\\.$|/|'\n    _G_collapseslashes='s|/\\{1,\\}|/|g'\n    _G_finalslash='s|/*$|/|'\n\n    # Start from root dir and reassemble the path.\n    func_normal_abspath_result=\n    func_normal_abspath_tpath=$1\n    func_normal_abspath_altnamespace=\n    case $func_normal_abspath_tpath in\n      \"\")\n        # Empty path, that just means $cwd.\n        func_stripname '' '/' \"`pwd`\"\n        func_normal_abspath_result=$func_stripname_result\n        return\n        ;;\n      # The next three entries are used to spot a run of precisely\n      # two leading slashes without using negated character classes;\n      # we take advantage of case's first-match behaviour.\n      ///*)\n        # Unusual form of absolute path, do nothing.\n        ;;\n      //*)\n        # Not necessarily an ordinary path; POSIX reserves leading '//'\n        # and for example Cygwin uses it to access remote file shares\n        # over CIFS/SMB, so we conserve a leading double slash if found.\n        func_normal_abspath_altnamespace=/\n        ;;\n      /*)\n        # Absolute path, do nothing.\n        ;;\n      *)\n        # Relative path, prepend $cwd.\n        func_normal_abspath_tpath=`pwd`/$func_normal_abspath_tpath\n        ;;\n    esac\n\n    # Cancel out all the simple stuff to save iterations.  We also want\n    # the path to end with a slash for ease of parsing, so make sure\n    # there is one (and only one) here.\n    func_normal_abspath_tpath=`$ECHO \"$func_normal_abspath_tpath\" | $SED \\\n          -e \"$_G_removedotparts\" -e \"$_G_collapseslashes\" -e \"$_G_finalslash\"`\n    while :; do\n      # Processed it all yet?\n      if test / = \"$func_normal_abspath_tpath\"; then\n        # If we ascended to the root using \"..\" the result may be empty now.\n        if test -z \"$func_normal_abspath_result\"; then\n          func_normal_abspath_result=/\n        fi\n        break\n      fi\n      func_normal_abspath_tcomponent=`$ECHO \"$func_normal_abspath_tpath\" | $SED \\\n          -e \"$_G_pathcar\"`\n      func_normal_abspath_tpath=`$ECHO \"$func_normal_abspath_tpath\" | $SED \\\n          -e \"$_G_pathcdr\"`\n      # Figure out what to do with it\n      case $func_normal_abspath_tcomponent in\n        \"\")\n          # Trailing empty path component, ignore it.\n          ;;\n        ..)\n          # Parent dir; strip last assembled component from result.\n          func_dirname \"$func_normal_abspath_result\"\n          func_normal_abspath_result=$func_dirname_result\n          ;;\n        *)\n          # Actual path component, append it.\n          func_append func_normal_abspath_result \"/$func_normal_abspath_tcomponent\"\n          ;;\n      esac\n    done\n    # Restore leading double-slash if one was found on entry.\n    func_normal_abspath_result=$func_normal_abspath_altnamespace$func_normal_abspath_result\n}\n\n\n# func_notquiet ARG...\n# --------------------\n# Echo program name prefixed message only when not in quiet mode.\nfunc_notquiet ()\n{\n    $debug_cmd\n\n    $opt_quiet || func_echo ${1+\"$@\"}\n\n    # A bug in bash halts the script if the last line of a function\n    # fails when set -e is in force, so we need another command to\n    # work around that:\n    :\n}\n\n\n# func_relative_path SRCDIR DSTDIR\n# --------------------------------\n# Set func_relative_path_result to the relative path from SRCDIR to DSTDIR.\nfunc_relative_path ()\n{\n    $debug_cmd\n\n    func_relative_path_result=\n    func_normal_abspath \"$1\"\n    func_relative_path_tlibdir=$func_normal_abspath_result\n    func_normal_abspath \"$2\"\n    func_relative_path_tbindir=$func_normal_abspath_result\n\n    # Ascend the tree starting from libdir\n    while :; do\n      # check if we have found a prefix of bindir\n      case $func_relative_path_tbindir in\n        $func_relative_path_tlibdir)\n          # found an exact match\n          func_relative_path_tcancelled=\n          break\n          ;;\n        $func_relative_path_tlibdir*)\n          # found a matching prefix\n          func_stripname \"$func_relative_path_tlibdir\" '' \"$func_relative_path_tbindir\"\n          func_relative_path_tcancelled=$func_stripname_result\n          if test -z \"$func_relative_path_result\"; then\n            func_relative_path_result=.\n          fi\n          break\n          ;;\n        *)\n          func_dirname $func_relative_path_tlibdir\n          func_relative_path_tlibdir=$func_dirname_result\n          if test -z \"$func_relative_path_tlibdir\"; then\n            # Have to descend all the way to the root!\n            func_relative_path_result=../$func_relative_path_result\n            func_relative_path_tcancelled=$func_relative_path_tbindir\n            break\n          fi\n          func_relative_path_result=../$func_relative_path_result\n          ;;\n      esac\n    done\n\n    # Now calculate path; take care to avoid doubling-up slashes.\n    func_stripname '' '/' \"$func_relative_path_result\"\n    func_relative_path_result=$func_stripname_result\n    func_stripname '/' '/' \"$func_relative_path_tcancelled\"\n    if test -n \"$func_stripname_result\"; then\n      func_append func_relative_path_result \"/$func_stripname_result\"\n    fi\n\n    # Normalisation. If bindir is libdir, return '.' else relative path.\n    if test -n \"$func_relative_path_result\"; then\n      func_stripname './' '' \"$func_relative_path_result\"\n      func_relative_path_result=$func_stripname_result\n    fi\n\n    test -n \"$func_relative_path_result\" || func_relative_path_result=.\n\n    :\n}\n\n\n# func_quote_for_eval ARG...\n# --------------------------\n# Aesthetically quote ARGs to be evaled later.\n# This function returns two values:\n#   i) func_quote_for_eval_result\n#      double-quoted, suitable for a subsequent eval\n#  ii) func_quote_for_eval_unquoted_result\n#      has all characters that are still active within double\n#      quotes backslashified.\nfunc_quote_for_eval ()\n{\n    $debug_cmd\n\n    func_quote_for_eval_unquoted_result=\n    func_quote_for_eval_result=\n    while test 0 -lt $#; do\n      case $1 in\n        *[\\\\\\`\\\"\\$]*)\n\t  _G_unquoted_arg=`printf '%s\\n' \"$1\" |$SED \"$sed_quote_subst\"` ;;\n        *)\n          _G_unquoted_arg=$1 ;;\n      esac\n      if test -n \"$func_quote_for_eval_unquoted_result\"; then\n\tfunc_append func_quote_for_eval_unquoted_result \" $_G_unquoted_arg\"\n      else\n        func_append func_quote_for_eval_unquoted_result \"$_G_unquoted_arg\"\n      fi\n\n      case $_G_unquoted_arg in\n        # Double-quote args containing shell metacharacters to delay\n        # word splitting, command substitution and variable expansion\n        # for a subsequent eval.\n        # Many Bourne shells cannot handle close brackets correctly\n        # in scan sets, so we specify it separately.\n        *[\\[\\~\\#\\^\\&\\*\\(\\)\\{\\}\\|\\;\\<\\>\\?\\'\\ \\\t]*|*]*|\"\")\n          _G_quoted_arg=\\\"$_G_unquoted_arg\\\"\n          ;;\n        *)\n          _G_quoted_arg=$_G_unquoted_arg\n\t  ;;\n      esac\n\n      if test -n \"$func_quote_for_eval_result\"; then\n\tfunc_append func_quote_for_eval_result \" $_G_quoted_arg\"\n      else\n        func_append func_quote_for_eval_result \"$_G_quoted_arg\"\n      fi\n      shift\n    done\n}\n\n\n# func_quote_for_expand ARG\n# -------------------------\n# Aesthetically quote ARG to be evaled later; same as above,\n# but do not quote variable references.\nfunc_quote_for_expand ()\n{\n    $debug_cmd\n\n    case $1 in\n      *[\\\\\\`\\\"]*)\n\t_G_arg=`$ECHO \"$1\" | $SED \\\n\t    -e \"$sed_double_quote_subst\" -e \"$sed_double_backslash\"` ;;\n      *)\n        _G_arg=$1 ;;\n    esac\n\n    case $_G_arg in\n      # Double-quote args containing shell metacharacters to delay\n      # word splitting and command substitution for a subsequent eval.\n      # Many Bourne shells cannot handle close brackets correctly\n      # in scan sets, so we specify it separately.\n      *[\\[\\~\\#\\^\\&\\*\\(\\)\\{\\}\\|\\;\\<\\>\\?\\'\\ \\\t]*|*]*|\"\")\n        _G_arg=\\\"$_G_arg\\\"\n        ;;\n    esac\n\n    func_quote_for_expand_result=$_G_arg\n}\n\n\n# func_stripname PREFIX SUFFIX NAME\n# ---------------------------------\n# strip PREFIX and SUFFIX from NAME, and store in func_stripname_result.\n# PREFIX and SUFFIX must not contain globbing or regex special\n# characters, hashes, percent signs, but SUFFIX may contain a leading\n# dot (in which case that matches only a dot).\nif test yes = \"$_G_HAVE_XSI_OPS\"; then\n  eval 'func_stripname ()\n  {\n    $debug_cmd\n\n    # pdksh 5.2.14 does not do ${X%$Y} correctly if both X and Y are\n    # positional parameters, so assign one to ordinary variable first.\n    func_stripname_result=$3\n    func_stripname_result=${func_stripname_result#\"$1\"}\n    func_stripname_result=${func_stripname_result%\"$2\"}\n  }'\nelse\n  func_stripname ()\n  {\n    $debug_cmd\n\n    case $2 in\n      .*) func_stripname_result=`$ECHO \"$3\" | $SED -e \"s%^$1%%\" -e \"s%\\\\\\\\$2\\$%%\"`;;\n      *)  func_stripname_result=`$ECHO \"$3\" | $SED -e \"s%^$1%%\" -e \"s%$2\\$%%\"`;;\n    esac\n  }\nfi\n\n\n# func_show_eval CMD [FAIL_EXP]\n# -----------------------------\n# Unless opt_quiet is true, then output CMD.  Then, if opt_dryrun is\n# not true, evaluate CMD.  If the evaluation of CMD fails, and FAIL_EXP\n# is given, then evaluate it.\nfunc_show_eval ()\n{\n    $debug_cmd\n\n    _G_cmd=$1\n    _G_fail_exp=${2-':'}\n\n    func_quote_for_expand \"$_G_cmd\"\n    eval \"func_notquiet $func_quote_for_expand_result\"\n\n    $opt_dry_run || {\n      eval \"$_G_cmd\"\n      _G_status=$?\n      if test 0 -ne \"$_G_status\"; then\n\teval \"(exit $_G_status); $_G_fail_exp\"\n      fi\n    }\n}\n\n\n# func_show_eval_locale CMD [FAIL_EXP]\n# ------------------------------------\n# Unless opt_quiet is true, then output CMD.  Then, if opt_dryrun is\n# not true, evaluate CMD.  If the evaluation of CMD fails, and FAIL_EXP\n# is given, then evaluate it.  Use the saved locale for evaluation.\nfunc_show_eval_locale ()\n{\n    $debug_cmd\n\n    _G_cmd=$1\n    _G_fail_exp=${2-':'}\n\n    $opt_quiet || {\n      func_quote_for_expand \"$_G_cmd\"\n      eval \"func_echo $func_quote_for_expand_result\"\n    }\n\n    $opt_dry_run || {\n      eval \"$_G_user_locale\n\t    $_G_cmd\"\n      _G_status=$?\n      eval \"$_G_safe_locale\"\n      if test 0 -ne \"$_G_status\"; then\n\teval \"(exit $_G_status); $_G_fail_exp\"\n      fi\n    }\n}\n\n\n# func_tr_sh\n# ----------\n# Turn $1 into a string suitable for a shell variable name.\n# Result is stored in $func_tr_sh_result.  All characters\n# not in the set a-zA-Z0-9_ are replaced with '_'. Further,\n# if $1 begins with a digit, a '_' is prepended as well.\nfunc_tr_sh ()\n{\n    $debug_cmd\n\n    case $1 in\n    [0-9]* | *[!a-zA-Z0-9_]*)\n      func_tr_sh_result=`$ECHO \"$1\" | $SED -e 's/^\\([0-9]\\)/_\\1/' -e 's/[^a-zA-Z0-9_]/_/g'`\n      ;;\n    * )\n      func_tr_sh_result=$1\n      ;;\n    esac\n}\n\n\n# func_verbose ARG...\n# -------------------\n# Echo program name prefixed message in verbose mode only.\nfunc_verbose ()\n{\n    $debug_cmd\n\n    $opt_verbose && func_echo \"$*\"\n\n    :\n}\n\n\n# func_warn_and_continue ARG...\n# -----------------------------\n# Echo program name prefixed warning message to standard error.\nfunc_warn_and_continue ()\n{\n    $debug_cmd\n\n    $require_term_colors\n\n    func_echo_infix_1 \"${tc_red}warning$tc_reset\" \"$*\" >&2\n}\n\n\n# func_warning CATEGORY ARG...\n# ----------------------------\n# Echo program name prefixed warning message to standard error. Warning\n# messages can be filtered according to CATEGORY, where this function\n# elides messages where CATEGORY is not listed in the global variable\n# 'opt_warning_types'.\nfunc_warning ()\n{\n    $debug_cmd\n\n    # CATEGORY must be in the warning_categories list!\n    case \" $warning_categories \" in\n      *\" $1 \"*) ;;\n      *) func_internal_error \"invalid warning category '$1'\" ;;\n    esac\n\n    _G_category=$1\n    shift\n\n    case \" $opt_warning_types \" in\n      *\" $_G_category \"*) $warning_func ${1+\"$@\"} ;;\n    esac\n}\n\n\n# func_sort_ver VER1 VER2\n# -----------------------\n# 'sort -V' is not generally available.\n# Note this deviates from the version comparison in automake\n# in that it treats 1.5 < 1.5.0, and treats 1.4.4a < 1.4-p3a\n# but this should suffice as we won't be specifying old\n# version formats or redundant trailing .0 in bootstrap.conf.\n# If we did want full compatibility then we should probably\n# use m4_version_compare from autoconf.\nfunc_sort_ver ()\n{\n    $debug_cmd\n\n    printf '%s\\n%s\\n' \"$1\" \"$2\" \\\n      | sort -t. -k 1,1n -k 2,2n -k 3,3n -k 4,4n -k 5,5n -k 6,6n -k 7,7n -k 8,8n -k 9,9n\n}\n\n# func_lt_ver PREV CURR\n# ---------------------\n# Return true if PREV and CURR are in the correct order according to\n# func_sort_ver, otherwise false.  Use it like this:\n#\n#  func_lt_ver \"$prev_ver\" \"$proposed_ver\" || func_fatal_error \"...\"\nfunc_lt_ver ()\n{\n    $debug_cmd\n\n    test \"x$1\" = x`func_sort_ver \"$1\" \"$2\" | $SED 1q`\n}\n\n\n# Local variables:\n# mode: shell-script\n# sh-indentation: 2\n# eval: (add-hook 'before-save-hook 'time-stamp)\n# time-stamp-pattern: \"10/scriptversion=%:y-%02m-%02d.%02H; # UTC\"\n# time-stamp-time-zone: \"UTC\"\n# End:\n#! /bin/sh\n\n# Set a version string for this script.\nscriptversion=2014-01-07.03; # UTC\n\n# A portable, pluggable option parser for Bourne shell.\n# Written by Gary V. Vaughan, 2010\n\n# Copyright (C) 2010-2015 Free Software Foundation, Inc.\n# This is free software; see the source for copying conditions.  There is NO\n# warranty; not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.\n\n# This program is free software: you can redistribute it and/or modify\n# it under the terms of the GNU General Public License as published by\n# the Free Software Foundation, either version 3 of the License, or\n# (at your option) any later version.\n\n# This program is distributed in the hope that it will be useful,\n# but WITHOUT ANY WARRANTY; without even the implied warranty of\n# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n# GNU General Public License for more details.\n\n# You should have received a copy of the GNU General Public License\n# along with this program.  If not, see <http://www.gnu.org/licenses/>.\n\n# Please report bugs or propose patches to gary@gnu.org.\n\n\n## ------ ##\n## Usage. ##\n## ------ ##\n\n# This file is a library for parsing options in your shell scripts along\n# with assorted other useful supporting features that you can make use\n# of too.\n#\n# For the simplest scripts you might need only:\n#\n#   #!/bin/sh\n#   . relative/path/to/funclib.sh\n#   . relative/path/to/options-parser\n#   scriptversion=1.0\n#   func_options ${1+\"$@\"}\n#   eval set dummy \"$func_options_result\"; shift\n#   ...rest of your script...\n#\n# In order for the '--version' option to work, you will need to have a\n# suitably formatted comment like the one at the top of this file\n# starting with '# Written by ' and ending with '# warranty; '.\n#\n# For '-h' and '--help' to work, you will also need a one line\n# description of your script's purpose in a comment directly above the\n# '# Written by ' line, like the one at the top of this file.\n#\n# The default options also support '--debug', which will turn on shell\n# execution tracing (see the comment above debug_cmd below for another\n# use), and '--verbose' and the func_verbose function to allow your script\n# to display verbose messages only when your user has specified\n# '--verbose'.\n#\n# After sourcing this file, you can plug processing for additional\n# options by amending the variables from the 'Configuration' section\n# below, and following the instructions in the 'Option parsing'\n# section further down.\n\n## -------------- ##\n## Configuration. ##\n## -------------- ##\n\n# You should override these variables in your script after sourcing this\n# file so that they reflect the customisations you have added to the\n# option parser.\n\n# The usage line for option parsing errors and the start of '-h' and\n# '--help' output messages. You can embed shell variables for delayed\n# expansion at the time the message is displayed, but you will need to\n# quote other shell meta-characters carefully to prevent them being\n# expanded when the contents are evaled.\nusage='$progpath [OPTION]...'\n\n# Short help message in response to '-h' and '--help'.  Add to this or\n# override it after sourcing this library to reflect the full set of\n# options your script accepts.\nusage_message=\"\\\n       --debug        enable verbose shell tracing\n   -W, --warnings=CATEGORY\n                      report the warnings falling in CATEGORY [all]\n   -v, --verbose      verbosely report processing\n       --version      print version information and exit\n   -h, --help         print short or long help message and exit\n\"\n\n# Additional text appended to 'usage_message' in response to '--help'.\nlong_help_message=\"\nWarning categories include:\n       'all'          show all warnings\n       'none'         turn off all the warnings\n       'error'        warnings are treated as fatal errors\"\n\n# Help message printed before fatal option parsing errors.\nfatal_help=\"Try '\\$progname --help' for more information.\"\n\n\n\n## ------------------------- ##\n## Hook function management. ##\n## ------------------------- ##\n\n# This section contains functions for adding, removing, and running hooks\n# to the main code.  A hook is just a named list of of function, that can\n# be run in order later on.\n\n# func_hookable FUNC_NAME\n# -----------------------\n# Declare that FUNC_NAME will run hooks added with\n# 'func_add_hook FUNC_NAME ...'.\nfunc_hookable ()\n{\n    $debug_cmd\n\n    func_append hookable_fns \" $1\"\n}\n\n\n# func_add_hook FUNC_NAME HOOK_FUNC\n# ---------------------------------\n# Request that FUNC_NAME call HOOK_FUNC before it returns.  FUNC_NAME must\n# first have been declared \"hookable\" by a call to 'func_hookable'.\nfunc_add_hook ()\n{\n    $debug_cmd\n\n    case \" $hookable_fns \" in\n      *\" $1 \"*) ;;\n      *) func_fatal_error \"'$1' does not accept hook functions.\" ;;\n    esac\n\n    eval func_append ${1}_hooks '\" $2\"'\n}\n\n\n# func_remove_hook FUNC_NAME HOOK_FUNC\n# ------------------------------------\n# Remove HOOK_FUNC from the list of functions called by FUNC_NAME.\nfunc_remove_hook ()\n{\n    $debug_cmd\n\n    eval ${1}_hooks='`$ECHO \"\\$'$1'_hooks\" |$SED \"s| '$2'||\"`'\n}\n\n\n# func_run_hooks FUNC_NAME [ARG]...\n# ---------------------------------\n# Run all hook functions registered to FUNC_NAME.\n# It is assumed that the list of hook functions contains nothing more\n# than a whitespace-delimited list of legal shell function names, and\n# no effort is wasted trying to catch shell meta-characters or preserve\n# whitespace.\nfunc_run_hooks ()\n{\n    $debug_cmd\n\n    case \" $hookable_fns \" in\n      *\" $1 \"*) ;;\n      *) func_fatal_error \"'$1' does not support hook funcions.n\" ;;\n    esac\n\n    eval _G_hook_fns=\\$$1_hooks; shift\n\n    for _G_hook in $_G_hook_fns; do\n      eval $_G_hook '\"$@\"'\n\n      # store returned options list back into positional\n      # parameters for next 'cmd' execution.\n      eval _G_hook_result=\\$${_G_hook}_result\n      eval set dummy \"$_G_hook_result\"; shift\n    done\n\n    func_quote_for_eval ${1+\"$@\"}\n    func_run_hooks_result=$func_quote_for_eval_result\n}\n\n\n\n## --------------- ##\n## Option parsing. ##\n## --------------- ##\n\n# In order to add your own option parsing hooks, you must accept the\n# full positional parameter list in your hook function, remove any\n# options that you action, and then pass back the remaining unprocessed\n# options in '<hooked_function_name>_result', escaped suitably for\n# 'eval'.  Like this:\n#\n#    my_options_prep ()\n#    {\n#        $debug_cmd\n#\n#        # Extend the existing usage message.\n#        usage_message=$usage_message'\n#      -s, --silent       don'\\''t print informational messages\n#    '\n#\n#        func_quote_for_eval ${1+\"$@\"}\n#        my_options_prep_result=$func_quote_for_eval_result\n#    }\n#    func_add_hook func_options_prep my_options_prep\n#\n#\n#    my_silent_option ()\n#    {\n#        $debug_cmd\n#\n#        # Note that for efficiency, we parse as many options as we can\n#        # recognise in a loop before passing the remainder back to the\n#        # caller on the first unrecognised argument we encounter.\n#        while test $# -gt 0; do\n#          opt=$1; shift\n#          case $opt in\n#            --silent|-s) opt_silent=: ;;\n#            # Separate non-argument short options:\n#            -s*)         func_split_short_opt \"$_G_opt\"\n#                         set dummy \"$func_split_short_opt_name\" \\\n#                             \"-$func_split_short_opt_arg\" ${1+\"$@\"}\n#                         shift\n#                         ;;\n#            *)            set dummy \"$_G_opt\" \"$*\"; shift; break ;;\n#          esac\n#        done\n#\n#        func_quote_for_eval ${1+\"$@\"}\n#        my_silent_option_result=$func_quote_for_eval_result\n#    }\n#    func_add_hook func_parse_options my_silent_option\n#\n#\n#    my_option_validation ()\n#    {\n#        $debug_cmd\n#\n#        $opt_silent && $opt_verbose && func_fatal_help \"\\\n#    '--silent' and '--verbose' options are mutually exclusive.\"\n#\n#        func_quote_for_eval ${1+\"$@\"}\n#        my_option_validation_result=$func_quote_for_eval_result\n#    }\n#    func_add_hook func_validate_options my_option_validation\n#\n# You'll alse need to manually amend $usage_message to reflect the extra\n# options you parse.  It's preferable to append if you can, so that\n# multiple option parsing hooks can be added safely.\n\n\n# func_options [ARG]...\n# ---------------------\n# All the functions called inside func_options are hookable. See the\n# individual implementations for details.\nfunc_hookable func_options\nfunc_options ()\n{\n    $debug_cmd\n\n    func_options_prep ${1+\"$@\"}\n    eval func_parse_options \\\n        ${func_options_prep_result+\"$func_options_prep_result\"}\n    eval func_validate_options \\\n        ${func_parse_options_result+\"$func_parse_options_result\"}\n\n    eval func_run_hooks func_options \\\n        ${func_validate_options_result+\"$func_validate_options_result\"}\n\n    # save modified positional parameters for caller\n    func_options_result=$func_run_hooks_result\n}\n\n\n# func_options_prep [ARG]...\n# --------------------------\n# All initialisations required before starting the option parse loop.\n# Note that when calling hook functions, we pass through the list of\n# positional parameters.  If a hook function modifies that list, and\n# needs to propogate that back to rest of this script, then the complete\n# modified list must be put in 'func_run_hooks_result' before\n# returning.\nfunc_hookable func_options_prep\nfunc_options_prep ()\n{\n    $debug_cmd\n\n    # Option defaults:\n    opt_verbose=false\n    opt_warning_types=\n\n    func_run_hooks func_options_prep ${1+\"$@\"}\n\n    # save modified positional parameters for caller\n    func_options_prep_result=$func_run_hooks_result\n}\n\n\n# func_parse_options [ARG]...\n# ---------------------------\n# The main option parsing loop.\nfunc_hookable func_parse_options\nfunc_parse_options ()\n{\n    $debug_cmd\n\n    func_parse_options_result=\n\n    # this just eases exit handling\n    while test $# -gt 0; do\n      # Defer to hook functions for initial option parsing, so they\n      # get priority in the event of reusing an option name.\n      func_run_hooks func_parse_options ${1+\"$@\"}\n\n      # Adjust func_parse_options positional parameters to match\n      eval set dummy \"$func_run_hooks_result\"; shift\n\n      # Break out of the loop if we already parsed every option.\n      test $# -gt 0 || break\n\n      _G_opt=$1\n      shift\n      case $_G_opt in\n        --debug|-x)   debug_cmd='set -x'\n                      func_echo \"enabling shell trace mode\"\n                      $debug_cmd\n                      ;;\n\n        --no-warnings|--no-warning|--no-warn)\n                      set dummy --warnings none ${1+\"$@\"}\n                      shift\n\t\t      ;;\n\n        --warnings|--warning|-W)\n                      test $# = 0 && func_missing_arg $_G_opt && break\n                      case \" $warning_categories $1\" in\n                        *\" $1 \"*)\n                          # trailing space prevents matching last $1 above\n                          func_append_uniq opt_warning_types \" $1\"\n                          ;;\n                        *all)\n                          opt_warning_types=$warning_categories\n                          ;;\n                        *none)\n                          opt_warning_types=none\n                          warning_func=:\n                          ;;\n                        *error)\n                          opt_warning_types=$warning_categories\n                          warning_func=func_fatal_error\n                          ;;\n                        *)\n                          func_fatal_error \\\n                             \"unsupported warning category: '$1'\"\n                          ;;\n                      esac\n                      shift\n                      ;;\n\n        --verbose|-v) opt_verbose=: ;;\n        --version)    func_version ;;\n        -\\?|-h)       func_usage ;;\n        --help)       func_help ;;\n\n\t# Separate optargs to long options (plugins may need this):\n\t--*=*)        func_split_equals \"$_G_opt\"\n\t              set dummy \"$func_split_equals_lhs\" \\\n                          \"$func_split_equals_rhs\" ${1+\"$@\"}\n                      shift\n                      ;;\n\n       # Separate optargs to short options:\n        -W*)\n                      func_split_short_opt \"$_G_opt\"\n                      set dummy \"$func_split_short_opt_name\" \\\n                          \"$func_split_short_opt_arg\" ${1+\"$@\"}\n                      shift\n                      ;;\n\n        # Separate non-argument short options:\n        -\\?*|-h*|-v*|-x*)\n                      func_split_short_opt \"$_G_opt\"\n                      set dummy \"$func_split_short_opt_name\" \\\n                          \"-$func_split_short_opt_arg\" ${1+\"$@\"}\n                      shift\n                      ;;\n\n        --)           break ;;\n        -*)           func_fatal_help \"unrecognised option: '$_G_opt'\" ;;\n        *)            set dummy \"$_G_opt\" ${1+\"$@\"}; shift; break ;;\n      esac\n    done\n\n    # save modified positional parameters for caller\n    func_quote_for_eval ${1+\"$@\"}\n    func_parse_options_result=$func_quote_for_eval_result\n}\n\n\n# func_validate_options [ARG]...\n# ------------------------------\n# Perform any sanity checks on option settings and/or unconsumed\n# arguments.\nfunc_hookable func_validate_options\nfunc_validate_options ()\n{\n    $debug_cmd\n\n    # Display all warnings if -W was not given.\n    test -n \"$opt_warning_types\" || opt_warning_types=\" $warning_categories\"\n\n    func_run_hooks func_validate_options ${1+\"$@\"}\n\n    # Bail if the options were screwed!\n    $exit_cmd $EXIT_FAILURE\n\n    # save modified positional parameters for caller\n    func_validate_options_result=$func_run_hooks_result\n}\n\n\n\n## ----------------- ##\n## Helper functions. ##\n## ----------------- ##\n\n# This section contains the helper functions used by the rest of the\n# hookable option parser framework in ascii-betical order.\n\n\n# func_fatal_help ARG...\n# ----------------------\n# Echo program name prefixed message to standard error, followed by\n# a help hint, and exit.\nfunc_fatal_help ()\n{\n    $debug_cmd\n\n    eval \\$ECHO \\\"\"Usage: $usage\"\\\"\n    eval \\$ECHO \\\"\"$fatal_help\"\\\"\n    func_error ${1+\"$@\"}\n    exit $EXIT_FAILURE\n}\n\n\n# func_help\n# ---------\n# Echo long help message to standard output and exit.\nfunc_help ()\n{\n    $debug_cmd\n\n    func_usage_message\n    $ECHO \"$long_help_message\"\n    exit 0\n}\n\n\n# func_missing_arg ARGNAME\n# ------------------------\n# Echo program name prefixed message to standard error and set global\n# exit_cmd.\nfunc_missing_arg ()\n{\n    $debug_cmd\n\n    func_error \"Missing argument for '$1'.\"\n    exit_cmd=exit\n}\n\n\n# func_split_equals STRING\n# ------------------------\n# Set func_split_equals_lhs and func_split_equals_rhs shell variables after\n# splitting STRING at the '=' sign.\ntest -z \"$_G_HAVE_XSI_OPS\" \\\n    && (eval 'x=a/b/c;\n      test 5aa/bb/cc = \"${#x}${x%%/*}${x%/*}${x#*/}${x##*/}\"') 2>/dev/null \\\n    && _G_HAVE_XSI_OPS=yes\n\nif test yes = \"$_G_HAVE_XSI_OPS\"\nthen\n  # This is an XSI compatible shell, allowing a faster implementation...\n  eval 'func_split_equals ()\n  {\n      $debug_cmd\n\n      func_split_equals_lhs=${1%%=*}\n      func_split_equals_rhs=${1#*=}\n      test \"x$func_split_equals_lhs\" = \"x$1\" \\\n        && func_split_equals_rhs=\n  }'\nelse\n  # ...otherwise fall back to using expr, which is often a shell builtin.\n  func_split_equals ()\n  {\n      $debug_cmd\n\n      func_split_equals_lhs=`expr \"x$1\" : 'x\\([^=]*\\)'`\n      func_split_equals_rhs=\n      test \"x$func_split_equals_lhs\" = \"x$1\" \\\n        || func_split_equals_rhs=`expr \"x$1\" : 'x[^=]*=\\(.*\\)$'`\n  }\nfi #func_split_equals\n\n\n# func_split_short_opt SHORTOPT\n# -----------------------------\n# Set func_split_short_opt_name and func_split_short_opt_arg shell\n# variables after splitting SHORTOPT after the 2nd character.\nif test yes = \"$_G_HAVE_XSI_OPS\"\nthen\n  # This is an XSI compatible shell, allowing a faster implementation...\n  eval 'func_split_short_opt ()\n  {\n      $debug_cmd\n\n      func_split_short_opt_arg=${1#??}\n      func_split_short_opt_name=${1%\"$func_split_short_opt_arg\"}\n  }'\nelse\n  # ...otherwise fall back to using expr, which is often a shell builtin.\n  func_split_short_opt ()\n  {\n      $debug_cmd\n\n      func_split_short_opt_name=`expr \"x$1\" : 'x-\\(.\\)'`\n      func_split_short_opt_arg=`expr \"x$1\" : 'x-.\\(.*\\)$'`\n  }\nfi #func_split_short_opt\n\n\n# func_usage\n# ----------\n# Echo short help message to standard output and exit.\nfunc_usage ()\n{\n    $debug_cmd\n\n    func_usage_message\n    $ECHO \"Run '$progname --help |${PAGER-more}' for full usage\"\n    exit 0\n}\n\n\n# func_usage_message\n# ------------------\n# Echo short help message to standard output.\nfunc_usage_message ()\n{\n    $debug_cmd\n\n    eval \\$ECHO \\\"\"Usage: $usage\"\\\"\n    echo\n    $SED -n 's|^# ||\n        /^Written by/{\n          x;p;x\n        }\n\th\n\t/^Written by/q' < \"$progpath\"\n    echo\n    eval \\$ECHO \\\"\"$usage_message\"\\\"\n}\n\n\n# func_version\n# ------------\n# Echo version message to standard output and exit.\nfunc_version ()\n{\n    $debug_cmd\n\n    printf '%s\\n' \"$progname $scriptversion\"\n    $SED -n '\n        /(C)/!b go\n        :more\n        /\\./!{\n          N\n          s|\\n# | |\n          b more\n        }\n        :go\n        /^# Written by /,/# warranty; / {\n          s|^# ||\n          s|^# *$||\n          s|\\((C)\\)[ 0-9,-]*[ ,-]\\([1-9][0-9]* \\)|\\1 \\2|\n          p\n        }\n        /^# Written by / {\n          s|^# ||\n          p\n        }\n        /^warranty; /q' < \"$progpath\"\n\n    exit $?\n}\n\n\n# Local variables:\n# mode: shell-script\n# sh-indentation: 2\n# eval: (add-hook 'before-save-hook 'time-stamp)\n# time-stamp-pattern: \"10/scriptversion=%:y-%02m-%02d.%02H; # UTC\"\n# time-stamp-time-zone: \"UTC\"\n# End:\n\n# Set a version string.\nscriptversion='(GNU libtool) 2.4.6'\n\n\n# func_echo ARG...\n# ----------------\n# Libtool also displays the current mode in messages, so override\n# funclib.sh func_echo with this custom definition.\nfunc_echo ()\n{\n    $debug_cmd\n\n    _G_message=$*\n\n    func_echo_IFS=$IFS\n    IFS=$nl\n    for _G_line in $_G_message; do\n      IFS=$func_echo_IFS\n      $ECHO \"$progname${opt_mode+: $opt_mode}: $_G_line\"\n    done\n    IFS=$func_echo_IFS\n}\n\n\n# func_warning ARG...\n# -------------------\n# Libtool warnings are not categorized, so override funclib.sh\n# func_warning with this simpler definition.\nfunc_warning ()\n{\n    $debug_cmd\n\n    $warning_func ${1+\"$@\"}\n}\n\n\n## ---------------- ##\n## Options parsing. ##\n## ---------------- ##\n\n# Hook in the functions to make sure our own options are parsed during\n# the option parsing loop.\n\nusage='$progpath [OPTION]... [MODE-ARG]...'\n\n# Short help message in response to '-h'.\nusage_message=\"Options:\n       --config             show all configuration variables\n       --debug              enable verbose shell tracing\n   -n, --dry-run            display commands without modifying any files\n       --features           display basic configuration information and exit\n       --mode=MODE          use operation mode MODE\n       --no-warnings        equivalent to '-Wnone'\n       --preserve-dup-deps  don't remove duplicate dependency libraries\n       --quiet, --silent    don't print informational messages\n       --tag=TAG            use configuration variables from tag TAG\n   -v, --verbose            print more informational messages than default\n       --version            print version information\n   -W, --warnings=CATEGORY  report the warnings falling in CATEGORY [all]\n   -h, --help, --help-all   print short, long, or detailed help message\n\"\n\n# Additional text appended to 'usage_message' in response to '--help'.\nfunc_help ()\n{\n    $debug_cmd\n\n    func_usage_message\n    $ECHO \"$long_help_message\n\nMODE must be one of the following:\n\n       clean           remove files from the build directory\n       compile         compile a source file into a libtool object\n       execute         automatically set library path, then run a program\n       finish          complete the installation of libtool libraries\n       install         install libraries or executables\n       link            create a library or an executable\n       uninstall       remove libraries from an installed directory\n\nMODE-ARGS vary depending on the MODE.  When passed as first option,\n'--mode=MODE' may be abbreviated as 'MODE' or a unique abbreviation of that.\nTry '$progname --help --mode=MODE' for a more detailed description of MODE.\n\nWhen reporting a bug, please describe a test case to reproduce it and\ninclude the following information:\n\n       host-triplet:   $host\n       shell:          $SHELL\n       compiler:       $LTCC\n       compiler flags: $LTCFLAGS\n       linker:         $LD (gnu? $with_gnu_ld)\n       version:        $progname $scriptversion Debian-2.4.6-2\n       automake:       `($AUTOMAKE --version) 2>/dev/null |$SED 1q`\n       autoconf:       `($AUTOCONF --version) 2>/dev/null |$SED 1q`\n\nReport bugs to <bug-libtool@gnu.org>.\nGNU libtool home page: <http://www.gnu.org/s/libtool/>.\nGeneral help using GNU software: <http://www.gnu.org/gethelp/>.\"\n    exit 0\n}\n\n\n# func_lo2o OBJECT-NAME\n# ---------------------\n# Transform OBJECT-NAME from a '.lo' suffix to the platform specific\n# object suffix.\n\nlo2o=s/\\\\.lo\\$/.$objext/\no2lo=s/\\\\.$objext\\$/.lo/\n\nif test yes = \"$_G_HAVE_XSI_OPS\"; then\n  eval 'func_lo2o ()\n  {\n    case $1 in\n      *.lo) func_lo2o_result=${1%.lo}.$objext ;;\n      *   ) func_lo2o_result=$1               ;;\n    esac\n  }'\n\n  # func_xform LIBOBJ-OR-SOURCE\n  # ---------------------------\n  # Transform LIBOBJ-OR-SOURCE from a '.o' or '.c' (or otherwise)\n  # suffix to a '.lo' libtool-object suffix.\n  eval 'func_xform ()\n  {\n    func_xform_result=${1%.*}.lo\n  }'\nelse\n  # ...otherwise fall back to using sed.\n  func_lo2o ()\n  {\n    func_lo2o_result=`$ECHO \"$1\" | $SED \"$lo2o\"`\n  }\n\n  func_xform ()\n  {\n    func_xform_result=`$ECHO \"$1\" | $SED 's|\\.[^.]*$|.lo|'`\n  }\nfi\n\n\n# func_fatal_configuration ARG...\n# -------------------------------\n# Echo program name prefixed message to standard error, followed by\n# a configuration failure hint, and exit.\nfunc_fatal_configuration ()\n{\n    func__fatal_error ${1+\"$@\"} \\\n      \"See the $PACKAGE documentation for more information.\" \\\n      \"Fatal configuration error.\"\n}\n\n\n# func_config\n# -----------\n# Display the configuration for all the tags in this script.\nfunc_config ()\n{\n    re_begincf='^# ### BEGIN LIBTOOL'\n    re_endcf='^# ### END LIBTOOL'\n\n    # Default configuration.\n    $SED \"1,/$re_begincf CONFIG/d;/$re_endcf CONFIG/,\\$d\" < \"$progpath\"\n\n    # Now print the configurations for the tags.\n    for tagname in $taglist; do\n      $SED -n \"/$re_begincf TAG CONFIG: $tagname\\$/,/$re_endcf TAG CONFIG: $tagname\\$/p\" < \"$progpath\"\n    done\n\n    exit $?\n}\n\n\n# func_features\n# -------------\n# Display the features supported by this script.\nfunc_features ()\n{\n    echo \"host: $host\"\n    if test yes = \"$build_libtool_libs\"; then\n      echo \"enable shared libraries\"\n    else\n      echo \"disable shared libraries\"\n    fi\n    if test yes = \"$build_old_libs\"; then\n      echo \"enable static libraries\"\n    else\n      echo \"disable static libraries\"\n    fi\n\n    exit $?\n}\n\n\n# func_enable_tag TAGNAME\n# -----------------------\n# Verify that TAGNAME is valid, and either flag an error and exit, or\n# enable the TAGNAME tag.  We also add TAGNAME to the global $taglist\n# variable here.\nfunc_enable_tag ()\n{\n    # Global variable:\n    tagname=$1\n\n    re_begincf=\"^# ### BEGIN LIBTOOL TAG CONFIG: $tagname\\$\"\n    re_endcf=\"^# ### END LIBTOOL TAG CONFIG: $tagname\\$\"\n    sed_extractcf=/$re_begincf/,/$re_endcf/p\n\n    # Validate tagname.\n    case $tagname in\n      *[!-_A-Za-z0-9,/]*)\n        func_fatal_error \"invalid tag name: $tagname\"\n        ;;\n    esac\n\n    # Don't test for the \"default\" C tag, as we know it's\n    # there but not specially marked.\n    case $tagname in\n        CC) ;;\n    *)\n        if $GREP \"$re_begincf\" \"$progpath\" >/dev/null 2>&1; then\n\t  taglist=\"$taglist $tagname\"\n\n\t  # Evaluate the configuration.  Be careful to quote the path\n\t  # and the sed script, to avoid splitting on whitespace, but\n\t  # also don't use non-portable quotes within backquotes within\n\t  # quotes we have to do it in 2 steps:\n\t  extractedcf=`$SED -n -e \"$sed_extractcf\" < \"$progpath\"`\n\t  eval \"$extractedcf\"\n        else\n\t  func_error \"ignoring unknown tag $tagname\"\n        fi\n        ;;\n    esac\n}\n\n\n# func_check_version_match\n# ------------------------\n# Ensure that we are using m4 macros, and libtool script from the same\n# release of libtool.\nfunc_check_version_match ()\n{\n    if test \"$package_revision\" != \"$macro_revision\"; then\n      if test \"$VERSION\" != \"$macro_version\"; then\n        if test -z \"$macro_version\"; then\n          cat >&2 <<_LT_EOF\n$progname: Version mismatch error.  This is $PACKAGE $VERSION, but the\n$progname: definition of this LT_INIT comes from an older release.\n$progname: You should recreate aclocal.m4 with macros from $PACKAGE $VERSION\n$progname: and run autoconf again.\n_LT_EOF\n        else\n          cat >&2 <<_LT_EOF\n$progname: Version mismatch error.  This is $PACKAGE $VERSION, but the\n$progname: definition of this LT_INIT comes from $PACKAGE $macro_version.\n$progname: You should recreate aclocal.m4 with macros from $PACKAGE $VERSION\n$progname: and run autoconf again.\n_LT_EOF\n        fi\n      else\n        cat >&2 <<_LT_EOF\n$progname: Version mismatch error.  This is $PACKAGE $VERSION, revision $package_revision,\n$progname: but the definition of this LT_INIT comes from revision $macro_revision.\n$progname: You should recreate aclocal.m4 with macros from revision $package_revision\n$progname: of $PACKAGE $VERSION and run autoconf again.\n_LT_EOF\n      fi\n\n      exit $EXIT_MISMATCH\n    fi\n}\n\n\n# libtool_options_prep [ARG]...\n# -----------------------------\n# Preparation for options parsed by libtool.\nlibtool_options_prep ()\n{\n    $debug_mode\n\n    # Option defaults:\n    opt_config=false\n    opt_dlopen=\n    opt_dry_run=false\n    opt_help=false\n    opt_mode=\n    opt_preserve_dup_deps=false\n    opt_quiet=false\n\n    nonopt=\n    preserve_args=\n\n    # Shorthand for --mode=foo, only valid as the first argument\n    case $1 in\n    clean|clea|cle|cl)\n      shift; set dummy --mode clean ${1+\"$@\"}; shift\n      ;;\n    compile|compil|compi|comp|com|co|c)\n      shift; set dummy --mode compile ${1+\"$@\"}; shift\n      ;;\n    execute|execut|execu|exec|exe|ex|e)\n      shift; set dummy --mode execute ${1+\"$@\"}; shift\n      ;;\n    finish|finis|fini|fin|fi|f)\n      shift; set dummy --mode finish ${1+\"$@\"}; shift\n      ;;\n    install|instal|insta|inst|ins|in|i)\n      shift; set dummy --mode install ${1+\"$@\"}; shift\n      ;;\n    link|lin|li|l)\n      shift; set dummy --mode link ${1+\"$@\"}; shift\n      ;;\n    uninstall|uninstal|uninsta|uninst|unins|unin|uni|un|u)\n      shift; set dummy --mode uninstall ${1+\"$@\"}; shift\n      ;;\n    esac\n\n    # Pass back the list of options.\n    func_quote_for_eval ${1+\"$@\"}\n    libtool_options_prep_result=$func_quote_for_eval_result\n}\nfunc_add_hook func_options_prep libtool_options_prep\n\n\n# libtool_parse_options [ARG]...\n# ---------------------------------\n# Provide handling for libtool specific options.\nlibtool_parse_options ()\n{\n    $debug_cmd\n\n    # Perform our own loop to consume as many options as possible in\n    # each iteration.\n    while test $# -gt 0; do\n      _G_opt=$1\n      shift\n      case $_G_opt in\n        --dry-run|--dryrun|-n)\n                        opt_dry_run=:\n                        ;;\n\n        --config)       func_config ;;\n\n        --dlopen|-dlopen)\n                        opt_dlopen=\"${opt_dlopen+$opt_dlopen\n}$1\"\n                        shift\n                        ;;\n\n        --preserve-dup-deps)\n                        opt_preserve_dup_deps=: ;;\n\n        --features)     func_features ;;\n\n        --finish)       set dummy --mode finish ${1+\"$@\"}; shift ;;\n\n        --help)         opt_help=: ;;\n\n        --help-all)     opt_help=': help-all' ;;\n\n        --mode)         test $# = 0 && func_missing_arg $_G_opt && break\n                        opt_mode=$1\n                        case $1 in\n                          # Valid mode arguments:\n                          clean|compile|execute|finish|install|link|relink|uninstall) ;;\n\n                          # Catch anything else as an error\n                          *) func_error \"invalid argument for $_G_opt\"\n                             exit_cmd=exit\n                             break\n                             ;;\n                        esac\n                        shift\n                        ;;\n\n        --no-silent|--no-quiet)\n                        opt_quiet=false\n                        func_append preserve_args \" $_G_opt\"\n                        ;;\n\n        --no-warnings|--no-warning|--no-warn)\n                        opt_warning=false\n                        func_append preserve_args \" $_G_opt\"\n                        ;;\n\n        --no-verbose)\n                        opt_verbose=false\n                        func_append preserve_args \" $_G_opt\"\n                        ;;\n\n        --silent|--quiet)\n                        opt_quiet=:\n                        opt_verbose=false\n                        func_append preserve_args \" $_G_opt\"\n                        ;;\n\n        --tag)          test $# = 0 && func_missing_arg $_G_opt && break\n                        opt_tag=$1\n                        func_append preserve_args \" $_G_opt $1\"\n                        func_enable_tag \"$1\"\n                        shift\n                        ;;\n\n        --verbose|-v)   opt_quiet=false\n                        opt_verbose=:\n                        func_append preserve_args \" $_G_opt\"\n                        ;;\n\n\t# An option not handled by this hook function:\n        *)\t\tset dummy \"$_G_opt\" ${1+\"$@\"};\tshift; break  ;;\n      esac\n    done\n\n\n    # save modified positional parameters for caller\n    func_quote_for_eval ${1+\"$@\"}\n    libtool_parse_options_result=$func_quote_for_eval_result\n}\nfunc_add_hook func_parse_options libtool_parse_options\n\n\n\n# libtool_validate_options [ARG]...\n# ---------------------------------\n# Perform any sanity checks on option settings and/or unconsumed\n# arguments.\nlibtool_validate_options ()\n{\n    # save first non-option argument\n    if test 0 -lt $#; then\n      nonopt=$1\n      shift\n    fi\n\n    # preserve --debug\n    test : = \"$debug_cmd\" || func_append preserve_args \" --debug\"\n\n    case $host in\n      # Solaris2 added to fix http://debbugs.gnu.org/cgi/bugreport.cgi?bug=16452\n      # see also: http://gcc.gnu.org/bugzilla/show_bug.cgi?id=59788\n      *cygwin* | *mingw* | *pw32* | *cegcc* | *solaris2* | *os2*)\n        # don't eliminate duplications in $postdeps and $predeps\n        opt_duplicate_compiler_generated_deps=:\n        ;;\n      *)\n        opt_duplicate_compiler_generated_deps=$opt_preserve_dup_deps\n        ;;\n    esac\n\n    $opt_help || {\n      # Sanity checks first:\n      func_check_version_match\n\n      test yes != \"$build_libtool_libs\" \\\n        && test yes != \"$build_old_libs\" \\\n        && func_fatal_configuration \"not configured to build any kind of library\"\n\n      # Darwin sucks\n      eval std_shrext=\\\"$shrext_cmds\\\"\n\n      # Only execute mode is allowed to have -dlopen flags.\n      if test -n \"$opt_dlopen\" && test execute != \"$opt_mode\"; then\n        func_error \"unrecognized option '-dlopen'\"\n        $ECHO \"$help\" 1>&2\n        exit $EXIT_FAILURE\n      fi\n\n      # Change the help message to a mode-specific one.\n      generic_help=$help\n      help=\"Try '$progname --help --mode=$opt_mode' for more information.\"\n    }\n\n    # Pass back the unparsed argument list\n    func_quote_for_eval ${1+\"$@\"}\n    libtool_validate_options_result=$func_quote_for_eval_result\n}\nfunc_add_hook func_validate_options libtool_validate_options\n\n\n# Process options as early as possible so that --help and --version\n# can return quickly.\nfunc_options ${1+\"$@\"}\neval set dummy \"$func_options_result\"; shift\n\n\n\n## ----------- ##\n##    Main.    ##\n## ----------- ##\n\nmagic='%%%MAGIC variable%%%'\nmagic_exe='%%%MAGIC EXE variable%%%'\n\n# Global variables.\nextracted_archives=\nextracted_serial=0\n\n# If this variable is set in any of the actions, the command in it\n# will be execed at the end.  This prevents here-documents from being\n# left over by shells.\nexec_cmd=\n\n\n# A function that is used when there is no print builtin or printf.\nfunc_fallback_echo ()\n{\n  eval 'cat <<_LTECHO_EOF\n$1\n_LTECHO_EOF'\n}\n\n# func_generated_by_libtool\n# True iff stdin has been generated by Libtool. This function is only\n# a basic sanity check; it will hardly flush out determined imposters.\nfunc_generated_by_libtool_p ()\n{\n  $GREP \"^# Generated by .*$PACKAGE\" > /dev/null 2>&1\n}\n\n# func_lalib_p file\n# True iff FILE is a libtool '.la' library or '.lo' object file.\n# This function is only a basic sanity check; it will hardly flush out\n# determined imposters.\nfunc_lalib_p ()\n{\n    test -f \"$1\" &&\n      $SED -e 4q \"$1\" 2>/dev/null | func_generated_by_libtool_p\n}\n\n# func_lalib_unsafe_p file\n# True iff FILE is a libtool '.la' library or '.lo' object file.\n# This function implements the same check as func_lalib_p without\n# resorting to external programs.  To this end, it redirects stdin and\n# closes it afterwards, without saving the original file descriptor.\n# As a safety measure, use it only where a negative result would be\n# fatal anyway.  Works if 'file' does not exist.\nfunc_lalib_unsafe_p ()\n{\n    lalib_p=no\n    if test -f \"$1\" && test -r \"$1\" && exec 5<&0 <\"$1\"; then\n\tfor lalib_p_l in 1 2 3 4\n\tdo\n\t    read lalib_p_line\n\t    case $lalib_p_line in\n\t\t\\#\\ Generated\\ by\\ *$PACKAGE* ) lalib_p=yes; break;;\n\t    esac\n\tdone\n\texec 0<&5 5<&-\n    fi\n    test yes = \"$lalib_p\"\n}\n\n# func_ltwrapper_script_p file\n# True iff FILE is a libtool wrapper script\n# This function is only a basic sanity check; it will hardly flush out\n# determined imposters.\nfunc_ltwrapper_script_p ()\n{\n    test -f \"$1\" &&\n      $lt_truncate_bin < \"$1\" 2>/dev/null | func_generated_by_libtool_p\n}\n\n# func_ltwrapper_executable_p file\n# True iff FILE is a libtool wrapper executable\n# This function is only a basic sanity check; it will hardly flush out\n# determined imposters.\nfunc_ltwrapper_executable_p ()\n{\n    func_ltwrapper_exec_suffix=\n    case $1 in\n    *.exe) ;;\n    *) func_ltwrapper_exec_suffix=.exe ;;\n    esac\n    $GREP \"$magic_exe\" \"$1$func_ltwrapper_exec_suffix\" >/dev/null 2>&1\n}\n\n# func_ltwrapper_scriptname file\n# Assumes file is an ltwrapper_executable\n# uses $file to determine the appropriate filename for a\n# temporary ltwrapper_script.\nfunc_ltwrapper_scriptname ()\n{\n    func_dirname_and_basename \"$1\" \"\" \".\"\n    func_stripname '' '.exe' \"$func_basename_result\"\n    func_ltwrapper_scriptname_result=$func_dirname_result/$objdir/${func_stripname_result}_ltshwrapper\n}\n\n# func_ltwrapper_p file\n# True iff FILE is a libtool wrapper script or wrapper executable\n# This function is only a basic sanity check; it will hardly flush out\n# determined imposters.\nfunc_ltwrapper_p ()\n{\n    func_ltwrapper_script_p \"$1\" || func_ltwrapper_executable_p \"$1\"\n}\n\n\n# func_execute_cmds commands fail_cmd\n# Execute tilde-delimited COMMANDS.\n# If FAIL_CMD is given, eval that upon failure.\n# FAIL_CMD may read-access the current command in variable CMD!\nfunc_execute_cmds ()\n{\n    $debug_cmd\n\n    save_ifs=$IFS; IFS='~'\n    for cmd in $1; do\n      IFS=$sp$nl\n      eval cmd=\\\"$cmd\\\"\n      IFS=$save_ifs\n      func_show_eval \"$cmd\" \"${2-:}\"\n    done\n    IFS=$save_ifs\n}\n\n\n# func_source file\n# Source FILE, adding directory component if necessary.\n# Note that it is not necessary on cygwin/mingw to append a dot to\n# FILE even if both FILE and FILE.exe exist: automatic-append-.exe\n# behavior happens only for exec(3), not for open(2)!  Also, sourcing\n# 'FILE.' does not work on cygwin managed mounts.\nfunc_source ()\n{\n    $debug_cmd\n\n    case $1 in\n    */* | *\\\\*)\t. \"$1\" ;;\n    *)\t\t. \"./$1\" ;;\n    esac\n}\n\n\n# func_resolve_sysroot PATH\n# Replace a leading = in PATH with a sysroot.  Store the result into\n# func_resolve_sysroot_result\nfunc_resolve_sysroot ()\n{\n  func_resolve_sysroot_result=$1\n  case $func_resolve_sysroot_result in\n  =*)\n    func_stripname '=' '' \"$func_resolve_sysroot_result\"\n    func_resolve_sysroot_result=$lt_sysroot$func_stripname_result\n    ;;\n  esac\n}\n\n# func_replace_sysroot PATH\n# If PATH begins with the sysroot, replace it with = and\n# store the result into func_replace_sysroot_result.\nfunc_replace_sysroot ()\n{\n  case $lt_sysroot:$1 in\n  ?*:\"$lt_sysroot\"*)\n    func_stripname \"$lt_sysroot\" '' \"$1\"\n    func_replace_sysroot_result='='$func_stripname_result\n    ;;\n  *)\n    # Including no sysroot.\n    func_replace_sysroot_result=$1\n    ;;\n  esac\n}\n\n# func_infer_tag arg\n# Infer tagged configuration to use if any are available and\n# if one wasn't chosen via the \"--tag\" command line option.\n# Only attempt this if the compiler in the base compile\n# command doesn't match the default compiler.\n# arg is usually of the form 'gcc ...'\nfunc_infer_tag ()\n{\n    $debug_cmd\n\n    if test -n \"$available_tags\" && test -z \"$tagname\"; then\n      CC_quoted=\n      for arg in $CC; do\n\tfunc_append_quoted CC_quoted \"$arg\"\n      done\n      CC_expanded=`func_echo_all $CC`\n      CC_quoted_expanded=`func_echo_all $CC_quoted`\n      case $@ in\n      # Blanks in the command may have been stripped by the calling shell,\n      # but not from the CC environment variable when configure was run.\n      \" $CC \"* | \"$CC \"* | \" $CC_expanded \"* | \"$CC_expanded \"* | \\\n      \" $CC_quoted\"* | \"$CC_quoted \"* | \" $CC_quoted_expanded \"* | \"$CC_quoted_expanded \"*) ;;\n      # Blanks at the start of $base_compile will cause this to fail\n      # if we don't check for them as well.\n      *)\n\tfor z in $available_tags; do\n\t  if $GREP \"^# ### BEGIN LIBTOOL TAG CONFIG: $z$\" < \"$progpath\" > /dev/null; then\n\t    # Evaluate the configuration.\n\t    eval \"`$SED -n -e '/^# ### BEGIN LIBTOOL TAG CONFIG: '$z'$/,/^# ### END LIBTOOL TAG CONFIG: '$z'$/p' < $progpath`\"\n\t    CC_quoted=\n\t    for arg in $CC; do\n\t      # Double-quote args containing other shell metacharacters.\n\t      func_append_quoted CC_quoted \"$arg\"\n\t    done\n\t    CC_expanded=`func_echo_all $CC`\n\t    CC_quoted_expanded=`func_echo_all $CC_quoted`\n\t    case \"$@ \" in\n\t    \" $CC \"* | \"$CC \"* | \" $CC_expanded \"* | \"$CC_expanded \"* | \\\n\t    \" $CC_quoted\"* | \"$CC_quoted \"* | \" $CC_quoted_expanded \"* | \"$CC_quoted_expanded \"*)\n\t      # The compiler in the base compile command matches\n\t      # the one in the tagged configuration.\n\t      # Assume this is the tagged configuration we want.\n\t      tagname=$z\n\t      break\n\t      ;;\n\t    esac\n\t  fi\n\tdone\n\t# If $tagname still isn't set, then no tagged configuration\n\t# was found and let the user know that the \"--tag\" command\n\t# line option must be used.\n\tif test -z \"$tagname\"; then\n\t  func_echo \"unable to infer tagged configuration\"\n\t  func_fatal_error \"specify a tag with '--tag'\"\n#\telse\n#\t  func_verbose \"using $tagname tagged configuration\"\n\tfi\n\t;;\n      esac\n    fi\n}\n\n\n\n# func_write_libtool_object output_name pic_name nonpic_name\n# Create a libtool object file (analogous to a \".la\" file),\n# but don't create it if we're doing a dry run.\nfunc_write_libtool_object ()\n{\n    write_libobj=$1\n    if test yes = \"$build_libtool_libs\"; then\n      write_lobj=\\'$2\\'\n    else\n      write_lobj=none\n    fi\n\n    if test yes = \"$build_old_libs\"; then\n      write_oldobj=\\'$3\\'\n    else\n      write_oldobj=none\n    fi\n\n    $opt_dry_run || {\n      cat >${write_libobj}T <<EOF\n# $write_libobj - a libtool object file\n# Generated by $PROGRAM (GNU $PACKAGE) $VERSION\n#\n# Please DO NOT delete this file!\n# It is necessary for linking the library.\n\n# Name of the PIC object.\npic_object=$write_lobj\n\n# Name of the non-PIC object\nnon_pic_object=$write_oldobj\n\nEOF\n      $MV \"${write_libobj}T\" \"$write_libobj\"\n    }\n}\n\n\n##################################################\n# FILE NAME AND PATH CONVERSION HELPER FUNCTIONS #\n##################################################\n\n# func_convert_core_file_wine_to_w32 ARG\n# Helper function used by file name conversion functions when $build is *nix,\n# and $host is mingw, cygwin, or some other w32 environment. Relies on a\n# correctly configured wine environment available, with the winepath program\n# in $build's $PATH.\n#\n# ARG is the $build file name to be converted to w32 format.\n# Result is available in $func_convert_core_file_wine_to_w32_result, and will\n# be empty on error (or when ARG is empty)\nfunc_convert_core_file_wine_to_w32 ()\n{\n  $debug_cmd\n\n  func_convert_core_file_wine_to_w32_result=$1\n  if test -n \"$1\"; then\n    # Unfortunately, winepath does not exit with a non-zero error code, so we\n    # are forced to check the contents of stdout. On the other hand, if the\n    # command is not found, the shell will set an exit code of 127 and print\n    # *an error message* to stdout. So we must check for both error code of\n    # zero AND non-empty stdout, which explains the odd construction:\n    func_convert_core_file_wine_to_w32_tmp=`winepath -w \"$1\" 2>/dev/null`\n    if test \"$?\" -eq 0 && test -n \"$func_convert_core_file_wine_to_w32_tmp\"; then\n      func_convert_core_file_wine_to_w32_result=`$ECHO \"$func_convert_core_file_wine_to_w32_tmp\" |\n        $SED -e \"$sed_naive_backslashify\"`\n    else\n      func_convert_core_file_wine_to_w32_result=\n    fi\n  fi\n}\n# end: func_convert_core_file_wine_to_w32\n\n\n# func_convert_core_path_wine_to_w32 ARG\n# Helper function used by path conversion functions when $build is *nix, and\n# $host is mingw, cygwin, or some other w32 environment. Relies on a correctly\n# configured wine environment available, with the winepath program in $build's\n# $PATH. Assumes ARG has no leading or trailing path separator characters.\n#\n# ARG is path to be converted from $build format to win32.\n# Result is available in $func_convert_core_path_wine_to_w32_result.\n# Unconvertible file (directory) names in ARG are skipped; if no directory names\n# are convertible, then the result may be empty.\nfunc_convert_core_path_wine_to_w32 ()\n{\n  $debug_cmd\n\n  # unfortunately, winepath doesn't convert paths, only file names\n  func_convert_core_path_wine_to_w32_result=\n  if test -n \"$1\"; then\n    oldIFS=$IFS\n    IFS=:\n    for func_convert_core_path_wine_to_w32_f in $1; do\n      IFS=$oldIFS\n      func_convert_core_file_wine_to_w32 \"$func_convert_core_path_wine_to_w32_f\"\n      if test -n \"$func_convert_core_file_wine_to_w32_result\"; then\n        if test -z \"$func_convert_core_path_wine_to_w32_result\"; then\n          func_convert_core_path_wine_to_w32_result=$func_convert_core_file_wine_to_w32_result\n        else\n          func_append func_convert_core_path_wine_to_w32_result \";$func_convert_core_file_wine_to_w32_result\"\n        fi\n      fi\n    done\n    IFS=$oldIFS\n  fi\n}\n# end: func_convert_core_path_wine_to_w32\n\n\n# func_cygpath ARGS...\n# Wrapper around calling the cygpath program via LT_CYGPATH. This is used when\n# when (1) $build is *nix and Cygwin is hosted via a wine environment; or (2)\n# $build is MSYS and $host is Cygwin, or (3) $build is Cygwin. In case (1) or\n# (2), returns the Cygwin file name or path in func_cygpath_result (input\n# file name or path is assumed to be in w32 format, as previously converted\n# from $build's *nix or MSYS format). In case (3), returns the w32 file name\n# or path in func_cygpath_result (input file name or path is assumed to be in\n# Cygwin format). Returns an empty string on error.\n#\n# ARGS are passed to cygpath, with the last one being the file name or path to\n# be converted.\n#\n# Specify the absolute *nix (or w32) name to cygpath in the LT_CYGPATH\n# environment variable; do not put it in $PATH.\nfunc_cygpath ()\n{\n  $debug_cmd\n\n  if test -n \"$LT_CYGPATH\" && test -f \"$LT_CYGPATH\"; then\n    func_cygpath_result=`$LT_CYGPATH \"$@\" 2>/dev/null`\n    if test \"$?\" -ne 0; then\n      # on failure, ensure result is empty\n      func_cygpath_result=\n    fi\n  else\n    func_cygpath_result=\n    func_error \"LT_CYGPATH is empty or specifies non-existent file: '$LT_CYGPATH'\"\n  fi\n}\n#end: func_cygpath\n\n\n# func_convert_core_msys_to_w32 ARG\n# Convert file name or path ARG from MSYS format to w32 format.  Return\n# result in func_convert_core_msys_to_w32_result.\nfunc_convert_core_msys_to_w32 ()\n{\n  $debug_cmd\n\n  # awkward: cmd appends spaces to result\n  func_convert_core_msys_to_w32_result=`( cmd //c echo \"$1\" ) 2>/dev/null |\n    $SED -e 's/[ ]*$//' -e \"$sed_naive_backslashify\"`\n}\n#end: func_convert_core_msys_to_w32\n\n\n# func_convert_file_check ARG1 ARG2\n# Verify that ARG1 (a file name in $build format) was converted to $host\n# format in ARG2. Otherwise, emit an error message, but continue (resetting\n# func_to_host_file_result to ARG1).\nfunc_convert_file_check ()\n{\n  $debug_cmd\n\n  if test -z \"$2\" && test -n \"$1\"; then\n    func_error \"Could not determine host file name corresponding to\"\n    func_error \"  '$1'\"\n    func_error \"Continuing, but uninstalled executables may not work.\"\n    # Fallback:\n    func_to_host_file_result=$1\n  fi\n}\n# end func_convert_file_check\n\n\n# func_convert_path_check FROM_PATHSEP TO_PATHSEP FROM_PATH TO_PATH\n# Verify that FROM_PATH (a path in $build format) was converted to $host\n# format in TO_PATH. Otherwise, emit an error message, but continue, resetting\n# func_to_host_file_result to a simplistic fallback value (see below).\nfunc_convert_path_check ()\n{\n  $debug_cmd\n\n  if test -z \"$4\" && test -n \"$3\"; then\n    func_error \"Could not determine the host path corresponding to\"\n    func_error \"  '$3'\"\n    func_error \"Continuing, but uninstalled executables may not work.\"\n    # Fallback.  This is a deliberately simplistic \"conversion\" and\n    # should not be \"improved\".  See libtool.info.\n    if test \"x$1\" != \"x$2\"; then\n      lt_replace_pathsep_chars=\"s|$1|$2|g\"\n      func_to_host_path_result=`echo \"$3\" |\n        $SED -e \"$lt_replace_pathsep_chars\"`\n    else\n      func_to_host_path_result=$3\n    fi\n  fi\n}\n# end func_convert_path_check\n\n\n# func_convert_path_front_back_pathsep FRONTPAT BACKPAT REPL ORIG\n# Modifies func_to_host_path_result by prepending REPL if ORIG matches FRONTPAT\n# and appending REPL if ORIG matches BACKPAT.\nfunc_convert_path_front_back_pathsep ()\n{\n  $debug_cmd\n\n  case $4 in\n  $1 ) func_to_host_path_result=$3$func_to_host_path_result\n    ;;\n  esac\n  case $4 in\n  $2 ) func_append func_to_host_path_result \"$3\"\n    ;;\n  esac\n}\n# end func_convert_path_front_back_pathsep\n\n\n##################################################\n# $build to $host FILE NAME CONVERSION FUNCTIONS #\n##################################################\n# invoked via '$to_host_file_cmd ARG'\n#\n# In each case, ARG is the path to be converted from $build to $host format.\n# Result will be available in $func_to_host_file_result.\n\n\n# func_to_host_file ARG\n# Converts the file name ARG from $build format to $host format. Return result\n# in func_to_host_file_result.\nfunc_to_host_file ()\n{\n  $debug_cmd\n\n  $to_host_file_cmd \"$1\"\n}\n# end func_to_host_file\n\n\n# func_to_tool_file ARG LAZY\n# converts the file name ARG from $build format to toolchain format. Return\n# result in func_to_tool_file_result.  If the conversion in use is listed\n# in (the comma separated) LAZY, no conversion takes place.\nfunc_to_tool_file ()\n{\n  $debug_cmd\n\n  case ,$2, in\n    *,\"$to_tool_file_cmd\",*)\n      func_to_tool_file_result=$1\n      ;;\n    *)\n      $to_tool_file_cmd \"$1\"\n      func_to_tool_file_result=$func_to_host_file_result\n      ;;\n  esac\n}\n# end func_to_tool_file\n\n\n# func_convert_file_noop ARG\n# Copy ARG to func_to_host_file_result.\nfunc_convert_file_noop ()\n{\n  func_to_host_file_result=$1\n}\n# end func_convert_file_noop\n\n\n# func_convert_file_msys_to_w32 ARG\n# Convert file name ARG from (mingw) MSYS to (mingw) w32 format; automatic\n# conversion to w32 is not available inside the cwrapper.  Returns result in\n# func_to_host_file_result.\nfunc_convert_file_msys_to_w32 ()\n{\n  $debug_cmd\n\n  func_to_host_file_result=$1\n  if test -n \"$1\"; then\n    func_convert_core_msys_to_w32 \"$1\"\n    func_to_host_file_result=$func_convert_core_msys_to_w32_result\n  fi\n  func_convert_file_check \"$1\" \"$func_to_host_file_result\"\n}\n# end func_convert_file_msys_to_w32\n\n\n# func_convert_file_cygwin_to_w32 ARG\n# Convert file name ARG from Cygwin to w32 format.  Returns result in\n# func_to_host_file_result.\nfunc_convert_file_cygwin_to_w32 ()\n{\n  $debug_cmd\n\n  func_to_host_file_result=$1\n  if test -n \"$1\"; then\n    # because $build is cygwin, we call \"the\" cygpath in $PATH; no need to use\n    # LT_CYGPATH in this case.\n    func_to_host_file_result=`cygpath -m \"$1\"`\n  fi\n  func_convert_file_check \"$1\" \"$func_to_host_file_result\"\n}\n# end func_convert_file_cygwin_to_w32\n\n\n# func_convert_file_nix_to_w32 ARG\n# Convert file name ARG from *nix to w32 format.  Requires a wine environment\n# and a working winepath. Returns result in func_to_host_file_result.\nfunc_convert_file_nix_to_w32 ()\n{\n  $debug_cmd\n\n  func_to_host_file_result=$1\n  if test -n \"$1\"; then\n    func_convert_core_file_wine_to_w32 \"$1\"\n    func_to_host_file_result=$func_convert_core_file_wine_to_w32_result\n  fi\n  func_convert_file_check \"$1\" \"$func_to_host_file_result\"\n}\n# end func_convert_file_nix_to_w32\n\n\n# func_convert_file_msys_to_cygwin ARG\n# Convert file name ARG from MSYS to Cygwin format.  Requires LT_CYGPATH set.\n# Returns result in func_to_host_file_result.\nfunc_convert_file_msys_to_cygwin ()\n{\n  $debug_cmd\n\n  func_to_host_file_result=$1\n  if test -n \"$1\"; then\n    func_convert_core_msys_to_w32 \"$1\"\n    func_cygpath -u \"$func_convert_core_msys_to_w32_result\"\n    func_to_host_file_result=$func_cygpath_result\n  fi\n  func_convert_file_check \"$1\" \"$func_to_host_file_result\"\n}\n# end func_convert_file_msys_to_cygwin\n\n\n# func_convert_file_nix_to_cygwin ARG\n# Convert file name ARG from *nix to Cygwin format.  Requires Cygwin installed\n# in a wine environment, working winepath, and LT_CYGPATH set.  Returns result\n# in func_to_host_file_result.\nfunc_convert_file_nix_to_cygwin ()\n{\n  $debug_cmd\n\n  func_to_host_file_result=$1\n  if test -n \"$1\"; then\n    # convert from *nix to w32, then use cygpath to convert from w32 to cygwin.\n    func_convert_core_file_wine_to_w32 \"$1\"\n    func_cygpath -u \"$func_convert_core_file_wine_to_w32_result\"\n    func_to_host_file_result=$func_cygpath_result\n  fi\n  func_convert_file_check \"$1\" \"$func_to_host_file_result\"\n}\n# end func_convert_file_nix_to_cygwin\n\n\n#############################################\n# $build to $host PATH CONVERSION FUNCTIONS #\n#############################################\n# invoked via '$to_host_path_cmd ARG'\n#\n# In each case, ARG is the path to be converted from $build to $host format.\n# The result will be available in $func_to_host_path_result.\n#\n# Path separators are also converted from $build format to $host format.  If\n# ARG begins or ends with a path separator character, it is preserved (but\n# converted to $host format) on output.\n#\n# All path conversion functions are named using the following convention:\n#   file name conversion function    : func_convert_file_X_to_Y ()\n#   path conversion function         : func_convert_path_X_to_Y ()\n# where, for any given $build/$host combination the 'X_to_Y' value is the\n# same.  If conversion functions are added for new $build/$host combinations,\n# the two new functions must follow this pattern, or func_init_to_host_path_cmd\n# will break.\n\n\n# func_init_to_host_path_cmd\n# Ensures that function \"pointer\" variable $to_host_path_cmd is set to the\n# appropriate value, based on the value of $to_host_file_cmd.\nto_host_path_cmd=\nfunc_init_to_host_path_cmd ()\n{\n  $debug_cmd\n\n  if test -z \"$to_host_path_cmd\"; then\n    func_stripname 'func_convert_file_' '' \"$to_host_file_cmd\"\n    to_host_path_cmd=func_convert_path_$func_stripname_result\n  fi\n}\n\n\n# func_to_host_path ARG\n# Converts the path ARG from $build format to $host format. Return result\n# in func_to_host_path_result.\nfunc_to_host_path ()\n{\n  $debug_cmd\n\n  func_init_to_host_path_cmd\n  $to_host_path_cmd \"$1\"\n}\n# end func_to_host_path\n\n\n# func_convert_path_noop ARG\n# Copy ARG to func_to_host_path_result.\nfunc_convert_path_noop ()\n{\n  func_to_host_path_result=$1\n}\n# end func_convert_path_noop\n\n\n# func_convert_path_msys_to_w32 ARG\n# Convert path ARG from (mingw) MSYS to (mingw) w32 format; automatic\n# conversion to w32 is not available inside the cwrapper.  Returns result in\n# func_to_host_path_result.\nfunc_convert_path_msys_to_w32 ()\n{\n  $debug_cmd\n\n  func_to_host_path_result=$1\n  if test -n \"$1\"; then\n    # Remove leading and trailing path separator characters from ARG.  MSYS\n    # behavior is inconsistent here; cygpath turns them into '.;' and ';.';\n    # and winepath ignores them completely.\n    func_stripname : : \"$1\"\n    func_to_host_path_tmp1=$func_stripname_result\n    func_convert_core_msys_to_w32 \"$func_to_host_path_tmp1\"\n    func_to_host_path_result=$func_convert_core_msys_to_w32_result\n    func_convert_path_check : \";\" \\\n      \"$func_to_host_path_tmp1\" \"$func_to_host_path_result\"\n    func_convert_path_front_back_pathsep \":*\" \"*:\" \";\" \"$1\"\n  fi\n}\n# end func_convert_path_msys_to_w32\n\n\n# func_convert_path_cygwin_to_w32 ARG\n# Convert path ARG from Cygwin to w32 format.  Returns result in\n# func_to_host_file_result.\nfunc_convert_path_cygwin_to_w32 ()\n{\n  $debug_cmd\n\n  func_to_host_path_result=$1\n  if test -n \"$1\"; then\n    # See func_convert_path_msys_to_w32:\n    func_stripname : : \"$1\"\n    func_to_host_path_tmp1=$func_stripname_result\n    func_to_host_path_result=`cygpath -m -p \"$func_to_host_path_tmp1\"`\n    func_convert_path_check : \";\" \\\n      \"$func_to_host_path_tmp1\" \"$func_to_host_path_result\"\n    func_convert_path_front_back_pathsep \":*\" \"*:\" \";\" \"$1\"\n  fi\n}\n# end func_convert_path_cygwin_to_w32\n\n\n# func_convert_path_nix_to_w32 ARG\n# Convert path ARG from *nix to w32 format.  Requires a wine environment and\n# a working winepath.  Returns result in func_to_host_file_result.\nfunc_convert_path_nix_to_w32 ()\n{\n  $debug_cmd\n\n  func_to_host_path_result=$1\n  if test -n \"$1\"; then\n    # See func_convert_path_msys_to_w32:\n    func_stripname : : \"$1\"\n    func_to_host_path_tmp1=$func_stripname_result\n    func_convert_core_path_wine_to_w32 \"$func_to_host_path_tmp1\"\n    func_to_host_path_result=$func_convert_core_path_wine_to_w32_result\n    func_convert_path_check : \";\" \\\n      \"$func_to_host_path_tmp1\" \"$func_to_host_path_result\"\n    func_convert_path_front_back_pathsep \":*\" \"*:\" \";\" \"$1\"\n  fi\n}\n# end func_convert_path_nix_to_w32\n\n\n# func_convert_path_msys_to_cygwin ARG\n# Convert path ARG from MSYS to Cygwin format.  Requires LT_CYGPATH set.\n# Returns result in func_to_host_file_result.\nfunc_convert_path_msys_to_cygwin ()\n{\n  $debug_cmd\n\n  func_to_host_path_result=$1\n  if test -n \"$1\"; then\n    # See func_convert_path_msys_to_w32:\n    func_stripname : : \"$1\"\n    func_to_host_path_tmp1=$func_stripname_result\n    func_convert_core_msys_to_w32 \"$func_to_host_path_tmp1\"\n    func_cygpath -u -p \"$func_convert_core_msys_to_w32_result\"\n    func_to_host_path_result=$func_cygpath_result\n    func_convert_path_check : : \\\n      \"$func_to_host_path_tmp1\" \"$func_to_host_path_result\"\n    func_convert_path_front_back_pathsep \":*\" \"*:\" : \"$1\"\n  fi\n}\n# end func_convert_path_msys_to_cygwin\n\n\n# func_convert_path_nix_to_cygwin ARG\n# Convert path ARG from *nix to Cygwin format.  Requires Cygwin installed in a\n# a wine environment, working winepath, and LT_CYGPATH set.  Returns result in\n# func_to_host_file_result.\nfunc_convert_path_nix_to_cygwin ()\n{\n  $debug_cmd\n\n  func_to_host_path_result=$1\n  if test -n \"$1\"; then\n    # Remove leading and trailing path separator characters from\n    # ARG. msys behavior is inconsistent here, cygpath turns them\n    # into '.;' and ';.', and winepath ignores them completely.\n    func_stripname : : \"$1\"\n    func_to_host_path_tmp1=$func_stripname_result\n    func_convert_core_path_wine_to_w32 \"$func_to_host_path_tmp1\"\n    func_cygpath -u -p \"$func_convert_core_path_wine_to_w32_result\"\n    func_to_host_path_result=$func_cygpath_result\n    func_convert_path_check : : \\\n      \"$func_to_host_path_tmp1\" \"$func_to_host_path_result\"\n    func_convert_path_front_back_pathsep \":*\" \"*:\" : \"$1\"\n  fi\n}\n# end func_convert_path_nix_to_cygwin\n\n\n# func_dll_def_p FILE\n# True iff FILE is a Windows DLL '.def' file.\n# Keep in sync with _LT_DLL_DEF_P in libtool.m4\nfunc_dll_def_p ()\n{\n  $debug_cmd\n\n  func_dll_def_p_tmp=`$SED -n \\\n    -e 's/^[\t ]*//' \\\n    -e '/^\\(;.*\\)*$/d' \\\n    -e 's/^\\(EXPORTS\\|LIBRARY\\)\\([\t ].*\\)*$/DEF/p' \\\n    -e q \\\n    \"$1\"`\n  test DEF = \"$func_dll_def_p_tmp\"\n}\n\n\n# func_mode_compile arg...\nfunc_mode_compile ()\n{\n    $debug_cmd\n\n    # Get the compilation command and the source file.\n    base_compile=\n    srcfile=$nonopt  #  always keep a non-empty value in \"srcfile\"\n    suppress_opt=yes\n    suppress_output=\n    arg_mode=normal\n    libobj=\n    later=\n    pie_flag=\n\n    for arg\n    do\n      case $arg_mode in\n      arg  )\n\t# do not \"continue\".  Instead, add this to base_compile\n\tlastarg=$arg\n\targ_mode=normal\n\t;;\n\n      target )\n\tlibobj=$arg\n\targ_mode=normal\n\tcontinue\n\t;;\n\n      normal )\n\t# Accept any command-line options.\n\tcase $arg in\n\t-o)\n\t  test -n \"$libobj\" && \\\n\t    func_fatal_error \"you cannot specify '-o' more than once\"\n\t  arg_mode=target\n\t  continue\n\t  ;;\n\n\t-pie | -fpie | -fPIE)\n          func_append pie_flag \" $arg\"\n\t  continue\n\t  ;;\n\n\t-shared | -static | -prefer-pic | -prefer-non-pic)\n\t  func_append later \" $arg\"\n\t  continue\n\t  ;;\n\n\t-no-suppress)\n\t  suppress_opt=no\n\t  continue\n\t  ;;\n\n\t-Xcompiler)\n\t  arg_mode=arg  #  the next one goes into the \"base_compile\" arg list\n\t  continue      #  The current \"srcfile\" will either be retained or\n\t  ;;            #  replaced later.  I would guess that would be a bug.\n\n\t-Wc,*)\n\t  func_stripname '-Wc,' '' \"$arg\"\n\t  args=$func_stripname_result\n\t  lastarg=\n\t  save_ifs=$IFS; IFS=,\n\t  for arg in $args; do\n\t    IFS=$save_ifs\n\t    func_append_quoted lastarg \"$arg\"\n\t  done\n\t  IFS=$save_ifs\n\t  func_stripname ' ' '' \"$lastarg\"\n\t  lastarg=$func_stripname_result\n\n\t  # Add the arguments to base_compile.\n\t  func_append base_compile \" $lastarg\"\n\t  continue\n\t  ;;\n\n\t*)\n\t  # Accept the current argument as the source file.\n\t  # The previous \"srcfile\" becomes the current argument.\n\t  #\n\t  lastarg=$srcfile\n\t  srcfile=$arg\n\t  ;;\n\tesac  #  case $arg\n\t;;\n      esac    #  case $arg_mode\n\n      # Aesthetically quote the previous argument.\n      func_append_quoted base_compile \"$lastarg\"\n    done # for arg\n\n    case $arg_mode in\n    arg)\n      func_fatal_error \"you must specify an argument for -Xcompile\"\n      ;;\n    target)\n      func_fatal_error \"you must specify a target with '-o'\"\n      ;;\n    *)\n      # Get the name of the library object.\n      test -z \"$libobj\" && {\n\tfunc_basename \"$srcfile\"\n\tlibobj=$func_basename_result\n      }\n      ;;\n    esac\n\n    # Recognize several different file suffixes.\n    # If the user specifies -o file.o, it is replaced with file.lo\n    case $libobj in\n    *.[cCFSifmso] | \\\n    *.ada | *.adb | *.ads | *.asm | \\\n    *.c++ | *.cc | *.ii | *.class | *.cpp | *.cxx | \\\n    *.[fF][09]? | *.for | *.java | *.go | *.obj | *.sx | *.cu | *.cup)\n      func_xform \"$libobj\"\n      libobj=$func_xform_result\n      ;;\n    esac\n\n    case $libobj in\n    *.lo) func_lo2o \"$libobj\"; obj=$func_lo2o_result ;;\n    *)\n      func_fatal_error \"cannot determine name of library object from '$libobj'\"\n      ;;\n    esac\n\n    func_infer_tag $base_compile\n\n    for arg in $later; do\n      case $arg in\n      -shared)\n\ttest yes = \"$build_libtool_libs\" \\\n\t  || func_fatal_configuration \"cannot build a shared library\"\n\tbuild_old_libs=no\n\tcontinue\n\t;;\n\n      -static)\n\tbuild_libtool_libs=no\n\tbuild_old_libs=yes\n\tcontinue\n\t;;\n\n      -prefer-pic)\n\tpic_mode=yes\n\tcontinue\n\t;;\n\n      -prefer-non-pic)\n\tpic_mode=no\n\tcontinue\n\t;;\n      esac\n    done\n\n    func_quote_for_eval \"$libobj\"\n    test \"X$libobj\" != \"X$func_quote_for_eval_result\" \\\n      && $ECHO \"X$libobj\" | $GREP '[]~#^*{};<>?\"'\"'\"'\t &()|`$[]' \\\n      && func_warning \"libobj name '$libobj' may not contain shell special characters.\"\n    func_dirname_and_basename \"$obj\" \"/\" \"\"\n    objname=$func_basename_result\n    xdir=$func_dirname_result\n    lobj=$xdir$objdir/$objname\n\n    test -z \"$base_compile\" && \\\n      func_fatal_help \"you must specify a compilation command\"\n\n    # Delete any leftover library objects.\n    if test yes = \"$build_old_libs\"; then\n      removelist=\"$obj $lobj $libobj ${libobj}T\"\n    else\n      removelist=\"$lobj $libobj ${libobj}T\"\n    fi\n\n    # On Cygwin there's no \"real\" PIC flag so we must build both object types\n    case $host_os in\n    cygwin* | mingw* | pw32* | os2* | cegcc*)\n      pic_mode=default\n      ;;\n    esac\n    if test no = \"$pic_mode\" && test pass_all != \"$deplibs_check_method\"; then\n      # non-PIC code in shared libraries is not supported\n      pic_mode=default\n    fi\n\n    # Calculate the filename of the output object if compiler does\n    # not support -o with -c\n    if test no = \"$compiler_c_o\"; then\n      output_obj=`$ECHO \"$srcfile\" | $SED 's%^.*/%%; s%\\.[^.]*$%%'`.$objext\n      lockfile=$output_obj.lock\n    else\n      output_obj=\n      need_locks=no\n      lockfile=\n    fi\n\n    # Lock this critical section if it is needed\n    # We use this script file to make the link, it avoids creating a new file\n    if test yes = \"$need_locks\"; then\n      until $opt_dry_run || ln \"$progpath\" \"$lockfile\" 2>/dev/null; do\n\tfunc_echo \"Waiting for $lockfile to be removed\"\n\tsleep 2\n      done\n    elif test warn = \"$need_locks\"; then\n      if test -f \"$lockfile\"; then\n\t$ECHO \"\\\n*** ERROR, $lockfile exists and contains:\n`cat $lockfile 2>/dev/null`\n\nThis indicates that another process is trying to use the same\ntemporary object file, and libtool could not work around it because\nyour compiler does not support '-c' and '-o' together.  If you\nrepeat this compilation, it may succeed, by chance, but you had better\navoid parallel builds (make -j) in this platform, or get a better\ncompiler.\"\n\n\t$opt_dry_run || $RM $removelist\n\texit $EXIT_FAILURE\n      fi\n      func_append removelist \" $output_obj\"\n      $ECHO \"$srcfile\" > \"$lockfile\"\n    fi\n\n    $opt_dry_run || $RM $removelist\n    func_append removelist \" $lockfile\"\n    trap '$opt_dry_run || $RM $removelist; exit $EXIT_FAILURE' 1 2 15\n\n    func_to_tool_file \"$srcfile\" func_convert_file_msys_to_w32\n    srcfile=$func_to_tool_file_result\n    func_quote_for_eval \"$srcfile\"\n    qsrcfile=$func_quote_for_eval_result\n\n    # Only build a PIC object if we are building libtool libraries.\n    if test yes = \"$build_libtool_libs\"; then\n      # Without this assignment, base_compile gets emptied.\n      fbsd_hideous_sh_bug=$base_compile\n\n      if test no != \"$pic_mode\"; then\n\tcommand=\"$base_compile $qsrcfile $pic_flag\"\n      else\n\t# Don't build PIC code\n\tcommand=\"$base_compile $qsrcfile\"\n      fi\n\n      func_mkdir_p \"$xdir$objdir\"\n\n      if test -z \"$output_obj\"; then\n\t# Place PIC objects in $objdir\n\tfunc_append command \" -o $lobj\"\n      fi\n\n      func_show_eval_locale \"$command\"\t\\\n          'test -n \"$output_obj\" && $RM $removelist; exit $EXIT_FAILURE'\n\n      if test warn = \"$need_locks\" &&\n\t test \"X`cat $lockfile 2>/dev/null`\" != \"X$srcfile\"; then\n\t$ECHO \"\\\n*** ERROR, $lockfile contains:\n`cat $lockfile 2>/dev/null`\n\nbut it should contain:\n$srcfile\n\nThis indicates that another process is trying to use the same\ntemporary object file, and libtool could not work around it because\nyour compiler does not support '-c' and '-o' together.  If you\nrepeat this compilation, it may succeed, by chance, but you had better\navoid parallel builds (make -j) in this platform, or get a better\ncompiler.\"\n\n\t$opt_dry_run || $RM $removelist\n\texit $EXIT_FAILURE\n      fi\n\n      # Just move the object if needed, then go on to compile the next one\n      if test -n \"$output_obj\" && test \"X$output_obj\" != \"X$lobj\"; then\n\tfunc_show_eval '$MV \"$output_obj\" \"$lobj\"' \\\n\t  'error=$?; $opt_dry_run || $RM $removelist; exit $error'\n      fi\n\n      # Allow error messages only from the first compilation.\n      if test yes = \"$suppress_opt\"; then\n\tsuppress_output=' >/dev/null 2>&1'\n      fi\n    fi\n\n    # Only build a position-dependent object if we build old libraries.\n    if test yes = \"$build_old_libs\"; then\n      if test yes != \"$pic_mode\"; then\n\t# Don't build PIC code\n\tcommand=\"$base_compile $qsrcfile$pie_flag\"\n      else\n\tcommand=\"$base_compile $qsrcfile $pic_flag\"\n      fi\n      if test yes = \"$compiler_c_o\"; then\n\tfunc_append command \" -o $obj\"\n      fi\n\n      # Suppress compiler output if we already did a PIC compilation.\n      func_append command \"$suppress_output\"\n      func_show_eval_locale \"$command\" \\\n        '$opt_dry_run || $RM $removelist; exit $EXIT_FAILURE'\n\n      if test warn = \"$need_locks\" &&\n\t test \"X`cat $lockfile 2>/dev/null`\" != \"X$srcfile\"; then\n\t$ECHO \"\\\n*** ERROR, $lockfile contains:\n`cat $lockfile 2>/dev/null`\n\nbut it should contain:\n$srcfile\n\nThis indicates that another process is trying to use the same\ntemporary object file, and libtool could not work around it because\nyour compiler does not support '-c' and '-o' together.  If you\nrepeat this compilation, it may succeed, by chance, but you had better\navoid parallel builds (make -j) in this platform, or get a better\ncompiler.\"\n\n\t$opt_dry_run || $RM $removelist\n\texit $EXIT_FAILURE\n      fi\n\n      # Just move the object if needed\n      if test -n \"$output_obj\" && test \"X$output_obj\" != \"X$obj\"; then\n\tfunc_show_eval '$MV \"$output_obj\" \"$obj\"' \\\n\t  'error=$?; $opt_dry_run || $RM $removelist; exit $error'\n      fi\n    fi\n\n    $opt_dry_run || {\n      func_write_libtool_object \"$libobj\" \"$objdir/$objname\" \"$objname\"\n\n      # Unlock the critical section if it was locked\n      if test no != \"$need_locks\"; then\n\tremovelist=$lockfile\n        $RM \"$lockfile\"\n      fi\n    }\n\n    exit $EXIT_SUCCESS\n}\n\n$opt_help || {\n  test compile = \"$opt_mode\" && func_mode_compile ${1+\"$@\"}\n}\n\nfunc_mode_help ()\n{\n    # We need to display help for each of the modes.\n    case $opt_mode in\n      \"\")\n        # Generic help is extracted from the usage comments\n        # at the start of this file.\n        func_help\n        ;;\n\n      clean)\n        $ECHO \\\n\"Usage: $progname [OPTION]... --mode=clean RM [RM-OPTION]... FILE...\n\nRemove files from the build directory.\n\nRM is the name of the program to use to delete files associated with each FILE\n(typically '/bin/rm').  RM-OPTIONS are options (such as '-f') to be passed\nto RM.\n\nIf FILE is a libtool library, object or program, all the files associated\nwith it are deleted. Otherwise, only FILE itself is deleted using RM.\"\n        ;;\n\n      compile)\n      $ECHO \\\n\"Usage: $progname [OPTION]... --mode=compile COMPILE-COMMAND... SOURCEFILE\n\nCompile a source file into a libtool library object.\n\nThis mode accepts the following additional options:\n\n  -o OUTPUT-FILE    set the output file name to OUTPUT-FILE\n  -no-suppress      do not suppress compiler output for multiple passes\n  -prefer-pic       try to build PIC objects only\n  -prefer-non-pic   try to build non-PIC objects only\n  -shared           do not build a '.o' file suitable for static linking\n  -static           only build a '.o' file suitable for static linking\n  -Wc,FLAG          pass FLAG directly to the compiler\n\nCOMPILE-COMMAND is a command to be used in creating a 'standard' object file\nfrom the given SOURCEFILE.\n\nThe output file name is determined by removing the directory component from\nSOURCEFILE, then substituting the C source code suffix '.c' with the\nlibrary object suffix, '.lo'.\"\n        ;;\n\n      execute)\n        $ECHO \\\n\"Usage: $progname [OPTION]... --mode=execute COMMAND [ARGS]...\n\nAutomatically set library path, then run a program.\n\nThis mode accepts the following additional options:\n\n  -dlopen FILE      add the directory containing FILE to the library path\n\nThis mode sets the library path environment variable according to '-dlopen'\nflags.\n\nIf any of the ARGS are libtool executable wrappers, then they are translated\ninto their corresponding uninstalled binary, and any of their required library\ndirectories are added to the library path.\n\nThen, COMMAND is executed, with ARGS as arguments.\"\n        ;;\n\n      finish)\n        $ECHO \\\n\"Usage: $progname [OPTION]... --mode=finish [LIBDIR]...\n\nComplete the installation of libtool libraries.\n\nEach LIBDIR is a directory that contains libtool libraries.\n\nThe commands that this mode executes may require superuser privileges.  Use\nthe '--dry-run' option if you just want to see what would be executed.\"\n        ;;\n\n      install)\n        $ECHO \\\n\"Usage: $progname [OPTION]... --mode=install INSTALL-COMMAND...\n\nInstall executables or libraries.\n\nINSTALL-COMMAND is the installation command.  The first component should be\neither the 'install' or 'cp' program.\n\nThe following components of INSTALL-COMMAND are treated specially:\n\n  -inst-prefix-dir PREFIX-DIR  Use PREFIX-DIR as a staging area for installation\n\nThe rest of the components are interpreted as arguments to that command (only\nBSD-compatible install options are recognized).\"\n        ;;\n\n      link)\n        $ECHO \\\n\"Usage: $progname [OPTION]... --mode=link LINK-COMMAND...\n\nLink object files or libraries together to form another library, or to\ncreate an executable program.\n\nLINK-COMMAND is a command using the C compiler that you would use to create\na program from several object files.\n\nThe following components of LINK-COMMAND are treated specially:\n\n  -all-static       do not do any dynamic linking at all\n  -avoid-version    do not add a version suffix if possible\n  -bindir BINDIR    specify path to binaries directory (for systems where\n                    libraries must be found in the PATH setting at runtime)\n  -dlopen FILE      '-dlpreopen' FILE if it cannot be dlopened at runtime\n  -dlpreopen FILE   link in FILE and add its symbols to lt_preloaded_symbols\n  -export-dynamic   allow symbols from OUTPUT-FILE to be resolved with dlsym(3)\n  -export-symbols SYMFILE\n                    try to export only the symbols listed in SYMFILE\n  -export-symbols-regex REGEX\n                    try to export only the symbols matching REGEX\n  -LLIBDIR          search LIBDIR for required installed libraries\n  -lNAME            OUTPUT-FILE requires the installed library libNAME\n  -module           build a library that can dlopened\n  -no-fast-install  disable the fast-install mode\n  -no-install       link a not-installable executable\n  -no-undefined     declare that a library does not refer to external symbols\n  -o OUTPUT-FILE    create OUTPUT-FILE from the specified objects\n  -objectlist FILE  use a list of object files found in FILE to specify objects\n  -os2dllname NAME  force a short DLL name on OS/2 (no effect on other OSes)\n  -precious-files-regex REGEX\n                    don't remove output files matching REGEX\n  -release RELEASE  specify package release information\n  -rpath LIBDIR     the created library will eventually be installed in LIBDIR\n  -R[ ]LIBDIR       add LIBDIR to the runtime path of programs and libraries\n  -shared           only do dynamic linking of libtool libraries\n  -shrext SUFFIX    override the standard shared library file extension\n  -static           do not do any dynamic linking of uninstalled libtool libraries\n  -static-libtool-libs\n                    do not do any dynamic linking of libtool libraries\n  -version-info CURRENT[:REVISION[:AGE]]\n                    specify library version info [each variable defaults to 0]\n  -weak LIBNAME     declare that the target provides the LIBNAME interface\n  -Wc,FLAG\n  -Xcompiler FLAG   pass linker-specific FLAG directly to the compiler\n  -Wl,FLAG\n  -Xlinker FLAG     pass linker-specific FLAG directly to the linker\n  -XCClinker FLAG   pass link-specific FLAG to the compiler driver (CC)\n\nAll other options (arguments beginning with '-') are ignored.\n\nEvery other argument is treated as a filename.  Files ending in '.la' are\ntreated as uninstalled libtool libraries, other files are standard or library\nobject files.\n\nIf the OUTPUT-FILE ends in '.la', then a libtool library is created,\nonly library objects ('.lo' files) may be specified, and '-rpath' is\nrequired, except when creating a convenience library.\n\nIf OUTPUT-FILE ends in '.a' or '.lib', then a standard library is created\nusing 'ar' and 'ranlib', or on Windows using 'lib'.\n\nIf OUTPUT-FILE ends in '.lo' or '.$objext', then a reloadable object file\nis created, otherwise an executable program is created.\"\n        ;;\n\n      uninstall)\n        $ECHO \\\n\"Usage: $progname [OPTION]... --mode=uninstall RM [RM-OPTION]... FILE...\n\nRemove libraries from an installation directory.\n\nRM is the name of the program to use to delete files associated with each FILE\n(typically '/bin/rm').  RM-OPTIONS are options (such as '-f') to be passed\nto RM.\n\nIf FILE is a libtool library, all the files associated with it are deleted.\nOtherwise, only FILE itself is deleted using RM.\"\n        ;;\n\n      *)\n        func_fatal_help \"invalid operation mode '$opt_mode'\"\n        ;;\n    esac\n\n    echo\n    $ECHO \"Try '$progname --help' for more information about other modes.\"\n}\n\n# Now that we've collected a possible --mode arg, show help if necessary\nif $opt_help; then\n  if test : = \"$opt_help\"; then\n    func_mode_help\n  else\n    {\n      func_help noexit\n      for opt_mode in compile link execute install finish uninstall clean; do\n\tfunc_mode_help\n      done\n    } | $SED -n '1p; 2,$s/^Usage:/  or: /p'\n    {\n      func_help noexit\n      for opt_mode in compile link execute install finish uninstall clean; do\n\techo\n\tfunc_mode_help\n      done\n    } |\n    $SED '1d\n      /^When reporting/,/^Report/{\n\tH\n\td\n      }\n      $x\n      /information about other modes/d\n      /more detailed .*MODE/d\n      s/^Usage:.*--mode=\\([^ ]*\\) .*/Description of \\1 mode:/'\n  fi\n  exit $?\nfi\n\n\n# func_mode_execute arg...\nfunc_mode_execute ()\n{\n    $debug_cmd\n\n    # The first argument is the command name.\n    cmd=$nonopt\n    test -z \"$cmd\" && \\\n      func_fatal_help \"you must specify a COMMAND\"\n\n    # Handle -dlopen flags immediately.\n    for file in $opt_dlopen; do\n      test -f \"$file\" \\\n\t|| func_fatal_help \"'$file' is not a file\"\n\n      dir=\n      case $file in\n      *.la)\n\tfunc_resolve_sysroot \"$file\"\n\tfile=$func_resolve_sysroot_result\n\n\t# Check to see that this really is a libtool archive.\n\tfunc_lalib_unsafe_p \"$file\" \\\n\t  || func_fatal_help \"'$lib' is not a valid libtool archive\"\n\n\t# Read the libtool library.\n\tdlname=\n\tlibrary_names=\n\tfunc_source \"$file\"\n\n\t# Skip this library if it cannot be dlopened.\n\tif test -z \"$dlname\"; then\n\t  # Warn if it was a shared library.\n\t  test -n \"$library_names\" && \\\n\t    func_warning \"'$file' was not linked with '-export-dynamic'\"\n\t  continue\n\tfi\n\n\tfunc_dirname \"$file\" \"\" \".\"\n\tdir=$func_dirname_result\n\n\tif test -f \"$dir/$objdir/$dlname\"; then\n\t  func_append dir \"/$objdir\"\n\telse\n\t  if test ! -f \"$dir/$dlname\"; then\n\t    func_fatal_error \"cannot find '$dlname' in '$dir' or '$dir/$objdir'\"\n\t  fi\n\tfi\n\t;;\n\n      *.lo)\n\t# Just add the directory containing the .lo file.\n\tfunc_dirname \"$file\" \"\" \".\"\n\tdir=$func_dirname_result\n\t;;\n\n      *)\n\tfunc_warning \"'-dlopen' is ignored for non-libtool libraries and objects\"\n\tcontinue\n\t;;\n      esac\n\n      # Get the absolute pathname.\n      absdir=`cd \"$dir\" && pwd`\n      test -n \"$absdir\" && dir=$absdir\n\n      # Now add the directory to shlibpath_var.\n      if eval \"test -z \\\"\\$$shlibpath_var\\\"\"; then\n\teval \"$shlibpath_var=\\\"\\$dir\\\"\"\n      else\n\teval \"$shlibpath_var=\\\"\\$dir:\\$$shlibpath_var\\\"\"\n      fi\n    done\n\n    # This variable tells wrapper scripts just to set shlibpath_var\n    # rather than running their programs.\n    libtool_execute_magic=$magic\n\n    # Check if any of the arguments is a wrapper script.\n    args=\n    for file\n    do\n      case $file in\n      -* | *.la | *.lo ) ;;\n      *)\n\t# Do a test to see if this is really a libtool program.\n\tif func_ltwrapper_script_p \"$file\"; then\n\t  func_source \"$file\"\n\t  # Transform arg to wrapped name.\n\t  file=$progdir/$program\n\telif func_ltwrapper_executable_p \"$file\"; then\n\t  func_ltwrapper_scriptname \"$file\"\n\t  func_source \"$func_ltwrapper_scriptname_result\"\n\t  # Transform arg to wrapped name.\n\t  file=$progdir/$program\n\tfi\n\t;;\n      esac\n      # Quote arguments (to preserve shell metacharacters).\n      func_append_quoted args \"$file\"\n    done\n\n    if $opt_dry_run; then\n      # Display what would be done.\n      if test -n \"$shlibpath_var\"; then\n\teval \"\\$ECHO \\\"\\$shlibpath_var=\\$$shlibpath_var\\\"\"\n\techo \"export $shlibpath_var\"\n      fi\n      $ECHO \"$cmd$args\"\n      exit $EXIT_SUCCESS\n    else\n      if test -n \"$shlibpath_var\"; then\n\t# Export the shlibpath_var.\n\teval \"export $shlibpath_var\"\n      fi\n\n      # Restore saved environment variables\n      for lt_var in LANG LANGUAGE LC_ALL LC_CTYPE LC_COLLATE LC_MESSAGES\n      do\n\teval \"if test \\\"\\${save_$lt_var+set}\\\" = set; then\n                $lt_var=\\$save_$lt_var; export $lt_var\n\t      else\n\t\t$lt_unset $lt_var\n\t      fi\"\n      done\n\n      # Now prepare to actually exec the command.\n      exec_cmd=\\$cmd$args\n    fi\n}\n\ntest execute = \"$opt_mode\" && func_mode_execute ${1+\"$@\"}\n\n\n# func_mode_finish arg...\nfunc_mode_finish ()\n{\n    $debug_cmd\n\n    libs=\n    libdirs=\n    admincmds=\n\n    for opt in \"$nonopt\" ${1+\"$@\"}\n    do\n      if test -d \"$opt\"; then\n\tfunc_append libdirs \" $opt\"\n\n      elif test -f \"$opt\"; then\n\tif func_lalib_unsafe_p \"$opt\"; then\n\t  func_append libs \" $opt\"\n\telse\n\t  func_warning \"'$opt' is not a valid libtool archive\"\n\tfi\n\n      else\n\tfunc_fatal_error \"invalid argument '$opt'\"\n      fi\n    done\n\n    if test -n \"$libs\"; then\n      if test -n \"$lt_sysroot\"; then\n        sysroot_regex=`$ECHO \"$lt_sysroot\" | $SED \"$sed_make_literal_regex\"`\n        sysroot_cmd=\"s/\\([ ']\\)$sysroot_regex/\\1/g;\"\n      else\n        sysroot_cmd=\n      fi\n\n      # Remove sysroot references\n      if $opt_dry_run; then\n        for lib in $libs; do\n          echo \"removing references to $lt_sysroot and '=' prefixes from $lib\"\n        done\n      else\n        tmpdir=`func_mktempdir`\n        for lib in $libs; do\n\t  $SED -e \"$sysroot_cmd s/\\([ ']-[LR]\\)=/\\1/g; s/\\([ ']\\)=/\\1/g\" $lib \\\n\t    > $tmpdir/tmp-la\n\t  mv -f $tmpdir/tmp-la $lib\n\tdone\n        ${RM}r \"$tmpdir\"\n      fi\n    fi\n\n    if test -n \"$finish_cmds$finish_eval\" && test -n \"$libdirs\"; then\n      for libdir in $libdirs; do\n\tif test -n \"$finish_cmds\"; then\n\t  # Do each command in the finish commands.\n\t  func_execute_cmds \"$finish_cmds\" 'admincmds=\"$admincmds\n'\"$cmd\"'\"'\n\tfi\n\tif test -n \"$finish_eval\"; then\n\t  # Do the single finish_eval.\n\t  eval cmds=\\\"$finish_eval\\\"\n\t  $opt_dry_run || eval \"$cmds\" || func_append admincmds \"\n       $cmds\"\n\tfi\n      done\n    fi\n\n    # Exit here if they wanted silent mode.\n    $opt_quiet && exit $EXIT_SUCCESS\n\n    if test -n \"$finish_cmds$finish_eval\" && test -n \"$libdirs\"; then\n      echo \"----------------------------------------------------------------------\"\n      echo \"Libraries have been installed in:\"\n      for libdir in $libdirs; do\n\t$ECHO \"   $libdir\"\n      done\n      echo\n      echo \"If you ever happen to want to link against installed libraries\"\n      echo \"in a given directory, LIBDIR, you must either use libtool, and\"\n      echo \"specify the full pathname of the library, or use the '-LLIBDIR'\"\n      echo \"flag during linking and do at least one of the following:\"\n      if test -n \"$shlibpath_var\"; then\n\techo \"   - add LIBDIR to the '$shlibpath_var' environment variable\"\n\techo \"     during execution\"\n      fi\n      if test -n \"$runpath_var\"; then\n\techo \"   - add LIBDIR to the '$runpath_var' environment variable\"\n\techo \"     during linking\"\n      fi\n      if test -n \"$hardcode_libdir_flag_spec\"; then\n\tlibdir=LIBDIR\n\teval flag=\\\"$hardcode_libdir_flag_spec\\\"\n\n\t$ECHO \"   - use the '$flag' linker flag\"\n      fi\n      if test -n \"$admincmds\"; then\n\t$ECHO \"   - have your system administrator run these commands:$admincmds\"\n      fi\n      if test -f /etc/ld.so.conf; then\n\techo \"   - have your system administrator add LIBDIR to '/etc/ld.so.conf'\"\n      fi\n      echo\n\n      echo \"See any operating system documentation about shared libraries for\"\n      case $host in\n\tsolaris2.[6789]|solaris2.1[0-9])\n\t  echo \"more information, such as the ld(1), crle(1) and ld.so(8) manual\"\n\t  echo \"pages.\"\n\t  ;;\n\t*)\n\t  echo \"more information, such as the ld(1) and ld.so(8) manual pages.\"\n\t  ;;\n      esac\n      echo \"----------------------------------------------------------------------\"\n    fi\n    exit $EXIT_SUCCESS\n}\n\ntest finish = \"$opt_mode\" && func_mode_finish ${1+\"$@\"}\n\n\n# func_mode_install arg...\nfunc_mode_install ()\n{\n    $debug_cmd\n\n    # There may be an optional sh(1) argument at the beginning of\n    # install_prog (especially on Windows NT).\n    if test \"$SHELL\" = \"$nonopt\" || test /bin/sh = \"$nonopt\" ||\n       # Allow the use of GNU shtool's install command.\n       case $nonopt in *shtool*) :;; *) false;; esac\n    then\n      # Aesthetically quote it.\n      func_quote_for_eval \"$nonopt\"\n      install_prog=\"$func_quote_for_eval_result \"\n      arg=$1\n      shift\n    else\n      install_prog=\n      arg=$nonopt\n    fi\n\n    # The real first argument should be the name of the installation program.\n    # Aesthetically quote it.\n    func_quote_for_eval \"$arg\"\n    func_append install_prog \"$func_quote_for_eval_result\"\n    install_shared_prog=$install_prog\n    case \" $install_prog \" in\n      *[\\\\\\ /]cp\\ *) install_cp=: ;;\n      *) install_cp=false ;;\n    esac\n\n    # We need to accept at least all the BSD install flags.\n    dest=\n    files=\n    opts=\n    prev=\n    install_type=\n    isdir=false\n    stripme=\n    no_mode=:\n    for arg\n    do\n      arg2=\n      if test -n \"$dest\"; then\n\tfunc_append files \" $dest\"\n\tdest=$arg\n\tcontinue\n      fi\n\n      case $arg in\n      -d) isdir=: ;;\n      -f)\n\tif $install_cp; then :; else\n\t  prev=$arg\n\tfi\n\t;;\n      -g | -m | -o)\n\tprev=$arg\n\t;;\n      -s)\n\tstripme=\" -s\"\n\tcontinue\n\t;;\n      -*)\n\t;;\n      *)\n\t# If the previous option needed an argument, then skip it.\n\tif test -n \"$prev\"; then\n\t  if test X-m = \"X$prev\" && test -n \"$install_override_mode\"; then\n\t    arg2=$install_override_mode\n\t    no_mode=false\n\t  fi\n\t  prev=\n\telse\n\t  dest=$arg\n\t  continue\n\tfi\n\t;;\n      esac\n\n      # Aesthetically quote the argument.\n      func_quote_for_eval \"$arg\"\n      func_append install_prog \" $func_quote_for_eval_result\"\n      if test -n \"$arg2\"; then\n\tfunc_quote_for_eval \"$arg2\"\n      fi\n      func_append install_shared_prog \" $func_quote_for_eval_result\"\n    done\n\n    test -z \"$install_prog\" && \\\n      func_fatal_help \"you must specify an install program\"\n\n    test -n \"$prev\" && \\\n      func_fatal_help \"the '$prev' option requires an argument\"\n\n    if test -n \"$install_override_mode\" && $no_mode; then\n      if $install_cp; then :; else\n\tfunc_quote_for_eval \"$install_override_mode\"\n\tfunc_append install_shared_prog \" -m $func_quote_for_eval_result\"\n      fi\n    fi\n\n    if test -z \"$files\"; then\n      if test -z \"$dest\"; then\n\tfunc_fatal_help \"no file or destination specified\"\n      else\n\tfunc_fatal_help \"you must specify a destination\"\n      fi\n    fi\n\n    # Strip any trailing slash from the destination.\n    func_stripname '' '/' \"$dest\"\n    dest=$func_stripname_result\n\n    # Check to see that the destination is a directory.\n    test -d \"$dest\" && isdir=:\n    if $isdir; then\n      destdir=$dest\n      destname=\n    else\n      func_dirname_and_basename \"$dest\" \"\" \".\"\n      destdir=$func_dirname_result\n      destname=$func_basename_result\n\n      # Not a directory, so check to see that there is only one file specified.\n      set dummy $files; shift\n      test \"$#\" -gt 1 && \\\n\tfunc_fatal_help \"'$dest' is not a directory\"\n    fi\n    case $destdir in\n    [\\\\/]* | [A-Za-z]:[\\\\/]*) ;;\n    *)\n      for file in $files; do\n\tcase $file in\n\t*.lo) ;;\n\t*)\n\t  func_fatal_help \"'$destdir' must be an absolute directory name\"\n\t  ;;\n\tesac\n      done\n      ;;\n    esac\n\n    # This variable tells wrapper scripts just to set variables rather\n    # than running their programs.\n    libtool_install_magic=$magic\n\n    staticlibs=\n    future_libdirs=\n    current_libdirs=\n    for file in $files; do\n\n      # Do each installation.\n      case $file in\n      *.$libext)\n\t# Do the static libraries later.\n\tfunc_append staticlibs \" $file\"\n\t;;\n\n      *.la)\n\tfunc_resolve_sysroot \"$file\"\n\tfile=$func_resolve_sysroot_result\n\n\t# Check to see that this really is a libtool archive.\n\tfunc_lalib_unsafe_p \"$file\" \\\n\t  || func_fatal_help \"'$file' is not a valid libtool archive\"\n\n\tlibrary_names=\n\told_library=\n\trelink_command=\n\tfunc_source \"$file\"\n\n\t# Add the libdir to current_libdirs if it is the destination.\n\tif test \"X$destdir\" = \"X$libdir\"; then\n\t  case \"$current_libdirs \" in\n\t  *\" $libdir \"*) ;;\n\t  *) func_append current_libdirs \" $libdir\" ;;\n\t  esac\n\telse\n\t  # Note the libdir as a future libdir.\n\t  case \"$future_libdirs \" in\n\t  *\" $libdir \"*) ;;\n\t  *) func_append future_libdirs \" $libdir\" ;;\n\t  esac\n\tfi\n\n\tfunc_dirname \"$file\" \"/\" \"\"\n\tdir=$func_dirname_result\n\tfunc_append dir \"$objdir\"\n\n\tif test -n \"$relink_command\"; then\n\t  # Determine the prefix the user has applied to our future dir.\n\t  inst_prefix_dir=`$ECHO \"$destdir\" | $SED -e \"s%$libdir\\$%%\"`\n\n\t  # Don't allow the user to place us outside of our expected\n\t  # location b/c this prevents finding dependent libraries that\n\t  # are installed to the same prefix.\n\t  # At present, this check doesn't affect windows .dll's that\n\t  # are installed into $libdir/../bin (currently, that works fine)\n\t  # but it's something to keep an eye on.\n\t  test \"$inst_prefix_dir\" = \"$destdir\" && \\\n\t    func_fatal_error \"error: cannot install '$file' to a directory not ending in $libdir\"\n\n\t  if test -n \"$inst_prefix_dir\"; then\n\t    # Stick the inst_prefix_dir data into the link command.\n\t    relink_command=`$ECHO \"$relink_command\" | $SED \"s%@inst_prefix_dir@%-inst-prefix-dir $inst_prefix_dir%\"`\n\t  else\n\t    relink_command=`$ECHO \"$relink_command\" | $SED \"s%@inst_prefix_dir@%%\"`\n\t  fi\n\n\t  func_warning \"relinking '$file'\"\n\t  func_show_eval \"$relink_command\" \\\n\t    'func_fatal_error \"error: relink '\\''$file'\\'' with the above command before installing it\"'\n\tfi\n\n\t# See the names of the shared library.\n\tset dummy $library_names; shift\n\tif test -n \"$1\"; then\n\t  realname=$1\n\t  shift\n\n\t  srcname=$realname\n\t  test -n \"$relink_command\" && srcname=${realname}T\n\n\t  # Install the shared library and build the symlinks.\n\t  func_show_eval \"$install_shared_prog $dir/$srcname $destdir/$realname\" \\\n\t      'exit $?'\n\t  tstripme=$stripme\n\t  case $host_os in\n\t  cygwin* | mingw* | pw32* | cegcc*)\n\t    case $realname in\n\t    *.dll.a)\n\t      tstripme=\n\t      ;;\n\t    esac\n\t    ;;\n\t  os2*)\n\t    case $realname in\n\t    *_dll.a)\n\t      tstripme=\n\t      ;;\n\t    esac\n\t    ;;\n\t  esac\n\t  if test -n \"$tstripme\" && test -n \"$striplib\"; then\n\t    func_show_eval \"$striplib $destdir/$realname\" 'exit $?'\n\t  fi\n\n\t  if test \"$#\" -gt 0; then\n\t    # Delete the old symlinks, and create new ones.\n\t    # Try 'ln -sf' first, because the 'ln' binary might depend on\n\t    # the symlink we replace!  Solaris /bin/ln does not understand -f,\n\t    # so we also need to try rm && ln -s.\n\t    for linkname\n\t    do\n\t      test \"$linkname\" != \"$realname\" \\\n\t\t&& func_show_eval \"(cd $destdir && { $LN_S -f $realname $linkname || { $RM $linkname && $LN_S $realname $linkname; }; })\"\n\t    done\n\t  fi\n\n\t  # Do each command in the postinstall commands.\n\t  lib=$destdir/$realname\n\t  func_execute_cmds \"$postinstall_cmds\" 'exit $?'\n\tfi\n\n\t# Install the pseudo-library for information purposes.\n\tfunc_basename \"$file\"\n\tname=$func_basename_result\n\tinstname=$dir/${name}i\n\tfunc_show_eval \"$install_prog $instname $destdir/$name\" 'exit $?'\n\n\t# Maybe install the static library, too.\n\ttest -n \"$old_library\" && func_append staticlibs \" $dir/$old_library\"\n\t;;\n\n      *.lo)\n\t# Install (i.e. copy) a libtool object.\n\n\t# Figure out destination file name, if it wasn't already specified.\n\tif test -n \"$destname\"; then\n\t  destfile=$destdir/$destname\n\telse\n\t  func_basename \"$file\"\n\t  destfile=$func_basename_result\n\t  destfile=$destdir/$destfile\n\tfi\n\n\t# Deduce the name of the destination old-style object file.\n\tcase $destfile in\n\t*.lo)\n\t  func_lo2o \"$destfile\"\n\t  staticdest=$func_lo2o_result\n\t  ;;\n\t*.$objext)\n\t  staticdest=$destfile\n\t  destfile=\n\t  ;;\n\t*)\n\t  func_fatal_help \"cannot copy a libtool object to '$destfile'\"\n\t  ;;\n\tesac\n\n\t# Install the libtool object if requested.\n\ttest -n \"$destfile\" && \\\n\t  func_show_eval \"$install_prog $file $destfile\" 'exit $?'\n\n\t# Install the old object if enabled.\n\tif test yes = \"$build_old_libs\"; then\n\t  # Deduce the name of the old-style object file.\n\t  func_lo2o \"$file\"\n\t  staticobj=$func_lo2o_result\n\t  func_show_eval \"$install_prog \\$staticobj \\$staticdest\" 'exit $?'\n\tfi\n\texit $EXIT_SUCCESS\n\t;;\n\n      *)\n\t# Figure out destination file name, if it wasn't already specified.\n\tif test -n \"$destname\"; then\n\t  destfile=$destdir/$destname\n\telse\n\t  func_basename \"$file\"\n\t  destfile=$func_basename_result\n\t  destfile=$destdir/$destfile\n\tfi\n\n\t# If the file is missing, and there is a .exe on the end, strip it\n\t# because it is most likely a libtool script we actually want to\n\t# install\n\tstripped_ext=\n\tcase $file in\n\t  *.exe)\n\t    if test ! -f \"$file\"; then\n\t      func_stripname '' '.exe' \"$file\"\n\t      file=$func_stripname_result\n\t      stripped_ext=.exe\n\t    fi\n\t    ;;\n\tesac\n\n\t# Do a test to see if this is really a libtool program.\n\tcase $host in\n\t*cygwin* | *mingw*)\n\t    if func_ltwrapper_executable_p \"$file\"; then\n\t      func_ltwrapper_scriptname \"$file\"\n\t      wrapper=$func_ltwrapper_scriptname_result\n\t    else\n\t      func_stripname '' '.exe' \"$file\"\n\t      wrapper=$func_stripname_result\n\t    fi\n\t    ;;\n\t*)\n\t    wrapper=$file\n\t    ;;\n\tesac\n\tif func_ltwrapper_script_p \"$wrapper\"; then\n\t  notinst_deplibs=\n\t  relink_command=\n\n\t  func_source \"$wrapper\"\n\n\t  # Check the variables that should have been set.\n\t  test -z \"$generated_by_libtool_version\" && \\\n\t    func_fatal_error \"invalid libtool wrapper script '$wrapper'\"\n\n\t  finalize=:\n\t  for lib in $notinst_deplibs; do\n\t    # Check to see that each library is installed.\n\t    libdir=\n\t    if test -f \"$lib\"; then\n\t      func_source \"$lib\"\n\t    fi\n\t    libfile=$libdir/`$ECHO \"$lib\" | $SED 's%^.*/%%g'`\n\t    if test -n \"$libdir\" && test ! -f \"$libfile\"; then\n\t      func_warning \"'$lib' has not been installed in '$libdir'\"\n\t      finalize=false\n\t    fi\n\t  done\n\n\t  relink_command=\n\t  func_source \"$wrapper\"\n\n\t  outputname=\n\t  if test no = \"$fast_install\" && test -n \"$relink_command\"; then\n\t    $opt_dry_run || {\n\t      if $finalize; then\n\t        tmpdir=`func_mktempdir`\n\t\tfunc_basename \"$file$stripped_ext\"\n\t\tfile=$func_basename_result\n\t        outputname=$tmpdir/$file\n\t        # Replace the output file specification.\n\t        relink_command=`$ECHO \"$relink_command\" | $SED 's%@OUTPUT@%'\"$outputname\"'%g'`\n\n\t        $opt_quiet || {\n\t          func_quote_for_expand \"$relink_command\"\n\t\t  eval \"func_echo $func_quote_for_expand_result\"\n\t        }\n\t        if eval \"$relink_command\"; then :\n\t          else\n\t\t  func_error \"error: relink '$file' with the above command before installing it\"\n\t\t  $opt_dry_run || ${RM}r \"$tmpdir\"\n\t\t  continue\n\t        fi\n\t        file=$outputname\n\t      else\n\t        func_warning \"cannot relink '$file'\"\n\t      fi\n\t    }\n\t  else\n\t    # Install the binary that we compiled earlier.\n\t    file=`$ECHO \"$file$stripped_ext\" | $SED \"s%\\([^/]*\\)$%$objdir/\\1%\"`\n\t  fi\n\tfi\n\n\t# remove .exe since cygwin /usr/bin/install will append another\n\t# one anyway\n\tcase $install_prog,$host in\n\t*/usr/bin/install*,*cygwin*)\n\t  case $file:$destfile in\n\t  *.exe:*.exe)\n\t    # this is ok\n\t    ;;\n\t  *.exe:*)\n\t    destfile=$destfile.exe\n\t    ;;\n\t  *:*.exe)\n\t    func_stripname '' '.exe' \"$destfile\"\n\t    destfile=$func_stripname_result\n\t    ;;\n\t  esac\n\t  ;;\n\tesac\n\tfunc_show_eval \"$install_prog\\$stripme \\$file \\$destfile\" 'exit $?'\n\t$opt_dry_run || if test -n \"$outputname\"; then\n\t  ${RM}r \"$tmpdir\"\n\tfi\n\t;;\n      esac\n    done\n\n    for file in $staticlibs; do\n      func_basename \"$file\"\n      name=$func_basename_result\n\n      # Set up the ranlib parameters.\n      oldlib=$destdir/$name\n      func_to_tool_file \"$oldlib\" func_convert_file_msys_to_w32\n      tool_oldlib=$func_to_tool_file_result\n\n      func_show_eval \"$install_prog \\$file \\$oldlib\" 'exit $?'\n\n      if test -n \"$stripme\" && test -n \"$old_striplib\"; then\n\tfunc_show_eval \"$old_striplib $tool_oldlib\" 'exit $?'\n      fi\n\n      # Do each command in the postinstall commands.\n      func_execute_cmds \"$old_postinstall_cmds\" 'exit $?'\n    done\n\n    test -n \"$future_libdirs\" && \\\n      func_warning \"remember to run '$progname --finish$future_libdirs'\"\n\n    if test -n \"$current_libdirs\"; then\n      # Maybe just do a dry run.\n      $opt_dry_run && current_libdirs=\" -n$current_libdirs\"\n      exec_cmd='$SHELL \"$progpath\" $preserve_args --finish$current_libdirs'\n    else\n      exit $EXIT_SUCCESS\n    fi\n}\n\ntest install = \"$opt_mode\" && func_mode_install ${1+\"$@\"}\n\n\n# func_generate_dlsyms outputname originator pic_p\n# Extract symbols from dlprefiles and create ${outputname}S.o with\n# a dlpreopen symbol table.\nfunc_generate_dlsyms ()\n{\n    $debug_cmd\n\n    my_outputname=$1\n    my_originator=$2\n    my_pic_p=${3-false}\n    my_prefix=`$ECHO \"$my_originator\" | $SED 's%[^a-zA-Z0-9]%_%g'`\n    my_dlsyms=\n\n    if test -n \"$dlfiles$dlprefiles\" || test no != \"$dlself\"; then\n      if test -n \"$NM\" && test -n \"$global_symbol_pipe\"; then\n\tmy_dlsyms=${my_outputname}S.c\n      else\n\tfunc_error \"not configured to extract global symbols from dlpreopened files\"\n      fi\n    fi\n\n    if test -n \"$my_dlsyms\"; then\n      case $my_dlsyms in\n      \"\") ;;\n      *.c)\n\t# Discover the nlist of each of the dlfiles.\n\tnlist=$output_objdir/$my_outputname.nm\n\n\tfunc_show_eval \"$RM $nlist ${nlist}S ${nlist}T\"\n\n\t# Parse the name list into a source file.\n\tfunc_verbose \"creating $output_objdir/$my_dlsyms\"\n\n\t$opt_dry_run || $ECHO > \"$output_objdir/$my_dlsyms\" \"\\\n/* $my_dlsyms - symbol resolution table for '$my_outputname' dlsym emulation. */\n/* Generated by $PROGRAM (GNU $PACKAGE) $VERSION */\n\n#ifdef __cplusplus\nextern \\\"C\\\" {\n#endif\n\n#if defined __GNUC__ && (((__GNUC__ == 4) && (__GNUC_MINOR__ >= 4)) || (__GNUC__ > 4))\n#pragma GCC diagnostic ignored \\\"-Wstrict-prototypes\\\"\n#endif\n\n/* Keep this code in sync between libtool.m4, ltmain, lt_system.h, and tests.  */\n#if defined _WIN32 || defined __CYGWIN__ || defined _WIN32_WCE\n/* DATA imports from DLLs on WIN32 can't be const, because runtime\n   relocations are performed -- see ld's documentation on pseudo-relocs.  */\n# define LT_DLSYM_CONST\n#elif defined __osf__\n/* This system does not cope well with relocations in const data.  */\n# define LT_DLSYM_CONST\n#else\n# define LT_DLSYM_CONST const\n#endif\n\n#define STREQ(s1, s2) (strcmp ((s1), (s2)) == 0)\n\n/* External symbol declarations for the compiler. */\\\n\"\n\n\tif test yes = \"$dlself\"; then\n\t  func_verbose \"generating symbol list for '$output'\"\n\n\t  $opt_dry_run || echo ': @PROGRAM@ ' > \"$nlist\"\n\n\t  # Add our own program objects to the symbol list.\n\t  progfiles=`$ECHO \"$objs$old_deplibs\" | $SP2NL | $SED \"$lo2o\" | $NL2SP`\n\t  for progfile in $progfiles; do\n\t    func_to_tool_file \"$progfile\" func_convert_file_msys_to_w32\n\t    func_verbose \"extracting global C symbols from '$func_to_tool_file_result'\"\n\t    $opt_dry_run || eval \"$NM $func_to_tool_file_result | $global_symbol_pipe >> '$nlist'\"\n\t  done\n\n\t  if test -n \"$exclude_expsyms\"; then\n\t    $opt_dry_run || {\n\t      eval '$EGREP -v \" ($exclude_expsyms)$\" \"$nlist\" > \"$nlist\"T'\n\t      eval '$MV \"$nlist\"T \"$nlist\"'\n\t    }\n\t  fi\n\n\t  if test -n \"$export_symbols_regex\"; then\n\t    $opt_dry_run || {\n\t      eval '$EGREP -e \"$export_symbols_regex\" \"$nlist\" > \"$nlist\"T'\n\t      eval '$MV \"$nlist\"T \"$nlist\"'\n\t    }\n\t  fi\n\n\t  # Prepare the list of exported symbols\n\t  if test -z \"$export_symbols\"; then\n\t    export_symbols=$output_objdir/$outputname.exp\n\t    $opt_dry_run || {\n\t      $RM $export_symbols\n\t      eval \"$SED -n -e '/^: @PROGRAM@ $/d' -e 's/^.* \\(.*\\)$/\\1/p' \"'< \"$nlist\" > \"$export_symbols\"'\n\t      case $host in\n\t      *cygwin* | *mingw* | *cegcc* )\n                eval \"echo EXPORTS \"'> \"$output_objdir/$outputname.def\"'\n                eval 'cat \"$export_symbols\" >> \"$output_objdir/$outputname.def\"'\n\t        ;;\n\t      esac\n\t    }\n\t  else\n\t    $opt_dry_run || {\n\t      eval \"$SED -e 's/\\([].[*^$]\\)/\\\\\\\\\\1/g' -e 's/^/ /' -e 's/$/$/'\"' < \"$export_symbols\" > \"$output_objdir/$outputname.exp\"'\n\t      eval '$GREP -f \"$output_objdir/$outputname.exp\" < \"$nlist\" > \"$nlist\"T'\n\t      eval '$MV \"$nlist\"T \"$nlist\"'\n\t      case $host in\n\t        *cygwin* | *mingw* | *cegcc* )\n\t          eval \"echo EXPORTS \"'> \"$output_objdir/$outputname.def\"'\n\t          eval 'cat \"$nlist\" >> \"$output_objdir/$outputname.def\"'\n\t          ;;\n\t      esac\n\t    }\n\t  fi\n\tfi\n\n\tfor dlprefile in $dlprefiles; do\n\t  func_verbose \"extracting global C symbols from '$dlprefile'\"\n\t  func_basename \"$dlprefile\"\n\t  name=$func_basename_result\n          case $host in\n\t    *cygwin* | *mingw* | *cegcc* )\n\t      # if an import library, we need to obtain dlname\n\t      if func_win32_import_lib_p \"$dlprefile\"; then\n\t        func_tr_sh \"$dlprefile\"\n\t        eval \"curr_lafile=\\$libfile_$func_tr_sh_result\"\n\t        dlprefile_dlbasename=\n\t        if test -n \"$curr_lafile\" && func_lalib_p \"$curr_lafile\"; then\n\t          # Use subshell, to avoid clobbering current variable values\n\t          dlprefile_dlname=`source \"$curr_lafile\" && echo \"$dlname\"`\n\t          if test -n \"$dlprefile_dlname\"; then\n\t            func_basename \"$dlprefile_dlname\"\n\t            dlprefile_dlbasename=$func_basename_result\n\t          else\n\t            # no lafile. user explicitly requested -dlpreopen <import library>.\n\t            $sharedlib_from_linklib_cmd \"$dlprefile\"\n\t            dlprefile_dlbasename=$sharedlib_from_linklib_result\n\t          fi\n\t        fi\n\t        $opt_dry_run || {\n\t          if test -n \"$dlprefile_dlbasename\"; then\n\t            eval '$ECHO \": $dlprefile_dlbasename\" >> \"$nlist\"'\n\t          else\n\t            func_warning \"Could not compute DLL name from $name\"\n\t            eval '$ECHO \": $name \" >> \"$nlist\"'\n\t          fi\n\t          func_to_tool_file \"$dlprefile\" func_convert_file_msys_to_w32\n\t          eval \"$NM \\\"$func_to_tool_file_result\\\" 2>/dev/null | $global_symbol_pipe |\n\t            $SED -e '/I __imp/d' -e 's/I __nm_/D /;s/_nm__//' >> '$nlist'\"\n\t        }\n\t      else # not an import lib\n\t        $opt_dry_run || {\n\t          eval '$ECHO \": $name \" >> \"$nlist\"'\n\t          func_to_tool_file \"$dlprefile\" func_convert_file_msys_to_w32\n\t          eval \"$NM \\\"$func_to_tool_file_result\\\" 2>/dev/null | $global_symbol_pipe >> '$nlist'\"\n\t        }\n\t      fi\n\t    ;;\n\t    *)\n\t      $opt_dry_run || {\n\t        eval '$ECHO \": $name \" >> \"$nlist\"'\n\t        func_to_tool_file \"$dlprefile\" func_convert_file_msys_to_w32\n\t        eval \"$NM \\\"$func_to_tool_file_result\\\" 2>/dev/null | $global_symbol_pipe >> '$nlist'\"\n\t      }\n\t    ;;\n          esac\n\tdone\n\n\t$opt_dry_run || {\n\t  # Make sure we have at least an empty file.\n\t  test -f \"$nlist\" || : > \"$nlist\"\n\n\t  if test -n \"$exclude_expsyms\"; then\n\t    $EGREP -v \" ($exclude_expsyms)$\" \"$nlist\" > \"$nlist\"T\n\t    $MV \"$nlist\"T \"$nlist\"\n\t  fi\n\n\t  # Try sorting and uniquifying the output.\n\t  if $GREP -v \"^: \" < \"$nlist\" |\n\t      if sort -k 3 </dev/null >/dev/null 2>&1; then\n\t\tsort -k 3\n\t      else\n\t\tsort +2\n\t      fi |\n\t      uniq > \"$nlist\"S; then\n\t    :\n\t  else\n\t    $GREP -v \"^: \" < \"$nlist\" > \"$nlist\"S\n\t  fi\n\n\t  if test -f \"$nlist\"S; then\n\t    eval \"$global_symbol_to_cdecl\"' < \"$nlist\"S >> \"$output_objdir/$my_dlsyms\"'\n\t  else\n\t    echo '/* NONE */' >> \"$output_objdir/$my_dlsyms\"\n\t  fi\n\n\t  func_show_eval '$RM \"${nlist}I\"'\n\t  if test -n \"$global_symbol_to_import\"; then\n\t    eval \"$global_symbol_to_import\"' < \"$nlist\"S > \"$nlist\"I'\n\t  fi\n\n\t  echo >> \"$output_objdir/$my_dlsyms\" \"\\\n\n/* The mapping between symbol names and symbols.  */\ntypedef struct {\n  const char *name;\n  void *address;\n} lt_dlsymlist;\nextern LT_DLSYM_CONST lt_dlsymlist\nlt_${my_prefix}_LTX_preloaded_symbols[];\\\n\"\n\n\t  if test -s \"$nlist\"I; then\n\t    echo >> \"$output_objdir/$my_dlsyms\" \"\\\nstatic void lt_syminit(void)\n{\n  LT_DLSYM_CONST lt_dlsymlist *symbol = lt_${my_prefix}_LTX_preloaded_symbols;\n  for (; symbol->name; ++symbol)\n    {\"\n\t    $SED 's/.*/      if (STREQ (symbol->name, \\\"&\\\")) symbol->address = (void *) \\&&;/' < \"$nlist\"I >> \"$output_objdir/$my_dlsyms\"\n\t    echo >> \"$output_objdir/$my_dlsyms\" \"\\\n    }\n}\"\n\t  fi\n\t  echo >> \"$output_objdir/$my_dlsyms\" \"\\\nLT_DLSYM_CONST lt_dlsymlist\nlt_${my_prefix}_LTX_preloaded_symbols[] =\n{ {\\\"$my_originator\\\", (void *) 0},\"\n\n\t  if test -s \"$nlist\"I; then\n\t    echo >> \"$output_objdir/$my_dlsyms\" \"\\\n  {\\\"@INIT@\\\", (void *) &lt_syminit},\"\n\t  fi\n\n\t  case $need_lib_prefix in\n\t  no)\n\t    eval \"$global_symbol_to_c_name_address\" < \"$nlist\" >> \"$output_objdir/$my_dlsyms\"\n\t    ;;\n\t  *)\n\t    eval \"$global_symbol_to_c_name_address_lib_prefix\" < \"$nlist\" >> \"$output_objdir/$my_dlsyms\"\n\t    ;;\n\t  esac\n\t  echo >> \"$output_objdir/$my_dlsyms\" \"\\\n  {0, (void *) 0}\n};\n\n/* This works around a problem in FreeBSD linker */\n#ifdef FREEBSD_WORKAROUND\nstatic const void *lt_preloaded_setup() {\n  return lt_${my_prefix}_LTX_preloaded_symbols;\n}\n#endif\n\n#ifdef __cplusplus\n}\n#endif\\\n\"\n\t} # !$opt_dry_run\n\n\tpic_flag_for_symtable=\n\tcase \"$compile_command \" in\n\t*\" -static \"*) ;;\n\t*)\n\t  case $host in\n\t  # compiling the symbol table file with pic_flag works around\n\t  # a FreeBSD bug that causes programs to crash when -lm is\n\t  # linked before any other PIC object.  But we must not use\n\t  # pic_flag when linking with -static.  The problem exists in\n\t  # FreeBSD 2.2.6 and is fixed in FreeBSD 3.1.\n\t  *-*-freebsd2.*|*-*-freebsd3.0*|*-*-freebsdelf3.0*)\n\t    pic_flag_for_symtable=\" $pic_flag -DFREEBSD_WORKAROUND\" ;;\n\t  *-*-hpux*)\n\t    pic_flag_for_symtable=\" $pic_flag\"  ;;\n\t  *)\n\t    $my_pic_p && pic_flag_for_symtable=\" $pic_flag\"\n\t    ;;\n\t  esac\n\t  ;;\n\tesac\n\tsymtab_cflags=\n\tfor arg in $LTCFLAGS; do\n\t  case $arg in\n\t  -pie | -fpie | -fPIE) ;;\n\t  *) func_append symtab_cflags \" $arg\" ;;\n\t  esac\n\tdone\n\n\t# Now compile the dynamic symbol file.\n\tfunc_show_eval '(cd $output_objdir && $LTCC$symtab_cflags -c$no_builtin_flag$pic_flag_for_symtable \"$my_dlsyms\")' 'exit $?'\n\n\t# Clean up the generated files.\n\tfunc_show_eval '$RM \"$output_objdir/$my_dlsyms\" \"$nlist\" \"${nlist}S\" \"${nlist}T\" \"${nlist}I\"'\n\n\t# Transform the symbol file into the correct name.\n\tsymfileobj=$output_objdir/${my_outputname}S.$objext\n\tcase $host in\n\t*cygwin* | *mingw* | *cegcc* )\n\t  if test -f \"$output_objdir/$my_outputname.def\"; then\n\t    compile_command=`$ECHO \"$compile_command\" | $SED \"s%@SYMFILE@%$output_objdir/$my_outputname.def $symfileobj%\"`\n\t    finalize_command=`$ECHO \"$finalize_command\" | $SED \"s%@SYMFILE@%$output_objdir/$my_outputname.def $symfileobj%\"`\n\t  else\n\t    compile_command=`$ECHO \"$compile_command\" | $SED \"s%@SYMFILE@%$symfileobj%\"`\n\t    finalize_command=`$ECHO \"$finalize_command\" | $SED \"s%@SYMFILE@%$symfileobj%\"`\n\t  fi\n\t  ;;\n\t*)\n\t  compile_command=`$ECHO \"$compile_command\" | $SED \"s%@SYMFILE@%$symfileobj%\"`\n\t  finalize_command=`$ECHO \"$finalize_command\" | $SED \"s%@SYMFILE@%$symfileobj%\"`\n\t  ;;\n\tesac\n\t;;\n      *)\n\tfunc_fatal_error \"unknown suffix for '$my_dlsyms'\"\n\t;;\n      esac\n    else\n      # We keep going just in case the user didn't refer to\n      # lt_preloaded_symbols.  The linker will fail if global_symbol_pipe\n      # really was required.\n\n      # Nullify the symbol file.\n      compile_command=`$ECHO \"$compile_command\" | $SED \"s% @SYMFILE@%%\"`\n      finalize_command=`$ECHO \"$finalize_command\" | $SED \"s% @SYMFILE@%%\"`\n    fi\n}\n\n# func_cygming_gnu_implib_p ARG\n# This predicate returns with zero status (TRUE) if\n# ARG is a GNU/binutils-style import library. Returns\n# with nonzero status (FALSE) otherwise.\nfunc_cygming_gnu_implib_p ()\n{\n  $debug_cmd\n\n  func_to_tool_file \"$1\" func_convert_file_msys_to_w32\n  func_cygming_gnu_implib_tmp=`$NM \"$func_to_tool_file_result\" | eval \"$global_symbol_pipe\" | $EGREP ' (_head_[A-Za-z0-9_]+_[ad]l*|[A-Za-z0-9_]+_[ad]l*_iname)$'`\n  test -n \"$func_cygming_gnu_implib_tmp\"\n}\n\n# func_cygming_ms_implib_p ARG\n# This predicate returns with zero status (TRUE) if\n# ARG is an MS-style import library. Returns\n# with nonzero status (FALSE) otherwise.\nfunc_cygming_ms_implib_p ()\n{\n  $debug_cmd\n\n  func_to_tool_file \"$1\" func_convert_file_msys_to_w32\n  func_cygming_ms_implib_tmp=`$NM \"$func_to_tool_file_result\" | eval \"$global_symbol_pipe\" | $GREP '_NULL_IMPORT_DESCRIPTOR'`\n  test -n \"$func_cygming_ms_implib_tmp\"\n}\n\n# func_win32_libid arg\n# return the library type of file 'arg'\n#\n# Need a lot of goo to handle *both* DLLs and import libs\n# Has to be a shell function in order to 'eat' the argument\n# that is supplied when $file_magic_command is called.\n# Despite the name, also deal with 64 bit binaries.\nfunc_win32_libid ()\n{\n  $debug_cmd\n\n  win32_libid_type=unknown\n  win32_fileres=`file -L $1 2>/dev/null`\n  case $win32_fileres in\n  *ar\\ archive\\ import\\ library*) # definitely import\n    win32_libid_type=\"x86 archive import\"\n    ;;\n  *ar\\ archive*) # could be an import, or static\n    # Keep the egrep pattern in sync with the one in _LT_CHECK_MAGIC_METHOD.\n    if eval $OBJDUMP -f $1 | $SED -e '10q' 2>/dev/null |\n       $EGREP 'file format (pei*-i386(.*architecture: i386)?|pe-arm-wince|pe-x86-64)' >/dev/null; then\n      case $nm_interface in\n      \"MS dumpbin\")\n\tif func_cygming_ms_implib_p \"$1\" ||\n\t   func_cygming_gnu_implib_p \"$1\"\n\tthen\n\t  win32_nmres=import\n\telse\n\t  win32_nmres=\n\tfi\n\t;;\n      *)\n\tfunc_to_tool_file \"$1\" func_convert_file_msys_to_w32\n\twin32_nmres=`eval $NM -f posix -A \\\"$func_to_tool_file_result\\\" |\n\t  $SED -n -e '\n\t    1,100{\n\t\t/ I /{\n\t\t    s|.*|import|\n\t\t    p\n\t\t    q\n\t\t}\n\t    }'`\n\t;;\n      esac\n      case $win32_nmres in\n      import*)  win32_libid_type=\"x86 archive import\";;\n      *)        win32_libid_type=\"x86 archive static\";;\n      esac\n    fi\n    ;;\n  *DLL*)\n    win32_libid_type=\"x86 DLL\"\n    ;;\n  *executable*) # but shell scripts are \"executable\" too...\n    case $win32_fileres in\n    *MS\\ Windows\\ PE\\ Intel*)\n      win32_libid_type=\"x86 DLL\"\n      ;;\n    esac\n    ;;\n  esac\n  $ECHO \"$win32_libid_type\"\n}\n\n# func_cygming_dll_for_implib ARG\n#\n# Platform-specific function to extract the\n# name of the DLL associated with the specified\n# import library ARG.\n# Invoked by eval'ing the libtool variable\n#    $sharedlib_from_linklib_cmd\n# Result is available in the variable\n#    $sharedlib_from_linklib_result\nfunc_cygming_dll_for_implib ()\n{\n  $debug_cmd\n\n  sharedlib_from_linklib_result=`$DLLTOOL --identify-strict --identify \"$1\"`\n}\n\n# func_cygming_dll_for_implib_fallback_core SECTION_NAME LIBNAMEs\n#\n# The is the core of a fallback implementation of a\n# platform-specific function to extract the name of the\n# DLL associated with the specified import library LIBNAME.\n#\n# SECTION_NAME is either .idata$6 or .idata$7, depending\n# on the platform and compiler that created the implib.\n#\n# Echos the name of the DLL associated with the\n# specified import library.\nfunc_cygming_dll_for_implib_fallback_core ()\n{\n  $debug_cmd\n\n  match_literal=`$ECHO \"$1\" | $SED \"$sed_make_literal_regex\"`\n  $OBJDUMP -s --section \"$1\" \"$2\" 2>/dev/null |\n    $SED '/^Contents of section '\"$match_literal\"':/{\n      # Place marker at beginning of archive member dllname section\n      s/.*/====MARK====/\n      p\n      d\n    }\n    # These lines can sometimes be longer than 43 characters, but\n    # are always uninteresting\n    /:[\t ]*file format pe[i]\\{,1\\}-/d\n    /^In archive [^:]*:/d\n    # Ensure marker is printed\n    /^====MARK====/p\n    # Remove all lines with less than 43 characters\n    /^.\\{43\\}/!d\n    # From remaining lines, remove first 43 characters\n    s/^.\\{43\\}//' |\n    $SED -n '\n      # Join marker and all lines until next marker into a single line\n      /^====MARK====/ b para\n      H\n      $ b para\n      b\n      :para\n      x\n      s/\\n//g\n      # Remove the marker\n      s/^====MARK====//\n      # Remove trailing dots and whitespace\n      s/[\\. \\t]*$//\n      # Print\n      /./p' |\n    # we now have a list, one entry per line, of the stringified\n    # contents of the appropriate section of all members of the\n    # archive that possess that section. Heuristic: eliminate\n    # all those that have a first or second character that is\n    # a '.' (that is, objdump's representation of an unprintable\n    # character.) This should work for all archives with less than\n    # 0x302f exports -- but will fail for DLLs whose name actually\n    # begins with a literal '.' or a single character followed by\n    # a '.'.\n    #\n    # Of those that remain, print the first one.\n    $SED -e '/^\\./d;/^.\\./d;q'\n}\n\n# func_cygming_dll_for_implib_fallback ARG\n# Platform-specific function to extract the\n# name of the DLL associated with the specified\n# import library ARG.\n#\n# This fallback implementation is for use when $DLLTOOL\n# does not support the --identify-strict option.\n# Invoked by eval'ing the libtool variable\n#    $sharedlib_from_linklib_cmd\n# Result is available in the variable\n#    $sharedlib_from_linklib_result\nfunc_cygming_dll_for_implib_fallback ()\n{\n  $debug_cmd\n\n  if func_cygming_gnu_implib_p \"$1\"; then\n    # binutils import library\n    sharedlib_from_linklib_result=`func_cygming_dll_for_implib_fallback_core '.idata$7' \"$1\"`\n  elif func_cygming_ms_implib_p \"$1\"; then\n    # ms-generated import library\n    sharedlib_from_linklib_result=`func_cygming_dll_for_implib_fallback_core '.idata$6' \"$1\"`\n  else\n    # unknown\n    sharedlib_from_linklib_result=\n  fi\n}\n\n\n# func_extract_an_archive dir oldlib\nfunc_extract_an_archive ()\n{\n    $debug_cmd\n\n    f_ex_an_ar_dir=$1; shift\n    f_ex_an_ar_oldlib=$1\n    if test yes = \"$lock_old_archive_extraction\"; then\n      lockfile=$f_ex_an_ar_oldlib.lock\n      until $opt_dry_run || ln \"$progpath\" \"$lockfile\" 2>/dev/null; do\n\tfunc_echo \"Waiting for $lockfile to be removed\"\n\tsleep 2\n      done\n    fi\n    func_show_eval \"(cd \\$f_ex_an_ar_dir && $AR x \\\"\\$f_ex_an_ar_oldlib\\\")\" \\\n\t\t   'stat=$?; rm -f \"$lockfile\"; exit $stat'\n    if test yes = \"$lock_old_archive_extraction\"; then\n      $opt_dry_run || rm -f \"$lockfile\"\n    fi\n    if ($AR t \"$f_ex_an_ar_oldlib\" | sort | sort -uc >/dev/null 2>&1); then\n     :\n    else\n      func_fatal_error \"object name conflicts in archive: $f_ex_an_ar_dir/$f_ex_an_ar_oldlib\"\n    fi\n}\n\n\n# func_extract_archives gentop oldlib ...\nfunc_extract_archives ()\n{\n    $debug_cmd\n\n    my_gentop=$1; shift\n    my_oldlibs=${1+\"$@\"}\n    my_oldobjs=\n    my_xlib=\n    my_xabs=\n    my_xdir=\n\n    for my_xlib in $my_oldlibs; do\n      # Extract the objects.\n      case $my_xlib in\n\t[\\\\/]* | [A-Za-z]:[\\\\/]*) my_xabs=$my_xlib ;;\n\t*) my_xabs=`pwd`\"/$my_xlib\" ;;\n      esac\n      func_basename \"$my_xlib\"\n      my_xlib=$func_basename_result\n      my_xlib_u=$my_xlib\n      while :; do\n        case \" $extracted_archives \" in\n\t*\" $my_xlib_u \"*)\n\t  func_arith $extracted_serial + 1\n\t  extracted_serial=$func_arith_result\n\t  my_xlib_u=lt$extracted_serial-$my_xlib ;;\n\t*) break ;;\n\tesac\n      done\n      extracted_archives=\"$extracted_archives $my_xlib_u\"\n      my_xdir=$my_gentop/$my_xlib_u\n\n      func_mkdir_p \"$my_xdir\"\n\n      case $host in\n      *-darwin*)\n\tfunc_verbose \"Extracting $my_xabs\"\n\t# Do not bother doing anything if just a dry run\n\t$opt_dry_run || {\n\t  darwin_orig_dir=`pwd`\n\t  cd $my_xdir || exit $?\n\t  darwin_archive=$my_xabs\n\t  darwin_curdir=`pwd`\n\t  func_basename \"$darwin_archive\"\n\t  darwin_base_archive=$func_basename_result\n\t  darwin_arches=`$LIPO -info \"$darwin_archive\" 2>/dev/null | $GREP Architectures 2>/dev/null || true`\n\t  if test -n \"$darwin_arches\"; then\n\t    darwin_arches=`$ECHO \"$darwin_arches\" | $SED -e 's/.*are://'`\n\t    darwin_arch=\n\t    func_verbose \"$darwin_base_archive has multiple architectures $darwin_arches\"\n\t    for darwin_arch in  $darwin_arches; do\n\t      func_mkdir_p \"unfat-$$/$darwin_base_archive-$darwin_arch\"\n\t      $LIPO -thin $darwin_arch -output \"unfat-$$/$darwin_base_archive-$darwin_arch/$darwin_base_archive\" \"$darwin_archive\"\n\t      cd \"unfat-$$/$darwin_base_archive-$darwin_arch\"\n\t      func_extract_an_archive \"`pwd`\" \"$darwin_base_archive\"\n\t      cd \"$darwin_curdir\"\n\t      $RM \"unfat-$$/$darwin_base_archive-$darwin_arch/$darwin_base_archive\"\n\t    done # $darwin_arches\n            ## Okay now we've a bunch of thin objects, gotta fatten them up :)\n\t    darwin_filelist=`find unfat-$$ -type f -name \\*.o -print -o -name \\*.lo -print | $SED -e \"$sed_basename\" | sort -u`\n\t    darwin_file=\n\t    darwin_files=\n\t    for darwin_file in $darwin_filelist; do\n\t      darwin_files=`find unfat-$$ -name $darwin_file -print | sort | $NL2SP`\n\t      $LIPO -create -output \"$darwin_file\" $darwin_files\n\t    done # $darwin_filelist\n\t    $RM -rf unfat-$$\n\t    cd \"$darwin_orig_dir\"\n\t  else\n\t    cd $darwin_orig_dir\n\t    func_extract_an_archive \"$my_xdir\" \"$my_xabs\"\n\t  fi # $darwin_arches\n\t} # !$opt_dry_run\n\t;;\n      *)\n        func_extract_an_archive \"$my_xdir\" \"$my_xabs\"\n\t;;\n      esac\n      my_oldobjs=\"$my_oldobjs \"`find $my_xdir -name \\*.$objext -print -o -name \\*.lo -print | sort | $NL2SP`\n    done\n\n    func_extract_archives_result=$my_oldobjs\n}\n\n\n# func_emit_wrapper [arg=no]\n#\n# Emit a libtool wrapper script on stdout.\n# Don't directly open a file because we may want to\n# incorporate the script contents within a cygwin/mingw\n# wrapper executable.  Must ONLY be called from within\n# func_mode_link because it depends on a number of variables\n# set therein.\n#\n# ARG is the value that the WRAPPER_SCRIPT_BELONGS_IN_OBJDIR\n# variable will take.  If 'yes', then the emitted script\n# will assume that the directory where it is stored is\n# the $objdir directory.  This is a cygwin/mingw-specific\n# behavior.\nfunc_emit_wrapper ()\n{\n\tfunc_emit_wrapper_arg1=${1-no}\n\n\t$ECHO \"\\\n#! $SHELL\n\n# $output - temporary wrapper script for $objdir/$outputname\n# Generated by $PROGRAM (GNU $PACKAGE) $VERSION\n#\n# The $output program cannot be directly executed until all the libtool\n# libraries that it depends on are installed.\n#\n# This wrapper script should never be moved out of the build directory.\n# If it is, it will not operate correctly.\n\n# Sed substitution that helps us do robust quoting.  It backslashifies\n# metacharacters that are still active within double-quoted strings.\nsed_quote_subst='$sed_quote_subst'\n\n# Be Bourne compatible\nif test -n \\\"\\${ZSH_VERSION+set}\\\" && (emulate sh) >/dev/null 2>&1; then\n  emulate sh\n  NULLCMD=:\n  # Zsh 3.x and 4.x performs word splitting on \\${1+\\\"\\$@\\\"}, which\n  # is contrary to our usage.  Disable this feature.\n  alias -g '\\${1+\\\"\\$@\\\"}'='\\\"\\$@\\\"'\n  setopt NO_GLOB_SUBST\nelse\n  case \\`(set -o) 2>/dev/null\\` in *posix*) set -o posix;; esac\nfi\nBIN_SH=xpg4; export BIN_SH # for Tru64\nDUALCASE=1; export DUALCASE # for MKS sh\n\n# The HP-UX ksh and POSIX shell print the target directory to stdout\n# if CDPATH is set.\n(unset CDPATH) >/dev/null 2>&1 && unset CDPATH\n\nrelink_command=\\\"$relink_command\\\"\n\n# This environment variable determines our operation mode.\nif test \\\"\\$libtool_install_magic\\\" = \\\"$magic\\\"; then\n  # install mode needs the following variables:\n  generated_by_libtool_version='$macro_version'\n  notinst_deplibs='$notinst_deplibs'\nelse\n  # When we are sourced in execute mode, \\$file and \\$ECHO are already set.\n  if test \\\"\\$libtool_execute_magic\\\" != \\\"$magic\\\"; then\n    file=\\\"\\$0\\\"\"\n\n    qECHO=`$ECHO \"$ECHO\" | $SED \"$sed_quote_subst\"`\n    $ECHO \"\\\n\n# A function that is used when there is no print builtin or printf.\nfunc_fallback_echo ()\n{\n  eval 'cat <<_LTECHO_EOF\n\\$1\n_LTECHO_EOF'\n}\n    ECHO=\\\"$qECHO\\\"\n  fi\n\n# Very basic option parsing. These options are (a) specific to\n# the libtool wrapper, (b) are identical between the wrapper\n# /script/ and the wrapper /executable/ that is used only on\n# windows platforms, and (c) all begin with the string \"--lt-\"\n# (application programs are unlikely to have options that match\n# this pattern).\n#\n# There are only two supported options: --lt-debug and\n# --lt-dump-script. There is, deliberately, no --lt-help.\n#\n# The first argument to this parsing function should be the\n# script's $0 value, followed by \"$@\".\nlt_option_debug=\nfunc_parse_lt_options ()\n{\n  lt_script_arg0=\\$0\n  shift\n  for lt_opt\n  do\n    case \\\"\\$lt_opt\\\" in\n    --lt-debug) lt_option_debug=1 ;;\n    --lt-dump-script)\n        lt_dump_D=\\`\\$ECHO \\\"X\\$lt_script_arg0\\\" | $SED -e 's/^X//' -e 's%/[^/]*$%%'\\`\n        test \\\"X\\$lt_dump_D\\\" = \\\"X\\$lt_script_arg0\\\" && lt_dump_D=.\n        lt_dump_F=\\`\\$ECHO \\\"X\\$lt_script_arg0\\\" | $SED -e 's/^X//' -e 's%^.*/%%'\\`\n        cat \\\"\\$lt_dump_D/\\$lt_dump_F\\\"\n        exit 0\n      ;;\n    --lt-*)\n        \\$ECHO \\\"Unrecognized --lt- option: '\\$lt_opt'\\\" 1>&2\n        exit 1\n      ;;\n    esac\n  done\n\n  # Print the debug banner immediately:\n  if test -n \\\"\\$lt_option_debug\\\"; then\n    echo \\\"$outputname:$output:\\$LINENO: libtool wrapper (GNU $PACKAGE) $VERSION\\\" 1>&2\n  fi\n}\n\n# Used when --lt-debug. Prints its arguments to stdout\n# (redirection is the responsibility of the caller)\nfunc_lt_dump_args ()\n{\n  lt_dump_args_N=1;\n  for lt_arg\n  do\n    \\$ECHO \\\"$outputname:$output:\\$LINENO: newargv[\\$lt_dump_args_N]: \\$lt_arg\\\"\n    lt_dump_args_N=\\`expr \\$lt_dump_args_N + 1\\`\n  done\n}\n\n# Core function for launching the target application\nfunc_exec_program_core ()\n{\n\"\n  case $host in\n  # Backslashes separate directories on plain windows\n  *-*-mingw | *-*-os2* | *-cegcc*)\n    $ECHO \"\\\n      if test -n \\\"\\$lt_option_debug\\\"; then\n        \\$ECHO \\\"$outputname:$output:\\$LINENO: newargv[0]: \\$progdir\\\\\\\\\\$program\\\" 1>&2\n        func_lt_dump_args \\${1+\\\"\\$@\\\"} 1>&2\n      fi\n      exec \\\"\\$progdir\\\\\\\\\\$program\\\" \\${1+\\\"\\$@\\\"}\n\"\n    ;;\n\n  *)\n    $ECHO \"\\\n      if test -n \\\"\\$lt_option_debug\\\"; then\n        \\$ECHO \\\"$outputname:$output:\\$LINENO: newargv[0]: \\$progdir/\\$program\\\" 1>&2\n        func_lt_dump_args \\${1+\\\"\\$@\\\"} 1>&2\n      fi\n      exec \\\"\\$progdir/\\$program\\\" \\${1+\\\"\\$@\\\"}\n\"\n    ;;\n  esac\n  $ECHO \"\\\n      \\$ECHO \\\"\\$0: cannot exec \\$program \\$*\\\" 1>&2\n      exit 1\n}\n\n# A function to encapsulate launching the target application\n# Strips options in the --lt-* namespace from \\$@ and\n# launches target application with the remaining arguments.\nfunc_exec_program ()\n{\n  case \\\" \\$* \\\" in\n  *\\\\ --lt-*)\n    for lt_wr_arg\n    do\n      case \\$lt_wr_arg in\n      --lt-*) ;;\n      *) set x \\\"\\$@\\\" \\\"\\$lt_wr_arg\\\"; shift;;\n      esac\n      shift\n    done ;;\n  esac\n  func_exec_program_core \\${1+\\\"\\$@\\\"}\n}\n\n  # Parse options\n  func_parse_lt_options \\\"\\$0\\\" \\${1+\\\"\\$@\\\"}\n\n  # Find the directory that this script lives in.\n  thisdir=\\`\\$ECHO \\\"\\$file\\\" | $SED 's%/[^/]*$%%'\\`\n  test \\\"x\\$thisdir\\\" = \\\"x\\$file\\\" && thisdir=.\n\n  # Follow symbolic links until we get to the real thisdir.\n  file=\\`ls -ld \\\"\\$file\\\" | $SED -n 's/.*-> //p'\\`\n  while test -n \\\"\\$file\\\"; do\n    destdir=\\`\\$ECHO \\\"\\$file\\\" | $SED 's%/[^/]*\\$%%'\\`\n\n    # If there was a directory component, then change thisdir.\n    if test \\\"x\\$destdir\\\" != \\\"x\\$file\\\"; then\n      case \\\"\\$destdir\\\" in\n      [\\\\\\\\/]* | [A-Za-z]:[\\\\\\\\/]*) thisdir=\\\"\\$destdir\\\" ;;\n      *) thisdir=\\\"\\$thisdir/\\$destdir\\\" ;;\n      esac\n    fi\n\n    file=\\`\\$ECHO \\\"\\$file\\\" | $SED 's%^.*/%%'\\`\n    file=\\`ls -ld \\\"\\$thisdir/\\$file\\\" | $SED -n 's/.*-> //p'\\`\n  done\n\n  # Usually 'no', except on cygwin/mingw when embedded into\n  # the cwrapper.\n  WRAPPER_SCRIPT_BELONGS_IN_OBJDIR=$func_emit_wrapper_arg1\n  if test \\\"\\$WRAPPER_SCRIPT_BELONGS_IN_OBJDIR\\\" = \\\"yes\\\"; then\n    # special case for '.'\n    if test \\\"\\$thisdir\\\" = \\\".\\\"; then\n      thisdir=\\`pwd\\`\n    fi\n    # remove .libs from thisdir\n    case \\\"\\$thisdir\\\" in\n    *[\\\\\\\\/]$objdir ) thisdir=\\`\\$ECHO \\\"\\$thisdir\\\" | $SED 's%[\\\\\\\\/][^\\\\\\\\/]*$%%'\\` ;;\n    $objdir )   thisdir=. ;;\n    esac\n  fi\n\n  # Try to get the absolute directory name.\n  absdir=\\`cd \\\"\\$thisdir\\\" && pwd\\`\n  test -n \\\"\\$absdir\\\" && thisdir=\\\"\\$absdir\\\"\n\"\n\n\tif test yes = \"$fast_install\"; then\n\t  $ECHO \"\\\n  program=lt-'$outputname'$exeext\n  progdir=\\\"\\$thisdir/$objdir\\\"\n\n  if test ! -f \\\"\\$progdir/\\$program\\\" ||\n     { file=\\`ls -1dt \\\"\\$progdir/\\$program\\\" \\\"\\$progdir/../\\$program\\\" 2>/dev/null | $SED 1q\\`; \\\\\n       test \\\"X\\$file\\\" != \\\"X\\$progdir/\\$program\\\"; }; then\n\n    file=\\\"\\$\\$-\\$program\\\"\n\n    if test ! -d \\\"\\$progdir\\\"; then\n      $MKDIR \\\"\\$progdir\\\"\n    else\n      $RM \\\"\\$progdir/\\$file\\\"\n    fi\"\n\n\t  $ECHO \"\\\n\n    # relink executable if necessary\n    if test -n \\\"\\$relink_command\\\"; then\n      if relink_command_output=\\`eval \\$relink_command 2>&1\\`; then :\n      else\n\t\\$ECHO \\\"\\$relink_command_output\\\" >&2\n\t$RM \\\"\\$progdir/\\$file\\\"\n\texit 1\n      fi\n    fi\n\n    $MV \\\"\\$progdir/\\$file\\\" \\\"\\$progdir/\\$program\\\" 2>/dev/null ||\n    { $RM \\\"\\$progdir/\\$program\\\";\n      $MV \\\"\\$progdir/\\$file\\\" \\\"\\$progdir/\\$program\\\"; }\n    $RM \\\"\\$progdir/\\$file\\\"\n  fi\"\n\telse\n\t  $ECHO \"\\\n  program='$outputname'\n  progdir=\\\"\\$thisdir/$objdir\\\"\n\"\n\tfi\n\n\t$ECHO \"\\\n\n  if test -f \\\"\\$progdir/\\$program\\\"; then\"\n\n\t# fixup the dll searchpath if we need to.\n\t#\n\t# Fix the DLL searchpath if we need to.  Do this before prepending\n\t# to shlibpath, because on Windows, both are PATH and uninstalled\n\t# libraries must come first.\n\tif test -n \"$dllsearchpath\"; then\n\t  $ECHO \"\\\n    # Add the dll search path components to the executable PATH\n    PATH=$dllsearchpath:\\$PATH\n\"\n\tfi\n\n\t# Export our shlibpath_var if we have one.\n\tif test yes = \"$shlibpath_overrides_runpath\" && test -n \"$shlibpath_var\" && test -n \"$temp_rpath\"; then\n\t  $ECHO \"\\\n    # Add our own library path to $shlibpath_var\n    $shlibpath_var=\\\"$temp_rpath\\$$shlibpath_var\\\"\n\n    # Some systems cannot cope with colon-terminated $shlibpath_var\n    # The second colon is a workaround for a bug in BeOS R4 sed\n    $shlibpath_var=\\`\\$ECHO \\\"\\$$shlibpath_var\\\" | $SED 's/::*\\$//'\\`\n\n    export $shlibpath_var\n\"\n\tfi\n\n\t$ECHO \"\\\n    if test \\\"\\$libtool_execute_magic\\\" != \\\"$magic\\\"; then\n      # Run the actual program with our arguments.\n      func_exec_program \\${1+\\\"\\$@\\\"}\n    fi\n  else\n    # The program doesn't exist.\n    \\$ECHO \\\"\\$0: error: '\\$progdir/\\$program' does not exist\\\" 1>&2\n    \\$ECHO \\\"This script is just a wrapper for \\$program.\\\" 1>&2\n    \\$ECHO \\\"See the $PACKAGE documentation for more information.\\\" 1>&2\n    exit 1\n  fi\nfi\\\n\"\n}\n\n\n# func_emit_cwrapperexe_src\n# emit the source code for a wrapper executable on stdout\n# Must ONLY be called from within func_mode_link because\n# it depends on a number of variable set therein.\nfunc_emit_cwrapperexe_src ()\n{\n\tcat <<EOF\n\n/* $cwrappersource - temporary wrapper executable for $objdir/$outputname\n   Generated by $PROGRAM (GNU $PACKAGE) $VERSION\n\n   The $output program cannot be directly executed until all the libtool\n   libraries that it depends on are installed.\n\n   This wrapper executable should never be moved out of the build directory.\n   If it is, it will not operate correctly.\n*/\nEOF\n\t    cat <<\"EOF\"\n#ifdef _MSC_VER\n# define _CRT_SECURE_NO_DEPRECATE 1\n#endif\n#include <stdio.h>\n#include <stdlib.h>\n#ifdef _MSC_VER\n# include <direct.h>\n# include <process.h>\n# include <io.h>\n#else\n# include <unistd.h>\n# include <stdint.h>\n# ifdef __CYGWIN__\n#  include <io.h>\n# endif\n#endif\n#include <malloc.h>\n#include <stdarg.h>\n#include <assert.h>\n#include <string.h>\n#include <ctype.h>\n#include <errno.h>\n#include <fcntl.h>\n#include <sys/stat.h>\n\n#define STREQ(s1, s2) (strcmp ((s1), (s2)) == 0)\n\n/* declarations of non-ANSI functions */\n#if defined __MINGW32__\n# ifdef __STRICT_ANSI__\nint _putenv (const char *);\n# endif\n#elif defined __CYGWIN__\n# ifdef __STRICT_ANSI__\nchar *realpath (const char *, char *);\nint putenv (char *);\nint setenv (const char *, const char *, int);\n# endif\n/* #elif defined other_platform || defined ... */\n#endif\n\n/* portability defines, excluding path handling macros */\n#if defined _MSC_VER\n# define setmode _setmode\n# define stat    _stat\n# define chmod   _chmod\n# define getcwd  _getcwd\n# define putenv  _putenv\n# define S_IXUSR _S_IEXEC\n#elif defined __MINGW32__\n# define setmode _setmode\n# define stat    _stat\n# define chmod   _chmod\n# define getcwd  _getcwd\n# define putenv  _putenv\n#elif defined __CYGWIN__\n# define HAVE_SETENV\n# define FOPEN_WB \"wb\"\n/* #elif defined other platforms ... */\n#endif\n\n#if defined PATH_MAX\n# define LT_PATHMAX PATH_MAX\n#elif defined MAXPATHLEN\n# define LT_PATHMAX MAXPATHLEN\n#else\n# define LT_PATHMAX 1024\n#endif\n\n#ifndef S_IXOTH\n# define S_IXOTH 0\n#endif\n#ifndef S_IXGRP\n# define S_IXGRP 0\n#endif\n\n/* path handling portability macros */\n#ifndef DIR_SEPARATOR\n# define DIR_SEPARATOR '/'\n# define PATH_SEPARATOR ':'\n#endif\n\n#if defined _WIN32 || defined __MSDOS__ || defined __DJGPP__ || \\\n  defined __OS2__\n# define HAVE_DOS_BASED_FILE_SYSTEM\n# define FOPEN_WB \"wb\"\n# ifndef DIR_SEPARATOR_2\n#  define DIR_SEPARATOR_2 '\\\\'\n# endif\n# ifndef PATH_SEPARATOR_2\n#  define PATH_SEPARATOR_2 ';'\n# endif\n#endif\n\n#ifndef DIR_SEPARATOR_2\n# define IS_DIR_SEPARATOR(ch) ((ch) == DIR_SEPARATOR)\n#else /* DIR_SEPARATOR_2 */\n# define IS_DIR_SEPARATOR(ch) \\\n\t(((ch) == DIR_SEPARATOR) || ((ch) == DIR_SEPARATOR_2))\n#endif /* DIR_SEPARATOR_2 */\n\n#ifndef PATH_SEPARATOR_2\n# define IS_PATH_SEPARATOR(ch) ((ch) == PATH_SEPARATOR)\n#else /* PATH_SEPARATOR_2 */\n# define IS_PATH_SEPARATOR(ch) ((ch) == PATH_SEPARATOR_2)\n#endif /* PATH_SEPARATOR_2 */\n\n#ifndef FOPEN_WB\n# define FOPEN_WB \"w\"\n#endif\n#ifndef _O_BINARY\n# define _O_BINARY 0\n#endif\n\n#define XMALLOC(type, num)      ((type *) xmalloc ((num) * sizeof(type)))\n#define XFREE(stale) do { \\\n  if (stale) { free (stale); stale = 0; } \\\n} while (0)\n\n#if defined LT_DEBUGWRAPPER\nstatic int lt_debug = 1;\n#else\nstatic int lt_debug = 0;\n#endif\n\nconst char *program_name = \"libtool-wrapper\"; /* in case xstrdup fails */\n\nvoid *xmalloc (size_t num);\nchar *xstrdup (const char *string);\nconst char *base_name (const char *name);\nchar *find_executable (const char *wrapper);\nchar *chase_symlinks (const char *pathspec);\nint make_executable (const char *path);\nint check_executable (const char *path);\nchar *strendzap (char *str, const char *pat);\nvoid lt_debugprintf (const char *file, int line, const char *fmt, ...);\nvoid lt_fatal (const char *file, int line, const char *message, ...);\nstatic const char *nonnull (const char *s);\nstatic const char *nonempty (const char *s);\nvoid lt_setenv (const char *name, const char *value);\nchar *lt_extend_str (const char *orig_value, const char *add, int to_end);\nvoid lt_update_exe_path (const char *name, const char *value);\nvoid lt_update_lib_path (const char *name, const char *value);\nchar **prepare_spawn (char **argv);\nvoid lt_dump_script (FILE *f);\nEOF\n\n\t    cat <<EOF\n#if __GNUC__ < 4 || (__GNUC__ == 4 && __GNUC_MINOR__ < 5)\n# define externally_visible volatile\n#else\n# define externally_visible __attribute__((externally_visible)) volatile\n#endif\nexternally_visible const char * MAGIC_EXE = \"$magic_exe\";\nconst char * LIB_PATH_VARNAME = \"$shlibpath_var\";\nEOF\n\n\t    if test yes = \"$shlibpath_overrides_runpath\" && test -n \"$shlibpath_var\" && test -n \"$temp_rpath\"; then\n              func_to_host_path \"$temp_rpath\"\n\t      cat <<EOF\nconst char * LIB_PATH_VALUE   = \"$func_to_host_path_result\";\nEOF\n\t    else\n\t      cat <<\"EOF\"\nconst char * LIB_PATH_VALUE   = \"\";\nEOF\n\t    fi\n\n\t    if test -n \"$dllsearchpath\"; then\n              func_to_host_path \"$dllsearchpath:\"\n\t      cat <<EOF\nconst char * EXE_PATH_VARNAME = \"PATH\";\nconst char * EXE_PATH_VALUE   = \"$func_to_host_path_result\";\nEOF\n\t    else\n\t      cat <<\"EOF\"\nconst char * EXE_PATH_VARNAME = \"\";\nconst char * EXE_PATH_VALUE   = \"\";\nEOF\n\t    fi\n\n\t    if test yes = \"$fast_install\"; then\n\t      cat <<EOF\nconst char * TARGET_PROGRAM_NAME = \"lt-$outputname\"; /* hopefully, no .exe */\nEOF\n\t    else\n\t      cat <<EOF\nconst char * TARGET_PROGRAM_NAME = \"$outputname\"; /* hopefully, no .exe */\nEOF\n\t    fi\n\n\n\t    cat <<\"EOF\"\n\n#define LTWRAPPER_OPTION_PREFIX         \"--lt-\"\n\nstatic const char *ltwrapper_option_prefix = LTWRAPPER_OPTION_PREFIX;\nstatic const char *dumpscript_opt       = LTWRAPPER_OPTION_PREFIX \"dump-script\";\nstatic const char *debug_opt            = LTWRAPPER_OPTION_PREFIX \"debug\";\n\nint\nmain (int argc, char *argv[])\n{\n  char **newargz;\n  int  newargc;\n  char *tmp_pathspec;\n  char *actual_cwrapper_path;\n  char *actual_cwrapper_name;\n  char *target_name;\n  char *lt_argv_zero;\n  int rval = 127;\n\n  int i;\n\n  program_name = (char *) xstrdup (base_name (argv[0]));\n  newargz = XMALLOC (char *, (size_t) argc + 1);\n\n  /* very simple arg parsing; don't want to rely on getopt\n   * also, copy all non cwrapper options to newargz, except\n   * argz[0], which is handled differently\n   */\n  newargc=0;\n  for (i = 1; i < argc; i++)\n    {\n      if (STREQ (argv[i], dumpscript_opt))\n\t{\nEOF\n\t    case $host in\n\t      *mingw* | *cygwin* )\n\t\t# make stdout use \"unix\" line endings\n\t\techo \"          setmode(1,_O_BINARY);\"\n\t\t;;\n\t      esac\n\n\t    cat <<\"EOF\"\n\t  lt_dump_script (stdout);\n\t  return 0;\n\t}\n      if (STREQ (argv[i], debug_opt))\n\t{\n          lt_debug = 1;\n          continue;\n\t}\n      if (STREQ (argv[i], ltwrapper_option_prefix))\n        {\n          /* however, if there is an option in the LTWRAPPER_OPTION_PREFIX\n             namespace, but it is not one of the ones we know about and\n             have already dealt with, above (inluding dump-script), then\n             report an error. Otherwise, targets might begin to believe\n             they are allowed to use options in the LTWRAPPER_OPTION_PREFIX\n             namespace. The first time any user complains about this, we'll\n             need to make LTWRAPPER_OPTION_PREFIX a configure-time option\n             or a configure.ac-settable value.\n           */\n          lt_fatal (__FILE__, __LINE__,\n\t\t    \"unrecognized %s option: '%s'\",\n                    ltwrapper_option_prefix, argv[i]);\n        }\n      /* otherwise ... */\n      newargz[++newargc] = xstrdup (argv[i]);\n    }\n  newargz[++newargc] = NULL;\n\nEOF\n\t    cat <<EOF\n  /* The GNU banner must be the first non-error debug message */\n  lt_debugprintf (__FILE__, __LINE__, \"libtool wrapper (GNU $PACKAGE) $VERSION\\n\");\nEOF\n\t    cat <<\"EOF\"\n  lt_debugprintf (__FILE__, __LINE__, \"(main) argv[0]: %s\\n\", argv[0]);\n  lt_debugprintf (__FILE__, __LINE__, \"(main) program_name: %s\\n\", program_name);\n\n  tmp_pathspec = find_executable (argv[0]);\n  if (tmp_pathspec == NULL)\n    lt_fatal (__FILE__, __LINE__, \"couldn't find %s\", argv[0]);\n  lt_debugprintf (__FILE__, __LINE__,\n                  \"(main) found exe (before symlink chase) at: %s\\n\",\n\t\t  tmp_pathspec);\n\n  actual_cwrapper_path = chase_symlinks (tmp_pathspec);\n  lt_debugprintf (__FILE__, __LINE__,\n                  \"(main) found exe (after symlink chase) at: %s\\n\",\n\t\t  actual_cwrapper_path);\n  XFREE (tmp_pathspec);\n\n  actual_cwrapper_name = xstrdup (base_name (actual_cwrapper_path));\n  strendzap (actual_cwrapper_path, actual_cwrapper_name);\n\n  /* wrapper name transforms */\n  strendzap (actual_cwrapper_name, \".exe\");\n  tmp_pathspec = lt_extend_str (actual_cwrapper_name, \".exe\", 1);\n  XFREE (actual_cwrapper_name);\n  actual_cwrapper_name = tmp_pathspec;\n  tmp_pathspec = 0;\n\n  /* target_name transforms -- use actual target program name; might have lt- prefix */\n  target_name = xstrdup (base_name (TARGET_PROGRAM_NAME));\n  strendzap (target_name, \".exe\");\n  tmp_pathspec = lt_extend_str (target_name, \".exe\", 1);\n  XFREE (target_name);\n  target_name = tmp_pathspec;\n  tmp_pathspec = 0;\n\n  lt_debugprintf (__FILE__, __LINE__,\n\t\t  \"(main) libtool target name: %s\\n\",\n\t\t  target_name);\nEOF\n\n\t    cat <<EOF\n  newargz[0] =\n    XMALLOC (char, (strlen (actual_cwrapper_path) +\n\t\t    strlen (\"$objdir\") + 1 + strlen (actual_cwrapper_name) + 1));\n  strcpy (newargz[0], actual_cwrapper_path);\n  strcat (newargz[0], \"$objdir\");\n  strcat (newargz[0], \"/\");\nEOF\n\n\t    cat <<\"EOF\"\n  /* stop here, and copy so we don't have to do this twice */\n  tmp_pathspec = xstrdup (newargz[0]);\n\n  /* do NOT want the lt- prefix here, so use actual_cwrapper_name */\n  strcat (newargz[0], actual_cwrapper_name);\n\n  /* DO want the lt- prefix here if it exists, so use target_name */\n  lt_argv_zero = lt_extend_str (tmp_pathspec, target_name, 1);\n  XFREE (tmp_pathspec);\n  tmp_pathspec = NULL;\nEOF\n\n\t    case $host_os in\n\t      mingw*)\n\t    cat <<\"EOF\"\n  {\n    char* p;\n    while ((p = strchr (newargz[0], '\\\\')) != NULL)\n      {\n\t*p = '/';\n      }\n    while ((p = strchr (lt_argv_zero, '\\\\')) != NULL)\n      {\n\t*p = '/';\n      }\n  }\nEOF\n\t    ;;\n\t    esac\n\n\t    cat <<\"EOF\"\n  XFREE (target_name);\n  XFREE (actual_cwrapper_path);\n  XFREE (actual_cwrapper_name);\n\n  lt_setenv (\"BIN_SH\", \"xpg4\"); /* for Tru64 */\n  lt_setenv (\"DUALCASE\", \"1\");  /* for MSK sh */\n  /* Update the DLL searchpath.  EXE_PATH_VALUE ($dllsearchpath) must\n     be prepended before (that is, appear after) LIB_PATH_VALUE ($temp_rpath)\n     because on Windows, both *_VARNAMEs are PATH but uninstalled\n     libraries must come first. */\n  lt_update_exe_path (EXE_PATH_VARNAME, EXE_PATH_VALUE);\n  lt_update_lib_path (LIB_PATH_VARNAME, LIB_PATH_VALUE);\n\n  lt_debugprintf (__FILE__, __LINE__, \"(main) lt_argv_zero: %s\\n\",\n\t\t  nonnull (lt_argv_zero));\n  for (i = 0; i < newargc; i++)\n    {\n      lt_debugprintf (__FILE__, __LINE__, \"(main) newargz[%d]: %s\\n\",\n\t\t      i, nonnull (newargz[i]));\n    }\n\nEOF\n\n\t    case $host_os in\n\t      mingw*)\n\t\tcat <<\"EOF\"\n  /* execv doesn't actually work on mingw as expected on unix */\n  newargz = prepare_spawn (newargz);\n  rval = (int) _spawnv (_P_WAIT, lt_argv_zero, (const char * const *) newargz);\n  if (rval == -1)\n    {\n      /* failed to start process */\n      lt_debugprintf (__FILE__, __LINE__,\n\t\t      \"(main) failed to launch target \\\"%s\\\": %s\\n\",\n\t\t      lt_argv_zero, nonnull (strerror (errno)));\n      return 127;\n    }\n  return rval;\nEOF\n\t\t;;\n\t      *)\n\t\tcat <<\"EOF\"\n  execv (lt_argv_zero, newargz);\n  return rval; /* =127, but avoids unused variable warning */\nEOF\n\t\t;;\n\t    esac\n\n\t    cat <<\"EOF\"\n}\n\nvoid *\nxmalloc (size_t num)\n{\n  void *p = (void *) malloc (num);\n  if (!p)\n    lt_fatal (__FILE__, __LINE__, \"memory exhausted\");\n\n  return p;\n}\n\nchar *\nxstrdup (const char *string)\n{\n  return string ? strcpy ((char *) xmalloc (strlen (string) + 1),\n\t\t\t  string) : NULL;\n}\n\nconst char *\nbase_name (const char *name)\n{\n  const char *base;\n\n#if defined HAVE_DOS_BASED_FILE_SYSTEM\n  /* Skip over the disk name in MSDOS pathnames. */\n  if (isalpha ((unsigned char) name[0]) && name[1] == ':')\n    name += 2;\n#endif\n\n  for (base = name; *name; name++)\n    if (IS_DIR_SEPARATOR (*name))\n      base = name + 1;\n  return base;\n}\n\nint\ncheck_executable (const char *path)\n{\n  struct stat st;\n\n  lt_debugprintf (__FILE__, __LINE__, \"(check_executable): %s\\n\",\n                  nonempty (path));\n  if ((!path) || (!*path))\n    return 0;\n\n  if ((stat (path, &st) >= 0)\n      && (st.st_mode & (S_IXUSR | S_IXGRP | S_IXOTH)))\n    return 1;\n  else\n    return 0;\n}\n\nint\nmake_executable (const char *path)\n{\n  int rval = 0;\n  struct stat st;\n\n  lt_debugprintf (__FILE__, __LINE__, \"(make_executable): %s\\n\",\n                  nonempty (path));\n  if ((!path) || (!*path))\n    return 0;\n\n  if (stat (path, &st) >= 0)\n    {\n      rval = chmod (path, st.st_mode | S_IXOTH | S_IXGRP | S_IXUSR);\n    }\n  return rval;\n}\n\n/* Searches for the full path of the wrapper.  Returns\n   newly allocated full path name if found, NULL otherwise\n   Does not chase symlinks, even on platforms that support them.\n*/\nchar *\nfind_executable (const char *wrapper)\n{\n  int has_slash = 0;\n  const char *p;\n  const char *p_next;\n  /* static buffer for getcwd */\n  char tmp[LT_PATHMAX + 1];\n  size_t tmp_len;\n  char *concat_name;\n\n  lt_debugprintf (__FILE__, __LINE__, \"(find_executable): %s\\n\",\n                  nonempty (wrapper));\n\n  if ((wrapper == NULL) || (*wrapper == '\\0'))\n    return NULL;\n\n  /* Absolute path? */\n#if defined HAVE_DOS_BASED_FILE_SYSTEM\n  if (isalpha ((unsigned char) wrapper[0]) && wrapper[1] == ':')\n    {\n      concat_name = xstrdup (wrapper);\n      if (check_executable (concat_name))\n\treturn concat_name;\n      XFREE (concat_name);\n    }\n  else\n    {\n#endif\n      if (IS_DIR_SEPARATOR (wrapper[0]))\n\t{\n\t  concat_name = xstrdup (wrapper);\n\t  if (check_executable (concat_name))\n\t    return concat_name;\n\t  XFREE (concat_name);\n\t}\n#if defined HAVE_DOS_BASED_FILE_SYSTEM\n    }\n#endif\n\n  for (p = wrapper; *p; p++)\n    if (*p == '/')\n      {\n\thas_slash = 1;\n\tbreak;\n      }\n  if (!has_slash)\n    {\n      /* no slashes; search PATH */\n      const char *path = getenv (\"PATH\");\n      if (path != NULL)\n\t{\n\t  for (p = path; *p; p = p_next)\n\t    {\n\t      const char *q;\n\t      size_t p_len;\n\t      for (q = p; *q; q++)\n\t\tif (IS_PATH_SEPARATOR (*q))\n\t\t  break;\n\t      p_len = (size_t) (q - p);\n\t      p_next = (*q == '\\0' ? q : q + 1);\n\t      if (p_len == 0)\n\t\t{\n\t\t  /* empty path: current directory */\n\t\t  if (getcwd (tmp, LT_PATHMAX) == NULL)\n\t\t    lt_fatal (__FILE__, __LINE__, \"getcwd failed: %s\",\n                              nonnull (strerror (errno)));\n\t\t  tmp_len = strlen (tmp);\n\t\t  concat_name =\n\t\t    XMALLOC (char, tmp_len + 1 + strlen (wrapper) + 1);\n\t\t  memcpy (concat_name, tmp, tmp_len);\n\t\t  concat_name[tmp_len] = '/';\n\t\t  strcpy (concat_name + tmp_len + 1, wrapper);\n\t\t}\n\t      else\n\t\t{\n\t\t  concat_name =\n\t\t    XMALLOC (char, p_len + 1 + strlen (wrapper) + 1);\n\t\t  memcpy (concat_name, p, p_len);\n\t\t  concat_name[p_len] = '/';\n\t\t  strcpy (concat_name + p_len + 1, wrapper);\n\t\t}\n\t      if (check_executable (concat_name))\n\t\treturn concat_name;\n\t      XFREE (concat_name);\n\t    }\n\t}\n      /* not found in PATH; assume curdir */\n    }\n  /* Relative path | not found in path: prepend cwd */\n  if (getcwd (tmp, LT_PATHMAX) == NULL)\n    lt_fatal (__FILE__, __LINE__, \"getcwd failed: %s\",\n              nonnull (strerror (errno)));\n  tmp_len = strlen (tmp);\n  concat_name = XMALLOC (char, tmp_len + 1 + strlen (wrapper) + 1);\n  memcpy (concat_name, tmp, tmp_len);\n  concat_name[tmp_len] = '/';\n  strcpy (concat_name + tmp_len + 1, wrapper);\n\n  if (check_executable (concat_name))\n    return concat_name;\n  XFREE (concat_name);\n  return NULL;\n}\n\nchar *\nchase_symlinks (const char *pathspec)\n{\n#ifndef S_ISLNK\n  return xstrdup (pathspec);\n#else\n  char buf[LT_PATHMAX];\n  struct stat s;\n  char *tmp_pathspec = xstrdup (pathspec);\n  char *p;\n  int has_symlinks = 0;\n  while (strlen (tmp_pathspec) && !has_symlinks)\n    {\n      lt_debugprintf (__FILE__, __LINE__,\n\t\t      \"checking path component for symlinks: %s\\n\",\n\t\t      tmp_pathspec);\n      if (lstat (tmp_pathspec, &s) == 0)\n\t{\n\t  if (S_ISLNK (s.st_mode) != 0)\n\t    {\n\t      has_symlinks = 1;\n\t      break;\n\t    }\n\n\t  /* search backwards for last DIR_SEPARATOR */\n\t  p = tmp_pathspec + strlen (tmp_pathspec) - 1;\n\t  while ((p > tmp_pathspec) && (!IS_DIR_SEPARATOR (*p)))\n\t    p--;\n\t  if ((p == tmp_pathspec) && (!IS_DIR_SEPARATOR (*p)))\n\t    {\n\t      /* no more DIR_SEPARATORS left */\n\t      break;\n\t    }\n\t  *p = '\\0';\n\t}\n      else\n\t{\n\t  lt_fatal (__FILE__, __LINE__,\n\t\t    \"error accessing file \\\"%s\\\": %s\",\n\t\t    tmp_pathspec, nonnull (strerror (errno)));\n\t}\n    }\n  XFREE (tmp_pathspec);\n\n  if (!has_symlinks)\n    {\n      return xstrdup (pathspec);\n    }\n\n  tmp_pathspec = realpath (pathspec, buf);\n  if (tmp_pathspec == 0)\n    {\n      lt_fatal (__FILE__, __LINE__,\n\t\t\"could not follow symlinks for %s\", pathspec);\n    }\n  return xstrdup (tmp_pathspec);\n#endif\n}\n\nchar *\nstrendzap (char *str, const char *pat)\n{\n  size_t len, patlen;\n\n  assert (str != NULL);\n  assert (pat != NULL);\n\n  len = strlen (str);\n  patlen = strlen (pat);\n\n  if (patlen <= len)\n    {\n      str += len - patlen;\n      if (STREQ (str, pat))\n\t*str = '\\0';\n    }\n  return str;\n}\n\nvoid\nlt_debugprintf (const char *file, int line, const char *fmt, ...)\n{\n  va_list args;\n  if (lt_debug)\n    {\n      (void) fprintf (stderr, \"%s:%s:%d: \", program_name, file, line);\n      va_start (args, fmt);\n      (void) vfprintf (stderr, fmt, args);\n      va_end (args);\n    }\n}\n\nstatic void\nlt_error_core (int exit_status, const char *file,\n\t       int line, const char *mode,\n\t       const char *message, va_list ap)\n{\n  fprintf (stderr, \"%s:%s:%d: %s: \", program_name, file, line, mode);\n  vfprintf (stderr, message, ap);\n  fprintf (stderr, \".\\n\");\n\n  if (exit_status >= 0)\n    exit (exit_status);\n}\n\nvoid\nlt_fatal (const char *file, int line, const char *message, ...)\n{\n  va_list ap;\n  va_start (ap, message);\n  lt_error_core (EXIT_FAILURE, file, line, \"FATAL\", message, ap);\n  va_end (ap);\n}\n\nstatic const char *\nnonnull (const char *s)\n{\n  return s ? s : \"(null)\";\n}\n\nstatic const char *\nnonempty (const char *s)\n{\n  return (s && !*s) ? \"(empty)\" : nonnull (s);\n}\n\nvoid\nlt_setenv (const char *name, const char *value)\n{\n  lt_debugprintf (__FILE__, __LINE__,\n\t\t  \"(lt_setenv) setting '%s' to '%s'\\n\",\n                  nonnull (name), nonnull (value));\n  {\n#ifdef HAVE_SETENV\n    /* always make a copy, for consistency with !HAVE_SETENV */\n    char *str = xstrdup (value);\n    setenv (name, str, 1);\n#else\n    size_t len = strlen (name) + 1 + strlen (value) + 1;\n    char *str = XMALLOC (char, len);\n    sprintf (str, \"%s=%s\", name, value);\n    if (putenv (str) != EXIT_SUCCESS)\n      {\n        XFREE (str);\n      }\n#endif\n  }\n}\n\nchar *\nlt_extend_str (const char *orig_value, const char *add, int to_end)\n{\n  char *new_value;\n  if (orig_value && *orig_value)\n    {\n      size_t orig_value_len = strlen (orig_value);\n      size_t add_len = strlen (add);\n      new_value = XMALLOC (char, add_len + orig_value_len + 1);\n      if (to_end)\n        {\n          strcpy (new_value, orig_value);\n          strcpy (new_value + orig_value_len, add);\n        }\n      else\n        {\n          strcpy (new_value, add);\n          strcpy (new_value + add_len, orig_value);\n        }\n    }\n  else\n    {\n      new_value = xstrdup (add);\n    }\n  return new_value;\n}\n\nvoid\nlt_update_exe_path (const char *name, const char *value)\n{\n  lt_debugprintf (__FILE__, __LINE__,\n\t\t  \"(lt_update_exe_path) modifying '%s' by prepending '%s'\\n\",\n                  nonnull (name), nonnull (value));\n\n  if (name && *name && value && *value)\n    {\n      char *new_value = lt_extend_str (getenv (name), value, 0);\n      /* some systems can't cope with a ':'-terminated path #' */\n      size_t len = strlen (new_value);\n      while ((len > 0) && IS_PATH_SEPARATOR (new_value[len-1]))\n        {\n          new_value[--len] = '\\0';\n        }\n      lt_setenv (name, new_value);\n      XFREE (new_value);\n    }\n}\n\nvoid\nlt_update_lib_path (const char *name, const char *value)\n{\n  lt_debugprintf (__FILE__, __LINE__,\n\t\t  \"(lt_update_lib_path) modifying '%s' by prepending '%s'\\n\",\n                  nonnull (name), nonnull (value));\n\n  if (name && *name && value && *value)\n    {\n      char *new_value = lt_extend_str (getenv (name), value, 0);\n      lt_setenv (name, new_value);\n      XFREE (new_value);\n    }\n}\n\nEOF\n\t    case $host_os in\n\t      mingw*)\n\t\tcat <<\"EOF\"\n\n/* Prepares an argument vector before calling spawn().\n   Note that spawn() does not by itself call the command interpreter\n     (getenv (\"COMSPEC\") != NULL ? getenv (\"COMSPEC\") :\n      ({ OSVERSIONINFO v; v.dwOSVersionInfoSize = sizeof(OSVERSIONINFO);\n         GetVersionEx(&v);\n         v.dwPlatformId == VER_PLATFORM_WIN32_NT;\n      }) ? \"cmd.exe\" : \"command.com\").\n   Instead it simply concatenates the arguments, separated by ' ', and calls\n   CreateProcess().  We must quote the arguments since Win32 CreateProcess()\n   interprets characters like ' ', '\\t', '\\\\', '\"' (but not '<' and '>') in a\n   special way:\n   - Space and tab are interpreted as delimiters. They are not treated as\n     delimiters if they are surrounded by double quotes: \"...\".\n   - Unescaped double quotes are removed from the input. Their only effect is\n     that within double quotes, space and tab are treated like normal\n     characters.\n   - Backslashes not followed by double quotes are not special.\n   - But 2*n+1 backslashes followed by a double quote become\n     n backslashes followed by a double quote (n >= 0):\n       \\\" -> \"\n       \\\\\\\" -> \\\"\n       \\\\\\\\\\\" -> \\\\\"\n */\n#define SHELL_SPECIAL_CHARS \"\\\"\\\\ \\001\\002\\003\\004\\005\\006\\007\\010\\011\\012\\013\\014\\015\\016\\017\\020\\021\\022\\023\\024\\025\\026\\027\\030\\031\\032\\033\\034\\035\\036\\037\"\n#define SHELL_SPACE_CHARS \" \\001\\002\\003\\004\\005\\006\\007\\010\\011\\012\\013\\014\\015\\016\\017\\020\\021\\022\\023\\024\\025\\026\\027\\030\\031\\032\\033\\034\\035\\036\\037\"\nchar **\nprepare_spawn (char **argv)\n{\n  size_t argc;\n  char **new_argv;\n  size_t i;\n\n  /* Count number of arguments.  */\n  for (argc = 0; argv[argc] != NULL; argc++)\n    ;\n\n  /* Allocate new argument vector.  */\n  new_argv = XMALLOC (char *, argc + 1);\n\n  /* Put quoted arguments into the new argument vector.  */\n  for (i = 0; i < argc; i++)\n    {\n      const char *string = argv[i];\n\n      if (string[0] == '\\0')\n\tnew_argv[i] = xstrdup (\"\\\"\\\"\");\n      else if (strpbrk (string, SHELL_SPECIAL_CHARS) != NULL)\n\t{\n\t  int quote_around = (strpbrk (string, SHELL_SPACE_CHARS) != NULL);\n\t  size_t length;\n\t  unsigned int backslashes;\n\t  const char *s;\n\t  char *quoted_string;\n\t  char *p;\n\n\t  length = 0;\n\t  backslashes = 0;\n\t  if (quote_around)\n\t    length++;\n\t  for (s = string; *s != '\\0'; s++)\n\t    {\n\t      char c = *s;\n\t      if (c == '\"')\n\t\tlength += backslashes + 1;\n\t      length++;\n\t      if (c == '\\\\')\n\t\tbackslashes++;\n\t      else\n\t\tbackslashes = 0;\n\t    }\n\t  if (quote_around)\n\t    length += backslashes + 1;\n\n\t  quoted_string = XMALLOC (char, length + 1);\n\n\t  p = quoted_string;\n\t  backslashes = 0;\n\t  if (quote_around)\n\t    *p++ = '\"';\n\t  for (s = string; *s != '\\0'; s++)\n\t    {\n\t      char c = *s;\n\t      if (c == '\"')\n\t\t{\n\t\t  unsigned int j;\n\t\t  for (j = backslashes + 1; j > 0; j--)\n\t\t    *p++ = '\\\\';\n\t\t}\n\t      *p++ = c;\n\t      if (c == '\\\\')\n\t\tbackslashes++;\n\t      else\n\t\tbackslashes = 0;\n\t    }\n\t  if (quote_around)\n\t    {\n\t      unsigned int j;\n\t      for (j = backslashes; j > 0; j--)\n\t\t*p++ = '\\\\';\n\t      *p++ = '\"';\n\t    }\n\t  *p = '\\0';\n\n\t  new_argv[i] = quoted_string;\n\t}\n      else\n\tnew_argv[i] = (char *) string;\n    }\n  new_argv[argc] = NULL;\n\n  return new_argv;\n}\nEOF\n\t\t;;\n\t    esac\n\n            cat <<\"EOF\"\nvoid lt_dump_script (FILE* f)\n{\nEOF\n\t    func_emit_wrapper yes |\n\t      $SED -n -e '\ns/^\\(.\\{79\\}\\)\\(..*\\)/\\1\\\n\\2/\nh\ns/\\([\\\\\"]\\)/\\\\\\1/g\ns/$/\\\\n/\ns/\\([^\\n]*\\).*/  fputs (\"\\1\", f);/p\ng\nD'\n            cat <<\"EOF\"\n}\nEOF\n}\n# end: func_emit_cwrapperexe_src\n\n# func_win32_import_lib_p ARG\n# True if ARG is an import lib, as indicated by $file_magic_cmd\nfunc_win32_import_lib_p ()\n{\n    $debug_cmd\n\n    case `eval $file_magic_cmd \\\"\\$1\\\" 2>/dev/null | $SED -e 10q` in\n    *import*) : ;;\n    *) false ;;\n    esac\n}\n\n# func_suncc_cstd_abi\n# !!ONLY CALL THIS FOR SUN CC AFTER $compile_command IS FULLY EXPANDED!!\n# Several compiler flags select an ABI that is incompatible with the\n# Cstd library. Avoid specifying it if any are in CXXFLAGS.\nfunc_suncc_cstd_abi ()\n{\n    $debug_cmd\n\n    case \" $compile_command \" in\n    *\" -compat=g \"*|*\\ -std=c++[0-9][0-9]\\ *|*\" -library=stdcxx4 \"*|*\" -library=stlport4 \"*)\n      suncc_use_cstd_abi=no\n      ;;\n    *)\n      suncc_use_cstd_abi=yes\n      ;;\n    esac\n}\n\n# func_mode_link arg...\nfunc_mode_link ()\n{\n    $debug_cmd\n\n    case $host in\n    *-*-cygwin* | *-*-mingw* | *-*-pw32* | *-*-os2* | *-cegcc*)\n      # It is impossible to link a dll without this setting, and\n      # we shouldn't force the makefile maintainer to figure out\n      # what system we are compiling for in order to pass an extra\n      # flag for every libtool invocation.\n      # allow_undefined=no\n\n      # FIXME: Unfortunately, there are problems with the above when trying\n      # to make a dll that has undefined symbols, in which case not\n      # even a static library is built.  For now, we need to specify\n      # -no-undefined on the libtool link line when we can be certain\n      # that all symbols are satisfied, otherwise we get a static library.\n      allow_undefined=yes\n      ;;\n    *)\n      allow_undefined=yes\n      ;;\n    esac\n    libtool_args=$nonopt\n    base_compile=\"$nonopt $@\"\n    compile_command=$nonopt\n    finalize_command=$nonopt\n\n    compile_rpath=\n    finalize_rpath=\n    compile_shlibpath=\n    finalize_shlibpath=\n    convenience=\n    old_convenience=\n    deplibs=\n    old_deplibs=\n    compiler_flags=\n    linker_flags=\n    dllsearchpath=\n    lib_search_path=`pwd`\n    inst_prefix_dir=\n    new_inherited_linker_flags=\n\n    avoid_version=no\n    bindir=\n    dlfiles=\n    dlprefiles=\n    dlself=no\n    export_dynamic=no\n    export_symbols=\n    export_symbols_regex=\n    generated=\n    libobjs=\n    ltlibs=\n    module=no\n    no_install=no\n    objs=\n    os2dllname=\n    non_pic_objects=\n    precious_files_regex=\n    prefer_static_libs=no\n    preload=false\n    prev=\n    prevarg=\n    release=\n    rpath=\n    xrpath=\n    perm_rpath=\n    temp_rpath=\n    thread_safe=no\n    vinfo=\n    vinfo_number=no\n    weak_libs=\n    single_module=$wl-single_module\n    func_infer_tag $base_compile\n\n    # We need to know -static, to get the right output filenames.\n    for arg\n    do\n      case $arg in\n      -shared)\n\ttest yes != \"$build_libtool_libs\" \\\n\t  && func_fatal_configuration \"cannot build a shared library\"\n\tbuild_old_libs=no\n\tbreak\n\t;;\n      -all-static | -static | -static-libtool-libs)\n\tcase $arg in\n\t-all-static)\n\t  if test yes = \"$build_libtool_libs\" && test -z \"$link_static_flag\"; then\n\t    func_warning \"complete static linking is impossible in this configuration\"\n\t  fi\n\t  if test -n \"$link_static_flag\"; then\n\t    dlopen_self=$dlopen_self_static\n\t  fi\n\t  prefer_static_libs=yes\n\t  ;;\n\t-static)\n\t  if test -z \"$pic_flag\" && test -n \"$link_static_flag\"; then\n\t    dlopen_self=$dlopen_self_static\n\t  fi\n\t  prefer_static_libs=built\n\t  ;;\n\t-static-libtool-libs)\n\t  if test -z \"$pic_flag\" && test -n \"$link_static_flag\"; then\n\t    dlopen_self=$dlopen_self_static\n\t  fi\n\t  prefer_static_libs=yes\n\t  ;;\n\tesac\n\tbuild_libtool_libs=no\n\tbuild_old_libs=yes\n\tbreak\n\t;;\n      esac\n    done\n\n    # See if our shared archives depend on static archives.\n    test -n \"$old_archive_from_new_cmds\" && build_old_libs=yes\n\n    # Go through the arguments, transforming them on the way.\n    while test \"$#\" -gt 0; do\n      arg=$1\n      shift\n      func_quote_for_eval \"$arg\"\n      qarg=$func_quote_for_eval_unquoted_result\n      func_append libtool_args \" $func_quote_for_eval_result\"\n\n      # If the previous option needs an argument, assign it.\n      if test -n \"$prev\"; then\n\tcase $prev in\n\toutput)\n\t  func_append compile_command \" @OUTPUT@\"\n\t  func_append finalize_command \" @OUTPUT@\"\n\t  ;;\n\tesac\n\n\tcase $prev in\n\tbindir)\n\t  bindir=$arg\n\t  prev=\n\t  continue\n\t  ;;\n\tdlfiles|dlprefiles)\n\t  $preload || {\n\t    # Add the symbol object into the linking commands.\n\t    func_append compile_command \" @SYMFILE@\"\n\t    func_append finalize_command \" @SYMFILE@\"\n\t    preload=:\n\t  }\n\t  case $arg in\n\t  *.la | *.lo) ;;  # We handle these cases below.\n\t  force)\n\t    if test no = \"$dlself\"; then\n\t      dlself=needless\n\t      export_dynamic=yes\n\t    fi\n\t    prev=\n\t    continue\n\t    ;;\n\t  self)\n\t    if test dlprefiles = \"$prev\"; then\n\t      dlself=yes\n\t    elif test dlfiles = \"$prev\" && test yes != \"$dlopen_self\"; then\n\t      dlself=yes\n\t    else\n\t      dlself=needless\n\t      export_dynamic=yes\n\t    fi\n\t    prev=\n\t    continue\n\t    ;;\n\t  *)\n\t    if test dlfiles = \"$prev\"; then\n\t      func_append dlfiles \" $arg\"\n\t    else\n\t      func_append dlprefiles \" $arg\"\n\t    fi\n\t    prev=\n\t    continue\n\t    ;;\n\t  esac\n\t  ;;\n\texpsyms)\n\t  export_symbols=$arg\n\t  test -f \"$arg\" \\\n\t    || func_fatal_error \"symbol file '$arg' does not exist\"\n\t  prev=\n\t  continue\n\t  ;;\n\texpsyms_regex)\n\t  export_symbols_regex=$arg\n\t  prev=\n\t  continue\n\t  ;;\n\tframework)\n\t  case $host in\n\t    *-*-darwin*)\n\t      case \"$deplibs \" in\n\t\t*\" $qarg.ltframework \"*) ;;\n\t\t*) func_append deplibs \" $qarg.ltframework\" # this is fixed later\n\t\t   ;;\n\t      esac\n\t      ;;\n\t  esac\n\t  prev=\n\t  continue\n\t  ;;\n\tinst_prefix)\n\t  inst_prefix_dir=$arg\n\t  prev=\n\t  continue\n\t  ;;\n\tmllvm)\n\t  # Clang does not use LLVM to link, so we can simply discard any\n\t  # '-mllvm $arg' options when doing the link step.\n\t  prev=\n\t  continue\n\t  ;;\n\tobjectlist)\n\t  if test -f \"$arg\"; then\n\t    save_arg=$arg\n\t    moreargs=\n\t    for fil in `cat \"$save_arg\"`\n\t    do\n#\t      func_append moreargs \" $fil\"\n\t      arg=$fil\n\t      # A libtool-controlled object.\n\n\t      # Check to see that this really is a libtool object.\n\t      if func_lalib_unsafe_p \"$arg\"; then\n\t\tpic_object=\n\t\tnon_pic_object=\n\n\t\t# Read the .lo file\n\t\tfunc_source \"$arg\"\n\n\t\tif test -z \"$pic_object\" ||\n\t\t   test -z \"$non_pic_object\" ||\n\t\t   test none = \"$pic_object\" &&\n\t\t   test none = \"$non_pic_object\"; then\n\t\t  func_fatal_error \"cannot find name of object for '$arg'\"\n\t\tfi\n\n\t\t# Extract subdirectory from the argument.\n\t\tfunc_dirname \"$arg\" \"/\" \"\"\n\t\txdir=$func_dirname_result\n\n\t\tif test none != \"$pic_object\"; then\n\t\t  # Prepend the subdirectory the object is found in.\n\t\t  pic_object=$xdir$pic_object\n\n\t\t  if test dlfiles = \"$prev\"; then\n\t\t    if test yes = \"$build_libtool_libs\" && test yes = \"$dlopen_support\"; then\n\t\t      func_append dlfiles \" $pic_object\"\n\t\t      prev=\n\t\t      continue\n\t\t    else\n\t\t      # If libtool objects are unsupported, then we need to preload.\n\t\t      prev=dlprefiles\n\t\t    fi\n\t\t  fi\n\n\t\t  # CHECK ME:  I think I busted this.  -Ossama\n\t\t  if test dlprefiles = \"$prev\"; then\n\t\t    # Preload the old-style object.\n\t\t    func_append dlprefiles \" $pic_object\"\n\t\t    prev=\n\t\t  fi\n\n\t\t  # A PIC object.\n\t\t  func_append libobjs \" $pic_object\"\n\t\t  arg=$pic_object\n\t\tfi\n\n\t\t# Non-PIC object.\n\t\tif test none != \"$non_pic_object\"; then\n\t\t  # Prepend the subdirectory the object is found in.\n\t\t  non_pic_object=$xdir$non_pic_object\n\n\t\t  # A standard non-PIC object\n\t\t  func_append non_pic_objects \" $non_pic_object\"\n\t\t  if test -z \"$pic_object\" || test none = \"$pic_object\"; then\n\t\t    arg=$non_pic_object\n\t\t  fi\n\t\telse\n\t\t  # If the PIC object exists, use it instead.\n\t\t  # $xdir was prepended to $pic_object above.\n\t\t  non_pic_object=$pic_object\n\t\t  func_append non_pic_objects \" $non_pic_object\"\n\t\tfi\n\t      else\n\t\t# Only an error if not doing a dry-run.\n\t\tif $opt_dry_run; then\n\t\t  # Extract subdirectory from the argument.\n\t\t  func_dirname \"$arg\" \"/\" \"\"\n\t\t  xdir=$func_dirname_result\n\n\t\t  func_lo2o \"$arg\"\n\t\t  pic_object=$xdir$objdir/$func_lo2o_result\n\t\t  non_pic_object=$xdir$func_lo2o_result\n\t\t  func_append libobjs \" $pic_object\"\n\t\t  func_append non_pic_objects \" $non_pic_object\"\n\t        else\n\t\t  func_fatal_error \"'$arg' is not a valid libtool object\"\n\t\tfi\n\t      fi\n\t    done\n\t  else\n\t    func_fatal_error \"link input file '$arg' does not exist\"\n\t  fi\n\t  arg=$save_arg\n\t  prev=\n\t  continue\n\t  ;;\n\tos2dllname)\n\t  os2dllname=$arg\n\t  prev=\n\t  continue\n\t  ;;\n\tprecious_regex)\n\t  precious_files_regex=$arg\n\t  prev=\n\t  continue\n\t  ;;\n\trelease)\n\t  release=-$arg\n\t  prev=\n\t  continue\n\t  ;;\n\trpath | xrpath)\n\t  # We need an absolute path.\n\t  case $arg in\n\t  [\\\\/]* | [A-Za-z]:[\\\\/]*) ;;\n\t  *)\n\t    func_fatal_error \"only absolute run-paths are allowed\"\n\t    ;;\n\t  esac\n\t  if test rpath = \"$prev\"; then\n\t    case \"$rpath \" in\n\t    *\" $arg \"*) ;;\n\t    *) func_append rpath \" $arg\" ;;\n\t    esac\n\t  else\n\t    case \"$xrpath \" in\n\t    *\" $arg \"*) ;;\n\t    *) func_append xrpath \" $arg\" ;;\n\t    esac\n\t  fi\n\t  prev=\n\t  continue\n\t  ;;\n\tshrext)\n\t  shrext_cmds=$arg\n\t  prev=\n\t  continue\n\t  ;;\n\tweak)\n\t  func_append weak_libs \" $arg\"\n\t  prev=\n\t  continue\n\t  ;;\n\txcclinker)\n\t  func_append linker_flags \" $qarg\"\n\t  func_append compiler_flags \" $qarg\"\n\t  prev=\n\t  func_append compile_command \" $qarg\"\n\t  func_append finalize_command \" $qarg\"\n\t  continue\n\t  ;;\n\txcompiler)\n\t  func_append compiler_flags \" $qarg\"\n\t  prev=\n\t  func_append compile_command \" $qarg\"\n\t  func_append finalize_command \" $qarg\"\n\t  continue\n\t  ;;\n\txlinker)\n\t  func_append linker_flags \" $qarg\"\n\t  func_append compiler_flags \" $wl$qarg\"\n\t  prev=\n\t  func_append compile_command \" $wl$qarg\"\n\t  func_append finalize_command \" $wl$qarg\"\n\t  continue\n\t  ;;\n\t*)\n\t  eval \"$prev=\\\"\\$arg\\\"\"\n\t  prev=\n\t  continue\n\t  ;;\n\tesac\n      fi # test -n \"$prev\"\n\n      prevarg=$arg\n\n      case $arg in\n      -all-static)\n\tif test -n \"$link_static_flag\"; then\n\t  # See comment for -static flag below, for more details.\n\t  func_append compile_command \" $link_static_flag\"\n\t  func_append finalize_command \" $link_static_flag\"\n\tfi\n\tcontinue\n\t;;\n\n      -allow-undefined)\n\t# FIXME: remove this flag sometime in the future.\n\tfunc_fatal_error \"'-allow-undefined' must not be used because it is the default\"\n\t;;\n\n      -avoid-version)\n\tavoid_version=yes\n\tcontinue\n\t;;\n\n      -bindir)\n\tprev=bindir\n\tcontinue\n\t;;\n\n      -dlopen)\n\tprev=dlfiles\n\tcontinue\n\t;;\n\n      -dlpreopen)\n\tprev=dlprefiles\n\tcontinue\n\t;;\n\n      -export-dynamic)\n\texport_dynamic=yes\n\tcontinue\n\t;;\n\n      -export-symbols | -export-symbols-regex)\n\tif test -n \"$export_symbols\" || test -n \"$export_symbols_regex\"; then\n\t  func_fatal_error \"more than one -exported-symbols argument is not allowed\"\n\tfi\n\tif test X-export-symbols = \"X$arg\"; then\n\t  prev=expsyms\n\telse\n\t  prev=expsyms_regex\n\tfi\n\tcontinue\n\t;;\n\n      -framework)\n\tprev=framework\n\tcontinue\n\t;;\n\n      -inst-prefix-dir)\n\tprev=inst_prefix\n\tcontinue\n\t;;\n\n      # The native IRIX linker understands -LANG:*, -LIST:* and -LNO:*\n      # so, if we see these flags be careful not to treat them like -L\n      -L[A-Z][A-Z]*:*)\n\tcase $with_gcc/$host in\n\tno/*-*-irix* | /*-*-irix*)\n\t  func_append compile_command \" $arg\"\n\t  func_append finalize_command \" $arg\"\n\t  ;;\n\tesac\n\tcontinue\n\t;;\n\n      -L*)\n\tfunc_stripname \"-L\" '' \"$arg\"\n\tif test -z \"$func_stripname_result\"; then\n\t  if test \"$#\" -gt 0; then\n\t    func_fatal_error \"require no space between '-L' and '$1'\"\n\t  else\n\t    func_fatal_error \"need path for '-L' option\"\n\t  fi\n\tfi\n\tfunc_resolve_sysroot \"$func_stripname_result\"\n\tdir=$func_resolve_sysroot_result\n\t# We need an absolute path.\n\tcase $dir in\n\t[\\\\/]* | [A-Za-z]:[\\\\/]*) ;;\n\t*)\n\t  absdir=`cd \"$dir\" && pwd`\n\t  test -z \"$absdir\" && \\\n\t    func_fatal_error \"cannot determine absolute directory name of '$dir'\"\n\t  dir=$absdir\n\t  ;;\n\tesac\n\tcase \"$deplibs \" in\n\t*\" -L$dir \"* | *\" $arg \"*)\n\t  # Will only happen for absolute or sysroot arguments\n\t  ;;\n\t*)\n\t  # Preserve sysroot, but never include relative directories\n\t  case $dir in\n\t    [\\\\/]* | [A-Za-z]:[\\\\/]* | =*) func_append deplibs \" $arg\" ;;\n\t    *) func_append deplibs \" -L$dir\" ;;\n\t  esac\n\t  func_append lib_search_path \" $dir\"\n\t  ;;\n\tesac\n\tcase $host in\n\t*-*-cygwin* | *-*-mingw* | *-*-pw32* | *-*-os2* | *-cegcc*)\n\t  testbindir=`$ECHO \"$dir\" | $SED 's*/lib$*/bin*'`\n\t  case :$dllsearchpath: in\n\t  *\":$dir:\"*) ;;\n\t  ::) dllsearchpath=$dir;;\n\t  *) func_append dllsearchpath \":$dir\";;\n\t  esac\n\t  case :$dllsearchpath: in\n\t  *\":$testbindir:\"*) ;;\n\t  ::) dllsearchpath=$testbindir;;\n\t  *) func_append dllsearchpath \":$testbindir\";;\n\t  esac\n\t  ;;\n\tesac\n\tcontinue\n\t;;\n\n      -l*)\n\tif test X-lc = \"X$arg\" || test X-lm = \"X$arg\"; then\n\t  case $host in\n\t  *-*-cygwin* | *-*-mingw* | *-*-pw32* | *-*-beos* | *-cegcc* | *-*-haiku*)\n\t    # These systems don't actually have a C or math library (as such)\n\t    continue\n\t    ;;\n\t  *-*-os2*)\n\t    # These systems don't actually have a C library (as such)\n\t    test X-lc = \"X$arg\" && continue\n\t    ;;\n\t  *-*-openbsd* | *-*-freebsd* | *-*-dragonfly* | *-*-bitrig*)\n\t    # Do not include libc due to us having libc/libc_r.\n\t    test X-lc = \"X$arg\" && continue\n\t    ;;\n\t  *-*-rhapsody* | *-*-darwin1.[012])\n\t    # Rhapsody C and math libraries are in the System framework\n\t    func_append deplibs \" System.ltframework\"\n\t    continue\n\t    ;;\n\t  *-*-sco3.2v5* | *-*-sco5v6*)\n\t    # Causes problems with __ctype\n\t    test X-lc = \"X$arg\" && continue\n\t    ;;\n\t  *-*-sysv4.2uw2* | *-*-sysv5* | *-*-unixware* | *-*-OpenUNIX*)\n\t    # Compiler inserts libc in the correct place for threads to work\n\t    test X-lc = \"X$arg\" && continue\n\t    ;;\n\t  esac\n\telif test X-lc_r = \"X$arg\"; then\n\t case $host in\n\t *-*-openbsd* | *-*-freebsd* | *-*-dragonfly* | *-*-bitrig*)\n\t   # Do not include libc_r directly, use -pthread flag.\n\t   continue\n\t   ;;\n\t esac\n\tfi\n\tfunc_append deplibs \" $arg\"\n\tcontinue\n\t;;\n\n      -mllvm)\n\tprev=mllvm\n\tcontinue\n\t;;\n\n      -module)\n\tmodule=yes\n\tcontinue\n\t;;\n\n      # Tru64 UNIX uses -model [arg] to determine the layout of C++\n      # classes, name mangling, and exception handling.\n      # Darwin uses the -arch flag to determine output architecture.\n      -model|-arch|-isysroot|--sysroot)\n\tfunc_append compiler_flags \" $arg\"\n\tfunc_append compile_command \" $arg\"\n\tfunc_append finalize_command \" $arg\"\n\tprev=xcompiler\n\tcontinue\n\t;;\n\n      -mt|-mthreads|-kthread|-Kthread|-pthread|-pthreads|--thread-safe \\\n      |-threads|-fopenmp|-openmp|-mp|-xopenmp|-omp|-qsmp=*)\n\tfunc_append compiler_flags \" $arg\"\n\tfunc_append compile_command \" $arg\"\n\tfunc_append finalize_command \" $arg\"\n\tcase \"$new_inherited_linker_flags \" in\n\t    *\" $arg \"*) ;;\n\t    * ) func_append new_inherited_linker_flags \" $arg\" ;;\n\tesac\n\tcontinue\n\t;;\n\n      -multi_module)\n\tsingle_module=$wl-multi_module\n\tcontinue\n\t;;\n\n      -no-fast-install)\n\tfast_install=no\n\tcontinue\n\t;;\n\n      -no-install)\n\tcase $host in\n\t*-*-cygwin* | *-*-mingw* | *-*-pw32* | *-*-os2* | *-*-darwin* | *-cegcc*)\n\t  # The PATH hackery in wrapper scripts is required on Windows\n\t  # and Darwin in order for the loader to find any dlls it needs.\n\t  func_warning \"'-no-install' is ignored for $host\"\n\t  func_warning \"assuming '-no-fast-install' instead\"\n\t  fast_install=no\n\t  ;;\n\t*) no_install=yes ;;\n\tesac\n\tcontinue\n\t;;\n\n      -no-undefined)\n\tallow_undefined=no\n\tcontinue\n\t;;\n\n      -objectlist)\n\tprev=objectlist\n\tcontinue\n\t;;\n\n      -os2dllname)\n\tprev=os2dllname\n\tcontinue\n\t;;\n\n      -o) prev=output ;;\n\n      -precious-files-regex)\n\tprev=precious_regex\n\tcontinue\n\t;;\n\n      -release)\n\tprev=release\n\tcontinue\n\t;;\n\n      -rpath)\n\tprev=rpath\n\tcontinue\n\t;;\n\n      -R)\n\tprev=xrpath\n\tcontinue\n\t;;\n\n      -R*)\n\tfunc_stripname '-R' '' \"$arg\"\n\tdir=$func_stripname_result\n\t# We need an absolute path.\n\tcase $dir in\n\t[\\\\/]* | [A-Za-z]:[\\\\/]*) ;;\n\t=*)\n\t  func_stripname '=' '' \"$dir\"\n\t  dir=$lt_sysroot$func_stripname_result\n\t  ;;\n\t*)\n\t  func_fatal_error \"only absolute run-paths are allowed\"\n\t  ;;\n\tesac\n\tcase \"$xrpath \" in\n\t*\" $dir \"*) ;;\n\t*) func_append xrpath \" $dir\" ;;\n\tesac\n\tcontinue\n\t;;\n\n      -shared)\n\t# The effects of -shared are defined in a previous loop.\n\tcontinue\n\t;;\n\n      -shrext)\n\tprev=shrext\n\tcontinue\n\t;;\n\n      -static | -static-libtool-libs)\n\t# The effects of -static are defined in a previous loop.\n\t# We used to do the same as -all-static on platforms that\n\t# didn't have a PIC flag, but the assumption that the effects\n\t# would be equivalent was wrong.  It would break on at least\n\t# Digital Unix and AIX.\n\tcontinue\n\t;;\n\n      -thread-safe)\n\tthread_safe=yes\n\tcontinue\n\t;;\n\n      -version-info)\n\tprev=vinfo\n\tcontinue\n\t;;\n\n      -version-number)\n\tprev=vinfo\n\tvinfo_number=yes\n\tcontinue\n\t;;\n\n      -weak)\n        prev=weak\n\tcontinue\n\t;;\n\n      -Wc,*)\n\tfunc_stripname '-Wc,' '' \"$arg\"\n\targs=$func_stripname_result\n\targ=\n\tsave_ifs=$IFS; IFS=,\n\tfor flag in $args; do\n\t  IFS=$save_ifs\n          func_quote_for_eval \"$flag\"\n\t  func_append arg \" $func_quote_for_eval_result\"\n\t  func_append compiler_flags \" $func_quote_for_eval_result\"\n\tdone\n\tIFS=$save_ifs\n\tfunc_stripname ' ' '' \"$arg\"\n\targ=$func_stripname_result\n\t;;\n\n      -Wl,*)\n\tfunc_stripname '-Wl,' '' \"$arg\"\n\targs=$func_stripname_result\n\targ=\n\tsave_ifs=$IFS; IFS=,\n\tfor flag in $args; do\n\t  IFS=$save_ifs\n          func_quote_for_eval \"$flag\"\n\t  func_append arg \" $wl$func_quote_for_eval_result\"\n\t  func_append compiler_flags \" $wl$func_quote_for_eval_result\"\n\t  func_append linker_flags \" $func_quote_for_eval_result\"\n\tdone\n\tIFS=$save_ifs\n\tfunc_stripname ' ' '' \"$arg\"\n\targ=$func_stripname_result\n\t;;\n\n      -Xcompiler)\n\tprev=xcompiler\n\tcontinue\n\t;;\n\n      -Xlinker)\n\tprev=xlinker\n\tcontinue\n\t;;\n\n      -XCClinker)\n\tprev=xcclinker\n\tcontinue\n\t;;\n\n      # -msg_* for osf cc\n      -msg_*)\n\tfunc_quote_for_eval \"$arg\"\n\targ=$func_quote_for_eval_result\n\t;;\n\n      # Flags to be passed through unchanged, with rationale:\n      # -64, -mips[0-9]      enable 64-bit mode for the SGI compiler\n      # -r[0-9][0-9]*        specify processor for the SGI compiler\n      # -xarch=*, -xtarget=* enable 64-bit mode for the Sun compiler\n      # +DA*, +DD*           enable 64-bit mode for the HP compiler\n      # -q*                  compiler args for the IBM compiler\n      # -m*, -t[45]*, -txscale* architecture-specific flags for GCC\n      # -F/path              path to uninstalled frameworks, gcc on darwin\n      # -p, -pg, --coverage, -fprofile-*  profiling flags for GCC\n      # -fstack-protector*   stack protector flags for GCC\n      # @file                GCC response files\n      # -tp=*                Portland pgcc target processor selection\n      # --sysroot=*          for sysroot support\n      # -O*, -g*, -flto*, -fwhopr*, -fuse-linker-plugin GCC link-time optimization\n      # -specs=*             GCC specs files\n      # -stdlib=*            select c++ std lib with clang\n      # -fsanitize=*         Clang/GCC memory and address sanitizer\n      -64|-mips[0-9]|-r[0-9][0-9]*|-xarch=*|-xtarget=*|+DA*|+DD*|-q*|-m*| \\\n      -t[45]*|-txscale*|-p|-pg|--coverage|-fprofile-*|-F*|@*|-tp=*|--sysroot=*| \\\n      -O*|-g*|-flto*|-fwhopr*|-fuse-linker-plugin|-fstack-protector*|-stdlib=*| \\\n      -specs=*|-fsanitize=*)\n        func_quote_for_eval \"$arg\"\n\targ=$func_quote_for_eval_result\n        func_append compile_command \" $arg\"\n        func_append finalize_command \" $arg\"\n        func_append compiler_flags \" $arg\"\n        continue\n        ;;\n\n      -Z*)\n        if test os2 = \"`expr $host : '.*\\(os2\\)'`\"; then\n          # OS/2 uses -Zxxx to specify OS/2-specific options\n\t  compiler_flags=\"$compiler_flags $arg\"\n\t  func_append compile_command \" $arg\"\n\t  func_append finalize_command \" $arg\"\n\t  case $arg in\n\t  -Zlinker | -Zstack)\n\t    prev=xcompiler\n\t    ;;\n\t  esac\n\t  continue\n        else\n\t  # Otherwise treat like 'Some other compiler flag' below\n\t  func_quote_for_eval \"$arg\"\n\t  arg=$func_quote_for_eval_result\n        fi\n\t;;\n\n      # Some other compiler flag.\n      -* | +*)\n        func_quote_for_eval \"$arg\"\n\targ=$func_quote_for_eval_result\n\t;;\n\n      *.$objext)\n\t# A standard object.\n\tfunc_append objs \" $arg\"\n\t;;\n\n      *.lo)\n\t# A libtool-controlled object.\n\n\t# Check to see that this really is a libtool object.\n\tif func_lalib_unsafe_p \"$arg\"; then\n\t  pic_object=\n\t  non_pic_object=\n\n\t  # Read the .lo file\n\t  func_source \"$arg\"\n\n\t  if test -z \"$pic_object\" ||\n\t     test -z \"$non_pic_object\" ||\n\t     test none = \"$pic_object\" &&\n\t     test none = \"$non_pic_object\"; then\n\t    func_fatal_error \"cannot find name of object for '$arg'\"\n\t  fi\n\n\t  # Extract subdirectory from the argument.\n\t  func_dirname \"$arg\" \"/\" \"\"\n\t  xdir=$func_dirname_result\n\n\t  test none = \"$pic_object\" || {\n\t    # Prepend the subdirectory the object is found in.\n\t    pic_object=$xdir$pic_object\n\n\t    if test dlfiles = \"$prev\"; then\n\t      if test yes = \"$build_libtool_libs\" && test yes = \"$dlopen_support\"; then\n\t\tfunc_append dlfiles \" $pic_object\"\n\t\tprev=\n\t\tcontinue\n\t      else\n\t\t# If libtool objects are unsupported, then we need to preload.\n\t\tprev=dlprefiles\n\t      fi\n\t    fi\n\n\t    # CHECK ME:  I think I busted this.  -Ossama\n\t    if test dlprefiles = \"$prev\"; then\n\t      # Preload the old-style object.\n\t      func_append dlprefiles \" $pic_object\"\n\t      prev=\n\t    fi\n\n\t    # A PIC object.\n\t    func_append libobjs \" $pic_object\"\n\t    arg=$pic_object\n\t  }\n\n\t  # Non-PIC object.\n\t  if test none != \"$non_pic_object\"; then\n\t    # Prepend the subdirectory the object is found in.\n\t    non_pic_object=$xdir$non_pic_object\n\n\t    # A standard non-PIC object\n\t    func_append non_pic_objects \" $non_pic_object\"\n\t    if test -z \"$pic_object\" || test none = \"$pic_object\"; then\n\t      arg=$non_pic_object\n\t    fi\n\t  else\n\t    # If the PIC object exists, use it instead.\n\t    # $xdir was prepended to $pic_object above.\n\t    non_pic_object=$pic_object\n\t    func_append non_pic_objects \" $non_pic_object\"\n\t  fi\n\telse\n\t  # Only an error if not doing a dry-run.\n\t  if $opt_dry_run; then\n\t    # Extract subdirectory from the argument.\n\t    func_dirname \"$arg\" \"/\" \"\"\n\t    xdir=$func_dirname_result\n\n\t    func_lo2o \"$arg\"\n\t    pic_object=$xdir$objdir/$func_lo2o_result\n\t    non_pic_object=$xdir$func_lo2o_result\n\t    func_append libobjs \" $pic_object\"\n\t    func_append non_pic_objects \" $non_pic_object\"\n\t  else\n\t    func_fatal_error \"'$arg' is not a valid libtool object\"\n\t  fi\n\tfi\n\t;;\n\n      *.$libext)\n\t# An archive.\n\tfunc_append deplibs \" $arg\"\n\tfunc_append old_deplibs \" $arg\"\n\tcontinue\n\t;;\n\n      *.la)\n\t# A libtool-controlled library.\n\n\tfunc_resolve_sysroot \"$arg\"\n\tif test dlfiles = \"$prev\"; then\n\t  # This library was specified with -dlopen.\n\t  func_append dlfiles \" $func_resolve_sysroot_result\"\n\t  prev=\n\telif test dlprefiles = \"$prev\"; then\n\t  # The library was specified with -dlpreopen.\n\t  func_append dlprefiles \" $func_resolve_sysroot_result\"\n\t  prev=\n\telse\n\t  func_append deplibs \" $func_resolve_sysroot_result\"\n\tfi\n\tcontinue\n\t;;\n\n      # Some other compiler argument.\n      *)\n\t# Unknown arguments in both finalize_command and compile_command need\n\t# to be aesthetically quoted because they are evaled later.\n\tfunc_quote_for_eval \"$arg\"\n\targ=$func_quote_for_eval_result\n\t;;\n      esac # arg\n\n      # Now actually substitute the argument into the commands.\n      if test -n \"$arg\"; then\n\tfunc_append compile_command \" $arg\"\n\tfunc_append finalize_command \" $arg\"\n      fi\n    done # argument parsing loop\n\n    test -n \"$prev\" && \\\n      func_fatal_help \"the '$prevarg' option requires an argument\"\n\n    if test yes = \"$export_dynamic\" && test -n \"$export_dynamic_flag_spec\"; then\n      eval arg=\\\"$export_dynamic_flag_spec\\\"\n      func_append compile_command \" $arg\"\n      func_append finalize_command \" $arg\"\n    fi\n\n    oldlibs=\n    # calculate the name of the file, without its directory\n    func_basename \"$output\"\n    outputname=$func_basename_result\n    libobjs_save=$libobjs\n\n    if test -n \"$shlibpath_var\"; then\n      # get the directories listed in $shlibpath_var\n      eval shlib_search_path=\\`\\$ECHO \\\"\\$$shlibpath_var\\\" \\| \\$SED \\'s/:/ /g\\'\\`\n    else\n      shlib_search_path=\n    fi\n    eval sys_lib_search_path=\\\"$sys_lib_search_path_spec\\\"\n    eval sys_lib_dlsearch_path=\\\"$sys_lib_dlsearch_path_spec\\\"\n\n    # Definition is injected by LT_CONFIG during libtool generation.\n    func_munge_path_list sys_lib_dlsearch_path \"$LT_SYS_LIBRARY_PATH\"\n\n    func_dirname \"$output\" \"/\" \"\"\n    output_objdir=$func_dirname_result$objdir\n    func_to_tool_file \"$output_objdir/\"\n    tool_output_objdir=$func_to_tool_file_result\n    # Create the object directory.\n    func_mkdir_p \"$output_objdir\"\n\n    # Determine the type of output\n    case $output in\n    \"\")\n      func_fatal_help \"you must specify an output file\"\n      ;;\n    *.$libext) linkmode=oldlib ;;\n    *.lo | *.$objext) linkmode=obj ;;\n    *.la) linkmode=lib ;;\n    *) linkmode=prog ;; # Anything else should be a program.\n    esac\n\n    specialdeplibs=\n\n    libs=\n    # Find all interdependent deplibs by searching for libraries\n    # that are linked more than once (e.g. -la -lb -la)\n    for deplib in $deplibs; do\n      if $opt_preserve_dup_deps; then\n\tcase \"$libs \" in\n\t*\" $deplib \"*) func_append specialdeplibs \" $deplib\" ;;\n\tesac\n      fi\n      func_append libs \" $deplib\"\n    done\n\n    if test lib = \"$linkmode\"; then\n      libs=\"$predeps $libs $compiler_lib_search_path $postdeps\"\n\n      # Compute libraries that are listed more than once in $predeps\n      # $postdeps and mark them as special (i.e., whose duplicates are\n      # not to be eliminated).\n      pre_post_deps=\n      if $opt_duplicate_compiler_generated_deps; then\n\tfor pre_post_dep in $predeps $postdeps; do\n\t  case \"$pre_post_deps \" in\n\t  *\" $pre_post_dep \"*) func_append specialdeplibs \" $pre_post_deps\" ;;\n\t  esac\n\t  func_append pre_post_deps \" $pre_post_dep\"\n\tdone\n      fi\n      pre_post_deps=\n    fi\n\n    deplibs=\n    newdependency_libs=\n    newlib_search_path=\n    need_relink=no # whether we're linking any uninstalled libtool libraries\n    notinst_deplibs= # not-installed libtool libraries\n    notinst_path= # paths that contain not-installed libtool libraries\n\n    case $linkmode in\n    lib)\n\tpasses=\"conv dlpreopen link\"\n\tfor file in $dlfiles $dlprefiles; do\n\t  case $file in\n\t  *.la) ;;\n\t  *)\n\t    func_fatal_help \"libraries can '-dlopen' only libtool libraries: $file\"\n\t    ;;\n\t  esac\n\tdone\n\t;;\n    prog)\n\tcompile_deplibs=\n\tfinalize_deplibs=\n\talldeplibs=false\n\tnewdlfiles=\n\tnewdlprefiles=\n\tpasses=\"conv scan dlopen dlpreopen link\"\n\t;;\n    *)  passes=\"conv\"\n\t;;\n    esac\n\n    for pass in $passes; do\n      # The preopen pass in lib mode reverses $deplibs; put it back here\n      # so that -L comes before libs that need it for instance...\n      if test lib,link = \"$linkmode,$pass\"; then\n\t## FIXME: Find the place where the list is rebuilt in the wrong\n\t##        order, and fix it there properly\n        tmp_deplibs=\n\tfor deplib in $deplibs; do\n\t  tmp_deplibs=\"$deplib $tmp_deplibs\"\n\tdone\n\tdeplibs=$tmp_deplibs\n      fi\n\n      if test lib,link = \"$linkmode,$pass\" ||\n\t test prog,scan = \"$linkmode,$pass\"; then\n\tlibs=$deplibs\n\tdeplibs=\n      fi\n      if test prog = \"$linkmode\"; then\n\tcase $pass in\n\tdlopen) libs=$dlfiles ;;\n\tdlpreopen) libs=$dlprefiles ;;\n\tlink)\n\t  libs=\"$deplibs %DEPLIBS%\"\n\t  test \"X$link_all_deplibs\" != Xno && libs=\"$libs $dependency_libs\"\n\t  ;;\n\tesac\n      fi\n      if test lib,dlpreopen = \"$linkmode,$pass\"; then\n\t# Collect and forward deplibs of preopened libtool libs\n\tfor lib in $dlprefiles; do\n\t  # Ignore non-libtool-libs\n\t  dependency_libs=\n\t  func_resolve_sysroot \"$lib\"\n\t  case $lib in\n\t  *.la)\tfunc_source \"$func_resolve_sysroot_result\" ;;\n\t  esac\n\n\t  # Collect preopened libtool deplibs, except any this library\n\t  # has declared as weak libs\n\t  for deplib in $dependency_libs; do\n\t    func_basename \"$deplib\"\n            deplib_base=$func_basename_result\n\t    case \" $weak_libs \" in\n\t    *\" $deplib_base \"*) ;;\n\t    *) func_append deplibs \" $deplib\" ;;\n\t    esac\n\t  done\n\tdone\n\tlibs=$dlprefiles\n      fi\n      if test dlopen = \"$pass\"; then\n\t# Collect dlpreopened libraries\n\tsave_deplibs=$deplibs\n\tdeplibs=\n      fi\n\n      for deplib in $libs; do\n\tlib=\n\tfound=false\n\tcase $deplib in\n\t-mt|-mthreads|-kthread|-Kthread|-pthread|-pthreads|--thread-safe \\\n        |-threads|-fopenmp|-openmp|-mp|-xopenmp|-omp|-qsmp=*)\n\t  if test prog,link = \"$linkmode,$pass\"; then\n\t    compile_deplibs=\"$deplib $compile_deplibs\"\n\t    finalize_deplibs=\"$deplib $finalize_deplibs\"\n\t  else\n\t    func_append compiler_flags \" $deplib\"\n\t    if test lib = \"$linkmode\"; then\n\t\tcase \"$new_inherited_linker_flags \" in\n\t\t    *\" $deplib \"*) ;;\n\t\t    * ) func_append new_inherited_linker_flags \" $deplib\" ;;\n\t\tesac\n\t    fi\n\t  fi\n\t  continue\n\t  ;;\n\t-l*)\n\t  if test lib != \"$linkmode\" && test prog != \"$linkmode\"; then\n\t    func_warning \"'-l' is ignored for archives/objects\"\n\t    continue\n\t  fi\n\t  func_stripname '-l' '' \"$deplib\"\n\t  name=$func_stripname_result\n\t  if test lib = \"$linkmode\"; then\n\t    searchdirs=\"$newlib_search_path $lib_search_path $compiler_lib_search_dirs $sys_lib_search_path $shlib_search_path\"\n\t  else\n\t    searchdirs=\"$newlib_search_path $lib_search_path $sys_lib_search_path $shlib_search_path\"\n\t  fi\n\t  for searchdir in $searchdirs; do\n\t    for search_ext in .la $std_shrext .so .a; do\n\t      # Search the libtool library\n\t      lib=$searchdir/lib$name$search_ext\n\t      if test -f \"$lib\"; then\n\t\tif test .la = \"$search_ext\"; then\n\t\t  found=:\n\t\telse\n\t\t  found=false\n\t\tfi\n\t\tbreak 2\n\t      fi\n\t    done\n\t  done\n\t  if $found; then\n\t    # deplib is a libtool library\n\t    # If $allow_libtool_libs_with_static_runtimes && $deplib is a stdlib,\n\t    # We need to do some special things here, and not later.\n\t    if test yes = \"$allow_libtool_libs_with_static_runtimes\"; then\n\t      case \" $predeps $postdeps \" in\n\t      *\" $deplib \"*)\n\t\tif func_lalib_p \"$lib\"; then\n\t\t  library_names=\n\t\t  old_library=\n\t\t  func_source \"$lib\"\n\t\t  for l in $old_library $library_names; do\n\t\t    ll=$l\n\t\t  done\n\t\t  if test \"X$ll\" = \"X$old_library\"; then # only static version available\n\t\t    found=false\n\t\t    func_dirname \"$lib\" \"\" \".\"\n\t\t    ladir=$func_dirname_result\n\t\t    lib=$ladir/$old_library\n\t\t    if test prog,link = \"$linkmode,$pass\"; then\n\t\t      compile_deplibs=\"$deplib $compile_deplibs\"\n\t\t      finalize_deplibs=\"$deplib $finalize_deplibs\"\n\t\t    else\n\t\t      deplibs=\"$deplib $deplibs\"\n\t\t      test lib = \"$linkmode\" && newdependency_libs=\"$deplib $newdependency_libs\"\n\t\t    fi\n\t\t    continue\n\t\t  fi\n\t\tfi\n\t\t;;\n\t      *) ;;\n\t      esac\n\t    fi\n\t  else\n\t    # deplib doesn't seem to be a libtool library\n\t    if test prog,link = \"$linkmode,$pass\"; then\n\t      compile_deplibs=\"$deplib $compile_deplibs\"\n\t      finalize_deplibs=\"$deplib $finalize_deplibs\"\n\t    else\n\t      deplibs=\"$deplib $deplibs\"\n\t      test lib = \"$linkmode\" && newdependency_libs=\"$deplib $newdependency_libs\"\n\t    fi\n\t    continue\n\t  fi\n\t  ;; # -l\n\t*.ltframework)\n\t  if test prog,link = \"$linkmode,$pass\"; then\n\t    compile_deplibs=\"$deplib $compile_deplibs\"\n\t    finalize_deplibs=\"$deplib $finalize_deplibs\"\n\t  else\n\t    deplibs=\"$deplib $deplibs\"\n\t    if test lib = \"$linkmode\"; then\n\t\tcase \"$new_inherited_linker_flags \" in\n\t\t    *\" $deplib \"*) ;;\n\t\t    * ) func_append new_inherited_linker_flags \" $deplib\" ;;\n\t\tesac\n\t    fi\n\t  fi\n\t  continue\n\t  ;;\n\t-L*)\n\t  case $linkmode in\n\t  lib)\n\t    deplibs=\"$deplib $deplibs\"\n\t    test conv = \"$pass\" && continue\n\t    newdependency_libs=\"$deplib $newdependency_libs\"\n\t    func_stripname '-L' '' \"$deplib\"\n\t    func_resolve_sysroot \"$func_stripname_result\"\n\t    func_append newlib_search_path \" $func_resolve_sysroot_result\"\n\t    ;;\n\t  prog)\n\t    if test conv = \"$pass\"; then\n\t      deplibs=\"$deplib $deplibs\"\n\t      continue\n\t    fi\n\t    if test scan = \"$pass\"; then\n\t      deplibs=\"$deplib $deplibs\"\n\t    else\n\t      compile_deplibs=\"$deplib $compile_deplibs\"\n\t      finalize_deplibs=\"$deplib $finalize_deplibs\"\n\t    fi\n\t    func_stripname '-L' '' \"$deplib\"\n\t    func_resolve_sysroot \"$func_stripname_result\"\n\t    func_append newlib_search_path \" $func_resolve_sysroot_result\"\n\t    ;;\n\t  *)\n\t    func_warning \"'-L' is ignored for archives/objects\"\n\t    ;;\n\t  esac # linkmode\n\t  continue\n\t  ;; # -L\n\t-R*)\n\t  if test link = \"$pass\"; then\n\t    func_stripname '-R' '' \"$deplib\"\n\t    func_resolve_sysroot \"$func_stripname_result\"\n\t    dir=$func_resolve_sysroot_result\n\t    # Make sure the xrpath contains only unique directories.\n\t    case \"$xrpath \" in\n\t    *\" $dir \"*) ;;\n\t    *) func_append xrpath \" $dir\" ;;\n\t    esac\n\t  fi\n\t  deplibs=\"$deplib $deplibs\"\n\t  continue\n\t  ;;\n\t*.la)\n\t  func_resolve_sysroot \"$deplib\"\n\t  lib=$func_resolve_sysroot_result\n\t  ;;\n\t*.$libext)\n\t  if test conv = \"$pass\"; then\n\t    deplibs=\"$deplib $deplibs\"\n\t    continue\n\t  fi\n\t  case $linkmode in\n\t  lib)\n\t    # Linking convenience modules into shared libraries is allowed,\n\t    # but linking other static libraries is non-portable.\n\t    case \" $dlpreconveniencelibs \" in\n\t    *\" $deplib \"*) ;;\n\t    *)\n\t      valid_a_lib=false\n\t      case $deplibs_check_method in\n\t\tmatch_pattern*)\n\t\t  set dummy $deplibs_check_method; shift\n\t\t  match_pattern_regex=`expr \"$deplibs_check_method\" : \"$1 \\(.*\\)\"`\n\t\t  if eval \"\\$ECHO \\\"$deplib\\\"\" 2>/dev/null | $SED 10q \\\n\t\t    | $EGREP \"$match_pattern_regex\" > /dev/null; then\n\t\t    valid_a_lib=:\n\t\t  fi\n\t\t;;\n\t\tpass_all)\n\t\t  valid_a_lib=:\n\t\t;;\n\t      esac\n\t      if $valid_a_lib; then\n\t\techo\n\t\t$ECHO \"*** Warning: Linking the shared library $output against the\"\n\t\t$ECHO \"*** static library $deplib is not portable!\"\n\t\tdeplibs=\"$deplib $deplibs\"\n\t      else\n\t\techo\n\t\t$ECHO \"*** Warning: Trying to link with static lib archive $deplib.\"\n\t\techo \"*** I have the capability to make that library automatically link in when\"\n\t\techo \"*** you link to this library.  But I can only do this if you have a\"\n\t\techo \"*** shared version of the library, which you do not appear to have\"\n\t\techo \"*** because the file extensions .$libext of this argument makes me believe\"\n\t\techo \"*** that it is just a static archive that I should not use here.\"\n\t      fi\n\t      ;;\n\t    esac\n\t    continue\n\t    ;;\n\t  prog)\n\t    if test link != \"$pass\"; then\n\t      deplibs=\"$deplib $deplibs\"\n\t    else\n\t      compile_deplibs=\"$deplib $compile_deplibs\"\n\t      finalize_deplibs=\"$deplib $finalize_deplibs\"\n\t    fi\n\t    continue\n\t    ;;\n\t  esac # linkmode\n\t  ;; # *.$libext\n\t*.lo | *.$objext)\n\t  if test conv = \"$pass\"; then\n\t    deplibs=\"$deplib $deplibs\"\n\t  elif test prog = \"$linkmode\"; then\n\t    if test dlpreopen = \"$pass\" || test yes != \"$dlopen_support\" || test no = \"$build_libtool_libs\"; then\n\t      # If there is no dlopen support or we're linking statically,\n\t      # we need to preload.\n\t      func_append newdlprefiles \" $deplib\"\n\t      compile_deplibs=\"$deplib $compile_deplibs\"\n\t      finalize_deplibs=\"$deplib $finalize_deplibs\"\n\t    else\n\t      func_append newdlfiles \" $deplib\"\n\t    fi\n\t  fi\n\t  continue\n\t  ;;\n\t%DEPLIBS%)\n\t  alldeplibs=:\n\t  continue\n\t  ;;\n\tesac # case $deplib\n\n\t$found || test -f \"$lib\" \\\n\t  || func_fatal_error \"cannot find the library '$lib' or unhandled argument '$deplib'\"\n\n\t# Check to see that this really is a libtool archive.\n\tfunc_lalib_unsafe_p \"$lib\" \\\n\t  || func_fatal_error \"'$lib' is not a valid libtool archive\"\n\n\tfunc_dirname \"$lib\" \"\" \".\"\n\tladir=$func_dirname_result\n\n\tdlname=\n\tdlopen=\n\tdlpreopen=\n\tlibdir=\n\tlibrary_names=\n\told_library=\n\tinherited_linker_flags=\n\t# If the library was installed with an old release of libtool,\n\t# it will not redefine variables installed, or shouldnotlink\n\tinstalled=yes\n\tshouldnotlink=no\n\tavoidtemprpath=\n\n\n\t# Read the .la file\n\tfunc_source \"$lib\"\n\n\t# Convert \"-framework foo\" to \"foo.ltframework\"\n\tif test -n \"$inherited_linker_flags\"; then\n\t  tmp_inherited_linker_flags=`$ECHO \"$inherited_linker_flags\" | $SED 's/-framework \\([^ $]*\\)/\\1.ltframework/g'`\n\t  for tmp_inherited_linker_flag in $tmp_inherited_linker_flags; do\n\t    case \" $new_inherited_linker_flags \" in\n\t      *\" $tmp_inherited_linker_flag \"*) ;;\n\t      *) func_append new_inherited_linker_flags \" $tmp_inherited_linker_flag\";;\n\t    esac\n\t  done\n\tfi\n\tdependency_libs=`$ECHO \" $dependency_libs\" | $SED 's% \\([^ $]*\\).ltframework% -framework \\1%g'`\n\tif test lib,link = \"$linkmode,$pass\" ||\n\t   test prog,scan = \"$linkmode,$pass\" ||\n\t   { test prog != \"$linkmode\" && test lib != \"$linkmode\"; }; then\n\t  test -n \"$dlopen\" && func_append dlfiles \" $dlopen\"\n\t  test -n \"$dlpreopen\" && func_append dlprefiles \" $dlpreopen\"\n\tfi\n\n\tif test conv = \"$pass\"; then\n\t  # Only check for convenience libraries\n\t  deplibs=\"$lib $deplibs\"\n\t  if test -z \"$libdir\"; then\n\t    if test -z \"$old_library\"; then\n\t      func_fatal_error \"cannot find name of link library for '$lib'\"\n\t    fi\n\t    # It is a libtool convenience library, so add in its objects.\n\t    func_append convenience \" $ladir/$objdir/$old_library\"\n\t    func_append old_convenience \" $ladir/$objdir/$old_library\"\n\t    tmp_libs=\n\t    for deplib in $dependency_libs; do\n\t      deplibs=\"$deplib $deplibs\"\n\t      if $opt_preserve_dup_deps; then\n\t\tcase \"$tmp_libs \" in\n\t\t*\" $deplib \"*) func_append specialdeplibs \" $deplib\" ;;\n\t\tesac\n\t      fi\n\t      func_append tmp_libs \" $deplib\"\n\t    done\n\t  elif test prog != \"$linkmode\" && test lib != \"$linkmode\"; then\n\t    func_fatal_error \"'$lib' is not a convenience library\"\n\t  fi\n\t  continue\n\tfi # $pass = conv\n\n\n\t# Get the name of the library we link against.\n\tlinklib=\n\tif test -n \"$old_library\" &&\n\t   { test yes = \"$prefer_static_libs\" ||\n\t     test built,no = \"$prefer_static_libs,$installed\"; }; then\n\t  linklib=$old_library\n\telse\n\t  for l in $old_library $library_names; do\n\t    linklib=$l\n\t  done\n\tfi\n\tif test -z \"$linklib\"; then\n\t  func_fatal_error \"cannot find name of link library for '$lib'\"\n\tfi\n\n\t# This library was specified with -dlopen.\n\tif test dlopen = \"$pass\"; then\n\t  test -z \"$libdir\" \\\n\t    && func_fatal_error \"cannot -dlopen a convenience library: '$lib'\"\n\t  if test -z \"$dlname\" ||\n\t     test yes != \"$dlopen_support\" ||\n\t     test no = \"$build_libtool_libs\"\n\t  then\n\t    # If there is no dlname, no dlopen support or we're linking\n\t    # statically, we need to preload.  We also need to preload any\n\t    # dependent libraries so libltdl's deplib preloader doesn't\n\t    # bomb out in the load deplibs phase.\n\t    func_append dlprefiles \" $lib $dependency_libs\"\n\t  else\n\t    func_append newdlfiles \" $lib\"\n\t  fi\n\t  continue\n\tfi # $pass = dlopen\n\n\t# We need an absolute path.\n\tcase $ladir in\n\t[\\\\/]* | [A-Za-z]:[\\\\/]*) abs_ladir=$ladir ;;\n\t*)\n\t  abs_ladir=`cd \"$ladir\" && pwd`\n\t  if test -z \"$abs_ladir\"; then\n\t    func_warning \"cannot determine absolute directory name of '$ladir'\"\n\t    func_warning \"passing it literally to the linker, although it might fail\"\n\t    abs_ladir=$ladir\n\t  fi\n\t  ;;\n\tesac\n\tfunc_basename \"$lib\"\n\tlaname=$func_basename_result\n\n\t# Find the relevant object directory and library name.\n\tif test yes = \"$installed\"; then\n\t  if test ! -f \"$lt_sysroot$libdir/$linklib\" && test -f \"$abs_ladir/$linklib\"; then\n\t    func_warning \"library '$lib' was moved.\"\n\t    dir=$ladir\n\t    absdir=$abs_ladir\n\t    libdir=$abs_ladir\n\t  else\n\t    dir=$lt_sysroot$libdir\n\t    absdir=$lt_sysroot$libdir\n\t  fi\n\t  test yes = \"$hardcode_automatic\" && avoidtemprpath=yes\n\telse\n\t  if test ! -f \"$ladir/$objdir/$linklib\" && test -f \"$abs_ladir/$linklib\"; then\n\t    dir=$ladir\n\t    absdir=$abs_ladir\n\t    # Remove this search path later\n\t    func_append notinst_path \" $abs_ladir\"\n\t  else\n\t    dir=$ladir/$objdir\n\t    absdir=$abs_ladir/$objdir\n\t    # Remove this search path later\n\t    func_append notinst_path \" $abs_ladir\"\n\t  fi\n\tfi # $installed = yes\n\tfunc_stripname 'lib' '.la' \"$laname\"\n\tname=$func_stripname_result\n\n\t# This library was specified with -dlpreopen.\n\tif test dlpreopen = \"$pass\"; then\n\t  if test -z \"$libdir\" && test prog = \"$linkmode\"; then\n\t    func_fatal_error \"only libraries may -dlpreopen a convenience library: '$lib'\"\n\t  fi\n\t  case $host in\n\t    # special handling for platforms with PE-DLLs.\n\t    *cygwin* | *mingw* | *cegcc* )\n\t      # Linker will automatically link against shared library if both\n\t      # static and shared are present.  Therefore, ensure we extract\n\t      # symbols from the import library if a shared library is present\n\t      # (otherwise, the dlopen module name will be incorrect).  We do\n\t      # this by putting the import library name into $newdlprefiles.\n\t      # We recover the dlopen module name by 'saving' the la file\n\t      # name in a special purpose variable, and (later) extracting the\n\t      # dlname from the la file.\n\t      if test -n \"$dlname\"; then\n\t        func_tr_sh \"$dir/$linklib\"\n\t        eval \"libfile_$func_tr_sh_result=\\$abs_ladir/\\$laname\"\n\t        func_append newdlprefiles \" $dir/$linklib\"\n\t      else\n\t        func_append newdlprefiles \" $dir/$old_library\"\n\t        # Keep a list of preopened convenience libraries to check\n\t        # that they are being used correctly in the link pass.\n\t        test -z \"$libdir\" && \\\n\t          func_append dlpreconveniencelibs \" $dir/$old_library\"\n\t      fi\n\t    ;;\n\t    * )\n\t      # Prefer using a static library (so that no silly _DYNAMIC symbols\n\t      # are required to link).\n\t      if test -n \"$old_library\"; then\n\t        func_append newdlprefiles \" $dir/$old_library\"\n\t        # Keep a list of preopened convenience libraries to check\n\t        # that they are being used correctly in the link pass.\n\t        test -z \"$libdir\" && \\\n\t          func_append dlpreconveniencelibs \" $dir/$old_library\"\n\t      # Otherwise, use the dlname, so that lt_dlopen finds it.\n\t      elif test -n \"$dlname\"; then\n\t        func_append newdlprefiles \" $dir/$dlname\"\n\t      else\n\t        func_append newdlprefiles \" $dir/$linklib\"\n\t      fi\n\t    ;;\n\t  esac\n\tfi # $pass = dlpreopen\n\n\tif test -z \"$libdir\"; then\n\t  # Link the convenience library\n\t  if test lib = \"$linkmode\"; then\n\t    deplibs=\"$dir/$old_library $deplibs\"\n\t  elif test prog,link = \"$linkmode,$pass\"; then\n\t    compile_deplibs=\"$dir/$old_library $compile_deplibs\"\n\t    finalize_deplibs=\"$dir/$old_library $finalize_deplibs\"\n\t  else\n\t    deplibs=\"$lib $deplibs\" # used for prog,scan pass\n\t  fi\n\t  continue\n\tfi\n\n\n\tif test prog = \"$linkmode\" && test link != \"$pass\"; then\n\t  func_append newlib_search_path \" $ladir\"\n\t  deplibs=\"$lib $deplibs\"\n\n\t  linkalldeplibs=false\n\t  if test no != \"$link_all_deplibs\" || test -z \"$library_names\" ||\n\t     test no = \"$build_libtool_libs\"; then\n\t    linkalldeplibs=:\n\t  fi\n\n\t  tmp_libs=\n\t  for deplib in $dependency_libs; do\n\t    case $deplib in\n\t    -L*) func_stripname '-L' '' \"$deplib\"\n\t         func_resolve_sysroot \"$func_stripname_result\"\n\t         func_append newlib_search_path \" $func_resolve_sysroot_result\"\n\t\t ;;\n\t    esac\n\t    # Need to link against all dependency_libs?\n\t    if $linkalldeplibs; then\n\t      deplibs=\"$deplib $deplibs\"\n\t    else\n\t      # Need to hardcode shared library paths\n\t      # or/and link against static libraries\n\t      newdependency_libs=\"$deplib $newdependency_libs\"\n\t    fi\n\t    if $opt_preserve_dup_deps; then\n\t      case \"$tmp_libs \" in\n\t      *\" $deplib \"*) func_append specialdeplibs \" $deplib\" ;;\n\t      esac\n\t    fi\n\t    func_append tmp_libs \" $deplib\"\n\t  done # for deplib\n\t  continue\n\tfi # $linkmode = prog...\n\n\tif test prog,link = \"$linkmode,$pass\"; then\n\t  if test -n \"$library_names\" &&\n\t     { { test no = \"$prefer_static_libs\" ||\n\t         test built,yes = \"$prefer_static_libs,$installed\"; } ||\n\t       test -z \"$old_library\"; }; then\n\t    # We need to hardcode the library path\n\t    if test -n \"$shlibpath_var\" && test -z \"$avoidtemprpath\"; then\n\t      # Make sure the rpath contains only unique directories.\n\t      case $temp_rpath: in\n\t      *\"$absdir:\"*) ;;\n\t      *) func_append temp_rpath \"$absdir:\" ;;\n\t      esac\n\t    fi\n\n\t    # Hardcode the library path.\n\t    # Skip directories that are in the system default run-time\n\t    # search path.\n\t    case \" $sys_lib_dlsearch_path \" in\n\t    *\" $absdir \"*) ;;\n\t    *)\n\t      case \"$compile_rpath \" in\n\t      *\" $absdir \"*) ;;\n\t      *) func_append compile_rpath \" $absdir\" ;;\n\t      esac\n\t      ;;\n\t    esac\n\t    case \" $sys_lib_dlsearch_path \" in\n\t    *\" $libdir \"*) ;;\n\t    *)\n\t      case \"$finalize_rpath \" in\n\t      *\" $libdir \"*) ;;\n\t      *) func_append finalize_rpath \" $libdir\" ;;\n\t      esac\n\t      ;;\n\t    esac\n\t  fi # $linkmode,$pass = prog,link...\n\n\t  if $alldeplibs &&\n\t     { test pass_all = \"$deplibs_check_method\" ||\n\t       { test yes = \"$build_libtool_libs\" &&\n\t\t test -n \"$library_names\"; }; }; then\n\t    # We only need to search for static libraries\n\t    continue\n\t  fi\n\tfi\n\n\tlink_static=no # Whether the deplib will be linked statically\n\tuse_static_libs=$prefer_static_libs\n\tif test built = \"$use_static_libs\" && test yes = \"$installed\"; then\n\t  use_static_libs=no\n\tfi\n\tif test -n \"$library_names\" &&\n\t   { test no = \"$use_static_libs\" || test -z \"$old_library\"; }; then\n\t  case $host in\n\t  *cygwin* | *mingw* | *cegcc* | *os2*)\n\t      # No point in relinking DLLs because paths are not encoded\n\t      func_append notinst_deplibs \" $lib\"\n\t      need_relink=no\n\t    ;;\n\t  *)\n\t    if test no = \"$installed\"; then\n\t      func_append notinst_deplibs \" $lib\"\n\t      need_relink=yes\n\t    fi\n\t    ;;\n\t  esac\n\t  # This is a shared library\n\n\t  # Warn about portability, can't link against -module's on some\n\t  # systems (darwin).  Don't bleat about dlopened modules though!\n\t  dlopenmodule=\n\t  for dlpremoduletest in $dlprefiles; do\n\t    if test \"X$dlpremoduletest\" = \"X$lib\"; then\n\t      dlopenmodule=$dlpremoduletest\n\t      break\n\t    fi\n\t  done\n\t  if test -z \"$dlopenmodule\" && test yes = \"$shouldnotlink\" && test link = \"$pass\"; then\n\t    echo\n\t    if test prog = \"$linkmode\"; then\n\t      $ECHO \"*** Warning: Linking the executable $output against the loadable module\"\n\t    else\n\t      $ECHO \"*** Warning: Linking the shared library $output against the loadable module\"\n\t    fi\n\t    $ECHO \"*** $linklib is not portable!\"\n\t  fi\n\t  if test lib = \"$linkmode\" &&\n\t     test yes = \"$hardcode_into_libs\"; then\n\t    # Hardcode the library path.\n\t    # Skip directories that are in the system default run-time\n\t    # search path.\n\t    case \" $sys_lib_dlsearch_path \" in\n\t    *\" $absdir \"*) ;;\n\t    *)\n\t      case \"$compile_rpath \" in\n\t      *\" $absdir \"*) ;;\n\t      *) func_append compile_rpath \" $absdir\" ;;\n\t      esac\n\t      ;;\n\t    esac\n\t    case \" $sys_lib_dlsearch_path \" in\n\t    *\" $libdir \"*) ;;\n\t    *)\n\t      case \"$finalize_rpath \" in\n\t      *\" $libdir \"*) ;;\n\t      *) func_append finalize_rpath \" $libdir\" ;;\n\t      esac\n\t      ;;\n\t    esac\n\t  fi\n\n\t  if test -n \"$old_archive_from_expsyms_cmds\"; then\n\t    # figure out the soname\n\t    set dummy $library_names\n\t    shift\n\t    realname=$1\n\t    shift\n\t    libname=`eval \"\\\\$ECHO \\\"$libname_spec\\\"\"`\n\t    # use dlname if we got it. it's perfectly good, no?\n\t    if test -n \"$dlname\"; then\n\t      soname=$dlname\n\t    elif test -n \"$soname_spec\"; then\n\t      # bleh windows\n\t      case $host in\n\t      *cygwin* | mingw* | *cegcc* | *os2*)\n\t        func_arith $current - $age\n\t\tmajor=$func_arith_result\n\t\tversuffix=-$major\n\t\t;;\n\t      esac\n\t      eval soname=\\\"$soname_spec\\\"\n\t    else\n\t      soname=$realname\n\t    fi\n\n\t    # Make a new name for the extract_expsyms_cmds to use\n\t    soroot=$soname\n\t    func_basename \"$soroot\"\n\t    soname=$func_basename_result\n\t    func_stripname 'lib' '.dll' \"$soname\"\n\t    newlib=libimp-$func_stripname_result.a\n\n\t    # If the library has no export list, then create one now\n\t    if test -f \"$output_objdir/$soname-def\"; then :\n\t    else\n\t      func_verbose \"extracting exported symbol list from '$soname'\"\n\t      func_execute_cmds \"$extract_expsyms_cmds\" 'exit $?'\n\t    fi\n\n\t    # Create $newlib\n\t    if test -f \"$output_objdir/$newlib\"; then :; else\n\t      func_verbose \"generating import library for '$soname'\"\n\t      func_execute_cmds \"$old_archive_from_expsyms_cmds\" 'exit $?'\n\t    fi\n\t    # make sure the library variables are pointing to the new library\n\t    dir=$output_objdir\n\t    linklib=$newlib\n\t  fi # test -n \"$old_archive_from_expsyms_cmds\"\n\n\t  if test prog = \"$linkmode\" || test relink != \"$opt_mode\"; then\n\t    add_shlibpath=\n\t    add_dir=\n\t    add=\n\t    lib_linked=yes\n\t    case $hardcode_action in\n\t    immediate | unsupported)\n\t      if test no = \"$hardcode_direct\"; then\n\t\tadd=$dir/$linklib\n\t\tcase $host in\n\t\t  *-*-sco3.2v5.0.[024]*) add_dir=-L$dir ;;\n\t\t  *-*-sysv4*uw2*) add_dir=-L$dir ;;\n\t\t  *-*-sysv5OpenUNIX* | *-*-sysv5UnixWare7.[01].[10]* | \\\n\t\t    *-*-unixware7*) add_dir=-L$dir ;;\n\t\t  *-*-darwin* )\n\t\t    # if the lib is a (non-dlopened) module then we cannot\n\t\t    # link against it, someone is ignoring the earlier warnings\n\t\t    if /usr/bin/file -L $add 2> /dev/null |\n\t\t\t $GREP \": [^:]* bundle\" >/dev/null; then\n\t\t      if test \"X$dlopenmodule\" != \"X$lib\"; then\n\t\t\t$ECHO \"*** Warning: lib $linklib is a module, not a shared library\"\n\t\t\tif test -z \"$old_library\"; then\n\t\t\t  echo\n\t\t\t  echo \"*** And there doesn't seem to be a static archive available\"\n\t\t\t  echo \"*** The link will probably fail, sorry\"\n\t\t\telse\n\t\t\t  add=$dir/$old_library\n\t\t\tfi\n\t\t      elif test -n \"$old_library\"; then\n\t\t\tadd=$dir/$old_library\n\t\t      fi\n\t\t    fi\n\t\tesac\n\t      elif test no = \"$hardcode_minus_L\"; then\n\t\tcase $host in\n\t\t*-*-sunos*) add_shlibpath=$dir ;;\n\t\tesac\n\t\tadd_dir=-L$dir\n\t\tadd=-l$name\n\t      elif test no = \"$hardcode_shlibpath_var\"; then\n\t\tadd_shlibpath=$dir\n\t\tadd=-l$name\n\t      else\n\t\tlib_linked=no\n\t      fi\n\t      ;;\n\t    relink)\n\t      if test yes = \"$hardcode_direct\" &&\n\t         test no = \"$hardcode_direct_absolute\"; then\n\t\tadd=$dir/$linklib\n\t      elif test yes = \"$hardcode_minus_L\"; then\n\t\tadd_dir=-L$absdir\n\t\t# Try looking first in the location we're being installed to.\n\t\tif test -n \"$inst_prefix_dir\"; then\n\t\t  case $libdir in\n\t\t    [\\\\/]*)\n\t\t      func_append add_dir \" -L$inst_prefix_dir$libdir\"\n\t\t      ;;\n\t\t  esac\n\t\tfi\n\t\tadd=-l$name\n\t      elif test yes = \"$hardcode_shlibpath_var\"; then\n\t\tadd_shlibpath=$dir\n\t\tadd=-l$name\n\t      else\n\t\tlib_linked=no\n\t      fi\n\t      ;;\n\t    *) lib_linked=no ;;\n\t    esac\n\n\t    if test yes != \"$lib_linked\"; then\n\t      func_fatal_configuration \"unsupported hardcode properties\"\n\t    fi\n\n\t    if test -n \"$add_shlibpath\"; then\n\t      case :$compile_shlibpath: in\n\t      *\":$add_shlibpath:\"*) ;;\n\t      *) func_append compile_shlibpath \"$add_shlibpath:\" ;;\n\t      esac\n\t    fi\n\t    if test prog = \"$linkmode\"; then\n\t      test -n \"$add_dir\" && compile_deplibs=\"$add_dir $compile_deplibs\"\n\t      test -n \"$add\" && compile_deplibs=\"$add $compile_deplibs\"\n\t    else\n\t      test -n \"$add_dir\" && deplibs=\"$add_dir $deplibs\"\n\t      test -n \"$add\" && deplibs=\"$add $deplibs\"\n\t      if test yes != \"$hardcode_direct\" &&\n\t\t test yes != \"$hardcode_minus_L\" &&\n\t\t test yes = \"$hardcode_shlibpath_var\"; then\n\t\tcase :$finalize_shlibpath: in\n\t\t*\":$libdir:\"*) ;;\n\t\t*) func_append finalize_shlibpath \"$libdir:\" ;;\n\t\tesac\n\t      fi\n\t    fi\n\t  fi\n\n\t  if test prog = \"$linkmode\" || test relink = \"$opt_mode\"; then\n\t    add_shlibpath=\n\t    add_dir=\n\t    add=\n\t    # Finalize command for both is simple: just hardcode it.\n\t    if test yes = \"$hardcode_direct\" &&\n\t       test no = \"$hardcode_direct_absolute\"; then\n\t      add=$libdir/$linklib\n\t    elif test yes = \"$hardcode_minus_L\"; then\n\t      add_dir=-L$libdir\n\t      add=-l$name\n\t    elif test yes = \"$hardcode_shlibpath_var\"; then\n\t      case :$finalize_shlibpath: in\n\t      *\":$libdir:\"*) ;;\n\t      *) func_append finalize_shlibpath \"$libdir:\" ;;\n\t      esac\n\t      add=-l$name\n\t    elif test yes = \"$hardcode_automatic\"; then\n\t      if test -n \"$inst_prefix_dir\" &&\n\t\t test -f \"$inst_prefix_dir$libdir/$linklib\"; then\n\t\tadd=$inst_prefix_dir$libdir/$linklib\n\t      else\n\t\tadd=$libdir/$linklib\n\t      fi\n\t    else\n\t      # We cannot seem to hardcode it, guess we'll fake it.\n\t      add_dir=-L$libdir\n\t      # Try looking first in the location we're being installed to.\n\t      if test -n \"$inst_prefix_dir\"; then\n\t\tcase $libdir in\n\t\t  [\\\\/]*)\n\t\t    func_append add_dir \" -L$inst_prefix_dir$libdir\"\n\t\t    ;;\n\t\tesac\n\t      fi\n\t      add=-l$name\n\t    fi\n\n\t    if test prog = \"$linkmode\"; then\n\t      test -n \"$add_dir\" && finalize_deplibs=\"$add_dir $finalize_deplibs\"\n\t      test -n \"$add\" && finalize_deplibs=\"$add $finalize_deplibs\"\n\t    else\n\t      test -n \"$add_dir\" && deplibs=\"$add_dir $deplibs\"\n\t      test -n \"$add\" && deplibs=\"$add $deplibs\"\n\t    fi\n\t  fi\n\telif test prog = \"$linkmode\"; then\n\t  # Here we assume that one of hardcode_direct or hardcode_minus_L\n\t  # is not unsupported.  This is valid on all known static and\n\t  # shared platforms.\n\t  if test unsupported != \"$hardcode_direct\"; then\n\t    test -n \"$old_library\" && linklib=$old_library\n\t    compile_deplibs=\"$dir/$linklib $compile_deplibs\"\n\t    finalize_deplibs=\"$dir/$linklib $finalize_deplibs\"\n\t  else\n\t    compile_deplibs=\"-l$name -L$dir $compile_deplibs\"\n\t    finalize_deplibs=\"-l$name -L$dir $finalize_deplibs\"\n\t  fi\n\telif test yes = \"$build_libtool_libs\"; then\n\t  # Not a shared library\n\t  if test pass_all != \"$deplibs_check_method\"; then\n\t    # We're trying link a shared library against a static one\n\t    # but the system doesn't support it.\n\n\t    # Just print a warning and add the library to dependency_libs so\n\t    # that the program can be linked against the static library.\n\t    echo\n\t    $ECHO \"*** Warning: This system cannot link to static lib archive $lib.\"\n\t    echo \"*** I have the capability to make that library automatically link in when\"\n\t    echo \"*** you link to this library.  But I can only do this if you have a\"\n\t    echo \"*** shared version of the library, which you do not appear to have.\"\n\t    if test yes = \"$module\"; then\n\t      echo \"*** But as you try to build a module library, libtool will still create \"\n\t      echo \"*** a static module, that should work as long as the dlopening application\"\n\t      echo \"*** is linked with the -dlopen flag to resolve symbols at runtime.\"\n\t      if test -z \"$global_symbol_pipe\"; then\n\t\techo\n\t\techo \"*** However, this would only work if libtool was able to extract symbol\"\n\t\techo \"*** lists from a program, using 'nm' or equivalent, but libtool could\"\n\t\techo \"*** not find such a program.  So, this module is probably useless.\"\n\t\techo \"*** 'nm' from GNU binutils and a full rebuild may help.\"\n\t      fi\n\t      if test no = \"$build_old_libs\"; then\n\t\tbuild_libtool_libs=module\n\t\tbuild_old_libs=yes\n\t      else\n\t\tbuild_libtool_libs=no\n\t      fi\n\t    fi\n\t  else\n\t    deplibs=\"$dir/$old_library $deplibs\"\n\t    link_static=yes\n\t  fi\n\tfi # link shared/static library?\n\n\tif test lib = \"$linkmode\"; then\n\t  if test -n \"$dependency_libs\" &&\n\t     { test yes != \"$hardcode_into_libs\" ||\n\t       test yes = \"$build_old_libs\" ||\n\t       test yes = \"$link_static\"; }; then\n\t    # Extract -R from dependency_libs\n\t    temp_deplibs=\n\t    for libdir in $dependency_libs; do\n\t      case $libdir in\n\t      -R*) func_stripname '-R' '' \"$libdir\"\n\t           temp_xrpath=$func_stripname_result\n\t\t   case \" $xrpath \" in\n\t\t   *\" $temp_xrpath \"*) ;;\n\t\t   *) func_append xrpath \" $temp_xrpath\";;\n\t\t   esac;;\n\t      *) func_append temp_deplibs \" $libdir\";;\n\t      esac\n\t    done\n\t    dependency_libs=$temp_deplibs\n\t  fi\n\n\t  func_append newlib_search_path \" $absdir\"\n\t  # Link against this library\n\t  test no = \"$link_static\" && newdependency_libs=\"$abs_ladir/$laname $newdependency_libs\"\n\t  # ... and its dependency_libs\n\t  tmp_libs=\n\t  for deplib in $dependency_libs; do\n\t    newdependency_libs=\"$deplib $newdependency_libs\"\n\t    case $deplib in\n              -L*) func_stripname '-L' '' \"$deplib\"\n                   func_resolve_sysroot \"$func_stripname_result\";;\n              *) func_resolve_sysroot \"$deplib\" ;;\n            esac\n\t    if $opt_preserve_dup_deps; then\n\t      case \"$tmp_libs \" in\n\t      *\" $func_resolve_sysroot_result \"*)\n                func_append specialdeplibs \" $func_resolve_sysroot_result\" ;;\n\t      esac\n\t    fi\n\t    func_append tmp_libs \" $func_resolve_sysroot_result\"\n\t  done\n\n\t  if test no != \"$link_all_deplibs\"; then\n\t    # Add the search paths of all dependency libraries\n\t    for deplib in $dependency_libs; do\n\t      path=\n\t      case $deplib in\n\t      -L*) path=$deplib ;;\n\t      *.la)\n\t        func_resolve_sysroot \"$deplib\"\n\t        deplib=$func_resolve_sysroot_result\n\t        func_dirname \"$deplib\" \"\" \".\"\n\t\tdir=$func_dirname_result\n\t\t# We need an absolute path.\n\t\tcase $dir in\n\t\t[\\\\/]* | [A-Za-z]:[\\\\/]*) absdir=$dir ;;\n\t\t*)\n\t\t  absdir=`cd \"$dir\" && pwd`\n\t\t  if test -z \"$absdir\"; then\n\t\t    func_warning \"cannot determine absolute directory name of '$dir'\"\n\t\t    absdir=$dir\n\t\t  fi\n\t\t  ;;\n\t\tesac\n\t\tif $GREP \"^installed=no\" $deplib > /dev/null; then\n\t\tcase $host in\n\t\t*-*-darwin*)\n\t\t  depdepl=\n\t\t  eval deplibrary_names=`$SED -n -e 's/^library_names=\\(.*\\)$/\\1/p' $deplib`\n\t\t  if test -n \"$deplibrary_names\"; then\n\t\t    for tmp in $deplibrary_names; do\n\t\t      depdepl=$tmp\n\t\t    done\n\t\t    if test -f \"$absdir/$objdir/$depdepl\"; then\n\t\t      depdepl=$absdir/$objdir/$depdepl\n\t\t      darwin_install_name=`$OTOOL -L $depdepl | awk '{if (NR == 2) {print $1;exit}}'`\n                      if test -z \"$darwin_install_name\"; then\n                          darwin_install_name=`$OTOOL64 -L $depdepl  | awk '{if (NR == 2) {print $1;exit}}'`\n                      fi\n\t\t      func_append compiler_flags \" $wl-dylib_file $wl$darwin_install_name:$depdepl\"\n\t\t      func_append linker_flags \" -dylib_file $darwin_install_name:$depdepl\"\n\t\t      path=\n\t\t    fi\n\t\t  fi\n\t\t  ;;\n\t\t*)\n\t\t  path=-L$absdir/$objdir\n\t\t  ;;\n\t\tesac\n\t\telse\n\t\t  eval libdir=`$SED -n -e 's/^libdir=\\(.*\\)$/\\1/p' $deplib`\n\t\t  test -z \"$libdir\" && \\\n\t\t    func_fatal_error \"'$deplib' is not a valid libtool archive\"\n\t\t  test \"$absdir\" != \"$libdir\" && \\\n\t\t    func_warning \"'$deplib' seems to be moved\"\n\n\t\t  path=-L$absdir\n\t\tfi\n\t\t;;\n\t      esac\n\t      case \" $deplibs \" in\n\t      *\" $path \"*) ;;\n\t      *) deplibs=\"$path $deplibs\" ;;\n\t      esac\n\t    done\n\t  fi # link_all_deplibs != no\n\tfi # linkmode = lib\n      done # for deplib in $libs\n      if test link = \"$pass\"; then\n\tif test prog = \"$linkmode\"; then\n\t  compile_deplibs=\"$new_inherited_linker_flags $compile_deplibs\"\n\t  finalize_deplibs=\"$new_inherited_linker_flags $finalize_deplibs\"\n\telse\n\t  compiler_flags=\"$compiler_flags \"`$ECHO \" $new_inherited_linker_flags\" | $SED 's% \\([^ $]*\\).ltframework% -framework \\1%g'`\n\tfi\n      fi\n      dependency_libs=$newdependency_libs\n      if test dlpreopen = \"$pass\"; then\n\t# Link the dlpreopened libraries before other libraries\n\tfor deplib in $save_deplibs; do\n\t  deplibs=\"$deplib $deplibs\"\n\tdone\n      fi\n      if test dlopen != \"$pass\"; then\n\ttest conv = \"$pass\" || {\n\t  # Make sure lib_search_path contains only unique directories.\n\t  lib_search_path=\n\t  for dir in $newlib_search_path; do\n\t    case \"$lib_search_path \" in\n\t    *\" $dir \"*) ;;\n\t    *) func_append lib_search_path \" $dir\" ;;\n\t    esac\n\t  done\n\t  newlib_search_path=\n\t}\n\n\tif test prog,link = \"$linkmode,$pass\"; then\n\t  vars=\"compile_deplibs finalize_deplibs\"\n\telse\n\t  vars=deplibs\n\tfi\n\tfor var in $vars dependency_libs; do\n\t  # Add libraries to $var in reverse order\n\t  eval tmp_libs=\\\"\\$$var\\\"\n\t  new_libs=\n\t  for deplib in $tmp_libs; do\n\t    # FIXME: Pedantically, this is the right thing to do, so\n\t    #        that some nasty dependency loop isn't accidentally\n\t    #        broken:\n\t    #new_libs=\"$deplib $new_libs\"\n\t    # Pragmatically, this seems to cause very few problems in\n\t    # practice:\n\t    case $deplib in\n\t    -L*) new_libs=\"$deplib $new_libs\" ;;\n\t    -R*) ;;\n\t    *)\n\t      # And here is the reason: when a library appears more\n\t      # than once as an explicit dependence of a library, or\n\t      # is implicitly linked in more than once by the\n\t      # compiler, it is considered special, and multiple\n\t      # occurrences thereof are not removed.  Compare this\n\t      # with having the same library being listed as a\n\t      # dependency of multiple other libraries: in this case,\n\t      # we know (pedantically, we assume) the library does not\n\t      # need to be listed more than once, so we keep only the\n\t      # last copy.  This is not always right, but it is rare\n\t      # enough that we require users that really mean to play\n\t      # such unportable linking tricks to link the library\n\t      # using -Wl,-lname, so that libtool does not consider it\n\t      # for duplicate removal.\n\t      case \" $specialdeplibs \" in\n\t      *\" $deplib \"*) new_libs=\"$deplib $new_libs\" ;;\n\t      *)\n\t\tcase \" $new_libs \" in\n\t\t*\" $deplib \"*) ;;\n\t\t*) new_libs=\"$deplib $new_libs\" ;;\n\t\tesac\n\t\t;;\n\t      esac\n\t      ;;\n\t    esac\n\t  done\n\t  tmp_libs=\n\t  for deplib in $new_libs; do\n\t    case $deplib in\n\t    -L*)\n\t      case \" $tmp_libs \" in\n\t      *\" $deplib \"*) ;;\n\t      *) func_append tmp_libs \" $deplib\" ;;\n\t      esac\n\t      ;;\n\t    *) func_append tmp_libs \" $deplib\" ;;\n\t    esac\n\t  done\n\t  eval $var=\\\"$tmp_libs\\\"\n\tdone # for var\n      fi\n\n      # Add Sun CC postdeps if required:\n      test CXX = \"$tagname\" && {\n        case $host_os in\n        linux*)\n          case `$CC -V 2>&1 | sed 5q` in\n          *Sun\\ C*) # Sun C++ 5.9\n            func_suncc_cstd_abi\n\n            if test no != \"$suncc_use_cstd_abi\"; then\n              func_append postdeps ' -library=Cstd -library=Crun'\n            fi\n            ;;\n          esac\n          ;;\n\n        solaris*)\n          func_cc_basename \"$CC\"\n          case $func_cc_basename_result in\n          CC* | sunCC*)\n            func_suncc_cstd_abi\n\n            if test no != \"$suncc_use_cstd_abi\"; then\n              func_append postdeps ' -library=Cstd -library=Crun'\n            fi\n            ;;\n          esac\n          ;;\n        esac\n      }\n\n      # Last step: remove runtime libs from dependency_libs\n      # (they stay in deplibs)\n      tmp_libs=\n      for i in $dependency_libs; do\n\tcase \" $predeps $postdeps $compiler_lib_search_path \" in\n\t*\" $i \"*)\n\t  i=\n\t  ;;\n\tesac\n\tif test -n \"$i\"; then\n\t  func_append tmp_libs \" $i\"\n\tfi\n      done\n      dependency_libs=$tmp_libs\n    done # for pass\n    if test prog = \"$linkmode\"; then\n      dlfiles=$newdlfiles\n    fi\n    if test prog = \"$linkmode\" || test lib = \"$linkmode\"; then\n      dlprefiles=$newdlprefiles\n    fi\n\n    case $linkmode in\n    oldlib)\n      if test -n \"$dlfiles$dlprefiles\" || test no != \"$dlself\"; then\n\tfunc_warning \"'-dlopen' is ignored for archives\"\n      fi\n\n      case \" $deplibs\" in\n      *\\ -l* | *\\ -L*)\n\tfunc_warning \"'-l' and '-L' are ignored for archives\" ;;\n      esac\n\n      test -n \"$rpath\" && \\\n\tfunc_warning \"'-rpath' is ignored for archives\"\n\n      test -n \"$xrpath\" && \\\n\tfunc_warning \"'-R' is ignored for archives\"\n\n      test -n \"$vinfo\" && \\\n\tfunc_warning \"'-version-info/-version-number' is ignored for archives\"\n\n      test -n \"$release\" && \\\n\tfunc_warning \"'-release' is ignored for archives\"\n\n      test -n \"$export_symbols$export_symbols_regex\" && \\\n\tfunc_warning \"'-export-symbols' is ignored for archives\"\n\n      # Now set the variables for building old libraries.\n      build_libtool_libs=no\n      oldlibs=$output\n      func_append objs \"$old_deplibs\"\n      ;;\n\n    lib)\n      # Make sure we only generate libraries of the form 'libNAME.la'.\n      case $outputname in\n      lib*)\n\tfunc_stripname 'lib' '.la' \"$outputname\"\n\tname=$func_stripname_result\n\teval shared_ext=\\\"$shrext_cmds\\\"\n\teval libname=\\\"$libname_spec\\\"\n\t;;\n      *)\n\ttest no = \"$module\" \\\n\t  && func_fatal_help \"libtool library '$output' must begin with 'lib'\"\n\n\tif test no != \"$need_lib_prefix\"; then\n\t  # Add the \"lib\" prefix for modules if required\n\t  func_stripname '' '.la' \"$outputname\"\n\t  name=$func_stripname_result\n\t  eval shared_ext=\\\"$shrext_cmds\\\"\n\t  eval libname=\\\"$libname_spec\\\"\n\telse\n\t  func_stripname '' '.la' \"$outputname\"\n\t  libname=$func_stripname_result\n\tfi\n\t;;\n      esac\n\n      if test -n \"$objs\"; then\n\tif test pass_all != \"$deplibs_check_method\"; then\n\t  func_fatal_error \"cannot build libtool library '$output' from non-libtool objects on this host:$objs\"\n\telse\n\t  echo\n\t  $ECHO \"*** Warning: Linking the shared library $output against the non-libtool\"\n\t  $ECHO \"*** objects $objs is not portable!\"\n\t  func_append libobjs \" $objs\"\n\tfi\n      fi\n\n      test no = \"$dlself\" \\\n\t|| func_warning \"'-dlopen self' is ignored for libtool libraries\"\n\n      set dummy $rpath\n      shift\n      test 1 -lt \"$#\" \\\n\t&& func_warning \"ignoring multiple '-rpath's for a libtool library\"\n\n      install_libdir=$1\n\n      oldlibs=\n      if test -z \"$rpath\"; then\n\tif test yes = \"$build_libtool_libs\"; then\n\t  # Building a libtool convenience library.\n\t  # Some compilers have problems with a '.al' extension so\n\t  # convenience libraries should have the same extension an\n\t  # archive normally would.\n\t  oldlibs=\"$output_objdir/$libname.$libext $oldlibs\"\n\t  build_libtool_libs=convenience\n\t  build_old_libs=yes\n\tfi\n\n\ttest -n \"$vinfo\" && \\\n\t  func_warning \"'-version-info/-version-number' is ignored for convenience libraries\"\n\n\ttest -n \"$release\" && \\\n\t  func_warning \"'-release' is ignored for convenience libraries\"\n      else\n\n\t# Parse the version information argument.\n\tsave_ifs=$IFS; IFS=:\n\tset dummy $vinfo 0 0 0\n\tshift\n\tIFS=$save_ifs\n\n\ttest -n \"$7\" && \\\n\t  func_fatal_help \"too many parameters to '-version-info'\"\n\n\t# convert absolute version numbers to libtool ages\n\t# this retains compatibility with .la files and attempts\n\t# to make the code below a bit more comprehensible\n\n\tcase $vinfo_number in\n\tyes)\n\t  number_major=$1\n\t  number_minor=$2\n\t  number_revision=$3\n\t  #\n\t  # There are really only two kinds -- those that\n\t  # use the current revision as the major version\n\t  # and those that subtract age and use age as\n\t  # a minor version.  But, then there is irix\n\t  # that has an extra 1 added just for fun\n\t  #\n\t  case $version_type in\n\t  # correct linux to gnu/linux during the next big refactor\n\t  darwin|freebsd-elf|linux|osf|windows|none)\n\t    func_arith $number_major + $number_minor\n\t    current=$func_arith_result\n\t    age=$number_minor\n\t    revision=$number_revision\n\t    ;;\n\t  freebsd-aout|qnx|sunos)\n\t    current=$number_major\n\t    revision=$number_minor\n\t    age=0\n\t    ;;\n\t  irix|nonstopux)\n\t    func_arith $number_major + $number_minor\n\t    current=$func_arith_result\n\t    age=$number_minor\n\t    revision=$number_minor\n\t    lt_irix_increment=no\n\t    ;;\n\t  *)\n\t    func_fatal_configuration \"$modename: unknown library version type '$version_type'\"\n\t    ;;\n\t  esac\n\t  ;;\n\tno)\n\t  current=$1\n\t  revision=$2\n\t  age=$3\n\t  ;;\n\tesac\n\n\t# Check that each of the things are valid numbers.\n\tcase $current in\n\t0|[1-9]|[1-9][0-9]|[1-9][0-9][0-9]|[1-9][0-9][0-9][0-9]|[1-9][0-9][0-9][0-9][0-9]) ;;\n\t*)\n\t  func_error \"CURRENT '$current' must be a nonnegative integer\"\n\t  func_fatal_error \"'$vinfo' is not valid version information\"\n\t  ;;\n\tesac\n\n\tcase $revision in\n\t0|[1-9]|[1-9][0-9]|[1-9][0-9][0-9]|[1-9][0-9][0-9][0-9]|[1-9][0-9][0-9][0-9][0-9]) ;;\n\t*)\n\t  func_error \"REVISION '$revision' must be a nonnegative integer\"\n\t  func_fatal_error \"'$vinfo' is not valid version information\"\n\t  ;;\n\tesac\n\n\tcase $age in\n\t0|[1-9]|[1-9][0-9]|[1-9][0-9][0-9]|[1-9][0-9][0-9][0-9]|[1-9][0-9][0-9][0-9][0-9]) ;;\n\t*)\n\t  func_error \"AGE '$age' must be a nonnegative integer\"\n\t  func_fatal_error \"'$vinfo' is not valid version information\"\n\t  ;;\n\tesac\n\n\tif test \"$age\" -gt \"$current\"; then\n\t  func_error \"AGE '$age' is greater than the current interface number '$current'\"\n\t  func_fatal_error \"'$vinfo' is not valid version information\"\n\tfi\n\n\t# Calculate the version variables.\n\tmajor=\n\tversuffix=\n\tverstring=\n\tcase $version_type in\n\tnone) ;;\n\n\tdarwin)\n\t  # Like Linux, but with the current version available in\n\t  # verstring for coding it into the library header\n\t  func_arith $current - $age\n\t  major=.$func_arith_result\n\t  versuffix=$major.$age.$revision\n\t  # Darwin ld doesn't like 0 for these options...\n\t  func_arith $current + 1\n\t  minor_current=$func_arith_result\n\t  xlcverstring=\"$wl-compatibility_version $wl$minor_current $wl-current_version $wl$minor_current.$revision\"\n\t  verstring=\"-compatibility_version $minor_current -current_version $minor_current.$revision\"\n          # On Darwin other compilers\n          case $CC in\n              nagfor*)\n                  verstring=\"$wl-compatibility_version $wl$minor_current $wl-current_version $wl$minor_current.$revision\"\n                  ;;\n              *)\n                  verstring=\"-compatibility_version $minor_current -current_version $minor_current.$revision\"\n                  ;;\n          esac\n\t  ;;\n\n\tfreebsd-aout)\n\t  major=.$current\n\t  versuffix=.$current.$revision\n\t  ;;\n\n\tfreebsd-elf)\n\t  func_arith $current - $age\n\t  major=.$func_arith_result\n\t  versuffix=$major.$age.$revision\n\t  ;;\n\n\tirix | nonstopux)\n\t  if test no = \"$lt_irix_increment\"; then\n\t    func_arith $current - $age\n\t  else\n\t    func_arith $current - $age + 1\n\t  fi\n\t  major=$func_arith_result\n\n\t  case $version_type in\n\t    nonstopux) verstring_prefix=nonstopux ;;\n\t    *)         verstring_prefix=sgi ;;\n\t  esac\n\t  verstring=$verstring_prefix$major.$revision\n\n\t  # Add in all the interfaces that we are compatible with.\n\t  loop=$revision\n\t  while test 0 -ne \"$loop\"; do\n\t    func_arith $revision - $loop\n\t    iface=$func_arith_result\n\t    func_arith $loop - 1\n\t    loop=$func_arith_result\n\t    verstring=$verstring_prefix$major.$iface:$verstring\n\t  done\n\n\t  # Before this point, $major must not contain '.'.\n\t  major=.$major\n\t  versuffix=$major.$revision\n\t  ;;\n\n\tlinux) # correct to gnu/linux during the next big refactor\n\t  func_arith $current - $age\n\t  major=.$func_arith_result\n\t  versuffix=$major.$age.$revision\n\t  ;;\n\n\tosf)\n\t  func_arith $current - $age\n\t  major=.$func_arith_result\n\t  versuffix=.$current.$age.$revision\n\t  verstring=$current.$age.$revision\n\n\t  # Add in all the interfaces that we are compatible with.\n\t  loop=$age\n\t  while test 0 -ne \"$loop\"; do\n\t    func_arith $current - $loop\n\t    iface=$func_arith_result\n\t    func_arith $loop - 1\n\t    loop=$func_arith_result\n\t    verstring=$verstring:$iface.0\n\t  done\n\n\t  # Make executables depend on our current version.\n\t  func_append verstring \":$current.0\"\n\t  ;;\n\n\tqnx)\n\t  major=.$current\n\t  versuffix=.$current\n\t  ;;\n\n\tsco)\n\t  major=.$current\n\t  versuffix=.$current\n\t  ;;\n\n\tsunos)\n\t  major=.$current\n\t  versuffix=.$current.$revision\n\t  ;;\n\n\twindows)\n\t  # Use '-' rather than '.', since we only want one\n\t  # extension on DOS 8.3 file systems.\n\t  func_arith $current - $age\n\t  major=$func_arith_result\n\t  versuffix=-$major\n\t  ;;\n\n\t*)\n\t  func_fatal_configuration \"unknown library version type '$version_type'\"\n\t  ;;\n\tesac\n\n\t# Clear the version info if we defaulted, and they specified a release.\n\tif test -z \"$vinfo\" && test -n \"$release\"; then\n\t  major=\n\t  case $version_type in\n\t  darwin)\n\t    # we can't check for \"0.0\" in archive_cmds due to quoting\n\t    # problems, so we reset it completely\n\t    verstring=\n\t    ;;\n\t  *)\n\t    verstring=0.0\n\t    ;;\n\t  esac\n\t  if test no = \"$need_version\"; then\n\t    versuffix=\n\t  else\n\t    versuffix=.0.0\n\t  fi\n\tfi\n\n\t# Remove version info from name if versioning should be avoided\n\tif test yes,no = \"$avoid_version,$need_version\"; then\n\t  major=\n\t  versuffix=\n\t  verstring=\n\tfi\n\n\t# Check to see if the archive will have undefined symbols.\n\tif test yes = \"$allow_undefined\"; then\n\t  if test unsupported = \"$allow_undefined_flag\"; then\n\t    if test yes = \"$build_old_libs\"; then\n\t      func_warning \"undefined symbols not allowed in $host shared libraries; building static only\"\n\t      build_libtool_libs=no\n\t    else\n\t      func_fatal_error \"can't build $host shared library unless -no-undefined is specified\"\n\t    fi\n\t  fi\n\telse\n\t  # Don't allow undefined symbols.\n\t  allow_undefined_flag=$no_undefined_flag\n\tfi\n\n      fi\n\n      func_generate_dlsyms \"$libname\" \"$libname\" :\n      func_append libobjs \" $symfileobj\"\n      test \" \" = \"$libobjs\" && libobjs=\n\n      if test relink != \"$opt_mode\"; then\n\t# Remove our outputs, but don't remove object files since they\n\t# may have been created when compiling PIC objects.\n\tremovelist=\n\ttempremovelist=`$ECHO \"$output_objdir/*\"`\n\tfor p in $tempremovelist; do\n\t  case $p in\n\t    *.$objext | *.gcno)\n\t       ;;\n\t    $output_objdir/$outputname | $output_objdir/$libname.* | $output_objdir/$libname$release.*)\n\t       if test -n \"$precious_files_regex\"; then\n\t\t if $ECHO \"$p\" | $EGREP -e \"$precious_files_regex\" >/dev/null 2>&1\n\t\t then\n\t\t   continue\n\t\t fi\n\t       fi\n\t       func_append removelist \" $p\"\n\t       ;;\n\t    *) ;;\n\t  esac\n\tdone\n\ttest -n \"$removelist\" && \\\n\t  func_show_eval \"${RM}r \\$removelist\"\n      fi\n\n      # Now set the variables for building old libraries.\n      if test yes = \"$build_old_libs\" && test convenience != \"$build_libtool_libs\"; then\n\tfunc_append oldlibs \" $output_objdir/$libname.$libext\"\n\n\t# Transform .lo files to .o files.\n\toldobjs=\"$objs \"`$ECHO \"$libobjs\" | $SP2NL | $SED \"/\\.$libext$/d; $lo2o\" | $NL2SP`\n      fi\n\n      # Eliminate all temporary directories.\n      #for path in $notinst_path; do\n      #\tlib_search_path=`$ECHO \"$lib_search_path \" | $SED \"s% $path % %g\"`\n      #\tdeplibs=`$ECHO \"$deplibs \" | $SED \"s% -L$path % %g\"`\n      #\tdependency_libs=`$ECHO \"$dependency_libs \" | $SED \"s% -L$path % %g\"`\n      #done\n\n      if test -n \"$xrpath\"; then\n\t# If the user specified any rpath flags, then add them.\n\ttemp_xrpath=\n\tfor libdir in $xrpath; do\n\t  func_replace_sysroot \"$libdir\"\n\t  func_append temp_xrpath \" -R$func_replace_sysroot_result\"\n\t  case \"$finalize_rpath \" in\n\t  *\" $libdir \"*) ;;\n\t  *) func_append finalize_rpath \" $libdir\" ;;\n\t  esac\n\tdone\n\tif test yes != \"$hardcode_into_libs\" || test yes = \"$build_old_libs\"; then\n\t  dependency_libs=\"$temp_xrpath $dependency_libs\"\n\tfi\n      fi\n\n      # Make sure dlfiles contains only unique files that won't be dlpreopened\n      old_dlfiles=$dlfiles\n      dlfiles=\n      for lib in $old_dlfiles; do\n\tcase \" $dlprefiles $dlfiles \" in\n\t*\" $lib \"*) ;;\n\t*) func_append dlfiles \" $lib\" ;;\n\tesac\n      done\n\n      # Make sure dlprefiles contains only unique files\n      old_dlprefiles=$dlprefiles\n      dlprefiles=\n      for lib in $old_dlprefiles; do\n\tcase \"$dlprefiles \" in\n\t*\" $lib \"*) ;;\n\t*) func_append dlprefiles \" $lib\" ;;\n\tesac\n      done\n\n      if test yes = \"$build_libtool_libs\"; then\n\tif test -n \"$rpath\"; then\n\t  case $host in\n\t  *-*-cygwin* | *-*-mingw* | *-*-pw32* | *-*-os2* | *-*-beos* | *-cegcc* | *-*-haiku*)\n\t    # these systems don't actually have a c library (as such)!\n\t    ;;\n\t  *-*-rhapsody* | *-*-darwin1.[012])\n\t    # Rhapsody C library is in the System framework\n\t    func_append deplibs \" System.ltframework\"\n\t    ;;\n\t  *-*-netbsd*)\n\t    # Don't link with libc until the a.out ld.so is fixed.\n\t    ;;\n\t  *-*-openbsd* | *-*-freebsd* | *-*-dragonfly*)\n\t    # Do not include libc due to us having libc/libc_r.\n\t    ;;\n\t  *-*-sco3.2v5* | *-*-sco5v6*)\n\t    # Causes problems with __ctype\n\t    ;;\n\t  *-*-sysv4.2uw2* | *-*-sysv5* | *-*-unixware* | *-*-OpenUNIX*)\n\t    # Compiler inserts libc in the correct place for threads to work\n\t    ;;\n\t  *)\n\t    # Add libc to deplibs on all other systems if necessary.\n\t    if test yes = \"$build_libtool_need_lc\"; then\n\t      func_append deplibs \" -lc\"\n\t    fi\n\t    ;;\n\t  esac\n\tfi\n\n\t# Transform deplibs into only deplibs that can be linked in shared.\n\tname_save=$name\n\tlibname_save=$libname\n\trelease_save=$release\n\tversuffix_save=$versuffix\n\tmajor_save=$major\n\t# I'm not sure if I'm treating the release correctly.  I think\n\t# release should show up in the -l (ie -lgmp5) so we don't want to\n\t# add it in twice.  Is that correct?\n\trelease=\n\tversuffix=\n\tmajor=\n\tnewdeplibs=\n\tdroppeddeps=no\n\tcase $deplibs_check_method in\n\tpass_all)\n\t  # Don't check for shared/static.  Everything works.\n\t  # This might be a little naive.  We might want to check\n\t  # whether the library exists or not.  But this is on\n\t  # osf3 & osf4 and I'm not really sure... Just\n\t  # implementing what was already the behavior.\n\t  newdeplibs=$deplibs\n\t  ;;\n\ttest_compile)\n\t  # This code stresses the \"libraries are programs\" paradigm to its\n\t  # limits. Maybe even breaks it.  We compile a program, linking it\n\t  # against the deplibs as a proxy for the library.  Then we can check\n\t  # whether they linked in statically or dynamically with ldd.\n\t  $opt_dry_run || $RM conftest.c\n\t  cat > conftest.c <<EOF\n\t  int main() { return 0; }\nEOF\n\t  $opt_dry_run || $RM conftest\n\t  if $LTCC $LTCFLAGS -o conftest conftest.c $deplibs; then\n\t    ldd_output=`ldd conftest`\n\t    for i in $deplibs; do\n\t      case $i in\n\t      -l*)\n\t\tfunc_stripname -l '' \"$i\"\n\t\tname=$func_stripname_result\n\t\tif test yes = \"$allow_libtool_libs_with_static_runtimes\"; then\n\t\t  case \" $predeps $postdeps \" in\n\t\t  *\" $i \"*)\n\t\t    func_append newdeplibs \" $i\"\n\t\t    i=\n\t\t    ;;\n\t\t  esac\n\t\tfi\n\t\tif test -n \"$i\"; then\n\t\t  libname=`eval \"\\\\$ECHO \\\"$libname_spec\\\"\"`\n\t\t  deplib_matches=`eval \"\\\\$ECHO \\\"$library_names_spec\\\"\"`\n\t\t  set dummy $deplib_matches; shift\n\t\t  deplib_match=$1\n\t\t  if test `expr \"$ldd_output\" : \".*$deplib_match\"` -ne 0; then\n\t\t    func_append newdeplibs \" $i\"\n\t\t  else\n\t\t    droppeddeps=yes\n\t\t    echo\n\t\t    $ECHO \"*** Warning: dynamic linker does not accept needed library $i.\"\n\t\t    echo \"*** I have the capability to make that library automatically link in when\"\n\t\t    echo \"*** you link to this library.  But I can only do this if you have a\"\n\t\t    echo \"*** shared version of the library, which I believe you do not have\"\n\t\t    echo \"*** because a test_compile did reveal that the linker did not use it for\"\n\t\t    echo \"*** its dynamic dependency list that programs get resolved with at runtime.\"\n\t\t  fi\n\t\tfi\n\t\t;;\n\t      *)\n\t\tfunc_append newdeplibs \" $i\"\n\t\t;;\n\t      esac\n\t    done\n\t  else\n\t    # Error occurred in the first compile.  Let's try to salvage\n\t    # the situation: Compile a separate program for each library.\n\t    for i in $deplibs; do\n\t      case $i in\n\t      -l*)\n\t\tfunc_stripname -l '' \"$i\"\n\t\tname=$func_stripname_result\n\t\t$opt_dry_run || $RM conftest\n\t\tif $LTCC $LTCFLAGS -o conftest conftest.c $i; then\n\t\t  ldd_output=`ldd conftest`\n\t\t  if test yes = \"$allow_libtool_libs_with_static_runtimes\"; then\n\t\t    case \" $predeps $postdeps \" in\n\t\t    *\" $i \"*)\n\t\t      func_append newdeplibs \" $i\"\n\t\t      i=\n\t\t      ;;\n\t\t    esac\n\t\t  fi\n\t\t  if test -n \"$i\"; then\n\t\t    libname=`eval \"\\\\$ECHO \\\"$libname_spec\\\"\"`\n\t\t    deplib_matches=`eval \"\\\\$ECHO \\\"$library_names_spec\\\"\"`\n\t\t    set dummy $deplib_matches; shift\n\t\t    deplib_match=$1\n\t\t    if test `expr \"$ldd_output\" : \".*$deplib_match\"` -ne 0; then\n\t\t      func_append newdeplibs \" $i\"\n\t\t    else\n\t\t      droppeddeps=yes\n\t\t      echo\n\t\t      $ECHO \"*** Warning: dynamic linker does not accept needed library $i.\"\n\t\t      echo \"*** I have the capability to make that library automatically link in when\"\n\t\t      echo \"*** you link to this library.  But I can only do this if you have a\"\n\t\t      echo \"*** shared version of the library, which you do not appear to have\"\n\t\t      echo \"*** because a test_compile did reveal that the linker did not use this one\"\n\t\t      echo \"*** as a dynamic dependency that programs can get resolved with at runtime.\"\n\t\t    fi\n\t\t  fi\n\t\telse\n\t\t  droppeddeps=yes\n\t\t  echo\n\t\t  $ECHO \"*** Warning!  Library $i is needed by this library but I was not able to\"\n\t\t  echo \"*** make it link in!  You will probably need to install it or some\"\n\t\t  echo \"*** library that it depends on before this library will be fully\"\n\t\t  echo \"*** functional.  Installing it before continuing would be even better.\"\n\t\tfi\n\t\t;;\n\t      *)\n\t\tfunc_append newdeplibs \" $i\"\n\t\t;;\n\t      esac\n\t    done\n\t  fi\n\t  ;;\n\tfile_magic*)\n\t  set dummy $deplibs_check_method; shift\n\t  file_magic_regex=`expr \"$deplibs_check_method\" : \"$1 \\(.*\\)\"`\n\t  for a_deplib in $deplibs; do\n\t    case $a_deplib in\n\t    -l*)\n\t      func_stripname -l '' \"$a_deplib\"\n\t      name=$func_stripname_result\n\t      if test yes = \"$allow_libtool_libs_with_static_runtimes\"; then\n\t\tcase \" $predeps $postdeps \" in\n\t\t*\" $a_deplib \"*)\n\t\t  func_append newdeplibs \" $a_deplib\"\n\t\t  a_deplib=\n\t\t  ;;\n\t\tesac\n\t      fi\n\t      if test -n \"$a_deplib\"; then\n\t\tlibname=`eval \"\\\\$ECHO \\\"$libname_spec\\\"\"`\n\t\tif test -n \"$file_magic_glob\"; then\n\t\t  libnameglob=`func_echo_all \"$libname\" | $SED -e $file_magic_glob`\n\t\telse\n\t\t  libnameglob=$libname\n\t\tfi\n\t\ttest yes = \"$want_nocaseglob\" && nocaseglob=`shopt -p nocaseglob`\n\t\tfor i in $lib_search_path $sys_lib_search_path $shlib_search_path; do\n\t\t  if test yes = \"$want_nocaseglob\"; then\n\t\t    shopt -s nocaseglob\n\t\t    potential_libs=`ls $i/$libnameglob[.-]* 2>/dev/null`\n\t\t    $nocaseglob\n\t\t  else\n\t\t    potential_libs=`ls $i/$libnameglob[.-]* 2>/dev/null`\n\t\t  fi\n\t\t  for potent_lib in $potential_libs; do\n\t\t      # Follow soft links.\n\t\t      if ls -lLd \"$potent_lib\" 2>/dev/null |\n\t\t\t $GREP \" -> \" >/dev/null; then\n\t\t\tcontinue\n\t\t      fi\n\t\t      # The statement above tries to avoid entering an\n\t\t      # endless loop below, in case of cyclic links.\n\t\t      # We might still enter an endless loop, since a link\n\t\t      # loop can be closed while we follow links,\n\t\t      # but so what?\n\t\t      potlib=$potent_lib\n\t\t      while test -h \"$potlib\" 2>/dev/null; do\n\t\t\tpotliblink=`ls -ld $potlib | $SED 's/.* -> //'`\n\t\t\tcase $potliblink in\n\t\t\t[\\\\/]* | [A-Za-z]:[\\\\/]*) potlib=$potliblink;;\n\t\t\t*) potlib=`$ECHO \"$potlib\" | $SED 's|[^/]*$||'`\"$potliblink\";;\n\t\t\tesac\n\t\t      done\n\t\t      if eval $file_magic_cmd \\\"\\$potlib\\\" 2>/dev/null |\n\t\t\t $SED -e 10q |\n\t\t\t $EGREP \"$file_magic_regex\" > /dev/null; then\n\t\t\tfunc_append newdeplibs \" $a_deplib\"\n\t\t\ta_deplib=\n\t\t\tbreak 2\n\t\t      fi\n\t\t  done\n\t\tdone\n\t      fi\n\t      if test -n \"$a_deplib\"; then\n\t\tdroppeddeps=yes\n\t\techo\n\t\t$ECHO \"*** Warning: linker path does not have real file for library $a_deplib.\"\n\t\techo \"*** I have the capability to make that library automatically link in when\"\n\t\techo \"*** you link to this library.  But I can only do this if you have a\"\n\t\techo \"*** shared version of the library, which you do not appear to have\"\n\t\techo \"*** because I did check the linker path looking for a file starting\"\n\t\tif test -z \"$potlib\"; then\n\t\t  $ECHO \"*** with $libname but no candidates were found. (...for file magic test)\"\n\t\telse\n\t\t  $ECHO \"*** with $libname and none of the candidates passed a file format test\"\n\t\t  $ECHO \"*** using a file magic. Last file checked: $potlib\"\n\t\tfi\n\t      fi\n\t      ;;\n\t    *)\n\t      # Add a -L argument.\n\t      func_append newdeplibs \" $a_deplib\"\n\t      ;;\n\t    esac\n\t  done # Gone through all deplibs.\n\t  ;;\n\tmatch_pattern*)\n\t  set dummy $deplibs_check_method; shift\n\t  match_pattern_regex=`expr \"$deplibs_check_method\" : \"$1 \\(.*\\)\"`\n\t  for a_deplib in $deplibs; do\n\t    case $a_deplib in\n\t    -l*)\n\t      func_stripname -l '' \"$a_deplib\"\n\t      name=$func_stripname_result\n\t      if test yes = \"$allow_libtool_libs_with_static_runtimes\"; then\n\t\tcase \" $predeps $postdeps \" in\n\t\t*\" $a_deplib \"*)\n\t\t  func_append newdeplibs \" $a_deplib\"\n\t\t  a_deplib=\n\t\t  ;;\n\t\tesac\n\t      fi\n\t      if test -n \"$a_deplib\"; then\n\t\tlibname=`eval \"\\\\$ECHO \\\"$libname_spec\\\"\"`\n\t\tfor i in $lib_search_path $sys_lib_search_path $shlib_search_path; do\n\t\t  potential_libs=`ls $i/$libname[.-]* 2>/dev/null`\n\t\t  for potent_lib in $potential_libs; do\n\t\t    potlib=$potent_lib # see symlink-check above in file_magic test\n\t\t    if eval \"\\$ECHO \\\"$potent_lib\\\"\" 2>/dev/null | $SED 10q | \\\n\t\t       $EGREP \"$match_pattern_regex\" > /dev/null; then\n\t\t      func_append newdeplibs \" $a_deplib\"\n\t\t      a_deplib=\n\t\t      break 2\n\t\t    fi\n\t\t  done\n\t\tdone\n\t      fi\n\t      if test -n \"$a_deplib\"; then\n\t\tdroppeddeps=yes\n\t\techo\n\t\t$ECHO \"*** Warning: linker path does not have real file for library $a_deplib.\"\n\t\techo \"*** I have the capability to make that library automatically link in when\"\n\t\techo \"*** you link to this library.  But I can only do this if you have a\"\n\t\techo \"*** shared version of the library, which you do not appear to have\"\n\t\techo \"*** because I did check the linker path looking for a file starting\"\n\t\tif test -z \"$potlib\"; then\n\t\t  $ECHO \"*** with $libname but no candidates were found. (...for regex pattern test)\"\n\t\telse\n\t\t  $ECHO \"*** with $libname and none of the candidates passed a file format test\"\n\t\t  $ECHO \"*** using a regex pattern. Last file checked: $potlib\"\n\t\tfi\n\t      fi\n\t      ;;\n\t    *)\n\t      # Add a -L argument.\n\t      func_append newdeplibs \" $a_deplib\"\n\t      ;;\n\t    esac\n\t  done # Gone through all deplibs.\n\t  ;;\n\tnone | unknown | *)\n\t  newdeplibs=\n\t  tmp_deplibs=`$ECHO \" $deplibs\" | $SED 's/ -lc$//; s/ -[LR][^ ]*//g'`\n\t  if test yes = \"$allow_libtool_libs_with_static_runtimes\"; then\n\t    for i in $predeps $postdeps; do\n\t      # can't use Xsed below, because $i might contain '/'\n\t      tmp_deplibs=`$ECHO \" $tmp_deplibs\" | $SED \"s|$i||\"`\n\t    done\n\t  fi\n\t  case $tmp_deplibs in\n\t  *[!\\\t\\ ]*)\n\t    echo\n\t    if test none = \"$deplibs_check_method\"; then\n\t      echo \"*** Warning: inter-library dependencies are not supported in this platform.\"\n\t    else\n\t      echo \"*** Warning: inter-library dependencies are not known to be supported.\"\n\t    fi\n\t    echo \"*** All declared inter-library dependencies are being dropped.\"\n\t    droppeddeps=yes\n\t    ;;\n\t  esac\n\t  ;;\n\tesac\n\tversuffix=$versuffix_save\n\tmajor=$major_save\n\trelease=$release_save\n\tlibname=$libname_save\n\tname=$name_save\n\n\tcase $host in\n\t*-*-rhapsody* | *-*-darwin1.[012])\n\t  # On Rhapsody replace the C library with the System framework\n\t  newdeplibs=`$ECHO \" $newdeplibs\" | $SED 's/ -lc / System.ltframework /'`\n\t  ;;\n\tesac\n\n\tif test yes = \"$droppeddeps\"; then\n\t  if test yes = \"$module\"; then\n\t    echo\n\t    echo \"*** Warning: libtool could not satisfy all declared inter-library\"\n\t    $ECHO \"*** dependencies of module $libname.  Therefore, libtool will create\"\n\t    echo \"*** a static module, that should work as long as the dlopening\"\n\t    echo \"*** application is linked with the -dlopen flag.\"\n\t    if test -z \"$global_symbol_pipe\"; then\n\t      echo\n\t      echo \"*** However, this would only work if libtool was able to extract symbol\"\n\t      echo \"*** lists from a program, using 'nm' or equivalent, but libtool could\"\n\t      echo \"*** not find such a program.  So, this module is probably useless.\"\n\t      echo \"*** 'nm' from GNU binutils and a full rebuild may help.\"\n\t    fi\n\t    if test no = \"$build_old_libs\"; then\n\t      oldlibs=$output_objdir/$libname.$libext\n\t      build_libtool_libs=module\n\t      build_old_libs=yes\n\t    else\n\t      build_libtool_libs=no\n\t    fi\n\t  else\n\t    echo \"*** The inter-library dependencies that have been dropped here will be\"\n\t    echo \"*** automatically added whenever a program is linked with this library\"\n\t    echo \"*** or is declared to -dlopen it.\"\n\n\t    if test no = \"$allow_undefined\"; then\n\t      echo\n\t      echo \"*** Since this library must not contain undefined symbols,\"\n\t      echo \"*** because either the platform does not support them or\"\n\t      echo \"*** it was explicitly requested with -no-undefined,\"\n\t      echo \"*** libtool will only create a static version of it.\"\n\t      if test no = \"$build_old_libs\"; then\n\t\toldlibs=$output_objdir/$libname.$libext\n\t\tbuild_libtool_libs=module\n\t\tbuild_old_libs=yes\n\t      else\n\t\tbuild_libtool_libs=no\n\t      fi\n\t    fi\n\t  fi\n\tfi\n\t# Done checking deplibs!\n\tdeplibs=$newdeplibs\n      fi\n      # Time to change all our \"foo.ltframework\" stuff back to \"-framework foo\"\n      case $host in\n\t*-*-darwin*)\n\t  newdeplibs=`$ECHO \" $newdeplibs\" | $SED 's% \\([^ $]*\\).ltframework% -framework \\1%g'`\n\t  new_inherited_linker_flags=`$ECHO \" $new_inherited_linker_flags\" | $SED 's% \\([^ $]*\\).ltframework% -framework \\1%g'`\n\t  deplibs=`$ECHO \" $deplibs\" | $SED 's% \\([^ $]*\\).ltframework% -framework \\1%g'`\n\t  ;;\n      esac\n\n      # move library search paths that coincide with paths to not yet\n      # installed libraries to the beginning of the library search list\n      new_libs=\n      for path in $notinst_path; do\n\tcase \" $new_libs \" in\n\t*\" -L$path/$objdir \"*) ;;\n\t*)\n\t  case \" $deplibs \" in\n\t  *\" -L$path/$objdir \"*)\n\t    func_append new_libs \" -L$path/$objdir\" ;;\n\t  esac\n\t  ;;\n\tesac\n      done\n      for deplib in $deplibs; do\n\tcase $deplib in\n\t-L*)\n\t  case \" $new_libs \" in\n\t  *\" $deplib \"*) ;;\n\t  *) func_append new_libs \" $deplib\" ;;\n\t  esac\n\t  ;;\n\t*) func_append new_libs \" $deplib\" ;;\n\tesac\n      done\n      deplibs=$new_libs\n\n      # All the library-specific variables (install_libdir is set above).\n      library_names=\n      old_library=\n      dlname=\n\n      # Test again, we may have decided not to build it any more\n      if test yes = \"$build_libtool_libs\"; then\n\t# Remove $wl instances when linking with ld.\n\t# FIXME: should test the right _cmds variable.\n\tcase $archive_cmds in\n\t  *\\$LD\\ *) wl= ;;\n        esac\n\tif test yes = \"$hardcode_into_libs\"; then\n\t  # Hardcode the library paths\n\t  hardcode_libdirs=\n\t  dep_rpath=\n\t  rpath=$finalize_rpath\n\t  test relink = \"$opt_mode\" || rpath=$compile_rpath$rpath\n\t  for libdir in $rpath; do\n\t    if test -n \"$hardcode_libdir_flag_spec\"; then\n\t      if test -n \"$hardcode_libdir_separator\"; then\n\t\tfunc_replace_sysroot \"$libdir\"\n\t\tlibdir=$func_replace_sysroot_result\n\t\tif test -z \"$hardcode_libdirs\"; then\n\t\t  hardcode_libdirs=$libdir\n\t\telse\n\t\t  # Just accumulate the unique libdirs.\n\t\t  case $hardcode_libdir_separator$hardcode_libdirs$hardcode_libdir_separator in\n\t\t  *\"$hardcode_libdir_separator$libdir$hardcode_libdir_separator\"*)\n\t\t    ;;\n\t\t  *)\n\t\t    func_append hardcode_libdirs \"$hardcode_libdir_separator$libdir\"\n\t\t    ;;\n\t\t  esac\n\t\tfi\n\t      else\n\t\teval flag=\\\"$hardcode_libdir_flag_spec\\\"\n\t\tfunc_append dep_rpath \" $flag\"\n\t      fi\n\t    elif test -n \"$runpath_var\"; then\n\t      case \"$perm_rpath \" in\n\t      *\" $libdir \"*) ;;\n\t      *) func_append perm_rpath \" $libdir\" ;;\n\t      esac\n\t    fi\n\t  done\n\t  # Substitute the hardcoded libdirs into the rpath.\n\t  if test -n \"$hardcode_libdir_separator\" &&\n\t     test -n \"$hardcode_libdirs\"; then\n\t    libdir=$hardcode_libdirs\n\t    eval \"dep_rpath=\\\"$hardcode_libdir_flag_spec\\\"\"\n\t  fi\n\t  if test -n \"$runpath_var\" && test -n \"$perm_rpath\"; then\n\t    # We should set the runpath_var.\n\t    rpath=\n\t    for dir in $perm_rpath; do\n\t      func_append rpath \"$dir:\"\n\t    done\n\t    eval \"$runpath_var='$rpath\\$$runpath_var'; export $runpath_var\"\n\t  fi\n\t  test -n \"$dep_rpath\" && deplibs=\"$dep_rpath $deplibs\"\n\tfi\n\n\tshlibpath=$finalize_shlibpath\n\ttest relink = \"$opt_mode\" || shlibpath=$compile_shlibpath$shlibpath\n\tif test -n \"$shlibpath\"; then\n\t  eval \"$shlibpath_var='$shlibpath\\$$shlibpath_var'; export $shlibpath_var\"\n\tfi\n\n\t# Get the real and link names of the library.\n\teval shared_ext=\\\"$shrext_cmds\\\"\n\teval library_names=\\\"$library_names_spec\\\"\n\tset dummy $library_names\n\tshift\n\trealname=$1\n\tshift\n\n\tif test -n \"$soname_spec\"; then\n\t  eval soname=\\\"$soname_spec\\\"\n\telse\n\t  soname=$realname\n\tfi\n\tif test -z \"$dlname\"; then\n\t  dlname=$soname\n\tfi\n\n\tlib=$output_objdir/$realname\n\tlinknames=\n\tfor link\n\tdo\n\t  func_append linknames \" $link\"\n\tdone\n\n\t# Use standard objects if they are pic\n\ttest -z \"$pic_flag\" && libobjs=`$ECHO \"$libobjs\" | $SP2NL | $SED \"$lo2o\" | $NL2SP`\n\ttest \"X$libobjs\" = \"X \" && libobjs=\n\n\tdelfiles=\n\tif test -n \"$export_symbols\" && test -n \"$include_expsyms\"; then\n\t  $opt_dry_run || cp \"$export_symbols\" \"$output_objdir/$libname.uexp\"\n\t  export_symbols=$output_objdir/$libname.uexp\n\t  func_append delfiles \" $export_symbols\"\n\tfi\n\n\torig_export_symbols=\n\tcase $host_os in\n\tcygwin* | mingw* | cegcc*)\n\t  if test -n \"$export_symbols\" && test -z \"$export_symbols_regex\"; then\n\t    # exporting using user supplied symfile\n\t    func_dll_def_p \"$export_symbols\" || {\n\t      # and it's NOT already a .def file. Must figure out\n\t      # which of the given symbols are data symbols and tag\n\t      # them as such. So, trigger use of export_symbols_cmds.\n\t      # export_symbols gets reassigned inside the \"prepare\n\t      # the list of exported symbols\" if statement, so the\n\t      # include_expsyms logic still works.\n\t      orig_export_symbols=$export_symbols\n\t      export_symbols=\n\t      always_export_symbols=yes\n\t    }\n\t  fi\n\t  ;;\n\tesac\n\n\t# Prepare the list of exported symbols\n\tif test -z \"$export_symbols\"; then\n\t  if test yes = \"$always_export_symbols\" || test -n \"$export_symbols_regex\"; then\n\t    func_verbose \"generating symbol list for '$libname.la'\"\n\t    export_symbols=$output_objdir/$libname.exp\n\t    $opt_dry_run || $RM $export_symbols\n\t    cmds=$export_symbols_cmds\n\t    save_ifs=$IFS; IFS='~'\n\t    for cmd1 in $cmds; do\n\t      IFS=$save_ifs\n\t      # Take the normal branch if the nm_file_list_spec branch\n\t      # doesn't work or if tool conversion is not needed.\n\t      case $nm_file_list_spec~$to_tool_file_cmd in\n\t\t*~func_convert_file_noop | *~func_convert_file_msys_to_w32 | ~*)\n\t\t  try_normal_branch=yes\n\t\t  eval cmd=\\\"$cmd1\\\"\n\t\t  func_len \" $cmd\"\n\t\t  len=$func_len_result\n\t\t  ;;\n\t\t*)\n\t\t  try_normal_branch=no\n\t\t  ;;\n\t      esac\n\t      if test yes = \"$try_normal_branch\" \\\n\t\t && { test \"$len\" -lt \"$max_cmd_len\" \\\n\t\t      || test \"$max_cmd_len\" -le -1; }\n\t      then\n\t\tfunc_show_eval \"$cmd\" 'exit $?'\n\t\tskipped_export=false\n\t      elif test -n \"$nm_file_list_spec\"; then\n\t\tfunc_basename \"$output\"\n\t\toutput_la=$func_basename_result\n\t\tsave_libobjs=$libobjs\n\t\tsave_output=$output\n\t\toutput=$output_objdir/$output_la.nm\n\t\tfunc_to_tool_file \"$output\"\n\t\tlibobjs=$nm_file_list_spec$func_to_tool_file_result\n\t\tfunc_append delfiles \" $output\"\n\t\tfunc_verbose \"creating $NM input file list: $output\"\n\t\tfor obj in $save_libobjs; do\n\t\t  func_to_tool_file \"$obj\"\n\t\t  $ECHO \"$func_to_tool_file_result\"\n\t\tdone > \"$output\"\n\t\teval cmd=\\\"$cmd1\\\"\n\t\tfunc_show_eval \"$cmd\" 'exit $?'\n\t\toutput=$save_output\n\t\tlibobjs=$save_libobjs\n\t\tskipped_export=false\n\t      else\n\t\t# The command line is too long to execute in one step.\n\t\tfunc_verbose \"using reloadable object file for export list...\"\n\t\tskipped_export=:\n\t\t# Break out early, otherwise skipped_export may be\n\t\t# set to false by a later but shorter cmd.\n\t\tbreak\n\t      fi\n\t    done\n\t    IFS=$save_ifs\n\t    if test -n \"$export_symbols_regex\" && test : != \"$skipped_export\"; then\n\t      func_show_eval '$EGREP -e \"$export_symbols_regex\" \"$export_symbols\" > \"${export_symbols}T\"'\n\t      func_show_eval '$MV \"${export_symbols}T\" \"$export_symbols\"'\n\t    fi\n\t  fi\n\tfi\n\n\tif test -n \"$export_symbols\" && test -n \"$include_expsyms\"; then\n\t  tmp_export_symbols=$export_symbols\n\t  test -n \"$orig_export_symbols\" && tmp_export_symbols=$orig_export_symbols\n\t  $opt_dry_run || eval '$ECHO \"$include_expsyms\" | $SP2NL >> \"$tmp_export_symbols\"'\n\tfi\n\n\tif test : != \"$skipped_export\" && test -n \"$orig_export_symbols\"; then\n\t  # The given exports_symbols file has to be filtered, so filter it.\n\t  func_verbose \"filter symbol list for '$libname.la' to tag DATA exports\"\n\t  # FIXME: $output_objdir/$libname.filter potentially contains lots of\n\t  # 's' commands, which not all seds can handle. GNU sed should be fine\n\t  # though. Also, the filter scales superlinearly with the number of\n\t  # global variables. join(1) would be nice here, but unfortunately\n\t  # isn't a blessed tool.\n\t  $opt_dry_run || $SED -e '/[ ,]DATA/!d;s,\\(.*\\)\\([ \\,].*\\),s|^\\1$|\\1\\2|,' < $export_symbols > $output_objdir/$libname.filter\n\t  func_append delfiles \" $export_symbols $output_objdir/$libname.filter\"\n\t  export_symbols=$output_objdir/$libname.def\n\t  $opt_dry_run || $SED -f $output_objdir/$libname.filter < $orig_export_symbols > $export_symbols\n\tfi\n\n\ttmp_deplibs=\n\tfor test_deplib in $deplibs; do\n\t  case \" $convenience \" in\n\t  *\" $test_deplib \"*) ;;\n\t  *)\n\t    func_append tmp_deplibs \" $test_deplib\"\n\t    ;;\n\t  esac\n\tdone\n\tdeplibs=$tmp_deplibs\n\n\tif test -n \"$convenience\"; then\n\t  if test -n \"$whole_archive_flag_spec\" &&\n\t    test yes = \"$compiler_needs_object\" &&\n\t    test -z \"$libobjs\"; then\n\t    # extract the archives, so we have objects to list.\n\t    # TODO: could optimize this to just extract one archive.\n\t    whole_archive_flag_spec=\n\t  fi\n\t  if test -n \"$whole_archive_flag_spec\"; then\n\t    save_libobjs=$libobjs\n\t    eval libobjs=\\\"\\$libobjs $whole_archive_flag_spec\\\"\n\t    test \"X$libobjs\" = \"X \" && libobjs=\n\t  else\n\t    gentop=$output_objdir/${outputname}x\n\t    func_append generated \" $gentop\"\n\n\t    func_extract_archives $gentop $convenience\n\t    func_append libobjs \" $func_extract_archives_result\"\n\t    test \"X$libobjs\" = \"X \" && libobjs=\n\t  fi\n\tfi\n\n\tif test yes = \"$thread_safe\" && test -n \"$thread_safe_flag_spec\"; then\n\t  eval flag=\\\"$thread_safe_flag_spec\\\"\n\t  func_append linker_flags \" $flag\"\n\tfi\n\n\t# Make a backup of the uninstalled library when relinking\n\tif test relink = \"$opt_mode\"; then\n\t  $opt_dry_run || eval '(cd $output_objdir && $RM ${realname}U && $MV $realname ${realname}U)' || exit $?\n\tfi\n\n\t# Do each of the archive commands.\n\tif test yes = \"$module\" && test -n \"$module_cmds\"; then\n\t  if test -n \"$export_symbols\" && test -n \"$module_expsym_cmds\"; then\n\t    eval test_cmds=\\\"$module_expsym_cmds\\\"\n\t    cmds=$module_expsym_cmds\n\t  else\n\t    eval test_cmds=\\\"$module_cmds\\\"\n\t    cmds=$module_cmds\n\t  fi\n\telse\n\t  if test -n \"$export_symbols\" && test -n \"$archive_expsym_cmds\"; then\n\t    eval test_cmds=\\\"$archive_expsym_cmds\\\"\n\t    cmds=$archive_expsym_cmds\n\t  else\n\t    eval test_cmds=\\\"$archive_cmds\\\"\n\t    cmds=$archive_cmds\n\t  fi\n\tfi\n\n\tif test : != \"$skipped_export\" &&\n\t   func_len \" $test_cmds\" &&\n\t   len=$func_len_result &&\n\t   test \"$len\" -lt \"$max_cmd_len\" || test \"$max_cmd_len\" -le -1; then\n\t  :\n\telse\n\t  # The command line is too long to link in one step, link piecewise\n\t  # or, if using GNU ld and skipped_export is not :, use a linker\n\t  # script.\n\n\t  # Save the value of $output and $libobjs because we want to\n\t  # use them later.  If we have whole_archive_flag_spec, we\n\t  # want to use save_libobjs as it was before\n\t  # whole_archive_flag_spec was expanded, because we can't\n\t  # assume the linker understands whole_archive_flag_spec.\n\t  # This may have to be revisited, in case too many\n\t  # convenience libraries get linked in and end up exceeding\n\t  # the spec.\n\t  if test -z \"$convenience\" || test -z \"$whole_archive_flag_spec\"; then\n\t    save_libobjs=$libobjs\n\t  fi\n\t  save_output=$output\n\t  func_basename \"$output\"\n\t  output_la=$func_basename_result\n\n\t  # Clear the reloadable object creation command queue and\n\t  # initialize k to one.\n\t  test_cmds=\n\t  concat_cmds=\n\t  objlist=\n\t  last_robj=\n\t  k=1\n\n\t  if test -n \"$save_libobjs\" && test : != \"$skipped_export\" && test yes = \"$with_gnu_ld\"; then\n\t    output=$output_objdir/$output_la.lnkscript\n\t    func_verbose \"creating GNU ld script: $output\"\n\t    echo 'INPUT (' > $output\n\t    for obj in $save_libobjs\n\t    do\n\t      func_to_tool_file \"$obj\"\n\t      $ECHO \"$func_to_tool_file_result\" >> $output\n\t    done\n\t    echo ')' >> $output\n\t    func_append delfiles \" $output\"\n\t    func_to_tool_file \"$output\"\n\t    output=$func_to_tool_file_result\n\t  elif test -n \"$save_libobjs\" && test : != \"$skipped_export\" && test -n \"$file_list_spec\"; then\n\t    output=$output_objdir/$output_la.lnk\n\t    func_verbose \"creating linker input file list: $output\"\n\t    : > $output\n\t    set x $save_libobjs\n\t    shift\n\t    firstobj=\n\t    if test yes = \"$compiler_needs_object\"; then\n\t      firstobj=\"$1 \"\n\t      shift\n\t    fi\n\t    for obj\n\t    do\n\t      func_to_tool_file \"$obj\"\n\t      $ECHO \"$func_to_tool_file_result\" >> $output\n\t    done\n\t    func_append delfiles \" $output\"\n\t    func_to_tool_file \"$output\"\n\t    output=$firstobj\\\"$file_list_spec$func_to_tool_file_result\\\"\n\t  else\n\t    if test -n \"$save_libobjs\"; then\n\t      func_verbose \"creating reloadable object files...\"\n\t      output=$output_objdir/$output_la-$k.$objext\n\t      eval test_cmds=\\\"$reload_cmds\\\"\n\t      func_len \" $test_cmds\"\n\t      len0=$func_len_result\n\t      len=$len0\n\n\t      # Loop over the list of objects to be linked.\n\t      for obj in $save_libobjs\n\t      do\n\t\tfunc_len \" $obj\"\n\t\tfunc_arith $len + $func_len_result\n\t\tlen=$func_arith_result\n\t\tif test -z \"$objlist\" ||\n\t\t   test \"$len\" -lt \"$max_cmd_len\"; then\n\t\t  func_append objlist \" $obj\"\n\t\telse\n\t\t  # The command $test_cmds is almost too long, add a\n\t\t  # command to the queue.\n\t\t  if test 1 -eq \"$k\"; then\n\t\t    # The first file doesn't have a previous command to add.\n\t\t    reload_objs=$objlist\n\t\t    eval concat_cmds=\\\"$reload_cmds\\\"\n\t\t  else\n\t\t    # All subsequent reloadable object files will link in\n\t\t    # the last one created.\n\t\t    reload_objs=\"$objlist $last_robj\"\n\t\t    eval concat_cmds=\\\"\\$concat_cmds~$reload_cmds~\\$RM $last_robj\\\"\n\t\t  fi\n\t\t  last_robj=$output_objdir/$output_la-$k.$objext\n\t\t  func_arith $k + 1\n\t\t  k=$func_arith_result\n\t\t  output=$output_objdir/$output_la-$k.$objext\n\t\t  objlist=\" $obj\"\n\t\t  func_len \" $last_robj\"\n\t\t  func_arith $len0 + $func_len_result\n\t\t  len=$func_arith_result\n\t\tfi\n\t      done\n\t      # Handle the remaining objects by creating one last\n\t      # reloadable object file.  All subsequent reloadable object\n\t      # files will link in the last one created.\n\t      test -z \"$concat_cmds\" || concat_cmds=$concat_cmds~\n\t      reload_objs=\"$objlist $last_robj\"\n\t      eval concat_cmds=\\\"\\$concat_cmds$reload_cmds\\\"\n\t      if test -n \"$last_robj\"; then\n\t        eval concat_cmds=\\\"\\$concat_cmds~\\$RM $last_robj\\\"\n\t      fi\n\t      func_append delfiles \" $output\"\n\n\t    else\n\t      output=\n\t    fi\n\n\t    ${skipped_export-false} && {\n\t      func_verbose \"generating symbol list for '$libname.la'\"\n\t      export_symbols=$output_objdir/$libname.exp\n\t      $opt_dry_run || $RM $export_symbols\n\t      libobjs=$output\n\t      # Append the command to create the export file.\n\t      test -z \"$concat_cmds\" || concat_cmds=$concat_cmds~\n\t      eval concat_cmds=\\\"\\$concat_cmds$export_symbols_cmds\\\"\n\t      if test -n \"$last_robj\"; then\n\t\teval concat_cmds=\\\"\\$concat_cmds~\\$RM $last_robj\\\"\n\t      fi\n\t    }\n\n\t    test -n \"$save_libobjs\" &&\n\t      func_verbose \"creating a temporary reloadable object file: $output\"\n\n\t    # Loop through the commands generated above and execute them.\n\t    save_ifs=$IFS; IFS='~'\n\t    for cmd in $concat_cmds; do\n\t      IFS=$save_ifs\n\t      $opt_quiet || {\n\t\t  func_quote_for_expand \"$cmd\"\n\t\t  eval \"func_echo $func_quote_for_expand_result\"\n\t      }\n\t      $opt_dry_run || eval \"$cmd\" || {\n\t\tlt_exit=$?\n\n\t\t# Restore the uninstalled library and exit\n\t\tif test relink = \"$opt_mode\"; then\n\t\t  ( cd \"$output_objdir\" && \\\n\t\t    $RM \"${realname}T\" && \\\n\t\t    $MV \"${realname}U\" \"$realname\" )\n\t\tfi\n\n\t\texit $lt_exit\n\t      }\n\t    done\n\t    IFS=$save_ifs\n\n\t    if test -n \"$export_symbols_regex\" && ${skipped_export-false}; then\n\t      func_show_eval '$EGREP -e \"$export_symbols_regex\" \"$export_symbols\" > \"${export_symbols}T\"'\n\t      func_show_eval '$MV \"${export_symbols}T\" \"$export_symbols\"'\n\t    fi\n\t  fi\n\n          ${skipped_export-false} && {\n\t    if test -n \"$export_symbols\" && test -n \"$include_expsyms\"; then\n\t      tmp_export_symbols=$export_symbols\n\t      test -n \"$orig_export_symbols\" && tmp_export_symbols=$orig_export_symbols\n\t      $opt_dry_run || eval '$ECHO \"$include_expsyms\" | $SP2NL >> \"$tmp_export_symbols\"'\n\t    fi\n\n\t    if test -n \"$orig_export_symbols\"; then\n\t      # The given exports_symbols file has to be filtered, so filter it.\n\t      func_verbose \"filter symbol list for '$libname.la' to tag DATA exports\"\n\t      # FIXME: $output_objdir/$libname.filter potentially contains lots of\n\t      # 's' commands, which not all seds can handle. GNU sed should be fine\n\t      # though. Also, the filter scales superlinearly with the number of\n\t      # global variables. join(1) would be nice here, but unfortunately\n\t      # isn't a blessed tool.\n\t      $opt_dry_run || $SED -e '/[ ,]DATA/!d;s,\\(.*\\)\\([ \\,].*\\),s|^\\1$|\\1\\2|,' < $export_symbols > $output_objdir/$libname.filter\n\t      func_append delfiles \" $export_symbols $output_objdir/$libname.filter\"\n\t      export_symbols=$output_objdir/$libname.def\n\t      $opt_dry_run || $SED -f $output_objdir/$libname.filter < $orig_export_symbols > $export_symbols\n\t    fi\n\t  }\n\n\t  libobjs=$output\n\t  # Restore the value of output.\n\t  output=$save_output\n\n\t  if test -n \"$convenience\" && test -n \"$whole_archive_flag_spec\"; then\n\t    eval libobjs=\\\"\\$libobjs $whole_archive_flag_spec\\\"\n\t    test \"X$libobjs\" = \"X \" && libobjs=\n\t  fi\n\t  # Expand the library linking commands again to reset the\n\t  # value of $libobjs for piecewise linking.\n\n\t  # Do each of the archive commands.\n\t  if test yes = \"$module\" && test -n \"$module_cmds\"; then\n\t    if test -n \"$export_symbols\" && test -n \"$module_expsym_cmds\"; then\n\t      cmds=$module_expsym_cmds\n\t    else\n\t      cmds=$module_cmds\n\t    fi\n\t  else\n\t    if test -n \"$export_symbols\" && test -n \"$archive_expsym_cmds\"; then\n\t      cmds=$archive_expsym_cmds\n\t    else\n\t      cmds=$archive_cmds\n\t    fi\n\t  fi\n\tfi\n\n\tif test -n \"$delfiles\"; then\n\t  # Append the command to remove temporary files to $cmds.\n\t  eval cmds=\\\"\\$cmds~\\$RM $delfiles\\\"\n\tfi\n\n\t# Add any objects from preloaded convenience libraries\n\tif test -n \"$dlprefiles\"; then\n\t  gentop=$output_objdir/${outputname}x\n\t  func_append generated \" $gentop\"\n\n\t  func_extract_archives $gentop $dlprefiles\n\t  func_append libobjs \" $func_extract_archives_result\"\n\t  test \"X$libobjs\" = \"X \" && libobjs=\n\tfi\n\n\tsave_ifs=$IFS; IFS='~'\n\tfor cmd in $cmds; do\n\t  IFS=$sp$nl\n\t  eval cmd=\\\"$cmd\\\"\n\t  IFS=$save_ifs\n\t  $opt_quiet || {\n\t    func_quote_for_expand \"$cmd\"\n\t    eval \"func_echo $func_quote_for_expand_result\"\n\t  }\n\t  $opt_dry_run || eval \"$cmd\" || {\n\t    lt_exit=$?\n\n\t    # Restore the uninstalled library and exit\n\t    if test relink = \"$opt_mode\"; then\n\t      ( cd \"$output_objdir\" && \\\n\t        $RM \"${realname}T\" && \\\n\t\t$MV \"${realname}U\" \"$realname\" )\n\t    fi\n\n\t    exit $lt_exit\n\t  }\n\tdone\n\tIFS=$save_ifs\n\n\t# Restore the uninstalled library and exit\n\tif test relink = \"$opt_mode\"; then\n\t  $opt_dry_run || eval '(cd $output_objdir && $RM ${realname}T && $MV $realname ${realname}T && $MV ${realname}U $realname)' || exit $?\n\n\t  if test -n \"$convenience\"; then\n\t    if test -z \"$whole_archive_flag_spec\"; then\n\t      func_show_eval '${RM}r \"$gentop\"'\n\t    fi\n\t  fi\n\n\t  exit $EXIT_SUCCESS\n\tfi\n\n\t# Create links to the real library.\n\tfor linkname in $linknames; do\n\t  if test \"$realname\" != \"$linkname\"; then\n\t    func_show_eval '(cd \"$output_objdir\" && $RM \"$linkname\" && $LN_S \"$realname\" \"$linkname\")' 'exit $?'\n\t  fi\n\tdone\n\n\t# If -module or -export-dynamic was specified, set the dlname.\n\tif test yes = \"$module\" || test yes = \"$export_dynamic\"; then\n\t  # On all known operating systems, these are identical.\n\t  dlname=$soname\n\tfi\n      fi\n      ;;\n\n    obj)\n      if test -n \"$dlfiles$dlprefiles\" || test no != \"$dlself\"; then\n\tfunc_warning \"'-dlopen' is ignored for objects\"\n      fi\n\n      case \" $deplibs\" in\n      *\\ -l* | *\\ -L*)\n\tfunc_warning \"'-l' and '-L' are ignored for objects\" ;;\n      esac\n\n      test -n \"$rpath\" && \\\n\tfunc_warning \"'-rpath' is ignored for objects\"\n\n      test -n \"$xrpath\" && \\\n\tfunc_warning \"'-R' is ignored for objects\"\n\n      test -n \"$vinfo\" && \\\n\tfunc_warning \"'-version-info' is ignored for objects\"\n\n      test -n \"$release\" && \\\n\tfunc_warning \"'-release' is ignored for objects\"\n\n      case $output in\n      *.lo)\n\ttest -n \"$objs$old_deplibs\" && \\\n\t  func_fatal_error \"cannot build library object '$output' from non-libtool objects\"\n\n\tlibobj=$output\n\tfunc_lo2o \"$libobj\"\n\tobj=$func_lo2o_result\n\t;;\n      *)\n\tlibobj=\n\tobj=$output\n\t;;\n      esac\n\n      # Delete the old objects.\n      $opt_dry_run || $RM $obj $libobj\n\n      # Objects from convenience libraries.  This assumes\n      # single-version convenience libraries.  Whenever we create\n      # different ones for PIC/non-PIC, this we'll have to duplicate\n      # the extraction.\n      reload_conv_objs=\n      gentop=\n      # if reload_cmds runs $LD directly, get rid of -Wl from\n      # whole_archive_flag_spec and hope we can get by with turning comma\n      # into space.\n      case $reload_cmds in\n        *\\$LD[\\ \\$]*) wl= ;;\n      esac\n      if test -n \"$convenience\"; then\n\tif test -n \"$whole_archive_flag_spec\"; then\n\t  eval tmp_whole_archive_flags=\\\"$whole_archive_flag_spec\\\"\n\t  test -n \"$wl\" || tmp_whole_archive_flags=`$ECHO \"$tmp_whole_archive_flags\" | $SED 's|,| |g'`\n\t  reload_conv_objs=$reload_objs\\ $tmp_whole_archive_flags\n\telse\n\t  gentop=$output_objdir/${obj}x\n\t  func_append generated \" $gentop\"\n\n\t  func_extract_archives $gentop $convenience\n\t  reload_conv_objs=\"$reload_objs $func_extract_archives_result\"\n\tfi\n      fi\n\n      # If we're not building shared, we need to use non_pic_objs\n      test yes = \"$build_libtool_libs\" || libobjs=$non_pic_objects\n\n      # Create the old-style object.\n      reload_objs=$objs$old_deplibs' '`$ECHO \"$libobjs\" | $SP2NL | $SED \"/\\.$libext$/d; /\\.lib$/d; $lo2o\" | $NL2SP`' '$reload_conv_objs\n\n      output=$obj\n      func_execute_cmds \"$reload_cmds\" 'exit $?'\n\n      # Exit if we aren't doing a library object file.\n      if test -z \"$libobj\"; then\n\tif test -n \"$gentop\"; then\n\t  func_show_eval '${RM}r \"$gentop\"'\n\tfi\n\n\texit $EXIT_SUCCESS\n      fi\n\n      test yes = \"$build_libtool_libs\" || {\n\tif test -n \"$gentop\"; then\n\t  func_show_eval '${RM}r \"$gentop\"'\n\tfi\n\n\t# Create an invalid libtool object if no PIC, so that we don't\n\t# accidentally link it into a program.\n\t# $show \"echo timestamp > $libobj\"\n\t# $opt_dry_run || eval \"echo timestamp > $libobj\" || exit $?\n\texit $EXIT_SUCCESS\n      }\n\n      if test -n \"$pic_flag\" || test default != \"$pic_mode\"; then\n\t# Only do commands if we really have different PIC objects.\n\treload_objs=\"$libobjs $reload_conv_objs\"\n\toutput=$libobj\n\tfunc_execute_cmds \"$reload_cmds\" 'exit $?'\n      fi\n\n      if test -n \"$gentop\"; then\n\tfunc_show_eval '${RM}r \"$gentop\"'\n      fi\n\n      exit $EXIT_SUCCESS\n      ;;\n\n    prog)\n      case $host in\n\t*cygwin*) func_stripname '' '.exe' \"$output\"\n\t          output=$func_stripname_result.exe;;\n      esac\n      test -n \"$vinfo\" && \\\n\tfunc_warning \"'-version-info' is ignored for programs\"\n\n      test -n \"$release\" && \\\n\tfunc_warning \"'-release' is ignored for programs\"\n\n      $preload \\\n\t&& test unknown,unknown,unknown = \"$dlopen_support,$dlopen_self,$dlopen_self_static\" \\\n\t&& func_warning \"'LT_INIT([dlopen])' not used. Assuming no dlopen support.\"\n\n      case $host in\n      *-*-rhapsody* | *-*-darwin1.[012])\n\t# On Rhapsody replace the C library is the System framework\n\tcompile_deplibs=`$ECHO \" $compile_deplibs\" | $SED 's/ -lc / System.ltframework /'`\n\tfinalize_deplibs=`$ECHO \" $finalize_deplibs\" | $SED 's/ -lc / System.ltframework /'`\n\t;;\n      esac\n\n      case $host in\n      *-*-darwin*)\n\t# Don't allow lazy linking, it breaks C++ global constructors\n\t# But is supposedly fixed on 10.4 or later (yay!).\n\tif test CXX = \"$tagname\"; then\n\t  case ${MACOSX_DEPLOYMENT_TARGET-10.0} in\n\t    10.[0123])\n\t      func_append compile_command \" $wl-bind_at_load\"\n\t      func_append finalize_command \" $wl-bind_at_load\"\n\t    ;;\n\t  esac\n\tfi\n\t# Time to change all our \"foo.ltframework\" stuff back to \"-framework foo\"\n\tcompile_deplibs=`$ECHO \" $compile_deplibs\" | $SED 's% \\([^ $]*\\).ltframework% -framework \\1%g'`\n\tfinalize_deplibs=`$ECHO \" $finalize_deplibs\" | $SED 's% \\([^ $]*\\).ltframework% -framework \\1%g'`\n\t;;\n      esac\n\n\n      # move library search paths that coincide with paths to not yet\n      # installed libraries to the beginning of the library search list\n      new_libs=\n      for path in $notinst_path; do\n\tcase \" $new_libs \" in\n\t*\" -L$path/$objdir \"*) ;;\n\t*)\n\t  case \" $compile_deplibs \" in\n\t  *\" -L$path/$objdir \"*)\n\t    func_append new_libs \" -L$path/$objdir\" ;;\n\t  esac\n\t  ;;\n\tesac\n      done\n      for deplib in $compile_deplibs; do\n\tcase $deplib in\n\t-L*)\n\t  case \" $new_libs \" in\n\t  *\" $deplib \"*) ;;\n\t  *) func_append new_libs \" $deplib\" ;;\n\t  esac\n\t  ;;\n\t*) func_append new_libs \" $deplib\" ;;\n\tesac\n      done\n      compile_deplibs=$new_libs\n\n\n      func_append compile_command \" $compile_deplibs\"\n      func_append finalize_command \" $finalize_deplibs\"\n\n      if test -n \"$rpath$xrpath\"; then\n\t# If the user specified any rpath flags, then add them.\n\tfor libdir in $rpath $xrpath; do\n\t  # This is the magic to use -rpath.\n\t  case \"$finalize_rpath \" in\n\t  *\" $libdir \"*) ;;\n\t  *) func_append finalize_rpath \" $libdir\" ;;\n\t  esac\n\tdone\n      fi\n\n      # Now hardcode the library paths\n      rpath=\n      hardcode_libdirs=\n      for libdir in $compile_rpath $finalize_rpath; do\n\tif test -n \"$hardcode_libdir_flag_spec\"; then\n\t  if test -n \"$hardcode_libdir_separator\"; then\n\t    if test -z \"$hardcode_libdirs\"; then\n\t      hardcode_libdirs=$libdir\n\t    else\n\t      # Just accumulate the unique libdirs.\n\t      case $hardcode_libdir_separator$hardcode_libdirs$hardcode_libdir_separator in\n\t      *\"$hardcode_libdir_separator$libdir$hardcode_libdir_separator\"*)\n\t\t;;\n\t      *)\n\t\tfunc_append hardcode_libdirs \"$hardcode_libdir_separator$libdir\"\n\t\t;;\n\t      esac\n\t    fi\n\t  else\n\t    eval flag=\\\"$hardcode_libdir_flag_spec\\\"\n\t    func_append rpath \" $flag\"\n\t  fi\n\telif test -n \"$runpath_var\"; then\n\t  case \"$perm_rpath \" in\n\t  *\" $libdir \"*) ;;\n\t  *) func_append perm_rpath \" $libdir\" ;;\n\t  esac\n\tfi\n\tcase $host in\n\t*-*-cygwin* | *-*-mingw* | *-*-pw32* | *-*-os2* | *-cegcc*)\n\t  testbindir=`$ECHO \"$libdir\" | $SED -e 's*/lib$*/bin*'`\n\t  case :$dllsearchpath: in\n\t  *\":$libdir:\"*) ;;\n\t  ::) dllsearchpath=$libdir;;\n\t  *) func_append dllsearchpath \":$libdir\";;\n\t  esac\n\t  case :$dllsearchpath: in\n\t  *\":$testbindir:\"*) ;;\n\t  ::) dllsearchpath=$testbindir;;\n\t  *) func_append dllsearchpath \":$testbindir\";;\n\t  esac\n\t  ;;\n\tesac\n      done\n      # Substitute the hardcoded libdirs into the rpath.\n      if test -n \"$hardcode_libdir_separator\" &&\n\t test -n \"$hardcode_libdirs\"; then\n\tlibdir=$hardcode_libdirs\n\teval rpath=\\\" $hardcode_libdir_flag_spec\\\"\n      fi\n      compile_rpath=$rpath\n\n      rpath=\n      hardcode_libdirs=\n      for libdir in $finalize_rpath; do\n\tif test -n \"$hardcode_libdir_flag_spec\"; then\n\t  if test -n \"$hardcode_libdir_separator\"; then\n\t    if test -z \"$hardcode_libdirs\"; then\n\t      hardcode_libdirs=$libdir\n\t    else\n\t      # Just accumulate the unique libdirs.\n\t      case $hardcode_libdir_separator$hardcode_libdirs$hardcode_libdir_separator in\n\t      *\"$hardcode_libdir_separator$libdir$hardcode_libdir_separator\"*)\n\t\t;;\n\t      *)\n\t\tfunc_append hardcode_libdirs \"$hardcode_libdir_separator$libdir\"\n\t\t;;\n\t      esac\n\t    fi\n\t  else\n\t    eval flag=\\\"$hardcode_libdir_flag_spec\\\"\n\t    func_append rpath \" $flag\"\n\t  fi\n\telif test -n \"$runpath_var\"; then\n\t  case \"$finalize_perm_rpath \" in\n\t  *\" $libdir \"*) ;;\n\t  *) func_append finalize_perm_rpath \" $libdir\" ;;\n\t  esac\n\tfi\n      done\n      # Substitute the hardcoded libdirs into the rpath.\n      if test -n \"$hardcode_libdir_separator\" &&\n\t test -n \"$hardcode_libdirs\"; then\n\tlibdir=$hardcode_libdirs\n\teval rpath=\\\" $hardcode_libdir_flag_spec\\\"\n      fi\n      finalize_rpath=$rpath\n\n      if test -n \"$libobjs\" && test yes = \"$build_old_libs\"; then\n\t# Transform all the library objects into standard objects.\n\tcompile_command=`$ECHO \"$compile_command\" | $SP2NL | $SED \"$lo2o\" | $NL2SP`\n\tfinalize_command=`$ECHO \"$finalize_command\" | $SP2NL | $SED \"$lo2o\" | $NL2SP`\n      fi\n\n      func_generate_dlsyms \"$outputname\" \"@PROGRAM@\" false\n\n      # template prelinking step\n      if test -n \"$prelink_cmds\"; then\n\tfunc_execute_cmds \"$prelink_cmds\" 'exit $?'\n      fi\n\n      wrappers_required=:\n      case $host in\n      *cegcc* | *mingw32ce*)\n        # Disable wrappers for cegcc and mingw32ce hosts, we are cross compiling anyway.\n        wrappers_required=false\n        ;;\n      *cygwin* | *mingw* )\n        test yes = \"$build_libtool_libs\" || wrappers_required=false\n        ;;\n      *)\n        if test no = \"$need_relink\" || test yes != \"$build_libtool_libs\"; then\n          wrappers_required=false\n        fi\n        ;;\n      esac\n      $wrappers_required || {\n\t# Replace the output file specification.\n\tcompile_command=`$ECHO \"$compile_command\" | $SED 's%@OUTPUT@%'\"$output\"'%g'`\n\tlink_command=$compile_command$compile_rpath\n\n\t# We have no uninstalled library dependencies, so finalize right now.\n\texit_status=0\n\tfunc_show_eval \"$link_command\" 'exit_status=$?'\n\n\tif test -n \"$postlink_cmds\"; then\n\t  func_to_tool_file \"$output\"\n\t  postlink_cmds=`func_echo_all \"$postlink_cmds\" | $SED -e 's%@OUTPUT@%'\"$output\"'%g' -e 's%@TOOL_OUTPUT@%'\"$func_to_tool_file_result\"'%g'`\n\t  func_execute_cmds \"$postlink_cmds\" 'exit $?'\n\tfi\n\n\t# Delete the generated files.\n\tif test -f \"$output_objdir/${outputname}S.$objext\"; then\n\t  func_show_eval '$RM \"$output_objdir/${outputname}S.$objext\"'\n\tfi\n\n\texit $exit_status\n      }\n\n      if test -n \"$compile_shlibpath$finalize_shlibpath\"; then\n\tcompile_command=\"$shlibpath_var=\\\"$compile_shlibpath$finalize_shlibpath\\$$shlibpath_var\\\" $compile_command\"\n      fi\n      if test -n \"$finalize_shlibpath\"; then\n\tfinalize_command=\"$shlibpath_var=\\\"$finalize_shlibpath\\$$shlibpath_var\\\" $finalize_command\"\n      fi\n\n      compile_var=\n      finalize_var=\n      if test -n \"$runpath_var\"; then\n\tif test -n \"$perm_rpath\"; then\n\t  # We should set the runpath_var.\n\t  rpath=\n\t  for dir in $perm_rpath; do\n\t    func_append rpath \"$dir:\"\n\t  done\n\t  compile_var=\"$runpath_var=\\\"$rpath\\$$runpath_var\\\" \"\n\tfi\n\tif test -n \"$finalize_perm_rpath\"; then\n\t  # We should set the runpath_var.\n\t  rpath=\n\t  for dir in $finalize_perm_rpath; do\n\t    func_append rpath \"$dir:\"\n\t  done\n\t  finalize_var=\"$runpath_var=\\\"$rpath\\$$runpath_var\\\" \"\n\tfi\n      fi\n\n      if test yes = \"$no_install\"; then\n\t# We don't need to create a wrapper script.\n\tlink_command=$compile_var$compile_command$compile_rpath\n\t# Replace the output file specification.\n\tlink_command=`$ECHO \"$link_command\" | $SED 's%@OUTPUT@%'\"$output\"'%g'`\n\t# Delete the old output file.\n\t$opt_dry_run || $RM $output\n\t# Link the executable and exit\n\tfunc_show_eval \"$link_command\" 'exit $?'\n\n\tif test -n \"$postlink_cmds\"; then\n\t  func_to_tool_file \"$output\"\n\t  postlink_cmds=`func_echo_all \"$postlink_cmds\" | $SED -e 's%@OUTPUT@%'\"$output\"'%g' -e 's%@TOOL_OUTPUT@%'\"$func_to_tool_file_result\"'%g'`\n\t  func_execute_cmds \"$postlink_cmds\" 'exit $?'\n\tfi\n\n\texit $EXIT_SUCCESS\n      fi\n\n      case $hardcode_action,$fast_install in\n        relink,*)\n\t  # Fast installation is not supported\n\t  link_command=$compile_var$compile_command$compile_rpath\n\t  relink_command=$finalize_var$finalize_command$finalize_rpath\n\n\t  func_warning \"this platform does not like uninstalled shared libraries\"\n\t  func_warning \"'$output' will be relinked during installation\"\n\t  ;;\n        *,yes)\n\t  link_command=$finalize_var$compile_command$finalize_rpath\n\t  relink_command=`$ECHO \"$compile_var$compile_command$compile_rpath\" | $SED 's%@OUTPUT@%\\$progdir/\\$file%g'`\n          ;;\n\t*,no)\n\t  link_command=$compile_var$compile_command$compile_rpath\n\t  relink_command=$finalize_var$finalize_command$finalize_rpath\n          ;;\n\t*,needless)\n\t  link_command=$finalize_var$compile_command$finalize_rpath\n\t  relink_command=\n          ;;\n      esac\n\n      # Replace the output file specification.\n      link_command=`$ECHO \"$link_command\" | $SED 's%@OUTPUT@%'\"$output_objdir/$outputname\"'%g'`\n\n      # Delete the old output files.\n      $opt_dry_run || $RM $output $output_objdir/$outputname $output_objdir/lt-$outputname\n\n      func_show_eval \"$link_command\" 'exit $?'\n\n      if test -n \"$postlink_cmds\"; then\n\tfunc_to_tool_file \"$output_objdir/$outputname\"\n\tpostlink_cmds=`func_echo_all \"$postlink_cmds\" | $SED -e 's%@OUTPUT@%'\"$output_objdir/$outputname\"'%g' -e 's%@TOOL_OUTPUT@%'\"$func_to_tool_file_result\"'%g'`\n\tfunc_execute_cmds \"$postlink_cmds\" 'exit $?'\n      fi\n\n      # Now create the wrapper script.\n      func_verbose \"creating $output\"\n\n      # Quote the relink command for shipping.\n      if test -n \"$relink_command\"; then\n\t# Preserve any variables that may affect compiler behavior\n\tfor var in $variables_saved_for_relink; do\n\t  if eval test -z \\\"\\${$var+set}\\\"; then\n\t    relink_command=\"{ test -z \\\"\\${$var+set}\\\" || $lt_unset $var || { $var=; export $var; }; }; $relink_command\"\n\t  elif eval var_value=\\$$var; test -z \"$var_value\"; then\n\t    relink_command=\"$var=; export $var; $relink_command\"\n\t  else\n\t    func_quote_for_eval \"$var_value\"\n\t    relink_command=\"$var=$func_quote_for_eval_result; export $var; $relink_command\"\n\t  fi\n\tdone\n\trelink_command=\"(cd `pwd`; $relink_command)\"\n\trelink_command=`$ECHO \"$relink_command\" | $SED \"$sed_quote_subst\"`\n      fi\n\n      # Only actually do things if not in dry run mode.\n      $opt_dry_run || {\n\t# win32 will think the script is a binary if it has\n\t# a .exe suffix, so we strip it off here.\n\tcase $output in\n\t  *.exe) func_stripname '' '.exe' \"$output\"\n\t         output=$func_stripname_result ;;\n\tesac\n\t# test for cygwin because mv fails w/o .exe extensions\n\tcase $host in\n\t  *cygwin*)\n\t    exeext=.exe\n\t    func_stripname '' '.exe' \"$outputname\"\n\t    outputname=$func_stripname_result ;;\n\t  *) exeext= ;;\n\tesac\n\tcase $host in\n\t  *cygwin* | *mingw* )\n\t    func_dirname_and_basename \"$output\" \"\" \".\"\n\t    output_name=$func_basename_result\n\t    output_path=$func_dirname_result\n\t    cwrappersource=$output_path/$objdir/lt-$output_name.c\n\t    cwrapper=$output_path/$output_name.exe\n\t    $RM $cwrappersource $cwrapper\n\t    trap \"$RM $cwrappersource $cwrapper; exit $EXIT_FAILURE\" 1 2 15\n\n\t    func_emit_cwrapperexe_src > $cwrappersource\n\n\t    # The wrapper executable is built using the $host compiler,\n\t    # because it contains $host paths and files. If cross-\n\t    # compiling, it, like the target executable, must be\n\t    # executed on the $host or under an emulation environment.\n\t    $opt_dry_run || {\n\t      $LTCC $LTCFLAGS -o $cwrapper $cwrappersource\n\t      $STRIP $cwrapper\n\t    }\n\n\t    # Now, create the wrapper script for func_source use:\n\t    func_ltwrapper_scriptname $cwrapper\n\t    $RM $func_ltwrapper_scriptname_result\n\t    trap \"$RM $func_ltwrapper_scriptname_result; exit $EXIT_FAILURE\" 1 2 15\n\t    $opt_dry_run || {\n\t      # note: this script will not be executed, so do not chmod.\n\t      if test \"x$build\" = \"x$host\"; then\n\t\t$cwrapper --lt-dump-script > $func_ltwrapper_scriptname_result\n\t      else\n\t\tfunc_emit_wrapper no > $func_ltwrapper_scriptname_result\n\t      fi\n\t    }\n\t  ;;\n\t  * )\n\t    $RM $output\n\t    trap \"$RM $output; exit $EXIT_FAILURE\" 1 2 15\n\n\t    func_emit_wrapper no > $output\n\t    chmod +x $output\n\t  ;;\n\tesac\n      }\n      exit $EXIT_SUCCESS\n      ;;\n    esac\n\n    # See if we need to build an old-fashioned archive.\n    for oldlib in $oldlibs; do\n\n      case $build_libtool_libs in\n        convenience)\n\t  oldobjs=\"$libobjs_save $symfileobj\"\n\t  addlibs=$convenience\n\t  build_libtool_libs=no\n\t  ;;\n\tmodule)\n\t  oldobjs=$libobjs_save\n\t  addlibs=$old_convenience\n\t  build_libtool_libs=no\n          ;;\n\t*)\n\t  oldobjs=\"$old_deplibs $non_pic_objects\"\n\t  $preload && test -f \"$symfileobj\" \\\n\t    && func_append oldobjs \" $symfileobj\"\n\t  addlibs=$old_convenience\n\t  ;;\n      esac\n\n      if test -n \"$addlibs\"; then\n\tgentop=$output_objdir/${outputname}x\n\tfunc_append generated \" $gentop\"\n\n\tfunc_extract_archives $gentop $addlibs\n\tfunc_append oldobjs \" $func_extract_archives_result\"\n      fi\n\n      # Do each command in the archive commands.\n      if test -n \"$old_archive_from_new_cmds\" && test yes = \"$build_libtool_libs\"; then\n\tcmds=$old_archive_from_new_cmds\n      else\n\n\t# Add any objects from preloaded convenience libraries\n\tif test -n \"$dlprefiles\"; then\n\t  gentop=$output_objdir/${outputname}x\n\t  func_append generated \" $gentop\"\n\n\t  func_extract_archives $gentop $dlprefiles\n\t  func_append oldobjs \" $func_extract_archives_result\"\n\tfi\n\n\t# POSIX demands no paths to be encoded in archives.  We have\n\t# to avoid creating archives with duplicate basenames if we\n\t# might have to extract them afterwards, e.g., when creating a\n\t# static archive out of a convenience library, or when linking\n\t# the entirety of a libtool archive into another (currently\n\t# not supported by libtool).\n\tif (for obj in $oldobjs\n\t    do\n\t      func_basename \"$obj\"\n\t      $ECHO \"$func_basename_result\"\n\t    done | sort | sort -uc >/dev/null 2>&1); then\n\t  :\n\telse\n\t  echo \"copying selected object files to avoid basename conflicts...\"\n\t  gentop=$output_objdir/${outputname}x\n\t  func_append generated \" $gentop\"\n\t  func_mkdir_p \"$gentop\"\n\t  save_oldobjs=$oldobjs\n\t  oldobjs=\n\t  counter=1\n\t  for obj in $save_oldobjs\n\t  do\n\t    func_basename \"$obj\"\n\t    objbase=$func_basename_result\n\t    case \" $oldobjs \" in\n\t    \" \") oldobjs=$obj ;;\n\t    *[\\ /]\"$objbase \"*)\n\t      while :; do\n\t\t# Make sure we don't pick an alternate name that also\n\t\t# overlaps.\n\t\tnewobj=lt$counter-$objbase\n\t\tfunc_arith $counter + 1\n\t\tcounter=$func_arith_result\n\t\tcase \" $oldobjs \" in\n\t\t*[\\ /]\"$newobj \"*) ;;\n\t\t*) if test ! -f \"$gentop/$newobj\"; then break; fi ;;\n\t\tesac\n\t      done\n\t      func_show_eval \"ln $obj $gentop/$newobj || cp $obj $gentop/$newobj\"\n\t      func_append oldobjs \" $gentop/$newobj\"\n\t      ;;\n\t    *) func_append oldobjs \" $obj\" ;;\n\t    esac\n\t  done\n\tfi\n\tfunc_to_tool_file \"$oldlib\" func_convert_file_msys_to_w32\n\ttool_oldlib=$func_to_tool_file_result\n\teval cmds=\\\"$old_archive_cmds\\\"\n\n\tfunc_len \" $cmds\"\n\tlen=$func_len_result\n\tif test \"$len\" -lt \"$max_cmd_len\" || test \"$max_cmd_len\" -le -1; then\n\t  cmds=$old_archive_cmds\n\telif test -n \"$archiver_list_spec\"; then\n\t  func_verbose \"using command file archive linking...\"\n\t  for obj in $oldobjs\n\t  do\n\t    func_to_tool_file \"$obj\"\n\t    $ECHO \"$func_to_tool_file_result\"\n\t  done > $output_objdir/$libname.libcmd\n\t  func_to_tool_file \"$output_objdir/$libname.libcmd\"\n\t  oldobjs=\" $archiver_list_spec$func_to_tool_file_result\"\n\t  cmds=$old_archive_cmds\n\telse\n\t  # the command line is too long to link in one step, link in parts\n\t  func_verbose \"using piecewise archive linking...\"\n\t  save_RANLIB=$RANLIB\n\t  RANLIB=:\n\t  objlist=\n\t  concat_cmds=\n\t  save_oldobjs=$oldobjs\n\t  oldobjs=\n\t  # Is there a better way of finding the last object in the list?\n\t  for obj in $save_oldobjs\n\t  do\n\t    last_oldobj=$obj\n\t  done\n\t  eval test_cmds=\\\"$old_archive_cmds\\\"\n\t  func_len \" $test_cmds\"\n\t  len0=$func_len_result\n\t  len=$len0\n\t  for obj in $save_oldobjs\n\t  do\n\t    func_len \" $obj\"\n\t    func_arith $len + $func_len_result\n\t    len=$func_arith_result\n\t    func_append objlist \" $obj\"\n\t    if test \"$len\" -lt \"$max_cmd_len\"; then\n\t      :\n\t    else\n\t      # the above command should be used before it gets too long\n\t      oldobjs=$objlist\n\t      if test \"$obj\" = \"$last_oldobj\"; then\n\t\tRANLIB=$save_RANLIB\n\t      fi\n\t      test -z \"$concat_cmds\" || concat_cmds=$concat_cmds~\n\t      eval concat_cmds=\\\"\\$concat_cmds$old_archive_cmds\\\"\n\t      objlist=\n\t      len=$len0\n\t    fi\n\t  done\n\t  RANLIB=$save_RANLIB\n\t  oldobjs=$objlist\n\t  if test -z \"$oldobjs\"; then\n\t    eval cmds=\\\"\\$concat_cmds\\\"\n\t  else\n\t    eval cmds=\\\"\\$concat_cmds~\\$old_archive_cmds\\\"\n\t  fi\n\tfi\n      fi\n      func_execute_cmds \"$cmds\" 'exit $?'\n    done\n\n    test -n \"$generated\" && \\\n      func_show_eval \"${RM}r$generated\"\n\n    # Now create the libtool archive.\n    case $output in\n    *.la)\n      old_library=\n      test yes = \"$build_old_libs\" && old_library=$libname.$libext\n      func_verbose \"creating $output\"\n\n      # Preserve any variables that may affect compiler behavior\n      for var in $variables_saved_for_relink; do\n\tif eval test -z \\\"\\${$var+set}\\\"; then\n\t  relink_command=\"{ test -z \\\"\\${$var+set}\\\" || $lt_unset $var || { $var=; export $var; }; }; $relink_command\"\n\telif eval var_value=\\$$var; test -z \"$var_value\"; then\n\t  relink_command=\"$var=; export $var; $relink_command\"\n\telse\n\t  func_quote_for_eval \"$var_value\"\n\t  relink_command=\"$var=$func_quote_for_eval_result; export $var; $relink_command\"\n\tfi\n      done\n      # Quote the link command for shipping.\n      relink_command=\"(cd `pwd`; $SHELL \\\"$progpath\\\" $preserve_args --mode=relink $libtool_args @inst_prefix_dir@)\"\n      relink_command=`$ECHO \"$relink_command\" | $SED \"$sed_quote_subst\"`\n      if test yes = \"$hardcode_automatic\"; then\n\trelink_command=\n      fi\n\n      # Only create the output if not a dry run.\n      $opt_dry_run || {\n\tfor installed in no yes; do\n\t  if test yes = \"$installed\"; then\n\t    if test -z \"$install_libdir\"; then\n\t      break\n\t    fi\n\t    output=$output_objdir/${outputname}i\n\t    # Replace all uninstalled libtool libraries with the installed ones\n\t    newdependency_libs=\n\t    for deplib in $dependency_libs; do\n\t      case $deplib in\n\t      *.la)\n\t\tfunc_basename \"$deplib\"\n\t\tname=$func_basename_result\n\t\tfunc_resolve_sysroot \"$deplib\"\n\t\teval libdir=`$SED -n -e 's/^libdir=\\(.*\\)$/\\1/p' $func_resolve_sysroot_result`\n\t\ttest -z \"$libdir\" && \\\n\t\t  func_fatal_error \"'$deplib' is not a valid libtool archive\"\n\t\tfunc_append newdependency_libs \" ${lt_sysroot:+=}$libdir/$name\"\n\t\t;;\n\t      -L*)\n\t\tfunc_stripname -L '' \"$deplib\"\n\t\tfunc_replace_sysroot \"$func_stripname_result\"\n\t\tfunc_append newdependency_libs \" -L$func_replace_sysroot_result\"\n\t\t;;\n\t      -R*)\n\t\tfunc_stripname -R '' \"$deplib\"\n\t\tfunc_replace_sysroot \"$func_stripname_result\"\n\t\tfunc_append newdependency_libs \" -R$func_replace_sysroot_result\"\n\t\t;;\n\t      *) func_append newdependency_libs \" $deplib\" ;;\n\t      esac\n\t    done\n\t    dependency_libs=$newdependency_libs\n\t    newdlfiles=\n\n\t    for lib in $dlfiles; do\n\t      case $lib in\n\t      *.la)\n\t        func_basename \"$lib\"\n\t\tname=$func_basename_result\n\t\teval libdir=`$SED -n -e 's/^libdir=\\(.*\\)$/\\1/p' $lib`\n\t\ttest -z \"$libdir\" && \\\n\t\t  func_fatal_error \"'$lib' is not a valid libtool archive\"\n\t\tfunc_append newdlfiles \" ${lt_sysroot:+=}$libdir/$name\"\n\t\t;;\n\t      *) func_append newdlfiles \" $lib\" ;;\n\t      esac\n\t    done\n\t    dlfiles=$newdlfiles\n\t    newdlprefiles=\n\t    for lib in $dlprefiles; do\n\t      case $lib in\n\t      *.la)\n\t\t# Only pass preopened files to the pseudo-archive (for\n\t\t# eventual linking with the app. that links it) if we\n\t\t# didn't already link the preopened objects directly into\n\t\t# the library:\n\t\tfunc_basename \"$lib\"\n\t\tname=$func_basename_result\n\t\teval libdir=`$SED -n -e 's/^libdir=\\(.*\\)$/\\1/p' $lib`\n\t\ttest -z \"$libdir\" && \\\n\t\t  func_fatal_error \"'$lib' is not a valid libtool archive\"\n\t\tfunc_append newdlprefiles \" ${lt_sysroot:+=}$libdir/$name\"\n\t\t;;\n\t      esac\n\t    done\n\t    dlprefiles=$newdlprefiles\n\t  else\n\t    newdlfiles=\n\t    for lib in $dlfiles; do\n\t      case $lib in\n\t\t[\\\\/]* | [A-Za-z]:[\\\\/]*) abs=$lib ;;\n\t\t*) abs=`pwd`\"/$lib\" ;;\n\t      esac\n\t      func_append newdlfiles \" $abs\"\n\t    done\n\t    dlfiles=$newdlfiles\n\t    newdlprefiles=\n\t    for lib in $dlprefiles; do\n\t      case $lib in\n\t\t[\\\\/]* | [A-Za-z]:[\\\\/]*) abs=$lib ;;\n\t\t*) abs=`pwd`\"/$lib\" ;;\n\t      esac\n\t      func_append newdlprefiles \" $abs\"\n\t    done\n\t    dlprefiles=$newdlprefiles\n\t  fi\n\t  $RM $output\n\t  # place dlname in correct position for cygwin\n\t  # In fact, it would be nice if we could use this code for all target\n\t  # systems that can't hard-code library paths into their executables\n\t  # and that have no shared library path variable independent of PATH,\n\t  # but it turns out we can't easily determine that from inspecting\n\t  # libtool variables, so we have to hard-code the OSs to which it\n\t  # applies here; at the moment, that means platforms that use the PE\n\t  # object format with DLL files.  See the long comment at the top of\n\t  # tests/bindir.at for full details.\n\t  tdlname=$dlname\n\t  case $host,$output,$installed,$module,$dlname in\n\t    *cygwin*,*lai,yes,no,*.dll | *mingw*,*lai,yes,no,*.dll | *cegcc*,*lai,yes,no,*.dll)\n\t      # If a -bindir argument was supplied, place the dll there.\n\t      if test -n \"$bindir\"; then\n\t\tfunc_relative_path \"$install_libdir\" \"$bindir\"\n\t\ttdlname=$func_relative_path_result/$dlname\n\t      else\n\t\t# Otherwise fall back on heuristic.\n\t\ttdlname=../bin/$dlname\n\t      fi\n\t      ;;\n\t  esac\n\t  $ECHO > $output \"\\\n# $outputname - a libtool library file\n# Generated by $PROGRAM (GNU $PACKAGE) $VERSION\n#\n# Please DO NOT delete this file!\n# It is necessary for linking the library.\n\n# The name that we can dlopen(3).\ndlname='$tdlname'\n\n# Names of this library.\nlibrary_names='$library_names'\n\n# The name of the static archive.\nold_library='$old_library'\n\n# Linker flags that cannot go in dependency_libs.\ninherited_linker_flags='$new_inherited_linker_flags'\n\n# Libraries that this one depends upon.\ndependency_libs='$dependency_libs'\n\n# Names of additional weak libraries provided by this library\nweak_library_names='$weak_libs'\n\n# Version information for $libname.\ncurrent=$current\nage=$age\nrevision=$revision\n\n# Is this an already installed library?\ninstalled=$installed\n\n# Should we warn about portability when linking against -modules?\nshouldnotlink=$module\n\n# Files to dlopen/dlpreopen\ndlopen='$dlfiles'\ndlpreopen='$dlprefiles'\n\n# Directory that this library needs to be installed in:\nlibdir='$install_libdir'\"\n\t  if test no,yes = \"$installed,$need_relink\"; then\n\t    $ECHO >> $output \"\\\nrelink_command=\\\"$relink_command\\\"\"\n\t  fi\n\tdone\n      }\n\n      # Do a symbolic link so that the libtool archive can be found in\n      # LD_LIBRARY_PATH before the program is installed.\n      func_show_eval '( cd \"$output_objdir\" && $RM \"$outputname\" && $LN_S \"../$outputname\" \"$outputname\" )' 'exit $?'\n      ;;\n    esac\n    exit $EXIT_SUCCESS\n}\n\nif test link = \"$opt_mode\" || test relink = \"$opt_mode\"; then\n  func_mode_link ${1+\"$@\"}\nfi\n\n\n# func_mode_uninstall arg...\nfunc_mode_uninstall ()\n{\n    $debug_cmd\n\n    RM=$nonopt\n    files=\n    rmforce=false\n    exit_status=0\n\n    # This variable tells wrapper scripts just to set variables rather\n    # than running their programs.\n    libtool_install_magic=$magic\n\n    for arg\n    do\n      case $arg in\n      -f) func_append RM \" $arg\"; rmforce=: ;;\n      -*) func_append RM \" $arg\" ;;\n      *) func_append files \" $arg\" ;;\n      esac\n    done\n\n    test -z \"$RM\" && \\\n      func_fatal_help \"you must specify an RM program\"\n\n    rmdirs=\n\n    for file in $files; do\n      func_dirname \"$file\" \"\" \".\"\n      dir=$func_dirname_result\n      if test . = \"$dir\"; then\n\todir=$objdir\n      else\n\todir=$dir/$objdir\n      fi\n      func_basename \"$file\"\n      name=$func_basename_result\n      test uninstall = \"$opt_mode\" && odir=$dir\n\n      # Remember odir for removal later, being careful to avoid duplicates\n      if test clean = \"$opt_mode\"; then\n\tcase \" $rmdirs \" in\n\t  *\" $odir \"*) ;;\n\t  *) func_append rmdirs \" $odir\" ;;\n\tesac\n      fi\n\n      # Don't error if the file doesn't exist and rm -f was used.\n      if { test -L \"$file\"; } >/dev/null 2>&1 ||\n\t { test -h \"$file\"; } >/dev/null 2>&1 ||\n\t test -f \"$file\"; then\n\t:\n      elif test -d \"$file\"; then\n\texit_status=1\n\tcontinue\n      elif $rmforce; then\n\tcontinue\n      fi\n\n      rmfiles=$file\n\n      case $name in\n      *.la)\n\t# Possibly a libtool archive, so verify it.\n\tif func_lalib_p \"$file\"; then\n\t  func_source $dir/$name\n\n\t  # Delete the libtool libraries and symlinks.\n\t  for n in $library_names; do\n\t    func_append rmfiles \" $odir/$n\"\n\t  done\n\t  test -n \"$old_library\" && func_append rmfiles \" $odir/$old_library\"\n\n\t  case $opt_mode in\n\t  clean)\n\t    case \" $library_names \" in\n\t    *\" $dlname \"*) ;;\n\t    *) test -n \"$dlname\" && func_append rmfiles \" $odir/$dlname\" ;;\n\t    esac\n\t    test -n \"$libdir\" && func_append rmfiles \" $odir/$name $odir/${name}i\"\n\t    ;;\n\t  uninstall)\n\t    if test -n \"$library_names\"; then\n\t      # Do each command in the postuninstall commands.\n\t      func_execute_cmds \"$postuninstall_cmds\" '$rmforce || exit_status=1'\n\t    fi\n\n\t    if test -n \"$old_library\"; then\n\t      # Do each command in the old_postuninstall commands.\n\t      func_execute_cmds \"$old_postuninstall_cmds\" '$rmforce || exit_status=1'\n\t    fi\n\t    # FIXME: should reinstall the best remaining shared library.\n\t    ;;\n\t  esac\n\tfi\n\t;;\n\n      *.lo)\n\t# Possibly a libtool object, so verify it.\n\tif func_lalib_p \"$file\"; then\n\n\t  # Read the .lo file\n\t  func_source $dir/$name\n\n\t  # Add PIC object to the list of files to remove.\n\t  if test -n \"$pic_object\" && test none != \"$pic_object\"; then\n\t    func_append rmfiles \" $dir/$pic_object\"\n\t  fi\n\n\t  # Add non-PIC object to the list of files to remove.\n\t  if test -n \"$non_pic_object\" && test none != \"$non_pic_object\"; then\n\t    func_append rmfiles \" $dir/$non_pic_object\"\n\t  fi\n\tfi\n\t;;\n\n      *)\n\tif test clean = \"$opt_mode\"; then\n\t  noexename=$name\n\t  case $file in\n\t  *.exe)\n\t    func_stripname '' '.exe' \"$file\"\n\t    file=$func_stripname_result\n\t    func_stripname '' '.exe' \"$name\"\n\t    noexename=$func_stripname_result\n\t    # $file with .exe has already been added to rmfiles,\n\t    # add $file without .exe\n\t    func_append rmfiles \" $file\"\n\t    ;;\n\t  esac\n\t  # Do a test to see if this is a libtool program.\n\t  if func_ltwrapper_p \"$file\"; then\n\t    if func_ltwrapper_executable_p \"$file\"; then\n\t      func_ltwrapper_scriptname \"$file\"\n\t      relink_command=\n\t      func_source $func_ltwrapper_scriptname_result\n\t      func_append rmfiles \" $func_ltwrapper_scriptname_result\"\n\t    else\n\t      relink_command=\n\t      func_source $dir/$noexename\n\t    fi\n\n\t    # note $name still contains .exe if it was in $file originally\n\t    # as does the version of $file that was added into $rmfiles\n\t    func_append rmfiles \" $odir/$name $odir/${name}S.$objext\"\n\t    if test yes = \"$fast_install\" && test -n \"$relink_command\"; then\n\t      func_append rmfiles \" $odir/lt-$name\"\n\t    fi\n\t    if test \"X$noexename\" != \"X$name\"; then\n\t      func_append rmfiles \" $odir/lt-$noexename.c\"\n\t    fi\n\t  fi\n\tfi\n\t;;\n      esac\n      func_show_eval \"$RM $rmfiles\" 'exit_status=1'\n    done\n\n    # Try to remove the $objdir's in the directories where we deleted files\n    for dir in $rmdirs; do\n      if test -d \"$dir\"; then\n\tfunc_show_eval \"rmdir $dir >/dev/null 2>&1\"\n      fi\n    done\n\n    exit $exit_status\n}\n\nif test uninstall = \"$opt_mode\" || test clean = \"$opt_mode\"; then\n  func_mode_uninstall ${1+\"$@\"}\nfi\n\ntest -z \"$opt_mode\" && {\n  help=$generic_help\n  func_fatal_help \"you must specify a MODE\"\n}\n\ntest -z \"$exec_cmd\" && \\\n  func_fatal_help \"invalid operation mode '$opt_mode'\"\n\nif test -n \"$exec_cmd\"; then\n  eval exec \"$exec_cmd\"\n  exit $EXIT_FAILURE\nfi\n\nexit $exit_status\n\n\n# The TAGs below are defined such that we never get into a situation\n# where we disable both kinds of libraries.  Given conflicting\n# choices, we go for a static library, that is the most portable,\n# since we can't tell whether shared libraries were disabled because\n# the user asked for that or because the platform doesn't support\n# them.  This is particularly important on AIX, because we don't\n# support having both static and shared libraries enabled at the same\n# time on that platform, so we default to a shared-only configuration.\n# If a disable-shared tag is given, we'll fallback to a static-only\n# configuration.  But we'll never go from static-only to shared-only.\n\n# ### BEGIN LIBTOOL TAG CONFIG: disable-shared\nbuild_libtool_libs=no\nbuild_old_libs=yes\n# ### END LIBTOOL TAG CONFIG: disable-shared\n\n# ### BEGIN LIBTOOL TAG CONFIG: disable-static\nbuild_old_libs=`case $build_libtool_libs in yes) echo no;; *) echo yes;; esac`\n# ### END LIBTOOL TAG CONFIG: disable-static\n\n# Local Variables:\n# mode:shell-script\n# sh-indentation:2\n# End:\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/m4/ac_python_devel.m4",
    "content": "dnl @synopsis AC_PYTHON_DEVEL([version])\ndnl\ndnl Note: Defines as a precious variable \"PYTHON_VERSION\". Don't\ndnl override it in your configure.ac.\ndnl\ndnl This macro checks for Python and tries to get the include path to\ndnl 'Python.h'. It provides the $(PYTHON_CPPFLAGS) and\ndnl $(PYTHON_LDFLAGS) output variables. It also exports\ndnl $(PYTHON_EXTRA_LIBS) and $(PYTHON_EXTRA_LDFLAGS) for embedding\ndnl Python in your code.\ndnl\ndnl You can search for some particular version of Python by passing a\ndnl parameter to this macro, for example \">= '2.3.1'\", or \"== '2.4'\".\ndnl Please note that you *have* to pass also an operator along with the\ndnl version to match, and pay special attention to the single quotes\ndnl surrounding the version number. Don't use \"PYTHON_VERSION\" for\ndnl this: that environment variable is declared as precious and thus\ndnl reserved for the end-user.\ndnl\ndnl This macro should work for all versions of Python >= 2.1.0. As an\ndnl end user, you can disable the check for the python version by\ndnl setting the PYTHON_NOVERSIONCHECK environment variable to something\ndnl else than the empty string.\ndnl\ndnl If you need to use this macro for an older Python version, please\ndnl contact the authors. We're always open for feedback.\ndnl\ndnl @category InstalledPackages\ndnl @author Sebastian Huber <sebastian-huber@web.de>\ndnl @author Alan W. Irwin <irwin@beluga.phys.uvic.ca>\ndnl @author Rafael Laboissiere <laboissiere@psy.mpg.de>\ndnl @author Andrew Collier <colliera@nu.ac.za>\ndnl @author Matteo Settenvini <matteo@member.fsf.org>\ndnl @author Horst Knorr <hk_classes@knoda.org>\ndnl @version 2006-05-27\ndnl @license GPLWithACException\n\nAC_DEFUN([AC_PYTHON_DEVEL],[\n\t#\n\t# Allow the use of a (user set) custom python version\n\t#\n\tAC_ARG_VAR([PYTHON_VERSION],[The installed Python\n\t\tversion to use, for example '2.3'. This string\n\t\twill be appended to the Python interpreter\n\t\tcanonical name.])\n\n\tAC_PATH_PROG([PYTHON],[python[$PYTHON_VERSION]])\n\tif test -z \"$PYTHON\"; then\n\t   AC_MSG_ERROR([Cannot find python$PYTHON_VERSION in your system path])\n\t   PYTHON_VERSION=\"\"\n\tfi\n\n\t#\n\t# Check for a version of Python >= 2.1.0\n\t#\n\tAC_MSG_CHECKING([for a version of Python >= '2.1.0'])\n\tac_supports_python_ver=`$PYTHON -c \"import sys, string; \\\n\t\tver = string.split(sys.version)[[0]]; \\\n\t\tprint ver >= '2.1.0'\"`\n\tif test \"$ac_supports_python_ver\" != \"True\"; then\n\t\tif test -z \"$PYTHON_NOVERSIONCHECK\"; then\n\t\t\tAC_MSG_RESULT([no])\n\t\t\tAC_MSG_FAILURE([\nThis version of the AC@&t@_PYTHON_DEVEL macro\ndoesn't work properly with versions of Python before\n2.1.0. You may need to re-run configure, setting the\nvariables PYTHON_CPPFLAGS, PYTHON_LDFLAGS, PYTHON_SITE_PKG,\nPYTHON_EXTRA_LIBS and PYTHON_EXTRA_LDFLAGS by hand.\nMoreover, to disable this check, set PYTHON_NOVERSIONCHECK\nto something else than an empty string.\n])\n\t\telse\n\t\t\tAC_MSG_RESULT([skip at user request])\n\t\tfi\n\telse\n\t\tAC_MSG_RESULT([yes])\n\tfi\n\n\t#\n\t# if the macro parameter ``version'' is set, honour it\n\t#\n\tif test -n \"$1\"; then\n\t\tAC_MSG_CHECKING([for a version of Python $1])\n\t\tac_supports_python_ver=`$PYTHON -c \"import sys, string; \\\n\t\t\tver = string.split(sys.version)[[0]]; \\\n\t\t\tprint ver $1\"`\n\t\tif test \"$ac_supports_python_ver\" = \"True\"; then\n\t   \t   AC_MSG_RESULT([yes])\n\t\telse\n\t\t\tAC_MSG_RESULT([no])\n\t\t\tAC_MSG_ERROR([this package requires Python $1.\nIf you have it installed, but it isn't the default Python\ninterpreter in your system path, please pass the PYTHON_VERSION\nvariable to configure. See ``configure --help'' for reference.\n])\n\t\t\tPYTHON_VERSION=\"\"\n\t\tfi\n\tfi\n\n\t#\n\t# Check if you have distutils, else fail\n\t#\n\tAC_MSG_CHECKING([for the distutils Python package])\n\tac_distutils_result=`$PYTHON -c \"import distutils\" 2>&1`\n\tif test -z \"$ac_distutils_result\"; then\n\t\tAC_MSG_RESULT([yes])\n\telse\n\t\tAC_MSG_RESULT([no])\n\t\tAC_MSG_ERROR([cannot import Python module \"distutils\".\nPlease check your Python installation. The error was:\n$ac_distutils_result])\n\t\tPYTHON_VERSION=\"\"\n\tfi\n\n\t#\n\t# Check for Python include path\n\t#\n\tAC_MSG_CHECKING([for Python include path])\n\tif test -z \"$PYTHON_CPPFLAGS\"; then\n\t\tpython_path=`$PYTHON -c \"import distutils.sysconfig; \\\n           \t\tprint distutils.sysconfig.get_python_inc();\"`\n\t\tif test -n \"${python_path}\"; then\n\t\t   \tpython_path=\"-I$python_path\"\n\t\tfi\n\t\tPYTHON_CPPFLAGS=$python_path\n\tfi\n\tAC_MSG_RESULT([$PYTHON_CPPFLAGS])\n\tAC_SUBST([PYTHON_CPPFLAGS])\n\n\t#\n\t# Check for Python library path\n\t#\n\tAC_MSG_CHECKING([for Python library path])\n\tif test -z \"$PYTHON_LDFLAGS\"; then\n\t\t# (makes two attempts to ensure we've got a version number\n\t\t# from the interpreter)\n\t\tpy_version=`$PYTHON -c \"from distutils.sysconfig import *; \\\n\t\t\tfrom string import join; \\\n\t\t\tprint join(get_config_vars('VERSION'))\"`\n\t\tif test \"$py_version\" == \"[None]\"; then\n\t\t\tif test -n \"$PYTHON_VERSION\"; then\n\t\t\t\tpy_version=$PYTHON_VERSION\n\t\t\telse\n\t\t\t\tpy_version=`$PYTHON -c \"import sys; \\\n\t\t\t\t\tprint sys.version[[:3]]\"`\n\t\t\tfi\n\t\tfi\n\n\t\tPYTHON_LDFLAGS=`$PYTHON -c \"from distutils.sysconfig import *; \\\n\t\t\tfrom string import join; \\\n\t\t\tprint '-L' + get_python_lib(0,1), \\\n\t\t      \t'-lpython';\"`$py_version\n\tfi\n\tAC_MSG_RESULT([$PYTHON_LDFLAGS])\n\tAC_SUBST([PYTHON_LDFLAGS])\n\n\t#\n\t# Check for site packages\n\t#\n\tAC_MSG_CHECKING([for Python site-packages path])\n\tif test -z \"$PYTHON_SITE_PKG\"; then\n\t\tPYTHON_SITE_PKG=`$PYTHON -c \"import distutils.sysconfig; \\\n\t\t        print distutils.sysconfig.get_python_lib(0,0);\"`\n\tfi\n\tAC_MSG_RESULT([$PYTHON_SITE_PKG])\n\tAC_SUBST([PYTHON_SITE_PKG])\n\n\t#\n\t# libraries which must be linked in when embedding\n\t#\n\tAC_MSG_CHECKING(python extra libraries)\n\tif test -z \"$PYTHON_EXTRA_LIBS\"; then\n\t   PYTHON_EXTRA_LIBS=`$PYTHON -c \"import distutils.sysconfig; \\\n                conf = distutils.sysconfig.get_config_var; \\\n                print conf('LOCALMODLIBS'), conf('LIBS')\"`\n\tfi\n\tAC_MSG_RESULT([$PYTHON_EXTRA_LIBS])\n\tAC_SUBST(PYTHON_EXTRA_LIBS)\n\n\t#\n\t# linking flags needed when embedding\n\t#\n\tAC_MSG_CHECKING(python extra linking flags)\n\tif test -z \"$PYTHON_EXTRA_LDFLAGS\"; then\n\t\tPYTHON_EXTRA_LDFLAGS=`$PYTHON -c \"import distutils.sysconfig; \\\n\t\t\tconf = distutils.sysconfig.get_config_var; \\\n\t\t\tprint conf('LINKFORSHARED')\"`\n\tfi\n\tAC_MSG_RESULT([$PYTHON_EXTRA_LDFLAGS])\n\tAC_SUBST(PYTHON_EXTRA_LDFLAGS)\n\n\t#\n\t# final check to see if everything compiles alright\n\t#\n\tAC_MSG_CHECKING([consistency of all components of python development environment])\n\tAC_LANG_PUSH([C])\n\t# save current global flags\n\tLIBS=\"$ac_save_LIBS $PYTHON_LDFLAGS\"\n\tCPPFLAGS=\"$ac_save_CPPFLAGS $PYTHON_CPPFLAGS\"\n\tAC_TRY_LINK([\n\t\t#include <Python.h>\n\t],[\n\t\tPy_Initialize();\n\t],[pythonexists=yes],[pythonexists=no])\n\n\tAC_MSG_RESULT([$pythonexists])\n\n        if test ! \"$pythonexists\" = \"yes\"; then\n\t   AC_MSG_ERROR([\n  Could not link test program to Python. Maybe the main Python library has been\n  installed in some non-standard library path. If so, pass it to configure,\n  via the LDFLAGS environment variable.\n  Example: ./configure LDFLAGS=\"-L/usr/non-standard-path/python/lib\"\n  ============================================================================\n   ERROR!\n   You probably have to install the development version of the Python package\n   for your distribution.  The exact name of this package varies among them.\n  ============================================================================\n\t   ])\n\t  PYTHON_VERSION=\"\"\n\tfi\n\tAC_LANG_POP\n\t# turn back to default flags\n\tCPPFLAGS=\"$ac_save_CPPFLAGS\"\n\tLIBS=\"$ac_save_LIBS\"\n\n\t#\n\t# all done!\n\t#\n])\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/m4/libtool.m4",
    "content": "# libtool.m4 - Configure libtool for the host system. -*-Autoconf-*-\n#\n#   Copyright (C) 1996-2001, 2003-2015 Free Software Foundation, Inc.\n#   Written by Gordon Matzigkeit, 1996\n#\n# This file is free software; the Free Software Foundation gives\n# unlimited permission to copy and/or distribute it, with or without\n# modifications, as long as this notice is preserved.\n\nm4_define([_LT_COPYING], [dnl\n# Copyright (C) 2014 Free Software Foundation, Inc.\n# This is free software; see the source for copying conditions.  There is NO\n# warranty; not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.\n\n# GNU Libtool is free software; you can redistribute it and/or modify\n# it under the terms of the GNU General Public License as published by\n# the Free Software Foundation; either version 2 of of the License, or\n# (at your option) any later version.\n#\n# As a special exception to the GNU General Public License, if you\n# distribute this file as part of a program or library that is built\n# using GNU Libtool, you may include this file under the  same\n# distribution terms that you use for the rest of that program.\n#\n# GNU Libtool is distributed in the hope that it will be useful, but\n# WITHOUT ANY WARRANTY; without even the implied warranty of\n# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n# GNU General Public License for more details.\n#\n# You should have received a copy of the GNU General Public License\n# along with this program.  If not, see <http://www.gnu.org/licenses/>.\n])\n\n# serial 58 LT_INIT\n\n\n# LT_PREREQ(VERSION)\n# ------------------\n# Complain and exit if this libtool version is less that VERSION.\nm4_defun([LT_PREREQ],\n[m4_if(m4_version_compare(m4_defn([LT_PACKAGE_VERSION]), [$1]), -1,\n       [m4_default([$3],\n\t\t   [m4_fatal([Libtool version $1 or higher is required],\n\t\t             63)])],\n       [$2])])\n\n\n# _LT_CHECK_BUILDDIR\n# ------------------\n# Complain if the absolute build directory name contains unusual characters\nm4_defun([_LT_CHECK_BUILDDIR],\n[case `pwd` in\n  *\\ * | *\\\t*)\n    AC_MSG_WARN([Libtool does not cope well with whitespace in `pwd`]) ;;\nesac\n])\n\n\n# LT_INIT([OPTIONS])\n# ------------------\nAC_DEFUN([LT_INIT],\n[AC_PREREQ([2.62])dnl We use AC_PATH_PROGS_FEATURE_CHECK\nAC_REQUIRE([AC_CONFIG_AUX_DIR_DEFAULT])dnl\nAC_BEFORE([$0], [LT_LANG])dnl\nAC_BEFORE([$0], [LT_OUTPUT])dnl\nAC_BEFORE([$0], [LTDL_INIT])dnl\nm4_require([_LT_CHECK_BUILDDIR])dnl\n\ndnl Autoconf doesn't catch unexpanded LT_ macros by default:\nm4_pattern_forbid([^_?LT_[A-Z_]+$])dnl\nm4_pattern_allow([^(_LT_EOF|LT_DLGLOBAL|LT_DLLAZY_OR_NOW|LT_MULTI_MODULE)$])dnl\ndnl aclocal doesn't pull ltoptions.m4, ltsugar.m4, or ltversion.m4\ndnl unless we require an AC_DEFUNed macro:\nAC_REQUIRE([LTOPTIONS_VERSION])dnl\nAC_REQUIRE([LTSUGAR_VERSION])dnl\nAC_REQUIRE([LTVERSION_VERSION])dnl\nAC_REQUIRE([LTOBSOLETE_VERSION])dnl\nm4_require([_LT_PROG_LTMAIN])dnl\n\n_LT_SHELL_INIT([SHELL=${CONFIG_SHELL-/bin/sh}])\n\ndnl Parse OPTIONS\n_LT_SET_OPTIONS([$0], [$1])\n\n# This can be used to rebuild libtool when needed\nLIBTOOL_DEPS=$ltmain\n\n# Always use our own libtool.\nLIBTOOL='$(SHELL) $(top_builddir)/libtool'\nAC_SUBST(LIBTOOL)dnl\n\n_LT_SETUP\n\n# Only expand once:\nm4_define([LT_INIT])\n])# LT_INIT\n\n# Old names:\nAU_ALIAS([AC_PROG_LIBTOOL], [LT_INIT])\nAU_ALIAS([AM_PROG_LIBTOOL], [LT_INIT])\ndnl aclocal-1.4 backwards compatibility:\ndnl AC_DEFUN([AC_PROG_LIBTOOL], [])\ndnl AC_DEFUN([AM_PROG_LIBTOOL], [])\n\n\n# _LT_PREPARE_CC_BASENAME\n# -----------------------\nm4_defun([_LT_PREPARE_CC_BASENAME], [\n# Calculate cc_basename.  Skip known compiler wrappers and cross-prefix.\nfunc_cc_basename ()\n{\n    for cc_temp in @S|@*\"\"; do\n      case $cc_temp in\n        compile | *[[\\\\/]]compile | ccache | *[[\\\\/]]ccache ) ;;\n        distcc | *[[\\\\/]]distcc | purify | *[[\\\\/]]purify ) ;;\n        \\-*) ;;\n        *) break;;\n      esac\n    done\n    func_cc_basename_result=`$ECHO \"$cc_temp\" | $SED \"s%.*/%%; s%^$host_alias-%%\"`\n}\n])# _LT_PREPARE_CC_BASENAME\n\n\n# _LT_CC_BASENAME(CC)\n# -------------------\n# It would be clearer to call AC_REQUIREs from _LT_PREPARE_CC_BASENAME,\n# but that macro is also expanded into generated libtool script, which\n# arranges for $SED and $ECHO to be set by different means.\nm4_defun([_LT_CC_BASENAME],\n[m4_require([_LT_PREPARE_CC_BASENAME])dnl\nAC_REQUIRE([_LT_DECL_SED])dnl\nAC_REQUIRE([_LT_PROG_ECHO_BACKSLASH])dnl\nfunc_cc_basename $1\ncc_basename=$func_cc_basename_result\n])\n\n\n# _LT_FILEUTILS_DEFAULTS\n# ----------------------\n# It is okay to use these file commands and assume they have been set\n# sensibly after 'm4_require([_LT_FILEUTILS_DEFAULTS])'.\nm4_defun([_LT_FILEUTILS_DEFAULTS],\n[: ${CP=\"cp -f\"}\n: ${MV=\"mv -f\"}\n: ${RM=\"rm -f\"}\n])# _LT_FILEUTILS_DEFAULTS\n\n\n# _LT_SETUP\n# ---------\nm4_defun([_LT_SETUP],\n[AC_REQUIRE([AC_CANONICAL_HOST])dnl\nAC_REQUIRE([AC_CANONICAL_BUILD])dnl\nAC_REQUIRE([_LT_PREPARE_SED_QUOTE_VARS])dnl\nAC_REQUIRE([_LT_PROG_ECHO_BACKSLASH])dnl\n\n_LT_DECL([], [PATH_SEPARATOR], [1], [The PATH separator for the build system])dnl\ndnl\n_LT_DECL([], [host_alias], [0], [The host system])dnl\n_LT_DECL([], [host], [0])dnl\n_LT_DECL([], [host_os], [0])dnl\ndnl\n_LT_DECL([], [build_alias], [0], [The build system])dnl\n_LT_DECL([], [build], [0])dnl\n_LT_DECL([], [build_os], [0])dnl\ndnl\nAC_REQUIRE([AC_PROG_CC])dnl\nAC_REQUIRE([LT_PATH_LD])dnl\nAC_REQUIRE([LT_PATH_NM])dnl\ndnl\nAC_REQUIRE([AC_PROG_LN_S])dnl\ntest -z \"$LN_S\" && LN_S=\"ln -s\"\n_LT_DECL([], [LN_S], [1], [Whether we need soft or hard links])dnl\ndnl\nAC_REQUIRE([LT_CMD_MAX_LEN])dnl\n_LT_DECL([objext], [ac_objext], [0], [Object file suffix (normally \"o\")])dnl\n_LT_DECL([], [exeext], [0], [Executable file suffix (normally \"\")])dnl\ndnl\nm4_require([_LT_FILEUTILS_DEFAULTS])dnl\nm4_require([_LT_CHECK_SHELL_FEATURES])dnl\nm4_require([_LT_PATH_CONVERSION_FUNCTIONS])dnl\nm4_require([_LT_CMD_RELOAD])dnl\nm4_require([_LT_CHECK_MAGIC_METHOD])dnl\nm4_require([_LT_CHECK_SHAREDLIB_FROM_LINKLIB])dnl\nm4_require([_LT_CMD_OLD_ARCHIVE])dnl\nm4_require([_LT_CMD_GLOBAL_SYMBOLS])dnl\nm4_require([_LT_WITH_SYSROOT])dnl\nm4_require([_LT_CMD_TRUNCATE])dnl\n\n_LT_CONFIG_LIBTOOL_INIT([\n# See if we are running on zsh, and set the options that allow our\n# commands through without removal of \\ escapes INIT.\nif test -n \"\\${ZSH_VERSION+set}\"; then\n   setopt NO_GLOB_SUBST\nfi\n])\nif test -n \"${ZSH_VERSION+set}\"; then\n   setopt NO_GLOB_SUBST\nfi\n\n_LT_CHECK_OBJDIR\n\nm4_require([_LT_TAG_COMPILER])dnl\n\ncase $host_os in\naix3*)\n  # AIX sometimes has problems with the GCC collect2 program.  For some\n  # reason, if we set the COLLECT_NAMES environment variable, the problems\n  # vanish in a puff of smoke.\n  if test set != \"${COLLECT_NAMES+set}\"; then\n    COLLECT_NAMES=\n    export COLLECT_NAMES\n  fi\n  ;;\nesac\n\n# Global variables:\nofile=libtool\ncan_build_shared=yes\n\n# All known linkers require a '.a' archive for static linking (except MSVC,\n# which needs '.lib').\nlibext=a\n\nwith_gnu_ld=$lt_cv_prog_gnu_ld\n\nold_CC=$CC\nold_CFLAGS=$CFLAGS\n\n# Set sane defaults for various variables\ntest -z \"$CC\" && CC=cc\ntest -z \"$LTCC\" && LTCC=$CC\ntest -z \"$LTCFLAGS\" && LTCFLAGS=$CFLAGS\ntest -z \"$LD\" && LD=ld\ntest -z \"$ac_objext\" && ac_objext=o\n\n_LT_CC_BASENAME([$compiler])\n\n# Only perform the check for file, if the check method requires it\ntest -z \"$MAGIC_CMD\" && MAGIC_CMD=file\ncase $deplibs_check_method in\nfile_magic*)\n  if test \"$file_magic_cmd\" = '$MAGIC_CMD'; then\n    _LT_PATH_MAGIC\n  fi\n  ;;\nesac\n\n# Use C for the default configuration in the libtool script\nLT_SUPPORTED_TAG([CC])\n_LT_LANG_C_CONFIG\n_LT_LANG_DEFAULT_CONFIG\n_LT_CONFIG_COMMANDS\n])# _LT_SETUP\n\n\n# _LT_PREPARE_SED_QUOTE_VARS\n# --------------------------\n# Define a few sed substitution that help us do robust quoting.\nm4_defun([_LT_PREPARE_SED_QUOTE_VARS],\n[# Backslashify metacharacters that are still active within\n# double-quoted strings.\nsed_quote_subst='s/\\([[\"`$\\\\]]\\)/\\\\\\1/g'\n\n# Same as above, but do not quote variable references.\ndouble_quote_subst='s/\\([[\"`\\\\]]\\)/\\\\\\1/g'\n\n# Sed substitution to delay expansion of an escaped shell variable in a\n# double_quote_subst'ed string.\ndelay_variable_subst='s/\\\\\\\\\\\\\\\\\\\\\\$/\\\\\\\\\\\\$/g'\n\n# Sed substitution to delay expansion of an escaped single quote.\ndelay_single_quote_subst='s/'\\''/'\\'\\\\\\\\\\\\\\'\\''/g'\n\n# Sed substitution to avoid accidental globbing in evaled expressions\nno_glob_subst='s/\\*/\\\\\\*/g'\n])\n\n# _LT_PROG_LTMAIN\n# ---------------\n# Note that this code is called both from 'configure', and 'config.status'\n# now that we use AC_CONFIG_COMMANDS to generate libtool.  Notably,\n# 'config.status' has no value for ac_aux_dir unless we are using Automake,\n# so we pass a copy along to make sure it has a sensible value anyway.\nm4_defun([_LT_PROG_LTMAIN],\n[m4_ifdef([AC_REQUIRE_AUX_FILE], [AC_REQUIRE_AUX_FILE([ltmain.sh])])dnl\n_LT_CONFIG_LIBTOOL_INIT([ac_aux_dir='$ac_aux_dir'])\nltmain=$ac_aux_dir/ltmain.sh\n])# _LT_PROG_LTMAIN\n\n\n## ------------------------------------- ##\n## Accumulate code for creating libtool. ##\n## ------------------------------------- ##\n\n# So that we can recreate a full libtool script including additional\n# tags, we accumulate the chunks of code to send to AC_CONFIG_COMMANDS\n# in macros and then make a single call at the end using the 'libtool'\n# label.\n\n\n# _LT_CONFIG_LIBTOOL_INIT([INIT-COMMANDS])\n# ----------------------------------------\n# Register INIT-COMMANDS to be passed to AC_CONFIG_COMMANDS later.\nm4_define([_LT_CONFIG_LIBTOOL_INIT],\n[m4_ifval([$1],\n          [m4_append([_LT_OUTPUT_LIBTOOL_INIT],\n                     [$1\n])])])\n\n# Initialize.\nm4_define([_LT_OUTPUT_LIBTOOL_INIT])\n\n\n# _LT_CONFIG_LIBTOOL([COMMANDS])\n# ------------------------------\n# Register COMMANDS to be passed to AC_CONFIG_COMMANDS later.\nm4_define([_LT_CONFIG_LIBTOOL],\n[m4_ifval([$1],\n          [m4_append([_LT_OUTPUT_LIBTOOL_COMMANDS],\n                     [$1\n])])])\n\n# Initialize.\nm4_define([_LT_OUTPUT_LIBTOOL_COMMANDS])\n\n\n# _LT_CONFIG_SAVE_COMMANDS([COMMANDS], [INIT_COMMANDS])\n# -----------------------------------------------------\nm4_defun([_LT_CONFIG_SAVE_COMMANDS],\n[_LT_CONFIG_LIBTOOL([$1])\n_LT_CONFIG_LIBTOOL_INIT([$2])\n])\n\n\n# _LT_FORMAT_COMMENT([COMMENT])\n# -----------------------------\n# Add leading comment marks to the start of each line, and a trailing\n# full-stop to the whole comment if one is not present already.\nm4_define([_LT_FORMAT_COMMENT],\n[m4_ifval([$1], [\nm4_bpatsubst([m4_bpatsubst([$1], [^ *], [# ])],\n              [['`$\\]], [\\\\\\&])]m4_bmatch([$1], [[!?.]$], [], [.])\n)])\n\n\n\n## ------------------------ ##\n## FIXME: Eliminate VARNAME ##\n## ------------------------ ##\n\n\n# _LT_DECL([CONFIGNAME], VARNAME, VALUE, [DESCRIPTION], [IS-TAGGED?])\n# -------------------------------------------------------------------\n# CONFIGNAME is the name given to the value in the libtool script.\n# VARNAME is the (base) name used in the configure script.\n# VALUE may be 0, 1 or 2 for a computed quote escaped value based on\n# VARNAME.  Any other value will be used directly.\nm4_define([_LT_DECL],\n[lt_if_append_uniq([lt_decl_varnames], [$2], [, ],\n    [lt_dict_add_subkey([lt_decl_dict], [$2], [libtool_name],\n\t[m4_ifval([$1], [$1], [$2])])\n    lt_dict_add_subkey([lt_decl_dict], [$2], [value], [$3])\n    m4_ifval([$4],\n\t[lt_dict_add_subkey([lt_decl_dict], [$2], [description], [$4])])\n    lt_dict_add_subkey([lt_decl_dict], [$2],\n\t[tagged?], [m4_ifval([$5], [yes], [no])])])\n])\n\n\n# _LT_TAGDECL([CONFIGNAME], VARNAME, VALUE, [DESCRIPTION])\n# --------------------------------------------------------\nm4_define([_LT_TAGDECL], [_LT_DECL([$1], [$2], [$3], [$4], [yes])])\n\n\n# lt_decl_tag_varnames([SEPARATOR], [VARNAME1...])\n# ------------------------------------------------\nm4_define([lt_decl_tag_varnames],\n[_lt_decl_filter([tagged?], [yes], $@)])\n\n\n# _lt_decl_filter(SUBKEY, VALUE, [SEPARATOR], [VARNAME1..])\n# ---------------------------------------------------------\nm4_define([_lt_decl_filter],\n[m4_case([$#],\n  [0], [m4_fatal([$0: too few arguments: $#])],\n  [1], [m4_fatal([$0: too few arguments: $#: $1])],\n  [2], [lt_dict_filter([lt_decl_dict], [$1], [$2], [], lt_decl_varnames)],\n  [3], [lt_dict_filter([lt_decl_dict], [$1], [$2], [$3], lt_decl_varnames)],\n  [lt_dict_filter([lt_decl_dict], $@)])[]dnl\n])\n\n\n# lt_decl_quote_varnames([SEPARATOR], [VARNAME1...])\n# --------------------------------------------------\nm4_define([lt_decl_quote_varnames],\n[_lt_decl_filter([value], [1], $@)])\n\n\n# lt_decl_dquote_varnames([SEPARATOR], [VARNAME1...])\n# ---------------------------------------------------\nm4_define([lt_decl_dquote_varnames],\n[_lt_decl_filter([value], [2], $@)])\n\n\n# lt_decl_varnames_tagged([SEPARATOR], [VARNAME1...])\n# ---------------------------------------------------\nm4_define([lt_decl_varnames_tagged],\n[m4_assert([$# <= 2])dnl\n_$0(m4_quote(m4_default([$1], [[, ]])),\n    m4_ifval([$2], [[$2]], [m4_dquote(lt_decl_tag_varnames)]),\n    m4_split(m4_normalize(m4_quote(_LT_TAGS)), [ ]))])\nm4_define([_lt_decl_varnames_tagged],\n[m4_ifval([$3], [lt_combine([$1], [$2], [_], $3)])])\n\n\n# lt_decl_all_varnames([SEPARATOR], [VARNAME1...])\n# ------------------------------------------------\nm4_define([lt_decl_all_varnames],\n[_$0(m4_quote(m4_default([$1], [[, ]])),\n     m4_if([$2], [],\n\t   m4_quote(lt_decl_varnames),\n\tm4_quote(m4_shift($@))))[]dnl\n])\nm4_define([_lt_decl_all_varnames],\n[lt_join($@, lt_decl_varnames_tagged([$1],\n\t\t\tlt_decl_tag_varnames([[, ]], m4_shift($@))))dnl\n])\n\n\n# _LT_CONFIG_STATUS_DECLARE([VARNAME])\n# ------------------------------------\n# Quote a variable value, and forward it to 'config.status' so that its\n# declaration there will have the same value as in 'configure'.  VARNAME\n# must have a single quote delimited value for this to work.\nm4_define([_LT_CONFIG_STATUS_DECLARE],\n[$1='`$ECHO \"$][$1\" | $SED \"$delay_single_quote_subst\"`'])\n\n\n# _LT_CONFIG_STATUS_DECLARATIONS\n# ------------------------------\n# We delimit libtool config variables with single quotes, so when\n# we write them to config.status, we have to be sure to quote all\n# embedded single quotes properly.  In configure, this macro expands\n# each variable declared with _LT_DECL (and _LT_TAGDECL) into:\n#\n#    <var>='`$ECHO \"$<var>\" | $SED \"$delay_single_quote_subst\"`'\nm4_defun([_LT_CONFIG_STATUS_DECLARATIONS],\n[m4_foreach([_lt_var], m4_quote(lt_decl_all_varnames),\n    [m4_n([_LT_CONFIG_STATUS_DECLARE(_lt_var)])])])\n\n\n# _LT_LIBTOOL_TAGS\n# ----------------\n# Output comment and list of tags supported by the script\nm4_defun([_LT_LIBTOOL_TAGS],\n[_LT_FORMAT_COMMENT([The names of the tagged configurations supported by this script])dnl\navailable_tags='_LT_TAGS'dnl\n])\n\n\n# _LT_LIBTOOL_DECLARE(VARNAME, [TAG])\n# -----------------------------------\n# Extract the dictionary values for VARNAME (optionally with TAG) and\n# expand to a commented shell variable setting:\n#\n#    # Some comment about what VAR is for.\n#    visible_name=$lt_internal_name\nm4_define([_LT_LIBTOOL_DECLARE],\n[_LT_FORMAT_COMMENT(m4_quote(lt_dict_fetch([lt_decl_dict], [$1],\n\t\t\t\t\t   [description])))[]dnl\nm4_pushdef([_libtool_name],\n    m4_quote(lt_dict_fetch([lt_decl_dict], [$1], [libtool_name])))[]dnl\nm4_case(m4_quote(lt_dict_fetch([lt_decl_dict], [$1], [value])),\n    [0], [_libtool_name=[$]$1],\n    [1], [_libtool_name=$lt_[]$1],\n    [2], [_libtool_name=$lt_[]$1],\n    [_libtool_name=lt_dict_fetch([lt_decl_dict], [$1], [value])])[]dnl\nm4_ifval([$2], [_$2])[]m4_popdef([_libtool_name])[]dnl\n])\n\n\n# _LT_LIBTOOL_CONFIG_VARS\n# -----------------------\n# Produce commented declarations of non-tagged libtool config variables\n# suitable for insertion in the LIBTOOL CONFIG section of the 'libtool'\n# script.  Tagged libtool config variables (even for the LIBTOOL CONFIG\n# section) are produced by _LT_LIBTOOL_TAG_VARS.\nm4_defun([_LT_LIBTOOL_CONFIG_VARS],\n[m4_foreach([_lt_var],\n    m4_quote(_lt_decl_filter([tagged?], [no], [], lt_decl_varnames)),\n    [m4_n([_LT_LIBTOOL_DECLARE(_lt_var)])])])\n\n\n# _LT_LIBTOOL_TAG_VARS(TAG)\n# -------------------------\nm4_define([_LT_LIBTOOL_TAG_VARS],\n[m4_foreach([_lt_var], m4_quote(lt_decl_tag_varnames),\n    [m4_n([_LT_LIBTOOL_DECLARE(_lt_var, [$1])])])])\n\n\n# _LT_TAGVAR(VARNAME, [TAGNAME])\n# ------------------------------\nm4_define([_LT_TAGVAR], [m4_ifval([$2], [$1_$2], [$1])])\n\n\n# _LT_CONFIG_COMMANDS\n# -------------------\n# Send accumulated output to $CONFIG_STATUS.  Thanks to the lists of\n# variables for single and double quote escaping we saved from calls\n# to _LT_DECL, we can put quote escaped variables declarations\n# into 'config.status', and then the shell code to quote escape them in\n# for loops in 'config.status'.  Finally, any additional code accumulated\n# from calls to _LT_CONFIG_LIBTOOL_INIT is expanded.\nm4_defun([_LT_CONFIG_COMMANDS],\n[AC_PROVIDE_IFELSE([LT_OUTPUT],\n\tdnl If the libtool generation code has been placed in $CONFIG_LT,\n\tdnl instead of duplicating it all over again into config.status,\n\tdnl then we will have config.status run $CONFIG_LT later, so it\n\tdnl needs to know what name is stored there:\n        [AC_CONFIG_COMMANDS([libtool],\n            [$SHELL $CONFIG_LT || AS_EXIT(1)], [CONFIG_LT='$CONFIG_LT'])],\n    dnl If the libtool generation code is destined for config.status,\n    dnl expand the accumulated commands and init code now:\n    [AC_CONFIG_COMMANDS([libtool],\n        [_LT_OUTPUT_LIBTOOL_COMMANDS], [_LT_OUTPUT_LIBTOOL_COMMANDS_INIT])])\n])#_LT_CONFIG_COMMANDS\n\n\n# Initialize.\nm4_define([_LT_OUTPUT_LIBTOOL_COMMANDS_INIT],\n[\n\n# The HP-UX ksh and POSIX shell print the target directory to stdout\n# if CDPATH is set.\n(unset CDPATH) >/dev/null 2>&1 && unset CDPATH\n\nsed_quote_subst='$sed_quote_subst'\ndouble_quote_subst='$double_quote_subst'\ndelay_variable_subst='$delay_variable_subst'\n_LT_CONFIG_STATUS_DECLARATIONS\nLTCC='$LTCC'\nLTCFLAGS='$LTCFLAGS'\ncompiler='$compiler_DEFAULT'\n\n# A function that is used when there is no print builtin or printf.\nfunc_fallback_echo ()\n{\n  eval 'cat <<_LTECHO_EOF\n\\$[]1\n_LTECHO_EOF'\n}\n\n# Quote evaled strings.\nfor var in lt_decl_all_varnames([[ \\\n]], lt_decl_quote_varnames); do\n    case \\`eval \\\\\\\\\\$ECHO \\\\\\\\\"\"\\\\\\\\\\$\\$var\"\\\\\\\\\"\\` in\n    *[[\\\\\\\\\\\\\\`\\\\\"\\\\\\$]]*)\n      eval \"lt_\\$var=\\\\\\\\\\\\\"\\\\\\`\\\\\\$ECHO \\\\\"\\\\\\$\\$var\\\\\" | \\\\\\$SED \\\\\"\\\\\\$sed_quote_subst\\\\\"\\\\\\`\\\\\\\\\\\\\"\" ## exclude from sc_prohibit_nested_quotes\n      ;;\n    *)\n      eval \"lt_\\$var=\\\\\\\\\\\\\"\\\\\\$\\$var\\\\\\\\\\\\\"\"\n      ;;\n    esac\ndone\n\n# Double-quote double-evaled strings.\nfor var in lt_decl_all_varnames([[ \\\n]], lt_decl_dquote_varnames); do\n    case \\`eval \\\\\\\\\\$ECHO \\\\\\\\\"\"\\\\\\\\\\$\\$var\"\\\\\\\\\"\\` in\n    *[[\\\\\\\\\\\\\\`\\\\\"\\\\\\$]]*)\n      eval \"lt_\\$var=\\\\\\\\\\\\\"\\\\\\`\\\\\\$ECHO \\\\\"\\\\\\$\\$var\\\\\" | \\\\\\$SED -e \\\\\"\\\\\\$double_quote_subst\\\\\" -e \\\\\"\\\\\\$sed_quote_subst\\\\\" -e \\\\\"\\\\\\$delay_variable_subst\\\\\"\\\\\\`\\\\\\\\\\\\\"\" ## exclude from sc_prohibit_nested_quotes\n      ;;\n    *)\n      eval \"lt_\\$var=\\\\\\\\\\\\\"\\\\\\$\\$var\\\\\\\\\\\\\"\"\n      ;;\n    esac\ndone\n\n_LT_OUTPUT_LIBTOOL_INIT\n])\n\n# _LT_GENERATED_FILE_INIT(FILE, [COMMENT])\n# ------------------------------------\n# Generate a child script FILE with all initialization necessary to\n# reuse the environment learned by the parent script, and make the\n# file executable.  If COMMENT is supplied, it is inserted after the\n# '#!' sequence but before initialization text begins.  After this\n# macro, additional text can be appended to FILE to form the body of\n# the child script.  The macro ends with non-zero status if the\n# file could not be fully written (such as if the disk is full).\nm4_ifdef([AS_INIT_GENERATED],\n[m4_defun([_LT_GENERATED_FILE_INIT],[AS_INIT_GENERATED($@)])],\n[m4_defun([_LT_GENERATED_FILE_INIT],\n[m4_require([AS_PREPARE])]dnl\n[m4_pushdef([AS_MESSAGE_LOG_FD])]dnl\n[lt_write_fail=0\ncat >$1 <<_ASEOF || lt_write_fail=1\n#! $SHELL\n# Generated by $as_me.\n$2\nSHELL=\\${CONFIG_SHELL-$SHELL}\nexport SHELL\n_ASEOF\ncat >>$1 <<\\_ASEOF || lt_write_fail=1\nAS_SHELL_SANITIZE\n_AS_PREPARE\nexec AS_MESSAGE_FD>&1\n_ASEOF\ntest 0 = \"$lt_write_fail\" && chmod +x $1[]dnl\nm4_popdef([AS_MESSAGE_LOG_FD])])])# _LT_GENERATED_FILE_INIT\n\n# LT_OUTPUT\n# ---------\n# This macro allows early generation of the libtool script (before\n# AC_OUTPUT is called), incase it is used in configure for compilation\n# tests.\nAC_DEFUN([LT_OUTPUT],\n[: ${CONFIG_LT=./config.lt}\nAC_MSG_NOTICE([creating $CONFIG_LT])\n_LT_GENERATED_FILE_INIT([\"$CONFIG_LT\"],\n[# Run this file to recreate a libtool stub with the current configuration.])\n\ncat >>\"$CONFIG_LT\" <<\\_LTEOF\nlt_cl_silent=false\nexec AS_MESSAGE_LOG_FD>>config.log\n{\n  echo\n  AS_BOX([Running $as_me.])\n} >&AS_MESSAGE_LOG_FD\n\nlt_cl_help=\"\\\n'$as_me' creates a local libtool stub from the current configuration,\nfor use in further configure time tests before the real libtool is\ngenerated.\n\nUsage: $[0] [[OPTIONS]]\n\n  -h, --help      print this help, then exit\n  -V, --version   print version number, then exit\n  -q, --quiet     do not print progress messages\n  -d, --debug     don't remove temporary files\n\nReport bugs to <bug-libtool@gnu.org>.\"\n\nlt_cl_version=\"\\\nm4_ifset([AC_PACKAGE_NAME], [AC_PACKAGE_NAME ])config.lt[]dnl\nm4_ifset([AC_PACKAGE_VERSION], [ AC_PACKAGE_VERSION])\nconfigured by $[0], generated by m4_PACKAGE_STRING.\n\nCopyright (C) 2011 Free Software Foundation, Inc.\nThis config.lt script is free software; the Free Software Foundation\ngives unlimited permision to copy, distribute and modify it.\"\n\nwhile test 0 != $[#]\ndo\n  case $[1] in\n    --version | --v* | -V )\n      echo \"$lt_cl_version\"; exit 0 ;;\n    --help | --h* | -h )\n      echo \"$lt_cl_help\"; exit 0 ;;\n    --debug | --d* | -d )\n      debug=: ;;\n    --quiet | --q* | --silent | --s* | -q )\n      lt_cl_silent=: ;;\n\n    -*) AC_MSG_ERROR([unrecognized option: $[1]\nTry '$[0] --help' for more information.]) ;;\n\n    *) AC_MSG_ERROR([unrecognized argument: $[1]\nTry '$[0] --help' for more information.]) ;;\n  esac\n  shift\ndone\n\nif $lt_cl_silent; then\n  exec AS_MESSAGE_FD>/dev/null\nfi\n_LTEOF\n\ncat >>\"$CONFIG_LT\" <<_LTEOF\n_LT_OUTPUT_LIBTOOL_COMMANDS_INIT\n_LTEOF\n\ncat >>\"$CONFIG_LT\" <<\\_LTEOF\nAC_MSG_NOTICE([creating $ofile])\n_LT_OUTPUT_LIBTOOL_COMMANDS\nAS_EXIT(0)\n_LTEOF\nchmod +x \"$CONFIG_LT\"\n\n# configure is writing to config.log, but config.lt does its own redirection,\n# appending to config.log, which fails on DOS, as config.log is still kept\n# open by configure.  Here we exec the FD to /dev/null, effectively closing\n# config.log, so it can be properly (re)opened and appended to by config.lt.\nlt_cl_success=:\ntest yes = \"$silent\" &&\n  lt_config_lt_args=\"$lt_config_lt_args --quiet\"\nexec AS_MESSAGE_LOG_FD>/dev/null\n$SHELL \"$CONFIG_LT\" $lt_config_lt_args || lt_cl_success=false\nexec AS_MESSAGE_LOG_FD>>config.log\n$lt_cl_success || AS_EXIT(1)\n])# LT_OUTPUT\n\n\n# _LT_CONFIG(TAG)\n# ---------------\n# If TAG is the built-in tag, create an initial libtool script with a\n# default configuration from the untagged config vars.  Otherwise add code\n# to config.status for appending the configuration named by TAG from the\n# matching tagged config vars.\nm4_defun([_LT_CONFIG],\n[m4_require([_LT_FILEUTILS_DEFAULTS])dnl\n_LT_CONFIG_SAVE_COMMANDS([\n  m4_define([_LT_TAG], m4_if([$1], [], [C], [$1]))dnl\n  m4_if(_LT_TAG, [C], [\n    # See if we are running on zsh, and set the options that allow our\n    # commands through without removal of \\ escapes.\n    if test -n \"${ZSH_VERSION+set}\"; then\n      setopt NO_GLOB_SUBST\n    fi\n\n    cfgfile=${ofile}T\n    trap \"$RM \\\"$cfgfile\\\"; exit 1\" 1 2 15\n    $RM \"$cfgfile\"\n\n    cat <<_LT_EOF >> \"$cfgfile\"\n#! $SHELL\n# Generated automatically by $as_me ($PACKAGE) $VERSION\n# NOTE: Changes made to this file will be lost: look at ltmain.sh.\n\n# Provide generalized library-building support services.\n# Written by Gordon Matzigkeit, 1996\n\n_LT_COPYING\n_LT_LIBTOOL_TAGS\n\n# Configured defaults for sys_lib_dlsearch_path munging.\n: \\${LT_SYS_LIBRARY_PATH=\"$configure_time_lt_sys_library_path\"}\n\n# ### BEGIN LIBTOOL CONFIG\n_LT_LIBTOOL_CONFIG_VARS\n_LT_LIBTOOL_TAG_VARS\n# ### END LIBTOOL CONFIG\n\n_LT_EOF\n\n    cat <<'_LT_EOF' >> \"$cfgfile\"\n\n# ### BEGIN FUNCTIONS SHARED WITH CONFIGURE\n\n_LT_PREPARE_MUNGE_PATH_LIST\n_LT_PREPARE_CC_BASENAME\n\n# ### END FUNCTIONS SHARED WITH CONFIGURE\n\n_LT_EOF\n\n  case $host_os in\n  aix3*)\n    cat <<\\_LT_EOF >> \"$cfgfile\"\n# AIX sometimes has problems with the GCC collect2 program.  For some\n# reason, if we set the COLLECT_NAMES environment variable, the problems\n# vanish in a puff of smoke.\nif test set != \"${COLLECT_NAMES+set}\"; then\n  COLLECT_NAMES=\n  export COLLECT_NAMES\nfi\n_LT_EOF\n    ;;\n  esac\n\n  _LT_PROG_LTMAIN\n\n  # We use sed instead of cat because bash on DJGPP gets confused if\n  # if finds mixed CR/LF and LF-only lines.  Since sed operates in\n  # text mode, it properly converts lines to CR/LF.  This bash problem\n  # is reportedly fixed, but why not run on old versions too?\n  sed '$q' \"$ltmain\" >> \"$cfgfile\" \\\n     || (rm -f \"$cfgfile\"; exit 1)\n\n   mv -f \"$cfgfile\" \"$ofile\" ||\n    (rm -f \"$ofile\" && cp \"$cfgfile\" \"$ofile\" && rm -f \"$cfgfile\")\n  chmod +x \"$ofile\"\n],\n[cat <<_LT_EOF >> \"$ofile\"\n\ndnl Unfortunately we have to use $1 here, since _LT_TAG is not expanded\ndnl in a comment (ie after a #).\n# ### BEGIN LIBTOOL TAG CONFIG: $1\n_LT_LIBTOOL_TAG_VARS(_LT_TAG)\n# ### END LIBTOOL TAG CONFIG: $1\n_LT_EOF\n])dnl /m4_if\n],\n[m4_if([$1], [], [\n    PACKAGE='$PACKAGE'\n    VERSION='$VERSION'\n    RM='$RM'\n    ofile='$ofile'], [])\n])dnl /_LT_CONFIG_SAVE_COMMANDS\n])# _LT_CONFIG\n\n\n# LT_SUPPORTED_TAG(TAG)\n# ---------------------\n# Trace this macro to discover what tags are supported by the libtool\n# --tag option, using:\n#    autoconf --trace 'LT_SUPPORTED_TAG:$1'\nAC_DEFUN([LT_SUPPORTED_TAG], [])\n\n\n# C support is built-in for now\nm4_define([_LT_LANG_C_enabled], [])\nm4_define([_LT_TAGS], [])\n\n\n# LT_LANG(LANG)\n# -------------\n# Enable libtool support for the given language if not already enabled.\nAC_DEFUN([LT_LANG],\n[AC_BEFORE([$0], [LT_OUTPUT])dnl\nm4_case([$1],\n  [C],\t\t\t[_LT_LANG(C)],\n  [C++],\t\t[_LT_LANG(CXX)],\n  [Go],\t\t\t[_LT_LANG(GO)],\n  [Java],\t\t[_LT_LANG(GCJ)],\n  [Fortran 77],\t\t[_LT_LANG(F77)],\n  [Fortran],\t\t[_LT_LANG(FC)],\n  [Windows Resource],\t[_LT_LANG(RC)],\n  [m4_ifdef([_LT_LANG_]$1[_CONFIG],\n    [_LT_LANG($1)],\n    [m4_fatal([$0: unsupported language: \"$1\"])])])dnl\n])# LT_LANG\n\n\n# _LT_LANG(LANGNAME)\n# ------------------\nm4_defun([_LT_LANG],\n[m4_ifdef([_LT_LANG_]$1[_enabled], [],\n  [LT_SUPPORTED_TAG([$1])dnl\n  m4_append([_LT_TAGS], [$1 ])dnl\n  m4_define([_LT_LANG_]$1[_enabled], [])dnl\n  _LT_LANG_$1_CONFIG($1)])dnl\n])# _LT_LANG\n\n\nm4_ifndef([AC_PROG_GO], [\n############################################################\n# NOTE: This macro has been submitted for inclusion into   #\n#  GNU Autoconf as AC_PROG_GO.  When it is available in    #\n#  a released version of Autoconf we should remove this    #\n#  macro and use it instead.                               #\n############################################################\nm4_defun([AC_PROG_GO],\n[AC_LANG_PUSH(Go)dnl\nAC_ARG_VAR([GOC],     [Go compiler command])dnl\nAC_ARG_VAR([GOFLAGS], [Go compiler flags])dnl\n_AC_ARG_VAR_LDFLAGS()dnl\nAC_CHECK_TOOL(GOC, gccgo)\nif test -z \"$GOC\"; then\n  if test -n \"$ac_tool_prefix\"; then\n    AC_CHECK_PROG(GOC, [${ac_tool_prefix}gccgo], [${ac_tool_prefix}gccgo])\n  fi\nfi\nif test -z \"$GOC\"; then\n  AC_CHECK_PROG(GOC, gccgo, gccgo, false)\nfi\n])#m4_defun\n])#m4_ifndef\n\n\n# _LT_LANG_DEFAULT_CONFIG\n# -----------------------\nm4_defun([_LT_LANG_DEFAULT_CONFIG],\n[AC_PROVIDE_IFELSE([AC_PROG_CXX],\n  [LT_LANG(CXX)],\n  [m4_define([AC_PROG_CXX], defn([AC_PROG_CXX])[LT_LANG(CXX)])])\n\nAC_PROVIDE_IFELSE([AC_PROG_F77],\n  [LT_LANG(F77)],\n  [m4_define([AC_PROG_F77], defn([AC_PROG_F77])[LT_LANG(F77)])])\n\nAC_PROVIDE_IFELSE([AC_PROG_FC],\n  [LT_LANG(FC)],\n  [m4_define([AC_PROG_FC], defn([AC_PROG_FC])[LT_LANG(FC)])])\n\ndnl The call to [A][M_PROG_GCJ] is quoted like that to stop aclocal\ndnl pulling things in needlessly.\nAC_PROVIDE_IFELSE([AC_PROG_GCJ],\n  [LT_LANG(GCJ)],\n  [AC_PROVIDE_IFELSE([A][M_PROG_GCJ],\n    [LT_LANG(GCJ)],\n    [AC_PROVIDE_IFELSE([LT_PROG_GCJ],\n      [LT_LANG(GCJ)],\n      [m4_ifdef([AC_PROG_GCJ],\n\t[m4_define([AC_PROG_GCJ], defn([AC_PROG_GCJ])[LT_LANG(GCJ)])])\n       m4_ifdef([A][M_PROG_GCJ],\n\t[m4_define([A][M_PROG_GCJ], defn([A][M_PROG_GCJ])[LT_LANG(GCJ)])])\n       m4_ifdef([LT_PROG_GCJ],\n\t[m4_define([LT_PROG_GCJ], defn([LT_PROG_GCJ])[LT_LANG(GCJ)])])])])])\n\nAC_PROVIDE_IFELSE([AC_PROG_GO],\n  [LT_LANG(GO)],\n  [m4_define([AC_PROG_GO], defn([AC_PROG_GO])[LT_LANG(GO)])])\n\nAC_PROVIDE_IFELSE([LT_PROG_RC],\n  [LT_LANG(RC)],\n  [m4_define([LT_PROG_RC], defn([LT_PROG_RC])[LT_LANG(RC)])])\n])# _LT_LANG_DEFAULT_CONFIG\n\n# Obsolete macros:\nAU_DEFUN([AC_LIBTOOL_CXX], [LT_LANG(C++)])\nAU_DEFUN([AC_LIBTOOL_F77], [LT_LANG(Fortran 77)])\nAU_DEFUN([AC_LIBTOOL_FC], [LT_LANG(Fortran)])\nAU_DEFUN([AC_LIBTOOL_GCJ], [LT_LANG(Java)])\nAU_DEFUN([AC_LIBTOOL_RC], [LT_LANG(Windows Resource)])\ndnl aclocal-1.4 backwards compatibility:\ndnl AC_DEFUN([AC_LIBTOOL_CXX], [])\ndnl AC_DEFUN([AC_LIBTOOL_F77], [])\ndnl AC_DEFUN([AC_LIBTOOL_FC], [])\ndnl AC_DEFUN([AC_LIBTOOL_GCJ], [])\ndnl AC_DEFUN([AC_LIBTOOL_RC], [])\n\n\n# _LT_TAG_COMPILER\n# ----------------\nm4_defun([_LT_TAG_COMPILER],\n[AC_REQUIRE([AC_PROG_CC])dnl\n\n_LT_DECL([LTCC], [CC], [1], [A C compiler])dnl\n_LT_DECL([LTCFLAGS], [CFLAGS], [1], [LTCC compiler flags])dnl\n_LT_TAGDECL([CC], [compiler], [1], [A language specific compiler])dnl\n_LT_TAGDECL([with_gcc], [GCC], [0], [Is the compiler the GNU compiler?])dnl\n\n# If no C compiler was specified, use CC.\nLTCC=${LTCC-\"$CC\"}\n\n# If no C compiler flags were specified, use CFLAGS.\nLTCFLAGS=${LTCFLAGS-\"$CFLAGS\"}\n\n# Allow CC to be a program name with arguments.\ncompiler=$CC\n])# _LT_TAG_COMPILER\n\n\n# _LT_COMPILER_BOILERPLATE\n# ------------------------\n# Check for compiler boilerplate output or warnings with\n# the simple compiler test code.\nm4_defun([_LT_COMPILER_BOILERPLATE],\n[m4_require([_LT_DECL_SED])dnl\nac_outfile=conftest.$ac_objext\necho \"$lt_simple_compile_test_code\" >conftest.$ac_ext\neval \"$ac_compile\" 2>&1 >/dev/null | $SED '/^$/d; /^ *+/d' >conftest.err\n_lt_compiler_boilerplate=`cat conftest.err`\n$RM conftest*\n])# _LT_COMPILER_BOILERPLATE\n\n\n# _LT_LINKER_BOILERPLATE\n# ----------------------\n# Check for linker boilerplate output or warnings with\n# the simple link test code.\nm4_defun([_LT_LINKER_BOILERPLATE],\n[m4_require([_LT_DECL_SED])dnl\nac_outfile=conftest.$ac_objext\necho \"$lt_simple_link_test_code\" >conftest.$ac_ext\neval \"$ac_link\" 2>&1 >/dev/null | $SED '/^$/d; /^ *+/d' >conftest.err\n_lt_linker_boilerplate=`cat conftest.err`\n$RM -r conftest*\n])# _LT_LINKER_BOILERPLATE\n\n# _LT_REQUIRED_DARWIN_CHECKS\n# -------------------------\nm4_defun_once([_LT_REQUIRED_DARWIN_CHECKS],[\n  case $host_os in\n    rhapsody* | darwin*)\n    AC_CHECK_TOOL([DSYMUTIL], [dsymutil], [:])\n    AC_CHECK_TOOL([NMEDIT], [nmedit], [:])\n    AC_CHECK_TOOL([LIPO], [lipo], [:])\n    AC_CHECK_TOOL([OTOOL], [otool], [:])\n    AC_CHECK_TOOL([OTOOL64], [otool64], [:])\n    _LT_DECL([], [DSYMUTIL], [1],\n      [Tool to manipulate archived DWARF debug symbol files on Mac OS X])\n    _LT_DECL([], [NMEDIT], [1],\n      [Tool to change global to local symbols on Mac OS X])\n    _LT_DECL([], [LIPO], [1],\n      [Tool to manipulate fat objects and archives on Mac OS X])\n    _LT_DECL([], [OTOOL], [1],\n      [ldd/readelf like tool for Mach-O binaries on Mac OS X])\n    _LT_DECL([], [OTOOL64], [1],\n      [ldd/readelf like tool for 64 bit Mach-O binaries on Mac OS X 10.4])\n\n    AC_CACHE_CHECK([for -single_module linker flag],[lt_cv_apple_cc_single_mod],\n      [lt_cv_apple_cc_single_mod=no\n      if test -z \"$LT_MULTI_MODULE\"; then\n\t# By default we will add the -single_module flag. You can override\n\t# by either setting the environment variable LT_MULTI_MODULE\n\t# non-empty at configure time, or by adding -multi_module to the\n\t# link flags.\n\trm -rf libconftest.dylib*\n\techo \"int foo(void){return 1;}\" > conftest.c\n\techo \"$LTCC $LTCFLAGS $LDFLAGS -o libconftest.dylib \\\n-dynamiclib -Wl,-single_module conftest.c\" >&AS_MESSAGE_LOG_FD\n\t$LTCC $LTCFLAGS $LDFLAGS -o libconftest.dylib \\\n\t  -dynamiclib -Wl,-single_module conftest.c 2>conftest.err\n        _lt_result=$?\n\t# If there is a non-empty error log, and \"single_module\"\n\t# appears in it, assume the flag caused a linker warning\n        if test -s conftest.err && $GREP single_module conftest.err; then\n\t  cat conftest.err >&AS_MESSAGE_LOG_FD\n\t# Otherwise, if the output was created with a 0 exit code from\n\t# the compiler, it worked.\n\telif test -f libconftest.dylib && test 0 = \"$_lt_result\"; then\n\t  lt_cv_apple_cc_single_mod=yes\n\telse\n\t  cat conftest.err >&AS_MESSAGE_LOG_FD\n\tfi\n\trm -rf libconftest.dylib*\n\trm -f conftest.*\n      fi])\n\n    AC_CACHE_CHECK([for -exported_symbols_list linker flag],\n      [lt_cv_ld_exported_symbols_list],\n      [lt_cv_ld_exported_symbols_list=no\n      save_LDFLAGS=$LDFLAGS\n      echo \"_main\" > conftest.sym\n      LDFLAGS=\"$LDFLAGS -Wl,-exported_symbols_list,conftest.sym\"\n      AC_LINK_IFELSE([AC_LANG_PROGRAM([],[])],\n\t[lt_cv_ld_exported_symbols_list=yes],\n\t[lt_cv_ld_exported_symbols_list=no])\n\tLDFLAGS=$save_LDFLAGS\n    ])\n\n    AC_CACHE_CHECK([for -force_load linker flag],[lt_cv_ld_force_load],\n      [lt_cv_ld_force_load=no\n      cat > conftest.c << _LT_EOF\nint forced_loaded() { return 2;}\n_LT_EOF\n      echo \"$LTCC $LTCFLAGS -c -o conftest.o conftest.c\" >&AS_MESSAGE_LOG_FD\n      $LTCC $LTCFLAGS -c -o conftest.o conftest.c 2>&AS_MESSAGE_LOG_FD\n      echo \"$AR cru libconftest.a conftest.o\" >&AS_MESSAGE_LOG_FD\n      $AR cru libconftest.a conftest.o 2>&AS_MESSAGE_LOG_FD\n      echo \"$RANLIB libconftest.a\" >&AS_MESSAGE_LOG_FD\n      $RANLIB libconftest.a 2>&AS_MESSAGE_LOG_FD\n      cat > conftest.c << _LT_EOF\nint main() { return 0;}\n_LT_EOF\n      echo \"$LTCC $LTCFLAGS $LDFLAGS -o conftest conftest.c -Wl,-force_load,./libconftest.a\" >&AS_MESSAGE_LOG_FD\n      $LTCC $LTCFLAGS $LDFLAGS -o conftest conftest.c -Wl,-force_load,./libconftest.a 2>conftest.err\n      _lt_result=$?\n      if test -s conftest.err && $GREP force_load conftest.err; then\n\tcat conftest.err >&AS_MESSAGE_LOG_FD\n      elif test -f conftest && test 0 = \"$_lt_result\" && $GREP forced_load conftest >/dev/null 2>&1; then\n\tlt_cv_ld_force_load=yes\n      else\n\tcat conftest.err >&AS_MESSAGE_LOG_FD\n      fi\n        rm -f conftest.err libconftest.a conftest conftest.c\n        rm -rf conftest.dSYM\n    ])\n    case $host_os in\n    rhapsody* | darwin1.[[012]])\n      _lt_dar_allow_undefined='$wl-undefined ${wl}suppress' ;;\n    darwin1.*)\n      _lt_dar_allow_undefined='$wl-flat_namespace $wl-undefined ${wl}suppress' ;;\n    darwin*) # darwin 5.x on\n      # if running on 10.5 or later, the deployment target defaults\n      # to the OS version, if on x86, and 10.4, the deployment\n      # target defaults to 10.4. Don't you love it?\n      case ${MACOSX_DEPLOYMENT_TARGET-10.0},$host in\n\t10.0,*86*-darwin8*|10.0,*-darwin[[91]]*)\n\t  _lt_dar_allow_undefined='$wl-undefined ${wl}dynamic_lookup' ;;\n\t10.[[012]][[,.]]*)\n\t  _lt_dar_allow_undefined='$wl-flat_namespace $wl-undefined ${wl}suppress' ;;\n\t10.*)\n\t  _lt_dar_allow_undefined='$wl-undefined ${wl}dynamic_lookup' ;;\n      esac\n    ;;\n  esac\n    if test yes = \"$lt_cv_apple_cc_single_mod\"; then\n      _lt_dar_single_mod='$single_module'\n    fi\n    if test yes = \"$lt_cv_ld_exported_symbols_list\"; then\n      _lt_dar_export_syms=' $wl-exported_symbols_list,$output_objdir/$libname-symbols.expsym'\n    else\n      _lt_dar_export_syms='~$NMEDIT -s $output_objdir/$libname-symbols.expsym $lib'\n    fi\n    if test : != \"$DSYMUTIL\" && test no = \"$lt_cv_ld_force_load\"; then\n      _lt_dsymutil='~$DSYMUTIL $lib || :'\n    else\n      _lt_dsymutil=\n    fi\n    ;;\n  esac\n])\n\n\n# _LT_DARWIN_LINKER_FEATURES([TAG])\n# ---------------------------------\n# Checks for linker and compiler features on darwin\nm4_defun([_LT_DARWIN_LINKER_FEATURES],\n[\n  m4_require([_LT_REQUIRED_DARWIN_CHECKS])\n  _LT_TAGVAR(archive_cmds_need_lc, $1)=no\n  _LT_TAGVAR(hardcode_direct, $1)=no\n  _LT_TAGVAR(hardcode_automatic, $1)=yes\n  _LT_TAGVAR(hardcode_shlibpath_var, $1)=unsupported\n  if test yes = \"$lt_cv_ld_force_load\"; then\n    _LT_TAGVAR(whole_archive_flag_spec, $1)='`for conv in $convenience\\\"\\\"; do test  -n \\\"$conv\\\" && new_convenience=\\\"$new_convenience $wl-force_load,$conv\\\"; done; func_echo_all \\\"$new_convenience\\\"`'\n    m4_case([$1], [F77], [_LT_TAGVAR(compiler_needs_object, $1)=yes],\n                  [FC],  [_LT_TAGVAR(compiler_needs_object, $1)=yes])\n  else\n    _LT_TAGVAR(whole_archive_flag_spec, $1)=''\n  fi\n  _LT_TAGVAR(link_all_deplibs, $1)=yes\n  _LT_TAGVAR(allow_undefined_flag, $1)=$_lt_dar_allow_undefined\n  case $cc_basename in\n     ifort*|nagfor*) _lt_dar_can_shared=yes ;;\n     *) _lt_dar_can_shared=$GCC ;;\n  esac\n  if test yes = \"$_lt_dar_can_shared\"; then\n    output_verbose_link_cmd=func_echo_all\n    _LT_TAGVAR(archive_cmds, $1)=\"\\$CC -dynamiclib \\$allow_undefined_flag -o \\$lib \\$libobjs \\$deplibs \\$compiler_flags -install_name \\$rpath/\\$soname \\$verstring $_lt_dar_single_mod$_lt_dsymutil\"\n    _LT_TAGVAR(module_cmds, $1)=\"\\$CC \\$allow_undefined_flag -o \\$lib -bundle \\$libobjs \\$deplibs \\$compiler_flags$_lt_dsymutil\"\n    _LT_TAGVAR(archive_expsym_cmds, $1)=\"sed 's|^|_|' < \\$export_symbols > \\$output_objdir/\\$libname-symbols.expsym~\\$CC -dynamiclib \\$allow_undefined_flag -o \\$lib \\$libobjs \\$deplibs \\$compiler_flags -install_name \\$rpath/\\$soname \\$verstring $_lt_dar_single_mod$_lt_dar_export_syms$_lt_dsymutil\"\n    _LT_TAGVAR(module_expsym_cmds, $1)=\"sed -e 's|^|_|' < \\$export_symbols > \\$output_objdir/\\$libname-symbols.expsym~\\$CC \\$allow_undefined_flag -o \\$lib -bundle \\$libobjs \\$deplibs \\$compiler_flags$_lt_dar_export_syms$_lt_dsymutil\"\n    m4_if([$1], [CXX],\n[   if test yes != \"$lt_cv_apple_cc_single_mod\"; then\n      _LT_TAGVAR(archive_cmds, $1)=\"\\$CC -r -keep_private_externs -nostdlib -o \\$lib-master.o \\$libobjs~\\$CC -dynamiclib \\$allow_undefined_flag -o \\$lib \\$lib-master.o \\$deplibs \\$compiler_flags -install_name \\$rpath/\\$soname \\$verstring$_lt_dsymutil\"\n      _LT_TAGVAR(archive_expsym_cmds, $1)=\"sed 's|^|_|' < \\$export_symbols > \\$output_objdir/\\$libname-symbols.expsym~\\$CC -r -keep_private_externs -nostdlib -o \\$lib-master.o \\$libobjs~\\$CC -dynamiclib \\$allow_undefined_flag -o \\$lib \\$lib-master.o \\$deplibs \\$compiler_flags -install_name \\$rpath/\\$soname \\$verstring$_lt_dar_export_syms$_lt_dsymutil\"\n    fi\n],[])\n  else\n  _LT_TAGVAR(ld_shlibs, $1)=no\n  fi\n])\n\n# _LT_SYS_MODULE_PATH_AIX([TAGNAME])\n# ----------------------------------\n# Links a minimal program and checks the executable\n# for the system default hardcoded library path. In most cases,\n# this is /usr/lib:/lib, but when the MPI compilers are used\n# the location of the communication and MPI libs are included too.\n# If we don't find anything, use the default library path according\n# to the aix ld manual.\n# Store the results from the different compilers for each TAGNAME.\n# Allow to override them for all tags through lt_cv_aix_libpath.\nm4_defun([_LT_SYS_MODULE_PATH_AIX],\n[m4_require([_LT_DECL_SED])dnl\nif test set = \"${lt_cv_aix_libpath+set}\"; then\n  aix_libpath=$lt_cv_aix_libpath\nelse\n  AC_CACHE_VAL([_LT_TAGVAR([lt_cv_aix_libpath_], [$1])],\n  [AC_LINK_IFELSE([AC_LANG_PROGRAM],[\n  lt_aix_libpath_sed='[\n      /Import File Strings/,/^$/ {\n\t  /^0/ {\n\t      s/^0  *\\([^ ]*\\) *$/\\1/\n\t      p\n\t  }\n      }]'\n  _LT_TAGVAR([lt_cv_aix_libpath_], [$1])=`dump -H conftest$ac_exeext 2>/dev/null | $SED -n -e \"$lt_aix_libpath_sed\"`\n  # Check for a 64-bit object if we didn't find anything.\n  if test -z \"$_LT_TAGVAR([lt_cv_aix_libpath_], [$1])\"; then\n    _LT_TAGVAR([lt_cv_aix_libpath_], [$1])=`dump -HX64 conftest$ac_exeext 2>/dev/null | $SED -n -e \"$lt_aix_libpath_sed\"`\n  fi],[])\n  if test -z \"$_LT_TAGVAR([lt_cv_aix_libpath_], [$1])\"; then\n    _LT_TAGVAR([lt_cv_aix_libpath_], [$1])=/usr/lib:/lib\n  fi\n  ])\n  aix_libpath=$_LT_TAGVAR([lt_cv_aix_libpath_], [$1])\nfi\n])# _LT_SYS_MODULE_PATH_AIX\n\n\n# _LT_SHELL_INIT(ARG)\n# -------------------\nm4_define([_LT_SHELL_INIT],\n[m4_divert_text([M4SH-INIT], [$1\n])])# _LT_SHELL_INIT\n\n\n\n# _LT_PROG_ECHO_BACKSLASH\n# -----------------------\n# Find how we can fake an echo command that does not interpret backslash.\n# In particular, with Autoconf 2.60 or later we add some code to the start\n# of the generated configure script that will find a shell with a builtin\n# printf (that we can use as an echo command).\nm4_defun([_LT_PROG_ECHO_BACKSLASH],\n[ECHO='\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\'\nECHO=$ECHO$ECHO$ECHO$ECHO$ECHO\nECHO=$ECHO$ECHO$ECHO$ECHO$ECHO$ECHO\n\nAC_MSG_CHECKING([how to print strings])\n# Test print first, because it will be a builtin if present.\nif test \"X`( print -r -- -n ) 2>/dev/null`\" = X-n && \\\n   test \"X`print -r -- $ECHO 2>/dev/null`\" = \"X$ECHO\"; then\n  ECHO='print -r --'\nelif test \"X`printf %s $ECHO 2>/dev/null`\" = \"X$ECHO\"; then\n  ECHO='printf %s\\n'\nelse\n  # Use this function as a fallback that always works.\n  func_fallback_echo ()\n  {\n    eval 'cat <<_LTECHO_EOF\n$[]1\n_LTECHO_EOF'\n  }\n  ECHO='func_fallback_echo'\nfi\n\n# func_echo_all arg...\n# Invoke $ECHO with all args, space-separated.\nfunc_echo_all ()\n{\n    $ECHO \"$*\"\n}\n\ncase $ECHO in\n  printf*) AC_MSG_RESULT([printf]) ;;\n  print*) AC_MSG_RESULT([print -r]) ;;\n  *) AC_MSG_RESULT([cat]) ;;\nesac\n\nm4_ifdef([_AS_DETECT_SUGGESTED],\n[_AS_DETECT_SUGGESTED([\n  test -n \"${ZSH_VERSION+set}${BASH_VERSION+set}\" || (\n    ECHO='\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\'\n    ECHO=$ECHO$ECHO$ECHO$ECHO$ECHO\n    ECHO=$ECHO$ECHO$ECHO$ECHO$ECHO$ECHO\n    PATH=/empty FPATH=/empty; export PATH FPATH\n    test \"X`printf %s $ECHO`\" = \"X$ECHO\" \\\n      || test \"X`print -r -- $ECHO`\" = \"X$ECHO\" )])])\n\n_LT_DECL([], [SHELL], [1], [Shell to use when invoking shell scripts])\n_LT_DECL([], [ECHO], [1], [An echo program that protects backslashes])\n])# _LT_PROG_ECHO_BACKSLASH\n\n\n# _LT_WITH_SYSROOT\n# ----------------\nAC_DEFUN([_LT_WITH_SYSROOT],\n[AC_MSG_CHECKING([for sysroot])\nAC_ARG_WITH([sysroot],\n[AS_HELP_STRING([--with-sysroot@<:@=DIR@:>@],\n  [Search for dependent libraries within DIR (or the compiler's sysroot\n   if not specified).])],\n[], [with_sysroot=no])\n\ndnl lt_sysroot will always be passed unquoted.  We quote it here\ndnl in case the user passed a directory name.\nlt_sysroot=\ncase $with_sysroot in #(\n yes)\n   if test yes = \"$GCC\"; then\n     lt_sysroot=`$CC --print-sysroot 2>/dev/null`\n   fi\n   ;; #(\n /*)\n   lt_sysroot=`echo \"$with_sysroot\" | sed -e \"$sed_quote_subst\"`\n   ;; #(\n no|'')\n   ;; #(\n *)\n   AC_MSG_RESULT([$with_sysroot])\n   AC_MSG_ERROR([The sysroot must be an absolute path.])\n   ;;\nesac\n\n AC_MSG_RESULT([${lt_sysroot:-no}])\n_LT_DECL([], [lt_sysroot], [0], [The root where to search for ]dnl\n[dependent libraries, and where our libraries should be installed.])])\n\n# _LT_ENABLE_LOCK\n# ---------------\nm4_defun([_LT_ENABLE_LOCK],\n[AC_ARG_ENABLE([libtool-lock],\n  [AS_HELP_STRING([--disable-libtool-lock],\n    [avoid locking (might break parallel builds)])])\ntest no = \"$enable_libtool_lock\" || enable_libtool_lock=yes\n\n# Some flags need to be propagated to the compiler or linker for good\n# libtool support.\ncase $host in\nia64-*-hpux*)\n  # Find out what ABI is being produced by ac_compile, and set mode\n  # options accordingly.\n  echo 'int i;' > conftest.$ac_ext\n  if AC_TRY_EVAL(ac_compile); then\n    case `/usr/bin/file conftest.$ac_objext` in\n      *ELF-32*)\n\tHPUX_IA64_MODE=32\n\t;;\n      *ELF-64*)\n\tHPUX_IA64_MODE=64\n\t;;\n    esac\n  fi\n  rm -rf conftest*\n  ;;\n*-*-irix6*)\n  # Find out what ABI is being produced by ac_compile, and set linker\n  # options accordingly.\n  echo '[#]line '$LINENO' \"configure\"' > conftest.$ac_ext\n  if AC_TRY_EVAL(ac_compile); then\n    if test yes = \"$lt_cv_prog_gnu_ld\"; then\n      case `/usr/bin/file conftest.$ac_objext` in\n\t*32-bit*)\n\t  LD=\"${LD-ld} -melf32bsmip\"\n\t  ;;\n\t*N32*)\n\t  LD=\"${LD-ld} -melf32bmipn32\"\n\t  ;;\n\t*64-bit*)\n\t  LD=\"${LD-ld} -melf64bmip\"\n\t;;\n      esac\n    else\n      case `/usr/bin/file conftest.$ac_objext` in\n\t*32-bit*)\n\t  LD=\"${LD-ld} -32\"\n\t  ;;\n\t*N32*)\n\t  LD=\"${LD-ld} -n32\"\n\t  ;;\n\t*64-bit*)\n\t  LD=\"${LD-ld} -64\"\n\t  ;;\n      esac\n    fi\n  fi\n  rm -rf conftest*\n  ;;\n\nmips64*-*linux*)\n  # Find out what ABI is being produced by ac_compile, and set linker\n  # options accordingly.\n  echo '[#]line '$LINENO' \"configure\"' > conftest.$ac_ext\n  if AC_TRY_EVAL(ac_compile); then\n    emul=elf\n    case `/usr/bin/file conftest.$ac_objext` in\n      *32-bit*)\n\temul=\"${emul}32\"\n\t;;\n      *64-bit*)\n\temul=\"${emul}64\"\n\t;;\n    esac\n    case `/usr/bin/file conftest.$ac_objext` in\n      *MSB*)\n\temul=\"${emul}btsmip\"\n\t;;\n      *LSB*)\n\temul=\"${emul}ltsmip\"\n\t;;\n    esac\n    case `/usr/bin/file conftest.$ac_objext` in\n      *N32*)\n\temul=\"${emul}n32\"\n\t;;\n    esac\n    LD=\"${LD-ld} -m $emul\"\n  fi\n  rm -rf conftest*\n  ;;\n\nx86_64-*kfreebsd*-gnu|x86_64-*linux*|powerpc*-*linux*| \\\ns390*-*linux*|s390*-*tpf*|sparc*-*linux*)\n  # Find out what ABI is being produced by ac_compile, and set linker\n  # options accordingly.  Note that the listed cases only cover the\n  # situations where additional linker options are needed (such as when\n  # doing 32-bit compilation for a host where ld defaults to 64-bit, or\n  # vice versa); the common cases where no linker options are needed do\n  # not appear in the list.\n  echo 'int i;' > conftest.$ac_ext\n  if AC_TRY_EVAL(ac_compile); then\n    case `/usr/bin/file conftest.o` in\n      *32-bit*)\n\tcase $host in\n\t  x86_64-*kfreebsd*-gnu)\n\t    LD=\"${LD-ld} -m elf_i386_fbsd\"\n\t    ;;\n\t  x86_64-*linux*)\n\t    case `/usr/bin/file conftest.o` in\n\t      *x86-64*)\n\t\tLD=\"${LD-ld} -m elf32_x86_64\"\n\t\t;;\n\t      *)\n\t\tLD=\"${LD-ld} -m elf_i386\"\n\t\t;;\n\t    esac\n\t    ;;\n\t  powerpc64le-*linux*)\n\t    LD=\"${LD-ld} -m elf32lppclinux\"\n\t    ;;\n\t  powerpc64-*linux*)\n\t    LD=\"${LD-ld} -m elf32ppclinux\"\n\t    ;;\n\t  s390x-*linux*)\n\t    LD=\"${LD-ld} -m elf_s390\"\n\t    ;;\n\t  sparc64-*linux*)\n\t    LD=\"${LD-ld} -m elf32_sparc\"\n\t    ;;\n\tesac\n\t;;\n      *64-bit*)\n\tcase $host in\n\t  x86_64-*kfreebsd*-gnu)\n\t    LD=\"${LD-ld} -m elf_x86_64_fbsd\"\n\t    ;;\n\t  x86_64-*linux*)\n\t    LD=\"${LD-ld} -m elf_x86_64\"\n\t    ;;\n\t  powerpcle-*linux*)\n\t    LD=\"${LD-ld} -m elf64lppc\"\n\t    ;;\n\t  powerpc-*linux*)\n\t    LD=\"${LD-ld} -m elf64ppc\"\n\t    ;;\n\t  s390*-*linux*|s390*-*tpf*)\n\t    LD=\"${LD-ld} -m elf64_s390\"\n\t    ;;\n\t  sparc*-*linux*)\n\t    LD=\"${LD-ld} -m elf64_sparc\"\n\t    ;;\n\tesac\n\t;;\n    esac\n  fi\n  rm -rf conftest*\n  ;;\n\n*-*-sco3.2v5*)\n  # On SCO OpenServer 5, we need -belf to get full-featured binaries.\n  SAVE_CFLAGS=$CFLAGS\n  CFLAGS=\"$CFLAGS -belf\"\n  AC_CACHE_CHECK([whether the C compiler needs -belf], lt_cv_cc_needs_belf,\n    [AC_LANG_PUSH(C)\n     AC_LINK_IFELSE([AC_LANG_PROGRAM([[]],[[]])],[lt_cv_cc_needs_belf=yes],[lt_cv_cc_needs_belf=no])\n     AC_LANG_POP])\n  if test yes != \"$lt_cv_cc_needs_belf\"; then\n    # this is probably gcc 2.8.0, egcs 1.0 or newer; no need for -belf\n    CFLAGS=$SAVE_CFLAGS\n  fi\n  ;;\n*-*solaris*)\n  # Find out what ABI is being produced by ac_compile, and set linker\n  # options accordingly.\n  echo 'int i;' > conftest.$ac_ext\n  if AC_TRY_EVAL(ac_compile); then\n    case `/usr/bin/file conftest.o` in\n    *64-bit*)\n      case $lt_cv_prog_gnu_ld in\n      yes*)\n        case $host in\n        i?86-*-solaris*|x86_64-*-solaris*)\n          LD=\"${LD-ld} -m elf_x86_64\"\n          ;;\n        sparc*-*-solaris*)\n          LD=\"${LD-ld} -m elf64_sparc\"\n          ;;\n        esac\n        # GNU ld 2.21 introduced _sol2 emulations.  Use them if available.\n        if ${LD-ld} -V | grep _sol2 >/dev/null 2>&1; then\n          LD=${LD-ld}_sol2\n        fi\n        ;;\n      *)\n\tif ${LD-ld} -64 -r -o conftest2.o conftest.o >/dev/null 2>&1; then\n\t  LD=\"${LD-ld} -64\"\n\tfi\n\t;;\n      esac\n      ;;\n    esac\n  fi\n  rm -rf conftest*\n  ;;\nesac\n\nneed_locks=$enable_libtool_lock\n])# _LT_ENABLE_LOCK\n\n\n# _LT_PROG_AR\n# -----------\nm4_defun([_LT_PROG_AR],\n[AC_CHECK_TOOLS(AR, [ar], false)\n: ${AR=ar}\n: ${AR_FLAGS=cru}\n_LT_DECL([], [AR], [1], [The archiver])\n_LT_DECL([], [AR_FLAGS], [1], [Flags to create an archive])\n\nAC_CACHE_CHECK([for archiver @FILE support], [lt_cv_ar_at_file],\n  [lt_cv_ar_at_file=no\n   AC_COMPILE_IFELSE([AC_LANG_PROGRAM],\n     [echo conftest.$ac_objext > conftest.lst\n      lt_ar_try='$AR $AR_FLAGS libconftest.a @conftest.lst >&AS_MESSAGE_LOG_FD'\n      AC_TRY_EVAL([lt_ar_try])\n      if test 0 -eq \"$ac_status\"; then\n\t# Ensure the archiver fails upon bogus file names.\n\trm -f conftest.$ac_objext libconftest.a\n\tAC_TRY_EVAL([lt_ar_try])\n\tif test 0 -ne \"$ac_status\"; then\n          lt_cv_ar_at_file=@\n        fi\n      fi\n      rm -f conftest.* libconftest.a\n     ])\n  ])\n\nif test no = \"$lt_cv_ar_at_file\"; then\n  archiver_list_spec=\nelse\n  archiver_list_spec=$lt_cv_ar_at_file\nfi\n_LT_DECL([], [archiver_list_spec], [1],\n  [How to feed a file listing to the archiver])\n])# _LT_PROG_AR\n\n\n# _LT_CMD_OLD_ARCHIVE\n# -------------------\nm4_defun([_LT_CMD_OLD_ARCHIVE],\n[_LT_PROG_AR\n\nAC_CHECK_TOOL(STRIP, strip, :)\ntest -z \"$STRIP\" && STRIP=:\n_LT_DECL([], [STRIP], [1], [A symbol stripping program])\n\nAC_CHECK_TOOL(RANLIB, ranlib, :)\ntest -z \"$RANLIB\" && RANLIB=:\n_LT_DECL([], [RANLIB], [1],\n    [Commands used to install an old-style archive])\n\n# Determine commands to create old-style static archives.\nold_archive_cmds='$AR $AR_FLAGS $oldlib$oldobjs'\nold_postinstall_cmds='chmod 644 $oldlib'\nold_postuninstall_cmds=\n\nif test -n \"$RANLIB\"; then\n  case $host_os in\n  bitrig* | openbsd*)\n    old_postinstall_cmds=\"$old_postinstall_cmds~\\$RANLIB -t \\$tool_oldlib\"\n    ;;\n  *)\n    old_postinstall_cmds=\"$old_postinstall_cmds~\\$RANLIB \\$tool_oldlib\"\n    ;;\n  esac\n  old_archive_cmds=\"$old_archive_cmds~\\$RANLIB \\$tool_oldlib\"\nfi\n\ncase $host_os in\n  darwin*)\n    lock_old_archive_extraction=yes ;;\n  *)\n    lock_old_archive_extraction=no ;;\nesac\n_LT_DECL([], [old_postinstall_cmds], [2])\n_LT_DECL([], [old_postuninstall_cmds], [2])\n_LT_TAGDECL([], [old_archive_cmds], [2],\n    [Commands used to build an old-style archive])\n_LT_DECL([], [lock_old_archive_extraction], [0],\n    [Whether to use a lock for old archive extraction])\n])# _LT_CMD_OLD_ARCHIVE\n\n\n# _LT_COMPILER_OPTION(MESSAGE, VARIABLE-NAME, FLAGS,\n#\t\t[OUTPUT-FILE], [ACTION-SUCCESS], [ACTION-FAILURE])\n# ----------------------------------------------------------------\n# Check whether the given compiler option works\nAC_DEFUN([_LT_COMPILER_OPTION],\n[m4_require([_LT_FILEUTILS_DEFAULTS])dnl\nm4_require([_LT_DECL_SED])dnl\nAC_CACHE_CHECK([$1], [$2],\n  [$2=no\n   m4_if([$4], , [ac_outfile=conftest.$ac_objext], [ac_outfile=$4])\n   echo \"$lt_simple_compile_test_code\" > conftest.$ac_ext\n   lt_compiler_flag=\"$3\"  ## exclude from sc_useless_quotes_in_assignment\n   # Insert the option either (1) after the last *FLAGS variable, or\n   # (2) before a word containing \"conftest.\", or (3) at the end.\n   # Note that $ac_compile itself does not contain backslashes and begins\n   # with a dollar sign (not a hyphen), so the echo should work correctly.\n   # The option is referenced via a variable to avoid confusing sed.\n   lt_compile=`echo \"$ac_compile\" | $SED \\\n   -e 's:.*FLAGS}\\{0,1\\} :&$lt_compiler_flag :; t' \\\n   -e 's: [[^ ]]*conftest\\.: $lt_compiler_flag&:; t' \\\n   -e 's:$: $lt_compiler_flag:'`\n   (eval echo \"\\\"\\$as_me:$LINENO: $lt_compile\\\"\" >&AS_MESSAGE_LOG_FD)\n   (eval \"$lt_compile\" 2>conftest.err)\n   ac_status=$?\n   cat conftest.err >&AS_MESSAGE_LOG_FD\n   echo \"$as_me:$LINENO: \\$? = $ac_status\" >&AS_MESSAGE_LOG_FD\n   if (exit $ac_status) && test -s \"$ac_outfile\"; then\n     # The compiler can only warn and ignore the option if not recognized\n     # So say no if there are warnings other than the usual output.\n     $ECHO \"$_lt_compiler_boilerplate\" | $SED '/^$/d' >conftest.exp\n     $SED '/^$/d; /^ *+/d' conftest.err >conftest.er2\n     if test ! -s conftest.er2 || diff conftest.exp conftest.er2 >/dev/null; then\n       $2=yes\n     fi\n   fi\n   $RM conftest*\n])\n\nif test yes = \"[$]$2\"; then\n    m4_if([$5], , :, [$5])\nelse\n    m4_if([$6], , :, [$6])\nfi\n])# _LT_COMPILER_OPTION\n\n# Old name:\nAU_ALIAS([AC_LIBTOOL_COMPILER_OPTION], [_LT_COMPILER_OPTION])\ndnl aclocal-1.4 backwards compatibility:\ndnl AC_DEFUN([AC_LIBTOOL_COMPILER_OPTION], [])\n\n\n# _LT_LINKER_OPTION(MESSAGE, VARIABLE-NAME, FLAGS,\n#                  [ACTION-SUCCESS], [ACTION-FAILURE])\n# ----------------------------------------------------\n# Check whether the given linker option works\nAC_DEFUN([_LT_LINKER_OPTION],\n[m4_require([_LT_FILEUTILS_DEFAULTS])dnl\nm4_require([_LT_DECL_SED])dnl\nAC_CACHE_CHECK([$1], [$2],\n  [$2=no\n   save_LDFLAGS=$LDFLAGS\n   LDFLAGS=\"$LDFLAGS $3\"\n   echo \"$lt_simple_link_test_code\" > conftest.$ac_ext\n   if (eval $ac_link 2>conftest.err) && test -s conftest$ac_exeext; then\n     # The linker can only warn and ignore the option if not recognized\n     # So say no if there are warnings\n     if test -s conftest.err; then\n       # Append any errors to the config.log.\n       cat conftest.err 1>&AS_MESSAGE_LOG_FD\n       $ECHO \"$_lt_linker_boilerplate\" | $SED '/^$/d' > conftest.exp\n       $SED '/^$/d; /^ *+/d' conftest.err >conftest.er2\n       if diff conftest.exp conftest.er2 >/dev/null; then\n         $2=yes\n       fi\n     else\n       $2=yes\n     fi\n   fi\n   $RM -r conftest*\n   LDFLAGS=$save_LDFLAGS\n])\n\nif test yes = \"[$]$2\"; then\n    m4_if([$4], , :, [$4])\nelse\n    m4_if([$5], , :, [$5])\nfi\n])# _LT_LINKER_OPTION\n\n# Old name:\nAU_ALIAS([AC_LIBTOOL_LINKER_OPTION], [_LT_LINKER_OPTION])\ndnl aclocal-1.4 backwards compatibility:\ndnl AC_DEFUN([AC_LIBTOOL_LINKER_OPTION], [])\n\n\n# LT_CMD_MAX_LEN\n#---------------\nAC_DEFUN([LT_CMD_MAX_LEN],\n[AC_REQUIRE([AC_CANONICAL_HOST])dnl\n# find the maximum length of command line arguments\nAC_MSG_CHECKING([the maximum length of command line arguments])\nAC_CACHE_VAL([lt_cv_sys_max_cmd_len], [dnl\n  i=0\n  teststring=ABCD\n\n  case $build_os in\n  msdosdjgpp*)\n    # On DJGPP, this test can blow up pretty badly due to problems in libc\n    # (any single argument exceeding 2000 bytes causes a buffer overrun\n    # during glob expansion).  Even if it were fixed, the result of this\n    # check would be larger than it should be.\n    lt_cv_sys_max_cmd_len=12288;    # 12K is about right\n    ;;\n\n  gnu*)\n    # Under GNU Hurd, this test is not required because there is\n    # no limit to the length of command line arguments.\n    # Libtool will interpret -1 as no limit whatsoever\n    lt_cv_sys_max_cmd_len=-1;\n    ;;\n\n  cygwin* | mingw* | cegcc*)\n    # On Win9x/ME, this test blows up -- it succeeds, but takes\n    # about 5 minutes as the teststring grows exponentially.\n    # Worse, since 9x/ME are not pre-emptively multitasking,\n    # you end up with a \"frozen\" computer, even though with patience\n    # the test eventually succeeds (with a max line length of 256k).\n    # Instead, let's just punt: use the minimum linelength reported by\n    # all of the supported platforms: 8192 (on NT/2K/XP).\n    lt_cv_sys_max_cmd_len=8192;\n    ;;\n\n  mint*)\n    # On MiNT this can take a long time and run out of memory.\n    lt_cv_sys_max_cmd_len=8192;\n    ;;\n\n  amigaos*)\n    # On AmigaOS with pdksh, this test takes hours, literally.\n    # So we just punt and use a minimum line length of 8192.\n    lt_cv_sys_max_cmd_len=8192;\n    ;;\n\n  bitrig* | darwin* | dragonfly* | freebsd* | netbsd* | openbsd*)\n    # This has been around since 386BSD, at least.  Likely further.\n    if test -x /sbin/sysctl; then\n      lt_cv_sys_max_cmd_len=`/sbin/sysctl -n kern.argmax`\n    elif test -x /usr/sbin/sysctl; then\n      lt_cv_sys_max_cmd_len=`/usr/sbin/sysctl -n kern.argmax`\n    else\n      lt_cv_sys_max_cmd_len=65536\t# usable default for all BSDs\n    fi\n    # And add a safety zone\n    lt_cv_sys_max_cmd_len=`expr $lt_cv_sys_max_cmd_len \\/ 4`\n    lt_cv_sys_max_cmd_len=`expr $lt_cv_sys_max_cmd_len \\* 3`\n    ;;\n\n  interix*)\n    # We know the value 262144 and hardcode it with a safety zone (like BSD)\n    lt_cv_sys_max_cmd_len=196608\n    ;;\n\n  os2*)\n    # The test takes a long time on OS/2.\n    lt_cv_sys_max_cmd_len=8192\n    ;;\n\n  osf*)\n    # Dr. Hans Ekkehard Plesser reports seeing a kernel panic running configure\n    # due to this test when exec_disable_arg_limit is 1 on Tru64. It is not\n    # nice to cause kernel panics so lets avoid the loop below.\n    # First set a reasonable default.\n    lt_cv_sys_max_cmd_len=16384\n    #\n    if test -x /sbin/sysconfig; then\n      case `/sbin/sysconfig -q proc exec_disable_arg_limit` in\n        *1*) lt_cv_sys_max_cmd_len=-1 ;;\n      esac\n    fi\n    ;;\n  sco3.2v5*)\n    lt_cv_sys_max_cmd_len=102400\n    ;;\n  sysv5* | sco5v6* | sysv4.2uw2*)\n    kargmax=`grep ARG_MAX /etc/conf/cf.d/stune 2>/dev/null`\n    if test -n \"$kargmax\"; then\n      lt_cv_sys_max_cmd_len=`echo $kargmax | sed 's/.*[[\t ]]//'`\n    else\n      lt_cv_sys_max_cmd_len=32768\n    fi\n    ;;\n  *)\n    lt_cv_sys_max_cmd_len=`(getconf ARG_MAX) 2> /dev/null`\n    if test -n \"$lt_cv_sys_max_cmd_len\" && \\\n       test undefined != \"$lt_cv_sys_max_cmd_len\"; then\n      lt_cv_sys_max_cmd_len=`expr $lt_cv_sys_max_cmd_len \\/ 4`\n      lt_cv_sys_max_cmd_len=`expr $lt_cv_sys_max_cmd_len \\* 3`\n    else\n      # Make teststring a little bigger before we do anything with it.\n      # a 1K string should be a reasonable start.\n      for i in 1 2 3 4 5 6 7 8; do\n        teststring=$teststring$teststring\n      done\n      SHELL=${SHELL-${CONFIG_SHELL-/bin/sh}}\n      # If test is not a shell built-in, we'll probably end up computing a\n      # maximum length that is only half of the actual maximum length, but\n      # we can't tell.\n      while { test X`env echo \"$teststring$teststring\" 2>/dev/null` \\\n\t         = \"X$teststring$teststring\"; } >/dev/null 2>&1 &&\n\t      test 17 != \"$i\" # 1/2 MB should be enough\n      do\n        i=`expr $i + 1`\n        teststring=$teststring$teststring\n      done\n      # Only check the string length outside the loop.\n      lt_cv_sys_max_cmd_len=`expr \"X$teststring\" : \".*\" 2>&1`\n      teststring=\n      # Add a significant safety factor because C++ compilers can tack on\n      # massive amounts of additional arguments before passing them to the\n      # linker.  It appears as though 1/2 is a usable value.\n      lt_cv_sys_max_cmd_len=`expr $lt_cv_sys_max_cmd_len \\/ 2`\n    fi\n    ;;\n  esac\n])\nif test -n \"$lt_cv_sys_max_cmd_len\"; then\n  AC_MSG_RESULT($lt_cv_sys_max_cmd_len)\nelse\n  AC_MSG_RESULT(none)\nfi\nmax_cmd_len=$lt_cv_sys_max_cmd_len\n_LT_DECL([], [max_cmd_len], [0],\n    [What is the maximum length of a command?])\n])# LT_CMD_MAX_LEN\n\n# Old name:\nAU_ALIAS([AC_LIBTOOL_SYS_MAX_CMD_LEN], [LT_CMD_MAX_LEN])\ndnl aclocal-1.4 backwards compatibility:\ndnl AC_DEFUN([AC_LIBTOOL_SYS_MAX_CMD_LEN], [])\n\n\n# _LT_HEADER_DLFCN\n# ----------------\nm4_defun([_LT_HEADER_DLFCN],\n[AC_CHECK_HEADERS([dlfcn.h], [], [], [AC_INCLUDES_DEFAULT])dnl\n])# _LT_HEADER_DLFCN\n\n\n# _LT_TRY_DLOPEN_SELF (ACTION-IF-TRUE, ACTION-IF-TRUE-W-USCORE,\n#                      ACTION-IF-FALSE, ACTION-IF-CROSS-COMPILING)\n# ----------------------------------------------------------------\nm4_defun([_LT_TRY_DLOPEN_SELF],\n[m4_require([_LT_HEADER_DLFCN])dnl\nif test yes = \"$cross_compiling\"; then :\n  [$4]\nelse\n  lt_dlunknown=0; lt_dlno_uscore=1; lt_dlneed_uscore=2\n  lt_status=$lt_dlunknown\n  cat > conftest.$ac_ext <<_LT_EOF\n[#line $LINENO \"configure\"\n#include \"confdefs.h\"\n\n#if HAVE_DLFCN_H\n#include <dlfcn.h>\n#endif\n\n#include <stdio.h>\n\n#ifdef RTLD_GLOBAL\n#  define LT_DLGLOBAL\t\tRTLD_GLOBAL\n#else\n#  ifdef DL_GLOBAL\n#    define LT_DLGLOBAL\t\tDL_GLOBAL\n#  else\n#    define LT_DLGLOBAL\t\t0\n#  endif\n#endif\n\n/* We may have to define LT_DLLAZY_OR_NOW in the command line if we\n   find out it does not work in some platform. */\n#ifndef LT_DLLAZY_OR_NOW\n#  ifdef RTLD_LAZY\n#    define LT_DLLAZY_OR_NOW\t\tRTLD_LAZY\n#  else\n#    ifdef DL_LAZY\n#      define LT_DLLAZY_OR_NOW\t\tDL_LAZY\n#    else\n#      ifdef RTLD_NOW\n#        define LT_DLLAZY_OR_NOW\tRTLD_NOW\n#      else\n#        ifdef DL_NOW\n#          define LT_DLLAZY_OR_NOW\tDL_NOW\n#        else\n#          define LT_DLLAZY_OR_NOW\t0\n#        endif\n#      endif\n#    endif\n#  endif\n#endif\n\n/* When -fvisibility=hidden is used, assume the code has been annotated\n   correspondingly for the symbols needed.  */\n#if defined __GNUC__ && (((__GNUC__ == 3) && (__GNUC_MINOR__ >= 3)) || (__GNUC__ > 3))\nint fnord () __attribute__((visibility(\"default\")));\n#endif\n\nint fnord () { return 42; }\nint main ()\n{\n  void *self = dlopen (0, LT_DLGLOBAL|LT_DLLAZY_OR_NOW);\n  int status = $lt_dlunknown;\n\n  if (self)\n    {\n      if (dlsym (self,\"fnord\"))       status = $lt_dlno_uscore;\n      else\n        {\n\t  if (dlsym( self,\"_fnord\"))  status = $lt_dlneed_uscore;\n          else puts (dlerror ());\n\t}\n      /* dlclose (self); */\n    }\n  else\n    puts (dlerror ());\n\n  return status;\n}]\n_LT_EOF\n  if AC_TRY_EVAL(ac_link) && test -s \"conftest$ac_exeext\" 2>/dev/null; then\n    (./conftest; exit; ) >&AS_MESSAGE_LOG_FD 2>/dev/null\n    lt_status=$?\n    case x$lt_status in\n      x$lt_dlno_uscore) $1 ;;\n      x$lt_dlneed_uscore) $2 ;;\n      x$lt_dlunknown|x*) $3 ;;\n    esac\n  else :\n    # compilation failed\n    $3\n  fi\nfi\nrm -fr conftest*\n])# _LT_TRY_DLOPEN_SELF\n\n\n# LT_SYS_DLOPEN_SELF\n# ------------------\nAC_DEFUN([LT_SYS_DLOPEN_SELF],\n[m4_require([_LT_HEADER_DLFCN])dnl\nif test yes != \"$enable_dlopen\"; then\n  enable_dlopen=unknown\n  enable_dlopen_self=unknown\n  enable_dlopen_self_static=unknown\nelse\n  lt_cv_dlopen=no\n  lt_cv_dlopen_libs=\n\n  case $host_os in\n  beos*)\n    lt_cv_dlopen=load_add_on\n    lt_cv_dlopen_libs=\n    lt_cv_dlopen_self=yes\n    ;;\n\n  mingw* | pw32* | cegcc*)\n    lt_cv_dlopen=LoadLibrary\n    lt_cv_dlopen_libs=\n    ;;\n\n  cygwin*)\n    lt_cv_dlopen=dlopen\n    lt_cv_dlopen_libs=\n    ;;\n\n  darwin*)\n    # if libdl is installed we need to link against it\n    AC_CHECK_LIB([dl], [dlopen],\n\t\t[lt_cv_dlopen=dlopen lt_cv_dlopen_libs=-ldl],[\n    lt_cv_dlopen=dyld\n    lt_cv_dlopen_libs=\n    lt_cv_dlopen_self=yes\n    ])\n    ;;\n\n  tpf*)\n    # Don't try to run any link tests for TPF.  We know it's impossible\n    # because TPF is a cross-compiler, and we know how we open DSOs.\n    lt_cv_dlopen=dlopen\n    lt_cv_dlopen_libs=\n    lt_cv_dlopen_self=no\n    ;;\n\n  *)\n    AC_CHECK_FUNC([shl_load],\n\t  [lt_cv_dlopen=shl_load],\n      [AC_CHECK_LIB([dld], [shl_load],\n\t    [lt_cv_dlopen=shl_load lt_cv_dlopen_libs=-ldld],\n\t[AC_CHECK_FUNC([dlopen],\n\t      [lt_cv_dlopen=dlopen],\n\t  [AC_CHECK_LIB([dl], [dlopen],\n\t\t[lt_cv_dlopen=dlopen lt_cv_dlopen_libs=-ldl],\n\t    [AC_CHECK_LIB([svld], [dlopen],\n\t\t  [lt_cv_dlopen=dlopen lt_cv_dlopen_libs=-lsvld],\n\t      [AC_CHECK_LIB([dld], [dld_link],\n\t\t    [lt_cv_dlopen=dld_link lt_cv_dlopen_libs=-ldld])\n\t      ])\n\t    ])\n\t  ])\n\t])\n      ])\n    ;;\n  esac\n\n  if test no = \"$lt_cv_dlopen\"; then\n    enable_dlopen=no\n  else\n    enable_dlopen=yes\n  fi\n\n  case $lt_cv_dlopen in\n  dlopen)\n    save_CPPFLAGS=$CPPFLAGS\n    test yes = \"$ac_cv_header_dlfcn_h\" && CPPFLAGS=\"$CPPFLAGS -DHAVE_DLFCN_H\"\n\n    save_LDFLAGS=$LDFLAGS\n    wl=$lt_prog_compiler_wl eval LDFLAGS=\\\"\\$LDFLAGS $export_dynamic_flag_spec\\\"\n\n    save_LIBS=$LIBS\n    LIBS=\"$lt_cv_dlopen_libs $LIBS\"\n\n    AC_CACHE_CHECK([whether a program can dlopen itself],\n\t  lt_cv_dlopen_self, [dnl\n\t  _LT_TRY_DLOPEN_SELF(\n\t    lt_cv_dlopen_self=yes, lt_cv_dlopen_self=yes,\n\t    lt_cv_dlopen_self=no, lt_cv_dlopen_self=cross)\n    ])\n\n    if test yes = \"$lt_cv_dlopen_self\"; then\n      wl=$lt_prog_compiler_wl eval LDFLAGS=\\\"\\$LDFLAGS $lt_prog_compiler_static\\\"\n      AC_CACHE_CHECK([whether a statically linked program can dlopen itself],\n\t  lt_cv_dlopen_self_static, [dnl\n\t  _LT_TRY_DLOPEN_SELF(\n\t    lt_cv_dlopen_self_static=yes, lt_cv_dlopen_self_static=yes,\n\t    lt_cv_dlopen_self_static=no,  lt_cv_dlopen_self_static=cross)\n      ])\n    fi\n\n    CPPFLAGS=$save_CPPFLAGS\n    LDFLAGS=$save_LDFLAGS\n    LIBS=$save_LIBS\n    ;;\n  esac\n\n  case $lt_cv_dlopen_self in\n  yes|no) enable_dlopen_self=$lt_cv_dlopen_self ;;\n  *) enable_dlopen_self=unknown ;;\n  esac\n\n  case $lt_cv_dlopen_self_static in\n  yes|no) enable_dlopen_self_static=$lt_cv_dlopen_self_static ;;\n  *) enable_dlopen_self_static=unknown ;;\n  esac\nfi\n_LT_DECL([dlopen_support], [enable_dlopen], [0],\n\t [Whether dlopen is supported])\n_LT_DECL([dlopen_self], [enable_dlopen_self], [0],\n\t [Whether dlopen of programs is supported])\n_LT_DECL([dlopen_self_static], [enable_dlopen_self_static], [0],\n\t [Whether dlopen of statically linked programs is supported])\n])# LT_SYS_DLOPEN_SELF\n\n# Old name:\nAU_ALIAS([AC_LIBTOOL_DLOPEN_SELF], [LT_SYS_DLOPEN_SELF])\ndnl aclocal-1.4 backwards compatibility:\ndnl AC_DEFUN([AC_LIBTOOL_DLOPEN_SELF], [])\n\n\n# _LT_COMPILER_C_O([TAGNAME])\n# ---------------------------\n# Check to see if options -c and -o are simultaneously supported by compiler.\n# This macro does not hard code the compiler like AC_PROG_CC_C_O.\nm4_defun([_LT_COMPILER_C_O],\n[m4_require([_LT_DECL_SED])dnl\nm4_require([_LT_FILEUTILS_DEFAULTS])dnl\nm4_require([_LT_TAG_COMPILER])dnl\nAC_CACHE_CHECK([if $compiler supports -c -o file.$ac_objext],\n  [_LT_TAGVAR(lt_cv_prog_compiler_c_o, $1)],\n  [_LT_TAGVAR(lt_cv_prog_compiler_c_o, $1)=no\n   $RM -r conftest 2>/dev/null\n   mkdir conftest\n   cd conftest\n   mkdir out\n   echo \"$lt_simple_compile_test_code\" > conftest.$ac_ext\n\n   lt_compiler_flag=\"-o out/conftest2.$ac_objext\"\n   # Insert the option either (1) after the last *FLAGS variable, or\n   # (2) before a word containing \"conftest.\", or (3) at the end.\n   # Note that $ac_compile itself does not contain backslashes and begins\n   # with a dollar sign (not a hyphen), so the echo should work correctly.\n   lt_compile=`echo \"$ac_compile\" | $SED \\\n   -e 's:.*FLAGS}\\{0,1\\} :&$lt_compiler_flag :; t' \\\n   -e 's: [[^ ]]*conftest\\.: $lt_compiler_flag&:; t' \\\n   -e 's:$: $lt_compiler_flag:'`\n   (eval echo \"\\\"\\$as_me:$LINENO: $lt_compile\\\"\" >&AS_MESSAGE_LOG_FD)\n   (eval \"$lt_compile\" 2>out/conftest.err)\n   ac_status=$?\n   cat out/conftest.err >&AS_MESSAGE_LOG_FD\n   echo \"$as_me:$LINENO: \\$? = $ac_status\" >&AS_MESSAGE_LOG_FD\n   if (exit $ac_status) && test -s out/conftest2.$ac_objext\n   then\n     # The compiler can only warn and ignore the option if not recognized\n     # So say no if there are warnings\n     $ECHO \"$_lt_compiler_boilerplate\" | $SED '/^$/d' > out/conftest.exp\n     $SED '/^$/d; /^ *+/d' out/conftest.err >out/conftest.er2\n     if test ! -s out/conftest.er2 || diff out/conftest.exp out/conftest.er2 >/dev/null; then\n       _LT_TAGVAR(lt_cv_prog_compiler_c_o, $1)=yes\n     fi\n   fi\n   chmod u+w . 2>&AS_MESSAGE_LOG_FD\n   $RM conftest*\n   # SGI C++ compiler will create directory out/ii_files/ for\n   # template instantiation\n   test -d out/ii_files && $RM out/ii_files/* && rmdir out/ii_files\n   $RM out/* && rmdir out\n   cd ..\n   $RM -r conftest\n   $RM conftest*\n])\n_LT_TAGDECL([compiler_c_o], [lt_cv_prog_compiler_c_o], [1],\n\t[Does compiler simultaneously support -c and -o options?])\n])# _LT_COMPILER_C_O\n\n\n# _LT_COMPILER_FILE_LOCKS([TAGNAME])\n# ----------------------------------\n# Check to see if we can do hard links to lock some files if needed\nm4_defun([_LT_COMPILER_FILE_LOCKS],\n[m4_require([_LT_ENABLE_LOCK])dnl\nm4_require([_LT_FILEUTILS_DEFAULTS])dnl\n_LT_COMPILER_C_O([$1])\n\nhard_links=nottested\nif test no = \"$_LT_TAGVAR(lt_cv_prog_compiler_c_o, $1)\" && test no != \"$need_locks\"; then\n  # do not overwrite the value of need_locks provided by the user\n  AC_MSG_CHECKING([if we can lock with hard links])\n  hard_links=yes\n  $RM conftest*\n  ln conftest.a conftest.b 2>/dev/null && hard_links=no\n  touch conftest.a\n  ln conftest.a conftest.b 2>&5 || hard_links=no\n  ln conftest.a conftest.b 2>/dev/null && hard_links=no\n  AC_MSG_RESULT([$hard_links])\n  if test no = \"$hard_links\"; then\n    AC_MSG_WARN(['$CC' does not support '-c -o', so 'make -j' may be unsafe])\n    need_locks=warn\n  fi\nelse\n  need_locks=no\nfi\n_LT_DECL([], [need_locks], [1], [Must we lock files when doing compilation?])\n])# _LT_COMPILER_FILE_LOCKS\n\n\n# _LT_CHECK_OBJDIR\n# ----------------\nm4_defun([_LT_CHECK_OBJDIR],\n[AC_CACHE_CHECK([for objdir], [lt_cv_objdir],\n[rm -f .libs 2>/dev/null\nmkdir .libs 2>/dev/null\nif test -d .libs; then\n  lt_cv_objdir=.libs\nelse\n  # MS-DOS does not allow filenames that begin with a dot.\n  lt_cv_objdir=_libs\nfi\nrmdir .libs 2>/dev/null])\nobjdir=$lt_cv_objdir\n_LT_DECL([], [objdir], [0],\n         [The name of the directory that contains temporary libtool files])dnl\nm4_pattern_allow([LT_OBJDIR])dnl\nAC_DEFINE_UNQUOTED([LT_OBJDIR], \"$lt_cv_objdir/\",\n  [Define to the sub-directory where libtool stores uninstalled libraries.])\n])# _LT_CHECK_OBJDIR\n\n\n# _LT_LINKER_HARDCODE_LIBPATH([TAGNAME])\n# --------------------------------------\n# Check hardcoding attributes.\nm4_defun([_LT_LINKER_HARDCODE_LIBPATH],\n[AC_MSG_CHECKING([how to hardcode library paths into programs])\n_LT_TAGVAR(hardcode_action, $1)=\nif test -n \"$_LT_TAGVAR(hardcode_libdir_flag_spec, $1)\" ||\n   test -n \"$_LT_TAGVAR(runpath_var, $1)\" ||\n   test yes = \"$_LT_TAGVAR(hardcode_automatic, $1)\"; then\n\n  # We can hardcode non-existent directories.\n  if test no != \"$_LT_TAGVAR(hardcode_direct, $1)\" &&\n     # If the only mechanism to avoid hardcoding is shlibpath_var, we\n     # have to relink, otherwise we might link with an installed library\n     # when we should be linking with a yet-to-be-installed one\n     ## test no != \"$_LT_TAGVAR(hardcode_shlibpath_var, $1)\" &&\n     test no != \"$_LT_TAGVAR(hardcode_minus_L, $1)\"; then\n    # Linking always hardcodes the temporary library directory.\n    _LT_TAGVAR(hardcode_action, $1)=relink\n  else\n    # We can link without hardcoding, and we can hardcode nonexisting dirs.\n    _LT_TAGVAR(hardcode_action, $1)=immediate\n  fi\nelse\n  # We cannot hardcode anything, or else we can only hardcode existing\n  # directories.\n  _LT_TAGVAR(hardcode_action, $1)=unsupported\nfi\nAC_MSG_RESULT([$_LT_TAGVAR(hardcode_action, $1)])\n\nif test relink = \"$_LT_TAGVAR(hardcode_action, $1)\" ||\n   test yes = \"$_LT_TAGVAR(inherit_rpath, $1)\"; then\n  # Fast installation is not supported\n  enable_fast_install=no\nelif test yes = \"$shlibpath_overrides_runpath\" ||\n     test no = \"$enable_shared\"; then\n  # Fast installation is not necessary\n  enable_fast_install=needless\nfi\n_LT_TAGDECL([], [hardcode_action], [0],\n    [How to hardcode a shared library path into an executable])\n])# _LT_LINKER_HARDCODE_LIBPATH\n\n\n# _LT_CMD_STRIPLIB\n# ----------------\nm4_defun([_LT_CMD_STRIPLIB],\n[m4_require([_LT_DECL_EGREP])\nstriplib=\nold_striplib=\nAC_MSG_CHECKING([whether stripping libraries is possible])\nif test -n \"$STRIP\" && $STRIP -V 2>&1 | $GREP \"GNU strip\" >/dev/null; then\n  test -z \"$old_striplib\" && old_striplib=\"$STRIP --strip-debug\"\n  test -z \"$striplib\" && striplib=\"$STRIP --strip-unneeded\"\n  AC_MSG_RESULT([yes])\nelse\n# FIXME - insert some real tests, host_os isn't really good enough\n  case $host_os in\n  darwin*)\n    if test -n \"$STRIP\"; then\n      striplib=\"$STRIP -x\"\n      old_striplib=\"$STRIP -S\"\n      AC_MSG_RESULT([yes])\n    else\n      AC_MSG_RESULT([no])\n    fi\n    ;;\n  *)\n    AC_MSG_RESULT([no])\n    ;;\n  esac\nfi\n_LT_DECL([], [old_striplib], [1], [Commands to strip libraries])\n_LT_DECL([], [striplib], [1])\n])# _LT_CMD_STRIPLIB\n\n\n# _LT_PREPARE_MUNGE_PATH_LIST\n# ---------------------------\n# Make sure func_munge_path_list() is defined correctly.\nm4_defun([_LT_PREPARE_MUNGE_PATH_LIST],\n[[# func_munge_path_list VARIABLE PATH\n# -----------------------------------\n# VARIABLE is name of variable containing _space_ separated list of\n# directories to be munged by the contents of PATH, which is string\n# having a format:\n# \"DIR[:DIR]:\"\n#       string \"DIR[ DIR]\" will be prepended to VARIABLE\n# \":DIR[:DIR]\"\n#       string \"DIR[ DIR]\" will be appended to VARIABLE\n# \"DIRP[:DIRP]::[DIRA:]DIRA\"\n#       string \"DIRP[ DIRP]\" will be prepended to VARIABLE and string\n#       \"DIRA[ DIRA]\" will be appended to VARIABLE\n# \"DIR[:DIR]\"\n#       VARIABLE will be replaced by \"DIR[ DIR]\"\nfunc_munge_path_list ()\n{\n    case x@S|@2 in\n    x)\n        ;;\n    *:)\n        eval @S|@1=\\\"`$ECHO @S|@2 | $SED 's/:/ /g'` \\@S|@@S|@1\\\"\n        ;;\n    x:*)\n        eval @S|@1=\\\"\\@S|@@S|@1 `$ECHO @S|@2 | $SED 's/:/ /g'`\\\"\n        ;;\n    *::*)\n        eval @S|@1=\\\"\\@S|@@S|@1\\ `$ECHO @S|@2 | $SED -e 's/.*:://' -e 's/:/ /g'`\\\"\n        eval @S|@1=\\\"`$ECHO @S|@2 | $SED -e 's/::.*//' -e 's/:/ /g'`\\ \\@S|@@S|@1\\\"\n        ;;\n    *)\n        eval @S|@1=\\\"`$ECHO @S|@2 | $SED 's/:/ /g'`\\\"\n        ;;\n    esac\n}\n]])# _LT_PREPARE_PATH_LIST\n\n\n# _LT_SYS_DYNAMIC_LINKER([TAG])\n# -----------------------------\n# PORTME Fill in your ld.so characteristics\nm4_defun([_LT_SYS_DYNAMIC_LINKER],\n[AC_REQUIRE([AC_CANONICAL_HOST])dnl\nm4_require([_LT_DECL_EGREP])dnl\nm4_require([_LT_FILEUTILS_DEFAULTS])dnl\nm4_require([_LT_DECL_OBJDUMP])dnl\nm4_require([_LT_DECL_SED])dnl\nm4_require([_LT_CHECK_SHELL_FEATURES])dnl\nm4_require([_LT_PREPARE_MUNGE_PATH_LIST])dnl\nAC_MSG_CHECKING([dynamic linker characteristics])\nm4_if([$1],\n\t[], [\nif test yes = \"$GCC\"; then\n  case $host_os in\n    darwin*) lt_awk_arg='/^libraries:/,/LR/' ;;\n    *) lt_awk_arg='/^libraries:/' ;;\n  esac\n  case $host_os in\n    mingw* | cegcc*) lt_sed_strip_eq='s|=\\([[A-Za-z]]:\\)|\\1|g' ;;\n    *) lt_sed_strip_eq='s|=/|/|g' ;;\n  esac\n  lt_search_path_spec=`$CC -print-search-dirs | awk $lt_awk_arg | $SED -e \"s/^libraries://\" -e $lt_sed_strip_eq`\n  case $lt_search_path_spec in\n  *\\;*)\n    # if the path contains \";\" then we assume it to be the separator\n    # otherwise default to the standard path separator (i.e. \":\") - it is\n    # assumed that no part of a normal pathname contains \";\" but that should\n    # okay in the real world where \";\" in dirpaths is itself problematic.\n    lt_search_path_spec=`$ECHO \"$lt_search_path_spec\" | $SED 's/;/ /g'`\n    ;;\n  *)\n    lt_search_path_spec=`$ECHO \"$lt_search_path_spec\" | $SED \"s/$PATH_SEPARATOR/ /g\"`\n    ;;\n  esac\n  # Ok, now we have the path, separated by spaces, we can step through it\n  # and add multilib dir if necessary...\n  lt_tmp_lt_search_path_spec=\n  lt_multi_os_dir=/`$CC $CPPFLAGS $CFLAGS $LDFLAGS -print-multi-os-directory 2>/dev/null`\n  # ...but if some path component already ends with the multilib dir we assume\n  # that all is fine and trust -print-search-dirs as is (GCC 4.2? or newer).\n  case \"$lt_multi_os_dir; $lt_search_path_spec \" in\n  \"/; \"* | \"/.; \"* | \"/./; \"* | *\"$lt_multi_os_dir \"* | *\"$lt_multi_os_dir/ \"*)\n    lt_multi_os_dir=\n    ;;\n  esac\n  for lt_sys_path in $lt_search_path_spec; do\n    if test -d \"$lt_sys_path$lt_multi_os_dir\"; then\n      lt_tmp_lt_search_path_spec=\"$lt_tmp_lt_search_path_spec $lt_sys_path$lt_multi_os_dir\"\n    elif test -n \"$lt_multi_os_dir\"; then\n      test -d \"$lt_sys_path\" && \\\n\tlt_tmp_lt_search_path_spec=\"$lt_tmp_lt_search_path_spec $lt_sys_path\"\n    fi\n  done\n  lt_search_path_spec=`$ECHO \"$lt_tmp_lt_search_path_spec\" | awk '\nBEGIN {RS = \" \"; FS = \"/|\\n\";} {\n  lt_foo = \"\";\n  lt_count = 0;\n  for (lt_i = NF; lt_i > 0; lt_i--) {\n    if ($lt_i != \"\" && $lt_i != \".\") {\n      if ($lt_i == \"..\") {\n        lt_count++;\n      } else {\n        if (lt_count == 0) {\n          lt_foo = \"/\" $lt_i lt_foo;\n        } else {\n          lt_count--;\n        }\n      }\n    }\n  }\n  if (lt_foo != \"\") { lt_freq[[lt_foo]]++; }\n  if (lt_freq[[lt_foo]] == 1) { print lt_foo; }\n}'`\n  # AWK program above erroneously prepends '/' to C:/dos/paths\n  # for these hosts.\n  case $host_os in\n    mingw* | cegcc*) lt_search_path_spec=`$ECHO \"$lt_search_path_spec\" |\\\n      $SED 's|/\\([[A-Za-z]]:\\)|\\1|g'` ;;\n  esac\n  sys_lib_search_path_spec=`$ECHO \"$lt_search_path_spec\" | $lt_NL2SP`\nelse\n  sys_lib_search_path_spec=\"/lib /usr/lib /usr/local/lib\"\nfi])\nlibrary_names_spec=\nlibname_spec='lib$name'\nsoname_spec=\nshrext_cmds=.so\npostinstall_cmds=\npostuninstall_cmds=\nfinish_cmds=\nfinish_eval=\nshlibpath_var=\nshlibpath_overrides_runpath=unknown\nversion_type=none\ndynamic_linker=\"$host_os ld.so\"\nsys_lib_dlsearch_path_spec=\"/lib /usr/lib\"\nneed_lib_prefix=unknown\nhardcode_into_libs=no\n\n# when you set need_version to no, make sure it does not cause -set_version\n# flags to be left without arguments\nneed_version=unknown\n\nAC_ARG_VAR([LT_SYS_LIBRARY_PATH],\n[User-defined run-time library search path.])\n\ncase $host_os in\naix3*)\n  version_type=linux # correct to gnu/linux during the next big refactor\n  library_names_spec='$libname$release$shared_ext$versuffix $libname.a'\n  shlibpath_var=LIBPATH\n\n  # AIX 3 has no versioning support, so we append a major version to the name.\n  soname_spec='$libname$release$shared_ext$major'\n  ;;\n\naix[[4-9]]*)\n  version_type=linux # correct to gnu/linux during the next big refactor\n  need_lib_prefix=no\n  need_version=no\n  hardcode_into_libs=yes\n  if test ia64 = \"$host_cpu\"; then\n    # AIX 5 supports IA64\n    library_names_spec='$libname$release$shared_ext$major $libname$release$shared_ext$versuffix $libname$shared_ext'\n    shlibpath_var=LD_LIBRARY_PATH\n  else\n    # With GCC up to 2.95.x, collect2 would create an import file\n    # for dependence libraries.  The import file would start with\n    # the line '#! .'.  This would cause the generated library to\n    # depend on '.', always an invalid library.  This was fixed in\n    # development snapshots of GCC prior to 3.0.\n    case $host_os in\n      aix4 | aix4.[[01]] | aix4.[[01]].*)\n      if { echo '#if __GNUC__ > 2 || (__GNUC__ == 2 && __GNUC_MINOR__ >= 97)'\n\t   echo ' yes '\n\t   echo '#endif'; } | $CC -E - | $GREP yes > /dev/null; then\n\t:\n      else\n\tcan_build_shared=no\n      fi\n      ;;\n    esac\n    # Using Import Files as archive members, it is possible to support\n    # filename-based versioning of shared library archives on AIX. While\n    # this would work for both with and without runtime linking, it will\n    # prevent static linking of such archives. So we do filename-based\n    # shared library versioning with .so extension only, which is used\n    # when both runtime linking and shared linking is enabled.\n    # Unfortunately, runtime linking may impact performance, so we do\n    # not want this to be the default eventually. Also, we use the\n    # versioned .so libs for executables only if there is the -brtl\n    # linker flag in LDFLAGS as well, or --with-aix-soname=svr4 only.\n    # To allow for filename-based versioning support, we need to create\n    # libNAME.so.V as an archive file, containing:\n    # *) an Import File, referring to the versioned filename of the\n    #    archive as well as the shared archive member, telling the\n    #    bitwidth (32 or 64) of that shared object, and providing the\n    #    list of exported symbols of that shared object, eventually\n    #    decorated with the 'weak' keyword\n    # *) the shared object with the F_LOADONLY flag set, to really avoid\n    #    it being seen by the linker.\n    # At run time we better use the real file rather than another symlink,\n    # but for link time we create the symlink libNAME.so -> libNAME.so.V\n\n    case $with_aix_soname,$aix_use_runtimelinking in\n    # AIX (on Power*) has no versioning support, so currently we cannot hardcode correct\n    # soname into executable. Probably we can add versioning support to\n    # collect2, so additional links can be useful in future.\n    aix,yes) # traditional libtool\n      dynamic_linker='AIX unversionable lib.so'\n      # If using run time linking (on AIX 4.2 or later) use lib<name>.so\n      # instead of lib<name>.a to let people know that these are not\n      # typical AIX shared libraries.\n      library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext'\n      ;;\n    aix,no) # traditional AIX only\n      dynamic_linker='AIX lib.a[(]lib.so.V[)]'\n      # We preserve .a as extension for shared libraries through AIX4.2\n      # and later when we are not doing run time linking.\n      library_names_spec='$libname$release.a $libname.a'\n      soname_spec='$libname$release$shared_ext$major'\n      ;;\n    svr4,*) # full svr4 only\n      dynamic_linker=\"AIX lib.so.V[(]$shared_archive_member_spec.o[)]\"\n      library_names_spec='$libname$release$shared_ext$major $libname$shared_ext'\n      # We do not specify a path in Import Files, so LIBPATH fires.\n      shlibpath_overrides_runpath=yes\n      ;;\n    *,yes) # both, prefer svr4\n      dynamic_linker=\"AIX lib.so.V[(]$shared_archive_member_spec.o[)], lib.a[(]lib.so.V[)]\"\n      library_names_spec='$libname$release$shared_ext$major $libname$shared_ext'\n      # unpreferred sharedlib libNAME.a needs extra handling\n      postinstall_cmds='test -n \"$linkname\" || linkname=\"$realname\"~func_stripname \"\" \".so\" \"$linkname\"~$install_shared_prog \"$dir/$func_stripname_result.$libext\" \"$destdir/$func_stripname_result.$libext\"~test -z \"$tstripme\" || test -z \"$striplib\" || $striplib \"$destdir/$func_stripname_result.$libext\"'\n      postuninstall_cmds='for n in $library_names $old_library; do :; done~func_stripname \"\" \".so\" \"$n\"~test \"$func_stripname_result\" = \"$n\" || func_append rmfiles \" $odir/$func_stripname_result.$libext\"'\n      # We do not specify a path in Import Files, so LIBPATH fires.\n      shlibpath_overrides_runpath=yes\n      ;;\n    *,no) # both, prefer aix\n      dynamic_linker=\"AIX lib.a[(]lib.so.V[)], lib.so.V[(]$shared_archive_member_spec.o[)]\"\n      library_names_spec='$libname$release.a $libname.a'\n      soname_spec='$libname$release$shared_ext$major'\n      # unpreferred sharedlib libNAME.so.V and symlink libNAME.so need extra handling\n      postinstall_cmds='test -z \"$dlname\" || $install_shared_prog $dir/$dlname $destdir/$dlname~test -z \"$tstripme\" || test -z \"$striplib\" || $striplib $destdir/$dlname~test -n \"$linkname\" || linkname=$realname~func_stripname \"\" \".a\" \"$linkname\"~(cd \"$destdir\" && $LN_S -f $dlname $func_stripname_result.so)'\n      postuninstall_cmds='test -z \"$dlname\" || func_append rmfiles \" $odir/$dlname\"~for n in $old_library $library_names; do :; done~func_stripname \"\" \".a\" \"$n\"~func_append rmfiles \" $odir/$func_stripname_result.so\"'\n      ;;\n    esac\n    shlibpath_var=LIBPATH\n  fi\n  ;;\n\namigaos*)\n  case $host_cpu in\n  powerpc)\n    # Since July 2007 AmigaOS4 officially supports .so libraries.\n    # When compiling the executable, add -use-dynld -Lsobjs: to the compileline.\n    library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext'\n    ;;\n  m68k)\n    library_names_spec='$libname.ixlibrary $libname.a'\n    # Create ${libname}_ixlibrary.a entries in /sys/libs.\n    finish_eval='for lib in `ls $libdir/*.ixlibrary 2>/dev/null`; do libname=`func_echo_all \"$lib\" | $SED '\\''s%^.*/\\([[^/]]*\\)\\.ixlibrary$%\\1%'\\''`; $RM /sys/libs/${libname}_ixlibrary.a; $show \"cd /sys/libs && $LN_S $lib ${libname}_ixlibrary.a\"; cd /sys/libs && $LN_S $lib ${libname}_ixlibrary.a || exit 1; done'\n    ;;\n  esac\n  ;;\n\nbeos*)\n  library_names_spec='$libname$shared_ext'\n  dynamic_linker=\"$host_os ld.so\"\n  shlibpath_var=LIBRARY_PATH\n  ;;\n\nbsdi[[45]]*)\n  version_type=linux # correct to gnu/linux during the next big refactor\n  need_version=no\n  library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext'\n  soname_spec='$libname$release$shared_ext$major'\n  finish_cmds='PATH=\"\\$PATH:/sbin\" ldconfig $libdir'\n  shlibpath_var=LD_LIBRARY_PATH\n  sys_lib_search_path_spec=\"/shlib /usr/lib /usr/X11/lib /usr/contrib/lib /lib /usr/local/lib\"\n  sys_lib_dlsearch_path_spec=\"/shlib /usr/lib /usr/local/lib\"\n  # the default ld.so.conf also contains /usr/contrib/lib and\n  # /usr/X11R6/lib (/usr/X11 is a link to /usr/X11R6), but let us allow\n  # libtool to hard-code these into programs\n  ;;\n\ncygwin* | mingw* | pw32* | cegcc*)\n  version_type=windows\n  shrext_cmds=.dll\n  need_version=no\n  need_lib_prefix=no\n\n  case $GCC,$cc_basename in\n  yes,*)\n    # gcc\n    library_names_spec='$libname.dll.a'\n    # DLL is installed to $(libdir)/../bin by postinstall_cmds\n    postinstall_cmds='base_file=`basename \\$file`~\n      dlpath=`$SHELL 2>&1 -c '\\''. $dir/'\\''\\$base_file'\\''i; echo \\$dlname'\\''`~\n      dldir=$destdir/`dirname \\$dlpath`~\n      test -d \\$dldir || mkdir -p \\$dldir~\n      $install_prog $dir/$dlname \\$dldir/$dlname~\n      chmod a+x \\$dldir/$dlname~\n      if test -n '\\''$stripme'\\'' && test -n '\\''$striplib'\\''; then\n        eval '\\''$striplib \\$dldir/$dlname'\\'' || exit \\$?;\n      fi'\n    postuninstall_cmds='dldll=`$SHELL 2>&1 -c '\\''. $file; echo \\$dlname'\\''`~\n      dlpath=$dir/\\$dldll~\n       $RM \\$dlpath'\n    shlibpath_overrides_runpath=yes\n\n    case $host_os in\n    cygwin*)\n      # Cygwin DLLs use 'cyg' prefix rather than 'lib'\n      soname_spec='`echo $libname | sed -e 's/^lib/cyg/'``echo $release | $SED -e 's/[[.]]/-/g'`$versuffix$shared_ext'\nm4_if([$1], [],[\n      sys_lib_search_path_spec=\"$sys_lib_search_path_spec /usr/lib/w32api\"])\n      ;;\n    mingw* | cegcc*)\n      # MinGW DLLs use traditional 'lib' prefix\n      soname_spec='$libname`echo $release | $SED -e 's/[[.]]/-/g'`$versuffix$shared_ext'\n      ;;\n    pw32*)\n      # pw32 DLLs use 'pw' prefix rather than 'lib'\n      library_names_spec='`echo $libname | sed -e 's/^lib/pw/'``echo $release | $SED -e 's/[[.]]/-/g'`$versuffix$shared_ext'\n      ;;\n    esac\n    dynamic_linker='Win32 ld.exe'\n    ;;\n\n  *,cl*)\n    # Native MSVC\n    libname_spec='$name'\n    soname_spec='$libname`echo $release | $SED -e 's/[[.]]/-/g'`$versuffix$shared_ext'\n    library_names_spec='$libname.dll.lib'\n\n    case $build_os in\n    mingw*)\n      sys_lib_search_path_spec=\n      lt_save_ifs=$IFS\n      IFS=';'\n      for lt_path in $LIB\n      do\n        IFS=$lt_save_ifs\n        # Let DOS variable expansion print the short 8.3 style file name.\n        lt_path=`cd \"$lt_path\" 2>/dev/null && cmd //C \"for %i in (\".\") do @echo %~si\"`\n        sys_lib_search_path_spec=\"$sys_lib_search_path_spec $lt_path\"\n      done\n      IFS=$lt_save_ifs\n      # Convert to MSYS style.\n      sys_lib_search_path_spec=`$ECHO \"$sys_lib_search_path_spec\" | sed -e 's|\\\\\\\\|/|g' -e 's| \\\\([[a-zA-Z]]\\\\):| /\\\\1|g' -e 's|^ ||'`\n      ;;\n    cygwin*)\n      # Convert to unix form, then to dos form, then back to unix form\n      # but this time dos style (no spaces!) so that the unix form looks\n      # like /cygdrive/c/PROGRA~1:/cygdr...\n      sys_lib_search_path_spec=`cygpath --path --unix \"$LIB\"`\n      sys_lib_search_path_spec=`cygpath --path --dos \"$sys_lib_search_path_spec\" 2>/dev/null`\n      sys_lib_search_path_spec=`cygpath --path --unix \"$sys_lib_search_path_spec\" | $SED -e \"s/$PATH_SEPARATOR/ /g\"`\n      ;;\n    *)\n      sys_lib_search_path_spec=$LIB\n      if $ECHO \"$sys_lib_search_path_spec\" | [$GREP ';[c-zC-Z]:/' >/dev/null]; then\n        # It is most probably a Windows format PATH.\n        sys_lib_search_path_spec=`$ECHO \"$sys_lib_search_path_spec\" | $SED -e 's/;/ /g'`\n      else\n        sys_lib_search_path_spec=`$ECHO \"$sys_lib_search_path_spec\" | $SED -e \"s/$PATH_SEPARATOR/ /g\"`\n      fi\n      # FIXME: find the short name or the path components, as spaces are\n      # common. (e.g. \"Program Files\" -> \"PROGRA~1\")\n      ;;\n    esac\n\n    # DLL is installed to $(libdir)/../bin by postinstall_cmds\n    postinstall_cmds='base_file=`basename \\$file`~\n      dlpath=`$SHELL 2>&1 -c '\\''. $dir/'\\''\\$base_file'\\''i; echo \\$dlname'\\''`~\n      dldir=$destdir/`dirname \\$dlpath`~\n      test -d \\$dldir || mkdir -p \\$dldir~\n      $install_prog $dir/$dlname \\$dldir/$dlname'\n    postuninstall_cmds='dldll=`$SHELL 2>&1 -c '\\''. $file; echo \\$dlname'\\''`~\n      dlpath=$dir/\\$dldll~\n       $RM \\$dlpath'\n    shlibpath_overrides_runpath=yes\n    dynamic_linker='Win32 link.exe'\n    ;;\n\n  *)\n    # Assume MSVC wrapper\n    library_names_spec='$libname`echo $release | $SED -e 's/[[.]]/-/g'`$versuffix$shared_ext $libname.lib'\n    dynamic_linker='Win32 ld.exe'\n    ;;\n  esac\n  # FIXME: first we should search . and the directory the executable is in\n  shlibpath_var=PATH\n  ;;\n\ndarwin* | rhapsody*)\n  dynamic_linker=\"$host_os dyld\"\n  version_type=darwin\n  need_lib_prefix=no\n  need_version=no\n  library_names_spec='$libname$release$major$shared_ext $libname$shared_ext'\n  soname_spec='$libname$release$major$shared_ext'\n  shlibpath_overrides_runpath=yes\n  shlibpath_var=DYLD_LIBRARY_PATH\n  shrext_cmds='`test .$module = .yes && echo .so || echo .dylib`'\nm4_if([$1], [],[\n  sys_lib_search_path_spec=\"$sys_lib_search_path_spec /usr/local/lib\"])\n  sys_lib_dlsearch_path_spec='/usr/local/lib /lib /usr/lib'\n  ;;\n\ndgux*)\n  version_type=linux # correct to gnu/linux during the next big refactor\n  need_lib_prefix=no\n  need_version=no\n  library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext'\n  soname_spec='$libname$release$shared_ext$major'\n  shlibpath_var=LD_LIBRARY_PATH\n  ;;\n\nfreebsd* | dragonfly*)\n  # DragonFly does not have aout.  When/if they implement a new\n  # versioning mechanism, adjust this.\n  if test -x /usr/bin/objformat; then\n    objformat=`/usr/bin/objformat`\n  else\n    case $host_os in\n    freebsd[[23]].*) objformat=aout ;;\n    *) objformat=elf ;;\n    esac\n  fi\n  version_type=freebsd-$objformat\n  case $version_type in\n    freebsd-elf*)\n      library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext'\n      soname_spec='$libname$release$shared_ext$major'\n      need_version=no\n      need_lib_prefix=no\n      ;;\n    freebsd-*)\n      library_names_spec='$libname$release$shared_ext$versuffix $libname$shared_ext$versuffix'\n      need_version=yes\n      ;;\n  esac\n  shlibpath_var=LD_LIBRARY_PATH\n  case $host_os in\n  freebsd2.*)\n    shlibpath_overrides_runpath=yes\n    ;;\n  freebsd3.[[01]]* | freebsdelf3.[[01]]*)\n    shlibpath_overrides_runpath=yes\n    hardcode_into_libs=yes\n    ;;\n  freebsd3.[[2-9]]* | freebsdelf3.[[2-9]]* | \\\n  freebsd4.[[0-5]] | freebsdelf4.[[0-5]] | freebsd4.1.1 | freebsdelf4.1.1)\n    shlibpath_overrides_runpath=no\n    hardcode_into_libs=yes\n    ;;\n  *) # from 4.6 on, and DragonFly\n    shlibpath_overrides_runpath=yes\n    hardcode_into_libs=yes\n    ;;\n  esac\n  ;;\n\nhaiku*)\n  version_type=linux # correct to gnu/linux during the next big refactor\n  need_lib_prefix=no\n  need_version=no\n  dynamic_linker=\"$host_os runtime_loader\"\n  library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext'\n  soname_spec='$libname$release$shared_ext$major'\n  shlibpath_var=LIBRARY_PATH\n  shlibpath_overrides_runpath=no\n  sys_lib_dlsearch_path_spec='/boot/home/config/lib /boot/common/lib /boot/system/lib'\n  hardcode_into_libs=yes\n  ;;\n\nhpux9* | hpux10* | hpux11*)\n  # Give a soname corresponding to the major version so that dld.sl refuses to\n  # link against other versions.\n  version_type=sunos\n  need_lib_prefix=no\n  need_version=no\n  case $host_cpu in\n  ia64*)\n    shrext_cmds='.so'\n    hardcode_into_libs=yes\n    dynamic_linker=\"$host_os dld.so\"\n    shlibpath_var=LD_LIBRARY_PATH\n    shlibpath_overrides_runpath=yes # Unless +noenvvar is specified.\n    library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext'\n    soname_spec='$libname$release$shared_ext$major'\n    if test 32 = \"$HPUX_IA64_MODE\"; then\n      sys_lib_search_path_spec=\"/usr/lib/hpux32 /usr/local/lib/hpux32 /usr/local/lib\"\n      sys_lib_dlsearch_path_spec=/usr/lib/hpux32\n    else\n      sys_lib_search_path_spec=\"/usr/lib/hpux64 /usr/local/lib/hpux64\"\n      sys_lib_dlsearch_path_spec=/usr/lib/hpux64\n    fi\n    ;;\n  hppa*64*)\n    shrext_cmds='.sl'\n    hardcode_into_libs=yes\n    dynamic_linker=\"$host_os dld.sl\"\n    shlibpath_var=LD_LIBRARY_PATH # How should we handle SHLIB_PATH\n    shlibpath_overrides_runpath=yes # Unless +noenvvar is specified.\n    library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext'\n    soname_spec='$libname$release$shared_ext$major'\n    sys_lib_search_path_spec=\"/usr/lib/pa20_64 /usr/ccs/lib/pa20_64\"\n    sys_lib_dlsearch_path_spec=$sys_lib_search_path_spec\n    ;;\n  *)\n    shrext_cmds='.sl'\n    dynamic_linker=\"$host_os dld.sl\"\n    shlibpath_var=SHLIB_PATH\n    shlibpath_overrides_runpath=no # +s is required to enable SHLIB_PATH\n    library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext'\n    soname_spec='$libname$release$shared_ext$major'\n    ;;\n  esac\n  # HP-UX runs *really* slowly unless shared libraries are mode 555, ...\n  postinstall_cmds='chmod 555 $lib'\n  # or fails outright, so override atomically:\n  install_override_mode=555\n  ;;\n\ninterix[[3-9]]*)\n  version_type=linux # correct to gnu/linux during the next big refactor\n  need_lib_prefix=no\n  need_version=no\n  library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext'\n  soname_spec='$libname$release$shared_ext$major'\n  dynamic_linker='Interix 3.x ld.so.1 (PE, like ELF)'\n  shlibpath_var=LD_LIBRARY_PATH\n  shlibpath_overrides_runpath=no\n  hardcode_into_libs=yes\n  ;;\n\nirix5* | irix6* | nonstopux*)\n  case $host_os in\n    nonstopux*) version_type=nonstopux ;;\n    *)\n\tif test yes = \"$lt_cv_prog_gnu_ld\"; then\n\t\tversion_type=linux # correct to gnu/linux during the next big refactor\n\telse\n\t\tversion_type=irix\n\tfi ;;\n  esac\n  need_lib_prefix=no\n  need_version=no\n  soname_spec='$libname$release$shared_ext$major'\n  library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$release$shared_ext $libname$shared_ext'\n  case $host_os in\n  irix5* | nonstopux*)\n    libsuff= shlibsuff=\n    ;;\n  *)\n    case $LD in # libtool.m4 will add one of these switches to LD\n    *-32|*\"-32 \"|*-melf32bsmip|*\"-melf32bsmip \")\n      libsuff= shlibsuff= libmagic=32-bit;;\n    *-n32|*\"-n32 \"|*-melf32bmipn32|*\"-melf32bmipn32 \")\n      libsuff=32 shlibsuff=N32 libmagic=N32;;\n    *-64|*\"-64 \"|*-melf64bmip|*\"-melf64bmip \")\n      libsuff=64 shlibsuff=64 libmagic=64-bit;;\n    *) libsuff= shlibsuff= libmagic=never-match;;\n    esac\n    ;;\n  esac\n  shlibpath_var=LD_LIBRARY${shlibsuff}_PATH\n  shlibpath_overrides_runpath=no\n  sys_lib_search_path_spec=\"/usr/lib$libsuff /lib$libsuff /usr/local/lib$libsuff\"\n  sys_lib_dlsearch_path_spec=\"/usr/lib$libsuff /lib$libsuff\"\n  hardcode_into_libs=yes\n  ;;\n\n# No shared lib support for Linux oldld, aout, or coff.\nlinux*oldld* | linux*aout* | linux*coff*)\n  dynamic_linker=no\n  ;;\n\nlinux*android*)\n  version_type=none # Android doesn't support versioned libraries.\n  need_lib_prefix=no\n  need_version=no\n  library_names_spec='$libname$release$shared_ext'\n  soname_spec='$libname$release$shared_ext'\n  finish_cmds=\n  shlibpath_var=LD_LIBRARY_PATH\n  shlibpath_overrides_runpath=yes\n\n  # This implies no fast_install, which is unacceptable.\n  # Some rework will be needed to allow for fast_install\n  # before this can be enabled.\n  hardcode_into_libs=yes\n\n  dynamic_linker='Android linker'\n  # Don't embed -rpath directories since the linker doesn't support them.\n  _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir'\n  ;;\n\n# This must be glibc/ELF.\nlinux* | k*bsd*-gnu | kopensolaris*-gnu | gnu*)\n  version_type=linux # correct to gnu/linux during the next big refactor\n  need_lib_prefix=no\n  need_version=no\n  library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext'\n  soname_spec='$libname$release$shared_ext$major'\n  finish_cmds='PATH=\"\\$PATH:/sbin\" ldconfig -n $libdir'\n  shlibpath_var=LD_LIBRARY_PATH\n  shlibpath_overrides_runpath=no\n\n  # Some binutils ld are patched to set DT_RUNPATH\n  AC_CACHE_VAL([lt_cv_shlibpath_overrides_runpath],\n    [lt_cv_shlibpath_overrides_runpath=no\n    save_LDFLAGS=$LDFLAGS\n    save_libdir=$libdir\n    eval \"libdir=/foo; wl=\\\"$_LT_TAGVAR(lt_prog_compiler_wl, $1)\\\"; \\\n\t LDFLAGS=\\\"\\$LDFLAGS $_LT_TAGVAR(hardcode_libdir_flag_spec, $1)\\\"\"\n    AC_LINK_IFELSE([AC_LANG_PROGRAM([],[])],\n      [AS_IF([ ($OBJDUMP -p conftest$ac_exeext) 2>/dev/null | grep \"RUNPATH.*$libdir\" >/dev/null],\n\t [lt_cv_shlibpath_overrides_runpath=yes])])\n    LDFLAGS=$save_LDFLAGS\n    libdir=$save_libdir\n    ])\n  shlibpath_overrides_runpath=$lt_cv_shlibpath_overrides_runpath\n\n  # This implies no fast_install, which is unacceptable.\n  # Some rework will be needed to allow for fast_install\n  # before this can be enabled.\n  hardcode_into_libs=yes\n\n  # Ideally, we could use ldconfig to report *all* directores which are\n  # searched for libraries, however this is still not possible.  Aside from not\n  # being certain /sbin/ldconfig is available, command\n  # 'ldconfig -N -X -v | grep ^/' on 64bit Fedora does not report /usr/lib64,\n  # even though it is searched at run-time.  Try to do the best guess by\n  # appending ld.so.conf contents (and includes) to the search path.\n  if test -f /etc/ld.so.conf; then\n    lt_ld_extra=`awk '/^include / { system(sprintf(\"cd /etc; cat %s 2>/dev/null\", \\[$]2)); skip = 1; } { if (!skip) print \\[$]0; skip = 0; }' < /etc/ld.so.conf | $SED -e 's/#.*//;/^[\t ]*hwcap[\t ]/d;s/[:,\t]/ /g;s/=[^=]*$//;s/=[^= ]* / /g;s/\"//g;/^$/d' | tr '\\n' ' '`\n    sys_lib_dlsearch_path_spec=\"/lib /usr/lib $lt_ld_extra\"\n  fi\n\n  # We used to test for /lib/ld.so.1 and disable shared libraries on\n  # powerpc, because MkLinux only supported shared libraries with the\n  # GNU dynamic linker.  Since this was broken with cross compilers,\n  # most powerpc-linux boxes support dynamic linking these days and\n  # people can always --disable-shared, the test was removed, and we\n  # assume the GNU/Linux dynamic linker is in use.\n  dynamic_linker='GNU/Linux ld.so'\n  ;;\n\nnetbsdelf*-gnu)\n  version_type=linux\n  need_lib_prefix=no\n  need_version=no\n  library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${shared_ext}'\n  soname_spec='${libname}${release}${shared_ext}$major'\n  shlibpath_var=LD_LIBRARY_PATH\n  shlibpath_overrides_runpath=no\n  hardcode_into_libs=yes\n  dynamic_linker='NetBSD ld.elf_so'\n  ;;\n\nnetbsd*)\n  version_type=sunos\n  need_lib_prefix=no\n  need_version=no\n  if echo __ELF__ | $CC -E - | $GREP __ELF__ >/dev/null; then\n    library_names_spec='$libname$release$shared_ext$versuffix $libname$shared_ext$versuffix'\n    finish_cmds='PATH=\"\\$PATH:/sbin\" ldconfig -m $libdir'\n    dynamic_linker='NetBSD (a.out) ld.so'\n  else\n    library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext'\n    soname_spec='$libname$release$shared_ext$major'\n    dynamic_linker='NetBSD ld.elf_so'\n  fi\n  shlibpath_var=LD_LIBRARY_PATH\n  shlibpath_overrides_runpath=yes\n  hardcode_into_libs=yes\n  ;;\n\nnewsos6)\n  version_type=linux # correct to gnu/linux during the next big refactor\n  library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext'\n  shlibpath_var=LD_LIBRARY_PATH\n  shlibpath_overrides_runpath=yes\n  ;;\n\n*nto* | *qnx*)\n  version_type=qnx\n  need_lib_prefix=no\n  need_version=no\n  library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext'\n  soname_spec='$libname$release$shared_ext$major'\n  shlibpath_var=LD_LIBRARY_PATH\n  shlibpath_overrides_runpath=no\n  hardcode_into_libs=yes\n  dynamic_linker='ldqnx.so'\n  ;;\n\nopenbsd* | bitrig*)\n  version_type=sunos\n  sys_lib_dlsearch_path_spec=/usr/lib\n  need_lib_prefix=no\n  if test -z \"`echo __ELF__ | $CC -E - | $GREP __ELF__`\"; then\n    need_version=no\n  else\n    need_version=yes\n  fi\n  library_names_spec='$libname$release$shared_ext$versuffix $libname$shared_ext$versuffix'\n  finish_cmds='PATH=\"\\$PATH:/sbin\" ldconfig -m $libdir'\n  shlibpath_var=LD_LIBRARY_PATH\n  shlibpath_overrides_runpath=yes\n  ;;\n\nos2*)\n  libname_spec='$name'\n  version_type=windows\n  shrext_cmds=.dll\n  need_version=no\n  need_lib_prefix=no\n  # OS/2 can only load a DLL with a base name of 8 characters or less.\n  soname_spec='`test -n \"$os2dllname\" && libname=\"$os2dllname\";\n    v=$($ECHO $release$versuffix | tr -d .-);\n    n=$($ECHO $libname | cut -b -$((8 - ${#v})) | tr . _);\n    $ECHO $n$v`$shared_ext'\n  library_names_spec='${libname}_dll.$libext'\n  dynamic_linker='OS/2 ld.exe'\n  shlibpath_var=BEGINLIBPATH\n  sys_lib_search_path_spec=\"/lib /usr/lib /usr/local/lib\"\n  sys_lib_dlsearch_path_spec=$sys_lib_search_path_spec\n  postinstall_cmds='base_file=`basename \\$file`~\n    dlpath=`$SHELL 2>&1 -c '\\''. $dir/'\\''\\$base_file'\\''i; $ECHO \\$dlname'\\''`~\n    dldir=$destdir/`dirname \\$dlpath`~\n    test -d \\$dldir || mkdir -p \\$dldir~\n    $install_prog $dir/$dlname \\$dldir/$dlname~\n    chmod a+x \\$dldir/$dlname~\n    if test -n '\\''$stripme'\\'' && test -n '\\''$striplib'\\''; then\n      eval '\\''$striplib \\$dldir/$dlname'\\'' || exit \\$?;\n    fi'\n  postuninstall_cmds='dldll=`$SHELL 2>&1 -c '\\''. $file; $ECHO \\$dlname'\\''`~\n    dlpath=$dir/\\$dldll~\n    $RM \\$dlpath'\n  ;;\n\nosf3* | osf4* | osf5*)\n  version_type=osf\n  need_lib_prefix=no\n  need_version=no\n  soname_spec='$libname$release$shared_ext$major'\n  library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext'\n  shlibpath_var=LD_LIBRARY_PATH\n  sys_lib_search_path_spec=\"/usr/shlib /usr/ccs/lib /usr/lib/cmplrs/cc /usr/lib /usr/local/lib /var/shlib\"\n  sys_lib_dlsearch_path_spec=$sys_lib_search_path_spec\n  ;;\n\nrdos*)\n  dynamic_linker=no\n  ;;\n\nsolaris*)\n  version_type=linux # correct to gnu/linux during the next big refactor\n  need_lib_prefix=no\n  need_version=no\n  library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext'\n  soname_spec='$libname$release$shared_ext$major'\n  shlibpath_var=LD_LIBRARY_PATH\n  shlibpath_overrides_runpath=yes\n  hardcode_into_libs=yes\n  # ldd complains unless libraries are executable\n  postinstall_cmds='chmod +x $lib'\n  ;;\n\nsunos4*)\n  version_type=sunos\n  library_names_spec='$libname$release$shared_ext$versuffix $libname$shared_ext$versuffix'\n  finish_cmds='PATH=\"\\$PATH:/usr/etc\" ldconfig $libdir'\n  shlibpath_var=LD_LIBRARY_PATH\n  shlibpath_overrides_runpath=yes\n  if test yes = \"$with_gnu_ld\"; then\n    need_lib_prefix=no\n  fi\n  need_version=yes\n  ;;\n\nsysv4 | sysv4.3*)\n  version_type=linux # correct to gnu/linux during the next big refactor\n  library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext'\n  soname_spec='$libname$release$shared_ext$major'\n  shlibpath_var=LD_LIBRARY_PATH\n  case $host_vendor in\n    sni)\n      shlibpath_overrides_runpath=no\n      need_lib_prefix=no\n      runpath_var=LD_RUN_PATH\n      ;;\n    siemens)\n      need_lib_prefix=no\n      ;;\n    motorola)\n      need_lib_prefix=no\n      need_version=no\n      shlibpath_overrides_runpath=no\n      sys_lib_search_path_spec='/lib /usr/lib /usr/ccs/lib'\n      ;;\n  esac\n  ;;\n\nsysv4*MP*)\n  if test -d /usr/nec; then\n    version_type=linux # correct to gnu/linux during the next big refactor\n    library_names_spec='$libname$shared_ext.$versuffix $libname$shared_ext.$major $libname$shared_ext'\n    soname_spec='$libname$shared_ext.$major'\n    shlibpath_var=LD_LIBRARY_PATH\n  fi\n  ;;\n\nsysv5* | sco3.2v5* | sco5v6* | unixware* | OpenUNIX* | sysv4*uw2*)\n  version_type=sco\n  need_lib_prefix=no\n  need_version=no\n  library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext $libname$shared_ext'\n  soname_spec='$libname$release$shared_ext$major'\n  shlibpath_var=LD_LIBRARY_PATH\n  shlibpath_overrides_runpath=yes\n  hardcode_into_libs=yes\n  if test yes = \"$with_gnu_ld\"; then\n    sys_lib_search_path_spec='/usr/local/lib /usr/gnu/lib /usr/ccs/lib /usr/lib /lib'\n  else\n    sys_lib_search_path_spec='/usr/ccs/lib /usr/lib'\n    case $host_os in\n      sco3.2v5*)\n        sys_lib_search_path_spec=\"$sys_lib_search_path_spec /lib\"\n\t;;\n    esac\n  fi\n  sys_lib_dlsearch_path_spec='/usr/lib'\n  ;;\n\ntpf*)\n  # TPF is a cross-target only.  Preferred cross-host = GNU/Linux.\n  version_type=linux # correct to gnu/linux during the next big refactor\n  need_lib_prefix=no\n  need_version=no\n  library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext'\n  shlibpath_var=LD_LIBRARY_PATH\n  shlibpath_overrides_runpath=no\n  hardcode_into_libs=yes\n  ;;\n\nuts4*)\n  version_type=linux # correct to gnu/linux during the next big refactor\n  library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext'\n  soname_spec='$libname$release$shared_ext$major'\n  shlibpath_var=LD_LIBRARY_PATH\n  ;;\n\n*)\n  dynamic_linker=no\n  ;;\nesac\nAC_MSG_RESULT([$dynamic_linker])\ntest no = \"$dynamic_linker\" && can_build_shared=no\n\nvariables_saved_for_relink=\"PATH $shlibpath_var $runpath_var\"\nif test yes = \"$GCC\"; then\n  variables_saved_for_relink=\"$variables_saved_for_relink GCC_EXEC_PREFIX COMPILER_PATH LIBRARY_PATH\"\nfi\n\nif test set = \"${lt_cv_sys_lib_search_path_spec+set}\"; then\n  sys_lib_search_path_spec=$lt_cv_sys_lib_search_path_spec\nfi\n\nif test set = \"${lt_cv_sys_lib_dlsearch_path_spec+set}\"; then\n  sys_lib_dlsearch_path_spec=$lt_cv_sys_lib_dlsearch_path_spec\nfi\n\n# remember unaugmented sys_lib_dlsearch_path content for libtool script decls...\nconfigure_time_dlsearch_path=$sys_lib_dlsearch_path_spec\n\n# ... but it needs LT_SYS_LIBRARY_PATH munging for other configure-time code\nfunc_munge_path_list sys_lib_dlsearch_path_spec \"$LT_SYS_LIBRARY_PATH\"\n\n# to be used as default LT_SYS_LIBRARY_PATH value in generated libtool\nconfigure_time_lt_sys_library_path=$LT_SYS_LIBRARY_PATH\n\n_LT_DECL([], [variables_saved_for_relink], [1],\n    [Variables whose values should be saved in libtool wrapper scripts and\n    restored at link time])\n_LT_DECL([], [need_lib_prefix], [0],\n    [Do we need the \"lib\" prefix for modules?])\n_LT_DECL([], [need_version], [0], [Do we need a version for libraries?])\n_LT_DECL([], [version_type], [0], [Library versioning type])\n_LT_DECL([], [runpath_var], [0],  [Shared library runtime path variable])\n_LT_DECL([], [shlibpath_var], [0],[Shared library path variable])\n_LT_DECL([], [shlibpath_overrides_runpath], [0],\n    [Is shlibpath searched before the hard-coded library search path?])\n_LT_DECL([], [libname_spec], [1], [Format of library name prefix])\n_LT_DECL([], [library_names_spec], [1],\n    [[List of archive names.  First name is the real one, the rest are links.\n    The last name is the one that the linker finds with -lNAME]])\n_LT_DECL([], [soname_spec], [1],\n    [[The coded name of the library, if different from the real name]])\n_LT_DECL([], [install_override_mode], [1],\n    [Permission mode override for installation of shared libraries])\n_LT_DECL([], [postinstall_cmds], [2],\n    [Command to use after installation of a shared archive])\n_LT_DECL([], [postuninstall_cmds], [2],\n    [Command to use after uninstallation of a shared archive])\n_LT_DECL([], [finish_cmds], [2],\n    [Commands used to finish a libtool library installation in a directory])\n_LT_DECL([], [finish_eval], [1],\n    [[As \"finish_cmds\", except a single script fragment to be evaled but\n    not shown]])\n_LT_DECL([], [hardcode_into_libs], [0],\n    [Whether we should hardcode library paths into libraries])\n_LT_DECL([], [sys_lib_search_path_spec], [2],\n    [Compile-time system search path for libraries])\n_LT_DECL([sys_lib_dlsearch_path_spec], [configure_time_dlsearch_path], [2],\n    [Detected run-time system search path for libraries])\n_LT_DECL([], [configure_time_lt_sys_library_path], [2],\n    [Explicit LT_SYS_LIBRARY_PATH set during ./configure time])\n])# _LT_SYS_DYNAMIC_LINKER\n\n\n# _LT_PATH_TOOL_PREFIX(TOOL)\n# --------------------------\n# find a file program that can recognize shared library\nAC_DEFUN([_LT_PATH_TOOL_PREFIX],\n[m4_require([_LT_DECL_EGREP])dnl\nAC_MSG_CHECKING([for $1])\nAC_CACHE_VAL(lt_cv_path_MAGIC_CMD,\n[case $MAGIC_CMD in\n[[\\\\/*] |  ?:[\\\\/]*])\n  lt_cv_path_MAGIC_CMD=$MAGIC_CMD # Let the user override the test with a path.\n  ;;\n*)\n  lt_save_MAGIC_CMD=$MAGIC_CMD\n  lt_save_ifs=$IFS; IFS=$PATH_SEPARATOR\ndnl $ac_dummy forces splitting on constant user-supplied paths.\ndnl POSIX.2 word splitting is done only on the output of word expansions,\ndnl not every word.  This closes a longstanding sh security hole.\n  ac_dummy=\"m4_if([$2], , $PATH, [$2])\"\n  for ac_dir in $ac_dummy; do\n    IFS=$lt_save_ifs\n    test -z \"$ac_dir\" && ac_dir=.\n    if test -f \"$ac_dir/$1\"; then\n      lt_cv_path_MAGIC_CMD=$ac_dir/\"$1\"\n      if test -n \"$file_magic_test_file\"; then\n\tcase $deplibs_check_method in\n\t\"file_magic \"*)\n\t  file_magic_regex=`expr \"$deplibs_check_method\" : \"file_magic \\(.*\\)\"`\n\t  MAGIC_CMD=$lt_cv_path_MAGIC_CMD\n\t  if eval $file_magic_cmd \\$file_magic_test_file 2> /dev/null |\n\t    $EGREP \"$file_magic_regex\" > /dev/null; then\n\t    :\n\t  else\n\t    cat <<_LT_EOF 1>&2\n\n*** Warning: the command libtool uses to detect shared libraries,\n*** $file_magic_cmd, produces output that libtool cannot recognize.\n*** The result is that libtool may fail to recognize shared libraries\n*** as such.  This will affect the creation of libtool libraries that\n*** depend on shared libraries, but programs linked with such libtool\n*** libraries will work regardless of this problem.  Nevertheless, you\n*** may want to report the problem to your system manager and/or to\n*** bug-libtool@gnu.org\n\n_LT_EOF\n\t  fi ;;\n\tesac\n      fi\n      break\n    fi\n  done\n  IFS=$lt_save_ifs\n  MAGIC_CMD=$lt_save_MAGIC_CMD\n  ;;\nesac])\nMAGIC_CMD=$lt_cv_path_MAGIC_CMD\nif test -n \"$MAGIC_CMD\"; then\n  AC_MSG_RESULT($MAGIC_CMD)\nelse\n  AC_MSG_RESULT(no)\nfi\n_LT_DECL([], [MAGIC_CMD], [0],\n\t [Used to examine libraries when file_magic_cmd begins with \"file\"])dnl\n])# _LT_PATH_TOOL_PREFIX\n\n# Old name:\nAU_ALIAS([AC_PATH_TOOL_PREFIX], [_LT_PATH_TOOL_PREFIX])\ndnl aclocal-1.4 backwards compatibility:\ndnl AC_DEFUN([AC_PATH_TOOL_PREFIX], [])\n\n\n# _LT_PATH_MAGIC\n# --------------\n# find a file program that can recognize a shared library\nm4_defun([_LT_PATH_MAGIC],\n[_LT_PATH_TOOL_PREFIX(${ac_tool_prefix}file, /usr/bin$PATH_SEPARATOR$PATH)\nif test -z \"$lt_cv_path_MAGIC_CMD\"; then\n  if test -n \"$ac_tool_prefix\"; then\n    _LT_PATH_TOOL_PREFIX(file, /usr/bin$PATH_SEPARATOR$PATH)\n  else\n    MAGIC_CMD=:\n  fi\nfi\n])# _LT_PATH_MAGIC\n\n\n# LT_PATH_LD\n# ----------\n# find the pathname to the GNU or non-GNU linker\nAC_DEFUN([LT_PATH_LD],\n[AC_REQUIRE([AC_PROG_CC])dnl\nAC_REQUIRE([AC_CANONICAL_HOST])dnl\nAC_REQUIRE([AC_CANONICAL_BUILD])dnl\nm4_require([_LT_DECL_SED])dnl\nm4_require([_LT_DECL_EGREP])dnl\nm4_require([_LT_PROG_ECHO_BACKSLASH])dnl\n\nAC_ARG_WITH([gnu-ld],\n    [AS_HELP_STRING([--with-gnu-ld],\n\t[assume the C compiler uses GNU ld @<:@default=no@:>@])],\n    [test no = \"$withval\" || with_gnu_ld=yes],\n    [with_gnu_ld=no])dnl\n\nac_prog=ld\nif test yes = \"$GCC\"; then\n  # Check if gcc -print-prog-name=ld gives a path.\n  AC_MSG_CHECKING([for ld used by $CC])\n  case $host in\n  *-*-mingw*)\n    # gcc leaves a trailing carriage return, which upsets mingw\n    ac_prog=`($CC -print-prog-name=ld) 2>&5 | tr -d '\\015'` ;;\n  *)\n    ac_prog=`($CC -print-prog-name=ld) 2>&5` ;;\n  esac\n  case $ac_prog in\n    # Accept absolute paths.\n    [[\\\\/]]* | ?:[[\\\\/]]*)\n      re_direlt='/[[^/]][[^/]]*/\\.\\./'\n      # Canonicalize the pathname of ld\n      ac_prog=`$ECHO \"$ac_prog\"| $SED 's%\\\\\\\\%/%g'`\n      while $ECHO \"$ac_prog\" | $GREP \"$re_direlt\" > /dev/null 2>&1; do\n\tac_prog=`$ECHO $ac_prog| $SED \"s%$re_direlt%/%\"`\n      done\n      test -z \"$LD\" && LD=$ac_prog\n      ;;\n  \"\")\n    # If it fails, then pretend we aren't using GCC.\n    ac_prog=ld\n    ;;\n  *)\n    # If it is relative, then search for the first ld in PATH.\n    with_gnu_ld=unknown\n    ;;\n  esac\nelif test yes = \"$with_gnu_ld\"; then\n  AC_MSG_CHECKING([for GNU ld])\nelse\n  AC_MSG_CHECKING([for non-GNU ld])\nfi\nAC_CACHE_VAL(lt_cv_path_LD,\n[if test -z \"$LD\"; then\n  lt_save_ifs=$IFS; IFS=$PATH_SEPARATOR\n  for ac_dir in $PATH; do\n    IFS=$lt_save_ifs\n    test -z \"$ac_dir\" && ac_dir=.\n    if test -f \"$ac_dir/$ac_prog\" || test -f \"$ac_dir/$ac_prog$ac_exeext\"; then\n      lt_cv_path_LD=$ac_dir/$ac_prog\n      # Check to see if the program is GNU ld.  I'd rather use --version,\n      # but apparently some variants of GNU ld only accept -v.\n      # Break only if it was the GNU/non-GNU ld that we prefer.\n      case `\"$lt_cv_path_LD\" -v 2>&1 </dev/null` in\n      *GNU* | *'with BFD'*)\n\ttest no != \"$with_gnu_ld\" && break\n\t;;\n      *)\n\ttest yes != \"$with_gnu_ld\" && break\n\t;;\n      esac\n    fi\n  done\n  IFS=$lt_save_ifs\nelse\n  lt_cv_path_LD=$LD # Let the user override the test with a path.\nfi])\nLD=$lt_cv_path_LD\nif test -n \"$LD\"; then\n  AC_MSG_RESULT($LD)\nelse\n  AC_MSG_RESULT(no)\nfi\ntest -z \"$LD\" && AC_MSG_ERROR([no acceptable ld found in \\$PATH])\n_LT_PATH_LD_GNU\nAC_SUBST([LD])\n\n_LT_TAGDECL([], [LD], [1], [The linker used to build libraries])\n])# LT_PATH_LD\n\n# Old names:\nAU_ALIAS([AM_PROG_LD], [LT_PATH_LD])\nAU_ALIAS([AC_PROG_LD], [LT_PATH_LD])\ndnl aclocal-1.4 backwards compatibility:\ndnl AC_DEFUN([AM_PROG_LD], [])\ndnl AC_DEFUN([AC_PROG_LD], [])\n\n\n# _LT_PATH_LD_GNU\n#- --------------\nm4_defun([_LT_PATH_LD_GNU],\n[AC_CACHE_CHECK([if the linker ($LD) is GNU ld], lt_cv_prog_gnu_ld,\n[# I'd rather use --version here, but apparently some GNU lds only accept -v.\ncase `$LD -v 2>&1 </dev/null` in\n*GNU* | *'with BFD'*)\n  lt_cv_prog_gnu_ld=yes\n  ;;\n*)\n  lt_cv_prog_gnu_ld=no\n  ;;\nesac])\nwith_gnu_ld=$lt_cv_prog_gnu_ld\n])# _LT_PATH_LD_GNU\n\n\n# _LT_CMD_RELOAD\n# --------------\n# find reload flag for linker\n#   -- PORTME Some linkers may need a different reload flag.\nm4_defun([_LT_CMD_RELOAD],\n[AC_CACHE_CHECK([for $LD option to reload object files],\n  lt_cv_ld_reload_flag,\n  [lt_cv_ld_reload_flag='-r'])\nreload_flag=$lt_cv_ld_reload_flag\ncase $reload_flag in\n\"\" | \" \"*) ;;\n*) reload_flag=\" $reload_flag\" ;;\nesac\nreload_cmds='$LD$reload_flag -o $output$reload_objs'\ncase $host_os in\n  cygwin* | mingw* | pw32* | cegcc*)\n    if test yes != \"$GCC\"; then\n      reload_cmds=false\n    fi\n    ;;\n  darwin*)\n    if test yes = \"$GCC\"; then\n      reload_cmds='$LTCC $LTCFLAGS -nostdlib $wl-r -o $output$reload_objs'\n    else\n      reload_cmds='$LD$reload_flag -o $output$reload_objs'\n    fi\n    ;;\nesac\n_LT_TAGDECL([], [reload_flag], [1], [How to create reloadable object files])dnl\n_LT_TAGDECL([], [reload_cmds], [2])dnl\n])# _LT_CMD_RELOAD\n\n\n# _LT_PATH_DD\n# -----------\n# find a working dd\nm4_defun([_LT_PATH_DD],\n[AC_CACHE_CHECK([for a working dd], [ac_cv_path_lt_DD],\n[printf 0123456789abcdef0123456789abcdef >conftest.i\ncat conftest.i conftest.i >conftest2.i\n: ${lt_DD:=$DD}\nAC_PATH_PROGS_FEATURE_CHECK([lt_DD], [dd],\n[if \"$ac_path_lt_DD\" bs=32 count=1 <conftest2.i >conftest.out 2>/dev/null; then\n  cmp -s conftest.i conftest.out \\\n  && ac_cv_path_lt_DD=\"$ac_path_lt_DD\" ac_path_lt_DD_found=:\nfi])\nrm -f conftest.i conftest2.i conftest.out])\n])# _LT_PATH_DD\n\n\n# _LT_CMD_TRUNCATE\n# ----------------\n# find command to truncate a binary pipe\nm4_defun([_LT_CMD_TRUNCATE],\n[m4_require([_LT_PATH_DD])\nAC_CACHE_CHECK([how to truncate binary pipes], [lt_cv_truncate_bin],\n[printf 0123456789abcdef0123456789abcdef >conftest.i\ncat conftest.i conftest.i >conftest2.i\nlt_cv_truncate_bin=\nif \"$ac_cv_path_lt_DD\" bs=32 count=1 <conftest2.i >conftest.out 2>/dev/null; then\n  cmp -s conftest.i conftest.out \\\n  && lt_cv_truncate_bin=\"$ac_cv_path_lt_DD bs=4096 count=1\"\nfi\nrm -f conftest.i conftest2.i conftest.out\ntest -z \"$lt_cv_truncate_bin\" && lt_cv_truncate_bin=\"$SED -e 4q\"])\n_LT_DECL([lt_truncate_bin], [lt_cv_truncate_bin], [1],\n  [Command to truncate a binary pipe])\n])# _LT_CMD_TRUNCATE\n\n\n# _LT_CHECK_MAGIC_METHOD\n# ----------------------\n# how to check for library dependencies\n#  -- PORTME fill in with the dynamic library characteristics\nm4_defun([_LT_CHECK_MAGIC_METHOD],\n[m4_require([_LT_DECL_EGREP])\nm4_require([_LT_DECL_OBJDUMP])\nAC_CACHE_CHECK([how to recognize dependent libraries],\nlt_cv_deplibs_check_method,\n[lt_cv_file_magic_cmd='$MAGIC_CMD'\nlt_cv_file_magic_test_file=\nlt_cv_deplibs_check_method='unknown'\n# Need to set the preceding variable on all platforms that support\n# interlibrary dependencies.\n# 'none' -- dependencies not supported.\n# 'unknown' -- same as none, but documents that we really don't know.\n# 'pass_all' -- all dependencies passed with no checks.\n# 'test_compile' -- check by making test program.\n# 'file_magic [[regex]]' -- check by looking for files in library path\n# that responds to the $file_magic_cmd with a given extended regex.\n# If you have 'file' or equivalent on your system and you're not sure\n# whether 'pass_all' will *always* work, you probably want this one.\n\ncase $host_os in\naix[[4-9]]*)\n  lt_cv_deplibs_check_method=pass_all\n  ;;\n\nbeos*)\n  lt_cv_deplibs_check_method=pass_all\n  ;;\n\nbsdi[[45]]*)\n  lt_cv_deplibs_check_method='file_magic ELF [[0-9]][[0-9]]*-bit [[ML]]SB (shared object|dynamic lib)'\n  lt_cv_file_magic_cmd='/usr/bin/file -L'\n  lt_cv_file_magic_test_file=/shlib/libc.so\n  ;;\n\ncygwin*)\n  # func_win32_libid is a shell function defined in ltmain.sh\n  lt_cv_deplibs_check_method='file_magic ^x86 archive import|^x86 DLL'\n  lt_cv_file_magic_cmd='func_win32_libid'\n  ;;\n\nmingw* | pw32*)\n  # Base MSYS/MinGW do not provide the 'file' command needed by\n  # func_win32_libid shell function, so use a weaker test based on 'objdump',\n  # unless we find 'file', for example because we are cross-compiling.\n  if ( file / ) >/dev/null 2>&1; then\n    lt_cv_deplibs_check_method='file_magic ^x86 archive import|^x86 DLL'\n    lt_cv_file_magic_cmd='func_win32_libid'\n  else\n    # Keep this pattern in sync with the one in func_win32_libid.\n    lt_cv_deplibs_check_method='file_magic file format (pei*-i386(.*architecture: i386)?|pe-arm-wince|pe-x86-64)'\n    lt_cv_file_magic_cmd='$OBJDUMP -f'\n  fi\n  ;;\n\ncegcc*)\n  # use the weaker test based on 'objdump'. See mingw*.\n  lt_cv_deplibs_check_method='file_magic file format pe-arm-.*little(.*architecture: arm)?'\n  lt_cv_file_magic_cmd='$OBJDUMP -f'\n  ;;\n\ndarwin* | rhapsody*)\n  lt_cv_deplibs_check_method=pass_all\n  ;;\n\nfreebsd* | dragonfly*)\n  if echo __ELF__ | $CC -E - | $GREP __ELF__ > /dev/null; then\n    case $host_cpu in\n    i*86 )\n      # Not sure whether the presence of OpenBSD here was a mistake.\n      # Let's accept both of them until this is cleared up.\n      lt_cv_deplibs_check_method='file_magic (FreeBSD|OpenBSD|DragonFly)/i[[3-9]]86 (compact )?demand paged shared library'\n      lt_cv_file_magic_cmd=/usr/bin/file\n      lt_cv_file_magic_test_file=`echo /usr/lib/libc.so.*`\n      ;;\n    esac\n  else\n    lt_cv_deplibs_check_method=pass_all\n  fi\n  ;;\n\nhaiku*)\n  lt_cv_deplibs_check_method=pass_all\n  ;;\n\nhpux10.20* | hpux11*)\n  lt_cv_file_magic_cmd=/usr/bin/file\n  case $host_cpu in\n  ia64*)\n    lt_cv_deplibs_check_method='file_magic (s[[0-9]][[0-9]][[0-9]]|ELF-[[0-9]][[0-9]]) shared object file - IA64'\n    lt_cv_file_magic_test_file=/usr/lib/hpux32/libc.so\n    ;;\n  hppa*64*)\n    [lt_cv_deplibs_check_method='file_magic (s[0-9][0-9][0-9]|ELF[ -][0-9][0-9])(-bit)?( [LM]SB)? shared object( file)?[, -]* PA-RISC [0-9]\\.[0-9]']\n    lt_cv_file_magic_test_file=/usr/lib/pa20_64/libc.sl\n    ;;\n  *)\n    lt_cv_deplibs_check_method='file_magic (s[[0-9]][[0-9]][[0-9]]|PA-RISC[[0-9]]\\.[[0-9]]) shared library'\n    lt_cv_file_magic_test_file=/usr/lib/libc.sl\n    ;;\n  esac\n  ;;\n\ninterix[[3-9]]*)\n  # PIC code is broken on Interix 3.x, that's why |\\.a not |_pic\\.a here\n  lt_cv_deplibs_check_method='match_pattern /lib[[^/]]+(\\.so|\\.a)$'\n  ;;\n\nirix5* | irix6* | nonstopux*)\n  case $LD in\n  *-32|*\"-32 \") libmagic=32-bit;;\n  *-n32|*\"-n32 \") libmagic=N32;;\n  *-64|*\"-64 \") libmagic=64-bit;;\n  *) libmagic=never-match;;\n  esac\n  lt_cv_deplibs_check_method=pass_all\n  ;;\n\n# This must be glibc/ELF.\nlinux* | k*bsd*-gnu | kopensolaris*-gnu | gnu*)\n  lt_cv_deplibs_check_method=pass_all\n  ;;\n\nnetbsd* | netbsdelf*-gnu)\n  if echo __ELF__ | $CC -E - | $GREP __ELF__ > /dev/null; then\n    lt_cv_deplibs_check_method='match_pattern /lib[[^/]]+(\\.so\\.[[0-9]]+\\.[[0-9]]+|_pic\\.a)$'\n  else\n    lt_cv_deplibs_check_method='match_pattern /lib[[^/]]+(\\.so|_pic\\.a)$'\n  fi\n  ;;\n\nnewos6*)\n  lt_cv_deplibs_check_method='file_magic ELF [[0-9]][[0-9]]*-bit [[ML]]SB (executable|dynamic lib)'\n  lt_cv_file_magic_cmd=/usr/bin/file\n  lt_cv_file_magic_test_file=/usr/lib/libnls.so\n  ;;\n\n*nto* | *qnx*)\n  lt_cv_deplibs_check_method=pass_all\n  ;;\n\nopenbsd* | bitrig*)\n  if test -z \"`echo __ELF__ | $CC -E - | $GREP __ELF__`\"; then\n    lt_cv_deplibs_check_method='match_pattern /lib[[^/]]+(\\.so\\.[[0-9]]+\\.[[0-9]]+|\\.so|_pic\\.a)$'\n  else\n    lt_cv_deplibs_check_method='match_pattern /lib[[^/]]+(\\.so\\.[[0-9]]+\\.[[0-9]]+|_pic\\.a)$'\n  fi\n  ;;\n\nosf3* | osf4* | osf5*)\n  lt_cv_deplibs_check_method=pass_all\n  ;;\n\nrdos*)\n  lt_cv_deplibs_check_method=pass_all\n  ;;\n\nsolaris*)\n  lt_cv_deplibs_check_method=pass_all\n  ;;\n\nsysv5* | sco3.2v5* | sco5v6* | unixware* | OpenUNIX* | sysv4*uw2*)\n  lt_cv_deplibs_check_method=pass_all\n  ;;\n\nsysv4 | sysv4.3*)\n  case $host_vendor in\n  motorola)\n    lt_cv_deplibs_check_method='file_magic ELF [[0-9]][[0-9]]*-bit [[ML]]SB (shared object|dynamic lib) M[[0-9]][[0-9]]* Version [[0-9]]'\n    lt_cv_file_magic_test_file=`echo /usr/lib/libc.so*`\n    ;;\n  ncr)\n    lt_cv_deplibs_check_method=pass_all\n    ;;\n  sequent)\n    lt_cv_file_magic_cmd='/bin/file'\n    lt_cv_deplibs_check_method='file_magic ELF [[0-9]][[0-9]]*-bit [[LM]]SB (shared object|dynamic lib )'\n    ;;\n  sni)\n    lt_cv_file_magic_cmd='/bin/file'\n    lt_cv_deplibs_check_method=\"file_magic ELF [[0-9]][[0-9]]*-bit [[LM]]SB dynamic lib\"\n    lt_cv_file_magic_test_file=/lib/libc.so\n    ;;\n  siemens)\n    lt_cv_deplibs_check_method=pass_all\n    ;;\n  pc)\n    lt_cv_deplibs_check_method=pass_all\n    ;;\n  esac\n  ;;\n\ntpf*)\n  lt_cv_deplibs_check_method=pass_all\n  ;;\nos2*)\n  lt_cv_deplibs_check_method=pass_all\n  ;;\nesac\n])\n\nfile_magic_glob=\nwant_nocaseglob=no\nif test \"$build\" = \"$host\"; then\n  case $host_os in\n  mingw* | pw32*)\n    if ( shopt | grep nocaseglob ) >/dev/null 2>&1; then\n      want_nocaseglob=yes\n    else\n      file_magic_glob=`echo aAbBcCdDeEfFgGhHiIjJkKlLmMnNoOpPqQrRsStTuUvVwWxXyYzZ | $SED -e \"s/\\(..\\)/s\\/[[\\1]]\\/[[\\1]]\\/g;/g\"`\n    fi\n    ;;\n  esac\nfi\n\nfile_magic_cmd=$lt_cv_file_magic_cmd\ndeplibs_check_method=$lt_cv_deplibs_check_method\ntest -z \"$deplibs_check_method\" && deplibs_check_method=unknown\n\n_LT_DECL([], [deplibs_check_method], [1],\n    [Method to check whether dependent libraries are shared objects])\n_LT_DECL([], [file_magic_cmd], [1],\n    [Command to use when deplibs_check_method = \"file_magic\"])\n_LT_DECL([], [file_magic_glob], [1],\n    [How to find potential files when deplibs_check_method = \"file_magic\"])\n_LT_DECL([], [want_nocaseglob], [1],\n    [Find potential files using nocaseglob when deplibs_check_method = \"file_magic\"])\n])# _LT_CHECK_MAGIC_METHOD\n\n\n# LT_PATH_NM\n# ----------\n# find the pathname to a BSD- or MS-compatible name lister\nAC_DEFUN([LT_PATH_NM],\n[AC_REQUIRE([AC_PROG_CC])dnl\nAC_CACHE_CHECK([for BSD- or MS-compatible name lister (nm)], lt_cv_path_NM,\n[if test -n \"$NM\"; then\n  # Let the user override the test.\n  lt_cv_path_NM=$NM\nelse\n  lt_nm_to_check=${ac_tool_prefix}nm\n  if test -n \"$ac_tool_prefix\" && test \"$build\" = \"$host\"; then\n    lt_nm_to_check=\"$lt_nm_to_check nm\"\n  fi\n  for lt_tmp_nm in $lt_nm_to_check; do\n    lt_save_ifs=$IFS; IFS=$PATH_SEPARATOR\n    for ac_dir in $PATH /usr/ccs/bin/elf /usr/ccs/bin /usr/ucb /bin; do\n      IFS=$lt_save_ifs\n      test -z \"$ac_dir\" && ac_dir=.\n      tmp_nm=$ac_dir/$lt_tmp_nm\n      if test -f \"$tmp_nm\" || test -f \"$tmp_nm$ac_exeext\"; then\n\t# Check to see if the nm accepts a BSD-compat flag.\n\t# Adding the 'sed 1q' prevents false positives on HP-UX, which says:\n\t#   nm: unknown option \"B\" ignored\n\t# Tru64's nm complains that /dev/null is an invalid object file\n\t# MSYS converts /dev/null to NUL, MinGW nm treats NUL as empty\n\tcase $build_os in\n\tmingw*) lt_bad_file=conftest.nm/nofile ;;\n\t*) lt_bad_file=/dev/null ;;\n\tesac\n\tcase `\"$tmp_nm\" -B $lt_bad_file 2>&1 | sed '1q'` in\n\t*$lt_bad_file* | *'Invalid file or object type'*)\n\t  lt_cv_path_NM=\"$tmp_nm -B\"\n\t  break 2\n\t  ;;\n\t*)\n\t  case `\"$tmp_nm\" -p /dev/null 2>&1 | sed '1q'` in\n\t  */dev/null*)\n\t    lt_cv_path_NM=\"$tmp_nm -p\"\n\t    break 2\n\t    ;;\n\t  *)\n\t    lt_cv_path_NM=${lt_cv_path_NM=\"$tmp_nm\"} # keep the first match, but\n\t    continue # so that we can try to find one that supports BSD flags\n\t    ;;\n\t  esac\n\t  ;;\n\tesac\n      fi\n    done\n    IFS=$lt_save_ifs\n  done\n  : ${lt_cv_path_NM=no}\nfi])\nif test no != \"$lt_cv_path_NM\"; then\n  NM=$lt_cv_path_NM\nelse\n  # Didn't find any BSD compatible name lister, look for dumpbin.\n  if test -n \"$DUMPBIN\"; then :\n    # Let the user override the test.\n  else\n    AC_CHECK_TOOLS(DUMPBIN, [dumpbin \"link -dump\"], :)\n    case `$DUMPBIN -symbols -headers /dev/null 2>&1 | sed '1q'` in\n    *COFF*)\n      DUMPBIN=\"$DUMPBIN -symbols -headers\"\n      ;;\n    *)\n      DUMPBIN=:\n      ;;\n    esac\n  fi\n  AC_SUBST([DUMPBIN])\n  if test : != \"$DUMPBIN\"; then\n    NM=$DUMPBIN\n  fi\nfi\ntest -z \"$NM\" && NM=nm\nAC_SUBST([NM])\n_LT_DECL([], [NM], [1], [A BSD- or MS-compatible name lister])dnl\n\nAC_CACHE_CHECK([the name lister ($NM) interface], [lt_cv_nm_interface],\n  [lt_cv_nm_interface=\"BSD nm\"\n  echo \"int some_variable = 0;\" > conftest.$ac_ext\n  (eval echo \"\\\"\\$as_me:$LINENO: $ac_compile\\\"\" >&AS_MESSAGE_LOG_FD)\n  (eval \"$ac_compile\" 2>conftest.err)\n  cat conftest.err >&AS_MESSAGE_LOG_FD\n  (eval echo \"\\\"\\$as_me:$LINENO: $NM \\\\\\\"conftest.$ac_objext\\\\\\\"\\\"\" >&AS_MESSAGE_LOG_FD)\n  (eval \"$NM \\\"conftest.$ac_objext\\\"\" 2>conftest.err > conftest.out)\n  cat conftest.err >&AS_MESSAGE_LOG_FD\n  (eval echo \"\\\"\\$as_me:$LINENO: output\\\"\" >&AS_MESSAGE_LOG_FD)\n  cat conftest.out >&AS_MESSAGE_LOG_FD\n  if $GREP 'External.*some_variable' conftest.out > /dev/null; then\n    lt_cv_nm_interface=\"MS dumpbin\"\n  fi\n  rm -f conftest*])\n])# LT_PATH_NM\n\n# Old names:\nAU_ALIAS([AM_PROG_NM], [LT_PATH_NM])\nAU_ALIAS([AC_PROG_NM], [LT_PATH_NM])\ndnl aclocal-1.4 backwards compatibility:\ndnl AC_DEFUN([AM_PROG_NM], [])\ndnl AC_DEFUN([AC_PROG_NM], [])\n\n# _LT_CHECK_SHAREDLIB_FROM_LINKLIB\n# --------------------------------\n# how to determine the name of the shared library\n# associated with a specific link library.\n#  -- PORTME fill in with the dynamic library characteristics\nm4_defun([_LT_CHECK_SHAREDLIB_FROM_LINKLIB],\n[m4_require([_LT_DECL_EGREP])\nm4_require([_LT_DECL_OBJDUMP])\nm4_require([_LT_DECL_DLLTOOL])\nAC_CACHE_CHECK([how to associate runtime and link libraries],\nlt_cv_sharedlib_from_linklib_cmd,\n[lt_cv_sharedlib_from_linklib_cmd='unknown'\n\ncase $host_os in\ncygwin* | mingw* | pw32* | cegcc*)\n  # two different shell functions defined in ltmain.sh;\n  # decide which one to use based on capabilities of $DLLTOOL\n  case `$DLLTOOL --help 2>&1` in\n  *--identify-strict*)\n    lt_cv_sharedlib_from_linklib_cmd=func_cygming_dll_for_implib\n    ;;\n  *)\n    lt_cv_sharedlib_from_linklib_cmd=func_cygming_dll_for_implib_fallback\n    ;;\n  esac\n  ;;\n*)\n  # fallback: assume linklib IS sharedlib\n  lt_cv_sharedlib_from_linklib_cmd=$ECHO\n  ;;\nesac\n])\nsharedlib_from_linklib_cmd=$lt_cv_sharedlib_from_linklib_cmd\ntest -z \"$sharedlib_from_linklib_cmd\" && sharedlib_from_linklib_cmd=$ECHO\n\n_LT_DECL([], [sharedlib_from_linklib_cmd], [1],\n    [Command to associate shared and link libraries])\n])# _LT_CHECK_SHAREDLIB_FROM_LINKLIB\n\n\n# _LT_PATH_MANIFEST_TOOL\n# ----------------------\n# locate the manifest tool\nm4_defun([_LT_PATH_MANIFEST_TOOL],\n[AC_CHECK_TOOL(MANIFEST_TOOL, mt, :)\ntest -z \"$MANIFEST_TOOL\" && MANIFEST_TOOL=mt\nAC_CACHE_CHECK([if $MANIFEST_TOOL is a manifest tool], [lt_cv_path_mainfest_tool],\n  [lt_cv_path_mainfest_tool=no\n  echo \"$as_me:$LINENO: $MANIFEST_TOOL '-?'\" >&AS_MESSAGE_LOG_FD\n  $MANIFEST_TOOL '-?' 2>conftest.err > conftest.out\n  cat conftest.err >&AS_MESSAGE_LOG_FD\n  if $GREP 'Manifest Tool' conftest.out > /dev/null; then\n    lt_cv_path_mainfest_tool=yes\n  fi\n  rm -f conftest*])\nif test yes != \"$lt_cv_path_mainfest_tool\"; then\n  MANIFEST_TOOL=:\nfi\n_LT_DECL([], [MANIFEST_TOOL], [1], [Manifest tool])dnl\n])# _LT_PATH_MANIFEST_TOOL\n\n\n# _LT_DLL_DEF_P([FILE])\n# ---------------------\n# True iff FILE is a Windows DLL '.def' file.\n# Keep in sync with func_dll_def_p in the libtool script\nAC_DEFUN([_LT_DLL_DEF_P],\n[dnl\n  test DEF = \"`$SED -n dnl\n    -e '\\''s/^[[\t ]]*//'\\'' dnl Strip leading whitespace\n    -e '\\''/^\\(;.*\\)*$/d'\\'' dnl      Delete empty lines and comments\n    -e '\\''s/^\\(EXPORTS\\|LIBRARY\\)\\([[\t ]].*\\)*$/DEF/p'\\'' dnl\n    -e q dnl                          Only consider the first \"real\" line\n    $1`\" dnl\n])# _LT_DLL_DEF_P\n\n\n# LT_LIB_M\n# --------\n# check for math library\nAC_DEFUN([LT_LIB_M],\n[AC_REQUIRE([AC_CANONICAL_HOST])dnl\nLIBM=\ncase $host in\n*-*-beos* | *-*-cegcc* | *-*-cygwin* | *-*-haiku* | *-*-pw32* | *-*-darwin*)\n  # These system don't have libm, or don't need it\n  ;;\n*-ncr-sysv4.3*)\n  AC_CHECK_LIB(mw, _mwvalidcheckl, LIBM=-lmw)\n  AC_CHECK_LIB(m, cos, LIBM=\"$LIBM -lm\")\n  ;;\n*)\n  AC_CHECK_LIB(m, cos, LIBM=-lm)\n  ;;\nesac\nAC_SUBST([LIBM])\n])# LT_LIB_M\n\n# Old name:\nAU_ALIAS([AC_CHECK_LIBM], [LT_LIB_M])\ndnl aclocal-1.4 backwards compatibility:\ndnl AC_DEFUN([AC_CHECK_LIBM], [])\n\n\n# _LT_COMPILER_NO_RTTI([TAGNAME])\n# -------------------------------\nm4_defun([_LT_COMPILER_NO_RTTI],\n[m4_require([_LT_TAG_COMPILER])dnl\n\n_LT_TAGVAR(lt_prog_compiler_no_builtin_flag, $1)=\n\nif test yes = \"$GCC\"; then\n  case $cc_basename in\n  nvcc*)\n    _LT_TAGVAR(lt_prog_compiler_no_builtin_flag, $1)=' -Xcompiler -fno-builtin' ;;\n  *)\n    _LT_TAGVAR(lt_prog_compiler_no_builtin_flag, $1)=' -fno-builtin' ;;\n  esac\n\n  _LT_COMPILER_OPTION([if $compiler supports -fno-rtti -fno-exceptions],\n    lt_cv_prog_compiler_rtti_exceptions,\n    [-fno-rtti -fno-exceptions], [],\n    [_LT_TAGVAR(lt_prog_compiler_no_builtin_flag, $1)=\"$_LT_TAGVAR(lt_prog_compiler_no_builtin_flag, $1) -fno-rtti -fno-exceptions\"])\nfi\n_LT_TAGDECL([no_builtin_flag], [lt_prog_compiler_no_builtin_flag], [1],\n\t[Compiler flag to turn off builtin functions])\n])# _LT_COMPILER_NO_RTTI\n\n\n# _LT_CMD_GLOBAL_SYMBOLS\n# ----------------------\nm4_defun([_LT_CMD_GLOBAL_SYMBOLS],\n[AC_REQUIRE([AC_CANONICAL_HOST])dnl\nAC_REQUIRE([AC_PROG_CC])dnl\nAC_REQUIRE([AC_PROG_AWK])dnl\nAC_REQUIRE([LT_PATH_NM])dnl\nAC_REQUIRE([LT_PATH_LD])dnl\nm4_require([_LT_DECL_SED])dnl\nm4_require([_LT_DECL_EGREP])dnl\nm4_require([_LT_TAG_COMPILER])dnl\n\n# Check for command to grab the raw symbol name followed by C symbol from nm.\nAC_MSG_CHECKING([command to parse $NM output from $compiler object])\nAC_CACHE_VAL([lt_cv_sys_global_symbol_pipe],\n[\n# These are sane defaults that work on at least a few old systems.\n# [They come from Ultrix.  What could be older than Ultrix?!! ;)]\n\n# Character class describing NM global symbol codes.\nsymcode='[[BCDEGRST]]'\n\n# Regexp to match symbols that can be accessed directly from C.\nsympat='\\([[_A-Za-z]][[_A-Za-z0-9]]*\\)'\n\n# Define system-specific variables.\ncase $host_os in\naix*)\n  symcode='[[BCDT]]'\n  ;;\ncygwin* | mingw* | pw32* | cegcc*)\n  symcode='[[ABCDGISTW]]'\n  ;;\nhpux*)\n  if test ia64 = \"$host_cpu\"; then\n    symcode='[[ABCDEGRST]]'\n  fi\n  ;;\nirix* | nonstopux*)\n  symcode='[[BCDEGRST]]'\n  ;;\nosf*)\n  symcode='[[BCDEGQRST]]'\n  ;;\nsolaris*)\n  symcode='[[BDRT]]'\n  ;;\nsco3.2v5*)\n  symcode='[[DT]]'\n  ;;\nsysv4.2uw2*)\n  symcode='[[DT]]'\n  ;;\nsysv5* | sco5v6* | unixware* | OpenUNIX*)\n  symcode='[[ABDT]]'\n  ;;\nsysv4)\n  symcode='[[DFNSTU]]'\n  ;;\nesac\n\n# If we're using GNU nm, then use its standard symbol codes.\ncase `$NM -V 2>&1` in\n*GNU* | *'with BFD'*)\n  symcode='[[ABCDGIRSTW]]' ;;\nesac\n\nif test \"$lt_cv_nm_interface\" = \"MS dumpbin\"; then\n  # Gets list of data symbols to import.\n  lt_cv_sys_global_symbol_to_import=\"sed -n -e 's/^I .* \\(.*\\)$/\\1/p'\"\n  # Adjust the below global symbol transforms to fixup imported variables.\n  lt_cdecl_hook=\" -e 's/^I .* \\(.*\\)$/extern __declspec(dllimport) char \\1;/p'\"\n  lt_c_name_hook=\" -e 's/^I .* \\(.*\\)$/  {\\\"\\1\\\", (void *) 0},/p'\"\n  lt_c_name_lib_hook=\"\\\n  -e 's/^I .* \\(lib.*\\)$/  {\\\"\\1\\\", (void *) 0},/p'\\\n  -e 's/^I .* \\(.*\\)$/  {\\\"lib\\1\\\", (void *) 0},/p'\"\nelse\n  # Disable hooks by default.\n  lt_cv_sys_global_symbol_to_import=\n  lt_cdecl_hook=\n  lt_c_name_hook=\n  lt_c_name_lib_hook=\nfi\n\n# Transform an extracted symbol line into a proper C declaration.\n# Some systems (esp. on ia64) link data and code symbols differently,\n# so use this general approach.\nlt_cv_sys_global_symbol_to_cdecl=\"sed -n\"\\\n$lt_cdecl_hook\\\n\" -e 's/^T .* \\(.*\\)$/extern int \\1();/p'\"\\\n\" -e 's/^$symcode$symcode* .* \\(.*\\)$/extern char \\1;/p'\"\n\n# Transform an extracted symbol line into symbol name and symbol address\nlt_cv_sys_global_symbol_to_c_name_address=\"sed -n\"\\\n$lt_c_name_hook\\\n\" -e 's/^: \\(.*\\) .*$/  {\\\"\\1\\\", (void *) 0},/p'\"\\\n\" -e 's/^$symcode$symcode* .* \\(.*\\)$/  {\\\"\\1\\\", (void *) \\&\\1},/p'\"\n\n# Transform an extracted symbol line into symbol name with lib prefix and\n# symbol address.\nlt_cv_sys_global_symbol_to_c_name_address_lib_prefix=\"sed -n\"\\\n$lt_c_name_lib_hook\\\n\" -e 's/^: \\(.*\\) .*$/  {\\\"\\1\\\", (void *) 0},/p'\"\\\n\" -e 's/^$symcode$symcode* .* \\(lib.*\\)$/  {\\\"\\1\\\", (void *) \\&\\1},/p'\"\\\n\" -e 's/^$symcode$symcode* .* \\(.*\\)$/  {\\\"lib\\1\\\", (void *) \\&\\1},/p'\"\n\n# Handle CRLF in mingw tool chain\nopt_cr=\ncase $build_os in\nmingw*)\n  opt_cr=`$ECHO 'x\\{0,1\\}' | tr x '\\015'` # option cr in regexp\n  ;;\nesac\n\n# Try without a prefix underscore, then with it.\nfor ac_symprfx in \"\" \"_\"; do\n\n  # Transform symcode, sympat, and symprfx into a raw symbol and a C symbol.\n  symxfrm=\"\\\\1 $ac_symprfx\\\\2 \\\\2\"\n\n  # Write the raw and C identifiers.\n  if test \"$lt_cv_nm_interface\" = \"MS dumpbin\"; then\n    # Fake it for dumpbin and say T for any non-static function,\n    # D for any global variable and I for any imported variable.\n    # Also find C++ and __fastcall symbols from MSVC++,\n    # which start with @ or ?.\n    lt_cv_sys_global_symbol_pipe=\"$AWK ['\"\\\n\"     {last_section=section; section=\\$ 3};\"\\\n\"     /^COFF SYMBOL TABLE/{for(i in hide) delete hide[i]};\"\\\n\"     /Section length .*#relocs.*(pick any)/{hide[last_section]=1};\"\\\n\"     /^ *Symbol name *: /{split(\\$ 0,sn,\\\":\\\"); si=substr(sn[2],2)};\"\\\n\"     /^ *Type *: code/{print \\\"T\\\",si,substr(si,length(prfx))};\"\\\n\"     /^ *Type *: data/{print \\\"I\\\",si,substr(si,length(prfx))};\"\\\n\"     \\$ 0!~/External *\\|/{next};\"\\\n\"     / 0+ UNDEF /{next}; / UNDEF \\([^|]\\)*()/{next};\"\\\n\"     {if(hide[section]) next};\"\\\n\"     {f=\\\"D\\\"}; \\$ 0~/\\(\\).*\\|/{f=\\\"T\\\"};\"\\\n\"     {split(\\$ 0,a,/\\||\\r/); split(a[2],s)};\"\\\n\"     s[1]~/^[@?]/{print f,s[1],s[1]; next};\"\\\n\"     s[1]~prfx {split(s[1],t,\\\"@\\\"); print f,t[1],substr(t[1],length(prfx))}\"\\\n\"     ' prfx=^$ac_symprfx]\"\n  else\n    lt_cv_sys_global_symbol_pipe=\"sed -n -e 's/^.*[[\t ]]\\($symcode$symcode*\\)[[\t ]][[\t ]]*$ac_symprfx$sympat$opt_cr$/$symxfrm/p'\"\n  fi\n  lt_cv_sys_global_symbol_pipe=\"$lt_cv_sys_global_symbol_pipe | sed '/ __gnu_lto/d'\"\n\n  # Check to see that the pipe works correctly.\n  pipe_works=no\n\n  rm -f conftest*\n  cat > conftest.$ac_ext <<_LT_EOF\n#ifdef __cplusplus\nextern \"C\" {\n#endif\nchar nm_test_var;\nvoid nm_test_func(void);\nvoid nm_test_func(void){}\n#ifdef __cplusplus\n}\n#endif\nint main(){nm_test_var='a';nm_test_func();return(0);}\n_LT_EOF\n\n  if AC_TRY_EVAL(ac_compile); then\n    # Now try to grab the symbols.\n    nlist=conftest.nm\n    if AC_TRY_EVAL(NM conftest.$ac_objext \\| \"$lt_cv_sys_global_symbol_pipe\" \\> $nlist) && test -s \"$nlist\"; then\n      # Try sorting and uniquifying the output.\n      if sort \"$nlist\" | uniq > \"$nlist\"T; then\n\tmv -f \"$nlist\"T \"$nlist\"\n      else\n\trm -f \"$nlist\"T\n      fi\n\n      # Make sure that we snagged all the symbols we need.\n      if $GREP ' nm_test_var$' \"$nlist\" >/dev/null; then\n\tif $GREP ' nm_test_func$' \"$nlist\" >/dev/null; then\n\t  cat <<_LT_EOF > conftest.$ac_ext\n/* Keep this code in sync between libtool.m4, ltmain, lt_system.h, and tests.  */\n#if defined _WIN32 || defined __CYGWIN__ || defined _WIN32_WCE\n/* DATA imports from DLLs on WIN32 can't be const, because runtime\n   relocations are performed -- see ld's documentation on pseudo-relocs.  */\n# define LT@&t@_DLSYM_CONST\n#elif defined __osf__\n/* This system does not cope well with relocations in const data.  */\n# define LT@&t@_DLSYM_CONST\n#else\n# define LT@&t@_DLSYM_CONST const\n#endif\n\n#ifdef __cplusplus\nextern \"C\" {\n#endif\n\n_LT_EOF\n\t  # Now generate the symbol file.\n\t  eval \"$lt_cv_sys_global_symbol_to_cdecl\"' < \"$nlist\" | $GREP -v main >> conftest.$ac_ext'\n\n\t  cat <<_LT_EOF >> conftest.$ac_ext\n\n/* The mapping between symbol names and symbols.  */\nLT@&t@_DLSYM_CONST struct {\n  const char *name;\n  void       *address;\n}\nlt__PROGRAM__LTX_preloaded_symbols[[]] =\n{\n  { \"@PROGRAM@\", (void *) 0 },\n_LT_EOF\n\t  $SED \"s/^$symcode$symcode* .* \\(.*\\)$/  {\\\"\\1\\\", (void *) \\&\\1},/\" < \"$nlist\" | $GREP -v main >> conftest.$ac_ext\n\t  cat <<\\_LT_EOF >> conftest.$ac_ext\n  {0, (void *) 0}\n};\n\n/* This works around a problem in FreeBSD linker */\n#ifdef FREEBSD_WORKAROUND\nstatic const void *lt_preloaded_setup() {\n  return lt__PROGRAM__LTX_preloaded_symbols;\n}\n#endif\n\n#ifdef __cplusplus\n}\n#endif\n_LT_EOF\n\t  # Now try linking the two files.\n\t  mv conftest.$ac_objext conftstm.$ac_objext\n\t  lt_globsym_save_LIBS=$LIBS\n\t  lt_globsym_save_CFLAGS=$CFLAGS\n\t  LIBS=conftstm.$ac_objext\n\t  CFLAGS=\"$CFLAGS$_LT_TAGVAR(lt_prog_compiler_no_builtin_flag, $1)\"\n\t  if AC_TRY_EVAL(ac_link) && test -s conftest$ac_exeext; then\n\t    pipe_works=yes\n\t  fi\n\t  LIBS=$lt_globsym_save_LIBS\n\t  CFLAGS=$lt_globsym_save_CFLAGS\n\telse\n\t  echo \"cannot find nm_test_func in $nlist\" >&AS_MESSAGE_LOG_FD\n\tfi\n      else\n\techo \"cannot find nm_test_var in $nlist\" >&AS_MESSAGE_LOG_FD\n      fi\n    else\n      echo \"cannot run $lt_cv_sys_global_symbol_pipe\" >&AS_MESSAGE_LOG_FD\n    fi\n  else\n    echo \"$progname: failed program was:\" >&AS_MESSAGE_LOG_FD\n    cat conftest.$ac_ext >&5\n  fi\n  rm -rf conftest* conftst*\n\n  # Do not use the global_symbol_pipe unless it works.\n  if test yes = \"$pipe_works\"; then\n    break\n  else\n    lt_cv_sys_global_symbol_pipe=\n  fi\ndone\n])\nif test -z \"$lt_cv_sys_global_symbol_pipe\"; then\n  lt_cv_sys_global_symbol_to_cdecl=\nfi\nif test -z \"$lt_cv_sys_global_symbol_pipe$lt_cv_sys_global_symbol_to_cdecl\"; then\n  AC_MSG_RESULT(failed)\nelse\n  AC_MSG_RESULT(ok)\nfi\n\n# Response file support.\nif test \"$lt_cv_nm_interface\" = \"MS dumpbin\"; then\n  nm_file_list_spec='@'\nelif $NM --help 2>/dev/null | grep '[[@]]FILE' >/dev/null; then\n  nm_file_list_spec='@'\nfi\n\n_LT_DECL([global_symbol_pipe], [lt_cv_sys_global_symbol_pipe], [1],\n    [Take the output of nm and produce a listing of raw symbols and C names])\n_LT_DECL([global_symbol_to_cdecl], [lt_cv_sys_global_symbol_to_cdecl], [1],\n    [Transform the output of nm in a proper C declaration])\n_LT_DECL([global_symbol_to_import], [lt_cv_sys_global_symbol_to_import], [1],\n    [Transform the output of nm into a list of symbols to manually relocate])\n_LT_DECL([global_symbol_to_c_name_address],\n    [lt_cv_sys_global_symbol_to_c_name_address], [1],\n    [Transform the output of nm in a C name address pair])\n_LT_DECL([global_symbol_to_c_name_address_lib_prefix],\n    [lt_cv_sys_global_symbol_to_c_name_address_lib_prefix], [1],\n    [Transform the output of nm in a C name address pair when lib prefix is needed])\n_LT_DECL([nm_interface], [lt_cv_nm_interface], [1],\n    [The name lister interface])\n_LT_DECL([], [nm_file_list_spec], [1],\n    [Specify filename containing input files for $NM])\n]) # _LT_CMD_GLOBAL_SYMBOLS\n\n\n# _LT_COMPILER_PIC([TAGNAME])\n# ---------------------------\nm4_defun([_LT_COMPILER_PIC],\n[m4_require([_LT_TAG_COMPILER])dnl\n_LT_TAGVAR(lt_prog_compiler_wl, $1)=\n_LT_TAGVAR(lt_prog_compiler_pic, $1)=\n_LT_TAGVAR(lt_prog_compiler_static, $1)=\n\nm4_if([$1], [CXX], [\n  # C++ specific cases for pic, static, wl, etc.\n  if test yes = \"$GXX\"; then\n    _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'\n    _LT_TAGVAR(lt_prog_compiler_static, $1)='-static'\n\n    case $host_os in\n    aix*)\n      # All AIX code is PIC.\n      if test ia64 = \"$host_cpu\"; then\n\t# AIX 5 now supports IA64 processor\n\t_LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic'\n      fi\n      _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC'\n      ;;\n\n    amigaos*)\n      case $host_cpu in\n      powerpc)\n            # see comment about AmigaOS4 .so support\n            _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC'\n        ;;\n      m68k)\n            # FIXME: we need at least 68020 code to build shared libraries, but\n            # adding the '-m68020' flag to GCC prevents building anything better,\n            # like '-m68040'.\n            _LT_TAGVAR(lt_prog_compiler_pic, $1)='-m68020 -resident32 -malways-restore-a4'\n        ;;\n      esac\n      ;;\n\n    beos* | irix5* | irix6* | nonstopux* | osf3* | osf4* | osf5*)\n      # PIC is the default for these OSes.\n      ;;\n    mingw* | cygwin* | os2* | pw32* | cegcc*)\n      # This hack is so that the source file can tell whether it is being\n      # built for inclusion in a dll (and should export symbols for example).\n      # Although the cygwin gcc ignores -fPIC, still need this for old-style\n      # (--disable-auto-import) libraries\n      m4_if([$1], [GCJ], [],\n\t[_LT_TAGVAR(lt_prog_compiler_pic, $1)='-DDLL_EXPORT'])\n      case $host_os in\n      os2*)\n\t_LT_TAGVAR(lt_prog_compiler_static, $1)='$wl-static'\n\t;;\n      esac\n      ;;\n    darwin* | rhapsody*)\n      # PIC is the default on this platform\n      # Common symbols not allowed in MH_DYLIB files\n      _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fno-common'\n      ;;\n    *djgpp*)\n      # DJGPP does not support shared libraries at all\n      _LT_TAGVAR(lt_prog_compiler_pic, $1)=\n      ;;\n    haiku*)\n      # PIC is the default for Haiku.\n      # The \"-static\" flag exists, but is broken.\n      _LT_TAGVAR(lt_prog_compiler_static, $1)=\n      ;;\n    interix[[3-9]]*)\n      # Interix 3.x gcc -fpic/-fPIC options generate broken code.\n      # Instead, we relocate shared libraries at runtime.\n      ;;\n    sysv4*MP*)\n      if test -d /usr/nec; then\n\t_LT_TAGVAR(lt_prog_compiler_pic, $1)=-Kconform_pic\n      fi\n      ;;\n    hpux*)\n      # PIC is the default for 64-bit PA HP-UX, but not for 32-bit\n      # PA HP-UX.  On IA64 HP-UX, PIC is the default but the pic flag\n      # sets the default TLS model and affects inlining.\n      case $host_cpu in\n      hppa*64*)\n\t;;\n      *)\n\t_LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC'\n\t;;\n      esac\n      ;;\n    *qnx* | *nto*)\n      # QNX uses GNU C++, but need to define -shared option too, otherwise\n      # it will coredump.\n      _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC -shared'\n      ;;\n    *)\n      _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC'\n      ;;\n    esac\n  else\n    case $host_os in\n      aix[[4-9]]*)\n\t# All AIX code is PIC.\n\tif test ia64 = \"$host_cpu\"; then\n\t  # AIX 5 now supports IA64 processor\n\t  _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic'\n\telse\n\t  _LT_TAGVAR(lt_prog_compiler_static, $1)='-bnso -bI:/lib/syscalls.exp'\n\tfi\n\t;;\n      chorus*)\n\tcase $cc_basename in\n\tcxch68*)\n\t  # Green Hills C++ Compiler\n\t  # _LT_TAGVAR(lt_prog_compiler_static, $1)=\"--no_auto_instantiation -u __main -u __premain -u _abort -r $COOL_DIR/lib/libOrb.a $MVME_DIR/lib/CC/libC.a $MVME_DIR/lib/classix/libcx.s.a\"\n\t  ;;\n\tesac\n\t;;\n      mingw* | cygwin* | os2* | pw32* | cegcc*)\n\t# This hack is so that the source file can tell whether it is being\n\t# built for inclusion in a dll (and should export symbols for example).\n\tm4_if([$1], [GCJ], [],\n\t  [_LT_TAGVAR(lt_prog_compiler_pic, $1)='-DDLL_EXPORT'])\n\t;;\n      dgux*)\n\tcase $cc_basename in\n\t  ec++*)\n\t    _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC'\n\t    ;;\n\t  ghcx*)\n\t    # Green Hills C++ Compiler\n\t    _LT_TAGVAR(lt_prog_compiler_pic, $1)='-pic'\n\t    ;;\n\t  *)\n\t    ;;\n\tesac\n\t;;\n      freebsd* | dragonfly*)\n\t# FreeBSD uses GNU C++\n\t;;\n      hpux9* | hpux10* | hpux11*)\n\tcase $cc_basename in\n\t  CC*)\n\t    _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'\n\t    _LT_TAGVAR(lt_prog_compiler_static, $1)='$wl-a ${wl}archive'\n\t    if test ia64 != \"$host_cpu\"; then\n\t      _LT_TAGVAR(lt_prog_compiler_pic, $1)='+Z'\n\t    fi\n\t    ;;\n\t  aCC*)\n\t    _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'\n\t    _LT_TAGVAR(lt_prog_compiler_static, $1)='$wl-a ${wl}archive'\n\t    case $host_cpu in\n\t    hppa*64*|ia64*)\n\t      # +Z the default\n\t      ;;\n\t    *)\n\t      _LT_TAGVAR(lt_prog_compiler_pic, $1)='+Z'\n\t      ;;\n\t    esac\n\t    ;;\n\t  *)\n\t    ;;\n\tesac\n\t;;\n      interix*)\n\t# This is c89, which is MS Visual C++ (no shared libs)\n\t# Anyone wants to do a port?\n\t;;\n      irix5* | irix6* | nonstopux*)\n\tcase $cc_basename in\n\t  CC*)\n\t    _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'\n\t    _LT_TAGVAR(lt_prog_compiler_static, $1)='-non_shared'\n\t    # CC pic flag -KPIC is the default.\n\t    ;;\n\t  *)\n\t    ;;\n\tesac\n\t;;\n      linux* | k*bsd*-gnu | kopensolaris*-gnu | gnu*)\n\tcase $cc_basename in\n\t  KCC*)\n\t    # KAI C++ Compiler\n\t    _LT_TAGVAR(lt_prog_compiler_wl, $1)='--backend -Wl,'\n\t    _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC'\n\t    ;;\n\t  ecpc* )\n\t    # old Intel C++ for x86_64, which still supported -KPIC.\n\t    _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'\n\t    _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC'\n\t    _LT_TAGVAR(lt_prog_compiler_static, $1)='-static'\n\t    ;;\n\t  icpc* )\n\t    # Intel C++, used to be incompatible with GCC.\n\t    # ICC 10 doesn't accept -KPIC any more.\n\t    _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'\n\t    _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC'\n\t    _LT_TAGVAR(lt_prog_compiler_static, $1)='-static'\n\t    ;;\n\t  pgCC* | pgcpp*)\n\t    # Portland Group C++ compiler\n\t    _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'\n\t    _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fpic'\n\t    _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic'\n\t    ;;\n\t  cxx*)\n\t    # Compaq C++\n\t    # Make sure the PIC flag is empty.  It appears that all Alpha\n\t    # Linux and Compaq Tru64 Unix objects are PIC.\n\t    _LT_TAGVAR(lt_prog_compiler_pic, $1)=\n\t    _LT_TAGVAR(lt_prog_compiler_static, $1)='-non_shared'\n\t    ;;\n\t  xlc* | xlC* | bgxl[[cC]]* | mpixl[[cC]]*)\n\t    # IBM XL 8.0, 9.0 on PPC and BlueGene\n\t    _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'\n\t    _LT_TAGVAR(lt_prog_compiler_pic, $1)='-qpic'\n\t    _LT_TAGVAR(lt_prog_compiler_static, $1)='-qstaticlink'\n\t    ;;\n\t  *)\n\t    case `$CC -V 2>&1 | sed 5q` in\n\t    *Sun\\ C*)\n\t      # Sun C++ 5.9\n\t      _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC'\n\t      _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic'\n\t      _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Qoption ld '\n\t      ;;\n\t    esac\n\t    ;;\n\tesac\n\t;;\n      lynxos*)\n\t;;\n      m88k*)\n\t;;\n      mvs*)\n\tcase $cc_basename in\n\t  cxx*)\n\t    _LT_TAGVAR(lt_prog_compiler_pic, $1)='-W c,exportall'\n\t    ;;\n\t  *)\n\t    ;;\n\tesac\n\t;;\n      netbsd* | netbsdelf*-gnu)\n\t;;\n      *qnx* | *nto*)\n        # QNX uses GNU C++, but need to define -shared option too, otherwise\n        # it will coredump.\n        _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC -shared'\n        ;;\n      osf3* | osf4* | osf5*)\n\tcase $cc_basename in\n\t  KCC*)\n\t    _LT_TAGVAR(lt_prog_compiler_wl, $1)='--backend -Wl,'\n\t    ;;\n\t  RCC*)\n\t    # Rational C++ 2.4.1\n\t    _LT_TAGVAR(lt_prog_compiler_pic, $1)='-pic'\n\t    ;;\n\t  cxx*)\n\t    # Digital/Compaq C++\n\t    _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'\n\t    # Make sure the PIC flag is empty.  It appears that all Alpha\n\t    # Linux and Compaq Tru64 Unix objects are PIC.\n\t    _LT_TAGVAR(lt_prog_compiler_pic, $1)=\n\t    _LT_TAGVAR(lt_prog_compiler_static, $1)='-non_shared'\n\t    ;;\n\t  *)\n\t    ;;\n\tesac\n\t;;\n      psos*)\n\t;;\n      solaris*)\n\tcase $cc_basename in\n\t  CC* | sunCC*)\n\t    # Sun C++ 4.2, 5.x and Centerline C++\n\t    _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC'\n\t    _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic'\n\t    _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Qoption ld '\n\t    ;;\n\t  gcx*)\n\t    # Green Hills C++ Compiler\n\t    _LT_TAGVAR(lt_prog_compiler_pic, $1)='-PIC'\n\t    ;;\n\t  *)\n\t    ;;\n\tesac\n\t;;\n      sunos4*)\n\tcase $cc_basename in\n\t  CC*)\n\t    # Sun C++ 4.x\n\t    _LT_TAGVAR(lt_prog_compiler_pic, $1)='-pic'\n\t    _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic'\n\t    ;;\n\t  lcc*)\n\t    # Lucid\n\t    _LT_TAGVAR(lt_prog_compiler_pic, $1)='-pic'\n\t    ;;\n\t  *)\n\t    ;;\n\tesac\n\t;;\n      sysv5* | unixware* | sco3.2v5* | sco5v6* | OpenUNIX*)\n\tcase $cc_basename in\n\t  CC*)\n\t    _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'\n\t    _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC'\n\t    _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic'\n\t    ;;\n\tesac\n\t;;\n      tandem*)\n\tcase $cc_basename in\n\t  NCC*)\n\t    # NonStop-UX NCC 3.20\n\t    _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC'\n\t    ;;\n\t  *)\n\t    ;;\n\tesac\n\t;;\n      vxworks*)\n\t;;\n      *)\n\t_LT_TAGVAR(lt_prog_compiler_can_build_shared, $1)=no\n\t;;\n    esac\n  fi\n],\n[\n  if test yes = \"$GCC\"; then\n    _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'\n    _LT_TAGVAR(lt_prog_compiler_static, $1)='-static'\n\n    case $host_os in\n      aix*)\n      # All AIX code is PIC.\n      if test ia64 = \"$host_cpu\"; then\n\t# AIX 5 now supports IA64 processor\n\t_LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic'\n      fi\n      _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC'\n      ;;\n\n    amigaos*)\n      case $host_cpu in\n      powerpc)\n            # see comment about AmigaOS4 .so support\n            _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC'\n        ;;\n      m68k)\n            # FIXME: we need at least 68020 code to build shared libraries, but\n            # adding the '-m68020' flag to GCC prevents building anything better,\n            # like '-m68040'.\n            _LT_TAGVAR(lt_prog_compiler_pic, $1)='-m68020 -resident32 -malways-restore-a4'\n        ;;\n      esac\n      ;;\n\n    beos* | irix5* | irix6* | nonstopux* | osf3* | osf4* | osf5*)\n      # PIC is the default for these OSes.\n      ;;\n\n    mingw* | cygwin* | pw32* | os2* | cegcc*)\n      # This hack is so that the source file can tell whether it is being\n      # built for inclusion in a dll (and should export symbols for example).\n      # Although the cygwin gcc ignores -fPIC, still need this for old-style\n      # (--disable-auto-import) libraries\n      m4_if([$1], [GCJ], [],\n\t[_LT_TAGVAR(lt_prog_compiler_pic, $1)='-DDLL_EXPORT'])\n      case $host_os in\n      os2*)\n\t_LT_TAGVAR(lt_prog_compiler_static, $1)='$wl-static'\n\t;;\n      esac\n      ;;\n\n    darwin* | rhapsody*)\n      # PIC is the default on this platform\n      # Common symbols not allowed in MH_DYLIB files\n      _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fno-common'\n      ;;\n\n    haiku*)\n      # PIC is the default for Haiku.\n      # The \"-static\" flag exists, but is broken.\n      _LT_TAGVAR(lt_prog_compiler_static, $1)=\n      ;;\n\n    hpux*)\n      # PIC is the default for 64-bit PA HP-UX, but not for 32-bit\n      # PA HP-UX.  On IA64 HP-UX, PIC is the default but the pic flag\n      # sets the default TLS model and affects inlining.\n      case $host_cpu in\n      hppa*64*)\n\t# +Z the default\n\t;;\n      *)\n\t_LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC'\n\t;;\n      esac\n      ;;\n\n    interix[[3-9]]*)\n      # Interix 3.x gcc -fpic/-fPIC options generate broken code.\n      # Instead, we relocate shared libraries at runtime.\n      ;;\n\n    msdosdjgpp*)\n      # Just because we use GCC doesn't mean we suddenly get shared libraries\n      # on systems that don't support them.\n      _LT_TAGVAR(lt_prog_compiler_can_build_shared, $1)=no\n      enable_shared=no\n      ;;\n\n    *nto* | *qnx*)\n      # QNX uses GNU C++, but need to define -shared option too, otherwise\n      # it will coredump.\n      _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC -shared'\n      ;;\n\n    sysv4*MP*)\n      if test -d /usr/nec; then\n\t_LT_TAGVAR(lt_prog_compiler_pic, $1)=-Kconform_pic\n      fi\n      ;;\n\n    *)\n      _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC'\n      ;;\n    esac\n\n    case $cc_basename in\n    nvcc*) # Cuda Compiler Driver 2.2\n      _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Xlinker '\n      if test -n \"$_LT_TAGVAR(lt_prog_compiler_pic, $1)\"; then\n        _LT_TAGVAR(lt_prog_compiler_pic, $1)=\"-Xcompiler $_LT_TAGVAR(lt_prog_compiler_pic, $1)\"\n      fi\n      ;;\n    esac\n  else\n    # PORTME Check for flag to pass linker flags through the system compiler.\n    case $host_os in\n    aix*)\n      _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'\n      if test ia64 = \"$host_cpu\"; then\n\t# AIX 5 now supports IA64 processor\n\t_LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic'\n      else\n\t_LT_TAGVAR(lt_prog_compiler_static, $1)='-bnso -bI:/lib/syscalls.exp'\n      fi\n      ;;\n\n    darwin* | rhapsody*)\n      # PIC is the default on this platform\n      # Common symbols not allowed in MH_DYLIB files\n      _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fno-common'\n      case $cc_basename in\n      nagfor*)\n        # NAG Fortran compiler\n        _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,-Wl,,'\n        _LT_TAGVAR(lt_prog_compiler_pic, $1)='-PIC'\n        _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic'\n        ;;\n      esac\n      ;;\n\n    mingw* | cygwin* | pw32* | os2* | cegcc*)\n      # This hack is so that the source file can tell whether it is being\n      # built for inclusion in a dll (and should export symbols for example).\n      m4_if([$1], [GCJ], [],\n\t[_LT_TAGVAR(lt_prog_compiler_pic, $1)='-DDLL_EXPORT'])\n      case $host_os in\n      os2*)\n\t_LT_TAGVAR(lt_prog_compiler_static, $1)='$wl-static'\n\t;;\n      esac\n      ;;\n\n    hpux9* | hpux10* | hpux11*)\n      _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'\n      # PIC is the default for IA64 HP-UX and 64-bit HP-UX, but\n      # not for PA HP-UX.\n      case $host_cpu in\n      hppa*64*|ia64*)\n\t# +Z the default\n\t;;\n      *)\n\t_LT_TAGVAR(lt_prog_compiler_pic, $1)='+Z'\n\t;;\n      esac\n      # Is there a better lt_prog_compiler_static that works with the bundled CC?\n      _LT_TAGVAR(lt_prog_compiler_static, $1)='$wl-a ${wl}archive'\n      ;;\n\n    irix5* | irix6* | nonstopux*)\n      _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'\n      # PIC (with -KPIC) is the default.\n      _LT_TAGVAR(lt_prog_compiler_static, $1)='-non_shared'\n      ;;\n\n    linux* | k*bsd*-gnu | kopensolaris*-gnu | gnu*)\n      case $cc_basename in\n      # old Intel for x86_64, which still supported -KPIC.\n      ecc*)\n\t_LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'\n\t_LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC'\n\t_LT_TAGVAR(lt_prog_compiler_static, $1)='-static'\n        ;;\n      # icc used to be incompatible with GCC.\n      # ICC 10 doesn't accept -KPIC any more.\n      icc* | ifort*)\n\t_LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'\n\t_LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC'\n\t_LT_TAGVAR(lt_prog_compiler_static, $1)='-static'\n        ;;\n      # Lahey Fortran 8.1.\n      lf95*)\n\t_LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'\n\t_LT_TAGVAR(lt_prog_compiler_pic, $1)='--shared'\n\t_LT_TAGVAR(lt_prog_compiler_static, $1)='--static'\n\t;;\n      nagfor*)\n\t# NAG Fortran compiler\n\t_LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,-Wl,,'\n\t_LT_TAGVAR(lt_prog_compiler_pic, $1)='-PIC'\n\t_LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic'\n\t;;\n      tcc*)\n\t# Fabrice Bellard et al's Tiny C Compiler\n\t_LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'\n\t_LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC'\n\t_LT_TAGVAR(lt_prog_compiler_static, $1)='-static'\n\t;;\n      pgcc* | pgf77* | pgf90* | pgf95* | pgfortran*)\n        # Portland Group compilers (*not* the Pentium gcc compiler,\n\t# which looks to be a dead project)\n\t_LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'\n\t_LT_TAGVAR(lt_prog_compiler_pic, $1)='-fpic'\n\t_LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic'\n        ;;\n      ccc*)\n        _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'\n        # All Alpha code is PIC.\n        _LT_TAGVAR(lt_prog_compiler_static, $1)='-non_shared'\n        ;;\n      xl* | bgxl* | bgf* | mpixl*)\n\t# IBM XL C 8.0/Fortran 10.1, 11.1 on PPC and BlueGene\n\t_LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'\n\t_LT_TAGVAR(lt_prog_compiler_pic, $1)='-qpic'\n\t_LT_TAGVAR(lt_prog_compiler_static, $1)='-qstaticlink'\n\t;;\n      *)\n\tcase `$CC -V 2>&1 | sed 5q` in\n\t*Sun\\ Ceres\\ Fortran* | *Sun*Fortran*\\ [[1-7]].* | *Sun*Fortran*\\ 8.[[0-3]]*)\n\t  # Sun Fortran 8.3 passes all unrecognized flags to the linker\n\t  _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC'\n\t  _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic'\n\t  _LT_TAGVAR(lt_prog_compiler_wl, $1)=''\n\t  ;;\n\t*Sun\\ F* | *Sun*Fortran*)\n\t  _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC'\n\t  _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic'\n\t  _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Qoption ld '\n\t  ;;\n\t*Sun\\ C*)\n\t  # Sun C 5.9\n\t  _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC'\n\t  _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic'\n\t  _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'\n\t  ;;\n        *Intel*\\ [[CF]]*Compiler*)\n\t  _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'\n\t  _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC'\n\t  _LT_TAGVAR(lt_prog_compiler_static, $1)='-static'\n\t  ;;\n\t*Portland\\ Group*)\n\t  _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'\n\t  _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fpic'\n\t  _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic'\n\t  ;;\n\tesac\n\t;;\n      esac\n      ;;\n\n    newsos6)\n      _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC'\n      _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic'\n      ;;\n\n    *nto* | *qnx*)\n      # QNX uses GNU C++, but need to define -shared option too, otherwise\n      # it will coredump.\n      _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC -shared'\n      ;;\n\n    osf3* | osf4* | osf5*)\n      _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'\n      # All OSF/1 code is PIC.\n      _LT_TAGVAR(lt_prog_compiler_static, $1)='-non_shared'\n      ;;\n\n    rdos*)\n      _LT_TAGVAR(lt_prog_compiler_static, $1)='-non_shared'\n      ;;\n\n    solaris*)\n      _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC'\n      _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic'\n      case $cc_basename in\n      f77* | f90* | f95* | sunf77* | sunf90* | sunf95*)\n\t_LT_TAGVAR(lt_prog_compiler_wl, $1)='-Qoption ld ';;\n      *)\n\t_LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,';;\n      esac\n      ;;\n\n    sunos4*)\n      _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Qoption ld '\n      _LT_TAGVAR(lt_prog_compiler_pic, $1)='-PIC'\n      _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic'\n      ;;\n\n    sysv4 | sysv4.2uw2* | sysv4.3*)\n      _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'\n      _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC'\n      _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic'\n      ;;\n\n    sysv4*MP*)\n      if test -d /usr/nec; then\n\t_LT_TAGVAR(lt_prog_compiler_pic, $1)='-Kconform_pic'\n\t_LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic'\n      fi\n      ;;\n\n    sysv5* | unixware* | sco3.2v5* | sco5v6* | OpenUNIX*)\n      _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'\n      _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC'\n      _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic'\n      ;;\n\n    unicos*)\n      _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'\n      _LT_TAGVAR(lt_prog_compiler_can_build_shared, $1)=no\n      ;;\n\n    uts4*)\n      _LT_TAGVAR(lt_prog_compiler_pic, $1)='-pic'\n      _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic'\n      ;;\n\n    *)\n      _LT_TAGVAR(lt_prog_compiler_can_build_shared, $1)=no\n      ;;\n    esac\n  fi\n])\ncase $host_os in\n  # For platforms that do not support PIC, -DPIC is meaningless:\n  *djgpp*)\n    _LT_TAGVAR(lt_prog_compiler_pic, $1)=\n    ;;\n  *)\n    _LT_TAGVAR(lt_prog_compiler_pic, $1)=\"$_LT_TAGVAR(lt_prog_compiler_pic, $1)@&t@m4_if([$1],[],[ -DPIC],[m4_if([$1],[CXX],[ -DPIC],[])])\"\n    ;;\nesac\n\nAC_CACHE_CHECK([for $compiler option to produce PIC],\n  [_LT_TAGVAR(lt_cv_prog_compiler_pic, $1)],\n  [_LT_TAGVAR(lt_cv_prog_compiler_pic, $1)=$_LT_TAGVAR(lt_prog_compiler_pic, $1)])\n_LT_TAGVAR(lt_prog_compiler_pic, $1)=$_LT_TAGVAR(lt_cv_prog_compiler_pic, $1)\n\n#\n# Check to make sure the PIC flag actually works.\n#\nif test -n \"$_LT_TAGVAR(lt_prog_compiler_pic, $1)\"; then\n  _LT_COMPILER_OPTION([if $compiler PIC flag $_LT_TAGVAR(lt_prog_compiler_pic, $1) works],\n    [_LT_TAGVAR(lt_cv_prog_compiler_pic_works, $1)],\n    [$_LT_TAGVAR(lt_prog_compiler_pic, $1)@&t@m4_if([$1],[],[ -DPIC],[m4_if([$1],[CXX],[ -DPIC],[])])], [],\n    [case $_LT_TAGVAR(lt_prog_compiler_pic, $1) in\n     \"\" | \" \"*) ;;\n     *) _LT_TAGVAR(lt_prog_compiler_pic, $1)=\" $_LT_TAGVAR(lt_prog_compiler_pic, $1)\" ;;\n     esac],\n    [_LT_TAGVAR(lt_prog_compiler_pic, $1)=\n     _LT_TAGVAR(lt_prog_compiler_can_build_shared, $1)=no])\nfi\n_LT_TAGDECL([pic_flag], [lt_prog_compiler_pic], [1],\n\t[Additional compiler flags for building library objects])\n\n_LT_TAGDECL([wl], [lt_prog_compiler_wl], [1],\n\t[How to pass a linker flag through the compiler])\n#\n# Check to make sure the static flag actually works.\n#\nwl=$_LT_TAGVAR(lt_prog_compiler_wl, $1) eval lt_tmp_static_flag=\\\"$_LT_TAGVAR(lt_prog_compiler_static, $1)\\\"\n_LT_LINKER_OPTION([if $compiler static flag $lt_tmp_static_flag works],\n  _LT_TAGVAR(lt_cv_prog_compiler_static_works, $1),\n  $lt_tmp_static_flag,\n  [],\n  [_LT_TAGVAR(lt_prog_compiler_static, $1)=])\n_LT_TAGDECL([link_static_flag], [lt_prog_compiler_static], [1],\n\t[Compiler flag to prevent dynamic linking])\n])# _LT_COMPILER_PIC\n\n\n# _LT_LINKER_SHLIBS([TAGNAME])\n# ----------------------------\n# See if the linker supports building shared libraries.\nm4_defun([_LT_LINKER_SHLIBS],\n[AC_REQUIRE([LT_PATH_LD])dnl\nAC_REQUIRE([LT_PATH_NM])dnl\nm4_require([_LT_PATH_MANIFEST_TOOL])dnl\nm4_require([_LT_FILEUTILS_DEFAULTS])dnl\nm4_require([_LT_DECL_EGREP])dnl\nm4_require([_LT_DECL_SED])dnl\nm4_require([_LT_CMD_GLOBAL_SYMBOLS])dnl\nm4_require([_LT_TAG_COMPILER])dnl\nAC_MSG_CHECKING([whether the $compiler linker ($LD) supports shared libraries])\nm4_if([$1], [CXX], [\n  _LT_TAGVAR(export_symbols_cmds, $1)='$NM $libobjs $convenience | $global_symbol_pipe | $SED '\\''s/.* //'\\'' | sort | uniq > $export_symbols'\n  _LT_TAGVAR(exclude_expsyms, $1)=['_GLOBAL_OFFSET_TABLE_|_GLOBAL__F[ID]_.*']\n  case $host_os in\n  aix[[4-9]]*)\n    # If we're using GNU nm, then we don't want the \"-C\" option.\n    # -C means demangle to GNU nm, but means don't demangle to AIX nm.\n    # Without the \"-l\" option, or with the \"-B\" option, AIX nm treats\n    # weak defined symbols like other global defined symbols, whereas\n    # GNU nm marks them as \"W\".\n    # While the 'weak' keyword is ignored in the Export File, we need\n    # it in the Import File for the 'aix-soname' feature, so we have\n    # to replace the \"-B\" option with \"-P\" for AIX nm.\n    if $NM -V 2>&1 | $GREP 'GNU' > /dev/null; then\n      _LT_TAGVAR(export_symbols_cmds, $1)='$NM -Bpg $libobjs $convenience | awk '\\''{ if (((\\$ 2 == \"T\") || (\\$ 2 == \"D\") || (\\$ 2 == \"B\") || (\\$ 2 == \"W\")) && ([substr](\\$ 3,1,1) != \".\")) { if (\\$ 2 == \"W\") { print \\$ 3 \" weak\" } else { print \\$ 3 } } }'\\'' | sort -u > $export_symbols'\n    else\n      _LT_TAGVAR(export_symbols_cmds, $1)='`func_echo_all $NM | $SED -e '\\''s/B\\([[^B]]*\\)$/P\\1/'\\''` -PCpgl $libobjs $convenience | awk '\\''{ if (((\\$ 2 == \"T\") || (\\$ 2 == \"D\") || (\\$ 2 == \"B\") || (\\$ 2 == \"W\") || (\\$ 2 == \"V\") || (\\$ 2 == \"Z\")) && ([substr](\\$ 1,1,1) != \".\")) { if ((\\$ 2 == \"W\") || (\\$ 2 == \"V\") || (\\$ 2 == \"Z\")) { print \\$ 1 \" weak\" } else { print \\$ 1 } } }'\\'' | sort -u > $export_symbols'\n    fi\n    ;;\n  pw32*)\n    _LT_TAGVAR(export_symbols_cmds, $1)=$ltdll_cmds\n    ;;\n  cygwin* | mingw* | cegcc*)\n    case $cc_basename in\n    cl*)\n      _LT_TAGVAR(exclude_expsyms, $1)='_NULL_IMPORT_DESCRIPTOR|_IMPORT_DESCRIPTOR_.*'\n      ;;\n    *)\n      _LT_TAGVAR(export_symbols_cmds, $1)='$NM $libobjs $convenience | $global_symbol_pipe | $SED -e '\\''/^[[BCDGRS]][[ ]]/s/.*[[ ]]\\([[^ ]]*\\)/\\1 DATA/;s/^.*[[ ]]__nm__\\([[^ ]]*\\)[[ ]][[^ ]]*/\\1 DATA/;/^I[[ ]]/d;/^[[AITW]][[ ]]/s/.* //'\\'' | sort | uniq > $export_symbols'\n      _LT_TAGVAR(exclude_expsyms, $1)=['[_]+GLOBAL_OFFSET_TABLE_|[_]+GLOBAL__[FID]_.*|[_]+head_[A-Za-z0-9_]+_dll|[A-Za-z0-9_]+_dll_iname']\n      ;;\n    esac\n    ;;\n  linux* | k*bsd*-gnu | gnu*)\n    _LT_TAGVAR(link_all_deplibs, $1)=no\n    ;;\n  *)\n    _LT_TAGVAR(export_symbols_cmds, $1)='$NM $libobjs $convenience | $global_symbol_pipe | $SED '\\''s/.* //'\\'' | sort | uniq > $export_symbols'\n    ;;\n  esac\n], [\n  runpath_var=\n  _LT_TAGVAR(allow_undefined_flag, $1)=\n  _LT_TAGVAR(always_export_symbols, $1)=no\n  _LT_TAGVAR(archive_cmds, $1)=\n  _LT_TAGVAR(archive_expsym_cmds, $1)=\n  _LT_TAGVAR(compiler_needs_object, $1)=no\n  _LT_TAGVAR(enable_shared_with_static_runtimes, $1)=no\n  _LT_TAGVAR(export_dynamic_flag_spec, $1)=\n  _LT_TAGVAR(export_symbols_cmds, $1)='$NM $libobjs $convenience | $global_symbol_pipe | $SED '\\''s/.* //'\\'' | sort | uniq > $export_symbols'\n  _LT_TAGVAR(hardcode_automatic, $1)=no\n  _LT_TAGVAR(hardcode_direct, $1)=no\n  _LT_TAGVAR(hardcode_direct_absolute, $1)=no\n  _LT_TAGVAR(hardcode_libdir_flag_spec, $1)=\n  _LT_TAGVAR(hardcode_libdir_separator, $1)=\n  _LT_TAGVAR(hardcode_minus_L, $1)=no\n  _LT_TAGVAR(hardcode_shlibpath_var, $1)=unsupported\n  _LT_TAGVAR(inherit_rpath, $1)=no\n  _LT_TAGVAR(link_all_deplibs, $1)=unknown\n  _LT_TAGVAR(module_cmds, $1)=\n  _LT_TAGVAR(module_expsym_cmds, $1)=\n  _LT_TAGVAR(old_archive_from_new_cmds, $1)=\n  _LT_TAGVAR(old_archive_from_expsyms_cmds, $1)=\n  _LT_TAGVAR(thread_safe_flag_spec, $1)=\n  _LT_TAGVAR(whole_archive_flag_spec, $1)=\n  # include_expsyms should be a list of space-separated symbols to be *always*\n  # included in the symbol list\n  _LT_TAGVAR(include_expsyms, $1)=\n  # exclude_expsyms can be an extended regexp of symbols to exclude\n  # it will be wrapped by ' (' and ')$', so one must not match beginning or\n  # end of line.  Example: 'a|bc|.*d.*' will exclude the symbols 'a' and 'bc',\n  # as well as any symbol that contains 'd'.\n  _LT_TAGVAR(exclude_expsyms, $1)=['_GLOBAL_OFFSET_TABLE_|_GLOBAL__F[ID]_.*']\n  # Although _GLOBAL_OFFSET_TABLE_ is a valid symbol C name, most a.out\n  # platforms (ab)use it in PIC code, but their linkers get confused if\n  # the symbol is explicitly referenced.  Since portable code cannot\n  # rely on this symbol name, it's probably fine to never include it in\n  # preloaded symbol tables.\n  # Exclude shared library initialization/finalization symbols.\ndnl Note also adjust exclude_expsyms for C++ above.\n  extract_expsyms_cmds=\n\n  case $host_os in\n  cygwin* | mingw* | pw32* | cegcc*)\n    # FIXME: the MSVC++ port hasn't been tested in a loooong time\n    # When not using gcc, we currently assume that we are using\n    # Microsoft Visual C++.\n    if test yes != \"$GCC\"; then\n      with_gnu_ld=no\n    fi\n    ;;\n  interix*)\n    # we just hope/assume this is gcc and not c89 (= MSVC++)\n    with_gnu_ld=yes\n    ;;\n  openbsd* | bitrig*)\n    with_gnu_ld=no\n    ;;\n  linux* | k*bsd*-gnu | gnu*)\n    _LT_TAGVAR(link_all_deplibs, $1)=no\n    ;;\n  esac\n\n  _LT_TAGVAR(ld_shlibs, $1)=yes\n\n  # On some targets, GNU ld is compatible enough with the native linker\n  # that we're better off using the native interface for both.\n  lt_use_gnu_ld_interface=no\n  if test yes = \"$with_gnu_ld\"; then\n    case $host_os in\n      aix*)\n\t# The AIX port of GNU ld has always aspired to compatibility\n\t# with the native linker.  However, as the warning in the GNU ld\n\t# block says, versions before 2.19.5* couldn't really create working\n\t# shared libraries, regardless of the interface used.\n\tcase `$LD -v 2>&1` in\n\t  *\\ \\(GNU\\ Binutils\\)\\ 2.19.5*) ;;\n\t  *\\ \\(GNU\\ Binutils\\)\\ 2.[[2-9]]*) ;;\n\t  *\\ \\(GNU\\ Binutils\\)\\ [[3-9]]*) ;;\n\t  *)\n\t    lt_use_gnu_ld_interface=yes\n\t    ;;\n\tesac\n\t;;\n      *)\n\tlt_use_gnu_ld_interface=yes\n\t;;\n    esac\n  fi\n\n  if test yes = \"$lt_use_gnu_ld_interface\"; then\n    # If archive_cmds runs LD, not CC, wlarc should be empty\n    wlarc='$wl'\n\n    # Set some defaults for GNU ld with shared library support. These\n    # are reset later if shared libraries are not supported. Putting them\n    # here allows them to be overridden if necessary.\n    runpath_var=LD_RUN_PATH\n    _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='$wl-rpath $wl$libdir'\n    _LT_TAGVAR(export_dynamic_flag_spec, $1)='$wl--export-dynamic'\n    # ancient GNU ld didn't support --whole-archive et. al.\n    if $LD --help 2>&1 | $GREP 'no-whole-archive' > /dev/null; then\n      _LT_TAGVAR(whole_archive_flag_spec, $1)=$wlarc'--whole-archive$convenience '$wlarc'--no-whole-archive'\n    else\n      _LT_TAGVAR(whole_archive_flag_spec, $1)=\n    fi\n    supports_anon_versioning=no\n    case `$LD -v | $SED -e 's/([^)]\\+)\\s\\+//' 2>&1` in\n      *GNU\\ gold*) supports_anon_versioning=yes ;;\n      *\\ [[01]].* | *\\ 2.[[0-9]].* | *\\ 2.10.*) ;; # catch versions < 2.11\n      *\\ 2.11.93.0.2\\ *) supports_anon_versioning=yes ;; # RH7.3 ...\n      *\\ 2.11.92.0.12\\ *) supports_anon_versioning=yes ;; # Mandrake 8.2 ...\n      *\\ 2.11.*) ;; # other 2.11 versions\n      *) supports_anon_versioning=yes ;;\n    esac\n\n    # See if GNU ld supports shared libraries.\n    case $host_os in\n    aix[[3-9]]*)\n      # On AIX/PPC, the GNU linker is very broken\n      if test ia64 != \"$host_cpu\"; then\n\t_LT_TAGVAR(ld_shlibs, $1)=no\n\tcat <<_LT_EOF 1>&2\n\n*** Warning: the GNU linker, at least up to release 2.19, is reported\n*** to be unable to reliably create shared libraries on AIX.\n*** Therefore, libtool is disabling shared libraries support.  If you\n*** really care for shared libraries, you may want to install binutils\n*** 2.20 or above, or modify your PATH so that a non-GNU linker is found.\n*** You will then need to restart the configuration process.\n\n_LT_EOF\n      fi\n      ;;\n\n    amigaos*)\n      case $host_cpu in\n      powerpc)\n            # see comment about AmigaOS4 .so support\n            _LT_TAGVAR(archive_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags $wl-soname $wl$soname -o $lib'\n            _LT_TAGVAR(archive_expsym_cmds, $1)=''\n        ;;\n      m68k)\n            _LT_TAGVAR(archive_cmds, $1)='$RM $output_objdir/a2ixlibrary.data~$ECHO \"#define NAME $libname\" > $output_objdir/a2ixlibrary.data~$ECHO \"#define LIBRARY_ID 1\" >> $output_objdir/a2ixlibrary.data~$ECHO \"#define VERSION $major\" >> $output_objdir/a2ixlibrary.data~$ECHO \"#define REVISION $revision\" >> $output_objdir/a2ixlibrary.data~$AR $AR_FLAGS $lib $libobjs~$RANLIB $lib~(cd $output_objdir && a2ixlibrary -32)'\n            _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir'\n            _LT_TAGVAR(hardcode_minus_L, $1)=yes\n        ;;\n      esac\n      ;;\n\n    beos*)\n      if $LD --help 2>&1 | $GREP ': supported targets:.* elf' > /dev/null; then\n\t_LT_TAGVAR(allow_undefined_flag, $1)=unsupported\n\t# Joseph Beckenbach <jrb3@best.com> says some releases of gcc\n\t# support --undefined.  This deserves some investigation.  FIXME\n\t_LT_TAGVAR(archive_cmds, $1)='$CC -nostart $libobjs $deplibs $compiler_flags $wl-soname $wl$soname -o $lib'\n      else\n\t_LT_TAGVAR(ld_shlibs, $1)=no\n      fi\n      ;;\n\n    cygwin* | mingw* | pw32* | cegcc*)\n      # _LT_TAGVAR(hardcode_libdir_flag_spec, $1) is actually meaningless,\n      # as there is no search path for DLLs.\n      _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir'\n      _LT_TAGVAR(export_dynamic_flag_spec, $1)='$wl--export-all-symbols'\n      _LT_TAGVAR(allow_undefined_flag, $1)=unsupported\n      _LT_TAGVAR(always_export_symbols, $1)=no\n      _LT_TAGVAR(enable_shared_with_static_runtimes, $1)=yes\n      _LT_TAGVAR(export_symbols_cmds, $1)='$NM $libobjs $convenience | $global_symbol_pipe | $SED -e '\\''/^[[BCDGRS]][[ ]]/s/.*[[ ]]\\([[^ ]]*\\)/\\1 DATA/;s/^.*[[ ]]__nm__\\([[^ ]]*\\)[[ ]][[^ ]]*/\\1 DATA/;/^I[[ ]]/d;/^[[AITW]][[ ]]/s/.* //'\\'' | sort | uniq > $export_symbols'\n      _LT_TAGVAR(exclude_expsyms, $1)=['[_]+GLOBAL_OFFSET_TABLE_|[_]+GLOBAL__[FID]_.*|[_]+head_[A-Za-z0-9_]+_dll|[A-Za-z0-9_]+_dll_iname']\n\n      if $LD --help 2>&1 | $GREP 'auto-import' > /dev/null; then\n        _LT_TAGVAR(archive_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags -o $output_objdir/$soname $wl--enable-auto-image-base -Xlinker --out-implib -Xlinker $lib'\n\t# If the export-symbols file already is a .def file, use it as\n\t# is; otherwise, prepend EXPORTS...\n\t_LT_TAGVAR(archive_expsym_cmds, $1)='if _LT_DLL_DEF_P([$export_symbols]); then\n          cp $export_symbols $output_objdir/$soname.def;\n        else\n          echo EXPORTS > $output_objdir/$soname.def;\n          cat $export_symbols >> $output_objdir/$soname.def;\n        fi~\n        $CC -shared $output_objdir/$soname.def $libobjs $deplibs $compiler_flags -o $output_objdir/$soname $wl--enable-auto-image-base -Xlinker --out-implib -Xlinker $lib'\n      else\n\t_LT_TAGVAR(ld_shlibs, $1)=no\n      fi\n      ;;\n\n    haiku*)\n      _LT_TAGVAR(archive_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags $wl-soname $wl$soname -o $lib'\n      _LT_TAGVAR(link_all_deplibs, $1)=yes\n      ;;\n\n    os2*)\n      _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir'\n      _LT_TAGVAR(hardcode_minus_L, $1)=yes\n      _LT_TAGVAR(allow_undefined_flag, $1)=unsupported\n      shrext_cmds=.dll\n      _LT_TAGVAR(archive_cmds, $1)='$ECHO \"LIBRARY ${soname%$shared_ext} INITINSTANCE TERMINSTANCE\" > $output_objdir/$libname.def~\n\t$ECHO \"DESCRIPTION \\\"$libname\\\"\" >> $output_objdir/$libname.def~\n\t$ECHO \"DATA MULTIPLE NONSHARED\" >> $output_objdir/$libname.def~\n\t$ECHO EXPORTS >> $output_objdir/$libname.def~\n\temxexp $libobjs | $SED /\"_DLL_InitTerm\"/d >> $output_objdir/$libname.def~\n\t$CC -Zdll -Zcrtdll -o $output_objdir/$soname $libobjs $deplibs $compiler_flags $output_objdir/$libname.def~\n\temximp -o $lib $output_objdir/$libname.def'\n      _LT_TAGVAR(archive_expsym_cmds, $1)='$ECHO \"LIBRARY ${soname%$shared_ext} INITINSTANCE TERMINSTANCE\" > $output_objdir/$libname.def~\n\t$ECHO \"DESCRIPTION \\\"$libname\\\"\" >> $output_objdir/$libname.def~\n\t$ECHO \"DATA MULTIPLE NONSHARED\" >> $output_objdir/$libname.def~\n\t$ECHO EXPORTS >> $output_objdir/$libname.def~\n\tprefix_cmds=\"$SED\"~\n\tif test EXPORTS = \"`$SED 1q $export_symbols`\"; then\n\t  prefix_cmds=\"$prefix_cmds -e 1d\";\n\tfi~\n\tprefix_cmds=\"$prefix_cmds -e \\\"s/^\\(.*\\)$/_\\1/g\\\"\"~\n\tcat $export_symbols | $prefix_cmds >> $output_objdir/$libname.def~\n\t$CC -Zdll -Zcrtdll -o $output_objdir/$soname $libobjs $deplibs $compiler_flags $output_objdir/$libname.def~\n\temximp -o $lib $output_objdir/$libname.def'\n      _LT_TAGVAR(old_archive_From_new_cmds, $1)='emximp -o $output_objdir/${libname}_dll.a $output_objdir/$libname.def'\n      _LT_TAGVAR(enable_shared_with_static_runtimes, $1)=yes\n      ;;\n\n    interix[[3-9]]*)\n      _LT_TAGVAR(hardcode_direct, $1)=no\n      _LT_TAGVAR(hardcode_shlibpath_var, $1)=no\n      _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='$wl-rpath,$libdir'\n      _LT_TAGVAR(export_dynamic_flag_spec, $1)='$wl-E'\n      # Hack: On Interix 3.x, we cannot compile PIC because of a broken gcc.\n      # Instead, shared libraries are loaded at an image base (0x10000000 by\n      # default) and relocated if they conflict, which is a slow very memory\n      # consuming and fragmenting process.  To avoid this, we pick a random,\n      # 256 KiB-aligned image base between 0x50000000 and 0x6FFC0000 at link\n      # time.  Moving up from 0x10000000 also allows more sbrk(2) space.\n      _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags $wl-h,$soname $wl--image-base,`expr ${RANDOM-$$} % 4096 / 2 \\* 262144 + 1342177280` -o $lib'\n      _LT_TAGVAR(archive_expsym_cmds, $1)='sed \"s|^|_|\" $export_symbols >$output_objdir/$soname.expsym~$CC -shared $pic_flag $libobjs $deplibs $compiler_flags $wl-h,$soname $wl--retain-symbols-file,$output_objdir/$soname.expsym $wl--image-base,`expr ${RANDOM-$$} % 4096 / 2 \\* 262144 + 1342177280` -o $lib'\n      ;;\n\n    gnu* | linux* | tpf* | k*bsd*-gnu | kopensolaris*-gnu)\n      tmp_diet=no\n      if test linux-dietlibc = \"$host_os\"; then\n\tcase $cc_basename in\n\t  diet\\ *) tmp_diet=yes;;\t# linux-dietlibc with static linking (!diet-dyn)\n\tesac\n      fi\n      if $LD --help 2>&1 | $EGREP ': supported targets:.* elf' > /dev/null \\\n\t && test no = \"$tmp_diet\"\n      then\n\ttmp_addflag=' $pic_flag'\n\ttmp_sharedflag='-shared'\n\tcase $cc_basename,$host_cpu in\n        pgcc*)\t\t\t\t# Portland Group C compiler\n\t  _LT_TAGVAR(whole_archive_flag_spec, $1)='$wl--whole-archive`for conv in $convenience\\\"\\\"; do test  -n \\\"$conv\\\" && new_convenience=\\\"$new_convenience,$conv\\\"; done; func_echo_all \\\"$new_convenience\\\"` $wl--no-whole-archive'\n\t  tmp_addflag=' $pic_flag'\n\t  ;;\n\tpgf77* | pgf90* | pgf95* | pgfortran*)\n\t\t\t\t\t# Portland Group f77 and f90 compilers\n\t  _LT_TAGVAR(whole_archive_flag_spec, $1)='$wl--whole-archive`for conv in $convenience\\\"\\\"; do test  -n \\\"$conv\\\" && new_convenience=\\\"$new_convenience,$conv\\\"; done; func_echo_all \\\"$new_convenience\\\"` $wl--no-whole-archive'\n\t  tmp_addflag=' $pic_flag -Mnomain' ;;\n\tecc*,ia64* | icc*,ia64*)\t# Intel C compiler on ia64\n\t  tmp_addflag=' -i_dynamic' ;;\n\tefc*,ia64* | ifort*,ia64*)\t# Intel Fortran compiler on ia64\n\t  tmp_addflag=' -i_dynamic -nofor_main' ;;\n\tifc* | ifort*)\t\t\t# Intel Fortran compiler\n\t  tmp_addflag=' -nofor_main' ;;\n\tlf95*)\t\t\t\t# Lahey Fortran 8.1\n\t  _LT_TAGVAR(whole_archive_flag_spec, $1)=\n\t  tmp_sharedflag='--shared' ;;\n        nagfor*)                        # NAGFOR 5.3\n          tmp_sharedflag='-Wl,-shared' ;;\n\txl[[cC]]* | bgxl[[cC]]* | mpixl[[cC]]*) # IBM XL C 8.0 on PPC (deal with xlf below)\n\t  tmp_sharedflag='-qmkshrobj'\n\t  tmp_addflag= ;;\n\tnvcc*)\t# Cuda Compiler Driver 2.2\n\t  _LT_TAGVAR(whole_archive_flag_spec, $1)='$wl--whole-archive`for conv in $convenience\\\"\\\"; do test  -n \\\"$conv\\\" && new_convenience=\\\"$new_convenience,$conv\\\"; done; func_echo_all \\\"$new_convenience\\\"` $wl--no-whole-archive'\n\t  _LT_TAGVAR(compiler_needs_object, $1)=yes\n\t  ;;\n\tesac\n\tcase `$CC -V 2>&1 | sed 5q` in\n\t*Sun\\ C*)\t\t\t# Sun C 5.9\n\t  _LT_TAGVAR(whole_archive_flag_spec, $1)='$wl--whole-archive`new_convenience=; for conv in $convenience\\\"\\\"; do test -z \\\"$conv\\\" || new_convenience=\\\"$new_convenience,$conv\\\"; done; func_echo_all \\\"$new_convenience\\\"` $wl--no-whole-archive'\n\t  _LT_TAGVAR(compiler_needs_object, $1)=yes\n\t  tmp_sharedflag='-G' ;;\n\t*Sun\\ F*)\t\t\t# Sun Fortran 8.3\n\t  tmp_sharedflag='-G' ;;\n\tesac\n\t_LT_TAGVAR(archive_cmds, $1)='$CC '\"$tmp_sharedflag\"\"$tmp_addflag\"' $libobjs $deplibs $compiler_flags $wl-soname $wl$soname -o $lib'\n\n        if test yes = \"$supports_anon_versioning\"; then\n          _LT_TAGVAR(archive_expsym_cmds, $1)='echo \"{ global:\" > $output_objdir/$libname.ver~\n            cat $export_symbols | sed -e \"s/\\(.*\\)/\\1;/\" >> $output_objdir/$libname.ver~\n            echo \"local: *; };\" >> $output_objdir/$libname.ver~\n            $CC '\"$tmp_sharedflag\"\"$tmp_addflag\"' $libobjs $deplibs $compiler_flags $wl-soname $wl$soname $wl-version-script $wl$output_objdir/$libname.ver -o $lib'\n        fi\n\n\tcase $cc_basename in\n\ttcc*)\n\t  _LT_TAGVAR(export_dynamic_flag_spec, $1)='-rdynamic'\n\t  ;;\n\txlf* | bgf* | bgxlf* | mpixlf*)\n\t  # IBM XL Fortran 10.1 on PPC cannot create shared libs itself\n\t  _LT_TAGVAR(whole_archive_flag_spec, $1)='--whole-archive$convenience --no-whole-archive'\n\t  _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='$wl-rpath $wl$libdir'\n\t  _LT_TAGVAR(archive_cmds, $1)='$LD -shared $libobjs $deplibs $linker_flags -soname $soname -o $lib'\n\t  if test yes = \"$supports_anon_versioning\"; then\n\t    _LT_TAGVAR(archive_expsym_cmds, $1)='echo \"{ global:\" > $output_objdir/$libname.ver~\n              cat $export_symbols | sed -e \"s/\\(.*\\)/\\1;/\" >> $output_objdir/$libname.ver~\n              echo \"local: *; };\" >> $output_objdir/$libname.ver~\n              $LD -shared $libobjs $deplibs $linker_flags -soname $soname -version-script $output_objdir/$libname.ver -o $lib'\n\t  fi\n\t  ;;\n\tesac\n      else\n        _LT_TAGVAR(ld_shlibs, $1)=no\n      fi\n      ;;\n\n    netbsd* | netbsdelf*-gnu)\n      if echo __ELF__ | $CC -E - | $GREP __ELF__ >/dev/null; then\n\t_LT_TAGVAR(archive_cmds, $1)='$LD -Bshareable $libobjs $deplibs $linker_flags -o $lib'\n\twlarc=\n      else\n\t_LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags $wl-soname $wl$soname -o $lib'\n\t_LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags $wl-soname $wl$soname $wl-retain-symbols-file $wl$export_symbols -o $lib'\n      fi\n      ;;\n\n    solaris*)\n      if $LD -v 2>&1 | $GREP 'BFD 2\\.8' > /dev/null; then\n\t_LT_TAGVAR(ld_shlibs, $1)=no\n\tcat <<_LT_EOF 1>&2\n\n*** Warning: The releases 2.8.* of the GNU linker cannot reliably\n*** create shared libraries on Solaris systems.  Therefore, libtool\n*** is disabling shared libraries support.  We urge you to upgrade GNU\n*** binutils to release 2.9.1 or newer.  Another option is to modify\n*** your PATH or compiler configuration so that the native linker is\n*** used, and then restart.\n\n_LT_EOF\n      elif $LD --help 2>&1 | $GREP ': supported targets:.* elf' > /dev/null; then\n\t_LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags $wl-soname $wl$soname -o $lib'\n\t_LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags $wl-soname $wl$soname $wl-retain-symbols-file $wl$export_symbols -o $lib'\n      else\n\t_LT_TAGVAR(ld_shlibs, $1)=no\n      fi\n      ;;\n\n    sysv5* | sco3.2v5* | sco5v6* | unixware* | OpenUNIX*)\n      case `$LD -v 2>&1` in\n        *\\ [[01]].* | *\\ 2.[[0-9]].* | *\\ 2.1[[0-5]].*)\n\t_LT_TAGVAR(ld_shlibs, $1)=no\n\tcat <<_LT_EOF 1>&2\n\n*** Warning: Releases of the GNU linker prior to 2.16.91.0.3 cannot\n*** reliably create shared libraries on SCO systems.  Therefore, libtool\n*** is disabling shared libraries support.  We urge you to upgrade GNU\n*** binutils to release 2.16.91.0.3 or newer.  Another option is to modify\n*** your PATH or compiler configuration so that the native linker is\n*** used, and then restart.\n\n_LT_EOF\n\t;;\n\t*)\n\t  # For security reasons, it is highly recommended that you always\n\t  # use absolute paths for naming shared libraries, and exclude the\n\t  # DT_RUNPATH tag from executables and libraries.  But doing so\n\t  # requires that you compile everything twice, which is a pain.\n\t  if $LD --help 2>&1 | $GREP ': supported targets:.* elf' > /dev/null; then\n\t    _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='$wl-rpath $wl$libdir'\n\t    _LT_TAGVAR(archive_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags $wl-soname $wl$soname -o $lib'\n\t    _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags $wl-soname $wl$soname $wl-retain-symbols-file $wl$export_symbols -o $lib'\n\t  else\n\t    _LT_TAGVAR(ld_shlibs, $1)=no\n\t  fi\n\t;;\n      esac\n      ;;\n\n    sunos4*)\n      _LT_TAGVAR(archive_cmds, $1)='$LD -assert pure-text -Bshareable -o $lib $libobjs $deplibs $linker_flags'\n      wlarc=\n      _LT_TAGVAR(hardcode_direct, $1)=yes\n      _LT_TAGVAR(hardcode_shlibpath_var, $1)=no\n      ;;\n\n    *)\n      if $LD --help 2>&1 | $GREP ': supported targets:.* elf' > /dev/null; then\n\t_LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags $wl-soname $wl$soname -o $lib'\n\t_LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags $wl-soname $wl$soname $wl-retain-symbols-file $wl$export_symbols -o $lib'\n      else\n\t_LT_TAGVAR(ld_shlibs, $1)=no\n      fi\n      ;;\n    esac\n\n    if test no = \"$_LT_TAGVAR(ld_shlibs, $1)\"; then\n      runpath_var=\n      _LT_TAGVAR(hardcode_libdir_flag_spec, $1)=\n      _LT_TAGVAR(export_dynamic_flag_spec, $1)=\n      _LT_TAGVAR(whole_archive_flag_spec, $1)=\n    fi\n  else\n    # PORTME fill in a description of your system's linker (not GNU ld)\n    case $host_os in\n    aix3*)\n      _LT_TAGVAR(allow_undefined_flag, $1)=unsupported\n      _LT_TAGVAR(always_export_symbols, $1)=yes\n      _LT_TAGVAR(archive_expsym_cmds, $1)='$LD -o $output_objdir/$soname $libobjs $deplibs $linker_flags -bE:$export_symbols -T512 -H512 -bM:SRE~$AR $AR_FLAGS $lib $output_objdir/$soname'\n      # Note: this linker hardcodes the directories in LIBPATH if there\n      # are no directories specified by -L.\n      _LT_TAGVAR(hardcode_minus_L, $1)=yes\n      if test yes = \"$GCC\" && test -z \"$lt_prog_compiler_static\"; then\n\t# Neither direct hardcoding nor static linking is supported with a\n\t# broken collect2.\n\t_LT_TAGVAR(hardcode_direct, $1)=unsupported\n      fi\n      ;;\n\n    aix[[4-9]]*)\n      if test ia64 = \"$host_cpu\"; then\n\t# On IA64, the linker does run time linking by default, so we don't\n\t# have to do anything special.\n\taix_use_runtimelinking=no\n\texp_sym_flag='-Bexport'\n\tno_entry_flag=\n      else\n\t# If we're using GNU nm, then we don't want the \"-C\" option.\n\t# -C means demangle to GNU nm, but means don't demangle to AIX nm.\n\t# Without the \"-l\" option, or with the \"-B\" option, AIX nm treats\n\t# weak defined symbols like other global defined symbols, whereas\n\t# GNU nm marks them as \"W\".\n\t# While the 'weak' keyword is ignored in the Export File, we need\n\t# it in the Import File for the 'aix-soname' feature, so we have\n\t# to replace the \"-B\" option with \"-P\" for AIX nm.\n\tif $NM -V 2>&1 | $GREP 'GNU' > /dev/null; then\n\t  _LT_TAGVAR(export_symbols_cmds, $1)='$NM -Bpg $libobjs $convenience | awk '\\''{ if (((\\$ 2 == \"T\") || (\\$ 2 == \"D\") || (\\$ 2 == \"B\") || (\\$ 2 == \"W\")) && ([substr](\\$ 3,1,1) != \".\")) { if (\\$ 2 == \"W\") { print \\$ 3 \" weak\" } else { print \\$ 3 } } }'\\'' | sort -u > $export_symbols'\n\telse\n\t  _LT_TAGVAR(export_symbols_cmds, $1)='`func_echo_all $NM | $SED -e '\\''s/B\\([[^B]]*\\)$/P\\1/'\\''` -PCpgl $libobjs $convenience | awk '\\''{ if (((\\$ 2 == \"T\") || (\\$ 2 == \"D\") || (\\$ 2 == \"B\") || (\\$ 2 == \"W\") || (\\$ 2 == \"V\") || (\\$ 2 == \"Z\")) && ([substr](\\$ 1,1,1) != \".\")) { if ((\\$ 2 == \"W\") || (\\$ 2 == \"V\") || (\\$ 2 == \"Z\")) { print \\$ 1 \" weak\" } else { print \\$ 1 } } }'\\'' | sort -u > $export_symbols'\n\tfi\n\taix_use_runtimelinking=no\n\n\t# Test if we are trying to use run time linking or normal\n\t# AIX style linking. If -brtl is somewhere in LDFLAGS, we\n\t# have runtime linking enabled, and use it for executables.\n\t# For shared libraries, we enable/disable runtime linking\n\t# depending on the kind of the shared library created -\n\t# when \"with_aix_soname,aix_use_runtimelinking\" is:\n\t# \"aix,no\"   lib.a(lib.so.V) shared, rtl:no,  for executables\n\t# \"aix,yes\"  lib.so          shared, rtl:yes, for executables\n\t#            lib.a           static archive\n\t# \"both,no\"  lib.so.V(shr.o) shared, rtl:yes\n\t#            lib.a(lib.so.V) shared, rtl:no,  for executables\n\t# \"both,yes\" lib.so.V(shr.o) shared, rtl:yes, for executables\n\t#            lib.a(lib.so.V) shared, rtl:no\n\t# \"svr4,*\"   lib.so.V(shr.o) shared, rtl:yes, for executables\n\t#            lib.a           static archive\n\tcase $host_os in aix4.[[23]]|aix4.[[23]].*|aix[[5-9]]*)\n\t  for ld_flag in $LDFLAGS; do\n\t  if (test x-brtl = \"x$ld_flag\" || test x-Wl,-brtl = \"x$ld_flag\"); then\n\t    aix_use_runtimelinking=yes\n\t    break\n\t  fi\n\t  done\n\t  if test svr4,no = \"$with_aix_soname,$aix_use_runtimelinking\"; then\n\t    # With aix-soname=svr4, we create the lib.so.V shared archives only,\n\t    # so we don't have lib.a shared libs to link our executables.\n\t    # We have to force runtime linking in this case.\n\t    aix_use_runtimelinking=yes\n\t    LDFLAGS=\"$LDFLAGS -Wl,-brtl\"\n\t  fi\n\t  ;;\n\tesac\n\n\texp_sym_flag='-bexport'\n\tno_entry_flag='-bnoentry'\n      fi\n\n      # When large executables or shared objects are built, AIX ld can\n      # have problems creating the table of contents.  If linking a library\n      # or program results in \"error TOC overflow\" add -mminimal-toc to\n      # CXXFLAGS/CFLAGS for g++/gcc.  In the cases where that is not\n      # enough to fix the problem, add -Wl,-bbigtoc to LDFLAGS.\n\n      _LT_TAGVAR(archive_cmds, $1)=''\n      _LT_TAGVAR(hardcode_direct, $1)=yes\n      _LT_TAGVAR(hardcode_direct_absolute, $1)=yes\n      _LT_TAGVAR(hardcode_libdir_separator, $1)=':'\n      _LT_TAGVAR(link_all_deplibs, $1)=yes\n      _LT_TAGVAR(file_list_spec, $1)='$wl-f,'\n      case $with_aix_soname,$aix_use_runtimelinking in\n      aix,*) ;; # traditional, no import file\n      svr4,* | *,yes) # use import file\n\t# The Import File defines what to hardcode.\n\t_LT_TAGVAR(hardcode_direct, $1)=no\n\t_LT_TAGVAR(hardcode_direct_absolute, $1)=no\n\t;;\n      esac\n\n      if test yes = \"$GCC\"; then\n\tcase $host_os in aix4.[[012]]|aix4.[[012]].*)\n\t# We only want to do this on AIX 4.2 and lower, the check\n\t# below for broken collect2 doesn't work under 4.3+\n\t  collect2name=`$CC -print-prog-name=collect2`\n\t  if test -f \"$collect2name\" &&\n\t   strings \"$collect2name\" | $GREP resolve_lib_name >/dev/null\n\t  then\n\t  # We have reworked collect2\n\t  :\n\t  else\n\t  # We have old collect2\n\t  _LT_TAGVAR(hardcode_direct, $1)=unsupported\n\t  # It fails to find uninstalled libraries when the uninstalled\n\t  # path is not listed in the libpath.  Setting hardcode_minus_L\n\t  # to unsupported forces relinking\n\t  _LT_TAGVAR(hardcode_minus_L, $1)=yes\n\t  _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir'\n\t  _LT_TAGVAR(hardcode_libdir_separator, $1)=\n\t  fi\n\t  ;;\n\tesac\n\tshared_flag='-shared'\n\tif test yes = \"$aix_use_runtimelinking\"; then\n\t  shared_flag=\"$shared_flag \"'$wl-G'\n\tfi\n\t# Need to ensure runtime linking is disabled for the traditional\n\t# shared library, or the linker may eventually find shared libraries\n\t# /with/ Import File - we do not want to mix them.\n\tshared_flag_aix='-shared'\n\tshared_flag_svr4='-shared $wl-G'\n      else\n\t# not using gcc\n\tif test ia64 = \"$host_cpu\"; then\n\t# VisualAge C++, Version 5.5 for AIX 5L for IA-64, Beta 3 Release\n\t# chokes on -Wl,-G. The following line is correct:\n\t  shared_flag='-G'\n\telse\n\t  if test yes = \"$aix_use_runtimelinking\"; then\n\t    shared_flag='$wl-G'\n\t  else\n\t    shared_flag='$wl-bM:SRE'\n\t  fi\n\t  shared_flag_aix='$wl-bM:SRE'\n\t  shared_flag_svr4='$wl-G'\n\tfi\n      fi\n\n      _LT_TAGVAR(export_dynamic_flag_spec, $1)='$wl-bexpall'\n      # It seems that -bexpall does not export symbols beginning with\n      # underscore (_), so it is better to generate a list of symbols to export.\n      _LT_TAGVAR(always_export_symbols, $1)=yes\n      if test aix,yes = \"$with_aix_soname,$aix_use_runtimelinking\"; then\n\t# Warning - without using the other runtime loading flags (-brtl),\n\t# -berok will link without error, but may produce a broken library.\n\t_LT_TAGVAR(allow_undefined_flag, $1)='-berok'\n        # Determine the default libpath from the value encoded in an\n        # empty executable.\n        _LT_SYS_MODULE_PATH_AIX([$1])\n        _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='$wl-blibpath:$libdir:'\"$aix_libpath\"\n        _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -o $output_objdir/$soname $libobjs $deplibs $wl'$no_entry_flag' $compiler_flags `if test -n \"$allow_undefined_flag\"; then func_echo_all \"$wl$allow_undefined_flag\"; else :; fi` $wl'$exp_sym_flag:\\$export_symbols' '$shared_flag\n      else\n\tif test ia64 = \"$host_cpu\"; then\n\t  _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='$wl-R $libdir:/usr/lib:/lib'\n\t  _LT_TAGVAR(allow_undefined_flag, $1)=\"-z nodefs\"\n\t  _LT_TAGVAR(archive_expsym_cmds, $1)=\"\\$CC $shared_flag\"' -o $output_objdir/$soname $libobjs $deplibs '\"\\$wl$no_entry_flag\"' $compiler_flags $wl$allow_undefined_flag '\"\\$wl$exp_sym_flag:\\$export_symbols\"\n\telse\n\t # Determine the default libpath from the value encoded in an\n\t # empty executable.\n\t _LT_SYS_MODULE_PATH_AIX([$1])\n\t _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='$wl-blibpath:$libdir:'\"$aix_libpath\"\n\t  # Warning - without using the other run time loading flags,\n\t  # -berok will link without error, but may produce a broken library.\n\t  _LT_TAGVAR(no_undefined_flag, $1)=' $wl-bernotok'\n\t  _LT_TAGVAR(allow_undefined_flag, $1)=' $wl-berok'\n\t  if test yes = \"$with_gnu_ld\"; then\n\t    # We only use this code for GNU lds that support --whole-archive.\n\t    _LT_TAGVAR(whole_archive_flag_spec, $1)='$wl--whole-archive$convenience $wl--no-whole-archive'\n\t  else\n\t    # Exported symbols can be pulled into shared objects from archives\n\t    _LT_TAGVAR(whole_archive_flag_spec, $1)='$convenience'\n\t  fi\n\t  _LT_TAGVAR(archive_cmds_need_lc, $1)=yes\n\t  _LT_TAGVAR(archive_expsym_cmds, $1)='$RM -r $output_objdir/$realname.d~$MKDIR $output_objdir/$realname.d'\n\t  # -brtl affects multiple linker settings, -berok does not and is overridden later\n\t  compiler_flags_filtered='`func_echo_all \"$compiler_flags \" | $SED -e \"s%-brtl\\\\([[, ]]\\\\)%-berok\\\\1%g\"`'\n\t  if test svr4 != \"$with_aix_soname\"; then\n\t    # This is similar to how AIX traditionally builds its shared libraries.\n\t    _LT_TAGVAR(archive_expsym_cmds, $1)=\"$_LT_TAGVAR(archive_expsym_cmds, $1)\"'~$CC '$shared_flag_aix' -o $output_objdir/$realname.d/$soname $libobjs $deplibs $wl-bnoentry '$compiler_flags_filtered'$wl-bE:$export_symbols$allow_undefined_flag~$AR $AR_FLAGS $output_objdir/$libname$release.a $output_objdir/$realname.d/$soname'\n\t  fi\n\t  if test aix != \"$with_aix_soname\"; then\n\t    _LT_TAGVAR(archive_expsym_cmds, $1)=\"$_LT_TAGVAR(archive_expsym_cmds, $1)\"'~$CC '$shared_flag_svr4' -o $output_objdir/$realname.d/$shared_archive_member_spec.o $libobjs $deplibs $wl-bnoentry '$compiler_flags_filtered'$wl-bE:$export_symbols$allow_undefined_flag~$STRIP -e $output_objdir/$realname.d/$shared_archive_member_spec.o~( func_echo_all \"#! $soname($shared_archive_member_spec.o)\"; if test shr_64 = \"$shared_archive_member_spec\"; then func_echo_all \"# 64\"; else func_echo_all \"# 32\"; fi; cat $export_symbols ) > $output_objdir/$realname.d/$shared_archive_member_spec.imp~$AR $AR_FLAGS $output_objdir/$soname $output_objdir/$realname.d/$shared_archive_member_spec.o $output_objdir/$realname.d/$shared_archive_member_spec.imp'\n\t  else\n\t    # used by -dlpreopen to get the symbols\n\t    _LT_TAGVAR(archive_expsym_cmds, $1)=\"$_LT_TAGVAR(archive_expsym_cmds, $1)\"'~$MV  $output_objdir/$realname.d/$soname $output_objdir'\n\t  fi\n\t  _LT_TAGVAR(archive_expsym_cmds, $1)=\"$_LT_TAGVAR(archive_expsym_cmds, $1)\"'~$RM -r $output_objdir/$realname.d'\n\tfi\n      fi\n      ;;\n\n    amigaos*)\n      case $host_cpu in\n      powerpc)\n            # see comment about AmigaOS4 .so support\n            _LT_TAGVAR(archive_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags $wl-soname $wl$soname -o $lib'\n            _LT_TAGVAR(archive_expsym_cmds, $1)=''\n        ;;\n      m68k)\n            _LT_TAGVAR(archive_cmds, $1)='$RM $output_objdir/a2ixlibrary.data~$ECHO \"#define NAME $libname\" > $output_objdir/a2ixlibrary.data~$ECHO \"#define LIBRARY_ID 1\" >> $output_objdir/a2ixlibrary.data~$ECHO \"#define VERSION $major\" >> $output_objdir/a2ixlibrary.data~$ECHO \"#define REVISION $revision\" >> $output_objdir/a2ixlibrary.data~$AR $AR_FLAGS $lib $libobjs~$RANLIB $lib~(cd $output_objdir && a2ixlibrary -32)'\n            _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir'\n            _LT_TAGVAR(hardcode_minus_L, $1)=yes\n        ;;\n      esac\n      ;;\n\n    bsdi[[45]]*)\n      _LT_TAGVAR(export_dynamic_flag_spec, $1)=-rdynamic\n      ;;\n\n    cygwin* | mingw* | pw32* | cegcc*)\n      # When not using gcc, we currently assume that we are using\n      # Microsoft Visual C++.\n      # hardcode_libdir_flag_spec is actually meaningless, as there is\n      # no search path for DLLs.\n      case $cc_basename in\n      cl*)\n\t# Native MSVC\n\t_LT_TAGVAR(hardcode_libdir_flag_spec, $1)=' '\n\t_LT_TAGVAR(allow_undefined_flag, $1)=unsupported\n\t_LT_TAGVAR(always_export_symbols, $1)=yes\n\t_LT_TAGVAR(file_list_spec, $1)='@'\n\t# Tell ltmain to make .lib files, not .a files.\n\tlibext=lib\n\t# Tell ltmain to make .dll files, not .so files.\n\tshrext_cmds=.dll\n\t# FIXME: Setting linknames here is a bad hack.\n\t_LT_TAGVAR(archive_cmds, $1)='$CC -o $output_objdir/$soname $libobjs $compiler_flags $deplibs -Wl,-DLL,-IMPLIB:\"$tool_output_objdir$libname.dll.lib\"~linknames='\n\t_LT_TAGVAR(archive_expsym_cmds, $1)='if _LT_DLL_DEF_P([$export_symbols]); then\n            cp \"$export_symbols\" \"$output_objdir/$soname.def\";\n            echo \"$tool_output_objdir$soname.def\" > \"$output_objdir/$soname.exp\";\n          else\n            $SED -e '\\''s/^/-link -EXPORT:/'\\'' < $export_symbols > $output_objdir/$soname.exp;\n          fi~\n          $CC -o $tool_output_objdir$soname $libobjs $compiler_flags $deplibs \"@$tool_output_objdir$soname.exp\" -Wl,-DLL,-IMPLIB:\"$tool_output_objdir$libname.dll.lib\"~\n          linknames='\n\t# The linker will not automatically build a static lib if we build a DLL.\n\t# _LT_TAGVAR(old_archive_from_new_cmds, $1)='true'\n\t_LT_TAGVAR(enable_shared_with_static_runtimes, $1)=yes\n\t_LT_TAGVAR(exclude_expsyms, $1)='_NULL_IMPORT_DESCRIPTOR|_IMPORT_DESCRIPTOR_.*'\n\t_LT_TAGVAR(export_symbols_cmds, $1)='$NM $libobjs $convenience | $global_symbol_pipe | $SED -e '\\''/^[[BCDGRS]][[ ]]/s/.*[[ ]]\\([[^ ]]*\\)/\\1,DATA/'\\'' | $SED -e '\\''/^[[AITW]][[ ]]/s/.*[[ ]]//'\\'' | sort | uniq > $export_symbols'\n\t# Don't use ranlib\n\t_LT_TAGVAR(old_postinstall_cmds, $1)='chmod 644 $oldlib'\n\t_LT_TAGVAR(postlink_cmds, $1)='lt_outputfile=\"@OUTPUT@\"~\n          lt_tool_outputfile=\"@TOOL_OUTPUT@\"~\n          case $lt_outputfile in\n            *.exe|*.EXE) ;;\n            *)\n              lt_outputfile=$lt_outputfile.exe\n              lt_tool_outputfile=$lt_tool_outputfile.exe\n              ;;\n          esac~\n          if test : != \"$MANIFEST_TOOL\" && test -f \"$lt_outputfile.manifest\"; then\n            $MANIFEST_TOOL -manifest \"$lt_tool_outputfile.manifest\" -outputresource:\"$lt_tool_outputfile\" || exit 1;\n            $RM \"$lt_outputfile.manifest\";\n          fi'\n\t;;\n      *)\n\t# Assume MSVC wrapper\n\t_LT_TAGVAR(hardcode_libdir_flag_spec, $1)=' '\n\t_LT_TAGVAR(allow_undefined_flag, $1)=unsupported\n\t# Tell ltmain to make .lib files, not .a files.\n\tlibext=lib\n\t# Tell ltmain to make .dll files, not .so files.\n\tshrext_cmds=.dll\n\t# FIXME: Setting linknames here is a bad hack.\n\t_LT_TAGVAR(archive_cmds, $1)='$CC -o $lib $libobjs $compiler_flags `func_echo_all \"$deplibs\" | $SED '\\''s/ -lc$//'\\''` -link -dll~linknames='\n\t# The linker will automatically build a .lib file if we build a DLL.\n\t_LT_TAGVAR(old_archive_from_new_cmds, $1)='true'\n\t# FIXME: Should let the user specify the lib program.\n\t_LT_TAGVAR(old_archive_cmds, $1)='lib -OUT:$oldlib$oldobjs$old_deplibs'\n\t_LT_TAGVAR(enable_shared_with_static_runtimes, $1)=yes\n\t;;\n      esac\n      ;;\n\n    darwin* | rhapsody*)\n      _LT_DARWIN_LINKER_FEATURES($1)\n      ;;\n\n    dgux*)\n      _LT_TAGVAR(archive_cmds, $1)='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags'\n      _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir'\n      _LT_TAGVAR(hardcode_shlibpath_var, $1)=no\n      ;;\n\n    # FreeBSD 2.2.[012] allows us to include c++rt0.o to get C++ constructor\n    # support.  Future versions do this automatically, but an explicit c++rt0.o\n    # does not break anything, and helps significantly (at the cost of a little\n    # extra space).\n    freebsd2.2*)\n      _LT_TAGVAR(archive_cmds, $1)='$LD -Bshareable -o $lib $libobjs $deplibs $linker_flags /usr/lib/c++rt0.o'\n      _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-R$libdir'\n      _LT_TAGVAR(hardcode_direct, $1)=yes\n      _LT_TAGVAR(hardcode_shlibpath_var, $1)=no\n      ;;\n\n    # Unfortunately, older versions of FreeBSD 2 do not have this feature.\n    freebsd2.*)\n      _LT_TAGVAR(archive_cmds, $1)='$LD -Bshareable -o $lib $libobjs $deplibs $linker_flags'\n      _LT_TAGVAR(hardcode_direct, $1)=yes\n      _LT_TAGVAR(hardcode_minus_L, $1)=yes\n      _LT_TAGVAR(hardcode_shlibpath_var, $1)=no\n      ;;\n\n    # FreeBSD 3 and greater uses gcc -shared to do shared libraries.\n    freebsd* | dragonfly*)\n      _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag -o $lib $libobjs $deplibs $compiler_flags'\n      _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-R$libdir'\n      _LT_TAGVAR(hardcode_direct, $1)=yes\n      _LT_TAGVAR(hardcode_shlibpath_var, $1)=no\n      ;;\n\n    hpux9*)\n      if test yes = \"$GCC\"; then\n\t_LT_TAGVAR(archive_cmds, $1)='$RM $output_objdir/$soname~$CC -shared $pic_flag $wl+b $wl$install_libdir -o $output_objdir/$soname $libobjs $deplibs $compiler_flags~test \"x$output_objdir/$soname\" = \"x$lib\" || mv $output_objdir/$soname $lib'\n      else\n\t_LT_TAGVAR(archive_cmds, $1)='$RM $output_objdir/$soname~$LD -b +b $install_libdir -o $output_objdir/$soname $libobjs $deplibs $linker_flags~test \"x$output_objdir/$soname\" = \"x$lib\" || mv $output_objdir/$soname $lib'\n      fi\n      _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='$wl+b $wl$libdir'\n      _LT_TAGVAR(hardcode_libdir_separator, $1)=:\n      _LT_TAGVAR(hardcode_direct, $1)=yes\n\n      # hardcode_minus_L: Not really in the search PATH,\n      # but as the default location of the library.\n      _LT_TAGVAR(hardcode_minus_L, $1)=yes\n      _LT_TAGVAR(export_dynamic_flag_spec, $1)='$wl-E'\n      ;;\n\n    hpux10*)\n      if test yes,no = \"$GCC,$with_gnu_ld\"; then\n\t_LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag $wl+h $wl$soname $wl+b $wl$install_libdir -o $lib $libobjs $deplibs $compiler_flags'\n      else\n\t_LT_TAGVAR(archive_cmds, $1)='$LD -b +h $soname +b $install_libdir -o $lib $libobjs $deplibs $linker_flags'\n      fi\n      if test no = \"$with_gnu_ld\"; then\n\t_LT_TAGVAR(hardcode_libdir_flag_spec, $1)='$wl+b $wl$libdir'\n\t_LT_TAGVAR(hardcode_libdir_separator, $1)=:\n\t_LT_TAGVAR(hardcode_direct, $1)=yes\n\t_LT_TAGVAR(hardcode_direct_absolute, $1)=yes\n\t_LT_TAGVAR(export_dynamic_flag_spec, $1)='$wl-E'\n\t# hardcode_minus_L: Not really in the search PATH,\n\t# but as the default location of the library.\n\t_LT_TAGVAR(hardcode_minus_L, $1)=yes\n      fi\n      ;;\n\n    hpux11*)\n      if test yes,no = \"$GCC,$with_gnu_ld\"; then\n\tcase $host_cpu in\n\thppa*64*)\n\t  _LT_TAGVAR(archive_cmds, $1)='$CC -shared $wl+h $wl$soname -o $lib $libobjs $deplibs $compiler_flags'\n\t  ;;\n\tia64*)\n\t  _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag $wl+h $wl$soname $wl+nodefaultrpath -o $lib $libobjs $deplibs $compiler_flags'\n\t  ;;\n\t*)\n\t  _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag $wl+h $wl$soname $wl+b $wl$install_libdir -o $lib $libobjs $deplibs $compiler_flags'\n\t  ;;\n\tesac\n      else\n\tcase $host_cpu in\n\thppa*64*)\n\t  _LT_TAGVAR(archive_cmds, $1)='$CC -b $wl+h $wl$soname -o $lib $libobjs $deplibs $compiler_flags'\n\t  ;;\n\tia64*)\n\t  _LT_TAGVAR(archive_cmds, $1)='$CC -b $wl+h $wl$soname $wl+nodefaultrpath -o $lib $libobjs $deplibs $compiler_flags'\n\t  ;;\n\t*)\n\tm4_if($1, [], [\n\t  # Older versions of the 11.00 compiler do not understand -b yet\n\t  # (HP92453-01 A.11.01.20 doesn't, HP92453-01 B.11.X.35175-35176.GP does)\n\t  _LT_LINKER_OPTION([if $CC understands -b],\n\t    _LT_TAGVAR(lt_cv_prog_compiler__b, $1), [-b],\n\t    [_LT_TAGVAR(archive_cmds, $1)='$CC -b $wl+h $wl$soname $wl+b $wl$install_libdir -o $lib $libobjs $deplibs $compiler_flags'],\n\t    [_LT_TAGVAR(archive_cmds, $1)='$LD -b +h $soname +b $install_libdir -o $lib $libobjs $deplibs $linker_flags'])],\n\t  [_LT_TAGVAR(archive_cmds, $1)='$CC -b $wl+h $wl$soname $wl+b $wl$install_libdir -o $lib $libobjs $deplibs $compiler_flags'])\n\t  ;;\n\tesac\n      fi\n      if test no = \"$with_gnu_ld\"; then\n\t_LT_TAGVAR(hardcode_libdir_flag_spec, $1)='$wl+b $wl$libdir'\n\t_LT_TAGVAR(hardcode_libdir_separator, $1)=:\n\n\tcase $host_cpu in\n\thppa*64*|ia64*)\n\t  _LT_TAGVAR(hardcode_direct, $1)=no\n\t  _LT_TAGVAR(hardcode_shlibpath_var, $1)=no\n\t  ;;\n\t*)\n\t  _LT_TAGVAR(hardcode_direct, $1)=yes\n\t  _LT_TAGVAR(hardcode_direct_absolute, $1)=yes\n\t  _LT_TAGVAR(export_dynamic_flag_spec, $1)='$wl-E'\n\n\t  # hardcode_minus_L: Not really in the search PATH,\n\t  # but as the default location of the library.\n\t  _LT_TAGVAR(hardcode_minus_L, $1)=yes\n\t  ;;\n\tesac\n      fi\n      ;;\n\n    irix5* | irix6* | nonstopux*)\n      if test yes = \"$GCC\"; then\n\t_LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags $wl-soname $wl$soname `test -n \"$verstring\" && func_echo_all \"$wl-set_version $wl$verstring\"` $wl-update_registry $wl$output_objdir/so_locations -o $lib'\n\t# Try to use the -exported_symbol ld option, if it does not\n\t# work, assume that -exports_file does not work either and\n\t# implicitly export all symbols.\n\t# This should be the same for all languages, so no per-tag cache variable.\n\tAC_CACHE_CHECK([whether the $host_os linker accepts -exported_symbol],\n\t  [lt_cv_irix_exported_symbol],\n\t  [save_LDFLAGS=$LDFLAGS\n\t   LDFLAGS=\"$LDFLAGS -shared $wl-exported_symbol ${wl}foo $wl-update_registry $wl/dev/null\"\n\t   AC_LINK_IFELSE(\n\t     [AC_LANG_SOURCE(\n\t        [AC_LANG_CASE([C], [[int foo (void) { return 0; }]],\n\t\t\t      [C++], [[int foo (void) { return 0; }]],\n\t\t\t      [Fortran 77], [[\n      subroutine foo\n      end]],\n\t\t\t      [Fortran], [[\n      subroutine foo\n      end]])])],\n\t      [lt_cv_irix_exported_symbol=yes],\n\t      [lt_cv_irix_exported_symbol=no])\n           LDFLAGS=$save_LDFLAGS])\n\tif test yes = \"$lt_cv_irix_exported_symbol\"; then\n          _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags $wl-soname $wl$soname `test -n \"$verstring\" && func_echo_all \"$wl-set_version $wl$verstring\"` $wl-update_registry $wl$output_objdir/so_locations $wl-exports_file $wl$export_symbols -o $lib'\n\tfi\n\t_LT_TAGVAR(link_all_deplibs, $1)=no\n      else\n\t_LT_TAGVAR(archive_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags -soname $soname `test -n \"$verstring\" && func_echo_all \"-set_version $verstring\"` -update_registry $output_objdir/so_locations -o $lib'\n\t_LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags -soname $soname `test -n \"$verstring\" && func_echo_all \"-set_version $verstring\"` -update_registry $output_objdir/so_locations -exports_file $export_symbols -o $lib'\n      fi\n      _LT_TAGVAR(archive_cmds_need_lc, $1)='no'\n      _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='$wl-rpath $wl$libdir'\n      _LT_TAGVAR(hardcode_libdir_separator, $1)=:\n      _LT_TAGVAR(inherit_rpath, $1)=yes\n      _LT_TAGVAR(link_all_deplibs, $1)=yes\n      ;;\n\n    linux*)\n      case $cc_basename in\n      tcc*)\n\t# Fabrice Bellard et al's Tiny C Compiler\n\t_LT_TAGVAR(ld_shlibs, $1)=yes\n\t_LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag -o $lib $libobjs $deplibs $compiler_flags'\n\t;;\n      esac\n      ;;\n\n    netbsd* | netbsdelf*-gnu)\n      if echo __ELF__ | $CC -E - | $GREP __ELF__ >/dev/null; then\n\t_LT_TAGVAR(archive_cmds, $1)='$LD -Bshareable -o $lib $libobjs $deplibs $linker_flags'  # a.out\n      else\n\t_LT_TAGVAR(archive_cmds, $1)='$LD -shared -o $lib $libobjs $deplibs $linker_flags'      # ELF\n      fi\n      _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-R$libdir'\n      _LT_TAGVAR(hardcode_direct, $1)=yes\n      _LT_TAGVAR(hardcode_shlibpath_var, $1)=no\n      ;;\n\n    newsos6)\n      _LT_TAGVAR(archive_cmds, $1)='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags'\n      _LT_TAGVAR(hardcode_direct, $1)=yes\n      _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='$wl-rpath $wl$libdir'\n      _LT_TAGVAR(hardcode_libdir_separator, $1)=:\n      _LT_TAGVAR(hardcode_shlibpath_var, $1)=no\n      ;;\n\n    *nto* | *qnx*)\n      ;;\n\n    openbsd* | bitrig*)\n      if test -f /usr/libexec/ld.so; then\n\t_LT_TAGVAR(hardcode_direct, $1)=yes\n\t_LT_TAGVAR(hardcode_shlibpath_var, $1)=no\n\t_LT_TAGVAR(hardcode_direct_absolute, $1)=yes\n\tif test -z \"`echo __ELF__ | $CC -E - | $GREP __ELF__`\"; then\n\t  _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag -o $lib $libobjs $deplibs $compiler_flags'\n\t  _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $pic_flag -o $lib $libobjs $deplibs $compiler_flags $wl-retain-symbols-file,$export_symbols'\n\t  _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='$wl-rpath,$libdir'\n\t  _LT_TAGVAR(export_dynamic_flag_spec, $1)='$wl-E'\n\telse\n\t  _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag -o $lib $libobjs $deplibs $compiler_flags'\n\t  _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='$wl-rpath,$libdir'\n\tfi\n      else\n\t_LT_TAGVAR(ld_shlibs, $1)=no\n      fi\n      ;;\n\n    os2*)\n      _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir'\n      _LT_TAGVAR(hardcode_minus_L, $1)=yes\n      _LT_TAGVAR(allow_undefined_flag, $1)=unsupported\n      shrext_cmds=.dll\n      _LT_TAGVAR(archive_cmds, $1)='$ECHO \"LIBRARY ${soname%$shared_ext} INITINSTANCE TERMINSTANCE\" > $output_objdir/$libname.def~\n\t$ECHO \"DESCRIPTION \\\"$libname\\\"\" >> $output_objdir/$libname.def~\n\t$ECHO \"DATA MULTIPLE NONSHARED\" >> $output_objdir/$libname.def~\n\t$ECHO EXPORTS >> $output_objdir/$libname.def~\n\temxexp $libobjs | $SED /\"_DLL_InitTerm\"/d >> $output_objdir/$libname.def~\n\t$CC -Zdll -Zcrtdll -o $output_objdir/$soname $libobjs $deplibs $compiler_flags $output_objdir/$libname.def~\n\temximp -o $lib $output_objdir/$libname.def'\n      _LT_TAGVAR(archive_expsym_cmds, $1)='$ECHO \"LIBRARY ${soname%$shared_ext} INITINSTANCE TERMINSTANCE\" > $output_objdir/$libname.def~\n\t$ECHO \"DESCRIPTION \\\"$libname\\\"\" >> $output_objdir/$libname.def~\n\t$ECHO \"DATA MULTIPLE NONSHARED\" >> $output_objdir/$libname.def~\n\t$ECHO EXPORTS >> $output_objdir/$libname.def~\n\tprefix_cmds=\"$SED\"~\n\tif test EXPORTS = \"`$SED 1q $export_symbols`\"; then\n\t  prefix_cmds=\"$prefix_cmds -e 1d\";\n\tfi~\n\tprefix_cmds=\"$prefix_cmds -e \\\"s/^\\(.*\\)$/_\\1/g\\\"\"~\n\tcat $export_symbols | $prefix_cmds >> $output_objdir/$libname.def~\n\t$CC -Zdll -Zcrtdll -o $output_objdir/$soname $libobjs $deplibs $compiler_flags $output_objdir/$libname.def~\n\temximp -o $lib $output_objdir/$libname.def'\n      _LT_TAGVAR(old_archive_From_new_cmds, $1)='emximp -o $output_objdir/${libname}_dll.a $output_objdir/$libname.def'\n      _LT_TAGVAR(enable_shared_with_static_runtimes, $1)=yes\n      ;;\n\n    osf3*)\n      if test yes = \"$GCC\"; then\n\t_LT_TAGVAR(allow_undefined_flag, $1)=' $wl-expect_unresolved $wl\\*'\n\t_LT_TAGVAR(archive_cmds, $1)='$CC -shared$allow_undefined_flag $libobjs $deplibs $compiler_flags $wl-soname $wl$soname `test -n \"$verstring\" && func_echo_all \"$wl-set_version $wl$verstring\"` $wl-update_registry $wl$output_objdir/so_locations -o $lib'\n      else\n\t_LT_TAGVAR(allow_undefined_flag, $1)=' -expect_unresolved \\*'\n\t_LT_TAGVAR(archive_cmds, $1)='$CC -shared$allow_undefined_flag $libobjs $deplibs $compiler_flags -soname $soname `test -n \"$verstring\" && func_echo_all \"-set_version $verstring\"` -update_registry $output_objdir/so_locations -o $lib'\n      fi\n      _LT_TAGVAR(archive_cmds_need_lc, $1)='no'\n      _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='$wl-rpath $wl$libdir'\n      _LT_TAGVAR(hardcode_libdir_separator, $1)=:\n      ;;\n\n    osf4* | osf5*)\t# as osf3* with the addition of -msym flag\n      if test yes = \"$GCC\"; then\n\t_LT_TAGVAR(allow_undefined_flag, $1)=' $wl-expect_unresolved $wl\\*'\n\t_LT_TAGVAR(archive_cmds, $1)='$CC -shared$allow_undefined_flag $pic_flag $libobjs $deplibs $compiler_flags $wl-msym $wl-soname $wl$soname `test -n \"$verstring\" && func_echo_all \"$wl-set_version $wl$verstring\"` $wl-update_registry $wl$output_objdir/so_locations -o $lib'\n\t_LT_TAGVAR(hardcode_libdir_flag_spec, $1)='$wl-rpath $wl$libdir'\n      else\n\t_LT_TAGVAR(allow_undefined_flag, $1)=' -expect_unresolved \\*'\n\t_LT_TAGVAR(archive_cmds, $1)='$CC -shared$allow_undefined_flag $libobjs $deplibs $compiler_flags -msym -soname $soname `test -n \"$verstring\" && func_echo_all \"-set_version $verstring\"` -update_registry $output_objdir/so_locations -o $lib'\n\t_LT_TAGVAR(archive_expsym_cmds, $1)='for i in `cat $export_symbols`; do printf \"%s %s\\\\n\" -exported_symbol \"\\$i\" >> $lib.exp; done; printf \"%s\\\\n\" \"-hidden\">> $lib.exp~\n          $CC -shared$allow_undefined_flag $wl-input $wl$lib.exp $compiler_flags $libobjs $deplibs -soname $soname `test -n \"$verstring\" && $ECHO \"-set_version $verstring\"` -update_registry $output_objdir/so_locations -o $lib~$RM $lib.exp'\n\n\t# Both c and cxx compiler support -rpath directly\n\t_LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-rpath $libdir'\n      fi\n      _LT_TAGVAR(archive_cmds_need_lc, $1)='no'\n      _LT_TAGVAR(hardcode_libdir_separator, $1)=:\n      ;;\n\n    solaris*)\n      _LT_TAGVAR(no_undefined_flag, $1)=' -z defs'\n      if test yes = \"$GCC\"; then\n\twlarc='$wl'\n\t_LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag $wl-z ${wl}text $wl-h $wl$soname -o $lib $libobjs $deplibs $compiler_flags'\n\t_LT_TAGVAR(archive_expsym_cmds, $1)='echo \"{ global:\" > $lib.exp~cat $export_symbols | $SED -e \"s/\\(.*\\)/\\1;/\" >> $lib.exp~echo \"local: *; };\" >> $lib.exp~\n          $CC -shared $pic_flag $wl-z ${wl}text $wl-M $wl$lib.exp $wl-h $wl$soname -o $lib $libobjs $deplibs $compiler_flags~$RM $lib.exp'\n      else\n\tcase `$CC -V 2>&1` in\n\t*\"Compilers 5.0\"*)\n\t  wlarc=''\n\t  _LT_TAGVAR(archive_cmds, $1)='$LD -G$allow_undefined_flag -h $soname -o $lib $libobjs $deplibs $linker_flags'\n\t  _LT_TAGVAR(archive_expsym_cmds, $1)='echo \"{ global:\" > $lib.exp~cat $export_symbols | $SED -e \"s/\\(.*\\)/\\1;/\" >> $lib.exp~echo \"local: *; };\" >> $lib.exp~\n            $LD -G$allow_undefined_flag -M $lib.exp -h $soname -o $lib $libobjs $deplibs $linker_flags~$RM $lib.exp'\n\t  ;;\n\t*)\n\t  wlarc='$wl'\n\t  _LT_TAGVAR(archive_cmds, $1)='$CC -G$allow_undefined_flag -h $soname -o $lib $libobjs $deplibs $compiler_flags'\n\t  _LT_TAGVAR(archive_expsym_cmds, $1)='echo \"{ global:\" > $lib.exp~cat $export_symbols | $SED -e \"s/\\(.*\\)/\\1;/\" >> $lib.exp~echo \"local: *; };\" >> $lib.exp~\n            $CC -G$allow_undefined_flag -M $lib.exp -h $soname -o $lib $libobjs $deplibs $compiler_flags~$RM $lib.exp'\n\t  ;;\n\tesac\n      fi\n      _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-R$libdir'\n      _LT_TAGVAR(hardcode_shlibpath_var, $1)=no\n      case $host_os in\n      solaris2.[[0-5]] | solaris2.[[0-5]].*) ;;\n      *)\n\t# The compiler driver will combine and reorder linker options,\n\t# but understands '-z linker_flag'.  GCC discards it without '$wl',\n\t# but is careful enough not to reorder.\n\t# Supported since Solaris 2.6 (maybe 2.5.1?)\n\tif test yes = \"$GCC\"; then\n\t  _LT_TAGVAR(whole_archive_flag_spec, $1)='$wl-z ${wl}allextract$convenience $wl-z ${wl}defaultextract'\n\telse\n\t  _LT_TAGVAR(whole_archive_flag_spec, $1)='-z allextract$convenience -z defaultextract'\n\tfi\n\t;;\n      esac\n      _LT_TAGVAR(link_all_deplibs, $1)=yes\n      ;;\n\n    sunos4*)\n      if test sequent = \"$host_vendor\"; then\n\t# Use $CC to link under sequent, because it throws in some extra .o\n\t# files that make .init and .fini sections work.\n\t_LT_TAGVAR(archive_cmds, $1)='$CC -G $wl-h $soname -o $lib $libobjs $deplibs $compiler_flags'\n      else\n\t_LT_TAGVAR(archive_cmds, $1)='$LD -assert pure-text -Bstatic -o $lib $libobjs $deplibs $linker_flags'\n      fi\n      _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir'\n      _LT_TAGVAR(hardcode_direct, $1)=yes\n      _LT_TAGVAR(hardcode_minus_L, $1)=yes\n      _LT_TAGVAR(hardcode_shlibpath_var, $1)=no\n      ;;\n\n    sysv4)\n      case $host_vendor in\n\tsni)\n\t  _LT_TAGVAR(archive_cmds, $1)='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags'\n\t  _LT_TAGVAR(hardcode_direct, $1)=yes # is this really true???\n\t;;\n\tsiemens)\n\t  ## LD is ld it makes a PLAMLIB\n\t  ## CC just makes a GrossModule.\n\t  _LT_TAGVAR(archive_cmds, $1)='$LD -G -o $lib $libobjs $deplibs $linker_flags'\n\t  _LT_TAGVAR(reload_cmds, $1)='$CC -r -o $output$reload_objs'\n\t  _LT_TAGVAR(hardcode_direct, $1)=no\n        ;;\n\tmotorola)\n\t  _LT_TAGVAR(archive_cmds, $1)='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags'\n\t  _LT_TAGVAR(hardcode_direct, $1)=no #Motorola manual says yes, but my tests say they lie\n\t;;\n      esac\n      runpath_var='LD_RUN_PATH'\n      _LT_TAGVAR(hardcode_shlibpath_var, $1)=no\n      ;;\n\n    sysv4.3*)\n      _LT_TAGVAR(archive_cmds, $1)='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags'\n      _LT_TAGVAR(hardcode_shlibpath_var, $1)=no\n      _LT_TAGVAR(export_dynamic_flag_spec, $1)='-Bexport'\n      ;;\n\n    sysv4*MP*)\n      if test -d /usr/nec; then\n\t_LT_TAGVAR(archive_cmds, $1)='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags'\n\t_LT_TAGVAR(hardcode_shlibpath_var, $1)=no\n\trunpath_var=LD_RUN_PATH\n\thardcode_runpath_var=yes\n\t_LT_TAGVAR(ld_shlibs, $1)=yes\n      fi\n      ;;\n\n    sysv4*uw2* | sysv5OpenUNIX* | sysv5UnixWare7.[[01]].[[10]]* | unixware7* | sco3.2v5.0.[[024]]*)\n      _LT_TAGVAR(no_undefined_flag, $1)='$wl-z,text'\n      _LT_TAGVAR(archive_cmds_need_lc, $1)=no\n      _LT_TAGVAR(hardcode_shlibpath_var, $1)=no\n      runpath_var='LD_RUN_PATH'\n\n      if test yes = \"$GCC\"; then\n\t_LT_TAGVAR(archive_cmds, $1)='$CC -shared $wl-h,$soname -o $lib $libobjs $deplibs $compiler_flags'\n\t_LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $wl-Bexport:$export_symbols $wl-h,$soname -o $lib $libobjs $deplibs $compiler_flags'\n      else\n\t_LT_TAGVAR(archive_cmds, $1)='$CC -G $wl-h,$soname -o $lib $libobjs $deplibs $compiler_flags'\n\t_LT_TAGVAR(archive_expsym_cmds, $1)='$CC -G $wl-Bexport:$export_symbols $wl-h,$soname -o $lib $libobjs $deplibs $compiler_flags'\n      fi\n      ;;\n\n    sysv5* | sco3.2v5* | sco5v6*)\n      # Note: We CANNOT use -z defs as we might desire, because we do not\n      # link with -lc, and that would cause any symbols used from libc to\n      # always be unresolved, which means just about no library would\n      # ever link correctly.  If we're not using GNU ld we use -z text\n      # though, which does catch some bad symbols but isn't as heavy-handed\n      # as -z defs.\n      _LT_TAGVAR(no_undefined_flag, $1)='$wl-z,text'\n      _LT_TAGVAR(allow_undefined_flag, $1)='$wl-z,nodefs'\n      _LT_TAGVAR(archive_cmds_need_lc, $1)=no\n      _LT_TAGVAR(hardcode_shlibpath_var, $1)=no\n      _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='$wl-R,$libdir'\n      _LT_TAGVAR(hardcode_libdir_separator, $1)=':'\n      _LT_TAGVAR(link_all_deplibs, $1)=yes\n      _LT_TAGVAR(export_dynamic_flag_spec, $1)='$wl-Bexport'\n      runpath_var='LD_RUN_PATH'\n\n      if test yes = \"$GCC\"; then\n\t_LT_TAGVAR(archive_cmds, $1)='$CC -shared $wl-h,$soname -o $lib $libobjs $deplibs $compiler_flags'\n\t_LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $wl-Bexport:$export_symbols $wl-h,$soname -o $lib $libobjs $deplibs $compiler_flags'\n      else\n\t_LT_TAGVAR(archive_cmds, $1)='$CC -G $wl-h,$soname -o $lib $libobjs $deplibs $compiler_flags'\n\t_LT_TAGVAR(archive_expsym_cmds, $1)='$CC -G $wl-Bexport:$export_symbols $wl-h,$soname -o $lib $libobjs $deplibs $compiler_flags'\n      fi\n      ;;\n\n    uts4*)\n      _LT_TAGVAR(archive_cmds, $1)='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags'\n      _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir'\n      _LT_TAGVAR(hardcode_shlibpath_var, $1)=no\n      ;;\n\n    *)\n      _LT_TAGVAR(ld_shlibs, $1)=no\n      ;;\n    esac\n\n    if test sni = \"$host_vendor\"; then\n      case $host in\n      sysv4 | sysv4.2uw2* | sysv4.3* | sysv5*)\n\t_LT_TAGVAR(export_dynamic_flag_spec, $1)='$wl-Blargedynsym'\n\t;;\n      esac\n    fi\n  fi\n])\nAC_MSG_RESULT([$_LT_TAGVAR(ld_shlibs, $1)])\ntest no = \"$_LT_TAGVAR(ld_shlibs, $1)\" && can_build_shared=no\n\n_LT_TAGVAR(with_gnu_ld, $1)=$with_gnu_ld\n\n_LT_DECL([], [libext], [0], [Old archive suffix (normally \"a\")])dnl\n_LT_DECL([], [shrext_cmds], [1], [Shared library suffix (normally \".so\")])dnl\n_LT_DECL([], [extract_expsyms_cmds], [2],\n    [The commands to extract the exported symbol list from a shared archive])\n\n#\n# Do we need to explicitly link libc?\n#\ncase \"x$_LT_TAGVAR(archive_cmds_need_lc, $1)\" in\nx|xyes)\n  # Assume -lc should be added\n  _LT_TAGVAR(archive_cmds_need_lc, $1)=yes\n\n  if test yes,yes = \"$GCC,$enable_shared\"; then\n    case $_LT_TAGVAR(archive_cmds, $1) in\n    *'~'*)\n      # FIXME: we may have to deal with multi-command sequences.\n      ;;\n    '$CC '*)\n      # Test whether the compiler implicitly links with -lc since on some\n      # systems, -lgcc has to come before -lc. If gcc already passes -lc\n      # to ld, don't add -lc before -lgcc.\n      AC_CACHE_CHECK([whether -lc should be explicitly linked in],\n\t[lt_cv_]_LT_TAGVAR(archive_cmds_need_lc, $1),\n\t[$RM conftest*\n\techo \"$lt_simple_compile_test_code\" > conftest.$ac_ext\n\n\tif AC_TRY_EVAL(ac_compile) 2>conftest.err; then\n\t  soname=conftest\n\t  lib=conftest\n\t  libobjs=conftest.$ac_objext\n\t  deplibs=\n\t  wl=$_LT_TAGVAR(lt_prog_compiler_wl, $1)\n\t  pic_flag=$_LT_TAGVAR(lt_prog_compiler_pic, $1)\n\t  compiler_flags=-v\n\t  linker_flags=-v\n\t  verstring=\n\t  output_objdir=.\n\t  libname=conftest\n\t  lt_save_allow_undefined_flag=$_LT_TAGVAR(allow_undefined_flag, $1)\n\t  _LT_TAGVAR(allow_undefined_flag, $1)=\n\t  if AC_TRY_EVAL(_LT_TAGVAR(archive_cmds, $1) 2\\>\\&1 \\| $GREP \\\" -lc \\\" \\>/dev/null 2\\>\\&1)\n\t  then\n\t    lt_cv_[]_LT_TAGVAR(archive_cmds_need_lc, $1)=no\n\t  else\n\t    lt_cv_[]_LT_TAGVAR(archive_cmds_need_lc, $1)=yes\n\t  fi\n\t  _LT_TAGVAR(allow_undefined_flag, $1)=$lt_save_allow_undefined_flag\n\telse\n\t  cat conftest.err 1>&5\n\tfi\n\t$RM conftest*\n\t])\n      _LT_TAGVAR(archive_cmds_need_lc, $1)=$lt_cv_[]_LT_TAGVAR(archive_cmds_need_lc, $1)\n      ;;\n    esac\n  fi\n  ;;\nesac\n\n_LT_TAGDECL([build_libtool_need_lc], [archive_cmds_need_lc], [0],\n    [Whether or not to add -lc for building shared libraries])\n_LT_TAGDECL([allow_libtool_libs_with_static_runtimes],\n    [enable_shared_with_static_runtimes], [0],\n    [Whether or not to disallow shared libs when runtime libs are static])\n_LT_TAGDECL([], [export_dynamic_flag_spec], [1],\n    [Compiler flag to allow reflexive dlopens])\n_LT_TAGDECL([], [whole_archive_flag_spec], [1],\n    [Compiler flag to generate shared objects directly from archives])\n_LT_TAGDECL([], [compiler_needs_object], [1],\n    [Whether the compiler copes with passing no objects directly])\n_LT_TAGDECL([], [old_archive_from_new_cmds], [2],\n    [Create an old-style archive from a shared archive])\n_LT_TAGDECL([], [old_archive_from_expsyms_cmds], [2],\n    [Create a temporary old-style archive to link instead of a shared archive])\n_LT_TAGDECL([], [archive_cmds], [2], [Commands used to build a shared archive])\n_LT_TAGDECL([], [archive_expsym_cmds], [2])\n_LT_TAGDECL([], [module_cmds], [2],\n    [Commands used to build a loadable module if different from building\n    a shared archive.])\n_LT_TAGDECL([], [module_expsym_cmds], [2])\n_LT_TAGDECL([], [with_gnu_ld], [1],\n    [Whether we are building with GNU ld or not])\n_LT_TAGDECL([], [allow_undefined_flag], [1],\n    [Flag that allows shared libraries with undefined symbols to be built])\n_LT_TAGDECL([], [no_undefined_flag], [1],\n    [Flag that enforces no undefined symbols])\n_LT_TAGDECL([], [hardcode_libdir_flag_spec], [1],\n    [Flag to hardcode $libdir into a binary during linking.\n    This must work even if $libdir does not exist])\n_LT_TAGDECL([], [hardcode_libdir_separator], [1],\n    [Whether we need a single \"-rpath\" flag with a separated argument])\n_LT_TAGDECL([], [hardcode_direct], [0],\n    [Set to \"yes\" if using DIR/libNAME$shared_ext during linking hardcodes\n    DIR into the resulting binary])\n_LT_TAGDECL([], [hardcode_direct_absolute], [0],\n    [Set to \"yes\" if using DIR/libNAME$shared_ext during linking hardcodes\n    DIR into the resulting binary and the resulting library dependency is\n    \"absolute\", i.e impossible to change by setting $shlibpath_var if the\n    library is relocated])\n_LT_TAGDECL([], [hardcode_minus_L], [0],\n    [Set to \"yes\" if using the -LDIR flag during linking hardcodes DIR\n    into the resulting binary])\n_LT_TAGDECL([], [hardcode_shlibpath_var], [0],\n    [Set to \"yes\" if using SHLIBPATH_VAR=DIR during linking hardcodes DIR\n    into the resulting binary])\n_LT_TAGDECL([], [hardcode_automatic], [0],\n    [Set to \"yes\" if building a shared library automatically hardcodes DIR\n    into the library and all subsequent libraries and executables linked\n    against it])\n_LT_TAGDECL([], [inherit_rpath], [0],\n    [Set to yes if linker adds runtime paths of dependent libraries\n    to runtime path list])\n_LT_TAGDECL([], [link_all_deplibs], [0],\n    [Whether libtool must link a program against all its dependency libraries])\n_LT_TAGDECL([], [always_export_symbols], [0],\n    [Set to \"yes\" if exported symbols are required])\n_LT_TAGDECL([], [export_symbols_cmds], [2],\n    [The commands to list exported symbols])\n_LT_TAGDECL([], [exclude_expsyms], [1],\n    [Symbols that should not be listed in the preloaded symbols])\n_LT_TAGDECL([], [include_expsyms], [1],\n    [Symbols that must always be exported])\n_LT_TAGDECL([], [prelink_cmds], [2],\n    [Commands necessary for linking programs (against libraries) with templates])\n_LT_TAGDECL([], [postlink_cmds], [2],\n    [Commands necessary for finishing linking programs])\n_LT_TAGDECL([], [file_list_spec], [1],\n    [Specify filename containing input files])\ndnl FIXME: Not yet implemented\ndnl _LT_TAGDECL([], [thread_safe_flag_spec], [1],\ndnl    [Compiler flag to generate thread safe objects])\n])# _LT_LINKER_SHLIBS\n\n\n# _LT_LANG_C_CONFIG([TAG])\n# ------------------------\n# Ensure that the configuration variables for a C compiler are suitably\n# defined.  These variables are subsequently used by _LT_CONFIG to write\n# the compiler configuration to 'libtool'.\nm4_defun([_LT_LANG_C_CONFIG],\n[m4_require([_LT_DECL_EGREP])dnl\nlt_save_CC=$CC\nAC_LANG_PUSH(C)\n\n# Source file extension for C test sources.\nac_ext=c\n\n# Object file extension for compiled C test sources.\nobjext=o\n_LT_TAGVAR(objext, $1)=$objext\n\n# Code to be used in simple compile tests\nlt_simple_compile_test_code=\"int some_variable = 0;\"\n\n# Code to be used in simple link tests\nlt_simple_link_test_code='int main(){return(0);}'\n\n_LT_TAG_COMPILER\n# Save the default compiler, since it gets overwritten when the other\n# tags are being tested, and _LT_TAGVAR(compiler, []) is a NOP.\ncompiler_DEFAULT=$CC\n\n# save warnings/boilerplate of simple test code\n_LT_COMPILER_BOILERPLATE\n_LT_LINKER_BOILERPLATE\n\n## CAVEAT EMPTOR:\n## There is no encapsulation within the following macros, do not change\n## the running order or otherwise move them around unless you know exactly\n## what you are doing...\nif test -n \"$compiler\"; then\n  _LT_COMPILER_NO_RTTI($1)\n  _LT_COMPILER_PIC($1)\n  _LT_COMPILER_C_O($1)\n  _LT_COMPILER_FILE_LOCKS($1)\n  _LT_LINKER_SHLIBS($1)\n  _LT_SYS_DYNAMIC_LINKER($1)\n  _LT_LINKER_HARDCODE_LIBPATH($1)\n  LT_SYS_DLOPEN_SELF\n  _LT_CMD_STRIPLIB\n\n  # Report what library types will actually be built\n  AC_MSG_CHECKING([if libtool supports shared libraries])\n  AC_MSG_RESULT([$can_build_shared])\n\n  AC_MSG_CHECKING([whether to build shared libraries])\n  test no = \"$can_build_shared\" && enable_shared=no\n\n  # On AIX, shared libraries and static libraries use the same namespace, and\n  # are all built from PIC.\n  case $host_os in\n  aix3*)\n    test yes = \"$enable_shared\" && enable_static=no\n    if test -n \"$RANLIB\"; then\n      archive_cmds=\"$archive_cmds~\\$RANLIB \\$lib\"\n      postinstall_cmds='$RANLIB $lib'\n    fi\n    ;;\n\n  aix[[4-9]]*)\n    if test ia64 != \"$host_cpu\"; then\n      case $enable_shared,$with_aix_soname,$aix_use_runtimelinking in\n      yes,aix,yes) ;;\t\t\t# shared object as lib.so file only\n      yes,svr4,*) ;;\t\t\t# shared object as lib.so archive member only\n      yes,*) enable_static=no ;;\t# shared object in lib.a archive as well\n      esac\n    fi\n    ;;\n  esac\n  AC_MSG_RESULT([$enable_shared])\n\n  AC_MSG_CHECKING([whether to build static libraries])\n  # Make sure either enable_shared or enable_static is yes.\n  test yes = \"$enable_shared\" || enable_static=yes\n  AC_MSG_RESULT([$enable_static])\n\n  _LT_CONFIG($1)\nfi\nAC_LANG_POP\nCC=$lt_save_CC\n])# _LT_LANG_C_CONFIG\n\n\n# _LT_LANG_CXX_CONFIG([TAG])\n# --------------------------\n# Ensure that the configuration variables for a C++ compiler are suitably\n# defined.  These variables are subsequently used by _LT_CONFIG to write\n# the compiler configuration to 'libtool'.\nm4_defun([_LT_LANG_CXX_CONFIG],\n[m4_require([_LT_FILEUTILS_DEFAULTS])dnl\nm4_require([_LT_DECL_EGREP])dnl\nm4_require([_LT_PATH_MANIFEST_TOOL])dnl\nif test -n \"$CXX\" && ( test no != \"$CXX\" &&\n    ( (test g++ = \"$CXX\" && `g++ -v >/dev/null 2>&1` ) ||\n    (test g++ != \"$CXX\"))); then\n  AC_PROG_CXXCPP\nelse\n  _lt_caught_CXX_error=yes\nfi\n\nAC_LANG_PUSH(C++)\n_LT_TAGVAR(archive_cmds_need_lc, $1)=no\n_LT_TAGVAR(allow_undefined_flag, $1)=\n_LT_TAGVAR(always_export_symbols, $1)=no\n_LT_TAGVAR(archive_expsym_cmds, $1)=\n_LT_TAGVAR(compiler_needs_object, $1)=no\n_LT_TAGVAR(export_dynamic_flag_spec, $1)=\n_LT_TAGVAR(hardcode_direct, $1)=no\n_LT_TAGVAR(hardcode_direct_absolute, $1)=no\n_LT_TAGVAR(hardcode_libdir_flag_spec, $1)=\n_LT_TAGVAR(hardcode_libdir_separator, $1)=\n_LT_TAGVAR(hardcode_minus_L, $1)=no\n_LT_TAGVAR(hardcode_shlibpath_var, $1)=unsupported\n_LT_TAGVAR(hardcode_automatic, $1)=no\n_LT_TAGVAR(inherit_rpath, $1)=no\n_LT_TAGVAR(module_cmds, $1)=\n_LT_TAGVAR(module_expsym_cmds, $1)=\n_LT_TAGVAR(link_all_deplibs, $1)=unknown\n_LT_TAGVAR(old_archive_cmds, $1)=$old_archive_cmds\n_LT_TAGVAR(reload_flag, $1)=$reload_flag\n_LT_TAGVAR(reload_cmds, $1)=$reload_cmds\n_LT_TAGVAR(no_undefined_flag, $1)=\n_LT_TAGVAR(whole_archive_flag_spec, $1)=\n_LT_TAGVAR(enable_shared_with_static_runtimes, $1)=no\n\n# Source file extension for C++ test sources.\nac_ext=cpp\n\n# Object file extension for compiled C++ test sources.\nobjext=o\n_LT_TAGVAR(objext, $1)=$objext\n\n# No sense in running all these tests if we already determined that\n# the CXX compiler isn't working.  Some variables (like enable_shared)\n# are currently assumed to apply to all compilers on this platform,\n# and will be corrupted by setting them based on a non-working compiler.\nif test yes != \"$_lt_caught_CXX_error\"; then\n  # Code to be used in simple compile tests\n  lt_simple_compile_test_code=\"int some_variable = 0;\"\n\n  # Code to be used in simple link tests\n  lt_simple_link_test_code='int main(int, char *[[]]) { return(0); }'\n\n  # ltmain only uses $CC for tagged configurations so make sure $CC is set.\n  _LT_TAG_COMPILER\n\n  # save warnings/boilerplate of simple test code\n  _LT_COMPILER_BOILERPLATE\n  _LT_LINKER_BOILERPLATE\n\n  # Allow CC to be a program name with arguments.\n  lt_save_CC=$CC\n  lt_save_CFLAGS=$CFLAGS\n  lt_save_LD=$LD\n  lt_save_GCC=$GCC\n  GCC=$GXX\n  lt_save_with_gnu_ld=$with_gnu_ld\n  lt_save_path_LD=$lt_cv_path_LD\n  if test -n \"${lt_cv_prog_gnu_ldcxx+set}\"; then\n    lt_cv_prog_gnu_ld=$lt_cv_prog_gnu_ldcxx\n  else\n    $as_unset lt_cv_prog_gnu_ld\n  fi\n  if test -n \"${lt_cv_path_LDCXX+set}\"; then\n    lt_cv_path_LD=$lt_cv_path_LDCXX\n  else\n    $as_unset lt_cv_path_LD\n  fi\n  test -z \"${LDCXX+set}\" || LD=$LDCXX\n  CC=${CXX-\"c++\"}\n  CFLAGS=$CXXFLAGS\n  compiler=$CC\n  _LT_TAGVAR(compiler, $1)=$CC\n  _LT_CC_BASENAME([$compiler])\n\n  if test -n \"$compiler\"; then\n    # We don't want -fno-exception when compiling C++ code, so set the\n    # no_builtin_flag separately\n    if test yes = \"$GXX\"; then\n      _LT_TAGVAR(lt_prog_compiler_no_builtin_flag, $1)=' -fno-builtin'\n    else\n      _LT_TAGVAR(lt_prog_compiler_no_builtin_flag, $1)=\n    fi\n\n    if test yes = \"$GXX\"; then\n      # Set up default GNU C++ configuration\n\n      LT_PATH_LD\n\n      # Check if GNU C++ uses GNU ld as the underlying linker, since the\n      # archiving commands below assume that GNU ld is being used.\n      if test yes = \"$with_gnu_ld\"; then\n        _LT_TAGVAR(archive_cmds, $1)='$CC $pic_flag -shared -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags $wl-soname $wl$soname -o $lib'\n        _LT_TAGVAR(archive_expsym_cmds, $1)='$CC $pic_flag -shared -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags $wl-soname $wl$soname $wl-retain-symbols-file $wl$export_symbols -o $lib'\n\n        _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='$wl-rpath $wl$libdir'\n        _LT_TAGVAR(export_dynamic_flag_spec, $1)='$wl--export-dynamic'\n\n        # If archive_cmds runs LD, not CC, wlarc should be empty\n        # XXX I think wlarc can be eliminated in ltcf-cxx, but I need to\n        #     investigate it a little bit more. (MM)\n        wlarc='$wl'\n\n        # ancient GNU ld didn't support --whole-archive et. al.\n        if eval \"`$CC -print-prog-name=ld` --help 2>&1\" |\n\t  $GREP 'no-whole-archive' > /dev/null; then\n          _LT_TAGVAR(whole_archive_flag_spec, $1)=$wlarc'--whole-archive$convenience '$wlarc'--no-whole-archive'\n        else\n          _LT_TAGVAR(whole_archive_flag_spec, $1)=\n        fi\n      else\n        with_gnu_ld=no\n        wlarc=\n\n        # A generic and very simple default shared library creation\n        # command for GNU C++ for the case where it uses the native\n        # linker, instead of GNU ld.  If possible, this setting should\n        # overridden to take advantage of the native linker features on\n        # the platform it is being used on.\n        _LT_TAGVAR(archive_cmds, $1)='$CC -shared -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -o $lib'\n      fi\n\n      # Commands to make compiler produce verbose output that lists\n      # what \"hidden\" libraries, object files and flags are used when\n      # linking a shared library.\n      output_verbose_link_cmd='$CC -shared $CFLAGS -v conftest.$objext 2>&1 | $GREP -v \"^Configured with:\" | $GREP \"\\-L\"'\n\n    else\n      GXX=no\n      with_gnu_ld=no\n      wlarc=\n    fi\n\n    # PORTME: fill in a description of your system's C++ link characteristics\n    AC_MSG_CHECKING([whether the $compiler linker ($LD) supports shared libraries])\n    _LT_TAGVAR(ld_shlibs, $1)=yes\n    case $host_os in\n      aix3*)\n        # FIXME: insert proper C++ library support\n        _LT_TAGVAR(ld_shlibs, $1)=no\n        ;;\n      aix[[4-9]]*)\n        if test ia64 = \"$host_cpu\"; then\n          # On IA64, the linker does run time linking by default, so we don't\n          # have to do anything special.\n          aix_use_runtimelinking=no\n          exp_sym_flag='-Bexport'\n          no_entry_flag=\n        else\n          aix_use_runtimelinking=no\n\n          # Test if we are trying to use run time linking or normal\n          # AIX style linking. If -brtl is somewhere in LDFLAGS, we\n          # have runtime linking enabled, and use it for executables.\n          # For shared libraries, we enable/disable runtime linking\n          # depending on the kind of the shared library created -\n          # when \"with_aix_soname,aix_use_runtimelinking\" is:\n          # \"aix,no\"   lib.a(lib.so.V) shared, rtl:no,  for executables\n          # \"aix,yes\"  lib.so          shared, rtl:yes, for executables\n          #            lib.a           static archive\n          # \"both,no\"  lib.so.V(shr.o) shared, rtl:yes\n          #            lib.a(lib.so.V) shared, rtl:no,  for executables\n          # \"both,yes\" lib.so.V(shr.o) shared, rtl:yes, for executables\n          #            lib.a(lib.so.V) shared, rtl:no\n          # \"svr4,*\"   lib.so.V(shr.o) shared, rtl:yes, for executables\n          #            lib.a           static archive\n          case $host_os in aix4.[[23]]|aix4.[[23]].*|aix[[5-9]]*)\n\t    for ld_flag in $LDFLAGS; do\n\t      case $ld_flag in\n\t      *-brtl*)\n\t        aix_use_runtimelinking=yes\n\t        break\n\t        ;;\n\t      esac\n\t    done\n\t    if test svr4,no = \"$with_aix_soname,$aix_use_runtimelinking\"; then\n\t      # With aix-soname=svr4, we create the lib.so.V shared archives only,\n\t      # so we don't have lib.a shared libs to link our executables.\n\t      # We have to force runtime linking in this case.\n\t      aix_use_runtimelinking=yes\n\t      LDFLAGS=\"$LDFLAGS -Wl,-brtl\"\n\t    fi\n\t    ;;\n          esac\n\n          exp_sym_flag='-bexport'\n          no_entry_flag='-bnoentry'\n        fi\n\n        # When large executables or shared objects are built, AIX ld can\n        # have problems creating the table of contents.  If linking a library\n        # or program results in \"error TOC overflow\" add -mminimal-toc to\n        # CXXFLAGS/CFLAGS for g++/gcc.  In the cases where that is not\n        # enough to fix the problem, add -Wl,-bbigtoc to LDFLAGS.\n\n        _LT_TAGVAR(archive_cmds, $1)=''\n        _LT_TAGVAR(hardcode_direct, $1)=yes\n        _LT_TAGVAR(hardcode_direct_absolute, $1)=yes\n        _LT_TAGVAR(hardcode_libdir_separator, $1)=':'\n        _LT_TAGVAR(link_all_deplibs, $1)=yes\n        _LT_TAGVAR(file_list_spec, $1)='$wl-f,'\n        case $with_aix_soname,$aix_use_runtimelinking in\n        aix,*) ;;\t# no import file\n        svr4,* | *,yes) # use import file\n          # The Import File defines what to hardcode.\n          _LT_TAGVAR(hardcode_direct, $1)=no\n          _LT_TAGVAR(hardcode_direct_absolute, $1)=no\n          ;;\n        esac\n\n        if test yes = \"$GXX\"; then\n          case $host_os in aix4.[[012]]|aix4.[[012]].*)\n          # We only want to do this on AIX 4.2 and lower, the check\n          # below for broken collect2 doesn't work under 4.3+\n\t  collect2name=`$CC -print-prog-name=collect2`\n\t  if test -f \"$collect2name\" &&\n\t     strings \"$collect2name\" | $GREP resolve_lib_name >/dev/null\n\t  then\n\t    # We have reworked collect2\n\t    :\n\t  else\n\t    # We have old collect2\n\t    _LT_TAGVAR(hardcode_direct, $1)=unsupported\n\t    # It fails to find uninstalled libraries when the uninstalled\n\t    # path is not listed in the libpath.  Setting hardcode_minus_L\n\t    # to unsupported forces relinking\n\t    _LT_TAGVAR(hardcode_minus_L, $1)=yes\n\t    _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir'\n\t    _LT_TAGVAR(hardcode_libdir_separator, $1)=\n\t  fi\n          esac\n          shared_flag='-shared'\n\t  if test yes = \"$aix_use_runtimelinking\"; then\n\t    shared_flag=$shared_flag' $wl-G'\n\t  fi\n\t  # Need to ensure runtime linking is disabled for the traditional\n\t  # shared library, or the linker may eventually find shared libraries\n\t  # /with/ Import File - we do not want to mix them.\n\t  shared_flag_aix='-shared'\n\t  shared_flag_svr4='-shared $wl-G'\n        else\n          # not using gcc\n          if test ia64 = \"$host_cpu\"; then\n\t  # VisualAge C++, Version 5.5 for AIX 5L for IA-64, Beta 3 Release\n\t  # chokes on -Wl,-G. The following line is correct:\n\t  shared_flag='-G'\n          else\n\t    if test yes = \"$aix_use_runtimelinking\"; then\n\t      shared_flag='$wl-G'\n\t    else\n\t      shared_flag='$wl-bM:SRE'\n\t    fi\n\t    shared_flag_aix='$wl-bM:SRE'\n\t    shared_flag_svr4='$wl-G'\n          fi\n        fi\n\n        _LT_TAGVAR(export_dynamic_flag_spec, $1)='$wl-bexpall'\n        # It seems that -bexpall does not export symbols beginning with\n        # underscore (_), so it is better to generate a list of symbols to\n\t# export.\n        _LT_TAGVAR(always_export_symbols, $1)=yes\n\tif test aix,yes = \"$with_aix_soname,$aix_use_runtimelinking\"; then\n          # Warning - without using the other runtime loading flags (-brtl),\n          # -berok will link without error, but may produce a broken library.\n          # The \"-G\" linker flag allows undefined symbols.\n          _LT_TAGVAR(no_undefined_flag, $1)='-bernotok'\n          # Determine the default libpath from the value encoded in an empty\n          # executable.\n          _LT_SYS_MODULE_PATH_AIX([$1])\n          _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='$wl-blibpath:$libdir:'\"$aix_libpath\"\n\n          _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -o $output_objdir/$soname $libobjs $deplibs $wl'$no_entry_flag' $compiler_flags `if test -n \"$allow_undefined_flag\"; then func_echo_all \"$wl$allow_undefined_flag\"; else :; fi` $wl'$exp_sym_flag:\\$export_symbols' '$shared_flag\n        else\n          if test ia64 = \"$host_cpu\"; then\n\t    _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='$wl-R $libdir:/usr/lib:/lib'\n\t    _LT_TAGVAR(allow_undefined_flag, $1)=\"-z nodefs\"\n\t    _LT_TAGVAR(archive_expsym_cmds, $1)=\"\\$CC $shared_flag\"' -o $output_objdir/$soname $libobjs $deplibs '\"\\$wl$no_entry_flag\"' $compiler_flags $wl$allow_undefined_flag '\"\\$wl$exp_sym_flag:\\$export_symbols\"\n          else\n\t    # Determine the default libpath from the value encoded in an\n\t    # empty executable.\n\t    _LT_SYS_MODULE_PATH_AIX([$1])\n\t    _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='$wl-blibpath:$libdir:'\"$aix_libpath\"\n\t    # Warning - without using the other run time loading flags,\n\t    # -berok will link without error, but may produce a broken library.\n\t    _LT_TAGVAR(no_undefined_flag, $1)=' $wl-bernotok'\n\t    _LT_TAGVAR(allow_undefined_flag, $1)=' $wl-berok'\n\t    if test yes = \"$with_gnu_ld\"; then\n\t      # We only use this code for GNU lds that support --whole-archive.\n\t      _LT_TAGVAR(whole_archive_flag_spec, $1)='$wl--whole-archive$convenience $wl--no-whole-archive'\n\t    else\n\t      # Exported symbols can be pulled into shared objects from archives\n\t      _LT_TAGVAR(whole_archive_flag_spec, $1)='$convenience'\n\t    fi\n\t    _LT_TAGVAR(archive_cmds_need_lc, $1)=yes\n\t    _LT_TAGVAR(archive_expsym_cmds, $1)='$RM -r $output_objdir/$realname.d~$MKDIR $output_objdir/$realname.d'\n\t    # -brtl affects multiple linker settings, -berok does not and is overridden later\n\t    compiler_flags_filtered='`func_echo_all \"$compiler_flags \" | $SED -e \"s%-brtl\\\\([[, ]]\\\\)%-berok\\\\1%g\"`'\n\t    if test svr4 != \"$with_aix_soname\"; then\n\t      # This is similar to how AIX traditionally builds its shared\n\t      # libraries. Need -bnortl late, we may have -brtl in LDFLAGS.\n\t      _LT_TAGVAR(archive_expsym_cmds, $1)=\"$_LT_TAGVAR(archive_expsym_cmds, $1)\"'~$CC '$shared_flag_aix' -o $output_objdir/$realname.d/$soname $libobjs $deplibs $wl-bnoentry '$compiler_flags_filtered'$wl-bE:$export_symbols$allow_undefined_flag~$AR $AR_FLAGS $output_objdir/$libname$release.a $output_objdir/$realname.d/$soname'\n\t    fi\n\t    if test aix != \"$with_aix_soname\"; then\n\t      _LT_TAGVAR(archive_expsym_cmds, $1)=\"$_LT_TAGVAR(archive_expsym_cmds, $1)\"'~$CC '$shared_flag_svr4' -o $output_objdir/$realname.d/$shared_archive_member_spec.o $libobjs $deplibs $wl-bnoentry '$compiler_flags_filtered'$wl-bE:$export_symbols$allow_undefined_flag~$STRIP -e $output_objdir/$realname.d/$shared_archive_member_spec.o~( func_echo_all \"#! $soname($shared_archive_member_spec.o)\"; if test shr_64 = \"$shared_archive_member_spec\"; then func_echo_all \"# 64\"; else func_echo_all \"# 32\"; fi; cat $export_symbols ) > $output_objdir/$realname.d/$shared_archive_member_spec.imp~$AR $AR_FLAGS $output_objdir/$soname $output_objdir/$realname.d/$shared_archive_member_spec.o $output_objdir/$realname.d/$shared_archive_member_spec.imp'\n\t    else\n\t      # used by -dlpreopen to get the symbols\n\t      _LT_TAGVAR(archive_expsym_cmds, $1)=\"$_LT_TAGVAR(archive_expsym_cmds, $1)\"'~$MV  $output_objdir/$realname.d/$soname $output_objdir'\n\t    fi\n\t    _LT_TAGVAR(archive_expsym_cmds, $1)=\"$_LT_TAGVAR(archive_expsym_cmds, $1)\"'~$RM -r $output_objdir/$realname.d'\n          fi\n        fi\n        ;;\n\n      beos*)\n\tif $LD --help 2>&1 | $GREP ': supported targets:.* elf' > /dev/null; then\n\t  _LT_TAGVAR(allow_undefined_flag, $1)=unsupported\n\t  # Joseph Beckenbach <jrb3@best.com> says some releases of gcc\n\t  # support --undefined.  This deserves some investigation.  FIXME\n\t  _LT_TAGVAR(archive_cmds, $1)='$CC -nostart $libobjs $deplibs $compiler_flags $wl-soname $wl$soname -o $lib'\n\telse\n\t  _LT_TAGVAR(ld_shlibs, $1)=no\n\tfi\n\t;;\n\n      chorus*)\n        case $cc_basename in\n          *)\n\t  # FIXME: insert proper C++ library support\n\t  _LT_TAGVAR(ld_shlibs, $1)=no\n\t  ;;\n        esac\n        ;;\n\n      cygwin* | mingw* | pw32* | cegcc*)\n\tcase $GXX,$cc_basename in\n\t,cl* | no,cl*)\n\t  # Native MSVC\n\t  # hardcode_libdir_flag_spec is actually meaningless, as there is\n\t  # no search path for DLLs.\n\t  _LT_TAGVAR(hardcode_libdir_flag_spec, $1)=' '\n\t  _LT_TAGVAR(allow_undefined_flag, $1)=unsupported\n\t  _LT_TAGVAR(always_export_symbols, $1)=yes\n\t  _LT_TAGVAR(file_list_spec, $1)='@'\n\t  # Tell ltmain to make .lib files, not .a files.\n\t  libext=lib\n\t  # Tell ltmain to make .dll files, not .so files.\n\t  shrext_cmds=.dll\n\t  # FIXME: Setting linknames here is a bad hack.\n\t  _LT_TAGVAR(archive_cmds, $1)='$CC -o $output_objdir/$soname $libobjs $compiler_flags $deplibs -Wl,-DLL,-IMPLIB:\"$tool_output_objdir$libname.dll.lib\"~linknames='\n\t  _LT_TAGVAR(archive_expsym_cmds, $1)='if _LT_DLL_DEF_P([$export_symbols]); then\n              cp \"$export_symbols\" \"$output_objdir/$soname.def\";\n              echo \"$tool_output_objdir$soname.def\" > \"$output_objdir/$soname.exp\";\n            else\n              $SED -e '\\''s/^/-link -EXPORT:/'\\'' < $export_symbols > $output_objdir/$soname.exp;\n            fi~\n            $CC -o $tool_output_objdir$soname $libobjs $compiler_flags $deplibs \"@$tool_output_objdir$soname.exp\" -Wl,-DLL,-IMPLIB:\"$tool_output_objdir$libname.dll.lib\"~\n            linknames='\n\t  # The linker will not automatically build a static lib if we build a DLL.\n\t  # _LT_TAGVAR(old_archive_from_new_cmds, $1)='true'\n\t  _LT_TAGVAR(enable_shared_with_static_runtimes, $1)=yes\n\t  # Don't use ranlib\n\t  _LT_TAGVAR(old_postinstall_cmds, $1)='chmod 644 $oldlib'\n\t  _LT_TAGVAR(postlink_cmds, $1)='lt_outputfile=\"@OUTPUT@\"~\n            lt_tool_outputfile=\"@TOOL_OUTPUT@\"~\n            case $lt_outputfile in\n              *.exe|*.EXE) ;;\n              *)\n                lt_outputfile=$lt_outputfile.exe\n                lt_tool_outputfile=$lt_tool_outputfile.exe\n                ;;\n            esac~\n            func_to_tool_file \"$lt_outputfile\"~\n            if test : != \"$MANIFEST_TOOL\" && test -f \"$lt_outputfile.manifest\"; then\n              $MANIFEST_TOOL -manifest \"$lt_tool_outputfile.manifest\" -outputresource:\"$lt_tool_outputfile\" || exit 1;\n              $RM \"$lt_outputfile.manifest\";\n            fi'\n\t  ;;\n\t*)\n\t  # g++\n\t  # _LT_TAGVAR(hardcode_libdir_flag_spec, $1) is actually meaningless,\n\t  # as there is no search path for DLLs.\n\t  _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir'\n\t  _LT_TAGVAR(export_dynamic_flag_spec, $1)='$wl--export-all-symbols'\n\t  _LT_TAGVAR(allow_undefined_flag, $1)=unsupported\n\t  _LT_TAGVAR(always_export_symbols, $1)=no\n\t  _LT_TAGVAR(enable_shared_with_static_runtimes, $1)=yes\n\n\t  if $LD --help 2>&1 | $GREP 'auto-import' > /dev/null; then\n\t    _LT_TAGVAR(archive_cmds, $1)='$CC -shared -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -o $output_objdir/$soname $wl--enable-auto-image-base -Xlinker --out-implib -Xlinker $lib'\n\t    # If the export-symbols file already is a .def file, use it as\n\t    # is; otherwise, prepend EXPORTS...\n\t    _LT_TAGVAR(archive_expsym_cmds, $1)='if _LT_DLL_DEF_P([$export_symbols]); then\n              cp $export_symbols $output_objdir/$soname.def;\n            else\n              echo EXPORTS > $output_objdir/$soname.def;\n              cat $export_symbols >> $output_objdir/$soname.def;\n            fi~\n            $CC -shared -nostdlib $output_objdir/$soname.def $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -o $output_objdir/$soname $wl--enable-auto-image-base -Xlinker --out-implib -Xlinker $lib'\n\t  else\n\t    _LT_TAGVAR(ld_shlibs, $1)=no\n\t  fi\n\t  ;;\n\tesac\n\t;;\n      darwin* | rhapsody*)\n        _LT_DARWIN_LINKER_FEATURES($1)\n\t;;\n\n      os2*)\n\t_LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir'\n\t_LT_TAGVAR(hardcode_minus_L, $1)=yes\n\t_LT_TAGVAR(allow_undefined_flag, $1)=unsupported\n\tshrext_cmds=.dll\n\t_LT_TAGVAR(archive_cmds, $1)='$ECHO \"LIBRARY ${soname%$shared_ext} INITINSTANCE TERMINSTANCE\" > $output_objdir/$libname.def~\n\t  $ECHO \"DESCRIPTION \\\"$libname\\\"\" >> $output_objdir/$libname.def~\n\t  $ECHO \"DATA MULTIPLE NONSHARED\" >> $output_objdir/$libname.def~\n\t  $ECHO EXPORTS >> $output_objdir/$libname.def~\n\t  emxexp $libobjs | $SED /\"_DLL_InitTerm\"/d >> $output_objdir/$libname.def~\n\t  $CC -Zdll -Zcrtdll -o $output_objdir/$soname $libobjs $deplibs $compiler_flags $output_objdir/$libname.def~\n\t  emximp -o $lib $output_objdir/$libname.def'\n\t_LT_TAGVAR(archive_expsym_cmds, $1)='$ECHO \"LIBRARY ${soname%$shared_ext} INITINSTANCE TERMINSTANCE\" > $output_objdir/$libname.def~\n\t  $ECHO \"DESCRIPTION \\\"$libname\\\"\" >> $output_objdir/$libname.def~\n\t  $ECHO \"DATA MULTIPLE NONSHARED\" >> $output_objdir/$libname.def~\n\t  $ECHO EXPORTS >> $output_objdir/$libname.def~\n\t  prefix_cmds=\"$SED\"~\n\t  if test EXPORTS = \"`$SED 1q $export_symbols`\"; then\n\t    prefix_cmds=\"$prefix_cmds -e 1d\";\n\t  fi~\n\t  prefix_cmds=\"$prefix_cmds -e \\\"s/^\\(.*\\)$/_\\1/g\\\"\"~\n\t  cat $export_symbols | $prefix_cmds >> $output_objdir/$libname.def~\n\t  $CC -Zdll -Zcrtdll -o $output_objdir/$soname $libobjs $deplibs $compiler_flags $output_objdir/$libname.def~\n\t  emximp -o $lib $output_objdir/$libname.def'\n\t_LT_TAGVAR(old_archive_From_new_cmds, $1)='emximp -o $output_objdir/${libname}_dll.a $output_objdir/$libname.def'\n\t_LT_TAGVAR(enable_shared_with_static_runtimes, $1)=yes\n\t;;\n\n      dgux*)\n        case $cc_basename in\n          ec++*)\n\t    # FIXME: insert proper C++ library support\n\t    _LT_TAGVAR(ld_shlibs, $1)=no\n\t    ;;\n          ghcx*)\n\t    # Green Hills C++ Compiler\n\t    # FIXME: insert proper C++ library support\n\t    _LT_TAGVAR(ld_shlibs, $1)=no\n\t    ;;\n          *)\n\t    # FIXME: insert proper C++ library support\n\t    _LT_TAGVAR(ld_shlibs, $1)=no\n\t    ;;\n        esac\n        ;;\n\n      freebsd2.*)\n        # C++ shared libraries reported to be fairly broken before\n\t# switch to ELF\n        _LT_TAGVAR(ld_shlibs, $1)=no\n        ;;\n\n      freebsd-elf*)\n        _LT_TAGVAR(archive_cmds_need_lc, $1)=no\n        ;;\n\n      freebsd* | dragonfly*)\n        # FreeBSD 3 and later use GNU C++ and GNU ld with standard ELF\n        # conventions\n        _LT_TAGVAR(ld_shlibs, $1)=yes\n        ;;\n\n      haiku*)\n        _LT_TAGVAR(archive_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags $wl-soname $wl$soname -o $lib'\n        _LT_TAGVAR(link_all_deplibs, $1)=yes\n        ;;\n\n      hpux9*)\n        _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='$wl+b $wl$libdir'\n        _LT_TAGVAR(hardcode_libdir_separator, $1)=:\n        _LT_TAGVAR(export_dynamic_flag_spec, $1)='$wl-E'\n        _LT_TAGVAR(hardcode_direct, $1)=yes\n        _LT_TAGVAR(hardcode_minus_L, $1)=yes # Not in the search PATH,\n\t\t\t\t             # but as the default\n\t\t\t\t             # location of the library.\n\n        case $cc_basename in\n          CC*)\n            # FIXME: insert proper C++ library support\n            _LT_TAGVAR(ld_shlibs, $1)=no\n            ;;\n          aCC*)\n            _LT_TAGVAR(archive_cmds, $1)='$RM $output_objdir/$soname~$CC -b $wl+b $wl$install_libdir -o $output_objdir/$soname $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags~test \"x$output_objdir/$soname\" = \"x$lib\" || mv $output_objdir/$soname $lib'\n            # Commands to make compiler produce verbose output that lists\n            # what \"hidden\" libraries, object files and flags are used when\n            # linking a shared library.\n            #\n            # There doesn't appear to be a way to prevent this compiler from\n            # explicitly linking system object files so we need to strip them\n            # from the output so that they don't get included in the library\n            # dependencies.\n            output_verbose_link_cmd='templist=`($CC -b $CFLAGS -v conftest.$objext 2>&1) | $EGREP \"\\-L\"`; list= ; for z in $templist; do case $z in conftest.$objext) list=\"$list $z\";; *.$objext);; *) list=\"$list $z\";;esac; done; func_echo_all \"$list\"'\n            ;;\n          *)\n            if test yes = \"$GXX\"; then\n              _LT_TAGVAR(archive_cmds, $1)='$RM $output_objdir/$soname~$CC -shared -nostdlib $pic_flag $wl+b $wl$install_libdir -o $output_objdir/$soname $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags~test \"x$output_objdir/$soname\" = \"x$lib\" || mv $output_objdir/$soname $lib'\n            else\n              # FIXME: insert proper C++ library support\n              _LT_TAGVAR(ld_shlibs, $1)=no\n            fi\n            ;;\n        esac\n        ;;\n\n      hpux10*|hpux11*)\n        if test no = \"$with_gnu_ld\"; then\n\t  _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='$wl+b $wl$libdir'\n\t  _LT_TAGVAR(hardcode_libdir_separator, $1)=:\n\n          case $host_cpu in\n            hppa*64*|ia64*)\n              ;;\n            *)\n\t      _LT_TAGVAR(export_dynamic_flag_spec, $1)='$wl-E'\n              ;;\n          esac\n        fi\n        case $host_cpu in\n          hppa*64*|ia64*)\n            _LT_TAGVAR(hardcode_direct, $1)=no\n            _LT_TAGVAR(hardcode_shlibpath_var, $1)=no\n            ;;\n          *)\n            _LT_TAGVAR(hardcode_direct, $1)=yes\n            _LT_TAGVAR(hardcode_direct_absolute, $1)=yes\n            _LT_TAGVAR(hardcode_minus_L, $1)=yes # Not in the search PATH,\n\t\t\t\t\t         # but as the default\n\t\t\t\t\t         # location of the library.\n            ;;\n        esac\n\n        case $cc_basename in\n          CC*)\n\t    # FIXME: insert proper C++ library support\n\t    _LT_TAGVAR(ld_shlibs, $1)=no\n\t    ;;\n          aCC*)\n\t    case $host_cpu in\n\t      hppa*64*)\n\t        _LT_TAGVAR(archive_cmds, $1)='$CC -b $wl+h $wl$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags'\n\t        ;;\n\t      ia64*)\n\t        _LT_TAGVAR(archive_cmds, $1)='$CC -b $wl+h $wl$soname $wl+nodefaultrpath -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags'\n\t        ;;\n\t      *)\n\t        _LT_TAGVAR(archive_cmds, $1)='$CC -b $wl+h $wl$soname $wl+b $wl$install_libdir -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags'\n\t        ;;\n\t    esac\n\t    # Commands to make compiler produce verbose output that lists\n\t    # what \"hidden\" libraries, object files and flags are used when\n\t    # linking a shared library.\n\t    #\n\t    # There doesn't appear to be a way to prevent this compiler from\n\t    # explicitly linking system object files so we need to strip them\n\t    # from the output so that they don't get included in the library\n\t    # dependencies.\n\t    output_verbose_link_cmd='templist=`($CC -b $CFLAGS -v conftest.$objext 2>&1) | $GREP \"\\-L\"`; list= ; for z in $templist; do case $z in conftest.$objext) list=\"$list $z\";; *.$objext);; *) list=\"$list $z\";;esac; done; func_echo_all \"$list\"'\n\t    ;;\n          *)\n\t    if test yes = \"$GXX\"; then\n\t      if test no = \"$with_gnu_ld\"; then\n\t        case $host_cpu in\n\t          hppa*64*)\n\t            _LT_TAGVAR(archive_cmds, $1)='$CC -shared -nostdlib -fPIC $wl+h $wl$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags'\n\t            ;;\n\t          ia64*)\n\t            _LT_TAGVAR(archive_cmds, $1)='$CC -shared -nostdlib $pic_flag $wl+h $wl$soname $wl+nodefaultrpath -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags'\n\t            ;;\n\t          *)\n\t            _LT_TAGVAR(archive_cmds, $1)='$CC -shared -nostdlib $pic_flag $wl+h $wl$soname $wl+b $wl$install_libdir -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags'\n\t            ;;\n\t        esac\n\t      fi\n\t    else\n\t      # FIXME: insert proper C++ library support\n\t      _LT_TAGVAR(ld_shlibs, $1)=no\n\t    fi\n\t    ;;\n        esac\n        ;;\n\n      interix[[3-9]]*)\n\t_LT_TAGVAR(hardcode_direct, $1)=no\n\t_LT_TAGVAR(hardcode_shlibpath_var, $1)=no\n\t_LT_TAGVAR(hardcode_libdir_flag_spec, $1)='$wl-rpath,$libdir'\n\t_LT_TAGVAR(export_dynamic_flag_spec, $1)='$wl-E'\n\t# Hack: On Interix 3.x, we cannot compile PIC because of a broken gcc.\n\t# Instead, shared libraries are loaded at an image base (0x10000000 by\n\t# default) and relocated if they conflict, which is a slow very memory\n\t# consuming and fragmenting process.  To avoid this, we pick a random,\n\t# 256 KiB-aligned image base between 0x50000000 and 0x6FFC0000 at link\n\t# time.  Moving up from 0x10000000 also allows more sbrk(2) space.\n\t_LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags $wl-h,$soname $wl--image-base,`expr ${RANDOM-$$} % 4096 / 2 \\* 262144 + 1342177280` -o $lib'\n\t_LT_TAGVAR(archive_expsym_cmds, $1)='sed \"s|^|_|\" $export_symbols >$output_objdir/$soname.expsym~$CC -shared $pic_flag $libobjs $deplibs $compiler_flags $wl-h,$soname $wl--retain-symbols-file,$output_objdir/$soname.expsym $wl--image-base,`expr ${RANDOM-$$} % 4096 / 2 \\* 262144 + 1342177280` -o $lib'\n\t;;\n      irix5* | irix6*)\n        case $cc_basename in\n          CC*)\n\t    # SGI C++\n\t    _LT_TAGVAR(archive_cmds, $1)='$CC -shared -all -multigot $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -soname $soname `test -n \"$verstring\" && func_echo_all \"-set_version $verstring\"` -update_registry $output_objdir/so_locations -o $lib'\n\n\t    # Archives containing C++ object files must be created using\n\t    # \"CC -ar\", where \"CC\" is the IRIX C++ compiler.  This is\n\t    # necessary to make sure instantiated templates are included\n\t    # in the archive.\n\t    _LT_TAGVAR(old_archive_cmds, $1)='$CC -ar -WR,-u -o $oldlib $oldobjs'\n\t    ;;\n          *)\n\t    if test yes = \"$GXX\"; then\n\t      if test no = \"$with_gnu_ld\"; then\n\t        _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags $wl-soname $wl$soname `test -n \"$verstring\" && func_echo_all \"$wl-set_version $wl$verstring\"` $wl-update_registry $wl$output_objdir/so_locations -o $lib'\n\t      else\n\t        _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags $wl-soname $wl$soname `test -n \"$verstring\" && func_echo_all \"$wl-set_version $wl$verstring\"` -o $lib'\n\t      fi\n\t    fi\n\t    _LT_TAGVAR(link_all_deplibs, $1)=yes\n\t    ;;\n        esac\n        _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='$wl-rpath $wl$libdir'\n        _LT_TAGVAR(hardcode_libdir_separator, $1)=:\n        _LT_TAGVAR(inherit_rpath, $1)=yes\n        ;;\n\n      linux* | k*bsd*-gnu | kopensolaris*-gnu | gnu*)\n        case $cc_basename in\n          KCC*)\n\t    # Kuck and Associates, Inc. (KAI) C++ Compiler\n\n\t    # KCC will only create a shared library if the output file\n\t    # ends with \".so\" (or \".sl\" for HP-UX), so rename the library\n\t    # to its proper name (with version) after linking.\n\t    _LT_TAGVAR(archive_cmds, $1)='tempext=`echo $shared_ext | $SED -e '\\''s/\\([[^()0-9A-Za-z{}]]\\)/\\\\\\\\\\1/g'\\''`; templib=`echo $lib | $SED -e \"s/\\$tempext\\..*/.so/\"`; $CC $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags --soname $soname -o \\$templib; mv \\$templib $lib'\n\t    _LT_TAGVAR(archive_expsym_cmds, $1)='tempext=`echo $shared_ext | $SED -e '\\''s/\\([[^()0-9A-Za-z{}]]\\)/\\\\\\\\\\1/g'\\''`; templib=`echo $lib | $SED -e \"s/\\$tempext\\..*/.so/\"`; $CC $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags --soname $soname -o \\$templib $wl-retain-symbols-file,$export_symbols; mv \\$templib $lib'\n\t    # Commands to make compiler produce verbose output that lists\n\t    # what \"hidden\" libraries, object files and flags are used when\n\t    # linking a shared library.\n\t    #\n\t    # There doesn't appear to be a way to prevent this compiler from\n\t    # explicitly linking system object files so we need to strip them\n\t    # from the output so that they don't get included in the library\n\t    # dependencies.\n\t    output_verbose_link_cmd='templist=`$CC $CFLAGS -v conftest.$objext -o libconftest$shared_ext 2>&1 | $GREP \"ld\"`; rm -f libconftest$shared_ext; list= ; for z in $templist; do case $z in conftest.$objext) list=\"$list $z\";; *.$objext);; *) list=\"$list $z\";;esac; done; func_echo_all \"$list\"'\n\n\t    _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='$wl-rpath,$libdir'\n\t    _LT_TAGVAR(export_dynamic_flag_spec, $1)='$wl--export-dynamic'\n\n\t    # Archives containing C++ object files must be created using\n\t    # \"CC -Bstatic\", where \"CC\" is the KAI C++ compiler.\n\t    _LT_TAGVAR(old_archive_cmds, $1)='$CC -Bstatic -o $oldlib $oldobjs'\n\t    ;;\n\t  icpc* | ecpc* )\n\t    # Intel C++\n\t    with_gnu_ld=yes\n\t    # version 8.0 and above of icpc choke on multiply defined symbols\n\t    # if we add $predep_objects and $postdep_objects, however 7.1 and\n\t    # earlier do not add the objects themselves.\n\t    case `$CC -V 2>&1` in\n\t      *\"Version 7.\"*)\n\t        _LT_TAGVAR(archive_cmds, $1)='$CC -shared $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags $wl-soname $wl$soname -o $lib'\n\t\t_LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags $wl-soname $wl$soname $wl-retain-symbols-file $wl$export_symbols -o $lib'\n\t\t;;\n\t      *)  # Version 8.0 or newer\n\t        tmp_idyn=\n\t        case $host_cpu in\n\t\t  ia64*) tmp_idyn=' -i_dynamic';;\n\t\tesac\n\t        _LT_TAGVAR(archive_cmds, $1)='$CC -shared'\"$tmp_idyn\"' $libobjs $deplibs $compiler_flags $wl-soname $wl$soname -o $lib'\n\t\t_LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared'\"$tmp_idyn\"' $libobjs $deplibs $compiler_flags $wl-soname $wl$soname $wl-retain-symbols-file $wl$export_symbols -o $lib'\n\t\t;;\n\t    esac\n\t    _LT_TAGVAR(archive_cmds_need_lc, $1)=no\n\t    _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='$wl-rpath,$libdir'\n\t    _LT_TAGVAR(export_dynamic_flag_spec, $1)='$wl--export-dynamic'\n\t    _LT_TAGVAR(whole_archive_flag_spec, $1)='$wl--whole-archive$convenience $wl--no-whole-archive'\n\t    ;;\n          pgCC* | pgcpp*)\n            # Portland Group C++ compiler\n\t    case `$CC -V` in\n\t    *pgCC\\ [[1-5]].* | *pgcpp\\ [[1-5]].*)\n\t      _LT_TAGVAR(prelink_cmds, $1)='tpldir=Template.dir~\n               rm -rf $tpldir~\n               $CC --prelink_objects --instantiation_dir $tpldir $objs $libobjs $compile_deplibs~\n               compile_command=\"$compile_command `find $tpldir -name \\*.o | sort | $NL2SP`\"'\n\t      _LT_TAGVAR(old_archive_cmds, $1)='tpldir=Template.dir~\n                rm -rf $tpldir~\n                $CC --prelink_objects --instantiation_dir $tpldir $oldobjs$old_deplibs~\n                $AR $AR_FLAGS $oldlib$oldobjs$old_deplibs `find $tpldir -name \\*.o | sort | $NL2SP`~\n                $RANLIB $oldlib'\n\t      _LT_TAGVAR(archive_cmds, $1)='tpldir=Template.dir~\n                rm -rf $tpldir~\n                $CC --prelink_objects --instantiation_dir $tpldir $predep_objects $libobjs $deplibs $convenience $postdep_objects~\n                $CC -shared $pic_flag $predep_objects $libobjs $deplibs `find $tpldir -name \\*.o | sort | $NL2SP` $postdep_objects $compiler_flags $wl-soname $wl$soname -o $lib'\n\t      _LT_TAGVAR(archive_expsym_cmds, $1)='tpldir=Template.dir~\n                rm -rf $tpldir~\n                $CC --prelink_objects --instantiation_dir $tpldir $predep_objects $libobjs $deplibs $convenience $postdep_objects~\n                $CC -shared $pic_flag $predep_objects $libobjs $deplibs `find $tpldir -name \\*.o | sort | $NL2SP` $postdep_objects $compiler_flags $wl-soname $wl$soname $wl-retain-symbols-file $wl$export_symbols -o $lib'\n\t      ;;\n\t    *) # Version 6 and above use weak symbols\n\t      _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags $wl-soname $wl$soname -o $lib'\n\t      _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $pic_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags $wl-soname $wl$soname $wl-retain-symbols-file $wl$export_symbols -o $lib'\n\t      ;;\n\t    esac\n\n\t    _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='$wl--rpath $wl$libdir'\n\t    _LT_TAGVAR(export_dynamic_flag_spec, $1)='$wl--export-dynamic'\n\t    _LT_TAGVAR(whole_archive_flag_spec, $1)='$wl--whole-archive`for conv in $convenience\\\"\\\"; do test  -n \\\"$conv\\\" && new_convenience=\\\"$new_convenience,$conv\\\"; done; func_echo_all \\\"$new_convenience\\\"` $wl--no-whole-archive'\n            ;;\n\t  cxx*)\n\t    # Compaq C++\n\t    _LT_TAGVAR(archive_cmds, $1)='$CC -shared $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags $wl-soname $wl$soname -o $lib'\n\t    _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags $wl-soname $wl$soname  -o $lib $wl-retain-symbols-file $wl$export_symbols'\n\n\t    runpath_var=LD_RUN_PATH\n\t    _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-rpath $libdir'\n\t    _LT_TAGVAR(hardcode_libdir_separator, $1)=:\n\n\t    # Commands to make compiler produce verbose output that lists\n\t    # what \"hidden\" libraries, object files and flags are used when\n\t    # linking a shared library.\n\t    #\n\t    # There doesn't appear to be a way to prevent this compiler from\n\t    # explicitly linking system object files so we need to strip them\n\t    # from the output so that they don't get included in the library\n\t    # dependencies.\n\t    output_verbose_link_cmd='templist=`$CC -shared $CFLAGS -v conftest.$objext 2>&1 | $GREP \"ld\"`; templist=`func_echo_all \"$templist\" | $SED \"s/\\(^.*ld.*\\)\\( .*ld .*$\\)/\\1/\"`; list= ; for z in $templist; do case $z in conftest.$objext) list=\"$list $z\";; *.$objext);; *) list=\"$list $z\";;esac; done; func_echo_all \"X$list\" | $Xsed'\n\t    ;;\n\t  xl* | mpixl* | bgxl*)\n\t    # IBM XL 8.0 on PPC, with GNU ld\n\t    _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='$wl-rpath $wl$libdir'\n\t    _LT_TAGVAR(export_dynamic_flag_spec, $1)='$wl--export-dynamic'\n\t    _LT_TAGVAR(archive_cmds, $1)='$CC -qmkshrobj $libobjs $deplibs $compiler_flags $wl-soname $wl$soname -o $lib'\n\t    if test yes = \"$supports_anon_versioning\"; then\n\t      _LT_TAGVAR(archive_expsym_cmds, $1)='echo \"{ global:\" > $output_objdir/$libname.ver~\n                cat $export_symbols | sed -e \"s/\\(.*\\)/\\1;/\" >> $output_objdir/$libname.ver~\n                echo \"local: *; };\" >> $output_objdir/$libname.ver~\n                $CC -qmkshrobj $libobjs $deplibs $compiler_flags $wl-soname $wl$soname $wl-version-script $wl$output_objdir/$libname.ver -o $lib'\n\t    fi\n\t    ;;\n\t  *)\n\t    case `$CC -V 2>&1 | sed 5q` in\n\t    *Sun\\ C*)\n\t      # Sun C++ 5.9\n\t      _LT_TAGVAR(no_undefined_flag, $1)=' -zdefs'\n\t      _LT_TAGVAR(archive_cmds, $1)='$CC -G$allow_undefined_flag -h$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags'\n\t      _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -G$allow_undefined_flag -h$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags $wl-retain-symbols-file $wl$export_symbols'\n\t      _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-R$libdir'\n\t      _LT_TAGVAR(whole_archive_flag_spec, $1)='$wl--whole-archive`new_convenience=; for conv in $convenience\\\"\\\"; do test -z \\\"$conv\\\" || new_convenience=\\\"$new_convenience,$conv\\\"; done; func_echo_all \\\"$new_convenience\\\"` $wl--no-whole-archive'\n\t      _LT_TAGVAR(compiler_needs_object, $1)=yes\n\n\t      # Not sure whether something based on\n\t      # $CC $CFLAGS -v conftest.$objext -o libconftest$shared_ext 2>&1\n\t      # would be better.\n\t      output_verbose_link_cmd='func_echo_all'\n\n\t      # Archives containing C++ object files must be created using\n\t      # \"CC -xar\", where \"CC\" is the Sun C++ compiler.  This is\n\t      # necessary to make sure instantiated templates are included\n\t      # in the archive.\n\t      _LT_TAGVAR(old_archive_cmds, $1)='$CC -xar -o $oldlib $oldobjs'\n\t      ;;\n\t    esac\n\t    ;;\n\tesac\n\t;;\n\n      lynxos*)\n        # FIXME: insert proper C++ library support\n\t_LT_TAGVAR(ld_shlibs, $1)=no\n\t;;\n\n      m88k*)\n        # FIXME: insert proper C++ library support\n        _LT_TAGVAR(ld_shlibs, $1)=no\n\t;;\n\n      mvs*)\n        case $cc_basename in\n          cxx*)\n\t    # FIXME: insert proper C++ library support\n\t    _LT_TAGVAR(ld_shlibs, $1)=no\n\t    ;;\n\t  *)\n\t    # FIXME: insert proper C++ library support\n\t    _LT_TAGVAR(ld_shlibs, $1)=no\n\t    ;;\n\tesac\n\t;;\n\n      netbsd*)\n        if echo __ELF__ | $CC -E - | $GREP __ELF__ >/dev/null; then\n\t  _LT_TAGVAR(archive_cmds, $1)='$LD -Bshareable  -o $lib $predep_objects $libobjs $deplibs $postdep_objects $linker_flags'\n\t  wlarc=\n\t  _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-R$libdir'\n\t  _LT_TAGVAR(hardcode_direct, $1)=yes\n\t  _LT_TAGVAR(hardcode_shlibpath_var, $1)=no\n\tfi\n\t# Workaround some broken pre-1.5 toolchains\n\toutput_verbose_link_cmd='$CC -shared $CFLAGS -v conftest.$objext 2>&1 | $GREP conftest.$objext | $SED -e \"s:-lgcc -lc -lgcc::\"'\n\t;;\n\n      *nto* | *qnx*)\n        _LT_TAGVAR(ld_shlibs, $1)=yes\n\t;;\n\n      openbsd* | bitrig*)\n\tif test -f /usr/libexec/ld.so; then\n\t  _LT_TAGVAR(hardcode_direct, $1)=yes\n\t  _LT_TAGVAR(hardcode_shlibpath_var, $1)=no\n\t  _LT_TAGVAR(hardcode_direct_absolute, $1)=yes\n\t  _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -o $lib'\n\t  _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='$wl-rpath,$libdir'\n\t  if test -z \"`echo __ELF__ | $CC -E - | grep __ELF__`\"; then\n\t    _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $pic_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags $wl-retain-symbols-file,$export_symbols -o $lib'\n\t    _LT_TAGVAR(export_dynamic_flag_spec, $1)='$wl-E'\n\t    _LT_TAGVAR(whole_archive_flag_spec, $1)=$wlarc'--whole-archive$convenience '$wlarc'--no-whole-archive'\n\t  fi\n\t  output_verbose_link_cmd=func_echo_all\n\telse\n\t  _LT_TAGVAR(ld_shlibs, $1)=no\n\tfi\n\t;;\n\n      osf3* | osf4* | osf5*)\n        case $cc_basename in\n          KCC*)\n\t    # Kuck and Associates, Inc. (KAI) C++ Compiler\n\n\t    # KCC will only create a shared library if the output file\n\t    # ends with \".so\" (or \".sl\" for HP-UX), so rename the library\n\t    # to its proper name (with version) after linking.\n\t    _LT_TAGVAR(archive_cmds, $1)='tempext=`echo $shared_ext | $SED -e '\\''s/\\([[^()0-9A-Za-z{}]]\\)/\\\\\\\\\\1/g'\\''`; templib=`echo \"$lib\" | $SED -e \"s/\\$tempext\\..*/.so/\"`; $CC $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags --soname $soname -o \\$templib; mv \\$templib $lib'\n\n\t    _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='$wl-rpath,$libdir'\n\t    _LT_TAGVAR(hardcode_libdir_separator, $1)=:\n\n\t    # Archives containing C++ object files must be created using\n\t    # the KAI C++ compiler.\n\t    case $host in\n\t      osf3*) _LT_TAGVAR(old_archive_cmds, $1)='$CC -Bstatic -o $oldlib $oldobjs' ;;\n\t      *) _LT_TAGVAR(old_archive_cmds, $1)='$CC -o $oldlib $oldobjs' ;;\n\t    esac\n\t    ;;\n          RCC*)\n\t    # Rational C++ 2.4.1\n\t    # FIXME: insert proper C++ library support\n\t    _LT_TAGVAR(ld_shlibs, $1)=no\n\t    ;;\n          cxx*)\n\t    case $host in\n\t      osf3*)\n\t        _LT_TAGVAR(allow_undefined_flag, $1)=' $wl-expect_unresolved $wl\\*'\n\t        _LT_TAGVAR(archive_cmds, $1)='$CC -shared$allow_undefined_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags $wl-soname $soname `test -n \"$verstring\" && func_echo_all \"$wl-set_version $verstring\"` -update_registry $output_objdir/so_locations -o $lib'\n\t        _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='$wl-rpath $wl$libdir'\n\t\t;;\n\t      *)\n\t        _LT_TAGVAR(allow_undefined_flag, $1)=' -expect_unresolved \\*'\n\t        _LT_TAGVAR(archive_cmds, $1)='$CC -shared$allow_undefined_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -msym -soname $soname `test -n \"$verstring\" && func_echo_all \"-set_version $verstring\"` -update_registry $output_objdir/so_locations -o $lib'\n\t        _LT_TAGVAR(archive_expsym_cmds, $1)='for i in `cat $export_symbols`; do printf \"%s %s\\\\n\" -exported_symbol \"\\$i\" >> $lib.exp; done~\n                  echo \"-hidden\">> $lib.exp~\n                  $CC -shared$allow_undefined_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -msym -soname $soname $wl-input $wl$lib.exp  `test -n \"$verstring\" && $ECHO \"-set_version $verstring\"` -update_registry $output_objdir/so_locations -o $lib~\n                  $RM $lib.exp'\n\t        _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-rpath $libdir'\n\t\t;;\n\t    esac\n\n\t    _LT_TAGVAR(hardcode_libdir_separator, $1)=:\n\n\t    # Commands to make compiler produce verbose output that lists\n\t    # what \"hidden\" libraries, object files and flags are used when\n\t    # linking a shared library.\n\t    #\n\t    # There doesn't appear to be a way to prevent this compiler from\n\t    # explicitly linking system object files so we need to strip them\n\t    # from the output so that they don't get included in the library\n\t    # dependencies.\n\t    output_verbose_link_cmd='templist=`$CC -shared $CFLAGS -v conftest.$objext 2>&1 | $GREP \"ld\" | $GREP -v \"ld:\"`; templist=`func_echo_all \"$templist\" | $SED \"s/\\(^.*ld.*\\)\\( .*ld.*$\\)/\\1/\"`; list= ; for z in $templist; do case $z in conftest.$objext) list=\"$list $z\";; *.$objext);; *) list=\"$list $z\";;esac; done; func_echo_all \"$list\"'\n\t    ;;\n\t  *)\n\t    if test yes,no = \"$GXX,$with_gnu_ld\"; then\n\t      _LT_TAGVAR(allow_undefined_flag, $1)=' $wl-expect_unresolved $wl\\*'\n\t      case $host in\n\t        osf3*)\n\t          _LT_TAGVAR(archive_cmds, $1)='$CC -shared -nostdlib $allow_undefined_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags $wl-soname $wl$soname `test -n \"$verstring\" && func_echo_all \"$wl-set_version $wl$verstring\"` $wl-update_registry $wl$output_objdir/so_locations -o $lib'\n\t\t  ;;\n\t        *)\n\t          _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag -nostdlib $allow_undefined_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags $wl-msym $wl-soname $wl$soname `test -n \"$verstring\" && func_echo_all \"$wl-set_version $wl$verstring\"` $wl-update_registry $wl$output_objdir/so_locations -o $lib'\n\t\t  ;;\n\t      esac\n\n\t      _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='$wl-rpath $wl$libdir'\n\t      _LT_TAGVAR(hardcode_libdir_separator, $1)=:\n\n\t      # Commands to make compiler produce verbose output that lists\n\t      # what \"hidden\" libraries, object files and flags are used when\n\t      # linking a shared library.\n\t      output_verbose_link_cmd='$CC -shared $CFLAGS -v conftest.$objext 2>&1 | $GREP -v \"^Configured with:\" | $GREP \"\\-L\"'\n\n\t    else\n\t      # FIXME: insert proper C++ library support\n\t      _LT_TAGVAR(ld_shlibs, $1)=no\n\t    fi\n\t    ;;\n        esac\n        ;;\n\n      psos*)\n        # FIXME: insert proper C++ library support\n        _LT_TAGVAR(ld_shlibs, $1)=no\n        ;;\n\n      sunos4*)\n        case $cc_basename in\n          CC*)\n\t    # Sun C++ 4.x\n\t    # FIXME: insert proper C++ library support\n\t    _LT_TAGVAR(ld_shlibs, $1)=no\n\t    ;;\n          lcc*)\n\t    # Lucid\n\t    # FIXME: insert proper C++ library support\n\t    _LT_TAGVAR(ld_shlibs, $1)=no\n\t    ;;\n          *)\n\t    # FIXME: insert proper C++ library support\n\t    _LT_TAGVAR(ld_shlibs, $1)=no\n\t    ;;\n        esac\n        ;;\n\n      solaris*)\n        case $cc_basename in\n          CC* | sunCC*)\n\t    # Sun C++ 4.2, 5.x and Centerline C++\n            _LT_TAGVAR(archive_cmds_need_lc,$1)=yes\n\t    _LT_TAGVAR(no_undefined_flag, $1)=' -zdefs'\n\t    _LT_TAGVAR(archive_cmds, $1)='$CC -G$allow_undefined_flag -h$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags'\n\t    _LT_TAGVAR(archive_expsym_cmds, $1)='echo \"{ global:\" > $lib.exp~cat $export_symbols | $SED -e \"s/\\(.*\\)/\\1;/\" >> $lib.exp~echo \"local: *; };\" >> $lib.exp~\n              $CC -G$allow_undefined_flag $wl-M $wl$lib.exp -h$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags~$RM $lib.exp'\n\n\t    _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-R$libdir'\n\t    _LT_TAGVAR(hardcode_shlibpath_var, $1)=no\n\t    case $host_os in\n\t      solaris2.[[0-5]] | solaris2.[[0-5]].*) ;;\n\t      *)\n\t\t# The compiler driver will combine and reorder linker options,\n\t\t# but understands '-z linker_flag'.\n\t        # Supported since Solaris 2.6 (maybe 2.5.1?)\n\t\t_LT_TAGVAR(whole_archive_flag_spec, $1)='-z allextract$convenience -z defaultextract'\n\t        ;;\n\t    esac\n\t    _LT_TAGVAR(link_all_deplibs, $1)=yes\n\n\t    output_verbose_link_cmd='func_echo_all'\n\n\t    # Archives containing C++ object files must be created using\n\t    # \"CC -xar\", where \"CC\" is the Sun C++ compiler.  This is\n\t    # necessary to make sure instantiated templates are included\n\t    # in the archive.\n\t    _LT_TAGVAR(old_archive_cmds, $1)='$CC -xar -o $oldlib $oldobjs'\n\t    ;;\n          gcx*)\n\t    # Green Hills C++ Compiler\n\t    _LT_TAGVAR(archive_cmds, $1)='$CC -shared $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags $wl-h $wl$soname -o $lib'\n\n\t    # The C++ compiler must be used to create the archive.\n\t    _LT_TAGVAR(old_archive_cmds, $1)='$CC $LDFLAGS -archive -o $oldlib $oldobjs'\n\t    ;;\n          *)\n\t    # GNU C++ compiler with Solaris linker\n\t    if test yes,no = \"$GXX,$with_gnu_ld\"; then\n\t      _LT_TAGVAR(no_undefined_flag, $1)=' $wl-z ${wl}defs'\n\t      if $CC --version | $GREP -v '^2\\.7' > /dev/null; then\n\t        _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags $wl-h $wl$soname -o $lib'\n\t        _LT_TAGVAR(archive_expsym_cmds, $1)='echo \"{ global:\" > $lib.exp~cat $export_symbols | $SED -e \"s/\\(.*\\)/\\1;/\" >> $lib.exp~echo \"local: *; };\" >> $lib.exp~\n                  $CC -shared $pic_flag -nostdlib $wl-M $wl$lib.exp $wl-h $wl$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags~$RM $lib.exp'\n\n\t        # Commands to make compiler produce verbose output that lists\n\t        # what \"hidden\" libraries, object files and flags are used when\n\t        # linking a shared library.\n\t        output_verbose_link_cmd='$CC -shared $CFLAGS -v conftest.$objext 2>&1 | $GREP -v \"^Configured with:\" | $GREP \"\\-L\"'\n\t      else\n\t        # g++ 2.7 appears to require '-G' NOT '-shared' on this\n\t        # platform.\n\t        _LT_TAGVAR(archive_cmds, $1)='$CC -G -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags $wl-h $wl$soname -o $lib'\n\t        _LT_TAGVAR(archive_expsym_cmds, $1)='echo \"{ global:\" > $lib.exp~cat $export_symbols | $SED -e \"s/\\(.*\\)/\\1;/\" >> $lib.exp~echo \"local: *; };\" >> $lib.exp~\n                  $CC -G -nostdlib $wl-M $wl$lib.exp $wl-h $wl$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags~$RM $lib.exp'\n\n\t        # Commands to make compiler produce verbose output that lists\n\t        # what \"hidden\" libraries, object files and flags are used when\n\t        # linking a shared library.\n\t        output_verbose_link_cmd='$CC -G $CFLAGS -v conftest.$objext 2>&1 | $GREP -v \"^Configured with:\" | $GREP \"\\-L\"'\n\t      fi\n\n\t      _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='$wl-R $wl$libdir'\n\t      case $host_os in\n\t\tsolaris2.[[0-5]] | solaris2.[[0-5]].*) ;;\n\t\t*)\n\t\t  _LT_TAGVAR(whole_archive_flag_spec, $1)='$wl-z ${wl}allextract$convenience $wl-z ${wl}defaultextract'\n\t\t  ;;\n\t      esac\n\t    fi\n\t    ;;\n        esac\n        ;;\n\n    sysv4*uw2* | sysv5OpenUNIX* | sysv5UnixWare7.[[01]].[[10]]* | unixware7* | sco3.2v5.0.[[024]]*)\n      _LT_TAGVAR(no_undefined_flag, $1)='$wl-z,text'\n      _LT_TAGVAR(archive_cmds_need_lc, $1)=no\n      _LT_TAGVAR(hardcode_shlibpath_var, $1)=no\n      runpath_var='LD_RUN_PATH'\n\n      case $cc_basename in\n        CC*)\n\t  _LT_TAGVAR(archive_cmds, $1)='$CC -G $wl-h,$soname -o $lib $libobjs $deplibs $compiler_flags'\n\t  _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -G $wl-Bexport:$export_symbols $wl-h,$soname -o $lib $libobjs $deplibs $compiler_flags'\n\t  ;;\n\t*)\n\t  _LT_TAGVAR(archive_cmds, $1)='$CC -shared $wl-h,$soname -o $lib $libobjs $deplibs $compiler_flags'\n\t  _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $wl-Bexport:$export_symbols $wl-h,$soname -o $lib $libobjs $deplibs $compiler_flags'\n\t  ;;\n      esac\n      ;;\n\n      sysv5* | sco3.2v5* | sco5v6*)\n\t# Note: We CANNOT use -z defs as we might desire, because we do not\n\t# link with -lc, and that would cause any symbols used from libc to\n\t# always be unresolved, which means just about no library would\n\t# ever link correctly.  If we're not using GNU ld we use -z text\n\t# though, which does catch some bad symbols but isn't as heavy-handed\n\t# as -z defs.\n\t_LT_TAGVAR(no_undefined_flag, $1)='$wl-z,text'\n\t_LT_TAGVAR(allow_undefined_flag, $1)='$wl-z,nodefs'\n\t_LT_TAGVAR(archive_cmds_need_lc, $1)=no\n\t_LT_TAGVAR(hardcode_shlibpath_var, $1)=no\n\t_LT_TAGVAR(hardcode_libdir_flag_spec, $1)='$wl-R,$libdir'\n\t_LT_TAGVAR(hardcode_libdir_separator, $1)=':'\n\t_LT_TAGVAR(link_all_deplibs, $1)=yes\n\t_LT_TAGVAR(export_dynamic_flag_spec, $1)='$wl-Bexport'\n\trunpath_var='LD_RUN_PATH'\n\n\tcase $cc_basename in\n          CC*)\n\t    _LT_TAGVAR(archive_cmds, $1)='$CC -G $wl-h,$soname -o $lib $libobjs $deplibs $compiler_flags'\n\t    _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -G $wl-Bexport:$export_symbols $wl-h,$soname -o $lib $libobjs $deplibs $compiler_flags'\n\t    _LT_TAGVAR(old_archive_cmds, $1)='$CC -Tprelink_objects $oldobjs~\n              '\"$_LT_TAGVAR(old_archive_cmds, $1)\"\n\t    _LT_TAGVAR(reload_cmds, $1)='$CC -Tprelink_objects $reload_objs~\n              '\"$_LT_TAGVAR(reload_cmds, $1)\"\n\t    ;;\n\t  *)\n\t    _LT_TAGVAR(archive_cmds, $1)='$CC -shared $wl-h,$soname -o $lib $libobjs $deplibs $compiler_flags'\n\t    _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $wl-Bexport:$export_symbols $wl-h,$soname -o $lib $libobjs $deplibs $compiler_flags'\n\t    ;;\n\tesac\n      ;;\n\n      tandem*)\n        case $cc_basename in\n          NCC*)\n\t    # NonStop-UX NCC 3.20\n\t    # FIXME: insert proper C++ library support\n\t    _LT_TAGVAR(ld_shlibs, $1)=no\n\t    ;;\n          *)\n\t    # FIXME: insert proper C++ library support\n\t    _LT_TAGVAR(ld_shlibs, $1)=no\n\t    ;;\n        esac\n        ;;\n\n      vxworks*)\n        # FIXME: insert proper C++ library support\n        _LT_TAGVAR(ld_shlibs, $1)=no\n        ;;\n\n      *)\n        # FIXME: insert proper C++ library support\n        _LT_TAGVAR(ld_shlibs, $1)=no\n        ;;\n    esac\n\n    AC_MSG_RESULT([$_LT_TAGVAR(ld_shlibs, $1)])\n    test no = \"$_LT_TAGVAR(ld_shlibs, $1)\" && can_build_shared=no\n\n    _LT_TAGVAR(GCC, $1)=$GXX\n    _LT_TAGVAR(LD, $1)=$LD\n\n    ## CAVEAT EMPTOR:\n    ## There is no encapsulation within the following macros, do not change\n    ## the running order or otherwise move them around unless you know exactly\n    ## what you are doing...\n    _LT_SYS_HIDDEN_LIBDEPS($1)\n    _LT_COMPILER_PIC($1)\n    _LT_COMPILER_C_O($1)\n    _LT_COMPILER_FILE_LOCKS($1)\n    _LT_LINKER_SHLIBS($1)\n    _LT_SYS_DYNAMIC_LINKER($1)\n    _LT_LINKER_HARDCODE_LIBPATH($1)\n\n    _LT_CONFIG($1)\n  fi # test -n \"$compiler\"\n\n  CC=$lt_save_CC\n  CFLAGS=$lt_save_CFLAGS\n  LDCXX=$LD\n  LD=$lt_save_LD\n  GCC=$lt_save_GCC\n  with_gnu_ld=$lt_save_with_gnu_ld\n  lt_cv_path_LDCXX=$lt_cv_path_LD\n  lt_cv_path_LD=$lt_save_path_LD\n  lt_cv_prog_gnu_ldcxx=$lt_cv_prog_gnu_ld\n  lt_cv_prog_gnu_ld=$lt_save_with_gnu_ld\nfi # test yes != \"$_lt_caught_CXX_error\"\n\nAC_LANG_POP\n])# _LT_LANG_CXX_CONFIG\n\n\n# _LT_FUNC_STRIPNAME_CNF\n# ----------------------\n# func_stripname_cnf prefix suffix name\n# strip PREFIX and SUFFIX off of NAME.\n# PREFIX and SUFFIX must not contain globbing or regex special\n# characters, hashes, percent signs, but SUFFIX may contain a leading\n# dot (in which case that matches only a dot).\n#\n# This function is identical to the (non-XSI) version of func_stripname,\n# except this one can be used by m4 code that may be executed by configure,\n# rather than the libtool script.\nm4_defun([_LT_FUNC_STRIPNAME_CNF],[dnl\nAC_REQUIRE([_LT_DECL_SED])\nAC_REQUIRE([_LT_PROG_ECHO_BACKSLASH])\nfunc_stripname_cnf ()\n{\n  case @S|@2 in\n  .*) func_stripname_result=`$ECHO \"@S|@3\" | $SED \"s%^@S|@1%%; s%\\\\\\\\@S|@2\\$%%\"`;;\n  *)  func_stripname_result=`$ECHO \"@S|@3\" | $SED \"s%^@S|@1%%; s%@S|@2\\$%%\"`;;\n  esac\n} # func_stripname_cnf\n])# _LT_FUNC_STRIPNAME_CNF\n\n\n# _LT_SYS_HIDDEN_LIBDEPS([TAGNAME])\n# ---------------------------------\n# Figure out \"hidden\" library dependencies from verbose\n# compiler output when linking a shared library.\n# Parse the compiler output and extract the necessary\n# objects, libraries and library flags.\nm4_defun([_LT_SYS_HIDDEN_LIBDEPS],\n[m4_require([_LT_FILEUTILS_DEFAULTS])dnl\nAC_REQUIRE([_LT_FUNC_STRIPNAME_CNF])dnl\n# Dependencies to place before and after the object being linked:\n_LT_TAGVAR(predep_objects, $1)=\n_LT_TAGVAR(postdep_objects, $1)=\n_LT_TAGVAR(predeps, $1)=\n_LT_TAGVAR(postdeps, $1)=\n_LT_TAGVAR(compiler_lib_search_path, $1)=\n\ndnl we can't use the lt_simple_compile_test_code here,\ndnl because it contains code intended for an executable,\ndnl not a library.  It's possible we should let each\ndnl tag define a new lt_????_link_test_code variable,\ndnl but it's only used here...\nm4_if([$1], [], [cat > conftest.$ac_ext <<_LT_EOF\nint a;\nvoid foo (void) { a = 0; }\n_LT_EOF\n], [$1], [CXX], [cat > conftest.$ac_ext <<_LT_EOF\nclass Foo\n{\npublic:\n  Foo (void) { a = 0; }\nprivate:\n  int a;\n};\n_LT_EOF\n], [$1], [F77], [cat > conftest.$ac_ext <<_LT_EOF\n      subroutine foo\n      implicit none\n      integer*4 a\n      a=0\n      return\n      end\n_LT_EOF\n], [$1], [FC], [cat > conftest.$ac_ext <<_LT_EOF\n      subroutine foo\n      implicit none\n      integer a\n      a=0\n      return\n      end\n_LT_EOF\n], [$1], [GCJ], [cat > conftest.$ac_ext <<_LT_EOF\npublic class foo {\n  private int a;\n  public void bar (void) {\n    a = 0;\n  }\n};\n_LT_EOF\n], [$1], [GO], [cat > conftest.$ac_ext <<_LT_EOF\npackage foo\nfunc foo() {\n}\n_LT_EOF\n])\n\n_lt_libdeps_save_CFLAGS=$CFLAGS\ncase \"$CC $CFLAGS \" in #(\n*\\ -flto*\\ *) CFLAGS=\"$CFLAGS -fno-lto\" ;;\n*\\ -fwhopr*\\ *) CFLAGS=\"$CFLAGS -fno-whopr\" ;;\n*\\ -fuse-linker-plugin*\\ *) CFLAGS=\"$CFLAGS -fno-use-linker-plugin\" ;;\nesac\n\ndnl Parse the compiler output and extract the necessary\ndnl objects, libraries and library flags.\nif AC_TRY_EVAL(ac_compile); then\n  # Parse the compiler output and extract the necessary\n  # objects, libraries and library flags.\n\n  # Sentinel used to keep track of whether or not we are before\n  # the conftest object file.\n  pre_test_object_deps_done=no\n\n  for p in `eval \"$output_verbose_link_cmd\"`; do\n    case $prev$p in\n\n    -L* | -R* | -l*)\n       # Some compilers place space between \"-{L,R}\" and the path.\n       # Remove the space.\n       if test x-L = \"$p\" ||\n          test x-R = \"$p\"; then\n\t prev=$p\n\t continue\n       fi\n\n       # Expand the sysroot to ease extracting the directories later.\n       if test -z \"$prev\"; then\n         case $p in\n         -L*) func_stripname_cnf '-L' '' \"$p\"; prev=-L; p=$func_stripname_result ;;\n         -R*) func_stripname_cnf '-R' '' \"$p\"; prev=-R; p=$func_stripname_result ;;\n         -l*) func_stripname_cnf '-l' '' \"$p\"; prev=-l; p=$func_stripname_result ;;\n         esac\n       fi\n       case $p in\n       =*) func_stripname_cnf '=' '' \"$p\"; p=$lt_sysroot$func_stripname_result ;;\n       esac\n       if test no = \"$pre_test_object_deps_done\"; then\n\t case $prev in\n\t -L | -R)\n\t   # Internal compiler library paths should come after those\n\t   # provided the user.  The postdeps already come after the\n\t   # user supplied libs so there is no need to process them.\n\t   if test -z \"$_LT_TAGVAR(compiler_lib_search_path, $1)\"; then\n\t     _LT_TAGVAR(compiler_lib_search_path, $1)=$prev$p\n\t   else\n\t     _LT_TAGVAR(compiler_lib_search_path, $1)=\"${_LT_TAGVAR(compiler_lib_search_path, $1)} $prev$p\"\n\t   fi\n\t   ;;\n\t # The \"-l\" case would never come before the object being\n\t # linked, so don't bother handling this case.\n\t esac\n       else\n\t if test -z \"$_LT_TAGVAR(postdeps, $1)\"; then\n\t   _LT_TAGVAR(postdeps, $1)=$prev$p\n\t else\n\t   _LT_TAGVAR(postdeps, $1)=\"${_LT_TAGVAR(postdeps, $1)} $prev$p\"\n\t fi\n       fi\n       prev=\n       ;;\n\n    *.lto.$objext) ;; # Ignore GCC LTO objects\n    *.$objext)\n       # This assumes that the test object file only shows up\n       # once in the compiler output.\n       if test \"$p\" = \"conftest.$objext\"; then\n\t pre_test_object_deps_done=yes\n\t continue\n       fi\n\n       if test no = \"$pre_test_object_deps_done\"; then\n\t if test -z \"$_LT_TAGVAR(predep_objects, $1)\"; then\n\t   _LT_TAGVAR(predep_objects, $1)=$p\n\t else\n\t   _LT_TAGVAR(predep_objects, $1)=\"$_LT_TAGVAR(predep_objects, $1) $p\"\n\t fi\n       else\n\t if test -z \"$_LT_TAGVAR(postdep_objects, $1)\"; then\n\t   _LT_TAGVAR(postdep_objects, $1)=$p\n\t else\n\t   _LT_TAGVAR(postdep_objects, $1)=\"$_LT_TAGVAR(postdep_objects, $1) $p\"\n\t fi\n       fi\n       ;;\n\n    *) ;; # Ignore the rest.\n\n    esac\n  done\n\n  # Clean up.\n  rm -f a.out a.exe\nelse\n  echo \"libtool.m4: error: problem compiling $1 test program\"\nfi\n\n$RM -f confest.$objext\nCFLAGS=$_lt_libdeps_save_CFLAGS\n\n# PORTME: override above test on systems where it is broken\nm4_if([$1], [CXX],\n[case $host_os in\ninterix[[3-9]]*)\n  # Interix 3.5 installs completely hosed .la files for C++, so rather than\n  # hack all around it, let's just trust \"g++\" to DTRT.\n  _LT_TAGVAR(predep_objects,$1)=\n  _LT_TAGVAR(postdep_objects,$1)=\n  _LT_TAGVAR(postdeps,$1)=\n  ;;\nesac\n])\n\ncase \" $_LT_TAGVAR(postdeps, $1) \" in\n*\" -lc \"*) _LT_TAGVAR(archive_cmds_need_lc, $1)=no ;;\nesac\n _LT_TAGVAR(compiler_lib_search_dirs, $1)=\nif test -n \"${_LT_TAGVAR(compiler_lib_search_path, $1)}\"; then\n _LT_TAGVAR(compiler_lib_search_dirs, $1)=`echo \" ${_LT_TAGVAR(compiler_lib_search_path, $1)}\" | $SED -e 's! -L! !g' -e 's!^ !!'`\nfi\n_LT_TAGDECL([], [compiler_lib_search_dirs], [1],\n    [The directories searched by this compiler when creating a shared library])\n_LT_TAGDECL([], [predep_objects], [1],\n    [Dependencies to place before and after the objects being linked to\n    create a shared library])\n_LT_TAGDECL([], [postdep_objects], [1])\n_LT_TAGDECL([], [predeps], [1])\n_LT_TAGDECL([], [postdeps], [1])\n_LT_TAGDECL([], [compiler_lib_search_path], [1],\n    [The library search path used internally by the compiler when linking\n    a shared library])\n])# _LT_SYS_HIDDEN_LIBDEPS\n\n\n# _LT_LANG_F77_CONFIG([TAG])\n# --------------------------\n# Ensure that the configuration variables for a Fortran 77 compiler are\n# suitably defined.  These variables are subsequently used by _LT_CONFIG\n# to write the compiler configuration to 'libtool'.\nm4_defun([_LT_LANG_F77_CONFIG],\n[AC_LANG_PUSH(Fortran 77)\nif test -z \"$F77\" || test no = \"$F77\"; then\n  _lt_disable_F77=yes\nfi\n\n_LT_TAGVAR(archive_cmds_need_lc, $1)=no\n_LT_TAGVAR(allow_undefined_flag, $1)=\n_LT_TAGVAR(always_export_symbols, $1)=no\n_LT_TAGVAR(archive_expsym_cmds, $1)=\n_LT_TAGVAR(export_dynamic_flag_spec, $1)=\n_LT_TAGVAR(hardcode_direct, $1)=no\n_LT_TAGVAR(hardcode_direct_absolute, $1)=no\n_LT_TAGVAR(hardcode_libdir_flag_spec, $1)=\n_LT_TAGVAR(hardcode_libdir_separator, $1)=\n_LT_TAGVAR(hardcode_minus_L, $1)=no\n_LT_TAGVAR(hardcode_automatic, $1)=no\n_LT_TAGVAR(inherit_rpath, $1)=no\n_LT_TAGVAR(module_cmds, $1)=\n_LT_TAGVAR(module_expsym_cmds, $1)=\n_LT_TAGVAR(link_all_deplibs, $1)=unknown\n_LT_TAGVAR(old_archive_cmds, $1)=$old_archive_cmds\n_LT_TAGVAR(reload_flag, $1)=$reload_flag\n_LT_TAGVAR(reload_cmds, $1)=$reload_cmds\n_LT_TAGVAR(no_undefined_flag, $1)=\n_LT_TAGVAR(whole_archive_flag_spec, $1)=\n_LT_TAGVAR(enable_shared_with_static_runtimes, $1)=no\n\n# Source file extension for f77 test sources.\nac_ext=f\n\n# Object file extension for compiled f77 test sources.\nobjext=o\n_LT_TAGVAR(objext, $1)=$objext\n\n# No sense in running all these tests if we already determined that\n# the F77 compiler isn't working.  Some variables (like enable_shared)\n# are currently assumed to apply to all compilers on this platform,\n# and will be corrupted by setting them based on a non-working compiler.\nif test yes != \"$_lt_disable_F77\"; then\n  # Code to be used in simple compile tests\n  lt_simple_compile_test_code=\"\\\n      subroutine t\n      return\n      end\n\"\n\n  # Code to be used in simple link tests\n  lt_simple_link_test_code=\"\\\n      program t\n      end\n\"\n\n  # ltmain only uses $CC for tagged configurations so make sure $CC is set.\n  _LT_TAG_COMPILER\n\n  # save warnings/boilerplate of simple test code\n  _LT_COMPILER_BOILERPLATE\n  _LT_LINKER_BOILERPLATE\n\n  # Allow CC to be a program name with arguments.\n  lt_save_CC=$CC\n  lt_save_GCC=$GCC\n  lt_save_CFLAGS=$CFLAGS\n  CC=${F77-\"f77\"}\n  CFLAGS=$FFLAGS\n  compiler=$CC\n  _LT_TAGVAR(compiler, $1)=$CC\n  _LT_CC_BASENAME([$compiler])\n  GCC=$G77\n  if test -n \"$compiler\"; then\n    AC_MSG_CHECKING([if libtool supports shared libraries])\n    AC_MSG_RESULT([$can_build_shared])\n\n    AC_MSG_CHECKING([whether to build shared libraries])\n    test no = \"$can_build_shared\" && enable_shared=no\n\n    # On AIX, shared libraries and static libraries use the same namespace, and\n    # are all built from PIC.\n    case $host_os in\n      aix3*)\n        test yes = \"$enable_shared\" && enable_static=no\n        if test -n \"$RANLIB\"; then\n          archive_cmds=\"$archive_cmds~\\$RANLIB \\$lib\"\n          postinstall_cmds='$RANLIB $lib'\n        fi\n        ;;\n      aix[[4-9]]*)\n\tif test ia64 != \"$host_cpu\"; then\n\t  case $enable_shared,$with_aix_soname,$aix_use_runtimelinking in\n\t  yes,aix,yes) ;;\t\t# shared object as lib.so file only\n\t  yes,svr4,*) ;;\t\t# shared object as lib.so archive member only\n\t  yes,*) enable_static=no ;;\t# shared object in lib.a archive as well\n\t  esac\n\tfi\n        ;;\n    esac\n    AC_MSG_RESULT([$enable_shared])\n\n    AC_MSG_CHECKING([whether to build static libraries])\n    # Make sure either enable_shared or enable_static is yes.\n    test yes = \"$enable_shared\" || enable_static=yes\n    AC_MSG_RESULT([$enable_static])\n\n    _LT_TAGVAR(GCC, $1)=$G77\n    _LT_TAGVAR(LD, $1)=$LD\n\n    ## CAVEAT EMPTOR:\n    ## There is no encapsulation within the following macros, do not change\n    ## the running order or otherwise move them around unless you know exactly\n    ## what you are doing...\n    _LT_COMPILER_PIC($1)\n    _LT_COMPILER_C_O($1)\n    _LT_COMPILER_FILE_LOCKS($1)\n    _LT_LINKER_SHLIBS($1)\n    _LT_SYS_DYNAMIC_LINKER($1)\n    _LT_LINKER_HARDCODE_LIBPATH($1)\n\n    _LT_CONFIG($1)\n  fi # test -n \"$compiler\"\n\n  GCC=$lt_save_GCC\n  CC=$lt_save_CC\n  CFLAGS=$lt_save_CFLAGS\nfi # test yes != \"$_lt_disable_F77\"\n\nAC_LANG_POP\n])# _LT_LANG_F77_CONFIG\n\n\n# _LT_LANG_FC_CONFIG([TAG])\n# -------------------------\n# Ensure that the configuration variables for a Fortran compiler are\n# suitably defined.  These variables are subsequently used by _LT_CONFIG\n# to write the compiler configuration to 'libtool'.\nm4_defun([_LT_LANG_FC_CONFIG],\n[AC_LANG_PUSH(Fortran)\n\nif test -z \"$FC\" || test no = \"$FC\"; then\n  _lt_disable_FC=yes\nfi\n\n_LT_TAGVAR(archive_cmds_need_lc, $1)=no\n_LT_TAGVAR(allow_undefined_flag, $1)=\n_LT_TAGVAR(always_export_symbols, $1)=no\n_LT_TAGVAR(archive_expsym_cmds, $1)=\n_LT_TAGVAR(export_dynamic_flag_spec, $1)=\n_LT_TAGVAR(hardcode_direct, $1)=no\n_LT_TAGVAR(hardcode_direct_absolute, $1)=no\n_LT_TAGVAR(hardcode_libdir_flag_spec, $1)=\n_LT_TAGVAR(hardcode_libdir_separator, $1)=\n_LT_TAGVAR(hardcode_minus_L, $1)=no\n_LT_TAGVAR(hardcode_automatic, $1)=no\n_LT_TAGVAR(inherit_rpath, $1)=no\n_LT_TAGVAR(module_cmds, $1)=\n_LT_TAGVAR(module_expsym_cmds, $1)=\n_LT_TAGVAR(link_all_deplibs, $1)=unknown\n_LT_TAGVAR(old_archive_cmds, $1)=$old_archive_cmds\n_LT_TAGVAR(reload_flag, $1)=$reload_flag\n_LT_TAGVAR(reload_cmds, $1)=$reload_cmds\n_LT_TAGVAR(no_undefined_flag, $1)=\n_LT_TAGVAR(whole_archive_flag_spec, $1)=\n_LT_TAGVAR(enable_shared_with_static_runtimes, $1)=no\n\n# Source file extension for fc test sources.\nac_ext=${ac_fc_srcext-f}\n\n# Object file extension for compiled fc test sources.\nobjext=o\n_LT_TAGVAR(objext, $1)=$objext\n\n# No sense in running all these tests if we already determined that\n# the FC compiler isn't working.  Some variables (like enable_shared)\n# are currently assumed to apply to all compilers on this platform,\n# and will be corrupted by setting them based on a non-working compiler.\nif test yes != \"$_lt_disable_FC\"; then\n  # Code to be used in simple compile tests\n  lt_simple_compile_test_code=\"\\\n      subroutine t\n      return\n      end\n\"\n\n  # Code to be used in simple link tests\n  lt_simple_link_test_code=\"\\\n      program t\n      end\n\"\n\n  # ltmain only uses $CC for tagged configurations so make sure $CC is set.\n  _LT_TAG_COMPILER\n\n  # save warnings/boilerplate of simple test code\n  _LT_COMPILER_BOILERPLATE\n  _LT_LINKER_BOILERPLATE\n\n  # Allow CC to be a program name with arguments.\n  lt_save_CC=$CC\n  lt_save_GCC=$GCC\n  lt_save_CFLAGS=$CFLAGS\n  CC=${FC-\"f95\"}\n  CFLAGS=$FCFLAGS\n  compiler=$CC\n  GCC=$ac_cv_fc_compiler_gnu\n\n  _LT_TAGVAR(compiler, $1)=$CC\n  _LT_CC_BASENAME([$compiler])\n\n  if test -n \"$compiler\"; then\n    AC_MSG_CHECKING([if libtool supports shared libraries])\n    AC_MSG_RESULT([$can_build_shared])\n\n    AC_MSG_CHECKING([whether to build shared libraries])\n    test no = \"$can_build_shared\" && enable_shared=no\n\n    # On AIX, shared libraries and static libraries use the same namespace, and\n    # are all built from PIC.\n    case $host_os in\n      aix3*)\n        test yes = \"$enable_shared\" && enable_static=no\n        if test -n \"$RANLIB\"; then\n          archive_cmds=\"$archive_cmds~\\$RANLIB \\$lib\"\n          postinstall_cmds='$RANLIB $lib'\n        fi\n        ;;\n      aix[[4-9]]*)\n\tif test ia64 != \"$host_cpu\"; then\n\t  case $enable_shared,$with_aix_soname,$aix_use_runtimelinking in\n\t  yes,aix,yes) ;;\t\t# shared object as lib.so file only\n\t  yes,svr4,*) ;;\t\t# shared object as lib.so archive member only\n\t  yes,*) enable_static=no ;;\t# shared object in lib.a archive as well\n\t  esac\n\tfi\n        ;;\n    esac\n    AC_MSG_RESULT([$enable_shared])\n\n    AC_MSG_CHECKING([whether to build static libraries])\n    # Make sure either enable_shared or enable_static is yes.\n    test yes = \"$enable_shared\" || enable_static=yes\n    AC_MSG_RESULT([$enable_static])\n\n    _LT_TAGVAR(GCC, $1)=$ac_cv_fc_compiler_gnu\n    _LT_TAGVAR(LD, $1)=$LD\n\n    ## CAVEAT EMPTOR:\n    ## There is no encapsulation within the following macros, do not change\n    ## the running order or otherwise move them around unless you know exactly\n    ## what you are doing...\n    _LT_SYS_HIDDEN_LIBDEPS($1)\n    _LT_COMPILER_PIC($1)\n    _LT_COMPILER_C_O($1)\n    _LT_COMPILER_FILE_LOCKS($1)\n    _LT_LINKER_SHLIBS($1)\n    _LT_SYS_DYNAMIC_LINKER($1)\n    _LT_LINKER_HARDCODE_LIBPATH($1)\n\n    _LT_CONFIG($1)\n  fi # test -n \"$compiler\"\n\n  GCC=$lt_save_GCC\n  CC=$lt_save_CC\n  CFLAGS=$lt_save_CFLAGS\nfi # test yes != \"$_lt_disable_FC\"\n\nAC_LANG_POP\n])# _LT_LANG_FC_CONFIG\n\n\n# _LT_LANG_GCJ_CONFIG([TAG])\n# --------------------------\n# Ensure that the configuration variables for the GNU Java Compiler compiler\n# are suitably defined.  These variables are subsequently used by _LT_CONFIG\n# to write the compiler configuration to 'libtool'.\nm4_defun([_LT_LANG_GCJ_CONFIG],\n[AC_REQUIRE([LT_PROG_GCJ])dnl\nAC_LANG_SAVE\n\n# Source file extension for Java test sources.\nac_ext=java\n\n# Object file extension for compiled Java test sources.\nobjext=o\n_LT_TAGVAR(objext, $1)=$objext\n\n# Code to be used in simple compile tests\nlt_simple_compile_test_code=\"class foo {}\"\n\n# Code to be used in simple link tests\nlt_simple_link_test_code='public class conftest { public static void main(String[[]] argv) {}; }'\n\n# ltmain only uses $CC for tagged configurations so make sure $CC is set.\n_LT_TAG_COMPILER\n\n# save warnings/boilerplate of simple test code\n_LT_COMPILER_BOILERPLATE\n_LT_LINKER_BOILERPLATE\n\n# Allow CC to be a program name with arguments.\nlt_save_CC=$CC\nlt_save_CFLAGS=$CFLAGS\nlt_save_GCC=$GCC\nGCC=yes\nCC=${GCJ-\"gcj\"}\nCFLAGS=$GCJFLAGS\ncompiler=$CC\n_LT_TAGVAR(compiler, $1)=$CC\n_LT_TAGVAR(LD, $1)=$LD\n_LT_CC_BASENAME([$compiler])\n\n# GCJ did not exist at the time GCC didn't implicitly link libc in.\n_LT_TAGVAR(archive_cmds_need_lc, $1)=no\n\n_LT_TAGVAR(old_archive_cmds, $1)=$old_archive_cmds\n_LT_TAGVAR(reload_flag, $1)=$reload_flag\n_LT_TAGVAR(reload_cmds, $1)=$reload_cmds\n\n## CAVEAT EMPTOR:\n## There is no encapsulation within the following macros, do not change\n## the running order or otherwise move them around unless you know exactly\n## what you are doing...\nif test -n \"$compiler\"; then\n  _LT_COMPILER_NO_RTTI($1)\n  _LT_COMPILER_PIC($1)\n  _LT_COMPILER_C_O($1)\n  _LT_COMPILER_FILE_LOCKS($1)\n  _LT_LINKER_SHLIBS($1)\n  _LT_LINKER_HARDCODE_LIBPATH($1)\n\n  _LT_CONFIG($1)\nfi\n\nAC_LANG_RESTORE\n\nGCC=$lt_save_GCC\nCC=$lt_save_CC\nCFLAGS=$lt_save_CFLAGS\n])# _LT_LANG_GCJ_CONFIG\n\n\n# _LT_LANG_GO_CONFIG([TAG])\n# --------------------------\n# Ensure that the configuration variables for the GNU Go compiler\n# are suitably defined.  These variables are subsequently used by _LT_CONFIG\n# to write the compiler configuration to 'libtool'.\nm4_defun([_LT_LANG_GO_CONFIG],\n[AC_REQUIRE([LT_PROG_GO])dnl\nAC_LANG_SAVE\n\n# Source file extension for Go test sources.\nac_ext=go\n\n# Object file extension for compiled Go test sources.\nobjext=o\n_LT_TAGVAR(objext, $1)=$objext\n\n# Code to be used in simple compile tests\nlt_simple_compile_test_code=\"package main; func main() { }\"\n\n# Code to be used in simple link tests\nlt_simple_link_test_code='package main; func main() { }'\n\n# ltmain only uses $CC for tagged configurations so make sure $CC is set.\n_LT_TAG_COMPILER\n\n# save warnings/boilerplate of simple test code\n_LT_COMPILER_BOILERPLATE\n_LT_LINKER_BOILERPLATE\n\n# Allow CC to be a program name with arguments.\nlt_save_CC=$CC\nlt_save_CFLAGS=$CFLAGS\nlt_save_GCC=$GCC\nGCC=yes\nCC=${GOC-\"gccgo\"}\nCFLAGS=$GOFLAGS\ncompiler=$CC\n_LT_TAGVAR(compiler, $1)=$CC\n_LT_TAGVAR(LD, $1)=$LD\n_LT_CC_BASENAME([$compiler])\n\n# Go did not exist at the time GCC didn't implicitly link libc in.\n_LT_TAGVAR(archive_cmds_need_lc, $1)=no\n\n_LT_TAGVAR(old_archive_cmds, $1)=$old_archive_cmds\n_LT_TAGVAR(reload_flag, $1)=$reload_flag\n_LT_TAGVAR(reload_cmds, $1)=$reload_cmds\n\n## CAVEAT EMPTOR:\n## There is no encapsulation within the following macros, do not change\n## the running order or otherwise move them around unless you know exactly\n## what you are doing...\nif test -n \"$compiler\"; then\n  _LT_COMPILER_NO_RTTI($1)\n  _LT_COMPILER_PIC($1)\n  _LT_COMPILER_C_O($1)\n  _LT_COMPILER_FILE_LOCKS($1)\n  _LT_LINKER_SHLIBS($1)\n  _LT_LINKER_HARDCODE_LIBPATH($1)\n\n  _LT_CONFIG($1)\nfi\n\nAC_LANG_RESTORE\n\nGCC=$lt_save_GCC\nCC=$lt_save_CC\nCFLAGS=$lt_save_CFLAGS\n])# _LT_LANG_GO_CONFIG\n\n\n# _LT_LANG_RC_CONFIG([TAG])\n# -------------------------\n# Ensure that the configuration variables for the Windows resource compiler\n# are suitably defined.  These variables are subsequently used by _LT_CONFIG\n# to write the compiler configuration to 'libtool'.\nm4_defun([_LT_LANG_RC_CONFIG],\n[AC_REQUIRE([LT_PROG_RC])dnl\nAC_LANG_SAVE\n\n# Source file extension for RC test sources.\nac_ext=rc\n\n# Object file extension for compiled RC test sources.\nobjext=o\n_LT_TAGVAR(objext, $1)=$objext\n\n# Code to be used in simple compile tests\nlt_simple_compile_test_code='sample MENU { MENUITEM \"&Soup\", 100, CHECKED }'\n\n# Code to be used in simple link tests\nlt_simple_link_test_code=$lt_simple_compile_test_code\n\n# ltmain only uses $CC for tagged configurations so make sure $CC is set.\n_LT_TAG_COMPILER\n\n# save warnings/boilerplate of simple test code\n_LT_COMPILER_BOILERPLATE\n_LT_LINKER_BOILERPLATE\n\n# Allow CC to be a program name with arguments.\nlt_save_CC=$CC\nlt_save_CFLAGS=$CFLAGS\nlt_save_GCC=$GCC\nGCC=\nCC=${RC-\"windres\"}\nCFLAGS=\ncompiler=$CC\n_LT_TAGVAR(compiler, $1)=$CC\n_LT_CC_BASENAME([$compiler])\n_LT_TAGVAR(lt_cv_prog_compiler_c_o, $1)=yes\n\nif test -n \"$compiler\"; then\n  :\n  _LT_CONFIG($1)\nfi\n\nGCC=$lt_save_GCC\nAC_LANG_RESTORE\nCC=$lt_save_CC\nCFLAGS=$lt_save_CFLAGS\n])# _LT_LANG_RC_CONFIG\n\n\n# LT_PROG_GCJ\n# -----------\nAC_DEFUN([LT_PROG_GCJ],\n[m4_ifdef([AC_PROG_GCJ], [AC_PROG_GCJ],\n  [m4_ifdef([A][M_PROG_GCJ], [A][M_PROG_GCJ],\n    [AC_CHECK_TOOL(GCJ, gcj,)\n      test set = \"${GCJFLAGS+set}\" || GCJFLAGS=\"-g -O2\"\n      AC_SUBST(GCJFLAGS)])])[]dnl\n])\n\n# Old name:\nAU_ALIAS([LT_AC_PROG_GCJ], [LT_PROG_GCJ])\ndnl aclocal-1.4 backwards compatibility:\ndnl AC_DEFUN([LT_AC_PROG_GCJ], [])\n\n\n# LT_PROG_GO\n# ----------\nAC_DEFUN([LT_PROG_GO],\n[AC_CHECK_TOOL(GOC, gccgo,)\n])\n\n\n# LT_PROG_RC\n# ----------\nAC_DEFUN([LT_PROG_RC],\n[AC_CHECK_TOOL(RC, windres,)\n])\n\n# Old name:\nAU_ALIAS([LT_AC_PROG_RC], [LT_PROG_RC])\ndnl aclocal-1.4 backwards compatibility:\ndnl AC_DEFUN([LT_AC_PROG_RC], [])\n\n\n# _LT_DECL_EGREP\n# --------------\n# If we don't have a new enough Autoconf to choose the best grep\n# available, choose the one first in the user's PATH.\nm4_defun([_LT_DECL_EGREP],\n[AC_REQUIRE([AC_PROG_EGREP])dnl\nAC_REQUIRE([AC_PROG_FGREP])dnl\ntest -z \"$GREP\" && GREP=grep\n_LT_DECL([], [GREP], [1], [A grep program that handles long lines])\n_LT_DECL([], [EGREP], [1], [An ERE matcher])\n_LT_DECL([], [FGREP], [1], [A literal string matcher])\ndnl Non-bleeding-edge autoconf doesn't subst GREP, so do it here too\nAC_SUBST([GREP])\n])\n\n\n# _LT_DECL_OBJDUMP\n# --------------\n# If we don't have a new enough Autoconf to choose the best objdump\n# available, choose the one first in the user's PATH.\nm4_defun([_LT_DECL_OBJDUMP],\n[AC_CHECK_TOOL(OBJDUMP, objdump, false)\ntest -z \"$OBJDUMP\" && OBJDUMP=objdump\n_LT_DECL([], [OBJDUMP], [1], [An object symbol dumper])\nAC_SUBST([OBJDUMP])\n])\n\n# _LT_DECL_DLLTOOL\n# ----------------\n# Ensure DLLTOOL variable is set.\nm4_defun([_LT_DECL_DLLTOOL],\n[AC_CHECK_TOOL(DLLTOOL, dlltool, false)\ntest -z \"$DLLTOOL\" && DLLTOOL=dlltool\n_LT_DECL([], [DLLTOOL], [1], [DLL creation program])\nAC_SUBST([DLLTOOL])\n])\n\n# _LT_DECL_SED\n# ------------\n# Check for a fully-functional sed program, that truncates\n# as few characters as possible.  Prefer GNU sed if found.\nm4_defun([_LT_DECL_SED],\n[AC_PROG_SED\ntest -z \"$SED\" && SED=sed\nXsed=\"$SED -e 1s/^X//\"\n_LT_DECL([], [SED], [1], [A sed program that does not truncate output])\n_LT_DECL([], [Xsed], [\"\\$SED -e 1s/^X//\"],\n    [Sed that helps us avoid accidentally triggering echo(1) options like -n])\n])# _LT_DECL_SED\n\nm4_ifndef([AC_PROG_SED], [\n############################################################\n# NOTE: This macro has been submitted for inclusion into   #\n#  GNU Autoconf as AC_PROG_SED.  When it is available in   #\n#  a released version of Autoconf we should remove this    #\n#  macro and use it instead.                               #\n############################################################\n\nm4_defun([AC_PROG_SED],\n[AC_MSG_CHECKING([for a sed that does not truncate output])\nAC_CACHE_VAL(lt_cv_path_SED,\n[# Loop through the user's path and test for sed and gsed.\n# Then use that list of sed's as ones to test for truncation.\nas_save_IFS=$IFS; IFS=$PATH_SEPARATOR\nfor as_dir in $PATH\ndo\n  IFS=$as_save_IFS\n  test -z \"$as_dir\" && as_dir=.\n  for lt_ac_prog in sed gsed; do\n    for ac_exec_ext in '' $ac_executable_extensions; do\n      if $as_executable_p \"$as_dir/$lt_ac_prog$ac_exec_ext\"; then\n        lt_ac_sed_list=\"$lt_ac_sed_list $as_dir/$lt_ac_prog$ac_exec_ext\"\n      fi\n    done\n  done\ndone\nIFS=$as_save_IFS\nlt_ac_max=0\nlt_ac_count=0\n# Add /usr/xpg4/bin/sed as it is typically found on Solaris\n# along with /bin/sed that truncates output.\nfor lt_ac_sed in $lt_ac_sed_list /usr/xpg4/bin/sed; do\n  test ! -f \"$lt_ac_sed\" && continue\n  cat /dev/null > conftest.in\n  lt_ac_count=0\n  echo $ECHO_N \"0123456789$ECHO_C\" >conftest.in\n  # Check for GNU sed and select it if it is found.\n  if \"$lt_ac_sed\" --version 2>&1 < /dev/null | grep 'GNU' > /dev/null; then\n    lt_cv_path_SED=$lt_ac_sed\n    break\n  fi\n  while true; do\n    cat conftest.in conftest.in >conftest.tmp\n    mv conftest.tmp conftest.in\n    cp conftest.in conftest.nl\n    echo >>conftest.nl\n    $lt_ac_sed -e 's/a$//' < conftest.nl >conftest.out || break\n    cmp -s conftest.out conftest.nl || break\n    # 10000 chars as input seems more than enough\n    test 10 -lt \"$lt_ac_count\" && break\n    lt_ac_count=`expr $lt_ac_count + 1`\n    if test \"$lt_ac_count\" -gt \"$lt_ac_max\"; then\n      lt_ac_max=$lt_ac_count\n      lt_cv_path_SED=$lt_ac_sed\n    fi\n  done\ndone\n])\nSED=$lt_cv_path_SED\nAC_SUBST([SED])\nAC_MSG_RESULT([$SED])\n])#AC_PROG_SED\n])#m4_ifndef\n\n# Old name:\nAU_ALIAS([LT_AC_PROG_SED], [AC_PROG_SED])\ndnl aclocal-1.4 backwards compatibility:\ndnl AC_DEFUN([LT_AC_PROG_SED], [])\n\n\n# _LT_CHECK_SHELL_FEATURES\n# ------------------------\n# Find out whether the shell is Bourne or XSI compatible,\n# or has some other useful features.\nm4_defun([_LT_CHECK_SHELL_FEATURES],\n[if ( (MAIL=60; unset MAIL) || exit) >/dev/null 2>&1; then\n  lt_unset=unset\nelse\n  lt_unset=false\nfi\n_LT_DECL([], [lt_unset], [0], [whether the shell understands \"unset\"])dnl\n\n# test EBCDIC or ASCII\ncase `echo X|tr X '\\101'` in\n A) # ASCII based system\n    # \\n is not interpreted correctly by Solaris 8 /usr/ucb/tr\n  lt_SP2NL='tr \\040 \\012'\n  lt_NL2SP='tr \\015\\012 \\040\\040'\n  ;;\n *) # EBCDIC based system\n  lt_SP2NL='tr \\100 \\n'\n  lt_NL2SP='tr \\r\\n \\100\\100'\n  ;;\nesac\n_LT_DECL([SP2NL], [lt_SP2NL], [1], [turn spaces into newlines])dnl\n_LT_DECL([NL2SP], [lt_NL2SP], [1], [turn newlines into spaces])dnl\n])# _LT_CHECK_SHELL_FEATURES\n\n\n# _LT_PATH_CONVERSION_FUNCTIONS\n# -----------------------------\n# Determine what file name conversion functions should be used by\n# func_to_host_file (and, implicitly, by func_to_host_path).  These are needed\n# for certain cross-compile configurations and native mingw.\nm4_defun([_LT_PATH_CONVERSION_FUNCTIONS],\n[AC_REQUIRE([AC_CANONICAL_HOST])dnl\nAC_REQUIRE([AC_CANONICAL_BUILD])dnl\nAC_MSG_CHECKING([how to convert $build file names to $host format])\nAC_CACHE_VAL(lt_cv_to_host_file_cmd,\n[case $host in\n  *-*-mingw* )\n    case $build in\n      *-*-mingw* ) # actually msys\n        lt_cv_to_host_file_cmd=func_convert_file_msys_to_w32\n        ;;\n      *-*-cygwin* )\n        lt_cv_to_host_file_cmd=func_convert_file_cygwin_to_w32\n        ;;\n      * ) # otherwise, assume *nix\n        lt_cv_to_host_file_cmd=func_convert_file_nix_to_w32\n        ;;\n    esac\n    ;;\n  *-*-cygwin* )\n    case $build in\n      *-*-mingw* ) # actually msys\n        lt_cv_to_host_file_cmd=func_convert_file_msys_to_cygwin\n        ;;\n      *-*-cygwin* )\n        lt_cv_to_host_file_cmd=func_convert_file_noop\n        ;;\n      * ) # otherwise, assume *nix\n        lt_cv_to_host_file_cmd=func_convert_file_nix_to_cygwin\n        ;;\n    esac\n    ;;\n  * ) # unhandled hosts (and \"normal\" native builds)\n    lt_cv_to_host_file_cmd=func_convert_file_noop\n    ;;\nesac\n])\nto_host_file_cmd=$lt_cv_to_host_file_cmd\nAC_MSG_RESULT([$lt_cv_to_host_file_cmd])\n_LT_DECL([to_host_file_cmd], [lt_cv_to_host_file_cmd],\n         [0], [convert $build file names to $host format])dnl\n\nAC_MSG_CHECKING([how to convert $build file names to toolchain format])\nAC_CACHE_VAL(lt_cv_to_tool_file_cmd,\n[#assume ordinary cross tools, or native build.\nlt_cv_to_tool_file_cmd=func_convert_file_noop\ncase $host in\n  *-*-mingw* )\n    case $build in\n      *-*-mingw* ) # actually msys\n        lt_cv_to_tool_file_cmd=func_convert_file_msys_to_w32\n        ;;\n    esac\n    ;;\nesac\n])\nto_tool_file_cmd=$lt_cv_to_tool_file_cmd\nAC_MSG_RESULT([$lt_cv_to_tool_file_cmd])\n_LT_DECL([to_tool_file_cmd], [lt_cv_to_tool_file_cmd],\n         [0], [convert $build files to toolchain format])dnl\n])# _LT_PATH_CONVERSION_FUNCTIONS\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/m4/ltoptions.m4",
    "content": "# Helper functions for option handling.                    -*- Autoconf -*-\n#\n#   Copyright (C) 2004-2005, 2007-2009, 2011-2015 Free Software\n#   Foundation, Inc.\n#   Written by Gary V. Vaughan, 2004\n#\n# This file is free software; the Free Software Foundation gives\n# unlimited permission to copy and/or distribute it, with or without\n# modifications, as long as this notice is preserved.\n\n# serial 8 ltoptions.m4\n\n# This is to help aclocal find these macros, as it can't see m4_define.\nAC_DEFUN([LTOPTIONS_VERSION], [m4_if([1])])\n\n\n# _LT_MANGLE_OPTION(MACRO-NAME, OPTION-NAME)\n# ------------------------------------------\nm4_define([_LT_MANGLE_OPTION],\n[[_LT_OPTION_]m4_bpatsubst($1__$2, [[^a-zA-Z0-9_]], [_])])\n\n\n# _LT_SET_OPTION(MACRO-NAME, OPTION-NAME)\n# ---------------------------------------\n# Set option OPTION-NAME for macro MACRO-NAME, and if there is a\n# matching handler defined, dispatch to it.  Other OPTION-NAMEs are\n# saved as a flag.\nm4_define([_LT_SET_OPTION],\n[m4_define(_LT_MANGLE_OPTION([$1], [$2]))dnl\nm4_ifdef(_LT_MANGLE_DEFUN([$1], [$2]),\n        _LT_MANGLE_DEFUN([$1], [$2]),\n    [m4_warning([Unknown $1 option '$2'])])[]dnl\n])\n\n\n# _LT_IF_OPTION(MACRO-NAME, OPTION-NAME, IF-SET, [IF-NOT-SET])\n# ------------------------------------------------------------\n# Execute IF-SET if OPTION is set, IF-NOT-SET otherwise.\nm4_define([_LT_IF_OPTION],\n[m4_ifdef(_LT_MANGLE_OPTION([$1], [$2]), [$3], [$4])])\n\n\n# _LT_UNLESS_OPTIONS(MACRO-NAME, OPTION-LIST, IF-NOT-SET)\n# -------------------------------------------------------\n# Execute IF-NOT-SET unless all options in OPTION-LIST for MACRO-NAME\n# are set.\nm4_define([_LT_UNLESS_OPTIONS],\n[m4_foreach([_LT_Option], m4_split(m4_normalize([$2])),\n\t    [m4_ifdef(_LT_MANGLE_OPTION([$1], _LT_Option),\n\t\t      [m4_define([$0_found])])])[]dnl\nm4_ifdef([$0_found], [m4_undefine([$0_found])], [$3\n])[]dnl\n])\n\n\n# _LT_SET_OPTIONS(MACRO-NAME, OPTION-LIST)\n# ----------------------------------------\n# OPTION-LIST is a space-separated list of Libtool options associated\n# with MACRO-NAME.  If any OPTION has a matching handler declared with\n# LT_OPTION_DEFINE, dispatch to that macro; otherwise complain about\n# the unknown option and exit.\nm4_defun([_LT_SET_OPTIONS],\n[# Set options\nm4_foreach([_LT_Option], m4_split(m4_normalize([$2])),\n    [_LT_SET_OPTION([$1], _LT_Option)])\n\nm4_if([$1],[LT_INIT],[\n  dnl\n  dnl Simply set some default values (i.e off) if boolean options were not\n  dnl specified:\n  _LT_UNLESS_OPTIONS([LT_INIT], [dlopen], [enable_dlopen=no\n  ])\n  _LT_UNLESS_OPTIONS([LT_INIT], [win32-dll], [enable_win32_dll=no\n  ])\n  dnl\n  dnl If no reference was made to various pairs of opposing options, then\n  dnl we run the default mode handler for the pair.  For example, if neither\n  dnl 'shared' nor 'disable-shared' was passed, we enable building of shared\n  dnl archives by default:\n  _LT_UNLESS_OPTIONS([LT_INIT], [shared disable-shared], [_LT_ENABLE_SHARED])\n  _LT_UNLESS_OPTIONS([LT_INIT], [static disable-static], [_LT_ENABLE_STATIC])\n  _LT_UNLESS_OPTIONS([LT_INIT], [pic-only no-pic], [_LT_WITH_PIC])\n  _LT_UNLESS_OPTIONS([LT_INIT], [fast-install disable-fast-install],\n\t\t   [_LT_ENABLE_FAST_INSTALL])\n  _LT_UNLESS_OPTIONS([LT_INIT], [aix-soname=aix aix-soname=both aix-soname=svr4],\n\t\t   [_LT_WITH_AIX_SONAME([aix])])\n  ])\n])# _LT_SET_OPTIONS\n\n\n## --------------------------------- ##\n## Macros to handle LT_INIT options. ##\n## --------------------------------- ##\n\n# _LT_MANGLE_DEFUN(MACRO-NAME, OPTION-NAME)\n# -----------------------------------------\nm4_define([_LT_MANGLE_DEFUN],\n[[_LT_OPTION_DEFUN_]m4_bpatsubst(m4_toupper([$1__$2]), [[^A-Z0-9_]], [_])])\n\n\n# LT_OPTION_DEFINE(MACRO-NAME, OPTION-NAME, CODE)\n# -----------------------------------------------\nm4_define([LT_OPTION_DEFINE],\n[m4_define(_LT_MANGLE_DEFUN([$1], [$2]), [$3])[]dnl\n])# LT_OPTION_DEFINE\n\n\n# dlopen\n# ------\nLT_OPTION_DEFINE([LT_INIT], [dlopen], [enable_dlopen=yes\n])\n\nAU_DEFUN([AC_LIBTOOL_DLOPEN],\n[_LT_SET_OPTION([LT_INIT], [dlopen])\nAC_DIAGNOSE([obsolete],\n[$0: Remove this warning and the call to _LT_SET_OPTION when you\nput the 'dlopen' option into LT_INIT's first parameter.])\n])\n\ndnl aclocal-1.4 backwards compatibility:\ndnl AC_DEFUN([AC_LIBTOOL_DLOPEN], [])\n\n\n# win32-dll\n# ---------\n# Declare package support for building win32 dll's.\nLT_OPTION_DEFINE([LT_INIT], [win32-dll],\n[enable_win32_dll=yes\n\ncase $host in\n*-*-cygwin* | *-*-mingw* | *-*-pw32* | *-*-cegcc*)\n  AC_CHECK_TOOL(AS, as, false)\n  AC_CHECK_TOOL(DLLTOOL, dlltool, false)\n  AC_CHECK_TOOL(OBJDUMP, objdump, false)\n  ;;\nesac\n\ntest -z \"$AS\" && AS=as\n_LT_DECL([], [AS],      [1], [Assembler program])dnl\n\ntest -z \"$DLLTOOL\" && DLLTOOL=dlltool\n_LT_DECL([], [DLLTOOL], [1], [DLL creation program])dnl\n\ntest -z \"$OBJDUMP\" && OBJDUMP=objdump\n_LT_DECL([], [OBJDUMP], [1], [Object dumper program])dnl\n])# win32-dll\n\nAU_DEFUN([AC_LIBTOOL_WIN32_DLL],\n[AC_REQUIRE([AC_CANONICAL_HOST])dnl\n_LT_SET_OPTION([LT_INIT], [win32-dll])\nAC_DIAGNOSE([obsolete],\n[$0: Remove this warning and the call to _LT_SET_OPTION when you\nput the 'win32-dll' option into LT_INIT's first parameter.])\n])\n\ndnl aclocal-1.4 backwards compatibility:\ndnl AC_DEFUN([AC_LIBTOOL_WIN32_DLL], [])\n\n\n# _LT_ENABLE_SHARED([DEFAULT])\n# ----------------------------\n# implement the --enable-shared flag, and supports the 'shared' and\n# 'disable-shared' LT_INIT options.\n# DEFAULT is either 'yes' or 'no'.  If omitted, it defaults to 'yes'.\nm4_define([_LT_ENABLE_SHARED],\n[m4_define([_LT_ENABLE_SHARED_DEFAULT], [m4_if($1, no, no, yes)])dnl\nAC_ARG_ENABLE([shared],\n    [AS_HELP_STRING([--enable-shared@<:@=PKGS@:>@],\n\t[build shared libraries @<:@default=]_LT_ENABLE_SHARED_DEFAULT[@:>@])],\n    [p=${PACKAGE-default}\n    case $enableval in\n    yes) enable_shared=yes ;;\n    no) enable_shared=no ;;\n    *)\n      enable_shared=no\n      # Look at the argument we got.  We use all the common list separators.\n      lt_save_ifs=$IFS; IFS=$IFS$PATH_SEPARATOR,\n      for pkg in $enableval; do\n\tIFS=$lt_save_ifs\n\tif test \"X$pkg\" = \"X$p\"; then\n\t  enable_shared=yes\n\tfi\n      done\n      IFS=$lt_save_ifs\n      ;;\n    esac],\n    [enable_shared=]_LT_ENABLE_SHARED_DEFAULT)\n\n    _LT_DECL([build_libtool_libs], [enable_shared], [0],\n\t[Whether or not to build shared libraries])\n])# _LT_ENABLE_SHARED\n\nLT_OPTION_DEFINE([LT_INIT], [shared], [_LT_ENABLE_SHARED([yes])])\nLT_OPTION_DEFINE([LT_INIT], [disable-shared], [_LT_ENABLE_SHARED([no])])\n\n# Old names:\nAC_DEFUN([AC_ENABLE_SHARED],\n[_LT_SET_OPTION([LT_INIT], m4_if([$1], [no], [disable-])[shared])\n])\n\nAC_DEFUN([AC_DISABLE_SHARED],\n[_LT_SET_OPTION([LT_INIT], [disable-shared])\n])\n\nAU_DEFUN([AM_ENABLE_SHARED], [AC_ENABLE_SHARED($@)])\nAU_DEFUN([AM_DISABLE_SHARED], [AC_DISABLE_SHARED($@)])\n\ndnl aclocal-1.4 backwards compatibility:\ndnl AC_DEFUN([AM_ENABLE_SHARED], [])\ndnl AC_DEFUN([AM_DISABLE_SHARED], [])\n\n\n\n# _LT_ENABLE_STATIC([DEFAULT])\n# ----------------------------\n# implement the --enable-static flag, and support the 'static' and\n# 'disable-static' LT_INIT options.\n# DEFAULT is either 'yes' or 'no'.  If omitted, it defaults to 'yes'.\nm4_define([_LT_ENABLE_STATIC],\n[m4_define([_LT_ENABLE_STATIC_DEFAULT], [m4_if($1, no, no, yes)])dnl\nAC_ARG_ENABLE([static],\n    [AS_HELP_STRING([--enable-static@<:@=PKGS@:>@],\n\t[build static libraries @<:@default=]_LT_ENABLE_STATIC_DEFAULT[@:>@])],\n    [p=${PACKAGE-default}\n    case $enableval in\n    yes) enable_static=yes ;;\n    no) enable_static=no ;;\n    *)\n     enable_static=no\n      # Look at the argument we got.  We use all the common list separators.\n      lt_save_ifs=$IFS; IFS=$IFS$PATH_SEPARATOR,\n      for pkg in $enableval; do\n\tIFS=$lt_save_ifs\n\tif test \"X$pkg\" = \"X$p\"; then\n\t  enable_static=yes\n\tfi\n      done\n      IFS=$lt_save_ifs\n      ;;\n    esac],\n    [enable_static=]_LT_ENABLE_STATIC_DEFAULT)\n\n    _LT_DECL([build_old_libs], [enable_static], [0],\n\t[Whether or not to build static libraries])\n])# _LT_ENABLE_STATIC\n\nLT_OPTION_DEFINE([LT_INIT], [static], [_LT_ENABLE_STATIC([yes])])\nLT_OPTION_DEFINE([LT_INIT], [disable-static], [_LT_ENABLE_STATIC([no])])\n\n# Old names:\nAC_DEFUN([AC_ENABLE_STATIC],\n[_LT_SET_OPTION([LT_INIT], m4_if([$1], [no], [disable-])[static])\n])\n\nAC_DEFUN([AC_DISABLE_STATIC],\n[_LT_SET_OPTION([LT_INIT], [disable-static])\n])\n\nAU_DEFUN([AM_ENABLE_STATIC], [AC_ENABLE_STATIC($@)])\nAU_DEFUN([AM_DISABLE_STATIC], [AC_DISABLE_STATIC($@)])\n\ndnl aclocal-1.4 backwards compatibility:\ndnl AC_DEFUN([AM_ENABLE_STATIC], [])\ndnl AC_DEFUN([AM_DISABLE_STATIC], [])\n\n\n\n# _LT_ENABLE_FAST_INSTALL([DEFAULT])\n# ----------------------------------\n# implement the --enable-fast-install flag, and support the 'fast-install'\n# and 'disable-fast-install' LT_INIT options.\n# DEFAULT is either 'yes' or 'no'.  If omitted, it defaults to 'yes'.\nm4_define([_LT_ENABLE_FAST_INSTALL],\n[m4_define([_LT_ENABLE_FAST_INSTALL_DEFAULT], [m4_if($1, no, no, yes)])dnl\nAC_ARG_ENABLE([fast-install],\n    [AS_HELP_STRING([--enable-fast-install@<:@=PKGS@:>@],\n    [optimize for fast installation @<:@default=]_LT_ENABLE_FAST_INSTALL_DEFAULT[@:>@])],\n    [p=${PACKAGE-default}\n    case $enableval in\n    yes) enable_fast_install=yes ;;\n    no) enable_fast_install=no ;;\n    *)\n      enable_fast_install=no\n      # Look at the argument we got.  We use all the common list separators.\n      lt_save_ifs=$IFS; IFS=$IFS$PATH_SEPARATOR,\n      for pkg in $enableval; do\n\tIFS=$lt_save_ifs\n\tif test \"X$pkg\" = \"X$p\"; then\n\t  enable_fast_install=yes\n\tfi\n      done\n      IFS=$lt_save_ifs\n      ;;\n    esac],\n    [enable_fast_install=]_LT_ENABLE_FAST_INSTALL_DEFAULT)\n\n_LT_DECL([fast_install], [enable_fast_install], [0],\n\t [Whether or not to optimize for fast installation])dnl\n])# _LT_ENABLE_FAST_INSTALL\n\nLT_OPTION_DEFINE([LT_INIT], [fast-install], [_LT_ENABLE_FAST_INSTALL([yes])])\nLT_OPTION_DEFINE([LT_INIT], [disable-fast-install], [_LT_ENABLE_FAST_INSTALL([no])])\n\n# Old names:\nAU_DEFUN([AC_ENABLE_FAST_INSTALL],\n[_LT_SET_OPTION([LT_INIT], m4_if([$1], [no], [disable-])[fast-install])\nAC_DIAGNOSE([obsolete],\n[$0: Remove this warning and the call to _LT_SET_OPTION when you put\nthe 'fast-install' option into LT_INIT's first parameter.])\n])\n\nAU_DEFUN([AC_DISABLE_FAST_INSTALL],\n[_LT_SET_OPTION([LT_INIT], [disable-fast-install])\nAC_DIAGNOSE([obsolete],\n[$0: Remove this warning and the call to _LT_SET_OPTION when you put\nthe 'disable-fast-install' option into LT_INIT's first parameter.])\n])\n\ndnl aclocal-1.4 backwards compatibility:\ndnl AC_DEFUN([AC_ENABLE_FAST_INSTALL], [])\ndnl AC_DEFUN([AM_DISABLE_FAST_INSTALL], [])\n\n\n# _LT_WITH_AIX_SONAME([DEFAULT])\n# ----------------------------------\n# implement the --with-aix-soname flag, and support the `aix-soname=aix'\n# and `aix-soname=both' and `aix-soname=svr4' LT_INIT options. DEFAULT\n# is either `aix', `both' or `svr4'.  If omitted, it defaults to `aix'.\nm4_define([_LT_WITH_AIX_SONAME],\n[m4_define([_LT_WITH_AIX_SONAME_DEFAULT], [m4_if($1, svr4, svr4, m4_if($1, both, both, aix))])dnl\nshared_archive_member_spec=\ncase $host,$enable_shared in\npower*-*-aix[[5-9]]*,yes)\n  AC_MSG_CHECKING([which variant of shared library versioning to provide])\n  AC_ARG_WITH([aix-soname],\n    [AS_HELP_STRING([--with-aix-soname=aix|svr4|both],\n      [shared library versioning (aka \"SONAME\") variant to provide on AIX, @<:@default=]_LT_WITH_AIX_SONAME_DEFAULT[@:>@.])],\n    [case $withval in\n    aix|svr4|both)\n      ;;\n    *)\n      AC_MSG_ERROR([Unknown argument to --with-aix-soname])\n      ;;\n    esac\n    lt_cv_with_aix_soname=$with_aix_soname],\n    [AC_CACHE_VAL([lt_cv_with_aix_soname],\n      [lt_cv_with_aix_soname=]_LT_WITH_AIX_SONAME_DEFAULT)\n    with_aix_soname=$lt_cv_with_aix_soname])\n  AC_MSG_RESULT([$with_aix_soname])\n  if test aix != \"$with_aix_soname\"; then\n    # For the AIX way of multilib, we name the shared archive member\n    # based on the bitwidth used, traditionally 'shr.o' or 'shr_64.o',\n    # and 'shr.imp' or 'shr_64.imp', respectively, for the Import File.\n    # Even when GNU compilers ignore OBJECT_MODE but need '-maix64' flag,\n    # the AIX toolchain works better with OBJECT_MODE set (default 32).\n    if test 64 = \"${OBJECT_MODE-32}\"; then\n      shared_archive_member_spec=shr_64\n    else\n      shared_archive_member_spec=shr\n    fi\n  fi\n  ;;\n*)\n  with_aix_soname=aix\n  ;;\nesac\n\n_LT_DECL([], [shared_archive_member_spec], [0],\n    [Shared archive member basename, for filename based shared library versioning on AIX])dnl\n])# _LT_WITH_AIX_SONAME\n\nLT_OPTION_DEFINE([LT_INIT], [aix-soname=aix], [_LT_WITH_AIX_SONAME([aix])])\nLT_OPTION_DEFINE([LT_INIT], [aix-soname=both], [_LT_WITH_AIX_SONAME([both])])\nLT_OPTION_DEFINE([LT_INIT], [aix-soname=svr4], [_LT_WITH_AIX_SONAME([svr4])])\n\n\n# _LT_WITH_PIC([MODE])\n# --------------------\n# implement the --with-pic flag, and support the 'pic-only' and 'no-pic'\n# LT_INIT options.\n# MODE is either 'yes' or 'no'.  If omitted, it defaults to 'both'.\nm4_define([_LT_WITH_PIC],\n[AC_ARG_WITH([pic],\n    [AS_HELP_STRING([--with-pic@<:@=PKGS@:>@],\n\t[try to use only PIC/non-PIC objects @<:@default=use both@:>@])],\n    [lt_p=${PACKAGE-default}\n    case $withval in\n    yes|no) pic_mode=$withval ;;\n    *)\n      pic_mode=default\n      # Look at the argument we got.  We use all the common list separators.\n      lt_save_ifs=$IFS; IFS=$IFS$PATH_SEPARATOR,\n      for lt_pkg in $withval; do\n\tIFS=$lt_save_ifs\n\tif test \"X$lt_pkg\" = \"X$lt_p\"; then\n\t  pic_mode=yes\n\tfi\n      done\n      IFS=$lt_save_ifs\n      ;;\n    esac],\n    [pic_mode=m4_default([$1], [default])])\n\n_LT_DECL([], [pic_mode], [0], [What type of objects to build])dnl\n])# _LT_WITH_PIC\n\nLT_OPTION_DEFINE([LT_INIT], [pic-only], [_LT_WITH_PIC([yes])])\nLT_OPTION_DEFINE([LT_INIT], [no-pic], [_LT_WITH_PIC([no])])\n\n# Old name:\nAU_DEFUN([AC_LIBTOOL_PICMODE],\n[_LT_SET_OPTION([LT_INIT], [pic-only])\nAC_DIAGNOSE([obsolete],\n[$0: Remove this warning and the call to _LT_SET_OPTION when you\nput the 'pic-only' option into LT_INIT's first parameter.])\n])\n\ndnl aclocal-1.4 backwards compatibility:\ndnl AC_DEFUN([AC_LIBTOOL_PICMODE], [])\n\n## ----------------- ##\n## LTDL_INIT Options ##\n## ----------------- ##\n\nm4_define([_LTDL_MODE], [])\nLT_OPTION_DEFINE([LTDL_INIT], [nonrecursive],\n\t\t [m4_define([_LTDL_MODE], [nonrecursive])])\nLT_OPTION_DEFINE([LTDL_INIT], [recursive],\n\t\t [m4_define([_LTDL_MODE], [recursive])])\nLT_OPTION_DEFINE([LTDL_INIT], [subproject],\n\t\t [m4_define([_LTDL_MODE], [subproject])])\n\nm4_define([_LTDL_TYPE], [])\nLT_OPTION_DEFINE([LTDL_INIT], [installable],\n\t\t [m4_define([_LTDL_TYPE], [installable])])\nLT_OPTION_DEFINE([LTDL_INIT], [convenience],\n\t\t [m4_define([_LTDL_TYPE], [convenience])])\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/m4/ltsugar.m4",
    "content": "# ltsugar.m4 -- libtool m4 base layer.                         -*-Autoconf-*-\n#\n# Copyright (C) 2004-2005, 2007-2008, 2011-2015 Free Software\n# Foundation, Inc.\n# Written by Gary V. Vaughan, 2004\n#\n# This file is free software; the Free Software Foundation gives\n# unlimited permission to copy and/or distribute it, with or without\n# modifications, as long as this notice is preserved.\n\n# serial 6 ltsugar.m4\n\n# This is to help aclocal find these macros, as it can't see m4_define.\nAC_DEFUN([LTSUGAR_VERSION], [m4_if([0.1])])\n\n\n# lt_join(SEP, ARG1, [ARG2...])\n# -----------------------------\n# Produce ARG1SEPARG2...SEPARGn, omitting [] arguments and their\n# associated separator.\n# Needed until we can rely on m4_join from Autoconf 2.62, since all earlier\n# versions in m4sugar had bugs.\nm4_define([lt_join],\n[m4_if([$#], [1], [],\n       [$#], [2], [[$2]],\n       [m4_if([$2], [], [], [[$2]_])$0([$1], m4_shift(m4_shift($@)))])])\nm4_define([_lt_join],\n[m4_if([$#$2], [2], [],\n       [m4_if([$2], [], [], [[$1$2]])$0([$1], m4_shift(m4_shift($@)))])])\n\n\n# lt_car(LIST)\n# lt_cdr(LIST)\n# ------------\n# Manipulate m4 lists.\n# These macros are necessary as long as will still need to support\n# Autoconf-2.59, which quotes differently.\nm4_define([lt_car], [[$1]])\nm4_define([lt_cdr],\n[m4_if([$#], 0, [m4_fatal([$0: cannot be called without arguments])],\n       [$#], 1, [],\n       [m4_dquote(m4_shift($@))])])\nm4_define([lt_unquote], $1)\n\n\n# lt_append(MACRO-NAME, STRING, [SEPARATOR])\n# ------------------------------------------\n# Redefine MACRO-NAME to hold its former content plus 'SEPARATOR''STRING'.\n# Note that neither SEPARATOR nor STRING are expanded; they are appended\n# to MACRO-NAME as is (leaving the expansion for when MACRO-NAME is invoked).\n# No SEPARATOR is output if MACRO-NAME was previously undefined (different\n# than defined and empty).\n#\n# This macro is needed until we can rely on Autoconf 2.62, since earlier\n# versions of m4sugar mistakenly expanded SEPARATOR but not STRING.\nm4_define([lt_append],\n[m4_define([$1],\n\t   m4_ifdef([$1], [m4_defn([$1])[$3]])[$2])])\n\n\n\n# lt_combine(SEP, PREFIX-LIST, INFIX, SUFFIX1, [SUFFIX2...])\n# ----------------------------------------------------------\n# Produce a SEP delimited list of all paired combinations of elements of\n# PREFIX-LIST with SUFFIX1 through SUFFIXn.  Each element of the list\n# has the form PREFIXmINFIXSUFFIXn.\n# Needed until we can rely on m4_combine added in Autoconf 2.62.\nm4_define([lt_combine],\n[m4_if(m4_eval([$# > 3]), [1],\n       [m4_pushdef([_Lt_sep], [m4_define([_Lt_sep], m4_defn([lt_car]))])]]dnl\n[[m4_foreach([_Lt_prefix], [$2],\n\t     [m4_foreach([_Lt_suffix],\n\t\t]m4_dquote(m4_dquote(m4_shift(m4_shift(m4_shift($@)))))[,\n\t[_Lt_sep([$1])[]m4_defn([_Lt_prefix])[$3]m4_defn([_Lt_suffix])])])])])\n\n\n# lt_if_append_uniq(MACRO-NAME, VARNAME, [SEPARATOR], [UNIQ], [NOT-UNIQ])\n# -----------------------------------------------------------------------\n# Iff MACRO-NAME does not yet contain VARNAME, then append it (delimited\n# by SEPARATOR if supplied) and expand UNIQ, else NOT-UNIQ.\nm4_define([lt_if_append_uniq],\n[m4_ifdef([$1],\n\t  [m4_if(m4_index([$3]m4_defn([$1])[$3], [$3$2$3]), [-1],\n\t\t [lt_append([$1], [$2], [$3])$4],\n\t\t [$5])],\n\t  [lt_append([$1], [$2], [$3])$4])])\n\n\n# lt_dict_add(DICT, KEY, VALUE)\n# -----------------------------\nm4_define([lt_dict_add],\n[m4_define([$1($2)], [$3])])\n\n\n# lt_dict_add_subkey(DICT, KEY, SUBKEY, VALUE)\n# --------------------------------------------\nm4_define([lt_dict_add_subkey],\n[m4_define([$1($2:$3)], [$4])])\n\n\n# lt_dict_fetch(DICT, KEY, [SUBKEY])\n# ----------------------------------\nm4_define([lt_dict_fetch],\n[m4_ifval([$3],\n\tm4_ifdef([$1($2:$3)], [m4_defn([$1($2:$3)])]),\n    m4_ifdef([$1($2)], [m4_defn([$1($2)])]))])\n\n\n# lt_if_dict_fetch(DICT, KEY, [SUBKEY], VALUE, IF-TRUE, [IF-FALSE])\n# -----------------------------------------------------------------\nm4_define([lt_if_dict_fetch],\n[m4_if(lt_dict_fetch([$1], [$2], [$3]), [$4],\n\t[$5],\n    [$6])])\n\n\n# lt_dict_filter(DICT, [SUBKEY], VALUE, [SEPARATOR], KEY, [...])\n# --------------------------------------------------------------\nm4_define([lt_dict_filter],\n[m4_if([$5], [], [],\n  [lt_join(m4_quote(m4_default([$4], [[, ]])),\n           lt_unquote(m4_split(m4_normalize(m4_foreach(_Lt_key, lt_car([m4_shiftn(4, $@)]),\n\t\t      [lt_if_dict_fetch([$1], _Lt_key, [$2], [$3], [_Lt_key ])])))))])[]dnl\n])\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/m4/ltversion.m4",
    "content": "# ltversion.m4 -- version numbers\t\t\t-*- Autoconf -*-\n#\n#   Copyright (C) 2004, 2011-2015 Free Software Foundation, Inc.\n#   Written by Scott James Remnant, 2004\n#\n# This file is free software; the Free Software Foundation gives\n# unlimited permission to copy and/or distribute it, with or without\n# modifications, as long as this notice is preserved.\n\n# @configure_input@\n\n# serial 4179 ltversion.m4\n# This file is part of GNU Libtool\n\nm4_define([LT_PACKAGE_VERSION], [2.4.6])\nm4_define([LT_PACKAGE_REVISION], [2.4.6])\n\nAC_DEFUN([LTVERSION_VERSION],\n[macro_version='2.4.6'\nmacro_revision='2.4.6'\n_LT_DECL(, macro_version, 0, [Which release of libtool.m4 was used?])\n_LT_DECL(, macro_revision, 0)\n])\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/m4/lt~obsolete.m4",
    "content": "# lt~obsolete.m4 -- aclocal satisfying obsolete definitions.    -*-Autoconf-*-\n#\n#   Copyright (C) 2004-2005, 2007, 2009, 2011-2015 Free Software\n#   Foundation, Inc.\n#   Written by Scott James Remnant, 2004.\n#\n# This file is free software; the Free Software Foundation gives\n# unlimited permission to copy and/or distribute it, with or without\n# modifications, as long as this notice is preserved.\n\n# serial 5 lt~obsolete.m4\n\n# These exist entirely to fool aclocal when bootstrapping libtool.\n#\n# In the past libtool.m4 has provided macros via AC_DEFUN (or AU_DEFUN),\n# which have later been changed to m4_define as they aren't part of the\n# exported API, or moved to Autoconf or Automake where they belong.\n#\n# The trouble is, aclocal is a bit thick.  It'll see the old AC_DEFUN\n# in /usr/share/aclocal/libtool.m4 and remember it, then when it sees us\n# using a macro with the same name in our local m4/libtool.m4 it'll\n# pull the old libtool.m4 in (it doesn't see our shiny new m4_define\n# and doesn't know about Autoconf macros at all.)\n#\n# So we provide this file, which has a silly filename so it's always\n# included after everything else.  This provides aclocal with the\n# AC_DEFUNs it wants, but when m4 processes it, it doesn't do anything\n# because those macros already exist, or will be overwritten later.\n# We use AC_DEFUN over AU_DEFUN for compatibility with aclocal-1.6.\n#\n# Anytime we withdraw an AC_DEFUN or AU_DEFUN, remember to add it here.\n# Yes, that means every name once taken will need to remain here until\n# we give up compatibility with versions before 1.7, at which point\n# we need to keep only those names which we still refer to.\n\n# This is to help aclocal find these macros, as it can't see m4_define.\nAC_DEFUN([LTOBSOLETE_VERSION], [m4_if([1])])\n\nm4_ifndef([AC_LIBTOOL_LINKER_OPTION],\t[AC_DEFUN([AC_LIBTOOL_LINKER_OPTION])])\nm4_ifndef([AC_PROG_EGREP],\t\t[AC_DEFUN([AC_PROG_EGREP])])\nm4_ifndef([_LT_AC_PROG_ECHO_BACKSLASH],\t[AC_DEFUN([_LT_AC_PROG_ECHO_BACKSLASH])])\nm4_ifndef([_LT_AC_SHELL_INIT],\t\t[AC_DEFUN([_LT_AC_SHELL_INIT])])\nm4_ifndef([_LT_AC_SYS_LIBPATH_AIX],\t[AC_DEFUN([_LT_AC_SYS_LIBPATH_AIX])])\nm4_ifndef([_LT_PROG_LTMAIN],\t\t[AC_DEFUN([_LT_PROG_LTMAIN])])\nm4_ifndef([_LT_AC_TAGVAR],\t\t[AC_DEFUN([_LT_AC_TAGVAR])])\nm4_ifndef([AC_LTDL_ENABLE_INSTALL],\t[AC_DEFUN([AC_LTDL_ENABLE_INSTALL])])\nm4_ifndef([AC_LTDL_PREOPEN],\t\t[AC_DEFUN([AC_LTDL_PREOPEN])])\nm4_ifndef([_LT_AC_SYS_COMPILER],\t[AC_DEFUN([_LT_AC_SYS_COMPILER])])\nm4_ifndef([_LT_AC_LOCK],\t\t[AC_DEFUN([_LT_AC_LOCK])])\nm4_ifndef([AC_LIBTOOL_SYS_OLD_ARCHIVE],\t[AC_DEFUN([AC_LIBTOOL_SYS_OLD_ARCHIVE])])\nm4_ifndef([_LT_AC_TRY_DLOPEN_SELF],\t[AC_DEFUN([_LT_AC_TRY_DLOPEN_SELF])])\nm4_ifndef([AC_LIBTOOL_PROG_CC_C_O],\t[AC_DEFUN([AC_LIBTOOL_PROG_CC_C_O])])\nm4_ifndef([AC_LIBTOOL_SYS_HARD_LINK_LOCKS], [AC_DEFUN([AC_LIBTOOL_SYS_HARD_LINK_LOCKS])])\nm4_ifndef([AC_LIBTOOL_OBJDIR],\t\t[AC_DEFUN([AC_LIBTOOL_OBJDIR])])\nm4_ifndef([AC_LTDL_OBJDIR],\t\t[AC_DEFUN([AC_LTDL_OBJDIR])])\nm4_ifndef([AC_LIBTOOL_PROG_LD_HARDCODE_LIBPATH], [AC_DEFUN([AC_LIBTOOL_PROG_LD_HARDCODE_LIBPATH])])\nm4_ifndef([AC_LIBTOOL_SYS_LIB_STRIP],\t[AC_DEFUN([AC_LIBTOOL_SYS_LIB_STRIP])])\nm4_ifndef([AC_PATH_MAGIC],\t\t[AC_DEFUN([AC_PATH_MAGIC])])\nm4_ifndef([AC_PROG_LD_GNU],\t\t[AC_DEFUN([AC_PROG_LD_GNU])])\nm4_ifndef([AC_PROG_LD_RELOAD_FLAG],\t[AC_DEFUN([AC_PROG_LD_RELOAD_FLAG])])\nm4_ifndef([AC_DEPLIBS_CHECK_METHOD],\t[AC_DEFUN([AC_DEPLIBS_CHECK_METHOD])])\nm4_ifndef([AC_LIBTOOL_PROG_COMPILER_NO_RTTI], [AC_DEFUN([AC_LIBTOOL_PROG_COMPILER_NO_RTTI])])\nm4_ifndef([AC_LIBTOOL_SYS_GLOBAL_SYMBOL_PIPE], [AC_DEFUN([AC_LIBTOOL_SYS_GLOBAL_SYMBOL_PIPE])])\nm4_ifndef([AC_LIBTOOL_PROG_COMPILER_PIC], [AC_DEFUN([AC_LIBTOOL_PROG_COMPILER_PIC])])\nm4_ifndef([AC_LIBTOOL_PROG_LD_SHLIBS],\t[AC_DEFUN([AC_LIBTOOL_PROG_LD_SHLIBS])])\nm4_ifndef([AC_LIBTOOL_POSTDEP_PREDEP],\t[AC_DEFUN([AC_LIBTOOL_POSTDEP_PREDEP])])\nm4_ifndef([LT_AC_PROG_EGREP],\t\t[AC_DEFUN([LT_AC_PROG_EGREP])])\nm4_ifndef([LT_AC_PROG_SED],\t\t[AC_DEFUN([LT_AC_PROG_SED])])\nm4_ifndef([_LT_CC_BASENAME],\t\t[AC_DEFUN([_LT_CC_BASENAME])])\nm4_ifndef([_LT_COMPILER_BOILERPLATE],\t[AC_DEFUN([_LT_COMPILER_BOILERPLATE])])\nm4_ifndef([_LT_LINKER_BOILERPLATE],\t[AC_DEFUN([_LT_LINKER_BOILERPLATE])])\nm4_ifndef([_AC_PROG_LIBTOOL],\t\t[AC_DEFUN([_AC_PROG_LIBTOOL])])\nm4_ifndef([AC_LIBTOOL_SETUP],\t\t[AC_DEFUN([AC_LIBTOOL_SETUP])])\nm4_ifndef([_LT_AC_CHECK_DLFCN],\t\t[AC_DEFUN([_LT_AC_CHECK_DLFCN])])\nm4_ifndef([AC_LIBTOOL_SYS_DYNAMIC_LINKER],\t[AC_DEFUN([AC_LIBTOOL_SYS_DYNAMIC_LINKER])])\nm4_ifndef([_LT_AC_TAGCONFIG],\t\t[AC_DEFUN([_LT_AC_TAGCONFIG])])\nm4_ifndef([AC_DISABLE_FAST_INSTALL],\t[AC_DEFUN([AC_DISABLE_FAST_INSTALL])])\nm4_ifndef([_LT_AC_LANG_CXX],\t\t[AC_DEFUN([_LT_AC_LANG_CXX])])\nm4_ifndef([_LT_AC_LANG_F77],\t\t[AC_DEFUN([_LT_AC_LANG_F77])])\nm4_ifndef([_LT_AC_LANG_GCJ],\t\t[AC_DEFUN([_LT_AC_LANG_GCJ])])\nm4_ifndef([AC_LIBTOOL_LANG_C_CONFIG],\t[AC_DEFUN([AC_LIBTOOL_LANG_C_CONFIG])])\nm4_ifndef([_LT_AC_LANG_C_CONFIG],\t[AC_DEFUN([_LT_AC_LANG_C_CONFIG])])\nm4_ifndef([AC_LIBTOOL_LANG_CXX_CONFIG],\t[AC_DEFUN([AC_LIBTOOL_LANG_CXX_CONFIG])])\nm4_ifndef([_LT_AC_LANG_CXX_CONFIG],\t[AC_DEFUN([_LT_AC_LANG_CXX_CONFIG])])\nm4_ifndef([AC_LIBTOOL_LANG_F77_CONFIG],\t[AC_DEFUN([AC_LIBTOOL_LANG_F77_CONFIG])])\nm4_ifndef([_LT_AC_LANG_F77_CONFIG],\t[AC_DEFUN([_LT_AC_LANG_F77_CONFIG])])\nm4_ifndef([AC_LIBTOOL_LANG_GCJ_CONFIG],\t[AC_DEFUN([AC_LIBTOOL_LANG_GCJ_CONFIG])])\nm4_ifndef([_LT_AC_LANG_GCJ_CONFIG],\t[AC_DEFUN([_LT_AC_LANG_GCJ_CONFIG])])\nm4_ifndef([AC_LIBTOOL_LANG_RC_CONFIG],\t[AC_DEFUN([AC_LIBTOOL_LANG_RC_CONFIG])])\nm4_ifndef([_LT_AC_LANG_RC_CONFIG],\t[AC_DEFUN([_LT_AC_LANG_RC_CONFIG])])\nm4_ifndef([AC_LIBTOOL_CONFIG],\t\t[AC_DEFUN([AC_LIBTOOL_CONFIG])])\nm4_ifndef([_LT_AC_FILE_LTDLL_C],\t[AC_DEFUN([_LT_AC_FILE_LTDLL_C])])\nm4_ifndef([_LT_REQUIRED_DARWIN_CHECKS],\t[AC_DEFUN([_LT_REQUIRED_DARWIN_CHECKS])])\nm4_ifndef([_LT_AC_PROG_CXXCPP],\t\t[AC_DEFUN([_LT_AC_PROG_CXXCPP])])\nm4_ifndef([_LT_PREPARE_SED_QUOTE_VARS],\t[AC_DEFUN([_LT_PREPARE_SED_QUOTE_VARS])])\nm4_ifndef([_LT_PROG_ECHO_BACKSLASH],\t[AC_DEFUN([_LT_PROG_ECHO_BACKSLASH])])\nm4_ifndef([_LT_PROG_F77],\t\t[AC_DEFUN([_LT_PROG_F77])])\nm4_ifndef([_LT_PROG_FC],\t\t[AC_DEFUN([_LT_PROG_FC])])\nm4_ifndef([_LT_PROG_CXX],\t\t[AC_DEFUN([_LT_PROG_CXX])])\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/missing",
    "content": "#! /bin/sh\n# Common wrapper for a few potentially missing GNU programs.\n\nscriptversion=2013-10-28.13; # UTC\n\n# Copyright (C) 1996-2014 Free Software Foundation, Inc.\n# Originally written by Fran,cois Pinard <pinard@iro.umontreal.ca>, 1996.\n\n# This program is free software; you can redistribute it and/or modify\n# it under the terms of the GNU General Public License as published by\n# the Free Software Foundation; either version 2, or (at your option)\n# any later version.\n\n# This program is distributed in the hope that it will be useful,\n# but WITHOUT ANY WARRANTY; without even the implied warranty of\n# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n# GNU General Public License for more details.\n\n# You should have received a copy of the GNU General Public License\n# along with this program.  If not, see <http://www.gnu.org/licenses/>.\n\n# As a special exception to the GNU General Public License, if you\n# distribute this file as part of a program that contains a\n# configuration script generated by Autoconf, you may include it under\n# the same distribution terms that you use for the rest of that program.\n\nif test $# -eq 0; then\n  echo 1>&2 \"Try '$0 --help' for more information\"\n  exit 1\nfi\n\ncase $1 in\n\n  --is-lightweight)\n    # Used by our autoconf macros to check whether the available missing\n    # script is modern enough.\n    exit 0\n    ;;\n\n  --run)\n    # Back-compat with the calling convention used by older automake.\n    shift\n    ;;\n\n  -h|--h|--he|--hel|--help)\n    echo \"\\\n$0 [OPTION]... PROGRAM [ARGUMENT]...\n\nRun 'PROGRAM [ARGUMENT]...', returning a proper advice when this fails due\nto PROGRAM being missing or too old.\n\nOptions:\n  -h, --help      display this help and exit\n  -v, --version   output version information and exit\n\nSupported PROGRAM values:\n  aclocal   autoconf  autoheader   autom4te  automake  makeinfo\n  bison     yacc      flex         lex       help2man\n\nVersion suffixes to PROGRAM as well as the prefixes 'gnu-', 'gnu', and\n'g' are ignored when checking the name.\n\nSend bug reports to <bug-automake@gnu.org>.\"\n    exit $?\n    ;;\n\n  -v|--v|--ve|--ver|--vers|--versi|--versio|--version)\n    echo \"missing $scriptversion (GNU Automake)\"\n    exit $?\n    ;;\n\n  -*)\n    echo 1>&2 \"$0: unknown '$1' option\"\n    echo 1>&2 \"Try '$0 --help' for more information\"\n    exit 1\n    ;;\n\nesac\n\n# Run the given program, remember its exit status.\n\"$@\"; st=$?\n\n# If it succeeded, we are done.\ntest $st -eq 0 && exit 0\n\n# Also exit now if we it failed (or wasn't found), and '--version' was\n# passed; such an option is passed most likely to detect whether the\n# program is present and works.\ncase $2 in --version|--help) exit $st;; esac\n\n# Exit code 63 means version mismatch.  This often happens when the user\n# tries to use an ancient version of a tool on a file that requires a\n# minimum version.\nif test $st -eq 63; then\n  msg=\"probably too old\"\nelif test $st -eq 127; then\n  # Program was missing.\n  msg=\"missing on your system\"\nelse\n  # Program was found and executed, but failed.  Give up.\n  exit $st\nfi\n\nperl_URL=http://www.perl.org/\nflex_URL=http://flex.sourceforge.net/\ngnu_software_URL=http://www.gnu.org/software\n\nprogram_details ()\n{\n  case $1 in\n    aclocal|automake)\n      echo \"The '$1' program is part of the GNU Automake package:\"\n      echo \"<$gnu_software_URL/automake>\"\n      echo \"It also requires GNU Autoconf, GNU m4 and Perl in order to run:\"\n      echo \"<$gnu_software_URL/autoconf>\"\n      echo \"<$gnu_software_URL/m4/>\"\n      echo \"<$perl_URL>\"\n      ;;\n    autoconf|autom4te|autoheader)\n      echo \"The '$1' program is part of the GNU Autoconf package:\"\n      echo \"<$gnu_software_URL/autoconf/>\"\n      echo \"It also requires GNU m4 and Perl in order to run:\"\n      echo \"<$gnu_software_URL/m4/>\"\n      echo \"<$perl_URL>\"\n      ;;\n  esac\n}\n\ngive_advice ()\n{\n  # Normalize program name to check for.\n  normalized_program=`echo \"$1\" | sed '\n    s/^gnu-//; t\n    s/^gnu//; t\n    s/^g//; t'`\n\n  printf '%s\\n' \"'$1' is $msg.\"\n\n  configure_deps=\"'configure.ac' or m4 files included by 'configure.ac'\"\n  case $normalized_program in\n    autoconf*)\n      echo \"You should only need it if you modified 'configure.ac',\"\n      echo \"or m4 files included by it.\"\n      program_details 'autoconf'\n      ;;\n    autoheader*)\n      echo \"You should only need it if you modified 'acconfig.h' or\"\n      echo \"$configure_deps.\"\n      program_details 'autoheader'\n      ;;\n    automake*)\n      echo \"You should only need it if you modified 'Makefile.am' or\"\n      echo \"$configure_deps.\"\n      program_details 'automake'\n      ;;\n    aclocal*)\n      echo \"You should only need it if you modified 'acinclude.m4' or\"\n      echo \"$configure_deps.\"\n      program_details 'aclocal'\n      ;;\n   autom4te*)\n      echo \"You might have modified some maintainer files that require\"\n      echo \"the 'autom4te' program to be rebuilt.\"\n      program_details 'autom4te'\n      ;;\n    bison*|yacc*)\n      echo \"You should only need it if you modified a '.y' file.\"\n      echo \"You may want to install the GNU Bison package:\"\n      echo \"<$gnu_software_URL/bison/>\"\n      ;;\n    lex*|flex*)\n      echo \"You should only need it if you modified a '.l' file.\"\n      echo \"You may want to install the Fast Lexical Analyzer package:\"\n      echo \"<$flex_URL>\"\n      ;;\n    help2man*)\n      echo \"You should only need it if you modified a dependency\" \\\n           \"of a man page.\"\n      echo \"You may want to install the GNU Help2man package:\"\n      echo \"<$gnu_software_URL/help2man/>\"\n    ;;\n    makeinfo*)\n      echo \"You should only need it if you modified a '.texi' file, or\"\n      echo \"any other file indirectly affecting the aspect of the manual.\"\n      echo \"You might want to install the Texinfo package:\"\n      echo \"<$gnu_software_URL/texinfo/>\"\n      echo \"The spurious makeinfo call might also be the consequence of\"\n      echo \"using a buggy 'make' (AIX, DU, IRIX), in which case you might\"\n      echo \"want to install GNU make:\"\n      echo \"<$gnu_software_URL/make/>\"\n      ;;\n    *)\n      echo \"You might have modified some files without having the proper\"\n      echo \"tools for further handling them.  Check the 'README' file, it\"\n      echo \"often tells you about the needed prerequisites for installing\"\n      echo \"this package.  You may also peek at any GNU archive site, in\"\n      echo \"case some other package contains this missing '$1' program.\"\n      ;;\n  esac\n}\n\ngive_advice \"$1\" | sed -e '1s/^/WARNING: /' \\\n                       -e '2,$s/^/         /' >&2\n\n# Propagate the correct exit status (expected to be 127 for a program\n# not found, 63 for a program that failed due to version mismatch).\nexit $st\n\n# Local variables:\n# eval: (add-hook 'write-file-hooks 'time-stamp)\n# time-stamp-start: \"scriptversion=\"\n# time-stamp-format: \"%:y-%02m-%02d.%02H\"\n# time-stamp-time-zone: \"UTC\"\n# time-stamp-end: \"; # UTC\"\n# End:\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/openfst.sln",
    "content": "\nMicrosoft Visual Studio Solution File, Format Version 12.00\n# Visual Studio 15\nVisualStudioVersion = 15.0.27130.2026\nMinimumVisualStudioVersion = 10.0.40219.1\nProject(\"{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}\") = \"libfst\", \"src\\lib\\libfst.vcxproj\", \"{DE80EFEC-9ED9-4631-BD96-8568C31ED26D}\"\nEndProject\nProject(\"{2150E333-8FDC-42A3-9474-1A3956D46DE8}\") = \"Control and build files\", \"Control and build files\", \"{F14A9AF0-0D79-4553-AA8E-B3905A9B6431}\"\n\tProjectSection(SolutionItems) = preProject\n\t\t.editorconfig = .editorconfig\n\t\t.gitignore = .gitignore\n\t\tsrc\\openfst-multibin.targets = src\\openfst-multibin.targets\n\t\tsrc\\openfst.props = src\\openfst.props\n\t\tsrc\\openfst.targets = src\\openfst.targets\n\tEndProjectSection\nEndProject\nProject(\"{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}\") = \"libfstscript\", \"src\\script\\libfstscript.vcxproj\", \"{111F46ED-DA1F-469B-B912-BA2ACC2FF8E6}\"\nEndProject\nProject(\"{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}\") = \"bin\", \"src\\bin\\bin.vcxproj\", \"{84657A19-CAF2-49E8-8DB3-A428C19F460D}\"\n\tProjectSection(ProjectDependencies) = postProject\n\t\t{111F46ED-DA1F-469B-B912-BA2ACC2FF8E6} = {111F46ED-DA1F-469B-B912-BA2ACC2FF8E6}\n\tEndProjectSection\nEndProject\nProject(\"{2150E333-8FDC-42A3-9474-1A3956D46DE8}\") = \"!! READ ME BEFORE BUILD !!\", \"!! READ ME BEFORE BUILD !!\", \"{3BAF0BB0-34BF-4E28-BC17-A80D7CF4130F}\"\n\tProjectSection(SolutionItems) = preProject\n\t\tsrc\\openfst.user.props = src\\openfst.user.props\n\tEndProjectSection\nEndProject\nGlobal\n\tGlobalSection(SolutionConfigurationPlatforms) = preSolution\n\t\tDebug|x64 = Debug|x64\n\t\tDebug|x86 = Debug|x86\n\t\tRelease|x64 = Release|x64\n\t\tRelease|x86 = Release|x86\n\tEndGlobalSection\n\tGlobalSection(ProjectConfigurationPlatforms) = postSolution\n\t\t{DE80EFEC-9ED9-4631-BD96-8568C31ED26D}.Debug|x64.ActiveCfg = Debug|x64\n\t\t{DE80EFEC-9ED9-4631-BD96-8568C31ED26D}.Debug|x64.Build.0 = Debug|x64\n\t\t{DE80EFEC-9ED9-4631-BD96-8568C31ED26D}.Debug|x86.ActiveCfg = Debug|Win32\n\t\t{DE80EFEC-9ED9-4631-BD96-8568C31ED26D}.Debug|x86.Build.0 = Debug|Win32\n\t\t{DE80EFEC-9ED9-4631-BD96-8568C31ED26D}.Release|x64.ActiveCfg = Release|x64\n\t\t{DE80EFEC-9ED9-4631-BD96-8568C31ED26D}.Release|x64.Build.0 = Release|x64\n\t\t{DE80EFEC-9ED9-4631-BD96-8568C31ED26D}.Release|x86.ActiveCfg = Release|Win32\n\t\t{DE80EFEC-9ED9-4631-BD96-8568C31ED26D}.Release|x86.Build.0 = Release|Win32\n\t\t{111F46ED-DA1F-469B-B912-BA2ACC2FF8E6}.Debug|x64.ActiveCfg = Debug|x64\n\t\t{111F46ED-DA1F-469B-B912-BA2ACC2FF8E6}.Debug|x64.Build.0 = Debug|x64\n\t\t{111F46ED-DA1F-469B-B912-BA2ACC2FF8E6}.Debug|x86.ActiveCfg = Debug|Win32\n\t\t{111F46ED-DA1F-469B-B912-BA2ACC2FF8E6}.Debug|x86.Build.0 = Debug|Win32\n\t\t{111F46ED-DA1F-469B-B912-BA2ACC2FF8E6}.Release|x64.ActiveCfg = Release|x64\n\t\t{111F46ED-DA1F-469B-B912-BA2ACC2FF8E6}.Release|x64.Build.0 = Release|x64\n\t\t{111F46ED-DA1F-469B-B912-BA2ACC2FF8E6}.Release|x86.ActiveCfg = Release|Win32\n\t\t{111F46ED-DA1F-469B-B912-BA2ACC2FF8E6}.Release|x86.Build.0 = Release|Win32\n\t\t{84657A19-CAF2-49E8-8DB3-A428C19F460D}.Debug|x64.ActiveCfg = Debug|x64\n\t\t{84657A19-CAF2-49E8-8DB3-A428C19F460D}.Debug|x64.Build.0 = Debug|x64\n\t\t{84657A19-CAF2-49E8-8DB3-A428C19F460D}.Debug|x86.ActiveCfg = Debug|Win32\n\t\t{84657A19-CAF2-49E8-8DB3-A428C19F460D}.Debug|x86.Build.0 = Debug|Win32\n\t\t{84657A19-CAF2-49E8-8DB3-A428C19F460D}.Release|x64.ActiveCfg = Release|x64\n\t\t{84657A19-CAF2-49E8-8DB3-A428C19F460D}.Release|x64.Build.0 = Release|x64\n\t\t{84657A19-CAF2-49E8-8DB3-A428C19F460D}.Release|x86.ActiveCfg = Release|Win32\n\t\t{84657A19-CAF2-49E8-8DB3-A428C19F460D}.Release|x86.Build.0 = Release|Win32\n\tEndGlobalSection\n\tGlobalSection(SolutionProperties) = preSolution\n\t\tHideSolutionNode = FALSE\n\tEndGlobalSection\n\tGlobalSection(ExtensibilityGlobals) = postSolution\n\t\tSolutionGuid = {14CFFA93-2ED0-43D3-A3E9-5203D4CB19BF}\n\tEndGlobalSection\nEndGlobal\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/package.cmd",
    "content": "@echo off\nsetlocal enableextensions\n\n:: Locate winrar.exe\nset winrar=\"%ProgramFiles%\\winrar\\winrar.exe\"\nif not exist %winrar% set winrar=\"%ProgramFiles(x86)%\\winrar\\winrar.exe\"\nif not exist %winrar% (\n  echo ERROR: Cannot find winrar.exe 1>&2\n  exit /b 1\n)\n\n:: Get head tag and make sure it is sane.\nfor /f %%i in ('git describe --long --dirty') do set longtag=%%i\nset insane=0\nif not %longtag:-dirty=%.==%longtag%. set insane=1\nif %longtag:-0-g=%.==%longtag%.       set insane=1\nif %longtag:win/=%.==%longtag%.       set insane=1\nif %insane%==1 (\n    echo ERROR: Best HEAD description '%longtag%' is not at a clean tag on winport branch 1>&2\n    exit /b 1\n)\n\n:: Get short description now, strip \"win/\" for version only\nfor /f %%i in ('git describe') do set tag=%%i\nset tag=%tag:win/=%\n\n:: Create archive with a comment\nset cmtfile=%TEMP%\\openfst-package-comment.txt\ndel /q %cmtfile% 2>nul\necho OpenFST binaries for Windows x64, optimized build.  >>%cmtfile%\necho Copyright 2005-2018 Google, Inc. (Original source). >>%cmtfile%\necho Copyright 2016-2018 SmartAction LLC (Windows port). >>%cmtfile%\necho Copyright 2016-2018 Johns Hopkins Uni (Windows port). >>%cmtfile%\necho.>>%cmtfile%\necho OpenFST home page: http://www.openfst.org/         >>%cmtfile%\necho Git Repository: https://github.com/kkm000/openfst/ >>%cmtfile%\necho Build tag: %longtag%                               >>%cmtfile%\n\nset zipfile=openfst-bin-win-x64-%tag%.zip\ndel /q %zipfile% 2>nul\n%winrar% a -ep -m5 -z%cmtfile% %zipfile% NEWS COPYING build_output\\x64\\Release\\bin\\*.exe\nif errorlevel 1 (\n  echo \"ERROR: Cannot create archive '%zipfile%' 1>&2\n  del /q %cmtfile% 2>nul\n  exit /b 1\n)\n\necho SUCCESS: Created archive '%zipfile%' 1>&2\ndel /q %cmtfile% 2>nul\nexit /b 0\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/CMakeLists.txt",
    "content": "\n#-DHAVE_CONFIG_H -I./../include -fno-exceptions -funsigned-char -std=c++11 -MT symbol-table.lo -MD -MP -MF .deps/symbol-table.Tpo -c symbol-table.cc  -fno-common -DPIC -o .libs/symbol-table.o\n\ninclude_directories(./include/)\ninstall(DIRECTORY include/ DESTINATION include/\n        FILES_MATCHING PATTERN \"*.h\")\n\nadd_subdirectory(lib)\nadd_subdirectory(script)\n\nif(HAVE_BIN)\n  add_subdirectory(bin)\nendif(HAVE_BIN)\n\nadd_subdirectory(extensions)\n\nenable_testing()\nadd_subdirectory(test)\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/Makefile.am",
    "content": "SUBDIRS = include lib script bin test extensions\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/Makefile.in",
    "content": "# Makefile.in generated by automake 1.15.1 from Makefile.am.\n# @configure_input@\n\n# Copyright (C) 1994-2017 Free Software Foundation, Inc.\n\n# This Makefile.in is free software; the Free Software Foundation\n# gives unlimited permission to copy and/or distribute it,\n# with or without modifications, as long as this notice is preserved.\n\n# This program is distributed in the hope that it will be useful,\n# but WITHOUT ANY WARRANTY, to the extent permitted by law; without\n# even the implied warranty of MERCHANTABILITY or FITNESS FOR A\n# PARTICULAR PURPOSE.\n\n@SET_MAKE@\nVPATH = @srcdir@\nam__is_gnu_make = { \\\n  if test -z '$(MAKELEVEL)'; then \\\n    false; \\\n  elif test -n '$(MAKE_HOST)'; then \\\n    true; \\\n  elif test -n '$(MAKE_VERSION)' && test -n '$(CURDIR)'; then \\\n    true; \\\n  else \\\n    false; \\\n  fi; \\\n}\nam__make_running_with_option = \\\n  case $${target_option-} in \\\n      ?) ;; \\\n      *) echo \"am__make_running_with_option: internal error: invalid\" \\\n              \"target option '$${target_option-}' specified\" >&2; \\\n         exit 1;; \\\n  esac; \\\n  has_opt=no; \\\n  sane_makeflags=$$MAKEFLAGS; \\\n  if $(am__is_gnu_make); then \\\n    sane_makeflags=$$MFLAGS; \\\n  else \\\n    case $$MAKEFLAGS in \\\n      *\\\\[\\ \\\t]*) \\\n        bs=\\\\; \\\n        sane_makeflags=`printf '%s\\n' \"$$MAKEFLAGS\" \\\n          | sed \"s/$$bs$$bs[$$bs $$bs\t]*//g\"`;; \\\n    esac; \\\n  fi; \\\n  skip_next=no; \\\n  strip_trailopt () \\\n  { \\\n    flg=`printf '%s\\n' \"$$flg\" | sed \"s/$$1.*$$//\"`; \\\n  }; \\\n  for flg in $$sane_makeflags; do \\\n    test $$skip_next = yes && { skip_next=no; continue; }; \\\n    case $$flg in \\\n      *=*|--*) continue;; \\\n        -*I) strip_trailopt 'I'; skip_next=yes;; \\\n      -*I?*) strip_trailopt 'I';; \\\n        -*O) strip_trailopt 'O'; skip_next=yes;; \\\n      -*O?*) strip_trailopt 'O';; \\\n        -*l) strip_trailopt 'l'; skip_next=yes;; \\\n      -*l?*) strip_trailopt 'l';; \\\n      -[dEDm]) skip_next=yes;; \\\n      -[JT]) skip_next=yes;; \\\n    esac; \\\n    case $$flg in \\\n      *$$target_option*) has_opt=yes; break;; \\\n    esac; \\\n  done; \\\n  test $$has_opt = yes\nam__make_dryrun = (target_option=n; $(am__make_running_with_option))\nam__make_keepgoing = (target_option=k; $(am__make_running_with_option))\npkgdatadir = $(datadir)/@PACKAGE@\npkgincludedir = $(includedir)/@PACKAGE@\npkglibdir = $(libdir)/@PACKAGE@\npkglibexecdir = $(libexecdir)/@PACKAGE@\nam__cd = CDPATH=\"$${ZSH_VERSION+.}$(PATH_SEPARATOR)\" && cd\ninstall_sh_DATA = $(install_sh) -c -m 644\ninstall_sh_PROGRAM = $(install_sh) -c\ninstall_sh_SCRIPT = $(install_sh) -c\nINSTALL_HEADER = $(INSTALL_DATA)\ntransform = $(program_transform_name)\nNORMAL_INSTALL = :\nPRE_INSTALL = :\nPOST_INSTALL = :\nNORMAL_UNINSTALL = :\nPRE_UNINSTALL = :\nPOST_UNINSTALL = :\nbuild_triplet = @build@\nhost_triplet = @host@\nsubdir = src\nACLOCAL_M4 = $(top_srcdir)/aclocal.m4\nam__aclocal_m4_deps = $(top_srcdir)/m4/ac_python_devel.m4 \\\n\t$(top_srcdir)/m4/libtool.m4 $(top_srcdir)/m4/ltoptions.m4 \\\n\t$(top_srcdir)/m4/ltsugar.m4 $(top_srcdir)/m4/ltversion.m4 \\\n\t$(top_srcdir)/m4/lt~obsolete.m4 $(top_srcdir)/configure.ac\nam__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \\\n\t$(ACLOCAL_M4)\nDIST_COMMON = $(srcdir)/Makefile.am $(am__DIST_COMMON)\nmkinstalldirs = $(install_sh) -d\nCONFIG_HEADER = $(top_builddir)/config.h \\\n\t$(top_builddir)/src/include/fst/config.h\nCONFIG_CLEAN_FILES =\nCONFIG_CLEAN_VPATH_FILES =\nAM_V_P = $(am__v_P_@AM_V@)\nam__v_P_ = $(am__v_P_@AM_DEFAULT_V@)\nam__v_P_0 = false\nam__v_P_1 = :\nAM_V_GEN = $(am__v_GEN_@AM_V@)\nam__v_GEN_ = $(am__v_GEN_@AM_DEFAULT_V@)\nam__v_GEN_0 = @echo \"  GEN     \" $@;\nam__v_GEN_1 = \nAM_V_at = $(am__v_at_@AM_V@)\nam__v_at_ = $(am__v_at_@AM_DEFAULT_V@)\nam__v_at_0 = @\nam__v_at_1 = \nSOURCES =\nDIST_SOURCES =\nRECURSIVE_TARGETS = all-recursive check-recursive cscopelist-recursive \\\n\tctags-recursive dvi-recursive html-recursive info-recursive \\\n\tinstall-data-recursive install-dvi-recursive \\\n\tinstall-exec-recursive install-html-recursive \\\n\tinstall-info-recursive install-pdf-recursive \\\n\tinstall-ps-recursive install-recursive installcheck-recursive \\\n\tinstalldirs-recursive pdf-recursive ps-recursive \\\n\ttags-recursive uninstall-recursive\nam__can_run_installinfo = \\\n  case $$AM_UPDATE_INFO_DIR in \\\n    n|no|NO) false;; \\\n    *) (install-info --version) >/dev/null 2>&1;; \\\n  esac\nRECURSIVE_CLEAN_TARGETS = mostlyclean-recursive clean-recursive\t\\\n  distclean-recursive maintainer-clean-recursive\nam__recursive_targets = \\\n  $(RECURSIVE_TARGETS) \\\n  $(RECURSIVE_CLEAN_TARGETS) \\\n  $(am__extra_recursive_targets)\nAM_RECURSIVE_TARGETS = $(am__recursive_targets:-recursive=) TAGS CTAGS \\\n\tdistdir\nam__tagged_files = $(HEADERS) $(SOURCES) $(TAGS_FILES) $(LISP)\n# Read a list of newline-separated strings from the standard input,\n# and print each of them once, without duplicates.  Input order is\n# *not* preserved.\nam__uniquify_input = $(AWK) '\\\n  BEGIN { nonempty = 0; } \\\n  { items[$$0] = 1; nonempty = 1; } \\\n  END { if (nonempty) { for (i in items) print i; }; } \\\n'\n# Make sure the list of sources is unique.  This is necessary because,\n# e.g., the same source file might be shared among _SOURCES variables\n# for different programs/libraries.\nam__define_uniq_tagged_files = \\\n  list='$(am__tagged_files)'; \\\n  unique=`for i in $$list; do \\\n    if test -f \"$$i\"; then echo $$i; else echo $(srcdir)/$$i; fi; \\\n  done | $(am__uniquify_input)`\nETAGS = etags\nCTAGS = ctags\nDIST_SUBDIRS = $(SUBDIRS)\nam__DIST_COMMON = $(srcdir)/Makefile.in\nDISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST)\nam__relativize = \\\n  dir0=`pwd`; \\\n  sed_first='s,^\\([^/]*\\)/.*$$,\\1,'; \\\n  sed_rest='s,^[^/]*/*,,'; \\\n  sed_last='s,^.*/\\([^/]*\\)$$,\\1,'; \\\n  sed_butlast='s,/*[^/]*$$,,'; \\\n  while test -n \"$$dir1\"; do \\\n    first=`echo \"$$dir1\" | sed -e \"$$sed_first\"`; \\\n    if test \"$$first\" != \".\"; then \\\n      if test \"$$first\" = \"..\"; then \\\n        dir2=`echo \"$$dir0\" | sed -e \"$$sed_last\"`/\"$$dir2\"; \\\n        dir0=`echo \"$$dir0\" | sed -e \"$$sed_butlast\"`; \\\n      else \\\n        first2=`echo \"$$dir2\" | sed -e \"$$sed_first\"`; \\\n        if test \"$$first2\" = \"$$first\"; then \\\n          dir2=`echo \"$$dir2\" | sed -e \"$$sed_rest\"`; \\\n        else \\\n          dir2=\"../$$dir2\"; \\\n        fi; \\\n        dir0=\"$$dir0\"/\"$$first\"; \\\n      fi; \\\n    fi; \\\n    dir1=`echo \"$$dir1\" | sed -e \"$$sed_rest\"`; \\\n  done; \\\n  reldir=\"$$dir2\"\nACLOCAL = @ACLOCAL@\nAMTAR = @AMTAR@\nAM_DEFAULT_VERBOSITY = @AM_DEFAULT_VERBOSITY@\nAR = @AR@\nAUTOCONF = @AUTOCONF@\nAUTOHEADER = @AUTOHEADER@\nAUTOMAKE = @AUTOMAKE@\nAWK = @AWK@\nCC = @CC@\nCCDEPMODE = @CCDEPMODE@\nCFLAGS = @CFLAGS@\nCPP = @CPP@\nCPPFLAGS = @CPPFLAGS@\nCXX = @CXX@\nCXXCPP = @CXXCPP@\nCXXDEPMODE = @CXXDEPMODE@\nCXXFLAGS = @CXXFLAGS@\nCYGPATH_W = @CYGPATH_W@\nDEFS = @DEFS@\nDEPDIR = @DEPDIR@\nDLLTOOL = @DLLTOOL@\nDL_LIBS = @DL_LIBS@\nDSYMUTIL = @DSYMUTIL@\nDUMPBIN = @DUMPBIN@\nECHO_C = @ECHO_C@\nECHO_N = @ECHO_N@\nECHO_T = @ECHO_T@\nEGREP = @EGREP@\nEXEEXT = @EXEEXT@\nFGREP = @FGREP@\nGREP = @GREP@\nINSTALL = @INSTALL@\nINSTALL_DATA = @INSTALL_DATA@\nINSTALL_PROGRAM = @INSTALL_PROGRAM@\nINSTALL_SCRIPT = @INSTALL_SCRIPT@\nINSTALL_STRIP_PROGRAM = @INSTALL_STRIP_PROGRAM@\nLD = @LD@\nLDFLAGS = @LDFLAGS@\nLIBOBJS = @LIBOBJS@\nLIBS = @LIBS@\nLIBTOOL = @LIBTOOL@\nLIPO = @LIPO@\nLN_S = @LN_S@\nLTLIBOBJS = @LTLIBOBJS@\nLT_SYS_LIBRARY_PATH = @LT_SYS_LIBRARY_PATH@\nMAKEINFO = @MAKEINFO@\nMANIFEST_TOOL = @MANIFEST_TOOL@\nMKDIR_P = @MKDIR_P@\nNM = @NM@\nNMEDIT = @NMEDIT@\nOBJDUMP = @OBJDUMP@\nOBJEXT = @OBJEXT@\nOTOOL = @OTOOL@\nOTOOL64 = @OTOOL64@\nPACKAGE = @PACKAGE@\nPACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@\nPACKAGE_NAME = @PACKAGE_NAME@\nPACKAGE_STRING = @PACKAGE_STRING@\nPACKAGE_TARNAME = @PACKAGE_TARNAME@\nPACKAGE_URL = @PACKAGE_URL@\nPACKAGE_VERSION = @PACKAGE_VERSION@\nPATH_SEPARATOR = @PATH_SEPARATOR@\nPYTHON = @PYTHON@\nPYTHON_CPPFLAGS = @PYTHON_CPPFLAGS@\nPYTHON_EXEC_PREFIX = @PYTHON_EXEC_PREFIX@\nPYTHON_EXTRA_LDFLAGS = @PYTHON_EXTRA_LDFLAGS@\nPYTHON_EXTRA_LIBS = @PYTHON_EXTRA_LIBS@\nPYTHON_LDFLAGS = @PYTHON_LDFLAGS@\nPYTHON_PLATFORM = @PYTHON_PLATFORM@\nPYTHON_PREFIX = @PYTHON_PREFIX@\nPYTHON_SITE_PKG = @PYTHON_SITE_PKG@\nPYTHON_VERSION = @PYTHON_VERSION@\nRANLIB = @RANLIB@\nSED = @SED@\nSET_MAKE = @SET_MAKE@\nSHELL = @SHELL@\nSTRIP = @STRIP@\nVERSION = @VERSION@\nabs_builddir = @abs_builddir@\nabs_srcdir = @abs_srcdir@\nabs_top_builddir = @abs_top_builddir@\nabs_top_srcdir = @abs_top_srcdir@\nac_ct_AR = @ac_ct_AR@\nac_ct_CC = @ac_ct_CC@\nac_ct_CXX = @ac_ct_CXX@\nac_ct_DUMPBIN = @ac_ct_DUMPBIN@\nam__include = @am__include@\nam__leading_dot = @am__leading_dot@\nam__quote = @am__quote@\nam__tar = @am__tar@\nam__untar = @am__untar@\nbindir = @bindir@\nbuild = @build@\nbuild_alias = @build_alias@\nbuild_cpu = @build_cpu@\nbuild_os = @build_os@\nbuild_vendor = @build_vendor@\nbuilddir = @builddir@\ndatadir = @datadir@\ndatarootdir = @datarootdir@\ndocdir = @docdir@\ndvidir = @dvidir@\nexec_prefix = @exec_prefix@\nhost = @host@\nhost_alias = @host_alias@\nhost_cpu = @host_cpu@\nhost_os = @host_os@\nhost_vendor = @host_vendor@\nhtmldir = @htmldir@\nincludedir = @includedir@\ninfodir = @infodir@\ninstall_sh = @install_sh@\nlibdir = @libdir@\nlibexecdir = @libexecdir@\nlibfstdir = @libfstdir@\nlocaledir = @localedir@\nlocalstatedir = @localstatedir@\nmandir = @mandir@\nmkdir_p = @mkdir_p@\noldincludedir = @oldincludedir@\npdfdir = @pdfdir@\npkgpyexecdir = @pkgpyexecdir@\npkgpythondir = @pkgpythondir@\nprefix = @prefix@\nprogram_transform_name = @program_transform_name@\npsdir = @psdir@\npyexecdir = @pyexecdir@\npythondir = @pythondir@\nrunstatedir = @runstatedir@\nsbindir = @sbindir@\nsharedstatedir = @sharedstatedir@\nsrcdir = @srcdir@\nsysconfdir = @sysconfdir@\ntarget_alias = @target_alias@\ntop_build_prefix = @top_build_prefix@\ntop_builddir = @top_builddir@\ntop_srcdir = @top_srcdir@\nSUBDIRS = include lib script bin test extensions\nall: all-recursive\n\n.SUFFIXES:\n$(srcdir)/Makefile.in:  $(srcdir)/Makefile.am  $(am__configure_deps)\n\t@for dep in $?; do \\\n\t  case '$(am__configure_deps)' in \\\n\t    *$$dep*) \\\n\t      ( cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh ) \\\n\t        && { if test -f $@; then exit 0; else break; fi; }; \\\n\t      exit 1;; \\\n\t  esac; \\\n\tdone; \\\n\techo ' cd $(top_srcdir) && $(AUTOMAKE) --foreign src/Makefile'; \\\n\t$(am__cd) $(top_srcdir) && \\\n\t  $(AUTOMAKE) --foreign src/Makefile\nMakefile: $(srcdir)/Makefile.in $(top_builddir)/config.status\n\t@case '$?' in \\\n\t  *config.status*) \\\n\t    cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh;; \\\n\t  *) \\\n\t    echo ' cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe)'; \\\n\t    cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe);; \\\n\tesac;\n\n$(top_builddir)/config.status: $(top_srcdir)/configure $(CONFIG_STATUS_DEPENDENCIES)\n\tcd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh\n\n$(top_srcdir)/configure:  $(am__configure_deps)\n\tcd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh\n$(ACLOCAL_M4):  $(am__aclocal_m4_deps)\n\tcd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh\n$(am__aclocal_m4_deps):\n\nmostlyclean-libtool:\n\t-rm -f *.lo\n\nclean-libtool:\n\t-rm -rf .libs _libs\n\n# This directory's subdirectories are mostly independent; you can cd\n# into them and run 'make' without going through this Makefile.\n# To change the values of 'make' variables: instead of editing Makefiles,\n# (1) if the variable is set in 'config.status', edit 'config.status'\n#     (which will cause the Makefiles to be regenerated when you run 'make');\n# (2) otherwise, pass the desired values on the 'make' command line.\n$(am__recursive_targets):\n\t@fail=; \\\n\tif $(am__make_keepgoing); then \\\n\t  failcom='fail=yes'; \\\n\telse \\\n\t  failcom='exit 1'; \\\n\tfi; \\\n\tdot_seen=no; \\\n\ttarget=`echo $@ | sed s/-recursive//`; \\\n\tcase \"$@\" in \\\n\t  distclean-* | maintainer-clean-*) list='$(DIST_SUBDIRS)' ;; \\\n\t  *) list='$(SUBDIRS)' ;; \\\n\tesac; \\\n\tfor subdir in $$list; do \\\n\t  echo \"Making $$target in $$subdir\"; \\\n\t  if test \"$$subdir\" = \".\"; then \\\n\t    dot_seen=yes; \\\n\t    local_target=\"$$target-am\"; \\\n\t  else \\\n\t    local_target=\"$$target\"; \\\n\t  fi; \\\n\t  ($(am__cd) $$subdir && $(MAKE) $(AM_MAKEFLAGS) $$local_target) \\\n\t  || eval $$failcom; \\\n\tdone; \\\n\tif test \"$$dot_seen\" = \"no\"; then \\\n\t  $(MAKE) $(AM_MAKEFLAGS) \"$$target-am\" || exit 1; \\\n\tfi; test -z \"$$fail\"\n\nID: $(am__tagged_files)\n\t$(am__define_uniq_tagged_files); mkid -fID $$unique\ntags: tags-recursive\nTAGS: tags\n\ntags-am: $(TAGS_DEPENDENCIES) $(am__tagged_files)\n\tset x; \\\n\there=`pwd`; \\\n\tif ($(ETAGS) --etags-include --version) >/dev/null 2>&1; then \\\n\t  include_option=--etags-include; \\\n\t  empty_fix=.; \\\n\telse \\\n\t  include_option=--include; \\\n\t  empty_fix=; \\\n\tfi; \\\n\tlist='$(SUBDIRS)'; for subdir in $$list; do \\\n\t  if test \"$$subdir\" = .; then :; else \\\n\t    test ! -f $$subdir/TAGS || \\\n\t      set \"$$@\" \"$$include_option=$$here/$$subdir/TAGS\"; \\\n\t  fi; \\\n\tdone; \\\n\t$(am__define_uniq_tagged_files); \\\n\tshift; \\\n\tif test -z \"$(ETAGS_ARGS)$$*$$unique\"; then :; else \\\n\t  test -n \"$$unique\" || unique=$$empty_fix; \\\n\t  if test $$# -gt 0; then \\\n\t    $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \\\n\t      \"$$@\" $$unique; \\\n\t  else \\\n\t    $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \\\n\t      $$unique; \\\n\t  fi; \\\n\tfi\nctags: ctags-recursive\n\nCTAGS: ctags\nctags-am: $(TAGS_DEPENDENCIES) $(am__tagged_files)\n\t$(am__define_uniq_tagged_files); \\\n\ttest -z \"$(CTAGS_ARGS)$$unique\" \\\n\t  || $(CTAGS) $(CTAGSFLAGS) $(AM_CTAGSFLAGS) $(CTAGS_ARGS) \\\n\t     $$unique\n\nGTAGS:\n\there=`$(am__cd) $(top_builddir) && pwd` \\\n\t  && $(am__cd) $(top_srcdir) \\\n\t  && gtags -i $(GTAGS_ARGS) \"$$here\"\ncscopelist: cscopelist-recursive\n\ncscopelist-am: $(am__tagged_files)\n\tlist='$(am__tagged_files)'; \\\n\tcase \"$(srcdir)\" in \\\n\t  [\\\\/]* | ?:[\\\\/]*) sdir=\"$(srcdir)\" ;; \\\n\t  *) sdir=$(subdir)/$(srcdir) ;; \\\n\tesac; \\\n\tfor i in $$list; do \\\n\t  if test -f \"$$i\"; then \\\n\t    echo \"$(subdir)/$$i\"; \\\n\t  else \\\n\t    echo \"$$sdir/$$i\"; \\\n\t  fi; \\\n\tdone >> $(top_builddir)/cscope.files\n\ndistclean-tags:\n\t-rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags\n\ndistdir: $(DISTFILES)\n\t@srcdirstrip=`echo \"$(srcdir)\" | sed 's/[].[^$$\\\\*]/\\\\\\\\&/g'`; \\\n\ttopsrcdirstrip=`echo \"$(top_srcdir)\" | sed 's/[].[^$$\\\\*]/\\\\\\\\&/g'`; \\\n\tlist='$(DISTFILES)'; \\\n\t  dist_files=`for file in $$list; do echo $$file; done | \\\n\t  sed -e \"s|^$$srcdirstrip/||;t\" \\\n\t      -e \"s|^$$topsrcdirstrip/|$(top_builddir)/|;t\"`; \\\n\tcase $$dist_files in \\\n\t  */*) $(MKDIR_P) `echo \"$$dist_files\" | \\\n\t\t\t   sed '/\\//!d;s|^|$(distdir)/|;s,/[^/]*$$,,' | \\\n\t\t\t   sort -u` ;; \\\n\tesac; \\\n\tfor file in $$dist_files; do \\\n\t  if test -f $$file || test -d $$file; then d=.; else d=$(srcdir); fi; \\\n\t  if test -d $$d/$$file; then \\\n\t    dir=`echo \"/$$file\" | sed -e 's,/[^/]*$$,,'`; \\\n\t    if test -d \"$(distdir)/$$file\"; then \\\n\t      find \"$(distdir)/$$file\" -type d ! -perm -700 -exec chmod u+rwx {} \\;; \\\n\t    fi; \\\n\t    if test -d $(srcdir)/$$file && test $$d != $(srcdir); then \\\n\t      cp -fpR $(srcdir)/$$file \"$(distdir)$$dir\" || exit 1; \\\n\t      find \"$(distdir)/$$file\" -type d ! -perm -700 -exec chmod u+rwx {} \\;; \\\n\t    fi; \\\n\t    cp -fpR $$d/$$file \"$(distdir)$$dir\" || exit 1; \\\n\t  else \\\n\t    test -f \"$(distdir)/$$file\" \\\n\t    || cp -p $$d/$$file \"$(distdir)/$$file\" \\\n\t    || exit 1; \\\n\t  fi; \\\n\tdone\n\t@list='$(DIST_SUBDIRS)'; for subdir in $$list; do \\\n\t  if test \"$$subdir\" = .; then :; else \\\n\t    $(am__make_dryrun) \\\n\t      || test -d \"$(distdir)/$$subdir\" \\\n\t      || $(MKDIR_P) \"$(distdir)/$$subdir\" \\\n\t      || exit 1; \\\n\t    dir1=$$subdir; dir2=\"$(distdir)/$$subdir\"; \\\n\t    $(am__relativize); \\\n\t    new_distdir=$$reldir; \\\n\t    dir1=$$subdir; dir2=\"$(top_distdir)\"; \\\n\t    $(am__relativize); \\\n\t    new_top_distdir=$$reldir; \\\n\t    echo \" (cd $$subdir && $(MAKE) $(AM_MAKEFLAGS) top_distdir=\"$$new_top_distdir\" distdir=\"$$new_distdir\" \\\\\"; \\\n\t    echo \"     am__remove_distdir=: am__skip_length_check=: am__skip_mode_fix=: distdir)\"; \\\n\t    ($(am__cd) $$subdir && \\\n\t      $(MAKE) $(AM_MAKEFLAGS) \\\n\t        top_distdir=\"$$new_top_distdir\" \\\n\t        distdir=\"$$new_distdir\" \\\n\t\tam__remove_distdir=: \\\n\t\tam__skip_length_check=: \\\n\t\tam__skip_mode_fix=: \\\n\t        distdir) \\\n\t      || exit 1; \\\n\t  fi; \\\n\tdone\ncheck-am: all-am\ncheck: check-recursive\nall-am: Makefile\ninstalldirs: installdirs-recursive\ninstalldirs-am:\ninstall: install-recursive\ninstall-exec: install-exec-recursive\ninstall-data: install-data-recursive\nuninstall: uninstall-recursive\n\ninstall-am: all-am\n\t@$(MAKE) $(AM_MAKEFLAGS) install-exec-am install-data-am\n\ninstallcheck: installcheck-recursive\ninstall-strip:\n\tif test -z '$(STRIP)'; then \\\n\t  $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" \\\n\t    install_sh_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" INSTALL_STRIP_FLAG=-s \\\n\t      install; \\\n\telse \\\n\t  $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" \\\n\t    install_sh_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" INSTALL_STRIP_FLAG=-s \\\n\t    \"INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'\" install; \\\n\tfi\nmostlyclean-generic:\n\nclean-generic:\n\ndistclean-generic:\n\t-test -z \"$(CONFIG_CLEAN_FILES)\" || rm -f $(CONFIG_CLEAN_FILES)\n\t-test . = \"$(srcdir)\" || test -z \"$(CONFIG_CLEAN_VPATH_FILES)\" || rm -f $(CONFIG_CLEAN_VPATH_FILES)\n\nmaintainer-clean-generic:\n\t@echo \"This command is intended for maintainers to use\"\n\t@echo \"it deletes files that may require special tools to rebuild.\"\nclean: clean-recursive\n\nclean-am: clean-generic clean-libtool mostlyclean-am\n\ndistclean: distclean-recursive\n\t-rm -f Makefile\ndistclean-am: clean-am distclean-generic distclean-tags\n\ndvi: dvi-recursive\n\ndvi-am:\n\nhtml: html-recursive\n\nhtml-am:\n\ninfo: info-recursive\n\ninfo-am:\n\ninstall-data-am:\n\ninstall-dvi: install-dvi-recursive\n\ninstall-dvi-am:\n\ninstall-exec-am:\n\ninstall-html: install-html-recursive\n\ninstall-html-am:\n\ninstall-info: install-info-recursive\n\ninstall-info-am:\n\ninstall-man:\n\ninstall-pdf: install-pdf-recursive\n\ninstall-pdf-am:\n\ninstall-ps: install-ps-recursive\n\ninstall-ps-am:\n\ninstallcheck-am:\n\nmaintainer-clean: maintainer-clean-recursive\n\t-rm -f Makefile\nmaintainer-clean-am: distclean-am maintainer-clean-generic\n\nmostlyclean: mostlyclean-recursive\n\nmostlyclean-am: mostlyclean-generic mostlyclean-libtool\n\npdf: pdf-recursive\n\npdf-am:\n\nps: ps-recursive\n\nps-am:\n\nuninstall-am:\n\n.MAKE: $(am__recursive_targets) install-am install-strip\n\n.PHONY: $(am__recursive_targets) CTAGS GTAGS TAGS all all-am check \\\n\tcheck-am clean clean-generic clean-libtool cscopelist-am ctags \\\n\tctags-am distclean distclean-generic distclean-libtool \\\n\tdistclean-tags distdir dvi dvi-am html html-am info info-am \\\n\tinstall install-am install-data install-data-am install-dvi \\\n\tinstall-dvi-am install-exec install-exec-am install-html \\\n\tinstall-html-am install-info install-info-am install-man \\\n\tinstall-pdf install-pdf-am install-ps install-ps-am \\\n\tinstall-strip installcheck installcheck-am installdirs \\\n\tinstalldirs-am maintainer-clean maintainer-clean-generic \\\n\tmostlyclean mostlyclean-generic mostlyclean-libtool pdf pdf-am \\\n\tps ps-am tags tags-am uninstall uninstall-am\n\n.PRECIOUS: Makefile\n\n\n# Tell versions [3.59,3.63) of GNU make to not export all variables.\n# Otherwise a system limit (for SysV at least) may be exceeded.\n.NOEXPORT:\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/bin/CMakeLists.txt",
    "content": "function (add_executable2 _name)\n    add_executable(${ARGV})\n    if (TARGET ${_name})\n        target_link_libraries(${_name} fstscript fst ${CMAKE_DL_LIBS})\n        set_target_properties(${_name} PROPERTIES FOLDER bin)\n    endif()\n\n    install(TARGETS ${_name} RUNTIME DESTINATION bin)\nendfunction()\n\ninclude_directories(../include ../script/)\n\nadd_executable2(fstarcsort fstarcsort-main.cc fstarcsort.cc)\n\nadd_executable2(fstclosure fstclosure-main.cc fstclosure.cc)\n\nadd_executable2(fstcompile  fstcompile-main.cc fstcompile.cc)\n\nadd_executable2(fstcompose fstcompose-main.cc fstcompose.cc)\n\nadd_executable2(fstconcat fstconcat-main.cc fstconcat.cc)\n\nadd_executable2(fstconnect fstconnect-main.cc fstconnect.cc)\n\nadd_executable2(fstconvert fstconvert-main.cc fstconvert.cc)\n\nadd_executable2(fstdeterminize fstdeterminize-main.cc fstdeterminize.cc)\n\nadd_executable2(fstdifference fstdifference-main.cc fstdifference.cc)\n\nadd_executable2(fstdisambiguate fstdisambiguate-main.cc fstdisambiguate.cc)\n\nadd_executable2(fstdraw fstdraw-main.cc fstdraw.cc)\n\nadd_executable2(fstencode fstencode-main.cc fstencode.cc)\n\nadd_executable2(fstepsnormalize fstepsnormalize-main.cc fstepsnormalize.cc)\n\nadd_executable2(fstequal fstequal-main.cc fstequal.cc)\n\nadd_executable2(fstequivalent fstequivalent-main.cc fstequivalent.cc)\n\nadd_executable2(fstinfo fstinfo-main.cc fstinfo.cc)\n\nadd_executable2(fstintersect fstintersect-main.cc fstintersect.cc)\n\nadd_executable2(fstinvert fstinvert-main.cc fstinvert.cc)\n\nadd_executable2(fstisomorphic fstisomorphic-main.cc fstisomorphic.cc)\n\nadd_executable2(fstmap fstmap-main.cc fstmap.cc)\n\nadd_executable2(fstminimize fstminimize-main.cc fstminimize.cc)\n\nadd_executable2(fstprint fstprint-main.cc fstprint.cc)\n\nadd_executable2(fstproject fstproject-main.cc fstproject.cc)\n\nadd_executable2(fstprune fstprune-main.cc fstprune.cc)\n\nadd_executable2(fstpush fstpush-main.cc fstpush.cc)\n\nadd_executable2(fstrandgen fstrandgen-main.cc fstrandgen.cc)\n\nadd_executable2(fstrelabel fstrelabel-main.cc fstrelabel.cc)\n\nadd_executable2(fstreplace fstreplace-main.cc fstreplace.cc)\n\nadd_executable2(fstreverse fstreverse-main.cc fstreverse.cc)\n\nadd_executable2(fstreweight fstreweight-main.cc fstreweight.cc)\n\nadd_executable2(fstrmepsilon fstrmepsilon-main.cc fstrmepsilon.cc)\n\nadd_executable2(fstshortestdistance fstshortestdistance-main.cc fstshortestdistance.cc)\n\nadd_executable2(fstshortestpath fstshortestpath-main.cc fstshortestpath.cc)\n\nadd_executable2(fstsymbols fstsymbols-main.cc fstsymbols.cc)\n\nadd_executable2(fstsynchronize fstsynchronize-main.cc fstsynchronize.cc)\n\nadd_executable2(fsttopsort fsttopsort-main.cc fsttopsort.cc)\n\nadd_executable2(fstunion fstunion-main.cc fstunion.cc)\n\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/bin/Makefile.am",
    "content": "AM_CPPFLAGS = -I$(srcdir)/../include -I$(srcdir)/../script $(ICU_FLAGS)\nLDADD = ../script/libfstscript.la ../lib/libfst.la -lm $(DL_LIBS)\n\nif HAVE_BIN\nbin_PROGRAMS = fstarcsort fstclosure fstcompile fstcompose fstconcat \\\nfstconnect fstconvert fstdeterminize fstdifference fstdisambiguate fstdraw \\\nfstencode fstepsnormalize fstequal fstequivalent fstinfo fstintersect \\\nfstinvert fstisomorphic fstmap fstminimize fstprint fstproject fstprune \\\nfstpush fstrandgen fstrelabel fstreplace fstreverse fstreweight fstrmepsilon \\\nfstshortestdistance fstshortestpath fstsymbols fstsynchronize fsttopsort \\\nfstunion\n\nfstarcsort_SOURCES = fstarcsort.cc fstarcsort-main.cc\n\nfstclosure_SOURCES = fstclosure.cc fstclosure-main.cc\n\nfstcompile_SOURCES = fstcompile.cc fstcompile-main.cc\n\nfstcompose_SOURCES = fstcompose.cc fstcompose-main.cc\n\nfstconcat_SOURCES = fstconcat.cc fstconcat-main.cc\n\nfstconnect_SOURCES = fstconnect.cc fstconnect-main.cc\n\nfstconvert_SOURCES = fstconvert.cc fstconvert-main.cc\n\nfstdeterminize_SOURCES = fstdeterminize.cc fstdeterminize-main.cc\n\nfstdifference_SOURCES = fstdifference.cc fstdifference-main.cc\n\nfstdisambiguate_SOURCES = fstdisambiguate.cc fstdisambiguate-main.cc\n\nfstdraw_SOURCES = fstdraw.cc fstdraw-main.cc\n\nfstencode_SOURCES = fstencode.cc fstencode-main.cc\n\nfstepsnormalize_SOURCES = fstepsnormalize.cc fstepsnormalize-main.cc\n\nfstequal_SOURCES = fstequal.cc fstequal-main.cc\n\nfstequivalent_SOURCES = fstequivalent.cc fstequivalent-main.cc\n\nfstinfo_SOURCES = fstinfo.cc fstinfo-main.cc\n\nfstintersect_SOURCES = fstintersect.cc fstintersect-main.cc\n\nfstinvert_SOURCES = fstinvert.cc fstinvert-main.cc\n\nfstisomorphic_SOURCES = fstisomorphic.cc fstisomorphic-main.cc\n\nfstmap_SOURCES = fstmap.cc fstmap-main.cc\n\nfstminimize_SOURCES = fstminimize.cc fstminimize-main.cc\n\nfstprint_SOURCES = fstprint.cc fstprint-main.cc\n\nfstproject_SOURCES = fstproject.cc fstproject-main.cc\n\nfstprune_SOURCES = fstprune.cc fstprune-main.cc\n\nfstpush_SOURCES = fstpush.cc fstpush-main.cc\n\nfstrandgen_SOURCES = fstrandgen.cc fstrandgen-main.cc\n\nfstrelabel_SOURCES = fstrelabel.cc fstrelabel-main.cc\n\nfstreplace_SOURCES = fstreplace.cc fstreplace-main.cc\n\nfstreverse_SOURCES = fstreverse.cc fstreverse-main.cc\n\nfstreweight_SOURCES = fstreweight.cc fstreweight-main.cc\n\nfstrmepsilon_SOURCES = fstrmepsilon.cc fstrmepsilon-main.cc\n\nfstshortestdistance_SOURCES = fstshortestdistance.cc fstshortestdistance-main.cc\n\nfstshortestpath_SOURCES = fstshortestpath.cc fstshortestpath-main.cc\n\nfstsymbols_SOURCES = fstsymbols.cc fstsymbols-main.cc\n\nfstsynchronize_SOURCES = fstsynchronize.cc fstsynchronize-main.cc\n \nfsttopsort_SOURCES = fsttopsort.cc fsttopsort-main.cc\n\nfstunion_SOURCES = fstunion.cc fstunion-main.cc\nendif\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/bin/Makefile.in",
    "content": "# Makefile.in generated by automake 1.15.1 from Makefile.am.\n# @configure_input@\n\n# Copyright (C) 1994-2017 Free Software Foundation, Inc.\n\n# This Makefile.in is free software; the Free Software Foundation\n# gives unlimited permission to copy and/or distribute it,\n# with or without modifications, as long as this notice is preserved.\n\n# This program is distributed in the hope that it will be useful,\n# but WITHOUT ANY WARRANTY, to the extent permitted by law; without\n# even the implied warranty of MERCHANTABILITY or FITNESS FOR A\n# PARTICULAR PURPOSE.\n\n@SET_MAKE@\n\nVPATH = @srcdir@\nam__is_gnu_make = { \\\n  if test -z '$(MAKELEVEL)'; then \\\n    false; \\\n  elif test -n '$(MAKE_HOST)'; then \\\n    true; \\\n  elif test -n '$(MAKE_VERSION)' && test -n '$(CURDIR)'; then \\\n    true; \\\n  else \\\n    false; \\\n  fi; \\\n}\nam__make_running_with_option = \\\n  case $${target_option-} in \\\n      ?) ;; \\\n      *) echo \"am__make_running_with_option: internal error: invalid\" \\\n              \"target option '$${target_option-}' specified\" >&2; \\\n         exit 1;; \\\n  esac; \\\n  has_opt=no; \\\n  sane_makeflags=$$MAKEFLAGS; \\\n  if $(am__is_gnu_make); then \\\n    sane_makeflags=$$MFLAGS; \\\n  else \\\n    case $$MAKEFLAGS in \\\n      *\\\\[\\ \\\t]*) \\\n        bs=\\\\; \\\n        sane_makeflags=`printf '%s\\n' \"$$MAKEFLAGS\" \\\n          | sed \"s/$$bs$$bs[$$bs $$bs\t]*//g\"`;; \\\n    esac; \\\n  fi; \\\n  skip_next=no; \\\n  strip_trailopt () \\\n  { \\\n    flg=`printf '%s\\n' \"$$flg\" | sed \"s/$$1.*$$//\"`; \\\n  }; \\\n  for flg in $$sane_makeflags; do \\\n    test $$skip_next = yes && { skip_next=no; continue; }; \\\n    case $$flg in \\\n      *=*|--*) continue;; \\\n        -*I) strip_trailopt 'I'; skip_next=yes;; \\\n      -*I?*) strip_trailopt 'I';; \\\n        -*O) strip_trailopt 'O'; skip_next=yes;; \\\n      -*O?*) strip_trailopt 'O';; \\\n        -*l) strip_trailopt 'l'; skip_next=yes;; \\\n      -*l?*) strip_trailopt 'l';; \\\n      -[dEDm]) skip_next=yes;; \\\n      -[JT]) skip_next=yes;; \\\n    esac; \\\n    case $$flg in \\\n      *$$target_option*) has_opt=yes; break;; \\\n    esac; \\\n  done; \\\n  test $$has_opt = yes\nam__make_dryrun = (target_option=n; $(am__make_running_with_option))\nam__make_keepgoing = (target_option=k; $(am__make_running_with_option))\npkgdatadir = $(datadir)/@PACKAGE@\npkgincludedir = $(includedir)/@PACKAGE@\npkglibdir = $(libdir)/@PACKAGE@\npkglibexecdir = $(libexecdir)/@PACKAGE@\nam__cd = CDPATH=\"$${ZSH_VERSION+.}$(PATH_SEPARATOR)\" && cd\ninstall_sh_DATA = $(install_sh) -c -m 644\ninstall_sh_PROGRAM = $(install_sh) -c\ninstall_sh_SCRIPT = $(install_sh) -c\nINSTALL_HEADER = $(INSTALL_DATA)\ntransform = $(program_transform_name)\nNORMAL_INSTALL = :\nPRE_INSTALL = :\nPOST_INSTALL = :\nNORMAL_UNINSTALL = :\nPRE_UNINSTALL = :\nPOST_UNINSTALL = :\nbuild_triplet = @build@\nhost_triplet = @host@\n@HAVE_BIN_TRUE@bin_PROGRAMS = fstarcsort$(EXEEXT) fstclosure$(EXEEXT) \\\n@HAVE_BIN_TRUE@\tfstcompile$(EXEEXT) fstcompose$(EXEEXT) \\\n@HAVE_BIN_TRUE@\tfstconcat$(EXEEXT) fstconnect$(EXEEXT) \\\n@HAVE_BIN_TRUE@\tfstconvert$(EXEEXT) fstdeterminize$(EXEEXT) \\\n@HAVE_BIN_TRUE@\tfstdifference$(EXEEXT) fstdisambiguate$(EXEEXT) \\\n@HAVE_BIN_TRUE@\tfstdraw$(EXEEXT) fstencode$(EXEEXT) \\\n@HAVE_BIN_TRUE@\tfstepsnormalize$(EXEEXT) fstequal$(EXEEXT) \\\n@HAVE_BIN_TRUE@\tfstequivalent$(EXEEXT) fstinfo$(EXEEXT) \\\n@HAVE_BIN_TRUE@\tfstintersect$(EXEEXT) fstinvert$(EXEEXT) \\\n@HAVE_BIN_TRUE@\tfstisomorphic$(EXEEXT) fstmap$(EXEEXT) \\\n@HAVE_BIN_TRUE@\tfstminimize$(EXEEXT) fstprint$(EXEEXT) \\\n@HAVE_BIN_TRUE@\tfstproject$(EXEEXT) fstprune$(EXEEXT) \\\n@HAVE_BIN_TRUE@\tfstpush$(EXEEXT) fstrandgen$(EXEEXT) \\\n@HAVE_BIN_TRUE@\tfstrelabel$(EXEEXT) fstreplace$(EXEEXT) \\\n@HAVE_BIN_TRUE@\tfstreverse$(EXEEXT) fstreweight$(EXEEXT) \\\n@HAVE_BIN_TRUE@\tfstrmepsilon$(EXEEXT) \\\n@HAVE_BIN_TRUE@\tfstshortestdistance$(EXEEXT) \\\n@HAVE_BIN_TRUE@\tfstshortestpath$(EXEEXT) fstsymbols$(EXEEXT) \\\n@HAVE_BIN_TRUE@\tfstsynchronize$(EXEEXT) fsttopsort$(EXEEXT) \\\n@HAVE_BIN_TRUE@\tfstunion$(EXEEXT)\nsubdir = src/bin\nACLOCAL_M4 = $(top_srcdir)/aclocal.m4\nam__aclocal_m4_deps = $(top_srcdir)/m4/ac_python_devel.m4 \\\n\t$(top_srcdir)/m4/libtool.m4 $(top_srcdir)/m4/ltoptions.m4 \\\n\t$(top_srcdir)/m4/ltsugar.m4 $(top_srcdir)/m4/ltversion.m4 \\\n\t$(top_srcdir)/m4/lt~obsolete.m4 $(top_srcdir)/configure.ac\nam__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \\\n\t$(ACLOCAL_M4)\nDIST_COMMON = $(srcdir)/Makefile.am $(am__DIST_COMMON)\nmkinstalldirs = $(install_sh) -d\nCONFIG_HEADER = $(top_builddir)/config.h \\\n\t$(top_builddir)/src/include/fst/config.h\nCONFIG_CLEAN_FILES =\nCONFIG_CLEAN_VPATH_FILES =\nam__installdirs = \"$(DESTDIR)$(bindir)\"\nPROGRAMS = $(bin_PROGRAMS)\nam__fstarcsort_SOURCES_DIST = fstarcsort.cc fstarcsort-main.cc\n@HAVE_BIN_TRUE@am_fstarcsort_OBJECTS = fstarcsort.$(OBJEXT) \\\n@HAVE_BIN_TRUE@\tfstarcsort-main.$(OBJEXT)\nfstarcsort_OBJECTS = $(am_fstarcsort_OBJECTS)\nfstarcsort_LDADD = $(LDADD)\nam__DEPENDENCIES_1 =\nfstarcsort_DEPENDENCIES = ../script/libfstscript.la ../lib/libfst.la \\\n\t$(am__DEPENDENCIES_1)\nAM_V_lt = $(am__v_lt_@AM_V@)\nam__v_lt_ = $(am__v_lt_@AM_DEFAULT_V@)\nam__v_lt_0 = --silent\nam__v_lt_1 = \nam__fstclosure_SOURCES_DIST = fstclosure.cc fstclosure-main.cc\n@HAVE_BIN_TRUE@am_fstclosure_OBJECTS = fstclosure.$(OBJEXT) \\\n@HAVE_BIN_TRUE@\tfstclosure-main.$(OBJEXT)\nfstclosure_OBJECTS = $(am_fstclosure_OBJECTS)\nfstclosure_LDADD = $(LDADD)\nfstclosure_DEPENDENCIES = ../script/libfstscript.la ../lib/libfst.la \\\n\t$(am__DEPENDENCIES_1)\nam__fstcompile_SOURCES_DIST = fstcompile.cc fstcompile-main.cc\n@HAVE_BIN_TRUE@am_fstcompile_OBJECTS = fstcompile.$(OBJEXT) \\\n@HAVE_BIN_TRUE@\tfstcompile-main.$(OBJEXT)\nfstcompile_OBJECTS = $(am_fstcompile_OBJECTS)\nfstcompile_LDADD = $(LDADD)\nfstcompile_DEPENDENCIES = ../script/libfstscript.la ../lib/libfst.la \\\n\t$(am__DEPENDENCIES_1)\nam__fstcompose_SOURCES_DIST = fstcompose.cc fstcompose-main.cc\n@HAVE_BIN_TRUE@am_fstcompose_OBJECTS = fstcompose.$(OBJEXT) \\\n@HAVE_BIN_TRUE@\tfstcompose-main.$(OBJEXT)\nfstcompose_OBJECTS = $(am_fstcompose_OBJECTS)\nfstcompose_LDADD = $(LDADD)\nfstcompose_DEPENDENCIES = ../script/libfstscript.la ../lib/libfst.la \\\n\t$(am__DEPENDENCIES_1)\nam__fstconcat_SOURCES_DIST = fstconcat.cc fstconcat-main.cc\n@HAVE_BIN_TRUE@am_fstconcat_OBJECTS = fstconcat.$(OBJEXT) \\\n@HAVE_BIN_TRUE@\tfstconcat-main.$(OBJEXT)\nfstconcat_OBJECTS = $(am_fstconcat_OBJECTS)\nfstconcat_LDADD = $(LDADD)\nfstconcat_DEPENDENCIES = ../script/libfstscript.la ../lib/libfst.la \\\n\t$(am__DEPENDENCIES_1)\nam__fstconnect_SOURCES_DIST = fstconnect.cc fstconnect-main.cc\n@HAVE_BIN_TRUE@am_fstconnect_OBJECTS = fstconnect.$(OBJEXT) \\\n@HAVE_BIN_TRUE@\tfstconnect-main.$(OBJEXT)\nfstconnect_OBJECTS = $(am_fstconnect_OBJECTS)\nfstconnect_LDADD = $(LDADD)\nfstconnect_DEPENDENCIES = ../script/libfstscript.la ../lib/libfst.la \\\n\t$(am__DEPENDENCIES_1)\nam__fstconvert_SOURCES_DIST = fstconvert.cc fstconvert-main.cc\n@HAVE_BIN_TRUE@am_fstconvert_OBJECTS = fstconvert.$(OBJEXT) \\\n@HAVE_BIN_TRUE@\tfstconvert-main.$(OBJEXT)\nfstconvert_OBJECTS = $(am_fstconvert_OBJECTS)\nfstconvert_LDADD = $(LDADD)\nfstconvert_DEPENDENCIES = ../script/libfstscript.la ../lib/libfst.la \\\n\t$(am__DEPENDENCIES_1)\nam__fstdeterminize_SOURCES_DIST = fstdeterminize.cc \\\n\tfstdeterminize-main.cc\n@HAVE_BIN_TRUE@am_fstdeterminize_OBJECTS = fstdeterminize.$(OBJEXT) \\\n@HAVE_BIN_TRUE@\tfstdeterminize-main.$(OBJEXT)\nfstdeterminize_OBJECTS = $(am_fstdeterminize_OBJECTS)\nfstdeterminize_LDADD = $(LDADD)\nfstdeterminize_DEPENDENCIES = ../script/libfstscript.la \\\n\t../lib/libfst.la $(am__DEPENDENCIES_1)\nam__fstdifference_SOURCES_DIST = fstdifference.cc \\\n\tfstdifference-main.cc\n@HAVE_BIN_TRUE@am_fstdifference_OBJECTS = fstdifference.$(OBJEXT) \\\n@HAVE_BIN_TRUE@\tfstdifference-main.$(OBJEXT)\nfstdifference_OBJECTS = $(am_fstdifference_OBJECTS)\nfstdifference_LDADD = $(LDADD)\nfstdifference_DEPENDENCIES = ../script/libfstscript.la \\\n\t../lib/libfst.la $(am__DEPENDENCIES_1)\nam__fstdisambiguate_SOURCES_DIST = fstdisambiguate.cc \\\n\tfstdisambiguate-main.cc\n@HAVE_BIN_TRUE@am_fstdisambiguate_OBJECTS = fstdisambiguate.$(OBJEXT) \\\n@HAVE_BIN_TRUE@\tfstdisambiguate-main.$(OBJEXT)\nfstdisambiguate_OBJECTS = $(am_fstdisambiguate_OBJECTS)\nfstdisambiguate_LDADD = $(LDADD)\nfstdisambiguate_DEPENDENCIES = ../script/libfstscript.la \\\n\t../lib/libfst.la $(am__DEPENDENCIES_1)\nam__fstdraw_SOURCES_DIST = fstdraw.cc fstdraw-main.cc\n@HAVE_BIN_TRUE@am_fstdraw_OBJECTS = fstdraw.$(OBJEXT) \\\n@HAVE_BIN_TRUE@\tfstdraw-main.$(OBJEXT)\nfstdraw_OBJECTS = $(am_fstdraw_OBJECTS)\nfstdraw_LDADD = $(LDADD)\nfstdraw_DEPENDENCIES = ../script/libfstscript.la ../lib/libfst.la \\\n\t$(am__DEPENDENCIES_1)\nam__fstencode_SOURCES_DIST = fstencode.cc fstencode-main.cc\n@HAVE_BIN_TRUE@am_fstencode_OBJECTS = fstencode.$(OBJEXT) \\\n@HAVE_BIN_TRUE@\tfstencode-main.$(OBJEXT)\nfstencode_OBJECTS = $(am_fstencode_OBJECTS)\nfstencode_LDADD = $(LDADD)\nfstencode_DEPENDENCIES = ../script/libfstscript.la ../lib/libfst.la \\\n\t$(am__DEPENDENCIES_1)\nam__fstepsnormalize_SOURCES_DIST = fstepsnormalize.cc \\\n\tfstepsnormalize-main.cc\n@HAVE_BIN_TRUE@am_fstepsnormalize_OBJECTS = fstepsnormalize.$(OBJEXT) \\\n@HAVE_BIN_TRUE@\tfstepsnormalize-main.$(OBJEXT)\nfstepsnormalize_OBJECTS = $(am_fstepsnormalize_OBJECTS)\nfstepsnormalize_LDADD = $(LDADD)\nfstepsnormalize_DEPENDENCIES = ../script/libfstscript.la \\\n\t../lib/libfst.la $(am__DEPENDENCIES_1)\nam__fstequal_SOURCES_DIST = fstequal.cc fstequal-main.cc\n@HAVE_BIN_TRUE@am_fstequal_OBJECTS = fstequal.$(OBJEXT) \\\n@HAVE_BIN_TRUE@\tfstequal-main.$(OBJEXT)\nfstequal_OBJECTS = $(am_fstequal_OBJECTS)\nfstequal_LDADD = $(LDADD)\nfstequal_DEPENDENCIES = ../script/libfstscript.la ../lib/libfst.la \\\n\t$(am__DEPENDENCIES_1)\nam__fstequivalent_SOURCES_DIST = fstequivalent.cc \\\n\tfstequivalent-main.cc\n@HAVE_BIN_TRUE@am_fstequivalent_OBJECTS = fstequivalent.$(OBJEXT) \\\n@HAVE_BIN_TRUE@\tfstequivalent-main.$(OBJEXT)\nfstequivalent_OBJECTS = $(am_fstequivalent_OBJECTS)\nfstequivalent_LDADD = $(LDADD)\nfstequivalent_DEPENDENCIES = ../script/libfstscript.la \\\n\t../lib/libfst.la $(am__DEPENDENCIES_1)\nam__fstinfo_SOURCES_DIST = fstinfo.cc fstinfo-main.cc\n@HAVE_BIN_TRUE@am_fstinfo_OBJECTS = fstinfo.$(OBJEXT) \\\n@HAVE_BIN_TRUE@\tfstinfo-main.$(OBJEXT)\nfstinfo_OBJECTS = $(am_fstinfo_OBJECTS)\nfstinfo_LDADD = $(LDADD)\nfstinfo_DEPENDENCIES = ../script/libfstscript.la ../lib/libfst.la \\\n\t$(am__DEPENDENCIES_1)\nam__fstintersect_SOURCES_DIST = fstintersect.cc fstintersect-main.cc\n@HAVE_BIN_TRUE@am_fstintersect_OBJECTS = fstintersect.$(OBJEXT) \\\n@HAVE_BIN_TRUE@\tfstintersect-main.$(OBJEXT)\nfstintersect_OBJECTS = $(am_fstintersect_OBJECTS)\nfstintersect_LDADD = $(LDADD)\nfstintersect_DEPENDENCIES = ../script/libfstscript.la ../lib/libfst.la \\\n\t$(am__DEPENDENCIES_1)\nam__fstinvert_SOURCES_DIST = fstinvert.cc fstinvert-main.cc\n@HAVE_BIN_TRUE@am_fstinvert_OBJECTS = fstinvert.$(OBJEXT) \\\n@HAVE_BIN_TRUE@\tfstinvert-main.$(OBJEXT)\nfstinvert_OBJECTS = $(am_fstinvert_OBJECTS)\nfstinvert_LDADD = $(LDADD)\nfstinvert_DEPENDENCIES = ../script/libfstscript.la ../lib/libfst.la \\\n\t$(am__DEPENDENCIES_1)\nam__fstisomorphic_SOURCES_DIST = fstisomorphic.cc \\\n\tfstisomorphic-main.cc\n@HAVE_BIN_TRUE@am_fstisomorphic_OBJECTS = fstisomorphic.$(OBJEXT) \\\n@HAVE_BIN_TRUE@\tfstisomorphic-main.$(OBJEXT)\nfstisomorphic_OBJECTS = $(am_fstisomorphic_OBJECTS)\nfstisomorphic_LDADD = $(LDADD)\nfstisomorphic_DEPENDENCIES = ../script/libfstscript.la \\\n\t../lib/libfst.la $(am__DEPENDENCIES_1)\nam__fstmap_SOURCES_DIST = fstmap.cc fstmap-main.cc\n@HAVE_BIN_TRUE@am_fstmap_OBJECTS = fstmap.$(OBJEXT) \\\n@HAVE_BIN_TRUE@\tfstmap-main.$(OBJEXT)\nfstmap_OBJECTS = $(am_fstmap_OBJECTS)\nfstmap_LDADD = $(LDADD)\nfstmap_DEPENDENCIES = ../script/libfstscript.la ../lib/libfst.la \\\n\t$(am__DEPENDENCIES_1)\nam__fstminimize_SOURCES_DIST = fstminimize.cc fstminimize-main.cc\n@HAVE_BIN_TRUE@am_fstminimize_OBJECTS = fstminimize.$(OBJEXT) \\\n@HAVE_BIN_TRUE@\tfstminimize-main.$(OBJEXT)\nfstminimize_OBJECTS = $(am_fstminimize_OBJECTS)\nfstminimize_LDADD = $(LDADD)\nfstminimize_DEPENDENCIES = ../script/libfstscript.la ../lib/libfst.la \\\n\t$(am__DEPENDENCIES_1)\nam__fstprint_SOURCES_DIST = fstprint.cc fstprint-main.cc\n@HAVE_BIN_TRUE@am_fstprint_OBJECTS = fstprint.$(OBJEXT) \\\n@HAVE_BIN_TRUE@\tfstprint-main.$(OBJEXT)\nfstprint_OBJECTS = $(am_fstprint_OBJECTS)\nfstprint_LDADD = $(LDADD)\nfstprint_DEPENDENCIES = ../script/libfstscript.la ../lib/libfst.la \\\n\t$(am__DEPENDENCIES_1)\nam__fstproject_SOURCES_DIST = fstproject.cc fstproject-main.cc\n@HAVE_BIN_TRUE@am_fstproject_OBJECTS = fstproject.$(OBJEXT) \\\n@HAVE_BIN_TRUE@\tfstproject-main.$(OBJEXT)\nfstproject_OBJECTS = $(am_fstproject_OBJECTS)\nfstproject_LDADD = $(LDADD)\nfstproject_DEPENDENCIES = ../script/libfstscript.la ../lib/libfst.la \\\n\t$(am__DEPENDENCIES_1)\nam__fstprune_SOURCES_DIST = fstprune.cc fstprune-main.cc\n@HAVE_BIN_TRUE@am_fstprune_OBJECTS = fstprune.$(OBJEXT) \\\n@HAVE_BIN_TRUE@\tfstprune-main.$(OBJEXT)\nfstprune_OBJECTS = $(am_fstprune_OBJECTS)\nfstprune_LDADD = $(LDADD)\nfstprune_DEPENDENCIES = ../script/libfstscript.la ../lib/libfst.la \\\n\t$(am__DEPENDENCIES_1)\nam__fstpush_SOURCES_DIST = fstpush.cc fstpush-main.cc\n@HAVE_BIN_TRUE@am_fstpush_OBJECTS = fstpush.$(OBJEXT) \\\n@HAVE_BIN_TRUE@\tfstpush-main.$(OBJEXT)\nfstpush_OBJECTS = $(am_fstpush_OBJECTS)\nfstpush_LDADD = $(LDADD)\nfstpush_DEPENDENCIES = ../script/libfstscript.la ../lib/libfst.la \\\n\t$(am__DEPENDENCIES_1)\nam__fstrandgen_SOURCES_DIST = fstrandgen.cc fstrandgen-main.cc\n@HAVE_BIN_TRUE@am_fstrandgen_OBJECTS = fstrandgen.$(OBJEXT) \\\n@HAVE_BIN_TRUE@\tfstrandgen-main.$(OBJEXT)\nfstrandgen_OBJECTS = $(am_fstrandgen_OBJECTS)\nfstrandgen_LDADD = $(LDADD)\nfstrandgen_DEPENDENCIES = ../script/libfstscript.la ../lib/libfst.la \\\n\t$(am__DEPENDENCIES_1)\nam__fstrelabel_SOURCES_DIST = fstrelabel.cc fstrelabel-main.cc\n@HAVE_BIN_TRUE@am_fstrelabel_OBJECTS = fstrelabel.$(OBJEXT) \\\n@HAVE_BIN_TRUE@\tfstrelabel-main.$(OBJEXT)\nfstrelabel_OBJECTS = $(am_fstrelabel_OBJECTS)\nfstrelabel_LDADD = $(LDADD)\nfstrelabel_DEPENDENCIES = ../script/libfstscript.la ../lib/libfst.la \\\n\t$(am__DEPENDENCIES_1)\nam__fstreplace_SOURCES_DIST = fstreplace.cc fstreplace-main.cc\n@HAVE_BIN_TRUE@am_fstreplace_OBJECTS = fstreplace.$(OBJEXT) \\\n@HAVE_BIN_TRUE@\tfstreplace-main.$(OBJEXT)\nfstreplace_OBJECTS = $(am_fstreplace_OBJECTS)\nfstreplace_LDADD = $(LDADD)\nfstreplace_DEPENDENCIES = ../script/libfstscript.la ../lib/libfst.la \\\n\t$(am__DEPENDENCIES_1)\nam__fstreverse_SOURCES_DIST = fstreverse.cc fstreverse-main.cc\n@HAVE_BIN_TRUE@am_fstreverse_OBJECTS = fstreverse.$(OBJEXT) \\\n@HAVE_BIN_TRUE@\tfstreverse-main.$(OBJEXT)\nfstreverse_OBJECTS = $(am_fstreverse_OBJECTS)\nfstreverse_LDADD = $(LDADD)\nfstreverse_DEPENDENCIES = ../script/libfstscript.la ../lib/libfst.la \\\n\t$(am__DEPENDENCIES_1)\nam__fstreweight_SOURCES_DIST = fstreweight.cc fstreweight-main.cc\n@HAVE_BIN_TRUE@am_fstreweight_OBJECTS = fstreweight.$(OBJEXT) \\\n@HAVE_BIN_TRUE@\tfstreweight-main.$(OBJEXT)\nfstreweight_OBJECTS = $(am_fstreweight_OBJECTS)\nfstreweight_LDADD = $(LDADD)\nfstreweight_DEPENDENCIES = ../script/libfstscript.la ../lib/libfst.la \\\n\t$(am__DEPENDENCIES_1)\nam__fstrmepsilon_SOURCES_DIST = fstrmepsilon.cc fstrmepsilon-main.cc\n@HAVE_BIN_TRUE@am_fstrmepsilon_OBJECTS = fstrmepsilon.$(OBJEXT) \\\n@HAVE_BIN_TRUE@\tfstrmepsilon-main.$(OBJEXT)\nfstrmepsilon_OBJECTS = $(am_fstrmepsilon_OBJECTS)\nfstrmepsilon_LDADD = $(LDADD)\nfstrmepsilon_DEPENDENCIES = ../script/libfstscript.la ../lib/libfst.la \\\n\t$(am__DEPENDENCIES_1)\nam__fstshortestdistance_SOURCES_DIST = fstshortestdistance.cc \\\n\tfstshortestdistance-main.cc\n@HAVE_BIN_TRUE@am_fstshortestdistance_OBJECTS =  \\\n@HAVE_BIN_TRUE@\tfstshortestdistance.$(OBJEXT) \\\n@HAVE_BIN_TRUE@\tfstshortestdistance-main.$(OBJEXT)\nfstshortestdistance_OBJECTS = $(am_fstshortestdistance_OBJECTS)\nfstshortestdistance_LDADD = $(LDADD)\nfstshortestdistance_DEPENDENCIES = ../script/libfstscript.la \\\n\t../lib/libfst.la $(am__DEPENDENCIES_1)\nam__fstshortestpath_SOURCES_DIST = fstshortestpath.cc \\\n\tfstshortestpath-main.cc\n@HAVE_BIN_TRUE@am_fstshortestpath_OBJECTS = fstshortestpath.$(OBJEXT) \\\n@HAVE_BIN_TRUE@\tfstshortestpath-main.$(OBJEXT)\nfstshortestpath_OBJECTS = $(am_fstshortestpath_OBJECTS)\nfstshortestpath_LDADD = $(LDADD)\nfstshortestpath_DEPENDENCIES = ../script/libfstscript.la \\\n\t../lib/libfst.la $(am__DEPENDENCIES_1)\nam__fstsymbols_SOURCES_DIST = fstsymbols.cc fstsymbols-main.cc\n@HAVE_BIN_TRUE@am_fstsymbols_OBJECTS = fstsymbols.$(OBJEXT) \\\n@HAVE_BIN_TRUE@\tfstsymbols-main.$(OBJEXT)\nfstsymbols_OBJECTS = $(am_fstsymbols_OBJECTS)\nfstsymbols_LDADD = $(LDADD)\nfstsymbols_DEPENDENCIES = ../script/libfstscript.la ../lib/libfst.la \\\n\t$(am__DEPENDENCIES_1)\nam__fstsynchronize_SOURCES_DIST = fstsynchronize.cc \\\n\tfstsynchronize-main.cc\n@HAVE_BIN_TRUE@am_fstsynchronize_OBJECTS = fstsynchronize.$(OBJEXT) \\\n@HAVE_BIN_TRUE@\tfstsynchronize-main.$(OBJEXT)\nfstsynchronize_OBJECTS = $(am_fstsynchronize_OBJECTS)\nfstsynchronize_LDADD = $(LDADD)\nfstsynchronize_DEPENDENCIES = ../script/libfstscript.la \\\n\t../lib/libfst.la $(am__DEPENDENCIES_1)\nam__fsttopsort_SOURCES_DIST = fsttopsort.cc fsttopsort-main.cc\n@HAVE_BIN_TRUE@am_fsttopsort_OBJECTS = fsttopsort.$(OBJEXT) \\\n@HAVE_BIN_TRUE@\tfsttopsort-main.$(OBJEXT)\nfsttopsort_OBJECTS = $(am_fsttopsort_OBJECTS)\nfsttopsort_LDADD = $(LDADD)\nfsttopsort_DEPENDENCIES = ../script/libfstscript.la ../lib/libfst.la \\\n\t$(am__DEPENDENCIES_1)\nam__fstunion_SOURCES_DIST = fstunion.cc fstunion-main.cc\n@HAVE_BIN_TRUE@am_fstunion_OBJECTS = fstunion.$(OBJEXT) \\\n@HAVE_BIN_TRUE@\tfstunion-main.$(OBJEXT)\nfstunion_OBJECTS = $(am_fstunion_OBJECTS)\nfstunion_LDADD = $(LDADD)\nfstunion_DEPENDENCIES = ../script/libfstscript.la ../lib/libfst.la \\\n\t$(am__DEPENDENCIES_1)\nAM_V_P = $(am__v_P_@AM_V@)\nam__v_P_ = $(am__v_P_@AM_DEFAULT_V@)\nam__v_P_0 = false\nam__v_P_1 = :\nAM_V_GEN = $(am__v_GEN_@AM_V@)\nam__v_GEN_ = $(am__v_GEN_@AM_DEFAULT_V@)\nam__v_GEN_0 = @echo \"  GEN     \" $@;\nam__v_GEN_1 = \nAM_V_at = $(am__v_at_@AM_V@)\nam__v_at_ = $(am__v_at_@AM_DEFAULT_V@)\nam__v_at_0 = @\nam__v_at_1 = \nDEFAULT_INCLUDES = \ndepcomp = $(SHELL) $(top_srcdir)/depcomp\nam__depfiles_maybe = depfiles\nam__mv = mv -f\nCXXCOMPILE = $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) \\\n\t$(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS)\nLTCXXCOMPILE = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \\\n\t$(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) \\\n\t$(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) \\\n\t$(AM_CXXFLAGS) $(CXXFLAGS)\nAM_V_CXX = $(am__v_CXX_@AM_V@)\nam__v_CXX_ = $(am__v_CXX_@AM_DEFAULT_V@)\nam__v_CXX_0 = @echo \"  CXX     \" $@;\nam__v_CXX_1 = \nCXXLD = $(CXX)\nCXXLINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \\\n\t$(LIBTOOLFLAGS) --mode=link $(CXXLD) $(AM_CXXFLAGS) \\\n\t$(CXXFLAGS) $(AM_LDFLAGS) $(LDFLAGS) -o $@\nAM_V_CXXLD = $(am__v_CXXLD_@AM_V@)\nam__v_CXXLD_ = $(am__v_CXXLD_@AM_DEFAULT_V@)\nam__v_CXXLD_0 = @echo \"  CXXLD   \" $@;\nam__v_CXXLD_1 = \nSOURCES = $(fstarcsort_SOURCES) $(fstclosure_SOURCES) \\\n\t$(fstcompile_SOURCES) $(fstcompose_SOURCES) \\\n\t$(fstconcat_SOURCES) $(fstconnect_SOURCES) \\\n\t$(fstconvert_SOURCES) $(fstdeterminize_SOURCES) \\\n\t$(fstdifference_SOURCES) $(fstdisambiguate_SOURCES) \\\n\t$(fstdraw_SOURCES) $(fstencode_SOURCES) \\\n\t$(fstepsnormalize_SOURCES) $(fstequal_SOURCES) \\\n\t$(fstequivalent_SOURCES) $(fstinfo_SOURCES) \\\n\t$(fstintersect_SOURCES) $(fstinvert_SOURCES) \\\n\t$(fstisomorphic_SOURCES) $(fstmap_SOURCES) \\\n\t$(fstminimize_SOURCES) $(fstprint_SOURCES) \\\n\t$(fstproject_SOURCES) $(fstprune_SOURCES) $(fstpush_SOURCES) \\\n\t$(fstrandgen_SOURCES) $(fstrelabel_SOURCES) \\\n\t$(fstreplace_SOURCES) $(fstreverse_SOURCES) \\\n\t$(fstreweight_SOURCES) $(fstrmepsilon_SOURCES) \\\n\t$(fstshortestdistance_SOURCES) $(fstshortestpath_SOURCES) \\\n\t$(fstsymbols_SOURCES) $(fstsynchronize_SOURCES) \\\n\t$(fsttopsort_SOURCES) $(fstunion_SOURCES)\nDIST_SOURCES = $(am__fstarcsort_SOURCES_DIST) \\\n\t$(am__fstclosure_SOURCES_DIST) $(am__fstcompile_SOURCES_DIST) \\\n\t$(am__fstcompose_SOURCES_DIST) $(am__fstconcat_SOURCES_DIST) \\\n\t$(am__fstconnect_SOURCES_DIST) $(am__fstconvert_SOURCES_DIST) \\\n\t$(am__fstdeterminize_SOURCES_DIST) \\\n\t$(am__fstdifference_SOURCES_DIST) \\\n\t$(am__fstdisambiguate_SOURCES_DIST) \\\n\t$(am__fstdraw_SOURCES_DIST) $(am__fstencode_SOURCES_DIST) \\\n\t$(am__fstepsnormalize_SOURCES_DIST) \\\n\t$(am__fstequal_SOURCES_DIST) $(am__fstequivalent_SOURCES_DIST) \\\n\t$(am__fstinfo_SOURCES_DIST) $(am__fstintersect_SOURCES_DIST) \\\n\t$(am__fstinvert_SOURCES_DIST) \\\n\t$(am__fstisomorphic_SOURCES_DIST) $(am__fstmap_SOURCES_DIST) \\\n\t$(am__fstminimize_SOURCES_DIST) $(am__fstprint_SOURCES_DIST) \\\n\t$(am__fstproject_SOURCES_DIST) $(am__fstprune_SOURCES_DIST) \\\n\t$(am__fstpush_SOURCES_DIST) $(am__fstrandgen_SOURCES_DIST) \\\n\t$(am__fstrelabel_SOURCES_DIST) $(am__fstreplace_SOURCES_DIST) \\\n\t$(am__fstreverse_SOURCES_DIST) $(am__fstreweight_SOURCES_DIST) \\\n\t$(am__fstrmepsilon_SOURCES_DIST) \\\n\t$(am__fstshortestdistance_SOURCES_DIST) \\\n\t$(am__fstshortestpath_SOURCES_DIST) \\\n\t$(am__fstsymbols_SOURCES_DIST) \\\n\t$(am__fstsynchronize_SOURCES_DIST) \\\n\t$(am__fsttopsort_SOURCES_DIST) $(am__fstunion_SOURCES_DIST)\nam__can_run_installinfo = \\\n  case $$AM_UPDATE_INFO_DIR in \\\n    n|no|NO) false;; \\\n    *) (install-info --version) >/dev/null 2>&1;; \\\n  esac\nam__tagged_files = $(HEADERS) $(SOURCES) $(TAGS_FILES) $(LISP)\n# Read a list of newline-separated strings from the standard input,\n# and print each of them once, without duplicates.  Input order is\n# *not* preserved.\nam__uniquify_input = $(AWK) '\\\n  BEGIN { nonempty = 0; } \\\n  { items[$$0] = 1; nonempty = 1; } \\\n  END { if (nonempty) { for (i in items) print i; }; } \\\n'\n# Make sure the list of sources is unique.  This is necessary because,\n# e.g., the same source file might be shared among _SOURCES variables\n# for different programs/libraries.\nam__define_uniq_tagged_files = \\\n  list='$(am__tagged_files)'; \\\n  unique=`for i in $$list; do \\\n    if test -f \"$$i\"; then echo $$i; else echo $(srcdir)/$$i; fi; \\\n  done | $(am__uniquify_input)`\nETAGS = etags\nCTAGS = ctags\nam__DIST_COMMON = $(srcdir)/Makefile.in $(top_srcdir)/depcomp\nDISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST)\nACLOCAL = @ACLOCAL@\nAMTAR = @AMTAR@\nAM_DEFAULT_VERBOSITY = @AM_DEFAULT_VERBOSITY@\nAR = @AR@\nAUTOCONF = @AUTOCONF@\nAUTOHEADER = @AUTOHEADER@\nAUTOMAKE = @AUTOMAKE@\nAWK = @AWK@\nCC = @CC@\nCCDEPMODE = @CCDEPMODE@\nCFLAGS = @CFLAGS@\nCPP = @CPP@\nCPPFLAGS = @CPPFLAGS@\nCXX = @CXX@\nCXXCPP = @CXXCPP@\nCXXDEPMODE = @CXXDEPMODE@\nCXXFLAGS = @CXXFLAGS@\nCYGPATH_W = @CYGPATH_W@\nDEFS = @DEFS@\nDEPDIR = @DEPDIR@\nDLLTOOL = @DLLTOOL@\nDL_LIBS = @DL_LIBS@\nDSYMUTIL = @DSYMUTIL@\nDUMPBIN = @DUMPBIN@\nECHO_C = @ECHO_C@\nECHO_N = @ECHO_N@\nECHO_T = @ECHO_T@\nEGREP = @EGREP@\nEXEEXT = @EXEEXT@\nFGREP = @FGREP@\nGREP = @GREP@\nINSTALL = @INSTALL@\nINSTALL_DATA = @INSTALL_DATA@\nINSTALL_PROGRAM = @INSTALL_PROGRAM@\nINSTALL_SCRIPT = @INSTALL_SCRIPT@\nINSTALL_STRIP_PROGRAM = @INSTALL_STRIP_PROGRAM@\nLD = @LD@\nLDFLAGS = @LDFLAGS@\nLIBOBJS = @LIBOBJS@\nLIBS = @LIBS@\nLIBTOOL = @LIBTOOL@\nLIPO = @LIPO@\nLN_S = @LN_S@\nLTLIBOBJS = @LTLIBOBJS@\nLT_SYS_LIBRARY_PATH = @LT_SYS_LIBRARY_PATH@\nMAKEINFO = @MAKEINFO@\nMANIFEST_TOOL = @MANIFEST_TOOL@\nMKDIR_P = @MKDIR_P@\nNM = @NM@\nNMEDIT = @NMEDIT@\nOBJDUMP = @OBJDUMP@\nOBJEXT = @OBJEXT@\nOTOOL = @OTOOL@\nOTOOL64 = @OTOOL64@\nPACKAGE = @PACKAGE@\nPACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@\nPACKAGE_NAME = @PACKAGE_NAME@\nPACKAGE_STRING = @PACKAGE_STRING@\nPACKAGE_TARNAME = @PACKAGE_TARNAME@\nPACKAGE_URL = @PACKAGE_URL@\nPACKAGE_VERSION = @PACKAGE_VERSION@\nPATH_SEPARATOR = @PATH_SEPARATOR@\nPYTHON = @PYTHON@\nPYTHON_CPPFLAGS = @PYTHON_CPPFLAGS@\nPYTHON_EXEC_PREFIX = @PYTHON_EXEC_PREFIX@\nPYTHON_EXTRA_LDFLAGS = @PYTHON_EXTRA_LDFLAGS@\nPYTHON_EXTRA_LIBS = @PYTHON_EXTRA_LIBS@\nPYTHON_LDFLAGS = @PYTHON_LDFLAGS@\nPYTHON_PLATFORM = @PYTHON_PLATFORM@\nPYTHON_PREFIX = @PYTHON_PREFIX@\nPYTHON_SITE_PKG = @PYTHON_SITE_PKG@\nPYTHON_VERSION = @PYTHON_VERSION@\nRANLIB = @RANLIB@\nSED = @SED@\nSET_MAKE = @SET_MAKE@\nSHELL = @SHELL@\nSTRIP = @STRIP@\nVERSION = @VERSION@\nabs_builddir = @abs_builddir@\nabs_srcdir = @abs_srcdir@\nabs_top_builddir = @abs_top_builddir@\nabs_top_srcdir = @abs_top_srcdir@\nac_ct_AR = @ac_ct_AR@\nac_ct_CC = @ac_ct_CC@\nac_ct_CXX = @ac_ct_CXX@\nac_ct_DUMPBIN = @ac_ct_DUMPBIN@\nam__include = @am__include@\nam__leading_dot = @am__leading_dot@\nam__quote = @am__quote@\nam__tar = @am__tar@\nam__untar = @am__untar@\nbindir = @bindir@\nbuild = @build@\nbuild_alias = @build_alias@\nbuild_cpu = @build_cpu@\nbuild_os = @build_os@\nbuild_vendor = @build_vendor@\nbuilddir = @builddir@\ndatadir = @datadir@\ndatarootdir = @datarootdir@\ndocdir = @docdir@\ndvidir = @dvidir@\nexec_prefix = @exec_prefix@\nhost = @host@\nhost_alias = @host_alias@\nhost_cpu = @host_cpu@\nhost_os = @host_os@\nhost_vendor = @host_vendor@\nhtmldir = @htmldir@\nincludedir = @includedir@\ninfodir = @infodir@\ninstall_sh = @install_sh@\nlibdir = @libdir@\nlibexecdir = @libexecdir@\nlibfstdir = @libfstdir@\nlocaledir = @localedir@\nlocalstatedir = @localstatedir@\nmandir = @mandir@\nmkdir_p = @mkdir_p@\noldincludedir = @oldincludedir@\npdfdir = @pdfdir@\npkgpyexecdir = @pkgpyexecdir@\npkgpythondir = @pkgpythondir@\nprefix = @prefix@\nprogram_transform_name = @program_transform_name@\npsdir = @psdir@\npyexecdir = @pyexecdir@\npythondir = @pythondir@\nrunstatedir = @runstatedir@\nsbindir = @sbindir@\nsharedstatedir = @sharedstatedir@\nsrcdir = @srcdir@\nsysconfdir = @sysconfdir@\ntarget_alias = @target_alias@\ntop_build_prefix = @top_build_prefix@\ntop_builddir = @top_builddir@\ntop_srcdir = @top_srcdir@\nAM_CPPFLAGS = -I$(srcdir)/../include -I$(srcdir)/../script $(ICU_FLAGS)\nLDADD = ../script/libfstscript.la ../lib/libfst.la -lm $(DL_LIBS)\n@HAVE_BIN_TRUE@fstarcsort_SOURCES = fstarcsort.cc fstarcsort-main.cc\n@HAVE_BIN_TRUE@fstclosure_SOURCES = fstclosure.cc fstclosure-main.cc\n@HAVE_BIN_TRUE@fstcompile_SOURCES = fstcompile.cc fstcompile-main.cc\n@HAVE_BIN_TRUE@fstcompose_SOURCES = fstcompose.cc fstcompose-main.cc\n@HAVE_BIN_TRUE@fstconcat_SOURCES = fstconcat.cc fstconcat-main.cc\n@HAVE_BIN_TRUE@fstconnect_SOURCES = fstconnect.cc fstconnect-main.cc\n@HAVE_BIN_TRUE@fstconvert_SOURCES = fstconvert.cc fstconvert-main.cc\n@HAVE_BIN_TRUE@fstdeterminize_SOURCES = fstdeterminize.cc fstdeterminize-main.cc\n@HAVE_BIN_TRUE@fstdifference_SOURCES = fstdifference.cc fstdifference-main.cc\n@HAVE_BIN_TRUE@fstdisambiguate_SOURCES = fstdisambiguate.cc fstdisambiguate-main.cc\n@HAVE_BIN_TRUE@fstdraw_SOURCES = fstdraw.cc fstdraw-main.cc\n@HAVE_BIN_TRUE@fstencode_SOURCES = fstencode.cc fstencode-main.cc\n@HAVE_BIN_TRUE@fstepsnormalize_SOURCES = fstepsnormalize.cc fstepsnormalize-main.cc\n@HAVE_BIN_TRUE@fstequal_SOURCES = fstequal.cc fstequal-main.cc\n@HAVE_BIN_TRUE@fstequivalent_SOURCES = fstequivalent.cc fstequivalent-main.cc\n@HAVE_BIN_TRUE@fstinfo_SOURCES = fstinfo.cc fstinfo-main.cc\n@HAVE_BIN_TRUE@fstintersect_SOURCES = fstintersect.cc fstintersect-main.cc\n@HAVE_BIN_TRUE@fstinvert_SOURCES = fstinvert.cc fstinvert-main.cc\n@HAVE_BIN_TRUE@fstisomorphic_SOURCES = fstisomorphic.cc fstisomorphic-main.cc\n@HAVE_BIN_TRUE@fstmap_SOURCES = fstmap.cc fstmap-main.cc\n@HAVE_BIN_TRUE@fstminimize_SOURCES = fstminimize.cc fstminimize-main.cc\n@HAVE_BIN_TRUE@fstprint_SOURCES = fstprint.cc fstprint-main.cc\n@HAVE_BIN_TRUE@fstproject_SOURCES = fstproject.cc fstproject-main.cc\n@HAVE_BIN_TRUE@fstprune_SOURCES = fstprune.cc fstprune-main.cc\n@HAVE_BIN_TRUE@fstpush_SOURCES = fstpush.cc fstpush-main.cc\n@HAVE_BIN_TRUE@fstrandgen_SOURCES = fstrandgen.cc fstrandgen-main.cc\n@HAVE_BIN_TRUE@fstrelabel_SOURCES = fstrelabel.cc fstrelabel-main.cc\n@HAVE_BIN_TRUE@fstreplace_SOURCES = fstreplace.cc fstreplace-main.cc\n@HAVE_BIN_TRUE@fstreverse_SOURCES = fstreverse.cc fstreverse-main.cc\n@HAVE_BIN_TRUE@fstreweight_SOURCES = fstreweight.cc fstreweight-main.cc\n@HAVE_BIN_TRUE@fstrmepsilon_SOURCES = fstrmepsilon.cc fstrmepsilon-main.cc\n@HAVE_BIN_TRUE@fstshortestdistance_SOURCES = fstshortestdistance.cc fstshortestdistance-main.cc\n@HAVE_BIN_TRUE@fstshortestpath_SOURCES = fstshortestpath.cc fstshortestpath-main.cc\n@HAVE_BIN_TRUE@fstsymbols_SOURCES = fstsymbols.cc fstsymbols-main.cc\n@HAVE_BIN_TRUE@fstsynchronize_SOURCES = fstsynchronize.cc fstsynchronize-main.cc\n@HAVE_BIN_TRUE@fsttopsort_SOURCES = fsttopsort.cc fsttopsort-main.cc\n@HAVE_BIN_TRUE@fstunion_SOURCES = fstunion.cc fstunion-main.cc\nall: all-am\n\n.SUFFIXES:\n.SUFFIXES: .cc .lo .o .obj\n$(srcdir)/Makefile.in:  $(srcdir)/Makefile.am  $(am__configure_deps)\n\t@for dep in $?; do \\\n\t  case '$(am__configure_deps)' in \\\n\t    *$$dep*) \\\n\t      ( cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh ) \\\n\t        && { if test -f $@; then exit 0; else break; fi; }; \\\n\t      exit 1;; \\\n\t  esac; \\\n\tdone; \\\n\techo ' cd $(top_srcdir) && $(AUTOMAKE) --foreign src/bin/Makefile'; \\\n\t$(am__cd) $(top_srcdir) && \\\n\t  $(AUTOMAKE) --foreign src/bin/Makefile\nMakefile: $(srcdir)/Makefile.in $(top_builddir)/config.status\n\t@case '$?' in \\\n\t  *config.status*) \\\n\t    cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh;; \\\n\t  *) \\\n\t    echo ' cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe)'; \\\n\t    cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe);; \\\n\tesac;\n\n$(top_builddir)/config.status: $(top_srcdir)/configure $(CONFIG_STATUS_DEPENDENCIES)\n\tcd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh\n\n$(top_srcdir)/configure:  $(am__configure_deps)\n\tcd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh\n$(ACLOCAL_M4):  $(am__aclocal_m4_deps)\n\tcd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh\n$(am__aclocal_m4_deps):\ninstall-binPROGRAMS: $(bin_PROGRAMS)\n\t@$(NORMAL_INSTALL)\n\t@list='$(bin_PROGRAMS)'; test -n \"$(bindir)\" || list=; \\\n\tif test -n \"$$list\"; then \\\n\t  echo \" $(MKDIR_P) '$(DESTDIR)$(bindir)'\"; \\\n\t  $(MKDIR_P) \"$(DESTDIR)$(bindir)\" || exit 1; \\\n\tfi; \\\n\tfor p in $$list; do echo \"$$p $$p\"; done | \\\n\tsed 's/$(EXEEXT)$$//' | \\\n\twhile read p p1; do if test -f $$p \\\n\t || test -f $$p1 \\\n\t  ; then echo \"$$p\"; echo \"$$p\"; else :; fi; \\\n\tdone | \\\n\tsed -e 'p;s,.*/,,;n;h' \\\n\t    -e 's|.*|.|' \\\n\t    -e 'p;x;s,.*/,,;s/$(EXEEXT)$$//;$(transform);s/$$/$(EXEEXT)/' | \\\n\tsed 'N;N;N;s,\\n, ,g' | \\\n\t$(AWK) 'BEGIN { files[\".\"] = \"\"; dirs[\".\"] = 1 } \\\n\t  { d=$$3; if (dirs[d] != 1) { print \"d\", d; dirs[d] = 1 } \\\n\t    if ($$2 == $$4) files[d] = files[d] \" \" $$1; \\\n\t    else { print \"f\", $$3 \"/\" $$4, $$1; } } \\\n\t  END { for (d in files) print \"f\", d, files[d] }' | \\\n\twhile read type dir files; do \\\n\t    if test \"$$dir\" = .; then dir=; else dir=/$$dir; fi; \\\n\t    test -z \"$$files\" || { \\\n\t    echo \" $(INSTALL_PROGRAM_ENV) $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL_PROGRAM) $$files '$(DESTDIR)$(bindir)$$dir'\"; \\\n\t    $(INSTALL_PROGRAM_ENV) $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL_PROGRAM) $$files \"$(DESTDIR)$(bindir)$$dir\" || exit $$?; \\\n\t    } \\\n\t; done\n\nuninstall-binPROGRAMS:\n\t@$(NORMAL_UNINSTALL)\n\t@list='$(bin_PROGRAMS)'; test -n \"$(bindir)\" || list=; \\\n\tfiles=`for p in $$list; do echo \"$$p\"; done | \\\n\t  sed -e 'h;s,^.*/,,;s/$(EXEEXT)$$//;$(transform)' \\\n\t      -e 's/$$/$(EXEEXT)/' \\\n\t`; \\\n\ttest -n \"$$list\" || exit 0; \\\n\techo \" ( cd '$(DESTDIR)$(bindir)' && rm -f\" $$files \")\"; \\\n\tcd \"$(DESTDIR)$(bindir)\" && rm -f $$files\n\nclean-binPROGRAMS:\n\t@list='$(bin_PROGRAMS)'; test -n \"$$list\" || exit 0; \\\n\techo \" rm -f\" $$list; \\\n\trm -f $$list || exit $$?; \\\n\ttest -n \"$(EXEEXT)\" || exit 0; \\\n\tlist=`for p in $$list; do echo \"$$p\"; done | sed 's/$(EXEEXT)$$//'`; \\\n\techo \" rm -f\" $$list; \\\n\trm -f $$list\n\nfstarcsort$(EXEEXT): $(fstarcsort_OBJECTS) $(fstarcsort_DEPENDENCIES) $(EXTRA_fstarcsort_DEPENDENCIES) \n\t@rm -f fstarcsort$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(fstarcsort_OBJECTS) $(fstarcsort_LDADD) $(LIBS)\n\nfstclosure$(EXEEXT): $(fstclosure_OBJECTS) $(fstclosure_DEPENDENCIES) $(EXTRA_fstclosure_DEPENDENCIES) \n\t@rm -f fstclosure$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(fstclosure_OBJECTS) $(fstclosure_LDADD) $(LIBS)\n\nfstcompile$(EXEEXT): $(fstcompile_OBJECTS) $(fstcompile_DEPENDENCIES) $(EXTRA_fstcompile_DEPENDENCIES) \n\t@rm -f fstcompile$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(fstcompile_OBJECTS) $(fstcompile_LDADD) $(LIBS)\n\nfstcompose$(EXEEXT): $(fstcompose_OBJECTS) $(fstcompose_DEPENDENCIES) $(EXTRA_fstcompose_DEPENDENCIES) \n\t@rm -f fstcompose$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(fstcompose_OBJECTS) $(fstcompose_LDADD) $(LIBS)\n\nfstconcat$(EXEEXT): $(fstconcat_OBJECTS) $(fstconcat_DEPENDENCIES) $(EXTRA_fstconcat_DEPENDENCIES) \n\t@rm -f fstconcat$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(fstconcat_OBJECTS) $(fstconcat_LDADD) $(LIBS)\n\nfstconnect$(EXEEXT): $(fstconnect_OBJECTS) $(fstconnect_DEPENDENCIES) $(EXTRA_fstconnect_DEPENDENCIES) \n\t@rm -f fstconnect$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(fstconnect_OBJECTS) $(fstconnect_LDADD) $(LIBS)\n\nfstconvert$(EXEEXT): $(fstconvert_OBJECTS) $(fstconvert_DEPENDENCIES) $(EXTRA_fstconvert_DEPENDENCIES) \n\t@rm -f fstconvert$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(fstconvert_OBJECTS) $(fstconvert_LDADD) $(LIBS)\n\nfstdeterminize$(EXEEXT): $(fstdeterminize_OBJECTS) $(fstdeterminize_DEPENDENCIES) $(EXTRA_fstdeterminize_DEPENDENCIES) \n\t@rm -f fstdeterminize$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(fstdeterminize_OBJECTS) $(fstdeterminize_LDADD) $(LIBS)\n\nfstdifference$(EXEEXT): $(fstdifference_OBJECTS) $(fstdifference_DEPENDENCIES) $(EXTRA_fstdifference_DEPENDENCIES) \n\t@rm -f fstdifference$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(fstdifference_OBJECTS) $(fstdifference_LDADD) $(LIBS)\n\nfstdisambiguate$(EXEEXT): $(fstdisambiguate_OBJECTS) $(fstdisambiguate_DEPENDENCIES) $(EXTRA_fstdisambiguate_DEPENDENCIES) \n\t@rm -f fstdisambiguate$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(fstdisambiguate_OBJECTS) $(fstdisambiguate_LDADD) $(LIBS)\n\nfstdraw$(EXEEXT): $(fstdraw_OBJECTS) $(fstdraw_DEPENDENCIES) $(EXTRA_fstdraw_DEPENDENCIES) \n\t@rm -f fstdraw$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(fstdraw_OBJECTS) $(fstdraw_LDADD) $(LIBS)\n\nfstencode$(EXEEXT): $(fstencode_OBJECTS) $(fstencode_DEPENDENCIES) $(EXTRA_fstencode_DEPENDENCIES) \n\t@rm -f fstencode$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(fstencode_OBJECTS) $(fstencode_LDADD) $(LIBS)\n\nfstepsnormalize$(EXEEXT): $(fstepsnormalize_OBJECTS) $(fstepsnormalize_DEPENDENCIES) $(EXTRA_fstepsnormalize_DEPENDENCIES) \n\t@rm -f fstepsnormalize$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(fstepsnormalize_OBJECTS) $(fstepsnormalize_LDADD) $(LIBS)\n\nfstequal$(EXEEXT): $(fstequal_OBJECTS) $(fstequal_DEPENDENCIES) $(EXTRA_fstequal_DEPENDENCIES) \n\t@rm -f fstequal$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(fstequal_OBJECTS) $(fstequal_LDADD) $(LIBS)\n\nfstequivalent$(EXEEXT): $(fstequivalent_OBJECTS) $(fstequivalent_DEPENDENCIES) $(EXTRA_fstequivalent_DEPENDENCIES) \n\t@rm -f fstequivalent$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(fstequivalent_OBJECTS) $(fstequivalent_LDADD) $(LIBS)\n\nfstinfo$(EXEEXT): $(fstinfo_OBJECTS) $(fstinfo_DEPENDENCIES) $(EXTRA_fstinfo_DEPENDENCIES) \n\t@rm -f fstinfo$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(fstinfo_OBJECTS) $(fstinfo_LDADD) $(LIBS)\n\nfstintersect$(EXEEXT): $(fstintersect_OBJECTS) $(fstintersect_DEPENDENCIES) $(EXTRA_fstintersect_DEPENDENCIES) \n\t@rm -f fstintersect$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(fstintersect_OBJECTS) $(fstintersect_LDADD) $(LIBS)\n\nfstinvert$(EXEEXT): $(fstinvert_OBJECTS) $(fstinvert_DEPENDENCIES) $(EXTRA_fstinvert_DEPENDENCIES) \n\t@rm -f fstinvert$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(fstinvert_OBJECTS) $(fstinvert_LDADD) $(LIBS)\n\nfstisomorphic$(EXEEXT): $(fstisomorphic_OBJECTS) $(fstisomorphic_DEPENDENCIES) $(EXTRA_fstisomorphic_DEPENDENCIES) \n\t@rm -f fstisomorphic$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(fstisomorphic_OBJECTS) $(fstisomorphic_LDADD) $(LIBS)\n\nfstmap$(EXEEXT): $(fstmap_OBJECTS) $(fstmap_DEPENDENCIES) $(EXTRA_fstmap_DEPENDENCIES) \n\t@rm -f fstmap$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(fstmap_OBJECTS) $(fstmap_LDADD) $(LIBS)\n\nfstminimize$(EXEEXT): $(fstminimize_OBJECTS) $(fstminimize_DEPENDENCIES) $(EXTRA_fstminimize_DEPENDENCIES) \n\t@rm -f fstminimize$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(fstminimize_OBJECTS) $(fstminimize_LDADD) $(LIBS)\n\nfstprint$(EXEEXT): $(fstprint_OBJECTS) $(fstprint_DEPENDENCIES) $(EXTRA_fstprint_DEPENDENCIES) \n\t@rm -f fstprint$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(fstprint_OBJECTS) $(fstprint_LDADD) $(LIBS)\n\nfstproject$(EXEEXT): $(fstproject_OBJECTS) $(fstproject_DEPENDENCIES) $(EXTRA_fstproject_DEPENDENCIES) \n\t@rm -f fstproject$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(fstproject_OBJECTS) $(fstproject_LDADD) $(LIBS)\n\nfstprune$(EXEEXT): $(fstprune_OBJECTS) $(fstprune_DEPENDENCIES) $(EXTRA_fstprune_DEPENDENCIES) \n\t@rm -f fstprune$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(fstprune_OBJECTS) $(fstprune_LDADD) $(LIBS)\n\nfstpush$(EXEEXT): $(fstpush_OBJECTS) $(fstpush_DEPENDENCIES) $(EXTRA_fstpush_DEPENDENCIES) \n\t@rm -f fstpush$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(fstpush_OBJECTS) $(fstpush_LDADD) $(LIBS)\n\nfstrandgen$(EXEEXT): $(fstrandgen_OBJECTS) $(fstrandgen_DEPENDENCIES) $(EXTRA_fstrandgen_DEPENDENCIES) \n\t@rm -f fstrandgen$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(fstrandgen_OBJECTS) $(fstrandgen_LDADD) $(LIBS)\n\nfstrelabel$(EXEEXT): $(fstrelabel_OBJECTS) $(fstrelabel_DEPENDENCIES) $(EXTRA_fstrelabel_DEPENDENCIES) \n\t@rm -f fstrelabel$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(fstrelabel_OBJECTS) $(fstrelabel_LDADD) $(LIBS)\n\nfstreplace$(EXEEXT): $(fstreplace_OBJECTS) $(fstreplace_DEPENDENCIES) $(EXTRA_fstreplace_DEPENDENCIES) \n\t@rm -f fstreplace$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(fstreplace_OBJECTS) $(fstreplace_LDADD) $(LIBS)\n\nfstreverse$(EXEEXT): $(fstreverse_OBJECTS) $(fstreverse_DEPENDENCIES) $(EXTRA_fstreverse_DEPENDENCIES) \n\t@rm -f fstreverse$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(fstreverse_OBJECTS) $(fstreverse_LDADD) $(LIBS)\n\nfstreweight$(EXEEXT): $(fstreweight_OBJECTS) $(fstreweight_DEPENDENCIES) $(EXTRA_fstreweight_DEPENDENCIES) \n\t@rm -f fstreweight$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(fstreweight_OBJECTS) $(fstreweight_LDADD) $(LIBS)\n\nfstrmepsilon$(EXEEXT): $(fstrmepsilon_OBJECTS) $(fstrmepsilon_DEPENDENCIES) $(EXTRA_fstrmepsilon_DEPENDENCIES) \n\t@rm -f fstrmepsilon$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(fstrmepsilon_OBJECTS) $(fstrmepsilon_LDADD) $(LIBS)\n\nfstshortestdistance$(EXEEXT): $(fstshortestdistance_OBJECTS) $(fstshortestdistance_DEPENDENCIES) $(EXTRA_fstshortestdistance_DEPENDENCIES) \n\t@rm -f fstshortestdistance$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(fstshortestdistance_OBJECTS) $(fstshortestdistance_LDADD) $(LIBS)\n\nfstshortestpath$(EXEEXT): $(fstshortestpath_OBJECTS) $(fstshortestpath_DEPENDENCIES) $(EXTRA_fstshortestpath_DEPENDENCIES) \n\t@rm -f fstshortestpath$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(fstshortestpath_OBJECTS) $(fstshortestpath_LDADD) $(LIBS)\n\nfstsymbols$(EXEEXT): $(fstsymbols_OBJECTS) $(fstsymbols_DEPENDENCIES) $(EXTRA_fstsymbols_DEPENDENCIES) \n\t@rm -f fstsymbols$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(fstsymbols_OBJECTS) $(fstsymbols_LDADD) $(LIBS)\n\nfstsynchronize$(EXEEXT): $(fstsynchronize_OBJECTS) $(fstsynchronize_DEPENDENCIES) $(EXTRA_fstsynchronize_DEPENDENCIES) \n\t@rm -f fstsynchronize$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(fstsynchronize_OBJECTS) $(fstsynchronize_LDADD) $(LIBS)\n\nfsttopsort$(EXEEXT): $(fsttopsort_OBJECTS) $(fsttopsort_DEPENDENCIES) $(EXTRA_fsttopsort_DEPENDENCIES) \n\t@rm -f fsttopsort$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(fsttopsort_OBJECTS) $(fsttopsort_LDADD) $(LIBS)\n\nfstunion$(EXEEXT): $(fstunion_OBJECTS) $(fstunion_DEPENDENCIES) $(EXTRA_fstunion_DEPENDENCIES) \n\t@rm -f fstunion$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(fstunion_OBJECTS) $(fstunion_LDADD) $(LIBS)\n\nmostlyclean-compile:\n\t-rm -f *.$(OBJEXT)\n\ndistclean-compile:\n\t-rm -f *.tab.c\n\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstarcsort-main.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstarcsort.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstclosure-main.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstclosure.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstcompile-main.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstcompile.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstcompose-main.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstcompose.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstconcat-main.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstconcat.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstconnect-main.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstconnect.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstconvert-main.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstconvert.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstdeterminize-main.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstdeterminize.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstdifference-main.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstdifference.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstdisambiguate-main.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstdisambiguate.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstdraw-main.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstdraw.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstencode-main.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstencode.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstepsnormalize-main.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstepsnormalize.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstequal-main.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstequal.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstequivalent-main.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstequivalent.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstinfo-main.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstinfo.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstintersect-main.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstintersect.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstinvert-main.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstinvert.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstisomorphic-main.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstisomorphic.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstmap-main.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstmap.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstminimize-main.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstminimize.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstprint-main.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstprint.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstproject-main.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstproject.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstprune-main.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstprune.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstpush-main.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstpush.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstrandgen-main.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstrandgen.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstrelabel-main.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstrelabel.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstreplace-main.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstreplace.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstreverse-main.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstreverse.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstreweight-main.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstreweight.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstrmepsilon-main.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstrmepsilon.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstshortestdistance-main.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstshortestdistance.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstshortestpath-main.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstshortestpath.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstsymbols-main.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstsymbols.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstsynchronize-main.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstsynchronize.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fsttopsort-main.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fsttopsort.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstunion-main.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstunion.Po@am__quote@\n\n.cc.o:\n@am__fastdepCXX_TRUE@\t$(AM_V_CXX)depbase=`echo $@ | sed 's|[^/]*$$|$(DEPDIR)/&|;s|\\.o$$||'`;\\\n@am__fastdepCXX_TRUE@\t$(CXXCOMPILE) -MT $@ -MD -MP -MF $$depbase.Tpo -c -o $@ $< &&\\\n@am__fastdepCXX_TRUE@\t$(am__mv) $$depbase.Tpo $$depbase.Po\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\t$(AM_V_CXX)source='$<' object='$@' libtool=no @AMDEPBACKSLASH@\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\tDEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@\n@am__fastdepCXX_FALSE@\t$(AM_V_CXX@am__nodep@)$(CXXCOMPILE) -c -o $@ $<\n\n.cc.obj:\n@am__fastdepCXX_TRUE@\t$(AM_V_CXX)depbase=`echo $@ | sed 's|[^/]*$$|$(DEPDIR)/&|;s|\\.obj$$||'`;\\\n@am__fastdepCXX_TRUE@\t$(CXXCOMPILE) -MT $@ -MD -MP -MF $$depbase.Tpo -c -o $@ `$(CYGPATH_W) '$<'` &&\\\n@am__fastdepCXX_TRUE@\t$(am__mv) $$depbase.Tpo $$depbase.Po\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\t$(AM_V_CXX)source='$<' object='$@' libtool=no @AMDEPBACKSLASH@\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\tDEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@\n@am__fastdepCXX_FALSE@\t$(AM_V_CXX@am__nodep@)$(CXXCOMPILE) -c -o $@ `$(CYGPATH_W) '$<'`\n\n.cc.lo:\n@am__fastdepCXX_TRUE@\t$(AM_V_CXX)depbase=`echo $@ | sed 's|[^/]*$$|$(DEPDIR)/&|;s|\\.lo$$||'`;\\\n@am__fastdepCXX_TRUE@\t$(LTCXXCOMPILE) -MT $@ -MD -MP -MF $$depbase.Tpo -c -o $@ $< &&\\\n@am__fastdepCXX_TRUE@\t$(am__mv) $$depbase.Tpo $$depbase.Plo\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\t$(AM_V_CXX)source='$<' object='$@' libtool=yes @AMDEPBACKSLASH@\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\tDEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@\n@am__fastdepCXX_FALSE@\t$(AM_V_CXX@am__nodep@)$(LTCXXCOMPILE) -c -o $@ $<\n\nmostlyclean-libtool:\n\t-rm -f *.lo\n\nclean-libtool:\n\t-rm -rf .libs _libs\n\nID: $(am__tagged_files)\n\t$(am__define_uniq_tagged_files); mkid -fID $$unique\ntags: tags-am\nTAGS: tags\n\ntags-am: $(TAGS_DEPENDENCIES) $(am__tagged_files)\n\tset x; \\\n\there=`pwd`; \\\n\t$(am__define_uniq_tagged_files); \\\n\tshift; \\\n\tif test -z \"$(ETAGS_ARGS)$$*$$unique\"; then :; else \\\n\t  test -n \"$$unique\" || unique=$$empty_fix; \\\n\t  if test $$# -gt 0; then \\\n\t    $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \\\n\t      \"$$@\" $$unique; \\\n\t  else \\\n\t    $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \\\n\t      $$unique; \\\n\t  fi; \\\n\tfi\nctags: ctags-am\n\nCTAGS: ctags\nctags-am: $(TAGS_DEPENDENCIES) $(am__tagged_files)\n\t$(am__define_uniq_tagged_files); \\\n\ttest -z \"$(CTAGS_ARGS)$$unique\" \\\n\t  || $(CTAGS) $(CTAGSFLAGS) $(AM_CTAGSFLAGS) $(CTAGS_ARGS) \\\n\t     $$unique\n\nGTAGS:\n\there=`$(am__cd) $(top_builddir) && pwd` \\\n\t  && $(am__cd) $(top_srcdir) \\\n\t  && gtags -i $(GTAGS_ARGS) \"$$here\"\ncscopelist: cscopelist-am\n\ncscopelist-am: $(am__tagged_files)\n\tlist='$(am__tagged_files)'; \\\n\tcase \"$(srcdir)\" in \\\n\t  [\\\\/]* | ?:[\\\\/]*) sdir=\"$(srcdir)\" ;; \\\n\t  *) sdir=$(subdir)/$(srcdir) ;; \\\n\tesac; \\\n\tfor i in $$list; do \\\n\t  if test -f \"$$i\"; then \\\n\t    echo \"$(subdir)/$$i\"; \\\n\t  else \\\n\t    echo \"$$sdir/$$i\"; \\\n\t  fi; \\\n\tdone >> $(top_builddir)/cscope.files\n\ndistclean-tags:\n\t-rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags\n\ndistdir: $(DISTFILES)\n\t@srcdirstrip=`echo \"$(srcdir)\" | sed 's/[].[^$$\\\\*]/\\\\\\\\&/g'`; \\\n\ttopsrcdirstrip=`echo \"$(top_srcdir)\" | sed 's/[].[^$$\\\\*]/\\\\\\\\&/g'`; \\\n\tlist='$(DISTFILES)'; \\\n\t  dist_files=`for file in $$list; do echo $$file; done | \\\n\t  sed -e \"s|^$$srcdirstrip/||;t\" \\\n\t      -e \"s|^$$topsrcdirstrip/|$(top_builddir)/|;t\"`; \\\n\tcase $$dist_files in \\\n\t  */*) $(MKDIR_P) `echo \"$$dist_files\" | \\\n\t\t\t   sed '/\\//!d;s|^|$(distdir)/|;s,/[^/]*$$,,' | \\\n\t\t\t   sort -u` ;; \\\n\tesac; \\\n\tfor file in $$dist_files; do \\\n\t  if test -f $$file || test -d $$file; then d=.; else d=$(srcdir); fi; \\\n\t  if test -d $$d/$$file; then \\\n\t    dir=`echo \"/$$file\" | sed -e 's,/[^/]*$$,,'`; \\\n\t    if test -d \"$(distdir)/$$file\"; then \\\n\t      find \"$(distdir)/$$file\" -type d ! -perm -700 -exec chmod u+rwx {} \\;; \\\n\t    fi; \\\n\t    if test -d $(srcdir)/$$file && test $$d != $(srcdir); then \\\n\t      cp -fpR $(srcdir)/$$file \"$(distdir)$$dir\" || exit 1; \\\n\t      find \"$(distdir)/$$file\" -type d ! -perm -700 -exec chmod u+rwx {} \\;; \\\n\t    fi; \\\n\t    cp -fpR $$d/$$file \"$(distdir)$$dir\" || exit 1; \\\n\t  else \\\n\t    test -f \"$(distdir)/$$file\" \\\n\t    || cp -p $$d/$$file \"$(distdir)/$$file\" \\\n\t    || exit 1; \\\n\t  fi; \\\n\tdone\ncheck-am: all-am\ncheck: check-am\nall-am: Makefile $(PROGRAMS)\ninstalldirs:\n\tfor dir in \"$(DESTDIR)$(bindir)\"; do \\\n\t  test -z \"$$dir\" || $(MKDIR_P) \"$$dir\"; \\\n\tdone\ninstall: install-am\ninstall-exec: install-exec-am\ninstall-data: install-data-am\nuninstall: uninstall-am\n\ninstall-am: all-am\n\t@$(MAKE) $(AM_MAKEFLAGS) install-exec-am install-data-am\n\ninstallcheck: installcheck-am\ninstall-strip:\n\tif test -z '$(STRIP)'; then \\\n\t  $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" \\\n\t    install_sh_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" INSTALL_STRIP_FLAG=-s \\\n\t      install; \\\n\telse \\\n\t  $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" \\\n\t    install_sh_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" INSTALL_STRIP_FLAG=-s \\\n\t    \"INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'\" install; \\\n\tfi\nmostlyclean-generic:\n\nclean-generic:\n\ndistclean-generic:\n\t-test -z \"$(CONFIG_CLEAN_FILES)\" || rm -f $(CONFIG_CLEAN_FILES)\n\t-test . = \"$(srcdir)\" || test -z \"$(CONFIG_CLEAN_VPATH_FILES)\" || rm -f $(CONFIG_CLEAN_VPATH_FILES)\n\nmaintainer-clean-generic:\n\t@echo \"This command is intended for maintainers to use\"\n\t@echo \"it deletes files that may require special tools to rebuild.\"\nclean: clean-am\n\nclean-am: clean-binPROGRAMS clean-generic clean-libtool mostlyclean-am\n\ndistclean: distclean-am\n\t-rm -rf ./$(DEPDIR)\n\t-rm -f Makefile\ndistclean-am: clean-am distclean-compile distclean-generic \\\n\tdistclean-tags\n\ndvi: dvi-am\n\ndvi-am:\n\nhtml: html-am\n\nhtml-am:\n\ninfo: info-am\n\ninfo-am:\n\ninstall-data-am:\n\ninstall-dvi: install-dvi-am\n\ninstall-dvi-am:\n\ninstall-exec-am: install-binPROGRAMS\n\ninstall-html: install-html-am\n\ninstall-html-am:\n\ninstall-info: install-info-am\n\ninstall-info-am:\n\ninstall-man:\n\ninstall-pdf: install-pdf-am\n\ninstall-pdf-am:\n\ninstall-ps: install-ps-am\n\ninstall-ps-am:\n\ninstallcheck-am:\n\nmaintainer-clean: maintainer-clean-am\n\t-rm -rf ./$(DEPDIR)\n\t-rm -f Makefile\nmaintainer-clean-am: distclean-am maintainer-clean-generic\n\nmostlyclean: mostlyclean-am\n\nmostlyclean-am: mostlyclean-compile mostlyclean-generic \\\n\tmostlyclean-libtool\n\npdf: pdf-am\n\npdf-am:\n\nps: ps-am\n\nps-am:\n\nuninstall-am: uninstall-binPROGRAMS\n\n.MAKE: install-am install-strip\n\n.PHONY: CTAGS GTAGS TAGS all all-am check check-am clean \\\n\tclean-binPROGRAMS clean-generic clean-libtool cscopelist-am \\\n\tctags ctags-am distclean distclean-compile distclean-generic \\\n\tdistclean-libtool distclean-tags distdir dvi dvi-am html \\\n\thtml-am info info-am install install-am install-binPROGRAMS \\\n\tinstall-data install-data-am install-dvi install-dvi-am \\\n\tinstall-exec install-exec-am install-html install-html-am \\\n\tinstall-info install-info-am install-man install-pdf \\\n\tinstall-pdf-am install-ps install-ps-am install-strip \\\n\tinstallcheck installcheck-am installdirs maintainer-clean \\\n\tmaintainer-clean-generic mostlyclean mostlyclean-compile \\\n\tmostlyclean-generic mostlyclean-libtool pdf pdf-am ps ps-am \\\n\ttags tags-am uninstall uninstall-am uninstall-binPROGRAMS\n\n.PRECIOUS: Makefile\n\n\n# Tell versions [3.59,3.63) of GNU make to not export all variables.\n# Otherwise a system limit (for SysV at least) may be exceeded.\n.NOEXPORT:\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/bin/bin.vcxproj",
    "content": "<Project ToolsVersion=\"15.0\" DefaultTargets=\"Build\" xmlns=\"http://schemas.microsoft.com/developer/msbuild/2003\">\n  <!--\n        Need ConfigurationType set before importing openfst.props!\n   -->\n  <PropertyGroup Label=\"Globals\">\n    <ProjectGuid>{84657A19-CAF2-49E8-8DB3-A428C19F460D}</ProjectGuid>\n    <ConfigurationType>Application</ConfigurationType>\n    <MultiBin>true</MultiBin>\n  </PropertyGroup>\n  <!-- - - - - - - - - - - - - - - - - - - - - - - - - - - - - -->\n  <Import Project=\"../openfst.props\" />\n  <!-- - - - - - - - - - - - - - - - - - - - - - - - - - - - - -->\n  <ItemGroup>\n    <ClCompile Include=\"*.cc\" />\n  </ItemGroup>\n  <ItemGroup>\n    <ProjectReference Include=\"..\\lib\\libfst.vcxproj\">\n      <Project>{de80efec-9ed9-4631-bd96-8568c31ed26d}</Project>\n    </ProjectReference>\n    <ProjectReference Include=\"..\\script\\libfstscript.vcxproj\">\n      <Project>{111f46ed-da1f-469b-b912-ba2acc2ff8e6}</Project>\n    </ProjectReference>\n  </ItemGroup>\n  <!-- - - - - - - - - - - - - - - - - - - - - - - - - - - - - -->\n  <Import Project=\"../openfst.targets\" />\n  <!-- - - - - - - - - - - - - - - - - - - - - - - - - - - - - -->\n</Project>\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/bin/fstarcsort-main.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Sorts arcs of an FST.\n\n#include <cstring>\n\n#include <memory>\n#include <string>\n\n#include <fst/flags.h>\n#include <fst/log.h>\n#include <fst/script/arcsort.h>\n#include <fst/script/getters.h>\n\nDECLARE_string(sort_type);\n\nint fstarcsort_main(int argc, char **argv) {\n  namespace s = fst::script;\n  using fst::script::MutableFstClass;\n\n  string usage = \"Sorts arcs of an FST.\\n\\n  Usage: \";\n  usage += argv[0];\n  usage += \" [in.fst [out.fst]]\\n\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n\n  if (argc > 3) {\n    ShowUsage();\n    return 1;\n  }\n\n  const string in_name =\n      (argc > 1 && (strcmp(argv[1], \"-\") != 0)) ? argv[1] : \"\";\n  const string out_name = argc > 2 ? argv[2] : \"\";\n\n  std::unique_ptr<MutableFstClass> fst(MutableFstClass::Read(in_name, true));\n  if (!fst) return 1;\n\n  s::ArcSortType sort_type;\n  if (!s::GetArcSortType(FLAGS_sort_type, &sort_type)) {\n    LOG(ERROR) << argv[0] << \": Unknown or unsupported sort type: \"\n               << FLAGS_sort_type;\n    return 1;\n  }\n\n  s::ArcSort(fst.get(), sort_type);\n\n  return !fst->Write(out_name);\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/bin/fstarcsort.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/compat.h>\n#include <fst/flags.h>\n\nDEFINE_string(sort_type, \"ilabel\",\n              \"Comparison method, one of: \\\"ilabel\\\", \\\"olabel\\\"\");\n\nint fstarcsort_main(int argc, char **argv);\n\nint main(int argc, char **argv) { return fstarcsort_main(argc, argv); }\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/bin/fstclosure-main.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Creates the Kleene closure of an FST.\n\n#include <cstring>\n\n#include <memory>\n#include <string>\n\n#include <fst/flags.h>\n#include <fst/script/closure.h>\n#include <fst/script/getters.h>\n\nDECLARE_bool(closure_plus);\n\nint fstclosure_main(int argc, char **argv) {\n  namespace s = fst::script;\n  using fst::script::MutableFstClass;\n\n  string usage = \"Creates the Kleene closure of an FST.\\n\\n  Usage: \";\n  usage += argv[0];\n  usage += \" [in.fst [out.fst]]\\n\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n  if (argc > 3) {\n    ShowUsage();\n    return 1;\n  }\n\n  const string in_name = (argc > 1 && strcmp(argv[1], \"-\") != 0) ? argv[1] : \"\";\n  const string out_name = argc > 2 ? argv[2] : \"\";\n\n  std::unique_ptr<MutableFstClass> fst(MutableFstClass::Read(in_name, true));\n  if (!fst) return 1;\n\n  s::Closure(fst.get(), s::GetClosureType(FLAGS_closure_plus));\n\n  return !fst->Write(out_name);\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/bin/fstclosure.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/flags.h>\n\nDEFINE_bool(closure_plus, false,\n            \"Do not add the empty path (T+ instead of T*)?\");\n\nint fstclosure_main(int argc, char **argv);\n\nint main(int argc, char **argv) { return fstclosure_main(argc, argv); }\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/bin/fstcompile-main.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Creates binary FSTs from simple text format used by AT&T.\n\n#include <cstring>\n\n#include <fstream>\n#include <istream>\n#include <memory>\n#include <string>\n\n#include <fst/flags.h>\n#include <fst/log.h>\n#include <fst/script/compile.h>\n\nDECLARE_bool(acceptor);\nDECLARE_string(arc_type);\nDECLARE_string(fst_type);\nDECLARE_string(isymbols);\nDECLARE_string(osymbols);\nDECLARE_string(ssymbols);\nDECLARE_bool(keep_isymbols);\nDECLARE_bool(keep_osymbols);\nDECLARE_bool(keep_state_numbering);\nDECLARE_bool(allow_negative_labels);\n\nint fstcompile_main(int argc, char **argv) {\n  namespace s = fst::script;\n  using fst::SymbolTable;\n  using fst::SymbolTableTextOptions;\n\n  string usage = \"Creates binary FSTs from simple text format.\\n\\n  Usage: \";\n  usage += argv[0];\n  usage += \" [text.fst [binary.fst]]\\n\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n  if (argc > 3) {\n    ShowUsage();\n    return 1;\n  }\n\n  string source = \"standard input\";\n  std::ifstream fstrm;\n  if (argc > 1 && strcmp(argv[1], \"-\") != 0) {\n    fstrm.open(argv[1]);\n    if (!fstrm) {\n      LOG(ERROR) << argv[0] << \": Open failed, file = \" << argv[1];\n      return 1;\n    }\n    source = argv[1];\n  }\n  std::istream &istrm = fstrm.is_open() ? fstrm : std::cin;\n\n  const SymbolTableTextOptions opts(FLAGS_allow_negative_labels);\n\n  std::unique_ptr<const SymbolTable> isyms;\n  if (!FLAGS_isymbols.empty()) {\n    isyms.reset(SymbolTable::ReadText(FLAGS_isymbols, opts));\n    if (!isyms) return 1;\n  }\n\n  std::unique_ptr<const SymbolTable> osyms;\n  if (!FLAGS_osymbols.empty()) {\n    osyms.reset(SymbolTable::ReadText(FLAGS_osymbols, opts));\n    if (!osyms) return 1;\n  }\n\n  std::unique_ptr<const SymbolTable> ssyms;\n  if (!FLAGS_ssymbols.empty()) {\n    ssyms.reset(SymbolTable::ReadText(FLAGS_ssymbols));\n    if (!ssyms) return 1;\n  }\n\n  const string dest = argc > 2 ? argv[2] : \"\";\n\n  s::CompileFst(istrm, source, dest, FLAGS_fst_type, FLAGS_arc_type,\n                isyms.get(), osyms.get(), ssyms.get(), FLAGS_acceptor,\n                FLAGS_keep_isymbols, FLAGS_keep_osymbols,\n                FLAGS_keep_state_numbering, FLAGS_allow_negative_labels);\n\n  return 0;\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/bin/fstcompile.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/flags.h>\n\nDEFINE_bool(acceptor, false, \"Input in acceptor format\");\nDEFINE_string(arc_type, \"standard\", \"Output arc type\");\nDEFINE_string(fst_type, \"vector\", \"Output FST type\");\nDEFINE_string(isymbols, \"\", \"Input label symbol table\");\nDEFINE_string(osymbols, \"\", \"Output label symbol table\");\nDEFINE_string(ssymbols, \"\", \"State label symbol table\");\nDEFINE_bool(keep_isymbols, false, \"Store input label symbol table with FST\");\nDEFINE_bool(keep_osymbols, false, \"Store output label symbol table with FST\");\nDEFINE_bool(keep_state_numbering, false, \"Do not renumber input states\");\nDEFINE_bool(allow_negative_labels, false,\n            \"Allow negative labels (not recommended; may cause conflicts)\");\n\nint fstcompile_main(int argc, char **argv);\n\nint main(int argc, char **argv) { return fstcompile_main(argc, argv); }\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/bin/fstcompose-main.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Composes two FSTs.\n\n#include <cstring>\n\n#include <memory>\n#include <string>\n\n#include <fst/flags.h>\n#include <fst/log.h>\n#include <fst/script/compose.h>\n#include <fst/script/getters.h>\n\nDECLARE_string(compose_filter);\nDECLARE_bool(connect);\n\nint fstcompose_main(int argc, char **argv) {\n  namespace s = fst::script;\n  using fst::ComposeFilter;\n  using fst::ComposeOptions;\n  using fst::script::FstClass;\n  using fst::script::VectorFstClass;\n\n  string usage = \"Composes two FSTs.\\n\\n  Usage: \";\n  usage += argv[0];\n  usage += \" in1.fst in2.fst [out.fst]\\n\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n  if (argc < 3 || argc > 4) {\n    ShowUsage();\n    return 1;\n  }\n\n  const string in1_name = strcmp(argv[1], \"-\") != 0 ? argv[1] : \"\";\n  const string in2_name =\n      (argc > 2 && (strcmp(argv[2], \"-\") != 0)) ? argv[2] : \"\";\n  const string out_name = argc > 3 ? argv[3] : \"\";\n\n  if (in1_name.empty() && in2_name.empty()) {\n    LOG(ERROR) << argv[0] << \": Can't take both inputs from standard input\";\n    return 1;\n  }\n\n  std::unique_ptr<FstClass> ifst1(FstClass::Read(in1_name));\n  if (!ifst1) return 1;\n\n  std::unique_ptr<FstClass> ifst2(FstClass::Read(in2_name));\n  if (!ifst2) return 1;\n\n  if (ifst1->ArcType() != ifst2->ArcType()) {\n    LOG(ERROR) << argv[0] << \": Input FSTs must have the same arc type\";\n    return 1;\n  }\n\n  VectorFstClass ofst(ifst1->ArcType());\n\n  ComposeFilter compose_filter;\n  if (!s::GetComposeFilter(FLAGS_compose_filter, &compose_filter)) {\n    LOG(ERROR) << argv[0] << \": Unknown or unsupported compose filter type: \"\n               << FLAGS_compose_filter;\n    return 1;\n  }\n\n  const ComposeOptions opts(FLAGS_connect, compose_filter);\n\n  s::Compose(*ifst1, *ifst2, &ofst, opts);\n\n  return !ofst.Write(out_name);\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/bin/fstcompose.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/flags.h>\n\nDEFINE_string(compose_filter, \"auto\",\n              \"Composition filter, one of: \\\"alt_sequence\\\", \\\"auto\\\", \"\n              \"\\\"match\\\", \\\"null\\\", \\\"sequence\\\", \\\"trivial\\\"\");\nDEFINE_bool(connect, true, \"Trim output\");\n\nint fstcompose_main(int argc, char **argv);\n\nint main(int argc, char **argv) { return fstcompose_main(argc, argv); }\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/bin/fstconcat-main.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Concatenates two FSTs.\n\n#include <cstring>\n\n#include <memory>\n#include <string>\n\n#include <fst/flags.h>\n#include <fst/log.h>\n#include <fst/script/concat.h>\n\nint fstconcat_main(int argc, char **argv) {\n  namespace s = fst::script;\n  using fst::script::FstClass;\n  using fst::script::MutableFstClass;\n\n  string usage = \"Concatenates two FSTs.\\n\\n  Usage: \";\n  usage += argv[0];\n  usage += \" in1.fst in2.fst [out.fst]\\n\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n  if (argc < 3 || argc > 4) {\n    ShowUsage();\n    return 1;\n  }\n\n  const string in1_name = strcmp(argv[1], \"-\") == 0 ? \"\" : argv[1];\n  const string in2_name = strcmp(argv[2], \"-\") == 0 ? \"\" : argv[2];\n  const string out_name = argc > 3 ? argv[3] : \"\";\n\n  if (in1_name.empty() && in2_name.empty()) {\n    LOG(ERROR) << argv[0] << \": Can't take both inputs from standard input\";\n    return 1;\n  }\n\n  std::unique_ptr<MutableFstClass> fst1(MutableFstClass::Read(in1_name, true));\n  if (!fst1) return 1;\n\n  std::unique_ptr<FstClass> fst2(FstClass::Read(in2_name));\n  if (!fst2) return 1;\n\n  s::Concat(fst1.get(), *fst2);\n\n  return !fst1->Write(out_name);\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/bin/fstconcat.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\nint fstconcat_main(int argc, char **argv);\n\nint main(int argc, char **argv) { return fstconcat_main(argc, argv); }\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/bin/fstconnect-main.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Removes useless (inaccessible or non-coaccessible) states and arcs from an\n// FST.\n\n#include <cstring>\n\n#include <memory>\n#include <string>\n\n#include <fst/flags.h>\n#include <fst/script/connect.h>\n\nint fstconnect_main(int argc, char **argv) {\n  namespace s = fst::script;\n  using fst::script::FstClass;\n  using fst::script::MutableFstClass;\n\n  string usage = \"Removes useless states and arcs from an FST.\\n\\n  Usage: \";\n  usage += argv[0];\n  usage += \" [in.fst [out.fst]]\\n\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n  if (argc > 3) {\n    ShowUsage();\n    return 1;\n  }\n\n  const string in_name = (argc > 1 && strcmp(argv[1], \"-\") != 0) ? argv[1] : \"\";\n  const string out_name = argc > 2 ? argv[2] : \"\";\n\n  std::unique_ptr<MutableFstClass> fst(MutableFstClass::Read(in_name, true));\n  if (!fst) return 1;\n\n  s::Connect(fst.get());\n\n  return !fst->Write(out_name);\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/bin/fstconnect.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\nint fstconnect_main(int argc, char **argv);\n\nint main(int argc, char **argv) { return fstconnect_main(argc, argv); }\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/bin/fstconvert-main.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Converts an FST to another type.\n\n#include <cstring>\n\n#include <memory>\n#include <string>\n\n#include <fst/flags.h>\n#include <fst/script/convert.h>\n\nDECLARE_string(fst_type);\n\nint fstconvert_main(int argc, char **argv) {\n  namespace s = fst::script;\n  using fst::script::FstClass;\n\n  string usage = \"Converts an FST to another type.\\n\\n  Usage: \";\n  usage += argv[0];\n  usage += \" [in.fst [out.fst]]\\n\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n  if (argc > 3) {\n    ShowUsage();\n    return 1;\n  }\n\n  const string in_name = (argc > 1 && strcmp(argv[1], \"-\") != 0) ? argv[1] : \"\";\n  const string out_name = argc > 2 ? argv[2] : \"\";\n\n  std::unique_ptr<FstClass> ifst(FstClass::Read(in_name));\n  if (!ifst) return 1;\n\n  if (ifst->FstType() != FLAGS_fst_type) {\n    std::unique_ptr<FstClass> ofst(s::Convert(*ifst, FLAGS_fst_type));\n    if (!ofst) return 1;\n    return !ofst->Write(out_name);\n  } else {\n    return !ifst->Write(out_name);\n  }\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/bin/fstconvert.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/flags.h>\n\nDEFINE_string(fst_type, \"vector\", \"Output FST type\");\n\nint fstconvert_main(int argc, char **argv);\n\nint main(int argc, char **argv) { return fstconvert_main(argc, argv); }\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/bin/fstdeterminize-main.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Determinizes an FST.\n\n#include <cstring>\n\n#include <memory>\n#include <string>\n\n#include <fst/flags.h>\n#include <fst/script/determinize.h>\n#include <fst/script/getters.h>\n\nDECLARE_double(delta);\nDECLARE_string(weight);\nDECLARE_int64(nstate);\nDECLARE_int64(subsequential_label);\nDECLARE_string(det_type);\nDECLARE_bool(increment_subsequential_label);\n\nint fstdeterminize_main(int argc, char **argv) {\n  namespace s = fst::script;\n  using fst::DeterminizeType;\n  using fst::script::FstClass;\n  using fst::script::VectorFstClass;\n  using fst::script::WeightClass;\n\n  string usage = \"Determinizes an FST.\\n\\n  Usage: \";\n  usage += argv[0];\n  usage += \" [in.fst [out.fst]]\\n\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n  if (argc > 3) {\n    ShowUsage();\n    return 1;\n  }\n\n  DeterminizeType det_type;\n  if (!s::GetDeterminizeType(FLAGS_det_type, &det_type)) {\n    LOG(ERROR) << argv[0] << \": Unknown or unsupported determinization type: \"\n                          << FLAGS_det_type;\n    return 1;\n  }\n\n  const string in_name = (argc > 1 && strcmp(argv[1], \"-\") != 0) ? argv[1] : \"\";\n  const string out_name = argc > 2 ? argv[2] : \"\";\n\n  std::unique_ptr<FstClass> ifst(FstClass::Read(in_name));\n  if (!ifst) return 1;\n\n  VectorFstClass ofst(ifst->ArcType());\n\n  const auto weight_threshold =\n      FLAGS_weight.empty() ? WeightClass::Zero(ifst->WeightType())\n                           : WeightClass(ifst->WeightType(), FLAGS_weight);\n\n  const s::DeterminizeOptions opts(FLAGS_delta, weight_threshold, FLAGS_nstate,\n                                   FLAGS_subsequential_label, det_type,\n                                   FLAGS_increment_subsequential_label);\n\n  s::Determinize(*ifst, &ofst, opts);\n\n  return !ofst.Write(out_name);\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/bin/fstdeterminize.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/flags.h>\n#include <fst/fst.h>\n#include <fst/weight.h>\n\nDEFINE_double(delta, fst::kDelta, \"Comparison/quantization delta\");\nDEFINE_string(weight, \"\", \"Weight threshold\");\nDEFINE_int64(nstate, fst::kNoStateId, \"State number threshold\");\nDEFINE_int64(subsequential_label, 0,\n             \"Input label of arc corresponding to residual final output when\"\n             \" producing a subsequential transducer\");\nDEFINE_string(det_type, \"functional\",\n              \"Type of determinization: \\\"functional\\\", \"\n              \"\\\"nonfunctional\\\", \\\"disambiguate\\\"\");\nDEFINE_bool(increment_subsequential_label, false,\n            \"Increment subsequential_label to obtain distinct labels for \"\n            \" subsequential arcs at a given state\");\n\nint fstdeterminize_main(int argc, char **argv);\n\nint main(int argc, char **argv) { return fstdeterminize_main(argc, argv); }\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/bin/fstdifference-main.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Subtracts an unweighted DFA from an FSA.\n\n#include <cstring>\n\n#include <memory>\n#include <string>\n\n#include <fst/flags.h>\n#include <fst/log.h>\n#include <fst/script/getters.h>\n#include <fst/script/difference.h>\n\nDECLARE_string(compose_filter);\nDECLARE_bool(connect);\n\nint fstdifference_main(int argc, char **argv) {\n  namespace s = fst::script;\n  using fst::ComposeFilter;\n  using fst::DifferenceOptions;\n  using fst::script::FstClass;\n  using fst::script::VectorFstClass;\n\n  string usage = \"Subtracts an unweighted DFA from an FSA.\\n\\n  Usage: \";\n  usage += argv[0];\n  usage += \" in1.fst in2.fst [out.fst]\\n\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n  if (argc < 3 || argc > 4) {\n    ShowUsage();\n    return 1;\n  }\n\n  const string in1_name = strcmp(argv[1], \"-\") == 0 ? \"\" : argv[1];\n  const string in2_name = strcmp(argv[2], \"-\") == 0 ? \"\" : argv[2];\n  const string out_name = argc > 3 ? argv[3] : \"\";\n\n  if (in1_name.empty() && in2_name.empty()) {\n    LOG(ERROR) << argv[0] << \": Can't take both inputs from standard input\";\n    return 1;\n  }\n\n  std::unique_ptr<FstClass> ifst1(FstClass::Read(in1_name));\n  if (!ifst1) return 1;\n\n  std::unique_ptr<FstClass> ifst2(FstClass::Read(in2_name));\n  if (!ifst2) return 1;\n\n  VectorFstClass ofst(ifst1->ArcType());\n\n  ComposeFilter compose_filter;\n  if (!s::GetComposeFilter(FLAGS_compose_filter, &compose_filter)) {\n    LOG(ERROR) << argv[0] << \": Unknown or unsupported compose filter type: \"\n               << FLAGS_compose_filter;\n    return 1;\n  }\n\n  const DifferenceOptions opts(FLAGS_connect, compose_filter);\n\n  s::Difference(*ifst1, *ifst2, &ofst, opts);\n\n  return !ofst.Write(out_name);\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/bin/fstdifference.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/flags.h>\n\nDEFINE_string(compose_filter, \"auto\",\n              \"Composition filter, one of: \\\"alt_sequence\\\", \\\"auto\\\", \"\n              \"\\\"match\\\", \\\"null\\\", \\\"sequence\\\", \\\"trivial\\\"\");\nDEFINE_bool(connect, true, \"Trim output\");\n\nint fstdifference_main(int argc, char **argv);\n\nint main(int argc, char **argv) { return fstdifference_main(argc, argv); }\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/bin/fstdisambiguate-main.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Disambiguates an FST.\n\n#include <cstring>\n\n#include <memory>\n#include <string>\n\n#include <fst/flags.h>\n#include <fst/script/disambiguate.h>\n\nDECLARE_double(delta);\nDECLARE_int64(nstate);\nDECLARE_string(weight);\nDECLARE_int64(subsequential_label);\n\nint fstdisambiguate_main(int argc, char **argv) {\n  namespace s = fst::script;\n  using fst::script::FstClass;\n  using fst::script::VectorFstClass;\n  using fst::script::WeightClass;\n\n  string usage = \"Disambiguates an FST.\\n\\n  Usage: \";\n  usage += argv[0];\n  usage += \" [in.fst [out.fst]]\\n\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n  if (argc > 3) {\n    ShowUsage();\n    return 1;\n  }\n\n  const string in_name = (argc > 1 && strcmp(argv[1], \"-\") != 0) ? argv[1] : \"\";\n  const string out_name = argc > 2 ? argv[2] : \"\";\n\n  std::unique_ptr<FstClass> ifst(FstClass::Read(in_name));\n  if (!ifst) return 1;\n\n  VectorFstClass ofst(ifst->ArcType());\n\n  const auto weight_threshold =\n      FLAGS_weight.empty() ? WeightClass::Zero(ifst->WeightType())\n                           : WeightClass(ifst->WeightType(), FLAGS_weight);\n\n  const s::DisambiguateOptions opts(FLAGS_delta, weight_threshold, FLAGS_nstate,\n                                    FLAGS_subsequential_label);\n\n  s::Disambiguate(*ifst, &ofst, opts);\n\n  return !ofst.Write(out_name);\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/bin/fstdisambiguate.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/flags.h>\n#include <fst/fst.h>\n#include <fst/weight.h>\n\nDEFINE_double(delta, fst::kDelta, \"Comparison/quantization delta\");\nDEFINE_int64(nstate, fst::kNoStateId, \"State number threshold\");\nDEFINE_string(weight, \"\", \"Weight threshold\");\nDEFINE_int64(subsequential_label, 0,\n             \"Input label of arc corresponding to residual final output when\"\n             \" producing a subsequential transducer\");\n\nint fstdisambiguate_main(int argc, char **argv);\n\nint main(int argc, char **argv) { return fstdisambiguate_main(argc, argv); }\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/bin/fstdraw-main.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Draws a binary FSTs in the Graphviz dot text format.\n\n#include <cstring>\n\n#include <fstream>\n#include <memory>\n#include <ostream>\n#include <string>\n\n#include <fst/flags.h>\n#include <fst/log.h>\n#include <fst/script/draw.h>\n\nDECLARE_bool(acceptor);\nDECLARE_string(isymbols);\nDECLARE_string(osymbols);\nDECLARE_string(ssymbols);\nDECLARE_bool(numeric);\nDECLARE_int32(precision);\nDECLARE_string(float_format);\nDECLARE_bool(show_weight_one);\nDECLARE_string(title);\nDECLARE_bool(portrait);\nDECLARE_bool(vertical);\nDECLARE_int32(fontsize);\nDECLARE_double(height);\nDECLARE_double(width);\nDECLARE_double(nodesep);\nDECLARE_double(ranksep);\nDECLARE_bool(allow_negative_labels);\n\nint fstdraw_main(int argc, char **argv) {\n  namespace s = fst::script;\n  using fst::script::FstClass;\n  using fst::SymbolTable;\n  using fst::SymbolTableTextOptions;\n\n  string usage = \"Prints out binary FSTs in dot text format.\\n\\n  Usage: \";\n  usage += argv[0];\n  usage += \" [binary.fst [text.dot]]\\n\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n  if (argc > 3) {\n    ShowUsage();\n    return 1;\n  }\n\n  const string in_name = (argc > 1 && strcmp(argv[1], \"-\") != 0) ? argv[1] : \"\";\n\n  std::unique_ptr<FstClass> fst(FstClass::Read(in_name));\n  if (!fst) return 1;\n\n  string dest = \"stdout\";\n  std::ofstream fstrm;\n  if (argc == 3) {\n    fstrm.open(argv[2]);\n    if (!fstrm) {\n      LOG(ERROR) << argv[0] << \": Open failed, file = \" << argv[2];\n      return 1;\n    }\n    dest = argv[2];\n  }\n  std::ostream &ostrm = fstrm.is_open() ? fstrm : std::cout;\n\n  const SymbolTableTextOptions opts(FLAGS_allow_negative_labels);\n\n  std::unique_ptr<const SymbolTable> isyms;\n  if (!FLAGS_isymbols.empty() && !FLAGS_numeric) {\n    isyms.reset(SymbolTable::ReadText(FLAGS_isymbols, opts));\n    if (!isyms) return 1;\n  }\n\n  std::unique_ptr<const SymbolTable> osyms;\n  if (!FLAGS_osymbols.empty() && !FLAGS_numeric) {\n    osyms.reset(SymbolTable::ReadText(FLAGS_osymbols, opts));\n    if (!osyms) return 1;\n  }\n\n  std::unique_ptr<const SymbolTable> ssyms;\n  if (!FLAGS_ssymbols.empty() && !FLAGS_numeric) {\n    ssyms.reset(SymbolTable::ReadText(FLAGS_ssymbols));\n    if (!ssyms) return 1;\n  }\n\n  if (!isyms && !FLAGS_numeric && fst->InputSymbols()) {\n    isyms.reset(fst->InputSymbols()->Copy());\n  }\n\n  if (!osyms && !FLAGS_numeric && fst->OutputSymbols()) {\n    osyms.reset(fst->OutputSymbols()->Copy());\n  }\n\n  s::DrawFst(*fst, isyms.get(), osyms.get(), ssyms.get(), FLAGS_acceptor,\n             FLAGS_title, FLAGS_width, FLAGS_height, FLAGS_portrait,\n             FLAGS_vertical, FLAGS_ranksep, FLAGS_nodesep, FLAGS_fontsize,\n             FLAGS_precision, FLAGS_float_format, FLAGS_show_weight_one,\n             &ostrm, dest);\n\n  return 0;\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/bin/fstdraw.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/flags.h>\n\nDEFINE_bool(acceptor, false, \"Input in acceptor format\");\nDEFINE_string(isymbols, \"\", \"Input label symbol table\");\nDEFINE_string(osymbols, \"\", \"Output label symbol table\");\nDEFINE_string(ssymbols, \"\", \"State label symbol table\");\nDEFINE_bool(numeric, false, \"Print numeric labels\");\nDEFINE_int32(precision, 5, \"Set precision (number of char/float)\");\nDEFINE_string(float_format, \"g\",\n              \"Floating-point format, one of: \\\"e\\\", \\\"f\\\", or \\\"g\\\"\");\nDEFINE_bool(show_weight_one, false,\n            \"Print/draw arc weights and final weights equal to Weight::One()\");\nDEFINE_string(title, \"\", \"Set figure title\");\nDEFINE_bool(portrait, false, \"Portrait mode (def: landscape)\");\nDEFINE_bool(vertical, false, \"Draw bottom-to-top instead of left-to-right\");\nDEFINE_int32(fontsize, 14, \"Set fontsize\");\nDEFINE_double(height, 11, \"Set height\");\nDEFINE_double(width, 8.5, \"Set width\");\nDEFINE_double(nodesep, 0.25,\n              \"Set minimum separation between nodes (see dot documentation)\");\nDEFINE_double(ranksep, 0.40,\n              \"Set minimum separation between ranks (see dot documentation)\");\nDEFINE_bool(allow_negative_labels, false,\n            \"Allow negative labels (not recommended; may cause conflicts)\");\n\nint fstdraw_main(int argc, char **argv);\n\nint main(int argc, char **argv) { return fstdraw_main(argc, argv); }\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/bin/fstencode-main.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Encode transducer labels and/or weights.\n\n#include <cstring>\n\n#include <memory>\n#include <string>\n\n#include <fst/flags.h>\n#include <fst/script/decode.h>\n#include <fst/script/encode.h>\n#include <fst/script/getters.h>\n\nDECLARE_bool(encode_labels);\nDECLARE_bool(encode_weights);\nDECLARE_bool(encode_reuse);\nDECLARE_bool(decode);\n\nint fstencode_main(int argc, char **argv) {\n  namespace s = fst::script;\n  using fst::script::FstClass;\n  using fst::script::MutableFstClass;\n\n  string usage = \"Encodes transducer labels and/or weights.\\n\\n  Usage: \";\n  usage += argv[0];\n  usage += \" in.fst codex [out.fst]\\n\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n  if (argc < 3 || argc > 4) {\n    ShowUsage();\n    return 1;\n  }\n\n  const string in_name = (strcmp(argv[1], \"-\") != 0) ? argv[1] : \"\";\n  const string codex_name = argv[2];\n  const string out_name = argc > 3 ? argv[3] : \"\";\n\n  std::unique_ptr<MutableFstClass> fst(MutableFstClass::Read(in_name, true));\n  if (!fst) return 1;\n\n  if (FLAGS_decode) {\n    s::Decode(fst.get(), codex_name);\n    return !fst->Write(out_name);\n  } else {\n    const auto flags =\n        s::GetEncodeFlags(FLAGS_encode_labels, FLAGS_encode_weights);\n    s::Encode(fst.get(), flags, FLAGS_encode_reuse, codex_name);\n    return !fst->Write(out_name);\n  }\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/bin/fstencode.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/flags.h>\n\nDEFINE_bool(encode_labels, false, \"Encode output labels\");\nDEFINE_bool(encode_weights, false, \"Encode weights\");\nDEFINE_bool(encode_reuse, false, \"Re-use existing codex\");\nDEFINE_bool(decode, false, \"Decode labels and/or weights\");\n\nint fstencode_main(int argc, char **argv);\n\nint main(int argc, char **argv) { return fstencode_main(argc, argv); }\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/bin/fstepsnormalize-main.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Epsilon-normalizes an FST.\n\n#include <cstring>\n\n#include <memory>\n#include <string>\n\n#include <fst/flags.h>\n#include <fst/script/epsnormalize.h>\n#include <fst/script/getters.h>\n\nDECLARE_bool(eps_norm_output);\n\nint fstepsnormalize_main(int argc, char **argv) {\n  namespace s = fst::script;\n  using fst::script::FstClass;\n  using fst::script::VectorFstClass;\n\n  string usage = \"Epsilon normalizes an FST.\\n\\n  Usage: \";\n  usage += argv[0];\n  usage += \" [in.fst [out.fst]]\\n\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n  if (argc > 3) {\n    ShowUsage();\n    return 1;\n  }\n\n  const string in_name = (argc > 1 && strcmp(argv[1], \"-\") != 0) ? argv[1] : \"\";\n  const string out_name = argc > 2 ? argv[2] : \"\";\n\n  std::unique_ptr<FstClass> ifst(FstClass::Read(in_name));\n  if (!ifst) return 1;\n\n  VectorFstClass ofst(ifst->ArcType());\n\n  s::EpsNormalize(*ifst, &ofst, s::GetEpsNormalizeType(FLAGS_eps_norm_output));\n\n  return !ofst.Write(out_name);\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/bin/fstepsnormalize.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/flags.h>\n\nDEFINE_bool(eps_norm_output, false, \"Normalize output epsilons\");\n\nint fstepsnormalize_main(int argc, char **argv);\n\nint main(int argc, char **argv) { return fstepsnormalize_main(argc, argv); }\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/bin/fstequal-main.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Two FSTS are equal iff their exit status is zero.\n\n#include <cstring>\n\n#include <memory>\n#include <string>\n\n#include <fst/flags.h>\n#include <fst/log.h>\n#include <fst/script/equal.h>\n\nDECLARE_double(delta);\n\nint fstequal_main(int argc, char **argv) {\n  namespace s = fst::script;\n  using fst::script::FstClass;\n\n  string usage = \"Two FSTs are equal iff the exit status is zero.\\n\\n  Usage: \";\n  usage += argv[0];\n  usage += \" in1.fst in2.fst\\n\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n  if (argc != 3) {\n    ShowUsage();\n    return 1;\n  }\n\n  const string in1_name = strcmp(argv[1], \"-\") == 0 ? \"\" : argv[1];\n  const string in2_name = strcmp(argv[2], \"-\") == 0 ? \"\" : argv[2];\n\n  if (in1_name.empty() && in2_name.empty()) {\n    LOG(ERROR) << argv[0] << \": Can't take both inputs from standard input\";\n    return 1;\n  }\n\n  std::unique_ptr<FstClass> ifst1(FstClass::Read(in1_name));\n  if (!ifst1) return 1;\n\n  std::unique_ptr<FstClass> ifst2(FstClass::Read(in2_name));\n  if (!ifst2) return 1;\n\n  bool result = s::Equal(*ifst1, *ifst2, FLAGS_delta);\n  if (!result) VLOG(1) << \"FSTs are not equal.\";\n\n  return result ? 0 : 2;\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/bin/fstequal.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/flags.h>\n#include <fst/weight.h>\n\nDEFINE_double(delta, fst::kDelta, \"Comparison/quantization delta\");\n\nint fstequal_main(int argc, char **argv);\n\nint main(int argc, char **argv) { return fstequal_main(argc, argv); }\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/bin/fstequivalent-main.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Two DFAs are equivalent iff their exit status is zero.\n\n#include <cstring>\n\n#include <memory>\n#include <string>\n\n#include <fst/flags.h>\n#include <fst/log.h>\n#include <fst/script/equivalent.h>\n#include <fst/script/getters.h>\n#include <fst/script/randequivalent.h>\n\nDECLARE_double(delta);\nDECLARE_bool(random);\nDECLARE_int32(max_length);\nDECLARE_int32(npath);\nDECLARE_int32(seed);\nDECLARE_string(select);\n\nint fstequivalent_main(int argc, char **argv) {\n  namespace s = fst::script;\n  using fst::RandGenOptions;\n  using fst::script::FstClass;\n\n  string usage =\n      \"Two DFAs are equivalent iff the exit status is zero.\\n\\n\"\n      \"  Usage: \";\n  usage += argv[0];\n  usage += \" in1.fst in2.fst\\n\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n  if (argc != 3) {\n    ShowUsage();\n    return 1;\n  }\n\n  const string in1_name = strcmp(argv[1], \"-\") == 0 ? \"\" : argv[1];\n  const string in2_name = strcmp(argv[2], \"-\") == 0 ? \"\" : argv[2];\n\n  if (in1_name.empty() && in2_name.empty()) {\n    LOG(ERROR) << argv[0] << \": Can't take both inputs from standard input\";\n    return 1;\n  }\n\n  std::unique_ptr<FstClass> ifst1(FstClass::Read(in1_name));\n  if (!ifst1) return 1;\n\n  std::unique_ptr<FstClass> ifst2(FstClass::Read(in2_name));\n  if (!ifst2) return 1;\n\n  if (!FLAGS_random) {\n    bool result = s::Equivalent(*ifst1, *ifst2, FLAGS_delta);\n    if (!result) VLOG(1) << \"FSTs are not equivalent\";\n    return result ? 0 : 2;\n  } else {\n    s::RandArcSelection ras;\n    if (!s::GetRandArcSelection(FLAGS_select, &ras)) {\n      LOG(ERROR) << argv[0] << \": Unknown or unsupported select type \"\n                            << FLAGS_select;\n      return 1;\n    }\n    const RandGenOptions<s::RandArcSelection> opts(ras, FLAGS_max_length);\n    bool result = s::RandEquivalent(*ifst1, *ifst2, FLAGS_npath, FLAGS_delta,\n                                    FLAGS_seed, opts);\n    if (!result) VLOG(1) << \"FSTs are not equivalent\";\n    return result ? 0 : 2;\n  }\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/bin/fstequivalent.cc",
    "content": "#ifndef _MSC_VER\n#include <unistd.h>\n#else\n#include <process.h>\n#define getpid _getpid\n#endif\n\n#include <climits>\n#include <ctime>\n\n#include <fst/flags.h>\n#include <fst/weight.h>\n\nDEFINE_double(delta, fst::kDelta, \"Comparison/quantization delta\");\nDEFINE_bool(random, false,\n            \"Test equivalence by randomly selecting paths in the input FSTs\");\nDEFINE_int32(max_length, INT32_MAX, \"Maximum path length\");\nDEFINE_int32(npath, 1, \"Number of paths to generate\");\nDEFINE_int32(seed, time(nullptr) + getpid(), \"Random seed\");\nDEFINE_string(select, \"uniform\",\n              \"Selection type: one of: \"\n              \" \\\"uniform\\\", \\\"log_prob\\\" (when appropriate),\"\n              \" \\\"fast_log_prob\\\" (when appropriate)\");\n\nint fstequivalent_main(int argc, char **argv);\n\nint main(int argc, char **argv) { return fstequivalent_main(argc, argv); }\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/bin/fstinfo-main.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Prints out various information about an FST such as number of states\n// and arcs and property values (see properties.h).\n\n#include <cstring>\n\n#include <memory>\n#include <string>\n\n#include <fst/flags.h>\n#include <fst/script/info.h>\n\nDECLARE_string(arc_filter);\nDECLARE_string(info_type);\nDECLARE_bool(pipe);\nDECLARE_bool(test_properties);\nDECLARE_bool(fst_verify);\n\nint fstinfo_main(int argc, char **argv) {\n  namespace s = fst::script;\n  using fst::script::FstClass;\n\n  string usage = \"Prints out information about an FST.\\n\\n  Usage: \";\n  usage += argv[0];\n  usage += \" [in.fst]\\n\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n  if (argc > 2) {\n    ShowUsage();\n    return 1;\n  }\n\n  const string in_name =\n      (argc > 1 && (strcmp(argv[1], \"-\") != 0)) ? argv[1] : \"\";\n\n  std::unique_ptr<FstClass> ifst(FstClass::Read(in_name));\n  if (!ifst) return 1;\n\n  s::PrintFstInfo(*ifst, FLAGS_test_properties, FLAGS_arc_filter,\n                  FLAGS_info_type, FLAGS_fst_verify, FLAGS_pipe);\n\n  return 0;\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/bin/fstinfo.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/flags.h>\n\nDEFINE_string(arc_filter, \"any\",\n              \"Arc filter: one of:\"\n              \" \\\"any\\\", \\\"epsilon\\\", \\\"iepsilon\\\", \\\"oepsilon\\\"; \"\n              \"this only affects the counts of (co)accessible states, \"\n              \"connected states, and (strongly) connected components\");\nDEFINE_string(info_type, \"auto\",\n              \"Info format: one of: \\\"auto\\\", \\\"long\\\", \\\"short\\\"\");\nDEFINE_bool(pipe, false, \"Send info to stderr, input to stdout\");\nDEFINE_bool(test_properties, true,\n            \"Compute property values (if unknown to FST)\");\nDEFINE_bool(fst_verify, true, \"Verify FST sanity\");\n\nint fstinfo_main(int argc, char **argv);\n\nint main(int argc, char **argv) { return fstinfo_main(argc, argv); }\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/bin/fstintersect-main.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Intersects two FSTs.\n\n#include <cstring>\n\n#include <memory>\n#include <string>\n\n#include <fst/flags.h>\n#include <fst/log.h>\n#include <fst/script/getters.h>\n#include <fst/script/intersect.h>\n\nDECLARE_string(compose_filter);\nDECLARE_bool(connect);\n\nint fstintersect_main(int argc, char **argv) {\n  namespace s = fst::script;\n  using fst::ComposeFilter;\n  using fst::script::FstClass;\n  using fst::script::VectorFstClass;\n\n  string usage = \"Intersects two FSAs.\\n\\n  Usage: \";\n  usage += argv[0];\n  usage += \" in1.fst in2.fst [out.fst]\\n\";\n  usage += \"  Flags: connect\\n\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n  if (argc < 3 || argc > 4) {\n    ShowUsage();\n    return 1;\n  }\n\n  const string in1_name = strcmp(argv[1], \"-\") == 0 ? \"\" : argv[1];\n  const string in2_name = strcmp(argv[2], \"-\") == 0 ? \"\" : argv[2];\n  const string out_name = argc > 3 ? argv[3] : \"\";\n\n  if (in1_name.empty() && in2_name.empty()) {\n    LOG(ERROR) << argv[0] << \": Can't take both inputs from standard input\";\n    return 1;\n  }\n\n  std::unique_ptr<FstClass> ifst1(FstClass::Read(in1_name));\n  if (!ifst1) return 1;\n  std::unique_ptr<FstClass> ifst2(FstClass::Read(in2_name));\n  if (!ifst2) return 1;\n\n  VectorFstClass ofst(ifst1->ArcType());\n\n  ComposeFilter compose_filter;\n  if (!s::GetComposeFilter(FLAGS_compose_filter, &compose_filter)) {\n    LOG(ERROR) << argv[0] << \": Unknown or unsupported compose filter type: \"\n               << FLAGS_compose_filter;\n    return 1;\n  }\n\n  const fst::IntersectOptions opts(FLAGS_connect, compose_filter);\n\n  s::Intersect(*ifst1, *ifst2, &ofst, opts);\n\n  return !ofst.Write(out_name);\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/bin/fstintersect.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/flags.h>\n\nDEFINE_string(compose_filter, \"auto\",\n             \"Composition filter, one of: \\\"alt_sequence\\\", \\\"auto\\\", \"\n              \"\\\"match\\\", \\\"null\\\", \\\"sequence\\\", \\\"trivial\\\"\");\nDEFINE_bool(connect, true, \"Trim output\");\n\nint fstintersect_main(int argc, char **argv);\n\nint main(int argc, char **argv) { return fstintersect_main(argc, argv); }\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/bin/fstinvert-main.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Inverts a transduction.\n\n#include <cstring>\n\n#include <memory>\n#include <string>\n\n#include <fst/flags.h>\n#include <fst/script/invert.h>\n\nint fstinvert_main(int argc, char **argv) {\n  namespace s = fst::script;\n  using fst::script::MutableFstClass;\n\n  string usage = \"Inverts a transduction.\\n\\n  Usage: \";\n  usage += argv[0];\n  usage += \" [in.fst [out.fst]]\\n\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n  if (argc > 3) {\n    ShowUsage();\n    return 1;\n  }\n\n  const string in_name = (argc > 1 && strcmp(argv[1], \"-\") != 0) ? argv[1] : \"\";\n  const string out_name = argc > 2 ? argv[2] : \"\";\n\n  std::unique_ptr<MutableFstClass> fst(MutableFstClass::Read(in_name, true));\n  if (!fst) return 1;\n\n  s::Invert(fst.get());\n\n  return !fst->Write(out_name);\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/bin/fstinvert.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\nint fstinvert_main(int argc, char **argv);\n\nint main(int argc, char **argv) { return fstinvert_main(argc, argv); }\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/bin/fstisomorphic-main.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Two FSTS are isomorphic (equal up to state and arc re-ordering) iff their\n// exit status is zero. FSTs should be deterministic when viewed as unweighted\n// automata.\n\n#include <cstring>\n\n#include <memory>\n#include <string>\n\n#include <fst/flags.h>\n#include <fst/log.h>\n#include <fst/script/isomorphic.h>\n\nDECLARE_double(delta);\n\nint fstisomorphic_main(int argc, char **argv) {\n  namespace s = fst::script;\n  using fst::script::FstClass;\n\n  string usage =\n      \"Two FSTs are isomorphic iff the exit status is zero.\\n\\n  Usage: \";\n  usage += argv[0];\n  usage += \" in1.fst in2.fst\\n\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n  if (argc != 3) {\n    ShowUsage();\n    return 1;\n  }\n\n  const string in1_name = strcmp(argv[1], \"-\") == 0 ? \"\" : argv[1];\n  const string in2_name = strcmp(argv[2], \"-\") == 0 ? \"\" : argv[2];\n\n  if (in1_name.empty() && in2_name.empty()) {\n    LOG(ERROR) << argv[0] << \": Can't take both inputs from standard input\";\n    return 1;\n  }\n\n  std::unique_ptr<FstClass> ifst1(FstClass::Read(in1_name));\n  if (!ifst1) return 1;\n\n  std::unique_ptr<FstClass> ifst2(FstClass::Read(in2_name));\n  if (!ifst2) return 1;\n\n  bool result = s::Isomorphic(*ifst1, *ifst2, FLAGS_delta);\n  if (!result) VLOG(1) << \"FSTs are not isomorphic\";\n\n  return result ? 0 : 2;\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/bin/fstisomorphic.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/flags.h>\n#include <fst/weight.h>\n\nDEFINE_double(delta, fst::kDelta, \"Comparison/quantization delta\");\n\nint fstisomorphic_main(int argc, char **argv);\n\nint main(int argc, char **argv) { return fstisomorphic_main(argc, argv); }\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/bin/fstmap-main.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Applies an operation to each arc of an FST.\n\n#include <cstring>\n\n#include <memory>\n#include <string>\n\n#include <fst/flags.h>\n#include <fst/log.h>\n#include <fst/script/getters.h>\n#include <fst/script/map.h>\n\nDECLARE_double(delta);\nDECLARE_string(map_type);\nDECLARE_double(power);\nDECLARE_string(weight);\n\nint fstmap_main(int argc, char **argv) {\n  namespace s = fst::script;\n  using fst::script::FstClass;\n  using fst::script::WeightClass;\n\n  string usage = \"Applies an operation to each arc of an FST.\\n\\n  Usage: \";\n  usage += argv[0];\n  usage += \" [in.fst [out.fst]]\\n\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n  if (argc > 3) {\n    ShowUsage();\n    return 1;\n  }\n\n  const string in_name = (argc > 1 && strcmp(argv[1], \"-\") != 0) ? argv[1] : \"\";\n  const string out_name = argc > 2 ? argv[2] : \"\";\n\n  std::unique_ptr<FstClass> ifst(FstClass::Read(in_name));\n  if (!ifst) return 1;\n\n  s::MapType map_type;\n  if (!s::GetMapType(FLAGS_map_type, &map_type)) {\n    LOG(ERROR) << argv[0] << \": Unknown or unsupported map type \"\n               << FLAGS_map_type;\n    return 1;\n  }\n\n  const auto weight_param =\n      !FLAGS_weight.empty()\n          ? WeightClass(ifst->WeightType(), FLAGS_weight)\n          : (FLAGS_map_type == \"times\" ? WeightClass::One(ifst->WeightType())\n                                       : WeightClass::Zero(ifst->WeightType()));\n\n  std::unique_ptr<FstClass> ofst(\n      s::Map(*ifst, map_type, FLAGS_delta, FLAGS_power, weight_param));\n\n  return !ofst->Write(out_name);\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/bin/fstmap.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/flags.h>\n#include <fst/weight.h>\n\nDEFINE_double(delta, fst::kDelta, \"Comparison/quantization delta\");\nDEFINE_string(map_type, \"identity\",\n              \"Map operation, one of: \\\"arc_sum\\\", \\\"arc_unique\\\", \"\n              \"\\\"float_power\\\" (--power)\\\", \\\"identity\\\", \\\"input_epsilon\\\", \"\n              \"\\\"invert\\\", \\\"output_epsilon\\\", \\\"plus (--weight)\\\", \"\n              \"\\\"quantize (--delta)\\\", \\\"rmweight\\\", \\\"superfinal\\\", \"\n              \"\\\"power (--power)\\\", \\\"times (--weight)\\\", \\\"to_log\\\", \"\n              \"\\\"to_log64\\\", \\\"to_std\\\"\");\nDEFINE_double(power, 1.0, \"Power parameter\");\nDEFINE_string(weight, \"\", \"Weight parameter\");\n\nint fstmap_main(int argc, char **argv);\n\nint main(int argc, char **argv) { return fstmap_main(argc, argv); }\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/bin/fstminimize-main.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Minimizes a deterministic FST.\n\n#include <cstring>\n\n#include <memory>\n#include <string>\n\n#include <fst/flags.h>\n#include <fst/log.h>\n#include <fst/script/minimize.h>\n\nDECLARE_double(delta);\nDECLARE_bool(allow_nondet);\n\nint fstminimize_main(int argc, char **argv) {\n  namespace s = fst::script;\n  using fst::script::MutableFstClass;\n  using fst::script::VectorFstClass;\n\n  string usage = \"Minimizes a deterministic FST.\\n\\n  Usage: \";\n  usage += argv[0];\n  usage += \" [in.fst [out1.fst [out2.fst]]]\\n\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n  if (argc > 4) {\n    ShowUsage();\n    return 1;\n  }\n\n  const string in_name = (argc > 1 && strcmp(argv[1], \"-\") != 0) ? argv[1] : \"\";\n  const string out1_name =\n      (argc > 2 && strcmp(argv[2], \"-\") != 0) ? argv[2] : \"\";\n  const string out2_name =\n      (argc > 3 && strcmp(argv[3], \"-\") != 0) ? argv[3] : \"\";\n\n  if (out1_name.empty() && out2_name.empty() && argc > 3) {\n    LOG(ERROR) << argv[0] << \": Both outputs can't be standard output.\";\n    return 1;\n  }\n\n  std::unique_ptr<MutableFstClass> fst1(MutableFstClass::Read(in_name, true));\n  if (!fst1) return 1;\n\n  if (argc > 3) {\n    std::unique_ptr<MutableFstClass> fst2(new VectorFstClass(fst1->ArcType()));\n    s::Minimize(fst1.get(), fst2.get(), FLAGS_delta, FLAGS_allow_nondet);\n    if (!fst2->Write(out2_name)) return 1;\n  } else {\n    s::Minimize(fst1.get(), nullptr, FLAGS_delta, FLAGS_allow_nondet);\n  }\n\n  return !fst1->Write(out1_name);\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/bin/fstminimize.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/flags.h>\n#include <fst/shortest-distance.h>\n#include <fst/weight.h>\n\nDEFINE_double(delta, fst::kShortestDelta, \"Comparison/quantization delta\");\nDEFINE_bool(allow_nondet, false, \"Minimize non-deterministic FSTs\");\n\nint fstminimize_main(int argc, char **argv);\n\nint main(int argc, char **argv) { return fstminimize_main(argc, argv); }\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/bin/fstprint-main.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Prints out binary FSTs in simple text format used by AT&T.\n\n#include <cstring>\n\n#include <fstream>\n#include <memory>\n#include <ostream>\n#include <string>\n\n#include <fst/flags.h>\n#include <fst/log.h>\n#include <fst/script/print.h>\n\nDECLARE_bool(acceptor);\nDECLARE_string(isymbols);\nDECLARE_string(osymbols);\nDECLARE_string(ssymbols);\nDECLARE_bool(numeric);\nDECLARE_string(save_isymbols);\nDECLARE_string(save_osymbols);\nDECLARE_bool(show_weight_one);\nDECLARE_bool(allow_negative_labels);\nDECLARE_string(missing_symbol);\n\nint fstprint_main(int argc, char **argv) {\n  namespace s = fst::script;\n  using fst::script::FstClass;\n  using fst::SymbolTable;\n  using fst::SymbolTableTextOptions;\n\n  string usage = \"Prints out binary FSTs in simple text format.\\n\\n  Usage: \";\n  usage += argv[0];\n  usage += \" [binary.fst [text.fst]]\\n\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n  if (argc > 3) {\n    ShowUsage();\n    return 1;\n  }\n\n  const string in_name = (argc > 1 && strcmp(argv[1], \"-\") != 0) ? argv[1] : \"\";\n  const string out_name = argc > 2 ? argv[2] : \"\";\n\n  std::unique_ptr<FstClass> fst(FstClass::Read(in_name));\n  if (!fst) return 1;\n\n  string dest = \"standard output\";\n  std::ofstream fstrm;\n  if (argc == 3) {\n    fstrm.open(argv[2]);\n    if (!fstrm) {\n      LOG(ERROR) << argv[0] << \": Open failed, file = \" << argv[2];\n      return 1;\n    }\n    dest = argv[2];\n  }\n  std::ostream &ostrm = fstrm.is_open() ? fstrm : std::cout;\n  ostrm.precision(9);\n\n  const SymbolTableTextOptions opts(FLAGS_allow_negative_labels);\n\n  std::unique_ptr<const SymbolTable> isyms;\n  if (!FLAGS_isymbols.empty() && !FLAGS_numeric) {\n    isyms.reset(SymbolTable::ReadText(FLAGS_isymbols, opts));\n    if (!isyms) return 1;\n  }\n\n  std::unique_ptr<const SymbolTable> osyms;\n  if (!FLAGS_osymbols.empty() && !FLAGS_numeric) {\n    osyms.reset(SymbolTable::ReadText(FLAGS_osymbols, opts));\n    if (!osyms) return 1;\n  }\n\n  std::unique_ptr<const SymbolTable> ssyms;\n  if (!FLAGS_ssymbols.empty() && !FLAGS_numeric) {\n    ssyms.reset(SymbolTable::ReadText(FLAGS_ssymbols));\n    if (!ssyms) return 1;\n  }\n\n  if (!isyms && !FLAGS_numeric && fst->InputSymbols()) {\n    isyms.reset(fst->InputSymbols()->Copy());\n  }\n\n  if (!osyms && !FLAGS_numeric && fst->OutputSymbols()) {\n    osyms.reset(fst->OutputSymbols()->Copy());\n  }\n\n  s::PrintFst(*fst, ostrm, dest, isyms.get(), osyms.get(), ssyms.get(),\n              FLAGS_acceptor, FLAGS_show_weight_one, FLAGS_missing_symbol);\n\n  if (isyms && !FLAGS_save_isymbols.empty()) {\n    if (!isyms->WriteText(FLAGS_save_isymbols)) return 1;\n  }\n\n  if (osyms && !FLAGS_save_osymbols.empty()) {\n    if (!osyms->WriteText(FLAGS_save_osymbols)) return 1;\n  }\n\n  return 0;\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/bin/fstprint.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/flags.h>\n\nDEFINE_bool(acceptor, false, \"Input in acceptor format?\");\nDEFINE_string(isymbols, \"\", \"Input label symbol table\");\nDEFINE_string(osymbols, \"\", \"Output label symbol table\");\nDEFINE_string(ssymbols, \"\", \"State label symbol table\");\nDEFINE_bool(numeric, false, \"Print numeric labels?\");\nDEFINE_string(save_isymbols, \"\", \"Save input symbol table to file\");\nDEFINE_string(save_osymbols, \"\", \"Save output symbol table to file\");\nDEFINE_bool(show_weight_one, false,\n            \"Print/draw arc weights and final weights equal to semiring One?\");\nDEFINE_bool(allow_negative_labels, false,\n            \"Allow negative labels (not recommended; may cause conflicts)?\");\nDEFINE_string(missing_symbol, \"\",\n              \"Symbol to print when lookup fails (default raises error)\");\n\nint fstprint_main(int argc, char **argv);\n\nint main(int argc, char **argv) { return fstprint_main(argc, argv); }\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/bin/fstproject-main.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Projects a transduction onto its input or output language.\n\n#include <cstring>\n\n#include <memory>\n#include <string>\n\n#include <fst/flags.h>\n#include <fst/script/getters.h>\n#include <fst/script/project.h>\n\nDECLARE_bool(project_output);\n\nint fstproject_main(int argc, char **argv) {\n  namespace s = fst::script;\n  using fst::script::MutableFstClass;\n\n  string usage =\n      \"Projects a transduction onto its input\"\n      \" or output language.\\n\\n  Usage: \";\n  usage += argv[0];\n  usage += \" [in.fst [out.fst]]\\n\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n  if (argc > 3) {\n    ShowUsage();\n    return 1;\n  }\n\n  const string in_name = (argc > 1 && strcmp(argv[1], \"-\") != 0) ? argv[1] : \"\";\n  const string out_name = argc > 2 ? argv[2] : \"\";\n\n  std::unique_ptr<MutableFstClass> fst(MutableFstClass::Read(in_name, true));\n  if (!fst) return 1;\n\n  s::Project(fst.get(), s::GetProjectType(FLAGS_project_output));\n\n  return !fst->Write(out_name);\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/bin/fstproject.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/flags.h>\n\nDEFINE_bool(project_output, false, \"Project on output (vs. input)\");\n\nint fstproject_main(int argc, char **argv);\n\nint main(int argc, char **argv) { return fstproject_main(argc, argv); }\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/bin/fstprune-main.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Prunes states and arcs of an FST w.r.t. the shortest path weight.\n\n#include <cstring>\n\n#include <memory>\n#include <string>\n\n#include <fst/flags.h>\n#include <fst/script/prune.h>\n\nDECLARE_double(delta);\nDECLARE_int64(nstate);\nDECLARE_string(weight);\n\nint fstprune_main(int argc, char **argv) {\n  namespace s = fst::script;\n  using fst::script::MutableFstClass;\n  using fst::script::WeightClass;\n\n  string usage = \"Prunes states and arcs of an FST.\\n\\n  Usage: \";\n  usage += argv[0];\n  usage += \" [in.fst [out.fst]]\\n\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n  if (argc > 3) {\n    ShowUsage();\n    return 1;\n  }\n\n  const string in_name = (argc > 1 && strcmp(argv[1], \"-\") != 0) ? argv[1] : \"\";\n  const string out_name = argc > 2 ? argv[2] : \"\";\n\n  std::unique_ptr<MutableFstClass> fst(MutableFstClass::Read(in_name, true));\n  if (!fst) return 1;\n\n  const auto weight_threshold =\n      FLAGS_weight.empty() ? WeightClass::Zero(fst->WeightType())\n                           : WeightClass(fst->WeightType(), FLAGS_weight);\n\n  s::Prune(fst.get(), weight_threshold, FLAGS_nstate, FLAGS_delta);\n\n  return !fst->Write(out_name);\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/bin/fstprune.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/flags.h>\n#include <fst/fst.h>\n#include <fst/weight.h>\n\nDEFINE_double(delta, fst::kDelta, \"Comparison/quantization delta\");\nDEFINE_int64(nstate, fst::kNoStateId, \"State number threshold\");\nDEFINE_string(weight, \"\", \"Weight threshold\");\n\nint fstprune_main(int argc, char **argv);\n\nint main(int argc, char **argv) { return fstprune_main(argc, argv); }\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/bin/fstpush-main.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Pushes weights and/or output labels in an FST toward the initial or final\n// states.\n\n#include <cstring>\n\n#include <memory>\n#include <string>\n\n#include <fst/flags.h>\n#include <fst/script/getters.h>\n#include <fst/script/push.h>\n\nDECLARE_double(delta);\nDECLARE_bool(push_weights);\nDECLARE_bool(push_labels);\nDECLARE_bool(remove_total_weight);\nDECLARE_bool(remove_common_affix);\nDECLARE_bool(to_final);\n\nint fstpush_main(int argc, char **argv) {\n  namespace s = fst::script;\n  using fst::script::FstClass;\n  using fst::script::VectorFstClass;\n\n  string usage = \"Pushes weights and/or olabels in an FST.\\n\\n  Usage: \";\n  usage += argv[0];\n  usage += \" [in.fst [out.fst]]\\n\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n  if (argc > 3) {\n    ShowUsage();\n    return 1;\n  }\n\n  string in_name = (argc > 1 && strcmp(argv[1], \"-\") != 0) ? argv[1] : \"\";\n  string out_name = argc > 2 ? argv[2] : \"\";\n\n  std::unique_ptr<FstClass> ifst(FstClass::Read(in_name));\n  if (!ifst) return 1;\n\n  const auto flags =\n      s::GetPushFlags(FLAGS_push_weights, FLAGS_push_labels,\n                      FLAGS_remove_total_weight, FLAGS_remove_common_affix);\n\n  VectorFstClass ofst(ifst->ArcType());\n\n  s::Push(*ifst, &ofst, flags, s::GetReweightType(FLAGS_to_final),\n          FLAGS_delta);\n\n  return !ofst.Write(out_name);\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/bin/fstpush.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/flags.h>\n#include <fst/weight.h>\n\nDEFINE_double(delta, fst::kDelta, \"Comparison/quantization delta\");\nDEFINE_bool(push_weights, false, \"Push weights\");\nDEFINE_bool(push_labels, false, \"Push output labels\");\nDEFINE_bool(remove_total_weight, false,\n            \"Remove total weight when pushing weights\");\nDEFINE_bool(remove_common_affix, false,\n            \"Remove common prefix/suffix when pushing labels\");\nDEFINE_bool(to_final, false, \"Push/reweight to final (vs. to initial) states\");\n\nint fstpush_main(int argc, char **argv);\n\nint main(int argc, char **argv) { return fstpush_main(argc, argv); }\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/bin/fstrandgen-main.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Generates random paths through an FST.\n\n#include <cstring>\n\n#include <memory>\n#include <string>\n\n#include <fst/flags.h>\n#include <fst/log.h>\n#include <fst/script/getters.h>\n#include <fst/script/randgen.h>\n\nDECLARE_int32(max_length);\nDECLARE_int32(npath);\nDECLARE_int32(seed);\nDECLARE_string(select);\nDECLARE_bool(weighted);\nDECLARE_bool(remove_total_weight);\n\nint fstrandgen_main(int argc, char **argv) {\n  namespace s = fst::script;\n  using fst::script::FstClass;\n  using fst::script::VectorFstClass;\n\n  string usage = \"Generates random paths through an FST.\\n\\n  Usage: \";\n  usage += argv[0];\n  usage += \" [in.fst [out.fst]]\\n\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n  if (argc > 3) {\n    ShowUsage();\n    return 1;\n  }\n\n  VLOG(1) << argv[0] << \": Seed = \" << FLAGS_seed;\n\n  const string in_name = (argc > 1 && strcmp(argv[1], \"-\") != 0) ? argv[1] : \"\";\n  const string out_name = argc > 2 ? argv[2] : \"\";\n\n  std::unique_ptr<FstClass> ifst(FstClass::Read(in_name));\n  if (!ifst) return 1;\n\n  VectorFstClass ofst(ifst->ArcType());\n\n  s::RandArcSelection ras;\n  if (!s::GetRandArcSelection(FLAGS_select, &ras)) {\n    LOG(ERROR) << argv[0] << \": Unknown or unsupported select type \"\n               << FLAGS_select;\n    return 1;\n  }\n\n  s::RandGen(*ifst, &ofst, FLAGS_seed,\n             fst::RandGenOptions<s::RandArcSelection>(\n                 ras, FLAGS_max_length, FLAGS_npath, FLAGS_weighted,\n                 FLAGS_remove_total_weight));\n\n  return !ofst.Write(out_name);\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/bin/fstrandgen.cc",
    "content": "#ifndef _MSC_VER\n#include <unistd.h>\n#else\n#include <process.h>\n#define getpid _getpid\n#endif\n\n#include <climits>\n#include <ctime>\n\n#include <fst/flags.h>\n\nDEFINE_int32(max_length, INT32_MAX, \"Maximum path length\");\nDEFINE_int32(npath, 1, \"Number of paths to generate\");\nDEFINE_int32(seed, time(nullptr) + getpid(), \"Random seed\");\nDEFINE_string(select, \"uniform\",\n              \"Selection type: one of: \"\n              \" \\\"uniform\\\", \\\"log_prob\\\" (when appropriate),\"\n              \" \\\"fast_log_prob\\\" (when appropriate)\");\nDEFINE_bool(weighted, false,\n            \"Output tree weighted by path count vs. unweighted paths\");\nDEFINE_bool(remove_total_weight, false,\n            \"Remove total weight when output weighted\");\n\nint fstrandgen_main(int argc, char **argv);\n\nint main(int argc, char **argv) { return fstrandgen_main(argc, argv); }\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/bin/fstrelabel-main.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Relabels input or output space of an FST.\n\n#include <cstring>\n\n#include <memory>\n#include <string>\n#include <vector>\n\n#include <fst/flags.h>\n#include <fst/util.h>\n#include <fst/script/relabel.h>\n#include <fst/script/weight-class.h>\n\nDECLARE_string(isymbols);\nDECLARE_string(osymbols);\nDECLARE_string(relabel_isymbols);\nDECLARE_string(relabel_osymbols);\nDECLARE_string(relabel_ipairs);\nDECLARE_string(relabel_opairs);\nDECLARE_string(unknown_isymbol);\nDECLARE_string(unknown_osymbol);\nDECLARE_bool(allow_negative_labels);\n\nint fstrelabel_main(int argc, char **argv) {\n  namespace s = fst::script;\n  using fst::script::MutableFstClass;\n  using fst::SymbolTable;\n  using fst::SymbolTableTextOptions;\n\n  string usage =\n      \"Relabels the input and/or the output labels of the FST.\\n\\n\"\n      \"  Usage: \";\n  usage += argv[0];\n  usage += \" [in.fst [out.fst]]\\n\";\n  usage += \"\\n Using SymbolTables flags:\\n\";\n  usage += \"  --relabel_isymbols isyms.map\\n\";\n  usage += \"  --relabel_osymbols osyms.map\\n\";\n  usage += \"\\n Using numeric labels flags:\\n\";\n  usage += \"  --relabel_ipairs ipairs.txt\\n\";\n  usage += \"  --relabel_opairs opairs.txt\\n\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n  if (argc > 3) {\n    ShowUsage();\n    return 1;\n  }\n\n  const string in_name =\n      (argc > 1 && (strcmp(argv[1], \"-\") != 0)) ? argv[1] : \"\";\n  const string out_name = argc > 2 ? argv[2] : \"\";\n\n  std::unique_ptr<MutableFstClass> fst(MutableFstClass::Read(in_name, true));\n  if (!fst) return 1;\n\n  // Relabel with symbol tables.\n  const SymbolTableTextOptions opts(FLAGS_allow_negative_labels);\n\n  if (!FLAGS_relabel_isymbols.empty() || !FLAGS_relabel_osymbols.empty()) {\n    bool attach_new_isymbols = (fst->InputSymbols() != nullptr);\n    std::unique_ptr<const SymbolTable> old_isymbols(\n        FLAGS_isymbols.empty() ? nullptr\n                               : SymbolTable::ReadText(FLAGS_isymbols, opts));\n    const std::unique_ptr<const SymbolTable> relabel_isymbols(\n        FLAGS_relabel_isymbols.empty()\n            ? nullptr\n            : SymbolTable::ReadText(FLAGS_relabel_isymbols, opts));\n    bool attach_new_osymbols = (fst->OutputSymbols() != nullptr);\n    std::unique_ptr<const SymbolTable> old_osymbols(\n        FLAGS_osymbols.empty() ? nullptr\n                               : SymbolTable::ReadText(FLAGS_osymbols, opts));\n    const std::unique_ptr<const SymbolTable> relabel_osymbols(\n        FLAGS_relabel_osymbols.empty()\n            ? nullptr\n            : SymbolTable::ReadText(FLAGS_relabel_osymbols, opts));\n    s::Relabel(fst.get(),\n               old_isymbols ? old_isymbols.get() : fst->InputSymbols(),\n               relabel_isymbols.get(), FLAGS_unknown_isymbol,\n               attach_new_isymbols,\n               old_osymbols ? old_osymbols.get() : fst->OutputSymbols(),\n               relabel_osymbols.get(), FLAGS_unknown_osymbol,\n               attach_new_osymbols);\n  } else {\n    // Reads in relabeling pairs.\n    std::vector<s::LabelPair> ipairs;\n    std::vector<s::LabelPair> opairs;\n    if (!FLAGS_relabel_ipairs.empty()) {\n      if (!fst::ReadLabelPairs(FLAGS_relabel_ipairs, &ipairs,\n                                   FLAGS_allow_negative_labels))\n        return 1;\n    }\n    if (!FLAGS_relabel_opairs.empty()) {\n      if (!fst::ReadLabelPairs(FLAGS_relabel_opairs, &opairs,\n                                   FLAGS_allow_negative_labels))\n        return 1;\n    }\n    s::Relabel(fst.get(), ipairs, opairs);\n  }\n\n  return !fst->Write(out_name);\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/bin/fstrelabel.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/flags.h>\n\nDEFINE_string(isymbols, \"\", \"Input label symbol table\");\nDEFINE_string(osymbols, \"\", \"Output label symbol table\");\nDEFINE_string(relabel_isymbols, \"\", \"Input symbol set to relabel to\");\nDEFINE_string(relabel_osymbols, \"\", \"Output symbol set to relabel to\");\nDEFINE_string(relabel_ipairs, \"\", \"Input relabel pairs (numeric)\");\nDEFINE_string(relabel_opairs, \"\", \"Output relabel pairs (numeric)\");\nDEFINE_string(unknown_isymbol, \"\",\n    \"Input symbol to use to relabel OOVs (default: OOVs are errors)\");\nDEFINE_string(unknown_osymbol, \"\",\n    \"Output symbol to use to relabel OOVs (default: OOVs are errors)\");\nDEFINE_bool(allow_negative_labels, false,\n    \"Allow negative labels (not recommended; may cause conflicts)\");\n\nint fstrelabel_main(int argc, char **argv);\n\nint main(int argc, char **argv) { return fstrelabel_main(argc, argv); }\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/bin/fstreplace-main.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Performs the dynamic replacement of arcs in one FST with another FST,\n// allowing for the definition of FSTs analogous to RTNs.\n\n#include <cstring>\n\n#include <string>\n#include <vector>\n\n#include <fst/flags.h>\n#include <fst/script/getters.h>\n#include <fst/script/replace.h>\n\nDECLARE_string(call_arc_labeling);\nDECLARE_string(return_arc_labeling);\nDECLARE_int64(return_label);\nDECLARE_bool(epsilon_on_replace);\n\nvoid Cleanup(std::vector<fst::script::LabelFstClassPair> *pairs) {\n  for (const auto &pair : *pairs) {\n    delete pair.second;\n  }\n  pairs->clear();\n}\n\nint fstreplace_main(int argc, char **argv) {\n  namespace s = fst::script;\n  using fst::script::FstClass;\n  using fst::script::VectorFstClass;\n  using fst::ReplaceLabelType;\n\n  string usage = \"Recursively replaces FST arcs with other FST(s).\\n\\n\"\n                 \"  Usage: \";\n  usage += argv[0];\n  usage += \" root.fst rootlabel [rule1.fst label1 ...] [out.fst]\\n\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n  if (argc < 4) {\n    ShowUsage();\n    return 1;\n  }\n\n  const string in_name = argv[1];\n  const string out_name = argc % 2 == 0 ? argv[argc - 1] : \"\";\n\n  auto *ifst = FstClass::Read(in_name);\n  if (!ifst) return 1;\n\n  std::vector<s::LabelFstClassPair> pairs;\n  // Note that if the root label is beyond the range of the underlying FST's\n  // labels, truncation will occur.\n  const auto root = atoll(argv[2]);\n  pairs.emplace_back(root, ifst);\n\n  for (auto i = 3; i < argc - 1; i += 2) {\n    ifst = FstClass::Read(argv[i]);\n    if (!ifst) {\n      Cleanup(&pairs);\n      return 1;\n    }\n    // Note that if the root label is beyond the range of the underlying FST's\n    // labels, truncation will occur.\n    const auto label = atoll(argv[i + 1]);\n    pairs.emplace_back(label, ifst);\n  }\n\n  ReplaceLabelType call_label_type;\n  if (!s::GetReplaceLabelType(FLAGS_call_arc_labeling, FLAGS_epsilon_on_replace,\n                              &call_label_type)) {\n    LOG(ERROR) << argv[0] << \": Unknown or unsupported call arc replace \"\n               << \"label type: \" << FLAGS_call_arc_labeling;\n  }\n  ReplaceLabelType return_label_type;\n  if (!s::GetReplaceLabelType(FLAGS_return_arc_labeling,\n                              FLAGS_epsilon_on_replace, &return_label_type)) {\n    LOG(ERROR) << argv[0] << \": Unknown or unsupported return arc replace \"\n               << \"label type: \" << FLAGS_return_arc_labeling;\n  }\n\n  s::ReplaceOptions opts(root, call_label_type, return_label_type,\n                         FLAGS_return_label);\n\n  VectorFstClass ofst(ifst->ArcType());\n  s::Replace(pairs, &ofst, opts);\n  Cleanup(&pairs);\n\n  return !ofst.Write(out_name);\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/bin/fstreplace.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/flags.h>\n\nDEFINE_string(call_arc_labeling, \"input\",\n              \"Which labels to make non-epsilon on the call arc. \"\n              \"One of: \\\"input\\\" (default), \\\"output\\\", \\\"both\\\", \\\"neither\\\"\");\nDEFINE_string(return_arc_labeling, \"neither\",\n              \"Which labels to make non-epsilon on the return arc. \"\n              \"One of: \\\"input\\\", \\\"output\\\", \\\"both\\\", \\\"neither\\\" (default)\");\nDEFINE_int64(return_label, 0, \"Label to put on return arc\");\nDEFINE_bool(epsilon_on_replace, false, \"Call/return arcs are epsilon arcs?\");\n\nint fstreplace_main(int argc, char **argv);\n\nint main(int argc, char **argv) { return fstreplace_main(argc, argv); }\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/bin/fstreverse-main.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Reverses the paths in an FST.\n\n#include <cstring>\n\n#include <memory>\n#include <string>\n\n#include <fst/flags.h>\n#include <fst/script/fst-class.h>\n#include <fst/script/reverse.h>\n\nDECLARE_bool(require_superinitial);\n\nint fstreverse_main(int argc, char **argv) {\n  namespace s = fst::script;\n  using fst::script::FstClass;\n  using fst::script::VectorFstClass;\n\n  string usage = \"Reverses the paths in an FST.\\n\\n  Usage: \";\n  usage += argv[0];\n  usage += \" [in.fst [out.fst]]\\n\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n  if (argc > 3) {\n    ShowUsage();\n    return 1;\n  }\n\n  const string in_name =\n      (argc > 1 && (strcmp(argv[1], \"-\") != 0)) ? argv[1] : \"\";\n  const string out_name = argc > 2 ? argv[2] : \"\";\n\n  std::unique_ptr<FstClass> ifst(FstClass::Read(in_name));\n  if (!ifst) return 1;\n\n  VectorFstClass ofst(ifst->ArcType());\n\n  s::Reverse(*ifst, &ofst, FLAGS_require_superinitial);\n\n  return !ofst.Write(out_name);\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/bin/fstreverse.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/flags.h>\n\nDEFINE_bool(require_superinitial, true, \"Always create a superinitial state\");\n\nint fstreverse_main(int argc, char **argv);\n\nint main(int argc, char **argv) { return fstreverse_main(argc, argv); }\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/bin/fstreweight-main.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Reweights an FST.\n\n#include <cstring>\n\n#include <memory>\n#include <string>\n#include <vector>\n\n#include <fst/flags.h>\n#include <fst/script/getters.h>\n#include <fst/script/reweight.h>\n#include <fst/script/text-io.h>\n\nDECLARE_bool(to_final);\n\nint fstreweight_main(int argc, char **argv) {\n  namespace s = fst::script;\n  using fst::script::MutableFstClass;\n  using fst::script::WeightClass;\n\n  string usage = \"Reweights an FST.\\n\\n  Usage: \";\n  usage += argv[0];\n  usage += \" in.fst potential.txt [out.fst]\\n\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n  if (argc < 3 || argc > 4) {\n    ShowUsage();\n    return 1;\n  }\n\n  const string in_name = argv[1];\n  const string potentials_name = argv[2];\n  const string out_name = argc > 3 ? argv[3] : \"\";\n\n  std::unique_ptr<MutableFstClass> fst(MutableFstClass::Read(in_name, true));\n  if (!fst) return 1;\n\n  std::vector<WeightClass> potential;\n  if (!s::ReadPotentials(fst->WeightType(), potentials_name, &potential)) {\n    return 1;\n  }\n\n  s::Reweight(fst.get(), potential, s::GetReweightType(FLAGS_to_final));\n\n  return !fst->Write(out_name);\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/bin/fstreweight.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/flags.h>\n\nDEFINE_bool(to_final, false, \"Push/reweight to final (vs. to initial) states\");\n\nint fstreweight_main(int argc, char **argv);\n\nint main(int argc, char **argv) { return fstreweight_main(argc, argv); }\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/bin/fstrmepsilon-main.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Removes epsilons from an FST.\n\n#include <cstring>\n\n#include <memory>\n#include <string>\n\n#include <fst/flags.h>\n#include <fst/log.h>\n#include <fst/script/getters.h>\n#include <fst/script/rmepsilon.h>\n\nDECLARE_bool(connect);\nDECLARE_double(delta);\nDECLARE_int64(nstate);\nDECLARE_string(queue_type);\nDECLARE_string(weight);\n\nint fstrmepsilon_main(int argc, char **argv) {\n  namespace s = fst::script;\n  using fst::script::MutableFstClass;\n  using fst::script::WeightClass;\n\n  string usage = \"Removes epsilons from an FST.\\n\\n  Usage: \";\n  usage += argv[0];\n  usage += \" [in.fst [out.fst]]\\n\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n  if (argc > 3) {\n    ShowUsage();\n    return 1;\n  }\n\n  const string in_name = (argc > 1 && strcmp(argv[1], \"-\") != 0) ? argv[1] : \"\";\n  const string out_name = argc > 2 ? argv[2] : \"\";\n\n  std::unique_ptr<MutableFstClass> fst(MutableFstClass::Read(in_name, true));\n  if (!fst) return 1;\n\n  const auto weight_threshold =\n      FLAGS_weight.empty() ? WeightClass::Zero(fst->WeightType())\n                           : WeightClass(fst->WeightType(), FLAGS_weight);\n\n  fst::QueueType queue_type;\n  if (!s::GetQueueType(FLAGS_queue_type, &queue_type)) {\n    LOG(ERROR) << argv[0]\n               << \": Unknown or unsupported queue type: \" << FLAGS_queue_type;\n    return 1;\n  }\n\n  const s::RmEpsilonOptions opts(queue_type, FLAGS_connect, weight_threshold,\n                                 FLAGS_nstate, FLAGS_delta);\n\n  s::RmEpsilon(fst.get(), opts);\n\n  return !fst->Write(out_name);\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/bin/fstrmepsilon.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/flags.h>\n#include <fst/fst.h>\n#include <fst/shortest-distance.h>\n#include <fst/weight.h>\n\nDEFINE_bool(connect, true, \"Trim output\");\nDEFINE_double(delta, fst::kShortestDelta, \"Comparison/quantization delta\");\nDEFINE_int64(nstate, fst::kNoStateId, \"State number threshold\");\nDEFINE_string(queue_type, \"auto\",\n              \"Queue type: one of: \\\"auto\\\", \"\n              \"\\\"fifo\\\", \\\"lifo\\\", \\\"shortest\\\", \\\"state\\\", \\\"top\\\"\");\nDEFINE_string(weight, \"\", \"Weight threshold\");\n\nint fstrmepsilon_main(int argc, char **argv);\n\nint main(int argc, char **argv) { return fstrmepsilon_main(argc, argv); }\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/bin/fstshortestdistance-main.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Find shortest distances in an FST.\n\n#include <cstring>\n\n#include <memory>\n#include <string>\n#include <vector>\n\n#include <fst/flags.h>\n#include <fst/log.h>\n#include <fst/script/getters.h>\n#include <fst/script/shortest-distance.h>\n#include <fst/script/text-io.h>\n\nDECLARE_bool(reverse);\nDECLARE_double(delta);\nDECLARE_int64(nstate);\nDECLARE_string(queue_type);\n\nint fstshortestdistance_main(int argc, char **argv) {\n  namespace s = fst::script;\n  using fst::script::FstClass;\n  using fst::script::WeightClass;\n  using fst::QueueType;\n  using fst::AUTO_QUEUE;\n\n  string usage = \"Finds shortest distance(s) in an FST.\\n\\n  Usage: \";\n  usage += argv[0];\n  usage += \" [in.fst [distance.txt]]\\n\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n  if (argc > 3) {\n    ShowUsage();\n    return 1;\n  }\n\n  string in_name = (argc > 1 && (strcmp(argv[1], \"-\") != 0)) ? argv[1] : \"\";\n  string out_name = argc > 2 ? argv[2] : \"\";\n\n  std::unique_ptr<FstClass> ifst(FstClass::Read(in_name));\n  if (!ifst) return 1;\n\n  std::vector<WeightClass> distance;\n\n  QueueType queue_type;\n  if (!s::GetQueueType(FLAGS_queue_type, &queue_type)) {\n    LOG(ERROR) << argv[0]\n               << \": Unknown or unsupported queue type: \" << FLAGS_queue_type;\n    return 1;\n  }\n\n  if (FLAGS_reverse && queue_type != AUTO_QUEUE) {\n    LOG(ERROR) << argv[0] << \": Can't use non-default queue with reverse\";\n    return 1;\n  }\n\n  if (FLAGS_reverse) {\n    s::ShortestDistance(*ifst, &distance, FLAGS_reverse, FLAGS_delta);\n  } else {\n    const s::ShortestDistanceOptions opts(queue_type, s::ANY_ARC_FILTER,\n                                          FLAGS_nstate, FLAGS_delta);\n    s::ShortestDistance(*ifst, &distance, opts);\n  }\n\n  return !s::WritePotentials(out_name, distance);\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/bin/fstshortestdistance.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/flags.h>\n#include <fst/fst.h>\n#include <fst/shortest-distance.h>\n#include <fst/weight.h>\n\nDEFINE_bool(reverse, false, \"Perform in the reverse direction\");\nDEFINE_double(delta, fst::kShortestDelta, \"Comparison/quantization delta\");\nDEFINE_int64(nstate, fst::kNoStateId, \"State number threshold\");\nDEFINE_string(queue_type, \"auto\",\n              \"Queue type: one of: \\\"auto\\\", \"\n              \"\\\"fifo\\\", \\\"lifo\\\", \\\"shortest\\\", \\\"state\\\", \\\"top\\\"\");\n\nint fstshortestdistance_main(int argc, char **argv);\n\nint main(int argc, char **argv) { return fstshortestdistance_main(argc, argv); }\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/bin/fstshortestpath-main.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Find shortest path(s) in an FST.\n\n#include <cstring>\n\n#include <memory>\n#include <string>\n#include <vector>\n\n#include <fst/flags.h>\n#include <fst/log.h>\n#include <fst/script/getters.h>\n#include <fst/script/shortest-path.h>\n\nDECLARE_double(delta);\nDECLARE_int32(nshortest);\nDECLARE_int64(nstate);\nDECLARE_string(queue_type);\nDECLARE_bool(unique);\nDECLARE_string(weight);\n\nint fstshortestpath_main(int argc, char **argv) {\n  namespace s = fst::script;\n  using fst::script::FstClass;\n  using fst::script::WeightClass;\n  using fst::script::VectorFstClass;\n\n  string usage = \"Finds shortest path(s) in an FST.\\n\\n  Usage: \";\n  usage += argv[0];\n  usage += \" [in.fst [out.fst]]\\n\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n  if (argc > 3) {\n    ShowUsage();\n    return 1;\n  }\n\n  const string in_name =\n      (argc > 1 && (strcmp(argv[1], \"-\") != 0)) ? argv[1] : \"\";\n  const string out_name = argc > 2 ? argv[2] : \"\";\n\n  std::unique_ptr<FstClass> ifst(FstClass::Read(in_name));\n  if (!ifst) return 1;\n\n  const auto weight_threshold =\n      FLAGS_weight.empty() ? WeightClass::Zero(ifst->WeightType())\n                           : WeightClass(ifst->WeightType(), FLAGS_weight);\n\n  VectorFstClass ofst(ifst->ArcType());\n\n  fst::QueueType queue_type;\n  if (!s::GetQueueType(FLAGS_queue_type, &queue_type)) {\n    LOG(ERROR) << \"Unknown or unsupported queue type: \" << FLAGS_queue_type;\n    return 1;\n  }\n\n  const s::ShortestPathOptions opts(queue_type, FLAGS_nshortest,\n                                    FLAGS_unique, FLAGS_delta,\n                                    weight_threshold, FLAGS_nstate);\n\n  s::ShortestPath(*ifst, &ofst, opts);\n\n  return !ofst.Write(out_name);\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/bin/fstshortestpath.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/flags.h>\n#include <fst/fst.h>\n#include <fst/shortest-distance.h>\n#include <fst/weight.h>\n\nDEFINE_double(delta, fst::kShortestDelta, \"Comparison/quantization delta\");\nDEFINE_int32(nshortest, 1, \"Return N-shortest paths\");\nDEFINE_int64(nstate, fst::kNoStateId, \"State number threshold\");\nDEFINE_string(queue_type, \"auto\",\n              \"Queue type: one of \\\"auto\\\", \"\n              \"\\\"fifo\\\", \\\"lifo\\\", \\\"shortest\\', \\\"state\\\", \\\"top\\\"\");\nDEFINE_bool(unique, false, \"Return unique strings\");\nDEFINE_string(weight, \"\", \"Weight threshold\");\n\nint fstshortestpath_main(int argc, char **argv);\n\nint main(int argc, char **argv) { return fstshortestpath_main(argc, argv); }\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/bin/fstsymbols-main.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Performs operations (set, clear, relabel) on the symbols table attached to an\n// input FST.\n\n#include <cstring>\n\n#include <memory>\n#include <string>\n#include <vector>\n\n#include <fst/flags.h>\n#include <fst/util.h>\n#include <fst/script/fst-class.h>\n#include <fst/script/verify.h>\n\nDECLARE_string(isymbols);\nDECLARE_string(osymbols);\nDECLARE_bool(clear_isymbols);\nDECLARE_bool(clear_osymbols);\nDECLARE_string(relabel_ipairs);\nDECLARE_string(relabel_opairs);\nDECLARE_string(save_isymbols);\nDECLARE_string(save_osymbols);\nDECLARE_bool(allow_negative_labels);\nDECLARE_bool(verify);\n\nint fstsymbols_main(int argc, char **argv) {\n  namespace s = fst::script;\n  using fst::script::MutableFstClass;\n  using fst::ReadLabelPairs;\n  using fst::SymbolTable;\n  using fst::SymbolTableTextOptions;\n\n  string usage =\n      \"Performs operations (set, clear, relabel) on the symbol\"\n      \" tables attached to an FST.\\n\\n  Usage: \";\n  usage += argv[0];\n  usage += \" [in.fst [out.fst]]\\n\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n  if (argc > 3) {\n    ShowUsage();\n    return 1;\n  }\n\n  const string in_name = argc > 1 && strcmp(argv[1], \"-\") != 0 ? argv[1] : \"\";\n  const string out_name = argc > 2 ? argv[2] : \"\";\n\n  std::unique_ptr<MutableFstClass> fst(MutableFstClass::Read(in_name, true));\n  if (!fst) return 1;\n\n  if (!FLAGS_save_isymbols.empty()) {\n    const auto *isyms = fst->InputSymbols();\n    if (isyms) {\n      isyms->WriteText(FLAGS_save_isymbols);\n    } else {\n      LOG(ERROR) << argv[0]\n                 << \": Saving isymbols but there are no input symbols.\";\n    }\n  }\n\n  if (!FLAGS_save_osymbols.empty()) {\n    const auto *osyms = fst->OutputSymbols();\n    if (osyms) {\n      osyms->WriteText(FLAGS_save_osymbols);\n    } else {\n      LOG(ERROR) << argv[0]\n                 << \": Saving osymbols but there are no output symbols.\";\n    }\n  }\n\n  const SymbolTableTextOptions opts(FLAGS_allow_negative_labels);\n\n  std::unique_ptr<SymbolTable> isyms;\n  if (!FLAGS_isymbols.empty()) {\n    isyms.reset(SymbolTable::ReadText(FLAGS_isymbols, opts));\n    fst->SetInputSymbols(isyms.get());\n  } else if (FLAGS_clear_isymbols) {\n    fst->SetInputSymbols(nullptr);\n  }\n  std::unique_ptr<SymbolTable> osyms;\n  if (!FLAGS_osymbols.empty()) {\n    osyms.reset(SymbolTable::ReadText(FLAGS_osymbols, opts));\n    fst->SetOutputSymbols(osyms.get());\n  } else if (FLAGS_clear_osymbols) {\n    fst->SetOutputSymbols(nullptr);\n  }\n\n  using Label = int64;\n  if (!FLAGS_relabel_ipairs.empty()) {\n    std::vector<std::pair<Label, Label>> ipairs;\n    ReadLabelPairs(FLAGS_relabel_ipairs, &ipairs, FLAGS_allow_negative_labels);\n    std::unique_ptr<SymbolTable> isyms_relabel(\n        RelabelSymbolTable(fst->InputSymbols(), ipairs));\n    fst->SetInputSymbols(isyms_relabel.get());\n  }\n  if (!FLAGS_relabel_opairs.empty()) {\n    std::vector<std::pair<Label, Label>> opairs;\n    ReadLabelPairs(FLAGS_relabel_opairs, &opairs, FLAGS_allow_negative_labels);\n    std::unique_ptr<SymbolTable> osyms_relabel(\n        RelabelSymbolTable(fst->OutputSymbols(), opairs));\n    fst->SetOutputSymbols(osyms_relabel.get());\n  }\n\n  if (FLAGS_verify && !s::Verify(*fst)) return 1;\n\n  return !fst->Write(out_name);\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/bin/fstsymbols.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/flags.h>\n\nDEFINE_string(isymbols, \"\", \"Input label symbol table\");\nDEFINE_string(osymbols, \"\", \"Output label symbol table\");\nDEFINE_bool(clear_isymbols, false, \"Clear input symbol table\");\nDEFINE_bool(clear_osymbols, false, \"Clear output symbol table\");\nDEFINE_string(relabel_ipairs, \"\", \"Input relabel pairs (numeric)\");\nDEFINE_string(relabel_opairs, \"\", \"Output relabel pairs (numeric)\");\nDEFINE_string(save_isymbols, \"\", \"Save fst file's input symbol table to file\");\nDEFINE_string(save_osymbols, \"\", \"Save fst file's output symbol table to file\");\nDEFINE_bool(allow_negative_labels, false,\n            \"Allow negative labels (not recommended; may cause conflicts)\");\nDEFINE_bool(verify, false, \"Verify fst properities before saving\");\n\nint fstsymbols_main(int argc, char **argv);\n\nint main(int argc, char **argv) { return fstsymbols_main(argc, argv); }\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/bin/fstsynchronize-main.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Synchronizes an FST.\n\n#include <cstring>\n\n#include <memory>\n#include <string>\n\n#include <fst/flags.h>\n#include <fst/script/synchronize.h>\n\nint fstsynchronize_main(int argc, char **argv) {\n  namespace s = fst::script;\n  using fst::script::FstClass;\n  using fst::script::VectorFstClass;\n\n  string usage = \"Synchronizes an FST.\\n\\n  Usage: \";\n  usage += argv[0];\n  usage += \" [in.fst [out.fst]]\\n\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n  if (argc > 3) {\n    ShowUsage();\n    return 1;\n  }\n\n  const string in_name = (argc > 1 && strcmp(argv[1], \"-\") != 0) ? argv[1] : \"\";\n  const string out_name = argc > 2 ? argv[2] : \"\";\n\n  std::unique_ptr<FstClass> ifst(FstClass::Read(in_name));\n  if (!ifst) return 1;\n\n  VectorFstClass ofst(ifst->ArcType());\n\n  s::Synchronize(*ifst, &ofst);\n\n  return !ofst.Write(out_name);\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/bin/fstsynchronize.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\nint fstsynchronize_main(int argc, char **argv);\n\nint main(int argc, char **argv) { return fstsynchronize_main(argc, argv); }\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/bin/fsttopsort-main.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Topologically sorts an FST.\n\n#include <cstring>\n\n#include <memory>\n#include <string>\n\n#include <fst/flags.h>\n#include <fst/log.h>\n#include <fst/script/topsort.h>\n\nint fsttopsort_main(int argc, char **argv) {\n  namespace s = fst::script;\n  using fst::script::MutableFstClass;\n\n  string usage = \"Topologically sorts an FST.\\n\\n  Usage: \";\n  usage += argv[0];\n  usage += \" [in.fst [out.fst]]\\n\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n  if (argc > 3) {\n    ShowUsage();\n    return 1;\n  }\n\n  const string in_name = argc > 1 && strcmp(argv[1], \"-\") != 0 ? argv[1] : \"\";\n  const string out_name = argc > 2 ? argv[2] : \"\";\n\n  std::unique_ptr<MutableFstClass> fst(MutableFstClass::Read(in_name, true));\n  if (!fst) return 1;\n\n  bool acyclic = TopSort(fst.get());\n\n  if (!acyclic) LOG(WARNING) << argv[0] << \": Input FST is cyclic\";\n\n  return !fst->Write(out_name);\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/bin/fsttopsort.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\nint fsttopsort_main(int argc, char **argv);\n\nint main(int argc, char **argv) { return fsttopsort_main(argc, argv); }\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/bin/fstunion-main.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Creates the union of two FSTs.\n\n#include <cstring>\n\n#include <memory>\n#include <string>\n\n#include <fst/flags.h>\n#include <fst/log.h>\n#include <fst/script/union.h>\n\nint fstunion_main(int argc, char **argv) {\n  namespace s = fst::script;\n  using fst::script::FstClass;\n  using fst::script::MutableFstClass;\n\n  string usage = \"Creates the union of two FSTs.\\n\\n  Usage: \";\n  usage += argv[0];\n  usage += \" in1.fst in2.fst [out.fst]\\n\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n  if (argc < 3 || argc > 4) {\n    ShowUsage();\n    return 1;\n  }\n\n  const string in1_name = strcmp(argv[1], \"-\") != 0 ? argv[1] : \"\";\n  const string in2_name = strcmp(argv[2], \"-\") != 0 ? argv[2] : \"\";\n  const string out_name = argc > 3 ? argv[3] : \"\";\n\n  if (in1_name == \"\" && in2_name == \"\") {\n    LOG(ERROR) << argv[0] << \": Can't take both inputs from standard input\";\n    return 1;\n  }\n\n  std::unique_ptr<MutableFstClass> fst1(MutableFstClass::Read(in1_name, true));\n  if (!fst1) return 1;\n\n  std::unique_ptr<FstClass> fst2(FstClass::Read(in2_name));\n  if (!fst2) return 1;\n\n  s::Union(fst1.get(), *fst2);\n\n  return !fst1->Write(out_name);\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/bin/fstunion.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\nint fstunion_main(int argc, char **argv);\n\nint main(int argc, char **argv) { return fstunion_main(argc, argv); }\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/extensions/CMakeLists.txt",
    "content": "\nif(HAVE_COMPACT)\n  add_subdirectory(compact)\nendif(HAVE_COMPACT)\n\nif(HAVE_COMPRESS)\n  add_subdirectory(compress)\nendif(HAVE_COMPRESS)\n\nif(HAVE_CONST)\n  add_subdirectory(const)\nendif(HAVE_CONST)\n\nif(HAVE_FAR OR HAVE_GRM)\n  add_subdirectory(far)\nendif(HAVE_FAR OR HAVE_GRM)\n\nif(HAVE_LINEAR)\n  add_subdirectory(linear)\nendif(HAVE_LINEAR)\n\nif(HAVE_LOOKAHEAD)\n  add_subdirectory(lookahead)\nendif(HAVE_LOOKAHEAD)\n\nif(HAVE_MPDT OR HAVE_GRM)\n  add_subdirectory(mpdt)\nendif(HAVE_MPDT OR HAVE_GRM)\n\nif(HAVE_NGRAM)\n  add_subdirectory(ngram)\nendif(HAVE_NGRAM)\n\n#if(HAVE_PYTHON)\n#  add_subdirectory(far)\n#  add_subdirectory(python)\n#endif(HAVE_PDT)\n#\nif(HAVE_PDT OR HAVE_MPDT OR HAVE_GRM)\n  add_subdirectory(pdt)\nendif(HAVE_PDT OR HAVE_MPDT OR HAVE_GRM)\n\nif(HAVE_SPECIAL)\n  add_subdirectory(special)\nendif(HAVE_SPECIAL)\n\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/extensions/Makefile.am",
    "content": "if HAVE_COMPACT\ncompactdir = compact\nendif\n\nif HAVE_COMPRESS\ncompressdir = compress\nendif\n\nif HAVE_CONST\nconstdir = const\nendif\n\nif HAVE_FAR\nfardir = far\nendif\n\nif HAVE_GRM\nfardir = far\npdtdir = pdt\nmpdtdir = mpdt\nendif\n\nif HAVE_LINEAR\nlineardir = linear\nendif\n\nif HAVE_LOOKAHEAD\nlookaheaddir = lookahead\nendif\n\nif HAVE_MPDT\npdtdir = pdt\nmpdtdir = mpdt\nendif\n\nif HAVE_NGRAM\nngramdir = ngram\nendif\n\nif HAVE_PYTHON\nfardir = far\npywrapfstdir = python\nendif\n\nif HAVE_PDT\npdtdir = pdt\nendif\n\nif HAVE_SPECIAL\nspecialdir = special\nendif\n\nSUBDIRS = $(compactdir) $(compressdir) $(constdir) $(fardir) $(lineardir)  \\\n          $(lookaheaddir) $(pdtdir) $(mpdtdir) $(ngramdir) $(pywrapfstdir) \\\n          $(specialdir)\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/extensions/Makefile.in",
    "content": "# Makefile.in generated by automake 1.15.1 from Makefile.am.\n# @configure_input@\n\n# Copyright (C) 1994-2017 Free Software Foundation, Inc.\n\n# This Makefile.in is free software; the Free Software Foundation\n# gives unlimited permission to copy and/or distribute it,\n# with or without modifications, as long as this notice is preserved.\n\n# This program is distributed in the hope that it will be useful,\n# but WITHOUT ANY WARRANTY, to the extent permitted by law; without\n# even the implied warranty of MERCHANTABILITY or FITNESS FOR A\n# PARTICULAR PURPOSE.\n\n@SET_MAKE@\nVPATH = @srcdir@\nam__is_gnu_make = { \\\n  if test -z '$(MAKELEVEL)'; then \\\n    false; \\\n  elif test -n '$(MAKE_HOST)'; then \\\n    true; \\\n  elif test -n '$(MAKE_VERSION)' && test -n '$(CURDIR)'; then \\\n    true; \\\n  else \\\n    false; \\\n  fi; \\\n}\nam__make_running_with_option = \\\n  case $${target_option-} in \\\n      ?) ;; \\\n      *) echo \"am__make_running_with_option: internal error: invalid\" \\\n              \"target option '$${target_option-}' specified\" >&2; \\\n         exit 1;; \\\n  esac; \\\n  has_opt=no; \\\n  sane_makeflags=$$MAKEFLAGS; \\\n  if $(am__is_gnu_make); then \\\n    sane_makeflags=$$MFLAGS; \\\n  else \\\n    case $$MAKEFLAGS in \\\n      *\\\\[\\ \\\t]*) \\\n        bs=\\\\; \\\n        sane_makeflags=`printf '%s\\n' \"$$MAKEFLAGS\" \\\n          | sed \"s/$$bs$$bs[$$bs $$bs\t]*//g\"`;; \\\n    esac; \\\n  fi; \\\n  skip_next=no; \\\n  strip_trailopt () \\\n  { \\\n    flg=`printf '%s\\n' \"$$flg\" | sed \"s/$$1.*$$//\"`; \\\n  }; \\\n  for flg in $$sane_makeflags; do \\\n    test $$skip_next = yes && { skip_next=no; continue; }; \\\n    case $$flg in \\\n      *=*|--*) continue;; \\\n        -*I) strip_trailopt 'I'; skip_next=yes;; \\\n      -*I?*) strip_trailopt 'I';; \\\n        -*O) strip_trailopt 'O'; skip_next=yes;; \\\n      -*O?*) strip_trailopt 'O';; \\\n        -*l) strip_trailopt 'l'; skip_next=yes;; \\\n      -*l?*) strip_trailopt 'l';; \\\n      -[dEDm]) skip_next=yes;; \\\n      -[JT]) skip_next=yes;; \\\n    esac; \\\n    case $$flg in \\\n      *$$target_option*) has_opt=yes; break;; \\\n    esac; \\\n  done; \\\n  test $$has_opt = yes\nam__make_dryrun = (target_option=n; $(am__make_running_with_option))\nam__make_keepgoing = (target_option=k; $(am__make_running_with_option))\npkgdatadir = $(datadir)/@PACKAGE@\npkgincludedir = $(includedir)/@PACKAGE@\npkglibdir = $(libdir)/@PACKAGE@\npkglibexecdir = $(libexecdir)/@PACKAGE@\nam__cd = CDPATH=\"$${ZSH_VERSION+.}$(PATH_SEPARATOR)\" && cd\ninstall_sh_DATA = $(install_sh) -c -m 644\ninstall_sh_PROGRAM = $(install_sh) -c\ninstall_sh_SCRIPT = $(install_sh) -c\nINSTALL_HEADER = $(INSTALL_DATA)\ntransform = $(program_transform_name)\nNORMAL_INSTALL = :\nPRE_INSTALL = :\nPOST_INSTALL = :\nNORMAL_UNINSTALL = :\nPRE_UNINSTALL = :\nPOST_UNINSTALL = :\nbuild_triplet = @build@\nhost_triplet = @host@\nsubdir = src/extensions\nACLOCAL_M4 = $(top_srcdir)/aclocal.m4\nam__aclocal_m4_deps = $(top_srcdir)/m4/ac_python_devel.m4 \\\n\t$(top_srcdir)/m4/libtool.m4 $(top_srcdir)/m4/ltoptions.m4 \\\n\t$(top_srcdir)/m4/ltsugar.m4 $(top_srcdir)/m4/ltversion.m4 \\\n\t$(top_srcdir)/m4/lt~obsolete.m4 $(top_srcdir)/configure.ac\nam__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \\\n\t$(ACLOCAL_M4)\nDIST_COMMON = $(srcdir)/Makefile.am $(am__DIST_COMMON)\nmkinstalldirs = $(install_sh) -d\nCONFIG_HEADER = $(top_builddir)/config.h \\\n\t$(top_builddir)/src/include/fst/config.h\nCONFIG_CLEAN_FILES =\nCONFIG_CLEAN_VPATH_FILES =\nAM_V_P = $(am__v_P_@AM_V@)\nam__v_P_ = $(am__v_P_@AM_DEFAULT_V@)\nam__v_P_0 = false\nam__v_P_1 = :\nAM_V_GEN = $(am__v_GEN_@AM_V@)\nam__v_GEN_ = $(am__v_GEN_@AM_DEFAULT_V@)\nam__v_GEN_0 = @echo \"  GEN     \" $@;\nam__v_GEN_1 = \nAM_V_at = $(am__v_at_@AM_V@)\nam__v_at_ = $(am__v_at_@AM_DEFAULT_V@)\nam__v_at_0 = @\nam__v_at_1 = \nSOURCES =\nDIST_SOURCES =\nRECURSIVE_TARGETS = all-recursive check-recursive cscopelist-recursive \\\n\tctags-recursive dvi-recursive html-recursive info-recursive \\\n\tinstall-data-recursive install-dvi-recursive \\\n\tinstall-exec-recursive install-html-recursive \\\n\tinstall-info-recursive install-pdf-recursive \\\n\tinstall-ps-recursive install-recursive installcheck-recursive \\\n\tinstalldirs-recursive pdf-recursive ps-recursive \\\n\ttags-recursive uninstall-recursive\nam__can_run_installinfo = \\\n  case $$AM_UPDATE_INFO_DIR in \\\n    n|no|NO) false;; \\\n    *) (install-info --version) >/dev/null 2>&1;; \\\n  esac\nRECURSIVE_CLEAN_TARGETS = mostlyclean-recursive clean-recursive\t\\\n  distclean-recursive maintainer-clean-recursive\nam__recursive_targets = \\\n  $(RECURSIVE_TARGETS) \\\n  $(RECURSIVE_CLEAN_TARGETS) \\\n  $(am__extra_recursive_targets)\nAM_RECURSIVE_TARGETS = $(am__recursive_targets:-recursive=) TAGS CTAGS \\\n\tdistdir\nam__tagged_files = $(HEADERS) $(SOURCES) $(TAGS_FILES) $(LISP)\n# Read a list of newline-separated strings from the standard input,\n# and print each of them once, without duplicates.  Input order is\n# *not* preserved.\nam__uniquify_input = $(AWK) '\\\n  BEGIN { nonempty = 0; } \\\n  { items[$$0] = 1; nonempty = 1; } \\\n  END { if (nonempty) { for (i in items) print i; }; } \\\n'\n# Make sure the list of sources is unique.  This is necessary because,\n# e.g., the same source file might be shared among _SOURCES variables\n# for different programs/libraries.\nam__define_uniq_tagged_files = \\\n  list='$(am__tagged_files)'; \\\n  unique=`for i in $$list; do \\\n    if test -f \"$$i\"; then echo $$i; else echo $(srcdir)/$$i; fi; \\\n  done | $(am__uniquify_input)`\nETAGS = etags\nCTAGS = ctags\nDIST_SUBDIRS = compact compress const far linear lookahead pdt mpdt \\\n\tngram python special\nam__DIST_COMMON = $(srcdir)/Makefile.in\nDISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST)\nam__relativize = \\\n  dir0=`pwd`; \\\n  sed_first='s,^\\([^/]*\\)/.*$$,\\1,'; \\\n  sed_rest='s,^[^/]*/*,,'; \\\n  sed_last='s,^.*/\\([^/]*\\)$$,\\1,'; \\\n  sed_butlast='s,/*[^/]*$$,,'; \\\n  while test -n \"$$dir1\"; do \\\n    first=`echo \"$$dir1\" | sed -e \"$$sed_first\"`; \\\n    if test \"$$first\" != \".\"; then \\\n      if test \"$$first\" = \"..\"; then \\\n        dir2=`echo \"$$dir0\" | sed -e \"$$sed_last\"`/\"$$dir2\"; \\\n        dir0=`echo \"$$dir0\" | sed -e \"$$sed_butlast\"`; \\\n      else \\\n        first2=`echo \"$$dir2\" | sed -e \"$$sed_first\"`; \\\n        if test \"$$first2\" = \"$$first\"; then \\\n          dir2=`echo \"$$dir2\" | sed -e \"$$sed_rest\"`; \\\n        else \\\n          dir2=\"../$$dir2\"; \\\n        fi; \\\n        dir0=\"$$dir0\"/\"$$first\"; \\\n      fi; \\\n    fi; \\\n    dir1=`echo \"$$dir1\" | sed -e \"$$sed_rest\"`; \\\n  done; \\\n  reldir=\"$$dir2\"\nACLOCAL = @ACLOCAL@\nAMTAR = @AMTAR@\nAM_DEFAULT_VERBOSITY = @AM_DEFAULT_VERBOSITY@\nAR = @AR@\nAUTOCONF = @AUTOCONF@\nAUTOHEADER = @AUTOHEADER@\nAUTOMAKE = @AUTOMAKE@\nAWK = @AWK@\nCC = @CC@\nCCDEPMODE = @CCDEPMODE@\nCFLAGS = @CFLAGS@\nCPP = @CPP@\nCPPFLAGS = @CPPFLAGS@\nCXX = @CXX@\nCXXCPP = @CXXCPP@\nCXXDEPMODE = @CXXDEPMODE@\nCXXFLAGS = @CXXFLAGS@\nCYGPATH_W = @CYGPATH_W@\nDEFS = @DEFS@\nDEPDIR = @DEPDIR@\nDLLTOOL = @DLLTOOL@\nDL_LIBS = @DL_LIBS@\nDSYMUTIL = @DSYMUTIL@\nDUMPBIN = @DUMPBIN@\nECHO_C = @ECHO_C@\nECHO_N = @ECHO_N@\nECHO_T = @ECHO_T@\nEGREP = @EGREP@\nEXEEXT = @EXEEXT@\nFGREP = @FGREP@\nGREP = @GREP@\nINSTALL = @INSTALL@\nINSTALL_DATA = @INSTALL_DATA@\nINSTALL_PROGRAM = @INSTALL_PROGRAM@\nINSTALL_SCRIPT = @INSTALL_SCRIPT@\nINSTALL_STRIP_PROGRAM = @INSTALL_STRIP_PROGRAM@\nLD = @LD@\nLDFLAGS = @LDFLAGS@\nLIBOBJS = @LIBOBJS@\nLIBS = @LIBS@\nLIBTOOL = @LIBTOOL@\nLIPO = @LIPO@\nLN_S = @LN_S@\nLTLIBOBJS = @LTLIBOBJS@\nLT_SYS_LIBRARY_PATH = @LT_SYS_LIBRARY_PATH@\nMAKEINFO = @MAKEINFO@\nMANIFEST_TOOL = @MANIFEST_TOOL@\nMKDIR_P = @MKDIR_P@\nNM = @NM@\nNMEDIT = @NMEDIT@\nOBJDUMP = @OBJDUMP@\nOBJEXT = @OBJEXT@\nOTOOL = @OTOOL@\nOTOOL64 = @OTOOL64@\nPACKAGE = @PACKAGE@\nPACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@\nPACKAGE_NAME = @PACKAGE_NAME@\nPACKAGE_STRING = @PACKAGE_STRING@\nPACKAGE_TARNAME = @PACKAGE_TARNAME@\nPACKAGE_URL = @PACKAGE_URL@\nPACKAGE_VERSION = @PACKAGE_VERSION@\nPATH_SEPARATOR = @PATH_SEPARATOR@\nPYTHON = @PYTHON@\nPYTHON_CPPFLAGS = @PYTHON_CPPFLAGS@\nPYTHON_EXEC_PREFIX = @PYTHON_EXEC_PREFIX@\nPYTHON_EXTRA_LDFLAGS = @PYTHON_EXTRA_LDFLAGS@\nPYTHON_EXTRA_LIBS = @PYTHON_EXTRA_LIBS@\nPYTHON_LDFLAGS = @PYTHON_LDFLAGS@\nPYTHON_PLATFORM = @PYTHON_PLATFORM@\nPYTHON_PREFIX = @PYTHON_PREFIX@\nPYTHON_SITE_PKG = @PYTHON_SITE_PKG@\nPYTHON_VERSION = @PYTHON_VERSION@\nRANLIB = @RANLIB@\nSED = @SED@\nSET_MAKE = @SET_MAKE@\nSHELL = @SHELL@\nSTRIP = @STRIP@\nVERSION = @VERSION@\nabs_builddir = @abs_builddir@\nabs_srcdir = @abs_srcdir@\nabs_top_builddir = @abs_top_builddir@\nabs_top_srcdir = @abs_top_srcdir@\nac_ct_AR = @ac_ct_AR@\nac_ct_CC = @ac_ct_CC@\nac_ct_CXX = @ac_ct_CXX@\nac_ct_DUMPBIN = @ac_ct_DUMPBIN@\nam__include = @am__include@\nam__leading_dot = @am__leading_dot@\nam__quote = @am__quote@\nam__tar = @am__tar@\nam__untar = @am__untar@\nbindir = @bindir@\nbuild = @build@\nbuild_alias = @build_alias@\nbuild_cpu = @build_cpu@\nbuild_os = @build_os@\nbuild_vendor = @build_vendor@\nbuilddir = @builddir@\ndatadir = @datadir@\ndatarootdir = @datarootdir@\ndocdir = @docdir@\ndvidir = @dvidir@\nexec_prefix = @exec_prefix@\nhost = @host@\nhost_alias = @host_alias@\nhost_cpu = @host_cpu@\nhost_os = @host_os@\nhost_vendor = @host_vendor@\nhtmldir = @htmldir@\nincludedir = @includedir@\ninfodir = @infodir@\ninstall_sh = @install_sh@\nlibdir = @libdir@\nlibexecdir = @libexecdir@\nlibfstdir = @libfstdir@\nlocaledir = @localedir@\nlocalstatedir = @localstatedir@\nmandir = @mandir@\nmkdir_p = @mkdir_p@\noldincludedir = @oldincludedir@\npdfdir = @pdfdir@\npkgpyexecdir = @pkgpyexecdir@\npkgpythondir = @pkgpythondir@\nprefix = @prefix@\nprogram_transform_name = @program_transform_name@\npsdir = @psdir@\npyexecdir = @pyexecdir@\npythondir = @pythondir@\nrunstatedir = @runstatedir@\nsbindir = @sbindir@\nsharedstatedir = @sharedstatedir@\nsrcdir = @srcdir@\nsysconfdir = @sysconfdir@\ntarget_alias = @target_alias@\ntop_build_prefix = @top_build_prefix@\ntop_builddir = @top_builddir@\ntop_srcdir = @top_srcdir@\n@HAVE_COMPACT_TRUE@compactdir = compact\n@HAVE_COMPRESS_TRUE@compressdir = compress\n@HAVE_CONST_TRUE@constdir = const\n@HAVE_FAR_TRUE@fardir = far\n@HAVE_GRM_TRUE@fardir = far\n@HAVE_PYTHON_TRUE@fardir = far\n@HAVE_GRM_TRUE@pdtdir = pdt\n@HAVE_MPDT_TRUE@pdtdir = pdt\n@HAVE_PDT_TRUE@pdtdir = pdt\n@HAVE_GRM_TRUE@mpdtdir = mpdt\n@HAVE_MPDT_TRUE@mpdtdir = mpdt\n@HAVE_LINEAR_TRUE@lineardir = linear\n@HAVE_LOOKAHEAD_TRUE@lookaheaddir = lookahead\n@HAVE_NGRAM_TRUE@ngramdir = ngram\n@HAVE_PYTHON_TRUE@pywrapfstdir = python\n@HAVE_SPECIAL_TRUE@specialdir = special\nSUBDIRS = $(compactdir) $(compressdir) $(constdir) $(fardir) $(lineardir)  \\\n          $(lookaheaddir) $(pdtdir) $(mpdtdir) $(ngramdir) $(pywrapfstdir) \\\n          $(specialdir)\n\nall: all-recursive\n\n.SUFFIXES:\n$(srcdir)/Makefile.in:  $(srcdir)/Makefile.am  $(am__configure_deps)\n\t@for dep in $?; do \\\n\t  case '$(am__configure_deps)' in \\\n\t    *$$dep*) \\\n\t      ( cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh ) \\\n\t        && { if test -f $@; then exit 0; else break; fi; }; \\\n\t      exit 1;; \\\n\t  esac; \\\n\tdone; \\\n\techo ' cd $(top_srcdir) && $(AUTOMAKE) --foreign src/extensions/Makefile'; \\\n\t$(am__cd) $(top_srcdir) && \\\n\t  $(AUTOMAKE) --foreign src/extensions/Makefile\nMakefile: $(srcdir)/Makefile.in $(top_builddir)/config.status\n\t@case '$?' in \\\n\t  *config.status*) \\\n\t    cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh;; \\\n\t  *) \\\n\t    echo ' cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe)'; \\\n\t    cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe);; \\\n\tesac;\n\n$(top_builddir)/config.status: $(top_srcdir)/configure $(CONFIG_STATUS_DEPENDENCIES)\n\tcd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh\n\n$(top_srcdir)/configure:  $(am__configure_deps)\n\tcd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh\n$(ACLOCAL_M4):  $(am__aclocal_m4_deps)\n\tcd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh\n$(am__aclocal_m4_deps):\n\nmostlyclean-libtool:\n\t-rm -f *.lo\n\nclean-libtool:\n\t-rm -rf .libs _libs\n\n# This directory's subdirectories are mostly independent; you can cd\n# into them and run 'make' without going through this Makefile.\n# To change the values of 'make' variables: instead of editing Makefiles,\n# (1) if the variable is set in 'config.status', edit 'config.status'\n#     (which will cause the Makefiles to be regenerated when you run 'make');\n# (2) otherwise, pass the desired values on the 'make' command line.\n$(am__recursive_targets):\n\t@fail=; \\\n\tif $(am__make_keepgoing); then \\\n\t  failcom='fail=yes'; \\\n\telse \\\n\t  failcom='exit 1'; \\\n\tfi; \\\n\tdot_seen=no; \\\n\ttarget=`echo $@ | sed s/-recursive//`; \\\n\tcase \"$@\" in \\\n\t  distclean-* | maintainer-clean-*) list='$(DIST_SUBDIRS)' ;; \\\n\t  *) list='$(SUBDIRS)' ;; \\\n\tesac; \\\n\tfor subdir in $$list; do \\\n\t  echo \"Making $$target in $$subdir\"; \\\n\t  if test \"$$subdir\" = \".\"; then \\\n\t    dot_seen=yes; \\\n\t    local_target=\"$$target-am\"; \\\n\t  else \\\n\t    local_target=\"$$target\"; \\\n\t  fi; \\\n\t  ($(am__cd) $$subdir && $(MAKE) $(AM_MAKEFLAGS) $$local_target) \\\n\t  || eval $$failcom; \\\n\tdone; \\\n\tif test \"$$dot_seen\" = \"no\"; then \\\n\t  $(MAKE) $(AM_MAKEFLAGS) \"$$target-am\" || exit 1; \\\n\tfi; test -z \"$$fail\"\n\nID: $(am__tagged_files)\n\t$(am__define_uniq_tagged_files); mkid -fID $$unique\ntags: tags-recursive\nTAGS: tags\n\ntags-am: $(TAGS_DEPENDENCIES) $(am__tagged_files)\n\tset x; \\\n\there=`pwd`; \\\n\tif ($(ETAGS) --etags-include --version) >/dev/null 2>&1; then \\\n\t  include_option=--etags-include; \\\n\t  empty_fix=.; \\\n\telse \\\n\t  include_option=--include; \\\n\t  empty_fix=; \\\n\tfi; \\\n\tlist='$(SUBDIRS)'; for subdir in $$list; do \\\n\t  if test \"$$subdir\" = .; then :; else \\\n\t    test ! -f $$subdir/TAGS || \\\n\t      set \"$$@\" \"$$include_option=$$here/$$subdir/TAGS\"; \\\n\t  fi; \\\n\tdone; \\\n\t$(am__define_uniq_tagged_files); \\\n\tshift; \\\n\tif test -z \"$(ETAGS_ARGS)$$*$$unique\"; then :; else \\\n\t  test -n \"$$unique\" || unique=$$empty_fix; \\\n\t  if test $$# -gt 0; then \\\n\t    $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \\\n\t      \"$$@\" $$unique; \\\n\t  else \\\n\t    $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \\\n\t      $$unique; \\\n\t  fi; \\\n\tfi\nctags: ctags-recursive\n\nCTAGS: ctags\nctags-am: $(TAGS_DEPENDENCIES) $(am__tagged_files)\n\t$(am__define_uniq_tagged_files); \\\n\ttest -z \"$(CTAGS_ARGS)$$unique\" \\\n\t  || $(CTAGS) $(CTAGSFLAGS) $(AM_CTAGSFLAGS) $(CTAGS_ARGS) \\\n\t     $$unique\n\nGTAGS:\n\there=`$(am__cd) $(top_builddir) && pwd` \\\n\t  && $(am__cd) $(top_srcdir) \\\n\t  && gtags -i $(GTAGS_ARGS) \"$$here\"\ncscopelist: cscopelist-recursive\n\ncscopelist-am: $(am__tagged_files)\n\tlist='$(am__tagged_files)'; \\\n\tcase \"$(srcdir)\" in \\\n\t  [\\\\/]* | ?:[\\\\/]*) sdir=\"$(srcdir)\" ;; \\\n\t  *) sdir=$(subdir)/$(srcdir) ;; \\\n\tesac; \\\n\tfor i in $$list; do \\\n\t  if test -f \"$$i\"; then \\\n\t    echo \"$(subdir)/$$i\"; \\\n\t  else \\\n\t    echo \"$$sdir/$$i\"; \\\n\t  fi; \\\n\tdone >> $(top_builddir)/cscope.files\n\ndistclean-tags:\n\t-rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags\n\ndistdir: $(DISTFILES)\n\t@srcdirstrip=`echo \"$(srcdir)\" | sed 's/[].[^$$\\\\*]/\\\\\\\\&/g'`; \\\n\ttopsrcdirstrip=`echo \"$(top_srcdir)\" | sed 's/[].[^$$\\\\*]/\\\\\\\\&/g'`; \\\n\tlist='$(DISTFILES)'; \\\n\t  dist_files=`for file in $$list; do echo $$file; done | \\\n\t  sed -e \"s|^$$srcdirstrip/||;t\" \\\n\t      -e \"s|^$$topsrcdirstrip/|$(top_builddir)/|;t\"`; \\\n\tcase $$dist_files in \\\n\t  */*) $(MKDIR_P) `echo \"$$dist_files\" | \\\n\t\t\t   sed '/\\//!d;s|^|$(distdir)/|;s,/[^/]*$$,,' | \\\n\t\t\t   sort -u` ;; \\\n\tesac; \\\n\tfor file in $$dist_files; do \\\n\t  if test -f $$file || test -d $$file; then d=.; else d=$(srcdir); fi; \\\n\t  if test -d $$d/$$file; then \\\n\t    dir=`echo \"/$$file\" | sed -e 's,/[^/]*$$,,'`; \\\n\t    if test -d \"$(distdir)/$$file\"; then \\\n\t      find \"$(distdir)/$$file\" -type d ! -perm -700 -exec chmod u+rwx {} \\;; \\\n\t    fi; \\\n\t    if test -d $(srcdir)/$$file && test $$d != $(srcdir); then \\\n\t      cp -fpR $(srcdir)/$$file \"$(distdir)$$dir\" || exit 1; \\\n\t      find \"$(distdir)/$$file\" -type d ! -perm -700 -exec chmod u+rwx {} \\;; \\\n\t    fi; \\\n\t    cp -fpR $$d/$$file \"$(distdir)$$dir\" || exit 1; \\\n\t  else \\\n\t    test -f \"$(distdir)/$$file\" \\\n\t    || cp -p $$d/$$file \"$(distdir)/$$file\" \\\n\t    || exit 1; \\\n\t  fi; \\\n\tdone\n\t@list='$(DIST_SUBDIRS)'; for subdir in $$list; do \\\n\t  if test \"$$subdir\" = .; then :; else \\\n\t    $(am__make_dryrun) \\\n\t      || test -d \"$(distdir)/$$subdir\" \\\n\t      || $(MKDIR_P) \"$(distdir)/$$subdir\" \\\n\t      || exit 1; \\\n\t    dir1=$$subdir; dir2=\"$(distdir)/$$subdir\"; \\\n\t    $(am__relativize); \\\n\t    new_distdir=$$reldir; \\\n\t    dir1=$$subdir; dir2=\"$(top_distdir)\"; \\\n\t    $(am__relativize); \\\n\t    new_top_distdir=$$reldir; \\\n\t    echo \" (cd $$subdir && $(MAKE) $(AM_MAKEFLAGS) top_distdir=\"$$new_top_distdir\" distdir=\"$$new_distdir\" \\\\\"; \\\n\t    echo \"     am__remove_distdir=: am__skip_length_check=: am__skip_mode_fix=: distdir)\"; \\\n\t    ($(am__cd) $$subdir && \\\n\t      $(MAKE) $(AM_MAKEFLAGS) \\\n\t        top_distdir=\"$$new_top_distdir\" \\\n\t        distdir=\"$$new_distdir\" \\\n\t\tam__remove_distdir=: \\\n\t\tam__skip_length_check=: \\\n\t\tam__skip_mode_fix=: \\\n\t        distdir) \\\n\t      || exit 1; \\\n\t  fi; \\\n\tdone\ncheck-am: all-am\ncheck: check-recursive\nall-am: Makefile\ninstalldirs: installdirs-recursive\ninstalldirs-am:\ninstall: install-recursive\ninstall-exec: install-exec-recursive\ninstall-data: install-data-recursive\nuninstall: uninstall-recursive\n\ninstall-am: all-am\n\t@$(MAKE) $(AM_MAKEFLAGS) install-exec-am install-data-am\n\ninstallcheck: installcheck-recursive\ninstall-strip:\n\tif test -z '$(STRIP)'; then \\\n\t  $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" \\\n\t    install_sh_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" INSTALL_STRIP_FLAG=-s \\\n\t      install; \\\n\telse \\\n\t  $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" \\\n\t    install_sh_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" INSTALL_STRIP_FLAG=-s \\\n\t    \"INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'\" install; \\\n\tfi\nmostlyclean-generic:\n\nclean-generic:\n\ndistclean-generic:\n\t-test -z \"$(CONFIG_CLEAN_FILES)\" || rm -f $(CONFIG_CLEAN_FILES)\n\t-test . = \"$(srcdir)\" || test -z \"$(CONFIG_CLEAN_VPATH_FILES)\" || rm -f $(CONFIG_CLEAN_VPATH_FILES)\n\nmaintainer-clean-generic:\n\t@echo \"This command is intended for maintainers to use\"\n\t@echo \"it deletes files that may require special tools to rebuild.\"\nclean: clean-recursive\n\nclean-am: clean-generic clean-libtool mostlyclean-am\n\ndistclean: distclean-recursive\n\t-rm -f Makefile\ndistclean-am: clean-am distclean-generic distclean-tags\n\ndvi: dvi-recursive\n\ndvi-am:\n\nhtml: html-recursive\n\nhtml-am:\n\ninfo: info-recursive\n\ninfo-am:\n\ninstall-data-am:\n\ninstall-dvi: install-dvi-recursive\n\ninstall-dvi-am:\n\ninstall-exec-am:\n\ninstall-html: install-html-recursive\n\ninstall-html-am:\n\ninstall-info: install-info-recursive\n\ninstall-info-am:\n\ninstall-man:\n\ninstall-pdf: install-pdf-recursive\n\ninstall-pdf-am:\n\ninstall-ps: install-ps-recursive\n\ninstall-ps-am:\n\ninstallcheck-am:\n\nmaintainer-clean: maintainer-clean-recursive\n\t-rm -f Makefile\nmaintainer-clean-am: distclean-am maintainer-clean-generic\n\nmostlyclean: mostlyclean-recursive\n\nmostlyclean-am: mostlyclean-generic mostlyclean-libtool\n\npdf: pdf-recursive\n\npdf-am:\n\nps: ps-recursive\n\nps-am:\n\nuninstall-am:\n\n.MAKE: $(am__recursive_targets) install-am install-strip\n\n.PHONY: $(am__recursive_targets) CTAGS GTAGS TAGS all all-am check \\\n\tcheck-am clean clean-generic clean-libtool cscopelist-am ctags \\\n\tctags-am distclean distclean-generic distclean-libtool \\\n\tdistclean-tags distdir dvi dvi-am html html-am info info-am \\\n\tinstall install-am install-data install-data-am install-dvi \\\n\tinstall-dvi-am install-exec install-exec-am install-html \\\n\tinstall-html-am install-info install-info-am install-man \\\n\tinstall-pdf install-pdf-am install-ps install-ps-am \\\n\tinstall-strip installcheck installcheck-am installdirs \\\n\tinstalldirs-am maintainer-clean maintainer-clean-generic \\\n\tmostlyclean mostlyclean-generic mostlyclean-libtool pdf pdf-am \\\n\tps ps-am tags tags-am uninstall uninstall-am\n\n.PRECIOUS: Makefile\n\n\n# Tell versions [3.59,3.63) of GNU make to not export all variables.\n# Otherwise a system limit (for SysV at least) may be exceeded.\n.NOEXPORT:\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/extensions/compact/CMakeLists.txt",
    "content": "add_library(fstcompact\n  compact8_acceptor-fst.cc \n  compact8_string-fst.cc \n  compact8_unweighted-fst.cc \n  compact8_unweighted_acceptor-fst.cc \n  compact8_weighted_string-fst.cc \n  compact16_acceptor-fst.cc \n  compact16_string-fst.cc \n  compact16_unweighted-fst.cc \n  compact16_unweighted_acceptor-fst.cc \n  compact16_weighted_string-fst.cc \n  compact64_acceptor-fst.cc \n  compact64_string-fst.cc \n  compact64_unweighted-fst.cc \n  compact64_unweighted_acceptor-fst.cc \n  compact64_weighted_string-fst.cc\n)\n\ntarget_link_libraries(fstcompact fst)\nset_target_properties(fstcompact PROPERTIES \n  SOVERSION \"${SOVERSION}\"\n  FOLDER compact\n)\n\ninstall(TARGETS fstcompact \n\t        LIBRARY DESTINATION lib\n\t\t\tARCHIVE DESTINATION lib\n            RUNTIME DESTINATION lib\n)\n\nfunction (add_module _name)\n    add_library(${ARGV})\n    if (TARGET ${_name})\n        target_link_libraries(${_name} fst)\n        set_target_properties(${_name} PROPERTIES \n            WINDOWS_EXPORT_ALL_SYMBOLS true\n            FOLDER compact/modules\n        )\n    endif()\n\n    #set_target_properties(${_name} PROPERTIES SOVERSION \"1\")\n    install(TARGETS ${_name} \n\t        LIBRARY DESTINATION lib/fst\n\t\t\tARCHIVE DESTINATION lib/fst\n            RUNTIME DESTINATION lib/fst)\nendfunction()\n\nadd_module(compact8_acceptor-fst MODULE\n  compact8_acceptor-fst.cc)\n \nadd_module(compact8_string-fst MODULE\n  compact8_string-fst.cc)\n \nadd_module(compact8_unweighted-fst MODULE\n  compact8_unweighted-fst.cc)\n \nadd_module(compact8_unweighted_acceptor-fst MODULE\n  compact8_unweighted_acceptor-fst.cc)\n \nadd_module(compact8_weighted_string-fst MODULE\n  compact8_weighted_string-fst.cc)\n \nadd_module(compact16_acceptor-fst MODULE\n  compact16_acceptor-fst.cc)\n \nadd_module(compact16_string-fst MODULE\n  compact16_string-fst.cc)\n \nadd_module(compact16_unweighted-fst MODULE\n  compact16_unweighted-fst.cc)\n \nadd_module(compact16_unweighted_acceptor-fst MODULE\n  compact16_unweighted_acceptor-fst.cc)\n \nadd_module(compact16_weighted_string-fst MODULE\n  compact16_weighted_string-fst.cc)\n \nadd_module(compact64_acceptor-fst MODULE\n  compact64_acceptor-fst.cc)\n \nadd_module(compact64_string-fst MODULE\n  compact64_string-fst.cc)\n \nadd_module(compact64_unweighted-fst MODULE\n  compact64_unweighted-fst.cc)\n \nadd_module(compact64_unweighted_acceptor-fst MODULE\n  compact64_unweighted_acceptor-fst.cc)\n \nadd_module(compact64_weighted_string-fst MODULE\n  compact64_weighted_string-fst.cc)\n\n\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/extensions/compact/Makefile.am",
    "content": "AM_CPPFLAGS = -I$(srcdir)/../../include $(ICU_CPPFLAGS)\n\nlibfstdir = @libfstdir@\nlibfst_LTLIBRARIES = compact8_acceptor-fst.la compact8_string-fst.la compact8_unweighted-fst.la compact8_unweighted_acceptor-fst.la compact8_weighted_string-fst.la compact16_acceptor-fst.la compact16_string-fst.la compact16_unweighted-fst.la compact16_unweighted_acceptor-fst.la compact16_weighted_string-fst.la compact64_acceptor-fst.la compact64_string-fst.la compact64_unweighted-fst.la compact64_unweighted_acceptor-fst.la compact64_weighted_string-fst.la\n\nlib_LTLIBRARIES = libfstcompact.la\n\nlibfstcompact_la_SOURCES = compact8_acceptor-fst.cc compact8_string-fst.cc compact8_unweighted-fst.cc compact8_unweighted_acceptor-fst.cc compact8_weighted_string-fst.cc compact16_acceptor-fst.cc compact16_string-fst.cc compact16_unweighted-fst.cc compact16_unweighted_acceptor-fst.cc compact16_weighted_string-fst.cc compact64_acceptor-fst.cc compact64_string-fst.cc compact64_unweighted-fst.cc compact64_unweighted_acceptor-fst.cc compact64_weighted_string-fst.cc\nlibfstcompact_la_LDFLAGS = -version-info 13:0:0\nlibfstcompact_la_LIBADD = ../../lib/libfst.la -lm $(DL_LIBS)\n\ncompact8_acceptor_fst_la_SOURCES = compact8_acceptor-fst.cc\ncompact8_acceptor_fst_la_LDFLAGS = -module\n\ncompact8_string_fst_la_SOURCES = compact8_string-fst.cc\ncompact8_string_fst_la_LDFLAGS = -module\n\ncompact8_unweighted_fst_la_SOURCES = compact8_unweighted-fst.cc\ncompact8_unweighted_fst_la_LDFLAGS = -module\n\ncompact8_unweighted_acceptor_fst_la_SOURCES = compact8_unweighted_acceptor-fst.cc\ncompact8_unweighted_acceptor_fst_la_LDFLAGS = -module\n\ncompact8_weighted_string_fst_la_SOURCES = compact8_weighted_string-fst.cc\ncompact8_weighted_string_fst_la_LDFLAGS = -module\n\ncompact16_acceptor_fst_la_SOURCES = compact16_acceptor-fst.cc\ncompact16_acceptor_fst_la_LDFLAGS = -module\n\ncompact16_string_fst_la_SOURCES = compact16_string-fst.cc\ncompact16_string_fst_la_LDFLAGS = -module\n\ncompact16_unweighted_fst_la_SOURCES = compact16_unweighted-fst.cc\ncompact16_unweighted_fst_la_LDFLAGS = -module\n\ncompact16_unweighted_acceptor_fst_la_SOURCES = compact16_unweighted_acceptor-fst.cc\ncompact16_unweighted_acceptor_fst_la_LDFLAGS = -module\n\ncompact16_weighted_string_fst_la_SOURCES = compact16_weighted_string-fst.cc\ncompact16_weighted_string_fst_la_LDFLAGS = -module\n\ncompact64_acceptor_fst_la_SOURCES = compact64_acceptor-fst.cc\ncompact64_acceptor_fst_la_LDFLAGS = -module\n\ncompact64_string_fst_la_SOURCES = compact64_string-fst.cc\ncompact64_string_fst_la_LDFLAGS = -module\n\ncompact64_unweighted_fst_la_SOURCES = compact64_unweighted-fst.cc\ncompact64_unweighted_fst_la_LDFLAGS = -module\n\ncompact64_unweighted_acceptor_fst_la_SOURCES = compact64_unweighted_acceptor-fst.cc\ncompact64_unweighted_acceptor_fst_la_LDFLAGS = -module\n\ncompact64_weighted_string_fst_la_SOURCES = compact64_weighted_string-fst.cc\ncompact64_weighted_string_fst_la_LDFLAGS = -module\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/extensions/compact/Makefile.in",
    "content": "# Makefile.in generated by automake 1.15.1 from Makefile.am.\n# @configure_input@\n\n# Copyright (C) 1994-2017 Free Software Foundation, Inc.\n\n# This Makefile.in is free software; the Free Software Foundation\n# gives unlimited permission to copy and/or distribute it,\n# with or without modifications, as long as this notice is preserved.\n\n# This program is distributed in the hope that it will be useful,\n# but WITHOUT ANY WARRANTY, to the extent permitted by law; without\n# even the implied warranty of MERCHANTABILITY or FITNESS FOR A\n# PARTICULAR PURPOSE.\n\n@SET_MAKE@\n\nVPATH = @srcdir@\nam__is_gnu_make = { \\\n  if test -z '$(MAKELEVEL)'; then \\\n    false; \\\n  elif test -n '$(MAKE_HOST)'; then \\\n    true; \\\n  elif test -n '$(MAKE_VERSION)' && test -n '$(CURDIR)'; then \\\n    true; \\\n  else \\\n    false; \\\n  fi; \\\n}\nam__make_running_with_option = \\\n  case $${target_option-} in \\\n      ?) ;; \\\n      *) echo \"am__make_running_with_option: internal error: invalid\" \\\n              \"target option '$${target_option-}' specified\" >&2; \\\n         exit 1;; \\\n  esac; \\\n  has_opt=no; \\\n  sane_makeflags=$$MAKEFLAGS; \\\n  if $(am__is_gnu_make); then \\\n    sane_makeflags=$$MFLAGS; \\\n  else \\\n    case $$MAKEFLAGS in \\\n      *\\\\[\\ \\\t]*) \\\n        bs=\\\\; \\\n        sane_makeflags=`printf '%s\\n' \"$$MAKEFLAGS\" \\\n          | sed \"s/$$bs$$bs[$$bs $$bs\t]*//g\"`;; \\\n    esac; \\\n  fi; \\\n  skip_next=no; \\\n  strip_trailopt () \\\n  { \\\n    flg=`printf '%s\\n' \"$$flg\" | sed \"s/$$1.*$$//\"`; \\\n  }; \\\n  for flg in $$sane_makeflags; do \\\n    test $$skip_next = yes && { skip_next=no; continue; }; \\\n    case $$flg in \\\n      *=*|--*) continue;; \\\n        -*I) strip_trailopt 'I'; skip_next=yes;; \\\n      -*I?*) strip_trailopt 'I';; \\\n        -*O) strip_trailopt 'O'; skip_next=yes;; \\\n      -*O?*) strip_trailopt 'O';; \\\n        -*l) strip_trailopt 'l'; skip_next=yes;; \\\n      -*l?*) strip_trailopt 'l';; \\\n      -[dEDm]) skip_next=yes;; \\\n      -[JT]) skip_next=yes;; \\\n    esac; \\\n    case $$flg in \\\n      *$$target_option*) has_opt=yes; break;; \\\n    esac; \\\n  done; \\\n  test $$has_opt = yes\nam__make_dryrun = (target_option=n; $(am__make_running_with_option))\nam__make_keepgoing = (target_option=k; $(am__make_running_with_option))\npkgdatadir = $(datadir)/@PACKAGE@\npkgincludedir = $(includedir)/@PACKAGE@\npkglibdir = $(libdir)/@PACKAGE@\npkglibexecdir = $(libexecdir)/@PACKAGE@\nam__cd = CDPATH=\"$${ZSH_VERSION+.}$(PATH_SEPARATOR)\" && cd\ninstall_sh_DATA = $(install_sh) -c -m 644\ninstall_sh_PROGRAM = $(install_sh) -c\ninstall_sh_SCRIPT = $(install_sh) -c\nINSTALL_HEADER = $(INSTALL_DATA)\ntransform = $(program_transform_name)\nNORMAL_INSTALL = :\nPRE_INSTALL = :\nPOST_INSTALL = :\nNORMAL_UNINSTALL = :\nPRE_UNINSTALL = :\nPOST_UNINSTALL = :\nbuild_triplet = @build@\nhost_triplet = @host@\nsubdir = src/extensions/compact\nACLOCAL_M4 = $(top_srcdir)/aclocal.m4\nam__aclocal_m4_deps = $(top_srcdir)/m4/ac_python_devel.m4 \\\n\t$(top_srcdir)/m4/libtool.m4 $(top_srcdir)/m4/ltoptions.m4 \\\n\t$(top_srcdir)/m4/ltsugar.m4 $(top_srcdir)/m4/ltversion.m4 \\\n\t$(top_srcdir)/m4/lt~obsolete.m4 $(top_srcdir)/configure.ac\nam__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \\\n\t$(ACLOCAL_M4)\nDIST_COMMON = $(srcdir)/Makefile.am $(am__DIST_COMMON)\nmkinstalldirs = $(install_sh) -d\nCONFIG_HEADER = $(top_builddir)/config.h \\\n\t$(top_builddir)/src/include/fst/config.h\nCONFIG_CLEAN_FILES =\nCONFIG_CLEAN_VPATH_FILES =\nam__vpath_adj_setup = srcdirstrip=`echo \"$(srcdir)\" | sed 's|.|.|g'`;\nam__vpath_adj = case $$p in \\\n    $(srcdir)/*) f=`echo \"$$p\" | sed \"s|^$$srcdirstrip/||\"`;; \\\n    *) f=$$p;; \\\n  esac;\nam__strip_dir = f=`echo $$p | sed -e 's|^.*/||'`;\nam__install_max = 40\nam__nobase_strip_setup = \\\n  srcdirstrip=`echo \"$(srcdir)\" | sed 's/[].[^$$\\\\*|]/\\\\\\\\&/g'`\nam__nobase_strip = \\\n  for p in $$list; do echo \"$$p\"; done | sed -e \"s|$$srcdirstrip/||\"\nam__nobase_list = $(am__nobase_strip_setup); \\\n  for p in $$list; do echo \"$$p $$p\"; done | \\\n  sed \"s| $$srcdirstrip/| |;\"' / .*\\//!s/ .*/ ./; s,\\( .*\\)/[^/]*$$,\\1,' | \\\n  $(AWK) 'BEGIN { files[\".\"] = \"\" } { files[$$2] = files[$$2] \" \" $$1; \\\n    if (++n[$$2] == $(am__install_max)) \\\n      { print $$2, files[$$2]; n[$$2] = 0; files[$$2] = \"\" } } \\\n    END { for (dir in files) print dir, files[dir] }'\nam__base_list = \\\n  sed '$$!N;$$!N;$$!N;$$!N;$$!N;$$!N;$$!N;s/\\n/ /g' | \\\n  sed '$$!N;$$!N;$$!N;$$!N;s/\\n/ /g'\nam__uninstall_files_from_dir = { \\\n  test -z \"$$files\" \\\n    || { test ! -d \"$$dir\" && test ! -f \"$$dir\" && test ! -r \"$$dir\"; } \\\n    || { echo \" ( cd '$$dir' && rm -f\" $$files \")\"; \\\n         $(am__cd) \"$$dir\" && rm -f $$files; }; \\\n  }\nam__installdirs = \"$(DESTDIR)$(libdir)\" \"$(DESTDIR)$(libfstdir)\"\nLTLIBRARIES = $(lib_LTLIBRARIES) $(libfst_LTLIBRARIES)\ncompact16_acceptor_fst_la_LIBADD =\nam_compact16_acceptor_fst_la_OBJECTS = compact16_acceptor-fst.lo\ncompact16_acceptor_fst_la_OBJECTS =  \\\n\t$(am_compact16_acceptor_fst_la_OBJECTS)\nAM_V_lt = $(am__v_lt_@AM_V@)\nam__v_lt_ = $(am__v_lt_@AM_DEFAULT_V@)\nam__v_lt_0 = --silent\nam__v_lt_1 = \ncompact16_acceptor_fst_la_LINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX \\\n\t$(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=link $(CXXLD) \\\n\t$(AM_CXXFLAGS) $(CXXFLAGS) \\\n\t$(compact16_acceptor_fst_la_LDFLAGS) $(LDFLAGS) -o $@\ncompact16_string_fst_la_LIBADD =\nam_compact16_string_fst_la_OBJECTS = compact16_string-fst.lo\ncompact16_string_fst_la_OBJECTS =  \\\n\t$(am_compact16_string_fst_la_OBJECTS)\ncompact16_string_fst_la_LINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX \\\n\t$(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=link $(CXXLD) \\\n\t$(AM_CXXFLAGS) $(CXXFLAGS) $(compact16_string_fst_la_LDFLAGS) \\\n\t$(LDFLAGS) -o $@\ncompact16_unweighted_fst_la_LIBADD =\nam_compact16_unweighted_fst_la_OBJECTS = compact16_unweighted-fst.lo\ncompact16_unweighted_fst_la_OBJECTS =  \\\n\t$(am_compact16_unweighted_fst_la_OBJECTS)\ncompact16_unweighted_fst_la_LINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX \\\n\t$(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=link $(CXXLD) \\\n\t$(AM_CXXFLAGS) $(CXXFLAGS) \\\n\t$(compact16_unweighted_fst_la_LDFLAGS) $(LDFLAGS) -o $@\ncompact16_unweighted_acceptor_fst_la_LIBADD =\nam_compact16_unweighted_acceptor_fst_la_OBJECTS =  \\\n\tcompact16_unweighted_acceptor-fst.lo\ncompact16_unweighted_acceptor_fst_la_OBJECTS =  \\\n\t$(am_compact16_unweighted_acceptor_fst_la_OBJECTS)\ncompact16_unweighted_acceptor_fst_la_LINK = $(LIBTOOL) $(AM_V_lt) \\\n\t--tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=link \\\n\t$(CXXLD) $(AM_CXXFLAGS) $(CXXFLAGS) \\\n\t$(compact16_unweighted_acceptor_fst_la_LDFLAGS) $(LDFLAGS) -o \\\n\t$@\ncompact16_weighted_string_fst_la_LIBADD =\nam_compact16_weighted_string_fst_la_OBJECTS =  \\\n\tcompact16_weighted_string-fst.lo\ncompact16_weighted_string_fst_la_OBJECTS =  \\\n\t$(am_compact16_weighted_string_fst_la_OBJECTS)\ncompact16_weighted_string_fst_la_LINK = $(LIBTOOL) $(AM_V_lt) \\\n\t--tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=link \\\n\t$(CXXLD) $(AM_CXXFLAGS) $(CXXFLAGS) \\\n\t$(compact16_weighted_string_fst_la_LDFLAGS) $(LDFLAGS) -o $@\ncompact64_acceptor_fst_la_LIBADD =\nam_compact64_acceptor_fst_la_OBJECTS = compact64_acceptor-fst.lo\ncompact64_acceptor_fst_la_OBJECTS =  \\\n\t$(am_compact64_acceptor_fst_la_OBJECTS)\ncompact64_acceptor_fst_la_LINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX \\\n\t$(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=link $(CXXLD) \\\n\t$(AM_CXXFLAGS) $(CXXFLAGS) \\\n\t$(compact64_acceptor_fst_la_LDFLAGS) $(LDFLAGS) -o $@\ncompact64_string_fst_la_LIBADD =\nam_compact64_string_fst_la_OBJECTS = compact64_string-fst.lo\ncompact64_string_fst_la_OBJECTS =  \\\n\t$(am_compact64_string_fst_la_OBJECTS)\ncompact64_string_fst_la_LINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX \\\n\t$(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=link $(CXXLD) \\\n\t$(AM_CXXFLAGS) $(CXXFLAGS) $(compact64_string_fst_la_LDFLAGS) \\\n\t$(LDFLAGS) -o $@\ncompact64_unweighted_fst_la_LIBADD =\nam_compact64_unweighted_fst_la_OBJECTS = compact64_unweighted-fst.lo\ncompact64_unweighted_fst_la_OBJECTS =  \\\n\t$(am_compact64_unweighted_fst_la_OBJECTS)\ncompact64_unweighted_fst_la_LINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX \\\n\t$(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=link $(CXXLD) \\\n\t$(AM_CXXFLAGS) $(CXXFLAGS) \\\n\t$(compact64_unweighted_fst_la_LDFLAGS) $(LDFLAGS) -o $@\ncompact64_unweighted_acceptor_fst_la_LIBADD =\nam_compact64_unweighted_acceptor_fst_la_OBJECTS =  \\\n\tcompact64_unweighted_acceptor-fst.lo\ncompact64_unweighted_acceptor_fst_la_OBJECTS =  \\\n\t$(am_compact64_unweighted_acceptor_fst_la_OBJECTS)\ncompact64_unweighted_acceptor_fst_la_LINK = $(LIBTOOL) $(AM_V_lt) \\\n\t--tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=link \\\n\t$(CXXLD) $(AM_CXXFLAGS) $(CXXFLAGS) \\\n\t$(compact64_unweighted_acceptor_fst_la_LDFLAGS) $(LDFLAGS) -o \\\n\t$@\ncompact64_weighted_string_fst_la_LIBADD =\nam_compact64_weighted_string_fst_la_OBJECTS =  \\\n\tcompact64_weighted_string-fst.lo\ncompact64_weighted_string_fst_la_OBJECTS =  \\\n\t$(am_compact64_weighted_string_fst_la_OBJECTS)\ncompact64_weighted_string_fst_la_LINK = $(LIBTOOL) $(AM_V_lt) \\\n\t--tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=link \\\n\t$(CXXLD) $(AM_CXXFLAGS) $(CXXFLAGS) \\\n\t$(compact64_weighted_string_fst_la_LDFLAGS) $(LDFLAGS) -o $@\ncompact8_acceptor_fst_la_LIBADD =\nam_compact8_acceptor_fst_la_OBJECTS = compact8_acceptor-fst.lo\ncompact8_acceptor_fst_la_OBJECTS =  \\\n\t$(am_compact8_acceptor_fst_la_OBJECTS)\ncompact8_acceptor_fst_la_LINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX \\\n\t$(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=link $(CXXLD) \\\n\t$(AM_CXXFLAGS) $(CXXFLAGS) $(compact8_acceptor_fst_la_LDFLAGS) \\\n\t$(LDFLAGS) -o $@\ncompact8_string_fst_la_LIBADD =\nam_compact8_string_fst_la_OBJECTS = compact8_string-fst.lo\ncompact8_string_fst_la_OBJECTS = $(am_compact8_string_fst_la_OBJECTS)\ncompact8_string_fst_la_LINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX \\\n\t$(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=link $(CXXLD) \\\n\t$(AM_CXXFLAGS) $(CXXFLAGS) $(compact8_string_fst_la_LDFLAGS) \\\n\t$(LDFLAGS) -o $@\ncompact8_unweighted_fst_la_LIBADD =\nam_compact8_unweighted_fst_la_OBJECTS = compact8_unweighted-fst.lo\ncompact8_unweighted_fst_la_OBJECTS =  \\\n\t$(am_compact8_unweighted_fst_la_OBJECTS)\ncompact8_unweighted_fst_la_LINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX \\\n\t$(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=link $(CXXLD) \\\n\t$(AM_CXXFLAGS) $(CXXFLAGS) \\\n\t$(compact8_unweighted_fst_la_LDFLAGS) $(LDFLAGS) -o $@\ncompact8_unweighted_acceptor_fst_la_LIBADD =\nam_compact8_unweighted_acceptor_fst_la_OBJECTS =  \\\n\tcompact8_unweighted_acceptor-fst.lo\ncompact8_unweighted_acceptor_fst_la_OBJECTS =  \\\n\t$(am_compact8_unweighted_acceptor_fst_la_OBJECTS)\ncompact8_unweighted_acceptor_fst_la_LINK = $(LIBTOOL) $(AM_V_lt) \\\n\t--tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=link \\\n\t$(CXXLD) $(AM_CXXFLAGS) $(CXXFLAGS) \\\n\t$(compact8_unweighted_acceptor_fst_la_LDFLAGS) $(LDFLAGS) -o \\\n\t$@\ncompact8_weighted_string_fst_la_LIBADD =\nam_compact8_weighted_string_fst_la_OBJECTS =  \\\n\tcompact8_weighted_string-fst.lo\ncompact8_weighted_string_fst_la_OBJECTS =  \\\n\t$(am_compact8_weighted_string_fst_la_OBJECTS)\ncompact8_weighted_string_fst_la_LINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX \\\n\t$(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=link $(CXXLD) \\\n\t$(AM_CXXFLAGS) $(CXXFLAGS) \\\n\t$(compact8_weighted_string_fst_la_LDFLAGS) $(LDFLAGS) -o $@\nam__DEPENDENCIES_1 =\nlibfstcompact_la_DEPENDENCIES = ../../lib/libfst.la \\\n\t$(am__DEPENDENCIES_1)\nam_libfstcompact_la_OBJECTS = compact8_acceptor-fst.lo \\\n\tcompact8_string-fst.lo compact8_unweighted-fst.lo \\\n\tcompact8_unweighted_acceptor-fst.lo \\\n\tcompact8_weighted_string-fst.lo compact16_acceptor-fst.lo \\\n\tcompact16_string-fst.lo compact16_unweighted-fst.lo \\\n\tcompact16_unweighted_acceptor-fst.lo \\\n\tcompact16_weighted_string-fst.lo compact64_acceptor-fst.lo \\\n\tcompact64_string-fst.lo compact64_unweighted-fst.lo \\\n\tcompact64_unweighted_acceptor-fst.lo \\\n\tcompact64_weighted_string-fst.lo\nlibfstcompact_la_OBJECTS = $(am_libfstcompact_la_OBJECTS)\nlibfstcompact_la_LINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX \\\n\t$(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=link $(CXXLD) \\\n\t$(AM_CXXFLAGS) $(CXXFLAGS) $(libfstcompact_la_LDFLAGS) \\\n\t$(LDFLAGS) -o $@\nAM_V_P = $(am__v_P_@AM_V@)\nam__v_P_ = $(am__v_P_@AM_DEFAULT_V@)\nam__v_P_0 = false\nam__v_P_1 = :\nAM_V_GEN = $(am__v_GEN_@AM_V@)\nam__v_GEN_ = $(am__v_GEN_@AM_DEFAULT_V@)\nam__v_GEN_0 = @echo \"  GEN     \" $@;\nam__v_GEN_1 = \nAM_V_at = $(am__v_at_@AM_V@)\nam__v_at_ = $(am__v_at_@AM_DEFAULT_V@)\nam__v_at_0 = @\nam__v_at_1 = \nDEFAULT_INCLUDES = \ndepcomp = $(SHELL) $(top_srcdir)/depcomp\nam__depfiles_maybe = depfiles\nam__mv = mv -f\nCXXCOMPILE = $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) \\\n\t$(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS)\nLTCXXCOMPILE = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \\\n\t$(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) \\\n\t$(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) \\\n\t$(AM_CXXFLAGS) $(CXXFLAGS)\nAM_V_CXX = $(am__v_CXX_@AM_V@)\nam__v_CXX_ = $(am__v_CXX_@AM_DEFAULT_V@)\nam__v_CXX_0 = @echo \"  CXX     \" $@;\nam__v_CXX_1 = \nCXXLD = $(CXX)\nCXXLINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \\\n\t$(LIBTOOLFLAGS) --mode=link $(CXXLD) $(AM_CXXFLAGS) \\\n\t$(CXXFLAGS) $(AM_LDFLAGS) $(LDFLAGS) -o $@\nAM_V_CXXLD = $(am__v_CXXLD_@AM_V@)\nam__v_CXXLD_ = $(am__v_CXXLD_@AM_DEFAULT_V@)\nam__v_CXXLD_0 = @echo \"  CXXLD   \" $@;\nam__v_CXXLD_1 = \nSOURCES = $(compact16_acceptor_fst_la_SOURCES) \\\n\t$(compact16_string_fst_la_SOURCES) \\\n\t$(compact16_unweighted_fst_la_SOURCES) \\\n\t$(compact16_unweighted_acceptor_fst_la_SOURCES) \\\n\t$(compact16_weighted_string_fst_la_SOURCES) \\\n\t$(compact64_acceptor_fst_la_SOURCES) \\\n\t$(compact64_string_fst_la_SOURCES) \\\n\t$(compact64_unweighted_fst_la_SOURCES) \\\n\t$(compact64_unweighted_acceptor_fst_la_SOURCES) \\\n\t$(compact64_weighted_string_fst_la_SOURCES) \\\n\t$(compact8_acceptor_fst_la_SOURCES) \\\n\t$(compact8_string_fst_la_SOURCES) \\\n\t$(compact8_unweighted_fst_la_SOURCES) \\\n\t$(compact8_unweighted_acceptor_fst_la_SOURCES) \\\n\t$(compact8_weighted_string_fst_la_SOURCES) \\\n\t$(libfstcompact_la_SOURCES)\nDIST_SOURCES = $(compact16_acceptor_fst_la_SOURCES) \\\n\t$(compact16_string_fst_la_SOURCES) \\\n\t$(compact16_unweighted_fst_la_SOURCES) \\\n\t$(compact16_unweighted_acceptor_fst_la_SOURCES) \\\n\t$(compact16_weighted_string_fst_la_SOURCES) \\\n\t$(compact64_acceptor_fst_la_SOURCES) \\\n\t$(compact64_string_fst_la_SOURCES) \\\n\t$(compact64_unweighted_fst_la_SOURCES) \\\n\t$(compact64_unweighted_acceptor_fst_la_SOURCES) \\\n\t$(compact64_weighted_string_fst_la_SOURCES) \\\n\t$(compact8_acceptor_fst_la_SOURCES) \\\n\t$(compact8_string_fst_la_SOURCES) \\\n\t$(compact8_unweighted_fst_la_SOURCES) \\\n\t$(compact8_unweighted_acceptor_fst_la_SOURCES) \\\n\t$(compact8_weighted_string_fst_la_SOURCES) \\\n\t$(libfstcompact_la_SOURCES)\nam__can_run_installinfo = \\\n  case $$AM_UPDATE_INFO_DIR in \\\n    n|no|NO) false;; \\\n    *) (install-info --version) >/dev/null 2>&1;; \\\n  esac\nam__tagged_files = $(HEADERS) $(SOURCES) $(TAGS_FILES) $(LISP)\n# Read a list of newline-separated strings from the standard input,\n# and print each of them once, without duplicates.  Input order is\n# *not* preserved.\nam__uniquify_input = $(AWK) '\\\n  BEGIN { nonempty = 0; } \\\n  { items[$$0] = 1; nonempty = 1; } \\\n  END { if (nonempty) { for (i in items) print i; }; } \\\n'\n# Make sure the list of sources is unique.  This is necessary because,\n# e.g., the same source file might be shared among _SOURCES variables\n# for different programs/libraries.\nam__define_uniq_tagged_files = \\\n  list='$(am__tagged_files)'; \\\n  unique=`for i in $$list; do \\\n    if test -f \"$$i\"; then echo $$i; else echo $(srcdir)/$$i; fi; \\\n  done | $(am__uniquify_input)`\nETAGS = etags\nCTAGS = ctags\nam__DIST_COMMON = $(srcdir)/Makefile.in $(top_srcdir)/depcomp\nDISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST)\nACLOCAL = @ACLOCAL@\nAMTAR = @AMTAR@\nAM_DEFAULT_VERBOSITY = @AM_DEFAULT_VERBOSITY@\nAR = @AR@\nAUTOCONF = @AUTOCONF@\nAUTOHEADER = @AUTOHEADER@\nAUTOMAKE = @AUTOMAKE@\nAWK = @AWK@\nCC = @CC@\nCCDEPMODE = @CCDEPMODE@\nCFLAGS = @CFLAGS@\nCPP = @CPP@\nCPPFLAGS = @CPPFLAGS@\nCXX = @CXX@\nCXXCPP = @CXXCPP@\nCXXDEPMODE = @CXXDEPMODE@\nCXXFLAGS = @CXXFLAGS@\nCYGPATH_W = @CYGPATH_W@\nDEFS = @DEFS@\nDEPDIR = @DEPDIR@\nDLLTOOL = @DLLTOOL@\nDL_LIBS = @DL_LIBS@\nDSYMUTIL = @DSYMUTIL@\nDUMPBIN = @DUMPBIN@\nECHO_C = @ECHO_C@\nECHO_N = @ECHO_N@\nECHO_T = @ECHO_T@\nEGREP = @EGREP@\nEXEEXT = @EXEEXT@\nFGREP = @FGREP@\nGREP = @GREP@\nINSTALL = @INSTALL@\nINSTALL_DATA = @INSTALL_DATA@\nINSTALL_PROGRAM = @INSTALL_PROGRAM@\nINSTALL_SCRIPT = @INSTALL_SCRIPT@\nINSTALL_STRIP_PROGRAM = @INSTALL_STRIP_PROGRAM@\nLD = @LD@\nLDFLAGS = @LDFLAGS@\nLIBOBJS = @LIBOBJS@\nLIBS = @LIBS@\nLIBTOOL = @LIBTOOL@\nLIPO = @LIPO@\nLN_S = @LN_S@\nLTLIBOBJS = @LTLIBOBJS@\nLT_SYS_LIBRARY_PATH = @LT_SYS_LIBRARY_PATH@\nMAKEINFO = @MAKEINFO@\nMANIFEST_TOOL = @MANIFEST_TOOL@\nMKDIR_P = @MKDIR_P@\nNM = @NM@\nNMEDIT = @NMEDIT@\nOBJDUMP = @OBJDUMP@\nOBJEXT = @OBJEXT@\nOTOOL = @OTOOL@\nOTOOL64 = @OTOOL64@\nPACKAGE = @PACKAGE@\nPACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@\nPACKAGE_NAME = @PACKAGE_NAME@\nPACKAGE_STRING = @PACKAGE_STRING@\nPACKAGE_TARNAME = @PACKAGE_TARNAME@\nPACKAGE_URL = @PACKAGE_URL@\nPACKAGE_VERSION = @PACKAGE_VERSION@\nPATH_SEPARATOR = @PATH_SEPARATOR@\nPYTHON = @PYTHON@\nPYTHON_CPPFLAGS = @PYTHON_CPPFLAGS@\nPYTHON_EXEC_PREFIX = @PYTHON_EXEC_PREFIX@\nPYTHON_EXTRA_LDFLAGS = @PYTHON_EXTRA_LDFLAGS@\nPYTHON_EXTRA_LIBS = @PYTHON_EXTRA_LIBS@\nPYTHON_LDFLAGS = @PYTHON_LDFLAGS@\nPYTHON_PLATFORM = @PYTHON_PLATFORM@\nPYTHON_PREFIX = @PYTHON_PREFIX@\nPYTHON_SITE_PKG = @PYTHON_SITE_PKG@\nPYTHON_VERSION = @PYTHON_VERSION@\nRANLIB = @RANLIB@\nSED = @SED@\nSET_MAKE = @SET_MAKE@\nSHELL = @SHELL@\nSTRIP = @STRIP@\nVERSION = @VERSION@\nabs_builddir = @abs_builddir@\nabs_srcdir = @abs_srcdir@\nabs_top_builddir = @abs_top_builddir@\nabs_top_srcdir = @abs_top_srcdir@\nac_ct_AR = @ac_ct_AR@\nac_ct_CC = @ac_ct_CC@\nac_ct_CXX = @ac_ct_CXX@\nac_ct_DUMPBIN = @ac_ct_DUMPBIN@\nam__include = @am__include@\nam__leading_dot = @am__leading_dot@\nam__quote = @am__quote@\nam__tar = @am__tar@\nam__untar = @am__untar@\nbindir = @bindir@\nbuild = @build@\nbuild_alias = @build_alias@\nbuild_cpu = @build_cpu@\nbuild_os = @build_os@\nbuild_vendor = @build_vendor@\nbuilddir = @builddir@\ndatadir = @datadir@\ndatarootdir = @datarootdir@\ndocdir = @docdir@\ndvidir = @dvidir@\nexec_prefix = @exec_prefix@\nhost = @host@\nhost_alias = @host_alias@\nhost_cpu = @host_cpu@\nhost_os = @host_os@\nhost_vendor = @host_vendor@\nhtmldir = @htmldir@\nincludedir = @includedir@\ninfodir = @infodir@\ninstall_sh = @install_sh@\nlibdir = @libdir@\nlibexecdir = @libexecdir@\nlibfstdir = @libfstdir@\nlocaledir = @localedir@\nlocalstatedir = @localstatedir@\nmandir = @mandir@\nmkdir_p = @mkdir_p@\noldincludedir = @oldincludedir@\npdfdir = @pdfdir@\npkgpyexecdir = @pkgpyexecdir@\npkgpythondir = @pkgpythondir@\nprefix = @prefix@\nprogram_transform_name = @program_transform_name@\npsdir = @psdir@\npyexecdir = @pyexecdir@\npythondir = @pythondir@\nrunstatedir = @runstatedir@\nsbindir = @sbindir@\nsharedstatedir = @sharedstatedir@\nsrcdir = @srcdir@\nsysconfdir = @sysconfdir@\ntarget_alias = @target_alias@\ntop_build_prefix = @top_build_prefix@\ntop_builddir = @top_builddir@\ntop_srcdir = @top_srcdir@\nAM_CPPFLAGS = -I$(srcdir)/../../include $(ICU_CPPFLAGS)\nlibfst_LTLIBRARIES = compact8_acceptor-fst.la compact8_string-fst.la compact8_unweighted-fst.la compact8_unweighted_acceptor-fst.la compact8_weighted_string-fst.la compact16_acceptor-fst.la compact16_string-fst.la compact16_unweighted-fst.la compact16_unweighted_acceptor-fst.la compact16_weighted_string-fst.la compact64_acceptor-fst.la compact64_string-fst.la compact64_unweighted-fst.la compact64_unweighted_acceptor-fst.la compact64_weighted_string-fst.la\nlib_LTLIBRARIES = libfstcompact.la\nlibfstcompact_la_SOURCES = compact8_acceptor-fst.cc compact8_string-fst.cc compact8_unweighted-fst.cc compact8_unweighted_acceptor-fst.cc compact8_weighted_string-fst.cc compact16_acceptor-fst.cc compact16_string-fst.cc compact16_unweighted-fst.cc compact16_unweighted_acceptor-fst.cc compact16_weighted_string-fst.cc compact64_acceptor-fst.cc compact64_string-fst.cc compact64_unweighted-fst.cc compact64_unweighted_acceptor-fst.cc compact64_weighted_string-fst.cc\nlibfstcompact_la_LDFLAGS = -version-info 13:0:0\nlibfstcompact_la_LIBADD = ../../lib/libfst.la -lm $(DL_LIBS)\ncompact8_acceptor_fst_la_SOURCES = compact8_acceptor-fst.cc\ncompact8_acceptor_fst_la_LDFLAGS = -module\ncompact8_string_fst_la_SOURCES = compact8_string-fst.cc\ncompact8_string_fst_la_LDFLAGS = -module\ncompact8_unweighted_fst_la_SOURCES = compact8_unweighted-fst.cc\ncompact8_unweighted_fst_la_LDFLAGS = -module\ncompact8_unweighted_acceptor_fst_la_SOURCES = compact8_unweighted_acceptor-fst.cc\ncompact8_unweighted_acceptor_fst_la_LDFLAGS = -module\ncompact8_weighted_string_fst_la_SOURCES = compact8_weighted_string-fst.cc\ncompact8_weighted_string_fst_la_LDFLAGS = -module\ncompact16_acceptor_fst_la_SOURCES = compact16_acceptor-fst.cc\ncompact16_acceptor_fst_la_LDFLAGS = -module\ncompact16_string_fst_la_SOURCES = compact16_string-fst.cc\ncompact16_string_fst_la_LDFLAGS = -module\ncompact16_unweighted_fst_la_SOURCES = compact16_unweighted-fst.cc\ncompact16_unweighted_fst_la_LDFLAGS = -module\ncompact16_unweighted_acceptor_fst_la_SOURCES = compact16_unweighted_acceptor-fst.cc\ncompact16_unweighted_acceptor_fst_la_LDFLAGS = -module\ncompact16_weighted_string_fst_la_SOURCES = compact16_weighted_string-fst.cc\ncompact16_weighted_string_fst_la_LDFLAGS = -module\ncompact64_acceptor_fst_la_SOURCES = compact64_acceptor-fst.cc\ncompact64_acceptor_fst_la_LDFLAGS = -module\ncompact64_string_fst_la_SOURCES = compact64_string-fst.cc\ncompact64_string_fst_la_LDFLAGS = -module\ncompact64_unweighted_fst_la_SOURCES = compact64_unweighted-fst.cc\ncompact64_unweighted_fst_la_LDFLAGS = -module\ncompact64_unweighted_acceptor_fst_la_SOURCES = compact64_unweighted_acceptor-fst.cc\ncompact64_unweighted_acceptor_fst_la_LDFLAGS = -module\ncompact64_weighted_string_fst_la_SOURCES = compact64_weighted_string-fst.cc\ncompact64_weighted_string_fst_la_LDFLAGS = -module\nall: all-am\n\n.SUFFIXES:\n.SUFFIXES: .cc .lo .o .obj\n$(srcdir)/Makefile.in:  $(srcdir)/Makefile.am  $(am__configure_deps)\n\t@for dep in $?; do \\\n\t  case '$(am__configure_deps)' in \\\n\t    *$$dep*) \\\n\t      ( cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh ) \\\n\t        && { if test -f $@; then exit 0; else break; fi; }; \\\n\t      exit 1;; \\\n\t  esac; \\\n\tdone; \\\n\techo ' cd $(top_srcdir) && $(AUTOMAKE) --foreign src/extensions/compact/Makefile'; \\\n\t$(am__cd) $(top_srcdir) && \\\n\t  $(AUTOMAKE) --foreign src/extensions/compact/Makefile\nMakefile: $(srcdir)/Makefile.in $(top_builddir)/config.status\n\t@case '$?' in \\\n\t  *config.status*) \\\n\t    cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh;; \\\n\t  *) \\\n\t    echo ' cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe)'; \\\n\t    cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe);; \\\n\tesac;\n\n$(top_builddir)/config.status: $(top_srcdir)/configure $(CONFIG_STATUS_DEPENDENCIES)\n\tcd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh\n\n$(top_srcdir)/configure:  $(am__configure_deps)\n\tcd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh\n$(ACLOCAL_M4):  $(am__aclocal_m4_deps)\n\tcd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh\n$(am__aclocal_m4_deps):\n\ninstall-libLTLIBRARIES: $(lib_LTLIBRARIES)\n\t@$(NORMAL_INSTALL)\n\t@list='$(lib_LTLIBRARIES)'; test -n \"$(libdir)\" || list=; \\\n\tlist2=; for p in $$list; do \\\n\t  if test -f $$p; then \\\n\t    list2=\"$$list2 $$p\"; \\\n\t  else :; fi; \\\n\tdone; \\\n\ttest -z \"$$list2\" || { \\\n\t  echo \" $(MKDIR_P) '$(DESTDIR)$(libdir)'\"; \\\n\t  $(MKDIR_P) \"$(DESTDIR)$(libdir)\" || exit 1; \\\n\t  echo \" $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) $$list2 '$(DESTDIR)$(libdir)'\"; \\\n\t  $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) $$list2 \"$(DESTDIR)$(libdir)\"; \\\n\t}\n\nuninstall-libLTLIBRARIES:\n\t@$(NORMAL_UNINSTALL)\n\t@list='$(lib_LTLIBRARIES)'; test -n \"$(libdir)\" || list=; \\\n\tfor p in $$list; do \\\n\t  $(am__strip_dir) \\\n\t  echo \" $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=uninstall rm -f '$(DESTDIR)$(libdir)/$$f'\"; \\\n\t  $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=uninstall rm -f \"$(DESTDIR)$(libdir)/$$f\"; \\\n\tdone\n\nclean-libLTLIBRARIES:\n\t-test -z \"$(lib_LTLIBRARIES)\" || rm -f $(lib_LTLIBRARIES)\n\t@list='$(lib_LTLIBRARIES)'; \\\n\tlocs=`for p in $$list; do echo $$p; done | \\\n\t      sed 's|^[^/]*$$|.|; s|/[^/]*$$||; s|$$|/so_locations|' | \\\n\t      sort -u`; \\\n\ttest -z \"$$locs\" || { \\\n\t  echo rm -f $${locs}; \\\n\t  rm -f $${locs}; \\\n\t}\n\ninstall-libfstLTLIBRARIES: $(libfst_LTLIBRARIES)\n\t@$(NORMAL_INSTALL)\n\t@list='$(libfst_LTLIBRARIES)'; test -n \"$(libfstdir)\" || list=; \\\n\tlist2=; for p in $$list; do \\\n\t  if test -f $$p; then \\\n\t    list2=\"$$list2 $$p\"; \\\n\t  else :; fi; \\\n\tdone; \\\n\ttest -z \"$$list2\" || { \\\n\t  echo \" $(MKDIR_P) '$(DESTDIR)$(libfstdir)'\"; \\\n\t  $(MKDIR_P) \"$(DESTDIR)$(libfstdir)\" || exit 1; \\\n\t  echo \" $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) $$list2 '$(DESTDIR)$(libfstdir)'\"; \\\n\t  $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) $$list2 \"$(DESTDIR)$(libfstdir)\"; \\\n\t}\n\nuninstall-libfstLTLIBRARIES:\n\t@$(NORMAL_UNINSTALL)\n\t@list='$(libfst_LTLIBRARIES)'; test -n \"$(libfstdir)\" || list=; \\\n\tfor p in $$list; do \\\n\t  $(am__strip_dir) \\\n\t  echo \" $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=uninstall rm -f '$(DESTDIR)$(libfstdir)/$$f'\"; \\\n\t  $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=uninstall rm -f \"$(DESTDIR)$(libfstdir)/$$f\"; \\\n\tdone\n\nclean-libfstLTLIBRARIES:\n\t-test -z \"$(libfst_LTLIBRARIES)\" || rm -f $(libfst_LTLIBRARIES)\n\t@list='$(libfst_LTLIBRARIES)'; \\\n\tlocs=`for p in $$list; do echo $$p; done | \\\n\t      sed 's|^[^/]*$$|.|; s|/[^/]*$$||; s|$$|/so_locations|' | \\\n\t      sort -u`; \\\n\ttest -z \"$$locs\" || { \\\n\t  echo rm -f $${locs}; \\\n\t  rm -f $${locs}; \\\n\t}\n\ncompact16_acceptor-fst.la: $(compact16_acceptor_fst_la_OBJECTS) $(compact16_acceptor_fst_la_DEPENDENCIES) $(EXTRA_compact16_acceptor_fst_la_DEPENDENCIES) \n\t$(AM_V_CXXLD)$(compact16_acceptor_fst_la_LINK) -rpath $(libfstdir) $(compact16_acceptor_fst_la_OBJECTS) $(compact16_acceptor_fst_la_LIBADD) $(LIBS)\n\ncompact16_string-fst.la: $(compact16_string_fst_la_OBJECTS) $(compact16_string_fst_la_DEPENDENCIES) $(EXTRA_compact16_string_fst_la_DEPENDENCIES) \n\t$(AM_V_CXXLD)$(compact16_string_fst_la_LINK) -rpath $(libfstdir) $(compact16_string_fst_la_OBJECTS) $(compact16_string_fst_la_LIBADD) $(LIBS)\n\ncompact16_unweighted-fst.la: $(compact16_unweighted_fst_la_OBJECTS) $(compact16_unweighted_fst_la_DEPENDENCIES) $(EXTRA_compact16_unweighted_fst_la_DEPENDENCIES) \n\t$(AM_V_CXXLD)$(compact16_unweighted_fst_la_LINK) -rpath $(libfstdir) $(compact16_unweighted_fst_la_OBJECTS) $(compact16_unweighted_fst_la_LIBADD) $(LIBS)\n\ncompact16_unweighted_acceptor-fst.la: $(compact16_unweighted_acceptor_fst_la_OBJECTS) $(compact16_unweighted_acceptor_fst_la_DEPENDENCIES) $(EXTRA_compact16_unweighted_acceptor_fst_la_DEPENDENCIES) \n\t$(AM_V_CXXLD)$(compact16_unweighted_acceptor_fst_la_LINK) -rpath $(libfstdir) $(compact16_unweighted_acceptor_fst_la_OBJECTS) $(compact16_unweighted_acceptor_fst_la_LIBADD) $(LIBS)\n\ncompact16_weighted_string-fst.la: $(compact16_weighted_string_fst_la_OBJECTS) $(compact16_weighted_string_fst_la_DEPENDENCIES) $(EXTRA_compact16_weighted_string_fst_la_DEPENDENCIES) \n\t$(AM_V_CXXLD)$(compact16_weighted_string_fst_la_LINK) -rpath $(libfstdir) $(compact16_weighted_string_fst_la_OBJECTS) $(compact16_weighted_string_fst_la_LIBADD) $(LIBS)\n\ncompact64_acceptor-fst.la: $(compact64_acceptor_fst_la_OBJECTS) $(compact64_acceptor_fst_la_DEPENDENCIES) $(EXTRA_compact64_acceptor_fst_la_DEPENDENCIES) \n\t$(AM_V_CXXLD)$(compact64_acceptor_fst_la_LINK) -rpath $(libfstdir) $(compact64_acceptor_fst_la_OBJECTS) $(compact64_acceptor_fst_la_LIBADD) $(LIBS)\n\ncompact64_string-fst.la: $(compact64_string_fst_la_OBJECTS) $(compact64_string_fst_la_DEPENDENCIES) $(EXTRA_compact64_string_fst_la_DEPENDENCIES) \n\t$(AM_V_CXXLD)$(compact64_string_fst_la_LINK) -rpath $(libfstdir) $(compact64_string_fst_la_OBJECTS) $(compact64_string_fst_la_LIBADD) $(LIBS)\n\ncompact64_unweighted-fst.la: $(compact64_unweighted_fst_la_OBJECTS) $(compact64_unweighted_fst_la_DEPENDENCIES) $(EXTRA_compact64_unweighted_fst_la_DEPENDENCIES) \n\t$(AM_V_CXXLD)$(compact64_unweighted_fst_la_LINK) -rpath $(libfstdir) $(compact64_unweighted_fst_la_OBJECTS) $(compact64_unweighted_fst_la_LIBADD) $(LIBS)\n\ncompact64_unweighted_acceptor-fst.la: $(compact64_unweighted_acceptor_fst_la_OBJECTS) $(compact64_unweighted_acceptor_fst_la_DEPENDENCIES) $(EXTRA_compact64_unweighted_acceptor_fst_la_DEPENDENCIES) \n\t$(AM_V_CXXLD)$(compact64_unweighted_acceptor_fst_la_LINK) -rpath $(libfstdir) $(compact64_unweighted_acceptor_fst_la_OBJECTS) $(compact64_unweighted_acceptor_fst_la_LIBADD) $(LIBS)\n\ncompact64_weighted_string-fst.la: $(compact64_weighted_string_fst_la_OBJECTS) $(compact64_weighted_string_fst_la_DEPENDENCIES) $(EXTRA_compact64_weighted_string_fst_la_DEPENDENCIES) \n\t$(AM_V_CXXLD)$(compact64_weighted_string_fst_la_LINK) -rpath $(libfstdir) $(compact64_weighted_string_fst_la_OBJECTS) $(compact64_weighted_string_fst_la_LIBADD) $(LIBS)\n\ncompact8_acceptor-fst.la: $(compact8_acceptor_fst_la_OBJECTS) $(compact8_acceptor_fst_la_DEPENDENCIES) $(EXTRA_compact8_acceptor_fst_la_DEPENDENCIES) \n\t$(AM_V_CXXLD)$(compact8_acceptor_fst_la_LINK) -rpath $(libfstdir) $(compact8_acceptor_fst_la_OBJECTS) $(compact8_acceptor_fst_la_LIBADD) $(LIBS)\n\ncompact8_string-fst.la: $(compact8_string_fst_la_OBJECTS) $(compact8_string_fst_la_DEPENDENCIES) $(EXTRA_compact8_string_fst_la_DEPENDENCIES) \n\t$(AM_V_CXXLD)$(compact8_string_fst_la_LINK) -rpath $(libfstdir) $(compact8_string_fst_la_OBJECTS) $(compact8_string_fst_la_LIBADD) $(LIBS)\n\ncompact8_unweighted-fst.la: $(compact8_unweighted_fst_la_OBJECTS) $(compact8_unweighted_fst_la_DEPENDENCIES) $(EXTRA_compact8_unweighted_fst_la_DEPENDENCIES) \n\t$(AM_V_CXXLD)$(compact8_unweighted_fst_la_LINK) -rpath $(libfstdir) $(compact8_unweighted_fst_la_OBJECTS) $(compact8_unweighted_fst_la_LIBADD) $(LIBS)\n\ncompact8_unweighted_acceptor-fst.la: $(compact8_unweighted_acceptor_fst_la_OBJECTS) $(compact8_unweighted_acceptor_fst_la_DEPENDENCIES) $(EXTRA_compact8_unweighted_acceptor_fst_la_DEPENDENCIES) \n\t$(AM_V_CXXLD)$(compact8_unweighted_acceptor_fst_la_LINK) -rpath $(libfstdir) $(compact8_unweighted_acceptor_fst_la_OBJECTS) $(compact8_unweighted_acceptor_fst_la_LIBADD) $(LIBS)\n\ncompact8_weighted_string-fst.la: $(compact8_weighted_string_fst_la_OBJECTS) $(compact8_weighted_string_fst_la_DEPENDENCIES) $(EXTRA_compact8_weighted_string_fst_la_DEPENDENCIES) \n\t$(AM_V_CXXLD)$(compact8_weighted_string_fst_la_LINK) -rpath $(libfstdir) $(compact8_weighted_string_fst_la_OBJECTS) $(compact8_weighted_string_fst_la_LIBADD) $(LIBS)\n\nlibfstcompact.la: $(libfstcompact_la_OBJECTS) $(libfstcompact_la_DEPENDENCIES) $(EXTRA_libfstcompact_la_DEPENDENCIES) \n\t$(AM_V_CXXLD)$(libfstcompact_la_LINK) -rpath $(libdir) $(libfstcompact_la_OBJECTS) $(libfstcompact_la_LIBADD) $(LIBS)\n\nmostlyclean-compile:\n\t-rm -f *.$(OBJEXT)\n\ndistclean-compile:\n\t-rm -f *.tab.c\n\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/compact16_acceptor-fst.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/compact16_string-fst.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/compact16_unweighted-fst.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/compact16_unweighted_acceptor-fst.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/compact16_weighted_string-fst.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/compact64_acceptor-fst.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/compact64_string-fst.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/compact64_unweighted-fst.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/compact64_unweighted_acceptor-fst.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/compact64_weighted_string-fst.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/compact8_acceptor-fst.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/compact8_string-fst.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/compact8_unweighted-fst.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/compact8_unweighted_acceptor-fst.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/compact8_weighted_string-fst.Plo@am__quote@\n\n.cc.o:\n@am__fastdepCXX_TRUE@\t$(AM_V_CXX)depbase=`echo $@ | sed 's|[^/]*$$|$(DEPDIR)/&|;s|\\.o$$||'`;\\\n@am__fastdepCXX_TRUE@\t$(CXXCOMPILE) -MT $@ -MD -MP -MF $$depbase.Tpo -c -o $@ $< &&\\\n@am__fastdepCXX_TRUE@\t$(am__mv) $$depbase.Tpo $$depbase.Po\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\t$(AM_V_CXX)source='$<' object='$@' libtool=no @AMDEPBACKSLASH@\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\tDEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@\n@am__fastdepCXX_FALSE@\t$(AM_V_CXX@am__nodep@)$(CXXCOMPILE) -c -o $@ $<\n\n.cc.obj:\n@am__fastdepCXX_TRUE@\t$(AM_V_CXX)depbase=`echo $@ | sed 's|[^/]*$$|$(DEPDIR)/&|;s|\\.obj$$||'`;\\\n@am__fastdepCXX_TRUE@\t$(CXXCOMPILE) -MT $@ -MD -MP -MF $$depbase.Tpo -c -o $@ `$(CYGPATH_W) '$<'` &&\\\n@am__fastdepCXX_TRUE@\t$(am__mv) $$depbase.Tpo $$depbase.Po\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\t$(AM_V_CXX)source='$<' object='$@' libtool=no @AMDEPBACKSLASH@\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\tDEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@\n@am__fastdepCXX_FALSE@\t$(AM_V_CXX@am__nodep@)$(CXXCOMPILE) -c -o $@ `$(CYGPATH_W) '$<'`\n\n.cc.lo:\n@am__fastdepCXX_TRUE@\t$(AM_V_CXX)depbase=`echo $@ | sed 's|[^/]*$$|$(DEPDIR)/&|;s|\\.lo$$||'`;\\\n@am__fastdepCXX_TRUE@\t$(LTCXXCOMPILE) -MT $@ -MD -MP -MF $$depbase.Tpo -c -o $@ $< &&\\\n@am__fastdepCXX_TRUE@\t$(am__mv) $$depbase.Tpo $$depbase.Plo\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\t$(AM_V_CXX)source='$<' object='$@' libtool=yes @AMDEPBACKSLASH@\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\tDEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@\n@am__fastdepCXX_FALSE@\t$(AM_V_CXX@am__nodep@)$(LTCXXCOMPILE) -c -o $@ $<\n\nmostlyclean-libtool:\n\t-rm -f *.lo\n\nclean-libtool:\n\t-rm -rf .libs _libs\n\nID: $(am__tagged_files)\n\t$(am__define_uniq_tagged_files); mkid -fID $$unique\ntags: tags-am\nTAGS: tags\n\ntags-am: $(TAGS_DEPENDENCIES) $(am__tagged_files)\n\tset x; \\\n\there=`pwd`; \\\n\t$(am__define_uniq_tagged_files); \\\n\tshift; \\\n\tif test -z \"$(ETAGS_ARGS)$$*$$unique\"; then :; else \\\n\t  test -n \"$$unique\" || unique=$$empty_fix; \\\n\t  if test $$# -gt 0; then \\\n\t    $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \\\n\t      \"$$@\" $$unique; \\\n\t  else \\\n\t    $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \\\n\t      $$unique; \\\n\t  fi; \\\n\tfi\nctags: ctags-am\n\nCTAGS: ctags\nctags-am: $(TAGS_DEPENDENCIES) $(am__tagged_files)\n\t$(am__define_uniq_tagged_files); \\\n\ttest -z \"$(CTAGS_ARGS)$$unique\" \\\n\t  || $(CTAGS) $(CTAGSFLAGS) $(AM_CTAGSFLAGS) $(CTAGS_ARGS) \\\n\t     $$unique\n\nGTAGS:\n\there=`$(am__cd) $(top_builddir) && pwd` \\\n\t  && $(am__cd) $(top_srcdir) \\\n\t  && gtags -i $(GTAGS_ARGS) \"$$here\"\ncscopelist: cscopelist-am\n\ncscopelist-am: $(am__tagged_files)\n\tlist='$(am__tagged_files)'; \\\n\tcase \"$(srcdir)\" in \\\n\t  [\\\\/]* | ?:[\\\\/]*) sdir=\"$(srcdir)\" ;; \\\n\t  *) sdir=$(subdir)/$(srcdir) ;; \\\n\tesac; \\\n\tfor i in $$list; do \\\n\t  if test -f \"$$i\"; then \\\n\t    echo \"$(subdir)/$$i\"; \\\n\t  else \\\n\t    echo \"$$sdir/$$i\"; \\\n\t  fi; \\\n\tdone >> $(top_builddir)/cscope.files\n\ndistclean-tags:\n\t-rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags\n\ndistdir: $(DISTFILES)\n\t@srcdirstrip=`echo \"$(srcdir)\" | sed 's/[].[^$$\\\\*]/\\\\\\\\&/g'`; \\\n\ttopsrcdirstrip=`echo \"$(top_srcdir)\" | sed 's/[].[^$$\\\\*]/\\\\\\\\&/g'`; \\\n\tlist='$(DISTFILES)'; \\\n\t  dist_files=`for file in $$list; do echo $$file; done | \\\n\t  sed -e \"s|^$$srcdirstrip/||;t\" \\\n\t      -e \"s|^$$topsrcdirstrip/|$(top_builddir)/|;t\"`; \\\n\tcase $$dist_files in \\\n\t  */*) $(MKDIR_P) `echo \"$$dist_files\" | \\\n\t\t\t   sed '/\\//!d;s|^|$(distdir)/|;s,/[^/]*$$,,' | \\\n\t\t\t   sort -u` ;; \\\n\tesac; \\\n\tfor file in $$dist_files; do \\\n\t  if test -f $$file || test -d $$file; then d=.; else d=$(srcdir); fi; \\\n\t  if test -d $$d/$$file; then \\\n\t    dir=`echo \"/$$file\" | sed -e 's,/[^/]*$$,,'`; \\\n\t    if test -d \"$(distdir)/$$file\"; then \\\n\t      find \"$(distdir)/$$file\" -type d ! -perm -700 -exec chmod u+rwx {} \\;; \\\n\t    fi; \\\n\t    if test -d $(srcdir)/$$file && test $$d != $(srcdir); then \\\n\t      cp -fpR $(srcdir)/$$file \"$(distdir)$$dir\" || exit 1; \\\n\t      find \"$(distdir)/$$file\" -type d ! -perm -700 -exec chmod u+rwx {} \\;; \\\n\t    fi; \\\n\t    cp -fpR $$d/$$file \"$(distdir)$$dir\" || exit 1; \\\n\t  else \\\n\t    test -f \"$(distdir)/$$file\" \\\n\t    || cp -p $$d/$$file \"$(distdir)/$$file\" \\\n\t    || exit 1; \\\n\t  fi; \\\n\tdone\ncheck-am: all-am\ncheck: check-am\nall-am: Makefile $(LTLIBRARIES)\ninstalldirs:\n\tfor dir in \"$(DESTDIR)$(libdir)\" \"$(DESTDIR)$(libfstdir)\"; do \\\n\t  test -z \"$$dir\" || $(MKDIR_P) \"$$dir\"; \\\n\tdone\ninstall: install-am\ninstall-exec: install-exec-am\ninstall-data: install-data-am\nuninstall: uninstall-am\n\ninstall-am: all-am\n\t@$(MAKE) $(AM_MAKEFLAGS) install-exec-am install-data-am\n\ninstallcheck: installcheck-am\ninstall-strip:\n\tif test -z '$(STRIP)'; then \\\n\t  $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" \\\n\t    install_sh_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" INSTALL_STRIP_FLAG=-s \\\n\t      install; \\\n\telse \\\n\t  $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" \\\n\t    install_sh_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" INSTALL_STRIP_FLAG=-s \\\n\t    \"INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'\" install; \\\n\tfi\nmostlyclean-generic:\n\nclean-generic:\n\ndistclean-generic:\n\t-test -z \"$(CONFIG_CLEAN_FILES)\" || rm -f $(CONFIG_CLEAN_FILES)\n\t-test . = \"$(srcdir)\" || test -z \"$(CONFIG_CLEAN_VPATH_FILES)\" || rm -f $(CONFIG_CLEAN_VPATH_FILES)\n\nmaintainer-clean-generic:\n\t@echo \"This command is intended for maintainers to use\"\n\t@echo \"it deletes files that may require special tools to rebuild.\"\nclean: clean-am\n\nclean-am: clean-generic clean-libLTLIBRARIES clean-libfstLTLIBRARIES \\\n\tclean-libtool mostlyclean-am\n\ndistclean: distclean-am\n\t-rm -rf ./$(DEPDIR)\n\t-rm -f Makefile\ndistclean-am: clean-am distclean-compile distclean-generic \\\n\tdistclean-tags\n\ndvi: dvi-am\n\ndvi-am:\n\nhtml: html-am\n\nhtml-am:\n\ninfo: info-am\n\ninfo-am:\n\ninstall-data-am: install-libfstLTLIBRARIES\n\ninstall-dvi: install-dvi-am\n\ninstall-dvi-am:\n\ninstall-exec-am: install-libLTLIBRARIES\n\ninstall-html: install-html-am\n\ninstall-html-am:\n\ninstall-info: install-info-am\n\ninstall-info-am:\n\ninstall-man:\n\ninstall-pdf: install-pdf-am\n\ninstall-pdf-am:\n\ninstall-ps: install-ps-am\n\ninstall-ps-am:\n\ninstallcheck-am:\n\nmaintainer-clean: maintainer-clean-am\n\t-rm -rf ./$(DEPDIR)\n\t-rm -f Makefile\nmaintainer-clean-am: distclean-am maintainer-clean-generic\n\nmostlyclean: mostlyclean-am\n\nmostlyclean-am: mostlyclean-compile mostlyclean-generic \\\n\tmostlyclean-libtool\n\npdf: pdf-am\n\npdf-am:\n\nps: ps-am\n\nps-am:\n\nuninstall-am: uninstall-libLTLIBRARIES uninstall-libfstLTLIBRARIES\n\n.MAKE: install-am install-strip\n\n.PHONY: CTAGS GTAGS TAGS all all-am check check-am clean clean-generic \\\n\tclean-libLTLIBRARIES clean-libfstLTLIBRARIES clean-libtool \\\n\tcscopelist-am ctags ctags-am distclean distclean-compile \\\n\tdistclean-generic distclean-libtool distclean-tags distdir dvi \\\n\tdvi-am html html-am info info-am install install-am \\\n\tinstall-data install-data-am install-dvi install-dvi-am \\\n\tinstall-exec install-exec-am install-html install-html-am \\\n\tinstall-info install-info-am install-libLTLIBRARIES \\\n\tinstall-libfstLTLIBRARIES install-man install-pdf \\\n\tinstall-pdf-am install-ps install-ps-am install-strip \\\n\tinstallcheck installcheck-am installdirs maintainer-clean \\\n\tmaintainer-clean-generic mostlyclean mostlyclean-compile \\\n\tmostlyclean-generic mostlyclean-libtool pdf pdf-am ps ps-am \\\n\ttags tags-am uninstall uninstall-am uninstall-libLTLIBRARIES \\\n\tuninstall-libfstLTLIBRARIES\n\n.PRECIOUS: Makefile\n\n\n# Tell versions [3.59,3.63) of GNU make to not export all variables.\n# Otherwise a system limit (for SysV at least) may be exceeded.\n.NOEXPORT:\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/extensions/compact/compact16_acceptor-fst.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/fst.h>\n#include <fst/compact-fst.h>\n\nnamespace fst {\n\nstatic FstRegisterer<CompactAcceptorFst<StdArc, uint16>>\n    CompactAcceptorFst_StdArc_uint16_registerer;\nstatic FstRegisterer<CompactAcceptorFst<LogArc, uint16>>\n    CompactAcceptorFst_LogArc_uint16_registerer;\n\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/extensions/compact/compact16_string-fst.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/fst.h>\n#include <fst/compact-fst.h>\n\nnamespace fst {\n\nstatic FstRegisterer<CompactStringFst<StdArc, uint16>>\n    CompactStringFst_StdArc_uint16_registerer;\nstatic FstRegisterer<CompactStringFst<LogArc, uint16>>\n    CompactStringFst_LogArc_uint16_registerer;\n\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/extensions/compact/compact16_unweighted-fst.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/fst.h>\n#include <fst/compact-fst.h>\n\nnamespace fst {\n\nstatic FstRegisterer<CompactUnweightedFst<StdArc, uint16>>\n    CompactUnweightedFst_StdArc_uint16_registerer;\nstatic FstRegisterer<CompactUnweightedFst<LogArc, uint16>>\n    CompactUnweightedFst_LogArc_uint16_registerer;\n\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/extensions/compact/compact16_unweighted_acceptor-fst.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/fst.h>\n#include <fst/compact-fst.h>\n\nnamespace fst {\n\nstatic FstRegisterer<\n    CompactUnweightedAcceptorFst<StdArc, uint16>>\n    CompactUnweightedAcceptorFst_StdArc_uint16_registerer;\nstatic FstRegisterer<\n    CompactUnweightedAcceptorFst<LogArc, uint16>>\n    CompactUnweightedAcceptorFst_LogArc_uint16_registerer;\n\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/extensions/compact/compact16_weighted_string-fst.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/fst.h>\n#include <fst/compact-fst.h>\n\nnamespace fst {\n\nstatic FstRegisterer<\n    CompactWeightedStringFst<StdArc, uint16>>\n    CompactWeightedStringFst_StdArc_uint16_registerer;\n\nstatic FstRegisterer<\n    CompactWeightedStringFst<LogArc, uint16>>\n    CompactWeightedStringFst_LogArc_uint16_registerer;\n\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/extensions/compact/compact64_acceptor-fst.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/fst.h>\n#include <fst/compact-fst.h>\n\nnamespace fst {\n\nstatic FstRegisterer<CompactAcceptorFst<StdArc, uint64>>\n    CompactAcceptorFst_StdArc_uint64_registerer;\n\nstatic FstRegisterer<CompactAcceptorFst<LogArc, uint64>>\n    CompactAcceptorFst_LogArc_uint64_registerer;\n\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/extensions/compact/compact64_string-fst.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/fst.h>\n#include <fst/compact-fst.h>\n\nnamespace fst {\n\nstatic FstRegisterer<CompactStringFst<StdArc, uint64>>\n    CompactStringFst_StdArc_uint64_registerer;\nstatic FstRegisterer<CompactStringFst<LogArc, uint64>>\n    CompactStringFst_LogArc_uint64_registerer;\n\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/extensions/compact/compact64_unweighted-fst.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/fst.h>\n#include <fst/compact-fst.h>\n\nnamespace fst {\n\nstatic FstRegisterer<CompactUnweightedFst<StdArc, uint64>>\n    CompactUnweightedFst_StdArc_uint64_registerer;\nstatic FstRegisterer<CompactUnweightedFst<LogArc, uint64>>\n    CompactUnweightedFst_LogArc_uint64_registerer;\n\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/extensions/compact/compact64_unweighted_acceptor-fst.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/fst.h>\n#include <fst/compact-fst.h>\n\nnamespace fst {\n\nstatic FstRegisterer<\n    CompactUnweightedAcceptorFst<StdArc, uint64>>\n    CompactUnweightedAcceptorFst_StdArc_uint64_registerer;\nstatic FstRegisterer<\n    CompactUnweightedAcceptorFst<LogArc, uint64>>\n    CompactUnweightedAcceptorFst_LogArc_uint64_registerer;\n\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/extensions/compact/compact64_weighted_string-fst.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/fst.h>\n#include <fst/compact-fst.h>\n\nnamespace fst {\n\nstatic FstRegisterer<\n    CompactWeightedStringFst<StdArc, uint64>>\n    CompactWeightedStringFst_StdArc_uint64_registerer;\nstatic FstRegisterer<\n    CompactWeightedStringFst<LogArc, uint64>>\n    CompactWeightedStringFst_LogArc_uint64_registerer;\n\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/extensions/compact/compact8_acceptor-fst.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/fst.h>\n#include <fst/compact-fst.h>\n\nnamespace fst {\n\nstatic FstRegisterer<CompactAcceptorFst<StdArc, uint8>>\n    CompactAcceptorFst_StdArc_uint8_registerer;\nstatic FstRegisterer<CompactAcceptorFst<LogArc, uint8>>\n    CompactAcceptorFst_LogArc_uint8_registerer;\n\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/extensions/compact/compact8_string-fst.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/fst.h>\n#include <fst/compact-fst.h>\n\nnamespace fst {\n\nstatic FstRegisterer<CompactStringFst<StdArc, uint8>>\n    CompactStringFst_StdArc_uint8_registerer;\nstatic FstRegisterer<CompactStringFst<LogArc, uint8>>\n    CompactStringFst_LogArc_uint8_registerer;\n\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/extensions/compact/compact8_unweighted-fst.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/fst.h>\n#include <fst/compact-fst.h>\n\nnamespace fst {\n\nstatic FstRegisterer<CompactUnweightedFst<StdArc, uint8>>\n    CompactUnweightedFst_StdArc_uint8_registerer;\nstatic FstRegisterer<CompactUnweightedFst<LogArc, uint8>>\n    CompactUnweightedFst_LogArc_uint8_registerer;\n\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/extensions/compact/compact8_unweighted_acceptor-fst.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/fst.h>\n#include <fst/compact-fst.h>\n\nnamespace fst {\n\nstatic FstRegisterer<\n    CompactUnweightedAcceptorFst<StdArc, uint8>>\n    CompactUnweightedAcceptorFst_StdArc_uint8_registerer;\nstatic FstRegisterer<\n    CompactUnweightedAcceptorFst<LogArc, uint8>>\n    CompactUnweightedAcceptorFst_LogArc_uint8_registerer;\n\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/extensions/compact/compact8_weighted_string-fst.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/fst.h>\n#include <fst/compact-fst.h>\n\nnamespace fst {\n\nstatic FstRegisterer<\n    CompactWeightedStringFst<StdArc, uint8>>\n    CompactWeightedStringFst_StdArc_uint8_registerer;\nstatic FstRegisterer<\n    CompactWeightedStringFst<LogArc, uint8>>\n    CompactWeightedStringFst_LogArc_uint8_registerer;\n\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/extensions/compress/CMakeLists.txt",
    "content": "file(GLOB HEADER_FILES ../../include/fst/extensions/compress/*.h)\nmessage(STATUS \"${HEADER_FILES}\")\n\nadd_library(fstcompressscript\n  compress-script.cc\n  ${HEADER_FILES}\n )\n\ntarget_link_libraries(fstcompressscript \n  fstscript\n  fst\n  ${ZLIBS}\n)\nset_target_properties(fstcompressscript PROPERTIES\n  SOVERSION \"10\"\n)\ninstall(TARGETS fstcompressscript \n  LIBRARY DESTINATION lib\n  ARCHIVE DESTINATION lib\n  RUNTIME DESTINATION lib\n )\n\nif(HAVE_BIN)\n  add_executable(fstcompress \n    fstcompress.cc)\n\n  target_link_libraries(fstcompress \n    fstcompressscript \n    fstscript \n    fst\n    ${ZLIBS}\n    ${CMAKE_DL_LIBS}\n   )\n\n  add_executable(fstrandmod\n    fstrandmod.cc\n  )\n\n  target_link_libraries(fstrandmod\n    fstcompressscript \n    fstscript \n    fst\n    ${ZLIBS}\n    ${CMAKE_DL_LIBS}\n  )\n\n  install(TARGETS fstcompress fstrandmod \n\t        LIBRARY DESTINATION bin\n\t\t\tARCHIVE DESTINATION bin\n            RUNTIME DESTINATION bin\n\t\t)\nendif(HAVE_BIN)\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/extensions/compress/Makefile.am",
    "content": "AM_CPPFLAGS = -I$(srcdir)/../../include $(ICU_CPPFLAGS)\n\nif HAVE_BIN\nbin_PROGRAMS = fstcompress fstrandmod\n\nLDADD = libfstcompressscript.la \\\n        ../../script/libfstscript.la \\\n        ../../lib/libfst.la \\\n        -lm $(DL_LIBS)\n\nfstcompress_SOURCES = fstcompress.cc\nfstrandmod_SOURCES = fstrandmod.cc\nendif\n\nif HAVE_SCRIPT\nlibfstcompressscript_la_SOURCES = compress-script.cc\nlibfstcompressscript_la_LDFLAGS = -version-info 13:0:0\nlibfstcompressscript_la_LIBADD = \\\n        ../../script/libfstscript.la \\\n        ../../lib/libfst.la -lz -lm $(DL_LIBS)\nendif\n\nif HAVE_SCRIPT\nlib_LTLIBRARIES = libfstcompressscript.la\nendif\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/extensions/compress/Makefile.in",
    "content": "# Makefile.in generated by automake 1.15.1 from Makefile.am.\n# @configure_input@\n\n# Copyright (C) 1994-2017 Free Software Foundation, Inc.\n\n# This Makefile.in is free software; the Free Software Foundation\n# gives unlimited permission to copy and/or distribute it,\n# with or without modifications, as long as this notice is preserved.\n\n# This program is distributed in the hope that it will be useful,\n# but WITHOUT ANY WARRANTY, to the extent permitted by law; without\n# even the implied warranty of MERCHANTABILITY or FITNESS FOR A\n# PARTICULAR PURPOSE.\n\n@SET_MAKE@\n\n\nVPATH = @srcdir@\nam__is_gnu_make = { \\\n  if test -z '$(MAKELEVEL)'; then \\\n    false; \\\n  elif test -n '$(MAKE_HOST)'; then \\\n    true; \\\n  elif test -n '$(MAKE_VERSION)' && test -n '$(CURDIR)'; then \\\n    true; \\\n  else \\\n    false; \\\n  fi; \\\n}\nam__make_running_with_option = \\\n  case $${target_option-} in \\\n      ?) ;; \\\n      *) echo \"am__make_running_with_option: internal error: invalid\" \\\n              \"target option '$${target_option-}' specified\" >&2; \\\n         exit 1;; \\\n  esac; \\\n  has_opt=no; \\\n  sane_makeflags=$$MAKEFLAGS; \\\n  if $(am__is_gnu_make); then \\\n    sane_makeflags=$$MFLAGS; \\\n  else \\\n    case $$MAKEFLAGS in \\\n      *\\\\[\\ \\\t]*) \\\n        bs=\\\\; \\\n        sane_makeflags=`printf '%s\\n' \"$$MAKEFLAGS\" \\\n          | sed \"s/$$bs$$bs[$$bs $$bs\t]*//g\"`;; \\\n    esac; \\\n  fi; \\\n  skip_next=no; \\\n  strip_trailopt () \\\n  { \\\n    flg=`printf '%s\\n' \"$$flg\" | sed \"s/$$1.*$$//\"`; \\\n  }; \\\n  for flg in $$sane_makeflags; do \\\n    test $$skip_next = yes && { skip_next=no; continue; }; \\\n    case $$flg in \\\n      *=*|--*) continue;; \\\n        -*I) strip_trailopt 'I'; skip_next=yes;; \\\n      -*I?*) strip_trailopt 'I';; \\\n        -*O) strip_trailopt 'O'; skip_next=yes;; \\\n      -*O?*) strip_trailopt 'O';; \\\n        -*l) strip_trailopt 'l'; skip_next=yes;; \\\n      -*l?*) strip_trailopt 'l';; \\\n      -[dEDm]) skip_next=yes;; \\\n      -[JT]) skip_next=yes;; \\\n    esac; \\\n    case $$flg in \\\n      *$$target_option*) has_opt=yes; break;; \\\n    esac; \\\n  done; \\\n  test $$has_opt = yes\nam__make_dryrun = (target_option=n; $(am__make_running_with_option))\nam__make_keepgoing = (target_option=k; $(am__make_running_with_option))\npkgdatadir = $(datadir)/@PACKAGE@\npkgincludedir = $(includedir)/@PACKAGE@\npkglibdir = $(libdir)/@PACKAGE@\npkglibexecdir = $(libexecdir)/@PACKAGE@\nam__cd = CDPATH=\"$${ZSH_VERSION+.}$(PATH_SEPARATOR)\" && cd\ninstall_sh_DATA = $(install_sh) -c -m 644\ninstall_sh_PROGRAM = $(install_sh) -c\ninstall_sh_SCRIPT = $(install_sh) -c\nINSTALL_HEADER = $(INSTALL_DATA)\ntransform = $(program_transform_name)\nNORMAL_INSTALL = :\nPRE_INSTALL = :\nPOST_INSTALL = :\nNORMAL_UNINSTALL = :\nPRE_UNINSTALL = :\nPOST_UNINSTALL = :\nbuild_triplet = @build@\nhost_triplet = @host@\n@HAVE_BIN_TRUE@bin_PROGRAMS = fstcompress$(EXEEXT) fstrandmod$(EXEEXT)\nsubdir = src/extensions/compress\nACLOCAL_M4 = $(top_srcdir)/aclocal.m4\nam__aclocal_m4_deps = $(top_srcdir)/m4/ac_python_devel.m4 \\\n\t$(top_srcdir)/m4/libtool.m4 $(top_srcdir)/m4/ltoptions.m4 \\\n\t$(top_srcdir)/m4/ltsugar.m4 $(top_srcdir)/m4/ltversion.m4 \\\n\t$(top_srcdir)/m4/lt~obsolete.m4 $(top_srcdir)/configure.ac\nam__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \\\n\t$(ACLOCAL_M4)\nDIST_COMMON = $(srcdir)/Makefile.am $(am__DIST_COMMON)\nmkinstalldirs = $(install_sh) -d\nCONFIG_HEADER = $(top_builddir)/config.h \\\n\t$(top_builddir)/src/include/fst/config.h\nCONFIG_CLEAN_FILES =\nCONFIG_CLEAN_VPATH_FILES =\nam__vpath_adj_setup = srcdirstrip=`echo \"$(srcdir)\" | sed 's|.|.|g'`;\nam__vpath_adj = case $$p in \\\n    $(srcdir)/*) f=`echo \"$$p\" | sed \"s|^$$srcdirstrip/||\"`;; \\\n    *) f=$$p;; \\\n  esac;\nam__strip_dir = f=`echo $$p | sed -e 's|^.*/||'`;\nam__install_max = 40\nam__nobase_strip_setup = \\\n  srcdirstrip=`echo \"$(srcdir)\" | sed 's/[].[^$$\\\\*|]/\\\\\\\\&/g'`\nam__nobase_strip = \\\n  for p in $$list; do echo \"$$p\"; done | sed -e \"s|$$srcdirstrip/||\"\nam__nobase_list = $(am__nobase_strip_setup); \\\n  for p in $$list; do echo \"$$p $$p\"; done | \\\n  sed \"s| $$srcdirstrip/| |;\"' / .*\\//!s/ .*/ ./; s,\\( .*\\)/[^/]*$$,\\1,' | \\\n  $(AWK) 'BEGIN { files[\".\"] = \"\" } { files[$$2] = files[$$2] \" \" $$1; \\\n    if (++n[$$2] == $(am__install_max)) \\\n      { print $$2, files[$$2]; n[$$2] = 0; files[$$2] = \"\" } } \\\n    END { for (dir in files) print dir, files[dir] }'\nam__base_list = \\\n  sed '$$!N;$$!N;$$!N;$$!N;$$!N;$$!N;$$!N;s/\\n/ /g' | \\\n  sed '$$!N;$$!N;$$!N;$$!N;s/\\n/ /g'\nam__uninstall_files_from_dir = { \\\n  test -z \"$$files\" \\\n    || { test ! -d \"$$dir\" && test ! -f \"$$dir\" && test ! -r \"$$dir\"; } \\\n    || { echo \" ( cd '$$dir' && rm -f\" $$files \")\"; \\\n         $(am__cd) \"$$dir\" && rm -f $$files; }; \\\n  }\nam__installdirs = \"$(DESTDIR)$(libdir)\" \"$(DESTDIR)$(bindir)\"\nLTLIBRARIES = $(lib_LTLIBRARIES)\nam__DEPENDENCIES_1 =\n@HAVE_SCRIPT_TRUE@libfstcompressscript_la_DEPENDENCIES =  \\\n@HAVE_SCRIPT_TRUE@\t../../script/libfstscript.la \\\n@HAVE_SCRIPT_TRUE@\t../../lib/libfst.la $(am__DEPENDENCIES_1)\nam__libfstcompressscript_la_SOURCES_DIST = compress-script.cc\n@HAVE_SCRIPT_TRUE@am_libfstcompressscript_la_OBJECTS =  \\\n@HAVE_SCRIPT_TRUE@\tcompress-script.lo\nlibfstcompressscript_la_OBJECTS =  \\\n\t$(am_libfstcompressscript_la_OBJECTS)\nAM_V_lt = $(am__v_lt_@AM_V@)\nam__v_lt_ = $(am__v_lt_@AM_DEFAULT_V@)\nam__v_lt_0 = --silent\nam__v_lt_1 = \nlibfstcompressscript_la_LINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX \\\n\t$(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=link $(CXXLD) \\\n\t$(AM_CXXFLAGS) $(CXXFLAGS) $(libfstcompressscript_la_LDFLAGS) \\\n\t$(LDFLAGS) -o $@\n@HAVE_SCRIPT_TRUE@am_libfstcompressscript_la_rpath = -rpath $(libdir)\nPROGRAMS = $(bin_PROGRAMS)\nam__fstcompress_SOURCES_DIST = fstcompress.cc\n@HAVE_BIN_TRUE@am_fstcompress_OBJECTS = fstcompress.$(OBJEXT)\nfstcompress_OBJECTS = $(am_fstcompress_OBJECTS)\nfstcompress_LDADD = $(LDADD)\n@HAVE_BIN_TRUE@fstcompress_DEPENDENCIES = libfstcompressscript.la \\\n@HAVE_BIN_TRUE@\t../../script/libfstscript.la \\\n@HAVE_BIN_TRUE@\t../../lib/libfst.la $(am__DEPENDENCIES_1)\nam__fstrandmod_SOURCES_DIST = fstrandmod.cc\n@HAVE_BIN_TRUE@am_fstrandmod_OBJECTS = fstrandmod.$(OBJEXT)\nfstrandmod_OBJECTS = $(am_fstrandmod_OBJECTS)\nfstrandmod_LDADD = $(LDADD)\n@HAVE_BIN_TRUE@fstrandmod_DEPENDENCIES = libfstcompressscript.la \\\n@HAVE_BIN_TRUE@\t../../script/libfstscript.la \\\n@HAVE_BIN_TRUE@\t../../lib/libfst.la $(am__DEPENDENCIES_1)\nAM_V_P = $(am__v_P_@AM_V@)\nam__v_P_ = $(am__v_P_@AM_DEFAULT_V@)\nam__v_P_0 = false\nam__v_P_1 = :\nAM_V_GEN = $(am__v_GEN_@AM_V@)\nam__v_GEN_ = $(am__v_GEN_@AM_DEFAULT_V@)\nam__v_GEN_0 = @echo \"  GEN     \" $@;\nam__v_GEN_1 = \nAM_V_at = $(am__v_at_@AM_V@)\nam__v_at_ = $(am__v_at_@AM_DEFAULT_V@)\nam__v_at_0 = @\nam__v_at_1 = \nDEFAULT_INCLUDES = \ndepcomp = $(SHELL) $(top_srcdir)/depcomp\nam__depfiles_maybe = depfiles\nam__mv = mv -f\nCXXCOMPILE = $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) \\\n\t$(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS)\nLTCXXCOMPILE = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \\\n\t$(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) \\\n\t$(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) \\\n\t$(AM_CXXFLAGS) $(CXXFLAGS)\nAM_V_CXX = $(am__v_CXX_@AM_V@)\nam__v_CXX_ = $(am__v_CXX_@AM_DEFAULT_V@)\nam__v_CXX_0 = @echo \"  CXX     \" $@;\nam__v_CXX_1 = \nCXXLD = $(CXX)\nCXXLINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \\\n\t$(LIBTOOLFLAGS) --mode=link $(CXXLD) $(AM_CXXFLAGS) \\\n\t$(CXXFLAGS) $(AM_LDFLAGS) $(LDFLAGS) -o $@\nAM_V_CXXLD = $(am__v_CXXLD_@AM_V@)\nam__v_CXXLD_ = $(am__v_CXXLD_@AM_DEFAULT_V@)\nam__v_CXXLD_0 = @echo \"  CXXLD   \" $@;\nam__v_CXXLD_1 = \nSOURCES = $(libfstcompressscript_la_SOURCES) $(fstcompress_SOURCES) \\\n\t$(fstrandmod_SOURCES)\nDIST_SOURCES = $(am__libfstcompressscript_la_SOURCES_DIST) \\\n\t$(am__fstcompress_SOURCES_DIST) $(am__fstrandmod_SOURCES_DIST)\nam__can_run_installinfo = \\\n  case $$AM_UPDATE_INFO_DIR in \\\n    n|no|NO) false;; \\\n    *) (install-info --version) >/dev/null 2>&1;; \\\n  esac\nam__tagged_files = $(HEADERS) $(SOURCES) $(TAGS_FILES) $(LISP)\n# Read a list of newline-separated strings from the standard input,\n# and print each of them once, without duplicates.  Input order is\n# *not* preserved.\nam__uniquify_input = $(AWK) '\\\n  BEGIN { nonempty = 0; } \\\n  { items[$$0] = 1; nonempty = 1; } \\\n  END { if (nonempty) { for (i in items) print i; }; } \\\n'\n# Make sure the list of sources is unique.  This is necessary because,\n# e.g., the same source file might be shared among _SOURCES variables\n# for different programs/libraries.\nam__define_uniq_tagged_files = \\\n  list='$(am__tagged_files)'; \\\n  unique=`for i in $$list; do \\\n    if test -f \"$$i\"; then echo $$i; else echo $(srcdir)/$$i; fi; \\\n  done | $(am__uniquify_input)`\nETAGS = etags\nCTAGS = ctags\nam__DIST_COMMON = $(srcdir)/Makefile.in $(top_srcdir)/depcomp\nDISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST)\nACLOCAL = @ACLOCAL@\nAMTAR = @AMTAR@\nAM_DEFAULT_VERBOSITY = @AM_DEFAULT_VERBOSITY@\nAR = @AR@\nAUTOCONF = @AUTOCONF@\nAUTOHEADER = @AUTOHEADER@\nAUTOMAKE = @AUTOMAKE@\nAWK = @AWK@\nCC = @CC@\nCCDEPMODE = @CCDEPMODE@\nCFLAGS = @CFLAGS@\nCPP = @CPP@\nCPPFLAGS = @CPPFLAGS@\nCXX = @CXX@\nCXXCPP = @CXXCPP@\nCXXDEPMODE = @CXXDEPMODE@\nCXXFLAGS = @CXXFLAGS@\nCYGPATH_W = @CYGPATH_W@\nDEFS = @DEFS@\nDEPDIR = @DEPDIR@\nDLLTOOL = @DLLTOOL@\nDL_LIBS = @DL_LIBS@\nDSYMUTIL = @DSYMUTIL@\nDUMPBIN = @DUMPBIN@\nECHO_C = @ECHO_C@\nECHO_N = @ECHO_N@\nECHO_T = @ECHO_T@\nEGREP = @EGREP@\nEXEEXT = @EXEEXT@\nFGREP = @FGREP@\nGREP = @GREP@\nINSTALL = @INSTALL@\nINSTALL_DATA = @INSTALL_DATA@\nINSTALL_PROGRAM = @INSTALL_PROGRAM@\nINSTALL_SCRIPT = @INSTALL_SCRIPT@\nINSTALL_STRIP_PROGRAM = @INSTALL_STRIP_PROGRAM@\nLD = @LD@\nLDFLAGS = @LDFLAGS@\nLIBOBJS = @LIBOBJS@\nLIBS = @LIBS@\nLIBTOOL = @LIBTOOL@\nLIPO = @LIPO@\nLN_S = @LN_S@\nLTLIBOBJS = @LTLIBOBJS@\nLT_SYS_LIBRARY_PATH = @LT_SYS_LIBRARY_PATH@\nMAKEINFO = @MAKEINFO@\nMANIFEST_TOOL = @MANIFEST_TOOL@\nMKDIR_P = @MKDIR_P@\nNM = @NM@\nNMEDIT = @NMEDIT@\nOBJDUMP = @OBJDUMP@\nOBJEXT = @OBJEXT@\nOTOOL = @OTOOL@\nOTOOL64 = @OTOOL64@\nPACKAGE = @PACKAGE@\nPACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@\nPACKAGE_NAME = @PACKAGE_NAME@\nPACKAGE_STRING = @PACKAGE_STRING@\nPACKAGE_TARNAME = @PACKAGE_TARNAME@\nPACKAGE_URL = @PACKAGE_URL@\nPACKAGE_VERSION = @PACKAGE_VERSION@\nPATH_SEPARATOR = @PATH_SEPARATOR@\nPYTHON = @PYTHON@\nPYTHON_CPPFLAGS = @PYTHON_CPPFLAGS@\nPYTHON_EXEC_PREFIX = @PYTHON_EXEC_PREFIX@\nPYTHON_EXTRA_LDFLAGS = @PYTHON_EXTRA_LDFLAGS@\nPYTHON_EXTRA_LIBS = @PYTHON_EXTRA_LIBS@\nPYTHON_LDFLAGS = @PYTHON_LDFLAGS@\nPYTHON_PLATFORM = @PYTHON_PLATFORM@\nPYTHON_PREFIX = @PYTHON_PREFIX@\nPYTHON_SITE_PKG = @PYTHON_SITE_PKG@\nPYTHON_VERSION = @PYTHON_VERSION@\nRANLIB = @RANLIB@\nSED = @SED@\nSET_MAKE = @SET_MAKE@\nSHELL = @SHELL@\nSTRIP = @STRIP@\nVERSION = @VERSION@\nabs_builddir = @abs_builddir@\nabs_srcdir = @abs_srcdir@\nabs_top_builddir = @abs_top_builddir@\nabs_top_srcdir = @abs_top_srcdir@\nac_ct_AR = @ac_ct_AR@\nac_ct_CC = @ac_ct_CC@\nac_ct_CXX = @ac_ct_CXX@\nac_ct_DUMPBIN = @ac_ct_DUMPBIN@\nam__include = @am__include@\nam__leading_dot = @am__leading_dot@\nam__quote = @am__quote@\nam__tar = @am__tar@\nam__untar = @am__untar@\nbindir = @bindir@\nbuild = @build@\nbuild_alias = @build_alias@\nbuild_cpu = @build_cpu@\nbuild_os = @build_os@\nbuild_vendor = @build_vendor@\nbuilddir = @builddir@\ndatadir = @datadir@\ndatarootdir = @datarootdir@\ndocdir = @docdir@\ndvidir = @dvidir@\nexec_prefix = @exec_prefix@\nhost = @host@\nhost_alias = @host_alias@\nhost_cpu = @host_cpu@\nhost_os = @host_os@\nhost_vendor = @host_vendor@\nhtmldir = @htmldir@\nincludedir = @includedir@\ninfodir = @infodir@\ninstall_sh = @install_sh@\nlibdir = @libdir@\nlibexecdir = @libexecdir@\nlibfstdir = @libfstdir@\nlocaledir = @localedir@\nlocalstatedir = @localstatedir@\nmandir = @mandir@\nmkdir_p = @mkdir_p@\noldincludedir = @oldincludedir@\npdfdir = @pdfdir@\npkgpyexecdir = @pkgpyexecdir@\npkgpythondir = @pkgpythondir@\nprefix = @prefix@\nprogram_transform_name = @program_transform_name@\npsdir = @psdir@\npyexecdir = @pyexecdir@\npythondir = @pythondir@\nrunstatedir = @runstatedir@\nsbindir = @sbindir@\nsharedstatedir = @sharedstatedir@\nsrcdir = @srcdir@\nsysconfdir = @sysconfdir@\ntarget_alias = @target_alias@\ntop_build_prefix = @top_build_prefix@\ntop_builddir = @top_builddir@\ntop_srcdir = @top_srcdir@\nAM_CPPFLAGS = -I$(srcdir)/../../include $(ICU_CPPFLAGS)\n@HAVE_BIN_TRUE@LDADD = libfstcompressscript.la \\\n@HAVE_BIN_TRUE@        ../../script/libfstscript.la \\\n@HAVE_BIN_TRUE@        ../../lib/libfst.la \\\n@HAVE_BIN_TRUE@        -lm $(DL_LIBS)\n\n@HAVE_BIN_TRUE@fstcompress_SOURCES = fstcompress.cc\n@HAVE_BIN_TRUE@fstrandmod_SOURCES = fstrandmod.cc\n@HAVE_SCRIPT_TRUE@libfstcompressscript_la_SOURCES = compress-script.cc\n@HAVE_SCRIPT_TRUE@libfstcompressscript_la_LDFLAGS = -version-info 13:0:0\n@HAVE_SCRIPT_TRUE@libfstcompressscript_la_LIBADD = \\\n@HAVE_SCRIPT_TRUE@        ../../script/libfstscript.la \\\n@HAVE_SCRIPT_TRUE@        ../../lib/libfst.la -lz -lm $(DL_LIBS)\n\n@HAVE_SCRIPT_TRUE@lib_LTLIBRARIES = libfstcompressscript.la\nall: all-am\n\n.SUFFIXES:\n.SUFFIXES: .cc .lo .o .obj\n$(srcdir)/Makefile.in:  $(srcdir)/Makefile.am  $(am__configure_deps)\n\t@for dep in $?; do \\\n\t  case '$(am__configure_deps)' in \\\n\t    *$$dep*) \\\n\t      ( cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh ) \\\n\t        && { if test -f $@; then exit 0; else break; fi; }; \\\n\t      exit 1;; \\\n\t  esac; \\\n\tdone; \\\n\techo ' cd $(top_srcdir) && $(AUTOMAKE) --foreign src/extensions/compress/Makefile'; \\\n\t$(am__cd) $(top_srcdir) && \\\n\t  $(AUTOMAKE) --foreign src/extensions/compress/Makefile\nMakefile: $(srcdir)/Makefile.in $(top_builddir)/config.status\n\t@case '$?' in \\\n\t  *config.status*) \\\n\t    cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh;; \\\n\t  *) \\\n\t    echo ' cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe)'; \\\n\t    cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe);; \\\n\tesac;\n\n$(top_builddir)/config.status: $(top_srcdir)/configure $(CONFIG_STATUS_DEPENDENCIES)\n\tcd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh\n\n$(top_srcdir)/configure:  $(am__configure_deps)\n\tcd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh\n$(ACLOCAL_M4):  $(am__aclocal_m4_deps)\n\tcd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh\n$(am__aclocal_m4_deps):\n\ninstall-libLTLIBRARIES: $(lib_LTLIBRARIES)\n\t@$(NORMAL_INSTALL)\n\t@list='$(lib_LTLIBRARIES)'; test -n \"$(libdir)\" || list=; \\\n\tlist2=; for p in $$list; do \\\n\t  if test -f $$p; then \\\n\t    list2=\"$$list2 $$p\"; \\\n\t  else :; fi; \\\n\tdone; \\\n\ttest -z \"$$list2\" || { \\\n\t  echo \" $(MKDIR_P) '$(DESTDIR)$(libdir)'\"; \\\n\t  $(MKDIR_P) \"$(DESTDIR)$(libdir)\" || exit 1; \\\n\t  echo \" $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) $$list2 '$(DESTDIR)$(libdir)'\"; \\\n\t  $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) $$list2 \"$(DESTDIR)$(libdir)\"; \\\n\t}\n\nuninstall-libLTLIBRARIES:\n\t@$(NORMAL_UNINSTALL)\n\t@list='$(lib_LTLIBRARIES)'; test -n \"$(libdir)\" || list=; \\\n\tfor p in $$list; do \\\n\t  $(am__strip_dir) \\\n\t  echo \" $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=uninstall rm -f '$(DESTDIR)$(libdir)/$$f'\"; \\\n\t  $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=uninstall rm -f \"$(DESTDIR)$(libdir)/$$f\"; \\\n\tdone\n\nclean-libLTLIBRARIES:\n\t-test -z \"$(lib_LTLIBRARIES)\" || rm -f $(lib_LTLIBRARIES)\n\t@list='$(lib_LTLIBRARIES)'; \\\n\tlocs=`for p in $$list; do echo $$p; done | \\\n\t      sed 's|^[^/]*$$|.|; s|/[^/]*$$||; s|$$|/so_locations|' | \\\n\t      sort -u`; \\\n\ttest -z \"$$locs\" || { \\\n\t  echo rm -f $${locs}; \\\n\t  rm -f $${locs}; \\\n\t}\n\nlibfstcompressscript.la: $(libfstcompressscript_la_OBJECTS) $(libfstcompressscript_la_DEPENDENCIES) $(EXTRA_libfstcompressscript_la_DEPENDENCIES) \n\t$(AM_V_CXXLD)$(libfstcompressscript_la_LINK) $(am_libfstcompressscript_la_rpath) $(libfstcompressscript_la_OBJECTS) $(libfstcompressscript_la_LIBADD) $(LIBS)\ninstall-binPROGRAMS: $(bin_PROGRAMS)\n\t@$(NORMAL_INSTALL)\n\t@list='$(bin_PROGRAMS)'; test -n \"$(bindir)\" || list=; \\\n\tif test -n \"$$list\"; then \\\n\t  echo \" $(MKDIR_P) '$(DESTDIR)$(bindir)'\"; \\\n\t  $(MKDIR_P) \"$(DESTDIR)$(bindir)\" || exit 1; \\\n\tfi; \\\n\tfor p in $$list; do echo \"$$p $$p\"; done | \\\n\tsed 's/$(EXEEXT)$$//' | \\\n\twhile read p p1; do if test -f $$p \\\n\t || test -f $$p1 \\\n\t  ; then echo \"$$p\"; echo \"$$p\"; else :; fi; \\\n\tdone | \\\n\tsed -e 'p;s,.*/,,;n;h' \\\n\t    -e 's|.*|.|' \\\n\t    -e 'p;x;s,.*/,,;s/$(EXEEXT)$$//;$(transform);s/$$/$(EXEEXT)/' | \\\n\tsed 'N;N;N;s,\\n, ,g' | \\\n\t$(AWK) 'BEGIN { files[\".\"] = \"\"; dirs[\".\"] = 1 } \\\n\t  { d=$$3; if (dirs[d] != 1) { print \"d\", d; dirs[d] = 1 } \\\n\t    if ($$2 == $$4) files[d] = files[d] \" \" $$1; \\\n\t    else { print \"f\", $$3 \"/\" $$4, $$1; } } \\\n\t  END { for (d in files) print \"f\", d, files[d] }' | \\\n\twhile read type dir files; do \\\n\t    if test \"$$dir\" = .; then dir=; else dir=/$$dir; fi; \\\n\t    test -z \"$$files\" || { \\\n\t    echo \" $(INSTALL_PROGRAM_ENV) $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL_PROGRAM) $$files '$(DESTDIR)$(bindir)$$dir'\"; \\\n\t    $(INSTALL_PROGRAM_ENV) $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL_PROGRAM) $$files \"$(DESTDIR)$(bindir)$$dir\" || exit $$?; \\\n\t    } \\\n\t; done\n\nuninstall-binPROGRAMS:\n\t@$(NORMAL_UNINSTALL)\n\t@list='$(bin_PROGRAMS)'; test -n \"$(bindir)\" || list=; \\\n\tfiles=`for p in $$list; do echo \"$$p\"; done | \\\n\t  sed -e 'h;s,^.*/,,;s/$(EXEEXT)$$//;$(transform)' \\\n\t      -e 's/$$/$(EXEEXT)/' \\\n\t`; \\\n\ttest -n \"$$list\" || exit 0; \\\n\techo \" ( cd '$(DESTDIR)$(bindir)' && rm -f\" $$files \")\"; \\\n\tcd \"$(DESTDIR)$(bindir)\" && rm -f $$files\n\nclean-binPROGRAMS:\n\t@list='$(bin_PROGRAMS)'; test -n \"$$list\" || exit 0; \\\n\techo \" rm -f\" $$list; \\\n\trm -f $$list || exit $$?; \\\n\ttest -n \"$(EXEEXT)\" || exit 0; \\\n\tlist=`for p in $$list; do echo \"$$p\"; done | sed 's/$(EXEEXT)$$//'`; \\\n\techo \" rm -f\" $$list; \\\n\trm -f $$list\n\nfstcompress$(EXEEXT): $(fstcompress_OBJECTS) $(fstcompress_DEPENDENCIES) $(EXTRA_fstcompress_DEPENDENCIES) \n\t@rm -f fstcompress$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(fstcompress_OBJECTS) $(fstcompress_LDADD) $(LIBS)\n\nfstrandmod$(EXEEXT): $(fstrandmod_OBJECTS) $(fstrandmod_DEPENDENCIES) $(EXTRA_fstrandmod_DEPENDENCIES) \n\t@rm -f fstrandmod$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(fstrandmod_OBJECTS) $(fstrandmod_LDADD) $(LIBS)\n\nmostlyclean-compile:\n\t-rm -f *.$(OBJEXT)\n\ndistclean-compile:\n\t-rm -f *.tab.c\n\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/compress-script.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstcompress.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstrandmod.Po@am__quote@\n\n.cc.o:\n@am__fastdepCXX_TRUE@\t$(AM_V_CXX)depbase=`echo $@ | sed 's|[^/]*$$|$(DEPDIR)/&|;s|\\.o$$||'`;\\\n@am__fastdepCXX_TRUE@\t$(CXXCOMPILE) -MT $@ -MD -MP -MF $$depbase.Tpo -c -o $@ $< &&\\\n@am__fastdepCXX_TRUE@\t$(am__mv) $$depbase.Tpo $$depbase.Po\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\t$(AM_V_CXX)source='$<' object='$@' libtool=no @AMDEPBACKSLASH@\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\tDEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@\n@am__fastdepCXX_FALSE@\t$(AM_V_CXX@am__nodep@)$(CXXCOMPILE) -c -o $@ $<\n\n.cc.obj:\n@am__fastdepCXX_TRUE@\t$(AM_V_CXX)depbase=`echo $@ | sed 's|[^/]*$$|$(DEPDIR)/&|;s|\\.obj$$||'`;\\\n@am__fastdepCXX_TRUE@\t$(CXXCOMPILE) -MT $@ -MD -MP -MF $$depbase.Tpo -c -o $@ `$(CYGPATH_W) '$<'` &&\\\n@am__fastdepCXX_TRUE@\t$(am__mv) $$depbase.Tpo $$depbase.Po\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\t$(AM_V_CXX)source='$<' object='$@' libtool=no @AMDEPBACKSLASH@\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\tDEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@\n@am__fastdepCXX_FALSE@\t$(AM_V_CXX@am__nodep@)$(CXXCOMPILE) -c -o $@ `$(CYGPATH_W) '$<'`\n\n.cc.lo:\n@am__fastdepCXX_TRUE@\t$(AM_V_CXX)depbase=`echo $@ | sed 's|[^/]*$$|$(DEPDIR)/&|;s|\\.lo$$||'`;\\\n@am__fastdepCXX_TRUE@\t$(LTCXXCOMPILE) -MT $@ -MD -MP -MF $$depbase.Tpo -c -o $@ $< &&\\\n@am__fastdepCXX_TRUE@\t$(am__mv) $$depbase.Tpo $$depbase.Plo\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\t$(AM_V_CXX)source='$<' object='$@' libtool=yes @AMDEPBACKSLASH@\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\tDEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@\n@am__fastdepCXX_FALSE@\t$(AM_V_CXX@am__nodep@)$(LTCXXCOMPILE) -c -o $@ $<\n\nmostlyclean-libtool:\n\t-rm -f *.lo\n\nclean-libtool:\n\t-rm -rf .libs _libs\n\nID: $(am__tagged_files)\n\t$(am__define_uniq_tagged_files); mkid -fID $$unique\ntags: tags-am\nTAGS: tags\n\ntags-am: $(TAGS_DEPENDENCIES) $(am__tagged_files)\n\tset x; \\\n\there=`pwd`; \\\n\t$(am__define_uniq_tagged_files); \\\n\tshift; \\\n\tif test -z \"$(ETAGS_ARGS)$$*$$unique\"; then :; else \\\n\t  test -n \"$$unique\" || unique=$$empty_fix; \\\n\t  if test $$# -gt 0; then \\\n\t    $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \\\n\t      \"$$@\" $$unique; \\\n\t  else \\\n\t    $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \\\n\t      $$unique; \\\n\t  fi; \\\n\tfi\nctags: ctags-am\n\nCTAGS: ctags\nctags-am: $(TAGS_DEPENDENCIES) $(am__tagged_files)\n\t$(am__define_uniq_tagged_files); \\\n\ttest -z \"$(CTAGS_ARGS)$$unique\" \\\n\t  || $(CTAGS) $(CTAGSFLAGS) $(AM_CTAGSFLAGS) $(CTAGS_ARGS) \\\n\t     $$unique\n\nGTAGS:\n\there=`$(am__cd) $(top_builddir) && pwd` \\\n\t  && $(am__cd) $(top_srcdir) \\\n\t  && gtags -i $(GTAGS_ARGS) \"$$here\"\ncscopelist: cscopelist-am\n\ncscopelist-am: $(am__tagged_files)\n\tlist='$(am__tagged_files)'; \\\n\tcase \"$(srcdir)\" in \\\n\t  [\\\\/]* | ?:[\\\\/]*) sdir=\"$(srcdir)\" ;; \\\n\t  *) sdir=$(subdir)/$(srcdir) ;; \\\n\tesac; \\\n\tfor i in $$list; do \\\n\t  if test -f \"$$i\"; then \\\n\t    echo \"$(subdir)/$$i\"; \\\n\t  else \\\n\t    echo \"$$sdir/$$i\"; \\\n\t  fi; \\\n\tdone >> $(top_builddir)/cscope.files\n\ndistclean-tags:\n\t-rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags\n\ndistdir: $(DISTFILES)\n\t@srcdirstrip=`echo \"$(srcdir)\" | sed 's/[].[^$$\\\\*]/\\\\\\\\&/g'`; \\\n\ttopsrcdirstrip=`echo \"$(top_srcdir)\" | sed 's/[].[^$$\\\\*]/\\\\\\\\&/g'`; \\\n\tlist='$(DISTFILES)'; \\\n\t  dist_files=`for file in $$list; do echo $$file; done | \\\n\t  sed -e \"s|^$$srcdirstrip/||;t\" \\\n\t      -e \"s|^$$topsrcdirstrip/|$(top_builddir)/|;t\"`; \\\n\tcase $$dist_files in \\\n\t  */*) $(MKDIR_P) `echo \"$$dist_files\" | \\\n\t\t\t   sed '/\\//!d;s|^|$(distdir)/|;s,/[^/]*$$,,' | \\\n\t\t\t   sort -u` ;; \\\n\tesac; \\\n\tfor file in $$dist_files; do \\\n\t  if test -f $$file || test -d $$file; then d=.; else d=$(srcdir); fi; \\\n\t  if test -d $$d/$$file; then \\\n\t    dir=`echo \"/$$file\" | sed -e 's,/[^/]*$$,,'`; \\\n\t    if test -d \"$(distdir)/$$file\"; then \\\n\t      find \"$(distdir)/$$file\" -type d ! -perm -700 -exec chmod u+rwx {} \\;; \\\n\t    fi; \\\n\t    if test -d $(srcdir)/$$file && test $$d != $(srcdir); then \\\n\t      cp -fpR $(srcdir)/$$file \"$(distdir)$$dir\" || exit 1; \\\n\t      find \"$(distdir)/$$file\" -type d ! -perm -700 -exec chmod u+rwx {} \\;; \\\n\t    fi; \\\n\t    cp -fpR $$d/$$file \"$(distdir)$$dir\" || exit 1; \\\n\t  else \\\n\t    test -f \"$(distdir)/$$file\" \\\n\t    || cp -p $$d/$$file \"$(distdir)/$$file\" \\\n\t    || exit 1; \\\n\t  fi; \\\n\tdone\ncheck-am: all-am\ncheck: check-am\nall-am: Makefile $(LTLIBRARIES) $(PROGRAMS)\ninstall-binPROGRAMS: install-libLTLIBRARIES\n\ninstalldirs:\n\tfor dir in \"$(DESTDIR)$(libdir)\" \"$(DESTDIR)$(bindir)\"; do \\\n\t  test -z \"$$dir\" || $(MKDIR_P) \"$$dir\"; \\\n\tdone\ninstall: install-am\ninstall-exec: install-exec-am\ninstall-data: install-data-am\nuninstall: uninstall-am\n\ninstall-am: all-am\n\t@$(MAKE) $(AM_MAKEFLAGS) install-exec-am install-data-am\n\ninstallcheck: installcheck-am\ninstall-strip:\n\tif test -z '$(STRIP)'; then \\\n\t  $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" \\\n\t    install_sh_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" INSTALL_STRIP_FLAG=-s \\\n\t      install; \\\n\telse \\\n\t  $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" \\\n\t    install_sh_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" INSTALL_STRIP_FLAG=-s \\\n\t    \"INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'\" install; \\\n\tfi\nmostlyclean-generic:\n\nclean-generic:\n\ndistclean-generic:\n\t-test -z \"$(CONFIG_CLEAN_FILES)\" || rm -f $(CONFIG_CLEAN_FILES)\n\t-test . = \"$(srcdir)\" || test -z \"$(CONFIG_CLEAN_VPATH_FILES)\" || rm -f $(CONFIG_CLEAN_VPATH_FILES)\n\nmaintainer-clean-generic:\n\t@echo \"This command is intended for maintainers to use\"\n\t@echo \"it deletes files that may require special tools to rebuild.\"\nclean: clean-am\n\nclean-am: clean-binPROGRAMS clean-generic clean-libLTLIBRARIES \\\n\tclean-libtool mostlyclean-am\n\ndistclean: distclean-am\n\t-rm -rf ./$(DEPDIR)\n\t-rm -f Makefile\ndistclean-am: clean-am distclean-compile distclean-generic \\\n\tdistclean-tags\n\ndvi: dvi-am\n\ndvi-am:\n\nhtml: html-am\n\nhtml-am:\n\ninfo: info-am\n\ninfo-am:\n\ninstall-data-am:\n\ninstall-dvi: install-dvi-am\n\ninstall-dvi-am:\n\ninstall-exec-am: install-binPROGRAMS install-libLTLIBRARIES\n\ninstall-html: install-html-am\n\ninstall-html-am:\n\ninstall-info: install-info-am\n\ninstall-info-am:\n\ninstall-man:\n\ninstall-pdf: install-pdf-am\n\ninstall-pdf-am:\n\ninstall-ps: install-ps-am\n\ninstall-ps-am:\n\ninstallcheck-am:\n\nmaintainer-clean: maintainer-clean-am\n\t-rm -rf ./$(DEPDIR)\n\t-rm -f Makefile\nmaintainer-clean-am: distclean-am maintainer-clean-generic\n\nmostlyclean: mostlyclean-am\n\nmostlyclean-am: mostlyclean-compile mostlyclean-generic \\\n\tmostlyclean-libtool\n\npdf: pdf-am\n\npdf-am:\n\nps: ps-am\n\nps-am:\n\nuninstall-am: uninstall-binPROGRAMS uninstall-libLTLIBRARIES\n\n.MAKE: install-am install-strip\n\n.PHONY: CTAGS GTAGS TAGS all all-am check check-am clean \\\n\tclean-binPROGRAMS clean-generic clean-libLTLIBRARIES \\\n\tclean-libtool cscopelist-am ctags ctags-am distclean \\\n\tdistclean-compile distclean-generic distclean-libtool \\\n\tdistclean-tags distdir dvi dvi-am html html-am info info-am \\\n\tinstall install-am install-binPROGRAMS install-data \\\n\tinstall-data-am install-dvi install-dvi-am install-exec \\\n\tinstall-exec-am install-html install-html-am install-info \\\n\tinstall-info-am install-libLTLIBRARIES install-man install-pdf \\\n\tinstall-pdf-am install-ps install-ps-am install-strip \\\n\tinstallcheck installcheck-am installdirs maintainer-clean \\\n\tmaintainer-clean-generic mostlyclean mostlyclean-compile \\\n\tmostlyclean-generic mostlyclean-libtool pdf pdf-am ps ps-am \\\n\ttags tags-am uninstall uninstall-am uninstall-binPROGRAMS \\\n\tuninstall-libLTLIBRARIES\n\n.PRECIOUS: Makefile\n\n\n# Tell versions [3.59,3.63) of GNU make to not export all variables.\n# Otherwise a system limit (for SysV at least) may be exceeded.\n.NOEXPORT:\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/extensions/compress/compress-script.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Definitions of 'scriptable' versions of compression operations, that is,\n// those that can be called with FstClass-type arguments.\n//\n// See comments in nlp/fst/script/script-impl.h for how the registration\n// mechanism allows these to work with various arc types.\n\n#include <fst/extensions/compress/compress-script.h>\n\n#include <fst/arc-map.h>\n#include <fst/script/script-impl.h>\n\nnamespace fst {\nnamespace script {\n\nvoid Compress(const FstClass &fst, const string &filename, const bool gzip) {\n  CompressArgs args(fst, filename, gzip);\n  Apply<Operation<CompressArgs>>(\"Compress\", fst.ArcType(), &args);\n}\n\nvoid Decompress(const string &filename, MutableFstClass *fst, const bool gzip) {\n  DecompressArgs args(filename, fst, gzip);\n  Apply<Operation<DecompressArgs>>(\"Decompress\", fst->ArcType(), &args);\n}\n\n// Register operations for common arc types.\n\nREGISTER_FST_OPERATION(Compress, StdArc, CompressArgs);\nREGISTER_FST_OPERATION(Compress, LogArc, CompressArgs);\nREGISTER_FST_OPERATION(Compress, Log64Arc, CompressArgs);\n\nREGISTER_FST_OPERATION(Decompress, StdArc, DecompressArgs);\nREGISTER_FST_OPERATION(Decompress, LogArc, DecompressArgs);\nREGISTER_FST_OPERATION(Decompress, Log64Arc, DecompressArgs);\n\n}  // namespace script\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/extensions/compress/fstcompress.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Compresses/decompresses an FST.\n\n#include <cstring>\n#include <memory>\n#include <string>\n\n#include <fst/flags.h>\n#include <fst/log.h>\n#include <fst/extensions/compress/compress-script.h>\n#include <fst/script/arg-packs.h>\n#include <fst/script/fst-class.h>\n\nDEFINE_string(arc_type, \"standard\", \"Output arc type\");\nDEFINE_bool(decode, false, \"Decode\");\nDEFINE_bool(gzip, false,\n            \"Applies gzip compression after LZA compression and \"\n            \"gzip decompression before LZA decompression \"\n            \"(recommended)\"\n            \"\");\n\nint main(int argc, char **argv) {\n  namespace s = fst::script;\n\n  using s::FstClass;\n  using s::VectorFstClass;\n\n  string usage = \"Compresses/decompresses an FST.\\n\\n  Usage: \";\n  usage += argv[0];\n  usage += \" [in.fst [out.fstz]]\\n\";\n  usage += \" --decode [in.fstz [out.fst]]\\n\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n  if (argc > 3) {\n    ShowUsage();\n    return 1;\n  }\n\n  string in_name = (argc > 1 && (strcmp(argv[1], \"-\") != 0)) ? argv[1] : \"\";\n  string out_name = argc > 2 ? argv[2] : \"\";\n\n  if (FLAGS_decode == false) {\n    std::unique_ptr<FstClass> ifst(FstClass::Read(in_name));\n    if (!ifst) return 1;\n    s::Compress(*ifst, out_name, FLAGS_gzip);\n  } else {\n    VectorFstClass ofst(FLAGS_arc_type);\n    s::Decompress(in_name, &ofst, FLAGS_gzip);\n    ofst.Write(out_name);\n  }\n  return 0;\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/extensions/compress/fstrandmod.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Generates a random FST according to a class-specific transition model.\n\n#include <cstdlib>\n#include <cstring>\n#include <ctime>\n#include <memory>\n#include <string>\n\n#include <fst/flags.h>\n#include <fst/log.h>\n#include <fst/extensions/compress/randmod.h>\n#include <fst/fstlib.h>\n\nDEFINE_int32(seed, time(0), \"Random seed\");\nDEFINE_int32(states, 10, \"# of states\");\nDEFINE_int32(labels, 2, \"# of labels\");\nDEFINE_int32(classes, 1, \"# of probability distributions\");\nDEFINE_bool(transducer, false, \"Output a transducer\");\nDEFINE_bool(weights, false, \"Output a weighted FST\");\n\nint main(int argc, char **argv) {\n  using fst::StdVectorFst;\n  using fst::StdArc;\n  using fst::TropicalWeight;\n  using fst::WeightGenerate;\n\n  string usage = \"Generates a random FST.\\n\\n  Usage: \";\n  usage += argv[0];\n  usage += \"[out.fst]\\n\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n  if (argc > 2) {\n    ShowUsage();\n    return 1;\n  }\n\n  string out_name = (argc > 1 && (strcmp(argv[1], \"-\") != 0)) ? argv[1] : \"\";\n\n  srand(FLAGS_seed);\n\n  int num_states = (rand() % FLAGS_states) + 1;    // NOLINT\n  int num_classes = (rand() % FLAGS_classes) + 1;  // NOLINT\n  int num_labels = (rand() % FLAGS_labels) + 1;    // NOLINT\n\n  StdVectorFst fst;\n  using TropicalWeightGenerate = WeightGenerate<TropicalWeight>;\n  std::unique_ptr<TropicalWeightGenerate> generate(FLAGS_weights ?\n      new TropicalWeightGenerate(false) : nullptr);\n  fst::RandMod<StdArc, TropicalWeightGenerate> rand_mod(num_states,\n      num_classes, num_labels, FLAGS_transducer, generate.get());\n  rand_mod.Generate(&fst);\n  fst.Write(out_name);\n  return 0;\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/extensions/const/CMakeLists.txt",
    "content": "function (add_module _name)\n    add_library(${ARGV})\n    if (TARGET ${_name})\n        target_link_libraries(${_name} fst)\n        set_target_properties(${_name} PROPERTIES \n            WINDOWS_EXPORT_ALL_SYMBOLS true\n            FOLDER constant/modules\n        )\n    endif()\n\n    install(TARGETS ${_name} LIBRARY DESTINATION lib/fst)\nendfunction()\n\n\nadd_module(const8-fst MODULE const8-fst.cc)\n\nadd_module(const16-fst MODULE const16-fst.cc)\n\nadd_module(const64-fst MODULE const64-fst.cc)\n\nadd_library(fstconst \n  const8-fst.cc \n  const16-fst.cc \n  const64-fst.cc)\ntarget_link_libraries(fstconst fst)\nset_target_properties(fstconst PROPERTIES\n  SOVERSION \"${SOVERSION}\"\n  FOLDER constant\n)\n\ninstall(TARGETS fstconst \n  LIBRARY DESTINATION lib\n  ARCHIVE DESTINATION lib\n  RUNTIME DESTINATION lib\n )\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/extensions/const/Makefile.am",
    "content": "AM_CPPFLAGS = -I$(srcdir)/../../include $(ICU_CPPFLAGS)\n\nlibfstdir = @libfstdir@\nlibfst_LTLIBRARIES = const8-fst.la const16-fst.la const64-fst.la\n\nlib_LTLIBRARIES = libfstconst.la\n\nlibfstconst_la_SOURCES = const8-fst.cc const16-fst.cc const64-fst.cc\nlibfstconst_la_LDFLAGS = -version-info 13:0:0 -lm $(DL_LIBS)\nlibfstconst_la_LIBADD = ../../lib/libfst.la -lm $(DL_LIBS)\n\nconst8_fst_la_SOURCES = const8-fst.cc\nconst8_fst_la_LDFLAGS = -module\n\nconst16_fst_la_SOURCES = const16-fst.cc\nconst16_fst_la_LDFLAGS = -module\n\nconst64_fst_la_SOURCES = const64-fst.cc\nconst64_fst_la_LDFLAGS = -module\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/extensions/const/Makefile.in",
    "content": "# Makefile.in generated by automake 1.15.1 from Makefile.am.\n# @configure_input@\n\n# Copyright (C) 1994-2017 Free Software Foundation, Inc.\n\n# This Makefile.in is free software; the Free Software Foundation\n# gives unlimited permission to copy and/or distribute it,\n# with or without modifications, as long as this notice is preserved.\n\n# This program is distributed in the hope that it will be useful,\n# but WITHOUT ANY WARRANTY, to the extent permitted by law; without\n# even the implied warranty of MERCHANTABILITY or FITNESS FOR A\n# PARTICULAR PURPOSE.\n\n@SET_MAKE@\n\nVPATH = @srcdir@\nam__is_gnu_make = { \\\n  if test -z '$(MAKELEVEL)'; then \\\n    false; \\\n  elif test -n '$(MAKE_HOST)'; then \\\n    true; \\\n  elif test -n '$(MAKE_VERSION)' && test -n '$(CURDIR)'; then \\\n    true; \\\n  else \\\n    false; \\\n  fi; \\\n}\nam__make_running_with_option = \\\n  case $${target_option-} in \\\n      ?) ;; \\\n      *) echo \"am__make_running_with_option: internal error: invalid\" \\\n              \"target option '$${target_option-}' specified\" >&2; \\\n         exit 1;; \\\n  esac; \\\n  has_opt=no; \\\n  sane_makeflags=$$MAKEFLAGS; \\\n  if $(am__is_gnu_make); then \\\n    sane_makeflags=$$MFLAGS; \\\n  else \\\n    case $$MAKEFLAGS in \\\n      *\\\\[\\ \\\t]*) \\\n        bs=\\\\; \\\n        sane_makeflags=`printf '%s\\n' \"$$MAKEFLAGS\" \\\n          | sed \"s/$$bs$$bs[$$bs $$bs\t]*//g\"`;; \\\n    esac; \\\n  fi; \\\n  skip_next=no; \\\n  strip_trailopt () \\\n  { \\\n    flg=`printf '%s\\n' \"$$flg\" | sed \"s/$$1.*$$//\"`; \\\n  }; \\\n  for flg in $$sane_makeflags; do \\\n    test $$skip_next = yes && { skip_next=no; continue; }; \\\n    case $$flg in \\\n      *=*|--*) continue;; \\\n        -*I) strip_trailopt 'I'; skip_next=yes;; \\\n      -*I?*) strip_trailopt 'I';; \\\n        -*O) strip_trailopt 'O'; skip_next=yes;; \\\n      -*O?*) strip_trailopt 'O';; \\\n        -*l) strip_trailopt 'l'; skip_next=yes;; \\\n      -*l?*) strip_trailopt 'l';; \\\n      -[dEDm]) skip_next=yes;; \\\n      -[JT]) skip_next=yes;; \\\n    esac; \\\n    case $$flg in \\\n      *$$target_option*) has_opt=yes; break;; \\\n    esac; \\\n  done; \\\n  test $$has_opt = yes\nam__make_dryrun = (target_option=n; $(am__make_running_with_option))\nam__make_keepgoing = (target_option=k; $(am__make_running_with_option))\npkgdatadir = $(datadir)/@PACKAGE@\npkgincludedir = $(includedir)/@PACKAGE@\npkglibdir = $(libdir)/@PACKAGE@\npkglibexecdir = $(libexecdir)/@PACKAGE@\nam__cd = CDPATH=\"$${ZSH_VERSION+.}$(PATH_SEPARATOR)\" && cd\ninstall_sh_DATA = $(install_sh) -c -m 644\ninstall_sh_PROGRAM = $(install_sh) -c\ninstall_sh_SCRIPT = $(install_sh) -c\nINSTALL_HEADER = $(INSTALL_DATA)\ntransform = $(program_transform_name)\nNORMAL_INSTALL = :\nPRE_INSTALL = :\nPOST_INSTALL = :\nNORMAL_UNINSTALL = :\nPRE_UNINSTALL = :\nPOST_UNINSTALL = :\nbuild_triplet = @build@\nhost_triplet = @host@\nsubdir = src/extensions/const\nACLOCAL_M4 = $(top_srcdir)/aclocal.m4\nam__aclocal_m4_deps = $(top_srcdir)/m4/ac_python_devel.m4 \\\n\t$(top_srcdir)/m4/libtool.m4 $(top_srcdir)/m4/ltoptions.m4 \\\n\t$(top_srcdir)/m4/ltsugar.m4 $(top_srcdir)/m4/ltversion.m4 \\\n\t$(top_srcdir)/m4/lt~obsolete.m4 $(top_srcdir)/configure.ac\nam__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \\\n\t$(ACLOCAL_M4)\nDIST_COMMON = $(srcdir)/Makefile.am $(am__DIST_COMMON)\nmkinstalldirs = $(install_sh) -d\nCONFIG_HEADER = $(top_builddir)/config.h \\\n\t$(top_builddir)/src/include/fst/config.h\nCONFIG_CLEAN_FILES =\nCONFIG_CLEAN_VPATH_FILES =\nam__vpath_adj_setup = srcdirstrip=`echo \"$(srcdir)\" | sed 's|.|.|g'`;\nam__vpath_adj = case $$p in \\\n    $(srcdir)/*) f=`echo \"$$p\" | sed \"s|^$$srcdirstrip/||\"`;; \\\n    *) f=$$p;; \\\n  esac;\nam__strip_dir = f=`echo $$p | sed -e 's|^.*/||'`;\nam__install_max = 40\nam__nobase_strip_setup = \\\n  srcdirstrip=`echo \"$(srcdir)\" | sed 's/[].[^$$\\\\*|]/\\\\\\\\&/g'`\nam__nobase_strip = \\\n  for p in $$list; do echo \"$$p\"; done | sed -e \"s|$$srcdirstrip/||\"\nam__nobase_list = $(am__nobase_strip_setup); \\\n  for p in $$list; do echo \"$$p $$p\"; done | \\\n  sed \"s| $$srcdirstrip/| |;\"' / .*\\//!s/ .*/ ./; s,\\( .*\\)/[^/]*$$,\\1,' | \\\n  $(AWK) 'BEGIN { files[\".\"] = \"\" } { files[$$2] = files[$$2] \" \" $$1; \\\n    if (++n[$$2] == $(am__install_max)) \\\n      { print $$2, files[$$2]; n[$$2] = 0; files[$$2] = \"\" } } \\\n    END { for (dir in files) print dir, files[dir] }'\nam__base_list = \\\n  sed '$$!N;$$!N;$$!N;$$!N;$$!N;$$!N;$$!N;s/\\n/ /g' | \\\n  sed '$$!N;$$!N;$$!N;$$!N;s/\\n/ /g'\nam__uninstall_files_from_dir = { \\\n  test -z \"$$files\" \\\n    || { test ! -d \"$$dir\" && test ! -f \"$$dir\" && test ! -r \"$$dir\"; } \\\n    || { echo \" ( cd '$$dir' && rm -f\" $$files \")\"; \\\n         $(am__cd) \"$$dir\" && rm -f $$files; }; \\\n  }\nam__installdirs = \"$(DESTDIR)$(libdir)\" \"$(DESTDIR)$(libfstdir)\"\nLTLIBRARIES = $(lib_LTLIBRARIES) $(libfst_LTLIBRARIES)\nconst16_fst_la_LIBADD =\nam_const16_fst_la_OBJECTS = const16-fst.lo\nconst16_fst_la_OBJECTS = $(am_const16_fst_la_OBJECTS)\nAM_V_lt = $(am__v_lt_@AM_V@)\nam__v_lt_ = $(am__v_lt_@AM_DEFAULT_V@)\nam__v_lt_0 = --silent\nam__v_lt_1 = \nconst16_fst_la_LINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX \\\n\t$(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=link $(CXXLD) \\\n\t$(AM_CXXFLAGS) $(CXXFLAGS) $(const16_fst_la_LDFLAGS) \\\n\t$(LDFLAGS) -o $@\nconst64_fst_la_LIBADD =\nam_const64_fst_la_OBJECTS = const64-fst.lo\nconst64_fst_la_OBJECTS = $(am_const64_fst_la_OBJECTS)\nconst64_fst_la_LINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX \\\n\t$(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=link $(CXXLD) \\\n\t$(AM_CXXFLAGS) $(CXXFLAGS) $(const64_fst_la_LDFLAGS) \\\n\t$(LDFLAGS) -o $@\nconst8_fst_la_LIBADD =\nam_const8_fst_la_OBJECTS = const8-fst.lo\nconst8_fst_la_OBJECTS = $(am_const8_fst_la_OBJECTS)\nconst8_fst_la_LINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX \\\n\t$(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=link $(CXXLD) \\\n\t$(AM_CXXFLAGS) $(CXXFLAGS) $(const8_fst_la_LDFLAGS) $(LDFLAGS) \\\n\t-o $@\nam__DEPENDENCIES_1 =\nlibfstconst_la_DEPENDENCIES = ../../lib/libfst.la \\\n\t$(am__DEPENDENCIES_1)\nam_libfstconst_la_OBJECTS = const8-fst.lo const16-fst.lo \\\n\tconst64-fst.lo\nlibfstconst_la_OBJECTS = $(am_libfstconst_la_OBJECTS)\nlibfstconst_la_LINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX \\\n\t$(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=link $(CXXLD) \\\n\t$(AM_CXXFLAGS) $(CXXFLAGS) $(libfstconst_la_LDFLAGS) \\\n\t$(LDFLAGS) -o $@\nAM_V_P = $(am__v_P_@AM_V@)\nam__v_P_ = $(am__v_P_@AM_DEFAULT_V@)\nam__v_P_0 = false\nam__v_P_1 = :\nAM_V_GEN = $(am__v_GEN_@AM_V@)\nam__v_GEN_ = $(am__v_GEN_@AM_DEFAULT_V@)\nam__v_GEN_0 = @echo \"  GEN     \" $@;\nam__v_GEN_1 = \nAM_V_at = $(am__v_at_@AM_V@)\nam__v_at_ = $(am__v_at_@AM_DEFAULT_V@)\nam__v_at_0 = @\nam__v_at_1 = \nDEFAULT_INCLUDES = \ndepcomp = $(SHELL) $(top_srcdir)/depcomp\nam__depfiles_maybe = depfiles\nam__mv = mv -f\nCXXCOMPILE = $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) \\\n\t$(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS)\nLTCXXCOMPILE = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \\\n\t$(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) \\\n\t$(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) \\\n\t$(AM_CXXFLAGS) $(CXXFLAGS)\nAM_V_CXX = $(am__v_CXX_@AM_V@)\nam__v_CXX_ = $(am__v_CXX_@AM_DEFAULT_V@)\nam__v_CXX_0 = @echo \"  CXX     \" $@;\nam__v_CXX_1 = \nCXXLD = $(CXX)\nCXXLINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \\\n\t$(LIBTOOLFLAGS) --mode=link $(CXXLD) $(AM_CXXFLAGS) \\\n\t$(CXXFLAGS) $(AM_LDFLAGS) $(LDFLAGS) -o $@\nAM_V_CXXLD = $(am__v_CXXLD_@AM_V@)\nam__v_CXXLD_ = $(am__v_CXXLD_@AM_DEFAULT_V@)\nam__v_CXXLD_0 = @echo \"  CXXLD   \" $@;\nam__v_CXXLD_1 = \nSOURCES = $(const16_fst_la_SOURCES) $(const64_fst_la_SOURCES) \\\n\t$(const8_fst_la_SOURCES) $(libfstconst_la_SOURCES)\nDIST_SOURCES = $(const16_fst_la_SOURCES) $(const64_fst_la_SOURCES) \\\n\t$(const8_fst_la_SOURCES) $(libfstconst_la_SOURCES)\nam__can_run_installinfo = \\\n  case $$AM_UPDATE_INFO_DIR in \\\n    n|no|NO) false;; \\\n    *) (install-info --version) >/dev/null 2>&1;; \\\n  esac\nam__tagged_files = $(HEADERS) $(SOURCES) $(TAGS_FILES) $(LISP)\n# Read a list of newline-separated strings from the standard input,\n# and print each of them once, without duplicates.  Input order is\n# *not* preserved.\nam__uniquify_input = $(AWK) '\\\n  BEGIN { nonempty = 0; } \\\n  { items[$$0] = 1; nonempty = 1; } \\\n  END { if (nonempty) { for (i in items) print i; }; } \\\n'\n# Make sure the list of sources is unique.  This is necessary because,\n# e.g., the same source file might be shared among _SOURCES variables\n# for different programs/libraries.\nam__define_uniq_tagged_files = \\\n  list='$(am__tagged_files)'; \\\n  unique=`for i in $$list; do \\\n    if test -f \"$$i\"; then echo $$i; else echo $(srcdir)/$$i; fi; \\\n  done | $(am__uniquify_input)`\nETAGS = etags\nCTAGS = ctags\nam__DIST_COMMON = $(srcdir)/Makefile.in $(top_srcdir)/depcomp\nDISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST)\nACLOCAL = @ACLOCAL@\nAMTAR = @AMTAR@\nAM_DEFAULT_VERBOSITY = @AM_DEFAULT_VERBOSITY@\nAR = @AR@\nAUTOCONF = @AUTOCONF@\nAUTOHEADER = @AUTOHEADER@\nAUTOMAKE = @AUTOMAKE@\nAWK = @AWK@\nCC = @CC@\nCCDEPMODE = @CCDEPMODE@\nCFLAGS = @CFLAGS@\nCPP = @CPP@\nCPPFLAGS = @CPPFLAGS@\nCXX = @CXX@\nCXXCPP = @CXXCPP@\nCXXDEPMODE = @CXXDEPMODE@\nCXXFLAGS = @CXXFLAGS@\nCYGPATH_W = @CYGPATH_W@\nDEFS = @DEFS@\nDEPDIR = @DEPDIR@\nDLLTOOL = @DLLTOOL@\nDL_LIBS = @DL_LIBS@\nDSYMUTIL = @DSYMUTIL@\nDUMPBIN = @DUMPBIN@\nECHO_C = @ECHO_C@\nECHO_N = @ECHO_N@\nECHO_T = @ECHO_T@\nEGREP = @EGREP@\nEXEEXT = @EXEEXT@\nFGREP = @FGREP@\nGREP = @GREP@\nINSTALL = @INSTALL@\nINSTALL_DATA = @INSTALL_DATA@\nINSTALL_PROGRAM = @INSTALL_PROGRAM@\nINSTALL_SCRIPT = @INSTALL_SCRIPT@\nINSTALL_STRIP_PROGRAM = @INSTALL_STRIP_PROGRAM@\nLD = @LD@\nLDFLAGS = @LDFLAGS@\nLIBOBJS = @LIBOBJS@\nLIBS = @LIBS@\nLIBTOOL = @LIBTOOL@\nLIPO = @LIPO@\nLN_S = @LN_S@\nLTLIBOBJS = @LTLIBOBJS@\nLT_SYS_LIBRARY_PATH = @LT_SYS_LIBRARY_PATH@\nMAKEINFO = @MAKEINFO@\nMANIFEST_TOOL = @MANIFEST_TOOL@\nMKDIR_P = @MKDIR_P@\nNM = @NM@\nNMEDIT = @NMEDIT@\nOBJDUMP = @OBJDUMP@\nOBJEXT = @OBJEXT@\nOTOOL = @OTOOL@\nOTOOL64 = @OTOOL64@\nPACKAGE = @PACKAGE@\nPACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@\nPACKAGE_NAME = @PACKAGE_NAME@\nPACKAGE_STRING = @PACKAGE_STRING@\nPACKAGE_TARNAME = @PACKAGE_TARNAME@\nPACKAGE_URL = @PACKAGE_URL@\nPACKAGE_VERSION = @PACKAGE_VERSION@\nPATH_SEPARATOR = @PATH_SEPARATOR@\nPYTHON = @PYTHON@\nPYTHON_CPPFLAGS = @PYTHON_CPPFLAGS@\nPYTHON_EXEC_PREFIX = @PYTHON_EXEC_PREFIX@\nPYTHON_EXTRA_LDFLAGS = @PYTHON_EXTRA_LDFLAGS@\nPYTHON_EXTRA_LIBS = @PYTHON_EXTRA_LIBS@\nPYTHON_LDFLAGS = @PYTHON_LDFLAGS@\nPYTHON_PLATFORM = @PYTHON_PLATFORM@\nPYTHON_PREFIX = @PYTHON_PREFIX@\nPYTHON_SITE_PKG = @PYTHON_SITE_PKG@\nPYTHON_VERSION = @PYTHON_VERSION@\nRANLIB = @RANLIB@\nSED = @SED@\nSET_MAKE = @SET_MAKE@\nSHELL = @SHELL@\nSTRIP = @STRIP@\nVERSION = @VERSION@\nabs_builddir = @abs_builddir@\nabs_srcdir = @abs_srcdir@\nabs_top_builddir = @abs_top_builddir@\nabs_top_srcdir = @abs_top_srcdir@\nac_ct_AR = @ac_ct_AR@\nac_ct_CC = @ac_ct_CC@\nac_ct_CXX = @ac_ct_CXX@\nac_ct_DUMPBIN = @ac_ct_DUMPBIN@\nam__include = @am__include@\nam__leading_dot = @am__leading_dot@\nam__quote = @am__quote@\nam__tar = @am__tar@\nam__untar = @am__untar@\nbindir = @bindir@\nbuild = @build@\nbuild_alias = @build_alias@\nbuild_cpu = @build_cpu@\nbuild_os = @build_os@\nbuild_vendor = @build_vendor@\nbuilddir = @builddir@\ndatadir = @datadir@\ndatarootdir = @datarootdir@\ndocdir = @docdir@\ndvidir = @dvidir@\nexec_prefix = @exec_prefix@\nhost = @host@\nhost_alias = @host_alias@\nhost_cpu = @host_cpu@\nhost_os = @host_os@\nhost_vendor = @host_vendor@\nhtmldir = @htmldir@\nincludedir = @includedir@\ninfodir = @infodir@\ninstall_sh = @install_sh@\nlibdir = @libdir@\nlibexecdir = @libexecdir@\nlibfstdir = @libfstdir@\nlocaledir = @localedir@\nlocalstatedir = @localstatedir@\nmandir = @mandir@\nmkdir_p = @mkdir_p@\noldincludedir = @oldincludedir@\npdfdir = @pdfdir@\npkgpyexecdir = @pkgpyexecdir@\npkgpythondir = @pkgpythondir@\nprefix = @prefix@\nprogram_transform_name = @program_transform_name@\npsdir = @psdir@\npyexecdir = @pyexecdir@\npythondir = @pythondir@\nrunstatedir = @runstatedir@\nsbindir = @sbindir@\nsharedstatedir = @sharedstatedir@\nsrcdir = @srcdir@\nsysconfdir = @sysconfdir@\ntarget_alias = @target_alias@\ntop_build_prefix = @top_build_prefix@\ntop_builddir = @top_builddir@\ntop_srcdir = @top_srcdir@\nAM_CPPFLAGS = -I$(srcdir)/../../include $(ICU_CPPFLAGS)\nlibfst_LTLIBRARIES = const8-fst.la const16-fst.la const64-fst.la\nlib_LTLIBRARIES = libfstconst.la\nlibfstconst_la_SOURCES = const8-fst.cc const16-fst.cc const64-fst.cc\nlibfstconst_la_LDFLAGS = -version-info 13:0:0 -lm $(DL_LIBS)\nlibfstconst_la_LIBADD = ../../lib/libfst.la -lm $(DL_LIBS)\nconst8_fst_la_SOURCES = const8-fst.cc\nconst8_fst_la_LDFLAGS = -module\nconst16_fst_la_SOURCES = const16-fst.cc\nconst16_fst_la_LDFLAGS = -module\nconst64_fst_la_SOURCES = const64-fst.cc\nconst64_fst_la_LDFLAGS = -module\nall: all-am\n\n.SUFFIXES:\n.SUFFIXES: .cc .lo .o .obj\n$(srcdir)/Makefile.in:  $(srcdir)/Makefile.am  $(am__configure_deps)\n\t@for dep in $?; do \\\n\t  case '$(am__configure_deps)' in \\\n\t    *$$dep*) \\\n\t      ( cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh ) \\\n\t        && { if test -f $@; then exit 0; else break; fi; }; \\\n\t      exit 1;; \\\n\t  esac; \\\n\tdone; \\\n\techo ' cd $(top_srcdir) && $(AUTOMAKE) --foreign src/extensions/const/Makefile'; \\\n\t$(am__cd) $(top_srcdir) && \\\n\t  $(AUTOMAKE) --foreign src/extensions/const/Makefile\nMakefile: $(srcdir)/Makefile.in $(top_builddir)/config.status\n\t@case '$?' in \\\n\t  *config.status*) \\\n\t    cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh;; \\\n\t  *) \\\n\t    echo ' cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe)'; \\\n\t    cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe);; \\\n\tesac;\n\n$(top_builddir)/config.status: $(top_srcdir)/configure $(CONFIG_STATUS_DEPENDENCIES)\n\tcd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh\n\n$(top_srcdir)/configure:  $(am__configure_deps)\n\tcd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh\n$(ACLOCAL_M4):  $(am__aclocal_m4_deps)\n\tcd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh\n$(am__aclocal_m4_deps):\n\ninstall-libLTLIBRARIES: $(lib_LTLIBRARIES)\n\t@$(NORMAL_INSTALL)\n\t@list='$(lib_LTLIBRARIES)'; test -n \"$(libdir)\" || list=; \\\n\tlist2=; for p in $$list; do \\\n\t  if test -f $$p; then \\\n\t    list2=\"$$list2 $$p\"; \\\n\t  else :; fi; \\\n\tdone; \\\n\ttest -z \"$$list2\" || { \\\n\t  echo \" $(MKDIR_P) '$(DESTDIR)$(libdir)'\"; \\\n\t  $(MKDIR_P) \"$(DESTDIR)$(libdir)\" || exit 1; \\\n\t  echo \" $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) $$list2 '$(DESTDIR)$(libdir)'\"; \\\n\t  $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) $$list2 \"$(DESTDIR)$(libdir)\"; \\\n\t}\n\nuninstall-libLTLIBRARIES:\n\t@$(NORMAL_UNINSTALL)\n\t@list='$(lib_LTLIBRARIES)'; test -n \"$(libdir)\" || list=; \\\n\tfor p in $$list; do \\\n\t  $(am__strip_dir) \\\n\t  echo \" $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=uninstall rm -f '$(DESTDIR)$(libdir)/$$f'\"; \\\n\t  $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=uninstall rm -f \"$(DESTDIR)$(libdir)/$$f\"; \\\n\tdone\n\nclean-libLTLIBRARIES:\n\t-test -z \"$(lib_LTLIBRARIES)\" || rm -f $(lib_LTLIBRARIES)\n\t@list='$(lib_LTLIBRARIES)'; \\\n\tlocs=`for p in $$list; do echo $$p; done | \\\n\t      sed 's|^[^/]*$$|.|; s|/[^/]*$$||; s|$$|/so_locations|' | \\\n\t      sort -u`; \\\n\ttest -z \"$$locs\" || { \\\n\t  echo rm -f $${locs}; \\\n\t  rm -f $${locs}; \\\n\t}\n\ninstall-libfstLTLIBRARIES: $(libfst_LTLIBRARIES)\n\t@$(NORMAL_INSTALL)\n\t@list='$(libfst_LTLIBRARIES)'; test -n \"$(libfstdir)\" || list=; \\\n\tlist2=; for p in $$list; do \\\n\t  if test -f $$p; then \\\n\t    list2=\"$$list2 $$p\"; \\\n\t  else :; fi; \\\n\tdone; \\\n\ttest -z \"$$list2\" || { \\\n\t  echo \" $(MKDIR_P) '$(DESTDIR)$(libfstdir)'\"; \\\n\t  $(MKDIR_P) \"$(DESTDIR)$(libfstdir)\" || exit 1; \\\n\t  echo \" $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) $$list2 '$(DESTDIR)$(libfstdir)'\"; \\\n\t  $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) $$list2 \"$(DESTDIR)$(libfstdir)\"; \\\n\t}\n\nuninstall-libfstLTLIBRARIES:\n\t@$(NORMAL_UNINSTALL)\n\t@list='$(libfst_LTLIBRARIES)'; test -n \"$(libfstdir)\" || list=; \\\n\tfor p in $$list; do \\\n\t  $(am__strip_dir) \\\n\t  echo \" $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=uninstall rm -f '$(DESTDIR)$(libfstdir)/$$f'\"; \\\n\t  $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=uninstall rm -f \"$(DESTDIR)$(libfstdir)/$$f\"; \\\n\tdone\n\nclean-libfstLTLIBRARIES:\n\t-test -z \"$(libfst_LTLIBRARIES)\" || rm -f $(libfst_LTLIBRARIES)\n\t@list='$(libfst_LTLIBRARIES)'; \\\n\tlocs=`for p in $$list; do echo $$p; done | \\\n\t      sed 's|^[^/]*$$|.|; s|/[^/]*$$||; s|$$|/so_locations|' | \\\n\t      sort -u`; \\\n\ttest -z \"$$locs\" || { \\\n\t  echo rm -f $${locs}; \\\n\t  rm -f $${locs}; \\\n\t}\n\nconst16-fst.la: $(const16_fst_la_OBJECTS) $(const16_fst_la_DEPENDENCIES) $(EXTRA_const16_fst_la_DEPENDENCIES) \n\t$(AM_V_CXXLD)$(const16_fst_la_LINK) -rpath $(libfstdir) $(const16_fst_la_OBJECTS) $(const16_fst_la_LIBADD) $(LIBS)\n\nconst64-fst.la: $(const64_fst_la_OBJECTS) $(const64_fst_la_DEPENDENCIES) $(EXTRA_const64_fst_la_DEPENDENCIES) \n\t$(AM_V_CXXLD)$(const64_fst_la_LINK) -rpath $(libfstdir) $(const64_fst_la_OBJECTS) $(const64_fst_la_LIBADD) $(LIBS)\n\nconst8-fst.la: $(const8_fst_la_OBJECTS) $(const8_fst_la_DEPENDENCIES) $(EXTRA_const8_fst_la_DEPENDENCIES) \n\t$(AM_V_CXXLD)$(const8_fst_la_LINK) -rpath $(libfstdir) $(const8_fst_la_OBJECTS) $(const8_fst_la_LIBADD) $(LIBS)\n\nlibfstconst.la: $(libfstconst_la_OBJECTS) $(libfstconst_la_DEPENDENCIES) $(EXTRA_libfstconst_la_DEPENDENCIES) \n\t$(AM_V_CXXLD)$(libfstconst_la_LINK) -rpath $(libdir) $(libfstconst_la_OBJECTS) $(libfstconst_la_LIBADD) $(LIBS)\n\nmostlyclean-compile:\n\t-rm -f *.$(OBJEXT)\n\ndistclean-compile:\n\t-rm -f *.tab.c\n\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/const16-fst.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/const64-fst.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/const8-fst.Plo@am__quote@\n\n.cc.o:\n@am__fastdepCXX_TRUE@\t$(AM_V_CXX)depbase=`echo $@ | sed 's|[^/]*$$|$(DEPDIR)/&|;s|\\.o$$||'`;\\\n@am__fastdepCXX_TRUE@\t$(CXXCOMPILE) -MT $@ -MD -MP -MF $$depbase.Tpo -c -o $@ $< &&\\\n@am__fastdepCXX_TRUE@\t$(am__mv) $$depbase.Tpo $$depbase.Po\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\t$(AM_V_CXX)source='$<' object='$@' libtool=no @AMDEPBACKSLASH@\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\tDEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@\n@am__fastdepCXX_FALSE@\t$(AM_V_CXX@am__nodep@)$(CXXCOMPILE) -c -o $@ $<\n\n.cc.obj:\n@am__fastdepCXX_TRUE@\t$(AM_V_CXX)depbase=`echo $@ | sed 's|[^/]*$$|$(DEPDIR)/&|;s|\\.obj$$||'`;\\\n@am__fastdepCXX_TRUE@\t$(CXXCOMPILE) -MT $@ -MD -MP -MF $$depbase.Tpo -c -o $@ `$(CYGPATH_W) '$<'` &&\\\n@am__fastdepCXX_TRUE@\t$(am__mv) $$depbase.Tpo $$depbase.Po\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\t$(AM_V_CXX)source='$<' object='$@' libtool=no @AMDEPBACKSLASH@\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\tDEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@\n@am__fastdepCXX_FALSE@\t$(AM_V_CXX@am__nodep@)$(CXXCOMPILE) -c -o $@ `$(CYGPATH_W) '$<'`\n\n.cc.lo:\n@am__fastdepCXX_TRUE@\t$(AM_V_CXX)depbase=`echo $@ | sed 's|[^/]*$$|$(DEPDIR)/&|;s|\\.lo$$||'`;\\\n@am__fastdepCXX_TRUE@\t$(LTCXXCOMPILE) -MT $@ -MD -MP -MF $$depbase.Tpo -c -o $@ $< &&\\\n@am__fastdepCXX_TRUE@\t$(am__mv) $$depbase.Tpo $$depbase.Plo\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\t$(AM_V_CXX)source='$<' object='$@' libtool=yes @AMDEPBACKSLASH@\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\tDEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@\n@am__fastdepCXX_FALSE@\t$(AM_V_CXX@am__nodep@)$(LTCXXCOMPILE) -c -o $@ $<\n\nmostlyclean-libtool:\n\t-rm -f *.lo\n\nclean-libtool:\n\t-rm -rf .libs _libs\n\nID: $(am__tagged_files)\n\t$(am__define_uniq_tagged_files); mkid -fID $$unique\ntags: tags-am\nTAGS: tags\n\ntags-am: $(TAGS_DEPENDENCIES) $(am__tagged_files)\n\tset x; \\\n\there=`pwd`; \\\n\t$(am__define_uniq_tagged_files); \\\n\tshift; \\\n\tif test -z \"$(ETAGS_ARGS)$$*$$unique\"; then :; else \\\n\t  test -n \"$$unique\" || unique=$$empty_fix; \\\n\t  if test $$# -gt 0; then \\\n\t    $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \\\n\t      \"$$@\" $$unique; \\\n\t  else \\\n\t    $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \\\n\t      $$unique; \\\n\t  fi; \\\n\tfi\nctags: ctags-am\n\nCTAGS: ctags\nctags-am: $(TAGS_DEPENDENCIES) $(am__tagged_files)\n\t$(am__define_uniq_tagged_files); \\\n\ttest -z \"$(CTAGS_ARGS)$$unique\" \\\n\t  || $(CTAGS) $(CTAGSFLAGS) $(AM_CTAGSFLAGS) $(CTAGS_ARGS) \\\n\t     $$unique\n\nGTAGS:\n\there=`$(am__cd) $(top_builddir) && pwd` \\\n\t  && $(am__cd) $(top_srcdir) \\\n\t  && gtags -i $(GTAGS_ARGS) \"$$here\"\ncscopelist: cscopelist-am\n\ncscopelist-am: $(am__tagged_files)\n\tlist='$(am__tagged_files)'; \\\n\tcase \"$(srcdir)\" in \\\n\t  [\\\\/]* | ?:[\\\\/]*) sdir=\"$(srcdir)\" ;; \\\n\t  *) sdir=$(subdir)/$(srcdir) ;; \\\n\tesac; \\\n\tfor i in $$list; do \\\n\t  if test -f \"$$i\"; then \\\n\t    echo \"$(subdir)/$$i\"; \\\n\t  else \\\n\t    echo \"$$sdir/$$i\"; \\\n\t  fi; \\\n\tdone >> $(top_builddir)/cscope.files\n\ndistclean-tags:\n\t-rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags\n\ndistdir: $(DISTFILES)\n\t@srcdirstrip=`echo \"$(srcdir)\" | sed 's/[].[^$$\\\\*]/\\\\\\\\&/g'`; \\\n\ttopsrcdirstrip=`echo \"$(top_srcdir)\" | sed 's/[].[^$$\\\\*]/\\\\\\\\&/g'`; \\\n\tlist='$(DISTFILES)'; \\\n\t  dist_files=`for file in $$list; do echo $$file; done | \\\n\t  sed -e \"s|^$$srcdirstrip/||;t\" \\\n\t      -e \"s|^$$topsrcdirstrip/|$(top_builddir)/|;t\"`; \\\n\tcase $$dist_files in \\\n\t  */*) $(MKDIR_P) `echo \"$$dist_files\" | \\\n\t\t\t   sed '/\\//!d;s|^|$(distdir)/|;s,/[^/]*$$,,' | \\\n\t\t\t   sort -u` ;; \\\n\tesac; \\\n\tfor file in $$dist_files; do \\\n\t  if test -f $$file || test -d $$file; then d=.; else d=$(srcdir); fi; \\\n\t  if test -d $$d/$$file; then \\\n\t    dir=`echo \"/$$file\" | sed -e 's,/[^/]*$$,,'`; \\\n\t    if test -d \"$(distdir)/$$file\"; then \\\n\t      find \"$(distdir)/$$file\" -type d ! -perm -700 -exec chmod u+rwx {} \\;; \\\n\t    fi; \\\n\t    if test -d $(srcdir)/$$file && test $$d != $(srcdir); then \\\n\t      cp -fpR $(srcdir)/$$file \"$(distdir)$$dir\" || exit 1; \\\n\t      find \"$(distdir)/$$file\" -type d ! -perm -700 -exec chmod u+rwx {} \\;; \\\n\t    fi; \\\n\t    cp -fpR $$d/$$file \"$(distdir)$$dir\" || exit 1; \\\n\t  else \\\n\t    test -f \"$(distdir)/$$file\" \\\n\t    || cp -p $$d/$$file \"$(distdir)/$$file\" \\\n\t    || exit 1; \\\n\t  fi; \\\n\tdone\ncheck-am: all-am\ncheck: check-am\nall-am: Makefile $(LTLIBRARIES)\ninstalldirs:\n\tfor dir in \"$(DESTDIR)$(libdir)\" \"$(DESTDIR)$(libfstdir)\"; do \\\n\t  test -z \"$$dir\" || $(MKDIR_P) \"$$dir\"; \\\n\tdone\ninstall: install-am\ninstall-exec: install-exec-am\ninstall-data: install-data-am\nuninstall: uninstall-am\n\ninstall-am: all-am\n\t@$(MAKE) $(AM_MAKEFLAGS) install-exec-am install-data-am\n\ninstallcheck: installcheck-am\ninstall-strip:\n\tif test -z '$(STRIP)'; then \\\n\t  $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" \\\n\t    install_sh_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" INSTALL_STRIP_FLAG=-s \\\n\t      install; \\\n\telse \\\n\t  $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" \\\n\t    install_sh_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" INSTALL_STRIP_FLAG=-s \\\n\t    \"INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'\" install; \\\n\tfi\nmostlyclean-generic:\n\nclean-generic:\n\ndistclean-generic:\n\t-test -z \"$(CONFIG_CLEAN_FILES)\" || rm -f $(CONFIG_CLEAN_FILES)\n\t-test . = \"$(srcdir)\" || test -z \"$(CONFIG_CLEAN_VPATH_FILES)\" || rm -f $(CONFIG_CLEAN_VPATH_FILES)\n\nmaintainer-clean-generic:\n\t@echo \"This command is intended for maintainers to use\"\n\t@echo \"it deletes files that may require special tools to rebuild.\"\nclean: clean-am\n\nclean-am: clean-generic clean-libLTLIBRARIES clean-libfstLTLIBRARIES \\\n\tclean-libtool mostlyclean-am\n\ndistclean: distclean-am\n\t-rm -rf ./$(DEPDIR)\n\t-rm -f Makefile\ndistclean-am: clean-am distclean-compile distclean-generic \\\n\tdistclean-tags\n\ndvi: dvi-am\n\ndvi-am:\n\nhtml: html-am\n\nhtml-am:\n\ninfo: info-am\n\ninfo-am:\n\ninstall-data-am: install-libfstLTLIBRARIES\n\ninstall-dvi: install-dvi-am\n\ninstall-dvi-am:\n\ninstall-exec-am: install-libLTLIBRARIES\n\ninstall-html: install-html-am\n\ninstall-html-am:\n\ninstall-info: install-info-am\n\ninstall-info-am:\n\ninstall-man:\n\ninstall-pdf: install-pdf-am\n\ninstall-pdf-am:\n\ninstall-ps: install-ps-am\n\ninstall-ps-am:\n\ninstallcheck-am:\n\nmaintainer-clean: maintainer-clean-am\n\t-rm -rf ./$(DEPDIR)\n\t-rm -f Makefile\nmaintainer-clean-am: distclean-am maintainer-clean-generic\n\nmostlyclean: mostlyclean-am\n\nmostlyclean-am: mostlyclean-compile mostlyclean-generic \\\n\tmostlyclean-libtool\n\npdf: pdf-am\n\npdf-am:\n\nps: ps-am\n\nps-am:\n\nuninstall-am: uninstall-libLTLIBRARIES uninstall-libfstLTLIBRARIES\n\n.MAKE: install-am install-strip\n\n.PHONY: CTAGS GTAGS TAGS all all-am check check-am clean clean-generic \\\n\tclean-libLTLIBRARIES clean-libfstLTLIBRARIES clean-libtool \\\n\tcscopelist-am ctags ctags-am distclean distclean-compile \\\n\tdistclean-generic distclean-libtool distclean-tags distdir dvi \\\n\tdvi-am html html-am info info-am install install-am \\\n\tinstall-data install-data-am install-dvi install-dvi-am \\\n\tinstall-exec install-exec-am install-html install-html-am \\\n\tinstall-info install-info-am install-libLTLIBRARIES \\\n\tinstall-libfstLTLIBRARIES install-man install-pdf \\\n\tinstall-pdf-am install-ps install-ps-am install-strip \\\n\tinstallcheck installcheck-am installdirs maintainer-clean \\\n\tmaintainer-clean-generic mostlyclean mostlyclean-compile \\\n\tmostlyclean-generic mostlyclean-libtool pdf pdf-am ps ps-am \\\n\ttags tags-am uninstall uninstall-am uninstall-libLTLIBRARIES \\\n\tuninstall-libfstLTLIBRARIES\n\n.PRECIOUS: Makefile\n\n\n# Tell versions [3.59,3.63) of GNU make to not export all variables.\n# Otherwise a system limit (for SysV at least) may be exceeded.\n.NOEXPORT:\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/extensions/const/const16-fst.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/fst.h>\n#include <fst/const-fst.h>\n\nnamespace fst {\n\nstatic FstRegisterer<ConstFst<StdArc, uint16>>\n    ConstFst_StdArc_uint16_registerer;\nstatic FstRegisterer<ConstFst<LogArc, uint16>>\n    ConstFst_LogArc_uint16_registerer;\nstatic FstRegisterer<ConstFst<Log64Arc, uint16>>\n    ConstFst_Log64Arc_uint16_registerer;\n\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/extensions/const/const64-fst.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/fst.h>\n#include <fst/const-fst.h>\n\nnamespace fst {\n\nstatic FstRegisterer<ConstFst<StdArc, uint64>>\n    ConstFst_StdArc_uint64_registerer;\nstatic FstRegisterer<ConstFst<LogArc, uint64>>\n    ConstFst_LogArc_uint64_registerer;\nstatic FstRegisterer<ConstFst<Log64Arc, uint64>>\n    ConstFst_Log64Arc_uint64_registerer;\n\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/extensions/const/const8-fst.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/fst.h>\n#include <fst/const-fst.h>\n\nnamespace fst {\n\nstatic FstRegisterer<ConstFst<StdArc, uint8>> ConstFst_StdArc_uint8_registerer;\nstatic FstRegisterer<ConstFst<LogArc, uint8>> ConstFst_LogArc_uint8_registerer;\nstatic FstRegisterer<ConstFst<Log64Arc, uint8>>\n    ConstFst_Log64Arc_uint8_registerer;\n\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/extensions/far/CMakeLists.txt",
    "content": "file(GLOB HEADER_FILES ../../include/fst/extensions/far/*.h)\nmessage(STATUS \"${HEADER_FILES}\")\n\nadd_library(fstfar\n  sttable.cc\n  stlist.cc\n  ${HEADER_FILES}\n)\ntarget_link_libraries(fstfar fst)\nset_target_properties(fstfar PROPERTIES \n  SOVERSION \"${SOVERSION}\"\n  FOLDER far\n)\n\ninstall(TARGETS fstfar\n  LIBRARY DESTINATION lib\n  ARCHIVE DESTINATION lib\n  RUNTIME DESTINATION lib\n)\n\nif(HAVE_SCRIPT)\n  add_library(fstfarscript\n    far-class.cc \n    farscript.cc\n    getters.cc \n    script-impl.cc\n    strings.cc\n  )\n  target_link_libraries(fstfarscript fstfar fstscript fst)\n  set_target_properties(fstfarscript PROPERTIES \n    SOVERSION \"${SOVERSION}\"\n    FOLDER far\n  )\n\n  install(TARGETS fstfarscript\n\tLIBRARY DESTINATION lib\n\tARCHIVE DESTINATION lib\n\tRUNTIME DESTINATION lib\n  )\nendif(HAVE_SCRIPT)\n\nif(HAVE_BIN)\n  function (add_executable2 _name)\n      add_executable(${ARGV})\n      if (TARGET ${_name})\n          target_link_libraries(${_name} fstfarscript fstscript fst ${CMAKE_DL_LIBS})\n          set_target_properties(${_name} PROPERTIES FOLDER far/bin)\n      endif()\n      install(TARGETS ${_name} RUNTIME DESTINATION bin)\n  endfunction()\n\n  add_executable2(farcompilestrings farcompilestrings.cc)\n  add_executable2(farcreate  farcreate.cc)\n  add_executable2(farequal  farequal.cc)\n  add_executable2(farextract  farextract.cc)\n  add_executable2(farinfo  farinfo.cc)\n  add_executable2(farisomorphic  farisomorphic.cc)\n  add_executable2(farprintstrings  farprintstrings.cc)\nendif(HAVE_BIN)\n\n\n\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/extensions/far/Makefile.am",
    "content": "AM_CPPFLAGS = -I$(srcdir)/../../include $(ICU_CPPFLAGS)\n\nif HAVE_SCRIPT\nlib_LTLIBRARIES = libfstfar.la libfstfarscript.la\nelse\nlib_LTLIBRARIES = libfstfar.la\nendif\n\nlibfstfar_la_SOURCES = sttable.cc stlist.cc\nlibfstfar_la_LDFLAGS = -version-info 13:0:0\nlibfstfar_la_LIBADD = ../../lib/libfst.la -lm $(DL_LIBS)\n\nif HAVE_SCRIPT\nlibfstfarscript_la_SOURCES = far-class.cc farscript.cc getters.cc script-impl.cc \\\n                             strings.cc\nlibfstfarscript_la_LDFLAGS = -version-info 13:0:0\nlibfstfarscript_la_LIBADD = \\\n    libfstfar.la ../../script/libfstscript.la \\\n        ../../lib/libfst.la -lm $(DL_LIBS)\nendif\n\nif HAVE_BIN\nbin_PROGRAMS = farcompilestrings farcreate farequal farextract farinfo \\\n    farisomorphic farprintstrings\n\nLDADD = libfstfarscript.la ../../script/libfstscript.la \\\n        ../../lib/libfst.la -lm $(DL_LIBS)\n\nfarcompilestrings_SOURCES = farcompilestrings.cc\n\nfarcreate_SOURCES = farcreate.cc\n\nfarequal_SOURCES = farequal.cc\n\nfarextract_SOURCES = farextract.cc\n\nfarinfo_SOURCES = farinfo.cc\n\nfarisomorphic_SOURCES = farisomorphic.cc\n\nfarprintstrings_SOURCES = farprintstrings.cc\nendif\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/extensions/far/Makefile.in",
    "content": "# Makefile.in generated by automake 1.15.1 from Makefile.am.\n# @configure_input@\n\n# Copyright (C) 1994-2017 Free Software Foundation, Inc.\n\n# This Makefile.in is free software; the Free Software Foundation\n# gives unlimited permission to copy and/or distribute it,\n# with or without modifications, as long as this notice is preserved.\n\n# This program is distributed in the hope that it will be useful,\n# but WITHOUT ANY WARRANTY, to the extent permitted by law; without\n# even the implied warranty of MERCHANTABILITY or FITNESS FOR A\n# PARTICULAR PURPOSE.\n\n@SET_MAKE@\n\n\nVPATH = @srcdir@\nam__is_gnu_make = { \\\n  if test -z '$(MAKELEVEL)'; then \\\n    false; \\\n  elif test -n '$(MAKE_HOST)'; then \\\n    true; \\\n  elif test -n '$(MAKE_VERSION)' && test -n '$(CURDIR)'; then \\\n    true; \\\n  else \\\n    false; \\\n  fi; \\\n}\nam__make_running_with_option = \\\n  case $${target_option-} in \\\n      ?) ;; \\\n      *) echo \"am__make_running_with_option: internal error: invalid\" \\\n              \"target option '$${target_option-}' specified\" >&2; \\\n         exit 1;; \\\n  esac; \\\n  has_opt=no; \\\n  sane_makeflags=$$MAKEFLAGS; \\\n  if $(am__is_gnu_make); then \\\n    sane_makeflags=$$MFLAGS; \\\n  else \\\n    case $$MAKEFLAGS in \\\n      *\\\\[\\ \\\t]*) \\\n        bs=\\\\; \\\n        sane_makeflags=`printf '%s\\n' \"$$MAKEFLAGS\" \\\n          | sed \"s/$$bs$$bs[$$bs $$bs\t]*//g\"`;; \\\n    esac; \\\n  fi; \\\n  skip_next=no; \\\n  strip_trailopt () \\\n  { \\\n    flg=`printf '%s\\n' \"$$flg\" | sed \"s/$$1.*$$//\"`; \\\n  }; \\\n  for flg in $$sane_makeflags; do \\\n    test $$skip_next = yes && { skip_next=no; continue; }; \\\n    case $$flg in \\\n      *=*|--*) continue;; \\\n        -*I) strip_trailopt 'I'; skip_next=yes;; \\\n      -*I?*) strip_trailopt 'I';; \\\n        -*O) strip_trailopt 'O'; skip_next=yes;; \\\n      -*O?*) strip_trailopt 'O';; \\\n        -*l) strip_trailopt 'l'; skip_next=yes;; \\\n      -*l?*) strip_trailopt 'l';; \\\n      -[dEDm]) skip_next=yes;; \\\n      -[JT]) skip_next=yes;; \\\n    esac; \\\n    case $$flg in \\\n      *$$target_option*) has_opt=yes; break;; \\\n    esac; \\\n  done; \\\n  test $$has_opt = yes\nam__make_dryrun = (target_option=n; $(am__make_running_with_option))\nam__make_keepgoing = (target_option=k; $(am__make_running_with_option))\npkgdatadir = $(datadir)/@PACKAGE@\npkgincludedir = $(includedir)/@PACKAGE@\npkglibdir = $(libdir)/@PACKAGE@\npkglibexecdir = $(libexecdir)/@PACKAGE@\nam__cd = CDPATH=\"$${ZSH_VERSION+.}$(PATH_SEPARATOR)\" && cd\ninstall_sh_DATA = $(install_sh) -c -m 644\ninstall_sh_PROGRAM = $(install_sh) -c\ninstall_sh_SCRIPT = $(install_sh) -c\nINSTALL_HEADER = $(INSTALL_DATA)\ntransform = $(program_transform_name)\nNORMAL_INSTALL = :\nPRE_INSTALL = :\nPOST_INSTALL = :\nNORMAL_UNINSTALL = :\nPRE_UNINSTALL = :\nPOST_UNINSTALL = :\nbuild_triplet = @build@\nhost_triplet = @host@\n@HAVE_BIN_TRUE@bin_PROGRAMS = farcompilestrings$(EXEEXT) \\\n@HAVE_BIN_TRUE@\tfarcreate$(EXEEXT) farequal$(EXEEXT) \\\n@HAVE_BIN_TRUE@\tfarextract$(EXEEXT) farinfo$(EXEEXT) \\\n@HAVE_BIN_TRUE@\tfarisomorphic$(EXEEXT) farprintstrings$(EXEEXT)\nsubdir = src/extensions/far\nACLOCAL_M4 = $(top_srcdir)/aclocal.m4\nam__aclocal_m4_deps = $(top_srcdir)/m4/ac_python_devel.m4 \\\n\t$(top_srcdir)/m4/libtool.m4 $(top_srcdir)/m4/ltoptions.m4 \\\n\t$(top_srcdir)/m4/ltsugar.m4 $(top_srcdir)/m4/ltversion.m4 \\\n\t$(top_srcdir)/m4/lt~obsolete.m4 $(top_srcdir)/configure.ac\nam__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \\\n\t$(ACLOCAL_M4)\nDIST_COMMON = $(srcdir)/Makefile.am $(am__DIST_COMMON)\nmkinstalldirs = $(install_sh) -d\nCONFIG_HEADER = $(top_builddir)/config.h \\\n\t$(top_builddir)/src/include/fst/config.h\nCONFIG_CLEAN_FILES =\nCONFIG_CLEAN_VPATH_FILES =\nam__vpath_adj_setup = srcdirstrip=`echo \"$(srcdir)\" | sed 's|.|.|g'`;\nam__vpath_adj = case $$p in \\\n    $(srcdir)/*) f=`echo \"$$p\" | sed \"s|^$$srcdirstrip/||\"`;; \\\n    *) f=$$p;; \\\n  esac;\nam__strip_dir = f=`echo $$p | sed -e 's|^.*/||'`;\nam__install_max = 40\nam__nobase_strip_setup = \\\n  srcdirstrip=`echo \"$(srcdir)\" | sed 's/[].[^$$\\\\*|]/\\\\\\\\&/g'`\nam__nobase_strip = \\\n  for p in $$list; do echo \"$$p\"; done | sed -e \"s|$$srcdirstrip/||\"\nam__nobase_list = $(am__nobase_strip_setup); \\\n  for p in $$list; do echo \"$$p $$p\"; done | \\\n  sed \"s| $$srcdirstrip/| |;\"' / .*\\//!s/ .*/ ./; s,\\( .*\\)/[^/]*$$,\\1,' | \\\n  $(AWK) 'BEGIN { files[\".\"] = \"\" } { files[$$2] = files[$$2] \" \" $$1; \\\n    if (++n[$$2] == $(am__install_max)) \\\n      { print $$2, files[$$2]; n[$$2] = 0; files[$$2] = \"\" } } \\\n    END { for (dir in files) print dir, files[dir] }'\nam__base_list = \\\n  sed '$$!N;$$!N;$$!N;$$!N;$$!N;$$!N;$$!N;s/\\n/ /g' | \\\n  sed '$$!N;$$!N;$$!N;$$!N;s/\\n/ /g'\nam__uninstall_files_from_dir = { \\\n  test -z \"$$files\" \\\n    || { test ! -d \"$$dir\" && test ! -f \"$$dir\" && test ! -r \"$$dir\"; } \\\n    || { echo \" ( cd '$$dir' && rm -f\" $$files \")\"; \\\n         $(am__cd) \"$$dir\" && rm -f $$files; }; \\\n  }\nam__installdirs = \"$(DESTDIR)$(libdir)\" \"$(DESTDIR)$(bindir)\"\nLTLIBRARIES = $(lib_LTLIBRARIES)\nam__DEPENDENCIES_1 =\nlibfstfar_la_DEPENDENCIES = ../../lib/libfst.la $(am__DEPENDENCIES_1)\nam_libfstfar_la_OBJECTS = sttable.lo stlist.lo\nlibfstfar_la_OBJECTS = $(am_libfstfar_la_OBJECTS)\nAM_V_lt = $(am__v_lt_@AM_V@)\nam__v_lt_ = $(am__v_lt_@AM_DEFAULT_V@)\nam__v_lt_0 = --silent\nam__v_lt_1 = \nlibfstfar_la_LINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \\\n\t$(LIBTOOLFLAGS) --mode=link $(CXXLD) $(AM_CXXFLAGS) \\\n\t$(CXXFLAGS) $(libfstfar_la_LDFLAGS) $(LDFLAGS) -o $@\n@HAVE_SCRIPT_FALSE@am_libfstfar_la_rpath = -rpath $(libdir)\n@HAVE_SCRIPT_TRUE@am_libfstfar_la_rpath = -rpath $(libdir)\n@HAVE_SCRIPT_TRUE@libfstfarscript_la_DEPENDENCIES = libfstfar.la \\\n@HAVE_SCRIPT_TRUE@\t../../script/libfstscript.la \\\n@HAVE_SCRIPT_TRUE@\t../../lib/libfst.la $(am__DEPENDENCIES_1)\nam__libfstfarscript_la_SOURCES_DIST = far-class.cc farscript.cc \\\n\tgetters.cc script-impl.cc strings.cc\n@HAVE_SCRIPT_TRUE@am_libfstfarscript_la_OBJECTS = far-class.lo \\\n@HAVE_SCRIPT_TRUE@\tfarscript.lo getters.lo script-impl.lo \\\n@HAVE_SCRIPT_TRUE@\tstrings.lo\nlibfstfarscript_la_OBJECTS = $(am_libfstfarscript_la_OBJECTS)\nlibfstfarscript_la_LINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX \\\n\t$(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=link $(CXXLD) \\\n\t$(AM_CXXFLAGS) $(CXXFLAGS) $(libfstfarscript_la_LDFLAGS) \\\n\t$(LDFLAGS) -o $@\n@HAVE_SCRIPT_TRUE@am_libfstfarscript_la_rpath = -rpath $(libdir)\nPROGRAMS = $(bin_PROGRAMS)\nam__farcompilestrings_SOURCES_DIST = farcompilestrings.cc\n@HAVE_BIN_TRUE@am_farcompilestrings_OBJECTS =  \\\n@HAVE_BIN_TRUE@\tfarcompilestrings.$(OBJEXT)\nfarcompilestrings_OBJECTS = $(am_farcompilestrings_OBJECTS)\nfarcompilestrings_LDADD = $(LDADD)\n@HAVE_BIN_TRUE@farcompilestrings_DEPENDENCIES = libfstfarscript.la \\\n@HAVE_BIN_TRUE@\t../../script/libfstscript.la \\\n@HAVE_BIN_TRUE@\t../../lib/libfst.la $(am__DEPENDENCIES_1)\nam__farcreate_SOURCES_DIST = farcreate.cc\n@HAVE_BIN_TRUE@am_farcreate_OBJECTS = farcreate.$(OBJEXT)\nfarcreate_OBJECTS = $(am_farcreate_OBJECTS)\nfarcreate_LDADD = $(LDADD)\n@HAVE_BIN_TRUE@farcreate_DEPENDENCIES = libfstfarscript.la \\\n@HAVE_BIN_TRUE@\t../../script/libfstscript.la \\\n@HAVE_BIN_TRUE@\t../../lib/libfst.la $(am__DEPENDENCIES_1)\nam__farequal_SOURCES_DIST = farequal.cc\n@HAVE_BIN_TRUE@am_farequal_OBJECTS = farequal.$(OBJEXT)\nfarequal_OBJECTS = $(am_farequal_OBJECTS)\nfarequal_LDADD = $(LDADD)\n@HAVE_BIN_TRUE@farequal_DEPENDENCIES = libfstfarscript.la \\\n@HAVE_BIN_TRUE@\t../../script/libfstscript.la \\\n@HAVE_BIN_TRUE@\t../../lib/libfst.la $(am__DEPENDENCIES_1)\nam__farextract_SOURCES_DIST = farextract.cc\n@HAVE_BIN_TRUE@am_farextract_OBJECTS = farextract.$(OBJEXT)\nfarextract_OBJECTS = $(am_farextract_OBJECTS)\nfarextract_LDADD = $(LDADD)\n@HAVE_BIN_TRUE@farextract_DEPENDENCIES = libfstfarscript.la \\\n@HAVE_BIN_TRUE@\t../../script/libfstscript.la \\\n@HAVE_BIN_TRUE@\t../../lib/libfst.la $(am__DEPENDENCIES_1)\nam__farinfo_SOURCES_DIST = farinfo.cc\n@HAVE_BIN_TRUE@am_farinfo_OBJECTS = farinfo.$(OBJEXT)\nfarinfo_OBJECTS = $(am_farinfo_OBJECTS)\nfarinfo_LDADD = $(LDADD)\n@HAVE_BIN_TRUE@farinfo_DEPENDENCIES = libfstfarscript.la \\\n@HAVE_BIN_TRUE@\t../../script/libfstscript.la \\\n@HAVE_BIN_TRUE@\t../../lib/libfst.la $(am__DEPENDENCIES_1)\nam__farisomorphic_SOURCES_DIST = farisomorphic.cc\n@HAVE_BIN_TRUE@am_farisomorphic_OBJECTS = farisomorphic.$(OBJEXT)\nfarisomorphic_OBJECTS = $(am_farisomorphic_OBJECTS)\nfarisomorphic_LDADD = $(LDADD)\n@HAVE_BIN_TRUE@farisomorphic_DEPENDENCIES = libfstfarscript.la \\\n@HAVE_BIN_TRUE@\t../../script/libfstscript.la \\\n@HAVE_BIN_TRUE@\t../../lib/libfst.la $(am__DEPENDENCIES_1)\nam__farprintstrings_SOURCES_DIST = farprintstrings.cc\n@HAVE_BIN_TRUE@am_farprintstrings_OBJECTS = farprintstrings.$(OBJEXT)\nfarprintstrings_OBJECTS = $(am_farprintstrings_OBJECTS)\nfarprintstrings_LDADD = $(LDADD)\n@HAVE_BIN_TRUE@farprintstrings_DEPENDENCIES = libfstfarscript.la \\\n@HAVE_BIN_TRUE@\t../../script/libfstscript.la \\\n@HAVE_BIN_TRUE@\t../../lib/libfst.la $(am__DEPENDENCIES_1)\nAM_V_P = $(am__v_P_@AM_V@)\nam__v_P_ = $(am__v_P_@AM_DEFAULT_V@)\nam__v_P_0 = false\nam__v_P_1 = :\nAM_V_GEN = $(am__v_GEN_@AM_V@)\nam__v_GEN_ = $(am__v_GEN_@AM_DEFAULT_V@)\nam__v_GEN_0 = @echo \"  GEN     \" $@;\nam__v_GEN_1 = \nAM_V_at = $(am__v_at_@AM_V@)\nam__v_at_ = $(am__v_at_@AM_DEFAULT_V@)\nam__v_at_0 = @\nam__v_at_1 = \nDEFAULT_INCLUDES = \ndepcomp = $(SHELL) $(top_srcdir)/depcomp\nam__depfiles_maybe = depfiles\nam__mv = mv -f\nCXXCOMPILE = $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) \\\n\t$(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS)\nLTCXXCOMPILE = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \\\n\t$(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) \\\n\t$(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) \\\n\t$(AM_CXXFLAGS) $(CXXFLAGS)\nAM_V_CXX = $(am__v_CXX_@AM_V@)\nam__v_CXX_ = $(am__v_CXX_@AM_DEFAULT_V@)\nam__v_CXX_0 = @echo \"  CXX     \" $@;\nam__v_CXX_1 = \nCXXLD = $(CXX)\nCXXLINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \\\n\t$(LIBTOOLFLAGS) --mode=link $(CXXLD) $(AM_CXXFLAGS) \\\n\t$(CXXFLAGS) $(AM_LDFLAGS) $(LDFLAGS) -o $@\nAM_V_CXXLD = $(am__v_CXXLD_@AM_V@)\nam__v_CXXLD_ = $(am__v_CXXLD_@AM_DEFAULT_V@)\nam__v_CXXLD_0 = @echo \"  CXXLD   \" $@;\nam__v_CXXLD_1 = \nSOURCES = $(libfstfar_la_SOURCES) $(libfstfarscript_la_SOURCES) \\\n\t$(farcompilestrings_SOURCES) $(farcreate_SOURCES) \\\n\t$(farequal_SOURCES) $(farextract_SOURCES) $(farinfo_SOURCES) \\\n\t$(farisomorphic_SOURCES) $(farprintstrings_SOURCES)\nDIST_SOURCES = $(libfstfar_la_SOURCES) \\\n\t$(am__libfstfarscript_la_SOURCES_DIST) \\\n\t$(am__farcompilestrings_SOURCES_DIST) \\\n\t$(am__farcreate_SOURCES_DIST) $(am__farequal_SOURCES_DIST) \\\n\t$(am__farextract_SOURCES_DIST) $(am__farinfo_SOURCES_DIST) \\\n\t$(am__farisomorphic_SOURCES_DIST) \\\n\t$(am__farprintstrings_SOURCES_DIST)\nam__can_run_installinfo = \\\n  case $$AM_UPDATE_INFO_DIR in \\\n    n|no|NO) false;; \\\n    *) (install-info --version) >/dev/null 2>&1;; \\\n  esac\nam__tagged_files = $(HEADERS) $(SOURCES) $(TAGS_FILES) $(LISP)\n# Read a list of newline-separated strings from the standard input,\n# and print each of them once, without duplicates.  Input order is\n# *not* preserved.\nam__uniquify_input = $(AWK) '\\\n  BEGIN { nonempty = 0; } \\\n  { items[$$0] = 1; nonempty = 1; } \\\n  END { if (nonempty) { for (i in items) print i; }; } \\\n'\n# Make sure the list of sources is unique.  This is necessary because,\n# e.g., the same source file might be shared among _SOURCES variables\n# for different programs/libraries.\nam__define_uniq_tagged_files = \\\n  list='$(am__tagged_files)'; \\\n  unique=`for i in $$list; do \\\n    if test -f \"$$i\"; then echo $$i; else echo $(srcdir)/$$i; fi; \\\n  done | $(am__uniquify_input)`\nETAGS = etags\nCTAGS = ctags\nam__DIST_COMMON = $(srcdir)/Makefile.in $(top_srcdir)/depcomp\nDISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST)\nACLOCAL = @ACLOCAL@\nAMTAR = @AMTAR@\nAM_DEFAULT_VERBOSITY = @AM_DEFAULT_VERBOSITY@\nAR = @AR@\nAUTOCONF = @AUTOCONF@\nAUTOHEADER = @AUTOHEADER@\nAUTOMAKE = @AUTOMAKE@\nAWK = @AWK@\nCC = @CC@\nCCDEPMODE = @CCDEPMODE@\nCFLAGS = @CFLAGS@\nCPP = @CPP@\nCPPFLAGS = @CPPFLAGS@\nCXX = @CXX@\nCXXCPP = @CXXCPP@\nCXXDEPMODE = @CXXDEPMODE@\nCXXFLAGS = @CXXFLAGS@\nCYGPATH_W = @CYGPATH_W@\nDEFS = @DEFS@\nDEPDIR = @DEPDIR@\nDLLTOOL = @DLLTOOL@\nDL_LIBS = @DL_LIBS@\nDSYMUTIL = @DSYMUTIL@\nDUMPBIN = @DUMPBIN@\nECHO_C = @ECHO_C@\nECHO_N = @ECHO_N@\nECHO_T = @ECHO_T@\nEGREP = @EGREP@\nEXEEXT = @EXEEXT@\nFGREP = @FGREP@\nGREP = @GREP@\nINSTALL = @INSTALL@\nINSTALL_DATA = @INSTALL_DATA@\nINSTALL_PROGRAM = @INSTALL_PROGRAM@\nINSTALL_SCRIPT = @INSTALL_SCRIPT@\nINSTALL_STRIP_PROGRAM = @INSTALL_STRIP_PROGRAM@\nLD = @LD@\nLDFLAGS = @LDFLAGS@\nLIBOBJS = @LIBOBJS@\nLIBS = @LIBS@\nLIBTOOL = @LIBTOOL@\nLIPO = @LIPO@\nLN_S = @LN_S@\nLTLIBOBJS = @LTLIBOBJS@\nLT_SYS_LIBRARY_PATH = @LT_SYS_LIBRARY_PATH@\nMAKEINFO = @MAKEINFO@\nMANIFEST_TOOL = @MANIFEST_TOOL@\nMKDIR_P = @MKDIR_P@\nNM = @NM@\nNMEDIT = @NMEDIT@\nOBJDUMP = @OBJDUMP@\nOBJEXT = @OBJEXT@\nOTOOL = @OTOOL@\nOTOOL64 = @OTOOL64@\nPACKAGE = @PACKAGE@\nPACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@\nPACKAGE_NAME = @PACKAGE_NAME@\nPACKAGE_STRING = @PACKAGE_STRING@\nPACKAGE_TARNAME = @PACKAGE_TARNAME@\nPACKAGE_URL = @PACKAGE_URL@\nPACKAGE_VERSION = @PACKAGE_VERSION@\nPATH_SEPARATOR = @PATH_SEPARATOR@\nPYTHON = @PYTHON@\nPYTHON_CPPFLAGS = @PYTHON_CPPFLAGS@\nPYTHON_EXEC_PREFIX = @PYTHON_EXEC_PREFIX@\nPYTHON_EXTRA_LDFLAGS = @PYTHON_EXTRA_LDFLAGS@\nPYTHON_EXTRA_LIBS = @PYTHON_EXTRA_LIBS@\nPYTHON_LDFLAGS = @PYTHON_LDFLAGS@\nPYTHON_PLATFORM = @PYTHON_PLATFORM@\nPYTHON_PREFIX = @PYTHON_PREFIX@\nPYTHON_SITE_PKG = @PYTHON_SITE_PKG@\nPYTHON_VERSION = @PYTHON_VERSION@\nRANLIB = @RANLIB@\nSED = @SED@\nSET_MAKE = @SET_MAKE@\nSHELL = @SHELL@\nSTRIP = @STRIP@\nVERSION = @VERSION@\nabs_builddir = @abs_builddir@\nabs_srcdir = @abs_srcdir@\nabs_top_builddir = @abs_top_builddir@\nabs_top_srcdir = @abs_top_srcdir@\nac_ct_AR = @ac_ct_AR@\nac_ct_CC = @ac_ct_CC@\nac_ct_CXX = @ac_ct_CXX@\nac_ct_DUMPBIN = @ac_ct_DUMPBIN@\nam__include = @am__include@\nam__leading_dot = @am__leading_dot@\nam__quote = @am__quote@\nam__tar = @am__tar@\nam__untar = @am__untar@\nbindir = @bindir@\nbuild = @build@\nbuild_alias = @build_alias@\nbuild_cpu = @build_cpu@\nbuild_os = @build_os@\nbuild_vendor = @build_vendor@\nbuilddir = @builddir@\ndatadir = @datadir@\ndatarootdir = @datarootdir@\ndocdir = @docdir@\ndvidir = @dvidir@\nexec_prefix = @exec_prefix@\nhost = @host@\nhost_alias = @host_alias@\nhost_cpu = @host_cpu@\nhost_os = @host_os@\nhost_vendor = @host_vendor@\nhtmldir = @htmldir@\nincludedir = @includedir@\ninfodir = @infodir@\ninstall_sh = @install_sh@\nlibdir = @libdir@\nlibexecdir = @libexecdir@\nlibfstdir = @libfstdir@\nlocaledir = @localedir@\nlocalstatedir = @localstatedir@\nmandir = @mandir@\nmkdir_p = @mkdir_p@\noldincludedir = @oldincludedir@\npdfdir = @pdfdir@\npkgpyexecdir = @pkgpyexecdir@\npkgpythondir = @pkgpythondir@\nprefix = @prefix@\nprogram_transform_name = @program_transform_name@\npsdir = @psdir@\npyexecdir = @pyexecdir@\npythondir = @pythondir@\nrunstatedir = @runstatedir@\nsbindir = @sbindir@\nsharedstatedir = @sharedstatedir@\nsrcdir = @srcdir@\nsysconfdir = @sysconfdir@\ntarget_alias = @target_alias@\ntop_build_prefix = @top_build_prefix@\ntop_builddir = @top_builddir@\ntop_srcdir = @top_srcdir@\nAM_CPPFLAGS = -I$(srcdir)/../../include $(ICU_CPPFLAGS)\n@HAVE_SCRIPT_FALSE@lib_LTLIBRARIES = libfstfar.la\n@HAVE_SCRIPT_TRUE@lib_LTLIBRARIES = libfstfar.la libfstfarscript.la\nlibfstfar_la_SOURCES = sttable.cc stlist.cc\nlibfstfar_la_LDFLAGS = -version-info 13:0:0\nlibfstfar_la_LIBADD = ../../lib/libfst.la -lm $(DL_LIBS)\n@HAVE_SCRIPT_TRUE@libfstfarscript_la_SOURCES = far-class.cc farscript.cc getters.cc script-impl.cc \\\n@HAVE_SCRIPT_TRUE@                             strings.cc\n\n@HAVE_SCRIPT_TRUE@libfstfarscript_la_LDFLAGS = -version-info 13:0:0\n@HAVE_SCRIPT_TRUE@libfstfarscript_la_LIBADD = \\\n@HAVE_SCRIPT_TRUE@    libfstfar.la ../../script/libfstscript.la \\\n@HAVE_SCRIPT_TRUE@        ../../lib/libfst.la -lm $(DL_LIBS)\n\n@HAVE_BIN_TRUE@LDADD = libfstfarscript.la ../../script/libfstscript.la \\\n@HAVE_BIN_TRUE@        ../../lib/libfst.la -lm $(DL_LIBS)\n\n@HAVE_BIN_TRUE@farcompilestrings_SOURCES = farcompilestrings.cc\n@HAVE_BIN_TRUE@farcreate_SOURCES = farcreate.cc\n@HAVE_BIN_TRUE@farequal_SOURCES = farequal.cc\n@HAVE_BIN_TRUE@farextract_SOURCES = farextract.cc\n@HAVE_BIN_TRUE@farinfo_SOURCES = farinfo.cc\n@HAVE_BIN_TRUE@farisomorphic_SOURCES = farisomorphic.cc\n@HAVE_BIN_TRUE@farprintstrings_SOURCES = farprintstrings.cc\nall: all-am\n\n.SUFFIXES:\n.SUFFIXES: .cc .lo .o .obj\n$(srcdir)/Makefile.in:  $(srcdir)/Makefile.am  $(am__configure_deps)\n\t@for dep in $?; do \\\n\t  case '$(am__configure_deps)' in \\\n\t    *$$dep*) \\\n\t      ( cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh ) \\\n\t        && { if test -f $@; then exit 0; else break; fi; }; \\\n\t      exit 1;; \\\n\t  esac; \\\n\tdone; \\\n\techo ' cd $(top_srcdir) && $(AUTOMAKE) --foreign src/extensions/far/Makefile'; \\\n\t$(am__cd) $(top_srcdir) && \\\n\t  $(AUTOMAKE) --foreign src/extensions/far/Makefile\nMakefile: $(srcdir)/Makefile.in $(top_builddir)/config.status\n\t@case '$?' in \\\n\t  *config.status*) \\\n\t    cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh;; \\\n\t  *) \\\n\t    echo ' cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe)'; \\\n\t    cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe);; \\\n\tesac;\n\n$(top_builddir)/config.status: $(top_srcdir)/configure $(CONFIG_STATUS_DEPENDENCIES)\n\tcd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh\n\n$(top_srcdir)/configure:  $(am__configure_deps)\n\tcd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh\n$(ACLOCAL_M4):  $(am__aclocal_m4_deps)\n\tcd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh\n$(am__aclocal_m4_deps):\n\ninstall-libLTLIBRARIES: $(lib_LTLIBRARIES)\n\t@$(NORMAL_INSTALL)\n\t@list='$(lib_LTLIBRARIES)'; test -n \"$(libdir)\" || list=; \\\n\tlist2=; for p in $$list; do \\\n\t  if test -f $$p; then \\\n\t    list2=\"$$list2 $$p\"; \\\n\t  else :; fi; \\\n\tdone; \\\n\ttest -z \"$$list2\" || { \\\n\t  echo \" $(MKDIR_P) '$(DESTDIR)$(libdir)'\"; \\\n\t  $(MKDIR_P) \"$(DESTDIR)$(libdir)\" || exit 1; \\\n\t  echo \" $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) $$list2 '$(DESTDIR)$(libdir)'\"; \\\n\t  $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) $$list2 \"$(DESTDIR)$(libdir)\"; \\\n\t}\n\nuninstall-libLTLIBRARIES:\n\t@$(NORMAL_UNINSTALL)\n\t@list='$(lib_LTLIBRARIES)'; test -n \"$(libdir)\" || list=; \\\n\tfor p in $$list; do \\\n\t  $(am__strip_dir) \\\n\t  echo \" $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=uninstall rm -f '$(DESTDIR)$(libdir)/$$f'\"; \\\n\t  $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=uninstall rm -f \"$(DESTDIR)$(libdir)/$$f\"; \\\n\tdone\n\nclean-libLTLIBRARIES:\n\t-test -z \"$(lib_LTLIBRARIES)\" || rm -f $(lib_LTLIBRARIES)\n\t@list='$(lib_LTLIBRARIES)'; \\\n\tlocs=`for p in $$list; do echo $$p; done | \\\n\t      sed 's|^[^/]*$$|.|; s|/[^/]*$$||; s|$$|/so_locations|' | \\\n\t      sort -u`; \\\n\ttest -z \"$$locs\" || { \\\n\t  echo rm -f $${locs}; \\\n\t  rm -f $${locs}; \\\n\t}\n\nlibfstfar.la: $(libfstfar_la_OBJECTS) $(libfstfar_la_DEPENDENCIES) $(EXTRA_libfstfar_la_DEPENDENCIES) \n\t$(AM_V_CXXLD)$(libfstfar_la_LINK) $(am_libfstfar_la_rpath) $(libfstfar_la_OBJECTS) $(libfstfar_la_LIBADD) $(LIBS)\n\nlibfstfarscript.la: $(libfstfarscript_la_OBJECTS) $(libfstfarscript_la_DEPENDENCIES) $(EXTRA_libfstfarscript_la_DEPENDENCIES) \n\t$(AM_V_CXXLD)$(libfstfarscript_la_LINK) $(am_libfstfarscript_la_rpath) $(libfstfarscript_la_OBJECTS) $(libfstfarscript_la_LIBADD) $(LIBS)\ninstall-binPROGRAMS: $(bin_PROGRAMS)\n\t@$(NORMAL_INSTALL)\n\t@list='$(bin_PROGRAMS)'; test -n \"$(bindir)\" || list=; \\\n\tif test -n \"$$list\"; then \\\n\t  echo \" $(MKDIR_P) '$(DESTDIR)$(bindir)'\"; \\\n\t  $(MKDIR_P) \"$(DESTDIR)$(bindir)\" || exit 1; \\\n\tfi; \\\n\tfor p in $$list; do echo \"$$p $$p\"; done | \\\n\tsed 's/$(EXEEXT)$$//' | \\\n\twhile read p p1; do if test -f $$p \\\n\t || test -f $$p1 \\\n\t  ; then echo \"$$p\"; echo \"$$p\"; else :; fi; \\\n\tdone | \\\n\tsed -e 'p;s,.*/,,;n;h' \\\n\t    -e 's|.*|.|' \\\n\t    -e 'p;x;s,.*/,,;s/$(EXEEXT)$$//;$(transform);s/$$/$(EXEEXT)/' | \\\n\tsed 'N;N;N;s,\\n, ,g' | \\\n\t$(AWK) 'BEGIN { files[\".\"] = \"\"; dirs[\".\"] = 1 } \\\n\t  { d=$$3; if (dirs[d] != 1) { print \"d\", d; dirs[d] = 1 } \\\n\t    if ($$2 == $$4) files[d] = files[d] \" \" $$1; \\\n\t    else { print \"f\", $$3 \"/\" $$4, $$1; } } \\\n\t  END { for (d in files) print \"f\", d, files[d] }' | \\\n\twhile read type dir files; do \\\n\t    if test \"$$dir\" = .; then dir=; else dir=/$$dir; fi; \\\n\t    test -z \"$$files\" || { \\\n\t    echo \" $(INSTALL_PROGRAM_ENV) $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL_PROGRAM) $$files '$(DESTDIR)$(bindir)$$dir'\"; \\\n\t    $(INSTALL_PROGRAM_ENV) $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL_PROGRAM) $$files \"$(DESTDIR)$(bindir)$$dir\" || exit $$?; \\\n\t    } \\\n\t; done\n\nuninstall-binPROGRAMS:\n\t@$(NORMAL_UNINSTALL)\n\t@list='$(bin_PROGRAMS)'; test -n \"$(bindir)\" || list=; \\\n\tfiles=`for p in $$list; do echo \"$$p\"; done | \\\n\t  sed -e 'h;s,^.*/,,;s/$(EXEEXT)$$//;$(transform)' \\\n\t      -e 's/$$/$(EXEEXT)/' \\\n\t`; \\\n\ttest -n \"$$list\" || exit 0; \\\n\techo \" ( cd '$(DESTDIR)$(bindir)' && rm -f\" $$files \")\"; \\\n\tcd \"$(DESTDIR)$(bindir)\" && rm -f $$files\n\nclean-binPROGRAMS:\n\t@list='$(bin_PROGRAMS)'; test -n \"$$list\" || exit 0; \\\n\techo \" rm -f\" $$list; \\\n\trm -f $$list || exit $$?; \\\n\ttest -n \"$(EXEEXT)\" || exit 0; \\\n\tlist=`for p in $$list; do echo \"$$p\"; done | sed 's/$(EXEEXT)$$//'`; \\\n\techo \" rm -f\" $$list; \\\n\trm -f $$list\n\nfarcompilestrings$(EXEEXT): $(farcompilestrings_OBJECTS) $(farcompilestrings_DEPENDENCIES) $(EXTRA_farcompilestrings_DEPENDENCIES) \n\t@rm -f farcompilestrings$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(farcompilestrings_OBJECTS) $(farcompilestrings_LDADD) $(LIBS)\n\nfarcreate$(EXEEXT): $(farcreate_OBJECTS) $(farcreate_DEPENDENCIES) $(EXTRA_farcreate_DEPENDENCIES) \n\t@rm -f farcreate$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(farcreate_OBJECTS) $(farcreate_LDADD) $(LIBS)\n\nfarequal$(EXEEXT): $(farequal_OBJECTS) $(farequal_DEPENDENCIES) $(EXTRA_farequal_DEPENDENCIES) \n\t@rm -f farequal$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(farequal_OBJECTS) $(farequal_LDADD) $(LIBS)\n\nfarextract$(EXEEXT): $(farextract_OBJECTS) $(farextract_DEPENDENCIES) $(EXTRA_farextract_DEPENDENCIES) \n\t@rm -f farextract$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(farextract_OBJECTS) $(farextract_LDADD) $(LIBS)\n\nfarinfo$(EXEEXT): $(farinfo_OBJECTS) $(farinfo_DEPENDENCIES) $(EXTRA_farinfo_DEPENDENCIES) \n\t@rm -f farinfo$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(farinfo_OBJECTS) $(farinfo_LDADD) $(LIBS)\n\nfarisomorphic$(EXEEXT): $(farisomorphic_OBJECTS) $(farisomorphic_DEPENDENCIES) $(EXTRA_farisomorphic_DEPENDENCIES) \n\t@rm -f farisomorphic$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(farisomorphic_OBJECTS) $(farisomorphic_LDADD) $(LIBS)\n\nfarprintstrings$(EXEEXT): $(farprintstrings_OBJECTS) $(farprintstrings_DEPENDENCIES) $(EXTRA_farprintstrings_DEPENDENCIES) \n\t@rm -f farprintstrings$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(farprintstrings_OBJECTS) $(farprintstrings_LDADD) $(LIBS)\n\nmostlyclean-compile:\n\t-rm -f *.$(OBJEXT)\n\ndistclean-compile:\n\t-rm -f *.tab.c\n\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/far-class.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/farcompilestrings.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/farcreate.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/farequal.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/farextract.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/farinfo.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/farisomorphic.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/farprintstrings.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/farscript.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/getters.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/script-impl.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/stlist.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/strings.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/sttable.Plo@am__quote@\n\n.cc.o:\n@am__fastdepCXX_TRUE@\t$(AM_V_CXX)depbase=`echo $@ | sed 's|[^/]*$$|$(DEPDIR)/&|;s|\\.o$$||'`;\\\n@am__fastdepCXX_TRUE@\t$(CXXCOMPILE) -MT $@ -MD -MP -MF $$depbase.Tpo -c -o $@ $< &&\\\n@am__fastdepCXX_TRUE@\t$(am__mv) $$depbase.Tpo $$depbase.Po\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\t$(AM_V_CXX)source='$<' object='$@' libtool=no @AMDEPBACKSLASH@\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\tDEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@\n@am__fastdepCXX_FALSE@\t$(AM_V_CXX@am__nodep@)$(CXXCOMPILE) -c -o $@ $<\n\n.cc.obj:\n@am__fastdepCXX_TRUE@\t$(AM_V_CXX)depbase=`echo $@ | sed 's|[^/]*$$|$(DEPDIR)/&|;s|\\.obj$$||'`;\\\n@am__fastdepCXX_TRUE@\t$(CXXCOMPILE) -MT $@ -MD -MP -MF $$depbase.Tpo -c -o $@ `$(CYGPATH_W) '$<'` &&\\\n@am__fastdepCXX_TRUE@\t$(am__mv) $$depbase.Tpo $$depbase.Po\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\t$(AM_V_CXX)source='$<' object='$@' libtool=no @AMDEPBACKSLASH@\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\tDEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@\n@am__fastdepCXX_FALSE@\t$(AM_V_CXX@am__nodep@)$(CXXCOMPILE) -c -o $@ `$(CYGPATH_W) '$<'`\n\n.cc.lo:\n@am__fastdepCXX_TRUE@\t$(AM_V_CXX)depbase=`echo $@ | sed 's|[^/]*$$|$(DEPDIR)/&|;s|\\.lo$$||'`;\\\n@am__fastdepCXX_TRUE@\t$(LTCXXCOMPILE) -MT $@ -MD -MP -MF $$depbase.Tpo -c -o $@ $< &&\\\n@am__fastdepCXX_TRUE@\t$(am__mv) $$depbase.Tpo $$depbase.Plo\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\t$(AM_V_CXX)source='$<' object='$@' libtool=yes @AMDEPBACKSLASH@\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\tDEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@\n@am__fastdepCXX_FALSE@\t$(AM_V_CXX@am__nodep@)$(LTCXXCOMPILE) -c -o $@ $<\n\nmostlyclean-libtool:\n\t-rm -f *.lo\n\nclean-libtool:\n\t-rm -rf .libs _libs\n\nID: $(am__tagged_files)\n\t$(am__define_uniq_tagged_files); mkid -fID $$unique\ntags: tags-am\nTAGS: tags\n\ntags-am: $(TAGS_DEPENDENCIES) $(am__tagged_files)\n\tset x; \\\n\there=`pwd`; \\\n\t$(am__define_uniq_tagged_files); \\\n\tshift; \\\n\tif test -z \"$(ETAGS_ARGS)$$*$$unique\"; then :; else \\\n\t  test -n \"$$unique\" || unique=$$empty_fix; \\\n\t  if test $$# -gt 0; then \\\n\t    $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \\\n\t      \"$$@\" $$unique; \\\n\t  else \\\n\t    $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \\\n\t      $$unique; \\\n\t  fi; \\\n\tfi\nctags: ctags-am\n\nCTAGS: ctags\nctags-am: $(TAGS_DEPENDENCIES) $(am__tagged_files)\n\t$(am__define_uniq_tagged_files); \\\n\ttest -z \"$(CTAGS_ARGS)$$unique\" \\\n\t  || $(CTAGS) $(CTAGSFLAGS) $(AM_CTAGSFLAGS) $(CTAGS_ARGS) \\\n\t     $$unique\n\nGTAGS:\n\there=`$(am__cd) $(top_builddir) && pwd` \\\n\t  && $(am__cd) $(top_srcdir) \\\n\t  && gtags -i $(GTAGS_ARGS) \"$$here\"\ncscopelist: cscopelist-am\n\ncscopelist-am: $(am__tagged_files)\n\tlist='$(am__tagged_files)'; \\\n\tcase \"$(srcdir)\" in \\\n\t  [\\\\/]* | ?:[\\\\/]*) sdir=\"$(srcdir)\" ;; \\\n\t  *) sdir=$(subdir)/$(srcdir) ;; \\\n\tesac; \\\n\tfor i in $$list; do \\\n\t  if test -f \"$$i\"; then \\\n\t    echo \"$(subdir)/$$i\"; \\\n\t  else \\\n\t    echo \"$$sdir/$$i\"; \\\n\t  fi; \\\n\tdone >> $(top_builddir)/cscope.files\n\ndistclean-tags:\n\t-rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags\n\ndistdir: $(DISTFILES)\n\t@srcdirstrip=`echo \"$(srcdir)\" | sed 's/[].[^$$\\\\*]/\\\\\\\\&/g'`; \\\n\ttopsrcdirstrip=`echo \"$(top_srcdir)\" | sed 's/[].[^$$\\\\*]/\\\\\\\\&/g'`; \\\n\tlist='$(DISTFILES)'; \\\n\t  dist_files=`for file in $$list; do echo $$file; done | \\\n\t  sed -e \"s|^$$srcdirstrip/||;t\" \\\n\t      -e \"s|^$$topsrcdirstrip/|$(top_builddir)/|;t\"`; \\\n\tcase $$dist_files in \\\n\t  */*) $(MKDIR_P) `echo \"$$dist_files\" | \\\n\t\t\t   sed '/\\//!d;s|^|$(distdir)/|;s,/[^/]*$$,,' | \\\n\t\t\t   sort -u` ;; \\\n\tesac; \\\n\tfor file in $$dist_files; do \\\n\t  if test -f $$file || test -d $$file; then d=.; else d=$(srcdir); fi; \\\n\t  if test -d $$d/$$file; then \\\n\t    dir=`echo \"/$$file\" | sed -e 's,/[^/]*$$,,'`; \\\n\t    if test -d \"$(distdir)/$$file\"; then \\\n\t      find \"$(distdir)/$$file\" -type d ! -perm -700 -exec chmod u+rwx {} \\;; \\\n\t    fi; \\\n\t    if test -d $(srcdir)/$$file && test $$d != $(srcdir); then \\\n\t      cp -fpR $(srcdir)/$$file \"$(distdir)$$dir\" || exit 1; \\\n\t      find \"$(distdir)/$$file\" -type d ! -perm -700 -exec chmod u+rwx {} \\;; \\\n\t    fi; \\\n\t    cp -fpR $$d/$$file \"$(distdir)$$dir\" || exit 1; \\\n\t  else \\\n\t    test -f \"$(distdir)/$$file\" \\\n\t    || cp -p $$d/$$file \"$(distdir)/$$file\" \\\n\t    || exit 1; \\\n\t  fi; \\\n\tdone\ncheck-am: all-am\ncheck: check-am\nall-am: Makefile $(LTLIBRARIES) $(PROGRAMS)\ninstall-binPROGRAMS: install-libLTLIBRARIES\n\ninstalldirs:\n\tfor dir in \"$(DESTDIR)$(libdir)\" \"$(DESTDIR)$(bindir)\"; do \\\n\t  test -z \"$$dir\" || $(MKDIR_P) \"$$dir\"; \\\n\tdone\ninstall: install-am\ninstall-exec: install-exec-am\ninstall-data: install-data-am\nuninstall: uninstall-am\n\ninstall-am: all-am\n\t@$(MAKE) $(AM_MAKEFLAGS) install-exec-am install-data-am\n\ninstallcheck: installcheck-am\ninstall-strip:\n\tif test -z '$(STRIP)'; then \\\n\t  $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" \\\n\t    install_sh_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" INSTALL_STRIP_FLAG=-s \\\n\t      install; \\\n\telse \\\n\t  $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" \\\n\t    install_sh_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" INSTALL_STRIP_FLAG=-s \\\n\t    \"INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'\" install; \\\n\tfi\nmostlyclean-generic:\n\nclean-generic:\n\ndistclean-generic:\n\t-test -z \"$(CONFIG_CLEAN_FILES)\" || rm -f $(CONFIG_CLEAN_FILES)\n\t-test . = \"$(srcdir)\" || test -z \"$(CONFIG_CLEAN_VPATH_FILES)\" || rm -f $(CONFIG_CLEAN_VPATH_FILES)\n\nmaintainer-clean-generic:\n\t@echo \"This command is intended for maintainers to use\"\n\t@echo \"it deletes files that may require special tools to rebuild.\"\nclean: clean-am\n\nclean-am: clean-binPROGRAMS clean-generic clean-libLTLIBRARIES \\\n\tclean-libtool mostlyclean-am\n\ndistclean: distclean-am\n\t-rm -rf ./$(DEPDIR)\n\t-rm -f Makefile\ndistclean-am: clean-am distclean-compile distclean-generic \\\n\tdistclean-tags\n\ndvi: dvi-am\n\ndvi-am:\n\nhtml: html-am\n\nhtml-am:\n\ninfo: info-am\n\ninfo-am:\n\ninstall-data-am:\n\ninstall-dvi: install-dvi-am\n\ninstall-dvi-am:\n\ninstall-exec-am: install-binPROGRAMS install-libLTLIBRARIES\n\ninstall-html: install-html-am\n\ninstall-html-am:\n\ninstall-info: install-info-am\n\ninstall-info-am:\n\ninstall-man:\n\ninstall-pdf: install-pdf-am\n\ninstall-pdf-am:\n\ninstall-ps: install-ps-am\n\ninstall-ps-am:\n\ninstallcheck-am:\n\nmaintainer-clean: maintainer-clean-am\n\t-rm -rf ./$(DEPDIR)\n\t-rm -f Makefile\nmaintainer-clean-am: distclean-am maintainer-clean-generic\n\nmostlyclean: mostlyclean-am\n\nmostlyclean-am: mostlyclean-compile mostlyclean-generic \\\n\tmostlyclean-libtool\n\npdf: pdf-am\n\npdf-am:\n\nps: ps-am\n\nps-am:\n\nuninstall-am: uninstall-binPROGRAMS uninstall-libLTLIBRARIES\n\n.MAKE: install-am install-strip\n\n.PHONY: CTAGS GTAGS TAGS all all-am check check-am clean \\\n\tclean-binPROGRAMS clean-generic clean-libLTLIBRARIES \\\n\tclean-libtool cscopelist-am ctags ctags-am distclean \\\n\tdistclean-compile distclean-generic distclean-libtool \\\n\tdistclean-tags distdir dvi dvi-am html html-am info info-am \\\n\tinstall install-am install-binPROGRAMS install-data \\\n\tinstall-data-am install-dvi install-dvi-am install-exec \\\n\tinstall-exec-am install-html install-html-am install-info \\\n\tinstall-info-am install-libLTLIBRARIES install-man install-pdf \\\n\tinstall-pdf-am install-ps install-ps-am install-strip \\\n\tinstallcheck installcheck-am installdirs maintainer-clean \\\n\tmaintainer-clean-generic mostlyclean mostlyclean-compile \\\n\tmostlyclean-generic mostlyclean-libtool pdf pdf-am ps ps-am \\\n\ttags tags-am uninstall uninstall-am uninstall-binPROGRAMS \\\n\tuninstall-libLTLIBRARIES\n\n.PRECIOUS: Makefile\n\n\n# Tell versions [3.59,3.63) of GNU make to not export all variables.\n# Otherwise a system limit (for SysV at least) may be exceeded.\n.NOEXPORT:\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/extensions/far/far-class.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/extensions/far/far-class.h>\n\n#include <fst/script/script-impl.h>\n#include <fst/extensions/far/script-impl.h>\n\nnamespace fst {\nnamespace script {\n\n\n// FarReaderClass.\n\nFarReaderClass *FarReaderClass::Open(const string &filename) {\n  OpenFarReaderClassArgs1 args(filename);\n  args.retval = nullptr;\n  Apply<Operation<OpenFarReaderClassArgs1>>(\"OpenFarReaderClass\",\n                                            LoadArcTypeFromFar(filename),\n                                            &args);\n  return args.retval;\n}\n\nFarReaderClass *FarReaderClass::Open(const std::vector<string> &filenames) {\n  if (filenames.empty()) {\n    LOG(ERROR) << \"FarReaderClass::Open: No files specified\";\n    return nullptr;\n  }\n  const auto arc_type = LoadArcTypeFromFar(filenames.front());\n  if (arc_type.empty()) return nullptr;\n  OpenFarReaderClassArgs2 args(filenames);\n  args.retval = nullptr;\n  Apply<Operation<OpenFarReaderClassArgs2>>(\"OpenFarReaderClass\", arc_type,\n                                            &args);\n  return args.retval;\n}\n\nREGISTER_FST_OPERATION(OpenFarReaderClass, StdArc, OpenFarReaderClassArgs1);\nREGISTER_FST_OPERATION(OpenFarReaderClass, LogArc, OpenFarReaderClassArgs1);\nREGISTER_FST_OPERATION(OpenFarReaderClass, Log64Arc, OpenFarReaderClassArgs1);\n\nREGISTER_FST_OPERATION(OpenFarReaderClass, StdArc, OpenFarReaderClassArgs2);\nREGISTER_FST_OPERATION(OpenFarReaderClass, LogArc, OpenFarReaderClassArgs2);\nREGISTER_FST_OPERATION(OpenFarReaderClass, Log64Arc, OpenFarReaderClassArgs2);\n\n// FarWriterClass.\n\nFarWriterClass *FarWriterClass::Create(const string &filename,\n                                       const string &arc_type, FarType type) {\n  CreateFarWriterClassInnerArgs iargs(filename, type);\n  CreateFarWriterClassArgs args(iargs);\n  args.retval = nullptr;\n  Apply<Operation<CreateFarWriterClassArgs>>(\"CreateFarWriterClass\", arc_type,\n                                             &args);\n  return args.retval;\n}\n\nREGISTER_FST_OPERATION(CreateFarWriterClass, StdArc, CreateFarWriterClassArgs);\nREGISTER_FST_OPERATION(CreateFarWriterClass, LogArc, CreateFarWriterClassArgs);\nREGISTER_FST_OPERATION(CreateFarWriterClass, Log64Arc,\n                       CreateFarWriterClassArgs);\n\n}  // namespace script\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/extensions/far/farcompilestrings.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Compiles a set of stings as FSTs and stores them in a finite-state archive.\n\n#include <string>\n#include <vector>\n\n#include <fst/flags.h>\n#include <fst/extensions/far/farscript.h>\n#include <fst/extensions/far/getters.h>\n#include <fstream>\n\nDEFINE_string(key_prefix, \"\", \"Prefix to append to keys\");\nDEFINE_string(key_suffix, \"\", \"Suffix to append to keys\");\nDEFINE_int32(generate_keys, 0,\n             \"Generate N digit numeric keys (def: use file basenames)\");\nDEFINE_string(far_type, \"default\",\n              \"FAR file format type: one of: \\\"default\\\", \\\"fst\\\", \"\n              \"\\\"stlist\\\", \\\"sttable\\\"\");\nDEFINE_bool(allow_negative_labels, false,\n            \"Allow negative labels (not recommended; may cause conflicts)\");\nDEFINE_string(arc_type, \"standard\", \"Output arc type\");\nDEFINE_string(entry_type, \"line\",\n              \"Entry type: one of : \"\n              \"\\\"file\\\" (one FST per file), \\\"line\\\" (one FST per line)\");\nDEFINE_string(fst_type, \"vector\", \"Output FST type\");\nDEFINE_string(token_type, \"symbol\",\n              \"Token type: one of : \"\n              \"\\\"symbol\\\", \\\"byte\\\", \\\"utf8\\\"\");\nDEFINE_string(symbols, \"\", \"Label symbol table\");\nDEFINE_string(unknown_symbol, \"\", \"\");\nDEFINE_bool(file_list_input, false,\n            \"Each input file contains a list of files to be processed\");\nDEFINE_bool(keep_symbols, false, \"Store symbol table in the FAR file\");\nDEFINE_bool(initial_symbols, true,\n            \"When keep_symbols is true, stores symbol table only for the first\"\n            \" FST in archive.\");\n\nint main(int argc, char **argv) {\n  namespace s = fst::script;\n\n  string usage = \"Compiles a set of strings as FSTs and stores them in\";\n  usage += \" a finite-state archive.\\n\\n  Usage:\";\n  usage += argv[0];\n  usage += \" [in1.txt [[in2.txt ...] out.far]]\\n\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n  s::ExpandArgs(argc, argv, &argc, &argv);\n\n  std::vector<string> in_fnames;\n  if (FLAGS_file_list_input) {\n    for (int i = 1; i < argc - 1; ++i) {\n      std::ifstream istrm(argv[i]);\n      string str;\n      while (getline(istrm, str)) in_fnames.push_back(str);\n    }\n  } else {\n    for (int i = 1; i < argc - 1; ++i)\n      in_fnames.push_back(argv[i]);\n  }\n  if (in_fnames.empty()) {\n    in_fnames.push_back(argc == 2 && strcmp(argv[1], \"-\") != 0 ? argv[1] : \"\");\n  }\n\n  string out_fname =\n      argc > 2 && strcmp(argv[argc - 1], \"-\") != 0 ? argv[argc - 1] : \"\";\n\n  fst::FarEntryType entry_type;\n  if (!s::GetFarEntryType(FLAGS_entry_type, &entry_type)) {\n    LOG(ERROR) << \"Unknown or unsupported FAR entry type: \" << FLAGS_entry_type;\n    return 1;\n  }\n\n  fst::FarTokenType token_type;\n  if (!s::GetFarTokenType(FLAGS_token_type, &token_type)) {\n    LOG(ERROR) << \"Unkonwn or unsupported FAR token type: \" << FLAGS_token_type;\n    return 1;\n  }\n\n  const auto far_type = s::GetFarType(FLAGS_far_type);\n\n  s::FarCompileStrings(in_fnames, out_fname, FLAGS_arc_type, FLAGS_fst_type,\n                       far_type, FLAGS_generate_keys, entry_type, token_type,\n                       FLAGS_symbols, FLAGS_unknown_symbol, FLAGS_keep_symbols,\n                       FLAGS_initial_symbols, FLAGS_allow_negative_labels,\n                       FLAGS_key_prefix, FLAGS_key_suffix);\n\n  return 0;\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/extensions/far/farcreate.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Creates a finite-state archive from input FSTs.\n\n#include <string>\n#include <vector>\n\n#include <fst/flags.h>\n#include <fst/extensions/far/farscript.h>\n#include <fst/extensions/far/getters.h>\n#include <fstream>\n\nDEFINE_string(key_prefix, \"\", \"Prefix to append to keys\");\nDEFINE_string(key_suffix, \"\", \"Suffix to append to keys\");\nDEFINE_int32(generate_keys, 0,\n             \"Generate N digit numeric keys (def: use file basenames)\");\nDEFINE_string(far_type, \"default\",\n              \"FAR file format type: one of: \\\"default\\\", \"\n              \"\\\"stlist\\\", \\\"sttable\\\"\");\nDEFINE_bool(file_list_input, false,\n            \"Each input file contains a list of files to be processed\");\n\nint main(int argc, char **argv) {\n  namespace s = fst::script;\n\n  string usage = \"Creates a finite-state archive from input FSTs.\\n\\n Usage:\";\n  usage += argv[0];\n  usage += \" [in1.fst [[in2.fst ...] out.far]]\\n\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n  s::ExpandArgs(argc, argv, &argc, &argv);\n\n  std::vector<string> in_fnames;\n  if (FLAGS_file_list_input) {\n    for (int i = 1; i < argc - 1; ++i) {\n      std::ifstream istrm(argv[i]);\n      string str;\n      while (getline(istrm, str)) in_fnames.push_back(str);\n    }\n  } else {\n    for (int i = 1; i < argc - 1; ++i)\n      in_fnames.push_back(argv[i]);\n  }\n  if (in_fnames.empty())\n    in_fnames.push_back(argc == 2 && strcmp(argv[1], \"-\") != 0 ? argv[1] : \"\");\n\n  string out_fname =\n      argc > 2 && strcmp(argv[argc - 1], \"-\") != 0 ? argv[argc - 1] : \"\";\n\n  const auto arc_type = s::LoadArcTypeFromFst(in_fnames[0]);\n  if (arc_type.empty()) return 1;\n\n  const auto far_type = s::GetFarType(FLAGS_far_type);\n\n  s::FarCreate(in_fnames, out_fname, arc_type, FLAGS_generate_keys, far_type,\n               FLAGS_key_prefix, FLAGS_key_suffix);\n\n  return 0;\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/extensions/far/farequal.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Tests if two Far files contains the same (key,fst) pairs.\n\n#include <string>\n\n#include <fst/flags.h>\n#include <fst/extensions/far/farscript.h>\n#include <fst/extensions/far/getters.h>\n\nDEFINE_string(begin_key, \"\",\n              \"First key to extract (def: first key in archive)\");\nDEFINE_string(end_key, \"\", \"Last key to extract (def: last key in archive)\");\nDEFINE_double(delta, fst::kDelta, \"Comparison/quantization delta\");\n\nint main(int argc, char **argv) {\n  namespace s = fst::script;\n\n  string usage = \"Compares the FSTs in two FST archives for equality.\";\n  usage += \"\\n\\n  Usage:\";\n  usage += argv[0];\n  usage += \" in1.far in2.far\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n  s::ExpandArgs(argc, argv, &argc, &argv);\n  if (argc != 3) {\n    ShowUsage();\n    return 1;\n  }\n\n  const auto arc_type = s::LoadArcTypeFromFar(argv[1]);\n  if (arc_type.empty()) return 1;\n\n  bool result = s::FarEqual(argv[1], argv[2], arc_type, FLAGS_delta,\n                            FLAGS_begin_key, FLAGS_end_key);\n\n  if (!result) VLOG(1) << \"FARs are not equal.\";\n\n  return result ? 0 : 2;\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/extensions/far/farextract.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Extracts component FSTs from an finite-state archive.\n\n#include <string>\n#include <vector>\n\n#include <fst/flags.h>\n#include <fst/extensions/far/farscript.h>\n#include <fst/extensions/far/getters.h>\n\nDEFINE_string(filename_prefix, \"\", \"Prefix to append to filenames\");\nDEFINE_string(filename_suffix, \"\", \"Suffix to append to filenames\");\nDEFINE_int32(generate_filenames, 0,\n             \"Generate N digit numeric filenames (def: use keys)\");\nDEFINE_string(keys, \"\",\n              \"Extract set of keys separated by comma (default) \"\n              \"including ranges delimited by dash (default)\");\nDEFINE_string(key_separator, \",\", \"Separator for individual keys\");\nDEFINE_string(range_delimiter, \"-\", \"Delimiter for ranges of keys\");\n\nint main(int argc, char **argv) {\n  namespace s = fst::script;\n\n  string usage = \"Extracts FSTs from a finite-state archive.\\n\\n Usage:\";\n  usage += argv[0];\n  usage += \" [in1.far in2.far...]\\n\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n  s::ExpandArgs(argc, argv, &argc, &argv);\n\n  std::vector<string> in_fnames;\n  for (int i = 1; i < argc; ++i) in_fnames.push_back(argv[i]);\n  if (in_fnames.empty()) in_fnames.push_back(\"\");\n\n  const auto arc_type = s::LoadArcTypeFromFar(in_fnames[0]);\n  if (arc_type.empty()) return 1;\n\n  s::FarExtract(in_fnames, arc_type, FLAGS_generate_filenames, FLAGS_keys,\n                FLAGS_key_separator, FLAGS_range_delimiter,\n                FLAGS_filename_prefix, FLAGS_filename_suffix);\n\n  return 0;\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/extensions/far/farinfo.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Prints some basic information about the FSTs in an FST archive.\n\n#include <string>\n#include <vector>\n\n#include <fst/flags.h>\n#include <fst/extensions/far/farscript.h>\n#include <fst/extensions/far/getters.h>\n\nDEFINE_string(begin_key, \"\",\n              \"First key to extract (default: first key in archive)\");\nDEFINE_string(end_key, \"\",\n              \"Last key to extract (default: last key in archive)\");\n\nDEFINE_bool(list_fsts, false, \"Display FST information for each key\");\n\nint main(int argc, char **argv) {\n  namespace s = fst::script;\n\n  string usage = \"Prints some basic information about the FSTs in an FST \";\n  usage += \"archive.\\n\\n  Usage:\";\n  usage += argv[0];\n  usage += \" [in1.far in2.far...]\\n\";\n  usage += \"  Flags: begin_key end_key list_fsts\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n  s::ExpandArgs(argc, argv, &argc, &argv);\n\n  std::vector<string> in_fnames;\n  for (int i = 1; i < argc; ++i) in_fnames.push_back(argv[i]);\n  if (in_fnames.empty()) in_fnames.push_back(\"\");\n\n  const auto arc_type = s::LoadArcTypeFromFar(in_fnames[0]);\n  if (arc_type.empty()) return 1;\n\n  s::FarInfo(in_fnames, arc_type, FLAGS_begin_key, FLAGS_end_key,\n             FLAGS_list_fsts);\n\n  return 0;\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/extensions/far/farisomorphic.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Tests if two Far files contains isomorphic (key,fst) pairs.\n\n#include <string>\n\n#include <fst/flags.h>\n#include <fst/extensions/far/farscript.h>\n#include <fst/extensions/far/getters.h>\n\nDEFINE_string(begin_key, \"\",\n              \"First key to extract (def: first key in archive)\");\nDEFINE_string(end_key, \"\", \"Last key to extract (def: last key in archive)\");\nDEFINE_double(delta, fst::kDelta, \"Comparison/quantization delta\");\n\nint main(int argc, char **argv) {\n  namespace s = fst::script;\n\n  string usage = \"Compares the FSTs in two FST archives for isomorphism.\";\n  usage += \"\\n\\n  Usage:\";\n  usage += argv[0];\n  usage += \" in1.far in2.far\\n\";\n  usage += \"  Flags: begin_key end_key\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n  s::ExpandArgs(argc, argv, &argc, &argv);\n\n  if (argc != 3) {\n    ShowUsage();\n    return 1;\n  }\n\n  const auto arc_type = s::LoadArcTypeFromFar(argv[1]);\n  if (arc_type.empty()) return 1;\n\n  bool result = s::FarIsomorphic(argv[1], argv[2], arc_type,\n                                 FLAGS_delta, FLAGS_begin_key, FLAGS_end_key);\n\n  if (!result) VLOG(1) << \"FARs are not isomorphic.\";\n\n  return result ? 0 : 2;\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/extensions/far/farprintstrings.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Outputs as strings the string FSTs in a finite-state archive.\n\n#include <string>\n#include <vector>\n\n#include <fst/flags.h>\n#include <fst/extensions/far/farscript.h>\n#include <fst/extensions/far/getters.h>\n\nDEFINE_string(filename_prefix, \"\", \"Prefix to append to filenames\");\nDEFINE_string(filename_suffix, \"\", \"Suffix to append to filenames\");\nDEFINE_int32(generate_filenames, 0,\n             \"Generate N digit numeric filenames (def: use keys)\");\nDEFINE_string(begin_key, \"\",\n              \"First key to extract (def: first key in archive)\");\nDEFINE_string(end_key, \"\", \"Last key to extract (def: last key in archive)\");\n// PrintStringsMain specific flag definitions.\nDEFINE_bool(print_key, false, \"Prefix each string by its key\");\nDEFINE_bool(print_weight, false, \"Suffix each string by its weight\");\nDEFINE_string(entry_type, \"line\",\n              \"Entry type: one of : \"\n              \"\\\"file\\\" (one FST per file), \\\"line\\\" (one FST per line)\");\nDEFINE_string(token_type, \"symbol\",\n              \"Token type: one of : \"\n              \"\\\"symbol\\\", \\\"byte\\\", \\\"utf8\\\"\");\nDEFINE_string(symbols, \"\", \"Label symbol table\");\nDEFINE_bool(initial_symbols, true,\n            \"Uses symbol table from the first Fst in archive for all entries.\");\n\nint main(int argc, char **argv) {\n  namespace s = fst::script;\n\n  string usage = \"Print as string the string FSTs in an archive.\\n\\n  Usage:\";\n  usage += argv[0];\n  usage += \" [in1.far in2.far ...]\\n\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n  s::ExpandArgs(argc, argv, &argc, &argv);\n\n  std::vector<string> in_fnames;\n  for (int i = 1; i < argc; ++i) in_fnames.push_back(argv[i]);\n  if (in_fnames.empty()) in_fnames.push_back(\"\");\n\n  const auto arc_type = s::LoadArcTypeFromFar(in_fnames[0]);\n  if (arc_type.empty()) return 1;\n\n  fst::FarEntryType entry_type;\n  if (!s::GetFarEntryType(FLAGS_entry_type, &entry_type)) {\n    LOG(ERROR) << \"Unknown or unsupported FAR entry type: \" << FLAGS_entry_type;\n    return 1;\n  }\n\n  fst::FarTokenType token_type;\n  if (!s::GetFarTokenType(FLAGS_token_type, &token_type)) {\n    LOG(ERROR) << \"Unknown or unsupported FAR token type: \" << FLAGS_token_type;\n    return 1;\n  }\n\n  s::FarPrintStrings(in_fnames, arc_type, entry_type, token_type,\n                     FLAGS_begin_key, FLAGS_end_key, FLAGS_print_key,\n                     FLAGS_print_weight, FLAGS_symbols, FLAGS_initial_symbols,\n                     FLAGS_generate_filenames, FLAGS_filename_prefix,\n                     FLAGS_filename_suffix);\n\n  return 0;\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/extensions/far/farscript.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Definitions of 'scriptable' versions of FAR operations, that is,\n// those that can be called with FstClass-type arguments.\n\n#include <fst/extensions/far/farscript.h>\n#include <fst/extensions/far/far.h>\n#include <fst/script/script-impl.h>\n\nnamespace fst {\nnamespace script {\n\nvoid FarCompileStrings(const std::vector<string> &in_fnames,\n                       const string &out_fname, const string &arc_type,\n                       const string &fst_type, const FarType &far_type,\n                       int32 generate_keys, FarEntryType fet, FarTokenType tt,\n                       const string &symbols_fname,\n                       const string &unknown_symbol, bool keep_symbols,\n                       bool initial_symbols, bool allow_negative_labels,\n                       const string &key_prefix, const string &key_suffix) {\n  FarCompileStringsArgs args(in_fnames, out_fname, fst_type, far_type,\n                             generate_keys, fet, tt, symbols_fname,\n                             unknown_symbol, keep_symbols, initial_symbols,\n                             allow_negative_labels, key_prefix, key_suffix);\n  Apply<Operation<FarCompileStringsArgs>>(\"FarCompileStrings\", arc_type, &args);\n}\n\nvoid FarCreate(const std::vector<string> &in_fnames, const string &out_fname,\n               const string &arc_type, const int32 generate_keys,\n               const FarType &far_type, const string &key_prefix,\n               const string &key_suffix) {\n  FarCreateArgs args(in_fnames, out_fname, generate_keys, far_type, key_prefix,\n                     key_suffix);\n  Apply<Operation<FarCreateArgs>>(\"FarCreate\", arc_type, &args);\n}\n\nbool FarEqual(const string &filename1, const string &filename2,\n              const string &arc_type, float delta, const string &begin_key,\n              const string &end_key) {\n  FarEqualInnerArgs args(filename1, filename2, delta, begin_key, end_key);\n  FarEqualArgs args_with_retval(args);\n  Apply<Operation<FarEqualArgs>>(\"FarEqual\", arc_type, &args_with_retval);\n  return args_with_retval.retval;\n}\n\nvoid FarExtract(const std::vector<string> &ifilenames, const string &arc_type,\n                int32 generate_filenames, const string &keys,\n                const string &key_separator, const string &range_delimiter,\n                const string &filename_prefix, const string &filename_suffix) {\n  FarExtractArgs args(ifilenames, generate_filenames, keys, key_separator,\n                      range_delimiter, filename_prefix, filename_suffix);\n  Apply<Operation<FarExtractArgs>>(\"FarExtract\", arc_type, &args);\n}\n\nvoid FarInfo(const std::vector<string> &filenames, const string &arc_type,\n             const string &begin_key, const string &end_key,\n             const bool list_fsts) {\n  FarInfoArgs args(filenames, begin_key, end_key, list_fsts);\n  Apply<Operation<FarInfoArgs>>(\"FarInfo\", arc_type, &args);\n}\n\nvoid GetFarInfo(const std::vector<string> &filenames, const string &arc_type,\n                const string &begin_key, const string &end_key,\n                const bool list_fsts, FarInfoData *data) {\n  GetFarInfoArgs args(filenames, begin_key, end_key, list_fsts, data);\n  Apply<Operation<GetFarInfoArgs>>(\"GetFarInfo\", arc_type, &args);\n}\n\nbool FarIsomorphic(const string &filename1, const string &filename2,\n                   const string &arc_type, float delta, const string &begin_key,\n                   const string &end_key) {\n  FarIsomorphicInnerArgs args(filename1, filename2, delta, begin_key, end_key);\n  FarIsomorphicArgs args_with_retval(args);\n  Apply<Operation<FarIsomorphicArgs>>(\"FarIsomorphic\", arc_type,\n                                      &args_with_retval);\n  return args_with_retval.retval;\n}\n\nvoid FarPrintStrings(const std::vector<string> &ifilenames,\n                     const string &arc_type, const FarEntryType entry_type,\n                     const FarTokenType token_type, const string &begin_key,\n                     const string &end_key, const bool print_key,\n                     const bool print_weight, const string &symbols_fname,\n                     const bool initial_symbols, const int32 generate_filenames,\n                     const string &filename_prefix,\n                     const string &filename_suffix) {\n  FarPrintStringsArgs args(ifilenames, entry_type, token_type, begin_key,\n                           end_key, print_key, print_weight, symbols_fname,\n                           initial_symbols, generate_filenames, filename_prefix,\n                           filename_suffix);\n  Apply<Operation<FarPrintStringsArgs>>(\"FarPrintStrings\", arc_type, &args);\n}\n\n// Instantiate all templates for common arc types.\n\nREGISTER_FST_FAR_OPERATIONS(StdArc);\nREGISTER_FST_FAR_OPERATIONS(LogArc);\nREGISTER_FST_FAR_OPERATIONS(Log64Arc);\n\n}  // namespace script\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/extensions/far/getters.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n//\n// Definitions and functions for invoking and using Far main functions that\n// support multiple and extensible arc types.\n\n#include <fst/extensions/far/getters.h>\n\n#include <string>\n#include <vector>\n\n#include <fstream>\n\nnamespace fst {\n\nnamespace script {\n\nFarType GetFarType(const string &str) {\n  if (str == \"fst\") {\n    return FAR_FST;\n  } else if (str == \"stlist\") {\n    return FAR_STLIST;\n  } else if (str == \"sttable\") {\n    return FAR_STTABLE;\n  } else {\n    return FAR_DEFAULT;\n  }\n}\n\nbool GetFarEntryType(const string &str, FarEntryType *entry_type) {\n  if (str == \"line\") {\n    *entry_type = FET_LINE;\n  } else if (str == \"file\") {\n    *entry_type = FET_FILE;\n  } else {\n    return false;\n  }\n  return true;\n}\n\nbool GetFarTokenType(const string &str, FarTokenType *token_type) {\n  if (str == \"symbol\") {\n    *token_type = FTT_SYMBOL;\n  } else if (str == \"byte\") {\n    *token_type = FTT_BYTE;\n  } else if (str == \"utf8\") {\n    *token_type = FTT_UTF8;\n  } else {\n    return false;\n  }\n  return true;\n}\n\nvoid ExpandArgs(int argc, char **argv, int *argcp, char ***argvp) {\n}\n\n}  // namespace script\n\nstring GetFarTypeString(FarType type) {\n  switch (type) {\n    case FAR_FST:\n      return \"fst\";\n    case FAR_STLIST:\n      return \"stlist\";\n    case FAR_STTABLE:\n      return \"sttable\";\n    case FAR_DEFAULT:\n      return \"default\";\n    default:\n      return \"<unknown>\";\n  }\n}\n\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/extensions/far/script-impl.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Definitions and functions for invoking and using Far main functions that\n// support multiple and extensible arc types.\n\n#include <fst/extensions/far/script-impl.h>\n\n#include <string>\n\n#include <fst/extensions/far/far.h>\n#include <fstream>\n\nnamespace fst {\nnamespace script {\n\nstring LoadArcTypeFromFar(const string &far_fname) {\n  FarHeader hdr;\n  if (!hdr.Read(far_fname)) {\n    LOG(ERROR) << \"Error reading FAR: \" << far_fname;\n    return \"\";\n  }\n  string atype = hdr.ArcType();\n  if (atype == \"unknown\") {\n    LOG(ERROR) << \"Empty FST archive: \" << far_fname;\n    return \"\";\n  }\n  return atype;\n}\n\nstring LoadArcTypeFromFst(const string &fst_fname) {\n  FstHeader hdr;\n  std::ifstream in(fst_fname, std::ios_base::in | std::ios_base::binary);\n  if (!hdr.Read(in, fst_fname)) {\n    LOG(ERROR) << \"Error reading FST: \" << fst_fname;\n    return \"\";\n  }\n  return hdr.ArcType();\n}\n\n}  // namespace script\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/extensions/far/stlist.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <ios>\n\n#include <fst/extensions/far/stlist.h>\n#include <fstream>\n\nnamespace fst {\n\nbool IsSTList(const string &filename) {\n  std::ifstream strm(filename, std::ios_base::in | std::ios_base::binary);\n  if (!strm) return false;\n  int32 magic_number = 0;\n  ReadType(strm, &magic_number);\n  return magic_number == kSTListMagicNumber;\n}\n\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/extensions/far/strings.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <cmath>\n#include <string>\n\n#include <fst/flags.h>\n#include <fst/extensions/far/compile-strings.h>\n#include <fstream>\n\nDEFINE_string(far_field_separator, \"\\t\",\n              \"Set of characters used as a separator between printed fields\");\n\nnamespace fst {\n\n// Computes the minimal length required to encode each line number as a decimal\n// number.\nint KeySize(const char *filename) {\n  std::ifstream istrm(filename);\n  istrm.seekg(0);\n  string s;\n  int nline = 0;\n  while (getline(istrm, s)) ++nline;\n  istrm.seekg(0);\n  return nline ? ceil(log10(nline + 1)) : 1;\n}\n\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/extensions/far/sttable.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fstream>\n#include <fst/extensions/far/sttable.h>\n\nnamespace fst {\n\nbool IsSTTable(const string &filename) {\n  std::ifstream strm(filename);\n  if (!strm.good()) return false;\n\n  int32 magic_number = 0;\n  ReadType(strm, &magic_number);\n  return magic_number == kSTTableMagicNumber;\n}\n\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/extensions/linear/CMakeLists.txt",
    "content": "file(GLOB HEADER_FILES ../../include/fst/extensions/linear/*.h)\nmessage(STATUS \"${HEADER_FILES}\")\n\n\nif(HAVE_SCRIPT)\n  add_library(fstlinearscript\n    linearscript.cc\n    ${HEADER_FILES}\n  )\n  target_link_libraries(fstlinearscript\n    fstscript\n    fst\n  )\n  set_target_properties(fstlinearscript PROPERTIES \n    SOVERSION \"${SOVERSION}\"\n    FOLDER linear\n  )\n  \n  install(TARGETS fstlinearscript\n\tLIBRARY DESTINATION lib\n\tARCHIVE DESTINATION lib\n\tRUNTIME DESTINATION lib\n  )\nendif(HAVE_SCRIPT)\n\nif(HAVE_BIN)\n  add_executable(fstlinear\n    fstlinear.cc)\n  target_link_libraries(fstlinear\n    fstlinearscript\n    fstscript \n    fst\n    ${CMAKE_DL_LIBS}\n )\n\n  add_executable(fstloglinearapply\n    fstloglinearapply.cc)\n  target_link_libraries(fstloglinearapply\n    fstlinearscript\n    fstscript \n    fst\n    ${CMAKE_DL_LIBS}\n  )\n  install(TARGETS fstlinear fstloglinearapply\n    RUNTIME DESTINATION bin\n  )\n  set_target_properties(fstlinear fstloglinearapply PROPERTIES\n    FOLDER linear/bin\n  )\nendif(HAVE_BIN)\n\n\nfunction (add_module _name)\n    add_library(${ARGV})\n    if (TARGET ${_name})\n        target_link_libraries(${_name} fst)\n        set_target_properties(${_name} PROPERTIES \n            WINDOWS_EXPORT_ALL_SYMBOLS true\n            FOLDER linear/modules\n        )\n    endif()\n\n    install(TARGETS ${_name} LIBRARY DESTINATION lib/fst)\nendfunction()\n\nadd_module(linear-tagger-fst MODULE\n  linear-tagger-fst.cc)\n\nadd_module(linear-classifier-fst MODULE\n  linear-classifier-fst.cc)\n\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/extensions/linear/Makefile.am",
    "content": "AM_CPPFLAGS = -I$(srcdir)/../../include $(ICU_CPPFLAGS)\n\nif HAVE_BIN\nbin_PROGRAMS = fstlinear fstloglinearapply\n\nLDADD = libfstlinearscript.la ../../script/libfstscript.la \\\n    ../../lib/libfst.la -lm $(DL_LIBS)\n\nfstlinear_SOURCES = fstlinear.cc\n\nfstloglinearapply_SOURCES = fstloglinearapply.cc\nendif\n\nif HAVE_SCRIPT\nlibfstlinearscript_la_SOURCES = linearscript.cc\nlibfstlinearscript_la_LDFLAGS = -version-info 13:0:0 -lm $(DL_LIBS)\nlibfstlinearscript_la_LIBADD = ../../script/libfstscript.la \\\n\t\t\t\t\t\t\t../../lib/libfst.la -lm $(DL_LIBS)\nendif\n\nif HAVE_SCRIPT\nlibfst_LTLIBRARIES = linear_tagger-fst.la \\\n    linear_classifier-fst.la\nlib_LTLIBRARIES = libfstlinearscript.la\nelse\nlibfst_LTLIBRARIES = linear_tagger-fst.la linear_classifier-fst.la\nendif\n\nlibfstdir = @libfstdir@\n\nlinear_tagger_fst_la_SOURCES = linear-tagger-fst.cc\nlinear_tagger_fst_la_LDFLAGS = -module\n\nlinear_classifier_fst_la_SOURCES = linear-classifier-fst.cc\nlinear_classifier_fst_la_LDFLAGS = -module\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/extensions/linear/Makefile.in",
    "content": "# Makefile.in generated by automake 1.15.1 from Makefile.am.\n# @configure_input@\n\n# Copyright (C) 1994-2017 Free Software Foundation, Inc.\n\n# This Makefile.in is free software; the Free Software Foundation\n# gives unlimited permission to copy and/or distribute it,\n# with or without modifications, as long as this notice is preserved.\n\n# This program is distributed in the hope that it will be useful,\n# but WITHOUT ANY WARRANTY, to the extent permitted by law; without\n# even the implied warranty of MERCHANTABILITY or FITNESS FOR A\n# PARTICULAR PURPOSE.\n\n@SET_MAKE@\n\n\nVPATH = @srcdir@\nam__is_gnu_make = { \\\n  if test -z '$(MAKELEVEL)'; then \\\n    false; \\\n  elif test -n '$(MAKE_HOST)'; then \\\n    true; \\\n  elif test -n '$(MAKE_VERSION)' && test -n '$(CURDIR)'; then \\\n    true; \\\n  else \\\n    false; \\\n  fi; \\\n}\nam__make_running_with_option = \\\n  case $${target_option-} in \\\n      ?) ;; \\\n      *) echo \"am__make_running_with_option: internal error: invalid\" \\\n              \"target option '$${target_option-}' specified\" >&2; \\\n         exit 1;; \\\n  esac; \\\n  has_opt=no; \\\n  sane_makeflags=$$MAKEFLAGS; \\\n  if $(am__is_gnu_make); then \\\n    sane_makeflags=$$MFLAGS; \\\n  else \\\n    case $$MAKEFLAGS in \\\n      *\\\\[\\ \\\t]*) \\\n        bs=\\\\; \\\n        sane_makeflags=`printf '%s\\n' \"$$MAKEFLAGS\" \\\n          | sed \"s/$$bs$$bs[$$bs $$bs\t]*//g\"`;; \\\n    esac; \\\n  fi; \\\n  skip_next=no; \\\n  strip_trailopt () \\\n  { \\\n    flg=`printf '%s\\n' \"$$flg\" | sed \"s/$$1.*$$//\"`; \\\n  }; \\\n  for flg in $$sane_makeflags; do \\\n    test $$skip_next = yes && { skip_next=no; continue; }; \\\n    case $$flg in \\\n      *=*|--*) continue;; \\\n        -*I) strip_trailopt 'I'; skip_next=yes;; \\\n      -*I?*) strip_trailopt 'I';; \\\n        -*O) strip_trailopt 'O'; skip_next=yes;; \\\n      -*O?*) strip_trailopt 'O';; \\\n        -*l) strip_trailopt 'l'; skip_next=yes;; \\\n      -*l?*) strip_trailopt 'l';; \\\n      -[dEDm]) skip_next=yes;; \\\n      -[JT]) skip_next=yes;; \\\n    esac; \\\n    case $$flg in \\\n      *$$target_option*) has_opt=yes; break;; \\\n    esac; \\\n  done; \\\n  test $$has_opt = yes\nam__make_dryrun = (target_option=n; $(am__make_running_with_option))\nam__make_keepgoing = (target_option=k; $(am__make_running_with_option))\npkgdatadir = $(datadir)/@PACKAGE@\npkgincludedir = $(includedir)/@PACKAGE@\npkglibdir = $(libdir)/@PACKAGE@\npkglibexecdir = $(libexecdir)/@PACKAGE@\nam__cd = CDPATH=\"$${ZSH_VERSION+.}$(PATH_SEPARATOR)\" && cd\ninstall_sh_DATA = $(install_sh) -c -m 644\ninstall_sh_PROGRAM = $(install_sh) -c\ninstall_sh_SCRIPT = $(install_sh) -c\nINSTALL_HEADER = $(INSTALL_DATA)\ntransform = $(program_transform_name)\nNORMAL_INSTALL = :\nPRE_INSTALL = :\nPOST_INSTALL = :\nNORMAL_UNINSTALL = :\nPRE_UNINSTALL = :\nPOST_UNINSTALL = :\nbuild_triplet = @build@\nhost_triplet = @host@\n@HAVE_BIN_TRUE@bin_PROGRAMS = fstlinear$(EXEEXT) \\\n@HAVE_BIN_TRUE@\tfstloglinearapply$(EXEEXT)\nsubdir = src/extensions/linear\nACLOCAL_M4 = $(top_srcdir)/aclocal.m4\nam__aclocal_m4_deps = $(top_srcdir)/m4/ac_python_devel.m4 \\\n\t$(top_srcdir)/m4/libtool.m4 $(top_srcdir)/m4/ltoptions.m4 \\\n\t$(top_srcdir)/m4/ltsugar.m4 $(top_srcdir)/m4/ltversion.m4 \\\n\t$(top_srcdir)/m4/lt~obsolete.m4 $(top_srcdir)/configure.ac\nam__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \\\n\t$(ACLOCAL_M4)\nDIST_COMMON = $(srcdir)/Makefile.am $(am__DIST_COMMON)\nmkinstalldirs = $(install_sh) -d\nCONFIG_HEADER = $(top_builddir)/config.h \\\n\t$(top_builddir)/src/include/fst/config.h\nCONFIG_CLEAN_FILES =\nCONFIG_CLEAN_VPATH_FILES =\nam__vpath_adj_setup = srcdirstrip=`echo \"$(srcdir)\" | sed 's|.|.|g'`;\nam__vpath_adj = case $$p in \\\n    $(srcdir)/*) f=`echo \"$$p\" | sed \"s|^$$srcdirstrip/||\"`;; \\\n    *) f=$$p;; \\\n  esac;\nam__strip_dir = f=`echo $$p | sed -e 's|^.*/||'`;\nam__install_max = 40\nam__nobase_strip_setup = \\\n  srcdirstrip=`echo \"$(srcdir)\" | sed 's/[].[^$$\\\\*|]/\\\\\\\\&/g'`\nam__nobase_strip = \\\n  for p in $$list; do echo \"$$p\"; done | sed -e \"s|$$srcdirstrip/||\"\nam__nobase_list = $(am__nobase_strip_setup); \\\n  for p in $$list; do echo \"$$p $$p\"; done | \\\n  sed \"s| $$srcdirstrip/| |;\"' / .*\\//!s/ .*/ ./; s,\\( .*\\)/[^/]*$$,\\1,' | \\\n  $(AWK) 'BEGIN { files[\".\"] = \"\" } { files[$$2] = files[$$2] \" \" $$1; \\\n    if (++n[$$2] == $(am__install_max)) \\\n      { print $$2, files[$$2]; n[$$2] = 0; files[$$2] = \"\" } } \\\n    END { for (dir in files) print dir, files[dir] }'\nam__base_list = \\\n  sed '$$!N;$$!N;$$!N;$$!N;$$!N;$$!N;$$!N;s/\\n/ /g' | \\\n  sed '$$!N;$$!N;$$!N;$$!N;s/\\n/ /g'\nam__uninstall_files_from_dir = { \\\n  test -z \"$$files\" \\\n    || { test ! -d \"$$dir\" && test ! -f \"$$dir\" && test ! -r \"$$dir\"; } \\\n    || { echo \" ( cd '$$dir' && rm -f\" $$files \")\"; \\\n         $(am__cd) \"$$dir\" && rm -f $$files; }; \\\n  }\nam__installdirs = \"$(DESTDIR)$(libdir)\" \"$(DESTDIR)$(libfstdir)\" \\\n\t\"$(DESTDIR)$(bindir)\"\nLTLIBRARIES = $(lib_LTLIBRARIES) $(libfst_LTLIBRARIES)\nam__DEPENDENCIES_1 =\n@HAVE_SCRIPT_TRUE@libfstlinearscript_la_DEPENDENCIES =  \\\n@HAVE_SCRIPT_TRUE@\t../../script/libfstscript.la \\\n@HAVE_SCRIPT_TRUE@\t../../lib/libfst.la $(am__DEPENDENCIES_1)\nam__libfstlinearscript_la_SOURCES_DIST = linearscript.cc\n@HAVE_SCRIPT_TRUE@am_libfstlinearscript_la_OBJECTS = linearscript.lo\nlibfstlinearscript_la_OBJECTS = $(am_libfstlinearscript_la_OBJECTS)\nAM_V_lt = $(am__v_lt_@AM_V@)\nam__v_lt_ = $(am__v_lt_@AM_DEFAULT_V@)\nam__v_lt_0 = --silent\nam__v_lt_1 = \nlibfstlinearscript_la_LINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX \\\n\t$(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=link $(CXXLD) \\\n\t$(AM_CXXFLAGS) $(CXXFLAGS) $(libfstlinearscript_la_LDFLAGS) \\\n\t$(LDFLAGS) -o $@\n@HAVE_SCRIPT_TRUE@am_libfstlinearscript_la_rpath = -rpath $(libdir)\nlinear_classifier_fst_la_LIBADD =\nam_linear_classifier_fst_la_OBJECTS = linear-classifier-fst.lo\nlinear_classifier_fst_la_OBJECTS =  \\\n\t$(am_linear_classifier_fst_la_OBJECTS)\nlinear_classifier_fst_la_LINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX \\\n\t$(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=link $(CXXLD) \\\n\t$(AM_CXXFLAGS) $(CXXFLAGS) $(linear_classifier_fst_la_LDFLAGS) \\\n\t$(LDFLAGS) -o $@\n@HAVE_SCRIPT_FALSE@am_linear_classifier_fst_la_rpath = -rpath \\\n@HAVE_SCRIPT_FALSE@\t$(libfstdir)\n@HAVE_SCRIPT_TRUE@am_linear_classifier_fst_la_rpath = -rpath \\\n@HAVE_SCRIPT_TRUE@\t$(libfstdir)\nlinear_tagger_fst_la_LIBADD =\nam_linear_tagger_fst_la_OBJECTS = linear-tagger-fst.lo\nlinear_tagger_fst_la_OBJECTS = $(am_linear_tagger_fst_la_OBJECTS)\nlinear_tagger_fst_la_LINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX \\\n\t$(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=link $(CXXLD) \\\n\t$(AM_CXXFLAGS) $(CXXFLAGS) $(linear_tagger_fst_la_LDFLAGS) \\\n\t$(LDFLAGS) -o $@\n@HAVE_SCRIPT_FALSE@am_linear_tagger_fst_la_rpath = -rpath $(libfstdir)\n@HAVE_SCRIPT_TRUE@am_linear_tagger_fst_la_rpath = -rpath $(libfstdir)\nPROGRAMS = $(bin_PROGRAMS)\nam__fstlinear_SOURCES_DIST = fstlinear.cc\n@HAVE_BIN_TRUE@am_fstlinear_OBJECTS = fstlinear.$(OBJEXT)\nfstlinear_OBJECTS = $(am_fstlinear_OBJECTS)\nfstlinear_LDADD = $(LDADD)\n@HAVE_BIN_TRUE@fstlinear_DEPENDENCIES = libfstlinearscript.la \\\n@HAVE_BIN_TRUE@\t../../script/libfstscript.la \\\n@HAVE_BIN_TRUE@\t../../lib/libfst.la $(am__DEPENDENCIES_1)\nam__fstloglinearapply_SOURCES_DIST = fstloglinearapply.cc\n@HAVE_BIN_TRUE@am_fstloglinearapply_OBJECTS =  \\\n@HAVE_BIN_TRUE@\tfstloglinearapply.$(OBJEXT)\nfstloglinearapply_OBJECTS = $(am_fstloglinearapply_OBJECTS)\nfstloglinearapply_LDADD = $(LDADD)\n@HAVE_BIN_TRUE@fstloglinearapply_DEPENDENCIES = libfstlinearscript.la \\\n@HAVE_BIN_TRUE@\t../../script/libfstscript.la \\\n@HAVE_BIN_TRUE@\t../../lib/libfst.la $(am__DEPENDENCIES_1)\nAM_V_P = $(am__v_P_@AM_V@)\nam__v_P_ = $(am__v_P_@AM_DEFAULT_V@)\nam__v_P_0 = false\nam__v_P_1 = :\nAM_V_GEN = $(am__v_GEN_@AM_V@)\nam__v_GEN_ = $(am__v_GEN_@AM_DEFAULT_V@)\nam__v_GEN_0 = @echo \"  GEN     \" $@;\nam__v_GEN_1 = \nAM_V_at = $(am__v_at_@AM_V@)\nam__v_at_ = $(am__v_at_@AM_DEFAULT_V@)\nam__v_at_0 = @\nam__v_at_1 = \nDEFAULT_INCLUDES = \ndepcomp = $(SHELL) $(top_srcdir)/depcomp\nam__depfiles_maybe = depfiles\nam__mv = mv -f\nCXXCOMPILE = $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) \\\n\t$(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS)\nLTCXXCOMPILE = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \\\n\t$(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) \\\n\t$(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) \\\n\t$(AM_CXXFLAGS) $(CXXFLAGS)\nAM_V_CXX = $(am__v_CXX_@AM_V@)\nam__v_CXX_ = $(am__v_CXX_@AM_DEFAULT_V@)\nam__v_CXX_0 = @echo \"  CXX     \" $@;\nam__v_CXX_1 = \nCXXLD = $(CXX)\nCXXLINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \\\n\t$(LIBTOOLFLAGS) --mode=link $(CXXLD) $(AM_CXXFLAGS) \\\n\t$(CXXFLAGS) $(AM_LDFLAGS) $(LDFLAGS) -o $@\nAM_V_CXXLD = $(am__v_CXXLD_@AM_V@)\nam__v_CXXLD_ = $(am__v_CXXLD_@AM_DEFAULT_V@)\nam__v_CXXLD_0 = @echo \"  CXXLD   \" $@;\nam__v_CXXLD_1 = \nSOURCES = $(libfstlinearscript_la_SOURCES) \\\n\t$(linear_classifier_fst_la_SOURCES) \\\n\t$(linear_tagger_fst_la_SOURCES) $(fstlinear_SOURCES) \\\n\t$(fstloglinearapply_SOURCES)\nDIST_SOURCES = $(am__libfstlinearscript_la_SOURCES_DIST) \\\n\t$(linear_classifier_fst_la_SOURCES) \\\n\t$(linear_tagger_fst_la_SOURCES) $(am__fstlinear_SOURCES_DIST) \\\n\t$(am__fstloglinearapply_SOURCES_DIST)\nam__can_run_installinfo = \\\n  case $$AM_UPDATE_INFO_DIR in \\\n    n|no|NO) false;; \\\n    *) (install-info --version) >/dev/null 2>&1;; \\\n  esac\nam__tagged_files = $(HEADERS) $(SOURCES) $(TAGS_FILES) $(LISP)\n# Read a list of newline-separated strings from the standard input,\n# and print each of them once, without duplicates.  Input order is\n# *not* preserved.\nam__uniquify_input = $(AWK) '\\\n  BEGIN { nonempty = 0; } \\\n  { items[$$0] = 1; nonempty = 1; } \\\n  END { if (nonempty) { for (i in items) print i; }; } \\\n'\n# Make sure the list of sources is unique.  This is necessary because,\n# e.g., the same source file might be shared among _SOURCES variables\n# for different programs/libraries.\nam__define_uniq_tagged_files = \\\n  list='$(am__tagged_files)'; \\\n  unique=`for i in $$list; do \\\n    if test -f \"$$i\"; then echo $$i; else echo $(srcdir)/$$i; fi; \\\n  done | $(am__uniquify_input)`\nETAGS = etags\nCTAGS = ctags\nam__DIST_COMMON = $(srcdir)/Makefile.in $(top_srcdir)/depcomp\nDISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST)\nACLOCAL = @ACLOCAL@\nAMTAR = @AMTAR@\nAM_DEFAULT_VERBOSITY = @AM_DEFAULT_VERBOSITY@\nAR = @AR@\nAUTOCONF = @AUTOCONF@\nAUTOHEADER = @AUTOHEADER@\nAUTOMAKE = @AUTOMAKE@\nAWK = @AWK@\nCC = @CC@\nCCDEPMODE = @CCDEPMODE@\nCFLAGS = @CFLAGS@\nCPP = @CPP@\nCPPFLAGS = @CPPFLAGS@\nCXX = @CXX@\nCXXCPP = @CXXCPP@\nCXXDEPMODE = @CXXDEPMODE@\nCXXFLAGS = @CXXFLAGS@\nCYGPATH_W = @CYGPATH_W@\nDEFS = @DEFS@\nDEPDIR = @DEPDIR@\nDLLTOOL = @DLLTOOL@\nDL_LIBS = @DL_LIBS@\nDSYMUTIL = @DSYMUTIL@\nDUMPBIN = @DUMPBIN@\nECHO_C = @ECHO_C@\nECHO_N = @ECHO_N@\nECHO_T = @ECHO_T@\nEGREP = @EGREP@\nEXEEXT = @EXEEXT@\nFGREP = @FGREP@\nGREP = @GREP@\nINSTALL = @INSTALL@\nINSTALL_DATA = @INSTALL_DATA@\nINSTALL_PROGRAM = @INSTALL_PROGRAM@\nINSTALL_SCRIPT = @INSTALL_SCRIPT@\nINSTALL_STRIP_PROGRAM = @INSTALL_STRIP_PROGRAM@\nLD = @LD@\nLDFLAGS = @LDFLAGS@\nLIBOBJS = @LIBOBJS@\nLIBS = @LIBS@\nLIBTOOL = @LIBTOOL@\nLIPO = @LIPO@\nLN_S = @LN_S@\nLTLIBOBJS = @LTLIBOBJS@\nLT_SYS_LIBRARY_PATH = @LT_SYS_LIBRARY_PATH@\nMAKEINFO = @MAKEINFO@\nMANIFEST_TOOL = @MANIFEST_TOOL@\nMKDIR_P = @MKDIR_P@\nNM = @NM@\nNMEDIT = @NMEDIT@\nOBJDUMP = @OBJDUMP@\nOBJEXT = @OBJEXT@\nOTOOL = @OTOOL@\nOTOOL64 = @OTOOL64@\nPACKAGE = @PACKAGE@\nPACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@\nPACKAGE_NAME = @PACKAGE_NAME@\nPACKAGE_STRING = @PACKAGE_STRING@\nPACKAGE_TARNAME = @PACKAGE_TARNAME@\nPACKAGE_URL = @PACKAGE_URL@\nPACKAGE_VERSION = @PACKAGE_VERSION@\nPATH_SEPARATOR = @PATH_SEPARATOR@\nPYTHON = @PYTHON@\nPYTHON_CPPFLAGS = @PYTHON_CPPFLAGS@\nPYTHON_EXEC_PREFIX = @PYTHON_EXEC_PREFIX@\nPYTHON_EXTRA_LDFLAGS = @PYTHON_EXTRA_LDFLAGS@\nPYTHON_EXTRA_LIBS = @PYTHON_EXTRA_LIBS@\nPYTHON_LDFLAGS = @PYTHON_LDFLAGS@\nPYTHON_PLATFORM = @PYTHON_PLATFORM@\nPYTHON_PREFIX = @PYTHON_PREFIX@\nPYTHON_SITE_PKG = @PYTHON_SITE_PKG@\nPYTHON_VERSION = @PYTHON_VERSION@\nRANLIB = @RANLIB@\nSED = @SED@\nSET_MAKE = @SET_MAKE@\nSHELL = @SHELL@\nSTRIP = @STRIP@\nVERSION = @VERSION@\nabs_builddir = @abs_builddir@\nabs_srcdir = @abs_srcdir@\nabs_top_builddir = @abs_top_builddir@\nabs_top_srcdir = @abs_top_srcdir@\nac_ct_AR = @ac_ct_AR@\nac_ct_CC = @ac_ct_CC@\nac_ct_CXX = @ac_ct_CXX@\nac_ct_DUMPBIN = @ac_ct_DUMPBIN@\nam__include = @am__include@\nam__leading_dot = @am__leading_dot@\nam__quote = @am__quote@\nam__tar = @am__tar@\nam__untar = @am__untar@\nbindir = @bindir@\nbuild = @build@\nbuild_alias = @build_alias@\nbuild_cpu = @build_cpu@\nbuild_os = @build_os@\nbuild_vendor = @build_vendor@\nbuilddir = @builddir@\ndatadir = @datadir@\ndatarootdir = @datarootdir@\ndocdir = @docdir@\ndvidir = @dvidir@\nexec_prefix = @exec_prefix@\nhost = @host@\nhost_alias = @host_alias@\nhost_cpu = @host_cpu@\nhost_os = @host_os@\nhost_vendor = @host_vendor@\nhtmldir = @htmldir@\nincludedir = @includedir@\ninfodir = @infodir@\ninstall_sh = @install_sh@\nlibdir = @libdir@\nlibexecdir = @libexecdir@\nlibfstdir = @libfstdir@\nlocaledir = @localedir@\nlocalstatedir = @localstatedir@\nmandir = @mandir@\nmkdir_p = @mkdir_p@\noldincludedir = @oldincludedir@\npdfdir = @pdfdir@\npkgpyexecdir = @pkgpyexecdir@\npkgpythondir = @pkgpythondir@\nprefix = @prefix@\nprogram_transform_name = @program_transform_name@\npsdir = @psdir@\npyexecdir = @pyexecdir@\npythondir = @pythondir@\nrunstatedir = @runstatedir@\nsbindir = @sbindir@\nsharedstatedir = @sharedstatedir@\nsrcdir = @srcdir@\nsysconfdir = @sysconfdir@\ntarget_alias = @target_alias@\ntop_build_prefix = @top_build_prefix@\ntop_builddir = @top_builddir@\ntop_srcdir = @top_srcdir@\nAM_CPPFLAGS = -I$(srcdir)/../../include $(ICU_CPPFLAGS)\n@HAVE_BIN_TRUE@LDADD = libfstlinearscript.la ../../script/libfstscript.la \\\n@HAVE_BIN_TRUE@    ../../lib/libfst.la -lm $(DL_LIBS)\n\n@HAVE_BIN_TRUE@fstlinear_SOURCES = fstlinear.cc\n@HAVE_BIN_TRUE@fstloglinearapply_SOURCES = fstloglinearapply.cc\n@HAVE_SCRIPT_TRUE@libfstlinearscript_la_SOURCES = linearscript.cc\n@HAVE_SCRIPT_TRUE@libfstlinearscript_la_LDFLAGS = -version-info 13:0:0 -lm $(DL_LIBS)\n@HAVE_SCRIPT_TRUE@libfstlinearscript_la_LIBADD = ../../script/libfstscript.la \\\n@HAVE_SCRIPT_TRUE@\t\t\t\t\t\t\t../../lib/libfst.la -lm $(DL_LIBS)\n\n@HAVE_SCRIPT_FALSE@libfst_LTLIBRARIES = linear_tagger-fst.la linear_classifier-fst.la\n@HAVE_SCRIPT_TRUE@libfst_LTLIBRARIES = linear_tagger-fst.la \\\n@HAVE_SCRIPT_TRUE@    linear_classifier-fst.la\n\n@HAVE_SCRIPT_TRUE@lib_LTLIBRARIES = libfstlinearscript.la\nlinear_tagger_fst_la_SOURCES = linear-tagger-fst.cc\nlinear_tagger_fst_la_LDFLAGS = -module\nlinear_classifier_fst_la_SOURCES = linear-classifier-fst.cc\nlinear_classifier_fst_la_LDFLAGS = -module\nall: all-am\n\n.SUFFIXES:\n.SUFFIXES: .cc .lo .o .obj\n$(srcdir)/Makefile.in:  $(srcdir)/Makefile.am  $(am__configure_deps)\n\t@for dep in $?; do \\\n\t  case '$(am__configure_deps)' in \\\n\t    *$$dep*) \\\n\t      ( cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh ) \\\n\t        && { if test -f $@; then exit 0; else break; fi; }; \\\n\t      exit 1;; \\\n\t  esac; \\\n\tdone; \\\n\techo ' cd $(top_srcdir) && $(AUTOMAKE) --foreign src/extensions/linear/Makefile'; \\\n\t$(am__cd) $(top_srcdir) && \\\n\t  $(AUTOMAKE) --foreign src/extensions/linear/Makefile\nMakefile: $(srcdir)/Makefile.in $(top_builddir)/config.status\n\t@case '$?' in \\\n\t  *config.status*) \\\n\t    cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh;; \\\n\t  *) \\\n\t    echo ' cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe)'; \\\n\t    cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe);; \\\n\tesac;\n\n$(top_builddir)/config.status: $(top_srcdir)/configure $(CONFIG_STATUS_DEPENDENCIES)\n\tcd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh\n\n$(top_srcdir)/configure:  $(am__configure_deps)\n\tcd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh\n$(ACLOCAL_M4):  $(am__aclocal_m4_deps)\n\tcd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh\n$(am__aclocal_m4_deps):\n\ninstall-libLTLIBRARIES: $(lib_LTLIBRARIES)\n\t@$(NORMAL_INSTALL)\n\t@list='$(lib_LTLIBRARIES)'; test -n \"$(libdir)\" || list=; \\\n\tlist2=; for p in $$list; do \\\n\t  if test -f $$p; then \\\n\t    list2=\"$$list2 $$p\"; \\\n\t  else :; fi; \\\n\tdone; \\\n\ttest -z \"$$list2\" || { \\\n\t  echo \" $(MKDIR_P) '$(DESTDIR)$(libdir)'\"; \\\n\t  $(MKDIR_P) \"$(DESTDIR)$(libdir)\" || exit 1; \\\n\t  echo \" $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) $$list2 '$(DESTDIR)$(libdir)'\"; \\\n\t  $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) $$list2 \"$(DESTDIR)$(libdir)\"; \\\n\t}\n\nuninstall-libLTLIBRARIES:\n\t@$(NORMAL_UNINSTALL)\n\t@list='$(lib_LTLIBRARIES)'; test -n \"$(libdir)\" || list=; \\\n\tfor p in $$list; do \\\n\t  $(am__strip_dir) \\\n\t  echo \" $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=uninstall rm -f '$(DESTDIR)$(libdir)/$$f'\"; \\\n\t  $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=uninstall rm -f \"$(DESTDIR)$(libdir)/$$f\"; \\\n\tdone\n\nclean-libLTLIBRARIES:\n\t-test -z \"$(lib_LTLIBRARIES)\" || rm -f $(lib_LTLIBRARIES)\n\t@list='$(lib_LTLIBRARIES)'; \\\n\tlocs=`for p in $$list; do echo $$p; done | \\\n\t      sed 's|^[^/]*$$|.|; s|/[^/]*$$||; s|$$|/so_locations|' | \\\n\t      sort -u`; \\\n\ttest -z \"$$locs\" || { \\\n\t  echo rm -f $${locs}; \\\n\t  rm -f $${locs}; \\\n\t}\n\ninstall-libfstLTLIBRARIES: $(libfst_LTLIBRARIES)\n\t@$(NORMAL_INSTALL)\n\t@list='$(libfst_LTLIBRARIES)'; test -n \"$(libfstdir)\" || list=; \\\n\tlist2=; for p in $$list; do \\\n\t  if test -f $$p; then \\\n\t    list2=\"$$list2 $$p\"; \\\n\t  else :; fi; \\\n\tdone; \\\n\ttest -z \"$$list2\" || { \\\n\t  echo \" $(MKDIR_P) '$(DESTDIR)$(libfstdir)'\"; \\\n\t  $(MKDIR_P) \"$(DESTDIR)$(libfstdir)\" || exit 1; \\\n\t  echo \" $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) $$list2 '$(DESTDIR)$(libfstdir)'\"; \\\n\t  $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) $$list2 \"$(DESTDIR)$(libfstdir)\"; \\\n\t}\n\nuninstall-libfstLTLIBRARIES:\n\t@$(NORMAL_UNINSTALL)\n\t@list='$(libfst_LTLIBRARIES)'; test -n \"$(libfstdir)\" || list=; \\\n\tfor p in $$list; do \\\n\t  $(am__strip_dir) \\\n\t  echo \" $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=uninstall rm -f '$(DESTDIR)$(libfstdir)/$$f'\"; \\\n\t  $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=uninstall rm -f \"$(DESTDIR)$(libfstdir)/$$f\"; \\\n\tdone\n\nclean-libfstLTLIBRARIES:\n\t-test -z \"$(libfst_LTLIBRARIES)\" || rm -f $(libfst_LTLIBRARIES)\n\t@list='$(libfst_LTLIBRARIES)'; \\\n\tlocs=`for p in $$list; do echo $$p; done | \\\n\t      sed 's|^[^/]*$$|.|; s|/[^/]*$$||; s|$$|/so_locations|' | \\\n\t      sort -u`; \\\n\ttest -z \"$$locs\" || { \\\n\t  echo rm -f $${locs}; \\\n\t  rm -f $${locs}; \\\n\t}\n\nlibfstlinearscript.la: $(libfstlinearscript_la_OBJECTS) $(libfstlinearscript_la_DEPENDENCIES) $(EXTRA_libfstlinearscript_la_DEPENDENCIES) \n\t$(AM_V_CXXLD)$(libfstlinearscript_la_LINK) $(am_libfstlinearscript_la_rpath) $(libfstlinearscript_la_OBJECTS) $(libfstlinearscript_la_LIBADD) $(LIBS)\n\nlinear_classifier-fst.la: $(linear_classifier_fst_la_OBJECTS) $(linear_classifier_fst_la_DEPENDENCIES) $(EXTRA_linear_classifier_fst_la_DEPENDENCIES) \n\t$(AM_V_CXXLD)$(linear_classifier_fst_la_LINK) $(am_linear_classifier_fst_la_rpath) $(linear_classifier_fst_la_OBJECTS) $(linear_classifier_fst_la_LIBADD) $(LIBS)\n\nlinear_tagger-fst.la: $(linear_tagger_fst_la_OBJECTS) $(linear_tagger_fst_la_DEPENDENCIES) $(EXTRA_linear_tagger_fst_la_DEPENDENCIES) \n\t$(AM_V_CXXLD)$(linear_tagger_fst_la_LINK) $(am_linear_tagger_fst_la_rpath) $(linear_tagger_fst_la_OBJECTS) $(linear_tagger_fst_la_LIBADD) $(LIBS)\ninstall-binPROGRAMS: $(bin_PROGRAMS)\n\t@$(NORMAL_INSTALL)\n\t@list='$(bin_PROGRAMS)'; test -n \"$(bindir)\" || list=; \\\n\tif test -n \"$$list\"; then \\\n\t  echo \" $(MKDIR_P) '$(DESTDIR)$(bindir)'\"; \\\n\t  $(MKDIR_P) \"$(DESTDIR)$(bindir)\" || exit 1; \\\n\tfi; \\\n\tfor p in $$list; do echo \"$$p $$p\"; done | \\\n\tsed 's/$(EXEEXT)$$//' | \\\n\twhile read p p1; do if test -f $$p \\\n\t || test -f $$p1 \\\n\t  ; then echo \"$$p\"; echo \"$$p\"; else :; fi; \\\n\tdone | \\\n\tsed -e 'p;s,.*/,,;n;h' \\\n\t    -e 's|.*|.|' \\\n\t    -e 'p;x;s,.*/,,;s/$(EXEEXT)$$//;$(transform);s/$$/$(EXEEXT)/' | \\\n\tsed 'N;N;N;s,\\n, ,g' | \\\n\t$(AWK) 'BEGIN { files[\".\"] = \"\"; dirs[\".\"] = 1 } \\\n\t  { d=$$3; if (dirs[d] != 1) { print \"d\", d; dirs[d] = 1 } \\\n\t    if ($$2 == $$4) files[d] = files[d] \" \" $$1; \\\n\t    else { print \"f\", $$3 \"/\" $$4, $$1; } } \\\n\t  END { for (d in files) print \"f\", d, files[d] }' | \\\n\twhile read type dir files; do \\\n\t    if test \"$$dir\" = .; then dir=; else dir=/$$dir; fi; \\\n\t    test -z \"$$files\" || { \\\n\t    echo \" $(INSTALL_PROGRAM_ENV) $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL_PROGRAM) $$files '$(DESTDIR)$(bindir)$$dir'\"; \\\n\t    $(INSTALL_PROGRAM_ENV) $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL_PROGRAM) $$files \"$(DESTDIR)$(bindir)$$dir\" || exit $$?; \\\n\t    } \\\n\t; done\n\nuninstall-binPROGRAMS:\n\t@$(NORMAL_UNINSTALL)\n\t@list='$(bin_PROGRAMS)'; test -n \"$(bindir)\" || list=; \\\n\tfiles=`for p in $$list; do echo \"$$p\"; done | \\\n\t  sed -e 'h;s,^.*/,,;s/$(EXEEXT)$$//;$(transform)' \\\n\t      -e 's/$$/$(EXEEXT)/' \\\n\t`; \\\n\ttest -n \"$$list\" || exit 0; \\\n\techo \" ( cd '$(DESTDIR)$(bindir)' && rm -f\" $$files \")\"; \\\n\tcd \"$(DESTDIR)$(bindir)\" && rm -f $$files\n\nclean-binPROGRAMS:\n\t@list='$(bin_PROGRAMS)'; test -n \"$$list\" || exit 0; \\\n\techo \" rm -f\" $$list; \\\n\trm -f $$list || exit $$?; \\\n\ttest -n \"$(EXEEXT)\" || exit 0; \\\n\tlist=`for p in $$list; do echo \"$$p\"; done | sed 's/$(EXEEXT)$$//'`; \\\n\techo \" rm -f\" $$list; \\\n\trm -f $$list\n\nfstlinear$(EXEEXT): $(fstlinear_OBJECTS) $(fstlinear_DEPENDENCIES) $(EXTRA_fstlinear_DEPENDENCIES) \n\t@rm -f fstlinear$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(fstlinear_OBJECTS) $(fstlinear_LDADD) $(LIBS)\n\nfstloglinearapply$(EXEEXT): $(fstloglinearapply_OBJECTS) $(fstloglinearapply_DEPENDENCIES) $(EXTRA_fstloglinearapply_DEPENDENCIES) \n\t@rm -f fstloglinearapply$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(fstloglinearapply_OBJECTS) $(fstloglinearapply_LDADD) $(LIBS)\n\nmostlyclean-compile:\n\t-rm -f *.$(OBJEXT)\n\ndistclean-compile:\n\t-rm -f *.tab.c\n\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstlinear.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstloglinearapply.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/linear-classifier-fst.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/linear-tagger-fst.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/linearscript.Plo@am__quote@\n\n.cc.o:\n@am__fastdepCXX_TRUE@\t$(AM_V_CXX)depbase=`echo $@ | sed 's|[^/]*$$|$(DEPDIR)/&|;s|\\.o$$||'`;\\\n@am__fastdepCXX_TRUE@\t$(CXXCOMPILE) -MT $@ -MD -MP -MF $$depbase.Tpo -c -o $@ $< &&\\\n@am__fastdepCXX_TRUE@\t$(am__mv) $$depbase.Tpo $$depbase.Po\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\t$(AM_V_CXX)source='$<' object='$@' libtool=no @AMDEPBACKSLASH@\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\tDEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@\n@am__fastdepCXX_FALSE@\t$(AM_V_CXX@am__nodep@)$(CXXCOMPILE) -c -o $@ $<\n\n.cc.obj:\n@am__fastdepCXX_TRUE@\t$(AM_V_CXX)depbase=`echo $@ | sed 's|[^/]*$$|$(DEPDIR)/&|;s|\\.obj$$||'`;\\\n@am__fastdepCXX_TRUE@\t$(CXXCOMPILE) -MT $@ -MD -MP -MF $$depbase.Tpo -c -o $@ `$(CYGPATH_W) '$<'` &&\\\n@am__fastdepCXX_TRUE@\t$(am__mv) $$depbase.Tpo $$depbase.Po\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\t$(AM_V_CXX)source='$<' object='$@' libtool=no @AMDEPBACKSLASH@\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\tDEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@\n@am__fastdepCXX_FALSE@\t$(AM_V_CXX@am__nodep@)$(CXXCOMPILE) -c -o $@ `$(CYGPATH_W) '$<'`\n\n.cc.lo:\n@am__fastdepCXX_TRUE@\t$(AM_V_CXX)depbase=`echo $@ | sed 's|[^/]*$$|$(DEPDIR)/&|;s|\\.lo$$||'`;\\\n@am__fastdepCXX_TRUE@\t$(LTCXXCOMPILE) -MT $@ -MD -MP -MF $$depbase.Tpo -c -o $@ $< &&\\\n@am__fastdepCXX_TRUE@\t$(am__mv) $$depbase.Tpo $$depbase.Plo\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\t$(AM_V_CXX)source='$<' object='$@' libtool=yes @AMDEPBACKSLASH@\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\tDEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@\n@am__fastdepCXX_FALSE@\t$(AM_V_CXX@am__nodep@)$(LTCXXCOMPILE) -c -o $@ $<\n\nmostlyclean-libtool:\n\t-rm -f *.lo\n\nclean-libtool:\n\t-rm -rf .libs _libs\n\nID: $(am__tagged_files)\n\t$(am__define_uniq_tagged_files); mkid -fID $$unique\ntags: tags-am\nTAGS: tags\n\ntags-am: $(TAGS_DEPENDENCIES) $(am__tagged_files)\n\tset x; \\\n\there=`pwd`; \\\n\t$(am__define_uniq_tagged_files); \\\n\tshift; \\\n\tif test -z \"$(ETAGS_ARGS)$$*$$unique\"; then :; else \\\n\t  test -n \"$$unique\" || unique=$$empty_fix; \\\n\t  if test $$# -gt 0; then \\\n\t    $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \\\n\t      \"$$@\" $$unique; \\\n\t  else \\\n\t    $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \\\n\t      $$unique; \\\n\t  fi; \\\n\tfi\nctags: ctags-am\n\nCTAGS: ctags\nctags-am: $(TAGS_DEPENDENCIES) $(am__tagged_files)\n\t$(am__define_uniq_tagged_files); \\\n\ttest -z \"$(CTAGS_ARGS)$$unique\" \\\n\t  || $(CTAGS) $(CTAGSFLAGS) $(AM_CTAGSFLAGS) $(CTAGS_ARGS) \\\n\t     $$unique\n\nGTAGS:\n\there=`$(am__cd) $(top_builddir) && pwd` \\\n\t  && $(am__cd) $(top_srcdir) \\\n\t  && gtags -i $(GTAGS_ARGS) \"$$here\"\ncscopelist: cscopelist-am\n\ncscopelist-am: $(am__tagged_files)\n\tlist='$(am__tagged_files)'; \\\n\tcase \"$(srcdir)\" in \\\n\t  [\\\\/]* | ?:[\\\\/]*) sdir=\"$(srcdir)\" ;; \\\n\t  *) sdir=$(subdir)/$(srcdir) ;; \\\n\tesac; \\\n\tfor i in $$list; do \\\n\t  if test -f \"$$i\"; then \\\n\t    echo \"$(subdir)/$$i\"; \\\n\t  else \\\n\t    echo \"$$sdir/$$i\"; \\\n\t  fi; \\\n\tdone >> $(top_builddir)/cscope.files\n\ndistclean-tags:\n\t-rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags\n\ndistdir: $(DISTFILES)\n\t@srcdirstrip=`echo \"$(srcdir)\" | sed 's/[].[^$$\\\\*]/\\\\\\\\&/g'`; \\\n\ttopsrcdirstrip=`echo \"$(top_srcdir)\" | sed 's/[].[^$$\\\\*]/\\\\\\\\&/g'`; \\\n\tlist='$(DISTFILES)'; \\\n\t  dist_files=`for file in $$list; do echo $$file; done | \\\n\t  sed -e \"s|^$$srcdirstrip/||;t\" \\\n\t      -e \"s|^$$topsrcdirstrip/|$(top_builddir)/|;t\"`; \\\n\tcase $$dist_files in \\\n\t  */*) $(MKDIR_P) `echo \"$$dist_files\" | \\\n\t\t\t   sed '/\\//!d;s|^|$(distdir)/|;s,/[^/]*$$,,' | \\\n\t\t\t   sort -u` ;; \\\n\tesac; \\\n\tfor file in $$dist_files; do \\\n\t  if test -f $$file || test -d $$file; then d=.; else d=$(srcdir); fi; \\\n\t  if test -d $$d/$$file; then \\\n\t    dir=`echo \"/$$file\" | sed -e 's,/[^/]*$$,,'`; \\\n\t    if test -d \"$(distdir)/$$file\"; then \\\n\t      find \"$(distdir)/$$file\" -type d ! -perm -700 -exec chmod u+rwx {} \\;; \\\n\t    fi; \\\n\t    if test -d $(srcdir)/$$file && test $$d != $(srcdir); then \\\n\t      cp -fpR $(srcdir)/$$file \"$(distdir)$$dir\" || exit 1; \\\n\t      find \"$(distdir)/$$file\" -type d ! -perm -700 -exec chmod u+rwx {} \\;; \\\n\t    fi; \\\n\t    cp -fpR $$d/$$file \"$(distdir)$$dir\" || exit 1; \\\n\t  else \\\n\t    test -f \"$(distdir)/$$file\" \\\n\t    || cp -p $$d/$$file \"$(distdir)/$$file\" \\\n\t    || exit 1; \\\n\t  fi; \\\n\tdone\ncheck-am: all-am\ncheck: check-am\nall-am: Makefile $(LTLIBRARIES) $(PROGRAMS)\ninstall-binPROGRAMS: install-libLTLIBRARIES\n\ninstalldirs:\n\tfor dir in \"$(DESTDIR)$(libdir)\" \"$(DESTDIR)$(libfstdir)\" \"$(DESTDIR)$(bindir)\"; do \\\n\t  test -z \"$$dir\" || $(MKDIR_P) \"$$dir\"; \\\n\tdone\ninstall: install-am\ninstall-exec: install-exec-am\ninstall-data: install-data-am\nuninstall: uninstall-am\n\ninstall-am: all-am\n\t@$(MAKE) $(AM_MAKEFLAGS) install-exec-am install-data-am\n\ninstallcheck: installcheck-am\ninstall-strip:\n\tif test -z '$(STRIP)'; then \\\n\t  $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" \\\n\t    install_sh_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" INSTALL_STRIP_FLAG=-s \\\n\t      install; \\\n\telse \\\n\t  $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" \\\n\t    install_sh_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" INSTALL_STRIP_FLAG=-s \\\n\t    \"INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'\" install; \\\n\tfi\nmostlyclean-generic:\n\nclean-generic:\n\ndistclean-generic:\n\t-test -z \"$(CONFIG_CLEAN_FILES)\" || rm -f $(CONFIG_CLEAN_FILES)\n\t-test . = \"$(srcdir)\" || test -z \"$(CONFIG_CLEAN_VPATH_FILES)\" || rm -f $(CONFIG_CLEAN_VPATH_FILES)\n\nmaintainer-clean-generic:\n\t@echo \"This command is intended for maintainers to use\"\n\t@echo \"it deletes files that may require special tools to rebuild.\"\nclean: clean-am\n\nclean-am: clean-binPROGRAMS clean-generic clean-libLTLIBRARIES \\\n\tclean-libfstLTLIBRARIES clean-libtool mostlyclean-am\n\ndistclean: distclean-am\n\t-rm -rf ./$(DEPDIR)\n\t-rm -f Makefile\ndistclean-am: clean-am distclean-compile distclean-generic \\\n\tdistclean-tags\n\ndvi: dvi-am\n\ndvi-am:\n\nhtml: html-am\n\nhtml-am:\n\ninfo: info-am\n\ninfo-am:\n\ninstall-data-am: install-libfstLTLIBRARIES\n\ninstall-dvi: install-dvi-am\n\ninstall-dvi-am:\n\ninstall-exec-am: install-binPROGRAMS install-libLTLIBRARIES\n\ninstall-html: install-html-am\n\ninstall-html-am:\n\ninstall-info: install-info-am\n\ninstall-info-am:\n\ninstall-man:\n\ninstall-pdf: install-pdf-am\n\ninstall-pdf-am:\n\ninstall-ps: install-ps-am\n\ninstall-ps-am:\n\ninstallcheck-am:\n\nmaintainer-clean: maintainer-clean-am\n\t-rm -rf ./$(DEPDIR)\n\t-rm -f Makefile\nmaintainer-clean-am: distclean-am maintainer-clean-generic\n\nmostlyclean: mostlyclean-am\n\nmostlyclean-am: mostlyclean-compile mostlyclean-generic \\\n\tmostlyclean-libtool\n\npdf: pdf-am\n\npdf-am:\n\nps: ps-am\n\nps-am:\n\nuninstall-am: uninstall-binPROGRAMS uninstall-libLTLIBRARIES \\\n\tuninstall-libfstLTLIBRARIES\n\n.MAKE: install-am install-strip\n\n.PHONY: CTAGS GTAGS TAGS all all-am check check-am clean \\\n\tclean-binPROGRAMS clean-generic clean-libLTLIBRARIES \\\n\tclean-libfstLTLIBRARIES clean-libtool cscopelist-am ctags \\\n\tctags-am distclean distclean-compile distclean-generic \\\n\tdistclean-libtool distclean-tags distdir dvi dvi-am html \\\n\thtml-am info info-am install install-am install-binPROGRAMS \\\n\tinstall-data install-data-am install-dvi install-dvi-am \\\n\tinstall-exec install-exec-am install-html install-html-am \\\n\tinstall-info install-info-am install-libLTLIBRARIES \\\n\tinstall-libfstLTLIBRARIES install-man install-pdf \\\n\tinstall-pdf-am install-ps install-ps-am install-strip \\\n\tinstallcheck installcheck-am installdirs maintainer-clean \\\n\tmaintainer-clean-generic mostlyclean mostlyclean-compile \\\n\tmostlyclean-generic mostlyclean-libtool pdf pdf-am ps ps-am \\\n\ttags tags-am uninstall uninstall-am uninstall-binPROGRAMS \\\n\tuninstall-libLTLIBRARIES uninstall-libfstLTLIBRARIES\n\n.PRECIOUS: Makefile\n\n\n# Tell versions [3.59,3.63) of GNU make to not export all variables.\n# Otherwise a system limit (for SysV at least) may be exceeded.\n.NOEXPORT:\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/extensions/linear/fstlinear.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/extensions/linear/linearscript.h>\n\n#include <fst/flags.h>\n\nDEFINE_string(arc_type, \"standard\", \"Output arc type\");\n\nDEFINE_string(epsilon_symbol, \"<eps>\", \"Epsilon symbol\");\nDEFINE_string(unknown_symbol, \"<unk>\", \"Unknown word symbol\");\n\nDEFINE_string(vocab, \"\", \"Path to the vocabulary file\");\nDEFINE_string(out, \"\", \"Path to the output binary\");\n\nDEFINE_string(save_isymbols, \"\", \"Save input symbol table to file\");\nDEFINE_string(save_fsymbols, \"\", \"Save feature symbol table to file\");\nDEFINE_string(save_osymbols, \"\", \"Save output symbol table to file\");\n\nint main(int argc, char **argv) {\n  // TODO(wuke): more detailed usage\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(argv[0], &argc, &argv, true);\n  fst::script::ValidateDelimiter();\n  fst::script::ValidateEmptySymbol();\n\n  if (argc == 1) {\n    ShowUsage();\n    return 1;\n  }\n\n  fst::script::LinearCompile(FLAGS_arc_type, FLAGS_epsilon_symbol,\n                                 FLAGS_unknown_symbol, FLAGS_vocab, argv + 1,\n                                 argc - 1, FLAGS_out, FLAGS_save_isymbols,\n                                 FLAGS_save_fsymbols, FLAGS_save_osymbols);\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/extensions/linear/fstloglinearapply.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/compat.h>\n#include <fst/extensions/linear/linear-fst.h>\n#include <fst/extensions/linear/loglinear-apply.h>\n#include <fst/vector-fst.h>\n\n#include <fst/flags.h>\n#include <fst/log.h>\n\nDEFINE_bool(normalize, true, \"Normalize to get posterior\");\n\nint main(int argc, char **argv) {\n  string usage =\n      \"Applies an FST to another FST, treating the second as a log-linear \"\n      \"model.\\n\\n  \"\n      \"Usage: \";\n  usage += argv[0];\n  usage += \" in.fst linear.fst [out.fst]\\n\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n  if (argc < 3 || argc > 4) {\n    ShowUsage();\n    return 1;\n  }\n\n  string in_name = strcmp(argv[1], \"-\") != 0 ? argv[1] : \"\";\n  string linear_name = (argc > 2 && (strcmp(argv[2], \"-\") != 0)) ? argv[2] : \"\";\n  string out_name = argc > 3 ? argv[3] : \"\";\n\n  if (in_name.empty() && linear_name.empty()) {\n    LOG(ERROR) << argv[0] << \": Can't take both inputs from standard input.\";\n    return 1;\n  }\n\n  fst::StdFst *ifst1 = fst::StdFst::Read(in_name);\n  if (!ifst1) return 1;\n\n  fst::StdFst *ifst2 = fst::StdFst::Read(linear_name);\n  if (!ifst2) return 1;\n\n  fst::StdVectorFst ofst;\n\n  LogLinearApply(*ifst1, *ifst2, &ofst, FLAGS_normalize);\n\n  ofst.Write(out_name);\n\n  return 0;\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/extensions/linear/linear-classifier-fst.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/extensions/linear/linear-fst.h>\n#include <fst/register.h>\n\nusing fst::LinearClassifierFst;\nusing fst::StdArc;\nusing fst::LogArc;\n\nREGISTER_FST(LinearClassifierFst, StdArc);\nREGISTER_FST(LinearClassifierFst, LogArc);\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/extensions/linear/linear-tagger-fst.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/extensions/linear/linear-fst.h>\n#include <fst/register.h>\n\nusing fst::LinearTaggerFst;\nusing fst::StdArc;\nusing fst::LogArc;\n\nREGISTER_FST(LinearTaggerFst, StdArc);\nREGISTER_FST(LinearTaggerFst, LogArc);\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/extensions/linear/linearscript.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <cctype>\n#include <cstdio>\n#include <set>\n\n#include <fst/compat.h>\n#include <fst/flags.h>\n#include <fst/extensions/linear/linearscript.h>\n#include <fst/arc.h>\n#include <fstream>\n#include <fst/script/script-impl.h>\n\nDEFINE_string(delimiter, \"|\",\n              \"Single non-white-space character delimiter inside sequences of \"\n              \"feature symbols and output symbols\");\nDEFINE_string(empty_symbol, \"<empty>\",\n              \"Special symbol that designates an empty sequence\");\n\nDEFINE_string(start_symbol, \"<s>\", \"Start of sentence symbol\");\nDEFINE_string(end_symbol, \"</s>\", \"End of sentence symbol\");\n\nDEFINE_bool(classifier, false,\n            \"Treat input model as a classifier instead of a tagger\");\n\nnamespace fst {\nnamespace script {\n\nbool ValidateDelimiter() {\n  if (FLAGS_delimiter.size() == 1 && !std::isspace(FLAGS_delimiter[0]))\n    return true;\n  return false;\n}\n\nbool ValidateEmptySymbol() {\n  bool okay = !FLAGS_empty_symbol.empty();\n  for (size_t i = 0; i < FLAGS_empty_symbol.size(); ++i) {\n    char c = FLAGS_empty_symbol[i];\n    if (std::isspace(c)) okay = false;\n  }\n  return okay;\n}\n\nvoid LinearCompile(const string &arc_type, const string &epsilon_symbol,\n                   const string &unknown_symbol, const string &vocab,\n                   char **models, int models_len, const string &out,\n                   const string &save_isymbols, const string &save_fsymbols,\n                   const string &save_osymbols) {\n  LinearCompileArgs args(epsilon_symbol, unknown_symbol, vocab, models,\n                         models_len, out, save_isymbols, save_fsymbols,\n                         save_osymbols);\n  Apply<Operation<LinearCompileArgs>>(\"LinearCompileTpl\", arc_type, &args);\n}\n\n// Instantiate templates for common arc types\nREGISTER_FST_LINEAR_OPERATIONS(StdArc);\nREGISTER_FST_LINEAR_OPERATIONS(LogArc);\n\nvoid SplitByWhitespace(const string &str, std::vector<string> *out) {\n  out->clear();\n  std::istringstream strm(str);\n  string buf;\n  while (strm >> buf) out->push_back(buf);\n}\n\nint ScanNumClasses(char **models, int models_len) {\n  std::set<string> preds;\n  for (int i = 0; i < models_len; ++i) {\n    std::ifstream in(models[i]);\n    if (!in) LOG(FATAL) << \"Failed to open \" << models[i];\n\n    string line;\n    std::getline(in, line);\n\n    size_t num_line = 1;\n    while (std::getline(in, line)) {\n      ++num_line;\n      std::vector<string> fields;\n      SplitByWhitespace(line, &fields);\n      if (fields.size() != 3)\n        LOG(FATAL) << \"Wrong number of fields in source \" << models[i]\n                   << \", line \" << num_line;\n      preds.insert(fields[1]);\n    }\n  }\n  return preds.size();\n}\n\n}  // namespace script\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/extensions/lookahead/CMakeLists.txt",
    "content": "\nadd_library(fstlookahead\n  arc_lookahead-fst.cc \n  ilabel_lookahead-fst.cc\n  olabel_lookahead-fst.cc\n)\ntarget_link_libraries(fstlookahead fst)\nset_target_properties(fstlookahead PROPERTIES \n  SOVERSION \"${SOVERSION}\"\n  FOLDER lookahead  \n)\n\ninstall(TARGETS fstlookahead \n\tLIBRARY DESTINATION lib\n\tARCHIVE DESTINATION lib\n\tRUNTIME DESTINATION lib\n)\n  \nfunction (add_module _name)\n    add_library(${ARGV})\n    if (TARGET ${_name})\n        target_link_libraries(${_name} fst)\n    endif()\n    set_target_properties(${_name} PROPERTIES \n        WINDOWS_EXPORT_ALL_SYMBOLS true\n        FOLDER lookahead/modules\n    )\n\n    install(TARGETS ${_name} LIBRARY DESTINATION lib/fst)\nendfunction()\n  \nadd_module(arc_lookahead-fst MODULE\n  arc_lookahead-fst.cc)\n \nadd_module(ilabel_lookahead-fst MODULE\n  ilabel_lookahead-fst.cc)\n\nadd_module(olabel_lookahead-fst MODULE\n  olabel_lookahead-fst.cc)\n\n\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/extensions/lookahead/Makefile.am",
    "content": "AM_CPPFLAGS = -I$(srcdir)/../../include $(ICU_CPPFLAGS)\n\nlibfstdir = @libfstdir@\nlibfst_LTLIBRARIES = arc_lookahead-fst.la \\\nilabel_lookahead-fst.la olabel_lookahead-fst.la\n\nlib_LTLIBRARIES = libfstlookahead.la\n\nlibfstlookahead_la_SOURCES = arc_lookahead-fst.cc ilabel_lookahead-fst.cc \\\n                             olabel_lookahead-fst.cc\nlibfstlookahead_la_LDFLAGS = -version-info 13:0:0\nlibfstlookahead_la_LIBADD = ../../lib/libfst.la -lm $(DL_LIBS)\n\narc_lookahead_fst_la_SOURCES = arc_lookahead-fst.cc\narc_lookahead_fst_la_LDFLAGS = -module\n\nilabel_lookahead_fst_la_SOURCES = ilabel_lookahead-fst.cc\nilabel_lookahead_fst_la_LDFLAGS = -module\n\nolabel_lookahead_fst_la_SOURCES = olabel_lookahead-fst.cc\nolabel_lookahead_fst_la_LDFLAGS = -module\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/extensions/lookahead/Makefile.in",
    "content": "# Makefile.in generated by automake 1.15.1 from Makefile.am.\n# @configure_input@\n\n# Copyright (C) 1994-2017 Free Software Foundation, Inc.\n\n# This Makefile.in is free software; the Free Software Foundation\n# gives unlimited permission to copy and/or distribute it,\n# with or without modifications, as long as this notice is preserved.\n\n# This program is distributed in the hope that it will be useful,\n# but WITHOUT ANY WARRANTY, to the extent permitted by law; without\n# even the implied warranty of MERCHANTABILITY or FITNESS FOR A\n# PARTICULAR PURPOSE.\n\n@SET_MAKE@\n\nVPATH = @srcdir@\nam__is_gnu_make = { \\\n  if test -z '$(MAKELEVEL)'; then \\\n    false; \\\n  elif test -n '$(MAKE_HOST)'; then \\\n    true; \\\n  elif test -n '$(MAKE_VERSION)' && test -n '$(CURDIR)'; then \\\n    true; \\\n  else \\\n    false; \\\n  fi; \\\n}\nam__make_running_with_option = \\\n  case $${target_option-} in \\\n      ?) ;; \\\n      *) echo \"am__make_running_with_option: internal error: invalid\" \\\n              \"target option '$${target_option-}' specified\" >&2; \\\n         exit 1;; \\\n  esac; \\\n  has_opt=no; \\\n  sane_makeflags=$$MAKEFLAGS; \\\n  if $(am__is_gnu_make); then \\\n    sane_makeflags=$$MFLAGS; \\\n  else \\\n    case $$MAKEFLAGS in \\\n      *\\\\[\\ \\\t]*) \\\n        bs=\\\\; \\\n        sane_makeflags=`printf '%s\\n' \"$$MAKEFLAGS\" \\\n          | sed \"s/$$bs$$bs[$$bs $$bs\t]*//g\"`;; \\\n    esac; \\\n  fi; \\\n  skip_next=no; \\\n  strip_trailopt () \\\n  { \\\n    flg=`printf '%s\\n' \"$$flg\" | sed \"s/$$1.*$$//\"`; \\\n  }; \\\n  for flg in $$sane_makeflags; do \\\n    test $$skip_next = yes && { skip_next=no; continue; }; \\\n    case $$flg in \\\n      *=*|--*) continue;; \\\n        -*I) strip_trailopt 'I'; skip_next=yes;; \\\n      -*I?*) strip_trailopt 'I';; \\\n        -*O) strip_trailopt 'O'; skip_next=yes;; \\\n      -*O?*) strip_trailopt 'O';; \\\n        -*l) strip_trailopt 'l'; skip_next=yes;; \\\n      -*l?*) strip_trailopt 'l';; \\\n      -[dEDm]) skip_next=yes;; \\\n      -[JT]) skip_next=yes;; \\\n    esac; \\\n    case $$flg in \\\n      *$$target_option*) has_opt=yes; break;; \\\n    esac; \\\n  done; \\\n  test $$has_opt = yes\nam__make_dryrun = (target_option=n; $(am__make_running_with_option))\nam__make_keepgoing = (target_option=k; $(am__make_running_with_option))\npkgdatadir = $(datadir)/@PACKAGE@\npkgincludedir = $(includedir)/@PACKAGE@\npkglibdir = $(libdir)/@PACKAGE@\npkglibexecdir = $(libexecdir)/@PACKAGE@\nam__cd = CDPATH=\"$${ZSH_VERSION+.}$(PATH_SEPARATOR)\" && cd\ninstall_sh_DATA = $(install_sh) -c -m 644\ninstall_sh_PROGRAM = $(install_sh) -c\ninstall_sh_SCRIPT = $(install_sh) -c\nINSTALL_HEADER = $(INSTALL_DATA)\ntransform = $(program_transform_name)\nNORMAL_INSTALL = :\nPRE_INSTALL = :\nPOST_INSTALL = :\nNORMAL_UNINSTALL = :\nPRE_UNINSTALL = :\nPOST_UNINSTALL = :\nbuild_triplet = @build@\nhost_triplet = @host@\nsubdir = src/extensions/lookahead\nACLOCAL_M4 = $(top_srcdir)/aclocal.m4\nam__aclocal_m4_deps = $(top_srcdir)/m4/ac_python_devel.m4 \\\n\t$(top_srcdir)/m4/libtool.m4 $(top_srcdir)/m4/ltoptions.m4 \\\n\t$(top_srcdir)/m4/ltsugar.m4 $(top_srcdir)/m4/ltversion.m4 \\\n\t$(top_srcdir)/m4/lt~obsolete.m4 $(top_srcdir)/configure.ac\nam__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \\\n\t$(ACLOCAL_M4)\nDIST_COMMON = $(srcdir)/Makefile.am $(am__DIST_COMMON)\nmkinstalldirs = $(install_sh) -d\nCONFIG_HEADER = $(top_builddir)/config.h \\\n\t$(top_builddir)/src/include/fst/config.h\nCONFIG_CLEAN_FILES =\nCONFIG_CLEAN_VPATH_FILES =\nam__vpath_adj_setup = srcdirstrip=`echo \"$(srcdir)\" | sed 's|.|.|g'`;\nam__vpath_adj = case $$p in \\\n    $(srcdir)/*) f=`echo \"$$p\" | sed \"s|^$$srcdirstrip/||\"`;; \\\n    *) f=$$p;; \\\n  esac;\nam__strip_dir = f=`echo $$p | sed -e 's|^.*/||'`;\nam__install_max = 40\nam__nobase_strip_setup = \\\n  srcdirstrip=`echo \"$(srcdir)\" | sed 's/[].[^$$\\\\*|]/\\\\\\\\&/g'`\nam__nobase_strip = \\\n  for p in $$list; do echo \"$$p\"; done | sed -e \"s|$$srcdirstrip/||\"\nam__nobase_list = $(am__nobase_strip_setup); \\\n  for p in $$list; do echo \"$$p $$p\"; done | \\\n  sed \"s| $$srcdirstrip/| |;\"' / .*\\//!s/ .*/ ./; s,\\( .*\\)/[^/]*$$,\\1,' | \\\n  $(AWK) 'BEGIN { files[\".\"] = \"\" } { files[$$2] = files[$$2] \" \" $$1; \\\n    if (++n[$$2] == $(am__install_max)) \\\n      { print $$2, files[$$2]; n[$$2] = 0; files[$$2] = \"\" } } \\\n    END { for (dir in files) print dir, files[dir] }'\nam__base_list = \\\n  sed '$$!N;$$!N;$$!N;$$!N;$$!N;$$!N;$$!N;s/\\n/ /g' | \\\n  sed '$$!N;$$!N;$$!N;$$!N;s/\\n/ /g'\nam__uninstall_files_from_dir = { \\\n  test -z \"$$files\" \\\n    || { test ! -d \"$$dir\" && test ! -f \"$$dir\" && test ! -r \"$$dir\"; } \\\n    || { echo \" ( cd '$$dir' && rm -f\" $$files \")\"; \\\n         $(am__cd) \"$$dir\" && rm -f $$files; }; \\\n  }\nam__installdirs = \"$(DESTDIR)$(libdir)\" \"$(DESTDIR)$(libfstdir)\"\nLTLIBRARIES = $(lib_LTLIBRARIES) $(libfst_LTLIBRARIES)\narc_lookahead_fst_la_LIBADD =\nam_arc_lookahead_fst_la_OBJECTS = arc_lookahead-fst.lo\narc_lookahead_fst_la_OBJECTS = $(am_arc_lookahead_fst_la_OBJECTS)\nAM_V_lt = $(am__v_lt_@AM_V@)\nam__v_lt_ = $(am__v_lt_@AM_DEFAULT_V@)\nam__v_lt_0 = --silent\nam__v_lt_1 = \narc_lookahead_fst_la_LINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX \\\n\t$(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=link $(CXXLD) \\\n\t$(AM_CXXFLAGS) $(CXXFLAGS) $(arc_lookahead_fst_la_LDFLAGS) \\\n\t$(LDFLAGS) -o $@\nilabel_lookahead_fst_la_LIBADD =\nam_ilabel_lookahead_fst_la_OBJECTS = ilabel_lookahead-fst.lo\nilabel_lookahead_fst_la_OBJECTS =  \\\n\t$(am_ilabel_lookahead_fst_la_OBJECTS)\nilabel_lookahead_fst_la_LINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX \\\n\t$(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=link $(CXXLD) \\\n\t$(AM_CXXFLAGS) $(CXXFLAGS) $(ilabel_lookahead_fst_la_LDFLAGS) \\\n\t$(LDFLAGS) -o $@\nam__DEPENDENCIES_1 =\nlibfstlookahead_la_DEPENDENCIES = ../../lib/libfst.la \\\n\t$(am__DEPENDENCIES_1)\nam_libfstlookahead_la_OBJECTS = arc_lookahead-fst.lo \\\n\tilabel_lookahead-fst.lo olabel_lookahead-fst.lo\nlibfstlookahead_la_OBJECTS = $(am_libfstlookahead_la_OBJECTS)\nlibfstlookahead_la_LINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX \\\n\t$(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=link $(CXXLD) \\\n\t$(AM_CXXFLAGS) $(CXXFLAGS) $(libfstlookahead_la_LDFLAGS) \\\n\t$(LDFLAGS) -o $@\nolabel_lookahead_fst_la_LIBADD =\nam_olabel_lookahead_fst_la_OBJECTS = olabel_lookahead-fst.lo\nolabel_lookahead_fst_la_OBJECTS =  \\\n\t$(am_olabel_lookahead_fst_la_OBJECTS)\nolabel_lookahead_fst_la_LINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX \\\n\t$(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=link $(CXXLD) \\\n\t$(AM_CXXFLAGS) $(CXXFLAGS) $(olabel_lookahead_fst_la_LDFLAGS) \\\n\t$(LDFLAGS) -o $@\nAM_V_P = $(am__v_P_@AM_V@)\nam__v_P_ = $(am__v_P_@AM_DEFAULT_V@)\nam__v_P_0 = false\nam__v_P_1 = :\nAM_V_GEN = $(am__v_GEN_@AM_V@)\nam__v_GEN_ = $(am__v_GEN_@AM_DEFAULT_V@)\nam__v_GEN_0 = @echo \"  GEN     \" $@;\nam__v_GEN_1 = \nAM_V_at = $(am__v_at_@AM_V@)\nam__v_at_ = $(am__v_at_@AM_DEFAULT_V@)\nam__v_at_0 = @\nam__v_at_1 = \nDEFAULT_INCLUDES = \ndepcomp = $(SHELL) $(top_srcdir)/depcomp\nam__depfiles_maybe = depfiles\nam__mv = mv -f\nCXXCOMPILE = $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) \\\n\t$(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS)\nLTCXXCOMPILE = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \\\n\t$(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) \\\n\t$(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) \\\n\t$(AM_CXXFLAGS) $(CXXFLAGS)\nAM_V_CXX = $(am__v_CXX_@AM_V@)\nam__v_CXX_ = $(am__v_CXX_@AM_DEFAULT_V@)\nam__v_CXX_0 = @echo \"  CXX     \" $@;\nam__v_CXX_1 = \nCXXLD = $(CXX)\nCXXLINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \\\n\t$(LIBTOOLFLAGS) --mode=link $(CXXLD) $(AM_CXXFLAGS) \\\n\t$(CXXFLAGS) $(AM_LDFLAGS) $(LDFLAGS) -o $@\nAM_V_CXXLD = $(am__v_CXXLD_@AM_V@)\nam__v_CXXLD_ = $(am__v_CXXLD_@AM_DEFAULT_V@)\nam__v_CXXLD_0 = @echo \"  CXXLD   \" $@;\nam__v_CXXLD_1 = \nSOURCES = $(arc_lookahead_fst_la_SOURCES) \\\n\t$(ilabel_lookahead_fst_la_SOURCES) \\\n\t$(libfstlookahead_la_SOURCES) \\\n\t$(olabel_lookahead_fst_la_SOURCES)\nDIST_SOURCES = $(arc_lookahead_fst_la_SOURCES) \\\n\t$(ilabel_lookahead_fst_la_SOURCES) \\\n\t$(libfstlookahead_la_SOURCES) \\\n\t$(olabel_lookahead_fst_la_SOURCES)\nam__can_run_installinfo = \\\n  case $$AM_UPDATE_INFO_DIR in \\\n    n|no|NO) false;; \\\n    *) (install-info --version) >/dev/null 2>&1;; \\\n  esac\nam__tagged_files = $(HEADERS) $(SOURCES) $(TAGS_FILES) $(LISP)\n# Read a list of newline-separated strings from the standard input,\n# and print each of them once, without duplicates.  Input order is\n# *not* preserved.\nam__uniquify_input = $(AWK) '\\\n  BEGIN { nonempty = 0; } \\\n  { items[$$0] = 1; nonempty = 1; } \\\n  END { if (nonempty) { for (i in items) print i; }; } \\\n'\n# Make sure the list of sources is unique.  This is necessary because,\n# e.g., the same source file might be shared among _SOURCES variables\n# for different programs/libraries.\nam__define_uniq_tagged_files = \\\n  list='$(am__tagged_files)'; \\\n  unique=`for i in $$list; do \\\n    if test -f \"$$i\"; then echo $$i; else echo $(srcdir)/$$i; fi; \\\n  done | $(am__uniquify_input)`\nETAGS = etags\nCTAGS = ctags\nam__DIST_COMMON = $(srcdir)/Makefile.in $(top_srcdir)/depcomp\nDISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST)\nACLOCAL = @ACLOCAL@\nAMTAR = @AMTAR@\nAM_DEFAULT_VERBOSITY = @AM_DEFAULT_VERBOSITY@\nAR = @AR@\nAUTOCONF = @AUTOCONF@\nAUTOHEADER = @AUTOHEADER@\nAUTOMAKE = @AUTOMAKE@\nAWK = @AWK@\nCC = @CC@\nCCDEPMODE = @CCDEPMODE@\nCFLAGS = @CFLAGS@\nCPP = @CPP@\nCPPFLAGS = @CPPFLAGS@\nCXX = @CXX@\nCXXCPP = @CXXCPP@\nCXXDEPMODE = @CXXDEPMODE@\nCXXFLAGS = @CXXFLAGS@\nCYGPATH_W = @CYGPATH_W@\nDEFS = @DEFS@\nDEPDIR = @DEPDIR@\nDLLTOOL = @DLLTOOL@\nDL_LIBS = @DL_LIBS@\nDSYMUTIL = @DSYMUTIL@\nDUMPBIN = @DUMPBIN@\nECHO_C = @ECHO_C@\nECHO_N = @ECHO_N@\nECHO_T = @ECHO_T@\nEGREP = @EGREP@\nEXEEXT = @EXEEXT@\nFGREP = @FGREP@\nGREP = @GREP@\nINSTALL = @INSTALL@\nINSTALL_DATA = @INSTALL_DATA@\nINSTALL_PROGRAM = @INSTALL_PROGRAM@\nINSTALL_SCRIPT = @INSTALL_SCRIPT@\nINSTALL_STRIP_PROGRAM = @INSTALL_STRIP_PROGRAM@\nLD = @LD@\nLDFLAGS = @LDFLAGS@\nLIBOBJS = @LIBOBJS@\nLIBS = @LIBS@\nLIBTOOL = @LIBTOOL@\nLIPO = @LIPO@\nLN_S = @LN_S@\nLTLIBOBJS = @LTLIBOBJS@\nLT_SYS_LIBRARY_PATH = @LT_SYS_LIBRARY_PATH@\nMAKEINFO = @MAKEINFO@\nMANIFEST_TOOL = @MANIFEST_TOOL@\nMKDIR_P = @MKDIR_P@\nNM = @NM@\nNMEDIT = @NMEDIT@\nOBJDUMP = @OBJDUMP@\nOBJEXT = @OBJEXT@\nOTOOL = @OTOOL@\nOTOOL64 = @OTOOL64@\nPACKAGE = @PACKAGE@\nPACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@\nPACKAGE_NAME = @PACKAGE_NAME@\nPACKAGE_STRING = @PACKAGE_STRING@\nPACKAGE_TARNAME = @PACKAGE_TARNAME@\nPACKAGE_URL = @PACKAGE_URL@\nPACKAGE_VERSION = @PACKAGE_VERSION@\nPATH_SEPARATOR = @PATH_SEPARATOR@\nPYTHON = @PYTHON@\nPYTHON_CPPFLAGS = @PYTHON_CPPFLAGS@\nPYTHON_EXEC_PREFIX = @PYTHON_EXEC_PREFIX@\nPYTHON_EXTRA_LDFLAGS = @PYTHON_EXTRA_LDFLAGS@\nPYTHON_EXTRA_LIBS = @PYTHON_EXTRA_LIBS@\nPYTHON_LDFLAGS = @PYTHON_LDFLAGS@\nPYTHON_PLATFORM = @PYTHON_PLATFORM@\nPYTHON_PREFIX = @PYTHON_PREFIX@\nPYTHON_SITE_PKG = @PYTHON_SITE_PKG@\nPYTHON_VERSION = @PYTHON_VERSION@\nRANLIB = @RANLIB@\nSED = @SED@\nSET_MAKE = @SET_MAKE@\nSHELL = @SHELL@\nSTRIP = @STRIP@\nVERSION = @VERSION@\nabs_builddir = @abs_builddir@\nabs_srcdir = @abs_srcdir@\nabs_top_builddir = @abs_top_builddir@\nabs_top_srcdir = @abs_top_srcdir@\nac_ct_AR = @ac_ct_AR@\nac_ct_CC = @ac_ct_CC@\nac_ct_CXX = @ac_ct_CXX@\nac_ct_DUMPBIN = @ac_ct_DUMPBIN@\nam__include = @am__include@\nam__leading_dot = @am__leading_dot@\nam__quote = @am__quote@\nam__tar = @am__tar@\nam__untar = @am__untar@\nbindir = @bindir@\nbuild = @build@\nbuild_alias = @build_alias@\nbuild_cpu = @build_cpu@\nbuild_os = @build_os@\nbuild_vendor = @build_vendor@\nbuilddir = @builddir@\ndatadir = @datadir@\ndatarootdir = @datarootdir@\ndocdir = @docdir@\ndvidir = @dvidir@\nexec_prefix = @exec_prefix@\nhost = @host@\nhost_alias = @host_alias@\nhost_cpu = @host_cpu@\nhost_os = @host_os@\nhost_vendor = @host_vendor@\nhtmldir = @htmldir@\nincludedir = @includedir@\ninfodir = @infodir@\ninstall_sh = @install_sh@\nlibdir = @libdir@\nlibexecdir = @libexecdir@\nlibfstdir = @libfstdir@\nlocaledir = @localedir@\nlocalstatedir = @localstatedir@\nmandir = @mandir@\nmkdir_p = @mkdir_p@\noldincludedir = @oldincludedir@\npdfdir = @pdfdir@\npkgpyexecdir = @pkgpyexecdir@\npkgpythondir = @pkgpythondir@\nprefix = @prefix@\nprogram_transform_name = @program_transform_name@\npsdir = @psdir@\npyexecdir = @pyexecdir@\npythondir = @pythondir@\nrunstatedir = @runstatedir@\nsbindir = @sbindir@\nsharedstatedir = @sharedstatedir@\nsrcdir = @srcdir@\nsysconfdir = @sysconfdir@\ntarget_alias = @target_alias@\ntop_build_prefix = @top_build_prefix@\ntop_builddir = @top_builddir@\ntop_srcdir = @top_srcdir@\nAM_CPPFLAGS = -I$(srcdir)/../../include $(ICU_CPPFLAGS)\nlibfst_LTLIBRARIES = arc_lookahead-fst.la \\\nilabel_lookahead-fst.la olabel_lookahead-fst.la\n\nlib_LTLIBRARIES = libfstlookahead.la\nlibfstlookahead_la_SOURCES = arc_lookahead-fst.cc ilabel_lookahead-fst.cc \\\n                             olabel_lookahead-fst.cc\n\nlibfstlookahead_la_LDFLAGS = -version-info 13:0:0\nlibfstlookahead_la_LIBADD = ../../lib/libfst.la -lm $(DL_LIBS)\narc_lookahead_fst_la_SOURCES = arc_lookahead-fst.cc\narc_lookahead_fst_la_LDFLAGS = -module\nilabel_lookahead_fst_la_SOURCES = ilabel_lookahead-fst.cc\nilabel_lookahead_fst_la_LDFLAGS = -module\nolabel_lookahead_fst_la_SOURCES = olabel_lookahead-fst.cc\nolabel_lookahead_fst_la_LDFLAGS = -module\nall: all-am\n\n.SUFFIXES:\n.SUFFIXES: .cc .lo .o .obj\n$(srcdir)/Makefile.in:  $(srcdir)/Makefile.am  $(am__configure_deps)\n\t@for dep in $?; do \\\n\t  case '$(am__configure_deps)' in \\\n\t    *$$dep*) \\\n\t      ( cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh ) \\\n\t        && { if test -f $@; then exit 0; else break; fi; }; \\\n\t      exit 1;; \\\n\t  esac; \\\n\tdone; \\\n\techo ' cd $(top_srcdir) && $(AUTOMAKE) --foreign src/extensions/lookahead/Makefile'; \\\n\t$(am__cd) $(top_srcdir) && \\\n\t  $(AUTOMAKE) --foreign src/extensions/lookahead/Makefile\nMakefile: $(srcdir)/Makefile.in $(top_builddir)/config.status\n\t@case '$?' in \\\n\t  *config.status*) \\\n\t    cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh;; \\\n\t  *) \\\n\t    echo ' cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe)'; \\\n\t    cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe);; \\\n\tesac;\n\n$(top_builddir)/config.status: $(top_srcdir)/configure $(CONFIG_STATUS_DEPENDENCIES)\n\tcd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh\n\n$(top_srcdir)/configure:  $(am__configure_deps)\n\tcd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh\n$(ACLOCAL_M4):  $(am__aclocal_m4_deps)\n\tcd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh\n$(am__aclocal_m4_deps):\n\ninstall-libLTLIBRARIES: $(lib_LTLIBRARIES)\n\t@$(NORMAL_INSTALL)\n\t@list='$(lib_LTLIBRARIES)'; test -n \"$(libdir)\" || list=; \\\n\tlist2=; for p in $$list; do \\\n\t  if test -f $$p; then \\\n\t    list2=\"$$list2 $$p\"; \\\n\t  else :; fi; \\\n\tdone; \\\n\ttest -z \"$$list2\" || { \\\n\t  echo \" $(MKDIR_P) '$(DESTDIR)$(libdir)'\"; \\\n\t  $(MKDIR_P) \"$(DESTDIR)$(libdir)\" || exit 1; \\\n\t  echo \" $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) $$list2 '$(DESTDIR)$(libdir)'\"; \\\n\t  $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) $$list2 \"$(DESTDIR)$(libdir)\"; \\\n\t}\n\nuninstall-libLTLIBRARIES:\n\t@$(NORMAL_UNINSTALL)\n\t@list='$(lib_LTLIBRARIES)'; test -n \"$(libdir)\" || list=; \\\n\tfor p in $$list; do \\\n\t  $(am__strip_dir) \\\n\t  echo \" $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=uninstall rm -f '$(DESTDIR)$(libdir)/$$f'\"; \\\n\t  $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=uninstall rm -f \"$(DESTDIR)$(libdir)/$$f\"; \\\n\tdone\n\nclean-libLTLIBRARIES:\n\t-test -z \"$(lib_LTLIBRARIES)\" || rm -f $(lib_LTLIBRARIES)\n\t@list='$(lib_LTLIBRARIES)'; \\\n\tlocs=`for p in $$list; do echo $$p; done | \\\n\t      sed 's|^[^/]*$$|.|; s|/[^/]*$$||; s|$$|/so_locations|' | \\\n\t      sort -u`; \\\n\ttest -z \"$$locs\" || { \\\n\t  echo rm -f $${locs}; \\\n\t  rm -f $${locs}; \\\n\t}\n\ninstall-libfstLTLIBRARIES: $(libfst_LTLIBRARIES)\n\t@$(NORMAL_INSTALL)\n\t@list='$(libfst_LTLIBRARIES)'; test -n \"$(libfstdir)\" || list=; \\\n\tlist2=; for p in $$list; do \\\n\t  if test -f $$p; then \\\n\t    list2=\"$$list2 $$p\"; \\\n\t  else :; fi; \\\n\tdone; \\\n\ttest -z \"$$list2\" || { \\\n\t  echo \" $(MKDIR_P) '$(DESTDIR)$(libfstdir)'\"; \\\n\t  $(MKDIR_P) \"$(DESTDIR)$(libfstdir)\" || exit 1; \\\n\t  echo \" $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) $$list2 '$(DESTDIR)$(libfstdir)'\"; \\\n\t  $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) $$list2 \"$(DESTDIR)$(libfstdir)\"; \\\n\t}\n\nuninstall-libfstLTLIBRARIES:\n\t@$(NORMAL_UNINSTALL)\n\t@list='$(libfst_LTLIBRARIES)'; test -n \"$(libfstdir)\" || list=; \\\n\tfor p in $$list; do \\\n\t  $(am__strip_dir) \\\n\t  echo \" $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=uninstall rm -f '$(DESTDIR)$(libfstdir)/$$f'\"; \\\n\t  $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=uninstall rm -f \"$(DESTDIR)$(libfstdir)/$$f\"; \\\n\tdone\n\nclean-libfstLTLIBRARIES:\n\t-test -z \"$(libfst_LTLIBRARIES)\" || rm -f $(libfst_LTLIBRARIES)\n\t@list='$(libfst_LTLIBRARIES)'; \\\n\tlocs=`for p in $$list; do echo $$p; done | \\\n\t      sed 's|^[^/]*$$|.|; s|/[^/]*$$||; s|$$|/so_locations|' | \\\n\t      sort -u`; \\\n\ttest -z \"$$locs\" || { \\\n\t  echo rm -f $${locs}; \\\n\t  rm -f $${locs}; \\\n\t}\n\narc_lookahead-fst.la: $(arc_lookahead_fst_la_OBJECTS) $(arc_lookahead_fst_la_DEPENDENCIES) $(EXTRA_arc_lookahead_fst_la_DEPENDENCIES) \n\t$(AM_V_CXXLD)$(arc_lookahead_fst_la_LINK) -rpath $(libfstdir) $(arc_lookahead_fst_la_OBJECTS) $(arc_lookahead_fst_la_LIBADD) $(LIBS)\n\nilabel_lookahead-fst.la: $(ilabel_lookahead_fst_la_OBJECTS) $(ilabel_lookahead_fst_la_DEPENDENCIES) $(EXTRA_ilabel_lookahead_fst_la_DEPENDENCIES) \n\t$(AM_V_CXXLD)$(ilabel_lookahead_fst_la_LINK) -rpath $(libfstdir) $(ilabel_lookahead_fst_la_OBJECTS) $(ilabel_lookahead_fst_la_LIBADD) $(LIBS)\n\nlibfstlookahead.la: $(libfstlookahead_la_OBJECTS) $(libfstlookahead_la_DEPENDENCIES) $(EXTRA_libfstlookahead_la_DEPENDENCIES) \n\t$(AM_V_CXXLD)$(libfstlookahead_la_LINK) -rpath $(libdir) $(libfstlookahead_la_OBJECTS) $(libfstlookahead_la_LIBADD) $(LIBS)\n\nolabel_lookahead-fst.la: $(olabel_lookahead_fst_la_OBJECTS) $(olabel_lookahead_fst_la_DEPENDENCIES) $(EXTRA_olabel_lookahead_fst_la_DEPENDENCIES) \n\t$(AM_V_CXXLD)$(olabel_lookahead_fst_la_LINK) -rpath $(libfstdir) $(olabel_lookahead_fst_la_OBJECTS) $(olabel_lookahead_fst_la_LIBADD) $(LIBS)\n\nmostlyclean-compile:\n\t-rm -f *.$(OBJEXT)\n\ndistclean-compile:\n\t-rm -f *.tab.c\n\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/arc_lookahead-fst.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/ilabel_lookahead-fst.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/olabel_lookahead-fst.Plo@am__quote@\n\n.cc.o:\n@am__fastdepCXX_TRUE@\t$(AM_V_CXX)depbase=`echo $@ | sed 's|[^/]*$$|$(DEPDIR)/&|;s|\\.o$$||'`;\\\n@am__fastdepCXX_TRUE@\t$(CXXCOMPILE) -MT $@ -MD -MP -MF $$depbase.Tpo -c -o $@ $< &&\\\n@am__fastdepCXX_TRUE@\t$(am__mv) $$depbase.Tpo $$depbase.Po\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\t$(AM_V_CXX)source='$<' object='$@' libtool=no @AMDEPBACKSLASH@\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\tDEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@\n@am__fastdepCXX_FALSE@\t$(AM_V_CXX@am__nodep@)$(CXXCOMPILE) -c -o $@ $<\n\n.cc.obj:\n@am__fastdepCXX_TRUE@\t$(AM_V_CXX)depbase=`echo $@ | sed 's|[^/]*$$|$(DEPDIR)/&|;s|\\.obj$$||'`;\\\n@am__fastdepCXX_TRUE@\t$(CXXCOMPILE) -MT $@ -MD -MP -MF $$depbase.Tpo -c -o $@ `$(CYGPATH_W) '$<'` &&\\\n@am__fastdepCXX_TRUE@\t$(am__mv) $$depbase.Tpo $$depbase.Po\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\t$(AM_V_CXX)source='$<' object='$@' libtool=no @AMDEPBACKSLASH@\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\tDEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@\n@am__fastdepCXX_FALSE@\t$(AM_V_CXX@am__nodep@)$(CXXCOMPILE) -c -o $@ `$(CYGPATH_W) '$<'`\n\n.cc.lo:\n@am__fastdepCXX_TRUE@\t$(AM_V_CXX)depbase=`echo $@ | sed 's|[^/]*$$|$(DEPDIR)/&|;s|\\.lo$$||'`;\\\n@am__fastdepCXX_TRUE@\t$(LTCXXCOMPILE) -MT $@ -MD -MP -MF $$depbase.Tpo -c -o $@ $< &&\\\n@am__fastdepCXX_TRUE@\t$(am__mv) $$depbase.Tpo $$depbase.Plo\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\t$(AM_V_CXX)source='$<' object='$@' libtool=yes @AMDEPBACKSLASH@\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\tDEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@\n@am__fastdepCXX_FALSE@\t$(AM_V_CXX@am__nodep@)$(LTCXXCOMPILE) -c -o $@ $<\n\nmostlyclean-libtool:\n\t-rm -f *.lo\n\nclean-libtool:\n\t-rm -rf .libs _libs\n\nID: $(am__tagged_files)\n\t$(am__define_uniq_tagged_files); mkid -fID $$unique\ntags: tags-am\nTAGS: tags\n\ntags-am: $(TAGS_DEPENDENCIES) $(am__tagged_files)\n\tset x; \\\n\there=`pwd`; \\\n\t$(am__define_uniq_tagged_files); \\\n\tshift; \\\n\tif test -z \"$(ETAGS_ARGS)$$*$$unique\"; then :; else \\\n\t  test -n \"$$unique\" || unique=$$empty_fix; \\\n\t  if test $$# -gt 0; then \\\n\t    $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \\\n\t      \"$$@\" $$unique; \\\n\t  else \\\n\t    $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \\\n\t      $$unique; \\\n\t  fi; \\\n\tfi\nctags: ctags-am\n\nCTAGS: ctags\nctags-am: $(TAGS_DEPENDENCIES) $(am__tagged_files)\n\t$(am__define_uniq_tagged_files); \\\n\ttest -z \"$(CTAGS_ARGS)$$unique\" \\\n\t  || $(CTAGS) $(CTAGSFLAGS) $(AM_CTAGSFLAGS) $(CTAGS_ARGS) \\\n\t     $$unique\n\nGTAGS:\n\there=`$(am__cd) $(top_builddir) && pwd` \\\n\t  && $(am__cd) $(top_srcdir) \\\n\t  && gtags -i $(GTAGS_ARGS) \"$$here\"\ncscopelist: cscopelist-am\n\ncscopelist-am: $(am__tagged_files)\n\tlist='$(am__tagged_files)'; \\\n\tcase \"$(srcdir)\" in \\\n\t  [\\\\/]* | ?:[\\\\/]*) sdir=\"$(srcdir)\" ;; \\\n\t  *) sdir=$(subdir)/$(srcdir) ;; \\\n\tesac; \\\n\tfor i in $$list; do \\\n\t  if test -f \"$$i\"; then \\\n\t    echo \"$(subdir)/$$i\"; \\\n\t  else \\\n\t    echo \"$$sdir/$$i\"; \\\n\t  fi; \\\n\tdone >> $(top_builddir)/cscope.files\n\ndistclean-tags:\n\t-rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags\n\ndistdir: $(DISTFILES)\n\t@srcdirstrip=`echo \"$(srcdir)\" | sed 's/[].[^$$\\\\*]/\\\\\\\\&/g'`; \\\n\ttopsrcdirstrip=`echo \"$(top_srcdir)\" | sed 's/[].[^$$\\\\*]/\\\\\\\\&/g'`; \\\n\tlist='$(DISTFILES)'; \\\n\t  dist_files=`for file in $$list; do echo $$file; done | \\\n\t  sed -e \"s|^$$srcdirstrip/||;t\" \\\n\t      -e \"s|^$$topsrcdirstrip/|$(top_builddir)/|;t\"`; \\\n\tcase $$dist_files in \\\n\t  */*) $(MKDIR_P) `echo \"$$dist_files\" | \\\n\t\t\t   sed '/\\//!d;s|^|$(distdir)/|;s,/[^/]*$$,,' | \\\n\t\t\t   sort -u` ;; \\\n\tesac; \\\n\tfor file in $$dist_files; do \\\n\t  if test -f $$file || test -d $$file; then d=.; else d=$(srcdir); fi; \\\n\t  if test -d $$d/$$file; then \\\n\t    dir=`echo \"/$$file\" | sed -e 's,/[^/]*$$,,'`; \\\n\t    if test -d \"$(distdir)/$$file\"; then \\\n\t      find \"$(distdir)/$$file\" -type d ! -perm -700 -exec chmod u+rwx {} \\;; \\\n\t    fi; \\\n\t    if test -d $(srcdir)/$$file && test $$d != $(srcdir); then \\\n\t      cp -fpR $(srcdir)/$$file \"$(distdir)$$dir\" || exit 1; \\\n\t      find \"$(distdir)/$$file\" -type d ! -perm -700 -exec chmod u+rwx {} \\;; \\\n\t    fi; \\\n\t    cp -fpR $$d/$$file \"$(distdir)$$dir\" || exit 1; \\\n\t  else \\\n\t    test -f \"$(distdir)/$$file\" \\\n\t    || cp -p $$d/$$file \"$(distdir)/$$file\" \\\n\t    || exit 1; \\\n\t  fi; \\\n\tdone\ncheck-am: all-am\ncheck: check-am\nall-am: Makefile $(LTLIBRARIES)\ninstalldirs:\n\tfor dir in \"$(DESTDIR)$(libdir)\" \"$(DESTDIR)$(libfstdir)\"; do \\\n\t  test -z \"$$dir\" || $(MKDIR_P) \"$$dir\"; \\\n\tdone\ninstall: install-am\ninstall-exec: install-exec-am\ninstall-data: install-data-am\nuninstall: uninstall-am\n\ninstall-am: all-am\n\t@$(MAKE) $(AM_MAKEFLAGS) install-exec-am install-data-am\n\ninstallcheck: installcheck-am\ninstall-strip:\n\tif test -z '$(STRIP)'; then \\\n\t  $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" \\\n\t    install_sh_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" INSTALL_STRIP_FLAG=-s \\\n\t      install; \\\n\telse \\\n\t  $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" \\\n\t    install_sh_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" INSTALL_STRIP_FLAG=-s \\\n\t    \"INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'\" install; \\\n\tfi\nmostlyclean-generic:\n\nclean-generic:\n\ndistclean-generic:\n\t-test -z \"$(CONFIG_CLEAN_FILES)\" || rm -f $(CONFIG_CLEAN_FILES)\n\t-test . = \"$(srcdir)\" || test -z \"$(CONFIG_CLEAN_VPATH_FILES)\" || rm -f $(CONFIG_CLEAN_VPATH_FILES)\n\nmaintainer-clean-generic:\n\t@echo \"This command is intended for maintainers to use\"\n\t@echo \"it deletes files that may require special tools to rebuild.\"\nclean: clean-am\n\nclean-am: clean-generic clean-libLTLIBRARIES clean-libfstLTLIBRARIES \\\n\tclean-libtool mostlyclean-am\n\ndistclean: distclean-am\n\t-rm -rf ./$(DEPDIR)\n\t-rm -f Makefile\ndistclean-am: clean-am distclean-compile distclean-generic \\\n\tdistclean-tags\n\ndvi: dvi-am\n\ndvi-am:\n\nhtml: html-am\n\nhtml-am:\n\ninfo: info-am\n\ninfo-am:\n\ninstall-data-am: install-libfstLTLIBRARIES\n\ninstall-dvi: install-dvi-am\n\ninstall-dvi-am:\n\ninstall-exec-am: install-libLTLIBRARIES\n\ninstall-html: install-html-am\n\ninstall-html-am:\n\ninstall-info: install-info-am\n\ninstall-info-am:\n\ninstall-man:\n\ninstall-pdf: install-pdf-am\n\ninstall-pdf-am:\n\ninstall-ps: install-ps-am\n\ninstall-ps-am:\n\ninstallcheck-am:\n\nmaintainer-clean: maintainer-clean-am\n\t-rm -rf ./$(DEPDIR)\n\t-rm -f Makefile\nmaintainer-clean-am: distclean-am maintainer-clean-generic\n\nmostlyclean: mostlyclean-am\n\nmostlyclean-am: mostlyclean-compile mostlyclean-generic \\\n\tmostlyclean-libtool\n\npdf: pdf-am\n\npdf-am:\n\nps: ps-am\n\nps-am:\n\nuninstall-am: uninstall-libLTLIBRARIES uninstall-libfstLTLIBRARIES\n\n.MAKE: install-am install-strip\n\n.PHONY: CTAGS GTAGS TAGS all all-am check check-am clean clean-generic \\\n\tclean-libLTLIBRARIES clean-libfstLTLIBRARIES clean-libtool \\\n\tcscopelist-am ctags ctags-am distclean distclean-compile \\\n\tdistclean-generic distclean-libtool distclean-tags distdir dvi \\\n\tdvi-am html html-am info info-am install install-am \\\n\tinstall-data install-data-am install-dvi install-dvi-am \\\n\tinstall-exec install-exec-am install-html install-html-am \\\n\tinstall-info install-info-am install-libLTLIBRARIES \\\n\tinstall-libfstLTLIBRARIES install-man install-pdf \\\n\tinstall-pdf-am install-ps install-ps-am install-strip \\\n\tinstallcheck installcheck-am installdirs maintainer-clean \\\n\tmaintainer-clean-generic mostlyclean mostlyclean-compile \\\n\tmostlyclean-generic mostlyclean-libtool pdf pdf-am ps ps-am \\\n\ttags tags-am uninstall uninstall-am uninstall-libLTLIBRARIES \\\n\tuninstall-libfstLTLIBRARIES\n\n.PRECIOUS: Makefile\n\n\n# Tell versions [3.59,3.63) of GNU make to not export all variables.\n# Otherwise a system limit (for SysV at least) may be exceeded.\n.NOEXPORT:\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/extensions/lookahead/arc_lookahead-fst.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/fst.h>\n#include <fst/matcher-fst.h>\n\nnamespace fst {\n\nstatic FstRegisterer<StdArcLookAheadFst> ArcLookAheadFst_StdArc_registerer;\nstatic FstRegisterer<MatcherFst<\n    ConstFst<LogArc>, ArcLookAheadMatcher<SortedMatcher<ConstFst<LogArc>>>,\n    arc_lookahead_fst_type>>\n    ArcLookAheadFst_LogArc_registerer;\nstatic FstRegisterer<MatcherFst<\n    ConstFst<Log64Arc>, ArcLookAheadMatcher<SortedMatcher<ConstFst<Log64Arc>>>,\n    arc_lookahead_fst_type>>\n    ArcLookAheadFst_Log64Arc_registerer;\n\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/extensions/lookahead/ilabel_lookahead-fst.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/fst.h>\n#include <fst/matcher-fst.h>\n\nnamespace fst {\n\nstatic FstRegisterer<StdILabelLookAheadFst>\n    ILabelLookAheadFst_StdArc_registerer;\nstatic FstRegisterer<MatcherFst<\n    ConstFst<LogArc>,\n    LabelLookAheadMatcher<SortedMatcher<ConstFst<LogArc>>,\n                          ilabel_lookahead_flags, FastLogAccumulator<LogArc>>,\n    ilabel_lookahead_fst_type, LabelLookAheadRelabeler<LogArc>>>\n    ILabelLookAheadFst_LogArc_registerer;\nstatic FstRegisterer<MatcherFst<\n    ConstFst<Log64Arc>,\n    LabelLookAheadMatcher<SortedMatcher<ConstFst<Log64Arc>>,\n                          ilabel_lookahead_flags, FastLogAccumulator<Log64Arc>>,\n    ilabel_lookahead_fst_type, LabelLookAheadRelabeler<Log64Arc>>>\n    ILabelLookAheadFst_Log64Arc_registerer;\n\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/extensions/lookahead/olabel_lookahead-fst.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/fst.h>\n#include <fst/matcher-fst.h>\n\nnamespace fst {\n\nstatic FstRegisterer<StdOLabelLookAheadFst>\n    OLabelLookAheadFst_StdArc_registerer;\nstatic FstRegisterer<MatcherFst<\n    ConstFst<LogArc>,\n    LabelLookAheadMatcher<SortedMatcher<ConstFst<LogArc>>,\n                          olabel_lookahead_flags, FastLogAccumulator<LogArc>>,\n    olabel_lookahead_fst_type, LabelLookAheadRelabeler<LogArc>>>\n    OLabelLookAheadFst_LogArc_registerer;\nstatic FstRegisterer<MatcherFst<\n    ConstFst<Log64Arc>,\n    LabelLookAheadMatcher<SortedMatcher<ConstFst<Log64Arc>>,\n                          olabel_lookahead_flags, FastLogAccumulator<Log64Arc>>,\n    olabel_lookahead_fst_type, LabelLookAheadRelabeler<Log64Arc>>>\n    OLabelLookAheadFst_Log64Arc_registerer;\n\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/extensions/mpdt/CMakeLists.txt",
    "content": "file(GLOB HEADER_FILES ../../include/fst/extensions/mpdt/*.h)\nmessage(STATUS \"${HEADER_FILES}\")\n\nif(HAVE_SCRIPT)\n  add_library(fstmpdtscript mpdtscript.cc ${HEADER_FILES})\n  target_link_libraries(fstmpdtscript fstscript fst)\n  set_target_properties(fstmpdtscript PROPERTIES \n    SOVERSION \"${SOVERSION}\"\n    FOLDER mpdt\n  )\n  install(TARGETS fstmpdtscript \n\tLIBRARY DESTINATION lib\n\tARCHIVE DESTINATION lib\n\tRUNTIME DESTINATION lib\n  )\nendif(HAVE_SCRIPT)\n\nif(HAVE_BIN)\n  function (add_executable2 _name)\n      add_executable(${ARGV})\n      if (TARGET ${_name})\n          target_link_libraries(${_name} fstmpdtscript fstpdtscript fstscript fst ${CMAKE_DL_LIBS})\n          set_target_properties(${_name} PROPERTIES\n            FOLDER mpdt/bin\n          )\n      endif()\n    install(TARGETS ${_name} RUNTIME DESTINATION bin)\n  endfunction()\n  add_executable2(mpdtcompose  mpdtcompose.cc)\n  add_executable2(mpdtexpand  mpdtexpand.cc)\n  add_executable2(mpdtinfo  mpdtinfo.cc)\n  add_executable2(mpdtreverse  mpdtreverse.cc)\nendif(HAVE_BIN)\n\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/extensions/mpdt/Makefile.am",
    "content": "AM_CPPFLAGS = -I$(srcdir)/../../include $(ICU_CPPFLAGS)\n\nif HAVE_BIN\nbin_PROGRAMS = mpdtcompose mpdtexpand mpdtinfo mpdtreverse\n\nLDADD = libfstmpdtscript.la      \\\n    ../pdt/libfstpdtscript.la    \\\n    ../../script/libfstscript.la \\\n    ../../lib/libfst.la -lm $(DL_LIBS)\n\nmpdtcompose_SOURCES = mpdtcompose.cc\n\nmpdtexpand_SOURCES = mpdtexpand.cc\n\nmpdtinfo_SOURCES = mpdtinfo.cc\n\nmpdtreverse_SOURCES = mpdtreverse.cc\nendif\n\nif HAVE_SCRIPT\nlib_LTLIBRARIES = libfstmpdtscript.la\nlibfstmpdtscript_la_SOURCES = mpdtscript.cc\nlibfstmpdtscript_la_LDFLAGS = -version-info 13:0:0\nlibfstmpdtscript_la_LIBADD = ../../script/libfstscript.la \\\n                             ../../lib/libfst.la -lm $(DL_LIBS)\nendif\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/extensions/mpdt/Makefile.in",
    "content": "# Makefile.in generated by automake 1.15.1 from Makefile.am.\n# @configure_input@\n\n# Copyright (C) 1994-2017 Free Software Foundation, Inc.\n\n# This Makefile.in is free software; the Free Software Foundation\n# gives unlimited permission to copy and/or distribute it,\n# with or without modifications, as long as this notice is preserved.\n\n# This program is distributed in the hope that it will be useful,\n# but WITHOUT ANY WARRANTY, to the extent permitted by law; without\n# even the implied warranty of MERCHANTABILITY or FITNESS FOR A\n# PARTICULAR PURPOSE.\n\n@SET_MAKE@\n\n\nVPATH = @srcdir@\nam__is_gnu_make = { \\\n  if test -z '$(MAKELEVEL)'; then \\\n    false; \\\n  elif test -n '$(MAKE_HOST)'; then \\\n    true; \\\n  elif test -n '$(MAKE_VERSION)' && test -n '$(CURDIR)'; then \\\n    true; \\\n  else \\\n    false; \\\n  fi; \\\n}\nam__make_running_with_option = \\\n  case $${target_option-} in \\\n      ?) ;; \\\n      *) echo \"am__make_running_with_option: internal error: invalid\" \\\n              \"target option '$${target_option-}' specified\" >&2; \\\n         exit 1;; \\\n  esac; \\\n  has_opt=no; \\\n  sane_makeflags=$$MAKEFLAGS; \\\n  if $(am__is_gnu_make); then \\\n    sane_makeflags=$$MFLAGS; \\\n  else \\\n    case $$MAKEFLAGS in \\\n      *\\\\[\\ \\\t]*) \\\n        bs=\\\\; \\\n        sane_makeflags=`printf '%s\\n' \"$$MAKEFLAGS\" \\\n          | sed \"s/$$bs$$bs[$$bs $$bs\t]*//g\"`;; \\\n    esac; \\\n  fi; \\\n  skip_next=no; \\\n  strip_trailopt () \\\n  { \\\n    flg=`printf '%s\\n' \"$$flg\" | sed \"s/$$1.*$$//\"`; \\\n  }; \\\n  for flg in $$sane_makeflags; do \\\n    test $$skip_next = yes && { skip_next=no; continue; }; \\\n    case $$flg in \\\n      *=*|--*) continue;; \\\n        -*I) strip_trailopt 'I'; skip_next=yes;; \\\n      -*I?*) strip_trailopt 'I';; \\\n        -*O) strip_trailopt 'O'; skip_next=yes;; \\\n      -*O?*) strip_trailopt 'O';; \\\n        -*l) strip_trailopt 'l'; skip_next=yes;; \\\n      -*l?*) strip_trailopt 'l';; \\\n      -[dEDm]) skip_next=yes;; \\\n      -[JT]) skip_next=yes;; \\\n    esac; \\\n    case $$flg in \\\n      *$$target_option*) has_opt=yes; break;; \\\n    esac; \\\n  done; \\\n  test $$has_opt = yes\nam__make_dryrun = (target_option=n; $(am__make_running_with_option))\nam__make_keepgoing = (target_option=k; $(am__make_running_with_option))\npkgdatadir = $(datadir)/@PACKAGE@\npkgincludedir = $(includedir)/@PACKAGE@\npkglibdir = $(libdir)/@PACKAGE@\npkglibexecdir = $(libexecdir)/@PACKAGE@\nam__cd = CDPATH=\"$${ZSH_VERSION+.}$(PATH_SEPARATOR)\" && cd\ninstall_sh_DATA = $(install_sh) -c -m 644\ninstall_sh_PROGRAM = $(install_sh) -c\ninstall_sh_SCRIPT = $(install_sh) -c\nINSTALL_HEADER = $(INSTALL_DATA)\ntransform = $(program_transform_name)\nNORMAL_INSTALL = :\nPRE_INSTALL = :\nPOST_INSTALL = :\nNORMAL_UNINSTALL = :\nPRE_UNINSTALL = :\nPOST_UNINSTALL = :\nbuild_triplet = @build@\nhost_triplet = @host@\n@HAVE_BIN_TRUE@bin_PROGRAMS = mpdtcompose$(EXEEXT) mpdtexpand$(EXEEXT) \\\n@HAVE_BIN_TRUE@\tmpdtinfo$(EXEEXT) mpdtreverse$(EXEEXT)\nsubdir = src/extensions/mpdt\nACLOCAL_M4 = $(top_srcdir)/aclocal.m4\nam__aclocal_m4_deps = $(top_srcdir)/m4/ac_python_devel.m4 \\\n\t$(top_srcdir)/m4/libtool.m4 $(top_srcdir)/m4/ltoptions.m4 \\\n\t$(top_srcdir)/m4/ltsugar.m4 $(top_srcdir)/m4/ltversion.m4 \\\n\t$(top_srcdir)/m4/lt~obsolete.m4 $(top_srcdir)/configure.ac\nam__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \\\n\t$(ACLOCAL_M4)\nDIST_COMMON = $(srcdir)/Makefile.am $(am__DIST_COMMON)\nmkinstalldirs = $(install_sh) -d\nCONFIG_HEADER = $(top_builddir)/config.h \\\n\t$(top_builddir)/src/include/fst/config.h\nCONFIG_CLEAN_FILES =\nCONFIG_CLEAN_VPATH_FILES =\nam__vpath_adj_setup = srcdirstrip=`echo \"$(srcdir)\" | sed 's|.|.|g'`;\nam__vpath_adj = case $$p in \\\n    $(srcdir)/*) f=`echo \"$$p\" | sed \"s|^$$srcdirstrip/||\"`;; \\\n    *) f=$$p;; \\\n  esac;\nam__strip_dir = f=`echo $$p | sed -e 's|^.*/||'`;\nam__install_max = 40\nam__nobase_strip_setup = \\\n  srcdirstrip=`echo \"$(srcdir)\" | sed 's/[].[^$$\\\\*|]/\\\\\\\\&/g'`\nam__nobase_strip = \\\n  for p in $$list; do echo \"$$p\"; done | sed -e \"s|$$srcdirstrip/||\"\nam__nobase_list = $(am__nobase_strip_setup); \\\n  for p in $$list; do echo \"$$p $$p\"; done | \\\n  sed \"s| $$srcdirstrip/| |;\"' / .*\\//!s/ .*/ ./; s,\\( .*\\)/[^/]*$$,\\1,' | \\\n  $(AWK) 'BEGIN { files[\".\"] = \"\" } { files[$$2] = files[$$2] \" \" $$1; \\\n    if (++n[$$2] == $(am__install_max)) \\\n      { print $$2, files[$$2]; n[$$2] = 0; files[$$2] = \"\" } } \\\n    END { for (dir in files) print dir, files[dir] }'\nam__base_list = \\\n  sed '$$!N;$$!N;$$!N;$$!N;$$!N;$$!N;$$!N;s/\\n/ /g' | \\\n  sed '$$!N;$$!N;$$!N;$$!N;s/\\n/ /g'\nam__uninstall_files_from_dir = { \\\n  test -z \"$$files\" \\\n    || { test ! -d \"$$dir\" && test ! -f \"$$dir\" && test ! -r \"$$dir\"; } \\\n    || { echo \" ( cd '$$dir' && rm -f\" $$files \")\"; \\\n         $(am__cd) \"$$dir\" && rm -f $$files; }; \\\n  }\nam__installdirs = \"$(DESTDIR)$(libdir)\" \"$(DESTDIR)$(bindir)\"\nLTLIBRARIES = $(lib_LTLIBRARIES)\nam__DEPENDENCIES_1 =\n@HAVE_SCRIPT_TRUE@libfstmpdtscript_la_DEPENDENCIES =  \\\n@HAVE_SCRIPT_TRUE@\t../../script/libfstscript.la \\\n@HAVE_SCRIPT_TRUE@\t../../lib/libfst.la $(am__DEPENDENCIES_1)\nam__libfstmpdtscript_la_SOURCES_DIST = mpdtscript.cc\n@HAVE_SCRIPT_TRUE@am_libfstmpdtscript_la_OBJECTS = mpdtscript.lo\nlibfstmpdtscript_la_OBJECTS = $(am_libfstmpdtscript_la_OBJECTS)\nAM_V_lt = $(am__v_lt_@AM_V@)\nam__v_lt_ = $(am__v_lt_@AM_DEFAULT_V@)\nam__v_lt_0 = --silent\nam__v_lt_1 = \nlibfstmpdtscript_la_LINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX \\\n\t$(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=link $(CXXLD) \\\n\t$(AM_CXXFLAGS) $(CXXFLAGS) $(libfstmpdtscript_la_LDFLAGS) \\\n\t$(LDFLAGS) -o $@\n@HAVE_SCRIPT_TRUE@am_libfstmpdtscript_la_rpath = -rpath $(libdir)\nPROGRAMS = $(bin_PROGRAMS)\nam__mpdtcompose_SOURCES_DIST = mpdtcompose.cc\n@HAVE_BIN_TRUE@am_mpdtcompose_OBJECTS = mpdtcompose.$(OBJEXT)\nmpdtcompose_OBJECTS = $(am_mpdtcompose_OBJECTS)\nmpdtcompose_LDADD = $(LDADD)\n@HAVE_BIN_TRUE@mpdtcompose_DEPENDENCIES = libfstmpdtscript.la \\\n@HAVE_BIN_TRUE@\t../pdt/libfstpdtscript.la \\\n@HAVE_BIN_TRUE@\t../../script/libfstscript.la \\\n@HAVE_BIN_TRUE@\t../../lib/libfst.la $(am__DEPENDENCIES_1)\nam__mpdtexpand_SOURCES_DIST = mpdtexpand.cc\n@HAVE_BIN_TRUE@am_mpdtexpand_OBJECTS = mpdtexpand.$(OBJEXT)\nmpdtexpand_OBJECTS = $(am_mpdtexpand_OBJECTS)\nmpdtexpand_LDADD = $(LDADD)\n@HAVE_BIN_TRUE@mpdtexpand_DEPENDENCIES = libfstmpdtscript.la \\\n@HAVE_BIN_TRUE@\t../pdt/libfstpdtscript.la \\\n@HAVE_BIN_TRUE@\t../../script/libfstscript.la \\\n@HAVE_BIN_TRUE@\t../../lib/libfst.la $(am__DEPENDENCIES_1)\nam__mpdtinfo_SOURCES_DIST = mpdtinfo.cc\n@HAVE_BIN_TRUE@am_mpdtinfo_OBJECTS = mpdtinfo.$(OBJEXT)\nmpdtinfo_OBJECTS = $(am_mpdtinfo_OBJECTS)\nmpdtinfo_LDADD = $(LDADD)\n@HAVE_BIN_TRUE@mpdtinfo_DEPENDENCIES = libfstmpdtscript.la \\\n@HAVE_BIN_TRUE@\t../pdt/libfstpdtscript.la \\\n@HAVE_BIN_TRUE@\t../../script/libfstscript.la \\\n@HAVE_BIN_TRUE@\t../../lib/libfst.la $(am__DEPENDENCIES_1)\nam__mpdtreverse_SOURCES_DIST = mpdtreverse.cc\n@HAVE_BIN_TRUE@am_mpdtreverse_OBJECTS = mpdtreverse.$(OBJEXT)\nmpdtreverse_OBJECTS = $(am_mpdtreverse_OBJECTS)\nmpdtreverse_LDADD = $(LDADD)\n@HAVE_BIN_TRUE@mpdtreverse_DEPENDENCIES = libfstmpdtscript.la \\\n@HAVE_BIN_TRUE@\t../pdt/libfstpdtscript.la \\\n@HAVE_BIN_TRUE@\t../../script/libfstscript.la \\\n@HAVE_BIN_TRUE@\t../../lib/libfst.la $(am__DEPENDENCIES_1)\nAM_V_P = $(am__v_P_@AM_V@)\nam__v_P_ = $(am__v_P_@AM_DEFAULT_V@)\nam__v_P_0 = false\nam__v_P_1 = :\nAM_V_GEN = $(am__v_GEN_@AM_V@)\nam__v_GEN_ = $(am__v_GEN_@AM_DEFAULT_V@)\nam__v_GEN_0 = @echo \"  GEN     \" $@;\nam__v_GEN_1 = \nAM_V_at = $(am__v_at_@AM_V@)\nam__v_at_ = $(am__v_at_@AM_DEFAULT_V@)\nam__v_at_0 = @\nam__v_at_1 = \nDEFAULT_INCLUDES = \ndepcomp = $(SHELL) $(top_srcdir)/depcomp\nam__depfiles_maybe = depfiles\nam__mv = mv -f\nCXXCOMPILE = $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) \\\n\t$(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS)\nLTCXXCOMPILE = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \\\n\t$(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) \\\n\t$(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) \\\n\t$(AM_CXXFLAGS) $(CXXFLAGS)\nAM_V_CXX = $(am__v_CXX_@AM_V@)\nam__v_CXX_ = $(am__v_CXX_@AM_DEFAULT_V@)\nam__v_CXX_0 = @echo \"  CXX     \" $@;\nam__v_CXX_1 = \nCXXLD = $(CXX)\nCXXLINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \\\n\t$(LIBTOOLFLAGS) --mode=link $(CXXLD) $(AM_CXXFLAGS) \\\n\t$(CXXFLAGS) $(AM_LDFLAGS) $(LDFLAGS) -o $@\nAM_V_CXXLD = $(am__v_CXXLD_@AM_V@)\nam__v_CXXLD_ = $(am__v_CXXLD_@AM_DEFAULT_V@)\nam__v_CXXLD_0 = @echo \"  CXXLD   \" $@;\nam__v_CXXLD_1 = \nSOURCES = $(libfstmpdtscript_la_SOURCES) $(mpdtcompose_SOURCES) \\\n\t$(mpdtexpand_SOURCES) $(mpdtinfo_SOURCES) \\\n\t$(mpdtreverse_SOURCES)\nDIST_SOURCES = $(am__libfstmpdtscript_la_SOURCES_DIST) \\\n\t$(am__mpdtcompose_SOURCES_DIST) $(am__mpdtexpand_SOURCES_DIST) \\\n\t$(am__mpdtinfo_SOURCES_DIST) $(am__mpdtreverse_SOURCES_DIST)\nam__can_run_installinfo = \\\n  case $$AM_UPDATE_INFO_DIR in \\\n    n|no|NO) false;; \\\n    *) (install-info --version) >/dev/null 2>&1;; \\\n  esac\nam__tagged_files = $(HEADERS) $(SOURCES) $(TAGS_FILES) $(LISP)\n# Read a list of newline-separated strings from the standard input,\n# and print each of them once, without duplicates.  Input order is\n# *not* preserved.\nam__uniquify_input = $(AWK) '\\\n  BEGIN { nonempty = 0; } \\\n  { items[$$0] = 1; nonempty = 1; } \\\n  END { if (nonempty) { for (i in items) print i; }; } \\\n'\n# Make sure the list of sources is unique.  This is necessary because,\n# e.g., the same source file might be shared among _SOURCES variables\n# for different programs/libraries.\nam__define_uniq_tagged_files = \\\n  list='$(am__tagged_files)'; \\\n  unique=`for i in $$list; do \\\n    if test -f \"$$i\"; then echo $$i; else echo $(srcdir)/$$i; fi; \\\n  done | $(am__uniquify_input)`\nETAGS = etags\nCTAGS = ctags\nam__DIST_COMMON = $(srcdir)/Makefile.in $(top_srcdir)/depcomp\nDISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST)\nACLOCAL = @ACLOCAL@\nAMTAR = @AMTAR@\nAM_DEFAULT_VERBOSITY = @AM_DEFAULT_VERBOSITY@\nAR = @AR@\nAUTOCONF = @AUTOCONF@\nAUTOHEADER = @AUTOHEADER@\nAUTOMAKE = @AUTOMAKE@\nAWK = @AWK@\nCC = @CC@\nCCDEPMODE = @CCDEPMODE@\nCFLAGS = @CFLAGS@\nCPP = @CPP@\nCPPFLAGS = @CPPFLAGS@\nCXX = @CXX@\nCXXCPP = @CXXCPP@\nCXXDEPMODE = @CXXDEPMODE@\nCXXFLAGS = @CXXFLAGS@\nCYGPATH_W = @CYGPATH_W@\nDEFS = @DEFS@\nDEPDIR = @DEPDIR@\nDLLTOOL = @DLLTOOL@\nDL_LIBS = @DL_LIBS@\nDSYMUTIL = @DSYMUTIL@\nDUMPBIN = @DUMPBIN@\nECHO_C = @ECHO_C@\nECHO_N = @ECHO_N@\nECHO_T = @ECHO_T@\nEGREP = @EGREP@\nEXEEXT = @EXEEXT@\nFGREP = @FGREP@\nGREP = @GREP@\nINSTALL = @INSTALL@\nINSTALL_DATA = @INSTALL_DATA@\nINSTALL_PROGRAM = @INSTALL_PROGRAM@\nINSTALL_SCRIPT = @INSTALL_SCRIPT@\nINSTALL_STRIP_PROGRAM = @INSTALL_STRIP_PROGRAM@\nLD = @LD@\nLDFLAGS = @LDFLAGS@\nLIBOBJS = @LIBOBJS@\nLIBS = @LIBS@\nLIBTOOL = @LIBTOOL@\nLIPO = @LIPO@\nLN_S = @LN_S@\nLTLIBOBJS = @LTLIBOBJS@\nLT_SYS_LIBRARY_PATH = @LT_SYS_LIBRARY_PATH@\nMAKEINFO = @MAKEINFO@\nMANIFEST_TOOL = @MANIFEST_TOOL@\nMKDIR_P = @MKDIR_P@\nNM = @NM@\nNMEDIT = @NMEDIT@\nOBJDUMP = @OBJDUMP@\nOBJEXT = @OBJEXT@\nOTOOL = @OTOOL@\nOTOOL64 = @OTOOL64@\nPACKAGE = @PACKAGE@\nPACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@\nPACKAGE_NAME = @PACKAGE_NAME@\nPACKAGE_STRING = @PACKAGE_STRING@\nPACKAGE_TARNAME = @PACKAGE_TARNAME@\nPACKAGE_URL = @PACKAGE_URL@\nPACKAGE_VERSION = @PACKAGE_VERSION@\nPATH_SEPARATOR = @PATH_SEPARATOR@\nPYTHON = @PYTHON@\nPYTHON_CPPFLAGS = @PYTHON_CPPFLAGS@\nPYTHON_EXEC_PREFIX = @PYTHON_EXEC_PREFIX@\nPYTHON_EXTRA_LDFLAGS = @PYTHON_EXTRA_LDFLAGS@\nPYTHON_EXTRA_LIBS = @PYTHON_EXTRA_LIBS@\nPYTHON_LDFLAGS = @PYTHON_LDFLAGS@\nPYTHON_PLATFORM = @PYTHON_PLATFORM@\nPYTHON_PREFIX = @PYTHON_PREFIX@\nPYTHON_SITE_PKG = @PYTHON_SITE_PKG@\nPYTHON_VERSION = @PYTHON_VERSION@\nRANLIB = @RANLIB@\nSED = @SED@\nSET_MAKE = @SET_MAKE@\nSHELL = @SHELL@\nSTRIP = @STRIP@\nVERSION = @VERSION@\nabs_builddir = @abs_builddir@\nabs_srcdir = @abs_srcdir@\nabs_top_builddir = @abs_top_builddir@\nabs_top_srcdir = @abs_top_srcdir@\nac_ct_AR = @ac_ct_AR@\nac_ct_CC = @ac_ct_CC@\nac_ct_CXX = @ac_ct_CXX@\nac_ct_DUMPBIN = @ac_ct_DUMPBIN@\nam__include = @am__include@\nam__leading_dot = @am__leading_dot@\nam__quote = @am__quote@\nam__tar = @am__tar@\nam__untar = @am__untar@\nbindir = @bindir@\nbuild = @build@\nbuild_alias = @build_alias@\nbuild_cpu = @build_cpu@\nbuild_os = @build_os@\nbuild_vendor = @build_vendor@\nbuilddir = @builddir@\ndatadir = @datadir@\ndatarootdir = @datarootdir@\ndocdir = @docdir@\ndvidir = @dvidir@\nexec_prefix = @exec_prefix@\nhost = @host@\nhost_alias = @host_alias@\nhost_cpu = @host_cpu@\nhost_os = @host_os@\nhost_vendor = @host_vendor@\nhtmldir = @htmldir@\nincludedir = @includedir@\ninfodir = @infodir@\ninstall_sh = @install_sh@\nlibdir = @libdir@\nlibexecdir = @libexecdir@\nlibfstdir = @libfstdir@\nlocaledir = @localedir@\nlocalstatedir = @localstatedir@\nmandir = @mandir@\nmkdir_p = @mkdir_p@\noldincludedir = @oldincludedir@\npdfdir = @pdfdir@\npkgpyexecdir = @pkgpyexecdir@\npkgpythondir = @pkgpythondir@\nprefix = @prefix@\nprogram_transform_name = @program_transform_name@\npsdir = @psdir@\npyexecdir = @pyexecdir@\npythondir = @pythondir@\nrunstatedir = @runstatedir@\nsbindir = @sbindir@\nsharedstatedir = @sharedstatedir@\nsrcdir = @srcdir@\nsysconfdir = @sysconfdir@\ntarget_alias = @target_alias@\ntop_build_prefix = @top_build_prefix@\ntop_builddir = @top_builddir@\ntop_srcdir = @top_srcdir@\nAM_CPPFLAGS = -I$(srcdir)/../../include $(ICU_CPPFLAGS)\n@HAVE_BIN_TRUE@LDADD = libfstmpdtscript.la      \\\n@HAVE_BIN_TRUE@    ../pdt/libfstpdtscript.la    \\\n@HAVE_BIN_TRUE@    ../../script/libfstscript.la \\\n@HAVE_BIN_TRUE@    ../../lib/libfst.la -lm $(DL_LIBS)\n\n@HAVE_BIN_TRUE@mpdtcompose_SOURCES = mpdtcompose.cc\n@HAVE_BIN_TRUE@mpdtexpand_SOURCES = mpdtexpand.cc\n@HAVE_BIN_TRUE@mpdtinfo_SOURCES = mpdtinfo.cc\n@HAVE_BIN_TRUE@mpdtreverse_SOURCES = mpdtreverse.cc\n@HAVE_SCRIPT_TRUE@lib_LTLIBRARIES = libfstmpdtscript.la\n@HAVE_SCRIPT_TRUE@libfstmpdtscript_la_SOURCES = mpdtscript.cc\n@HAVE_SCRIPT_TRUE@libfstmpdtscript_la_LDFLAGS = -version-info 13:0:0\n@HAVE_SCRIPT_TRUE@libfstmpdtscript_la_LIBADD = ../../script/libfstscript.la \\\n@HAVE_SCRIPT_TRUE@                             ../../lib/libfst.la -lm $(DL_LIBS)\n\nall: all-am\n\n.SUFFIXES:\n.SUFFIXES: .cc .lo .o .obj\n$(srcdir)/Makefile.in:  $(srcdir)/Makefile.am  $(am__configure_deps)\n\t@for dep in $?; do \\\n\t  case '$(am__configure_deps)' in \\\n\t    *$$dep*) \\\n\t      ( cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh ) \\\n\t        && { if test -f $@; then exit 0; else break; fi; }; \\\n\t      exit 1;; \\\n\t  esac; \\\n\tdone; \\\n\techo ' cd $(top_srcdir) && $(AUTOMAKE) --foreign src/extensions/mpdt/Makefile'; \\\n\t$(am__cd) $(top_srcdir) && \\\n\t  $(AUTOMAKE) --foreign src/extensions/mpdt/Makefile\nMakefile: $(srcdir)/Makefile.in $(top_builddir)/config.status\n\t@case '$?' in \\\n\t  *config.status*) \\\n\t    cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh;; \\\n\t  *) \\\n\t    echo ' cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe)'; \\\n\t    cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe);; \\\n\tesac;\n\n$(top_builddir)/config.status: $(top_srcdir)/configure $(CONFIG_STATUS_DEPENDENCIES)\n\tcd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh\n\n$(top_srcdir)/configure:  $(am__configure_deps)\n\tcd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh\n$(ACLOCAL_M4):  $(am__aclocal_m4_deps)\n\tcd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh\n$(am__aclocal_m4_deps):\n\ninstall-libLTLIBRARIES: $(lib_LTLIBRARIES)\n\t@$(NORMAL_INSTALL)\n\t@list='$(lib_LTLIBRARIES)'; test -n \"$(libdir)\" || list=; \\\n\tlist2=; for p in $$list; do \\\n\t  if test -f $$p; then \\\n\t    list2=\"$$list2 $$p\"; \\\n\t  else :; fi; \\\n\tdone; \\\n\ttest -z \"$$list2\" || { \\\n\t  echo \" $(MKDIR_P) '$(DESTDIR)$(libdir)'\"; \\\n\t  $(MKDIR_P) \"$(DESTDIR)$(libdir)\" || exit 1; \\\n\t  echo \" $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) $$list2 '$(DESTDIR)$(libdir)'\"; \\\n\t  $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) $$list2 \"$(DESTDIR)$(libdir)\"; \\\n\t}\n\nuninstall-libLTLIBRARIES:\n\t@$(NORMAL_UNINSTALL)\n\t@list='$(lib_LTLIBRARIES)'; test -n \"$(libdir)\" || list=; \\\n\tfor p in $$list; do \\\n\t  $(am__strip_dir) \\\n\t  echo \" $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=uninstall rm -f '$(DESTDIR)$(libdir)/$$f'\"; \\\n\t  $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=uninstall rm -f \"$(DESTDIR)$(libdir)/$$f\"; \\\n\tdone\n\nclean-libLTLIBRARIES:\n\t-test -z \"$(lib_LTLIBRARIES)\" || rm -f $(lib_LTLIBRARIES)\n\t@list='$(lib_LTLIBRARIES)'; \\\n\tlocs=`for p in $$list; do echo $$p; done | \\\n\t      sed 's|^[^/]*$$|.|; s|/[^/]*$$||; s|$$|/so_locations|' | \\\n\t      sort -u`; \\\n\ttest -z \"$$locs\" || { \\\n\t  echo rm -f $${locs}; \\\n\t  rm -f $${locs}; \\\n\t}\n\nlibfstmpdtscript.la: $(libfstmpdtscript_la_OBJECTS) $(libfstmpdtscript_la_DEPENDENCIES) $(EXTRA_libfstmpdtscript_la_DEPENDENCIES) \n\t$(AM_V_CXXLD)$(libfstmpdtscript_la_LINK) $(am_libfstmpdtscript_la_rpath) $(libfstmpdtscript_la_OBJECTS) $(libfstmpdtscript_la_LIBADD) $(LIBS)\ninstall-binPROGRAMS: $(bin_PROGRAMS)\n\t@$(NORMAL_INSTALL)\n\t@list='$(bin_PROGRAMS)'; test -n \"$(bindir)\" || list=; \\\n\tif test -n \"$$list\"; then \\\n\t  echo \" $(MKDIR_P) '$(DESTDIR)$(bindir)'\"; \\\n\t  $(MKDIR_P) \"$(DESTDIR)$(bindir)\" || exit 1; \\\n\tfi; \\\n\tfor p in $$list; do echo \"$$p $$p\"; done | \\\n\tsed 's/$(EXEEXT)$$//' | \\\n\twhile read p p1; do if test -f $$p \\\n\t || test -f $$p1 \\\n\t  ; then echo \"$$p\"; echo \"$$p\"; else :; fi; \\\n\tdone | \\\n\tsed -e 'p;s,.*/,,;n;h' \\\n\t    -e 's|.*|.|' \\\n\t    -e 'p;x;s,.*/,,;s/$(EXEEXT)$$//;$(transform);s/$$/$(EXEEXT)/' | \\\n\tsed 'N;N;N;s,\\n, ,g' | \\\n\t$(AWK) 'BEGIN { files[\".\"] = \"\"; dirs[\".\"] = 1 } \\\n\t  { d=$$3; if (dirs[d] != 1) { print \"d\", d; dirs[d] = 1 } \\\n\t    if ($$2 == $$4) files[d] = files[d] \" \" $$1; \\\n\t    else { print \"f\", $$3 \"/\" $$4, $$1; } } \\\n\t  END { for (d in files) print \"f\", d, files[d] }' | \\\n\twhile read type dir files; do \\\n\t    if test \"$$dir\" = .; then dir=; else dir=/$$dir; fi; \\\n\t    test -z \"$$files\" || { \\\n\t    echo \" $(INSTALL_PROGRAM_ENV) $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL_PROGRAM) $$files '$(DESTDIR)$(bindir)$$dir'\"; \\\n\t    $(INSTALL_PROGRAM_ENV) $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL_PROGRAM) $$files \"$(DESTDIR)$(bindir)$$dir\" || exit $$?; \\\n\t    } \\\n\t; done\n\nuninstall-binPROGRAMS:\n\t@$(NORMAL_UNINSTALL)\n\t@list='$(bin_PROGRAMS)'; test -n \"$(bindir)\" || list=; \\\n\tfiles=`for p in $$list; do echo \"$$p\"; done | \\\n\t  sed -e 'h;s,^.*/,,;s/$(EXEEXT)$$//;$(transform)' \\\n\t      -e 's/$$/$(EXEEXT)/' \\\n\t`; \\\n\ttest -n \"$$list\" || exit 0; \\\n\techo \" ( cd '$(DESTDIR)$(bindir)' && rm -f\" $$files \")\"; \\\n\tcd \"$(DESTDIR)$(bindir)\" && rm -f $$files\n\nclean-binPROGRAMS:\n\t@list='$(bin_PROGRAMS)'; test -n \"$$list\" || exit 0; \\\n\techo \" rm -f\" $$list; \\\n\trm -f $$list || exit $$?; \\\n\ttest -n \"$(EXEEXT)\" || exit 0; \\\n\tlist=`for p in $$list; do echo \"$$p\"; done | sed 's/$(EXEEXT)$$//'`; \\\n\techo \" rm -f\" $$list; \\\n\trm -f $$list\n\nmpdtcompose$(EXEEXT): $(mpdtcompose_OBJECTS) $(mpdtcompose_DEPENDENCIES) $(EXTRA_mpdtcompose_DEPENDENCIES) \n\t@rm -f mpdtcompose$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(mpdtcompose_OBJECTS) $(mpdtcompose_LDADD) $(LIBS)\n\nmpdtexpand$(EXEEXT): $(mpdtexpand_OBJECTS) $(mpdtexpand_DEPENDENCIES) $(EXTRA_mpdtexpand_DEPENDENCIES) \n\t@rm -f mpdtexpand$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(mpdtexpand_OBJECTS) $(mpdtexpand_LDADD) $(LIBS)\n\nmpdtinfo$(EXEEXT): $(mpdtinfo_OBJECTS) $(mpdtinfo_DEPENDENCIES) $(EXTRA_mpdtinfo_DEPENDENCIES) \n\t@rm -f mpdtinfo$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(mpdtinfo_OBJECTS) $(mpdtinfo_LDADD) $(LIBS)\n\nmpdtreverse$(EXEEXT): $(mpdtreverse_OBJECTS) $(mpdtreverse_DEPENDENCIES) $(EXTRA_mpdtreverse_DEPENDENCIES) \n\t@rm -f mpdtreverse$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(mpdtreverse_OBJECTS) $(mpdtreverse_LDADD) $(LIBS)\n\nmostlyclean-compile:\n\t-rm -f *.$(OBJEXT)\n\ndistclean-compile:\n\t-rm -f *.tab.c\n\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/mpdtcompose.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/mpdtexpand.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/mpdtinfo.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/mpdtreverse.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/mpdtscript.Plo@am__quote@\n\n.cc.o:\n@am__fastdepCXX_TRUE@\t$(AM_V_CXX)depbase=`echo $@ | sed 's|[^/]*$$|$(DEPDIR)/&|;s|\\.o$$||'`;\\\n@am__fastdepCXX_TRUE@\t$(CXXCOMPILE) -MT $@ -MD -MP -MF $$depbase.Tpo -c -o $@ $< &&\\\n@am__fastdepCXX_TRUE@\t$(am__mv) $$depbase.Tpo $$depbase.Po\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\t$(AM_V_CXX)source='$<' object='$@' libtool=no @AMDEPBACKSLASH@\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\tDEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@\n@am__fastdepCXX_FALSE@\t$(AM_V_CXX@am__nodep@)$(CXXCOMPILE) -c -o $@ $<\n\n.cc.obj:\n@am__fastdepCXX_TRUE@\t$(AM_V_CXX)depbase=`echo $@ | sed 's|[^/]*$$|$(DEPDIR)/&|;s|\\.obj$$||'`;\\\n@am__fastdepCXX_TRUE@\t$(CXXCOMPILE) -MT $@ -MD -MP -MF $$depbase.Tpo -c -o $@ `$(CYGPATH_W) '$<'` &&\\\n@am__fastdepCXX_TRUE@\t$(am__mv) $$depbase.Tpo $$depbase.Po\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\t$(AM_V_CXX)source='$<' object='$@' libtool=no @AMDEPBACKSLASH@\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\tDEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@\n@am__fastdepCXX_FALSE@\t$(AM_V_CXX@am__nodep@)$(CXXCOMPILE) -c -o $@ `$(CYGPATH_W) '$<'`\n\n.cc.lo:\n@am__fastdepCXX_TRUE@\t$(AM_V_CXX)depbase=`echo $@ | sed 's|[^/]*$$|$(DEPDIR)/&|;s|\\.lo$$||'`;\\\n@am__fastdepCXX_TRUE@\t$(LTCXXCOMPILE) -MT $@ -MD -MP -MF $$depbase.Tpo -c -o $@ $< &&\\\n@am__fastdepCXX_TRUE@\t$(am__mv) $$depbase.Tpo $$depbase.Plo\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\t$(AM_V_CXX)source='$<' object='$@' libtool=yes @AMDEPBACKSLASH@\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\tDEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@\n@am__fastdepCXX_FALSE@\t$(AM_V_CXX@am__nodep@)$(LTCXXCOMPILE) -c -o $@ $<\n\nmostlyclean-libtool:\n\t-rm -f *.lo\n\nclean-libtool:\n\t-rm -rf .libs _libs\n\nID: $(am__tagged_files)\n\t$(am__define_uniq_tagged_files); mkid -fID $$unique\ntags: tags-am\nTAGS: tags\n\ntags-am: $(TAGS_DEPENDENCIES) $(am__tagged_files)\n\tset x; \\\n\there=`pwd`; \\\n\t$(am__define_uniq_tagged_files); \\\n\tshift; \\\n\tif test -z \"$(ETAGS_ARGS)$$*$$unique\"; then :; else \\\n\t  test -n \"$$unique\" || unique=$$empty_fix; \\\n\t  if test $$# -gt 0; then \\\n\t    $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \\\n\t      \"$$@\" $$unique; \\\n\t  else \\\n\t    $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \\\n\t      $$unique; \\\n\t  fi; \\\n\tfi\nctags: ctags-am\n\nCTAGS: ctags\nctags-am: $(TAGS_DEPENDENCIES) $(am__tagged_files)\n\t$(am__define_uniq_tagged_files); \\\n\ttest -z \"$(CTAGS_ARGS)$$unique\" \\\n\t  || $(CTAGS) $(CTAGSFLAGS) $(AM_CTAGSFLAGS) $(CTAGS_ARGS) \\\n\t     $$unique\n\nGTAGS:\n\there=`$(am__cd) $(top_builddir) && pwd` \\\n\t  && $(am__cd) $(top_srcdir) \\\n\t  && gtags -i $(GTAGS_ARGS) \"$$here\"\ncscopelist: cscopelist-am\n\ncscopelist-am: $(am__tagged_files)\n\tlist='$(am__tagged_files)'; \\\n\tcase \"$(srcdir)\" in \\\n\t  [\\\\/]* | ?:[\\\\/]*) sdir=\"$(srcdir)\" ;; \\\n\t  *) sdir=$(subdir)/$(srcdir) ;; \\\n\tesac; \\\n\tfor i in $$list; do \\\n\t  if test -f \"$$i\"; then \\\n\t    echo \"$(subdir)/$$i\"; \\\n\t  else \\\n\t    echo \"$$sdir/$$i\"; \\\n\t  fi; \\\n\tdone >> $(top_builddir)/cscope.files\n\ndistclean-tags:\n\t-rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags\n\ndistdir: $(DISTFILES)\n\t@srcdirstrip=`echo \"$(srcdir)\" | sed 's/[].[^$$\\\\*]/\\\\\\\\&/g'`; \\\n\ttopsrcdirstrip=`echo \"$(top_srcdir)\" | sed 's/[].[^$$\\\\*]/\\\\\\\\&/g'`; \\\n\tlist='$(DISTFILES)'; \\\n\t  dist_files=`for file in $$list; do echo $$file; done | \\\n\t  sed -e \"s|^$$srcdirstrip/||;t\" \\\n\t      -e \"s|^$$topsrcdirstrip/|$(top_builddir)/|;t\"`; \\\n\tcase $$dist_files in \\\n\t  */*) $(MKDIR_P) `echo \"$$dist_files\" | \\\n\t\t\t   sed '/\\//!d;s|^|$(distdir)/|;s,/[^/]*$$,,' | \\\n\t\t\t   sort -u` ;; \\\n\tesac; \\\n\tfor file in $$dist_files; do \\\n\t  if test -f $$file || test -d $$file; then d=.; else d=$(srcdir); fi; \\\n\t  if test -d $$d/$$file; then \\\n\t    dir=`echo \"/$$file\" | sed -e 's,/[^/]*$$,,'`; \\\n\t    if test -d \"$(distdir)/$$file\"; then \\\n\t      find \"$(distdir)/$$file\" -type d ! -perm -700 -exec chmod u+rwx {} \\;; \\\n\t    fi; \\\n\t    if test -d $(srcdir)/$$file && test $$d != $(srcdir); then \\\n\t      cp -fpR $(srcdir)/$$file \"$(distdir)$$dir\" || exit 1; \\\n\t      find \"$(distdir)/$$file\" -type d ! -perm -700 -exec chmod u+rwx {} \\;; \\\n\t    fi; \\\n\t    cp -fpR $$d/$$file \"$(distdir)$$dir\" || exit 1; \\\n\t  else \\\n\t    test -f \"$(distdir)/$$file\" \\\n\t    || cp -p $$d/$$file \"$(distdir)/$$file\" \\\n\t    || exit 1; \\\n\t  fi; \\\n\tdone\ncheck-am: all-am\ncheck: check-am\nall-am: Makefile $(LTLIBRARIES) $(PROGRAMS)\ninstall-binPROGRAMS: install-libLTLIBRARIES\n\ninstalldirs:\n\tfor dir in \"$(DESTDIR)$(libdir)\" \"$(DESTDIR)$(bindir)\"; do \\\n\t  test -z \"$$dir\" || $(MKDIR_P) \"$$dir\"; \\\n\tdone\ninstall: install-am\ninstall-exec: install-exec-am\ninstall-data: install-data-am\nuninstall: uninstall-am\n\ninstall-am: all-am\n\t@$(MAKE) $(AM_MAKEFLAGS) install-exec-am install-data-am\n\ninstallcheck: installcheck-am\ninstall-strip:\n\tif test -z '$(STRIP)'; then \\\n\t  $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" \\\n\t    install_sh_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" INSTALL_STRIP_FLAG=-s \\\n\t      install; \\\n\telse \\\n\t  $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" \\\n\t    install_sh_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" INSTALL_STRIP_FLAG=-s \\\n\t    \"INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'\" install; \\\n\tfi\nmostlyclean-generic:\n\nclean-generic:\n\ndistclean-generic:\n\t-test -z \"$(CONFIG_CLEAN_FILES)\" || rm -f $(CONFIG_CLEAN_FILES)\n\t-test . = \"$(srcdir)\" || test -z \"$(CONFIG_CLEAN_VPATH_FILES)\" || rm -f $(CONFIG_CLEAN_VPATH_FILES)\n\nmaintainer-clean-generic:\n\t@echo \"This command is intended for maintainers to use\"\n\t@echo \"it deletes files that may require special tools to rebuild.\"\nclean: clean-am\n\nclean-am: clean-binPROGRAMS clean-generic clean-libLTLIBRARIES \\\n\tclean-libtool mostlyclean-am\n\ndistclean: distclean-am\n\t-rm -rf ./$(DEPDIR)\n\t-rm -f Makefile\ndistclean-am: clean-am distclean-compile distclean-generic \\\n\tdistclean-tags\n\ndvi: dvi-am\n\ndvi-am:\n\nhtml: html-am\n\nhtml-am:\n\ninfo: info-am\n\ninfo-am:\n\ninstall-data-am:\n\ninstall-dvi: install-dvi-am\n\ninstall-dvi-am:\n\ninstall-exec-am: install-binPROGRAMS install-libLTLIBRARIES\n\ninstall-html: install-html-am\n\ninstall-html-am:\n\ninstall-info: install-info-am\n\ninstall-info-am:\n\ninstall-man:\n\ninstall-pdf: install-pdf-am\n\ninstall-pdf-am:\n\ninstall-ps: install-ps-am\n\ninstall-ps-am:\n\ninstallcheck-am:\n\nmaintainer-clean: maintainer-clean-am\n\t-rm -rf ./$(DEPDIR)\n\t-rm -f Makefile\nmaintainer-clean-am: distclean-am maintainer-clean-generic\n\nmostlyclean: mostlyclean-am\n\nmostlyclean-am: mostlyclean-compile mostlyclean-generic \\\n\tmostlyclean-libtool\n\npdf: pdf-am\n\npdf-am:\n\nps: ps-am\n\nps-am:\n\nuninstall-am: uninstall-binPROGRAMS uninstall-libLTLIBRARIES\n\n.MAKE: install-am install-strip\n\n.PHONY: CTAGS GTAGS TAGS all all-am check check-am clean \\\n\tclean-binPROGRAMS clean-generic clean-libLTLIBRARIES \\\n\tclean-libtool cscopelist-am ctags ctags-am distclean \\\n\tdistclean-compile distclean-generic distclean-libtool \\\n\tdistclean-tags distdir dvi dvi-am html html-am info info-am \\\n\tinstall install-am install-binPROGRAMS install-data \\\n\tinstall-data-am install-dvi install-dvi-am install-exec \\\n\tinstall-exec-am install-html install-html-am install-info \\\n\tinstall-info-am install-libLTLIBRARIES install-man install-pdf \\\n\tinstall-pdf-am install-ps install-ps-am install-strip \\\n\tinstallcheck installcheck-am installdirs maintainer-clean \\\n\tmaintainer-clean-generic mostlyclean mostlyclean-compile \\\n\tmostlyclean-generic mostlyclean-libtool pdf pdf-am ps ps-am \\\n\ttags tags-am uninstall uninstall-am uninstall-binPROGRAMS \\\n\tuninstall-libLTLIBRARIES\n\n.PRECIOUS: Makefile\n\n\n# Tell versions [3.59,3.63) of GNU make to not export all variables.\n# Otherwise a system limit (for SysV at least) may be exceeded.\n.NOEXPORT:\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/extensions/mpdt/mpdtcompose.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Composes an MPDT and an FST.\n\n#include <cstring>\n\n#include <memory>\n#include <string>\n#include <vector>\n\n#include <fst/flags.h>\n#include <fst/log.h>\n\n#include <fst/extensions/mpdt/mpdtscript.h>\n#include <fst/extensions/mpdt/read_write_utils.h>\n#include <fst/extensions/pdt/getters.h>\n#include <fst/util.h>\n\nDEFINE_string(mpdt_parentheses, \"\",\n              \"MPDT parenthesis label pairs with assignments\");\nDEFINE_bool(left_mpdt, true, \"Is the first argument the MPDT?\");\nDEFINE_bool(connect, true, \"Trim output?\");\nDEFINE_string(compose_filter, \"paren\",\n              \"Composition filter, one of: \\\"expand\\\", \\\"expand_paren\\\", \"\n              \"\\\"paren\\\"\");\n\nint main(int argc, char **argv) {\n  namespace s = fst::script;\n  using fst::MPdtComposeOptions;\n  using fst::PdtComposeFilter;\n  using fst::ReadLabelTriples;\n  using fst::script::FstClass;\n  using fst::script::VectorFstClass;\n\n  string usage = \"Compose an MPDT and an FST.\\n\\n  Usage: \";\n  usage += argv[0];\n  usage += \" in.pdt in.fst [out.mpdt]\\n\";\n  usage += \" in.fst in.pdt [out.mpdt]\\n\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n  if (argc < 3 || argc > 4) {\n    ShowUsage();\n    return 1;\n  }\n\n  const string in1_name = strcmp(argv[1], \"-\") == 0 ? \"\" : argv[1];\n  const string in2_name = strcmp(argv[2], \"-\") == 0 ? \"\" : argv[2];\n  const string out_name = argc > 3 ? argv[3] : \"\";\n\n  if (in1_name.empty() && in2_name.empty()) {\n    LOG(ERROR) << argv[0] << \": Can't take both inputs from standard input.\";\n    return 1;\n  }\n\n  std::unique_ptr<FstClass> ifst1(FstClass::Read(in1_name));\n  if (!ifst1) return 1;\n  std::unique_ptr<FstClass> ifst2(FstClass::Read(in2_name));\n  if (!ifst2) return 1;\n\n  if (FLAGS_mpdt_parentheses.empty()) {\n    LOG(ERROR) << argv[0] << \": No MPDT parenthesis label pairs provided\";\n    return 1;\n  }\n\n  std::vector<s::LabelPair> parens;\n  std::vector<int64> assignments;\n  if (!ReadLabelTriples(FLAGS_mpdt_parentheses, &parens, &assignments, false))\n    return 1;\n\n  VectorFstClass ofst(ifst1->ArcType());\n\n  PdtComposeFilter compose_filter;\n  if (!s::GetPdtComposeFilter(FLAGS_compose_filter, &compose_filter)) {\n    LOG(ERROR) << argv[0] << \": Unknown or unsupported compose filter type: \"\n               << FLAGS_compose_filter;\n    return 1;\n  }\n\n  const MPdtComposeOptions opts(FLAGS_connect, compose_filter);\n\n  s::MPdtCompose(*ifst1, *ifst2, parens, assignments, &ofst, opts,\n                 FLAGS_left_mpdt);\n\n  ofst.Write(out_name);\n\n  return 0;\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/extensions/mpdt/mpdtexpand.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Expands a (bounded-stack) MPDT as an FST.\n\n#include <cstring>\n\n#include <memory>\n#include <string>\n#include <vector>\n\n#include <fst/flags.h>\n#include <fst/log.h>\n\n#include <fst/extensions/mpdt/mpdtscript.h>\n#include <fst/extensions/mpdt/read_write_utils.h>\n#include <fst/util.h>\n\nDEFINE_string(mpdt_parentheses, \"\",\n              \"MPDT parenthesis label pairs with assignments\");\nDEFINE_bool(connect, true, \"Trim output?\");\nDEFINE_bool(keep_parentheses, false, \"Keep PDT parentheses in result?\");\n\nint main(int argc, char **argv) {\n  namespace s = fst::script;\n  using fst::script::FstClass;\n  using fst::script::VectorFstClass;\n  using fst::ReadLabelTriples;\n  using fst::MPdtExpandOptions;\n\n  string usage = \"Expand a (bounded-stack) MPDT as an FST.\\n\\n  Usage: \";\n  usage += argv[0];\n  usage += \" in.pdt [out.fst]\\n\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n  if (argc > 3) {\n    ShowUsage();\n    return 1;\n  }\n\n  const string in_name =\n      (argc > 1 && (strcmp(argv[1], \"-\") != 0)) ? argv[1] : \"\";\n  const string out_name = argc > 2 ? argv[2] : \"\";\n\n  std::unique_ptr<FstClass> ifst(FstClass::Read(in_name));\n  if (!ifst) return 1;\n\n  if (FLAGS_mpdt_parentheses.empty()) {\n    LOG(ERROR) << argv[0] << \": No MPDT parenthesis label pairs provided\";\n    return 1;\n  }\n\n  std::vector<s::LabelPair> parens;\n  std::vector<int64> assignments;\n  if (!ReadLabelTriples(FLAGS_mpdt_parentheses, &parens, &assignments, false))\n    return 1;\n\n  VectorFstClass ofst(ifst->ArcType());\n\n  const MPdtExpandOptions opts(FLAGS_connect, FLAGS_keep_parentheses);\n\n  s::MPdtExpand(*ifst, parens, assignments, &ofst, opts);\n\n  ofst.Write(out_name);\n\n  return 0;\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/extensions/mpdt/mpdtinfo.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Prints out various information about an MPDT such as number of states, arcs,\n// and parentheses.\n\n#include <cstring>\n\n#include <memory>\n#include <string>\n#include <vector>\n\n#include <fst/flags.h>\n#include <fst/log.h>\n\n#include <fst/extensions/mpdt/mpdtscript.h>\n#include <fst/extensions/mpdt/read_write_utils.h>\n#include <fst/util.h>\n\nDEFINE_string(mpdt_parentheses, \"\",\n              \"MPDT parenthesis label pairs with assignments\");\n\nint main(int argc, char **argv) {\n  namespace s = fst::script;\n  using fst::script::FstClass;\n  using fst::ReadLabelTriples;\n\n  string usage = \"Prints out information about an MPDT.\\n\\n  Usage: \";\n  usage += argv[0];\n  usage += \" in.pdt\\n\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n  if (argc > 2) {\n    ShowUsage();\n    return 1;\n  }\n\n  const string in_name =\n      (argc > 1 && (strcmp(argv[1], \"-\") != 0)) ? argv[1] : \"\";\n\n  std::unique_ptr<FstClass> ifst(FstClass::Read(in_name));\n  if (!ifst) return 1;\n\n  if (FLAGS_mpdt_parentheses.empty()) {\n    LOG(ERROR) << argv[0] << \": No MPDT parenthesis label pairs provided\";\n    return 1;\n  }\n\n  std::vector<s::LabelPair> parens;\n  std::vector<int64> assignments;\n  if (!ReadLabelTriples(FLAGS_mpdt_parentheses, &parens, &assignments, false))\n    return 1;\n\n  s::PrintMPdtInfo(*ifst, parens, assignments);\n\n  return 0;\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/extensions/mpdt/mpdtreverse.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Reverses an MPDT.\n\n#include <cstring>\n\n#include <memory>\n#include <string>\n#include <vector>\n\n#include <fst/flags.h>\n#include <fst/log.h>\n\n#include <fst/extensions/mpdt/mpdtscript.h>\n#include <fst/extensions/mpdt/read_write_utils.h>\n#include <fst/util.h>\n\nDEFINE_string(mpdt_parentheses, \"\",\n              \"MPDT parenthesis label pairs with assignments.\");\n\nDEFINE_string(mpdt_new_parentheses, \"\",\n              \"Output for reassigned parentheses and stacks\");\n\nint main(int argc, char **argv) {\n  namespace s = fst::script;\n  using fst::ReadLabelTriples;\n  using fst::WriteLabelTriples;\n  using fst::script::FstClass;\n  using fst::script::VectorFstClass;\n\n  string usage = \"Reverse an MPDT.\\n\\n  Usage: \";\n  usage += argv[0];\n  usage += \" in.pdt [out.fst]\\n\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n  if (argc > 3) {\n    ShowUsage();\n    return 1;\n  }\n\n  const string in_name =\n      (argc > 1 && (strcmp(argv[1], \"-\") != 0)) ? argv[1] : \"\";\n  const string out_name = argc > 2 ? argv[2] : \"\";\n\n  std::unique_ptr<FstClass> ifst(FstClass::Read(in_name));\n  if (!ifst) return 1;\n\n  if (FLAGS_mpdt_parentheses.empty()) {\n    LOG(ERROR) << argv[0] << \": No MPDT parenthesis label pairs provided\";\n    return 1;\n  }\n\n  if (FLAGS_mpdt_new_parentheses.empty()) {\n    LOG(ERROR) << argv[0] << \": No MPDT output parenthesis label file provided\";\n    return 1;\n  }\n\n  std::vector<s::LabelPair> parens;\n  std::vector<int64> assignments;\n  if (!ReadLabelTriples(FLAGS_mpdt_parentheses, &parens, &assignments, false))\n    return 1;\n\n  VectorFstClass ofst(ifst->ArcType());\n\n  s::MPdtReverse(*ifst, parens, &assignments, &ofst);\n\n  ofst.Write(out_name);\n\n  if (!WriteLabelTriples(FLAGS_mpdt_new_parentheses, parens, assignments))\n    return 1;\n\n  return 0;\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/extensions/mpdt/mpdtscript.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Definitions of 'scriptable' versions of mpdt operations, that is,\n// those that can be called with FstClass-type arguments.\n//\n// See comments in nlp/fst/script/script-impl.h for how the registration\n// mechanism allows these to work with various arc types.\n\n#include <string>\n#include <vector>\n\n#include <fst/extensions/mpdt/compose.h>\n#include <fst/extensions/mpdt/expand.h>\n#include <fst/extensions/mpdt/mpdtscript.h>\n#include <fst/extensions/mpdt/reverse.h>\n#include <fst/script/script-impl.h>\n\nnamespace fst {\nnamespace script {\n\nvoid MPdtCompose(const FstClass &ifst1, const FstClass &ifst2,\n                 const std::vector<LabelPair> &parens,\n                 const std::vector<int64> &assignments, MutableFstClass *ofst,\n                 const MPdtComposeOptions &copts, bool left_pdt) {\n  if (!internal::ArcTypesMatch(ifst1, ifst2, \"MPdtCompose\") ||\n      !internal::ArcTypesMatch(ifst1, *ofst, \"MPdtCompose\")) return;\n  MPdtComposeArgs args(ifst1, ifst2, parens, assignments, ofst, copts,\n                       left_pdt);\n  Apply<Operation<MPdtComposeArgs>>(\"MPdtCompose\", ifst1.ArcType(), &args);\n}\n\nvoid MPdtExpand(const FstClass &ifst, const std::vector<LabelPair> &parens,\n                const std::vector<int64> &assignments, MutableFstClass *ofst,\n                const MPdtExpandOptions &opts) {\n  MPdtExpandArgs args(ifst, parens, assignments, ofst, opts);\n  Apply<Operation<MPdtExpandArgs>>(\"MPdtExpand\", ifst.ArcType(), &args);\n}\n\nvoid MPdtExpand(const FstClass &ifst, const std::vector<LabelPair> &parens,\n                const std::vector<int64> &assignments, MutableFstClass *ofst,\n                bool connect) {\n  MPdtExpand(ifst, parens, assignments, ofst, MPdtExpandOptions(connect));\n}\n\nvoid MPdtReverse(const FstClass &ifst, const std::vector<LabelPair> &parens,\n                 std::vector<int64> *assignments, MutableFstClass *ofst) {\n  MPdtReverseArgs args(ifst, parens, assignments, ofst);\n  Apply<Operation<MPdtReverseArgs>>(\"MPdtReverse\", ifst.ArcType(), &args);\n}\n\nvoid PrintMPdtInfo(const FstClass &ifst, const std::vector<LabelPair> &parens,\n                   const std::vector<int64> &assignments) {\n  PrintMPdtInfoArgs args(ifst, parens, assignments);\n  Apply<Operation<PrintMPdtInfoArgs>>(\"PrintMPdtInfo\", ifst.ArcType(), &args);\n}\n\n// Register operations for common arc types.\n\nREGISTER_FST_MPDT_OPERATIONS(StdArc);\nREGISTER_FST_MPDT_OPERATIONS(LogArc);\nREGISTER_FST_MPDT_OPERATIONS(Log64Arc);\n\n}  // namespace script\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/extensions/ngram/CMakeLists.txt",
    "content": "file(GLOB HEADER_FILES ../../include/fst/extensions/ngram/*.h)\nmessage(STATUS \"${HEADER_FILES}\")\n\nadd_library(fstngram\n    bitmap-index.cc \n    ngram-fst.cc \n    nthbit.cc\n    ${HEADER_FILES}\n)\n\ntarget_link_libraries(fstngram\n    fst\n)\n\nset_target_properties(fstngram PROPERTIES\n  SOVERSION \"${SOVERSION}\"\n  FOLDER ngram\n)\n\ninstall(TARGETS fstngram \n\tLIBRARY DESTINATION lib\n\tARCHIVE DESTINATION lib\n\tRUNTIME DESTINATION lib\n)\n\nadd_library(ngram_fst MODULE\n    bitmap-index.cc \n    ngram-fst.cc \n    nthbit.cc\n)\n\nset_target_properties(ngram_fst PROPERTIES\n    WINDOWS_EXPORT_ALL_SYMBOLS true\n    FOLDER ngram/modules\n)\n\ntarget_link_libraries(ngram_fst\n    fst\n)\n\ninstall(TARGETS ngram_fst\n    LIBRARY DESTINATION lib/fst\n)\n\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/extensions/ngram/Makefile.am",
    "content": "AM_CPPFLAGS = -I$(srcdir)/../../include $(ICU_CPPFLAGS)\n\nlibfstdir = @libfstdir@\nlibfst_LTLIBRARIES = ngram-fst.la\n\nlib_LTLIBRARIES = libfstngram.la\n\nngram_fst_la_SOURCES = bitmap-index.cc ngram-fst.cc nthbit.cc\nngram_fst_la_LDFLAGS = -module\n\nlibfstngram_la_SOURCES = bitmap-index.cc ngram-fst.cc nthbit.cc\nlibfstngram_la_LDFLAGS = -version-info 13:0:0\nlibfstngram_la_LIBADD = ../../lib/libfst.la -lm $(DL_LIBS)\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/extensions/ngram/Makefile.in",
    "content": "# Makefile.in generated by automake 1.15.1 from Makefile.am.\n# @configure_input@\n\n# Copyright (C) 1994-2017 Free Software Foundation, Inc.\n\n# This Makefile.in is free software; the Free Software Foundation\n# gives unlimited permission to copy and/or distribute it,\n# with or without modifications, as long as this notice is preserved.\n\n# This program is distributed in the hope that it will be useful,\n# but WITHOUT ANY WARRANTY, to the extent permitted by law; without\n# even the implied warranty of MERCHANTABILITY or FITNESS FOR A\n# PARTICULAR PURPOSE.\n\n@SET_MAKE@\n\nVPATH = @srcdir@\nam__is_gnu_make = { \\\n  if test -z '$(MAKELEVEL)'; then \\\n    false; \\\n  elif test -n '$(MAKE_HOST)'; then \\\n    true; \\\n  elif test -n '$(MAKE_VERSION)' && test -n '$(CURDIR)'; then \\\n    true; \\\n  else \\\n    false; \\\n  fi; \\\n}\nam__make_running_with_option = \\\n  case $${target_option-} in \\\n      ?) ;; \\\n      *) echo \"am__make_running_with_option: internal error: invalid\" \\\n              \"target option '$${target_option-}' specified\" >&2; \\\n         exit 1;; \\\n  esac; \\\n  has_opt=no; \\\n  sane_makeflags=$$MAKEFLAGS; \\\n  if $(am__is_gnu_make); then \\\n    sane_makeflags=$$MFLAGS; \\\n  else \\\n    case $$MAKEFLAGS in \\\n      *\\\\[\\ \\\t]*) \\\n        bs=\\\\; \\\n        sane_makeflags=`printf '%s\\n' \"$$MAKEFLAGS\" \\\n          | sed \"s/$$bs$$bs[$$bs $$bs\t]*//g\"`;; \\\n    esac; \\\n  fi; \\\n  skip_next=no; \\\n  strip_trailopt () \\\n  { \\\n    flg=`printf '%s\\n' \"$$flg\" | sed \"s/$$1.*$$//\"`; \\\n  }; \\\n  for flg in $$sane_makeflags; do \\\n    test $$skip_next = yes && { skip_next=no; continue; }; \\\n    case $$flg in \\\n      *=*|--*) continue;; \\\n        -*I) strip_trailopt 'I'; skip_next=yes;; \\\n      -*I?*) strip_trailopt 'I';; \\\n        -*O) strip_trailopt 'O'; skip_next=yes;; \\\n      -*O?*) strip_trailopt 'O';; \\\n        -*l) strip_trailopt 'l'; skip_next=yes;; \\\n      -*l?*) strip_trailopt 'l';; \\\n      -[dEDm]) skip_next=yes;; \\\n      -[JT]) skip_next=yes;; \\\n    esac; \\\n    case $$flg in \\\n      *$$target_option*) has_opt=yes; break;; \\\n    esac; \\\n  done; \\\n  test $$has_opt = yes\nam__make_dryrun = (target_option=n; $(am__make_running_with_option))\nam__make_keepgoing = (target_option=k; $(am__make_running_with_option))\npkgdatadir = $(datadir)/@PACKAGE@\npkgincludedir = $(includedir)/@PACKAGE@\npkglibdir = $(libdir)/@PACKAGE@\npkglibexecdir = $(libexecdir)/@PACKAGE@\nam__cd = CDPATH=\"$${ZSH_VERSION+.}$(PATH_SEPARATOR)\" && cd\ninstall_sh_DATA = $(install_sh) -c -m 644\ninstall_sh_PROGRAM = $(install_sh) -c\ninstall_sh_SCRIPT = $(install_sh) -c\nINSTALL_HEADER = $(INSTALL_DATA)\ntransform = $(program_transform_name)\nNORMAL_INSTALL = :\nPRE_INSTALL = :\nPOST_INSTALL = :\nNORMAL_UNINSTALL = :\nPRE_UNINSTALL = :\nPOST_UNINSTALL = :\nbuild_triplet = @build@\nhost_triplet = @host@\nsubdir = src/extensions/ngram\nACLOCAL_M4 = $(top_srcdir)/aclocal.m4\nam__aclocal_m4_deps = $(top_srcdir)/m4/ac_python_devel.m4 \\\n\t$(top_srcdir)/m4/libtool.m4 $(top_srcdir)/m4/ltoptions.m4 \\\n\t$(top_srcdir)/m4/ltsugar.m4 $(top_srcdir)/m4/ltversion.m4 \\\n\t$(top_srcdir)/m4/lt~obsolete.m4 $(top_srcdir)/configure.ac\nam__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \\\n\t$(ACLOCAL_M4)\nDIST_COMMON = $(srcdir)/Makefile.am $(am__DIST_COMMON)\nmkinstalldirs = $(install_sh) -d\nCONFIG_HEADER = $(top_builddir)/config.h \\\n\t$(top_builddir)/src/include/fst/config.h\nCONFIG_CLEAN_FILES =\nCONFIG_CLEAN_VPATH_FILES =\nam__vpath_adj_setup = srcdirstrip=`echo \"$(srcdir)\" | sed 's|.|.|g'`;\nam__vpath_adj = case $$p in \\\n    $(srcdir)/*) f=`echo \"$$p\" | sed \"s|^$$srcdirstrip/||\"`;; \\\n    *) f=$$p;; \\\n  esac;\nam__strip_dir = f=`echo $$p | sed -e 's|^.*/||'`;\nam__install_max = 40\nam__nobase_strip_setup = \\\n  srcdirstrip=`echo \"$(srcdir)\" | sed 's/[].[^$$\\\\*|]/\\\\\\\\&/g'`\nam__nobase_strip = \\\n  for p in $$list; do echo \"$$p\"; done | sed -e \"s|$$srcdirstrip/||\"\nam__nobase_list = $(am__nobase_strip_setup); \\\n  for p in $$list; do echo \"$$p $$p\"; done | \\\n  sed \"s| $$srcdirstrip/| |;\"' / .*\\//!s/ .*/ ./; s,\\( .*\\)/[^/]*$$,\\1,' | \\\n  $(AWK) 'BEGIN { files[\".\"] = \"\" } { files[$$2] = files[$$2] \" \" $$1; \\\n    if (++n[$$2] == $(am__install_max)) \\\n      { print $$2, files[$$2]; n[$$2] = 0; files[$$2] = \"\" } } \\\n    END { for (dir in files) print dir, files[dir] }'\nam__base_list = \\\n  sed '$$!N;$$!N;$$!N;$$!N;$$!N;$$!N;$$!N;s/\\n/ /g' | \\\n  sed '$$!N;$$!N;$$!N;$$!N;s/\\n/ /g'\nam__uninstall_files_from_dir = { \\\n  test -z \"$$files\" \\\n    || { test ! -d \"$$dir\" && test ! -f \"$$dir\" && test ! -r \"$$dir\"; } \\\n    || { echo \" ( cd '$$dir' && rm -f\" $$files \")\"; \\\n         $(am__cd) \"$$dir\" && rm -f $$files; }; \\\n  }\nam__installdirs = \"$(DESTDIR)$(libdir)\" \"$(DESTDIR)$(libfstdir)\"\nLTLIBRARIES = $(lib_LTLIBRARIES) $(libfst_LTLIBRARIES)\nam__DEPENDENCIES_1 =\nlibfstngram_la_DEPENDENCIES = ../../lib/libfst.la \\\n\t$(am__DEPENDENCIES_1)\nam_libfstngram_la_OBJECTS = bitmap-index.lo ngram-fst.lo nthbit.lo\nlibfstngram_la_OBJECTS = $(am_libfstngram_la_OBJECTS)\nAM_V_lt = $(am__v_lt_@AM_V@)\nam__v_lt_ = $(am__v_lt_@AM_DEFAULT_V@)\nam__v_lt_0 = --silent\nam__v_lt_1 = \nlibfstngram_la_LINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX \\\n\t$(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=link $(CXXLD) \\\n\t$(AM_CXXFLAGS) $(CXXFLAGS) $(libfstngram_la_LDFLAGS) \\\n\t$(LDFLAGS) -o $@\nngram_fst_la_LIBADD =\nam_ngram_fst_la_OBJECTS = bitmap-index.lo ngram-fst.lo nthbit.lo\nngram_fst_la_OBJECTS = $(am_ngram_fst_la_OBJECTS)\nngram_fst_la_LINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \\\n\t$(LIBTOOLFLAGS) --mode=link $(CXXLD) $(AM_CXXFLAGS) \\\n\t$(CXXFLAGS) $(ngram_fst_la_LDFLAGS) $(LDFLAGS) -o $@\nAM_V_P = $(am__v_P_@AM_V@)\nam__v_P_ = $(am__v_P_@AM_DEFAULT_V@)\nam__v_P_0 = false\nam__v_P_1 = :\nAM_V_GEN = $(am__v_GEN_@AM_V@)\nam__v_GEN_ = $(am__v_GEN_@AM_DEFAULT_V@)\nam__v_GEN_0 = @echo \"  GEN     \" $@;\nam__v_GEN_1 = \nAM_V_at = $(am__v_at_@AM_V@)\nam__v_at_ = $(am__v_at_@AM_DEFAULT_V@)\nam__v_at_0 = @\nam__v_at_1 = \nDEFAULT_INCLUDES = \ndepcomp = $(SHELL) $(top_srcdir)/depcomp\nam__depfiles_maybe = depfiles\nam__mv = mv -f\nCXXCOMPILE = $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) \\\n\t$(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS)\nLTCXXCOMPILE = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \\\n\t$(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) \\\n\t$(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) \\\n\t$(AM_CXXFLAGS) $(CXXFLAGS)\nAM_V_CXX = $(am__v_CXX_@AM_V@)\nam__v_CXX_ = $(am__v_CXX_@AM_DEFAULT_V@)\nam__v_CXX_0 = @echo \"  CXX     \" $@;\nam__v_CXX_1 = \nCXXLD = $(CXX)\nCXXLINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \\\n\t$(LIBTOOLFLAGS) --mode=link $(CXXLD) $(AM_CXXFLAGS) \\\n\t$(CXXFLAGS) $(AM_LDFLAGS) $(LDFLAGS) -o $@\nAM_V_CXXLD = $(am__v_CXXLD_@AM_V@)\nam__v_CXXLD_ = $(am__v_CXXLD_@AM_DEFAULT_V@)\nam__v_CXXLD_0 = @echo \"  CXXLD   \" $@;\nam__v_CXXLD_1 = \nSOURCES = $(libfstngram_la_SOURCES) $(ngram_fst_la_SOURCES)\nDIST_SOURCES = $(libfstngram_la_SOURCES) $(ngram_fst_la_SOURCES)\nam__can_run_installinfo = \\\n  case $$AM_UPDATE_INFO_DIR in \\\n    n|no|NO) false;; \\\n    *) (install-info --version) >/dev/null 2>&1;; \\\n  esac\nam__tagged_files = $(HEADERS) $(SOURCES) $(TAGS_FILES) $(LISP)\n# Read a list of newline-separated strings from the standard input,\n# and print each of them once, without duplicates.  Input order is\n# *not* preserved.\nam__uniquify_input = $(AWK) '\\\n  BEGIN { nonempty = 0; } \\\n  { items[$$0] = 1; nonempty = 1; } \\\n  END { if (nonempty) { for (i in items) print i; }; } \\\n'\n# Make sure the list of sources is unique.  This is necessary because,\n# e.g., the same source file might be shared among _SOURCES variables\n# for different programs/libraries.\nam__define_uniq_tagged_files = \\\n  list='$(am__tagged_files)'; \\\n  unique=`for i in $$list; do \\\n    if test -f \"$$i\"; then echo $$i; else echo $(srcdir)/$$i; fi; \\\n  done | $(am__uniquify_input)`\nETAGS = etags\nCTAGS = ctags\nam__DIST_COMMON = $(srcdir)/Makefile.in $(top_srcdir)/depcomp\nDISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST)\nACLOCAL = @ACLOCAL@\nAMTAR = @AMTAR@\nAM_DEFAULT_VERBOSITY = @AM_DEFAULT_VERBOSITY@\nAR = @AR@\nAUTOCONF = @AUTOCONF@\nAUTOHEADER = @AUTOHEADER@\nAUTOMAKE = @AUTOMAKE@\nAWK = @AWK@\nCC = @CC@\nCCDEPMODE = @CCDEPMODE@\nCFLAGS = @CFLAGS@\nCPP = @CPP@\nCPPFLAGS = @CPPFLAGS@\nCXX = @CXX@\nCXXCPP = @CXXCPP@\nCXXDEPMODE = @CXXDEPMODE@\nCXXFLAGS = @CXXFLAGS@\nCYGPATH_W = @CYGPATH_W@\nDEFS = @DEFS@\nDEPDIR = @DEPDIR@\nDLLTOOL = @DLLTOOL@\nDL_LIBS = @DL_LIBS@\nDSYMUTIL = @DSYMUTIL@\nDUMPBIN = @DUMPBIN@\nECHO_C = @ECHO_C@\nECHO_N = @ECHO_N@\nECHO_T = @ECHO_T@\nEGREP = @EGREP@\nEXEEXT = @EXEEXT@\nFGREP = @FGREP@\nGREP = @GREP@\nINSTALL = @INSTALL@\nINSTALL_DATA = @INSTALL_DATA@\nINSTALL_PROGRAM = @INSTALL_PROGRAM@\nINSTALL_SCRIPT = @INSTALL_SCRIPT@\nINSTALL_STRIP_PROGRAM = @INSTALL_STRIP_PROGRAM@\nLD = @LD@\nLDFLAGS = @LDFLAGS@\nLIBOBJS = @LIBOBJS@\nLIBS = @LIBS@\nLIBTOOL = @LIBTOOL@\nLIPO = @LIPO@\nLN_S = @LN_S@\nLTLIBOBJS = @LTLIBOBJS@\nLT_SYS_LIBRARY_PATH = @LT_SYS_LIBRARY_PATH@\nMAKEINFO = @MAKEINFO@\nMANIFEST_TOOL = @MANIFEST_TOOL@\nMKDIR_P = @MKDIR_P@\nNM = @NM@\nNMEDIT = @NMEDIT@\nOBJDUMP = @OBJDUMP@\nOBJEXT = @OBJEXT@\nOTOOL = @OTOOL@\nOTOOL64 = @OTOOL64@\nPACKAGE = @PACKAGE@\nPACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@\nPACKAGE_NAME = @PACKAGE_NAME@\nPACKAGE_STRING = @PACKAGE_STRING@\nPACKAGE_TARNAME = @PACKAGE_TARNAME@\nPACKAGE_URL = @PACKAGE_URL@\nPACKAGE_VERSION = @PACKAGE_VERSION@\nPATH_SEPARATOR = @PATH_SEPARATOR@\nPYTHON = @PYTHON@\nPYTHON_CPPFLAGS = @PYTHON_CPPFLAGS@\nPYTHON_EXEC_PREFIX = @PYTHON_EXEC_PREFIX@\nPYTHON_EXTRA_LDFLAGS = @PYTHON_EXTRA_LDFLAGS@\nPYTHON_EXTRA_LIBS = @PYTHON_EXTRA_LIBS@\nPYTHON_LDFLAGS = @PYTHON_LDFLAGS@\nPYTHON_PLATFORM = @PYTHON_PLATFORM@\nPYTHON_PREFIX = @PYTHON_PREFIX@\nPYTHON_SITE_PKG = @PYTHON_SITE_PKG@\nPYTHON_VERSION = @PYTHON_VERSION@\nRANLIB = @RANLIB@\nSED = @SED@\nSET_MAKE = @SET_MAKE@\nSHELL = @SHELL@\nSTRIP = @STRIP@\nVERSION = @VERSION@\nabs_builddir = @abs_builddir@\nabs_srcdir = @abs_srcdir@\nabs_top_builddir = @abs_top_builddir@\nabs_top_srcdir = @abs_top_srcdir@\nac_ct_AR = @ac_ct_AR@\nac_ct_CC = @ac_ct_CC@\nac_ct_CXX = @ac_ct_CXX@\nac_ct_DUMPBIN = @ac_ct_DUMPBIN@\nam__include = @am__include@\nam__leading_dot = @am__leading_dot@\nam__quote = @am__quote@\nam__tar = @am__tar@\nam__untar = @am__untar@\nbindir = @bindir@\nbuild = @build@\nbuild_alias = @build_alias@\nbuild_cpu = @build_cpu@\nbuild_os = @build_os@\nbuild_vendor = @build_vendor@\nbuilddir = @builddir@\ndatadir = @datadir@\ndatarootdir = @datarootdir@\ndocdir = @docdir@\ndvidir = @dvidir@\nexec_prefix = @exec_prefix@\nhost = @host@\nhost_alias = @host_alias@\nhost_cpu = @host_cpu@\nhost_os = @host_os@\nhost_vendor = @host_vendor@\nhtmldir = @htmldir@\nincludedir = @includedir@\ninfodir = @infodir@\ninstall_sh = @install_sh@\nlibdir = @libdir@\nlibexecdir = @libexecdir@\nlibfstdir = @libfstdir@\nlocaledir = @localedir@\nlocalstatedir = @localstatedir@\nmandir = @mandir@\nmkdir_p = @mkdir_p@\noldincludedir = @oldincludedir@\npdfdir = @pdfdir@\npkgpyexecdir = @pkgpyexecdir@\npkgpythondir = @pkgpythondir@\nprefix = @prefix@\nprogram_transform_name = @program_transform_name@\npsdir = @psdir@\npyexecdir = @pyexecdir@\npythondir = @pythondir@\nrunstatedir = @runstatedir@\nsbindir = @sbindir@\nsharedstatedir = @sharedstatedir@\nsrcdir = @srcdir@\nsysconfdir = @sysconfdir@\ntarget_alias = @target_alias@\ntop_build_prefix = @top_build_prefix@\ntop_builddir = @top_builddir@\ntop_srcdir = @top_srcdir@\nAM_CPPFLAGS = -I$(srcdir)/../../include $(ICU_CPPFLAGS)\nlibfst_LTLIBRARIES = ngram-fst.la\nlib_LTLIBRARIES = libfstngram.la\nngram_fst_la_SOURCES = bitmap-index.cc ngram-fst.cc nthbit.cc\nngram_fst_la_LDFLAGS = -module\nlibfstngram_la_SOURCES = bitmap-index.cc ngram-fst.cc nthbit.cc\nlibfstngram_la_LDFLAGS = -version-info 13:0:0\nlibfstngram_la_LIBADD = ../../lib/libfst.la -lm $(DL_LIBS)\nall: all-am\n\n.SUFFIXES:\n.SUFFIXES: .cc .lo .o .obj\n$(srcdir)/Makefile.in:  $(srcdir)/Makefile.am  $(am__configure_deps)\n\t@for dep in $?; do \\\n\t  case '$(am__configure_deps)' in \\\n\t    *$$dep*) \\\n\t      ( cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh ) \\\n\t        && { if test -f $@; then exit 0; else break; fi; }; \\\n\t      exit 1;; \\\n\t  esac; \\\n\tdone; \\\n\techo ' cd $(top_srcdir) && $(AUTOMAKE) --foreign src/extensions/ngram/Makefile'; \\\n\t$(am__cd) $(top_srcdir) && \\\n\t  $(AUTOMAKE) --foreign src/extensions/ngram/Makefile\nMakefile: $(srcdir)/Makefile.in $(top_builddir)/config.status\n\t@case '$?' in \\\n\t  *config.status*) \\\n\t    cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh;; \\\n\t  *) \\\n\t    echo ' cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe)'; \\\n\t    cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe);; \\\n\tesac;\n\n$(top_builddir)/config.status: $(top_srcdir)/configure $(CONFIG_STATUS_DEPENDENCIES)\n\tcd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh\n\n$(top_srcdir)/configure:  $(am__configure_deps)\n\tcd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh\n$(ACLOCAL_M4):  $(am__aclocal_m4_deps)\n\tcd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh\n$(am__aclocal_m4_deps):\n\ninstall-libLTLIBRARIES: $(lib_LTLIBRARIES)\n\t@$(NORMAL_INSTALL)\n\t@list='$(lib_LTLIBRARIES)'; test -n \"$(libdir)\" || list=; \\\n\tlist2=; for p in $$list; do \\\n\t  if test -f $$p; then \\\n\t    list2=\"$$list2 $$p\"; \\\n\t  else :; fi; \\\n\tdone; \\\n\ttest -z \"$$list2\" || { \\\n\t  echo \" $(MKDIR_P) '$(DESTDIR)$(libdir)'\"; \\\n\t  $(MKDIR_P) \"$(DESTDIR)$(libdir)\" || exit 1; \\\n\t  echo \" $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) $$list2 '$(DESTDIR)$(libdir)'\"; \\\n\t  $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) $$list2 \"$(DESTDIR)$(libdir)\"; \\\n\t}\n\nuninstall-libLTLIBRARIES:\n\t@$(NORMAL_UNINSTALL)\n\t@list='$(lib_LTLIBRARIES)'; test -n \"$(libdir)\" || list=; \\\n\tfor p in $$list; do \\\n\t  $(am__strip_dir) \\\n\t  echo \" $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=uninstall rm -f '$(DESTDIR)$(libdir)/$$f'\"; \\\n\t  $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=uninstall rm -f \"$(DESTDIR)$(libdir)/$$f\"; \\\n\tdone\n\nclean-libLTLIBRARIES:\n\t-test -z \"$(lib_LTLIBRARIES)\" || rm -f $(lib_LTLIBRARIES)\n\t@list='$(lib_LTLIBRARIES)'; \\\n\tlocs=`for p in $$list; do echo $$p; done | \\\n\t      sed 's|^[^/]*$$|.|; s|/[^/]*$$||; s|$$|/so_locations|' | \\\n\t      sort -u`; \\\n\ttest -z \"$$locs\" || { \\\n\t  echo rm -f $${locs}; \\\n\t  rm -f $${locs}; \\\n\t}\n\ninstall-libfstLTLIBRARIES: $(libfst_LTLIBRARIES)\n\t@$(NORMAL_INSTALL)\n\t@list='$(libfst_LTLIBRARIES)'; test -n \"$(libfstdir)\" || list=; \\\n\tlist2=; for p in $$list; do \\\n\t  if test -f $$p; then \\\n\t    list2=\"$$list2 $$p\"; \\\n\t  else :; fi; \\\n\tdone; \\\n\ttest -z \"$$list2\" || { \\\n\t  echo \" $(MKDIR_P) '$(DESTDIR)$(libfstdir)'\"; \\\n\t  $(MKDIR_P) \"$(DESTDIR)$(libfstdir)\" || exit 1; \\\n\t  echo \" $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) $$list2 '$(DESTDIR)$(libfstdir)'\"; \\\n\t  $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) $$list2 \"$(DESTDIR)$(libfstdir)\"; \\\n\t}\n\nuninstall-libfstLTLIBRARIES:\n\t@$(NORMAL_UNINSTALL)\n\t@list='$(libfst_LTLIBRARIES)'; test -n \"$(libfstdir)\" || list=; \\\n\tfor p in $$list; do \\\n\t  $(am__strip_dir) \\\n\t  echo \" $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=uninstall rm -f '$(DESTDIR)$(libfstdir)/$$f'\"; \\\n\t  $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=uninstall rm -f \"$(DESTDIR)$(libfstdir)/$$f\"; \\\n\tdone\n\nclean-libfstLTLIBRARIES:\n\t-test -z \"$(libfst_LTLIBRARIES)\" || rm -f $(libfst_LTLIBRARIES)\n\t@list='$(libfst_LTLIBRARIES)'; \\\n\tlocs=`for p in $$list; do echo $$p; done | \\\n\t      sed 's|^[^/]*$$|.|; s|/[^/]*$$||; s|$$|/so_locations|' | \\\n\t      sort -u`; \\\n\ttest -z \"$$locs\" || { \\\n\t  echo rm -f $${locs}; \\\n\t  rm -f $${locs}; \\\n\t}\n\nlibfstngram.la: $(libfstngram_la_OBJECTS) $(libfstngram_la_DEPENDENCIES) $(EXTRA_libfstngram_la_DEPENDENCIES) \n\t$(AM_V_CXXLD)$(libfstngram_la_LINK) -rpath $(libdir) $(libfstngram_la_OBJECTS) $(libfstngram_la_LIBADD) $(LIBS)\n\nngram-fst.la: $(ngram_fst_la_OBJECTS) $(ngram_fst_la_DEPENDENCIES) $(EXTRA_ngram_fst_la_DEPENDENCIES) \n\t$(AM_V_CXXLD)$(ngram_fst_la_LINK) -rpath $(libfstdir) $(ngram_fst_la_OBJECTS) $(ngram_fst_la_LIBADD) $(LIBS)\n\nmostlyclean-compile:\n\t-rm -f *.$(OBJEXT)\n\ndistclean-compile:\n\t-rm -f *.tab.c\n\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/bitmap-index.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/ngram-fst.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/nthbit.Plo@am__quote@\n\n.cc.o:\n@am__fastdepCXX_TRUE@\t$(AM_V_CXX)depbase=`echo $@ | sed 's|[^/]*$$|$(DEPDIR)/&|;s|\\.o$$||'`;\\\n@am__fastdepCXX_TRUE@\t$(CXXCOMPILE) -MT $@ -MD -MP -MF $$depbase.Tpo -c -o $@ $< &&\\\n@am__fastdepCXX_TRUE@\t$(am__mv) $$depbase.Tpo $$depbase.Po\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\t$(AM_V_CXX)source='$<' object='$@' libtool=no @AMDEPBACKSLASH@\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\tDEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@\n@am__fastdepCXX_FALSE@\t$(AM_V_CXX@am__nodep@)$(CXXCOMPILE) -c -o $@ $<\n\n.cc.obj:\n@am__fastdepCXX_TRUE@\t$(AM_V_CXX)depbase=`echo $@ | sed 's|[^/]*$$|$(DEPDIR)/&|;s|\\.obj$$||'`;\\\n@am__fastdepCXX_TRUE@\t$(CXXCOMPILE) -MT $@ -MD -MP -MF $$depbase.Tpo -c -o $@ `$(CYGPATH_W) '$<'` &&\\\n@am__fastdepCXX_TRUE@\t$(am__mv) $$depbase.Tpo $$depbase.Po\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\t$(AM_V_CXX)source='$<' object='$@' libtool=no @AMDEPBACKSLASH@\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\tDEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@\n@am__fastdepCXX_FALSE@\t$(AM_V_CXX@am__nodep@)$(CXXCOMPILE) -c -o $@ `$(CYGPATH_W) '$<'`\n\n.cc.lo:\n@am__fastdepCXX_TRUE@\t$(AM_V_CXX)depbase=`echo $@ | sed 's|[^/]*$$|$(DEPDIR)/&|;s|\\.lo$$||'`;\\\n@am__fastdepCXX_TRUE@\t$(LTCXXCOMPILE) -MT $@ -MD -MP -MF $$depbase.Tpo -c -o $@ $< &&\\\n@am__fastdepCXX_TRUE@\t$(am__mv) $$depbase.Tpo $$depbase.Plo\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\t$(AM_V_CXX)source='$<' object='$@' libtool=yes @AMDEPBACKSLASH@\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\tDEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@\n@am__fastdepCXX_FALSE@\t$(AM_V_CXX@am__nodep@)$(LTCXXCOMPILE) -c -o $@ $<\n\nmostlyclean-libtool:\n\t-rm -f *.lo\n\nclean-libtool:\n\t-rm -rf .libs _libs\n\nID: $(am__tagged_files)\n\t$(am__define_uniq_tagged_files); mkid -fID $$unique\ntags: tags-am\nTAGS: tags\n\ntags-am: $(TAGS_DEPENDENCIES) $(am__tagged_files)\n\tset x; \\\n\there=`pwd`; \\\n\t$(am__define_uniq_tagged_files); \\\n\tshift; \\\n\tif test -z \"$(ETAGS_ARGS)$$*$$unique\"; then :; else \\\n\t  test -n \"$$unique\" || unique=$$empty_fix; \\\n\t  if test $$# -gt 0; then \\\n\t    $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \\\n\t      \"$$@\" $$unique; \\\n\t  else \\\n\t    $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \\\n\t      $$unique; \\\n\t  fi; \\\n\tfi\nctags: ctags-am\n\nCTAGS: ctags\nctags-am: $(TAGS_DEPENDENCIES) $(am__tagged_files)\n\t$(am__define_uniq_tagged_files); \\\n\ttest -z \"$(CTAGS_ARGS)$$unique\" \\\n\t  || $(CTAGS) $(CTAGSFLAGS) $(AM_CTAGSFLAGS) $(CTAGS_ARGS) \\\n\t     $$unique\n\nGTAGS:\n\there=`$(am__cd) $(top_builddir) && pwd` \\\n\t  && $(am__cd) $(top_srcdir) \\\n\t  && gtags -i $(GTAGS_ARGS) \"$$here\"\ncscopelist: cscopelist-am\n\ncscopelist-am: $(am__tagged_files)\n\tlist='$(am__tagged_files)'; \\\n\tcase \"$(srcdir)\" in \\\n\t  [\\\\/]* | ?:[\\\\/]*) sdir=\"$(srcdir)\" ;; \\\n\t  *) sdir=$(subdir)/$(srcdir) ;; \\\n\tesac; \\\n\tfor i in $$list; do \\\n\t  if test -f \"$$i\"; then \\\n\t    echo \"$(subdir)/$$i\"; \\\n\t  else \\\n\t    echo \"$$sdir/$$i\"; \\\n\t  fi; \\\n\tdone >> $(top_builddir)/cscope.files\n\ndistclean-tags:\n\t-rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags\n\ndistdir: $(DISTFILES)\n\t@srcdirstrip=`echo \"$(srcdir)\" | sed 's/[].[^$$\\\\*]/\\\\\\\\&/g'`; \\\n\ttopsrcdirstrip=`echo \"$(top_srcdir)\" | sed 's/[].[^$$\\\\*]/\\\\\\\\&/g'`; \\\n\tlist='$(DISTFILES)'; \\\n\t  dist_files=`for file in $$list; do echo $$file; done | \\\n\t  sed -e \"s|^$$srcdirstrip/||;t\" \\\n\t      -e \"s|^$$topsrcdirstrip/|$(top_builddir)/|;t\"`; \\\n\tcase $$dist_files in \\\n\t  */*) $(MKDIR_P) `echo \"$$dist_files\" | \\\n\t\t\t   sed '/\\//!d;s|^|$(distdir)/|;s,/[^/]*$$,,' | \\\n\t\t\t   sort -u` ;; \\\n\tesac; \\\n\tfor file in $$dist_files; do \\\n\t  if test -f $$file || test -d $$file; then d=.; else d=$(srcdir); fi; \\\n\t  if test -d $$d/$$file; then \\\n\t    dir=`echo \"/$$file\" | sed -e 's,/[^/]*$$,,'`; \\\n\t    if test -d \"$(distdir)/$$file\"; then \\\n\t      find \"$(distdir)/$$file\" -type d ! -perm -700 -exec chmod u+rwx {} \\;; \\\n\t    fi; \\\n\t    if test -d $(srcdir)/$$file && test $$d != $(srcdir); then \\\n\t      cp -fpR $(srcdir)/$$file \"$(distdir)$$dir\" || exit 1; \\\n\t      find \"$(distdir)/$$file\" -type d ! -perm -700 -exec chmod u+rwx {} \\;; \\\n\t    fi; \\\n\t    cp -fpR $$d/$$file \"$(distdir)$$dir\" || exit 1; \\\n\t  else \\\n\t    test -f \"$(distdir)/$$file\" \\\n\t    || cp -p $$d/$$file \"$(distdir)/$$file\" \\\n\t    || exit 1; \\\n\t  fi; \\\n\tdone\ncheck-am: all-am\ncheck: check-am\nall-am: Makefile $(LTLIBRARIES)\ninstalldirs:\n\tfor dir in \"$(DESTDIR)$(libdir)\" \"$(DESTDIR)$(libfstdir)\"; do \\\n\t  test -z \"$$dir\" || $(MKDIR_P) \"$$dir\"; \\\n\tdone\ninstall: install-am\ninstall-exec: install-exec-am\ninstall-data: install-data-am\nuninstall: uninstall-am\n\ninstall-am: all-am\n\t@$(MAKE) $(AM_MAKEFLAGS) install-exec-am install-data-am\n\ninstallcheck: installcheck-am\ninstall-strip:\n\tif test -z '$(STRIP)'; then \\\n\t  $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" \\\n\t    install_sh_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" INSTALL_STRIP_FLAG=-s \\\n\t      install; \\\n\telse \\\n\t  $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" \\\n\t    install_sh_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" INSTALL_STRIP_FLAG=-s \\\n\t    \"INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'\" install; \\\n\tfi\nmostlyclean-generic:\n\nclean-generic:\n\ndistclean-generic:\n\t-test -z \"$(CONFIG_CLEAN_FILES)\" || rm -f $(CONFIG_CLEAN_FILES)\n\t-test . = \"$(srcdir)\" || test -z \"$(CONFIG_CLEAN_VPATH_FILES)\" || rm -f $(CONFIG_CLEAN_VPATH_FILES)\n\nmaintainer-clean-generic:\n\t@echo \"This command is intended for maintainers to use\"\n\t@echo \"it deletes files that may require special tools to rebuild.\"\nclean: clean-am\n\nclean-am: clean-generic clean-libLTLIBRARIES clean-libfstLTLIBRARIES \\\n\tclean-libtool mostlyclean-am\n\ndistclean: distclean-am\n\t-rm -rf ./$(DEPDIR)\n\t-rm -f Makefile\ndistclean-am: clean-am distclean-compile distclean-generic \\\n\tdistclean-tags\n\ndvi: dvi-am\n\ndvi-am:\n\nhtml: html-am\n\nhtml-am:\n\ninfo: info-am\n\ninfo-am:\n\ninstall-data-am: install-libfstLTLIBRARIES\n\ninstall-dvi: install-dvi-am\n\ninstall-dvi-am:\n\ninstall-exec-am: install-libLTLIBRARIES\n\ninstall-html: install-html-am\n\ninstall-html-am:\n\ninstall-info: install-info-am\n\ninstall-info-am:\n\ninstall-man:\n\ninstall-pdf: install-pdf-am\n\ninstall-pdf-am:\n\ninstall-ps: install-ps-am\n\ninstall-ps-am:\n\ninstallcheck-am:\n\nmaintainer-clean: maintainer-clean-am\n\t-rm -rf ./$(DEPDIR)\n\t-rm -f Makefile\nmaintainer-clean-am: distclean-am maintainer-clean-generic\n\nmostlyclean: mostlyclean-am\n\nmostlyclean-am: mostlyclean-compile mostlyclean-generic \\\n\tmostlyclean-libtool\n\npdf: pdf-am\n\npdf-am:\n\nps: ps-am\n\nps-am:\n\nuninstall-am: uninstall-libLTLIBRARIES uninstall-libfstLTLIBRARIES\n\n.MAKE: install-am install-strip\n\n.PHONY: CTAGS GTAGS TAGS all all-am check check-am clean clean-generic \\\n\tclean-libLTLIBRARIES clean-libfstLTLIBRARIES clean-libtool \\\n\tcscopelist-am ctags ctags-am distclean distclean-compile \\\n\tdistclean-generic distclean-libtool distclean-tags distdir dvi \\\n\tdvi-am html html-am info info-am install install-am \\\n\tinstall-data install-data-am install-dvi install-dvi-am \\\n\tinstall-exec install-exec-am install-html install-html-am \\\n\tinstall-info install-info-am install-libLTLIBRARIES \\\n\tinstall-libfstLTLIBRARIES install-man install-pdf \\\n\tinstall-pdf-am install-ps install-ps-am install-strip \\\n\tinstallcheck installcheck-am installdirs maintainer-clean \\\n\tmaintainer-clean-generic mostlyclean mostlyclean-compile \\\n\tmostlyclean-generic mostlyclean-libtool pdf pdf-am ps ps-am \\\n\ttags tags-am uninstall uninstall-am uninstall-libLTLIBRARIES \\\n\tuninstall-libfstLTLIBRARIES\n\n.PRECIOUS: Makefile\n\n\n# Tell versions [3.59,3.63) of GNU make to not export all variables.\n# Otherwise a system limit (for SysV at least) may be exceeded.\n.NOEXPORT:\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/extensions/ngram/bitmap-index.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/extensions/ngram/bitmap-index.h>\n\n#include <algorithm>\n#include <iterator>\n\n#include <fst/log.h>\n#include <fst/extensions/ngram/nthbit.h>\n\nnamespace fst {\nnamespace {\nconst size_t kPrimaryBlockBits =\n    BitmapIndex::kStorageBitSize * BitmapIndex::kSecondaryBlockSize;\n\n// If [begin, begin+size) is a monotonically increasing running sum of\n// popcounts for a bitmap, this will return the index of the word that contains\n// the value'th zero.  If value is larger then the number of zeros in the\n// bitmap, size will be returned.  The idea is that the number of zerocounts\n// (i.e. the popcount of logical NOT of values) is offset * kStorageBitSize\n// minus the value for each element of the running sum.\ntemplate <size_t BlockSize, typename Container>\nsize_t InvertedSearch(const Container& c,\n                      size_t first_idx,\n                      size_t last_idx,\n                      size_t value) {\n  const size_t begin_idx = first_idx;\n  while (first_idx != last_idx) {\n    // Invariant: [first_idx, last_idx) is the search range.\n    size_t mid_idx = first_idx + ((last_idx - first_idx) / 2);\n    size_t mid_value = BlockSize * (1 + (mid_idx - begin_idx)) - c[mid_idx];\n    if (mid_value < value) {\n      first_idx = mid_idx + 1;\n    } else {\n      last_idx = mid_idx;\n    }\n  }\n  return first_idx;\n}\n}  // namespace\n\nsize_t BitmapIndex::Rank1(size_t end) const {\n  if (end == 0) return 0;\n  const uint32 end_word = (end - 1) >> BitmapIndex::kStorageLogBitSize;\n  const uint32 sum = get_index_ones_count(end_word);\n  const size_t masked = end & kStorageBlockMask;\n  if (masked == 0) {\n    return sum + __builtin_popcountll(bits_[end_word]);\n  } else {\n    const uint64 zero = 0;\n    return sum + __builtin_popcountll(bits_[end_word] &\n                                      (~zero >> (kStorageBitSize - masked)));\n  }\n}\n\nsize_t BitmapIndex::Select1(size_t bit_index) const {\n  if (bit_index >= GetOnesCount()) return Bits();\n  // search primary index for the relevant block\n  uint32 rembits = bit_index + 1;\n  const uint32 block = find_primary_block(bit_index + 1);\n  uint32 offset = 0;\n  if (block > 0) {\n    rembits -= primary_index_[block - 1];\n    offset += block * kSecondaryBlockSize;\n  }\n  // search the secondary index\n  uint32 word = find_secondary_block(offset, rembits);\n  if (word > 0) {\n    rembits -= secondary_index_[offset + word - 1];\n    offset += word;\n  }\n  int nth = nth_bit(bits_[offset], rembits);\n  return (offset << BitmapIndex::kStorageLogBitSize) + nth;\n}\n\nsize_t BitmapIndex::Select0(size_t bit_index) const {\n  if (bit_index >= Bits() - GetOnesCount()) return Bits();\n  // search inverted primary index for relevant block\n  uint32 remzeros = bit_index + 1;\n  uint32 offset = 0;\n  const uint32 block = find_inverted_primary_block(bit_index + 1);\n  if (block > 0) {\n    remzeros -= kPrimaryBlockBits * block - primary_index_[block - 1];\n    offset += block * kSecondaryBlockSize;\n  }\n  // search the inverted secondary index\n  uint32 word = find_inverted_secondary_block(offset, remzeros);\n  if (word > 0) {\n    remzeros -= BitmapIndex::kStorageBitSize * word -\n                secondary_index_[offset + word - 1];\n    offset += word;\n  }\n  int nth = nth_bit(~bits_[offset], remzeros);\n  return (offset << BitmapIndex::kStorageLogBitSize) + nth;\n}\n\nstd::pair<size_t, size_t> BitmapIndex::Select0s(size_t bit_index) const {\n  const uint64 zero = 0;\n  const uint64 ones = ~zero;\n  size_t zeros_count = Bits() - GetOnesCount();\n  if (bit_index >= zeros_count) return std::make_pair(Bits(), Bits());\n  if (bit_index + 1 >= zeros_count) {\n    return std::make_pair(Select0(bit_index), Bits());\n  }\n  // search inverted primary index for relevant block\n  uint32 remzeros = bit_index + 1;\n  uint32 offset = 0;\n  const uint32 block = find_inverted_primary_block(bit_index + 1);\n  size_t num_zeros_in_block =\n      kPrimaryBlockBits * (1 + block) - primary_index_[block];\n  if (block > 0) {\n    size_t num_zeros_next =\n        kPrimaryBlockBits * block - primary_index_[block - 1];\n    num_zeros_in_block -= num_zeros_next;\n    remzeros -= num_zeros_next;\n    offset += block * kSecondaryBlockSize;\n  }\n  // search the inverted secondary index\n  uint32 word = find_inverted_secondary_block(offset, remzeros);\n  uint32 sum_zeros_next_word = BitmapIndex::kStorageBitSize * (1 + word) -\n                               secondary_index_[offset + word];\n  uint32 sum_zeros_this_word = 0;\n  if (word > 0) {\n    sum_zeros_this_word = BitmapIndex::kStorageBitSize * word -\n                          secondary_index_[offset + word - 1];\n    remzeros -= sum_zeros_this_word;\n    offset += word;\n  }\n  int nth = nth_bit(~bits_[offset], remzeros);\n  size_t current_zero = (offset << BitmapIndex::kStorageLogBitSize) + nth;\n\n  size_t next_zero;\n  // Does the current block contain the next zero?\n  if (num_zeros_in_block > remzeros + 1) {\n    if (sum_zeros_next_word - sum_zeros_this_word >= remzeros + 1) {\n      // the next zero is in this word\n      next_zero = (offset << BitmapIndex::kStorageLogBitSize) +\n                  nth_bit(~bits_[offset], remzeros + 1);\n    } else {\n      // Find the first field that is not all ones by linear scan.\n      // In the worst case, this may scan 8Kbytes.  The alternative is\n      // to inspect secondary_index_ looking for a place to jump to, but\n      // that would probably use more cache.\n      while (bits_[++offset] == ones) {\n      }\n      next_zero = (offset << BitmapIndex::kStorageLogBitSize) +\n                  __builtin_ctzll(~bits_[offset]);\n    }\n  } else {\n    // the next zero is in a different block, a full search is required.\n    next_zero = Select0(bit_index + 1);\n  }\n  return std::make_pair(current_zero, next_zero);\n}\n\nsize_t BitmapIndex::get_index_ones_count(size_t array_index) const {\n  uint32 sum = 0;\n  if (array_index > 0) {\n    sum += secondary_index_[array_index - 1];\n    uint32 end_block = (array_index - 1) / kSecondaryBlockSize;\n    if (end_block > 0) sum += primary_index_[end_block - 1];\n  }\n  return sum;\n}\n\nvoid BitmapIndex::BuildIndex(const uint64 *bits, size_t size) {\n  bits_ = bits;\n  size_ = size;\n  primary_index_.resize(primary_index_size());\n  secondary_index_.resize(ArraySize());\n  const uint64 zero = 0;\n  const uint64 ones = ~zero;\n  uint32 popcount = 0;\n  for (uint32 block = 0; block * kSecondaryBlockSize < ArraySize(); block++) {\n    uint32 block_popcount = 0;\n    uint32 block_begin = block * kSecondaryBlockSize;\n    uint32 block_end = block_begin + kSecondaryBlockSize;\n    if (block_end > ArraySize()) block_end = ArraySize();\n    for (uint32 j = block_begin; j < block_end; ++j) {\n      uint64 mask = ones;\n      if (j == ArraySize() - 1) {\n        mask = ones >> (-size_ & BitmapIndex::kStorageBlockMask);\n      }\n      block_popcount += __builtin_popcountll(bits_[j] & mask);\n      secondary_index_[j] = block_popcount;\n    }\n    popcount += block_popcount;\n    primary_index_[block] = popcount;\n  }\n}\n\nsize_t BitmapIndex::find_secondary_block(size_t block_begin,\n                                         size_t rem_bit_index) const {\n  size_t block_end = block_begin + kSecondaryBlockSize;\n  if (block_end > ArraySize()) block_end = ArraySize();\n  return std::distance(\n      secondary_index_.begin() + block_begin,\n      std::lower_bound(secondary_index_.begin() + block_begin,\n                       secondary_index_.begin() + block_end, rem_bit_index));\n}\n\nsize_t BitmapIndex::find_inverted_secondary_block(size_t block_begin,\n                                                  size_t rem_bit_index) const {\n  size_t block_end = block_begin + kSecondaryBlockSize;\n  if (block_end > ArraySize()) block_end = ArraySize();\n  return InvertedSearch<BitmapIndex::kStorageBitSize>(secondary_index_,\n                                                      block_begin, block_end,\n                                                      rem_bit_index)\n      - block_begin;\n}\n\ninline size_t BitmapIndex::find_primary_block(size_t bit_index) const {\n  return std::distance(\n      primary_index_.begin(),\n      std::lower_bound(primary_index_.begin(),\n                       primary_index_.begin() + primary_index_size(),\n                       bit_index));\n}\n\nsize_t BitmapIndex::find_inverted_primary_block(size_t bit_index) const {\n  return InvertedSearch<kPrimaryBlockBits>(\n      primary_index_, 0, primary_index_.size(), bit_index);\n}\n}  // end namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/extensions/ngram/ngram-fst.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/extensions/ngram/ngram-fst.h>\n\n#include <sys/types.h>\n\n#include <fst/arc.h>\n#include <fst/register.h>\n\nusing fst::NGramFst;\nusing fst::StdArc;\nusing fst::LogArc;\n\nREGISTER_FST(NGramFst, StdArc);\nREGISTER_FST(NGramFst, LogArc);\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/extensions/ngram/nthbit.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/extensions/ngram/nthbit.h>\n\n// This table is generated using:\n//\n//  unsigned int nth_bit_scan(uint64 v, unsigned int r) {\n//    int i=0;\n//    for (; i<64; i++) {\n//      if ((r -= v & 1) == 0) return i;\n//      v >>= 1;\n//    }\n//    return i;\n//  }\n//\n//  for (size_t i = 0; i < 256; ++i) {\n//    uint32 offsets = 0;\n//    for (size_t b = 1; b <= 8; ++b) {\n//      uint32 offset = min<uint32>(nth_bit_scan(i, b), 8);\n//      offsets |= (offset << ((b - 1) << 2));\n//    }\n//    bit_offset = offsets;\n//    printf(\"0x%x, \", bit_offset);\n//    if (i % 4 == 3) printf(\"\\n\");\n//  }\n//\nuint32 nth_bit_bit_offset[] = {\n    0x88888888, 0x88888880, 0x88888881, 0x88888810, 0x88888882, 0x88888820,\n    0x88888821, 0x88888210, 0x88888883, 0x88888830, 0x88888831, 0x88888310,\n    0x88888832, 0x88888320, 0x88888321, 0x88883210, 0x88888884, 0x88888840,\n    0x88888841, 0x88888410, 0x88888842, 0x88888420, 0x88888421, 0x88884210,\n    0x88888843, 0x88888430, 0x88888431, 0x88884310, 0x88888432, 0x88884320,\n    0x88884321, 0x88843210, 0x88888885, 0x88888850, 0x88888851, 0x88888510,\n    0x88888852, 0x88888520, 0x88888521, 0x88885210, 0x88888853, 0x88888530,\n    0x88888531, 0x88885310, 0x88888532, 0x88885320, 0x88885321, 0x88853210,\n    0x88888854, 0x88888540, 0x88888541, 0x88885410, 0x88888542, 0x88885420,\n    0x88885421, 0x88854210, 0x88888543, 0x88885430, 0x88885431, 0x88854310,\n    0x88885432, 0x88854320, 0x88854321, 0x88543210, 0x88888886, 0x88888860,\n    0x88888861, 0x88888610, 0x88888862, 0x88888620, 0x88888621, 0x88886210,\n    0x88888863, 0x88888630, 0x88888631, 0x88886310, 0x88888632, 0x88886320,\n    0x88886321, 0x88863210, 0x88888864, 0x88888640, 0x88888641, 0x88886410,\n    0x88888642, 0x88886420, 0x88886421, 0x88864210, 0x88888643, 0x88886430,\n    0x88886431, 0x88864310, 0x88886432, 0x88864320, 0x88864321, 0x88643210,\n    0x88888865, 0x88888650, 0x88888651, 0x88886510, 0x88888652, 0x88886520,\n    0x88886521, 0x88865210, 0x88888653, 0x88886530, 0x88886531, 0x88865310,\n    0x88886532, 0x88865320, 0x88865321, 0x88653210, 0x88888654, 0x88886540,\n    0x88886541, 0x88865410, 0x88886542, 0x88865420, 0x88865421, 0x88654210,\n    0x88886543, 0x88865430, 0x88865431, 0x88654310, 0x88865432, 0x88654320,\n    0x88654321, 0x86543210, 0x88888887, 0x88888870, 0x88888871, 0x88888710,\n    0x88888872, 0x88888720, 0x88888721, 0x88887210, 0x88888873, 0x88888730,\n    0x88888731, 0x88887310, 0x88888732, 0x88887320, 0x88887321, 0x88873210,\n    0x88888874, 0x88888740, 0x88888741, 0x88887410, 0x88888742, 0x88887420,\n    0x88887421, 0x88874210, 0x88888743, 0x88887430, 0x88887431, 0x88874310,\n    0x88887432, 0x88874320, 0x88874321, 0x88743210, 0x88888875, 0x88888750,\n    0x88888751, 0x88887510, 0x88888752, 0x88887520, 0x88887521, 0x88875210,\n    0x88888753, 0x88887530, 0x88887531, 0x88875310, 0x88887532, 0x88875320,\n    0x88875321, 0x88753210, 0x88888754, 0x88887540, 0x88887541, 0x88875410,\n    0x88887542, 0x88875420, 0x88875421, 0x88754210, 0x88887543, 0x88875430,\n    0x88875431, 0x88754310, 0x88875432, 0x88754320, 0x88754321, 0x87543210,\n    0x88888876, 0x88888760, 0x88888761, 0x88887610, 0x88888762, 0x88887620,\n    0x88887621, 0x88876210, 0x88888763, 0x88887630, 0x88887631, 0x88876310,\n    0x88887632, 0x88876320, 0x88876321, 0x88763210, 0x88888764, 0x88887640,\n    0x88887641, 0x88876410, 0x88887642, 0x88876420, 0x88876421, 0x88764210,\n    0x88887643, 0x88876430, 0x88876431, 0x88764310, 0x88876432, 0x88764320,\n    0x88764321, 0x87643210, 0x88888765, 0x88887650, 0x88887651, 0x88876510,\n    0x88887652, 0x88876520, 0x88876521, 0x88765210, 0x88887653, 0x88876530,\n    0x88876531, 0x88765310, 0x88876532, 0x88765320, 0x88765321, 0x87653210,\n    0x88887654, 0x88876540, 0x88876541, 0x88765410, 0x88876542, 0x88765420,\n    0x88765421, 0x87654210, 0x88876543, 0x88765430, 0x88765431, 0x87654310,\n    0x88765432, 0x87654320, 0x87654321, 0x76543210,\n};\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/extensions/pdt/CMakeLists.txt",
    "content": "file(GLOB HEADER_FILES ../../include/fst/extensions/pdt/*.h)\nmessage(STATUS \"${HEADER_FILES}\")\n\nif(HAVE_SCRIPT)\n  add_library(fstpdtscript getters.cc pdtscript.cc ${HEADER_FILES})\n  target_link_libraries(fstpdtscript fstscript fst)\n  set_target_properties(fstpdtscript PROPERTIES \n    SOVERSION \"${SOVERSION}\"\n    FOLDER pdt\n  )\n\n  install(TARGETS fstpdtscript\n\tLIBRARY DESTINATION lib\n\tARCHIVE DESTINATION lib\n\tRUNTIME DESTINATION lib\n  )\nendif(HAVE_SCRIPT)\n\nif(HAVE_BIN)\n  function (add_executable2 _name)\n      add_executable(${ARGV})\n      if (TARGET ${_name})\n          target_link_libraries(${_name} fstpdtscript fstscript fst ${CMAKE_DL_LIBS})\n          set_target_properties(${_name} PROPERTIES\n            FOLDER pdt/bin\n          )\n      endif()\n      install(TARGETS ${_name} RUNTIME DESTINATION bin)\n  endfunction()\n\n  add_executable2(pdtcompose  pdtcompose.cc)\n  add_executable2(pdtexpand  pdtexpand.cc)\n  add_executable2(pdtinfo  pdtinfo.cc)\n  add_executable2(pdtreplace  pdtreplace.cc)\n  add_executable2(pdtreverse  pdtreverse.cc)\n  add_executable2(pdtshortestpath  pdtshortestpath.cc)\nendif(HAVE_BIN)\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/extensions/pdt/Makefile.am",
    "content": "AM_CPPFLAGS = -I$(srcdir)/../../include $(ICU_CPPFLAGS)\n\nif HAVE_BIN\nbin_PROGRAMS = pdtcompose pdtexpand pdtinfo pdtreplace pdtreverse \\\n               pdtshortestpath\n\nLDADD = libfstpdtscript.la \\\n        ../../script/libfstscript.la \\\n        ../../lib/libfst.la -lm $(DL_LIBS)\n\npdtcompose_SOURCES = pdtcompose.cc\n\npdtexpand_SOURCES = pdtexpand.cc\n\npdtinfo_SOURCES = pdtinfo.cc\n\npdtreplace_SOURCES = pdtreplace.cc\n\npdtreverse_SOURCES = pdtreverse.cc\n\npdtshortestpath_SOURCES = pdtshortestpath.cc\nendif\n\nif HAVE_SCRIPT\nlib_LTLIBRARIES = libfstpdtscript.la\nlibfstpdtscript_la_SOURCES = getters.cc pdtscript.cc\nlibfstpdtscript_la_LDFLAGS = -version-info 13:0:0\nlibfstpdtscript_la_LIBADD = ../../script/libfstscript.la \\\n                            ../../lib/libfst.la -lm $(DL_LIBS)\nendif\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/extensions/pdt/Makefile.in",
    "content": "# Makefile.in generated by automake 1.15.1 from Makefile.am.\n# @configure_input@\n\n# Copyright (C) 1994-2017 Free Software Foundation, Inc.\n\n# This Makefile.in is free software; the Free Software Foundation\n# gives unlimited permission to copy and/or distribute it,\n# with or without modifications, as long as this notice is preserved.\n\n# This program is distributed in the hope that it will be useful,\n# but WITHOUT ANY WARRANTY, to the extent permitted by law; without\n# even the implied warranty of MERCHANTABILITY or FITNESS FOR A\n# PARTICULAR PURPOSE.\n\n@SET_MAKE@\n\n\nVPATH = @srcdir@\nam__is_gnu_make = { \\\n  if test -z '$(MAKELEVEL)'; then \\\n    false; \\\n  elif test -n '$(MAKE_HOST)'; then \\\n    true; \\\n  elif test -n '$(MAKE_VERSION)' && test -n '$(CURDIR)'; then \\\n    true; \\\n  else \\\n    false; \\\n  fi; \\\n}\nam__make_running_with_option = \\\n  case $${target_option-} in \\\n      ?) ;; \\\n      *) echo \"am__make_running_with_option: internal error: invalid\" \\\n              \"target option '$${target_option-}' specified\" >&2; \\\n         exit 1;; \\\n  esac; \\\n  has_opt=no; \\\n  sane_makeflags=$$MAKEFLAGS; \\\n  if $(am__is_gnu_make); then \\\n    sane_makeflags=$$MFLAGS; \\\n  else \\\n    case $$MAKEFLAGS in \\\n      *\\\\[\\ \\\t]*) \\\n        bs=\\\\; \\\n        sane_makeflags=`printf '%s\\n' \"$$MAKEFLAGS\" \\\n          | sed \"s/$$bs$$bs[$$bs $$bs\t]*//g\"`;; \\\n    esac; \\\n  fi; \\\n  skip_next=no; \\\n  strip_trailopt () \\\n  { \\\n    flg=`printf '%s\\n' \"$$flg\" | sed \"s/$$1.*$$//\"`; \\\n  }; \\\n  for flg in $$sane_makeflags; do \\\n    test $$skip_next = yes && { skip_next=no; continue; }; \\\n    case $$flg in \\\n      *=*|--*) continue;; \\\n        -*I) strip_trailopt 'I'; skip_next=yes;; \\\n      -*I?*) strip_trailopt 'I';; \\\n        -*O) strip_trailopt 'O'; skip_next=yes;; \\\n      -*O?*) strip_trailopt 'O';; \\\n        -*l) strip_trailopt 'l'; skip_next=yes;; \\\n      -*l?*) strip_trailopt 'l';; \\\n      -[dEDm]) skip_next=yes;; \\\n      -[JT]) skip_next=yes;; \\\n    esac; \\\n    case $$flg in \\\n      *$$target_option*) has_opt=yes; break;; \\\n    esac; \\\n  done; \\\n  test $$has_opt = yes\nam__make_dryrun = (target_option=n; $(am__make_running_with_option))\nam__make_keepgoing = (target_option=k; $(am__make_running_with_option))\npkgdatadir = $(datadir)/@PACKAGE@\npkgincludedir = $(includedir)/@PACKAGE@\npkglibdir = $(libdir)/@PACKAGE@\npkglibexecdir = $(libexecdir)/@PACKAGE@\nam__cd = CDPATH=\"$${ZSH_VERSION+.}$(PATH_SEPARATOR)\" && cd\ninstall_sh_DATA = $(install_sh) -c -m 644\ninstall_sh_PROGRAM = $(install_sh) -c\ninstall_sh_SCRIPT = $(install_sh) -c\nINSTALL_HEADER = $(INSTALL_DATA)\ntransform = $(program_transform_name)\nNORMAL_INSTALL = :\nPRE_INSTALL = :\nPOST_INSTALL = :\nNORMAL_UNINSTALL = :\nPRE_UNINSTALL = :\nPOST_UNINSTALL = :\nbuild_triplet = @build@\nhost_triplet = @host@\n@HAVE_BIN_TRUE@bin_PROGRAMS = pdtcompose$(EXEEXT) pdtexpand$(EXEEXT) \\\n@HAVE_BIN_TRUE@\tpdtinfo$(EXEEXT) pdtreplace$(EXEEXT) \\\n@HAVE_BIN_TRUE@\tpdtreverse$(EXEEXT) pdtshortestpath$(EXEEXT)\nsubdir = src/extensions/pdt\nACLOCAL_M4 = $(top_srcdir)/aclocal.m4\nam__aclocal_m4_deps = $(top_srcdir)/m4/ac_python_devel.m4 \\\n\t$(top_srcdir)/m4/libtool.m4 $(top_srcdir)/m4/ltoptions.m4 \\\n\t$(top_srcdir)/m4/ltsugar.m4 $(top_srcdir)/m4/ltversion.m4 \\\n\t$(top_srcdir)/m4/lt~obsolete.m4 $(top_srcdir)/configure.ac\nam__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \\\n\t$(ACLOCAL_M4)\nDIST_COMMON = $(srcdir)/Makefile.am $(am__DIST_COMMON)\nmkinstalldirs = $(install_sh) -d\nCONFIG_HEADER = $(top_builddir)/config.h \\\n\t$(top_builddir)/src/include/fst/config.h\nCONFIG_CLEAN_FILES =\nCONFIG_CLEAN_VPATH_FILES =\nam__vpath_adj_setup = srcdirstrip=`echo \"$(srcdir)\" | sed 's|.|.|g'`;\nam__vpath_adj = case $$p in \\\n    $(srcdir)/*) f=`echo \"$$p\" | sed \"s|^$$srcdirstrip/||\"`;; \\\n    *) f=$$p;; \\\n  esac;\nam__strip_dir = f=`echo $$p | sed -e 's|^.*/||'`;\nam__install_max = 40\nam__nobase_strip_setup = \\\n  srcdirstrip=`echo \"$(srcdir)\" | sed 's/[].[^$$\\\\*|]/\\\\\\\\&/g'`\nam__nobase_strip = \\\n  for p in $$list; do echo \"$$p\"; done | sed -e \"s|$$srcdirstrip/||\"\nam__nobase_list = $(am__nobase_strip_setup); \\\n  for p in $$list; do echo \"$$p $$p\"; done | \\\n  sed \"s| $$srcdirstrip/| |;\"' / .*\\//!s/ .*/ ./; s,\\( .*\\)/[^/]*$$,\\1,' | \\\n  $(AWK) 'BEGIN { files[\".\"] = \"\" } { files[$$2] = files[$$2] \" \" $$1; \\\n    if (++n[$$2] == $(am__install_max)) \\\n      { print $$2, files[$$2]; n[$$2] = 0; files[$$2] = \"\" } } \\\n    END { for (dir in files) print dir, files[dir] }'\nam__base_list = \\\n  sed '$$!N;$$!N;$$!N;$$!N;$$!N;$$!N;$$!N;s/\\n/ /g' | \\\n  sed '$$!N;$$!N;$$!N;$$!N;s/\\n/ /g'\nam__uninstall_files_from_dir = { \\\n  test -z \"$$files\" \\\n    || { test ! -d \"$$dir\" && test ! -f \"$$dir\" && test ! -r \"$$dir\"; } \\\n    || { echo \" ( cd '$$dir' && rm -f\" $$files \")\"; \\\n         $(am__cd) \"$$dir\" && rm -f $$files; }; \\\n  }\nam__installdirs = \"$(DESTDIR)$(libdir)\" \"$(DESTDIR)$(bindir)\"\nLTLIBRARIES = $(lib_LTLIBRARIES)\nam__DEPENDENCIES_1 =\n@HAVE_SCRIPT_TRUE@libfstpdtscript_la_DEPENDENCIES =  \\\n@HAVE_SCRIPT_TRUE@\t../../script/libfstscript.la \\\n@HAVE_SCRIPT_TRUE@\t../../lib/libfst.la $(am__DEPENDENCIES_1)\nam__libfstpdtscript_la_SOURCES_DIST = getters.cc pdtscript.cc\n@HAVE_SCRIPT_TRUE@am_libfstpdtscript_la_OBJECTS = getters.lo \\\n@HAVE_SCRIPT_TRUE@\tpdtscript.lo\nlibfstpdtscript_la_OBJECTS = $(am_libfstpdtscript_la_OBJECTS)\nAM_V_lt = $(am__v_lt_@AM_V@)\nam__v_lt_ = $(am__v_lt_@AM_DEFAULT_V@)\nam__v_lt_0 = --silent\nam__v_lt_1 = \nlibfstpdtscript_la_LINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX \\\n\t$(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=link $(CXXLD) \\\n\t$(AM_CXXFLAGS) $(CXXFLAGS) $(libfstpdtscript_la_LDFLAGS) \\\n\t$(LDFLAGS) -o $@\n@HAVE_SCRIPT_TRUE@am_libfstpdtscript_la_rpath = -rpath $(libdir)\nPROGRAMS = $(bin_PROGRAMS)\nam__pdtcompose_SOURCES_DIST = pdtcompose.cc\n@HAVE_BIN_TRUE@am_pdtcompose_OBJECTS = pdtcompose.$(OBJEXT)\npdtcompose_OBJECTS = $(am_pdtcompose_OBJECTS)\npdtcompose_LDADD = $(LDADD)\n@HAVE_BIN_TRUE@pdtcompose_DEPENDENCIES = libfstpdtscript.la \\\n@HAVE_BIN_TRUE@\t../../script/libfstscript.la \\\n@HAVE_BIN_TRUE@\t../../lib/libfst.la $(am__DEPENDENCIES_1)\nam__pdtexpand_SOURCES_DIST = pdtexpand.cc\n@HAVE_BIN_TRUE@am_pdtexpand_OBJECTS = pdtexpand.$(OBJEXT)\npdtexpand_OBJECTS = $(am_pdtexpand_OBJECTS)\npdtexpand_LDADD = $(LDADD)\n@HAVE_BIN_TRUE@pdtexpand_DEPENDENCIES = libfstpdtscript.la \\\n@HAVE_BIN_TRUE@\t../../script/libfstscript.la \\\n@HAVE_BIN_TRUE@\t../../lib/libfst.la $(am__DEPENDENCIES_1)\nam__pdtinfo_SOURCES_DIST = pdtinfo.cc\n@HAVE_BIN_TRUE@am_pdtinfo_OBJECTS = pdtinfo.$(OBJEXT)\npdtinfo_OBJECTS = $(am_pdtinfo_OBJECTS)\npdtinfo_LDADD = $(LDADD)\n@HAVE_BIN_TRUE@pdtinfo_DEPENDENCIES = libfstpdtscript.la \\\n@HAVE_BIN_TRUE@\t../../script/libfstscript.la \\\n@HAVE_BIN_TRUE@\t../../lib/libfst.la $(am__DEPENDENCIES_1)\nam__pdtreplace_SOURCES_DIST = pdtreplace.cc\n@HAVE_BIN_TRUE@am_pdtreplace_OBJECTS = pdtreplace.$(OBJEXT)\npdtreplace_OBJECTS = $(am_pdtreplace_OBJECTS)\npdtreplace_LDADD = $(LDADD)\n@HAVE_BIN_TRUE@pdtreplace_DEPENDENCIES = libfstpdtscript.la \\\n@HAVE_BIN_TRUE@\t../../script/libfstscript.la \\\n@HAVE_BIN_TRUE@\t../../lib/libfst.la $(am__DEPENDENCIES_1)\nam__pdtreverse_SOURCES_DIST = pdtreverse.cc\n@HAVE_BIN_TRUE@am_pdtreverse_OBJECTS = pdtreverse.$(OBJEXT)\npdtreverse_OBJECTS = $(am_pdtreverse_OBJECTS)\npdtreverse_LDADD = $(LDADD)\n@HAVE_BIN_TRUE@pdtreverse_DEPENDENCIES = libfstpdtscript.la \\\n@HAVE_BIN_TRUE@\t../../script/libfstscript.la \\\n@HAVE_BIN_TRUE@\t../../lib/libfst.la $(am__DEPENDENCIES_1)\nam__pdtshortestpath_SOURCES_DIST = pdtshortestpath.cc\n@HAVE_BIN_TRUE@am_pdtshortestpath_OBJECTS = pdtshortestpath.$(OBJEXT)\npdtshortestpath_OBJECTS = $(am_pdtshortestpath_OBJECTS)\npdtshortestpath_LDADD = $(LDADD)\n@HAVE_BIN_TRUE@pdtshortestpath_DEPENDENCIES = libfstpdtscript.la \\\n@HAVE_BIN_TRUE@\t../../script/libfstscript.la \\\n@HAVE_BIN_TRUE@\t../../lib/libfst.la $(am__DEPENDENCIES_1)\nAM_V_P = $(am__v_P_@AM_V@)\nam__v_P_ = $(am__v_P_@AM_DEFAULT_V@)\nam__v_P_0 = false\nam__v_P_1 = :\nAM_V_GEN = $(am__v_GEN_@AM_V@)\nam__v_GEN_ = $(am__v_GEN_@AM_DEFAULT_V@)\nam__v_GEN_0 = @echo \"  GEN     \" $@;\nam__v_GEN_1 = \nAM_V_at = $(am__v_at_@AM_V@)\nam__v_at_ = $(am__v_at_@AM_DEFAULT_V@)\nam__v_at_0 = @\nam__v_at_1 = \nDEFAULT_INCLUDES = \ndepcomp = $(SHELL) $(top_srcdir)/depcomp\nam__depfiles_maybe = depfiles\nam__mv = mv -f\nCXXCOMPILE = $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) \\\n\t$(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS)\nLTCXXCOMPILE = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \\\n\t$(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) \\\n\t$(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) \\\n\t$(AM_CXXFLAGS) $(CXXFLAGS)\nAM_V_CXX = $(am__v_CXX_@AM_V@)\nam__v_CXX_ = $(am__v_CXX_@AM_DEFAULT_V@)\nam__v_CXX_0 = @echo \"  CXX     \" $@;\nam__v_CXX_1 = \nCXXLD = $(CXX)\nCXXLINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \\\n\t$(LIBTOOLFLAGS) --mode=link $(CXXLD) $(AM_CXXFLAGS) \\\n\t$(CXXFLAGS) $(AM_LDFLAGS) $(LDFLAGS) -o $@\nAM_V_CXXLD = $(am__v_CXXLD_@AM_V@)\nam__v_CXXLD_ = $(am__v_CXXLD_@AM_DEFAULT_V@)\nam__v_CXXLD_0 = @echo \"  CXXLD   \" $@;\nam__v_CXXLD_1 = \nSOURCES = $(libfstpdtscript_la_SOURCES) $(pdtcompose_SOURCES) \\\n\t$(pdtexpand_SOURCES) $(pdtinfo_SOURCES) $(pdtreplace_SOURCES) \\\n\t$(pdtreverse_SOURCES) $(pdtshortestpath_SOURCES)\nDIST_SOURCES = $(am__libfstpdtscript_la_SOURCES_DIST) \\\n\t$(am__pdtcompose_SOURCES_DIST) $(am__pdtexpand_SOURCES_DIST) \\\n\t$(am__pdtinfo_SOURCES_DIST) $(am__pdtreplace_SOURCES_DIST) \\\n\t$(am__pdtreverse_SOURCES_DIST) \\\n\t$(am__pdtshortestpath_SOURCES_DIST)\nam__can_run_installinfo = \\\n  case $$AM_UPDATE_INFO_DIR in \\\n    n|no|NO) false;; \\\n    *) (install-info --version) >/dev/null 2>&1;; \\\n  esac\nam__tagged_files = $(HEADERS) $(SOURCES) $(TAGS_FILES) $(LISP)\n# Read a list of newline-separated strings from the standard input,\n# and print each of them once, without duplicates.  Input order is\n# *not* preserved.\nam__uniquify_input = $(AWK) '\\\n  BEGIN { nonempty = 0; } \\\n  { items[$$0] = 1; nonempty = 1; } \\\n  END { if (nonempty) { for (i in items) print i; }; } \\\n'\n# Make sure the list of sources is unique.  This is necessary because,\n# e.g., the same source file might be shared among _SOURCES variables\n# for different programs/libraries.\nam__define_uniq_tagged_files = \\\n  list='$(am__tagged_files)'; \\\n  unique=`for i in $$list; do \\\n    if test -f \"$$i\"; then echo $$i; else echo $(srcdir)/$$i; fi; \\\n  done | $(am__uniquify_input)`\nETAGS = etags\nCTAGS = ctags\nam__DIST_COMMON = $(srcdir)/Makefile.in $(top_srcdir)/depcomp\nDISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST)\nACLOCAL = @ACLOCAL@\nAMTAR = @AMTAR@\nAM_DEFAULT_VERBOSITY = @AM_DEFAULT_VERBOSITY@\nAR = @AR@\nAUTOCONF = @AUTOCONF@\nAUTOHEADER = @AUTOHEADER@\nAUTOMAKE = @AUTOMAKE@\nAWK = @AWK@\nCC = @CC@\nCCDEPMODE = @CCDEPMODE@\nCFLAGS = @CFLAGS@\nCPP = @CPP@\nCPPFLAGS = @CPPFLAGS@\nCXX = @CXX@\nCXXCPP = @CXXCPP@\nCXXDEPMODE = @CXXDEPMODE@\nCXXFLAGS = @CXXFLAGS@\nCYGPATH_W = @CYGPATH_W@\nDEFS = @DEFS@\nDEPDIR = @DEPDIR@\nDLLTOOL = @DLLTOOL@\nDL_LIBS = @DL_LIBS@\nDSYMUTIL = @DSYMUTIL@\nDUMPBIN = @DUMPBIN@\nECHO_C = @ECHO_C@\nECHO_N = @ECHO_N@\nECHO_T = @ECHO_T@\nEGREP = @EGREP@\nEXEEXT = @EXEEXT@\nFGREP = @FGREP@\nGREP = @GREP@\nINSTALL = @INSTALL@\nINSTALL_DATA = @INSTALL_DATA@\nINSTALL_PROGRAM = @INSTALL_PROGRAM@\nINSTALL_SCRIPT = @INSTALL_SCRIPT@\nINSTALL_STRIP_PROGRAM = @INSTALL_STRIP_PROGRAM@\nLD = @LD@\nLDFLAGS = @LDFLAGS@\nLIBOBJS = @LIBOBJS@\nLIBS = @LIBS@\nLIBTOOL = @LIBTOOL@\nLIPO = @LIPO@\nLN_S = @LN_S@\nLTLIBOBJS = @LTLIBOBJS@\nLT_SYS_LIBRARY_PATH = @LT_SYS_LIBRARY_PATH@\nMAKEINFO = @MAKEINFO@\nMANIFEST_TOOL = @MANIFEST_TOOL@\nMKDIR_P = @MKDIR_P@\nNM = @NM@\nNMEDIT = @NMEDIT@\nOBJDUMP = @OBJDUMP@\nOBJEXT = @OBJEXT@\nOTOOL = @OTOOL@\nOTOOL64 = @OTOOL64@\nPACKAGE = @PACKAGE@\nPACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@\nPACKAGE_NAME = @PACKAGE_NAME@\nPACKAGE_STRING = @PACKAGE_STRING@\nPACKAGE_TARNAME = @PACKAGE_TARNAME@\nPACKAGE_URL = @PACKAGE_URL@\nPACKAGE_VERSION = @PACKAGE_VERSION@\nPATH_SEPARATOR = @PATH_SEPARATOR@\nPYTHON = @PYTHON@\nPYTHON_CPPFLAGS = @PYTHON_CPPFLAGS@\nPYTHON_EXEC_PREFIX = @PYTHON_EXEC_PREFIX@\nPYTHON_EXTRA_LDFLAGS = @PYTHON_EXTRA_LDFLAGS@\nPYTHON_EXTRA_LIBS = @PYTHON_EXTRA_LIBS@\nPYTHON_LDFLAGS = @PYTHON_LDFLAGS@\nPYTHON_PLATFORM = @PYTHON_PLATFORM@\nPYTHON_PREFIX = @PYTHON_PREFIX@\nPYTHON_SITE_PKG = @PYTHON_SITE_PKG@\nPYTHON_VERSION = @PYTHON_VERSION@\nRANLIB = @RANLIB@\nSED = @SED@\nSET_MAKE = @SET_MAKE@\nSHELL = @SHELL@\nSTRIP = @STRIP@\nVERSION = @VERSION@\nabs_builddir = @abs_builddir@\nabs_srcdir = @abs_srcdir@\nabs_top_builddir = @abs_top_builddir@\nabs_top_srcdir = @abs_top_srcdir@\nac_ct_AR = @ac_ct_AR@\nac_ct_CC = @ac_ct_CC@\nac_ct_CXX = @ac_ct_CXX@\nac_ct_DUMPBIN = @ac_ct_DUMPBIN@\nam__include = @am__include@\nam__leading_dot = @am__leading_dot@\nam__quote = @am__quote@\nam__tar = @am__tar@\nam__untar = @am__untar@\nbindir = @bindir@\nbuild = @build@\nbuild_alias = @build_alias@\nbuild_cpu = @build_cpu@\nbuild_os = @build_os@\nbuild_vendor = @build_vendor@\nbuilddir = @builddir@\ndatadir = @datadir@\ndatarootdir = @datarootdir@\ndocdir = @docdir@\ndvidir = @dvidir@\nexec_prefix = @exec_prefix@\nhost = @host@\nhost_alias = @host_alias@\nhost_cpu = @host_cpu@\nhost_os = @host_os@\nhost_vendor = @host_vendor@\nhtmldir = @htmldir@\nincludedir = @includedir@\ninfodir = @infodir@\ninstall_sh = @install_sh@\nlibdir = @libdir@\nlibexecdir = @libexecdir@\nlibfstdir = @libfstdir@\nlocaledir = @localedir@\nlocalstatedir = @localstatedir@\nmandir = @mandir@\nmkdir_p = @mkdir_p@\noldincludedir = @oldincludedir@\npdfdir = @pdfdir@\npkgpyexecdir = @pkgpyexecdir@\npkgpythondir = @pkgpythondir@\nprefix = @prefix@\nprogram_transform_name = @program_transform_name@\npsdir = @psdir@\npyexecdir = @pyexecdir@\npythondir = @pythondir@\nrunstatedir = @runstatedir@\nsbindir = @sbindir@\nsharedstatedir = @sharedstatedir@\nsrcdir = @srcdir@\nsysconfdir = @sysconfdir@\ntarget_alias = @target_alias@\ntop_build_prefix = @top_build_prefix@\ntop_builddir = @top_builddir@\ntop_srcdir = @top_srcdir@\nAM_CPPFLAGS = -I$(srcdir)/../../include $(ICU_CPPFLAGS)\n@HAVE_BIN_TRUE@LDADD = libfstpdtscript.la \\\n@HAVE_BIN_TRUE@        ../../script/libfstscript.la \\\n@HAVE_BIN_TRUE@        ../../lib/libfst.la -lm $(DL_LIBS)\n\n@HAVE_BIN_TRUE@pdtcompose_SOURCES = pdtcompose.cc\n@HAVE_BIN_TRUE@pdtexpand_SOURCES = pdtexpand.cc\n@HAVE_BIN_TRUE@pdtinfo_SOURCES = pdtinfo.cc\n@HAVE_BIN_TRUE@pdtreplace_SOURCES = pdtreplace.cc\n@HAVE_BIN_TRUE@pdtreverse_SOURCES = pdtreverse.cc\n@HAVE_BIN_TRUE@pdtshortestpath_SOURCES = pdtshortestpath.cc\n@HAVE_SCRIPT_TRUE@lib_LTLIBRARIES = libfstpdtscript.la\n@HAVE_SCRIPT_TRUE@libfstpdtscript_la_SOURCES = getters.cc pdtscript.cc\n@HAVE_SCRIPT_TRUE@libfstpdtscript_la_LDFLAGS = -version-info 13:0:0\n@HAVE_SCRIPT_TRUE@libfstpdtscript_la_LIBADD = ../../script/libfstscript.la \\\n@HAVE_SCRIPT_TRUE@                            ../../lib/libfst.la -lm $(DL_LIBS)\n\nall: all-am\n\n.SUFFIXES:\n.SUFFIXES: .cc .lo .o .obj\n$(srcdir)/Makefile.in:  $(srcdir)/Makefile.am  $(am__configure_deps)\n\t@for dep in $?; do \\\n\t  case '$(am__configure_deps)' in \\\n\t    *$$dep*) \\\n\t      ( cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh ) \\\n\t        && { if test -f $@; then exit 0; else break; fi; }; \\\n\t      exit 1;; \\\n\t  esac; \\\n\tdone; \\\n\techo ' cd $(top_srcdir) && $(AUTOMAKE) --foreign src/extensions/pdt/Makefile'; \\\n\t$(am__cd) $(top_srcdir) && \\\n\t  $(AUTOMAKE) --foreign src/extensions/pdt/Makefile\nMakefile: $(srcdir)/Makefile.in $(top_builddir)/config.status\n\t@case '$?' in \\\n\t  *config.status*) \\\n\t    cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh;; \\\n\t  *) \\\n\t    echo ' cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe)'; \\\n\t    cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe);; \\\n\tesac;\n\n$(top_builddir)/config.status: $(top_srcdir)/configure $(CONFIG_STATUS_DEPENDENCIES)\n\tcd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh\n\n$(top_srcdir)/configure:  $(am__configure_deps)\n\tcd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh\n$(ACLOCAL_M4):  $(am__aclocal_m4_deps)\n\tcd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh\n$(am__aclocal_m4_deps):\n\ninstall-libLTLIBRARIES: $(lib_LTLIBRARIES)\n\t@$(NORMAL_INSTALL)\n\t@list='$(lib_LTLIBRARIES)'; test -n \"$(libdir)\" || list=; \\\n\tlist2=; for p in $$list; do \\\n\t  if test -f $$p; then \\\n\t    list2=\"$$list2 $$p\"; \\\n\t  else :; fi; \\\n\tdone; \\\n\ttest -z \"$$list2\" || { \\\n\t  echo \" $(MKDIR_P) '$(DESTDIR)$(libdir)'\"; \\\n\t  $(MKDIR_P) \"$(DESTDIR)$(libdir)\" || exit 1; \\\n\t  echo \" $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) $$list2 '$(DESTDIR)$(libdir)'\"; \\\n\t  $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) $$list2 \"$(DESTDIR)$(libdir)\"; \\\n\t}\n\nuninstall-libLTLIBRARIES:\n\t@$(NORMAL_UNINSTALL)\n\t@list='$(lib_LTLIBRARIES)'; test -n \"$(libdir)\" || list=; \\\n\tfor p in $$list; do \\\n\t  $(am__strip_dir) \\\n\t  echo \" $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=uninstall rm -f '$(DESTDIR)$(libdir)/$$f'\"; \\\n\t  $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=uninstall rm -f \"$(DESTDIR)$(libdir)/$$f\"; \\\n\tdone\n\nclean-libLTLIBRARIES:\n\t-test -z \"$(lib_LTLIBRARIES)\" || rm -f $(lib_LTLIBRARIES)\n\t@list='$(lib_LTLIBRARIES)'; \\\n\tlocs=`for p in $$list; do echo $$p; done | \\\n\t      sed 's|^[^/]*$$|.|; s|/[^/]*$$||; s|$$|/so_locations|' | \\\n\t      sort -u`; \\\n\ttest -z \"$$locs\" || { \\\n\t  echo rm -f $${locs}; \\\n\t  rm -f $${locs}; \\\n\t}\n\nlibfstpdtscript.la: $(libfstpdtscript_la_OBJECTS) $(libfstpdtscript_la_DEPENDENCIES) $(EXTRA_libfstpdtscript_la_DEPENDENCIES) \n\t$(AM_V_CXXLD)$(libfstpdtscript_la_LINK) $(am_libfstpdtscript_la_rpath) $(libfstpdtscript_la_OBJECTS) $(libfstpdtscript_la_LIBADD) $(LIBS)\ninstall-binPROGRAMS: $(bin_PROGRAMS)\n\t@$(NORMAL_INSTALL)\n\t@list='$(bin_PROGRAMS)'; test -n \"$(bindir)\" || list=; \\\n\tif test -n \"$$list\"; then \\\n\t  echo \" $(MKDIR_P) '$(DESTDIR)$(bindir)'\"; \\\n\t  $(MKDIR_P) \"$(DESTDIR)$(bindir)\" || exit 1; \\\n\tfi; \\\n\tfor p in $$list; do echo \"$$p $$p\"; done | \\\n\tsed 's/$(EXEEXT)$$//' | \\\n\twhile read p p1; do if test -f $$p \\\n\t || test -f $$p1 \\\n\t  ; then echo \"$$p\"; echo \"$$p\"; else :; fi; \\\n\tdone | \\\n\tsed -e 'p;s,.*/,,;n;h' \\\n\t    -e 's|.*|.|' \\\n\t    -e 'p;x;s,.*/,,;s/$(EXEEXT)$$//;$(transform);s/$$/$(EXEEXT)/' | \\\n\tsed 'N;N;N;s,\\n, ,g' | \\\n\t$(AWK) 'BEGIN { files[\".\"] = \"\"; dirs[\".\"] = 1 } \\\n\t  { d=$$3; if (dirs[d] != 1) { print \"d\", d; dirs[d] = 1 } \\\n\t    if ($$2 == $$4) files[d] = files[d] \" \" $$1; \\\n\t    else { print \"f\", $$3 \"/\" $$4, $$1; } } \\\n\t  END { for (d in files) print \"f\", d, files[d] }' | \\\n\twhile read type dir files; do \\\n\t    if test \"$$dir\" = .; then dir=; else dir=/$$dir; fi; \\\n\t    test -z \"$$files\" || { \\\n\t    echo \" $(INSTALL_PROGRAM_ENV) $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL_PROGRAM) $$files '$(DESTDIR)$(bindir)$$dir'\"; \\\n\t    $(INSTALL_PROGRAM_ENV) $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL_PROGRAM) $$files \"$(DESTDIR)$(bindir)$$dir\" || exit $$?; \\\n\t    } \\\n\t; done\n\nuninstall-binPROGRAMS:\n\t@$(NORMAL_UNINSTALL)\n\t@list='$(bin_PROGRAMS)'; test -n \"$(bindir)\" || list=; \\\n\tfiles=`for p in $$list; do echo \"$$p\"; done | \\\n\t  sed -e 'h;s,^.*/,,;s/$(EXEEXT)$$//;$(transform)' \\\n\t      -e 's/$$/$(EXEEXT)/' \\\n\t`; \\\n\ttest -n \"$$list\" || exit 0; \\\n\techo \" ( cd '$(DESTDIR)$(bindir)' && rm -f\" $$files \")\"; \\\n\tcd \"$(DESTDIR)$(bindir)\" && rm -f $$files\n\nclean-binPROGRAMS:\n\t@list='$(bin_PROGRAMS)'; test -n \"$$list\" || exit 0; \\\n\techo \" rm -f\" $$list; \\\n\trm -f $$list || exit $$?; \\\n\ttest -n \"$(EXEEXT)\" || exit 0; \\\n\tlist=`for p in $$list; do echo \"$$p\"; done | sed 's/$(EXEEXT)$$//'`; \\\n\techo \" rm -f\" $$list; \\\n\trm -f $$list\n\npdtcompose$(EXEEXT): $(pdtcompose_OBJECTS) $(pdtcompose_DEPENDENCIES) $(EXTRA_pdtcompose_DEPENDENCIES) \n\t@rm -f pdtcompose$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(pdtcompose_OBJECTS) $(pdtcompose_LDADD) $(LIBS)\n\npdtexpand$(EXEEXT): $(pdtexpand_OBJECTS) $(pdtexpand_DEPENDENCIES) $(EXTRA_pdtexpand_DEPENDENCIES) \n\t@rm -f pdtexpand$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(pdtexpand_OBJECTS) $(pdtexpand_LDADD) $(LIBS)\n\npdtinfo$(EXEEXT): $(pdtinfo_OBJECTS) $(pdtinfo_DEPENDENCIES) $(EXTRA_pdtinfo_DEPENDENCIES) \n\t@rm -f pdtinfo$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(pdtinfo_OBJECTS) $(pdtinfo_LDADD) $(LIBS)\n\npdtreplace$(EXEEXT): $(pdtreplace_OBJECTS) $(pdtreplace_DEPENDENCIES) $(EXTRA_pdtreplace_DEPENDENCIES) \n\t@rm -f pdtreplace$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(pdtreplace_OBJECTS) $(pdtreplace_LDADD) $(LIBS)\n\npdtreverse$(EXEEXT): $(pdtreverse_OBJECTS) $(pdtreverse_DEPENDENCIES) $(EXTRA_pdtreverse_DEPENDENCIES) \n\t@rm -f pdtreverse$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(pdtreverse_OBJECTS) $(pdtreverse_LDADD) $(LIBS)\n\npdtshortestpath$(EXEEXT): $(pdtshortestpath_OBJECTS) $(pdtshortestpath_DEPENDENCIES) $(EXTRA_pdtshortestpath_DEPENDENCIES) \n\t@rm -f pdtshortestpath$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(pdtshortestpath_OBJECTS) $(pdtshortestpath_LDADD) $(LIBS)\n\nmostlyclean-compile:\n\t-rm -f *.$(OBJEXT)\n\ndistclean-compile:\n\t-rm -f *.tab.c\n\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/getters.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/pdtcompose.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/pdtexpand.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/pdtinfo.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/pdtreplace.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/pdtreverse.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/pdtscript.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/pdtshortestpath.Po@am__quote@\n\n.cc.o:\n@am__fastdepCXX_TRUE@\t$(AM_V_CXX)depbase=`echo $@ | sed 's|[^/]*$$|$(DEPDIR)/&|;s|\\.o$$||'`;\\\n@am__fastdepCXX_TRUE@\t$(CXXCOMPILE) -MT $@ -MD -MP -MF $$depbase.Tpo -c -o $@ $< &&\\\n@am__fastdepCXX_TRUE@\t$(am__mv) $$depbase.Tpo $$depbase.Po\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\t$(AM_V_CXX)source='$<' object='$@' libtool=no @AMDEPBACKSLASH@\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\tDEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@\n@am__fastdepCXX_FALSE@\t$(AM_V_CXX@am__nodep@)$(CXXCOMPILE) -c -o $@ $<\n\n.cc.obj:\n@am__fastdepCXX_TRUE@\t$(AM_V_CXX)depbase=`echo $@ | sed 's|[^/]*$$|$(DEPDIR)/&|;s|\\.obj$$||'`;\\\n@am__fastdepCXX_TRUE@\t$(CXXCOMPILE) -MT $@ -MD -MP -MF $$depbase.Tpo -c -o $@ `$(CYGPATH_W) '$<'` &&\\\n@am__fastdepCXX_TRUE@\t$(am__mv) $$depbase.Tpo $$depbase.Po\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\t$(AM_V_CXX)source='$<' object='$@' libtool=no @AMDEPBACKSLASH@\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\tDEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@\n@am__fastdepCXX_FALSE@\t$(AM_V_CXX@am__nodep@)$(CXXCOMPILE) -c -o $@ `$(CYGPATH_W) '$<'`\n\n.cc.lo:\n@am__fastdepCXX_TRUE@\t$(AM_V_CXX)depbase=`echo $@ | sed 's|[^/]*$$|$(DEPDIR)/&|;s|\\.lo$$||'`;\\\n@am__fastdepCXX_TRUE@\t$(LTCXXCOMPILE) -MT $@ -MD -MP -MF $$depbase.Tpo -c -o $@ $< &&\\\n@am__fastdepCXX_TRUE@\t$(am__mv) $$depbase.Tpo $$depbase.Plo\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\t$(AM_V_CXX)source='$<' object='$@' libtool=yes @AMDEPBACKSLASH@\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\tDEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@\n@am__fastdepCXX_FALSE@\t$(AM_V_CXX@am__nodep@)$(LTCXXCOMPILE) -c -o $@ $<\n\nmostlyclean-libtool:\n\t-rm -f *.lo\n\nclean-libtool:\n\t-rm -rf .libs _libs\n\nID: $(am__tagged_files)\n\t$(am__define_uniq_tagged_files); mkid -fID $$unique\ntags: tags-am\nTAGS: tags\n\ntags-am: $(TAGS_DEPENDENCIES) $(am__tagged_files)\n\tset x; \\\n\there=`pwd`; \\\n\t$(am__define_uniq_tagged_files); \\\n\tshift; \\\n\tif test -z \"$(ETAGS_ARGS)$$*$$unique\"; then :; else \\\n\t  test -n \"$$unique\" || unique=$$empty_fix; \\\n\t  if test $$# -gt 0; then \\\n\t    $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \\\n\t      \"$$@\" $$unique; \\\n\t  else \\\n\t    $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \\\n\t      $$unique; \\\n\t  fi; \\\n\tfi\nctags: ctags-am\n\nCTAGS: ctags\nctags-am: $(TAGS_DEPENDENCIES) $(am__tagged_files)\n\t$(am__define_uniq_tagged_files); \\\n\ttest -z \"$(CTAGS_ARGS)$$unique\" \\\n\t  || $(CTAGS) $(CTAGSFLAGS) $(AM_CTAGSFLAGS) $(CTAGS_ARGS) \\\n\t     $$unique\n\nGTAGS:\n\there=`$(am__cd) $(top_builddir) && pwd` \\\n\t  && $(am__cd) $(top_srcdir) \\\n\t  && gtags -i $(GTAGS_ARGS) \"$$here\"\ncscopelist: cscopelist-am\n\ncscopelist-am: $(am__tagged_files)\n\tlist='$(am__tagged_files)'; \\\n\tcase \"$(srcdir)\" in \\\n\t  [\\\\/]* | ?:[\\\\/]*) sdir=\"$(srcdir)\" ;; \\\n\t  *) sdir=$(subdir)/$(srcdir) ;; \\\n\tesac; \\\n\tfor i in $$list; do \\\n\t  if test -f \"$$i\"; then \\\n\t    echo \"$(subdir)/$$i\"; \\\n\t  else \\\n\t    echo \"$$sdir/$$i\"; \\\n\t  fi; \\\n\tdone >> $(top_builddir)/cscope.files\n\ndistclean-tags:\n\t-rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags\n\ndistdir: $(DISTFILES)\n\t@srcdirstrip=`echo \"$(srcdir)\" | sed 's/[].[^$$\\\\*]/\\\\\\\\&/g'`; \\\n\ttopsrcdirstrip=`echo \"$(top_srcdir)\" | sed 's/[].[^$$\\\\*]/\\\\\\\\&/g'`; \\\n\tlist='$(DISTFILES)'; \\\n\t  dist_files=`for file in $$list; do echo $$file; done | \\\n\t  sed -e \"s|^$$srcdirstrip/||;t\" \\\n\t      -e \"s|^$$topsrcdirstrip/|$(top_builddir)/|;t\"`; \\\n\tcase $$dist_files in \\\n\t  */*) $(MKDIR_P) `echo \"$$dist_files\" | \\\n\t\t\t   sed '/\\//!d;s|^|$(distdir)/|;s,/[^/]*$$,,' | \\\n\t\t\t   sort -u` ;; \\\n\tesac; \\\n\tfor file in $$dist_files; do \\\n\t  if test -f $$file || test -d $$file; then d=.; else d=$(srcdir); fi; \\\n\t  if test -d $$d/$$file; then \\\n\t    dir=`echo \"/$$file\" | sed -e 's,/[^/]*$$,,'`; \\\n\t    if test -d \"$(distdir)/$$file\"; then \\\n\t      find \"$(distdir)/$$file\" -type d ! -perm -700 -exec chmod u+rwx {} \\;; \\\n\t    fi; \\\n\t    if test -d $(srcdir)/$$file && test $$d != $(srcdir); then \\\n\t      cp -fpR $(srcdir)/$$file \"$(distdir)$$dir\" || exit 1; \\\n\t      find \"$(distdir)/$$file\" -type d ! -perm -700 -exec chmod u+rwx {} \\;; \\\n\t    fi; \\\n\t    cp -fpR $$d/$$file \"$(distdir)$$dir\" || exit 1; \\\n\t  else \\\n\t    test -f \"$(distdir)/$$file\" \\\n\t    || cp -p $$d/$$file \"$(distdir)/$$file\" \\\n\t    || exit 1; \\\n\t  fi; \\\n\tdone\ncheck-am: all-am\ncheck: check-am\nall-am: Makefile $(LTLIBRARIES) $(PROGRAMS)\ninstall-binPROGRAMS: install-libLTLIBRARIES\n\ninstalldirs:\n\tfor dir in \"$(DESTDIR)$(libdir)\" \"$(DESTDIR)$(bindir)\"; do \\\n\t  test -z \"$$dir\" || $(MKDIR_P) \"$$dir\"; \\\n\tdone\ninstall: install-am\ninstall-exec: install-exec-am\ninstall-data: install-data-am\nuninstall: uninstall-am\n\ninstall-am: all-am\n\t@$(MAKE) $(AM_MAKEFLAGS) install-exec-am install-data-am\n\ninstallcheck: installcheck-am\ninstall-strip:\n\tif test -z '$(STRIP)'; then \\\n\t  $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" \\\n\t    install_sh_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" INSTALL_STRIP_FLAG=-s \\\n\t      install; \\\n\telse \\\n\t  $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" \\\n\t    install_sh_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" INSTALL_STRIP_FLAG=-s \\\n\t    \"INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'\" install; \\\n\tfi\nmostlyclean-generic:\n\nclean-generic:\n\ndistclean-generic:\n\t-test -z \"$(CONFIG_CLEAN_FILES)\" || rm -f $(CONFIG_CLEAN_FILES)\n\t-test . = \"$(srcdir)\" || test -z \"$(CONFIG_CLEAN_VPATH_FILES)\" || rm -f $(CONFIG_CLEAN_VPATH_FILES)\n\nmaintainer-clean-generic:\n\t@echo \"This command is intended for maintainers to use\"\n\t@echo \"it deletes files that may require special tools to rebuild.\"\nclean: clean-am\n\nclean-am: clean-binPROGRAMS clean-generic clean-libLTLIBRARIES \\\n\tclean-libtool mostlyclean-am\n\ndistclean: distclean-am\n\t-rm -rf ./$(DEPDIR)\n\t-rm -f Makefile\ndistclean-am: clean-am distclean-compile distclean-generic \\\n\tdistclean-tags\n\ndvi: dvi-am\n\ndvi-am:\n\nhtml: html-am\n\nhtml-am:\n\ninfo: info-am\n\ninfo-am:\n\ninstall-data-am:\n\ninstall-dvi: install-dvi-am\n\ninstall-dvi-am:\n\ninstall-exec-am: install-binPROGRAMS install-libLTLIBRARIES\n\ninstall-html: install-html-am\n\ninstall-html-am:\n\ninstall-info: install-info-am\n\ninstall-info-am:\n\ninstall-man:\n\ninstall-pdf: install-pdf-am\n\ninstall-pdf-am:\n\ninstall-ps: install-ps-am\n\ninstall-ps-am:\n\ninstallcheck-am:\n\nmaintainer-clean: maintainer-clean-am\n\t-rm -rf ./$(DEPDIR)\n\t-rm -f Makefile\nmaintainer-clean-am: distclean-am maintainer-clean-generic\n\nmostlyclean: mostlyclean-am\n\nmostlyclean-am: mostlyclean-compile mostlyclean-generic \\\n\tmostlyclean-libtool\n\npdf: pdf-am\n\npdf-am:\n\nps: ps-am\n\nps-am:\n\nuninstall-am: uninstall-binPROGRAMS uninstall-libLTLIBRARIES\n\n.MAKE: install-am install-strip\n\n.PHONY: CTAGS GTAGS TAGS all all-am check check-am clean \\\n\tclean-binPROGRAMS clean-generic clean-libLTLIBRARIES \\\n\tclean-libtool cscopelist-am ctags ctags-am distclean \\\n\tdistclean-compile distclean-generic distclean-libtool \\\n\tdistclean-tags distdir dvi dvi-am html html-am info info-am \\\n\tinstall install-am install-binPROGRAMS install-data \\\n\tinstall-data-am install-dvi install-dvi-am install-exec \\\n\tinstall-exec-am install-html install-html-am install-info \\\n\tinstall-info-am install-libLTLIBRARIES install-man install-pdf \\\n\tinstall-pdf-am install-ps install-ps-am install-strip \\\n\tinstallcheck installcheck-am installdirs maintainer-clean \\\n\tmaintainer-clean-generic mostlyclean mostlyclean-compile \\\n\tmostlyclean-generic mostlyclean-libtool pdf pdf-am ps ps-am \\\n\ttags tags-am uninstall uninstall-am uninstall-binPROGRAMS \\\n\tuninstall-libLTLIBRARIES\n\n.PRECIOUS: Makefile\n\n\n# Tell versions [3.59,3.63) of GNU make to not export all variables.\n# Otherwise a system limit (for SysV at least) may be exceeded.\n.NOEXPORT:\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/extensions/pdt/getters.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/extensions/pdt/getters.h>\n\nnamespace fst {\nnamespace script {\n\nbool GetPdtComposeFilter(const string &str, PdtComposeFilter *cf) {\n  if (str == \"expand\") {\n    *cf = EXPAND_FILTER;\n  } else if (str == \"expand_paren\") {\n    *cf = EXPAND_PAREN_FILTER;\n  } else if (str == \"paren\") {\n    *cf = PAREN_FILTER;\n  } else {\n    return false;\n  }\n  return true;\n}\n\nbool GetPdtParserType(const string &str, PdtParserType *pt) {\n  if (str == \"left\") {\n    *pt = PDT_LEFT_PARSER;\n  } else if (str == \"left_sr\") {\n    *pt = PDT_LEFT_SR_PARSER;\n  } else {\n    return false;\n  }\n  return true;\n}\n\n}  // namespace script\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/extensions/pdt/pdtcompose.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Composes a PDT and an FST.\n\n#include <cstring>\n\n#include <memory>\n#include <string>\n#include <vector>\n\n#include <fst/flags.h>\n#include <fst/log.h>\n\n#include <fst/extensions/pdt/getters.h>\n#include <fst/extensions/pdt/pdtscript.h>\n#include <fst/util.h>\n\nDEFINE_string(pdt_parentheses, \"\", \"PDT parenthesis label pairs\");\nDEFINE_bool(left_pdt, true, \"Is the first argument the PDT?\");\nDEFINE_bool(connect, true, \"Trim output?\");\nDEFINE_string(compose_filter, \"paren\",\n              \"Composition filter, one of: \\\"expand\\\", \\\"expand_paren\\\", \"\n              \"\\\"paren\\\"\");\n\nint main(int argc, char **argv) {\n  namespace s = fst::script;\n  using fst::ReadLabelPairs;\n  using fst::PdtComposeFilter;\n  using fst::PdtComposeOptions;\n  using fst::script::FstClass;\n  using fst::script::VectorFstClass;\n\n  string usage = \"Compose a PDT and an FST.\\n\\n  Usage: \";\n  usage += argv[0];\n  usage += \" in.pdt in.fst [out.pdt]\\n\";\n  usage += \" in.fst in.pdt [out.pdt]\\n\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n  if (argc < 3 || argc > 4) {\n    ShowUsage();\n    return 1;\n  }\n\n  const string in1_name = strcmp(argv[1], \"-\") == 0 ? \"\" : argv[1];\n  const string in2_name = strcmp(argv[2], \"-\") == 0 ? \"\" : argv[2];\n  const string out_name = argc > 3 ? argv[3] : \"\";\n\n  if (in1_name.empty() && in2_name.empty()) {\n    LOG(ERROR) << argv[0] << \": Can't take both inputs from standard input.\";\n    return 1;\n  }\n\n  std::unique_ptr<FstClass> ifst1(FstClass::Read(in1_name));\n  if (!ifst1) return 1;\n  std::unique_ptr<FstClass> ifst2(FstClass::Read(in2_name));\n  if (!ifst2) return 1;\n\n  if (FLAGS_pdt_parentheses.empty()) {\n    LOG(ERROR) << argv[0] << \": No PDT parenthesis label pairs provided\";\n    return 1;\n  }\n\n  std::vector<s::LabelPair> parens;\n  if (!ReadLabelPairs(FLAGS_pdt_parentheses, &parens, false)) return 1;\n\n  VectorFstClass ofst(ifst1->ArcType());\n\n  PdtComposeFilter compose_filter;\n  if (!s::GetPdtComposeFilter(FLAGS_compose_filter, &compose_filter)) {\n    LOG(ERROR) << argv[0] << \": Unknown or unsupported compose filter type: \"\n               << FLAGS_compose_filter;\n    return 1;\n  }\n\n  const PdtComposeOptions copts(FLAGS_connect, compose_filter);\n\n  s::PdtCompose(*ifst1, *ifst2, parens, &ofst, copts, FLAGS_left_pdt);\n\n  ofst.Write(out_name);\n\n  return 0;\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/extensions/pdt/pdtexpand.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Expands a (bounded-stack) PDT as an FST.\n\n#include <cstring>\n\n#include <memory>\n#include <string>\n#include <vector>\n\n#include <fst/flags.h>\n#include <fst/log.h>\n\n#include <fst/extensions/pdt/pdtscript.h>\n#include <fst/util.h>\n\nDEFINE_string(pdt_parentheses, \"\", \"PDT parenthesis label pairs\");\nDEFINE_bool(connect, true, \"Trim output?\");\nDEFINE_bool(keep_parentheses, false, \"Keep PDT parentheses in result?\");\nDEFINE_string(weight, \"\", \"Weight threshold\");\n\nint main(int argc, char **argv) {\n  namespace s = fst::script;\n  using fst::script::FstClass;\n  using fst::script::VectorFstClass;\n  using fst::script::WeightClass;\n  using fst::ReadLabelPairs;\n\n  string usage = \"Expand a (bounded-stack) PDT as an FST.\\n\\n  Usage: \";\n  usage += argv[0];\n  usage += \" in.pdt [out.fst]\\n\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n  if (argc > 3) {\n    ShowUsage();\n    return 1;\n  }\n\n  const string in_name =\n      (argc > 1 && (strcmp(argv[1], \"-\") != 0)) ? argv[1] : \"\";\n  const string out_name = argc > 2 ? argv[2] : \"\";\n\n  std::unique_ptr<FstClass> ifst(FstClass::Read(in_name));\n  if (!ifst) return 1;\n\n  if (FLAGS_pdt_parentheses.empty()) {\n    LOG(ERROR) << argv[0] << \": No PDT parenthesis label pairs provided\";\n    return 1;\n  }\n\n  std::vector<s::LabelPair> parens;\n  if (!ReadLabelPairs(FLAGS_pdt_parentheses, &parens, false)) return 1;\n\n  const auto weight_threshold =\n      FLAGS_weight.empty() ? WeightClass::Zero(ifst->WeightType())\n                           : WeightClass(ifst->WeightType(), FLAGS_weight);\n\n  VectorFstClass ofst(ifst->ArcType());\n  s::PdtExpand(*ifst, parens, &ofst,\n               s::PdtExpandOptions(FLAGS_connect, FLAGS_keep_parentheses,\n                                   weight_threshold));\n\n  ofst.Write(out_name);\n\n  return 0;\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/extensions/pdt/pdtinfo.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Prints out various information about a PDT such as number of states, arcs,\n// and parentheses.\n\n#include <cstring>\n\n#include <memory>\n#include <string>\n#include <vector>\n\n#include <fst/flags.h>\n#include <fst/log.h>\n\n#include <fst/extensions/pdt/pdtscript.h>\n#include <fst/util.h>\n\nDEFINE_string(pdt_parentheses, \"\", \"PDT parenthesis label pairs\");\n\nint main(int argc, char **argv) {\n  namespace s = fst::script;\n  using fst::ReadLabelPairs;\n  using fst::script::FstClass;\n\n  string usage = \"Prints out information about a PDT.\\n\\n  Usage: \";\n  usage += argv[0];\n  usage += \" in.pdt\\n\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n  if (argc > 2) {\n    ShowUsage();\n    return 1;\n  }\n\n  const string in_name =\n      (argc > 1 && (strcmp(argv[1], \"-\") != 0)) ? argv[1] : \"\";\n\n  std::unique_ptr<FstClass> ifst(FstClass::Read(in_name));\n  if (!ifst) return 1;\n\n  if (FLAGS_pdt_parentheses.empty()) {\n    LOG(ERROR) << argv[0] << \": No PDT parenthesis label pairs provided\";\n    return 1;\n  }\n\n  std::vector<s::LabelPair> parens;\n  if (!ReadLabelPairs(FLAGS_pdt_parentheses, &parens, false)) return 1;\n\n  s::PrintPdtInfo(*ifst, parens);\n\n  return 0;\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/extensions/pdt/pdtreplace.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Converts an RTN represented by FSTs and non-terminal labels into a PDT.\n\n#include <cstring>\n\n#include <string>\n#include <vector>\n\n#include <fst/flags.h>\n\n#include <fst/extensions/pdt/getters.h>\n#include <fst/extensions/pdt/pdtscript.h>\n#include <fst/util.h>\n#include <fst/vector-fst.h>\n\nDEFINE_string(pdt_parentheses, \"\", \"PDT parenthesis label pairs\");\nDEFINE_string(pdt_parser_type, \"left\",\n              \"Construction method, one of: \\\"left\\\", \\\"left_sr\\\"\");\nDEFINE_int64(start_paren_labels, fst::kNoLabel,\n             \"Index to use for the first inserted parentheses; if not \"\n             \"specified, the next available label beyond the highest output \"\n             \"label is used\");\nDEFINE_string(left_paren_prefix, \"(_\", \"Prefix to attach to SymbolTable \"\n              \"labels for inserted left parentheses\");\nDEFINE_string(right_paren_prefix, \")_\", \"Prefix to attach to SymbolTable \"\n              \"labels for inserted right parentheses\");\n\nvoid Cleanup(std::vector<fst::script::LabelFstClassPair> *pairs) {\n  for (const auto &pair : *pairs) {\n    delete pair.second;\n  }\n  pairs->clear();\n}\n\nint main(int argc, char **argv) {\n  namespace s = fst::script;\n  using fst::script::FstClass;\n  using fst::script::VectorFstClass;\n  using fst::PdtParserType;\n  using fst::WriteLabelPairs;\n\n  string usage = \"Converts an RTN represented by FSTs\";\n  usage += \" and non-terminal labels into PDT.\\n\\n  Usage: \";\n  usage += argv[0];\n  usage += \" root.fst rootlabel [rule1.fst label1 ...] [out.fst]\\n\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n  if (argc < 4) {\n    ShowUsage();\n    return 1;\n  }\n\n  const string in_name = argv[1];\n  const string out_name = argc % 2 == 0 ? argv[argc - 1] : \"\";\n\n  auto *ifst = FstClass::Read(in_name);\n  if (!ifst) return 1;\n\n  PdtParserType parser_type;\n  if (!s::GetPdtParserType(FLAGS_pdt_parser_type, &parser_type)) {\n    LOG(ERROR) << argv[0] << \": Unknown PDT parser type: \"\n               << FLAGS_pdt_parser_type;\n    delete ifst;\n    return 1;\n  }\n\n  std::vector<s::LabelFstClassPair> pairs;\n  // Note that if the root label is beyond the range of the underlying FST's\n  // labels, truncation will occur.\n  const auto root = atoll(argv[2]);\n  pairs.emplace_back(root, ifst);\n\n  for (auto i = 3; i < argc - 1; i += 2) {\n    ifst = FstClass::Read(argv[i]);\n    if (!ifst) {\n      Cleanup(&pairs);\n      return 1;\n    }\n    // Note that if the root label is beyond the range of the underlying FST's\n    // labels, truncation will occur.\n    const auto label = atoll(argv[i + 1]);\n    pairs.emplace_back(label, ifst);\n  }\n\n  VectorFstClass ofst(ifst->ArcType());\n  std::vector<s::LabelPair> parens;\n  s::PdtReplace(pairs, &ofst, &parens, root, parser_type,\n                FLAGS_start_paren_labels, FLAGS_left_paren_prefix,\n                FLAGS_right_paren_prefix);\n  Cleanup(&pairs);\n\n  if (!FLAGS_pdt_parentheses.empty()) {\n    if (!WriteLabelPairs(FLAGS_pdt_parentheses, parens)) return 1;\n  }\n\n  ofst.Write(out_name);\n\n  return 0;\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/extensions/pdt/pdtreverse.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Reverses a PDT.\n\n#include <cstring>\n\n#include <memory>\n#include <string>\n#include <vector>\n\n#include <fst/flags.h>\n#include <fst/log.h>\n\n#include <fst/extensions/pdt/pdtscript.h>\n#include <fst/util.h>\n\nDEFINE_string(pdt_parentheses, \"\", \"PDT parenthesis label pairs\");\n\nint main(int argc, char **argv) {\n  namespace s = fst::script;\n  using fst::ReadLabelPairs;\n  using fst::script::FstClass;\n  using fst::script::VectorFstClass;\n\n  string usage = \"Reverse a PDT.\\n\\n  Usage: \";\n  usage += argv[0];\n  usage += \" in.pdt [out.fst]\\n\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n  if (argc > 3) {\n    ShowUsage();\n    return 1;\n  }\n\n  const string in_name =\n      (argc > 1 && (strcmp(argv[1], \"-\") != 0)) ? argv[1] : \"\";\n  const string out_name = argc > 2 ? argv[2] : \"\";\n\n  std::unique_ptr<FstClass> ifst(FstClass::Read(in_name));\n  if (!ifst) return 1;\n\n  if (FLAGS_pdt_parentheses.empty()) {\n    LOG(ERROR) << argv[0] << \": No PDT parenthesis label pairs provided\";\n    return 1;\n  }\n\n  std::vector<s::LabelPair> parens;\n  if (!ReadLabelPairs(FLAGS_pdt_parentheses, &parens, false)) return 1;\n\n  VectorFstClass ofst(ifst->ArcType());\n\n  s::PdtReverse(*ifst, parens, &ofst);\n\n  ofst.Write(out_name);\n\n  return 0;\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/extensions/pdt/pdtscript.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Definitions of 'scriptable' versions of pdt operations, that is,\n// those that can be called with FstClass-type arguments.\n//\n// See comments in nlp/fst/script/script-impl.h for how the registration\n// mechanism allows these to work with various arc types.\n\n#include <string>\n#include <vector>\n\n#include <fst/extensions/pdt/compose.h>\n#include <fst/extensions/pdt/expand.h>\n#include <fst/extensions/pdt/pdtscript.h>\n#include <fst/extensions/pdt/replace.h>\n#include <fst/extensions/pdt/reverse.h>\n#include <fst/extensions/pdt/shortest-path.h>\n#include <fst/script/script-impl.h>\n\nnamespace fst {\nnamespace script {\n\nvoid PdtCompose(const FstClass &ifst1, const FstClass &ifst2,\n                const std::vector<LabelPair> &parens,\n                MutableFstClass *ofst, const PdtComposeOptions &copts,\n                bool left_pdt) {\n  if (!internal::ArcTypesMatch(ifst1, ifst2, \"PdtCompose\") ||\n      !internal::ArcTypesMatch(ifst1, *ofst, \"PdtCompose\"))\n    return;\n  PdtComposeArgs args(ifst1, ifst2, parens, ofst, copts, left_pdt);\n  Apply<Operation<PdtComposeArgs>>(\"PdtCompose\", ifst1.ArcType(), &args);\n}\n\nvoid PdtExpand(const FstClass &ifst,\n               const std::vector<LabelPair> &parens,\n               MutableFstClass *ofst, const PdtExpandOptions &opts) {\n  PdtExpandArgs args(ifst, parens, ofst, opts);\n  Apply<Operation<PdtExpandArgs>>(\"PdtExpand\", ifst.ArcType(), &args);\n}\n\nvoid PdtExpand(const FstClass &ifst,\n               const std::vector<std::pair<int64, int64>> &parens,\n               MutableFstClass *ofst, bool connect, bool keep_parentheses,\n               const WeightClass &weight_threshold) {\n  PdtExpand(ifst, parens, ofst,\n            PdtExpandOptions(connect, keep_parentheses, weight_threshold));\n}\n\nvoid PdtReplace(const std::vector<LabelFstClassPair> &pairs,\n                MutableFstClass *ofst, std::vector<LabelPair> *parens,\n                int64 root, PdtParserType parser_type, int64 start_paren_labels,\n                const string &left_paren_prefix,\n                const string &right_paren_prefix) {\n  for (size_t i = 1; i < pairs.size(); ++i) {\n    if (!internal::ArcTypesMatch(*pairs[i - 1].second, *pairs[i].second,\n                                 \"PdtReplace\"))\n      return;\n  }\n  if (!internal::ArcTypesMatch(*pairs[0].second, *ofst, \"PdtReplace\")) return;\n  PdtReplaceArgs args(pairs, ofst, parens, root, parser_type,\n                      start_paren_labels, left_paren_prefix,\n                      right_paren_prefix);\n  Apply<Operation<PdtReplaceArgs>>(\"PdtReplace\", ofst->ArcType(), &args);\n}\n\nvoid PdtReverse(const FstClass &ifst,\n                const std::vector<LabelPair> &parens,\n                MutableFstClass *ofst) {\n  PdtReverseArgs args(ifst, parens, ofst);\n  Apply<Operation<PdtReverseArgs>>(\"PdtReverse\", ifst.ArcType(), &args);\n}\n\nvoid PdtShortestPath(const FstClass &ifst,\n                     const std::vector<LabelPair> &parens,\n                     MutableFstClass *ofst,\n                     const PdtShortestPathOptions &opts) {\n  PdtShortestPathArgs args(ifst, parens, ofst, opts);\n  Apply<Operation<PdtShortestPathArgs>>(\"PdtShortestPath\", ifst.ArcType(),\n                                        &args);\n}\n\nvoid PrintPdtInfo(const FstClass &ifst,\n                  const std::vector<LabelPair> &parens) {\n  PrintPdtInfoArgs args(ifst, parens);\n  Apply<Operation<PrintPdtInfoArgs>>(\"PrintPdtInfo\", ifst.ArcType(), &args);\n}\n\n// Register operations for common arc types.\n\nREGISTER_FST_PDT_OPERATIONS(StdArc);\nREGISTER_FST_PDT_OPERATIONS(LogArc);\nREGISTER_FST_PDT_OPERATIONS(Log64Arc);\n\n}  // namespace script\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/extensions/pdt/pdtshortestpath.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Returns the shortest path in a (bounded-stack) PDT.\n\n#include <cstring>\n\n#include <memory>\n#include <string>\n#include <vector>\n\n#include <fst/flags.h>\n#include <fst/log.h>\n\n#include <fst/extensions/pdt/pdtscript.h>\n#include <fst/util.h>\n\nDEFINE_bool(keep_parentheses, false, \"Keep PDT parentheses in result?\");\nDEFINE_string(queue_type, \"fifo\",\n              \"Queue type: one of: \"\n              \"\\\"fifo\\\", \\\"lifo\\\", \\\"state\\\"\");\nDEFINE_bool(path_gc, true, \"Garbage collect shortest path data?\");\nDEFINE_string(pdt_parentheses, \"\", \"PDT parenthesis label pairs\");\n\nint main(int argc, char **argv) {\n  namespace s = fst::script;\n  using fst::script::FstClass;\n  using fst::script::VectorFstClass;\n  using fst::QueueType;\n  using fst::ReadLabelPairs;\n\n  string usage = \"Shortest path in a (bounded-stack) PDT.\\n\\n  Usage: \";\n  usage += argv[0];\n  usage += \" in.pdt [out.fst]\\n\";\n\n  std::set_new_handler(FailedNewHandler);\n  SET_FLAGS(usage.c_str(), &argc, &argv, true);\n  if (argc > 3) {\n    ShowUsage();\n    return 1;\n  }\n\n  const string in_name =\n      (argc > 1 && (strcmp(argv[1], \"-\") != 0)) ? argv[1] : \"\";\n  const string out_name = argc > 2 ? argv[2] : \"\";\n\n  std::unique_ptr<FstClass> ifst(FstClass::Read(in_name));\n  if (!ifst) return 1;\n\n  if (FLAGS_pdt_parentheses.empty()) {\n    LOG(ERROR) << argv[0] << \": No PDT parenthesis label pairs provided\";\n    return 1;\n  }\n\n  std::vector<s::LabelPair> parens;\n  if (!ReadLabelPairs(FLAGS_pdt_parentheses, &parens, false)) return 1;\n\n  VectorFstClass ofst(ifst->ArcType());\n\n  QueueType qt;\n  if (FLAGS_queue_type == \"fifo\") {\n    qt = fst::FIFO_QUEUE;\n  } else if (FLAGS_queue_type == \"lifo\") {\n    qt = fst::LIFO_QUEUE;\n  } else if (FLAGS_queue_type == \"state\") {\n    qt = fst::STATE_ORDER_QUEUE;\n  } else {\n    LOG(ERROR) << \"Unknown queue type: \" << FLAGS_queue_type;\n    return 1;\n  }\n\n  const s::PdtShortestPathOptions opts(qt, FLAGS_keep_parentheses,\n                                       FLAGS_path_gc);\n\n  s::PdtShortestPath(*ifst, parens, &ofst, opts);\n\n  ofst.Write(out_name);\n\n  return 0;\n}\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/extensions/python/Makefile.am",
    "content": "# NB: we use the Cython-generated .cc files rather than the *.pxd/.pyx sources\n# used to generate them. Consequently, modifications to the .pyx files will not\n# influence the build unless the .cc files are regenerated using Cython.\n\npython_LTLIBRARIES = pywrapfst.la\n\npyexec_LTILIBRARIES = pywrapfst.la\n\npywrapfst_la_SOURCES = pywrapfst.cc\npywrapfst_la_CPPFLAGS = -I$(srcdir)/../../include $(PYTHON_CPPFLAGS)\npywrapfst_la_LDFLAGS = $(PYTHON_LDFLAGS) -avoid-version -module\npywrapfst_la_LIBADD = ../far/libfstfarscript.la ../far/libfstfar.la \\\n                      ../../script/libfstscript.la ../../lib/libfst.la \\\n                      -lm $(DL_LIBS)\n\n# Exports the *.pxd/*.pxd source files.\nEXTRA_DIST = basictypes.pxd fst.pxd ios.pxd memory.pxd pywrapfst.pxd \\\n             pywrapfst.pyx\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/extensions/python/Makefile.in",
    "content": "# Makefile.in generated by automake 1.15.1 from Makefile.am.\n# @configure_input@\n\n# Copyright (C) 1994-2017 Free Software Foundation, Inc.\n\n# This Makefile.in is free software; the Free Software Foundation\n# gives unlimited permission to copy and/or distribute it,\n# with or without modifications, as long as this notice is preserved.\n\n# This program is distributed in the hope that it will be useful,\n# but WITHOUT ANY WARRANTY, to the extent permitted by law; without\n# even the implied warranty of MERCHANTABILITY or FITNESS FOR A\n# PARTICULAR PURPOSE.\n\n@SET_MAKE@\n\n# NB: we use the Cython-generated .cc files rather than the *.pxd/.pyx sources\n# used to generate them. Consequently, modifications to the .pyx files will not\n# influence the build unless the .cc files are regenerated using Cython.\n\nVPATH = @srcdir@\nam__is_gnu_make = { \\\n  if test -z '$(MAKELEVEL)'; then \\\n    false; \\\n  elif test -n '$(MAKE_HOST)'; then \\\n    true; \\\n  elif test -n '$(MAKE_VERSION)' && test -n '$(CURDIR)'; then \\\n    true; \\\n  else \\\n    false; \\\n  fi; \\\n}\nam__make_running_with_option = \\\n  case $${target_option-} in \\\n      ?) ;; \\\n      *) echo \"am__make_running_with_option: internal error: invalid\" \\\n              \"target option '$${target_option-}' specified\" >&2; \\\n         exit 1;; \\\n  esac; \\\n  has_opt=no; \\\n  sane_makeflags=$$MAKEFLAGS; \\\n  if $(am__is_gnu_make); then \\\n    sane_makeflags=$$MFLAGS; \\\n  else \\\n    case $$MAKEFLAGS in \\\n      *\\\\[\\ \\\t]*) \\\n        bs=\\\\; \\\n        sane_makeflags=`printf '%s\\n' \"$$MAKEFLAGS\" \\\n          | sed \"s/$$bs$$bs[$$bs $$bs\t]*//g\"`;; \\\n    esac; \\\n  fi; \\\n  skip_next=no; \\\n  strip_trailopt () \\\n  { \\\n    flg=`printf '%s\\n' \"$$flg\" | sed \"s/$$1.*$$//\"`; \\\n  }; \\\n  for flg in $$sane_makeflags; do \\\n    test $$skip_next = yes && { skip_next=no; continue; }; \\\n    case $$flg in \\\n      *=*|--*) continue;; \\\n        -*I) strip_trailopt 'I'; skip_next=yes;; \\\n      -*I?*) strip_trailopt 'I';; \\\n        -*O) strip_trailopt 'O'; skip_next=yes;; \\\n      -*O?*) strip_trailopt 'O';; \\\n        -*l) strip_trailopt 'l'; skip_next=yes;; \\\n      -*l?*) strip_trailopt 'l';; \\\n      -[dEDm]) skip_next=yes;; \\\n      -[JT]) skip_next=yes;; \\\n    esac; \\\n    case $$flg in \\\n      *$$target_option*) has_opt=yes; break;; \\\n    esac; \\\n  done; \\\n  test $$has_opt = yes\nam__make_dryrun = (target_option=n; $(am__make_running_with_option))\nam__make_keepgoing = (target_option=k; $(am__make_running_with_option))\npkgdatadir = $(datadir)/@PACKAGE@\npkgincludedir = $(includedir)/@PACKAGE@\npkglibdir = $(libdir)/@PACKAGE@\npkglibexecdir = $(libexecdir)/@PACKAGE@\nam__cd = CDPATH=\"$${ZSH_VERSION+.}$(PATH_SEPARATOR)\" && cd\ninstall_sh_DATA = $(install_sh) -c -m 644\ninstall_sh_PROGRAM = $(install_sh) -c\ninstall_sh_SCRIPT = $(install_sh) -c\nINSTALL_HEADER = $(INSTALL_DATA)\ntransform = $(program_transform_name)\nNORMAL_INSTALL = :\nPRE_INSTALL = :\nPOST_INSTALL = :\nNORMAL_UNINSTALL = :\nPRE_UNINSTALL = :\nPOST_UNINSTALL = :\nbuild_triplet = @build@\nhost_triplet = @host@\nsubdir = src/extensions/python\nACLOCAL_M4 = $(top_srcdir)/aclocal.m4\nam__aclocal_m4_deps = $(top_srcdir)/m4/ac_python_devel.m4 \\\n\t$(top_srcdir)/m4/libtool.m4 $(top_srcdir)/m4/ltoptions.m4 \\\n\t$(top_srcdir)/m4/ltsugar.m4 $(top_srcdir)/m4/ltversion.m4 \\\n\t$(top_srcdir)/m4/lt~obsolete.m4 $(top_srcdir)/configure.ac\nam__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \\\n\t$(ACLOCAL_M4)\nDIST_COMMON = $(srcdir)/Makefile.am $(am__DIST_COMMON)\nmkinstalldirs = $(install_sh) -d\nCONFIG_HEADER = $(top_builddir)/config.h \\\n\t$(top_builddir)/src/include/fst/config.h\nCONFIG_CLEAN_FILES =\nCONFIG_CLEAN_VPATH_FILES =\nam__vpath_adj_setup = srcdirstrip=`echo \"$(srcdir)\" | sed 's|.|.|g'`;\nam__vpath_adj = case $$p in \\\n    $(srcdir)/*) f=`echo \"$$p\" | sed \"s|^$$srcdirstrip/||\"`;; \\\n    *) f=$$p;; \\\n  esac;\nam__strip_dir = f=`echo $$p | sed -e 's|^.*/||'`;\nam__install_max = 40\nam__nobase_strip_setup = \\\n  srcdirstrip=`echo \"$(srcdir)\" | sed 's/[].[^$$\\\\*|]/\\\\\\\\&/g'`\nam__nobase_strip = \\\n  for p in $$list; do echo \"$$p\"; done | sed -e \"s|$$srcdirstrip/||\"\nam__nobase_list = $(am__nobase_strip_setup); \\\n  for p in $$list; do echo \"$$p $$p\"; done | \\\n  sed \"s| $$srcdirstrip/| |;\"' / .*\\//!s/ .*/ ./; s,\\( .*\\)/[^/]*$$,\\1,' | \\\n  $(AWK) 'BEGIN { files[\".\"] = \"\" } { files[$$2] = files[$$2] \" \" $$1; \\\n    if (++n[$$2] == $(am__install_max)) \\\n      { print $$2, files[$$2]; n[$$2] = 0; files[$$2] = \"\" } } \\\n    END { for (dir in files) print dir, files[dir] }'\nam__base_list = \\\n  sed '$$!N;$$!N;$$!N;$$!N;$$!N;$$!N;$$!N;s/\\n/ /g' | \\\n  sed '$$!N;$$!N;$$!N;$$!N;s/\\n/ /g'\nam__uninstall_files_from_dir = { \\\n  test -z \"$$files\" \\\n    || { test ! -d \"$$dir\" && test ! -f \"$$dir\" && test ! -r \"$$dir\"; } \\\n    || { echo \" ( cd '$$dir' && rm -f\" $$files \")\"; \\\n         $(am__cd) \"$$dir\" && rm -f $$files; }; \\\n  }\nam__installdirs = \"$(DESTDIR)$(pythondir)\"\nLTLIBRARIES = $(python_LTLIBRARIES)\nam__DEPENDENCIES_1 =\npywrapfst_la_DEPENDENCIES = ../far/libfstfarscript.la \\\n\t../far/libfstfar.la ../../script/libfstscript.la \\\n\t../../lib/libfst.la $(am__DEPENDENCIES_1)\nam_pywrapfst_la_OBJECTS = pywrapfst_la-pywrapfst.lo\npywrapfst_la_OBJECTS = $(am_pywrapfst_la_OBJECTS)\nAM_V_lt = $(am__v_lt_@AM_V@)\nam__v_lt_ = $(am__v_lt_@AM_DEFAULT_V@)\nam__v_lt_0 = --silent\nam__v_lt_1 = \npywrapfst_la_LINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \\\n\t$(LIBTOOLFLAGS) --mode=link $(CXXLD) $(AM_CXXFLAGS) \\\n\t$(CXXFLAGS) $(pywrapfst_la_LDFLAGS) $(LDFLAGS) -o $@\nAM_V_P = $(am__v_P_@AM_V@)\nam__v_P_ = $(am__v_P_@AM_DEFAULT_V@)\nam__v_P_0 = false\nam__v_P_1 = :\nAM_V_GEN = $(am__v_GEN_@AM_V@)\nam__v_GEN_ = $(am__v_GEN_@AM_DEFAULT_V@)\nam__v_GEN_0 = @echo \"  GEN     \" $@;\nam__v_GEN_1 = \nAM_V_at = $(am__v_at_@AM_V@)\nam__v_at_ = $(am__v_at_@AM_DEFAULT_V@)\nam__v_at_0 = @\nam__v_at_1 = \nDEFAULT_INCLUDES = \ndepcomp = $(SHELL) $(top_srcdir)/depcomp\nam__depfiles_maybe = depfiles\nam__mv = mv -f\nCXXCOMPILE = $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) \\\n\t$(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS)\nLTCXXCOMPILE = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \\\n\t$(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) \\\n\t$(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) \\\n\t$(AM_CXXFLAGS) $(CXXFLAGS)\nAM_V_CXX = $(am__v_CXX_@AM_V@)\nam__v_CXX_ = $(am__v_CXX_@AM_DEFAULT_V@)\nam__v_CXX_0 = @echo \"  CXX     \" $@;\nam__v_CXX_1 = \nCXXLD = $(CXX)\nCXXLINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \\\n\t$(LIBTOOLFLAGS) --mode=link $(CXXLD) $(AM_CXXFLAGS) \\\n\t$(CXXFLAGS) $(AM_LDFLAGS) $(LDFLAGS) -o $@\nAM_V_CXXLD = $(am__v_CXXLD_@AM_V@)\nam__v_CXXLD_ = $(am__v_CXXLD_@AM_DEFAULT_V@)\nam__v_CXXLD_0 = @echo \"  CXXLD   \" $@;\nam__v_CXXLD_1 = \nSOURCES = $(pywrapfst_la_SOURCES)\nDIST_SOURCES = $(pywrapfst_la_SOURCES)\nam__can_run_installinfo = \\\n  case $$AM_UPDATE_INFO_DIR in \\\n    n|no|NO) false;; \\\n    *) (install-info --version) >/dev/null 2>&1;; \\\n  esac\nam__tagged_files = $(HEADERS) $(SOURCES) $(TAGS_FILES) $(LISP)\n# Read a list of newline-separated strings from the standard input,\n# and print each of them once, without duplicates.  Input order is\n# *not* preserved.\nam__uniquify_input = $(AWK) '\\\n  BEGIN { nonempty = 0; } \\\n  { items[$$0] = 1; nonempty = 1; } \\\n  END { if (nonempty) { for (i in items) print i; }; } \\\n'\n# Make sure the list of sources is unique.  This is necessary because,\n# e.g., the same source file might be shared among _SOURCES variables\n# for different programs/libraries.\nam__define_uniq_tagged_files = \\\n  list='$(am__tagged_files)'; \\\n  unique=`for i in $$list; do \\\n    if test -f \"$$i\"; then echo $$i; else echo $(srcdir)/$$i; fi; \\\n  done | $(am__uniquify_input)`\nETAGS = etags\nCTAGS = ctags\nam__DIST_COMMON = $(srcdir)/Makefile.in $(top_srcdir)/depcomp\nDISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST)\nACLOCAL = @ACLOCAL@\nAMTAR = @AMTAR@\nAM_DEFAULT_VERBOSITY = @AM_DEFAULT_VERBOSITY@\nAR = @AR@\nAUTOCONF = @AUTOCONF@\nAUTOHEADER = @AUTOHEADER@\nAUTOMAKE = @AUTOMAKE@\nAWK = @AWK@\nCC = @CC@\nCCDEPMODE = @CCDEPMODE@\nCFLAGS = @CFLAGS@\nCPP = @CPP@\nCPPFLAGS = @CPPFLAGS@\nCXX = @CXX@\nCXXCPP = @CXXCPP@\nCXXDEPMODE = @CXXDEPMODE@\nCXXFLAGS = @CXXFLAGS@\nCYGPATH_W = @CYGPATH_W@\nDEFS = @DEFS@\nDEPDIR = @DEPDIR@\nDLLTOOL = @DLLTOOL@\nDL_LIBS = @DL_LIBS@\nDSYMUTIL = @DSYMUTIL@\nDUMPBIN = @DUMPBIN@\nECHO_C = @ECHO_C@\nECHO_N = @ECHO_N@\nECHO_T = @ECHO_T@\nEGREP = @EGREP@\nEXEEXT = @EXEEXT@\nFGREP = @FGREP@\nGREP = @GREP@\nINSTALL = @INSTALL@\nINSTALL_DATA = @INSTALL_DATA@\nINSTALL_PROGRAM = @INSTALL_PROGRAM@\nINSTALL_SCRIPT = @INSTALL_SCRIPT@\nINSTALL_STRIP_PROGRAM = @INSTALL_STRIP_PROGRAM@\nLD = @LD@\nLDFLAGS = @LDFLAGS@\nLIBOBJS = @LIBOBJS@\nLIBS = @LIBS@\nLIBTOOL = @LIBTOOL@\nLIPO = @LIPO@\nLN_S = @LN_S@\nLTLIBOBJS = @LTLIBOBJS@\nLT_SYS_LIBRARY_PATH = @LT_SYS_LIBRARY_PATH@\nMAKEINFO = @MAKEINFO@\nMANIFEST_TOOL = @MANIFEST_TOOL@\nMKDIR_P = @MKDIR_P@\nNM = @NM@\nNMEDIT = @NMEDIT@\nOBJDUMP = @OBJDUMP@\nOBJEXT = @OBJEXT@\nOTOOL = @OTOOL@\nOTOOL64 = @OTOOL64@\nPACKAGE = @PACKAGE@\nPACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@\nPACKAGE_NAME = @PACKAGE_NAME@\nPACKAGE_STRING = @PACKAGE_STRING@\nPACKAGE_TARNAME = @PACKAGE_TARNAME@\nPACKAGE_URL = @PACKAGE_URL@\nPACKAGE_VERSION = @PACKAGE_VERSION@\nPATH_SEPARATOR = @PATH_SEPARATOR@\nPYTHON = @PYTHON@\nPYTHON_CPPFLAGS = @PYTHON_CPPFLAGS@\nPYTHON_EXEC_PREFIX = @PYTHON_EXEC_PREFIX@\nPYTHON_EXTRA_LDFLAGS = @PYTHON_EXTRA_LDFLAGS@\nPYTHON_EXTRA_LIBS = @PYTHON_EXTRA_LIBS@\nPYTHON_LDFLAGS = @PYTHON_LDFLAGS@\nPYTHON_PLATFORM = @PYTHON_PLATFORM@\nPYTHON_PREFIX = @PYTHON_PREFIX@\nPYTHON_SITE_PKG = @PYTHON_SITE_PKG@\nPYTHON_VERSION = @PYTHON_VERSION@\nRANLIB = @RANLIB@\nSED = @SED@\nSET_MAKE = @SET_MAKE@\nSHELL = @SHELL@\nSTRIP = @STRIP@\nVERSION = @VERSION@\nabs_builddir = @abs_builddir@\nabs_srcdir = @abs_srcdir@\nabs_top_builddir = @abs_top_builddir@\nabs_top_srcdir = @abs_top_srcdir@\nac_ct_AR = @ac_ct_AR@\nac_ct_CC = @ac_ct_CC@\nac_ct_CXX = @ac_ct_CXX@\nac_ct_DUMPBIN = @ac_ct_DUMPBIN@\nam__include = @am__include@\nam__leading_dot = @am__leading_dot@\nam__quote = @am__quote@\nam__tar = @am__tar@\nam__untar = @am__untar@\nbindir = @bindir@\nbuild = @build@\nbuild_alias = @build_alias@\nbuild_cpu = @build_cpu@\nbuild_os = @build_os@\nbuild_vendor = @build_vendor@\nbuilddir = @builddir@\ndatadir = @datadir@\ndatarootdir = @datarootdir@\ndocdir = @docdir@\ndvidir = @dvidir@\nexec_prefix = @exec_prefix@\nhost = @host@\nhost_alias = @host_alias@\nhost_cpu = @host_cpu@\nhost_os = @host_os@\nhost_vendor = @host_vendor@\nhtmldir = @htmldir@\nincludedir = @includedir@\ninfodir = @infodir@\ninstall_sh = @install_sh@\nlibdir = @libdir@\nlibexecdir = @libexecdir@\nlibfstdir = @libfstdir@\nlocaledir = @localedir@\nlocalstatedir = @localstatedir@\nmandir = @mandir@\nmkdir_p = @mkdir_p@\noldincludedir = @oldincludedir@\npdfdir = @pdfdir@\npkgpyexecdir = @pkgpyexecdir@\npkgpythondir = @pkgpythondir@\nprefix = @prefix@\nprogram_transform_name = @program_transform_name@\npsdir = @psdir@\npyexecdir = @pyexecdir@\npythondir = @pythondir@\nrunstatedir = @runstatedir@\nsbindir = @sbindir@\nsharedstatedir = @sharedstatedir@\nsrcdir = @srcdir@\nsysconfdir = @sysconfdir@\ntarget_alias = @target_alias@\ntop_build_prefix = @top_build_prefix@\ntop_builddir = @top_builddir@\ntop_srcdir = @top_srcdir@\npython_LTLIBRARIES = pywrapfst.la\npyexec_LTILIBRARIES = pywrapfst.la\npywrapfst_la_SOURCES = pywrapfst.cc\npywrapfst_la_CPPFLAGS = -I$(srcdir)/../../include $(PYTHON_CPPFLAGS)\npywrapfst_la_LDFLAGS = $(PYTHON_LDFLAGS) -avoid-version -module\npywrapfst_la_LIBADD = ../far/libfstfarscript.la ../far/libfstfar.la \\\n                      ../../script/libfstscript.la ../../lib/libfst.la \\\n                      -lm $(DL_LIBS)\n\n\n# Exports the *.pxd/*.pxd source files.\nEXTRA_DIST = basictypes.pxd fst.pxd ios.pxd memory.pxd pywrapfst.pxd \\\n             pywrapfst.pyx\n\nall: all-am\n\n.SUFFIXES:\n.SUFFIXES: .cc .lo .o .obj\n$(srcdir)/Makefile.in:  $(srcdir)/Makefile.am  $(am__configure_deps)\n\t@for dep in $?; do \\\n\t  case '$(am__configure_deps)' in \\\n\t    *$$dep*) \\\n\t      ( cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh ) \\\n\t        && { if test -f $@; then exit 0; else break; fi; }; \\\n\t      exit 1;; \\\n\t  esac; \\\n\tdone; \\\n\techo ' cd $(top_srcdir) && $(AUTOMAKE) --foreign src/extensions/python/Makefile'; \\\n\t$(am__cd) $(top_srcdir) && \\\n\t  $(AUTOMAKE) --foreign src/extensions/python/Makefile\nMakefile: $(srcdir)/Makefile.in $(top_builddir)/config.status\n\t@case '$?' in \\\n\t  *config.status*) \\\n\t    cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh;; \\\n\t  *) \\\n\t    echo ' cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe)'; \\\n\t    cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe);; \\\n\tesac;\n\n$(top_builddir)/config.status: $(top_srcdir)/configure $(CONFIG_STATUS_DEPENDENCIES)\n\tcd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh\n\n$(top_srcdir)/configure:  $(am__configure_deps)\n\tcd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh\n$(ACLOCAL_M4):  $(am__aclocal_m4_deps)\n\tcd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh\n$(am__aclocal_m4_deps):\n\ninstall-pythonLTLIBRARIES: $(python_LTLIBRARIES)\n\t@$(NORMAL_INSTALL)\n\t@list='$(python_LTLIBRARIES)'; test -n \"$(pythondir)\" || list=; \\\n\tlist2=; for p in $$list; do \\\n\t  if test -f $$p; then \\\n\t    list2=\"$$list2 $$p\"; \\\n\t  else :; fi; \\\n\tdone; \\\n\ttest -z \"$$list2\" || { \\\n\t  echo \" $(MKDIR_P) '$(DESTDIR)$(pythondir)'\"; \\\n\t  $(MKDIR_P) \"$(DESTDIR)$(pythondir)\" || exit 1; \\\n\t  echo \" $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) $$list2 '$(DESTDIR)$(pythondir)'\"; \\\n\t  $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) $$list2 \"$(DESTDIR)$(pythondir)\"; \\\n\t}\n\nuninstall-pythonLTLIBRARIES:\n\t@$(NORMAL_UNINSTALL)\n\t@list='$(python_LTLIBRARIES)'; test -n \"$(pythondir)\" || list=; \\\n\tfor p in $$list; do \\\n\t  $(am__strip_dir) \\\n\t  echo \" $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=uninstall rm -f '$(DESTDIR)$(pythondir)/$$f'\"; \\\n\t  $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=uninstall rm -f \"$(DESTDIR)$(pythondir)/$$f\"; \\\n\tdone\n\nclean-pythonLTLIBRARIES:\n\t-test -z \"$(python_LTLIBRARIES)\" || rm -f $(python_LTLIBRARIES)\n\t@list='$(python_LTLIBRARIES)'; \\\n\tlocs=`for p in $$list; do echo $$p; done | \\\n\t      sed 's|^[^/]*$$|.|; s|/[^/]*$$||; s|$$|/so_locations|' | \\\n\t      sort -u`; \\\n\ttest -z \"$$locs\" || { \\\n\t  echo rm -f $${locs}; \\\n\t  rm -f $${locs}; \\\n\t}\n\npywrapfst.la: $(pywrapfst_la_OBJECTS) $(pywrapfst_la_DEPENDENCIES) $(EXTRA_pywrapfst_la_DEPENDENCIES) \n\t$(AM_V_CXXLD)$(pywrapfst_la_LINK) -rpath $(pythondir) $(pywrapfst_la_OBJECTS) $(pywrapfst_la_LIBADD) $(LIBS)\n\nmostlyclean-compile:\n\t-rm -f *.$(OBJEXT)\n\ndistclean-compile:\n\t-rm -f *.tab.c\n\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/pywrapfst_la-pywrapfst.Plo@am__quote@\n\n.cc.o:\n@am__fastdepCXX_TRUE@\t$(AM_V_CXX)depbase=`echo $@ | sed 's|[^/]*$$|$(DEPDIR)/&|;s|\\.o$$||'`;\\\n@am__fastdepCXX_TRUE@\t$(CXXCOMPILE) -MT $@ -MD -MP -MF $$depbase.Tpo -c -o $@ $< &&\\\n@am__fastdepCXX_TRUE@\t$(am__mv) $$depbase.Tpo $$depbase.Po\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\t$(AM_V_CXX)source='$<' object='$@' libtool=no @AMDEPBACKSLASH@\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\tDEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@\n@am__fastdepCXX_FALSE@\t$(AM_V_CXX@am__nodep@)$(CXXCOMPILE) -c -o $@ $<\n\n.cc.obj:\n@am__fastdepCXX_TRUE@\t$(AM_V_CXX)depbase=`echo $@ | sed 's|[^/]*$$|$(DEPDIR)/&|;s|\\.obj$$||'`;\\\n@am__fastdepCXX_TRUE@\t$(CXXCOMPILE) -MT $@ -MD -MP -MF $$depbase.Tpo -c -o $@ `$(CYGPATH_W) '$<'` &&\\\n@am__fastdepCXX_TRUE@\t$(am__mv) $$depbase.Tpo $$depbase.Po\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\t$(AM_V_CXX)source='$<' object='$@' libtool=no @AMDEPBACKSLASH@\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\tDEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@\n@am__fastdepCXX_FALSE@\t$(AM_V_CXX@am__nodep@)$(CXXCOMPILE) -c -o $@ `$(CYGPATH_W) '$<'`\n\n.cc.lo:\n@am__fastdepCXX_TRUE@\t$(AM_V_CXX)depbase=`echo $@ | sed 's|[^/]*$$|$(DEPDIR)/&|;s|\\.lo$$||'`;\\\n@am__fastdepCXX_TRUE@\t$(LTCXXCOMPILE) -MT $@ -MD -MP -MF $$depbase.Tpo -c -o $@ $< &&\\\n@am__fastdepCXX_TRUE@\t$(am__mv) $$depbase.Tpo $$depbase.Plo\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\t$(AM_V_CXX)source='$<' object='$@' libtool=yes @AMDEPBACKSLASH@\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\tDEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@\n@am__fastdepCXX_FALSE@\t$(AM_V_CXX@am__nodep@)$(LTCXXCOMPILE) -c -o $@ $<\n\npywrapfst_la-pywrapfst.lo: pywrapfst.cc\n@am__fastdepCXX_TRUE@\t$(AM_V_CXX)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(pywrapfst_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -MT pywrapfst_la-pywrapfst.lo -MD -MP -MF $(DEPDIR)/pywrapfst_la-pywrapfst.Tpo -c -o pywrapfst_la-pywrapfst.lo `test -f 'pywrapfst.cc' || echo '$(srcdir)/'`pywrapfst.cc\n@am__fastdepCXX_TRUE@\t$(AM_V_at)$(am__mv) $(DEPDIR)/pywrapfst_la-pywrapfst.Tpo $(DEPDIR)/pywrapfst_la-pywrapfst.Plo\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\t$(AM_V_CXX)source='pywrapfst.cc' object='pywrapfst_la-pywrapfst.lo' libtool=yes @AMDEPBACKSLASH@\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\tDEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@\n@am__fastdepCXX_FALSE@\t$(AM_V_CXX@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(pywrapfst_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -c -o pywrapfst_la-pywrapfst.lo `test -f 'pywrapfst.cc' || echo '$(srcdir)/'`pywrapfst.cc\n\nmostlyclean-libtool:\n\t-rm -f *.lo\n\nclean-libtool:\n\t-rm -rf .libs _libs\n\nID: $(am__tagged_files)\n\t$(am__define_uniq_tagged_files); mkid -fID $$unique\ntags: tags-am\nTAGS: tags\n\ntags-am: $(TAGS_DEPENDENCIES) $(am__tagged_files)\n\tset x; \\\n\there=`pwd`; \\\n\t$(am__define_uniq_tagged_files); \\\n\tshift; \\\n\tif test -z \"$(ETAGS_ARGS)$$*$$unique\"; then :; else \\\n\t  test -n \"$$unique\" || unique=$$empty_fix; \\\n\t  if test $$# -gt 0; then \\\n\t    $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \\\n\t      \"$$@\" $$unique; \\\n\t  else \\\n\t    $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \\\n\t      $$unique; \\\n\t  fi; \\\n\tfi\nctags: ctags-am\n\nCTAGS: ctags\nctags-am: $(TAGS_DEPENDENCIES) $(am__tagged_files)\n\t$(am__define_uniq_tagged_files); \\\n\ttest -z \"$(CTAGS_ARGS)$$unique\" \\\n\t  || $(CTAGS) $(CTAGSFLAGS) $(AM_CTAGSFLAGS) $(CTAGS_ARGS) \\\n\t     $$unique\n\nGTAGS:\n\there=`$(am__cd) $(top_builddir) && pwd` \\\n\t  && $(am__cd) $(top_srcdir) \\\n\t  && gtags -i $(GTAGS_ARGS) \"$$here\"\ncscopelist: cscopelist-am\n\ncscopelist-am: $(am__tagged_files)\n\tlist='$(am__tagged_files)'; \\\n\tcase \"$(srcdir)\" in \\\n\t  [\\\\/]* | ?:[\\\\/]*) sdir=\"$(srcdir)\" ;; \\\n\t  *) sdir=$(subdir)/$(srcdir) ;; \\\n\tesac; \\\n\tfor i in $$list; do \\\n\t  if test -f \"$$i\"; then \\\n\t    echo \"$(subdir)/$$i\"; \\\n\t  else \\\n\t    echo \"$$sdir/$$i\"; \\\n\t  fi; \\\n\tdone >> $(top_builddir)/cscope.files\n\ndistclean-tags:\n\t-rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags\n\ndistdir: $(DISTFILES)\n\t@srcdirstrip=`echo \"$(srcdir)\" | sed 's/[].[^$$\\\\*]/\\\\\\\\&/g'`; \\\n\ttopsrcdirstrip=`echo \"$(top_srcdir)\" | sed 's/[].[^$$\\\\*]/\\\\\\\\&/g'`; \\\n\tlist='$(DISTFILES)'; \\\n\t  dist_files=`for file in $$list; do echo $$file; done | \\\n\t  sed -e \"s|^$$srcdirstrip/||;t\" \\\n\t      -e \"s|^$$topsrcdirstrip/|$(top_builddir)/|;t\"`; \\\n\tcase $$dist_files in \\\n\t  */*) $(MKDIR_P) `echo \"$$dist_files\" | \\\n\t\t\t   sed '/\\//!d;s|^|$(distdir)/|;s,/[^/]*$$,,' | \\\n\t\t\t   sort -u` ;; \\\n\tesac; \\\n\tfor file in $$dist_files; do \\\n\t  if test -f $$file || test -d $$file; then d=.; else d=$(srcdir); fi; \\\n\t  if test -d $$d/$$file; then \\\n\t    dir=`echo \"/$$file\" | sed -e 's,/[^/]*$$,,'`; \\\n\t    if test -d \"$(distdir)/$$file\"; then \\\n\t      find \"$(distdir)/$$file\" -type d ! -perm -700 -exec chmod u+rwx {} \\;; \\\n\t    fi; \\\n\t    if test -d $(srcdir)/$$file && test $$d != $(srcdir); then \\\n\t      cp -fpR $(srcdir)/$$file \"$(distdir)$$dir\" || exit 1; \\\n\t      find \"$(distdir)/$$file\" -type d ! -perm -700 -exec chmod u+rwx {} \\;; \\\n\t    fi; \\\n\t    cp -fpR $$d/$$file \"$(distdir)$$dir\" || exit 1; \\\n\t  else \\\n\t    test -f \"$(distdir)/$$file\" \\\n\t    || cp -p $$d/$$file \"$(distdir)/$$file\" \\\n\t    || exit 1; \\\n\t  fi; \\\n\tdone\ncheck-am: all-am\ncheck: check-am\nall-am: Makefile $(LTLIBRARIES)\ninstalldirs:\n\tfor dir in \"$(DESTDIR)$(pythondir)\"; do \\\n\t  test -z \"$$dir\" || $(MKDIR_P) \"$$dir\"; \\\n\tdone\ninstall: install-am\ninstall-exec: install-exec-am\ninstall-data: install-data-am\nuninstall: uninstall-am\n\ninstall-am: all-am\n\t@$(MAKE) $(AM_MAKEFLAGS) install-exec-am install-data-am\n\ninstallcheck: installcheck-am\ninstall-strip:\n\tif test -z '$(STRIP)'; then \\\n\t  $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" \\\n\t    install_sh_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" INSTALL_STRIP_FLAG=-s \\\n\t      install; \\\n\telse \\\n\t  $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" \\\n\t    install_sh_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" INSTALL_STRIP_FLAG=-s \\\n\t    \"INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'\" install; \\\n\tfi\nmostlyclean-generic:\n\nclean-generic:\n\ndistclean-generic:\n\t-test -z \"$(CONFIG_CLEAN_FILES)\" || rm -f $(CONFIG_CLEAN_FILES)\n\t-test . = \"$(srcdir)\" || test -z \"$(CONFIG_CLEAN_VPATH_FILES)\" || rm -f $(CONFIG_CLEAN_VPATH_FILES)\n\nmaintainer-clean-generic:\n\t@echo \"This command is intended for maintainers to use\"\n\t@echo \"it deletes files that may require special tools to rebuild.\"\nclean: clean-am\n\nclean-am: clean-generic clean-libtool clean-pythonLTLIBRARIES \\\n\tmostlyclean-am\n\ndistclean: distclean-am\n\t-rm -rf ./$(DEPDIR)\n\t-rm -f Makefile\ndistclean-am: clean-am distclean-compile distclean-generic \\\n\tdistclean-tags\n\ndvi: dvi-am\n\ndvi-am:\n\nhtml: html-am\n\nhtml-am:\n\ninfo: info-am\n\ninfo-am:\n\ninstall-data-am: install-pythonLTLIBRARIES\n\ninstall-dvi: install-dvi-am\n\ninstall-dvi-am:\n\ninstall-exec-am:\n\ninstall-html: install-html-am\n\ninstall-html-am:\n\ninstall-info: install-info-am\n\ninstall-info-am:\n\ninstall-man:\n\ninstall-pdf: install-pdf-am\n\ninstall-pdf-am:\n\ninstall-ps: install-ps-am\n\ninstall-ps-am:\n\ninstallcheck-am:\n\nmaintainer-clean: maintainer-clean-am\n\t-rm -rf ./$(DEPDIR)\n\t-rm -f Makefile\nmaintainer-clean-am: distclean-am maintainer-clean-generic\n\nmostlyclean: mostlyclean-am\n\nmostlyclean-am: mostlyclean-compile mostlyclean-generic \\\n\tmostlyclean-libtool\n\npdf: pdf-am\n\npdf-am:\n\nps: ps-am\n\nps-am:\n\nuninstall-am: uninstall-pythonLTLIBRARIES\n\n.MAKE: install-am install-strip\n\n.PHONY: CTAGS GTAGS TAGS all all-am check check-am clean clean-generic \\\n\tclean-libtool clean-pythonLTLIBRARIES cscopelist-am ctags \\\n\tctags-am distclean distclean-compile distclean-generic \\\n\tdistclean-libtool distclean-tags distdir dvi dvi-am html \\\n\thtml-am info info-am install install-am install-data \\\n\tinstall-data-am install-dvi install-dvi-am install-exec \\\n\tinstall-exec-am install-html install-html-am install-info \\\n\tinstall-info-am install-man install-pdf install-pdf-am \\\n\tinstall-ps install-ps-am install-pythonLTLIBRARIES \\\n\tinstall-strip installcheck installcheck-am installdirs \\\n\tmaintainer-clean maintainer-clean-generic mostlyclean \\\n\tmostlyclean-compile mostlyclean-generic mostlyclean-libtool \\\n\tpdf pdf-am ps ps-am tags tags-am uninstall uninstall-am \\\n\tuninstall-pythonLTLIBRARIES\n\n.PRECIOUS: Makefile\n\n\n# Tell versions [3.59,3.63) of GNU make to not export all variables.\n# Otherwise a system limit (for SysV at least) may be exceeded.\n.NOEXPORT:\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/extensions/python/basictypes.pxd",
    "content": "# See www.openfst.org for extensive documentation on this weighted\n# finite-state transducer library.\n\n\nfrom libc.stdint cimport *\n\n\ncdef extern from \"<fst/types.h>\" nogil:\n\n  ctypedef int8_t int8\n  ctypedef int16_t int16\n  ctypedef int32_t int32\n  ctypedef int64_t int64\n  ctypedef uint8_t uint8\n  ctypedef uint16_t uint16\n  ctypedef uint32_t uint32\n  ctypedef uint64_t uint64\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/extensions/python/fst.pxd",
    "content": "# See www.openfst.org for extensive documentation on this weighted\n# finite-state transducer library.\n\n\nfrom libc.time cimport time_t\nfrom libc.time cimport time\n\nfrom libcpp cimport bool\nfrom libcpp.vector cimport vector\nfrom libcpp.utility cimport pair\n\nfrom libcpp.string cimport string\nfrom basictypes cimport int32\nfrom basictypes cimport int64\nfrom basictypes cimport uint32\nfrom basictypes cimport uint64\nfrom ios cimport istream\nfrom ios cimport ostream\n\n\ncdef extern from \"<fst/util.h>\" nogil:\n\n  # Note that this is a copy, so it should be viewed as read-only.\n\n  bool FLAGS_fst_error_fatal\n\n\ncdef extern from \"<fst/fstlib.h>\" namespace \"fst\" nogil:\n\n  # FST properties.\n  const uint64 kExpanded\n  const uint64 kMutable\n  const uint64 kError\n  const uint64 kAcceptor\n  const uint64 kNotAcceptor\n  const uint64 kIDeterministic\n  const uint64 kNonIDeterministic\n  const uint64 kODeterministic\n  const uint64 kNonODeterministic\n  const uint64 kEpsilons\n  const uint64 kNoEpsilons\n  const uint64 kIEpsilons\n  const uint64 kNoIEpsilons\n  const uint64 kOEpsilons\n  const uint64 kNoOEpsilons\n  const uint64 kILabelSorted\n  const uint64 kNotILabelSorted\n  const uint64 kOLabelSorted\n  const uint64 kNotOLabelSorted\n  const uint64 kWeighted\n  const uint64 kUnweighted\n  const uint64 kCyclic\n  const uint64 kAcyclic\n  const uint64 kInitialCyclic\n  const uint64 kInitialAcyclic\n  const uint64 kTopSorted\n  const uint64 kNotTopSorted\n  const uint64 kAccessible\n  const uint64 kNotAccessible\n  const uint64 kCoAccessible\n  const uint64 kNotCoAccessible\n  const uint64 kString\n  const uint64 kNotString\n  const uint64 kWeightedCycles\n  const uint64 kUnweightedCycles\n  const uint64 kNullProperties\n  const uint64 kCopyProperties\n  const uint64 kIntrinsicProperties\n  const uint64 kExtrinsicProperties\n  const uint64 kSetStartProperties\n  const uint64 kSetFinalProperties\n  const uint64 kAddStateProperties\n  const uint64 kAddArcProperties\n  const uint64 kSetArcProperties\n  const uint64 kDeleteStatesProperties\n  const uint64 kDeleteArcsProperties\n  const uint64 kStateSortProperties\n  const uint64 kArcSortProperties\n  const uint64 kILabelInvariantProperties\n  const uint64 kOLabelInvariantProperties\n  const uint64 kWeightInvariantProperties\n  const uint64 kAddSuperFinalProperties\n  const uint64 kRmSuperFinalProperties\n  const uint64 kBinaryProperties\n  const uint64 kTrinaryProperties\n  const uint64 kPosTrinaryProperties\n  const uint64 kNegTrinaryProperties\n  const uint64 kFstProperties\n\n  # ArcIterator flags.\n  const uint32 kArcILabelValue\n  const uint32 kArcOLabelValue\n  const uint32 kArcWeightValue\n  const uint32 kArcNextStateValue\n  const uint32 kArcNoCache\n  const uint32 kArcValueFlags\n  const uint32 kArcFlags\n\n  # EncodeMapper flags.\n  const uint32 kEncodeLabels\n  const uint32 kEncodeWeights\n  const uint32 kEncodeFlags\n\n  # Default argument constants.\n  const float kDelta\n  const float kShortestDelta\n  const int kNoLabel\n  const int kNoStateId\n  const int64 kNoSymbol\n\n  enum ClosureType:\n    CLOSURE_STAR\n    CLOSURE_PLUS\n\n\n  enum ComposeFilter:\n    AUTO_FILTER\n    NULL_FILTER\n    SEQUENCE_FILTER\n    ALT_SEQUENCE_FILTER\n    MATCH_FILTER\n    TRIVIAL_FILTER\n\n\n  cdef cppclass ComposeOptions:\n\n    ComposeOptions(bool, ComposeFilter)\n\n\n  enum DeterminizeType:\n    DETERMINIZE_FUNCTIONAL\n    DETERMINIZE_NONFUNCTIONAL\n    DETERMINIZE_DISAMBIGUATE\n\n\n  enum EncodeType:\n    DECODE\n    ENCODE\n\n\n  enum EpsNormalizeType:\n    EPS_NORM_INPUT\n    EPS_NORM_OUTPUT\n\n\n  enum ProjectType:\n    PROJECT_INPUT\n    PROJECT_OUTPUT\n\n\n  enum QueueType:\n    TRIVIAL_QUEUE\n    FIFO_QUEUE\n    LIFO_QUEUE\n    SHORTEST_FIRST_QUEUE\n    TOP_ORDER_QUEUE\n    STATE_ORDER_QUEUE\n    SCC_QUEUE\n    AUTO_QUEUE\n    OTHER_QUEUE\n\n\n  # This is a templated struct at the C++ level, but Cython does not support\n  # templated structs unless we pretend they are full-blown classes.\n  cdef cppclass RandGenOptions[RandArcSelection]:\n\n    RandGenOptions(const RandArcSelection &, int32, int32, bool, bool)\n\n\n  enum ReplaceLabelType:\n    REPLACE_LABEL_NEITHER\n    REPLACE_LABEL_INPUT\n    REPLACE_LABEL_OUTPUT\n    REPLACE_LABEL_BOTH\n\n\n  enum ReweightType:\n    REWEIGHT_TO_INITIAL\n    REWEIGHT_TO_FINAL\n\n\n  cdef cppclass SymbolTableTextOptions:\n\n    SymbolTableTextOptions(bool)\n\n  # Symbol tables.\n  cdef cppclass SymbolTable:\n\n    SymbolTable()\n\n    SymbolTable(const string &)\n\n    @staticmethod\n    SymbolTable *Read(const string &)\n\n    @staticmethod\n    SymbolTable *ReadText(const string &, const SymbolTableTextOptions &)\n\n    int64 AddSymbol(const string &, int64)\n\n    int64 AddSymbol(const string &)\n\n    SymbolTable *Copy()\n\n    # Aliased for overload.\n    string FindSymbol \"Find\"(int64)\n\n    # Aliased for overload.\n    int64 FindIndex \"Find\"(string)\n\n    # Aliased for overload.\n    bool MemberSymbol \"Member\"(string)\n\n    # Aliased for overload.\n    bool MemberIndex \"Member\"(int64)\n\n    void AddTable(const SymbolTable &)\n\n    int64 GetNthKey(ssize_t)\n\n    const string &Name()\n\n    void SetName(const string &)\n\n    const string &CheckSum()\n\n    const string &LabeledCheckSum()\n\n    bool Write(const string &)\n\n    bool WriteText(const string &)\n\n    int64 AvailableKey()\n\n    size_t NumSymbols()\n\n\n  SymbolTable *CompactSymbolTable(const SymbolTable &syms)\n\n  SymbolTable *MergeSymbolTable(const SymbolTable &, const SymbolTable &,\n                                bool *)\n\n  SymbolTable *FstReadSymbols(const string &, bool)\n\n\n  cdef cppclass SymbolTableIterator:\n\n    SymbolTableIterator(const SymbolTable &)\n\n    bool Done()\n\n    void Next()\n\n    void Reset()\n\n    string Symbol()\n\n    int64 Value()\n\n\ncdef extern from \"<fst/script/fstscript.h>\" namespace \"fst::script\" nogil:\n\n\n  # Weights.\n  cdef cppclass WeightClass:\n\n    WeightClass()\n\n    WeightClass(const WeightClass &)\n\n    WeightClass(const string &, const string &)\n\n    const string &Type()\n\n    string ToString()\n\n    @staticmethod\n    const WeightClass &Zero(const string &)\n\n    @staticmethod\n    const WeightClass &One(const string &)\n\n    @staticmethod\n    const WeightClass &NoWeight(const string &)\n\n  # Alias.\n  cdef bool Eq \"operator==\"(const WeightClass &, const WeightClass &)\n\n  # Alias.\n  cdef bool Ne \"operator!=\"(const WeightClass &, const WeightClass &)\n\n  cdef WeightClass Plus(const WeightClass &, const WeightClass &)\n\n  cdef WeightClass Times(const WeightClass &, const WeightClass &)\n\n  cdef WeightClass Divide(const WeightClass &, const WeightClass &)\n\n  cdef WeightClass Power(const WeightClass &, size_t)\n\n  # Arcs.\n  cdef cppclass ArcClass:\n\n    ArcClass(const ArcClass &)\n\n    ArcClass(int64, int64, const WeightClass &, int64)\n\n    int64 ilabel\n    int64 olabel\n    WeightClass weight\n    int64 nextstate\n\n\n  # FSTs.\n\n\n  cdef cppclass FstClass:\n\n    FstClass(const FstClass &)\n\n    @staticmethod\n    FstClass *Read(const string &)\n\n    # Aliased for overload.\n    @staticmethod\n    FstClass *ReadFromStream \"Read\"(istream &, const string &)\n\n    int64 Start()\n\n    WeightClass Final(int64)\n\n    size_t NumArcs(int64)\n\n    size_t NumInputEpsilons(int64)\n\n    size_t NumOutputEpsilons(int64)\n\n    const string &ArcType()\n\n    const string &FstType()\n\n    const SymbolTable *InputSymbols()\n\n    const SymbolTable *OutputSymbols()\n\n    const string &WeightType()\n\n    bool Write(const string &)\n\n    bool Write(ostream &, const string &)\n\n    uint64 Properties(uint64, bool)\n\n    bool ValidStateId(int64)\n\n\n  cdef cppclass MutableFstClass(FstClass):\n\n    bool AddArc(int64, const ArcClass &)\n\n    int64 AddState()\n\n    bool DeleteArcs(int64, size_t)\n\n    bool DeleteArcs(int64)\n\n    bool DeleteStates(const vector[int64] &)\n\n    void DeleteStates()\n\n    SymbolTable *MutableInputSymbols()\n\n    SymbolTable *MutableOutputSymbols()\n\n    int64 NumStates()\n\n    bool ReserveArcs(int64, size_t)\n\n    void ReserveStates(int64)\n\n    bool SetStart(int64)\n\n    bool SetFinal(int64, const WeightClass &)\n\n    void SetInputSymbols(SymbolTable *)\n\n    void SetOutputSymbols(SymbolTable *)\n\n    void SetProperties(uint64, uint64)\n\n  cdef cppclass VectorFstClass(MutableFstClass):\n\n   VectorFstClass(const FstClass &)\n\n   VectorFstClass(const string &)\n\n\n  # EncodeMapper.\n  cdef cppclass EncodeMapperClass:\n\n    EncodeMapperClass(const string &, uint32, EncodeType)\n\n    # Aliased to __call__ as Cython doesn't have good support for operator().\n    ArcClass __call__ \"operator()\"(const ArcClass &)\n\n    const string &ArcType()\n\n    uint32 Flags()\n\n    uint64 Properties(uint64)\n\n    EncodeType Type()\n\n    const SymbolTable *InputSymbols()\n\n    const SymbolTable *OutputSymbols()\n\n    void SetInputSymbols(const SymbolTable *)\n\n    void SetOutputSymbols(const SymbolTable *)\n\n    const string &WeightType()\n\n\n  # Iterators.\n\n\n  cdef cppclass ArcIteratorClass:\n\n    ArcIteratorClass(const FstClass &, int64)\n\n    bool Done()\n\n    ArcClass Value()\n\n    void Next()\n\n    void Reset()\n\n    void Seek(size_t)\n\n    size_t Position()\n\n    uint32 Flags()\n\n    void SetFlags(uint32, uint32)\n\n  cdef cppclass MutableArcIteratorClass:\n\n    MutableArcIteratorClass(MutableFstClass *, int64)\n\n    bool Done()\n\n    ArcClass Value()\n\n    void Next()\n\n    void Reset()\n\n    void Seek(size_t)\n\n    void SetValue(const ArcClass &)\n\n    size_t Position()\n\n    uint32 Flags()\n\n    void SetFlags(uint32, uint32)\n\n  cdef cppclass StateIteratorClass:\n\n    StateIteratorClass(const FstClass &)\n\n    bool Done()\n\n    int64 Value()\n\n    void Next()\n\n    void Reset()\n\n\nctypedef pair[int64, const FstClass *] LabelFstClassPair\n\nctypedef pair[int64, int64] LabelPair\n\n\ncdef extern from \"<fst/script/fstscript.h>\" namespace \"fst::script\" nogil:\n\n  enum ArcFilterType:\n    ANY_ARC_FILTER\n    EPSILON_ARC_FILTER\n    INPUT_EPSILON_ARC_FILTER\n    OUTPUT_EPSILON_ARC_FILTER\n\n  enum ArcSortType:\n    ILABEL_SORT\n    OLABEL_SORT\n\n  cdef void ArcSort(MutableFstClass *, ArcSortType)\n\n  cdef ClosureType GetClosureType(bool)\n\n  cdef void Closure(MutableFstClass *, ClosureType)\n\n  cdef FstClass *CompileFstInternal(istream &, const string &,\n                                    const string &, const string &,\n                                    const SymbolTable *, const SymbolTable *,\n                                    const SymbolTable*, bool, bool, bool, bool,\n                                    bool)\n\n  cdef void Compose(FstClass &, FstClass &, MutableFstClass *,\n                    const ComposeOptions &)\n\n  cdef void Concat(MutableFstClass *, const FstClass &)\n\n  cdef void Connect(MutableFstClass *)\n\n  cdef FstClass *Convert(const FstClass &, const string &)\n\n  cdef void Decode(MutableFstClass *, const EncodeMapperClass &)\n\n  cdef cppclass DeterminizeOptions:\n\n    DeterminizeOptions(float, const WeightClass &, int64, int64,\n                       DeterminizeType, bool)\n\n  cdef void Determinize(const FstClass &, MutableFstClass *,\n                        const DeterminizeOptions &)\n\n  cdef cppclass DisambiguateOptions:\n\n    DisambiguateOptions(float, const WeightClass &, int64, int64)\n\n  cdef void Disambiguate(const FstClass &, MutableFstClass *,\n                         const DisambiguateOptions &)\n\n  cdef void Difference(const FstClass &, const FstClass &, MutableFstClass *,\n                       const ComposeOptions &)\n\n  cdef void DrawFst(const FstClass &fst, const SymbolTable *,\n                    const SymbolTable *, const SymbolTable *, bool,\n                    const string &, float, float, bool, bool, float, float, int,\n                    int, const string &, bool, ostream *, const string &)\n\n  cdef void Encode(MutableFstClass *, EncodeMapperClass *)\n\n  cdef EpsNormalizeType GetEpsNormalizeType(bool)\n\n  cdef void EpsNormalize(const FstClass &, MutableFstClass *, EpsNormalizeType)\n\n  cdef bool Equal(const FstClass &, const FstClass &, float)\n\n  cdef bool Equivalent(const FstClass &, const FstClass &, float)\n\n  cdef void Intersect(const FstClass &, const FstClass &, MutableFstClass *,\n                      const ComposeOptions &)\n\n  cdef void Invert(MutableFstClass *fst)\n\n  cdef bool Isomorphic(const FstClass &, const FstClass &, float)\n\n  enum MapType:\n    ARC_SUM_MAPPER\n    IDENTITY_MAPPER\n    INPUT_EPSILON_MAPPER\n    INVERT_MAPPER\n    OUTPUT_EPSILON_MAPPER\n    PLUS_MAPPER\n    QUANTIZE_MAPPER\n    RMWEIGHT_MAPPER\n    SUPERFINAL_MAPPER\n    TIMES_MAPPER\n    TO_LOG_MAPPER\n    TO_LOG64_MAPPER\n    TO_STD_MAPPER\n\n  cdef FstClass *Map(const FstClass &, MapType, float, double,\n                     const WeightClass &)\n\n  cdef void Minimize(MutableFstClass *, MutableFstClass *, float, bool)\n\n  cdef ProjectType GetProjectType(bool)\n\n  cdef void Project(MutableFstClass *, ProjectType)\n\n  cdef void PrintFst(const FstClass &, ostream &, const string &,\n                     const SymbolTable *, const SymbolTable *,\n                     const SymbolTable *, bool, bool, const string &)\n\n  cdef void Prune(const FstClass &, MutableFstClass *, const WeightClass &,\n                  int64, float)\n\n  cdef void Prune(MutableFstClass *, const WeightClass &, int64, float)\n\n  cdef void Push(const FstClass &, MutableFstClass *, uint32 flags,\n                 ReweightType, float)\n\n  cdef void Push(MutableFstClass *, ReweightType, float, bool)\n\n  enum RandArcSelection:\n    UNIFORM_ARC_SELECTOR\n    LOG_PROB_ARC_SELECTOR\n    FAST_LOG_PROB_ARC_SELECTOR\n\n  cdef bool RandEquivalent(const FstClass &, const FstClass &, int32, float,\n                           time_t, const RandGenOptions[RandArcSelection] &)\n\n  cdef void RandGen(const FstClass &, MutableFstClass *, time_t,\n                    const RandGenOptions[RandArcSelection] &)\n\n  cdef void Relabel(MutableFstClass *, const SymbolTable *,\n                    const SymbolTable *, const string &, bool,\n                    const SymbolTable *, const SymbolTable *, const string &,\n                    bool)\n\n  cdef void Relabel(MutableFstClass *, const vector[LabelPair] &,\n                    const vector[LabelPair] &)\n\n  cdef cppclass ReplaceOptions:\n\n     ReplaceOptions(int64, ReplaceLabelType, ReplaceLabelType, int64)\n\n  cdef void Replace(const vector[LabelFstClassPair] &, MutableFstClass *,\n                    const ReplaceOptions &)\n\n  cdef void Reverse(const FstClass &, MutableFstClass *, bool)\n\n  cdef void Reweight(MutableFstClass *, const vector[WeightClass] &,\n                     ReweightType)\n\n  cdef cppclass RmEpsilonOptions:\n\n    RmEpsilonOptions(QueueType, bool, const WeightClass &, int64, float)\n\n  cdef void RmEpsilon(MutableFstClass *, const RmEpsilonOptions &)\n\n  cdef cppclass ShortestDistanceOptions:\n\n    ShortestDistanceOptions(QueueType, ArcFilterType, int64, float)\n\n  cdef void ShortestDistance(const FstClass &, vector[WeightClass] *,\n                             const ShortestDistanceOptions &)\n\n  cdef void ShortestDistance(const FstClass &, vector[WeightClass] *, bool,\n                             float)\n\n  cdef cppclass ShortestPathOptions:\n\n    ShortestPathOptions(QueueType, int32, bool, float, const WeightClass &,\n                        int64)\n\n  cdef void ShortestPath(const FstClass &, MutableFstClass *,\n                         const ShortestPathOptions &)\n\n  cdef void Synchronize(const FstClass &, MutableFstClass *)\n\n  cdef bool TopSort(MutableFstClass *)\n\n  cdef void Union(MutableFstClass *, const FstClass &)\n\n  cdef bool Verify(const FstClass &)\n\n\ncdef extern from \"<fst/script/getters.h>\" namespace \"fst::script\" nogil:\n\n  cdef bool GetArcSortType(const string &, ArcSortType *)\n\n  cdef bool GetComposeFilter(const string &, ComposeFilter *)\n\n  cdef bool GetDeterminizeType(const string &, DeterminizeType *)\n\n  cdef uint32 GetEncodeFlags(bool, bool)\n\n  cdef bool GetMapType(const string &, MapType *)\n\n  cdef uint32 GetPushFlags(bool, bool, bool, bool)\n\n  cdef bool GetQueueType(const string &, QueueType *)\n\n  cdef bool GetRandArcSelection(const string &, RandArcSelection *)\n\n  cdef bool GetReplaceLabelType(string, bool, ReplaceLabelType *)\n\n  cdef ReweightType GetReweightType(bool)\n\n\ncdef extern from \"<fst/extensions/far/far.h>\" namespace \"fst\" nogil:\n\n  enum FarType:\n    FAR_DEFAULT\n    FAR_STTABLE\n    FAR_STLIST\n    FAR_FST\n    FAR_SSTABLE\n\ncdef extern from \"<fst/extensions/far/getters.h>\" \\\n    namespace \"fst\" nogil:\n\n  string GetFarTypeString(FarType)\n\n\ncdef extern from \"<fst/extensions/far/getters.h>\" \\\n    namespace \"fst::script\" nogil:\n\n  FarType GetFarType(const string &)\n\n\ncdef extern from \"<fst/extensions/far/far-class.h>\" \\\n    namespace \"fst::script\" nogil:\n\n  cdef cppclass FarReaderClass:\n\n    const string &ArcType()\n\n    bool Done()\n\n    bool Error()\n\n    bool Find(const string &)\n\n    const FstClass *GetFstClass()\n\n    const string &GetKey()\n\n    void Next()\n\n    void Reset()\n\n    FarType Type()\n\n    # For simplicity, we always use the multiple-file one.\n\n    @staticmethod\n    FarReaderClass *Open(const vector[string] &)\n\n  cdef cppclass FarWriterClass:\n\n    bool Add(const string &, const FstClass &)\n\n    bool Error()\n\n    const string &ArcType()\n\n    FarType Type()\n\n    @staticmethod\n    FarWriterClass *Create(const string &, const string &, FarType)\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/extensions/python/ios.pxd",
    "content": "# See www.openfst.org for extensive documentation on this weighted\n# finite-state transducer library.\n\n\nfrom libcpp.string cimport string\nfrom basictypes cimport int8\nfrom basictypes cimport int16\nfrom basictypes cimport int32\nfrom basictypes cimport int64\nfrom basictypes cimport uint8\nfrom basictypes cimport uint16\nfrom basictypes cimport uint32\nfrom basictypes cimport uint64\n\n\ncdef extern from \"<iostream>\" namespace \"std\" nogil:\n\n  cdef cppclass iostream:\n\n    pass\n\n  cdef cppclass istream(iostream):\n\n    pass\n\n  cdef cppclass ostream(iostream):\n\n    pass\n\n\n# We are ignoring openmodes for the moment.\n\n\ncdef extern from \"<fstream>\" namespace \"std\" nogil:\n\n  cdef cppclass ifstream(istream):\n\n    ifstream(const string &)\n\n  cdef cppclass ofstream(ostream):\n\n    ofstream(const string &)\n\n\ncdef extern from \"<sstream>\" namespace \"std\" nogil:\n\n  cdef cppclass stringstream(istream, ostream):\n\n    stringstream()\n\n    string str()\n\n    stringstream &operator<<(const string &)\n\n    stringstream &operator<<(bool)\n\n    # We define these in terms of the Google basictypes.\n\n    stringstream &operator<<(int8)\n\n    stringstream &operator<<(uint8)\n\n    stringstream &operator<<(int16)\n\n    stringstream &operator<<(uint16)\n\n    stringstream &operator<<(int32)\n\n    stringstream &operator<<(uint32)\n\n    stringstream &operator<<(int64)\n\n    stringstream &operator<<(uint64)\n\n    stringstream &operator<<(double)\n\n    stringstream &operator<<(long double)\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/extensions/python/memory.pxd",
    "content": "# See www.openfst.org for extensive documentation on this weighted\n# finite-state transducer library.\n\n\nfrom libcpp.memory cimport shared_ptr\n\n\n# This is mysteriously missing from libcpp.memory.\n\ncdef extern from \"<memory>\" namespace \"std\" nogil:\n\n  shared_ptr[T] static_pointer_cast[T, U](const shared_ptr[U] &)\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/extensions/python/pywrapfst.cc",
    "content": "/* Generated by Cython 0.28.3 */\n\n#define PY_SSIZE_T_CLEAN\n#include \"Python.h\"\n#ifndef Py_PYTHON_H\n    #error Python headers needed to compile C extensions, please install development version of Python.\n#elif PY_VERSION_HEX < 0x02060000 || (0x03000000 <= PY_VERSION_HEX && PY_VERSION_HEX < 0x03030000)\n    #error Cython requires Python 2.6+ or Python 3.3+.\n#else\n#define CYTHON_ABI \"0_28_3\"\n#define CYTHON_FUTURE_DIVISION 0\n#include <stddef.h>\n#ifndef offsetof\n  #define offsetof(type, member) ( (size_t) & ((type*)0) -> member )\n#endif\n#if !defined(WIN32) && !defined(MS_WINDOWS)\n  #ifndef __stdcall\n    #define __stdcall\n  #endif\n  #ifndef __cdecl\n    #define __cdecl\n  #endif\n  #ifndef __fastcall\n    #define __fastcall\n  #endif\n#endif\n#ifndef DL_IMPORT\n  #define DL_IMPORT(t) t\n#endif\n#ifndef DL_EXPORT\n  #define DL_EXPORT(t) t\n#endif\n#define __PYX_COMMA ,\n#ifndef HAVE_LONG_LONG\n  #if PY_VERSION_HEX >= 0x02070000\n    #define HAVE_LONG_LONG\n  #endif\n#endif\n#ifndef PY_LONG_LONG\n  #define PY_LONG_LONG LONG_LONG\n#endif\n#ifndef Py_HUGE_VAL\n  #define Py_HUGE_VAL HUGE_VAL\n#endif\n#ifdef PYPY_VERSION\n  #define CYTHON_COMPILING_IN_PYPY 1\n  #define CYTHON_COMPILING_IN_PYSTON 0\n  #define CYTHON_COMPILING_IN_CPYTHON 0\n  #undef CYTHON_USE_TYPE_SLOTS\n  #define CYTHON_USE_TYPE_SLOTS 0\n  #undef CYTHON_USE_PYTYPE_LOOKUP\n  #define CYTHON_USE_PYTYPE_LOOKUP 0\n  #if PY_VERSION_HEX < 0x03050000\n    #undef CYTHON_USE_ASYNC_SLOTS\n    #define CYTHON_USE_ASYNC_SLOTS 0\n  #elif !defined(CYTHON_USE_ASYNC_SLOTS)\n    #define CYTHON_USE_ASYNC_SLOTS 1\n  #endif\n  #undef CYTHON_USE_PYLIST_INTERNALS\n  #define CYTHON_USE_PYLIST_INTERNALS 0\n  #undef CYTHON_USE_UNICODE_INTERNALS\n  #define CYTHON_USE_UNICODE_INTERNALS 0\n  #undef CYTHON_USE_UNICODE_WRITER\n  #define CYTHON_USE_UNICODE_WRITER 0\n  #undef CYTHON_USE_PYLONG_INTERNALS\n  #define CYTHON_USE_PYLONG_INTERNALS 0\n  #undef CYTHON_AVOID_BORROWED_REFS\n  #define CYTHON_AVOID_BORROWED_REFS 1\n  #undef CYTHON_ASSUME_SAFE_MACROS\n  #define CYTHON_ASSUME_SAFE_MACROS 0\n  #undef CYTHON_UNPACK_METHODS\n  #define CYTHON_UNPACK_METHODS 0\n  #undef CYTHON_FAST_THREAD_STATE\n  #define CYTHON_FAST_THREAD_STATE 0\n  #undef CYTHON_FAST_PYCALL\n  #define CYTHON_FAST_PYCALL 0\n  #undef CYTHON_PEP489_MULTI_PHASE_INIT\n  #define CYTHON_PEP489_MULTI_PHASE_INIT 0\n  #undef CYTHON_USE_TP_FINALIZE\n  #define CYTHON_USE_TP_FINALIZE 0\n#elif defined(PYSTON_VERSION)\n  #define CYTHON_COMPILING_IN_PYPY 0\n  #define CYTHON_COMPILING_IN_PYSTON 1\n  #define CYTHON_COMPILING_IN_CPYTHON 0\n  #ifndef CYTHON_USE_TYPE_SLOTS\n    #define CYTHON_USE_TYPE_SLOTS 1\n  #endif\n  #undef CYTHON_USE_PYTYPE_LOOKUP\n  #define CYTHON_USE_PYTYPE_LOOKUP 0\n  #undef CYTHON_USE_ASYNC_SLOTS\n  #define CYTHON_USE_ASYNC_SLOTS 0\n  #undef CYTHON_USE_PYLIST_INTERNALS\n  #define CYTHON_USE_PYLIST_INTERNALS 0\n  #ifndef CYTHON_USE_UNICODE_INTERNALS\n    #define CYTHON_USE_UNICODE_INTERNALS 1\n  #endif\n  #undef CYTHON_USE_UNICODE_WRITER\n  #define CYTHON_USE_UNICODE_WRITER 0\n  #undef CYTHON_USE_PYLONG_INTERNALS\n  #define CYTHON_USE_PYLONG_INTERNALS 0\n  #ifndef CYTHON_AVOID_BORROWED_REFS\n    #define CYTHON_AVOID_BORROWED_REFS 0\n  #endif\n  #ifndef CYTHON_ASSUME_SAFE_MACROS\n    #define CYTHON_ASSUME_SAFE_MACROS 1\n  #endif\n  #ifndef CYTHON_UNPACK_METHODS\n    #define CYTHON_UNPACK_METHODS 1\n  #endif\n  #undef CYTHON_FAST_THREAD_STATE\n  #define CYTHON_FAST_THREAD_STATE 0\n  #undef CYTHON_FAST_PYCALL\n  #define CYTHON_FAST_PYCALL 0\n  #undef CYTHON_PEP489_MULTI_PHASE_INIT\n  #define CYTHON_PEP489_MULTI_PHASE_INIT 0\n  #undef CYTHON_USE_TP_FINALIZE\n  #define CYTHON_USE_TP_FINALIZE 0\n#else\n  #define CYTHON_COMPILING_IN_PYPY 0\n  #define CYTHON_COMPILING_IN_PYSTON 0\n  #define CYTHON_COMPILING_IN_CPYTHON 1\n  #ifndef CYTHON_USE_TYPE_SLOTS\n    #define CYTHON_USE_TYPE_SLOTS 1\n  #endif\n  #if PY_VERSION_HEX < 0x02070000\n    #undef CYTHON_USE_PYTYPE_LOOKUP\n    #define CYTHON_USE_PYTYPE_LOOKUP 0\n  #elif !defined(CYTHON_USE_PYTYPE_LOOKUP)\n    #define CYTHON_USE_PYTYPE_LOOKUP 1\n  #endif\n  #if PY_MAJOR_VERSION < 3\n    #undef CYTHON_USE_ASYNC_SLOTS\n    #define CYTHON_USE_ASYNC_SLOTS 0\n  #elif !defined(CYTHON_USE_ASYNC_SLOTS)\n    #define CYTHON_USE_ASYNC_SLOTS 1\n  #endif\n  #if PY_VERSION_HEX < 0x02070000\n    #undef CYTHON_USE_PYLONG_INTERNALS\n    #define CYTHON_USE_PYLONG_INTERNALS 0\n  #elif !defined(CYTHON_USE_PYLONG_INTERNALS)\n    #define CYTHON_USE_PYLONG_INTERNALS 1\n  #endif\n  #ifndef CYTHON_USE_PYLIST_INTERNALS\n    #define CYTHON_USE_PYLIST_INTERNALS 1\n  #endif\n  #ifndef CYTHON_USE_UNICODE_INTERNALS\n    #define CYTHON_USE_UNICODE_INTERNALS 1\n  #endif\n  #if PY_VERSION_HEX < 0x030300F0\n    #undef CYTHON_USE_UNICODE_WRITER\n    #define CYTHON_USE_UNICODE_WRITER 0\n  #elif !defined(CYTHON_USE_UNICODE_WRITER)\n    #define CYTHON_USE_UNICODE_WRITER 1\n  #endif\n  #ifndef CYTHON_AVOID_BORROWED_REFS\n    #define CYTHON_AVOID_BORROWED_REFS 0\n  #endif\n  #ifndef CYTHON_ASSUME_SAFE_MACROS\n    #define CYTHON_ASSUME_SAFE_MACROS 1\n  #endif\n  #ifndef CYTHON_UNPACK_METHODS\n    #define CYTHON_UNPACK_METHODS 1\n  #endif\n  #ifndef CYTHON_FAST_THREAD_STATE\n    #define CYTHON_FAST_THREAD_STATE 1\n  #endif\n  #ifndef CYTHON_FAST_PYCALL\n    #define CYTHON_FAST_PYCALL 1\n  #endif\n  #ifndef CYTHON_PEP489_MULTI_PHASE_INIT\n    #define CYTHON_PEP489_MULTI_PHASE_INIT (0 && PY_VERSION_HEX >= 0x03050000)\n  #endif\n  #ifndef CYTHON_USE_TP_FINALIZE\n    #define CYTHON_USE_TP_FINALIZE (PY_VERSION_HEX >= 0x030400a1)\n  #endif\n#endif\n#if !defined(CYTHON_FAST_PYCCALL)\n#define CYTHON_FAST_PYCCALL  (CYTHON_FAST_PYCALL && PY_VERSION_HEX >= 0x030600B1)\n#endif\n#if CYTHON_USE_PYLONG_INTERNALS\n  #include \"longintrepr.h\"\n  #undef SHIFT\n  #undef BASE\n  #undef MASK\n#endif\n#ifndef __has_attribute\n  #define __has_attribute(x) 0\n#endif\n#ifndef __has_cpp_attribute\n  #define __has_cpp_attribute(x) 0\n#endif\n#ifndef CYTHON_RESTRICT\n  #if defined(__GNUC__)\n    #define CYTHON_RESTRICT __restrict__\n  #elif defined(_MSC_VER) && _MSC_VER >= 1400\n    #define CYTHON_RESTRICT __restrict\n  #elif defined (__STDC_VERSION__) && __STDC_VERSION__ >= 199901L\n    #define CYTHON_RESTRICT restrict\n  #else\n    #define CYTHON_RESTRICT\n  #endif\n#endif\n#ifndef CYTHON_UNUSED\n# if defined(__GNUC__)\n#   if !(defined(__cplusplus)) || (__GNUC__ > 3 || (__GNUC__ == 3 && __GNUC_MINOR__ >= 4))\n#     define CYTHON_UNUSED __attribute__ ((__unused__))\n#   else\n#     define CYTHON_UNUSED\n#   endif\n# elif defined(__ICC) || (defined(__INTEL_COMPILER) && !defined(_MSC_VER))\n#   define CYTHON_UNUSED __attribute__ ((__unused__))\n# else\n#   define CYTHON_UNUSED\n# endif\n#endif\n#ifndef CYTHON_MAYBE_UNUSED_VAR\n#  if defined(__cplusplus)\n     template<class T> void CYTHON_MAYBE_UNUSED_VAR( const T& ) { }\n#  else\n#    define CYTHON_MAYBE_UNUSED_VAR(x) (void)(x)\n#  endif\n#endif\n#ifndef CYTHON_NCP_UNUSED\n# if CYTHON_COMPILING_IN_CPYTHON\n#  define CYTHON_NCP_UNUSED\n# else\n#  define CYTHON_NCP_UNUSED CYTHON_UNUSED\n# endif\n#endif\n#define __Pyx_void_to_None(void_result) ((void)(void_result), Py_INCREF(Py_None), Py_None)\n#ifdef _MSC_VER\n    #ifndef _MSC_STDINT_H_\n        #if _MSC_VER < 1300\n           typedef unsigned char     uint8_t;\n           typedef unsigned int      uint32_t;\n        #else\n           typedef unsigned __int8   uint8_t;\n           typedef unsigned __int32  uint32_t;\n        #endif\n    #endif\n#else\n   #include <stdint.h>\n#endif\n#ifndef CYTHON_FALLTHROUGH\n  #if defined(__cplusplus) && __cplusplus >= 201103L\n    #if __has_cpp_attribute(fallthrough)\n      #define CYTHON_FALLTHROUGH [[fallthrough]]\n    #elif __has_cpp_attribute(clang::fallthrough)\n      #define CYTHON_FALLTHROUGH [[clang::fallthrough]]\n    #elif __has_cpp_attribute(gnu::fallthrough)\n      #define CYTHON_FALLTHROUGH [[gnu::fallthrough]]\n    #endif\n  #endif\n  #ifndef CYTHON_FALLTHROUGH\n    #if __has_attribute(fallthrough)\n      #define CYTHON_FALLTHROUGH __attribute__((fallthrough))\n    #else\n      #define CYTHON_FALLTHROUGH\n    #endif\n  #endif\n  #if defined(__clang__ ) && defined(__apple_build_version__)\n    #if __apple_build_version__ < 7000000\n      #undef  CYTHON_FALLTHROUGH\n      #define CYTHON_FALLTHROUGH\n    #endif\n  #endif\n#endif\n\n#ifndef __cplusplus\n  #error \"Cython files generated with the C++ option must be compiled with a C++ compiler.\"\n#endif\n#ifndef CYTHON_INLINE\n  #if defined(__clang__)\n    #define CYTHON_INLINE __inline__ __attribute__ ((__unused__))\n  #else\n    #define CYTHON_INLINE inline\n  #endif\n#endif\ntemplate<typename T>\nvoid __Pyx_call_destructor(T& x) {\n    x.~T();\n}\ntemplate<typename T>\nclass __Pyx_FakeReference {\n  public:\n    __Pyx_FakeReference() : ptr(NULL) { }\n    __Pyx_FakeReference(const T& ref) : ptr(const_cast<T*>(&ref)) { }\n    T *operator->() { return ptr; }\n    T *operator&() { return ptr; }\n    operator T&() { return *ptr; }\n    template<typename U> bool operator ==(U other) { return *ptr == other; }\n    template<typename U> bool operator !=(U other) { return *ptr != other; }\n  private:\n    T *ptr;\n};\n\n#if CYTHON_COMPILING_IN_PYPY && PY_VERSION_HEX < 0x02070600 && !defined(Py_OptimizeFlag)\n  #define Py_OptimizeFlag 0\n#endif\n#define __PYX_BUILD_PY_SSIZE_T \"n\"\n#define CYTHON_FORMAT_SSIZE_T \"z\"\n#if PY_MAJOR_VERSION < 3\n  #define __Pyx_BUILTIN_MODULE_NAME \"__builtin__\"\n  #define __Pyx_PyCode_New(a, k, l, s, f, code, c, n, v, fv, cell, fn, name, fline, lnos)\\\n          PyCode_New(a+k, l, s, f, code, c, n, v, fv, cell, fn, name, fline, lnos)\n  #define __Pyx_DefaultClassType PyClass_Type\n#else\n  #define __Pyx_BUILTIN_MODULE_NAME \"builtins\"\n  #define __Pyx_PyCode_New(a, k, l, s, f, code, c, n, v, fv, cell, fn, name, fline, lnos)\\\n          PyCode_New(a, k, l, s, f, code, c, n, v, fv, cell, fn, name, fline, lnos)\n  #define __Pyx_DefaultClassType PyType_Type\n#endif\n#ifndef Py_TPFLAGS_CHECKTYPES\n  #define Py_TPFLAGS_CHECKTYPES 0\n#endif\n#ifndef Py_TPFLAGS_HAVE_INDEX\n  #define Py_TPFLAGS_HAVE_INDEX 0\n#endif\n#ifndef Py_TPFLAGS_HAVE_NEWBUFFER\n  #define Py_TPFLAGS_HAVE_NEWBUFFER 0\n#endif\n#ifndef Py_TPFLAGS_HAVE_FINALIZE\n  #define Py_TPFLAGS_HAVE_FINALIZE 0\n#endif\n#if PY_VERSION_HEX <= 0x030700A3 || !defined(METH_FASTCALL)\n  #ifndef METH_FASTCALL\n     #define METH_FASTCALL 0x80\n  #endif\n  typedef PyObject *(*__Pyx_PyCFunctionFast) (PyObject *self, PyObject *const *args, Py_ssize_t nargs);\n  typedef PyObject *(*__Pyx_PyCFunctionFastWithKeywords) (PyObject *self, PyObject *const *args,\n                                                          Py_ssize_t nargs, PyObject *kwnames);\n#else\n  #define __Pyx_PyCFunctionFast _PyCFunctionFast\n  #define __Pyx_PyCFunctionFastWithKeywords _PyCFunctionFastWithKeywords\n#endif\n#if CYTHON_FAST_PYCCALL\n#define __Pyx_PyFastCFunction_Check(func)\\\n    ((PyCFunction_Check(func) && (METH_FASTCALL == (PyCFunction_GET_FLAGS(func) & ~(METH_CLASS | METH_STATIC | METH_COEXIST | METH_KEYWORDS)))))\n#else\n#define __Pyx_PyFastCFunction_Check(func) 0\n#endif\n#if CYTHON_COMPILING_IN_PYPY && !defined(PyObject_Malloc)\n  #define PyObject_Malloc(s)   PyMem_Malloc(s)\n  #define PyObject_Free(p)     PyMem_Free(p)\n  #define PyObject_Realloc(p)  PyMem_Realloc(p)\n#endif\n#if CYTHON_COMPILING_IN_PYSTON\n  #define __Pyx_PyCode_HasFreeVars(co)  PyCode_HasFreeVars(co)\n  #define __Pyx_PyFrame_SetLineNumber(frame, lineno) PyFrame_SetLineNumber(frame, lineno)\n#else\n  #define __Pyx_PyCode_HasFreeVars(co)  (PyCode_GetNumFree(co) > 0)\n  #define __Pyx_PyFrame_SetLineNumber(frame, lineno)  (frame)->f_lineno = (lineno)\n#endif\n#if !CYTHON_FAST_THREAD_STATE || PY_VERSION_HEX < 0x02070000\n  #define __Pyx_PyThreadState_Current PyThreadState_GET()\n#elif PY_VERSION_HEX >= 0x03060000\n  #define __Pyx_PyThreadState_Current _PyThreadState_UncheckedGet()\n#elif PY_VERSION_HEX >= 0x03000000\n  #define __Pyx_PyThreadState_Current PyThreadState_GET()\n#else\n  #define __Pyx_PyThreadState_Current _PyThreadState_Current\n#endif\n#if PY_VERSION_HEX < 0x030700A2 && !defined(PyThread_tss_create) && !defined(Py_tss_NEEDS_INIT)\n#include \"pythread.h\"\n#define Py_tss_NEEDS_INIT 0\ntypedef int Py_tss_t;\nstatic CYTHON_INLINE int PyThread_tss_create(Py_tss_t *key) {\n  *key = PyThread_create_key();\n  return 0; // PyThread_create_key reports success always\n}\nstatic CYTHON_INLINE Py_tss_t * PyThread_tss_alloc(void) {\n  Py_tss_t *key = (Py_tss_t *)PyObject_Malloc(sizeof(Py_tss_t));\n  *key = Py_tss_NEEDS_INIT;\n  return key;\n}\nstatic CYTHON_INLINE void PyThread_tss_free(Py_tss_t *key) {\n  PyObject_Free(key);\n}\nstatic CYTHON_INLINE int PyThread_tss_is_created(Py_tss_t *key) {\n  return *key != Py_tss_NEEDS_INIT;\n}\nstatic CYTHON_INLINE void PyThread_tss_delete(Py_tss_t *key) {\n  PyThread_delete_key(*key);\n  *key = Py_tss_NEEDS_INIT;\n}\nstatic CYTHON_INLINE int PyThread_tss_set(Py_tss_t *key, void *value) {\n  return PyThread_set_key_value(*key, value);\n}\nstatic CYTHON_INLINE void * PyThread_tss_get(Py_tss_t *key) {\n  return PyThread_get_key_value(*key);\n}\n#endif // TSS (Thread Specific Storage) API\n#if CYTHON_COMPILING_IN_CPYTHON || defined(_PyDict_NewPresized)\n#define __Pyx_PyDict_NewPresized(n)  ((n <= 8) ? PyDict_New() : _PyDict_NewPresized(n))\n#else\n#define __Pyx_PyDict_NewPresized(n)  PyDict_New()\n#endif\n#if PY_MAJOR_VERSION >= 3 || CYTHON_FUTURE_DIVISION\n  #define __Pyx_PyNumber_Divide(x,y)         PyNumber_TrueDivide(x,y)\n  #define __Pyx_PyNumber_InPlaceDivide(x,y)  PyNumber_InPlaceTrueDivide(x,y)\n#else\n  #define __Pyx_PyNumber_Divide(x,y)         PyNumber_Divide(x,y)\n  #define __Pyx_PyNumber_InPlaceDivide(x,y)  PyNumber_InPlaceDivide(x,y)\n#endif\n#if CYTHON_COMPILING_IN_CPYTHON && PY_VERSION_HEX >= 0x030500A1 && CYTHON_USE_UNICODE_INTERNALS\n#define __Pyx_PyDict_GetItemStr(dict, name)  _PyDict_GetItem_KnownHash(dict, name, ((PyASCIIObject *) name)->hash)\n#else\n#define __Pyx_PyDict_GetItemStr(dict, name)  PyDict_GetItem(dict, name)\n#endif\n#if PY_VERSION_HEX > 0x03030000 && defined(PyUnicode_KIND)\n  #define CYTHON_PEP393_ENABLED 1\n  #define __Pyx_PyUnicode_READY(op)       (likely(PyUnicode_IS_READY(op)) ?\\\n                                              0 : _PyUnicode_Ready((PyObject *)(op)))\n  #define __Pyx_PyUnicode_GET_LENGTH(u)   PyUnicode_GET_LENGTH(u)\n  #define __Pyx_PyUnicode_READ_CHAR(u, i) PyUnicode_READ_CHAR(u, i)\n  #define __Pyx_PyUnicode_MAX_CHAR_VALUE(u)   PyUnicode_MAX_CHAR_VALUE(u)\n  #define __Pyx_PyUnicode_KIND(u)         PyUnicode_KIND(u)\n  #define __Pyx_PyUnicode_DATA(u)         PyUnicode_DATA(u)\n  #define __Pyx_PyUnicode_READ(k, d, i)   PyUnicode_READ(k, d, i)\n  #define __Pyx_PyUnicode_WRITE(k, d, i, ch)  PyUnicode_WRITE(k, d, i, ch)\n  #define __Pyx_PyUnicode_IS_TRUE(u)      (0 != (likely(PyUnicode_IS_READY(u)) ? PyUnicode_GET_LENGTH(u) : PyUnicode_GET_SIZE(u)))\n#else\n  #define CYTHON_PEP393_ENABLED 0\n  #define PyUnicode_1BYTE_KIND  1\n  #define PyUnicode_2BYTE_KIND  2\n  #define PyUnicode_4BYTE_KIND  4\n  #define __Pyx_PyUnicode_READY(op)       (0)\n  #define __Pyx_PyUnicode_GET_LENGTH(u)   PyUnicode_GET_SIZE(u)\n  #define __Pyx_PyUnicode_READ_CHAR(u, i) ((Py_UCS4)(PyUnicode_AS_UNICODE(u)[i]))\n  #define __Pyx_PyUnicode_MAX_CHAR_VALUE(u)   ((sizeof(Py_UNICODE) == 2) ? 65535 : 1114111)\n  #define __Pyx_PyUnicode_KIND(u)         (sizeof(Py_UNICODE))\n  #define __Pyx_PyUnicode_DATA(u)         ((void*)PyUnicode_AS_UNICODE(u))\n  #define __Pyx_PyUnicode_READ(k, d, i)   ((void)(k), (Py_UCS4)(((Py_UNICODE*)d)[i]))\n  #define __Pyx_PyUnicode_WRITE(k, d, i, ch)  (((void)(k)), ((Py_UNICODE*)d)[i] = ch)\n  #define __Pyx_PyUnicode_IS_TRUE(u)      (0 != PyUnicode_GET_SIZE(u))\n#endif\n#if CYTHON_COMPILING_IN_PYPY\n  #define __Pyx_PyUnicode_Concat(a, b)      PyNumber_Add(a, b)\n  #define __Pyx_PyUnicode_ConcatSafe(a, b)  PyNumber_Add(a, b)\n#else\n  #define __Pyx_PyUnicode_Concat(a, b)      PyUnicode_Concat(a, b)\n  #define __Pyx_PyUnicode_ConcatSafe(a, b)  ((unlikely((a) == Py_None) || unlikely((b) == Py_None)) ?\\\n      PyNumber_Add(a, b) : __Pyx_PyUnicode_Concat(a, b))\n#endif\n#if CYTHON_COMPILING_IN_PYPY && !defined(PyUnicode_Contains)\n  #define PyUnicode_Contains(u, s)  PySequence_Contains(u, s)\n#endif\n#if CYTHON_COMPILING_IN_PYPY && !defined(PyByteArray_Check)\n  #define PyByteArray_Check(obj)  PyObject_TypeCheck(obj, &PyByteArray_Type)\n#endif\n#if CYTHON_COMPILING_IN_PYPY && !defined(PyObject_Format)\n  #define PyObject_Format(obj, fmt)  PyObject_CallMethod(obj, \"__format__\", \"O\", fmt)\n#endif\n#define __Pyx_PyString_FormatSafe(a, b)   ((unlikely((a) == Py_None)) ? PyNumber_Remainder(a, b) : __Pyx_PyString_Format(a, b))\n#define __Pyx_PyUnicode_FormatSafe(a, b)  ((unlikely((a) == Py_None)) ? PyNumber_Remainder(a, b) : PyUnicode_Format(a, b))\n#if PY_MAJOR_VERSION >= 3\n  #define __Pyx_PyString_Format(a, b)  PyUnicode_Format(a, b)\n#else\n  #define __Pyx_PyString_Format(a, b)  PyString_Format(a, b)\n#endif\n#if PY_MAJOR_VERSION < 3 && !defined(PyObject_ASCII)\n  #define PyObject_ASCII(o)            PyObject_Repr(o)\n#endif\n#if PY_MAJOR_VERSION >= 3\n  #define PyBaseString_Type            PyUnicode_Type\n  #define PyStringObject               PyUnicodeObject\n  #define PyString_Type                PyUnicode_Type\n  #define PyString_Check               PyUnicode_Check\n  #define PyString_CheckExact          PyUnicode_CheckExact\n  #define PyObject_Unicode             PyObject_Str\n#endif\n#if PY_MAJOR_VERSION >= 3\n  #define __Pyx_PyBaseString_Check(obj) PyUnicode_Check(obj)\n  #define __Pyx_PyBaseString_CheckExact(obj) PyUnicode_CheckExact(obj)\n#else\n  #define __Pyx_PyBaseString_Check(obj) (PyString_Check(obj) || PyUnicode_Check(obj))\n  #define __Pyx_PyBaseString_CheckExact(obj) (PyString_CheckExact(obj) || PyUnicode_CheckExact(obj))\n#endif\n#ifndef PySet_CheckExact\n  #define PySet_CheckExact(obj)        (Py_TYPE(obj) == &PySet_Type)\n#endif\n#if CYTHON_ASSUME_SAFE_MACROS\n  #define __Pyx_PySequence_SIZE(seq)  Py_SIZE(seq)\n#else\n  #define __Pyx_PySequence_SIZE(seq)  PySequence_Size(seq)\n#endif\n#if PY_MAJOR_VERSION >= 3\n  #define PyIntObject                  PyLongObject\n  #define PyInt_Type                   PyLong_Type\n  #define PyInt_Check(op)              PyLong_Check(op)\n  #define PyInt_CheckExact(op)         PyLong_CheckExact(op)\n  #define PyInt_FromString             PyLong_FromString\n  #define PyInt_FromUnicode            PyLong_FromUnicode\n  #define PyInt_FromLong               PyLong_FromLong\n  #define PyInt_FromSize_t             PyLong_FromSize_t\n  #define PyInt_FromSsize_t            PyLong_FromSsize_t\n  #define PyInt_AsLong                 PyLong_AsLong\n  #define PyInt_AS_LONG                PyLong_AS_LONG\n  #define PyInt_AsSsize_t              PyLong_AsSsize_t\n  #define PyInt_AsUnsignedLongMask     PyLong_AsUnsignedLongMask\n  #define PyInt_AsUnsignedLongLongMask PyLong_AsUnsignedLongLongMask\n  #define PyNumber_Int                 PyNumber_Long\n#endif\n#if PY_MAJOR_VERSION >= 3\n  #define PyBoolObject                 PyLongObject\n#endif\n#if PY_MAJOR_VERSION >= 3 && CYTHON_COMPILING_IN_PYPY\n  #ifndef PyUnicode_InternFromString\n    #define PyUnicode_InternFromString(s) PyUnicode_FromString(s)\n  #endif\n#endif\n#if PY_VERSION_HEX < 0x030200A4\n  typedef long Py_hash_t;\n  #define __Pyx_PyInt_FromHash_t PyInt_FromLong\n  #define __Pyx_PyInt_AsHash_t   PyInt_AsLong\n#else\n  #define __Pyx_PyInt_FromHash_t PyInt_FromSsize_t\n  #define __Pyx_PyInt_AsHash_t   PyInt_AsSsize_t\n#endif\n#if PY_MAJOR_VERSION >= 3\n  #define __Pyx_PyMethod_New(func, self, klass) ((self) ? PyMethod_New(func, self) : (Py_INCREF(func), func))\n#else\n  #define __Pyx_PyMethod_New(func, self, klass) PyMethod_New(func, self, klass)\n#endif\n#if CYTHON_USE_ASYNC_SLOTS\n  #if PY_VERSION_HEX >= 0x030500B1\n    #define __Pyx_PyAsyncMethodsStruct PyAsyncMethods\n    #define __Pyx_PyType_AsAsync(obj) (Py_TYPE(obj)->tp_as_async)\n  #else\n    #define __Pyx_PyType_AsAsync(obj) ((__Pyx_PyAsyncMethodsStruct*) (Py_TYPE(obj)->tp_reserved))\n  #endif\n#else\n  #define __Pyx_PyType_AsAsync(obj) NULL\n#endif\n#ifndef __Pyx_PyAsyncMethodsStruct\n    typedef struct {\n        unaryfunc am_await;\n        unaryfunc am_aiter;\n        unaryfunc am_anext;\n    } __Pyx_PyAsyncMethodsStruct;\n#endif\n\n#if defined(WIN32) || defined(MS_WINDOWS)\n  #define _USE_MATH_DEFINES\n#endif\n#include <math.h>\n#ifdef NAN\n#define __PYX_NAN() ((float) NAN)\n#else\nstatic CYTHON_INLINE float __PYX_NAN() {\n  float value;\n  memset(&value, 0xFF, sizeof(value));\n  return value;\n}\n#endif\n#if defined(__CYGWIN__) && defined(_LDBL_EQ_DBL)\n#define __Pyx_truncl trunc\n#else\n#define __Pyx_truncl truncl\n#endif\n\n\n#define __PYX_ERR(f_index, lineno, Ln_error) \\\n{ \\\n  __pyx_filename = __pyx_f[f_index]; __pyx_lineno = lineno; __pyx_clineno = __LINE__; goto Ln_error; \\\n}\n\n#ifndef __PYX_EXTERN_C\n  #ifdef __cplusplus\n    #define __PYX_EXTERN_C extern \"C\"\n  #else\n    #define __PYX_EXTERN_C extern\n  #endif\n#endif\n\n#define __PYX_HAVE__pywrapfst\n#define __PYX_HAVE_API__pywrapfst\n/* Early includes */\n#include <stddef.h>\n#include <time.h>\n#include \"ios\"\n#include \"new\"\n#include \"stdexcept\"\n#include \"typeinfo\"\n#include <memory>\n#include <utility>\n#include <vector>\n#include <string.h>\n#include <string>\n#include <stdint.h>\n#include <iostream>\n#include <fstream>\n#include <sstream>\n#include <fst/util.h>\n#include <fst/fstlib.h>\n#include <fst/script/fstscript.h>\n#include <fst/script/getters.h>\n#include <fst/extensions/far/far.h>\n#include <fst/extensions/far/getters.h>\n#include <fst/extensions/far/far-class.h>\n#include <sys/types.h>\n#include <unistd.h>\n#ifdef _OPENMP\n#include <omp.h>\n#endif /* _OPENMP */\n\n#if defined(PYREX_WITHOUT_ASSERTIONS) && !defined(CYTHON_WITHOUT_ASSERTIONS)\n#define CYTHON_WITHOUT_ASSERTIONS\n#endif\n\ntypedef struct {PyObject **p; const char *s; const Py_ssize_t n; const char* encoding;\n                const char is_unicode; const char is_str; const char intern; } __Pyx_StringTabEntry;\n\n#define __PYX_DEFAULT_STRING_ENCODING_IS_ASCII 0\n#define __PYX_DEFAULT_STRING_ENCODING_IS_DEFAULT 0\n#define __PYX_DEFAULT_STRING_ENCODING \"\"\n#define __Pyx_PyObject_FromString __Pyx_PyBytes_FromString\n#define __Pyx_PyObject_FromStringAndSize __Pyx_PyBytes_FromStringAndSize\n#define __Pyx_uchar_cast(c) ((unsigned char)c)\n#define __Pyx_long_cast(x) ((long)x)\n#define __Pyx_fits_Py_ssize_t(v, type, is_signed)  (\\\n    (sizeof(type) < sizeof(Py_ssize_t))  ||\\\n    (sizeof(type) > sizeof(Py_ssize_t) &&\\\n          likely(v < (type)PY_SSIZE_T_MAX ||\\\n                 v == (type)PY_SSIZE_T_MAX)  &&\\\n          (!is_signed || likely(v > (type)PY_SSIZE_T_MIN ||\\\n                                v == (type)PY_SSIZE_T_MIN)))  ||\\\n    (sizeof(type) == sizeof(Py_ssize_t) &&\\\n          (is_signed || likely(v < (type)PY_SSIZE_T_MAX ||\\\n                               v == (type)PY_SSIZE_T_MAX)))  )\n#if defined (__cplusplus) && __cplusplus >= 201103L\n    #include <cstdlib>\n    #define __Pyx_sst_abs(value) std::abs(value)\n#elif SIZEOF_INT >= SIZEOF_SIZE_T\n    #define __Pyx_sst_abs(value) abs(value)\n#elif SIZEOF_LONG >= SIZEOF_SIZE_T\n    #define __Pyx_sst_abs(value) labs(value)\n#elif defined (_MSC_VER)\n    #define __Pyx_sst_abs(value) ((Py_ssize_t)_abs64(value))\n#elif defined (__STDC_VERSION__) && __STDC_VERSION__ >= 199901L\n    #define __Pyx_sst_abs(value) llabs(value)\n#elif defined (__GNUC__)\n    #define __Pyx_sst_abs(value) __builtin_llabs(value)\n#else\n    #define __Pyx_sst_abs(value) ((value<0) ? -value : value)\n#endif\nstatic CYTHON_INLINE const char* __Pyx_PyObject_AsString(PyObject*);\nstatic CYTHON_INLINE const char* __Pyx_PyObject_AsStringAndSize(PyObject*, Py_ssize_t* length);\n#define __Pyx_PyByteArray_FromString(s) PyByteArray_FromStringAndSize((const char*)s, strlen((const char*)s))\n#define __Pyx_PyByteArray_FromStringAndSize(s, l) PyByteArray_FromStringAndSize((const char*)s, l)\n#define __Pyx_PyBytes_FromString        PyBytes_FromString\n#define __Pyx_PyBytes_FromStringAndSize PyBytes_FromStringAndSize\nstatic CYTHON_INLINE PyObject* __Pyx_PyUnicode_FromString(const char*);\n#if PY_MAJOR_VERSION < 3\n    #define __Pyx_PyStr_FromString        __Pyx_PyBytes_FromString\n    #define __Pyx_PyStr_FromStringAndSize __Pyx_PyBytes_FromStringAndSize\n#else\n    #define __Pyx_PyStr_FromString        __Pyx_PyUnicode_FromString\n    #define __Pyx_PyStr_FromStringAndSize __Pyx_PyUnicode_FromStringAndSize\n#endif\n#define __Pyx_PyBytes_AsWritableString(s)     ((char*) PyBytes_AS_STRING(s))\n#define __Pyx_PyBytes_AsWritableSString(s)    ((signed char*) PyBytes_AS_STRING(s))\n#define __Pyx_PyBytes_AsWritableUString(s)    ((unsigned char*) PyBytes_AS_STRING(s))\n#define __Pyx_PyBytes_AsString(s)     ((const char*) PyBytes_AS_STRING(s))\n#define __Pyx_PyBytes_AsSString(s)    ((const signed char*) PyBytes_AS_STRING(s))\n#define __Pyx_PyBytes_AsUString(s)    ((const unsigned char*) PyBytes_AS_STRING(s))\n#define __Pyx_PyObject_AsWritableString(s)    ((char*) __Pyx_PyObject_AsString(s))\n#define __Pyx_PyObject_AsWritableSString(s)    ((signed char*) __Pyx_PyObject_AsString(s))\n#define __Pyx_PyObject_AsWritableUString(s)    ((unsigned char*) __Pyx_PyObject_AsString(s))\n#define __Pyx_PyObject_AsSString(s)    ((const signed char*) __Pyx_PyObject_AsString(s))\n#define __Pyx_PyObject_AsUString(s)    ((const unsigned char*) __Pyx_PyObject_AsString(s))\n#define __Pyx_PyObject_FromCString(s)  __Pyx_PyObject_FromString((const char*)s)\n#define __Pyx_PyBytes_FromCString(s)   __Pyx_PyBytes_FromString((const char*)s)\n#define __Pyx_PyByteArray_FromCString(s)   __Pyx_PyByteArray_FromString((const char*)s)\n#define __Pyx_PyStr_FromCString(s)     __Pyx_PyStr_FromString((const char*)s)\n#define __Pyx_PyUnicode_FromCString(s) __Pyx_PyUnicode_FromString((const char*)s)\nstatic CYTHON_INLINE size_t __Pyx_Py_UNICODE_strlen(const Py_UNICODE *u) {\n    const Py_UNICODE *u_end = u;\n    while (*u_end++) ;\n    return (size_t)(u_end - u - 1);\n}\n#define __Pyx_PyUnicode_FromUnicode(u)       PyUnicode_FromUnicode(u, __Pyx_Py_UNICODE_strlen(u))\n#define __Pyx_PyUnicode_FromUnicodeAndLength PyUnicode_FromUnicode\n#define __Pyx_PyUnicode_AsUnicode            PyUnicode_AsUnicode\n#define __Pyx_NewRef(obj) (Py_INCREF(obj), obj)\n#define __Pyx_Owned_Py_None(b) __Pyx_NewRef(Py_None)\nstatic CYTHON_INLINE PyObject * __Pyx_PyBool_FromLong(long b);\nstatic CYTHON_INLINE int __Pyx_PyObject_IsTrue(PyObject*);\nstatic CYTHON_INLINE PyObject* __Pyx_PyNumber_IntOrLong(PyObject* x);\n#define __Pyx_PySequence_Tuple(obj)\\\n    (likely(PyTuple_CheckExact(obj)) ? __Pyx_NewRef(obj) : PySequence_Tuple(obj))\nstatic CYTHON_INLINE Py_ssize_t __Pyx_PyIndex_AsSsize_t(PyObject*);\nstatic CYTHON_INLINE PyObject * __Pyx_PyInt_FromSize_t(size_t);\n#if CYTHON_ASSUME_SAFE_MACROS\n#define __pyx_PyFloat_AsDouble(x) (PyFloat_CheckExact(x) ? PyFloat_AS_DOUBLE(x) : PyFloat_AsDouble(x))\n#else\n#define __pyx_PyFloat_AsDouble(x) PyFloat_AsDouble(x)\n#endif\n#define __pyx_PyFloat_AsFloat(x) ((float) __pyx_PyFloat_AsDouble(x))\n#if PY_MAJOR_VERSION >= 3\n#define __Pyx_PyNumber_Int(x) (PyLong_CheckExact(x) ? __Pyx_NewRef(x) : PyNumber_Long(x))\n#else\n#define __Pyx_PyNumber_Int(x) (PyInt_CheckExact(x) ? __Pyx_NewRef(x) : PyNumber_Int(x))\n#endif\n#define __Pyx_PyNumber_Float(x) (PyFloat_CheckExact(x) ? __Pyx_NewRef(x) : PyNumber_Float(x))\n#if PY_MAJOR_VERSION < 3 && __PYX_DEFAULT_STRING_ENCODING_IS_ASCII\nstatic int __Pyx_sys_getdefaultencoding_not_ascii;\nstatic int __Pyx_init_sys_getdefaultencoding_params(void) {\n    PyObject* sys;\n    PyObject* default_encoding = NULL;\n    PyObject* ascii_chars_u = NULL;\n    PyObject* ascii_chars_b = NULL;\n    const char* default_encoding_c;\n    sys = PyImport_ImportModule(\"sys\");\n    if (!sys) goto bad;\n    default_encoding = PyObject_CallMethod(sys, (char*) \"getdefaultencoding\", NULL);\n    Py_DECREF(sys);\n    if (!default_encoding) goto bad;\n    default_encoding_c = PyBytes_AsString(default_encoding);\n    if (!default_encoding_c) goto bad;\n    if (strcmp(default_encoding_c, \"ascii\") == 0) {\n        __Pyx_sys_getdefaultencoding_not_ascii = 0;\n    } else {\n        char ascii_chars[128];\n        int c;\n        for (c = 0; c < 128; c++) {\n            ascii_chars[c] = c;\n        }\n        __Pyx_sys_getdefaultencoding_not_ascii = 1;\n        ascii_chars_u = PyUnicode_DecodeASCII(ascii_chars, 128, NULL);\n        if (!ascii_chars_u) goto bad;\n        ascii_chars_b = PyUnicode_AsEncodedString(ascii_chars_u, default_encoding_c, NULL);\n        if (!ascii_chars_b || !PyBytes_Check(ascii_chars_b) || memcmp(ascii_chars, PyBytes_AS_STRING(ascii_chars_b), 128) != 0) {\n            PyErr_Format(\n                PyExc_ValueError,\n                \"This module compiled with c_string_encoding=ascii, but default encoding '%.200s' is not a superset of ascii.\",\n                default_encoding_c);\n            goto bad;\n        }\n        Py_DECREF(ascii_chars_u);\n        Py_DECREF(ascii_chars_b);\n    }\n    Py_DECREF(default_encoding);\n    return 0;\nbad:\n    Py_XDECREF(default_encoding);\n    Py_XDECREF(ascii_chars_u);\n    Py_XDECREF(ascii_chars_b);\n    return -1;\n}\n#endif\n#if __PYX_DEFAULT_STRING_ENCODING_IS_DEFAULT && PY_MAJOR_VERSION >= 3\n#define __Pyx_PyUnicode_FromStringAndSize(c_str, size) PyUnicode_DecodeUTF8(c_str, size, NULL)\n#else\n#define __Pyx_PyUnicode_FromStringAndSize(c_str, size) PyUnicode_Decode(c_str, size, __PYX_DEFAULT_STRING_ENCODING, NULL)\n#if __PYX_DEFAULT_STRING_ENCODING_IS_DEFAULT\nstatic char* __PYX_DEFAULT_STRING_ENCODING;\nstatic int __Pyx_init_sys_getdefaultencoding_params(void) {\n    PyObject* sys;\n    PyObject* default_encoding = NULL;\n    char* default_encoding_c;\n    sys = PyImport_ImportModule(\"sys\");\n    if (!sys) goto bad;\n    default_encoding = PyObject_CallMethod(sys, (char*) (const char*) \"getdefaultencoding\", NULL);\n    Py_DECREF(sys);\n    if (!default_encoding) goto bad;\n    default_encoding_c = PyBytes_AsString(default_encoding);\n    if (!default_encoding_c) goto bad;\n    __PYX_DEFAULT_STRING_ENCODING = (char*) malloc(strlen(default_encoding_c));\n    if (!__PYX_DEFAULT_STRING_ENCODING) goto bad;\n    strcpy(__PYX_DEFAULT_STRING_ENCODING, default_encoding_c);\n    Py_DECREF(default_encoding);\n    return 0;\nbad:\n    Py_XDECREF(default_encoding);\n    return -1;\n}\n#endif\n#endif\n\n\n/* Test for GCC > 2.95 */\n#if defined(__GNUC__)     && (__GNUC__ > 2 || (__GNUC__ == 2 && (__GNUC_MINOR__ > 95)))\n  #define likely(x)   __builtin_expect(!!(x), 1)\n  #define unlikely(x) __builtin_expect(!!(x), 0)\n#else /* !__GNUC__ or GCC < 2.95 */\n  #define likely(x)   (x)\n  #define unlikely(x) (x)\n#endif /* __GNUC__ */\nstatic CYTHON_INLINE void __Pyx_pretend_to_initialize(void* ptr) { (void)ptr; }\n\nstatic PyObject *__pyx_m = NULL;\nstatic PyObject *__pyx_d;\nstatic PyObject *__pyx_b;\nstatic PyObject *__pyx_cython_runtime = NULL;\nstatic PyObject *__pyx_empty_tuple;\nstatic PyObject *__pyx_empty_bytes;\nstatic PyObject *__pyx_empty_unicode;\nstatic int __pyx_lineno;\nstatic int __pyx_clineno = 0;\nstatic const char * __pyx_cfilenm= __FILE__;\nstatic const char *__pyx_filename;\n\n\nstatic const char *__pyx_f[] = {\n  \"pywrapfst.pyx\",\n  \"stringsource\",\n};\n\n/* \"basictypes.pxd\":22\n * \n * \n * ctypedef int8_t int8             # <<<<<<<<<<<<<<\n * ctypedef int16_t int16\n * ctypedef int32_t int32\n */\ntypedef int8_t __pyx_t_10basictypes_int8;\n\n/* \"basictypes.pxd\":23\n * \n * ctypedef int8_t int8\n * ctypedef int16_t int16             # <<<<<<<<<<<<<<\n * ctypedef int32_t int32\n * ctypedef int64_t int64\n */\ntypedef int16_t __pyx_t_10basictypes_int16;\n\n/* \"basictypes.pxd\":24\n * ctypedef int8_t int8\n * ctypedef int16_t int16\n * ctypedef int32_t int32             # <<<<<<<<<<<<<<\n * ctypedef int64_t int64\n * ctypedef uint8_t uint8\n */\ntypedef int32_t __pyx_t_10basictypes_int32;\n\n/* \"basictypes.pxd\":25\n * ctypedef int16_t int16\n * ctypedef int32_t int32\n * ctypedef int64_t int64             # <<<<<<<<<<<<<<\n * ctypedef uint8_t uint8\n * ctypedef uint16_t uint16\n */\ntypedef int64_t __pyx_t_10basictypes_int64;\n\n/* \"basictypes.pxd\":26\n * ctypedef int32_t int32\n * ctypedef int64_t int64\n * ctypedef uint8_t uint8             # <<<<<<<<<<<<<<\n * ctypedef uint16_t uint16\n * ctypedef uint32_t uint32\n */\ntypedef uint8_t __pyx_t_10basictypes_uint8;\n\n/* \"basictypes.pxd\":27\n * ctypedef int64_t int64\n * ctypedef uint8_t uint8\n * ctypedef uint16_t uint16             # <<<<<<<<<<<<<<\n * ctypedef uint32_t uint32\n * ctypedef uint64_t uint64\n */\ntypedef uint16_t __pyx_t_10basictypes_uint16;\n\n/* \"basictypes.pxd\":28\n * ctypedef uint8_t uint8\n * ctypedef uint16_t uint16\n * ctypedef uint32_t uint32             # <<<<<<<<<<<<<<\n * ctypedef uint64_t uint64\n */\ntypedef uint32_t __pyx_t_10basictypes_uint32;\n\n/* \"basictypes.pxd\":29\n * ctypedef uint16_t uint16\n * ctypedef uint32_t uint32\n * ctypedef uint64_t uint64             # <<<<<<<<<<<<<<\n */\ntypedef uint64_t __pyx_t_10basictypes_uint64;\n\n/*--- Type declarations ---*/\nstruct __pyx_obj_9pywrapfst_Weight;\nstruct __pyx_obj_9pywrapfst__SymbolTable;\nstruct __pyx_obj_9pywrapfst__EncodeMapperSymbolTable;\nstruct __pyx_obj_9pywrapfst__FstSymbolTable;\nstruct __pyx_obj_9pywrapfst__MutableSymbolTable;\nstruct __pyx_obj_9pywrapfst__MutableFstSymbolTable;\nstruct __pyx_obj_9pywrapfst_SymbolTable;\nstruct __pyx_obj_9pywrapfst_SymbolTableIterator;\nstruct __pyx_obj_9pywrapfst_EncodeMapper;\nstruct __pyx_obj_9pywrapfst__Fst;\nstruct __pyx_obj_9pywrapfst__MutableFst;\nstruct __pyx_obj_9pywrapfst_Arc;\nstruct __pyx_obj_9pywrapfst_ArcIterator;\nstruct __pyx_obj_9pywrapfst_MutableArcIterator;\nstruct __pyx_obj_9pywrapfst_StateIterator;\nstruct __pyx_obj_9pywrapfst_Compiler;\nstruct __pyx_obj_9pywrapfst_FarReader;\nstruct __pyx_obj_9pywrapfst_FarWriter;\n\n/* \"fst.pxd\":496\n * \n * \n * ctypedef pair[int64, const FstClass *] LabelFstClassPair             # <<<<<<<<<<<<<<\n * \n * ctypedef pair[int64, int64] LabelPair\n */\ntypedef std::pair<__pyx_t_10basictypes_int64,fst::script::FstClass const *>  __pyx_t_3fst_LabelFstClassPair;\n\n/* \"fst.pxd\":498\n * ctypedef pair[int64, const FstClass *] LabelFstClassPair\n * \n * ctypedef pair[int64, int64] LabelPair             # <<<<<<<<<<<<<<\n * \n * \n */\ntypedef std::pair<__pyx_t_10basictypes_int64,__pyx_t_10basictypes_int64>  __pyx_t_3fst_LabelPair;\nstruct __pyx_opt_args_9pywrapfst_tostring;\nstruct __pyx_opt_args_9pywrapfst_weight_tostring;\nstruct __pyx_opt_args_9pywrapfst_19_MutableSymbolTable_add_symbol;\nstruct __pyx_opt_args_9pywrapfst_4_Fst_draw;\nstruct __pyx_opt_args_9pywrapfst_4_Fst_text;\nstruct __pyx_opt_args_9pywrapfst_11_MutableFst__arcsort;\nstruct __pyx_opt_args_9pywrapfst_11_MutableFst__closure;\nstruct __pyx_opt_args_9pywrapfst_11_MutableFst__delete_arcs;\nstruct __pyx_opt_args_9pywrapfst_11_MutableFst__delete_states;\nstruct __pyx_opt_args_9pywrapfst_11_MutableFst__minimize;\nstruct __pyx_opt_args_9pywrapfst_11_MutableFst__project;\nstruct __pyx_opt_args_9pywrapfst_11_MutableFst__prune;\nstruct __pyx_opt_args_9pywrapfst_11_MutableFst__push;\nstruct __pyx_opt_args_9pywrapfst_11_MutableFst__relabel_pairs;\nstruct __pyx_opt_args_9pywrapfst_11_MutableFst__relabel_tables;\nstruct __pyx_opt_args_9pywrapfst_11_MutableFst__reweight;\nstruct __pyx_opt_args_9pywrapfst_11_MutableFst__rmepsilon;\nstruct __pyx_opt_args_9pywrapfst_11_MutableFst__set_final;\nstruct __pyx_opt_args_9pywrapfst__create_Fst;\nstruct __pyx_opt_args_9pywrapfst__map;\nstruct __pyx_opt_args_9pywrapfst_arcmap;\nstruct __pyx_opt_args_9pywrapfst_compose;\nstruct __pyx_opt_args_9pywrapfst_convert;\nstruct __pyx_opt_args_9pywrapfst_determinize;\nstruct __pyx_opt_args_9pywrapfst_difference;\nstruct __pyx_opt_args_9pywrapfst_disambiguate;\nstruct __pyx_opt_args_9pywrapfst_epsnormalize;\nstruct __pyx_opt_args_9pywrapfst_equal;\nstruct __pyx_opt_args_9pywrapfst_equivalent;\nstruct __pyx_opt_args_9pywrapfst_intersect;\nstruct __pyx_opt_args_9pywrapfst_isomorphic;\nstruct __pyx_opt_args_9pywrapfst_prune;\nstruct __pyx_opt_args_9pywrapfst_push;\nstruct __pyx_opt_args_9pywrapfst_randequivalent;\nstruct __pyx_opt_args_9pywrapfst_randgen;\nstruct __pyx_opt_args_9pywrapfst_replace;\nstruct __pyx_opt_args_9pywrapfst_reverse;\nstruct __pyx_opt_args_9pywrapfst__shortestdistance;\nstruct __pyx_opt_args_9pywrapfst_shortestpath;\n\n/* \"pywrapfst.pxd\":41\n * \n * \n * cdef string tostring(data, encoding=?) except *             # <<<<<<<<<<<<<<\n * \n * cdef string weight_tostring(data, encoding=?) except *\n */\nstruct __pyx_opt_args_9pywrapfst_tostring {\n  int __pyx_n;\n  PyObject *encoding;\n};\n\n/* \"pywrapfst.pxd\":43\n * cdef string tostring(data, encoding=?) except *\n * \n * cdef string weight_tostring(data, encoding=?) except *             # <<<<<<<<<<<<<<\n * \n * cdef fst.ComposeFilter _get_compose_filter(\n */\nstruct __pyx_opt_args_9pywrapfst_weight_tostring {\n  int __pyx_n;\n  PyObject *encoding;\n};\n\n/* \"pywrapfst.pxd\":99\n * # SymbolTable.\n * \n * ctypedef fst.SymbolTable * SymbolTable_ptr             # <<<<<<<<<<<<<<\n * \n * \n */\ntypedef fst::SymbolTable *__pyx_t_9pywrapfst_SymbolTable_ptr;\n\n/* \"pywrapfst.pxd\":139\n * cdef class _MutableSymbolTable(_SymbolTable):\n * \n *   cpdef int64 add_symbol(self, symbol, int64 key=?)             # <<<<<<<<<<<<<<\n * \n *   cpdef void add_table(self, _SymbolTable syms)\n */\nstruct __pyx_opt_args_9pywrapfst_19_MutableSymbolTable_add_symbol {\n  int __pyx_n;\n  __pyx_t_10basictypes_int64 key;\n};\n\n/* \"pywrapfst.pxd\":215\n * \n * \n * ctypedef fst.FstClass * FstClass_ptr             # <<<<<<<<<<<<<<\n * ctypedef fst.MutableFstClass * MutableFstClass_ptr\n * ctypedef fst.VectorFstClass * VectorFstClass_ptr\n */\ntypedef fst::script::FstClass *__pyx_t_9pywrapfst_FstClass_ptr;\n\n/* \"pywrapfst.pxd\":216\n * \n * ctypedef fst.FstClass * FstClass_ptr\n * ctypedef fst.MutableFstClass * MutableFstClass_ptr             # <<<<<<<<<<<<<<\n * ctypedef fst.VectorFstClass * VectorFstClass_ptr\n * \n */\ntypedef fst::script::MutableFstClass *__pyx_t_9pywrapfst_MutableFstClass_ptr;\n\n/* \"pywrapfst.pxd\":217\n * ctypedef fst.FstClass * FstClass_ptr\n * ctypedef fst.MutableFstClass * MutableFstClass_ptr\n * ctypedef fst.VectorFstClass * VectorFstClass_ptr             # <<<<<<<<<<<<<<\n * \n * \n */\ntypedef fst::script::VectorFstClass *__pyx_t_9pywrapfst_VectorFstClass_ptr;\n\n/* \"pywrapfst.pxd\":230\n *   cpdef _Fst copy(self)\n * \n *   cpdef void draw(self, filename, _SymbolTable isymbols=?,             # <<<<<<<<<<<<<<\n *                   _SymbolTable osymbols=?, SymbolTable ssymbols=?,\n *                   bool acceptor=?, title=?, double width=?,\n */\nstruct __pyx_opt_args_9pywrapfst_4_Fst_draw {\n  int __pyx_n;\n  struct __pyx_obj_9pywrapfst__SymbolTable *isymbols;\n  struct __pyx_obj_9pywrapfst__SymbolTable *osymbols;\n  struct __pyx_obj_9pywrapfst_SymbolTable *ssymbols;\n  bool acceptor;\n  PyObject *title;\n  double width;\n  double height;\n  bool portrait;\n  bool vertical;\n  double ranksep;\n  double nodesep;\n  __pyx_t_10basictypes_int32 fontsize;\n  __pyx_t_10basictypes_int32 precision;\n  PyObject *float_format;\n  bool show_weight_one;\n};\n\n/* \"pywrapfst.pxd\":258\n *   cpdef StateIterator states(self)\n * \n *   cpdef string text(self, _SymbolTable isymbols=?, _SymbolTable osymbols=?,             # <<<<<<<<<<<<<<\n *                     _SymbolTable ssymbols=?, bool acceptor=?,\n *                     bool show_weight_one=?, missing_sym=?)\n */\nstruct __pyx_opt_args_9pywrapfst_4_Fst_text {\n  int __pyx_n;\n  struct __pyx_obj_9pywrapfst__SymbolTable *isymbols;\n  struct __pyx_obj_9pywrapfst__SymbolTable *osymbols;\n  struct __pyx_obj_9pywrapfst__SymbolTable *ssymbols;\n  bool acceptor;\n  bool show_weight_one;\n  PyObject *missing_sym;\n};\n\n/* \"pywrapfst.pxd\":281\n *   cpdef int64 add_state(self) except *\n * \n *   cdef void _arcsort(self, sort_type=?) except *             # <<<<<<<<<<<<<<\n * \n *   cdef void _closure(self, bool closure_plus=?) except *\n */\nstruct __pyx_opt_args_9pywrapfst_11_MutableFst__arcsort {\n  int __pyx_n;\n  PyObject *sort_type;\n};\n\n/* \"pywrapfst.pxd\":283\n *   cdef void _arcsort(self, sort_type=?) except *\n * \n *   cdef void _closure(self, bool closure_plus=?) except *             # <<<<<<<<<<<<<<\n * \n *   cdef void _concat(self, _Fst ifst) except *\n */\nstruct __pyx_opt_args_9pywrapfst_11_MutableFst__closure {\n  int __pyx_n;\n  bool closure_plus;\n};\n\n/* \"pywrapfst.pxd\":291\n *   cdef void _decode(self, EncodeMapper) except *\n * \n *   cdef void _delete_arcs(self, int64 state, size_t n=?) except *             # <<<<<<<<<<<<<<\n * \n *   cdef void _delete_states(self, states=?) except *\n */\nstruct __pyx_opt_args_9pywrapfst_11_MutableFst__delete_arcs {\n  int __pyx_n;\n  size_t n;\n};\n\n/* \"pywrapfst.pxd\":293\n *   cdef void _delete_arcs(self, int64 state, size_t n=?) except *\n * \n *   cdef void _delete_states(self, states=?) except *             # <<<<<<<<<<<<<<\n * \n *   cdef void _encode(self, EncodeMapper) except *\n */\nstruct __pyx_opt_args_9pywrapfst_11_MutableFst__delete_states {\n  int __pyx_n;\n  PyObject *states;\n};\n\n/* \"pywrapfst.pxd\":299\n *   cdef void _invert(self) except *\n * \n *   cdef void _minimize(self, float delta=?, bool allow_nondet=?) except *             # <<<<<<<<<<<<<<\n * \n *   cpdef MutableArcIterator mutable_arcs(self, int64 state)\n */\nstruct __pyx_opt_args_9pywrapfst_11_MutableFst__minimize {\n  int __pyx_n;\n  float delta;\n  bool allow_nondet;\n};\n\n/* \"pywrapfst.pxd\":305\n *   cpdef int64 num_states(self)\n * \n *   cdef void _project(self, bool project_output=?) except *             # <<<<<<<<<<<<<<\n * \n *   cdef void _prune(self, float delta=?, int64 nstate=?, weight=?) except *\n */\nstruct __pyx_opt_args_9pywrapfst_11_MutableFst__project {\n  int __pyx_n;\n  bool project_output;\n};\n\n/* \"pywrapfst.pxd\":307\n *   cdef void _project(self, bool project_output=?) except *\n * \n *   cdef void _prune(self, float delta=?, int64 nstate=?, weight=?) except *             # <<<<<<<<<<<<<<\n * \n *   cdef void _push(self, float delta=?, bool remove_total_weight=?,\n */\nstruct __pyx_opt_args_9pywrapfst_11_MutableFst__prune {\n  int __pyx_n;\n  float delta;\n  __pyx_t_10basictypes_int64 nstate;\n  PyObject *weight;\n};\n\n/* \"pywrapfst.pxd\":309\n *   cdef void _prune(self, float delta=?, int64 nstate=?, weight=?) except *\n * \n *   cdef void _push(self, float delta=?, bool remove_total_weight=?,             # <<<<<<<<<<<<<<\n *                   bool to_final=?) except *\n * \n */\nstruct __pyx_opt_args_9pywrapfst_11_MutableFst__push {\n  int __pyx_n;\n  float delta;\n  bool remove_total_weight;\n  bool to_final;\n};\n\n/* \"pywrapfst.pxd\":312\n *                   bool to_final=?) except *\n * \n *   cdef void _relabel_pairs(self, ipairs=?, opairs=?) except *             # <<<<<<<<<<<<<<\n * \n *   cdef void _relabel_tables(self, _SymbolTable old_isymbols=?,\n */\nstruct __pyx_opt_args_9pywrapfst_11_MutableFst__relabel_pairs {\n  int __pyx_n;\n  PyObject *ipairs;\n  PyObject *opairs;\n};\n\n/* \"pywrapfst.pxd\":314\n *   cdef void _relabel_pairs(self, ipairs=?, opairs=?) except *\n * \n *   cdef void _relabel_tables(self, _SymbolTable old_isymbols=?,             # <<<<<<<<<<<<<<\n *       _SymbolTable new_isymbols=?, unknown_isymbol=?,\n *       bool attach_new_isymbols=?,\n */\nstruct __pyx_opt_args_9pywrapfst_11_MutableFst__relabel_tables {\n  int __pyx_n;\n  struct __pyx_obj_9pywrapfst__SymbolTable *old_isymbols;\n  struct __pyx_obj_9pywrapfst__SymbolTable *new_isymbols;\n  PyObject *unknown_isymbol;\n  bool attach_new_isymbols;\n  struct __pyx_obj_9pywrapfst__SymbolTable *old_osymbols;\n  struct __pyx_obj_9pywrapfst__SymbolTable *new_osymbols;\n  PyObject *unknown_osymbol;\n  bool attach_new_osymbols;\n};\n\n/* \"pywrapfst.pxd\":324\n *   cdef void _reserve_states(self, int64 n) except *\n * \n *   cdef void _reweight(self, potentials, bool to_final=?) except *             # <<<<<<<<<<<<<<\n * \n *   cdef void _rmepsilon(self, queue_type=?, bool connect=?, weight=?,\n */\nstruct __pyx_opt_args_9pywrapfst_11_MutableFst__reweight {\n  int __pyx_n;\n  bool to_final;\n};\n\n/* \"pywrapfst.pxd\":326\n *   cdef void _reweight(self, potentials, bool to_final=?) except *\n * \n *   cdef void _rmepsilon(self, queue_type=?, bool connect=?, weight=?,             # <<<<<<<<<<<<<<\n *                        int64 nstate=?, float delta=?) except *\n * \n */\nstruct __pyx_opt_args_9pywrapfst_11_MutableFst__rmepsilon {\n  int __pyx_n;\n  PyObject *queue_type;\n  bool connect;\n  PyObject *weight;\n  __pyx_t_10basictypes_int64 nstate;\n  float delta;\n};\n\n/* \"pywrapfst.pxd\":329\n *                        int64 nstate=?, float delta=?) except *\n * \n *   cdef void _set_final(self, int64 state, weight=?) except *             # <<<<<<<<<<<<<<\n * \n *   cdef void _set_properties(self, uint64 props, uint64 mask)\n */\nstruct __pyx_opt_args_9pywrapfst_11_MutableFst__set_final {\n  int __pyx_n;\n  PyObject *weight;\n};\n\n/* \"pywrapfst.pxd\":353\n * cdef _Fst _init_XFst(FstClass_ptr tfst)\n * \n * cdef _MutableFst _create_Fst(arc_type=?)             # <<<<<<<<<<<<<<\n * \n * cpdef _Fst _read(filename)\n */\nstruct __pyx_opt_args_9pywrapfst__create_Fst {\n  int __pyx_n;\n  PyObject *arc_type;\n};\n\n/* \"pywrapfst.pxd\":436\n * \n * \n * cdef _Fst _map(_Fst ifst, float delta=?, map_type=?, double power=?, weight=?)             # <<<<<<<<<<<<<<\n * \n * cpdef _Fst arcmap(_Fst ifst, float delta=?, map_type=?, double power=?, weight=?)\n */\nstruct __pyx_opt_args_9pywrapfst__map {\n  int __pyx_n;\n  float delta;\n  PyObject *map_type;\n  double power;\n  PyObject *weight;\n};\n\n/* \"pywrapfst.pxd\":438\n * cdef _Fst _map(_Fst ifst, float delta=?, map_type=?, double power=?, weight=?)\n * \n * cpdef _Fst arcmap(_Fst ifst, float delta=?, map_type=?, double power=?, weight=?)             # <<<<<<<<<<<<<<\n * \n * cpdef _MutableFst compose(_Fst ifst1, _Fst ifst2, compose_filter=?,\n */\nstruct __pyx_opt_args_9pywrapfst_arcmap {\n  int __pyx_n;\n  float delta;\n  PyObject *map_type;\n  double power;\n  PyObject *weight;\n};\n\n/* \"pywrapfst.pxd\":440\n * cpdef _Fst arcmap(_Fst ifst, float delta=?, map_type=?, double power=?, weight=?)\n * \n * cpdef _MutableFst compose(_Fst ifst1, _Fst ifst2, compose_filter=?,             # <<<<<<<<<<<<<<\n *                           bool connect=?)\n * \n */\nstruct __pyx_opt_args_9pywrapfst_compose {\n  int __pyx_n;\n  PyObject *compose_filter;\n  bool connect;\n};\n\n/* \"pywrapfst.pxd\":443\n *                           bool connect=?)\n * \n * cpdef _Fst convert(_Fst ifst, fst_type=?)             # <<<<<<<<<<<<<<\n * \n * cpdef _MutableFst determinize(_Fst ifst, float delta=?, det_type=?,\n */\nstruct __pyx_opt_args_9pywrapfst_convert {\n  int __pyx_n;\n  PyObject *fst_type;\n};\n\n/* \"pywrapfst.pxd\":445\n * cpdef _Fst convert(_Fst ifst, fst_type=?)\n * \n * cpdef _MutableFst determinize(_Fst ifst, float delta=?, det_type=?,             # <<<<<<<<<<<<<<\n *                               int64 nstate=?, int64 subsequential_label=?,\n *                               weight=?, bool increment_subsequential_label=?)\n */\nstruct __pyx_opt_args_9pywrapfst_determinize {\n  int __pyx_n;\n  float delta;\n  PyObject *det_type;\n  __pyx_t_10basictypes_int64 nstate;\n  __pyx_t_10basictypes_int64 subsequential_label;\n  PyObject *weight;\n  bool increment_subsequential_label;\n};\n\n/* \"pywrapfst.pxd\":449\n *                               weight=?, bool increment_subsequential_label=?)\n * \n * cpdef _MutableFst difference(_Fst ifst1, _Fst ifst2, compose_filter=?,             # <<<<<<<<<<<<<<\n *                              bool connect=?)\n * \n */\nstruct __pyx_opt_args_9pywrapfst_difference {\n  int __pyx_n;\n  PyObject *compose_filter;\n  bool connect;\n};\n\n/* \"pywrapfst.pxd\":452\n *                              bool connect=?)\n * \n * cpdef _MutableFst disambiguate(_Fst ifst, float delta=?, int64 nstate=?,             # <<<<<<<<<<<<<<\n *                                int64 subsequential_label=?, weight=?)\n * \n */\nstruct __pyx_opt_args_9pywrapfst_disambiguate {\n  int __pyx_n;\n  float delta;\n  __pyx_t_10basictypes_int64 nstate;\n  __pyx_t_10basictypes_int64 subsequential_label;\n  PyObject *weight;\n};\n\n/* \"pywrapfst.pxd\":455\n *                                int64 subsequential_label=?, weight=?)\n * \n * cpdef _MutableFst epsnormalize(_Fst ifst, bool eps_norm_output=?)             # <<<<<<<<<<<<<<\n * \n * cpdef bool equal(_Fst ifst1, _Fst ifst2, float delta=?)\n */\nstruct __pyx_opt_args_9pywrapfst_epsnormalize {\n  int __pyx_n;\n  bool eps_norm_output;\n};\n\n/* \"pywrapfst.pxd\":457\n * cpdef _MutableFst epsnormalize(_Fst ifst, bool eps_norm_output=?)\n * \n * cpdef bool equal(_Fst ifst1, _Fst ifst2, float delta=?)             # <<<<<<<<<<<<<<\n * \n * cpdef bool equivalent(_Fst ifst1, _Fst ifst2, float delta=?) except *\n */\nstruct __pyx_opt_args_9pywrapfst_equal {\n  int __pyx_n;\n  float delta;\n};\n\n/* \"pywrapfst.pxd\":459\n * cpdef bool equal(_Fst ifst1, _Fst ifst2, float delta=?)\n * \n * cpdef bool equivalent(_Fst ifst1, _Fst ifst2, float delta=?) except *             # <<<<<<<<<<<<<<\n * \n * cpdef _MutableFst intersect(_Fst ifst1, _Fst ifst2, compose_filter=?,\n */\nstruct __pyx_opt_args_9pywrapfst_equivalent {\n  int __pyx_n;\n  float delta;\n};\n\n/* \"pywrapfst.pxd\":461\n * cpdef bool equivalent(_Fst ifst1, _Fst ifst2, float delta=?) except *\n * \n * cpdef _MutableFst intersect(_Fst ifst1, _Fst ifst2, compose_filter=?,             # <<<<<<<<<<<<<<\n *                             bool connect=?)\n * \n */\nstruct __pyx_opt_args_9pywrapfst_intersect {\n  int __pyx_n;\n  PyObject *compose_filter;\n  bool connect;\n};\n\n/* \"pywrapfst.pxd\":464\n *                             bool connect=?)\n * \n * cpdef bool isomorphic(_Fst ifst1, _Fst ifst2, float delta=?)             # <<<<<<<<<<<<<<\n * \n * cpdef _MutableFst prune(_Fst ifst, float delta=?, int64 nstate=?,\n */\nstruct __pyx_opt_args_9pywrapfst_isomorphic {\n  int __pyx_n;\n  float delta;\n};\n\n/* \"pywrapfst.pxd\":466\n * cpdef bool isomorphic(_Fst ifst1, _Fst ifst2, float delta=?)\n * \n * cpdef _MutableFst prune(_Fst ifst, float delta=?, int64 nstate=?,             # <<<<<<<<<<<<<<\n *                         weight=?)\n * \n */\nstruct __pyx_opt_args_9pywrapfst_prune {\n  int __pyx_n;\n  float delta;\n  __pyx_t_10basictypes_int64 nstate;\n  PyObject *weight;\n};\n\n/* \"pywrapfst.pxd\":469\n *                         weight=?)\n * \n * cpdef _MutableFst push(_Fst ifst, float delta=?, bool push_weights=?,             # <<<<<<<<<<<<<<\n *                        bool push_labels=?, bool remove_common_affix=?,\n *                        bool remove_total_weight=?, bool to_final=?)\n */\nstruct __pyx_opt_args_9pywrapfst_push {\n  int __pyx_n;\n  float delta;\n  bool push_weights;\n  bool push_labels;\n  bool remove_common_affix;\n  bool remove_total_weight;\n  bool to_final;\n};\n\n/* \"pywrapfst.pxd\":473\n *                        bool remove_total_weight=?, bool to_final=?)\n * \n * cpdef bool randequivalent(_Fst ifst1, _Fst ifst2, int32 npath=?,             # <<<<<<<<<<<<<<\n *                           float delta=?, time_t seed=?, select=?,\n *                           int32 max_length=?) except *\n */\nstruct __pyx_opt_args_9pywrapfst_randequivalent {\n  int __pyx_n;\n  __pyx_t_10basictypes_int32 npath;\n  float delta;\n  time_t seed;\n  PyObject *select;\n  __pyx_t_10basictypes_int32 max_length;\n};\n\n/* \"pywrapfst.pxd\":477\n *                           int32 max_length=?) except *\n * \n * cpdef _MutableFst randgen(_Fst ifst, int32 npath=?, time_t seed=?,             # <<<<<<<<<<<<<<\n *                           select=?, int32 max_length=?,\n *                           bool remove_total_weight=?, bool weighted=?)\n */\nstruct __pyx_opt_args_9pywrapfst_randgen {\n  int __pyx_n;\n  __pyx_t_10basictypes_int32 npath;\n  time_t seed;\n  PyObject *select;\n  __pyx_t_10basictypes_int32 max_length;\n  bool remove_total_weight;\n  bool weighted;\n};\n\n/* \"pywrapfst.pxd\":484\n *     bool epsilon_on_replace) except *\n * \n * cpdef _MutableFst replace(pairs, call_arc_labeling=?, return_arc_labeling=?,             # <<<<<<<<<<<<<<\n *                           bool epsilon_on_replace=?, int64 return_label=?)\n * \n */\nstruct __pyx_opt_args_9pywrapfst_replace {\n  int __pyx_n;\n  PyObject *call_arc_labeling;\n  PyObject *return_arc_labeling;\n  bool epsilon_on_replace;\n  __pyx_t_10basictypes_int64 return_label;\n};\n\n/* \"pywrapfst.pxd\":487\n *                           bool epsilon_on_replace=?, int64 return_label=?)\n * \n * cpdef _MutableFst reverse(_Fst ifst, bool require_superinitial=?)             # <<<<<<<<<<<<<<\n * \n * cdef vector[fst.WeightClass] *_shortestdistance(_Fst ifst, float delta=?,\n */\nstruct __pyx_opt_args_9pywrapfst_reverse {\n  int __pyx_n;\n  bool require_superinitial;\n};\n\n/* \"pywrapfst.pxd\":489\n * cpdef _MutableFst reverse(_Fst ifst, bool require_superinitial=?)\n * \n * cdef vector[fst.WeightClass] *_shortestdistance(_Fst ifst, float delta=?,             # <<<<<<<<<<<<<<\n *                                                 int64 nstate=?, queue_type=?,\n *                                                 bool reverse=?) except *\n */\nstruct __pyx_opt_args_9pywrapfst__shortestdistance {\n  int __pyx_n;\n  float delta;\n  __pyx_t_10basictypes_int64 nstate;\n  PyObject *queue_type;\n  bool reverse;\n};\n\n/* \"pywrapfst.pxd\":493\n *                                                 bool reverse=?) except *\n * \n * cpdef _MutableFst shortestpath(_Fst ifst, float delta=?, int32 nshortest=?,             # <<<<<<<<<<<<<<\n *                                int64 nstate=?, queue_type=?, bool unique=?,\n *                                weight=?)\n */\nstruct __pyx_opt_args_9pywrapfst_shortestpath {\n  int __pyx_n;\n  float delta;\n  __pyx_t_10basictypes_int32 nshortest;\n  __pyx_t_10basictypes_int64 nstate;\n  PyObject *queue_type;\n  bool unique;\n  PyObject *weight;\n};\n\n/* \"pywrapfst.pxd\":69\n * \n * \n * cdef class Weight(object):             # <<<<<<<<<<<<<<\n * \n *   cdef unique_ptr[fst.WeightClass] _weight\n */\nstruct __pyx_obj_9pywrapfst_Weight {\n  PyObject_HEAD\n  struct __pyx_vtabstruct_9pywrapfst_Weight *__pyx_vtab;\n  std::unique_ptr<fst::script::WeightClass>  _weight;\n};\n\n\n/* \"pywrapfst.pxd\":102\n * \n * \n * cdef class _SymbolTable(object):             # <<<<<<<<<<<<<<\n * \n *   cdef fst.SymbolTable *_table\n */\nstruct __pyx_obj_9pywrapfst__SymbolTable {\n  PyObject_HEAD\n  struct __pyx_vtabstruct_9pywrapfst__SymbolTable *__pyx_vtab;\n  fst::SymbolTable *_table;\n};\n\n\n/* \"pywrapfst.pxd\":127\n * \n * \n * cdef class _EncodeMapperSymbolTable(_SymbolTable):             # <<<<<<<<<<<<<<\n * \n *   cdef shared_ptr[fst.EncodeMapperClass] _encoder\n */\nstruct __pyx_obj_9pywrapfst__EncodeMapperSymbolTable {\n  struct __pyx_obj_9pywrapfst__SymbolTable __pyx_base;\n  std::shared_ptr<fst::script::EncodeMapperClass>  _encoder;\n};\n\n\n/* \"pywrapfst.pxd\":132\n * \n * \n * cdef class _FstSymbolTable(_SymbolTable):             # <<<<<<<<<<<<<<\n * \n *   cdef shared_ptr[fst.FstClass] _fst\n */\nstruct __pyx_obj_9pywrapfst__FstSymbolTable {\n  struct __pyx_obj_9pywrapfst__SymbolTable __pyx_base;\n  std::shared_ptr<fst::script::FstClass>  _fst;\n};\n\n\n/* \"pywrapfst.pxd\":137\n * \n * \n * cdef class _MutableSymbolTable(_SymbolTable):             # <<<<<<<<<<<<<<\n * \n *   cpdef int64 add_symbol(self, symbol, int64 key=?)\n */\nstruct __pyx_obj_9pywrapfst__MutableSymbolTable {\n  struct __pyx_obj_9pywrapfst__SymbolTable __pyx_base;\n};\n\n\n/* \"pywrapfst.pxd\":146\n * \n * \n * cdef class _MutableFstSymbolTable(_MutableSymbolTable):             # <<<<<<<<<<<<<<\n * \n *   cdef shared_ptr[fst.MutableFstClass] _mfst\n */\nstruct __pyx_obj_9pywrapfst__MutableFstSymbolTable {\n  struct __pyx_obj_9pywrapfst__MutableSymbolTable __pyx_base;\n  std::shared_ptr<fst::script::MutableFstClass>  _mfst;\n};\n\n\n/* \"pywrapfst.pxd\":151\n * \n * \n * cdef class SymbolTable(_MutableSymbolTable):             # <<<<<<<<<<<<<<\n * \n *   cdef unique_ptr[fst.SymbolTable] _smart_table\n */\nstruct __pyx_obj_9pywrapfst_SymbolTable {\n  struct __pyx_obj_9pywrapfst__MutableSymbolTable __pyx_base;\n  std::unique_ptr<fst::SymbolTable>  _smart_table;\n};\n\n\n/* \"pywrapfst.pxd\":172\n * \n * \n * cdef class SymbolTableIterator(object):             # <<<<<<<<<<<<<<\n * \n *   cdef shared_ptr[fst.SymbolTable] _table\n */\nstruct __pyx_obj_9pywrapfst_SymbolTableIterator {\n  PyObject_HEAD\n  struct __pyx_vtabstruct_9pywrapfst_SymbolTableIterator *__pyx_vtab;\n  std::shared_ptr<fst::SymbolTable>  _table;\n  std::unique_ptr<fst::SymbolTableIterator>  _siter;\n};\n\n\n/* \"pywrapfst.pxd\":191\n * \n * \n * cdef class EncodeMapper(object):             # <<<<<<<<<<<<<<\n * \n *   cdef shared_ptr[fst.EncodeMapperClass] _encoder\n */\nstruct __pyx_obj_9pywrapfst_EncodeMapper {\n  PyObject_HEAD\n  struct __pyx_vtabstruct_9pywrapfst_EncodeMapper *__pyx_vtab;\n  std::shared_ptr<fst::script::EncodeMapperClass>  _encoder;\n};\n\n\n/* \"pywrapfst.pxd\":220\n * \n * \n * cdef class _Fst(object):             # <<<<<<<<<<<<<<\n * \n *   cdef shared_ptr[fst.FstClass] _fst\n */\nstruct __pyx_obj_9pywrapfst__Fst {\n  PyObject_HEAD\n  struct __pyx_vtabstruct_9pywrapfst__Fst *__pyx_vtab;\n  std::shared_ptr<fst::script::FstClass>  _fst;\n};\n\n\n/* \"pywrapfst.pxd\":271\n * \n * \n * cdef class _MutableFst(_Fst):             # <<<<<<<<<<<<<<\n * \n *   cdef shared_ptr[fst.MutableFstClass] _mfst\n */\nstruct __pyx_obj_9pywrapfst__MutableFst {\n  struct __pyx_obj_9pywrapfst__Fst __pyx_base;\n  std::shared_ptr<fst::script::MutableFstClass>  _mfst;\n};\n\n\n/* \"pywrapfst.pxd\":363\n * \n * \n * cdef class Arc(object):             # <<<<<<<<<<<<<<\n * \n *   cdef unique_ptr[fst.ArcClass] _arc\n */\nstruct __pyx_obj_9pywrapfst_Arc {\n  PyObject_HEAD\n  struct __pyx_vtabstruct_9pywrapfst_Arc *__pyx_vtab;\n  std::unique_ptr<fst::script::ArcClass>  _arc;\n};\n\n\n/* \"pywrapfst.pxd\":373\n * \n * \n * cdef class ArcIterator(object):             # <<<<<<<<<<<<<<\n * \n *   cdef shared_ptr[fst.FstClass] _fst\n */\nstruct __pyx_obj_9pywrapfst_ArcIterator {\n  PyObject_HEAD\n  struct __pyx_vtabstruct_9pywrapfst_ArcIterator *__pyx_vtab;\n  std::shared_ptr<fst::script::FstClass>  _fst;\n  std::unique_ptr<fst::script::ArcIteratorClass>  _aiter;\n};\n\n\n/* \"pywrapfst.pxd\":395\n * \n * \n * cdef class MutableArcIterator(object):             # <<<<<<<<<<<<<<\n * \n *   cdef shared_ptr[fst.MutableFstClass] _mfst\n */\nstruct __pyx_obj_9pywrapfst_MutableArcIterator {\n  PyObject_HEAD\n  struct __pyx_vtabstruct_9pywrapfst_MutableArcIterator *__pyx_vtab;\n  std::shared_ptr<fst::script::MutableFstClass>  _mfst;\n  std::unique_ptr<fst::script::MutableArcIteratorClass>  _aiter;\n};\n\n\n/* \"pywrapfst.pxd\":419\n * \n * \n * cdef class StateIterator(object):             # <<<<<<<<<<<<<<\n * \n *   cdef shared_ptr[fst.FstClass] _fst\n */\nstruct __pyx_obj_9pywrapfst_StateIterator {\n  PyObject_HEAD\n  struct __pyx_vtabstruct_9pywrapfst_StateIterator *__pyx_vtab;\n  std::shared_ptr<fst::script::FstClass>  _fst;\n  std::unique_ptr<fst::script::StateIteratorClass>  _siter;\n};\n\n\n/* \"pywrapfst.pxd\":505\n * \n * \n * cdef class Compiler(object):             # <<<<<<<<<<<<<<\n * \n *   cdef unique_ptr[stringstream] _sstrm\n */\nstruct __pyx_obj_9pywrapfst_Compiler {\n  PyObject_HEAD\n  struct __pyx_vtabstruct_9pywrapfst_Compiler *__pyx_vtab;\n  std::unique_ptr<std::stringstream>  _sstrm;\n  std::string _fst_type;\n  std::string _arc_type;\n  fst::SymbolTable const *_isymbols;\n  fst::SymbolTable const *_osymbols;\n  fst::SymbolTable const *_ssymbols;\n  bool _acceptor;\n  bool _keep_isymbols;\n  bool _keep_osymbols;\n  bool _keep_state_numbering;\n  bool _allow_negative_labels;\n};\n\n\n/* \"pywrapfst.pxd\":526\n * # FarReader.\n * \n * cdef class FarReader(object):             # <<<<<<<<<<<<<<\n * \n *   cdef unique_ptr[fst.FarReaderClass] _reader\n */\nstruct __pyx_obj_9pywrapfst_FarReader {\n  PyObject_HEAD\n  struct __pyx_vtabstruct_9pywrapfst_FarReader *__pyx_vtab;\n  std::unique_ptr<fst::script::FarReaderClass>  _reader;\n};\n\n\n/* \"pywrapfst.pxd\":551\n * # FarWriter.\n * \n * cdef class FarWriter(object):             # <<<<<<<<<<<<<<\n * \n *   cdef unique_ptr[fst.FarWriterClass] _writer\n */\nstruct __pyx_obj_9pywrapfst_FarWriter {\n  PyObject_HEAD\n  struct __pyx_vtabstruct_9pywrapfst_FarWriter *__pyx_vtab;\n  std::unique_ptr<fst::script::FarWriterClass>  _writer;\n};\n\n\n\n/* \"pywrapfst.pyx\":348\n * \n * \n * cdef class Weight(object):             # <<<<<<<<<<<<<<\n * \n *   \"\"\"\n */\n\nstruct __pyx_vtabstruct_9pywrapfst_Weight {\n  void (*_check_weight)(struct __pyx_obj_9pywrapfst_Weight *);\n  struct __pyx_obj_9pywrapfst_Weight *(*copy)(struct __pyx_obj_9pywrapfst_Weight *, int __pyx_skip_dispatch);\n  std::string (*to_string)(struct __pyx_obj_9pywrapfst_Weight *, int __pyx_skip_dispatch);\n  std::string (*type)(struct __pyx_obj_9pywrapfst_Weight *, int __pyx_skip_dispatch);\n};\nstatic struct __pyx_vtabstruct_9pywrapfst_Weight *__pyx_vtabptr_9pywrapfst_Weight;\n\n\n/* \"pywrapfst.pyx\":675\n * \n * \n * cdef class _SymbolTable(object):             # <<<<<<<<<<<<<<\n * \n *   \"\"\"\n */\n\nstruct __pyx_vtabstruct_9pywrapfst__SymbolTable {\n  __pyx_t_10basictypes_int64 (*available_key)(struct __pyx_obj_9pywrapfst__SymbolTable *, int __pyx_skip_dispatch);\n  std::string (*checksum)(struct __pyx_obj_9pywrapfst__SymbolTable *, int __pyx_skip_dispatch);\n  struct __pyx_obj_9pywrapfst_SymbolTable *(*copy)(struct __pyx_obj_9pywrapfst__SymbolTable *, int __pyx_skip_dispatch);\n  __pyx_t_10basictypes_int64 (*get_nth_key)(struct __pyx_obj_9pywrapfst__SymbolTable *, Py_ssize_t, int __pyx_skip_dispatch);\n  std::string (*labeled_checksum)(struct __pyx_obj_9pywrapfst__SymbolTable *, int __pyx_skip_dispatch);\n  bool (*member)(struct __pyx_obj_9pywrapfst__SymbolTable *, PyObject *, int __pyx_skip_dispatch);\n  std::string (*name)(struct __pyx_obj_9pywrapfst__SymbolTable *, int __pyx_skip_dispatch);\n  size_t (*num_symbols)(struct __pyx_obj_9pywrapfst__SymbolTable *, int __pyx_skip_dispatch);\n  void (*write)(struct __pyx_obj_9pywrapfst__SymbolTable *, PyObject *, int __pyx_skip_dispatch);\n  void (*write_text)(struct __pyx_obj_9pywrapfst__SymbolTable *, PyObject *, int __pyx_skip_dispatch);\n};\nstatic struct __pyx_vtabstruct_9pywrapfst__SymbolTable *__pyx_vtabptr_9pywrapfst__SymbolTable;\n\n\n/* \"pywrapfst.pyx\":839\n * \n * \n * cdef class _EncodeMapperSymbolTable(_SymbolTable):             # <<<<<<<<<<<<<<\n * \n *   \"\"\"\n */\n\nstruct __pyx_vtabstruct_9pywrapfst__EncodeMapperSymbolTable {\n  struct __pyx_vtabstruct_9pywrapfst__SymbolTable __pyx_base;\n};\nstatic struct __pyx_vtabstruct_9pywrapfst__EncodeMapperSymbolTable *__pyx_vtabptr_9pywrapfst__EncodeMapperSymbolTable;\n\n\n/* \"pywrapfst.pyx\":859\n * \n * \n * cdef class _FstSymbolTable(_SymbolTable):             # <<<<<<<<<<<<<<\n * \n *   \"\"\"\n */\n\nstruct __pyx_vtabstruct_9pywrapfst__FstSymbolTable {\n  struct __pyx_vtabstruct_9pywrapfst__SymbolTable __pyx_base;\n};\nstatic struct __pyx_vtabstruct_9pywrapfst__FstSymbolTable *__pyx_vtabptr_9pywrapfst__FstSymbolTable;\n\n\n/* \"pywrapfst.pyx\":878\n * \n * \n * cdef class _MutableSymbolTable(_SymbolTable):             # <<<<<<<<<<<<<<\n * \n *   \"\"\"\n */\n\nstruct __pyx_vtabstruct_9pywrapfst__MutableSymbolTable {\n  struct __pyx_vtabstruct_9pywrapfst__SymbolTable __pyx_base;\n  __pyx_t_10basictypes_int64 (*add_symbol)(struct __pyx_obj_9pywrapfst__MutableSymbolTable *, PyObject *, int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_19_MutableSymbolTable_add_symbol *__pyx_optional_args);\n  void (*add_table)(struct __pyx_obj_9pywrapfst__MutableSymbolTable *, struct __pyx_obj_9pywrapfst__SymbolTable *, int __pyx_skip_dispatch);\n  void (*set_name)(struct __pyx_obj_9pywrapfst__MutableSymbolTable *, PyObject *, int __pyx_skip_dispatch);\n};\nstatic struct __pyx_vtabstruct_9pywrapfst__MutableSymbolTable *__pyx_vtabptr_9pywrapfst__MutableSymbolTable;\n\n\n/* \"pywrapfst.pyx\":930\n * \n * \n * cdef class _MutableFstSymbolTable(_MutableSymbolTable):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   (No constructor.)\n */\n\nstruct __pyx_vtabstruct_9pywrapfst__MutableFstSymbolTable {\n  struct __pyx_vtabstruct_9pywrapfst__MutableSymbolTable __pyx_base;\n};\nstatic struct __pyx_vtabstruct_9pywrapfst__MutableFstSymbolTable *__pyx_vtabptr_9pywrapfst__MutableFstSymbolTable;\n\n\n/* \"pywrapfst.pyx\":941\n * \n * \n * cdef class SymbolTable(_MutableSymbolTable):             # <<<<<<<<<<<<<<\n * \n *   \"\"\"\n */\n\nstruct __pyx_vtabstruct_9pywrapfst_SymbolTable {\n  struct __pyx_vtabstruct_9pywrapfst__MutableSymbolTable __pyx_base;\n};\nstatic struct __pyx_vtabstruct_9pywrapfst_SymbolTable *__pyx_vtabptr_9pywrapfst_SymbolTable;\n\n\n/* \"pywrapfst.pyx\":1124\n * \n * \n * cdef class SymbolTableIterator(object):             # <<<<<<<<<<<<<<\n * \n *   \"\"\"\n */\n\nstruct __pyx_vtabstruct_9pywrapfst_SymbolTableIterator {\n  bool (*done)(struct __pyx_obj_9pywrapfst_SymbolTableIterator *, int __pyx_skip_dispatch);\n  void (*next)(struct __pyx_obj_9pywrapfst_SymbolTableIterator *, int __pyx_skip_dispatch);\n  void (*reset)(struct __pyx_obj_9pywrapfst_SymbolTableIterator *, int __pyx_skip_dispatch);\n  std::string (*symbol)(struct __pyx_obj_9pywrapfst_SymbolTableIterator *, int __pyx_skip_dispatch);\n  __pyx_t_10basictypes_int64 (*value)(struct __pyx_obj_9pywrapfst_SymbolTableIterator *, int __pyx_skip_dispatch);\n};\nstatic struct __pyx_vtabstruct_9pywrapfst_SymbolTableIterator *__pyx_vtabptr_9pywrapfst_SymbolTableIterator;\n\n\n/* \"pywrapfst.pyx\":1206\n * \n * \n * cdef class EncodeMapper(object):             # <<<<<<<<<<<<<<\n * \n *   \"\"\"\n */\n\nstruct __pyx_vtabstruct_9pywrapfst_EncodeMapper {\n  std::string (*arc_type)(struct __pyx_obj_9pywrapfst_EncodeMapper *, int __pyx_skip_dispatch);\n  __pyx_t_10basictypes_uint32 (*flags)(struct __pyx_obj_9pywrapfst_EncodeMapper *, int __pyx_skip_dispatch);\n  struct __pyx_obj_9pywrapfst__EncodeMapperSymbolTable *(*input_symbols)(struct __pyx_obj_9pywrapfst_EncodeMapper *, int __pyx_skip_dispatch);\n  struct __pyx_obj_9pywrapfst__EncodeMapperSymbolTable *(*output_symbols)(struct __pyx_obj_9pywrapfst_EncodeMapper *, int __pyx_skip_dispatch);\n  __pyx_t_10basictypes_uint64 (*properties)(struct __pyx_obj_9pywrapfst_EncodeMapper *, __pyx_t_10basictypes_uint64, int __pyx_skip_dispatch);\n  void (*set_input_symbols)(struct __pyx_obj_9pywrapfst_EncodeMapper *, struct __pyx_obj_9pywrapfst__SymbolTable *, int __pyx_skip_dispatch);\n  void (*set_output_symbols)(struct __pyx_obj_9pywrapfst_EncodeMapper *, struct __pyx_obj_9pywrapfst__SymbolTable *, int __pyx_skip_dispatch);\n  std::string (*weight_type)(struct __pyx_obj_9pywrapfst_EncodeMapper *, int __pyx_skip_dispatch);\n};\nstatic struct __pyx_vtabstruct_9pywrapfst_EncodeMapper *__pyx_vtabptr_9pywrapfst_EncodeMapper;\n\n\n/* \"pywrapfst.pyx\":1362\n * \n * \n * cdef class _Fst(object):             # <<<<<<<<<<<<<<\n * \n *   \"\"\"\n */\n\nstruct __pyx_vtabstruct_9pywrapfst__Fst {\n  std::string (*arc_type)(struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch);\n  struct __pyx_obj_9pywrapfst_ArcIterator *(*arcs)(struct __pyx_obj_9pywrapfst__Fst *, __pyx_t_10basictypes_int64, int __pyx_skip_dispatch);\n  struct __pyx_obj_9pywrapfst__Fst *(*copy)(struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch);\n  void (*draw)(struct __pyx_obj_9pywrapfst__Fst *, PyObject *, int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_4_Fst_draw *__pyx_optional_args);\n  struct __pyx_obj_9pywrapfst_Weight *(*final)(struct __pyx_obj_9pywrapfst__Fst *, __pyx_t_10basictypes_int64, int __pyx_skip_dispatch);\n  std::string (*fst_type)(struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch);\n  struct __pyx_obj_9pywrapfst__FstSymbolTable *(*input_symbols)(struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch);\n  size_t (*num_arcs)(struct __pyx_obj_9pywrapfst__Fst *, __pyx_t_10basictypes_int64, int __pyx_skip_dispatch);\n  size_t (*num_input_epsilons)(struct __pyx_obj_9pywrapfst__Fst *, __pyx_t_10basictypes_int64, int __pyx_skip_dispatch);\n  size_t (*num_output_epsilons)(struct __pyx_obj_9pywrapfst__Fst *, __pyx_t_10basictypes_int64, int __pyx_skip_dispatch);\n  struct __pyx_obj_9pywrapfst__FstSymbolTable *(*output_symbols)(struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch);\n  __pyx_t_10basictypes_uint64 (*properties)(struct __pyx_obj_9pywrapfst__Fst *, __pyx_t_10basictypes_uint64, bool, int __pyx_skip_dispatch);\n  __pyx_t_10basictypes_int64 (*start)(struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch);\n  struct __pyx_obj_9pywrapfst_StateIterator *(*states)(struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch);\n  std::string (*text)(struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_4_Fst_text *__pyx_optional_args);\n  bool (*verify)(struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch);\n  std::string (*weight_type)(struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch);\n  void (*write)(struct __pyx_obj_9pywrapfst__Fst *, PyObject *, int __pyx_skip_dispatch);\n  std::string (*write_to_string)(struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch);\n};\nstatic struct __pyx_vtabstruct_9pywrapfst__Fst *__pyx_vtabptr_9pywrapfst__Fst;\n\n\n/* \"pywrapfst.pyx\":1774\n * \n * \n * cdef class _MutableFst(_Fst):             # <<<<<<<<<<<<<<\n * \n *   \"\"\"\n */\n\nstruct __pyx_vtabstruct_9pywrapfst__MutableFst {\n  struct __pyx_vtabstruct_9pywrapfst__Fst __pyx_base;\n  void (*_check_mutating_imethod)(struct __pyx_obj_9pywrapfst__MutableFst *);\n  void (*_add_arc)(struct __pyx_obj_9pywrapfst__MutableFst *, __pyx_t_10basictypes_int64, struct __pyx_obj_9pywrapfst_Arc *);\n  __pyx_t_10basictypes_int64 (*add_state)(struct __pyx_obj_9pywrapfst__MutableFst *, int __pyx_skip_dispatch);\n  void (*_arcsort)(struct __pyx_obj_9pywrapfst__MutableFst *, struct __pyx_opt_args_9pywrapfst_11_MutableFst__arcsort *__pyx_optional_args);\n  void (*_closure)(struct __pyx_obj_9pywrapfst__MutableFst *, struct __pyx_opt_args_9pywrapfst_11_MutableFst__closure *__pyx_optional_args);\n  void (*_concat)(struct __pyx_obj_9pywrapfst__MutableFst *, struct __pyx_obj_9pywrapfst__Fst *);\n  void (*_connect)(struct __pyx_obj_9pywrapfst__MutableFst *);\n  void (*_decode)(struct __pyx_obj_9pywrapfst__MutableFst *, struct __pyx_obj_9pywrapfst_EncodeMapper *);\n  void (*_delete_arcs)(struct __pyx_obj_9pywrapfst__MutableFst *, __pyx_t_10basictypes_int64, struct __pyx_opt_args_9pywrapfst_11_MutableFst__delete_arcs *__pyx_optional_args);\n  void (*_delete_states)(struct __pyx_obj_9pywrapfst__MutableFst *, struct __pyx_opt_args_9pywrapfst_11_MutableFst__delete_states *__pyx_optional_args);\n  void (*_encode)(struct __pyx_obj_9pywrapfst__MutableFst *, struct __pyx_obj_9pywrapfst_EncodeMapper *);\n  void (*_invert)(struct __pyx_obj_9pywrapfst__MutableFst *);\n  void (*_minimize)(struct __pyx_obj_9pywrapfst__MutableFst *, struct __pyx_opt_args_9pywrapfst_11_MutableFst__minimize *__pyx_optional_args);\n  struct __pyx_obj_9pywrapfst_MutableArcIterator *(*mutable_arcs)(struct __pyx_obj_9pywrapfst__MutableFst *, __pyx_t_10basictypes_int64, int __pyx_skip_dispatch);\n  __pyx_t_10basictypes_int64 (*num_states)(struct __pyx_obj_9pywrapfst__MutableFst *, int __pyx_skip_dispatch);\n  void (*_project)(struct __pyx_obj_9pywrapfst__MutableFst *, struct __pyx_opt_args_9pywrapfst_11_MutableFst__project *__pyx_optional_args);\n  void (*_prune)(struct __pyx_obj_9pywrapfst__MutableFst *, struct __pyx_opt_args_9pywrapfst_11_MutableFst__prune *__pyx_optional_args);\n  void (*_push)(struct __pyx_obj_9pywrapfst__MutableFst *, struct __pyx_opt_args_9pywrapfst_11_MutableFst__push *__pyx_optional_args);\n  void (*_relabel_pairs)(struct __pyx_obj_9pywrapfst__MutableFst *, struct __pyx_opt_args_9pywrapfst_11_MutableFst__relabel_pairs *__pyx_optional_args);\n  void (*_relabel_tables)(struct __pyx_obj_9pywrapfst__MutableFst *, struct __pyx_opt_args_9pywrapfst_11_MutableFst__relabel_tables *__pyx_optional_args);\n  void (*_reserve_arcs)(struct __pyx_obj_9pywrapfst__MutableFst *, __pyx_t_10basictypes_int64, size_t);\n  void (*_reserve_states)(struct __pyx_obj_9pywrapfst__MutableFst *, __pyx_t_10basictypes_int64);\n  void (*_reweight)(struct __pyx_obj_9pywrapfst__MutableFst *, PyObject *, struct __pyx_opt_args_9pywrapfst_11_MutableFst__reweight *__pyx_optional_args);\n  void (*_rmepsilon)(struct __pyx_obj_9pywrapfst__MutableFst *, struct __pyx_opt_args_9pywrapfst_11_MutableFst__rmepsilon *__pyx_optional_args);\n  void (*_set_final)(struct __pyx_obj_9pywrapfst__MutableFst *, __pyx_t_10basictypes_int64, struct __pyx_opt_args_9pywrapfst_11_MutableFst__set_final *__pyx_optional_args);\n  void (*_set_properties)(struct __pyx_obj_9pywrapfst__MutableFst *, __pyx_t_10basictypes_uint64, __pyx_t_10basictypes_uint64);\n  void (*_set_start)(struct __pyx_obj_9pywrapfst__MutableFst *, __pyx_t_10basictypes_int64);\n  void (*_set_input_symbols)(struct __pyx_obj_9pywrapfst__MutableFst *, struct __pyx_obj_9pywrapfst__SymbolTable *);\n  void (*_set_output_symbols)(struct __pyx_obj_9pywrapfst__MutableFst *, struct __pyx_obj_9pywrapfst__SymbolTable *);\n  void (*_topsort)(struct __pyx_obj_9pywrapfst__MutableFst *);\n  void (*_union)(struct __pyx_obj_9pywrapfst__MutableFst *, struct __pyx_obj_9pywrapfst__Fst *);\n};\nstatic struct __pyx_vtabstruct_9pywrapfst__MutableFst *__pyx_vtabptr_9pywrapfst__MutableFst;\n\n\n/* \"pywrapfst.pyx\":2898\n * \n * \n * cdef class Arc(object):             # <<<<<<<<<<<<<<\n * \n *   \"\"\"\n */\n\nstruct __pyx_vtabstruct_9pywrapfst_Arc {\n  struct __pyx_obj_9pywrapfst_Arc *(*copy)(struct __pyx_obj_9pywrapfst_Arc *, int __pyx_skip_dispatch);\n};\nstatic struct __pyx_vtabstruct_9pywrapfst_Arc *__pyx_vtabptr_9pywrapfst_Arc;\n\n\n/* \"pywrapfst.pyx\":2965\n * \n * \n * cdef class ArcIterator(object):             # <<<<<<<<<<<<<<\n * \n *   \"\"\"\n */\n\nstruct __pyx_vtabstruct_9pywrapfst_ArcIterator {\n  bool (*done)(struct __pyx_obj_9pywrapfst_ArcIterator *, int __pyx_skip_dispatch);\n  __pyx_t_10basictypes_uint32 (*flags)(struct __pyx_obj_9pywrapfst_ArcIterator *, int __pyx_skip_dispatch);\n  void (*next)(struct __pyx_obj_9pywrapfst_ArcIterator *, int __pyx_skip_dispatch);\n  size_t (*position)(struct __pyx_obj_9pywrapfst_ArcIterator *, int __pyx_skip_dispatch);\n  void (*reset)(struct __pyx_obj_9pywrapfst_ArcIterator *, int __pyx_skip_dispatch);\n  void (*seek)(struct __pyx_obj_9pywrapfst_ArcIterator *, size_t, int __pyx_skip_dispatch);\n  void (*set_flags)(struct __pyx_obj_9pywrapfst_ArcIterator *, __pyx_t_10basictypes_uint32, __pyx_t_10basictypes_uint32, int __pyx_skip_dispatch);\n  PyObject *(*value)(struct __pyx_obj_9pywrapfst_ArcIterator *, int __pyx_skip_dispatch);\n};\nstatic struct __pyx_vtabstruct_9pywrapfst_ArcIterator *__pyx_vtabptr_9pywrapfst_ArcIterator;\n\n\n/* \"pywrapfst.pyx\":3076\n * \n * \n * cdef class MutableArcIterator(object):             # <<<<<<<<<<<<<<\n * \n *   \"\"\"\n */\n\nstruct __pyx_vtabstruct_9pywrapfst_MutableArcIterator {\n  bool (*done)(struct __pyx_obj_9pywrapfst_MutableArcIterator *, int __pyx_skip_dispatch);\n  __pyx_t_10basictypes_uint32 (*flags)(struct __pyx_obj_9pywrapfst_MutableArcIterator *, int __pyx_skip_dispatch);\n  void (*next)(struct __pyx_obj_9pywrapfst_MutableArcIterator *, int __pyx_skip_dispatch);\n  size_t (*position)(struct __pyx_obj_9pywrapfst_MutableArcIterator *, int __pyx_skip_dispatch);\n  void (*reset)(struct __pyx_obj_9pywrapfst_MutableArcIterator *, int __pyx_skip_dispatch);\n  void (*seek)(struct __pyx_obj_9pywrapfst_MutableArcIterator *, size_t, int __pyx_skip_dispatch);\n  void (*set_flags)(struct __pyx_obj_9pywrapfst_MutableArcIterator *, __pyx_t_10basictypes_uint32, __pyx_t_10basictypes_uint32, int __pyx_skip_dispatch);\n  void (*set_value)(struct __pyx_obj_9pywrapfst_MutableArcIterator *, struct __pyx_obj_9pywrapfst_Arc *, int __pyx_skip_dispatch);\n  PyObject *(*value)(struct __pyx_obj_9pywrapfst_MutableArcIterator *, int __pyx_skip_dispatch);\n};\nstatic struct __pyx_vtabstruct_9pywrapfst_MutableArcIterator *__pyx_vtabptr_9pywrapfst_MutableArcIterator;\n\n\n/* \"pywrapfst.pyx\":3190\n * \n * \n * cdef class StateIterator(object):             # <<<<<<<<<<<<<<\n * \n *   \"\"\"\n */\n\nstruct __pyx_vtabstruct_9pywrapfst_StateIterator {\n  bool (*done)(struct __pyx_obj_9pywrapfst_StateIterator *, int __pyx_skip_dispatch);\n  void (*next)(struct __pyx_obj_9pywrapfst_StateIterator *, int __pyx_skip_dispatch);\n  void (*reset)(struct __pyx_obj_9pywrapfst_StateIterator *, int __pyx_skip_dispatch);\n  __pyx_t_10basictypes_int64 (*value)(struct __pyx_obj_9pywrapfst_StateIterator *, int __pyx_skip_dispatch);\n};\nstatic struct __pyx_vtabstruct_9pywrapfst_StateIterator *__pyx_vtabptr_9pywrapfst_StateIterator;\n\n\n/* \"pywrapfst.pyx\":4088\n * \n * \n * cdef class Compiler(object):             # <<<<<<<<<<<<<<\n * \n *   \"\"\"\n */\n\nstruct __pyx_vtabstruct_9pywrapfst_Compiler {\n  struct __pyx_obj_9pywrapfst__Fst *(*compile)(struct __pyx_obj_9pywrapfst_Compiler *, int __pyx_skip_dispatch);\n  void (*write)(struct __pyx_obj_9pywrapfst_Compiler *, PyObject *, int __pyx_skip_dispatch);\n};\nstatic struct __pyx_vtabstruct_9pywrapfst_Compiler *__pyx_vtabptr_9pywrapfst_Compiler;\n\n\n/* \"pywrapfst.pyx\":4215\n * \n * \n * cdef class FarReader(object):             # <<<<<<<<<<<<<<\n * \n *   \"\"\"\n */\n\nstruct __pyx_vtabstruct_9pywrapfst_FarReader {\n  std::string (*arc_type)(struct __pyx_obj_9pywrapfst_FarReader *, int __pyx_skip_dispatch);\n  bool (*done)(struct __pyx_obj_9pywrapfst_FarReader *, int __pyx_skip_dispatch);\n  bool (*error)(struct __pyx_obj_9pywrapfst_FarReader *, int __pyx_skip_dispatch);\n  std::string (*far_type)(struct __pyx_obj_9pywrapfst_FarReader *, int __pyx_skip_dispatch);\n  bool (*find)(struct __pyx_obj_9pywrapfst_FarReader *, PyObject *, int __pyx_skip_dispatch);\n  struct __pyx_obj_9pywrapfst__Fst *(*get_fst)(struct __pyx_obj_9pywrapfst_FarReader *, int __pyx_skip_dispatch);\n  std::string (*get_key)(struct __pyx_obj_9pywrapfst_FarReader *, int __pyx_skip_dispatch);\n  void (*next)(struct __pyx_obj_9pywrapfst_FarReader *, int __pyx_skip_dispatch);\n  void (*reset)(struct __pyx_obj_9pywrapfst_FarReader *, int __pyx_skip_dispatch);\n};\nstatic struct __pyx_vtabstruct_9pywrapfst_FarReader *__pyx_vtabptr_9pywrapfst_FarReader;\n\n\n/* \"pywrapfst.pyx\":4361\n * \n * \n * cdef class FarWriter(object):             # <<<<<<<<<<<<<<\n * \n *   \"\"\"\n */\n\nstruct __pyx_vtabstruct_9pywrapfst_FarWriter {\n  std::string (*arc_type)(struct __pyx_obj_9pywrapfst_FarWriter *, int __pyx_skip_dispatch);\n  void (*close)(struct __pyx_obj_9pywrapfst_FarWriter *);\n  void (*add)(struct __pyx_obj_9pywrapfst_FarWriter *, PyObject *, struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch);\n  bool (*error)(struct __pyx_obj_9pywrapfst_FarWriter *, int __pyx_skip_dispatch);\n  std::string (*far_type)(struct __pyx_obj_9pywrapfst_FarWriter *, int __pyx_skip_dispatch);\n};\nstatic struct __pyx_vtabstruct_9pywrapfst_FarWriter *__pyx_vtabptr_9pywrapfst_FarWriter;\n\n/* --- Runtime support code (head) --- */\n/* Refnanny.proto */\n#ifndef CYTHON_REFNANNY\n  #define CYTHON_REFNANNY 0\n#endif\n#if CYTHON_REFNANNY\n  typedef struct {\n    void (*INCREF)(void*, PyObject*, int);\n    void (*DECREF)(void*, PyObject*, int);\n    void (*GOTREF)(void*, PyObject*, int);\n    void (*GIVEREF)(void*, PyObject*, int);\n    void* (*SetupContext)(const char*, int, const char*);\n    void (*FinishContext)(void**);\n  } __Pyx_RefNannyAPIStruct;\n  static __Pyx_RefNannyAPIStruct *__Pyx_RefNanny = NULL;\n  static __Pyx_RefNannyAPIStruct *__Pyx_RefNannyImportAPI(const char *modname);\n  #define __Pyx_RefNannyDeclarations void *__pyx_refnanny = NULL;\n#ifdef WITH_THREAD\n  #define __Pyx_RefNannySetupContext(name, acquire_gil)\\\n          if (acquire_gil) {\\\n              PyGILState_STATE __pyx_gilstate_save = PyGILState_Ensure();\\\n              __pyx_refnanny = __Pyx_RefNanny->SetupContext((name), __LINE__, __FILE__);\\\n              PyGILState_Release(__pyx_gilstate_save);\\\n          } else {\\\n              __pyx_refnanny = __Pyx_RefNanny->SetupContext((name), __LINE__, __FILE__);\\\n          }\n#else\n  #define __Pyx_RefNannySetupContext(name, acquire_gil)\\\n          __pyx_refnanny = __Pyx_RefNanny->SetupContext((name), __LINE__, __FILE__)\n#endif\n  #define __Pyx_RefNannyFinishContext()\\\n          __Pyx_RefNanny->FinishContext(&__pyx_refnanny)\n  #define __Pyx_INCREF(r)  __Pyx_RefNanny->INCREF(__pyx_refnanny, (PyObject *)(r), __LINE__)\n  #define __Pyx_DECREF(r)  __Pyx_RefNanny->DECREF(__pyx_refnanny, (PyObject *)(r), __LINE__)\n  #define __Pyx_GOTREF(r)  __Pyx_RefNanny->GOTREF(__pyx_refnanny, (PyObject *)(r), __LINE__)\n  #define __Pyx_GIVEREF(r) __Pyx_RefNanny->GIVEREF(__pyx_refnanny, (PyObject *)(r), __LINE__)\n  #define __Pyx_XINCREF(r)  do { if((r) != NULL) {__Pyx_INCREF(r); }} while(0)\n  #define __Pyx_XDECREF(r)  do { if((r) != NULL) {__Pyx_DECREF(r); }} while(0)\n  #define __Pyx_XGOTREF(r)  do { if((r) != NULL) {__Pyx_GOTREF(r); }} while(0)\n  #define __Pyx_XGIVEREF(r) do { if((r) != NULL) {__Pyx_GIVEREF(r);}} while(0)\n#else\n  #define __Pyx_RefNannyDeclarations\n  #define __Pyx_RefNannySetupContext(name, acquire_gil)\n  #define __Pyx_RefNannyFinishContext()\n  #define __Pyx_INCREF(r) Py_INCREF(r)\n  #define __Pyx_DECREF(r) Py_DECREF(r)\n  #define __Pyx_GOTREF(r)\n  #define __Pyx_GIVEREF(r)\n  #define __Pyx_XINCREF(r) Py_XINCREF(r)\n  #define __Pyx_XDECREF(r) Py_XDECREF(r)\n  #define __Pyx_XGOTREF(r)\n  #define __Pyx_XGIVEREF(r)\n#endif\n#define __Pyx_XDECREF_SET(r, v) do {\\\n        PyObject *tmp = (PyObject *) r;\\\n        r = v; __Pyx_XDECREF(tmp);\\\n    } while (0)\n#define __Pyx_DECREF_SET(r, v) do {\\\n        PyObject *tmp = (PyObject *) r;\\\n        r = v; __Pyx_DECREF(tmp);\\\n    } while (0)\n#define __Pyx_CLEAR(r)    do { PyObject* tmp = ((PyObject*)(r)); r = NULL; __Pyx_DECREF(tmp);} while(0)\n#define __Pyx_XCLEAR(r)   do { if((r) != NULL) {PyObject* tmp = ((PyObject*)(r)); r = NULL; __Pyx_DECREF(tmp);}} while(0)\n\n/* PyObjectGetAttrStr.proto */\n#if CYTHON_USE_TYPE_SLOTS\nstatic CYTHON_INLINE PyObject* __Pyx_PyObject_GetAttrStr(PyObject* obj, PyObject* attr_name);\n#else\n#define __Pyx_PyObject_GetAttrStr(o,n) PyObject_GetAttr(o,n)\n#endif\n\n/* GetBuiltinName.proto */\nstatic PyObject *__Pyx_GetBuiltinName(PyObject *name);\n\n/* PyCFunctionFastCall.proto */\n#if CYTHON_FAST_PYCCALL\nstatic CYTHON_INLINE PyObject *__Pyx_PyCFunction_FastCall(PyObject *func, PyObject **args, Py_ssize_t nargs);\n#else\n#define __Pyx_PyCFunction_FastCall(func, args, nargs)  (assert(0), NULL)\n#endif\n\n/* PyFunctionFastCall.proto */\n#if CYTHON_FAST_PYCALL\n#define __Pyx_PyFunction_FastCall(func, args, nargs)\\\n    __Pyx_PyFunction_FastCallDict((func), (args), (nargs), NULL)\n#if 1 || PY_VERSION_HEX < 0x030600B1\nstatic PyObject *__Pyx_PyFunction_FastCallDict(PyObject *func, PyObject **args, int nargs, PyObject *kwargs);\n#else\n#define __Pyx_PyFunction_FastCallDict(func, args, nargs, kwargs) _PyFunction_FastCallDict(func, args, nargs, kwargs)\n#endif\n#endif\n\n/* PyObjectCall.proto */\n#if CYTHON_COMPILING_IN_CPYTHON\nstatic CYTHON_INLINE PyObject* __Pyx_PyObject_Call(PyObject *func, PyObject *arg, PyObject *kw);\n#else\n#define __Pyx_PyObject_Call(func, arg, kw) PyObject_Call(func, arg, kw)\n#endif\n\n/* PyObjectCallMethO.proto */\n#if CYTHON_COMPILING_IN_CPYTHON\nstatic CYTHON_INLINE PyObject* __Pyx_PyObject_CallMethO(PyObject *func, PyObject *arg);\n#endif\n\n/* PyObjectCallOneArg.proto */\nstatic CYTHON_INLINE PyObject* __Pyx_PyObject_CallOneArg(PyObject *func, PyObject *arg);\n\n/* GetModuleGlobalName.proto */\nstatic CYTHON_INLINE PyObject *__Pyx_GetModuleGlobalName(PyObject *name);\n\n/* PyThreadStateGet.proto */\n#if CYTHON_FAST_THREAD_STATE\n#define __Pyx_PyThreadState_declare  PyThreadState *__pyx_tstate;\n#define __Pyx_PyThreadState_assign  __pyx_tstate = __Pyx_PyThreadState_Current;\n#define __Pyx_PyErr_Occurred()  __pyx_tstate->curexc_type\n#else\n#define __Pyx_PyThreadState_declare\n#define __Pyx_PyThreadState_assign\n#define __Pyx_PyErr_Occurred()  PyErr_Occurred()\n#endif\n\n/* PyErrFetchRestore.proto */\n#if CYTHON_FAST_THREAD_STATE\n#define __Pyx_PyErr_Clear() __Pyx_ErrRestore(NULL, NULL, NULL)\n#define __Pyx_ErrRestoreWithState(type, value, tb)  __Pyx_ErrRestoreInState(PyThreadState_GET(), type, value, tb)\n#define __Pyx_ErrFetchWithState(type, value, tb)    __Pyx_ErrFetchInState(PyThreadState_GET(), type, value, tb)\n#define __Pyx_ErrRestore(type, value, tb)  __Pyx_ErrRestoreInState(__pyx_tstate, type, value, tb)\n#define __Pyx_ErrFetch(type, value, tb)    __Pyx_ErrFetchInState(__pyx_tstate, type, value, tb)\nstatic CYTHON_INLINE void __Pyx_ErrRestoreInState(PyThreadState *tstate, PyObject *type, PyObject *value, PyObject *tb);\nstatic CYTHON_INLINE void __Pyx_ErrFetchInState(PyThreadState *tstate, PyObject **type, PyObject **value, PyObject **tb);\n#if CYTHON_COMPILING_IN_CPYTHON\n#define __Pyx_PyErr_SetNone(exc) (Py_INCREF(exc), __Pyx_ErrRestore((exc), NULL, NULL))\n#else\n#define __Pyx_PyErr_SetNone(exc) PyErr_SetNone(exc)\n#endif\n#else\n#define __Pyx_PyErr_Clear() PyErr_Clear()\n#define __Pyx_PyErr_SetNone(exc) PyErr_SetNone(exc)\n#define __Pyx_ErrRestoreWithState(type, value, tb)  PyErr_Restore(type, value, tb)\n#define __Pyx_ErrFetchWithState(type, value, tb)  PyErr_Fetch(type, value, tb)\n#define __Pyx_ErrRestoreInState(tstate, type, value, tb)  PyErr_Restore(type, value, tb)\n#define __Pyx_ErrFetchInState(tstate, type, value, tb)  PyErr_Fetch(type, value, tb)\n#define __Pyx_ErrRestore(type, value, tb)  PyErr_Restore(type, value, tb)\n#define __Pyx_ErrFetch(type, value, tb)  PyErr_Fetch(type, value, tb)\n#endif\n\n/* RaiseException.proto */\nstatic void __Pyx_Raise(PyObject *type, PyObject *value, PyObject *tb, PyObject *cause);\n\n/* RaiseArgTupleInvalid.proto */\nstatic void __Pyx_RaiseArgtupleInvalid(const char* func_name, int exact,\n    Py_ssize_t num_min, Py_ssize_t num_max, Py_ssize_t num_found);\n\n/* RaiseDoubleKeywords.proto */\nstatic void __Pyx_RaiseDoubleKeywordsError(const char* func_name, PyObject* kw_name);\n\n/* ParseKeywords.proto */\nstatic int __Pyx_ParseOptionalKeywords(PyObject *kwds, PyObject **argnames[],\\\n    PyObject *kwds2, PyObject *values[], Py_ssize_t num_pos_args,\\\n    const char* function_name);\n\n/* PyObjectCallNoArg.proto */\n#if CYTHON_COMPILING_IN_CPYTHON\nstatic CYTHON_INLINE PyObject* __Pyx_PyObject_CallNoArg(PyObject *func);\n#else\n#define __Pyx_PyObject_CallNoArg(func) __Pyx_PyObject_Call(func, __pyx_empty_tuple, NULL)\n#endif\n\n/* ExtTypeTest.proto */\nstatic CYTHON_INLINE int __Pyx_TypeTest(PyObject *obj, PyTypeObject *type);\n\n/* ArgTypeTest.proto */\n#define __Pyx_ArgTypeTest(obj, type, none_allowed, name, exact)\\\n    ((likely((Py_TYPE(obj) == type) | (none_allowed && (obj == Py_None)))) ? 1 :\\\n        __Pyx__ArgTypeTest(obj, type, name, exact))\nstatic int __Pyx__ArgTypeTest(PyObject *obj, PyTypeObject *type, const char *name, int exact);\n\n/* WriteUnraisableException.proto */\nstatic void __Pyx_WriteUnraisable(const char *name, int clineno,\n                                  int lineno, const char *filename,\n                                  int full_traceback, int nogil);\n\n/* KeywordStringCheck.proto */\nstatic int __Pyx_CheckKeywordStrings(PyObject *kwdict, const char* function_name, int kw_allowed);\n\n/* SaveResetException.proto */\n#if CYTHON_FAST_THREAD_STATE\n#define __Pyx_ExceptionSave(type, value, tb)  __Pyx__ExceptionSave(__pyx_tstate, type, value, tb)\nstatic CYTHON_INLINE void __Pyx__ExceptionSave(PyThreadState *tstate, PyObject **type, PyObject **value, PyObject **tb);\n#define __Pyx_ExceptionReset(type, value, tb)  __Pyx__ExceptionReset(__pyx_tstate, type, value, tb)\nstatic CYTHON_INLINE void __Pyx__ExceptionReset(PyThreadState *tstate, PyObject *type, PyObject *value, PyObject *tb);\n#else\n#define __Pyx_ExceptionSave(type, value, tb)   PyErr_GetExcInfo(type, value, tb)\n#define __Pyx_ExceptionReset(type, value, tb)  PyErr_SetExcInfo(type, value, tb)\n#endif\n\n/* FastTypeChecks.proto */\n#if CYTHON_COMPILING_IN_CPYTHON\n#define __Pyx_TypeCheck(obj, type) __Pyx_IsSubtype(Py_TYPE(obj), (PyTypeObject *)type)\nstatic CYTHON_INLINE int __Pyx_IsSubtype(PyTypeObject *a, PyTypeObject *b);\nstatic CYTHON_INLINE int __Pyx_PyErr_GivenExceptionMatches(PyObject *err, PyObject *type);\nstatic CYTHON_INLINE int __Pyx_PyErr_GivenExceptionMatches2(PyObject *err, PyObject *type1, PyObject *type2);\n#else\n#define __Pyx_TypeCheck(obj, type) PyObject_TypeCheck(obj, (PyTypeObject *)type)\n#define __Pyx_PyErr_GivenExceptionMatches(err, type) PyErr_GivenExceptionMatches(err, type)\n#define __Pyx_PyErr_GivenExceptionMatches2(err, type1, type2) (PyErr_GivenExceptionMatches(err, type1) || PyErr_GivenExceptionMatches(err, type2))\n#endif\n#define __Pyx_PyException_Check(obj) __Pyx_TypeCheck(obj, PyExc_Exception)\n\n/* GetException.proto */\n#if CYTHON_FAST_THREAD_STATE\n#define __Pyx_GetException(type, value, tb)  __Pyx__GetException(__pyx_tstate, type, value, tb)\nstatic int __Pyx__GetException(PyThreadState *tstate, PyObject **type, PyObject **value, PyObject **tb);\n#else\nstatic int __Pyx_GetException(PyObject **type, PyObject **value, PyObject **tb);\n#endif\n\n/* RaiseTooManyValuesToUnpack.proto */\nstatic CYTHON_INLINE void __Pyx_RaiseTooManyValuesError(Py_ssize_t expected);\n\n/* RaiseNeedMoreValuesToUnpack.proto */\nstatic CYTHON_INLINE void __Pyx_RaiseNeedMoreValuesError(Py_ssize_t index);\n\n/* IterFinish.proto */\nstatic CYTHON_INLINE int __Pyx_IterFinish(void);\n\n/* UnpackItemEndCheck.proto */\nstatic int __Pyx_IternextUnpackEndCheck(PyObject *retval, Py_ssize_t expected);\n\n/* IterNext.proto */\n#define __Pyx_PyIter_Next(obj) __Pyx_PyIter_Next2(obj, NULL)\nstatic CYTHON_INLINE PyObject *__Pyx_PyIter_Next2(PyObject *, PyObject *);\n\n/* ListCompAppend.proto */\n#if CYTHON_USE_PYLIST_INTERNALS && CYTHON_ASSUME_SAFE_MACROS\nstatic CYTHON_INLINE int __Pyx_ListComp_Append(PyObject* list, PyObject* x) {\n    PyListObject* L = (PyListObject*) list;\n    Py_ssize_t len = Py_SIZE(list);\n    if (likely(L->allocated > len)) {\n        Py_INCREF(x);\n        PyList_SET_ITEM(list, len, x);\n        Py_SIZE(list) = len+1;\n        return 0;\n    }\n    return PyList_Append(list, x);\n}\n#else\n#define __Pyx_ListComp_Append(L,x) PyList_Append(L,x)\n#endif\n\n/* PyObject_GenericGetAttrNoDict.proto */\n#if CYTHON_USE_TYPE_SLOTS && CYTHON_USE_PYTYPE_LOOKUP && PY_VERSION_HEX < 0x03070000\nstatic CYTHON_INLINE PyObject* __Pyx_PyObject_GenericGetAttrNoDict(PyObject* obj, PyObject* attr_name);\n#else\n#define __Pyx_PyObject_GenericGetAttrNoDict PyObject_GenericGetAttr\n#endif\n\n/* PyObject_GenericGetAttr.proto */\n#if CYTHON_USE_TYPE_SLOTS && CYTHON_USE_PYTYPE_LOOKUP && PY_VERSION_HEX < 0x03070000\nstatic PyObject* __Pyx_PyObject_GenericGetAttr(PyObject* obj, PyObject* attr_name);\n#else\n#define __Pyx_PyObject_GenericGetAttr PyObject_GenericGetAttr\n#endif\n\n/* SetVTable.proto */\nstatic int __Pyx_SetVtable(PyObject *dict, void *vtable);\n\n/* SetupReduce.proto */\nstatic int __Pyx_setup_reduce(PyObject* type_obj);\n\n/* Import.proto */\nstatic PyObject *__Pyx_Import(PyObject *name, PyObject *from_list, int level);\n\n/* CalculateMetaclass.proto */\nstatic PyObject *__Pyx_CalculateMetaclass(PyTypeObject *metaclass, PyObject *bases);\n\n/* Py3ClassCreate.proto */\nstatic PyObject *__Pyx_Py3MetaclassPrepare(PyObject *metaclass, PyObject *bases, PyObject *name, PyObject *qualname,\n                                           PyObject *mkw, PyObject *modname, PyObject *doc);\nstatic PyObject *__Pyx_Py3ClassCreate(PyObject *metaclass, PyObject *name, PyObject *bases, PyObject *dict,\n                                      PyObject *mkw, int calculate_metaclass, int allow_py2_metaclass);\n\n/* ClassMethod.proto */\n#include \"descrobject.h\"\nstatic PyObject* __Pyx_Method_ClassMethod(PyObject *method);\n\n/* PyErrExceptionMatches.proto */\n#if CYTHON_FAST_THREAD_STATE\n#define __Pyx_PyErr_ExceptionMatches(err) __Pyx_PyErr_ExceptionMatchesInState(__pyx_tstate, err)\nstatic CYTHON_INLINE int __Pyx_PyErr_ExceptionMatchesInState(PyThreadState* tstate, PyObject* err);\n#else\n#define __Pyx_PyErr_ExceptionMatches(err)  PyErr_ExceptionMatches(err)\n#endif\n\n/* GetNameInClass.proto */\nstatic PyObject *__Pyx_GetNameInClass(PyObject *nmspace, PyObject *name);\n\n/* FetchCommonType.proto */\nstatic PyTypeObject* __Pyx_FetchCommonType(PyTypeObject* type);\n\n/* CythonFunction.proto */\n#define __Pyx_CyFunction_USED 1\n#define __Pyx_CYFUNCTION_STATICMETHOD  0x01\n#define __Pyx_CYFUNCTION_CLASSMETHOD   0x02\n#define __Pyx_CYFUNCTION_CCLASS        0x04\n#define __Pyx_CyFunction_GetClosure(f)\\\n    (((__pyx_CyFunctionObject *) (f))->func_closure)\n#define __Pyx_CyFunction_GetClassObj(f)\\\n    (((__pyx_CyFunctionObject *) (f))->func_classobj)\n#define __Pyx_CyFunction_Defaults(type, f)\\\n    ((type *)(((__pyx_CyFunctionObject *) (f))->defaults))\n#define __Pyx_CyFunction_SetDefaultsGetter(f, g)\\\n    ((__pyx_CyFunctionObject *) (f))->defaults_getter = (g)\ntypedef struct {\n    PyCFunctionObject func;\n#if PY_VERSION_HEX < 0x030500A0\n    PyObject *func_weakreflist;\n#endif\n    PyObject *func_dict;\n    PyObject *func_name;\n    PyObject *func_qualname;\n    PyObject *func_doc;\n    PyObject *func_globals;\n    PyObject *func_code;\n    PyObject *func_closure;\n    PyObject *func_classobj;\n    void *defaults;\n    int defaults_pyobjects;\n    int flags;\n    PyObject *defaults_tuple;\n    PyObject *defaults_kwdict;\n    PyObject *(*defaults_getter)(PyObject *);\n    PyObject *func_annotations;\n} __pyx_CyFunctionObject;\nstatic PyTypeObject *__pyx_CyFunctionType = 0;\n#define __Pyx_CyFunction_NewEx(ml, flags, qualname, self, module, globals, code)\\\n    __Pyx_CyFunction_New(__pyx_CyFunctionType, ml, flags, qualname, self, module, globals, code)\nstatic PyObject *__Pyx_CyFunction_New(PyTypeObject *, PyMethodDef *ml,\n                                      int flags, PyObject* qualname,\n                                      PyObject *self,\n                                      PyObject *module, PyObject *globals,\n                                      PyObject* code);\nstatic CYTHON_INLINE void *__Pyx_CyFunction_InitDefaults(PyObject *m,\n                                                         size_t size,\n                                                         int pyobjects);\nstatic CYTHON_INLINE void __Pyx_CyFunction_SetDefaultsTuple(PyObject *m,\n                                                            PyObject *tuple);\nstatic CYTHON_INLINE void __Pyx_CyFunction_SetDefaultsKwDict(PyObject *m,\n                                                             PyObject *dict);\nstatic CYTHON_INLINE void __Pyx_CyFunction_SetAnnotationsDict(PyObject *m,\n                                                              PyObject *dict);\nstatic int __pyx_CyFunction_init(void);\n\n/* SetNameInClass.proto */\n#if CYTHON_COMPILING_IN_CPYTHON && PY_VERSION_HEX >= 0x030500A1\n#define __Pyx_SetNameInClass(ns, name, value)\\\n    (likely(PyDict_CheckExact(ns)) ? _PyDict_SetItem_KnownHash(ns, name, value, ((PyASCIIObject *) name)->hash) : PyObject_SetItem(ns, name, value))\n#elif CYTHON_COMPILING_IN_CPYTHON\n#define __Pyx_SetNameInClass(ns, name, value)\\\n    (likely(PyDict_CheckExact(ns)) ? PyDict_SetItem(ns, name, value) : PyObject_SetItem(ns, name, value))\n#else\n#define __Pyx_SetNameInClass(ns, name, value)  PyObject_SetItem(ns, name, value)\n#endif\n\n/* CLineInTraceback.proto */\n#ifdef CYTHON_CLINE_IN_TRACEBACK\n#define __Pyx_CLineForTraceback(tstate, c_line)  (((CYTHON_CLINE_IN_TRACEBACK)) ? c_line : 0)\n#else\nstatic int __Pyx_CLineForTraceback(PyThreadState *tstate, int c_line);\n#endif\n\n/* CodeObjectCache.proto */\ntypedef struct {\n    PyCodeObject* code_object;\n    int code_line;\n} __Pyx_CodeObjectCacheEntry;\nstruct __Pyx_CodeObjectCache {\n    int count;\n    int max_count;\n    __Pyx_CodeObjectCacheEntry* entries;\n};\nstatic struct __Pyx_CodeObjectCache __pyx_code_cache = {0,0,NULL};\nstatic int __pyx_bisect_code_objects(__Pyx_CodeObjectCacheEntry* entries, int count, int code_line);\nstatic PyCodeObject *__pyx_find_code_object(int code_line);\nstatic void __pyx_insert_code_object(int code_line, PyCodeObject* code_object);\n\n/* AddTraceback.proto */\nstatic void __Pyx_AddTraceback(const char *funcname, int c_line,\n                               int py_line, const char *filename);\n\n/* None.proto */\n#include <new>\n\n/* CIntToPy.proto */\nstatic CYTHON_INLINE PyObject* __Pyx_PyInt_From_int(int value);\n\n/* CIntToPy.proto */\nstatic CYTHON_INLINE PyObject* __Pyx_PyInt_From_uint64_t(uint64_t value);\n\n/* CIntToPy.proto */\nstatic CYTHON_INLINE PyObject* __Pyx_PyInt_From_uint32_t(uint32_t value);\n\n/* CIntToPy.proto */\nstatic CYTHON_INLINE PyObject* __Pyx_PyInt_From_int64_t(int64_t value);\n\n/* CIntToPy.proto */\nstatic CYTHON_INLINE PyObject* __Pyx_PyInt_From_int32_t(int32_t value);\n\n/* CppExceptionConversion.proto */\n#ifndef __Pyx_CppExn2PyErr\n#include <new>\n#include <typeinfo>\n#include <stdexcept>\n#include <ios>\nstatic void __Pyx_CppExn2PyErr() {\n  try {\n    if (PyErr_Occurred())\n      ; // let the latest Python exn pass through and ignore the current one\n    else\n      throw;\n  } catch (const std::bad_alloc& exn) {\n    PyErr_SetString(PyExc_MemoryError, exn.what());\n  } catch (const std::bad_cast& exn) {\n    PyErr_SetString(PyExc_TypeError, exn.what());\n  } catch (const std::bad_typeid& exn) {\n    PyErr_SetString(PyExc_TypeError, exn.what());\n  } catch (const std::domain_error& exn) {\n    PyErr_SetString(PyExc_ValueError, exn.what());\n  } catch (const std::invalid_argument& exn) {\n    PyErr_SetString(PyExc_ValueError, exn.what());\n  } catch (const std::ios_base::failure& exn) {\n    PyErr_SetString(PyExc_IOError, exn.what());\n  } catch (const std::out_of_range& exn) {\n    PyErr_SetString(PyExc_IndexError, exn.what());\n  } catch (const std::overflow_error& exn) {\n    PyErr_SetString(PyExc_OverflowError, exn.what());\n  } catch (const std::range_error& exn) {\n    PyErr_SetString(PyExc_ArithmeticError, exn.what());\n  } catch (const std::underflow_error& exn) {\n    PyErr_SetString(PyExc_ArithmeticError, exn.what());\n  } catch (const std::exception& exn) {\n    PyErr_SetString(PyExc_RuntimeError, exn.what());\n  }\n  catch (...)\n  {\n    PyErr_SetString(PyExc_RuntimeError, \"Unknown exception\");\n  }\n}\n#endif\n\n/* CIntFromPy.proto */\nstatic CYTHON_INLINE size_t __Pyx_PyInt_As_size_t(PyObject *);\n\n/* CIntFromPy.proto */\nstatic CYTHON_INLINE int64_t __Pyx_PyInt_As_int64_t(PyObject *);\n\n/* CIntFromPy.proto */\nstatic CYTHON_INLINE uint64_t __Pyx_PyInt_As_uint64_t(PyObject *);\n\n/* CIntFromPy.proto */\nstatic CYTHON_INLINE int32_t __Pyx_PyInt_As_int32_t(PyObject *);\n\n/* CIntFromPy.proto */\nstatic CYTHON_INLINE uint32_t __Pyx_PyInt_As_uint32_t(PyObject *);\n\n/* CIntFromPy.proto */\nstatic CYTHON_INLINE time_t __Pyx_PyInt_As_time_t(PyObject *);\n\n/* CIntToPy.proto */\nstatic CYTHON_INLINE PyObject* __Pyx_PyInt_From_long(long value);\n\n/* CIntFromPy.proto */\nstatic CYTHON_INLINE long __Pyx_PyInt_As_long(PyObject *);\n\n/* CIntFromPy.proto */\nstatic CYTHON_INLINE int __Pyx_PyInt_As_int(PyObject *);\n\n/* CheckBinaryVersion.proto */\nstatic int __Pyx_check_binary_version(void);\n\n/* FunctionExport.proto */\nstatic int __Pyx_ExportFunction(const char *name, void (*f)(void), const char *sig);\n\n/* InitStrings.proto */\nstatic int __Pyx_InitStrings(__Pyx_StringTabEntry *t);\n\nstatic void __pyx_f_9pywrapfst_6Weight__check_weight(struct __pyx_obj_9pywrapfst_Weight *__pyx_v_self); /* proto*/\nstatic struct __pyx_obj_9pywrapfst_Weight *__pyx_f_9pywrapfst_6Weight_copy(struct __pyx_obj_9pywrapfst_Weight *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic std::string __pyx_f_9pywrapfst_6Weight_to_string(struct __pyx_obj_9pywrapfst_Weight *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic std::string __pyx_f_9pywrapfst_6Weight_type(struct __pyx_obj_9pywrapfst_Weight *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic __pyx_t_10basictypes_int64 __pyx_f_9pywrapfst_12_SymbolTable_available_key(struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic std::string __pyx_f_9pywrapfst_12_SymbolTable_checksum(struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic struct __pyx_obj_9pywrapfst_SymbolTable *__pyx_f_9pywrapfst_12_SymbolTable_copy(struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic __pyx_t_10basictypes_int64 __pyx_f_9pywrapfst_12_SymbolTable_get_nth_key(struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_self, Py_ssize_t __pyx_v_pos, int __pyx_skip_dispatch); /* proto*/\nstatic std::string __pyx_f_9pywrapfst_12_SymbolTable_labeled_checksum(struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic bool __pyx_f_9pywrapfst_12_SymbolTable_member(struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_self, PyObject *__pyx_v_key, int __pyx_skip_dispatch); /* proto*/\nstatic std::string __pyx_f_9pywrapfst_12_SymbolTable_name(struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic size_t __pyx_f_9pywrapfst_12_SymbolTable_num_symbols(struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic void __pyx_f_9pywrapfst_12_SymbolTable_write(struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_self, PyObject *__pyx_v_filename, int __pyx_skip_dispatch); /* proto*/\nstatic void __pyx_f_9pywrapfst_12_SymbolTable_write_text(struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_self, PyObject *__pyx_v_filename, int __pyx_skip_dispatch); /* proto*/\nstatic __pyx_t_10basictypes_int64 __pyx_f_9pywrapfst_19_MutableSymbolTable_add_symbol(struct __pyx_obj_9pywrapfst__MutableSymbolTable *__pyx_v_self, PyObject *__pyx_v_symbol, int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_19_MutableSymbolTable_add_symbol *__pyx_optional_args); /* proto*/\nstatic void __pyx_f_9pywrapfst_19_MutableSymbolTable_add_table(struct __pyx_obj_9pywrapfst__MutableSymbolTable *__pyx_v_self, struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_syms, int __pyx_skip_dispatch); /* proto*/\nstatic void __pyx_f_9pywrapfst_19_MutableSymbolTable_set_name(struct __pyx_obj_9pywrapfst__MutableSymbolTable *__pyx_v_self, PyObject *__pyx_v_new_name, int __pyx_skip_dispatch); /* proto*/\nstatic bool __pyx_f_9pywrapfst_19SymbolTableIterator_done(struct __pyx_obj_9pywrapfst_SymbolTableIterator *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic void __pyx_f_9pywrapfst_19SymbolTableIterator_next(struct __pyx_obj_9pywrapfst_SymbolTableIterator *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic void __pyx_f_9pywrapfst_19SymbolTableIterator_reset(struct __pyx_obj_9pywrapfst_SymbolTableIterator *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic std::string __pyx_f_9pywrapfst_19SymbolTableIterator_symbol(struct __pyx_obj_9pywrapfst_SymbolTableIterator *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic __pyx_t_10basictypes_int64 __pyx_f_9pywrapfst_19SymbolTableIterator_value(struct __pyx_obj_9pywrapfst_SymbolTableIterator *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic std::string __pyx_f_9pywrapfst_12EncodeMapper_arc_type(struct __pyx_obj_9pywrapfst_EncodeMapper *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic __pyx_t_10basictypes_uint32 __pyx_f_9pywrapfst_12EncodeMapper_flags(struct __pyx_obj_9pywrapfst_EncodeMapper *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic struct __pyx_obj_9pywrapfst__EncodeMapperSymbolTable *__pyx_f_9pywrapfst_12EncodeMapper_input_symbols(struct __pyx_obj_9pywrapfst_EncodeMapper *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic struct __pyx_obj_9pywrapfst__EncodeMapperSymbolTable *__pyx_f_9pywrapfst_12EncodeMapper_output_symbols(struct __pyx_obj_9pywrapfst_EncodeMapper *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic __pyx_t_10basictypes_uint64 __pyx_f_9pywrapfst_12EncodeMapper_properties(struct __pyx_obj_9pywrapfst_EncodeMapper *__pyx_v_self, __pyx_t_10basictypes_uint64 __pyx_v_mask, int __pyx_skip_dispatch); /* proto*/\nstatic void __pyx_f_9pywrapfst_12EncodeMapper_set_input_symbols(struct __pyx_obj_9pywrapfst_EncodeMapper *__pyx_v_self, struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_syms, int __pyx_skip_dispatch); /* proto*/\nstatic void __pyx_f_9pywrapfst_12EncodeMapper_set_output_symbols(struct __pyx_obj_9pywrapfst_EncodeMapper *__pyx_v_self, struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_syms, int __pyx_skip_dispatch); /* proto*/\nstatic std::string __pyx_f_9pywrapfst_12EncodeMapper_weight_type(struct __pyx_obj_9pywrapfst_EncodeMapper *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic std::string __pyx_f_9pywrapfst_4_Fst_arc_type(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic struct __pyx_obj_9pywrapfst_ArcIterator *__pyx_f_9pywrapfst_4_Fst_arcs(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self, __pyx_t_10basictypes_int64 __pyx_v_state, int __pyx_skip_dispatch); /* proto*/\nstatic struct __pyx_obj_9pywrapfst__Fst *__pyx_f_9pywrapfst_4_Fst_copy(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic void __pyx_f_9pywrapfst_4_Fst_draw(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self, PyObject *__pyx_v_filename, int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_4_Fst_draw *__pyx_optional_args); /* proto*/\nstatic struct __pyx_obj_9pywrapfst_Weight *__pyx_f_9pywrapfst_4_Fst_final(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self, __pyx_t_10basictypes_int64 __pyx_v_state, int __pyx_skip_dispatch); /* proto*/\nstatic std::string __pyx_f_9pywrapfst_4_Fst_fst_type(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic struct __pyx_obj_9pywrapfst__FstSymbolTable *__pyx_f_9pywrapfst_4_Fst_input_symbols(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic size_t __pyx_f_9pywrapfst_4_Fst_num_arcs(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self, __pyx_t_10basictypes_int64 __pyx_v_state, int __pyx_skip_dispatch); /* proto*/\nstatic size_t __pyx_f_9pywrapfst_4_Fst_num_input_epsilons(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self, __pyx_t_10basictypes_int64 __pyx_v_state, int __pyx_skip_dispatch); /* proto*/\nstatic size_t __pyx_f_9pywrapfst_4_Fst_num_output_epsilons(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self, __pyx_t_10basictypes_int64 __pyx_v_state, int __pyx_skip_dispatch); /* proto*/\nstatic struct __pyx_obj_9pywrapfst__FstSymbolTable *__pyx_f_9pywrapfst_4_Fst_output_symbols(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic __pyx_t_10basictypes_uint64 __pyx_f_9pywrapfst_4_Fst_properties(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self, __pyx_t_10basictypes_uint64 __pyx_v_mask, bool __pyx_v_test, int __pyx_skip_dispatch); /* proto*/\nstatic __pyx_t_10basictypes_int64 __pyx_f_9pywrapfst_4_Fst_start(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic struct __pyx_obj_9pywrapfst_StateIterator *__pyx_f_9pywrapfst_4_Fst_states(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic std::string __pyx_f_9pywrapfst_4_Fst_text(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self, int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_4_Fst_text *__pyx_optional_args); /* proto*/\nstatic bool __pyx_f_9pywrapfst_4_Fst_verify(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic std::string __pyx_f_9pywrapfst_4_Fst_weight_type(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic void __pyx_f_9pywrapfst_4_Fst_write(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self, PyObject *__pyx_v_filename, int __pyx_skip_dispatch); /* proto*/\nstatic std::string __pyx_f_9pywrapfst_4_Fst_write_to_string(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic void __pyx_f_9pywrapfst_11_MutableFst__check_mutating_imethod(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self); /* proto*/\nstatic void __pyx_f_9pywrapfst_11_MutableFst__add_arc(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, __pyx_t_10basictypes_int64 __pyx_v_state, struct __pyx_obj_9pywrapfst_Arc *__pyx_v_arc); /* proto*/\nstatic __pyx_t_10basictypes_int64 __pyx_f_9pywrapfst_11_MutableFst_add_state(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic void __pyx_f_9pywrapfst_11_MutableFst__arcsort(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, struct __pyx_opt_args_9pywrapfst_11_MutableFst__arcsort *__pyx_optional_args); /* proto*/\nstatic void __pyx_f_9pywrapfst_11_MutableFst__closure(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, struct __pyx_opt_args_9pywrapfst_11_MutableFst__closure *__pyx_optional_args); /* proto*/\nstatic void __pyx_f_9pywrapfst_11_MutableFst__concat(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst); /* proto*/\nstatic void __pyx_f_9pywrapfst_11_MutableFst__connect(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self); /* proto*/\nstatic void __pyx_f_9pywrapfst_11_MutableFst__decode(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, struct __pyx_obj_9pywrapfst_EncodeMapper *__pyx_v_encoder); /* proto*/\nstatic void __pyx_f_9pywrapfst_11_MutableFst__delete_arcs(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, __pyx_t_10basictypes_int64 __pyx_v_state, struct __pyx_opt_args_9pywrapfst_11_MutableFst__delete_arcs *__pyx_optional_args); /* proto*/\nstatic void __pyx_f_9pywrapfst_11_MutableFst__delete_states(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, struct __pyx_opt_args_9pywrapfst_11_MutableFst__delete_states *__pyx_optional_args); /* proto*/\nstatic void __pyx_f_9pywrapfst_11_MutableFst__encode(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, struct __pyx_obj_9pywrapfst_EncodeMapper *__pyx_v_encoder); /* proto*/\nstatic void __pyx_f_9pywrapfst_11_MutableFst__invert(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self); /* proto*/\nstatic void __pyx_f_9pywrapfst_11_MutableFst__minimize(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, struct __pyx_opt_args_9pywrapfst_11_MutableFst__minimize *__pyx_optional_args); /* proto*/\nstatic struct __pyx_obj_9pywrapfst_MutableArcIterator *__pyx_f_9pywrapfst_11_MutableFst_mutable_arcs(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, __pyx_t_10basictypes_int64 __pyx_v_state, int __pyx_skip_dispatch); /* proto*/\nstatic __pyx_t_10basictypes_int64 __pyx_f_9pywrapfst_11_MutableFst_num_states(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic void __pyx_f_9pywrapfst_11_MutableFst__project(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, struct __pyx_opt_args_9pywrapfst_11_MutableFst__project *__pyx_optional_args); /* proto*/\nstatic void __pyx_f_9pywrapfst_11_MutableFst__prune(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, struct __pyx_opt_args_9pywrapfst_11_MutableFst__prune *__pyx_optional_args); /* proto*/\nstatic void __pyx_f_9pywrapfst_11_MutableFst__push(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, struct __pyx_opt_args_9pywrapfst_11_MutableFst__push *__pyx_optional_args); /* proto*/\nstatic void __pyx_f_9pywrapfst_11_MutableFst__relabel_pairs(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, struct __pyx_opt_args_9pywrapfst_11_MutableFst__relabel_pairs *__pyx_optional_args); /* proto*/\nstatic void __pyx_f_9pywrapfst_11_MutableFst__relabel_tables(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, struct __pyx_opt_args_9pywrapfst_11_MutableFst__relabel_tables *__pyx_optional_args); /* proto*/\nstatic void __pyx_f_9pywrapfst_11_MutableFst__reserve_arcs(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, __pyx_t_10basictypes_int64 __pyx_v_state, size_t __pyx_v_n); /* proto*/\nstatic void __pyx_f_9pywrapfst_11_MutableFst__reserve_states(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, __pyx_t_10basictypes_int64 __pyx_v_n); /* proto*/\nstatic void __pyx_f_9pywrapfst_11_MutableFst__reweight(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, PyObject *__pyx_v_potentials, struct __pyx_opt_args_9pywrapfst_11_MutableFst__reweight *__pyx_optional_args); /* proto*/\nstatic void __pyx_f_9pywrapfst_11_MutableFst__rmepsilon(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, struct __pyx_opt_args_9pywrapfst_11_MutableFst__rmepsilon *__pyx_optional_args); /* proto*/\nstatic void __pyx_f_9pywrapfst_11_MutableFst__set_final(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, __pyx_t_10basictypes_int64 __pyx_v_state, struct __pyx_opt_args_9pywrapfst_11_MutableFst__set_final *__pyx_optional_args); /* proto*/\nstatic void __pyx_f_9pywrapfst_11_MutableFst__set_input_symbols(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_syms); /* proto*/\nstatic void __pyx_f_9pywrapfst_11_MutableFst__set_output_symbols(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_syms); /* proto*/\nstatic void __pyx_f_9pywrapfst_11_MutableFst__set_properties(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, __pyx_t_10basictypes_uint64 __pyx_v_props, __pyx_t_10basictypes_uint64 __pyx_v_mask); /* proto*/\nstatic void __pyx_f_9pywrapfst_11_MutableFst__set_start(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, __pyx_t_10basictypes_int64 __pyx_v_state); /* proto*/\nstatic void __pyx_f_9pywrapfst_11_MutableFst__topsort(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self); /* proto*/\nstatic void __pyx_f_9pywrapfst_11_MutableFst__union(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst); /* proto*/\nstatic struct __pyx_obj_9pywrapfst_Arc *__pyx_f_9pywrapfst_3Arc_copy(struct __pyx_obj_9pywrapfst_Arc *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic bool __pyx_f_9pywrapfst_11ArcIterator_done(struct __pyx_obj_9pywrapfst_ArcIterator *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic __pyx_t_10basictypes_uint32 __pyx_f_9pywrapfst_11ArcIterator_flags(struct __pyx_obj_9pywrapfst_ArcIterator *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic void __pyx_f_9pywrapfst_11ArcIterator_next(struct __pyx_obj_9pywrapfst_ArcIterator *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic size_t __pyx_f_9pywrapfst_11ArcIterator_position(struct __pyx_obj_9pywrapfst_ArcIterator *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic void __pyx_f_9pywrapfst_11ArcIterator_reset(struct __pyx_obj_9pywrapfst_ArcIterator *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic void __pyx_f_9pywrapfst_11ArcIterator_seek(struct __pyx_obj_9pywrapfst_ArcIterator *__pyx_v_self, size_t __pyx_v_a, int __pyx_skip_dispatch); /* proto*/\nstatic void __pyx_f_9pywrapfst_11ArcIterator_set_flags(struct __pyx_obj_9pywrapfst_ArcIterator *__pyx_v_self, __pyx_t_10basictypes_uint32 __pyx_v_flags, __pyx_t_10basictypes_uint32 __pyx_v_mask, int __pyx_skip_dispatch); /* proto*/\nstatic PyObject *__pyx_f_9pywrapfst_11ArcIterator_value(struct __pyx_obj_9pywrapfst_ArcIterator *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic bool __pyx_f_9pywrapfst_18MutableArcIterator_done(struct __pyx_obj_9pywrapfst_MutableArcIterator *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic __pyx_t_10basictypes_uint32 __pyx_f_9pywrapfst_18MutableArcIterator_flags(struct __pyx_obj_9pywrapfst_MutableArcIterator *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic void __pyx_f_9pywrapfst_18MutableArcIterator_next(struct __pyx_obj_9pywrapfst_MutableArcIterator *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic size_t __pyx_f_9pywrapfst_18MutableArcIterator_position(struct __pyx_obj_9pywrapfst_MutableArcIterator *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic void __pyx_f_9pywrapfst_18MutableArcIterator_reset(struct __pyx_obj_9pywrapfst_MutableArcIterator *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic void __pyx_f_9pywrapfst_18MutableArcIterator_seek(struct __pyx_obj_9pywrapfst_MutableArcIterator *__pyx_v_self, size_t __pyx_v_a, int __pyx_skip_dispatch); /* proto*/\nstatic void __pyx_f_9pywrapfst_18MutableArcIterator_set_flags(struct __pyx_obj_9pywrapfst_MutableArcIterator *__pyx_v_self, __pyx_t_10basictypes_uint32 __pyx_v_flags, __pyx_t_10basictypes_uint32 __pyx_v_mask, int __pyx_skip_dispatch); /* proto*/\nstatic void __pyx_f_9pywrapfst_18MutableArcIterator_set_value(struct __pyx_obj_9pywrapfst_MutableArcIterator *__pyx_v_self, struct __pyx_obj_9pywrapfst_Arc *__pyx_v_arc, int __pyx_skip_dispatch); /* proto*/\nstatic PyObject *__pyx_f_9pywrapfst_18MutableArcIterator_value(struct __pyx_obj_9pywrapfst_MutableArcIterator *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic bool __pyx_f_9pywrapfst_13StateIterator_done(struct __pyx_obj_9pywrapfst_StateIterator *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic void __pyx_f_9pywrapfst_13StateIterator_next(struct __pyx_obj_9pywrapfst_StateIterator *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic void __pyx_f_9pywrapfst_13StateIterator_reset(struct __pyx_obj_9pywrapfst_StateIterator *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic __pyx_t_10basictypes_int64 __pyx_f_9pywrapfst_13StateIterator_value(struct __pyx_obj_9pywrapfst_StateIterator *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic struct __pyx_obj_9pywrapfst__Fst *__pyx_f_9pywrapfst_8Compiler_compile(struct __pyx_obj_9pywrapfst_Compiler *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic void __pyx_f_9pywrapfst_8Compiler_write(struct __pyx_obj_9pywrapfst_Compiler *__pyx_v_self, PyObject *__pyx_v_expression, int __pyx_skip_dispatch); /* proto*/\nstatic std::string __pyx_f_9pywrapfst_9FarReader_arc_type(struct __pyx_obj_9pywrapfst_FarReader *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic bool __pyx_f_9pywrapfst_9FarReader_done(struct __pyx_obj_9pywrapfst_FarReader *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic bool __pyx_f_9pywrapfst_9FarReader_error(struct __pyx_obj_9pywrapfst_FarReader *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic std::string __pyx_f_9pywrapfst_9FarReader_far_type(struct __pyx_obj_9pywrapfst_FarReader *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic bool __pyx_f_9pywrapfst_9FarReader_find(struct __pyx_obj_9pywrapfst_FarReader *__pyx_v_self, PyObject *__pyx_v_key, int __pyx_skip_dispatch); /* proto*/\nstatic struct __pyx_obj_9pywrapfst__Fst *__pyx_f_9pywrapfst_9FarReader_get_fst(struct __pyx_obj_9pywrapfst_FarReader *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic std::string __pyx_f_9pywrapfst_9FarReader_get_key(struct __pyx_obj_9pywrapfst_FarReader *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic void __pyx_f_9pywrapfst_9FarReader_next(struct __pyx_obj_9pywrapfst_FarReader *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic void __pyx_f_9pywrapfst_9FarReader_reset(struct __pyx_obj_9pywrapfst_FarReader *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic void __pyx_f_9pywrapfst_9FarWriter_close(struct __pyx_obj_9pywrapfst_FarWriter *__pyx_v_self); /* proto*/\nstatic void __pyx_f_9pywrapfst_9FarWriter_add(struct __pyx_obj_9pywrapfst_FarWriter *__pyx_v_self, PyObject *__pyx_v_key, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst, int __pyx_skip_dispatch); /* proto*/\nstatic std::string __pyx_f_9pywrapfst_9FarWriter_arc_type(struct __pyx_obj_9pywrapfst_FarWriter *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic bool __pyx_f_9pywrapfst_9FarWriter_error(struct __pyx_obj_9pywrapfst_FarWriter *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\nstatic std::string __pyx_f_9pywrapfst_9FarWriter_far_type(struct __pyx_obj_9pywrapfst_FarWriter *__pyx_v_self, int __pyx_skip_dispatch); /* proto*/\n\n/* Module declarations from 'libc.stddef' */\n\n/* Module declarations from 'libc.time' */\n\n/* Module declarations from 'libcpp' */\n\n/* Module declarations from 'libcpp.memory' */\n\n/* Module declarations from 'libcpp.utility' */\n\n/* Module declarations from 'libcpp.vector' */\n\n/* Module declarations from 'libc.string' */\n\n/* Module declarations from 'libcpp.string' */\n\n/* Module declarations from 'libc.stdint' */\n\n/* Module declarations from 'basictypes' */\n\n/* Module declarations from 'ios' */\n\n/* Module declarations from 'fst' */\n\n/* Module declarations from 'posix.types' */\n\n/* Module declarations from 'posix.unistd' */\n\n/* Module declarations from 'libcpp.cast' */\n\n/* Module declarations from 'memory' */\n\n/* Module declarations from 'pywrapfst' */\nstatic PyTypeObject *__pyx_ptype_9pywrapfst_Weight = 0;\nstatic PyTypeObject *__pyx_ptype_9pywrapfst__SymbolTable = 0;\nstatic PyTypeObject *__pyx_ptype_9pywrapfst__EncodeMapperSymbolTable = 0;\nstatic PyTypeObject *__pyx_ptype_9pywrapfst__FstSymbolTable = 0;\nstatic PyTypeObject *__pyx_ptype_9pywrapfst__MutableSymbolTable = 0;\nstatic PyTypeObject *__pyx_ptype_9pywrapfst__MutableFstSymbolTable = 0;\nstatic PyTypeObject *__pyx_ptype_9pywrapfst_SymbolTable = 0;\nstatic PyTypeObject *__pyx_ptype_9pywrapfst_SymbolTableIterator = 0;\nstatic PyTypeObject *__pyx_ptype_9pywrapfst_EncodeMapper = 0;\nstatic PyTypeObject *__pyx_ptype_9pywrapfst__Fst = 0;\nstatic PyTypeObject *__pyx_ptype_9pywrapfst__MutableFst = 0;\nstatic PyTypeObject *__pyx_ptype_9pywrapfst_Arc = 0;\nstatic PyTypeObject *__pyx_ptype_9pywrapfst_ArcIterator = 0;\nstatic PyTypeObject *__pyx_ptype_9pywrapfst_MutableArcIterator = 0;\nstatic PyTypeObject *__pyx_ptype_9pywrapfst_StateIterator = 0;\nstatic PyTypeObject *__pyx_ptype_9pywrapfst_Compiler = 0;\nstatic PyTypeObject *__pyx_ptype_9pywrapfst_FarReader = 0;\nstatic PyTypeObject *__pyx_ptype_9pywrapfst_FarWriter = 0;\nstatic std::string __pyx_f_9pywrapfst_tostring(PyObject *, struct __pyx_opt_args_9pywrapfst_tostring *__pyx_optional_args); /*proto*/\nstatic std::string __pyx_f_9pywrapfst_weight_tostring(PyObject *, struct __pyx_opt_args_9pywrapfst_weight_tostring *__pyx_optional_args); /*proto*/\nstatic enum fst::ComposeFilter __pyx_f_9pywrapfst__get_compose_filter(std::string const &); /*proto*/\nstatic enum fst::QueueType __pyx_f_9pywrapfst__get_queue_type(std::string const &); /*proto*/\nstatic enum fst::script::RandArcSelection __pyx_f_9pywrapfst__get_rand_arc_selection(std::string const &); /*proto*/\nstatic enum fst::ReplaceLabelType __pyx_f_9pywrapfst__get_replace_label_type(std::string const &, bool); /*proto*/\nstatic fst::script::WeightClass __pyx_f_9pywrapfst__get_WeightClass_or_One(std::string const &, PyObject *); /*proto*/\nstatic fst::script::WeightClass __pyx_f_9pywrapfst__get_WeightClass_or_Zero(std::string const &, PyObject *); /*proto*/\nstatic struct __pyx_obj_9pywrapfst_Weight *__pyx_f_9pywrapfst__Zero(PyObject *); /*proto*/\nstatic struct __pyx_obj_9pywrapfst_Weight *__pyx_f_9pywrapfst__One(PyObject *); /*proto*/\nstatic struct __pyx_obj_9pywrapfst_Weight *__pyx_f_9pywrapfst__NoWeight(PyObject *); /*proto*/\nstatic struct __pyx_obj_9pywrapfst_Weight *__pyx_f_9pywrapfst__plus(struct __pyx_obj_9pywrapfst_Weight *, struct __pyx_obj_9pywrapfst_Weight *); /*proto*/\nstatic struct __pyx_obj_9pywrapfst_Weight *__pyx_f_9pywrapfst__times(struct __pyx_obj_9pywrapfst_Weight *, struct __pyx_obj_9pywrapfst_Weight *); /*proto*/\nstatic struct __pyx_obj_9pywrapfst_Weight *__pyx_f_9pywrapfst__divide(struct __pyx_obj_9pywrapfst_Weight *, struct __pyx_obj_9pywrapfst_Weight *); /*proto*/\nstatic struct __pyx_obj_9pywrapfst_Weight *__pyx_f_9pywrapfst__power(struct __pyx_obj_9pywrapfst_Weight *, size_t); /*proto*/\nstatic struct __pyx_obj_9pywrapfst__EncodeMapperSymbolTable *__pyx_f_9pywrapfst__init_EncodeMapperSymbolTable(fst::SymbolTable *, std::shared_ptr<fst::script::EncodeMapperClass> ); /*proto*/\nstatic struct __pyx_obj_9pywrapfst__FstSymbolTable *__pyx_f_9pywrapfst__init_FstSymbolTable(fst::SymbolTable *, std::shared_ptr<fst::script::FstClass> ); /*proto*/\nstatic struct __pyx_obj_9pywrapfst__MutableFstSymbolTable *__pyx_f_9pywrapfst__init_MutableFstSymbolTable(fst::SymbolTable *, std::shared_ptr<fst::script::MutableFstClass> ); /*proto*/\nstatic struct __pyx_obj_9pywrapfst_SymbolTable *__pyx_f_9pywrapfst__init_SymbolTable(fst::SymbolTable *); /*proto*/\nstatic struct __pyx_obj_9pywrapfst__Fst *__pyx_f_9pywrapfst__init_Fst(__pyx_t_9pywrapfst_FstClass_ptr); /*proto*/\nstatic struct __pyx_obj_9pywrapfst__MutableFst *__pyx_f_9pywrapfst__init_MutableFst(__pyx_t_9pywrapfst_MutableFstClass_ptr); /*proto*/\nstatic struct __pyx_obj_9pywrapfst__Fst *__pyx_f_9pywrapfst__init_XFst(__pyx_t_9pywrapfst_FstClass_ptr); /*proto*/\nstatic struct __pyx_obj_9pywrapfst__MutableFst *__pyx_f_9pywrapfst__create_Fst(struct __pyx_opt_args_9pywrapfst__create_Fst *__pyx_optional_args); /*proto*/\nstatic struct __pyx_obj_9pywrapfst__Fst *__pyx_f_9pywrapfst__read(PyObject *, int __pyx_skip_dispatch); /*proto*/\nstatic struct __pyx_obj_9pywrapfst__Fst *__pyx_f_9pywrapfst__read_from_string(PyObject *, int __pyx_skip_dispatch); /*proto*/\nstatic struct __pyx_obj_9pywrapfst_Arc *__pyx_f_9pywrapfst__init_Arc(fst::script::ArcClass const &); /*proto*/\nstatic struct __pyx_obj_9pywrapfst__Fst *__pyx_f_9pywrapfst__map(struct __pyx_obj_9pywrapfst__Fst *, struct __pyx_opt_args_9pywrapfst__map *__pyx_optional_args); /*proto*/\nstatic struct __pyx_obj_9pywrapfst__Fst *__pyx_f_9pywrapfst_arcmap(struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_arcmap *__pyx_optional_args); /*proto*/\nstatic struct __pyx_obj_9pywrapfst__MutableFst *__pyx_f_9pywrapfst_compose(struct __pyx_obj_9pywrapfst__Fst *, struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_compose *__pyx_optional_args); /*proto*/\nstatic struct __pyx_obj_9pywrapfst__Fst *__pyx_f_9pywrapfst_convert(struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_convert *__pyx_optional_args); /*proto*/\nstatic struct __pyx_obj_9pywrapfst__MutableFst *__pyx_f_9pywrapfst_determinize(struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_determinize *__pyx_optional_args); /*proto*/\nstatic struct __pyx_obj_9pywrapfst__MutableFst *__pyx_f_9pywrapfst_difference(struct __pyx_obj_9pywrapfst__Fst *, struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_difference *__pyx_optional_args); /*proto*/\nstatic struct __pyx_obj_9pywrapfst__MutableFst *__pyx_f_9pywrapfst_disambiguate(struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_disambiguate *__pyx_optional_args); /*proto*/\nstatic struct __pyx_obj_9pywrapfst__MutableFst *__pyx_f_9pywrapfst_epsnormalize(struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_epsnormalize *__pyx_optional_args); /*proto*/\nstatic bool __pyx_f_9pywrapfst_equal(struct __pyx_obj_9pywrapfst__Fst *, struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_equal *__pyx_optional_args); /*proto*/\nstatic bool __pyx_f_9pywrapfst_equivalent(struct __pyx_obj_9pywrapfst__Fst *, struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_equivalent *__pyx_optional_args); /*proto*/\nstatic struct __pyx_obj_9pywrapfst__MutableFst *__pyx_f_9pywrapfst_intersect(struct __pyx_obj_9pywrapfst__Fst *, struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_intersect *__pyx_optional_args); /*proto*/\nstatic bool __pyx_f_9pywrapfst_isomorphic(struct __pyx_obj_9pywrapfst__Fst *, struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_isomorphic *__pyx_optional_args); /*proto*/\nstatic struct __pyx_obj_9pywrapfst__MutableFst *__pyx_f_9pywrapfst_prune(struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_prune *__pyx_optional_args); /*proto*/\nstatic struct __pyx_obj_9pywrapfst__MutableFst *__pyx_f_9pywrapfst_push(struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_push *__pyx_optional_args); /*proto*/\nstatic bool __pyx_f_9pywrapfst_randequivalent(struct __pyx_obj_9pywrapfst__Fst *, struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_randequivalent *__pyx_optional_args); /*proto*/\nstatic struct __pyx_obj_9pywrapfst__MutableFst *__pyx_f_9pywrapfst_randgen(struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_randgen *__pyx_optional_args); /*proto*/\nstatic struct __pyx_obj_9pywrapfst__MutableFst *__pyx_f_9pywrapfst_replace(PyObject *, int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_replace *__pyx_optional_args); /*proto*/\nstatic struct __pyx_obj_9pywrapfst__MutableFst *__pyx_f_9pywrapfst_reverse(struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_reverse *__pyx_optional_args); /*proto*/\nstatic std::vector<fst::script::WeightClass>  *__pyx_f_9pywrapfst__shortestdistance(struct __pyx_obj_9pywrapfst__Fst *, struct __pyx_opt_args_9pywrapfst__shortestdistance *__pyx_optional_args); /*proto*/\nstatic struct __pyx_obj_9pywrapfst__MutableFst *__pyx_f_9pywrapfst_shortestpath(struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_shortestpath *__pyx_optional_args); /*proto*/\nstatic struct __pyx_obj_9pywrapfst__Fst *__pyx_f_9pywrapfst_statemap(struct __pyx_obj_9pywrapfst__Fst *, PyObject *, int __pyx_skip_dispatch); /*proto*/\nstatic struct __pyx_obj_9pywrapfst__MutableFst *__pyx_f_9pywrapfst_synchronize(struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch); /*proto*/\nstatic struct __pyx_obj_9pywrapfst_SymbolTable *__pyx_f_9pywrapfst_compact_symbol_table(struct __pyx_obj_9pywrapfst__SymbolTable *, int __pyx_skip_dispatch); /*proto*/\nstatic struct __pyx_obj_9pywrapfst_SymbolTable *__pyx_f_9pywrapfst_merge_symbol_table(struct __pyx_obj_9pywrapfst__SymbolTable *, struct __pyx_obj_9pywrapfst__SymbolTable *, int __pyx_skip_dispatch); /*proto*/\nstatic std::string __pyx_convert_string_from_py_std__in_string(PyObject *); /*proto*/\nstatic CYTHON_INLINE PyObject *__pyx_convert_PyObject_string_to_py_std__in_string(std::string const &); /*proto*/\nstatic CYTHON_INLINE PyObject *__pyx_convert_PyUnicode_string_to_py_std__in_string(std::string const &); /*proto*/\nstatic CYTHON_INLINE PyObject *__pyx_convert_PyStr_string_to_py_std__in_string(std::string const &); /*proto*/\nstatic CYTHON_INLINE PyObject *__pyx_convert_PyBytes_string_to_py_std__in_string(std::string const &); /*proto*/\nstatic CYTHON_INLINE PyObject *__pyx_convert_PyByteArray_string_to_py_std__in_string(std::string const &); /*proto*/\nstatic std::vector<__pyx_t_10basictypes_int64>  __pyx_convert_vector_from_py___pyx_t_10basictypes_int64(PyObject *); /*proto*/\nstatic std::vector<std::string>  __pyx_convert_vector_from_py_std_3a__3a_string(PyObject *); /*proto*/\n#define __Pyx_MODULE_NAME \"pywrapfst\"\nextern int __pyx_module_is_main_pywrapfst;\nint __pyx_module_is_main_pywrapfst = 0;\n\n/* Implementation of 'pywrapfst' */\nstatic PyObject *__pyx_builtin_ValueError;\nstatic PyObject *__pyx_builtin_RuntimeError;\nstatic PyObject *__pyx_builtin_IndexError;\nstatic PyObject *__pyx_builtin_IOError;\nstatic PyObject *__pyx_builtin_object;\nstatic PyObject *__pyx_builtin_staticmethod;\nstatic PyObject *__pyx_builtin_id;\nstatic PyObject *__pyx_builtin_TypeError;\nstatic PyObject *__pyx_builtin_StopIteration;\nstatic PyObject *__pyx_builtin_KeyError;\nstatic const char __pyx_k_g[] = \"g\";\nstatic const char __pyx_k_n[] = \"n\";\nstatic const char __pyx_k_w[] = \"w\";\nstatic const char __pyx_k_id[] = \"id\";\nstatic const char __pyx_k_Fst[] = \"Fst\";\nstatic const char __pyx_k_One[] = \"One\";\nstatic const char __pyx_k__24[] = \"\";\nstatic const char __pyx_k_add[] = \"add\";\nstatic const char __pyx_k_arc[] = \"arc\";\nstatic const char __pyx_k_cls[] = \"cls\";\nstatic const char __pyx_k_doc[] = \"__doc__\";\nstatic const char __pyx_k_dot[] = \"dot\";\nstatic const char __pyx_k_key[] = \"key\";\nstatic const char __pyx_k_lhs[] = \"lhs\";\nstatic const char __pyx_k_new[] = \"__new__\";\nstatic const char __pyx_k_rhs[] = \"rhs\";\nstatic const char __pyx_k_PIPE[] = \"PIPE\";\nstatic const char __pyx_k_Tsvg[] = \"-Tsvg\";\nstatic const char __pyx_k_Zero[] = \"Zero\";\nstatic const char __pyx_k_arcs[] = \"arcs\";\nstatic const char __pyx_k_auto[] = \"auto\";\nstatic const char __pyx_k_copy[] = \"copy\";\nstatic const char __pyx_k_done[] = \"done\";\nstatic const char __pyx_k_draw[] = \"draw\";\nstatic const char __pyx_k_find[] = \"find\";\nstatic const char __pyx_k_ifst[] = \"ifst\";\nstatic const char __pyx_k_main[] = \"__main__\";\nstatic const char __pyx_k_mask[] = \"mask\";\nstatic const char __pyx_k_name[] = \"__name__\";\nstatic const char __pyx_k_next[] = \"next\";\nstatic const char __pyx_k_open[] = \"open\";\nstatic const char __pyx_k_plus[] = \"plus\";\nstatic const char __pyx_k_read[] = \"read\";\nstatic const char __pyx_k_seed[] = \"seed\";\nstatic const char __pyx_k_seek[] = \"seek\";\nstatic const char __pyx_k_syms[] = \"syms\";\nstatic const char __pyx_k_test[] = \"test\";\nstatic const char __pyx_k_text[] = \"text\";\nstatic const char __pyx_k_type[] = \"type\";\nstatic const char __pyx_k_utf8[] = \"utf8\";\nstatic const char __pyx_k_ERROR[] = \"ERROR\";\nstatic const char __pyx_k_Popen[] = \"Popen\";\nstatic const char __pyx_k_class[] = \"__class__\";\nstatic const char __pyx_k_delta[] = \"delta\";\nstatic const char __pyx_k_error[] = \"error\";\nstatic const char __pyx_k_final[] = \"final\";\nstatic const char __pyx_k_flags[] = \"flags\";\nstatic const char __pyx_k_ifst1[] = \"ifst1\";\nstatic const char __pyx_k_ifst2[] = \"ifst2\";\nstatic const char __pyx_k_input[] = \"input\";\nstatic const char __pyx_k_npath[] = \"npath\";\nstatic const char __pyx_k_pairs[] = \"pairs\";\nstatic const char __pyx_k_power[] = \"power\";\nstatic const char __pyx_k_props[] = \"props\";\nstatic const char __pyx_k_reset[] = \"reset\";\nstatic const char __pyx_k_start[] = \"start\";\nstatic const char __pyx_k_state[] = \"state\";\nstatic const char __pyx_k_stdin[] = \"stdin\";\nstatic const char __pyx_k_times[] = \"times\";\nstatic const char __pyx_k_title[] = \"title\";\nstatic const char __pyx_k_value[] = \"value\";\nstatic const char __pyx_k_width[] = \"width\";\nstatic const char __pyx_k_write[] = \"write\";\nstatic const char __pyx_k_CYCLIC[] = \"CYCLIC\";\nstatic const char __pyx_k_Number[] = \"Number\";\nstatic const char __pyx_k_STRING[] = \"STRING\";\nstatic const char __pyx_k_atexit[] = \"atexit\";\nstatic const char __pyx_k_create[] = \"create\";\nstatic const char __pyx_k_decode[] = \"decode\";\nstatic const char __pyx_k_divide[] = \"divide\";\nstatic const char __pyx_k_encode[] = \"encode\";\nstatic const char __pyx_k_format[] = \"format\";\nstatic const char __pyx_k_height[] = \"height\";\nstatic const char __pyx_k_ilabel[] = \"ilabel\";\nstatic const char __pyx_k_import[] = \"__import__\";\nstatic const char __pyx_k_ipairs[] = \"ipairs\";\nstatic const char __pyx_k_member[] = \"member\";\nstatic const char __pyx_k_module[] = \"__module__\";\nstatic const char __pyx_k_name_2[] = \"name\";\nstatic const char __pyx_k_nstate[] = \"nstate\";\nstatic const char __pyx_k_object[] = \"object\";\nstatic const char __pyx_k_olabel[] = \"olabel\";\nstatic const char __pyx_k_opairs[] = \"opairs\";\nstatic const char __pyx_k_reduce[] = \"__reduce__\";\nstatic const char __pyx_k_result[] = \"result\";\nstatic const char __pyx_k_select[] = \"select\";\nstatic const char __pyx_k_states[] = \"states\";\nstatic const char __pyx_k_stderr[] = \"stderr\";\nstatic const char __pyx_k_stdout[] = \"stdout\";\nstatic const char __pyx_k_symbol[] = \"symbol\";\nstatic const char __pyx_k_test_2[] = \"__test__\";\nstatic const char __pyx_k_unique[] = \"unique\";\nstatic const char __pyx_k_vector[] = \"vector\";\nstatic const char __pyx_k_verify[] = \"verify\";\nstatic const char __pyx_k_weight[] = \"weight\";\nstatic const char __pyx_k_ACYCLIC[] = \"ACYCLIC\";\nstatic const char __pyx_k_IOError[] = \"IOError\";\nstatic const char __pyx_k_MUTABLE[] = \"MUTABLE\";\nstatic const char __pyx_k_compile[] = \"compile\";\nstatic const char __pyx_k_connect[] = \"connect\";\nstatic const char __pyx_k_default[] = \"default\";\nstatic const char __pyx_k_get_fst[] = \"get_fst\";\nstatic const char __pyx_k_get_key[] = \"get_key\";\nstatic const char __pyx_k_logging[] = \"logging\";\nstatic const char __pyx_k_neither[] = \"neither\";\nstatic const char __pyx_k_nodesep[] = \"nodesep\";\nstatic const char __pyx_k_numbers[] = \"numbers\";\nstatic const char __pyx_k_prepare[] = \"__prepare__\";\nstatic const char __pyx_k_ranksep[] = \"ranksep\";\nstatic const char __pyx_k_reverse[] = \"reverse\";\nstatic const char __pyx_k_uniform[] = \"uniform\";\nstatic const char __pyx_k_warning[] = \"warning\";\nstatic const char __pyx_k_ACCEPTOR[] = \"ACCEPTOR\";\nstatic const char __pyx_k_DOT_TSVG[] = \"_DOT_TSVG\";\nstatic const char __pyx_k_EPSILONS[] = \"EPSILONS\";\nstatic const char __pyx_k_EXPANDED[] = \"EXPANDED\";\nstatic const char __pyx_k_FstError[] = \"FstError\";\nstatic const char __pyx_k_Fst_read[] = \"Fst.read\";\nstatic const char __pyx_k_KeyError[] = \"KeyError\";\nstatic const char __pyx_k_NO_LABEL[] = \"NO_LABEL\";\nstatic const char __pyx_k_NoWeight[] = \"NoWeight\";\nstatic const char __pyx_k_WEIGHTED[] = \"WEIGHTED\";\nstatic const char __pyx_k_acceptor[] = \"acceptor\";\nstatic const char __pyx_k_arc_type[] = \"arc_type\";\nstatic const char __pyx_k_checksum[] = \"checksum\";\nstatic const char __pyx_k_det_type[] = \"det_type\";\nstatic const char __pyx_k_distance[] = \"distance\";\nstatic const char __pyx_k_far_type[] = \"far_type\";\nstatic const char __pyx_k_filename[] = \"filename\";\nstatic const char __pyx_k_fontsize[] = \"fontsize\";\nstatic const char __pyx_k_fst_type[] = \"fst_type\";\nstatic const char __pyx_k_getstate[] = \"__getstate__\";\nstatic const char __pyx_k_identity[] = \"identity\";\nstatic const char __pyx_k_isymbols[] = \"isymbols\";\nstatic const char __pyx_k_map_type[] = \"map_type\";\nstatic const char __pyx_k_num_arcs[] = \"num_arcs\";\nstatic const char __pyx_k_osymbols[] = \"osymbols\";\nstatic const char __pyx_k_portrait[] = \"portrait\";\nstatic const char __pyx_k_position[] = \"position\";\nstatic const char __pyx_k_qualname[] = \"__qualname__\";\nstatic const char __pyx_k_read_fst[] = \"read_fst\";\nstatic const char __pyx_k_register[] = \"register\";\nstatic const char __pyx_k_repr_svg[] = \"_repr_svg\";\nstatic const char __pyx_k_set_name[] = \"set_name\";\nstatic const char __pyx_k_setstate[] = \"__setstate__\";\nstatic const char __pyx_k_ssymbols[] = \"ssymbols\";\nstatic const char __pyx_k_standard[] = \"standard\";\nstatic const char __pyx_k_to_final[] = \"to_final\";\nstatic const char __pyx_k_tropical[] = \"tropical\";\nstatic const char __pyx_k_vertical[] = \"vertical\";\nstatic const char __pyx_k_weighted[] = \"weighted\";\nstatic const char __pyx_k_ARC_FLAGS[] = \"ARC_FLAGS\";\nstatic const char __pyx_k_Fst___new[] = \"Fst.__new__\";\nstatic const char __pyx_k_NO_SYMBOL[] = \"NO_SYMBOL\";\nstatic const char __pyx_k_TypeError[] = \"TypeError\";\nstatic const char __pyx_k_add_state[] = \"add_state\";\nstatic const char __pyx_k_add_table[] = \"add_table\";\nstatic const char __pyx_k_kNoSymbol[] = \"kNoSymbol\";\nstatic const char __pyx_k_metaclass[] = \"__metaclass__\";\nstatic const char __pyx_k_nextstate[] = \"nextstate\";\nstatic const char __pyx_k_nshortest[] = \"nshortest\";\nstatic const char __pyx_k_precision[] = \"precision\";\nstatic const char __pyx_k_pywrapfst[] = \"<pywrapfst>\";\nstatic const char __pyx_k_read_text[] = \"read_text\";\nstatic const char __pyx_k_reduce_ex[] = \"__reduce_ex__\";\nstatic const char __pyx_k_set_flags[] = \"set_flags\";\nstatic const char __pyx_k_set_value[] = \"set_value\";\nstatic const char __pyx_k_sort_type[] = \"sort_type\";\nstatic const char __pyx_k_to_string[] = \"to_string\";\nstatic const char __pyx_k_ACCESSIBLE[] = \"ACCESSIBLE\";\nstatic const char __pyx_k_FstIOError[] = \"FstIOError\";\nstatic const char __pyx_k_FstOpError[] = \"FstOpError\";\nstatic const char __pyx_k_I_EPSILONS[] = \"I_EPSILONS\";\nstatic const char __pyx_k_IndexError[] = \"IndexError\";\nstatic const char __pyx_k_NOT_STRING[] = \"NOT_STRING\";\nstatic const char __pyx_k_O_EPSILONS[] = \"O_EPSILONS\";\nstatic const char __pyx_k_TOP_SORTED[] = \"TOP_SORTED\";\nstatic const char __pyx_k_UNWEIGHTED[] = \"UNWEIGHTED\";\nstatic const char __pyx_k_ValueError[] = \"ValueError\";\nstatic const char __pyx_k_add_symbol[] = \"add_symbol\";\nstatic const char __pyx_k_functional[] = \"functional\";\nstatic const char __pyx_k_max_length[] = \"max_length\";\nstatic const char __pyx_k_num_states[] = \"num_states\";\nstatic const char __pyx_k_potentials[] = \"potentials\";\nstatic const char __pyx_k_properties[] = \"properties\";\nstatic const char __pyx_k_pyx_vtable[] = \"__pyx_vtable__\";\nstatic const char __pyx_k_queue_type[] = \"queue_type\";\nstatic const char __pyx_k_returncode[] = \"returncode\";\nstatic const char __pyx_k_subprocess[] = \"subprocess\";\nstatic const char __pyx_k_write_text[] = \"write_text\";\nstatic const char __pyx_k_Arc_at_0x_x[] = \"<Arc at 0x{:x}>\";\nstatic const char __pyx_k_FstArgError[] = \"FstArgError\";\nstatic const char __pyx_k_Fst_at_0x_x[] = \"<{} Fst at 0x{:x}>\";\nstatic const char __pyx_k_NO_EPSILONS[] = \"NO_EPSILONS\";\nstatic const char __pyx_k_NO_STATE_ID[] = \"NO_STATE_ID\";\nstatic const char __pyx_k_communicate[] = \"communicate\";\nstatic const char __pyx_k_get_nth_key[] = \"get_nth_key\";\nstatic const char __pyx_k_input_table[] = \"input_table\";\nstatic const char __pyx_k_missing_sym[] = \"missing_sym\";\nstatic const char __pyx_k_num_symbols[] = \"num_symbols\";\nstatic const char __pyx_k_push_labels[] = \"push_labels\";\nstatic const char __pyx_k_pywrapfst_2[] = \"pywrapfst\";\nstatic const char __pyx_k_unspecified[] = \"<unspecified>\";\nstatic const char __pyx_k_weight_type[] = \"weight_type\";\nstatic const char __pyx_k_ARC_NO_CACHE[] = \"ARC_NO_CACHE\";\nstatic const char __pyx_k_COACCESSIBLE[] = \"COACCESSIBLE\";\nstatic const char __pyx_k_ENCODE_FLAGS[] = \"ENCODE_FLAGS\";\nstatic const char __pyx_k_NOT_ACCEPTOR[] = \"NOT_ACCEPTOR\";\nstatic const char __pyx_k_RuntimeError[] = \"RuntimeError\";\nstatic const char __pyx_k_allow_nondet[] = \"allow_nondet\";\nstatic const char __pyx_k_closure_plus[] = \"closure_plus\";\nstatic const char __pyx_k_float_format[] = \"float_format\";\nstatic const char __pyx_k_mutable_arcs[] = \"mutable_arcs\";\nstatic const char __pyx_k_new_isymbols[] = \"new_isymbols\";\nstatic const char __pyx_k_new_osymbols[] = \"new_osymbols\";\nstatic const char __pyx_k_old_isymbols[] = \"old_isymbols\";\nstatic const char __pyx_k_old_osymbols[] = \"old_osymbols\";\nstatic const char __pyx_k_push_weights[] = \"push_weights\";\nstatic const char __pyx_k_return_label[] = \"return_label\";\nstatic const char __pyx_k_staticmethod[] = \"staticmethod\";\nstatic const char __pyx_k_ENCODE_LABELS[] = \"ENCODE_LABELS\";\nstatic const char __pyx_k_FstIndexError[] = \"FstIndexError\";\nstatic const char __pyx_k_NO_I_EPSILONS[] = \"NO_I_EPSILONS\";\nstatic const char __pyx_k_NO_O_EPSILONS[] = \"NO_O_EPSILONS\";\nstatic const char __pyx_k_Open_failed_r[] = \"Open failed: {!r}\";\nstatic const char __pyx_k_Read_failed_r[] = \"Read failed: {!r}\";\nstatic const char __pyx_k_StopIteration[] = \"StopIteration\";\nstatic const char __pyx_k_available_key[] = \"available_key\";\nstatic const char __pyx_k_encode_labels[] = \"encode_labels\";\nstatic const char __pyx_k_input_symbols[] = \"input_symbols\";\nstatic const char __pyx_k_keep_isymbols[] = \"keep_isymbols\";\nstatic const char __pyx_k_keep_osymbols[] = \"keep_osymbols\";\nstatic const char __pyx_k_pywrapfst_pyx[] = \"pywrapfst.pyx\";\nstatic const char __pyx_k_reduce_cython[] = \"__reduce_cython__\";\nstatic const char __pyx_k_ENCODE_WEIGHTS[] = \"ENCODE_WEIGHTS\";\nstatic const char __pyx_k_FST_PROPERTIES[] = \"FST_PROPERTIES\";\nstatic const char __pyx_k_INITIAL_CYCLIC[] = \"INITIAL_CYCLIC\";\nstatic const char __pyx_k_I_LABEL_SORTED[] = \"I_LABEL_SORTED\";\nstatic const char __pyx_k_Invalid_weight[] = \"Invalid weight\";\nstatic const char __pyx_k_NOT_ACCESSIBLE[] = \"NOT_ACCESSIBLE\";\nstatic const char __pyx_k_NOT_TOP_SORTED[] = \"NOT_TOP_SORTED\";\nstatic const char __pyx_k_O_LABEL_SORTED[] = \"O_LABEL_SORTED\";\nstatic const char __pyx_k_Weight_at_0x_x[] = \"<{} Weight {} at 0x{:x}>\";\nstatic const char __pyx_k_Write_failed_r[] = \"Write failed: {!r}\";\nstatic const char __pyx_k_compose_filter[] = \"compose_filter\";\nstatic const char __pyx_k_encode_weights[] = \"encode_weights\";\nstatic const char __pyx_k_output_symbols[] = \"output_symbols\";\nstatic const char __pyx_k_project_output[] = \"project_output\";\nstatic const char __pyx_k_ARC_VALUE_FLAGS[] = \"ARC_VALUE_FLAGS\";\nstatic const char __pyx_k_COPY_PROPERTIES[] = \"COPY_PROPERTIES\";\nstatic const char __pyx_k_INITIAL_ACYCLIC[] = \"INITIAL_ACYCLIC\";\nstatic const char __pyx_k_I_DETERMINISTIC[] = \"I_DETERMINISTIC\";\nstatic const char __pyx_k_NULL_PROPERTIES[] = \"NULL_PROPERTIES\";\nstatic const char __pyx_k_O_DETERMINISTIC[] = \"O_DETERMINISTIC\";\nstatic const char __pyx_k_WEIGHTED_CYCLES[] = \"WEIGHTED_CYCLES\";\nstatic const char __pyx_k_eps_norm_output[] = \"eps_norm_output\";\nstatic const char __pyx_k_setstate_cython[] = \"__setstate_cython__\";\nstatic const char __pyx_k_show_weight_one[] = \"show_weight_one\";\nstatic const char __pyx_k_unknown_isymbol[] = \"unknown_isymbol\";\nstatic const char __pyx_k_unknown_osymbol[] = \"unknown_osymbol\";\nstatic const char __pyx_k_write_to_string[] = \"write_to_string\";\nstatic const char __pyx_k_ARC_WEIGHT_VALUE[] = \"ARC_WEIGHT_VALUE\";\nstatic const char __pyx_k_Cannot_construct[] = \"Cannot construct {}\";\nstatic const char __pyx_k_Key_out_of_order[] = \"Key out of order\";\nstatic const char __pyx_k_NOT_COACCESSIBLE[] = \"NOT_COACCESSIBLE\";\nstatic const char __pyx_k_Operation_failed[] = \"Operation failed\";\nstatic const char __pyx_k_labeled_checksum[] = \"labeled_checksum\";\nstatic const char __pyx_k_read_from_string[] = \"_read_from_string\";\nstatic const char __pyx_k_shortestdistance[] = \"shortestdistance\";\nstatic const char __pyx_k_ARC_I_LABEL_VALUE[] = \"ARC_I_LABEL_VALUE\";\nstatic const char __pyx_k_ARC_O_LABEL_VALUE[] = \"ARC_O_LABEL_VALUE\";\nstatic const char __pyx_k_BINARY_PROPERTIES[] = \"BINARY_PROPERTIES\";\nstatic const char __pyx_k_FarReader_at_0x_x[] = \"<{} FarReader at 0x{:x}>\";\nstatic const char __pyx_k_FarWriter_at_0x_x[] = \"<{} FarWriter at 0x{:x}>\";\nstatic const char __pyx_k_FstBadWeightError[] = \"FstBadWeightError\";\nstatic const char __pyx_k_UNWEIGHTED_CYCLES[] = \"UNWEIGHTED_CYCLES\";\nstatic const char __pyx_k_call_arc_labeling[] = \"call_arc_labeling\";\nstatic const char __pyx_k_set_input_symbols[] = \"set_input_symbols\";\nstatic const char __pyx_k_ADD_ARC_PROPERTIES[] = \"ADD_ARC_PROPERTIES\";\nstatic const char __pyx_k_CalledProcessError[] = \"CalledProcessError\";\nstatic const char __pyx_k_Compilation_failed[] = \"Compilation failed\";\nstatic const char __pyx_k_NOT_I_LABEL_SORTED[] = \"NOT_I_LABEL_SORTED\";\nstatic const char __pyx_k_NOT_O_LABEL_SORTED[] = \"NOT_O_LABEL_SORTED\";\nstatic const char __pyx_k_Read_failed_string[] = \"Read failed: <string>\";\nstatic const char __pyx_k_SET_ARC_PROPERTIES[] = \"SET_ARC_PROPERTIES\";\nstatic const char __pyx_k_TRINARY_PROPERTIES[] = \"TRINARY_PROPERTIES\";\nstatic const char __pyx_k_Unknown_arc_type_r[] = \"Unknown arc type: {!r}\";\nstatic const char __pyx_k_Unknown_map_type_r[] = \"Unknown map type: {!r}\";\nstatic const char __pyx_k_cline_in_traceback[] = \"cline_in_traceback\";\nstatic const char __pyx_k_epsilon_on_replace[] = \"epsilon_on_replace\";\nstatic const char __pyx_k_num_input_epsilons[] = \"num_input_epsilons\";\nstatic const char __pyx_k_read_from_string_2[] = \"read_from_string\";\nstatic const char __pyx_k_set_output_symbols[] = \"set_output_symbols\";\nstatic const char __pyx_k_ARC_SORT_PROPERTIES[] = \"ARC_SORT_PROPERTIES\";\nstatic const char __pyx_k_ArcIterator_at_0x_x[] = \"<ArcIterator at 0x{:x}>\";\nstatic const char __pyx_k_NON_I_DETERMINISTIC[] = \"NON_I_DETERMINISTIC\";\nstatic const char __pyx_k_NON_O_DETERMINISTIC[] = \"NON_O_DETERMINISTIC\";\nstatic const char __pyx_k_Unknown_sort_type_r[] = \"Unknown sort type {!r}\";\nstatic const char __pyx_k_attach_new_isymbols[] = \"attach_new_isymbols\";\nstatic const char __pyx_k_attach_new_osymbols[] = \"attach_new_osymbols\";\nstatic const char __pyx_k_fst_error_fatal_old[] = \"_fst_error_fatal_old\";\nstatic const char __pyx_k_num_output_epsilons[] = \"num_output_epsilons\";\nstatic const char __pyx_k_remove_common_affix[] = \"remove_common_affix\";\nstatic const char __pyx_k_remove_total_weight[] = \"remove_total_weight\";\nstatic const char __pyx_k_return_arc_labeling[] = \"return_arc_labeling\";\nstatic const char __pyx_k_subsequential_label[] = \"subsequential_label\";\nstatic const char __pyx_k_ADD_STATE_PROPERTIES[] = \"ADD_STATE_PROPERTIES\";\nstatic const char __pyx_k_ARC_NEXT_STATE_VALUE[] = \"ARC_NEXT_STATE_VALUE\";\nstatic const char __pyx_k_EXTRINSIC_PROPERTIES[] = \"EXTRINSIC_PROPERTIES\";\nstatic const char __pyx_k_EncodeMapper_at_0x_x[] = \"<EncodeMapper at 0x{:x}>\";\nstatic const char __pyx_k_Fst_read_from_string[] = \"Fst.read_from_string\";\nstatic const char __pyx_k_INTRINSIC_PROPERTIES[] = \"INTRINSIC_PROPERTIES\";\nstatic const char __pyx_k_SET_FINAL_PROPERTIES[] = \"SET_FINAL_PROPERTIES\";\nstatic const char __pyx_k_SET_START_PROPERTIES[] = \"SET_START_PROPERTIES\";\nstatic const char __pyx_k_Unknown_queue_type_r[] = \"Unknown queue type: {!r}\";\nstatic const char __pyx_k_keep_state_numbering[] = \"keep_state_numbering\";\nstatic const char __pyx_k_require_superinitial[] = \"require_superinitial\";\nstatic const char __pyx_k_DELETE_ARC_PROPERTIES[] = \"DELETE_ARC_PROPERTIES\";\nstatic const char __pyx_k_STATE_SORT_PROPERTIES[] = \"STATE_SORT_PROPERTIES\";\nstatic const char __pyx_k_StateIterator_at_0x_x[] = \"<StateIterator at 0x{:x}>\";\nstatic const char __pyx_k_SymbolTable_r_at_0x_x[] = \"<SymbolTable {!r} at 0x{:x}>\";\nstatic const char __pyx_k_Weight_type_not_found[] = \"Weight type not found\";\nstatic const char __pyx_k_allow_negative_labels[] = \"allow_negative_labels\";\nstatic const char __pyx_k_reset_fst_error_fatal[] = \"_reset_fst_error_fatal\";\nstatic const char __pyx_k_Conversion_to_r_failed[] = \"Conversion to {!r} failed\";\nstatic const char __pyx_k_NEG_TRINARY_PROPERTIES[] = \"NEG_TRINARY_PROPERTIES\";\nstatic const char __pyx_k_POS_TRINARY_PROPERTIES[] = \"POS_TRINARY_PROPERTIES\";\nstatic const char __pyx_k_Write_to_string_failed[] = \"Write to string failed\";\nstatic const char __pyx_k_DELETE_STATE_PROPERTIES[] = \"DELETE_STATE_PROPERTIES\";\nstatic const char __pyx_k_RM_SUPERFINAL_PROPERTIES[] = \"RM_SUPERFINAL_PROPERTIES\";\nstatic const char __pyx_k_State_index_out_of_range[] = \"State index out of range\";\nstatic const char __pyx_k_ADD_SUPERFINAL_PROPERTIES[] = \"ADD_SUPERFINAL_PROPERTIES\";\nstatic const char __pyx_k_Cannot_encode_as_string_r[] = \"Cannot encode as string: {!r}\";\nstatic const char __pyx_k_Cannot_topsort_cyclic_FST[] = \"Cannot topsort cyclic FST.\";\nstatic const char __pyx_k_Fst_SymbolTable_r_at_0x_x[] = \"<Fst SymbolTable {!r} at 0x{:x}>\";\nstatic const char __pyx_k_FstDeletedConstructorError[] = \"FstDeletedConstructorError\";\nstatic const char __pyx_k_MutableArcIterator_at_0x_x[] = \"<MutableArcIterator at 0x{:x}>\";\nstatic const char __pyx_k_SymbolTableIterator_at_0x_x[] = \"<SymbolTableIterator at 0x{:x}>\";\nstatic const char __pyx_k_WEIGHT_INVARIANT_PROPERTIES[] = \"WEIGHT_INVARIANT_PROPERTIES\";\nstatic const char __pyx_k_I_LABEL_INVARIANT_PROPERTIES[] = \"I_LABEL_INVARIANT_PROPERTIES\";\nstatic const char __pyx_k_O_LABEL_INVARIANT_PROPERTIES[] = \"O_LABEL_INVARIANT_PROPERTIES\";\nstatic const char __pyx_k_Unknown_replace_label_type_r[] = \"Unknown replace label type: {!r}\";\nstatic const char __pyx_k_No_new_SymbolTables_specified[] = \"No new SymbolTables specified\";\nstatic const char __pyx_k_No_relabeling_pairs_specified[] = \"No relabeling pairs specified.\";\nstatic const char __pyx_k_Unknown_compose_filter_type_r[] = \"Unknown compose filter type: {!r}\";\nstatic const char __pyx_k_increment_subsequential_label[] = \"increment_subsequential_label\";\nstatic const char __pyx_k_Incompatible_or_invalid_weight[] = \"Incompatible or invalid weight\";\nstatic const char __pyx_k_Unknown_determinization_type_r[] = \"Unknown determinization type: {!r}\";\nstatic const char __pyx_k_const_EncodeMapper_SymbolTable[] = \"<const EncodeMapper SymbolTable {!r} at 0x{:x}>\";\nstatic const char __pyx_k_Fst_arc_type_standard_Construct[] = \"\\n   Fst(arc_type=\\\"standard\\\")\\n\\n   Constructs an empty FST.\\n\\n   Args:\\n     arc_type: A string indicating the arc type.\\n\\n   Raises:\\n     FstError: Unknown arc type.\\n\\n   Raises:\\n     FstOpError: operation failed.\\n   \";\nstatic const char __pyx_k_const_Fst_SymbolTable_r_at_0x_x[] = \"<const Fst SymbolTable {!r} at 0x{:x}>\";\nstatic const char __pyx_k_self__aiter_self__fst_cannot_be[] = \"self._aiter,self._fst cannot be converted to a Python object for pickling\";\nstatic const char __pyx_k_self__fst_self__siter_cannot_be[] = \"self._fst,self._siter cannot be converted to a Python object for pickling\";\nstatic const char __pyx_k_self__fst_self__table_cannot_be[] = \"self._fst,self._table cannot be converted to a Python object for pickling\";\nstatic const char __pyx_k_self__table_cannot_be_converted[] = \"self._table cannot be converted to a Python object for pickling\";\nstatic const char __pyx_k_Incompatible_or_invalid_arc_type[] = \"Incompatible or invalid arc type\";\nstatic const char __pyx_k_Incompatible_or_invalid_weight_t[] = \"Incompatible or invalid weight type\";\nstatic const char __pyx_k_Python_interface_to_the_FST_scri[] = \"Python interface to the FST scripting API.\\n\\nOperations which construct new FSTs are implemented as traditional functions, as\\nare two-argument boolean functions like `equal` and `equivalent`. Destructive\\noperations---those that mutate an FST, in place---are instance methods, as is\\n`write`. Operator overloading is not used. The following example, based on\\nMohri et al. 2002, shows the construction of an ASR system given a pronunciation\\nlexicon L, grammar G, a transducer from context-dependent phones to\\ncontext-independent phones C, and an HMM set H:\\n\\n  L = fst.Fst.read(\\\"L.fst\\\")\\n  G = fst.Fst.read(\\\"G.fst\\\")\\n  C = fst.Fst.read(\\\"C.fst\\\")\\n  H = fst.Fst.read(\\\"H.fst\\\")\\n  LG = fst.determinize(fst.compose(L, G))\\n  CLG = fst.determinize(fst.compose(C, LG))\\n  HCLG = fst.determinize(fst.compose(H, CLG))\\n  HCLG.minimize()                                      # NB: works in-place.\\n\\nPython variables here use snake_case and constants are in all caps, minus the\\nnormal `k` prefix.\\n\";\nstatic const char __pyx_k_Unknown_random_arc_selection_typ[] = \"Unknown random arc selection type: {!r}\";\nstatic const char __pyx_k_no_default___reduce___due_to_non[] = \"no default __reduce__ due to non-trivial __cinit__\";\nstatic const char __pyx_k_self__aiter_self__mfst_cannot_be[] = \"self._aiter,self._mfst cannot be converted to a Python object for pickling\";\nstatic const char __pyx_k_self__arc_cannot_be_converted_to[] = \"self._arc cannot be converted to a Python object for pickling\";\nstatic const char __pyx_k_self__encoder_cannot_be_converte[] = \"self._encoder cannot be converted to a Python object for pickling\";\nstatic const char __pyx_k_self__encoder_self__table_cannot[] = \"self._encoder,self._table cannot be converted to a Python object for pickling\";\nstatic const char __pyx_k_self__mfst_self__table_cannot_be[] = \"self._mfst,self._table cannot be converted to a Python object for pickling\";\nstatic const char __pyx_k_self__reader_cannot_be_converted[] = \"self._reader cannot be converted to a Python object for pickling\";\nstatic const char __pyx_k_self__siter_self__table_cannot_b[] = \"self._siter,self._table cannot be converted to a Python object for pickling\";\nstatic const char __pyx_k_self__smart_table_self__table_ca[] = \"self._smart_table,self._table cannot be converted to a Python object for pickling\";\nstatic const char __pyx_k_self__weight_cannot_be_converted[] = \"self._weight cannot be converted to a Python object for pickling\";\nstatic const char __pyx_k_self__writer_cannot_be_converted[] = \"self._writer cannot be converted to a Python object for pickling\";\nstatic PyObject *__pyx_n_s_ACCEPTOR;\nstatic PyObject *__pyx_n_s_ACCESSIBLE;\nstatic PyObject *__pyx_n_s_ACYCLIC;\nstatic PyObject *__pyx_n_s_ADD_ARC_PROPERTIES;\nstatic PyObject *__pyx_n_s_ADD_STATE_PROPERTIES;\nstatic PyObject *__pyx_n_s_ADD_SUPERFINAL_PROPERTIES;\nstatic PyObject *__pyx_n_s_ARC_FLAGS;\nstatic PyObject *__pyx_n_s_ARC_I_LABEL_VALUE;\nstatic PyObject *__pyx_n_s_ARC_NEXT_STATE_VALUE;\nstatic PyObject *__pyx_n_s_ARC_NO_CACHE;\nstatic PyObject *__pyx_n_s_ARC_O_LABEL_VALUE;\nstatic PyObject *__pyx_n_s_ARC_SORT_PROPERTIES;\nstatic PyObject *__pyx_n_s_ARC_VALUE_FLAGS;\nstatic PyObject *__pyx_n_s_ARC_WEIGHT_VALUE;\nstatic PyObject *__pyx_kp_s_ArcIterator_at_0x_x;\nstatic PyObject *__pyx_kp_s_Arc_at_0x_x;\nstatic PyObject *__pyx_n_s_BINARY_PROPERTIES;\nstatic PyObject *__pyx_n_s_COACCESSIBLE;\nstatic PyObject *__pyx_n_s_COPY_PROPERTIES;\nstatic PyObject *__pyx_n_s_CYCLIC;\nstatic PyObject *__pyx_n_s_CalledProcessError;\nstatic PyObject *__pyx_kp_s_Cannot_construct;\nstatic PyObject *__pyx_kp_s_Cannot_encode_as_string_r;\nstatic PyObject *__pyx_kp_s_Cannot_topsort_cyclic_FST;\nstatic PyObject *__pyx_kp_s_Compilation_failed;\nstatic PyObject *__pyx_kp_s_Conversion_to_r_failed;\nstatic PyObject *__pyx_n_s_DELETE_ARC_PROPERTIES;\nstatic PyObject *__pyx_n_s_DELETE_STATE_PROPERTIES;\nstatic PyObject *__pyx_n_s_DOT_TSVG;\nstatic PyObject *__pyx_n_s_ENCODE_FLAGS;\nstatic PyObject *__pyx_n_s_ENCODE_LABELS;\nstatic PyObject *__pyx_n_s_ENCODE_WEIGHTS;\nstatic PyObject *__pyx_n_s_EPSILONS;\nstatic PyObject *__pyx_n_s_ERROR;\nstatic PyObject *__pyx_n_s_EXPANDED;\nstatic PyObject *__pyx_n_s_EXTRINSIC_PROPERTIES;\nstatic PyObject *__pyx_kp_s_EncodeMapper_at_0x_x;\nstatic PyObject *__pyx_n_s_FST_PROPERTIES;\nstatic PyObject *__pyx_kp_s_FarReader_at_0x_x;\nstatic PyObject *__pyx_kp_s_FarWriter_at_0x_x;\nstatic PyObject *__pyx_n_s_Fst;\nstatic PyObject *__pyx_n_s_FstArgError;\nstatic PyObject *__pyx_n_s_FstBadWeightError;\nstatic PyObject *__pyx_n_s_FstDeletedConstructorError;\nstatic PyObject *__pyx_n_s_FstError;\nstatic PyObject *__pyx_n_s_FstIOError;\nstatic PyObject *__pyx_n_s_FstIndexError;\nstatic PyObject *__pyx_n_s_FstOpError;\nstatic PyObject *__pyx_kp_s_Fst_SymbolTable_r_at_0x_x;\nstatic PyObject *__pyx_n_s_Fst___new;\nstatic PyObject *__pyx_kp_s_Fst_arc_type_standard_Construct;\nstatic PyObject *__pyx_kp_s_Fst_at_0x_x;\nstatic PyObject *__pyx_n_s_Fst_read;\nstatic PyObject *__pyx_n_s_Fst_read_from_string;\nstatic PyObject *__pyx_n_s_INITIAL_ACYCLIC;\nstatic PyObject *__pyx_n_s_INITIAL_CYCLIC;\nstatic PyObject *__pyx_n_s_INTRINSIC_PROPERTIES;\nstatic PyObject *__pyx_n_s_IOError;\nstatic PyObject *__pyx_n_s_I_DETERMINISTIC;\nstatic PyObject *__pyx_n_s_I_EPSILONS;\nstatic PyObject *__pyx_n_s_I_LABEL_INVARIANT_PROPERTIES;\nstatic PyObject *__pyx_n_s_I_LABEL_SORTED;\nstatic PyObject *__pyx_kp_s_Incompatible_or_invalid_arc_type;\nstatic PyObject *__pyx_kp_s_Incompatible_or_invalid_weight;\nstatic PyObject *__pyx_kp_s_Incompatible_or_invalid_weight_t;\nstatic PyObject *__pyx_n_s_IndexError;\nstatic PyObject *__pyx_kp_s_Invalid_weight;\nstatic PyObject *__pyx_n_s_KeyError;\nstatic PyObject *__pyx_kp_s_Key_out_of_order;\nstatic PyObject *__pyx_n_s_MUTABLE;\nstatic PyObject *__pyx_kp_s_MutableArcIterator_at_0x_x;\nstatic PyObject *__pyx_n_s_NEG_TRINARY_PROPERTIES;\nstatic PyObject *__pyx_n_s_NON_I_DETERMINISTIC;\nstatic PyObject *__pyx_n_s_NON_O_DETERMINISTIC;\nstatic PyObject *__pyx_n_s_NOT_ACCEPTOR;\nstatic PyObject *__pyx_n_s_NOT_ACCESSIBLE;\nstatic PyObject *__pyx_n_s_NOT_COACCESSIBLE;\nstatic PyObject *__pyx_n_s_NOT_I_LABEL_SORTED;\nstatic PyObject *__pyx_n_s_NOT_O_LABEL_SORTED;\nstatic PyObject *__pyx_n_s_NOT_STRING;\nstatic PyObject *__pyx_n_s_NOT_TOP_SORTED;\nstatic PyObject *__pyx_n_s_NO_EPSILONS;\nstatic PyObject *__pyx_n_s_NO_I_EPSILONS;\nstatic PyObject *__pyx_n_s_NO_LABEL;\nstatic PyObject *__pyx_n_s_NO_O_EPSILONS;\nstatic PyObject *__pyx_n_s_NO_STATE_ID;\nstatic PyObject *__pyx_n_s_NO_SYMBOL;\nstatic PyObject *__pyx_n_s_NULL_PROPERTIES;\nstatic PyObject *__pyx_n_s_NoWeight;\nstatic PyObject *__pyx_kp_s_No_new_SymbolTables_specified;\nstatic PyObject *__pyx_kp_s_No_relabeling_pairs_specified;\nstatic PyObject *__pyx_n_s_Number;\nstatic PyObject *__pyx_n_s_O_DETERMINISTIC;\nstatic PyObject *__pyx_n_s_O_EPSILONS;\nstatic PyObject *__pyx_n_s_O_LABEL_INVARIANT_PROPERTIES;\nstatic PyObject *__pyx_n_s_O_LABEL_SORTED;\nstatic PyObject *__pyx_n_s_One;\nstatic PyObject *__pyx_kp_s_Open_failed_r;\nstatic PyObject *__pyx_kp_s_Operation_failed;\nstatic PyObject *__pyx_n_s_PIPE;\nstatic PyObject *__pyx_n_s_POS_TRINARY_PROPERTIES;\nstatic PyObject *__pyx_n_s_Popen;\nstatic PyObject *__pyx_n_s_RM_SUPERFINAL_PROPERTIES;\nstatic PyObject *__pyx_kp_s_Read_failed_r;\nstatic PyObject *__pyx_kp_s_Read_failed_string;\nstatic PyObject *__pyx_n_s_RuntimeError;\nstatic PyObject *__pyx_n_s_SET_ARC_PROPERTIES;\nstatic PyObject *__pyx_n_s_SET_FINAL_PROPERTIES;\nstatic PyObject *__pyx_n_s_SET_START_PROPERTIES;\nstatic PyObject *__pyx_n_s_STATE_SORT_PROPERTIES;\nstatic PyObject *__pyx_n_s_STRING;\nstatic PyObject *__pyx_kp_s_StateIterator_at_0x_x;\nstatic PyObject *__pyx_kp_s_State_index_out_of_range;\nstatic PyObject *__pyx_n_s_StopIteration;\nstatic PyObject *__pyx_kp_s_SymbolTableIterator_at_0x_x;\nstatic PyObject *__pyx_kp_s_SymbolTable_r_at_0x_x;\nstatic PyObject *__pyx_n_s_TOP_SORTED;\nstatic PyObject *__pyx_n_s_TRINARY_PROPERTIES;\nstatic PyObject *__pyx_kp_s_Tsvg;\nstatic PyObject *__pyx_n_s_TypeError;\nstatic PyObject *__pyx_n_s_UNWEIGHTED;\nstatic PyObject *__pyx_n_s_UNWEIGHTED_CYCLES;\nstatic PyObject *__pyx_kp_s_Unknown_arc_type_r;\nstatic PyObject *__pyx_kp_s_Unknown_compose_filter_type_r;\nstatic PyObject *__pyx_kp_s_Unknown_determinization_type_r;\nstatic PyObject *__pyx_kp_s_Unknown_map_type_r;\nstatic PyObject *__pyx_kp_s_Unknown_queue_type_r;\nstatic PyObject *__pyx_kp_s_Unknown_random_arc_selection_typ;\nstatic PyObject *__pyx_kp_s_Unknown_replace_label_type_r;\nstatic PyObject *__pyx_kp_s_Unknown_sort_type_r;\nstatic PyObject *__pyx_n_s_ValueError;\nstatic PyObject *__pyx_n_s_WEIGHTED;\nstatic PyObject *__pyx_n_s_WEIGHTED_CYCLES;\nstatic PyObject *__pyx_n_s_WEIGHT_INVARIANT_PROPERTIES;\nstatic PyObject *__pyx_kp_s_Weight_at_0x_x;\nstatic PyObject *__pyx_kp_s_Weight_type_not_found;\nstatic PyObject *__pyx_kp_s_Write_failed_r;\nstatic PyObject *__pyx_kp_s_Write_to_string_failed;\nstatic PyObject *__pyx_n_s_Zero;\nstatic PyObject *__pyx_kp_b__24;\nstatic PyObject *__pyx_n_s_acceptor;\nstatic PyObject *__pyx_n_s_add;\nstatic PyObject *__pyx_n_s_add_state;\nstatic PyObject *__pyx_n_s_add_symbol;\nstatic PyObject *__pyx_n_s_add_table;\nstatic PyObject *__pyx_n_s_allow_negative_labels;\nstatic PyObject *__pyx_n_s_allow_nondet;\nstatic PyObject *__pyx_n_s_arc;\nstatic PyObject *__pyx_n_s_arc_type;\nstatic PyObject *__pyx_n_s_arcs;\nstatic PyObject *__pyx_n_s_atexit;\nstatic PyObject *__pyx_n_s_attach_new_isymbols;\nstatic PyObject *__pyx_n_s_attach_new_osymbols;\nstatic PyObject *__pyx_n_b_auto;\nstatic PyObject *__pyx_n_s_available_key;\nstatic PyObject *__pyx_n_s_call_arc_labeling;\nstatic PyObject *__pyx_n_s_checksum;\nstatic PyObject *__pyx_n_s_class;\nstatic PyObject *__pyx_n_s_cline_in_traceback;\nstatic PyObject *__pyx_n_s_closure_plus;\nstatic PyObject *__pyx_n_s_cls;\nstatic PyObject *__pyx_n_s_communicate;\nstatic PyObject *__pyx_n_s_compile;\nstatic PyObject *__pyx_n_s_compose_filter;\nstatic PyObject *__pyx_n_s_connect;\nstatic PyObject *__pyx_kp_s_const_EncodeMapper_SymbolTable;\nstatic PyObject *__pyx_kp_s_const_Fst_SymbolTable_r_at_0x_x;\nstatic PyObject *__pyx_n_s_copy;\nstatic PyObject *__pyx_n_s_create;\nstatic PyObject *__pyx_n_s_decode;\nstatic PyObject *__pyx_n_b_default;\nstatic PyObject *__pyx_n_s_delta;\nstatic PyObject *__pyx_n_s_det_type;\nstatic PyObject *__pyx_n_s_distance;\nstatic PyObject *__pyx_n_s_divide;\nstatic PyObject *__pyx_n_s_doc;\nstatic PyObject *__pyx_n_s_done;\nstatic PyObject *__pyx_n_s_dot;\nstatic PyObject *__pyx_n_s_draw;\nstatic PyObject *__pyx_n_s_encode;\nstatic PyObject *__pyx_n_s_encode_labels;\nstatic PyObject *__pyx_n_s_encode_weights;\nstatic PyObject *__pyx_n_s_eps_norm_output;\nstatic PyObject *__pyx_n_s_epsilon_on_replace;\nstatic PyObject *__pyx_n_s_error;\nstatic PyObject *__pyx_n_s_far_type;\nstatic PyObject *__pyx_n_s_filename;\nstatic PyObject *__pyx_n_s_final;\nstatic PyObject *__pyx_n_s_find;\nstatic PyObject *__pyx_n_s_flags;\nstatic PyObject *__pyx_n_s_float_format;\nstatic PyObject *__pyx_n_s_fontsize;\nstatic PyObject *__pyx_n_s_format;\nstatic PyObject *__pyx_n_s_fst_error_fatal_old;\nstatic PyObject *__pyx_n_s_fst_type;\nstatic PyObject *__pyx_n_b_functional;\nstatic PyObject *__pyx_n_b_g;\nstatic PyObject *__pyx_n_s_get_fst;\nstatic PyObject *__pyx_n_s_get_key;\nstatic PyObject *__pyx_n_s_get_nth_key;\nstatic PyObject *__pyx_n_s_getstate;\nstatic PyObject *__pyx_n_s_height;\nstatic PyObject *__pyx_n_s_id;\nstatic PyObject *__pyx_n_b_identity;\nstatic PyObject *__pyx_n_s_ifst;\nstatic PyObject *__pyx_n_s_ifst1;\nstatic PyObject *__pyx_n_s_ifst2;\nstatic PyObject *__pyx_n_b_ilabel;\nstatic PyObject *__pyx_n_s_ilabel;\nstatic PyObject *__pyx_n_s_import;\nstatic PyObject *__pyx_n_s_increment_subsequential_label;\nstatic PyObject *__pyx_n_b_input;\nstatic PyObject *__pyx_n_s_input_symbols;\nstatic PyObject *__pyx_n_s_input_table;\nstatic PyObject *__pyx_n_s_ipairs;\nstatic PyObject *__pyx_n_s_isymbols;\nstatic PyObject *__pyx_n_s_kNoSymbol;\nstatic PyObject *__pyx_n_s_keep_isymbols;\nstatic PyObject *__pyx_n_s_keep_osymbols;\nstatic PyObject *__pyx_n_s_keep_state_numbering;\nstatic PyObject *__pyx_n_s_key;\nstatic PyObject *__pyx_n_s_labeled_checksum;\nstatic PyObject *__pyx_n_s_lhs;\nstatic PyObject *__pyx_n_s_logging;\nstatic PyObject *__pyx_n_s_main;\nstatic PyObject *__pyx_n_s_map_type;\nstatic PyObject *__pyx_n_s_mask;\nstatic PyObject *__pyx_n_s_max_length;\nstatic PyObject *__pyx_n_s_member;\nstatic PyObject *__pyx_n_s_metaclass;\nstatic PyObject *__pyx_n_s_missing_sym;\nstatic PyObject *__pyx_n_s_module;\nstatic PyObject *__pyx_n_s_mutable_arcs;\nstatic PyObject *__pyx_n_s_n;\nstatic PyObject *__pyx_n_s_name;\nstatic PyObject *__pyx_n_s_name_2;\nstatic PyObject *__pyx_n_b_neither;\nstatic PyObject *__pyx_n_s_new;\nstatic PyObject *__pyx_n_s_new_isymbols;\nstatic PyObject *__pyx_n_s_new_osymbols;\nstatic PyObject *__pyx_n_s_next;\nstatic PyObject *__pyx_n_s_nextstate;\nstatic PyObject *__pyx_kp_s_no_default___reduce___due_to_non;\nstatic PyObject *__pyx_n_s_nodesep;\nstatic PyObject *__pyx_n_s_npath;\nstatic PyObject *__pyx_n_s_nshortest;\nstatic PyObject *__pyx_n_s_nstate;\nstatic PyObject *__pyx_n_s_num_arcs;\nstatic PyObject *__pyx_n_s_num_input_epsilons;\nstatic PyObject *__pyx_n_s_num_output_epsilons;\nstatic PyObject *__pyx_n_s_num_states;\nstatic PyObject *__pyx_n_s_num_symbols;\nstatic PyObject *__pyx_n_s_numbers;\nstatic PyObject *__pyx_n_s_object;\nstatic PyObject *__pyx_n_s_olabel;\nstatic PyObject *__pyx_n_s_old_isymbols;\nstatic PyObject *__pyx_n_s_old_osymbols;\nstatic PyObject *__pyx_n_s_opairs;\nstatic PyObject *__pyx_n_s_open;\nstatic PyObject *__pyx_n_s_osymbols;\nstatic PyObject *__pyx_n_s_output_symbols;\nstatic PyObject *__pyx_n_s_pairs;\nstatic PyObject *__pyx_n_s_plus;\nstatic PyObject *__pyx_n_s_portrait;\nstatic PyObject *__pyx_n_s_position;\nstatic PyObject *__pyx_n_s_potentials;\nstatic PyObject *__pyx_n_s_power;\nstatic PyObject *__pyx_n_s_precision;\nstatic PyObject *__pyx_n_s_prepare;\nstatic PyObject *__pyx_n_s_project_output;\nstatic PyObject *__pyx_n_s_properties;\nstatic PyObject *__pyx_n_s_props;\nstatic PyObject *__pyx_n_s_push_labels;\nstatic PyObject *__pyx_n_s_push_weights;\nstatic PyObject *__pyx_n_s_pywrapfst_2;\nstatic PyObject *__pyx_kp_s_pywrapfst_pyx;\nstatic PyObject *__pyx_n_s_pyx_vtable;\nstatic PyObject *__pyx_n_s_qualname;\nstatic PyObject *__pyx_n_s_queue_type;\nstatic PyObject *__pyx_n_s_ranksep;\nstatic PyObject *__pyx_n_s_read;\nstatic PyObject *__pyx_n_s_read_from_string;\nstatic PyObject *__pyx_n_s_read_from_string_2;\nstatic PyObject *__pyx_n_s_read_fst;\nstatic PyObject *__pyx_n_s_read_text;\nstatic PyObject *__pyx_n_s_reduce;\nstatic PyObject *__pyx_n_s_reduce_cython;\nstatic PyObject *__pyx_n_s_reduce_ex;\nstatic PyObject *__pyx_n_s_register;\nstatic PyObject *__pyx_n_s_remove_common_affix;\nstatic PyObject *__pyx_n_s_remove_total_weight;\nstatic PyObject *__pyx_n_s_require_superinitial;\nstatic PyObject *__pyx_n_s_reset;\nstatic PyObject *__pyx_n_s_reset_fst_error_fatal;\nstatic PyObject *__pyx_n_s_result;\nstatic PyObject *__pyx_n_s_return_arc_labeling;\nstatic PyObject *__pyx_n_s_return_label;\nstatic PyObject *__pyx_n_s_returncode;\nstatic PyObject *__pyx_n_s_reverse;\nstatic PyObject *__pyx_n_s_rhs;\nstatic PyObject *__pyx_n_s_seed;\nstatic PyObject *__pyx_n_s_seek;\nstatic PyObject *__pyx_n_s_select;\nstatic PyObject *__pyx_kp_s_self__aiter_self__fst_cannot_be;\nstatic PyObject *__pyx_kp_s_self__aiter_self__mfst_cannot_be;\nstatic PyObject *__pyx_kp_s_self__arc_cannot_be_converted_to;\nstatic PyObject *__pyx_kp_s_self__encoder_cannot_be_converte;\nstatic PyObject *__pyx_kp_s_self__encoder_self__table_cannot;\nstatic PyObject *__pyx_kp_s_self__fst_self__siter_cannot_be;\nstatic PyObject *__pyx_kp_s_self__fst_self__table_cannot_be;\nstatic PyObject *__pyx_kp_s_self__mfst_self__table_cannot_be;\nstatic PyObject *__pyx_kp_s_self__reader_cannot_be_converted;\nstatic PyObject *__pyx_kp_s_self__siter_self__table_cannot_b;\nstatic PyObject *__pyx_kp_s_self__smart_table_self__table_ca;\nstatic PyObject *__pyx_kp_s_self__table_cannot_be_converted;\nstatic PyObject *__pyx_kp_s_self__weight_cannot_be_converted;\nstatic PyObject *__pyx_kp_s_self__writer_cannot_be_converted;\nstatic PyObject *__pyx_n_s_set_flags;\nstatic PyObject *__pyx_n_s_set_input_symbols;\nstatic PyObject *__pyx_n_s_set_name;\nstatic PyObject *__pyx_n_s_set_output_symbols;\nstatic PyObject *__pyx_n_s_set_value;\nstatic PyObject *__pyx_n_s_setstate;\nstatic PyObject *__pyx_n_s_setstate_cython;\nstatic PyObject *__pyx_n_s_shortestdistance;\nstatic PyObject *__pyx_n_s_show_weight_one;\nstatic PyObject *__pyx_n_s_sort_type;\nstatic PyObject *__pyx_n_s_ssymbols;\nstatic PyObject *__pyx_n_b_standard;\nstatic PyObject *__pyx_n_s_start;\nstatic PyObject *__pyx_n_s_state;\nstatic PyObject *__pyx_n_s_states;\nstatic PyObject *__pyx_n_s_staticmethod;\nstatic PyObject *__pyx_n_s_stderr;\nstatic PyObject *__pyx_n_s_stdin;\nstatic PyObject *__pyx_n_s_stdout;\nstatic PyObject *__pyx_n_s_subprocess;\nstatic PyObject *__pyx_n_s_subsequential_label;\nstatic PyObject *__pyx_n_s_symbol;\nstatic PyObject *__pyx_n_s_syms;\nstatic PyObject *__pyx_n_s_test;\nstatic PyObject *__pyx_n_s_test_2;\nstatic PyObject *__pyx_n_s_text;\nstatic PyObject *__pyx_n_s_times;\nstatic PyObject *__pyx_n_s_title;\nstatic PyObject *__pyx_n_s_to_final;\nstatic PyObject *__pyx_n_s_to_string;\nstatic PyObject *__pyx_n_s_type;\nstatic PyObject *__pyx_n_b_uniform;\nstatic PyObject *__pyx_n_s_unique;\nstatic PyObject *__pyx_n_s_unknown_isymbol;\nstatic PyObject *__pyx_n_s_unknown_osymbol;\nstatic PyObject *__pyx_kp_b_unspecified;\nstatic PyObject *__pyx_n_s_utf8;\nstatic PyObject *__pyx_n_s_value;\nstatic PyObject *__pyx_n_b_vector;\nstatic PyObject *__pyx_n_s_verify;\nstatic PyObject *__pyx_n_s_vertical;\nstatic PyObject *__pyx_n_s_w;\nstatic PyObject *__pyx_n_s_warning;\nstatic PyObject *__pyx_n_s_weight;\nstatic PyObject *__pyx_n_s_weight_type;\nstatic PyObject *__pyx_n_s_weighted;\nstatic PyObject *__pyx_n_s_width;\nstatic PyObject *__pyx_n_s_write;\nstatic PyObject *__pyx_n_s_write_text;\nstatic PyObject *__pyx_n_s_write_to_string;\nstatic PyObject *__pyx_pf_9pywrapfst_6Weight___repr__(struct __pyx_obj_9pywrapfst_Weight *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_6Weight_2__str__(struct __pyx_obj_9pywrapfst_Weight *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_6Weight_4__float__(struct __pyx_obj_9pywrapfst_Weight *__pyx_v_self); /* proto */\nstatic int __pyx_pf_9pywrapfst_6Weight_6__init__(struct __pyx_obj_9pywrapfst_Weight *__pyx_v_self, PyObject *__pyx_v_weight_type, PyObject *__pyx_v_weight); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_6Weight_8copy(struct __pyx_obj_9pywrapfst_Weight *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_6Weight_10Zero(CYTHON_UNUSED PyTypeObject *__pyx_v_cls, PyObject *__pyx_v_weight_type); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_6Weight_12One(CYTHON_UNUSED PyTypeObject *__pyx_v_cls, PyObject *__pyx_v_weight_type); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_6Weight_14NoWeight(CYTHON_UNUSED PyTypeObject *__pyx_v_cls, PyObject *__pyx_v_weight_type); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_6Weight_16__eq__(struct __pyx_obj_9pywrapfst_Weight *__pyx_v_w1, struct __pyx_obj_9pywrapfst_Weight *__pyx_v_w2); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_6Weight_18__ne__(struct __pyx_obj_9pywrapfst_Weight *__pyx_v_w1, struct __pyx_obj_9pywrapfst_Weight *__pyx_v_w2); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_6Weight_20to_string(struct __pyx_obj_9pywrapfst_Weight *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_6Weight_22type(struct __pyx_obj_9pywrapfst_Weight *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_6Weight_24__reduce_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst_Weight *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_6Weight_26__setstate_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst_Weight *__pyx_v_self, CYTHON_UNUSED PyObject *__pyx_v___pyx_state); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_plus(CYTHON_UNUSED PyObject *__pyx_self, struct __pyx_obj_9pywrapfst_Weight *__pyx_v_lhs, struct __pyx_obj_9pywrapfst_Weight *__pyx_v_rhs); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_2times(CYTHON_UNUSED PyObject *__pyx_self, struct __pyx_obj_9pywrapfst_Weight *__pyx_v_lhs, struct __pyx_obj_9pywrapfst_Weight *__pyx_v_rhs); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_4divide(CYTHON_UNUSED PyObject *__pyx_self, struct __pyx_obj_9pywrapfst_Weight *__pyx_v_lhs, struct __pyx_obj_9pywrapfst_Weight *__pyx_v_rhs); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_6power(CYTHON_UNUSED PyObject *__pyx_self, struct __pyx_obj_9pywrapfst_Weight *__pyx_v_w, size_t __pyx_v_n); /* proto */\nstatic int __pyx_pf_9pywrapfst_12_SymbolTable___init__(struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_12_SymbolTable_2__iter__(struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_12_SymbolTable_4available_key(struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_12_SymbolTable_6checksum(struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_12_SymbolTable_8copy(struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_12_SymbolTable_10find(struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_self, PyObject *__pyx_v_key); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_12_SymbolTable_12get_nth_key(struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_self, Py_ssize_t __pyx_v_pos); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_12_SymbolTable_14labeled_checksum(struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_12_SymbolTable_16member(struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_self, PyObject *__pyx_v_key); /* proto */\nstatic int __pyx_pf_9pywrapfst_12_SymbolTable_18__contains__(struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_self, PyObject *__pyx_v_key); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_12_SymbolTable_20name(struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_12_SymbolTable_22num_symbols(struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_12_SymbolTable_24write(struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_self, PyObject *__pyx_v_filename); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_12_SymbolTable_26write_text(struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_self, PyObject *__pyx_v_filename); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_12_SymbolTable_28__reduce_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_12_SymbolTable_30__setstate_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_self, CYTHON_UNUSED PyObject *__pyx_v___pyx_state); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_24_EncodeMapperSymbolTable___repr__(struct __pyx_obj_9pywrapfst__EncodeMapperSymbolTable *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_24_EncodeMapperSymbolTable_2__reduce_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst__EncodeMapperSymbolTable *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_24_EncodeMapperSymbolTable_4__setstate_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst__EncodeMapperSymbolTable *__pyx_v_self, CYTHON_UNUSED PyObject *__pyx_v___pyx_state); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_15_FstSymbolTable___repr__(struct __pyx_obj_9pywrapfst__FstSymbolTable *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_15_FstSymbolTable_2__reduce_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst__FstSymbolTable *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_15_FstSymbolTable_4__setstate_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst__FstSymbolTable *__pyx_v_self, CYTHON_UNUSED PyObject *__pyx_v___pyx_state); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_19_MutableSymbolTable_add_symbol(struct __pyx_obj_9pywrapfst__MutableSymbolTable *__pyx_v_self, PyObject *__pyx_v_symbol, __pyx_t_10basictypes_int64 __pyx_v_key); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_19_MutableSymbolTable_2add_table(struct __pyx_obj_9pywrapfst__MutableSymbolTable *__pyx_v_self, struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_syms); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_19_MutableSymbolTable_4set_name(struct __pyx_obj_9pywrapfst__MutableSymbolTable *__pyx_v_self, PyObject *__pyx_v_new_name); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_19_MutableSymbolTable_6__reduce_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst__MutableSymbolTable *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_19_MutableSymbolTable_8__setstate_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst__MutableSymbolTable *__pyx_v_self, CYTHON_UNUSED PyObject *__pyx_v___pyx_state); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_22_MutableFstSymbolTable___repr__(struct __pyx_obj_9pywrapfst__MutableFstSymbolTable *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_22_MutableFstSymbolTable_2__reduce_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst__MutableFstSymbolTable *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_22_MutableFstSymbolTable_4__setstate_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst__MutableFstSymbolTable *__pyx_v_self, CYTHON_UNUSED PyObject *__pyx_v___pyx_state); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_11SymbolTable___repr__(struct __pyx_obj_9pywrapfst_SymbolTable *__pyx_v_self); /* proto */\nstatic int __pyx_pf_9pywrapfst_11SymbolTable_2__init__(struct __pyx_obj_9pywrapfst_SymbolTable *__pyx_v_self, PyObject *__pyx_v_name); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_11SymbolTable_4read(CYTHON_UNUSED PyTypeObject *__pyx_v_cls, PyObject *__pyx_v_filename); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_11SymbolTable_6read_text(CYTHON_UNUSED PyTypeObject *__pyx_v_cls, PyObject *__pyx_v_filename, bool __pyx_v_allow_negative_labels); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_11SymbolTable_8read_fst(CYTHON_UNUSED PyTypeObject *__pyx_v_cls, PyObject *__pyx_v_filename, bool __pyx_v_input_table); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_11SymbolTable_10__reduce_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst_SymbolTable *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_11SymbolTable_12__setstate_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst_SymbolTable *__pyx_v_self, CYTHON_UNUSED PyObject *__pyx_v___pyx_state); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_8compact_symbol_table(CYTHON_UNUSED PyObject *__pyx_self, struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_syms); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_10merge_symbol_table(CYTHON_UNUSED PyObject *__pyx_self, struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_lhs, struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_rhs); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_19SymbolTableIterator___repr__(struct __pyx_obj_9pywrapfst_SymbolTableIterator *__pyx_v_self); /* proto */\nstatic int __pyx_pf_9pywrapfst_19SymbolTableIterator_2__init__(struct __pyx_obj_9pywrapfst_SymbolTableIterator *__pyx_v_self, struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_syms); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_19SymbolTableIterator_4__iter__(struct __pyx_obj_9pywrapfst_SymbolTableIterator *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_19SymbolTableIterator_6__next__(struct __pyx_obj_9pywrapfst_SymbolTableIterator *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_19SymbolTableIterator_8done(struct __pyx_obj_9pywrapfst_SymbolTableIterator *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_19SymbolTableIterator_10next(struct __pyx_obj_9pywrapfst_SymbolTableIterator *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_19SymbolTableIterator_12reset(struct __pyx_obj_9pywrapfst_SymbolTableIterator *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_19SymbolTableIterator_14symbol(struct __pyx_obj_9pywrapfst_SymbolTableIterator *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_19SymbolTableIterator_16value(struct __pyx_obj_9pywrapfst_SymbolTableIterator *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_19SymbolTableIterator_18__reduce_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst_SymbolTableIterator *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_19SymbolTableIterator_20__setstate_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst_SymbolTableIterator *__pyx_v_self, CYTHON_UNUSED PyObject *__pyx_v___pyx_state); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_12EncodeMapper___repr__(struct __pyx_obj_9pywrapfst_EncodeMapper *__pyx_v_self); /* proto */\nstatic int __pyx_pf_9pywrapfst_12EncodeMapper_2__init__(struct __pyx_obj_9pywrapfst_EncodeMapper *__pyx_v_self, PyObject *__pyx_v_arc_type, bool __pyx_v_encode_labels, bool __pyx_v_encode_weights); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_12EncodeMapper_4arc_type(struct __pyx_obj_9pywrapfst_EncodeMapper *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_12EncodeMapper_6__call__(struct __pyx_obj_9pywrapfst_EncodeMapper *__pyx_v_self, struct __pyx_obj_9pywrapfst_Arc *__pyx_v_arc); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_12EncodeMapper_8flags(struct __pyx_obj_9pywrapfst_EncodeMapper *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_12EncodeMapper_10input_symbols(struct __pyx_obj_9pywrapfst_EncodeMapper *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_12EncodeMapper_12output_symbols(struct __pyx_obj_9pywrapfst_EncodeMapper *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_12EncodeMapper_14properties(struct __pyx_obj_9pywrapfst_EncodeMapper *__pyx_v_self, __pyx_t_10basictypes_uint64 __pyx_v_mask); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_12EncodeMapper_16set_input_symbols(struct __pyx_obj_9pywrapfst_EncodeMapper *__pyx_v_self, struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_syms); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_12EncodeMapper_18set_output_symbols(struct __pyx_obj_9pywrapfst_EncodeMapper *__pyx_v_self, struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_syms); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_12EncodeMapper_20weight_type(struct __pyx_obj_9pywrapfst_EncodeMapper *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_12EncodeMapper_22__reduce_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst_EncodeMapper *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_12EncodeMapper_24__setstate_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst_EncodeMapper *__pyx_v_self, CYTHON_UNUSED PyObject *__pyx_v___pyx_state); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_4_Fst__repr_svg_(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_4_Fst_2__repr__(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self); /* proto */\nstatic int __pyx_pf_9pywrapfst_4_Fst_4__init__(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_4_Fst_6__str__(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_4_Fst_8__reduce__(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_4_Fst_10arc_type(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_4_Fst_12arcs(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self, __pyx_t_10basictypes_int64 __pyx_v_state); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_4_Fst_14copy(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_4_Fst_16draw(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self, PyObject *__pyx_v_filename, struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_isymbols, struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_osymbols, struct __pyx_obj_9pywrapfst_SymbolTable *__pyx_v_ssymbols, bool __pyx_v_acceptor, PyObject *__pyx_v_title, double __pyx_v_width, double __pyx_v_height, bool __pyx_v_portrait, bool __pyx_v_vertical, double __pyx_v_ranksep, double __pyx_v_nodesep, __pyx_t_10basictypes_int32 __pyx_v_fontsize, __pyx_t_10basictypes_int32 __pyx_v_precision, PyObject *__pyx_v_float_format, bool __pyx_v_show_weight_one); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_4_Fst_18final(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self, __pyx_t_10basictypes_int64 __pyx_v_state); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_4_Fst_20fst_type(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_4_Fst_22input_symbols(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_4_Fst_24num_arcs(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self, __pyx_t_10basictypes_int64 __pyx_v_state); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_4_Fst_26num_input_epsilons(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self, __pyx_t_10basictypes_int64 __pyx_v_state); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_4_Fst_28num_output_epsilons(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self, __pyx_t_10basictypes_int64 __pyx_v_state); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_4_Fst_30output_symbols(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_4_Fst_32properties(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self, __pyx_t_10basictypes_uint64 __pyx_v_mask, bool __pyx_v_test); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_4_Fst_34start(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_4_Fst_36states(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_4_Fst_38text(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self, struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_isymbols, struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_osymbols, struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_ssymbols, bool __pyx_v_acceptor, bool __pyx_v_show_weight_one, PyObject *__pyx_v_missing_sym); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_4_Fst_40verify(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_4_Fst_42weight_type(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_4_Fst_44write(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self, PyObject *__pyx_v_filename); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_4_Fst_46write_to_string(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_add_arc(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, __pyx_t_10basictypes_int64 __pyx_v_state, struct __pyx_obj_9pywrapfst_Arc *__pyx_v_arc); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_2add_state(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_4arcsort(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, PyObject *__pyx_v_sort_type); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_6closure(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, bool __pyx_v_closure_plus); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_8concat(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_10connect(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_12decode(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, struct __pyx_obj_9pywrapfst_EncodeMapper *__pyx_v_encoder); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_14delete_arcs(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, __pyx_t_10basictypes_int64 __pyx_v_state, size_t __pyx_v_n); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_16delete_states(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, PyObject *__pyx_v_states); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_18encode(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, struct __pyx_obj_9pywrapfst_EncodeMapper *__pyx_v_encoder); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_20invert(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_22minimize(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, float __pyx_v_delta, bool __pyx_v_allow_nondet); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_24mutable_arcs(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, __pyx_t_10basictypes_int64 __pyx_v_state); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_26mutable_input_symbols(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_28mutable_output_symbols(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_30num_states(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_32project(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, bool __pyx_v_project_output); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_34prune(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, float __pyx_v_delta, __pyx_t_10basictypes_int64 __pyx_v_nstate, PyObject *__pyx_v_weight); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_36push(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, float __pyx_v_delta, bool __pyx_v_remove_total_weight, bool __pyx_v_to_final); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_38relabel_pairs(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, PyObject *__pyx_v_ipairs, PyObject *__pyx_v_opairs); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_40relabel_tables(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_old_isymbols, struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_new_isymbols, PyObject *__pyx_v_unknown_isymbol, bool __pyx_v_attach_new_isymbols, struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_old_osymbols, struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_new_osymbols, PyObject *__pyx_v_unknown_osymbol, bool __pyx_v_attach_new_osymbols); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_42reserve_arcs(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, __pyx_t_10basictypes_int64 __pyx_v_state, size_t __pyx_v_n); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_44reserve_states(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, __pyx_t_10basictypes_int64 __pyx_v_n); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_46reweight(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, PyObject *__pyx_v_potentials, bool __pyx_v_to_final); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_48rmepsilon(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, PyObject *__pyx_v_queue_type, bool __pyx_v_connect, PyObject *__pyx_v_weight, __pyx_t_10basictypes_int64 __pyx_v_nstate, float __pyx_v_delta); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_50set_final(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, __pyx_t_10basictypes_int64 __pyx_v_state, PyObject *__pyx_v_weight); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_52set_input_symbols(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_syms); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_54set_output_symbols(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_syms); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_56set_properties(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, __pyx_t_10basictypes_uint64 __pyx_v_props, __pyx_t_10basictypes_uint64 __pyx_v_mask); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_58set_start(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, __pyx_t_10basictypes_int64 __pyx_v_state); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_60topsort(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_62union(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_12_read(CYTHON_UNUSED PyObject *__pyx_self, PyObject *__pyx_v_filename); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_14_read_from_string(CYTHON_UNUSED PyObject *__pyx_self, PyObject *__pyx_v_state); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_3Fst___new__(CYTHON_UNUSED PyObject *__pyx_self, CYTHON_UNUSED PyObject *__pyx_v_cls, PyObject *__pyx_v_arc_type); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_3Fst_2read(CYTHON_UNUSED PyObject *__pyx_self, PyObject *__pyx_v_filename); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_3Fst_4read_from_string(CYTHON_UNUSED PyObject *__pyx_self, PyObject *__pyx_v_state); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_3Arc___repr__(struct __pyx_obj_9pywrapfst_Arc *__pyx_v_self); /* proto */\nstatic int __pyx_pf_9pywrapfst_3Arc_2__init__(struct __pyx_obj_9pywrapfst_Arc *__pyx_v_self, __pyx_t_10basictypes_int64 __pyx_v_ilabel, __pyx_t_10basictypes_int64 __pyx_v_olabel, PyObject *__pyx_v_weight, __pyx_t_10basictypes_int64 __pyx_v_nextstate); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_3Arc_4copy(struct __pyx_obj_9pywrapfst_Arc *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_3Arc_6ilabel___get__(struct __pyx_obj_9pywrapfst_Arc *__pyx_v_self); /* proto */\nstatic int __pyx_pf_9pywrapfst_3Arc_6ilabel_2__set__(struct __pyx_obj_9pywrapfst_Arc *__pyx_v_self, __pyx_t_10basictypes_int64 __pyx_v_value); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_3Arc_6olabel___get__(struct __pyx_obj_9pywrapfst_Arc *__pyx_v_self); /* proto */\nstatic int __pyx_pf_9pywrapfst_3Arc_6olabel_2__set__(struct __pyx_obj_9pywrapfst_Arc *__pyx_v_self, __pyx_t_10basictypes_int64 __pyx_v_value); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_3Arc_6weight___get__(struct __pyx_obj_9pywrapfst_Arc *__pyx_v_self); /* proto */\nstatic int __pyx_pf_9pywrapfst_3Arc_6weight_2__set__(struct __pyx_obj_9pywrapfst_Arc *__pyx_v_self, PyObject *__pyx_v_weight); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_3Arc_9nextstate___get__(struct __pyx_obj_9pywrapfst_Arc *__pyx_v_self); /* proto */\nstatic int __pyx_pf_9pywrapfst_3Arc_9nextstate_2__set__(struct __pyx_obj_9pywrapfst_Arc *__pyx_v_self, __pyx_t_10basictypes_int64 __pyx_v_value); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_3Arc_6__reduce_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst_Arc *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_3Arc_8__setstate_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst_Arc *__pyx_v_self, CYTHON_UNUSED PyObject *__pyx_v___pyx_state); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_11ArcIterator___repr__(struct __pyx_obj_9pywrapfst_ArcIterator *__pyx_v_self); /* proto */\nstatic int __pyx_pf_9pywrapfst_11ArcIterator_2__init__(struct __pyx_obj_9pywrapfst_ArcIterator *__pyx_v_self, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst, __pyx_t_10basictypes_int64 __pyx_v_state); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_11ArcIterator_4__iter__(struct __pyx_obj_9pywrapfst_ArcIterator *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_11ArcIterator_6__next__(struct __pyx_obj_9pywrapfst_ArcIterator *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_11ArcIterator_8done(struct __pyx_obj_9pywrapfst_ArcIterator *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_11ArcIterator_10flags(struct __pyx_obj_9pywrapfst_ArcIterator *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_11ArcIterator_12next(struct __pyx_obj_9pywrapfst_ArcIterator *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_11ArcIterator_14position(struct __pyx_obj_9pywrapfst_ArcIterator *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_11ArcIterator_16reset(struct __pyx_obj_9pywrapfst_ArcIterator *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_11ArcIterator_18seek(struct __pyx_obj_9pywrapfst_ArcIterator *__pyx_v_self, size_t __pyx_v_a); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_11ArcIterator_20set_flags(struct __pyx_obj_9pywrapfst_ArcIterator *__pyx_v_self, __pyx_t_10basictypes_uint32 __pyx_v_flags, __pyx_t_10basictypes_uint32 __pyx_v_mask); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_11ArcIterator_22value(struct __pyx_obj_9pywrapfst_ArcIterator *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_11ArcIterator_24__reduce_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst_ArcIterator *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_11ArcIterator_26__setstate_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst_ArcIterator *__pyx_v_self, CYTHON_UNUSED PyObject *__pyx_v___pyx_state); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_18MutableArcIterator___repr__(struct __pyx_obj_9pywrapfst_MutableArcIterator *__pyx_v_self); /* proto */\nstatic int __pyx_pf_9pywrapfst_18MutableArcIterator_2__init__(struct __pyx_obj_9pywrapfst_MutableArcIterator *__pyx_v_self, struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_ifst, __pyx_t_10basictypes_int64 __pyx_v_state); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_18MutableArcIterator_4done(struct __pyx_obj_9pywrapfst_MutableArcIterator *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_18MutableArcIterator_6flags(struct __pyx_obj_9pywrapfst_MutableArcIterator *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_18MutableArcIterator_8next(struct __pyx_obj_9pywrapfst_MutableArcIterator *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_18MutableArcIterator_10position(struct __pyx_obj_9pywrapfst_MutableArcIterator *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_18MutableArcIterator_12reset(struct __pyx_obj_9pywrapfst_MutableArcIterator *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_18MutableArcIterator_14seek(struct __pyx_obj_9pywrapfst_MutableArcIterator *__pyx_v_self, size_t __pyx_v_a); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_18MutableArcIterator_16set_flags(struct __pyx_obj_9pywrapfst_MutableArcIterator *__pyx_v_self, __pyx_t_10basictypes_uint32 __pyx_v_flags, __pyx_t_10basictypes_uint32 __pyx_v_mask); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_18MutableArcIterator_18set_value(struct __pyx_obj_9pywrapfst_MutableArcIterator *__pyx_v_self, struct __pyx_obj_9pywrapfst_Arc *__pyx_v_arc); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_18MutableArcIterator_20value(struct __pyx_obj_9pywrapfst_MutableArcIterator *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_18MutableArcIterator_22__reduce_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst_MutableArcIterator *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_18MutableArcIterator_24__setstate_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst_MutableArcIterator *__pyx_v_self, CYTHON_UNUSED PyObject *__pyx_v___pyx_state); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_13StateIterator___repr__(struct __pyx_obj_9pywrapfst_StateIterator *__pyx_v_self); /* proto */\nstatic int __pyx_pf_9pywrapfst_13StateIterator_2__init__(struct __pyx_obj_9pywrapfst_StateIterator *__pyx_v_self, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_13StateIterator_4__iter__(struct __pyx_obj_9pywrapfst_StateIterator *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_13StateIterator_6__next__(struct __pyx_obj_9pywrapfst_StateIterator *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_13StateIterator_8done(struct __pyx_obj_9pywrapfst_StateIterator *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_13StateIterator_10next(struct __pyx_obj_9pywrapfst_StateIterator *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_13StateIterator_12reset(struct __pyx_obj_9pywrapfst_StateIterator *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_13StateIterator_14value(struct __pyx_obj_9pywrapfst_StateIterator *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_13StateIterator_16__reduce_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst_StateIterator *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_13StateIterator_18__setstate_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst_StateIterator *__pyx_v_self, CYTHON_UNUSED PyObject *__pyx_v___pyx_state); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_16arcmap(CYTHON_UNUSED PyObject *__pyx_self, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst, float __pyx_v_delta, PyObject *__pyx_v_map_type, double __pyx_v_power, PyObject *__pyx_v_weight); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_18compose(CYTHON_UNUSED PyObject *__pyx_self, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst1, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst2, PyObject *__pyx_v_compose_filter, bool __pyx_v_connect); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_20convert(CYTHON_UNUSED PyObject *__pyx_self, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst, PyObject *__pyx_v_fst_type); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_22determinize(CYTHON_UNUSED PyObject *__pyx_self, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst, float __pyx_v_delta, PyObject *__pyx_v_det_type, __pyx_t_10basictypes_int64 __pyx_v_nstate, __pyx_t_10basictypes_int64 __pyx_v_subsequential_label, PyObject *__pyx_v_weight, bool __pyx_v_increment_subsequential_label); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_24difference(CYTHON_UNUSED PyObject *__pyx_self, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst1, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst2, PyObject *__pyx_v_compose_filter, bool __pyx_v_connect); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_26disambiguate(CYTHON_UNUSED PyObject *__pyx_self, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst, float __pyx_v_delta, __pyx_t_10basictypes_int64 __pyx_v_nstate, __pyx_t_10basictypes_int64 __pyx_v_subsequential_label, PyObject *__pyx_v_weight); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_28epsnormalize(CYTHON_UNUSED PyObject *__pyx_self, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst, bool __pyx_v_eps_norm_output); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_30equal(CYTHON_UNUSED PyObject *__pyx_self, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst1, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst2, float __pyx_v_delta); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_32equivalent(CYTHON_UNUSED PyObject *__pyx_self, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst1, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst2, float __pyx_v_delta); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_34intersect(CYTHON_UNUSED PyObject *__pyx_self, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst1, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst2, PyObject *__pyx_v_compose_filter, bool __pyx_v_connect); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_36isomorphic(CYTHON_UNUSED PyObject *__pyx_self, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst1, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst2, float __pyx_v_delta); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_38prune(CYTHON_UNUSED PyObject *__pyx_self, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst, float __pyx_v_delta, __pyx_t_10basictypes_int64 __pyx_v_nstate, PyObject *__pyx_v_weight); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_40push(CYTHON_UNUSED PyObject *__pyx_self, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst, float __pyx_v_delta, bool __pyx_v_push_weights, bool __pyx_v_push_labels, bool __pyx_v_remove_common_affix, bool __pyx_v_remove_total_weight, bool __pyx_v_to_final); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_42randequivalent(CYTHON_UNUSED PyObject *__pyx_self, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst1, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst2, __pyx_t_10basictypes_int32 __pyx_v_npath, float __pyx_v_delta, time_t __pyx_v_seed, PyObject *__pyx_v_select, __pyx_t_10basictypes_int32 __pyx_v_max_length); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_44randgen(CYTHON_UNUSED PyObject *__pyx_self, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst, __pyx_t_10basictypes_int32 __pyx_v_npath, time_t __pyx_v_seed, PyObject *__pyx_v_select, __pyx_t_10basictypes_int32 __pyx_v_max_length, bool __pyx_v_weighted, bool __pyx_v_remove_total_weight); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_46replace(CYTHON_UNUSED PyObject *__pyx_self, PyObject *__pyx_v_pairs, PyObject *__pyx_v_call_arc_labeling, PyObject *__pyx_v_return_arc_labeling, bool __pyx_v_epsilon_on_replace, __pyx_t_10basictypes_int64 __pyx_v_return_label); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_48reverse(CYTHON_UNUSED PyObject *__pyx_self, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst, bool __pyx_v_require_superinitial); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_50shortestdistance(CYTHON_UNUSED PyObject *__pyx_self, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst, float __pyx_v_delta, __pyx_t_10basictypes_int64 __pyx_v_nstate, PyObject *__pyx_v_queue_type, bool __pyx_v_reverse); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_52shortestpath(CYTHON_UNUSED PyObject *__pyx_self, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst, float __pyx_v_delta, __pyx_t_10basictypes_int32 __pyx_v_nshortest, __pyx_t_10basictypes_int64 __pyx_v_nstate, PyObject *__pyx_v_queue_type, bool __pyx_v_unique, PyObject *__pyx_v_weight); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_54statemap(CYTHON_UNUSED PyObject *__pyx_self, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst, PyObject *__pyx_v_map_type); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_56synchronize(CYTHON_UNUSED PyObject *__pyx_self, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst); /* proto */\nstatic int __pyx_pf_9pywrapfst_8Compiler___cinit__(struct __pyx_obj_9pywrapfst_Compiler *__pyx_v_self, std::string __pyx_v_fst_type, std::string __pyx_v_arc_type, struct __pyx_obj_9pywrapfst_SymbolTable *__pyx_v_isymbols, struct __pyx_obj_9pywrapfst_SymbolTable *__pyx_v_osymbols, struct __pyx_obj_9pywrapfst_SymbolTable *__pyx_v_ssymbols, bool __pyx_v_acceptor, bool __pyx_v_keep_isymbols, bool __pyx_v_keep_osymbols, bool __pyx_v_keep_state_numbering, bool __pyx_v_allow_negative_labels); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_8Compiler_2compile(struct __pyx_obj_9pywrapfst_Compiler *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_8Compiler_4write(struct __pyx_obj_9pywrapfst_Compiler *__pyx_v_self, PyObject *__pyx_v_expression); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_8Compiler_6__reduce_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst_Compiler *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_8Compiler_8__setstate_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst_Compiler *__pyx_v_self, CYTHON_UNUSED PyObject *__pyx_v___pyx_state); /* proto */\nstatic int __pyx_pf_9pywrapfst_9FarReader___init__(struct __pyx_obj_9pywrapfst_FarReader *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_9FarReader_2__repr__(struct __pyx_obj_9pywrapfst_FarReader *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_9FarReader_4open(CYTHON_UNUSED PyTypeObject *__pyx_v_cls, PyObject *__pyx_v_filenames); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_9FarReader_6arc_type(struct __pyx_obj_9pywrapfst_FarReader *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_9FarReader_8done(struct __pyx_obj_9pywrapfst_FarReader *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_9FarReader_10error(struct __pyx_obj_9pywrapfst_FarReader *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_9FarReader_12far_type(struct __pyx_obj_9pywrapfst_FarReader *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_9FarReader_14find(struct __pyx_obj_9pywrapfst_FarReader *__pyx_v_self, PyObject *__pyx_v_key); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_9FarReader_16get_fst(struct __pyx_obj_9pywrapfst_FarReader *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_9FarReader_18get_key(struct __pyx_obj_9pywrapfst_FarReader *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_9FarReader_20next(struct __pyx_obj_9pywrapfst_FarReader *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_9FarReader_22reset(struct __pyx_obj_9pywrapfst_FarReader *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_9FarReader_24__getitem__(struct __pyx_obj_9pywrapfst_FarReader *__pyx_v_self, PyObject *__pyx_v_key); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_9FarReader_26__reduce_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst_FarReader *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_9FarReader_28__setstate_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst_FarReader *__pyx_v_self, CYTHON_UNUSED PyObject *__pyx_v___pyx_state); /* proto */\nstatic int __pyx_pf_9pywrapfst_9FarWriter___init__(struct __pyx_obj_9pywrapfst_FarWriter *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_9FarWriter_2__repr__(struct __pyx_obj_9pywrapfst_FarWriter *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_9FarWriter_4create(CYTHON_UNUSED PyTypeObject *__pyx_v_cls, PyObject *__pyx_v_filename, PyObject *__pyx_v_arc_type, PyObject *__pyx_v_far_type); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_9FarWriter_6add(struct __pyx_obj_9pywrapfst_FarWriter *__pyx_v_self, PyObject *__pyx_v_key, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_9FarWriter_8arc_type(struct __pyx_obj_9pywrapfst_FarWriter *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_9FarWriter_10error(struct __pyx_obj_9pywrapfst_FarWriter *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_9FarWriter_12far_type(struct __pyx_obj_9pywrapfst_FarWriter *__pyx_v_self); /* proto */\nstatic int __pyx_pf_9pywrapfst_9FarWriter_14__setitem__(struct __pyx_obj_9pywrapfst_FarWriter *__pyx_v_self, PyObject *__pyx_v_key, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_fst); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_9FarWriter_16__reduce_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst_FarWriter *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_9FarWriter_18__setstate_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst_FarWriter *__pyx_v_self, CYTHON_UNUSED PyObject *__pyx_v___pyx_state); /* proto */\nstatic PyObject *__pyx_pf_9pywrapfst_58_reset_fst_error_fatal(CYTHON_UNUSED PyObject *__pyx_self); /* proto */\nstatic PyObject *__pyx_tp_new_9pywrapfst_Weight(PyTypeObject *t, PyObject *a, PyObject *k); /*proto*/\nstatic PyObject *__pyx_tp_new_9pywrapfst__SymbolTable(PyTypeObject *t, PyObject *a, PyObject *k); /*proto*/\nstatic PyObject *__pyx_tp_new_9pywrapfst__EncodeMapperSymbolTable(PyTypeObject *t, PyObject *a, PyObject *k); /*proto*/\nstatic PyObject *__pyx_tp_new_9pywrapfst__FstSymbolTable(PyTypeObject *t, PyObject *a, PyObject *k); /*proto*/\nstatic PyObject *__pyx_tp_new_9pywrapfst__MutableSymbolTable(PyTypeObject *t, PyObject *a, PyObject *k); /*proto*/\nstatic PyObject *__pyx_tp_new_9pywrapfst__MutableFstSymbolTable(PyTypeObject *t, PyObject *a, PyObject *k); /*proto*/\nstatic PyObject *__pyx_tp_new_9pywrapfst_SymbolTable(PyTypeObject *t, PyObject *a, PyObject *k); /*proto*/\nstatic PyObject *__pyx_tp_new_9pywrapfst_SymbolTableIterator(PyTypeObject *t, PyObject *a, PyObject *k); /*proto*/\nstatic PyObject *__pyx_tp_new_9pywrapfst_EncodeMapper(PyTypeObject *t, PyObject *a, PyObject *k); /*proto*/\nstatic PyObject *__pyx_tp_new_9pywrapfst__Fst(PyTypeObject *t, PyObject *a, PyObject *k); /*proto*/\nstatic PyObject *__pyx_tp_new_9pywrapfst__MutableFst(PyTypeObject *t, PyObject *a, PyObject *k); /*proto*/\nstatic PyObject *__pyx_tp_new_9pywrapfst_Arc(PyTypeObject *t, PyObject *a, PyObject *k); /*proto*/\nstatic PyObject *__pyx_tp_new_9pywrapfst_ArcIterator(PyTypeObject *t, PyObject *a, PyObject *k); /*proto*/\nstatic PyObject *__pyx_tp_new_9pywrapfst_MutableArcIterator(PyTypeObject *t, PyObject *a, PyObject *k); /*proto*/\nstatic PyObject *__pyx_tp_new_9pywrapfst_StateIterator(PyTypeObject *t, PyObject *a, PyObject *k); /*proto*/\nstatic PyObject *__pyx_tp_new_9pywrapfst_Compiler(PyTypeObject *t, PyObject *a, PyObject *k); /*proto*/\nstatic PyObject *__pyx_tp_new_9pywrapfst_FarReader(PyTypeObject *t, PyObject *a, PyObject *k); /*proto*/\nstatic PyObject *__pyx_tp_new_9pywrapfst_FarWriter(PyTypeObject *t, PyObject *a, PyObject *k); /*proto*/\nstatic PyObject *__pyx_int_0;\nstatic PyObject *__pyx_int_neg_1;\nstatic __pyx_t_10basictypes_int64 __pyx_k__13;\nstatic float __pyx_k__35;\nstatic float __pyx_k__36;\nstatic float __pyx_k__37;\nstatic __pyx_t_10basictypes_int64 __pyx_k__38;\nstatic float __pyx_k__39;\nstatic __pyx_t_10basictypes_int64 __pyx_k__40;\nstatic float __pyx_k__41;\nstatic float __pyx_k__42;\nstatic __pyx_t_10basictypes_int64 __pyx_k__46;\nstatic float __pyx_k__47;\nstatic __pyx_t_10basictypes_int64 __pyx_k__48;\nstatic float __pyx_k__49;\nstatic float __pyx_k__67;\nstatic float __pyx_k__68;\nstatic float __pyx_k__69;\nstatic __pyx_t_10basictypes_int64 __pyx_k__70;\nstatic float __pyx_k__71;\nstatic __pyx_t_10basictypes_int64 __pyx_k__72;\nstatic float __pyx_k__73;\nstatic float __pyx_k__74;\nstatic float __pyx_k__75;\nstatic float __pyx_k__76;\nstatic __pyx_t_10basictypes_int64 __pyx_k__77;\nstatic float __pyx_k__78;\nstatic float __pyx_k__79;\nstatic __pyx_t_10basictypes_int32 __pyx_k__80;\nstatic __pyx_t_10basictypes_int32 __pyx_k__81;\nstatic float __pyx_k__82;\nstatic __pyx_t_10basictypes_int64 __pyx_k__83;\nstatic float __pyx_k__84;\nstatic __pyx_t_10basictypes_int64 __pyx_k__85;\nstatic float __pyx_k__86;\nstatic __pyx_t_10basictypes_int64 __pyx_k__87;\nstatic std::string __pyx_k__88;\nstatic std::string __pyx_k__89;\nstatic PyObject *__pyx_tuple_;\nstatic PyObject *__pyx_tuple__2;\nstatic PyObject *__pyx_tuple__3;\nstatic PyObject *__pyx_tuple__4;\nstatic PyObject *__pyx_tuple__5;\nstatic PyObject *__pyx_tuple__6;\nstatic PyObject *__pyx_tuple__7;\nstatic PyObject *__pyx_tuple__8;\nstatic PyObject *__pyx_tuple__9;\nstatic PyObject *__pyx_tuple__10;\nstatic PyObject *__pyx_tuple__11;\nstatic PyObject *__pyx_tuple__12;\nstatic PyObject *__pyx_tuple__14;\nstatic PyObject *__pyx_tuple__15;\nstatic PyObject *__pyx_tuple__16;\nstatic PyObject *__pyx_tuple__17;\nstatic PyObject *__pyx_tuple__18;\nstatic PyObject *__pyx_tuple__19;\nstatic PyObject *__pyx_tuple__20;\nstatic PyObject *__pyx_tuple__21;\nstatic PyObject *__pyx_tuple__22;\nstatic PyObject *__pyx_tuple__23;\nstatic PyObject *__pyx_tuple__25;\nstatic PyObject *__pyx_tuple__26;\nstatic PyObject *__pyx_tuple__27;\nstatic PyObject *__pyx_tuple__28;\nstatic PyObject *__pyx_tuple__29;\nstatic PyObject *__pyx_tuple__30;\nstatic PyObject *__pyx_tuple__31;\nstatic PyObject *__pyx_tuple__32;\nstatic PyObject *__pyx_tuple__33;\nstatic PyObject *__pyx_tuple__34;\nstatic PyObject *__pyx_tuple__43;\nstatic PyObject *__pyx_tuple__44;\nstatic PyObject *__pyx_tuple__45;\nstatic PyObject *__pyx_tuple__50;\nstatic PyObject *__pyx_tuple__51;\nstatic PyObject *__pyx_tuple__52;\nstatic PyObject *__pyx_tuple__53;\nstatic PyObject *__pyx_tuple__54;\nstatic PyObject *__pyx_tuple__55;\nstatic PyObject *__pyx_tuple__56;\nstatic PyObject *__pyx_tuple__57;\nstatic PyObject *__pyx_tuple__58;\nstatic PyObject *__pyx_tuple__59;\nstatic PyObject *__pyx_tuple__60;\nstatic PyObject *__pyx_tuple__61;\nstatic PyObject *__pyx_tuple__62;\nstatic PyObject *__pyx_tuple__63;\nstatic PyObject *__pyx_tuple__64;\nstatic PyObject *__pyx_tuple__65;\nstatic PyObject *__pyx_tuple__66;\nstatic PyObject *__pyx_tuple__90;\nstatic PyObject *__pyx_tuple__91;\nstatic PyObject *__pyx_tuple__92;\nstatic PyObject *__pyx_tuple__93;\nstatic PyObject *__pyx_tuple__94;\nstatic PyObject *__pyx_tuple__95;\nstatic PyObject *__pyx_tuple__96;\nstatic PyObject *__pyx_tuple__97;\nstatic PyObject *__pyx_tuple__98;\nstatic PyObject *__pyx_tuple__99;\nstatic PyObject *__pyx_tuple__101;\nstatic PyObject *__pyx_tuple__103;\nstatic PyObject *__pyx_tuple__105;\nstatic PyObject *__pyx_tuple__107;\nstatic PyObject *__pyx_tuple__108;\nstatic PyObject *__pyx_tuple__110;\nstatic PyObject *__pyx_tuple__111;\nstatic PyObject *__pyx_tuple__113;\nstatic PyObject *__pyx_tuple__115;\nstatic PyObject *__pyx_codeobj__100;\nstatic PyObject *__pyx_codeobj__102;\nstatic PyObject *__pyx_codeobj__104;\nstatic PyObject *__pyx_codeobj__106;\nstatic PyObject *__pyx_codeobj__109;\nstatic PyObject *__pyx_codeobj__112;\nstatic PyObject *__pyx_codeobj__114;\nstatic PyObject *__pyx_codeobj__116;\nstatic PyObject *__pyx_codeobj__117;\n/* Late includes */\n\n/* \"pywrapfst.pyx\":159\n * \n * \n * cdef string tostring(data, encoding=\"utf8\") except *:             # <<<<<<<<<<<<<<\n *   \"\"\"Converts strings to bytestrings.\n * \n */\n\nstatic std::string __pyx_f_9pywrapfst_tostring(PyObject *__pyx_v_data, struct __pyx_opt_args_9pywrapfst_tostring *__pyx_optional_args) {\n  PyObject *__pyx_v_encoding = ((PyObject *)__pyx_n_s_utf8);\n  std::string __pyx_r;\n  __Pyx_RefNannyDeclarations\n  int __pyx_t_1;\n  int __pyx_t_2;\n  std::string __pyx_t_3;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  PyObject *__pyx_t_6 = NULL;\n  PyObject *__pyx_t_7 = NULL;\n  PyObject *__pyx_t_8 = NULL;\n  PyObject *__pyx_t_9 = NULL;\n  __Pyx_RefNannySetupContext(\"tostring\", 0);\n  if (__pyx_optional_args) {\n    if (__pyx_optional_args->__pyx_n > 0) {\n      __pyx_v_encoding = __pyx_optional_args->encoding;\n    }\n  }\n\n  /* \"pywrapfst.pyx\":180\n *   \"\"\"\n *   # A Python bytestring can be implicitly cast to a C++ string.\n *   if isinstance(data, bytes):             # <<<<<<<<<<<<<<\n *     return data\n *   elif isinstance(data, unicode):\n */\n  __pyx_t_1 = PyBytes_Check(__pyx_v_data); \n  __pyx_t_2 = (__pyx_t_1 != 0);\n  if (__pyx_t_2) {\n\n    /* \"pywrapfst.pyx\":181\n *   # A Python bytestring can be implicitly cast to a C++ string.\n *   if isinstance(data, bytes):\n *     return data             # <<<<<<<<<<<<<<\n *   elif isinstance(data, unicode):\n *     return data.encode(encoding)\n */\n    __pyx_t_3 = __pyx_convert_string_from_py_std__in_string(__pyx_v_data); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 181, __pyx_L1_error)\n    __pyx_r = __pyx_t_3;\n    goto __pyx_L0;\n\n    /* \"pywrapfst.pyx\":180\n *   \"\"\"\n *   # A Python bytestring can be implicitly cast to a C++ string.\n *   if isinstance(data, bytes):             # <<<<<<<<<<<<<<\n *     return data\n *   elif isinstance(data, unicode):\n */\n  }\n\n  /* \"pywrapfst.pyx\":182\n *   if isinstance(data, bytes):\n *     return data\n *   elif isinstance(data, unicode):             # <<<<<<<<<<<<<<\n *     return data.encode(encoding)\n *   raise FstArgError(\"Cannot encode as string: {!r}\".format(data))\n */\n  __pyx_t_2 = PyUnicode_Check(__pyx_v_data); \n  __pyx_t_1 = (__pyx_t_2 != 0);\n  if (__pyx_t_1) {\n\n    /* \"pywrapfst.pyx\":183\n *     return data\n *   elif isinstance(data, unicode):\n *     return data.encode(encoding)             # <<<<<<<<<<<<<<\n *   raise FstArgError(\"Cannot encode as string: {!r}\".format(data))\n * \n */\n    __pyx_t_5 = __Pyx_PyObject_GetAttrStr(__pyx_v_data, __pyx_n_s_encode); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 183, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_5);\n    __pyx_t_6 = NULL;\n    if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_5))) {\n      __pyx_t_6 = PyMethod_GET_SELF(__pyx_t_5);\n      if (likely(__pyx_t_6)) {\n        PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_5);\n        __Pyx_INCREF(__pyx_t_6);\n        __Pyx_INCREF(function);\n        __Pyx_DECREF_SET(__pyx_t_5, function);\n      }\n    }\n    if (!__pyx_t_6) {\n      __pyx_t_4 = __Pyx_PyObject_CallOneArg(__pyx_t_5, __pyx_v_encoding); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 183, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_4);\n    } else {\n      #if CYTHON_FAST_PYCALL\n      if (PyFunction_Check(__pyx_t_5)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_6, __pyx_v_encoding};\n        __pyx_t_4 = __Pyx_PyFunction_FastCall(__pyx_t_5, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 183, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_6); __pyx_t_6 = 0;\n        __Pyx_GOTREF(__pyx_t_4);\n      } else\n      #endif\n      #if CYTHON_FAST_PYCCALL\n      if (__Pyx_PyFastCFunction_Check(__pyx_t_5)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_6, __pyx_v_encoding};\n        __pyx_t_4 = __Pyx_PyCFunction_FastCall(__pyx_t_5, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 183, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_6); __pyx_t_6 = 0;\n        __Pyx_GOTREF(__pyx_t_4);\n      } else\n      #endif\n      {\n        __pyx_t_7 = PyTuple_New(1+1); if (unlikely(!__pyx_t_7)) __PYX_ERR(0, 183, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_7);\n        __Pyx_GIVEREF(__pyx_t_6); PyTuple_SET_ITEM(__pyx_t_7, 0, __pyx_t_6); __pyx_t_6 = NULL;\n        __Pyx_INCREF(__pyx_v_encoding);\n        __Pyx_GIVEREF(__pyx_v_encoding);\n        PyTuple_SET_ITEM(__pyx_t_7, 0+1, __pyx_v_encoding);\n        __pyx_t_4 = __Pyx_PyObject_Call(__pyx_t_5, __pyx_t_7, NULL); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 183, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_4);\n        __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0;\n      }\n    }\n    __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n    __pyx_t_3 = __pyx_convert_string_from_py_std__in_string(__pyx_t_4); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 183, __pyx_L1_error)\n    __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n    __pyx_r = __pyx_t_3;\n    goto __pyx_L0;\n\n    /* \"pywrapfst.pyx\":182\n *   if isinstance(data, bytes):\n *     return data\n *   elif isinstance(data, unicode):             # <<<<<<<<<<<<<<\n *     return data.encode(encoding)\n *   raise FstArgError(\"Cannot encode as string: {!r}\".format(data))\n */\n  }\n\n  /* \"pywrapfst.pyx\":184\n *   elif isinstance(data, unicode):\n *     return data.encode(encoding)\n *   raise FstArgError(\"Cannot encode as string: {!r}\".format(data))             # <<<<<<<<<<<<<<\n * \n * \n */\n  __pyx_t_5 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstArgError); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 184, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_5);\n  __pyx_t_6 = __Pyx_PyObject_GetAttrStr(__pyx_kp_s_Cannot_encode_as_string_r, __pyx_n_s_format); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 184, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_6);\n  __pyx_t_8 = NULL;\n  if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_6))) {\n    __pyx_t_8 = PyMethod_GET_SELF(__pyx_t_6);\n    if (likely(__pyx_t_8)) {\n      PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_6);\n      __Pyx_INCREF(__pyx_t_8);\n      __Pyx_INCREF(function);\n      __Pyx_DECREF_SET(__pyx_t_6, function);\n    }\n  }\n  if (!__pyx_t_8) {\n    __pyx_t_7 = __Pyx_PyObject_CallOneArg(__pyx_t_6, __pyx_v_data); if (unlikely(!__pyx_t_7)) __PYX_ERR(0, 184, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_7);\n  } else {\n    #if CYTHON_FAST_PYCALL\n    if (PyFunction_Check(__pyx_t_6)) {\n      PyObject *__pyx_temp[2] = {__pyx_t_8, __pyx_v_data};\n      __pyx_t_7 = __Pyx_PyFunction_FastCall(__pyx_t_6, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_7)) __PYX_ERR(0, 184, __pyx_L1_error)\n      __Pyx_XDECREF(__pyx_t_8); __pyx_t_8 = 0;\n      __Pyx_GOTREF(__pyx_t_7);\n    } else\n    #endif\n    #if CYTHON_FAST_PYCCALL\n    if (__Pyx_PyFastCFunction_Check(__pyx_t_6)) {\n      PyObject *__pyx_temp[2] = {__pyx_t_8, __pyx_v_data};\n      __pyx_t_7 = __Pyx_PyCFunction_FastCall(__pyx_t_6, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_7)) __PYX_ERR(0, 184, __pyx_L1_error)\n      __Pyx_XDECREF(__pyx_t_8); __pyx_t_8 = 0;\n      __Pyx_GOTREF(__pyx_t_7);\n    } else\n    #endif\n    {\n      __pyx_t_9 = PyTuple_New(1+1); if (unlikely(!__pyx_t_9)) __PYX_ERR(0, 184, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_9);\n      __Pyx_GIVEREF(__pyx_t_8); PyTuple_SET_ITEM(__pyx_t_9, 0, __pyx_t_8); __pyx_t_8 = NULL;\n      __Pyx_INCREF(__pyx_v_data);\n      __Pyx_GIVEREF(__pyx_v_data);\n      PyTuple_SET_ITEM(__pyx_t_9, 0+1, __pyx_v_data);\n      __pyx_t_7 = __Pyx_PyObject_Call(__pyx_t_6, __pyx_t_9, NULL); if (unlikely(!__pyx_t_7)) __PYX_ERR(0, 184, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_7);\n      __Pyx_DECREF(__pyx_t_9); __pyx_t_9 = 0;\n    }\n  }\n  __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n  __pyx_t_6 = NULL;\n  if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_5))) {\n    __pyx_t_6 = PyMethod_GET_SELF(__pyx_t_5);\n    if (likely(__pyx_t_6)) {\n      PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_5);\n      __Pyx_INCREF(__pyx_t_6);\n      __Pyx_INCREF(function);\n      __Pyx_DECREF_SET(__pyx_t_5, function);\n    }\n  }\n  if (!__pyx_t_6) {\n    __pyx_t_4 = __Pyx_PyObject_CallOneArg(__pyx_t_5, __pyx_t_7); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 184, __pyx_L1_error)\n    __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0;\n    __Pyx_GOTREF(__pyx_t_4);\n  } else {\n    #if CYTHON_FAST_PYCALL\n    if (PyFunction_Check(__pyx_t_5)) {\n      PyObject *__pyx_temp[2] = {__pyx_t_6, __pyx_t_7};\n      __pyx_t_4 = __Pyx_PyFunction_FastCall(__pyx_t_5, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 184, __pyx_L1_error)\n      __Pyx_XDECREF(__pyx_t_6); __pyx_t_6 = 0;\n      __Pyx_GOTREF(__pyx_t_4);\n      __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0;\n    } else\n    #endif\n    #if CYTHON_FAST_PYCCALL\n    if (__Pyx_PyFastCFunction_Check(__pyx_t_5)) {\n      PyObject *__pyx_temp[2] = {__pyx_t_6, __pyx_t_7};\n      __pyx_t_4 = __Pyx_PyCFunction_FastCall(__pyx_t_5, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 184, __pyx_L1_error)\n      __Pyx_XDECREF(__pyx_t_6); __pyx_t_6 = 0;\n      __Pyx_GOTREF(__pyx_t_4);\n      __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0;\n    } else\n    #endif\n    {\n      __pyx_t_9 = PyTuple_New(1+1); if (unlikely(!__pyx_t_9)) __PYX_ERR(0, 184, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_9);\n      __Pyx_GIVEREF(__pyx_t_6); PyTuple_SET_ITEM(__pyx_t_9, 0, __pyx_t_6); __pyx_t_6 = NULL;\n      __Pyx_GIVEREF(__pyx_t_7);\n      PyTuple_SET_ITEM(__pyx_t_9, 0+1, __pyx_t_7);\n      __pyx_t_7 = 0;\n      __pyx_t_4 = __Pyx_PyObject_Call(__pyx_t_5, __pyx_t_9, NULL); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 184, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_4);\n      __Pyx_DECREF(__pyx_t_9); __pyx_t_9 = 0;\n    }\n  }\n  __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n  __Pyx_Raise(__pyx_t_4, 0, 0, 0);\n  __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n  __PYX_ERR(0, 184, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":159\n * \n * \n * cdef string tostring(data, encoding=\"utf8\") except *:             # <<<<<<<<<<<<<<\n *   \"\"\"Converts strings to bytestrings.\n * \n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_XDECREF(__pyx_t_6);\n  __Pyx_XDECREF(__pyx_t_7);\n  __Pyx_XDECREF(__pyx_t_8);\n  __Pyx_XDECREF(__pyx_t_9);\n  __Pyx_AddTraceback(\"pywrapfst.tostring\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_pretend_to_initialize(&__pyx_r);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":187\n * \n * \n * cdef string weight_tostring(data, encoding=\"utf8\") except *:             # <<<<<<<<<<<<<<\n *   \"\"\"Converts strings or numerics to bytestrings.\n * \n */\n\nstatic std::string __pyx_f_9pywrapfst_weight_tostring(PyObject *__pyx_v_data, struct __pyx_opt_args_9pywrapfst_weight_tostring *__pyx_optional_args) {\n  PyObject *__pyx_v_encoding = ((PyObject *)__pyx_n_s_utf8);\n  std::string __pyx_r;\n  __Pyx_RefNannyDeclarations\n  int __pyx_t_1;\n  int __pyx_t_2;\n  std::string __pyx_t_3;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  PyObject *__pyx_t_6 = NULL;\n  PyObject *__pyx_t_7 = NULL;\n  PyObject *__pyx_t_8 = NULL;\n  PyObject *__pyx_t_9 = NULL;\n  __Pyx_RefNannySetupContext(\"weight_tostring\", 0);\n  if (__pyx_optional_args) {\n    if (__pyx_optional_args->__pyx_n > 0) {\n      __pyx_v_encoding = __pyx_optional_args->encoding;\n    }\n  }\n\n  /* \"pywrapfst.pyx\":211\n *   \"\"\"\n *   # A Python bytestring can be implicitly cast to a C++ string.\n *   if isinstance(data, bytes):             # <<<<<<<<<<<<<<\n *     return data\n *   elif isinstance(data, unicode):\n */\n  __pyx_t_1 = PyBytes_Check(__pyx_v_data); \n  __pyx_t_2 = (__pyx_t_1 != 0);\n  if (__pyx_t_2) {\n\n    /* \"pywrapfst.pyx\":212\n *   # A Python bytestring can be implicitly cast to a C++ string.\n *   if isinstance(data, bytes):\n *     return data             # <<<<<<<<<<<<<<\n *   elif isinstance(data, unicode):\n *     return data.encode(encoding)\n */\n    __pyx_t_3 = __pyx_convert_string_from_py_std__in_string(__pyx_v_data); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 212, __pyx_L1_error)\n    __pyx_r = __pyx_t_3;\n    goto __pyx_L0;\n\n    /* \"pywrapfst.pyx\":211\n *   \"\"\"\n *   # A Python bytestring can be implicitly cast to a C++ string.\n *   if isinstance(data, bytes):             # <<<<<<<<<<<<<<\n *     return data\n *   elif isinstance(data, unicode):\n */\n  }\n\n  /* \"pywrapfst.pyx\":213\n *   if isinstance(data, bytes):\n *     return data\n *   elif isinstance(data, unicode):             # <<<<<<<<<<<<<<\n *     return data.encode(encoding)\n *   elif isinstance(data, numbers.Number):\n */\n  __pyx_t_2 = PyUnicode_Check(__pyx_v_data); \n  __pyx_t_1 = (__pyx_t_2 != 0);\n  if (__pyx_t_1) {\n\n    /* \"pywrapfst.pyx\":214\n *     return data\n *   elif isinstance(data, unicode):\n *     return data.encode(encoding)             # <<<<<<<<<<<<<<\n *   elif isinstance(data, numbers.Number):\n *     return str(data).encode(encoding)\n */\n    __pyx_t_5 = __Pyx_PyObject_GetAttrStr(__pyx_v_data, __pyx_n_s_encode); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 214, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_5);\n    __pyx_t_6 = NULL;\n    if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_5))) {\n      __pyx_t_6 = PyMethod_GET_SELF(__pyx_t_5);\n      if (likely(__pyx_t_6)) {\n        PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_5);\n        __Pyx_INCREF(__pyx_t_6);\n        __Pyx_INCREF(function);\n        __Pyx_DECREF_SET(__pyx_t_5, function);\n      }\n    }\n    if (!__pyx_t_6) {\n      __pyx_t_4 = __Pyx_PyObject_CallOneArg(__pyx_t_5, __pyx_v_encoding); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 214, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_4);\n    } else {\n      #if CYTHON_FAST_PYCALL\n      if (PyFunction_Check(__pyx_t_5)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_6, __pyx_v_encoding};\n        __pyx_t_4 = __Pyx_PyFunction_FastCall(__pyx_t_5, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 214, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_6); __pyx_t_6 = 0;\n        __Pyx_GOTREF(__pyx_t_4);\n      } else\n      #endif\n      #if CYTHON_FAST_PYCCALL\n      if (__Pyx_PyFastCFunction_Check(__pyx_t_5)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_6, __pyx_v_encoding};\n        __pyx_t_4 = __Pyx_PyCFunction_FastCall(__pyx_t_5, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 214, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_6); __pyx_t_6 = 0;\n        __Pyx_GOTREF(__pyx_t_4);\n      } else\n      #endif\n      {\n        __pyx_t_7 = PyTuple_New(1+1); if (unlikely(!__pyx_t_7)) __PYX_ERR(0, 214, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_7);\n        __Pyx_GIVEREF(__pyx_t_6); PyTuple_SET_ITEM(__pyx_t_7, 0, __pyx_t_6); __pyx_t_6 = NULL;\n        __Pyx_INCREF(__pyx_v_encoding);\n        __Pyx_GIVEREF(__pyx_v_encoding);\n        PyTuple_SET_ITEM(__pyx_t_7, 0+1, __pyx_v_encoding);\n        __pyx_t_4 = __Pyx_PyObject_Call(__pyx_t_5, __pyx_t_7, NULL); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 214, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_4);\n        __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0;\n      }\n    }\n    __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n    __pyx_t_3 = __pyx_convert_string_from_py_std__in_string(__pyx_t_4); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 214, __pyx_L1_error)\n    __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n    __pyx_r = __pyx_t_3;\n    goto __pyx_L0;\n\n    /* \"pywrapfst.pyx\":213\n *   if isinstance(data, bytes):\n *     return data\n *   elif isinstance(data, unicode):             # <<<<<<<<<<<<<<\n *     return data.encode(encoding)\n *   elif isinstance(data, numbers.Number):\n */\n  }\n\n  /* \"pywrapfst.pyx\":215\n *   elif isinstance(data, unicode):\n *     return data.encode(encoding)\n *   elif isinstance(data, numbers.Number):             # <<<<<<<<<<<<<<\n *     return str(data).encode(encoding)\n *   raise FstArgError(\"Cannot encode as string: {!r}\".format(data))\n */\n  __pyx_t_4 = __Pyx_GetModuleGlobalName(__pyx_n_s_numbers); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 215, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_4);\n  __pyx_t_5 = __Pyx_PyObject_GetAttrStr(__pyx_t_4, __pyx_n_s_Number); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 215, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_5);\n  __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n  __pyx_t_1 = PyObject_IsInstance(__pyx_v_data, __pyx_t_5); if (unlikely(__pyx_t_1 == ((int)-1))) __PYX_ERR(0, 215, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n  __pyx_t_2 = (__pyx_t_1 != 0);\n  if (__pyx_t_2) {\n\n    /* \"pywrapfst.pyx\":216\n *     return data.encode(encoding)\n *   elif isinstance(data, numbers.Number):\n *     return str(data).encode(encoding)             # <<<<<<<<<<<<<<\n *   raise FstArgError(\"Cannot encode as string: {!r}\".format(data))\n * \n */\n    __pyx_t_4 = __Pyx_PyObject_CallOneArg(((PyObject *)(&PyString_Type)), __pyx_v_data); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 216, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_4);\n    __pyx_t_7 = __Pyx_PyObject_GetAttrStr(__pyx_t_4, __pyx_n_s_encode); if (unlikely(!__pyx_t_7)) __PYX_ERR(0, 216, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_7);\n    __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n    __pyx_t_4 = NULL;\n    if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_7))) {\n      __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_7);\n      if (likely(__pyx_t_4)) {\n        PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_7);\n        __Pyx_INCREF(__pyx_t_4);\n        __Pyx_INCREF(function);\n        __Pyx_DECREF_SET(__pyx_t_7, function);\n      }\n    }\n    if (!__pyx_t_4) {\n      __pyx_t_5 = __Pyx_PyObject_CallOneArg(__pyx_t_7, __pyx_v_encoding); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 216, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_5);\n    } else {\n      #if CYTHON_FAST_PYCALL\n      if (PyFunction_Check(__pyx_t_7)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_4, __pyx_v_encoding};\n        __pyx_t_5 = __Pyx_PyFunction_FastCall(__pyx_t_7, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 216, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_4); __pyx_t_4 = 0;\n        __Pyx_GOTREF(__pyx_t_5);\n      } else\n      #endif\n      #if CYTHON_FAST_PYCCALL\n      if (__Pyx_PyFastCFunction_Check(__pyx_t_7)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_4, __pyx_v_encoding};\n        __pyx_t_5 = __Pyx_PyCFunction_FastCall(__pyx_t_7, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 216, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_4); __pyx_t_4 = 0;\n        __Pyx_GOTREF(__pyx_t_5);\n      } else\n      #endif\n      {\n        __pyx_t_6 = PyTuple_New(1+1); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 216, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_6);\n        __Pyx_GIVEREF(__pyx_t_4); PyTuple_SET_ITEM(__pyx_t_6, 0, __pyx_t_4); __pyx_t_4 = NULL;\n        __Pyx_INCREF(__pyx_v_encoding);\n        __Pyx_GIVEREF(__pyx_v_encoding);\n        PyTuple_SET_ITEM(__pyx_t_6, 0+1, __pyx_v_encoding);\n        __pyx_t_5 = __Pyx_PyObject_Call(__pyx_t_7, __pyx_t_6, NULL); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 216, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_5);\n        __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n      }\n    }\n    __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0;\n    __pyx_t_3 = __pyx_convert_string_from_py_std__in_string(__pyx_t_5); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 216, __pyx_L1_error)\n    __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n    __pyx_r = __pyx_t_3;\n    goto __pyx_L0;\n\n    /* \"pywrapfst.pyx\":215\n *   elif isinstance(data, unicode):\n *     return data.encode(encoding)\n *   elif isinstance(data, numbers.Number):             # <<<<<<<<<<<<<<\n *     return str(data).encode(encoding)\n *   raise FstArgError(\"Cannot encode as string: {!r}\".format(data))\n */\n  }\n\n  /* \"pywrapfst.pyx\":217\n *   elif isinstance(data, numbers.Number):\n *     return str(data).encode(encoding)\n *   raise FstArgError(\"Cannot encode as string: {!r}\".format(data))             # <<<<<<<<<<<<<<\n * \n * \n */\n  __pyx_t_7 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstArgError); if (unlikely(!__pyx_t_7)) __PYX_ERR(0, 217, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_7);\n  __pyx_t_4 = __Pyx_PyObject_GetAttrStr(__pyx_kp_s_Cannot_encode_as_string_r, __pyx_n_s_format); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 217, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_4);\n  __pyx_t_8 = NULL;\n  if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_4))) {\n    __pyx_t_8 = PyMethod_GET_SELF(__pyx_t_4);\n    if (likely(__pyx_t_8)) {\n      PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_4);\n      __Pyx_INCREF(__pyx_t_8);\n      __Pyx_INCREF(function);\n      __Pyx_DECREF_SET(__pyx_t_4, function);\n    }\n  }\n  if (!__pyx_t_8) {\n    __pyx_t_6 = __Pyx_PyObject_CallOneArg(__pyx_t_4, __pyx_v_data); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 217, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_6);\n  } else {\n    #if CYTHON_FAST_PYCALL\n    if (PyFunction_Check(__pyx_t_4)) {\n      PyObject *__pyx_temp[2] = {__pyx_t_8, __pyx_v_data};\n      __pyx_t_6 = __Pyx_PyFunction_FastCall(__pyx_t_4, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 217, __pyx_L1_error)\n      __Pyx_XDECREF(__pyx_t_8); __pyx_t_8 = 0;\n      __Pyx_GOTREF(__pyx_t_6);\n    } else\n    #endif\n    #if CYTHON_FAST_PYCCALL\n    if (__Pyx_PyFastCFunction_Check(__pyx_t_4)) {\n      PyObject *__pyx_temp[2] = {__pyx_t_8, __pyx_v_data};\n      __pyx_t_6 = __Pyx_PyCFunction_FastCall(__pyx_t_4, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 217, __pyx_L1_error)\n      __Pyx_XDECREF(__pyx_t_8); __pyx_t_8 = 0;\n      __Pyx_GOTREF(__pyx_t_6);\n    } else\n    #endif\n    {\n      __pyx_t_9 = PyTuple_New(1+1); if (unlikely(!__pyx_t_9)) __PYX_ERR(0, 217, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_9);\n      __Pyx_GIVEREF(__pyx_t_8); PyTuple_SET_ITEM(__pyx_t_9, 0, __pyx_t_8); __pyx_t_8 = NULL;\n      __Pyx_INCREF(__pyx_v_data);\n      __Pyx_GIVEREF(__pyx_v_data);\n      PyTuple_SET_ITEM(__pyx_t_9, 0+1, __pyx_v_data);\n      __pyx_t_6 = __Pyx_PyObject_Call(__pyx_t_4, __pyx_t_9, NULL); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 217, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_6);\n      __Pyx_DECREF(__pyx_t_9); __pyx_t_9 = 0;\n    }\n  }\n  __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n  __pyx_t_4 = NULL;\n  if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_7))) {\n    __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_7);\n    if (likely(__pyx_t_4)) {\n      PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_7);\n      __Pyx_INCREF(__pyx_t_4);\n      __Pyx_INCREF(function);\n      __Pyx_DECREF_SET(__pyx_t_7, function);\n    }\n  }\n  if (!__pyx_t_4) {\n    __pyx_t_5 = __Pyx_PyObject_CallOneArg(__pyx_t_7, __pyx_t_6); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 217, __pyx_L1_error)\n    __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n    __Pyx_GOTREF(__pyx_t_5);\n  } else {\n    #if CYTHON_FAST_PYCALL\n    if (PyFunction_Check(__pyx_t_7)) {\n      PyObject *__pyx_temp[2] = {__pyx_t_4, __pyx_t_6};\n      __pyx_t_5 = __Pyx_PyFunction_FastCall(__pyx_t_7, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 217, __pyx_L1_error)\n      __Pyx_XDECREF(__pyx_t_4); __pyx_t_4 = 0;\n      __Pyx_GOTREF(__pyx_t_5);\n      __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n    } else\n    #endif\n    #if CYTHON_FAST_PYCCALL\n    if (__Pyx_PyFastCFunction_Check(__pyx_t_7)) {\n      PyObject *__pyx_temp[2] = {__pyx_t_4, __pyx_t_6};\n      __pyx_t_5 = __Pyx_PyCFunction_FastCall(__pyx_t_7, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 217, __pyx_L1_error)\n      __Pyx_XDECREF(__pyx_t_4); __pyx_t_4 = 0;\n      __Pyx_GOTREF(__pyx_t_5);\n      __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n    } else\n    #endif\n    {\n      __pyx_t_9 = PyTuple_New(1+1); if (unlikely(!__pyx_t_9)) __PYX_ERR(0, 217, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_9);\n      __Pyx_GIVEREF(__pyx_t_4); PyTuple_SET_ITEM(__pyx_t_9, 0, __pyx_t_4); __pyx_t_4 = NULL;\n      __Pyx_GIVEREF(__pyx_t_6);\n      PyTuple_SET_ITEM(__pyx_t_9, 0+1, __pyx_t_6);\n      __pyx_t_6 = 0;\n      __pyx_t_5 = __Pyx_PyObject_Call(__pyx_t_7, __pyx_t_9, NULL); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 217, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_5);\n      __Pyx_DECREF(__pyx_t_9); __pyx_t_9 = 0;\n    }\n  }\n  __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0;\n  __Pyx_Raise(__pyx_t_5, 0, 0, 0);\n  __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n  __PYX_ERR(0, 217, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":187\n * \n * \n * cdef string weight_tostring(data, encoding=\"utf8\") except *:             # <<<<<<<<<<<<<<\n *   \"\"\"Converts strings or numerics to bytestrings.\n * \n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_XDECREF(__pyx_t_6);\n  __Pyx_XDECREF(__pyx_t_7);\n  __Pyx_XDECREF(__pyx_t_8);\n  __Pyx_XDECREF(__pyx_t_9);\n  __Pyx_AddTraceback(\"pywrapfst.weight_tostring\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_pretend_to_initialize(&__pyx_r);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":220\n * \n * \n * cdef fst.ComposeFilter _get_compose_filter(             # <<<<<<<<<<<<<<\n *     const string &compose_filter) except *:\n *   \"\"\"Matches string with the appropriate ComposeFilter enum value.\n */\n\nstatic enum fst::ComposeFilter __pyx_f_9pywrapfst__get_compose_filter(std::string const &__pyx_v_compose_filter) {\n  enum fst::ComposeFilter __pyx_v_compose_filter_enum;\n  enum fst::ComposeFilter __pyx_r;\n  __Pyx_RefNannyDeclarations\n  int __pyx_t_1;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  PyObject *__pyx_t_6 = NULL;\n  PyObject *__pyx_t_7 = NULL;\n  PyObject *__pyx_t_8 = NULL;\n  __Pyx_RefNannySetupContext(\"_get_compose_filter\", 0);\n\n  /* \"pywrapfst.pyx\":241\n *   \"\"\"\n *   cdef fst.ComposeFilter compose_filter_enum\n *   if not fst.GetComposeFilter(compose_filter, addr(compose_filter_enum)):             # <<<<<<<<<<<<<<\n *     raise FstArgError(\"Unknown compose filter type: {!r}\".format(\n *         compose_filter))\n */\n  __pyx_t_1 = ((!(fst::script::GetComposeFilter(__pyx_v_compose_filter, (&__pyx_v_compose_filter_enum)) != 0)) != 0);\n  if (unlikely(__pyx_t_1)) {\n\n    /* \"pywrapfst.pyx\":242\n *   cdef fst.ComposeFilter compose_filter_enum\n *   if not fst.GetComposeFilter(compose_filter, addr(compose_filter_enum)):\n *     raise FstArgError(\"Unknown compose filter type: {!r}\".format(             # <<<<<<<<<<<<<<\n *         compose_filter))\n *   return compose_filter_enum\n */\n    __pyx_t_3 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstArgError); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 242, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_3);\n    __pyx_t_5 = __Pyx_PyObject_GetAttrStr(__pyx_kp_s_Unknown_compose_filter_type_r, __pyx_n_s_format); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 242, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_5);\n\n    /* \"pywrapfst.pyx\":243\n *   if not fst.GetComposeFilter(compose_filter, addr(compose_filter_enum)):\n *     raise FstArgError(\"Unknown compose filter type: {!r}\".format(\n *         compose_filter))             # <<<<<<<<<<<<<<\n *   return compose_filter_enum\n * \n */\n    __pyx_t_6 = __pyx_convert_PyBytes_string_to_py_std__in_string(__pyx_v_compose_filter); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 243, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_6);\n    __pyx_t_7 = NULL;\n    if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_5))) {\n      __pyx_t_7 = PyMethod_GET_SELF(__pyx_t_5);\n      if (likely(__pyx_t_7)) {\n        PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_5);\n        __Pyx_INCREF(__pyx_t_7);\n        __Pyx_INCREF(function);\n        __Pyx_DECREF_SET(__pyx_t_5, function);\n      }\n    }\n    if (!__pyx_t_7) {\n      __pyx_t_4 = __Pyx_PyObject_CallOneArg(__pyx_t_5, __pyx_t_6); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 242, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n      __Pyx_GOTREF(__pyx_t_4);\n    } else {\n      #if CYTHON_FAST_PYCALL\n      if (PyFunction_Check(__pyx_t_5)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_7, __pyx_t_6};\n        __pyx_t_4 = __Pyx_PyFunction_FastCall(__pyx_t_5, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 242, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_7); __pyx_t_7 = 0;\n        __Pyx_GOTREF(__pyx_t_4);\n        __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n      } else\n      #endif\n      #if CYTHON_FAST_PYCCALL\n      if (__Pyx_PyFastCFunction_Check(__pyx_t_5)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_7, __pyx_t_6};\n        __pyx_t_4 = __Pyx_PyCFunction_FastCall(__pyx_t_5, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 242, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_7); __pyx_t_7 = 0;\n        __Pyx_GOTREF(__pyx_t_4);\n        __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n      } else\n      #endif\n      {\n        __pyx_t_8 = PyTuple_New(1+1); if (unlikely(!__pyx_t_8)) __PYX_ERR(0, 242, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_8);\n        __Pyx_GIVEREF(__pyx_t_7); PyTuple_SET_ITEM(__pyx_t_8, 0, __pyx_t_7); __pyx_t_7 = NULL;\n        __Pyx_GIVEREF(__pyx_t_6);\n        PyTuple_SET_ITEM(__pyx_t_8, 0+1, __pyx_t_6);\n        __pyx_t_6 = 0;\n        __pyx_t_4 = __Pyx_PyObject_Call(__pyx_t_5, __pyx_t_8, NULL); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 242, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_4);\n        __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0;\n      }\n    }\n    __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n    __pyx_t_5 = NULL;\n    if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n      __pyx_t_5 = PyMethod_GET_SELF(__pyx_t_3);\n      if (likely(__pyx_t_5)) {\n        PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n        __Pyx_INCREF(__pyx_t_5);\n        __Pyx_INCREF(function);\n        __Pyx_DECREF_SET(__pyx_t_3, function);\n      }\n    }\n    if (!__pyx_t_5) {\n      __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 242, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      __Pyx_GOTREF(__pyx_t_2);\n    } else {\n      #if CYTHON_FAST_PYCALL\n      if (PyFunction_Check(__pyx_t_3)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_5, __pyx_t_4};\n        __pyx_t_2 = __Pyx_PyFunction_FastCall(__pyx_t_3, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 242, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;\n        __Pyx_GOTREF(__pyx_t_2);\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else\n      #endif\n      #if CYTHON_FAST_PYCCALL\n      if (__Pyx_PyFastCFunction_Check(__pyx_t_3)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_5, __pyx_t_4};\n        __pyx_t_2 = __Pyx_PyCFunction_FastCall(__pyx_t_3, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 242, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;\n        __Pyx_GOTREF(__pyx_t_2);\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else\n      #endif\n      {\n        __pyx_t_8 = PyTuple_New(1+1); if (unlikely(!__pyx_t_8)) __PYX_ERR(0, 242, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_8);\n        __Pyx_GIVEREF(__pyx_t_5); PyTuple_SET_ITEM(__pyx_t_8, 0, __pyx_t_5); __pyx_t_5 = NULL;\n        __Pyx_GIVEREF(__pyx_t_4);\n        PyTuple_SET_ITEM(__pyx_t_8, 0+1, __pyx_t_4);\n        __pyx_t_4 = 0;\n        __pyx_t_2 = __Pyx_PyObject_Call(__pyx_t_3, __pyx_t_8, NULL); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 242, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_2);\n        __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0;\n      }\n    }\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    __Pyx_Raise(__pyx_t_2, 0, 0, 0);\n    __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n    __PYX_ERR(0, 242, __pyx_L1_error)\n\n    /* \"pywrapfst.pyx\":241\n *   \"\"\"\n *   cdef fst.ComposeFilter compose_filter_enum\n *   if not fst.GetComposeFilter(compose_filter, addr(compose_filter_enum)):             # <<<<<<<<<<<<<<\n *     raise FstArgError(\"Unknown compose filter type: {!r}\".format(\n *         compose_filter))\n */\n  }\n\n  /* \"pywrapfst.pyx\":244\n *     raise FstArgError(\"Unknown compose filter type: {!r}\".format(\n *         compose_filter))\n *   return compose_filter_enum             # <<<<<<<<<<<<<<\n * \n * \n */\n  __pyx_r = __pyx_v_compose_filter_enum;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":220\n * \n * \n * cdef fst.ComposeFilter _get_compose_filter(             # <<<<<<<<<<<<<<\n *     const string &compose_filter) except *:\n *   \"\"\"Matches string with the appropriate ComposeFilter enum value.\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_XDECREF(__pyx_t_6);\n  __Pyx_XDECREF(__pyx_t_7);\n  __Pyx_XDECREF(__pyx_t_8);\n  __Pyx_AddTraceback(\"pywrapfst._get_compose_filter\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = (enum fst::ComposeFilter) 0;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":247\n * \n * \n * cdef fst.DeterminizeType _get_determinize_type(const string &det_type) except *:             # <<<<<<<<<<<<<<\n *   \"\"\"Matches string with the appropriate DeterminizeType enum value.\n * \n */\n\nstatic enum fst::DeterminizeType __pyx_f_9pywrapfst__get_determinize_type(std::string const &__pyx_v_det_type) {\n  enum fst::DeterminizeType __pyx_v_det_type_enum;\n  enum fst::DeterminizeType __pyx_r;\n  __Pyx_RefNannyDeclarations\n  int __pyx_t_1;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  PyObject *__pyx_t_6 = NULL;\n  PyObject *__pyx_t_7 = NULL;\n  PyObject *__pyx_t_8 = NULL;\n  __Pyx_RefNannySetupContext(\"_get_determinize_type\", 0);\n\n  /* \"pywrapfst.pyx\":263\n *   \"\"\"\n *   cdef fst.DeterminizeType det_type_enum\n *   if not fst.GetDeterminizeType(det_type, addr(det_type_enum)):             # <<<<<<<<<<<<<<\n *     raise FstArgError(\"Unknown determinization type: {!r}\".format(det_type))\n *   return det_type_enum\n */\n  __pyx_t_1 = ((!(fst::script::GetDeterminizeType(__pyx_v_det_type, (&__pyx_v_det_type_enum)) != 0)) != 0);\n  if (unlikely(__pyx_t_1)) {\n\n    /* \"pywrapfst.pyx\":264\n *   cdef fst.DeterminizeType det_type_enum\n *   if not fst.GetDeterminizeType(det_type, addr(det_type_enum)):\n *     raise FstArgError(\"Unknown determinization type: {!r}\".format(det_type))             # <<<<<<<<<<<<<<\n *   return det_type_enum\n * \n */\n    __pyx_t_3 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstArgError); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 264, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_3);\n    __pyx_t_5 = __Pyx_PyObject_GetAttrStr(__pyx_kp_s_Unknown_determinization_type_r, __pyx_n_s_format); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 264, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_5);\n    __pyx_t_6 = __pyx_convert_PyBytes_string_to_py_std__in_string(__pyx_v_det_type); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 264, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_6);\n    __pyx_t_7 = NULL;\n    if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_5))) {\n      __pyx_t_7 = PyMethod_GET_SELF(__pyx_t_5);\n      if (likely(__pyx_t_7)) {\n        PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_5);\n        __Pyx_INCREF(__pyx_t_7);\n        __Pyx_INCREF(function);\n        __Pyx_DECREF_SET(__pyx_t_5, function);\n      }\n    }\n    if (!__pyx_t_7) {\n      __pyx_t_4 = __Pyx_PyObject_CallOneArg(__pyx_t_5, __pyx_t_6); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 264, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n      __Pyx_GOTREF(__pyx_t_4);\n    } else {\n      #if CYTHON_FAST_PYCALL\n      if (PyFunction_Check(__pyx_t_5)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_7, __pyx_t_6};\n        __pyx_t_4 = __Pyx_PyFunction_FastCall(__pyx_t_5, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 264, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_7); __pyx_t_7 = 0;\n        __Pyx_GOTREF(__pyx_t_4);\n        __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n      } else\n      #endif\n      #if CYTHON_FAST_PYCCALL\n      if (__Pyx_PyFastCFunction_Check(__pyx_t_5)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_7, __pyx_t_6};\n        __pyx_t_4 = __Pyx_PyCFunction_FastCall(__pyx_t_5, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 264, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_7); __pyx_t_7 = 0;\n        __Pyx_GOTREF(__pyx_t_4);\n        __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n      } else\n      #endif\n      {\n        __pyx_t_8 = PyTuple_New(1+1); if (unlikely(!__pyx_t_8)) __PYX_ERR(0, 264, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_8);\n        __Pyx_GIVEREF(__pyx_t_7); PyTuple_SET_ITEM(__pyx_t_8, 0, __pyx_t_7); __pyx_t_7 = NULL;\n        __Pyx_GIVEREF(__pyx_t_6);\n        PyTuple_SET_ITEM(__pyx_t_8, 0+1, __pyx_t_6);\n        __pyx_t_6 = 0;\n        __pyx_t_4 = __Pyx_PyObject_Call(__pyx_t_5, __pyx_t_8, NULL); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 264, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_4);\n        __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0;\n      }\n    }\n    __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n    __pyx_t_5 = NULL;\n    if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n      __pyx_t_5 = PyMethod_GET_SELF(__pyx_t_3);\n      if (likely(__pyx_t_5)) {\n        PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n        __Pyx_INCREF(__pyx_t_5);\n        __Pyx_INCREF(function);\n        __Pyx_DECREF_SET(__pyx_t_3, function);\n      }\n    }\n    if (!__pyx_t_5) {\n      __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 264, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      __Pyx_GOTREF(__pyx_t_2);\n    } else {\n      #if CYTHON_FAST_PYCALL\n      if (PyFunction_Check(__pyx_t_3)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_5, __pyx_t_4};\n        __pyx_t_2 = __Pyx_PyFunction_FastCall(__pyx_t_3, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 264, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;\n        __Pyx_GOTREF(__pyx_t_2);\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else\n      #endif\n      #if CYTHON_FAST_PYCCALL\n      if (__Pyx_PyFastCFunction_Check(__pyx_t_3)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_5, __pyx_t_4};\n        __pyx_t_2 = __Pyx_PyCFunction_FastCall(__pyx_t_3, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 264, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;\n        __Pyx_GOTREF(__pyx_t_2);\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else\n      #endif\n      {\n        __pyx_t_8 = PyTuple_New(1+1); if (unlikely(!__pyx_t_8)) __PYX_ERR(0, 264, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_8);\n        __Pyx_GIVEREF(__pyx_t_5); PyTuple_SET_ITEM(__pyx_t_8, 0, __pyx_t_5); __pyx_t_5 = NULL;\n        __Pyx_GIVEREF(__pyx_t_4);\n        PyTuple_SET_ITEM(__pyx_t_8, 0+1, __pyx_t_4);\n        __pyx_t_4 = 0;\n        __pyx_t_2 = __Pyx_PyObject_Call(__pyx_t_3, __pyx_t_8, NULL); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 264, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_2);\n        __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0;\n      }\n    }\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    __Pyx_Raise(__pyx_t_2, 0, 0, 0);\n    __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n    __PYX_ERR(0, 264, __pyx_L1_error)\n\n    /* \"pywrapfst.pyx\":263\n *   \"\"\"\n *   cdef fst.DeterminizeType det_type_enum\n *   if not fst.GetDeterminizeType(det_type, addr(det_type_enum)):             # <<<<<<<<<<<<<<\n *     raise FstArgError(\"Unknown determinization type: {!r}\".format(det_type))\n *   return det_type_enum\n */\n  }\n\n  /* \"pywrapfst.pyx\":265\n *   if not fst.GetDeterminizeType(det_type, addr(det_type_enum)):\n *     raise FstArgError(\"Unknown determinization type: {!r}\".format(det_type))\n *   return det_type_enum             # <<<<<<<<<<<<<<\n * \n * \n */\n  __pyx_r = __pyx_v_det_type_enum;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":247\n * \n * \n * cdef fst.DeterminizeType _get_determinize_type(const string &det_type) except *:             # <<<<<<<<<<<<<<\n *   \"\"\"Matches string with the appropriate DeterminizeType enum value.\n * \n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_XDECREF(__pyx_t_6);\n  __Pyx_XDECREF(__pyx_t_7);\n  __Pyx_XDECREF(__pyx_t_8);\n  __Pyx_AddTraceback(\"pywrapfst._get_determinize_type\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = (enum fst::DeterminizeType) 0;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":268\n * \n * \n * cdef fst.QueueType _get_queue_type(const string &queue_type) except *:             # <<<<<<<<<<<<<<\n *   \"\"\"Matches string with the appropriate QueueType enum value.\n * \n */\n\nstatic enum fst::QueueType __pyx_f_9pywrapfst__get_queue_type(std::string const &__pyx_v_queue_type) {\n  enum fst::QueueType __pyx_v_queue_type_enum;\n  enum fst::QueueType __pyx_r;\n  __Pyx_RefNannyDeclarations\n  int __pyx_t_1;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  PyObject *__pyx_t_6 = NULL;\n  PyObject *__pyx_t_7 = NULL;\n  PyObject *__pyx_t_8 = NULL;\n  __Pyx_RefNannySetupContext(\"_get_queue_type\", 0);\n\n  /* \"pywrapfst.pyx\":287\n *   \"\"\"\n *   cdef fst.QueueType queue_type_enum\n *   if not fst.GetQueueType(queue_type, addr(queue_type_enum)):             # <<<<<<<<<<<<<<\n *     raise FstArgError(\"Unknown queue type: {!r}\".format(queue_type))\n *   return queue_type_enum\n */\n  __pyx_t_1 = ((!(fst::script::GetQueueType(__pyx_v_queue_type, (&__pyx_v_queue_type_enum)) != 0)) != 0);\n  if (unlikely(__pyx_t_1)) {\n\n    /* \"pywrapfst.pyx\":288\n *   cdef fst.QueueType queue_type_enum\n *   if not fst.GetQueueType(queue_type, addr(queue_type_enum)):\n *     raise FstArgError(\"Unknown queue type: {!r}\".format(queue_type))             # <<<<<<<<<<<<<<\n *   return queue_type_enum\n * \n */\n    __pyx_t_3 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstArgError); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 288, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_3);\n    __pyx_t_5 = __Pyx_PyObject_GetAttrStr(__pyx_kp_s_Unknown_queue_type_r, __pyx_n_s_format); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 288, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_5);\n    __pyx_t_6 = __pyx_convert_PyBytes_string_to_py_std__in_string(__pyx_v_queue_type); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 288, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_6);\n    __pyx_t_7 = NULL;\n    if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_5))) {\n      __pyx_t_7 = PyMethod_GET_SELF(__pyx_t_5);\n      if (likely(__pyx_t_7)) {\n        PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_5);\n        __Pyx_INCREF(__pyx_t_7);\n        __Pyx_INCREF(function);\n        __Pyx_DECREF_SET(__pyx_t_5, function);\n      }\n    }\n    if (!__pyx_t_7) {\n      __pyx_t_4 = __Pyx_PyObject_CallOneArg(__pyx_t_5, __pyx_t_6); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 288, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n      __Pyx_GOTREF(__pyx_t_4);\n    } else {\n      #if CYTHON_FAST_PYCALL\n      if (PyFunction_Check(__pyx_t_5)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_7, __pyx_t_6};\n        __pyx_t_4 = __Pyx_PyFunction_FastCall(__pyx_t_5, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 288, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_7); __pyx_t_7 = 0;\n        __Pyx_GOTREF(__pyx_t_4);\n        __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n      } else\n      #endif\n      #if CYTHON_FAST_PYCCALL\n      if (__Pyx_PyFastCFunction_Check(__pyx_t_5)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_7, __pyx_t_6};\n        __pyx_t_4 = __Pyx_PyCFunction_FastCall(__pyx_t_5, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 288, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_7); __pyx_t_7 = 0;\n        __Pyx_GOTREF(__pyx_t_4);\n        __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n      } else\n      #endif\n      {\n        __pyx_t_8 = PyTuple_New(1+1); if (unlikely(!__pyx_t_8)) __PYX_ERR(0, 288, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_8);\n        __Pyx_GIVEREF(__pyx_t_7); PyTuple_SET_ITEM(__pyx_t_8, 0, __pyx_t_7); __pyx_t_7 = NULL;\n        __Pyx_GIVEREF(__pyx_t_6);\n        PyTuple_SET_ITEM(__pyx_t_8, 0+1, __pyx_t_6);\n        __pyx_t_6 = 0;\n        __pyx_t_4 = __Pyx_PyObject_Call(__pyx_t_5, __pyx_t_8, NULL); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 288, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_4);\n        __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0;\n      }\n    }\n    __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n    __pyx_t_5 = NULL;\n    if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n      __pyx_t_5 = PyMethod_GET_SELF(__pyx_t_3);\n      if (likely(__pyx_t_5)) {\n        PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n        __Pyx_INCREF(__pyx_t_5);\n        __Pyx_INCREF(function);\n        __Pyx_DECREF_SET(__pyx_t_3, function);\n      }\n    }\n    if (!__pyx_t_5) {\n      __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 288, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      __Pyx_GOTREF(__pyx_t_2);\n    } else {\n      #if CYTHON_FAST_PYCALL\n      if (PyFunction_Check(__pyx_t_3)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_5, __pyx_t_4};\n        __pyx_t_2 = __Pyx_PyFunction_FastCall(__pyx_t_3, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 288, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;\n        __Pyx_GOTREF(__pyx_t_2);\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else\n      #endif\n      #if CYTHON_FAST_PYCCALL\n      if (__Pyx_PyFastCFunction_Check(__pyx_t_3)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_5, __pyx_t_4};\n        __pyx_t_2 = __Pyx_PyCFunction_FastCall(__pyx_t_3, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 288, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;\n        __Pyx_GOTREF(__pyx_t_2);\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else\n      #endif\n      {\n        __pyx_t_8 = PyTuple_New(1+1); if (unlikely(!__pyx_t_8)) __PYX_ERR(0, 288, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_8);\n        __Pyx_GIVEREF(__pyx_t_5); PyTuple_SET_ITEM(__pyx_t_8, 0, __pyx_t_5); __pyx_t_5 = NULL;\n        __Pyx_GIVEREF(__pyx_t_4);\n        PyTuple_SET_ITEM(__pyx_t_8, 0+1, __pyx_t_4);\n        __pyx_t_4 = 0;\n        __pyx_t_2 = __Pyx_PyObject_Call(__pyx_t_3, __pyx_t_8, NULL); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 288, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_2);\n        __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0;\n      }\n    }\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    __Pyx_Raise(__pyx_t_2, 0, 0, 0);\n    __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n    __PYX_ERR(0, 288, __pyx_L1_error)\n\n    /* \"pywrapfst.pyx\":287\n *   \"\"\"\n *   cdef fst.QueueType queue_type_enum\n *   if not fst.GetQueueType(queue_type, addr(queue_type_enum)):             # <<<<<<<<<<<<<<\n *     raise FstArgError(\"Unknown queue type: {!r}\".format(queue_type))\n *   return queue_type_enum\n */\n  }\n\n  /* \"pywrapfst.pyx\":289\n *   if not fst.GetQueueType(queue_type, addr(queue_type_enum)):\n *     raise FstArgError(\"Unknown queue type: {!r}\".format(queue_type))\n *   return queue_type_enum             # <<<<<<<<<<<<<<\n * \n * \n */\n  __pyx_r = __pyx_v_queue_type_enum;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":268\n * \n * \n * cdef fst.QueueType _get_queue_type(const string &queue_type) except *:             # <<<<<<<<<<<<<<\n *   \"\"\"Matches string with the appropriate QueueType enum value.\n * \n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_XDECREF(__pyx_t_6);\n  __Pyx_XDECREF(__pyx_t_7);\n  __Pyx_XDECREF(__pyx_t_8);\n  __Pyx_AddTraceback(\"pywrapfst._get_queue_type\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = (enum fst::QueueType) 0;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":292\n * \n * \n * cdef fst.RandArcSelection _get_rand_arc_selection(             # <<<<<<<<<<<<<<\n *     const string &select) except *:\n *   \"\"\"Matches string with the appropriate RandArcSelection enum value.\n */\n\nstatic enum fst::script::RandArcSelection __pyx_f_9pywrapfst__get_rand_arc_selection(std::string const &__pyx_v_select) {\n  enum fst::script::RandArcSelection __pyx_v_select_enum;\n  enum fst::script::RandArcSelection __pyx_r;\n  __Pyx_RefNannyDeclarations\n  int __pyx_t_1;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  PyObject *__pyx_t_6 = NULL;\n  PyObject *__pyx_t_7 = NULL;\n  PyObject *__pyx_t_8 = NULL;\n  __Pyx_RefNannySetupContext(\"_get_rand_arc_selection\", 0);\n\n  /* \"pywrapfst.pyx\":312\n *   \"\"\"\n *   cdef fst.RandArcSelection select_enum\n *   if not fst.GetRandArcSelection(select, addr(select_enum)):             # <<<<<<<<<<<<<<\n *     raise FstArgError(\"Unknown random arc selection type: {!r}\".format(select))\n *   return select_enum\n */\n  __pyx_t_1 = ((!(fst::script::GetRandArcSelection(__pyx_v_select, (&__pyx_v_select_enum)) != 0)) != 0);\n  if (unlikely(__pyx_t_1)) {\n\n    /* \"pywrapfst.pyx\":313\n *   cdef fst.RandArcSelection select_enum\n *   if not fst.GetRandArcSelection(select, addr(select_enum)):\n *     raise FstArgError(\"Unknown random arc selection type: {!r}\".format(select))             # <<<<<<<<<<<<<<\n *   return select_enum\n * \n */\n    __pyx_t_3 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstArgError); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 313, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_3);\n    __pyx_t_5 = __Pyx_PyObject_GetAttrStr(__pyx_kp_s_Unknown_random_arc_selection_typ, __pyx_n_s_format); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 313, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_5);\n    __pyx_t_6 = __pyx_convert_PyBytes_string_to_py_std__in_string(__pyx_v_select); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 313, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_6);\n    __pyx_t_7 = NULL;\n    if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_5))) {\n      __pyx_t_7 = PyMethod_GET_SELF(__pyx_t_5);\n      if (likely(__pyx_t_7)) {\n        PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_5);\n        __Pyx_INCREF(__pyx_t_7);\n        __Pyx_INCREF(function);\n        __Pyx_DECREF_SET(__pyx_t_5, function);\n      }\n    }\n    if (!__pyx_t_7) {\n      __pyx_t_4 = __Pyx_PyObject_CallOneArg(__pyx_t_5, __pyx_t_6); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 313, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n      __Pyx_GOTREF(__pyx_t_4);\n    } else {\n      #if CYTHON_FAST_PYCALL\n      if (PyFunction_Check(__pyx_t_5)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_7, __pyx_t_6};\n        __pyx_t_4 = __Pyx_PyFunction_FastCall(__pyx_t_5, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 313, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_7); __pyx_t_7 = 0;\n        __Pyx_GOTREF(__pyx_t_4);\n        __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n      } else\n      #endif\n      #if CYTHON_FAST_PYCCALL\n      if (__Pyx_PyFastCFunction_Check(__pyx_t_5)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_7, __pyx_t_6};\n        __pyx_t_4 = __Pyx_PyCFunction_FastCall(__pyx_t_5, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 313, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_7); __pyx_t_7 = 0;\n        __Pyx_GOTREF(__pyx_t_4);\n        __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n      } else\n      #endif\n      {\n        __pyx_t_8 = PyTuple_New(1+1); if (unlikely(!__pyx_t_8)) __PYX_ERR(0, 313, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_8);\n        __Pyx_GIVEREF(__pyx_t_7); PyTuple_SET_ITEM(__pyx_t_8, 0, __pyx_t_7); __pyx_t_7 = NULL;\n        __Pyx_GIVEREF(__pyx_t_6);\n        PyTuple_SET_ITEM(__pyx_t_8, 0+1, __pyx_t_6);\n        __pyx_t_6 = 0;\n        __pyx_t_4 = __Pyx_PyObject_Call(__pyx_t_5, __pyx_t_8, NULL); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 313, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_4);\n        __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0;\n      }\n    }\n    __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n    __pyx_t_5 = NULL;\n    if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n      __pyx_t_5 = PyMethod_GET_SELF(__pyx_t_3);\n      if (likely(__pyx_t_5)) {\n        PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n        __Pyx_INCREF(__pyx_t_5);\n        __Pyx_INCREF(function);\n        __Pyx_DECREF_SET(__pyx_t_3, function);\n      }\n    }\n    if (!__pyx_t_5) {\n      __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 313, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      __Pyx_GOTREF(__pyx_t_2);\n    } else {\n      #if CYTHON_FAST_PYCALL\n      if (PyFunction_Check(__pyx_t_3)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_5, __pyx_t_4};\n        __pyx_t_2 = __Pyx_PyFunction_FastCall(__pyx_t_3, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 313, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;\n        __Pyx_GOTREF(__pyx_t_2);\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else\n      #endif\n      #if CYTHON_FAST_PYCCALL\n      if (__Pyx_PyFastCFunction_Check(__pyx_t_3)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_5, __pyx_t_4};\n        __pyx_t_2 = __Pyx_PyCFunction_FastCall(__pyx_t_3, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 313, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;\n        __Pyx_GOTREF(__pyx_t_2);\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else\n      #endif\n      {\n        __pyx_t_8 = PyTuple_New(1+1); if (unlikely(!__pyx_t_8)) __PYX_ERR(0, 313, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_8);\n        __Pyx_GIVEREF(__pyx_t_5); PyTuple_SET_ITEM(__pyx_t_8, 0, __pyx_t_5); __pyx_t_5 = NULL;\n        __Pyx_GIVEREF(__pyx_t_4);\n        PyTuple_SET_ITEM(__pyx_t_8, 0+1, __pyx_t_4);\n        __pyx_t_4 = 0;\n        __pyx_t_2 = __Pyx_PyObject_Call(__pyx_t_3, __pyx_t_8, NULL); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 313, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_2);\n        __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0;\n      }\n    }\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    __Pyx_Raise(__pyx_t_2, 0, 0, 0);\n    __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n    __PYX_ERR(0, 313, __pyx_L1_error)\n\n    /* \"pywrapfst.pyx\":312\n *   \"\"\"\n *   cdef fst.RandArcSelection select_enum\n *   if not fst.GetRandArcSelection(select, addr(select_enum)):             # <<<<<<<<<<<<<<\n *     raise FstArgError(\"Unknown random arc selection type: {!r}\".format(select))\n *   return select_enum\n */\n  }\n\n  /* \"pywrapfst.pyx\":314\n *   if not fst.GetRandArcSelection(select, addr(select_enum)):\n *     raise FstArgError(\"Unknown random arc selection type: {!r}\".format(select))\n *   return select_enum             # <<<<<<<<<<<<<<\n * \n * \n */\n  __pyx_r = __pyx_v_select_enum;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":292\n * \n * \n * cdef fst.RandArcSelection _get_rand_arc_selection(             # <<<<<<<<<<<<<<\n *     const string &select) except *:\n *   \"\"\"Matches string with the appropriate RandArcSelection enum value.\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_XDECREF(__pyx_t_6);\n  __Pyx_XDECREF(__pyx_t_7);\n  __Pyx_XDECREF(__pyx_t_8);\n  __Pyx_AddTraceback(\"pywrapfst._get_rand_arc_selection\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = (enum fst::script::RandArcSelection) 0;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":317\n * \n * \n * cdef fst.ReplaceLabelType _get_replace_label_type(             # <<<<<<<<<<<<<<\n *     const string &replace_label_type, bool epsilon_on_replace) except *:\n *   \"\"\"Matches string with the appropriate ReplaceLabelType enum value.\n */\n\nstatic enum fst::ReplaceLabelType __pyx_f_9pywrapfst__get_replace_label_type(std::string const &__pyx_v_replace_label_type, bool __pyx_v_epsilon_on_replace) {\n  enum fst::ReplaceLabelType __pyx_v_replace_label_type_enum;\n  enum fst::ReplaceLabelType __pyx_r;\n  __Pyx_RefNannyDeclarations\n  int __pyx_t_1;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  PyObject *__pyx_t_6 = NULL;\n  PyObject *__pyx_t_7 = NULL;\n  PyObject *__pyx_t_8 = NULL;\n  __Pyx_RefNannySetupContext(\"_get_replace_label_type\", 0);\n\n  /* \"pywrapfst.pyx\":338\n *   \"\"\"\n *   cdef fst.ReplaceLabelType replace_label_type_enum\n *   if not fst.GetReplaceLabelType(replace_label_type, epsilon_on_replace,             # <<<<<<<<<<<<<<\n *                                  addr(replace_label_type_enum)):\n *     raise FstArgError(\"Unknown replace label type: {!r}\".format(\n */\n  __pyx_t_1 = ((!(fst::script::GetReplaceLabelType(__pyx_v_replace_label_type, __pyx_v_epsilon_on_replace, (&__pyx_v_replace_label_type_enum)) != 0)) != 0);\n  if (unlikely(__pyx_t_1)) {\n\n    /* \"pywrapfst.pyx\":340\n *   if not fst.GetReplaceLabelType(replace_label_type, epsilon_on_replace,\n *                                  addr(replace_label_type_enum)):\n *     raise FstArgError(\"Unknown replace label type: {!r}\".format(             # <<<<<<<<<<<<<<\n *                       replace_label_type))\n *   return replace_label_type_enum\n */\n    __pyx_t_3 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstArgError); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 340, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_3);\n    __pyx_t_5 = __Pyx_PyObject_GetAttrStr(__pyx_kp_s_Unknown_replace_label_type_r, __pyx_n_s_format); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 340, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_5);\n\n    /* \"pywrapfst.pyx\":341\n *                                  addr(replace_label_type_enum)):\n *     raise FstArgError(\"Unknown replace label type: {!r}\".format(\n *                       replace_label_type))             # <<<<<<<<<<<<<<\n *   return replace_label_type_enum\n * \n */\n    __pyx_t_6 = __pyx_convert_PyBytes_string_to_py_std__in_string(__pyx_v_replace_label_type); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 341, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_6);\n    __pyx_t_7 = NULL;\n    if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_5))) {\n      __pyx_t_7 = PyMethod_GET_SELF(__pyx_t_5);\n      if (likely(__pyx_t_7)) {\n        PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_5);\n        __Pyx_INCREF(__pyx_t_7);\n        __Pyx_INCREF(function);\n        __Pyx_DECREF_SET(__pyx_t_5, function);\n      }\n    }\n    if (!__pyx_t_7) {\n      __pyx_t_4 = __Pyx_PyObject_CallOneArg(__pyx_t_5, __pyx_t_6); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 340, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n      __Pyx_GOTREF(__pyx_t_4);\n    } else {\n      #if CYTHON_FAST_PYCALL\n      if (PyFunction_Check(__pyx_t_5)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_7, __pyx_t_6};\n        __pyx_t_4 = __Pyx_PyFunction_FastCall(__pyx_t_5, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 340, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_7); __pyx_t_7 = 0;\n        __Pyx_GOTREF(__pyx_t_4);\n        __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n      } else\n      #endif\n      #if CYTHON_FAST_PYCCALL\n      if (__Pyx_PyFastCFunction_Check(__pyx_t_5)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_7, __pyx_t_6};\n        __pyx_t_4 = __Pyx_PyCFunction_FastCall(__pyx_t_5, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 340, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_7); __pyx_t_7 = 0;\n        __Pyx_GOTREF(__pyx_t_4);\n        __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n      } else\n      #endif\n      {\n        __pyx_t_8 = PyTuple_New(1+1); if (unlikely(!__pyx_t_8)) __PYX_ERR(0, 340, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_8);\n        __Pyx_GIVEREF(__pyx_t_7); PyTuple_SET_ITEM(__pyx_t_8, 0, __pyx_t_7); __pyx_t_7 = NULL;\n        __Pyx_GIVEREF(__pyx_t_6);\n        PyTuple_SET_ITEM(__pyx_t_8, 0+1, __pyx_t_6);\n        __pyx_t_6 = 0;\n        __pyx_t_4 = __Pyx_PyObject_Call(__pyx_t_5, __pyx_t_8, NULL); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 340, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_4);\n        __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0;\n      }\n    }\n    __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n    __pyx_t_5 = NULL;\n    if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n      __pyx_t_5 = PyMethod_GET_SELF(__pyx_t_3);\n      if (likely(__pyx_t_5)) {\n        PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n        __Pyx_INCREF(__pyx_t_5);\n        __Pyx_INCREF(function);\n        __Pyx_DECREF_SET(__pyx_t_3, function);\n      }\n    }\n    if (!__pyx_t_5) {\n      __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 340, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      __Pyx_GOTREF(__pyx_t_2);\n    } else {\n      #if CYTHON_FAST_PYCALL\n      if (PyFunction_Check(__pyx_t_3)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_5, __pyx_t_4};\n        __pyx_t_2 = __Pyx_PyFunction_FastCall(__pyx_t_3, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 340, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;\n        __Pyx_GOTREF(__pyx_t_2);\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else\n      #endif\n      #if CYTHON_FAST_PYCCALL\n      if (__Pyx_PyFastCFunction_Check(__pyx_t_3)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_5, __pyx_t_4};\n        __pyx_t_2 = __Pyx_PyCFunction_FastCall(__pyx_t_3, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 340, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;\n        __Pyx_GOTREF(__pyx_t_2);\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else\n      #endif\n      {\n        __pyx_t_8 = PyTuple_New(1+1); if (unlikely(!__pyx_t_8)) __PYX_ERR(0, 340, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_8);\n        __Pyx_GIVEREF(__pyx_t_5); PyTuple_SET_ITEM(__pyx_t_8, 0, __pyx_t_5); __pyx_t_5 = NULL;\n        __Pyx_GIVEREF(__pyx_t_4);\n        PyTuple_SET_ITEM(__pyx_t_8, 0+1, __pyx_t_4);\n        __pyx_t_4 = 0;\n        __pyx_t_2 = __Pyx_PyObject_Call(__pyx_t_3, __pyx_t_8, NULL); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 340, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_2);\n        __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0;\n      }\n    }\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    __Pyx_Raise(__pyx_t_2, 0, 0, 0);\n    __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n    __PYX_ERR(0, 340, __pyx_L1_error)\n\n    /* \"pywrapfst.pyx\":338\n *   \"\"\"\n *   cdef fst.ReplaceLabelType replace_label_type_enum\n *   if not fst.GetReplaceLabelType(replace_label_type, epsilon_on_replace,             # <<<<<<<<<<<<<<\n *                                  addr(replace_label_type_enum)):\n *     raise FstArgError(\"Unknown replace label type: {!r}\".format(\n */\n  }\n\n  /* \"pywrapfst.pyx\":342\n *     raise FstArgError(\"Unknown replace label type: {!r}\".format(\n *                       replace_label_type))\n *   return replace_label_type_enum             # <<<<<<<<<<<<<<\n * \n * \n */\n  __pyx_r = __pyx_v_replace_label_type_enum;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":317\n * \n * \n * cdef fst.ReplaceLabelType _get_replace_label_type(             # <<<<<<<<<<<<<<\n *     const string &replace_label_type, bool epsilon_on_replace) except *:\n *   \"\"\"Matches string with the appropriate ReplaceLabelType enum value.\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_XDECREF(__pyx_t_6);\n  __Pyx_XDECREF(__pyx_t_7);\n  __Pyx_XDECREF(__pyx_t_8);\n  __Pyx_AddTraceback(\"pywrapfst._get_replace_label_type\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = (enum fst::ReplaceLabelType) 0;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":368\n *   \"\"\"\n * \n *   def __repr__(self):             # <<<<<<<<<<<<<<\n *     return \"<{} Weight {} at 0x{:x}>\".format(self.type(), self.to_string(),\n *                                              id(self))\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_6Weight_1__repr__(PyObject *__pyx_v_self); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_6Weight_1__repr__(PyObject *__pyx_v_self) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__repr__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_6Weight___repr__(((struct __pyx_obj_9pywrapfst_Weight *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_6Weight___repr__(struct __pyx_obj_9pywrapfst_Weight *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  PyObject *__pyx_t_6 = NULL;\n  int __pyx_t_7;\n  PyObject *__pyx_t_8 = NULL;\n  __Pyx_RefNannySetupContext(\"__repr__\", 0);\n\n  /* \"pywrapfst.pyx\":369\n * \n *   def __repr__(self):\n *     return \"<{} Weight {} at 0x{:x}>\".format(self.type(), self.to_string(),             # <<<<<<<<<<<<<<\n *                                              id(self))\n * \n */\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_2 = __Pyx_PyObject_GetAttrStr(__pyx_kp_s_Weight_at_0x_x, __pyx_n_s_format); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 369, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"type\");\n    __PYX_ERR(0, 369, __pyx_L1_error)\n  }\n  __pyx_t_3 = __pyx_convert_PyBytes_string_to_py_std__in_string(((struct __pyx_vtabstruct_9pywrapfst_Weight *)__pyx_v_self->__pyx_vtab)->type(__pyx_v_self, 0)); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 369, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_3);\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"to_string\");\n    __PYX_ERR(0, 369, __pyx_L1_error)\n  }\n  __pyx_t_4 = __pyx_convert_PyBytes_string_to_py_std__in_string(((struct __pyx_vtabstruct_9pywrapfst_Weight *)__pyx_v_self->__pyx_vtab)->to_string(__pyx_v_self, 0)); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 369, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_4);\n\n  /* \"pywrapfst.pyx\":370\n *   def __repr__(self):\n *     return \"<{} Weight {} at 0x{:x}>\".format(self.type(), self.to_string(),\n *                                              id(self))             # <<<<<<<<<<<<<<\n * \n *   def __str__(self):\n */\n  __pyx_t_5 = __Pyx_PyObject_CallOneArg(__pyx_builtin_id, ((PyObject *)__pyx_v_self)); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 370, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_5);\n  __pyx_t_6 = NULL;\n  __pyx_t_7 = 0;\n  if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_2))) {\n    __pyx_t_6 = PyMethod_GET_SELF(__pyx_t_2);\n    if (likely(__pyx_t_6)) {\n      PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_2);\n      __Pyx_INCREF(__pyx_t_6);\n      __Pyx_INCREF(function);\n      __Pyx_DECREF_SET(__pyx_t_2, function);\n      __pyx_t_7 = 1;\n    }\n  }\n  #if CYTHON_FAST_PYCALL\n  if (PyFunction_Check(__pyx_t_2)) {\n    PyObject *__pyx_temp[4] = {__pyx_t_6, __pyx_t_3, __pyx_t_4, __pyx_t_5};\n    __pyx_t_1 = __Pyx_PyFunction_FastCall(__pyx_t_2, __pyx_temp+1-__pyx_t_7, 3+__pyx_t_7); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 369, __pyx_L1_error)\n    __Pyx_XDECREF(__pyx_t_6); __pyx_t_6 = 0;\n    __Pyx_GOTREF(__pyx_t_1);\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n    __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n  } else\n  #endif\n  #if CYTHON_FAST_PYCCALL\n  if (__Pyx_PyFastCFunction_Check(__pyx_t_2)) {\n    PyObject *__pyx_temp[4] = {__pyx_t_6, __pyx_t_3, __pyx_t_4, __pyx_t_5};\n    __pyx_t_1 = __Pyx_PyCFunction_FastCall(__pyx_t_2, __pyx_temp+1-__pyx_t_7, 3+__pyx_t_7); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 369, __pyx_L1_error)\n    __Pyx_XDECREF(__pyx_t_6); __pyx_t_6 = 0;\n    __Pyx_GOTREF(__pyx_t_1);\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n    __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n  } else\n  #endif\n  {\n    __pyx_t_8 = PyTuple_New(3+__pyx_t_7); if (unlikely(!__pyx_t_8)) __PYX_ERR(0, 369, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_8);\n    if (__pyx_t_6) {\n      __Pyx_GIVEREF(__pyx_t_6); PyTuple_SET_ITEM(__pyx_t_8, 0, __pyx_t_6); __pyx_t_6 = NULL;\n    }\n    __Pyx_GIVEREF(__pyx_t_3);\n    PyTuple_SET_ITEM(__pyx_t_8, 0+__pyx_t_7, __pyx_t_3);\n    __Pyx_GIVEREF(__pyx_t_4);\n    PyTuple_SET_ITEM(__pyx_t_8, 1+__pyx_t_7, __pyx_t_4);\n    __Pyx_GIVEREF(__pyx_t_5);\n    PyTuple_SET_ITEM(__pyx_t_8, 2+__pyx_t_7, __pyx_t_5);\n    __pyx_t_3 = 0;\n    __pyx_t_4 = 0;\n    __pyx_t_5 = 0;\n    __pyx_t_1 = __Pyx_PyObject_Call(__pyx_t_2, __pyx_t_8, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 369, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0;\n  }\n  __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":368\n *   \"\"\"\n * \n *   def __repr__(self):             # <<<<<<<<<<<<<<\n *     return \"<{} Weight {} at 0x{:x}>\".format(self.type(), self.to_string(),\n *                                              id(self))\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_XDECREF(__pyx_t_6);\n  __Pyx_XDECREF(__pyx_t_8);\n  __Pyx_AddTraceback(\"pywrapfst.Weight.__repr__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":372\n *                                              id(self))\n * \n *   def __str__(self):             # <<<<<<<<<<<<<<\n *     return self.to_string()\n * \n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_6Weight_3__str__(PyObject *__pyx_v_self); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_6Weight_3__str__(PyObject *__pyx_v_self) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__str__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_6Weight_2__str__(((struct __pyx_obj_9pywrapfst_Weight *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_6Weight_2__str__(struct __pyx_obj_9pywrapfst_Weight *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"__str__\", 0);\n\n  /* \"pywrapfst.pyx\":373\n * \n *   def __str__(self):\n *     return self.to_string()             # <<<<<<<<<<<<<<\n * \n *   # This attempts to convert the string form into a float, raising\n */\n  __Pyx_XDECREF(__pyx_r);\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"to_string\");\n    __PYX_ERR(0, 373, __pyx_L1_error)\n  }\n  __pyx_t_1 = __pyx_convert_PyBytes_string_to_py_std__in_string(((struct __pyx_vtabstruct_9pywrapfst_Weight *)__pyx_v_self->__pyx_vtab)->to_string(__pyx_v_self, 0)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 373, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":372\n *                                              id(self))\n * \n *   def __str__(self):             # <<<<<<<<<<<<<<\n *     return self.to_string()\n * \n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.Weight.__str__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":378\n *   # ValueError when that is not appropriate.\n * \n *   def __float__(self):             # <<<<<<<<<<<<<<\n *     return float(self.to_string())\n * \n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_6Weight_5__float__(PyObject *__pyx_v_self); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_6Weight_5__float__(PyObject *__pyx_v_self) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__float__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_6Weight_4__float__(((struct __pyx_obj_9pywrapfst_Weight *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_6Weight_4__float__(struct __pyx_obj_9pywrapfst_Weight *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  __Pyx_RefNannySetupContext(\"__float__\", 0);\n\n  /* \"pywrapfst.pyx\":379\n * \n *   def __float__(self):\n *     return float(self.to_string())             # <<<<<<<<<<<<<<\n * \n *   def __init__(self, weight_type, weight):\n */\n  __Pyx_XDECREF(__pyx_r);\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"to_string\");\n    __PYX_ERR(0, 379, __pyx_L1_error)\n  }\n  __pyx_t_1 = __pyx_convert_PyBytes_string_to_py_std__in_string(((struct __pyx_vtabstruct_9pywrapfst_Weight *)__pyx_v_self->__pyx_vtab)->to_string(__pyx_v_self, 0)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 379, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_t_2 = __Pyx_PyNumber_Float(__pyx_t_1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 379, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  __pyx_r = __pyx_t_2;\n  __pyx_t_2 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":378\n *   # ValueError when that is not appropriate.\n * \n *   def __float__(self):             # <<<<<<<<<<<<<<\n *     return float(self.to_string())\n * \n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_AddTraceback(\"pywrapfst.Weight.__float__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":381\n *     return float(self.to_string())\n * \n *   def __init__(self, weight_type, weight):             # <<<<<<<<<<<<<<\n *     self._weight.reset(new fst.WeightClass(tostring(weight_type),\n *                                            weight_tostring(weight)))\n */\n\n/* Python wrapper */\nstatic int __pyx_pw_9pywrapfst_6Weight_7__init__(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic int __pyx_pw_9pywrapfst_6Weight_7__init__(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  PyObject *__pyx_v_weight_type = 0;\n  PyObject *__pyx_v_weight = 0;\n  int __pyx_r;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__init__ (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_weight_type,&__pyx_n_s_weight,0};\n    PyObject* values[2] = {0,0};\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (likely((values[0] = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_weight_type)) != 0)) kw_args--;\n        else goto __pyx_L5_argtuple_error;\n        CYTHON_FALLTHROUGH;\n        case  1:\n        if (likely((values[1] = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_weight)) != 0)) kw_args--;\n        else {\n          __Pyx_RaiseArgtupleInvalid(\"__init__\", 1, 2, 2, 1); __PYX_ERR(0, 381, __pyx_L3_error)\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"__init__\") < 0)) __PYX_ERR(0, 381, __pyx_L3_error)\n      }\n    } else if (PyTuple_GET_SIZE(__pyx_args) != 2) {\n      goto __pyx_L5_argtuple_error;\n    } else {\n      values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n      values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n    }\n    __pyx_v_weight_type = values[0];\n    __pyx_v_weight = values[1];\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"__init__\", 1, 2, 2, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 381, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst.Weight.__init__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return -1;\n  __pyx_L4_argument_unpacking_done:;\n  __pyx_r = __pyx_pf_9pywrapfst_6Weight_6__init__(((struct __pyx_obj_9pywrapfst_Weight *)__pyx_v_self), __pyx_v_weight_type, __pyx_v_weight);\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic int __pyx_pf_9pywrapfst_6Weight_6__init__(struct __pyx_obj_9pywrapfst_Weight *__pyx_v_self, PyObject *__pyx_v_weight_type, PyObject *__pyx_v_weight) {\n  int __pyx_r;\n  __Pyx_RefNannyDeclarations\n  std::string __pyx_t_1;\n  std::string __pyx_t_2;\n  __Pyx_RefNannySetupContext(\"__init__\", 0);\n\n  /* \"pywrapfst.pyx\":382\n * \n *   def __init__(self, weight_type, weight):\n *     self._weight.reset(new fst.WeightClass(tostring(weight_type),             # <<<<<<<<<<<<<<\n *                                            weight_tostring(weight)))\n *     self._check_weight()\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_weight\");\n    __PYX_ERR(0, 382, __pyx_L1_error)\n  }\n  __pyx_t_1 = __pyx_f_9pywrapfst_tostring(__pyx_v_weight_type, NULL); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 382, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":383\n *   def __init__(self, weight_type, weight):\n *     self._weight.reset(new fst.WeightClass(tostring(weight_type),\n *                                            weight_tostring(weight)))             # <<<<<<<<<<<<<<\n *     self._check_weight()\n * \n */\n  __pyx_t_2 = __pyx_f_9pywrapfst_weight_tostring(__pyx_v_weight, NULL); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 383, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":382\n * \n *   def __init__(self, weight_type, weight):\n *     self._weight.reset(new fst.WeightClass(tostring(weight_type),             # <<<<<<<<<<<<<<\n *                                            weight_tostring(weight)))\n *     self._check_weight()\n */\n  __pyx_v_self->_weight.reset(new fst::script::WeightClass(__pyx_t_1, __pyx_t_2));\n\n  /* \"pywrapfst.pyx\":384\n *     self._weight.reset(new fst.WeightClass(tostring(weight_type),\n *                                            weight_tostring(weight)))\n *     self._check_weight()             # <<<<<<<<<<<<<<\n * \n *   cdef void _check_weight(self) except *:\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_check_weight\");\n    __PYX_ERR(0, 384, __pyx_L1_error)\n  }\n  ((struct __pyx_vtabstruct_9pywrapfst_Weight *)__pyx_v_self->__pyx_vtab)->_check_weight(__pyx_v_self); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 384, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":381\n *     return float(self.to_string())\n * \n *   def __init__(self, weight_type, weight):             # <<<<<<<<<<<<<<\n *     self._weight.reset(new fst.WeightClass(tostring(weight_type),\n *                                            weight_tostring(weight)))\n */\n\n  /* function exit code */\n  __pyx_r = 0;\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"pywrapfst.Weight.__init__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = -1;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":386\n *     self._check_weight()\n * \n *   cdef void _check_weight(self) except *:             # <<<<<<<<<<<<<<\n *     if self.type() == b\"none\":\n *       raise FstArgError(\"Weight type not found\")\n */\n\nstatic void __pyx_f_9pywrapfst_6Weight__check_weight(struct __pyx_obj_9pywrapfst_Weight *__pyx_v_self) {\n  __Pyx_RefNannyDeclarations\n  int __pyx_t_1;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  __Pyx_RefNannySetupContext(\"_check_weight\", 0);\n\n  /* \"pywrapfst.pyx\":387\n * \n *   cdef void _check_weight(self) except *:\n *     if self.type() == b\"none\":             # <<<<<<<<<<<<<<\n *       raise FstArgError(\"Weight type not found\")\n *     if self.to_string() == b\"BadNumber\":\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"type\");\n    __PYX_ERR(0, 387, __pyx_L1_error)\n  }\n  __pyx_t_1 = ((((struct __pyx_vtabstruct_9pywrapfst_Weight *)__pyx_v_self->__pyx_vtab)->type(__pyx_v_self, 0) == ((char const *)\"none\")) != 0);\n  if (unlikely(__pyx_t_1)) {\n\n    /* \"pywrapfst.pyx\":388\n *   cdef void _check_weight(self) except *:\n *     if self.type() == b\"none\":\n *       raise FstArgError(\"Weight type not found\")             # <<<<<<<<<<<<<<\n *     if self.to_string() == b\"BadNumber\":\n *       raise FstBadWeightError(\"Invalid weight\")\n */\n    __pyx_t_2 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstArgError); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 388, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_2);\n    __pyx_t_3 = __Pyx_PyObject_Call(__pyx_t_2, __pyx_tuple_, NULL); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 388, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_3);\n    __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n    __Pyx_Raise(__pyx_t_3, 0, 0, 0);\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    __PYX_ERR(0, 388, __pyx_L1_error)\n\n    /* \"pywrapfst.pyx\":387\n * \n *   cdef void _check_weight(self) except *:\n *     if self.type() == b\"none\":             # <<<<<<<<<<<<<<\n *       raise FstArgError(\"Weight type not found\")\n *     if self.to_string() == b\"BadNumber\":\n */\n  }\n\n  /* \"pywrapfst.pyx\":389\n *     if self.type() == b\"none\":\n *       raise FstArgError(\"Weight type not found\")\n *     if self.to_string() == b\"BadNumber\":             # <<<<<<<<<<<<<<\n *       raise FstBadWeightError(\"Invalid weight\")\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"to_string\");\n    __PYX_ERR(0, 389, __pyx_L1_error)\n  }\n  __pyx_t_1 = ((((struct __pyx_vtabstruct_9pywrapfst_Weight *)__pyx_v_self->__pyx_vtab)->to_string(__pyx_v_self, 0) == ((char const *)\"BadNumber\")) != 0);\n  if (unlikely(__pyx_t_1)) {\n\n    /* \"pywrapfst.pyx\":390\n *       raise FstArgError(\"Weight type not found\")\n *     if self.to_string() == b\"BadNumber\":\n *       raise FstBadWeightError(\"Invalid weight\")             # <<<<<<<<<<<<<<\n * \n *   cpdef Weight copy(self):\n */\n    __pyx_t_3 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstBadWeightError); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 390, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_3);\n    __pyx_t_2 = __Pyx_PyObject_Call(__pyx_t_3, __pyx_tuple__2, NULL); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 390, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_2);\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    __Pyx_Raise(__pyx_t_2, 0, 0, 0);\n    __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n    __PYX_ERR(0, 390, __pyx_L1_error)\n\n    /* \"pywrapfst.pyx\":389\n *     if self.type() == b\"none\":\n *       raise FstArgError(\"Weight type not found\")\n *     if self.to_string() == b\"BadNumber\":             # <<<<<<<<<<<<<<\n *       raise FstBadWeightError(\"Invalid weight\")\n * \n */\n  }\n\n  /* \"pywrapfst.pyx\":386\n *     self._check_weight()\n * \n *   cdef void _check_weight(self) except *:             # <<<<<<<<<<<<<<\n *     if self.type() == b\"none\":\n *       raise FstArgError(\"Weight type not found\")\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_AddTraceback(\"pywrapfst.Weight._check_weight\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n}\n\n/* \"pywrapfst.pyx\":392\n *       raise FstBadWeightError(\"Invalid weight\")\n * \n *   cpdef Weight copy(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     copy(self)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_6Weight_9copy(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic struct __pyx_obj_9pywrapfst_Weight *__pyx_f_9pywrapfst_6Weight_copy(struct __pyx_obj_9pywrapfst_Weight *__pyx_v_self, int __pyx_skip_dispatch) {\n  struct __pyx_obj_9pywrapfst_Weight *__pyx_v_result = 0;\n  struct __pyx_obj_9pywrapfst_Weight *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  __Pyx_RefNannySetupContext(\"copy\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_copy); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 392, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_6Weight_9copy)) {\n      __Pyx_XDECREF(((PyObject *)__pyx_r));\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 392, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 392, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      if (!(likely(((__pyx_t_2) == Py_None) || likely(__Pyx_TypeTest(__pyx_t_2, __pyx_ptype_9pywrapfst_Weight))))) __PYX_ERR(0, 392, __pyx_L1_error)\n      __pyx_r = ((struct __pyx_obj_9pywrapfst_Weight *)__pyx_t_2);\n      __pyx_t_2 = 0;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":398\n *     Returns a copy of the Weight.\n *     \"\"\"\n *     cdef Weight result = Weight.__new__(Weight)             # <<<<<<<<<<<<<<\n *     result._weight.reset(new fst.WeightClass(deref(self._weight)))\n *     return result\n */\n  __pyx_t_1 = ((PyObject *)__pyx_tp_new_9pywrapfst_Weight(((PyTypeObject *)__pyx_ptype_9pywrapfst_Weight), __pyx_empty_tuple, NULL)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 398, __pyx_L1_error)\n  __Pyx_GOTREF(((PyObject *)__pyx_t_1));\n  __pyx_v_result = ((struct __pyx_obj_9pywrapfst_Weight *)__pyx_t_1);\n  __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":399\n *     \"\"\"\n *     cdef Weight result = Weight.__new__(Weight)\n *     result._weight.reset(new fst.WeightClass(deref(self._weight)))             # <<<<<<<<<<<<<<\n *     return result\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_result) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_weight\");\n    __PYX_ERR(0, 399, __pyx_L1_error)\n  }\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_weight\");\n    __PYX_ERR(0, 399, __pyx_L1_error)\n  }\n  __pyx_v_result->_weight.reset(new fst::script::WeightClass((*__pyx_v_self->_weight)));\n\n  /* \"pywrapfst.pyx\":400\n *     cdef Weight result = Weight.__new__(Weight)\n *     result._weight.reset(new fst.WeightClass(deref(self._weight)))\n *     return result             # <<<<<<<<<<<<<<\n * \n *   # To get around the inability to declare cdef class methods, we define the\n */\n  __Pyx_XDECREF(((PyObject *)__pyx_r));\n  __Pyx_INCREF(((PyObject *)__pyx_v_result));\n  __pyx_r = __pyx_v_result;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":392\n *       raise FstBadWeightError(\"Invalid weight\")\n * \n *   cpdef Weight copy(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     copy(self)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_AddTraceback(\"pywrapfst.Weight.copy\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XDECREF((PyObject *)__pyx_v_result);\n  __Pyx_XGIVEREF((PyObject *)__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_6Weight_9copy(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_6Weight_8copy[] = \"\\n    copy(self)\\n\\n    Returns a copy of the Weight.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_6Weight_9copy(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"copy (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_6Weight_8copy(((struct __pyx_obj_9pywrapfst_Weight *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_6Weight_8copy(struct __pyx_obj_9pywrapfst_Weight *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"copy\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst_6Weight_copy(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 392, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.Weight.copy\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":406\n * \n *   @classmethod\n *   def Zero(cls, weight_type):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     Weight.Zero(weight_type)\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_6Weight_11Zero(PyObject *__pyx_v_cls, PyObject *__pyx_v_weight_type); /*proto*/\nstatic char __pyx_doc_9pywrapfst_6Weight_10Zero[] = \"\\n    Weight.Zero(weight_type)\\n\\n    Constructs semiring zero.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_6Weight_11Zero(PyObject *__pyx_v_cls, PyObject *__pyx_v_weight_type) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"Zero (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_6Weight_10Zero(((PyTypeObject*)__pyx_v_cls), ((PyObject *)__pyx_v_weight_type));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_6Weight_10Zero(CYTHON_UNUSED PyTypeObject *__pyx_v_cls, PyObject *__pyx_v_weight_type) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"Zero\", 0);\n\n  /* \"pywrapfst.pyx\":412\n *     Constructs semiring zero.\n *     \"\"\"\n *     return _Zero(weight_type)             # <<<<<<<<<<<<<<\n * \n *   @classmethod\n */\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst__Zero(__pyx_v_weight_type)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 412, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":406\n * \n *   @classmethod\n *   def Zero(cls, weight_type):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     Weight.Zero(weight_type)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.Weight.Zero\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":415\n * \n *   @classmethod\n *   def One(cls, weight_type):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     Weight.One(weight_type)\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_6Weight_13One(PyObject *__pyx_v_cls, PyObject *__pyx_v_weight_type); /*proto*/\nstatic char __pyx_doc_9pywrapfst_6Weight_12One[] = \"\\n    Weight.One(weight_type)\\n\\n    Constructs semiring One.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_6Weight_13One(PyObject *__pyx_v_cls, PyObject *__pyx_v_weight_type) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"One (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_6Weight_12One(((PyTypeObject*)__pyx_v_cls), ((PyObject *)__pyx_v_weight_type));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_6Weight_12One(CYTHON_UNUSED PyTypeObject *__pyx_v_cls, PyObject *__pyx_v_weight_type) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"One\", 0);\n\n  /* \"pywrapfst.pyx\":421\n *     Constructs semiring One.\n *     \"\"\"\n *     return _One(weight_type)             # <<<<<<<<<<<<<<\n * \n *   @classmethod\n */\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst__One(__pyx_v_weight_type)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 421, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":415\n * \n *   @classmethod\n *   def One(cls, weight_type):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     Weight.One(weight_type)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.Weight.One\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":424\n * \n *   @classmethod\n *   def NoWeight(cls, weight_type):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     Weight.NoWeight(weight_type)\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_6Weight_15NoWeight(PyObject *__pyx_v_cls, PyObject *__pyx_v_weight_type); /*proto*/\nstatic char __pyx_doc_9pywrapfst_6Weight_14NoWeight[] = \"\\n    Weight.NoWeight(weight_type)\\n\\n    Constructs a non-member weight in the semiring.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_6Weight_15NoWeight(PyObject *__pyx_v_cls, PyObject *__pyx_v_weight_type) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"NoWeight (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_6Weight_14NoWeight(((PyTypeObject*)__pyx_v_cls), ((PyObject *)__pyx_v_weight_type));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_6Weight_14NoWeight(CYTHON_UNUSED PyTypeObject *__pyx_v_cls, PyObject *__pyx_v_weight_type) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"NoWeight\", 0);\n\n  /* \"pywrapfst.pyx\":430\n *     Constructs a non-member weight in the semiring.\n *     \"\"\"\n *     return _NoWeight(weight_type)             # <<<<<<<<<<<<<<\n * \n *   def __eq__(Weight w1, Weight w2):\n */\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst__NoWeight(__pyx_v_weight_type)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 430, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":424\n * \n *   @classmethod\n *   def NoWeight(cls, weight_type):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     Weight.NoWeight(weight_type)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.Weight.NoWeight\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":432\n *     return _NoWeight(weight_type)\n * \n *   def __eq__(Weight w1, Weight w2):             # <<<<<<<<<<<<<<\n *     return fst.Eq(deref(w1._weight), deref(w2._weight))\n * \n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_6Weight_17__eq__(PyObject *__pyx_v_w1, PyObject *__pyx_v_w2); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_6Weight_17__eq__(PyObject *__pyx_v_w1, PyObject *__pyx_v_w2) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__eq__ (wrapper)\", 0);\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_w2), __pyx_ptype_9pywrapfst_Weight, 1, \"w2\", 0))) __PYX_ERR(0, 432, __pyx_L1_error)\n  __pyx_r = __pyx_pf_9pywrapfst_6Weight_16__eq__(((struct __pyx_obj_9pywrapfst_Weight *)__pyx_v_w1), ((struct __pyx_obj_9pywrapfst_Weight *)__pyx_v_w2));\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_6Weight_16__eq__(struct __pyx_obj_9pywrapfst_Weight *__pyx_v_w1, struct __pyx_obj_9pywrapfst_Weight *__pyx_v_w2) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"__eq__\", 0);\n\n  /* \"pywrapfst.pyx\":433\n * \n *   def __eq__(Weight w1, Weight w2):\n *     return fst.Eq(deref(w1._weight), deref(w2._weight))             # <<<<<<<<<<<<<<\n * \n *   def __ne__(Weight w1, Weight w2):\n */\n  __Pyx_XDECREF(__pyx_r);\n  if (unlikely(((PyObject *)__pyx_v_w1) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_weight\");\n    __PYX_ERR(0, 433, __pyx_L1_error)\n  }\n  if (unlikely(((PyObject *)__pyx_v_w2) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_weight\");\n    __PYX_ERR(0, 433, __pyx_L1_error)\n  }\n  __pyx_t_1 = __Pyx_PyBool_FromLong(operator==((*__pyx_v_w1->_weight), (*__pyx_v_w2->_weight))); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 433, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":432\n *     return _NoWeight(weight_type)\n * \n *   def __eq__(Weight w1, Weight w2):             # <<<<<<<<<<<<<<\n *     return fst.Eq(deref(w1._weight), deref(w2._weight))\n * \n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.Weight.__eq__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":435\n *     return fst.Eq(deref(w1._weight), deref(w2._weight))\n * \n *   def __ne__(Weight w1, Weight w2):             # <<<<<<<<<<<<<<\n *     return not w1 == w2\n * \n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_6Weight_19__ne__(PyObject *__pyx_v_w1, PyObject *__pyx_v_w2); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_6Weight_19__ne__(PyObject *__pyx_v_w1, PyObject *__pyx_v_w2) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__ne__ (wrapper)\", 0);\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_w2), __pyx_ptype_9pywrapfst_Weight, 1, \"w2\", 0))) __PYX_ERR(0, 435, __pyx_L1_error)\n  __pyx_r = __pyx_pf_9pywrapfst_6Weight_18__ne__(((struct __pyx_obj_9pywrapfst_Weight *)__pyx_v_w1), ((struct __pyx_obj_9pywrapfst_Weight *)__pyx_v_w2));\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_6Weight_18__ne__(struct __pyx_obj_9pywrapfst_Weight *__pyx_v_w1, struct __pyx_obj_9pywrapfst_Weight *__pyx_v_w2) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  int __pyx_t_2;\n  __Pyx_RefNannySetupContext(\"__ne__\", 0);\n\n  /* \"pywrapfst.pyx\":436\n * \n *   def __ne__(Weight w1, Weight w2):\n *     return not w1 == w2             # <<<<<<<<<<<<<<\n * \n *   cpdef string to_string(self):\n */\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = PyObject_RichCompare(((PyObject *)__pyx_v_w1), ((PyObject *)__pyx_v_w2), Py_EQ); __Pyx_XGOTREF(__pyx_t_1); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 436, __pyx_L1_error)\n  __pyx_t_2 = __Pyx_PyObject_IsTrue(__pyx_t_1); if (unlikely(__pyx_t_2 < 0)) __PYX_ERR(0, 436, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  __pyx_t_1 = __Pyx_PyBool_FromLong((!__pyx_t_2)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 436, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":435\n *     return fst.Eq(deref(w1._weight), deref(w2._weight))\n * \n *   def __ne__(Weight w1, Weight w2):             # <<<<<<<<<<<<<<\n *     return not w1 == w2\n * \n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.Weight.__ne__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":438\n *     return not w1 == w2\n * \n *   cpdef string to_string(self):             # <<<<<<<<<<<<<<\n *     return self._weight.get().ToString()\n * \n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_6Weight_21to_string(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic std::string __pyx_f_9pywrapfst_6Weight_to_string(struct __pyx_obj_9pywrapfst_Weight *__pyx_v_self, int __pyx_skip_dispatch) {\n  std::string __pyx_r;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  std::string __pyx_t_5;\n  __Pyx_RefNannySetupContext(\"to_string\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_to_string); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 438, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_6Weight_21to_string)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 438, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 438, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __pyx_t_5 = __pyx_convert_string_from_py_std__in_string(__pyx_t_2); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 438, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __pyx_r = __pyx_t_5;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":439\n * \n *   cpdef string to_string(self):\n *     return self._weight.get().ToString()             # <<<<<<<<<<<<<<\n * \n *   cpdef string type(self):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_weight\");\n    __PYX_ERR(0, 439, __pyx_L1_error)\n  }\n  __pyx_r = __pyx_v_self->_weight.get()->ToString();\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":438\n *     return not w1 == w2\n * \n *   cpdef string to_string(self):             # <<<<<<<<<<<<<<\n *     return self._weight.get().ToString()\n * \n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_WriteUnraisable(\"pywrapfst.Weight.to_string\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __Pyx_pretend_to_initialize(&__pyx_r);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_6Weight_21to_string(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_6Weight_21to_string(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"to_string (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_6Weight_20to_string(((struct __pyx_obj_9pywrapfst_Weight *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_6Weight_20to_string(struct __pyx_obj_9pywrapfst_Weight *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"to_string\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __pyx_convert_PyBytes_string_to_py_std__in_string(__pyx_f_9pywrapfst_6Weight_to_string(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 438, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.Weight.to_string\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":441\n *     return self._weight.get().ToString()\n * \n *   cpdef string type(self):             # <<<<<<<<<<<<<<\n *     \"\"\"type(self)\n * \n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_6Weight_23type(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic std::string __pyx_f_9pywrapfst_6Weight_type(struct __pyx_obj_9pywrapfst_Weight *__pyx_v_self, int __pyx_skip_dispatch) {\n  std::string __pyx_r;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  std::string __pyx_t_5;\n  __Pyx_RefNannySetupContext(\"type\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_type); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 441, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_6Weight_23type)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 441, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 441, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __pyx_t_5 = __pyx_convert_string_from_py_std__in_string(__pyx_t_2); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 441, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __pyx_r = __pyx_t_5;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":446\n *     Returns a string indicating the weight type.\n *     \"\"\"\n *     return self._weight.get().Type()             # <<<<<<<<<<<<<<\n * \n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_weight\");\n    __PYX_ERR(0, 446, __pyx_L1_error)\n  }\n  __pyx_r = __pyx_v_self->_weight.get()->Type();\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":441\n *     return self._weight.get().ToString()\n * \n *   cpdef string type(self):             # <<<<<<<<<<<<<<\n *     \"\"\"type(self)\n * \n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_WriteUnraisable(\"pywrapfst.Weight.type\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __Pyx_pretend_to_initialize(&__pyx_r);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_6Weight_23type(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_6Weight_22type[] = \"type(self)\\n\\n    Returns a string indicating the weight type.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_6Weight_23type(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"type (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_6Weight_22type(((struct __pyx_obj_9pywrapfst_Weight *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_6Weight_22type(struct __pyx_obj_9pywrapfst_Weight *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"type\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __pyx_convert_PyBytes_string_to_py_std__in_string(__pyx_f_9pywrapfst_6Weight_type(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 441, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.Weight.type\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"(tree fragment)\":1\n * def __reduce_cython__(self):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._weight cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_6Weight_25__reduce_cython__(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_6Weight_25__reduce_cython__(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__reduce_cython__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_6Weight_24__reduce_cython__(((struct __pyx_obj_9pywrapfst_Weight *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_6Weight_24__reduce_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst_Weight *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"__reduce_cython__\", 0);\n\n  /* \"(tree fragment)\":2\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._weight cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._weight cannot be converted to a Python object for pickling\")\n */\n  __pyx_t_1 = __Pyx_PyObject_Call(__pyx_builtin_TypeError, __pyx_tuple__3, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(1, 2, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __Pyx_Raise(__pyx_t_1, 0, 0, 0);\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  __PYX_ERR(1, 2, __pyx_L1_error)\n\n  /* \"(tree fragment)\":1\n * def __reduce_cython__(self):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._weight cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.Weight.__reduce_cython__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"(tree fragment)\":3\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._weight cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._weight cannot be converted to a Python object for pickling\")\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_6Weight_27__setstate_cython__(PyObject *__pyx_v_self, PyObject *__pyx_v___pyx_state); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_6Weight_27__setstate_cython__(PyObject *__pyx_v_self, PyObject *__pyx_v___pyx_state) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__setstate_cython__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_6Weight_26__setstate_cython__(((struct __pyx_obj_9pywrapfst_Weight *)__pyx_v_self), ((PyObject *)__pyx_v___pyx_state));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_6Weight_26__setstate_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst_Weight *__pyx_v_self, CYTHON_UNUSED PyObject *__pyx_v___pyx_state) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"__setstate_cython__\", 0);\n\n  /* \"(tree fragment)\":4\n *     raise TypeError(\"self._weight cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._weight cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n */\n  __pyx_t_1 = __Pyx_PyObject_Call(__pyx_builtin_TypeError, __pyx_tuple__4, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(1, 4, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __Pyx_Raise(__pyx_t_1, 0, 0, 0);\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  __PYX_ERR(1, 4, __pyx_L1_error)\n\n  /* \"(tree fragment)\":3\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._weight cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._weight cannot be converted to a Python object for pickling\")\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.Weight.__setstate_cython__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":449\n * \n * \n * cdef Weight _plus(Weight lhs, Weight rhs):             # <<<<<<<<<<<<<<\n *   cdef Weight result = Weight.__new__(Weight)\n *   result._weight.reset(new fst.WeightClass(fst.Plus(deref(lhs._weight),\n */\n\nstatic struct __pyx_obj_9pywrapfst_Weight *__pyx_f_9pywrapfst__plus(struct __pyx_obj_9pywrapfst_Weight *__pyx_v_lhs, struct __pyx_obj_9pywrapfst_Weight *__pyx_v_rhs) {\n  struct __pyx_obj_9pywrapfst_Weight *__pyx_v_result = 0;\n  struct __pyx_obj_9pywrapfst_Weight *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"_plus\", 0);\n\n  /* \"pywrapfst.pyx\":450\n * \n * cdef Weight _plus(Weight lhs, Weight rhs):\n *   cdef Weight result = Weight.__new__(Weight)             # <<<<<<<<<<<<<<\n *   result._weight.reset(new fst.WeightClass(fst.Plus(deref(lhs._weight),\n *                                                     deref(rhs._weight))))\n */\n  __pyx_t_1 = ((PyObject *)__pyx_tp_new_9pywrapfst_Weight(((PyTypeObject *)__pyx_ptype_9pywrapfst_Weight), __pyx_empty_tuple, NULL)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 450, __pyx_L1_error)\n  __Pyx_GOTREF(((PyObject *)__pyx_t_1));\n  __pyx_v_result = ((struct __pyx_obj_9pywrapfst_Weight *)__pyx_t_1);\n  __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":451\n * cdef Weight _plus(Weight lhs, Weight rhs):\n *   cdef Weight result = Weight.__new__(Weight)\n *   result._weight.reset(new fst.WeightClass(fst.Plus(deref(lhs._weight),             # <<<<<<<<<<<<<<\n *                                                     deref(rhs._weight))))\n *   return result\n */\n  if (unlikely(((PyObject *)__pyx_v_result) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_weight\");\n    __PYX_ERR(0, 451, __pyx_L1_error)\n  }\n  if (unlikely(((PyObject *)__pyx_v_lhs) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_weight\");\n    __PYX_ERR(0, 451, __pyx_L1_error)\n  }\n\n  /* \"pywrapfst.pyx\":452\n *   cdef Weight result = Weight.__new__(Weight)\n *   result._weight.reset(new fst.WeightClass(fst.Plus(deref(lhs._weight),\n *                                                     deref(rhs._weight))))             # <<<<<<<<<<<<<<\n *   return result\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_rhs) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_weight\");\n    __PYX_ERR(0, 452, __pyx_L1_error)\n  }\n\n  /* \"pywrapfst.pyx\":451\n * cdef Weight _plus(Weight lhs, Weight rhs):\n *   cdef Weight result = Weight.__new__(Weight)\n *   result._weight.reset(new fst.WeightClass(fst.Plus(deref(lhs._weight),             # <<<<<<<<<<<<<<\n *                                                     deref(rhs._weight))))\n *   return result\n */\n  __pyx_v_result->_weight.reset(new fst::script::WeightClass(fst::script::Plus((*__pyx_v_lhs->_weight), (*__pyx_v_rhs->_weight))));\n\n  /* \"pywrapfst.pyx\":453\n *   result._weight.reset(new fst.WeightClass(fst.Plus(deref(lhs._weight),\n *                                                     deref(rhs._weight))))\n *   return result             # <<<<<<<<<<<<<<\n * \n * \n */\n  __Pyx_XDECREF(((PyObject *)__pyx_r));\n  __Pyx_INCREF(((PyObject *)__pyx_v_result));\n  __pyx_r = __pyx_v_result;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":449\n * \n * \n * cdef Weight _plus(Weight lhs, Weight rhs):             # <<<<<<<<<<<<<<\n *   cdef Weight result = Weight.__new__(Weight)\n *   result._weight.reset(new fst.WeightClass(fst.Plus(deref(lhs._weight),\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst._plus\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XDECREF((PyObject *)__pyx_v_result);\n  __Pyx_XGIVEREF((PyObject *)__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":456\n * \n * \n * def plus(Weight lhs, Weight rhs):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   plus(lhs, rhs)\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_1plus(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic char __pyx_doc_9pywrapfst_plus[] = \"\\n  plus(lhs, rhs)\\n\\n  Computes the sum of two Weights in the same semiring.\\n\\n  This function computes lhs \\\\oplus rhs, raising an exception if lhs and rhs\\n  are not in the same semiring.\\n\\n  Args:\\n     lhs: Left-hand side Weight.\\n     rhs: Right-hand side Weight.\\n\\n  Returns:\\n    A Weight object.\\n\\n  Raises:\\n    FstArgError: Weight type not found (or not in same semiring).\\n    FstBadWeightError: invalid weight.\\n  \";\nstatic PyMethodDef __pyx_mdef_9pywrapfst_1plus = {\"plus\", (PyCFunction)__pyx_pw_9pywrapfst_1plus, METH_VARARGS|METH_KEYWORDS, __pyx_doc_9pywrapfst_plus};\nstatic PyObject *__pyx_pw_9pywrapfst_1plus(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  struct __pyx_obj_9pywrapfst_Weight *__pyx_v_lhs = 0;\n  struct __pyx_obj_9pywrapfst_Weight *__pyx_v_rhs = 0;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"plus (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_lhs,&__pyx_n_s_rhs,0};\n    PyObject* values[2] = {0,0};\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (likely((values[0] = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_lhs)) != 0)) kw_args--;\n        else goto __pyx_L5_argtuple_error;\n        CYTHON_FALLTHROUGH;\n        case  1:\n        if (likely((values[1] = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_rhs)) != 0)) kw_args--;\n        else {\n          __Pyx_RaiseArgtupleInvalid(\"plus\", 1, 2, 2, 1); __PYX_ERR(0, 456, __pyx_L3_error)\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"plus\") < 0)) __PYX_ERR(0, 456, __pyx_L3_error)\n      }\n    } else if (PyTuple_GET_SIZE(__pyx_args) != 2) {\n      goto __pyx_L5_argtuple_error;\n    } else {\n      values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n      values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n    }\n    __pyx_v_lhs = ((struct __pyx_obj_9pywrapfst_Weight *)values[0]);\n    __pyx_v_rhs = ((struct __pyx_obj_9pywrapfst_Weight *)values[1]);\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"plus\", 1, 2, 2, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 456, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst.plus\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_lhs), __pyx_ptype_9pywrapfst_Weight, 1, \"lhs\", 0))) __PYX_ERR(0, 456, __pyx_L1_error)\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_rhs), __pyx_ptype_9pywrapfst_Weight, 1, \"rhs\", 0))) __PYX_ERR(0, 456, __pyx_L1_error)\n  __pyx_r = __pyx_pf_9pywrapfst_plus(__pyx_self, __pyx_v_lhs, __pyx_v_rhs);\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_plus(CYTHON_UNUSED PyObject *__pyx_self, struct __pyx_obj_9pywrapfst_Weight *__pyx_v_lhs, struct __pyx_obj_9pywrapfst_Weight *__pyx_v_rhs) {\n  struct __pyx_obj_9pywrapfst_Weight *__pyx_v_result = 0;\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"plus\", 0);\n\n  /* \"pywrapfst.pyx\":476\n *     FstBadWeightError: invalid weight.\n *   \"\"\"\n *   cdef Weight result = _plus(lhs, rhs)             # <<<<<<<<<<<<<<\n *   result._check_weight()\n *   return result\n */\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst__plus(__pyx_v_lhs, __pyx_v_rhs)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 476, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_v_result = ((struct __pyx_obj_9pywrapfst_Weight *)__pyx_t_1);\n  __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":477\n *   \"\"\"\n *   cdef Weight result = _plus(lhs, rhs)\n *   result._check_weight()             # <<<<<<<<<<<<<<\n *   return result\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_result) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_check_weight\");\n    __PYX_ERR(0, 477, __pyx_L1_error)\n  }\n  ((struct __pyx_vtabstruct_9pywrapfst_Weight *)__pyx_v_result->__pyx_vtab)->_check_weight(__pyx_v_result); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 477, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":478\n *   cdef Weight result = _plus(lhs, rhs)\n *   result._check_weight()\n *   return result             # <<<<<<<<<<<<<<\n * \n * \n */\n  __Pyx_XDECREF(__pyx_r);\n  __Pyx_INCREF(((PyObject *)__pyx_v_result));\n  __pyx_r = ((PyObject *)__pyx_v_result);\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":456\n * \n * \n * def plus(Weight lhs, Weight rhs):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   plus(lhs, rhs)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.plus\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XDECREF((PyObject *)__pyx_v_result);\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":481\n * \n * \n * cdef Weight _times(Weight lhs, Weight rhs):             # <<<<<<<<<<<<<<\n *   cdef Weight result = Weight.__new__(Weight)\n *   result._weight.reset(new fst.WeightClass(fst.Times(deref(lhs._weight),\n */\n\nstatic struct __pyx_obj_9pywrapfst_Weight *__pyx_f_9pywrapfst__times(struct __pyx_obj_9pywrapfst_Weight *__pyx_v_lhs, struct __pyx_obj_9pywrapfst_Weight *__pyx_v_rhs) {\n  struct __pyx_obj_9pywrapfst_Weight *__pyx_v_result = 0;\n  struct __pyx_obj_9pywrapfst_Weight *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"_times\", 0);\n\n  /* \"pywrapfst.pyx\":482\n * \n * cdef Weight _times(Weight lhs, Weight rhs):\n *   cdef Weight result = Weight.__new__(Weight)             # <<<<<<<<<<<<<<\n *   result._weight.reset(new fst.WeightClass(fst.Times(deref(lhs._weight),\n *                                                      deref(rhs._weight))))\n */\n  __pyx_t_1 = ((PyObject *)__pyx_tp_new_9pywrapfst_Weight(((PyTypeObject *)__pyx_ptype_9pywrapfst_Weight), __pyx_empty_tuple, NULL)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 482, __pyx_L1_error)\n  __Pyx_GOTREF(((PyObject *)__pyx_t_1));\n  __pyx_v_result = ((struct __pyx_obj_9pywrapfst_Weight *)__pyx_t_1);\n  __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":483\n * cdef Weight _times(Weight lhs, Weight rhs):\n *   cdef Weight result = Weight.__new__(Weight)\n *   result._weight.reset(new fst.WeightClass(fst.Times(deref(lhs._weight),             # <<<<<<<<<<<<<<\n *                                                      deref(rhs._weight))))\n *   return result\n */\n  if (unlikely(((PyObject *)__pyx_v_result) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_weight\");\n    __PYX_ERR(0, 483, __pyx_L1_error)\n  }\n  if (unlikely(((PyObject *)__pyx_v_lhs) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_weight\");\n    __PYX_ERR(0, 483, __pyx_L1_error)\n  }\n\n  /* \"pywrapfst.pyx\":484\n *   cdef Weight result = Weight.__new__(Weight)\n *   result._weight.reset(new fst.WeightClass(fst.Times(deref(lhs._weight),\n *                                                      deref(rhs._weight))))             # <<<<<<<<<<<<<<\n *   return result\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_rhs) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_weight\");\n    __PYX_ERR(0, 484, __pyx_L1_error)\n  }\n\n  /* \"pywrapfst.pyx\":483\n * cdef Weight _times(Weight lhs, Weight rhs):\n *   cdef Weight result = Weight.__new__(Weight)\n *   result._weight.reset(new fst.WeightClass(fst.Times(deref(lhs._weight),             # <<<<<<<<<<<<<<\n *                                                      deref(rhs._weight))))\n *   return result\n */\n  __pyx_v_result->_weight.reset(new fst::script::WeightClass(fst::script::Times((*__pyx_v_lhs->_weight), (*__pyx_v_rhs->_weight))));\n\n  /* \"pywrapfst.pyx\":485\n *   result._weight.reset(new fst.WeightClass(fst.Times(deref(lhs._weight),\n *                                                      deref(rhs._weight))))\n *   return result             # <<<<<<<<<<<<<<\n * \n * \n */\n  __Pyx_XDECREF(((PyObject *)__pyx_r));\n  __Pyx_INCREF(((PyObject *)__pyx_v_result));\n  __pyx_r = __pyx_v_result;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":481\n * \n * \n * cdef Weight _times(Weight lhs, Weight rhs):             # <<<<<<<<<<<<<<\n *   cdef Weight result = Weight.__new__(Weight)\n *   result._weight.reset(new fst.WeightClass(fst.Times(deref(lhs._weight),\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst._times\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XDECREF((PyObject *)__pyx_v_result);\n  __Pyx_XGIVEREF((PyObject *)__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":488\n * \n * \n * def times(Weight lhs, Weight rhs):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   times(lhs, rhs)\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_3times(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic char __pyx_doc_9pywrapfst_2times[] = \"\\n  times(lhs, rhs)\\n\\n  Computes the product of two Weights in the same semiring.\\n\\n  This function computes lhs \\\\otimes rhs, raising an exception if lhs and rhs\\n  are not in the same semiring.\\n\\n  Args:\\n     lhs: Left-hand side Weight.\\n     rhs: Right-hand side Weight.\\n\\n  Returns:\\n    A Weight object.\\n\\n  Raises:\\n    FstArgError: Weight type not found (or not in same semiring).\\n    FstBadWeightError: Invalid weight.\\n  \";\nstatic PyMethodDef __pyx_mdef_9pywrapfst_3times = {\"times\", (PyCFunction)__pyx_pw_9pywrapfst_3times, METH_VARARGS|METH_KEYWORDS, __pyx_doc_9pywrapfst_2times};\nstatic PyObject *__pyx_pw_9pywrapfst_3times(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  struct __pyx_obj_9pywrapfst_Weight *__pyx_v_lhs = 0;\n  struct __pyx_obj_9pywrapfst_Weight *__pyx_v_rhs = 0;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"times (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_lhs,&__pyx_n_s_rhs,0};\n    PyObject* values[2] = {0,0};\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (likely((values[0] = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_lhs)) != 0)) kw_args--;\n        else goto __pyx_L5_argtuple_error;\n        CYTHON_FALLTHROUGH;\n        case  1:\n        if (likely((values[1] = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_rhs)) != 0)) kw_args--;\n        else {\n          __Pyx_RaiseArgtupleInvalid(\"times\", 1, 2, 2, 1); __PYX_ERR(0, 488, __pyx_L3_error)\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"times\") < 0)) __PYX_ERR(0, 488, __pyx_L3_error)\n      }\n    } else if (PyTuple_GET_SIZE(__pyx_args) != 2) {\n      goto __pyx_L5_argtuple_error;\n    } else {\n      values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n      values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n    }\n    __pyx_v_lhs = ((struct __pyx_obj_9pywrapfst_Weight *)values[0]);\n    __pyx_v_rhs = ((struct __pyx_obj_9pywrapfst_Weight *)values[1]);\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"times\", 1, 2, 2, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 488, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst.times\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_lhs), __pyx_ptype_9pywrapfst_Weight, 1, \"lhs\", 0))) __PYX_ERR(0, 488, __pyx_L1_error)\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_rhs), __pyx_ptype_9pywrapfst_Weight, 1, \"rhs\", 0))) __PYX_ERR(0, 488, __pyx_L1_error)\n  __pyx_r = __pyx_pf_9pywrapfst_2times(__pyx_self, __pyx_v_lhs, __pyx_v_rhs);\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_2times(CYTHON_UNUSED PyObject *__pyx_self, struct __pyx_obj_9pywrapfst_Weight *__pyx_v_lhs, struct __pyx_obj_9pywrapfst_Weight *__pyx_v_rhs) {\n  struct __pyx_obj_9pywrapfst_Weight *__pyx_v_result = 0;\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"times\", 0);\n\n  /* \"pywrapfst.pyx\":508\n *     FstBadWeightError: Invalid weight.\n *   \"\"\"\n *   cdef Weight result = _times(lhs, rhs)             # <<<<<<<<<<<<<<\n *   result._check_weight()\n *   return result\n */\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst__times(__pyx_v_lhs, __pyx_v_rhs)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 508, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_v_result = ((struct __pyx_obj_9pywrapfst_Weight *)__pyx_t_1);\n  __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":509\n *   \"\"\"\n *   cdef Weight result = _times(lhs, rhs)\n *   result._check_weight()             # <<<<<<<<<<<<<<\n *   return result\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_result) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_check_weight\");\n    __PYX_ERR(0, 509, __pyx_L1_error)\n  }\n  ((struct __pyx_vtabstruct_9pywrapfst_Weight *)__pyx_v_result->__pyx_vtab)->_check_weight(__pyx_v_result); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 509, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":510\n *   cdef Weight result = _times(lhs, rhs)\n *   result._check_weight()\n *   return result             # <<<<<<<<<<<<<<\n * \n * \n */\n  __Pyx_XDECREF(__pyx_r);\n  __Pyx_INCREF(((PyObject *)__pyx_v_result));\n  __pyx_r = ((PyObject *)__pyx_v_result);\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":488\n * \n * \n * def times(Weight lhs, Weight rhs):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   times(lhs, rhs)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.times\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XDECREF((PyObject *)__pyx_v_result);\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":513\n * \n * \n * cdef Weight _divide(Weight lhs, Weight rhs):             # <<<<<<<<<<<<<<\n *   cdef Weight result = Weight.__new__(Weight)\n *   result._weight.reset(new fst.WeightClass(fst.Divide(deref(lhs._weight),\n */\n\nstatic struct __pyx_obj_9pywrapfst_Weight *__pyx_f_9pywrapfst__divide(struct __pyx_obj_9pywrapfst_Weight *__pyx_v_lhs, struct __pyx_obj_9pywrapfst_Weight *__pyx_v_rhs) {\n  struct __pyx_obj_9pywrapfst_Weight *__pyx_v_result = 0;\n  struct __pyx_obj_9pywrapfst_Weight *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"_divide\", 0);\n\n  /* \"pywrapfst.pyx\":514\n * \n * cdef Weight _divide(Weight lhs, Weight rhs):\n *   cdef Weight result = Weight.__new__(Weight)             # <<<<<<<<<<<<<<\n *   result._weight.reset(new fst.WeightClass(fst.Divide(deref(lhs._weight),\n *                                                       deref(rhs._weight))))\n */\n  __pyx_t_1 = ((PyObject *)__pyx_tp_new_9pywrapfst_Weight(((PyTypeObject *)__pyx_ptype_9pywrapfst_Weight), __pyx_empty_tuple, NULL)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 514, __pyx_L1_error)\n  __Pyx_GOTREF(((PyObject *)__pyx_t_1));\n  __pyx_v_result = ((struct __pyx_obj_9pywrapfst_Weight *)__pyx_t_1);\n  __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":515\n * cdef Weight _divide(Weight lhs, Weight rhs):\n *   cdef Weight result = Weight.__new__(Weight)\n *   result._weight.reset(new fst.WeightClass(fst.Divide(deref(lhs._weight),             # <<<<<<<<<<<<<<\n *                                                       deref(rhs._weight))))\n *   return result\n */\n  if (unlikely(((PyObject *)__pyx_v_result) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_weight\");\n    __PYX_ERR(0, 515, __pyx_L1_error)\n  }\n  if (unlikely(((PyObject *)__pyx_v_lhs) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_weight\");\n    __PYX_ERR(0, 515, __pyx_L1_error)\n  }\n\n  /* \"pywrapfst.pyx\":516\n *   cdef Weight result = Weight.__new__(Weight)\n *   result._weight.reset(new fst.WeightClass(fst.Divide(deref(lhs._weight),\n *                                                       deref(rhs._weight))))             # <<<<<<<<<<<<<<\n *   return result\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_rhs) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_weight\");\n    __PYX_ERR(0, 516, __pyx_L1_error)\n  }\n\n  /* \"pywrapfst.pyx\":515\n * cdef Weight _divide(Weight lhs, Weight rhs):\n *   cdef Weight result = Weight.__new__(Weight)\n *   result._weight.reset(new fst.WeightClass(fst.Divide(deref(lhs._weight),             # <<<<<<<<<<<<<<\n *                                                       deref(rhs._weight))))\n *   return result\n */\n  __pyx_v_result->_weight.reset(new fst::script::WeightClass(fst::script::Divide((*__pyx_v_lhs->_weight), (*__pyx_v_rhs->_weight))));\n\n  /* \"pywrapfst.pyx\":517\n *   result._weight.reset(new fst.WeightClass(fst.Divide(deref(lhs._weight),\n *                                                       deref(rhs._weight))))\n *   return result             # <<<<<<<<<<<<<<\n * \n * \n */\n  __Pyx_XDECREF(((PyObject *)__pyx_r));\n  __Pyx_INCREF(((PyObject *)__pyx_v_result));\n  __pyx_r = __pyx_v_result;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":513\n * \n * \n * cdef Weight _divide(Weight lhs, Weight rhs):             # <<<<<<<<<<<<<<\n *   cdef Weight result = Weight.__new__(Weight)\n *   result._weight.reset(new fst.WeightClass(fst.Divide(deref(lhs._weight),\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst._divide\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XDECREF((PyObject *)__pyx_v_result);\n  __Pyx_XGIVEREF((PyObject *)__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":520\n * \n * \n * def divide(Weight lhs, Weight rhs):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   divide(lhs, rhs)\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_5divide(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic char __pyx_doc_9pywrapfst_4divide[] = \"\\n  divide(lhs, rhs)\\n\\n  Computes the quotient of two Weights in the same semiring.\\n\\n  This function computes lhs \\\\oslash rhs, raising an exception if lhs and rhs\\n  are not in the same semiring. As there is no way to specify whether to use\\n  left vs. right division, this assumes a commutative semiring in which these\\n  are equivalent operations.\\n\\n  Args:\\n     lhs: Left-hand side Weight.\\n     rhs: Right-hand side Weight.\\n\\n  Returns:\\n    A Weight object.\\n\\n  Raises:\\n    FstArgError: Weight type not found (or not in same semiring).\\n    FstBadWeightError: Invalid weight.\\n  \";\nstatic PyMethodDef __pyx_mdef_9pywrapfst_5divide = {\"divide\", (PyCFunction)__pyx_pw_9pywrapfst_5divide, METH_VARARGS|METH_KEYWORDS, __pyx_doc_9pywrapfst_4divide};\nstatic PyObject *__pyx_pw_9pywrapfst_5divide(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  struct __pyx_obj_9pywrapfst_Weight *__pyx_v_lhs = 0;\n  struct __pyx_obj_9pywrapfst_Weight *__pyx_v_rhs = 0;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"divide (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_lhs,&__pyx_n_s_rhs,0};\n    PyObject* values[2] = {0,0};\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (likely((values[0] = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_lhs)) != 0)) kw_args--;\n        else goto __pyx_L5_argtuple_error;\n        CYTHON_FALLTHROUGH;\n        case  1:\n        if (likely((values[1] = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_rhs)) != 0)) kw_args--;\n        else {\n          __Pyx_RaiseArgtupleInvalid(\"divide\", 1, 2, 2, 1); __PYX_ERR(0, 520, __pyx_L3_error)\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"divide\") < 0)) __PYX_ERR(0, 520, __pyx_L3_error)\n      }\n    } else if (PyTuple_GET_SIZE(__pyx_args) != 2) {\n      goto __pyx_L5_argtuple_error;\n    } else {\n      values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n      values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n    }\n    __pyx_v_lhs = ((struct __pyx_obj_9pywrapfst_Weight *)values[0]);\n    __pyx_v_rhs = ((struct __pyx_obj_9pywrapfst_Weight *)values[1]);\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"divide\", 1, 2, 2, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 520, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst.divide\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_lhs), __pyx_ptype_9pywrapfst_Weight, 1, \"lhs\", 0))) __PYX_ERR(0, 520, __pyx_L1_error)\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_rhs), __pyx_ptype_9pywrapfst_Weight, 1, \"rhs\", 0))) __PYX_ERR(0, 520, __pyx_L1_error)\n  __pyx_r = __pyx_pf_9pywrapfst_4divide(__pyx_self, __pyx_v_lhs, __pyx_v_rhs);\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_4divide(CYTHON_UNUSED PyObject *__pyx_self, struct __pyx_obj_9pywrapfst_Weight *__pyx_v_lhs, struct __pyx_obj_9pywrapfst_Weight *__pyx_v_rhs) {\n  struct __pyx_obj_9pywrapfst_Weight *__pyx_v_result = 0;\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"divide\", 0);\n\n  /* \"pywrapfst.pyx\":542\n *     FstBadWeightError: Invalid weight.\n *   \"\"\"\n *   cdef Weight result = _divide(lhs, rhs)             # <<<<<<<<<<<<<<\n *   result._check_weight()\n *   return result\n */\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst__divide(__pyx_v_lhs, __pyx_v_rhs)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 542, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_v_result = ((struct __pyx_obj_9pywrapfst_Weight *)__pyx_t_1);\n  __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":543\n *   \"\"\"\n *   cdef Weight result = _divide(lhs, rhs)\n *   result._check_weight()             # <<<<<<<<<<<<<<\n *   return result\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_result) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_check_weight\");\n    __PYX_ERR(0, 543, __pyx_L1_error)\n  }\n  ((struct __pyx_vtabstruct_9pywrapfst_Weight *)__pyx_v_result->__pyx_vtab)->_check_weight(__pyx_v_result); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 543, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":544\n *   cdef Weight result = _divide(lhs, rhs)\n *   result._check_weight()\n *   return result             # <<<<<<<<<<<<<<\n * \n * \n */\n  __Pyx_XDECREF(__pyx_r);\n  __Pyx_INCREF(((PyObject *)__pyx_v_result));\n  __pyx_r = ((PyObject *)__pyx_v_result);\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":520\n * \n * \n * def divide(Weight lhs, Weight rhs):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   divide(lhs, rhs)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.divide\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XDECREF((PyObject *)__pyx_v_result);\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":547\n * \n * \n * cdef Weight _power(Weight w, size_t n):             # <<<<<<<<<<<<<<\n *   cdef Weight result = Weight.__new__(Weight)\n *   result._weight.reset(new fst.WeightClass(fst.Power(deref(w._weight), n)))\n */\n\nstatic struct __pyx_obj_9pywrapfst_Weight *__pyx_f_9pywrapfst__power(struct __pyx_obj_9pywrapfst_Weight *__pyx_v_w, size_t __pyx_v_n) {\n  struct __pyx_obj_9pywrapfst_Weight *__pyx_v_result = 0;\n  struct __pyx_obj_9pywrapfst_Weight *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"_power\", 0);\n\n  /* \"pywrapfst.pyx\":548\n * \n * cdef Weight _power(Weight w, size_t n):\n *   cdef Weight result = Weight.__new__(Weight)             # <<<<<<<<<<<<<<\n *   result._weight.reset(new fst.WeightClass(fst.Power(deref(w._weight), n)))\n *   return result\n */\n  __pyx_t_1 = ((PyObject *)__pyx_tp_new_9pywrapfst_Weight(((PyTypeObject *)__pyx_ptype_9pywrapfst_Weight), __pyx_empty_tuple, NULL)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 548, __pyx_L1_error)\n  __Pyx_GOTREF(((PyObject *)__pyx_t_1));\n  __pyx_v_result = ((struct __pyx_obj_9pywrapfst_Weight *)__pyx_t_1);\n  __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":549\n * cdef Weight _power(Weight w, size_t n):\n *   cdef Weight result = Weight.__new__(Weight)\n *   result._weight.reset(new fst.WeightClass(fst.Power(deref(w._weight), n)))             # <<<<<<<<<<<<<<\n *   return result\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_result) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_weight\");\n    __PYX_ERR(0, 549, __pyx_L1_error)\n  }\n  if (unlikely(((PyObject *)__pyx_v_w) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_weight\");\n    __PYX_ERR(0, 549, __pyx_L1_error)\n  }\n  __pyx_v_result->_weight.reset(new fst::script::WeightClass(fst::script::Power((*__pyx_v_w->_weight), __pyx_v_n)));\n\n  /* \"pywrapfst.pyx\":550\n *   cdef Weight result = Weight.__new__(Weight)\n *   result._weight.reset(new fst.WeightClass(fst.Power(deref(w._weight), n)))\n *   return result             # <<<<<<<<<<<<<<\n * \n * \n */\n  __Pyx_XDECREF(((PyObject *)__pyx_r));\n  __Pyx_INCREF(((PyObject *)__pyx_v_result));\n  __pyx_r = __pyx_v_result;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":547\n * \n * \n * cdef Weight _power(Weight w, size_t n):             # <<<<<<<<<<<<<<\n *   cdef Weight result = Weight.__new__(Weight)\n *   result._weight.reset(new fst.WeightClass(fst.Power(deref(w._weight), n)))\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst._power\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XDECREF((PyObject *)__pyx_v_result);\n  __Pyx_XGIVEREF((PyObject *)__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":553\n * \n * \n * def power(Weight w, size_t n):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   power(lhs, rhs)\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_7power(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic char __pyx_doc_9pywrapfst_6power[] = \"\\n  power(lhs, rhs)\\n\\n  Computes the iterated product of a weight.\\n\\n  Args:\\n     w: The weight.\\n     n: The power.\\n\\n  Returns:\\n    A Weight object.\\n\\n  Raises:\\n    FstArgError: Weight type not found (or not in same semiring).\\n    FstBadWeightError: Invalid weight.\\n  \";\nstatic PyMethodDef __pyx_mdef_9pywrapfst_7power = {\"power\", (PyCFunction)__pyx_pw_9pywrapfst_7power, METH_VARARGS|METH_KEYWORDS, __pyx_doc_9pywrapfst_6power};\nstatic PyObject *__pyx_pw_9pywrapfst_7power(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  struct __pyx_obj_9pywrapfst_Weight *__pyx_v_w = 0;\n  size_t __pyx_v_n;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"power (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_w,&__pyx_n_s_n,0};\n    PyObject* values[2] = {0,0};\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (likely((values[0] = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_w)) != 0)) kw_args--;\n        else goto __pyx_L5_argtuple_error;\n        CYTHON_FALLTHROUGH;\n        case  1:\n        if (likely((values[1] = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_n)) != 0)) kw_args--;\n        else {\n          __Pyx_RaiseArgtupleInvalid(\"power\", 1, 2, 2, 1); __PYX_ERR(0, 553, __pyx_L3_error)\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"power\") < 0)) __PYX_ERR(0, 553, __pyx_L3_error)\n      }\n    } else if (PyTuple_GET_SIZE(__pyx_args) != 2) {\n      goto __pyx_L5_argtuple_error;\n    } else {\n      values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n      values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n    }\n    __pyx_v_w = ((struct __pyx_obj_9pywrapfst_Weight *)values[0]);\n    __pyx_v_n = __Pyx_PyInt_As_size_t(values[1]); if (unlikely((__pyx_v_n == (size_t)-1) && PyErr_Occurred())) __PYX_ERR(0, 553, __pyx_L3_error)\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"power\", 1, 2, 2, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 553, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst.power\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_w), __pyx_ptype_9pywrapfst_Weight, 1, \"w\", 0))) __PYX_ERR(0, 553, __pyx_L1_error)\n  __pyx_r = __pyx_pf_9pywrapfst_6power(__pyx_self, __pyx_v_w, __pyx_v_n);\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_6power(CYTHON_UNUSED PyObject *__pyx_self, struct __pyx_obj_9pywrapfst_Weight *__pyx_v_w, size_t __pyx_v_n) {\n  struct __pyx_obj_9pywrapfst_Weight *__pyx_v_result = 0;\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"power\", 0);\n\n  /* \"pywrapfst.pyx\":570\n *     FstBadWeightError: Invalid weight.\n *   \"\"\"\n *   cdef Weight result = _power(w, n)             # <<<<<<<<<<<<<<\n *   result._check_weight()\n *   return result\n */\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst__power(__pyx_v_w, __pyx_v_n)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 570, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_v_result = ((struct __pyx_obj_9pywrapfst_Weight *)__pyx_t_1);\n  __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":571\n *   \"\"\"\n *   cdef Weight result = _power(w, n)\n *   result._check_weight()             # <<<<<<<<<<<<<<\n *   return result\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_result) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_check_weight\");\n    __PYX_ERR(0, 571, __pyx_L1_error)\n  }\n  ((struct __pyx_vtabstruct_9pywrapfst_Weight *)__pyx_v_result->__pyx_vtab)->_check_weight(__pyx_v_result); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 571, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":572\n *   cdef Weight result = _power(w, n)\n *   result._check_weight()\n *   return result             # <<<<<<<<<<<<<<\n * \n * \n */\n  __Pyx_XDECREF(__pyx_r);\n  __Pyx_INCREF(((PyObject *)__pyx_v_result));\n  __pyx_r = ((PyObject *)__pyx_v_result);\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":553\n * \n * \n * def power(Weight w, size_t n):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   power(lhs, rhs)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.power\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XDECREF((PyObject *)__pyx_v_result);\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":575\n * \n * \n * cdef fst.WeightClass _get_WeightClass_or_Zero(const string &weight_type,             # <<<<<<<<<<<<<<\n *                                               weight) except *:\n *   \"\"\"Converts weight string to a WeightClass.\n */\n\nstatic fst::script::WeightClass __pyx_f_9pywrapfst__get_WeightClass_or_Zero(std::string const &__pyx_v_weight_type, PyObject *__pyx_v_weight) {\n  fst::script::WeightClass __pyx_v_result;\n  fst::script::WeightClass __pyx_r;\n  __Pyx_RefNannyDeclarations\n  int __pyx_t_1;\n  int __pyx_t_2;\n  std::string __pyx_t_3;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  PyObject *__pyx_t_6 = NULL;\n  PyObject *__pyx_t_7 = NULL;\n  PyObject *__pyx_t_8 = NULL;\n  __Pyx_RefNannySetupContext(\"_get_WeightClass_or_Zero\", 0);\n\n  /* \"pywrapfst.pyx\":593\n *   \"\"\"\n *   cdef fst.WeightClass result\n *   if weight is None:             # <<<<<<<<<<<<<<\n *     result = fst.WeightClass.Zero(weight_type)\n *   elif isinstance(weight, Weight):\n */\n  __pyx_t_1 = (__pyx_v_weight == Py_None);\n  __pyx_t_2 = (__pyx_t_1 != 0);\n  if (__pyx_t_2) {\n\n    /* \"pywrapfst.pyx\":594\n *   cdef fst.WeightClass result\n *   if weight is None:\n *     result = fst.WeightClass.Zero(weight_type)             # <<<<<<<<<<<<<<\n *   elif isinstance(weight, Weight):\n *     result = deref(<fst.WeightClass *> (<Weight> weight)._weight.get())\n */\n    __pyx_v_result = fst::script::WeightClass::Zero(__pyx_v_weight_type);\n\n    /* \"pywrapfst.pyx\":593\n *   \"\"\"\n *   cdef fst.WeightClass result\n *   if weight is None:             # <<<<<<<<<<<<<<\n *     result = fst.WeightClass.Zero(weight_type)\n *   elif isinstance(weight, Weight):\n */\n    goto __pyx_L3;\n  }\n\n  /* \"pywrapfst.pyx\":595\n *   if weight is None:\n *     result = fst.WeightClass.Zero(weight_type)\n *   elif isinstance(weight, Weight):             # <<<<<<<<<<<<<<\n *     result = deref(<fst.WeightClass *> (<Weight> weight)._weight.get())\n *   else:\n */\n  __pyx_t_2 = __Pyx_TypeCheck(__pyx_v_weight, __pyx_ptype_9pywrapfst_Weight); \n  __pyx_t_1 = (__pyx_t_2 != 0);\n  if (__pyx_t_1) {\n\n    /* \"pywrapfst.pyx\":596\n *     result = fst.WeightClass.Zero(weight_type)\n *   elif isinstance(weight, Weight):\n *     result = deref(<fst.WeightClass *> (<Weight> weight)._weight.get())             # <<<<<<<<<<<<<<\n *   else:\n *     result = fst.WeightClass(weight_type, weight_tostring(weight))\n */\n    if (unlikely(__pyx_v_weight == Py_None)) {\n      PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_weight\");\n      __PYX_ERR(0, 596, __pyx_L1_error)\n    }\n    __pyx_v_result = (*((fst::script::WeightClass *)((struct __pyx_obj_9pywrapfst_Weight *)__pyx_v_weight)->_weight.get()));\n\n    /* \"pywrapfst.pyx\":595\n *   if weight is None:\n *     result = fst.WeightClass.Zero(weight_type)\n *   elif isinstance(weight, Weight):             # <<<<<<<<<<<<<<\n *     result = deref(<fst.WeightClass *> (<Weight> weight)._weight.get())\n *   else:\n */\n    goto __pyx_L3;\n  }\n\n  /* \"pywrapfst.pyx\":598\n *     result = deref(<fst.WeightClass *> (<Weight> weight)._weight.get())\n *   else:\n *     result = fst.WeightClass(weight_type, weight_tostring(weight))             # <<<<<<<<<<<<<<\n *     if result.ToString() == b\"BadNumber\":\n *       raise FstBadWeightError(weight_tostring(weight))\n */\n  /*else*/ {\n    __pyx_t_3 = __pyx_f_9pywrapfst_weight_tostring(__pyx_v_weight, NULL); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 598, __pyx_L1_error)\n    __pyx_v_result = fst::script::WeightClass(__pyx_v_weight_type, __pyx_t_3);\n\n    /* \"pywrapfst.pyx\":599\n *   else:\n *     result = fst.WeightClass(weight_type, weight_tostring(weight))\n *     if result.ToString() == b\"BadNumber\":             # <<<<<<<<<<<<<<\n *       raise FstBadWeightError(weight_tostring(weight))\n *   return result\n */\n    __pyx_t_1 = ((__pyx_v_result.ToString() == ((char const *)\"BadNumber\")) != 0);\n    if (unlikely(__pyx_t_1)) {\n\n      /* \"pywrapfst.pyx\":600\n *     result = fst.WeightClass(weight_type, weight_tostring(weight))\n *     if result.ToString() == b\"BadNumber\":\n *       raise FstBadWeightError(weight_tostring(weight))             # <<<<<<<<<<<<<<\n *   return result\n * \n */\n      __pyx_t_5 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstBadWeightError); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 600, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_5);\n      __pyx_t_3 = __pyx_f_9pywrapfst_weight_tostring(__pyx_v_weight, NULL); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 600, __pyx_L1_error)\n      __pyx_t_6 = __pyx_convert_PyBytes_string_to_py_std__in_string(__pyx_t_3); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 600, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_6);\n      __pyx_t_7 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_5))) {\n        __pyx_t_7 = PyMethod_GET_SELF(__pyx_t_5);\n        if (likely(__pyx_t_7)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_5);\n          __Pyx_INCREF(__pyx_t_7);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_5, function);\n        }\n      }\n      if (!__pyx_t_7) {\n        __pyx_t_4 = __Pyx_PyObject_CallOneArg(__pyx_t_5, __pyx_t_6); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 600, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n        __Pyx_GOTREF(__pyx_t_4);\n      } else {\n        #if CYTHON_FAST_PYCALL\n        if (PyFunction_Check(__pyx_t_5)) {\n          PyObject *__pyx_temp[2] = {__pyx_t_7, __pyx_t_6};\n          __pyx_t_4 = __Pyx_PyFunction_FastCall(__pyx_t_5, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 600, __pyx_L1_error)\n          __Pyx_XDECREF(__pyx_t_7); __pyx_t_7 = 0;\n          __Pyx_GOTREF(__pyx_t_4);\n          __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n        } else\n        #endif\n        #if CYTHON_FAST_PYCCALL\n        if (__Pyx_PyFastCFunction_Check(__pyx_t_5)) {\n          PyObject *__pyx_temp[2] = {__pyx_t_7, __pyx_t_6};\n          __pyx_t_4 = __Pyx_PyCFunction_FastCall(__pyx_t_5, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 600, __pyx_L1_error)\n          __Pyx_XDECREF(__pyx_t_7); __pyx_t_7 = 0;\n          __Pyx_GOTREF(__pyx_t_4);\n          __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n        } else\n        #endif\n        {\n          __pyx_t_8 = PyTuple_New(1+1); if (unlikely(!__pyx_t_8)) __PYX_ERR(0, 600, __pyx_L1_error)\n          __Pyx_GOTREF(__pyx_t_8);\n          __Pyx_GIVEREF(__pyx_t_7); PyTuple_SET_ITEM(__pyx_t_8, 0, __pyx_t_7); __pyx_t_7 = NULL;\n          __Pyx_GIVEREF(__pyx_t_6);\n          PyTuple_SET_ITEM(__pyx_t_8, 0+1, __pyx_t_6);\n          __pyx_t_6 = 0;\n          __pyx_t_4 = __Pyx_PyObject_Call(__pyx_t_5, __pyx_t_8, NULL); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 600, __pyx_L1_error)\n          __Pyx_GOTREF(__pyx_t_4);\n          __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0;\n        }\n      }\n      __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n      __Pyx_Raise(__pyx_t_4, 0, 0, 0);\n      __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      __PYX_ERR(0, 600, __pyx_L1_error)\n\n      /* \"pywrapfst.pyx\":599\n *   else:\n *     result = fst.WeightClass(weight_type, weight_tostring(weight))\n *     if result.ToString() == b\"BadNumber\":             # <<<<<<<<<<<<<<\n *       raise FstBadWeightError(weight_tostring(weight))\n *   return result\n */\n    }\n  }\n  __pyx_L3:;\n\n  /* \"pywrapfst.pyx\":601\n *     if result.ToString() == b\"BadNumber\":\n *       raise FstBadWeightError(weight_tostring(weight))\n *   return result             # <<<<<<<<<<<<<<\n * \n * \n */\n  __pyx_r = __pyx_v_result;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":575\n * \n * \n * cdef fst.WeightClass _get_WeightClass_or_Zero(const string &weight_type,             # <<<<<<<<<<<<<<\n *                                               weight) except *:\n *   \"\"\"Converts weight string to a WeightClass.\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_XDECREF(__pyx_t_6);\n  __Pyx_XDECREF(__pyx_t_7);\n  __Pyx_XDECREF(__pyx_t_8);\n  __Pyx_AddTraceback(\"pywrapfst._get_WeightClass_or_Zero\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_pretend_to_initialize(&__pyx_r);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":604\n * \n * \n * cdef fst.WeightClass _get_WeightClass_or_One(const string &weight_type,             # <<<<<<<<<<<<<<\n *                                              weight) except *:\n *   \"\"\"Converts weight string to a WeightClass.\n */\n\nstatic fst::script::WeightClass __pyx_f_9pywrapfst__get_WeightClass_or_One(std::string const &__pyx_v_weight_type, PyObject *__pyx_v_weight) {\n  fst::script::WeightClass __pyx_v_result;\n  fst::script::WeightClass __pyx_r;\n  __Pyx_RefNannyDeclarations\n  int __pyx_t_1;\n  int __pyx_t_2;\n  std::string __pyx_t_3;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  PyObject *__pyx_t_6 = NULL;\n  PyObject *__pyx_t_7 = NULL;\n  PyObject *__pyx_t_8 = NULL;\n  __Pyx_RefNannySetupContext(\"_get_WeightClass_or_One\", 0);\n\n  /* \"pywrapfst.pyx\":622\n *   \"\"\"\n *   cdef fst.WeightClass result\n *   if weight is None:             # <<<<<<<<<<<<<<\n *     result = fst.WeightClass.One(weight_type)\n *   elif isinstance(weight, Weight):\n */\n  __pyx_t_1 = (__pyx_v_weight == Py_None);\n  __pyx_t_2 = (__pyx_t_1 != 0);\n  if (__pyx_t_2) {\n\n    /* \"pywrapfst.pyx\":623\n *   cdef fst.WeightClass result\n *   if weight is None:\n *     result = fst.WeightClass.One(weight_type)             # <<<<<<<<<<<<<<\n *   elif isinstance(weight, Weight):\n *     result = deref(<fst.WeightClass *> (<Weight> weight)._weight.get())\n */\n    __pyx_v_result = fst::script::WeightClass::One(__pyx_v_weight_type);\n\n    /* \"pywrapfst.pyx\":622\n *   \"\"\"\n *   cdef fst.WeightClass result\n *   if weight is None:             # <<<<<<<<<<<<<<\n *     result = fst.WeightClass.One(weight_type)\n *   elif isinstance(weight, Weight):\n */\n    goto __pyx_L3;\n  }\n\n  /* \"pywrapfst.pyx\":624\n *   if weight is None:\n *     result = fst.WeightClass.One(weight_type)\n *   elif isinstance(weight, Weight):             # <<<<<<<<<<<<<<\n *     result = deref(<fst.WeightClass *> (<Weight> weight)._weight.get())\n *   else:\n */\n  __pyx_t_2 = __Pyx_TypeCheck(__pyx_v_weight, __pyx_ptype_9pywrapfst_Weight); \n  __pyx_t_1 = (__pyx_t_2 != 0);\n  if (__pyx_t_1) {\n\n    /* \"pywrapfst.pyx\":625\n *     result = fst.WeightClass.One(weight_type)\n *   elif isinstance(weight, Weight):\n *     result = deref(<fst.WeightClass *> (<Weight> weight)._weight.get())             # <<<<<<<<<<<<<<\n *   else:\n *     result = fst.WeightClass(weight_type, weight_tostring(weight))\n */\n    if (unlikely(__pyx_v_weight == Py_None)) {\n      PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_weight\");\n      __PYX_ERR(0, 625, __pyx_L1_error)\n    }\n    __pyx_v_result = (*((fst::script::WeightClass *)((struct __pyx_obj_9pywrapfst_Weight *)__pyx_v_weight)->_weight.get()));\n\n    /* \"pywrapfst.pyx\":624\n *   if weight is None:\n *     result = fst.WeightClass.One(weight_type)\n *   elif isinstance(weight, Weight):             # <<<<<<<<<<<<<<\n *     result = deref(<fst.WeightClass *> (<Weight> weight)._weight.get())\n *   else:\n */\n    goto __pyx_L3;\n  }\n\n  /* \"pywrapfst.pyx\":627\n *     result = deref(<fst.WeightClass *> (<Weight> weight)._weight.get())\n *   else:\n *     result = fst.WeightClass(weight_type, weight_tostring(weight))             # <<<<<<<<<<<<<<\n *     if result.ToString() == b\"BadNumber\":\n *       raise FstBadWeightError(weight_tostring(weight))\n */\n  /*else*/ {\n    __pyx_t_3 = __pyx_f_9pywrapfst_weight_tostring(__pyx_v_weight, NULL); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 627, __pyx_L1_error)\n    __pyx_v_result = fst::script::WeightClass(__pyx_v_weight_type, __pyx_t_3);\n\n    /* \"pywrapfst.pyx\":628\n *   else:\n *     result = fst.WeightClass(weight_type, weight_tostring(weight))\n *     if result.ToString() == b\"BadNumber\":             # <<<<<<<<<<<<<<\n *       raise FstBadWeightError(weight_tostring(weight))\n *   return result\n */\n    __pyx_t_1 = ((__pyx_v_result.ToString() == ((char const *)\"BadNumber\")) != 0);\n    if (unlikely(__pyx_t_1)) {\n\n      /* \"pywrapfst.pyx\":629\n *     result = fst.WeightClass(weight_type, weight_tostring(weight))\n *     if result.ToString() == b\"BadNumber\":\n *       raise FstBadWeightError(weight_tostring(weight))             # <<<<<<<<<<<<<<\n *   return result\n * \n */\n      __pyx_t_5 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstBadWeightError); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 629, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_5);\n      __pyx_t_3 = __pyx_f_9pywrapfst_weight_tostring(__pyx_v_weight, NULL); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 629, __pyx_L1_error)\n      __pyx_t_6 = __pyx_convert_PyBytes_string_to_py_std__in_string(__pyx_t_3); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 629, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_6);\n      __pyx_t_7 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_5))) {\n        __pyx_t_7 = PyMethod_GET_SELF(__pyx_t_5);\n        if (likely(__pyx_t_7)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_5);\n          __Pyx_INCREF(__pyx_t_7);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_5, function);\n        }\n      }\n      if (!__pyx_t_7) {\n        __pyx_t_4 = __Pyx_PyObject_CallOneArg(__pyx_t_5, __pyx_t_6); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 629, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n        __Pyx_GOTREF(__pyx_t_4);\n      } else {\n        #if CYTHON_FAST_PYCALL\n        if (PyFunction_Check(__pyx_t_5)) {\n          PyObject *__pyx_temp[2] = {__pyx_t_7, __pyx_t_6};\n          __pyx_t_4 = __Pyx_PyFunction_FastCall(__pyx_t_5, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 629, __pyx_L1_error)\n          __Pyx_XDECREF(__pyx_t_7); __pyx_t_7 = 0;\n          __Pyx_GOTREF(__pyx_t_4);\n          __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n        } else\n        #endif\n        #if CYTHON_FAST_PYCCALL\n        if (__Pyx_PyFastCFunction_Check(__pyx_t_5)) {\n          PyObject *__pyx_temp[2] = {__pyx_t_7, __pyx_t_6};\n          __pyx_t_4 = __Pyx_PyCFunction_FastCall(__pyx_t_5, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 629, __pyx_L1_error)\n          __Pyx_XDECREF(__pyx_t_7); __pyx_t_7 = 0;\n          __Pyx_GOTREF(__pyx_t_4);\n          __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n        } else\n        #endif\n        {\n          __pyx_t_8 = PyTuple_New(1+1); if (unlikely(!__pyx_t_8)) __PYX_ERR(0, 629, __pyx_L1_error)\n          __Pyx_GOTREF(__pyx_t_8);\n          __Pyx_GIVEREF(__pyx_t_7); PyTuple_SET_ITEM(__pyx_t_8, 0, __pyx_t_7); __pyx_t_7 = NULL;\n          __Pyx_GIVEREF(__pyx_t_6);\n          PyTuple_SET_ITEM(__pyx_t_8, 0+1, __pyx_t_6);\n          __pyx_t_6 = 0;\n          __pyx_t_4 = __Pyx_PyObject_Call(__pyx_t_5, __pyx_t_8, NULL); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 629, __pyx_L1_error)\n          __Pyx_GOTREF(__pyx_t_4);\n          __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0;\n        }\n      }\n      __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n      __Pyx_Raise(__pyx_t_4, 0, 0, 0);\n      __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      __PYX_ERR(0, 629, __pyx_L1_error)\n\n      /* \"pywrapfst.pyx\":628\n *   else:\n *     result = fst.WeightClass(weight_type, weight_tostring(weight))\n *     if result.ToString() == b\"BadNumber\":             # <<<<<<<<<<<<<<\n *       raise FstBadWeightError(weight_tostring(weight))\n *   return result\n */\n    }\n  }\n  __pyx_L3:;\n\n  /* \"pywrapfst.pyx\":630\n *     if result.ToString() == b\"BadNumber\":\n *       raise FstBadWeightError(weight_tostring(weight))\n *   return result             # <<<<<<<<<<<<<<\n * \n * \n */\n  __pyx_r = __pyx_v_result;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":604\n * \n * \n * cdef fst.WeightClass _get_WeightClass_or_One(const string &weight_type,             # <<<<<<<<<<<<<<\n *                                              weight) except *:\n *   \"\"\"Converts weight string to a WeightClass.\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_XDECREF(__pyx_t_6);\n  __Pyx_XDECREF(__pyx_t_7);\n  __Pyx_XDECREF(__pyx_t_8);\n  __Pyx_AddTraceback(\"pywrapfst._get_WeightClass_or_One\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_pretend_to_initialize(&__pyx_r);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":633\n * \n * \n * cdef Weight _Zero(weight_type):             # <<<<<<<<<<<<<<\n *   cdef Weight result = Weight.__new__(Weight)\n *   result._weight.reset(new fst.WeightClass(fst.WeightClass.Zero(\n */\n\nstatic struct __pyx_obj_9pywrapfst_Weight *__pyx_f_9pywrapfst__Zero(PyObject *__pyx_v_weight_type) {\n  struct __pyx_obj_9pywrapfst_Weight *__pyx_v_result = 0;\n  struct __pyx_obj_9pywrapfst_Weight *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  std::string __pyx_t_2;\n  int __pyx_t_3;\n  PyObject *__pyx_t_4 = NULL;\n  __Pyx_RefNannySetupContext(\"_Zero\", 0);\n\n  /* \"pywrapfst.pyx\":634\n * \n * cdef Weight _Zero(weight_type):\n *   cdef Weight result = Weight.__new__(Weight)             # <<<<<<<<<<<<<<\n *   result._weight.reset(new fst.WeightClass(fst.WeightClass.Zero(\n *       tostring(weight_type))))\n */\n  __pyx_t_1 = ((PyObject *)__pyx_tp_new_9pywrapfst_Weight(((PyTypeObject *)__pyx_ptype_9pywrapfst_Weight), __pyx_empty_tuple, NULL)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 634, __pyx_L1_error)\n  __Pyx_GOTREF(((PyObject *)__pyx_t_1));\n  __pyx_v_result = ((struct __pyx_obj_9pywrapfst_Weight *)__pyx_t_1);\n  __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":635\n * cdef Weight _Zero(weight_type):\n *   cdef Weight result = Weight.__new__(Weight)\n *   result._weight.reset(new fst.WeightClass(fst.WeightClass.Zero(             # <<<<<<<<<<<<<<\n *       tostring(weight_type))))\n *   if result._weight.get().Type() == b\"none\":\n */\n  if (unlikely(((PyObject *)__pyx_v_result) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_weight\");\n    __PYX_ERR(0, 635, __pyx_L1_error)\n  }\n\n  /* \"pywrapfst.pyx\":636\n *   cdef Weight result = Weight.__new__(Weight)\n *   result._weight.reset(new fst.WeightClass(fst.WeightClass.Zero(\n *       tostring(weight_type))))             # <<<<<<<<<<<<<<\n *   if result._weight.get().Type() == b\"none\":\n *     raise FstArgError(\"Weight type not found\")\n */\n  __pyx_t_2 = __pyx_f_9pywrapfst_tostring(__pyx_v_weight_type, NULL); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 636, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":635\n * cdef Weight _Zero(weight_type):\n *   cdef Weight result = Weight.__new__(Weight)\n *   result._weight.reset(new fst.WeightClass(fst.WeightClass.Zero(             # <<<<<<<<<<<<<<\n *       tostring(weight_type))))\n *   if result._weight.get().Type() == b\"none\":\n */\n  __pyx_v_result->_weight.reset(new fst::script::WeightClass(fst::script::WeightClass::Zero(__pyx_t_2)));\n\n  /* \"pywrapfst.pyx\":637\n *   result._weight.reset(new fst.WeightClass(fst.WeightClass.Zero(\n *       tostring(weight_type))))\n *   if result._weight.get().Type() == b\"none\":             # <<<<<<<<<<<<<<\n *     raise FstArgError(\"Weight type not found\")\n *   return result\n */\n  if (unlikely(((PyObject *)__pyx_v_result) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_weight\");\n    __PYX_ERR(0, 637, __pyx_L1_error)\n  }\n  __pyx_t_3 = ((__pyx_v_result->_weight.get()->Type() == ((char const *)\"none\")) != 0);\n  if (unlikely(__pyx_t_3)) {\n\n    /* \"pywrapfst.pyx\":638\n *       tostring(weight_type))))\n *   if result._weight.get().Type() == b\"none\":\n *     raise FstArgError(\"Weight type not found\")             # <<<<<<<<<<<<<<\n *   return result\n * \n */\n    __pyx_t_1 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstArgError); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 638, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    __pyx_t_4 = __Pyx_PyObject_Call(__pyx_t_1, __pyx_tuple__5, NULL); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 638, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_4);\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n    __Pyx_Raise(__pyx_t_4, 0, 0, 0);\n    __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n    __PYX_ERR(0, 638, __pyx_L1_error)\n\n    /* \"pywrapfst.pyx\":637\n *   result._weight.reset(new fst.WeightClass(fst.WeightClass.Zero(\n *       tostring(weight_type))))\n *   if result._weight.get().Type() == b\"none\":             # <<<<<<<<<<<<<<\n *     raise FstArgError(\"Weight type not found\")\n *   return result\n */\n  }\n\n  /* \"pywrapfst.pyx\":639\n *   if result._weight.get().Type() == b\"none\":\n *     raise FstArgError(\"Weight type not found\")\n *   return result             # <<<<<<<<<<<<<<\n * \n * \n */\n  __Pyx_XDECREF(((PyObject *)__pyx_r));\n  __Pyx_INCREF(((PyObject *)__pyx_v_result));\n  __pyx_r = __pyx_v_result;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":633\n * \n * \n * cdef Weight _Zero(weight_type):             # <<<<<<<<<<<<<<\n *   cdef Weight result = Weight.__new__(Weight)\n *   result._weight.reset(new fst.WeightClass(fst.WeightClass.Zero(\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_AddTraceback(\"pywrapfst._Zero\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XDECREF((PyObject *)__pyx_v_result);\n  __Pyx_XGIVEREF((PyObject *)__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":642\n * \n * \n * cdef Weight _One(weight_type):             # <<<<<<<<<<<<<<\n *   cdef Weight result = Weight.__new__(Weight)\n *   result._weight.reset(new fst.WeightClass(\n */\n\nstatic struct __pyx_obj_9pywrapfst_Weight *__pyx_f_9pywrapfst__One(PyObject *__pyx_v_weight_type) {\n  struct __pyx_obj_9pywrapfst_Weight *__pyx_v_result = 0;\n  struct __pyx_obj_9pywrapfst_Weight *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  std::string __pyx_t_2;\n  int __pyx_t_3;\n  PyObject *__pyx_t_4 = NULL;\n  __Pyx_RefNannySetupContext(\"_One\", 0);\n\n  /* \"pywrapfst.pyx\":643\n * \n * cdef Weight _One(weight_type):\n *   cdef Weight result = Weight.__new__(Weight)             # <<<<<<<<<<<<<<\n *   result._weight.reset(new fst.WeightClass(\n *         fst.WeightClass.One(tostring(weight_type))))\n */\n  __pyx_t_1 = ((PyObject *)__pyx_tp_new_9pywrapfst_Weight(((PyTypeObject *)__pyx_ptype_9pywrapfst_Weight), __pyx_empty_tuple, NULL)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 643, __pyx_L1_error)\n  __Pyx_GOTREF(((PyObject *)__pyx_t_1));\n  __pyx_v_result = ((struct __pyx_obj_9pywrapfst_Weight *)__pyx_t_1);\n  __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":644\n * cdef Weight _One(weight_type):\n *   cdef Weight result = Weight.__new__(Weight)\n *   result._weight.reset(new fst.WeightClass(             # <<<<<<<<<<<<<<\n *         fst.WeightClass.One(tostring(weight_type))))\n *   if result._weight.get().Type() == b\"none\":\n */\n  if (unlikely(((PyObject *)__pyx_v_result) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_weight\");\n    __PYX_ERR(0, 644, __pyx_L1_error)\n  }\n\n  /* \"pywrapfst.pyx\":645\n *   cdef Weight result = Weight.__new__(Weight)\n *   result._weight.reset(new fst.WeightClass(\n *         fst.WeightClass.One(tostring(weight_type))))             # <<<<<<<<<<<<<<\n *   if result._weight.get().Type() == b\"none\":\n *     raise FstArgError(\"Weight type not found\")\n */\n  __pyx_t_2 = __pyx_f_9pywrapfst_tostring(__pyx_v_weight_type, NULL); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 645, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":644\n * cdef Weight _One(weight_type):\n *   cdef Weight result = Weight.__new__(Weight)\n *   result._weight.reset(new fst.WeightClass(             # <<<<<<<<<<<<<<\n *         fst.WeightClass.One(tostring(weight_type))))\n *   if result._weight.get().Type() == b\"none\":\n */\n  __pyx_v_result->_weight.reset(new fst::script::WeightClass(fst::script::WeightClass::One(__pyx_t_2)));\n\n  /* \"pywrapfst.pyx\":646\n *   result._weight.reset(new fst.WeightClass(\n *         fst.WeightClass.One(tostring(weight_type))))\n *   if result._weight.get().Type() == b\"none\":             # <<<<<<<<<<<<<<\n *     raise FstArgError(\"Weight type not found\")\n *   return result\n */\n  if (unlikely(((PyObject *)__pyx_v_result) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_weight\");\n    __PYX_ERR(0, 646, __pyx_L1_error)\n  }\n  __pyx_t_3 = ((__pyx_v_result->_weight.get()->Type() == ((char const *)\"none\")) != 0);\n  if (unlikely(__pyx_t_3)) {\n\n    /* \"pywrapfst.pyx\":647\n *         fst.WeightClass.One(tostring(weight_type))))\n *   if result._weight.get().Type() == b\"none\":\n *     raise FstArgError(\"Weight type not found\")             # <<<<<<<<<<<<<<\n *   return result\n * \n */\n    __pyx_t_1 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstArgError); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 647, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    __pyx_t_4 = __Pyx_PyObject_Call(__pyx_t_1, __pyx_tuple__6, NULL); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 647, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_4);\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n    __Pyx_Raise(__pyx_t_4, 0, 0, 0);\n    __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n    __PYX_ERR(0, 647, __pyx_L1_error)\n\n    /* \"pywrapfst.pyx\":646\n *   result._weight.reset(new fst.WeightClass(\n *         fst.WeightClass.One(tostring(weight_type))))\n *   if result._weight.get().Type() == b\"none\":             # <<<<<<<<<<<<<<\n *     raise FstArgError(\"Weight type not found\")\n *   return result\n */\n  }\n\n  /* \"pywrapfst.pyx\":648\n *   if result._weight.get().Type() == b\"none\":\n *     raise FstArgError(\"Weight type not found\")\n *   return result             # <<<<<<<<<<<<<<\n * \n * \n */\n  __Pyx_XDECREF(((PyObject *)__pyx_r));\n  __Pyx_INCREF(((PyObject *)__pyx_v_result));\n  __pyx_r = __pyx_v_result;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":642\n * \n * \n * cdef Weight _One(weight_type):             # <<<<<<<<<<<<<<\n *   cdef Weight result = Weight.__new__(Weight)\n *   result._weight.reset(new fst.WeightClass(\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_AddTraceback(\"pywrapfst._One\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XDECREF((PyObject *)__pyx_v_result);\n  __Pyx_XGIVEREF((PyObject *)__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":651\n * \n * \n * cdef Weight _NoWeight(weight_type):             # <<<<<<<<<<<<<<\n *   cdef Weight result = Weight.__new__(Weight)\n *   result._weight.reset(new fst.WeightClass(\n */\n\nstatic struct __pyx_obj_9pywrapfst_Weight *__pyx_f_9pywrapfst__NoWeight(PyObject *__pyx_v_weight_type) {\n  struct __pyx_obj_9pywrapfst_Weight *__pyx_v_result = 0;\n  struct __pyx_obj_9pywrapfst_Weight *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  std::string __pyx_t_2;\n  __Pyx_RefNannySetupContext(\"_NoWeight\", 0);\n\n  /* \"pywrapfst.pyx\":652\n * \n * cdef Weight _NoWeight(weight_type):\n *   cdef Weight result = Weight.__new__(Weight)             # <<<<<<<<<<<<<<\n *   result._weight.reset(new fst.WeightClass(\n *         fst.WeightClass.NoWeight(tostring(weight_type))))\n */\n  __pyx_t_1 = ((PyObject *)__pyx_tp_new_9pywrapfst_Weight(((PyTypeObject *)__pyx_ptype_9pywrapfst_Weight), __pyx_empty_tuple, NULL)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 652, __pyx_L1_error)\n  __Pyx_GOTREF(((PyObject *)__pyx_t_1));\n  __pyx_v_result = ((struct __pyx_obj_9pywrapfst_Weight *)__pyx_t_1);\n  __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":653\n * cdef Weight _NoWeight(weight_type):\n *   cdef Weight result = Weight.__new__(Weight)\n *   result._weight.reset(new fst.WeightClass(             # <<<<<<<<<<<<<<\n *         fst.WeightClass.NoWeight(tostring(weight_type))))\n *   return result\n */\n  if (unlikely(((PyObject *)__pyx_v_result) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_weight\");\n    __PYX_ERR(0, 653, __pyx_L1_error)\n  }\n\n  /* \"pywrapfst.pyx\":654\n *   cdef Weight result = Weight.__new__(Weight)\n *   result._weight.reset(new fst.WeightClass(\n *         fst.WeightClass.NoWeight(tostring(weight_type))))             # <<<<<<<<<<<<<<\n *   return result\n * \n */\n  __pyx_t_2 = __pyx_f_9pywrapfst_tostring(__pyx_v_weight_type, NULL); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 654, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":653\n * cdef Weight _NoWeight(weight_type):\n *   cdef Weight result = Weight.__new__(Weight)\n *   result._weight.reset(new fst.WeightClass(             # <<<<<<<<<<<<<<\n *         fst.WeightClass.NoWeight(tostring(weight_type))))\n *   return result\n */\n  __pyx_v_result->_weight.reset(new fst::script::WeightClass(fst::script::WeightClass::NoWeight(__pyx_t_2)));\n\n  /* \"pywrapfst.pyx\":655\n *   result._weight.reset(new fst.WeightClass(\n *         fst.WeightClass.NoWeight(tostring(weight_type))))\n *   return result             # <<<<<<<<<<<<<<\n * \n * \n */\n  __Pyx_XDECREF(((PyObject *)__pyx_r));\n  __Pyx_INCREF(((PyObject *)__pyx_v_result));\n  __pyx_r = __pyx_v_result;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":651\n * \n * \n * cdef Weight _NoWeight(weight_type):             # <<<<<<<<<<<<<<\n *   cdef Weight result = Weight.__new__(Weight)\n *   result._weight.reset(new fst.WeightClass(\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst._NoWeight\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XDECREF((PyObject *)__pyx_v_result);\n  __Pyx_XGIVEREF((PyObject *)__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":689\n *   # Doing so will allow undefined behavior.\n * \n *   def __init__(self):             # <<<<<<<<<<<<<<\n *     raise FstDeletedConstructorError(\n *         \"Cannot construct {}\".format(self.__class__.__name__))\n */\n\n/* Python wrapper */\nstatic int __pyx_pw_9pywrapfst_12_SymbolTable_1__init__(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic int __pyx_pw_9pywrapfst_12_SymbolTable_1__init__(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  int __pyx_r;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__init__ (wrapper)\", 0);\n  if (unlikely(PyTuple_GET_SIZE(__pyx_args) > 0)) {\n    __Pyx_RaiseArgtupleInvalid(\"__init__\", 1, 0, 0, PyTuple_GET_SIZE(__pyx_args)); return -1;}\n  if (unlikely(__pyx_kwds) && unlikely(PyDict_Size(__pyx_kwds) > 0) && unlikely(!__Pyx_CheckKeywordStrings(__pyx_kwds, \"__init__\", 0))) return -1;\n  __pyx_r = __pyx_pf_9pywrapfst_12_SymbolTable___init__(((struct __pyx_obj_9pywrapfst__SymbolTable *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic int __pyx_pf_9pywrapfst_12_SymbolTable___init__(struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_self) {\n  int __pyx_r;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  PyObject *__pyx_t_6 = NULL;\n  PyObject *__pyx_t_7 = NULL;\n  __Pyx_RefNannySetupContext(\"__init__\", 0);\n\n  /* \"pywrapfst.pyx\":690\n * \n *   def __init__(self):\n *     raise FstDeletedConstructorError(             # <<<<<<<<<<<<<<\n *         \"Cannot construct {}\".format(self.__class__.__name__))\n * \n */\n  __pyx_t_2 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstDeletedConstructorError); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 690, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n\n  /* \"pywrapfst.pyx\":691\n *   def __init__(self):\n *     raise FstDeletedConstructorError(\n *         \"Cannot construct {}\".format(self.__class__.__name__))             # <<<<<<<<<<<<<<\n * \n *   def __iter__(self):\n */\n  __pyx_t_4 = __Pyx_PyObject_GetAttrStr(__pyx_kp_s_Cannot_construct, __pyx_n_s_format); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 691, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_4);\n  __pyx_t_5 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_class); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 691, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_5);\n  __pyx_t_6 = __Pyx_PyObject_GetAttrStr(__pyx_t_5, __pyx_n_s_name); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 691, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_6);\n  __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n  __pyx_t_5 = NULL;\n  if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_4))) {\n    __pyx_t_5 = PyMethod_GET_SELF(__pyx_t_4);\n    if (likely(__pyx_t_5)) {\n      PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_4);\n      __Pyx_INCREF(__pyx_t_5);\n      __Pyx_INCREF(function);\n      __Pyx_DECREF_SET(__pyx_t_4, function);\n    }\n  }\n  if (!__pyx_t_5) {\n    __pyx_t_3 = __Pyx_PyObject_CallOneArg(__pyx_t_4, __pyx_t_6); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 691, __pyx_L1_error)\n    __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n    __Pyx_GOTREF(__pyx_t_3);\n  } else {\n    #if CYTHON_FAST_PYCALL\n    if (PyFunction_Check(__pyx_t_4)) {\n      PyObject *__pyx_temp[2] = {__pyx_t_5, __pyx_t_6};\n      __pyx_t_3 = __Pyx_PyFunction_FastCall(__pyx_t_4, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 691, __pyx_L1_error)\n      __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;\n      __Pyx_GOTREF(__pyx_t_3);\n      __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n    } else\n    #endif\n    #if CYTHON_FAST_PYCCALL\n    if (__Pyx_PyFastCFunction_Check(__pyx_t_4)) {\n      PyObject *__pyx_temp[2] = {__pyx_t_5, __pyx_t_6};\n      __pyx_t_3 = __Pyx_PyCFunction_FastCall(__pyx_t_4, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 691, __pyx_L1_error)\n      __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;\n      __Pyx_GOTREF(__pyx_t_3);\n      __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n    } else\n    #endif\n    {\n      __pyx_t_7 = PyTuple_New(1+1); if (unlikely(!__pyx_t_7)) __PYX_ERR(0, 691, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_7);\n      __Pyx_GIVEREF(__pyx_t_5); PyTuple_SET_ITEM(__pyx_t_7, 0, __pyx_t_5); __pyx_t_5 = NULL;\n      __Pyx_GIVEREF(__pyx_t_6);\n      PyTuple_SET_ITEM(__pyx_t_7, 0+1, __pyx_t_6);\n      __pyx_t_6 = 0;\n      __pyx_t_3 = __Pyx_PyObject_Call(__pyx_t_4, __pyx_t_7, NULL); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 691, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_3);\n      __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0;\n    }\n  }\n  __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n  __pyx_t_4 = NULL;\n  if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_2))) {\n    __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_2);\n    if (likely(__pyx_t_4)) {\n      PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_2);\n      __Pyx_INCREF(__pyx_t_4);\n      __Pyx_INCREF(function);\n      __Pyx_DECREF_SET(__pyx_t_2, function);\n    }\n  }\n  if (!__pyx_t_4) {\n    __pyx_t_1 = __Pyx_PyObject_CallOneArg(__pyx_t_2, __pyx_t_3); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 690, __pyx_L1_error)\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    __Pyx_GOTREF(__pyx_t_1);\n  } else {\n    #if CYTHON_FAST_PYCALL\n    if (PyFunction_Check(__pyx_t_2)) {\n      PyObject *__pyx_temp[2] = {__pyx_t_4, __pyx_t_3};\n      __pyx_t_1 = __Pyx_PyFunction_FastCall(__pyx_t_2, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 690, __pyx_L1_error)\n      __Pyx_XDECREF(__pyx_t_4); __pyx_t_4 = 0;\n      __Pyx_GOTREF(__pyx_t_1);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    } else\n    #endif\n    #if CYTHON_FAST_PYCCALL\n    if (__Pyx_PyFastCFunction_Check(__pyx_t_2)) {\n      PyObject *__pyx_temp[2] = {__pyx_t_4, __pyx_t_3};\n      __pyx_t_1 = __Pyx_PyCFunction_FastCall(__pyx_t_2, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 690, __pyx_L1_error)\n      __Pyx_XDECREF(__pyx_t_4); __pyx_t_4 = 0;\n      __Pyx_GOTREF(__pyx_t_1);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    } else\n    #endif\n    {\n      __pyx_t_7 = PyTuple_New(1+1); if (unlikely(!__pyx_t_7)) __PYX_ERR(0, 690, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_7);\n      __Pyx_GIVEREF(__pyx_t_4); PyTuple_SET_ITEM(__pyx_t_7, 0, __pyx_t_4); __pyx_t_4 = NULL;\n      __Pyx_GIVEREF(__pyx_t_3);\n      PyTuple_SET_ITEM(__pyx_t_7, 0+1, __pyx_t_3);\n      __pyx_t_3 = 0;\n      __pyx_t_1 = __Pyx_PyObject_Call(__pyx_t_2, __pyx_t_7, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 690, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_1);\n      __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0;\n    }\n  }\n  __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n  __Pyx_Raise(__pyx_t_1, 0, 0, 0);\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  __PYX_ERR(0, 690, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":689\n *   # Doing so will allow undefined behavior.\n * \n *   def __init__(self):             # <<<<<<<<<<<<<<\n *     raise FstDeletedConstructorError(\n *         \"Cannot construct {}\".format(self.__class__.__name__))\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_XDECREF(__pyx_t_6);\n  __Pyx_XDECREF(__pyx_t_7);\n  __Pyx_AddTraceback(\"pywrapfst._SymbolTable.__init__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = -1;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":693\n *         \"Cannot construct {}\".format(self.__class__.__name__))\n * \n *   def __iter__(self):             # <<<<<<<<<<<<<<\n *     return SymbolTableIterator(self)\n * \n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_12_SymbolTable_3__iter__(PyObject *__pyx_v_self); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_12_SymbolTable_3__iter__(PyObject *__pyx_v_self) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__iter__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_12_SymbolTable_2__iter__(((struct __pyx_obj_9pywrapfst__SymbolTable *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_12_SymbolTable_2__iter__(struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"__iter__\", 0);\n\n  /* \"pywrapfst.pyx\":694\n * \n *   def __iter__(self):\n *     return SymbolTableIterator(self)             # <<<<<<<<<<<<<<\n * \n *   cpdef int64 available_key(self):\n */\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __Pyx_PyObject_CallOneArg(((PyObject *)__pyx_ptype_9pywrapfst_SymbolTableIterator), ((PyObject *)__pyx_v_self)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 694, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":693\n *         \"Cannot construct {}\".format(self.__class__.__name__))\n * \n *   def __iter__(self):             # <<<<<<<<<<<<<<\n *     return SymbolTableIterator(self)\n * \n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst._SymbolTable.__iter__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":696\n *     return SymbolTableIterator(self)\n * \n *   cpdef int64 available_key(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     available_key(self)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_12_SymbolTable_5available_key(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic __pyx_t_10basictypes_int64 __pyx_f_9pywrapfst_12_SymbolTable_available_key(struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_self, int __pyx_skip_dispatch) {\n  __pyx_t_10basictypes_int64 __pyx_r;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  __pyx_t_10basictypes_int64 __pyx_t_5;\n  __Pyx_RefNannySetupContext(\"available_key\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_available_key); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 696, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_12_SymbolTable_5available_key)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 696, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 696, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __pyx_t_5 = __Pyx_PyInt_As_int64_t(__pyx_t_2); if (unlikely((__pyx_t_5 == ((int64_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 696, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __pyx_r = __pyx_t_5;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":702\n *     Returns an integer indicating the next available key index in the table.\n *     \"\"\"\n *     return self._table.AvailableKey()             # <<<<<<<<<<<<<<\n * \n *   cpdef string checksum(self):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_table\");\n    __PYX_ERR(0, 702, __pyx_L1_error)\n  }\n  __pyx_r = __pyx_v_self->_table->AvailableKey();\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":696\n *     return SymbolTableIterator(self)\n * \n *   cpdef int64 available_key(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     available_key(self)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_WriteUnraisable(\"pywrapfst._SymbolTable.available_key\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_12_SymbolTable_5available_key(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_12_SymbolTable_4available_key[] = \"\\n    available_key(self)\\n\\n    Returns an integer indicating the next available key index in the table.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_12_SymbolTable_5available_key(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"available_key (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_12_SymbolTable_4available_key(((struct __pyx_obj_9pywrapfst__SymbolTable *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_12_SymbolTable_4available_key(struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"available_key\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __Pyx_PyInt_From_int64_t(__pyx_f_9pywrapfst_12_SymbolTable_available_key(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 696, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst._SymbolTable.available_key\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":704\n *     return self._table.AvailableKey()\n * \n *   cpdef string checksum(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     checksum(self)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_12_SymbolTable_7checksum(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic std::string __pyx_f_9pywrapfst_12_SymbolTable_checksum(struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_self, int __pyx_skip_dispatch) {\n  std::string __pyx_r;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  std::string __pyx_t_5;\n  __Pyx_RefNannySetupContext(\"checksum\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_checksum); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 704, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_12_SymbolTable_7checksum)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 704, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 704, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __pyx_t_5 = __pyx_convert_string_from_py_std__in_string(__pyx_t_2); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 704, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __pyx_r = __pyx_t_5;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":710\n *     Returns a string indicating the label-agnostic MD5 checksum for the table.\n *     \"\"\"\n *     return self._table.CheckSum()             # <<<<<<<<<<<<<<\n * \n *   cpdef SymbolTable copy(self):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_table\");\n    __PYX_ERR(0, 710, __pyx_L1_error)\n  }\n  __pyx_r = __pyx_v_self->_table->CheckSum();\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":704\n *     return self._table.AvailableKey()\n * \n *   cpdef string checksum(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     checksum(self)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_WriteUnraisable(\"pywrapfst._SymbolTable.checksum\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __Pyx_pretend_to_initialize(&__pyx_r);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_12_SymbolTable_7checksum(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_12_SymbolTable_6checksum[] = \"\\n    checksum(self)\\n\\n    Returns a string indicating the label-agnostic MD5 checksum for the table.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_12_SymbolTable_7checksum(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"checksum (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_12_SymbolTable_6checksum(((struct __pyx_obj_9pywrapfst__SymbolTable *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_12_SymbolTable_6checksum(struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"checksum\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __pyx_convert_PyBytes_string_to_py_std__in_string(__pyx_f_9pywrapfst_12_SymbolTable_checksum(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 704, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst._SymbolTable.checksum\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":712\n *     return self._table.CheckSum()\n * \n *   cpdef SymbolTable copy(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     copy(self)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_12_SymbolTable_9copy(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic struct __pyx_obj_9pywrapfst_SymbolTable *__pyx_f_9pywrapfst_12_SymbolTable_copy(struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_self, int __pyx_skip_dispatch) {\n  struct __pyx_obj_9pywrapfst_SymbolTable *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  __Pyx_RefNannySetupContext(\"copy\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_copy); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 712, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_12_SymbolTable_9copy)) {\n      __Pyx_XDECREF(((PyObject *)__pyx_r));\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 712, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 712, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      if (!(likely(((__pyx_t_2) == Py_None) || likely(__Pyx_TypeTest(__pyx_t_2, __pyx_ptype_9pywrapfst_SymbolTable))))) __PYX_ERR(0, 712, __pyx_L1_error)\n      __pyx_r = ((struct __pyx_obj_9pywrapfst_SymbolTable *)__pyx_t_2);\n      __pyx_t_2 = 0;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":718\n *     Returns a mutable copy of the SymbolTable.\n *     \"\"\"\n *     return _init_SymbolTable(self._table.Copy())             # <<<<<<<<<<<<<<\n * \n *   def find(self, key):\n */\n  __Pyx_XDECREF(((PyObject *)__pyx_r));\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_table\");\n    __PYX_ERR(0, 718, __pyx_L1_error)\n  }\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst__init_SymbolTable(__pyx_v_self->_table->Copy())); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 718, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = ((struct __pyx_obj_9pywrapfst_SymbolTable *)__pyx_t_1);\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":712\n *     return self._table.CheckSum()\n * \n *   cpdef SymbolTable copy(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     copy(self)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_AddTraceback(\"pywrapfst._SymbolTable.copy\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XGIVEREF((PyObject *)__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_12_SymbolTable_9copy(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_12_SymbolTable_8copy[] = \"\\n    copy(self)\\n\\n    Returns a mutable copy of the SymbolTable.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_12_SymbolTable_9copy(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"copy (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_12_SymbolTable_8copy(((struct __pyx_obj_9pywrapfst__SymbolTable *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_12_SymbolTable_8copy(struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"copy\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst_12_SymbolTable_copy(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 712, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst._SymbolTable.copy\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":720\n *     return _init_SymbolTable(self._table.Copy())\n * \n *   def find(self, key):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     find(self, key)\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_12_SymbolTable_11find(PyObject *__pyx_v_self, PyObject *__pyx_v_key); /*proto*/\nstatic char __pyx_doc_9pywrapfst_12_SymbolTable_10find[] = \"\\n    find(self, key)\\n\\n    Given a symbol or index, finds the other one.\\n\\n    This method returns the index associated with a symbol key, or the symbol\\n    associated with a index key.\\n\\n    Args:\\n      key: Either a string or an index.\\n\\n    Returns:\\n      If the key is a string, the associated index or NO_LABEL if not found; if\\n          the key is an integer, the associated symbol or an empty string if\\n          not found.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_12_SymbolTable_11find(PyObject *__pyx_v_self, PyObject *__pyx_v_key) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"find (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_12_SymbolTable_10find(((struct __pyx_obj_9pywrapfst__SymbolTable *)__pyx_v_self), ((PyObject *)__pyx_v_key));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_12_SymbolTable_10find(struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_self, PyObject *__pyx_v_key) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  std::string __pyx_t_4;\n  PyObject *__pyx_t_5 = NULL;\n  PyObject *__pyx_t_6 = NULL;\n  PyObject *__pyx_t_7 = NULL;\n  PyObject *__pyx_t_8 = NULL;\n  int __pyx_t_9;\n  __pyx_t_10basictypes_int64 __pyx_t_10;\n  __Pyx_RefNannySetupContext(\"find\", 0);\n\n  /* \"pywrapfst.pyx\":737\n *           not found.\n *     \"\"\"\n *     try:             # <<<<<<<<<<<<<<\n *       return self._table.FindIndex(tostring(key))\n *     except FstArgError:\n */\n  {\n    __Pyx_PyThreadState_declare\n    __Pyx_PyThreadState_assign\n    __Pyx_ExceptionSave(&__pyx_t_1, &__pyx_t_2, &__pyx_t_3);\n    __Pyx_XGOTREF(__pyx_t_1);\n    __Pyx_XGOTREF(__pyx_t_2);\n    __Pyx_XGOTREF(__pyx_t_3);\n    /*try:*/ {\n\n      /* \"pywrapfst.pyx\":738\n *     \"\"\"\n *     try:\n *       return self._table.FindIndex(tostring(key))             # <<<<<<<<<<<<<<\n *     except FstArgError:\n *       return self._table.FindSymbol(key)\n */\n      __Pyx_XDECREF(__pyx_r);\n      if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n        PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_table\");\n        __PYX_ERR(0, 738, __pyx_L3_error)\n      }\n      __pyx_t_4 = __pyx_f_9pywrapfst_tostring(__pyx_v_key, NULL); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 738, __pyx_L3_error)\n      __pyx_t_5 = __Pyx_PyInt_From_int64_t(__pyx_v_self->_table->Find(__pyx_t_4)); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 738, __pyx_L3_error)\n      __Pyx_GOTREF(__pyx_t_5);\n      __pyx_r = __pyx_t_5;\n      __pyx_t_5 = 0;\n      goto __pyx_L7_try_return;\n\n      /* \"pywrapfst.pyx\":737\n *           not found.\n *     \"\"\"\n *     try:             # <<<<<<<<<<<<<<\n *       return self._table.FindIndex(tostring(key))\n *     except FstArgError:\n */\n    }\n    __pyx_L3_error:;\n    __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;\n\n    /* \"pywrapfst.pyx\":739\n *     try:\n *       return self._table.FindIndex(tostring(key))\n *     except FstArgError:             # <<<<<<<<<<<<<<\n *       return self._table.FindSymbol(key)\n * \n */\n    __Pyx_ErrFetch(&__pyx_t_5, &__pyx_t_6, &__pyx_t_7);\n    __pyx_t_8 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstArgError); if (unlikely(!__pyx_t_8)) __PYX_ERR(0, 739, __pyx_L5_except_error)\n    __Pyx_GOTREF(__pyx_t_8);\n    __pyx_t_9 = __Pyx_PyErr_GivenExceptionMatches(__pyx_t_5, __pyx_t_8);\n    __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0;\n    __Pyx_ErrRestore(__pyx_t_5, __pyx_t_6, __pyx_t_7);\n    __pyx_t_5 = 0; __pyx_t_6 = 0; __pyx_t_7 = 0;\n    if (__pyx_t_9) {\n      __Pyx_AddTraceback(\"pywrapfst._SymbolTable.find\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n      if (__Pyx_GetException(&__pyx_t_7, &__pyx_t_6, &__pyx_t_5) < 0) __PYX_ERR(0, 739, __pyx_L5_except_error)\n      __Pyx_GOTREF(__pyx_t_7);\n      __Pyx_GOTREF(__pyx_t_6);\n      __Pyx_GOTREF(__pyx_t_5);\n\n      /* \"pywrapfst.pyx\":740\n *       return self._table.FindIndex(tostring(key))\n *     except FstArgError:\n *       return self._table.FindSymbol(key)             # <<<<<<<<<<<<<<\n * \n *   cpdef int64 get_nth_key(self, ssize_t pos) except *:\n */\n      __Pyx_XDECREF(__pyx_r);\n      if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n        PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_table\");\n        __PYX_ERR(0, 740, __pyx_L5_except_error)\n      }\n      __pyx_t_10 = __Pyx_PyInt_As_int64_t(__pyx_v_key); if (unlikely((__pyx_t_10 == ((int64_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 740, __pyx_L5_except_error)\n      __pyx_t_8 = __pyx_convert_PyBytes_string_to_py_std__in_string(__pyx_v_self->_table->Find(__pyx_t_10)); if (unlikely(!__pyx_t_8)) __PYX_ERR(0, 740, __pyx_L5_except_error)\n      __Pyx_GOTREF(__pyx_t_8);\n      __pyx_r = __pyx_t_8;\n      __pyx_t_8 = 0;\n      __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n      __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n      __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0;\n      goto __pyx_L6_except_return;\n    }\n    goto __pyx_L5_except_error;\n    __pyx_L5_except_error:;\n\n    /* \"pywrapfst.pyx\":737\n *           not found.\n *     \"\"\"\n *     try:             # <<<<<<<<<<<<<<\n *       return self._table.FindIndex(tostring(key))\n *     except FstArgError:\n */\n    __Pyx_XGIVEREF(__pyx_t_1);\n    __Pyx_XGIVEREF(__pyx_t_2);\n    __Pyx_XGIVEREF(__pyx_t_3);\n    __Pyx_ExceptionReset(__pyx_t_1, __pyx_t_2, __pyx_t_3);\n    goto __pyx_L1_error;\n    __pyx_L7_try_return:;\n    __Pyx_XGIVEREF(__pyx_t_1);\n    __Pyx_XGIVEREF(__pyx_t_2);\n    __Pyx_XGIVEREF(__pyx_t_3);\n    __Pyx_ExceptionReset(__pyx_t_1, __pyx_t_2, __pyx_t_3);\n    goto __pyx_L0;\n    __pyx_L6_except_return:;\n    __Pyx_XGIVEREF(__pyx_t_1);\n    __Pyx_XGIVEREF(__pyx_t_2);\n    __Pyx_XGIVEREF(__pyx_t_3);\n    __Pyx_ExceptionReset(__pyx_t_1, __pyx_t_2, __pyx_t_3);\n    goto __pyx_L0;\n  }\n\n  /* \"pywrapfst.pyx\":720\n *     return _init_SymbolTable(self._table.Copy())\n * \n *   def find(self, key):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     find(self, key)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_XDECREF(__pyx_t_6);\n  __Pyx_XDECREF(__pyx_t_7);\n  __Pyx_XDECREF(__pyx_t_8);\n  __Pyx_AddTraceback(\"pywrapfst._SymbolTable.find\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":742\n *       return self._table.FindSymbol(key)\n * \n *   cpdef int64 get_nth_key(self, ssize_t pos) except *:             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     get_nth_key(self, pos)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_12_SymbolTable_13get_nth_key(PyObject *__pyx_v_self, PyObject *__pyx_arg_pos); /*proto*/\nstatic __pyx_t_10basictypes_int64 __pyx_f_9pywrapfst_12_SymbolTable_get_nth_key(struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_self, Py_ssize_t __pyx_v_pos, int __pyx_skip_dispatch) {\n  __pyx_t_10basictypes_int64 __pyx_r;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  PyObject *__pyx_t_6 = NULL;\n  __pyx_t_10basictypes_int64 __pyx_t_7;\n  __Pyx_RefNannySetupContext(\"get_nth_key\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_get_nth_key); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 742, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_12_SymbolTable_13get_nth_key)) {\n      __pyx_t_3 = PyInt_FromSsize_t(__pyx_v_pos); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 742, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_3);\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_4 = __pyx_t_1; __pyx_t_5 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_4))) {\n        __pyx_t_5 = PyMethod_GET_SELF(__pyx_t_4);\n        if (likely(__pyx_t_5)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_4);\n          __Pyx_INCREF(__pyx_t_5);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_4, function);\n        }\n      }\n      if (!__pyx_t_5) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_4, __pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 742, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n        __Pyx_GOTREF(__pyx_t_2);\n      } else {\n        #if CYTHON_FAST_PYCALL\n        if (PyFunction_Check(__pyx_t_4)) {\n          PyObject *__pyx_temp[2] = {__pyx_t_5, __pyx_t_3};\n          __pyx_t_2 = __Pyx_PyFunction_FastCall(__pyx_t_4, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 742, __pyx_L1_error)\n          __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;\n          __Pyx_GOTREF(__pyx_t_2);\n          __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n        } else\n        #endif\n        #if CYTHON_FAST_PYCCALL\n        if (__Pyx_PyFastCFunction_Check(__pyx_t_4)) {\n          PyObject *__pyx_temp[2] = {__pyx_t_5, __pyx_t_3};\n          __pyx_t_2 = __Pyx_PyCFunction_FastCall(__pyx_t_4, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 742, __pyx_L1_error)\n          __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;\n          __Pyx_GOTREF(__pyx_t_2);\n          __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n        } else\n        #endif\n        {\n          __pyx_t_6 = PyTuple_New(1+1); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 742, __pyx_L1_error)\n          __Pyx_GOTREF(__pyx_t_6);\n          __Pyx_GIVEREF(__pyx_t_5); PyTuple_SET_ITEM(__pyx_t_6, 0, __pyx_t_5); __pyx_t_5 = NULL;\n          __Pyx_GIVEREF(__pyx_t_3);\n          PyTuple_SET_ITEM(__pyx_t_6, 0+1, __pyx_t_3);\n          __pyx_t_3 = 0;\n          __pyx_t_2 = __Pyx_PyObject_Call(__pyx_t_4, __pyx_t_6, NULL); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 742, __pyx_L1_error)\n          __Pyx_GOTREF(__pyx_t_2);\n          __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n        }\n      }\n      __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      __pyx_t_7 = __Pyx_PyInt_As_int64_t(__pyx_t_2); if (unlikely((__pyx_t_7 == ((int64_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 742, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __pyx_r = __pyx_t_7;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":754\n *       The integer index of the n-th key, or NO_LABEL if not found.\n *     \"\"\"\n *     return self._table.GetNthKey(pos)             # <<<<<<<<<<<<<<\n * \n *   cpdef string labeled_checksum(self):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_table\");\n    __PYX_ERR(0, 754, __pyx_L1_error)\n  }\n  __pyx_r = __pyx_v_self->_table->GetNthKey(__pyx_v_pos);\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":742\n *       return self._table.FindSymbol(key)\n * \n *   cpdef int64 get_nth_key(self, ssize_t pos) except *:             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     get_nth_key(self, pos)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_XDECREF(__pyx_t_6);\n  __Pyx_AddTraceback(\"pywrapfst._SymbolTable.get_nth_key\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_12_SymbolTable_13get_nth_key(PyObject *__pyx_v_self, PyObject *__pyx_arg_pos); /*proto*/\nstatic char __pyx_doc_9pywrapfst_12_SymbolTable_12get_nth_key[] = \"\\n    get_nth_key(self, pos)\\n\\n    Retrieves the integer index of the n-th key in the table.\\n\\n    Args:\\n      pos: The n-th key to retrieve.\\n\\n    Returns:\\n      The integer index of the n-th key, or NO_LABEL if not found.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_12_SymbolTable_13get_nth_key(PyObject *__pyx_v_self, PyObject *__pyx_arg_pos) {\n  Py_ssize_t __pyx_v_pos;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"get_nth_key (wrapper)\", 0);\n  assert(__pyx_arg_pos); {\n    __pyx_v_pos = PyInt_AsSsize_t(__pyx_arg_pos); if (unlikely((__pyx_v_pos == (Py_ssize_t)-1) && PyErr_Occurred())) __PYX_ERR(0, 742, __pyx_L3_error)\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst._SymbolTable.get_nth_key\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  __pyx_r = __pyx_pf_9pywrapfst_12_SymbolTable_12get_nth_key(((struct __pyx_obj_9pywrapfst__SymbolTable *)__pyx_v_self), ((Py_ssize_t)__pyx_v_pos));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_12_SymbolTable_12get_nth_key(struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_self, Py_ssize_t __pyx_v_pos) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  __pyx_t_10basictypes_int64 __pyx_t_1;\n  PyObject *__pyx_t_2 = NULL;\n  __Pyx_RefNannySetupContext(\"get_nth_key\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __pyx_f_9pywrapfst_12_SymbolTable_get_nth_key(__pyx_v_self, __pyx_v_pos, 1); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 742, __pyx_L1_error)\n  __pyx_t_2 = __Pyx_PyInt_From_int64_t(__pyx_t_1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 742, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  __pyx_r = __pyx_t_2;\n  __pyx_t_2 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_AddTraceback(\"pywrapfst._SymbolTable.get_nth_key\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":756\n *     return self._table.GetNthKey(pos)\n * \n *   cpdef string labeled_checksum(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     labeled_checksum(self)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_12_SymbolTable_15labeled_checksum(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic std::string __pyx_f_9pywrapfst_12_SymbolTable_labeled_checksum(struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_self, int __pyx_skip_dispatch) {\n  std::string __pyx_r;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  std::string __pyx_t_5;\n  __Pyx_RefNannySetupContext(\"labeled_checksum\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_labeled_checksum); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 756, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_12_SymbolTable_15labeled_checksum)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 756, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 756, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __pyx_t_5 = __pyx_convert_string_from_py_std__in_string(__pyx_t_2); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 756, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __pyx_r = __pyx_t_5;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":762\n *     Returns a string indicating the label-dependent MD5 checksum for the table.\n *     \"\"\"\n *     return self._table.LabeledCheckSum()             # <<<<<<<<<<<<<<\n * \n *   cpdef bool member(self, key):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_table\");\n    __PYX_ERR(0, 762, __pyx_L1_error)\n  }\n  __pyx_r = __pyx_v_self->_table->LabeledCheckSum();\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":756\n *     return self._table.GetNthKey(pos)\n * \n *   cpdef string labeled_checksum(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     labeled_checksum(self)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_WriteUnraisable(\"pywrapfst._SymbolTable.labeled_checksum\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __Pyx_pretend_to_initialize(&__pyx_r);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_12_SymbolTable_15labeled_checksum(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_12_SymbolTable_14labeled_checksum[] = \"\\n    labeled_checksum(self)\\n\\n    Returns a string indicating the label-dependent MD5 checksum for the table.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_12_SymbolTable_15labeled_checksum(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"labeled_checksum (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_12_SymbolTable_14labeled_checksum(((struct __pyx_obj_9pywrapfst__SymbolTable *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_12_SymbolTable_14labeled_checksum(struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"labeled_checksum\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __pyx_convert_PyBytes_string_to_py_std__in_string(__pyx_f_9pywrapfst_12_SymbolTable_labeled_checksum(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 756, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst._SymbolTable.labeled_checksum\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":764\n *     return self._table.LabeledCheckSum()\n * \n *   cpdef bool member(self, key):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     member(self, key)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_12_SymbolTable_17member(PyObject *__pyx_v_self, PyObject *__pyx_v_key); /*proto*/\nstatic bool __pyx_f_9pywrapfst_12_SymbolTable_member(struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_self, PyObject *__pyx_v_key, int __pyx_skip_dispatch) {\n  bool __pyx_r;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  bool __pyx_t_6;\n  PyObject *__pyx_t_7 = NULL;\n  PyObject *__pyx_t_8 = NULL;\n  PyObject *__pyx_t_9 = NULL;\n  std::string __pyx_t_10;\n  int __pyx_t_11;\n  __pyx_t_10basictypes_int64 __pyx_t_12;\n  __Pyx_RefNannySetupContext(\"member\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_member); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 764, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_12_SymbolTable_17member)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (!__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_v_key); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 764, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_2);\n      } else {\n        #if CYTHON_FAST_PYCALL\n        if (PyFunction_Check(__pyx_t_3)) {\n          PyObject *__pyx_temp[2] = {__pyx_t_4, __pyx_v_key};\n          __pyx_t_2 = __Pyx_PyFunction_FastCall(__pyx_t_3, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 764, __pyx_L1_error)\n          __Pyx_XDECREF(__pyx_t_4); __pyx_t_4 = 0;\n          __Pyx_GOTREF(__pyx_t_2);\n        } else\n        #endif\n        #if CYTHON_FAST_PYCCALL\n        if (__Pyx_PyFastCFunction_Check(__pyx_t_3)) {\n          PyObject *__pyx_temp[2] = {__pyx_t_4, __pyx_v_key};\n          __pyx_t_2 = __Pyx_PyCFunction_FastCall(__pyx_t_3, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 764, __pyx_L1_error)\n          __Pyx_XDECREF(__pyx_t_4); __pyx_t_4 = 0;\n          __Pyx_GOTREF(__pyx_t_2);\n        } else\n        #endif\n        {\n          __pyx_t_5 = PyTuple_New(1+1); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 764, __pyx_L1_error)\n          __Pyx_GOTREF(__pyx_t_5);\n          __Pyx_GIVEREF(__pyx_t_4); PyTuple_SET_ITEM(__pyx_t_5, 0, __pyx_t_4); __pyx_t_4 = NULL;\n          __Pyx_INCREF(__pyx_v_key);\n          __Pyx_GIVEREF(__pyx_v_key);\n          PyTuple_SET_ITEM(__pyx_t_5, 0+1, __pyx_v_key);\n          __pyx_t_2 = __Pyx_PyObject_Call(__pyx_t_3, __pyx_t_5, NULL); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 764, __pyx_L1_error)\n          __Pyx_GOTREF(__pyx_t_2);\n          __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n        }\n      }\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __pyx_t_6 = __Pyx_PyObject_IsTrue(__pyx_t_2); if (unlikely((__pyx_t_6 == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 764, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __pyx_r = __pyx_t_6;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":780\n *       Whether or not the key is present (as a string or a index) in the table.\n *     \"\"\"\n *     try:             # <<<<<<<<<<<<<<\n *       return self._table.MemberSymbol(tostring(key))\n *     except FstArgError:\n */\n  {\n    __Pyx_PyThreadState_declare\n    __Pyx_PyThreadState_assign\n    __Pyx_ExceptionSave(&__pyx_t_7, &__pyx_t_8, &__pyx_t_9);\n    __Pyx_XGOTREF(__pyx_t_7);\n    __Pyx_XGOTREF(__pyx_t_8);\n    __Pyx_XGOTREF(__pyx_t_9);\n    /*try:*/ {\n\n      /* \"pywrapfst.pyx\":781\n *     \"\"\"\n *     try:\n *       return self._table.MemberSymbol(tostring(key))             # <<<<<<<<<<<<<<\n *     except FstArgError:\n *       return self._table.MemberIndex(key)\n */\n      if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n        PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_table\");\n        __PYX_ERR(0, 781, __pyx_L3_error)\n      }\n      __pyx_t_10 = __pyx_f_9pywrapfst_tostring(__pyx_v_key, NULL); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 781, __pyx_L3_error)\n      __pyx_r = __pyx_v_self->_table->Member(__pyx_t_10);\n      goto __pyx_L7_try_return;\n\n      /* \"pywrapfst.pyx\":780\n *       Whether or not the key is present (as a string or a index) in the table.\n *     \"\"\"\n *     try:             # <<<<<<<<<<<<<<\n *       return self._table.MemberSymbol(tostring(key))\n *     except FstArgError:\n */\n    }\n    __pyx_L3_error:;\n    __Pyx_XDECREF(__pyx_t_4); __pyx_t_4 = 0;\n    __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;\n    __Pyx_XDECREF(__pyx_t_3); __pyx_t_3 = 0;\n    __Pyx_XDECREF(__pyx_t_2); __pyx_t_2 = 0;\n    __Pyx_XDECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n    /* \"pywrapfst.pyx\":782\n *     try:\n *       return self._table.MemberSymbol(tostring(key))\n *     except FstArgError:             # <<<<<<<<<<<<<<\n *       return self._table.MemberIndex(key)\n * \n */\n    __Pyx_ErrFetch(&__pyx_t_1, &__pyx_t_2, &__pyx_t_3);\n    __pyx_t_5 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstArgError); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 782, __pyx_L5_except_error)\n    __Pyx_GOTREF(__pyx_t_5);\n    __pyx_t_11 = __Pyx_PyErr_GivenExceptionMatches(__pyx_t_1, __pyx_t_5);\n    __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n    __Pyx_ErrRestore(__pyx_t_1, __pyx_t_2, __pyx_t_3);\n    __pyx_t_1 = 0; __pyx_t_2 = 0; __pyx_t_3 = 0;\n    if (__pyx_t_11) {\n      __Pyx_AddTraceback(\"pywrapfst._SymbolTable.member\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n      if (__Pyx_GetException(&__pyx_t_3, &__pyx_t_2, &__pyx_t_1) < 0) __PYX_ERR(0, 782, __pyx_L5_except_error)\n      __Pyx_GOTREF(__pyx_t_3);\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_GOTREF(__pyx_t_1);\n\n      /* \"pywrapfst.pyx\":783\n *       return self._table.MemberSymbol(tostring(key))\n *     except FstArgError:\n *       return self._table.MemberIndex(key)             # <<<<<<<<<<<<<<\n * \n *   def __contains__(self, key):\n */\n      if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n        PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_table\");\n        __PYX_ERR(0, 783, __pyx_L5_except_error)\n      }\n      __pyx_t_12 = __Pyx_PyInt_As_int64_t(__pyx_v_key); if (unlikely((__pyx_t_12 == ((int64_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 783, __pyx_L5_except_error)\n      __pyx_r = __pyx_v_self->_table->Member(__pyx_t_12);\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      goto __pyx_L6_except_return;\n    }\n    goto __pyx_L5_except_error;\n    __pyx_L5_except_error:;\n\n    /* \"pywrapfst.pyx\":780\n *       Whether or not the key is present (as a string or a index) in the table.\n *     \"\"\"\n *     try:             # <<<<<<<<<<<<<<\n *       return self._table.MemberSymbol(tostring(key))\n *     except FstArgError:\n */\n    __Pyx_XGIVEREF(__pyx_t_7);\n    __Pyx_XGIVEREF(__pyx_t_8);\n    __Pyx_XGIVEREF(__pyx_t_9);\n    __Pyx_ExceptionReset(__pyx_t_7, __pyx_t_8, __pyx_t_9);\n    goto __pyx_L1_error;\n    __pyx_L7_try_return:;\n    __Pyx_XGIVEREF(__pyx_t_7);\n    __Pyx_XGIVEREF(__pyx_t_8);\n    __Pyx_XGIVEREF(__pyx_t_9);\n    __Pyx_ExceptionReset(__pyx_t_7, __pyx_t_8, __pyx_t_9);\n    goto __pyx_L0;\n    __pyx_L6_except_return:;\n    __Pyx_XGIVEREF(__pyx_t_7);\n    __Pyx_XGIVEREF(__pyx_t_8);\n    __Pyx_XGIVEREF(__pyx_t_9);\n    __Pyx_ExceptionReset(__pyx_t_7, __pyx_t_8, __pyx_t_9);\n    goto __pyx_L0;\n  }\n\n  /* \"pywrapfst.pyx\":764\n *     return self._table.LabeledCheckSum()\n * \n *   cpdef bool member(self, key):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     member(self, key)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_WriteUnraisable(\"pywrapfst._SymbolTable.member\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_12_SymbolTable_17member(PyObject *__pyx_v_self, PyObject *__pyx_v_key); /*proto*/\nstatic char __pyx_doc_9pywrapfst_12_SymbolTable_16member[] = \"\\n    member(self, key)\\n\\n    Given a symbol or index, returns whether it is found in the table.\\n\\n    This method returns a boolean indicating whether the given symbol or index\\n    is present in the table. If one intends to perform subsequent lookup, it is\\n    better to simply call the find method, catching the KeyError.\\n\\n    Args:\\n      key: Either a string or an index.\\n\\n    Returns:\\n      Whether or not the key is present (as a string or a index) in the table.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_12_SymbolTable_17member(PyObject *__pyx_v_self, PyObject *__pyx_v_key) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"member (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_12_SymbolTable_16member(((struct __pyx_obj_9pywrapfst__SymbolTable *)__pyx_v_self), ((PyObject *)__pyx_v_key));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_12_SymbolTable_16member(struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_self, PyObject *__pyx_v_key) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"member\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __Pyx_PyBool_FromLong(__pyx_f_9pywrapfst_12_SymbolTable_member(__pyx_v_self, __pyx_v_key, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 764, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst._SymbolTable.member\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":785\n *       return self._table.MemberIndex(key)\n * \n *   def __contains__(self, key):             # <<<<<<<<<<<<<<\n *     return self.member(key)\n * \n */\n\n/* Python wrapper */\nstatic int __pyx_pw_9pywrapfst_12_SymbolTable_19__contains__(PyObject *__pyx_v_self, PyObject *__pyx_v_key); /*proto*/\nstatic int __pyx_pw_9pywrapfst_12_SymbolTable_19__contains__(PyObject *__pyx_v_self, PyObject *__pyx_v_key) {\n  int __pyx_r;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__contains__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_12_SymbolTable_18__contains__(((struct __pyx_obj_9pywrapfst__SymbolTable *)__pyx_v_self), ((PyObject *)__pyx_v_key));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic int __pyx_pf_9pywrapfst_12_SymbolTable_18__contains__(struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_self, PyObject *__pyx_v_key) {\n  int __pyx_r;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__contains__\", 0);\n\n  /* \"pywrapfst.pyx\":786\n * \n *   def __contains__(self, key):\n *     return self.member(key)             # <<<<<<<<<<<<<<\n * \n *   cpdef string name(self):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"member\");\n    __PYX_ERR(0, 786, __pyx_L1_error)\n  }\n  __pyx_r = ((struct __pyx_vtabstruct_9pywrapfst__SymbolTable *)__pyx_v_self->__pyx_vtab)->member(__pyx_v_self, __pyx_v_key, 0);\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":785\n *       return self._table.MemberIndex(key)\n * \n *   def __contains__(self, key):             # <<<<<<<<<<<<<<\n *     return self.member(key)\n * \n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"pywrapfst._SymbolTable.__contains__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = -1;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":788\n *     return self.member(key)\n * \n *   cpdef string name(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     name(self)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_12_SymbolTable_21name(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic std::string __pyx_f_9pywrapfst_12_SymbolTable_name(struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_self, int __pyx_skip_dispatch) {\n  std::string __pyx_r;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  std::string __pyx_t_5;\n  __Pyx_RefNannySetupContext(\"name\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_name_2); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 788, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_12_SymbolTable_21name)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 788, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 788, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __pyx_t_5 = __pyx_convert_string_from_py_std__in_string(__pyx_t_2); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 788, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __pyx_r = __pyx_t_5;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":794\n *     Returns the symbol table's name.\n *     \"\"\"\n *     return self._table.Name()             # <<<<<<<<<<<<<<\n * \n *   cpdef size_t num_symbols(self):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_table\");\n    __PYX_ERR(0, 794, __pyx_L1_error)\n  }\n  __pyx_r = __pyx_v_self->_table->Name();\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":788\n *     return self.member(key)\n * \n *   cpdef string name(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     name(self)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_WriteUnraisable(\"pywrapfst._SymbolTable.name\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __Pyx_pretend_to_initialize(&__pyx_r);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_12_SymbolTable_21name(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_12_SymbolTable_20name[] = \"\\n    name(self)\\n\\n    Returns the symbol table's name.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_12_SymbolTable_21name(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"name (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_12_SymbolTable_20name(((struct __pyx_obj_9pywrapfst__SymbolTable *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_12_SymbolTable_20name(struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"name\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __pyx_convert_PyBytes_string_to_py_std__in_string(__pyx_f_9pywrapfst_12_SymbolTable_name(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 788, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst._SymbolTable.name\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":796\n *     return self._table.Name()\n * \n *   cpdef size_t num_symbols(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     num_symbols(self)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_12_SymbolTable_23num_symbols(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic size_t __pyx_f_9pywrapfst_12_SymbolTable_num_symbols(struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_self, int __pyx_skip_dispatch) {\n  size_t __pyx_r;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  size_t __pyx_t_5;\n  __Pyx_RefNannySetupContext(\"num_symbols\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_num_symbols); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 796, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_12_SymbolTable_23num_symbols)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 796, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 796, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __pyx_t_5 = __Pyx_PyInt_As_size_t(__pyx_t_2); if (unlikely((__pyx_t_5 == (size_t)-1) && PyErr_Occurred())) __PYX_ERR(0, 796, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __pyx_r = __pyx_t_5;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":802\n *     Returns the number of symbols in the symbol table.\n *     \"\"\"\n *     return self._table.NumSymbols()             # <<<<<<<<<<<<<<\n * \n *   cpdef void write(self, filename) except *:\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_table\");\n    __PYX_ERR(0, 802, __pyx_L1_error)\n  }\n  __pyx_r = __pyx_v_self->_table->NumSymbols();\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":796\n *     return self._table.Name()\n * \n *   cpdef size_t num_symbols(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     num_symbols(self)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_WriteUnraisable(\"pywrapfst._SymbolTable.num_symbols\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_12_SymbolTable_23num_symbols(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_12_SymbolTable_22num_symbols[] = \"\\n    num_symbols(self)\\n\\n    Returns the number of symbols in the symbol table.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_12_SymbolTable_23num_symbols(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"num_symbols (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_12_SymbolTable_22num_symbols(((struct __pyx_obj_9pywrapfst__SymbolTable *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_12_SymbolTable_22num_symbols(struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"num_symbols\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __Pyx_PyInt_FromSize_t(__pyx_f_9pywrapfst_12_SymbolTable_num_symbols(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 796, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst._SymbolTable.num_symbols\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":804\n *     return self._table.NumSymbols()\n * \n *   cpdef void write(self, filename) except *:             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     write(self, filename)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_12_SymbolTable_25write(PyObject *__pyx_v_self, PyObject *__pyx_v_filename); /*proto*/\nstatic void __pyx_f_9pywrapfst_12_SymbolTable_write(struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_self, PyObject *__pyx_v_filename, int __pyx_skip_dispatch) {\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  std::string __pyx_t_6;\n  int __pyx_t_7;\n  PyObject *__pyx_t_8 = NULL;\n  __Pyx_RefNannySetupContext(\"write\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_write); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 804, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_12_SymbolTable_25write)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (!__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_v_filename); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 804, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_2);\n      } else {\n        #if CYTHON_FAST_PYCALL\n        if (PyFunction_Check(__pyx_t_3)) {\n          PyObject *__pyx_temp[2] = {__pyx_t_4, __pyx_v_filename};\n          __pyx_t_2 = __Pyx_PyFunction_FastCall(__pyx_t_3, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 804, __pyx_L1_error)\n          __Pyx_XDECREF(__pyx_t_4); __pyx_t_4 = 0;\n          __Pyx_GOTREF(__pyx_t_2);\n        } else\n        #endif\n        #if CYTHON_FAST_PYCCALL\n        if (__Pyx_PyFastCFunction_Check(__pyx_t_3)) {\n          PyObject *__pyx_temp[2] = {__pyx_t_4, __pyx_v_filename};\n          __pyx_t_2 = __Pyx_PyCFunction_FastCall(__pyx_t_3, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 804, __pyx_L1_error)\n          __Pyx_XDECREF(__pyx_t_4); __pyx_t_4 = 0;\n          __Pyx_GOTREF(__pyx_t_2);\n        } else\n        #endif\n        {\n          __pyx_t_5 = PyTuple_New(1+1); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 804, __pyx_L1_error)\n          __Pyx_GOTREF(__pyx_t_5);\n          __Pyx_GIVEREF(__pyx_t_4); PyTuple_SET_ITEM(__pyx_t_5, 0, __pyx_t_4); __pyx_t_4 = NULL;\n          __Pyx_INCREF(__pyx_v_filename);\n          __Pyx_GIVEREF(__pyx_v_filename);\n          PyTuple_SET_ITEM(__pyx_t_5, 0+1, __pyx_v_filename);\n          __pyx_t_2 = __Pyx_PyObject_Call(__pyx_t_3, __pyx_t_5, NULL); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 804, __pyx_L1_error)\n          __Pyx_GOTREF(__pyx_t_2);\n          __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n        }\n      }\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":818\n *       FstIOError: Write failed.\n *     \"\"\"\n *     if not self._table.Write(tostring(filename)):             # <<<<<<<<<<<<<<\n *       raise FstIOError(\"Write failed: {!r}\".format(filename))\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_table\");\n    __PYX_ERR(0, 818, __pyx_L1_error)\n  }\n  __pyx_t_6 = __pyx_f_9pywrapfst_tostring(__pyx_v_filename, NULL); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 818, __pyx_L1_error)\n  __pyx_t_7 = ((!(__pyx_v_self->_table->Write(__pyx_t_6) != 0)) != 0);\n  if (unlikely(__pyx_t_7)) {\n\n    /* \"pywrapfst.pyx\":819\n *     \"\"\"\n *     if not self._table.Write(tostring(filename)):\n *       raise FstIOError(\"Write failed: {!r}\".format(filename))             # <<<<<<<<<<<<<<\n * \n *   cpdef void write_text(self, filename) except *:\n */\n    __pyx_t_2 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstIOError); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 819, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_2);\n    __pyx_t_5 = __Pyx_PyObject_GetAttrStr(__pyx_kp_s_Write_failed_r, __pyx_n_s_format); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 819, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_5);\n    __pyx_t_4 = NULL;\n    if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_5))) {\n      __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_5);\n      if (likely(__pyx_t_4)) {\n        PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_5);\n        __Pyx_INCREF(__pyx_t_4);\n        __Pyx_INCREF(function);\n        __Pyx_DECREF_SET(__pyx_t_5, function);\n      }\n    }\n    if (!__pyx_t_4) {\n      __pyx_t_3 = __Pyx_PyObject_CallOneArg(__pyx_t_5, __pyx_v_filename); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 819, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_3);\n    } else {\n      #if CYTHON_FAST_PYCALL\n      if (PyFunction_Check(__pyx_t_5)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_4, __pyx_v_filename};\n        __pyx_t_3 = __Pyx_PyFunction_FastCall(__pyx_t_5, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 819, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_4); __pyx_t_4 = 0;\n        __Pyx_GOTREF(__pyx_t_3);\n      } else\n      #endif\n      #if CYTHON_FAST_PYCCALL\n      if (__Pyx_PyFastCFunction_Check(__pyx_t_5)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_4, __pyx_v_filename};\n        __pyx_t_3 = __Pyx_PyCFunction_FastCall(__pyx_t_5, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 819, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_4); __pyx_t_4 = 0;\n        __Pyx_GOTREF(__pyx_t_3);\n      } else\n      #endif\n      {\n        __pyx_t_8 = PyTuple_New(1+1); if (unlikely(!__pyx_t_8)) __PYX_ERR(0, 819, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_8);\n        __Pyx_GIVEREF(__pyx_t_4); PyTuple_SET_ITEM(__pyx_t_8, 0, __pyx_t_4); __pyx_t_4 = NULL;\n        __Pyx_INCREF(__pyx_v_filename);\n        __Pyx_GIVEREF(__pyx_v_filename);\n        PyTuple_SET_ITEM(__pyx_t_8, 0+1, __pyx_v_filename);\n        __pyx_t_3 = __Pyx_PyObject_Call(__pyx_t_5, __pyx_t_8, NULL); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 819, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_3);\n        __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0;\n      }\n    }\n    __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n    __pyx_t_5 = NULL;\n    if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_2))) {\n      __pyx_t_5 = PyMethod_GET_SELF(__pyx_t_2);\n      if (likely(__pyx_t_5)) {\n        PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_2);\n        __Pyx_INCREF(__pyx_t_5);\n        __Pyx_INCREF(function);\n        __Pyx_DECREF_SET(__pyx_t_2, function);\n      }\n    }\n    if (!__pyx_t_5) {\n      __pyx_t_1 = __Pyx_PyObject_CallOneArg(__pyx_t_2, __pyx_t_3); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 819, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __Pyx_GOTREF(__pyx_t_1);\n    } else {\n      #if CYTHON_FAST_PYCALL\n      if (PyFunction_Check(__pyx_t_2)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_5, __pyx_t_3};\n        __pyx_t_1 = __Pyx_PyFunction_FastCall(__pyx_t_2, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 819, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;\n        __Pyx_GOTREF(__pyx_t_1);\n        __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      } else\n      #endif\n      #if CYTHON_FAST_PYCCALL\n      if (__Pyx_PyFastCFunction_Check(__pyx_t_2)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_5, __pyx_t_3};\n        __pyx_t_1 = __Pyx_PyCFunction_FastCall(__pyx_t_2, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 819, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;\n        __Pyx_GOTREF(__pyx_t_1);\n        __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      } else\n      #endif\n      {\n        __pyx_t_8 = PyTuple_New(1+1); if (unlikely(!__pyx_t_8)) __PYX_ERR(0, 819, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_8);\n        __Pyx_GIVEREF(__pyx_t_5); PyTuple_SET_ITEM(__pyx_t_8, 0, __pyx_t_5); __pyx_t_5 = NULL;\n        __Pyx_GIVEREF(__pyx_t_3);\n        PyTuple_SET_ITEM(__pyx_t_8, 0+1, __pyx_t_3);\n        __pyx_t_3 = 0;\n        __pyx_t_1 = __Pyx_PyObject_Call(__pyx_t_2, __pyx_t_8, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 819, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_1);\n        __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0;\n      }\n    }\n    __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n    __Pyx_Raise(__pyx_t_1, 0, 0, 0);\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n    __PYX_ERR(0, 819, __pyx_L1_error)\n\n    /* \"pywrapfst.pyx\":818\n *       FstIOError: Write failed.\n *     \"\"\"\n *     if not self._table.Write(tostring(filename)):             # <<<<<<<<<<<<<<\n *       raise FstIOError(\"Write failed: {!r}\".format(filename))\n * \n */\n  }\n\n  /* \"pywrapfst.pyx\":804\n *     return self._table.NumSymbols()\n * \n *   cpdef void write(self, filename) except *:             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     write(self, filename)\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_XDECREF(__pyx_t_8);\n  __Pyx_AddTraceback(\"pywrapfst._SymbolTable.write\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_12_SymbolTable_25write(PyObject *__pyx_v_self, PyObject *__pyx_v_filename); /*proto*/\nstatic char __pyx_doc_9pywrapfst_12_SymbolTable_24write[] = \"\\n    write(self, filename)\\n\\n    Serializes symbol table to a file.\\n\\n    This methods writes the SymbolTable to a file in binary format.\\n\\n    Args:\\n      filename: The string location of the output file.\\n\\n    Raises:\\n      FstIOError: Write failed.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_12_SymbolTable_25write(PyObject *__pyx_v_self, PyObject *__pyx_v_filename) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"write (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_12_SymbolTable_24write(((struct __pyx_obj_9pywrapfst__SymbolTable *)__pyx_v_self), ((PyObject *)__pyx_v_filename));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_12_SymbolTable_24write(struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_self, PyObject *__pyx_v_filename) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"write\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_f_9pywrapfst_12_SymbolTable_write(__pyx_v_self, __pyx_v_filename, 1); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 804, __pyx_L1_error)\n  __pyx_t_1 = __Pyx_void_to_None(NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 804, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst._SymbolTable.write\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":821\n *       raise FstIOError(\"Write failed: {!r}\".format(filename))\n * \n *   cpdef void write_text(self, filename) except *:             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     write_text(self, filename)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_12_SymbolTable_27write_text(PyObject *__pyx_v_self, PyObject *__pyx_v_filename); /*proto*/\nstatic void __pyx_f_9pywrapfst_12_SymbolTable_write_text(struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_self, PyObject *__pyx_v_filename, int __pyx_skip_dispatch) {\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  std::string __pyx_t_6;\n  int __pyx_t_7;\n  PyObject *__pyx_t_8 = NULL;\n  __Pyx_RefNannySetupContext(\"write_text\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_write_text); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 821, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_12_SymbolTable_27write_text)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (!__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_v_filename); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 821, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_2);\n      } else {\n        #if CYTHON_FAST_PYCALL\n        if (PyFunction_Check(__pyx_t_3)) {\n          PyObject *__pyx_temp[2] = {__pyx_t_4, __pyx_v_filename};\n          __pyx_t_2 = __Pyx_PyFunction_FastCall(__pyx_t_3, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 821, __pyx_L1_error)\n          __Pyx_XDECREF(__pyx_t_4); __pyx_t_4 = 0;\n          __Pyx_GOTREF(__pyx_t_2);\n        } else\n        #endif\n        #if CYTHON_FAST_PYCCALL\n        if (__Pyx_PyFastCFunction_Check(__pyx_t_3)) {\n          PyObject *__pyx_temp[2] = {__pyx_t_4, __pyx_v_filename};\n          __pyx_t_2 = __Pyx_PyCFunction_FastCall(__pyx_t_3, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 821, __pyx_L1_error)\n          __Pyx_XDECREF(__pyx_t_4); __pyx_t_4 = 0;\n          __Pyx_GOTREF(__pyx_t_2);\n        } else\n        #endif\n        {\n          __pyx_t_5 = PyTuple_New(1+1); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 821, __pyx_L1_error)\n          __Pyx_GOTREF(__pyx_t_5);\n          __Pyx_GIVEREF(__pyx_t_4); PyTuple_SET_ITEM(__pyx_t_5, 0, __pyx_t_4); __pyx_t_4 = NULL;\n          __Pyx_INCREF(__pyx_v_filename);\n          __Pyx_GIVEREF(__pyx_v_filename);\n          PyTuple_SET_ITEM(__pyx_t_5, 0+1, __pyx_v_filename);\n          __pyx_t_2 = __Pyx_PyObject_Call(__pyx_t_3, __pyx_t_5, NULL); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 821, __pyx_L1_error)\n          __Pyx_GOTREF(__pyx_t_2);\n          __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n        }\n      }\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":835\n *       FstIOError: Write failed.\n *     \"\"\"\n *     if not self._table.WriteText(tostring(filename)):             # <<<<<<<<<<<<<<\n *       raise FstIOError(\"Write failed: {!r}\".format(filename))\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_table\");\n    __PYX_ERR(0, 835, __pyx_L1_error)\n  }\n  __pyx_t_6 = __pyx_f_9pywrapfst_tostring(__pyx_v_filename, NULL); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 835, __pyx_L1_error)\n  __pyx_t_7 = ((!(__pyx_v_self->_table->WriteText(__pyx_t_6) != 0)) != 0);\n  if (unlikely(__pyx_t_7)) {\n\n    /* \"pywrapfst.pyx\":836\n *     \"\"\"\n *     if not self._table.WriteText(tostring(filename)):\n *       raise FstIOError(\"Write failed: {!r}\".format(filename))             # <<<<<<<<<<<<<<\n * \n * \n */\n    __pyx_t_2 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstIOError); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 836, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_2);\n    __pyx_t_5 = __Pyx_PyObject_GetAttrStr(__pyx_kp_s_Write_failed_r, __pyx_n_s_format); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 836, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_5);\n    __pyx_t_4 = NULL;\n    if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_5))) {\n      __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_5);\n      if (likely(__pyx_t_4)) {\n        PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_5);\n        __Pyx_INCREF(__pyx_t_4);\n        __Pyx_INCREF(function);\n        __Pyx_DECREF_SET(__pyx_t_5, function);\n      }\n    }\n    if (!__pyx_t_4) {\n      __pyx_t_3 = __Pyx_PyObject_CallOneArg(__pyx_t_5, __pyx_v_filename); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 836, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_3);\n    } else {\n      #if CYTHON_FAST_PYCALL\n      if (PyFunction_Check(__pyx_t_5)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_4, __pyx_v_filename};\n        __pyx_t_3 = __Pyx_PyFunction_FastCall(__pyx_t_5, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 836, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_4); __pyx_t_4 = 0;\n        __Pyx_GOTREF(__pyx_t_3);\n      } else\n      #endif\n      #if CYTHON_FAST_PYCCALL\n      if (__Pyx_PyFastCFunction_Check(__pyx_t_5)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_4, __pyx_v_filename};\n        __pyx_t_3 = __Pyx_PyCFunction_FastCall(__pyx_t_5, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 836, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_4); __pyx_t_4 = 0;\n        __Pyx_GOTREF(__pyx_t_3);\n      } else\n      #endif\n      {\n        __pyx_t_8 = PyTuple_New(1+1); if (unlikely(!__pyx_t_8)) __PYX_ERR(0, 836, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_8);\n        __Pyx_GIVEREF(__pyx_t_4); PyTuple_SET_ITEM(__pyx_t_8, 0, __pyx_t_4); __pyx_t_4 = NULL;\n        __Pyx_INCREF(__pyx_v_filename);\n        __Pyx_GIVEREF(__pyx_v_filename);\n        PyTuple_SET_ITEM(__pyx_t_8, 0+1, __pyx_v_filename);\n        __pyx_t_3 = __Pyx_PyObject_Call(__pyx_t_5, __pyx_t_8, NULL); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 836, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_3);\n        __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0;\n      }\n    }\n    __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n    __pyx_t_5 = NULL;\n    if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_2))) {\n      __pyx_t_5 = PyMethod_GET_SELF(__pyx_t_2);\n      if (likely(__pyx_t_5)) {\n        PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_2);\n        __Pyx_INCREF(__pyx_t_5);\n        __Pyx_INCREF(function);\n        __Pyx_DECREF_SET(__pyx_t_2, function);\n      }\n    }\n    if (!__pyx_t_5) {\n      __pyx_t_1 = __Pyx_PyObject_CallOneArg(__pyx_t_2, __pyx_t_3); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 836, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __Pyx_GOTREF(__pyx_t_1);\n    } else {\n      #if CYTHON_FAST_PYCALL\n      if (PyFunction_Check(__pyx_t_2)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_5, __pyx_t_3};\n        __pyx_t_1 = __Pyx_PyFunction_FastCall(__pyx_t_2, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 836, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;\n        __Pyx_GOTREF(__pyx_t_1);\n        __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      } else\n      #endif\n      #if CYTHON_FAST_PYCCALL\n      if (__Pyx_PyFastCFunction_Check(__pyx_t_2)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_5, __pyx_t_3};\n        __pyx_t_1 = __Pyx_PyCFunction_FastCall(__pyx_t_2, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 836, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;\n        __Pyx_GOTREF(__pyx_t_1);\n        __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      } else\n      #endif\n      {\n        __pyx_t_8 = PyTuple_New(1+1); if (unlikely(!__pyx_t_8)) __PYX_ERR(0, 836, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_8);\n        __Pyx_GIVEREF(__pyx_t_5); PyTuple_SET_ITEM(__pyx_t_8, 0, __pyx_t_5); __pyx_t_5 = NULL;\n        __Pyx_GIVEREF(__pyx_t_3);\n        PyTuple_SET_ITEM(__pyx_t_8, 0+1, __pyx_t_3);\n        __pyx_t_3 = 0;\n        __pyx_t_1 = __Pyx_PyObject_Call(__pyx_t_2, __pyx_t_8, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 836, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_1);\n        __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0;\n      }\n    }\n    __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n    __Pyx_Raise(__pyx_t_1, 0, 0, 0);\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n    __PYX_ERR(0, 836, __pyx_L1_error)\n\n    /* \"pywrapfst.pyx\":835\n *       FstIOError: Write failed.\n *     \"\"\"\n *     if not self._table.WriteText(tostring(filename)):             # <<<<<<<<<<<<<<\n *       raise FstIOError(\"Write failed: {!r}\".format(filename))\n * \n */\n  }\n\n  /* \"pywrapfst.pyx\":821\n *       raise FstIOError(\"Write failed: {!r}\".format(filename))\n * \n *   cpdef void write_text(self, filename) except *:             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     write_text(self, filename)\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_XDECREF(__pyx_t_8);\n  __Pyx_AddTraceback(\"pywrapfst._SymbolTable.write_text\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_12_SymbolTable_27write_text(PyObject *__pyx_v_self, PyObject *__pyx_v_filename); /*proto*/\nstatic char __pyx_doc_9pywrapfst_12_SymbolTable_26write_text[] = \"\\n    write_text(self, filename)\\n\\n    Writes symbol table to text file.\\n\\n    This method writes the SymbolTable to a file in human-readable format.\\n\\n    Args:\\n      filename: The string location of the output file.\\n\\n    Raises:\\n      FstIOError: Write failed.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_12_SymbolTable_27write_text(PyObject *__pyx_v_self, PyObject *__pyx_v_filename) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"write_text (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_12_SymbolTable_26write_text(((struct __pyx_obj_9pywrapfst__SymbolTable *)__pyx_v_self), ((PyObject *)__pyx_v_filename));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_12_SymbolTable_26write_text(struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_self, PyObject *__pyx_v_filename) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"write_text\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_f_9pywrapfst_12_SymbolTable_write_text(__pyx_v_self, __pyx_v_filename, 1); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 821, __pyx_L1_error)\n  __pyx_t_1 = __Pyx_void_to_None(NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 821, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst._SymbolTable.write_text\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"(tree fragment)\":1\n * def __reduce_cython__(self):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._table cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_12_SymbolTable_29__reduce_cython__(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_12_SymbolTable_29__reduce_cython__(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__reduce_cython__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_12_SymbolTable_28__reduce_cython__(((struct __pyx_obj_9pywrapfst__SymbolTable *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_12_SymbolTable_28__reduce_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"__reduce_cython__\", 0);\n\n  /* \"(tree fragment)\":2\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._table cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._table cannot be converted to a Python object for pickling\")\n */\n  __pyx_t_1 = __Pyx_PyObject_Call(__pyx_builtin_TypeError, __pyx_tuple__7, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(1, 2, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __Pyx_Raise(__pyx_t_1, 0, 0, 0);\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  __PYX_ERR(1, 2, __pyx_L1_error)\n\n  /* \"(tree fragment)\":1\n * def __reduce_cython__(self):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._table cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst._SymbolTable.__reduce_cython__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"(tree fragment)\":3\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._table cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._table cannot be converted to a Python object for pickling\")\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_12_SymbolTable_31__setstate_cython__(PyObject *__pyx_v_self, PyObject *__pyx_v___pyx_state); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_12_SymbolTable_31__setstate_cython__(PyObject *__pyx_v_self, PyObject *__pyx_v___pyx_state) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__setstate_cython__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_12_SymbolTable_30__setstate_cython__(((struct __pyx_obj_9pywrapfst__SymbolTable *)__pyx_v_self), ((PyObject *)__pyx_v___pyx_state));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_12_SymbolTable_30__setstate_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_self, CYTHON_UNUSED PyObject *__pyx_v___pyx_state) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"__setstate_cython__\", 0);\n\n  /* \"(tree fragment)\":4\n *     raise TypeError(\"self._table cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._table cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n */\n  __pyx_t_1 = __Pyx_PyObject_Call(__pyx_builtin_TypeError, __pyx_tuple__8, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(1, 4, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __Pyx_Raise(__pyx_t_1, 0, 0, 0);\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  __PYX_ERR(1, 4, __pyx_L1_error)\n\n  /* \"(tree fragment)\":3\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._table cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._table cannot be converted to a Python object for pickling\")\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst._SymbolTable.__setstate_cython__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":854\n *   # Doing so will allow undefined behavior.\n * \n *   def __repr__(self):             # <<<<<<<<<<<<<<\n *     return \"<const EncodeMapper SymbolTable {!r} at 0x{:x}>\".format(self.name(),\n *                                                                     id(self))\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_24_EncodeMapperSymbolTable_1__repr__(PyObject *__pyx_v_self); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_24_EncodeMapperSymbolTable_1__repr__(PyObject *__pyx_v_self) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__repr__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_24_EncodeMapperSymbolTable___repr__(((struct __pyx_obj_9pywrapfst__EncodeMapperSymbolTable *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_24_EncodeMapperSymbolTable___repr__(struct __pyx_obj_9pywrapfst__EncodeMapperSymbolTable *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  int __pyx_t_6;\n  PyObject *__pyx_t_7 = NULL;\n  __Pyx_RefNannySetupContext(\"__repr__\", 0);\n\n  /* \"pywrapfst.pyx\":855\n * \n *   def __repr__(self):\n *     return \"<const EncodeMapper SymbolTable {!r} at 0x{:x}>\".format(self.name(),             # <<<<<<<<<<<<<<\n *                                                                     id(self))\n * \n */\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_2 = __Pyx_PyObject_GetAttrStr(__pyx_kp_s_const_EncodeMapper_SymbolTable, __pyx_n_s_format); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 855, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"name\");\n    __PYX_ERR(0, 855, __pyx_L1_error)\n  }\n  __pyx_t_3 = __pyx_convert_PyBytes_string_to_py_std__in_string(((struct __pyx_vtabstruct_9pywrapfst__EncodeMapperSymbolTable *)__pyx_v_self->__pyx_base.__pyx_vtab)->__pyx_base.name(((struct __pyx_obj_9pywrapfst__SymbolTable *)__pyx_v_self), 0)); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 855, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_3);\n\n  /* \"pywrapfst.pyx\":856\n *   def __repr__(self):\n *     return \"<const EncodeMapper SymbolTable {!r} at 0x{:x}>\".format(self.name(),\n *                                                                     id(self))             # <<<<<<<<<<<<<<\n * \n * \n */\n  __pyx_t_4 = __Pyx_PyObject_CallOneArg(__pyx_builtin_id, ((PyObject *)__pyx_v_self)); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 856, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_4);\n  __pyx_t_5 = NULL;\n  __pyx_t_6 = 0;\n  if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_2))) {\n    __pyx_t_5 = PyMethod_GET_SELF(__pyx_t_2);\n    if (likely(__pyx_t_5)) {\n      PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_2);\n      __Pyx_INCREF(__pyx_t_5);\n      __Pyx_INCREF(function);\n      __Pyx_DECREF_SET(__pyx_t_2, function);\n      __pyx_t_6 = 1;\n    }\n  }\n  #if CYTHON_FAST_PYCALL\n  if (PyFunction_Check(__pyx_t_2)) {\n    PyObject *__pyx_temp[3] = {__pyx_t_5, __pyx_t_3, __pyx_t_4};\n    __pyx_t_1 = __Pyx_PyFunction_FastCall(__pyx_t_2, __pyx_temp+1-__pyx_t_6, 2+__pyx_t_6); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 855, __pyx_L1_error)\n    __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;\n    __Pyx_GOTREF(__pyx_t_1);\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n  } else\n  #endif\n  #if CYTHON_FAST_PYCCALL\n  if (__Pyx_PyFastCFunction_Check(__pyx_t_2)) {\n    PyObject *__pyx_temp[3] = {__pyx_t_5, __pyx_t_3, __pyx_t_4};\n    __pyx_t_1 = __Pyx_PyCFunction_FastCall(__pyx_t_2, __pyx_temp+1-__pyx_t_6, 2+__pyx_t_6); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 855, __pyx_L1_error)\n    __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;\n    __Pyx_GOTREF(__pyx_t_1);\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n  } else\n  #endif\n  {\n    __pyx_t_7 = PyTuple_New(2+__pyx_t_6); if (unlikely(!__pyx_t_7)) __PYX_ERR(0, 855, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_7);\n    if (__pyx_t_5) {\n      __Pyx_GIVEREF(__pyx_t_5); PyTuple_SET_ITEM(__pyx_t_7, 0, __pyx_t_5); __pyx_t_5 = NULL;\n    }\n    __Pyx_GIVEREF(__pyx_t_3);\n    PyTuple_SET_ITEM(__pyx_t_7, 0+__pyx_t_6, __pyx_t_3);\n    __Pyx_GIVEREF(__pyx_t_4);\n    PyTuple_SET_ITEM(__pyx_t_7, 1+__pyx_t_6, __pyx_t_4);\n    __pyx_t_3 = 0;\n    __pyx_t_4 = 0;\n    __pyx_t_1 = __Pyx_PyObject_Call(__pyx_t_2, __pyx_t_7, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 855, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0;\n  }\n  __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":854\n *   # Doing so will allow undefined behavior.\n * \n *   def __repr__(self):             # <<<<<<<<<<<<<<\n *     return \"<const EncodeMapper SymbolTable {!r} at 0x{:x}>\".format(self.name(),\n *                                                                     id(self))\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_XDECREF(__pyx_t_7);\n  __Pyx_AddTraceback(\"pywrapfst._EncodeMapperSymbolTable.__repr__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"(tree fragment)\":1\n * def __reduce_cython__(self):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._encoder,self._table cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_24_EncodeMapperSymbolTable_3__reduce_cython__(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_24_EncodeMapperSymbolTable_3__reduce_cython__(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__reduce_cython__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_24_EncodeMapperSymbolTable_2__reduce_cython__(((struct __pyx_obj_9pywrapfst__EncodeMapperSymbolTable *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_24_EncodeMapperSymbolTable_2__reduce_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst__EncodeMapperSymbolTable *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"__reduce_cython__\", 0);\n\n  /* \"(tree fragment)\":2\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._encoder,self._table cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._encoder,self._table cannot be converted to a Python object for pickling\")\n */\n  __pyx_t_1 = __Pyx_PyObject_Call(__pyx_builtin_TypeError, __pyx_tuple__9, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(1, 2, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __Pyx_Raise(__pyx_t_1, 0, 0, 0);\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  __PYX_ERR(1, 2, __pyx_L1_error)\n\n  /* \"(tree fragment)\":1\n * def __reduce_cython__(self):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._encoder,self._table cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst._EncodeMapperSymbolTable.__reduce_cython__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"(tree fragment)\":3\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._encoder,self._table cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._encoder,self._table cannot be converted to a Python object for pickling\")\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_24_EncodeMapperSymbolTable_5__setstate_cython__(PyObject *__pyx_v_self, PyObject *__pyx_v___pyx_state); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_24_EncodeMapperSymbolTable_5__setstate_cython__(PyObject *__pyx_v_self, PyObject *__pyx_v___pyx_state) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__setstate_cython__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_24_EncodeMapperSymbolTable_4__setstate_cython__(((struct __pyx_obj_9pywrapfst__EncodeMapperSymbolTable *)__pyx_v_self), ((PyObject *)__pyx_v___pyx_state));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_24_EncodeMapperSymbolTable_4__setstate_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst__EncodeMapperSymbolTable *__pyx_v_self, CYTHON_UNUSED PyObject *__pyx_v___pyx_state) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"__setstate_cython__\", 0);\n\n  /* \"(tree fragment)\":4\n *     raise TypeError(\"self._encoder,self._table cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._encoder,self._table cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n */\n  __pyx_t_1 = __Pyx_PyObject_Call(__pyx_builtin_TypeError, __pyx_tuple__10, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(1, 4, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __Pyx_Raise(__pyx_t_1, 0, 0, 0);\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  __PYX_ERR(1, 4, __pyx_L1_error)\n\n  /* \"(tree fragment)\":3\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._encoder,self._table cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._encoder,self._table cannot be converted to a Python object for pickling\")\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst._EncodeMapperSymbolTable.__setstate_cython__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":873\n *   # Doing so will allow undefined behavior.\n * \n *   def __repr__(self):             # <<<<<<<<<<<<<<\n *     return \"<const Fst SymbolTable {!r} at 0x{:x}>\".format(self.name(),\n *                                                            id(self))\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_15_FstSymbolTable_1__repr__(PyObject *__pyx_v_self); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_15_FstSymbolTable_1__repr__(PyObject *__pyx_v_self) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__repr__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_15_FstSymbolTable___repr__(((struct __pyx_obj_9pywrapfst__FstSymbolTable *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_15_FstSymbolTable___repr__(struct __pyx_obj_9pywrapfst__FstSymbolTable *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  int __pyx_t_6;\n  PyObject *__pyx_t_7 = NULL;\n  __Pyx_RefNannySetupContext(\"__repr__\", 0);\n\n  /* \"pywrapfst.pyx\":874\n * \n *   def __repr__(self):\n *     return \"<const Fst SymbolTable {!r} at 0x{:x}>\".format(self.name(),             # <<<<<<<<<<<<<<\n *                                                            id(self))\n * \n */\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_2 = __Pyx_PyObject_GetAttrStr(__pyx_kp_s_const_Fst_SymbolTable_r_at_0x_x, __pyx_n_s_format); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 874, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"name\");\n    __PYX_ERR(0, 874, __pyx_L1_error)\n  }\n  __pyx_t_3 = __pyx_convert_PyBytes_string_to_py_std__in_string(((struct __pyx_vtabstruct_9pywrapfst__FstSymbolTable *)__pyx_v_self->__pyx_base.__pyx_vtab)->__pyx_base.name(((struct __pyx_obj_9pywrapfst__SymbolTable *)__pyx_v_self), 0)); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 874, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_3);\n\n  /* \"pywrapfst.pyx\":875\n *   def __repr__(self):\n *     return \"<const Fst SymbolTable {!r} at 0x{:x}>\".format(self.name(),\n *                                                            id(self))             # <<<<<<<<<<<<<<\n * \n * \n */\n  __pyx_t_4 = __Pyx_PyObject_CallOneArg(__pyx_builtin_id, ((PyObject *)__pyx_v_self)); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 875, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_4);\n  __pyx_t_5 = NULL;\n  __pyx_t_6 = 0;\n  if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_2))) {\n    __pyx_t_5 = PyMethod_GET_SELF(__pyx_t_2);\n    if (likely(__pyx_t_5)) {\n      PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_2);\n      __Pyx_INCREF(__pyx_t_5);\n      __Pyx_INCREF(function);\n      __Pyx_DECREF_SET(__pyx_t_2, function);\n      __pyx_t_6 = 1;\n    }\n  }\n  #if CYTHON_FAST_PYCALL\n  if (PyFunction_Check(__pyx_t_2)) {\n    PyObject *__pyx_temp[3] = {__pyx_t_5, __pyx_t_3, __pyx_t_4};\n    __pyx_t_1 = __Pyx_PyFunction_FastCall(__pyx_t_2, __pyx_temp+1-__pyx_t_6, 2+__pyx_t_6); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 874, __pyx_L1_error)\n    __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;\n    __Pyx_GOTREF(__pyx_t_1);\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n  } else\n  #endif\n  #if CYTHON_FAST_PYCCALL\n  if (__Pyx_PyFastCFunction_Check(__pyx_t_2)) {\n    PyObject *__pyx_temp[3] = {__pyx_t_5, __pyx_t_3, __pyx_t_4};\n    __pyx_t_1 = __Pyx_PyCFunction_FastCall(__pyx_t_2, __pyx_temp+1-__pyx_t_6, 2+__pyx_t_6); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 874, __pyx_L1_error)\n    __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;\n    __Pyx_GOTREF(__pyx_t_1);\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n  } else\n  #endif\n  {\n    __pyx_t_7 = PyTuple_New(2+__pyx_t_6); if (unlikely(!__pyx_t_7)) __PYX_ERR(0, 874, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_7);\n    if (__pyx_t_5) {\n      __Pyx_GIVEREF(__pyx_t_5); PyTuple_SET_ITEM(__pyx_t_7, 0, __pyx_t_5); __pyx_t_5 = NULL;\n    }\n    __Pyx_GIVEREF(__pyx_t_3);\n    PyTuple_SET_ITEM(__pyx_t_7, 0+__pyx_t_6, __pyx_t_3);\n    __Pyx_GIVEREF(__pyx_t_4);\n    PyTuple_SET_ITEM(__pyx_t_7, 1+__pyx_t_6, __pyx_t_4);\n    __pyx_t_3 = 0;\n    __pyx_t_4 = 0;\n    __pyx_t_1 = __Pyx_PyObject_Call(__pyx_t_2, __pyx_t_7, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 874, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0;\n  }\n  __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":873\n *   # Doing so will allow undefined behavior.\n * \n *   def __repr__(self):             # <<<<<<<<<<<<<<\n *     return \"<const Fst SymbolTable {!r} at 0x{:x}>\".format(self.name(),\n *                                                            id(self))\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_XDECREF(__pyx_t_7);\n  __Pyx_AddTraceback(\"pywrapfst._FstSymbolTable.__repr__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"(tree fragment)\":1\n * def __reduce_cython__(self):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._fst,self._table cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_15_FstSymbolTable_3__reduce_cython__(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_15_FstSymbolTable_3__reduce_cython__(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__reduce_cython__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_15_FstSymbolTable_2__reduce_cython__(((struct __pyx_obj_9pywrapfst__FstSymbolTable *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_15_FstSymbolTable_2__reduce_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst__FstSymbolTable *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"__reduce_cython__\", 0);\n\n  /* \"(tree fragment)\":2\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._fst,self._table cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._fst,self._table cannot be converted to a Python object for pickling\")\n */\n  __pyx_t_1 = __Pyx_PyObject_Call(__pyx_builtin_TypeError, __pyx_tuple__11, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(1, 2, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __Pyx_Raise(__pyx_t_1, 0, 0, 0);\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  __PYX_ERR(1, 2, __pyx_L1_error)\n\n  /* \"(tree fragment)\":1\n * def __reduce_cython__(self):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._fst,self._table cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst._FstSymbolTable.__reduce_cython__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"(tree fragment)\":3\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._fst,self._table cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._fst,self._table cannot be converted to a Python object for pickling\")\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_15_FstSymbolTable_5__setstate_cython__(PyObject *__pyx_v_self, PyObject *__pyx_v___pyx_state); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_15_FstSymbolTable_5__setstate_cython__(PyObject *__pyx_v_self, PyObject *__pyx_v___pyx_state) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__setstate_cython__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_15_FstSymbolTable_4__setstate_cython__(((struct __pyx_obj_9pywrapfst__FstSymbolTable *)__pyx_v_self), ((PyObject *)__pyx_v___pyx_state));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_15_FstSymbolTable_4__setstate_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst__FstSymbolTable *__pyx_v_self, CYTHON_UNUSED PyObject *__pyx_v___pyx_state) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"__setstate_cython__\", 0);\n\n  /* \"(tree fragment)\":4\n *     raise TypeError(\"self._fst,self._table cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._fst,self._table cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n */\n  __pyx_t_1 = __Pyx_PyObject_Call(__pyx_builtin_TypeError, __pyx_tuple__12, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(1, 4, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __Pyx_Raise(__pyx_t_1, 0, 0, 0);\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  __PYX_ERR(1, 4, __pyx_L1_error)\n\n  /* \"(tree fragment)\":3\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._fst,self._table cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._fst,self._table cannot be converted to a Python object for pickling\")\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst._FstSymbolTable.__setstate_cython__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":889\n *   \"\"\"\n * \n *   cpdef int64 add_symbol(self, symbol, int64 key=kNoSymbol):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     add_symbol(self, symbol, key=NO_SYMBOL)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_19_MutableSymbolTable_1add_symbol(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic __pyx_t_10basictypes_int64 __pyx_f_9pywrapfst_19_MutableSymbolTable_add_symbol(struct __pyx_obj_9pywrapfst__MutableSymbolTable *__pyx_v_self, PyObject *__pyx_v_symbol, int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_19_MutableSymbolTable_add_symbol *__pyx_optional_args) {\n  __pyx_t_10basictypes_int64 __pyx_v_key = __pyx_k__13;\n  std::string __pyx_v_symbol_string;\n  __pyx_t_10basictypes_int64 __pyx_r;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  int __pyx_t_6;\n  PyObject *__pyx_t_7 = NULL;\n  __pyx_t_10basictypes_int64 __pyx_t_8;\n  std::string __pyx_t_9;\n  int __pyx_t_10;\n  __Pyx_RefNannySetupContext(\"add_symbol\", 0);\n  if (__pyx_optional_args) {\n    if (__pyx_optional_args->__pyx_n > 0) {\n      __pyx_v_key = __pyx_optional_args->key;\n    }\n  }\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_add_symbol); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 889, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_19_MutableSymbolTable_1add_symbol)) {\n      __pyx_t_3 = __Pyx_PyInt_From_int64_t(__pyx_v_key); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 889, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_3);\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_4 = __pyx_t_1; __pyx_t_5 = NULL;\n      __pyx_t_6 = 0;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_4))) {\n        __pyx_t_5 = PyMethod_GET_SELF(__pyx_t_4);\n        if (likely(__pyx_t_5)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_4);\n          __Pyx_INCREF(__pyx_t_5);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_4, function);\n          __pyx_t_6 = 1;\n        }\n      }\n      #if CYTHON_FAST_PYCALL\n      if (PyFunction_Check(__pyx_t_4)) {\n        PyObject *__pyx_temp[3] = {__pyx_t_5, __pyx_v_symbol, __pyx_t_3};\n        __pyx_t_2 = __Pyx_PyFunction_FastCall(__pyx_t_4, __pyx_temp+1-__pyx_t_6, 2+__pyx_t_6); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 889, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;\n        __Pyx_GOTREF(__pyx_t_2);\n        __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      } else\n      #endif\n      #if CYTHON_FAST_PYCCALL\n      if (__Pyx_PyFastCFunction_Check(__pyx_t_4)) {\n        PyObject *__pyx_temp[3] = {__pyx_t_5, __pyx_v_symbol, __pyx_t_3};\n        __pyx_t_2 = __Pyx_PyCFunction_FastCall(__pyx_t_4, __pyx_temp+1-__pyx_t_6, 2+__pyx_t_6); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 889, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;\n        __Pyx_GOTREF(__pyx_t_2);\n        __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      } else\n      #endif\n      {\n        __pyx_t_7 = PyTuple_New(2+__pyx_t_6); if (unlikely(!__pyx_t_7)) __PYX_ERR(0, 889, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_7);\n        if (__pyx_t_5) {\n          __Pyx_GIVEREF(__pyx_t_5); PyTuple_SET_ITEM(__pyx_t_7, 0, __pyx_t_5); __pyx_t_5 = NULL;\n        }\n        __Pyx_INCREF(__pyx_v_symbol);\n        __Pyx_GIVEREF(__pyx_v_symbol);\n        PyTuple_SET_ITEM(__pyx_t_7, 0+__pyx_t_6, __pyx_v_symbol);\n        __Pyx_GIVEREF(__pyx_t_3);\n        PyTuple_SET_ITEM(__pyx_t_7, 1+__pyx_t_6, __pyx_t_3);\n        __pyx_t_3 = 0;\n        __pyx_t_2 = __Pyx_PyObject_Call(__pyx_t_4, __pyx_t_7, NULL); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 889, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_2);\n        __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0;\n      }\n      __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      __pyx_t_8 = __Pyx_PyInt_As_int64_t(__pyx_t_2); if (unlikely((__pyx_t_8 == ((int64_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 889, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __pyx_r = __pyx_t_8;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":906\n *       The integer key of the new symbol.\n *     \"\"\"\n *     cdef string symbol_string = tostring(symbol)             # <<<<<<<<<<<<<<\n *     if key != kNoSymbol:\n *       return self._table.AddSymbol(symbol_string, key)\n */\n  __pyx_t_9 = __pyx_f_9pywrapfst_tostring(__pyx_v_symbol, NULL); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 906, __pyx_L1_error)\n  __pyx_v_symbol_string = __pyx_t_9;\n\n  /* \"pywrapfst.pyx\":907\n *     \"\"\"\n *     cdef string symbol_string = tostring(symbol)\n *     if key != kNoSymbol:             # <<<<<<<<<<<<<<\n *       return self._table.AddSymbol(symbol_string, key)\n *     else:\n */\n  __pyx_t_1 = __Pyx_PyInt_From_int64_t(__pyx_v_key); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 907, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_t_2 = __Pyx_GetModuleGlobalName(__pyx_n_s_kNoSymbol); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 907, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  __pyx_t_4 = PyObject_RichCompare(__pyx_t_1, __pyx_t_2, Py_NE); __Pyx_XGOTREF(__pyx_t_4); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 907, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n  __pyx_t_10 = __Pyx_PyObject_IsTrue(__pyx_t_4); if (unlikely(__pyx_t_10 < 0)) __PYX_ERR(0, 907, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n  if (__pyx_t_10) {\n\n    /* \"pywrapfst.pyx\":908\n *     cdef string symbol_string = tostring(symbol)\n *     if key != kNoSymbol:\n *       return self._table.AddSymbol(symbol_string, key)             # <<<<<<<<<<<<<<\n *     else:\n *       return self._table.AddSymbol(symbol_string)\n */\n    if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n      PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_table\");\n      __PYX_ERR(0, 908, __pyx_L1_error)\n    }\n    __pyx_r = __pyx_v_self->__pyx_base._table->AddSymbol(__pyx_v_symbol_string, __pyx_v_key);\n    goto __pyx_L0;\n\n    /* \"pywrapfst.pyx\":907\n *     \"\"\"\n *     cdef string symbol_string = tostring(symbol)\n *     if key != kNoSymbol:             # <<<<<<<<<<<<<<\n *       return self._table.AddSymbol(symbol_string, key)\n *     else:\n */\n  }\n\n  /* \"pywrapfst.pyx\":910\n *       return self._table.AddSymbol(symbol_string, key)\n *     else:\n *       return self._table.AddSymbol(symbol_string)             # <<<<<<<<<<<<<<\n * \n *   cpdef void add_table(self, _SymbolTable syms):\n */\n  /*else*/ {\n    if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n      PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_table\");\n      __PYX_ERR(0, 910, __pyx_L1_error)\n    }\n    __pyx_r = __pyx_v_self->__pyx_base._table->AddSymbol(__pyx_v_symbol_string);\n    goto __pyx_L0;\n  }\n\n  /* \"pywrapfst.pyx\":889\n *   \"\"\"\n * \n *   cpdef int64 add_symbol(self, symbol, int64 key=kNoSymbol):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     add_symbol(self, symbol, key=NO_SYMBOL)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_XDECREF(__pyx_t_7);\n  __Pyx_WriteUnraisable(\"pywrapfst._MutableSymbolTable.add_symbol\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_19_MutableSymbolTable_1add_symbol(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic char __pyx_doc_9pywrapfst_19_MutableSymbolTable_add_symbol[] = \"\\n    add_symbol(self, symbol, key=NO_SYMBOL)\\n\\n    Adds a symbol to the table and returns the index.\\n\\n    This method adds a symbol to the table. The caller can optionally\\n    specify a non-negative integer index for the key.\\n\\n    Args:\\n      symbol: A symbol string.\\n      key: An index for the symbol; if not specified, the next index will be\\n          used.\\n\\n    Returns:\\n      The integer key of the new symbol.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_19_MutableSymbolTable_1add_symbol(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  PyObject *__pyx_v_symbol = 0;\n  __pyx_t_10basictypes_int64 __pyx_v_key;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"add_symbol (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_symbol,&__pyx_n_s_key,0};\n    PyObject* values[2] = {0,0};\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (likely((values[0] = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_symbol)) != 0)) kw_args--;\n        else goto __pyx_L5_argtuple_error;\n        CYTHON_FALLTHROUGH;\n        case  1:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_key);\n          if (value) { values[1] = value; kw_args--; }\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"add_symbol\") < 0)) __PYX_ERR(0, 889, __pyx_L3_error)\n      }\n    } else {\n      switch (PyTuple_GET_SIZE(__pyx_args)) {\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n    }\n    __pyx_v_symbol = values[0];\n    if (values[1]) {\n      __pyx_v_key = __Pyx_PyInt_As_int64_t(values[1]); if (unlikely((__pyx_v_key == ((int64_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 889, __pyx_L3_error)\n    } else {\n      __pyx_v_key = __pyx_k__13;\n    }\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"add_symbol\", 0, 1, 2, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 889, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableSymbolTable.add_symbol\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  __pyx_r = __pyx_pf_9pywrapfst_19_MutableSymbolTable_add_symbol(((struct __pyx_obj_9pywrapfst__MutableSymbolTable *)__pyx_v_self), __pyx_v_symbol, __pyx_v_key);\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_19_MutableSymbolTable_add_symbol(struct __pyx_obj_9pywrapfst__MutableSymbolTable *__pyx_v_self, PyObject *__pyx_v_symbol, __pyx_t_10basictypes_int64 __pyx_v_key) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  __pyx_t_10basictypes_int64 __pyx_t_1;\n  struct __pyx_opt_args_9pywrapfst_19_MutableSymbolTable_add_symbol __pyx_t_2;\n  PyObject *__pyx_t_3 = NULL;\n  __Pyx_RefNannySetupContext(\"add_symbol\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_2.__pyx_n = 1;\n  __pyx_t_2.key = __pyx_v_key;\n  __pyx_t_1 = __pyx_vtabptr_9pywrapfst__MutableSymbolTable->add_symbol(__pyx_v_self, __pyx_v_symbol, 1, &__pyx_t_2); \n  __pyx_t_3 = __Pyx_PyInt_From_int64_t(__pyx_t_1); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 889, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_3);\n  __pyx_r = __pyx_t_3;\n  __pyx_t_3 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_AddTraceback(\"pywrapfst._MutableSymbolTable.add_symbol\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":912\n *       return self._table.AddSymbol(symbol_string)\n * \n *   cpdef void add_table(self, _SymbolTable syms):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     add_table(self, syms)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_19_MutableSymbolTable_3add_table(PyObject *__pyx_v_self, PyObject *__pyx_v_syms); /*proto*/\nstatic void __pyx_f_9pywrapfst_19_MutableSymbolTable_add_table(struct __pyx_obj_9pywrapfst__MutableSymbolTable *__pyx_v_self, struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_syms, int __pyx_skip_dispatch) {\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  __Pyx_RefNannySetupContext(\"add_table\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_add_table); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 912, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_19_MutableSymbolTable_3add_table)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (!__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, ((PyObject *)__pyx_v_syms)); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 912, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_2);\n      } else {\n        #if CYTHON_FAST_PYCALL\n        if (PyFunction_Check(__pyx_t_3)) {\n          PyObject *__pyx_temp[2] = {__pyx_t_4, ((PyObject *)__pyx_v_syms)};\n          __pyx_t_2 = __Pyx_PyFunction_FastCall(__pyx_t_3, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 912, __pyx_L1_error)\n          __Pyx_XDECREF(__pyx_t_4); __pyx_t_4 = 0;\n          __Pyx_GOTREF(__pyx_t_2);\n        } else\n        #endif\n        #if CYTHON_FAST_PYCCALL\n        if (__Pyx_PyFastCFunction_Check(__pyx_t_3)) {\n          PyObject *__pyx_temp[2] = {__pyx_t_4, ((PyObject *)__pyx_v_syms)};\n          __pyx_t_2 = __Pyx_PyCFunction_FastCall(__pyx_t_3, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 912, __pyx_L1_error)\n          __Pyx_XDECREF(__pyx_t_4); __pyx_t_4 = 0;\n          __Pyx_GOTREF(__pyx_t_2);\n        } else\n        #endif\n        {\n          __pyx_t_5 = PyTuple_New(1+1); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 912, __pyx_L1_error)\n          __Pyx_GOTREF(__pyx_t_5);\n          __Pyx_GIVEREF(__pyx_t_4); PyTuple_SET_ITEM(__pyx_t_5, 0, __pyx_t_4); __pyx_t_4 = NULL;\n          __Pyx_INCREF(((PyObject *)__pyx_v_syms));\n          __Pyx_GIVEREF(((PyObject *)__pyx_v_syms));\n          PyTuple_SET_ITEM(__pyx_t_5, 0+1, ((PyObject *)__pyx_v_syms));\n          __pyx_t_2 = __Pyx_PyObject_Call(__pyx_t_3, __pyx_t_5, NULL); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 912, __pyx_L1_error)\n          __Pyx_GOTREF(__pyx_t_2);\n          __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n        }\n      }\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":924\n *       syms: A SymbolTable to be merged with the current table.\n *     \"\"\"\n *     self._table.AddTable(deref(syms._table))             # <<<<<<<<<<<<<<\n * \n *   cpdef void set_name(self, new_name) except *:\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_table\");\n    __PYX_ERR(0, 924, __pyx_L1_error)\n  }\n  if (unlikely(((PyObject *)__pyx_v_syms) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_table\");\n    __PYX_ERR(0, 924, __pyx_L1_error)\n  }\n  __pyx_v_self->__pyx_base._table->AddTable((*__pyx_v_syms->_table));\n\n  /* \"pywrapfst.pyx\":912\n *       return self._table.AddSymbol(symbol_string)\n * \n *   cpdef void add_table(self, _SymbolTable syms):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     add_table(self, syms)\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_WriteUnraisable(\"pywrapfst._MutableSymbolTable.add_table\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_19_MutableSymbolTable_3add_table(PyObject *__pyx_v_self, PyObject *__pyx_v_syms); /*proto*/\nstatic char __pyx_doc_9pywrapfst_19_MutableSymbolTable_2add_table[] = \"\\n    add_table(self, syms)\\n\\n    Adds another SymbolTable to this table.\\n\\n    This method merges another symbol table into the current table. All key\\n    values will be offset by the current available key.\\n\\n    Args:\\n      syms: A SymbolTable to be merged with the current table.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_19_MutableSymbolTable_3add_table(PyObject *__pyx_v_self, PyObject *__pyx_v_syms) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"add_table (wrapper)\", 0);\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_syms), __pyx_ptype_9pywrapfst__SymbolTable, 1, \"syms\", 0))) __PYX_ERR(0, 912, __pyx_L1_error)\n  __pyx_r = __pyx_pf_9pywrapfst_19_MutableSymbolTable_2add_table(((struct __pyx_obj_9pywrapfst__MutableSymbolTable *)__pyx_v_self), ((struct __pyx_obj_9pywrapfst__SymbolTable *)__pyx_v_syms));\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_19_MutableSymbolTable_2add_table(struct __pyx_obj_9pywrapfst__MutableSymbolTable *__pyx_v_self, struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_syms) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"add_table\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __Pyx_void_to_None(__pyx_f_9pywrapfst_19_MutableSymbolTable_add_table(__pyx_v_self, __pyx_v_syms, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 912, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst._MutableSymbolTable.add_table\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":926\n *     self._table.AddTable(deref(syms._table))\n * \n *   cpdef void set_name(self, new_name) except *:             # <<<<<<<<<<<<<<\n *     self._table.SetName(tostring(new_name))\n * \n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_19_MutableSymbolTable_5set_name(PyObject *__pyx_v_self, PyObject *__pyx_v_new_name); /*proto*/\nstatic void __pyx_f_9pywrapfst_19_MutableSymbolTable_set_name(struct __pyx_obj_9pywrapfst__MutableSymbolTable *__pyx_v_self, PyObject *__pyx_v_new_name, int __pyx_skip_dispatch) {\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  std::string __pyx_t_6;\n  __Pyx_RefNannySetupContext(\"set_name\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_set_name); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 926, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_19_MutableSymbolTable_5set_name)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (!__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_v_new_name); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 926, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_2);\n      } else {\n        #if CYTHON_FAST_PYCALL\n        if (PyFunction_Check(__pyx_t_3)) {\n          PyObject *__pyx_temp[2] = {__pyx_t_4, __pyx_v_new_name};\n          __pyx_t_2 = __Pyx_PyFunction_FastCall(__pyx_t_3, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 926, __pyx_L1_error)\n          __Pyx_XDECREF(__pyx_t_4); __pyx_t_4 = 0;\n          __Pyx_GOTREF(__pyx_t_2);\n        } else\n        #endif\n        #if CYTHON_FAST_PYCCALL\n        if (__Pyx_PyFastCFunction_Check(__pyx_t_3)) {\n          PyObject *__pyx_temp[2] = {__pyx_t_4, __pyx_v_new_name};\n          __pyx_t_2 = __Pyx_PyCFunction_FastCall(__pyx_t_3, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 926, __pyx_L1_error)\n          __Pyx_XDECREF(__pyx_t_4); __pyx_t_4 = 0;\n          __Pyx_GOTREF(__pyx_t_2);\n        } else\n        #endif\n        {\n          __pyx_t_5 = PyTuple_New(1+1); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 926, __pyx_L1_error)\n          __Pyx_GOTREF(__pyx_t_5);\n          __Pyx_GIVEREF(__pyx_t_4); PyTuple_SET_ITEM(__pyx_t_5, 0, __pyx_t_4); __pyx_t_4 = NULL;\n          __Pyx_INCREF(__pyx_v_new_name);\n          __Pyx_GIVEREF(__pyx_v_new_name);\n          PyTuple_SET_ITEM(__pyx_t_5, 0+1, __pyx_v_new_name);\n          __pyx_t_2 = __Pyx_PyObject_Call(__pyx_t_3, __pyx_t_5, NULL); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 926, __pyx_L1_error)\n          __Pyx_GOTREF(__pyx_t_2);\n          __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n        }\n      }\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":927\n * \n *   cpdef void set_name(self, new_name) except *:\n *     self._table.SetName(tostring(new_name))             # <<<<<<<<<<<<<<\n * \n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_table\");\n    __PYX_ERR(0, 927, __pyx_L1_error)\n  }\n  __pyx_t_6 = __pyx_f_9pywrapfst_tostring(__pyx_v_new_name, NULL); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 927, __pyx_L1_error)\n  __pyx_v_self->__pyx_base._table->SetName(__pyx_t_6);\n\n  /* \"pywrapfst.pyx\":926\n *     self._table.AddTable(deref(syms._table))\n * \n *   cpdef void set_name(self, new_name) except *:             # <<<<<<<<<<<<<<\n *     self._table.SetName(tostring(new_name))\n * \n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_AddTraceback(\"pywrapfst._MutableSymbolTable.set_name\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_19_MutableSymbolTable_5set_name(PyObject *__pyx_v_self, PyObject *__pyx_v_new_name); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_19_MutableSymbolTable_5set_name(PyObject *__pyx_v_self, PyObject *__pyx_v_new_name) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"set_name (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_19_MutableSymbolTable_4set_name(((struct __pyx_obj_9pywrapfst__MutableSymbolTable *)__pyx_v_self), ((PyObject *)__pyx_v_new_name));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_19_MutableSymbolTable_4set_name(struct __pyx_obj_9pywrapfst__MutableSymbolTable *__pyx_v_self, PyObject *__pyx_v_new_name) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"set_name\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_f_9pywrapfst_19_MutableSymbolTable_set_name(__pyx_v_self, __pyx_v_new_name, 1); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 926, __pyx_L1_error)\n  __pyx_t_1 = __Pyx_void_to_None(NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 926, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst._MutableSymbolTable.set_name\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"(tree fragment)\":1\n * def __reduce_cython__(self):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._table cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_19_MutableSymbolTable_7__reduce_cython__(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_19_MutableSymbolTable_7__reduce_cython__(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__reduce_cython__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_19_MutableSymbolTable_6__reduce_cython__(((struct __pyx_obj_9pywrapfst__MutableSymbolTable *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_19_MutableSymbolTable_6__reduce_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst__MutableSymbolTable *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"__reduce_cython__\", 0);\n\n  /* \"(tree fragment)\":2\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._table cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._table cannot be converted to a Python object for pickling\")\n */\n  __pyx_t_1 = __Pyx_PyObject_Call(__pyx_builtin_TypeError, __pyx_tuple__14, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(1, 2, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __Pyx_Raise(__pyx_t_1, 0, 0, 0);\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  __PYX_ERR(1, 2, __pyx_L1_error)\n\n  /* \"(tree fragment)\":1\n * def __reduce_cython__(self):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._table cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst._MutableSymbolTable.__reduce_cython__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"(tree fragment)\":3\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._table cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._table cannot be converted to a Python object for pickling\")\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_19_MutableSymbolTable_9__setstate_cython__(PyObject *__pyx_v_self, PyObject *__pyx_v___pyx_state); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_19_MutableSymbolTable_9__setstate_cython__(PyObject *__pyx_v_self, PyObject *__pyx_v___pyx_state) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__setstate_cython__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_19_MutableSymbolTable_8__setstate_cython__(((struct __pyx_obj_9pywrapfst__MutableSymbolTable *)__pyx_v_self), ((PyObject *)__pyx_v___pyx_state));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_19_MutableSymbolTable_8__setstate_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst__MutableSymbolTable *__pyx_v_self, CYTHON_UNUSED PyObject *__pyx_v___pyx_state) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"__setstate_cython__\", 0);\n\n  /* \"(tree fragment)\":4\n *     raise TypeError(\"self._table cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._table cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n */\n  __pyx_t_1 = __Pyx_PyObject_Call(__pyx_builtin_TypeError, __pyx_tuple__15, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(1, 4, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __Pyx_Raise(__pyx_t_1, 0, 0, 0);\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  __PYX_ERR(1, 4, __pyx_L1_error)\n\n  /* \"(tree fragment)\":3\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._table cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._table cannot be converted to a Python object for pickling\")\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst._MutableSymbolTable.__setstate_cython__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":937\n *   \"\"\"\n * \n *   def __repr__(self):             # <<<<<<<<<<<<<<\n *     return \"<Fst SymbolTable {!r} at 0x{:x}>\".format(self.name(), id(self))\n * \n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_22_MutableFstSymbolTable_1__repr__(PyObject *__pyx_v_self); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_22_MutableFstSymbolTable_1__repr__(PyObject *__pyx_v_self) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__repr__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_22_MutableFstSymbolTable___repr__(((struct __pyx_obj_9pywrapfst__MutableFstSymbolTable *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_22_MutableFstSymbolTable___repr__(struct __pyx_obj_9pywrapfst__MutableFstSymbolTable *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  int __pyx_t_6;\n  PyObject *__pyx_t_7 = NULL;\n  __Pyx_RefNannySetupContext(\"__repr__\", 0);\n\n  /* \"pywrapfst.pyx\":938\n * \n *   def __repr__(self):\n *     return \"<Fst SymbolTable {!r} at 0x{:x}>\".format(self.name(), id(self))             # <<<<<<<<<<<<<<\n * \n * \n */\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_2 = __Pyx_PyObject_GetAttrStr(__pyx_kp_s_Fst_SymbolTable_r_at_0x_x, __pyx_n_s_format); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 938, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"name\");\n    __PYX_ERR(0, 938, __pyx_L1_error)\n  }\n  __pyx_t_3 = __pyx_convert_PyBytes_string_to_py_std__in_string(((struct __pyx_vtabstruct_9pywrapfst__MutableFstSymbolTable *)__pyx_v_self->__pyx_base.__pyx_base.__pyx_vtab)->__pyx_base.__pyx_base.name(((struct __pyx_obj_9pywrapfst__SymbolTable *)__pyx_v_self), 0)); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 938, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_3);\n  __pyx_t_4 = __Pyx_PyObject_CallOneArg(__pyx_builtin_id, ((PyObject *)__pyx_v_self)); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 938, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_4);\n  __pyx_t_5 = NULL;\n  __pyx_t_6 = 0;\n  if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_2))) {\n    __pyx_t_5 = PyMethod_GET_SELF(__pyx_t_2);\n    if (likely(__pyx_t_5)) {\n      PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_2);\n      __Pyx_INCREF(__pyx_t_5);\n      __Pyx_INCREF(function);\n      __Pyx_DECREF_SET(__pyx_t_2, function);\n      __pyx_t_6 = 1;\n    }\n  }\n  #if CYTHON_FAST_PYCALL\n  if (PyFunction_Check(__pyx_t_2)) {\n    PyObject *__pyx_temp[3] = {__pyx_t_5, __pyx_t_3, __pyx_t_4};\n    __pyx_t_1 = __Pyx_PyFunction_FastCall(__pyx_t_2, __pyx_temp+1-__pyx_t_6, 2+__pyx_t_6); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 938, __pyx_L1_error)\n    __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;\n    __Pyx_GOTREF(__pyx_t_1);\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n  } else\n  #endif\n  #if CYTHON_FAST_PYCCALL\n  if (__Pyx_PyFastCFunction_Check(__pyx_t_2)) {\n    PyObject *__pyx_temp[3] = {__pyx_t_5, __pyx_t_3, __pyx_t_4};\n    __pyx_t_1 = __Pyx_PyCFunction_FastCall(__pyx_t_2, __pyx_temp+1-__pyx_t_6, 2+__pyx_t_6); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 938, __pyx_L1_error)\n    __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;\n    __Pyx_GOTREF(__pyx_t_1);\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n  } else\n  #endif\n  {\n    __pyx_t_7 = PyTuple_New(2+__pyx_t_6); if (unlikely(!__pyx_t_7)) __PYX_ERR(0, 938, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_7);\n    if (__pyx_t_5) {\n      __Pyx_GIVEREF(__pyx_t_5); PyTuple_SET_ITEM(__pyx_t_7, 0, __pyx_t_5); __pyx_t_5 = NULL;\n    }\n    __Pyx_GIVEREF(__pyx_t_3);\n    PyTuple_SET_ITEM(__pyx_t_7, 0+__pyx_t_6, __pyx_t_3);\n    __Pyx_GIVEREF(__pyx_t_4);\n    PyTuple_SET_ITEM(__pyx_t_7, 1+__pyx_t_6, __pyx_t_4);\n    __pyx_t_3 = 0;\n    __pyx_t_4 = 0;\n    __pyx_t_1 = __Pyx_PyObject_Call(__pyx_t_2, __pyx_t_7, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 938, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0;\n  }\n  __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":937\n *   \"\"\"\n * \n *   def __repr__(self):             # <<<<<<<<<<<<<<\n *     return \"<Fst SymbolTable {!r} at 0x{:x}>\".format(self.name(), id(self))\n * \n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_XDECREF(__pyx_t_7);\n  __Pyx_AddTraceback(\"pywrapfst._MutableFstSymbolTable.__repr__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"(tree fragment)\":1\n * def __reduce_cython__(self):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._mfst,self._table cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_22_MutableFstSymbolTable_3__reduce_cython__(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_22_MutableFstSymbolTable_3__reduce_cython__(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__reduce_cython__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_22_MutableFstSymbolTable_2__reduce_cython__(((struct __pyx_obj_9pywrapfst__MutableFstSymbolTable *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_22_MutableFstSymbolTable_2__reduce_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst__MutableFstSymbolTable *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"__reduce_cython__\", 0);\n\n  /* \"(tree fragment)\":2\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._mfst,self._table cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._mfst,self._table cannot be converted to a Python object for pickling\")\n */\n  __pyx_t_1 = __Pyx_PyObject_Call(__pyx_builtin_TypeError, __pyx_tuple__16, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(1, 2, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __Pyx_Raise(__pyx_t_1, 0, 0, 0);\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  __PYX_ERR(1, 2, __pyx_L1_error)\n\n  /* \"(tree fragment)\":1\n * def __reduce_cython__(self):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._mfst,self._table cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst._MutableFstSymbolTable.__reduce_cython__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"(tree fragment)\":3\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._mfst,self._table cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._mfst,self._table cannot be converted to a Python object for pickling\")\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_22_MutableFstSymbolTable_5__setstate_cython__(PyObject *__pyx_v_self, PyObject *__pyx_v___pyx_state); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_22_MutableFstSymbolTable_5__setstate_cython__(PyObject *__pyx_v_self, PyObject *__pyx_v___pyx_state) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__setstate_cython__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_22_MutableFstSymbolTable_4__setstate_cython__(((struct __pyx_obj_9pywrapfst__MutableFstSymbolTable *)__pyx_v_self), ((PyObject *)__pyx_v___pyx_state));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_22_MutableFstSymbolTable_4__setstate_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst__MutableFstSymbolTable *__pyx_v_self, CYTHON_UNUSED PyObject *__pyx_v___pyx_state) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"__setstate_cython__\", 0);\n\n  /* \"(tree fragment)\":4\n *     raise TypeError(\"self._mfst,self._table cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._mfst,self._table cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n */\n  __pyx_t_1 = __Pyx_PyObject_Call(__pyx_builtin_TypeError, __pyx_tuple__17, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(1, 4, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __Pyx_Raise(__pyx_t_1, 0, 0, 0);\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  __PYX_ERR(1, 4, __pyx_L1_error)\n\n  /* \"(tree fragment)\":3\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._mfst,self._table cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._mfst,self._table cannot be converted to a Python object for pickling\")\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst._MutableFstSymbolTable.__setstate_cython__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":958\n *   \"\"\"\n * \n *   def __repr__(self):             # <<<<<<<<<<<<<<\n *     return \"<SymbolTable {!r} at 0x{:x}>\".format(self.name(), id(self))\n * \n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_11SymbolTable_1__repr__(PyObject *__pyx_v_self); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_11SymbolTable_1__repr__(PyObject *__pyx_v_self) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__repr__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_11SymbolTable___repr__(((struct __pyx_obj_9pywrapfst_SymbolTable *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_11SymbolTable___repr__(struct __pyx_obj_9pywrapfst_SymbolTable *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  int __pyx_t_6;\n  PyObject *__pyx_t_7 = NULL;\n  __Pyx_RefNannySetupContext(\"__repr__\", 0);\n\n  /* \"pywrapfst.pyx\":959\n * \n *   def __repr__(self):\n *     return \"<SymbolTable {!r} at 0x{:x}>\".format(self.name(), id(self))             # <<<<<<<<<<<<<<\n * \n *   def __init__(self, name=b\"<unspecified>\"):\n */\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_2 = __Pyx_PyObject_GetAttrStr(__pyx_kp_s_SymbolTable_r_at_0x_x, __pyx_n_s_format); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 959, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"name\");\n    __PYX_ERR(0, 959, __pyx_L1_error)\n  }\n  __pyx_t_3 = __pyx_convert_PyBytes_string_to_py_std__in_string(((struct __pyx_vtabstruct_9pywrapfst_SymbolTable *)__pyx_v_self->__pyx_base.__pyx_base.__pyx_vtab)->__pyx_base.__pyx_base.name(((struct __pyx_obj_9pywrapfst__SymbolTable *)__pyx_v_self), 0)); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 959, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_3);\n  __pyx_t_4 = __Pyx_PyObject_CallOneArg(__pyx_builtin_id, ((PyObject *)__pyx_v_self)); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 959, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_4);\n  __pyx_t_5 = NULL;\n  __pyx_t_6 = 0;\n  if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_2))) {\n    __pyx_t_5 = PyMethod_GET_SELF(__pyx_t_2);\n    if (likely(__pyx_t_5)) {\n      PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_2);\n      __Pyx_INCREF(__pyx_t_5);\n      __Pyx_INCREF(function);\n      __Pyx_DECREF_SET(__pyx_t_2, function);\n      __pyx_t_6 = 1;\n    }\n  }\n  #if CYTHON_FAST_PYCALL\n  if (PyFunction_Check(__pyx_t_2)) {\n    PyObject *__pyx_temp[3] = {__pyx_t_5, __pyx_t_3, __pyx_t_4};\n    __pyx_t_1 = __Pyx_PyFunction_FastCall(__pyx_t_2, __pyx_temp+1-__pyx_t_6, 2+__pyx_t_6); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 959, __pyx_L1_error)\n    __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;\n    __Pyx_GOTREF(__pyx_t_1);\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n  } else\n  #endif\n  #if CYTHON_FAST_PYCCALL\n  if (__Pyx_PyFastCFunction_Check(__pyx_t_2)) {\n    PyObject *__pyx_temp[3] = {__pyx_t_5, __pyx_t_3, __pyx_t_4};\n    __pyx_t_1 = __Pyx_PyCFunction_FastCall(__pyx_t_2, __pyx_temp+1-__pyx_t_6, 2+__pyx_t_6); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 959, __pyx_L1_error)\n    __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;\n    __Pyx_GOTREF(__pyx_t_1);\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n  } else\n  #endif\n  {\n    __pyx_t_7 = PyTuple_New(2+__pyx_t_6); if (unlikely(!__pyx_t_7)) __PYX_ERR(0, 959, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_7);\n    if (__pyx_t_5) {\n      __Pyx_GIVEREF(__pyx_t_5); PyTuple_SET_ITEM(__pyx_t_7, 0, __pyx_t_5); __pyx_t_5 = NULL;\n    }\n    __Pyx_GIVEREF(__pyx_t_3);\n    PyTuple_SET_ITEM(__pyx_t_7, 0+__pyx_t_6, __pyx_t_3);\n    __Pyx_GIVEREF(__pyx_t_4);\n    PyTuple_SET_ITEM(__pyx_t_7, 1+__pyx_t_6, __pyx_t_4);\n    __pyx_t_3 = 0;\n    __pyx_t_4 = 0;\n    __pyx_t_1 = __Pyx_PyObject_Call(__pyx_t_2, __pyx_t_7, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 959, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0;\n  }\n  __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":958\n *   \"\"\"\n * \n *   def __repr__(self):             # <<<<<<<<<<<<<<\n *     return \"<SymbolTable {!r} at 0x{:x}>\".format(self.name(), id(self))\n * \n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_XDECREF(__pyx_t_7);\n  __Pyx_AddTraceback(\"pywrapfst.SymbolTable.__repr__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":961\n *     return \"<SymbolTable {!r} at 0x{:x}>\".format(self.name(), id(self))\n * \n *   def __init__(self, name=b\"<unspecified>\"):             # <<<<<<<<<<<<<<\n *     self._table = new fst.SymbolTable(tostring(name))\n *     self._smart_table.reset(self._table)\n */\n\n/* Python wrapper */\nstatic int __pyx_pw_9pywrapfst_11SymbolTable_3__init__(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic int __pyx_pw_9pywrapfst_11SymbolTable_3__init__(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  PyObject *__pyx_v_name = 0;\n  int __pyx_r;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__init__ (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_name_2,0};\n    PyObject* values[1] = {0};\n    values[0] = ((PyObject *)__pyx_kp_b_unspecified);\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_name_2);\n          if (value) { values[0] = value; kw_args--; }\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"__init__\") < 0)) __PYX_ERR(0, 961, __pyx_L3_error)\n      }\n    } else {\n      switch (PyTuple_GET_SIZE(__pyx_args)) {\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n    }\n    __pyx_v_name = values[0];\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"__init__\", 0, 0, 1, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 961, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst.SymbolTable.__init__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return -1;\n  __pyx_L4_argument_unpacking_done:;\n  __pyx_r = __pyx_pf_9pywrapfst_11SymbolTable_2__init__(((struct __pyx_obj_9pywrapfst_SymbolTable *)__pyx_v_self), __pyx_v_name);\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic int __pyx_pf_9pywrapfst_11SymbolTable_2__init__(struct __pyx_obj_9pywrapfst_SymbolTable *__pyx_v_self, PyObject *__pyx_v_name) {\n  int __pyx_r;\n  __Pyx_RefNannyDeclarations\n  std::string __pyx_t_1;\n  __Pyx_RefNannySetupContext(\"__init__\", 0);\n\n  /* \"pywrapfst.pyx\":962\n * \n *   def __init__(self, name=b\"<unspecified>\"):\n *     self._table = new fst.SymbolTable(tostring(name))             # <<<<<<<<<<<<<<\n *     self._smart_table.reset(self._table)\n * \n */\n  __pyx_t_1 = __pyx_f_9pywrapfst_tostring(__pyx_v_name, NULL); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 962, __pyx_L1_error)\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_table\");\n    __PYX_ERR(0, 962, __pyx_L1_error)\n  }\n  __pyx_v_self->__pyx_base.__pyx_base._table = new fst::SymbolTable(__pyx_t_1);\n\n  /* \"pywrapfst.pyx\":963\n *   def __init__(self, name=b\"<unspecified>\"):\n *     self._table = new fst.SymbolTable(tostring(name))\n *     self._smart_table.reset(self._table)             # <<<<<<<<<<<<<<\n * \n *   @classmethod\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_smart_table\");\n    __PYX_ERR(0, 963, __pyx_L1_error)\n  }\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_table\");\n    __PYX_ERR(0, 963, __pyx_L1_error)\n  }\n  __pyx_v_self->_smart_table.reset(__pyx_v_self->__pyx_base.__pyx_base._table);\n\n  /* \"pywrapfst.pyx\":961\n *     return \"<SymbolTable {!r} at 0x{:x}>\".format(self.name(), id(self))\n * \n *   def __init__(self, name=b\"<unspecified>\"):             # <<<<<<<<<<<<<<\n *     self._table = new fst.SymbolTable(tostring(name))\n *     self._smart_table.reset(self._table)\n */\n\n  /* function exit code */\n  __pyx_r = 0;\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"pywrapfst.SymbolTable.__init__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = -1;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":966\n * \n *   @classmethod\n *   def read(cls, filename):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     SymbolTable.read(filename)\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_11SymbolTable_5read(PyObject *__pyx_v_cls, PyObject *__pyx_v_filename); /*proto*/\nstatic char __pyx_doc_9pywrapfst_11SymbolTable_4read[] = \"\\n    SymbolTable.read(filename)\\n\\n    Reads symbol table from binary file.\\n\\n    This class method creates a new SymbolTable from a symbol table binary file.\\n\\n    Args:\\n      filename: The string location of the input binary file.\\n\\n    Returns:\\n      A new SymbolTable instance.\\n\\n    See also: `SymbolTable.read_fst`, `SymbolTable.read_text`.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_11SymbolTable_5read(PyObject *__pyx_v_cls, PyObject *__pyx_v_filename) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"read (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_11SymbolTable_4read(((PyTypeObject*)__pyx_v_cls), ((PyObject *)__pyx_v_filename));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_11SymbolTable_4read(CYTHON_UNUSED PyTypeObject *__pyx_v_cls, PyObject *__pyx_v_filename) {\n  fst::SymbolTable *__pyx_v_tsyms;\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  std::string __pyx_t_1;\n  int __pyx_t_2;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  PyObject *__pyx_t_6 = NULL;\n  PyObject *__pyx_t_7 = NULL;\n  PyObject *__pyx_t_8 = NULL;\n  __Pyx_RefNannySetupContext(\"read\", 0);\n\n  /* \"pywrapfst.pyx\":982\n *     See also: `SymbolTable.read_fst`, `SymbolTable.read_text`.\n *     \"\"\"\n *     cdef fst.SymbolTable *tsyms = fst.SymbolTable.Read(tostring(filename))             # <<<<<<<<<<<<<<\n *     if tsyms == NULL:\n *       raise FstIOError(\"Read failed: {!r}\".format(filename))\n */\n  __pyx_t_1 = __pyx_f_9pywrapfst_tostring(__pyx_v_filename, NULL); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 982, __pyx_L1_error)\n  __pyx_v_tsyms = fst::SymbolTable::Read(__pyx_t_1);\n\n  /* \"pywrapfst.pyx\":983\n *     \"\"\"\n *     cdef fst.SymbolTable *tsyms = fst.SymbolTable.Read(tostring(filename))\n *     if tsyms == NULL:             # <<<<<<<<<<<<<<\n *       raise FstIOError(\"Read failed: {!r}\".format(filename))\n *     return _init_SymbolTable(tsyms)\n */\n  __pyx_t_2 = ((__pyx_v_tsyms == NULL) != 0);\n  if (unlikely(__pyx_t_2)) {\n\n    /* \"pywrapfst.pyx\":984\n *     cdef fst.SymbolTable *tsyms = fst.SymbolTable.Read(tostring(filename))\n *     if tsyms == NULL:\n *       raise FstIOError(\"Read failed: {!r}\".format(filename))             # <<<<<<<<<<<<<<\n *     return _init_SymbolTable(tsyms)\n * \n */\n    __pyx_t_4 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstIOError); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 984, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_4);\n    __pyx_t_6 = __Pyx_PyObject_GetAttrStr(__pyx_kp_s_Read_failed_r, __pyx_n_s_format); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 984, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_6);\n    __pyx_t_7 = NULL;\n    if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_6))) {\n      __pyx_t_7 = PyMethod_GET_SELF(__pyx_t_6);\n      if (likely(__pyx_t_7)) {\n        PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_6);\n        __Pyx_INCREF(__pyx_t_7);\n        __Pyx_INCREF(function);\n        __Pyx_DECREF_SET(__pyx_t_6, function);\n      }\n    }\n    if (!__pyx_t_7) {\n      __pyx_t_5 = __Pyx_PyObject_CallOneArg(__pyx_t_6, __pyx_v_filename); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 984, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_5);\n    } else {\n      #if CYTHON_FAST_PYCALL\n      if (PyFunction_Check(__pyx_t_6)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_7, __pyx_v_filename};\n        __pyx_t_5 = __Pyx_PyFunction_FastCall(__pyx_t_6, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 984, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_7); __pyx_t_7 = 0;\n        __Pyx_GOTREF(__pyx_t_5);\n      } else\n      #endif\n      #if CYTHON_FAST_PYCCALL\n      if (__Pyx_PyFastCFunction_Check(__pyx_t_6)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_7, __pyx_v_filename};\n        __pyx_t_5 = __Pyx_PyCFunction_FastCall(__pyx_t_6, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 984, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_7); __pyx_t_7 = 0;\n        __Pyx_GOTREF(__pyx_t_5);\n      } else\n      #endif\n      {\n        __pyx_t_8 = PyTuple_New(1+1); if (unlikely(!__pyx_t_8)) __PYX_ERR(0, 984, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_8);\n        __Pyx_GIVEREF(__pyx_t_7); PyTuple_SET_ITEM(__pyx_t_8, 0, __pyx_t_7); __pyx_t_7 = NULL;\n        __Pyx_INCREF(__pyx_v_filename);\n        __Pyx_GIVEREF(__pyx_v_filename);\n        PyTuple_SET_ITEM(__pyx_t_8, 0+1, __pyx_v_filename);\n        __pyx_t_5 = __Pyx_PyObject_Call(__pyx_t_6, __pyx_t_8, NULL); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 984, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_5);\n        __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0;\n      }\n    }\n    __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n    __pyx_t_6 = NULL;\n    if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_4))) {\n      __pyx_t_6 = PyMethod_GET_SELF(__pyx_t_4);\n      if (likely(__pyx_t_6)) {\n        PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_4);\n        __Pyx_INCREF(__pyx_t_6);\n        __Pyx_INCREF(function);\n        __Pyx_DECREF_SET(__pyx_t_4, function);\n      }\n    }\n    if (!__pyx_t_6) {\n      __pyx_t_3 = __Pyx_PyObject_CallOneArg(__pyx_t_4, __pyx_t_5); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 984, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n      __Pyx_GOTREF(__pyx_t_3);\n    } else {\n      #if CYTHON_FAST_PYCALL\n      if (PyFunction_Check(__pyx_t_4)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_6, __pyx_t_5};\n        __pyx_t_3 = __Pyx_PyFunction_FastCall(__pyx_t_4, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 984, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_6); __pyx_t_6 = 0;\n        __Pyx_GOTREF(__pyx_t_3);\n        __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n      } else\n      #endif\n      #if CYTHON_FAST_PYCCALL\n      if (__Pyx_PyFastCFunction_Check(__pyx_t_4)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_6, __pyx_t_5};\n        __pyx_t_3 = __Pyx_PyCFunction_FastCall(__pyx_t_4, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 984, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_6); __pyx_t_6 = 0;\n        __Pyx_GOTREF(__pyx_t_3);\n        __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n      } else\n      #endif\n      {\n        __pyx_t_8 = PyTuple_New(1+1); if (unlikely(!__pyx_t_8)) __PYX_ERR(0, 984, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_8);\n        __Pyx_GIVEREF(__pyx_t_6); PyTuple_SET_ITEM(__pyx_t_8, 0, __pyx_t_6); __pyx_t_6 = NULL;\n        __Pyx_GIVEREF(__pyx_t_5);\n        PyTuple_SET_ITEM(__pyx_t_8, 0+1, __pyx_t_5);\n        __pyx_t_5 = 0;\n        __pyx_t_3 = __Pyx_PyObject_Call(__pyx_t_4, __pyx_t_8, NULL); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 984, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_3);\n        __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0;\n      }\n    }\n    __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n    __Pyx_Raise(__pyx_t_3, 0, 0, 0);\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    __PYX_ERR(0, 984, __pyx_L1_error)\n\n    /* \"pywrapfst.pyx\":983\n *     \"\"\"\n *     cdef fst.SymbolTable *tsyms = fst.SymbolTable.Read(tostring(filename))\n *     if tsyms == NULL:             # <<<<<<<<<<<<<<\n *       raise FstIOError(\"Read failed: {!r}\".format(filename))\n *     return _init_SymbolTable(tsyms)\n */\n  }\n\n  /* \"pywrapfst.pyx\":985\n *     if tsyms == NULL:\n *       raise FstIOError(\"Read failed: {!r}\".format(filename))\n *     return _init_SymbolTable(tsyms)             # <<<<<<<<<<<<<<\n * \n *   @classmethod\n */\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_3 = ((PyObject *)__pyx_f_9pywrapfst__init_SymbolTable(__pyx_v_tsyms)); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 985, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_3);\n  __pyx_r = __pyx_t_3;\n  __pyx_t_3 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":966\n * \n *   @classmethod\n *   def read(cls, filename):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     SymbolTable.read(filename)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_XDECREF(__pyx_t_6);\n  __Pyx_XDECREF(__pyx_t_7);\n  __Pyx_XDECREF(__pyx_t_8);\n  __Pyx_AddTraceback(\"pywrapfst.SymbolTable.read\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":988\n * \n *   @classmethod\n *   def read_text(cls, filename, bool allow_negative_labels=False):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     SymbolTable.read_text(filename)\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_11SymbolTable_7read_text(PyObject *__pyx_v_cls, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic char __pyx_doc_9pywrapfst_11SymbolTable_6read_text[] = \"\\n    SymbolTable.read_text(filename)\\n\\n    Reads symbol table from text file.\\n\\n    This class method creates a new SymbolTable from a symbol table text file.\\n\\n    Args:\\n      filename: The string location of the input text file.\\n      allow_negative_labels: Should negative labels be allowed? (Not\\n          recommended; may cause conflicts).\\n\\n    Returns:\\n      A new SymbolTable instance.\\n\\n    See also: `SymbolTable.read`, `SymbolTable.read_fst`.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_11SymbolTable_7read_text(PyObject *__pyx_v_cls, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  PyObject *__pyx_v_filename = 0;\n  bool __pyx_v_allow_negative_labels;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"read_text (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_filename,&__pyx_n_s_allow_negative_labels,0};\n    PyObject* values[2] = {0,0};\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (likely((values[0] = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_filename)) != 0)) kw_args--;\n        else goto __pyx_L5_argtuple_error;\n        CYTHON_FALLTHROUGH;\n        case  1:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_allow_negative_labels);\n          if (value) { values[1] = value; kw_args--; }\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"read_text\") < 0)) __PYX_ERR(0, 988, __pyx_L3_error)\n      }\n    } else {\n      switch (PyTuple_GET_SIZE(__pyx_args)) {\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n    }\n    __pyx_v_filename = values[0];\n    if (values[1]) {\n      __pyx_v_allow_negative_labels = __Pyx_PyObject_IsTrue(values[1]); if (unlikely((__pyx_v_allow_negative_labels == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 988, __pyx_L3_error)\n    } else {\n      __pyx_v_allow_negative_labels = ((bool)0);\n    }\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"read_text\", 0, 1, 2, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 988, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst.SymbolTable.read_text\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  __pyx_r = __pyx_pf_9pywrapfst_11SymbolTable_6read_text(((PyTypeObject*)__pyx_v_cls), __pyx_v_filename, __pyx_v_allow_negative_labels);\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_11SymbolTable_6read_text(CYTHON_UNUSED PyTypeObject *__pyx_v_cls, PyObject *__pyx_v_filename, bool __pyx_v_allow_negative_labels) {\n  std::unique_ptr<fst::SymbolTableTextOptions>  __pyx_v_opts;\n  fst::SymbolTable *__pyx_v_tsyms;\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  std::string __pyx_t_1;\n  int __pyx_t_2;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  PyObject *__pyx_t_6 = NULL;\n  PyObject *__pyx_t_7 = NULL;\n  PyObject *__pyx_t_8 = NULL;\n  __Pyx_RefNannySetupContext(\"read_text\", 0);\n\n  /* \"pywrapfst.pyx\":1007\n *     \"\"\"\n *     cdef unique_ptr[fst.SymbolTableTextOptions] opts\n *     opts.reset(new fst.SymbolTableTextOptions(allow_negative_labels))             # <<<<<<<<<<<<<<\n *     cdef fst.SymbolTable *tsyms = fst.SymbolTable.ReadText(tostring(filename),\n *                                                            deref(opts))\n */\n  __pyx_v_opts.reset(new fst::SymbolTableTextOptions(__pyx_v_allow_negative_labels));\n\n  /* \"pywrapfst.pyx\":1008\n *     cdef unique_ptr[fst.SymbolTableTextOptions] opts\n *     opts.reset(new fst.SymbolTableTextOptions(allow_negative_labels))\n *     cdef fst.SymbolTable *tsyms = fst.SymbolTable.ReadText(tostring(filename),             # <<<<<<<<<<<<<<\n *                                                            deref(opts))\n *     if tsyms == NULL:\n */\n  __pyx_t_1 = __pyx_f_9pywrapfst_tostring(__pyx_v_filename, NULL); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 1008, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":1009\n *     opts.reset(new fst.SymbolTableTextOptions(allow_negative_labels))\n *     cdef fst.SymbolTable *tsyms = fst.SymbolTable.ReadText(tostring(filename),\n *                                                            deref(opts))             # <<<<<<<<<<<<<<\n *     if tsyms == NULL:\n *       raise FstIOError(\"Read failed: {!r}\".format(filename))\n */\n  __pyx_v_tsyms = fst::SymbolTable::ReadText(__pyx_t_1, (*__pyx_v_opts));\n\n  /* \"pywrapfst.pyx\":1010\n *     cdef fst.SymbolTable *tsyms = fst.SymbolTable.ReadText(tostring(filename),\n *                                                            deref(opts))\n *     if tsyms == NULL:             # <<<<<<<<<<<<<<\n *       raise FstIOError(\"Read failed: {!r}\".format(filename))\n *     return _init_SymbolTable(tsyms)\n */\n  __pyx_t_2 = ((__pyx_v_tsyms == NULL) != 0);\n  if (unlikely(__pyx_t_2)) {\n\n    /* \"pywrapfst.pyx\":1011\n *                                                            deref(opts))\n *     if tsyms == NULL:\n *       raise FstIOError(\"Read failed: {!r}\".format(filename))             # <<<<<<<<<<<<<<\n *     return _init_SymbolTable(tsyms)\n * \n */\n    __pyx_t_4 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstIOError); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 1011, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_4);\n    __pyx_t_6 = __Pyx_PyObject_GetAttrStr(__pyx_kp_s_Read_failed_r, __pyx_n_s_format); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 1011, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_6);\n    __pyx_t_7 = NULL;\n    if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_6))) {\n      __pyx_t_7 = PyMethod_GET_SELF(__pyx_t_6);\n      if (likely(__pyx_t_7)) {\n        PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_6);\n        __Pyx_INCREF(__pyx_t_7);\n        __Pyx_INCREF(function);\n        __Pyx_DECREF_SET(__pyx_t_6, function);\n      }\n    }\n    if (!__pyx_t_7) {\n      __pyx_t_5 = __Pyx_PyObject_CallOneArg(__pyx_t_6, __pyx_v_filename); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 1011, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_5);\n    } else {\n      #if CYTHON_FAST_PYCALL\n      if (PyFunction_Check(__pyx_t_6)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_7, __pyx_v_filename};\n        __pyx_t_5 = __Pyx_PyFunction_FastCall(__pyx_t_6, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 1011, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_7); __pyx_t_7 = 0;\n        __Pyx_GOTREF(__pyx_t_5);\n      } else\n      #endif\n      #if CYTHON_FAST_PYCCALL\n      if (__Pyx_PyFastCFunction_Check(__pyx_t_6)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_7, __pyx_v_filename};\n        __pyx_t_5 = __Pyx_PyCFunction_FastCall(__pyx_t_6, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 1011, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_7); __pyx_t_7 = 0;\n        __Pyx_GOTREF(__pyx_t_5);\n      } else\n      #endif\n      {\n        __pyx_t_8 = PyTuple_New(1+1); if (unlikely(!__pyx_t_8)) __PYX_ERR(0, 1011, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_8);\n        __Pyx_GIVEREF(__pyx_t_7); PyTuple_SET_ITEM(__pyx_t_8, 0, __pyx_t_7); __pyx_t_7 = NULL;\n        __Pyx_INCREF(__pyx_v_filename);\n        __Pyx_GIVEREF(__pyx_v_filename);\n        PyTuple_SET_ITEM(__pyx_t_8, 0+1, __pyx_v_filename);\n        __pyx_t_5 = __Pyx_PyObject_Call(__pyx_t_6, __pyx_t_8, NULL); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 1011, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_5);\n        __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0;\n      }\n    }\n    __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n    __pyx_t_6 = NULL;\n    if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_4))) {\n      __pyx_t_6 = PyMethod_GET_SELF(__pyx_t_4);\n      if (likely(__pyx_t_6)) {\n        PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_4);\n        __Pyx_INCREF(__pyx_t_6);\n        __Pyx_INCREF(function);\n        __Pyx_DECREF_SET(__pyx_t_4, function);\n      }\n    }\n    if (!__pyx_t_6) {\n      __pyx_t_3 = __Pyx_PyObject_CallOneArg(__pyx_t_4, __pyx_t_5); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 1011, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n      __Pyx_GOTREF(__pyx_t_3);\n    } else {\n      #if CYTHON_FAST_PYCALL\n      if (PyFunction_Check(__pyx_t_4)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_6, __pyx_t_5};\n        __pyx_t_3 = __Pyx_PyFunction_FastCall(__pyx_t_4, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 1011, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_6); __pyx_t_6 = 0;\n        __Pyx_GOTREF(__pyx_t_3);\n        __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n      } else\n      #endif\n      #if CYTHON_FAST_PYCCALL\n      if (__Pyx_PyFastCFunction_Check(__pyx_t_4)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_6, __pyx_t_5};\n        __pyx_t_3 = __Pyx_PyCFunction_FastCall(__pyx_t_4, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 1011, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_6); __pyx_t_6 = 0;\n        __Pyx_GOTREF(__pyx_t_3);\n        __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n      } else\n      #endif\n      {\n        __pyx_t_8 = PyTuple_New(1+1); if (unlikely(!__pyx_t_8)) __PYX_ERR(0, 1011, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_8);\n        __Pyx_GIVEREF(__pyx_t_6); PyTuple_SET_ITEM(__pyx_t_8, 0, __pyx_t_6); __pyx_t_6 = NULL;\n        __Pyx_GIVEREF(__pyx_t_5);\n        PyTuple_SET_ITEM(__pyx_t_8, 0+1, __pyx_t_5);\n        __pyx_t_5 = 0;\n        __pyx_t_3 = __Pyx_PyObject_Call(__pyx_t_4, __pyx_t_8, NULL); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 1011, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_3);\n        __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0;\n      }\n    }\n    __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n    __Pyx_Raise(__pyx_t_3, 0, 0, 0);\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    __PYX_ERR(0, 1011, __pyx_L1_error)\n\n    /* \"pywrapfst.pyx\":1010\n *     cdef fst.SymbolTable *tsyms = fst.SymbolTable.ReadText(tostring(filename),\n *                                                            deref(opts))\n *     if tsyms == NULL:             # <<<<<<<<<<<<<<\n *       raise FstIOError(\"Read failed: {!r}\".format(filename))\n *     return _init_SymbolTable(tsyms)\n */\n  }\n\n  /* \"pywrapfst.pyx\":1012\n *     if tsyms == NULL:\n *       raise FstIOError(\"Read failed: {!r}\".format(filename))\n *     return _init_SymbolTable(tsyms)             # <<<<<<<<<<<<<<\n * \n *   @classmethod\n */\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_3 = ((PyObject *)__pyx_f_9pywrapfst__init_SymbolTable(__pyx_v_tsyms)); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 1012, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_3);\n  __pyx_r = __pyx_t_3;\n  __pyx_t_3 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":988\n * \n *   @classmethod\n *   def read_text(cls, filename, bool allow_negative_labels=False):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     SymbolTable.read_text(filename)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_XDECREF(__pyx_t_6);\n  __Pyx_XDECREF(__pyx_t_7);\n  __Pyx_XDECREF(__pyx_t_8);\n  __Pyx_AddTraceback(\"pywrapfst.SymbolTable.read_text\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1015\n * \n *   @classmethod\n *   def read_fst(cls, filename, bool input_table):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     SymbolTable.read_fst(filename, input_table)\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_11SymbolTable_9read_fst(PyObject *__pyx_v_cls, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic char __pyx_doc_9pywrapfst_11SymbolTable_8read_fst[] = \"\\n    SymbolTable.read_fst(filename, input_table)\\n\\n    Reads symbol table from an FST file without loading the corresponding FST.\\n\\n    This class method creates a new SymbolTable by reading either the input or\\n    output symbol table from an FST file, without loading the corresponding FST.\\n\\n    Args:\\n      filename: The string location of the input FST file.\\n      input_table: Should the input table be read (True) or the output table\\n          (False)?\\n\\n    Returns:\\n      A new SymbolTable instance, or None if none can be read.\\n\\n    Raises:\\n      FstIOError: Read failed.\\n\\n    See also: `SymbolTable.read`, `SymbolTable.read_text`.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_11SymbolTable_9read_fst(PyObject *__pyx_v_cls, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  PyObject *__pyx_v_filename = 0;\n  bool __pyx_v_input_table;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"read_fst (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_filename,&__pyx_n_s_input_table,0};\n    PyObject* values[2] = {0,0};\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (likely((values[0] = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_filename)) != 0)) kw_args--;\n        else goto __pyx_L5_argtuple_error;\n        CYTHON_FALLTHROUGH;\n        case  1:\n        if (likely((values[1] = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_input_table)) != 0)) kw_args--;\n        else {\n          __Pyx_RaiseArgtupleInvalid(\"read_fst\", 1, 2, 2, 1); __PYX_ERR(0, 1015, __pyx_L3_error)\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"read_fst\") < 0)) __PYX_ERR(0, 1015, __pyx_L3_error)\n      }\n    } else if (PyTuple_GET_SIZE(__pyx_args) != 2) {\n      goto __pyx_L5_argtuple_error;\n    } else {\n      values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n      values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n    }\n    __pyx_v_filename = values[0];\n    __pyx_v_input_table = __Pyx_PyObject_IsTrue(values[1]); if (unlikely((__pyx_v_input_table == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 1015, __pyx_L3_error)\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"read_fst\", 1, 2, 2, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 1015, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst.SymbolTable.read_fst\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  __pyx_r = __pyx_pf_9pywrapfst_11SymbolTable_8read_fst(((PyTypeObject*)__pyx_v_cls), __pyx_v_filename, __pyx_v_input_table);\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_11SymbolTable_8read_fst(CYTHON_UNUSED PyTypeObject *__pyx_v_cls, PyObject *__pyx_v_filename, bool __pyx_v_input_table) {\n  fst::SymbolTable *__pyx_v_tsyms;\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  std::string __pyx_t_1;\n  int __pyx_t_2;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  PyObject *__pyx_t_6 = NULL;\n  PyObject *__pyx_t_7 = NULL;\n  PyObject *__pyx_t_8 = NULL;\n  __Pyx_RefNannySetupContext(\"read_fst\", 0);\n\n  /* \"pywrapfst.pyx\":1037\n *     See also: `SymbolTable.read`, `SymbolTable.read_text`.\n *     \"\"\"\n *     cdef fst.SymbolTable *tsyms = fst.FstReadSymbols(filename, input_table)             # <<<<<<<<<<<<<<\n *     if tsyms == NULL:\n *       raise FstIOError(\"Read failed: {!r}\".format(filename))\n */\n  __pyx_t_1 = __pyx_convert_string_from_py_std__in_string(__pyx_v_filename); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 1037, __pyx_L1_error)\n  __pyx_v_tsyms = fst::FstReadSymbols(__pyx_t_1, __pyx_v_input_table);\n\n  /* \"pywrapfst.pyx\":1038\n *     \"\"\"\n *     cdef fst.SymbolTable *tsyms = fst.FstReadSymbols(filename, input_table)\n *     if tsyms == NULL:             # <<<<<<<<<<<<<<\n *       raise FstIOError(\"Read failed: {!r}\".format(filename))\n *     return _init_SymbolTable(tsyms)\n */\n  __pyx_t_2 = ((__pyx_v_tsyms == NULL) != 0);\n  if (unlikely(__pyx_t_2)) {\n\n    /* \"pywrapfst.pyx\":1039\n *     cdef fst.SymbolTable *tsyms = fst.FstReadSymbols(filename, input_table)\n *     if tsyms == NULL:\n *       raise FstIOError(\"Read failed: {!r}\".format(filename))             # <<<<<<<<<<<<<<\n *     return _init_SymbolTable(tsyms)\n * \n */\n    __pyx_t_4 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstIOError); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 1039, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_4);\n    __pyx_t_6 = __Pyx_PyObject_GetAttrStr(__pyx_kp_s_Read_failed_r, __pyx_n_s_format); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 1039, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_6);\n    __pyx_t_7 = NULL;\n    if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_6))) {\n      __pyx_t_7 = PyMethod_GET_SELF(__pyx_t_6);\n      if (likely(__pyx_t_7)) {\n        PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_6);\n        __Pyx_INCREF(__pyx_t_7);\n        __Pyx_INCREF(function);\n        __Pyx_DECREF_SET(__pyx_t_6, function);\n      }\n    }\n    if (!__pyx_t_7) {\n      __pyx_t_5 = __Pyx_PyObject_CallOneArg(__pyx_t_6, __pyx_v_filename); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 1039, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_5);\n    } else {\n      #if CYTHON_FAST_PYCALL\n      if (PyFunction_Check(__pyx_t_6)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_7, __pyx_v_filename};\n        __pyx_t_5 = __Pyx_PyFunction_FastCall(__pyx_t_6, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 1039, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_7); __pyx_t_7 = 0;\n        __Pyx_GOTREF(__pyx_t_5);\n      } else\n      #endif\n      #if CYTHON_FAST_PYCCALL\n      if (__Pyx_PyFastCFunction_Check(__pyx_t_6)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_7, __pyx_v_filename};\n        __pyx_t_5 = __Pyx_PyCFunction_FastCall(__pyx_t_6, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 1039, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_7); __pyx_t_7 = 0;\n        __Pyx_GOTREF(__pyx_t_5);\n      } else\n      #endif\n      {\n        __pyx_t_8 = PyTuple_New(1+1); if (unlikely(!__pyx_t_8)) __PYX_ERR(0, 1039, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_8);\n        __Pyx_GIVEREF(__pyx_t_7); PyTuple_SET_ITEM(__pyx_t_8, 0, __pyx_t_7); __pyx_t_7 = NULL;\n        __Pyx_INCREF(__pyx_v_filename);\n        __Pyx_GIVEREF(__pyx_v_filename);\n        PyTuple_SET_ITEM(__pyx_t_8, 0+1, __pyx_v_filename);\n        __pyx_t_5 = __Pyx_PyObject_Call(__pyx_t_6, __pyx_t_8, NULL); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 1039, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_5);\n        __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0;\n      }\n    }\n    __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n    __pyx_t_6 = NULL;\n    if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_4))) {\n      __pyx_t_6 = PyMethod_GET_SELF(__pyx_t_4);\n      if (likely(__pyx_t_6)) {\n        PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_4);\n        __Pyx_INCREF(__pyx_t_6);\n        __Pyx_INCREF(function);\n        __Pyx_DECREF_SET(__pyx_t_4, function);\n      }\n    }\n    if (!__pyx_t_6) {\n      __pyx_t_3 = __Pyx_PyObject_CallOneArg(__pyx_t_4, __pyx_t_5); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 1039, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n      __Pyx_GOTREF(__pyx_t_3);\n    } else {\n      #if CYTHON_FAST_PYCALL\n      if (PyFunction_Check(__pyx_t_4)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_6, __pyx_t_5};\n        __pyx_t_3 = __Pyx_PyFunction_FastCall(__pyx_t_4, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 1039, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_6); __pyx_t_6 = 0;\n        __Pyx_GOTREF(__pyx_t_3);\n        __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n      } else\n      #endif\n      #if CYTHON_FAST_PYCCALL\n      if (__Pyx_PyFastCFunction_Check(__pyx_t_4)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_6, __pyx_t_5};\n        __pyx_t_3 = __Pyx_PyCFunction_FastCall(__pyx_t_4, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 1039, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_6); __pyx_t_6 = 0;\n        __Pyx_GOTREF(__pyx_t_3);\n        __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n      } else\n      #endif\n      {\n        __pyx_t_8 = PyTuple_New(1+1); if (unlikely(!__pyx_t_8)) __PYX_ERR(0, 1039, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_8);\n        __Pyx_GIVEREF(__pyx_t_6); PyTuple_SET_ITEM(__pyx_t_8, 0, __pyx_t_6); __pyx_t_6 = NULL;\n        __Pyx_GIVEREF(__pyx_t_5);\n        PyTuple_SET_ITEM(__pyx_t_8, 0+1, __pyx_t_5);\n        __pyx_t_5 = 0;\n        __pyx_t_3 = __Pyx_PyObject_Call(__pyx_t_4, __pyx_t_8, NULL); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 1039, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_3);\n        __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0;\n      }\n    }\n    __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n    __Pyx_Raise(__pyx_t_3, 0, 0, 0);\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    __PYX_ERR(0, 1039, __pyx_L1_error)\n\n    /* \"pywrapfst.pyx\":1038\n *     \"\"\"\n *     cdef fst.SymbolTable *tsyms = fst.FstReadSymbols(filename, input_table)\n *     if tsyms == NULL:             # <<<<<<<<<<<<<<\n *       raise FstIOError(\"Read failed: {!r}\".format(filename))\n *     return _init_SymbolTable(tsyms)\n */\n  }\n\n  /* \"pywrapfst.pyx\":1040\n *     if tsyms == NULL:\n *       raise FstIOError(\"Read failed: {!r}\".format(filename))\n *     return _init_SymbolTable(tsyms)             # <<<<<<<<<<<<<<\n * \n * \n */\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_3 = ((PyObject *)__pyx_f_9pywrapfst__init_SymbolTable(__pyx_v_tsyms)); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 1040, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_3);\n  __pyx_r = __pyx_t_3;\n  __pyx_t_3 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":1015\n * \n *   @classmethod\n *   def read_fst(cls, filename, bool input_table):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     SymbolTable.read_fst(filename, input_table)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_XDECREF(__pyx_t_6);\n  __Pyx_XDECREF(__pyx_t_7);\n  __Pyx_XDECREF(__pyx_t_8);\n  __Pyx_AddTraceback(\"pywrapfst.SymbolTable.read_fst\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"(tree fragment)\":1\n * def __reduce_cython__(self):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._smart_table,self._table cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_11SymbolTable_11__reduce_cython__(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_11SymbolTable_11__reduce_cython__(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__reduce_cython__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_11SymbolTable_10__reduce_cython__(((struct __pyx_obj_9pywrapfst_SymbolTable *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_11SymbolTable_10__reduce_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst_SymbolTable *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"__reduce_cython__\", 0);\n\n  /* \"(tree fragment)\":2\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._smart_table,self._table cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._smart_table,self._table cannot be converted to a Python object for pickling\")\n */\n  __pyx_t_1 = __Pyx_PyObject_Call(__pyx_builtin_TypeError, __pyx_tuple__18, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(1, 2, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __Pyx_Raise(__pyx_t_1, 0, 0, 0);\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  __PYX_ERR(1, 2, __pyx_L1_error)\n\n  /* \"(tree fragment)\":1\n * def __reduce_cython__(self):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._smart_table,self._table cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.SymbolTable.__reduce_cython__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"(tree fragment)\":3\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._smart_table,self._table cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._smart_table,self._table cannot be converted to a Python object for pickling\")\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_11SymbolTable_13__setstate_cython__(PyObject *__pyx_v_self, PyObject *__pyx_v___pyx_state); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_11SymbolTable_13__setstate_cython__(PyObject *__pyx_v_self, PyObject *__pyx_v___pyx_state) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__setstate_cython__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_11SymbolTable_12__setstate_cython__(((struct __pyx_obj_9pywrapfst_SymbolTable *)__pyx_v_self), ((PyObject *)__pyx_v___pyx_state));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_11SymbolTable_12__setstate_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst_SymbolTable *__pyx_v_self, CYTHON_UNUSED PyObject *__pyx_v___pyx_state) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"__setstate_cython__\", 0);\n\n  /* \"(tree fragment)\":4\n *     raise TypeError(\"self._smart_table,self._table cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._smart_table,self._table cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n */\n  __pyx_t_1 = __Pyx_PyObject_Call(__pyx_builtin_TypeError, __pyx_tuple__19, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(1, 4, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __Pyx_Raise(__pyx_t_1, 0, 0, 0);\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  __PYX_ERR(1, 4, __pyx_L1_error)\n\n  /* \"(tree fragment)\":3\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._smart_table,self._table cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._smart_table,self._table cannot be converted to a Python object for pickling\")\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.SymbolTable.__setstate_cython__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1043\n * \n * \n * cdef _EncodeMapperSymbolTable _init_EncodeMapperSymbolTable(             # <<<<<<<<<<<<<<\n *     fst.SymbolTable *table, shared_ptr[fst.EncodeMapperClass] encoder):\n *   cdef _EncodeMapperSymbolTable result = (\n */\n\nstatic struct __pyx_obj_9pywrapfst__EncodeMapperSymbolTable *__pyx_f_9pywrapfst__init_EncodeMapperSymbolTable(fst::SymbolTable *__pyx_v_table, std::shared_ptr<fst::script::EncodeMapperClass>  __pyx_v_encoder) {\n  struct __pyx_obj_9pywrapfst__EncodeMapperSymbolTable *__pyx_v_result = 0;\n  struct __pyx_obj_9pywrapfst__EncodeMapperSymbolTable *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"_init_EncodeMapperSymbolTable\", 0);\n\n  /* \"pywrapfst.pyx\":1046\n *     fst.SymbolTable *table, shared_ptr[fst.EncodeMapperClass] encoder):\n *   cdef _EncodeMapperSymbolTable result = (\n *       _EncodeMapperSymbolTable.__new__(_EncodeMapperSymbolTable))             # <<<<<<<<<<<<<<\n *   result._table = table\n *   result._encoder = encoder\n */\n  __pyx_t_1 = ((PyObject *)__pyx_tp_new_9pywrapfst__EncodeMapperSymbolTable(((PyTypeObject *)__pyx_ptype_9pywrapfst__EncodeMapperSymbolTable), __pyx_empty_tuple, NULL)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1046, __pyx_L1_error)\n  __Pyx_GOTREF(((PyObject *)__pyx_t_1));\n  __pyx_v_result = ((struct __pyx_obj_9pywrapfst__EncodeMapperSymbolTable *)__pyx_t_1);\n  __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":1047\n *   cdef _EncodeMapperSymbolTable result = (\n *       _EncodeMapperSymbolTable.__new__(_EncodeMapperSymbolTable))\n *   result._table = table             # <<<<<<<<<<<<<<\n *   result._encoder = encoder\n *   return result\n */\n  if (unlikely(((PyObject *)__pyx_v_result) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_table\");\n    __PYX_ERR(0, 1047, __pyx_L1_error)\n  }\n  __pyx_v_result->__pyx_base._table = __pyx_v_table;\n\n  /* \"pywrapfst.pyx\":1048\n *       _EncodeMapperSymbolTable.__new__(_EncodeMapperSymbolTable))\n *   result._table = table\n *   result._encoder = encoder             # <<<<<<<<<<<<<<\n *   return result\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_result) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_encoder\");\n    __PYX_ERR(0, 1048, __pyx_L1_error)\n  }\n  __pyx_v_result->_encoder = __pyx_v_encoder;\n\n  /* \"pywrapfst.pyx\":1049\n *   result._table = table\n *   result._encoder = encoder\n *   return result             # <<<<<<<<<<<<<<\n * \n * \n */\n  __Pyx_XDECREF(((PyObject *)__pyx_r));\n  __Pyx_INCREF(((PyObject *)__pyx_v_result));\n  __pyx_r = __pyx_v_result;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":1043\n * \n * \n * cdef _EncodeMapperSymbolTable _init_EncodeMapperSymbolTable(             # <<<<<<<<<<<<<<\n *     fst.SymbolTable *table, shared_ptr[fst.EncodeMapperClass] encoder):\n *   cdef _EncodeMapperSymbolTable result = (\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst._init_EncodeMapperSymbolTable\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XDECREF((PyObject *)__pyx_v_result);\n  __Pyx_XGIVEREF((PyObject *)__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1052\n * \n * \n * cdef _FstSymbolTable _init_FstSymbolTable(fst.SymbolTable *table,             # <<<<<<<<<<<<<<\n *                                           shared_ptr[fst.FstClass] ifst):\n *   cdef _FstSymbolTable result = _FstSymbolTable.__new__(_FstSymbolTable)\n */\n\nstatic struct __pyx_obj_9pywrapfst__FstSymbolTable *__pyx_f_9pywrapfst__init_FstSymbolTable(fst::SymbolTable *__pyx_v_table, std::shared_ptr<fst::script::FstClass>  __pyx_v_ifst) {\n  struct __pyx_obj_9pywrapfst__FstSymbolTable *__pyx_v_result = 0;\n  struct __pyx_obj_9pywrapfst__FstSymbolTable *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"_init_FstSymbolTable\", 0);\n\n  /* \"pywrapfst.pyx\":1054\n * cdef _FstSymbolTable _init_FstSymbolTable(fst.SymbolTable *table,\n *                                           shared_ptr[fst.FstClass] ifst):\n *   cdef _FstSymbolTable result = _FstSymbolTable.__new__(_FstSymbolTable)             # <<<<<<<<<<<<<<\n *   result._table = table\n *   result._fst = ifst\n */\n  __pyx_t_1 = ((PyObject *)__pyx_tp_new_9pywrapfst__FstSymbolTable(((PyTypeObject *)__pyx_ptype_9pywrapfst__FstSymbolTable), __pyx_empty_tuple, NULL)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1054, __pyx_L1_error)\n  __Pyx_GOTREF(((PyObject *)__pyx_t_1));\n  __pyx_v_result = ((struct __pyx_obj_9pywrapfst__FstSymbolTable *)__pyx_t_1);\n  __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":1055\n *                                           shared_ptr[fst.FstClass] ifst):\n *   cdef _FstSymbolTable result = _FstSymbolTable.__new__(_FstSymbolTable)\n *   result._table = table             # <<<<<<<<<<<<<<\n *   result._fst = ifst\n *   return result\n */\n  if (unlikely(((PyObject *)__pyx_v_result) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_table\");\n    __PYX_ERR(0, 1055, __pyx_L1_error)\n  }\n  __pyx_v_result->__pyx_base._table = __pyx_v_table;\n\n  /* \"pywrapfst.pyx\":1056\n *   cdef _FstSymbolTable result = _FstSymbolTable.__new__(_FstSymbolTable)\n *   result._table = table\n *   result._fst = ifst             # <<<<<<<<<<<<<<\n *   return result\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_result) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 1056, __pyx_L1_error)\n  }\n  __pyx_v_result->_fst = __pyx_v_ifst;\n\n  /* \"pywrapfst.pyx\":1057\n *   result._table = table\n *   result._fst = ifst\n *   return result             # <<<<<<<<<<<<<<\n * \n * \n */\n  __Pyx_XDECREF(((PyObject *)__pyx_r));\n  __Pyx_INCREF(((PyObject *)__pyx_v_result));\n  __pyx_r = __pyx_v_result;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":1052\n * \n * \n * cdef _FstSymbolTable _init_FstSymbolTable(fst.SymbolTable *table,             # <<<<<<<<<<<<<<\n *                                           shared_ptr[fst.FstClass] ifst):\n *   cdef _FstSymbolTable result = _FstSymbolTable.__new__(_FstSymbolTable)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst._init_FstSymbolTable\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XDECREF((PyObject *)__pyx_v_result);\n  __Pyx_XGIVEREF((PyObject *)__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1060\n * \n * \n * cdef _MutableFstSymbolTable _init_MutableFstSymbolTable(fst.SymbolTable *table,             # <<<<<<<<<<<<<<\n *     shared_ptr[fst.MutableFstClass] ifst):\n *   cdef _MutableFstSymbolTable result = (\n */\n\nstatic struct __pyx_obj_9pywrapfst__MutableFstSymbolTable *__pyx_f_9pywrapfst__init_MutableFstSymbolTable(fst::SymbolTable *__pyx_v_table, std::shared_ptr<fst::script::MutableFstClass>  __pyx_v_ifst) {\n  struct __pyx_obj_9pywrapfst__MutableFstSymbolTable *__pyx_v_result = 0;\n  struct __pyx_obj_9pywrapfst__MutableFstSymbolTable *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"_init_MutableFstSymbolTable\", 0);\n\n  /* \"pywrapfst.pyx\":1063\n *     shared_ptr[fst.MutableFstClass] ifst):\n *   cdef _MutableFstSymbolTable result = (\n *       _MutableFstSymbolTable.__new__(_MutableFstSymbolTable))             # <<<<<<<<<<<<<<\n *   result._table = table\n *   result._mfst = ifst\n */\n  __pyx_t_1 = ((PyObject *)__pyx_tp_new_9pywrapfst__MutableFstSymbolTable(((PyTypeObject *)__pyx_ptype_9pywrapfst__MutableFstSymbolTable), __pyx_empty_tuple, NULL)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1063, __pyx_L1_error)\n  __Pyx_GOTREF(((PyObject *)__pyx_t_1));\n  __pyx_v_result = ((struct __pyx_obj_9pywrapfst__MutableFstSymbolTable *)__pyx_t_1);\n  __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":1064\n *   cdef _MutableFstSymbolTable result = (\n *       _MutableFstSymbolTable.__new__(_MutableFstSymbolTable))\n *   result._table = table             # <<<<<<<<<<<<<<\n *   result._mfst = ifst\n *   return result\n */\n  if (unlikely(((PyObject *)__pyx_v_result) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_table\");\n    __PYX_ERR(0, 1064, __pyx_L1_error)\n  }\n  __pyx_v_result->__pyx_base.__pyx_base._table = __pyx_v_table;\n\n  /* \"pywrapfst.pyx\":1065\n *       _MutableFstSymbolTable.__new__(_MutableFstSymbolTable))\n *   result._table = table\n *   result._mfst = ifst             # <<<<<<<<<<<<<<\n *   return result\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_result) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_mfst\");\n    __PYX_ERR(0, 1065, __pyx_L1_error)\n  }\n  __pyx_v_result->_mfst = __pyx_v_ifst;\n\n  /* \"pywrapfst.pyx\":1066\n *   result._table = table\n *   result._mfst = ifst\n *   return result             # <<<<<<<<<<<<<<\n * \n * \n */\n  __Pyx_XDECREF(((PyObject *)__pyx_r));\n  __Pyx_INCREF(((PyObject *)__pyx_v_result));\n  __pyx_r = __pyx_v_result;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":1060\n * \n * \n * cdef _MutableFstSymbolTable _init_MutableFstSymbolTable(fst.SymbolTable *table,             # <<<<<<<<<<<<<<\n *     shared_ptr[fst.MutableFstClass] ifst):\n *   cdef _MutableFstSymbolTable result = (\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst._init_MutableFstSymbolTable\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XDECREF((PyObject *)__pyx_v_result);\n  __Pyx_XGIVEREF((PyObject *)__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1069\n * \n * \n * cdef SymbolTable _init_SymbolTable(fst.SymbolTable *table):             # <<<<<<<<<<<<<<\n *   cdef SymbolTable result = SymbolTable.__new__(SymbolTable)\n *   result._table = table\n */\n\nstatic struct __pyx_obj_9pywrapfst_SymbolTable *__pyx_f_9pywrapfst__init_SymbolTable(fst::SymbolTable *__pyx_v_table) {\n  struct __pyx_obj_9pywrapfst_SymbolTable *__pyx_v_result = 0;\n  struct __pyx_obj_9pywrapfst_SymbolTable *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"_init_SymbolTable\", 0);\n\n  /* \"pywrapfst.pyx\":1070\n * \n * cdef SymbolTable _init_SymbolTable(fst.SymbolTable *table):\n *   cdef SymbolTable result = SymbolTable.__new__(SymbolTable)             # <<<<<<<<<<<<<<\n *   result._table = table\n *   return result\n */\n  __pyx_t_1 = ((PyObject *)__pyx_tp_new_9pywrapfst_SymbolTable(((PyTypeObject *)__pyx_ptype_9pywrapfst_SymbolTable), __pyx_empty_tuple, NULL)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1070, __pyx_L1_error)\n  __Pyx_GOTREF(((PyObject *)__pyx_t_1));\n  __pyx_v_result = ((struct __pyx_obj_9pywrapfst_SymbolTable *)__pyx_t_1);\n  __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":1071\n * cdef SymbolTable _init_SymbolTable(fst.SymbolTable *table):\n *   cdef SymbolTable result = SymbolTable.__new__(SymbolTable)\n *   result._table = table             # <<<<<<<<<<<<<<\n *   return result\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_result) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_table\");\n    __PYX_ERR(0, 1071, __pyx_L1_error)\n  }\n  __pyx_v_result->__pyx_base.__pyx_base._table = __pyx_v_table;\n\n  /* \"pywrapfst.pyx\":1072\n *   cdef SymbolTable result = SymbolTable.__new__(SymbolTable)\n *   result._table = table\n *   return result             # <<<<<<<<<<<<<<\n * \n * \n */\n  __Pyx_XDECREF(((PyObject *)__pyx_r));\n  __Pyx_INCREF(((PyObject *)__pyx_v_result));\n  __pyx_r = __pyx_v_result;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":1069\n * \n * \n * cdef SymbolTable _init_SymbolTable(fst.SymbolTable *table):             # <<<<<<<<<<<<<<\n *   cdef SymbolTable result = SymbolTable.__new__(SymbolTable)\n *   result._table = table\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst._init_SymbolTable\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XDECREF((PyObject *)__pyx_v_result);\n  __Pyx_XGIVEREF((PyObject *)__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1078\n * \n * \n * cpdef SymbolTable compact_symbol_table(_SymbolTable syms):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   compact_symbol_table(syms)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_9compact_symbol_table(PyObject *__pyx_self, PyObject *__pyx_v_syms); /*proto*/\nstatic struct __pyx_obj_9pywrapfst_SymbolTable *__pyx_f_9pywrapfst_compact_symbol_table(struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_syms, CYTHON_UNUSED int __pyx_skip_dispatch) {\n  struct __pyx_obj_9pywrapfst_SymbolTable *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"compact_symbol_table\", 0);\n\n  /* \"pywrapfst.pyx\":1090\n *     A new compacted SymbolTable.\n *   \"\"\"\n *   return _init_SymbolTable(fst.CompactSymbolTable(deref(syms._table)))             # <<<<<<<<<<<<<<\n * \n * \n */\n  __Pyx_XDECREF(((PyObject *)__pyx_r));\n  if (unlikely(((PyObject *)__pyx_v_syms) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_table\");\n    __PYX_ERR(0, 1090, __pyx_L1_error)\n  }\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst__init_SymbolTable(fst::CompactSymbolTable((*__pyx_v_syms->_table)))); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1090, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = ((struct __pyx_obj_9pywrapfst_SymbolTable *)__pyx_t_1);\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":1078\n * \n * \n * cpdef SymbolTable compact_symbol_table(_SymbolTable syms):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   compact_symbol_table(syms)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.compact_symbol_table\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XGIVEREF((PyObject *)__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_9compact_symbol_table(PyObject *__pyx_self, PyObject *__pyx_v_syms); /*proto*/\nstatic char __pyx_doc_9pywrapfst_8compact_symbol_table[] = \"\\n  compact_symbol_table(syms)\\n\\n  Constructively relabels a SymbolTable to make it a contiguous mapping.\\n\\n  Args:\\n    syms: Input SymbolTable.\\n\\n  Returns:\\n    A new compacted SymbolTable.\\n  \";\nstatic PyObject *__pyx_pw_9pywrapfst_9compact_symbol_table(PyObject *__pyx_self, PyObject *__pyx_v_syms) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"compact_symbol_table (wrapper)\", 0);\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_syms), __pyx_ptype_9pywrapfst__SymbolTable, 1, \"syms\", 0))) __PYX_ERR(0, 1078, __pyx_L1_error)\n  __pyx_r = __pyx_pf_9pywrapfst_8compact_symbol_table(__pyx_self, ((struct __pyx_obj_9pywrapfst__SymbolTable *)__pyx_v_syms));\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_8compact_symbol_table(CYTHON_UNUSED PyObject *__pyx_self, struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_syms) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"compact_symbol_table\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst_compact_symbol_table(__pyx_v_syms, 0)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1078, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.compact_symbol_table\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1093\n * \n * \n * cpdef SymbolTable merge_symbol_table(_SymbolTable lhs, _SymbolTable rhs):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   merge_symbol_table(lhs, rhs)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_11merge_symbol_table(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic struct __pyx_obj_9pywrapfst_SymbolTable *__pyx_f_9pywrapfst_merge_symbol_table(struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_lhs, struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_rhs, CYTHON_UNUSED int __pyx_skip_dispatch) {\n  struct __pyx_obj_9pywrapfst_SymbolTable *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"merge_symbol_table\", 0);\n\n  /* \"pywrapfst.pyx\":1117\n *   See also: `relabel_symbols`.\n *   \"\"\"\n *   return _init_SymbolTable(fst.MergeSymbolTable(deref(lhs._table),             # <<<<<<<<<<<<<<\n *                                                 deref(rhs._table), NULL))\n * \n */\n  __Pyx_XDECREF(((PyObject *)__pyx_r));\n  if (unlikely(((PyObject *)__pyx_v_lhs) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_table\");\n    __PYX_ERR(0, 1117, __pyx_L1_error)\n  }\n\n  /* \"pywrapfst.pyx\":1118\n *   \"\"\"\n *   return _init_SymbolTable(fst.MergeSymbolTable(deref(lhs._table),\n *                                                 deref(rhs._table), NULL))             # <<<<<<<<<<<<<<\n * \n * \n */\n  if (unlikely(((PyObject *)__pyx_v_rhs) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_table\");\n    __PYX_ERR(0, 1118, __pyx_L1_error)\n  }\n\n  /* \"pywrapfst.pyx\":1117\n *   See also: `relabel_symbols`.\n *   \"\"\"\n *   return _init_SymbolTable(fst.MergeSymbolTable(deref(lhs._table),             # <<<<<<<<<<<<<<\n *                                                 deref(rhs._table), NULL))\n * \n */\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst__init_SymbolTable(fst::MergeSymbolTable((*__pyx_v_lhs->_table), (*__pyx_v_rhs->_table), NULL))); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1117, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = ((struct __pyx_obj_9pywrapfst_SymbolTable *)__pyx_t_1);\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":1093\n * \n * \n * cpdef SymbolTable merge_symbol_table(_SymbolTable lhs, _SymbolTable rhs):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   merge_symbol_table(lhs, rhs)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.merge_symbol_table\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XGIVEREF((PyObject *)__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_11merge_symbol_table(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic char __pyx_doc_9pywrapfst_10merge_symbol_table[] = \"\\n  merge_symbol_table(lhs, rhs)\\n\\n  Merges all symbols from the left table into the right.\\n\\n  This function creates a new SymbolTable which is the merger of the two input\\n  symbol Tables. Symbols in the right-hand table that conflict with those in the\\n  left-hand table will be assigned values from the left-hand table. Thus the\\n  returned table will never modify symbol assignments from the left-hand side,\\n  but may do so on the right.\\n\\n  If the left-hand table is associated with an FST, it may be necessary to\\n  relabel it using the output table.\\n\\n  Args:\\n    lhs: Left-hand side SymbolTable.\\n    rhs: Left-hand side SymbolTable.\\n\\n  Returns:\\n    A new merged SymbolTable.\\n\\n  See also: `relabel_symbols`.\\n  \";\nstatic PyObject *__pyx_pw_9pywrapfst_11merge_symbol_table(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_lhs = 0;\n  struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_rhs = 0;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"merge_symbol_table (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_lhs,&__pyx_n_s_rhs,0};\n    PyObject* values[2] = {0,0};\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (likely((values[0] = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_lhs)) != 0)) kw_args--;\n        else goto __pyx_L5_argtuple_error;\n        CYTHON_FALLTHROUGH;\n        case  1:\n        if (likely((values[1] = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_rhs)) != 0)) kw_args--;\n        else {\n          __Pyx_RaiseArgtupleInvalid(\"merge_symbol_table\", 1, 2, 2, 1); __PYX_ERR(0, 1093, __pyx_L3_error)\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"merge_symbol_table\") < 0)) __PYX_ERR(0, 1093, __pyx_L3_error)\n      }\n    } else if (PyTuple_GET_SIZE(__pyx_args) != 2) {\n      goto __pyx_L5_argtuple_error;\n    } else {\n      values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n      values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n    }\n    __pyx_v_lhs = ((struct __pyx_obj_9pywrapfst__SymbolTable *)values[0]);\n    __pyx_v_rhs = ((struct __pyx_obj_9pywrapfst__SymbolTable *)values[1]);\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"merge_symbol_table\", 1, 2, 2, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 1093, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst.merge_symbol_table\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_lhs), __pyx_ptype_9pywrapfst__SymbolTable, 1, \"lhs\", 0))) __PYX_ERR(0, 1093, __pyx_L1_error)\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_rhs), __pyx_ptype_9pywrapfst__SymbolTable, 1, \"rhs\", 0))) __PYX_ERR(0, 1093, __pyx_L1_error)\n  __pyx_r = __pyx_pf_9pywrapfst_10merge_symbol_table(__pyx_self, __pyx_v_lhs, __pyx_v_rhs);\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_10merge_symbol_table(CYTHON_UNUSED PyObject *__pyx_self, struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_lhs, struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_rhs) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"merge_symbol_table\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst_merge_symbol_table(__pyx_v_lhs, __pyx_v_rhs, 0)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1093, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.merge_symbol_table\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1132\n *   \"\"\"\n * \n *   def __repr__(self):             # <<<<<<<<<<<<<<\n *     return \"<SymbolTableIterator at 0x{:x}>\".format(id(self))\n * \n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_19SymbolTableIterator_1__repr__(PyObject *__pyx_v_self); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_19SymbolTableIterator_1__repr__(PyObject *__pyx_v_self) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__repr__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_19SymbolTableIterator___repr__(((struct __pyx_obj_9pywrapfst_SymbolTableIterator *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_19SymbolTableIterator___repr__(struct __pyx_obj_9pywrapfst_SymbolTableIterator *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  __Pyx_RefNannySetupContext(\"__repr__\", 0);\n\n  /* \"pywrapfst.pyx\":1133\n * \n *   def __repr__(self):\n *     return \"<SymbolTableIterator at 0x{:x}>\".format(id(self))             # <<<<<<<<<<<<<<\n * \n *   def __init__(self, _SymbolTable syms):\n */\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_2 = __Pyx_PyObject_GetAttrStr(__pyx_kp_s_SymbolTableIterator_at_0x_x, __pyx_n_s_format); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1133, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  __pyx_t_3 = __Pyx_PyObject_CallOneArg(__pyx_builtin_id, ((PyObject *)__pyx_v_self)); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 1133, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_3);\n  __pyx_t_4 = NULL;\n  if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_2))) {\n    __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_2);\n    if (likely(__pyx_t_4)) {\n      PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_2);\n      __Pyx_INCREF(__pyx_t_4);\n      __Pyx_INCREF(function);\n      __Pyx_DECREF_SET(__pyx_t_2, function);\n    }\n  }\n  if (!__pyx_t_4) {\n    __pyx_t_1 = __Pyx_PyObject_CallOneArg(__pyx_t_2, __pyx_t_3); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1133, __pyx_L1_error)\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    __Pyx_GOTREF(__pyx_t_1);\n  } else {\n    #if CYTHON_FAST_PYCALL\n    if (PyFunction_Check(__pyx_t_2)) {\n      PyObject *__pyx_temp[2] = {__pyx_t_4, __pyx_t_3};\n      __pyx_t_1 = __Pyx_PyFunction_FastCall(__pyx_t_2, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1133, __pyx_L1_error)\n      __Pyx_XDECREF(__pyx_t_4); __pyx_t_4 = 0;\n      __Pyx_GOTREF(__pyx_t_1);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    } else\n    #endif\n    #if CYTHON_FAST_PYCCALL\n    if (__Pyx_PyFastCFunction_Check(__pyx_t_2)) {\n      PyObject *__pyx_temp[2] = {__pyx_t_4, __pyx_t_3};\n      __pyx_t_1 = __Pyx_PyCFunction_FastCall(__pyx_t_2, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1133, __pyx_L1_error)\n      __Pyx_XDECREF(__pyx_t_4); __pyx_t_4 = 0;\n      __Pyx_GOTREF(__pyx_t_1);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    } else\n    #endif\n    {\n      __pyx_t_5 = PyTuple_New(1+1); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 1133, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_5);\n      __Pyx_GIVEREF(__pyx_t_4); PyTuple_SET_ITEM(__pyx_t_5, 0, __pyx_t_4); __pyx_t_4 = NULL;\n      __Pyx_GIVEREF(__pyx_t_3);\n      PyTuple_SET_ITEM(__pyx_t_5, 0+1, __pyx_t_3);\n      __pyx_t_3 = 0;\n      __pyx_t_1 = __Pyx_PyObject_Call(__pyx_t_2, __pyx_t_5, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1133, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_1);\n      __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n    }\n  }\n  __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":1132\n *   \"\"\"\n * \n *   def __repr__(self):             # <<<<<<<<<<<<<<\n *     return \"<SymbolTableIterator at 0x{:x}>\".format(id(self))\n * \n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_AddTraceback(\"pywrapfst.SymbolTableIterator.__repr__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1135\n *     return \"<SymbolTableIterator at 0x{:x}>\".format(id(self))\n * \n *   def __init__(self, _SymbolTable syms):             # <<<<<<<<<<<<<<\n *     self._siter.reset(new fst.SymbolTableIterator(deref(syms._table)))\n * \n */\n\n/* Python wrapper */\nstatic int __pyx_pw_9pywrapfst_19SymbolTableIterator_3__init__(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic int __pyx_pw_9pywrapfst_19SymbolTableIterator_3__init__(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_syms = 0;\n  int __pyx_r;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__init__ (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_syms,0};\n    PyObject* values[1] = {0};\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (likely((values[0] = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_syms)) != 0)) kw_args--;\n        else goto __pyx_L5_argtuple_error;\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"__init__\") < 0)) __PYX_ERR(0, 1135, __pyx_L3_error)\n      }\n    } else if (PyTuple_GET_SIZE(__pyx_args) != 1) {\n      goto __pyx_L5_argtuple_error;\n    } else {\n      values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n    }\n    __pyx_v_syms = ((struct __pyx_obj_9pywrapfst__SymbolTable *)values[0]);\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"__init__\", 1, 1, 1, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 1135, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst.SymbolTableIterator.__init__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return -1;\n  __pyx_L4_argument_unpacking_done:;\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_syms), __pyx_ptype_9pywrapfst__SymbolTable, 1, \"syms\", 0))) __PYX_ERR(0, 1135, __pyx_L1_error)\n  __pyx_r = __pyx_pf_9pywrapfst_19SymbolTableIterator_2__init__(((struct __pyx_obj_9pywrapfst_SymbolTableIterator *)__pyx_v_self), __pyx_v_syms);\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __pyx_r = -1;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic int __pyx_pf_9pywrapfst_19SymbolTableIterator_2__init__(struct __pyx_obj_9pywrapfst_SymbolTableIterator *__pyx_v_self, struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_syms) {\n  int __pyx_r;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__init__\", 0);\n\n  /* \"pywrapfst.pyx\":1136\n * \n *   def __init__(self, _SymbolTable syms):\n *     self._siter.reset(new fst.SymbolTableIterator(deref(syms._table)))             # <<<<<<<<<<<<<<\n * \n *   # This just registers this class as a possible iterator.\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_siter\");\n    __PYX_ERR(0, 1136, __pyx_L1_error)\n  }\n  if (unlikely(((PyObject *)__pyx_v_syms) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_table\");\n    __PYX_ERR(0, 1136, __pyx_L1_error)\n  }\n  __pyx_v_self->_siter.reset(new fst::SymbolTableIterator((*__pyx_v_syms->_table)));\n\n  /* \"pywrapfst.pyx\":1135\n *     return \"<SymbolTableIterator at 0x{:x}>\".format(id(self))\n * \n *   def __init__(self, _SymbolTable syms):             # <<<<<<<<<<<<<<\n *     self._siter.reset(new fst.SymbolTableIterator(deref(syms._table)))\n * \n */\n\n  /* function exit code */\n  __pyx_r = 0;\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"pywrapfst.SymbolTableIterator.__init__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = -1;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1139\n * \n *   # This just registers this class as a possible iterator.\n *   def __iter__(self):             # <<<<<<<<<<<<<<\n *     return self\n * \n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_19SymbolTableIterator_5__iter__(PyObject *__pyx_v_self); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_19SymbolTableIterator_5__iter__(PyObject *__pyx_v_self) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__iter__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_19SymbolTableIterator_4__iter__(((struct __pyx_obj_9pywrapfst_SymbolTableIterator *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_19SymbolTableIterator_4__iter__(struct __pyx_obj_9pywrapfst_SymbolTableIterator *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__iter__\", 0);\n\n  /* \"pywrapfst.pyx\":1140\n *   # This just registers this class as a possible iterator.\n *   def __iter__(self):\n *     return self             # <<<<<<<<<<<<<<\n * \n *   # Magic method used to get a Pythonic API out of the C++ API.\n */\n  __Pyx_XDECREF(__pyx_r);\n  __Pyx_INCREF(((PyObject *)__pyx_v_self));\n  __pyx_r = ((PyObject *)__pyx_v_self);\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":1139\n * \n *   # This just registers this class as a possible iterator.\n *   def __iter__(self):             # <<<<<<<<<<<<<<\n *     return self\n * \n */\n\n  /* function exit code */\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1143\n * \n *   # Magic method used to get a Pythonic API out of the C++ API.\n *   def __next__(self):             # <<<<<<<<<<<<<<\n *     if self.done():\n *       raise StopIteration\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_19SymbolTableIterator_7__next__(PyObject *__pyx_v_self); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_19SymbolTableIterator_7__next__(PyObject *__pyx_v_self) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__next__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_19SymbolTableIterator_6__next__(((struct __pyx_obj_9pywrapfst_SymbolTableIterator *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_19SymbolTableIterator_6__next__(struct __pyx_obj_9pywrapfst_SymbolTableIterator *__pyx_v_self) {\n  __pyx_t_10basictypes_int64 __pyx_v_value;\n  std::string __pyx_v_symbol;\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  int __pyx_t_1;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  __Pyx_RefNannySetupContext(\"__next__\", 0);\n\n  /* \"pywrapfst.pyx\":1144\n *   # Magic method used to get a Pythonic API out of the C++ API.\n *   def __next__(self):\n *     if self.done():             # <<<<<<<<<<<<<<\n *       raise StopIteration\n *     cdef int64 value = self.value()\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"done\");\n    __PYX_ERR(0, 1144, __pyx_L1_error)\n  }\n  __pyx_t_1 = (((struct __pyx_vtabstruct_9pywrapfst_SymbolTableIterator *)__pyx_v_self->__pyx_vtab)->done(__pyx_v_self, 0) != 0);\n  if (unlikely(__pyx_t_1)) {\n\n    /* \"pywrapfst.pyx\":1145\n *   def __next__(self):\n *     if self.done():\n *       raise StopIteration             # <<<<<<<<<<<<<<\n *     cdef int64 value = self.value()\n *     cdef string symbol = self.symbol()\n */\n    __Pyx_Raise(__pyx_builtin_StopIteration, 0, 0, 0);\n    __PYX_ERR(0, 1145, __pyx_L1_error)\n\n    /* \"pywrapfst.pyx\":1144\n *   # Magic method used to get a Pythonic API out of the C++ API.\n *   def __next__(self):\n *     if self.done():             # <<<<<<<<<<<<<<\n *       raise StopIteration\n *     cdef int64 value = self.value()\n */\n  }\n\n  /* \"pywrapfst.pyx\":1146\n *     if self.done():\n *       raise StopIteration\n *     cdef int64 value = self.value()             # <<<<<<<<<<<<<<\n *     cdef string symbol = self.symbol()\n *     self.next()\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"value\");\n    __PYX_ERR(0, 1146, __pyx_L1_error)\n  }\n  __pyx_v_value = ((struct __pyx_vtabstruct_9pywrapfst_SymbolTableIterator *)__pyx_v_self->__pyx_vtab)->value(__pyx_v_self, 0);\n\n  /* \"pywrapfst.pyx\":1147\n *       raise StopIteration\n *     cdef int64 value = self.value()\n *     cdef string symbol = self.symbol()             # <<<<<<<<<<<<<<\n *     self.next()\n *     return (value, symbol)\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"symbol\");\n    __PYX_ERR(0, 1147, __pyx_L1_error)\n  }\n  __pyx_v_symbol = ((struct __pyx_vtabstruct_9pywrapfst_SymbolTableIterator *)__pyx_v_self->__pyx_vtab)->symbol(__pyx_v_self, 0);\n\n  /* \"pywrapfst.pyx\":1148\n *     cdef int64 value = self.value()\n *     cdef string symbol = self.symbol()\n *     self.next()             # <<<<<<<<<<<<<<\n *     return (value, symbol)\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"next\");\n    __PYX_ERR(0, 1148, __pyx_L1_error)\n  }\n  ((struct __pyx_vtabstruct_9pywrapfst_SymbolTableIterator *)__pyx_v_self->__pyx_vtab)->next(__pyx_v_self, 0);\n\n  /* \"pywrapfst.pyx\":1149\n *     cdef string symbol = self.symbol()\n *     self.next()\n *     return (value, symbol)             # <<<<<<<<<<<<<<\n * \n *   cpdef bool done(self):\n */\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_2 = __Pyx_PyInt_From_int64_t(__pyx_v_value); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1149, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  __pyx_t_3 = __pyx_convert_PyBytes_string_to_py_std__in_string(__pyx_v_symbol); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 1149, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_3);\n  __pyx_t_4 = PyTuple_New(2); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 1149, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_4);\n  __Pyx_GIVEREF(__pyx_t_2);\n  PyTuple_SET_ITEM(__pyx_t_4, 0, __pyx_t_2);\n  __Pyx_GIVEREF(__pyx_t_3);\n  PyTuple_SET_ITEM(__pyx_t_4, 1, __pyx_t_3);\n  __pyx_t_2 = 0;\n  __pyx_t_3 = 0;\n  __pyx_r = __pyx_t_4;\n  __pyx_t_4 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":1143\n * \n *   # Magic method used to get a Pythonic API out of the C++ API.\n *   def __next__(self):             # <<<<<<<<<<<<<<\n *     if self.done():\n *       raise StopIteration\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_AddTraceback(\"pywrapfst.SymbolTableIterator.__next__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1151\n *     return (value, symbol)\n * \n *   cpdef bool done(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     done(self)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_19SymbolTableIterator_9done(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic bool __pyx_f_9pywrapfst_19SymbolTableIterator_done(struct __pyx_obj_9pywrapfst_SymbolTableIterator *__pyx_v_self, int __pyx_skip_dispatch) {\n  bool __pyx_r;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  bool __pyx_t_5;\n  __Pyx_RefNannySetupContext(\"done\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_done); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1151, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_19SymbolTableIterator_9done)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1151, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1151, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __pyx_t_5 = __Pyx_PyObject_IsTrue(__pyx_t_2); if (unlikely((__pyx_t_5 == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 1151, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __pyx_r = __pyx_t_5;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":1160\n *       True if the iterator is exhausted, False otherwise.\n *     \"\"\"\n *     return self._siter.get().Done()             # <<<<<<<<<<<<<<\n * \n *   cpdef void next(self):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_siter\");\n    __PYX_ERR(0, 1160, __pyx_L1_error)\n  }\n  __pyx_r = __pyx_v_self->_siter.get()->Done();\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":1151\n *     return (value, symbol)\n * \n *   cpdef bool done(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     done(self)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_WriteUnraisable(\"pywrapfst.SymbolTableIterator.done\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_19SymbolTableIterator_9done(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_19SymbolTableIterator_8done[] = \"\\n    done(self)\\n\\n    Indicates whether the iterator is exhausted or not.\\n\\n    Returns:\\n      True if the iterator is exhausted, False otherwise.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_19SymbolTableIterator_9done(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"done (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_19SymbolTableIterator_8done(((struct __pyx_obj_9pywrapfst_SymbolTableIterator *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_19SymbolTableIterator_8done(struct __pyx_obj_9pywrapfst_SymbolTableIterator *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"done\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __Pyx_PyBool_FromLong(__pyx_f_9pywrapfst_19SymbolTableIterator_done(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1151, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.SymbolTableIterator.done\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1162\n *     return self._siter.get().Done()\n * \n *   cpdef void next(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     next(self)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_19SymbolTableIterator_11next(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic void __pyx_f_9pywrapfst_19SymbolTableIterator_next(struct __pyx_obj_9pywrapfst_SymbolTableIterator *__pyx_v_self, int __pyx_skip_dispatch) {\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  __Pyx_RefNannySetupContext(\"next\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_next); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1162, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_19SymbolTableIterator_11next)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1162, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1162, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":1168\n *     Advances the iterator.\n *     \"\"\"\n *     self._siter.get().Next()             # <<<<<<<<<<<<<<\n * \n *   cpdef void reset(self):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_siter\");\n    __PYX_ERR(0, 1168, __pyx_L1_error)\n  }\n  __pyx_v_self->_siter.get()->Next();\n\n  /* \"pywrapfst.pyx\":1162\n *     return self._siter.get().Done()\n * \n *   cpdef void next(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     next(self)\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_WriteUnraisable(\"pywrapfst.SymbolTableIterator.next\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_19SymbolTableIterator_11next(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_19SymbolTableIterator_10next[] = \"\\n    next(self)\\n\\n    Advances the iterator.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_19SymbolTableIterator_11next(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"next (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_19SymbolTableIterator_10next(((struct __pyx_obj_9pywrapfst_SymbolTableIterator *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_19SymbolTableIterator_10next(struct __pyx_obj_9pywrapfst_SymbolTableIterator *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"next\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __Pyx_void_to_None(__pyx_f_9pywrapfst_19SymbolTableIterator_next(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1162, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.SymbolTableIterator.next\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1170\n *     self._siter.get().Next()\n * \n *   cpdef void reset(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     reset(self)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_19SymbolTableIterator_13reset(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic void __pyx_f_9pywrapfst_19SymbolTableIterator_reset(struct __pyx_obj_9pywrapfst_SymbolTableIterator *__pyx_v_self, int __pyx_skip_dispatch) {\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  __Pyx_RefNannySetupContext(\"reset\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_reset); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1170, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_19SymbolTableIterator_13reset)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1170, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1170, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":1176\n *     Resets the iterator to the initial position.\n *     \"\"\"\n *     self._siter.get().Reset()             # <<<<<<<<<<<<<<\n * \n *   cpdef string symbol(self):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_siter\");\n    __PYX_ERR(0, 1176, __pyx_L1_error)\n  }\n  __pyx_v_self->_siter.get()->Reset();\n\n  /* \"pywrapfst.pyx\":1170\n *     self._siter.get().Next()\n * \n *   cpdef void reset(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     reset(self)\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_WriteUnraisable(\"pywrapfst.SymbolTableIterator.reset\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_19SymbolTableIterator_13reset(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_19SymbolTableIterator_12reset[] = \"\\n    reset(self)\\n\\n    Resets the iterator to the initial position.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_19SymbolTableIterator_13reset(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"reset (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_19SymbolTableIterator_12reset(((struct __pyx_obj_9pywrapfst_SymbolTableIterator *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_19SymbolTableIterator_12reset(struct __pyx_obj_9pywrapfst_SymbolTableIterator *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"reset\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __Pyx_void_to_None(__pyx_f_9pywrapfst_19SymbolTableIterator_reset(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1170, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.SymbolTableIterator.reset\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1178\n *     self._siter.get().Reset()\n * \n *   cpdef string symbol(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     symbol(self)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_19SymbolTableIterator_15symbol(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic std::string __pyx_f_9pywrapfst_19SymbolTableIterator_symbol(struct __pyx_obj_9pywrapfst_SymbolTableIterator *__pyx_v_self, int __pyx_skip_dispatch) {\n  std::string __pyx_r;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  std::string __pyx_t_5;\n  __Pyx_RefNannySetupContext(\"symbol\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_symbol); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1178, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_19SymbolTableIterator_15symbol)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1178, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1178, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __pyx_t_5 = __pyx_convert_string_from_py_std__in_string(__pyx_t_2); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 1178, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __pyx_r = __pyx_t_5;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":1189\n *       A symbol string.\n *     \"\"\"\n *     return self._siter.get().Symbol()             # <<<<<<<<<<<<<<\n * \n *   cpdef int64 value(self):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_siter\");\n    __PYX_ERR(0, 1189, __pyx_L1_error)\n  }\n  __pyx_r = __pyx_v_self->_siter.get()->Symbol();\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":1178\n *     self._siter.get().Reset()\n * \n *   cpdef string symbol(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     symbol(self)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_WriteUnraisable(\"pywrapfst.SymbolTableIterator.symbol\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __Pyx_pretend_to_initialize(&__pyx_r);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_19SymbolTableIterator_15symbol(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_19SymbolTableIterator_14symbol[] = \"\\n    symbol(self)\\n\\n    Returns the current symbol string.\\n\\n    This method returns the current symbol string at this point in the table.\\n\\n    Returns:\\n      A symbol string.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_19SymbolTableIterator_15symbol(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"symbol (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_19SymbolTableIterator_14symbol(((struct __pyx_obj_9pywrapfst_SymbolTableIterator *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_19SymbolTableIterator_14symbol(struct __pyx_obj_9pywrapfst_SymbolTableIterator *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"symbol\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __pyx_convert_PyBytes_string_to_py_std__in_string(__pyx_f_9pywrapfst_19SymbolTableIterator_symbol(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1178, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.SymbolTableIterator.symbol\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1191\n *     return self._siter.get().Symbol()\n * \n *   cpdef int64 value(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     value(self)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_19SymbolTableIterator_17value(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic __pyx_t_10basictypes_int64 __pyx_f_9pywrapfst_19SymbolTableIterator_value(struct __pyx_obj_9pywrapfst_SymbolTableIterator *__pyx_v_self, int __pyx_skip_dispatch) {\n  __pyx_t_10basictypes_int64 __pyx_r;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  __pyx_t_10basictypes_int64 __pyx_t_5;\n  __Pyx_RefNannySetupContext(\"value\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_value); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1191, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_19SymbolTableIterator_17value)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1191, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1191, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __pyx_t_5 = __Pyx_PyInt_As_int64_t(__pyx_t_2); if (unlikely((__pyx_t_5 == ((int64_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 1191, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __pyx_r = __pyx_t_5;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":1200\n *       An integer index.\n *     \"\"\"\n *     return self._siter.get().Value()             # <<<<<<<<<<<<<<\n * \n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_siter\");\n    __PYX_ERR(0, 1200, __pyx_L1_error)\n  }\n  __pyx_r = __pyx_v_self->_siter.get()->Value();\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":1191\n *     return self._siter.get().Symbol()\n * \n *   cpdef int64 value(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     value(self)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_WriteUnraisable(\"pywrapfst.SymbolTableIterator.value\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_19SymbolTableIterator_17value(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_19SymbolTableIterator_16value[] = \"\\n    value(self)\\n\\n    Returns the current integer index of the symbol.\\n\\n    Returns:\\n      An integer index.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_19SymbolTableIterator_17value(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"value (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_19SymbolTableIterator_16value(((struct __pyx_obj_9pywrapfst_SymbolTableIterator *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_19SymbolTableIterator_16value(struct __pyx_obj_9pywrapfst_SymbolTableIterator *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"value\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __Pyx_PyInt_From_int64_t(__pyx_f_9pywrapfst_19SymbolTableIterator_value(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1191, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.SymbolTableIterator.value\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"(tree fragment)\":1\n * def __reduce_cython__(self):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._siter,self._table cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_19SymbolTableIterator_19__reduce_cython__(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_19SymbolTableIterator_19__reduce_cython__(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__reduce_cython__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_19SymbolTableIterator_18__reduce_cython__(((struct __pyx_obj_9pywrapfst_SymbolTableIterator *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_19SymbolTableIterator_18__reduce_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst_SymbolTableIterator *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"__reduce_cython__\", 0);\n\n  /* \"(tree fragment)\":2\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._siter,self._table cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._siter,self._table cannot be converted to a Python object for pickling\")\n */\n  __pyx_t_1 = __Pyx_PyObject_Call(__pyx_builtin_TypeError, __pyx_tuple__20, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(1, 2, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __Pyx_Raise(__pyx_t_1, 0, 0, 0);\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  __PYX_ERR(1, 2, __pyx_L1_error)\n\n  /* \"(tree fragment)\":1\n * def __reduce_cython__(self):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._siter,self._table cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.SymbolTableIterator.__reduce_cython__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"(tree fragment)\":3\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._siter,self._table cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._siter,self._table cannot be converted to a Python object for pickling\")\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_19SymbolTableIterator_21__setstate_cython__(PyObject *__pyx_v_self, PyObject *__pyx_v___pyx_state); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_19SymbolTableIterator_21__setstate_cython__(PyObject *__pyx_v_self, PyObject *__pyx_v___pyx_state) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__setstate_cython__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_19SymbolTableIterator_20__setstate_cython__(((struct __pyx_obj_9pywrapfst_SymbolTableIterator *)__pyx_v_self), ((PyObject *)__pyx_v___pyx_state));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_19SymbolTableIterator_20__setstate_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst_SymbolTableIterator *__pyx_v_self, CYTHON_UNUSED PyObject *__pyx_v___pyx_state) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"__setstate_cython__\", 0);\n\n  /* \"(tree fragment)\":4\n *     raise TypeError(\"self._siter,self._table cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._siter,self._table cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n */\n  __pyx_t_1 = __Pyx_PyObject_Call(__pyx_builtin_TypeError, __pyx_tuple__21, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(1, 4, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __Pyx_Raise(__pyx_t_1, 0, 0, 0);\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  __PYX_ERR(1, 4, __pyx_L1_error)\n\n  /* \"(tree fragment)\":3\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._siter,self._table cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._siter,self._table cannot be converted to a Python object for pickling\")\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.SymbolTableIterator.__setstate_cython__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1229\n *   \"\"\"\n * \n *   def __repr__(self):             # <<<<<<<<<<<<<<\n *     return \"<EncodeMapper at 0x{:x}>\".format(id(self))\n * \n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_12EncodeMapper_1__repr__(PyObject *__pyx_v_self); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_12EncodeMapper_1__repr__(PyObject *__pyx_v_self) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__repr__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_12EncodeMapper___repr__(((struct __pyx_obj_9pywrapfst_EncodeMapper *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_12EncodeMapper___repr__(struct __pyx_obj_9pywrapfst_EncodeMapper *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  __Pyx_RefNannySetupContext(\"__repr__\", 0);\n\n  /* \"pywrapfst.pyx\":1230\n * \n *   def __repr__(self):\n *     return \"<EncodeMapper at 0x{:x}>\".format(id(self))             # <<<<<<<<<<<<<<\n * \n *   def __init__(self,\n */\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_2 = __Pyx_PyObject_GetAttrStr(__pyx_kp_s_EncodeMapper_at_0x_x, __pyx_n_s_format); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1230, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  __pyx_t_3 = __Pyx_PyObject_CallOneArg(__pyx_builtin_id, ((PyObject *)__pyx_v_self)); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 1230, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_3);\n  __pyx_t_4 = NULL;\n  if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_2))) {\n    __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_2);\n    if (likely(__pyx_t_4)) {\n      PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_2);\n      __Pyx_INCREF(__pyx_t_4);\n      __Pyx_INCREF(function);\n      __Pyx_DECREF_SET(__pyx_t_2, function);\n    }\n  }\n  if (!__pyx_t_4) {\n    __pyx_t_1 = __Pyx_PyObject_CallOneArg(__pyx_t_2, __pyx_t_3); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1230, __pyx_L1_error)\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    __Pyx_GOTREF(__pyx_t_1);\n  } else {\n    #if CYTHON_FAST_PYCALL\n    if (PyFunction_Check(__pyx_t_2)) {\n      PyObject *__pyx_temp[2] = {__pyx_t_4, __pyx_t_3};\n      __pyx_t_1 = __Pyx_PyFunction_FastCall(__pyx_t_2, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1230, __pyx_L1_error)\n      __Pyx_XDECREF(__pyx_t_4); __pyx_t_4 = 0;\n      __Pyx_GOTREF(__pyx_t_1);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    } else\n    #endif\n    #if CYTHON_FAST_PYCCALL\n    if (__Pyx_PyFastCFunction_Check(__pyx_t_2)) {\n      PyObject *__pyx_temp[2] = {__pyx_t_4, __pyx_t_3};\n      __pyx_t_1 = __Pyx_PyCFunction_FastCall(__pyx_t_2, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1230, __pyx_L1_error)\n      __Pyx_XDECREF(__pyx_t_4); __pyx_t_4 = 0;\n      __Pyx_GOTREF(__pyx_t_1);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    } else\n    #endif\n    {\n      __pyx_t_5 = PyTuple_New(1+1); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 1230, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_5);\n      __Pyx_GIVEREF(__pyx_t_4); PyTuple_SET_ITEM(__pyx_t_5, 0, __pyx_t_4); __pyx_t_4 = NULL;\n      __Pyx_GIVEREF(__pyx_t_3);\n      PyTuple_SET_ITEM(__pyx_t_5, 0+1, __pyx_t_3);\n      __pyx_t_3 = 0;\n      __pyx_t_1 = __Pyx_PyObject_Call(__pyx_t_2, __pyx_t_5, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1230, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_1);\n      __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n    }\n  }\n  __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":1229\n *   \"\"\"\n * \n *   def __repr__(self):             # <<<<<<<<<<<<<<\n *     return \"<EncodeMapper at 0x{:x}>\".format(id(self))\n * \n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_AddTraceback(\"pywrapfst.EncodeMapper.__repr__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1232\n *     return \"<EncodeMapper at 0x{:x}>\".format(id(self))\n * \n *   def __init__(self,             # <<<<<<<<<<<<<<\n *                arc_type=b\"standard\",\n *                bool encode_labels=False,\n */\n\n/* Python wrapper */\nstatic int __pyx_pw_9pywrapfst_12EncodeMapper_3__init__(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic int __pyx_pw_9pywrapfst_12EncodeMapper_3__init__(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  PyObject *__pyx_v_arc_type = 0;\n  bool __pyx_v_encode_labels;\n  bool __pyx_v_encode_weights;\n  int __pyx_r;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__init__ (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_arc_type,&__pyx_n_s_encode_labels,&__pyx_n_s_encode_weights,0};\n    PyObject* values[3] = {0,0,0};\n    values[0] = ((PyObject *)__pyx_n_b_standard);\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);\n        CYTHON_FALLTHROUGH;\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_arc_type);\n          if (value) { values[0] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  1:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_encode_labels);\n          if (value) { values[1] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  2:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_encode_weights);\n          if (value) { values[2] = value; kw_args--; }\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"__init__\") < 0)) __PYX_ERR(0, 1232, __pyx_L3_error)\n      }\n    } else {\n      switch (PyTuple_GET_SIZE(__pyx_args)) {\n        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);\n        CYTHON_FALLTHROUGH;\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n    }\n    __pyx_v_arc_type = values[0];\n    if (values[1]) {\n      __pyx_v_encode_labels = __Pyx_PyObject_IsTrue(values[1]); if (unlikely((__pyx_v_encode_labels == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 1234, __pyx_L3_error)\n    } else {\n\n      /* \"pywrapfst.pyx\":1234\n *   def __init__(self,\n *                arc_type=b\"standard\",\n *                bool encode_labels=False,             # <<<<<<<<<<<<<<\n *                bool encode_weights=False):\n *     cdef uint32 flags = fst.GetEncodeFlags(encode_labels, encode_weights)\n */\n      __pyx_v_encode_labels = ((bool)0);\n    }\n    if (values[2]) {\n      __pyx_v_encode_weights = __Pyx_PyObject_IsTrue(values[2]); if (unlikely((__pyx_v_encode_weights == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 1235, __pyx_L3_error)\n    } else {\n\n      /* \"pywrapfst.pyx\":1235\n *                arc_type=b\"standard\",\n *                bool encode_labels=False,\n *                bool encode_weights=False):             # <<<<<<<<<<<<<<\n *     cdef uint32 flags = fst.GetEncodeFlags(encode_labels, encode_weights)\n *     self._encoder.reset(new fst.EncodeMapperClass(tostring(arc_type), flags,\n */\n      __pyx_v_encode_weights = ((bool)0);\n    }\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"__init__\", 0, 0, 3, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 1232, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst.EncodeMapper.__init__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return -1;\n  __pyx_L4_argument_unpacking_done:;\n  __pyx_r = __pyx_pf_9pywrapfst_12EncodeMapper_2__init__(((struct __pyx_obj_9pywrapfst_EncodeMapper *)__pyx_v_self), __pyx_v_arc_type, __pyx_v_encode_labels, __pyx_v_encode_weights);\n\n  /* \"pywrapfst.pyx\":1232\n *     return \"<EncodeMapper at 0x{:x}>\".format(id(self))\n * \n *   def __init__(self,             # <<<<<<<<<<<<<<\n *                arc_type=b\"standard\",\n *                bool encode_labels=False,\n */\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic int __pyx_pf_9pywrapfst_12EncodeMapper_2__init__(struct __pyx_obj_9pywrapfst_EncodeMapper *__pyx_v_self, PyObject *__pyx_v_arc_type, bool __pyx_v_encode_labels, bool __pyx_v_encode_weights) {\n  __pyx_t_10basictypes_uint32 __pyx_v_flags;\n  int __pyx_r;\n  __Pyx_RefNannyDeclarations\n  std::string __pyx_t_1;\n  int __pyx_t_2;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  PyObject *__pyx_t_6 = NULL;\n  PyObject *__pyx_t_7 = NULL;\n  PyObject *__pyx_t_8 = NULL;\n  __Pyx_RefNannySetupContext(\"__init__\", 0);\n\n  /* \"pywrapfst.pyx\":1236\n *                bool encode_labels=False,\n *                bool encode_weights=False):\n *     cdef uint32 flags = fst.GetEncodeFlags(encode_labels, encode_weights)             # <<<<<<<<<<<<<<\n *     self._encoder.reset(new fst.EncodeMapperClass(tostring(arc_type), flags,\n *                                                   fst.ENCODE))\n */\n  __pyx_v_flags = fst::script::GetEncodeFlags(__pyx_v_encode_labels, __pyx_v_encode_weights);\n\n  /* \"pywrapfst.pyx\":1237\n *                bool encode_weights=False):\n *     cdef uint32 flags = fst.GetEncodeFlags(encode_labels, encode_weights)\n *     self._encoder.reset(new fst.EncodeMapperClass(tostring(arc_type), flags,             # <<<<<<<<<<<<<<\n *                                                   fst.ENCODE))\n *     if not self._encoder:\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_encoder\");\n    __PYX_ERR(0, 1237, __pyx_L1_error)\n  }\n  __pyx_t_1 = __pyx_f_9pywrapfst_tostring(__pyx_v_arc_type, NULL); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 1237, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":1238\n *     cdef uint32 flags = fst.GetEncodeFlags(encode_labels, encode_weights)\n *     self._encoder.reset(new fst.EncodeMapperClass(tostring(arc_type), flags,\n *                                                   fst.ENCODE))             # <<<<<<<<<<<<<<\n *     if not self._encoder:\n *       raise FstOpError(\"Unknown arc type: {!r}\".format(arc_type))\n */\n  __pyx_v_self->_encoder.reset(new fst::script::EncodeMapperClass(__pyx_t_1, __pyx_v_flags, fst::ENCODE));\n\n  /* \"pywrapfst.pyx\":1239\n *     self._encoder.reset(new fst.EncodeMapperClass(tostring(arc_type), flags,\n *                                                   fst.ENCODE))\n *     if not self._encoder:             # <<<<<<<<<<<<<<\n *       raise FstOpError(\"Unknown arc type: {!r}\".format(arc_type))\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_encoder\");\n    __PYX_ERR(0, 1239, __pyx_L1_error)\n  }\n  __pyx_t_2 = ((!__pyx_v_self->_encoder) != 0);\n  if (unlikely(__pyx_t_2)) {\n\n    /* \"pywrapfst.pyx\":1240\n *                                                   fst.ENCODE))\n *     if not self._encoder:\n *       raise FstOpError(\"Unknown arc type: {!r}\".format(arc_type))             # <<<<<<<<<<<<<<\n * \n *   cpdef string arc_type(self):\n */\n    __pyx_t_4 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstOpError); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 1240, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_4);\n    __pyx_t_6 = __Pyx_PyObject_GetAttrStr(__pyx_kp_s_Unknown_arc_type_r, __pyx_n_s_format); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 1240, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_6);\n    __pyx_t_7 = NULL;\n    if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_6))) {\n      __pyx_t_7 = PyMethod_GET_SELF(__pyx_t_6);\n      if (likely(__pyx_t_7)) {\n        PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_6);\n        __Pyx_INCREF(__pyx_t_7);\n        __Pyx_INCREF(function);\n        __Pyx_DECREF_SET(__pyx_t_6, function);\n      }\n    }\n    if (!__pyx_t_7) {\n      __pyx_t_5 = __Pyx_PyObject_CallOneArg(__pyx_t_6, __pyx_v_arc_type); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 1240, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_5);\n    } else {\n      #if CYTHON_FAST_PYCALL\n      if (PyFunction_Check(__pyx_t_6)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_7, __pyx_v_arc_type};\n        __pyx_t_5 = __Pyx_PyFunction_FastCall(__pyx_t_6, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 1240, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_7); __pyx_t_7 = 0;\n        __Pyx_GOTREF(__pyx_t_5);\n      } else\n      #endif\n      #if CYTHON_FAST_PYCCALL\n      if (__Pyx_PyFastCFunction_Check(__pyx_t_6)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_7, __pyx_v_arc_type};\n        __pyx_t_5 = __Pyx_PyCFunction_FastCall(__pyx_t_6, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 1240, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_7); __pyx_t_7 = 0;\n        __Pyx_GOTREF(__pyx_t_5);\n      } else\n      #endif\n      {\n        __pyx_t_8 = PyTuple_New(1+1); if (unlikely(!__pyx_t_8)) __PYX_ERR(0, 1240, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_8);\n        __Pyx_GIVEREF(__pyx_t_7); PyTuple_SET_ITEM(__pyx_t_8, 0, __pyx_t_7); __pyx_t_7 = NULL;\n        __Pyx_INCREF(__pyx_v_arc_type);\n        __Pyx_GIVEREF(__pyx_v_arc_type);\n        PyTuple_SET_ITEM(__pyx_t_8, 0+1, __pyx_v_arc_type);\n        __pyx_t_5 = __Pyx_PyObject_Call(__pyx_t_6, __pyx_t_8, NULL); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 1240, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_5);\n        __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0;\n      }\n    }\n    __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n    __pyx_t_6 = NULL;\n    if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_4))) {\n      __pyx_t_6 = PyMethod_GET_SELF(__pyx_t_4);\n      if (likely(__pyx_t_6)) {\n        PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_4);\n        __Pyx_INCREF(__pyx_t_6);\n        __Pyx_INCREF(function);\n        __Pyx_DECREF_SET(__pyx_t_4, function);\n      }\n    }\n    if (!__pyx_t_6) {\n      __pyx_t_3 = __Pyx_PyObject_CallOneArg(__pyx_t_4, __pyx_t_5); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 1240, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n      __Pyx_GOTREF(__pyx_t_3);\n    } else {\n      #if CYTHON_FAST_PYCALL\n      if (PyFunction_Check(__pyx_t_4)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_6, __pyx_t_5};\n        __pyx_t_3 = __Pyx_PyFunction_FastCall(__pyx_t_4, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 1240, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_6); __pyx_t_6 = 0;\n        __Pyx_GOTREF(__pyx_t_3);\n        __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n      } else\n      #endif\n      #if CYTHON_FAST_PYCCALL\n      if (__Pyx_PyFastCFunction_Check(__pyx_t_4)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_6, __pyx_t_5};\n        __pyx_t_3 = __Pyx_PyCFunction_FastCall(__pyx_t_4, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 1240, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_6); __pyx_t_6 = 0;\n        __Pyx_GOTREF(__pyx_t_3);\n        __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n      } else\n      #endif\n      {\n        __pyx_t_8 = PyTuple_New(1+1); if (unlikely(!__pyx_t_8)) __PYX_ERR(0, 1240, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_8);\n        __Pyx_GIVEREF(__pyx_t_6); PyTuple_SET_ITEM(__pyx_t_8, 0, __pyx_t_6); __pyx_t_6 = NULL;\n        __Pyx_GIVEREF(__pyx_t_5);\n        PyTuple_SET_ITEM(__pyx_t_8, 0+1, __pyx_t_5);\n        __pyx_t_5 = 0;\n        __pyx_t_3 = __Pyx_PyObject_Call(__pyx_t_4, __pyx_t_8, NULL); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 1240, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_3);\n        __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0;\n      }\n    }\n    __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n    __Pyx_Raise(__pyx_t_3, 0, 0, 0);\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    __PYX_ERR(0, 1240, __pyx_L1_error)\n\n    /* \"pywrapfst.pyx\":1239\n *     self._encoder.reset(new fst.EncodeMapperClass(tostring(arc_type), flags,\n *                                                   fst.ENCODE))\n *     if not self._encoder:             # <<<<<<<<<<<<<<\n *       raise FstOpError(\"Unknown arc type: {!r}\".format(arc_type))\n * \n */\n  }\n\n  /* \"pywrapfst.pyx\":1232\n *     return \"<EncodeMapper at 0x{:x}>\".format(id(self))\n * \n *   def __init__(self,             # <<<<<<<<<<<<<<\n *                arc_type=b\"standard\",\n *                bool encode_labels=False,\n */\n\n  /* function exit code */\n  __pyx_r = 0;\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_XDECREF(__pyx_t_6);\n  __Pyx_XDECREF(__pyx_t_7);\n  __Pyx_XDECREF(__pyx_t_8);\n  __Pyx_AddTraceback(\"pywrapfst.EncodeMapper.__init__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = -1;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1242\n *       raise FstOpError(\"Unknown arc type: {!r}\".format(arc_type))\n * \n *   cpdef string arc_type(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     arc_type(self)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_12EncodeMapper_5arc_type(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic std::string __pyx_f_9pywrapfst_12EncodeMapper_arc_type(struct __pyx_obj_9pywrapfst_EncodeMapper *__pyx_v_self, int __pyx_skip_dispatch) {\n  std::string __pyx_r;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  std::string __pyx_t_5;\n  __Pyx_RefNannySetupContext(\"arc_type\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_arc_type); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1242, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_12EncodeMapper_5arc_type)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1242, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1242, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __pyx_t_5 = __pyx_convert_string_from_py_std__in_string(__pyx_t_2); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 1242, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __pyx_r = __pyx_t_5;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":1248\n *     Returns a string indicating the arc type.\n *     \"\"\"\n *     return self._encoder.get().ArcType()             # <<<<<<<<<<<<<<\n * \n *   # Python's equivalent to operator().\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_encoder\");\n    __PYX_ERR(0, 1248, __pyx_L1_error)\n  }\n  __pyx_r = __pyx_v_self->_encoder.get()->ArcType();\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":1242\n *       raise FstOpError(\"Unknown arc type: {!r}\".format(arc_type))\n * \n *   cpdef string arc_type(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     arc_type(self)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_WriteUnraisable(\"pywrapfst.EncodeMapper.arc_type\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __Pyx_pretend_to_initialize(&__pyx_r);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_12EncodeMapper_5arc_type(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_12EncodeMapper_4arc_type[] = \"\\n    arc_type(self)\\n\\n    Returns a string indicating the arc type.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_12EncodeMapper_5arc_type(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"arc_type (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_12EncodeMapper_4arc_type(((struct __pyx_obj_9pywrapfst_EncodeMapper *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_12EncodeMapper_4arc_type(struct __pyx_obj_9pywrapfst_EncodeMapper *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"arc_type\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __pyx_convert_PyBytes_string_to_py_std__in_string(__pyx_f_9pywrapfst_12EncodeMapper_arc_type(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1242, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.EncodeMapper.arc_type\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1252\n *   # Python's equivalent to operator().\n * \n *   def __call__(self, Arc arc):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     self(state, ilabel, olabel, weight, nextstate)\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_12EncodeMapper_7__call__(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic char __pyx_doc_9pywrapfst_12EncodeMapper_6__call__[] = \"\\n    self(state, ilabel, olabel, weight, nextstate)\\n\\n    Uses the encoder to encode an arc.\\n\\n    Args:\\n      ilabel: The integer index of the input label.\\n      olabel: The integer index of the output label.\\n      weight: A Weight or weight string indicating the desired final weight; if\\n        null, it is set to semiring One.\\n      nextstate: The integer index of the destination state.\\n\\n    Raises:\\n      FstOpError: Incompatible or invalid weight.\\n    \";\n#if CYTHON_COMPILING_IN_CPYTHON\nstruct wrapperbase __pyx_wrapperbase_9pywrapfst_12EncodeMapper_6__call__;\n#endif\nstatic PyObject *__pyx_pw_9pywrapfst_12EncodeMapper_7__call__(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  struct __pyx_obj_9pywrapfst_Arc *__pyx_v_arc = 0;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__call__ (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_arc,0};\n    PyObject* values[1] = {0};\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (likely((values[0] = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_arc)) != 0)) kw_args--;\n        else goto __pyx_L5_argtuple_error;\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"__call__\") < 0)) __PYX_ERR(0, 1252, __pyx_L3_error)\n      }\n    } else if (PyTuple_GET_SIZE(__pyx_args) != 1) {\n      goto __pyx_L5_argtuple_error;\n    } else {\n      values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n    }\n    __pyx_v_arc = ((struct __pyx_obj_9pywrapfst_Arc *)values[0]);\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"__call__\", 1, 1, 1, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 1252, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst.EncodeMapper.__call__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_arc), __pyx_ptype_9pywrapfst_Arc, 1, \"arc\", 0))) __PYX_ERR(0, 1252, __pyx_L1_error)\n  __pyx_r = __pyx_pf_9pywrapfst_12EncodeMapper_6__call__(((struct __pyx_obj_9pywrapfst_EncodeMapper *)__pyx_v_self), __pyx_v_arc);\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_12EncodeMapper_6__call__(struct __pyx_obj_9pywrapfst_EncodeMapper *__pyx_v_self, struct __pyx_obj_9pywrapfst_Arc *__pyx_v_arc) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"__call__\", 0);\n\n  /* \"pywrapfst.pyx\":1268\n *       FstOpError: Incompatible or invalid weight.\n *     \"\"\"\n *     return _init_Arc(self._encoder.get().__call__(deref(arc._arc)))             # <<<<<<<<<<<<<<\n * \n *   cpdef uint32 flags(self):\n */\n  __Pyx_XDECREF(__pyx_r);\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_encoder\");\n    __PYX_ERR(0, 1268, __pyx_L1_error)\n  }\n  if (unlikely(((PyObject *)__pyx_v_arc) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_arc\");\n    __PYX_ERR(0, 1268, __pyx_L1_error)\n  }\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst__init_Arc(__pyx_v_self->_encoder.get()->operator()((*__pyx_v_arc->_arc)))); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1268, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":1252\n *   # Python's equivalent to operator().\n * \n *   def __call__(self, Arc arc):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     self(state, ilabel, olabel, weight, nextstate)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.EncodeMapper.__call__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1270\n *     return _init_Arc(self._encoder.get().__call__(deref(arc._arc)))\n * \n *   cpdef uint32 flags(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     flags(self)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_12EncodeMapper_9flags(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic __pyx_t_10basictypes_uint32 __pyx_f_9pywrapfst_12EncodeMapper_flags(struct __pyx_obj_9pywrapfst_EncodeMapper *__pyx_v_self, int __pyx_skip_dispatch) {\n  __pyx_t_10basictypes_uint32 __pyx_r;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  __pyx_t_10basictypes_uint32 __pyx_t_5;\n  __Pyx_RefNannySetupContext(\"flags\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_flags); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1270, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_12EncodeMapper_9flags)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1270, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1270, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __pyx_t_5 = __Pyx_PyInt_As_uint32_t(__pyx_t_2); if (unlikely((__pyx_t_5 == ((uint32_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 1270, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __pyx_r = __pyx_t_5;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":1276\n *     Returns the encoder's flags.\n *     \"\"\"\n *     return self._encoder.get().Flags()             # <<<<<<<<<<<<<<\n * \n *   cpdef _EncodeMapperSymbolTable input_symbols(self):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_encoder\");\n    __PYX_ERR(0, 1276, __pyx_L1_error)\n  }\n  __pyx_r = __pyx_v_self->_encoder.get()->Flags();\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":1270\n *     return _init_Arc(self._encoder.get().__call__(deref(arc._arc)))\n * \n *   cpdef uint32 flags(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     flags(self)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_WriteUnraisable(\"pywrapfst.EncodeMapper.flags\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_12EncodeMapper_9flags(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_12EncodeMapper_8flags[] = \"\\n    flags(self)\\n\\n    Returns the encoder's flags.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_12EncodeMapper_9flags(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"flags (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_12EncodeMapper_8flags(((struct __pyx_obj_9pywrapfst_EncodeMapper *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_12EncodeMapper_8flags(struct __pyx_obj_9pywrapfst_EncodeMapper *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"flags\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __Pyx_PyInt_From_uint32_t(__pyx_f_9pywrapfst_12EncodeMapper_flags(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1270, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.EncodeMapper.flags\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1278\n *     return self._encoder.get().Flags()\n * \n *   cpdef _EncodeMapperSymbolTable input_symbols(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     input_symbols(self)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_12EncodeMapper_11input_symbols(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic struct __pyx_obj_9pywrapfst__EncodeMapperSymbolTable *__pyx_f_9pywrapfst_12EncodeMapper_input_symbols(struct __pyx_obj_9pywrapfst_EncodeMapper *__pyx_v_self, int __pyx_skip_dispatch) {\n  fst::SymbolTable *__pyx_v_syms;\n  struct __pyx_obj_9pywrapfst__EncodeMapperSymbolTable *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  int __pyx_t_5;\n  __Pyx_RefNannySetupContext(\"input_symbols\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_input_symbols); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1278, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_12EncodeMapper_11input_symbols)) {\n      __Pyx_XDECREF(((PyObject *)__pyx_r));\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1278, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1278, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      if (!(likely(((__pyx_t_2) == Py_None) || likely(__Pyx_TypeTest(__pyx_t_2, __pyx_ptype_9pywrapfst__EncodeMapperSymbolTable))))) __PYX_ERR(0, 1278, __pyx_L1_error)\n      __pyx_r = ((struct __pyx_obj_9pywrapfst__EncodeMapperSymbolTable *)__pyx_t_2);\n      __pyx_t_2 = 0;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":1285\n *     \"\"\"\n *     cdef fst.SymbolTable *syms = const_cast[SymbolTable_ptr](\n *         self._encoder.get().InputSymbols())             # <<<<<<<<<<<<<<\n *     if syms == NULL:\n *       return\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_encoder\");\n    __PYX_ERR(0, 1285, __pyx_L1_error)\n  }\n\n  /* \"pywrapfst.pyx\":1284\n *     Returns the encoder's input symbol table, or None if none is present.\n *     \"\"\"\n *     cdef fst.SymbolTable *syms = const_cast[SymbolTable_ptr](             # <<<<<<<<<<<<<<\n *         self._encoder.get().InputSymbols())\n *     if syms == NULL:\n */\n  __pyx_v_syms = const_cast<__pyx_t_9pywrapfst_SymbolTable_ptr>(__pyx_v_self->_encoder.get()->InputSymbols());\n\n  /* \"pywrapfst.pyx\":1286\n *     cdef fst.SymbolTable *syms = const_cast[SymbolTable_ptr](\n *         self._encoder.get().InputSymbols())\n *     if syms == NULL:             # <<<<<<<<<<<<<<\n *       return\n *     return _init_EncodeMapperSymbolTable(syms, self._encoder)\n */\n  __pyx_t_5 = ((__pyx_v_syms == NULL) != 0);\n  if (__pyx_t_5) {\n\n    /* \"pywrapfst.pyx\":1287\n *         self._encoder.get().InputSymbols())\n *     if syms == NULL:\n *       return             # <<<<<<<<<<<<<<\n *     return _init_EncodeMapperSymbolTable(syms, self._encoder)\n * \n */\n    __Pyx_XDECREF(((PyObject *)__pyx_r));\n    __pyx_r = ((struct __pyx_obj_9pywrapfst__EncodeMapperSymbolTable *)Py_None); __Pyx_INCREF(Py_None);\n    goto __pyx_L0;\n\n    /* \"pywrapfst.pyx\":1286\n *     cdef fst.SymbolTable *syms = const_cast[SymbolTable_ptr](\n *         self._encoder.get().InputSymbols())\n *     if syms == NULL:             # <<<<<<<<<<<<<<\n *       return\n *     return _init_EncodeMapperSymbolTable(syms, self._encoder)\n */\n  }\n\n  /* \"pywrapfst.pyx\":1288\n *     if syms == NULL:\n *       return\n *     return _init_EncodeMapperSymbolTable(syms, self._encoder)             # <<<<<<<<<<<<<<\n * \n *   cpdef _EncodeMapperSymbolTable output_symbols(self):\n */\n  __Pyx_XDECREF(((PyObject *)__pyx_r));\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_encoder\");\n    __PYX_ERR(0, 1288, __pyx_L1_error)\n  }\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst__init_EncodeMapperSymbolTable(__pyx_v_syms, __pyx_v_self->_encoder)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1288, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = ((struct __pyx_obj_9pywrapfst__EncodeMapperSymbolTable *)__pyx_t_1);\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":1278\n *     return self._encoder.get().Flags()\n * \n *   cpdef _EncodeMapperSymbolTable input_symbols(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     input_symbols(self)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_AddTraceback(\"pywrapfst.EncodeMapper.input_symbols\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XGIVEREF((PyObject *)__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_12EncodeMapper_11input_symbols(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_12EncodeMapper_10input_symbols[] = \"\\n    input_symbols(self)\\n\\n    Returns the encoder's input symbol table, or None if none is present.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_12EncodeMapper_11input_symbols(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"input_symbols (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_12EncodeMapper_10input_symbols(((struct __pyx_obj_9pywrapfst_EncodeMapper *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_12EncodeMapper_10input_symbols(struct __pyx_obj_9pywrapfst_EncodeMapper *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"input_symbols\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst_12EncodeMapper_input_symbols(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1278, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.EncodeMapper.input_symbols\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1290\n *     return _init_EncodeMapperSymbolTable(syms, self._encoder)\n * \n *   cpdef _EncodeMapperSymbolTable output_symbols(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     output_symbols(self)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_12EncodeMapper_13output_symbols(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic struct __pyx_obj_9pywrapfst__EncodeMapperSymbolTable *__pyx_f_9pywrapfst_12EncodeMapper_output_symbols(struct __pyx_obj_9pywrapfst_EncodeMapper *__pyx_v_self, int __pyx_skip_dispatch) {\n  fst::SymbolTable *__pyx_v_syms;\n  struct __pyx_obj_9pywrapfst__EncodeMapperSymbolTable *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  int __pyx_t_5;\n  __Pyx_RefNannySetupContext(\"output_symbols\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_output_symbols); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1290, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_12EncodeMapper_13output_symbols)) {\n      __Pyx_XDECREF(((PyObject *)__pyx_r));\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1290, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1290, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      if (!(likely(((__pyx_t_2) == Py_None) || likely(__Pyx_TypeTest(__pyx_t_2, __pyx_ptype_9pywrapfst__EncodeMapperSymbolTable))))) __PYX_ERR(0, 1290, __pyx_L1_error)\n      __pyx_r = ((struct __pyx_obj_9pywrapfst__EncodeMapperSymbolTable *)__pyx_t_2);\n      __pyx_t_2 = 0;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":1297\n *     \"\"\"\n *     cdef fst.SymbolTable *syms = const_cast[SymbolTable_ptr](\n *         self._encoder.get().OutputSymbols())             # <<<<<<<<<<<<<<\n *     if syms == NULL:\n *       return\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_encoder\");\n    __PYX_ERR(0, 1297, __pyx_L1_error)\n  }\n\n  /* \"pywrapfst.pyx\":1296\n *     Returns the encoder's output symbol table, or None if none is present.\n *     \"\"\"\n *     cdef fst.SymbolTable *syms = const_cast[SymbolTable_ptr](             # <<<<<<<<<<<<<<\n *         self._encoder.get().OutputSymbols())\n *     if syms == NULL:\n */\n  __pyx_v_syms = const_cast<__pyx_t_9pywrapfst_SymbolTable_ptr>(__pyx_v_self->_encoder.get()->OutputSymbols());\n\n  /* \"pywrapfst.pyx\":1298\n *     cdef fst.SymbolTable *syms = const_cast[SymbolTable_ptr](\n *         self._encoder.get().OutputSymbols())\n *     if syms == NULL:             # <<<<<<<<<<<<<<\n *       return\n *     return _init_EncodeMapperSymbolTable(syms, self._encoder)\n */\n  __pyx_t_5 = ((__pyx_v_syms == NULL) != 0);\n  if (__pyx_t_5) {\n\n    /* \"pywrapfst.pyx\":1299\n *         self._encoder.get().OutputSymbols())\n *     if syms == NULL:\n *       return             # <<<<<<<<<<<<<<\n *     return _init_EncodeMapperSymbolTable(syms, self._encoder)\n * \n */\n    __Pyx_XDECREF(((PyObject *)__pyx_r));\n    __pyx_r = ((struct __pyx_obj_9pywrapfst__EncodeMapperSymbolTable *)Py_None); __Pyx_INCREF(Py_None);\n    goto __pyx_L0;\n\n    /* \"pywrapfst.pyx\":1298\n *     cdef fst.SymbolTable *syms = const_cast[SymbolTable_ptr](\n *         self._encoder.get().OutputSymbols())\n *     if syms == NULL:             # <<<<<<<<<<<<<<\n *       return\n *     return _init_EncodeMapperSymbolTable(syms, self._encoder)\n */\n  }\n\n  /* \"pywrapfst.pyx\":1300\n *     if syms == NULL:\n *       return\n *     return _init_EncodeMapperSymbolTable(syms, self._encoder)             # <<<<<<<<<<<<<<\n * \n *   cpdef uint64 properties(self, uint64 mask):\n */\n  __Pyx_XDECREF(((PyObject *)__pyx_r));\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_encoder\");\n    __PYX_ERR(0, 1300, __pyx_L1_error)\n  }\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst__init_EncodeMapperSymbolTable(__pyx_v_syms, __pyx_v_self->_encoder)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1300, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = ((struct __pyx_obj_9pywrapfst__EncodeMapperSymbolTable *)__pyx_t_1);\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":1290\n *     return _init_EncodeMapperSymbolTable(syms, self._encoder)\n * \n *   cpdef _EncodeMapperSymbolTable output_symbols(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     output_symbols(self)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_AddTraceback(\"pywrapfst.EncodeMapper.output_symbols\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XGIVEREF((PyObject *)__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_12EncodeMapper_13output_symbols(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_12EncodeMapper_12output_symbols[] = \"\\n    output_symbols(self)\\n\\n    Returns the encoder's output symbol table, or None if none is present.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_12EncodeMapper_13output_symbols(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"output_symbols (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_12EncodeMapper_12output_symbols(((struct __pyx_obj_9pywrapfst_EncodeMapper *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_12EncodeMapper_12output_symbols(struct __pyx_obj_9pywrapfst_EncodeMapper *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"output_symbols\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst_12EncodeMapper_output_symbols(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1290, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.EncodeMapper.output_symbols\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1302\n *     return _init_EncodeMapperSymbolTable(syms, self._encoder)\n * \n *   cpdef uint64 properties(self, uint64 mask):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     properties(self, mask)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_12EncodeMapper_15properties(PyObject *__pyx_v_self, PyObject *__pyx_arg_mask); /*proto*/\nstatic __pyx_t_10basictypes_uint64 __pyx_f_9pywrapfst_12EncodeMapper_properties(struct __pyx_obj_9pywrapfst_EncodeMapper *__pyx_v_self, __pyx_t_10basictypes_uint64 __pyx_v_mask, int __pyx_skip_dispatch) {\n  __pyx_t_10basictypes_uint64 __pyx_r;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  PyObject *__pyx_t_6 = NULL;\n  __pyx_t_10basictypes_uint64 __pyx_t_7;\n  __Pyx_RefNannySetupContext(\"properties\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_properties); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1302, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_12EncodeMapper_15properties)) {\n      __pyx_t_3 = __Pyx_PyInt_From_uint64_t(__pyx_v_mask); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 1302, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_3);\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_4 = __pyx_t_1; __pyx_t_5 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_4))) {\n        __pyx_t_5 = PyMethod_GET_SELF(__pyx_t_4);\n        if (likely(__pyx_t_5)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_4);\n          __Pyx_INCREF(__pyx_t_5);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_4, function);\n        }\n      }\n      if (!__pyx_t_5) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_4, __pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1302, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n        __Pyx_GOTREF(__pyx_t_2);\n      } else {\n        #if CYTHON_FAST_PYCALL\n        if (PyFunction_Check(__pyx_t_4)) {\n          PyObject *__pyx_temp[2] = {__pyx_t_5, __pyx_t_3};\n          __pyx_t_2 = __Pyx_PyFunction_FastCall(__pyx_t_4, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1302, __pyx_L1_error)\n          __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;\n          __Pyx_GOTREF(__pyx_t_2);\n          __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n        } else\n        #endif\n        #if CYTHON_FAST_PYCCALL\n        if (__Pyx_PyFastCFunction_Check(__pyx_t_4)) {\n          PyObject *__pyx_temp[2] = {__pyx_t_5, __pyx_t_3};\n          __pyx_t_2 = __Pyx_PyCFunction_FastCall(__pyx_t_4, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1302, __pyx_L1_error)\n          __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;\n          __Pyx_GOTREF(__pyx_t_2);\n          __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n        } else\n        #endif\n        {\n          __pyx_t_6 = PyTuple_New(1+1); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 1302, __pyx_L1_error)\n          __Pyx_GOTREF(__pyx_t_6);\n          __Pyx_GIVEREF(__pyx_t_5); PyTuple_SET_ITEM(__pyx_t_6, 0, __pyx_t_5); __pyx_t_5 = NULL;\n          __Pyx_GIVEREF(__pyx_t_3);\n          PyTuple_SET_ITEM(__pyx_t_6, 0+1, __pyx_t_3);\n          __pyx_t_3 = 0;\n          __pyx_t_2 = __Pyx_PyObject_Call(__pyx_t_4, __pyx_t_6, NULL); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1302, __pyx_L1_error)\n          __Pyx_GOTREF(__pyx_t_2);\n          __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n        }\n      }\n      __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      __pyx_t_7 = __Pyx_PyInt_As_uint64_t(__pyx_t_2); if (unlikely((__pyx_t_7 == ((uint64_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 1302, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __pyx_r = __pyx_t_7;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":1316\n *       A 64-bit bitmask representing the requested properties.\n *     \"\"\"\n *     return self._encoder.get().Properties(mask)             # <<<<<<<<<<<<<<\n * \n *   cpdef void set_input_symbols(self, _SymbolTable syms) except *:\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_encoder\");\n    __PYX_ERR(0, 1316, __pyx_L1_error)\n  }\n  __pyx_r = __pyx_v_self->_encoder.get()->Properties(__pyx_v_mask);\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":1302\n *     return _init_EncodeMapperSymbolTable(syms, self._encoder)\n * \n *   cpdef uint64 properties(self, uint64 mask):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     properties(self, mask)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_XDECREF(__pyx_t_6);\n  __Pyx_WriteUnraisable(\"pywrapfst.EncodeMapper.properties\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_12EncodeMapper_15properties(PyObject *__pyx_v_self, PyObject *__pyx_arg_mask); /*proto*/\nstatic char __pyx_doc_9pywrapfst_12EncodeMapper_14properties[] = \"\\n    properties(self, mask)\\n\\n    Provides property bits.\\n\\n    This method provides user access to the properties of the encoder.\\n\\n    Args:\\n      mask: The property mask to be compared to the encoder's properties.\\n\\n    Returns:\\n      A 64-bit bitmask representing the requested properties.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_12EncodeMapper_15properties(PyObject *__pyx_v_self, PyObject *__pyx_arg_mask) {\n  __pyx_t_10basictypes_uint64 __pyx_v_mask;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"properties (wrapper)\", 0);\n  assert(__pyx_arg_mask); {\n    __pyx_v_mask = __Pyx_PyInt_As_uint64_t(__pyx_arg_mask); if (unlikely((__pyx_v_mask == ((uint64_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 1302, __pyx_L3_error)\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst.EncodeMapper.properties\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  __pyx_r = __pyx_pf_9pywrapfst_12EncodeMapper_14properties(((struct __pyx_obj_9pywrapfst_EncodeMapper *)__pyx_v_self), ((__pyx_t_10basictypes_uint64)__pyx_v_mask));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_12EncodeMapper_14properties(struct __pyx_obj_9pywrapfst_EncodeMapper *__pyx_v_self, __pyx_t_10basictypes_uint64 __pyx_v_mask) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"properties\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(__pyx_f_9pywrapfst_12EncodeMapper_properties(__pyx_v_self, __pyx_v_mask, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1302, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.EncodeMapper.properties\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1318\n *     return self._encoder.get().Properties(mask)\n * \n *   cpdef void set_input_symbols(self, _SymbolTable syms) except *:             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     set_input_symbols(self, syms)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_12EncodeMapper_17set_input_symbols(PyObject *__pyx_v_self, PyObject *__pyx_v_syms); /*proto*/\nstatic void __pyx_f_9pywrapfst_12EncodeMapper_set_input_symbols(struct __pyx_obj_9pywrapfst_EncodeMapper *__pyx_v_self, struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_syms, int __pyx_skip_dispatch) {\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  __Pyx_RefNannySetupContext(\"set_input_symbols\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_set_input_symbols); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1318, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_12EncodeMapper_17set_input_symbols)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (!__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, ((PyObject *)__pyx_v_syms)); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1318, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_2);\n      } else {\n        #if CYTHON_FAST_PYCALL\n        if (PyFunction_Check(__pyx_t_3)) {\n          PyObject *__pyx_temp[2] = {__pyx_t_4, ((PyObject *)__pyx_v_syms)};\n          __pyx_t_2 = __Pyx_PyFunction_FastCall(__pyx_t_3, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1318, __pyx_L1_error)\n          __Pyx_XDECREF(__pyx_t_4); __pyx_t_4 = 0;\n          __Pyx_GOTREF(__pyx_t_2);\n        } else\n        #endif\n        #if CYTHON_FAST_PYCCALL\n        if (__Pyx_PyFastCFunction_Check(__pyx_t_3)) {\n          PyObject *__pyx_temp[2] = {__pyx_t_4, ((PyObject *)__pyx_v_syms)};\n          __pyx_t_2 = __Pyx_PyCFunction_FastCall(__pyx_t_3, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1318, __pyx_L1_error)\n          __Pyx_XDECREF(__pyx_t_4); __pyx_t_4 = 0;\n          __Pyx_GOTREF(__pyx_t_2);\n        } else\n        #endif\n        {\n          __pyx_t_5 = PyTuple_New(1+1); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 1318, __pyx_L1_error)\n          __Pyx_GOTREF(__pyx_t_5);\n          __Pyx_GIVEREF(__pyx_t_4); PyTuple_SET_ITEM(__pyx_t_5, 0, __pyx_t_4); __pyx_t_4 = NULL;\n          __Pyx_INCREF(((PyObject *)__pyx_v_syms));\n          __Pyx_GIVEREF(((PyObject *)__pyx_v_syms));\n          PyTuple_SET_ITEM(__pyx_t_5, 0+1, ((PyObject *)__pyx_v_syms));\n          __pyx_t_2 = __Pyx_PyObject_Call(__pyx_t_3, __pyx_t_5, NULL); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1318, __pyx_L1_error)\n          __Pyx_GOTREF(__pyx_t_2);\n          __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n        }\n      }\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":1329\n *     See also: `set_output_symbols`.\n *     \"\"\"\n *     self._encoder.get().SetInputSymbols(syms._table)             # <<<<<<<<<<<<<<\n * \n *   cpdef void set_output_symbols(self, _SymbolTable syms) except *:\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_encoder\");\n    __PYX_ERR(0, 1329, __pyx_L1_error)\n  }\n  if (unlikely(((PyObject *)__pyx_v_syms) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_table\");\n    __PYX_ERR(0, 1329, __pyx_L1_error)\n  }\n  __pyx_v_self->_encoder.get()->SetInputSymbols(__pyx_v_syms->_table);\n\n  /* \"pywrapfst.pyx\":1318\n *     return self._encoder.get().Properties(mask)\n * \n *   cpdef void set_input_symbols(self, _SymbolTable syms) except *:             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     set_input_symbols(self, syms)\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_AddTraceback(\"pywrapfst.EncodeMapper.set_input_symbols\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_12EncodeMapper_17set_input_symbols(PyObject *__pyx_v_self, PyObject *__pyx_v_syms); /*proto*/\nstatic char __pyx_doc_9pywrapfst_12EncodeMapper_16set_input_symbols[] = \"\\n    set_input_symbols(self, syms)\\n\\n    Sets the encoder's input symbol table.\\n\\n    Args:\\n      syms: A SymbolTable.\\n\\n    See also: `set_output_symbols`.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_12EncodeMapper_17set_input_symbols(PyObject *__pyx_v_self, PyObject *__pyx_v_syms) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"set_input_symbols (wrapper)\", 0);\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_syms), __pyx_ptype_9pywrapfst__SymbolTable, 1, \"syms\", 0))) __PYX_ERR(0, 1318, __pyx_L1_error)\n  __pyx_r = __pyx_pf_9pywrapfst_12EncodeMapper_16set_input_symbols(((struct __pyx_obj_9pywrapfst_EncodeMapper *)__pyx_v_self), ((struct __pyx_obj_9pywrapfst__SymbolTable *)__pyx_v_syms));\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_12EncodeMapper_16set_input_symbols(struct __pyx_obj_9pywrapfst_EncodeMapper *__pyx_v_self, struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_syms) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"set_input_symbols\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_f_9pywrapfst_12EncodeMapper_set_input_symbols(__pyx_v_self, __pyx_v_syms, 1); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 1318, __pyx_L1_error)\n  __pyx_t_1 = __Pyx_void_to_None(NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1318, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.EncodeMapper.set_input_symbols\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1331\n *     self._encoder.get().SetInputSymbols(syms._table)\n * \n *   cpdef void set_output_symbols(self, _SymbolTable syms) except *:             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     set_output_symbols(self, syms)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_12EncodeMapper_19set_output_symbols(PyObject *__pyx_v_self, PyObject *__pyx_v_syms); /*proto*/\nstatic void __pyx_f_9pywrapfst_12EncodeMapper_set_output_symbols(struct __pyx_obj_9pywrapfst_EncodeMapper *__pyx_v_self, struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_syms, int __pyx_skip_dispatch) {\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  __Pyx_RefNannySetupContext(\"set_output_symbols\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_set_output_symbols); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1331, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_12EncodeMapper_19set_output_symbols)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (!__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, ((PyObject *)__pyx_v_syms)); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1331, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_2);\n      } else {\n        #if CYTHON_FAST_PYCALL\n        if (PyFunction_Check(__pyx_t_3)) {\n          PyObject *__pyx_temp[2] = {__pyx_t_4, ((PyObject *)__pyx_v_syms)};\n          __pyx_t_2 = __Pyx_PyFunction_FastCall(__pyx_t_3, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1331, __pyx_L1_error)\n          __Pyx_XDECREF(__pyx_t_4); __pyx_t_4 = 0;\n          __Pyx_GOTREF(__pyx_t_2);\n        } else\n        #endif\n        #if CYTHON_FAST_PYCCALL\n        if (__Pyx_PyFastCFunction_Check(__pyx_t_3)) {\n          PyObject *__pyx_temp[2] = {__pyx_t_4, ((PyObject *)__pyx_v_syms)};\n          __pyx_t_2 = __Pyx_PyCFunction_FastCall(__pyx_t_3, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1331, __pyx_L1_error)\n          __Pyx_XDECREF(__pyx_t_4); __pyx_t_4 = 0;\n          __Pyx_GOTREF(__pyx_t_2);\n        } else\n        #endif\n        {\n          __pyx_t_5 = PyTuple_New(1+1); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 1331, __pyx_L1_error)\n          __Pyx_GOTREF(__pyx_t_5);\n          __Pyx_GIVEREF(__pyx_t_4); PyTuple_SET_ITEM(__pyx_t_5, 0, __pyx_t_4); __pyx_t_4 = NULL;\n          __Pyx_INCREF(((PyObject *)__pyx_v_syms));\n          __Pyx_GIVEREF(((PyObject *)__pyx_v_syms));\n          PyTuple_SET_ITEM(__pyx_t_5, 0+1, ((PyObject *)__pyx_v_syms));\n          __pyx_t_2 = __Pyx_PyObject_Call(__pyx_t_3, __pyx_t_5, NULL); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1331, __pyx_L1_error)\n          __Pyx_GOTREF(__pyx_t_2);\n          __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n        }\n      }\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":1342\n *     See also: `set_input_symbols`.\n *     \"\"\"\n *     self._encoder.get().SetOutputSymbols(syms._table)             # <<<<<<<<<<<<<<\n * \n *   cpdef string weight_type(self):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_encoder\");\n    __PYX_ERR(0, 1342, __pyx_L1_error)\n  }\n  if (unlikely(((PyObject *)__pyx_v_syms) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_table\");\n    __PYX_ERR(0, 1342, __pyx_L1_error)\n  }\n  __pyx_v_self->_encoder.get()->SetOutputSymbols(__pyx_v_syms->_table);\n\n  /* \"pywrapfst.pyx\":1331\n *     self._encoder.get().SetInputSymbols(syms._table)\n * \n *   cpdef void set_output_symbols(self, _SymbolTable syms) except *:             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     set_output_symbols(self, syms)\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_AddTraceback(\"pywrapfst.EncodeMapper.set_output_symbols\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_12EncodeMapper_19set_output_symbols(PyObject *__pyx_v_self, PyObject *__pyx_v_syms); /*proto*/\nstatic char __pyx_doc_9pywrapfst_12EncodeMapper_18set_output_symbols[] = \"\\n    set_output_symbols(self, syms)\\n\\n    Sets the encoder's output symbol table.\\n\\n    Args:\\n      syms: A SymbolTable.\\n\\n    See also: `set_input_symbols`.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_12EncodeMapper_19set_output_symbols(PyObject *__pyx_v_self, PyObject *__pyx_v_syms) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"set_output_symbols (wrapper)\", 0);\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_syms), __pyx_ptype_9pywrapfst__SymbolTable, 1, \"syms\", 0))) __PYX_ERR(0, 1331, __pyx_L1_error)\n  __pyx_r = __pyx_pf_9pywrapfst_12EncodeMapper_18set_output_symbols(((struct __pyx_obj_9pywrapfst_EncodeMapper *)__pyx_v_self), ((struct __pyx_obj_9pywrapfst__SymbolTable *)__pyx_v_syms));\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_12EncodeMapper_18set_output_symbols(struct __pyx_obj_9pywrapfst_EncodeMapper *__pyx_v_self, struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_syms) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"set_output_symbols\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_f_9pywrapfst_12EncodeMapper_set_output_symbols(__pyx_v_self, __pyx_v_syms, 1); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 1331, __pyx_L1_error)\n  __pyx_t_1 = __Pyx_void_to_None(NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1331, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.EncodeMapper.set_output_symbols\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1344\n *     self._encoder.get().SetOutputSymbols(syms._table)\n * \n *   cpdef string weight_type(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     weight_type(self)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_12EncodeMapper_21weight_type(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic std::string __pyx_f_9pywrapfst_12EncodeMapper_weight_type(struct __pyx_obj_9pywrapfst_EncodeMapper *__pyx_v_self, int __pyx_skip_dispatch) {\n  std::string __pyx_r;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  std::string __pyx_t_5;\n  __Pyx_RefNannySetupContext(\"weight_type\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_weight_type); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1344, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_12EncodeMapper_21weight_type)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1344, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1344, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __pyx_t_5 = __pyx_convert_string_from_py_std__in_string(__pyx_t_2); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 1344, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __pyx_r = __pyx_t_5;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":1350\n *     Returns a string indicating the weight type.\n *     \"\"\"\n *     return self._encoder.get().WeightType()             # <<<<<<<<<<<<<<\n * \n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_encoder\");\n    __PYX_ERR(0, 1350, __pyx_L1_error)\n  }\n  __pyx_r = __pyx_v_self->_encoder.get()->WeightType();\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":1344\n *     self._encoder.get().SetOutputSymbols(syms._table)\n * \n *   cpdef string weight_type(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     weight_type(self)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_WriteUnraisable(\"pywrapfst.EncodeMapper.weight_type\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __Pyx_pretend_to_initialize(&__pyx_r);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_12EncodeMapper_21weight_type(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_12EncodeMapper_20weight_type[] = \"\\n    weight_type(self)\\n\\n    Returns a string indicating the weight type.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_12EncodeMapper_21weight_type(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"weight_type (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_12EncodeMapper_20weight_type(((struct __pyx_obj_9pywrapfst_EncodeMapper *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_12EncodeMapper_20weight_type(struct __pyx_obj_9pywrapfst_EncodeMapper *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"weight_type\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __pyx_convert_PyBytes_string_to_py_std__in_string(__pyx_f_9pywrapfst_12EncodeMapper_weight_type(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1344, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.EncodeMapper.weight_type\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"(tree fragment)\":1\n * def __reduce_cython__(self):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._encoder cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_12EncodeMapper_23__reduce_cython__(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_12EncodeMapper_23__reduce_cython__(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__reduce_cython__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_12EncodeMapper_22__reduce_cython__(((struct __pyx_obj_9pywrapfst_EncodeMapper *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_12EncodeMapper_22__reduce_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst_EncodeMapper *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"__reduce_cython__\", 0);\n\n  /* \"(tree fragment)\":2\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._encoder cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._encoder cannot be converted to a Python object for pickling\")\n */\n  __pyx_t_1 = __Pyx_PyObject_Call(__pyx_builtin_TypeError, __pyx_tuple__22, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(1, 2, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __Pyx_Raise(__pyx_t_1, 0, 0, 0);\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  __PYX_ERR(1, 2, __pyx_L1_error)\n\n  /* \"(tree fragment)\":1\n * def __reduce_cython__(self):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._encoder cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.EncodeMapper.__reduce_cython__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"(tree fragment)\":3\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._encoder cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._encoder cannot be converted to a Python object for pickling\")\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_12EncodeMapper_25__setstate_cython__(PyObject *__pyx_v_self, PyObject *__pyx_v___pyx_state); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_12EncodeMapper_25__setstate_cython__(PyObject *__pyx_v_self, PyObject *__pyx_v___pyx_state) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__setstate_cython__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_12EncodeMapper_24__setstate_cython__(((struct __pyx_obj_9pywrapfst_EncodeMapper *)__pyx_v_self), ((PyObject *)__pyx_v___pyx_state));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_12EncodeMapper_24__setstate_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst_EncodeMapper *__pyx_v_self, CYTHON_UNUSED PyObject *__pyx_v___pyx_state) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"__setstate_cython__\", 0);\n\n  /* \"(tree fragment)\":4\n *     raise TypeError(\"self._encoder cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._encoder cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n */\n  __pyx_t_1 = __Pyx_PyObject_Call(__pyx_builtin_TypeError, __pyx_tuple__23, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(1, 4, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __Pyx_Raise(__pyx_t_1, 0, 0, 0);\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  __PYX_ERR(1, 4, __pyx_L1_error)\n\n  /* \"(tree fragment)\":3\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._encoder cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._encoder cannot be converted to a Python object for pickling\")\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.EncodeMapper.__setstate_cython__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1374\n * \n *   # IPython notebook magic to produce an SVG of the FST.\n *   def _repr_svg_(self):             # <<<<<<<<<<<<<<\n *     \"\"\"IPython notebook magic to produce an SVG of the FST using GraphViz.\n * \n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_1_repr_svg_(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_4_Fst__repr_svg_[] = \"IPython notebook magic to produce an SVG of the FST using GraphViz.\\n\\n    This method produces an SVG of the internal graph. Users wishing to create\\n    publication-quality graphs should instead use the method `draw`, which\\n    exposes additional parameters.\\n\\n    Raises:\\n      OSError: Cannot locate the `dot` executable.\\n      subprocess.CalledProcessError: `dot` returned non-zero exit code.\\n\\n    See also: `draw`, `text`.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_1_repr_svg_(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"_repr_svg_ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_4_Fst__repr_svg_(((struct __pyx_obj_9pywrapfst__Fst *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_4_Fst__repr_svg_(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self) {\n  PyObject *__pyx_v_proc = NULL;\n  std::stringstream __pyx_v_sstrm;\n  PyObject *__pyx_v_sout = NULL;\n  CYTHON_UNUSED PyObject *__pyx_v_serr = NULL;\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  PyObject *(*__pyx_t_6)(PyObject *);\n  int __pyx_t_7;\n  int __pyx_t_8;\n  PyObject *__pyx_t_9 = NULL;\n  __Pyx_RefNannySetupContext(\"_repr_svg_\", 0);\n\n  /* \"pywrapfst.pyx\":1388\n *     \"\"\"\n *     # Throws OSError if the dot executable is not found.\n *     proc = subprocess.Popen([\"dot\", \"-Tsvg\"], stdin=subprocess.PIPE,             # <<<<<<<<<<<<<<\n *                             stdout=subprocess.PIPE, stderr=subprocess.PIPE)\n *     cdef stringstream sstrm\n */\n  __pyx_t_1 = __Pyx_GetModuleGlobalName(__pyx_n_s_subprocess); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1388, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_t_2 = __Pyx_PyObject_GetAttrStr(__pyx_t_1, __pyx_n_s_Popen); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1388, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  __pyx_t_1 = PyList_New(2); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1388, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __Pyx_INCREF(__pyx_n_s_dot);\n  __Pyx_GIVEREF(__pyx_n_s_dot);\n  PyList_SET_ITEM(__pyx_t_1, 0, __pyx_n_s_dot);\n  __Pyx_INCREF(__pyx_kp_s_Tsvg);\n  __Pyx_GIVEREF(__pyx_kp_s_Tsvg);\n  PyList_SET_ITEM(__pyx_t_1, 1, __pyx_kp_s_Tsvg);\n  __pyx_t_3 = PyTuple_New(1); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 1388, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_3);\n  __Pyx_GIVEREF(__pyx_t_1);\n  PyTuple_SET_ITEM(__pyx_t_3, 0, __pyx_t_1);\n  __pyx_t_1 = 0;\n  __pyx_t_1 = __Pyx_PyDict_NewPresized(3); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1388, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_t_4 = __Pyx_GetModuleGlobalName(__pyx_n_s_subprocess); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 1388, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_4);\n  __pyx_t_5 = __Pyx_PyObject_GetAttrStr(__pyx_t_4, __pyx_n_s_PIPE); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 1388, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_5);\n  __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n  if (PyDict_SetItem(__pyx_t_1, __pyx_n_s_stdin, __pyx_t_5) < 0) __PYX_ERR(0, 1388, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n\n  /* \"pywrapfst.pyx\":1389\n *     # Throws OSError if the dot executable is not found.\n *     proc = subprocess.Popen([\"dot\", \"-Tsvg\"], stdin=subprocess.PIPE,\n *                             stdout=subprocess.PIPE, stderr=subprocess.PIPE)             # <<<<<<<<<<<<<<\n *     cdef stringstream sstrm\n *     fst.DrawFst(deref(self._fst), self._fst.get().InputSymbols(),\n */\n  __pyx_t_5 = __Pyx_GetModuleGlobalName(__pyx_n_s_subprocess); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 1389, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_5);\n  __pyx_t_4 = __Pyx_PyObject_GetAttrStr(__pyx_t_5, __pyx_n_s_PIPE); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 1389, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_4);\n  __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n  if (PyDict_SetItem(__pyx_t_1, __pyx_n_s_stdout, __pyx_t_4) < 0) __PYX_ERR(0, 1388, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n  __pyx_t_4 = __Pyx_GetModuleGlobalName(__pyx_n_s_subprocess); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 1389, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_4);\n  __pyx_t_5 = __Pyx_PyObject_GetAttrStr(__pyx_t_4, __pyx_n_s_PIPE); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 1389, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_5);\n  __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n  if (PyDict_SetItem(__pyx_t_1, __pyx_n_s_stderr, __pyx_t_5) < 0) __PYX_ERR(0, 1388, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n\n  /* \"pywrapfst.pyx\":1388\n *     \"\"\"\n *     # Throws OSError if the dot executable is not found.\n *     proc = subprocess.Popen([\"dot\", \"-Tsvg\"], stdin=subprocess.PIPE,             # <<<<<<<<<<<<<<\n *                             stdout=subprocess.PIPE, stderr=subprocess.PIPE)\n *     cdef stringstream sstrm\n */\n  __pyx_t_5 = __Pyx_PyObject_Call(__pyx_t_2, __pyx_t_3, __pyx_t_1); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 1388, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_5);\n  __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n  __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  __pyx_v_proc = __pyx_t_5;\n  __pyx_t_5 = 0;\n\n  /* \"pywrapfst.pyx\":1391\n *                             stdout=subprocess.PIPE, stderr=subprocess.PIPE)\n *     cdef stringstream sstrm\n *     fst.DrawFst(deref(self._fst), self._fst.get().InputSymbols(),             # <<<<<<<<<<<<<<\n *                 self._fst.get().OutputSymbols(), NULL,\n *                 self._fst.get().Properties(fst.kAcceptor, True) ==\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 1391, __pyx_L1_error)\n  }\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 1391, __pyx_L1_error)\n  }\n\n  /* \"pywrapfst.pyx\":1392\n *     cdef stringstream sstrm\n *     fst.DrawFst(deref(self._fst), self._fst.get().InputSymbols(),\n *                 self._fst.get().OutputSymbols(), NULL,             # <<<<<<<<<<<<<<\n *                 self._fst.get().Properties(fst.kAcceptor, True) ==\n *                 fst.kAcceptor,\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 1392, __pyx_L1_error)\n  }\n\n  /* \"pywrapfst.pyx\":1393\n *     fst.DrawFst(deref(self._fst), self._fst.get().InputSymbols(),\n *                 self._fst.get().OutputSymbols(), NULL,\n *                 self._fst.get().Properties(fst.kAcceptor, True) ==             # <<<<<<<<<<<<<<\n *                 fst.kAcceptor,\n *                 b\"\", 8.5, 11, True, False, 0.4, 0.25, 14, 5, b\"g\", False,\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 1393, __pyx_L1_error)\n  }\n\n  /* \"pywrapfst.pyx\":1391\n *                             stdout=subprocess.PIPE, stderr=subprocess.PIPE)\n *     cdef stringstream sstrm\n *     fst.DrawFst(deref(self._fst), self._fst.get().InputSymbols(),             # <<<<<<<<<<<<<<\n *                 self._fst.get().OutputSymbols(), NULL,\n *                 self._fst.get().Properties(fst.kAcceptor, True) ==\n */\n  fst::script::DrawFst((*__pyx_v_self->_fst), __pyx_v_self->_fst.get()->InputSymbols(), __pyx_v_self->_fst.get()->OutputSymbols(), NULL, (__pyx_v_self->_fst.get()->Properties(fst::kAcceptor, 1) == fst::kAcceptor), __pyx_k__24, 8.5, 11.0, 1, 0, 0.4, 0.25, 14, 5, __pyx_k_g, 0, (&__pyx_v_sstrm), __pyx_k_repr_svg);\n\n  /* \"pywrapfst.pyx\":1397\n *                 b\"\", 8.5, 11, True, False, 0.4, 0.25, 14, 5, b\"g\", False,\n *                 addr(sstrm), b\"_repr_svg\")\n *     (sout, serr) = proc.communicate(sstrm.str())             # <<<<<<<<<<<<<<\n *     if proc.returncode != 0:  # Just to be explicit.\n *       raise subprocess.CalledProcessError(proc.returncode, self._DOT_TSVG)\n */\n  __pyx_t_1 = __Pyx_PyObject_GetAttrStr(__pyx_v_proc, __pyx_n_s_communicate); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1397, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_t_3 = __pyx_convert_PyBytes_string_to_py_std__in_string(__pyx_v_sstrm.str()); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 1397, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_3);\n  __pyx_t_2 = NULL;\n  if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_1))) {\n    __pyx_t_2 = PyMethod_GET_SELF(__pyx_t_1);\n    if (likely(__pyx_t_2)) {\n      PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_1);\n      __Pyx_INCREF(__pyx_t_2);\n      __Pyx_INCREF(function);\n      __Pyx_DECREF_SET(__pyx_t_1, function);\n    }\n  }\n  if (!__pyx_t_2) {\n    __pyx_t_5 = __Pyx_PyObject_CallOneArg(__pyx_t_1, __pyx_t_3); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 1397, __pyx_L1_error)\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    __Pyx_GOTREF(__pyx_t_5);\n  } else {\n    #if CYTHON_FAST_PYCALL\n    if (PyFunction_Check(__pyx_t_1)) {\n      PyObject *__pyx_temp[2] = {__pyx_t_2, __pyx_t_3};\n      __pyx_t_5 = __Pyx_PyFunction_FastCall(__pyx_t_1, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 1397, __pyx_L1_error)\n      __Pyx_XDECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __Pyx_GOTREF(__pyx_t_5);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    } else\n    #endif\n    #if CYTHON_FAST_PYCCALL\n    if (__Pyx_PyFastCFunction_Check(__pyx_t_1)) {\n      PyObject *__pyx_temp[2] = {__pyx_t_2, __pyx_t_3};\n      __pyx_t_5 = __Pyx_PyCFunction_FastCall(__pyx_t_1, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 1397, __pyx_L1_error)\n      __Pyx_XDECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __Pyx_GOTREF(__pyx_t_5);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    } else\n    #endif\n    {\n      __pyx_t_4 = PyTuple_New(1+1); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 1397, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_4);\n      __Pyx_GIVEREF(__pyx_t_2); PyTuple_SET_ITEM(__pyx_t_4, 0, __pyx_t_2); __pyx_t_2 = NULL;\n      __Pyx_GIVEREF(__pyx_t_3);\n      PyTuple_SET_ITEM(__pyx_t_4, 0+1, __pyx_t_3);\n      __pyx_t_3 = 0;\n      __pyx_t_5 = __Pyx_PyObject_Call(__pyx_t_1, __pyx_t_4, NULL); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 1397, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_5);\n      __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n    }\n  }\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  if ((likely(PyTuple_CheckExact(__pyx_t_5))) || (PyList_CheckExact(__pyx_t_5))) {\n    PyObject* sequence = __pyx_t_5;\n    Py_ssize_t size = __Pyx_PySequence_SIZE(sequence);\n    if (unlikely(size != 2)) {\n      if (size > 2) __Pyx_RaiseTooManyValuesError(2);\n      else if (size >= 0) __Pyx_RaiseNeedMoreValuesError(size);\n      __PYX_ERR(0, 1397, __pyx_L1_error)\n    }\n    #if CYTHON_ASSUME_SAFE_MACROS && !CYTHON_AVOID_BORROWED_REFS\n    if (likely(PyTuple_CheckExact(sequence))) {\n      __pyx_t_1 = PyTuple_GET_ITEM(sequence, 0); \n      __pyx_t_4 = PyTuple_GET_ITEM(sequence, 1); \n    } else {\n      __pyx_t_1 = PyList_GET_ITEM(sequence, 0); \n      __pyx_t_4 = PyList_GET_ITEM(sequence, 1); \n    }\n    __Pyx_INCREF(__pyx_t_1);\n    __Pyx_INCREF(__pyx_t_4);\n    #else\n    __pyx_t_1 = PySequence_ITEM(sequence, 0); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1397, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    __pyx_t_4 = PySequence_ITEM(sequence, 1); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 1397, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_4);\n    #endif\n    __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n  } else {\n    Py_ssize_t index = -1;\n    __pyx_t_3 = PyObject_GetIter(__pyx_t_5); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 1397, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_3);\n    __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n    __pyx_t_6 = Py_TYPE(__pyx_t_3)->tp_iternext;\n    index = 0; __pyx_t_1 = __pyx_t_6(__pyx_t_3); if (unlikely(!__pyx_t_1)) goto __pyx_L3_unpacking_failed;\n    __Pyx_GOTREF(__pyx_t_1);\n    index = 1; __pyx_t_4 = __pyx_t_6(__pyx_t_3); if (unlikely(!__pyx_t_4)) goto __pyx_L3_unpacking_failed;\n    __Pyx_GOTREF(__pyx_t_4);\n    if (__Pyx_IternextUnpackEndCheck(__pyx_t_6(__pyx_t_3), 2) < 0) __PYX_ERR(0, 1397, __pyx_L1_error)\n    __pyx_t_6 = NULL;\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    goto __pyx_L4_unpacking_done;\n    __pyx_L3_unpacking_failed:;\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    __pyx_t_6 = NULL;\n    if (__Pyx_IterFinish() == 0) __Pyx_RaiseNeedMoreValuesError(index);\n    __PYX_ERR(0, 1397, __pyx_L1_error)\n    __pyx_L4_unpacking_done:;\n  }\n  __pyx_v_sout = __pyx_t_1;\n  __pyx_t_1 = 0;\n  __pyx_v_serr = __pyx_t_4;\n  __pyx_t_4 = 0;\n\n  /* \"pywrapfst.pyx\":1398\n *                 addr(sstrm), b\"_repr_svg\")\n *     (sout, serr) = proc.communicate(sstrm.str())\n *     if proc.returncode != 0:  # Just to be explicit.             # <<<<<<<<<<<<<<\n *       raise subprocess.CalledProcessError(proc.returncode, self._DOT_TSVG)\n *     return sout.decode(\"utf8\")\n */\n  __pyx_t_5 = __Pyx_PyObject_GetAttrStr(__pyx_v_proc, __pyx_n_s_returncode); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 1398, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_5);\n  __pyx_t_4 = PyObject_RichCompare(__pyx_t_5, __pyx_int_0, Py_NE); __Pyx_XGOTREF(__pyx_t_4); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 1398, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n  __pyx_t_7 = __Pyx_PyObject_IsTrue(__pyx_t_4); if (unlikely(__pyx_t_7 < 0)) __PYX_ERR(0, 1398, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n  if (unlikely(__pyx_t_7)) {\n\n    /* \"pywrapfst.pyx\":1399\n *     (sout, serr) = proc.communicate(sstrm.str())\n *     if proc.returncode != 0:  # Just to be explicit.\n *       raise subprocess.CalledProcessError(proc.returncode, self._DOT_TSVG)             # <<<<<<<<<<<<<<\n *     return sout.decode(\"utf8\")\n * \n */\n    __pyx_t_5 = __Pyx_GetModuleGlobalName(__pyx_n_s_subprocess); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 1399, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_5);\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(__pyx_t_5, __pyx_n_s_CalledProcessError); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1399, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n    __pyx_t_5 = __Pyx_PyObject_GetAttrStr(__pyx_v_proc, __pyx_n_s_returncode); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 1399, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_5);\n    __pyx_t_3 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_DOT_TSVG); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 1399, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_3);\n    __pyx_t_2 = NULL;\n    __pyx_t_8 = 0;\n    if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_1))) {\n      __pyx_t_2 = PyMethod_GET_SELF(__pyx_t_1);\n      if (likely(__pyx_t_2)) {\n        PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_1);\n        __Pyx_INCREF(__pyx_t_2);\n        __Pyx_INCREF(function);\n        __Pyx_DECREF_SET(__pyx_t_1, function);\n        __pyx_t_8 = 1;\n      }\n    }\n    #if CYTHON_FAST_PYCALL\n    if (PyFunction_Check(__pyx_t_1)) {\n      PyObject *__pyx_temp[3] = {__pyx_t_2, __pyx_t_5, __pyx_t_3};\n      __pyx_t_4 = __Pyx_PyFunction_FastCall(__pyx_t_1, __pyx_temp+1-__pyx_t_8, 2+__pyx_t_8); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 1399, __pyx_L1_error)\n      __Pyx_XDECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __Pyx_GOTREF(__pyx_t_4);\n      __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    } else\n    #endif\n    #if CYTHON_FAST_PYCCALL\n    if (__Pyx_PyFastCFunction_Check(__pyx_t_1)) {\n      PyObject *__pyx_temp[3] = {__pyx_t_2, __pyx_t_5, __pyx_t_3};\n      __pyx_t_4 = __Pyx_PyCFunction_FastCall(__pyx_t_1, __pyx_temp+1-__pyx_t_8, 2+__pyx_t_8); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 1399, __pyx_L1_error)\n      __Pyx_XDECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __Pyx_GOTREF(__pyx_t_4);\n      __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    } else\n    #endif\n    {\n      __pyx_t_9 = PyTuple_New(2+__pyx_t_8); if (unlikely(!__pyx_t_9)) __PYX_ERR(0, 1399, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_9);\n      if (__pyx_t_2) {\n        __Pyx_GIVEREF(__pyx_t_2); PyTuple_SET_ITEM(__pyx_t_9, 0, __pyx_t_2); __pyx_t_2 = NULL;\n      }\n      __Pyx_GIVEREF(__pyx_t_5);\n      PyTuple_SET_ITEM(__pyx_t_9, 0+__pyx_t_8, __pyx_t_5);\n      __Pyx_GIVEREF(__pyx_t_3);\n      PyTuple_SET_ITEM(__pyx_t_9, 1+__pyx_t_8, __pyx_t_3);\n      __pyx_t_5 = 0;\n      __pyx_t_3 = 0;\n      __pyx_t_4 = __Pyx_PyObject_Call(__pyx_t_1, __pyx_t_9, NULL); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 1399, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_4);\n      __Pyx_DECREF(__pyx_t_9); __pyx_t_9 = 0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n    __Pyx_Raise(__pyx_t_4, 0, 0, 0);\n    __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n    __PYX_ERR(0, 1399, __pyx_L1_error)\n\n    /* \"pywrapfst.pyx\":1398\n *                 addr(sstrm), b\"_repr_svg\")\n *     (sout, serr) = proc.communicate(sstrm.str())\n *     if proc.returncode != 0:  # Just to be explicit.             # <<<<<<<<<<<<<<\n *       raise subprocess.CalledProcessError(proc.returncode, self._DOT_TSVG)\n *     return sout.decode(\"utf8\")\n */\n  }\n\n  /* \"pywrapfst.pyx\":1400\n *     if proc.returncode != 0:  # Just to be explicit.\n *       raise subprocess.CalledProcessError(proc.returncode, self._DOT_TSVG)\n *     return sout.decode(\"utf8\")             # <<<<<<<<<<<<<<\n * \n *   def __repr__(self):\n */\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_4 = __Pyx_PyObject_GetAttrStr(__pyx_v_sout, __pyx_n_s_decode); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 1400, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_4);\n  __pyx_t_1 = __Pyx_PyObject_Call(__pyx_t_4, __pyx_tuple__25, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1400, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":1374\n * \n *   # IPython notebook magic to produce an SVG of the FST.\n *   def _repr_svg_(self):             # <<<<<<<<<<<<<<\n *     \"\"\"IPython notebook magic to produce an SVG of the FST using GraphViz.\n * \n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_XDECREF(__pyx_t_9);\n  __Pyx_AddTraceback(\"pywrapfst._Fst._repr_svg_\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XDECREF(__pyx_v_proc);\n  __Pyx_XDECREF(__pyx_v_sout);\n  __Pyx_XDECREF(__pyx_v_serr);\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1402\n *     return sout.decode(\"utf8\")\n * \n *   def __repr__(self):             # <<<<<<<<<<<<<<\n *     return \"<{} Fst at 0x{:x}>\".format(self.fst_type(), id(self))\n * \n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_3__repr__(PyObject *__pyx_v_self); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_3__repr__(PyObject *__pyx_v_self) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__repr__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_4_Fst_2__repr__(((struct __pyx_obj_9pywrapfst__Fst *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_4_Fst_2__repr__(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  int __pyx_t_6;\n  PyObject *__pyx_t_7 = NULL;\n  __Pyx_RefNannySetupContext(\"__repr__\", 0);\n\n  /* \"pywrapfst.pyx\":1403\n * \n *   def __repr__(self):\n *     return \"<{} Fst at 0x{:x}>\".format(self.fst_type(), id(self))             # <<<<<<<<<<<<<<\n * \n *   def __init__(self):\n */\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_2 = __Pyx_PyObject_GetAttrStr(__pyx_kp_s_Fst_at_0x_x, __pyx_n_s_format); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1403, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"fst_type\");\n    __PYX_ERR(0, 1403, __pyx_L1_error)\n  }\n  __pyx_t_3 = __pyx_convert_PyBytes_string_to_py_std__in_string(((struct __pyx_vtabstruct_9pywrapfst__Fst *)__pyx_v_self->__pyx_vtab)->fst_type(__pyx_v_self, 0)); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 1403, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_3);\n  __pyx_t_4 = __Pyx_PyObject_CallOneArg(__pyx_builtin_id, ((PyObject *)__pyx_v_self)); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 1403, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_4);\n  __pyx_t_5 = NULL;\n  __pyx_t_6 = 0;\n  if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_2))) {\n    __pyx_t_5 = PyMethod_GET_SELF(__pyx_t_2);\n    if (likely(__pyx_t_5)) {\n      PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_2);\n      __Pyx_INCREF(__pyx_t_5);\n      __Pyx_INCREF(function);\n      __Pyx_DECREF_SET(__pyx_t_2, function);\n      __pyx_t_6 = 1;\n    }\n  }\n  #if CYTHON_FAST_PYCALL\n  if (PyFunction_Check(__pyx_t_2)) {\n    PyObject *__pyx_temp[3] = {__pyx_t_5, __pyx_t_3, __pyx_t_4};\n    __pyx_t_1 = __Pyx_PyFunction_FastCall(__pyx_t_2, __pyx_temp+1-__pyx_t_6, 2+__pyx_t_6); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1403, __pyx_L1_error)\n    __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;\n    __Pyx_GOTREF(__pyx_t_1);\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n  } else\n  #endif\n  #if CYTHON_FAST_PYCCALL\n  if (__Pyx_PyFastCFunction_Check(__pyx_t_2)) {\n    PyObject *__pyx_temp[3] = {__pyx_t_5, __pyx_t_3, __pyx_t_4};\n    __pyx_t_1 = __Pyx_PyCFunction_FastCall(__pyx_t_2, __pyx_temp+1-__pyx_t_6, 2+__pyx_t_6); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1403, __pyx_L1_error)\n    __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;\n    __Pyx_GOTREF(__pyx_t_1);\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n  } else\n  #endif\n  {\n    __pyx_t_7 = PyTuple_New(2+__pyx_t_6); if (unlikely(!__pyx_t_7)) __PYX_ERR(0, 1403, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_7);\n    if (__pyx_t_5) {\n      __Pyx_GIVEREF(__pyx_t_5); PyTuple_SET_ITEM(__pyx_t_7, 0, __pyx_t_5); __pyx_t_5 = NULL;\n    }\n    __Pyx_GIVEREF(__pyx_t_3);\n    PyTuple_SET_ITEM(__pyx_t_7, 0+__pyx_t_6, __pyx_t_3);\n    __Pyx_GIVEREF(__pyx_t_4);\n    PyTuple_SET_ITEM(__pyx_t_7, 1+__pyx_t_6, __pyx_t_4);\n    __pyx_t_3 = 0;\n    __pyx_t_4 = 0;\n    __pyx_t_1 = __Pyx_PyObject_Call(__pyx_t_2, __pyx_t_7, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1403, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0;\n  }\n  __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":1402\n *     return sout.decode(\"utf8\")\n * \n *   def __repr__(self):             # <<<<<<<<<<<<<<\n *     return \"<{} Fst at 0x{:x}>\".format(self.fst_type(), id(self))\n * \n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_XDECREF(__pyx_t_7);\n  __Pyx_AddTraceback(\"pywrapfst._Fst.__repr__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1405\n *     return \"<{} Fst at 0x{:x}>\".format(self.fst_type(), id(self))\n * \n *   def __init__(self):             # <<<<<<<<<<<<<<\n *     raise FstDeletedConstructorError(\n *         \"Cannot construct {}\".format(self.__class__.__name__))\n */\n\n/* Python wrapper */\nstatic int __pyx_pw_9pywrapfst_4_Fst_5__init__(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic int __pyx_pw_9pywrapfst_4_Fst_5__init__(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  int __pyx_r;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__init__ (wrapper)\", 0);\n  if (unlikely(PyTuple_GET_SIZE(__pyx_args) > 0)) {\n    __Pyx_RaiseArgtupleInvalid(\"__init__\", 1, 0, 0, PyTuple_GET_SIZE(__pyx_args)); return -1;}\n  if (unlikely(__pyx_kwds) && unlikely(PyDict_Size(__pyx_kwds) > 0) && unlikely(!__Pyx_CheckKeywordStrings(__pyx_kwds, \"__init__\", 0))) return -1;\n  __pyx_r = __pyx_pf_9pywrapfst_4_Fst_4__init__(((struct __pyx_obj_9pywrapfst__Fst *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic int __pyx_pf_9pywrapfst_4_Fst_4__init__(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self) {\n  int __pyx_r;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  PyObject *__pyx_t_6 = NULL;\n  PyObject *__pyx_t_7 = NULL;\n  __Pyx_RefNannySetupContext(\"__init__\", 0);\n\n  /* \"pywrapfst.pyx\":1406\n * \n *   def __init__(self):\n *     raise FstDeletedConstructorError(             # <<<<<<<<<<<<<<\n *         \"Cannot construct {}\".format(self.__class__.__name__))\n * \n */\n  __pyx_t_2 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstDeletedConstructorError); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1406, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n\n  /* \"pywrapfst.pyx\":1407\n *   def __init__(self):\n *     raise FstDeletedConstructorError(\n *         \"Cannot construct {}\".format(self.__class__.__name__))             # <<<<<<<<<<<<<<\n * \n *   def __str__(self):\n */\n  __pyx_t_4 = __Pyx_PyObject_GetAttrStr(__pyx_kp_s_Cannot_construct, __pyx_n_s_format); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 1407, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_4);\n  __pyx_t_5 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_class); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 1407, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_5);\n  __pyx_t_6 = __Pyx_PyObject_GetAttrStr(__pyx_t_5, __pyx_n_s_name); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 1407, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_6);\n  __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n  __pyx_t_5 = NULL;\n  if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_4))) {\n    __pyx_t_5 = PyMethod_GET_SELF(__pyx_t_4);\n    if (likely(__pyx_t_5)) {\n      PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_4);\n      __Pyx_INCREF(__pyx_t_5);\n      __Pyx_INCREF(function);\n      __Pyx_DECREF_SET(__pyx_t_4, function);\n    }\n  }\n  if (!__pyx_t_5) {\n    __pyx_t_3 = __Pyx_PyObject_CallOneArg(__pyx_t_4, __pyx_t_6); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 1407, __pyx_L1_error)\n    __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n    __Pyx_GOTREF(__pyx_t_3);\n  } else {\n    #if CYTHON_FAST_PYCALL\n    if (PyFunction_Check(__pyx_t_4)) {\n      PyObject *__pyx_temp[2] = {__pyx_t_5, __pyx_t_6};\n      __pyx_t_3 = __Pyx_PyFunction_FastCall(__pyx_t_4, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 1407, __pyx_L1_error)\n      __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;\n      __Pyx_GOTREF(__pyx_t_3);\n      __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n    } else\n    #endif\n    #if CYTHON_FAST_PYCCALL\n    if (__Pyx_PyFastCFunction_Check(__pyx_t_4)) {\n      PyObject *__pyx_temp[2] = {__pyx_t_5, __pyx_t_6};\n      __pyx_t_3 = __Pyx_PyCFunction_FastCall(__pyx_t_4, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 1407, __pyx_L1_error)\n      __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;\n      __Pyx_GOTREF(__pyx_t_3);\n      __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n    } else\n    #endif\n    {\n      __pyx_t_7 = PyTuple_New(1+1); if (unlikely(!__pyx_t_7)) __PYX_ERR(0, 1407, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_7);\n      __Pyx_GIVEREF(__pyx_t_5); PyTuple_SET_ITEM(__pyx_t_7, 0, __pyx_t_5); __pyx_t_5 = NULL;\n      __Pyx_GIVEREF(__pyx_t_6);\n      PyTuple_SET_ITEM(__pyx_t_7, 0+1, __pyx_t_6);\n      __pyx_t_6 = 0;\n      __pyx_t_3 = __Pyx_PyObject_Call(__pyx_t_4, __pyx_t_7, NULL); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 1407, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_3);\n      __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0;\n    }\n  }\n  __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n  __pyx_t_4 = NULL;\n  if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_2))) {\n    __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_2);\n    if (likely(__pyx_t_4)) {\n      PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_2);\n      __Pyx_INCREF(__pyx_t_4);\n      __Pyx_INCREF(function);\n      __Pyx_DECREF_SET(__pyx_t_2, function);\n    }\n  }\n  if (!__pyx_t_4) {\n    __pyx_t_1 = __Pyx_PyObject_CallOneArg(__pyx_t_2, __pyx_t_3); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1406, __pyx_L1_error)\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    __Pyx_GOTREF(__pyx_t_1);\n  } else {\n    #if CYTHON_FAST_PYCALL\n    if (PyFunction_Check(__pyx_t_2)) {\n      PyObject *__pyx_temp[2] = {__pyx_t_4, __pyx_t_3};\n      __pyx_t_1 = __Pyx_PyFunction_FastCall(__pyx_t_2, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1406, __pyx_L1_error)\n      __Pyx_XDECREF(__pyx_t_4); __pyx_t_4 = 0;\n      __Pyx_GOTREF(__pyx_t_1);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    } else\n    #endif\n    #if CYTHON_FAST_PYCCALL\n    if (__Pyx_PyFastCFunction_Check(__pyx_t_2)) {\n      PyObject *__pyx_temp[2] = {__pyx_t_4, __pyx_t_3};\n      __pyx_t_1 = __Pyx_PyCFunction_FastCall(__pyx_t_2, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1406, __pyx_L1_error)\n      __Pyx_XDECREF(__pyx_t_4); __pyx_t_4 = 0;\n      __Pyx_GOTREF(__pyx_t_1);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    } else\n    #endif\n    {\n      __pyx_t_7 = PyTuple_New(1+1); if (unlikely(!__pyx_t_7)) __PYX_ERR(0, 1406, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_7);\n      __Pyx_GIVEREF(__pyx_t_4); PyTuple_SET_ITEM(__pyx_t_7, 0, __pyx_t_4); __pyx_t_4 = NULL;\n      __Pyx_GIVEREF(__pyx_t_3);\n      PyTuple_SET_ITEM(__pyx_t_7, 0+1, __pyx_t_3);\n      __pyx_t_3 = 0;\n      __pyx_t_1 = __Pyx_PyObject_Call(__pyx_t_2, __pyx_t_7, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1406, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_1);\n      __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0;\n    }\n  }\n  __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n  __Pyx_Raise(__pyx_t_1, 0, 0, 0);\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  __PYX_ERR(0, 1406, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":1405\n *     return \"<{} Fst at 0x{:x}>\".format(self.fst_type(), id(self))\n * \n *   def __init__(self):             # <<<<<<<<<<<<<<\n *     raise FstDeletedConstructorError(\n *         \"Cannot construct {}\".format(self.__class__.__name__))\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_XDECREF(__pyx_t_6);\n  __Pyx_XDECREF(__pyx_t_7);\n  __Pyx_AddTraceback(\"pywrapfst._Fst.__init__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = -1;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1409\n *         \"Cannot construct {}\".format(self.__class__.__name__))\n * \n *   def __str__(self):             # <<<<<<<<<<<<<<\n *     return self.text()\n * \n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_7__str__(PyObject *__pyx_v_self); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_7__str__(PyObject *__pyx_v_self) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__str__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_4_Fst_6__str__(((struct __pyx_obj_9pywrapfst__Fst *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_4_Fst_6__str__(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"__str__\", 0);\n\n  /* \"pywrapfst.pyx\":1410\n * \n *   def __str__(self):\n *     return self.text()             # <<<<<<<<<<<<<<\n * \n *   # Registers the class for pickling; must be repeated in any subclass which\n */\n  __Pyx_XDECREF(__pyx_r);\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"text\");\n    __PYX_ERR(0, 1410, __pyx_L1_error)\n  }\n  __pyx_t_1 = __pyx_convert_PyBytes_string_to_py_std__in_string(((struct __pyx_vtabstruct_9pywrapfst__Fst *)__pyx_v_self->__pyx_vtab)->text(__pyx_v_self, 0, NULL)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1410, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":1409\n *         \"Cannot construct {}\".format(self.__class__.__name__))\n * \n *   def __str__(self):             # <<<<<<<<<<<<<<\n *     return self.text()\n * \n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst._Fst.__str__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1415\n *   # can't be derived by _init_XFst.\n * \n *   def __reduce__(self):             # <<<<<<<<<<<<<<\n *     return (_read_from_string, (self.write_to_string(),))\n * \n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_9__reduce__(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_9__reduce__(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__reduce__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_4_Fst_8__reduce__(((struct __pyx_obj_9pywrapfst__Fst *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_4_Fst_8__reduce__(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  __Pyx_RefNannySetupContext(\"__reduce__\", 0);\n\n  /* \"pywrapfst.pyx\":1416\n * \n *   def __reduce__(self):\n *     return (_read_from_string, (self.write_to_string(),))             # <<<<<<<<<<<<<<\n * \n *   cpdef string arc_type(self):\n */\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __Pyx_GetModuleGlobalName(__pyx_n_s_read_from_string); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1416, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"write_to_string\");\n    __PYX_ERR(0, 1416, __pyx_L1_error)\n  }\n  __pyx_t_2 = __pyx_convert_PyBytes_string_to_py_std__in_string(((struct __pyx_vtabstruct_9pywrapfst__Fst *)__pyx_v_self->__pyx_vtab)->write_to_string(__pyx_v_self, 0)); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1416, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  __pyx_t_3 = PyTuple_New(1); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 1416, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_3);\n  __Pyx_GIVEREF(__pyx_t_2);\n  PyTuple_SET_ITEM(__pyx_t_3, 0, __pyx_t_2);\n  __pyx_t_2 = 0;\n  __pyx_t_2 = PyTuple_New(2); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1416, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  __Pyx_GIVEREF(__pyx_t_1);\n  PyTuple_SET_ITEM(__pyx_t_2, 0, __pyx_t_1);\n  __Pyx_GIVEREF(__pyx_t_3);\n  PyTuple_SET_ITEM(__pyx_t_2, 1, __pyx_t_3);\n  __pyx_t_1 = 0;\n  __pyx_t_3 = 0;\n  __pyx_r = __pyx_t_2;\n  __pyx_t_2 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":1415\n *   # can't be derived by _init_XFst.\n * \n *   def __reduce__(self):             # <<<<<<<<<<<<<<\n *     return (_read_from_string, (self.write_to_string(),))\n * \n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_AddTraceback(\"pywrapfst._Fst.__reduce__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1418\n *     return (_read_from_string, (self.write_to_string(),))\n * \n *   cpdef string arc_type(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     arc_type(self)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_11arc_type(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic std::string __pyx_f_9pywrapfst_4_Fst_arc_type(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self, int __pyx_skip_dispatch) {\n  std::string __pyx_r;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  std::string __pyx_t_5;\n  __Pyx_RefNannySetupContext(\"arc_type\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_arc_type); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1418, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_4_Fst_11arc_type)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1418, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1418, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __pyx_t_5 = __pyx_convert_string_from_py_std__in_string(__pyx_t_2); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 1418, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __pyx_r = __pyx_t_5;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":1424\n *     Returns a string indicating the arc type.\n *     \"\"\"\n *     return self._fst.get().ArcType()             # <<<<<<<<<<<<<<\n * \n *   cpdef ArcIterator arcs(self, int64 state):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 1424, __pyx_L1_error)\n  }\n  __pyx_r = __pyx_v_self->_fst.get()->ArcType();\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":1418\n *     return (_read_from_string, (self.write_to_string(),))\n * \n *   cpdef string arc_type(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     arc_type(self)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_WriteUnraisable(\"pywrapfst._Fst.arc_type\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __Pyx_pretend_to_initialize(&__pyx_r);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_11arc_type(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_4_Fst_10arc_type[] = \"\\n    arc_type(self)\\n\\n    Returns a string indicating the arc type.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_11arc_type(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"arc_type (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_4_Fst_10arc_type(((struct __pyx_obj_9pywrapfst__Fst *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_4_Fst_10arc_type(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"arc_type\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __pyx_convert_PyBytes_string_to_py_std__in_string(__pyx_f_9pywrapfst_4_Fst_arc_type(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1418, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst._Fst.arc_type\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1426\n *     return self._fst.get().ArcType()\n * \n *   cpdef ArcIterator arcs(self, int64 state):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     arcs(self, state)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_13arcs(PyObject *__pyx_v_self, PyObject *__pyx_arg_state); /*proto*/\nstatic struct __pyx_obj_9pywrapfst_ArcIterator *__pyx_f_9pywrapfst_4_Fst_arcs(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self, __pyx_t_10basictypes_int64 __pyx_v_state, int __pyx_skip_dispatch) {\n  struct __pyx_obj_9pywrapfst_ArcIterator *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  PyObject *__pyx_t_6 = NULL;\n  __Pyx_RefNannySetupContext(\"arcs\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_arcs); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1426, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_4_Fst_13arcs)) {\n      __Pyx_XDECREF(((PyObject *)__pyx_r));\n      __pyx_t_3 = __Pyx_PyInt_From_int64_t(__pyx_v_state); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 1426, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_3);\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_4 = __pyx_t_1; __pyx_t_5 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_4))) {\n        __pyx_t_5 = PyMethod_GET_SELF(__pyx_t_4);\n        if (likely(__pyx_t_5)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_4);\n          __Pyx_INCREF(__pyx_t_5);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_4, function);\n        }\n      }\n      if (!__pyx_t_5) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_4, __pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1426, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n        __Pyx_GOTREF(__pyx_t_2);\n      } else {\n        #if CYTHON_FAST_PYCALL\n        if (PyFunction_Check(__pyx_t_4)) {\n          PyObject *__pyx_temp[2] = {__pyx_t_5, __pyx_t_3};\n          __pyx_t_2 = __Pyx_PyFunction_FastCall(__pyx_t_4, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1426, __pyx_L1_error)\n          __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;\n          __Pyx_GOTREF(__pyx_t_2);\n          __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n        } else\n        #endif\n        #if CYTHON_FAST_PYCCALL\n        if (__Pyx_PyFastCFunction_Check(__pyx_t_4)) {\n          PyObject *__pyx_temp[2] = {__pyx_t_5, __pyx_t_3};\n          __pyx_t_2 = __Pyx_PyCFunction_FastCall(__pyx_t_4, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1426, __pyx_L1_error)\n          __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;\n          __Pyx_GOTREF(__pyx_t_2);\n          __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n        } else\n        #endif\n        {\n          __pyx_t_6 = PyTuple_New(1+1); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 1426, __pyx_L1_error)\n          __Pyx_GOTREF(__pyx_t_6);\n          __Pyx_GIVEREF(__pyx_t_5); PyTuple_SET_ITEM(__pyx_t_6, 0, __pyx_t_5); __pyx_t_5 = NULL;\n          __Pyx_GIVEREF(__pyx_t_3);\n          PyTuple_SET_ITEM(__pyx_t_6, 0+1, __pyx_t_3);\n          __pyx_t_3 = 0;\n          __pyx_t_2 = __Pyx_PyObject_Call(__pyx_t_4, __pyx_t_6, NULL); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1426, __pyx_L1_error)\n          __Pyx_GOTREF(__pyx_t_2);\n          __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n        }\n      }\n      __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      if (!(likely(((__pyx_t_2) == Py_None) || likely(__Pyx_TypeTest(__pyx_t_2, __pyx_ptype_9pywrapfst_ArcIterator))))) __PYX_ERR(0, 1426, __pyx_L1_error)\n      __pyx_r = ((struct __pyx_obj_9pywrapfst_ArcIterator *)__pyx_t_2);\n      __pyx_t_2 = 0;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":1440\n *     See also: `mutable_arcs`, `states`.\n *     \"\"\"\n *     return ArcIterator(self, state)             # <<<<<<<<<<<<<<\n * \n *   cpdef _Fst copy(self):\n */\n  __Pyx_XDECREF(((PyObject *)__pyx_r));\n  __pyx_t_1 = __Pyx_PyInt_From_int64_t(__pyx_v_state); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1440, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_t_2 = PyTuple_New(2); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1440, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  __Pyx_INCREF(((PyObject *)__pyx_v_self));\n  __Pyx_GIVEREF(((PyObject *)__pyx_v_self));\n  PyTuple_SET_ITEM(__pyx_t_2, 0, ((PyObject *)__pyx_v_self));\n  __Pyx_GIVEREF(__pyx_t_1);\n  PyTuple_SET_ITEM(__pyx_t_2, 1, __pyx_t_1);\n  __pyx_t_1 = 0;\n  __pyx_t_1 = __Pyx_PyObject_Call(((PyObject *)__pyx_ptype_9pywrapfst_ArcIterator), __pyx_t_2, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1440, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n  __pyx_r = ((struct __pyx_obj_9pywrapfst_ArcIterator *)__pyx_t_1);\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":1426\n *     return self._fst.get().ArcType()\n * \n *   cpdef ArcIterator arcs(self, int64 state):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     arcs(self, state)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_XDECREF(__pyx_t_6);\n  __Pyx_AddTraceback(\"pywrapfst._Fst.arcs\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XGIVEREF((PyObject *)__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_13arcs(PyObject *__pyx_v_self, PyObject *__pyx_arg_state); /*proto*/\nstatic char __pyx_doc_9pywrapfst_4_Fst_12arcs[] = \"\\n    arcs(self, state)\\n\\n    Returns an iterator over arcs leaving the specified state.\\n\\n    Args:\\n      state: The source state ID.\\n\\n    Returns:\\n      An ArcIterator.\\n\\n    See also: `mutable_arcs`, `states`.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_13arcs(PyObject *__pyx_v_self, PyObject *__pyx_arg_state) {\n  __pyx_t_10basictypes_int64 __pyx_v_state;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"arcs (wrapper)\", 0);\n  assert(__pyx_arg_state); {\n    __pyx_v_state = __Pyx_PyInt_As_int64_t(__pyx_arg_state); if (unlikely((__pyx_v_state == ((int64_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 1426, __pyx_L3_error)\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst._Fst.arcs\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  __pyx_r = __pyx_pf_9pywrapfst_4_Fst_12arcs(((struct __pyx_obj_9pywrapfst__Fst *)__pyx_v_self), ((__pyx_t_10basictypes_int64)__pyx_v_state));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_4_Fst_12arcs(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self, __pyx_t_10basictypes_int64 __pyx_v_state) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"arcs\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst_4_Fst_arcs(__pyx_v_self, __pyx_v_state, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1426, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst._Fst.arcs\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1442\n *     return ArcIterator(self, state)\n * \n *   cpdef _Fst copy(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     copy(self)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_15copy(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic struct __pyx_obj_9pywrapfst__Fst *__pyx_f_9pywrapfst_4_Fst_copy(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self, int __pyx_skip_dispatch) {\n  struct __pyx_obj_9pywrapfst__Fst *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  __Pyx_RefNannySetupContext(\"copy\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_copy); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1442, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_4_Fst_15copy)) {\n      __Pyx_XDECREF(((PyObject *)__pyx_r));\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1442, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1442, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      if (!(likely(((__pyx_t_2) == Py_None) || likely(__Pyx_TypeTest(__pyx_t_2, __pyx_ptype_9pywrapfst__Fst))))) __PYX_ERR(0, 1442, __pyx_L1_error)\n      __pyx_r = ((struct __pyx_obj_9pywrapfst__Fst *)__pyx_t_2);\n      __pyx_t_2 = 0;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":1448\n *     Makes a copy of the FST.\n *     \"\"\"\n *     return _init_XFst(new fst.FstClass(deref(self._fst)))             # <<<<<<<<<<<<<<\n * \n *   cpdef void draw(self,\n */\n  __Pyx_XDECREF(((PyObject *)__pyx_r));\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 1448, __pyx_L1_error)\n  }\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst__init_XFst(new fst::script::FstClass((*__pyx_v_self->_fst)))); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1448, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = ((struct __pyx_obj_9pywrapfst__Fst *)__pyx_t_1);\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":1442\n *     return ArcIterator(self, state)\n * \n *   cpdef _Fst copy(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     copy(self)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_AddTraceback(\"pywrapfst._Fst.copy\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XGIVEREF((PyObject *)__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_15copy(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_4_Fst_14copy[] = \"\\n    copy(self)\\n\\n    Makes a copy of the FST.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_15copy(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"copy (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_4_Fst_14copy(((struct __pyx_obj_9pywrapfst__Fst *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_4_Fst_14copy(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"copy\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst_4_Fst_copy(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1442, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst._Fst.copy\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1450\n *     return _init_XFst(new fst.FstClass(deref(self._fst)))\n * \n *   cpdef void draw(self,             # <<<<<<<<<<<<<<\n *                   filename,\n *                   _SymbolTable isymbols=None,\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_17draw(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic void __pyx_f_9pywrapfst_4_Fst_draw(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self, PyObject *__pyx_v_filename, int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_4_Fst_draw *__pyx_optional_args) {\n\n  /* \"pywrapfst.pyx\":1452\n *   cpdef void draw(self,\n *                   filename,\n *                   _SymbolTable isymbols=None,             # <<<<<<<<<<<<<<\n *                   _SymbolTable osymbols=None,\n *                   SymbolTable ssymbols=None,\n */\n  struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_isymbols = ((struct __pyx_obj_9pywrapfst__SymbolTable *)Py_None);\n\n  /* \"pywrapfst.pyx\":1453\n *                   filename,\n *                   _SymbolTable isymbols=None,\n *                   _SymbolTable osymbols=None,             # <<<<<<<<<<<<<<\n *                   SymbolTable ssymbols=None,\n *                   bool acceptor=False,\n */\n  struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_osymbols = ((struct __pyx_obj_9pywrapfst__SymbolTable *)Py_None);\n\n  /* \"pywrapfst.pyx\":1454\n *                   _SymbolTable isymbols=None,\n *                   _SymbolTable osymbols=None,\n *                   SymbolTable ssymbols=None,             # <<<<<<<<<<<<<<\n *                   bool acceptor=False,\n *                   title=b\"\",\n */\n  struct __pyx_obj_9pywrapfst_SymbolTable *__pyx_v_ssymbols = ((struct __pyx_obj_9pywrapfst_SymbolTable *)Py_None);\n\n  /* \"pywrapfst.pyx\":1455\n *                   _SymbolTable osymbols=None,\n *                   SymbolTable ssymbols=None,\n *                   bool acceptor=False,             # <<<<<<<<<<<<<<\n *                   title=b\"\",\n *                   double width=8.5,\n */\n  bool __pyx_v_acceptor = ((bool)0);\n  PyObject *__pyx_v_title = ((PyObject *)__pyx_kp_b__24);\n  double __pyx_v_width = ((double)8.5);\n  double __pyx_v_height = ((double)11.0);\n\n  /* \"pywrapfst.pyx\":1459\n *                   double width=8.5,\n *                   double height=11,\n *                   bool portrait=False,             # <<<<<<<<<<<<<<\n *                   bool vertical=False,\n *                   double ranksep=0.4,\n */\n  bool __pyx_v_portrait = ((bool)0);\n\n  /* \"pywrapfst.pyx\":1460\n *                   double height=11,\n *                   bool portrait=False,\n *                   bool vertical=False,             # <<<<<<<<<<<<<<\n *                   double ranksep=0.4,\n *                   double nodesep=0.25,\n */\n  bool __pyx_v_vertical = ((bool)0);\n  double __pyx_v_ranksep = ((double)0.4);\n  double __pyx_v_nodesep = ((double)0.25);\n  __pyx_t_10basictypes_int32 __pyx_v_fontsize = ((__pyx_t_10basictypes_int32)14);\n  __pyx_t_10basictypes_int32 __pyx_v_precision = ((__pyx_t_10basictypes_int32)5);\n  PyObject *__pyx_v_float_format = ((PyObject *)__pyx_n_b_g);\n\n  /* \"pywrapfst.pyx\":1466\n *                   int32 precision=5,\n *                   float_format=b\"g\",\n *                   bool show_weight_one=False):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     draw(self, filename, isymbols=None, osymbols=None, ssymbols=None,\n */\n  bool __pyx_v_show_weight_one = ((bool)0);\n  std::string __pyx_v_filename_string;\n  std::unique_ptr<std::ofstream>  __pyx_v_ostrm;\n  fst::SymbolTable *__pyx_v_ssymbols_ptr;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  PyObject *__pyx_t_6 = NULL;\n  PyObject *__pyx_t_7 = NULL;\n  PyObject *__pyx_t_8 = NULL;\n  PyObject *__pyx_t_9 = NULL;\n  PyObject *__pyx_t_10 = NULL;\n  PyObject *__pyx_t_11 = NULL;\n  PyObject *__pyx_t_12 = NULL;\n  PyObject *__pyx_t_13 = NULL;\n  PyObject *__pyx_t_14 = NULL;\n  int __pyx_t_15;\n  PyObject *__pyx_t_16 = NULL;\n  std::string __pyx_t_17;\n  int __pyx_t_18;\n  int __pyx_t_19;\n  fst::SymbolTable *__pyx_t_20;\n  fst::SymbolTable const *__pyx_t_21;\n  fst::SymbolTable const *__pyx_t_22;\n  std::string __pyx_t_23;\n  __Pyx_RefNannySetupContext(\"draw\", 0);\n  if (__pyx_optional_args) {\n    if (__pyx_optional_args->__pyx_n > 0) {\n      __pyx_v_isymbols = __pyx_optional_args->isymbols;\n      if (__pyx_optional_args->__pyx_n > 1) {\n        __pyx_v_osymbols = __pyx_optional_args->osymbols;\n        if (__pyx_optional_args->__pyx_n > 2) {\n          __pyx_v_ssymbols = __pyx_optional_args->ssymbols;\n          if (__pyx_optional_args->__pyx_n > 3) {\n            __pyx_v_acceptor = __pyx_optional_args->acceptor;\n            if (__pyx_optional_args->__pyx_n > 4) {\n              __pyx_v_title = __pyx_optional_args->title;\n              if (__pyx_optional_args->__pyx_n > 5) {\n                __pyx_v_width = __pyx_optional_args->width;\n                if (__pyx_optional_args->__pyx_n > 6) {\n                  __pyx_v_height = __pyx_optional_args->height;\n                  if (__pyx_optional_args->__pyx_n > 7) {\n                    __pyx_v_portrait = __pyx_optional_args->portrait;\n                    if (__pyx_optional_args->__pyx_n > 8) {\n                      __pyx_v_vertical = __pyx_optional_args->vertical;\n                      if (__pyx_optional_args->__pyx_n > 9) {\n                        __pyx_v_ranksep = __pyx_optional_args->ranksep;\n                        if (__pyx_optional_args->__pyx_n > 10) {\n                          __pyx_v_nodesep = __pyx_optional_args->nodesep;\n                          if (__pyx_optional_args->__pyx_n > 11) {\n                            __pyx_v_fontsize = __pyx_optional_args->fontsize;\n                            if (__pyx_optional_args->__pyx_n > 12) {\n                              __pyx_v_precision = __pyx_optional_args->precision;\n                              if (__pyx_optional_args->__pyx_n > 13) {\n                                __pyx_v_float_format = __pyx_optional_args->float_format;\n                                if (__pyx_optional_args->__pyx_n > 14) {\n                                  __pyx_v_show_weight_one = __pyx_optional_args->show_weight_one;\n                                }\n                              }\n                            }\n                          }\n                        }\n                      }\n                    }\n                  }\n                }\n              }\n            }\n          }\n        }\n      }\n    }\n  }\n\n  /* \"pywrapfst.pyx\":1450\n *     return _init_XFst(new fst.FstClass(deref(self._fst)))\n * \n *   cpdef void draw(self,             # <<<<<<<<<<<<<<\n *                   filename,\n *                   _SymbolTable isymbols=None,\n */\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_draw); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1450, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_4_Fst_17draw)) {\n      __pyx_t_3 = __Pyx_PyBool_FromLong(__pyx_v_acceptor); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 1450, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_3);\n      __pyx_t_4 = PyFloat_FromDouble(__pyx_v_width); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 1450, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_4);\n      __pyx_t_5 = PyFloat_FromDouble(__pyx_v_height); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 1450, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_5);\n      __pyx_t_6 = __Pyx_PyBool_FromLong(__pyx_v_portrait); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 1450, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_6);\n      __pyx_t_7 = __Pyx_PyBool_FromLong(__pyx_v_vertical); if (unlikely(!__pyx_t_7)) __PYX_ERR(0, 1450, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_7);\n      __pyx_t_8 = PyFloat_FromDouble(__pyx_v_ranksep); if (unlikely(!__pyx_t_8)) __PYX_ERR(0, 1450, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_8);\n      __pyx_t_9 = PyFloat_FromDouble(__pyx_v_nodesep); if (unlikely(!__pyx_t_9)) __PYX_ERR(0, 1450, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_9);\n      __pyx_t_10 = __Pyx_PyInt_From_int32_t(__pyx_v_fontsize); if (unlikely(!__pyx_t_10)) __PYX_ERR(0, 1450, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_10);\n      __pyx_t_11 = __Pyx_PyInt_From_int32_t(__pyx_v_precision); if (unlikely(!__pyx_t_11)) __PYX_ERR(0, 1450, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_11);\n      __pyx_t_12 = __Pyx_PyBool_FromLong(__pyx_v_show_weight_one); if (unlikely(!__pyx_t_12)) __PYX_ERR(0, 1450, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_12);\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_13 = __pyx_t_1; __pyx_t_14 = NULL;\n      __pyx_t_15 = 0;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_13))) {\n        __pyx_t_14 = PyMethod_GET_SELF(__pyx_t_13);\n        if (likely(__pyx_t_14)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_13);\n          __Pyx_INCREF(__pyx_t_14);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_13, function);\n          __pyx_t_15 = 1;\n        }\n      }\n      #if CYTHON_FAST_PYCALL\n      if (PyFunction_Check(__pyx_t_13)) {\n        PyObject *__pyx_temp[17] = {__pyx_t_14, __pyx_v_filename, ((PyObject *)__pyx_v_isymbols), ((PyObject *)__pyx_v_osymbols), ((PyObject *)__pyx_v_ssymbols), __pyx_t_3, __pyx_v_title, __pyx_t_4, __pyx_t_5, __pyx_t_6, __pyx_t_7, __pyx_t_8, __pyx_t_9, __pyx_t_10, __pyx_t_11, __pyx_v_float_format, __pyx_t_12};\n        __pyx_t_2 = __Pyx_PyFunction_FastCall(__pyx_t_13, __pyx_temp+1-__pyx_t_15, 16+__pyx_t_15); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1450, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_14); __pyx_t_14 = 0;\n        __Pyx_GOTREF(__pyx_t_2);\n        __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n        __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n        __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n        __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0;\n        __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0;\n        __Pyx_DECREF(__pyx_t_9); __pyx_t_9 = 0;\n        __Pyx_DECREF(__pyx_t_10); __pyx_t_10 = 0;\n        __Pyx_DECREF(__pyx_t_11); __pyx_t_11 = 0;\n        __Pyx_DECREF(__pyx_t_12); __pyx_t_12 = 0;\n      } else\n      #endif\n      #if CYTHON_FAST_PYCCALL\n      if (__Pyx_PyFastCFunction_Check(__pyx_t_13)) {\n        PyObject *__pyx_temp[17] = {__pyx_t_14, __pyx_v_filename, ((PyObject *)__pyx_v_isymbols), ((PyObject *)__pyx_v_osymbols), ((PyObject *)__pyx_v_ssymbols), __pyx_t_3, __pyx_v_title, __pyx_t_4, __pyx_t_5, __pyx_t_6, __pyx_t_7, __pyx_t_8, __pyx_t_9, __pyx_t_10, __pyx_t_11, __pyx_v_float_format, __pyx_t_12};\n        __pyx_t_2 = __Pyx_PyCFunction_FastCall(__pyx_t_13, __pyx_temp+1-__pyx_t_15, 16+__pyx_t_15); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1450, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_14); __pyx_t_14 = 0;\n        __Pyx_GOTREF(__pyx_t_2);\n        __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n        __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n        __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n        __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0;\n        __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0;\n        __Pyx_DECREF(__pyx_t_9); __pyx_t_9 = 0;\n        __Pyx_DECREF(__pyx_t_10); __pyx_t_10 = 0;\n        __Pyx_DECREF(__pyx_t_11); __pyx_t_11 = 0;\n        __Pyx_DECREF(__pyx_t_12); __pyx_t_12 = 0;\n      } else\n      #endif\n      {\n        __pyx_t_16 = PyTuple_New(16+__pyx_t_15); if (unlikely(!__pyx_t_16)) __PYX_ERR(0, 1450, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_16);\n        if (__pyx_t_14) {\n          __Pyx_GIVEREF(__pyx_t_14); PyTuple_SET_ITEM(__pyx_t_16, 0, __pyx_t_14); __pyx_t_14 = NULL;\n        }\n        __Pyx_INCREF(__pyx_v_filename);\n        __Pyx_GIVEREF(__pyx_v_filename);\n        PyTuple_SET_ITEM(__pyx_t_16, 0+__pyx_t_15, __pyx_v_filename);\n        __Pyx_INCREF(((PyObject *)__pyx_v_isymbols));\n        __Pyx_GIVEREF(((PyObject *)__pyx_v_isymbols));\n        PyTuple_SET_ITEM(__pyx_t_16, 1+__pyx_t_15, ((PyObject *)__pyx_v_isymbols));\n        __Pyx_INCREF(((PyObject *)__pyx_v_osymbols));\n        __Pyx_GIVEREF(((PyObject *)__pyx_v_osymbols));\n        PyTuple_SET_ITEM(__pyx_t_16, 2+__pyx_t_15, ((PyObject *)__pyx_v_osymbols));\n        __Pyx_INCREF(((PyObject *)__pyx_v_ssymbols));\n        __Pyx_GIVEREF(((PyObject *)__pyx_v_ssymbols));\n        PyTuple_SET_ITEM(__pyx_t_16, 3+__pyx_t_15, ((PyObject *)__pyx_v_ssymbols));\n        __Pyx_GIVEREF(__pyx_t_3);\n        PyTuple_SET_ITEM(__pyx_t_16, 4+__pyx_t_15, __pyx_t_3);\n        __Pyx_INCREF(__pyx_v_title);\n        __Pyx_GIVEREF(__pyx_v_title);\n        PyTuple_SET_ITEM(__pyx_t_16, 5+__pyx_t_15, __pyx_v_title);\n        __Pyx_GIVEREF(__pyx_t_4);\n        PyTuple_SET_ITEM(__pyx_t_16, 6+__pyx_t_15, __pyx_t_4);\n        __Pyx_GIVEREF(__pyx_t_5);\n        PyTuple_SET_ITEM(__pyx_t_16, 7+__pyx_t_15, __pyx_t_5);\n        __Pyx_GIVEREF(__pyx_t_6);\n        PyTuple_SET_ITEM(__pyx_t_16, 8+__pyx_t_15, __pyx_t_6);\n        __Pyx_GIVEREF(__pyx_t_7);\n        PyTuple_SET_ITEM(__pyx_t_16, 9+__pyx_t_15, __pyx_t_7);\n        __Pyx_GIVEREF(__pyx_t_8);\n        PyTuple_SET_ITEM(__pyx_t_16, 10+__pyx_t_15, __pyx_t_8);\n        __Pyx_GIVEREF(__pyx_t_9);\n        PyTuple_SET_ITEM(__pyx_t_16, 11+__pyx_t_15, __pyx_t_9);\n        __Pyx_GIVEREF(__pyx_t_10);\n        PyTuple_SET_ITEM(__pyx_t_16, 12+__pyx_t_15, __pyx_t_10);\n        __Pyx_GIVEREF(__pyx_t_11);\n        PyTuple_SET_ITEM(__pyx_t_16, 13+__pyx_t_15, __pyx_t_11);\n        __Pyx_INCREF(__pyx_v_float_format);\n        __Pyx_GIVEREF(__pyx_v_float_format);\n        PyTuple_SET_ITEM(__pyx_t_16, 14+__pyx_t_15, __pyx_v_float_format);\n        __Pyx_GIVEREF(__pyx_t_12);\n        PyTuple_SET_ITEM(__pyx_t_16, 15+__pyx_t_15, __pyx_t_12);\n        __pyx_t_3 = 0;\n        __pyx_t_4 = 0;\n        __pyx_t_5 = 0;\n        __pyx_t_6 = 0;\n        __pyx_t_7 = 0;\n        __pyx_t_8 = 0;\n        __pyx_t_9 = 0;\n        __pyx_t_10 = 0;\n        __pyx_t_11 = 0;\n        __pyx_t_12 = 0;\n        __pyx_t_2 = __Pyx_PyObject_Call(__pyx_t_13, __pyx_t_16, NULL); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1450, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_2);\n        __Pyx_DECREF(__pyx_t_16); __pyx_t_16 = 0;\n      }\n      __Pyx_DECREF(__pyx_t_13); __pyx_t_13 = 0;\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":1500\n *     See also: `text`.\n *     \"\"\"\n *     cdef string filename_string = tostring(filename)             # <<<<<<<<<<<<<<\n *     cdef unique_ptr[ofstream] ostrm\n *     ostrm.reset(new ofstream(filename_string))\n */\n  __pyx_t_17 = __pyx_f_9pywrapfst_tostring(__pyx_v_filename, NULL); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 1500, __pyx_L1_error)\n  __pyx_v_filename_string = __pyx_t_17;\n\n  /* \"pywrapfst.pyx\":1502\n *     cdef string filename_string = tostring(filename)\n *     cdef unique_ptr[ofstream] ostrm\n *     ostrm.reset(new ofstream(filename_string))             # <<<<<<<<<<<<<<\n *     cdef fst.SymbolTable *ssymbols_ptr = NULL\n *     if ssymbols is not None:\n */\n  __pyx_v_ostrm.reset(new std::ofstream(__pyx_v_filename_string));\n\n  /* \"pywrapfst.pyx\":1503\n *     cdef unique_ptr[ofstream] ostrm\n *     ostrm.reset(new ofstream(filename_string))\n *     cdef fst.SymbolTable *ssymbols_ptr = NULL             # <<<<<<<<<<<<<<\n *     if ssymbols is not None:\n *       ssymbols_ptr = ssymbols._table\n */\n  __pyx_v_ssymbols_ptr = NULL;\n\n  /* \"pywrapfst.pyx\":1504\n *     ostrm.reset(new ofstream(filename_string))\n *     cdef fst.SymbolTable *ssymbols_ptr = NULL\n *     if ssymbols is not None:             # <<<<<<<<<<<<<<\n *       ssymbols_ptr = ssymbols._table\n *     fst.DrawFst(deref(self._fst),\n */\n  __pyx_t_18 = (((PyObject *)__pyx_v_ssymbols) != Py_None);\n  __pyx_t_19 = (__pyx_t_18 != 0);\n  if (__pyx_t_19) {\n\n    /* \"pywrapfst.pyx\":1505\n *     cdef fst.SymbolTable *ssymbols_ptr = NULL\n *     if ssymbols is not None:\n *       ssymbols_ptr = ssymbols._table             # <<<<<<<<<<<<<<\n *     fst.DrawFst(deref(self._fst),\n *         self._fst.get().InputSymbols() if isymbols is None\n */\n    if (unlikely(((PyObject *)__pyx_v_ssymbols) == Py_None)) {\n      PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_table\");\n      __PYX_ERR(0, 1505, __pyx_L1_error)\n    }\n    __pyx_t_20 = __pyx_v_ssymbols->__pyx_base.__pyx_base._table;\n    __pyx_v_ssymbols_ptr = __pyx_t_20;\n\n    /* \"pywrapfst.pyx\":1504\n *     ostrm.reset(new ofstream(filename_string))\n *     cdef fst.SymbolTable *ssymbols_ptr = NULL\n *     if ssymbols is not None:             # <<<<<<<<<<<<<<\n *       ssymbols_ptr = ssymbols._table\n *     fst.DrawFst(deref(self._fst),\n */\n  }\n\n  /* \"pywrapfst.pyx\":1506\n *     if ssymbols is not None:\n *       ssymbols_ptr = ssymbols._table\n *     fst.DrawFst(deref(self._fst),             # <<<<<<<<<<<<<<\n *         self._fst.get().InputSymbols() if isymbols is None\n *         else isymbols._table,\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 1506, __pyx_L1_error)\n  }\n\n  /* \"pywrapfst.pyx\":1507\n *       ssymbols_ptr = ssymbols._table\n *     fst.DrawFst(deref(self._fst),\n *         self._fst.get().InputSymbols() if isymbols is None             # <<<<<<<<<<<<<<\n *         else isymbols._table,\n *         self._fst.get().OutputSymbols() if osymbols is None\n */\n  __pyx_t_19 = (((PyObject *)__pyx_v_isymbols) == Py_None);\n  if ((__pyx_t_19 != 0)) {\n    if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n      PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n      __PYX_ERR(0, 1507, __pyx_L1_error)\n    }\n    __pyx_t_21 = __pyx_v_self->_fst.get()->InputSymbols();\n  } else {\n\n    /* \"pywrapfst.pyx\":1508\n *     fst.DrawFst(deref(self._fst),\n *         self._fst.get().InputSymbols() if isymbols is None\n *         else isymbols._table,             # <<<<<<<<<<<<<<\n *         self._fst.get().OutputSymbols() if osymbols is None\n *         else osymbols._table,\n */\n    if (unlikely(((PyObject *)__pyx_v_isymbols) == Py_None)) {\n      PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_table\");\n      __PYX_ERR(0, 1508, __pyx_L1_error)\n    }\n    __pyx_t_21 = __pyx_v_isymbols->_table;\n  }\n\n  /* \"pywrapfst.pyx\":1509\n *         self._fst.get().InputSymbols() if isymbols is None\n *         else isymbols._table,\n *         self._fst.get().OutputSymbols() if osymbols is None             # <<<<<<<<<<<<<<\n *         else osymbols._table,\n *         ssymbols_ptr, acceptor, tostring(title), width, height, portrait,\n */\n  __pyx_t_19 = (((PyObject *)__pyx_v_osymbols) == Py_None);\n  if ((__pyx_t_19 != 0)) {\n    if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n      PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n      __PYX_ERR(0, 1509, __pyx_L1_error)\n    }\n    __pyx_t_22 = __pyx_v_self->_fst.get()->OutputSymbols();\n  } else {\n\n    /* \"pywrapfst.pyx\":1510\n *         else isymbols._table,\n *         self._fst.get().OutputSymbols() if osymbols is None\n *         else osymbols._table,             # <<<<<<<<<<<<<<\n *         ssymbols_ptr, acceptor, tostring(title), width, height, portrait,\n *         vertical, ranksep, nodesep, fontsize, precision,\n */\n    if (unlikely(((PyObject *)__pyx_v_osymbols) == Py_None)) {\n      PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_table\");\n      __PYX_ERR(0, 1510, __pyx_L1_error)\n    }\n    __pyx_t_22 = __pyx_v_osymbols->_table;\n  }\n\n  /* \"pywrapfst.pyx\":1511\n *         self._fst.get().OutputSymbols() if osymbols is None\n *         else osymbols._table,\n *         ssymbols_ptr, acceptor, tostring(title), width, height, portrait,             # <<<<<<<<<<<<<<\n *         vertical, ranksep, nodesep, fontsize, precision,\n *         tostring(float_format), show_weight_one, ostrm.get(),\n */\n  __pyx_t_17 = __pyx_f_9pywrapfst_tostring(__pyx_v_title, NULL); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 1511, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":1513\n *         ssymbols_ptr, acceptor, tostring(title), width, height, portrait,\n *         vertical, ranksep, nodesep, fontsize, precision,\n *         tostring(float_format), show_weight_one, ostrm.get(),             # <<<<<<<<<<<<<<\n *         filename_string)\n * \n */\n  __pyx_t_23 = __pyx_f_9pywrapfst_tostring(__pyx_v_float_format, NULL); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 1513, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":1506\n *     if ssymbols is not None:\n *       ssymbols_ptr = ssymbols._table\n *     fst.DrawFst(deref(self._fst),             # <<<<<<<<<<<<<<\n *         self._fst.get().InputSymbols() if isymbols is None\n *         else isymbols._table,\n */\n  fst::script::DrawFst((*__pyx_v_self->_fst), __pyx_t_21, __pyx_t_22, __pyx_v_ssymbols_ptr, __pyx_v_acceptor, __pyx_t_17, __pyx_v_width, __pyx_v_height, __pyx_v_portrait, __pyx_v_vertical, __pyx_v_ranksep, __pyx_v_nodesep, __pyx_v_fontsize, __pyx_v_precision, __pyx_t_23, __pyx_v_show_weight_one, __pyx_v_ostrm.get(), __pyx_v_filename_string);\n\n  /* \"pywrapfst.pyx\":1450\n *     return _init_XFst(new fst.FstClass(deref(self._fst)))\n * \n *   cpdef void draw(self,             # <<<<<<<<<<<<<<\n *                   filename,\n *                   _SymbolTable isymbols=None,\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_XDECREF(__pyx_t_6);\n  __Pyx_XDECREF(__pyx_t_7);\n  __Pyx_XDECREF(__pyx_t_8);\n  __Pyx_XDECREF(__pyx_t_9);\n  __Pyx_XDECREF(__pyx_t_10);\n  __Pyx_XDECREF(__pyx_t_11);\n  __Pyx_XDECREF(__pyx_t_12);\n  __Pyx_XDECREF(__pyx_t_13);\n  __Pyx_XDECREF(__pyx_t_14);\n  __Pyx_XDECREF(__pyx_t_16);\n  __Pyx_WriteUnraisable(\"pywrapfst._Fst.draw\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_17draw(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic char __pyx_doc_9pywrapfst_4_Fst_16draw[] = \"\\n    draw(self, filename, isymbols=None, osymbols=None, ssymbols=None,\\n         acceptor=False, title=\\\"\\\", width=8.5, height=11, portrait=False,\\n         vertical=False, ranksep=0.4, nodesep=0.25, fontsize=14,\\n         precision=5, float_format=\\\"g\\\", show_weight_one=False):\\n\\n    Writes out the FST in Graphviz text format.\\n\\n    This method writes out the FST in the dot graph description language. The\\n    graph can be rendered using the `dot` executable provided by Graphviz.\\n\\n    Args:\\n      filename: The string location of the output dot/Graphviz file.\\n      isymbols: An optional symbol table used to label input symbols.\\n      osymbols: An optional symbol table used to label output symbols.\\n      ssymbols: An optional symbol table used to label states.\\n      acceptor: Should the figure be rendered in acceptor format if possible?\\n      title: An optional string indicating the figure title.\\n      width: The figure width, in inches.\\n      height: The figure height, in inches.\\n      portrait: Should the figure be rendered in portrait rather than\\n          landscape?\\n      vertical: Should the figure be rendered bottom-to-top rather than\\n          left-to-right?\\n      ranksep: The minimum separation separation between ranks, in inches.\\n      nodesep: The minimum separation between nodes, in inches.\\n      fontsize: Font size, in points.\\n      precision: Numeric precision for floats, in number of chars.\\n      float_format: One of: 'e', 'f' or 'g'.\\n      show_weight_one: Should weights equivalent to semiring One be printed?\\n\\n    See also: `text`.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_17draw(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  PyObject *__pyx_v_filename = 0;\n  struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_isymbols = 0;\n  struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_osymbols = 0;\n  struct __pyx_obj_9pywrapfst_SymbolTable *__pyx_v_ssymbols = 0;\n  bool __pyx_v_acceptor;\n  PyObject *__pyx_v_title = 0;\n  double __pyx_v_width;\n  double __pyx_v_height;\n  bool __pyx_v_portrait;\n  bool __pyx_v_vertical;\n  double __pyx_v_ranksep;\n  double __pyx_v_nodesep;\n  __pyx_t_10basictypes_int32 __pyx_v_fontsize;\n  __pyx_t_10basictypes_int32 __pyx_v_precision;\n  PyObject *__pyx_v_float_format = 0;\n  bool __pyx_v_show_weight_one;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"draw (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_filename,&__pyx_n_s_isymbols,&__pyx_n_s_osymbols,&__pyx_n_s_ssymbols,&__pyx_n_s_acceptor,&__pyx_n_s_title,&__pyx_n_s_width,&__pyx_n_s_height,&__pyx_n_s_portrait,&__pyx_n_s_vertical,&__pyx_n_s_ranksep,&__pyx_n_s_nodesep,&__pyx_n_s_fontsize,&__pyx_n_s_precision,&__pyx_n_s_float_format,&__pyx_n_s_show_weight_one,0};\n    PyObject* values[16] = {0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0};\n\n    /* \"pywrapfst.pyx\":1452\n *   cpdef void draw(self,\n *                   filename,\n *                   _SymbolTable isymbols=None,             # <<<<<<<<<<<<<<\n *                   _SymbolTable osymbols=None,\n *                   SymbolTable ssymbols=None,\n */\n    values[1] = (PyObject *)((struct __pyx_obj_9pywrapfst__SymbolTable *)Py_None);\n\n    /* \"pywrapfst.pyx\":1453\n *                   filename,\n *                   _SymbolTable isymbols=None,\n *                   _SymbolTable osymbols=None,             # <<<<<<<<<<<<<<\n *                   SymbolTable ssymbols=None,\n *                   bool acceptor=False,\n */\n    values[2] = (PyObject *)((struct __pyx_obj_9pywrapfst__SymbolTable *)Py_None);\n\n    /* \"pywrapfst.pyx\":1454\n *                   _SymbolTable isymbols=None,\n *                   _SymbolTable osymbols=None,\n *                   SymbolTable ssymbols=None,             # <<<<<<<<<<<<<<\n *                   bool acceptor=False,\n *                   title=b\"\",\n */\n    values[3] = (PyObject *)((struct __pyx_obj_9pywrapfst_SymbolTable *)Py_None);\n    values[5] = ((PyObject *)__pyx_kp_b__24);\n    values[14] = ((PyObject *)__pyx_n_b_g);\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case 16: values[15] = PyTuple_GET_ITEM(__pyx_args, 15);\n        CYTHON_FALLTHROUGH;\n        case 15: values[14] = PyTuple_GET_ITEM(__pyx_args, 14);\n        CYTHON_FALLTHROUGH;\n        case 14: values[13] = PyTuple_GET_ITEM(__pyx_args, 13);\n        CYTHON_FALLTHROUGH;\n        case 13: values[12] = PyTuple_GET_ITEM(__pyx_args, 12);\n        CYTHON_FALLTHROUGH;\n        case 12: values[11] = PyTuple_GET_ITEM(__pyx_args, 11);\n        CYTHON_FALLTHROUGH;\n        case 11: values[10] = PyTuple_GET_ITEM(__pyx_args, 10);\n        CYTHON_FALLTHROUGH;\n        case 10: values[9] = PyTuple_GET_ITEM(__pyx_args, 9);\n        CYTHON_FALLTHROUGH;\n        case  9: values[8] = PyTuple_GET_ITEM(__pyx_args, 8);\n        CYTHON_FALLTHROUGH;\n        case  8: values[7] = PyTuple_GET_ITEM(__pyx_args, 7);\n        CYTHON_FALLTHROUGH;\n        case  7: values[6] = PyTuple_GET_ITEM(__pyx_args, 6);\n        CYTHON_FALLTHROUGH;\n        case  6: values[5] = PyTuple_GET_ITEM(__pyx_args, 5);\n        CYTHON_FALLTHROUGH;\n        case  5: values[4] = PyTuple_GET_ITEM(__pyx_args, 4);\n        CYTHON_FALLTHROUGH;\n        case  4: values[3] = PyTuple_GET_ITEM(__pyx_args, 3);\n        CYTHON_FALLTHROUGH;\n        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);\n        CYTHON_FALLTHROUGH;\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (likely((values[0] = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_filename)) != 0)) kw_args--;\n        else goto __pyx_L5_argtuple_error;\n        CYTHON_FALLTHROUGH;\n        case  1:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_isymbols);\n          if (value) { values[1] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  2:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_osymbols);\n          if (value) { values[2] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  3:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_ssymbols);\n          if (value) { values[3] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  4:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_acceptor);\n          if (value) { values[4] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  5:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_title);\n          if (value) { values[5] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  6:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_width);\n          if (value) { values[6] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  7:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_height);\n          if (value) { values[7] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  8:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_portrait);\n          if (value) { values[8] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  9:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_vertical);\n          if (value) { values[9] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case 10:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_ranksep);\n          if (value) { values[10] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case 11:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_nodesep);\n          if (value) { values[11] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case 12:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_fontsize);\n          if (value) { values[12] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case 13:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_precision);\n          if (value) { values[13] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case 14:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_float_format);\n          if (value) { values[14] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case 15:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_show_weight_one);\n          if (value) { values[15] = value; kw_args--; }\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"draw\") < 0)) __PYX_ERR(0, 1450, __pyx_L3_error)\n      }\n    } else {\n      switch (PyTuple_GET_SIZE(__pyx_args)) {\n        case 16: values[15] = PyTuple_GET_ITEM(__pyx_args, 15);\n        CYTHON_FALLTHROUGH;\n        case 15: values[14] = PyTuple_GET_ITEM(__pyx_args, 14);\n        CYTHON_FALLTHROUGH;\n        case 14: values[13] = PyTuple_GET_ITEM(__pyx_args, 13);\n        CYTHON_FALLTHROUGH;\n        case 13: values[12] = PyTuple_GET_ITEM(__pyx_args, 12);\n        CYTHON_FALLTHROUGH;\n        case 12: values[11] = PyTuple_GET_ITEM(__pyx_args, 11);\n        CYTHON_FALLTHROUGH;\n        case 11: values[10] = PyTuple_GET_ITEM(__pyx_args, 10);\n        CYTHON_FALLTHROUGH;\n        case 10: values[9] = PyTuple_GET_ITEM(__pyx_args, 9);\n        CYTHON_FALLTHROUGH;\n        case  9: values[8] = PyTuple_GET_ITEM(__pyx_args, 8);\n        CYTHON_FALLTHROUGH;\n        case  8: values[7] = PyTuple_GET_ITEM(__pyx_args, 7);\n        CYTHON_FALLTHROUGH;\n        case  7: values[6] = PyTuple_GET_ITEM(__pyx_args, 6);\n        CYTHON_FALLTHROUGH;\n        case  6: values[5] = PyTuple_GET_ITEM(__pyx_args, 5);\n        CYTHON_FALLTHROUGH;\n        case  5: values[4] = PyTuple_GET_ITEM(__pyx_args, 4);\n        CYTHON_FALLTHROUGH;\n        case  4: values[3] = PyTuple_GET_ITEM(__pyx_args, 3);\n        CYTHON_FALLTHROUGH;\n        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);\n        CYTHON_FALLTHROUGH;\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n    }\n    __pyx_v_filename = values[0];\n    __pyx_v_isymbols = ((struct __pyx_obj_9pywrapfst__SymbolTable *)values[1]);\n    __pyx_v_osymbols = ((struct __pyx_obj_9pywrapfst__SymbolTable *)values[2]);\n    __pyx_v_ssymbols = ((struct __pyx_obj_9pywrapfst_SymbolTable *)values[3]);\n    if (values[4]) {\n      __pyx_v_acceptor = __Pyx_PyObject_IsTrue(values[4]); if (unlikely((__pyx_v_acceptor == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 1455, __pyx_L3_error)\n    } else {\n\n      /* \"pywrapfst.pyx\":1455\n *                   _SymbolTable osymbols=None,\n *                   SymbolTable ssymbols=None,\n *                   bool acceptor=False,             # <<<<<<<<<<<<<<\n *                   title=b\"\",\n *                   double width=8.5,\n */\n      __pyx_v_acceptor = ((bool)0);\n    }\n    __pyx_v_title = values[5];\n    if (values[6]) {\n      __pyx_v_width = __pyx_PyFloat_AsDouble(values[6]); if (unlikely((__pyx_v_width == (double)-1) && PyErr_Occurred())) __PYX_ERR(0, 1457, __pyx_L3_error)\n    } else {\n      __pyx_v_width = ((double)8.5);\n    }\n    if (values[7]) {\n      __pyx_v_height = __pyx_PyFloat_AsDouble(values[7]); if (unlikely((__pyx_v_height == (double)-1) && PyErr_Occurred())) __PYX_ERR(0, 1458, __pyx_L3_error)\n    } else {\n      __pyx_v_height = ((double)11.0);\n    }\n    if (values[8]) {\n      __pyx_v_portrait = __Pyx_PyObject_IsTrue(values[8]); if (unlikely((__pyx_v_portrait == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 1459, __pyx_L3_error)\n    } else {\n\n      /* \"pywrapfst.pyx\":1459\n *                   double width=8.5,\n *                   double height=11,\n *                   bool portrait=False,             # <<<<<<<<<<<<<<\n *                   bool vertical=False,\n *                   double ranksep=0.4,\n */\n      __pyx_v_portrait = ((bool)0);\n    }\n    if (values[9]) {\n      __pyx_v_vertical = __Pyx_PyObject_IsTrue(values[9]); if (unlikely((__pyx_v_vertical == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 1460, __pyx_L3_error)\n    } else {\n\n      /* \"pywrapfst.pyx\":1460\n *                   double height=11,\n *                   bool portrait=False,\n *                   bool vertical=False,             # <<<<<<<<<<<<<<\n *                   double ranksep=0.4,\n *                   double nodesep=0.25,\n */\n      __pyx_v_vertical = ((bool)0);\n    }\n    if (values[10]) {\n      __pyx_v_ranksep = __pyx_PyFloat_AsDouble(values[10]); if (unlikely((__pyx_v_ranksep == (double)-1) && PyErr_Occurred())) __PYX_ERR(0, 1461, __pyx_L3_error)\n    } else {\n      __pyx_v_ranksep = ((double)0.4);\n    }\n    if (values[11]) {\n      __pyx_v_nodesep = __pyx_PyFloat_AsDouble(values[11]); if (unlikely((__pyx_v_nodesep == (double)-1) && PyErr_Occurred())) __PYX_ERR(0, 1462, __pyx_L3_error)\n    } else {\n      __pyx_v_nodesep = ((double)0.25);\n    }\n    if (values[12]) {\n      __pyx_v_fontsize = __Pyx_PyInt_As_int32_t(values[12]); if (unlikely((__pyx_v_fontsize == ((int32_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 1463, __pyx_L3_error)\n    } else {\n      __pyx_v_fontsize = ((__pyx_t_10basictypes_int32)14);\n    }\n    if (values[13]) {\n      __pyx_v_precision = __Pyx_PyInt_As_int32_t(values[13]); if (unlikely((__pyx_v_precision == ((int32_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 1464, __pyx_L3_error)\n    } else {\n      __pyx_v_precision = ((__pyx_t_10basictypes_int32)5);\n    }\n    __pyx_v_float_format = values[14];\n    if (values[15]) {\n      __pyx_v_show_weight_one = __Pyx_PyObject_IsTrue(values[15]); if (unlikely((__pyx_v_show_weight_one == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 1466, __pyx_L3_error)\n    } else {\n\n      /* \"pywrapfst.pyx\":1466\n *                   int32 precision=5,\n *                   float_format=b\"g\",\n *                   bool show_weight_one=False):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     draw(self, filename, isymbols=None, osymbols=None, ssymbols=None,\n */\n      __pyx_v_show_weight_one = ((bool)0);\n    }\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"draw\", 0, 1, 16, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 1450, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst._Fst.draw\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_isymbols), __pyx_ptype_9pywrapfst__SymbolTable, 1, \"isymbols\", 0))) __PYX_ERR(0, 1452, __pyx_L1_error)\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_osymbols), __pyx_ptype_9pywrapfst__SymbolTable, 1, \"osymbols\", 0))) __PYX_ERR(0, 1453, __pyx_L1_error)\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_ssymbols), __pyx_ptype_9pywrapfst_SymbolTable, 1, \"ssymbols\", 0))) __PYX_ERR(0, 1454, __pyx_L1_error)\n  __pyx_r = __pyx_pf_9pywrapfst_4_Fst_16draw(((struct __pyx_obj_9pywrapfst__Fst *)__pyx_v_self), __pyx_v_filename, __pyx_v_isymbols, __pyx_v_osymbols, __pyx_v_ssymbols, __pyx_v_acceptor, __pyx_v_title, __pyx_v_width, __pyx_v_height, __pyx_v_portrait, __pyx_v_vertical, __pyx_v_ranksep, __pyx_v_nodesep, __pyx_v_fontsize, __pyx_v_precision, __pyx_v_float_format, __pyx_v_show_weight_one);\n\n  /* \"pywrapfst.pyx\":1450\n *     return _init_XFst(new fst.FstClass(deref(self._fst)))\n * \n *   cpdef void draw(self,             # <<<<<<<<<<<<<<\n *                   filename,\n *                   _SymbolTable isymbols=None,\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_4_Fst_16draw(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self, PyObject *__pyx_v_filename, struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_isymbols, struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_osymbols, struct __pyx_obj_9pywrapfst_SymbolTable *__pyx_v_ssymbols, bool __pyx_v_acceptor, PyObject *__pyx_v_title, double __pyx_v_width, double __pyx_v_height, bool __pyx_v_portrait, bool __pyx_v_vertical, double __pyx_v_ranksep, double __pyx_v_nodesep, __pyx_t_10basictypes_int32 __pyx_v_fontsize, __pyx_t_10basictypes_int32 __pyx_v_precision, PyObject *__pyx_v_float_format, bool __pyx_v_show_weight_one) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  struct __pyx_opt_args_9pywrapfst_4_Fst_draw __pyx_t_1;\n  PyObject *__pyx_t_2 = NULL;\n  __Pyx_RefNannySetupContext(\"draw\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1.__pyx_n = 15;\n  __pyx_t_1.isymbols = __pyx_v_isymbols;\n  __pyx_t_1.osymbols = __pyx_v_osymbols;\n  __pyx_t_1.ssymbols = __pyx_v_ssymbols;\n  __pyx_t_1.acceptor = __pyx_v_acceptor;\n  __pyx_t_1.title = __pyx_v_title;\n  __pyx_t_1.width = __pyx_v_width;\n  __pyx_t_1.height = __pyx_v_height;\n  __pyx_t_1.portrait = __pyx_v_portrait;\n  __pyx_t_1.vertical = __pyx_v_vertical;\n  __pyx_t_1.ranksep = __pyx_v_ranksep;\n  __pyx_t_1.nodesep = __pyx_v_nodesep;\n  __pyx_t_1.fontsize = __pyx_v_fontsize;\n  __pyx_t_1.precision = __pyx_v_precision;\n  __pyx_t_1.float_format = __pyx_v_float_format;\n  __pyx_t_1.show_weight_one = __pyx_v_show_weight_one;\n  __pyx_vtabptr_9pywrapfst__Fst->draw(__pyx_v_self, __pyx_v_filename, 1, &__pyx_t_1); \n  __pyx_t_2 = __Pyx_void_to_None(NULL); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1450, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  __pyx_r = __pyx_t_2;\n  __pyx_t_2 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_AddTraceback(\"pywrapfst._Fst.draw\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1516\n *         filename_string)\n * \n *   cpdef Weight final(self, int64 state):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     final(self, state)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_19final(PyObject *__pyx_v_self, PyObject *__pyx_arg_state); /*proto*/\nstatic struct __pyx_obj_9pywrapfst_Weight *__pyx_f_9pywrapfst_4_Fst_final(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self, __pyx_t_10basictypes_int64 __pyx_v_state, int __pyx_skip_dispatch) {\n  struct __pyx_obj_9pywrapfst_Weight *__pyx_v_weight = 0;\n  struct __pyx_obj_9pywrapfst_Weight *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  PyObject *__pyx_t_6 = NULL;\n  __Pyx_RefNannySetupContext(\"final\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_final); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1516, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_4_Fst_19final)) {\n      __Pyx_XDECREF(((PyObject *)__pyx_r));\n      __pyx_t_3 = __Pyx_PyInt_From_int64_t(__pyx_v_state); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 1516, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_3);\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_4 = __pyx_t_1; __pyx_t_5 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_4))) {\n        __pyx_t_5 = PyMethod_GET_SELF(__pyx_t_4);\n        if (likely(__pyx_t_5)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_4);\n          __Pyx_INCREF(__pyx_t_5);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_4, function);\n        }\n      }\n      if (!__pyx_t_5) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_4, __pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1516, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n        __Pyx_GOTREF(__pyx_t_2);\n      } else {\n        #if CYTHON_FAST_PYCALL\n        if (PyFunction_Check(__pyx_t_4)) {\n          PyObject *__pyx_temp[2] = {__pyx_t_5, __pyx_t_3};\n          __pyx_t_2 = __Pyx_PyFunction_FastCall(__pyx_t_4, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1516, __pyx_L1_error)\n          __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;\n          __Pyx_GOTREF(__pyx_t_2);\n          __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n        } else\n        #endif\n        #if CYTHON_FAST_PYCCALL\n        if (__Pyx_PyFastCFunction_Check(__pyx_t_4)) {\n          PyObject *__pyx_temp[2] = {__pyx_t_5, __pyx_t_3};\n          __pyx_t_2 = __Pyx_PyCFunction_FastCall(__pyx_t_4, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1516, __pyx_L1_error)\n          __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;\n          __Pyx_GOTREF(__pyx_t_2);\n          __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n        } else\n        #endif\n        {\n          __pyx_t_6 = PyTuple_New(1+1); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 1516, __pyx_L1_error)\n          __Pyx_GOTREF(__pyx_t_6);\n          __Pyx_GIVEREF(__pyx_t_5); PyTuple_SET_ITEM(__pyx_t_6, 0, __pyx_t_5); __pyx_t_5 = NULL;\n          __Pyx_GIVEREF(__pyx_t_3);\n          PyTuple_SET_ITEM(__pyx_t_6, 0+1, __pyx_t_3);\n          __pyx_t_3 = 0;\n          __pyx_t_2 = __Pyx_PyObject_Call(__pyx_t_4, __pyx_t_6, NULL); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1516, __pyx_L1_error)\n          __Pyx_GOTREF(__pyx_t_2);\n          __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n        }\n      }\n      __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      if (!(likely(((__pyx_t_2) == Py_None) || likely(__Pyx_TypeTest(__pyx_t_2, __pyx_ptype_9pywrapfst_Weight))))) __PYX_ERR(0, 1516, __pyx_L1_error)\n      __pyx_r = ((struct __pyx_obj_9pywrapfst_Weight *)__pyx_t_2);\n      __pyx_t_2 = 0;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":1531\n *       FstIndexError: State index out of range.\n *     \"\"\"\n *     cdef Weight weight = Weight.__new__(Weight)             # <<<<<<<<<<<<<<\n *     weight._weight.reset(new fst.WeightClass(self._fst.get().Final(state)))\n *     return weight\n */\n  __pyx_t_1 = ((PyObject *)__pyx_tp_new_9pywrapfst_Weight(((PyTypeObject *)__pyx_ptype_9pywrapfst_Weight), __pyx_empty_tuple, NULL)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1531, __pyx_L1_error)\n  __Pyx_GOTREF(((PyObject *)__pyx_t_1));\n  __pyx_v_weight = ((struct __pyx_obj_9pywrapfst_Weight *)__pyx_t_1);\n  __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":1532\n *     \"\"\"\n *     cdef Weight weight = Weight.__new__(Weight)\n *     weight._weight.reset(new fst.WeightClass(self._fst.get().Final(state)))             # <<<<<<<<<<<<<<\n *     return weight\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_weight) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_weight\");\n    __PYX_ERR(0, 1532, __pyx_L1_error)\n  }\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 1532, __pyx_L1_error)\n  }\n  __pyx_v_weight->_weight.reset(new fst::script::WeightClass(__pyx_v_self->_fst.get()->Final(__pyx_v_state)));\n\n  /* \"pywrapfst.pyx\":1533\n *     cdef Weight weight = Weight.__new__(Weight)\n *     weight._weight.reset(new fst.WeightClass(self._fst.get().Final(state)))\n *     return weight             # <<<<<<<<<<<<<<\n * \n *   cpdef string fst_type(self):\n */\n  __Pyx_XDECREF(((PyObject *)__pyx_r));\n  __Pyx_INCREF(((PyObject *)__pyx_v_weight));\n  __pyx_r = __pyx_v_weight;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":1516\n *         filename_string)\n * \n *   cpdef Weight final(self, int64 state):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     final(self, state)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_XDECREF(__pyx_t_6);\n  __Pyx_AddTraceback(\"pywrapfst._Fst.final\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XDECREF((PyObject *)__pyx_v_weight);\n  __Pyx_XGIVEREF((PyObject *)__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_19final(PyObject *__pyx_v_self, PyObject *__pyx_arg_state); /*proto*/\nstatic char __pyx_doc_9pywrapfst_4_Fst_18final[] = \"\\n    final(self, state)\\n\\n    Returns the final weight of a state.\\n\\n    Args:\\n      state: The integer index of a state.\\n\\n    Returns:\\n      The final Weight of that state.\\n\\n    Raises:\\n      FstIndexError: State index out of range.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_19final(PyObject *__pyx_v_self, PyObject *__pyx_arg_state) {\n  __pyx_t_10basictypes_int64 __pyx_v_state;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"final (wrapper)\", 0);\n  assert(__pyx_arg_state); {\n    __pyx_v_state = __Pyx_PyInt_As_int64_t(__pyx_arg_state); if (unlikely((__pyx_v_state == ((int64_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 1516, __pyx_L3_error)\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst._Fst.final\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  __pyx_r = __pyx_pf_9pywrapfst_4_Fst_18final(((struct __pyx_obj_9pywrapfst__Fst *)__pyx_v_self), ((__pyx_t_10basictypes_int64)__pyx_v_state));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_4_Fst_18final(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self, __pyx_t_10basictypes_int64 __pyx_v_state) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"final\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst_4_Fst_final(__pyx_v_self, __pyx_v_state, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1516, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst._Fst.final\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1535\n *     return weight\n * \n *   cpdef string fst_type(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     fst_type(self)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_21fst_type(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic std::string __pyx_f_9pywrapfst_4_Fst_fst_type(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self, int __pyx_skip_dispatch) {\n  std::string __pyx_r;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  std::string __pyx_t_5;\n  __Pyx_RefNannySetupContext(\"fst_type\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_fst_type); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1535, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_4_Fst_21fst_type)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1535, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1535, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __pyx_t_5 = __pyx_convert_string_from_py_std__in_string(__pyx_t_2); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 1535, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __pyx_r = __pyx_t_5;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":1541\n *     Returns a string indicating the FST type.\n *     \"\"\"\n *     return self._fst.get().FstType()             # <<<<<<<<<<<<<<\n * \n *   cpdef _FstSymbolTable input_symbols(self):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 1541, __pyx_L1_error)\n  }\n  __pyx_r = __pyx_v_self->_fst.get()->FstType();\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":1535\n *     return weight\n * \n *   cpdef string fst_type(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     fst_type(self)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_WriteUnraisable(\"pywrapfst._Fst.fst_type\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __Pyx_pretend_to_initialize(&__pyx_r);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_21fst_type(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_4_Fst_20fst_type[] = \"\\n    fst_type(self)\\n\\n    Returns a string indicating the FST type.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_21fst_type(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"fst_type (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_4_Fst_20fst_type(((struct __pyx_obj_9pywrapfst__Fst *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_4_Fst_20fst_type(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"fst_type\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __pyx_convert_PyBytes_string_to_py_std__in_string(__pyx_f_9pywrapfst_4_Fst_fst_type(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1535, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst._Fst.fst_type\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1543\n *     return self._fst.get().FstType()\n * \n *   cpdef _FstSymbolTable input_symbols(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     input_symbols(self)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_23input_symbols(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic struct __pyx_obj_9pywrapfst__FstSymbolTable *__pyx_f_9pywrapfst_4_Fst_input_symbols(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self, int __pyx_skip_dispatch) {\n  fst::SymbolTable *__pyx_v_syms;\n  struct __pyx_obj_9pywrapfst__FstSymbolTable *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  int __pyx_t_5;\n  __Pyx_RefNannySetupContext(\"input_symbols\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_input_symbols); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1543, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_4_Fst_23input_symbols)) {\n      __Pyx_XDECREF(((PyObject *)__pyx_r));\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1543, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1543, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      if (!(likely(((__pyx_t_2) == Py_None) || likely(__Pyx_TypeTest(__pyx_t_2, __pyx_ptype_9pywrapfst__FstSymbolTable))))) __PYX_ERR(0, 1543, __pyx_L1_error)\n      __pyx_r = ((struct __pyx_obj_9pywrapfst__FstSymbolTable *)__pyx_t_2);\n      __pyx_t_2 = 0;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":1552\n *     \"\"\"\n *     cdef fst.SymbolTable *syms = const_cast[SymbolTable_ptr](\n *       self._fst.get().InputSymbols())             # <<<<<<<<<<<<<<\n *     if syms == NULL:\n *       return\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 1552, __pyx_L1_error)\n  }\n\n  /* \"pywrapfst.pyx\":1551\n *     See also: `input_symbols`.\n *     \"\"\"\n *     cdef fst.SymbolTable *syms = const_cast[SymbolTable_ptr](             # <<<<<<<<<<<<<<\n *       self._fst.get().InputSymbols())\n *     if syms == NULL:\n */\n  __pyx_v_syms = const_cast<__pyx_t_9pywrapfst_SymbolTable_ptr>(__pyx_v_self->_fst.get()->InputSymbols());\n\n  /* \"pywrapfst.pyx\":1553\n *     cdef fst.SymbolTable *syms = const_cast[SymbolTable_ptr](\n *       self._fst.get().InputSymbols())\n *     if syms == NULL:             # <<<<<<<<<<<<<<\n *       return\n *     return _init_FstSymbolTable(syms, self._fst)\n */\n  __pyx_t_5 = ((__pyx_v_syms == NULL) != 0);\n  if (__pyx_t_5) {\n\n    /* \"pywrapfst.pyx\":1554\n *       self._fst.get().InputSymbols())\n *     if syms == NULL:\n *       return             # <<<<<<<<<<<<<<\n *     return _init_FstSymbolTable(syms, self._fst)\n * \n */\n    __Pyx_XDECREF(((PyObject *)__pyx_r));\n    __pyx_r = ((struct __pyx_obj_9pywrapfst__FstSymbolTable *)Py_None); __Pyx_INCREF(Py_None);\n    goto __pyx_L0;\n\n    /* \"pywrapfst.pyx\":1553\n *     cdef fst.SymbolTable *syms = const_cast[SymbolTable_ptr](\n *       self._fst.get().InputSymbols())\n *     if syms == NULL:             # <<<<<<<<<<<<<<\n *       return\n *     return _init_FstSymbolTable(syms, self._fst)\n */\n  }\n\n  /* \"pywrapfst.pyx\":1555\n *     if syms == NULL:\n *       return\n *     return _init_FstSymbolTable(syms, self._fst)             # <<<<<<<<<<<<<<\n * \n *   cpdef size_t num_arcs(self, int64 state) except *:\n */\n  __Pyx_XDECREF(((PyObject *)__pyx_r));\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 1555, __pyx_L1_error)\n  }\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst__init_FstSymbolTable(__pyx_v_syms, __pyx_v_self->_fst)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1555, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = ((struct __pyx_obj_9pywrapfst__FstSymbolTable *)__pyx_t_1);\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":1543\n *     return self._fst.get().FstType()\n * \n *   cpdef _FstSymbolTable input_symbols(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     input_symbols(self)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_AddTraceback(\"pywrapfst._Fst.input_symbols\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XGIVEREF((PyObject *)__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_23input_symbols(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_4_Fst_22input_symbols[] = \"\\n    input_symbols(self)\\n\\n    Returns the FST's input symbol table, or None if none is present.\\n\\n    See also: `input_symbols`.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_23input_symbols(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"input_symbols (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_4_Fst_22input_symbols(((struct __pyx_obj_9pywrapfst__Fst *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_4_Fst_22input_symbols(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"input_symbols\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst_4_Fst_input_symbols(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1543, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst._Fst.input_symbols\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1557\n *     return _init_FstSymbolTable(syms, self._fst)\n * \n *   cpdef size_t num_arcs(self, int64 state) except *:             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     num_arcs(self, state)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_25num_arcs(PyObject *__pyx_v_self, PyObject *__pyx_arg_state); /*proto*/\nstatic size_t __pyx_f_9pywrapfst_4_Fst_num_arcs(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self, __pyx_t_10basictypes_int64 __pyx_v_state, int __pyx_skip_dispatch) {\n  size_t __pyx_v_result;\n  size_t __pyx_r;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  PyObject *__pyx_t_6 = NULL;\n  size_t __pyx_t_7;\n  int __pyx_t_8;\n  __Pyx_RefNannySetupContext(\"num_arcs\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_num_arcs); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1557, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_4_Fst_25num_arcs)) {\n      __pyx_t_3 = __Pyx_PyInt_From_int64_t(__pyx_v_state); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 1557, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_3);\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_4 = __pyx_t_1; __pyx_t_5 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_4))) {\n        __pyx_t_5 = PyMethod_GET_SELF(__pyx_t_4);\n        if (likely(__pyx_t_5)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_4);\n          __Pyx_INCREF(__pyx_t_5);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_4, function);\n        }\n      }\n      if (!__pyx_t_5) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_4, __pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1557, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n        __Pyx_GOTREF(__pyx_t_2);\n      } else {\n        #if CYTHON_FAST_PYCALL\n        if (PyFunction_Check(__pyx_t_4)) {\n          PyObject *__pyx_temp[2] = {__pyx_t_5, __pyx_t_3};\n          __pyx_t_2 = __Pyx_PyFunction_FastCall(__pyx_t_4, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1557, __pyx_L1_error)\n          __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;\n          __Pyx_GOTREF(__pyx_t_2);\n          __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n        } else\n        #endif\n        #if CYTHON_FAST_PYCCALL\n        if (__Pyx_PyFastCFunction_Check(__pyx_t_4)) {\n          PyObject *__pyx_temp[2] = {__pyx_t_5, __pyx_t_3};\n          __pyx_t_2 = __Pyx_PyCFunction_FastCall(__pyx_t_4, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1557, __pyx_L1_error)\n          __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;\n          __Pyx_GOTREF(__pyx_t_2);\n          __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n        } else\n        #endif\n        {\n          __pyx_t_6 = PyTuple_New(1+1); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 1557, __pyx_L1_error)\n          __Pyx_GOTREF(__pyx_t_6);\n          __Pyx_GIVEREF(__pyx_t_5); PyTuple_SET_ITEM(__pyx_t_6, 0, __pyx_t_5); __pyx_t_5 = NULL;\n          __Pyx_GIVEREF(__pyx_t_3);\n          PyTuple_SET_ITEM(__pyx_t_6, 0+1, __pyx_t_3);\n          __pyx_t_3 = 0;\n          __pyx_t_2 = __Pyx_PyObject_Call(__pyx_t_4, __pyx_t_6, NULL); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1557, __pyx_L1_error)\n          __Pyx_GOTREF(__pyx_t_2);\n          __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n        }\n      }\n      __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      __pyx_t_7 = __Pyx_PyInt_As_size_t(__pyx_t_2); if (unlikely((__pyx_t_7 == (size_t)-1) && PyErr_Occurred())) __PYX_ERR(0, 1557, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __pyx_r = __pyx_t_7;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":1574\n *     See also: `num_states`.\n *     \"\"\"\n *     cdef size_t result = self._fst.get().NumArcs(state)             # <<<<<<<<<<<<<<\n *     if result == SIZE_MAX:\n *       raise FstIndexError(\"State index out of range\")\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 1574, __pyx_L1_error)\n  }\n  __pyx_v_result = __pyx_v_self->_fst.get()->NumArcs(__pyx_v_state);\n\n  /* \"pywrapfst.pyx\":1575\n *     \"\"\"\n *     cdef size_t result = self._fst.get().NumArcs(state)\n *     if result == SIZE_MAX:             # <<<<<<<<<<<<<<\n *       raise FstIndexError(\"State index out of range\")\n *     return result\n */\n  __pyx_t_8 = ((__pyx_v_result == SIZE_MAX) != 0);\n  if (unlikely(__pyx_t_8)) {\n\n    /* \"pywrapfst.pyx\":1576\n *     cdef size_t result = self._fst.get().NumArcs(state)\n *     if result == SIZE_MAX:\n *       raise FstIndexError(\"State index out of range\")             # <<<<<<<<<<<<<<\n *     return result\n * \n */\n    __pyx_t_1 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstIndexError); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1576, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    __pyx_t_2 = __Pyx_PyObject_Call(__pyx_t_1, __pyx_tuple__26, NULL); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1576, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_2);\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n    __Pyx_Raise(__pyx_t_2, 0, 0, 0);\n    __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n    __PYX_ERR(0, 1576, __pyx_L1_error)\n\n    /* \"pywrapfst.pyx\":1575\n *     \"\"\"\n *     cdef size_t result = self._fst.get().NumArcs(state)\n *     if result == SIZE_MAX:             # <<<<<<<<<<<<<<\n *       raise FstIndexError(\"State index out of range\")\n *     return result\n */\n  }\n\n  /* \"pywrapfst.pyx\":1577\n *     if result == SIZE_MAX:\n *       raise FstIndexError(\"State index out of range\")\n *     return result             # <<<<<<<<<<<<<<\n * \n *   cpdef size_t num_input_epsilons(self, int64 state) except *:\n */\n  __pyx_r = __pyx_v_result;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":1557\n *     return _init_FstSymbolTable(syms, self._fst)\n * \n *   cpdef size_t num_arcs(self, int64 state) except *:             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     num_arcs(self, state)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_XDECREF(__pyx_t_6);\n  __Pyx_AddTraceback(\"pywrapfst._Fst.num_arcs\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_25num_arcs(PyObject *__pyx_v_self, PyObject *__pyx_arg_state); /*proto*/\nstatic char __pyx_doc_9pywrapfst_4_Fst_24num_arcs[] = \"\\n    num_arcs(self, state)\\n\\n    Returns the number of arcs leaving a state.\\n\\n    Args:\\n      state: The integer index of a state.\\n\\n    Returns:\\n      The number of arcs leaving that state.\\n\\n    Raises:\\n      FstIndexError: State index out of range.\\n\\n    See also: `num_states`.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_25num_arcs(PyObject *__pyx_v_self, PyObject *__pyx_arg_state) {\n  __pyx_t_10basictypes_int64 __pyx_v_state;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"num_arcs (wrapper)\", 0);\n  assert(__pyx_arg_state); {\n    __pyx_v_state = __Pyx_PyInt_As_int64_t(__pyx_arg_state); if (unlikely((__pyx_v_state == ((int64_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 1557, __pyx_L3_error)\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst._Fst.num_arcs\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  __pyx_r = __pyx_pf_9pywrapfst_4_Fst_24num_arcs(((struct __pyx_obj_9pywrapfst__Fst *)__pyx_v_self), ((__pyx_t_10basictypes_int64)__pyx_v_state));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_4_Fst_24num_arcs(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self, __pyx_t_10basictypes_int64 __pyx_v_state) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  size_t __pyx_t_1;\n  PyObject *__pyx_t_2 = NULL;\n  __Pyx_RefNannySetupContext(\"num_arcs\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __pyx_f_9pywrapfst_4_Fst_num_arcs(__pyx_v_self, __pyx_v_state, 1); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 1557, __pyx_L1_error)\n  __pyx_t_2 = __Pyx_PyInt_FromSize_t(__pyx_t_1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1557, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  __pyx_r = __pyx_t_2;\n  __pyx_t_2 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_AddTraceback(\"pywrapfst._Fst.num_arcs\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1579\n *     return result\n * \n *   cpdef size_t num_input_epsilons(self, int64 state) except *:             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     num_input_epsilons(self, state)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_27num_input_epsilons(PyObject *__pyx_v_self, PyObject *__pyx_arg_state); /*proto*/\nstatic size_t __pyx_f_9pywrapfst_4_Fst_num_input_epsilons(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self, __pyx_t_10basictypes_int64 __pyx_v_state, int __pyx_skip_dispatch) {\n  size_t __pyx_v_result;\n  size_t __pyx_r;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  PyObject *__pyx_t_6 = NULL;\n  size_t __pyx_t_7;\n  int __pyx_t_8;\n  __Pyx_RefNannySetupContext(\"num_input_epsilons\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_num_input_epsilons); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1579, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_4_Fst_27num_input_epsilons)) {\n      __pyx_t_3 = __Pyx_PyInt_From_int64_t(__pyx_v_state); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 1579, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_3);\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_4 = __pyx_t_1; __pyx_t_5 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_4))) {\n        __pyx_t_5 = PyMethod_GET_SELF(__pyx_t_4);\n        if (likely(__pyx_t_5)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_4);\n          __Pyx_INCREF(__pyx_t_5);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_4, function);\n        }\n      }\n      if (!__pyx_t_5) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_4, __pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1579, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n        __Pyx_GOTREF(__pyx_t_2);\n      } else {\n        #if CYTHON_FAST_PYCALL\n        if (PyFunction_Check(__pyx_t_4)) {\n          PyObject *__pyx_temp[2] = {__pyx_t_5, __pyx_t_3};\n          __pyx_t_2 = __Pyx_PyFunction_FastCall(__pyx_t_4, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1579, __pyx_L1_error)\n          __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;\n          __Pyx_GOTREF(__pyx_t_2);\n          __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n        } else\n        #endif\n        #if CYTHON_FAST_PYCCALL\n        if (__Pyx_PyFastCFunction_Check(__pyx_t_4)) {\n          PyObject *__pyx_temp[2] = {__pyx_t_5, __pyx_t_3};\n          __pyx_t_2 = __Pyx_PyCFunction_FastCall(__pyx_t_4, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1579, __pyx_L1_error)\n          __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;\n          __Pyx_GOTREF(__pyx_t_2);\n          __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n        } else\n        #endif\n        {\n          __pyx_t_6 = PyTuple_New(1+1); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 1579, __pyx_L1_error)\n          __Pyx_GOTREF(__pyx_t_6);\n          __Pyx_GIVEREF(__pyx_t_5); PyTuple_SET_ITEM(__pyx_t_6, 0, __pyx_t_5); __pyx_t_5 = NULL;\n          __Pyx_GIVEREF(__pyx_t_3);\n          PyTuple_SET_ITEM(__pyx_t_6, 0+1, __pyx_t_3);\n          __pyx_t_3 = 0;\n          __pyx_t_2 = __Pyx_PyObject_Call(__pyx_t_4, __pyx_t_6, NULL); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1579, __pyx_L1_error)\n          __Pyx_GOTREF(__pyx_t_2);\n          __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n        }\n      }\n      __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      __pyx_t_7 = __Pyx_PyInt_As_size_t(__pyx_t_2); if (unlikely((__pyx_t_7 == (size_t)-1) && PyErr_Occurred())) __PYX_ERR(0, 1579, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __pyx_r = __pyx_t_7;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":1596\n *     See also: `num_output_epsilons`.\n *     \"\"\"\n *     cdef size_t result = self._fst.get().NumInputEpsilons(state)             # <<<<<<<<<<<<<<\n *     if result == SIZE_MAX:\n *       raise FstIndexError(\"State index out of range\")\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 1596, __pyx_L1_error)\n  }\n  __pyx_v_result = __pyx_v_self->_fst.get()->NumInputEpsilons(__pyx_v_state);\n\n  /* \"pywrapfst.pyx\":1597\n *     \"\"\"\n *     cdef size_t result = self._fst.get().NumInputEpsilons(state)\n *     if result == SIZE_MAX:             # <<<<<<<<<<<<<<\n *       raise FstIndexError(\"State index out of range\")\n *     return result\n */\n  __pyx_t_8 = ((__pyx_v_result == SIZE_MAX) != 0);\n  if (unlikely(__pyx_t_8)) {\n\n    /* \"pywrapfst.pyx\":1598\n *     cdef size_t result = self._fst.get().NumInputEpsilons(state)\n *     if result == SIZE_MAX:\n *       raise FstIndexError(\"State index out of range\")             # <<<<<<<<<<<<<<\n *     return result\n * \n */\n    __pyx_t_1 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstIndexError); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1598, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    __pyx_t_2 = __Pyx_PyObject_Call(__pyx_t_1, __pyx_tuple__27, NULL); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1598, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_2);\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n    __Pyx_Raise(__pyx_t_2, 0, 0, 0);\n    __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n    __PYX_ERR(0, 1598, __pyx_L1_error)\n\n    /* \"pywrapfst.pyx\":1597\n *     \"\"\"\n *     cdef size_t result = self._fst.get().NumInputEpsilons(state)\n *     if result == SIZE_MAX:             # <<<<<<<<<<<<<<\n *       raise FstIndexError(\"State index out of range\")\n *     return result\n */\n  }\n\n  /* \"pywrapfst.pyx\":1599\n *     if result == SIZE_MAX:\n *       raise FstIndexError(\"State index out of range\")\n *     return result             # <<<<<<<<<<<<<<\n * \n *   cpdef size_t num_output_epsilons(self, int64 state) except *:\n */\n  __pyx_r = __pyx_v_result;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":1579\n *     return result\n * \n *   cpdef size_t num_input_epsilons(self, int64 state) except *:             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     num_input_epsilons(self, state)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_XDECREF(__pyx_t_6);\n  __Pyx_AddTraceback(\"pywrapfst._Fst.num_input_epsilons\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_27num_input_epsilons(PyObject *__pyx_v_self, PyObject *__pyx_arg_state); /*proto*/\nstatic char __pyx_doc_9pywrapfst_4_Fst_26num_input_epsilons[] = \"\\n    num_input_epsilons(self, state)\\n\\n    Returns the number of arcs with epsilon input labels leaving a state.\\n\\n    Args:\\n      state: The integer index of a state.\\n\\n    Returns:\\n      The number of epsilon-input-labeled arcs leaving that state.\\n\\n    Raises:\\n      FstIndexError: State index out of range.\\n\\n    See also: `num_output_epsilons`.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_27num_input_epsilons(PyObject *__pyx_v_self, PyObject *__pyx_arg_state) {\n  __pyx_t_10basictypes_int64 __pyx_v_state;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"num_input_epsilons (wrapper)\", 0);\n  assert(__pyx_arg_state); {\n    __pyx_v_state = __Pyx_PyInt_As_int64_t(__pyx_arg_state); if (unlikely((__pyx_v_state == ((int64_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 1579, __pyx_L3_error)\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst._Fst.num_input_epsilons\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  __pyx_r = __pyx_pf_9pywrapfst_4_Fst_26num_input_epsilons(((struct __pyx_obj_9pywrapfst__Fst *)__pyx_v_self), ((__pyx_t_10basictypes_int64)__pyx_v_state));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_4_Fst_26num_input_epsilons(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self, __pyx_t_10basictypes_int64 __pyx_v_state) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  size_t __pyx_t_1;\n  PyObject *__pyx_t_2 = NULL;\n  __Pyx_RefNannySetupContext(\"num_input_epsilons\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __pyx_f_9pywrapfst_4_Fst_num_input_epsilons(__pyx_v_self, __pyx_v_state, 1); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 1579, __pyx_L1_error)\n  __pyx_t_2 = __Pyx_PyInt_FromSize_t(__pyx_t_1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1579, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  __pyx_r = __pyx_t_2;\n  __pyx_t_2 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_AddTraceback(\"pywrapfst._Fst.num_input_epsilons\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1601\n *     return result\n * \n *   cpdef size_t num_output_epsilons(self, int64 state) except *:             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     num_output_epsilons(self, state)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_29num_output_epsilons(PyObject *__pyx_v_self, PyObject *__pyx_arg_state); /*proto*/\nstatic size_t __pyx_f_9pywrapfst_4_Fst_num_output_epsilons(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self, __pyx_t_10basictypes_int64 __pyx_v_state, int __pyx_skip_dispatch) {\n  size_t __pyx_v_result;\n  size_t __pyx_r;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  PyObject *__pyx_t_6 = NULL;\n  size_t __pyx_t_7;\n  int __pyx_t_8;\n  __Pyx_RefNannySetupContext(\"num_output_epsilons\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_num_output_epsilons); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1601, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_4_Fst_29num_output_epsilons)) {\n      __pyx_t_3 = __Pyx_PyInt_From_int64_t(__pyx_v_state); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 1601, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_3);\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_4 = __pyx_t_1; __pyx_t_5 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_4))) {\n        __pyx_t_5 = PyMethod_GET_SELF(__pyx_t_4);\n        if (likely(__pyx_t_5)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_4);\n          __Pyx_INCREF(__pyx_t_5);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_4, function);\n        }\n      }\n      if (!__pyx_t_5) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_4, __pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1601, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n        __Pyx_GOTREF(__pyx_t_2);\n      } else {\n        #if CYTHON_FAST_PYCALL\n        if (PyFunction_Check(__pyx_t_4)) {\n          PyObject *__pyx_temp[2] = {__pyx_t_5, __pyx_t_3};\n          __pyx_t_2 = __Pyx_PyFunction_FastCall(__pyx_t_4, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1601, __pyx_L1_error)\n          __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;\n          __Pyx_GOTREF(__pyx_t_2);\n          __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n        } else\n        #endif\n        #if CYTHON_FAST_PYCCALL\n        if (__Pyx_PyFastCFunction_Check(__pyx_t_4)) {\n          PyObject *__pyx_temp[2] = {__pyx_t_5, __pyx_t_3};\n          __pyx_t_2 = __Pyx_PyCFunction_FastCall(__pyx_t_4, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1601, __pyx_L1_error)\n          __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;\n          __Pyx_GOTREF(__pyx_t_2);\n          __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n        } else\n        #endif\n        {\n          __pyx_t_6 = PyTuple_New(1+1); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 1601, __pyx_L1_error)\n          __Pyx_GOTREF(__pyx_t_6);\n          __Pyx_GIVEREF(__pyx_t_5); PyTuple_SET_ITEM(__pyx_t_6, 0, __pyx_t_5); __pyx_t_5 = NULL;\n          __Pyx_GIVEREF(__pyx_t_3);\n          PyTuple_SET_ITEM(__pyx_t_6, 0+1, __pyx_t_3);\n          __pyx_t_3 = 0;\n          __pyx_t_2 = __Pyx_PyObject_Call(__pyx_t_4, __pyx_t_6, NULL); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1601, __pyx_L1_error)\n          __Pyx_GOTREF(__pyx_t_2);\n          __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n        }\n      }\n      __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      __pyx_t_7 = __Pyx_PyInt_As_size_t(__pyx_t_2); if (unlikely((__pyx_t_7 == (size_t)-1) && PyErr_Occurred())) __PYX_ERR(0, 1601, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __pyx_r = __pyx_t_7;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":1618\n *     See also: `num_input_epsilons`.\n *     \"\"\"\n *     cdef size_t result = self._fst.get().NumOutputEpsilons(state)             # <<<<<<<<<<<<<<\n *     if result == SIZE_MAX:\n *       raise FstIndexError(\"State index out of range\")\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 1618, __pyx_L1_error)\n  }\n  __pyx_v_result = __pyx_v_self->_fst.get()->NumOutputEpsilons(__pyx_v_state);\n\n  /* \"pywrapfst.pyx\":1619\n *     \"\"\"\n *     cdef size_t result = self._fst.get().NumOutputEpsilons(state)\n *     if result == SIZE_MAX:             # <<<<<<<<<<<<<<\n *       raise FstIndexError(\"State index out of range\")\n *     return result\n */\n  __pyx_t_8 = ((__pyx_v_result == SIZE_MAX) != 0);\n  if (unlikely(__pyx_t_8)) {\n\n    /* \"pywrapfst.pyx\":1620\n *     cdef size_t result = self._fst.get().NumOutputEpsilons(state)\n *     if result == SIZE_MAX:\n *       raise FstIndexError(\"State index out of range\")             # <<<<<<<<<<<<<<\n *     return result\n * \n */\n    __pyx_t_1 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstIndexError); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1620, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    __pyx_t_2 = __Pyx_PyObject_Call(__pyx_t_1, __pyx_tuple__28, NULL); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1620, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_2);\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n    __Pyx_Raise(__pyx_t_2, 0, 0, 0);\n    __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n    __PYX_ERR(0, 1620, __pyx_L1_error)\n\n    /* \"pywrapfst.pyx\":1619\n *     \"\"\"\n *     cdef size_t result = self._fst.get().NumOutputEpsilons(state)\n *     if result == SIZE_MAX:             # <<<<<<<<<<<<<<\n *       raise FstIndexError(\"State index out of range\")\n *     return result\n */\n  }\n\n  /* \"pywrapfst.pyx\":1621\n *     if result == SIZE_MAX:\n *       raise FstIndexError(\"State index out of range\")\n *     return result             # <<<<<<<<<<<<<<\n * \n *   cpdef _FstSymbolTable output_symbols(self):\n */\n  __pyx_r = __pyx_v_result;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":1601\n *     return result\n * \n *   cpdef size_t num_output_epsilons(self, int64 state) except *:             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     num_output_epsilons(self, state)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_XDECREF(__pyx_t_6);\n  __Pyx_AddTraceback(\"pywrapfst._Fst.num_output_epsilons\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_29num_output_epsilons(PyObject *__pyx_v_self, PyObject *__pyx_arg_state); /*proto*/\nstatic char __pyx_doc_9pywrapfst_4_Fst_28num_output_epsilons[] = \"\\n    num_output_epsilons(self, state)\\n\\n    Returns the number of arcs with epsilon output labels leaving a state.\\n\\n    Args:\\n      state: The integer index of a state.\\n\\n    Returns:\\n      The number of epsilon-output-labeled arcs leaving that state.\\n\\n    Raises:\\n      FstIndexError: State index out of range.\\n\\n    See also: `num_input_epsilons`.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_29num_output_epsilons(PyObject *__pyx_v_self, PyObject *__pyx_arg_state) {\n  __pyx_t_10basictypes_int64 __pyx_v_state;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"num_output_epsilons (wrapper)\", 0);\n  assert(__pyx_arg_state); {\n    __pyx_v_state = __Pyx_PyInt_As_int64_t(__pyx_arg_state); if (unlikely((__pyx_v_state == ((int64_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 1601, __pyx_L3_error)\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst._Fst.num_output_epsilons\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  __pyx_r = __pyx_pf_9pywrapfst_4_Fst_28num_output_epsilons(((struct __pyx_obj_9pywrapfst__Fst *)__pyx_v_self), ((__pyx_t_10basictypes_int64)__pyx_v_state));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_4_Fst_28num_output_epsilons(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self, __pyx_t_10basictypes_int64 __pyx_v_state) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  size_t __pyx_t_1;\n  PyObject *__pyx_t_2 = NULL;\n  __Pyx_RefNannySetupContext(\"num_output_epsilons\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __pyx_f_9pywrapfst_4_Fst_num_output_epsilons(__pyx_v_self, __pyx_v_state, 1); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 1601, __pyx_L1_error)\n  __pyx_t_2 = __Pyx_PyInt_FromSize_t(__pyx_t_1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1601, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  __pyx_r = __pyx_t_2;\n  __pyx_t_2 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_AddTraceback(\"pywrapfst._Fst.num_output_epsilons\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1623\n *     return result\n * \n *   cpdef _FstSymbolTable output_symbols(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     output_symbols(self)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_31output_symbols(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic struct __pyx_obj_9pywrapfst__FstSymbolTable *__pyx_f_9pywrapfst_4_Fst_output_symbols(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self, int __pyx_skip_dispatch) {\n  fst::SymbolTable *__pyx_v_syms;\n  struct __pyx_obj_9pywrapfst__FstSymbolTable *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  int __pyx_t_5;\n  __Pyx_RefNannySetupContext(\"output_symbols\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_output_symbols); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1623, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_4_Fst_31output_symbols)) {\n      __Pyx_XDECREF(((PyObject *)__pyx_r));\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1623, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1623, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      if (!(likely(((__pyx_t_2) == Py_None) || likely(__Pyx_TypeTest(__pyx_t_2, __pyx_ptype_9pywrapfst__FstSymbolTable))))) __PYX_ERR(0, 1623, __pyx_L1_error)\n      __pyx_r = ((struct __pyx_obj_9pywrapfst__FstSymbolTable *)__pyx_t_2);\n      __pyx_t_2 = 0;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":1632\n *     \"\"\"\n *     cdef fst.SymbolTable *syms = const_cast[SymbolTable_ptr](\n *       self._fst.get().OutputSymbols())             # <<<<<<<<<<<<<<\n *     if syms == NULL:\n *       return\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 1632, __pyx_L1_error)\n  }\n\n  /* \"pywrapfst.pyx\":1631\n *     See also: `input_symbols`.\n *     \"\"\"\n *     cdef fst.SymbolTable *syms = const_cast[SymbolTable_ptr](             # <<<<<<<<<<<<<<\n *       self._fst.get().OutputSymbols())\n *     if syms == NULL:\n */\n  __pyx_v_syms = const_cast<__pyx_t_9pywrapfst_SymbolTable_ptr>(__pyx_v_self->_fst.get()->OutputSymbols());\n\n  /* \"pywrapfst.pyx\":1633\n *     cdef fst.SymbolTable *syms = const_cast[SymbolTable_ptr](\n *       self._fst.get().OutputSymbols())\n *     if syms == NULL:             # <<<<<<<<<<<<<<\n *       return\n *     return _init_FstSymbolTable(syms, self._fst)\n */\n  __pyx_t_5 = ((__pyx_v_syms == NULL) != 0);\n  if (__pyx_t_5) {\n\n    /* \"pywrapfst.pyx\":1634\n *       self._fst.get().OutputSymbols())\n *     if syms == NULL:\n *       return             # <<<<<<<<<<<<<<\n *     return _init_FstSymbolTable(syms, self._fst)\n * \n */\n    __Pyx_XDECREF(((PyObject *)__pyx_r));\n    __pyx_r = ((struct __pyx_obj_9pywrapfst__FstSymbolTable *)Py_None); __Pyx_INCREF(Py_None);\n    goto __pyx_L0;\n\n    /* \"pywrapfst.pyx\":1633\n *     cdef fst.SymbolTable *syms = const_cast[SymbolTable_ptr](\n *       self._fst.get().OutputSymbols())\n *     if syms == NULL:             # <<<<<<<<<<<<<<\n *       return\n *     return _init_FstSymbolTable(syms, self._fst)\n */\n  }\n\n  /* \"pywrapfst.pyx\":1635\n *     if syms == NULL:\n *       return\n *     return _init_FstSymbolTable(syms, self._fst)             # <<<<<<<<<<<<<<\n * \n *   cpdef uint64 properties(self, uint64 mask, bool test):\n */\n  __Pyx_XDECREF(((PyObject *)__pyx_r));\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 1635, __pyx_L1_error)\n  }\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst__init_FstSymbolTable(__pyx_v_syms, __pyx_v_self->_fst)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1635, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = ((struct __pyx_obj_9pywrapfst__FstSymbolTable *)__pyx_t_1);\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":1623\n *     return result\n * \n *   cpdef _FstSymbolTable output_symbols(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     output_symbols(self)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_AddTraceback(\"pywrapfst._Fst.output_symbols\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XGIVEREF((PyObject *)__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_31output_symbols(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_4_Fst_30output_symbols[] = \"\\n    output_symbols(self)\\n\\n    Returns the FST's output symbol table, or None if none is present.\\n\\n    See also: `input_symbols`.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_31output_symbols(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"output_symbols (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_4_Fst_30output_symbols(((struct __pyx_obj_9pywrapfst__Fst *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_4_Fst_30output_symbols(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"output_symbols\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst_4_Fst_output_symbols(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1623, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst._Fst.output_symbols\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1637\n *     return _init_FstSymbolTable(syms, self._fst)\n * \n *   cpdef uint64 properties(self, uint64 mask, bool test):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     properties(self, mask, test)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_33properties(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic __pyx_t_10basictypes_uint64 __pyx_f_9pywrapfst_4_Fst_properties(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self, __pyx_t_10basictypes_uint64 __pyx_v_mask, bool __pyx_v_test, int __pyx_skip_dispatch) {\n  __pyx_t_10basictypes_uint64 __pyx_r;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  PyObject *__pyx_t_6 = NULL;\n  int __pyx_t_7;\n  PyObject *__pyx_t_8 = NULL;\n  __pyx_t_10basictypes_uint64 __pyx_t_9;\n  __Pyx_RefNannySetupContext(\"properties\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_properties); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1637, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_4_Fst_33properties)) {\n      __pyx_t_3 = __Pyx_PyInt_From_uint64_t(__pyx_v_mask); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 1637, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_3);\n      __pyx_t_4 = __Pyx_PyBool_FromLong(__pyx_v_test); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 1637, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_4);\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_5 = __pyx_t_1; __pyx_t_6 = NULL;\n      __pyx_t_7 = 0;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_5))) {\n        __pyx_t_6 = PyMethod_GET_SELF(__pyx_t_5);\n        if (likely(__pyx_t_6)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_5);\n          __Pyx_INCREF(__pyx_t_6);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_5, function);\n          __pyx_t_7 = 1;\n        }\n      }\n      #if CYTHON_FAST_PYCALL\n      if (PyFunction_Check(__pyx_t_5)) {\n        PyObject *__pyx_temp[3] = {__pyx_t_6, __pyx_t_3, __pyx_t_4};\n        __pyx_t_2 = __Pyx_PyFunction_FastCall(__pyx_t_5, __pyx_temp+1-__pyx_t_7, 2+__pyx_t_7); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1637, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_6); __pyx_t_6 = 0;\n        __Pyx_GOTREF(__pyx_t_2);\n        __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else\n      #endif\n      #if CYTHON_FAST_PYCCALL\n      if (__Pyx_PyFastCFunction_Check(__pyx_t_5)) {\n        PyObject *__pyx_temp[3] = {__pyx_t_6, __pyx_t_3, __pyx_t_4};\n        __pyx_t_2 = __Pyx_PyCFunction_FastCall(__pyx_t_5, __pyx_temp+1-__pyx_t_7, 2+__pyx_t_7); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1637, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_6); __pyx_t_6 = 0;\n        __Pyx_GOTREF(__pyx_t_2);\n        __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else\n      #endif\n      {\n        __pyx_t_8 = PyTuple_New(2+__pyx_t_7); if (unlikely(!__pyx_t_8)) __PYX_ERR(0, 1637, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_8);\n        if (__pyx_t_6) {\n          __Pyx_GIVEREF(__pyx_t_6); PyTuple_SET_ITEM(__pyx_t_8, 0, __pyx_t_6); __pyx_t_6 = NULL;\n        }\n        __Pyx_GIVEREF(__pyx_t_3);\n        PyTuple_SET_ITEM(__pyx_t_8, 0+__pyx_t_7, __pyx_t_3);\n        __Pyx_GIVEREF(__pyx_t_4);\n        PyTuple_SET_ITEM(__pyx_t_8, 1+__pyx_t_7, __pyx_t_4);\n        __pyx_t_3 = 0;\n        __pyx_t_4 = 0;\n        __pyx_t_2 = __Pyx_PyObject_Call(__pyx_t_5, __pyx_t_8, NULL); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1637, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_2);\n        __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0;\n      }\n      __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n      __pyx_t_9 = __Pyx_PyInt_As_uint64_t(__pyx_t_2); if (unlikely((__pyx_t_9 == ((uint64_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 1637, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __pyx_r = __pyx_t_9;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":1655\n *       A 64-bit bitmask representing the requested properties.\n *     \"\"\"\n *     return self._fst.get().Properties(mask, test)             # <<<<<<<<<<<<<<\n * \n *   cpdef int64 start(self):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 1655, __pyx_L1_error)\n  }\n  __pyx_r = __pyx_v_self->_fst.get()->Properties(__pyx_v_mask, __pyx_v_test);\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":1637\n *     return _init_FstSymbolTable(syms, self._fst)\n * \n *   cpdef uint64 properties(self, uint64 mask, bool test):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     properties(self, mask, test)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_XDECREF(__pyx_t_6);\n  __Pyx_XDECREF(__pyx_t_8);\n  __Pyx_WriteUnraisable(\"pywrapfst._Fst.properties\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_33properties(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic char __pyx_doc_9pywrapfst_4_Fst_32properties[] = \"\\n    properties(self, mask, test)\\n\\n    Provides property bits.\\n\\n    This method provides user access to the properties attributes for the FST.\\n    The resulting value is a long integer, but when it is cast to a boolean,\\n    it represents whether or not the FST has the `mask` property.\\n\\n    Args:\\n      mask: The property mask to be compared to the FST's properties.\\n      test: Should any unknown values be computed before comparing against\\n          the mask?\\n\\n    Returns:\\n      A 64-bit bitmask representing the requested properties.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_33properties(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  __pyx_t_10basictypes_uint64 __pyx_v_mask;\n  bool __pyx_v_test;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"properties (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_mask,&__pyx_n_s_test,0};\n    PyObject* values[2] = {0,0};\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (likely((values[0] = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_mask)) != 0)) kw_args--;\n        else goto __pyx_L5_argtuple_error;\n        CYTHON_FALLTHROUGH;\n        case  1:\n        if (likely((values[1] = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_test)) != 0)) kw_args--;\n        else {\n          __Pyx_RaiseArgtupleInvalid(\"properties\", 1, 2, 2, 1); __PYX_ERR(0, 1637, __pyx_L3_error)\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"properties\") < 0)) __PYX_ERR(0, 1637, __pyx_L3_error)\n      }\n    } else if (PyTuple_GET_SIZE(__pyx_args) != 2) {\n      goto __pyx_L5_argtuple_error;\n    } else {\n      values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n      values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n    }\n    __pyx_v_mask = __Pyx_PyInt_As_uint64_t(values[0]); if (unlikely((__pyx_v_mask == ((uint64_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 1637, __pyx_L3_error)\n    __pyx_v_test = __Pyx_PyObject_IsTrue(values[1]); if (unlikely((__pyx_v_test == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 1637, __pyx_L3_error)\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"properties\", 1, 2, 2, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 1637, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst._Fst.properties\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  __pyx_r = __pyx_pf_9pywrapfst_4_Fst_32properties(((struct __pyx_obj_9pywrapfst__Fst *)__pyx_v_self), __pyx_v_mask, __pyx_v_test);\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_4_Fst_32properties(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self, __pyx_t_10basictypes_uint64 __pyx_v_mask, bool __pyx_v_test) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"properties\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(__pyx_f_9pywrapfst_4_Fst_properties(__pyx_v_self, __pyx_v_mask, __pyx_v_test, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1637, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst._Fst.properties\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1657\n *     return self._fst.get().Properties(mask, test)\n * \n *   cpdef int64 start(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     start(self)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_35start(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic __pyx_t_10basictypes_int64 __pyx_f_9pywrapfst_4_Fst_start(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self, int __pyx_skip_dispatch) {\n  __pyx_t_10basictypes_int64 __pyx_r;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  __pyx_t_10basictypes_int64 __pyx_t_5;\n  __Pyx_RefNannySetupContext(\"start\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_start); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1657, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_4_Fst_35start)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1657, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1657, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __pyx_t_5 = __Pyx_PyInt_As_int64_t(__pyx_t_2); if (unlikely((__pyx_t_5 == ((int64_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 1657, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __pyx_r = __pyx_t_5;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":1663\n *     Returns the start state.\n *     \"\"\"\n *     return self._fst.get().Start()             # <<<<<<<<<<<<<<\n * \n *   cpdef StateIterator states(self):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 1663, __pyx_L1_error)\n  }\n  __pyx_r = __pyx_v_self->_fst.get()->Start();\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":1657\n *     return self._fst.get().Properties(mask, test)\n * \n *   cpdef int64 start(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     start(self)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_WriteUnraisable(\"pywrapfst._Fst.start\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_35start(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_4_Fst_34start[] = \"\\n    start(self)\\n\\n    Returns the start state.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_35start(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"start (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_4_Fst_34start(((struct __pyx_obj_9pywrapfst__Fst *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_4_Fst_34start(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"start\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __Pyx_PyInt_From_int64_t(__pyx_f_9pywrapfst_4_Fst_start(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1657, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst._Fst.start\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1665\n *     return self._fst.get().Start()\n * \n *   cpdef StateIterator states(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     states(self)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_37states(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic struct __pyx_obj_9pywrapfst_StateIterator *__pyx_f_9pywrapfst_4_Fst_states(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self, int __pyx_skip_dispatch) {\n  struct __pyx_obj_9pywrapfst_StateIterator *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  __Pyx_RefNannySetupContext(\"states\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_states); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1665, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_4_Fst_37states)) {\n      __Pyx_XDECREF(((PyObject *)__pyx_r));\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1665, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1665, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      if (!(likely(((__pyx_t_2) == Py_None) || likely(__Pyx_TypeTest(__pyx_t_2, __pyx_ptype_9pywrapfst_StateIterator))))) __PYX_ERR(0, 1665, __pyx_L1_error)\n      __pyx_r = ((struct __pyx_obj_9pywrapfst_StateIterator *)__pyx_t_2);\n      __pyx_t_2 = 0;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":1676\n *     See also: `arcs`, `mutable_arcs`.\n *     \"\"\"\n *     return StateIterator(self)             # <<<<<<<<<<<<<<\n * \n *   cpdef string text(self, _SymbolTable isymbols=None,\n */\n  __Pyx_XDECREF(((PyObject *)__pyx_r));\n  __pyx_t_1 = __Pyx_PyObject_CallOneArg(((PyObject *)__pyx_ptype_9pywrapfst_StateIterator), ((PyObject *)__pyx_v_self)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1676, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = ((struct __pyx_obj_9pywrapfst_StateIterator *)__pyx_t_1);\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":1665\n *     return self._fst.get().Start()\n * \n *   cpdef StateIterator states(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     states(self)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_AddTraceback(\"pywrapfst._Fst.states\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XGIVEREF((PyObject *)__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_37states(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_4_Fst_36states[] = \"\\n    states(self)\\n\\n    Returns an iterator over all states in the FST.\\n\\n    Returns:\\n      A StateIterator object for the FST.\\n\\n    See also: `arcs`, `mutable_arcs`.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_37states(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"states (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_4_Fst_36states(((struct __pyx_obj_9pywrapfst__Fst *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_4_Fst_36states(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"states\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst_4_Fst_states(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1665, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst._Fst.states\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1678\n *     return StateIterator(self)\n * \n *   cpdef string text(self, _SymbolTable isymbols=None,             # <<<<<<<<<<<<<<\n *       _SymbolTable osymbols=None, _SymbolTable ssymbols=None,\n *       bool acceptor=False, bool show_weight_one=False, missing_sym=b\"\"):\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_39text(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic std::string __pyx_f_9pywrapfst_4_Fst_text(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self, int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_4_Fst_text *__pyx_optional_args) {\n  struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_isymbols = ((struct __pyx_obj_9pywrapfst__SymbolTable *)Py_None);\n\n  /* \"pywrapfst.pyx\":1679\n * \n *   cpdef string text(self, _SymbolTable isymbols=None,\n *       _SymbolTable osymbols=None, _SymbolTable ssymbols=None,             # <<<<<<<<<<<<<<\n *       bool acceptor=False, bool show_weight_one=False, missing_sym=b\"\"):\n *     \"\"\"\n */\n  struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_osymbols = ((struct __pyx_obj_9pywrapfst__SymbolTable *)Py_None);\n  struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_ssymbols = ((struct __pyx_obj_9pywrapfst__SymbolTable *)Py_None);\n\n  /* \"pywrapfst.pyx\":1680\n *   cpdef string text(self, _SymbolTable isymbols=None,\n *       _SymbolTable osymbols=None, _SymbolTable ssymbols=None,\n *       bool acceptor=False, bool show_weight_one=False, missing_sym=b\"\"):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     text(self, isymbols=None, osymbols=None, ssymbols=None, acceptor=False,\n */\n  bool __pyx_v_acceptor = ((bool)0);\n  bool __pyx_v_show_weight_one = ((bool)0);\n  PyObject *__pyx_v_missing_sym = ((PyObject *)__pyx_kp_b__24);\n  fst::SymbolTable *__pyx_v_ssymbols_ptr;\n  std::stringstream __pyx_v_sstrm;\n  std::string __pyx_r;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  PyObject *__pyx_t_6 = NULL;\n  int __pyx_t_7;\n  PyObject *__pyx_t_8 = NULL;\n  std::string __pyx_t_9;\n  int __pyx_t_10;\n  int __pyx_t_11;\n  fst::SymbolTable *__pyx_t_12;\n  fst::SymbolTable const *__pyx_t_13;\n  fst::SymbolTable const *__pyx_t_14;\n  __Pyx_RefNannySetupContext(\"text\", 0);\n  if (__pyx_optional_args) {\n    if (__pyx_optional_args->__pyx_n > 0) {\n      __pyx_v_isymbols = __pyx_optional_args->isymbols;\n      if (__pyx_optional_args->__pyx_n > 1) {\n        __pyx_v_osymbols = __pyx_optional_args->osymbols;\n        if (__pyx_optional_args->__pyx_n > 2) {\n          __pyx_v_ssymbols = __pyx_optional_args->ssymbols;\n          if (__pyx_optional_args->__pyx_n > 3) {\n            __pyx_v_acceptor = __pyx_optional_args->acceptor;\n            if (__pyx_optional_args->__pyx_n > 4) {\n              __pyx_v_show_weight_one = __pyx_optional_args->show_weight_one;\n              if (__pyx_optional_args->__pyx_n > 5) {\n                __pyx_v_missing_sym = __pyx_optional_args->missing_sym;\n              }\n            }\n          }\n        }\n      }\n    }\n  }\n\n  /* \"pywrapfst.pyx\":1678\n *     return StateIterator(self)\n * \n *   cpdef string text(self, _SymbolTable isymbols=None,             # <<<<<<<<<<<<<<\n *       _SymbolTable osymbols=None, _SymbolTable ssymbols=None,\n *       bool acceptor=False, bool show_weight_one=False, missing_sym=b\"\"):\n */\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_text); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1678, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_4_Fst_39text)) {\n      __pyx_t_3 = __Pyx_PyBool_FromLong(__pyx_v_acceptor); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 1678, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_3);\n      __pyx_t_4 = __Pyx_PyBool_FromLong(__pyx_v_show_weight_one); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 1678, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_4);\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_5 = __pyx_t_1; __pyx_t_6 = NULL;\n      __pyx_t_7 = 0;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_5))) {\n        __pyx_t_6 = PyMethod_GET_SELF(__pyx_t_5);\n        if (likely(__pyx_t_6)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_5);\n          __Pyx_INCREF(__pyx_t_6);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_5, function);\n          __pyx_t_7 = 1;\n        }\n      }\n      #if CYTHON_FAST_PYCALL\n      if (PyFunction_Check(__pyx_t_5)) {\n        PyObject *__pyx_temp[7] = {__pyx_t_6, ((PyObject *)__pyx_v_isymbols), ((PyObject *)__pyx_v_osymbols), ((PyObject *)__pyx_v_ssymbols), __pyx_t_3, __pyx_t_4, __pyx_v_missing_sym};\n        __pyx_t_2 = __Pyx_PyFunction_FastCall(__pyx_t_5, __pyx_temp+1-__pyx_t_7, 6+__pyx_t_7); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1678, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_6); __pyx_t_6 = 0;\n        __Pyx_GOTREF(__pyx_t_2);\n        __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else\n      #endif\n      #if CYTHON_FAST_PYCCALL\n      if (__Pyx_PyFastCFunction_Check(__pyx_t_5)) {\n        PyObject *__pyx_temp[7] = {__pyx_t_6, ((PyObject *)__pyx_v_isymbols), ((PyObject *)__pyx_v_osymbols), ((PyObject *)__pyx_v_ssymbols), __pyx_t_3, __pyx_t_4, __pyx_v_missing_sym};\n        __pyx_t_2 = __Pyx_PyCFunction_FastCall(__pyx_t_5, __pyx_temp+1-__pyx_t_7, 6+__pyx_t_7); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1678, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_6); __pyx_t_6 = 0;\n        __Pyx_GOTREF(__pyx_t_2);\n        __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else\n      #endif\n      {\n        __pyx_t_8 = PyTuple_New(6+__pyx_t_7); if (unlikely(!__pyx_t_8)) __PYX_ERR(0, 1678, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_8);\n        if (__pyx_t_6) {\n          __Pyx_GIVEREF(__pyx_t_6); PyTuple_SET_ITEM(__pyx_t_8, 0, __pyx_t_6); __pyx_t_6 = NULL;\n        }\n        __Pyx_INCREF(((PyObject *)__pyx_v_isymbols));\n        __Pyx_GIVEREF(((PyObject *)__pyx_v_isymbols));\n        PyTuple_SET_ITEM(__pyx_t_8, 0+__pyx_t_7, ((PyObject *)__pyx_v_isymbols));\n        __Pyx_INCREF(((PyObject *)__pyx_v_osymbols));\n        __Pyx_GIVEREF(((PyObject *)__pyx_v_osymbols));\n        PyTuple_SET_ITEM(__pyx_t_8, 1+__pyx_t_7, ((PyObject *)__pyx_v_osymbols));\n        __Pyx_INCREF(((PyObject *)__pyx_v_ssymbols));\n        __Pyx_GIVEREF(((PyObject *)__pyx_v_ssymbols));\n        PyTuple_SET_ITEM(__pyx_t_8, 2+__pyx_t_7, ((PyObject *)__pyx_v_ssymbols));\n        __Pyx_GIVEREF(__pyx_t_3);\n        PyTuple_SET_ITEM(__pyx_t_8, 3+__pyx_t_7, __pyx_t_3);\n        __Pyx_GIVEREF(__pyx_t_4);\n        PyTuple_SET_ITEM(__pyx_t_8, 4+__pyx_t_7, __pyx_t_4);\n        __Pyx_INCREF(__pyx_v_missing_sym);\n        __Pyx_GIVEREF(__pyx_v_missing_sym);\n        PyTuple_SET_ITEM(__pyx_t_8, 5+__pyx_t_7, __pyx_v_missing_sym);\n        __pyx_t_3 = 0;\n        __pyx_t_4 = 0;\n        __pyx_t_2 = __Pyx_PyObject_Call(__pyx_t_5, __pyx_t_8, NULL); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1678, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_2);\n        __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0;\n      }\n      __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n      __pyx_t_9 = __pyx_convert_string_from_py_std__in_string(__pyx_t_2); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 1678, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __pyx_r = __pyx_t_9;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":1703\n *     \"\"\"\n *     # Prints FST to stringstream, then returns resulting string.\n *     cdef fst.SymbolTable *ssymbols_ptr = NULL             # <<<<<<<<<<<<<<\n *     if ssymbols is not None:\n *       ssymbols_ptr = ssymbols._table\n */\n  __pyx_v_ssymbols_ptr = NULL;\n\n  /* \"pywrapfst.pyx\":1704\n *     # Prints FST to stringstream, then returns resulting string.\n *     cdef fst.SymbolTable *ssymbols_ptr = NULL\n *     if ssymbols is not None:             # <<<<<<<<<<<<<<\n *       ssymbols_ptr = ssymbols._table\n *     cdef stringstream sstrm\n */\n  __pyx_t_10 = (((PyObject *)__pyx_v_ssymbols) != Py_None);\n  __pyx_t_11 = (__pyx_t_10 != 0);\n  if (__pyx_t_11) {\n\n    /* \"pywrapfst.pyx\":1705\n *     cdef fst.SymbolTable *ssymbols_ptr = NULL\n *     if ssymbols is not None:\n *       ssymbols_ptr = ssymbols._table             # <<<<<<<<<<<<<<\n *     cdef stringstream sstrm\n *     fst.PrintFst(deref(self._fst), sstrm, b\"<pywrapfst>\",\n */\n    if (unlikely(((PyObject *)__pyx_v_ssymbols) == Py_None)) {\n      PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_table\");\n      __PYX_ERR(0, 1705, __pyx_L1_error)\n    }\n    __pyx_t_12 = __pyx_v_ssymbols->_table;\n    __pyx_v_ssymbols_ptr = __pyx_t_12;\n\n    /* \"pywrapfst.pyx\":1704\n *     # Prints FST to stringstream, then returns resulting string.\n *     cdef fst.SymbolTable *ssymbols_ptr = NULL\n *     if ssymbols is not None:             # <<<<<<<<<<<<<<\n *       ssymbols_ptr = ssymbols._table\n *     cdef stringstream sstrm\n */\n  }\n\n  /* \"pywrapfst.pyx\":1707\n *       ssymbols_ptr = ssymbols._table\n *     cdef stringstream sstrm\n *     fst.PrintFst(deref(self._fst), sstrm, b\"<pywrapfst>\",             # <<<<<<<<<<<<<<\n *         self._fst.get().InputSymbols() if isymbols is None\n *         else isymbols._table,\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 1707, __pyx_L1_error)\n  }\n\n  /* \"pywrapfst.pyx\":1708\n *     cdef stringstream sstrm\n *     fst.PrintFst(deref(self._fst), sstrm, b\"<pywrapfst>\",\n *         self._fst.get().InputSymbols() if isymbols is None             # <<<<<<<<<<<<<<\n *         else isymbols._table,\n *         self._fst.get().OutputSymbols() if osymbols is None\n */\n  __pyx_t_11 = (((PyObject *)__pyx_v_isymbols) == Py_None);\n  if ((__pyx_t_11 != 0)) {\n    if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n      PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n      __PYX_ERR(0, 1708, __pyx_L1_error)\n    }\n    __pyx_t_13 = __pyx_v_self->_fst.get()->InputSymbols();\n  } else {\n\n    /* \"pywrapfst.pyx\":1709\n *     fst.PrintFst(deref(self._fst), sstrm, b\"<pywrapfst>\",\n *         self._fst.get().InputSymbols() if isymbols is None\n *         else isymbols._table,             # <<<<<<<<<<<<<<\n *         self._fst.get().OutputSymbols() if osymbols is None\n *         else osymbols._table,\n */\n    if (unlikely(((PyObject *)__pyx_v_isymbols) == Py_None)) {\n      PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_table\");\n      __PYX_ERR(0, 1709, __pyx_L1_error)\n    }\n    __pyx_t_13 = __pyx_v_isymbols->_table;\n  }\n\n  /* \"pywrapfst.pyx\":1710\n *         self._fst.get().InputSymbols() if isymbols is None\n *         else isymbols._table,\n *         self._fst.get().OutputSymbols() if osymbols is None             # <<<<<<<<<<<<<<\n *         else osymbols._table,\n *         ssymbols_ptr, acceptor, show_weight_one, tostring(missing_sym))\n */\n  __pyx_t_11 = (((PyObject *)__pyx_v_osymbols) == Py_None);\n  if ((__pyx_t_11 != 0)) {\n    if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n      PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n      __PYX_ERR(0, 1710, __pyx_L1_error)\n    }\n    __pyx_t_14 = __pyx_v_self->_fst.get()->OutputSymbols();\n  } else {\n\n    /* \"pywrapfst.pyx\":1711\n *         else isymbols._table,\n *         self._fst.get().OutputSymbols() if osymbols is None\n *         else osymbols._table,             # <<<<<<<<<<<<<<\n *         ssymbols_ptr, acceptor, show_weight_one, tostring(missing_sym))\n *     return sstrm.str()\n */\n    if (unlikely(((PyObject *)__pyx_v_osymbols) == Py_None)) {\n      PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_table\");\n      __PYX_ERR(0, 1711, __pyx_L1_error)\n    }\n    __pyx_t_14 = __pyx_v_osymbols->_table;\n  }\n\n  /* \"pywrapfst.pyx\":1712\n *         self._fst.get().OutputSymbols() if osymbols is None\n *         else osymbols._table,\n *         ssymbols_ptr, acceptor, show_weight_one, tostring(missing_sym))             # <<<<<<<<<<<<<<\n *     return sstrm.str()\n * \n */\n  __pyx_t_9 = __pyx_f_9pywrapfst_tostring(__pyx_v_missing_sym, NULL); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 1712, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":1707\n *       ssymbols_ptr = ssymbols._table\n *     cdef stringstream sstrm\n *     fst.PrintFst(deref(self._fst), sstrm, b\"<pywrapfst>\",             # <<<<<<<<<<<<<<\n *         self._fst.get().InputSymbols() if isymbols is None\n *         else isymbols._table,\n */\n  fst::script::PrintFst((*__pyx_v_self->_fst), __pyx_v_sstrm, __pyx_k_pywrapfst, __pyx_t_13, __pyx_t_14, __pyx_v_ssymbols_ptr, __pyx_v_acceptor, __pyx_v_show_weight_one, __pyx_t_9);\n\n  /* \"pywrapfst.pyx\":1713\n *         else osymbols._table,\n *         ssymbols_ptr, acceptor, show_weight_one, tostring(missing_sym))\n *     return sstrm.str()             # <<<<<<<<<<<<<<\n * \n *   cpdef bool verify(self):\n */\n  __pyx_r = __pyx_v_sstrm.str();\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":1678\n *     return StateIterator(self)\n * \n *   cpdef string text(self, _SymbolTable isymbols=None,             # <<<<<<<<<<<<<<\n *       _SymbolTable osymbols=None, _SymbolTable ssymbols=None,\n *       bool acceptor=False, bool show_weight_one=False, missing_sym=b\"\"):\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_XDECREF(__pyx_t_6);\n  __Pyx_XDECREF(__pyx_t_8);\n  __Pyx_WriteUnraisable(\"pywrapfst._Fst.text\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __Pyx_pretend_to_initialize(&__pyx_r);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_39text(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic char __pyx_doc_9pywrapfst_4_Fst_38text[] = \"\\n    text(self, isymbols=None, osymbols=None, ssymbols=None, acceptor=False,\\n         show_weight_one=False, missing_sym=\\\"\\\")\\n\\n    Produces a human-readable string representation of the FST.\\n\\n    This method generates a human-readable string representation of the FST.\\n    The caller may optionally specify SymbolTables used to label input labels,\\n    output labels, or state labels, respectively.\\n\\n    Args:\\n      isymbols: An optional symbol table used to label input symbols.\\n      osymbols: An optional symbol table used to label output symbols.\\n      ssymbols: An optional symbol table used to label states.\\n      acceptor: Should the FST be rendered in acceptor format if possible?\\n      show_weight_one: Should weights equivalent to semiring One be printed?\\n      missing_symbol: The string to be printed when symbol table lookup fails.\\n\\n    Returns:\\n      A formatted string representing the machine.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_39text(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_isymbols = 0;\n  struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_osymbols = 0;\n  struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_ssymbols = 0;\n  bool __pyx_v_acceptor;\n  bool __pyx_v_show_weight_one;\n  PyObject *__pyx_v_missing_sym = 0;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"text (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_isymbols,&__pyx_n_s_osymbols,&__pyx_n_s_ssymbols,&__pyx_n_s_acceptor,&__pyx_n_s_show_weight_one,&__pyx_n_s_missing_sym,0};\n    PyObject* values[6] = {0,0,0,0,0,0};\n    values[0] = (PyObject *)((struct __pyx_obj_9pywrapfst__SymbolTable *)Py_None);\n\n    /* \"pywrapfst.pyx\":1679\n * \n *   cpdef string text(self, _SymbolTable isymbols=None,\n *       _SymbolTable osymbols=None, _SymbolTable ssymbols=None,             # <<<<<<<<<<<<<<\n *       bool acceptor=False, bool show_weight_one=False, missing_sym=b\"\"):\n *     \"\"\"\n */\n    values[1] = (PyObject *)((struct __pyx_obj_9pywrapfst__SymbolTable *)Py_None);\n    values[2] = (PyObject *)((struct __pyx_obj_9pywrapfst__SymbolTable *)Py_None);\n    values[5] = ((PyObject *)__pyx_kp_b__24);\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  6: values[5] = PyTuple_GET_ITEM(__pyx_args, 5);\n        CYTHON_FALLTHROUGH;\n        case  5: values[4] = PyTuple_GET_ITEM(__pyx_args, 4);\n        CYTHON_FALLTHROUGH;\n        case  4: values[3] = PyTuple_GET_ITEM(__pyx_args, 3);\n        CYTHON_FALLTHROUGH;\n        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);\n        CYTHON_FALLTHROUGH;\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_isymbols);\n          if (value) { values[0] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  1:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_osymbols);\n          if (value) { values[1] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  2:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_ssymbols);\n          if (value) { values[2] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  3:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_acceptor);\n          if (value) { values[3] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  4:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_show_weight_one);\n          if (value) { values[4] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  5:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_missing_sym);\n          if (value) { values[5] = value; kw_args--; }\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"text\") < 0)) __PYX_ERR(0, 1678, __pyx_L3_error)\n      }\n    } else {\n      switch (PyTuple_GET_SIZE(__pyx_args)) {\n        case  6: values[5] = PyTuple_GET_ITEM(__pyx_args, 5);\n        CYTHON_FALLTHROUGH;\n        case  5: values[4] = PyTuple_GET_ITEM(__pyx_args, 4);\n        CYTHON_FALLTHROUGH;\n        case  4: values[3] = PyTuple_GET_ITEM(__pyx_args, 3);\n        CYTHON_FALLTHROUGH;\n        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);\n        CYTHON_FALLTHROUGH;\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n    }\n    __pyx_v_isymbols = ((struct __pyx_obj_9pywrapfst__SymbolTable *)values[0]);\n    __pyx_v_osymbols = ((struct __pyx_obj_9pywrapfst__SymbolTable *)values[1]);\n    __pyx_v_ssymbols = ((struct __pyx_obj_9pywrapfst__SymbolTable *)values[2]);\n    if (values[3]) {\n      __pyx_v_acceptor = __Pyx_PyObject_IsTrue(values[3]); if (unlikely((__pyx_v_acceptor == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 1680, __pyx_L3_error)\n    } else {\n\n      /* \"pywrapfst.pyx\":1680\n *   cpdef string text(self, _SymbolTable isymbols=None,\n *       _SymbolTable osymbols=None, _SymbolTable ssymbols=None,\n *       bool acceptor=False, bool show_weight_one=False, missing_sym=b\"\"):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     text(self, isymbols=None, osymbols=None, ssymbols=None, acceptor=False,\n */\n      __pyx_v_acceptor = ((bool)0);\n    }\n    if (values[4]) {\n      __pyx_v_show_weight_one = __Pyx_PyObject_IsTrue(values[4]); if (unlikely((__pyx_v_show_weight_one == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 1680, __pyx_L3_error)\n    } else {\n      __pyx_v_show_weight_one = ((bool)0);\n    }\n    __pyx_v_missing_sym = values[5];\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"text\", 0, 0, 6, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 1678, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst._Fst.text\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_isymbols), __pyx_ptype_9pywrapfst__SymbolTable, 1, \"isymbols\", 0))) __PYX_ERR(0, 1678, __pyx_L1_error)\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_osymbols), __pyx_ptype_9pywrapfst__SymbolTable, 1, \"osymbols\", 0))) __PYX_ERR(0, 1679, __pyx_L1_error)\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_ssymbols), __pyx_ptype_9pywrapfst__SymbolTable, 1, \"ssymbols\", 0))) __PYX_ERR(0, 1679, __pyx_L1_error)\n  __pyx_r = __pyx_pf_9pywrapfst_4_Fst_38text(((struct __pyx_obj_9pywrapfst__Fst *)__pyx_v_self), __pyx_v_isymbols, __pyx_v_osymbols, __pyx_v_ssymbols, __pyx_v_acceptor, __pyx_v_show_weight_one, __pyx_v_missing_sym);\n\n  /* \"pywrapfst.pyx\":1678\n *     return StateIterator(self)\n * \n *   cpdef string text(self, _SymbolTable isymbols=None,             # <<<<<<<<<<<<<<\n *       _SymbolTable osymbols=None, _SymbolTable ssymbols=None,\n *       bool acceptor=False, bool show_weight_one=False, missing_sym=b\"\"):\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_4_Fst_38text(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self, struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_isymbols, struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_osymbols, struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_ssymbols, bool __pyx_v_acceptor, bool __pyx_v_show_weight_one, PyObject *__pyx_v_missing_sym) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  std::string __pyx_t_1;\n  struct __pyx_opt_args_9pywrapfst_4_Fst_text __pyx_t_2;\n  PyObject *__pyx_t_3 = NULL;\n  __Pyx_RefNannySetupContext(\"text\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_2.__pyx_n = 6;\n  __pyx_t_2.isymbols = __pyx_v_isymbols;\n  __pyx_t_2.osymbols = __pyx_v_osymbols;\n  __pyx_t_2.ssymbols = __pyx_v_ssymbols;\n  __pyx_t_2.acceptor = __pyx_v_acceptor;\n  __pyx_t_2.show_weight_one = __pyx_v_show_weight_one;\n  __pyx_t_2.missing_sym = __pyx_v_missing_sym;\n  __pyx_t_1 = __pyx_vtabptr_9pywrapfst__Fst->text(__pyx_v_self, 1, &__pyx_t_2); \n  __pyx_t_3 = __pyx_convert_PyBytes_string_to_py_std__in_string(__pyx_t_1); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 1678, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_3);\n  __pyx_r = __pyx_t_3;\n  __pyx_t_3 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_AddTraceback(\"pywrapfst._Fst.text\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1715\n *     return sstrm.str()\n * \n *   cpdef bool verify(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     verify(self)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_41verify(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic bool __pyx_f_9pywrapfst_4_Fst_verify(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self, int __pyx_skip_dispatch) {\n  bool __pyx_r;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  bool __pyx_t_5;\n  __Pyx_RefNannySetupContext(\"verify\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_verify); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1715, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_4_Fst_41verify)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1715, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1715, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __pyx_t_5 = __Pyx_PyObject_IsTrue(__pyx_t_2); if (unlikely((__pyx_t_5 == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 1715, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __pyx_r = __pyx_t_5;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":1724\n *       True if the contents are sane, False otherwise.\n *     \"\"\"\n *     return fst.Verify(deref(self._fst))             # <<<<<<<<<<<<<<\n * \n *   cpdef string weight_type(self):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 1724, __pyx_L1_error)\n  }\n  __pyx_r = fst::script::Verify((*__pyx_v_self->_fst));\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":1715\n *     return sstrm.str()\n * \n *   cpdef bool verify(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     verify(self)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_WriteUnraisable(\"pywrapfst._Fst.verify\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_41verify(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_4_Fst_40verify[] = \"\\n    verify(self)\\n\\n    Verifies that an FST's contents are sane.\\n\\n    Returns:\\n      True if the contents are sane, False otherwise.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_41verify(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"verify (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_4_Fst_40verify(((struct __pyx_obj_9pywrapfst__Fst *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_4_Fst_40verify(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"verify\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __Pyx_PyBool_FromLong(__pyx_f_9pywrapfst_4_Fst_verify(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1715, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst._Fst.verify\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1726\n *     return fst.Verify(deref(self._fst))\n * \n *   cpdef string weight_type(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     weight_type(self)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_43weight_type(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic std::string __pyx_f_9pywrapfst_4_Fst_weight_type(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self, int __pyx_skip_dispatch) {\n  std::string __pyx_r;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  std::string __pyx_t_5;\n  __Pyx_RefNannySetupContext(\"weight_type\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_weight_type); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1726, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_4_Fst_43weight_type)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1726, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1726, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __pyx_t_5 = __pyx_convert_string_from_py_std__in_string(__pyx_t_2); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 1726, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __pyx_r = __pyx_t_5;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":1735\n *       A string representing the weight type.\n *     \"\"\"\n *     return self._fst.get().WeightType()             # <<<<<<<<<<<<<<\n * \n *   cpdef void write(self, filename) except *:\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 1735, __pyx_L1_error)\n  }\n  __pyx_r = __pyx_v_self->_fst.get()->WeightType();\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":1726\n *     return fst.Verify(deref(self._fst))\n * \n *   cpdef string weight_type(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     weight_type(self)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_WriteUnraisable(\"pywrapfst._Fst.weight_type\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __Pyx_pretend_to_initialize(&__pyx_r);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_43weight_type(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_4_Fst_42weight_type[] = \"\\n    weight_type(self)\\n\\n    Provides the FST's weight type.\\n\\n    Returns:\\n      A string representing the weight type.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_43weight_type(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"weight_type (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_4_Fst_42weight_type(((struct __pyx_obj_9pywrapfst__Fst *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_4_Fst_42weight_type(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"weight_type\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __pyx_convert_PyBytes_string_to_py_std__in_string(__pyx_f_9pywrapfst_4_Fst_weight_type(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1726, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst._Fst.weight_type\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1737\n *     return self._fst.get().WeightType()\n * \n *   cpdef void write(self, filename) except *:             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     write(self, filename)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_45write(PyObject *__pyx_v_self, PyObject *__pyx_v_filename); /*proto*/\nstatic void __pyx_f_9pywrapfst_4_Fst_write(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self, PyObject *__pyx_v_filename, int __pyx_skip_dispatch) {\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  std::string __pyx_t_6;\n  int __pyx_t_7;\n  PyObject *__pyx_t_8 = NULL;\n  __Pyx_RefNannySetupContext(\"write\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_write); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1737, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_4_Fst_45write)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (!__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_v_filename); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1737, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_2);\n      } else {\n        #if CYTHON_FAST_PYCALL\n        if (PyFunction_Check(__pyx_t_3)) {\n          PyObject *__pyx_temp[2] = {__pyx_t_4, __pyx_v_filename};\n          __pyx_t_2 = __Pyx_PyFunction_FastCall(__pyx_t_3, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1737, __pyx_L1_error)\n          __Pyx_XDECREF(__pyx_t_4); __pyx_t_4 = 0;\n          __Pyx_GOTREF(__pyx_t_2);\n        } else\n        #endif\n        #if CYTHON_FAST_PYCCALL\n        if (__Pyx_PyFastCFunction_Check(__pyx_t_3)) {\n          PyObject *__pyx_temp[2] = {__pyx_t_4, __pyx_v_filename};\n          __pyx_t_2 = __Pyx_PyCFunction_FastCall(__pyx_t_3, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1737, __pyx_L1_error)\n          __Pyx_XDECREF(__pyx_t_4); __pyx_t_4 = 0;\n          __Pyx_GOTREF(__pyx_t_2);\n        } else\n        #endif\n        {\n          __pyx_t_5 = PyTuple_New(1+1); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 1737, __pyx_L1_error)\n          __Pyx_GOTREF(__pyx_t_5);\n          __Pyx_GIVEREF(__pyx_t_4); PyTuple_SET_ITEM(__pyx_t_5, 0, __pyx_t_4); __pyx_t_4 = NULL;\n          __Pyx_INCREF(__pyx_v_filename);\n          __Pyx_GIVEREF(__pyx_v_filename);\n          PyTuple_SET_ITEM(__pyx_t_5, 0+1, __pyx_v_filename);\n          __pyx_t_2 = __Pyx_PyObject_Call(__pyx_t_3, __pyx_t_5, NULL); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1737, __pyx_L1_error)\n          __Pyx_GOTREF(__pyx_t_2);\n          __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n        }\n      }\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":1751\n *       FstIOError: Write failed.\n *     \"\"\"\n *     if not self._fst.get().Write(tostring(filename)):             # <<<<<<<<<<<<<<\n *       raise FstIOError(\"Write failed: {!r}\".format(filename))\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 1751, __pyx_L1_error)\n  }\n  __pyx_t_6 = __pyx_f_9pywrapfst_tostring(__pyx_v_filename, NULL); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 1751, __pyx_L1_error)\n  __pyx_t_7 = ((!(__pyx_v_self->_fst.get()->Write(__pyx_t_6) != 0)) != 0);\n  if (unlikely(__pyx_t_7)) {\n\n    /* \"pywrapfst.pyx\":1752\n *     \"\"\"\n *     if not self._fst.get().Write(tostring(filename)):\n *       raise FstIOError(\"Write failed: {!r}\".format(filename))             # <<<<<<<<<<<<<<\n * \n *   cpdef string write_to_string(self):\n */\n    __pyx_t_2 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstIOError); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1752, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_2);\n    __pyx_t_5 = __Pyx_PyObject_GetAttrStr(__pyx_kp_s_Write_failed_r, __pyx_n_s_format); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 1752, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_5);\n    __pyx_t_4 = NULL;\n    if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_5))) {\n      __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_5);\n      if (likely(__pyx_t_4)) {\n        PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_5);\n        __Pyx_INCREF(__pyx_t_4);\n        __Pyx_INCREF(function);\n        __Pyx_DECREF_SET(__pyx_t_5, function);\n      }\n    }\n    if (!__pyx_t_4) {\n      __pyx_t_3 = __Pyx_PyObject_CallOneArg(__pyx_t_5, __pyx_v_filename); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 1752, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_3);\n    } else {\n      #if CYTHON_FAST_PYCALL\n      if (PyFunction_Check(__pyx_t_5)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_4, __pyx_v_filename};\n        __pyx_t_3 = __Pyx_PyFunction_FastCall(__pyx_t_5, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 1752, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_4); __pyx_t_4 = 0;\n        __Pyx_GOTREF(__pyx_t_3);\n      } else\n      #endif\n      #if CYTHON_FAST_PYCCALL\n      if (__Pyx_PyFastCFunction_Check(__pyx_t_5)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_4, __pyx_v_filename};\n        __pyx_t_3 = __Pyx_PyCFunction_FastCall(__pyx_t_5, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 1752, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_4); __pyx_t_4 = 0;\n        __Pyx_GOTREF(__pyx_t_3);\n      } else\n      #endif\n      {\n        __pyx_t_8 = PyTuple_New(1+1); if (unlikely(!__pyx_t_8)) __PYX_ERR(0, 1752, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_8);\n        __Pyx_GIVEREF(__pyx_t_4); PyTuple_SET_ITEM(__pyx_t_8, 0, __pyx_t_4); __pyx_t_4 = NULL;\n        __Pyx_INCREF(__pyx_v_filename);\n        __Pyx_GIVEREF(__pyx_v_filename);\n        PyTuple_SET_ITEM(__pyx_t_8, 0+1, __pyx_v_filename);\n        __pyx_t_3 = __Pyx_PyObject_Call(__pyx_t_5, __pyx_t_8, NULL); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 1752, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_3);\n        __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0;\n      }\n    }\n    __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n    __pyx_t_5 = NULL;\n    if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_2))) {\n      __pyx_t_5 = PyMethod_GET_SELF(__pyx_t_2);\n      if (likely(__pyx_t_5)) {\n        PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_2);\n        __Pyx_INCREF(__pyx_t_5);\n        __Pyx_INCREF(function);\n        __Pyx_DECREF_SET(__pyx_t_2, function);\n      }\n    }\n    if (!__pyx_t_5) {\n      __pyx_t_1 = __Pyx_PyObject_CallOneArg(__pyx_t_2, __pyx_t_3); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1752, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __Pyx_GOTREF(__pyx_t_1);\n    } else {\n      #if CYTHON_FAST_PYCALL\n      if (PyFunction_Check(__pyx_t_2)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_5, __pyx_t_3};\n        __pyx_t_1 = __Pyx_PyFunction_FastCall(__pyx_t_2, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1752, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;\n        __Pyx_GOTREF(__pyx_t_1);\n        __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      } else\n      #endif\n      #if CYTHON_FAST_PYCCALL\n      if (__Pyx_PyFastCFunction_Check(__pyx_t_2)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_5, __pyx_t_3};\n        __pyx_t_1 = __Pyx_PyCFunction_FastCall(__pyx_t_2, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1752, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;\n        __Pyx_GOTREF(__pyx_t_1);\n        __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      } else\n      #endif\n      {\n        __pyx_t_8 = PyTuple_New(1+1); if (unlikely(!__pyx_t_8)) __PYX_ERR(0, 1752, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_8);\n        __Pyx_GIVEREF(__pyx_t_5); PyTuple_SET_ITEM(__pyx_t_8, 0, __pyx_t_5); __pyx_t_5 = NULL;\n        __Pyx_GIVEREF(__pyx_t_3);\n        PyTuple_SET_ITEM(__pyx_t_8, 0+1, __pyx_t_3);\n        __pyx_t_3 = 0;\n        __pyx_t_1 = __Pyx_PyObject_Call(__pyx_t_2, __pyx_t_8, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1752, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_1);\n        __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0;\n      }\n    }\n    __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n    __Pyx_Raise(__pyx_t_1, 0, 0, 0);\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n    __PYX_ERR(0, 1752, __pyx_L1_error)\n\n    /* \"pywrapfst.pyx\":1751\n *       FstIOError: Write failed.\n *     \"\"\"\n *     if not self._fst.get().Write(tostring(filename)):             # <<<<<<<<<<<<<<\n *       raise FstIOError(\"Write failed: {!r}\".format(filename))\n * \n */\n  }\n\n  /* \"pywrapfst.pyx\":1737\n *     return self._fst.get().WeightType()\n * \n *   cpdef void write(self, filename) except *:             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     write(self, filename)\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_XDECREF(__pyx_t_8);\n  __Pyx_AddTraceback(\"pywrapfst._Fst.write\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_45write(PyObject *__pyx_v_self, PyObject *__pyx_v_filename); /*proto*/\nstatic char __pyx_doc_9pywrapfst_4_Fst_44write[] = \"\\n    write(self, filename)\\n\\n    Serializes FST to a file.\\n\\n    This method writes the FST to a file in a binary format.\\n\\n    Args:\\n      filename: The string location of the output file.\\n\\n    Raises:\\n      FstIOError: Write failed.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_45write(PyObject *__pyx_v_self, PyObject *__pyx_v_filename) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"write (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_4_Fst_44write(((struct __pyx_obj_9pywrapfst__Fst *)__pyx_v_self), ((PyObject *)__pyx_v_filename));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_4_Fst_44write(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self, PyObject *__pyx_v_filename) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"write\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_f_9pywrapfst_4_Fst_write(__pyx_v_self, __pyx_v_filename, 1); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 1737, __pyx_L1_error)\n  __pyx_t_1 = __Pyx_void_to_None(NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1737, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst._Fst.write\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1754\n *       raise FstIOError(\"Write failed: {!r}\".format(filename))\n * \n *   cpdef string write_to_string(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     write_to_string(self)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_47write_to_string(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic std::string __pyx_f_9pywrapfst_4_Fst_write_to_string(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self, int __pyx_skip_dispatch) {\n  std::stringstream __pyx_v_sstrm;\n  std::string __pyx_r;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  std::string __pyx_t_5;\n  int __pyx_t_6;\n  __Pyx_RefNannySetupContext(\"write_to_string\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_write_to_string); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1754, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_4_Fst_47write_to_string)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1754, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1754, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __pyx_t_5 = __pyx_convert_string_from_py_std__in_string(__pyx_t_2); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 1754, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __pyx_r = __pyx_t_5;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":1769\n *     \"\"\"\n *     cdef stringstream sstrm\n *     if not self._fst.get().Write(sstrm, \"write_to_string\"):             # <<<<<<<<<<<<<<\n *       raise FstIOError(\"Write to string failed\")\n *     return sstrm.str()\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 1769, __pyx_L1_error)\n  }\n  __pyx_t_6 = ((!(__pyx_v_self->_fst.get()->Write(__pyx_v_sstrm, __pyx_k_write_to_string) != 0)) != 0);\n  if (unlikely(__pyx_t_6)) {\n\n    /* \"pywrapfst.pyx\":1770\n *     cdef stringstream sstrm\n *     if not self._fst.get().Write(sstrm, \"write_to_string\"):\n *       raise FstIOError(\"Write to string failed\")             # <<<<<<<<<<<<<<\n *     return sstrm.str()\n * \n */\n    __pyx_t_1 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstIOError); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1770, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    __pyx_t_2 = __Pyx_PyObject_Call(__pyx_t_1, __pyx_tuple__29, NULL); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1770, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_2);\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n    __Pyx_Raise(__pyx_t_2, 0, 0, 0);\n    __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n    __PYX_ERR(0, 1770, __pyx_L1_error)\n\n    /* \"pywrapfst.pyx\":1769\n *     \"\"\"\n *     cdef stringstream sstrm\n *     if not self._fst.get().Write(sstrm, \"write_to_string\"):             # <<<<<<<<<<<<<<\n *       raise FstIOError(\"Write to string failed\")\n *     return sstrm.str()\n */\n  }\n\n  /* \"pywrapfst.pyx\":1771\n *     if not self._fst.get().Write(sstrm, \"write_to_string\"):\n *       raise FstIOError(\"Write to string failed\")\n *     return sstrm.str()             # <<<<<<<<<<<<<<\n * \n * \n */\n  __pyx_r = __pyx_v_sstrm.str();\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":1754\n *       raise FstIOError(\"Write failed: {!r}\".format(filename))\n * \n *   cpdef string write_to_string(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     write_to_string(self)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_WriteUnraisable(\"pywrapfst._Fst.write_to_string\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __Pyx_pretend_to_initialize(&__pyx_r);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_47write_to_string(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_4_Fst_46write_to_string[] = \"\\n    write_to_string(self)\\n\\n    Serializes FST to a string.\\n\\n    Returns:\\n      A string.\\n\\n    Raises:\\n      FstIOError: Write to string failed.\\n\\n    See also: `read_from_string`.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_4_Fst_47write_to_string(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"write_to_string (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_4_Fst_46write_to_string(((struct __pyx_obj_9pywrapfst__Fst *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_4_Fst_46write_to_string(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"write_to_string\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __pyx_convert_PyBytes_string_to_py_std__in_string(__pyx_f_9pywrapfst_4_Fst_write_to_string(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1754, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst._Fst.write_to_string\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1784\n *   \"\"\"\n * \n *   cdef void _check_mutating_imethod(self) except *:             # <<<<<<<<<<<<<<\n *     \"\"\"Checks whether an operation mutating the FST has produced an error.\n * \n */\n\nstatic void __pyx_f_9pywrapfst_11_MutableFst__check_mutating_imethod(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self) {\n  __Pyx_RefNannyDeclarations\n  int __pyx_t_1;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  __Pyx_RefNannySetupContext(\"_check_mutating_imethod\", 0);\n\n  /* \"pywrapfst.pyx\":1789\n *     This function is not visible to Python users.\n *     \"\"\"\n *     if self._fst.get().Properties(fst.kError, True) == fst.kError:             # <<<<<<<<<<<<<<\n *       raise FstOpError(\"Operation failed\")\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 1789, __pyx_L1_error)\n  }\n  __pyx_t_1 = ((__pyx_v_self->__pyx_base._fst.get()->Properties(fst::kError, 1) == fst::kError) != 0);\n  if (unlikely(__pyx_t_1)) {\n\n    /* \"pywrapfst.pyx\":1790\n *     \"\"\"\n *     if self._fst.get().Properties(fst.kError, True) == fst.kError:\n *       raise FstOpError(\"Operation failed\")             # <<<<<<<<<<<<<<\n * \n *   cdef void _add_arc(self, int64 state, Arc arc) except *:\n */\n    __pyx_t_2 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstOpError); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1790, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_2);\n    __pyx_t_3 = __Pyx_PyObject_Call(__pyx_t_2, __pyx_tuple__30, NULL); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 1790, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_3);\n    __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n    __Pyx_Raise(__pyx_t_3, 0, 0, 0);\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    __PYX_ERR(0, 1790, __pyx_L1_error)\n\n    /* \"pywrapfst.pyx\":1789\n *     This function is not visible to Python users.\n *     \"\"\"\n *     if self._fst.get().Properties(fst.kError, True) == fst.kError:             # <<<<<<<<<<<<<<\n *       raise FstOpError(\"Operation failed\")\n * \n */\n  }\n\n  /* \"pywrapfst.pyx\":1784\n *   \"\"\"\n * \n *   cdef void _check_mutating_imethod(self) except *:             # <<<<<<<<<<<<<<\n *     \"\"\"Checks whether an operation mutating the FST has produced an error.\n * \n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst._check_mutating_imethod\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n}\n\n/* \"pywrapfst.pyx\":1792\n *       raise FstOpError(\"Operation failed\")\n * \n *   cdef void _add_arc(self, int64 state, Arc arc) except *:             # <<<<<<<<<<<<<<\n *     if not self._fst.get().ValidStateId(state):\n *       raise FstIndexError(\"State index out of range\")\n */\n\nstatic void __pyx_f_9pywrapfst_11_MutableFst__add_arc(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, __pyx_t_10basictypes_int64 __pyx_v_state, struct __pyx_obj_9pywrapfst_Arc *__pyx_v_arc) {\n  __Pyx_RefNannyDeclarations\n  int __pyx_t_1;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  __Pyx_RefNannySetupContext(\"_add_arc\", 0);\n\n  /* \"pywrapfst.pyx\":1793\n * \n *   cdef void _add_arc(self, int64 state, Arc arc) except *:\n *     if not self._fst.get().ValidStateId(state):             # <<<<<<<<<<<<<<\n *       raise FstIndexError(\"State index out of range\")\n *     if not self._mfst.get().AddArc(state, deref(arc._arc)):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 1793, __pyx_L1_error)\n  }\n  __pyx_t_1 = ((!(__pyx_v_self->__pyx_base._fst.get()->ValidStateId(__pyx_v_state) != 0)) != 0);\n  if (unlikely(__pyx_t_1)) {\n\n    /* \"pywrapfst.pyx\":1794\n *   cdef void _add_arc(self, int64 state, Arc arc) except *:\n *     if not self._fst.get().ValidStateId(state):\n *       raise FstIndexError(\"State index out of range\")             # <<<<<<<<<<<<<<\n *     if not self._mfst.get().AddArc(state, deref(arc._arc)):\n *       raise FstOpError(\"Incompatible or invalid weight type\")\n */\n    __pyx_t_2 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstIndexError); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1794, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_2);\n    __pyx_t_3 = __Pyx_PyObject_Call(__pyx_t_2, __pyx_tuple__31, NULL); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 1794, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_3);\n    __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n    __Pyx_Raise(__pyx_t_3, 0, 0, 0);\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    __PYX_ERR(0, 1794, __pyx_L1_error)\n\n    /* \"pywrapfst.pyx\":1793\n * \n *   cdef void _add_arc(self, int64 state, Arc arc) except *:\n *     if not self._fst.get().ValidStateId(state):             # <<<<<<<<<<<<<<\n *       raise FstIndexError(\"State index out of range\")\n *     if not self._mfst.get().AddArc(state, deref(arc._arc)):\n */\n  }\n\n  /* \"pywrapfst.pyx\":1795\n *     if not self._fst.get().ValidStateId(state):\n *       raise FstIndexError(\"State index out of range\")\n *     if not self._mfst.get().AddArc(state, deref(arc._arc)):             # <<<<<<<<<<<<<<\n *       raise FstOpError(\"Incompatible or invalid weight type\")\n *     self._check_mutating_imethod()\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_mfst\");\n    __PYX_ERR(0, 1795, __pyx_L1_error)\n  }\n  if (unlikely(((PyObject *)__pyx_v_arc) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_arc\");\n    __PYX_ERR(0, 1795, __pyx_L1_error)\n  }\n  __pyx_t_1 = ((!(__pyx_v_self->_mfst.get()->AddArc(__pyx_v_state, (*__pyx_v_arc->_arc)) != 0)) != 0);\n  if (unlikely(__pyx_t_1)) {\n\n    /* \"pywrapfst.pyx\":1796\n *       raise FstIndexError(\"State index out of range\")\n *     if not self._mfst.get().AddArc(state, deref(arc._arc)):\n *       raise FstOpError(\"Incompatible or invalid weight type\")             # <<<<<<<<<<<<<<\n *     self._check_mutating_imethod()\n * \n */\n    __pyx_t_3 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstOpError); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 1796, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_3);\n    __pyx_t_2 = __Pyx_PyObject_Call(__pyx_t_3, __pyx_tuple__32, NULL); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1796, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_2);\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    __Pyx_Raise(__pyx_t_2, 0, 0, 0);\n    __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n    __PYX_ERR(0, 1796, __pyx_L1_error)\n\n    /* \"pywrapfst.pyx\":1795\n *     if not self._fst.get().ValidStateId(state):\n *       raise FstIndexError(\"State index out of range\")\n *     if not self._mfst.get().AddArc(state, deref(arc._arc)):             # <<<<<<<<<<<<<<\n *       raise FstOpError(\"Incompatible or invalid weight type\")\n *     self._check_mutating_imethod()\n */\n  }\n\n  /* \"pywrapfst.pyx\":1797\n *     if not self._mfst.get().AddArc(state, deref(arc._arc)):\n *       raise FstOpError(\"Incompatible or invalid weight type\")\n *     self._check_mutating_imethod()             # <<<<<<<<<<<<<<\n * \n *   def add_arc(self, int64 state, Arc arc):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_check_mutating_imethod\");\n    __PYX_ERR(0, 1797, __pyx_L1_error)\n  }\n  ((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->_check_mutating_imethod(__pyx_v_self); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 1797, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":1792\n *       raise FstOpError(\"Operation failed\")\n * \n *   cdef void _add_arc(self, int64 state, Arc arc) except *:             # <<<<<<<<<<<<<<\n *     if not self._fst.get().ValidStateId(state):\n *       raise FstIndexError(\"State index out of range\")\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst._add_arc\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n}\n\n/* \"pywrapfst.pyx\":1799\n *     self._check_mutating_imethod()\n * \n *   def add_arc(self, int64 state, Arc arc):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     add_arc(self, state, arc)\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_1add_arc(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic char __pyx_doc_9pywrapfst_11_MutableFst_add_arc[] = \"\\n    add_arc(self, state, arc)\\n\\n    Adds a new arc to the FST and return self.\\n\\n    Args:\\n      state: The integer index of the source state.\\n      arc: The arc to add.\\n\\n    Returns:\\n      self.\\n\\n    Raises:\\n      FstIndexError: State index out of range.\\n      FstOpdexError: Incompatible or invalid weight type.\\n\\n    See also: `add_state`.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_1add_arc(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  __pyx_t_10basictypes_int64 __pyx_v_state;\n  struct __pyx_obj_9pywrapfst_Arc *__pyx_v_arc = 0;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"add_arc (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_state,&__pyx_n_s_arc,0};\n    PyObject* values[2] = {0,0};\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (likely((values[0] = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_state)) != 0)) kw_args--;\n        else goto __pyx_L5_argtuple_error;\n        CYTHON_FALLTHROUGH;\n        case  1:\n        if (likely((values[1] = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_arc)) != 0)) kw_args--;\n        else {\n          __Pyx_RaiseArgtupleInvalid(\"add_arc\", 1, 2, 2, 1); __PYX_ERR(0, 1799, __pyx_L3_error)\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"add_arc\") < 0)) __PYX_ERR(0, 1799, __pyx_L3_error)\n      }\n    } else if (PyTuple_GET_SIZE(__pyx_args) != 2) {\n      goto __pyx_L5_argtuple_error;\n    } else {\n      values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n      values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n    }\n    __pyx_v_state = __Pyx_PyInt_As_int64_t(values[0]); if (unlikely((__pyx_v_state == ((int64_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 1799, __pyx_L3_error)\n    __pyx_v_arc = ((struct __pyx_obj_9pywrapfst_Arc *)values[1]);\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"add_arc\", 1, 2, 2, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 1799, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst.add_arc\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_arc), __pyx_ptype_9pywrapfst_Arc, 1, \"arc\", 0))) __PYX_ERR(0, 1799, __pyx_L1_error)\n  __pyx_r = __pyx_pf_9pywrapfst_11_MutableFst_add_arc(((struct __pyx_obj_9pywrapfst__MutableFst *)__pyx_v_self), __pyx_v_state, __pyx_v_arc);\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_add_arc(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, __pyx_t_10basictypes_int64 __pyx_v_state, struct __pyx_obj_9pywrapfst_Arc *__pyx_v_arc) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"add_arc\", 0);\n\n  /* \"pywrapfst.pyx\":1818\n *     See also: `add_state`.\n *     \"\"\"\n *     self._add_arc(state, arc)             # <<<<<<<<<<<<<<\n *     return self\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_add_arc\");\n    __PYX_ERR(0, 1818, __pyx_L1_error)\n  }\n  ((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->_add_arc(__pyx_v_self, __pyx_v_state, __pyx_v_arc); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 1818, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":1819\n *     \"\"\"\n *     self._add_arc(state, arc)\n *     return self             # <<<<<<<<<<<<<<\n * \n *   cpdef int64 add_state(self) except *:\n */\n  __Pyx_XDECREF(__pyx_r);\n  __Pyx_INCREF(((PyObject *)__pyx_v_self));\n  __pyx_r = ((PyObject *)__pyx_v_self);\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":1799\n *     self._check_mutating_imethod()\n * \n *   def add_arc(self, int64 state, Arc arc):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     add_arc(self, state, arc)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst.add_arc\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1821\n *     return self\n * \n *   cpdef int64 add_state(self) except *:             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     add_state(self)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_3add_state(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic __pyx_t_10basictypes_int64 __pyx_f_9pywrapfst_11_MutableFst_add_state(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, int __pyx_skip_dispatch) {\n  __pyx_t_10basictypes_int64 __pyx_v_result;\n  __pyx_t_10basictypes_int64 __pyx_r;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  __pyx_t_10basictypes_int64 __pyx_t_5;\n  __Pyx_RefNannySetupContext(\"add_state\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_add_state); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1821, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_11_MutableFst_3add_state)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1821, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1821, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __pyx_t_5 = __Pyx_PyInt_As_int64_t(__pyx_t_2); if (unlikely((__pyx_t_5 == ((int64_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 1821, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __pyx_r = __pyx_t_5;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":1832\n *     See also: `add_arc`, `set_start`, `set_final`.\n *     \"\"\"\n *     cdef int64 result = self._mfst.get().AddState()             # <<<<<<<<<<<<<<\n *     self._check_mutating_imethod()\n *     return result\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_mfst\");\n    __PYX_ERR(0, 1832, __pyx_L1_error)\n  }\n  __pyx_v_result = __pyx_v_self->_mfst.get()->AddState();\n\n  /* \"pywrapfst.pyx\":1833\n *     \"\"\"\n *     cdef int64 result = self._mfst.get().AddState()\n *     self._check_mutating_imethod()             # <<<<<<<<<<<<<<\n *     return result\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_check_mutating_imethod\");\n    __PYX_ERR(0, 1833, __pyx_L1_error)\n  }\n  ((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->_check_mutating_imethod(__pyx_v_self); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 1833, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":1834\n *     cdef int64 result = self._mfst.get().AddState()\n *     self._check_mutating_imethod()\n *     return result             # <<<<<<<<<<<<<<\n * \n *   cdef void _arcsort(self, sort_type=b\"ilabel\") except *:\n */\n  __pyx_r = __pyx_v_result;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":1821\n *     return self\n * \n *   cpdef int64 add_state(self) except *:             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     add_state(self)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst.add_state\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_3add_state(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_11_MutableFst_2add_state[] = \"\\n    add_state(self)\\n\\n    Adds a new state to the FST and returns the state ID.\\n\\n    Returns:\\n      The integer index of the new state.\\n\\n    See also: `add_arc`, `set_start`, `set_final`.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_3add_state(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"add_state (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_11_MutableFst_2add_state(((struct __pyx_obj_9pywrapfst__MutableFst *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_2add_state(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  __pyx_t_10basictypes_int64 __pyx_t_1;\n  PyObject *__pyx_t_2 = NULL;\n  __Pyx_RefNannySetupContext(\"add_state\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __pyx_f_9pywrapfst_11_MutableFst_add_state(__pyx_v_self, 1); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 1821, __pyx_L1_error)\n  __pyx_t_2 = __Pyx_PyInt_From_int64_t(__pyx_t_1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1821, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  __pyx_r = __pyx_t_2;\n  __pyx_t_2 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst.add_state\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1836\n *     return result\n * \n *   cdef void _arcsort(self, sort_type=b\"ilabel\") except *:             # <<<<<<<<<<<<<<\n *     cdef fst.ArcSortType sort_type_enum\n *     if not fst.GetArcSortType(tostring(sort_type), addr(sort_type_enum)):\n */\n\nstatic void __pyx_f_9pywrapfst_11_MutableFst__arcsort(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, struct __pyx_opt_args_9pywrapfst_11_MutableFst__arcsort *__pyx_optional_args) {\n  PyObject *__pyx_v_sort_type = ((PyObject *)__pyx_n_b_ilabel);\n  enum fst::script::ArcSortType __pyx_v_sort_type_enum;\n  __Pyx_RefNannyDeclarations\n  std::string __pyx_t_1;\n  int __pyx_t_2;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  PyObject *__pyx_t_6 = NULL;\n  PyObject *__pyx_t_7 = NULL;\n  PyObject *__pyx_t_8 = NULL;\n  __Pyx_RefNannySetupContext(\"_arcsort\", 0);\n  if (__pyx_optional_args) {\n    if (__pyx_optional_args->__pyx_n > 0) {\n      __pyx_v_sort_type = __pyx_optional_args->sort_type;\n    }\n  }\n\n  /* \"pywrapfst.pyx\":1838\n *   cdef void _arcsort(self, sort_type=b\"ilabel\") except *:\n *     cdef fst.ArcSortType sort_type_enum\n *     if not fst.GetArcSortType(tostring(sort_type), addr(sort_type_enum)):             # <<<<<<<<<<<<<<\n *       raise FstArgError(\"Unknown sort type {!r}\".format(sort_type))\n *     fst.ArcSort(self._mfst.get(), sort_type_enum)\n */\n  __pyx_t_1 = __pyx_f_9pywrapfst_tostring(__pyx_v_sort_type, NULL); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 1838, __pyx_L1_error)\n  __pyx_t_2 = ((!(fst::script::GetArcSortType(__pyx_t_1, (&__pyx_v_sort_type_enum)) != 0)) != 0);\n  if (unlikely(__pyx_t_2)) {\n\n    /* \"pywrapfst.pyx\":1839\n *     cdef fst.ArcSortType sort_type_enum\n *     if not fst.GetArcSortType(tostring(sort_type), addr(sort_type_enum)):\n *       raise FstArgError(\"Unknown sort type {!r}\".format(sort_type))             # <<<<<<<<<<<<<<\n *     fst.ArcSort(self._mfst.get(), sort_type_enum)\n *     self._check_mutating_imethod()\n */\n    __pyx_t_4 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstArgError); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 1839, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_4);\n    __pyx_t_6 = __Pyx_PyObject_GetAttrStr(__pyx_kp_s_Unknown_sort_type_r, __pyx_n_s_format); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 1839, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_6);\n    __pyx_t_7 = NULL;\n    if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_6))) {\n      __pyx_t_7 = PyMethod_GET_SELF(__pyx_t_6);\n      if (likely(__pyx_t_7)) {\n        PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_6);\n        __Pyx_INCREF(__pyx_t_7);\n        __Pyx_INCREF(function);\n        __Pyx_DECREF_SET(__pyx_t_6, function);\n      }\n    }\n    if (!__pyx_t_7) {\n      __pyx_t_5 = __Pyx_PyObject_CallOneArg(__pyx_t_6, __pyx_v_sort_type); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 1839, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_5);\n    } else {\n      #if CYTHON_FAST_PYCALL\n      if (PyFunction_Check(__pyx_t_6)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_7, __pyx_v_sort_type};\n        __pyx_t_5 = __Pyx_PyFunction_FastCall(__pyx_t_6, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 1839, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_7); __pyx_t_7 = 0;\n        __Pyx_GOTREF(__pyx_t_5);\n      } else\n      #endif\n      #if CYTHON_FAST_PYCCALL\n      if (__Pyx_PyFastCFunction_Check(__pyx_t_6)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_7, __pyx_v_sort_type};\n        __pyx_t_5 = __Pyx_PyCFunction_FastCall(__pyx_t_6, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 1839, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_7); __pyx_t_7 = 0;\n        __Pyx_GOTREF(__pyx_t_5);\n      } else\n      #endif\n      {\n        __pyx_t_8 = PyTuple_New(1+1); if (unlikely(!__pyx_t_8)) __PYX_ERR(0, 1839, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_8);\n        __Pyx_GIVEREF(__pyx_t_7); PyTuple_SET_ITEM(__pyx_t_8, 0, __pyx_t_7); __pyx_t_7 = NULL;\n        __Pyx_INCREF(__pyx_v_sort_type);\n        __Pyx_GIVEREF(__pyx_v_sort_type);\n        PyTuple_SET_ITEM(__pyx_t_8, 0+1, __pyx_v_sort_type);\n        __pyx_t_5 = __Pyx_PyObject_Call(__pyx_t_6, __pyx_t_8, NULL); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 1839, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_5);\n        __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0;\n      }\n    }\n    __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n    __pyx_t_6 = NULL;\n    if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_4))) {\n      __pyx_t_6 = PyMethod_GET_SELF(__pyx_t_4);\n      if (likely(__pyx_t_6)) {\n        PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_4);\n        __Pyx_INCREF(__pyx_t_6);\n        __Pyx_INCREF(function);\n        __Pyx_DECREF_SET(__pyx_t_4, function);\n      }\n    }\n    if (!__pyx_t_6) {\n      __pyx_t_3 = __Pyx_PyObject_CallOneArg(__pyx_t_4, __pyx_t_5); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 1839, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n      __Pyx_GOTREF(__pyx_t_3);\n    } else {\n      #if CYTHON_FAST_PYCALL\n      if (PyFunction_Check(__pyx_t_4)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_6, __pyx_t_5};\n        __pyx_t_3 = __Pyx_PyFunction_FastCall(__pyx_t_4, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 1839, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_6); __pyx_t_6 = 0;\n        __Pyx_GOTREF(__pyx_t_3);\n        __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n      } else\n      #endif\n      #if CYTHON_FAST_PYCCALL\n      if (__Pyx_PyFastCFunction_Check(__pyx_t_4)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_6, __pyx_t_5};\n        __pyx_t_3 = __Pyx_PyCFunction_FastCall(__pyx_t_4, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 1839, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_6); __pyx_t_6 = 0;\n        __Pyx_GOTREF(__pyx_t_3);\n        __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n      } else\n      #endif\n      {\n        __pyx_t_8 = PyTuple_New(1+1); if (unlikely(!__pyx_t_8)) __PYX_ERR(0, 1839, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_8);\n        __Pyx_GIVEREF(__pyx_t_6); PyTuple_SET_ITEM(__pyx_t_8, 0, __pyx_t_6); __pyx_t_6 = NULL;\n        __Pyx_GIVEREF(__pyx_t_5);\n        PyTuple_SET_ITEM(__pyx_t_8, 0+1, __pyx_t_5);\n        __pyx_t_5 = 0;\n        __pyx_t_3 = __Pyx_PyObject_Call(__pyx_t_4, __pyx_t_8, NULL); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 1839, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_3);\n        __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0;\n      }\n    }\n    __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n    __Pyx_Raise(__pyx_t_3, 0, 0, 0);\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    __PYX_ERR(0, 1839, __pyx_L1_error)\n\n    /* \"pywrapfst.pyx\":1838\n *   cdef void _arcsort(self, sort_type=b\"ilabel\") except *:\n *     cdef fst.ArcSortType sort_type_enum\n *     if not fst.GetArcSortType(tostring(sort_type), addr(sort_type_enum)):             # <<<<<<<<<<<<<<\n *       raise FstArgError(\"Unknown sort type {!r}\".format(sort_type))\n *     fst.ArcSort(self._mfst.get(), sort_type_enum)\n */\n  }\n\n  /* \"pywrapfst.pyx\":1840\n *     if not fst.GetArcSortType(tostring(sort_type), addr(sort_type_enum)):\n *       raise FstArgError(\"Unknown sort type {!r}\".format(sort_type))\n *     fst.ArcSort(self._mfst.get(), sort_type_enum)             # <<<<<<<<<<<<<<\n *     self._check_mutating_imethod()\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_mfst\");\n    __PYX_ERR(0, 1840, __pyx_L1_error)\n  }\n  fst::script::ArcSort(__pyx_v_self->_mfst.get(), __pyx_v_sort_type_enum);\n\n  /* \"pywrapfst.pyx\":1841\n *       raise FstArgError(\"Unknown sort type {!r}\".format(sort_type))\n *     fst.ArcSort(self._mfst.get(), sort_type_enum)\n *     self._check_mutating_imethod()             # <<<<<<<<<<<<<<\n * \n *   def arcsort(self, sort_type=b\"ilabel\"):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_check_mutating_imethod\");\n    __PYX_ERR(0, 1841, __pyx_L1_error)\n  }\n  ((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->_check_mutating_imethod(__pyx_v_self); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 1841, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":1836\n *     return result\n * \n *   cdef void _arcsort(self, sort_type=b\"ilabel\") except *:             # <<<<<<<<<<<<<<\n *     cdef fst.ArcSortType sort_type_enum\n *     if not fst.GetArcSortType(tostring(sort_type), addr(sort_type_enum)):\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_XDECREF(__pyx_t_6);\n  __Pyx_XDECREF(__pyx_t_7);\n  __Pyx_XDECREF(__pyx_t_8);\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst._arcsort\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n}\n\n/* \"pywrapfst.pyx\":1843\n *     self._check_mutating_imethod()\n * \n *   def arcsort(self, sort_type=b\"ilabel\"):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     arcsort(self, sort_type=\"ilabel\")\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_5arcsort(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic char __pyx_doc_9pywrapfst_11_MutableFst_4arcsort[] = \"\\n    arcsort(self, sort_type=\\\"ilabel\\\")\\n\\n    Sorts arcs leaving each state of the FST.\\n\\n    This operation destructively sorts arcs leaving each state using either\\n    input or output labels.\\n\\n    Args:\\n      sort_type: Either \\\"ilabel\\\" (sort arcs according to input labels) or\\n          \\\"olabel\\\" (sort arcs according to output labels).\\n\\n    Returns:\\n      self.\\n\\n    Raises:\\n      FstArgError: Unknown sort type.\\n\\n    See also: `topsort`.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_5arcsort(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  PyObject *__pyx_v_sort_type = 0;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"arcsort (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_sort_type,0};\n    PyObject* values[1] = {0};\n    values[0] = ((PyObject *)__pyx_n_b_ilabel);\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_sort_type);\n          if (value) { values[0] = value; kw_args--; }\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"arcsort\") < 0)) __PYX_ERR(0, 1843, __pyx_L3_error)\n      }\n    } else {\n      switch (PyTuple_GET_SIZE(__pyx_args)) {\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n    }\n    __pyx_v_sort_type = values[0];\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"arcsort\", 0, 0, 1, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 1843, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst.arcsort\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  __pyx_r = __pyx_pf_9pywrapfst_11_MutableFst_4arcsort(((struct __pyx_obj_9pywrapfst__MutableFst *)__pyx_v_self), __pyx_v_sort_type);\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_4arcsort(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, PyObject *__pyx_v_sort_type) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  struct __pyx_opt_args_9pywrapfst_11_MutableFst__arcsort __pyx_t_1;\n  __Pyx_RefNannySetupContext(\"arcsort\", 0);\n\n  /* \"pywrapfst.pyx\":1864\n *     See also: `topsort`.\n *     \"\"\"\n *     self._arcsort(sort_type)             # <<<<<<<<<<<<<<\n *     return self\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_arcsort\");\n    __PYX_ERR(0, 1864, __pyx_L1_error)\n  }\n  __pyx_t_1.__pyx_n = 1;\n  __pyx_t_1.sort_type = __pyx_v_sort_type;\n  ((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->_arcsort(__pyx_v_self, &__pyx_t_1); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 1864, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":1865\n *     \"\"\"\n *     self._arcsort(sort_type)\n *     return self             # <<<<<<<<<<<<<<\n * \n *   cdef void _closure(self, bool closure_plus=False) except *:\n */\n  __Pyx_XDECREF(__pyx_r);\n  __Pyx_INCREF(((PyObject *)__pyx_v_self));\n  __pyx_r = ((PyObject *)__pyx_v_self);\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":1843\n *     self._check_mutating_imethod()\n * \n *   def arcsort(self, sort_type=b\"ilabel\"):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     arcsort(self, sort_type=\"ilabel\")\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst.arcsort\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1867\n *     return self\n * \n *   cdef void _closure(self, bool closure_plus=False) except *:             # <<<<<<<<<<<<<<\n *     fst.Closure(self._mfst.get(), fst.GetClosureType(closure_plus))\n *     self._check_mutating_imethod()\n */\n\nstatic void __pyx_f_9pywrapfst_11_MutableFst__closure(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, struct __pyx_opt_args_9pywrapfst_11_MutableFst__closure *__pyx_optional_args) {\n  bool __pyx_v_closure_plus = ((bool)0);\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"_closure\", 0);\n  if (__pyx_optional_args) {\n    if (__pyx_optional_args->__pyx_n > 0) {\n      __pyx_v_closure_plus = __pyx_optional_args->closure_plus;\n    }\n  }\n\n  /* \"pywrapfst.pyx\":1868\n * \n *   cdef void _closure(self, bool closure_plus=False) except *:\n *     fst.Closure(self._mfst.get(), fst.GetClosureType(closure_plus))             # <<<<<<<<<<<<<<\n *     self._check_mutating_imethod()\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_mfst\");\n    __PYX_ERR(0, 1868, __pyx_L1_error)\n  }\n  fst::script::Closure(__pyx_v_self->_mfst.get(), fst::script::GetClosureType(__pyx_v_closure_plus));\n\n  /* \"pywrapfst.pyx\":1869\n *   cdef void _closure(self, bool closure_plus=False) except *:\n *     fst.Closure(self._mfst.get(), fst.GetClosureType(closure_plus))\n *     self._check_mutating_imethod()             # <<<<<<<<<<<<<<\n * \n *   def closure(self, bool closure_plus=False):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_check_mutating_imethod\");\n    __PYX_ERR(0, 1869, __pyx_L1_error)\n  }\n  ((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->_check_mutating_imethod(__pyx_v_self); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 1869, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":1867\n *     return self\n * \n *   cdef void _closure(self, bool closure_plus=False) except *:             # <<<<<<<<<<<<<<\n *     fst.Closure(self._mfst.get(), fst.GetClosureType(closure_plus))\n *     self._check_mutating_imethod()\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst._closure\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n}\n\n/* \"pywrapfst.pyx\":1871\n *     self._check_mutating_imethod()\n * \n *   def closure(self, bool closure_plus=False):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     closure(self, closure_plus=False)\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_7closure(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic char __pyx_doc_9pywrapfst_11_MutableFst_6closure[] = \"\\n    closure(self, closure_plus=False)\\n\\n    Computes concatenative closure.\\n\\n    This operation destructively converts the FST to its concatenative closure.\\n    If A transduces string x to y with weight a, then the closure transduces x\\n    to y with weight a, xx to yy with weight a \\\\otimes a, xxx to yyy with weight\\n    a \\\\otimes a \\\\otimes a, and so on. The empty string is also transduced to\\n    itself with semiring One if `closure_plus` is False.\\n\\n    Args:\\n      closure_plus: If False, do not accept the empty string.\\n\\n    Returns:\\n      self.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_7closure(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  bool __pyx_v_closure_plus;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"closure (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_closure_plus,0};\n    PyObject* values[1] = {0};\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_closure_plus);\n          if (value) { values[0] = value; kw_args--; }\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"closure\") < 0)) __PYX_ERR(0, 1871, __pyx_L3_error)\n      }\n    } else {\n      switch (PyTuple_GET_SIZE(__pyx_args)) {\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n    }\n    if (values[0]) {\n      __pyx_v_closure_plus = __Pyx_PyObject_IsTrue(values[0]); if (unlikely((__pyx_v_closure_plus == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 1871, __pyx_L3_error)\n    } else {\n      __pyx_v_closure_plus = ((bool)0);\n    }\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"closure\", 0, 0, 1, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 1871, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst.closure\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  __pyx_r = __pyx_pf_9pywrapfst_11_MutableFst_6closure(((struct __pyx_obj_9pywrapfst__MutableFst *)__pyx_v_self), __pyx_v_closure_plus);\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_6closure(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, bool __pyx_v_closure_plus) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  struct __pyx_opt_args_9pywrapfst_11_MutableFst__closure __pyx_t_1;\n  __Pyx_RefNannySetupContext(\"closure\", 0);\n\n  /* \"pywrapfst.pyx\":1889\n *       self.\n *     \"\"\"\n *     self._closure(closure_plus)             # <<<<<<<<<<<<<<\n *     return self\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_closure\");\n    __PYX_ERR(0, 1889, __pyx_L1_error)\n  }\n  __pyx_t_1.__pyx_n = 1;\n  __pyx_t_1.closure_plus = __pyx_v_closure_plus;\n  ((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->_closure(__pyx_v_self, &__pyx_t_1); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 1889, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":1890\n *     \"\"\"\n *     self._closure(closure_plus)\n *     return self             # <<<<<<<<<<<<<<\n * \n *   cdef void _concat(self, _Fst ifst) except *:\n */\n  __Pyx_XDECREF(__pyx_r);\n  __Pyx_INCREF(((PyObject *)__pyx_v_self));\n  __pyx_r = ((PyObject *)__pyx_v_self);\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":1871\n *     self._check_mutating_imethod()\n * \n *   def closure(self, bool closure_plus=False):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     closure(self, closure_plus=False)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst.closure\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1892\n *     return self\n * \n *   cdef void _concat(self, _Fst ifst) except *:             # <<<<<<<<<<<<<<\n *     fst.Concat(self._mfst.get(), deref(ifst._fst))\n *     self._check_mutating_imethod()\n */\n\nstatic void __pyx_f_9pywrapfst_11_MutableFst__concat(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst) {\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"_concat\", 0);\n\n  /* \"pywrapfst.pyx\":1893\n * \n *   cdef void _concat(self, _Fst ifst) except *:\n *     fst.Concat(self._mfst.get(), deref(ifst._fst))             # <<<<<<<<<<<<<<\n *     self._check_mutating_imethod()\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_mfst\");\n    __PYX_ERR(0, 1893, __pyx_L1_error)\n  }\n  if (unlikely(((PyObject *)__pyx_v_ifst) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 1893, __pyx_L1_error)\n  }\n  fst::script::Concat(__pyx_v_self->_mfst.get(), (*__pyx_v_ifst->_fst));\n\n  /* \"pywrapfst.pyx\":1894\n *   cdef void _concat(self, _Fst ifst) except *:\n *     fst.Concat(self._mfst.get(), deref(ifst._fst))\n *     self._check_mutating_imethod()             # <<<<<<<<<<<<<<\n * \n *   def concat(self, _Fst ifst):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_check_mutating_imethod\");\n    __PYX_ERR(0, 1894, __pyx_L1_error)\n  }\n  ((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->_check_mutating_imethod(__pyx_v_self); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 1894, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":1892\n *     return self\n * \n *   cdef void _concat(self, _Fst ifst) except *:             # <<<<<<<<<<<<<<\n *     fst.Concat(self._mfst.get(), deref(ifst._fst))\n *     self._check_mutating_imethod()\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst._concat\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n}\n\n/* \"pywrapfst.pyx\":1896\n *     self._check_mutating_imethod()\n * \n *   def concat(self, _Fst ifst):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     concat(self, ifst)\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_9concat(PyObject *__pyx_v_self, PyObject *__pyx_v_ifst); /*proto*/\nstatic char __pyx_doc_9pywrapfst_11_MutableFst_8concat[] = \"\\n    concat(self, ifst)\\n\\n    Computes the concatenation (product) of two FSTs.\\n\\n    This operation destructively concatenates the FST with a second FST. If A\\n    transduces string x to y with weight a and B transduces string w to v with\\n    weight b, then their concatenation transduces string xw to yv with weight a\\n    \\\\otimes b.\\n\\n    Args:\\n      ifst: The second input FST.\\n\\n    Returns:\\n      self.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_9concat(PyObject *__pyx_v_self, PyObject *__pyx_v_ifst) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"concat (wrapper)\", 0);\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_ifst), __pyx_ptype_9pywrapfst__Fst, 1, \"ifst\", 0))) __PYX_ERR(0, 1896, __pyx_L1_error)\n  __pyx_r = __pyx_pf_9pywrapfst_11_MutableFst_8concat(((struct __pyx_obj_9pywrapfst__MutableFst *)__pyx_v_self), ((struct __pyx_obj_9pywrapfst__Fst *)__pyx_v_ifst));\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_8concat(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"concat\", 0);\n\n  /* \"pywrapfst.pyx\":1913\n *       self.\n *     \"\"\"\n *     self._concat(ifst)             # <<<<<<<<<<<<<<\n *     return self\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_concat\");\n    __PYX_ERR(0, 1913, __pyx_L1_error)\n  }\n  ((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->_concat(__pyx_v_self, __pyx_v_ifst); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 1913, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":1914\n *     \"\"\"\n *     self._concat(ifst)\n *     return self             # <<<<<<<<<<<<<<\n * \n *   cdef void _connect(self) except *:\n */\n  __Pyx_XDECREF(__pyx_r);\n  __Pyx_INCREF(((PyObject *)__pyx_v_self));\n  __pyx_r = ((PyObject *)__pyx_v_self);\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":1896\n *     self._check_mutating_imethod()\n * \n *   def concat(self, _Fst ifst):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     concat(self, ifst)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst.concat\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1916\n *     return self\n * \n *   cdef void _connect(self) except *:             # <<<<<<<<<<<<<<\n *     fst.Connect(self._mfst.get())\n *     self._check_mutating_imethod()\n */\n\nstatic void __pyx_f_9pywrapfst_11_MutableFst__connect(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self) {\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"_connect\", 0);\n\n  /* \"pywrapfst.pyx\":1917\n * \n *   cdef void _connect(self) except *:\n *     fst.Connect(self._mfst.get())             # <<<<<<<<<<<<<<\n *     self._check_mutating_imethod()\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_mfst\");\n    __PYX_ERR(0, 1917, __pyx_L1_error)\n  }\n  fst::script::Connect(__pyx_v_self->_mfst.get());\n\n  /* \"pywrapfst.pyx\":1918\n *   cdef void _connect(self) except *:\n *     fst.Connect(self._mfst.get())\n *     self._check_mutating_imethod()             # <<<<<<<<<<<<<<\n * \n *   def connect(self):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_check_mutating_imethod\");\n    __PYX_ERR(0, 1918, __pyx_L1_error)\n  }\n  ((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->_check_mutating_imethod(__pyx_v_self); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 1918, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":1916\n *     return self\n * \n *   cdef void _connect(self) except *:             # <<<<<<<<<<<<<<\n *     fst.Connect(self._mfst.get())\n *     self._check_mutating_imethod()\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst._connect\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n}\n\n/* \"pywrapfst.pyx\":1920\n *     self._check_mutating_imethod()\n * \n *   def connect(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     connect(self)\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_11connect(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_11_MutableFst_10connect[] = \"\\n    connect(self)\\n\\n    Removes unsuccessful paths.\\n\\n    This operation destructively trims the FST, removing states and arcs that\\n    are not part of any successful path.\\n\\n    Returns:\\n      self.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_11connect(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"connect (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_11_MutableFst_10connect(((struct __pyx_obj_9pywrapfst__MutableFst *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_10connect(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"connect\", 0);\n\n  /* \"pywrapfst.pyx\":1932\n *       self.\n *     \"\"\"\n *     self._connect()             # <<<<<<<<<<<<<<\n *     return self\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_connect\");\n    __PYX_ERR(0, 1932, __pyx_L1_error)\n  }\n  ((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->_connect(__pyx_v_self); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 1932, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":1933\n *     \"\"\"\n *     self._connect()\n *     return self             # <<<<<<<<<<<<<<\n * \n *   cdef void _decode(self, EncodeMapper encoder) except *:\n */\n  __Pyx_XDECREF(__pyx_r);\n  __Pyx_INCREF(((PyObject *)__pyx_v_self));\n  __pyx_r = ((PyObject *)__pyx_v_self);\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":1920\n *     self._check_mutating_imethod()\n * \n *   def connect(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     connect(self)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst.connect\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1935\n *     return self\n * \n *   cdef void _decode(self, EncodeMapper encoder) except *:             # <<<<<<<<<<<<<<\n *     fst.Decode(self._mfst.get(), deref(encoder._encoder))\n *     self._check_mutating_imethod()\n */\n\nstatic void __pyx_f_9pywrapfst_11_MutableFst__decode(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, struct __pyx_obj_9pywrapfst_EncodeMapper *__pyx_v_encoder) {\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"_decode\", 0);\n\n  /* \"pywrapfst.pyx\":1936\n * \n *   cdef void _decode(self, EncodeMapper encoder) except *:\n *     fst.Decode(self._mfst.get(), deref(encoder._encoder))             # <<<<<<<<<<<<<<\n *     self._check_mutating_imethod()\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_mfst\");\n    __PYX_ERR(0, 1936, __pyx_L1_error)\n  }\n  if (unlikely(((PyObject *)__pyx_v_encoder) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_encoder\");\n    __PYX_ERR(0, 1936, __pyx_L1_error)\n  }\n  fst::script::Decode(__pyx_v_self->_mfst.get(), (*__pyx_v_encoder->_encoder));\n\n  /* \"pywrapfst.pyx\":1937\n *   cdef void _decode(self, EncodeMapper encoder) except *:\n *     fst.Decode(self._mfst.get(), deref(encoder._encoder))\n *     self._check_mutating_imethod()             # <<<<<<<<<<<<<<\n * \n *   def decode(self, EncodeMapper encoder):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_check_mutating_imethod\");\n    __PYX_ERR(0, 1937, __pyx_L1_error)\n  }\n  ((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->_check_mutating_imethod(__pyx_v_self); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 1937, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":1935\n *     return self\n * \n *   cdef void _decode(self, EncodeMapper encoder) except *:             # <<<<<<<<<<<<<<\n *     fst.Decode(self._mfst.get(), deref(encoder._encoder))\n *     self._check_mutating_imethod()\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst._decode\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n}\n\n/* \"pywrapfst.pyx\":1939\n *     self._check_mutating_imethod()\n * \n *   def decode(self, EncodeMapper encoder):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     decode(self, encoder)\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_13decode(PyObject *__pyx_v_self, PyObject *__pyx_v_encoder); /*proto*/\nstatic char __pyx_doc_9pywrapfst_11_MutableFst_12decode[] = \"\\n    decode(self, encoder)\\n\\n    Decodes encoded labels and/or weights.\\n\\n    This operation reverses the encoding performed by `encode`.\\n\\n    Args:\\n      encoder: An EncodeMapper object used to encode the FST.\\n\\n    Returns:\\n      self.\\n\\n    See also: `encode`.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_13decode(PyObject *__pyx_v_self, PyObject *__pyx_v_encoder) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"decode (wrapper)\", 0);\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_encoder), __pyx_ptype_9pywrapfst_EncodeMapper, 1, \"encoder\", 0))) __PYX_ERR(0, 1939, __pyx_L1_error)\n  __pyx_r = __pyx_pf_9pywrapfst_11_MutableFst_12decode(((struct __pyx_obj_9pywrapfst__MutableFst *)__pyx_v_self), ((struct __pyx_obj_9pywrapfst_EncodeMapper *)__pyx_v_encoder));\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_12decode(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, struct __pyx_obj_9pywrapfst_EncodeMapper *__pyx_v_encoder) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"decode\", 0);\n\n  /* \"pywrapfst.pyx\":1955\n *     See also: `encode`.\n *     \"\"\"\n *     self._decode(encoder)             # <<<<<<<<<<<<<<\n *     return self\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_decode\");\n    __PYX_ERR(0, 1955, __pyx_L1_error)\n  }\n  ((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->_decode(__pyx_v_self, __pyx_v_encoder); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 1955, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":1956\n *     \"\"\"\n *     self._decode(encoder)\n *     return self             # <<<<<<<<<<<<<<\n * \n *   cdef void _delete_arcs(self, int64 state, size_t n=0) except *:\n */\n  __Pyx_XDECREF(__pyx_r);\n  __Pyx_INCREF(((PyObject *)__pyx_v_self));\n  __pyx_r = ((PyObject *)__pyx_v_self);\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":1939\n *     self._check_mutating_imethod()\n * \n *   def decode(self, EncodeMapper encoder):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     decode(self, encoder)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst.decode\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1958\n *     return self\n * \n *   cdef void _delete_arcs(self, int64 state, size_t n=0) except *:             # <<<<<<<<<<<<<<\n *     if not (self._mfst.get().DeleteArcs(state, n) if n else\n *             self._mfst.get().DeleteArcs(state)):\n */\n\nstatic void __pyx_f_9pywrapfst_11_MutableFst__delete_arcs(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, __pyx_t_10basictypes_int64 __pyx_v_state, struct __pyx_opt_args_9pywrapfst_11_MutableFst__delete_arcs *__pyx_optional_args) {\n  size_t __pyx_v_n = ((size_t)0);\n  __Pyx_RefNannyDeclarations\n  bool __pyx_t_1;\n  int __pyx_t_2;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  __Pyx_RefNannySetupContext(\"_delete_arcs\", 0);\n  if (__pyx_optional_args) {\n    if (__pyx_optional_args->__pyx_n > 0) {\n      __pyx_v_n = __pyx_optional_args->n;\n    }\n  }\n\n  /* \"pywrapfst.pyx\":1959\n * \n *   cdef void _delete_arcs(self, int64 state, size_t n=0) except *:\n *     if not (self._mfst.get().DeleteArcs(state, n) if n else             # <<<<<<<<<<<<<<\n *             self._mfst.get().DeleteArcs(state)):\n *       raise FstIndexError(\"State index out of range\")\n */\n  if ((__pyx_v_n != 0)) {\n    if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n      PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_mfst\");\n      __PYX_ERR(0, 1959, __pyx_L1_error)\n    }\n    __pyx_t_1 = __pyx_v_self->_mfst.get()->DeleteArcs(__pyx_v_state, __pyx_v_n);\n  } else {\n\n    /* \"pywrapfst.pyx\":1960\n *   cdef void _delete_arcs(self, int64 state, size_t n=0) except *:\n *     if not (self._mfst.get().DeleteArcs(state, n) if n else\n *             self._mfst.get().DeleteArcs(state)):             # <<<<<<<<<<<<<<\n *       raise FstIndexError(\"State index out of range\")\n *     self._check_mutating_imethod()\n */\n    if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n      PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_mfst\");\n      __PYX_ERR(0, 1960, __pyx_L1_error)\n    }\n    __pyx_t_1 = __pyx_v_self->_mfst.get()->DeleteArcs(__pyx_v_state);\n  }\n\n  /* \"pywrapfst.pyx\":1959\n * \n *   cdef void _delete_arcs(self, int64 state, size_t n=0) except *:\n *     if not (self._mfst.get().DeleteArcs(state, n) if n else             # <<<<<<<<<<<<<<\n *             self._mfst.get().DeleteArcs(state)):\n *       raise FstIndexError(\"State index out of range\")\n */\n  __pyx_t_2 = ((!(__pyx_t_1 != 0)) != 0);\n  if (unlikely(__pyx_t_2)) {\n\n    /* \"pywrapfst.pyx\":1961\n *     if not (self._mfst.get().DeleteArcs(state, n) if n else\n *             self._mfst.get().DeleteArcs(state)):\n *       raise FstIndexError(\"State index out of range\")             # <<<<<<<<<<<<<<\n *     self._check_mutating_imethod()\n * \n */\n    __pyx_t_3 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstIndexError); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 1961, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_3);\n    __pyx_t_4 = __Pyx_PyObject_Call(__pyx_t_3, __pyx_tuple__33, NULL); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 1961, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_4);\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    __Pyx_Raise(__pyx_t_4, 0, 0, 0);\n    __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n    __PYX_ERR(0, 1961, __pyx_L1_error)\n\n    /* \"pywrapfst.pyx\":1959\n * \n *   cdef void _delete_arcs(self, int64 state, size_t n=0) except *:\n *     if not (self._mfst.get().DeleteArcs(state, n) if n else             # <<<<<<<<<<<<<<\n *             self._mfst.get().DeleteArcs(state)):\n *       raise FstIndexError(\"State index out of range\")\n */\n  }\n\n  /* \"pywrapfst.pyx\":1962\n *             self._mfst.get().DeleteArcs(state)):\n *       raise FstIndexError(\"State index out of range\")\n *     self._check_mutating_imethod()             # <<<<<<<<<<<<<<\n * \n *   def delete_arcs(self, int64 state, size_t n=0):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_check_mutating_imethod\");\n    __PYX_ERR(0, 1962, __pyx_L1_error)\n  }\n  ((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->_check_mutating_imethod(__pyx_v_self); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 1962, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":1958\n *     return self\n * \n *   cdef void _delete_arcs(self, int64 state, size_t n=0) except *:             # <<<<<<<<<<<<<<\n *     if not (self._mfst.get().DeleteArcs(state, n) if n else\n *             self._mfst.get().DeleteArcs(state)):\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst._delete_arcs\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n}\n\n/* \"pywrapfst.pyx\":1964\n *     self._check_mutating_imethod()\n * \n *   def delete_arcs(self, int64 state, size_t n=0):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     delete_arcs(self, state, n=0)\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_15delete_arcs(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic char __pyx_doc_9pywrapfst_11_MutableFst_14delete_arcs[] = \"\\n    delete_arcs(self, state, n=0)\\n\\n    Deletes arcs leaving a particular state.\\n\\n    Args:\\n      state: The integer index of a state.\\n      n: An optional argument indicating how many arcs to be deleted. If this\\n          argument is omitted or passed as zero, all arcs from this state are\\n          deleted.\\n\\n    Returns:\\n      self.\\n\\n    Raises:\\n      FstIndexError: State index out of range.\\n\\n    See also: `delete_states`.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_15delete_arcs(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  __pyx_t_10basictypes_int64 __pyx_v_state;\n  size_t __pyx_v_n;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"delete_arcs (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_state,&__pyx_n_s_n,0};\n    PyObject* values[2] = {0,0};\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (likely((values[0] = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_state)) != 0)) kw_args--;\n        else goto __pyx_L5_argtuple_error;\n        CYTHON_FALLTHROUGH;\n        case  1:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_n);\n          if (value) { values[1] = value; kw_args--; }\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"delete_arcs\") < 0)) __PYX_ERR(0, 1964, __pyx_L3_error)\n      }\n    } else {\n      switch (PyTuple_GET_SIZE(__pyx_args)) {\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n    }\n    __pyx_v_state = __Pyx_PyInt_As_int64_t(values[0]); if (unlikely((__pyx_v_state == ((int64_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 1964, __pyx_L3_error)\n    if (values[1]) {\n      __pyx_v_n = __Pyx_PyInt_As_size_t(values[1]); if (unlikely((__pyx_v_n == (size_t)-1) && PyErr_Occurred())) __PYX_ERR(0, 1964, __pyx_L3_error)\n    } else {\n      __pyx_v_n = ((size_t)0);\n    }\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"delete_arcs\", 0, 1, 2, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 1964, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst.delete_arcs\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  __pyx_r = __pyx_pf_9pywrapfst_11_MutableFst_14delete_arcs(((struct __pyx_obj_9pywrapfst__MutableFst *)__pyx_v_self), __pyx_v_state, __pyx_v_n);\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_14delete_arcs(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, __pyx_t_10basictypes_int64 __pyx_v_state, size_t __pyx_v_n) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  struct __pyx_opt_args_9pywrapfst_11_MutableFst__delete_arcs __pyx_t_1;\n  __Pyx_RefNannySetupContext(\"delete_arcs\", 0);\n\n  /* \"pywrapfst.pyx\":1984\n *     See also: `delete_states`.\n *     \"\"\"\n *     self._delete_arcs(state, n)             # <<<<<<<<<<<<<<\n *     return self\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_delete_arcs\");\n    __PYX_ERR(0, 1984, __pyx_L1_error)\n  }\n  __pyx_t_1.__pyx_n = 1;\n  __pyx_t_1.n = __pyx_v_n;\n  ((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->_delete_arcs(__pyx_v_self, __pyx_v_state, &__pyx_t_1); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 1984, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":1985\n *     \"\"\"\n *     self._delete_arcs(state, n)\n *     return self             # <<<<<<<<<<<<<<\n * \n *   cdef void _delete_states(self, states=None) except *:\n */\n  __Pyx_XDECREF(__pyx_r);\n  __Pyx_INCREF(((PyObject *)__pyx_v_self));\n  __pyx_r = ((PyObject *)__pyx_v_self);\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":1964\n *     self._check_mutating_imethod()\n * \n *   def delete_arcs(self, int64 state, size_t n=0):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     delete_arcs(self, state, n=0)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst.delete_arcs\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":1987\n *     return self\n * \n *   cdef void _delete_states(self, states=None) except *:             # <<<<<<<<<<<<<<\n *     # Only the former signature has a possible indexing failure.\n *     if states:\n */\n\nstatic void __pyx_f_9pywrapfst_11_MutableFst__delete_states(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, struct __pyx_opt_args_9pywrapfst_11_MutableFst__delete_states *__pyx_optional_args) {\n  PyObject *__pyx_v_states = ((PyObject *)Py_None);\n  __Pyx_RefNannyDeclarations\n  int __pyx_t_1;\n  std::vector<__pyx_t_10basictypes_int64>  __pyx_t_2;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  __Pyx_RefNannySetupContext(\"_delete_states\", 0);\n  if (__pyx_optional_args) {\n    if (__pyx_optional_args->__pyx_n > 0) {\n      __pyx_v_states = __pyx_optional_args->states;\n    }\n  }\n\n  /* \"pywrapfst.pyx\":1989\n *   cdef void _delete_states(self, states=None) except *:\n *     # Only the former signature has a possible indexing failure.\n *     if states:             # <<<<<<<<<<<<<<\n *       if not self._mfst.get().DeleteStates(<const vector[int64]> states):\n *         raise FstIndexError(\"State index out of range\")\n */\n  __pyx_t_1 = __Pyx_PyObject_IsTrue(__pyx_v_states); if (unlikely(__pyx_t_1 < 0)) __PYX_ERR(0, 1989, __pyx_L1_error)\n  if (__pyx_t_1) {\n\n    /* \"pywrapfst.pyx\":1990\n *     # Only the former signature has a possible indexing failure.\n *     if states:\n *       if not self._mfst.get().DeleteStates(<const vector[int64]> states):             # <<<<<<<<<<<<<<\n *         raise FstIndexError(\"State index out of range\")\n *     else:\n */\n    if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n      PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_mfst\");\n      __PYX_ERR(0, 1990, __pyx_L1_error)\n    }\n    __pyx_t_2 = __pyx_convert_vector_from_py___pyx_t_10basictypes_int64(__pyx_v_states); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 1990, __pyx_L1_error)\n    __pyx_t_1 = ((!(__pyx_v_self->_mfst.get()->DeleteStates(((std::vector<__pyx_t_10basictypes_int64>  const )__pyx_t_2)) != 0)) != 0);\n    if (unlikely(__pyx_t_1)) {\n\n      /* \"pywrapfst.pyx\":1991\n *     if states:\n *       if not self._mfst.get().DeleteStates(<const vector[int64]> states):\n *         raise FstIndexError(\"State index out of range\")             # <<<<<<<<<<<<<<\n *     else:\n *       self._mfst.get().DeleteStates()\n */\n      __pyx_t_3 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstIndexError); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 1991, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_3);\n      __pyx_t_4 = __Pyx_PyObject_Call(__pyx_t_3, __pyx_tuple__34, NULL); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 1991, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_4);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __Pyx_Raise(__pyx_t_4, 0, 0, 0);\n      __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      __PYX_ERR(0, 1991, __pyx_L1_error)\n\n      /* \"pywrapfst.pyx\":1990\n *     # Only the former signature has a possible indexing failure.\n *     if states:\n *       if not self._mfst.get().DeleteStates(<const vector[int64]> states):             # <<<<<<<<<<<<<<\n *         raise FstIndexError(\"State index out of range\")\n *     else:\n */\n    }\n\n    /* \"pywrapfst.pyx\":1989\n *   cdef void _delete_states(self, states=None) except *:\n *     # Only the former signature has a possible indexing failure.\n *     if states:             # <<<<<<<<<<<<<<\n *       if not self._mfst.get().DeleteStates(<const vector[int64]> states):\n *         raise FstIndexError(\"State index out of range\")\n */\n    goto __pyx_L3;\n  }\n\n  /* \"pywrapfst.pyx\":1993\n *         raise FstIndexError(\"State index out of range\")\n *     else:\n *       self._mfst.get().DeleteStates()             # <<<<<<<<<<<<<<\n *     self._check_mutating_imethod()\n * \n */\n  /*else*/ {\n    if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n      PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_mfst\");\n      __PYX_ERR(0, 1993, __pyx_L1_error)\n    }\n    __pyx_v_self->_mfst.get()->DeleteStates();\n  }\n  __pyx_L3:;\n\n  /* \"pywrapfst.pyx\":1994\n *     else:\n *       self._mfst.get().DeleteStates()\n *     self._check_mutating_imethod()             # <<<<<<<<<<<<<<\n * \n *   def delete_states(self, states=None):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_check_mutating_imethod\");\n    __PYX_ERR(0, 1994, __pyx_L1_error)\n  }\n  ((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->_check_mutating_imethod(__pyx_v_self); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 1994, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":1987\n *     return self\n * \n *   cdef void _delete_states(self, states=None) except *:             # <<<<<<<<<<<<<<\n *     # Only the former signature has a possible indexing failure.\n *     if states:\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst._delete_states\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n}\n\n/* \"pywrapfst.pyx\":1996\n *     self._check_mutating_imethod()\n * \n *   def delete_states(self, states=None):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     delete_states(self, states=None)\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_17delete_states(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic char __pyx_doc_9pywrapfst_11_MutableFst_16delete_states[] = \"\\n    delete_states(self, states=None)\\n\\n    Deletes states.\\n\\n    Args:\\n      states: An optional iterable of integer indices of the states to be\\n          deleted. If this argument is omitted, all states are deleted.\\n\\n    Returns:\\n      self.\\n\\n    Raises:\\n      FstIndexError: State index out of range.\\n\\n    See also: `delete_arcs`.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_17delete_states(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  PyObject *__pyx_v_states = 0;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"delete_states (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_states,0};\n    PyObject* values[1] = {0};\n    values[0] = ((PyObject *)Py_None);\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_states);\n          if (value) { values[0] = value; kw_args--; }\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"delete_states\") < 0)) __PYX_ERR(0, 1996, __pyx_L3_error)\n      }\n    } else {\n      switch (PyTuple_GET_SIZE(__pyx_args)) {\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n    }\n    __pyx_v_states = values[0];\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"delete_states\", 0, 0, 1, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 1996, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst.delete_states\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  __pyx_r = __pyx_pf_9pywrapfst_11_MutableFst_16delete_states(((struct __pyx_obj_9pywrapfst__MutableFst *)__pyx_v_self), __pyx_v_states);\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_16delete_states(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, PyObject *__pyx_v_states) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  struct __pyx_opt_args_9pywrapfst_11_MutableFst__delete_states __pyx_t_1;\n  __Pyx_RefNannySetupContext(\"delete_states\", 0);\n\n  /* \"pywrapfst.pyx\":2014\n *     See also: `delete_arcs`.\n *     \"\"\"\n *     self._delete_states(states)             # <<<<<<<<<<<<<<\n *     return self\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_delete_states\");\n    __PYX_ERR(0, 2014, __pyx_L1_error)\n  }\n  __pyx_t_1.__pyx_n = 1;\n  __pyx_t_1.states = __pyx_v_states;\n  ((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->_delete_states(__pyx_v_self, &__pyx_t_1); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 2014, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":2015\n *     \"\"\"\n *     self._delete_states(states)\n *     return self             # <<<<<<<<<<<<<<\n * \n *   cdef void _encode(self, EncodeMapper encoder) except *:\n */\n  __Pyx_XDECREF(__pyx_r);\n  __Pyx_INCREF(((PyObject *)__pyx_v_self));\n  __pyx_r = ((PyObject *)__pyx_v_self);\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":1996\n *     self._check_mutating_imethod()\n * \n *   def delete_states(self, states=None):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     delete_states(self, states=None)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst.delete_states\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":2017\n *     return self\n * \n *   cdef void _encode(self, EncodeMapper encoder) except *:             # <<<<<<<<<<<<<<\n *     fst.Encode(self._mfst.get(), encoder._encoder.get())\n *     self._check_mutating_imethod()\n */\n\nstatic void __pyx_f_9pywrapfst_11_MutableFst__encode(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, struct __pyx_obj_9pywrapfst_EncodeMapper *__pyx_v_encoder) {\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"_encode\", 0);\n\n  /* \"pywrapfst.pyx\":2018\n * \n *   cdef void _encode(self, EncodeMapper encoder) except *:\n *     fst.Encode(self._mfst.get(), encoder._encoder.get())             # <<<<<<<<<<<<<<\n *     self._check_mutating_imethod()\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_mfst\");\n    __PYX_ERR(0, 2018, __pyx_L1_error)\n  }\n  if (unlikely(((PyObject *)__pyx_v_encoder) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_encoder\");\n    __PYX_ERR(0, 2018, __pyx_L1_error)\n  }\n  fst::script::Encode(__pyx_v_self->_mfst.get(), __pyx_v_encoder->_encoder.get());\n\n  /* \"pywrapfst.pyx\":2019\n *   cdef void _encode(self, EncodeMapper encoder) except *:\n *     fst.Encode(self._mfst.get(), encoder._encoder.get())\n *     self._check_mutating_imethod()             # <<<<<<<<<<<<<<\n * \n *   def encode(self, EncodeMapper encoder):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_check_mutating_imethod\");\n    __PYX_ERR(0, 2019, __pyx_L1_error)\n  }\n  ((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->_check_mutating_imethod(__pyx_v_self); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 2019, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":2017\n *     return self\n * \n *   cdef void _encode(self, EncodeMapper encoder) except *:             # <<<<<<<<<<<<<<\n *     fst.Encode(self._mfst.get(), encoder._encoder.get())\n *     self._check_mutating_imethod()\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst._encode\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n}\n\n/* \"pywrapfst.pyx\":2021\n *     self._check_mutating_imethod()\n * \n *   def encode(self, EncodeMapper encoder):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     encode(self, encoder)\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_19encode(PyObject *__pyx_v_self, PyObject *__pyx_v_encoder); /*proto*/\nstatic char __pyx_doc_9pywrapfst_11_MutableFst_18encode[] = \"\\n    encode(self, encoder)\\n\\n    Encodes labels and/or weights.\\n\\n    This operation allows for the representation of a weighted transducer as a\\n    weighted acceptor, an unweighted transducer, or an unweighted acceptor by\\n    considering the pair (input label, output label), the pair (input label,\\n    weight), or the triple (input label, output label, weight) as a single\\n    label. Applying this operation mutates the EncodeMapper argument, which\\n    can then be used to decode.\\n\\n    Args:\\n      encoder: An EncodeMapper object to be used as the encoder.\\n\\n    Returns:\\n      self.\\n\\n    See also: `decode`.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_19encode(PyObject *__pyx_v_self, PyObject *__pyx_v_encoder) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"encode (wrapper)\", 0);\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_encoder), __pyx_ptype_9pywrapfst_EncodeMapper, 1, \"encoder\", 0))) __PYX_ERR(0, 2021, __pyx_L1_error)\n  __pyx_r = __pyx_pf_9pywrapfst_11_MutableFst_18encode(((struct __pyx_obj_9pywrapfst__MutableFst *)__pyx_v_self), ((struct __pyx_obj_9pywrapfst_EncodeMapper *)__pyx_v_encoder));\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_18encode(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, struct __pyx_obj_9pywrapfst_EncodeMapper *__pyx_v_encoder) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"encode\", 0);\n\n  /* \"pywrapfst.pyx\":2042\n *     See also: `decode`.\n *     \"\"\"\n *     self._encode(encoder)             # <<<<<<<<<<<<<<\n *     return self\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_encode\");\n    __PYX_ERR(0, 2042, __pyx_L1_error)\n  }\n  ((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->_encode(__pyx_v_self, __pyx_v_encoder); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 2042, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":2043\n *     \"\"\"\n *     self._encode(encoder)\n *     return self             # <<<<<<<<<<<<<<\n * \n *   cdef void _invert(self) except *:\n */\n  __Pyx_XDECREF(__pyx_r);\n  __Pyx_INCREF(((PyObject *)__pyx_v_self));\n  __pyx_r = ((PyObject *)__pyx_v_self);\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":2021\n *     self._check_mutating_imethod()\n * \n *   def encode(self, EncodeMapper encoder):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     encode(self, encoder)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst.encode\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":2045\n *     return self\n * \n *   cdef void _invert(self) except *:             # <<<<<<<<<<<<<<\n *     fst.Invert(self._mfst.get())\n *     self._check_mutating_imethod()\n */\n\nstatic void __pyx_f_9pywrapfst_11_MutableFst__invert(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self) {\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"_invert\", 0);\n\n  /* \"pywrapfst.pyx\":2046\n * \n *   cdef void _invert(self) except *:\n *     fst.Invert(self._mfst.get())             # <<<<<<<<<<<<<<\n *     self._check_mutating_imethod()\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_mfst\");\n    __PYX_ERR(0, 2046, __pyx_L1_error)\n  }\n  fst::script::Invert(__pyx_v_self->_mfst.get());\n\n  /* \"pywrapfst.pyx\":2047\n *   cdef void _invert(self) except *:\n *     fst.Invert(self._mfst.get())\n *     self._check_mutating_imethod()             # <<<<<<<<<<<<<<\n * \n *   def invert(self):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_check_mutating_imethod\");\n    __PYX_ERR(0, 2047, __pyx_L1_error)\n  }\n  ((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->_check_mutating_imethod(__pyx_v_self); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 2047, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":2045\n *     return self\n * \n *   cdef void _invert(self) except *:             # <<<<<<<<<<<<<<\n *     fst.Invert(self._mfst.get())\n *     self._check_mutating_imethod()\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst._invert\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n}\n\n/* \"pywrapfst.pyx\":2049\n *     self._check_mutating_imethod()\n * \n *   def invert(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     invert(self)\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_21invert(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_11_MutableFst_20invert[] = \"\\n    invert(self)\\n\\n    Inverts the FST's transduction.\\n\\n    This operation destructively inverts the FST's transduction by exchanging\\n    input and output labels.\\n\\n    Returns:\\n      self.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_21invert(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"invert (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_11_MutableFst_20invert(((struct __pyx_obj_9pywrapfst__MutableFst *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_20invert(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"invert\", 0);\n\n  /* \"pywrapfst.pyx\":2061\n *       self.\n *     \"\"\"\n *     self._invert()             # <<<<<<<<<<<<<<\n *     return self\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_invert\");\n    __PYX_ERR(0, 2061, __pyx_L1_error)\n  }\n  ((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->_invert(__pyx_v_self); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 2061, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":2062\n *     \"\"\"\n *     self._invert()\n *     return self             # <<<<<<<<<<<<<<\n * \n *   cdef void _minimize(self, float delta=fst.kShortestDelta,\n */\n  __Pyx_XDECREF(__pyx_r);\n  __Pyx_INCREF(((PyObject *)__pyx_v_self));\n  __pyx_r = ((PyObject *)__pyx_v_self);\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":2049\n *     self._check_mutating_imethod()\n * \n *   def invert(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     invert(self)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst.invert\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":2064\n *     return self\n * \n *   cdef void _minimize(self, float delta=fst.kShortestDelta,             # <<<<<<<<<<<<<<\n *                       bool allow_nondet=False) except *:\n *     # This runs in-place when the second argument is null.\n */\n\nstatic void __pyx_f_9pywrapfst_11_MutableFst__minimize(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, struct __pyx_opt_args_9pywrapfst_11_MutableFst__minimize *__pyx_optional_args) {\n  float __pyx_v_delta = __pyx_k__35;\n\n  /* \"pywrapfst.pyx\":2065\n * \n *   cdef void _minimize(self, float delta=fst.kShortestDelta,\n *                       bool allow_nondet=False) except *:             # <<<<<<<<<<<<<<\n *     # This runs in-place when the second argument is null.\n *     fst.Minimize(self._mfst.get(), NULL, delta, allow_nondet)\n */\n  bool __pyx_v_allow_nondet = ((bool)0);\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"_minimize\", 0);\n  if (__pyx_optional_args) {\n    if (__pyx_optional_args->__pyx_n > 0) {\n      __pyx_v_delta = __pyx_optional_args->delta;\n      if (__pyx_optional_args->__pyx_n > 1) {\n        __pyx_v_allow_nondet = __pyx_optional_args->allow_nondet;\n      }\n    }\n  }\n\n  /* \"pywrapfst.pyx\":2067\n *                       bool allow_nondet=False) except *:\n *     # This runs in-place when the second argument is null.\n *     fst.Minimize(self._mfst.get(), NULL, delta, allow_nondet)             # <<<<<<<<<<<<<<\n *     self._check_mutating_imethod()\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_mfst\");\n    __PYX_ERR(0, 2067, __pyx_L1_error)\n  }\n  fst::script::Minimize(__pyx_v_self->_mfst.get(), NULL, __pyx_v_delta, __pyx_v_allow_nondet);\n\n  /* \"pywrapfst.pyx\":2068\n *     # This runs in-place when the second argument is null.\n *     fst.Minimize(self._mfst.get(), NULL, delta, allow_nondet)\n *     self._check_mutating_imethod()             # <<<<<<<<<<<<<<\n * \n *   def minimize(self, float delta=fst.kShortestDelta, bool allow_nondet=False):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_check_mutating_imethod\");\n    __PYX_ERR(0, 2068, __pyx_L1_error)\n  }\n  ((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->_check_mutating_imethod(__pyx_v_self); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 2068, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":2064\n *     return self\n * \n *   cdef void _minimize(self, float delta=fst.kShortestDelta,             # <<<<<<<<<<<<<<\n *                       bool allow_nondet=False) except *:\n *     # This runs in-place when the second argument is null.\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst._minimize\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n}\n\n/* \"pywrapfst.pyx\":2070\n *     self._check_mutating_imethod()\n * \n *   def minimize(self, float delta=fst.kShortestDelta, bool allow_nondet=False):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     minimize(self, delta=1e-6, allow_nondet=False)\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_23minimize(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic char __pyx_doc_9pywrapfst_11_MutableFst_22minimize[] = \"\\n    minimize(self, delta=1e-6, allow_nondet=False)\\n\\n    Minimizes the FST.\\n\\n    This operation destructively performs the minimization of deterministic\\n    weighted automata and transducers. If the input FST A is an acceptor, this\\n    operation produces the minimal acceptor B equivalent to A, i.e. the\\n    acceptor with a minimal number of states that is equivalent to A. If the\\n    input FST A is a transducer, this operation internally builds an equivalent\\n    transducer with a minimal number of states. However, this minimality is\\n    obtained by allowing transition having strings of symbols as output labels,\\n    this known in the litterature as a real-time transducer. Such transducers\\n    are not directly supported by the library. This function will convert such\\n    transducer by expanding each string-labeled transition into a sequence of\\n    transitions. This will results in the creation of new states, hence losing\\n    the minimality property.\\n\\n    Args:\\n      delta: Comparison/quantization delta.\\n      allow_nondet: Attempt minimization of non-deterministic FST?\\n\\n    Returns:\\n      self.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_23minimize(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  float __pyx_v_delta;\n  bool __pyx_v_allow_nondet;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"minimize (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_delta,&__pyx_n_s_allow_nondet,0};\n    PyObject* values[2] = {0,0};\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_delta);\n          if (value) { values[0] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  1:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_allow_nondet);\n          if (value) { values[1] = value; kw_args--; }\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"minimize\") < 0)) __PYX_ERR(0, 2070, __pyx_L3_error)\n      }\n    } else {\n      switch (PyTuple_GET_SIZE(__pyx_args)) {\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n    }\n    if (values[0]) {\n      __pyx_v_delta = __pyx_PyFloat_AsFloat(values[0]); if (unlikely((__pyx_v_delta == (float)-1) && PyErr_Occurred())) __PYX_ERR(0, 2070, __pyx_L3_error)\n    } else {\n      __pyx_v_delta = __pyx_k__36;\n    }\n    if (values[1]) {\n      __pyx_v_allow_nondet = __Pyx_PyObject_IsTrue(values[1]); if (unlikely((__pyx_v_allow_nondet == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 2070, __pyx_L3_error)\n    } else {\n      __pyx_v_allow_nondet = ((bool)0);\n    }\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"minimize\", 0, 0, 2, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 2070, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst.minimize\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  __pyx_r = __pyx_pf_9pywrapfst_11_MutableFst_22minimize(((struct __pyx_obj_9pywrapfst__MutableFst *)__pyx_v_self), __pyx_v_delta, __pyx_v_allow_nondet);\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_22minimize(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, float __pyx_v_delta, bool __pyx_v_allow_nondet) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  struct __pyx_opt_args_9pywrapfst_11_MutableFst__minimize __pyx_t_1;\n  __Pyx_RefNannySetupContext(\"minimize\", 0);\n\n  /* \"pywrapfst.pyx\":2096\n *       self.\n *     \"\"\"\n *     self._minimize(delta, allow_nondet)             # <<<<<<<<<<<<<<\n *     return self\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_minimize\");\n    __PYX_ERR(0, 2096, __pyx_L1_error)\n  }\n  __pyx_t_1.__pyx_n = 2;\n  __pyx_t_1.delta = __pyx_v_delta;\n  __pyx_t_1.allow_nondet = __pyx_v_allow_nondet;\n  ((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->_minimize(__pyx_v_self, &__pyx_t_1); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 2096, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":2097\n *     \"\"\"\n *     self._minimize(delta, allow_nondet)\n *     return self             # <<<<<<<<<<<<<<\n * \n *   cpdef MutableArcIterator mutable_arcs(self, int64 state):\n */\n  __Pyx_XDECREF(__pyx_r);\n  __Pyx_INCREF(((PyObject *)__pyx_v_self));\n  __pyx_r = ((PyObject *)__pyx_v_self);\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":2070\n *     self._check_mutating_imethod()\n * \n *   def minimize(self, float delta=fst.kShortestDelta, bool allow_nondet=False):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     minimize(self, delta=1e-6, allow_nondet=False)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst.minimize\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":2099\n *     return self\n * \n *   cpdef MutableArcIterator mutable_arcs(self, int64 state):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     mutable_arcs(self, state)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_25mutable_arcs(PyObject *__pyx_v_self, PyObject *__pyx_arg_state); /*proto*/\nstatic struct __pyx_obj_9pywrapfst_MutableArcIterator *__pyx_f_9pywrapfst_11_MutableFst_mutable_arcs(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, __pyx_t_10basictypes_int64 __pyx_v_state, int __pyx_skip_dispatch) {\n  struct __pyx_obj_9pywrapfst_MutableArcIterator *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  PyObject *__pyx_t_6 = NULL;\n  __Pyx_RefNannySetupContext(\"mutable_arcs\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_mutable_arcs); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2099, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_11_MutableFst_25mutable_arcs)) {\n      __Pyx_XDECREF(((PyObject *)__pyx_r));\n      __pyx_t_3 = __Pyx_PyInt_From_int64_t(__pyx_v_state); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 2099, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_3);\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_4 = __pyx_t_1; __pyx_t_5 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_4))) {\n        __pyx_t_5 = PyMethod_GET_SELF(__pyx_t_4);\n        if (likely(__pyx_t_5)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_4);\n          __Pyx_INCREF(__pyx_t_5);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_4, function);\n        }\n      }\n      if (!__pyx_t_5) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_4, __pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 2099, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n        __Pyx_GOTREF(__pyx_t_2);\n      } else {\n        #if CYTHON_FAST_PYCALL\n        if (PyFunction_Check(__pyx_t_4)) {\n          PyObject *__pyx_temp[2] = {__pyx_t_5, __pyx_t_3};\n          __pyx_t_2 = __Pyx_PyFunction_FastCall(__pyx_t_4, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 2099, __pyx_L1_error)\n          __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;\n          __Pyx_GOTREF(__pyx_t_2);\n          __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n        } else\n        #endif\n        #if CYTHON_FAST_PYCCALL\n        if (__Pyx_PyFastCFunction_Check(__pyx_t_4)) {\n          PyObject *__pyx_temp[2] = {__pyx_t_5, __pyx_t_3};\n          __pyx_t_2 = __Pyx_PyCFunction_FastCall(__pyx_t_4, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 2099, __pyx_L1_error)\n          __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;\n          __Pyx_GOTREF(__pyx_t_2);\n          __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n        } else\n        #endif\n        {\n          __pyx_t_6 = PyTuple_New(1+1); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 2099, __pyx_L1_error)\n          __Pyx_GOTREF(__pyx_t_6);\n          __Pyx_GIVEREF(__pyx_t_5); PyTuple_SET_ITEM(__pyx_t_6, 0, __pyx_t_5); __pyx_t_5 = NULL;\n          __Pyx_GIVEREF(__pyx_t_3);\n          PyTuple_SET_ITEM(__pyx_t_6, 0+1, __pyx_t_3);\n          __pyx_t_3 = 0;\n          __pyx_t_2 = __Pyx_PyObject_Call(__pyx_t_4, __pyx_t_6, NULL); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 2099, __pyx_L1_error)\n          __Pyx_GOTREF(__pyx_t_2);\n          __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n        }\n      }\n      __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      if (!(likely(((__pyx_t_2) == Py_None) || likely(__Pyx_TypeTest(__pyx_t_2, __pyx_ptype_9pywrapfst_MutableArcIterator))))) __PYX_ERR(0, 2099, __pyx_L1_error)\n      __pyx_r = ((struct __pyx_obj_9pywrapfst_MutableArcIterator *)__pyx_t_2);\n      __pyx_t_2 = 0;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":2113\n *     See also: `arcs`, `states`.\n *     \"\"\"\n *     return MutableArcIterator(self, state)             # <<<<<<<<<<<<<<\n * \n *   def mutable_input_symbols(self):\n */\n  __Pyx_XDECREF(((PyObject *)__pyx_r));\n  __pyx_t_1 = __Pyx_PyInt_From_int64_t(__pyx_v_state); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2113, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_t_2 = PyTuple_New(2); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 2113, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  __Pyx_INCREF(((PyObject *)__pyx_v_self));\n  __Pyx_GIVEREF(((PyObject *)__pyx_v_self));\n  PyTuple_SET_ITEM(__pyx_t_2, 0, ((PyObject *)__pyx_v_self));\n  __Pyx_GIVEREF(__pyx_t_1);\n  PyTuple_SET_ITEM(__pyx_t_2, 1, __pyx_t_1);\n  __pyx_t_1 = 0;\n  __pyx_t_1 = __Pyx_PyObject_Call(((PyObject *)__pyx_ptype_9pywrapfst_MutableArcIterator), __pyx_t_2, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2113, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n  __pyx_r = ((struct __pyx_obj_9pywrapfst_MutableArcIterator *)__pyx_t_1);\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":2099\n *     return self\n * \n *   cpdef MutableArcIterator mutable_arcs(self, int64 state):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     mutable_arcs(self, state)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_XDECREF(__pyx_t_6);\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst.mutable_arcs\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XGIVEREF((PyObject *)__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_25mutable_arcs(PyObject *__pyx_v_self, PyObject *__pyx_arg_state); /*proto*/\nstatic char __pyx_doc_9pywrapfst_11_MutableFst_24mutable_arcs[] = \"\\n    mutable_arcs(self, state)\\n\\n    Returns a mutable iterator over arcs leaving the specified state.\\n\\n    Args:\\n      state: The source state ID.\\n\\n    Returns:\\n      A MutableArcIterator.\\n\\n    See also: `arcs`, `states`.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_25mutable_arcs(PyObject *__pyx_v_self, PyObject *__pyx_arg_state) {\n  __pyx_t_10basictypes_int64 __pyx_v_state;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"mutable_arcs (wrapper)\", 0);\n  assert(__pyx_arg_state); {\n    __pyx_v_state = __Pyx_PyInt_As_int64_t(__pyx_arg_state); if (unlikely((__pyx_v_state == ((int64_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 2099, __pyx_L3_error)\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst.mutable_arcs\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  __pyx_r = __pyx_pf_9pywrapfst_11_MutableFst_24mutable_arcs(((struct __pyx_obj_9pywrapfst__MutableFst *)__pyx_v_self), ((__pyx_t_10basictypes_int64)__pyx_v_state));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_24mutable_arcs(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, __pyx_t_10basictypes_int64 __pyx_v_state) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"mutable_arcs\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst_11_MutableFst_mutable_arcs(__pyx_v_self, __pyx_v_state, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2099, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst.mutable_arcs\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":2115\n *     return MutableArcIterator(self, state)\n * \n *   def mutable_input_symbols(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     mutable_input_symbols(self)\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_27mutable_input_symbols(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_11_MutableFst_26mutable_input_symbols[] = \"\\n    mutable_input_symbols(self)\\n\\n    Returns the FST's (mutable) input symbol table, or None if none is present.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_27mutable_input_symbols(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"mutable_input_symbols (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_11_MutableFst_26mutable_input_symbols(((struct __pyx_obj_9pywrapfst__MutableFst *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_26mutable_input_symbols(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self) {\n  fst::SymbolTable *__pyx_v_tst;\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  int __pyx_t_1;\n  PyObject *__pyx_t_2 = NULL;\n  __Pyx_RefNannySetupContext(\"mutable_input_symbols\", 0);\n\n  /* \"pywrapfst.pyx\":2121\n *     Returns the FST's (mutable) input symbol table, or None if none is present.\n *     \"\"\"\n *     cdef fst.SymbolTable *tst = self._mfst.get().MutableInputSymbols()             # <<<<<<<<<<<<<<\n *     if tst == NULL:\n *       return\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_mfst\");\n    __PYX_ERR(0, 2121, __pyx_L1_error)\n  }\n  __pyx_v_tst = __pyx_v_self->_mfst.get()->MutableInputSymbols();\n\n  /* \"pywrapfst.pyx\":2122\n *     \"\"\"\n *     cdef fst.SymbolTable *tst = self._mfst.get().MutableInputSymbols()\n *     if tst == NULL:             # <<<<<<<<<<<<<<\n *       return\n *     return _init_MutableFstSymbolTable(tst, self._mfst)\n */\n  __pyx_t_1 = ((__pyx_v_tst == NULL) != 0);\n  if (__pyx_t_1) {\n\n    /* \"pywrapfst.pyx\":2123\n *     cdef fst.SymbolTable *tst = self._mfst.get().MutableInputSymbols()\n *     if tst == NULL:\n *       return             # <<<<<<<<<<<<<<\n *     return _init_MutableFstSymbolTable(tst, self._mfst)\n * \n */\n    __Pyx_XDECREF(__pyx_r);\n    __pyx_r = Py_None; __Pyx_INCREF(Py_None);\n    goto __pyx_L0;\n\n    /* \"pywrapfst.pyx\":2122\n *     \"\"\"\n *     cdef fst.SymbolTable *tst = self._mfst.get().MutableInputSymbols()\n *     if tst == NULL:             # <<<<<<<<<<<<<<\n *       return\n *     return _init_MutableFstSymbolTable(tst, self._mfst)\n */\n  }\n\n  /* \"pywrapfst.pyx\":2124\n *     if tst == NULL:\n *       return\n *     return _init_MutableFstSymbolTable(tst, self._mfst)             # <<<<<<<<<<<<<<\n * \n *   def mutable_output_symbols(self):\n */\n  __Pyx_XDECREF(__pyx_r);\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_mfst\");\n    __PYX_ERR(0, 2124, __pyx_L1_error)\n  }\n  __pyx_t_2 = ((PyObject *)__pyx_f_9pywrapfst__init_MutableFstSymbolTable(__pyx_v_tst, __pyx_v_self->_mfst)); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 2124, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  __pyx_r = __pyx_t_2;\n  __pyx_t_2 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":2115\n *     return MutableArcIterator(self, state)\n * \n *   def mutable_input_symbols(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     mutable_input_symbols(self)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst.mutable_input_symbols\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":2126\n *     return _init_MutableFstSymbolTable(tst, self._mfst)\n * \n *   def mutable_output_symbols(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     mutable_output_symbols(self)\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_29mutable_output_symbols(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_11_MutableFst_28mutable_output_symbols[] = \"\\n    mutable_output_symbols(self)\\n\\n    Returns the FST's (mutable) output symbol table, or None if none is present.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_29mutable_output_symbols(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"mutable_output_symbols (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_11_MutableFst_28mutable_output_symbols(((struct __pyx_obj_9pywrapfst__MutableFst *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_28mutable_output_symbols(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self) {\n  fst::SymbolTable *__pyx_v_tst;\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  int __pyx_t_1;\n  PyObject *__pyx_t_2 = NULL;\n  __Pyx_RefNannySetupContext(\"mutable_output_symbols\", 0);\n\n  /* \"pywrapfst.pyx\":2132\n *     Returns the FST's (mutable) output symbol table, or None if none is present.\n *     \"\"\"\n *     cdef fst.SymbolTable *tst = self._mfst.get().MutableOutputSymbols()             # <<<<<<<<<<<<<<\n *     if tst == NULL:\n *       return\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_mfst\");\n    __PYX_ERR(0, 2132, __pyx_L1_error)\n  }\n  __pyx_v_tst = __pyx_v_self->_mfst.get()->MutableOutputSymbols();\n\n  /* \"pywrapfst.pyx\":2133\n *     \"\"\"\n *     cdef fst.SymbolTable *tst = self._mfst.get().MutableOutputSymbols()\n *     if tst == NULL:             # <<<<<<<<<<<<<<\n *       return\n *     return _init_MutableFstSymbolTable(tst, self._mfst)\n */\n  __pyx_t_1 = ((__pyx_v_tst == NULL) != 0);\n  if (__pyx_t_1) {\n\n    /* \"pywrapfst.pyx\":2134\n *     cdef fst.SymbolTable *tst = self._mfst.get().MutableOutputSymbols()\n *     if tst == NULL:\n *       return             # <<<<<<<<<<<<<<\n *     return _init_MutableFstSymbolTable(tst, self._mfst)\n * \n */\n    __Pyx_XDECREF(__pyx_r);\n    __pyx_r = Py_None; __Pyx_INCREF(Py_None);\n    goto __pyx_L0;\n\n    /* \"pywrapfst.pyx\":2133\n *     \"\"\"\n *     cdef fst.SymbolTable *tst = self._mfst.get().MutableOutputSymbols()\n *     if tst == NULL:             # <<<<<<<<<<<<<<\n *       return\n *     return _init_MutableFstSymbolTable(tst, self._mfst)\n */\n  }\n\n  /* \"pywrapfst.pyx\":2135\n *     if tst == NULL:\n *       return\n *     return _init_MutableFstSymbolTable(tst, self._mfst)             # <<<<<<<<<<<<<<\n * \n *   cpdef int64 num_states(self):\n */\n  __Pyx_XDECREF(__pyx_r);\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_mfst\");\n    __PYX_ERR(0, 2135, __pyx_L1_error)\n  }\n  __pyx_t_2 = ((PyObject *)__pyx_f_9pywrapfst__init_MutableFstSymbolTable(__pyx_v_tst, __pyx_v_self->_mfst)); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 2135, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  __pyx_r = __pyx_t_2;\n  __pyx_t_2 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":2126\n *     return _init_MutableFstSymbolTable(tst, self._mfst)\n * \n *   def mutable_output_symbols(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     mutable_output_symbols(self)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst.mutable_output_symbols\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":2137\n *     return _init_MutableFstSymbolTable(tst, self._mfst)\n * \n *   cpdef int64 num_states(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     num_states(self)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_31num_states(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic __pyx_t_10basictypes_int64 __pyx_f_9pywrapfst_11_MutableFst_num_states(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, int __pyx_skip_dispatch) {\n  __pyx_t_10basictypes_int64 __pyx_r;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  __pyx_t_10basictypes_int64 __pyx_t_5;\n  __Pyx_RefNannySetupContext(\"num_states\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_num_states); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2137, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_11_MutableFst_31num_states)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 2137, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 2137, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __pyx_t_5 = __Pyx_PyInt_As_int64_t(__pyx_t_2); if (unlikely((__pyx_t_5 == ((int64_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 2137, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __pyx_r = __pyx_t_5;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":2143\n *     Returns the number of states.\n *     \"\"\"\n *     return self._mfst.get().NumStates()             # <<<<<<<<<<<<<<\n * \n *   cdef void _project(self, bool project_output=False) except *:\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_mfst\");\n    __PYX_ERR(0, 2143, __pyx_L1_error)\n  }\n  __pyx_r = __pyx_v_self->_mfst.get()->NumStates();\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":2137\n *     return _init_MutableFstSymbolTable(tst, self._mfst)\n * \n *   cpdef int64 num_states(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     num_states(self)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_WriteUnraisable(\"pywrapfst._MutableFst.num_states\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_31num_states(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_11_MutableFst_30num_states[] = \"\\n    num_states(self)\\n\\n    Returns the number of states.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_31num_states(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"num_states (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_11_MutableFst_30num_states(((struct __pyx_obj_9pywrapfst__MutableFst *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_30num_states(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"num_states\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __Pyx_PyInt_From_int64_t(__pyx_f_9pywrapfst_11_MutableFst_num_states(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2137, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst.num_states\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":2145\n *     return self._mfst.get().NumStates()\n * \n *   cdef void _project(self, bool project_output=False) except *:             # <<<<<<<<<<<<<<\n *     fst.Project(self._mfst.get(), fst.GetProjectType(project_output))\n *     self._check_mutating_imethod()\n */\n\nstatic void __pyx_f_9pywrapfst_11_MutableFst__project(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, struct __pyx_opt_args_9pywrapfst_11_MutableFst__project *__pyx_optional_args) {\n  bool __pyx_v_project_output = ((bool)0);\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"_project\", 0);\n  if (__pyx_optional_args) {\n    if (__pyx_optional_args->__pyx_n > 0) {\n      __pyx_v_project_output = __pyx_optional_args->project_output;\n    }\n  }\n\n  /* \"pywrapfst.pyx\":2146\n * \n *   cdef void _project(self, bool project_output=False) except *:\n *     fst.Project(self._mfst.get(), fst.GetProjectType(project_output))             # <<<<<<<<<<<<<<\n *     self._check_mutating_imethod()\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_mfst\");\n    __PYX_ERR(0, 2146, __pyx_L1_error)\n  }\n  fst::script::Project(__pyx_v_self->_mfst.get(), fst::script::GetProjectType(__pyx_v_project_output));\n\n  /* \"pywrapfst.pyx\":2147\n *   cdef void _project(self, bool project_output=False) except *:\n *     fst.Project(self._mfst.get(), fst.GetProjectType(project_output))\n *     self._check_mutating_imethod()             # <<<<<<<<<<<<<<\n * \n *   def project(self, bool project_output=False):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_check_mutating_imethod\");\n    __PYX_ERR(0, 2147, __pyx_L1_error)\n  }\n  ((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->_check_mutating_imethod(__pyx_v_self); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 2147, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":2145\n *     return self._mfst.get().NumStates()\n * \n *   cdef void _project(self, bool project_output=False) except *:             # <<<<<<<<<<<<<<\n *     fst.Project(self._mfst.get(), fst.GetProjectType(project_output))\n *     self._check_mutating_imethod()\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst._project\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n}\n\n/* \"pywrapfst.pyx\":2149\n *     self._check_mutating_imethod()\n * \n *   def project(self, bool project_output=False):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     project(self, project_output=False)\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_33project(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic char __pyx_doc_9pywrapfst_11_MutableFst_32project[] = \"\\n    project(self, project_output=False)\\n\\n    Converts the FST to an acceptor using input or output labels.\\n\\n    This operation destructively projects an FST onto its domain or range by\\n    either copying each arc's input label to its output label (the default) or\\n    vice versa.\\n\\n    Args:\\n      project_output: Should the output labels be projected?\\n\\n    Returns:\\n      self.\\n\\n    See also: `decode`, `encode`, `relabel_pairs`, `relabel_symbols`.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_33project(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  bool __pyx_v_project_output;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"project (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_project_output,0};\n    PyObject* values[1] = {0};\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_project_output);\n          if (value) { values[0] = value; kw_args--; }\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"project\") < 0)) __PYX_ERR(0, 2149, __pyx_L3_error)\n      }\n    } else {\n      switch (PyTuple_GET_SIZE(__pyx_args)) {\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n    }\n    if (values[0]) {\n      __pyx_v_project_output = __Pyx_PyObject_IsTrue(values[0]); if (unlikely((__pyx_v_project_output == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 2149, __pyx_L3_error)\n    } else {\n      __pyx_v_project_output = ((bool)0);\n    }\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"project\", 0, 0, 1, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 2149, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst.project\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  __pyx_r = __pyx_pf_9pywrapfst_11_MutableFst_32project(((struct __pyx_obj_9pywrapfst__MutableFst *)__pyx_v_self), __pyx_v_project_output);\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_32project(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, bool __pyx_v_project_output) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  struct __pyx_opt_args_9pywrapfst_11_MutableFst__project __pyx_t_1;\n  __Pyx_RefNannySetupContext(\"project\", 0);\n\n  /* \"pywrapfst.pyx\":2167\n *     See also: `decode`, `encode`, `relabel_pairs`, `relabel_symbols`.\n *     \"\"\"\n *     self._project(project_output)             # <<<<<<<<<<<<<<\n *     return self\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_project\");\n    __PYX_ERR(0, 2167, __pyx_L1_error)\n  }\n  __pyx_t_1.__pyx_n = 1;\n  __pyx_t_1.project_output = __pyx_v_project_output;\n  ((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->_project(__pyx_v_self, &__pyx_t_1); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 2167, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":2168\n *     \"\"\"\n *     self._project(project_output)\n *     return self             # <<<<<<<<<<<<<<\n * \n *   cdef void _prune(self, float delta=fst.kDelta, int64 nstate=fst.kNoStateId,\n */\n  __Pyx_XDECREF(__pyx_r);\n  __Pyx_INCREF(((PyObject *)__pyx_v_self));\n  __pyx_r = ((PyObject *)__pyx_v_self);\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":2149\n *     self._check_mutating_imethod()\n * \n *   def project(self, bool project_output=False):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     project(self, project_output=False)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst.project\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":2170\n *     return self\n * \n *   cdef void _prune(self, float delta=fst.kDelta, int64 nstate=fst.kNoStateId,             # <<<<<<<<<<<<<<\n *                    weight=None) except *:\n *     # Threshold is set to semiring Zero (no pruning) if no weight is specified.\n */\n\nstatic void __pyx_f_9pywrapfst_11_MutableFst__prune(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, struct __pyx_opt_args_9pywrapfst_11_MutableFst__prune *__pyx_optional_args) {\n  float __pyx_v_delta = __pyx_k__37;\n  __pyx_t_10basictypes_int64 __pyx_v_nstate = __pyx_k__38;\n\n  /* \"pywrapfst.pyx\":2171\n * \n *   cdef void _prune(self, float delta=fst.kDelta, int64 nstate=fst.kNoStateId,\n *                    weight=None) except *:             # <<<<<<<<<<<<<<\n *     # Threshold is set to semiring Zero (no pruning) if no weight is specified.\n *     cdef fst.WeightClass wc = _get_WeightClass_or_Zero(self.weight_type(),\n */\n  PyObject *__pyx_v_weight = ((PyObject *)Py_None);\n  fst::script::WeightClass __pyx_v_wc;\n  __Pyx_RefNannyDeclarations\n  fst::script::WeightClass __pyx_t_1;\n  __Pyx_RefNannySetupContext(\"_prune\", 0);\n  if (__pyx_optional_args) {\n    if (__pyx_optional_args->__pyx_n > 0) {\n      __pyx_v_delta = __pyx_optional_args->delta;\n      if (__pyx_optional_args->__pyx_n > 1) {\n        __pyx_v_nstate = __pyx_optional_args->nstate;\n        if (__pyx_optional_args->__pyx_n > 2) {\n          __pyx_v_weight = __pyx_optional_args->weight;\n        }\n      }\n    }\n  }\n\n  /* \"pywrapfst.pyx\":2173\n *                    weight=None) except *:\n *     # Threshold is set to semiring Zero (no pruning) if no weight is specified.\n *     cdef fst.WeightClass wc = _get_WeightClass_or_Zero(self.weight_type(),             # <<<<<<<<<<<<<<\n *                                                        weight)\n *     fst.Prune(self._mfst.get(), wc, nstate, delta)\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"weight_type\");\n    __PYX_ERR(0, 2173, __pyx_L1_error)\n  }\n\n  /* \"pywrapfst.pyx\":2174\n *     # Threshold is set to semiring Zero (no pruning) if no weight is specified.\n *     cdef fst.WeightClass wc = _get_WeightClass_or_Zero(self.weight_type(),\n *                                                        weight)             # <<<<<<<<<<<<<<\n *     fst.Prune(self._mfst.get(), wc, nstate, delta)\n *     self._check_mutating_imethod()\n */\n  __pyx_t_1 = __pyx_f_9pywrapfst__get_WeightClass_or_Zero(((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->__pyx_base.weight_type(((struct __pyx_obj_9pywrapfst__Fst *)__pyx_v_self), 0), __pyx_v_weight); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 2173, __pyx_L1_error)\n  __pyx_v_wc = __pyx_t_1;\n\n  /* \"pywrapfst.pyx\":2175\n *     cdef fst.WeightClass wc = _get_WeightClass_or_Zero(self.weight_type(),\n *                                                        weight)\n *     fst.Prune(self._mfst.get(), wc, nstate, delta)             # <<<<<<<<<<<<<<\n *     self._check_mutating_imethod()\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_mfst\");\n    __PYX_ERR(0, 2175, __pyx_L1_error)\n  }\n  fst::script::Prune(__pyx_v_self->_mfst.get(), __pyx_v_wc, __pyx_v_nstate, __pyx_v_delta);\n\n  /* \"pywrapfst.pyx\":2176\n *                                                        weight)\n *     fst.Prune(self._mfst.get(), wc, nstate, delta)\n *     self._check_mutating_imethod()             # <<<<<<<<<<<<<<\n * \n *   def prune(self,\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_check_mutating_imethod\");\n    __PYX_ERR(0, 2176, __pyx_L1_error)\n  }\n  ((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->_check_mutating_imethod(__pyx_v_self); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 2176, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":2170\n *     return self\n * \n *   cdef void _prune(self, float delta=fst.kDelta, int64 nstate=fst.kNoStateId,             # <<<<<<<<<<<<<<\n *                    weight=None) except *:\n *     # Threshold is set to semiring Zero (no pruning) if no weight is specified.\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst._prune\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n}\n\n/* \"pywrapfst.pyx\":2178\n *     self._check_mutating_imethod()\n * \n *   def prune(self,             # <<<<<<<<<<<<<<\n *             float delta=fst.kDelta,\n *             int64 nstate=fst.kNoStateId,\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_35prune(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic char __pyx_doc_9pywrapfst_11_MutableFst_34prune[] = \"\\n    prune(self, delta=0.0009765625, nstate=NO_STATE_ID, weight=None)\\n\\n    Removes paths with weights below a certain threshold.\\n\\n    This operation deletes states and arcs in the input FST that do not belong\\n    to a successful path whose weight is no more (w.r.t the natural semiring\\n    order) than the threshold t \\\\otimes-times the weight of the shortest path in\\n    the input FST. Weights must be commutative and have the path property.\\n\\n    Args:\\n      delta: Comparison/quantization delta.\\n      nstate: State number threshold.\\n      weight: A Weight or weight string indicating the desired weight threshold\\n          below which paths are pruned; if omitted, no paths are pruned.\\n\\n    Returns:\\n      self.\\n\\n    See also: The constructive variant.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_35prune(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  float __pyx_v_delta;\n  __pyx_t_10basictypes_int64 __pyx_v_nstate;\n  PyObject *__pyx_v_weight = 0;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"prune (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_delta,&__pyx_n_s_nstate,&__pyx_n_s_weight,0};\n    PyObject* values[3] = {0,0,0};\n\n    /* \"pywrapfst.pyx\":2181\n *             float delta=fst.kDelta,\n *             int64 nstate=fst.kNoStateId,\n *             weight=None):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     prune(self, delta=0.0009765625, nstate=NO_STATE_ID, weight=None)\n */\n    values[2] = ((PyObject *)Py_None);\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);\n        CYTHON_FALLTHROUGH;\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_delta);\n          if (value) { values[0] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  1:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_nstate);\n          if (value) { values[1] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  2:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_weight);\n          if (value) { values[2] = value; kw_args--; }\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"prune\") < 0)) __PYX_ERR(0, 2178, __pyx_L3_error)\n      }\n    } else {\n      switch (PyTuple_GET_SIZE(__pyx_args)) {\n        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);\n        CYTHON_FALLTHROUGH;\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n    }\n    if (values[0]) {\n      __pyx_v_delta = __pyx_PyFloat_AsFloat(values[0]); if (unlikely((__pyx_v_delta == (float)-1) && PyErr_Occurred())) __PYX_ERR(0, 2179, __pyx_L3_error)\n    } else {\n      __pyx_v_delta = __pyx_k__39;\n    }\n    if (values[1]) {\n      __pyx_v_nstate = __Pyx_PyInt_As_int64_t(values[1]); if (unlikely((__pyx_v_nstate == ((int64_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 2180, __pyx_L3_error)\n    } else {\n      __pyx_v_nstate = __pyx_k__40;\n    }\n    __pyx_v_weight = values[2];\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"prune\", 0, 0, 3, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 2178, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst.prune\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  __pyx_r = __pyx_pf_9pywrapfst_11_MutableFst_34prune(((struct __pyx_obj_9pywrapfst__MutableFst *)__pyx_v_self), __pyx_v_delta, __pyx_v_nstate, __pyx_v_weight);\n\n  /* \"pywrapfst.pyx\":2178\n *     self._check_mutating_imethod()\n * \n *   def prune(self,             # <<<<<<<<<<<<<<\n *             float delta=fst.kDelta,\n *             int64 nstate=fst.kNoStateId,\n */\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_34prune(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, float __pyx_v_delta, __pyx_t_10basictypes_int64 __pyx_v_nstate, PyObject *__pyx_v_weight) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  struct __pyx_opt_args_9pywrapfst_11_MutableFst__prune __pyx_t_1;\n  __Pyx_RefNannySetupContext(\"prune\", 0);\n\n  /* \"pywrapfst.pyx\":2203\n *     See also: The constructive variant.\n *     \"\"\"\n *     self._prune(delta, nstate, weight)             # <<<<<<<<<<<<<<\n *     return self\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_prune\");\n    __PYX_ERR(0, 2203, __pyx_L1_error)\n  }\n  __pyx_t_1.__pyx_n = 3;\n  __pyx_t_1.delta = __pyx_v_delta;\n  __pyx_t_1.nstate = __pyx_v_nstate;\n  __pyx_t_1.weight = __pyx_v_weight;\n  ((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->_prune(__pyx_v_self, &__pyx_t_1); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 2203, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":2204\n *     \"\"\"\n *     self._prune(delta, nstate, weight)\n *     return self             # <<<<<<<<<<<<<<\n * \n *   cdef void _push(self,\n */\n  __Pyx_XDECREF(__pyx_r);\n  __Pyx_INCREF(((PyObject *)__pyx_v_self));\n  __pyx_r = ((PyObject *)__pyx_v_self);\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":2178\n *     self._check_mutating_imethod()\n * \n *   def prune(self,             # <<<<<<<<<<<<<<\n *             float delta=fst.kDelta,\n *             int64 nstate=fst.kNoStateId,\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst.prune\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":2206\n *     return self\n * \n *   cdef void _push(self,             # <<<<<<<<<<<<<<\n *                   float delta=fst.kDelta,\n *                   bool remove_total_weight=False,\n */\n\nstatic void __pyx_f_9pywrapfst_11_MutableFst__push(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, struct __pyx_opt_args_9pywrapfst_11_MutableFst__push *__pyx_optional_args) {\n  float __pyx_v_delta = __pyx_k__41;\n\n  /* \"pywrapfst.pyx\":2208\n *   cdef void _push(self,\n *                   float delta=fst.kDelta,\n *                   bool remove_total_weight=False,             # <<<<<<<<<<<<<<\n *                   bool to_final=False) except *:\n *     fst.Push(self._mfst.get(), fst.GetReweightType(to_final), delta,\n */\n  bool __pyx_v_remove_total_weight = ((bool)0);\n\n  /* \"pywrapfst.pyx\":2209\n *                   float delta=fst.kDelta,\n *                   bool remove_total_weight=False,\n *                   bool to_final=False) except *:             # <<<<<<<<<<<<<<\n *     fst.Push(self._mfst.get(), fst.GetReweightType(to_final), delta,\n *              remove_total_weight)\n */\n  bool __pyx_v_to_final = ((bool)0);\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"_push\", 0);\n  if (__pyx_optional_args) {\n    if (__pyx_optional_args->__pyx_n > 0) {\n      __pyx_v_delta = __pyx_optional_args->delta;\n      if (__pyx_optional_args->__pyx_n > 1) {\n        __pyx_v_remove_total_weight = __pyx_optional_args->remove_total_weight;\n        if (__pyx_optional_args->__pyx_n > 2) {\n          __pyx_v_to_final = __pyx_optional_args->to_final;\n        }\n      }\n    }\n  }\n\n  /* \"pywrapfst.pyx\":2210\n *                   bool remove_total_weight=False,\n *                   bool to_final=False) except *:\n *     fst.Push(self._mfst.get(), fst.GetReweightType(to_final), delta,             # <<<<<<<<<<<<<<\n *              remove_total_weight)\n *     self._check_mutating_imethod()\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_mfst\");\n    __PYX_ERR(0, 2210, __pyx_L1_error)\n  }\n\n  /* \"pywrapfst.pyx\":2211\n *                   bool to_final=False) except *:\n *     fst.Push(self._mfst.get(), fst.GetReweightType(to_final), delta,\n *              remove_total_weight)             # <<<<<<<<<<<<<<\n *     self._check_mutating_imethod()\n * \n */\n  fst::script::Push(__pyx_v_self->_mfst.get(), fst::script::GetReweightType(__pyx_v_to_final), __pyx_v_delta, __pyx_v_remove_total_weight);\n\n  /* \"pywrapfst.pyx\":2212\n *     fst.Push(self._mfst.get(), fst.GetReweightType(to_final), delta,\n *              remove_total_weight)\n *     self._check_mutating_imethod()             # <<<<<<<<<<<<<<\n * \n *   def push(self,\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_check_mutating_imethod\");\n    __PYX_ERR(0, 2212, __pyx_L1_error)\n  }\n  ((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->_check_mutating_imethod(__pyx_v_self); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 2212, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":2206\n *     return self\n * \n *   cdef void _push(self,             # <<<<<<<<<<<<<<\n *                   float delta=fst.kDelta,\n *                   bool remove_total_weight=False,\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst._push\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n}\n\n/* \"pywrapfst.pyx\":2214\n *     self._check_mutating_imethod()\n * \n *   def push(self,             # <<<<<<<<<<<<<<\n *            float delta=fst.kDelta,\n *            bool remove_total_weight=False,\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_37push(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic char __pyx_doc_9pywrapfst_11_MutableFst_36push[] = \"\\n    push(self, delta=0.0009765625, remove_total_weight=False, to_final=False)\\n\\n    Pushes weights towards the initial or final states.\\n\\n    This operation destructively produces an equivalent transducer by pushing\\n    the weights towards the initial state or toward the final states. When\\n    pushing weights towards the initial state, the sum of the weight of the\\n    outgoing transitions and final weight at any non-initial state is equal to\\n    one in the resulting machine. When pushing weights towards the final states,\\n    the sum of the weight of the incoming transitions at any state is equal to\\n    one. Weights need to be left distributive when pushing towards the initial\\n    state and right distributive when pushing towards the final states.\\n\\n    Args:\\n      delta: Comparison/quantization delta.\\n      remove_total_weight: If pushing weights, should the total weight be\\n          removed?\\n      to_final: Push towards final states?\\n\\n    Returns:\\n      self.\\n\\n    See also: The constructive variant, which also supports label pushing.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_37push(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  float __pyx_v_delta;\n  bool __pyx_v_remove_total_weight;\n  bool __pyx_v_to_final;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"push (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_delta,&__pyx_n_s_remove_total_weight,&__pyx_n_s_to_final,0};\n    PyObject* values[3] = {0,0,0};\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);\n        CYTHON_FALLTHROUGH;\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_delta);\n          if (value) { values[0] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  1:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_remove_total_weight);\n          if (value) { values[1] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  2:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_to_final);\n          if (value) { values[2] = value; kw_args--; }\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"push\") < 0)) __PYX_ERR(0, 2214, __pyx_L3_error)\n      }\n    } else {\n      switch (PyTuple_GET_SIZE(__pyx_args)) {\n        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);\n        CYTHON_FALLTHROUGH;\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n    }\n    if (values[0]) {\n      __pyx_v_delta = __pyx_PyFloat_AsFloat(values[0]); if (unlikely((__pyx_v_delta == (float)-1) && PyErr_Occurred())) __PYX_ERR(0, 2215, __pyx_L3_error)\n    } else {\n      __pyx_v_delta = __pyx_k__42;\n    }\n    if (values[1]) {\n      __pyx_v_remove_total_weight = __Pyx_PyObject_IsTrue(values[1]); if (unlikely((__pyx_v_remove_total_weight == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 2216, __pyx_L3_error)\n    } else {\n\n      /* \"pywrapfst.pyx\":2216\n *   def push(self,\n *            float delta=fst.kDelta,\n *            bool remove_total_weight=False,             # <<<<<<<<<<<<<<\n *            bool to_final=False):\n *     \"\"\"\n */\n      __pyx_v_remove_total_weight = ((bool)0);\n    }\n    if (values[2]) {\n      __pyx_v_to_final = __Pyx_PyObject_IsTrue(values[2]); if (unlikely((__pyx_v_to_final == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 2217, __pyx_L3_error)\n    } else {\n\n      /* \"pywrapfst.pyx\":2217\n *            float delta=fst.kDelta,\n *            bool remove_total_weight=False,\n *            bool to_final=False):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     push(self, delta=0.0009765625, remove_total_weight=False, to_final=False)\n */\n      __pyx_v_to_final = ((bool)0);\n    }\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"push\", 0, 0, 3, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 2214, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst.push\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  __pyx_r = __pyx_pf_9pywrapfst_11_MutableFst_36push(((struct __pyx_obj_9pywrapfst__MutableFst *)__pyx_v_self), __pyx_v_delta, __pyx_v_remove_total_weight, __pyx_v_to_final);\n\n  /* \"pywrapfst.pyx\":2214\n *     self._check_mutating_imethod()\n * \n *   def push(self,             # <<<<<<<<<<<<<<\n *            float delta=fst.kDelta,\n *            bool remove_total_weight=False,\n */\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_36push(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, float __pyx_v_delta, bool __pyx_v_remove_total_weight, bool __pyx_v_to_final) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  struct __pyx_opt_args_9pywrapfst_11_MutableFst__push __pyx_t_1;\n  __Pyx_RefNannySetupContext(\"push\", 0);\n\n  /* \"pywrapfst.pyx\":2243\n *     See also: The constructive variant, which also supports label pushing.\n *     \"\"\"\n *     self._push(delta, remove_total_weight, to_final)             # <<<<<<<<<<<<<<\n *     return self\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_push\");\n    __PYX_ERR(0, 2243, __pyx_L1_error)\n  }\n  __pyx_t_1.__pyx_n = 3;\n  __pyx_t_1.delta = __pyx_v_delta;\n  __pyx_t_1.remove_total_weight = __pyx_v_remove_total_weight;\n  __pyx_t_1.to_final = __pyx_v_to_final;\n  ((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->_push(__pyx_v_self, &__pyx_t_1); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 2243, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":2244\n *     \"\"\"\n *     self._push(delta, remove_total_weight, to_final)\n *     return self             # <<<<<<<<<<<<<<\n * \n *   cdef void _relabel_pairs(self, ipairs=None, opairs=None) except *:\n */\n  __Pyx_XDECREF(__pyx_r);\n  __Pyx_INCREF(((PyObject *)__pyx_v_self));\n  __pyx_r = ((PyObject *)__pyx_v_self);\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":2214\n *     self._check_mutating_imethod()\n * \n *   def push(self,             # <<<<<<<<<<<<<<\n *            float delta=fst.kDelta,\n *            bool remove_total_weight=False,\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst.push\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":2246\n *     return self\n * \n *   cdef void _relabel_pairs(self, ipairs=None, opairs=None) except *:             # <<<<<<<<<<<<<<\n *     cdef unique_ptr[vector[fst.LabelPair]] _ipairs\n *     _ipairs.reset(new vector[fst.LabelPair]())\n */\n\nstatic void __pyx_f_9pywrapfst_11_MutableFst__relabel_pairs(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, struct __pyx_opt_args_9pywrapfst_11_MutableFst__relabel_pairs *__pyx_optional_args) {\n  PyObject *__pyx_v_ipairs = ((PyObject *)Py_None);\n  PyObject *__pyx_v_opairs = ((PyObject *)Py_None);\n  std::unique_ptr<std::vector<__pyx_t_3fst_LabelPair> >  __pyx_v__ipairs;\n  std::unique_ptr<std::vector<__pyx_t_3fst_LabelPair> >  __pyx_v__opairs;\n  __pyx_t_10basictypes_int64 __pyx_v_before;\n  __pyx_t_10basictypes_int64 __pyx_v_after;\n  __Pyx_RefNannyDeclarations\n  std::vector<__pyx_t_3fst_LabelPair>  *__pyx_t_1;\n  int __pyx_t_2;\n  PyObject *__pyx_t_3 = NULL;\n  Py_ssize_t __pyx_t_4;\n  PyObject *(*__pyx_t_5)(PyObject *);\n  PyObject *__pyx_t_6 = NULL;\n  PyObject *__pyx_t_7 = NULL;\n  PyObject *__pyx_t_8 = NULL;\n  PyObject *__pyx_t_9 = NULL;\n  PyObject *(*__pyx_t_10)(PyObject *);\n  __pyx_t_10basictypes_int64 __pyx_t_11;\n  __pyx_t_10basictypes_int64 __pyx_t_12;\n  __pyx_t_3fst_LabelPair __pyx_t_13;\n  int __pyx_t_14;\n  __Pyx_RefNannySetupContext(\"_relabel_pairs\", 0);\n  if (__pyx_optional_args) {\n    if (__pyx_optional_args->__pyx_n > 0) {\n      __pyx_v_ipairs = __pyx_optional_args->ipairs;\n      if (__pyx_optional_args->__pyx_n > 1) {\n        __pyx_v_opairs = __pyx_optional_args->opairs;\n      }\n    }\n  }\n\n  /* \"pywrapfst.pyx\":2248\n *   cdef void _relabel_pairs(self, ipairs=None, opairs=None) except *:\n *     cdef unique_ptr[vector[fst.LabelPair]] _ipairs\n *     _ipairs.reset(new vector[fst.LabelPair]())             # <<<<<<<<<<<<<<\n *     cdef unique_ptr[vector[fst.LabelPair]] _opairs\n *     _opairs.reset(new vector[fst.LabelPair]())\n */\n  try {\n    __pyx_t_1 = new std::vector<__pyx_t_3fst_LabelPair> ();\n  } catch(...) {\n    __Pyx_CppExn2PyErr();\n    __PYX_ERR(0, 2248, __pyx_L1_error)\n  }\n  __pyx_v__ipairs.reset(__pyx_t_1);\n\n  /* \"pywrapfst.pyx\":2250\n *     _ipairs.reset(new vector[fst.LabelPair]())\n *     cdef unique_ptr[vector[fst.LabelPair]] _opairs\n *     _opairs.reset(new vector[fst.LabelPair]())             # <<<<<<<<<<<<<<\n *     cdef int64 before\n *     cdef int64 after\n */\n  try {\n    __pyx_t_1 = new std::vector<__pyx_t_3fst_LabelPair> ();\n  } catch(...) {\n    __Pyx_CppExn2PyErr();\n    __PYX_ERR(0, 2250, __pyx_L1_error)\n  }\n  __pyx_v__opairs.reset(__pyx_t_1);\n\n  /* \"pywrapfst.pyx\":2253\n *     cdef int64 before\n *     cdef int64 after\n *     if ipairs:             # <<<<<<<<<<<<<<\n *       for (before, after) in ipairs:\n *         _ipairs.get().push_back(fst.LabelPair(before, after))\n */\n  __pyx_t_2 = __Pyx_PyObject_IsTrue(__pyx_v_ipairs); if (unlikely(__pyx_t_2 < 0)) __PYX_ERR(0, 2253, __pyx_L1_error)\n  if (__pyx_t_2) {\n\n    /* \"pywrapfst.pyx\":2254\n *     cdef int64 after\n *     if ipairs:\n *       for (before, after) in ipairs:             # <<<<<<<<<<<<<<\n *         _ipairs.get().push_back(fst.LabelPair(before, after))\n *     if opairs:\n */\n    if (likely(PyList_CheckExact(__pyx_v_ipairs)) || PyTuple_CheckExact(__pyx_v_ipairs)) {\n      __pyx_t_3 = __pyx_v_ipairs; __Pyx_INCREF(__pyx_t_3); __pyx_t_4 = 0;\n      __pyx_t_5 = NULL;\n    } else {\n      __pyx_t_4 = -1; __pyx_t_3 = PyObject_GetIter(__pyx_v_ipairs); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 2254, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_3);\n      __pyx_t_5 = Py_TYPE(__pyx_t_3)->tp_iternext; if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 2254, __pyx_L1_error)\n    }\n    for (;;) {\n      if (likely(!__pyx_t_5)) {\n        if (likely(PyList_CheckExact(__pyx_t_3))) {\n          if (__pyx_t_4 >= PyList_GET_SIZE(__pyx_t_3)) break;\n          #if CYTHON_ASSUME_SAFE_MACROS && !CYTHON_AVOID_BORROWED_REFS\n          __pyx_t_6 = PyList_GET_ITEM(__pyx_t_3, __pyx_t_4); __Pyx_INCREF(__pyx_t_6); __pyx_t_4++; if (unlikely(0 < 0)) __PYX_ERR(0, 2254, __pyx_L1_error)\n          #else\n          __pyx_t_6 = PySequence_ITEM(__pyx_t_3, __pyx_t_4); __pyx_t_4++; if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 2254, __pyx_L1_error)\n          __Pyx_GOTREF(__pyx_t_6);\n          #endif\n        } else {\n          if (__pyx_t_4 >= PyTuple_GET_SIZE(__pyx_t_3)) break;\n          #if CYTHON_ASSUME_SAFE_MACROS && !CYTHON_AVOID_BORROWED_REFS\n          __pyx_t_6 = PyTuple_GET_ITEM(__pyx_t_3, __pyx_t_4); __Pyx_INCREF(__pyx_t_6); __pyx_t_4++; if (unlikely(0 < 0)) __PYX_ERR(0, 2254, __pyx_L1_error)\n          #else\n          __pyx_t_6 = PySequence_ITEM(__pyx_t_3, __pyx_t_4); __pyx_t_4++; if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 2254, __pyx_L1_error)\n          __Pyx_GOTREF(__pyx_t_6);\n          #endif\n        }\n      } else {\n        __pyx_t_6 = __pyx_t_5(__pyx_t_3);\n        if (unlikely(!__pyx_t_6)) {\n          PyObject* exc_type = PyErr_Occurred();\n          if (exc_type) {\n            if (likely(__Pyx_PyErr_GivenExceptionMatches(exc_type, PyExc_StopIteration))) PyErr_Clear();\n            else __PYX_ERR(0, 2254, __pyx_L1_error)\n          }\n          break;\n        }\n        __Pyx_GOTREF(__pyx_t_6);\n      }\n      if ((likely(PyTuple_CheckExact(__pyx_t_6))) || (PyList_CheckExact(__pyx_t_6))) {\n        PyObject* sequence = __pyx_t_6;\n        Py_ssize_t size = __Pyx_PySequence_SIZE(sequence);\n        if (unlikely(size != 2)) {\n          if (size > 2) __Pyx_RaiseTooManyValuesError(2);\n          else if (size >= 0) __Pyx_RaiseNeedMoreValuesError(size);\n          __PYX_ERR(0, 2254, __pyx_L1_error)\n        }\n        #if CYTHON_ASSUME_SAFE_MACROS && !CYTHON_AVOID_BORROWED_REFS\n        if (likely(PyTuple_CheckExact(sequence))) {\n          __pyx_t_7 = PyTuple_GET_ITEM(sequence, 0); \n          __pyx_t_8 = PyTuple_GET_ITEM(sequence, 1); \n        } else {\n          __pyx_t_7 = PyList_GET_ITEM(sequence, 0); \n          __pyx_t_8 = PyList_GET_ITEM(sequence, 1); \n        }\n        __Pyx_INCREF(__pyx_t_7);\n        __Pyx_INCREF(__pyx_t_8);\n        #else\n        __pyx_t_7 = PySequence_ITEM(sequence, 0); if (unlikely(!__pyx_t_7)) __PYX_ERR(0, 2254, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_7);\n        __pyx_t_8 = PySequence_ITEM(sequence, 1); if (unlikely(!__pyx_t_8)) __PYX_ERR(0, 2254, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_8);\n        #endif\n        __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n      } else {\n        Py_ssize_t index = -1;\n        __pyx_t_9 = PyObject_GetIter(__pyx_t_6); if (unlikely(!__pyx_t_9)) __PYX_ERR(0, 2254, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_9);\n        __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n        __pyx_t_10 = Py_TYPE(__pyx_t_9)->tp_iternext;\n        index = 0; __pyx_t_7 = __pyx_t_10(__pyx_t_9); if (unlikely(!__pyx_t_7)) goto __pyx_L6_unpacking_failed;\n        __Pyx_GOTREF(__pyx_t_7);\n        index = 1; __pyx_t_8 = __pyx_t_10(__pyx_t_9); if (unlikely(!__pyx_t_8)) goto __pyx_L6_unpacking_failed;\n        __Pyx_GOTREF(__pyx_t_8);\n        if (__Pyx_IternextUnpackEndCheck(__pyx_t_10(__pyx_t_9), 2) < 0) __PYX_ERR(0, 2254, __pyx_L1_error)\n        __pyx_t_10 = NULL;\n        __Pyx_DECREF(__pyx_t_9); __pyx_t_9 = 0;\n        goto __pyx_L7_unpacking_done;\n        __pyx_L6_unpacking_failed:;\n        __Pyx_DECREF(__pyx_t_9); __pyx_t_9 = 0;\n        __pyx_t_10 = NULL;\n        if (__Pyx_IterFinish() == 0) __Pyx_RaiseNeedMoreValuesError(index);\n        __PYX_ERR(0, 2254, __pyx_L1_error)\n        __pyx_L7_unpacking_done:;\n      }\n      __pyx_t_11 = __Pyx_PyInt_As_int64_t(__pyx_t_7); if (unlikely((__pyx_t_11 == ((int64_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 2254, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0;\n      __pyx_t_12 = __Pyx_PyInt_As_int64_t(__pyx_t_8); if (unlikely((__pyx_t_12 == ((int64_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 2254, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0;\n      __pyx_v_before = __pyx_t_11;\n      __pyx_v_after = __pyx_t_12;\n\n      /* \"pywrapfst.pyx\":2255\n *     if ipairs:\n *       for (before, after) in ipairs:\n *         _ipairs.get().push_back(fst.LabelPair(before, after))             # <<<<<<<<<<<<<<\n *     if opairs:\n *       for (before, after) in opairs:\n */\n      try {\n        __pyx_t_13 = __pyx_t_3fst_LabelPair(__pyx_v_before, __pyx_v_after);\n      } catch(...) {\n        __Pyx_CppExn2PyErr();\n        __PYX_ERR(0, 2255, __pyx_L1_error)\n      }\n      try {\n        __pyx_v__ipairs.get()->push_back(__pyx_t_13);\n      } catch(...) {\n        __Pyx_CppExn2PyErr();\n        __PYX_ERR(0, 2255, __pyx_L1_error)\n      }\n\n      /* \"pywrapfst.pyx\":2254\n *     cdef int64 after\n *     if ipairs:\n *       for (before, after) in ipairs:             # <<<<<<<<<<<<<<\n *         _ipairs.get().push_back(fst.LabelPair(before, after))\n *     if opairs:\n */\n    }\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n\n    /* \"pywrapfst.pyx\":2253\n *     cdef int64 before\n *     cdef int64 after\n *     if ipairs:             # <<<<<<<<<<<<<<\n *       for (before, after) in ipairs:\n *         _ipairs.get().push_back(fst.LabelPair(before, after))\n */\n  }\n\n  /* \"pywrapfst.pyx\":2256\n *       for (before, after) in ipairs:\n *         _ipairs.get().push_back(fst.LabelPair(before, after))\n *     if opairs:             # <<<<<<<<<<<<<<\n *       for (before, after) in opairs:\n *         _opairs.get().push_back(fst.LabelPair(before, after))\n */\n  __pyx_t_2 = __Pyx_PyObject_IsTrue(__pyx_v_opairs); if (unlikely(__pyx_t_2 < 0)) __PYX_ERR(0, 2256, __pyx_L1_error)\n  if (__pyx_t_2) {\n\n    /* \"pywrapfst.pyx\":2257\n *         _ipairs.get().push_back(fst.LabelPair(before, after))\n *     if opairs:\n *       for (before, after) in opairs:             # <<<<<<<<<<<<<<\n *         _opairs.get().push_back(fst.LabelPair(before, after))\n *     if _ipairs.get().empty() and _opairs.get().empty():\n */\n    if (likely(PyList_CheckExact(__pyx_v_opairs)) || PyTuple_CheckExact(__pyx_v_opairs)) {\n      __pyx_t_3 = __pyx_v_opairs; __Pyx_INCREF(__pyx_t_3); __pyx_t_4 = 0;\n      __pyx_t_5 = NULL;\n    } else {\n      __pyx_t_4 = -1; __pyx_t_3 = PyObject_GetIter(__pyx_v_opairs); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 2257, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_3);\n      __pyx_t_5 = Py_TYPE(__pyx_t_3)->tp_iternext; if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 2257, __pyx_L1_error)\n    }\n    for (;;) {\n      if (likely(!__pyx_t_5)) {\n        if (likely(PyList_CheckExact(__pyx_t_3))) {\n          if (__pyx_t_4 >= PyList_GET_SIZE(__pyx_t_3)) break;\n          #if CYTHON_ASSUME_SAFE_MACROS && !CYTHON_AVOID_BORROWED_REFS\n          __pyx_t_6 = PyList_GET_ITEM(__pyx_t_3, __pyx_t_4); __Pyx_INCREF(__pyx_t_6); __pyx_t_4++; if (unlikely(0 < 0)) __PYX_ERR(0, 2257, __pyx_L1_error)\n          #else\n          __pyx_t_6 = PySequence_ITEM(__pyx_t_3, __pyx_t_4); __pyx_t_4++; if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 2257, __pyx_L1_error)\n          __Pyx_GOTREF(__pyx_t_6);\n          #endif\n        } else {\n          if (__pyx_t_4 >= PyTuple_GET_SIZE(__pyx_t_3)) break;\n          #if CYTHON_ASSUME_SAFE_MACROS && !CYTHON_AVOID_BORROWED_REFS\n          __pyx_t_6 = PyTuple_GET_ITEM(__pyx_t_3, __pyx_t_4); __Pyx_INCREF(__pyx_t_6); __pyx_t_4++; if (unlikely(0 < 0)) __PYX_ERR(0, 2257, __pyx_L1_error)\n          #else\n          __pyx_t_6 = PySequence_ITEM(__pyx_t_3, __pyx_t_4); __pyx_t_4++; if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 2257, __pyx_L1_error)\n          __Pyx_GOTREF(__pyx_t_6);\n          #endif\n        }\n      } else {\n        __pyx_t_6 = __pyx_t_5(__pyx_t_3);\n        if (unlikely(!__pyx_t_6)) {\n          PyObject* exc_type = PyErr_Occurred();\n          if (exc_type) {\n            if (likely(__Pyx_PyErr_GivenExceptionMatches(exc_type, PyExc_StopIteration))) PyErr_Clear();\n            else __PYX_ERR(0, 2257, __pyx_L1_error)\n          }\n          break;\n        }\n        __Pyx_GOTREF(__pyx_t_6);\n      }\n      if ((likely(PyTuple_CheckExact(__pyx_t_6))) || (PyList_CheckExact(__pyx_t_6))) {\n        PyObject* sequence = __pyx_t_6;\n        Py_ssize_t size = __Pyx_PySequence_SIZE(sequence);\n        if (unlikely(size != 2)) {\n          if (size > 2) __Pyx_RaiseTooManyValuesError(2);\n          else if (size >= 0) __Pyx_RaiseNeedMoreValuesError(size);\n          __PYX_ERR(0, 2257, __pyx_L1_error)\n        }\n        #if CYTHON_ASSUME_SAFE_MACROS && !CYTHON_AVOID_BORROWED_REFS\n        if (likely(PyTuple_CheckExact(sequence))) {\n          __pyx_t_8 = PyTuple_GET_ITEM(sequence, 0); \n          __pyx_t_7 = PyTuple_GET_ITEM(sequence, 1); \n        } else {\n          __pyx_t_8 = PyList_GET_ITEM(sequence, 0); \n          __pyx_t_7 = PyList_GET_ITEM(sequence, 1); \n        }\n        __Pyx_INCREF(__pyx_t_8);\n        __Pyx_INCREF(__pyx_t_7);\n        #else\n        __pyx_t_8 = PySequence_ITEM(sequence, 0); if (unlikely(!__pyx_t_8)) __PYX_ERR(0, 2257, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_8);\n        __pyx_t_7 = PySequence_ITEM(sequence, 1); if (unlikely(!__pyx_t_7)) __PYX_ERR(0, 2257, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_7);\n        #endif\n        __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n      } else {\n        Py_ssize_t index = -1;\n        __pyx_t_9 = PyObject_GetIter(__pyx_t_6); if (unlikely(!__pyx_t_9)) __PYX_ERR(0, 2257, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_9);\n        __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n        __pyx_t_10 = Py_TYPE(__pyx_t_9)->tp_iternext;\n        index = 0; __pyx_t_8 = __pyx_t_10(__pyx_t_9); if (unlikely(!__pyx_t_8)) goto __pyx_L11_unpacking_failed;\n        __Pyx_GOTREF(__pyx_t_8);\n        index = 1; __pyx_t_7 = __pyx_t_10(__pyx_t_9); if (unlikely(!__pyx_t_7)) goto __pyx_L11_unpacking_failed;\n        __Pyx_GOTREF(__pyx_t_7);\n        if (__Pyx_IternextUnpackEndCheck(__pyx_t_10(__pyx_t_9), 2) < 0) __PYX_ERR(0, 2257, __pyx_L1_error)\n        __pyx_t_10 = NULL;\n        __Pyx_DECREF(__pyx_t_9); __pyx_t_9 = 0;\n        goto __pyx_L12_unpacking_done;\n        __pyx_L11_unpacking_failed:;\n        __Pyx_DECREF(__pyx_t_9); __pyx_t_9 = 0;\n        __pyx_t_10 = NULL;\n        if (__Pyx_IterFinish() == 0) __Pyx_RaiseNeedMoreValuesError(index);\n        __PYX_ERR(0, 2257, __pyx_L1_error)\n        __pyx_L12_unpacking_done:;\n      }\n      __pyx_t_12 = __Pyx_PyInt_As_int64_t(__pyx_t_8); if (unlikely((__pyx_t_12 == ((int64_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 2257, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0;\n      __pyx_t_11 = __Pyx_PyInt_As_int64_t(__pyx_t_7); if (unlikely((__pyx_t_11 == ((int64_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 2257, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0;\n      __pyx_v_before = __pyx_t_12;\n      __pyx_v_after = __pyx_t_11;\n\n      /* \"pywrapfst.pyx\":2258\n *     if opairs:\n *       for (before, after) in opairs:\n *         _opairs.get().push_back(fst.LabelPair(before, after))             # <<<<<<<<<<<<<<\n *     if _ipairs.get().empty() and _opairs.get().empty():\n *       raise FstArgError(\"No relabeling pairs specified.\")\n */\n      try {\n        __pyx_t_13 = __pyx_t_3fst_LabelPair(__pyx_v_before, __pyx_v_after);\n      } catch(...) {\n        __Pyx_CppExn2PyErr();\n        __PYX_ERR(0, 2258, __pyx_L1_error)\n      }\n      try {\n        __pyx_v__opairs.get()->push_back(__pyx_t_13);\n      } catch(...) {\n        __Pyx_CppExn2PyErr();\n        __PYX_ERR(0, 2258, __pyx_L1_error)\n      }\n\n      /* \"pywrapfst.pyx\":2257\n *         _ipairs.get().push_back(fst.LabelPair(before, after))\n *     if opairs:\n *       for (before, after) in opairs:             # <<<<<<<<<<<<<<\n *         _opairs.get().push_back(fst.LabelPair(before, after))\n *     if _ipairs.get().empty() and _opairs.get().empty():\n */\n    }\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n\n    /* \"pywrapfst.pyx\":2256\n *       for (before, after) in ipairs:\n *         _ipairs.get().push_back(fst.LabelPair(before, after))\n *     if opairs:             # <<<<<<<<<<<<<<\n *       for (before, after) in opairs:\n *         _opairs.get().push_back(fst.LabelPair(before, after))\n */\n  }\n\n  /* \"pywrapfst.pyx\":2259\n *       for (before, after) in opairs:\n *         _opairs.get().push_back(fst.LabelPair(before, after))\n *     if _ipairs.get().empty() and _opairs.get().empty():             # <<<<<<<<<<<<<<\n *       raise FstArgError(\"No relabeling pairs specified.\")\n *     fst.Relabel(self._mfst.get(), deref(_ipairs), deref(_opairs))\n */\n  __pyx_t_14 = (__pyx_v__ipairs.get()->empty() != 0);\n  if (__pyx_t_14) {\n  } else {\n    __pyx_t_2 = __pyx_t_14;\n    goto __pyx_L14_bool_binop_done;\n  }\n  __pyx_t_14 = (__pyx_v__opairs.get()->empty() != 0);\n  __pyx_t_2 = __pyx_t_14;\n  __pyx_L14_bool_binop_done:;\n  if (unlikely(__pyx_t_2)) {\n\n    /* \"pywrapfst.pyx\":2260\n *         _opairs.get().push_back(fst.LabelPair(before, after))\n *     if _ipairs.get().empty() and _opairs.get().empty():\n *       raise FstArgError(\"No relabeling pairs specified.\")             # <<<<<<<<<<<<<<\n *     fst.Relabel(self._mfst.get(), deref(_ipairs), deref(_opairs))\n *     self._check_mutating_imethod()\n */\n    __pyx_t_3 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstArgError); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 2260, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_3);\n    __pyx_t_6 = __Pyx_PyObject_Call(__pyx_t_3, __pyx_tuple__43, NULL); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 2260, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_6);\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    __Pyx_Raise(__pyx_t_6, 0, 0, 0);\n    __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n    __PYX_ERR(0, 2260, __pyx_L1_error)\n\n    /* \"pywrapfst.pyx\":2259\n *       for (before, after) in opairs:\n *         _opairs.get().push_back(fst.LabelPair(before, after))\n *     if _ipairs.get().empty() and _opairs.get().empty():             # <<<<<<<<<<<<<<\n *       raise FstArgError(\"No relabeling pairs specified.\")\n *     fst.Relabel(self._mfst.get(), deref(_ipairs), deref(_opairs))\n */\n  }\n\n  /* \"pywrapfst.pyx\":2261\n *     if _ipairs.get().empty() and _opairs.get().empty():\n *       raise FstArgError(\"No relabeling pairs specified.\")\n *     fst.Relabel(self._mfst.get(), deref(_ipairs), deref(_opairs))             # <<<<<<<<<<<<<<\n *     self._check_mutating_imethod()\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_mfst\");\n    __PYX_ERR(0, 2261, __pyx_L1_error)\n  }\n  fst::script::Relabel(__pyx_v_self->_mfst.get(), (*__pyx_v__ipairs), (*__pyx_v__opairs));\n\n  /* \"pywrapfst.pyx\":2262\n *       raise FstArgError(\"No relabeling pairs specified.\")\n *     fst.Relabel(self._mfst.get(), deref(_ipairs), deref(_opairs))\n *     self._check_mutating_imethod()             # <<<<<<<<<<<<<<\n * \n *   def relabel_pairs(self, ipairs=None, opairs=None):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_check_mutating_imethod\");\n    __PYX_ERR(0, 2262, __pyx_L1_error)\n  }\n  ((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->_check_mutating_imethod(__pyx_v_self); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 2262, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":2246\n *     return self\n * \n *   cdef void _relabel_pairs(self, ipairs=None, opairs=None) except *:             # <<<<<<<<<<<<<<\n *     cdef unique_ptr[vector[fst.LabelPair]] _ipairs\n *     _ipairs.reset(new vector[fst.LabelPair]())\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_6);\n  __Pyx_XDECREF(__pyx_t_7);\n  __Pyx_XDECREF(__pyx_t_8);\n  __Pyx_XDECREF(__pyx_t_9);\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst._relabel_pairs\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n}\n\n/* \"pywrapfst.pyx\":2264\n *     self._check_mutating_imethod()\n * \n *   def relabel_pairs(self, ipairs=None, opairs=None):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     relabel_pairs(self, ipairs=None, opairs=None)\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_39relabel_pairs(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic char __pyx_doc_9pywrapfst_11_MutableFst_38relabel_pairs[] = \"\\n    relabel_pairs(self, ipairs=None, opairs=None)\\n\\n    Replaces input and/or output labels using pairs of labels.\\n\\n    This operation destructively relabels the input and/or output labels of the\\n    FST using pairs of the form (old_ID, new_ID); omitted indices are\\n    identity-mapped.\\n\\n    Args:\\n      ipairs: An iterable containing (older index, newer index) integer pairs.\\n      opairs: An iterable containing (older index, newer index) integer pairs.\\n\\n    Returns:\\n      self.\\n\\n    Raises:\\n      FstArgError: No relabeling pairs specified.\\n\\n    See also: `decode`, `encode`, `project`, `relabel_tables`.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_39relabel_pairs(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  PyObject *__pyx_v_ipairs = 0;\n  PyObject *__pyx_v_opairs = 0;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"relabel_pairs (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_ipairs,&__pyx_n_s_opairs,0};\n    PyObject* values[2] = {0,0};\n    values[0] = ((PyObject *)Py_None);\n    values[1] = ((PyObject *)Py_None);\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_ipairs);\n          if (value) { values[0] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  1:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_opairs);\n          if (value) { values[1] = value; kw_args--; }\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"relabel_pairs\") < 0)) __PYX_ERR(0, 2264, __pyx_L3_error)\n      }\n    } else {\n      switch (PyTuple_GET_SIZE(__pyx_args)) {\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n    }\n    __pyx_v_ipairs = values[0];\n    __pyx_v_opairs = values[1];\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"relabel_pairs\", 0, 0, 2, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 2264, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst.relabel_pairs\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  __pyx_r = __pyx_pf_9pywrapfst_11_MutableFst_38relabel_pairs(((struct __pyx_obj_9pywrapfst__MutableFst *)__pyx_v_self), __pyx_v_ipairs, __pyx_v_opairs);\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_38relabel_pairs(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, PyObject *__pyx_v_ipairs, PyObject *__pyx_v_opairs) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  struct __pyx_opt_args_9pywrapfst_11_MutableFst__relabel_pairs __pyx_t_1;\n  __Pyx_RefNannySetupContext(\"relabel_pairs\", 0);\n\n  /* \"pywrapfst.pyx\":2286\n *     See also: `decode`, `encode`, `project`, `relabel_tables`.\n *     \"\"\"\n *     self._relabel_pairs(ipairs, opairs)             # <<<<<<<<<<<<<<\n *     return self\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_relabel_pairs\");\n    __PYX_ERR(0, 2286, __pyx_L1_error)\n  }\n  __pyx_t_1.__pyx_n = 2;\n  __pyx_t_1.ipairs = __pyx_v_ipairs;\n  __pyx_t_1.opairs = __pyx_v_opairs;\n  ((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->_relabel_pairs(__pyx_v_self, &__pyx_t_1); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 2286, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":2287\n *     \"\"\"\n *     self._relabel_pairs(ipairs, opairs)\n *     return self             # <<<<<<<<<<<<<<\n * \n *   cdef void _relabel_tables(self,\n */\n  __Pyx_XDECREF(__pyx_r);\n  __Pyx_INCREF(((PyObject *)__pyx_v_self));\n  __pyx_r = ((PyObject *)__pyx_v_self);\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":2264\n *     self._check_mutating_imethod()\n * \n *   def relabel_pairs(self, ipairs=None, opairs=None):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     relabel_pairs(self, ipairs=None, opairs=None)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst.relabel_pairs\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":2289\n *     return self\n * \n *   cdef void _relabel_tables(self,             # <<<<<<<<<<<<<<\n *                             _SymbolTable old_isymbols=None,\n *                             _SymbolTable new_isymbols=None,\n */\n\nstatic void __pyx_f_9pywrapfst_11_MutableFst__relabel_tables(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, struct __pyx_opt_args_9pywrapfst_11_MutableFst__relabel_tables *__pyx_optional_args) {\n\n  /* \"pywrapfst.pyx\":2290\n * \n *   cdef void _relabel_tables(self,\n *                             _SymbolTable old_isymbols=None,             # <<<<<<<<<<<<<<\n *                             _SymbolTable new_isymbols=None,\n *                             unknown_isymbol=b\"\",\n */\n  struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_old_isymbols = ((struct __pyx_obj_9pywrapfst__SymbolTable *)Py_None);\n\n  /* \"pywrapfst.pyx\":2291\n *   cdef void _relabel_tables(self,\n *                             _SymbolTable old_isymbols=None,\n *                             _SymbolTable new_isymbols=None,             # <<<<<<<<<<<<<<\n *                             unknown_isymbol=b\"\",\n *                             bool attach_new_isymbols=True,\n */\n  struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_new_isymbols = ((struct __pyx_obj_9pywrapfst__SymbolTable *)Py_None);\n  PyObject *__pyx_v_unknown_isymbol = ((PyObject *)__pyx_kp_b__24);\n\n  /* \"pywrapfst.pyx\":2293\n *                             _SymbolTable new_isymbols=None,\n *                             unknown_isymbol=b\"\",\n *                             bool attach_new_isymbols=True,             # <<<<<<<<<<<<<<\n *                             _SymbolTable old_osymbols=None,\n *                             _SymbolTable new_osymbols=None,\n */\n  bool __pyx_v_attach_new_isymbols = ((bool)1);\n\n  /* \"pywrapfst.pyx\":2294\n *                             unknown_isymbol=b\"\",\n *                             bool attach_new_isymbols=True,\n *                             _SymbolTable old_osymbols=None,             # <<<<<<<<<<<<<<\n *                             _SymbolTable new_osymbols=None,\n *                             unknown_osymbol=b\"\",\n */\n  struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_old_osymbols = ((struct __pyx_obj_9pywrapfst__SymbolTable *)Py_None);\n\n  /* \"pywrapfst.pyx\":2295\n *                             bool attach_new_isymbols=True,\n *                             _SymbolTable old_osymbols=None,\n *                             _SymbolTable new_osymbols=None,             # <<<<<<<<<<<<<<\n *                             unknown_osymbol=b\"\",\n *                             bool attach_new_osymbols=True) except *:\n */\n  struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_new_osymbols = ((struct __pyx_obj_9pywrapfst__SymbolTable *)Py_None);\n  PyObject *__pyx_v_unknown_osymbol = ((PyObject *)__pyx_kp_b__24);\n\n  /* \"pywrapfst.pyx\":2297\n *                             _SymbolTable new_osymbols=None,\n *                             unknown_osymbol=b\"\",\n *                             bool attach_new_osymbols=True) except *:             # <<<<<<<<<<<<<<\n *     if new_isymbols is None and new_osymbols is None:\n *       raise FstArgError(\"No new SymbolTables specified\")\n */\n  bool __pyx_v_attach_new_osymbols = ((bool)1);\n  fst::SymbolTable *__pyx_v_new_isymbols_ptr;\n  fst::SymbolTable *__pyx_v_new_osymbols_ptr;\n  __Pyx_RefNannyDeclarations\n  int __pyx_t_1;\n  int __pyx_t_2;\n  int __pyx_t_3;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  fst::SymbolTable *__pyx_t_6;\n  fst::SymbolTable const *__pyx_t_7;\n  std::string __pyx_t_8;\n  fst::SymbolTable const *__pyx_t_9;\n  std::string __pyx_t_10;\n  __Pyx_RefNannySetupContext(\"_relabel_tables\", 0);\n  if (__pyx_optional_args) {\n    if (__pyx_optional_args->__pyx_n > 0) {\n      __pyx_v_old_isymbols = __pyx_optional_args->old_isymbols;\n      if (__pyx_optional_args->__pyx_n > 1) {\n        __pyx_v_new_isymbols = __pyx_optional_args->new_isymbols;\n        if (__pyx_optional_args->__pyx_n > 2) {\n          __pyx_v_unknown_isymbol = __pyx_optional_args->unknown_isymbol;\n          if (__pyx_optional_args->__pyx_n > 3) {\n            __pyx_v_attach_new_isymbols = __pyx_optional_args->attach_new_isymbols;\n            if (__pyx_optional_args->__pyx_n > 4) {\n              __pyx_v_old_osymbols = __pyx_optional_args->old_osymbols;\n              if (__pyx_optional_args->__pyx_n > 5) {\n                __pyx_v_new_osymbols = __pyx_optional_args->new_osymbols;\n                if (__pyx_optional_args->__pyx_n > 6) {\n                  __pyx_v_unknown_osymbol = __pyx_optional_args->unknown_osymbol;\n                  if (__pyx_optional_args->__pyx_n > 7) {\n                    __pyx_v_attach_new_osymbols = __pyx_optional_args->attach_new_osymbols;\n                  }\n                }\n              }\n            }\n          }\n        }\n      }\n    }\n  }\n\n  /* \"pywrapfst.pyx\":2298\n *                             unknown_osymbol=b\"\",\n *                             bool attach_new_osymbols=True) except *:\n *     if new_isymbols is None and new_osymbols is None:             # <<<<<<<<<<<<<<\n *       raise FstArgError(\"No new SymbolTables specified\")\n *     cdef fst.SymbolTable *new_isymbols_ptr = NULL\n */\n  __pyx_t_2 = (((PyObject *)__pyx_v_new_isymbols) == Py_None);\n  __pyx_t_3 = (__pyx_t_2 != 0);\n  if (__pyx_t_3) {\n  } else {\n    __pyx_t_1 = __pyx_t_3;\n    goto __pyx_L4_bool_binop_done;\n  }\n  __pyx_t_3 = (((PyObject *)__pyx_v_new_osymbols) == Py_None);\n  __pyx_t_2 = (__pyx_t_3 != 0);\n  __pyx_t_1 = __pyx_t_2;\n  __pyx_L4_bool_binop_done:;\n  if (unlikely(__pyx_t_1)) {\n\n    /* \"pywrapfst.pyx\":2299\n *                             bool attach_new_osymbols=True) except *:\n *     if new_isymbols is None and new_osymbols is None:\n *       raise FstArgError(\"No new SymbolTables specified\")             # <<<<<<<<<<<<<<\n *     cdef fst.SymbolTable *new_isymbols_ptr = NULL\n *     if new_isymbols is not None:\n */\n    __pyx_t_4 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstArgError); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 2299, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_4);\n    __pyx_t_5 = __Pyx_PyObject_Call(__pyx_t_4, __pyx_tuple__44, NULL); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 2299, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_5);\n    __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n    __Pyx_Raise(__pyx_t_5, 0, 0, 0);\n    __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n    __PYX_ERR(0, 2299, __pyx_L1_error)\n\n    /* \"pywrapfst.pyx\":2298\n *                             unknown_osymbol=b\"\",\n *                             bool attach_new_osymbols=True) except *:\n *     if new_isymbols is None and new_osymbols is None:             # <<<<<<<<<<<<<<\n *       raise FstArgError(\"No new SymbolTables specified\")\n *     cdef fst.SymbolTable *new_isymbols_ptr = NULL\n */\n  }\n\n  /* \"pywrapfst.pyx\":2300\n *     if new_isymbols is None and new_osymbols is None:\n *       raise FstArgError(\"No new SymbolTables specified\")\n *     cdef fst.SymbolTable *new_isymbols_ptr = NULL             # <<<<<<<<<<<<<<\n *     if new_isymbols is not None:\n *       new_isymbols_ptr = new_isymbols._table\n */\n  __pyx_v_new_isymbols_ptr = NULL;\n\n  /* \"pywrapfst.pyx\":2301\n *       raise FstArgError(\"No new SymbolTables specified\")\n *     cdef fst.SymbolTable *new_isymbols_ptr = NULL\n *     if new_isymbols is not None:             # <<<<<<<<<<<<<<\n *       new_isymbols_ptr = new_isymbols._table\n *     cdef fst.SymbolTable *new_osymbols_ptr = NULL\n */\n  __pyx_t_1 = (((PyObject *)__pyx_v_new_isymbols) != Py_None);\n  __pyx_t_2 = (__pyx_t_1 != 0);\n  if (__pyx_t_2) {\n\n    /* \"pywrapfst.pyx\":2302\n *     cdef fst.SymbolTable *new_isymbols_ptr = NULL\n *     if new_isymbols is not None:\n *       new_isymbols_ptr = new_isymbols._table             # <<<<<<<<<<<<<<\n *     cdef fst.SymbolTable *new_osymbols_ptr = NULL\n *     if new_osymbols is not None:\n */\n    if (unlikely(((PyObject *)__pyx_v_new_isymbols) == Py_None)) {\n      PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_table\");\n      __PYX_ERR(0, 2302, __pyx_L1_error)\n    }\n    __pyx_t_6 = __pyx_v_new_isymbols->_table;\n    __pyx_v_new_isymbols_ptr = __pyx_t_6;\n\n    /* \"pywrapfst.pyx\":2301\n *       raise FstArgError(\"No new SymbolTables specified\")\n *     cdef fst.SymbolTable *new_isymbols_ptr = NULL\n *     if new_isymbols is not None:             # <<<<<<<<<<<<<<\n *       new_isymbols_ptr = new_isymbols._table\n *     cdef fst.SymbolTable *new_osymbols_ptr = NULL\n */\n  }\n\n  /* \"pywrapfst.pyx\":2303\n *     if new_isymbols is not None:\n *       new_isymbols_ptr = new_isymbols._table\n *     cdef fst.SymbolTable *new_osymbols_ptr = NULL             # <<<<<<<<<<<<<<\n *     if new_osymbols is not None:\n *       new_osymbols_ptr = new_osymbols._table\n */\n  __pyx_v_new_osymbols_ptr = NULL;\n\n  /* \"pywrapfst.pyx\":2304\n *       new_isymbols_ptr = new_isymbols._table\n *     cdef fst.SymbolTable *new_osymbols_ptr = NULL\n *     if new_osymbols is not None:             # <<<<<<<<<<<<<<\n *       new_osymbols_ptr = new_osymbols._table\n *     fst.Relabel(self._mfst.get(),\n */\n  __pyx_t_2 = (((PyObject *)__pyx_v_new_osymbols) != Py_None);\n  __pyx_t_1 = (__pyx_t_2 != 0);\n  if (__pyx_t_1) {\n\n    /* \"pywrapfst.pyx\":2305\n *     cdef fst.SymbolTable *new_osymbols_ptr = NULL\n *     if new_osymbols is not None:\n *       new_osymbols_ptr = new_osymbols._table             # <<<<<<<<<<<<<<\n *     fst.Relabel(self._mfst.get(),\n *         self._fst.get().InputSymbols() if old_isymbols is None else\n */\n    if (unlikely(((PyObject *)__pyx_v_new_osymbols) == Py_None)) {\n      PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_table\");\n      __PYX_ERR(0, 2305, __pyx_L1_error)\n    }\n    __pyx_t_6 = __pyx_v_new_osymbols->_table;\n    __pyx_v_new_osymbols_ptr = __pyx_t_6;\n\n    /* \"pywrapfst.pyx\":2304\n *       new_isymbols_ptr = new_isymbols._table\n *     cdef fst.SymbolTable *new_osymbols_ptr = NULL\n *     if new_osymbols is not None:             # <<<<<<<<<<<<<<\n *       new_osymbols_ptr = new_osymbols._table\n *     fst.Relabel(self._mfst.get(),\n */\n  }\n\n  /* \"pywrapfst.pyx\":2306\n *     if new_osymbols is not None:\n *       new_osymbols_ptr = new_osymbols._table\n *     fst.Relabel(self._mfst.get(),             # <<<<<<<<<<<<<<\n *         self._fst.get().InputSymbols() if old_isymbols is None else\n *         old_isymbols._table, new_isymbols_ptr, tostring(unknown_isymbol),\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_mfst\");\n    __PYX_ERR(0, 2306, __pyx_L1_error)\n  }\n\n  /* \"pywrapfst.pyx\":2307\n *       new_osymbols_ptr = new_osymbols._table\n *     fst.Relabel(self._mfst.get(),\n *         self._fst.get().InputSymbols() if old_isymbols is None else             # <<<<<<<<<<<<<<\n *         old_isymbols._table, new_isymbols_ptr, tostring(unknown_isymbol),\n *         attach_new_isymbols,\n */\n  __pyx_t_1 = (((PyObject *)__pyx_v_old_isymbols) == Py_None);\n  if ((__pyx_t_1 != 0)) {\n    if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n      PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n      __PYX_ERR(0, 2307, __pyx_L1_error)\n    }\n    __pyx_t_7 = __pyx_v_self->__pyx_base._fst.get()->InputSymbols();\n  } else {\n\n    /* \"pywrapfst.pyx\":2308\n *     fst.Relabel(self._mfst.get(),\n *         self._fst.get().InputSymbols() if old_isymbols is None else\n *         old_isymbols._table, new_isymbols_ptr, tostring(unknown_isymbol),             # <<<<<<<<<<<<<<\n *         attach_new_isymbols,\n *         self._fst.get().OutputSymbols() if old_osymbols is None else\n */\n    if (unlikely(((PyObject *)__pyx_v_old_isymbols) == Py_None)) {\n      PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_table\");\n      __PYX_ERR(0, 2308, __pyx_L1_error)\n    }\n    __pyx_t_7 = __pyx_v_old_isymbols->_table;\n  }\n  __pyx_t_8 = __pyx_f_9pywrapfst_tostring(__pyx_v_unknown_isymbol, NULL); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 2308, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":2310\n *         old_isymbols._table, new_isymbols_ptr, tostring(unknown_isymbol),\n *         attach_new_isymbols,\n *         self._fst.get().OutputSymbols() if old_osymbols is None else             # <<<<<<<<<<<<<<\n *         old_osymbols._table, new_osymbols_ptr, tostring(unknown_osymbol),\n *         attach_new_osymbols)\n */\n  __pyx_t_1 = (((PyObject *)__pyx_v_old_osymbols) == Py_None);\n  if ((__pyx_t_1 != 0)) {\n    if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n      PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n      __PYX_ERR(0, 2310, __pyx_L1_error)\n    }\n    __pyx_t_9 = __pyx_v_self->__pyx_base._fst.get()->OutputSymbols();\n  } else {\n\n    /* \"pywrapfst.pyx\":2311\n *         attach_new_isymbols,\n *         self._fst.get().OutputSymbols() if old_osymbols is None else\n *         old_osymbols._table, new_osymbols_ptr, tostring(unknown_osymbol),             # <<<<<<<<<<<<<<\n *         attach_new_osymbols)\n *     self._check_mutating_imethod()\n */\n    if (unlikely(((PyObject *)__pyx_v_old_osymbols) == Py_None)) {\n      PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_table\");\n      __PYX_ERR(0, 2311, __pyx_L1_error)\n    }\n    __pyx_t_9 = __pyx_v_old_osymbols->_table;\n  }\n  __pyx_t_10 = __pyx_f_9pywrapfst_tostring(__pyx_v_unknown_osymbol, NULL); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 2311, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":2306\n *     if new_osymbols is not None:\n *       new_osymbols_ptr = new_osymbols._table\n *     fst.Relabel(self._mfst.get(),             # <<<<<<<<<<<<<<\n *         self._fst.get().InputSymbols() if old_isymbols is None else\n *         old_isymbols._table, new_isymbols_ptr, tostring(unknown_isymbol),\n */\n  fst::script::Relabel(__pyx_v_self->_mfst.get(), __pyx_t_7, __pyx_v_new_isymbols_ptr, __pyx_t_8, __pyx_v_attach_new_isymbols, __pyx_t_9, __pyx_v_new_osymbols_ptr, __pyx_t_10, __pyx_v_attach_new_osymbols);\n\n  /* \"pywrapfst.pyx\":2313\n *         old_osymbols._table, new_osymbols_ptr, tostring(unknown_osymbol),\n *         attach_new_osymbols)\n *     self._check_mutating_imethod()             # <<<<<<<<<<<<<<\n * \n *   def relabel_tables(self,\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_check_mutating_imethod\");\n    __PYX_ERR(0, 2313, __pyx_L1_error)\n  }\n  ((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->_check_mutating_imethod(__pyx_v_self); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 2313, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":2289\n *     return self\n * \n *   cdef void _relabel_tables(self,             # <<<<<<<<<<<<<<\n *                             _SymbolTable old_isymbols=None,\n *                             _SymbolTable new_isymbols=None,\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst._relabel_tables\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n}\n\n/* \"pywrapfst.pyx\":2315\n *     self._check_mutating_imethod()\n * \n *   def relabel_tables(self,             # <<<<<<<<<<<<<<\n *                      _SymbolTable old_isymbols=None,\n *                      _SymbolTable new_isymbols=None,\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_41relabel_tables(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic char __pyx_doc_9pywrapfst_11_MutableFst_40relabel_tables[] = \"\\n    relabel_tables(self, old_isymbols=None, new_isymbols=None,\\n                   unknown_isymbol=\\\"\\\", attach_new_isymbols=True,\\n                   old_osymbols=None, new_osymbols=None,\\n                   unknown_osymbol=\\\"\\\", attach_new_osymbols=True)\\n\\n    Replaces input and/or output labels using SymbolTables.\\n\\n    This operation destructively relabels the input and/or output labels of the\\n    FST using user-specified symbol tables; omitted symbols are identity-mapped.\\n\\n    Args:\\n       old_isymbols: The old SymbolTable for input labels, defaulting to the\\n          FST's input symbol table.\\n       new_isymbols: A SymbolTable used to relabel the input labels\\n       unknown_isymbol: Input symbol to use to relabel OOVs (if empty,\\n          OOVs raise an exception)\\n       attach_new_isymbols: Should new_isymbols be made the FST's input symbol\\n          table?\\n       old_osymbols: The old SymbolTable for output labels, defaulting to the\\n          FST's output symbol table.\\n       new_osymbols: A SymbolTable used to relabel the output labels.\\n       unknown_osymbol: Outnput symbol to use to relabel OOVs (if empty,\\n          OOVs raise an exception)\\n       attach_new_isymbols: Should new_osymbols be made the FST's output symbol\\n          table?\\n\\n    Returns:\\n      self.\\n\\n    Raises:\\n      FstArgError: No SymbolTable specified.\\n\\n    See also: `decode`, `encode`, `project`, `relabel_pairs`.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_41relabel_tables(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_old_isymbols = 0;\n  struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_new_isymbols = 0;\n  PyObject *__pyx_v_unknown_isymbol = 0;\n  bool __pyx_v_attach_new_isymbols;\n  struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_old_osymbols = 0;\n  struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_new_osymbols = 0;\n  PyObject *__pyx_v_unknown_osymbol = 0;\n  bool __pyx_v_attach_new_osymbols;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"relabel_tables (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_old_isymbols,&__pyx_n_s_new_isymbols,&__pyx_n_s_unknown_isymbol,&__pyx_n_s_attach_new_isymbols,&__pyx_n_s_old_osymbols,&__pyx_n_s_new_osymbols,&__pyx_n_s_unknown_osymbol,&__pyx_n_s_attach_new_osymbols,0};\n    PyObject* values[8] = {0,0,0,0,0,0,0,0};\n\n    /* \"pywrapfst.pyx\":2316\n * \n *   def relabel_tables(self,\n *                      _SymbolTable old_isymbols=None,             # <<<<<<<<<<<<<<\n *                      _SymbolTable new_isymbols=None,\n *                      unknown_isymbol=b\"\",\n */\n    values[0] = (PyObject *)((struct __pyx_obj_9pywrapfst__SymbolTable *)Py_None);\n\n    /* \"pywrapfst.pyx\":2317\n *   def relabel_tables(self,\n *                      _SymbolTable old_isymbols=None,\n *                      _SymbolTable new_isymbols=None,             # <<<<<<<<<<<<<<\n *                      unknown_isymbol=b\"\",\n *                      bool attach_new_isymbols=True,\n */\n    values[1] = (PyObject *)((struct __pyx_obj_9pywrapfst__SymbolTable *)Py_None);\n    values[2] = ((PyObject *)__pyx_kp_b__24);\n\n    /* \"pywrapfst.pyx\":2320\n *                      unknown_isymbol=b\"\",\n *                      bool attach_new_isymbols=True,\n *                      _SymbolTable old_osymbols=None,             # <<<<<<<<<<<<<<\n *                      _SymbolTable new_osymbols=None,\n *                      unknown_osymbol=b\"\",\n */\n    values[4] = (PyObject *)((struct __pyx_obj_9pywrapfst__SymbolTable *)Py_None);\n\n    /* \"pywrapfst.pyx\":2321\n *                      bool attach_new_isymbols=True,\n *                      _SymbolTable old_osymbols=None,\n *                      _SymbolTable new_osymbols=None,             # <<<<<<<<<<<<<<\n *                      unknown_osymbol=b\"\",\n *                      bool attach_new_osymbols=True):\n */\n    values[5] = (PyObject *)((struct __pyx_obj_9pywrapfst__SymbolTable *)Py_None);\n    values[6] = ((PyObject *)__pyx_kp_b__24);\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  8: values[7] = PyTuple_GET_ITEM(__pyx_args, 7);\n        CYTHON_FALLTHROUGH;\n        case  7: values[6] = PyTuple_GET_ITEM(__pyx_args, 6);\n        CYTHON_FALLTHROUGH;\n        case  6: values[5] = PyTuple_GET_ITEM(__pyx_args, 5);\n        CYTHON_FALLTHROUGH;\n        case  5: values[4] = PyTuple_GET_ITEM(__pyx_args, 4);\n        CYTHON_FALLTHROUGH;\n        case  4: values[3] = PyTuple_GET_ITEM(__pyx_args, 3);\n        CYTHON_FALLTHROUGH;\n        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);\n        CYTHON_FALLTHROUGH;\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_old_isymbols);\n          if (value) { values[0] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  1:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_new_isymbols);\n          if (value) { values[1] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  2:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_unknown_isymbol);\n          if (value) { values[2] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  3:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_attach_new_isymbols);\n          if (value) { values[3] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  4:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_old_osymbols);\n          if (value) { values[4] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  5:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_new_osymbols);\n          if (value) { values[5] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  6:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_unknown_osymbol);\n          if (value) { values[6] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  7:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_attach_new_osymbols);\n          if (value) { values[7] = value; kw_args--; }\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"relabel_tables\") < 0)) __PYX_ERR(0, 2315, __pyx_L3_error)\n      }\n    } else {\n      switch (PyTuple_GET_SIZE(__pyx_args)) {\n        case  8: values[7] = PyTuple_GET_ITEM(__pyx_args, 7);\n        CYTHON_FALLTHROUGH;\n        case  7: values[6] = PyTuple_GET_ITEM(__pyx_args, 6);\n        CYTHON_FALLTHROUGH;\n        case  6: values[5] = PyTuple_GET_ITEM(__pyx_args, 5);\n        CYTHON_FALLTHROUGH;\n        case  5: values[4] = PyTuple_GET_ITEM(__pyx_args, 4);\n        CYTHON_FALLTHROUGH;\n        case  4: values[3] = PyTuple_GET_ITEM(__pyx_args, 3);\n        CYTHON_FALLTHROUGH;\n        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);\n        CYTHON_FALLTHROUGH;\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n    }\n    __pyx_v_old_isymbols = ((struct __pyx_obj_9pywrapfst__SymbolTable *)values[0]);\n    __pyx_v_new_isymbols = ((struct __pyx_obj_9pywrapfst__SymbolTable *)values[1]);\n    __pyx_v_unknown_isymbol = values[2];\n    if (values[3]) {\n      __pyx_v_attach_new_isymbols = __Pyx_PyObject_IsTrue(values[3]); if (unlikely((__pyx_v_attach_new_isymbols == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 2319, __pyx_L3_error)\n    } else {\n\n      /* \"pywrapfst.pyx\":2319\n *                      _SymbolTable new_isymbols=None,\n *                      unknown_isymbol=b\"\",\n *                      bool attach_new_isymbols=True,             # <<<<<<<<<<<<<<\n *                      _SymbolTable old_osymbols=None,\n *                      _SymbolTable new_osymbols=None,\n */\n      __pyx_v_attach_new_isymbols = ((bool)1);\n    }\n    __pyx_v_old_osymbols = ((struct __pyx_obj_9pywrapfst__SymbolTable *)values[4]);\n    __pyx_v_new_osymbols = ((struct __pyx_obj_9pywrapfst__SymbolTable *)values[5]);\n    __pyx_v_unknown_osymbol = values[6];\n    if (values[7]) {\n      __pyx_v_attach_new_osymbols = __Pyx_PyObject_IsTrue(values[7]); if (unlikely((__pyx_v_attach_new_osymbols == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 2323, __pyx_L3_error)\n    } else {\n\n      /* \"pywrapfst.pyx\":2323\n *                      _SymbolTable new_osymbols=None,\n *                      unknown_osymbol=b\"\",\n *                      bool attach_new_osymbols=True):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     relabel_tables(self, old_isymbols=None, new_isymbols=None,\n */\n      __pyx_v_attach_new_osymbols = ((bool)1);\n    }\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"relabel_tables\", 0, 0, 8, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 2315, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst.relabel_tables\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_old_isymbols), __pyx_ptype_9pywrapfst__SymbolTable, 1, \"old_isymbols\", 0))) __PYX_ERR(0, 2316, __pyx_L1_error)\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_new_isymbols), __pyx_ptype_9pywrapfst__SymbolTable, 1, \"new_isymbols\", 0))) __PYX_ERR(0, 2317, __pyx_L1_error)\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_old_osymbols), __pyx_ptype_9pywrapfst__SymbolTable, 1, \"old_osymbols\", 0))) __PYX_ERR(0, 2320, __pyx_L1_error)\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_new_osymbols), __pyx_ptype_9pywrapfst__SymbolTable, 1, \"new_osymbols\", 0))) __PYX_ERR(0, 2321, __pyx_L1_error)\n  __pyx_r = __pyx_pf_9pywrapfst_11_MutableFst_40relabel_tables(((struct __pyx_obj_9pywrapfst__MutableFst *)__pyx_v_self), __pyx_v_old_isymbols, __pyx_v_new_isymbols, __pyx_v_unknown_isymbol, __pyx_v_attach_new_isymbols, __pyx_v_old_osymbols, __pyx_v_new_osymbols, __pyx_v_unknown_osymbol, __pyx_v_attach_new_osymbols);\n\n  /* \"pywrapfst.pyx\":2315\n *     self._check_mutating_imethod()\n * \n *   def relabel_tables(self,             # <<<<<<<<<<<<<<\n *                      _SymbolTable old_isymbols=None,\n *                      _SymbolTable new_isymbols=None,\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_40relabel_tables(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_old_isymbols, struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_new_isymbols, PyObject *__pyx_v_unknown_isymbol, bool __pyx_v_attach_new_isymbols, struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_old_osymbols, struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_new_osymbols, PyObject *__pyx_v_unknown_osymbol, bool __pyx_v_attach_new_osymbols) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  struct __pyx_opt_args_9pywrapfst_11_MutableFst__relabel_tables __pyx_t_1;\n  __Pyx_RefNannySetupContext(\"relabel_tables\", 0);\n\n  /* \"pywrapfst.pyx\":2359\n *     See also: `decode`, `encode`, `project`, `relabel_pairs`.\n *     \"\"\"\n *     self._relabel_tables(old_isymbols, new_isymbols,             # <<<<<<<<<<<<<<\n *                          unknown_isymbol, attach_new_isymbols,\n *                          old_osymbols, new_osymbols,\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_relabel_tables\");\n    __PYX_ERR(0, 2359, __pyx_L1_error)\n  }\n\n  /* \"pywrapfst.pyx\":2362\n *                          unknown_isymbol, attach_new_isymbols,\n *                          old_osymbols, new_osymbols,\n *                          unknown_osymbol, attach_new_osymbols)             # <<<<<<<<<<<<<<\n *     return self\n * \n */\n  __pyx_t_1.__pyx_n = 8;\n  __pyx_t_1.old_isymbols = __pyx_v_old_isymbols;\n  __pyx_t_1.new_isymbols = __pyx_v_new_isymbols;\n  __pyx_t_1.unknown_isymbol = __pyx_v_unknown_isymbol;\n  __pyx_t_1.attach_new_isymbols = __pyx_v_attach_new_isymbols;\n  __pyx_t_1.old_osymbols = __pyx_v_old_osymbols;\n  __pyx_t_1.new_osymbols = __pyx_v_new_osymbols;\n  __pyx_t_1.unknown_osymbol = __pyx_v_unknown_osymbol;\n  __pyx_t_1.attach_new_osymbols = __pyx_v_attach_new_osymbols;\n  ((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->_relabel_tables(__pyx_v_self, &__pyx_t_1); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 2359, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":2363\n *                          old_osymbols, new_osymbols,\n *                          unknown_osymbol, attach_new_osymbols)\n *     return self             # <<<<<<<<<<<<<<\n * \n *   cdef void _reserve_arcs(self, int64 state, size_t n) except *:\n */\n  __Pyx_XDECREF(__pyx_r);\n  __Pyx_INCREF(((PyObject *)__pyx_v_self));\n  __pyx_r = ((PyObject *)__pyx_v_self);\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":2315\n *     self._check_mutating_imethod()\n * \n *   def relabel_tables(self,             # <<<<<<<<<<<<<<\n *                      _SymbolTable old_isymbols=None,\n *                      _SymbolTable new_isymbols=None,\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst.relabel_tables\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":2365\n *     return self\n * \n *   cdef void _reserve_arcs(self, int64 state, size_t n) except *:             # <<<<<<<<<<<<<<\n *     if not self._mfst.get().ReserveArcs(state, n):\n *       raise FstIndexError(\"State index out of range\")\n */\n\nstatic void __pyx_f_9pywrapfst_11_MutableFst__reserve_arcs(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, __pyx_t_10basictypes_int64 __pyx_v_state, size_t __pyx_v_n) {\n  __Pyx_RefNannyDeclarations\n  int __pyx_t_1;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  __Pyx_RefNannySetupContext(\"_reserve_arcs\", 0);\n\n  /* \"pywrapfst.pyx\":2366\n * \n *   cdef void _reserve_arcs(self, int64 state, size_t n) except *:\n *     if not self._mfst.get().ReserveArcs(state, n):             # <<<<<<<<<<<<<<\n *       raise FstIndexError(\"State index out of range\")\n *     self._check_mutating_imethod()\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_mfst\");\n    __PYX_ERR(0, 2366, __pyx_L1_error)\n  }\n  __pyx_t_1 = ((!(__pyx_v_self->_mfst.get()->ReserveArcs(__pyx_v_state, __pyx_v_n) != 0)) != 0);\n  if (unlikely(__pyx_t_1)) {\n\n    /* \"pywrapfst.pyx\":2367\n *   cdef void _reserve_arcs(self, int64 state, size_t n) except *:\n *     if not self._mfst.get().ReserveArcs(state, n):\n *       raise FstIndexError(\"State index out of range\")             # <<<<<<<<<<<<<<\n *     self._check_mutating_imethod()\n * \n */\n    __pyx_t_2 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstIndexError); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 2367, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_2);\n    __pyx_t_3 = __Pyx_PyObject_Call(__pyx_t_2, __pyx_tuple__45, NULL); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 2367, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_3);\n    __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n    __Pyx_Raise(__pyx_t_3, 0, 0, 0);\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    __PYX_ERR(0, 2367, __pyx_L1_error)\n\n    /* \"pywrapfst.pyx\":2366\n * \n *   cdef void _reserve_arcs(self, int64 state, size_t n) except *:\n *     if not self._mfst.get().ReserveArcs(state, n):             # <<<<<<<<<<<<<<\n *       raise FstIndexError(\"State index out of range\")\n *     self._check_mutating_imethod()\n */\n  }\n\n  /* \"pywrapfst.pyx\":2368\n *     if not self._mfst.get().ReserveArcs(state, n):\n *       raise FstIndexError(\"State index out of range\")\n *     self._check_mutating_imethod()             # <<<<<<<<<<<<<<\n * \n *   def reserve_arcs(self, int64 state, size_t n):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_check_mutating_imethod\");\n    __PYX_ERR(0, 2368, __pyx_L1_error)\n  }\n  ((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->_check_mutating_imethod(__pyx_v_self); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 2368, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":2365\n *     return self\n * \n *   cdef void _reserve_arcs(self, int64 state, size_t n) except *:             # <<<<<<<<<<<<<<\n *     if not self._mfst.get().ReserveArcs(state, n):\n *       raise FstIndexError(\"State index out of range\")\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst._reserve_arcs\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n}\n\n/* \"pywrapfst.pyx\":2370\n *     self._check_mutating_imethod()\n * \n *   def reserve_arcs(self, int64 state, size_t n):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     reserve_arcs(self, state, n)\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_43reserve_arcs(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic char __pyx_doc_9pywrapfst_11_MutableFst_42reserve_arcs[] = \"\\n    reserve_arcs(self, state, n)\\n\\n    Reserve n arcs at a particular state (best effort).\\n\\n    Args:\\n      state: The integer index of a state.\\n      n: The number of arcs to reserve.\\n\\n    Returns:\\n      self.\\n\\n    Raises:\\n      FstIndexError: State index out of range.\\n\\n    See also: `reserve_states`.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_43reserve_arcs(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  __pyx_t_10basictypes_int64 __pyx_v_state;\n  size_t __pyx_v_n;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"reserve_arcs (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_state,&__pyx_n_s_n,0};\n    PyObject* values[2] = {0,0};\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (likely((values[0] = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_state)) != 0)) kw_args--;\n        else goto __pyx_L5_argtuple_error;\n        CYTHON_FALLTHROUGH;\n        case  1:\n        if (likely((values[1] = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_n)) != 0)) kw_args--;\n        else {\n          __Pyx_RaiseArgtupleInvalid(\"reserve_arcs\", 1, 2, 2, 1); __PYX_ERR(0, 2370, __pyx_L3_error)\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"reserve_arcs\") < 0)) __PYX_ERR(0, 2370, __pyx_L3_error)\n      }\n    } else if (PyTuple_GET_SIZE(__pyx_args) != 2) {\n      goto __pyx_L5_argtuple_error;\n    } else {\n      values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n      values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n    }\n    __pyx_v_state = __Pyx_PyInt_As_int64_t(values[0]); if (unlikely((__pyx_v_state == ((int64_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 2370, __pyx_L3_error)\n    __pyx_v_n = __Pyx_PyInt_As_size_t(values[1]); if (unlikely((__pyx_v_n == (size_t)-1) && PyErr_Occurred())) __PYX_ERR(0, 2370, __pyx_L3_error)\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"reserve_arcs\", 1, 2, 2, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 2370, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst.reserve_arcs\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  __pyx_r = __pyx_pf_9pywrapfst_11_MutableFst_42reserve_arcs(((struct __pyx_obj_9pywrapfst__MutableFst *)__pyx_v_self), __pyx_v_state, __pyx_v_n);\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_42reserve_arcs(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, __pyx_t_10basictypes_int64 __pyx_v_state, size_t __pyx_v_n) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"reserve_arcs\", 0);\n\n  /* \"pywrapfst.pyx\":2388\n *     See also: `reserve_states`.\n *     \"\"\"\n *     self._reserve_arcs(state, n)             # <<<<<<<<<<<<<<\n *     return self\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_reserve_arcs\");\n    __PYX_ERR(0, 2388, __pyx_L1_error)\n  }\n  ((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->_reserve_arcs(__pyx_v_self, __pyx_v_state, __pyx_v_n); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 2388, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":2389\n *     \"\"\"\n *     self._reserve_arcs(state, n)\n *     return self             # <<<<<<<<<<<<<<\n * \n *   cdef void _reserve_states(self, int64 n) except *:\n */\n  __Pyx_XDECREF(__pyx_r);\n  __Pyx_INCREF(((PyObject *)__pyx_v_self));\n  __pyx_r = ((PyObject *)__pyx_v_self);\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":2370\n *     self._check_mutating_imethod()\n * \n *   def reserve_arcs(self, int64 state, size_t n):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     reserve_arcs(self, state, n)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst.reserve_arcs\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":2391\n *     return self\n * \n *   cdef void _reserve_states(self, int64 n) except *:             # <<<<<<<<<<<<<<\n *     self._mfst.get().ReserveStates(n)\n *     self._check_mutating_imethod()\n */\n\nstatic void __pyx_f_9pywrapfst_11_MutableFst__reserve_states(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, __pyx_t_10basictypes_int64 __pyx_v_n) {\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"_reserve_states\", 0);\n\n  /* \"pywrapfst.pyx\":2392\n * \n *   cdef void _reserve_states(self, int64 n) except *:\n *     self._mfst.get().ReserveStates(n)             # <<<<<<<<<<<<<<\n *     self._check_mutating_imethod()\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_mfst\");\n    __PYX_ERR(0, 2392, __pyx_L1_error)\n  }\n  __pyx_v_self->_mfst.get()->ReserveStates(__pyx_v_n);\n\n  /* \"pywrapfst.pyx\":2393\n *   cdef void _reserve_states(self, int64 n) except *:\n *     self._mfst.get().ReserveStates(n)\n *     self._check_mutating_imethod()             # <<<<<<<<<<<<<<\n * \n *   def reserve_states(self, int64 n):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_check_mutating_imethod\");\n    __PYX_ERR(0, 2393, __pyx_L1_error)\n  }\n  ((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->_check_mutating_imethod(__pyx_v_self); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 2393, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":2391\n *     return self\n * \n *   cdef void _reserve_states(self, int64 n) except *:             # <<<<<<<<<<<<<<\n *     self._mfst.get().ReserveStates(n)\n *     self._check_mutating_imethod()\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst._reserve_states\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n}\n\n/* \"pywrapfst.pyx\":2395\n *     self._check_mutating_imethod()\n * \n *   def reserve_states(self, int64 n):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     reserve_states(self, n)\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_45reserve_states(PyObject *__pyx_v_self, PyObject *__pyx_arg_n); /*proto*/\nstatic char __pyx_doc_9pywrapfst_11_MutableFst_44reserve_states[] = \"\\n    reserve_states(self, n)\\n\\n    Reserve n states (best effort).\\n\\n    Args:\\n      n: The number of states to reserve.\\n\\n    Returns:\\n      self.\\n\\n    See also: `reserve_arcs`.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_45reserve_states(PyObject *__pyx_v_self, PyObject *__pyx_arg_n) {\n  __pyx_t_10basictypes_int64 __pyx_v_n;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"reserve_states (wrapper)\", 0);\n  assert(__pyx_arg_n); {\n    __pyx_v_n = __Pyx_PyInt_As_int64_t(__pyx_arg_n); if (unlikely((__pyx_v_n == ((int64_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 2395, __pyx_L3_error)\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst.reserve_states\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  __pyx_r = __pyx_pf_9pywrapfst_11_MutableFst_44reserve_states(((struct __pyx_obj_9pywrapfst__MutableFst *)__pyx_v_self), ((__pyx_t_10basictypes_int64)__pyx_v_n));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_44reserve_states(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, __pyx_t_10basictypes_int64 __pyx_v_n) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"reserve_states\", 0);\n\n  /* \"pywrapfst.pyx\":2409\n *     See also: `reserve_arcs`.\n *     \"\"\"\n *     self._reserve_states(n)             # <<<<<<<<<<<<<<\n *     return self\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_reserve_states\");\n    __PYX_ERR(0, 2409, __pyx_L1_error)\n  }\n  ((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->_reserve_states(__pyx_v_self, __pyx_v_n); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 2409, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":2410\n *     \"\"\"\n *     self._reserve_states(n)\n *     return self             # <<<<<<<<<<<<<<\n * \n *   cdef void _reweight(self, potentials, bool to_final=False) except *:\n */\n  __Pyx_XDECREF(__pyx_r);\n  __Pyx_INCREF(((PyObject *)__pyx_v_self));\n  __pyx_r = ((PyObject *)__pyx_v_self);\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":2395\n *     self._check_mutating_imethod()\n * \n *   def reserve_states(self, int64 n):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     reserve_states(self, n)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst.reserve_states\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":2412\n *     return self\n * \n *   cdef void _reweight(self, potentials, bool to_final=False) except *:             # <<<<<<<<<<<<<<\n *     cdef unique_ptr[vector[fst.WeightClass]] _potentials\n *     _potentials.reset(new vector[fst.WeightClass]())\n */\n\nstatic void __pyx_f_9pywrapfst_11_MutableFst__reweight(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, PyObject *__pyx_v_potentials, struct __pyx_opt_args_9pywrapfst_11_MutableFst__reweight *__pyx_optional_args) {\n  bool __pyx_v_to_final = ((bool)0);\n  std::unique_ptr<std::vector<fst::script::WeightClass> >  __pyx_v__potentials;\n  CYTHON_UNUSED std::string __pyx_v_weight_type;\n  PyObject *__pyx_v_weight = NULL;\n  __Pyx_RefNannyDeclarations\n  std::vector<fst::script::WeightClass>  *__pyx_t_1;\n  PyObject *__pyx_t_2 = NULL;\n  Py_ssize_t __pyx_t_3;\n  PyObject *(*__pyx_t_4)(PyObject *);\n  PyObject *__pyx_t_5 = NULL;\n  fst::script::WeightClass __pyx_t_6;\n  __Pyx_RefNannySetupContext(\"_reweight\", 0);\n  if (__pyx_optional_args) {\n    if (__pyx_optional_args->__pyx_n > 0) {\n      __pyx_v_to_final = __pyx_optional_args->to_final;\n    }\n  }\n\n  /* \"pywrapfst.pyx\":2414\n *   cdef void _reweight(self, potentials, bool to_final=False) except *:\n *     cdef unique_ptr[vector[fst.WeightClass]] _potentials\n *     _potentials.reset(new vector[fst.WeightClass]())             # <<<<<<<<<<<<<<\n *     cdef string weight_type = self.weight_type()\n *     for weight in potentials:\n */\n  try {\n    __pyx_t_1 = new std::vector<fst::script::WeightClass> ();\n  } catch(...) {\n    __Pyx_CppExn2PyErr();\n    __PYX_ERR(0, 2414, __pyx_L1_error)\n  }\n  __pyx_v__potentials.reset(__pyx_t_1);\n\n  /* \"pywrapfst.pyx\":2415\n *     cdef unique_ptr[vector[fst.WeightClass]] _potentials\n *     _potentials.reset(new vector[fst.WeightClass]())\n *     cdef string weight_type = self.weight_type()             # <<<<<<<<<<<<<<\n *     for weight in potentials:\n *         _potentials.get().push_back(_get_WeightClass_or_One(self.weight_type(),\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"weight_type\");\n    __PYX_ERR(0, 2415, __pyx_L1_error)\n  }\n  __pyx_v_weight_type = ((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->__pyx_base.weight_type(((struct __pyx_obj_9pywrapfst__Fst *)__pyx_v_self), 0);\n\n  /* \"pywrapfst.pyx\":2416\n *     _potentials.reset(new vector[fst.WeightClass]())\n *     cdef string weight_type = self.weight_type()\n *     for weight in potentials:             # <<<<<<<<<<<<<<\n *         _potentials.get().push_back(_get_WeightClass_or_One(self.weight_type(),\n *                                                             weight))\n */\n  if (likely(PyList_CheckExact(__pyx_v_potentials)) || PyTuple_CheckExact(__pyx_v_potentials)) {\n    __pyx_t_2 = __pyx_v_potentials; __Pyx_INCREF(__pyx_t_2); __pyx_t_3 = 0;\n    __pyx_t_4 = NULL;\n  } else {\n    __pyx_t_3 = -1; __pyx_t_2 = PyObject_GetIter(__pyx_v_potentials); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 2416, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_2);\n    __pyx_t_4 = Py_TYPE(__pyx_t_2)->tp_iternext; if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 2416, __pyx_L1_error)\n  }\n  for (;;) {\n    if (likely(!__pyx_t_4)) {\n      if (likely(PyList_CheckExact(__pyx_t_2))) {\n        if (__pyx_t_3 >= PyList_GET_SIZE(__pyx_t_2)) break;\n        #if CYTHON_ASSUME_SAFE_MACROS && !CYTHON_AVOID_BORROWED_REFS\n        __pyx_t_5 = PyList_GET_ITEM(__pyx_t_2, __pyx_t_3); __Pyx_INCREF(__pyx_t_5); __pyx_t_3++; if (unlikely(0 < 0)) __PYX_ERR(0, 2416, __pyx_L1_error)\n        #else\n        __pyx_t_5 = PySequence_ITEM(__pyx_t_2, __pyx_t_3); __pyx_t_3++; if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 2416, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_5);\n        #endif\n      } else {\n        if (__pyx_t_3 >= PyTuple_GET_SIZE(__pyx_t_2)) break;\n        #if CYTHON_ASSUME_SAFE_MACROS && !CYTHON_AVOID_BORROWED_REFS\n        __pyx_t_5 = PyTuple_GET_ITEM(__pyx_t_2, __pyx_t_3); __Pyx_INCREF(__pyx_t_5); __pyx_t_3++; if (unlikely(0 < 0)) __PYX_ERR(0, 2416, __pyx_L1_error)\n        #else\n        __pyx_t_5 = PySequence_ITEM(__pyx_t_2, __pyx_t_3); __pyx_t_3++; if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 2416, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_5);\n        #endif\n      }\n    } else {\n      __pyx_t_5 = __pyx_t_4(__pyx_t_2);\n      if (unlikely(!__pyx_t_5)) {\n        PyObject* exc_type = PyErr_Occurred();\n        if (exc_type) {\n          if (likely(__Pyx_PyErr_GivenExceptionMatches(exc_type, PyExc_StopIteration))) PyErr_Clear();\n          else __PYX_ERR(0, 2416, __pyx_L1_error)\n        }\n        break;\n      }\n      __Pyx_GOTREF(__pyx_t_5);\n    }\n    __Pyx_XDECREF_SET(__pyx_v_weight, __pyx_t_5);\n    __pyx_t_5 = 0;\n\n    /* \"pywrapfst.pyx\":2417\n *     cdef string weight_type = self.weight_type()\n *     for weight in potentials:\n *         _potentials.get().push_back(_get_WeightClass_or_One(self.weight_type(),             # <<<<<<<<<<<<<<\n *                                                             weight))\n *     fst.Reweight(self._mfst.get(), deref(_potentials),\n */\n    if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n      PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"weight_type\");\n      __PYX_ERR(0, 2417, __pyx_L1_error)\n    }\n\n    /* \"pywrapfst.pyx\":2418\n *     for weight in potentials:\n *         _potentials.get().push_back(_get_WeightClass_or_One(self.weight_type(),\n *                                                             weight))             # <<<<<<<<<<<<<<\n *     fst.Reweight(self._mfst.get(), deref(_potentials),\n *                  fst.GetReweightType(to_final))\n */\n    __pyx_t_6 = __pyx_f_9pywrapfst__get_WeightClass_or_One(((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->__pyx_base.weight_type(((struct __pyx_obj_9pywrapfst__Fst *)__pyx_v_self), 0), __pyx_v_weight); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 2417, __pyx_L1_error)\n\n    /* \"pywrapfst.pyx\":2417\n *     cdef string weight_type = self.weight_type()\n *     for weight in potentials:\n *         _potentials.get().push_back(_get_WeightClass_or_One(self.weight_type(),             # <<<<<<<<<<<<<<\n *                                                             weight))\n *     fst.Reweight(self._mfst.get(), deref(_potentials),\n */\n    try {\n      __pyx_v__potentials.get()->push_back(__pyx_t_6);\n    } catch(...) {\n      __Pyx_CppExn2PyErr();\n      __PYX_ERR(0, 2417, __pyx_L1_error)\n    }\n\n    /* \"pywrapfst.pyx\":2416\n *     _potentials.reset(new vector[fst.WeightClass]())\n *     cdef string weight_type = self.weight_type()\n *     for weight in potentials:             # <<<<<<<<<<<<<<\n *         _potentials.get().push_back(_get_WeightClass_or_One(self.weight_type(),\n *                                                             weight))\n */\n  }\n  __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n\n  /* \"pywrapfst.pyx\":2419\n *         _potentials.get().push_back(_get_WeightClass_or_One(self.weight_type(),\n *                                                             weight))\n *     fst.Reweight(self._mfst.get(), deref(_potentials),             # <<<<<<<<<<<<<<\n *                  fst.GetReweightType(to_final))\n *     self._check_mutating_imethod()\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_mfst\");\n    __PYX_ERR(0, 2419, __pyx_L1_error)\n  }\n\n  /* \"pywrapfst.pyx\":2420\n *                                                             weight))\n *     fst.Reweight(self._mfst.get(), deref(_potentials),\n *                  fst.GetReweightType(to_final))             # <<<<<<<<<<<<<<\n *     self._check_mutating_imethod()\n * \n */\n  fst::script::Reweight(__pyx_v_self->_mfst.get(), (*__pyx_v__potentials), fst::script::GetReweightType(__pyx_v_to_final));\n\n  /* \"pywrapfst.pyx\":2421\n *     fst.Reweight(self._mfst.get(), deref(_potentials),\n *                  fst.GetReweightType(to_final))\n *     self._check_mutating_imethod()             # <<<<<<<<<<<<<<\n * \n *   def reweight(self, potentials, bool to_final=False):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_check_mutating_imethod\");\n    __PYX_ERR(0, 2421, __pyx_L1_error)\n  }\n  ((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->_check_mutating_imethod(__pyx_v_self); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 2421, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":2412\n *     return self\n * \n *   cdef void _reweight(self, potentials, bool to_final=False) except *:             # <<<<<<<<<<<<<<\n *     cdef unique_ptr[vector[fst.WeightClass]] _potentials\n *     _potentials.reset(new vector[fst.WeightClass]())\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst._reweight\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_L0:;\n  __Pyx_XDECREF(__pyx_v_weight);\n  __Pyx_RefNannyFinishContext();\n}\n\n/* \"pywrapfst.pyx\":2423\n *     self._check_mutating_imethod()\n * \n *   def reweight(self, potentials, bool to_final=False):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     reweight(self, potentials, to_final=False)\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_47reweight(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic char __pyx_doc_9pywrapfst_11_MutableFst_46reweight[] = \"\\n    reweight(self, potentials, to_final=False)\\n\\n    Reweights an FST using an iterable of potentials.\\n\\n    This operation destructively reweights an FST according to the potentials\\n    and in the direction specified by the user. An arc of weight w, with an\\n    origin state of potential p and destination state of potential q, is\\n    reweighted by p^{-1} \\\\otimes (w \\\\otimes q) when reweighting towards the\\n    initial state, and by (p \\\\otimes w) \\\\otimes q^{-1} when reweighting towards\\n    the final states. The weights must be left distributive when reweighting\\n    towards the initial state and right distributive when reweighting towards\\n    the final states (e.g., TropicalWeight and LogWeight).\\n\\n    Args:\\n      potentials: An iterable of Weight or weight strings.\\n      to_final: Push towards final states?\\n\\n    Returns:\\n      self.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_47reweight(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  PyObject *__pyx_v_potentials = 0;\n  bool __pyx_v_to_final;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"reweight (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_potentials,&__pyx_n_s_to_final,0};\n    PyObject* values[2] = {0,0};\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (likely((values[0] = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_potentials)) != 0)) kw_args--;\n        else goto __pyx_L5_argtuple_error;\n        CYTHON_FALLTHROUGH;\n        case  1:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_to_final);\n          if (value) { values[1] = value; kw_args--; }\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"reweight\") < 0)) __PYX_ERR(0, 2423, __pyx_L3_error)\n      }\n    } else {\n      switch (PyTuple_GET_SIZE(__pyx_args)) {\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n    }\n    __pyx_v_potentials = values[0];\n    if (values[1]) {\n      __pyx_v_to_final = __Pyx_PyObject_IsTrue(values[1]); if (unlikely((__pyx_v_to_final == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 2423, __pyx_L3_error)\n    } else {\n      __pyx_v_to_final = ((bool)0);\n    }\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"reweight\", 0, 1, 2, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 2423, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst.reweight\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  __pyx_r = __pyx_pf_9pywrapfst_11_MutableFst_46reweight(((struct __pyx_obj_9pywrapfst__MutableFst *)__pyx_v_self), __pyx_v_potentials, __pyx_v_to_final);\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_46reweight(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, PyObject *__pyx_v_potentials, bool __pyx_v_to_final) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  struct __pyx_opt_args_9pywrapfst_11_MutableFst__reweight __pyx_t_1;\n  __Pyx_RefNannySetupContext(\"reweight\", 0);\n\n  /* \"pywrapfst.pyx\":2445\n *       self.\n *     \"\"\"\n *     self._reweight(potentials, to_final)             # <<<<<<<<<<<<<<\n *     return self\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_reweight\");\n    __PYX_ERR(0, 2445, __pyx_L1_error)\n  }\n  __pyx_t_1.__pyx_n = 1;\n  __pyx_t_1.to_final = __pyx_v_to_final;\n  ((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->_reweight(__pyx_v_self, __pyx_v_potentials, &__pyx_t_1); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 2445, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":2446\n *     \"\"\"\n *     self._reweight(potentials, to_final)\n *     return self             # <<<<<<<<<<<<<<\n * \n *   cdef void _rmepsilon(self,\n */\n  __Pyx_XDECREF(__pyx_r);\n  __Pyx_INCREF(((PyObject *)__pyx_v_self));\n  __pyx_r = ((PyObject *)__pyx_v_self);\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":2423\n *     self._check_mutating_imethod()\n * \n *   def reweight(self, potentials, bool to_final=False):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     reweight(self, potentials, to_final=False)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst.reweight\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":2448\n *     return self\n * \n *   cdef void _rmepsilon(self,             # <<<<<<<<<<<<<<\n *                        queue_type=b\"auto\",\n *                        bool connect=True,\n */\n\nstatic void __pyx_f_9pywrapfst_11_MutableFst__rmepsilon(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, struct __pyx_opt_args_9pywrapfst_11_MutableFst__rmepsilon *__pyx_optional_args) {\n  PyObject *__pyx_v_queue_type = ((PyObject *)__pyx_n_b_auto);\n\n  /* \"pywrapfst.pyx\":2450\n *   cdef void _rmepsilon(self,\n *                        queue_type=b\"auto\",\n *                        bool connect=True,             # <<<<<<<<<<<<<<\n *                        weight=None,\n *                        int64 nstate=fst.kNoStateId,\n */\n  bool __pyx_v_connect = ((bool)1);\n\n  /* \"pywrapfst.pyx\":2451\n *                        queue_type=b\"auto\",\n *                        bool connect=True,\n *                        weight=None,             # <<<<<<<<<<<<<<\n *                        int64 nstate=fst.kNoStateId,\n *                        float delta=fst.kShortestDelta) except *:\n */\n  PyObject *__pyx_v_weight = ((PyObject *)Py_None);\n  __pyx_t_10basictypes_int64 __pyx_v_nstate = __pyx_k__46;\n  float __pyx_v_delta = __pyx_k__47;\n  fst::script::WeightClass __pyx_v_wc;\n  std::unique_ptr<fst::script::RmEpsilonOptions>  __pyx_v_opts;\n  __Pyx_RefNannyDeclarations\n  fst::script::WeightClass __pyx_t_1;\n  std::string __pyx_t_2;\n  enum fst::QueueType __pyx_t_3;\n  __Pyx_RefNannySetupContext(\"_rmepsilon\", 0);\n  if (__pyx_optional_args) {\n    if (__pyx_optional_args->__pyx_n > 0) {\n      __pyx_v_queue_type = __pyx_optional_args->queue_type;\n      if (__pyx_optional_args->__pyx_n > 1) {\n        __pyx_v_connect = __pyx_optional_args->connect;\n        if (__pyx_optional_args->__pyx_n > 2) {\n          __pyx_v_weight = __pyx_optional_args->weight;\n          if (__pyx_optional_args->__pyx_n > 3) {\n            __pyx_v_nstate = __pyx_optional_args->nstate;\n            if (__pyx_optional_args->__pyx_n > 4) {\n              __pyx_v_delta = __pyx_optional_args->delta;\n            }\n          }\n        }\n      }\n    }\n  }\n\n  /* \"pywrapfst.pyx\":2454\n *                        int64 nstate=fst.kNoStateId,\n *                        float delta=fst.kShortestDelta) except *:\n *     cdef fst.WeightClass wc = _get_WeightClass_or_Zero(self.weight_type(),             # <<<<<<<<<<<<<<\n *                                                        weight)\n *     cdef unique_ptr[fst.RmEpsilonOptions] opts\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"weight_type\");\n    __PYX_ERR(0, 2454, __pyx_L1_error)\n  }\n\n  /* \"pywrapfst.pyx\":2455\n *                        float delta=fst.kShortestDelta) except *:\n *     cdef fst.WeightClass wc = _get_WeightClass_or_Zero(self.weight_type(),\n *                                                        weight)             # <<<<<<<<<<<<<<\n *     cdef unique_ptr[fst.RmEpsilonOptions] opts\n *     opts.reset(new fst.RmEpsilonOptions(_get_queue_type(tostring(queue_type)),\n */\n  __pyx_t_1 = __pyx_f_9pywrapfst__get_WeightClass_or_Zero(((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->__pyx_base.weight_type(((struct __pyx_obj_9pywrapfst__Fst *)__pyx_v_self), 0), __pyx_v_weight); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 2454, __pyx_L1_error)\n  __pyx_v_wc = __pyx_t_1;\n\n  /* \"pywrapfst.pyx\":2457\n *                                                        weight)\n *     cdef unique_ptr[fst.RmEpsilonOptions] opts\n *     opts.reset(new fst.RmEpsilonOptions(_get_queue_type(tostring(queue_type)),             # <<<<<<<<<<<<<<\n *                                         connect, wc, nstate, delta))\n *     fst.RmEpsilon(self._mfst.get(), deref(opts))\n */\n  __pyx_t_2 = __pyx_f_9pywrapfst_tostring(__pyx_v_queue_type, NULL); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 2457, __pyx_L1_error)\n  __pyx_t_3 = __pyx_f_9pywrapfst__get_queue_type(__pyx_t_2); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 2457, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":2458\n *     cdef unique_ptr[fst.RmEpsilonOptions] opts\n *     opts.reset(new fst.RmEpsilonOptions(_get_queue_type(tostring(queue_type)),\n *                                         connect, wc, nstate, delta))             # <<<<<<<<<<<<<<\n *     fst.RmEpsilon(self._mfst.get(), deref(opts))\n *     self._check_mutating_imethod()\n */\n  __pyx_v_opts.reset(new fst::script::RmEpsilonOptions(__pyx_t_3, __pyx_v_connect, __pyx_v_wc, __pyx_v_nstate, __pyx_v_delta));\n\n  /* \"pywrapfst.pyx\":2459\n *     opts.reset(new fst.RmEpsilonOptions(_get_queue_type(tostring(queue_type)),\n *                                         connect, wc, nstate, delta))\n *     fst.RmEpsilon(self._mfst.get(), deref(opts))             # <<<<<<<<<<<<<<\n *     self._check_mutating_imethod()\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_mfst\");\n    __PYX_ERR(0, 2459, __pyx_L1_error)\n  }\n  fst::script::RmEpsilon(__pyx_v_self->_mfst.get(), (*__pyx_v_opts));\n\n  /* \"pywrapfst.pyx\":2460\n *                                         connect, wc, nstate, delta))\n *     fst.RmEpsilon(self._mfst.get(), deref(opts))\n *     self._check_mutating_imethod()             # <<<<<<<<<<<<<<\n * \n *   def rmepsilon(self,\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_check_mutating_imethod\");\n    __PYX_ERR(0, 2460, __pyx_L1_error)\n  }\n  ((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->_check_mutating_imethod(__pyx_v_self); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 2460, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":2448\n *     return self\n * \n *   cdef void _rmepsilon(self,             # <<<<<<<<<<<<<<\n *                        queue_type=b\"auto\",\n *                        bool connect=True,\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst._rmepsilon\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n}\n\n/* \"pywrapfst.pyx\":2462\n *     self._check_mutating_imethod()\n * \n *   def rmepsilon(self,             # <<<<<<<<<<<<<<\n *                 queue_type=b\"auto\",\n *                 bool connect=True,\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_49rmepsilon(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic char __pyx_doc_9pywrapfst_11_MutableFst_48rmepsilon[] = \"\\n    rmepsilon(self, queue_type=\\\"auto\\\", connect=True, weight=None,\\n              nstate=NO_STATE_ID, delta=1e-6):\\n\\n    Removes epsilon transitions.\\n\\n    This operation destructively removes epsilon transitions, i.e., those where\\n    both input and output labels are epsilon) from an FST.\\n\\n    Args:\\n      queue_type: A string matching a known queue type; one of: \\\"auto\\\", \\\"fifo\\\",\\n          \\\"lifo\\\", \\\"shortest\\\", \\\"state\\\", \\\"top\\\".\\n      connect: Should output be trimmed?\\n      weight: A Weight or weight string indicating the desired weight threshold\\n          below which paths are pruned; if omitted, no paths are pruned.\\n      nstate: State number threshold.\\n      delta: Comparison/quantization delta.\\n\\n    Returns:\\n      self.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_49rmepsilon(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  PyObject *__pyx_v_queue_type = 0;\n  bool __pyx_v_connect;\n  PyObject *__pyx_v_weight = 0;\n  __pyx_t_10basictypes_int64 __pyx_v_nstate;\n  float __pyx_v_delta;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"rmepsilon (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_queue_type,&__pyx_n_s_connect,&__pyx_n_s_weight,&__pyx_n_s_nstate,&__pyx_n_s_delta,0};\n    PyObject* values[5] = {0,0,0,0,0};\n    values[0] = ((PyObject *)__pyx_n_b_auto);\n\n    /* \"pywrapfst.pyx\":2465\n *                 queue_type=b\"auto\",\n *                 bool connect=True,\n *                 weight=None,             # <<<<<<<<<<<<<<\n *                 int64 nstate=fst.kNoStateId,\n *                 float delta=fst.kShortestDelta):\n */\n    values[2] = ((PyObject *)Py_None);\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  5: values[4] = PyTuple_GET_ITEM(__pyx_args, 4);\n        CYTHON_FALLTHROUGH;\n        case  4: values[3] = PyTuple_GET_ITEM(__pyx_args, 3);\n        CYTHON_FALLTHROUGH;\n        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);\n        CYTHON_FALLTHROUGH;\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_queue_type);\n          if (value) { values[0] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  1:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_connect);\n          if (value) { values[1] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  2:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_weight);\n          if (value) { values[2] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  3:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_nstate);\n          if (value) { values[3] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  4:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_delta);\n          if (value) { values[4] = value; kw_args--; }\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"rmepsilon\") < 0)) __PYX_ERR(0, 2462, __pyx_L3_error)\n      }\n    } else {\n      switch (PyTuple_GET_SIZE(__pyx_args)) {\n        case  5: values[4] = PyTuple_GET_ITEM(__pyx_args, 4);\n        CYTHON_FALLTHROUGH;\n        case  4: values[3] = PyTuple_GET_ITEM(__pyx_args, 3);\n        CYTHON_FALLTHROUGH;\n        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);\n        CYTHON_FALLTHROUGH;\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n    }\n    __pyx_v_queue_type = values[0];\n    if (values[1]) {\n      __pyx_v_connect = __Pyx_PyObject_IsTrue(values[1]); if (unlikely((__pyx_v_connect == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 2464, __pyx_L3_error)\n    } else {\n\n      /* \"pywrapfst.pyx\":2464\n *   def rmepsilon(self,\n *                 queue_type=b\"auto\",\n *                 bool connect=True,             # <<<<<<<<<<<<<<\n *                 weight=None,\n *                 int64 nstate=fst.kNoStateId,\n */\n      __pyx_v_connect = ((bool)1);\n    }\n    __pyx_v_weight = values[2];\n    if (values[3]) {\n      __pyx_v_nstate = __Pyx_PyInt_As_int64_t(values[3]); if (unlikely((__pyx_v_nstate == ((int64_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 2466, __pyx_L3_error)\n    } else {\n      __pyx_v_nstate = __pyx_k__48;\n    }\n    if (values[4]) {\n      __pyx_v_delta = __pyx_PyFloat_AsFloat(values[4]); if (unlikely((__pyx_v_delta == (float)-1) && PyErr_Occurred())) __PYX_ERR(0, 2467, __pyx_L3_error)\n    } else {\n      __pyx_v_delta = __pyx_k__49;\n    }\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"rmepsilon\", 0, 0, 5, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 2462, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst.rmepsilon\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  __pyx_r = __pyx_pf_9pywrapfst_11_MutableFst_48rmepsilon(((struct __pyx_obj_9pywrapfst__MutableFst *)__pyx_v_self), __pyx_v_queue_type, __pyx_v_connect, __pyx_v_weight, __pyx_v_nstate, __pyx_v_delta);\n\n  /* \"pywrapfst.pyx\":2462\n *     self._check_mutating_imethod()\n * \n *   def rmepsilon(self,             # <<<<<<<<<<<<<<\n *                 queue_type=b\"auto\",\n *                 bool connect=True,\n */\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_48rmepsilon(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, PyObject *__pyx_v_queue_type, bool __pyx_v_connect, PyObject *__pyx_v_weight, __pyx_t_10basictypes_int64 __pyx_v_nstate, float __pyx_v_delta) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  struct __pyx_opt_args_9pywrapfst_11_MutableFst__rmepsilon __pyx_t_1;\n  __Pyx_RefNannySetupContext(\"rmepsilon\", 0);\n\n  /* \"pywrapfst.pyx\":2489\n *       self.\n *     \"\"\"\n *     self._rmepsilon(queue_type, connect, weight, nstate, delta)             # <<<<<<<<<<<<<<\n *     return self\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_rmepsilon\");\n    __PYX_ERR(0, 2489, __pyx_L1_error)\n  }\n  __pyx_t_1.__pyx_n = 5;\n  __pyx_t_1.queue_type = __pyx_v_queue_type;\n  __pyx_t_1.connect = __pyx_v_connect;\n  __pyx_t_1.weight = __pyx_v_weight;\n  __pyx_t_1.nstate = __pyx_v_nstate;\n  __pyx_t_1.delta = __pyx_v_delta;\n  ((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->_rmepsilon(__pyx_v_self, &__pyx_t_1); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 2489, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":2490\n *     \"\"\"\n *     self._rmepsilon(queue_type, connect, weight, nstate, delta)\n *     return self             # <<<<<<<<<<<<<<\n * \n *   cdef void _set_final(self, int64 state, weight=None) except *:\n */\n  __Pyx_XDECREF(__pyx_r);\n  __Pyx_INCREF(((PyObject *)__pyx_v_self));\n  __pyx_r = ((PyObject *)__pyx_v_self);\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":2462\n *     self._check_mutating_imethod()\n * \n *   def rmepsilon(self,             # <<<<<<<<<<<<<<\n *                 queue_type=b\"auto\",\n *                 bool connect=True,\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst.rmepsilon\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":2492\n *     return self\n * \n *   cdef void _set_final(self, int64 state, weight=None) except *:             # <<<<<<<<<<<<<<\n *     if not self._mfst.get().ValidStateId(state):\n *       raise FstIndexError(\"State index out of range\")\n */\n\nstatic void __pyx_f_9pywrapfst_11_MutableFst__set_final(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, __pyx_t_10basictypes_int64 __pyx_v_state, struct __pyx_opt_args_9pywrapfst_11_MutableFst__set_final *__pyx_optional_args) {\n  PyObject *__pyx_v_weight = ((PyObject *)Py_None);\n  fst::script::WeightClass __pyx_v_wc;\n  __Pyx_RefNannyDeclarations\n  int __pyx_t_1;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  fst::script::WeightClass __pyx_t_4;\n  __Pyx_RefNannySetupContext(\"_set_final\", 0);\n  if (__pyx_optional_args) {\n    if (__pyx_optional_args->__pyx_n > 0) {\n      __pyx_v_weight = __pyx_optional_args->weight;\n    }\n  }\n\n  /* \"pywrapfst.pyx\":2493\n * \n *   cdef void _set_final(self, int64 state, weight=None) except *:\n *     if not self._mfst.get().ValidStateId(state):             # <<<<<<<<<<<<<<\n *       raise FstIndexError(\"State index out of range\")\n *     cdef fst.WeightClass wc = _get_WeightClass_or_One(self.weight_type(),\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_mfst\");\n    __PYX_ERR(0, 2493, __pyx_L1_error)\n  }\n  __pyx_t_1 = ((!(__pyx_v_self->_mfst.get()->ValidStateId(__pyx_v_state) != 0)) != 0);\n  if (unlikely(__pyx_t_1)) {\n\n    /* \"pywrapfst.pyx\":2494\n *   cdef void _set_final(self, int64 state, weight=None) except *:\n *     if not self._mfst.get().ValidStateId(state):\n *       raise FstIndexError(\"State index out of range\")             # <<<<<<<<<<<<<<\n *     cdef fst.WeightClass wc = _get_WeightClass_or_One(self.weight_type(),\n *                                                       weight)\n */\n    __pyx_t_2 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstIndexError); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 2494, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_2);\n    __pyx_t_3 = __Pyx_PyObject_Call(__pyx_t_2, __pyx_tuple__50, NULL); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 2494, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_3);\n    __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n    __Pyx_Raise(__pyx_t_3, 0, 0, 0);\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    __PYX_ERR(0, 2494, __pyx_L1_error)\n\n    /* \"pywrapfst.pyx\":2493\n * \n *   cdef void _set_final(self, int64 state, weight=None) except *:\n *     if not self._mfst.get().ValidStateId(state):             # <<<<<<<<<<<<<<\n *       raise FstIndexError(\"State index out of range\")\n *     cdef fst.WeightClass wc = _get_WeightClass_or_One(self.weight_type(),\n */\n  }\n\n  /* \"pywrapfst.pyx\":2495\n *     if not self._mfst.get().ValidStateId(state):\n *       raise FstIndexError(\"State index out of range\")\n *     cdef fst.WeightClass wc = _get_WeightClass_or_One(self.weight_type(),             # <<<<<<<<<<<<<<\n *                                                       weight)\n *     if not self._mfst.get().SetFinal(state, wc):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"weight_type\");\n    __PYX_ERR(0, 2495, __pyx_L1_error)\n  }\n\n  /* \"pywrapfst.pyx\":2496\n *       raise FstIndexError(\"State index out of range\")\n *     cdef fst.WeightClass wc = _get_WeightClass_or_One(self.weight_type(),\n *                                                       weight)             # <<<<<<<<<<<<<<\n *     if not self._mfst.get().SetFinal(state, wc):\n *       raise FstOpError(\"Incompatible or invalid weight\")\n */\n  __pyx_t_4 = __pyx_f_9pywrapfst__get_WeightClass_or_One(((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->__pyx_base.weight_type(((struct __pyx_obj_9pywrapfst__Fst *)__pyx_v_self), 0), __pyx_v_weight); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 2495, __pyx_L1_error)\n  __pyx_v_wc = __pyx_t_4;\n\n  /* \"pywrapfst.pyx\":2497\n *     cdef fst.WeightClass wc = _get_WeightClass_or_One(self.weight_type(),\n *                                                       weight)\n *     if not self._mfst.get().SetFinal(state, wc):             # <<<<<<<<<<<<<<\n *       raise FstOpError(\"Incompatible or invalid weight\")\n *     self._check_mutating_imethod()\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_mfst\");\n    __PYX_ERR(0, 2497, __pyx_L1_error)\n  }\n  __pyx_t_1 = ((!(__pyx_v_self->_mfst.get()->SetFinal(__pyx_v_state, __pyx_v_wc) != 0)) != 0);\n  if (unlikely(__pyx_t_1)) {\n\n    /* \"pywrapfst.pyx\":2498\n *                                                       weight)\n *     if not self._mfst.get().SetFinal(state, wc):\n *       raise FstOpError(\"Incompatible or invalid weight\")             # <<<<<<<<<<<<<<\n *     self._check_mutating_imethod()\n * \n */\n    __pyx_t_3 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstOpError); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 2498, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_3);\n    __pyx_t_2 = __Pyx_PyObject_Call(__pyx_t_3, __pyx_tuple__51, NULL); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 2498, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_2);\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    __Pyx_Raise(__pyx_t_2, 0, 0, 0);\n    __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n    __PYX_ERR(0, 2498, __pyx_L1_error)\n\n    /* \"pywrapfst.pyx\":2497\n *     cdef fst.WeightClass wc = _get_WeightClass_or_One(self.weight_type(),\n *                                                       weight)\n *     if not self._mfst.get().SetFinal(state, wc):             # <<<<<<<<<<<<<<\n *       raise FstOpError(\"Incompatible or invalid weight\")\n *     self._check_mutating_imethod()\n */\n  }\n\n  /* \"pywrapfst.pyx\":2499\n *     if not self._mfst.get().SetFinal(state, wc):\n *       raise FstOpError(\"Incompatible or invalid weight\")\n *     self._check_mutating_imethod()             # <<<<<<<<<<<<<<\n * \n *   def set_final(self, int64 state, weight=None):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_check_mutating_imethod\");\n    __PYX_ERR(0, 2499, __pyx_L1_error)\n  }\n  ((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->_check_mutating_imethod(__pyx_v_self); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 2499, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":2492\n *     return self\n * \n *   cdef void _set_final(self, int64 state, weight=None) except *:             # <<<<<<<<<<<<<<\n *     if not self._mfst.get().ValidStateId(state):\n *       raise FstIndexError(\"State index out of range\")\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst._set_final\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n}\n\n/* \"pywrapfst.pyx\":2501\n *     self._check_mutating_imethod()\n * \n *   def set_final(self, int64 state, weight=None):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     set_final(self, state, weight)\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_51set_final(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic char __pyx_doc_9pywrapfst_11_MutableFst_50set_final[] = \"\\n    set_final(self, state, weight)\\n\\n    Sets the final weight for a state.\\n\\n    Args:\\n      state: The integer index of a state.\\n      weight: A Weight or weight string indicating the desired final weight; if\\n          omitted, it is set to semiring One.\\n\\n    Returns:\\n      self.\\n\\n    Raises:\\n      FstIndexError: State index out of range.\\n      FstOpError: Incompatible or invalid weight.\\n\\n    See also: `set_start`.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_51set_final(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  __pyx_t_10basictypes_int64 __pyx_v_state;\n  PyObject *__pyx_v_weight = 0;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"set_final (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_state,&__pyx_n_s_weight,0};\n    PyObject* values[2] = {0,0};\n    values[1] = ((PyObject *)Py_None);\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (likely((values[0] = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_state)) != 0)) kw_args--;\n        else goto __pyx_L5_argtuple_error;\n        CYTHON_FALLTHROUGH;\n        case  1:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_weight);\n          if (value) { values[1] = value; kw_args--; }\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"set_final\") < 0)) __PYX_ERR(0, 2501, __pyx_L3_error)\n      }\n    } else {\n      switch (PyTuple_GET_SIZE(__pyx_args)) {\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n    }\n    __pyx_v_state = __Pyx_PyInt_As_int64_t(values[0]); if (unlikely((__pyx_v_state == ((int64_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 2501, __pyx_L3_error)\n    __pyx_v_weight = values[1];\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"set_final\", 0, 1, 2, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 2501, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst.set_final\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  __pyx_r = __pyx_pf_9pywrapfst_11_MutableFst_50set_final(((struct __pyx_obj_9pywrapfst__MutableFst *)__pyx_v_self), __pyx_v_state, __pyx_v_weight);\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_50set_final(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, __pyx_t_10basictypes_int64 __pyx_v_state, PyObject *__pyx_v_weight) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  struct __pyx_opt_args_9pywrapfst_11_MutableFst__set_final __pyx_t_1;\n  __Pyx_RefNannySetupContext(\"set_final\", 0);\n\n  /* \"pywrapfst.pyx\":2521\n *     See also: `set_start`.\n *     \"\"\"\n *     self._set_final(state, weight)             # <<<<<<<<<<<<<<\n *     return self\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_set_final\");\n    __PYX_ERR(0, 2521, __pyx_L1_error)\n  }\n  __pyx_t_1.__pyx_n = 1;\n  __pyx_t_1.weight = __pyx_v_weight;\n  ((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->_set_final(__pyx_v_self, __pyx_v_state, &__pyx_t_1); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 2521, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":2522\n *     \"\"\"\n *     self._set_final(state, weight)\n *     return self             # <<<<<<<<<<<<<<\n * \n *   cdef void _set_input_symbols(self, _SymbolTable syms) except *:\n */\n  __Pyx_XDECREF(__pyx_r);\n  __Pyx_INCREF(((PyObject *)__pyx_v_self));\n  __pyx_r = ((PyObject *)__pyx_v_self);\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":2501\n *     self._check_mutating_imethod()\n * \n *   def set_final(self, int64 state, weight=None):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     set_final(self, state, weight)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst.set_final\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":2524\n *     return self\n * \n *   cdef void _set_input_symbols(self, _SymbolTable syms) except *:             # <<<<<<<<<<<<<<\n *     if syms is None:\n *       self._mfst.get().SetInputSymbols(NULL)\n */\n\nstatic void __pyx_f_9pywrapfst_11_MutableFst__set_input_symbols(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_syms) {\n  __Pyx_RefNannyDeclarations\n  int __pyx_t_1;\n  int __pyx_t_2;\n  __Pyx_RefNannySetupContext(\"_set_input_symbols\", 0);\n\n  /* \"pywrapfst.pyx\":2525\n * \n *   cdef void _set_input_symbols(self, _SymbolTable syms) except *:\n *     if syms is None:             # <<<<<<<<<<<<<<\n *       self._mfst.get().SetInputSymbols(NULL)\n *       return\n */\n  __pyx_t_1 = (((PyObject *)__pyx_v_syms) == Py_None);\n  __pyx_t_2 = (__pyx_t_1 != 0);\n  if (__pyx_t_2) {\n\n    /* \"pywrapfst.pyx\":2526\n *   cdef void _set_input_symbols(self, _SymbolTable syms) except *:\n *     if syms is None:\n *       self._mfst.get().SetInputSymbols(NULL)             # <<<<<<<<<<<<<<\n *       return\n *     self._mfst.get().SetInputSymbols(syms._table)\n */\n    if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n      PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_mfst\");\n      __PYX_ERR(0, 2526, __pyx_L1_error)\n    }\n    __pyx_v_self->_mfst.get()->SetInputSymbols(NULL);\n\n    /* \"pywrapfst.pyx\":2527\n *     if syms is None:\n *       self._mfst.get().SetInputSymbols(NULL)\n *       return             # <<<<<<<<<<<<<<\n *     self._mfst.get().SetInputSymbols(syms._table)\n *     self._check_mutating_imethod()\n */\n    goto __pyx_L0;\n\n    /* \"pywrapfst.pyx\":2525\n * \n *   cdef void _set_input_symbols(self, _SymbolTable syms) except *:\n *     if syms is None:             # <<<<<<<<<<<<<<\n *       self._mfst.get().SetInputSymbols(NULL)\n *       return\n */\n  }\n\n  /* \"pywrapfst.pyx\":2528\n *       self._mfst.get().SetInputSymbols(NULL)\n *       return\n *     self._mfst.get().SetInputSymbols(syms._table)             # <<<<<<<<<<<<<<\n *     self._check_mutating_imethod()\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_mfst\");\n    __PYX_ERR(0, 2528, __pyx_L1_error)\n  }\n  if (unlikely(((PyObject *)__pyx_v_syms) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_table\");\n    __PYX_ERR(0, 2528, __pyx_L1_error)\n  }\n  __pyx_v_self->_mfst.get()->SetInputSymbols(__pyx_v_syms->_table);\n\n  /* \"pywrapfst.pyx\":2529\n *       return\n *     self._mfst.get().SetInputSymbols(syms._table)\n *     self._check_mutating_imethod()             # <<<<<<<<<<<<<<\n * \n *   def set_input_symbols(self, _SymbolTable syms):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_check_mutating_imethod\");\n    __PYX_ERR(0, 2529, __pyx_L1_error)\n  }\n  ((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->_check_mutating_imethod(__pyx_v_self); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 2529, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":2524\n *     return self\n * \n *   cdef void _set_input_symbols(self, _SymbolTable syms) except *:             # <<<<<<<<<<<<<<\n *     if syms is None:\n *       self._mfst.get().SetInputSymbols(NULL)\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst._set_input_symbols\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n}\n\n/* \"pywrapfst.pyx\":2531\n *     self._check_mutating_imethod()\n * \n *   def set_input_symbols(self, _SymbolTable syms):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     set_input_symbols(self, syms)\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_53set_input_symbols(PyObject *__pyx_v_self, PyObject *__pyx_v_syms); /*proto*/\nstatic char __pyx_doc_9pywrapfst_11_MutableFst_52set_input_symbols[] = \"\\n    set_input_symbols(self, syms)\\n\\n    Sets the input symbol table.\\n\\n    Passing None as a value will delete the input symbol table.\\n\\n    Args:\\n      syms: A SymbolTable.\\n\\n    Returns:\\n      self.\\n\\n    See also: `set_output_symbols`.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_53set_input_symbols(PyObject *__pyx_v_self, PyObject *__pyx_v_syms) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"set_input_symbols (wrapper)\", 0);\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_syms), __pyx_ptype_9pywrapfst__SymbolTable, 1, \"syms\", 0))) __PYX_ERR(0, 2531, __pyx_L1_error)\n  __pyx_r = __pyx_pf_9pywrapfst_11_MutableFst_52set_input_symbols(((struct __pyx_obj_9pywrapfst__MutableFst *)__pyx_v_self), ((struct __pyx_obj_9pywrapfst__SymbolTable *)__pyx_v_syms));\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_52set_input_symbols(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_syms) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"set_input_symbols\", 0);\n\n  /* \"pywrapfst.pyx\":2547\n *     See also: `set_output_symbols`.\n *     \"\"\"\n *     self._set_input_symbols(syms)             # <<<<<<<<<<<<<<\n *     return self\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_set_input_symbols\");\n    __PYX_ERR(0, 2547, __pyx_L1_error)\n  }\n  ((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->_set_input_symbols(__pyx_v_self, __pyx_v_syms); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 2547, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":2548\n *     \"\"\"\n *     self._set_input_symbols(syms)\n *     return self             # <<<<<<<<<<<<<<\n * \n *   cdef void _set_output_symbols(self, _SymbolTable syms) except *:\n */\n  __Pyx_XDECREF(__pyx_r);\n  __Pyx_INCREF(((PyObject *)__pyx_v_self));\n  __pyx_r = ((PyObject *)__pyx_v_self);\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":2531\n *     self._check_mutating_imethod()\n * \n *   def set_input_symbols(self, _SymbolTable syms):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     set_input_symbols(self, syms)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst.set_input_symbols\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":2550\n *     return self\n * \n *   cdef void _set_output_symbols(self, _SymbolTable syms) except *:             # <<<<<<<<<<<<<<\n *     if syms is None:\n *       self._mfst.get().SetOutputSymbols(NULL)\n */\n\nstatic void __pyx_f_9pywrapfst_11_MutableFst__set_output_symbols(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_syms) {\n  __Pyx_RefNannyDeclarations\n  int __pyx_t_1;\n  int __pyx_t_2;\n  __Pyx_RefNannySetupContext(\"_set_output_symbols\", 0);\n\n  /* \"pywrapfst.pyx\":2551\n * \n *   cdef void _set_output_symbols(self, _SymbolTable syms) except *:\n *     if syms is None:             # <<<<<<<<<<<<<<\n *       self._mfst.get().SetOutputSymbols(NULL)\n *       return\n */\n  __pyx_t_1 = (((PyObject *)__pyx_v_syms) == Py_None);\n  __pyx_t_2 = (__pyx_t_1 != 0);\n  if (__pyx_t_2) {\n\n    /* \"pywrapfst.pyx\":2552\n *   cdef void _set_output_symbols(self, _SymbolTable syms) except *:\n *     if syms is None:\n *       self._mfst.get().SetOutputSymbols(NULL)             # <<<<<<<<<<<<<<\n *       return\n *     self._mfst.get().SetOutputSymbols(syms._table)\n */\n    if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n      PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_mfst\");\n      __PYX_ERR(0, 2552, __pyx_L1_error)\n    }\n    __pyx_v_self->_mfst.get()->SetOutputSymbols(NULL);\n\n    /* \"pywrapfst.pyx\":2553\n *     if syms is None:\n *       self._mfst.get().SetOutputSymbols(NULL)\n *       return             # <<<<<<<<<<<<<<\n *     self._mfst.get().SetOutputSymbols(syms._table)\n *     self._check_mutating_imethod()\n */\n    goto __pyx_L0;\n\n    /* \"pywrapfst.pyx\":2551\n * \n *   cdef void _set_output_symbols(self, _SymbolTable syms) except *:\n *     if syms is None:             # <<<<<<<<<<<<<<\n *       self._mfst.get().SetOutputSymbols(NULL)\n *       return\n */\n  }\n\n  /* \"pywrapfst.pyx\":2554\n *       self._mfst.get().SetOutputSymbols(NULL)\n *       return\n *     self._mfst.get().SetOutputSymbols(syms._table)             # <<<<<<<<<<<<<<\n *     self._check_mutating_imethod()\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_mfst\");\n    __PYX_ERR(0, 2554, __pyx_L1_error)\n  }\n  if (unlikely(((PyObject *)__pyx_v_syms) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_table\");\n    __PYX_ERR(0, 2554, __pyx_L1_error)\n  }\n  __pyx_v_self->_mfst.get()->SetOutputSymbols(__pyx_v_syms->_table);\n\n  /* \"pywrapfst.pyx\":2555\n *       return\n *     self._mfst.get().SetOutputSymbols(syms._table)\n *     self._check_mutating_imethod()             # <<<<<<<<<<<<<<\n * \n *   def set_output_symbols(self, _SymbolTable syms):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_check_mutating_imethod\");\n    __PYX_ERR(0, 2555, __pyx_L1_error)\n  }\n  ((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->_check_mutating_imethod(__pyx_v_self); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 2555, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":2550\n *     return self\n * \n *   cdef void _set_output_symbols(self, _SymbolTable syms) except *:             # <<<<<<<<<<<<<<\n *     if syms is None:\n *       self._mfst.get().SetOutputSymbols(NULL)\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst._set_output_symbols\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n}\n\n/* \"pywrapfst.pyx\":2557\n *     self._check_mutating_imethod()\n * \n *   def set_output_symbols(self, _SymbolTable syms):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     set_output_symbols(self, syms)\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_55set_output_symbols(PyObject *__pyx_v_self, PyObject *__pyx_v_syms); /*proto*/\nstatic char __pyx_doc_9pywrapfst_11_MutableFst_54set_output_symbols[] = \"\\n    set_output_symbols(self, syms)\\n\\n    Sets the output symbol table.\\n\\n    Passing None as a value will delete the output symbol table.\\n\\n    Args:\\n      syms: A SymbolTable.\\n\\n    Returns:\\n      self.\\n\\n    See also: `set_input_symbols`.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_55set_output_symbols(PyObject *__pyx_v_self, PyObject *__pyx_v_syms) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"set_output_symbols (wrapper)\", 0);\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_syms), __pyx_ptype_9pywrapfst__SymbolTable, 1, \"syms\", 0))) __PYX_ERR(0, 2557, __pyx_L1_error)\n  __pyx_r = __pyx_pf_9pywrapfst_11_MutableFst_54set_output_symbols(((struct __pyx_obj_9pywrapfst__MutableFst *)__pyx_v_self), ((struct __pyx_obj_9pywrapfst__SymbolTable *)__pyx_v_syms));\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_54set_output_symbols(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, struct __pyx_obj_9pywrapfst__SymbolTable *__pyx_v_syms) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"set_output_symbols\", 0);\n\n  /* \"pywrapfst.pyx\":2573\n *     See also: `set_input_symbols`.\n *     \"\"\"\n *     self._set_output_symbols(syms)             # <<<<<<<<<<<<<<\n *     return self\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_set_output_symbols\");\n    __PYX_ERR(0, 2573, __pyx_L1_error)\n  }\n  ((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->_set_output_symbols(__pyx_v_self, __pyx_v_syms); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 2573, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":2574\n *     \"\"\"\n *     self._set_output_symbols(syms)\n *     return self             # <<<<<<<<<<<<<<\n * \n *   cdef void _set_properties(self, uint64 props, uint64 mask):\n */\n  __Pyx_XDECREF(__pyx_r);\n  __Pyx_INCREF(((PyObject *)__pyx_v_self));\n  __pyx_r = ((PyObject *)__pyx_v_self);\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":2557\n *     self._check_mutating_imethod()\n * \n *   def set_output_symbols(self, _SymbolTable syms):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     set_output_symbols(self, syms)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst.set_output_symbols\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":2576\n *     return self\n * \n *   cdef void _set_properties(self, uint64 props, uint64 mask):             # <<<<<<<<<<<<<<\n *     self._mfst.get().SetProperties(props, mask)\n * \n */\n\nstatic void __pyx_f_9pywrapfst_11_MutableFst__set_properties(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, __pyx_t_10basictypes_uint64 __pyx_v_props, __pyx_t_10basictypes_uint64 __pyx_v_mask) {\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"_set_properties\", 0);\n\n  /* \"pywrapfst.pyx\":2577\n * \n *   cdef void _set_properties(self, uint64 props, uint64 mask):\n *     self._mfst.get().SetProperties(props, mask)             # <<<<<<<<<<<<<<\n * \n *   def set_properties(self, uint64 props, uint64 mask):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_mfst\");\n    __PYX_ERR(0, 2577, __pyx_L1_error)\n  }\n  __pyx_v_self->_mfst.get()->SetProperties(__pyx_v_props, __pyx_v_mask);\n\n  /* \"pywrapfst.pyx\":2576\n *     return self\n * \n *   cdef void _set_properties(self, uint64 props, uint64 mask):             # <<<<<<<<<<<<<<\n *     self._mfst.get().SetProperties(props, mask)\n * \n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_WriteUnraisable(\"pywrapfst._MutableFst._set_properties\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n}\n\n/* \"pywrapfst.pyx\":2579\n *     self._mfst.get().SetProperties(props, mask)\n * \n *   def set_properties(self, uint64 props, uint64 mask):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     set_properties(self, props, mask)\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_57set_properties(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic char __pyx_doc_9pywrapfst_11_MutableFst_56set_properties[] = \"\\n    set_properties(self, props, mask)\\n\\n    Sets the properties bits.\\n\\n    Args:\\n      props: The properties to be set.\\n      mask: A mask to be applied to the `props` argument before setting the\\n          FST's properties.\\n\\n    Returns:\\n      self.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_57set_properties(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  __pyx_t_10basictypes_uint64 __pyx_v_props;\n  __pyx_t_10basictypes_uint64 __pyx_v_mask;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"set_properties (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_props,&__pyx_n_s_mask,0};\n    PyObject* values[2] = {0,0};\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (likely((values[0] = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_props)) != 0)) kw_args--;\n        else goto __pyx_L5_argtuple_error;\n        CYTHON_FALLTHROUGH;\n        case  1:\n        if (likely((values[1] = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_mask)) != 0)) kw_args--;\n        else {\n          __Pyx_RaiseArgtupleInvalid(\"set_properties\", 1, 2, 2, 1); __PYX_ERR(0, 2579, __pyx_L3_error)\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"set_properties\") < 0)) __PYX_ERR(0, 2579, __pyx_L3_error)\n      }\n    } else if (PyTuple_GET_SIZE(__pyx_args) != 2) {\n      goto __pyx_L5_argtuple_error;\n    } else {\n      values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n      values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n    }\n    __pyx_v_props = __Pyx_PyInt_As_uint64_t(values[0]); if (unlikely((__pyx_v_props == ((uint64_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 2579, __pyx_L3_error)\n    __pyx_v_mask = __Pyx_PyInt_As_uint64_t(values[1]); if (unlikely((__pyx_v_mask == ((uint64_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 2579, __pyx_L3_error)\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"set_properties\", 1, 2, 2, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 2579, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst.set_properties\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  __pyx_r = __pyx_pf_9pywrapfst_11_MutableFst_56set_properties(((struct __pyx_obj_9pywrapfst__MutableFst *)__pyx_v_self), __pyx_v_props, __pyx_v_mask);\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_56set_properties(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, __pyx_t_10basictypes_uint64 __pyx_v_props, __pyx_t_10basictypes_uint64 __pyx_v_mask) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"set_properties\", 0);\n\n  /* \"pywrapfst.pyx\":2593\n *       self.\n *     \"\"\"\n *     self._set_properties(props, mask)             # <<<<<<<<<<<<<<\n *     return self\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_set_properties\");\n    __PYX_ERR(0, 2593, __pyx_L1_error)\n  }\n  ((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->_set_properties(__pyx_v_self, __pyx_v_props, __pyx_v_mask);\n\n  /* \"pywrapfst.pyx\":2594\n *     \"\"\"\n *     self._set_properties(props, mask)\n *     return self             # <<<<<<<<<<<<<<\n * \n *   cdef void _set_start(self, int64 state) except *:\n */\n  __Pyx_XDECREF(__pyx_r);\n  __Pyx_INCREF(((PyObject *)__pyx_v_self));\n  __pyx_r = ((PyObject *)__pyx_v_self);\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":2579\n *     self._mfst.get().SetProperties(props, mask)\n * \n *   def set_properties(self, uint64 props, uint64 mask):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     set_properties(self, props, mask)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst.set_properties\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":2596\n *     return self\n * \n *   cdef void _set_start(self, int64 state) except *:             # <<<<<<<<<<<<<<\n *     if not self._mfst.get().SetStart(state):\n *       raise FstIndexError(\"State index out of range\")\n */\n\nstatic void __pyx_f_9pywrapfst_11_MutableFst__set_start(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, __pyx_t_10basictypes_int64 __pyx_v_state) {\n  __Pyx_RefNannyDeclarations\n  int __pyx_t_1;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  __Pyx_RefNannySetupContext(\"_set_start\", 0);\n\n  /* \"pywrapfst.pyx\":2597\n * \n *   cdef void _set_start(self, int64 state) except *:\n *     if not self._mfst.get().SetStart(state):             # <<<<<<<<<<<<<<\n *       raise FstIndexError(\"State index out of range\")\n *     self._check_mutating_imethod()\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_mfst\");\n    __PYX_ERR(0, 2597, __pyx_L1_error)\n  }\n  __pyx_t_1 = ((!(__pyx_v_self->_mfst.get()->SetStart(__pyx_v_state) != 0)) != 0);\n  if (unlikely(__pyx_t_1)) {\n\n    /* \"pywrapfst.pyx\":2598\n *   cdef void _set_start(self, int64 state) except *:\n *     if not self._mfst.get().SetStart(state):\n *       raise FstIndexError(\"State index out of range\")             # <<<<<<<<<<<<<<\n *     self._check_mutating_imethod()\n * \n */\n    __pyx_t_2 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstIndexError); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 2598, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_2);\n    __pyx_t_3 = __Pyx_PyObject_Call(__pyx_t_2, __pyx_tuple__52, NULL); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 2598, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_3);\n    __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n    __Pyx_Raise(__pyx_t_3, 0, 0, 0);\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    __PYX_ERR(0, 2598, __pyx_L1_error)\n\n    /* \"pywrapfst.pyx\":2597\n * \n *   cdef void _set_start(self, int64 state) except *:\n *     if not self._mfst.get().SetStart(state):             # <<<<<<<<<<<<<<\n *       raise FstIndexError(\"State index out of range\")\n *     self._check_mutating_imethod()\n */\n  }\n\n  /* \"pywrapfst.pyx\":2599\n *     if not self._mfst.get().SetStart(state):\n *       raise FstIndexError(\"State index out of range\")\n *     self._check_mutating_imethod()             # <<<<<<<<<<<<<<\n * \n *   def set_start(self, int64 state):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_check_mutating_imethod\");\n    __PYX_ERR(0, 2599, __pyx_L1_error)\n  }\n  ((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->_check_mutating_imethod(__pyx_v_self); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 2599, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":2596\n *     return self\n * \n *   cdef void _set_start(self, int64 state) except *:             # <<<<<<<<<<<<<<\n *     if not self._mfst.get().SetStart(state):\n *       raise FstIndexError(\"State index out of range\")\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst._set_start\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n}\n\n/* \"pywrapfst.pyx\":2601\n *     self._check_mutating_imethod()\n * \n *   def set_start(self, int64 state):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     set_start(self, state)\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_59set_start(PyObject *__pyx_v_self, PyObject *__pyx_arg_state); /*proto*/\nstatic char __pyx_doc_9pywrapfst_11_MutableFst_58set_start[] = \"\\n    set_start(self, state)\\n\\n    Sets a state to be the initial state state.\\n\\n    Args:\\n      state: The integer index of a state.\\n\\n    Returns:\\n      self.\\n\\n    Raises:\\n      FstIndexError: State index out of range.\\n\\n    See also: `set_final`.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_59set_start(PyObject *__pyx_v_self, PyObject *__pyx_arg_state) {\n  __pyx_t_10basictypes_int64 __pyx_v_state;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"set_start (wrapper)\", 0);\n  assert(__pyx_arg_state); {\n    __pyx_v_state = __Pyx_PyInt_As_int64_t(__pyx_arg_state); if (unlikely((__pyx_v_state == ((int64_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 2601, __pyx_L3_error)\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst.set_start\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  __pyx_r = __pyx_pf_9pywrapfst_11_MutableFst_58set_start(((struct __pyx_obj_9pywrapfst__MutableFst *)__pyx_v_self), ((__pyx_t_10basictypes_int64)__pyx_v_state));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_58set_start(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, __pyx_t_10basictypes_int64 __pyx_v_state) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"set_start\", 0);\n\n  /* \"pywrapfst.pyx\":2618\n *     See also: `set_final`.\n *     \"\"\"\n *     self._set_start(state)             # <<<<<<<<<<<<<<\n *     return self\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_set_start\");\n    __PYX_ERR(0, 2618, __pyx_L1_error)\n  }\n  ((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->_set_start(__pyx_v_self, __pyx_v_state); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 2618, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":2619\n *     \"\"\"\n *     self._set_start(state)\n *     return self             # <<<<<<<<<<<<<<\n * \n *   cdef void _topsort(self) except *:\n */\n  __Pyx_XDECREF(__pyx_r);\n  __Pyx_INCREF(((PyObject *)__pyx_v_self));\n  __pyx_r = ((PyObject *)__pyx_v_self);\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":2601\n *     self._check_mutating_imethod()\n * \n *   def set_start(self, int64 state):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     set_start(self, state)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst.set_start\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":2621\n *     return self\n * \n *   cdef void _topsort(self) except *:             # <<<<<<<<<<<<<<\n *     # TopSort returns False if the FST is cyclic, and thus can't be TopSorted.\n *     if not fst.TopSort(self._mfst.get()):\n */\n\nstatic void __pyx_f_9pywrapfst_11_MutableFst__topsort(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self) {\n  __Pyx_RefNannyDeclarations\n  int __pyx_t_1;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  __Pyx_RefNannySetupContext(\"_topsort\", 0);\n\n  /* \"pywrapfst.pyx\":2623\n *   cdef void _topsort(self) except *:\n *     # TopSort returns False if the FST is cyclic, and thus can't be TopSorted.\n *     if not fst.TopSort(self._mfst.get()):             # <<<<<<<<<<<<<<\n *       logging.warning(\"Cannot topsort cyclic FST.\")\n *     self._check_mutating_imethod()\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_mfst\");\n    __PYX_ERR(0, 2623, __pyx_L1_error)\n  }\n  __pyx_t_1 = ((!(fst::script::TopSort(__pyx_v_self->_mfst.get()) != 0)) != 0);\n  if (__pyx_t_1) {\n\n    /* \"pywrapfst.pyx\":2624\n *     # TopSort returns False if the FST is cyclic, and thus can't be TopSorted.\n *     if not fst.TopSort(self._mfst.get()):\n *       logging.warning(\"Cannot topsort cyclic FST.\")             # <<<<<<<<<<<<<<\n *     self._check_mutating_imethod()\n * \n */\n    __pyx_t_2 = __Pyx_GetModuleGlobalName(__pyx_n_s_logging); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 2624, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_2);\n    __pyx_t_3 = __Pyx_PyObject_GetAttrStr(__pyx_t_2, __pyx_n_s_warning); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 2624, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_3);\n    __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n    __pyx_t_2 = __Pyx_PyObject_Call(__pyx_t_3, __pyx_tuple__53, NULL); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 2624, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_2);\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n\n    /* \"pywrapfst.pyx\":2623\n *   cdef void _topsort(self) except *:\n *     # TopSort returns False if the FST is cyclic, and thus can't be TopSorted.\n *     if not fst.TopSort(self._mfst.get()):             # <<<<<<<<<<<<<<\n *       logging.warning(\"Cannot topsort cyclic FST.\")\n *     self._check_mutating_imethod()\n */\n  }\n\n  /* \"pywrapfst.pyx\":2625\n *     if not fst.TopSort(self._mfst.get()):\n *       logging.warning(\"Cannot topsort cyclic FST.\")\n *     self._check_mutating_imethod()             # <<<<<<<<<<<<<<\n * \n *   def topsort(self):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_check_mutating_imethod\");\n    __PYX_ERR(0, 2625, __pyx_L1_error)\n  }\n  ((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->_check_mutating_imethod(__pyx_v_self); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 2625, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":2621\n *     return self\n * \n *   cdef void _topsort(self) except *:             # <<<<<<<<<<<<<<\n *     # TopSort returns False if the FST is cyclic, and thus can't be TopSorted.\n *     if not fst.TopSort(self._mfst.get()):\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst._topsort\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n}\n\n/* \"pywrapfst.pyx\":2627\n *     self._check_mutating_imethod()\n * \n *   def topsort(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     topsort(self)\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_61topsort(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_11_MutableFst_60topsort[] = \"\\n    topsort(self)\\n\\n    Sorts transitions by state IDs.\\n\\n    This operation destructively topologically sorts the FST, if it is acyclic;\\n    otherwise it remains unchanged. Once sorted, all transitions are from lower\\n    state IDs to higher state IDs\\n\\n    Returns:\\n       self.\\n\\n    See also: `arcsort`.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_61topsort(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"topsort (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_11_MutableFst_60topsort(((struct __pyx_obj_9pywrapfst__MutableFst *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_60topsort(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"topsort\", 0);\n\n  /* \"pywrapfst.pyx\":2642\n *     See also: `arcsort`.\n *     \"\"\"\n *     self._topsort()             # <<<<<<<<<<<<<<\n *     return self\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_topsort\");\n    __PYX_ERR(0, 2642, __pyx_L1_error)\n  }\n  ((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->_topsort(__pyx_v_self); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 2642, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":2643\n *     \"\"\"\n *     self._topsort()\n *     return self             # <<<<<<<<<<<<<<\n * \n *   cdef void _union(self, _Fst ifst) except *:\n */\n  __Pyx_XDECREF(__pyx_r);\n  __Pyx_INCREF(((PyObject *)__pyx_v_self));\n  __pyx_r = ((PyObject *)__pyx_v_self);\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":2627\n *     self._check_mutating_imethod()\n * \n *   def topsort(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     topsort(self)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst.topsort\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":2645\n *     return self\n * \n *   cdef void _union(self, _Fst ifst) except *:             # <<<<<<<<<<<<<<\n *     fst.Union(self._mfst.get(), deref(ifst._fst))\n *     self._check_mutating_imethod()\n */\n\nstatic void __pyx_f_9pywrapfst_11_MutableFst__union(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst) {\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"_union\", 0);\n\n  /* \"pywrapfst.pyx\":2646\n * \n *   cdef void _union(self, _Fst ifst) except *:\n *     fst.Union(self._mfst.get(), deref(ifst._fst))             # <<<<<<<<<<<<<<\n *     self._check_mutating_imethod()\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_mfst\");\n    __PYX_ERR(0, 2646, __pyx_L1_error)\n  }\n  if (unlikely(((PyObject *)__pyx_v_ifst) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 2646, __pyx_L1_error)\n  }\n  fst::script::Union(__pyx_v_self->_mfst.get(), (*__pyx_v_ifst->_fst));\n\n  /* \"pywrapfst.pyx\":2647\n *   cdef void _union(self, _Fst ifst) except *:\n *     fst.Union(self._mfst.get(), deref(ifst._fst))\n *     self._check_mutating_imethod()             # <<<<<<<<<<<<<<\n * \n *   def union(self, _Fst ifst):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_check_mutating_imethod\");\n    __PYX_ERR(0, 2647, __pyx_L1_error)\n  }\n  ((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->_check_mutating_imethod(__pyx_v_self); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 2647, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":2645\n *     return self\n * \n *   cdef void _union(self, _Fst ifst) except *:             # <<<<<<<<<<<<<<\n *     fst.Union(self._mfst.get(), deref(ifst._fst))\n *     self._check_mutating_imethod()\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst._union\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n}\n\n/* \"pywrapfst.pyx\":2649\n *     self._check_mutating_imethod()\n * \n *   def union(self, _Fst ifst):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     union(self, ifst)\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_63union(PyObject *__pyx_v_self, PyObject *__pyx_v_ifst); /*proto*/\nstatic char __pyx_doc_9pywrapfst_11_MutableFst_62union[] = \"\\n    union(self, ifst)\\n\\n    Computes the union (sum) of two FSTs.\\n\\n    This operation computes the union (sum) of two FSTs. If A transduces string\\n    x to y with weight a and B transduces string w to v with weight b, then\\n    their union transduces x to y with weight a and w to v with weight b.\\n\\n    Args:\\n      ifst: The second input FST.\\n\\n    Returns:\\n      self.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_11_MutableFst_63union(PyObject *__pyx_v_self, PyObject *__pyx_v_ifst) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"union (wrapper)\", 0);\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_ifst), __pyx_ptype_9pywrapfst__Fst, 1, \"ifst\", 0))) __PYX_ERR(0, 2649, __pyx_L1_error)\n  __pyx_r = __pyx_pf_9pywrapfst_11_MutableFst_62union(((struct __pyx_obj_9pywrapfst__MutableFst *)__pyx_v_self), ((struct __pyx_obj_9pywrapfst__Fst *)__pyx_v_ifst));\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_11_MutableFst_62union(struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_self, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"union\", 0);\n\n  /* \"pywrapfst.pyx\":2665\n *       self.\n *     \"\"\"\n *     self._union(ifst)             # <<<<<<<<<<<<<<\n *     return self\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_union\");\n    __PYX_ERR(0, 2665, __pyx_L1_error)\n  }\n  ((struct __pyx_vtabstruct_9pywrapfst__MutableFst *)__pyx_v_self->__pyx_base.__pyx_vtab)->_union(__pyx_v_self, __pyx_v_ifst); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 2665, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":2666\n *     \"\"\"\n *     self._union(ifst)\n *     return self             # <<<<<<<<<<<<<<\n * \n * \n */\n  __Pyx_XDECREF(__pyx_r);\n  __Pyx_INCREF(((PyObject *)__pyx_v_self));\n  __pyx_r = ((PyObject *)__pyx_v_self);\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":2649\n *     self._check_mutating_imethod()\n * \n *   def union(self, _Fst ifst):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     union(self, ifst)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"pywrapfst._MutableFst.union\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":2691\n * \n * \n * cdef _Fst _init_Fst(FstClass_ptr tfst):             # <<<<<<<<<<<<<<\n *   if tfst.Properties(fst.kError, True):\n *     raise FstOpError(\"Operation failed\")\n */\n\nstatic struct __pyx_obj_9pywrapfst__Fst *__pyx_f_9pywrapfst__init_Fst(__pyx_t_9pywrapfst_FstClass_ptr __pyx_v_tfst) {\n  struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ofst = 0;\n  struct __pyx_obj_9pywrapfst__Fst *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  int __pyx_t_1;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  __Pyx_RefNannySetupContext(\"_init_Fst\", 0);\n\n  /* \"pywrapfst.pyx\":2692\n * \n * cdef _Fst _init_Fst(FstClass_ptr tfst):\n *   if tfst.Properties(fst.kError, True):             # <<<<<<<<<<<<<<\n *     raise FstOpError(\"Operation failed\")\n *   cdef _Fst ofst = _Fst.__new__(_Fst)\n */\n  __pyx_t_1 = (__pyx_v_tfst->Properties(fst::kError, 1) != 0);\n  if (unlikely(__pyx_t_1)) {\n\n    /* \"pywrapfst.pyx\":2693\n * cdef _Fst _init_Fst(FstClass_ptr tfst):\n *   if tfst.Properties(fst.kError, True):\n *     raise FstOpError(\"Operation failed\")             # <<<<<<<<<<<<<<\n *   cdef _Fst ofst = _Fst.__new__(_Fst)\n *   ofst._fst.reset(tfst)\n */\n    __pyx_t_2 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstOpError); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 2693, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_2);\n    __pyx_t_3 = __Pyx_PyObject_Call(__pyx_t_2, __pyx_tuple__54, NULL); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 2693, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_3);\n    __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n    __Pyx_Raise(__pyx_t_3, 0, 0, 0);\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    __PYX_ERR(0, 2693, __pyx_L1_error)\n\n    /* \"pywrapfst.pyx\":2692\n * \n * cdef _Fst _init_Fst(FstClass_ptr tfst):\n *   if tfst.Properties(fst.kError, True):             # <<<<<<<<<<<<<<\n *     raise FstOpError(\"Operation failed\")\n *   cdef _Fst ofst = _Fst.__new__(_Fst)\n */\n  }\n\n  /* \"pywrapfst.pyx\":2694\n *   if tfst.Properties(fst.kError, True):\n *     raise FstOpError(\"Operation failed\")\n *   cdef _Fst ofst = _Fst.__new__(_Fst)             # <<<<<<<<<<<<<<\n *   ofst._fst.reset(tfst)\n *   return ofst\n */\n  __pyx_t_3 = ((PyObject *)__pyx_tp_new_9pywrapfst__Fst(((PyTypeObject *)__pyx_ptype_9pywrapfst__Fst), __pyx_empty_tuple, NULL)); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 2694, __pyx_L1_error)\n  __Pyx_GOTREF(((PyObject *)__pyx_t_3));\n  __pyx_v_ofst = ((struct __pyx_obj_9pywrapfst__Fst *)__pyx_t_3);\n  __pyx_t_3 = 0;\n\n  /* \"pywrapfst.pyx\":2695\n *     raise FstOpError(\"Operation failed\")\n *   cdef _Fst ofst = _Fst.__new__(_Fst)\n *   ofst._fst.reset(tfst)             # <<<<<<<<<<<<<<\n *   return ofst\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_ofst) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 2695, __pyx_L1_error)\n  }\n  __pyx_v_ofst->_fst.reset(__pyx_v_tfst);\n\n  /* \"pywrapfst.pyx\":2696\n *   cdef _Fst ofst = _Fst.__new__(_Fst)\n *   ofst._fst.reset(tfst)\n *   return ofst             # <<<<<<<<<<<<<<\n * \n * \n */\n  __Pyx_XDECREF(((PyObject *)__pyx_r));\n  __Pyx_INCREF(((PyObject *)__pyx_v_ofst));\n  __pyx_r = __pyx_v_ofst;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":2691\n * \n * \n * cdef _Fst _init_Fst(FstClass_ptr tfst):             # <<<<<<<<<<<<<<\n *   if tfst.Properties(fst.kError, True):\n *     raise FstOpError(\"Operation failed\")\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_AddTraceback(\"pywrapfst._init_Fst\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XDECREF((PyObject *)__pyx_v_ofst);\n  __Pyx_XGIVEREF((PyObject *)__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":2699\n * \n * \n * cdef _MutableFst _init_MutableFst(MutableFstClass_ptr tfst):             # <<<<<<<<<<<<<<\n *   if tfst.Properties(fst.kError, True):\n *     raise FstOpError(\"Operation failed\")\n */\n\nstatic struct __pyx_obj_9pywrapfst__MutableFst *__pyx_f_9pywrapfst__init_MutableFst(__pyx_t_9pywrapfst_MutableFstClass_ptr __pyx_v_tfst) {\n  struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_ofst = 0;\n  struct __pyx_obj_9pywrapfst__MutableFst *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  int __pyx_t_1;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  __Pyx_RefNannySetupContext(\"_init_MutableFst\", 0);\n\n  /* \"pywrapfst.pyx\":2700\n * \n * cdef _MutableFst _init_MutableFst(MutableFstClass_ptr tfst):\n *   if tfst.Properties(fst.kError, True):             # <<<<<<<<<<<<<<\n *     raise FstOpError(\"Operation failed\")\n *   cdef _MutableFst ofst = _MutableFst.__new__(_MutableFst)\n */\n  __pyx_t_1 = (__pyx_v_tfst->Properties(fst::kError, 1) != 0);\n  if (unlikely(__pyx_t_1)) {\n\n    /* \"pywrapfst.pyx\":2701\n * cdef _MutableFst _init_MutableFst(MutableFstClass_ptr tfst):\n *   if tfst.Properties(fst.kError, True):\n *     raise FstOpError(\"Operation failed\")             # <<<<<<<<<<<<<<\n *   cdef _MutableFst ofst = _MutableFst.__new__(_MutableFst)\n *   ofst._fst.reset(tfst)\n */\n    __pyx_t_2 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstOpError); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 2701, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_2);\n    __pyx_t_3 = __Pyx_PyObject_Call(__pyx_t_2, __pyx_tuple__55, NULL); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 2701, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_3);\n    __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n    __Pyx_Raise(__pyx_t_3, 0, 0, 0);\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    __PYX_ERR(0, 2701, __pyx_L1_error)\n\n    /* \"pywrapfst.pyx\":2700\n * \n * cdef _MutableFst _init_MutableFst(MutableFstClass_ptr tfst):\n *   if tfst.Properties(fst.kError, True):             # <<<<<<<<<<<<<<\n *     raise FstOpError(\"Operation failed\")\n *   cdef _MutableFst ofst = _MutableFst.__new__(_MutableFst)\n */\n  }\n\n  /* \"pywrapfst.pyx\":2702\n *   if tfst.Properties(fst.kError, True):\n *     raise FstOpError(\"Operation failed\")\n *   cdef _MutableFst ofst = _MutableFst.__new__(_MutableFst)             # <<<<<<<<<<<<<<\n *   ofst._fst.reset(tfst)\n *   # Makes a copy of it as the derived type! Cool.\n */\n  __pyx_t_3 = ((PyObject *)__pyx_tp_new_9pywrapfst__MutableFst(((PyTypeObject *)__pyx_ptype_9pywrapfst__MutableFst), __pyx_empty_tuple, NULL)); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 2702, __pyx_L1_error)\n  __Pyx_GOTREF(((PyObject *)__pyx_t_3));\n  __pyx_v_ofst = ((struct __pyx_obj_9pywrapfst__MutableFst *)__pyx_t_3);\n  __pyx_t_3 = 0;\n\n  /* \"pywrapfst.pyx\":2703\n *     raise FstOpError(\"Operation failed\")\n *   cdef _MutableFst ofst = _MutableFst.__new__(_MutableFst)\n *   ofst._fst.reset(tfst)             # <<<<<<<<<<<<<<\n *   # Makes a copy of it as the derived type! Cool.\n *   ofst._mfst = static_pointer_cast[fst.MutableFstClass, fst.FstClass](ofst._fst)\n */\n  if (unlikely(((PyObject *)__pyx_v_ofst) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 2703, __pyx_L1_error)\n  }\n  __pyx_v_ofst->__pyx_base._fst.reset(__pyx_v_tfst);\n\n  /* \"pywrapfst.pyx\":2705\n *   ofst._fst.reset(tfst)\n *   # Makes a copy of it as the derived type! Cool.\n *   ofst._mfst = static_pointer_cast[fst.MutableFstClass, fst.FstClass](ofst._fst)             # <<<<<<<<<<<<<<\n *   return ofst\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_ofst) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 2705, __pyx_L1_error)\n  }\n  if (unlikely(((PyObject *)__pyx_v_ofst) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_mfst\");\n    __PYX_ERR(0, 2705, __pyx_L1_error)\n  }\n  __pyx_v_ofst->_mfst = std::static_pointer_cast<fst::script::MutableFstClass,fst::script::FstClass>(__pyx_v_ofst->__pyx_base._fst);\n\n  /* \"pywrapfst.pyx\":2706\n *   # Makes a copy of it as the derived type! Cool.\n *   ofst._mfst = static_pointer_cast[fst.MutableFstClass, fst.FstClass](ofst._fst)\n *   return ofst             # <<<<<<<<<<<<<<\n * \n * \n */\n  __Pyx_XDECREF(((PyObject *)__pyx_r));\n  __Pyx_INCREF(((PyObject *)__pyx_v_ofst));\n  __pyx_r = __pyx_v_ofst;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":2699\n * \n * \n * cdef _MutableFst _init_MutableFst(MutableFstClass_ptr tfst):             # <<<<<<<<<<<<<<\n *   if tfst.Properties(fst.kError, True):\n *     raise FstOpError(\"Operation failed\")\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_AddTraceback(\"pywrapfst._init_MutableFst\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XDECREF((PyObject *)__pyx_v_ofst);\n  __Pyx_XGIVEREF((PyObject *)__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":2709\n * \n * \n * cdef _Fst _init_XFst(FstClass_ptr tfst):             # <<<<<<<<<<<<<<\n *   if tfst.Properties(fst.kMutable, True):\n *     return _init_MutableFst(static_cast[MutableFstClass_ptr](tfst))\n */\n\nstatic struct __pyx_obj_9pywrapfst__Fst *__pyx_f_9pywrapfst__init_XFst(__pyx_t_9pywrapfst_FstClass_ptr __pyx_v_tfst) {\n  struct __pyx_obj_9pywrapfst__Fst *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  int __pyx_t_1;\n  PyObject *__pyx_t_2 = NULL;\n  __Pyx_RefNannySetupContext(\"_init_XFst\", 0);\n\n  /* \"pywrapfst.pyx\":2710\n * \n * cdef _Fst _init_XFst(FstClass_ptr tfst):\n *   if tfst.Properties(fst.kMutable, True):             # <<<<<<<<<<<<<<\n *     return _init_MutableFst(static_cast[MutableFstClass_ptr](tfst))\n *   else:\n */\n  __pyx_t_1 = (__pyx_v_tfst->Properties(fst::kMutable, 1) != 0);\n  if (__pyx_t_1) {\n\n    /* \"pywrapfst.pyx\":2711\n * cdef _Fst _init_XFst(FstClass_ptr tfst):\n *   if tfst.Properties(fst.kMutable, True):\n *     return _init_MutableFst(static_cast[MutableFstClass_ptr](tfst))             # <<<<<<<<<<<<<<\n *   else:\n *     return _init_Fst(tfst)\n */\n    __Pyx_XDECREF(((PyObject *)__pyx_r));\n    __pyx_t_2 = ((PyObject *)__pyx_f_9pywrapfst__init_MutableFst(static_cast<__pyx_t_9pywrapfst_MutableFstClass_ptr>(__pyx_v_tfst))); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 2711, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_2);\n    __pyx_r = ((struct __pyx_obj_9pywrapfst__Fst *)__pyx_t_2);\n    __pyx_t_2 = 0;\n    goto __pyx_L0;\n\n    /* \"pywrapfst.pyx\":2710\n * \n * cdef _Fst _init_XFst(FstClass_ptr tfst):\n *   if tfst.Properties(fst.kMutable, True):             # <<<<<<<<<<<<<<\n *     return _init_MutableFst(static_cast[MutableFstClass_ptr](tfst))\n *   else:\n */\n  }\n\n  /* \"pywrapfst.pyx\":2713\n *     return _init_MutableFst(static_cast[MutableFstClass_ptr](tfst))\n *   else:\n *     return _init_Fst(tfst)             # <<<<<<<<<<<<<<\n * \n * \n */\n  /*else*/ {\n    __Pyx_XDECREF(((PyObject *)__pyx_r));\n    __pyx_t_2 = ((PyObject *)__pyx_f_9pywrapfst__init_Fst(__pyx_v_tfst)); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 2713, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_2);\n    __pyx_r = ((struct __pyx_obj_9pywrapfst__Fst *)__pyx_t_2);\n    __pyx_t_2 = 0;\n    goto __pyx_L0;\n  }\n\n  /* \"pywrapfst.pyx\":2709\n * \n * \n * cdef _Fst _init_XFst(FstClass_ptr tfst):             # <<<<<<<<<<<<<<\n *   if tfst.Properties(fst.kMutable, True):\n *     return _init_MutableFst(static_cast[MutableFstClass_ptr](tfst))\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_AddTraceback(\"pywrapfst._init_XFst\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XGIVEREF((PyObject *)__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":2716\n * \n * \n * cdef _MutableFst _create_Fst(arc_type=b\"standard\"):             # <<<<<<<<<<<<<<\n *   cdef unique_ptr[fst.VectorFstClass] tfst\n *   tfst.reset(new fst.VectorFstClass(tostring(arc_type)))\n */\n\nstatic struct __pyx_obj_9pywrapfst__MutableFst *__pyx_f_9pywrapfst__create_Fst(struct __pyx_opt_args_9pywrapfst__create_Fst *__pyx_optional_args) {\n  PyObject *__pyx_v_arc_type = ((PyObject *)__pyx_n_b_standard);\n  std::unique_ptr<fst::script::VectorFstClass>  __pyx_v_tfst;\n  struct __pyx_obj_9pywrapfst__MutableFst *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  std::string __pyx_t_1;\n  int __pyx_t_2;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  PyObject *__pyx_t_6 = NULL;\n  PyObject *__pyx_t_7 = NULL;\n  PyObject *__pyx_t_8 = NULL;\n  __Pyx_RefNannySetupContext(\"_create_Fst\", 0);\n  if (__pyx_optional_args) {\n    if (__pyx_optional_args->__pyx_n > 0) {\n      __pyx_v_arc_type = __pyx_optional_args->arc_type;\n    }\n  }\n\n  /* \"pywrapfst.pyx\":2718\n * cdef _MutableFst _create_Fst(arc_type=b\"standard\"):\n *   cdef unique_ptr[fst.VectorFstClass] tfst\n *   tfst.reset(new fst.VectorFstClass(tostring(arc_type)))             # <<<<<<<<<<<<<<\n *   if tfst.get() == NULL:\n *     raise FstOpError(\"Unknown arc type: {!r}\".format(arc_type))\n */\n  __pyx_t_1 = __pyx_f_9pywrapfst_tostring(__pyx_v_arc_type, NULL); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 2718, __pyx_L1_error)\n  __pyx_v_tfst.reset(new fst::script::VectorFstClass(__pyx_t_1));\n\n  /* \"pywrapfst.pyx\":2719\n *   cdef unique_ptr[fst.VectorFstClass] tfst\n *   tfst.reset(new fst.VectorFstClass(tostring(arc_type)))\n *   if tfst.get() == NULL:             # <<<<<<<<<<<<<<\n *     raise FstOpError(\"Unknown arc type: {!r}\".format(arc_type))\n *   return _init_MutableFst(tfst.release())\n */\n  __pyx_t_2 = ((__pyx_v_tfst.get() == NULL) != 0);\n  if (unlikely(__pyx_t_2)) {\n\n    /* \"pywrapfst.pyx\":2720\n *   tfst.reset(new fst.VectorFstClass(tostring(arc_type)))\n *   if tfst.get() == NULL:\n *     raise FstOpError(\"Unknown arc type: {!r}\".format(arc_type))             # <<<<<<<<<<<<<<\n *   return _init_MutableFst(tfst.release())\n * \n */\n    __pyx_t_4 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstOpError); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 2720, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_4);\n    __pyx_t_6 = __Pyx_PyObject_GetAttrStr(__pyx_kp_s_Unknown_arc_type_r, __pyx_n_s_format); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 2720, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_6);\n    __pyx_t_7 = NULL;\n    if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_6))) {\n      __pyx_t_7 = PyMethod_GET_SELF(__pyx_t_6);\n      if (likely(__pyx_t_7)) {\n        PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_6);\n        __Pyx_INCREF(__pyx_t_7);\n        __Pyx_INCREF(function);\n        __Pyx_DECREF_SET(__pyx_t_6, function);\n      }\n    }\n    if (!__pyx_t_7) {\n      __pyx_t_5 = __Pyx_PyObject_CallOneArg(__pyx_t_6, __pyx_v_arc_type); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 2720, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_5);\n    } else {\n      #if CYTHON_FAST_PYCALL\n      if (PyFunction_Check(__pyx_t_6)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_7, __pyx_v_arc_type};\n        __pyx_t_5 = __Pyx_PyFunction_FastCall(__pyx_t_6, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 2720, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_7); __pyx_t_7 = 0;\n        __Pyx_GOTREF(__pyx_t_5);\n      } else\n      #endif\n      #if CYTHON_FAST_PYCCALL\n      if (__Pyx_PyFastCFunction_Check(__pyx_t_6)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_7, __pyx_v_arc_type};\n        __pyx_t_5 = __Pyx_PyCFunction_FastCall(__pyx_t_6, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 2720, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_7); __pyx_t_7 = 0;\n        __Pyx_GOTREF(__pyx_t_5);\n      } else\n      #endif\n      {\n        __pyx_t_8 = PyTuple_New(1+1); if (unlikely(!__pyx_t_8)) __PYX_ERR(0, 2720, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_8);\n        __Pyx_GIVEREF(__pyx_t_7); PyTuple_SET_ITEM(__pyx_t_8, 0, __pyx_t_7); __pyx_t_7 = NULL;\n        __Pyx_INCREF(__pyx_v_arc_type);\n        __Pyx_GIVEREF(__pyx_v_arc_type);\n        PyTuple_SET_ITEM(__pyx_t_8, 0+1, __pyx_v_arc_type);\n        __pyx_t_5 = __Pyx_PyObject_Call(__pyx_t_6, __pyx_t_8, NULL); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 2720, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_5);\n        __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0;\n      }\n    }\n    __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n    __pyx_t_6 = NULL;\n    if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_4))) {\n      __pyx_t_6 = PyMethod_GET_SELF(__pyx_t_4);\n      if (likely(__pyx_t_6)) {\n        PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_4);\n        __Pyx_INCREF(__pyx_t_6);\n        __Pyx_INCREF(function);\n        __Pyx_DECREF_SET(__pyx_t_4, function);\n      }\n    }\n    if (!__pyx_t_6) {\n      __pyx_t_3 = __Pyx_PyObject_CallOneArg(__pyx_t_4, __pyx_t_5); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 2720, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n      __Pyx_GOTREF(__pyx_t_3);\n    } else {\n      #if CYTHON_FAST_PYCALL\n      if (PyFunction_Check(__pyx_t_4)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_6, __pyx_t_5};\n        __pyx_t_3 = __Pyx_PyFunction_FastCall(__pyx_t_4, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 2720, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_6); __pyx_t_6 = 0;\n        __Pyx_GOTREF(__pyx_t_3);\n        __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n      } else\n      #endif\n      #if CYTHON_FAST_PYCCALL\n      if (__Pyx_PyFastCFunction_Check(__pyx_t_4)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_6, __pyx_t_5};\n        __pyx_t_3 = __Pyx_PyCFunction_FastCall(__pyx_t_4, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 2720, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_6); __pyx_t_6 = 0;\n        __Pyx_GOTREF(__pyx_t_3);\n        __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n      } else\n      #endif\n      {\n        __pyx_t_8 = PyTuple_New(1+1); if (unlikely(!__pyx_t_8)) __PYX_ERR(0, 2720, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_8);\n        __Pyx_GIVEREF(__pyx_t_6); PyTuple_SET_ITEM(__pyx_t_8, 0, __pyx_t_6); __pyx_t_6 = NULL;\n        __Pyx_GIVEREF(__pyx_t_5);\n        PyTuple_SET_ITEM(__pyx_t_8, 0+1, __pyx_t_5);\n        __pyx_t_5 = 0;\n        __pyx_t_3 = __Pyx_PyObject_Call(__pyx_t_4, __pyx_t_8, NULL); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 2720, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_3);\n        __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0;\n      }\n    }\n    __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n    __Pyx_Raise(__pyx_t_3, 0, 0, 0);\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    __PYX_ERR(0, 2720, __pyx_L1_error)\n\n    /* \"pywrapfst.pyx\":2719\n *   cdef unique_ptr[fst.VectorFstClass] tfst\n *   tfst.reset(new fst.VectorFstClass(tostring(arc_type)))\n *   if tfst.get() == NULL:             # <<<<<<<<<<<<<<\n *     raise FstOpError(\"Unknown arc type: {!r}\".format(arc_type))\n *   return _init_MutableFst(tfst.release())\n */\n  }\n\n  /* \"pywrapfst.pyx\":2721\n *   if tfst.get() == NULL:\n *     raise FstOpError(\"Unknown arc type: {!r}\".format(arc_type))\n *   return _init_MutableFst(tfst.release())             # <<<<<<<<<<<<<<\n * \n * \n */\n  __Pyx_XDECREF(((PyObject *)__pyx_r));\n  __pyx_t_3 = ((PyObject *)__pyx_f_9pywrapfst__init_MutableFst(__pyx_v_tfst.release())); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 2721, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_3);\n  __pyx_r = ((struct __pyx_obj_9pywrapfst__MutableFst *)__pyx_t_3);\n  __pyx_t_3 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":2716\n * \n * \n * cdef _MutableFst _create_Fst(arc_type=b\"standard\"):             # <<<<<<<<<<<<<<\n *   cdef unique_ptr[fst.VectorFstClass] tfst\n *   tfst.reset(new fst.VectorFstClass(tostring(arc_type)))\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_XDECREF(__pyx_t_6);\n  __Pyx_XDECREF(__pyx_t_7);\n  __Pyx_XDECREF(__pyx_t_8);\n  __Pyx_AddTraceback(\"pywrapfst._create_Fst\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XGIVEREF((PyObject *)__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":2724\n * \n * \n * cpdef _Fst _read(filename):             # <<<<<<<<<<<<<<\n *   cdef unique_ptr[fst.FstClass] tfst\n *   tfst.reset(fst.FstClass.Read(tostring(filename)))\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_13_read(PyObject *__pyx_self, PyObject *__pyx_v_filename); /*proto*/\nstatic struct __pyx_obj_9pywrapfst__Fst *__pyx_f_9pywrapfst__read(PyObject *__pyx_v_filename, CYTHON_UNUSED int __pyx_skip_dispatch) {\n  std::unique_ptr<fst::script::FstClass>  __pyx_v_tfst;\n  struct __pyx_obj_9pywrapfst__Fst *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  std::string __pyx_t_1;\n  int __pyx_t_2;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  PyObject *__pyx_t_6 = NULL;\n  PyObject *__pyx_t_7 = NULL;\n  PyObject *__pyx_t_8 = NULL;\n  __Pyx_RefNannySetupContext(\"_read\", 0);\n\n  /* \"pywrapfst.pyx\":2726\n * cpdef _Fst _read(filename):\n *   cdef unique_ptr[fst.FstClass] tfst\n *   tfst.reset(fst.FstClass.Read(tostring(filename)))             # <<<<<<<<<<<<<<\n *   if tfst.get() == NULL:\n *     raise FstIOError(\"Read failed: {!r}\".format(filename))\n */\n  __pyx_t_1 = __pyx_f_9pywrapfst_tostring(__pyx_v_filename, NULL); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 2726, __pyx_L1_error)\n  __pyx_v_tfst.reset(fst::script::FstClass::Read(__pyx_t_1));\n\n  /* \"pywrapfst.pyx\":2727\n *   cdef unique_ptr[fst.FstClass] tfst\n *   tfst.reset(fst.FstClass.Read(tostring(filename)))\n *   if tfst.get() == NULL:             # <<<<<<<<<<<<<<\n *     raise FstIOError(\"Read failed: {!r}\".format(filename))\n *   return _init_XFst(tfst.release())\n */\n  __pyx_t_2 = ((__pyx_v_tfst.get() == NULL) != 0);\n  if (unlikely(__pyx_t_2)) {\n\n    /* \"pywrapfst.pyx\":2728\n *   tfst.reset(fst.FstClass.Read(tostring(filename)))\n *   if tfst.get() == NULL:\n *     raise FstIOError(\"Read failed: {!r}\".format(filename))             # <<<<<<<<<<<<<<\n *   return _init_XFst(tfst.release())\n * \n */\n    __pyx_t_4 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstIOError); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 2728, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_4);\n    __pyx_t_6 = __Pyx_PyObject_GetAttrStr(__pyx_kp_s_Read_failed_r, __pyx_n_s_format); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 2728, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_6);\n    __pyx_t_7 = NULL;\n    if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_6))) {\n      __pyx_t_7 = PyMethod_GET_SELF(__pyx_t_6);\n      if (likely(__pyx_t_7)) {\n        PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_6);\n        __Pyx_INCREF(__pyx_t_7);\n        __Pyx_INCREF(function);\n        __Pyx_DECREF_SET(__pyx_t_6, function);\n      }\n    }\n    if (!__pyx_t_7) {\n      __pyx_t_5 = __Pyx_PyObject_CallOneArg(__pyx_t_6, __pyx_v_filename); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 2728, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_5);\n    } else {\n      #if CYTHON_FAST_PYCALL\n      if (PyFunction_Check(__pyx_t_6)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_7, __pyx_v_filename};\n        __pyx_t_5 = __Pyx_PyFunction_FastCall(__pyx_t_6, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 2728, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_7); __pyx_t_7 = 0;\n        __Pyx_GOTREF(__pyx_t_5);\n      } else\n      #endif\n      #if CYTHON_FAST_PYCCALL\n      if (__Pyx_PyFastCFunction_Check(__pyx_t_6)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_7, __pyx_v_filename};\n        __pyx_t_5 = __Pyx_PyCFunction_FastCall(__pyx_t_6, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 2728, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_7); __pyx_t_7 = 0;\n        __Pyx_GOTREF(__pyx_t_5);\n      } else\n      #endif\n      {\n        __pyx_t_8 = PyTuple_New(1+1); if (unlikely(!__pyx_t_8)) __PYX_ERR(0, 2728, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_8);\n        __Pyx_GIVEREF(__pyx_t_7); PyTuple_SET_ITEM(__pyx_t_8, 0, __pyx_t_7); __pyx_t_7 = NULL;\n        __Pyx_INCREF(__pyx_v_filename);\n        __Pyx_GIVEREF(__pyx_v_filename);\n        PyTuple_SET_ITEM(__pyx_t_8, 0+1, __pyx_v_filename);\n        __pyx_t_5 = __Pyx_PyObject_Call(__pyx_t_6, __pyx_t_8, NULL); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 2728, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_5);\n        __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0;\n      }\n    }\n    __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n    __pyx_t_6 = NULL;\n    if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_4))) {\n      __pyx_t_6 = PyMethod_GET_SELF(__pyx_t_4);\n      if (likely(__pyx_t_6)) {\n        PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_4);\n        __Pyx_INCREF(__pyx_t_6);\n        __Pyx_INCREF(function);\n        __Pyx_DECREF_SET(__pyx_t_4, function);\n      }\n    }\n    if (!__pyx_t_6) {\n      __pyx_t_3 = __Pyx_PyObject_CallOneArg(__pyx_t_4, __pyx_t_5); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 2728, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n      __Pyx_GOTREF(__pyx_t_3);\n    } else {\n      #if CYTHON_FAST_PYCALL\n      if (PyFunction_Check(__pyx_t_4)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_6, __pyx_t_5};\n        __pyx_t_3 = __Pyx_PyFunction_FastCall(__pyx_t_4, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 2728, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_6); __pyx_t_6 = 0;\n        __Pyx_GOTREF(__pyx_t_3);\n        __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n      } else\n      #endif\n      #if CYTHON_FAST_PYCCALL\n      if (__Pyx_PyFastCFunction_Check(__pyx_t_4)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_6, __pyx_t_5};\n        __pyx_t_3 = __Pyx_PyCFunction_FastCall(__pyx_t_4, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 2728, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_6); __pyx_t_6 = 0;\n        __Pyx_GOTREF(__pyx_t_3);\n        __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n      } else\n      #endif\n      {\n        __pyx_t_8 = PyTuple_New(1+1); if (unlikely(!__pyx_t_8)) __PYX_ERR(0, 2728, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_8);\n        __Pyx_GIVEREF(__pyx_t_6); PyTuple_SET_ITEM(__pyx_t_8, 0, __pyx_t_6); __pyx_t_6 = NULL;\n        __Pyx_GIVEREF(__pyx_t_5);\n        PyTuple_SET_ITEM(__pyx_t_8, 0+1, __pyx_t_5);\n        __pyx_t_5 = 0;\n        __pyx_t_3 = __Pyx_PyObject_Call(__pyx_t_4, __pyx_t_8, NULL); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 2728, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_3);\n        __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0;\n      }\n    }\n    __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n    __Pyx_Raise(__pyx_t_3, 0, 0, 0);\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    __PYX_ERR(0, 2728, __pyx_L1_error)\n\n    /* \"pywrapfst.pyx\":2727\n *   cdef unique_ptr[fst.FstClass] tfst\n *   tfst.reset(fst.FstClass.Read(tostring(filename)))\n *   if tfst.get() == NULL:             # <<<<<<<<<<<<<<\n *     raise FstIOError(\"Read failed: {!r}\".format(filename))\n *   return _init_XFst(tfst.release())\n */\n  }\n\n  /* \"pywrapfst.pyx\":2729\n *   if tfst.get() == NULL:\n *     raise FstIOError(\"Read failed: {!r}\".format(filename))\n *   return _init_XFst(tfst.release())             # <<<<<<<<<<<<<<\n * \n * \n */\n  __Pyx_XDECREF(((PyObject *)__pyx_r));\n  __pyx_t_3 = ((PyObject *)__pyx_f_9pywrapfst__init_XFst(__pyx_v_tfst.release())); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 2729, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_3);\n  __pyx_r = ((struct __pyx_obj_9pywrapfst__Fst *)__pyx_t_3);\n  __pyx_t_3 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":2724\n * \n * \n * cpdef _Fst _read(filename):             # <<<<<<<<<<<<<<\n *   cdef unique_ptr[fst.FstClass] tfst\n *   tfst.reset(fst.FstClass.Read(tostring(filename)))\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_XDECREF(__pyx_t_6);\n  __Pyx_XDECREF(__pyx_t_7);\n  __Pyx_XDECREF(__pyx_t_8);\n  __Pyx_AddTraceback(\"pywrapfst._read\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XGIVEREF((PyObject *)__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_13_read(PyObject *__pyx_self, PyObject *__pyx_v_filename); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_13_read(PyObject *__pyx_self, PyObject *__pyx_v_filename) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"_read (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_12_read(__pyx_self, ((PyObject *)__pyx_v_filename));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_12_read(CYTHON_UNUSED PyObject *__pyx_self, PyObject *__pyx_v_filename) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"_read\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst__read(__pyx_v_filename, 0)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2724, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst._read\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":2732\n * \n * \n * cpdef _Fst _read_from_string(state):             # <<<<<<<<<<<<<<\n *   cdef stringstream sstrm\n *   sstrm << tostring(state)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_15_read_from_string(PyObject *__pyx_self, PyObject *__pyx_v_state); /*proto*/\nstatic struct __pyx_obj_9pywrapfst__Fst *__pyx_f_9pywrapfst__read_from_string(PyObject *__pyx_v_state, CYTHON_UNUSED int __pyx_skip_dispatch) {\n  std::stringstream __pyx_v_sstrm;\n  std::unique_ptr<fst::script::FstClass>  __pyx_v_tfst;\n  struct __pyx_obj_9pywrapfst__Fst *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  std::string __pyx_t_1;\n  int __pyx_t_2;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  __Pyx_RefNannySetupContext(\"_read_from_string\", 0);\n\n  /* \"pywrapfst.pyx\":2734\n * cpdef _Fst _read_from_string(state):\n *   cdef stringstream sstrm\n *   sstrm << tostring(state)             # <<<<<<<<<<<<<<\n *   cdef unique_ptr[fst.FstClass] tfst\n *   tfst.reset(fst.FstClass.ReadFromStream(sstrm, b\"<pywrapfst>\"))\n */\n  __pyx_t_1 = __pyx_f_9pywrapfst_tostring(__pyx_v_state, NULL); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 2734, __pyx_L1_error)\n  (void)((__pyx_v_sstrm << __pyx_t_1));\n\n  /* \"pywrapfst.pyx\":2736\n *   sstrm << tostring(state)\n *   cdef unique_ptr[fst.FstClass] tfst\n *   tfst.reset(fst.FstClass.ReadFromStream(sstrm, b\"<pywrapfst>\"))             # <<<<<<<<<<<<<<\n *   if tfst.get() == NULL:\n *     raise FstIOError(\"Read failed: <string>\")\n */\n  __pyx_v_tfst.reset(fst::script::FstClass::Read(__pyx_v_sstrm, __pyx_k_pywrapfst));\n\n  /* \"pywrapfst.pyx\":2737\n *   cdef unique_ptr[fst.FstClass] tfst\n *   tfst.reset(fst.FstClass.ReadFromStream(sstrm, b\"<pywrapfst>\"))\n *   if tfst.get() == NULL:             # <<<<<<<<<<<<<<\n *     raise FstIOError(\"Read failed: <string>\")\n *   return _init_XFst(tfst.release())\n */\n  __pyx_t_2 = ((__pyx_v_tfst.get() == NULL) != 0);\n  if (unlikely(__pyx_t_2)) {\n\n    /* \"pywrapfst.pyx\":2738\n *   tfst.reset(fst.FstClass.ReadFromStream(sstrm, b\"<pywrapfst>\"))\n *   if tfst.get() == NULL:\n *     raise FstIOError(\"Read failed: <string>\")             # <<<<<<<<<<<<<<\n *   return _init_XFst(tfst.release())\n * \n */\n    __pyx_t_3 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstIOError); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 2738, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_3);\n    __pyx_t_4 = __Pyx_PyObject_Call(__pyx_t_3, __pyx_tuple__56, NULL); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 2738, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_4);\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    __Pyx_Raise(__pyx_t_4, 0, 0, 0);\n    __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n    __PYX_ERR(0, 2738, __pyx_L1_error)\n\n    /* \"pywrapfst.pyx\":2737\n *   cdef unique_ptr[fst.FstClass] tfst\n *   tfst.reset(fst.FstClass.ReadFromStream(sstrm, b\"<pywrapfst>\"))\n *   if tfst.get() == NULL:             # <<<<<<<<<<<<<<\n *     raise FstIOError(\"Read failed: <string>\")\n *   return _init_XFst(tfst.release())\n */\n  }\n\n  /* \"pywrapfst.pyx\":2739\n *   if tfst.get() == NULL:\n *     raise FstIOError(\"Read failed: <string>\")\n *   return _init_XFst(tfst.release())             # <<<<<<<<<<<<<<\n * \n * \n */\n  __Pyx_XDECREF(((PyObject *)__pyx_r));\n  __pyx_t_4 = ((PyObject *)__pyx_f_9pywrapfst__init_XFst(__pyx_v_tfst.release())); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 2739, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_4);\n  __pyx_r = ((struct __pyx_obj_9pywrapfst__Fst *)__pyx_t_4);\n  __pyx_t_4 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":2732\n * \n * \n * cpdef _Fst _read_from_string(state):             # <<<<<<<<<<<<<<\n *   cdef stringstream sstrm\n *   sstrm << tostring(state)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_AddTraceback(\"pywrapfst._read_from_string\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XGIVEREF((PyObject *)__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_15_read_from_string(PyObject *__pyx_self, PyObject *__pyx_v_state); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_15_read_from_string(PyObject *__pyx_self, PyObject *__pyx_v_state) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"_read_from_string (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_14_read_from_string(__pyx_self, ((PyObject *)__pyx_v_state));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_14_read_from_string(CYTHON_UNUSED PyObject *__pyx_self, PyObject *__pyx_v_state) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"_read_from_string\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst__read_from_string(__pyx_v_state, 0)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2732, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst._read_from_string\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":2759\n *    \"\"\"\n * \n *    def __new__(cls, arc_type=b\"standard\"):             # <<<<<<<<<<<<<<\n *     return _create_Fst(arc_type)\n * \n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_3Fst_1__new__(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic PyMethodDef __pyx_mdef_9pywrapfst_3Fst_1__new__ = {\"__new__\", (PyCFunction)__pyx_pw_9pywrapfst_3Fst_1__new__, METH_VARARGS|METH_KEYWORDS, 0};\nstatic PyObject *__pyx_pw_9pywrapfst_3Fst_1__new__(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  CYTHON_UNUSED PyObject *__pyx_v_cls = 0;\n  PyObject *__pyx_v_arc_type = 0;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__new__ (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_cls,&__pyx_n_s_arc_type,0};\n    PyObject* values[2] = {0,0};\n    values[1] = ((PyObject *)((PyObject*)__pyx_n_b_standard));\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (likely((values[0] = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_cls)) != 0)) kw_args--;\n        else goto __pyx_L5_argtuple_error;\n        CYTHON_FALLTHROUGH;\n        case  1:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_arc_type);\n          if (value) { values[1] = value; kw_args--; }\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"__new__\") < 0)) __PYX_ERR(0, 2759, __pyx_L3_error)\n      }\n    } else {\n      switch (PyTuple_GET_SIZE(__pyx_args)) {\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n    }\n    __pyx_v_cls = values[0];\n    __pyx_v_arc_type = values[1];\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"__new__\", 0, 1, 2, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 2759, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst.Fst.__new__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  __pyx_r = __pyx_pf_9pywrapfst_3Fst___new__(__pyx_self, __pyx_v_cls, __pyx_v_arc_type);\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_3Fst___new__(CYTHON_UNUSED PyObject *__pyx_self, CYTHON_UNUSED PyObject *__pyx_v_cls, PyObject *__pyx_v_arc_type) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  struct __pyx_opt_args_9pywrapfst__create_Fst __pyx_t_2;\n  __Pyx_RefNannySetupContext(\"__new__\", 0);\n\n  /* \"pywrapfst.pyx\":2760\n * \n *    def __new__(cls, arc_type=b\"standard\"):\n *     return _create_Fst(arc_type)             # <<<<<<<<<<<<<<\n * \n *    @staticmethod\n */\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_2.__pyx_n = 1;\n  __pyx_t_2.arc_type = __pyx_v_arc_type;\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst__create_Fst(&__pyx_t_2)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2760, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":2759\n *    \"\"\"\n * \n *    def __new__(cls, arc_type=b\"standard\"):             # <<<<<<<<<<<<<<\n *     return _create_Fst(arc_type)\n * \n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.Fst.__new__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":2763\n * \n *    @staticmethod\n *    def read(filename):             # <<<<<<<<<<<<<<\n *      \"\"\"\n *      read(filename):\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_3Fst_3read(PyObject *__pyx_self, PyObject *__pyx_v_filename); /*proto*/\nstatic char __pyx_doc_9pywrapfst_3Fst_2read[] = \"\\n     read(filename):\\n\\n     Reads an FST from a file.\\n\\n     Args:\\n       filename: The string location of the input file.\\n\\n     Returns:\\n       An FST object.\\n\\n     Raises:\\n       FstIOError: Read failed.\\n     \";\nstatic PyMethodDef __pyx_mdef_9pywrapfst_3Fst_3read = {\"read\", (PyCFunction)__pyx_pw_9pywrapfst_3Fst_3read, METH_O, __pyx_doc_9pywrapfst_3Fst_2read};\nstatic PyObject *__pyx_pw_9pywrapfst_3Fst_3read(PyObject *__pyx_self, PyObject *__pyx_v_filename) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"read (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_3Fst_2read(__pyx_self, ((PyObject *)__pyx_v_filename));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_3Fst_2read(CYTHON_UNUSED PyObject *__pyx_self, PyObject *__pyx_v_filename) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"read\", 0);\n\n  /* \"pywrapfst.pyx\":2778\n *        FstIOError: Read failed.\n *      \"\"\"\n *      return _read(filename)             # <<<<<<<<<<<<<<\n * \n *    @staticmethod\n */\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst__read(__pyx_v_filename, 0)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2778, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":2763\n * \n *    @staticmethod\n *    def read(filename):             # <<<<<<<<<<<<<<\n *      \"\"\"\n *      read(filename):\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.Fst.read\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":2781\n * \n *    @staticmethod\n *    def read_from_string(state):             # <<<<<<<<<<<<<<\n *      \"\"\"\n *      read_from_string(string, fst_type=None)\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_3Fst_5read_from_string(PyObject *__pyx_self, PyObject *__pyx_v_state); /*proto*/\nstatic char __pyx_doc_9pywrapfst_3Fst_4read_from_string[] = \"\\n     read_from_string(string, fst_type=None)\\n\\n     Reads an FST from a serialized string.\\n\\n     Args:\\n       state: A string containing the serialized FST.\\n\\n     Returns:\\n       An FST object.\\n\\n     Raises:\\n       FstIOError: Read failed.\\n       FstOpError: Read-time conversion failed.\\n\\n     See also: `write_to_string`.\\n     \";\nstatic PyMethodDef __pyx_mdef_9pywrapfst_3Fst_5read_from_string = {\"read_from_string\", (PyCFunction)__pyx_pw_9pywrapfst_3Fst_5read_from_string, METH_O, __pyx_doc_9pywrapfst_3Fst_4read_from_string};\nstatic PyObject *__pyx_pw_9pywrapfst_3Fst_5read_from_string(PyObject *__pyx_self, PyObject *__pyx_v_state) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"read_from_string (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_3Fst_4read_from_string(__pyx_self, ((PyObject *)__pyx_v_state));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_3Fst_4read_from_string(CYTHON_UNUSED PyObject *__pyx_self, PyObject *__pyx_v_state) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"read_from_string\", 0);\n\n  /* \"pywrapfst.pyx\":2799\n *      See also: `write_to_string`.\n *      \"\"\"\n *      return _read_from_string(state)             # <<<<<<<<<<<<<<\n * \n * \n */\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst__read_from_string(__pyx_v_state, 0)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2799, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":2781\n * \n *    @staticmethod\n *    def read_from_string(state):             # <<<<<<<<<<<<<<\n *      \"\"\"\n *      read_from_string(string, fst_type=None)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.Fst.read_from_string\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":2914\n *   \"\"\"\n * \n *   def __repr__(self):             # <<<<<<<<<<<<<<\n *     return \"<Arc at 0x{:x}>\".format(id(self))\n * \n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_3Arc_1__repr__(PyObject *__pyx_v_self); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_3Arc_1__repr__(PyObject *__pyx_v_self) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__repr__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_3Arc___repr__(((struct __pyx_obj_9pywrapfst_Arc *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_3Arc___repr__(struct __pyx_obj_9pywrapfst_Arc *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  __Pyx_RefNannySetupContext(\"__repr__\", 0);\n\n  /* \"pywrapfst.pyx\":2915\n * \n *   def __repr__(self):\n *     return \"<Arc at 0x{:x}>\".format(id(self))             # <<<<<<<<<<<<<<\n * \n *   def __init__(self, int64 ilabel, int64 olabel, weight, int64 nextstate):\n */\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_2 = __Pyx_PyObject_GetAttrStr(__pyx_kp_s_Arc_at_0x_x, __pyx_n_s_format); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 2915, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  __pyx_t_3 = __Pyx_PyObject_CallOneArg(__pyx_builtin_id, ((PyObject *)__pyx_v_self)); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 2915, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_3);\n  __pyx_t_4 = NULL;\n  if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_2))) {\n    __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_2);\n    if (likely(__pyx_t_4)) {\n      PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_2);\n      __Pyx_INCREF(__pyx_t_4);\n      __Pyx_INCREF(function);\n      __Pyx_DECREF_SET(__pyx_t_2, function);\n    }\n  }\n  if (!__pyx_t_4) {\n    __pyx_t_1 = __Pyx_PyObject_CallOneArg(__pyx_t_2, __pyx_t_3); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2915, __pyx_L1_error)\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    __Pyx_GOTREF(__pyx_t_1);\n  } else {\n    #if CYTHON_FAST_PYCALL\n    if (PyFunction_Check(__pyx_t_2)) {\n      PyObject *__pyx_temp[2] = {__pyx_t_4, __pyx_t_3};\n      __pyx_t_1 = __Pyx_PyFunction_FastCall(__pyx_t_2, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2915, __pyx_L1_error)\n      __Pyx_XDECREF(__pyx_t_4); __pyx_t_4 = 0;\n      __Pyx_GOTREF(__pyx_t_1);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    } else\n    #endif\n    #if CYTHON_FAST_PYCCALL\n    if (__Pyx_PyFastCFunction_Check(__pyx_t_2)) {\n      PyObject *__pyx_temp[2] = {__pyx_t_4, __pyx_t_3};\n      __pyx_t_1 = __Pyx_PyCFunction_FastCall(__pyx_t_2, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2915, __pyx_L1_error)\n      __Pyx_XDECREF(__pyx_t_4); __pyx_t_4 = 0;\n      __Pyx_GOTREF(__pyx_t_1);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    } else\n    #endif\n    {\n      __pyx_t_5 = PyTuple_New(1+1); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 2915, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_5);\n      __Pyx_GIVEREF(__pyx_t_4); PyTuple_SET_ITEM(__pyx_t_5, 0, __pyx_t_4); __pyx_t_4 = NULL;\n      __Pyx_GIVEREF(__pyx_t_3);\n      PyTuple_SET_ITEM(__pyx_t_5, 0+1, __pyx_t_3);\n      __pyx_t_3 = 0;\n      __pyx_t_1 = __Pyx_PyObject_Call(__pyx_t_2, __pyx_t_5, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2915, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_1);\n      __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n    }\n  }\n  __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":2914\n *   \"\"\"\n * \n *   def __repr__(self):             # <<<<<<<<<<<<<<\n *     return \"<Arc at 0x{:x}>\".format(id(self))\n * \n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_AddTraceback(\"pywrapfst.Arc.__repr__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":2917\n *     return \"<Arc at 0x{:x}>\".format(id(self))\n * \n *   def __init__(self, int64 ilabel, int64 olabel, weight, int64 nextstate):             # <<<<<<<<<<<<<<\n *     cdef fst.WeightClass wc = _get_WeightClass_or_One(b\"tropical\", weight)\n *     self._arc.reset(new fst.ArcClass(ilabel, olabel, wc, nextstate))\n */\n\n/* Python wrapper */\nstatic int __pyx_pw_9pywrapfst_3Arc_3__init__(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic int __pyx_pw_9pywrapfst_3Arc_3__init__(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  __pyx_t_10basictypes_int64 __pyx_v_ilabel;\n  __pyx_t_10basictypes_int64 __pyx_v_olabel;\n  PyObject *__pyx_v_weight = 0;\n  __pyx_t_10basictypes_int64 __pyx_v_nextstate;\n  int __pyx_r;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__init__ (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_ilabel,&__pyx_n_s_olabel,&__pyx_n_s_weight,&__pyx_n_s_nextstate,0};\n    PyObject* values[4] = {0,0,0,0};\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  4: values[3] = PyTuple_GET_ITEM(__pyx_args, 3);\n        CYTHON_FALLTHROUGH;\n        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);\n        CYTHON_FALLTHROUGH;\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (likely((values[0] = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_ilabel)) != 0)) kw_args--;\n        else goto __pyx_L5_argtuple_error;\n        CYTHON_FALLTHROUGH;\n        case  1:\n        if (likely((values[1] = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_olabel)) != 0)) kw_args--;\n        else {\n          __Pyx_RaiseArgtupleInvalid(\"__init__\", 1, 4, 4, 1); __PYX_ERR(0, 2917, __pyx_L3_error)\n        }\n        CYTHON_FALLTHROUGH;\n        case  2:\n        if (likely((values[2] = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_weight)) != 0)) kw_args--;\n        else {\n          __Pyx_RaiseArgtupleInvalid(\"__init__\", 1, 4, 4, 2); __PYX_ERR(0, 2917, __pyx_L3_error)\n        }\n        CYTHON_FALLTHROUGH;\n        case  3:\n        if (likely((values[3] = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_nextstate)) != 0)) kw_args--;\n        else {\n          __Pyx_RaiseArgtupleInvalid(\"__init__\", 1, 4, 4, 3); __PYX_ERR(0, 2917, __pyx_L3_error)\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"__init__\") < 0)) __PYX_ERR(0, 2917, __pyx_L3_error)\n      }\n    } else if (PyTuple_GET_SIZE(__pyx_args) != 4) {\n      goto __pyx_L5_argtuple_error;\n    } else {\n      values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n      values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n      values[2] = PyTuple_GET_ITEM(__pyx_args, 2);\n      values[3] = PyTuple_GET_ITEM(__pyx_args, 3);\n    }\n    __pyx_v_ilabel = __Pyx_PyInt_As_int64_t(values[0]); if (unlikely((__pyx_v_ilabel == ((int64_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 2917, __pyx_L3_error)\n    __pyx_v_olabel = __Pyx_PyInt_As_int64_t(values[1]); if (unlikely((__pyx_v_olabel == ((int64_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 2917, __pyx_L3_error)\n    __pyx_v_weight = values[2];\n    __pyx_v_nextstate = __Pyx_PyInt_As_int64_t(values[3]); if (unlikely((__pyx_v_nextstate == ((int64_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 2917, __pyx_L3_error)\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"__init__\", 1, 4, 4, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 2917, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst.Arc.__init__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return -1;\n  __pyx_L4_argument_unpacking_done:;\n  __pyx_r = __pyx_pf_9pywrapfst_3Arc_2__init__(((struct __pyx_obj_9pywrapfst_Arc *)__pyx_v_self), __pyx_v_ilabel, __pyx_v_olabel, __pyx_v_weight, __pyx_v_nextstate);\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic int __pyx_pf_9pywrapfst_3Arc_2__init__(struct __pyx_obj_9pywrapfst_Arc *__pyx_v_self, __pyx_t_10basictypes_int64 __pyx_v_ilabel, __pyx_t_10basictypes_int64 __pyx_v_olabel, PyObject *__pyx_v_weight, __pyx_t_10basictypes_int64 __pyx_v_nextstate) {\n  fst::script::WeightClass __pyx_v_wc;\n  int __pyx_r;\n  __Pyx_RefNannyDeclarations\n  fst::script::WeightClass __pyx_t_1;\n  __Pyx_RefNannySetupContext(\"__init__\", 0);\n\n  /* \"pywrapfst.pyx\":2918\n * \n *   def __init__(self, int64 ilabel, int64 olabel, weight, int64 nextstate):\n *     cdef fst.WeightClass wc = _get_WeightClass_or_One(b\"tropical\", weight)             # <<<<<<<<<<<<<<\n *     self._arc.reset(new fst.ArcClass(ilabel, olabel, wc, nextstate))\n * \n */\n  __pyx_t_1 = __pyx_f_9pywrapfst__get_WeightClass_or_One(__pyx_k_tropical, __pyx_v_weight); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 2918, __pyx_L1_error)\n  __pyx_v_wc = __pyx_t_1;\n\n  /* \"pywrapfst.pyx\":2919\n *   def __init__(self, int64 ilabel, int64 olabel, weight, int64 nextstate):\n *     cdef fst.WeightClass wc = _get_WeightClass_or_One(b\"tropical\", weight)\n *     self._arc.reset(new fst.ArcClass(ilabel, olabel, wc, nextstate))             # <<<<<<<<<<<<<<\n * \n *   cpdef Arc copy(self):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_arc\");\n    __PYX_ERR(0, 2919, __pyx_L1_error)\n  }\n  __pyx_v_self->_arc.reset(new fst::script::ArcClass(__pyx_v_ilabel, __pyx_v_olabel, __pyx_v_wc, __pyx_v_nextstate));\n\n  /* \"pywrapfst.pyx\":2917\n *     return \"<Arc at 0x{:x}>\".format(id(self))\n * \n *   def __init__(self, int64 ilabel, int64 olabel, weight, int64 nextstate):             # <<<<<<<<<<<<<<\n *     cdef fst.WeightClass wc = _get_WeightClass_or_One(b\"tropical\", weight)\n *     self._arc.reset(new fst.ArcClass(ilabel, olabel, wc, nextstate))\n */\n\n  /* function exit code */\n  __pyx_r = 0;\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"pywrapfst.Arc.__init__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = -1;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":2921\n *     self._arc.reset(new fst.ArcClass(ilabel, olabel, wc, nextstate))\n * \n *   cpdef Arc copy(self):             # <<<<<<<<<<<<<<\n *     return Arc(self.ilabel, self.olabel, self.weight, self.nextstate)\n * \n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_3Arc_5copy(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic struct __pyx_obj_9pywrapfst_Arc *__pyx_f_9pywrapfst_3Arc_copy(struct __pyx_obj_9pywrapfst_Arc *__pyx_v_self, int __pyx_skip_dispatch) {\n  struct __pyx_obj_9pywrapfst_Arc *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  __Pyx_RefNannySetupContext(\"copy\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_copy); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2921, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_3Arc_5copy)) {\n      __Pyx_XDECREF(((PyObject *)__pyx_r));\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 2921, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 2921, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      if (!(likely(((__pyx_t_2) == Py_None) || likely(__Pyx_TypeTest(__pyx_t_2, __pyx_ptype_9pywrapfst_Arc))))) __PYX_ERR(0, 2921, __pyx_L1_error)\n      __pyx_r = ((struct __pyx_obj_9pywrapfst_Arc *)__pyx_t_2);\n      __pyx_t_2 = 0;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":2922\n * \n *   cpdef Arc copy(self):\n *     return Arc(self.ilabel, self.olabel, self.weight, self.nextstate)             # <<<<<<<<<<<<<<\n * \n *   property ilabel:\n */\n  __Pyx_XDECREF(((PyObject *)__pyx_r));\n  __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_ilabel); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2922, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_t_2 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_olabel); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 2922, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  __pyx_t_3 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_weight); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 2922, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_3);\n  __pyx_t_4 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_nextstate); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 2922, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_4);\n  __pyx_t_5 = PyTuple_New(4); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 2922, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_5);\n  __Pyx_GIVEREF(__pyx_t_1);\n  PyTuple_SET_ITEM(__pyx_t_5, 0, __pyx_t_1);\n  __Pyx_GIVEREF(__pyx_t_2);\n  PyTuple_SET_ITEM(__pyx_t_5, 1, __pyx_t_2);\n  __Pyx_GIVEREF(__pyx_t_3);\n  PyTuple_SET_ITEM(__pyx_t_5, 2, __pyx_t_3);\n  __Pyx_GIVEREF(__pyx_t_4);\n  PyTuple_SET_ITEM(__pyx_t_5, 3, __pyx_t_4);\n  __pyx_t_1 = 0;\n  __pyx_t_2 = 0;\n  __pyx_t_3 = 0;\n  __pyx_t_4 = 0;\n  __pyx_t_4 = __Pyx_PyObject_Call(((PyObject *)__pyx_ptype_9pywrapfst_Arc), __pyx_t_5, NULL); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 2922, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_4);\n  __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n  __pyx_r = ((struct __pyx_obj_9pywrapfst_Arc *)__pyx_t_4);\n  __pyx_t_4 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":2921\n *     self._arc.reset(new fst.ArcClass(ilabel, olabel, wc, nextstate))\n * \n *   cpdef Arc copy(self):             # <<<<<<<<<<<<<<\n *     return Arc(self.ilabel, self.olabel, self.weight, self.nextstate)\n * \n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_AddTraceback(\"pywrapfst.Arc.copy\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XGIVEREF((PyObject *)__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_3Arc_5copy(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_3Arc_5copy(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"copy (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_3Arc_4copy(((struct __pyx_obj_9pywrapfst_Arc *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_3Arc_4copy(struct __pyx_obj_9pywrapfst_Arc *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"copy\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst_3Arc_copy(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2921, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.Arc.copy\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":2926\n *   property ilabel:\n * \n *     def __get__(self):             # <<<<<<<<<<<<<<\n *       return deref(self._arc).ilabel\n * \n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_3Arc_6ilabel_1__get__(PyObject *__pyx_v_self); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_3Arc_6ilabel_1__get__(PyObject *__pyx_v_self) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__get__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_3Arc_6ilabel___get__(((struct __pyx_obj_9pywrapfst_Arc *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_3Arc_6ilabel___get__(struct __pyx_obj_9pywrapfst_Arc *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"__get__\", 0);\n\n  /* \"pywrapfst.pyx\":2927\n * \n *     def __get__(self):\n *       return deref(self._arc).ilabel             # <<<<<<<<<<<<<<\n * \n *     def __set__(self, int64 value):\n */\n  __Pyx_XDECREF(__pyx_r);\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_arc\");\n    __PYX_ERR(0, 2927, __pyx_L1_error)\n  }\n  __pyx_t_1 = __Pyx_PyInt_From_int64_t((*__pyx_v_self->_arc).ilabel); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2927, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":2926\n *   property ilabel:\n * \n *     def __get__(self):             # <<<<<<<<<<<<<<\n *       return deref(self._arc).ilabel\n * \n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.Arc.ilabel.__get__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":2929\n *       return deref(self._arc).ilabel\n * \n *     def __set__(self, int64 value):             # <<<<<<<<<<<<<<\n *       deref(self._arc).ilabel = value\n * \n */\n\n/* Python wrapper */\nstatic int __pyx_pw_9pywrapfst_3Arc_6ilabel_3__set__(PyObject *__pyx_v_self, PyObject *__pyx_arg_value); /*proto*/\nstatic int __pyx_pw_9pywrapfst_3Arc_6ilabel_3__set__(PyObject *__pyx_v_self, PyObject *__pyx_arg_value) {\n  __pyx_t_10basictypes_int64 __pyx_v_value;\n  int __pyx_r;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__set__ (wrapper)\", 0);\n  assert(__pyx_arg_value); {\n    __pyx_v_value = __Pyx_PyInt_As_int64_t(__pyx_arg_value); if (unlikely((__pyx_v_value == ((int64_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 2929, __pyx_L3_error)\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst.Arc.ilabel.__set__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return -1;\n  __pyx_L4_argument_unpacking_done:;\n  __pyx_r = __pyx_pf_9pywrapfst_3Arc_6ilabel_2__set__(((struct __pyx_obj_9pywrapfst_Arc *)__pyx_v_self), ((__pyx_t_10basictypes_int64)__pyx_v_value));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic int __pyx_pf_9pywrapfst_3Arc_6ilabel_2__set__(struct __pyx_obj_9pywrapfst_Arc *__pyx_v_self, __pyx_t_10basictypes_int64 __pyx_v_value) {\n  int __pyx_r;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__set__\", 0);\n\n  /* \"pywrapfst.pyx\":2930\n * \n *     def __set__(self, int64 value):\n *       deref(self._arc).ilabel = value             # <<<<<<<<<<<<<<\n * \n *   property olabel:\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_arc\");\n    __PYX_ERR(0, 2930, __pyx_L1_error)\n  }\n  (*__pyx_v_self->_arc).ilabel = __pyx_v_value;\n\n  /* \"pywrapfst.pyx\":2929\n *       return deref(self._arc).ilabel\n * \n *     def __set__(self, int64 value):             # <<<<<<<<<<<<<<\n *       deref(self._arc).ilabel = value\n * \n */\n\n  /* function exit code */\n  __pyx_r = 0;\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"pywrapfst.Arc.ilabel.__set__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = -1;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":2934\n *   property olabel:\n * \n *     def __get__(self):             # <<<<<<<<<<<<<<\n *       return deref(self._arc).olabel\n * \n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_3Arc_6olabel_1__get__(PyObject *__pyx_v_self); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_3Arc_6olabel_1__get__(PyObject *__pyx_v_self) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__get__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_3Arc_6olabel___get__(((struct __pyx_obj_9pywrapfst_Arc *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_3Arc_6olabel___get__(struct __pyx_obj_9pywrapfst_Arc *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"__get__\", 0);\n\n  /* \"pywrapfst.pyx\":2935\n * \n *     def __get__(self):\n *       return deref(self._arc).olabel             # <<<<<<<<<<<<<<\n * \n *     def __set__(self, int64 value):\n */\n  __Pyx_XDECREF(__pyx_r);\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_arc\");\n    __PYX_ERR(0, 2935, __pyx_L1_error)\n  }\n  __pyx_t_1 = __Pyx_PyInt_From_int64_t((*__pyx_v_self->_arc).olabel); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2935, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":2934\n *   property olabel:\n * \n *     def __get__(self):             # <<<<<<<<<<<<<<\n *       return deref(self._arc).olabel\n * \n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.Arc.olabel.__get__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":2937\n *       return deref(self._arc).olabel\n * \n *     def __set__(self, int64 value):             # <<<<<<<<<<<<<<\n *       deref(self._arc).olabel = value\n * \n */\n\n/* Python wrapper */\nstatic int __pyx_pw_9pywrapfst_3Arc_6olabel_3__set__(PyObject *__pyx_v_self, PyObject *__pyx_arg_value); /*proto*/\nstatic int __pyx_pw_9pywrapfst_3Arc_6olabel_3__set__(PyObject *__pyx_v_self, PyObject *__pyx_arg_value) {\n  __pyx_t_10basictypes_int64 __pyx_v_value;\n  int __pyx_r;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__set__ (wrapper)\", 0);\n  assert(__pyx_arg_value); {\n    __pyx_v_value = __Pyx_PyInt_As_int64_t(__pyx_arg_value); if (unlikely((__pyx_v_value == ((int64_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 2937, __pyx_L3_error)\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst.Arc.olabel.__set__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return -1;\n  __pyx_L4_argument_unpacking_done:;\n  __pyx_r = __pyx_pf_9pywrapfst_3Arc_6olabel_2__set__(((struct __pyx_obj_9pywrapfst_Arc *)__pyx_v_self), ((__pyx_t_10basictypes_int64)__pyx_v_value));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic int __pyx_pf_9pywrapfst_3Arc_6olabel_2__set__(struct __pyx_obj_9pywrapfst_Arc *__pyx_v_self, __pyx_t_10basictypes_int64 __pyx_v_value) {\n  int __pyx_r;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__set__\", 0);\n\n  /* \"pywrapfst.pyx\":2938\n * \n *     def __set__(self, int64 value):\n *       deref(self._arc).olabel = value             # <<<<<<<<<<<<<<\n * \n *   property weight:\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_arc\");\n    __PYX_ERR(0, 2938, __pyx_L1_error)\n  }\n  (*__pyx_v_self->_arc).olabel = __pyx_v_value;\n\n  /* \"pywrapfst.pyx\":2937\n *       return deref(self._arc).olabel\n * \n *     def __set__(self, int64 value):             # <<<<<<<<<<<<<<\n *       deref(self._arc).olabel = value\n * \n */\n\n  /* function exit code */\n  __pyx_r = 0;\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"pywrapfst.Arc.olabel.__set__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = -1;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":2942\n *   property weight:\n * \n *     def __get__(self):             # <<<<<<<<<<<<<<\n *       cdef Weight weight = Weight.__new__(Weight)\n *       weight._weight.reset(new fst.WeightClass(deref(self._arc).weight))\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_3Arc_6weight_1__get__(PyObject *__pyx_v_self); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_3Arc_6weight_1__get__(PyObject *__pyx_v_self) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__get__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_3Arc_6weight___get__(((struct __pyx_obj_9pywrapfst_Arc *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_3Arc_6weight___get__(struct __pyx_obj_9pywrapfst_Arc *__pyx_v_self) {\n  struct __pyx_obj_9pywrapfst_Weight *__pyx_v_weight = 0;\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"__get__\", 0);\n\n  /* \"pywrapfst.pyx\":2943\n * \n *     def __get__(self):\n *       cdef Weight weight = Weight.__new__(Weight)             # <<<<<<<<<<<<<<\n *       weight._weight.reset(new fst.WeightClass(deref(self._arc).weight))\n *       return weight\n */\n  __pyx_t_1 = ((PyObject *)__pyx_tp_new_9pywrapfst_Weight(((PyTypeObject *)__pyx_ptype_9pywrapfst_Weight), __pyx_empty_tuple, NULL)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2943, __pyx_L1_error)\n  __Pyx_GOTREF(((PyObject *)__pyx_t_1));\n  __pyx_v_weight = ((struct __pyx_obj_9pywrapfst_Weight *)__pyx_t_1);\n  __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2944\n *     def __get__(self):\n *       cdef Weight weight = Weight.__new__(Weight)\n *       weight._weight.reset(new fst.WeightClass(deref(self._arc).weight))             # <<<<<<<<<<<<<<\n *       return weight\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_weight) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_weight\");\n    __PYX_ERR(0, 2944, __pyx_L1_error)\n  }\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_arc\");\n    __PYX_ERR(0, 2944, __pyx_L1_error)\n  }\n  __pyx_v_weight->_weight.reset(new fst::script::WeightClass((*__pyx_v_self->_arc).weight));\n\n  /* \"pywrapfst.pyx\":2945\n *       cdef Weight weight = Weight.__new__(Weight)\n *       weight._weight.reset(new fst.WeightClass(deref(self._arc).weight))\n *       return weight             # <<<<<<<<<<<<<<\n * \n *     def __set__(self, weight):\n */\n  __Pyx_XDECREF(__pyx_r);\n  __Pyx_INCREF(((PyObject *)__pyx_v_weight));\n  __pyx_r = ((PyObject *)__pyx_v_weight);\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":2942\n *   property weight:\n * \n *     def __get__(self):             # <<<<<<<<<<<<<<\n *       cdef Weight weight = Weight.__new__(Weight)\n *       weight._weight.reset(new fst.WeightClass(deref(self._arc).weight))\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.Arc.weight.__get__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XDECREF((PyObject *)__pyx_v_weight);\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":2947\n *       return weight\n * \n *     def __set__(self, weight):             # <<<<<<<<<<<<<<\n *       deref(self._arc).weight = _get_WeightClass_or_One(b\"tropical\", weight)\n * \n */\n\n/* Python wrapper */\nstatic int __pyx_pw_9pywrapfst_3Arc_6weight_3__set__(PyObject *__pyx_v_self, PyObject *__pyx_v_weight); /*proto*/\nstatic int __pyx_pw_9pywrapfst_3Arc_6weight_3__set__(PyObject *__pyx_v_self, PyObject *__pyx_v_weight) {\n  int __pyx_r;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__set__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_3Arc_6weight_2__set__(((struct __pyx_obj_9pywrapfst_Arc *)__pyx_v_self), ((PyObject *)__pyx_v_weight));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic int __pyx_pf_9pywrapfst_3Arc_6weight_2__set__(struct __pyx_obj_9pywrapfst_Arc *__pyx_v_self, PyObject *__pyx_v_weight) {\n  int __pyx_r;\n  __Pyx_RefNannyDeclarations\n  fst::script::WeightClass __pyx_t_1;\n  __Pyx_RefNannySetupContext(\"__set__\", 0);\n\n  /* \"pywrapfst.pyx\":2948\n * \n *     def __set__(self, weight):\n *       deref(self._arc).weight = _get_WeightClass_or_One(b\"tropical\", weight)             # <<<<<<<<<<<<<<\n * \n *   property nextstate:\n */\n  __pyx_t_1 = __pyx_f_9pywrapfst__get_WeightClass_or_One(__pyx_k_tropical, __pyx_v_weight); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 2948, __pyx_L1_error)\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_arc\");\n    __PYX_ERR(0, 2948, __pyx_L1_error)\n  }\n  (*__pyx_v_self->_arc).weight = __pyx_t_1;\n\n  /* \"pywrapfst.pyx\":2947\n *       return weight\n * \n *     def __set__(self, weight):             # <<<<<<<<<<<<<<\n *       deref(self._arc).weight = _get_WeightClass_or_One(b\"tropical\", weight)\n * \n */\n\n  /* function exit code */\n  __pyx_r = 0;\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"pywrapfst.Arc.weight.__set__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = -1;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":2952\n *   property nextstate:\n * \n *     def __get__(self):             # <<<<<<<<<<<<<<\n *       return deref(self._arc).nextstate\n * \n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_3Arc_9nextstate_1__get__(PyObject *__pyx_v_self); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_3Arc_9nextstate_1__get__(PyObject *__pyx_v_self) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__get__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_3Arc_9nextstate___get__(((struct __pyx_obj_9pywrapfst_Arc *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_3Arc_9nextstate___get__(struct __pyx_obj_9pywrapfst_Arc *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"__get__\", 0);\n\n  /* \"pywrapfst.pyx\":2953\n * \n *     def __get__(self):\n *       return deref(self._arc).nextstate             # <<<<<<<<<<<<<<\n * \n *     def __set__(self, int64 value):\n */\n  __Pyx_XDECREF(__pyx_r);\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_arc\");\n    __PYX_ERR(0, 2953, __pyx_L1_error)\n  }\n  __pyx_t_1 = __Pyx_PyInt_From_int64_t((*__pyx_v_self->_arc).nextstate); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2953, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":2952\n *   property nextstate:\n * \n *     def __get__(self):             # <<<<<<<<<<<<<<\n *       return deref(self._arc).nextstate\n * \n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.Arc.nextstate.__get__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":2955\n *       return deref(self._arc).nextstate\n * \n *     def __set__(self, int64 value):             # <<<<<<<<<<<<<<\n *       deref(self._arc).nextstate = value\n * \n */\n\n/* Python wrapper */\nstatic int __pyx_pw_9pywrapfst_3Arc_9nextstate_3__set__(PyObject *__pyx_v_self, PyObject *__pyx_arg_value); /*proto*/\nstatic int __pyx_pw_9pywrapfst_3Arc_9nextstate_3__set__(PyObject *__pyx_v_self, PyObject *__pyx_arg_value) {\n  __pyx_t_10basictypes_int64 __pyx_v_value;\n  int __pyx_r;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__set__ (wrapper)\", 0);\n  assert(__pyx_arg_value); {\n    __pyx_v_value = __Pyx_PyInt_As_int64_t(__pyx_arg_value); if (unlikely((__pyx_v_value == ((int64_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 2955, __pyx_L3_error)\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst.Arc.nextstate.__set__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return -1;\n  __pyx_L4_argument_unpacking_done:;\n  __pyx_r = __pyx_pf_9pywrapfst_3Arc_9nextstate_2__set__(((struct __pyx_obj_9pywrapfst_Arc *)__pyx_v_self), ((__pyx_t_10basictypes_int64)__pyx_v_value));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic int __pyx_pf_9pywrapfst_3Arc_9nextstate_2__set__(struct __pyx_obj_9pywrapfst_Arc *__pyx_v_self, __pyx_t_10basictypes_int64 __pyx_v_value) {\n  int __pyx_r;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__set__\", 0);\n\n  /* \"pywrapfst.pyx\":2956\n * \n *     def __set__(self, int64 value):\n *       deref(self._arc).nextstate = value             # <<<<<<<<<<<<<<\n * \n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_arc\");\n    __PYX_ERR(0, 2956, __pyx_L1_error)\n  }\n  (*__pyx_v_self->_arc).nextstate = __pyx_v_value;\n\n  /* \"pywrapfst.pyx\":2955\n *       return deref(self._arc).nextstate\n * \n *     def __set__(self, int64 value):             # <<<<<<<<<<<<<<\n *       deref(self._arc).nextstate = value\n * \n */\n\n  /* function exit code */\n  __pyx_r = 0;\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"pywrapfst.Arc.nextstate.__set__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = -1;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"(tree fragment)\":1\n * def __reduce_cython__(self):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._arc cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_3Arc_7__reduce_cython__(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_3Arc_7__reduce_cython__(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__reduce_cython__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_3Arc_6__reduce_cython__(((struct __pyx_obj_9pywrapfst_Arc *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_3Arc_6__reduce_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst_Arc *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"__reduce_cython__\", 0);\n\n  /* \"(tree fragment)\":2\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._arc cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._arc cannot be converted to a Python object for pickling\")\n */\n  __pyx_t_1 = __Pyx_PyObject_Call(__pyx_builtin_TypeError, __pyx_tuple__57, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(1, 2, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __Pyx_Raise(__pyx_t_1, 0, 0, 0);\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  __PYX_ERR(1, 2, __pyx_L1_error)\n\n  /* \"(tree fragment)\":1\n * def __reduce_cython__(self):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._arc cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.Arc.__reduce_cython__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"(tree fragment)\":3\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._arc cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._arc cannot be converted to a Python object for pickling\")\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_3Arc_9__setstate_cython__(PyObject *__pyx_v_self, PyObject *__pyx_v___pyx_state); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_3Arc_9__setstate_cython__(PyObject *__pyx_v_self, PyObject *__pyx_v___pyx_state) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__setstate_cython__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_3Arc_8__setstate_cython__(((struct __pyx_obj_9pywrapfst_Arc *)__pyx_v_self), ((PyObject *)__pyx_v___pyx_state));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_3Arc_8__setstate_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst_Arc *__pyx_v_self, CYTHON_UNUSED PyObject *__pyx_v___pyx_state) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"__setstate_cython__\", 0);\n\n  /* \"(tree fragment)\":4\n *     raise TypeError(\"self._arc cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._arc cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n */\n  __pyx_t_1 = __Pyx_PyObject_Call(__pyx_builtin_TypeError, __pyx_tuple__58, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(1, 4, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __Pyx_Raise(__pyx_t_1, 0, 0, 0);\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  __PYX_ERR(1, 4, __pyx_L1_error)\n\n  /* \"(tree fragment)\":3\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._arc cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._arc cannot be converted to a Python object for pickling\")\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.Arc.__setstate_cython__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":2959\n * \n * \n * cdef Arc _init_Arc(const fst.ArcClass &arc):             # <<<<<<<<<<<<<<\n *   cdef Weight weight = Weight.__new__(Weight)\n *   weight._weight.reset(new fst.WeightClass(arc.weight))\n */\n\nstatic struct __pyx_obj_9pywrapfst_Arc *__pyx_f_9pywrapfst__init_Arc(fst::script::ArcClass const &__pyx_v_arc) {\n  struct __pyx_obj_9pywrapfst_Weight *__pyx_v_weight = 0;\n  struct __pyx_obj_9pywrapfst_Arc *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  __Pyx_RefNannySetupContext(\"_init_Arc\", 0);\n\n  /* \"pywrapfst.pyx\":2960\n * \n * cdef Arc _init_Arc(const fst.ArcClass &arc):\n *   cdef Weight weight = Weight.__new__(Weight)             # <<<<<<<<<<<<<<\n *   weight._weight.reset(new fst.WeightClass(arc.weight))\n *   return Arc(arc.ilabel, arc.olabel, weight, arc.nextstate)\n */\n  __pyx_t_1 = ((PyObject *)__pyx_tp_new_9pywrapfst_Weight(((PyTypeObject *)__pyx_ptype_9pywrapfst_Weight), __pyx_empty_tuple, NULL)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2960, __pyx_L1_error)\n  __Pyx_GOTREF(((PyObject *)__pyx_t_1));\n  __pyx_v_weight = ((struct __pyx_obj_9pywrapfst_Weight *)__pyx_t_1);\n  __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2961\n * cdef Arc _init_Arc(const fst.ArcClass &arc):\n *   cdef Weight weight = Weight.__new__(Weight)\n *   weight._weight.reset(new fst.WeightClass(arc.weight))             # <<<<<<<<<<<<<<\n *   return Arc(arc.ilabel, arc.olabel, weight, arc.nextstate)\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_weight) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_weight\");\n    __PYX_ERR(0, 2961, __pyx_L1_error)\n  }\n  __pyx_v_weight->_weight.reset(new fst::script::WeightClass(__pyx_v_arc.weight));\n\n  /* \"pywrapfst.pyx\":2962\n *   cdef Weight weight = Weight.__new__(Weight)\n *   weight._weight.reset(new fst.WeightClass(arc.weight))\n *   return Arc(arc.ilabel, arc.olabel, weight, arc.nextstate)             # <<<<<<<<<<<<<<\n * \n * \n */\n  __Pyx_XDECREF(((PyObject *)__pyx_r));\n  __pyx_t_1 = __Pyx_PyInt_From_int64_t(__pyx_v_arc.ilabel); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2962, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_t_2 = __Pyx_PyInt_From_int64_t(__pyx_v_arc.olabel); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 2962, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  __pyx_t_3 = __Pyx_PyInt_From_int64_t(__pyx_v_arc.nextstate); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 2962, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_3);\n  __pyx_t_4 = PyTuple_New(4); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 2962, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_4);\n  __Pyx_GIVEREF(__pyx_t_1);\n  PyTuple_SET_ITEM(__pyx_t_4, 0, __pyx_t_1);\n  __Pyx_GIVEREF(__pyx_t_2);\n  PyTuple_SET_ITEM(__pyx_t_4, 1, __pyx_t_2);\n  __Pyx_INCREF(((PyObject *)__pyx_v_weight));\n  __Pyx_GIVEREF(((PyObject *)__pyx_v_weight));\n  PyTuple_SET_ITEM(__pyx_t_4, 2, ((PyObject *)__pyx_v_weight));\n  __Pyx_GIVEREF(__pyx_t_3);\n  PyTuple_SET_ITEM(__pyx_t_4, 3, __pyx_t_3);\n  __pyx_t_1 = 0;\n  __pyx_t_2 = 0;\n  __pyx_t_3 = 0;\n  __pyx_t_3 = __Pyx_PyObject_Call(((PyObject *)__pyx_ptype_9pywrapfst_Arc), __pyx_t_4, NULL); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 2962, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_3);\n  __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n  __pyx_r = ((struct __pyx_obj_9pywrapfst_Arc *)__pyx_t_3);\n  __pyx_t_3 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":2959\n * \n * \n * cdef Arc _init_Arc(const fst.ArcClass &arc):             # <<<<<<<<<<<<<<\n *   cdef Weight weight = Weight.__new__(Weight)\n *   weight._weight.reset(new fst.WeightClass(arc.weight))\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_AddTraceback(\"pywrapfst._init_Arc\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XDECREF((PyObject *)__pyx_v_weight);\n  __Pyx_XGIVEREF((PyObject *)__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":2973\n *   \"\"\"\n * \n *   def __repr__(self):             # <<<<<<<<<<<<<<\n *     return \"<ArcIterator at 0x{:x}>\".format(id(self))\n * \n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_11ArcIterator_1__repr__(PyObject *__pyx_v_self); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_11ArcIterator_1__repr__(PyObject *__pyx_v_self) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__repr__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_11ArcIterator___repr__(((struct __pyx_obj_9pywrapfst_ArcIterator *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_11ArcIterator___repr__(struct __pyx_obj_9pywrapfst_ArcIterator *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  __Pyx_RefNannySetupContext(\"__repr__\", 0);\n\n  /* \"pywrapfst.pyx\":2974\n * \n *   def __repr__(self):\n *     return \"<ArcIterator at 0x{:x}>\".format(id(self))             # <<<<<<<<<<<<<<\n * \n *   def __init__(self, _Fst ifst, int64 state):\n */\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_2 = __Pyx_PyObject_GetAttrStr(__pyx_kp_s_ArcIterator_at_0x_x, __pyx_n_s_format); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 2974, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  __pyx_t_3 = __Pyx_PyObject_CallOneArg(__pyx_builtin_id, ((PyObject *)__pyx_v_self)); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 2974, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_3);\n  __pyx_t_4 = NULL;\n  if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_2))) {\n    __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_2);\n    if (likely(__pyx_t_4)) {\n      PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_2);\n      __Pyx_INCREF(__pyx_t_4);\n      __Pyx_INCREF(function);\n      __Pyx_DECREF_SET(__pyx_t_2, function);\n    }\n  }\n  if (!__pyx_t_4) {\n    __pyx_t_1 = __Pyx_PyObject_CallOneArg(__pyx_t_2, __pyx_t_3); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2974, __pyx_L1_error)\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    __Pyx_GOTREF(__pyx_t_1);\n  } else {\n    #if CYTHON_FAST_PYCALL\n    if (PyFunction_Check(__pyx_t_2)) {\n      PyObject *__pyx_temp[2] = {__pyx_t_4, __pyx_t_3};\n      __pyx_t_1 = __Pyx_PyFunction_FastCall(__pyx_t_2, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2974, __pyx_L1_error)\n      __Pyx_XDECREF(__pyx_t_4); __pyx_t_4 = 0;\n      __Pyx_GOTREF(__pyx_t_1);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    } else\n    #endif\n    #if CYTHON_FAST_PYCCALL\n    if (__Pyx_PyFastCFunction_Check(__pyx_t_2)) {\n      PyObject *__pyx_temp[2] = {__pyx_t_4, __pyx_t_3};\n      __pyx_t_1 = __Pyx_PyCFunction_FastCall(__pyx_t_2, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2974, __pyx_L1_error)\n      __Pyx_XDECREF(__pyx_t_4); __pyx_t_4 = 0;\n      __Pyx_GOTREF(__pyx_t_1);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    } else\n    #endif\n    {\n      __pyx_t_5 = PyTuple_New(1+1); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 2974, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_5);\n      __Pyx_GIVEREF(__pyx_t_4); PyTuple_SET_ITEM(__pyx_t_5, 0, __pyx_t_4); __pyx_t_4 = NULL;\n      __Pyx_GIVEREF(__pyx_t_3);\n      PyTuple_SET_ITEM(__pyx_t_5, 0+1, __pyx_t_3);\n      __pyx_t_3 = 0;\n      __pyx_t_1 = __Pyx_PyObject_Call(__pyx_t_2, __pyx_t_5, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2974, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_1);\n      __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n    }\n  }\n  __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":2973\n *   \"\"\"\n * \n *   def __repr__(self):             # <<<<<<<<<<<<<<\n *     return \"<ArcIterator at 0x{:x}>\".format(id(self))\n * \n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_AddTraceback(\"pywrapfst.ArcIterator.__repr__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":2976\n *     return \"<ArcIterator at 0x{:x}>\".format(id(self))\n * \n *   def __init__(self, _Fst ifst, int64 state):             # <<<<<<<<<<<<<<\n *     if not ifst._fst.get().ValidStateId(state):\n *       raise FstIndexError(\"State index out of range\")\n */\n\n/* Python wrapper */\nstatic int __pyx_pw_9pywrapfst_11ArcIterator_3__init__(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic int __pyx_pw_9pywrapfst_11ArcIterator_3__init__(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst = 0;\n  __pyx_t_10basictypes_int64 __pyx_v_state;\n  int __pyx_r;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__init__ (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_ifst,&__pyx_n_s_state,0};\n    PyObject* values[2] = {0,0};\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (likely((values[0] = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_ifst)) != 0)) kw_args--;\n        else goto __pyx_L5_argtuple_error;\n        CYTHON_FALLTHROUGH;\n        case  1:\n        if (likely((values[1] = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_state)) != 0)) kw_args--;\n        else {\n          __Pyx_RaiseArgtupleInvalid(\"__init__\", 1, 2, 2, 1); __PYX_ERR(0, 2976, __pyx_L3_error)\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"__init__\") < 0)) __PYX_ERR(0, 2976, __pyx_L3_error)\n      }\n    } else if (PyTuple_GET_SIZE(__pyx_args) != 2) {\n      goto __pyx_L5_argtuple_error;\n    } else {\n      values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n      values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n    }\n    __pyx_v_ifst = ((struct __pyx_obj_9pywrapfst__Fst *)values[0]);\n    __pyx_v_state = __Pyx_PyInt_As_int64_t(values[1]); if (unlikely((__pyx_v_state == ((int64_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 2976, __pyx_L3_error)\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"__init__\", 1, 2, 2, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 2976, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst.ArcIterator.__init__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return -1;\n  __pyx_L4_argument_unpacking_done:;\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_ifst), __pyx_ptype_9pywrapfst__Fst, 1, \"ifst\", 0))) __PYX_ERR(0, 2976, __pyx_L1_error)\n  __pyx_r = __pyx_pf_9pywrapfst_11ArcIterator_2__init__(((struct __pyx_obj_9pywrapfst_ArcIterator *)__pyx_v_self), __pyx_v_ifst, __pyx_v_state);\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __pyx_r = -1;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic int __pyx_pf_9pywrapfst_11ArcIterator_2__init__(struct __pyx_obj_9pywrapfst_ArcIterator *__pyx_v_self, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst, __pyx_t_10basictypes_int64 __pyx_v_state) {\n  int __pyx_r;\n  __Pyx_RefNannyDeclarations\n  int __pyx_t_1;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  std::shared_ptr<fst::script::FstClass>  __pyx_t_4;\n  __Pyx_RefNannySetupContext(\"__init__\", 0);\n\n  /* \"pywrapfst.pyx\":2977\n * \n *   def __init__(self, _Fst ifst, int64 state):\n *     if not ifst._fst.get().ValidStateId(state):             # <<<<<<<<<<<<<<\n *       raise FstIndexError(\"State index out of range\")\n *     # Makes copy of the shared_ptr, potentially extending the FST's lifetime.\n */\n  if (unlikely(((PyObject *)__pyx_v_ifst) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 2977, __pyx_L1_error)\n  }\n  __pyx_t_1 = ((!(__pyx_v_ifst->_fst.get()->ValidStateId(__pyx_v_state) != 0)) != 0);\n  if (unlikely(__pyx_t_1)) {\n\n    /* \"pywrapfst.pyx\":2978\n *   def __init__(self, _Fst ifst, int64 state):\n *     if not ifst._fst.get().ValidStateId(state):\n *       raise FstIndexError(\"State index out of range\")             # <<<<<<<<<<<<<<\n *     # Makes copy of the shared_ptr, potentially extending the FST's lifetime.\n *     self._fst = ifst._fst\n */\n    __pyx_t_2 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstIndexError); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 2978, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_2);\n    __pyx_t_3 = __Pyx_PyObject_Call(__pyx_t_2, __pyx_tuple__59, NULL); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 2978, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_3);\n    __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n    __Pyx_Raise(__pyx_t_3, 0, 0, 0);\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    __PYX_ERR(0, 2978, __pyx_L1_error)\n\n    /* \"pywrapfst.pyx\":2977\n * \n *   def __init__(self, _Fst ifst, int64 state):\n *     if not ifst._fst.get().ValidStateId(state):             # <<<<<<<<<<<<<<\n *       raise FstIndexError(\"State index out of range\")\n *     # Makes copy of the shared_ptr, potentially extending the FST's lifetime.\n */\n  }\n\n  /* \"pywrapfst.pyx\":2980\n *       raise FstIndexError(\"State index out of range\")\n *     # Makes copy of the shared_ptr, potentially extending the FST's lifetime.\n *     self._fst = ifst._fst             # <<<<<<<<<<<<<<\n *     self._aiter.reset(new fst.ArcIteratorClass(deref(self._fst), state))\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_ifst) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 2980, __pyx_L1_error)\n  }\n  __pyx_t_4 = __pyx_v_ifst->_fst;\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 2980, __pyx_L1_error)\n  }\n  __pyx_v_self->_fst = __pyx_t_4;\n\n  /* \"pywrapfst.pyx\":2981\n *     # Makes copy of the shared_ptr, potentially extending the FST's lifetime.\n *     self._fst = ifst._fst\n *     self._aiter.reset(new fst.ArcIteratorClass(deref(self._fst), state))             # <<<<<<<<<<<<<<\n * \n *   # This just registers this class as a possible iterator.\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_aiter\");\n    __PYX_ERR(0, 2981, __pyx_L1_error)\n  }\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 2981, __pyx_L1_error)\n  }\n  __pyx_v_self->_aiter.reset(new fst::script::ArcIteratorClass((*__pyx_v_self->_fst), __pyx_v_state));\n\n  /* \"pywrapfst.pyx\":2976\n *     return \"<ArcIterator at 0x{:x}>\".format(id(self))\n * \n *   def __init__(self, _Fst ifst, int64 state):             # <<<<<<<<<<<<<<\n *     if not ifst._fst.get().ValidStateId(state):\n *       raise FstIndexError(\"State index out of range\")\n */\n\n  /* function exit code */\n  __pyx_r = 0;\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_AddTraceback(\"pywrapfst.ArcIterator.__init__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = -1;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":2984\n * \n *   # This just registers this class as a possible iterator.\n *   def __iter__(self):             # <<<<<<<<<<<<<<\n *     return self\n * \n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_11ArcIterator_5__iter__(PyObject *__pyx_v_self); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_11ArcIterator_5__iter__(PyObject *__pyx_v_self) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__iter__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_11ArcIterator_4__iter__(((struct __pyx_obj_9pywrapfst_ArcIterator *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_11ArcIterator_4__iter__(struct __pyx_obj_9pywrapfst_ArcIterator *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__iter__\", 0);\n\n  /* \"pywrapfst.pyx\":2985\n *   # This just registers this class as a possible iterator.\n *   def __iter__(self):\n *     return self             # <<<<<<<<<<<<<<\n * \n *   # Magic method used to get a Pythonic API out of the C++ API.\n */\n  __Pyx_XDECREF(__pyx_r);\n  __Pyx_INCREF(((PyObject *)__pyx_v_self));\n  __pyx_r = ((PyObject *)__pyx_v_self);\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":2984\n * \n *   # This just registers this class as a possible iterator.\n *   def __iter__(self):             # <<<<<<<<<<<<<<\n *     return self\n * \n */\n\n  /* function exit code */\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":2988\n * \n *   # Magic method used to get a Pythonic API out of the C++ API.\n *   def __next__(self):             # <<<<<<<<<<<<<<\n *     if self.done():\n *       raise StopIteration\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_11ArcIterator_7__next__(PyObject *__pyx_v_self); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_11ArcIterator_7__next__(PyObject *__pyx_v_self) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__next__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_11ArcIterator_6__next__(((struct __pyx_obj_9pywrapfst_ArcIterator *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_11ArcIterator_6__next__(struct __pyx_obj_9pywrapfst_ArcIterator *__pyx_v_self) {\n  PyObject *__pyx_v_result = NULL;\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  int __pyx_t_1;\n  PyObject *__pyx_t_2 = NULL;\n  __Pyx_RefNannySetupContext(\"__next__\", 0);\n\n  /* \"pywrapfst.pyx\":2989\n *   # Magic method used to get a Pythonic API out of the C++ API.\n *   def __next__(self):\n *     if self.done():             # <<<<<<<<<<<<<<\n *       raise StopIteration\n *     result = self.value()\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"done\");\n    __PYX_ERR(0, 2989, __pyx_L1_error)\n  }\n  __pyx_t_1 = (((struct __pyx_vtabstruct_9pywrapfst_ArcIterator *)__pyx_v_self->__pyx_vtab)->done(__pyx_v_self, 0) != 0);\n  if (unlikely(__pyx_t_1)) {\n\n    /* \"pywrapfst.pyx\":2990\n *   def __next__(self):\n *     if self.done():\n *       raise StopIteration             # <<<<<<<<<<<<<<\n *     result = self.value()\n *     self.next()\n */\n    __Pyx_Raise(__pyx_builtin_StopIteration, 0, 0, 0);\n    __PYX_ERR(0, 2990, __pyx_L1_error)\n\n    /* \"pywrapfst.pyx\":2989\n *   # Magic method used to get a Pythonic API out of the C++ API.\n *   def __next__(self):\n *     if self.done():             # <<<<<<<<<<<<<<\n *       raise StopIteration\n *     result = self.value()\n */\n  }\n\n  /* \"pywrapfst.pyx\":2991\n *     if self.done():\n *       raise StopIteration\n *     result = self.value()             # <<<<<<<<<<<<<<\n *     self.next()\n *     return result\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"value\");\n    __PYX_ERR(0, 2991, __pyx_L1_error)\n  }\n  __pyx_t_2 = ((struct __pyx_vtabstruct_9pywrapfst_ArcIterator *)__pyx_v_self->__pyx_vtab)->value(__pyx_v_self, 0); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 2991, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  __pyx_v_result = __pyx_t_2;\n  __pyx_t_2 = 0;\n\n  /* \"pywrapfst.pyx\":2992\n *       raise StopIteration\n *     result = self.value()\n *     self.next()             # <<<<<<<<<<<<<<\n *     return result\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"next\");\n    __PYX_ERR(0, 2992, __pyx_L1_error)\n  }\n  ((struct __pyx_vtabstruct_9pywrapfst_ArcIterator *)__pyx_v_self->__pyx_vtab)->next(__pyx_v_self, 0);\n\n  /* \"pywrapfst.pyx\":2993\n *     result = self.value()\n *     self.next()\n *     return result             # <<<<<<<<<<<<<<\n * \n *   cpdef bool done(self):\n */\n  __Pyx_XDECREF(__pyx_r);\n  __Pyx_INCREF(__pyx_v_result);\n  __pyx_r = __pyx_v_result;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":2988\n * \n *   # Magic method used to get a Pythonic API out of the C++ API.\n *   def __next__(self):             # <<<<<<<<<<<<<<\n *     if self.done():\n *       raise StopIteration\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_AddTraceback(\"pywrapfst.ArcIterator.__next__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XDECREF(__pyx_v_result);\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":2995\n *     return result\n * \n *   cpdef bool done(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     done(self)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_11ArcIterator_9done(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic bool __pyx_f_9pywrapfst_11ArcIterator_done(struct __pyx_obj_9pywrapfst_ArcIterator *__pyx_v_self, int __pyx_skip_dispatch) {\n  bool __pyx_r;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  bool __pyx_t_5;\n  __Pyx_RefNannySetupContext(\"done\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_done); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2995, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_11ArcIterator_9done)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 2995, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 2995, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __pyx_t_5 = __Pyx_PyObject_IsTrue(__pyx_t_2); if (unlikely((__pyx_t_5 == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 2995, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __pyx_r = __pyx_t_5;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":3004\n *       True if the iterator is exhausted, False otherwise.\n *     \"\"\"\n *     return self._aiter.get().Done()             # <<<<<<<<<<<<<<\n * \n *   cpdef uint32 flags(self):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_aiter\");\n    __PYX_ERR(0, 3004, __pyx_L1_error)\n  }\n  __pyx_r = __pyx_v_self->_aiter.get()->Done();\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":2995\n *     return result\n * \n *   cpdef bool done(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     done(self)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_WriteUnraisable(\"pywrapfst.ArcIterator.done\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_11ArcIterator_9done(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_11ArcIterator_8done[] = \"\\n    done(self)\\n\\n    Indicates whether the iterator is exhausted or not.\\n\\n    Returns:\\n      True if the iterator is exhausted, False otherwise.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_11ArcIterator_9done(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"done (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_11ArcIterator_8done(((struct __pyx_obj_9pywrapfst_ArcIterator *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_11ArcIterator_8done(struct __pyx_obj_9pywrapfst_ArcIterator *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"done\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __Pyx_PyBool_FromLong(__pyx_f_9pywrapfst_11ArcIterator_done(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2995, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.ArcIterator.done\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":3006\n *     return self._aiter.get().Done()\n * \n *   cpdef uint32 flags(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     flags(self)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_11ArcIterator_11flags(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic __pyx_t_10basictypes_uint32 __pyx_f_9pywrapfst_11ArcIterator_flags(struct __pyx_obj_9pywrapfst_ArcIterator *__pyx_v_self, int __pyx_skip_dispatch) {\n  __pyx_t_10basictypes_uint32 __pyx_r;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  __pyx_t_10basictypes_uint32 __pyx_t_5;\n  __Pyx_RefNannySetupContext(\"flags\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_flags); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3006, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_11ArcIterator_11flags)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3006, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3006, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __pyx_t_5 = __Pyx_PyInt_As_uint32_t(__pyx_t_2); if (unlikely((__pyx_t_5 == ((uint32_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 3006, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __pyx_r = __pyx_t_5;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":3015\n *       The current iterator behavioral flags as an integer.\n *     \"\"\"\n *     return self._aiter.get().Flags()             # <<<<<<<<<<<<<<\n * \n *   cpdef void next(self):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_aiter\");\n    __PYX_ERR(0, 3015, __pyx_L1_error)\n  }\n  __pyx_r = __pyx_v_self->_aiter.get()->Flags();\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":3006\n *     return self._aiter.get().Done()\n * \n *   cpdef uint32 flags(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     flags(self)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_WriteUnraisable(\"pywrapfst.ArcIterator.flags\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_11ArcIterator_11flags(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_11ArcIterator_10flags[] = \"\\n    flags(self)\\n\\n    Returns the current iterator behavioral flags.\\n\\n    Returns:\\n      The current iterator behavioral flags as an integer.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_11ArcIterator_11flags(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"flags (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_11ArcIterator_10flags(((struct __pyx_obj_9pywrapfst_ArcIterator *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_11ArcIterator_10flags(struct __pyx_obj_9pywrapfst_ArcIterator *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"flags\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __Pyx_PyInt_From_uint32_t(__pyx_f_9pywrapfst_11ArcIterator_flags(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3006, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.ArcIterator.flags\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":3017\n *     return self._aiter.get().Flags()\n * \n *   cpdef void next(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     next(self)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_11ArcIterator_13next(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic void __pyx_f_9pywrapfst_11ArcIterator_next(struct __pyx_obj_9pywrapfst_ArcIterator *__pyx_v_self, int __pyx_skip_dispatch) {\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  __Pyx_RefNannySetupContext(\"next\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_next); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3017, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_11ArcIterator_13next)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3017, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3017, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":3023\n *     Advances the iterator.\n *     \"\"\"\n *     self._aiter.get().Next()             # <<<<<<<<<<<<<<\n * \n *   cpdef size_t position(self):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_aiter\");\n    __PYX_ERR(0, 3023, __pyx_L1_error)\n  }\n  __pyx_v_self->_aiter.get()->Next();\n\n  /* \"pywrapfst.pyx\":3017\n *     return self._aiter.get().Flags()\n * \n *   cpdef void next(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     next(self)\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_WriteUnraisable(\"pywrapfst.ArcIterator.next\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_11ArcIterator_13next(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_11ArcIterator_12next[] = \"\\n    next(self)\\n\\n    Advances the iterator.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_11ArcIterator_13next(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"next (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_11ArcIterator_12next(((struct __pyx_obj_9pywrapfst_ArcIterator *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_11ArcIterator_12next(struct __pyx_obj_9pywrapfst_ArcIterator *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"next\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __Pyx_void_to_None(__pyx_f_9pywrapfst_11ArcIterator_next(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3017, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.ArcIterator.next\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":3025\n *     self._aiter.get().Next()\n * \n *   cpdef size_t position(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     position(self)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_11ArcIterator_15position(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic size_t __pyx_f_9pywrapfst_11ArcIterator_position(struct __pyx_obj_9pywrapfst_ArcIterator *__pyx_v_self, int __pyx_skip_dispatch) {\n  size_t __pyx_r;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  size_t __pyx_t_5;\n  __Pyx_RefNannySetupContext(\"position\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_position); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3025, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_11ArcIterator_15position)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3025, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3025, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __pyx_t_5 = __Pyx_PyInt_As_size_t(__pyx_t_2); if (unlikely((__pyx_t_5 == (size_t)-1) && PyErr_Occurred())) __PYX_ERR(0, 3025, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __pyx_r = __pyx_t_5;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":3034\n *       The iterator's position, expressed as an integer.\n *     \"\"\"\n *     return self._aiter.get().Position()             # <<<<<<<<<<<<<<\n * \n *   cpdef void reset(self):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_aiter\");\n    __PYX_ERR(0, 3034, __pyx_L1_error)\n  }\n  __pyx_r = __pyx_v_self->_aiter.get()->Position();\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":3025\n *     self._aiter.get().Next()\n * \n *   cpdef size_t position(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     position(self)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_WriteUnraisable(\"pywrapfst.ArcIterator.position\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_11ArcIterator_15position(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_11ArcIterator_14position[] = \"\\n    position(self)\\n\\n    Returns the position of the iterator.\\n\\n    Returns:\\n      The iterator's position, expressed as an integer.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_11ArcIterator_15position(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"position (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_11ArcIterator_14position(((struct __pyx_obj_9pywrapfst_ArcIterator *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_11ArcIterator_14position(struct __pyx_obj_9pywrapfst_ArcIterator *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"position\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __Pyx_PyInt_FromSize_t(__pyx_f_9pywrapfst_11ArcIterator_position(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3025, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.ArcIterator.position\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":3036\n *     return self._aiter.get().Position()\n * \n *   cpdef void reset(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     reset(self)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_11ArcIterator_17reset(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic void __pyx_f_9pywrapfst_11ArcIterator_reset(struct __pyx_obj_9pywrapfst_ArcIterator *__pyx_v_self, int __pyx_skip_dispatch) {\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  __Pyx_RefNannySetupContext(\"reset\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_reset); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3036, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_11ArcIterator_17reset)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3036, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3036, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":3042\n *     Resets the iterator to the initial position.\n *     \"\"\"\n *     self._aiter.get().Reset()             # <<<<<<<<<<<<<<\n * \n *   cpdef void seek(self, size_t a):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_aiter\");\n    __PYX_ERR(0, 3042, __pyx_L1_error)\n  }\n  __pyx_v_self->_aiter.get()->Reset();\n\n  /* \"pywrapfst.pyx\":3036\n *     return self._aiter.get().Position()\n * \n *   cpdef void reset(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     reset(self)\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_WriteUnraisable(\"pywrapfst.ArcIterator.reset\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_11ArcIterator_17reset(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_11ArcIterator_16reset[] = \"\\n    reset(self)\\n\\n    Resets the iterator to the initial position.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_11ArcIterator_17reset(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"reset (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_11ArcIterator_16reset(((struct __pyx_obj_9pywrapfst_ArcIterator *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_11ArcIterator_16reset(struct __pyx_obj_9pywrapfst_ArcIterator *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"reset\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __Pyx_void_to_None(__pyx_f_9pywrapfst_11ArcIterator_reset(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3036, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.ArcIterator.reset\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":3044\n *     self._aiter.get().Reset()\n * \n *   cpdef void seek(self, size_t a):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     seek(self, a)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_11ArcIterator_19seek(PyObject *__pyx_v_self, PyObject *__pyx_arg_a); /*proto*/\nstatic void __pyx_f_9pywrapfst_11ArcIterator_seek(struct __pyx_obj_9pywrapfst_ArcIterator *__pyx_v_self, size_t __pyx_v_a, int __pyx_skip_dispatch) {\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  PyObject *__pyx_t_6 = NULL;\n  __Pyx_RefNannySetupContext(\"seek\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_seek); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3044, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_11ArcIterator_19seek)) {\n      __pyx_t_3 = __Pyx_PyInt_FromSize_t(__pyx_v_a); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 3044, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_3);\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_4 = __pyx_t_1; __pyx_t_5 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_4))) {\n        __pyx_t_5 = PyMethod_GET_SELF(__pyx_t_4);\n        if (likely(__pyx_t_5)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_4);\n          __Pyx_INCREF(__pyx_t_5);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_4, function);\n        }\n      }\n      if (!__pyx_t_5) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_4, __pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3044, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n        __Pyx_GOTREF(__pyx_t_2);\n      } else {\n        #if CYTHON_FAST_PYCALL\n        if (PyFunction_Check(__pyx_t_4)) {\n          PyObject *__pyx_temp[2] = {__pyx_t_5, __pyx_t_3};\n          __pyx_t_2 = __Pyx_PyFunction_FastCall(__pyx_t_4, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3044, __pyx_L1_error)\n          __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;\n          __Pyx_GOTREF(__pyx_t_2);\n          __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n        } else\n        #endif\n        #if CYTHON_FAST_PYCCALL\n        if (__Pyx_PyFastCFunction_Check(__pyx_t_4)) {\n          PyObject *__pyx_temp[2] = {__pyx_t_5, __pyx_t_3};\n          __pyx_t_2 = __Pyx_PyCFunction_FastCall(__pyx_t_4, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3044, __pyx_L1_error)\n          __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;\n          __Pyx_GOTREF(__pyx_t_2);\n          __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n        } else\n        #endif\n        {\n          __pyx_t_6 = PyTuple_New(1+1); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 3044, __pyx_L1_error)\n          __Pyx_GOTREF(__pyx_t_6);\n          __Pyx_GIVEREF(__pyx_t_5); PyTuple_SET_ITEM(__pyx_t_6, 0, __pyx_t_5); __pyx_t_5 = NULL;\n          __Pyx_GIVEREF(__pyx_t_3);\n          PyTuple_SET_ITEM(__pyx_t_6, 0+1, __pyx_t_3);\n          __pyx_t_3 = 0;\n          __pyx_t_2 = __Pyx_PyObject_Call(__pyx_t_4, __pyx_t_6, NULL); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3044, __pyx_L1_error)\n          __Pyx_GOTREF(__pyx_t_2);\n          __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n        }\n      }\n      __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":3053\n *       a: The position to seek to.\n *     \"\"\"\n *     self._aiter.get().Seek(a)             # <<<<<<<<<<<<<<\n * \n *   cpdef void set_flags(self, uint32 flags, uint32 mask):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_aiter\");\n    __PYX_ERR(0, 3053, __pyx_L1_error)\n  }\n  __pyx_v_self->_aiter.get()->Seek(__pyx_v_a);\n\n  /* \"pywrapfst.pyx\":3044\n *     self._aiter.get().Reset()\n * \n *   cpdef void seek(self, size_t a):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     seek(self, a)\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_XDECREF(__pyx_t_6);\n  __Pyx_WriteUnraisable(\"pywrapfst.ArcIterator.seek\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_11ArcIterator_19seek(PyObject *__pyx_v_self, PyObject *__pyx_arg_a); /*proto*/\nstatic char __pyx_doc_9pywrapfst_11ArcIterator_18seek[] = \"\\n    seek(self, a)\\n\\n    Advance the iterator to a new position.\\n\\n    Args:\\n      a: The position to seek to.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_11ArcIterator_19seek(PyObject *__pyx_v_self, PyObject *__pyx_arg_a) {\n  size_t __pyx_v_a;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"seek (wrapper)\", 0);\n  assert(__pyx_arg_a); {\n    __pyx_v_a = __Pyx_PyInt_As_size_t(__pyx_arg_a); if (unlikely((__pyx_v_a == (size_t)-1) && PyErr_Occurred())) __PYX_ERR(0, 3044, __pyx_L3_error)\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst.ArcIterator.seek\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  __pyx_r = __pyx_pf_9pywrapfst_11ArcIterator_18seek(((struct __pyx_obj_9pywrapfst_ArcIterator *)__pyx_v_self), ((size_t)__pyx_v_a));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_11ArcIterator_18seek(struct __pyx_obj_9pywrapfst_ArcIterator *__pyx_v_self, size_t __pyx_v_a) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"seek\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __Pyx_void_to_None(__pyx_f_9pywrapfst_11ArcIterator_seek(__pyx_v_self, __pyx_v_a, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3044, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.ArcIterator.seek\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":3055\n *     self._aiter.get().Seek(a)\n * \n *   cpdef void set_flags(self, uint32 flags, uint32 mask):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     set_flags(self, flags, mask)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_11ArcIterator_21set_flags(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic void __pyx_f_9pywrapfst_11ArcIterator_set_flags(struct __pyx_obj_9pywrapfst_ArcIterator *__pyx_v_self, __pyx_t_10basictypes_uint32 __pyx_v_flags, __pyx_t_10basictypes_uint32 __pyx_v_mask, int __pyx_skip_dispatch) {\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  PyObject *__pyx_t_6 = NULL;\n  int __pyx_t_7;\n  PyObject *__pyx_t_8 = NULL;\n  __Pyx_RefNannySetupContext(\"set_flags\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_set_flags); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3055, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_11ArcIterator_21set_flags)) {\n      __pyx_t_3 = __Pyx_PyInt_From_uint32_t(__pyx_v_flags); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 3055, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_3);\n      __pyx_t_4 = __Pyx_PyInt_From_uint32_t(__pyx_v_mask); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 3055, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_4);\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_5 = __pyx_t_1; __pyx_t_6 = NULL;\n      __pyx_t_7 = 0;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_5))) {\n        __pyx_t_6 = PyMethod_GET_SELF(__pyx_t_5);\n        if (likely(__pyx_t_6)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_5);\n          __Pyx_INCREF(__pyx_t_6);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_5, function);\n          __pyx_t_7 = 1;\n        }\n      }\n      #if CYTHON_FAST_PYCALL\n      if (PyFunction_Check(__pyx_t_5)) {\n        PyObject *__pyx_temp[3] = {__pyx_t_6, __pyx_t_3, __pyx_t_4};\n        __pyx_t_2 = __Pyx_PyFunction_FastCall(__pyx_t_5, __pyx_temp+1-__pyx_t_7, 2+__pyx_t_7); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3055, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_6); __pyx_t_6 = 0;\n        __Pyx_GOTREF(__pyx_t_2);\n        __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else\n      #endif\n      #if CYTHON_FAST_PYCCALL\n      if (__Pyx_PyFastCFunction_Check(__pyx_t_5)) {\n        PyObject *__pyx_temp[3] = {__pyx_t_6, __pyx_t_3, __pyx_t_4};\n        __pyx_t_2 = __Pyx_PyCFunction_FastCall(__pyx_t_5, __pyx_temp+1-__pyx_t_7, 2+__pyx_t_7); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3055, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_6); __pyx_t_6 = 0;\n        __Pyx_GOTREF(__pyx_t_2);\n        __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else\n      #endif\n      {\n        __pyx_t_8 = PyTuple_New(2+__pyx_t_7); if (unlikely(!__pyx_t_8)) __PYX_ERR(0, 3055, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_8);\n        if (__pyx_t_6) {\n          __Pyx_GIVEREF(__pyx_t_6); PyTuple_SET_ITEM(__pyx_t_8, 0, __pyx_t_6); __pyx_t_6 = NULL;\n        }\n        __Pyx_GIVEREF(__pyx_t_3);\n        PyTuple_SET_ITEM(__pyx_t_8, 0+__pyx_t_7, __pyx_t_3);\n        __Pyx_GIVEREF(__pyx_t_4);\n        PyTuple_SET_ITEM(__pyx_t_8, 1+__pyx_t_7, __pyx_t_4);\n        __pyx_t_3 = 0;\n        __pyx_t_4 = 0;\n        __pyx_t_2 = __Pyx_PyObject_Call(__pyx_t_5, __pyx_t_8, NULL); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3055, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_2);\n        __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0;\n      }\n      __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":3065\n *       mask: A mask to be applied to the `flags` argument before setting them.\n *     \"\"\"\n *     self._aiter.get().SetFlags(flags, mask)             # <<<<<<<<<<<<<<\n * \n *   cpdef object value(self):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_aiter\");\n    __PYX_ERR(0, 3065, __pyx_L1_error)\n  }\n  __pyx_v_self->_aiter.get()->SetFlags(__pyx_v_flags, __pyx_v_mask);\n\n  /* \"pywrapfst.pyx\":3055\n *     self._aiter.get().Seek(a)\n * \n *   cpdef void set_flags(self, uint32 flags, uint32 mask):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     set_flags(self, flags, mask)\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_XDECREF(__pyx_t_6);\n  __Pyx_XDECREF(__pyx_t_8);\n  __Pyx_WriteUnraisable(\"pywrapfst.ArcIterator.set_flags\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_11ArcIterator_21set_flags(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic char __pyx_doc_9pywrapfst_11ArcIterator_20set_flags[] = \"\\n    set_flags(self, flags, mask)\\n\\n    Sets the current iterator behavioral flags.\\n\\n    Args:\\n      flags: The properties to be set.\\n      mask: A mask to be applied to the `flags` argument before setting them.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_11ArcIterator_21set_flags(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  __pyx_t_10basictypes_uint32 __pyx_v_flags;\n  __pyx_t_10basictypes_uint32 __pyx_v_mask;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"set_flags (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_flags,&__pyx_n_s_mask,0};\n    PyObject* values[2] = {0,0};\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (likely((values[0] = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_flags)) != 0)) kw_args--;\n        else goto __pyx_L5_argtuple_error;\n        CYTHON_FALLTHROUGH;\n        case  1:\n        if (likely((values[1] = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_mask)) != 0)) kw_args--;\n        else {\n          __Pyx_RaiseArgtupleInvalid(\"set_flags\", 1, 2, 2, 1); __PYX_ERR(0, 3055, __pyx_L3_error)\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"set_flags\") < 0)) __PYX_ERR(0, 3055, __pyx_L3_error)\n      }\n    } else if (PyTuple_GET_SIZE(__pyx_args) != 2) {\n      goto __pyx_L5_argtuple_error;\n    } else {\n      values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n      values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n    }\n    __pyx_v_flags = __Pyx_PyInt_As_uint32_t(values[0]); if (unlikely((__pyx_v_flags == ((uint32_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 3055, __pyx_L3_error)\n    __pyx_v_mask = __Pyx_PyInt_As_uint32_t(values[1]); if (unlikely((__pyx_v_mask == ((uint32_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 3055, __pyx_L3_error)\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"set_flags\", 1, 2, 2, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 3055, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst.ArcIterator.set_flags\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  __pyx_r = __pyx_pf_9pywrapfst_11ArcIterator_20set_flags(((struct __pyx_obj_9pywrapfst_ArcIterator *)__pyx_v_self), __pyx_v_flags, __pyx_v_mask);\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_11ArcIterator_20set_flags(struct __pyx_obj_9pywrapfst_ArcIterator *__pyx_v_self, __pyx_t_10basictypes_uint32 __pyx_v_flags, __pyx_t_10basictypes_uint32 __pyx_v_mask) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"set_flags\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __Pyx_void_to_None(__pyx_f_9pywrapfst_11ArcIterator_set_flags(__pyx_v_self, __pyx_v_flags, __pyx_v_mask, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3055, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.ArcIterator.set_flags\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":3067\n *     self._aiter.get().SetFlags(flags, mask)\n * \n *   cpdef object value(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     value(self)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_11ArcIterator_23value(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic PyObject *__pyx_f_9pywrapfst_11ArcIterator_value(struct __pyx_obj_9pywrapfst_ArcIterator *__pyx_v_self, int __pyx_skip_dispatch) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  __Pyx_RefNannySetupContext(\"value\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_value); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3067, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_11ArcIterator_23value)) {\n      __Pyx_XDECREF(__pyx_r);\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3067, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3067, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __pyx_r = __pyx_t_2;\n      __pyx_t_2 = 0;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":3073\n *     Returns the current arc.\n *     \"\"\"\n *     return _init_Arc(self._aiter.get().Value())             # <<<<<<<<<<<<<<\n * \n * \n */\n  __Pyx_XDECREF(__pyx_r);\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_aiter\");\n    __PYX_ERR(0, 3073, __pyx_L1_error)\n  }\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst__init_Arc(__pyx_v_self->_aiter.get()->Value())); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3073, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":3067\n *     self._aiter.get().SetFlags(flags, mask)\n * \n *   cpdef object value(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     value(self)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_AddTraceback(\"pywrapfst.ArcIterator.value\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_11ArcIterator_23value(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_11ArcIterator_22value[] = \"\\n    value(self)\\n\\n    Returns the current arc.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_11ArcIterator_23value(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"value (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_11ArcIterator_22value(((struct __pyx_obj_9pywrapfst_ArcIterator *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_11ArcIterator_22value(struct __pyx_obj_9pywrapfst_ArcIterator *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"value\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __pyx_f_9pywrapfst_11ArcIterator_value(__pyx_v_self, 1); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3067, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.ArcIterator.value\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"(tree fragment)\":1\n * def __reduce_cython__(self):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._aiter,self._fst cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_11ArcIterator_25__reduce_cython__(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_11ArcIterator_25__reduce_cython__(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__reduce_cython__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_11ArcIterator_24__reduce_cython__(((struct __pyx_obj_9pywrapfst_ArcIterator *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_11ArcIterator_24__reduce_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst_ArcIterator *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"__reduce_cython__\", 0);\n\n  /* \"(tree fragment)\":2\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._aiter,self._fst cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._aiter,self._fst cannot be converted to a Python object for pickling\")\n */\n  __pyx_t_1 = __Pyx_PyObject_Call(__pyx_builtin_TypeError, __pyx_tuple__60, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(1, 2, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __Pyx_Raise(__pyx_t_1, 0, 0, 0);\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  __PYX_ERR(1, 2, __pyx_L1_error)\n\n  /* \"(tree fragment)\":1\n * def __reduce_cython__(self):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._aiter,self._fst cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.ArcIterator.__reduce_cython__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"(tree fragment)\":3\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._aiter,self._fst cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._aiter,self._fst cannot be converted to a Python object for pickling\")\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_11ArcIterator_27__setstate_cython__(PyObject *__pyx_v_self, PyObject *__pyx_v___pyx_state); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_11ArcIterator_27__setstate_cython__(PyObject *__pyx_v_self, PyObject *__pyx_v___pyx_state) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__setstate_cython__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_11ArcIterator_26__setstate_cython__(((struct __pyx_obj_9pywrapfst_ArcIterator *)__pyx_v_self), ((PyObject *)__pyx_v___pyx_state));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_11ArcIterator_26__setstate_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst_ArcIterator *__pyx_v_self, CYTHON_UNUSED PyObject *__pyx_v___pyx_state) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"__setstate_cython__\", 0);\n\n  /* \"(tree fragment)\":4\n *     raise TypeError(\"self._aiter,self._fst cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._aiter,self._fst cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n */\n  __pyx_t_1 = __Pyx_PyObject_Call(__pyx_builtin_TypeError, __pyx_tuple__61, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(1, 4, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __Pyx_Raise(__pyx_t_1, 0, 0, 0);\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  __PYX_ERR(1, 4, __pyx_L1_error)\n\n  /* \"(tree fragment)\":3\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._aiter,self._fst cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._aiter,self._fst cannot be converted to a Python object for pickling\")\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.ArcIterator.__setstate_cython__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":3085\n *   \"\"\"\n * \n *   def __repr__(self):             # <<<<<<<<<<<<<<\n *     return \"<MutableArcIterator at 0x{:x}>\".format(id(self))\n * \n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_18MutableArcIterator_1__repr__(PyObject *__pyx_v_self); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_18MutableArcIterator_1__repr__(PyObject *__pyx_v_self) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__repr__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_18MutableArcIterator___repr__(((struct __pyx_obj_9pywrapfst_MutableArcIterator *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_18MutableArcIterator___repr__(struct __pyx_obj_9pywrapfst_MutableArcIterator *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  __Pyx_RefNannySetupContext(\"__repr__\", 0);\n\n  /* \"pywrapfst.pyx\":3086\n * \n *   def __repr__(self):\n *     return \"<MutableArcIterator at 0x{:x}>\".format(id(self))             # <<<<<<<<<<<<<<\n * \n *   def __init__(self, _MutableFst ifst, int64 state):\n */\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_2 = __Pyx_PyObject_GetAttrStr(__pyx_kp_s_MutableArcIterator_at_0x_x, __pyx_n_s_format); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3086, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  __pyx_t_3 = __Pyx_PyObject_CallOneArg(__pyx_builtin_id, ((PyObject *)__pyx_v_self)); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 3086, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_3);\n  __pyx_t_4 = NULL;\n  if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_2))) {\n    __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_2);\n    if (likely(__pyx_t_4)) {\n      PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_2);\n      __Pyx_INCREF(__pyx_t_4);\n      __Pyx_INCREF(function);\n      __Pyx_DECREF_SET(__pyx_t_2, function);\n    }\n  }\n  if (!__pyx_t_4) {\n    __pyx_t_1 = __Pyx_PyObject_CallOneArg(__pyx_t_2, __pyx_t_3); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3086, __pyx_L1_error)\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    __Pyx_GOTREF(__pyx_t_1);\n  } else {\n    #if CYTHON_FAST_PYCALL\n    if (PyFunction_Check(__pyx_t_2)) {\n      PyObject *__pyx_temp[2] = {__pyx_t_4, __pyx_t_3};\n      __pyx_t_1 = __Pyx_PyFunction_FastCall(__pyx_t_2, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3086, __pyx_L1_error)\n      __Pyx_XDECREF(__pyx_t_4); __pyx_t_4 = 0;\n      __Pyx_GOTREF(__pyx_t_1);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    } else\n    #endif\n    #if CYTHON_FAST_PYCCALL\n    if (__Pyx_PyFastCFunction_Check(__pyx_t_2)) {\n      PyObject *__pyx_temp[2] = {__pyx_t_4, __pyx_t_3};\n      __pyx_t_1 = __Pyx_PyCFunction_FastCall(__pyx_t_2, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3086, __pyx_L1_error)\n      __Pyx_XDECREF(__pyx_t_4); __pyx_t_4 = 0;\n      __Pyx_GOTREF(__pyx_t_1);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    } else\n    #endif\n    {\n      __pyx_t_5 = PyTuple_New(1+1); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 3086, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_5);\n      __Pyx_GIVEREF(__pyx_t_4); PyTuple_SET_ITEM(__pyx_t_5, 0, __pyx_t_4); __pyx_t_4 = NULL;\n      __Pyx_GIVEREF(__pyx_t_3);\n      PyTuple_SET_ITEM(__pyx_t_5, 0+1, __pyx_t_3);\n      __pyx_t_3 = 0;\n      __pyx_t_1 = __Pyx_PyObject_Call(__pyx_t_2, __pyx_t_5, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3086, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_1);\n      __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n    }\n  }\n  __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":3085\n *   \"\"\"\n * \n *   def __repr__(self):             # <<<<<<<<<<<<<<\n *     return \"<MutableArcIterator at 0x{:x}>\".format(id(self))\n * \n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_AddTraceback(\"pywrapfst.MutableArcIterator.__repr__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":3088\n *     return \"<MutableArcIterator at 0x{:x}>\".format(id(self))\n * \n *   def __init__(self, _MutableFst ifst, int64 state):             # <<<<<<<<<<<<<<\n *     if not ifst._fst.get().ValidStateId(state):\n *       raise FstIndexError(\"State index out of range\")\n */\n\n/* Python wrapper */\nstatic int __pyx_pw_9pywrapfst_18MutableArcIterator_3__init__(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic int __pyx_pw_9pywrapfst_18MutableArcIterator_3__init__(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_ifst = 0;\n  __pyx_t_10basictypes_int64 __pyx_v_state;\n  int __pyx_r;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__init__ (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_ifst,&__pyx_n_s_state,0};\n    PyObject* values[2] = {0,0};\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (likely((values[0] = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_ifst)) != 0)) kw_args--;\n        else goto __pyx_L5_argtuple_error;\n        CYTHON_FALLTHROUGH;\n        case  1:\n        if (likely((values[1] = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_state)) != 0)) kw_args--;\n        else {\n          __Pyx_RaiseArgtupleInvalid(\"__init__\", 1, 2, 2, 1); __PYX_ERR(0, 3088, __pyx_L3_error)\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"__init__\") < 0)) __PYX_ERR(0, 3088, __pyx_L3_error)\n      }\n    } else if (PyTuple_GET_SIZE(__pyx_args) != 2) {\n      goto __pyx_L5_argtuple_error;\n    } else {\n      values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n      values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n    }\n    __pyx_v_ifst = ((struct __pyx_obj_9pywrapfst__MutableFst *)values[0]);\n    __pyx_v_state = __Pyx_PyInt_As_int64_t(values[1]); if (unlikely((__pyx_v_state == ((int64_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 3088, __pyx_L3_error)\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"__init__\", 1, 2, 2, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 3088, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst.MutableArcIterator.__init__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return -1;\n  __pyx_L4_argument_unpacking_done:;\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_ifst), __pyx_ptype_9pywrapfst__MutableFst, 1, \"ifst\", 0))) __PYX_ERR(0, 3088, __pyx_L1_error)\n  __pyx_r = __pyx_pf_9pywrapfst_18MutableArcIterator_2__init__(((struct __pyx_obj_9pywrapfst_MutableArcIterator *)__pyx_v_self), __pyx_v_ifst, __pyx_v_state);\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __pyx_r = -1;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic int __pyx_pf_9pywrapfst_18MutableArcIterator_2__init__(struct __pyx_obj_9pywrapfst_MutableArcIterator *__pyx_v_self, struct __pyx_obj_9pywrapfst__MutableFst *__pyx_v_ifst, __pyx_t_10basictypes_int64 __pyx_v_state) {\n  int __pyx_r;\n  __Pyx_RefNannyDeclarations\n  int __pyx_t_1;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  std::shared_ptr<fst::script::MutableFstClass>  __pyx_t_4;\n  __Pyx_RefNannySetupContext(\"__init__\", 0);\n\n  /* \"pywrapfst.pyx\":3089\n * \n *   def __init__(self, _MutableFst ifst, int64 state):\n *     if not ifst._fst.get().ValidStateId(state):             # <<<<<<<<<<<<<<\n *       raise FstIndexError(\"State index out of range\")\n *     # Makes copy of the shared_ptr, potentially extending the FST's lifetime.\n */\n  if (unlikely(((PyObject *)__pyx_v_ifst) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 3089, __pyx_L1_error)\n  }\n  __pyx_t_1 = ((!(__pyx_v_ifst->__pyx_base._fst.get()->ValidStateId(__pyx_v_state) != 0)) != 0);\n  if (unlikely(__pyx_t_1)) {\n\n    /* \"pywrapfst.pyx\":3090\n *   def __init__(self, _MutableFst ifst, int64 state):\n *     if not ifst._fst.get().ValidStateId(state):\n *       raise FstIndexError(\"State index out of range\")             # <<<<<<<<<<<<<<\n *     # Makes copy of the shared_ptr, potentially extending the FST's lifetime.\n *     self._mfst = ifst._mfst\n */\n    __pyx_t_2 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstIndexError); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3090, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_2);\n    __pyx_t_3 = __Pyx_PyObject_Call(__pyx_t_2, __pyx_tuple__62, NULL); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 3090, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_3);\n    __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n    __Pyx_Raise(__pyx_t_3, 0, 0, 0);\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    __PYX_ERR(0, 3090, __pyx_L1_error)\n\n    /* \"pywrapfst.pyx\":3089\n * \n *   def __init__(self, _MutableFst ifst, int64 state):\n *     if not ifst._fst.get().ValidStateId(state):             # <<<<<<<<<<<<<<\n *       raise FstIndexError(\"State index out of range\")\n *     # Makes copy of the shared_ptr, potentially extending the FST's lifetime.\n */\n  }\n\n  /* \"pywrapfst.pyx\":3092\n *       raise FstIndexError(\"State index out of range\")\n *     # Makes copy of the shared_ptr, potentially extending the FST's lifetime.\n *     self._mfst = ifst._mfst             # <<<<<<<<<<<<<<\n *     self._aiter.reset(new fst.MutableArcIteratorClass(ifst._mfst.get(), state))\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_ifst) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_mfst\");\n    __PYX_ERR(0, 3092, __pyx_L1_error)\n  }\n  __pyx_t_4 = __pyx_v_ifst->_mfst;\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_mfst\");\n    __PYX_ERR(0, 3092, __pyx_L1_error)\n  }\n  __pyx_v_self->_mfst = __pyx_t_4;\n\n  /* \"pywrapfst.pyx\":3093\n *     # Makes copy of the shared_ptr, potentially extending the FST's lifetime.\n *     self._mfst = ifst._mfst\n *     self._aiter.reset(new fst.MutableArcIteratorClass(ifst._mfst.get(), state))             # <<<<<<<<<<<<<<\n * \n *   cpdef bool done(self):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_aiter\");\n    __PYX_ERR(0, 3093, __pyx_L1_error)\n  }\n  if (unlikely(((PyObject *)__pyx_v_ifst) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_mfst\");\n    __PYX_ERR(0, 3093, __pyx_L1_error)\n  }\n  __pyx_v_self->_aiter.reset(new fst::script::MutableArcIteratorClass(__pyx_v_ifst->_mfst.get(), __pyx_v_state));\n\n  /* \"pywrapfst.pyx\":3088\n *     return \"<MutableArcIterator at 0x{:x}>\".format(id(self))\n * \n *   def __init__(self, _MutableFst ifst, int64 state):             # <<<<<<<<<<<<<<\n *     if not ifst._fst.get().ValidStateId(state):\n *       raise FstIndexError(\"State index out of range\")\n */\n\n  /* function exit code */\n  __pyx_r = 0;\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_AddTraceback(\"pywrapfst.MutableArcIterator.__init__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = -1;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":3095\n *     self._aiter.reset(new fst.MutableArcIteratorClass(ifst._mfst.get(), state))\n * \n *   cpdef bool done(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     done(self)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_18MutableArcIterator_5done(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic bool __pyx_f_9pywrapfst_18MutableArcIterator_done(struct __pyx_obj_9pywrapfst_MutableArcIterator *__pyx_v_self, int __pyx_skip_dispatch) {\n  bool __pyx_r;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  bool __pyx_t_5;\n  __Pyx_RefNannySetupContext(\"done\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_done); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3095, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_18MutableArcIterator_5done)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3095, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3095, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __pyx_t_5 = __Pyx_PyObject_IsTrue(__pyx_t_2); if (unlikely((__pyx_t_5 == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 3095, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __pyx_r = __pyx_t_5;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":3104\n *       True if the iterator is exhausted, False otherwise.\n *     \"\"\"\n *     return self._aiter.get().Done()             # <<<<<<<<<<<<<<\n * \n *   cpdef uint32 flags(self):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_aiter\");\n    __PYX_ERR(0, 3104, __pyx_L1_error)\n  }\n  __pyx_r = __pyx_v_self->_aiter.get()->Done();\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":3095\n *     self._aiter.reset(new fst.MutableArcIteratorClass(ifst._mfst.get(), state))\n * \n *   cpdef bool done(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     done(self)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_WriteUnraisable(\"pywrapfst.MutableArcIterator.done\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_18MutableArcIterator_5done(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_18MutableArcIterator_4done[] = \"\\n    done(self)\\n\\n    Indicates whether the iterator is exhausted or not.\\n\\n    Returns:\\n      True if the iterator is exhausted, False otherwise.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_18MutableArcIterator_5done(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"done (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_18MutableArcIterator_4done(((struct __pyx_obj_9pywrapfst_MutableArcIterator *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_18MutableArcIterator_4done(struct __pyx_obj_9pywrapfst_MutableArcIterator *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"done\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __Pyx_PyBool_FromLong(__pyx_f_9pywrapfst_18MutableArcIterator_done(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3095, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.MutableArcIterator.done\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":3106\n *     return self._aiter.get().Done()\n * \n *   cpdef uint32 flags(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     flags(self)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_18MutableArcIterator_7flags(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic __pyx_t_10basictypes_uint32 __pyx_f_9pywrapfst_18MutableArcIterator_flags(struct __pyx_obj_9pywrapfst_MutableArcIterator *__pyx_v_self, int __pyx_skip_dispatch) {\n  __pyx_t_10basictypes_uint32 __pyx_r;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  __pyx_t_10basictypes_uint32 __pyx_t_5;\n  __Pyx_RefNannySetupContext(\"flags\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_flags); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3106, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_18MutableArcIterator_7flags)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3106, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3106, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __pyx_t_5 = __Pyx_PyInt_As_uint32_t(__pyx_t_2); if (unlikely((__pyx_t_5 == ((uint32_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 3106, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __pyx_r = __pyx_t_5;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":3115\n *       The current iterator behavioral flags as an integer.\n *     \"\"\"\n *     return self._aiter.get().Flags()             # <<<<<<<<<<<<<<\n * \n *   cpdef void next(self):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_aiter\");\n    __PYX_ERR(0, 3115, __pyx_L1_error)\n  }\n  __pyx_r = __pyx_v_self->_aiter.get()->Flags();\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":3106\n *     return self._aiter.get().Done()\n * \n *   cpdef uint32 flags(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     flags(self)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_WriteUnraisable(\"pywrapfst.MutableArcIterator.flags\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_18MutableArcIterator_7flags(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_18MutableArcIterator_6flags[] = \"\\n    flags(self)\\n\\n    Returns the current iterator behavioral flags.\\n\\n    Returns:\\n      The current iterator behavioral flags as an integer.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_18MutableArcIterator_7flags(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"flags (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_18MutableArcIterator_6flags(((struct __pyx_obj_9pywrapfst_MutableArcIterator *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_18MutableArcIterator_6flags(struct __pyx_obj_9pywrapfst_MutableArcIterator *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"flags\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __Pyx_PyInt_From_uint32_t(__pyx_f_9pywrapfst_18MutableArcIterator_flags(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3106, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.MutableArcIterator.flags\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":3117\n *     return self._aiter.get().Flags()\n * \n *   cpdef void next(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     next(self)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_18MutableArcIterator_9next(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic void __pyx_f_9pywrapfst_18MutableArcIterator_next(struct __pyx_obj_9pywrapfst_MutableArcIterator *__pyx_v_self, int __pyx_skip_dispatch) {\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  __Pyx_RefNannySetupContext(\"next\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_next); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3117, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_18MutableArcIterator_9next)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3117, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3117, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":3123\n *     Advances the iterator.\n *     \"\"\"\n *     self._aiter.get().Next()             # <<<<<<<<<<<<<<\n * \n *   cpdef size_t position(self):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_aiter\");\n    __PYX_ERR(0, 3123, __pyx_L1_error)\n  }\n  __pyx_v_self->_aiter.get()->Next();\n\n  /* \"pywrapfst.pyx\":3117\n *     return self._aiter.get().Flags()\n * \n *   cpdef void next(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     next(self)\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_WriteUnraisable(\"pywrapfst.MutableArcIterator.next\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_18MutableArcIterator_9next(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_18MutableArcIterator_8next[] = \"\\n    next(self)\\n\\n    Advances the iterator.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_18MutableArcIterator_9next(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"next (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_18MutableArcIterator_8next(((struct __pyx_obj_9pywrapfst_MutableArcIterator *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_18MutableArcIterator_8next(struct __pyx_obj_9pywrapfst_MutableArcIterator *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"next\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __Pyx_void_to_None(__pyx_f_9pywrapfst_18MutableArcIterator_next(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3117, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.MutableArcIterator.next\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":3125\n *     self._aiter.get().Next()\n * \n *   cpdef size_t position(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     position(self)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_18MutableArcIterator_11position(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic size_t __pyx_f_9pywrapfst_18MutableArcIterator_position(struct __pyx_obj_9pywrapfst_MutableArcIterator *__pyx_v_self, int __pyx_skip_dispatch) {\n  size_t __pyx_r;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  size_t __pyx_t_5;\n  __Pyx_RefNannySetupContext(\"position\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_position); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3125, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_18MutableArcIterator_11position)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3125, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3125, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __pyx_t_5 = __Pyx_PyInt_As_size_t(__pyx_t_2); if (unlikely((__pyx_t_5 == (size_t)-1) && PyErr_Occurred())) __PYX_ERR(0, 3125, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __pyx_r = __pyx_t_5;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":3134\n *       The iterator's position, expressed as an integer.\n *     \"\"\"\n *     return self._aiter.get().Position()             # <<<<<<<<<<<<<<\n * \n *   cpdef void reset(self):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_aiter\");\n    __PYX_ERR(0, 3134, __pyx_L1_error)\n  }\n  __pyx_r = __pyx_v_self->_aiter.get()->Position();\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":3125\n *     self._aiter.get().Next()\n * \n *   cpdef size_t position(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     position(self)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_WriteUnraisable(\"pywrapfst.MutableArcIterator.position\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_18MutableArcIterator_11position(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_18MutableArcIterator_10position[] = \"\\n    position(self)\\n\\n    Returns the position of the iterator.\\n\\n    Returns:\\n      The iterator's position, expressed as an integer.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_18MutableArcIterator_11position(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"position (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_18MutableArcIterator_10position(((struct __pyx_obj_9pywrapfst_MutableArcIterator *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_18MutableArcIterator_10position(struct __pyx_obj_9pywrapfst_MutableArcIterator *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"position\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __Pyx_PyInt_FromSize_t(__pyx_f_9pywrapfst_18MutableArcIterator_position(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3125, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.MutableArcIterator.position\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":3136\n *     return self._aiter.get().Position()\n * \n *   cpdef void reset(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     reset(self)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_18MutableArcIterator_13reset(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic void __pyx_f_9pywrapfst_18MutableArcIterator_reset(struct __pyx_obj_9pywrapfst_MutableArcIterator *__pyx_v_self, int __pyx_skip_dispatch) {\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  __Pyx_RefNannySetupContext(\"reset\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_reset); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3136, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_18MutableArcIterator_13reset)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3136, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3136, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":3142\n *     Resets the iterator to the initial position.\n *     \"\"\"\n *     self._aiter.get().Reset()             # <<<<<<<<<<<<<<\n * \n *   cpdef void seek(self, size_t a):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_aiter\");\n    __PYX_ERR(0, 3142, __pyx_L1_error)\n  }\n  __pyx_v_self->_aiter.get()->Reset();\n\n  /* \"pywrapfst.pyx\":3136\n *     return self._aiter.get().Position()\n * \n *   cpdef void reset(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     reset(self)\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_WriteUnraisable(\"pywrapfst.MutableArcIterator.reset\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_18MutableArcIterator_13reset(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_18MutableArcIterator_12reset[] = \"\\n    reset(self)\\n\\n    Resets the iterator to the initial position.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_18MutableArcIterator_13reset(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"reset (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_18MutableArcIterator_12reset(((struct __pyx_obj_9pywrapfst_MutableArcIterator *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_18MutableArcIterator_12reset(struct __pyx_obj_9pywrapfst_MutableArcIterator *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"reset\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __Pyx_void_to_None(__pyx_f_9pywrapfst_18MutableArcIterator_reset(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3136, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.MutableArcIterator.reset\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":3144\n *     self._aiter.get().Reset()\n * \n *   cpdef void seek(self, size_t a):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     seek(self, a)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_18MutableArcIterator_15seek(PyObject *__pyx_v_self, PyObject *__pyx_arg_a); /*proto*/\nstatic void __pyx_f_9pywrapfst_18MutableArcIterator_seek(struct __pyx_obj_9pywrapfst_MutableArcIterator *__pyx_v_self, size_t __pyx_v_a, int __pyx_skip_dispatch) {\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  PyObject *__pyx_t_6 = NULL;\n  __Pyx_RefNannySetupContext(\"seek\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_seek); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3144, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_18MutableArcIterator_15seek)) {\n      __pyx_t_3 = __Pyx_PyInt_FromSize_t(__pyx_v_a); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 3144, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_3);\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_4 = __pyx_t_1; __pyx_t_5 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_4))) {\n        __pyx_t_5 = PyMethod_GET_SELF(__pyx_t_4);\n        if (likely(__pyx_t_5)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_4);\n          __Pyx_INCREF(__pyx_t_5);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_4, function);\n        }\n      }\n      if (!__pyx_t_5) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_4, __pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3144, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n        __Pyx_GOTREF(__pyx_t_2);\n      } else {\n        #if CYTHON_FAST_PYCALL\n        if (PyFunction_Check(__pyx_t_4)) {\n          PyObject *__pyx_temp[2] = {__pyx_t_5, __pyx_t_3};\n          __pyx_t_2 = __Pyx_PyFunction_FastCall(__pyx_t_4, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3144, __pyx_L1_error)\n          __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;\n          __Pyx_GOTREF(__pyx_t_2);\n          __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n        } else\n        #endif\n        #if CYTHON_FAST_PYCCALL\n        if (__Pyx_PyFastCFunction_Check(__pyx_t_4)) {\n          PyObject *__pyx_temp[2] = {__pyx_t_5, __pyx_t_3};\n          __pyx_t_2 = __Pyx_PyCFunction_FastCall(__pyx_t_4, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3144, __pyx_L1_error)\n          __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;\n          __Pyx_GOTREF(__pyx_t_2);\n          __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n        } else\n        #endif\n        {\n          __pyx_t_6 = PyTuple_New(1+1); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 3144, __pyx_L1_error)\n          __Pyx_GOTREF(__pyx_t_6);\n          __Pyx_GIVEREF(__pyx_t_5); PyTuple_SET_ITEM(__pyx_t_6, 0, __pyx_t_5); __pyx_t_5 = NULL;\n          __Pyx_GIVEREF(__pyx_t_3);\n          PyTuple_SET_ITEM(__pyx_t_6, 0+1, __pyx_t_3);\n          __pyx_t_3 = 0;\n          __pyx_t_2 = __Pyx_PyObject_Call(__pyx_t_4, __pyx_t_6, NULL); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3144, __pyx_L1_error)\n          __Pyx_GOTREF(__pyx_t_2);\n          __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n        }\n      }\n      __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":3153\n *       a: The position to seek to.\n *     \"\"\"\n *     self._aiter.get().Seek(a)             # <<<<<<<<<<<<<<\n * \n *   cpdef void set_flags(self, uint32 flags, uint32 mask):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_aiter\");\n    __PYX_ERR(0, 3153, __pyx_L1_error)\n  }\n  __pyx_v_self->_aiter.get()->Seek(__pyx_v_a);\n\n  /* \"pywrapfst.pyx\":3144\n *     self._aiter.get().Reset()\n * \n *   cpdef void seek(self, size_t a):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     seek(self, a)\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_XDECREF(__pyx_t_6);\n  __Pyx_WriteUnraisable(\"pywrapfst.MutableArcIterator.seek\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_18MutableArcIterator_15seek(PyObject *__pyx_v_self, PyObject *__pyx_arg_a); /*proto*/\nstatic char __pyx_doc_9pywrapfst_18MutableArcIterator_14seek[] = \"\\n    seek(self, a)\\n\\n    Advance the iterator to a new position.\\n\\n    Args:\\n      a: The position to seek to.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_18MutableArcIterator_15seek(PyObject *__pyx_v_self, PyObject *__pyx_arg_a) {\n  size_t __pyx_v_a;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"seek (wrapper)\", 0);\n  assert(__pyx_arg_a); {\n    __pyx_v_a = __Pyx_PyInt_As_size_t(__pyx_arg_a); if (unlikely((__pyx_v_a == (size_t)-1) && PyErr_Occurred())) __PYX_ERR(0, 3144, __pyx_L3_error)\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst.MutableArcIterator.seek\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  __pyx_r = __pyx_pf_9pywrapfst_18MutableArcIterator_14seek(((struct __pyx_obj_9pywrapfst_MutableArcIterator *)__pyx_v_self), ((size_t)__pyx_v_a));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_18MutableArcIterator_14seek(struct __pyx_obj_9pywrapfst_MutableArcIterator *__pyx_v_self, size_t __pyx_v_a) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"seek\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __Pyx_void_to_None(__pyx_f_9pywrapfst_18MutableArcIterator_seek(__pyx_v_self, __pyx_v_a, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3144, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.MutableArcIterator.seek\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":3155\n *     self._aiter.get().Seek(a)\n * \n *   cpdef void set_flags(self, uint32 flags, uint32 mask):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     set_flags(self, flags, mask)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_18MutableArcIterator_17set_flags(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic void __pyx_f_9pywrapfst_18MutableArcIterator_set_flags(struct __pyx_obj_9pywrapfst_MutableArcIterator *__pyx_v_self, __pyx_t_10basictypes_uint32 __pyx_v_flags, __pyx_t_10basictypes_uint32 __pyx_v_mask, int __pyx_skip_dispatch) {\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  PyObject *__pyx_t_6 = NULL;\n  int __pyx_t_7;\n  PyObject *__pyx_t_8 = NULL;\n  __Pyx_RefNannySetupContext(\"set_flags\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_set_flags); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3155, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_18MutableArcIterator_17set_flags)) {\n      __pyx_t_3 = __Pyx_PyInt_From_uint32_t(__pyx_v_flags); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 3155, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_3);\n      __pyx_t_4 = __Pyx_PyInt_From_uint32_t(__pyx_v_mask); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 3155, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_4);\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_5 = __pyx_t_1; __pyx_t_6 = NULL;\n      __pyx_t_7 = 0;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_5))) {\n        __pyx_t_6 = PyMethod_GET_SELF(__pyx_t_5);\n        if (likely(__pyx_t_6)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_5);\n          __Pyx_INCREF(__pyx_t_6);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_5, function);\n          __pyx_t_7 = 1;\n        }\n      }\n      #if CYTHON_FAST_PYCALL\n      if (PyFunction_Check(__pyx_t_5)) {\n        PyObject *__pyx_temp[3] = {__pyx_t_6, __pyx_t_3, __pyx_t_4};\n        __pyx_t_2 = __Pyx_PyFunction_FastCall(__pyx_t_5, __pyx_temp+1-__pyx_t_7, 2+__pyx_t_7); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3155, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_6); __pyx_t_6 = 0;\n        __Pyx_GOTREF(__pyx_t_2);\n        __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else\n      #endif\n      #if CYTHON_FAST_PYCCALL\n      if (__Pyx_PyFastCFunction_Check(__pyx_t_5)) {\n        PyObject *__pyx_temp[3] = {__pyx_t_6, __pyx_t_3, __pyx_t_4};\n        __pyx_t_2 = __Pyx_PyCFunction_FastCall(__pyx_t_5, __pyx_temp+1-__pyx_t_7, 2+__pyx_t_7); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3155, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_6); __pyx_t_6 = 0;\n        __Pyx_GOTREF(__pyx_t_2);\n        __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else\n      #endif\n      {\n        __pyx_t_8 = PyTuple_New(2+__pyx_t_7); if (unlikely(!__pyx_t_8)) __PYX_ERR(0, 3155, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_8);\n        if (__pyx_t_6) {\n          __Pyx_GIVEREF(__pyx_t_6); PyTuple_SET_ITEM(__pyx_t_8, 0, __pyx_t_6); __pyx_t_6 = NULL;\n        }\n        __Pyx_GIVEREF(__pyx_t_3);\n        PyTuple_SET_ITEM(__pyx_t_8, 0+__pyx_t_7, __pyx_t_3);\n        __Pyx_GIVEREF(__pyx_t_4);\n        PyTuple_SET_ITEM(__pyx_t_8, 1+__pyx_t_7, __pyx_t_4);\n        __pyx_t_3 = 0;\n        __pyx_t_4 = 0;\n        __pyx_t_2 = __Pyx_PyObject_Call(__pyx_t_5, __pyx_t_8, NULL); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3155, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_2);\n        __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0;\n      }\n      __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":3165\n *       mask: A mask to be applied to the `flags` argument before setting them.\n *     \"\"\"\n *     self._aiter.get().SetFlags(flags, mask)             # <<<<<<<<<<<<<<\n * \n *   cpdef void set_value(self, Arc arc):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_aiter\");\n    __PYX_ERR(0, 3165, __pyx_L1_error)\n  }\n  __pyx_v_self->_aiter.get()->SetFlags(__pyx_v_flags, __pyx_v_mask);\n\n  /* \"pywrapfst.pyx\":3155\n *     self._aiter.get().Seek(a)\n * \n *   cpdef void set_flags(self, uint32 flags, uint32 mask):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     set_flags(self, flags, mask)\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_XDECREF(__pyx_t_6);\n  __Pyx_XDECREF(__pyx_t_8);\n  __Pyx_WriteUnraisable(\"pywrapfst.MutableArcIterator.set_flags\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_18MutableArcIterator_17set_flags(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic char __pyx_doc_9pywrapfst_18MutableArcIterator_16set_flags[] = \"\\n    set_flags(self, flags, mask)\\n\\n    Sets the current iterator behavioral flags.\\n\\n    Args:\\n      flags: The properties to be set.\\n      mask: A mask to be applied to the `flags` argument before setting them.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_18MutableArcIterator_17set_flags(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  __pyx_t_10basictypes_uint32 __pyx_v_flags;\n  __pyx_t_10basictypes_uint32 __pyx_v_mask;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"set_flags (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_flags,&__pyx_n_s_mask,0};\n    PyObject* values[2] = {0,0};\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (likely((values[0] = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_flags)) != 0)) kw_args--;\n        else goto __pyx_L5_argtuple_error;\n        CYTHON_FALLTHROUGH;\n        case  1:\n        if (likely((values[1] = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_mask)) != 0)) kw_args--;\n        else {\n          __Pyx_RaiseArgtupleInvalid(\"set_flags\", 1, 2, 2, 1); __PYX_ERR(0, 3155, __pyx_L3_error)\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"set_flags\") < 0)) __PYX_ERR(0, 3155, __pyx_L3_error)\n      }\n    } else if (PyTuple_GET_SIZE(__pyx_args) != 2) {\n      goto __pyx_L5_argtuple_error;\n    } else {\n      values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n      values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n    }\n    __pyx_v_flags = __Pyx_PyInt_As_uint32_t(values[0]); if (unlikely((__pyx_v_flags == ((uint32_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 3155, __pyx_L3_error)\n    __pyx_v_mask = __Pyx_PyInt_As_uint32_t(values[1]); if (unlikely((__pyx_v_mask == ((uint32_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 3155, __pyx_L3_error)\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"set_flags\", 1, 2, 2, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 3155, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst.MutableArcIterator.set_flags\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  __pyx_r = __pyx_pf_9pywrapfst_18MutableArcIterator_16set_flags(((struct __pyx_obj_9pywrapfst_MutableArcIterator *)__pyx_v_self), __pyx_v_flags, __pyx_v_mask);\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_18MutableArcIterator_16set_flags(struct __pyx_obj_9pywrapfst_MutableArcIterator *__pyx_v_self, __pyx_t_10basictypes_uint32 __pyx_v_flags, __pyx_t_10basictypes_uint32 __pyx_v_mask) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"set_flags\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __Pyx_void_to_None(__pyx_f_9pywrapfst_18MutableArcIterator_set_flags(__pyx_v_self, __pyx_v_flags, __pyx_v_mask, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3155, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.MutableArcIterator.set_flags\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":3167\n *     self._aiter.get().SetFlags(flags, mask)\n * \n *   cpdef void set_value(self, Arc arc):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     set_value(self, arc)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_18MutableArcIterator_19set_value(PyObject *__pyx_v_self, PyObject *__pyx_v_arc); /*proto*/\nstatic void __pyx_f_9pywrapfst_18MutableArcIterator_set_value(struct __pyx_obj_9pywrapfst_MutableArcIterator *__pyx_v_self, struct __pyx_obj_9pywrapfst_Arc *__pyx_v_arc, int __pyx_skip_dispatch) {\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  __Pyx_RefNannySetupContext(\"set_value\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_set_value); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3167, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_18MutableArcIterator_19set_value)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (!__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, ((PyObject *)__pyx_v_arc)); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3167, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_2);\n      } else {\n        #if CYTHON_FAST_PYCALL\n        if (PyFunction_Check(__pyx_t_3)) {\n          PyObject *__pyx_temp[2] = {__pyx_t_4, ((PyObject *)__pyx_v_arc)};\n          __pyx_t_2 = __Pyx_PyFunction_FastCall(__pyx_t_3, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3167, __pyx_L1_error)\n          __Pyx_XDECREF(__pyx_t_4); __pyx_t_4 = 0;\n          __Pyx_GOTREF(__pyx_t_2);\n        } else\n        #endif\n        #if CYTHON_FAST_PYCCALL\n        if (__Pyx_PyFastCFunction_Check(__pyx_t_3)) {\n          PyObject *__pyx_temp[2] = {__pyx_t_4, ((PyObject *)__pyx_v_arc)};\n          __pyx_t_2 = __Pyx_PyCFunction_FastCall(__pyx_t_3, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3167, __pyx_L1_error)\n          __Pyx_XDECREF(__pyx_t_4); __pyx_t_4 = 0;\n          __Pyx_GOTREF(__pyx_t_2);\n        } else\n        #endif\n        {\n          __pyx_t_5 = PyTuple_New(1+1); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 3167, __pyx_L1_error)\n          __Pyx_GOTREF(__pyx_t_5);\n          __Pyx_GIVEREF(__pyx_t_4); PyTuple_SET_ITEM(__pyx_t_5, 0, __pyx_t_4); __pyx_t_4 = NULL;\n          __Pyx_INCREF(((PyObject *)__pyx_v_arc));\n          __Pyx_GIVEREF(((PyObject *)__pyx_v_arc));\n          PyTuple_SET_ITEM(__pyx_t_5, 0+1, ((PyObject *)__pyx_v_arc));\n          __pyx_t_2 = __Pyx_PyObject_Call(__pyx_t_3, __pyx_t_5, NULL); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3167, __pyx_L1_error)\n          __Pyx_GOTREF(__pyx_t_2);\n          __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n        }\n      }\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":3176\n *       arc: The arc to replace the current arc with.\n *     \"\"\"\n *     self._aiter.get().SetValue(deref(arc._arc))             # <<<<<<<<<<<<<<\n * \n *   cpdef object value(self):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_aiter\");\n    __PYX_ERR(0, 3176, __pyx_L1_error)\n  }\n  if (unlikely(((PyObject *)__pyx_v_arc) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_arc\");\n    __PYX_ERR(0, 3176, __pyx_L1_error)\n  }\n  __pyx_v_self->_aiter.get()->SetValue((*__pyx_v_arc->_arc));\n\n  /* \"pywrapfst.pyx\":3167\n *     self._aiter.get().SetFlags(flags, mask)\n * \n *   cpdef void set_value(self, Arc arc):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     set_value(self, arc)\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_WriteUnraisable(\"pywrapfst.MutableArcIterator.set_value\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_18MutableArcIterator_19set_value(PyObject *__pyx_v_self, PyObject *__pyx_v_arc); /*proto*/\nstatic char __pyx_doc_9pywrapfst_18MutableArcIterator_18set_value[] = \"\\n    set_value(self, arc)\\n\\n    Replace the current arc with a new arc.\\n\\n    Args:\\n      arc: The arc to replace the current arc with.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_18MutableArcIterator_19set_value(PyObject *__pyx_v_self, PyObject *__pyx_v_arc) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"set_value (wrapper)\", 0);\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_arc), __pyx_ptype_9pywrapfst_Arc, 1, \"arc\", 0))) __PYX_ERR(0, 3167, __pyx_L1_error)\n  __pyx_r = __pyx_pf_9pywrapfst_18MutableArcIterator_18set_value(((struct __pyx_obj_9pywrapfst_MutableArcIterator *)__pyx_v_self), ((struct __pyx_obj_9pywrapfst_Arc *)__pyx_v_arc));\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_18MutableArcIterator_18set_value(struct __pyx_obj_9pywrapfst_MutableArcIterator *__pyx_v_self, struct __pyx_obj_9pywrapfst_Arc *__pyx_v_arc) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"set_value\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __Pyx_void_to_None(__pyx_f_9pywrapfst_18MutableArcIterator_set_value(__pyx_v_self, __pyx_v_arc, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3167, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.MutableArcIterator.set_value\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":3178\n *     self._aiter.get().SetValue(deref(arc._arc))\n * \n *   cpdef object value(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     value(self)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_18MutableArcIterator_21value(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic PyObject *__pyx_f_9pywrapfst_18MutableArcIterator_value(struct __pyx_obj_9pywrapfst_MutableArcIterator *__pyx_v_self, int __pyx_skip_dispatch) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  __Pyx_RefNannySetupContext(\"value\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_value); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3178, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_18MutableArcIterator_21value)) {\n      __Pyx_XDECREF(__pyx_r);\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3178, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3178, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __pyx_r = __pyx_t_2;\n      __pyx_t_2 = 0;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":3184\n *     Returns the current arc.\n *     \"\"\"\n *     return _init_Arc(self._aiter.get().Value())             # <<<<<<<<<<<<<<\n * \n * \n */\n  __Pyx_XDECREF(__pyx_r);\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_aiter\");\n    __PYX_ERR(0, 3184, __pyx_L1_error)\n  }\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst__init_Arc(__pyx_v_self->_aiter.get()->Value())); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3184, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":3178\n *     self._aiter.get().SetValue(deref(arc._arc))\n * \n *   cpdef object value(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     value(self)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_AddTraceback(\"pywrapfst.MutableArcIterator.value\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_18MutableArcIterator_21value(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_18MutableArcIterator_20value[] = \"\\n    value(self)\\n\\n    Returns the current arc.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_18MutableArcIterator_21value(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"value (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_18MutableArcIterator_20value(((struct __pyx_obj_9pywrapfst_MutableArcIterator *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_18MutableArcIterator_20value(struct __pyx_obj_9pywrapfst_MutableArcIterator *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"value\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __pyx_f_9pywrapfst_18MutableArcIterator_value(__pyx_v_self, 1); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3178, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.MutableArcIterator.value\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"(tree fragment)\":1\n * def __reduce_cython__(self):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._aiter,self._mfst cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_18MutableArcIterator_23__reduce_cython__(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_18MutableArcIterator_23__reduce_cython__(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__reduce_cython__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_18MutableArcIterator_22__reduce_cython__(((struct __pyx_obj_9pywrapfst_MutableArcIterator *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_18MutableArcIterator_22__reduce_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst_MutableArcIterator *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"__reduce_cython__\", 0);\n\n  /* \"(tree fragment)\":2\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._aiter,self._mfst cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._aiter,self._mfst cannot be converted to a Python object for pickling\")\n */\n  __pyx_t_1 = __Pyx_PyObject_Call(__pyx_builtin_TypeError, __pyx_tuple__63, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(1, 2, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __Pyx_Raise(__pyx_t_1, 0, 0, 0);\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  __PYX_ERR(1, 2, __pyx_L1_error)\n\n  /* \"(tree fragment)\":1\n * def __reduce_cython__(self):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._aiter,self._mfst cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.MutableArcIterator.__reduce_cython__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"(tree fragment)\":3\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._aiter,self._mfst cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._aiter,self._mfst cannot be converted to a Python object for pickling\")\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_18MutableArcIterator_25__setstate_cython__(PyObject *__pyx_v_self, PyObject *__pyx_v___pyx_state); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_18MutableArcIterator_25__setstate_cython__(PyObject *__pyx_v_self, PyObject *__pyx_v___pyx_state) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__setstate_cython__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_18MutableArcIterator_24__setstate_cython__(((struct __pyx_obj_9pywrapfst_MutableArcIterator *)__pyx_v_self), ((PyObject *)__pyx_v___pyx_state));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_18MutableArcIterator_24__setstate_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst_MutableArcIterator *__pyx_v_self, CYTHON_UNUSED PyObject *__pyx_v___pyx_state) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"__setstate_cython__\", 0);\n\n  /* \"(tree fragment)\":4\n *     raise TypeError(\"self._aiter,self._mfst cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._aiter,self._mfst cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n */\n  __pyx_t_1 = __Pyx_PyObject_Call(__pyx_builtin_TypeError, __pyx_tuple__64, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(1, 4, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __Pyx_Raise(__pyx_t_1, 0, 0, 0);\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  __PYX_ERR(1, 4, __pyx_L1_error)\n\n  /* \"(tree fragment)\":3\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._aiter,self._mfst cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._aiter,self._mfst cannot be converted to a Python object for pickling\")\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.MutableArcIterator.__setstate_cython__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":3198\n *   \"\"\"\n * \n *   def __repr__(self):             # <<<<<<<<<<<<<<\n *     return \"<StateIterator at 0x{:x}>\".format(id(self))\n * \n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_13StateIterator_1__repr__(PyObject *__pyx_v_self); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_13StateIterator_1__repr__(PyObject *__pyx_v_self) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__repr__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_13StateIterator___repr__(((struct __pyx_obj_9pywrapfst_StateIterator *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_13StateIterator___repr__(struct __pyx_obj_9pywrapfst_StateIterator *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  __Pyx_RefNannySetupContext(\"__repr__\", 0);\n\n  /* \"pywrapfst.pyx\":3199\n * \n *   def __repr__(self):\n *     return \"<StateIterator at 0x{:x}>\".format(id(self))             # <<<<<<<<<<<<<<\n * \n *   def __init__(self, _Fst ifst):\n */\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_2 = __Pyx_PyObject_GetAttrStr(__pyx_kp_s_StateIterator_at_0x_x, __pyx_n_s_format); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3199, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  __pyx_t_3 = __Pyx_PyObject_CallOneArg(__pyx_builtin_id, ((PyObject *)__pyx_v_self)); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 3199, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_3);\n  __pyx_t_4 = NULL;\n  if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_2))) {\n    __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_2);\n    if (likely(__pyx_t_4)) {\n      PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_2);\n      __Pyx_INCREF(__pyx_t_4);\n      __Pyx_INCREF(function);\n      __Pyx_DECREF_SET(__pyx_t_2, function);\n    }\n  }\n  if (!__pyx_t_4) {\n    __pyx_t_1 = __Pyx_PyObject_CallOneArg(__pyx_t_2, __pyx_t_3); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3199, __pyx_L1_error)\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    __Pyx_GOTREF(__pyx_t_1);\n  } else {\n    #if CYTHON_FAST_PYCALL\n    if (PyFunction_Check(__pyx_t_2)) {\n      PyObject *__pyx_temp[2] = {__pyx_t_4, __pyx_t_3};\n      __pyx_t_1 = __Pyx_PyFunction_FastCall(__pyx_t_2, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3199, __pyx_L1_error)\n      __Pyx_XDECREF(__pyx_t_4); __pyx_t_4 = 0;\n      __Pyx_GOTREF(__pyx_t_1);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    } else\n    #endif\n    #if CYTHON_FAST_PYCCALL\n    if (__Pyx_PyFastCFunction_Check(__pyx_t_2)) {\n      PyObject *__pyx_temp[2] = {__pyx_t_4, __pyx_t_3};\n      __pyx_t_1 = __Pyx_PyCFunction_FastCall(__pyx_t_2, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3199, __pyx_L1_error)\n      __Pyx_XDECREF(__pyx_t_4); __pyx_t_4 = 0;\n      __Pyx_GOTREF(__pyx_t_1);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    } else\n    #endif\n    {\n      __pyx_t_5 = PyTuple_New(1+1); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 3199, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_5);\n      __Pyx_GIVEREF(__pyx_t_4); PyTuple_SET_ITEM(__pyx_t_5, 0, __pyx_t_4); __pyx_t_4 = NULL;\n      __Pyx_GIVEREF(__pyx_t_3);\n      PyTuple_SET_ITEM(__pyx_t_5, 0+1, __pyx_t_3);\n      __pyx_t_3 = 0;\n      __pyx_t_1 = __Pyx_PyObject_Call(__pyx_t_2, __pyx_t_5, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3199, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_1);\n      __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n    }\n  }\n  __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":3198\n *   \"\"\"\n * \n *   def __repr__(self):             # <<<<<<<<<<<<<<\n *     return \"<StateIterator at 0x{:x}>\".format(id(self))\n * \n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_AddTraceback(\"pywrapfst.StateIterator.__repr__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":3201\n *     return \"<StateIterator at 0x{:x}>\".format(id(self))\n * \n *   def __init__(self, _Fst ifst):             # <<<<<<<<<<<<<<\n *     # Makes copy of the shared_ptr, potentially extending the FST's lifetime.\n *     self._fst = ifst._fst\n */\n\n/* Python wrapper */\nstatic int __pyx_pw_9pywrapfst_13StateIterator_3__init__(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic int __pyx_pw_9pywrapfst_13StateIterator_3__init__(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst = 0;\n  int __pyx_r;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__init__ (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_ifst,0};\n    PyObject* values[1] = {0};\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (likely((values[0] = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_ifst)) != 0)) kw_args--;\n        else goto __pyx_L5_argtuple_error;\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"__init__\") < 0)) __PYX_ERR(0, 3201, __pyx_L3_error)\n      }\n    } else if (PyTuple_GET_SIZE(__pyx_args) != 1) {\n      goto __pyx_L5_argtuple_error;\n    } else {\n      values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n    }\n    __pyx_v_ifst = ((struct __pyx_obj_9pywrapfst__Fst *)values[0]);\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"__init__\", 1, 1, 1, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 3201, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst.StateIterator.__init__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return -1;\n  __pyx_L4_argument_unpacking_done:;\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_ifst), __pyx_ptype_9pywrapfst__Fst, 1, \"ifst\", 0))) __PYX_ERR(0, 3201, __pyx_L1_error)\n  __pyx_r = __pyx_pf_9pywrapfst_13StateIterator_2__init__(((struct __pyx_obj_9pywrapfst_StateIterator *)__pyx_v_self), __pyx_v_ifst);\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __pyx_r = -1;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic int __pyx_pf_9pywrapfst_13StateIterator_2__init__(struct __pyx_obj_9pywrapfst_StateIterator *__pyx_v_self, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst) {\n  int __pyx_r;\n  __Pyx_RefNannyDeclarations\n  std::shared_ptr<fst::script::FstClass>  __pyx_t_1;\n  __Pyx_RefNannySetupContext(\"__init__\", 0);\n\n  /* \"pywrapfst.pyx\":3203\n *   def __init__(self, _Fst ifst):\n *     # Makes copy of the shared_ptr, potentially extending the FST's lifetime.\n *     self._fst = ifst._fst             # <<<<<<<<<<<<<<\n *     self._siter.reset(new fst.StateIteratorClass(deref(self._fst)))\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_ifst) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 3203, __pyx_L1_error)\n  }\n  __pyx_t_1 = __pyx_v_ifst->_fst;\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 3203, __pyx_L1_error)\n  }\n  __pyx_v_self->_fst = __pyx_t_1;\n\n  /* \"pywrapfst.pyx\":3204\n *     # Makes copy of the shared_ptr, potentially extending the FST's lifetime.\n *     self._fst = ifst._fst\n *     self._siter.reset(new fst.StateIteratorClass(deref(self._fst)))             # <<<<<<<<<<<<<<\n * \n *   # This just registers this class as a possible iterator.\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_siter\");\n    __PYX_ERR(0, 3204, __pyx_L1_error)\n  }\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 3204, __pyx_L1_error)\n  }\n  __pyx_v_self->_siter.reset(new fst::script::StateIteratorClass((*__pyx_v_self->_fst)));\n\n  /* \"pywrapfst.pyx\":3201\n *     return \"<StateIterator at 0x{:x}>\".format(id(self))\n * \n *   def __init__(self, _Fst ifst):             # <<<<<<<<<<<<<<\n *     # Makes copy of the shared_ptr, potentially extending the FST's lifetime.\n *     self._fst = ifst._fst\n */\n\n  /* function exit code */\n  __pyx_r = 0;\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"pywrapfst.StateIterator.__init__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = -1;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":3207\n * \n *   # This just registers this class as a possible iterator.\n *   def __iter__(self):             # <<<<<<<<<<<<<<\n *     return self\n * \n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_13StateIterator_5__iter__(PyObject *__pyx_v_self); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_13StateIterator_5__iter__(PyObject *__pyx_v_self) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__iter__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_13StateIterator_4__iter__(((struct __pyx_obj_9pywrapfst_StateIterator *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_13StateIterator_4__iter__(struct __pyx_obj_9pywrapfst_StateIterator *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__iter__\", 0);\n\n  /* \"pywrapfst.pyx\":3208\n *   # This just registers this class as a possible iterator.\n *   def __iter__(self):\n *     return self             # <<<<<<<<<<<<<<\n * \n *   # Magic method used to get a Pythonic API out of the C++ API.\n */\n  __Pyx_XDECREF(__pyx_r);\n  __Pyx_INCREF(((PyObject *)__pyx_v_self));\n  __pyx_r = ((PyObject *)__pyx_v_self);\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":3207\n * \n *   # This just registers this class as a possible iterator.\n *   def __iter__(self):             # <<<<<<<<<<<<<<\n *     return self\n * \n */\n\n  /* function exit code */\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":3211\n * \n *   # Magic method used to get a Pythonic API out of the C++ API.\n *   def __next__(self):             # <<<<<<<<<<<<<<\n *     if self.done():\n *       raise StopIteration\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_13StateIterator_7__next__(PyObject *__pyx_v_self); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_13StateIterator_7__next__(PyObject *__pyx_v_self) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__next__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_13StateIterator_6__next__(((struct __pyx_obj_9pywrapfst_StateIterator *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_13StateIterator_6__next__(struct __pyx_obj_9pywrapfst_StateIterator *__pyx_v_self) {\n  __pyx_t_10basictypes_int64 __pyx_v_result;\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  int __pyx_t_1;\n  PyObject *__pyx_t_2 = NULL;\n  __Pyx_RefNannySetupContext(\"__next__\", 0);\n\n  /* \"pywrapfst.pyx\":3212\n *   # Magic method used to get a Pythonic API out of the C++ API.\n *   def __next__(self):\n *     if self.done():             # <<<<<<<<<<<<<<\n *       raise StopIteration\n *     cdef int64 result = self.value()\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"done\");\n    __PYX_ERR(0, 3212, __pyx_L1_error)\n  }\n  __pyx_t_1 = (((struct __pyx_vtabstruct_9pywrapfst_StateIterator *)__pyx_v_self->__pyx_vtab)->done(__pyx_v_self, 0) != 0);\n  if (unlikely(__pyx_t_1)) {\n\n    /* \"pywrapfst.pyx\":3213\n *   def __next__(self):\n *     if self.done():\n *       raise StopIteration             # <<<<<<<<<<<<<<\n *     cdef int64 result = self.value()\n *     self.next()\n */\n    __Pyx_Raise(__pyx_builtin_StopIteration, 0, 0, 0);\n    __PYX_ERR(0, 3213, __pyx_L1_error)\n\n    /* \"pywrapfst.pyx\":3212\n *   # Magic method used to get a Pythonic API out of the C++ API.\n *   def __next__(self):\n *     if self.done():             # <<<<<<<<<<<<<<\n *       raise StopIteration\n *     cdef int64 result = self.value()\n */\n  }\n\n  /* \"pywrapfst.pyx\":3214\n *     if self.done():\n *       raise StopIteration\n *     cdef int64 result = self.value()             # <<<<<<<<<<<<<<\n *     self.next()\n *     return result\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"value\");\n    __PYX_ERR(0, 3214, __pyx_L1_error)\n  }\n  __pyx_v_result = ((struct __pyx_vtabstruct_9pywrapfst_StateIterator *)__pyx_v_self->__pyx_vtab)->value(__pyx_v_self, 0);\n\n  /* \"pywrapfst.pyx\":3215\n *       raise StopIteration\n *     cdef int64 result = self.value()\n *     self.next()             # <<<<<<<<<<<<<<\n *     return result\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"next\");\n    __PYX_ERR(0, 3215, __pyx_L1_error)\n  }\n  ((struct __pyx_vtabstruct_9pywrapfst_StateIterator *)__pyx_v_self->__pyx_vtab)->next(__pyx_v_self, 0);\n\n  /* \"pywrapfst.pyx\":3216\n *     cdef int64 result = self.value()\n *     self.next()\n *     return result             # <<<<<<<<<<<<<<\n * \n *   cpdef bool done(self):\n */\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_2 = __Pyx_PyInt_From_int64_t(__pyx_v_result); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3216, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  __pyx_r = __pyx_t_2;\n  __pyx_t_2 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":3211\n * \n *   # Magic method used to get a Pythonic API out of the C++ API.\n *   def __next__(self):             # <<<<<<<<<<<<<<\n *     if self.done():\n *       raise StopIteration\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_AddTraceback(\"pywrapfst.StateIterator.__next__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":3218\n *     return result\n * \n *   cpdef bool done(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     done(self)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_13StateIterator_9done(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic bool __pyx_f_9pywrapfst_13StateIterator_done(struct __pyx_obj_9pywrapfst_StateIterator *__pyx_v_self, int __pyx_skip_dispatch) {\n  bool __pyx_r;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  bool __pyx_t_5;\n  __Pyx_RefNannySetupContext(\"done\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_done); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3218, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_13StateIterator_9done)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3218, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3218, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __pyx_t_5 = __Pyx_PyObject_IsTrue(__pyx_t_2); if (unlikely((__pyx_t_5 == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 3218, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __pyx_r = __pyx_t_5;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":3227\n *       True if the iterator is exhausted, False otherwise.\n *     \"\"\"\n *     return self._siter.get().Done()             # <<<<<<<<<<<<<<\n * \n *   cpdef void next(self):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_siter\");\n    __PYX_ERR(0, 3227, __pyx_L1_error)\n  }\n  __pyx_r = __pyx_v_self->_siter.get()->Done();\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":3218\n *     return result\n * \n *   cpdef bool done(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     done(self)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_WriteUnraisable(\"pywrapfst.StateIterator.done\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_13StateIterator_9done(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_13StateIterator_8done[] = \"\\n    done(self)\\n\\n    Indicates whether the iterator is exhausted or not.\\n\\n    Returns:\\n      True if the iterator is exhausted, False otherwise.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_13StateIterator_9done(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"done (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_13StateIterator_8done(((struct __pyx_obj_9pywrapfst_StateIterator *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_13StateIterator_8done(struct __pyx_obj_9pywrapfst_StateIterator *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"done\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __Pyx_PyBool_FromLong(__pyx_f_9pywrapfst_13StateIterator_done(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3218, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.StateIterator.done\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":3229\n *     return self._siter.get().Done()\n * \n *   cpdef void next(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     next(self)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_13StateIterator_11next(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic void __pyx_f_9pywrapfst_13StateIterator_next(struct __pyx_obj_9pywrapfst_StateIterator *__pyx_v_self, int __pyx_skip_dispatch) {\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  __Pyx_RefNannySetupContext(\"next\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_next); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3229, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_13StateIterator_11next)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3229, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3229, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":3235\n *     Advances the iterator.\n *     \"\"\"\n *     self._siter.get().Next()             # <<<<<<<<<<<<<<\n * \n *   cpdef void reset(self):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_siter\");\n    __PYX_ERR(0, 3235, __pyx_L1_error)\n  }\n  __pyx_v_self->_siter.get()->Next();\n\n  /* \"pywrapfst.pyx\":3229\n *     return self._siter.get().Done()\n * \n *   cpdef void next(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     next(self)\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_WriteUnraisable(\"pywrapfst.StateIterator.next\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_13StateIterator_11next(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_13StateIterator_10next[] = \"\\n    next(self)\\n\\n    Advances the iterator.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_13StateIterator_11next(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"next (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_13StateIterator_10next(((struct __pyx_obj_9pywrapfst_StateIterator *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_13StateIterator_10next(struct __pyx_obj_9pywrapfst_StateIterator *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"next\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __Pyx_void_to_None(__pyx_f_9pywrapfst_13StateIterator_next(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3229, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.StateIterator.next\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":3237\n *     self._siter.get().Next()\n * \n *   cpdef void reset(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     reset(self)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_13StateIterator_13reset(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic void __pyx_f_9pywrapfst_13StateIterator_reset(struct __pyx_obj_9pywrapfst_StateIterator *__pyx_v_self, int __pyx_skip_dispatch) {\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  __Pyx_RefNannySetupContext(\"reset\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_reset); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3237, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_13StateIterator_13reset)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3237, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3237, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":3243\n *     Resets the iterator to the initial position.\n *     \"\"\"\n *     self._siter.get().Reset()             # <<<<<<<<<<<<<<\n * \n *   cpdef int64 value(self):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_siter\");\n    __PYX_ERR(0, 3243, __pyx_L1_error)\n  }\n  __pyx_v_self->_siter.get()->Reset();\n\n  /* \"pywrapfst.pyx\":3237\n *     self._siter.get().Next()\n * \n *   cpdef void reset(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     reset(self)\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_WriteUnraisable(\"pywrapfst.StateIterator.reset\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_13StateIterator_13reset(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_13StateIterator_12reset[] = \"\\n    reset(self)\\n\\n    Resets the iterator to the initial position.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_13StateIterator_13reset(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"reset (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_13StateIterator_12reset(((struct __pyx_obj_9pywrapfst_StateIterator *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_13StateIterator_12reset(struct __pyx_obj_9pywrapfst_StateIterator *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"reset\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __Pyx_void_to_None(__pyx_f_9pywrapfst_13StateIterator_reset(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3237, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.StateIterator.reset\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":3245\n *     self._siter.get().Reset()\n * \n *   cpdef int64 value(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     value(self)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_13StateIterator_15value(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic __pyx_t_10basictypes_int64 __pyx_f_9pywrapfst_13StateIterator_value(struct __pyx_obj_9pywrapfst_StateIterator *__pyx_v_self, int __pyx_skip_dispatch) {\n  __pyx_t_10basictypes_int64 __pyx_r;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  __pyx_t_10basictypes_int64 __pyx_t_5;\n  __Pyx_RefNannySetupContext(\"value\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_value); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3245, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_13StateIterator_15value)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3245, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3245, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __pyx_t_5 = __Pyx_PyInt_As_int64_t(__pyx_t_2); if (unlikely((__pyx_t_5 == ((int64_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 3245, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __pyx_r = __pyx_t_5;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":3251\n *     Returns the current state index.\n *     \"\"\"\n *     return self._siter.get().Value()             # <<<<<<<<<<<<<<\n * \n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_siter\");\n    __PYX_ERR(0, 3251, __pyx_L1_error)\n  }\n  __pyx_r = __pyx_v_self->_siter.get()->Value();\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":3245\n *     self._siter.get().Reset()\n * \n *   cpdef int64 value(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     value(self)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_WriteUnraisable(\"pywrapfst.StateIterator.value\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_13StateIterator_15value(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_13StateIterator_14value[] = \"\\n    value(self)\\n\\n    Returns the current state index.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_13StateIterator_15value(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"value (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_13StateIterator_14value(((struct __pyx_obj_9pywrapfst_StateIterator *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_13StateIterator_14value(struct __pyx_obj_9pywrapfst_StateIterator *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"value\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __Pyx_PyInt_From_int64_t(__pyx_f_9pywrapfst_13StateIterator_value(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3245, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.StateIterator.value\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"(tree fragment)\":1\n * def __reduce_cython__(self):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._fst,self._siter cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_13StateIterator_17__reduce_cython__(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_13StateIterator_17__reduce_cython__(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__reduce_cython__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_13StateIterator_16__reduce_cython__(((struct __pyx_obj_9pywrapfst_StateIterator *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_13StateIterator_16__reduce_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst_StateIterator *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"__reduce_cython__\", 0);\n\n  /* \"(tree fragment)\":2\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._fst,self._siter cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._fst,self._siter cannot be converted to a Python object for pickling\")\n */\n  __pyx_t_1 = __Pyx_PyObject_Call(__pyx_builtin_TypeError, __pyx_tuple__65, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(1, 2, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __Pyx_Raise(__pyx_t_1, 0, 0, 0);\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  __PYX_ERR(1, 2, __pyx_L1_error)\n\n  /* \"(tree fragment)\":1\n * def __reduce_cython__(self):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._fst,self._siter cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.StateIterator.__reduce_cython__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"(tree fragment)\":3\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._fst,self._siter cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._fst,self._siter cannot be converted to a Python object for pickling\")\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_13StateIterator_19__setstate_cython__(PyObject *__pyx_v_self, PyObject *__pyx_v___pyx_state); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_13StateIterator_19__setstate_cython__(PyObject *__pyx_v_self, PyObject *__pyx_v___pyx_state) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__setstate_cython__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_13StateIterator_18__setstate_cython__(((struct __pyx_obj_9pywrapfst_StateIterator *)__pyx_v_self), ((PyObject *)__pyx_v___pyx_state));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_13StateIterator_18__setstate_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst_StateIterator *__pyx_v_self, CYTHON_UNUSED PyObject *__pyx_v___pyx_state) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"__setstate_cython__\", 0);\n\n  /* \"(tree fragment)\":4\n *     raise TypeError(\"self._fst,self._siter cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._fst,self._siter cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n */\n  __pyx_t_1 = __Pyx_PyObject_Call(__pyx_builtin_TypeError, __pyx_tuple__66, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(1, 4, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __Pyx_Raise(__pyx_t_1, 0, 0, 0);\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  __PYX_ERR(1, 4, __pyx_L1_error)\n\n  /* \"(tree fragment)\":3\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._fst,self._siter cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._fst,self._siter cannot be converted to a Python object for pickling\")\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.StateIterator.__setstate_cython__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":3257\n * \n * \n * cdef _Fst _map(_Fst ifst,             # <<<<<<<<<<<<<<\n *                float delta=fst.kDelta,\n *                map_type=b\"identity\",\n */\n\nstatic struct __pyx_obj_9pywrapfst__Fst *__pyx_f_9pywrapfst__map(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst, struct __pyx_opt_args_9pywrapfst__map *__pyx_optional_args) {\n  float __pyx_v_delta = __pyx_k__67;\n  PyObject *__pyx_v_map_type = ((PyObject *)__pyx_n_b_identity);\n  double __pyx_v_power = ((double)1.);\n\n  /* \"pywrapfst.pyx\":3261\n *                map_type=b\"identity\",\n *                double power=1.,\n *                weight=None):             # <<<<<<<<<<<<<<\n *   cdef fst.MapType map_type_enum\n *   if not fst.GetMapType(tostring(map_type), addr(map_type_enum)):\n */\n  PyObject *__pyx_v_weight = ((PyObject *)Py_None);\n  enum fst::script::MapType __pyx_v_map_type_enum;\n  fst::script::WeightClass __pyx_v_wc;\n  struct __pyx_obj_9pywrapfst__Fst *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  std::string __pyx_t_1;\n  int __pyx_t_2;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  PyObject *__pyx_t_6 = NULL;\n  PyObject *__pyx_t_7 = NULL;\n  PyObject *__pyx_t_8 = NULL;\n  fst::script::WeightClass __pyx_t_9;\n  fst::script::WeightClass __pyx_t_10;\n  __Pyx_RefNannySetupContext(\"_map\", 0);\n  if (__pyx_optional_args) {\n    if (__pyx_optional_args->__pyx_n > 0) {\n      __pyx_v_delta = __pyx_optional_args->delta;\n      if (__pyx_optional_args->__pyx_n > 1) {\n        __pyx_v_map_type = __pyx_optional_args->map_type;\n        if (__pyx_optional_args->__pyx_n > 2) {\n          __pyx_v_power = __pyx_optional_args->power;\n          if (__pyx_optional_args->__pyx_n > 3) {\n            __pyx_v_weight = __pyx_optional_args->weight;\n          }\n        }\n      }\n    }\n  }\n\n  /* \"pywrapfst.pyx\":3263\n *                weight=None):\n *   cdef fst.MapType map_type_enum\n *   if not fst.GetMapType(tostring(map_type), addr(map_type_enum)):             # <<<<<<<<<<<<<<\n *     raise FstArgError(\"Unknown map type: {!r}\".format(map_type))\n *   cdef fst.WeightClass wc = (_get_WeightClass_or_One(ifst.weight_type(),\n */\n  __pyx_t_1 = __pyx_f_9pywrapfst_tostring(__pyx_v_map_type, NULL); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 3263, __pyx_L1_error)\n  __pyx_t_2 = ((!(fst::script::GetMapType(__pyx_t_1, (&__pyx_v_map_type_enum)) != 0)) != 0);\n  if (unlikely(__pyx_t_2)) {\n\n    /* \"pywrapfst.pyx\":3264\n *   cdef fst.MapType map_type_enum\n *   if not fst.GetMapType(tostring(map_type), addr(map_type_enum)):\n *     raise FstArgError(\"Unknown map type: {!r}\".format(map_type))             # <<<<<<<<<<<<<<\n *   cdef fst.WeightClass wc = (_get_WeightClass_or_One(ifst.weight_type(),\n *       weight) if map_type_enum == fst.TIMES_MAPPER else\n */\n    __pyx_t_4 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstArgError); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 3264, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_4);\n    __pyx_t_6 = __Pyx_PyObject_GetAttrStr(__pyx_kp_s_Unknown_map_type_r, __pyx_n_s_format); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 3264, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_6);\n    __pyx_t_7 = NULL;\n    if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_6))) {\n      __pyx_t_7 = PyMethod_GET_SELF(__pyx_t_6);\n      if (likely(__pyx_t_7)) {\n        PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_6);\n        __Pyx_INCREF(__pyx_t_7);\n        __Pyx_INCREF(function);\n        __Pyx_DECREF_SET(__pyx_t_6, function);\n      }\n    }\n    if (!__pyx_t_7) {\n      __pyx_t_5 = __Pyx_PyObject_CallOneArg(__pyx_t_6, __pyx_v_map_type); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 3264, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_5);\n    } else {\n      #if CYTHON_FAST_PYCALL\n      if (PyFunction_Check(__pyx_t_6)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_7, __pyx_v_map_type};\n        __pyx_t_5 = __Pyx_PyFunction_FastCall(__pyx_t_6, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 3264, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_7); __pyx_t_7 = 0;\n        __Pyx_GOTREF(__pyx_t_5);\n      } else\n      #endif\n      #if CYTHON_FAST_PYCCALL\n      if (__Pyx_PyFastCFunction_Check(__pyx_t_6)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_7, __pyx_v_map_type};\n        __pyx_t_5 = __Pyx_PyCFunction_FastCall(__pyx_t_6, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 3264, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_7); __pyx_t_7 = 0;\n        __Pyx_GOTREF(__pyx_t_5);\n      } else\n      #endif\n      {\n        __pyx_t_8 = PyTuple_New(1+1); if (unlikely(!__pyx_t_8)) __PYX_ERR(0, 3264, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_8);\n        __Pyx_GIVEREF(__pyx_t_7); PyTuple_SET_ITEM(__pyx_t_8, 0, __pyx_t_7); __pyx_t_7 = NULL;\n        __Pyx_INCREF(__pyx_v_map_type);\n        __Pyx_GIVEREF(__pyx_v_map_type);\n        PyTuple_SET_ITEM(__pyx_t_8, 0+1, __pyx_v_map_type);\n        __pyx_t_5 = __Pyx_PyObject_Call(__pyx_t_6, __pyx_t_8, NULL); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 3264, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_5);\n        __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0;\n      }\n    }\n    __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n    __pyx_t_6 = NULL;\n    if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_4))) {\n      __pyx_t_6 = PyMethod_GET_SELF(__pyx_t_4);\n      if (likely(__pyx_t_6)) {\n        PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_4);\n        __Pyx_INCREF(__pyx_t_6);\n        __Pyx_INCREF(function);\n        __Pyx_DECREF_SET(__pyx_t_4, function);\n      }\n    }\n    if (!__pyx_t_6) {\n      __pyx_t_3 = __Pyx_PyObject_CallOneArg(__pyx_t_4, __pyx_t_5); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 3264, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n      __Pyx_GOTREF(__pyx_t_3);\n    } else {\n      #if CYTHON_FAST_PYCALL\n      if (PyFunction_Check(__pyx_t_4)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_6, __pyx_t_5};\n        __pyx_t_3 = __Pyx_PyFunction_FastCall(__pyx_t_4, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 3264, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_6); __pyx_t_6 = 0;\n        __Pyx_GOTREF(__pyx_t_3);\n        __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n      } else\n      #endif\n      #if CYTHON_FAST_PYCCALL\n      if (__Pyx_PyFastCFunction_Check(__pyx_t_4)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_6, __pyx_t_5};\n        __pyx_t_3 = __Pyx_PyCFunction_FastCall(__pyx_t_4, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 3264, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_6); __pyx_t_6 = 0;\n        __Pyx_GOTREF(__pyx_t_3);\n        __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n      } else\n      #endif\n      {\n        __pyx_t_8 = PyTuple_New(1+1); if (unlikely(!__pyx_t_8)) __PYX_ERR(0, 3264, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_8);\n        __Pyx_GIVEREF(__pyx_t_6); PyTuple_SET_ITEM(__pyx_t_8, 0, __pyx_t_6); __pyx_t_6 = NULL;\n        __Pyx_GIVEREF(__pyx_t_5);\n        PyTuple_SET_ITEM(__pyx_t_8, 0+1, __pyx_t_5);\n        __pyx_t_5 = 0;\n        __pyx_t_3 = __Pyx_PyObject_Call(__pyx_t_4, __pyx_t_8, NULL); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 3264, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_3);\n        __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0;\n      }\n    }\n    __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n    __Pyx_Raise(__pyx_t_3, 0, 0, 0);\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    __PYX_ERR(0, 3264, __pyx_L1_error)\n\n    /* \"pywrapfst.pyx\":3263\n *                weight=None):\n *   cdef fst.MapType map_type_enum\n *   if not fst.GetMapType(tostring(map_type), addr(map_type_enum)):             # <<<<<<<<<<<<<<\n *     raise FstArgError(\"Unknown map type: {!r}\".format(map_type))\n *   cdef fst.WeightClass wc = (_get_WeightClass_or_One(ifst.weight_type(),\n */\n  }\n\n  /* \"pywrapfst.pyx\":3266\n *     raise FstArgError(\"Unknown map type: {!r}\".format(map_type))\n *   cdef fst.WeightClass wc = (_get_WeightClass_or_One(ifst.weight_type(),\n *       weight) if map_type_enum == fst.TIMES_MAPPER else             # <<<<<<<<<<<<<<\n *       _get_WeightClass_or_Zero(ifst.weight_type(), weight))\n *   return _init_XFst(fst.Map(deref(ifst._fst), map_type_enum, delta, power, wc))\n */\n  if (((__pyx_v_map_type_enum == fst::script::TIMES_MAPPER) != 0)) {\n\n    /* \"pywrapfst.pyx\":3265\n *   if not fst.GetMapType(tostring(map_type), addr(map_type_enum)):\n *     raise FstArgError(\"Unknown map type: {!r}\".format(map_type))\n *   cdef fst.WeightClass wc = (_get_WeightClass_or_One(ifst.weight_type(),             # <<<<<<<<<<<<<<\n *       weight) if map_type_enum == fst.TIMES_MAPPER else\n *       _get_WeightClass_or_Zero(ifst.weight_type(), weight))\n */\n    if (unlikely(((PyObject *)__pyx_v_ifst) == Py_None)) {\n      PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"weight_type\");\n      __PYX_ERR(0, 3265, __pyx_L1_error)\n    }\n\n    /* \"pywrapfst.pyx\":3266\n *     raise FstArgError(\"Unknown map type: {!r}\".format(map_type))\n *   cdef fst.WeightClass wc = (_get_WeightClass_or_One(ifst.weight_type(),\n *       weight) if map_type_enum == fst.TIMES_MAPPER else             # <<<<<<<<<<<<<<\n *       _get_WeightClass_or_Zero(ifst.weight_type(), weight))\n *   return _init_XFst(fst.Map(deref(ifst._fst), map_type_enum, delta, power, wc))\n */\n    __pyx_t_10 = __pyx_f_9pywrapfst__get_WeightClass_or_One(((struct __pyx_vtabstruct_9pywrapfst__Fst *)__pyx_v_ifst->__pyx_vtab)->weight_type(__pyx_v_ifst, 0), __pyx_v_weight); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 3265, __pyx_L1_error)\n    __pyx_t_9 = __pyx_t_10;\n  } else {\n\n    /* \"pywrapfst.pyx\":3267\n *   cdef fst.WeightClass wc = (_get_WeightClass_or_One(ifst.weight_type(),\n *       weight) if map_type_enum == fst.TIMES_MAPPER else\n *       _get_WeightClass_or_Zero(ifst.weight_type(), weight))             # <<<<<<<<<<<<<<\n *   return _init_XFst(fst.Map(deref(ifst._fst), map_type_enum, delta, power, wc))\n * \n */\n    if (unlikely(((PyObject *)__pyx_v_ifst) == Py_None)) {\n      PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"weight_type\");\n      __PYX_ERR(0, 3267, __pyx_L1_error)\n    }\n    __pyx_t_10 = __pyx_f_9pywrapfst__get_WeightClass_or_Zero(((struct __pyx_vtabstruct_9pywrapfst__Fst *)__pyx_v_ifst->__pyx_vtab)->weight_type(__pyx_v_ifst, 0), __pyx_v_weight); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 3267, __pyx_L1_error)\n    __pyx_t_9 = __pyx_t_10;\n  }\n  __pyx_v_wc = __pyx_t_9;\n\n  /* \"pywrapfst.pyx\":3268\n *       weight) if map_type_enum == fst.TIMES_MAPPER else\n *       _get_WeightClass_or_Zero(ifst.weight_type(), weight))\n *   return _init_XFst(fst.Map(deref(ifst._fst), map_type_enum, delta, power, wc))             # <<<<<<<<<<<<<<\n * \n * \n */\n  __Pyx_XDECREF(((PyObject *)__pyx_r));\n  if (unlikely(((PyObject *)__pyx_v_ifst) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 3268, __pyx_L1_error)\n  }\n  __pyx_t_3 = ((PyObject *)__pyx_f_9pywrapfst__init_XFst(fst::script::Map((*__pyx_v_ifst->_fst), __pyx_v_map_type_enum, __pyx_v_delta, __pyx_v_power, __pyx_v_wc))); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 3268, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_3);\n  __pyx_r = ((struct __pyx_obj_9pywrapfst__Fst *)__pyx_t_3);\n  __pyx_t_3 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":3257\n * \n * \n * cdef _Fst _map(_Fst ifst,             # <<<<<<<<<<<<<<\n *                float delta=fst.kDelta,\n *                map_type=b\"identity\",\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_XDECREF(__pyx_t_6);\n  __Pyx_XDECREF(__pyx_t_7);\n  __Pyx_XDECREF(__pyx_t_8);\n  __Pyx_AddTraceback(\"pywrapfst._map\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XGIVEREF((PyObject *)__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":3271\n * \n * \n * cpdef _Fst arcmap(_Fst ifst,             # <<<<<<<<<<<<<<\n *                   float delta=fst.kDelta,\n *                   map_type=b\"identity\",\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_17arcmap(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic struct __pyx_obj_9pywrapfst__Fst *__pyx_f_9pywrapfst_arcmap(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst, CYTHON_UNUSED int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_arcmap *__pyx_optional_args) {\n  float __pyx_v_delta = __pyx_k__68;\n  PyObject *__pyx_v_map_type = ((PyObject *)__pyx_n_b_identity);\n  double __pyx_v_power = ((double)1.);\n\n  /* \"pywrapfst.pyx\":3275\n *                   map_type=b\"identity\",\n *                   double power=1.,\n *                   weight=None):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   arcmap(ifst, delta=0.0009765625, map_type=\"identity\", weight=None)\n */\n  PyObject *__pyx_v_weight = ((PyObject *)Py_None);\n  struct __pyx_obj_9pywrapfst__Fst *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  struct __pyx_opt_args_9pywrapfst__map __pyx_t_2;\n  __Pyx_RefNannySetupContext(\"arcmap\", 0);\n  if (__pyx_optional_args) {\n    if (__pyx_optional_args->__pyx_n > 0) {\n      __pyx_v_delta = __pyx_optional_args->delta;\n      if (__pyx_optional_args->__pyx_n > 1) {\n        __pyx_v_map_type = __pyx_optional_args->map_type;\n        if (__pyx_optional_args->__pyx_n > 2) {\n          __pyx_v_power = __pyx_optional_args->power;\n          if (__pyx_optional_args->__pyx_n > 3) {\n            __pyx_v_weight = __pyx_optional_args->weight;\n          }\n        }\n      }\n    }\n  }\n\n  /* \"pywrapfst.pyx\":3318\n *   See also: `statemap`.\n *   \"\"\"\n *   return _map(ifst, delta, map_type, power, weight)             # <<<<<<<<<<<<<<\n * \n * \n */\n  __Pyx_XDECREF(((PyObject *)__pyx_r));\n  __pyx_t_2.__pyx_n = 4;\n  __pyx_t_2.delta = __pyx_v_delta;\n  __pyx_t_2.map_type = __pyx_v_map_type;\n  __pyx_t_2.power = __pyx_v_power;\n  __pyx_t_2.weight = __pyx_v_weight;\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst__map(__pyx_v_ifst, &__pyx_t_2)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3318, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = ((struct __pyx_obj_9pywrapfst__Fst *)__pyx_t_1);\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":3271\n * \n * \n * cpdef _Fst arcmap(_Fst ifst,             # <<<<<<<<<<<<<<\n *                   float delta=fst.kDelta,\n *                   map_type=b\"identity\",\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.arcmap\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XGIVEREF((PyObject *)__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_17arcmap(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic char __pyx_doc_9pywrapfst_16arcmap[] = \"\\n  arcmap(ifst, delta=0.0009765625, map_type=\\\"identity\\\", weight=None)\\n\\n  Constructively applies a transform to all arcs and final states.\\n\\n  This operation transforms each arc and final state in the input FST using\\n  one of the following:\\n\\n    * identity: maps to self.\\n    * input_epsilon: replaces all input labels with epsilon.\\n    * invert: reciprocates all non-Zero weights.\\n    * float_power: raises all weights to a floating-point power.\\n    * output_epsilon: replaces all output labels with epsilon.\\n    * quantize: quantizes weights.\\n    * plus: adds a constant to all weights.\\n    * power: raises all weights to an integral power.\\n    * rmweight: replaces all non-Zero weights with 1.\\n    * superfinal: redirects final states to a new superfinal state.\\n    * times: right-multiplies a constant to all weights.\\n    * to_log: converts weights to the log semiring.\\n    * to_log64: converts weights to the log64 semiring.\\n    * to_standard: converts weights to the tropical (\\\"standard\\\") semiring.\\n\\n  Args:\\n    ifst: The input FST.\\n    delta: Comparison/quantization delta (ignored unless `map_type` is\\n        `quantize`).\\n    map_type: A string matching a known mapping operation (see above).\\n    power: A positive scalar or integer power; ignored unless `map_type` is\\n        `float_power` or `power` (in which case it defaults to 1).\\n    weight: A Weight or weight string passed to the arc-mapper; ignored unless\\n        `map_type` is `plus` (in which case it defaults to semiring Zero) or\\n        `times` (in which case it defaults to semiring One).\\n\\n  Returns:\\n    An FST with arcs and final states remapped.\\n\\n  Raises:\\n    FstArgError: Unknown map type.\\n\\n  See also: `statemap`.\\n  \";\nstatic PyObject *__pyx_pw_9pywrapfst_17arcmap(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst = 0;\n  float __pyx_v_delta;\n  PyObject *__pyx_v_map_type = 0;\n  double __pyx_v_power;\n  PyObject *__pyx_v_weight = 0;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"arcmap (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_ifst,&__pyx_n_s_delta,&__pyx_n_s_map_type,&__pyx_n_s_power,&__pyx_n_s_weight,0};\n    PyObject* values[5] = {0,0,0,0,0};\n    values[2] = ((PyObject *)__pyx_n_b_identity);\n\n    /* \"pywrapfst.pyx\":3275\n *                   map_type=b\"identity\",\n *                   double power=1.,\n *                   weight=None):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   arcmap(ifst, delta=0.0009765625, map_type=\"identity\", weight=None)\n */\n    values[4] = ((PyObject *)Py_None);\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  5: values[4] = PyTuple_GET_ITEM(__pyx_args, 4);\n        CYTHON_FALLTHROUGH;\n        case  4: values[3] = PyTuple_GET_ITEM(__pyx_args, 3);\n        CYTHON_FALLTHROUGH;\n        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);\n        CYTHON_FALLTHROUGH;\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (likely((values[0] = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_ifst)) != 0)) kw_args--;\n        else goto __pyx_L5_argtuple_error;\n        CYTHON_FALLTHROUGH;\n        case  1:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_delta);\n          if (value) { values[1] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  2:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_map_type);\n          if (value) { values[2] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  3:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_power);\n          if (value) { values[3] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  4:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_weight);\n          if (value) { values[4] = value; kw_args--; }\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"arcmap\") < 0)) __PYX_ERR(0, 3271, __pyx_L3_error)\n      }\n    } else {\n      switch (PyTuple_GET_SIZE(__pyx_args)) {\n        case  5: values[4] = PyTuple_GET_ITEM(__pyx_args, 4);\n        CYTHON_FALLTHROUGH;\n        case  4: values[3] = PyTuple_GET_ITEM(__pyx_args, 3);\n        CYTHON_FALLTHROUGH;\n        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);\n        CYTHON_FALLTHROUGH;\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n    }\n    __pyx_v_ifst = ((struct __pyx_obj_9pywrapfst__Fst *)values[0]);\n    if (values[1]) {\n      __pyx_v_delta = __pyx_PyFloat_AsFloat(values[1]); if (unlikely((__pyx_v_delta == (float)-1) && PyErr_Occurred())) __PYX_ERR(0, 3272, __pyx_L3_error)\n    } else {\n      __pyx_v_delta = __pyx_k__68;\n    }\n    __pyx_v_map_type = values[2];\n    if (values[3]) {\n      __pyx_v_power = __pyx_PyFloat_AsDouble(values[3]); if (unlikely((__pyx_v_power == (double)-1) && PyErr_Occurred())) __PYX_ERR(0, 3274, __pyx_L3_error)\n    } else {\n      __pyx_v_power = ((double)1.);\n    }\n    __pyx_v_weight = values[4];\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"arcmap\", 0, 1, 5, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 3271, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst.arcmap\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_ifst), __pyx_ptype_9pywrapfst__Fst, 1, \"ifst\", 0))) __PYX_ERR(0, 3271, __pyx_L1_error)\n  __pyx_r = __pyx_pf_9pywrapfst_16arcmap(__pyx_self, __pyx_v_ifst, __pyx_v_delta, __pyx_v_map_type, __pyx_v_power, __pyx_v_weight);\n\n  /* \"pywrapfst.pyx\":3271\n * \n * \n * cpdef _Fst arcmap(_Fst ifst,             # <<<<<<<<<<<<<<\n *                   float delta=fst.kDelta,\n *                   map_type=b\"identity\",\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_16arcmap(CYTHON_UNUSED PyObject *__pyx_self, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst, float __pyx_v_delta, PyObject *__pyx_v_map_type, double __pyx_v_power, PyObject *__pyx_v_weight) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  struct __pyx_opt_args_9pywrapfst_arcmap __pyx_t_2;\n  __Pyx_RefNannySetupContext(\"arcmap\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_2.__pyx_n = 4;\n  __pyx_t_2.delta = __pyx_v_delta;\n  __pyx_t_2.map_type = __pyx_v_map_type;\n  __pyx_t_2.power = __pyx_v_power;\n  __pyx_t_2.weight = __pyx_v_weight;\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst_arcmap(__pyx_v_ifst, 0, &__pyx_t_2)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3271, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.arcmap\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":3321\n * \n * \n * cpdef _MutableFst compose(_Fst ifst1,             # <<<<<<<<<<<<<<\n *                           _Fst ifst2,\n *                           compose_filter=b\"auto\",\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_19compose(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic struct __pyx_obj_9pywrapfst__MutableFst *__pyx_f_9pywrapfst_compose(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst1, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst2, CYTHON_UNUSED int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_compose *__pyx_optional_args) {\n  PyObject *__pyx_v_compose_filter = ((PyObject *)__pyx_n_b_auto);\n\n  /* \"pywrapfst.pyx\":3324\n *                           _Fst ifst2,\n *                           compose_filter=b\"auto\",\n *                           bool connect=True):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   compose(ifst1, ifst2, compose_filter=\"auto\", connect=True)\n */\n  bool __pyx_v_connect = ((bool)1);\n  std::unique_ptr<fst::script::VectorFstClass>  __pyx_v_tfst;\n  std::unique_ptr<fst::ComposeOptions>  __pyx_v_opts;\n  struct __pyx_obj_9pywrapfst__MutableFst *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  std::string __pyx_t_1;\n  enum fst::ComposeFilter __pyx_t_2;\n  PyObject *__pyx_t_3 = NULL;\n  __Pyx_RefNannySetupContext(\"compose\", 0);\n  if (__pyx_optional_args) {\n    if (__pyx_optional_args->__pyx_n > 0) {\n      __pyx_v_compose_filter = __pyx_optional_args->compose_filter;\n      if (__pyx_optional_args->__pyx_n > 1) {\n        __pyx_v_connect = __pyx_optional_args->connect;\n      }\n    }\n  }\n\n  /* \"pywrapfst.pyx\":3349\n *   \"\"\"\n *   cdef unique_ptr[fst.VectorFstClass] tfst\n *   tfst.reset(new fst.VectorFstClass(ifst1.arc_type()))             # <<<<<<<<<<<<<<\n *   cdef unique_ptr[fst.ComposeOptions] opts\n *   opts.reset(new fst.ComposeOptions(connect,\n */\n  if (unlikely(((PyObject *)__pyx_v_ifst1) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"arc_type\");\n    __PYX_ERR(0, 3349, __pyx_L1_error)\n  }\n  __pyx_v_tfst.reset(new fst::script::VectorFstClass(((struct __pyx_vtabstruct_9pywrapfst__Fst *)__pyx_v_ifst1->__pyx_vtab)->arc_type(__pyx_v_ifst1, 0)));\n\n  /* \"pywrapfst.pyx\":3352\n *   cdef unique_ptr[fst.ComposeOptions] opts\n *   opts.reset(new fst.ComposeOptions(connect,\n *       _get_compose_filter(tostring(compose_filter))))             # <<<<<<<<<<<<<<\n *   fst.Compose(deref(ifst1._fst), deref(ifst2._fst), tfst.get(), deref(opts))\n *   return _init_MutableFst(tfst.release())\n */\n  __pyx_t_1 = __pyx_f_9pywrapfst_tostring(__pyx_v_compose_filter, NULL); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 3352, __pyx_L1_error)\n  __pyx_t_2 = __pyx_f_9pywrapfst__get_compose_filter(__pyx_t_1); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 3352, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":3351\n *   tfst.reset(new fst.VectorFstClass(ifst1.arc_type()))\n *   cdef unique_ptr[fst.ComposeOptions] opts\n *   opts.reset(new fst.ComposeOptions(connect,             # <<<<<<<<<<<<<<\n *       _get_compose_filter(tostring(compose_filter))))\n *   fst.Compose(deref(ifst1._fst), deref(ifst2._fst), tfst.get(), deref(opts))\n */\n  __pyx_v_opts.reset(new fst::ComposeOptions(__pyx_v_connect, __pyx_t_2));\n\n  /* \"pywrapfst.pyx\":3353\n *   opts.reset(new fst.ComposeOptions(connect,\n *       _get_compose_filter(tostring(compose_filter))))\n *   fst.Compose(deref(ifst1._fst), deref(ifst2._fst), tfst.get(), deref(opts))             # <<<<<<<<<<<<<<\n *   return _init_MutableFst(tfst.release())\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_ifst1) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 3353, __pyx_L1_error)\n  }\n  if (unlikely(((PyObject *)__pyx_v_ifst2) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 3353, __pyx_L1_error)\n  }\n  fst::script::Compose((*__pyx_v_ifst1->_fst), (*__pyx_v_ifst2->_fst), __pyx_v_tfst.get(), (*__pyx_v_opts));\n\n  /* \"pywrapfst.pyx\":3354\n *       _get_compose_filter(tostring(compose_filter))))\n *   fst.Compose(deref(ifst1._fst), deref(ifst2._fst), tfst.get(), deref(opts))\n *   return _init_MutableFst(tfst.release())             # <<<<<<<<<<<<<<\n * \n * \n */\n  __Pyx_XDECREF(((PyObject *)__pyx_r));\n  __pyx_t_3 = ((PyObject *)__pyx_f_9pywrapfst__init_MutableFst(__pyx_v_tfst.release())); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 3354, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_3);\n  __pyx_r = ((struct __pyx_obj_9pywrapfst__MutableFst *)__pyx_t_3);\n  __pyx_t_3 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":3321\n * \n * \n * cpdef _MutableFst compose(_Fst ifst1,             # <<<<<<<<<<<<<<\n *                           _Fst ifst2,\n *                           compose_filter=b\"auto\",\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_AddTraceback(\"pywrapfst.compose\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XGIVEREF((PyObject *)__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_19compose(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic char __pyx_doc_9pywrapfst_18compose[] = \"\\n  compose(ifst1, ifst2, compose_filter=\\\"auto\\\", connect=True)\\n\\n  Constructively composes two FSTs.\\n\\n  This operation computes the composition of two FSTs. If A transduces string\\n  x to y with weight a and B transduces y to z with weight b, then their\\n  composition transduces string x to z with weight a \\\\otimes b. The output\\n  labels of the first transducer or the input labels of the second transducer\\n  must be sorted (or otherwise support appropriate matchers).\\n\\n  Args:\\n    ifst1: The first input FST.\\n    ifst2: The second input FST.\\n    compose_filter: A string matching a known composition filter; one of:\\n        \\\"alt_sequence\\\", \\\"auto\\\", \\\"match\\\", \\\"null\\\", \\\"sequence\\\", \\\"trivial\\\".\\n    connect: Should output be trimmed?\\n\\n  Returns:\\n    An FST.\\n\\n  See also: `arcsort`.\\n  \";\nstatic PyObject *__pyx_pw_9pywrapfst_19compose(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst1 = 0;\n  struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst2 = 0;\n  PyObject *__pyx_v_compose_filter = 0;\n  bool __pyx_v_connect;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"compose (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_ifst1,&__pyx_n_s_ifst2,&__pyx_n_s_compose_filter,&__pyx_n_s_connect,0};\n    PyObject* values[4] = {0,0,0,0};\n    values[2] = ((PyObject *)__pyx_n_b_auto);\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  4: values[3] = PyTuple_GET_ITEM(__pyx_args, 3);\n        CYTHON_FALLTHROUGH;\n        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);\n        CYTHON_FALLTHROUGH;\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (likely((values[0] = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_ifst1)) != 0)) kw_args--;\n        else goto __pyx_L5_argtuple_error;\n        CYTHON_FALLTHROUGH;\n        case  1:\n        if (likely((values[1] = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_ifst2)) != 0)) kw_args--;\n        else {\n          __Pyx_RaiseArgtupleInvalid(\"compose\", 0, 2, 4, 1); __PYX_ERR(0, 3321, __pyx_L3_error)\n        }\n        CYTHON_FALLTHROUGH;\n        case  2:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_compose_filter);\n          if (value) { values[2] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  3:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_connect);\n          if (value) { values[3] = value; kw_args--; }\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"compose\") < 0)) __PYX_ERR(0, 3321, __pyx_L3_error)\n      }\n    } else {\n      switch (PyTuple_GET_SIZE(__pyx_args)) {\n        case  4: values[3] = PyTuple_GET_ITEM(__pyx_args, 3);\n        CYTHON_FALLTHROUGH;\n        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);\n        CYTHON_FALLTHROUGH;\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n    }\n    __pyx_v_ifst1 = ((struct __pyx_obj_9pywrapfst__Fst *)values[0]);\n    __pyx_v_ifst2 = ((struct __pyx_obj_9pywrapfst__Fst *)values[1]);\n    __pyx_v_compose_filter = values[2];\n    if (values[3]) {\n      __pyx_v_connect = __Pyx_PyObject_IsTrue(values[3]); if (unlikely((__pyx_v_connect == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 3324, __pyx_L3_error)\n    } else {\n\n      /* \"pywrapfst.pyx\":3324\n *                           _Fst ifst2,\n *                           compose_filter=b\"auto\",\n *                           bool connect=True):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   compose(ifst1, ifst2, compose_filter=\"auto\", connect=True)\n */\n      __pyx_v_connect = ((bool)1);\n    }\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"compose\", 0, 2, 4, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 3321, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst.compose\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_ifst1), __pyx_ptype_9pywrapfst__Fst, 1, \"ifst1\", 0))) __PYX_ERR(0, 3321, __pyx_L1_error)\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_ifst2), __pyx_ptype_9pywrapfst__Fst, 1, \"ifst2\", 0))) __PYX_ERR(0, 3322, __pyx_L1_error)\n  __pyx_r = __pyx_pf_9pywrapfst_18compose(__pyx_self, __pyx_v_ifst1, __pyx_v_ifst2, __pyx_v_compose_filter, __pyx_v_connect);\n\n  /* \"pywrapfst.pyx\":3321\n * \n * \n * cpdef _MutableFst compose(_Fst ifst1,             # <<<<<<<<<<<<<<\n *                           _Fst ifst2,\n *                           compose_filter=b\"auto\",\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_18compose(CYTHON_UNUSED PyObject *__pyx_self, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst1, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst2, PyObject *__pyx_v_compose_filter, bool __pyx_v_connect) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  struct __pyx_opt_args_9pywrapfst_compose __pyx_t_2;\n  __Pyx_RefNannySetupContext(\"compose\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_2.__pyx_n = 2;\n  __pyx_t_2.compose_filter = __pyx_v_compose_filter;\n  __pyx_t_2.connect = __pyx_v_connect;\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst_compose(__pyx_v_ifst1, __pyx_v_ifst2, 0, &__pyx_t_2)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3321, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.compose\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":3357\n * \n * \n * cpdef _Fst convert(_Fst ifst, fst_type=None):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   convert(ifst, fst_type=None)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_21convert(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic struct __pyx_obj_9pywrapfst__Fst *__pyx_f_9pywrapfst_convert(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst, CYTHON_UNUSED int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_convert *__pyx_optional_args) {\n  PyObject *__pyx_v_fst_type = ((PyObject *)Py_None);\n  std::string __pyx_v_fst_type_string;\n  std::unique_ptr<fst::script::FstClass>  __pyx_v_tfst;\n  struct __pyx_obj_9pywrapfst__Fst *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  std::string __pyx_t_1;\n  int __pyx_t_2;\n  std::string __pyx_t_3;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  PyObject *__pyx_t_6 = NULL;\n  PyObject *__pyx_t_7 = NULL;\n  PyObject *__pyx_t_8 = NULL;\n  PyObject *__pyx_t_9 = NULL;\n  __Pyx_RefNannySetupContext(\"convert\", 0);\n  if (__pyx_optional_args) {\n    if (__pyx_optional_args->__pyx_n > 0) {\n      __pyx_v_fst_type = __pyx_optional_args->fst_type;\n    }\n  }\n\n  /* \"pywrapfst.pyx\":3374\n *     FstOpError: Conversion failed.\n *   \"\"\"\n *   cdef string fst_type_string = b\"\" if fst_type is None else tostring(fst_type)             # <<<<<<<<<<<<<<\n *   cdef unique_ptr[fst.FstClass] tfst\n *   tfst.reset(fst.Convert(deref(ifst._fst), fst_type_string))\n */\n  __pyx_t_2 = (__pyx_v_fst_type == Py_None);\n  if ((__pyx_t_2 != 0)) {\n    __pyx_t_3 = __pyx_convert_string_from_py_std__in_string(__pyx_kp_b__24); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 3374, __pyx_L1_error)\n    __pyx_t_1 = __pyx_t_3;\n  } else {\n    __pyx_t_3 = __pyx_f_9pywrapfst_tostring(__pyx_v_fst_type, NULL); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 3374, __pyx_L1_error)\n    __pyx_t_4 = __pyx_convert_PyBytes_string_to_py_std__in_string(__pyx_t_3); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 3374, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_4);\n    __pyx_t_3 = __pyx_convert_string_from_py_std__in_string(__pyx_t_4); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 3374, __pyx_L1_error)\n    __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n    __pyx_t_1 = __pyx_t_3;\n  }\n  __pyx_v_fst_type_string = __pyx_t_1;\n\n  /* \"pywrapfst.pyx\":3376\n *   cdef string fst_type_string = b\"\" if fst_type is None else tostring(fst_type)\n *   cdef unique_ptr[fst.FstClass] tfst\n *   tfst.reset(fst.Convert(deref(ifst._fst), fst_type_string))             # <<<<<<<<<<<<<<\n *   # Script-land Convert returns a null pointer to signal failure.\n *   if tfst.get() == NULL:\n */\n  if (unlikely(((PyObject *)__pyx_v_ifst) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 3376, __pyx_L1_error)\n  }\n  __pyx_v_tfst.reset(fst::script::Convert((*__pyx_v_ifst->_fst), __pyx_v_fst_type_string));\n\n  /* \"pywrapfst.pyx\":3378\n *   tfst.reset(fst.Convert(deref(ifst._fst), fst_type_string))\n *   # Script-land Convert returns a null pointer to signal failure.\n *   if tfst.get() == NULL:             # <<<<<<<<<<<<<<\n *     raise FstOpError(\"Conversion to {!r} failed\".format(fst_type))\n *   return _init_XFst(tfst.release())\n */\n  __pyx_t_2 = ((__pyx_v_tfst.get() == NULL) != 0);\n  if (unlikely(__pyx_t_2)) {\n\n    /* \"pywrapfst.pyx\":3379\n *   # Script-land Convert returns a null pointer to signal failure.\n *   if tfst.get() == NULL:\n *     raise FstOpError(\"Conversion to {!r} failed\".format(fst_type))             # <<<<<<<<<<<<<<\n *   return _init_XFst(tfst.release())\n * \n */\n    __pyx_t_5 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstOpError); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 3379, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_5);\n    __pyx_t_7 = __Pyx_PyObject_GetAttrStr(__pyx_kp_s_Conversion_to_r_failed, __pyx_n_s_format); if (unlikely(!__pyx_t_7)) __PYX_ERR(0, 3379, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_7);\n    __pyx_t_8 = NULL;\n    if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_7))) {\n      __pyx_t_8 = PyMethod_GET_SELF(__pyx_t_7);\n      if (likely(__pyx_t_8)) {\n        PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_7);\n        __Pyx_INCREF(__pyx_t_8);\n        __Pyx_INCREF(function);\n        __Pyx_DECREF_SET(__pyx_t_7, function);\n      }\n    }\n    if (!__pyx_t_8) {\n      __pyx_t_6 = __Pyx_PyObject_CallOneArg(__pyx_t_7, __pyx_v_fst_type); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 3379, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_6);\n    } else {\n      #if CYTHON_FAST_PYCALL\n      if (PyFunction_Check(__pyx_t_7)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_8, __pyx_v_fst_type};\n        __pyx_t_6 = __Pyx_PyFunction_FastCall(__pyx_t_7, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 3379, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_8); __pyx_t_8 = 0;\n        __Pyx_GOTREF(__pyx_t_6);\n      } else\n      #endif\n      #if CYTHON_FAST_PYCCALL\n      if (__Pyx_PyFastCFunction_Check(__pyx_t_7)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_8, __pyx_v_fst_type};\n        __pyx_t_6 = __Pyx_PyCFunction_FastCall(__pyx_t_7, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 3379, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_8); __pyx_t_8 = 0;\n        __Pyx_GOTREF(__pyx_t_6);\n      } else\n      #endif\n      {\n        __pyx_t_9 = PyTuple_New(1+1); if (unlikely(!__pyx_t_9)) __PYX_ERR(0, 3379, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_9);\n        __Pyx_GIVEREF(__pyx_t_8); PyTuple_SET_ITEM(__pyx_t_9, 0, __pyx_t_8); __pyx_t_8 = NULL;\n        __Pyx_INCREF(__pyx_v_fst_type);\n        __Pyx_GIVEREF(__pyx_v_fst_type);\n        PyTuple_SET_ITEM(__pyx_t_9, 0+1, __pyx_v_fst_type);\n        __pyx_t_6 = __Pyx_PyObject_Call(__pyx_t_7, __pyx_t_9, NULL); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 3379, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_6);\n        __Pyx_DECREF(__pyx_t_9); __pyx_t_9 = 0;\n      }\n    }\n    __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0;\n    __pyx_t_7 = NULL;\n    if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_5))) {\n      __pyx_t_7 = PyMethod_GET_SELF(__pyx_t_5);\n      if (likely(__pyx_t_7)) {\n        PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_5);\n        __Pyx_INCREF(__pyx_t_7);\n        __Pyx_INCREF(function);\n        __Pyx_DECREF_SET(__pyx_t_5, function);\n      }\n    }\n    if (!__pyx_t_7) {\n      __pyx_t_4 = __Pyx_PyObject_CallOneArg(__pyx_t_5, __pyx_t_6); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 3379, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n      __Pyx_GOTREF(__pyx_t_4);\n    } else {\n      #if CYTHON_FAST_PYCALL\n      if (PyFunction_Check(__pyx_t_5)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_7, __pyx_t_6};\n        __pyx_t_4 = __Pyx_PyFunction_FastCall(__pyx_t_5, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 3379, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_7); __pyx_t_7 = 0;\n        __Pyx_GOTREF(__pyx_t_4);\n        __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n      } else\n      #endif\n      #if CYTHON_FAST_PYCCALL\n      if (__Pyx_PyFastCFunction_Check(__pyx_t_5)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_7, __pyx_t_6};\n        __pyx_t_4 = __Pyx_PyCFunction_FastCall(__pyx_t_5, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 3379, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_7); __pyx_t_7 = 0;\n        __Pyx_GOTREF(__pyx_t_4);\n        __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n      } else\n      #endif\n      {\n        __pyx_t_9 = PyTuple_New(1+1); if (unlikely(!__pyx_t_9)) __PYX_ERR(0, 3379, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_9);\n        __Pyx_GIVEREF(__pyx_t_7); PyTuple_SET_ITEM(__pyx_t_9, 0, __pyx_t_7); __pyx_t_7 = NULL;\n        __Pyx_GIVEREF(__pyx_t_6);\n        PyTuple_SET_ITEM(__pyx_t_9, 0+1, __pyx_t_6);\n        __pyx_t_6 = 0;\n        __pyx_t_4 = __Pyx_PyObject_Call(__pyx_t_5, __pyx_t_9, NULL); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 3379, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_4);\n        __Pyx_DECREF(__pyx_t_9); __pyx_t_9 = 0;\n      }\n    }\n    __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n    __Pyx_Raise(__pyx_t_4, 0, 0, 0);\n    __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n    __PYX_ERR(0, 3379, __pyx_L1_error)\n\n    /* \"pywrapfst.pyx\":3378\n *   tfst.reset(fst.Convert(deref(ifst._fst), fst_type_string))\n *   # Script-land Convert returns a null pointer to signal failure.\n *   if tfst.get() == NULL:             # <<<<<<<<<<<<<<\n *     raise FstOpError(\"Conversion to {!r} failed\".format(fst_type))\n *   return _init_XFst(tfst.release())\n */\n  }\n\n  /* \"pywrapfst.pyx\":3380\n *   if tfst.get() == NULL:\n *     raise FstOpError(\"Conversion to {!r} failed\".format(fst_type))\n *   return _init_XFst(tfst.release())             # <<<<<<<<<<<<<<\n * \n * \n */\n  __Pyx_XDECREF(((PyObject *)__pyx_r));\n  __pyx_t_4 = ((PyObject *)__pyx_f_9pywrapfst__init_XFst(__pyx_v_tfst.release())); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 3380, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_4);\n  __pyx_r = ((struct __pyx_obj_9pywrapfst__Fst *)__pyx_t_4);\n  __pyx_t_4 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":3357\n * \n * \n * cpdef _Fst convert(_Fst ifst, fst_type=None):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   convert(ifst, fst_type=None)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_XDECREF(__pyx_t_6);\n  __Pyx_XDECREF(__pyx_t_7);\n  __Pyx_XDECREF(__pyx_t_8);\n  __Pyx_XDECREF(__pyx_t_9);\n  __Pyx_AddTraceback(\"pywrapfst.convert\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XGIVEREF((PyObject *)__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_21convert(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic char __pyx_doc_9pywrapfst_20convert[] = \"\\n  convert(ifst, fst_type=None)\\n\\n  Constructively converts an FST to a new internal representation.\\n\\n  Args:\\n    ifst: The input FST.\\n    fst_type: A string indicating the FST type to convert to, or None if\\n        no conversion is desired.\\n\\n  Returns:\\n    The input FST converted to the desired FST type.\\n\\n  Raises:\\n    FstOpError: Conversion failed.\\n  \";\nstatic PyObject *__pyx_pw_9pywrapfst_21convert(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst = 0;\n  PyObject *__pyx_v_fst_type = 0;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"convert (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_ifst,&__pyx_n_s_fst_type,0};\n    PyObject* values[2] = {0,0};\n    values[1] = ((PyObject *)Py_None);\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (likely((values[0] = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_ifst)) != 0)) kw_args--;\n        else goto __pyx_L5_argtuple_error;\n        CYTHON_FALLTHROUGH;\n        case  1:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_fst_type);\n          if (value) { values[1] = value; kw_args--; }\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"convert\") < 0)) __PYX_ERR(0, 3357, __pyx_L3_error)\n      }\n    } else {\n      switch (PyTuple_GET_SIZE(__pyx_args)) {\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n    }\n    __pyx_v_ifst = ((struct __pyx_obj_9pywrapfst__Fst *)values[0]);\n    __pyx_v_fst_type = values[1];\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"convert\", 0, 1, 2, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 3357, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst.convert\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_ifst), __pyx_ptype_9pywrapfst__Fst, 1, \"ifst\", 0))) __PYX_ERR(0, 3357, __pyx_L1_error)\n  __pyx_r = __pyx_pf_9pywrapfst_20convert(__pyx_self, __pyx_v_ifst, __pyx_v_fst_type);\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_20convert(CYTHON_UNUSED PyObject *__pyx_self, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst, PyObject *__pyx_v_fst_type) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  struct __pyx_opt_args_9pywrapfst_convert __pyx_t_2;\n  __Pyx_RefNannySetupContext(\"convert\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_2.__pyx_n = 1;\n  __pyx_t_2.fst_type = __pyx_v_fst_type;\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst_convert(__pyx_v_ifst, 0, &__pyx_t_2)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3357, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.convert\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":3383\n * \n * \n * cpdef _MutableFst determinize(_Fst ifst,             # <<<<<<<<<<<<<<\n *                               float delta=fst.kShortestDelta,\n *                               det_type=b\"functional\",\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_23determinize(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic struct __pyx_obj_9pywrapfst__MutableFst *__pyx_f_9pywrapfst_determinize(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst, CYTHON_UNUSED int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_determinize *__pyx_optional_args) {\n  float __pyx_v_delta = __pyx_k__69;\n  PyObject *__pyx_v_det_type = ((PyObject *)__pyx_n_b_functional);\n  __pyx_t_10basictypes_int64 __pyx_v_nstate = __pyx_k__70;\n  __pyx_t_10basictypes_int64 __pyx_v_subsequential_label = ((__pyx_t_10basictypes_int64)0);\n\n  /* \"pywrapfst.pyx\":3388\n *                               int64 nstate=fst.kNoStateId,\n *                               int64 subsequential_label=0,\n *                               weight=None,             # <<<<<<<<<<<<<<\n *                               bool increment_subsequential_label=False):\n *   \"\"\"\n */\n  PyObject *__pyx_v_weight = ((PyObject *)Py_None);\n\n  /* \"pywrapfst.pyx\":3389\n *                               int64 subsequential_label=0,\n *                               weight=None,\n *                               bool increment_subsequential_label=False):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   determinize(ifst, delta=1e-6, det_type=\"functional\",\n */\n  bool __pyx_v_increment_subsequential_label = ((bool)0);\n  std::unique_ptr<fst::script::VectorFstClass>  __pyx_v_tfst;\n  fst::script::WeightClass __pyx_v_wc;\n  enum fst::DeterminizeType __pyx_v_determinize_type_enum;\n  std::unique_ptr<fst::script::DeterminizeOptions>  __pyx_v_opts;\n  struct __pyx_obj_9pywrapfst__MutableFst *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  fst::script::WeightClass __pyx_t_1;\n  std::string __pyx_t_2;\n  int __pyx_t_3;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  PyObject *__pyx_t_6 = NULL;\n  PyObject *__pyx_t_7 = NULL;\n  PyObject *__pyx_t_8 = NULL;\n  PyObject *__pyx_t_9 = NULL;\n  __Pyx_RefNannySetupContext(\"determinize\", 0);\n  if (__pyx_optional_args) {\n    if (__pyx_optional_args->__pyx_n > 0) {\n      __pyx_v_delta = __pyx_optional_args->delta;\n      if (__pyx_optional_args->__pyx_n > 1) {\n        __pyx_v_det_type = __pyx_optional_args->det_type;\n        if (__pyx_optional_args->__pyx_n > 2) {\n          __pyx_v_nstate = __pyx_optional_args->nstate;\n          if (__pyx_optional_args->__pyx_n > 3) {\n            __pyx_v_subsequential_label = __pyx_optional_args->subsequential_label;\n            if (__pyx_optional_args->__pyx_n > 4) {\n              __pyx_v_weight = __pyx_optional_args->weight;\n              if (__pyx_optional_args->__pyx_n > 5) {\n                __pyx_v_increment_subsequential_label = __pyx_optional_args->increment_subsequential_label;\n              }\n            }\n          }\n        }\n      }\n    }\n  }\n\n  /* \"pywrapfst.pyx\":3425\n *   \"\"\"\n *   cdef unique_ptr[fst.VectorFstClass] tfst\n *   tfst.reset(new fst.VectorFstClass(ifst.arc_type()))             # <<<<<<<<<<<<<<\n *   # Threshold is set to semiring Zero (no pruning) if weight unspecified.\n *   cdef fst.WeightClass wc = _get_WeightClass_or_Zero(ifst.weight_type(),\n */\n  if (unlikely(((PyObject *)__pyx_v_ifst) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"arc_type\");\n    __PYX_ERR(0, 3425, __pyx_L1_error)\n  }\n  __pyx_v_tfst.reset(new fst::script::VectorFstClass(((struct __pyx_vtabstruct_9pywrapfst__Fst *)__pyx_v_ifst->__pyx_vtab)->arc_type(__pyx_v_ifst, 0)));\n\n  /* \"pywrapfst.pyx\":3427\n *   tfst.reset(new fst.VectorFstClass(ifst.arc_type()))\n *   # Threshold is set to semiring Zero (no pruning) if weight unspecified.\n *   cdef fst.WeightClass wc = _get_WeightClass_or_Zero(ifst.weight_type(),             # <<<<<<<<<<<<<<\n *                                                      weight)\n *   cdef fst.DeterminizeType determinize_type_enum\n */\n  if (unlikely(((PyObject *)__pyx_v_ifst) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"weight_type\");\n    __PYX_ERR(0, 3427, __pyx_L1_error)\n  }\n\n  /* \"pywrapfst.pyx\":3428\n *   # Threshold is set to semiring Zero (no pruning) if weight unspecified.\n *   cdef fst.WeightClass wc = _get_WeightClass_or_Zero(ifst.weight_type(),\n *                                                      weight)             # <<<<<<<<<<<<<<\n *   cdef fst.DeterminizeType determinize_type_enum\n *   if not fst.GetDeterminizeType(tostring(det_type),\n */\n  __pyx_t_1 = __pyx_f_9pywrapfst__get_WeightClass_or_Zero(((struct __pyx_vtabstruct_9pywrapfst__Fst *)__pyx_v_ifst->__pyx_vtab)->weight_type(__pyx_v_ifst, 0), __pyx_v_weight); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 3427, __pyx_L1_error)\n  __pyx_v_wc = __pyx_t_1;\n\n  /* \"pywrapfst.pyx\":3430\n *                                                      weight)\n *   cdef fst.DeterminizeType determinize_type_enum\n *   if not fst.GetDeterminizeType(tostring(det_type),             # <<<<<<<<<<<<<<\n *                                 addr(determinize_type_enum)):\n *     raise FstArgError(\"Unknown determinization type: {!r}\".format(det_type))\n */\n  __pyx_t_2 = __pyx_f_9pywrapfst_tostring(__pyx_v_det_type, NULL); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 3430, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":3431\n *   cdef fst.DeterminizeType determinize_type_enum\n *   if not fst.GetDeterminizeType(tostring(det_type),\n *                                 addr(determinize_type_enum)):             # <<<<<<<<<<<<<<\n *     raise FstArgError(\"Unknown determinization type: {!r}\".format(det_type))\n *   cdef unique_ptr[fst.DeterminizeOptions] opts\n */\n  __pyx_t_3 = ((!(fst::script::GetDeterminizeType(__pyx_t_2, (&__pyx_v_determinize_type_enum)) != 0)) != 0);\n\n  /* \"pywrapfst.pyx\":3430\n *                                                      weight)\n *   cdef fst.DeterminizeType determinize_type_enum\n *   if not fst.GetDeterminizeType(tostring(det_type),             # <<<<<<<<<<<<<<\n *                                 addr(determinize_type_enum)):\n *     raise FstArgError(\"Unknown determinization type: {!r}\".format(det_type))\n */\n  if (unlikely(__pyx_t_3)) {\n\n    /* \"pywrapfst.pyx\":3432\n *   if not fst.GetDeterminizeType(tostring(det_type),\n *                                 addr(determinize_type_enum)):\n *     raise FstArgError(\"Unknown determinization type: {!r}\".format(det_type))             # <<<<<<<<<<<<<<\n *   cdef unique_ptr[fst.DeterminizeOptions] opts\n *   opts.reset(new fst.DeterminizeOptions(delta, wc, nstate, subsequential_label,\n */\n    __pyx_t_5 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstArgError); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 3432, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_5);\n    __pyx_t_7 = __Pyx_PyObject_GetAttrStr(__pyx_kp_s_Unknown_determinization_type_r, __pyx_n_s_format); if (unlikely(!__pyx_t_7)) __PYX_ERR(0, 3432, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_7);\n    __pyx_t_8 = NULL;\n    if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_7))) {\n      __pyx_t_8 = PyMethod_GET_SELF(__pyx_t_7);\n      if (likely(__pyx_t_8)) {\n        PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_7);\n        __Pyx_INCREF(__pyx_t_8);\n        __Pyx_INCREF(function);\n        __Pyx_DECREF_SET(__pyx_t_7, function);\n      }\n    }\n    if (!__pyx_t_8) {\n      __pyx_t_6 = __Pyx_PyObject_CallOneArg(__pyx_t_7, __pyx_v_det_type); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 3432, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_6);\n    } else {\n      #if CYTHON_FAST_PYCALL\n      if (PyFunction_Check(__pyx_t_7)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_8, __pyx_v_det_type};\n        __pyx_t_6 = __Pyx_PyFunction_FastCall(__pyx_t_7, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 3432, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_8); __pyx_t_8 = 0;\n        __Pyx_GOTREF(__pyx_t_6);\n      } else\n      #endif\n      #if CYTHON_FAST_PYCCALL\n      if (__Pyx_PyFastCFunction_Check(__pyx_t_7)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_8, __pyx_v_det_type};\n        __pyx_t_6 = __Pyx_PyCFunction_FastCall(__pyx_t_7, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 3432, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_8); __pyx_t_8 = 0;\n        __Pyx_GOTREF(__pyx_t_6);\n      } else\n      #endif\n      {\n        __pyx_t_9 = PyTuple_New(1+1); if (unlikely(!__pyx_t_9)) __PYX_ERR(0, 3432, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_9);\n        __Pyx_GIVEREF(__pyx_t_8); PyTuple_SET_ITEM(__pyx_t_9, 0, __pyx_t_8); __pyx_t_8 = NULL;\n        __Pyx_INCREF(__pyx_v_det_type);\n        __Pyx_GIVEREF(__pyx_v_det_type);\n        PyTuple_SET_ITEM(__pyx_t_9, 0+1, __pyx_v_det_type);\n        __pyx_t_6 = __Pyx_PyObject_Call(__pyx_t_7, __pyx_t_9, NULL); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 3432, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_6);\n        __Pyx_DECREF(__pyx_t_9); __pyx_t_9 = 0;\n      }\n    }\n    __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0;\n    __pyx_t_7 = NULL;\n    if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_5))) {\n      __pyx_t_7 = PyMethod_GET_SELF(__pyx_t_5);\n      if (likely(__pyx_t_7)) {\n        PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_5);\n        __Pyx_INCREF(__pyx_t_7);\n        __Pyx_INCREF(function);\n        __Pyx_DECREF_SET(__pyx_t_5, function);\n      }\n    }\n    if (!__pyx_t_7) {\n      __pyx_t_4 = __Pyx_PyObject_CallOneArg(__pyx_t_5, __pyx_t_6); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 3432, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n      __Pyx_GOTREF(__pyx_t_4);\n    } else {\n      #if CYTHON_FAST_PYCALL\n      if (PyFunction_Check(__pyx_t_5)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_7, __pyx_t_6};\n        __pyx_t_4 = __Pyx_PyFunction_FastCall(__pyx_t_5, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 3432, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_7); __pyx_t_7 = 0;\n        __Pyx_GOTREF(__pyx_t_4);\n        __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n      } else\n      #endif\n      #if CYTHON_FAST_PYCCALL\n      if (__Pyx_PyFastCFunction_Check(__pyx_t_5)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_7, __pyx_t_6};\n        __pyx_t_4 = __Pyx_PyCFunction_FastCall(__pyx_t_5, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 3432, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_7); __pyx_t_7 = 0;\n        __Pyx_GOTREF(__pyx_t_4);\n        __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n      } else\n      #endif\n      {\n        __pyx_t_9 = PyTuple_New(1+1); if (unlikely(!__pyx_t_9)) __PYX_ERR(0, 3432, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_9);\n        __Pyx_GIVEREF(__pyx_t_7); PyTuple_SET_ITEM(__pyx_t_9, 0, __pyx_t_7); __pyx_t_7 = NULL;\n        __Pyx_GIVEREF(__pyx_t_6);\n        PyTuple_SET_ITEM(__pyx_t_9, 0+1, __pyx_t_6);\n        __pyx_t_6 = 0;\n        __pyx_t_4 = __Pyx_PyObject_Call(__pyx_t_5, __pyx_t_9, NULL); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 3432, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_4);\n        __Pyx_DECREF(__pyx_t_9); __pyx_t_9 = 0;\n      }\n    }\n    __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n    __Pyx_Raise(__pyx_t_4, 0, 0, 0);\n    __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n    __PYX_ERR(0, 3432, __pyx_L1_error)\n\n    /* \"pywrapfst.pyx\":3430\n *                                                      weight)\n *   cdef fst.DeterminizeType determinize_type_enum\n *   if not fst.GetDeterminizeType(tostring(det_type),             # <<<<<<<<<<<<<<\n *                                 addr(determinize_type_enum)):\n *     raise FstArgError(\"Unknown determinization type: {!r}\".format(det_type))\n */\n  }\n\n  /* \"pywrapfst.pyx\":3434\n *     raise FstArgError(\"Unknown determinization type: {!r}\".format(det_type))\n *   cdef unique_ptr[fst.DeterminizeOptions] opts\n *   opts.reset(new fst.DeterminizeOptions(delta, wc, nstate, subsequential_label,             # <<<<<<<<<<<<<<\n *                                         determinize_type_enum,\n *                                         increment_subsequential_label))\n */\n  __pyx_v_opts.reset(new fst::script::DeterminizeOptions(__pyx_v_delta, __pyx_v_wc, __pyx_v_nstate, __pyx_v_subsequential_label, __pyx_v_determinize_type_enum, __pyx_v_increment_subsequential_label));\n\n  /* \"pywrapfst.pyx\":3437\n *                                         determinize_type_enum,\n *                                         increment_subsequential_label))\n *   fst.Determinize(deref(ifst._fst), tfst.get(), deref(opts))             # <<<<<<<<<<<<<<\n *   return _init_MutableFst(tfst.release())\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_ifst) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 3437, __pyx_L1_error)\n  }\n  fst::script::Determinize((*__pyx_v_ifst->_fst), __pyx_v_tfst.get(), (*__pyx_v_opts));\n\n  /* \"pywrapfst.pyx\":3438\n *                                         increment_subsequential_label))\n *   fst.Determinize(deref(ifst._fst), tfst.get(), deref(opts))\n *   return _init_MutableFst(tfst.release())             # <<<<<<<<<<<<<<\n * \n * \n */\n  __Pyx_XDECREF(((PyObject *)__pyx_r));\n  __pyx_t_4 = ((PyObject *)__pyx_f_9pywrapfst__init_MutableFst(__pyx_v_tfst.release())); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 3438, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_4);\n  __pyx_r = ((struct __pyx_obj_9pywrapfst__MutableFst *)__pyx_t_4);\n  __pyx_t_4 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":3383\n * \n * \n * cpdef _MutableFst determinize(_Fst ifst,             # <<<<<<<<<<<<<<\n *                               float delta=fst.kShortestDelta,\n *                               det_type=b\"functional\",\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_XDECREF(__pyx_t_6);\n  __Pyx_XDECREF(__pyx_t_7);\n  __Pyx_XDECREF(__pyx_t_8);\n  __Pyx_XDECREF(__pyx_t_9);\n  __Pyx_AddTraceback(\"pywrapfst.determinize\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XGIVEREF((PyObject *)__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_23determinize(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic char __pyx_doc_9pywrapfst_22determinize[] = \"\\n  determinize(ifst, delta=1e-6, det_type=\\\"functional\\\",\\n              nstate=NO_STATE_ID, subsequential_label=0, weight=None,\\n              incremental_subsequential_label=False)\\n\\n  Constructively determinizes a weighted FST.\\n\\n  This operations creates an equivalent FST that has the property that no\\n  state has two transitions with the same input label. For this algorithm,\\n  epsilon transitions are treated as regular symbols (cf. `rmepsilon`).\\n\\n  Args:\\n    ifst: The input FST.\\n    delta: Comparison/quantization delta.\\n    det_type: Type of determinization; one of: \\\"functional\\\" (input transducer is\\n        functional), \\\"nonfunctional\\\" (input transducer is not functional) and\\n        disambiguate\\\" (input transducer is not functional but only keep the min\\n        of ambiguous outputs).\\n    nstate: State number threshold.\\n    subsequential_label: Input label of arc corresponding to residual final\\n        output when producing a subsequential transducer.\\n    weight: A Weight or weight string indicating the desired weight threshold\\n        below which paths are pruned; if omitted, no paths are pruned.\\n    increment_subsequential_label: Increment subsequential when creating\\n        several arcs for the residual final output at a given state.\\n\\n  Returns:\\n    An equivalent deterministic FST.\\n\\n  Raises:\\n    FstArgError: Unknown determinization type.\\n\\n  See also: `disambiguate`, `rmepsilon`.\\n  \";\nstatic PyObject *__pyx_pw_9pywrapfst_23determinize(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst = 0;\n  float __pyx_v_delta;\n  PyObject *__pyx_v_det_type = 0;\n  __pyx_t_10basictypes_int64 __pyx_v_nstate;\n  __pyx_t_10basictypes_int64 __pyx_v_subsequential_label;\n  PyObject *__pyx_v_weight = 0;\n  bool __pyx_v_increment_subsequential_label;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"determinize (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_ifst,&__pyx_n_s_delta,&__pyx_n_s_det_type,&__pyx_n_s_nstate,&__pyx_n_s_subsequential_label,&__pyx_n_s_weight,&__pyx_n_s_increment_subsequential_label,0};\n    PyObject* values[7] = {0,0,0,0,0,0,0};\n    values[2] = ((PyObject *)__pyx_n_b_functional);\n\n    /* \"pywrapfst.pyx\":3388\n *                               int64 nstate=fst.kNoStateId,\n *                               int64 subsequential_label=0,\n *                               weight=None,             # <<<<<<<<<<<<<<\n *                               bool increment_subsequential_label=False):\n *   \"\"\"\n */\n    values[5] = ((PyObject *)Py_None);\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  7: values[6] = PyTuple_GET_ITEM(__pyx_args, 6);\n        CYTHON_FALLTHROUGH;\n        case  6: values[5] = PyTuple_GET_ITEM(__pyx_args, 5);\n        CYTHON_FALLTHROUGH;\n        case  5: values[4] = PyTuple_GET_ITEM(__pyx_args, 4);\n        CYTHON_FALLTHROUGH;\n        case  4: values[3] = PyTuple_GET_ITEM(__pyx_args, 3);\n        CYTHON_FALLTHROUGH;\n        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);\n        CYTHON_FALLTHROUGH;\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (likely((values[0] = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_ifst)) != 0)) kw_args--;\n        else goto __pyx_L5_argtuple_error;\n        CYTHON_FALLTHROUGH;\n        case  1:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_delta);\n          if (value) { values[1] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  2:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_det_type);\n          if (value) { values[2] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  3:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_nstate);\n          if (value) { values[3] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  4:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_subsequential_label);\n          if (value) { values[4] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  5:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_weight);\n          if (value) { values[5] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  6:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_increment_subsequential_label);\n          if (value) { values[6] = value; kw_args--; }\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"determinize\") < 0)) __PYX_ERR(0, 3383, __pyx_L3_error)\n      }\n    } else {\n      switch (PyTuple_GET_SIZE(__pyx_args)) {\n        case  7: values[6] = PyTuple_GET_ITEM(__pyx_args, 6);\n        CYTHON_FALLTHROUGH;\n        case  6: values[5] = PyTuple_GET_ITEM(__pyx_args, 5);\n        CYTHON_FALLTHROUGH;\n        case  5: values[4] = PyTuple_GET_ITEM(__pyx_args, 4);\n        CYTHON_FALLTHROUGH;\n        case  4: values[3] = PyTuple_GET_ITEM(__pyx_args, 3);\n        CYTHON_FALLTHROUGH;\n        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);\n        CYTHON_FALLTHROUGH;\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n    }\n    __pyx_v_ifst = ((struct __pyx_obj_9pywrapfst__Fst *)values[0]);\n    if (values[1]) {\n      __pyx_v_delta = __pyx_PyFloat_AsFloat(values[1]); if (unlikely((__pyx_v_delta == (float)-1) && PyErr_Occurred())) __PYX_ERR(0, 3384, __pyx_L3_error)\n    } else {\n      __pyx_v_delta = __pyx_k__69;\n    }\n    __pyx_v_det_type = values[2];\n    if (values[3]) {\n      __pyx_v_nstate = __Pyx_PyInt_As_int64_t(values[3]); if (unlikely((__pyx_v_nstate == ((int64_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 3386, __pyx_L3_error)\n    } else {\n      __pyx_v_nstate = __pyx_k__70;\n    }\n    if (values[4]) {\n      __pyx_v_subsequential_label = __Pyx_PyInt_As_int64_t(values[4]); if (unlikely((__pyx_v_subsequential_label == ((int64_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 3387, __pyx_L3_error)\n    } else {\n      __pyx_v_subsequential_label = ((__pyx_t_10basictypes_int64)0);\n    }\n    __pyx_v_weight = values[5];\n    if (values[6]) {\n      __pyx_v_increment_subsequential_label = __Pyx_PyObject_IsTrue(values[6]); if (unlikely((__pyx_v_increment_subsequential_label == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 3389, __pyx_L3_error)\n    } else {\n\n      /* \"pywrapfst.pyx\":3389\n *                               int64 subsequential_label=0,\n *                               weight=None,\n *                               bool increment_subsequential_label=False):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   determinize(ifst, delta=1e-6, det_type=\"functional\",\n */\n      __pyx_v_increment_subsequential_label = ((bool)0);\n    }\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"determinize\", 0, 1, 7, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 3383, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst.determinize\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_ifst), __pyx_ptype_9pywrapfst__Fst, 1, \"ifst\", 0))) __PYX_ERR(0, 3383, __pyx_L1_error)\n  __pyx_r = __pyx_pf_9pywrapfst_22determinize(__pyx_self, __pyx_v_ifst, __pyx_v_delta, __pyx_v_det_type, __pyx_v_nstate, __pyx_v_subsequential_label, __pyx_v_weight, __pyx_v_increment_subsequential_label);\n\n  /* \"pywrapfst.pyx\":3383\n * \n * \n * cpdef _MutableFst determinize(_Fst ifst,             # <<<<<<<<<<<<<<\n *                               float delta=fst.kShortestDelta,\n *                               det_type=b\"functional\",\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_22determinize(CYTHON_UNUSED PyObject *__pyx_self, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst, float __pyx_v_delta, PyObject *__pyx_v_det_type, __pyx_t_10basictypes_int64 __pyx_v_nstate, __pyx_t_10basictypes_int64 __pyx_v_subsequential_label, PyObject *__pyx_v_weight, bool __pyx_v_increment_subsequential_label) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  struct __pyx_opt_args_9pywrapfst_determinize __pyx_t_2;\n  __Pyx_RefNannySetupContext(\"determinize\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_2.__pyx_n = 6;\n  __pyx_t_2.delta = __pyx_v_delta;\n  __pyx_t_2.det_type = __pyx_v_det_type;\n  __pyx_t_2.nstate = __pyx_v_nstate;\n  __pyx_t_2.subsequential_label = __pyx_v_subsequential_label;\n  __pyx_t_2.weight = __pyx_v_weight;\n  __pyx_t_2.increment_subsequential_label = __pyx_v_increment_subsequential_label;\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst_determinize(__pyx_v_ifst, 0, &__pyx_t_2)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3383, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.determinize\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":3441\n * \n * \n * cpdef _MutableFst difference(_Fst ifst1,             # <<<<<<<<<<<<<<\n *                              _Fst ifst2,\n *                              compose_filter=b\"auto\",\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_25difference(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic struct __pyx_obj_9pywrapfst__MutableFst *__pyx_f_9pywrapfst_difference(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst1, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst2, CYTHON_UNUSED int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_difference *__pyx_optional_args) {\n  PyObject *__pyx_v_compose_filter = ((PyObject *)__pyx_n_b_auto);\n\n  /* \"pywrapfst.pyx\":3444\n *                              _Fst ifst2,\n *                              compose_filter=b\"auto\",\n *                              bool connect=True):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   difference(ifst1, ifst2, compose_filter=\"auto\", connect=True)\n */\n  bool __pyx_v_connect = ((bool)1);\n  std::unique_ptr<fst::script::VectorFstClass>  __pyx_v_tfst;\n  std::unique_ptr<fst::ComposeOptions>  __pyx_v_opts;\n  struct __pyx_obj_9pywrapfst__MutableFst *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  std::string __pyx_t_1;\n  enum fst::ComposeFilter __pyx_t_2;\n  PyObject *__pyx_t_3 = NULL;\n  __Pyx_RefNannySetupContext(\"difference\", 0);\n  if (__pyx_optional_args) {\n    if (__pyx_optional_args->__pyx_n > 0) {\n      __pyx_v_compose_filter = __pyx_optional_args->compose_filter;\n      if (__pyx_optional_args->__pyx_n > 1) {\n        __pyx_v_connect = __pyx_optional_args->connect;\n      }\n    }\n  }\n\n  /* \"pywrapfst.pyx\":3468\n *   \"\"\"\n *   cdef unique_ptr[fst.VectorFstClass] tfst\n *   tfst.reset(new fst.VectorFstClass(ifst1.arc_type()))             # <<<<<<<<<<<<<<\n *   cdef unique_ptr[fst.ComposeOptions] opts\n *   opts.reset(new fst.ComposeOptions(connect, _get_compose_filter(\n */\n  if (unlikely(((PyObject *)__pyx_v_ifst1) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"arc_type\");\n    __PYX_ERR(0, 3468, __pyx_L1_error)\n  }\n  __pyx_v_tfst.reset(new fst::script::VectorFstClass(((struct __pyx_vtabstruct_9pywrapfst__Fst *)__pyx_v_ifst1->__pyx_vtab)->arc_type(__pyx_v_ifst1, 0)));\n\n  /* \"pywrapfst.pyx\":3471\n *   cdef unique_ptr[fst.ComposeOptions] opts\n *   opts.reset(new fst.ComposeOptions(connect, _get_compose_filter(\n *       tostring(compose_filter))))             # <<<<<<<<<<<<<<\n *   fst.Difference(deref(ifst1._fst), deref(ifst2._fst), tfst.get(), deref(opts))\n *   return _init_MutableFst(tfst.release())\n */\n  __pyx_t_1 = __pyx_f_9pywrapfst_tostring(__pyx_v_compose_filter, NULL); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 3471, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":3470\n *   tfst.reset(new fst.VectorFstClass(ifst1.arc_type()))\n *   cdef unique_ptr[fst.ComposeOptions] opts\n *   opts.reset(new fst.ComposeOptions(connect, _get_compose_filter(             # <<<<<<<<<<<<<<\n *       tostring(compose_filter))))\n *   fst.Difference(deref(ifst1._fst), deref(ifst2._fst), tfst.get(), deref(opts))\n */\n  __pyx_t_2 = __pyx_f_9pywrapfst__get_compose_filter(__pyx_t_1); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 3470, __pyx_L1_error)\n  __pyx_v_opts.reset(new fst::ComposeOptions(__pyx_v_connect, __pyx_t_2));\n\n  /* \"pywrapfst.pyx\":3472\n *   opts.reset(new fst.ComposeOptions(connect, _get_compose_filter(\n *       tostring(compose_filter))))\n *   fst.Difference(deref(ifst1._fst), deref(ifst2._fst), tfst.get(), deref(opts))             # <<<<<<<<<<<<<<\n *   return _init_MutableFst(tfst.release())\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_ifst1) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 3472, __pyx_L1_error)\n  }\n  if (unlikely(((PyObject *)__pyx_v_ifst2) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 3472, __pyx_L1_error)\n  }\n  fst::script::Difference((*__pyx_v_ifst1->_fst), (*__pyx_v_ifst2->_fst), __pyx_v_tfst.get(), (*__pyx_v_opts));\n\n  /* \"pywrapfst.pyx\":3473\n *       tostring(compose_filter))))\n *   fst.Difference(deref(ifst1._fst), deref(ifst2._fst), tfst.get(), deref(opts))\n *   return _init_MutableFst(tfst.release())             # <<<<<<<<<<<<<<\n * \n * \n */\n  __Pyx_XDECREF(((PyObject *)__pyx_r));\n  __pyx_t_3 = ((PyObject *)__pyx_f_9pywrapfst__init_MutableFst(__pyx_v_tfst.release())); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 3473, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_3);\n  __pyx_r = ((struct __pyx_obj_9pywrapfst__MutableFst *)__pyx_t_3);\n  __pyx_t_3 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":3441\n * \n * \n * cpdef _MutableFst difference(_Fst ifst1,             # <<<<<<<<<<<<<<\n *                              _Fst ifst2,\n *                              compose_filter=b\"auto\",\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_AddTraceback(\"pywrapfst.difference\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XGIVEREF((PyObject *)__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_25difference(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic char __pyx_doc_9pywrapfst_24difference[] = \"\\n  difference(ifst1, ifst2, compose_filter=\\\"auto\\\", connect=True)\\n\\n  Constructively computes the difference of two FSTs.\\n\\n  This operation computes the difference between two FSAs. Only strings that are\\n  in the first automaton but not in second are retained in the result. The first\\n  argument must be an acceptor; the second argument must be an unweighted,\\n  epsilon-free, deterministic acceptor. The output labels of the first\\n  transducer or the input labels of the second transducer must be sorted (or\\n  otherwise support appropriate matchers).\\n\\n  Args:\\n    ifst1: The first input FST.\\n    ifst2: The second input FST.\\n    compose_filter: A string matching a known composition filter; one of:\\n        \\\"alt_sequence\\\", \\\"auto\\\", \\\"match\\\", \\\"null\\\", \\\"sequence\\\", \\\"trivial\\\".\\n    connect: Should the output FST be trimmed?\\n\\n  Returns:\\n    An FST representing the difference of the FSTs.\\n  \";\nstatic PyObject *__pyx_pw_9pywrapfst_25difference(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst1 = 0;\n  struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst2 = 0;\n  PyObject *__pyx_v_compose_filter = 0;\n  bool __pyx_v_connect;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"difference (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_ifst1,&__pyx_n_s_ifst2,&__pyx_n_s_compose_filter,&__pyx_n_s_connect,0};\n    PyObject* values[4] = {0,0,0,0};\n    values[2] = ((PyObject *)__pyx_n_b_auto);\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  4: values[3] = PyTuple_GET_ITEM(__pyx_args, 3);\n        CYTHON_FALLTHROUGH;\n        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);\n        CYTHON_FALLTHROUGH;\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (likely((values[0] = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_ifst1)) != 0)) kw_args--;\n        else goto __pyx_L5_argtuple_error;\n        CYTHON_FALLTHROUGH;\n        case  1:\n        if (likely((values[1] = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_ifst2)) != 0)) kw_args--;\n        else {\n          __Pyx_RaiseArgtupleInvalid(\"difference\", 0, 2, 4, 1); __PYX_ERR(0, 3441, __pyx_L3_error)\n        }\n        CYTHON_FALLTHROUGH;\n        case  2:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_compose_filter);\n          if (value) { values[2] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  3:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_connect);\n          if (value) { values[3] = value; kw_args--; }\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"difference\") < 0)) __PYX_ERR(0, 3441, __pyx_L3_error)\n      }\n    } else {\n      switch (PyTuple_GET_SIZE(__pyx_args)) {\n        case  4: values[3] = PyTuple_GET_ITEM(__pyx_args, 3);\n        CYTHON_FALLTHROUGH;\n        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);\n        CYTHON_FALLTHROUGH;\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n    }\n    __pyx_v_ifst1 = ((struct __pyx_obj_9pywrapfst__Fst *)values[0]);\n    __pyx_v_ifst2 = ((struct __pyx_obj_9pywrapfst__Fst *)values[1]);\n    __pyx_v_compose_filter = values[2];\n    if (values[3]) {\n      __pyx_v_connect = __Pyx_PyObject_IsTrue(values[3]); if (unlikely((__pyx_v_connect == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 3444, __pyx_L3_error)\n    } else {\n\n      /* \"pywrapfst.pyx\":3444\n *                              _Fst ifst2,\n *                              compose_filter=b\"auto\",\n *                              bool connect=True):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   difference(ifst1, ifst2, compose_filter=\"auto\", connect=True)\n */\n      __pyx_v_connect = ((bool)1);\n    }\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"difference\", 0, 2, 4, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 3441, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst.difference\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_ifst1), __pyx_ptype_9pywrapfst__Fst, 1, \"ifst1\", 0))) __PYX_ERR(0, 3441, __pyx_L1_error)\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_ifst2), __pyx_ptype_9pywrapfst__Fst, 1, \"ifst2\", 0))) __PYX_ERR(0, 3442, __pyx_L1_error)\n  __pyx_r = __pyx_pf_9pywrapfst_24difference(__pyx_self, __pyx_v_ifst1, __pyx_v_ifst2, __pyx_v_compose_filter, __pyx_v_connect);\n\n  /* \"pywrapfst.pyx\":3441\n * \n * \n * cpdef _MutableFst difference(_Fst ifst1,             # <<<<<<<<<<<<<<\n *                              _Fst ifst2,\n *                              compose_filter=b\"auto\",\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_24difference(CYTHON_UNUSED PyObject *__pyx_self, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst1, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst2, PyObject *__pyx_v_compose_filter, bool __pyx_v_connect) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  struct __pyx_opt_args_9pywrapfst_difference __pyx_t_2;\n  __Pyx_RefNannySetupContext(\"difference\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_2.__pyx_n = 2;\n  __pyx_t_2.compose_filter = __pyx_v_compose_filter;\n  __pyx_t_2.connect = __pyx_v_connect;\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst_difference(__pyx_v_ifst1, __pyx_v_ifst2, 0, &__pyx_t_2)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3441, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.difference\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":3476\n * \n * \n * cpdef _MutableFst disambiguate(_Fst ifst,             # <<<<<<<<<<<<<<\n *                                float delta=fst.kDelta,\n *                                int64 nstate=fst.kNoStateId,\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_27disambiguate(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic struct __pyx_obj_9pywrapfst__MutableFst *__pyx_f_9pywrapfst_disambiguate(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst, CYTHON_UNUSED int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_disambiguate *__pyx_optional_args) {\n  float __pyx_v_delta = __pyx_k__71;\n  __pyx_t_10basictypes_int64 __pyx_v_nstate = __pyx_k__72;\n  __pyx_t_10basictypes_int64 __pyx_v_subsequential_label = ((__pyx_t_10basictypes_int64)0);\n\n  /* \"pywrapfst.pyx\":3480\n *                                int64 nstate=fst.kNoStateId,\n *                                int64 subsequential_label=0,\n *                                weight=None):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   disambiguate(ifst, delta=0.0009765625, nstate=NO_STATE_ID,\n */\n  PyObject *__pyx_v_weight = ((PyObject *)Py_None);\n  std::unique_ptr<fst::script::VectorFstClass>  __pyx_v_tfst;\n  fst::script::WeightClass __pyx_v_wc;\n  std::unique_ptr<fst::script::DisambiguateOptions>  __pyx_v_opts;\n  struct __pyx_obj_9pywrapfst__MutableFst *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  fst::script::WeightClass __pyx_t_1;\n  PyObject *__pyx_t_2 = NULL;\n  __Pyx_RefNannySetupContext(\"disambiguate\", 0);\n  if (__pyx_optional_args) {\n    if (__pyx_optional_args->__pyx_n > 0) {\n      __pyx_v_delta = __pyx_optional_args->delta;\n      if (__pyx_optional_args->__pyx_n > 1) {\n        __pyx_v_nstate = __pyx_optional_args->nstate;\n        if (__pyx_optional_args->__pyx_n > 2) {\n          __pyx_v_subsequential_label = __pyx_optional_args->subsequential_label;\n          if (__pyx_optional_args->__pyx_n > 3) {\n            __pyx_v_weight = __pyx_optional_args->weight;\n          }\n        }\n      }\n    }\n  }\n\n  /* \"pywrapfst.pyx\":3507\n *   \"\"\"\n *   cdef unique_ptr[fst.VectorFstClass] tfst\n *   tfst.reset(new fst.VectorFstClass(ifst.arc_type()))             # <<<<<<<<<<<<<<\n *   # Threshold is set to semiring Zero (no pruning) if no weight is specified.\n *   cdef fst.WeightClass wc = _get_WeightClass_or_Zero(ifst.weight_type(),\n */\n  if (unlikely(((PyObject *)__pyx_v_ifst) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"arc_type\");\n    __PYX_ERR(0, 3507, __pyx_L1_error)\n  }\n  __pyx_v_tfst.reset(new fst::script::VectorFstClass(((struct __pyx_vtabstruct_9pywrapfst__Fst *)__pyx_v_ifst->__pyx_vtab)->arc_type(__pyx_v_ifst, 0)));\n\n  /* \"pywrapfst.pyx\":3509\n *   tfst.reset(new fst.VectorFstClass(ifst.arc_type()))\n *   # Threshold is set to semiring Zero (no pruning) if no weight is specified.\n *   cdef fst.WeightClass wc = _get_WeightClass_or_Zero(ifst.weight_type(),             # <<<<<<<<<<<<<<\n *                                                      weight)\n *   cdef unique_ptr[fst.DisambiguateOptions] opts\n */\n  if (unlikely(((PyObject *)__pyx_v_ifst) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"weight_type\");\n    __PYX_ERR(0, 3509, __pyx_L1_error)\n  }\n\n  /* \"pywrapfst.pyx\":3510\n *   # Threshold is set to semiring Zero (no pruning) if no weight is specified.\n *   cdef fst.WeightClass wc = _get_WeightClass_or_Zero(ifst.weight_type(),\n *                                                      weight)             # <<<<<<<<<<<<<<\n *   cdef unique_ptr[fst.DisambiguateOptions] opts\n *   opts.reset(new fst.DisambiguateOptions(delta, wc, nstate,\n */\n  __pyx_t_1 = __pyx_f_9pywrapfst__get_WeightClass_or_Zero(((struct __pyx_vtabstruct_9pywrapfst__Fst *)__pyx_v_ifst->__pyx_vtab)->weight_type(__pyx_v_ifst, 0), __pyx_v_weight); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 3509, __pyx_L1_error)\n  __pyx_v_wc = __pyx_t_1;\n\n  /* \"pywrapfst.pyx\":3512\n *                                                      weight)\n *   cdef unique_ptr[fst.DisambiguateOptions] opts\n *   opts.reset(new fst.DisambiguateOptions(delta, wc, nstate,             # <<<<<<<<<<<<<<\n *                                          subsequential_label))\n *   fst.Disambiguate(deref(ifst._fst), tfst.get(), deref(opts))\n */\n  __pyx_v_opts.reset(new fst::script::DisambiguateOptions(__pyx_v_delta, __pyx_v_wc, __pyx_v_nstate, __pyx_v_subsequential_label));\n\n  /* \"pywrapfst.pyx\":3514\n *   opts.reset(new fst.DisambiguateOptions(delta, wc, nstate,\n *                                          subsequential_label))\n *   fst.Disambiguate(deref(ifst._fst), tfst.get(), deref(opts))             # <<<<<<<<<<<<<<\n *   return _init_MutableFst(tfst.release())\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_ifst) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 3514, __pyx_L1_error)\n  }\n  fst::script::Disambiguate((*__pyx_v_ifst->_fst), __pyx_v_tfst.get(), (*__pyx_v_opts));\n\n  /* \"pywrapfst.pyx\":3515\n *                                          subsequential_label))\n *   fst.Disambiguate(deref(ifst._fst), tfst.get(), deref(opts))\n *   return _init_MutableFst(tfst.release())             # <<<<<<<<<<<<<<\n * \n * \n */\n  __Pyx_XDECREF(((PyObject *)__pyx_r));\n  __pyx_t_2 = ((PyObject *)__pyx_f_9pywrapfst__init_MutableFst(__pyx_v_tfst.release())); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3515, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  __pyx_r = ((struct __pyx_obj_9pywrapfst__MutableFst *)__pyx_t_2);\n  __pyx_t_2 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":3476\n * \n * \n * cpdef _MutableFst disambiguate(_Fst ifst,             # <<<<<<<<<<<<<<\n *                                float delta=fst.kDelta,\n *                                int64 nstate=fst.kNoStateId,\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_AddTraceback(\"pywrapfst.disambiguate\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XGIVEREF((PyObject *)__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_27disambiguate(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic char __pyx_doc_9pywrapfst_26disambiguate[] = \"\\n  disambiguate(ifst, delta=0.0009765625, nstate=NO_STATE_ID,\\n               subsequential_label=0, weight=None):\\n\\n  Constructively disambiguates a weighted transducer.\\n\\n  This operation disambiguates a weighted transducer. The result will be an\\n  equivalent FST that has the property that no two successful paths have the\\n  same input labeling. For this algorithm, epsilon transitions are treated as\\n  regular symbols (cf. `rmepsilon`).\\n\\n  Args:\\n    ifst: The input FST.\\n    delta: Comparison/quantization delta.\\n    nstate: State number threshold.\\n    subsequential_label: Input label of arc corresponding to residual final\\n        output when producing a subsequential transducer.\\n    weight: A Weight or weight string indicating the desired weight threshold\\n        below which paths are pruned; if omitted, no paths are pruned.\\n\\n  Returns:\\n    An equivalent disambiguated FST.\\n\\n  See also: `determinize`, `rmepsilon`.\\n  \";\nstatic PyObject *__pyx_pw_9pywrapfst_27disambiguate(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst = 0;\n  float __pyx_v_delta;\n  __pyx_t_10basictypes_int64 __pyx_v_nstate;\n  __pyx_t_10basictypes_int64 __pyx_v_subsequential_label;\n  PyObject *__pyx_v_weight = 0;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"disambiguate (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_ifst,&__pyx_n_s_delta,&__pyx_n_s_nstate,&__pyx_n_s_subsequential_label,&__pyx_n_s_weight,0};\n    PyObject* values[5] = {0,0,0,0,0};\n\n    /* \"pywrapfst.pyx\":3480\n *                                int64 nstate=fst.kNoStateId,\n *                                int64 subsequential_label=0,\n *                                weight=None):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   disambiguate(ifst, delta=0.0009765625, nstate=NO_STATE_ID,\n */\n    values[4] = ((PyObject *)Py_None);\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  5: values[4] = PyTuple_GET_ITEM(__pyx_args, 4);\n        CYTHON_FALLTHROUGH;\n        case  4: values[3] = PyTuple_GET_ITEM(__pyx_args, 3);\n        CYTHON_FALLTHROUGH;\n        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);\n        CYTHON_FALLTHROUGH;\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (likely((values[0] = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_ifst)) != 0)) kw_args--;\n        else goto __pyx_L5_argtuple_error;\n        CYTHON_FALLTHROUGH;\n        case  1:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_delta);\n          if (value) { values[1] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  2:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_nstate);\n          if (value) { values[2] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  3:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_subsequential_label);\n          if (value) { values[3] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  4:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_weight);\n          if (value) { values[4] = value; kw_args--; }\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"disambiguate\") < 0)) __PYX_ERR(0, 3476, __pyx_L3_error)\n      }\n    } else {\n      switch (PyTuple_GET_SIZE(__pyx_args)) {\n        case  5: values[4] = PyTuple_GET_ITEM(__pyx_args, 4);\n        CYTHON_FALLTHROUGH;\n        case  4: values[3] = PyTuple_GET_ITEM(__pyx_args, 3);\n        CYTHON_FALLTHROUGH;\n        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);\n        CYTHON_FALLTHROUGH;\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n    }\n    __pyx_v_ifst = ((struct __pyx_obj_9pywrapfst__Fst *)values[0]);\n    if (values[1]) {\n      __pyx_v_delta = __pyx_PyFloat_AsFloat(values[1]); if (unlikely((__pyx_v_delta == (float)-1) && PyErr_Occurred())) __PYX_ERR(0, 3477, __pyx_L3_error)\n    } else {\n      __pyx_v_delta = __pyx_k__71;\n    }\n    if (values[2]) {\n      __pyx_v_nstate = __Pyx_PyInt_As_int64_t(values[2]); if (unlikely((__pyx_v_nstate == ((int64_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 3478, __pyx_L3_error)\n    } else {\n      __pyx_v_nstate = __pyx_k__72;\n    }\n    if (values[3]) {\n      __pyx_v_subsequential_label = __Pyx_PyInt_As_int64_t(values[3]); if (unlikely((__pyx_v_subsequential_label == ((int64_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 3479, __pyx_L3_error)\n    } else {\n      __pyx_v_subsequential_label = ((__pyx_t_10basictypes_int64)0);\n    }\n    __pyx_v_weight = values[4];\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"disambiguate\", 0, 1, 5, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 3476, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst.disambiguate\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_ifst), __pyx_ptype_9pywrapfst__Fst, 1, \"ifst\", 0))) __PYX_ERR(0, 3476, __pyx_L1_error)\n  __pyx_r = __pyx_pf_9pywrapfst_26disambiguate(__pyx_self, __pyx_v_ifst, __pyx_v_delta, __pyx_v_nstate, __pyx_v_subsequential_label, __pyx_v_weight);\n\n  /* \"pywrapfst.pyx\":3476\n * \n * \n * cpdef _MutableFst disambiguate(_Fst ifst,             # <<<<<<<<<<<<<<\n *                                float delta=fst.kDelta,\n *                                int64 nstate=fst.kNoStateId,\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_26disambiguate(CYTHON_UNUSED PyObject *__pyx_self, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst, float __pyx_v_delta, __pyx_t_10basictypes_int64 __pyx_v_nstate, __pyx_t_10basictypes_int64 __pyx_v_subsequential_label, PyObject *__pyx_v_weight) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  struct __pyx_opt_args_9pywrapfst_disambiguate __pyx_t_2;\n  __Pyx_RefNannySetupContext(\"disambiguate\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_2.__pyx_n = 4;\n  __pyx_t_2.delta = __pyx_v_delta;\n  __pyx_t_2.nstate = __pyx_v_nstate;\n  __pyx_t_2.subsequential_label = __pyx_v_subsequential_label;\n  __pyx_t_2.weight = __pyx_v_weight;\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst_disambiguate(__pyx_v_ifst, 0, &__pyx_t_2)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3476, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.disambiguate\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":3518\n * \n * \n * cpdef _MutableFst epsnormalize(_Fst ifst, bool eps_norm_output=False):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   epsnormalize(ifst, eps_norm_output=False)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_29epsnormalize(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic struct __pyx_obj_9pywrapfst__MutableFst *__pyx_f_9pywrapfst_epsnormalize(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst, CYTHON_UNUSED int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_epsnormalize *__pyx_optional_args) {\n  bool __pyx_v_eps_norm_output = ((bool)0);\n  std::unique_ptr<fst::script::VectorFstClass>  __pyx_v_tfst;\n  struct __pyx_obj_9pywrapfst__MutableFst *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  enum fst::EpsNormalizeType __pyx_t_1;\n  PyObject *__pyx_t_2 = NULL;\n  __Pyx_RefNannySetupContext(\"epsnormalize\", 0);\n  if (__pyx_optional_args) {\n    if (__pyx_optional_args->__pyx_n > 0) {\n      __pyx_v_eps_norm_output = __pyx_optional_args->eps_norm_output;\n    }\n  }\n\n  /* \"pywrapfst.pyx\":3541\n *   \"\"\"\n *   cdef unique_ptr[fst.VectorFstClass] tfst\n *   tfst.reset(new fst.VectorFstClass(ifst.arc_type()))             # <<<<<<<<<<<<<<\n *   fst.EpsNormalize(deref(ifst._fst), tfst.get(), fst.EPS_NORM_OUTPUT if\n *                                                  eps_norm_output else\n */\n  if (unlikely(((PyObject *)__pyx_v_ifst) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"arc_type\");\n    __PYX_ERR(0, 3541, __pyx_L1_error)\n  }\n  __pyx_v_tfst.reset(new fst::script::VectorFstClass(((struct __pyx_vtabstruct_9pywrapfst__Fst *)__pyx_v_ifst->__pyx_vtab)->arc_type(__pyx_v_ifst, 0)));\n\n  /* \"pywrapfst.pyx\":3542\n *   cdef unique_ptr[fst.VectorFstClass] tfst\n *   tfst.reset(new fst.VectorFstClass(ifst.arc_type()))\n *   fst.EpsNormalize(deref(ifst._fst), tfst.get(), fst.EPS_NORM_OUTPUT if             # <<<<<<<<<<<<<<\n *                                                  eps_norm_output else\n *                                                  fst.EPS_NORM_INPUT)\n */\n  if (unlikely(((PyObject *)__pyx_v_ifst) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 3542, __pyx_L1_error)\n  }\n\n  /* \"pywrapfst.pyx\":3543\n *   tfst.reset(new fst.VectorFstClass(ifst.arc_type()))\n *   fst.EpsNormalize(deref(ifst._fst), tfst.get(), fst.EPS_NORM_OUTPUT if\n *                                                  eps_norm_output else             # <<<<<<<<<<<<<<\n *                                                  fst.EPS_NORM_INPUT)\n *   return _init_MutableFst(tfst.release())\n */\n  if ((__pyx_v_eps_norm_output != 0)) {\n\n    /* \"pywrapfst.pyx\":3542\n *   cdef unique_ptr[fst.VectorFstClass] tfst\n *   tfst.reset(new fst.VectorFstClass(ifst.arc_type()))\n *   fst.EpsNormalize(deref(ifst._fst), tfst.get(), fst.EPS_NORM_OUTPUT if             # <<<<<<<<<<<<<<\n *                                                  eps_norm_output else\n *                                                  fst.EPS_NORM_INPUT)\n */\n    __pyx_t_1 = fst::EPS_NORM_OUTPUT;\n  } else {\n\n    /* \"pywrapfst.pyx\":3544\n *   fst.EpsNormalize(deref(ifst._fst), tfst.get(), fst.EPS_NORM_OUTPUT if\n *                                                  eps_norm_output else\n *                                                  fst.EPS_NORM_INPUT)             # <<<<<<<<<<<<<<\n *   return _init_MutableFst(tfst.release())\n * \n */\n    __pyx_t_1 = fst::EPS_NORM_INPUT;\n  }\n\n  /* \"pywrapfst.pyx\":3542\n *   cdef unique_ptr[fst.VectorFstClass] tfst\n *   tfst.reset(new fst.VectorFstClass(ifst.arc_type()))\n *   fst.EpsNormalize(deref(ifst._fst), tfst.get(), fst.EPS_NORM_OUTPUT if             # <<<<<<<<<<<<<<\n *                                                  eps_norm_output else\n *                                                  fst.EPS_NORM_INPUT)\n */\n  fst::script::EpsNormalize((*__pyx_v_ifst->_fst), __pyx_v_tfst.get(), __pyx_t_1);\n\n  /* \"pywrapfst.pyx\":3545\n *                                                  eps_norm_output else\n *                                                  fst.EPS_NORM_INPUT)\n *   return _init_MutableFst(tfst.release())             # <<<<<<<<<<<<<<\n * \n * \n */\n  __Pyx_XDECREF(((PyObject *)__pyx_r));\n  __pyx_t_2 = ((PyObject *)__pyx_f_9pywrapfst__init_MutableFst(__pyx_v_tfst.release())); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3545, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  __pyx_r = ((struct __pyx_obj_9pywrapfst__MutableFst *)__pyx_t_2);\n  __pyx_t_2 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":3518\n * \n * \n * cpdef _MutableFst epsnormalize(_Fst ifst, bool eps_norm_output=False):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   epsnormalize(ifst, eps_norm_output=False)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_AddTraceback(\"pywrapfst.epsnormalize\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XGIVEREF((PyObject *)__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_29epsnormalize(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic char __pyx_doc_9pywrapfst_28epsnormalize[] = \"\\n  epsnormalize(ifst, eps_norm_output=False)\\n\\n  Constructively epsilon-normalizes an FST.\\n\\n  This operation creates an equivalent FST that is epsilon-normalized. An\\n  acceptor is epsilon-normalized if it it is epsilon-removed (cf. `rmepsilon`).\\n  A transducer is input epsilon-normalized if, in addition, along any path, all\\n  arcs with epsilon input labels follow all arcs with non-epsilon input labels.\\n  Output epsilon-normalized is defined similarly. The input FST must be\\n  functional.\\n\\n  Args:\\n    ifst: The input FST.\\n    eps_norm_output: Should the FST be output epsilon-normalized?\\n\\n  Returns:\\n    An equivalent epsilon-normalized FST.\\n\\n  See also: `rmepsilon`.\\n  \";\nstatic PyObject *__pyx_pw_9pywrapfst_29epsnormalize(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst = 0;\n  bool __pyx_v_eps_norm_output;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"epsnormalize (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_ifst,&__pyx_n_s_eps_norm_output,0};\n    PyObject* values[2] = {0,0};\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (likely((values[0] = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_ifst)) != 0)) kw_args--;\n        else goto __pyx_L5_argtuple_error;\n        CYTHON_FALLTHROUGH;\n        case  1:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_eps_norm_output);\n          if (value) { values[1] = value; kw_args--; }\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"epsnormalize\") < 0)) __PYX_ERR(0, 3518, __pyx_L3_error)\n      }\n    } else {\n      switch (PyTuple_GET_SIZE(__pyx_args)) {\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n    }\n    __pyx_v_ifst = ((struct __pyx_obj_9pywrapfst__Fst *)values[0]);\n    if (values[1]) {\n      __pyx_v_eps_norm_output = __Pyx_PyObject_IsTrue(values[1]); if (unlikely((__pyx_v_eps_norm_output == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 3518, __pyx_L3_error)\n    } else {\n      __pyx_v_eps_norm_output = ((bool)0);\n    }\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"epsnormalize\", 0, 1, 2, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 3518, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst.epsnormalize\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_ifst), __pyx_ptype_9pywrapfst__Fst, 1, \"ifst\", 0))) __PYX_ERR(0, 3518, __pyx_L1_error)\n  __pyx_r = __pyx_pf_9pywrapfst_28epsnormalize(__pyx_self, __pyx_v_ifst, __pyx_v_eps_norm_output);\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_28epsnormalize(CYTHON_UNUSED PyObject *__pyx_self, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst, bool __pyx_v_eps_norm_output) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  struct __pyx_opt_args_9pywrapfst_epsnormalize __pyx_t_2;\n  __Pyx_RefNannySetupContext(\"epsnormalize\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_2.__pyx_n = 1;\n  __pyx_t_2.eps_norm_output = __pyx_v_eps_norm_output;\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst_epsnormalize(__pyx_v_ifst, 0, &__pyx_t_2)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3518, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.epsnormalize\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":3548\n * \n * \n * cpdef bool equal(_Fst ifst1, _Fst ifst2, float delta=fst.kDelta):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   equal(ifst1, ifst2, delta=0.0009765625)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_31equal(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic bool __pyx_f_9pywrapfst_equal(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst1, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst2, CYTHON_UNUSED int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_equal *__pyx_optional_args) {\n  float __pyx_v_delta = __pyx_k__73;\n  bool __pyx_r;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"equal\", 0);\n  if (__pyx_optional_args) {\n    if (__pyx_optional_args->__pyx_n > 0) {\n      __pyx_v_delta = __pyx_optional_args->delta;\n    }\n  }\n\n  /* \"pywrapfst.pyx\":3568\n *   See also: `equivalent`, `isomorphic`, `randequivalent`.\n *   \"\"\"\n *   return fst.Equal(deref(ifst1._fst), deref(ifst2._fst), delta)             # <<<<<<<<<<<<<<\n * \n * \n */\n  if (unlikely(((PyObject *)__pyx_v_ifst1) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 3568, __pyx_L1_error)\n  }\n  if (unlikely(((PyObject *)__pyx_v_ifst2) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 3568, __pyx_L1_error)\n  }\n  __pyx_r = fst::script::Equal((*__pyx_v_ifst1->_fst), (*__pyx_v_ifst2->_fst), __pyx_v_delta);\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":3548\n * \n * \n * cpdef bool equal(_Fst ifst1, _Fst ifst2, float delta=fst.kDelta):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   equal(ifst1, ifst2, delta=0.0009765625)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_WriteUnraisable(\"pywrapfst.equal\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_31equal(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic char __pyx_doc_9pywrapfst_30equal[] = \"\\n  equal(ifst1, ifst2, delta=0.0009765625)\\n\\n  Are two FSTs equal?\\n\\n  This function tests whether two FSTs have the same states with the same\\n  numbering and the same transitions with the same labels and weights in the\\n  same order.\\n\\n  Args:\\n    ifst1: The first input FST.\\n    ifst2: The second input FST.\\n    delta: Comparison/quantization delta.\\n\\n  Returns:\\n    True if the FSTs satisfy the above condition, else False.\\n\\n  See also: `equivalent`, `isomorphic`, `randequivalent`.\\n  \";\nstatic PyObject *__pyx_pw_9pywrapfst_31equal(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst1 = 0;\n  struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst2 = 0;\n  float __pyx_v_delta;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"equal (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_ifst1,&__pyx_n_s_ifst2,&__pyx_n_s_delta,0};\n    PyObject* values[3] = {0,0,0};\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);\n        CYTHON_FALLTHROUGH;\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (likely((values[0] = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_ifst1)) != 0)) kw_args--;\n        else goto __pyx_L5_argtuple_error;\n        CYTHON_FALLTHROUGH;\n        case  1:\n        if (likely((values[1] = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_ifst2)) != 0)) kw_args--;\n        else {\n          __Pyx_RaiseArgtupleInvalid(\"equal\", 0, 2, 3, 1); __PYX_ERR(0, 3548, __pyx_L3_error)\n        }\n        CYTHON_FALLTHROUGH;\n        case  2:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_delta);\n          if (value) { values[2] = value; kw_args--; }\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"equal\") < 0)) __PYX_ERR(0, 3548, __pyx_L3_error)\n      }\n    } else {\n      switch (PyTuple_GET_SIZE(__pyx_args)) {\n        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);\n        CYTHON_FALLTHROUGH;\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n    }\n    __pyx_v_ifst1 = ((struct __pyx_obj_9pywrapfst__Fst *)values[0]);\n    __pyx_v_ifst2 = ((struct __pyx_obj_9pywrapfst__Fst *)values[1]);\n    if (values[2]) {\n      __pyx_v_delta = __pyx_PyFloat_AsFloat(values[2]); if (unlikely((__pyx_v_delta == (float)-1) && PyErr_Occurred())) __PYX_ERR(0, 3548, __pyx_L3_error)\n    } else {\n      __pyx_v_delta = __pyx_k__73;\n    }\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"equal\", 0, 2, 3, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 3548, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst.equal\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_ifst1), __pyx_ptype_9pywrapfst__Fst, 1, \"ifst1\", 0))) __PYX_ERR(0, 3548, __pyx_L1_error)\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_ifst2), __pyx_ptype_9pywrapfst__Fst, 1, \"ifst2\", 0))) __PYX_ERR(0, 3548, __pyx_L1_error)\n  __pyx_r = __pyx_pf_9pywrapfst_30equal(__pyx_self, __pyx_v_ifst1, __pyx_v_ifst2, __pyx_v_delta);\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_30equal(CYTHON_UNUSED PyObject *__pyx_self, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst1, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst2, float __pyx_v_delta) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  bool __pyx_t_1;\n  struct __pyx_opt_args_9pywrapfst_equal __pyx_t_2;\n  PyObject *__pyx_t_3 = NULL;\n  __Pyx_RefNannySetupContext(\"equal\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_2.__pyx_n = 1;\n  __pyx_t_2.delta = __pyx_v_delta;\n  __pyx_t_1 = __pyx_f_9pywrapfst_equal(__pyx_v_ifst1, __pyx_v_ifst2, 0, &__pyx_t_2); \n  __pyx_t_3 = __Pyx_PyBool_FromLong(__pyx_t_1); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 3548, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_3);\n  __pyx_r = __pyx_t_3;\n  __pyx_t_3 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_AddTraceback(\"pywrapfst.equal\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":3571\n * \n * \n * cpdef bool equivalent(_Fst ifst1, _Fst ifst2, float delta=fst.kDelta) except *:             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   equivalent(ifst1, ifst2, delta=0.0009765625)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_33equivalent(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic bool __pyx_f_9pywrapfst_equivalent(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst1, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst2, CYTHON_UNUSED int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_equivalent *__pyx_optional_args) {\n  float __pyx_v_delta = __pyx_k__74;\n  bool __pyx_r;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"equivalent\", 0);\n  if (__pyx_optional_args) {\n    if (__pyx_optional_args->__pyx_n > 0) {\n      __pyx_v_delta = __pyx_optional_args->delta;\n    }\n  }\n\n  /* \"pywrapfst.pyx\":3591\n *   See also: `equal`, `isomorphic`, `randequivalent`.\n *   \"\"\"\n *   return fst.Equivalent(deref(ifst1._fst), deref(ifst2._fst), delta)             # <<<<<<<<<<<<<<\n * \n * \n */\n  if (unlikely(((PyObject *)__pyx_v_ifst1) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 3591, __pyx_L1_error)\n  }\n  if (unlikely(((PyObject *)__pyx_v_ifst2) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 3591, __pyx_L1_error)\n  }\n  __pyx_r = fst::script::Equivalent((*__pyx_v_ifst1->_fst), (*__pyx_v_ifst2->_fst), __pyx_v_delta);\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":3571\n * \n * \n * cpdef bool equivalent(_Fst ifst1, _Fst ifst2, float delta=fst.kDelta) except *:             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   equivalent(ifst1, ifst2, delta=0.0009765625)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"pywrapfst.equivalent\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = -1;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_33equivalent(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic char __pyx_doc_9pywrapfst_32equivalent[] = \"\\n  equivalent(ifst1, ifst2, delta=0.0009765625)\\n\\n  Are the two acceptors equivalent?\\n\\n  This operation tests whether two epsilon-free deterministic weighted\\n  acceptors are equivalent, that is if they accept the same strings with the\\n  same weights.\\n\\n  Args:\\n    ifst1: The first input FST.\\n    ifst2: The second input FST.\\n    delta: Comparison/quantization delta.\\n\\n  Returns:\\n    True if the FSTs satisfy the above condition, else False.\\n\\n  See also: `equal`, `isomorphic`, `randequivalent`.\\n  \";\nstatic PyObject *__pyx_pw_9pywrapfst_33equivalent(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst1 = 0;\n  struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst2 = 0;\n  float __pyx_v_delta;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"equivalent (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_ifst1,&__pyx_n_s_ifst2,&__pyx_n_s_delta,0};\n    PyObject* values[3] = {0,0,0};\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);\n        CYTHON_FALLTHROUGH;\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (likely((values[0] = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_ifst1)) != 0)) kw_args--;\n        else goto __pyx_L5_argtuple_error;\n        CYTHON_FALLTHROUGH;\n        case  1:\n        if (likely((values[1] = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_ifst2)) != 0)) kw_args--;\n        else {\n          __Pyx_RaiseArgtupleInvalid(\"equivalent\", 0, 2, 3, 1); __PYX_ERR(0, 3571, __pyx_L3_error)\n        }\n        CYTHON_FALLTHROUGH;\n        case  2:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_delta);\n          if (value) { values[2] = value; kw_args--; }\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"equivalent\") < 0)) __PYX_ERR(0, 3571, __pyx_L3_error)\n      }\n    } else {\n      switch (PyTuple_GET_SIZE(__pyx_args)) {\n        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);\n        CYTHON_FALLTHROUGH;\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n    }\n    __pyx_v_ifst1 = ((struct __pyx_obj_9pywrapfst__Fst *)values[0]);\n    __pyx_v_ifst2 = ((struct __pyx_obj_9pywrapfst__Fst *)values[1]);\n    if (values[2]) {\n      __pyx_v_delta = __pyx_PyFloat_AsFloat(values[2]); if (unlikely((__pyx_v_delta == (float)-1) && PyErr_Occurred())) __PYX_ERR(0, 3571, __pyx_L3_error)\n    } else {\n      __pyx_v_delta = __pyx_k__74;\n    }\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"equivalent\", 0, 2, 3, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 3571, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst.equivalent\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_ifst1), __pyx_ptype_9pywrapfst__Fst, 1, \"ifst1\", 0))) __PYX_ERR(0, 3571, __pyx_L1_error)\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_ifst2), __pyx_ptype_9pywrapfst__Fst, 1, \"ifst2\", 0))) __PYX_ERR(0, 3571, __pyx_L1_error)\n  __pyx_r = __pyx_pf_9pywrapfst_32equivalent(__pyx_self, __pyx_v_ifst1, __pyx_v_ifst2, __pyx_v_delta);\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_32equivalent(CYTHON_UNUSED PyObject *__pyx_self, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst1, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst2, float __pyx_v_delta) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  bool __pyx_t_1;\n  struct __pyx_opt_args_9pywrapfst_equivalent __pyx_t_2;\n  PyObject *__pyx_t_3 = NULL;\n  __Pyx_RefNannySetupContext(\"equivalent\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_2.__pyx_n = 1;\n  __pyx_t_2.delta = __pyx_v_delta;\n  __pyx_t_1 = __pyx_f_9pywrapfst_equivalent(__pyx_v_ifst1, __pyx_v_ifst2, 0, &__pyx_t_2); if (unlikely(__pyx_t_1 == ((bool)-1) && PyErr_Occurred())) __PYX_ERR(0, 3571, __pyx_L1_error)\n  __pyx_t_3 = __Pyx_PyBool_FromLong(__pyx_t_1); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 3571, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_3);\n  __pyx_r = __pyx_t_3;\n  __pyx_t_3 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_AddTraceback(\"pywrapfst.equivalent\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":3594\n * \n * \n * cpdef _MutableFst intersect(_Fst ifst1,             # <<<<<<<<<<<<<<\n *                             _Fst ifst2,\n *                             compose_filter=b\"auto\",\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_35intersect(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic struct __pyx_obj_9pywrapfst__MutableFst *__pyx_f_9pywrapfst_intersect(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst1, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst2, CYTHON_UNUSED int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_intersect *__pyx_optional_args) {\n  PyObject *__pyx_v_compose_filter = ((PyObject *)__pyx_n_b_auto);\n\n  /* \"pywrapfst.pyx\":3597\n *                             _Fst ifst2,\n *                             compose_filter=b\"auto\",\n *                             bool connect=True):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   intersect(ifst1, ifst2, compose_filter=\"auto\", connect=True)\n */\n  bool __pyx_v_connect = ((bool)1);\n  std::unique_ptr<fst::script::VectorFstClass>  __pyx_v_tfst;\n  std::unique_ptr<fst::ComposeOptions>  __pyx_v_opts;\n  struct __pyx_obj_9pywrapfst__MutableFst *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  std::string __pyx_t_1;\n  enum fst::ComposeFilter __pyx_t_2;\n  PyObject *__pyx_t_3 = NULL;\n  __Pyx_RefNannySetupContext(\"intersect\", 0);\n  if (__pyx_optional_args) {\n    if (__pyx_optional_args->__pyx_n > 0) {\n      __pyx_v_compose_filter = __pyx_optional_args->compose_filter;\n      if (__pyx_optional_args->__pyx_n > 1) {\n        __pyx_v_connect = __pyx_optional_args->connect;\n      }\n    }\n  }\n\n  /* \"pywrapfst.pyx\":3619\n *   \"\"\"\n *   cdef unique_ptr[fst.VectorFstClass] tfst\n *   tfst.reset(new fst.VectorFstClass(ifst1.arc_type()))             # <<<<<<<<<<<<<<\n *   cdef unique_ptr[fst.ComposeOptions] opts\n *   opts.reset(new fst.ComposeOptions(connect,\n */\n  if (unlikely(((PyObject *)__pyx_v_ifst1) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"arc_type\");\n    __PYX_ERR(0, 3619, __pyx_L1_error)\n  }\n  __pyx_v_tfst.reset(new fst::script::VectorFstClass(((struct __pyx_vtabstruct_9pywrapfst__Fst *)__pyx_v_ifst1->__pyx_vtab)->arc_type(__pyx_v_ifst1, 0)));\n\n  /* \"pywrapfst.pyx\":3622\n *   cdef unique_ptr[fst.ComposeOptions] opts\n *   opts.reset(new fst.ComposeOptions(connect,\n *         _get_compose_filter(tostring(compose_filter))))             # <<<<<<<<<<<<<<\n *   fst.Intersect(deref(ifst1._fst), deref(ifst2._fst), tfst.get(), deref(opts))\n *   return _init_MutableFst(tfst.release())\n */\n  __pyx_t_1 = __pyx_f_9pywrapfst_tostring(__pyx_v_compose_filter, NULL); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 3622, __pyx_L1_error)\n  __pyx_t_2 = __pyx_f_9pywrapfst__get_compose_filter(__pyx_t_1); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 3622, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":3621\n *   tfst.reset(new fst.VectorFstClass(ifst1.arc_type()))\n *   cdef unique_ptr[fst.ComposeOptions] opts\n *   opts.reset(new fst.ComposeOptions(connect,             # <<<<<<<<<<<<<<\n *         _get_compose_filter(tostring(compose_filter))))\n *   fst.Intersect(deref(ifst1._fst), deref(ifst2._fst), tfst.get(), deref(opts))\n */\n  __pyx_v_opts.reset(new fst::ComposeOptions(__pyx_v_connect, __pyx_t_2));\n\n  /* \"pywrapfst.pyx\":3623\n *   opts.reset(new fst.ComposeOptions(connect,\n *         _get_compose_filter(tostring(compose_filter))))\n *   fst.Intersect(deref(ifst1._fst), deref(ifst2._fst), tfst.get(), deref(opts))             # <<<<<<<<<<<<<<\n *   return _init_MutableFst(tfst.release())\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_ifst1) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 3623, __pyx_L1_error)\n  }\n  if (unlikely(((PyObject *)__pyx_v_ifst2) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 3623, __pyx_L1_error)\n  }\n  fst::script::Intersect((*__pyx_v_ifst1->_fst), (*__pyx_v_ifst2->_fst), __pyx_v_tfst.get(), (*__pyx_v_opts));\n\n  /* \"pywrapfst.pyx\":3624\n *         _get_compose_filter(tostring(compose_filter))))\n *   fst.Intersect(deref(ifst1._fst), deref(ifst2._fst), tfst.get(), deref(opts))\n *   return _init_MutableFst(tfst.release())             # <<<<<<<<<<<<<<\n * \n * \n */\n  __Pyx_XDECREF(((PyObject *)__pyx_r));\n  __pyx_t_3 = ((PyObject *)__pyx_f_9pywrapfst__init_MutableFst(__pyx_v_tfst.release())); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 3624, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_3);\n  __pyx_r = ((struct __pyx_obj_9pywrapfst__MutableFst *)__pyx_t_3);\n  __pyx_t_3 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":3594\n * \n * \n * cpdef _MutableFst intersect(_Fst ifst1,             # <<<<<<<<<<<<<<\n *                             _Fst ifst2,\n *                             compose_filter=b\"auto\",\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_AddTraceback(\"pywrapfst.intersect\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XGIVEREF((PyObject *)__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_35intersect(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic char __pyx_doc_9pywrapfst_34intersect[] = \"\\n  intersect(ifst1, ifst2, compose_filter=\\\"auto\\\", connect=True)\\n\\n  Constructively intersects two FSTs.\\n\\n  This operation computes the intersection (Hadamard product) of two FSTs.\\n  Only strings that are in both automata are retained in the result. The two\\n  arguments must be acceptors. One of the arguments must be label-sorted (or\\n  otherwise support appropriate matchers).\\n\\n  Args:\\n    ifst1: The first input FST.\\n    ifst2: The second input FST.\\n    compose_filter: A string matching a known composition filter; one of:\\n        \\\"alt_sequence\\\", \\\"auto\\\", \\\"match\\\", \\\"null\\\", \\\"sequence\\\", \\\"trivial\\\".\\n    connect: Should output be trimmed?\\n\\n  Returns:\\n    An intersected FST.\\n  \";\nstatic PyObject *__pyx_pw_9pywrapfst_35intersect(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst1 = 0;\n  struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst2 = 0;\n  PyObject *__pyx_v_compose_filter = 0;\n  bool __pyx_v_connect;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"intersect (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_ifst1,&__pyx_n_s_ifst2,&__pyx_n_s_compose_filter,&__pyx_n_s_connect,0};\n    PyObject* values[4] = {0,0,0,0};\n    values[2] = ((PyObject *)__pyx_n_b_auto);\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  4: values[3] = PyTuple_GET_ITEM(__pyx_args, 3);\n        CYTHON_FALLTHROUGH;\n        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);\n        CYTHON_FALLTHROUGH;\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (likely((values[0] = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_ifst1)) != 0)) kw_args--;\n        else goto __pyx_L5_argtuple_error;\n        CYTHON_FALLTHROUGH;\n        case  1:\n        if (likely((values[1] = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_ifst2)) != 0)) kw_args--;\n        else {\n          __Pyx_RaiseArgtupleInvalid(\"intersect\", 0, 2, 4, 1); __PYX_ERR(0, 3594, __pyx_L3_error)\n        }\n        CYTHON_FALLTHROUGH;\n        case  2:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_compose_filter);\n          if (value) { values[2] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  3:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_connect);\n          if (value) { values[3] = value; kw_args--; }\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"intersect\") < 0)) __PYX_ERR(0, 3594, __pyx_L3_error)\n      }\n    } else {\n      switch (PyTuple_GET_SIZE(__pyx_args)) {\n        case  4: values[3] = PyTuple_GET_ITEM(__pyx_args, 3);\n        CYTHON_FALLTHROUGH;\n        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);\n        CYTHON_FALLTHROUGH;\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n    }\n    __pyx_v_ifst1 = ((struct __pyx_obj_9pywrapfst__Fst *)values[0]);\n    __pyx_v_ifst2 = ((struct __pyx_obj_9pywrapfst__Fst *)values[1]);\n    __pyx_v_compose_filter = values[2];\n    if (values[3]) {\n      __pyx_v_connect = __Pyx_PyObject_IsTrue(values[3]); if (unlikely((__pyx_v_connect == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 3597, __pyx_L3_error)\n    } else {\n\n      /* \"pywrapfst.pyx\":3597\n *                             _Fst ifst2,\n *                             compose_filter=b\"auto\",\n *                             bool connect=True):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   intersect(ifst1, ifst2, compose_filter=\"auto\", connect=True)\n */\n      __pyx_v_connect = ((bool)1);\n    }\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"intersect\", 0, 2, 4, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 3594, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst.intersect\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_ifst1), __pyx_ptype_9pywrapfst__Fst, 1, \"ifst1\", 0))) __PYX_ERR(0, 3594, __pyx_L1_error)\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_ifst2), __pyx_ptype_9pywrapfst__Fst, 1, \"ifst2\", 0))) __PYX_ERR(0, 3595, __pyx_L1_error)\n  __pyx_r = __pyx_pf_9pywrapfst_34intersect(__pyx_self, __pyx_v_ifst1, __pyx_v_ifst2, __pyx_v_compose_filter, __pyx_v_connect);\n\n  /* \"pywrapfst.pyx\":3594\n * \n * \n * cpdef _MutableFst intersect(_Fst ifst1,             # <<<<<<<<<<<<<<\n *                             _Fst ifst2,\n *                             compose_filter=b\"auto\",\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_34intersect(CYTHON_UNUSED PyObject *__pyx_self, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst1, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst2, PyObject *__pyx_v_compose_filter, bool __pyx_v_connect) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  struct __pyx_opt_args_9pywrapfst_intersect __pyx_t_2;\n  __Pyx_RefNannySetupContext(\"intersect\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_2.__pyx_n = 2;\n  __pyx_t_2.compose_filter = __pyx_v_compose_filter;\n  __pyx_t_2.connect = __pyx_v_connect;\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst_intersect(__pyx_v_ifst1, __pyx_v_ifst2, 0, &__pyx_t_2)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3594, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.intersect\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":3627\n * \n * \n * cpdef bool isomorphic(_Fst ifst1, _Fst ifst2, float delta=fst.kDelta):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   isomorphic(ifst1, ifst2, delta=0.0009765625)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_37isomorphic(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic bool __pyx_f_9pywrapfst_isomorphic(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst1, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst2, CYTHON_UNUSED int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_isomorphic *__pyx_optional_args) {\n  float __pyx_v_delta = __pyx_k__75;\n  bool __pyx_r;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"isomorphic\", 0);\n  if (__pyx_optional_args) {\n    if (__pyx_optional_args->__pyx_n > 0) {\n      __pyx_v_delta = __pyx_optional_args->delta;\n    }\n  }\n\n  /* \"pywrapfst.pyx\":3650\n *   See also: `equal`, `equivalent`, `randequivalent`.\n *   \"\"\"\n *   return fst.Isomorphic(deref(ifst1._fst), deref(ifst2._fst), delta)             # <<<<<<<<<<<<<<\n * \n * \n */\n  if (unlikely(((PyObject *)__pyx_v_ifst1) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 3650, __pyx_L1_error)\n  }\n  if (unlikely(((PyObject *)__pyx_v_ifst2) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 3650, __pyx_L1_error)\n  }\n  __pyx_r = fst::script::Isomorphic((*__pyx_v_ifst1->_fst), (*__pyx_v_ifst2->_fst), __pyx_v_delta);\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":3627\n * \n * \n * cpdef bool isomorphic(_Fst ifst1, _Fst ifst2, float delta=fst.kDelta):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   isomorphic(ifst1, ifst2, delta=0.0009765625)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_WriteUnraisable(\"pywrapfst.isomorphic\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_37isomorphic(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic char __pyx_doc_9pywrapfst_36isomorphic[] = \"\\n  isomorphic(ifst1, ifst2, delta=0.0009765625)\\n\\n  Are the two acceptors isomorphic?\\n\\n  This operation determines if two transducers with a certain required\\n  determinism have the same states, irrespective of numbering, and the same\\n  transitions with the same labels and weights, irrespective of ordering. In\\n  other words, FSTs A, B are isomorphic if and only if the states of A can be\\n  renumbered and the transitions leaving each state reordered so the two are\\n  equal (according to the definition given in `equal`).\\n\\n  Args:\\n    ifst1: The first input FST.\\n    ifst2: The second input FST.\\n    delta: Comparison/quantization delta.\\n\\n  Returns:\\n    True if the two transducers satisfy the above condition, else False.\\n\\n  See also: `equal`, `equivalent`, `randequivalent`.\\n  \";\nstatic PyObject *__pyx_pw_9pywrapfst_37isomorphic(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst1 = 0;\n  struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst2 = 0;\n  float __pyx_v_delta;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"isomorphic (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_ifst1,&__pyx_n_s_ifst2,&__pyx_n_s_delta,0};\n    PyObject* values[3] = {0,0,0};\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);\n        CYTHON_FALLTHROUGH;\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (likely((values[0] = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_ifst1)) != 0)) kw_args--;\n        else goto __pyx_L5_argtuple_error;\n        CYTHON_FALLTHROUGH;\n        case  1:\n        if (likely((values[1] = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_ifst2)) != 0)) kw_args--;\n        else {\n          __Pyx_RaiseArgtupleInvalid(\"isomorphic\", 0, 2, 3, 1); __PYX_ERR(0, 3627, __pyx_L3_error)\n        }\n        CYTHON_FALLTHROUGH;\n        case  2:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_delta);\n          if (value) { values[2] = value; kw_args--; }\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"isomorphic\") < 0)) __PYX_ERR(0, 3627, __pyx_L3_error)\n      }\n    } else {\n      switch (PyTuple_GET_SIZE(__pyx_args)) {\n        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);\n        CYTHON_FALLTHROUGH;\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n    }\n    __pyx_v_ifst1 = ((struct __pyx_obj_9pywrapfst__Fst *)values[0]);\n    __pyx_v_ifst2 = ((struct __pyx_obj_9pywrapfst__Fst *)values[1]);\n    if (values[2]) {\n      __pyx_v_delta = __pyx_PyFloat_AsFloat(values[2]); if (unlikely((__pyx_v_delta == (float)-1) && PyErr_Occurred())) __PYX_ERR(0, 3627, __pyx_L3_error)\n    } else {\n      __pyx_v_delta = __pyx_k__75;\n    }\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"isomorphic\", 0, 2, 3, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 3627, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst.isomorphic\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_ifst1), __pyx_ptype_9pywrapfst__Fst, 1, \"ifst1\", 0))) __PYX_ERR(0, 3627, __pyx_L1_error)\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_ifst2), __pyx_ptype_9pywrapfst__Fst, 1, \"ifst2\", 0))) __PYX_ERR(0, 3627, __pyx_L1_error)\n  __pyx_r = __pyx_pf_9pywrapfst_36isomorphic(__pyx_self, __pyx_v_ifst1, __pyx_v_ifst2, __pyx_v_delta);\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_36isomorphic(CYTHON_UNUSED PyObject *__pyx_self, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst1, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst2, float __pyx_v_delta) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  bool __pyx_t_1;\n  struct __pyx_opt_args_9pywrapfst_isomorphic __pyx_t_2;\n  PyObject *__pyx_t_3 = NULL;\n  __Pyx_RefNannySetupContext(\"isomorphic\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_2.__pyx_n = 1;\n  __pyx_t_2.delta = __pyx_v_delta;\n  __pyx_t_1 = __pyx_f_9pywrapfst_isomorphic(__pyx_v_ifst1, __pyx_v_ifst2, 0, &__pyx_t_2); \n  __pyx_t_3 = __Pyx_PyBool_FromLong(__pyx_t_1); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 3627, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_3);\n  __pyx_r = __pyx_t_3;\n  __pyx_t_3 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_AddTraceback(\"pywrapfst.isomorphic\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":3653\n * \n * \n * cpdef _MutableFst prune(_Fst ifst,             # <<<<<<<<<<<<<<\n *                         float delta=fst.kDelta,\n *                         int64 nstate=fst.kNoStateId,\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_39prune(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic struct __pyx_obj_9pywrapfst__MutableFst *__pyx_f_9pywrapfst_prune(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst, CYTHON_UNUSED int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_prune *__pyx_optional_args) {\n  float __pyx_v_delta = __pyx_k__76;\n  __pyx_t_10basictypes_int64 __pyx_v_nstate = __pyx_k__77;\n\n  /* \"pywrapfst.pyx\":3656\n *                         float delta=fst.kDelta,\n *                         int64 nstate=fst.kNoStateId,\n *                         weight=None):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   prune(ifst, delta=0.0009765625, nstate=NO_STATE_ID, weight=None)\n */\n  PyObject *__pyx_v_weight = ((PyObject *)Py_None);\n  std::unique_ptr<fst::script::VectorFstClass>  __pyx_v_tfst;\n  fst::script::WeightClass __pyx_v_wc;\n  struct __pyx_obj_9pywrapfst__MutableFst *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  fst::script::WeightClass __pyx_t_1;\n  PyObject *__pyx_t_2 = NULL;\n  __Pyx_RefNannySetupContext(\"prune\", 0);\n  if (__pyx_optional_args) {\n    if (__pyx_optional_args->__pyx_n > 0) {\n      __pyx_v_delta = __pyx_optional_args->delta;\n      if (__pyx_optional_args->__pyx_n > 1) {\n        __pyx_v_nstate = __pyx_optional_args->nstate;\n        if (__pyx_optional_args->__pyx_n > 2) {\n          __pyx_v_weight = __pyx_optional_args->weight;\n        }\n      }\n    }\n  }\n\n  /* \"pywrapfst.pyx\":3680\n *   \"\"\"\n *   cdef unique_ptr[fst.VectorFstClass] tfst\n *   tfst.reset(new fst.VectorFstClass(ifst.arc_type()))             # <<<<<<<<<<<<<<\n *   cdef fst.WeightClass wc = _get_WeightClass_or_Zero(ifst.weight_type(), weight)\n *   fst.Prune(deref(ifst._fst), tfst.get(), wc, nstate, delta)\n */\n  if (unlikely(((PyObject *)__pyx_v_ifst) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"arc_type\");\n    __PYX_ERR(0, 3680, __pyx_L1_error)\n  }\n  __pyx_v_tfst.reset(new fst::script::VectorFstClass(((struct __pyx_vtabstruct_9pywrapfst__Fst *)__pyx_v_ifst->__pyx_vtab)->arc_type(__pyx_v_ifst, 0)));\n\n  /* \"pywrapfst.pyx\":3681\n *   cdef unique_ptr[fst.VectorFstClass] tfst\n *   tfst.reset(new fst.VectorFstClass(ifst.arc_type()))\n *   cdef fst.WeightClass wc = _get_WeightClass_or_Zero(ifst.weight_type(), weight)             # <<<<<<<<<<<<<<\n *   fst.Prune(deref(ifst._fst), tfst.get(), wc, nstate, delta)\n *   return _init_MutableFst(tfst.release())\n */\n  if (unlikely(((PyObject *)__pyx_v_ifst) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"weight_type\");\n    __PYX_ERR(0, 3681, __pyx_L1_error)\n  }\n  __pyx_t_1 = __pyx_f_9pywrapfst__get_WeightClass_or_Zero(((struct __pyx_vtabstruct_9pywrapfst__Fst *)__pyx_v_ifst->__pyx_vtab)->weight_type(__pyx_v_ifst, 0), __pyx_v_weight); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 3681, __pyx_L1_error)\n  __pyx_v_wc = __pyx_t_1;\n\n  /* \"pywrapfst.pyx\":3682\n *   tfst.reset(new fst.VectorFstClass(ifst.arc_type()))\n *   cdef fst.WeightClass wc = _get_WeightClass_or_Zero(ifst.weight_type(), weight)\n *   fst.Prune(deref(ifst._fst), tfst.get(), wc, nstate, delta)             # <<<<<<<<<<<<<<\n *   return _init_MutableFst(tfst.release())\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_ifst) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 3682, __pyx_L1_error)\n  }\n  fst::script::Prune((*__pyx_v_ifst->_fst), __pyx_v_tfst.get(), __pyx_v_wc, __pyx_v_nstate, __pyx_v_delta);\n\n  /* \"pywrapfst.pyx\":3683\n *   cdef fst.WeightClass wc = _get_WeightClass_or_Zero(ifst.weight_type(), weight)\n *   fst.Prune(deref(ifst._fst), tfst.get(), wc, nstate, delta)\n *   return _init_MutableFst(tfst.release())             # <<<<<<<<<<<<<<\n * \n * \n */\n  __Pyx_XDECREF(((PyObject *)__pyx_r));\n  __pyx_t_2 = ((PyObject *)__pyx_f_9pywrapfst__init_MutableFst(__pyx_v_tfst.release())); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3683, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  __pyx_r = ((struct __pyx_obj_9pywrapfst__MutableFst *)__pyx_t_2);\n  __pyx_t_2 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":3653\n * \n * \n * cpdef _MutableFst prune(_Fst ifst,             # <<<<<<<<<<<<<<\n *                         float delta=fst.kDelta,\n *                         int64 nstate=fst.kNoStateId,\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_AddTraceback(\"pywrapfst.prune\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XGIVEREF((PyObject *)__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_39prune(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic char __pyx_doc_9pywrapfst_38prune[] = \"\\n  prune(ifst, delta=0.0009765625, nstate=NO_STATE_ID, weight=None)\\n\\n  Constructively removes paths with weights below a certain threshold.\\n\\n  This operation deletes states and arcs in the input FST that do not belong\\n  to a successful path whose weight is no more (w.r.t the natural semiring\\n  order) than the threshold t \\\\otimes-times the weight of the shortest path in\\n  the input FST. Weights must be commutative and have the path property.\\n\\n  Args:\\n    ifst: The input FST.\\n    delta: Comparison/quantization delta.\\n    nstate: State number threshold.\\n    weight: A Weight or weight string indicating the desired weight threshold\\n        below which paths are pruned; if omitted, no paths are pruned.\\n\\n  Returns:\\n    A pruned FST.\\n\\n  See also: The destructive variant.\\n  \";\nstatic PyObject *__pyx_pw_9pywrapfst_39prune(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst = 0;\n  float __pyx_v_delta;\n  __pyx_t_10basictypes_int64 __pyx_v_nstate;\n  PyObject *__pyx_v_weight = 0;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"prune (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_ifst,&__pyx_n_s_delta,&__pyx_n_s_nstate,&__pyx_n_s_weight,0};\n    PyObject* values[4] = {0,0,0,0};\n\n    /* \"pywrapfst.pyx\":3656\n *                         float delta=fst.kDelta,\n *                         int64 nstate=fst.kNoStateId,\n *                         weight=None):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   prune(ifst, delta=0.0009765625, nstate=NO_STATE_ID, weight=None)\n */\n    values[3] = ((PyObject *)Py_None);\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  4: values[3] = PyTuple_GET_ITEM(__pyx_args, 3);\n        CYTHON_FALLTHROUGH;\n        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);\n        CYTHON_FALLTHROUGH;\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (likely((values[0] = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_ifst)) != 0)) kw_args--;\n        else goto __pyx_L5_argtuple_error;\n        CYTHON_FALLTHROUGH;\n        case  1:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_delta);\n          if (value) { values[1] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  2:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_nstate);\n          if (value) { values[2] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  3:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_weight);\n          if (value) { values[3] = value; kw_args--; }\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"prune\") < 0)) __PYX_ERR(0, 3653, __pyx_L3_error)\n      }\n    } else {\n      switch (PyTuple_GET_SIZE(__pyx_args)) {\n        case  4: values[3] = PyTuple_GET_ITEM(__pyx_args, 3);\n        CYTHON_FALLTHROUGH;\n        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);\n        CYTHON_FALLTHROUGH;\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n    }\n    __pyx_v_ifst = ((struct __pyx_obj_9pywrapfst__Fst *)values[0]);\n    if (values[1]) {\n      __pyx_v_delta = __pyx_PyFloat_AsFloat(values[1]); if (unlikely((__pyx_v_delta == (float)-1) && PyErr_Occurred())) __PYX_ERR(0, 3654, __pyx_L3_error)\n    } else {\n      __pyx_v_delta = __pyx_k__76;\n    }\n    if (values[2]) {\n      __pyx_v_nstate = __Pyx_PyInt_As_int64_t(values[2]); if (unlikely((__pyx_v_nstate == ((int64_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 3655, __pyx_L3_error)\n    } else {\n      __pyx_v_nstate = __pyx_k__77;\n    }\n    __pyx_v_weight = values[3];\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"prune\", 0, 1, 4, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 3653, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst.prune\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_ifst), __pyx_ptype_9pywrapfst__Fst, 1, \"ifst\", 0))) __PYX_ERR(0, 3653, __pyx_L1_error)\n  __pyx_r = __pyx_pf_9pywrapfst_38prune(__pyx_self, __pyx_v_ifst, __pyx_v_delta, __pyx_v_nstate, __pyx_v_weight);\n\n  /* \"pywrapfst.pyx\":3653\n * \n * \n * cpdef _MutableFst prune(_Fst ifst,             # <<<<<<<<<<<<<<\n *                         float delta=fst.kDelta,\n *                         int64 nstate=fst.kNoStateId,\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_38prune(CYTHON_UNUSED PyObject *__pyx_self, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst, float __pyx_v_delta, __pyx_t_10basictypes_int64 __pyx_v_nstate, PyObject *__pyx_v_weight) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  struct __pyx_opt_args_9pywrapfst_prune __pyx_t_2;\n  __Pyx_RefNannySetupContext(\"prune\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_2.__pyx_n = 3;\n  __pyx_t_2.delta = __pyx_v_delta;\n  __pyx_t_2.nstate = __pyx_v_nstate;\n  __pyx_t_2.weight = __pyx_v_weight;\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst_prune(__pyx_v_ifst, 0, &__pyx_t_2)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3653, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.prune\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":3686\n * \n * \n * cpdef _MutableFst push(_Fst ifst,             # <<<<<<<<<<<<<<\n *                        float delta=fst.kDelta,\n *                        bool push_weights=False,\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_41push(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic struct __pyx_obj_9pywrapfst__MutableFst *__pyx_f_9pywrapfst_push(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst, CYTHON_UNUSED int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_push *__pyx_optional_args) {\n  float __pyx_v_delta = __pyx_k__78;\n\n  /* \"pywrapfst.pyx\":3688\n * cpdef _MutableFst push(_Fst ifst,\n *                        float delta=fst.kDelta,\n *                        bool push_weights=False,             # <<<<<<<<<<<<<<\n *                        bool push_labels=False,\n *                        bool remove_common_affix=False,\n */\n  bool __pyx_v_push_weights = ((bool)0);\n\n  /* \"pywrapfst.pyx\":3689\n *                        float delta=fst.kDelta,\n *                        bool push_weights=False,\n *                        bool push_labels=False,             # <<<<<<<<<<<<<<\n *                        bool remove_common_affix=False,\n *                        bool remove_total_weight=False,\n */\n  bool __pyx_v_push_labels = ((bool)0);\n\n  /* \"pywrapfst.pyx\":3690\n *                        bool push_weights=False,\n *                        bool push_labels=False,\n *                        bool remove_common_affix=False,             # <<<<<<<<<<<<<<\n *                        bool remove_total_weight=False,\n *                        bool to_final=False):\n */\n  bool __pyx_v_remove_common_affix = ((bool)0);\n\n  /* \"pywrapfst.pyx\":3691\n *                        bool push_labels=False,\n *                        bool remove_common_affix=False,\n *                        bool remove_total_weight=False,             # <<<<<<<<<<<<<<\n *                        bool to_final=False):\n *   \"\"\"\n */\n  bool __pyx_v_remove_total_weight = ((bool)0);\n\n  /* \"pywrapfst.pyx\":3692\n *                        bool remove_common_affix=False,\n *                        bool remove_total_weight=False,\n *                        bool to_final=False):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   push(ifst, delta=0.0009765625, push_weights=False, push_labels=False,\n */\n  bool __pyx_v_to_final = ((bool)0);\n  std::unique_ptr<fst::script::VectorFstClass>  __pyx_v_tfst;\n  __pyx_t_10basictypes_uint32 __pyx_v_flags;\n  struct __pyx_obj_9pywrapfst__MutableFst *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"push\", 0);\n  if (__pyx_optional_args) {\n    if (__pyx_optional_args->__pyx_n > 0) {\n      __pyx_v_delta = __pyx_optional_args->delta;\n      if (__pyx_optional_args->__pyx_n > 1) {\n        __pyx_v_push_weights = __pyx_optional_args->push_weights;\n        if (__pyx_optional_args->__pyx_n > 2) {\n          __pyx_v_push_labels = __pyx_optional_args->push_labels;\n          if (__pyx_optional_args->__pyx_n > 3) {\n            __pyx_v_remove_common_affix = __pyx_optional_args->remove_common_affix;\n            if (__pyx_optional_args->__pyx_n > 4) {\n              __pyx_v_remove_total_weight = __pyx_optional_args->remove_total_weight;\n              if (__pyx_optional_args->__pyx_n > 5) {\n                __pyx_v_to_final = __pyx_optional_args->to_final;\n              }\n            }\n          }\n        }\n      }\n    }\n  }\n\n  /* \"pywrapfst.pyx\":3732\n *   # This is copied, almost verbatim, from nlp/fst/bin/fstpush.cc.\n *   cdef unique_ptr[fst.VectorFstClass] tfst\n *   tfst.reset(new fst.VectorFstClass(ifst.arc_type()))             # <<<<<<<<<<<<<<\n *   cdef uint32 flags = fst.GetPushFlags(push_weights, push_labels,\n *                                        remove_common_affix, remove_total_weight)\n */\n  if (unlikely(((PyObject *)__pyx_v_ifst) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"arc_type\");\n    __PYX_ERR(0, 3732, __pyx_L1_error)\n  }\n  __pyx_v_tfst.reset(new fst::script::VectorFstClass(((struct __pyx_vtabstruct_9pywrapfst__Fst *)__pyx_v_ifst->__pyx_vtab)->arc_type(__pyx_v_ifst, 0)));\n\n  /* \"pywrapfst.pyx\":3733\n *   cdef unique_ptr[fst.VectorFstClass] tfst\n *   tfst.reset(new fst.VectorFstClass(ifst.arc_type()))\n *   cdef uint32 flags = fst.GetPushFlags(push_weights, push_labels,             # <<<<<<<<<<<<<<\n *                                        remove_common_affix, remove_total_weight)\n *   fst.Push(deref(ifst._fst), tfst.get(), flags, fst.GetReweightType(to_final),\n */\n  __pyx_v_flags = fst::script::GetPushFlags(__pyx_v_push_weights, __pyx_v_push_labels, __pyx_v_remove_common_affix, __pyx_v_remove_total_weight);\n\n  /* \"pywrapfst.pyx\":3735\n *   cdef uint32 flags = fst.GetPushFlags(push_weights, push_labels,\n *                                        remove_common_affix, remove_total_weight)\n *   fst.Push(deref(ifst._fst), tfst.get(), flags, fst.GetReweightType(to_final),             # <<<<<<<<<<<<<<\n *            delta)\n *   return _init_MutableFst(tfst.release())\n */\n  if (unlikely(((PyObject *)__pyx_v_ifst) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 3735, __pyx_L1_error)\n  }\n\n  /* \"pywrapfst.pyx\":3736\n *                                        remove_common_affix, remove_total_weight)\n *   fst.Push(deref(ifst._fst), tfst.get(), flags, fst.GetReweightType(to_final),\n *            delta)             # <<<<<<<<<<<<<<\n *   return _init_MutableFst(tfst.release())\n * \n */\n  fst::script::Push((*__pyx_v_ifst->_fst), __pyx_v_tfst.get(), __pyx_v_flags, fst::script::GetReweightType(__pyx_v_to_final), __pyx_v_delta);\n\n  /* \"pywrapfst.pyx\":3737\n *   fst.Push(deref(ifst._fst), tfst.get(), flags, fst.GetReweightType(to_final),\n *            delta)\n *   return _init_MutableFst(tfst.release())             # <<<<<<<<<<<<<<\n * \n * \n */\n  __Pyx_XDECREF(((PyObject *)__pyx_r));\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst__init_MutableFst(__pyx_v_tfst.release())); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3737, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = ((struct __pyx_obj_9pywrapfst__MutableFst *)__pyx_t_1);\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":3686\n * \n * \n * cpdef _MutableFst push(_Fst ifst,             # <<<<<<<<<<<<<<\n *                        float delta=fst.kDelta,\n *                        bool push_weights=False,\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.push\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XGIVEREF((PyObject *)__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_41push(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic char __pyx_doc_9pywrapfst_40push[] = \"\\n  push(ifst, delta=0.0009765625, push_weights=False, push_labels=False,\\n       remove_common_affix=False, remove_total_weight=False, to_final=False)\\n\\n  Constructively pushes weights/labels towards initial or final states.\\n\\n  This operation produces an equivalent transducer by pushing the weights\\n  and/or the labels towards the initial state or toward the final states.\\n\\n  When pushing weights towards the initial state, the sum of the weight of the\\n  outgoing transitions and final weight at any non-initial state is equal to 1\\n  in the resulting machine. When pushing weights towards the final states, the\\n  sum of the weight of the incoming transitions at any state is equal to 1.\\n  Weights need to be left distributive when pushing towards the initial state\\n  and right distributive when pushing towards the final states.\\n\\n  Pushing labels towards the initial state consists in minimizing at every\\n  state the length of the longest common prefix of the output labels of the\\n  outgoing paths. Pushing labels towards the final states consists in\\n  minimizing at every state the length of the longest common suffix of the\\n  output labels of the incoming paths.\\n\\n  Args:\\n    ifst: The input FST.\\n    delta: Comparison/quantization delta.\\n    push_weights: Should weights be pushed?\\n    push_labels: Should labels be pushed?\\n    remove_common_affix: If pushing labels, should common prefix/suffix be\\n        removed?\\n    remove_total_weight: If pushing weights, should total weight be removed?\\n    to_final: Push towards final states?\\n\\n  Returns:\\n    An equivalent pushed FST.\\n\\n  See also: The destructive variant.\\n  \";\nstatic PyObject *__pyx_pw_9pywrapfst_41push(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst = 0;\n  float __pyx_v_delta;\n  bool __pyx_v_push_weights;\n  bool __pyx_v_push_labels;\n  bool __pyx_v_remove_common_affix;\n  bool __pyx_v_remove_total_weight;\n  bool __pyx_v_to_final;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"push (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_ifst,&__pyx_n_s_delta,&__pyx_n_s_push_weights,&__pyx_n_s_push_labels,&__pyx_n_s_remove_common_affix,&__pyx_n_s_remove_total_weight,&__pyx_n_s_to_final,0};\n    PyObject* values[7] = {0,0,0,0,0,0,0};\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  7: values[6] = PyTuple_GET_ITEM(__pyx_args, 6);\n        CYTHON_FALLTHROUGH;\n        case  6: values[5] = PyTuple_GET_ITEM(__pyx_args, 5);\n        CYTHON_FALLTHROUGH;\n        case  5: values[4] = PyTuple_GET_ITEM(__pyx_args, 4);\n        CYTHON_FALLTHROUGH;\n        case  4: values[3] = PyTuple_GET_ITEM(__pyx_args, 3);\n        CYTHON_FALLTHROUGH;\n        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);\n        CYTHON_FALLTHROUGH;\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (likely((values[0] = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_ifst)) != 0)) kw_args--;\n        else goto __pyx_L5_argtuple_error;\n        CYTHON_FALLTHROUGH;\n        case  1:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_delta);\n          if (value) { values[1] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  2:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_push_weights);\n          if (value) { values[2] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  3:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_push_labels);\n          if (value) { values[3] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  4:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_remove_common_affix);\n          if (value) { values[4] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  5:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_remove_total_weight);\n          if (value) { values[5] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  6:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_to_final);\n          if (value) { values[6] = value; kw_args--; }\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"push\") < 0)) __PYX_ERR(0, 3686, __pyx_L3_error)\n      }\n    } else {\n      switch (PyTuple_GET_SIZE(__pyx_args)) {\n        case  7: values[6] = PyTuple_GET_ITEM(__pyx_args, 6);\n        CYTHON_FALLTHROUGH;\n        case  6: values[5] = PyTuple_GET_ITEM(__pyx_args, 5);\n        CYTHON_FALLTHROUGH;\n        case  5: values[4] = PyTuple_GET_ITEM(__pyx_args, 4);\n        CYTHON_FALLTHROUGH;\n        case  4: values[3] = PyTuple_GET_ITEM(__pyx_args, 3);\n        CYTHON_FALLTHROUGH;\n        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);\n        CYTHON_FALLTHROUGH;\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n    }\n    __pyx_v_ifst = ((struct __pyx_obj_9pywrapfst__Fst *)values[0]);\n    if (values[1]) {\n      __pyx_v_delta = __pyx_PyFloat_AsFloat(values[1]); if (unlikely((__pyx_v_delta == (float)-1) && PyErr_Occurred())) __PYX_ERR(0, 3687, __pyx_L3_error)\n    } else {\n      __pyx_v_delta = __pyx_k__78;\n    }\n    if (values[2]) {\n      __pyx_v_push_weights = __Pyx_PyObject_IsTrue(values[2]); if (unlikely((__pyx_v_push_weights == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 3688, __pyx_L3_error)\n    } else {\n\n      /* \"pywrapfst.pyx\":3688\n * cpdef _MutableFst push(_Fst ifst,\n *                        float delta=fst.kDelta,\n *                        bool push_weights=False,             # <<<<<<<<<<<<<<\n *                        bool push_labels=False,\n *                        bool remove_common_affix=False,\n */\n      __pyx_v_push_weights = ((bool)0);\n    }\n    if (values[3]) {\n      __pyx_v_push_labels = __Pyx_PyObject_IsTrue(values[3]); if (unlikely((__pyx_v_push_labels == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 3689, __pyx_L3_error)\n    } else {\n\n      /* \"pywrapfst.pyx\":3689\n *                        float delta=fst.kDelta,\n *                        bool push_weights=False,\n *                        bool push_labels=False,             # <<<<<<<<<<<<<<\n *                        bool remove_common_affix=False,\n *                        bool remove_total_weight=False,\n */\n      __pyx_v_push_labels = ((bool)0);\n    }\n    if (values[4]) {\n      __pyx_v_remove_common_affix = __Pyx_PyObject_IsTrue(values[4]); if (unlikely((__pyx_v_remove_common_affix == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 3690, __pyx_L3_error)\n    } else {\n\n      /* \"pywrapfst.pyx\":3690\n *                        bool push_weights=False,\n *                        bool push_labels=False,\n *                        bool remove_common_affix=False,             # <<<<<<<<<<<<<<\n *                        bool remove_total_weight=False,\n *                        bool to_final=False):\n */\n      __pyx_v_remove_common_affix = ((bool)0);\n    }\n    if (values[5]) {\n      __pyx_v_remove_total_weight = __Pyx_PyObject_IsTrue(values[5]); if (unlikely((__pyx_v_remove_total_weight == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 3691, __pyx_L3_error)\n    } else {\n\n      /* \"pywrapfst.pyx\":3691\n *                        bool push_labels=False,\n *                        bool remove_common_affix=False,\n *                        bool remove_total_weight=False,             # <<<<<<<<<<<<<<\n *                        bool to_final=False):\n *   \"\"\"\n */\n      __pyx_v_remove_total_weight = ((bool)0);\n    }\n    if (values[6]) {\n      __pyx_v_to_final = __Pyx_PyObject_IsTrue(values[6]); if (unlikely((__pyx_v_to_final == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 3692, __pyx_L3_error)\n    } else {\n\n      /* \"pywrapfst.pyx\":3692\n *                        bool remove_common_affix=False,\n *                        bool remove_total_weight=False,\n *                        bool to_final=False):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   push(ifst, delta=0.0009765625, push_weights=False, push_labels=False,\n */\n      __pyx_v_to_final = ((bool)0);\n    }\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"push\", 0, 1, 7, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 3686, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst.push\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_ifst), __pyx_ptype_9pywrapfst__Fst, 1, \"ifst\", 0))) __PYX_ERR(0, 3686, __pyx_L1_error)\n  __pyx_r = __pyx_pf_9pywrapfst_40push(__pyx_self, __pyx_v_ifst, __pyx_v_delta, __pyx_v_push_weights, __pyx_v_push_labels, __pyx_v_remove_common_affix, __pyx_v_remove_total_weight, __pyx_v_to_final);\n\n  /* \"pywrapfst.pyx\":3686\n * \n * \n * cpdef _MutableFst push(_Fst ifst,             # <<<<<<<<<<<<<<\n *                        float delta=fst.kDelta,\n *                        bool push_weights=False,\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_40push(CYTHON_UNUSED PyObject *__pyx_self, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst, float __pyx_v_delta, bool __pyx_v_push_weights, bool __pyx_v_push_labels, bool __pyx_v_remove_common_affix, bool __pyx_v_remove_total_weight, bool __pyx_v_to_final) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  struct __pyx_opt_args_9pywrapfst_push __pyx_t_2;\n  __Pyx_RefNannySetupContext(\"push\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_2.__pyx_n = 6;\n  __pyx_t_2.delta = __pyx_v_delta;\n  __pyx_t_2.push_weights = __pyx_v_push_weights;\n  __pyx_t_2.push_labels = __pyx_v_push_labels;\n  __pyx_t_2.remove_common_affix = __pyx_v_remove_common_affix;\n  __pyx_t_2.remove_total_weight = __pyx_v_remove_total_weight;\n  __pyx_t_2.to_final = __pyx_v_to_final;\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst_push(__pyx_v_ifst, 0, &__pyx_t_2)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3686, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.push\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":3740\n * \n * \n * cpdef bool randequivalent(_Fst ifst1,             # <<<<<<<<<<<<<<\n *                           _Fst ifst2,\n *                           int32 npath=1,\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_43randequivalent(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic bool __pyx_f_9pywrapfst_randequivalent(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst1, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst2, CYTHON_UNUSED int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_randequivalent *__pyx_optional_args) {\n  __pyx_t_10basictypes_int32 __pyx_v_npath = ((__pyx_t_10basictypes_int32)1);\n  float __pyx_v_delta = __pyx_k__79;\n  time_t __pyx_v_seed = ((time_t)0);\n  PyObject *__pyx_v_select = ((PyObject *)__pyx_n_b_uniform);\n  __pyx_t_10basictypes_int32 __pyx_v_max_length = __pyx_k__80;\n  enum fst::script::RandArcSelection __pyx_v_ras;\n  std::unique_ptr<fst::RandGenOptions<enum fst::script::RandArcSelection> >  __pyx_v_opts;\n  bool __pyx_r;\n  __Pyx_RefNannyDeclarations\n  std::string __pyx_t_1;\n  enum fst::script::RandArcSelection __pyx_t_2;\n  int __pyx_t_3;\n  __Pyx_RefNannySetupContext(\"randequivalent\", 0);\n  if (__pyx_optional_args) {\n    if (__pyx_optional_args->__pyx_n > 0) {\n      __pyx_v_npath = __pyx_optional_args->npath;\n      if (__pyx_optional_args->__pyx_n > 1) {\n        __pyx_v_delta = __pyx_optional_args->delta;\n        if (__pyx_optional_args->__pyx_n > 2) {\n          __pyx_v_seed = __pyx_optional_args->seed;\n          if (__pyx_optional_args->__pyx_n > 3) {\n            __pyx_v_select = __pyx_optional_args->select;\n            if (__pyx_optional_args->__pyx_n > 4) {\n              __pyx_v_max_length = __pyx_optional_args->max_length;\n            }\n          }\n        }\n      }\n    }\n  }\n\n  /* \"pywrapfst.pyx\":3775\n *   See also: `equal`, `equivalent`, `isomorphic`, `randgen`.\n *   \"\"\"\n *   cdef fst.RandArcSelection ras = _get_rand_arc_selection(tostring(select))             # <<<<<<<<<<<<<<\n *   cdef unique_ptr[fst.RandGenOptions[fst.RandArcSelection]] opts\n *   # The three trailing options will be ignored by RandEquivalent.\n */\n  __pyx_t_1 = __pyx_f_9pywrapfst_tostring(__pyx_v_select, NULL); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 3775, __pyx_L1_error)\n  __pyx_t_2 = __pyx_f_9pywrapfst__get_rand_arc_selection(__pyx_t_1); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 3775, __pyx_L1_error)\n  __pyx_v_ras = __pyx_t_2;\n\n  /* \"pywrapfst.pyx\":3778\n *   cdef unique_ptr[fst.RandGenOptions[fst.RandArcSelection]] opts\n *   # The three trailing options will be ignored by RandEquivalent.\n *   opts.reset(new fst.RandGenOptions[fst.RandArcSelection](ras, max_length,             # <<<<<<<<<<<<<<\n *                                                           1, False, False))\n *   if seed == 0:\n */\n  __pyx_v_opts.reset(new fst::RandGenOptions<enum fst::script::RandArcSelection> (__pyx_v_ras, __pyx_v_max_length, 1, 0, 0));\n\n  /* \"pywrapfst.pyx\":3780\n *   opts.reset(new fst.RandGenOptions[fst.RandArcSelection](ras, max_length,\n *                                                           1, False, False))\n *   if seed == 0:             # <<<<<<<<<<<<<<\n *     seed = time(NULL) + getpid()\n *   return fst.RandEquivalent(deref(ifst1._fst), deref(ifst2._fst), npath, delta,\n */\n  __pyx_t_3 = ((__pyx_v_seed == 0) != 0);\n  if (__pyx_t_3) {\n\n    /* \"pywrapfst.pyx\":3781\n *                                                           1, False, False))\n *   if seed == 0:\n *     seed = time(NULL) + getpid()             # <<<<<<<<<<<<<<\n *   return fst.RandEquivalent(deref(ifst1._fst), deref(ifst2._fst), npath, delta,\n *                            seed, deref(opts))\n */\n    __pyx_v_seed = (time(NULL) + getpid());\n\n    /* \"pywrapfst.pyx\":3780\n *   opts.reset(new fst.RandGenOptions[fst.RandArcSelection](ras, max_length,\n *                                                           1, False, False))\n *   if seed == 0:             # <<<<<<<<<<<<<<\n *     seed = time(NULL) + getpid()\n *   return fst.RandEquivalent(deref(ifst1._fst), deref(ifst2._fst), npath, delta,\n */\n  }\n\n  /* \"pywrapfst.pyx\":3782\n *   if seed == 0:\n *     seed = time(NULL) + getpid()\n *   return fst.RandEquivalent(deref(ifst1._fst), deref(ifst2._fst), npath, delta,             # <<<<<<<<<<<<<<\n *                            seed, deref(opts))\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_ifst1) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 3782, __pyx_L1_error)\n  }\n  if (unlikely(((PyObject *)__pyx_v_ifst2) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 3782, __pyx_L1_error)\n  }\n\n  /* \"pywrapfst.pyx\":3783\n *     seed = time(NULL) + getpid()\n *   return fst.RandEquivalent(deref(ifst1._fst), deref(ifst2._fst), npath, delta,\n *                            seed, deref(opts))             # <<<<<<<<<<<<<<\n * \n * \n */\n  __pyx_r = fst::script::RandEquivalent((*__pyx_v_ifst1->_fst), (*__pyx_v_ifst2->_fst), __pyx_v_npath, __pyx_v_delta, __pyx_v_seed, (*__pyx_v_opts));\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":3740\n * \n * \n * cpdef bool randequivalent(_Fst ifst1,             # <<<<<<<<<<<<<<\n *                           _Fst ifst2,\n *                           int32 npath=1,\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"pywrapfst.randequivalent\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = -1;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_43randequivalent(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic char __pyx_doc_9pywrapfst_42randequivalent[] = \"\\n  randequivalent(ifst1, ifst2, npath=1, delta=0.0009765625, seed=0,\\n                 select=\\\"uniform\\\", max_length=2147483647)\\n\\n  Are two acceptors stochastically equivalent?\\n\\n  This operation tests whether two FSTs are equivalent by randomly generating\\n  paths alternatively in each of the two FSTs. For each randomly generated path,\\n  the algorithm computes for each of the two FSTs the sum of the weights of all\\n  the successful paths sharing the same input and output labels as the randomly\\n  generated path and checks that these two values are within `delta`.\\n\\n  Args:\\n    ifst1: The first input FST.\\n    ifst2: The second input FST.\\n    npath: The number of random paths to generate.\\n    delta: Comparison/quantization delta.\\n    seed: An optional seed value for random path generation; if zero, the\\n        current time and process ID is used.\\n    select: A string matching a known random arc selection type; one of:\\n        \\\"uniform\\\", \\\"log_prob\\\", \\\"fast_log_prob\\\".\\n    max_length: The maximum length of each random path.\\n\\n  Returns:\\n    True if the two transducers satisfy the above condition, else False.\\n\\n  See also: `equal`, `equivalent`, `isomorphic`, `randgen`.\\n  \";\nstatic PyObject *__pyx_pw_9pywrapfst_43randequivalent(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst1 = 0;\n  struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst2 = 0;\n  __pyx_t_10basictypes_int32 __pyx_v_npath;\n  float __pyx_v_delta;\n  time_t __pyx_v_seed;\n  PyObject *__pyx_v_select = 0;\n  __pyx_t_10basictypes_int32 __pyx_v_max_length;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"randequivalent (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_ifst1,&__pyx_n_s_ifst2,&__pyx_n_s_npath,&__pyx_n_s_delta,&__pyx_n_s_seed,&__pyx_n_s_select,&__pyx_n_s_max_length,0};\n    PyObject* values[7] = {0,0,0,0,0,0,0};\n    values[5] = ((PyObject *)__pyx_n_b_uniform);\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  7: values[6] = PyTuple_GET_ITEM(__pyx_args, 6);\n        CYTHON_FALLTHROUGH;\n        case  6: values[5] = PyTuple_GET_ITEM(__pyx_args, 5);\n        CYTHON_FALLTHROUGH;\n        case  5: values[4] = PyTuple_GET_ITEM(__pyx_args, 4);\n        CYTHON_FALLTHROUGH;\n        case  4: values[3] = PyTuple_GET_ITEM(__pyx_args, 3);\n        CYTHON_FALLTHROUGH;\n        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);\n        CYTHON_FALLTHROUGH;\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (likely((values[0] = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_ifst1)) != 0)) kw_args--;\n        else goto __pyx_L5_argtuple_error;\n        CYTHON_FALLTHROUGH;\n        case  1:\n        if (likely((values[1] = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_ifst2)) != 0)) kw_args--;\n        else {\n          __Pyx_RaiseArgtupleInvalid(\"randequivalent\", 0, 2, 7, 1); __PYX_ERR(0, 3740, __pyx_L3_error)\n        }\n        CYTHON_FALLTHROUGH;\n        case  2:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_npath);\n          if (value) { values[2] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  3:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_delta);\n          if (value) { values[3] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  4:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_seed);\n          if (value) { values[4] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  5:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_select);\n          if (value) { values[5] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  6:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_max_length);\n          if (value) { values[6] = value; kw_args--; }\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"randequivalent\") < 0)) __PYX_ERR(0, 3740, __pyx_L3_error)\n      }\n    } else {\n      switch (PyTuple_GET_SIZE(__pyx_args)) {\n        case  7: values[6] = PyTuple_GET_ITEM(__pyx_args, 6);\n        CYTHON_FALLTHROUGH;\n        case  6: values[5] = PyTuple_GET_ITEM(__pyx_args, 5);\n        CYTHON_FALLTHROUGH;\n        case  5: values[4] = PyTuple_GET_ITEM(__pyx_args, 4);\n        CYTHON_FALLTHROUGH;\n        case  4: values[3] = PyTuple_GET_ITEM(__pyx_args, 3);\n        CYTHON_FALLTHROUGH;\n        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);\n        CYTHON_FALLTHROUGH;\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n    }\n    __pyx_v_ifst1 = ((struct __pyx_obj_9pywrapfst__Fst *)values[0]);\n    __pyx_v_ifst2 = ((struct __pyx_obj_9pywrapfst__Fst *)values[1]);\n    if (values[2]) {\n      __pyx_v_npath = __Pyx_PyInt_As_int32_t(values[2]); if (unlikely((__pyx_v_npath == ((int32_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 3742, __pyx_L3_error)\n    } else {\n      __pyx_v_npath = ((__pyx_t_10basictypes_int32)1);\n    }\n    if (values[3]) {\n      __pyx_v_delta = __pyx_PyFloat_AsFloat(values[3]); if (unlikely((__pyx_v_delta == (float)-1) && PyErr_Occurred())) __PYX_ERR(0, 3743, __pyx_L3_error)\n    } else {\n      __pyx_v_delta = __pyx_k__79;\n    }\n    if (values[4]) {\n      __pyx_v_seed = __Pyx_PyInt_As_time_t(values[4]); if (unlikely((__pyx_v_seed == ((time_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 3744, __pyx_L3_error)\n    } else {\n      __pyx_v_seed = ((time_t)0);\n    }\n    __pyx_v_select = values[5];\n    if (values[6]) {\n      __pyx_v_max_length = __Pyx_PyInt_As_int32_t(values[6]); if (unlikely((__pyx_v_max_length == ((int32_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 3746, __pyx_L3_error)\n    } else {\n      __pyx_v_max_length = __pyx_k__80;\n    }\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"randequivalent\", 0, 2, 7, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 3740, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst.randequivalent\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_ifst1), __pyx_ptype_9pywrapfst__Fst, 1, \"ifst1\", 0))) __PYX_ERR(0, 3740, __pyx_L1_error)\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_ifst2), __pyx_ptype_9pywrapfst__Fst, 1, \"ifst2\", 0))) __PYX_ERR(0, 3741, __pyx_L1_error)\n  __pyx_r = __pyx_pf_9pywrapfst_42randequivalent(__pyx_self, __pyx_v_ifst1, __pyx_v_ifst2, __pyx_v_npath, __pyx_v_delta, __pyx_v_seed, __pyx_v_select, __pyx_v_max_length);\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_42randequivalent(CYTHON_UNUSED PyObject *__pyx_self, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst1, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst2, __pyx_t_10basictypes_int32 __pyx_v_npath, float __pyx_v_delta, time_t __pyx_v_seed, PyObject *__pyx_v_select, __pyx_t_10basictypes_int32 __pyx_v_max_length) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  bool __pyx_t_1;\n  struct __pyx_opt_args_9pywrapfst_randequivalent __pyx_t_2;\n  PyObject *__pyx_t_3 = NULL;\n  __Pyx_RefNannySetupContext(\"randequivalent\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_2.__pyx_n = 5;\n  __pyx_t_2.npath = __pyx_v_npath;\n  __pyx_t_2.delta = __pyx_v_delta;\n  __pyx_t_2.seed = __pyx_v_seed;\n  __pyx_t_2.select = __pyx_v_select;\n  __pyx_t_2.max_length = __pyx_v_max_length;\n  __pyx_t_1 = __pyx_f_9pywrapfst_randequivalent(__pyx_v_ifst1, __pyx_v_ifst2, 0, &__pyx_t_2); if (unlikely(__pyx_t_1 == ((bool)-1) && PyErr_Occurred())) __PYX_ERR(0, 3740, __pyx_L1_error)\n  __pyx_t_3 = __Pyx_PyBool_FromLong(__pyx_t_1); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 3740, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_3);\n  __pyx_r = __pyx_t_3;\n  __pyx_t_3 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_AddTraceback(\"pywrapfst.randequivalent\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":3786\n * \n * \n * cpdef _MutableFst randgen(_Fst ifst,             # <<<<<<<<<<<<<<\n *                           int32 npath=1,\n *                           time_t seed=0,\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_45randgen(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic struct __pyx_obj_9pywrapfst__MutableFst *__pyx_f_9pywrapfst_randgen(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst, CYTHON_UNUSED int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_randgen *__pyx_optional_args) {\n  __pyx_t_10basictypes_int32 __pyx_v_npath = ((__pyx_t_10basictypes_int32)1);\n  time_t __pyx_v_seed = ((time_t)0);\n  PyObject *__pyx_v_select = ((PyObject *)__pyx_n_b_uniform);\n  __pyx_t_10basictypes_int32 __pyx_v_max_length = __pyx_k__81;\n\n  /* \"pywrapfst.pyx\":3791\n *                           select=b\"uniform\",\n *                           int32 max_length=INT32_MAX,\n *                           bool weighted=False,             # <<<<<<<<<<<<<<\n *                           bool remove_total_weight=False):\n *   \"\"\"\n */\n  bool __pyx_v_weighted = ((bool)0);\n\n  /* \"pywrapfst.pyx\":3792\n *                           int32 max_length=INT32_MAX,\n *                           bool weighted=False,\n *                           bool remove_total_weight=False):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   randgen(ifst, npath=1, seed=0, select=\"uniform\", max_length=2147483647,\n */\n  bool __pyx_v_remove_total_weight = ((bool)0);\n  enum fst::script::RandArcSelection __pyx_v_ras;\n  std::unique_ptr<fst::RandGenOptions<enum fst::script::RandArcSelection> >  __pyx_v_opts;\n  std::unique_ptr<fst::script::VectorFstClass>  __pyx_v_tfst;\n  struct __pyx_obj_9pywrapfst__MutableFst *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  std::string __pyx_t_1;\n  enum fst::script::RandArcSelection __pyx_t_2;\n  int __pyx_t_3;\n  PyObject *__pyx_t_4 = NULL;\n  __Pyx_RefNannySetupContext(\"randgen\", 0);\n  if (__pyx_optional_args) {\n    if (__pyx_optional_args->__pyx_n > 0) {\n      __pyx_v_npath = __pyx_optional_args->npath;\n      if (__pyx_optional_args->__pyx_n > 1) {\n        __pyx_v_seed = __pyx_optional_args->seed;\n        if (__pyx_optional_args->__pyx_n > 2) {\n          __pyx_v_select = __pyx_optional_args->select;\n          if (__pyx_optional_args->__pyx_n > 3) {\n            __pyx_v_max_length = __pyx_optional_args->max_length;\n            if (__pyx_optional_args->__pyx_n > 4) {\n              __pyx_v_weighted = __pyx_optional_args->weighted;\n              if (__pyx_optional_args->__pyx_n > 5) {\n                __pyx_v_remove_total_weight = __pyx_optional_args->remove_total_weight;\n              }\n            }\n          }\n        }\n      }\n    }\n  }\n\n  /* \"pywrapfst.pyx\":3824\n *   See also: `randequivalent`.\n *   \"\"\"\n *   cdef fst.RandArcSelection ras = _get_rand_arc_selection(tostring(select))             # <<<<<<<<<<<<<<\n *   cdef unique_ptr[fst.RandGenOptions[fst.RandArcSelection]] opts\n *   opts.reset(new fst.RandGenOptions[fst.RandArcSelection](ras, max_length,\n */\n  __pyx_t_1 = __pyx_f_9pywrapfst_tostring(__pyx_v_select, NULL); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 3824, __pyx_L1_error)\n  __pyx_t_2 = __pyx_f_9pywrapfst__get_rand_arc_selection(__pyx_t_1); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 3824, __pyx_L1_error)\n  __pyx_v_ras = __pyx_t_2;\n\n  /* \"pywrapfst.pyx\":3826\n *   cdef fst.RandArcSelection ras = _get_rand_arc_selection(tostring(select))\n *   cdef unique_ptr[fst.RandGenOptions[fst.RandArcSelection]] opts\n *   opts.reset(new fst.RandGenOptions[fst.RandArcSelection](ras, max_length,             # <<<<<<<<<<<<<<\n *                                                           npath, weighted,\n *                                                           remove_total_weight))\n */\n  __pyx_v_opts.reset(new fst::RandGenOptions<enum fst::script::RandArcSelection> (__pyx_v_ras, __pyx_v_max_length, __pyx_v_npath, __pyx_v_weighted, __pyx_v_remove_total_weight));\n\n  /* \"pywrapfst.pyx\":3830\n *                                                           remove_total_weight))\n *   cdef unique_ptr[fst.VectorFstClass] tfst\n *   tfst.reset(new fst.VectorFstClass(ifst.arc_type()))             # <<<<<<<<<<<<<<\n *   if seed == 0:\n *     seed = time(NULL) + getpid()\n */\n  if (unlikely(((PyObject *)__pyx_v_ifst) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"arc_type\");\n    __PYX_ERR(0, 3830, __pyx_L1_error)\n  }\n  __pyx_v_tfst.reset(new fst::script::VectorFstClass(((struct __pyx_vtabstruct_9pywrapfst__Fst *)__pyx_v_ifst->__pyx_vtab)->arc_type(__pyx_v_ifst, 0)));\n\n  /* \"pywrapfst.pyx\":3831\n *   cdef unique_ptr[fst.VectorFstClass] tfst\n *   tfst.reset(new fst.VectorFstClass(ifst.arc_type()))\n *   if seed == 0:             # <<<<<<<<<<<<<<\n *     seed = time(NULL) + getpid()\n *   fst.RandGen(deref(ifst._fst), tfst.get(), seed, deref(opts))\n */\n  __pyx_t_3 = ((__pyx_v_seed == 0) != 0);\n  if (__pyx_t_3) {\n\n    /* \"pywrapfst.pyx\":3832\n *   tfst.reset(new fst.VectorFstClass(ifst.arc_type()))\n *   if seed == 0:\n *     seed = time(NULL) + getpid()             # <<<<<<<<<<<<<<\n *   fst.RandGen(deref(ifst._fst), tfst.get(), seed, deref(opts))\n *   return _init_MutableFst(tfst.release())\n */\n    __pyx_v_seed = (time(NULL) + getpid());\n\n    /* \"pywrapfst.pyx\":3831\n *   cdef unique_ptr[fst.VectorFstClass] tfst\n *   tfst.reset(new fst.VectorFstClass(ifst.arc_type()))\n *   if seed == 0:             # <<<<<<<<<<<<<<\n *     seed = time(NULL) + getpid()\n *   fst.RandGen(deref(ifst._fst), tfst.get(), seed, deref(opts))\n */\n  }\n\n  /* \"pywrapfst.pyx\":3833\n *   if seed == 0:\n *     seed = time(NULL) + getpid()\n *   fst.RandGen(deref(ifst._fst), tfst.get(), seed, deref(opts))             # <<<<<<<<<<<<<<\n *   return _init_MutableFst(tfst.release())\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_ifst) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 3833, __pyx_L1_error)\n  }\n  fst::script::RandGen((*__pyx_v_ifst->_fst), __pyx_v_tfst.get(), __pyx_v_seed, (*__pyx_v_opts));\n\n  /* \"pywrapfst.pyx\":3834\n *     seed = time(NULL) + getpid()\n *   fst.RandGen(deref(ifst._fst), tfst.get(), seed, deref(opts))\n *   return _init_MutableFst(tfst.release())             # <<<<<<<<<<<<<<\n * \n * \n */\n  __Pyx_XDECREF(((PyObject *)__pyx_r));\n  __pyx_t_4 = ((PyObject *)__pyx_f_9pywrapfst__init_MutableFst(__pyx_v_tfst.release())); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 3834, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_4);\n  __pyx_r = ((struct __pyx_obj_9pywrapfst__MutableFst *)__pyx_t_4);\n  __pyx_t_4 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":3786\n * \n * \n * cpdef _MutableFst randgen(_Fst ifst,             # <<<<<<<<<<<<<<\n *                           int32 npath=1,\n *                           time_t seed=0,\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_AddTraceback(\"pywrapfst.randgen\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XGIVEREF((PyObject *)__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_45randgen(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic char __pyx_doc_9pywrapfst_44randgen[] = \"\\n  randgen(ifst, npath=1, seed=0, select=\\\"uniform\\\", max_length=2147483647,\\n          weight=False, remove_total_weight=False)\\n\\n  Randomly generate successful paths in an FST.\\n\\n  This operation randomly generates a set of successful paths in the input FST.\\n  This relies on a mechanism for selecting arcs, specified using the `select`\\n  argument. The default selector, \\\"uniform\\\", randomly selects a transition\\n  using a uniform distribution. The \\\"log_prob\\\" selector randomly selects a\\n  transition w.r.t. the weights treated as negative log probabilities after\\n  normalizing for the total weight leaving the state. In all cases, finality is\\n  treated as a transition to a super-final state.\\n\\n  Args:\\n    ifst: The input FST.\\n    npath: The number of random paths to generate.\\n    seed: An optional seed value for random path generation; if zero, the\\n        current time and process ID is used.\\n    select: A string matching a known random arc selection type; one of:\\n        \\\"uniform\\\", \\\"log_prob\\\", \\\"fast_log_prob\\\".\\n    max_length: The maximum length of each random path.\\n    weighted: Should the output be weighted by path count?\\n    remove_total_weight: Should the total weight be removed (ignored when\\n        `weighted` is False)?\\n\\n  Returns:\\n    An FST containing one or more random paths.\\n\\n  See also: `randequivalent`.\\n  \";\nstatic PyObject *__pyx_pw_9pywrapfst_45randgen(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst = 0;\n  __pyx_t_10basictypes_int32 __pyx_v_npath;\n  time_t __pyx_v_seed;\n  PyObject *__pyx_v_select = 0;\n  __pyx_t_10basictypes_int32 __pyx_v_max_length;\n  bool __pyx_v_weighted;\n  bool __pyx_v_remove_total_weight;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"randgen (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_ifst,&__pyx_n_s_npath,&__pyx_n_s_seed,&__pyx_n_s_select,&__pyx_n_s_max_length,&__pyx_n_s_weighted,&__pyx_n_s_remove_total_weight,0};\n    PyObject* values[7] = {0,0,0,0,0,0,0};\n    values[3] = ((PyObject *)__pyx_n_b_uniform);\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  7: values[6] = PyTuple_GET_ITEM(__pyx_args, 6);\n        CYTHON_FALLTHROUGH;\n        case  6: values[5] = PyTuple_GET_ITEM(__pyx_args, 5);\n        CYTHON_FALLTHROUGH;\n        case  5: values[4] = PyTuple_GET_ITEM(__pyx_args, 4);\n        CYTHON_FALLTHROUGH;\n        case  4: values[3] = PyTuple_GET_ITEM(__pyx_args, 3);\n        CYTHON_FALLTHROUGH;\n        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);\n        CYTHON_FALLTHROUGH;\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (likely((values[0] = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_ifst)) != 0)) kw_args--;\n        else goto __pyx_L5_argtuple_error;\n        CYTHON_FALLTHROUGH;\n        case  1:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_npath);\n          if (value) { values[1] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  2:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_seed);\n          if (value) { values[2] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  3:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_select);\n          if (value) { values[3] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  4:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_max_length);\n          if (value) { values[4] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  5:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_weighted);\n          if (value) { values[5] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  6:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_remove_total_weight);\n          if (value) { values[6] = value; kw_args--; }\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"randgen\") < 0)) __PYX_ERR(0, 3786, __pyx_L3_error)\n      }\n    } else {\n      switch (PyTuple_GET_SIZE(__pyx_args)) {\n        case  7: values[6] = PyTuple_GET_ITEM(__pyx_args, 6);\n        CYTHON_FALLTHROUGH;\n        case  6: values[5] = PyTuple_GET_ITEM(__pyx_args, 5);\n        CYTHON_FALLTHROUGH;\n        case  5: values[4] = PyTuple_GET_ITEM(__pyx_args, 4);\n        CYTHON_FALLTHROUGH;\n        case  4: values[3] = PyTuple_GET_ITEM(__pyx_args, 3);\n        CYTHON_FALLTHROUGH;\n        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);\n        CYTHON_FALLTHROUGH;\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n    }\n    __pyx_v_ifst = ((struct __pyx_obj_9pywrapfst__Fst *)values[0]);\n    if (values[1]) {\n      __pyx_v_npath = __Pyx_PyInt_As_int32_t(values[1]); if (unlikely((__pyx_v_npath == ((int32_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 3787, __pyx_L3_error)\n    } else {\n      __pyx_v_npath = ((__pyx_t_10basictypes_int32)1);\n    }\n    if (values[2]) {\n      __pyx_v_seed = __Pyx_PyInt_As_time_t(values[2]); if (unlikely((__pyx_v_seed == ((time_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 3788, __pyx_L3_error)\n    } else {\n      __pyx_v_seed = ((time_t)0);\n    }\n    __pyx_v_select = values[3];\n    if (values[4]) {\n      __pyx_v_max_length = __Pyx_PyInt_As_int32_t(values[4]); if (unlikely((__pyx_v_max_length == ((int32_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 3790, __pyx_L3_error)\n    } else {\n      __pyx_v_max_length = __pyx_k__81;\n    }\n    if (values[5]) {\n      __pyx_v_weighted = __Pyx_PyObject_IsTrue(values[5]); if (unlikely((__pyx_v_weighted == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 3791, __pyx_L3_error)\n    } else {\n\n      /* \"pywrapfst.pyx\":3791\n *                           select=b\"uniform\",\n *                           int32 max_length=INT32_MAX,\n *                           bool weighted=False,             # <<<<<<<<<<<<<<\n *                           bool remove_total_weight=False):\n *   \"\"\"\n */\n      __pyx_v_weighted = ((bool)0);\n    }\n    if (values[6]) {\n      __pyx_v_remove_total_weight = __Pyx_PyObject_IsTrue(values[6]); if (unlikely((__pyx_v_remove_total_weight == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 3792, __pyx_L3_error)\n    } else {\n\n      /* \"pywrapfst.pyx\":3792\n *                           int32 max_length=INT32_MAX,\n *                           bool weighted=False,\n *                           bool remove_total_weight=False):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   randgen(ifst, npath=1, seed=0, select=\"uniform\", max_length=2147483647,\n */\n      __pyx_v_remove_total_weight = ((bool)0);\n    }\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"randgen\", 0, 1, 7, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 3786, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst.randgen\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_ifst), __pyx_ptype_9pywrapfst__Fst, 1, \"ifst\", 0))) __PYX_ERR(0, 3786, __pyx_L1_error)\n  __pyx_r = __pyx_pf_9pywrapfst_44randgen(__pyx_self, __pyx_v_ifst, __pyx_v_npath, __pyx_v_seed, __pyx_v_select, __pyx_v_max_length, __pyx_v_weighted, __pyx_v_remove_total_weight);\n\n  /* \"pywrapfst.pyx\":3786\n * \n * \n * cpdef _MutableFst randgen(_Fst ifst,             # <<<<<<<<<<<<<<\n *                           int32 npath=1,\n *                           time_t seed=0,\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_44randgen(CYTHON_UNUSED PyObject *__pyx_self, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst, __pyx_t_10basictypes_int32 __pyx_v_npath, time_t __pyx_v_seed, PyObject *__pyx_v_select, __pyx_t_10basictypes_int32 __pyx_v_max_length, bool __pyx_v_weighted, bool __pyx_v_remove_total_weight) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  struct __pyx_opt_args_9pywrapfst_randgen __pyx_t_2;\n  __Pyx_RefNannySetupContext(\"randgen\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_2.__pyx_n = 6;\n  __pyx_t_2.npath = __pyx_v_npath;\n  __pyx_t_2.seed = __pyx_v_seed;\n  __pyx_t_2.select = __pyx_v_select;\n  __pyx_t_2.max_length = __pyx_v_max_length;\n  __pyx_t_2.remove_total_weight = __pyx_v_weighted;\n  __pyx_t_2.weighted = __pyx_v_remove_total_weight;\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst_randgen(__pyx_v_ifst, 0, &__pyx_t_2)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3786, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.randgen\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":3837\n * \n * \n * cpdef _MutableFst replace(pairs,             # <<<<<<<<<<<<<<\n *                           call_arc_labeling=b\"input\",\n *                           return_arc_labeling=b\"neither\",\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_47replace(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic struct __pyx_obj_9pywrapfst__MutableFst *__pyx_f_9pywrapfst_replace(PyObject *__pyx_v_pairs, CYTHON_UNUSED int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_replace *__pyx_optional_args) {\n  PyObject *__pyx_v_call_arc_labeling = ((PyObject *)__pyx_n_b_input);\n  PyObject *__pyx_v_return_arc_labeling = ((PyObject *)__pyx_n_b_neither);\n\n  /* \"pywrapfst.pyx\":3840\n *                           call_arc_labeling=b\"input\",\n *                           return_arc_labeling=b\"neither\",\n *                           bool epsilon_on_replace=False,             # <<<<<<<<<<<<<<\n *                           int64 return_label=0):\n *   \"\"\"\n */\n  bool __pyx_v_epsilon_on_replace = ((bool)0);\n  __pyx_t_10basictypes_int64 __pyx_v_return_label = ((__pyx_t_10basictypes_int64)0);\n  std::vector<__pyx_t_3fst_LabelFstClassPair>  __pyx_v__pairs;\n  __pyx_t_10basictypes_int64 __pyx_v_root_label;\n  __pyx_t_10basictypes_int64 __pyx_v_label;\n  struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst = 0;\n  PyObject *__pyx_v_it = NULL;\n  std::unique_ptr<fst::script::VectorFstClass>  __pyx_v_tfst;\n  enum fst::ReplaceLabelType __pyx_v_cal;\n  enum fst::ReplaceLabelType __pyx_v_ral;\n  std::unique_ptr<fst::script::ReplaceOptions>  __pyx_v_opts;\n  struct __pyx_obj_9pywrapfst__MutableFst *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *(*__pyx_t_5)(PyObject *);\n  __pyx_t_10basictypes_int64 __pyx_t_6;\n  __pyx_t_3fst_LabelFstClassPair __pyx_t_7;\n  Py_ssize_t __pyx_t_8;\n  PyObject *(*__pyx_t_9)(PyObject *);\n  PyObject *__pyx_t_10 = NULL;\n  std::string __pyx_t_11;\n  enum fst::ReplaceLabelType __pyx_t_12;\n  __Pyx_RefNannySetupContext(\"replace\", 0);\n  if (__pyx_optional_args) {\n    if (__pyx_optional_args->__pyx_n > 0) {\n      __pyx_v_call_arc_labeling = __pyx_optional_args->call_arc_labeling;\n      if (__pyx_optional_args->__pyx_n > 1) {\n        __pyx_v_return_arc_labeling = __pyx_optional_args->return_arc_labeling;\n        if (__pyx_optional_args->__pyx_n > 2) {\n          __pyx_v_epsilon_on_replace = __pyx_optional_args->epsilon_on_replace;\n          if (__pyx_optional_args->__pyx_n > 3) {\n            __pyx_v_return_label = __pyx_optional_args->return_label;\n          }\n        }\n      }\n    }\n  }\n\n  /* \"pywrapfst.pyx\":3882\n *   cdef int64 label\n *   cdef _Fst ifst\n *   it = iter(pairs)             # <<<<<<<<<<<<<<\n *   (root_label, ifst) = next(it)\n *   _pairs.push_back(fst.LabelFstClassPair(root_label, ifst._fst.get()))\n */\n  __pyx_t_1 = PyObject_GetIter(__pyx_v_pairs); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3882, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_v_it = __pyx_t_1;\n  __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":3883\n *   cdef _Fst ifst\n *   it = iter(pairs)\n *   (root_label, ifst) = next(it)             # <<<<<<<<<<<<<<\n *   _pairs.push_back(fst.LabelFstClassPair(root_label, ifst._fst.get()))\n *   cdef unique_ptr[fst.VectorFstClass] tfst\n */\n  __pyx_t_1 = __Pyx_PyIter_Next(__pyx_v_it); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3883, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if ((likely(PyTuple_CheckExact(__pyx_t_1))) || (PyList_CheckExact(__pyx_t_1))) {\n    PyObject* sequence = __pyx_t_1;\n    Py_ssize_t size = __Pyx_PySequence_SIZE(sequence);\n    if (unlikely(size != 2)) {\n      if (size > 2) __Pyx_RaiseTooManyValuesError(2);\n      else if (size >= 0) __Pyx_RaiseNeedMoreValuesError(size);\n      __PYX_ERR(0, 3883, __pyx_L1_error)\n    }\n    #if CYTHON_ASSUME_SAFE_MACROS && !CYTHON_AVOID_BORROWED_REFS\n    if (likely(PyTuple_CheckExact(sequence))) {\n      __pyx_t_2 = PyTuple_GET_ITEM(sequence, 0); \n      __pyx_t_3 = PyTuple_GET_ITEM(sequence, 1); \n    } else {\n      __pyx_t_2 = PyList_GET_ITEM(sequence, 0); \n      __pyx_t_3 = PyList_GET_ITEM(sequence, 1); \n    }\n    __Pyx_INCREF(__pyx_t_2);\n    __Pyx_INCREF(__pyx_t_3);\n    #else\n    __pyx_t_2 = PySequence_ITEM(sequence, 0); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3883, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_2);\n    __pyx_t_3 = PySequence_ITEM(sequence, 1); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 3883, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_3);\n    #endif\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  } else {\n    Py_ssize_t index = -1;\n    __pyx_t_4 = PyObject_GetIter(__pyx_t_1); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 3883, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_4);\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n    __pyx_t_5 = Py_TYPE(__pyx_t_4)->tp_iternext;\n    index = 0; __pyx_t_2 = __pyx_t_5(__pyx_t_4); if (unlikely(!__pyx_t_2)) goto __pyx_L3_unpacking_failed;\n    __Pyx_GOTREF(__pyx_t_2);\n    index = 1; __pyx_t_3 = __pyx_t_5(__pyx_t_4); if (unlikely(!__pyx_t_3)) goto __pyx_L3_unpacking_failed;\n    __Pyx_GOTREF(__pyx_t_3);\n    if (__Pyx_IternextUnpackEndCheck(__pyx_t_5(__pyx_t_4), 2) < 0) __PYX_ERR(0, 3883, __pyx_L1_error)\n    __pyx_t_5 = NULL;\n    __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n    goto __pyx_L4_unpacking_done;\n    __pyx_L3_unpacking_failed:;\n    __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n    __pyx_t_5 = NULL;\n    if (__Pyx_IterFinish() == 0) __Pyx_RaiseNeedMoreValuesError(index);\n    __PYX_ERR(0, 3883, __pyx_L1_error)\n    __pyx_L4_unpacking_done:;\n  }\n  __pyx_t_6 = __Pyx_PyInt_As_int64_t(__pyx_t_2); if (unlikely((__pyx_t_6 == ((int64_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 3883, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n  if (!(likely(((__pyx_t_3) == Py_None) || likely(__Pyx_TypeTest(__pyx_t_3, __pyx_ptype_9pywrapfst__Fst))))) __PYX_ERR(0, 3883, __pyx_L1_error)\n  __pyx_v_root_label = __pyx_t_6;\n  __pyx_v_ifst = ((struct __pyx_obj_9pywrapfst__Fst *)__pyx_t_3);\n  __pyx_t_3 = 0;\n\n  /* \"pywrapfst.pyx\":3884\n *   it = iter(pairs)\n *   (root_label, ifst) = next(it)\n *   _pairs.push_back(fst.LabelFstClassPair(root_label, ifst._fst.get()))             # <<<<<<<<<<<<<<\n *   cdef unique_ptr[fst.VectorFstClass] tfst\n *   tfst.reset(new fst.VectorFstClass(ifst.arc_type()))\n */\n  if (unlikely(((PyObject *)__pyx_v_ifst) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 3884, __pyx_L1_error)\n  }\n  try {\n    __pyx_t_7 = __pyx_t_3fst_LabelFstClassPair(__pyx_v_root_label, __pyx_v_ifst->_fst.get());\n  } catch(...) {\n    __Pyx_CppExn2PyErr();\n    __PYX_ERR(0, 3884, __pyx_L1_error)\n  }\n  try {\n    __pyx_v__pairs.push_back(__pyx_t_7);\n  } catch(...) {\n    __Pyx_CppExn2PyErr();\n    __PYX_ERR(0, 3884, __pyx_L1_error)\n  }\n\n  /* \"pywrapfst.pyx\":3886\n *   _pairs.push_back(fst.LabelFstClassPair(root_label, ifst._fst.get()))\n *   cdef unique_ptr[fst.VectorFstClass] tfst\n *   tfst.reset(new fst.VectorFstClass(ifst.arc_type()))             # <<<<<<<<<<<<<<\n *   for (label, ifst) in it:\n *     _pairs.push_back(fst.LabelFstClassPair(label, ifst._fst.get()))\n */\n  if (unlikely(((PyObject *)__pyx_v_ifst) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"arc_type\");\n    __PYX_ERR(0, 3886, __pyx_L1_error)\n  }\n  __pyx_v_tfst.reset(new fst::script::VectorFstClass(((struct __pyx_vtabstruct_9pywrapfst__Fst *)__pyx_v_ifst->__pyx_vtab)->arc_type(__pyx_v_ifst, 0)));\n\n  /* \"pywrapfst.pyx\":3887\n *   cdef unique_ptr[fst.VectorFstClass] tfst\n *   tfst.reset(new fst.VectorFstClass(ifst.arc_type()))\n *   for (label, ifst) in it:             # <<<<<<<<<<<<<<\n *     _pairs.push_back(fst.LabelFstClassPair(label, ifst._fst.get()))\n *   cdef fst.ReplaceLabelType cal = _get_replace_label_type(\n */\n  if (likely(PyList_CheckExact(__pyx_v_it)) || PyTuple_CheckExact(__pyx_v_it)) {\n    __pyx_t_1 = __pyx_v_it; __Pyx_INCREF(__pyx_t_1); __pyx_t_8 = 0;\n    __pyx_t_9 = NULL;\n  } else {\n    __pyx_t_8 = -1; __pyx_t_1 = PyObject_GetIter(__pyx_v_it); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3887, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    __pyx_t_9 = Py_TYPE(__pyx_t_1)->tp_iternext; if (unlikely(!__pyx_t_9)) __PYX_ERR(0, 3887, __pyx_L1_error)\n  }\n  for (;;) {\n    if (likely(!__pyx_t_9)) {\n      if (likely(PyList_CheckExact(__pyx_t_1))) {\n        if (__pyx_t_8 >= PyList_GET_SIZE(__pyx_t_1)) break;\n        #if CYTHON_ASSUME_SAFE_MACROS && !CYTHON_AVOID_BORROWED_REFS\n        __pyx_t_3 = PyList_GET_ITEM(__pyx_t_1, __pyx_t_8); __Pyx_INCREF(__pyx_t_3); __pyx_t_8++; if (unlikely(0 < 0)) __PYX_ERR(0, 3887, __pyx_L1_error)\n        #else\n        __pyx_t_3 = PySequence_ITEM(__pyx_t_1, __pyx_t_8); __pyx_t_8++; if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 3887, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_3);\n        #endif\n      } else {\n        if (__pyx_t_8 >= PyTuple_GET_SIZE(__pyx_t_1)) break;\n        #if CYTHON_ASSUME_SAFE_MACROS && !CYTHON_AVOID_BORROWED_REFS\n        __pyx_t_3 = PyTuple_GET_ITEM(__pyx_t_1, __pyx_t_8); __Pyx_INCREF(__pyx_t_3); __pyx_t_8++; if (unlikely(0 < 0)) __PYX_ERR(0, 3887, __pyx_L1_error)\n        #else\n        __pyx_t_3 = PySequence_ITEM(__pyx_t_1, __pyx_t_8); __pyx_t_8++; if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 3887, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_3);\n        #endif\n      }\n    } else {\n      __pyx_t_3 = __pyx_t_9(__pyx_t_1);\n      if (unlikely(!__pyx_t_3)) {\n        PyObject* exc_type = PyErr_Occurred();\n        if (exc_type) {\n          if (likely(__Pyx_PyErr_GivenExceptionMatches(exc_type, PyExc_StopIteration))) PyErr_Clear();\n          else __PYX_ERR(0, 3887, __pyx_L1_error)\n        }\n        break;\n      }\n      __Pyx_GOTREF(__pyx_t_3);\n    }\n    if ((likely(PyTuple_CheckExact(__pyx_t_3))) || (PyList_CheckExact(__pyx_t_3))) {\n      PyObject* sequence = __pyx_t_3;\n      Py_ssize_t size = __Pyx_PySequence_SIZE(sequence);\n      if (unlikely(size != 2)) {\n        if (size > 2) __Pyx_RaiseTooManyValuesError(2);\n        else if (size >= 0) __Pyx_RaiseNeedMoreValuesError(size);\n        __PYX_ERR(0, 3887, __pyx_L1_error)\n      }\n      #if CYTHON_ASSUME_SAFE_MACROS && !CYTHON_AVOID_BORROWED_REFS\n      if (likely(PyTuple_CheckExact(sequence))) {\n        __pyx_t_2 = PyTuple_GET_ITEM(sequence, 0); \n        __pyx_t_4 = PyTuple_GET_ITEM(sequence, 1); \n      } else {\n        __pyx_t_2 = PyList_GET_ITEM(sequence, 0); \n        __pyx_t_4 = PyList_GET_ITEM(sequence, 1); \n      }\n      __Pyx_INCREF(__pyx_t_2);\n      __Pyx_INCREF(__pyx_t_4);\n      #else\n      __pyx_t_2 = PySequence_ITEM(sequence, 0); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 3887, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_2);\n      __pyx_t_4 = PySequence_ITEM(sequence, 1); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 3887, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_4);\n      #endif\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    } else {\n      Py_ssize_t index = -1;\n      __pyx_t_10 = PyObject_GetIter(__pyx_t_3); if (unlikely(!__pyx_t_10)) __PYX_ERR(0, 3887, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_10);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __pyx_t_5 = Py_TYPE(__pyx_t_10)->tp_iternext;\n      index = 0; __pyx_t_2 = __pyx_t_5(__pyx_t_10); if (unlikely(!__pyx_t_2)) goto __pyx_L7_unpacking_failed;\n      __Pyx_GOTREF(__pyx_t_2);\n      index = 1; __pyx_t_4 = __pyx_t_5(__pyx_t_10); if (unlikely(!__pyx_t_4)) goto __pyx_L7_unpacking_failed;\n      __Pyx_GOTREF(__pyx_t_4);\n      if (__Pyx_IternextUnpackEndCheck(__pyx_t_5(__pyx_t_10), 2) < 0) __PYX_ERR(0, 3887, __pyx_L1_error)\n      __pyx_t_5 = NULL;\n      __Pyx_DECREF(__pyx_t_10); __pyx_t_10 = 0;\n      goto __pyx_L8_unpacking_done;\n      __pyx_L7_unpacking_failed:;\n      __Pyx_DECREF(__pyx_t_10); __pyx_t_10 = 0;\n      __pyx_t_5 = NULL;\n      if (__Pyx_IterFinish() == 0) __Pyx_RaiseNeedMoreValuesError(index);\n      __PYX_ERR(0, 3887, __pyx_L1_error)\n      __pyx_L8_unpacking_done:;\n    }\n    __pyx_t_6 = __Pyx_PyInt_As_int64_t(__pyx_t_2); if (unlikely((__pyx_t_6 == ((int64_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 3887, __pyx_L1_error)\n    __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n    if (!(likely(((__pyx_t_4) == Py_None) || likely(__Pyx_TypeTest(__pyx_t_4, __pyx_ptype_9pywrapfst__Fst))))) __PYX_ERR(0, 3887, __pyx_L1_error)\n    __pyx_v_label = __pyx_t_6;\n    __Pyx_DECREF_SET(__pyx_v_ifst, ((struct __pyx_obj_9pywrapfst__Fst *)__pyx_t_4));\n    __pyx_t_4 = 0;\n\n    /* \"pywrapfst.pyx\":3888\n *   tfst.reset(new fst.VectorFstClass(ifst.arc_type()))\n *   for (label, ifst) in it:\n *     _pairs.push_back(fst.LabelFstClassPair(label, ifst._fst.get()))             # <<<<<<<<<<<<<<\n *   cdef fst.ReplaceLabelType cal = _get_replace_label_type(\n *       tostring(call_arc_labeling), epsilon_on_replace)\n */\n    if (unlikely(((PyObject *)__pyx_v_ifst) == Py_None)) {\n      PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n      __PYX_ERR(0, 3888, __pyx_L1_error)\n    }\n    try {\n      __pyx_t_7 = __pyx_t_3fst_LabelFstClassPair(__pyx_v_label, __pyx_v_ifst->_fst.get());\n    } catch(...) {\n      __Pyx_CppExn2PyErr();\n      __PYX_ERR(0, 3888, __pyx_L1_error)\n    }\n    try {\n      __pyx_v__pairs.push_back(__pyx_t_7);\n    } catch(...) {\n      __Pyx_CppExn2PyErr();\n      __PYX_ERR(0, 3888, __pyx_L1_error)\n    }\n\n    /* \"pywrapfst.pyx\":3887\n *   cdef unique_ptr[fst.VectorFstClass] tfst\n *   tfst.reset(new fst.VectorFstClass(ifst.arc_type()))\n *   for (label, ifst) in it:             # <<<<<<<<<<<<<<\n *     _pairs.push_back(fst.LabelFstClassPair(label, ifst._fst.get()))\n *   cdef fst.ReplaceLabelType cal = _get_replace_label_type(\n */\n  }\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":3890\n *     _pairs.push_back(fst.LabelFstClassPair(label, ifst._fst.get()))\n *   cdef fst.ReplaceLabelType cal = _get_replace_label_type(\n *       tostring(call_arc_labeling), epsilon_on_replace)             # <<<<<<<<<<<<<<\n *   cdef fst.ReplaceLabelType ral = _get_replace_label_type(\n *       tostring(return_arc_labeling), epsilon_on_replace)\n */\n  __pyx_t_11 = __pyx_f_9pywrapfst_tostring(__pyx_v_call_arc_labeling, NULL); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 3890, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":3889\n *   for (label, ifst) in it:\n *     _pairs.push_back(fst.LabelFstClassPair(label, ifst._fst.get()))\n *   cdef fst.ReplaceLabelType cal = _get_replace_label_type(             # <<<<<<<<<<<<<<\n *       tostring(call_arc_labeling), epsilon_on_replace)\n *   cdef fst.ReplaceLabelType ral = _get_replace_label_type(\n */\n  __pyx_t_12 = __pyx_f_9pywrapfst__get_replace_label_type(__pyx_t_11, __pyx_v_epsilon_on_replace); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 3889, __pyx_L1_error)\n  __pyx_v_cal = __pyx_t_12;\n\n  /* \"pywrapfst.pyx\":3892\n *       tostring(call_arc_labeling), epsilon_on_replace)\n *   cdef fst.ReplaceLabelType ral = _get_replace_label_type(\n *       tostring(return_arc_labeling), epsilon_on_replace)             # <<<<<<<<<<<<<<\n *   cdef unique_ptr[fst.ReplaceOptions] opts\n *   opts.reset(new fst.ReplaceOptions(root_label, cal, ral, return_label))\n */\n  __pyx_t_11 = __pyx_f_9pywrapfst_tostring(__pyx_v_return_arc_labeling, NULL); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 3892, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":3891\n *   cdef fst.ReplaceLabelType cal = _get_replace_label_type(\n *       tostring(call_arc_labeling), epsilon_on_replace)\n *   cdef fst.ReplaceLabelType ral = _get_replace_label_type(             # <<<<<<<<<<<<<<\n *       tostring(return_arc_labeling), epsilon_on_replace)\n *   cdef unique_ptr[fst.ReplaceOptions] opts\n */\n  __pyx_t_12 = __pyx_f_9pywrapfst__get_replace_label_type(__pyx_t_11, __pyx_v_epsilon_on_replace); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 3891, __pyx_L1_error)\n  __pyx_v_ral = __pyx_t_12;\n\n  /* \"pywrapfst.pyx\":3894\n *       tostring(return_arc_labeling), epsilon_on_replace)\n *   cdef unique_ptr[fst.ReplaceOptions] opts\n *   opts.reset(new fst.ReplaceOptions(root_label, cal, ral, return_label))             # <<<<<<<<<<<<<<\n *   fst.Replace(_pairs, tfst.get(), deref(opts))\n *   return _init_MutableFst(tfst.release())\n */\n  __pyx_v_opts.reset(new fst::script::ReplaceOptions(__pyx_v_root_label, __pyx_v_cal, __pyx_v_ral, __pyx_v_return_label));\n\n  /* \"pywrapfst.pyx\":3895\n *   cdef unique_ptr[fst.ReplaceOptions] opts\n *   opts.reset(new fst.ReplaceOptions(root_label, cal, ral, return_label))\n *   fst.Replace(_pairs, tfst.get(), deref(opts))             # <<<<<<<<<<<<<<\n *   return _init_MutableFst(tfst.release())\n * \n */\n  fst::script::Replace(__pyx_v__pairs, __pyx_v_tfst.get(), (*__pyx_v_opts));\n\n  /* \"pywrapfst.pyx\":3896\n *   opts.reset(new fst.ReplaceOptions(root_label, cal, ral, return_label))\n *   fst.Replace(_pairs, tfst.get(), deref(opts))\n *   return _init_MutableFst(tfst.release())             # <<<<<<<<<<<<<<\n * \n * \n */\n  __Pyx_XDECREF(((PyObject *)__pyx_r));\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst__init_MutableFst(__pyx_v_tfst.release())); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3896, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = ((struct __pyx_obj_9pywrapfst__MutableFst *)__pyx_t_1);\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":3837\n * \n * \n * cpdef _MutableFst replace(pairs,             # <<<<<<<<<<<<<<\n *                           call_arc_labeling=b\"input\",\n *                           return_arc_labeling=b\"neither\",\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_10);\n  __Pyx_AddTraceback(\"pywrapfst.replace\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XDECREF((PyObject *)__pyx_v_ifst);\n  __Pyx_XDECREF(__pyx_v_it);\n  __Pyx_XGIVEREF((PyObject *)__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_47replace(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic char __pyx_doc_9pywrapfst_46replace[] = \"\\n  replace(pairs, call_arc_labeling=\\\"input\\\", return_arc_labeling=\\\"neither\\\",\\n          epsilon_on_replace=False, return_label=0)\\n\\n  Recursively replaces arcs in the FST with other FST(s).\\n\\n  This operation performs the dynamic replacement of arcs in one FST with\\n  another FST, allowing the definition of FSTs analogous to RTNs. It takes as\\n  input a set of pairs of a set of pairs formed by a non-terminal label and\\n  its corresponding FST, and a label identifying the root FST in that set.\\n  The resulting FST is obtained by taking the root FST and recursively replacing\\n  each arc having a nonterminal as output label by its corresponding FST. More\\n  precisely, an arc from state s to state d with (nonterminal) output label n in\\n  this FST is replaced by redirecting this \\\"call\\\" arc to the initial state of a\\n  copy F of the FST for n, and adding \\\"return\\\" arcs from each final state of F\\n  to d. Optional arguments control how the call and return arcs are labeled; by\\n  default, the only non-epsilon label is placed on the call arc.\\n\\n  Args:\\n\\n    pairs: An iterable of (nonterminal label, FST) pairs, where the former is an\\n        unsigned integer and the latter is an Fst instance.\\n    call_arc_labeling: A string indicating which call arc labels should be\\n        non-epsilon. One of: \\\"input\\\" (default), \\\"output\\\", \\\"both\\\", \\\"neither\\\".\\n        This value is set to \\\"neither\\\" if epsilon_on_replace is True.\\n    return_arc_labeling: A string indicating which return arc labels should be\\n        non-epsilon. One of: \\\"input\\\", \\\"output\\\", \\\"both\\\", \\\"neither\\\" (default).\\n        This value is set to \\\"neither\\\" if epsilon_on_replace is True.\\n    epsilon_on_replace: Should call and return arcs be epsilon arcs? If True,\\n        this effectively overrides call_arc_labeling and return_arc_labeling,\\n        setting both to \\\"neither\\\".\\n    return_label: The integer label for return arcs.\\n\\n  Returns:\\n    An FST resulting from expanding the input\"\" RTN.\\n  \";\nstatic PyObject *__pyx_pw_9pywrapfst_47replace(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  PyObject *__pyx_v_pairs = 0;\n  PyObject *__pyx_v_call_arc_labeling = 0;\n  PyObject *__pyx_v_return_arc_labeling = 0;\n  bool __pyx_v_epsilon_on_replace;\n  __pyx_t_10basictypes_int64 __pyx_v_return_label;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"replace (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_pairs,&__pyx_n_s_call_arc_labeling,&__pyx_n_s_return_arc_labeling,&__pyx_n_s_epsilon_on_replace,&__pyx_n_s_return_label,0};\n    PyObject* values[5] = {0,0,0,0,0};\n    values[1] = ((PyObject *)__pyx_n_b_input);\n    values[2] = ((PyObject *)__pyx_n_b_neither);\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  5: values[4] = PyTuple_GET_ITEM(__pyx_args, 4);\n        CYTHON_FALLTHROUGH;\n        case  4: values[3] = PyTuple_GET_ITEM(__pyx_args, 3);\n        CYTHON_FALLTHROUGH;\n        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);\n        CYTHON_FALLTHROUGH;\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (likely((values[0] = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_pairs)) != 0)) kw_args--;\n        else goto __pyx_L5_argtuple_error;\n        CYTHON_FALLTHROUGH;\n        case  1:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_call_arc_labeling);\n          if (value) { values[1] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  2:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_return_arc_labeling);\n          if (value) { values[2] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  3:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_epsilon_on_replace);\n          if (value) { values[3] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  4:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_return_label);\n          if (value) { values[4] = value; kw_args--; }\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"replace\") < 0)) __PYX_ERR(0, 3837, __pyx_L3_error)\n      }\n    } else {\n      switch (PyTuple_GET_SIZE(__pyx_args)) {\n        case  5: values[4] = PyTuple_GET_ITEM(__pyx_args, 4);\n        CYTHON_FALLTHROUGH;\n        case  4: values[3] = PyTuple_GET_ITEM(__pyx_args, 3);\n        CYTHON_FALLTHROUGH;\n        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);\n        CYTHON_FALLTHROUGH;\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n    }\n    __pyx_v_pairs = values[0];\n    __pyx_v_call_arc_labeling = values[1];\n    __pyx_v_return_arc_labeling = values[2];\n    if (values[3]) {\n      __pyx_v_epsilon_on_replace = __Pyx_PyObject_IsTrue(values[3]); if (unlikely((__pyx_v_epsilon_on_replace == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 3840, __pyx_L3_error)\n    } else {\n\n      /* \"pywrapfst.pyx\":3840\n *                           call_arc_labeling=b\"input\",\n *                           return_arc_labeling=b\"neither\",\n *                           bool epsilon_on_replace=False,             # <<<<<<<<<<<<<<\n *                           int64 return_label=0):\n *   \"\"\"\n */\n      __pyx_v_epsilon_on_replace = ((bool)0);\n    }\n    if (values[4]) {\n      __pyx_v_return_label = __Pyx_PyInt_As_int64_t(values[4]); if (unlikely((__pyx_v_return_label == ((int64_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 3841, __pyx_L3_error)\n    } else {\n      __pyx_v_return_label = ((__pyx_t_10basictypes_int64)0);\n    }\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"replace\", 0, 1, 5, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 3837, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst.replace\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  __pyx_r = __pyx_pf_9pywrapfst_46replace(__pyx_self, __pyx_v_pairs, __pyx_v_call_arc_labeling, __pyx_v_return_arc_labeling, __pyx_v_epsilon_on_replace, __pyx_v_return_label);\n\n  /* \"pywrapfst.pyx\":3837\n * \n * \n * cpdef _MutableFst replace(pairs,             # <<<<<<<<<<<<<<\n *                           call_arc_labeling=b\"input\",\n *                           return_arc_labeling=b\"neither\",\n */\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_46replace(CYTHON_UNUSED PyObject *__pyx_self, PyObject *__pyx_v_pairs, PyObject *__pyx_v_call_arc_labeling, PyObject *__pyx_v_return_arc_labeling, bool __pyx_v_epsilon_on_replace, __pyx_t_10basictypes_int64 __pyx_v_return_label) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  struct __pyx_opt_args_9pywrapfst_replace __pyx_t_2;\n  __Pyx_RefNannySetupContext(\"replace\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_2.__pyx_n = 4;\n  __pyx_t_2.call_arc_labeling = __pyx_v_call_arc_labeling;\n  __pyx_t_2.return_arc_labeling = __pyx_v_return_arc_labeling;\n  __pyx_t_2.epsilon_on_replace = __pyx_v_epsilon_on_replace;\n  __pyx_t_2.return_label = __pyx_v_return_label;\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst_replace(__pyx_v_pairs, 0, &__pyx_t_2)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3837, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.replace\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":3899\n * \n * \n * cpdef _MutableFst reverse(_Fst ifst, bool require_superinitial=True):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   reverse(ifst, require_superinitial=True)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_49reverse(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic struct __pyx_obj_9pywrapfst__MutableFst *__pyx_f_9pywrapfst_reverse(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst, CYTHON_UNUSED int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_reverse *__pyx_optional_args) {\n  bool __pyx_v_require_superinitial = ((bool)1);\n  std::unique_ptr<fst::script::VectorFstClass>  __pyx_v_tfst;\n  struct __pyx_obj_9pywrapfst__MutableFst *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"reverse\", 0);\n  if (__pyx_optional_args) {\n    if (__pyx_optional_args->__pyx_n > 0) {\n      __pyx_v_require_superinitial = __pyx_optional_args->require_superinitial;\n    }\n  }\n\n  /* \"pywrapfst.pyx\":3919\n *   \"\"\"\n *   cdef unique_ptr[fst.VectorFstClass] tfst\n *   tfst.reset(new fst.VectorFstClass(ifst.arc_type()))             # <<<<<<<<<<<<<<\n *   fst.Reverse(deref(ifst._fst), tfst.get(), require_superinitial)\n *   return _init_MutableFst(tfst.release())\n */\n  if (unlikely(((PyObject *)__pyx_v_ifst) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"arc_type\");\n    __PYX_ERR(0, 3919, __pyx_L1_error)\n  }\n  __pyx_v_tfst.reset(new fst::script::VectorFstClass(((struct __pyx_vtabstruct_9pywrapfst__Fst *)__pyx_v_ifst->__pyx_vtab)->arc_type(__pyx_v_ifst, 0)));\n\n  /* \"pywrapfst.pyx\":3920\n *   cdef unique_ptr[fst.VectorFstClass] tfst\n *   tfst.reset(new fst.VectorFstClass(ifst.arc_type()))\n *   fst.Reverse(deref(ifst._fst), tfst.get(), require_superinitial)             # <<<<<<<<<<<<<<\n *   return _init_MutableFst(tfst.release())\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_ifst) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 3920, __pyx_L1_error)\n  }\n  fst::script::Reverse((*__pyx_v_ifst->_fst), __pyx_v_tfst.get(), __pyx_v_require_superinitial);\n\n  /* \"pywrapfst.pyx\":3921\n *   tfst.reset(new fst.VectorFstClass(ifst.arc_type()))\n *   fst.Reverse(deref(ifst._fst), tfst.get(), require_superinitial)\n *   return _init_MutableFst(tfst.release())             # <<<<<<<<<<<<<<\n * \n * \n */\n  __Pyx_XDECREF(((PyObject *)__pyx_r));\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst__init_MutableFst(__pyx_v_tfst.release())); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3921, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = ((struct __pyx_obj_9pywrapfst__MutableFst *)__pyx_t_1);\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":3899\n * \n * \n * cpdef _MutableFst reverse(_Fst ifst, bool require_superinitial=True):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   reverse(ifst, require_superinitial=True)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.reverse\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XGIVEREF((PyObject *)__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_49reverse(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic char __pyx_doc_9pywrapfst_48reverse[] = \"\\n  reverse(ifst, require_superinitial=True)\\n\\n  Constructively reverses an FST's transduction.\\n\\n  This operation reverses an FST. If A transduces string x to y with weight a,\\n  then the reverse of A transduces the reverse of x to the reverse of y with\\n  weight a.Reverse(). (Typically, a = a.Reverse() and Arc = RevArc, e.g.,\\n  TropicalWeight and LogWeight.) In general, e.g., when the weights only form a\\n  left or right semiring, the output arc type must match the input arc type.\\n\\n  Args:\\n    ifst: The input FST.\\n    require_superinitial: Should a superinitial state be created?\\n\\n  Returns:\\n    A reversed FST.\\n  \";\nstatic PyObject *__pyx_pw_9pywrapfst_49reverse(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst = 0;\n  bool __pyx_v_require_superinitial;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"reverse (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_ifst,&__pyx_n_s_require_superinitial,0};\n    PyObject* values[2] = {0,0};\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (likely((values[0] = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_ifst)) != 0)) kw_args--;\n        else goto __pyx_L5_argtuple_error;\n        CYTHON_FALLTHROUGH;\n        case  1:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_require_superinitial);\n          if (value) { values[1] = value; kw_args--; }\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"reverse\") < 0)) __PYX_ERR(0, 3899, __pyx_L3_error)\n      }\n    } else {\n      switch (PyTuple_GET_SIZE(__pyx_args)) {\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n    }\n    __pyx_v_ifst = ((struct __pyx_obj_9pywrapfst__Fst *)values[0]);\n    if (values[1]) {\n      __pyx_v_require_superinitial = __Pyx_PyObject_IsTrue(values[1]); if (unlikely((__pyx_v_require_superinitial == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 3899, __pyx_L3_error)\n    } else {\n      __pyx_v_require_superinitial = ((bool)1);\n    }\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"reverse\", 0, 1, 2, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 3899, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst.reverse\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_ifst), __pyx_ptype_9pywrapfst__Fst, 1, \"ifst\", 0))) __PYX_ERR(0, 3899, __pyx_L1_error)\n  __pyx_r = __pyx_pf_9pywrapfst_48reverse(__pyx_self, __pyx_v_ifst, __pyx_v_require_superinitial);\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_48reverse(CYTHON_UNUSED PyObject *__pyx_self, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst, bool __pyx_v_require_superinitial) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  struct __pyx_opt_args_9pywrapfst_reverse __pyx_t_2;\n  __Pyx_RefNannySetupContext(\"reverse\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_2.__pyx_n = 1;\n  __pyx_t_2.require_superinitial = __pyx_v_require_superinitial;\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst_reverse(__pyx_v_ifst, 0, &__pyx_t_2)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3899, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.reverse\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":3927\n * \n * \n * cdef vector[fst.WeightClass] *_shortestdistance(_Fst ifst,             # <<<<<<<<<<<<<<\n *                                                 float delta=fst.kShortestDelta,\n *                                                 int64 nstate=fst.kNoStateId,\n */\n\nstatic std::vector<fst::script::WeightClass>  *__pyx_f_9pywrapfst__shortestdistance(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst, struct __pyx_opt_args_9pywrapfst__shortestdistance *__pyx_optional_args) {\n  float __pyx_v_delta = __pyx_k__82;\n  __pyx_t_10basictypes_int64 __pyx_v_nstate = __pyx_k__83;\n  PyObject *__pyx_v_queue_type = ((PyObject *)__pyx_n_b_auto);\n\n  /* \"pywrapfst.pyx\":3931\n *                                                 int64 nstate=fst.kNoStateId,\n *                                                 queue_type=b\"auto\",\n *                                                 bool reverse=False) except *:             # <<<<<<<<<<<<<<\n *   cdef unique_ptr[vector[fst.WeightClass]] distance\n *   distance.reset(new vector[fst.WeightClass]())\n */\n  bool __pyx_v_reverse = ((bool)0);\n  std::unique_ptr<std::vector<fst::script::WeightClass> >  __pyx_v_distance;\n  std::unique_ptr<fst::script::ShortestDistanceOptions>  __pyx_v_opts;\n  std::vector<fst::script::WeightClass>  *__pyx_r;\n  __Pyx_RefNannyDeclarations\n  std::vector<fst::script::WeightClass>  *__pyx_t_1;\n  int __pyx_t_2;\n  std::string __pyx_t_3;\n  enum fst::QueueType __pyx_t_4;\n  __Pyx_RefNannySetupContext(\"_shortestdistance\", 0);\n  if (__pyx_optional_args) {\n    if (__pyx_optional_args->__pyx_n > 0) {\n      __pyx_v_delta = __pyx_optional_args->delta;\n      if (__pyx_optional_args->__pyx_n > 1) {\n        __pyx_v_nstate = __pyx_optional_args->nstate;\n        if (__pyx_optional_args->__pyx_n > 2) {\n          __pyx_v_queue_type = __pyx_optional_args->queue_type;\n          if (__pyx_optional_args->__pyx_n > 3) {\n            __pyx_v_reverse = __pyx_optional_args->reverse;\n          }\n        }\n      }\n    }\n  }\n\n  /* \"pywrapfst.pyx\":3933\n *                                                 bool reverse=False) except *:\n *   cdef unique_ptr[vector[fst.WeightClass]] distance\n *   distance.reset(new vector[fst.WeightClass]())             # <<<<<<<<<<<<<<\n *   # For scoping reasons, these have to be declared here even though they may\n *   # not be used in all cases.\n */\n  try {\n    __pyx_t_1 = new std::vector<fst::script::WeightClass> ();\n  } catch(...) {\n    __Pyx_CppExn2PyErr();\n    __PYX_ERR(0, 3933, __pyx_L1_error)\n  }\n  __pyx_v_distance.reset(__pyx_t_1);\n\n  /* \"pywrapfst.pyx\":3937\n *   # not be used in all cases.\n *   cdef unique_ptr[fst.ShortestDistanceOptions] opts\n *   if reverse:             # <<<<<<<<<<<<<<\n *     # Only the simpler signature supports shortest distance to final states;\n *     # `nstate` and `queue_type` arguments are ignored.\n */\n  __pyx_t_2 = (__pyx_v_reverse != 0);\n  if (__pyx_t_2) {\n\n    /* \"pywrapfst.pyx\":3940\n *     # Only the simpler signature supports shortest distance to final states;\n *     # `nstate` and `queue_type` arguments are ignored.\n *     fst.ShortestDistance(deref(ifst._fst), distance.get(), True, delta)             # <<<<<<<<<<<<<<\n *   else:\n *     opts.reset(new fst.ShortestDistanceOptions(\n */\n    if (unlikely(((PyObject *)__pyx_v_ifst) == Py_None)) {\n      PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n      __PYX_ERR(0, 3940, __pyx_L1_error)\n    }\n    fst::script::ShortestDistance((*__pyx_v_ifst->_fst), __pyx_v_distance.get(), 1, __pyx_v_delta);\n\n    /* \"pywrapfst.pyx\":3937\n *   # not be used in all cases.\n *   cdef unique_ptr[fst.ShortestDistanceOptions] opts\n *   if reverse:             # <<<<<<<<<<<<<<\n *     # Only the simpler signature supports shortest distance to final states;\n *     # `nstate` and `queue_type` arguments are ignored.\n */\n    goto __pyx_L3;\n  }\n\n  /* \"pywrapfst.pyx\":3942\n *     fst.ShortestDistance(deref(ifst._fst), distance.get(), True, delta)\n *   else:\n *     opts.reset(new fst.ShortestDistanceOptions(             # <<<<<<<<<<<<<<\n *         _get_queue_type(tostring(queue_type)), fst.ANY_ARC_FILTER, nstate,\n *         delta))\n */\n  /*else*/ {\n\n    /* \"pywrapfst.pyx\":3943\n *   else:\n *     opts.reset(new fst.ShortestDistanceOptions(\n *         _get_queue_type(tostring(queue_type)), fst.ANY_ARC_FILTER, nstate,             # <<<<<<<<<<<<<<\n *         delta))\n *     fst.ShortestDistance(deref(ifst._fst), distance.get(), deref(opts))\n */\n    __pyx_t_3 = __pyx_f_9pywrapfst_tostring(__pyx_v_queue_type, NULL); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 3943, __pyx_L1_error)\n    __pyx_t_4 = __pyx_f_9pywrapfst__get_queue_type(__pyx_t_3); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 3943, __pyx_L1_error)\n\n    /* \"pywrapfst.pyx\":3942\n *     fst.ShortestDistance(deref(ifst._fst), distance.get(), True, delta)\n *   else:\n *     opts.reset(new fst.ShortestDistanceOptions(             # <<<<<<<<<<<<<<\n *         _get_queue_type(tostring(queue_type)), fst.ANY_ARC_FILTER, nstate,\n *         delta))\n */\n    __pyx_v_opts.reset(new fst::script::ShortestDistanceOptions(__pyx_t_4, fst::script::ANY_ARC_FILTER, __pyx_v_nstate, __pyx_v_delta));\n\n    /* \"pywrapfst.pyx\":3945\n *         _get_queue_type(tostring(queue_type)), fst.ANY_ARC_FILTER, nstate,\n *         delta))\n *     fst.ShortestDistance(deref(ifst._fst), distance.get(), deref(opts))             # <<<<<<<<<<<<<<\n *   return distance.release()\n * \n */\n    if (unlikely(((PyObject *)__pyx_v_ifst) == Py_None)) {\n      PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n      __PYX_ERR(0, 3945, __pyx_L1_error)\n    }\n    fst::script::ShortestDistance((*__pyx_v_ifst->_fst), __pyx_v_distance.get(), (*__pyx_v_opts));\n  }\n  __pyx_L3:;\n\n  /* \"pywrapfst.pyx\":3946\n *         delta))\n *     fst.ShortestDistance(deref(ifst._fst), distance.get(), deref(opts))\n *   return distance.release()             # <<<<<<<<<<<<<<\n * \n * \n */\n  __pyx_r = __pyx_v_distance.release();\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":3927\n * \n * \n * cdef vector[fst.WeightClass] *_shortestdistance(_Fst ifst,             # <<<<<<<<<<<<<<\n *                                                 float delta=fst.kShortestDelta,\n *                                                 int64 nstate=fst.kNoStateId,\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"pywrapfst._shortestdistance\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":3949\n * \n * \n * def shortestdistance(_Fst ifst,             # <<<<<<<<<<<<<<\n *                      float delta=fst.kShortestDelta,\n *                      int64 nstate=fst.kNoStateId,\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_51shortestdistance(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic char __pyx_doc_9pywrapfst_50shortestdistance[] = \"\\n  shortestdistance(ifst, delta=1e-6, nstate=NO_STATE_ID,\\n                   queue_type=\\\"auto\\\", reverse=False)\\n\\n  Compute the shortest distance from the initial or final state.\\n\\n  This operation computes the shortest distance from the initial state (when\\n  `reverse` is False) or from every state to the final state (when `reverse` is\\n  True). The shortest distance from p to q is the \\\\otimes-sum of the weights of\\n  all the paths between p and q. The weights must be right (if `reverse` is\\n  False) or left (if `reverse` is True) distributive, and k-closed (i.e., 1\\n  \\\\otimes x \\\\otimes x^2 \\\\otimes ... \\\\otimes x^{k + 1} = 1 \\\\otimes x \\\\otimes x^2\\n  \\\\otimes ... \\\\otimes x^k; e.g., TropicalWeight).\\n\\n  Args:\\n    ifst: The input FST.\\n    delta: Comparison/quantization delta.\\n    nstate: State number threshold (ignored if `reverse` is True).\\n    queue_type: A string matching a known queue type; one of: \\\"auto\\\", \\\"fifo\\\",\\n        \\\"lifo\\\", \\\"shortest\\\", \\\"state\\\", \\\"top\\\" (ignored if `reverse` is True).\\n    reverse: Should the reverse distance (from each state to the final state)\\n        be computed?\\n\\n  Returns:\\n    A list of Weight objects representing the shortest distance for each state.\\n  \";\nstatic PyMethodDef __pyx_mdef_9pywrapfst_51shortestdistance = {\"shortestdistance\", (PyCFunction)__pyx_pw_9pywrapfst_51shortestdistance, METH_VARARGS|METH_KEYWORDS, __pyx_doc_9pywrapfst_50shortestdistance};\nstatic PyObject *__pyx_pw_9pywrapfst_51shortestdistance(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst = 0;\n  float __pyx_v_delta;\n  __pyx_t_10basictypes_int64 __pyx_v_nstate;\n  PyObject *__pyx_v_queue_type = 0;\n  bool __pyx_v_reverse;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"shortestdistance (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_ifst,&__pyx_n_s_delta,&__pyx_n_s_nstate,&__pyx_n_s_queue_type,&__pyx_n_s_reverse,0};\n    PyObject* values[5] = {0,0,0,0,0};\n    values[3] = ((PyObject *)__pyx_n_b_auto);\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  5: values[4] = PyTuple_GET_ITEM(__pyx_args, 4);\n        CYTHON_FALLTHROUGH;\n        case  4: values[3] = PyTuple_GET_ITEM(__pyx_args, 3);\n        CYTHON_FALLTHROUGH;\n        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);\n        CYTHON_FALLTHROUGH;\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (likely((values[0] = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_ifst)) != 0)) kw_args--;\n        else goto __pyx_L5_argtuple_error;\n        CYTHON_FALLTHROUGH;\n        case  1:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_delta);\n          if (value) { values[1] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  2:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_nstate);\n          if (value) { values[2] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  3:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_queue_type);\n          if (value) { values[3] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  4:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_reverse);\n          if (value) { values[4] = value; kw_args--; }\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"shortestdistance\") < 0)) __PYX_ERR(0, 3949, __pyx_L3_error)\n      }\n    } else {\n      switch (PyTuple_GET_SIZE(__pyx_args)) {\n        case  5: values[4] = PyTuple_GET_ITEM(__pyx_args, 4);\n        CYTHON_FALLTHROUGH;\n        case  4: values[3] = PyTuple_GET_ITEM(__pyx_args, 3);\n        CYTHON_FALLTHROUGH;\n        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);\n        CYTHON_FALLTHROUGH;\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n    }\n    __pyx_v_ifst = ((struct __pyx_obj_9pywrapfst__Fst *)values[0]);\n    if (values[1]) {\n      __pyx_v_delta = __pyx_PyFloat_AsFloat(values[1]); if (unlikely((__pyx_v_delta == (float)-1) && PyErr_Occurred())) __PYX_ERR(0, 3950, __pyx_L3_error)\n    } else {\n      __pyx_v_delta = __pyx_k__84;\n    }\n    if (values[2]) {\n      __pyx_v_nstate = __Pyx_PyInt_As_int64_t(values[2]); if (unlikely((__pyx_v_nstate == ((int64_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 3951, __pyx_L3_error)\n    } else {\n      __pyx_v_nstate = __pyx_k__85;\n    }\n    __pyx_v_queue_type = values[3];\n    if (values[4]) {\n      __pyx_v_reverse = __Pyx_PyObject_IsTrue(values[4]); if (unlikely((__pyx_v_reverse == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 3953, __pyx_L3_error)\n    } else {\n\n      /* \"pywrapfst.pyx\":3953\n *                      int64 nstate=fst.kNoStateId,\n *                      queue_type=b\"auto\",\n *                      bool reverse=False):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   shortestdistance(ifst, delta=1e-6, nstate=NO_STATE_ID,\n */\n      __pyx_v_reverse = ((bool)0);\n    }\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"shortestdistance\", 0, 1, 5, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 3949, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst.shortestdistance\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_ifst), __pyx_ptype_9pywrapfst__Fst, 1, \"ifst\", 0))) __PYX_ERR(0, 3949, __pyx_L1_error)\n  __pyx_r = __pyx_pf_9pywrapfst_50shortestdistance(__pyx_self, __pyx_v_ifst, __pyx_v_delta, __pyx_v_nstate, __pyx_v_queue_type, __pyx_v_reverse);\n\n  /* \"pywrapfst.pyx\":3949\n * \n * \n * def shortestdistance(_Fst ifst,             # <<<<<<<<<<<<<<\n *                      float delta=fst.kShortestDelta,\n *                      int64 nstate=fst.kNoStateId,\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_50shortestdistance(CYTHON_UNUSED PyObject *__pyx_self, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst, float __pyx_v_delta, __pyx_t_10basictypes_int64 __pyx_v_nstate, PyObject *__pyx_v_queue_type, bool __pyx_v_reverse) {\n  std::unique_ptr<std::vector<fst::script::WeightClass> >  __pyx_v_distance;\n  std::string __pyx_v_weight_type;\n  fst::script::WeightClass __pyx_v_weight;\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  std::vector<fst::script::WeightClass>  *__pyx_t_1;\n  struct __pyx_opt_args_9pywrapfst__shortestdistance __pyx_t_2;\n  PyObject *__pyx_t_3 = NULL;\n  std::vector<fst::script::WeightClass> ::iterator __pyx_t_4;\n  fst::script::WeightClass __pyx_t_5;\n  PyObject *__pyx_t_6 = NULL;\n  PyObject *__pyx_t_7 = NULL;\n  PyObject *__pyx_t_8 = NULL;\n  __Pyx_RefNannySetupContext(\"shortestdistance\", 0);\n\n  /* \"pywrapfst.pyx\":3981\n *   \"\"\"\n *   cdef unique_ptr[vector[fst.WeightClass]] distance\n *   distance.reset(_shortestdistance(ifst, delta, nstate, queue_type, reverse))             # <<<<<<<<<<<<<<\n *   cdef string weight_type = ifst.weight_type()\n *   return [Weight(weight_type, weight.ToString()) for weight in deref(distance)]\n */\n  __pyx_t_2.__pyx_n = 4;\n  __pyx_t_2.delta = __pyx_v_delta;\n  __pyx_t_2.nstate = __pyx_v_nstate;\n  __pyx_t_2.queue_type = __pyx_v_queue_type;\n  __pyx_t_2.reverse = __pyx_v_reverse;\n  __pyx_t_1 = __pyx_f_9pywrapfst__shortestdistance(__pyx_v_ifst, &__pyx_t_2); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 3981, __pyx_L1_error)\n  __pyx_v_distance.reset(__pyx_t_1);\n\n  /* \"pywrapfst.pyx\":3982\n *   cdef unique_ptr[vector[fst.WeightClass]] distance\n *   distance.reset(_shortestdistance(ifst, delta, nstate, queue_type, reverse))\n *   cdef string weight_type = ifst.weight_type()             # <<<<<<<<<<<<<<\n *   return [Weight(weight_type, weight.ToString()) for weight in deref(distance)]\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_ifst) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"weight_type\");\n    __PYX_ERR(0, 3982, __pyx_L1_error)\n  }\n  __pyx_v_weight_type = ((struct __pyx_vtabstruct_9pywrapfst__Fst *)__pyx_v_ifst->__pyx_vtab)->weight_type(__pyx_v_ifst, 0);\n\n  /* \"pywrapfst.pyx\":3983\n *   distance.reset(_shortestdistance(ifst, delta, nstate, queue_type, reverse))\n *   cdef string weight_type = ifst.weight_type()\n *   return [Weight(weight_type, weight.ToString()) for weight in deref(distance)]             # <<<<<<<<<<<<<<\n * \n * \n */\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_3 = PyList_New(0); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 3983, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_3);\n  __pyx_t_1 = &(*__pyx_v_distance);\n  __pyx_t_4 = __pyx_t_1->begin();\n  for (;;) {\n    if (!(__pyx_t_4 != __pyx_t_1->end())) break;\n    __pyx_t_5 = *__pyx_t_4;\n    ++__pyx_t_4;\n    __pyx_v_weight = __pyx_t_5;\n    __pyx_t_6 = __pyx_convert_PyBytes_string_to_py_std__in_string(__pyx_v_weight_type); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 3983, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_6);\n    __pyx_t_7 = __pyx_convert_PyBytes_string_to_py_std__in_string(__pyx_v_weight.ToString()); if (unlikely(!__pyx_t_7)) __PYX_ERR(0, 3983, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_7);\n    __pyx_t_8 = PyTuple_New(2); if (unlikely(!__pyx_t_8)) __PYX_ERR(0, 3983, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_8);\n    __Pyx_GIVEREF(__pyx_t_6);\n    PyTuple_SET_ITEM(__pyx_t_8, 0, __pyx_t_6);\n    __Pyx_GIVEREF(__pyx_t_7);\n    PyTuple_SET_ITEM(__pyx_t_8, 1, __pyx_t_7);\n    __pyx_t_6 = 0;\n    __pyx_t_7 = 0;\n    __pyx_t_7 = __Pyx_PyObject_Call(((PyObject *)__pyx_ptype_9pywrapfst_Weight), __pyx_t_8, NULL); if (unlikely(!__pyx_t_7)) __PYX_ERR(0, 3983, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_7);\n    __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0;\n    if (unlikely(__Pyx_ListComp_Append(__pyx_t_3, (PyObject*)__pyx_t_7))) __PYX_ERR(0, 3983, __pyx_L1_error)\n    __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0;\n  }\n  __pyx_r = __pyx_t_3;\n  __pyx_t_3 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":3949\n * \n * \n * def shortestdistance(_Fst ifst,             # <<<<<<<<<<<<<<\n *                      float delta=fst.kShortestDelta,\n *                      int64 nstate=fst.kNoStateId,\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_6);\n  __Pyx_XDECREF(__pyx_t_7);\n  __Pyx_XDECREF(__pyx_t_8);\n  __Pyx_AddTraceback(\"pywrapfst.shortestdistance\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":3986\n * \n * \n * cpdef _MutableFst shortestpath(_Fst ifst,             # <<<<<<<<<<<<<<\n *                                float delta=fst.kShortestDelta,\n *                                int32 nshortest=1,\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_53shortestpath(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic struct __pyx_obj_9pywrapfst__MutableFst *__pyx_f_9pywrapfst_shortestpath(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst, CYTHON_UNUSED int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_shortestpath *__pyx_optional_args) {\n  float __pyx_v_delta = __pyx_k__86;\n  __pyx_t_10basictypes_int32 __pyx_v_nshortest = ((__pyx_t_10basictypes_int32)1);\n  __pyx_t_10basictypes_int64 __pyx_v_nstate = __pyx_k__87;\n  PyObject *__pyx_v_queue_type = ((PyObject *)__pyx_n_b_auto);\n\n  /* \"pywrapfst.pyx\":3991\n *                                int64 nstate=fst.kNoStateId,\n *                                queue_type=b\"auto\",\n *                                bool unique=False,             # <<<<<<<<<<<<<<\n *                                weight=None):\n *   \"\"\"\n */\n  bool __pyx_v_unique = ((bool)0);\n\n  /* \"pywrapfst.pyx\":3992\n *                                queue_type=b\"auto\",\n *                                bool unique=False,\n *                                weight=None):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   shortestpath(ifst, delta=1e-6, nshortest=1, nstate=NO_STATE_ID,\n */\n  PyObject *__pyx_v_weight = ((PyObject *)Py_None);\n  std::unique_ptr<fst::script::VectorFstClass>  __pyx_v_tfst;\n  fst::script::WeightClass __pyx_v_wc;\n  std::unique_ptr<fst::script::ShortestPathOptions>  __pyx_v_opts;\n  struct __pyx_obj_9pywrapfst__MutableFst *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  fst::script::WeightClass __pyx_t_1;\n  std::string __pyx_t_2;\n  enum fst::QueueType __pyx_t_3;\n  PyObject *__pyx_t_4 = NULL;\n  __Pyx_RefNannySetupContext(\"shortestpath\", 0);\n  if (__pyx_optional_args) {\n    if (__pyx_optional_args->__pyx_n > 0) {\n      __pyx_v_delta = __pyx_optional_args->delta;\n      if (__pyx_optional_args->__pyx_n > 1) {\n        __pyx_v_nshortest = __pyx_optional_args->nshortest;\n        if (__pyx_optional_args->__pyx_n > 2) {\n          __pyx_v_nstate = __pyx_optional_args->nstate;\n          if (__pyx_optional_args->__pyx_n > 3) {\n            __pyx_v_queue_type = __pyx_optional_args->queue_type;\n            if (__pyx_optional_args->__pyx_n > 4) {\n              __pyx_v_unique = __pyx_optional_args->unique;\n              if (__pyx_optional_args->__pyx_n > 5) {\n                __pyx_v_weight = __pyx_optional_args->weight;\n              }\n            }\n          }\n        }\n      }\n    }\n  }\n\n  /* \"pywrapfst.pyx\":4024\n *   \"\"\"\n *   cdef unique_ptr[fst.VectorFstClass] tfst\n *   tfst.reset(new fst.VectorFstClass(ifst.arc_type()))             # <<<<<<<<<<<<<<\n *   # Threshold is set to semiring Zero (no pruning) if no weight is specified.\n *   cdef fst.WeightClass wc = _get_WeightClass_or_Zero(ifst.weight_type(), weight)\n */\n  if (unlikely(((PyObject *)__pyx_v_ifst) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"arc_type\");\n    __PYX_ERR(0, 4024, __pyx_L1_error)\n  }\n  __pyx_v_tfst.reset(new fst::script::VectorFstClass(((struct __pyx_vtabstruct_9pywrapfst__Fst *)__pyx_v_ifst->__pyx_vtab)->arc_type(__pyx_v_ifst, 0)));\n\n  /* \"pywrapfst.pyx\":4026\n *   tfst.reset(new fst.VectorFstClass(ifst.arc_type()))\n *   # Threshold is set to semiring Zero (no pruning) if no weight is specified.\n *   cdef fst.WeightClass wc = _get_WeightClass_or_Zero(ifst.weight_type(), weight)             # <<<<<<<<<<<<<<\n *   cdef unique_ptr[fst.ShortestPathOptions] opts\n *   opts.reset(new fst.ShortestPathOptions(_get_queue_type(tostring(queue_type)),\n */\n  if (unlikely(((PyObject *)__pyx_v_ifst) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"weight_type\");\n    __PYX_ERR(0, 4026, __pyx_L1_error)\n  }\n  __pyx_t_1 = __pyx_f_9pywrapfst__get_WeightClass_or_Zero(((struct __pyx_vtabstruct_9pywrapfst__Fst *)__pyx_v_ifst->__pyx_vtab)->weight_type(__pyx_v_ifst, 0), __pyx_v_weight); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 4026, __pyx_L1_error)\n  __pyx_v_wc = __pyx_t_1;\n\n  /* \"pywrapfst.pyx\":4028\n *   cdef fst.WeightClass wc = _get_WeightClass_or_Zero(ifst.weight_type(), weight)\n *   cdef unique_ptr[fst.ShortestPathOptions] opts\n *   opts.reset(new fst.ShortestPathOptions(_get_queue_type(tostring(queue_type)),             # <<<<<<<<<<<<<<\n *                                          nshortest, unique, delta, wc, nstate))\n *   fst.ShortestPath(deref(ifst._fst), tfst.get(), deref(opts))\n */\n  __pyx_t_2 = __pyx_f_9pywrapfst_tostring(__pyx_v_queue_type, NULL); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 4028, __pyx_L1_error)\n  __pyx_t_3 = __pyx_f_9pywrapfst__get_queue_type(__pyx_t_2); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 4028, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":4029\n *   cdef unique_ptr[fst.ShortestPathOptions] opts\n *   opts.reset(new fst.ShortestPathOptions(_get_queue_type(tostring(queue_type)),\n *                                          nshortest, unique, delta, wc, nstate))             # <<<<<<<<<<<<<<\n *   fst.ShortestPath(deref(ifst._fst), tfst.get(), deref(opts))\n *   return _init_MutableFst(tfst.release())\n */\n  __pyx_v_opts.reset(new fst::script::ShortestPathOptions(__pyx_t_3, __pyx_v_nshortest, __pyx_v_unique, __pyx_v_delta, __pyx_v_wc, __pyx_v_nstate));\n\n  /* \"pywrapfst.pyx\":4030\n *   opts.reset(new fst.ShortestPathOptions(_get_queue_type(tostring(queue_type)),\n *                                          nshortest, unique, delta, wc, nstate))\n *   fst.ShortestPath(deref(ifst._fst), tfst.get(), deref(opts))             # <<<<<<<<<<<<<<\n *   return _init_MutableFst(tfst.release())\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_ifst) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 4030, __pyx_L1_error)\n  }\n  fst::script::ShortestPath((*__pyx_v_ifst->_fst), __pyx_v_tfst.get(), (*__pyx_v_opts));\n\n  /* \"pywrapfst.pyx\":4031\n *                                          nshortest, unique, delta, wc, nstate))\n *   fst.ShortestPath(deref(ifst._fst), tfst.get(), deref(opts))\n *   return _init_MutableFst(tfst.release())             # <<<<<<<<<<<<<<\n * \n * \n */\n  __Pyx_XDECREF(((PyObject *)__pyx_r));\n  __pyx_t_4 = ((PyObject *)__pyx_f_9pywrapfst__init_MutableFst(__pyx_v_tfst.release())); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 4031, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_4);\n  __pyx_r = ((struct __pyx_obj_9pywrapfst__MutableFst *)__pyx_t_4);\n  __pyx_t_4 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":3986\n * \n * \n * cpdef _MutableFst shortestpath(_Fst ifst,             # <<<<<<<<<<<<<<\n *                                float delta=fst.kShortestDelta,\n *                                int32 nshortest=1,\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_AddTraceback(\"pywrapfst.shortestpath\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XGIVEREF((PyObject *)__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_53shortestpath(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic char __pyx_doc_9pywrapfst_52shortestpath[] = \"\\n  shortestpath(ifst, delta=1e-6, nshortest=1, nstate=NO_STATE_ID,\\n               queue_type=\\\"auto\\\", unique=False, weight=None)\\n\\n  Construct an FST containing the shortest path(s) in the input FST.\\n\\n  This operation produces an FST containing the n-shortest paths in the input\\n  FST. The n-shortest paths are the n-lowest weight paths w.r.t. the natural\\n  semiring order. The single path that can be read from the ith of at most n\\n  transitions leaving the initial state of the resulting FST is the ith\\n  shortest path. The weights need to be right distributive and have the path\\n  property. They also need to be left distributive as well for n-shortest with\\n  n > 1 (e.g., TropicalWeight).\\n\\n  Args:\\n    ifst: The input FST.\\n    delta: Comparison/quantization delta.\\n    nshortest: The number of paths to return.\\n    nstate: State number threshold.\\n    queue_type: A string matching a known queue type; one of: \\\"auto\\\", \\\"fifo\\\",\\n        \\\"lifo\\\", \\\"shortest\\\", \\\"state\\\", \\\"top\\\".\\n    unique: Should the resulting FST only contain distinct paths? (Requires\\n        the input FST to be an acceptor; epsilons are treated as if they are\\n        regular symbols.)\\n    weight: A Weight or weight string indicating the desired weight threshold\\n        below which paths are pruned; if omitted, no paths are pruned.\\n\\n  Returns:\\n    An FST containing the n-shortest paths.\\n  \";\nstatic PyObject *__pyx_pw_9pywrapfst_53shortestpath(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst = 0;\n  float __pyx_v_delta;\n  __pyx_t_10basictypes_int32 __pyx_v_nshortest;\n  __pyx_t_10basictypes_int64 __pyx_v_nstate;\n  PyObject *__pyx_v_queue_type = 0;\n  bool __pyx_v_unique;\n  PyObject *__pyx_v_weight = 0;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"shortestpath (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_ifst,&__pyx_n_s_delta,&__pyx_n_s_nshortest,&__pyx_n_s_nstate,&__pyx_n_s_queue_type,&__pyx_n_s_unique,&__pyx_n_s_weight,0};\n    PyObject* values[7] = {0,0,0,0,0,0,0};\n    values[4] = ((PyObject *)__pyx_n_b_auto);\n\n    /* \"pywrapfst.pyx\":3992\n *                                queue_type=b\"auto\",\n *                                bool unique=False,\n *                                weight=None):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   shortestpath(ifst, delta=1e-6, nshortest=1, nstate=NO_STATE_ID,\n */\n    values[6] = ((PyObject *)Py_None);\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  7: values[6] = PyTuple_GET_ITEM(__pyx_args, 6);\n        CYTHON_FALLTHROUGH;\n        case  6: values[5] = PyTuple_GET_ITEM(__pyx_args, 5);\n        CYTHON_FALLTHROUGH;\n        case  5: values[4] = PyTuple_GET_ITEM(__pyx_args, 4);\n        CYTHON_FALLTHROUGH;\n        case  4: values[3] = PyTuple_GET_ITEM(__pyx_args, 3);\n        CYTHON_FALLTHROUGH;\n        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);\n        CYTHON_FALLTHROUGH;\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (likely((values[0] = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_ifst)) != 0)) kw_args--;\n        else goto __pyx_L5_argtuple_error;\n        CYTHON_FALLTHROUGH;\n        case  1:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_delta);\n          if (value) { values[1] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  2:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_nshortest);\n          if (value) { values[2] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  3:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_nstate);\n          if (value) { values[3] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  4:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_queue_type);\n          if (value) { values[4] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  5:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_unique);\n          if (value) { values[5] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  6:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_weight);\n          if (value) { values[6] = value; kw_args--; }\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"shortestpath\") < 0)) __PYX_ERR(0, 3986, __pyx_L3_error)\n      }\n    } else {\n      switch (PyTuple_GET_SIZE(__pyx_args)) {\n        case  7: values[6] = PyTuple_GET_ITEM(__pyx_args, 6);\n        CYTHON_FALLTHROUGH;\n        case  6: values[5] = PyTuple_GET_ITEM(__pyx_args, 5);\n        CYTHON_FALLTHROUGH;\n        case  5: values[4] = PyTuple_GET_ITEM(__pyx_args, 4);\n        CYTHON_FALLTHROUGH;\n        case  4: values[3] = PyTuple_GET_ITEM(__pyx_args, 3);\n        CYTHON_FALLTHROUGH;\n        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);\n        CYTHON_FALLTHROUGH;\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n    }\n    __pyx_v_ifst = ((struct __pyx_obj_9pywrapfst__Fst *)values[0]);\n    if (values[1]) {\n      __pyx_v_delta = __pyx_PyFloat_AsFloat(values[1]); if (unlikely((__pyx_v_delta == (float)-1) && PyErr_Occurred())) __PYX_ERR(0, 3987, __pyx_L3_error)\n    } else {\n      __pyx_v_delta = __pyx_k__86;\n    }\n    if (values[2]) {\n      __pyx_v_nshortest = __Pyx_PyInt_As_int32_t(values[2]); if (unlikely((__pyx_v_nshortest == ((int32_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 3988, __pyx_L3_error)\n    } else {\n      __pyx_v_nshortest = ((__pyx_t_10basictypes_int32)1);\n    }\n    if (values[3]) {\n      __pyx_v_nstate = __Pyx_PyInt_As_int64_t(values[3]); if (unlikely((__pyx_v_nstate == ((int64_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 3989, __pyx_L3_error)\n    } else {\n      __pyx_v_nstate = __pyx_k__87;\n    }\n    __pyx_v_queue_type = values[4];\n    if (values[5]) {\n      __pyx_v_unique = __Pyx_PyObject_IsTrue(values[5]); if (unlikely((__pyx_v_unique == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 3991, __pyx_L3_error)\n    } else {\n\n      /* \"pywrapfst.pyx\":3991\n *                                int64 nstate=fst.kNoStateId,\n *                                queue_type=b\"auto\",\n *                                bool unique=False,             # <<<<<<<<<<<<<<\n *                                weight=None):\n *   \"\"\"\n */\n      __pyx_v_unique = ((bool)0);\n    }\n    __pyx_v_weight = values[6];\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"shortestpath\", 0, 1, 7, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 3986, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst.shortestpath\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_ifst), __pyx_ptype_9pywrapfst__Fst, 1, \"ifst\", 0))) __PYX_ERR(0, 3986, __pyx_L1_error)\n  __pyx_r = __pyx_pf_9pywrapfst_52shortestpath(__pyx_self, __pyx_v_ifst, __pyx_v_delta, __pyx_v_nshortest, __pyx_v_nstate, __pyx_v_queue_type, __pyx_v_unique, __pyx_v_weight);\n\n  /* \"pywrapfst.pyx\":3986\n * \n * \n * cpdef _MutableFst shortestpath(_Fst ifst,             # <<<<<<<<<<<<<<\n *                                float delta=fst.kShortestDelta,\n *                                int32 nshortest=1,\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_52shortestpath(CYTHON_UNUSED PyObject *__pyx_self, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst, float __pyx_v_delta, __pyx_t_10basictypes_int32 __pyx_v_nshortest, __pyx_t_10basictypes_int64 __pyx_v_nstate, PyObject *__pyx_v_queue_type, bool __pyx_v_unique, PyObject *__pyx_v_weight) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  struct __pyx_opt_args_9pywrapfst_shortestpath __pyx_t_2;\n  __Pyx_RefNannySetupContext(\"shortestpath\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_2.__pyx_n = 6;\n  __pyx_t_2.delta = __pyx_v_delta;\n  __pyx_t_2.nshortest = __pyx_v_nshortest;\n  __pyx_t_2.nstate = __pyx_v_nstate;\n  __pyx_t_2.queue_type = __pyx_v_queue_type;\n  __pyx_t_2.unique = __pyx_v_unique;\n  __pyx_t_2.weight = __pyx_v_weight;\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst_shortestpath(__pyx_v_ifst, 0, &__pyx_t_2)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3986, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.shortestpath\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":4034\n * \n * \n * cpdef _Fst statemap(_Fst ifst, map_type):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   state_map(ifst, map_type)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_55statemap(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic struct __pyx_obj_9pywrapfst__Fst *__pyx_f_9pywrapfst_statemap(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst, PyObject *__pyx_v_map_type, CYTHON_UNUSED int __pyx_skip_dispatch) {\n  struct __pyx_obj_9pywrapfst__Fst *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  struct __pyx_opt_args_9pywrapfst__map __pyx_t_2;\n  __Pyx_RefNannySetupContext(\"statemap\", 0);\n\n  /* \"pywrapfst.pyx\":4057\n *   See also: `arcmap`.\n *   \"\"\"\n *   return _map(ifst, fst.kDelta, map_type, 1., None)             # <<<<<<<<<<<<<<\n * \n * \n */\n  __Pyx_XDECREF(((PyObject *)__pyx_r));\n  __pyx_t_2.__pyx_n = 4;\n  __pyx_t_2.delta = fst::kDelta;\n  __pyx_t_2.map_type = __pyx_v_map_type;\n  __pyx_t_2.power = 1.;\n  __pyx_t_2.weight = Py_None;\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst__map(__pyx_v_ifst, &__pyx_t_2)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4057, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = ((struct __pyx_obj_9pywrapfst__Fst *)__pyx_t_1);\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":4034\n * \n * \n * cpdef _Fst statemap(_Fst ifst, map_type):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   state_map(ifst, map_type)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.statemap\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XGIVEREF((PyObject *)__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_55statemap(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic char __pyx_doc_9pywrapfst_54statemap[] = \"\\n  state_map(ifst, map_type)\\n\\n  Constructively applies a transform to all states.\\n\\n  This operation transforms each state according to the requested map type.\\n  Note that currently, only one state-mapping operation is supported.\\n\\n  Args:\\n    ifst: The input FST.\\n    map_type: A string matching a known mapping operation; one of: \\\"arc_sum\\\"\\n        (sum weights of identically-labeled multi-arcs), \\\"arc_unique\\\" (deletes\\n        non-unique identically-labeled multi-arcs).\\n\\n  Returns:\\n    An FST with states remapped.\\n\\n  Raises:\\n    FstArgError: Unknown map type.\\n\\n  See also: `arcmap`.\\n  \";\nstatic PyObject *__pyx_pw_9pywrapfst_55statemap(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst = 0;\n  PyObject *__pyx_v_map_type = 0;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"statemap (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_ifst,&__pyx_n_s_map_type,0};\n    PyObject* values[2] = {0,0};\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (likely((values[0] = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_ifst)) != 0)) kw_args--;\n        else goto __pyx_L5_argtuple_error;\n        CYTHON_FALLTHROUGH;\n        case  1:\n        if (likely((values[1] = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_map_type)) != 0)) kw_args--;\n        else {\n          __Pyx_RaiseArgtupleInvalid(\"statemap\", 1, 2, 2, 1); __PYX_ERR(0, 4034, __pyx_L3_error)\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"statemap\") < 0)) __PYX_ERR(0, 4034, __pyx_L3_error)\n      }\n    } else if (PyTuple_GET_SIZE(__pyx_args) != 2) {\n      goto __pyx_L5_argtuple_error;\n    } else {\n      values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n      values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n    }\n    __pyx_v_ifst = ((struct __pyx_obj_9pywrapfst__Fst *)values[0]);\n    __pyx_v_map_type = values[1];\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"statemap\", 1, 2, 2, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 4034, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst.statemap\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_ifst), __pyx_ptype_9pywrapfst__Fst, 1, \"ifst\", 0))) __PYX_ERR(0, 4034, __pyx_L1_error)\n  __pyx_r = __pyx_pf_9pywrapfst_54statemap(__pyx_self, __pyx_v_ifst, __pyx_v_map_type);\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_54statemap(CYTHON_UNUSED PyObject *__pyx_self, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst, PyObject *__pyx_v_map_type) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"statemap\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst_statemap(__pyx_v_ifst, __pyx_v_map_type, 0)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4034, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.statemap\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":4060\n * \n * \n * cpdef _MutableFst synchronize(_Fst ifst):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   synchronize(ifst)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_57synchronize(PyObject *__pyx_self, PyObject *__pyx_v_ifst); /*proto*/\nstatic struct __pyx_obj_9pywrapfst__MutableFst *__pyx_f_9pywrapfst_synchronize(struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst, CYTHON_UNUSED int __pyx_skip_dispatch) {\n  std::unique_ptr<fst::script::VectorFstClass>  __pyx_v_tfst;\n  struct __pyx_obj_9pywrapfst__MutableFst *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"synchronize\", 0);\n\n  /* \"pywrapfst.pyx\":4080\n *   \"\"\"\n *   cdef unique_ptr[fst.VectorFstClass] tfst\n *   tfst.reset(new fst.VectorFstClass(ifst.arc_type()))             # <<<<<<<<<<<<<<\n *   fst.Synchronize(deref(ifst._fst), tfst.get())\n *   return _init_MutableFst(tfst.release())\n */\n  if (unlikely(((PyObject *)__pyx_v_ifst) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"arc_type\");\n    __PYX_ERR(0, 4080, __pyx_L1_error)\n  }\n  __pyx_v_tfst.reset(new fst::script::VectorFstClass(((struct __pyx_vtabstruct_9pywrapfst__Fst *)__pyx_v_ifst->__pyx_vtab)->arc_type(__pyx_v_ifst, 0)));\n\n  /* \"pywrapfst.pyx\":4081\n *   cdef unique_ptr[fst.VectorFstClass] tfst\n *   tfst.reset(new fst.VectorFstClass(ifst.arc_type()))\n *   fst.Synchronize(deref(ifst._fst), tfst.get())             # <<<<<<<<<<<<<<\n *   return _init_MutableFst(tfst.release())\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_ifst) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 4081, __pyx_L1_error)\n  }\n  fst::script::Synchronize((*__pyx_v_ifst->_fst), __pyx_v_tfst.get());\n\n  /* \"pywrapfst.pyx\":4082\n *   tfst.reset(new fst.VectorFstClass(ifst.arc_type()))\n *   fst.Synchronize(deref(ifst._fst), tfst.get())\n *   return _init_MutableFst(tfst.release())             # <<<<<<<<<<<<<<\n * \n * \n */\n  __Pyx_XDECREF(((PyObject *)__pyx_r));\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst__init_MutableFst(__pyx_v_tfst.release())); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4082, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = ((struct __pyx_obj_9pywrapfst__MutableFst *)__pyx_t_1);\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":4060\n * \n * \n * cpdef _MutableFst synchronize(_Fst ifst):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   synchronize(ifst)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.synchronize\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XGIVEREF((PyObject *)__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_57synchronize(PyObject *__pyx_self, PyObject *__pyx_v_ifst); /*proto*/\nstatic char __pyx_doc_9pywrapfst_56synchronize[] = \"\\n  synchronize(ifst)\\n\\n  Constructively synchronizes an FST.\\n\\n  This operation synchronizes a transducer. The result will be an equivalent\\n  FST that has the property that during the traversal of a path, the delay is\\n  either zero or strictly increasing, where the delay is the difference between\\n  the number of non-epsilon output labels and input labels along the path. For\\n  the algorithm to terminate, the input transducer must have bounded delay,\\n  i.e., the delay of every cycle must be zero.\\n\\n  Args:\\n    ifst: The input FST.\\n\\n  Returns:\\n    An equivalent synchronized FST.\\n  \";\nstatic PyObject *__pyx_pw_9pywrapfst_57synchronize(PyObject *__pyx_self, PyObject *__pyx_v_ifst) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"synchronize (wrapper)\", 0);\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_ifst), __pyx_ptype_9pywrapfst__Fst, 1, \"ifst\", 0))) __PYX_ERR(0, 4060, __pyx_L1_error)\n  __pyx_r = __pyx_pf_9pywrapfst_56synchronize(__pyx_self, ((struct __pyx_obj_9pywrapfst__Fst *)__pyx_v_ifst));\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_56synchronize(CYTHON_UNUSED PyObject *__pyx_self, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"synchronize\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst_synchronize(__pyx_v_ifst, 0)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4060, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.synchronize\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":4139\n *   \"\"\"\n * \n *   def __cinit__(self,             # <<<<<<<<<<<<<<\n *                 string fst_type=b\"vector\",\n *                 string arc_type=b\"standard\",\n */\n\n/* Python wrapper */\nstatic int __pyx_pw_9pywrapfst_8Compiler_1__cinit__(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic int __pyx_pw_9pywrapfst_8Compiler_1__cinit__(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  std::string __pyx_v_fst_type;\n  std::string __pyx_v_arc_type;\n  struct __pyx_obj_9pywrapfst_SymbolTable *__pyx_v_isymbols = 0;\n  struct __pyx_obj_9pywrapfst_SymbolTable *__pyx_v_osymbols = 0;\n  struct __pyx_obj_9pywrapfst_SymbolTable *__pyx_v_ssymbols = 0;\n  bool __pyx_v_acceptor;\n  bool __pyx_v_keep_isymbols;\n  bool __pyx_v_keep_osymbols;\n  bool __pyx_v_keep_state_numbering;\n  bool __pyx_v_allow_negative_labels;\n  int __pyx_r;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__cinit__ (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_fst_type,&__pyx_n_s_arc_type,&__pyx_n_s_isymbols,&__pyx_n_s_osymbols,&__pyx_n_s_ssymbols,&__pyx_n_s_acceptor,&__pyx_n_s_keep_isymbols,&__pyx_n_s_keep_osymbols,&__pyx_n_s_keep_state_numbering,&__pyx_n_s_allow_negative_labels,0};\n    PyObject* values[10] = {0,0,0,0,0,0,0,0,0,0};\n\n    /* \"pywrapfst.pyx\":4142\n *                 string fst_type=b\"vector\",\n *                 string arc_type=b\"standard\",\n *                 SymbolTable isymbols=None,             # <<<<<<<<<<<<<<\n *                 SymbolTable osymbols=None,\n *                 SymbolTable ssymbols=None,\n */\n    values[2] = (PyObject *)((struct __pyx_obj_9pywrapfst_SymbolTable *)Py_None);\n\n    /* \"pywrapfst.pyx\":4143\n *                 string arc_type=b\"standard\",\n *                 SymbolTable isymbols=None,\n *                 SymbolTable osymbols=None,             # <<<<<<<<<<<<<<\n *                 SymbolTable ssymbols=None,\n *                 bool acceptor=False,\n */\n    values[3] = (PyObject *)((struct __pyx_obj_9pywrapfst_SymbolTable *)Py_None);\n\n    /* \"pywrapfst.pyx\":4144\n *                 SymbolTable isymbols=None,\n *                 SymbolTable osymbols=None,\n *                 SymbolTable ssymbols=None,             # <<<<<<<<<<<<<<\n *                 bool acceptor=False,\n *                 bool keep_isymbols=False,\n */\n    values[4] = (PyObject *)((struct __pyx_obj_9pywrapfst_SymbolTable *)Py_None);\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case 10: values[9] = PyTuple_GET_ITEM(__pyx_args, 9);\n        CYTHON_FALLTHROUGH;\n        case  9: values[8] = PyTuple_GET_ITEM(__pyx_args, 8);\n        CYTHON_FALLTHROUGH;\n        case  8: values[7] = PyTuple_GET_ITEM(__pyx_args, 7);\n        CYTHON_FALLTHROUGH;\n        case  7: values[6] = PyTuple_GET_ITEM(__pyx_args, 6);\n        CYTHON_FALLTHROUGH;\n        case  6: values[5] = PyTuple_GET_ITEM(__pyx_args, 5);\n        CYTHON_FALLTHROUGH;\n        case  5: values[4] = PyTuple_GET_ITEM(__pyx_args, 4);\n        CYTHON_FALLTHROUGH;\n        case  4: values[3] = PyTuple_GET_ITEM(__pyx_args, 3);\n        CYTHON_FALLTHROUGH;\n        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);\n        CYTHON_FALLTHROUGH;\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_fst_type);\n          if (value) { values[0] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  1:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_arc_type);\n          if (value) { values[1] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  2:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_isymbols);\n          if (value) { values[2] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  3:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_osymbols);\n          if (value) { values[3] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  4:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_ssymbols);\n          if (value) { values[4] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  5:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_acceptor);\n          if (value) { values[5] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  6:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_keep_isymbols);\n          if (value) { values[6] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  7:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_keep_osymbols);\n          if (value) { values[7] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  8:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_keep_state_numbering);\n          if (value) { values[8] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  9:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_allow_negative_labels);\n          if (value) { values[9] = value; kw_args--; }\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"__cinit__\") < 0)) __PYX_ERR(0, 4139, __pyx_L3_error)\n      }\n    } else {\n      switch (PyTuple_GET_SIZE(__pyx_args)) {\n        case 10: values[9] = PyTuple_GET_ITEM(__pyx_args, 9);\n        CYTHON_FALLTHROUGH;\n        case  9: values[8] = PyTuple_GET_ITEM(__pyx_args, 8);\n        CYTHON_FALLTHROUGH;\n        case  8: values[7] = PyTuple_GET_ITEM(__pyx_args, 7);\n        CYTHON_FALLTHROUGH;\n        case  7: values[6] = PyTuple_GET_ITEM(__pyx_args, 6);\n        CYTHON_FALLTHROUGH;\n        case  6: values[5] = PyTuple_GET_ITEM(__pyx_args, 5);\n        CYTHON_FALLTHROUGH;\n        case  5: values[4] = PyTuple_GET_ITEM(__pyx_args, 4);\n        CYTHON_FALLTHROUGH;\n        case  4: values[3] = PyTuple_GET_ITEM(__pyx_args, 3);\n        CYTHON_FALLTHROUGH;\n        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);\n        CYTHON_FALLTHROUGH;\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n    }\n    if (values[0]) {\n      __pyx_v_fst_type = __pyx_convert_string_from_py_std__in_string(values[0]); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 4140, __pyx_L3_error)\n    } else {\n      __pyx_v_fst_type = __pyx_k__88;\n    }\n    if (values[1]) {\n      __pyx_v_arc_type = __pyx_convert_string_from_py_std__in_string(values[1]); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 4141, __pyx_L3_error)\n    } else {\n      __pyx_v_arc_type = __pyx_k__89;\n    }\n    __pyx_v_isymbols = ((struct __pyx_obj_9pywrapfst_SymbolTable *)values[2]);\n    __pyx_v_osymbols = ((struct __pyx_obj_9pywrapfst_SymbolTable *)values[3]);\n    __pyx_v_ssymbols = ((struct __pyx_obj_9pywrapfst_SymbolTable *)values[4]);\n    if (values[5]) {\n      __pyx_v_acceptor = __Pyx_PyObject_IsTrue(values[5]); if (unlikely((__pyx_v_acceptor == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 4145, __pyx_L3_error)\n    } else {\n\n      /* \"pywrapfst.pyx\":4145\n *                 SymbolTable osymbols=None,\n *                 SymbolTable ssymbols=None,\n *                 bool acceptor=False,             # <<<<<<<<<<<<<<\n *                 bool keep_isymbols=False,\n *                 bool keep_osymbols=False,\n */\n      __pyx_v_acceptor = ((bool)0);\n    }\n    if (values[6]) {\n      __pyx_v_keep_isymbols = __Pyx_PyObject_IsTrue(values[6]); if (unlikely((__pyx_v_keep_isymbols == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 4146, __pyx_L3_error)\n    } else {\n\n      /* \"pywrapfst.pyx\":4146\n *                 SymbolTable ssymbols=None,\n *                 bool acceptor=False,\n *                 bool keep_isymbols=False,             # <<<<<<<<<<<<<<\n *                 bool keep_osymbols=False,\n *                 bool keep_state_numbering=False,\n */\n      __pyx_v_keep_isymbols = ((bool)0);\n    }\n    if (values[7]) {\n      __pyx_v_keep_osymbols = __Pyx_PyObject_IsTrue(values[7]); if (unlikely((__pyx_v_keep_osymbols == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 4147, __pyx_L3_error)\n    } else {\n\n      /* \"pywrapfst.pyx\":4147\n *                 bool acceptor=False,\n *                 bool keep_isymbols=False,\n *                 bool keep_osymbols=False,             # <<<<<<<<<<<<<<\n *                 bool keep_state_numbering=False,\n *                 bool allow_negative_labels=False):\n */\n      __pyx_v_keep_osymbols = ((bool)0);\n    }\n    if (values[8]) {\n      __pyx_v_keep_state_numbering = __Pyx_PyObject_IsTrue(values[8]); if (unlikely((__pyx_v_keep_state_numbering == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 4148, __pyx_L3_error)\n    } else {\n\n      /* \"pywrapfst.pyx\":4148\n *                 bool keep_isymbols=False,\n *                 bool keep_osymbols=False,\n *                 bool keep_state_numbering=False,             # <<<<<<<<<<<<<<\n *                 bool allow_negative_labels=False):\n *     self._sstrm.reset(new stringstream())\n */\n      __pyx_v_keep_state_numbering = ((bool)0);\n    }\n    if (values[9]) {\n      __pyx_v_allow_negative_labels = __Pyx_PyObject_IsTrue(values[9]); if (unlikely((__pyx_v_allow_negative_labels == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 4149, __pyx_L3_error)\n    } else {\n\n      /* \"pywrapfst.pyx\":4149\n *                 bool keep_osymbols=False,\n *                 bool keep_state_numbering=False,\n *                 bool allow_negative_labels=False):             # <<<<<<<<<<<<<<\n *     self._sstrm.reset(new stringstream())\n *     self._fst_type = tostring(fst_type)\n */\n      __pyx_v_allow_negative_labels = ((bool)0);\n    }\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"__cinit__\", 0, 0, 10, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 4139, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst.Compiler.__cinit__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return -1;\n  __pyx_L4_argument_unpacking_done:;\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_isymbols), __pyx_ptype_9pywrapfst_SymbolTable, 1, \"isymbols\", 0))) __PYX_ERR(0, 4142, __pyx_L1_error)\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_osymbols), __pyx_ptype_9pywrapfst_SymbolTable, 1, \"osymbols\", 0))) __PYX_ERR(0, 4143, __pyx_L1_error)\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_ssymbols), __pyx_ptype_9pywrapfst_SymbolTable, 1, \"ssymbols\", 0))) __PYX_ERR(0, 4144, __pyx_L1_error)\n  __pyx_r = __pyx_pf_9pywrapfst_8Compiler___cinit__(((struct __pyx_obj_9pywrapfst_Compiler *)__pyx_v_self), __pyx_v_fst_type, __pyx_v_arc_type, __pyx_v_isymbols, __pyx_v_osymbols, __pyx_v_ssymbols, __pyx_v_acceptor, __pyx_v_keep_isymbols, __pyx_v_keep_osymbols, __pyx_v_keep_state_numbering, __pyx_v_allow_negative_labels);\n\n  /* \"pywrapfst.pyx\":4139\n *   \"\"\"\n * \n *   def __cinit__(self,             # <<<<<<<<<<<<<<\n *                 string fst_type=b\"vector\",\n *                 string arc_type=b\"standard\",\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __pyx_r = -1;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic int __pyx_pf_9pywrapfst_8Compiler___cinit__(struct __pyx_obj_9pywrapfst_Compiler *__pyx_v_self, std::string __pyx_v_fst_type, std::string __pyx_v_arc_type, struct __pyx_obj_9pywrapfst_SymbolTable *__pyx_v_isymbols, struct __pyx_obj_9pywrapfst_SymbolTable *__pyx_v_osymbols, struct __pyx_obj_9pywrapfst_SymbolTable *__pyx_v_ssymbols, bool __pyx_v_acceptor, bool __pyx_v_keep_isymbols, bool __pyx_v_keep_osymbols, bool __pyx_v_keep_state_numbering, bool __pyx_v_allow_negative_labels) {\n  int __pyx_r;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  std::string __pyx_t_2;\n  int __pyx_t_3;\n  int __pyx_t_4;\n  fst::SymbolTable *__pyx_t_5;\n  __Pyx_RefNannySetupContext(\"__cinit__\", 0);\n\n  /* \"pywrapfst.pyx\":4150\n *                 bool keep_state_numbering=False,\n *                 bool allow_negative_labels=False):\n *     self._sstrm.reset(new stringstream())             # <<<<<<<<<<<<<<\n *     self._fst_type = tostring(fst_type)\n *     self._arc_type = tostring(arc_type)\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_sstrm\");\n    __PYX_ERR(0, 4150, __pyx_L1_error)\n  }\n  __pyx_v_self->_sstrm.reset(new std::stringstream());\n\n  /* \"pywrapfst.pyx\":4151\n *                 bool allow_negative_labels=False):\n *     self._sstrm.reset(new stringstream())\n *     self._fst_type = tostring(fst_type)             # <<<<<<<<<<<<<<\n *     self._arc_type = tostring(arc_type)\n *     self._isymbols = NULL\n */\n  __pyx_t_1 = __pyx_convert_PyBytes_string_to_py_std__in_string(__pyx_v_fst_type); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4151, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_t_2 = __pyx_f_9pywrapfst_tostring(__pyx_t_1, NULL); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 4151, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst_type\");\n    __PYX_ERR(0, 4151, __pyx_L1_error)\n  }\n  __pyx_v_self->_fst_type = __pyx_t_2;\n\n  /* \"pywrapfst.pyx\":4152\n *     self._sstrm.reset(new stringstream())\n *     self._fst_type = tostring(fst_type)\n *     self._arc_type = tostring(arc_type)             # <<<<<<<<<<<<<<\n *     self._isymbols = NULL\n *     if isymbols is not None:\n */\n  __pyx_t_1 = __pyx_convert_PyBytes_string_to_py_std__in_string(__pyx_v_arc_type); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4152, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_t_2 = __pyx_f_9pywrapfst_tostring(__pyx_t_1, NULL); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 4152, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_arc_type\");\n    __PYX_ERR(0, 4152, __pyx_L1_error)\n  }\n  __pyx_v_self->_arc_type = __pyx_t_2;\n\n  /* \"pywrapfst.pyx\":4153\n *     self._fst_type = tostring(fst_type)\n *     self._arc_type = tostring(arc_type)\n *     self._isymbols = NULL             # <<<<<<<<<<<<<<\n *     if isymbols is not None:\n *       self._isymbols = isymbols._table\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_isymbols\");\n    __PYX_ERR(0, 4153, __pyx_L1_error)\n  }\n  __pyx_v_self->_isymbols = NULL;\n\n  /* \"pywrapfst.pyx\":4154\n *     self._arc_type = tostring(arc_type)\n *     self._isymbols = NULL\n *     if isymbols is not None:             # <<<<<<<<<<<<<<\n *       self._isymbols = isymbols._table\n *     self._osymbols = NULL\n */\n  __pyx_t_3 = (((PyObject *)__pyx_v_isymbols) != Py_None);\n  __pyx_t_4 = (__pyx_t_3 != 0);\n  if (__pyx_t_4) {\n\n    /* \"pywrapfst.pyx\":4155\n *     self._isymbols = NULL\n *     if isymbols is not None:\n *       self._isymbols = isymbols._table             # <<<<<<<<<<<<<<\n *     self._osymbols = NULL\n *     if osymbols is not None:\n */\n    if (unlikely(((PyObject *)__pyx_v_isymbols) == Py_None)) {\n      PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_table\");\n      __PYX_ERR(0, 4155, __pyx_L1_error)\n    }\n    __pyx_t_5 = __pyx_v_isymbols->__pyx_base.__pyx_base._table;\n    if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n      PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_isymbols\");\n      __PYX_ERR(0, 4155, __pyx_L1_error)\n    }\n    __pyx_v_self->_isymbols = __pyx_t_5;\n\n    /* \"pywrapfst.pyx\":4154\n *     self._arc_type = tostring(arc_type)\n *     self._isymbols = NULL\n *     if isymbols is not None:             # <<<<<<<<<<<<<<\n *       self._isymbols = isymbols._table\n *     self._osymbols = NULL\n */\n  }\n\n  /* \"pywrapfst.pyx\":4156\n *     if isymbols is not None:\n *       self._isymbols = isymbols._table\n *     self._osymbols = NULL             # <<<<<<<<<<<<<<\n *     if osymbols is not None:\n *       self._osymbols = osymbols._table\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_osymbols\");\n    __PYX_ERR(0, 4156, __pyx_L1_error)\n  }\n  __pyx_v_self->_osymbols = NULL;\n\n  /* \"pywrapfst.pyx\":4157\n *       self._isymbols = isymbols._table\n *     self._osymbols = NULL\n *     if osymbols is not None:             # <<<<<<<<<<<<<<\n *       self._osymbols = osymbols._table\n *     self._ssymbols = NULL\n */\n  __pyx_t_4 = (((PyObject *)__pyx_v_osymbols) != Py_None);\n  __pyx_t_3 = (__pyx_t_4 != 0);\n  if (__pyx_t_3) {\n\n    /* \"pywrapfst.pyx\":4158\n *     self._osymbols = NULL\n *     if osymbols is not None:\n *       self._osymbols = osymbols._table             # <<<<<<<<<<<<<<\n *     self._ssymbols = NULL\n *     if ssymbols is not None:\n */\n    if (unlikely(((PyObject *)__pyx_v_osymbols) == Py_None)) {\n      PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_table\");\n      __PYX_ERR(0, 4158, __pyx_L1_error)\n    }\n    __pyx_t_5 = __pyx_v_osymbols->__pyx_base.__pyx_base._table;\n    if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n      PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_osymbols\");\n      __PYX_ERR(0, 4158, __pyx_L1_error)\n    }\n    __pyx_v_self->_osymbols = __pyx_t_5;\n\n    /* \"pywrapfst.pyx\":4157\n *       self._isymbols = isymbols._table\n *     self._osymbols = NULL\n *     if osymbols is not None:             # <<<<<<<<<<<<<<\n *       self._osymbols = osymbols._table\n *     self._ssymbols = NULL\n */\n  }\n\n  /* \"pywrapfst.pyx\":4159\n *     if osymbols is not None:\n *       self._osymbols = osymbols._table\n *     self._ssymbols = NULL             # <<<<<<<<<<<<<<\n *     if ssymbols is not None:\n *       self._ssymbols = ssymbols._table\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_ssymbols\");\n    __PYX_ERR(0, 4159, __pyx_L1_error)\n  }\n  __pyx_v_self->_ssymbols = NULL;\n\n  /* \"pywrapfst.pyx\":4160\n *       self._osymbols = osymbols._table\n *     self._ssymbols = NULL\n *     if ssymbols is not None:             # <<<<<<<<<<<<<<\n *       self._ssymbols = ssymbols._table\n *     self._acceptor = acceptor\n */\n  __pyx_t_3 = (((PyObject *)__pyx_v_ssymbols) != Py_None);\n  __pyx_t_4 = (__pyx_t_3 != 0);\n  if (__pyx_t_4) {\n\n    /* \"pywrapfst.pyx\":4161\n *     self._ssymbols = NULL\n *     if ssymbols is not None:\n *       self._ssymbols = ssymbols._table             # <<<<<<<<<<<<<<\n *     self._acceptor = acceptor\n *     self._keep_isymbols = keep_isymbols\n */\n    if (unlikely(((PyObject *)__pyx_v_ssymbols) == Py_None)) {\n      PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_table\");\n      __PYX_ERR(0, 4161, __pyx_L1_error)\n    }\n    __pyx_t_5 = __pyx_v_ssymbols->__pyx_base.__pyx_base._table;\n    if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n      PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_ssymbols\");\n      __PYX_ERR(0, 4161, __pyx_L1_error)\n    }\n    __pyx_v_self->_ssymbols = __pyx_t_5;\n\n    /* \"pywrapfst.pyx\":4160\n *       self._osymbols = osymbols._table\n *     self._ssymbols = NULL\n *     if ssymbols is not None:             # <<<<<<<<<<<<<<\n *       self._ssymbols = ssymbols._table\n *     self._acceptor = acceptor\n */\n  }\n\n  /* \"pywrapfst.pyx\":4162\n *     if ssymbols is not None:\n *       self._ssymbols = ssymbols._table\n *     self._acceptor = acceptor             # <<<<<<<<<<<<<<\n *     self._keep_isymbols = keep_isymbols\n *     self._keep_osymbols = keep_osymbols\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_acceptor\");\n    __PYX_ERR(0, 4162, __pyx_L1_error)\n  }\n  __pyx_v_self->_acceptor = __pyx_v_acceptor;\n\n  /* \"pywrapfst.pyx\":4163\n *       self._ssymbols = ssymbols._table\n *     self._acceptor = acceptor\n *     self._keep_isymbols = keep_isymbols             # <<<<<<<<<<<<<<\n *     self._keep_osymbols = keep_osymbols\n *     self._keep_state_numbering = keep_state_numbering\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_keep_isymbols\");\n    __PYX_ERR(0, 4163, __pyx_L1_error)\n  }\n  __pyx_v_self->_keep_isymbols = __pyx_v_keep_isymbols;\n\n  /* \"pywrapfst.pyx\":4164\n *     self._acceptor = acceptor\n *     self._keep_isymbols = keep_isymbols\n *     self._keep_osymbols = keep_osymbols             # <<<<<<<<<<<<<<\n *     self._keep_state_numbering = keep_state_numbering\n *     self._allow_negative_labels = allow_negative_labels\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_keep_osymbols\");\n    __PYX_ERR(0, 4164, __pyx_L1_error)\n  }\n  __pyx_v_self->_keep_osymbols = __pyx_v_keep_osymbols;\n\n  /* \"pywrapfst.pyx\":4165\n *     self._keep_isymbols = keep_isymbols\n *     self._keep_osymbols = keep_osymbols\n *     self._keep_state_numbering = keep_state_numbering             # <<<<<<<<<<<<<<\n *     self._allow_negative_labels = allow_negative_labels\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_keep_state_numbering\");\n    __PYX_ERR(0, 4165, __pyx_L1_error)\n  }\n  __pyx_v_self->_keep_state_numbering = __pyx_v_keep_state_numbering;\n\n  /* \"pywrapfst.pyx\":4166\n *     self._keep_osymbols = keep_osymbols\n *     self._keep_state_numbering = keep_state_numbering\n *     self._allow_negative_labels = allow_negative_labels             # <<<<<<<<<<<<<<\n * \n *   cpdef _Fst compile(self):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_allow_negative_labels\");\n    __PYX_ERR(0, 4166, __pyx_L1_error)\n  }\n  __pyx_v_self->_allow_negative_labels = __pyx_v_allow_negative_labels;\n\n  /* \"pywrapfst.pyx\":4139\n *   \"\"\"\n * \n *   def __cinit__(self,             # <<<<<<<<<<<<<<\n *                 string fst_type=b\"vector\",\n *                 string arc_type=b\"standard\",\n */\n\n  /* function exit code */\n  __pyx_r = 0;\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.Compiler.__cinit__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = -1;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":4168\n *     self._allow_negative_labels = allow_negative_labels\n * \n *   cpdef _Fst compile(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     compile()\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_8Compiler_3compile(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic struct __pyx_obj_9pywrapfst__Fst *__pyx_f_9pywrapfst_8Compiler_compile(struct __pyx_obj_9pywrapfst_Compiler *__pyx_v_self, int __pyx_skip_dispatch) {\n  std::unique_ptr<fst::script::FstClass>  __pyx_v_tfst;\n  struct __pyx_obj_9pywrapfst__Fst *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  int __pyx_t_5;\n  __Pyx_RefNannySetupContext(\"compile\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_compile); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4168, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_8Compiler_3compile)) {\n      __Pyx_XDECREF(((PyObject *)__pyx_r));\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 4168, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 4168, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      if (!(likely(((__pyx_t_2) == Py_None) || likely(__Pyx_TypeTest(__pyx_t_2, __pyx_ptype_9pywrapfst__Fst))))) __PYX_ERR(0, 4168, __pyx_L1_error)\n      __pyx_r = ((struct __pyx_obj_9pywrapfst__Fst *)__pyx_t_2);\n      __pyx_t_2 = 0;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":4183\n *     \"\"\"\n *     cdef unique_ptr[fst.FstClass] tfst\n *     tfst.reset(fst.CompileFstInternal(deref(self._sstrm),             # <<<<<<<<<<<<<<\n *         b\"<pywrapfst>\", self._fst_type, self._arc_type, self._isymbols,\n *         self._osymbols, self._ssymbols, self._acceptor, self._keep_isymbols,\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_sstrm\");\n    __PYX_ERR(0, 4183, __pyx_L1_error)\n  }\n\n  /* \"pywrapfst.pyx\":4184\n *     cdef unique_ptr[fst.FstClass] tfst\n *     tfst.reset(fst.CompileFstInternal(deref(self._sstrm),\n *         b\"<pywrapfst>\", self._fst_type, self._arc_type, self._isymbols,             # <<<<<<<<<<<<<<\n *         self._osymbols, self._ssymbols, self._acceptor, self._keep_isymbols,\n *         self._keep_osymbols, self._keep_state_numbering,\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst_type\");\n    __PYX_ERR(0, 4184, __pyx_L1_error)\n  }\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_arc_type\");\n    __PYX_ERR(0, 4184, __pyx_L1_error)\n  }\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_isymbols\");\n    __PYX_ERR(0, 4184, __pyx_L1_error)\n  }\n\n  /* \"pywrapfst.pyx\":4185\n *     tfst.reset(fst.CompileFstInternal(deref(self._sstrm),\n *         b\"<pywrapfst>\", self._fst_type, self._arc_type, self._isymbols,\n *         self._osymbols, self._ssymbols, self._acceptor, self._keep_isymbols,             # <<<<<<<<<<<<<<\n *         self._keep_osymbols, self._keep_state_numbering,\n *         self._allow_negative_labels))\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_osymbols\");\n    __PYX_ERR(0, 4185, __pyx_L1_error)\n  }\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_ssymbols\");\n    __PYX_ERR(0, 4185, __pyx_L1_error)\n  }\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_acceptor\");\n    __PYX_ERR(0, 4185, __pyx_L1_error)\n  }\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_keep_isymbols\");\n    __PYX_ERR(0, 4185, __pyx_L1_error)\n  }\n\n  /* \"pywrapfst.pyx\":4186\n *         b\"<pywrapfst>\", self._fst_type, self._arc_type, self._isymbols,\n *         self._osymbols, self._ssymbols, self._acceptor, self._keep_isymbols,\n *         self._keep_osymbols, self._keep_state_numbering,             # <<<<<<<<<<<<<<\n *         self._allow_negative_labels))\n *     self._sstrm.reset(new stringstream())\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_keep_osymbols\");\n    __PYX_ERR(0, 4186, __pyx_L1_error)\n  }\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_keep_state_numbering\");\n    __PYX_ERR(0, 4186, __pyx_L1_error)\n  }\n\n  /* \"pywrapfst.pyx\":4187\n *         self._osymbols, self._ssymbols, self._acceptor, self._keep_isymbols,\n *         self._keep_osymbols, self._keep_state_numbering,\n *         self._allow_negative_labels))             # <<<<<<<<<<<<<<\n *     self._sstrm.reset(new stringstream())\n *     if tfst.get() == NULL:\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_allow_negative_labels\");\n    __PYX_ERR(0, 4187, __pyx_L1_error)\n  }\n\n  /* \"pywrapfst.pyx\":4183\n *     \"\"\"\n *     cdef unique_ptr[fst.FstClass] tfst\n *     tfst.reset(fst.CompileFstInternal(deref(self._sstrm),             # <<<<<<<<<<<<<<\n *         b\"<pywrapfst>\", self._fst_type, self._arc_type, self._isymbols,\n *         self._osymbols, self._ssymbols, self._acceptor, self._keep_isymbols,\n */\n  __pyx_v_tfst.reset(fst::script::CompileFstInternal((*__pyx_v_self->_sstrm), __pyx_k_pywrapfst, __pyx_v_self->_fst_type, __pyx_v_self->_arc_type, __pyx_v_self->_isymbols, __pyx_v_self->_osymbols, __pyx_v_self->_ssymbols, __pyx_v_self->_acceptor, __pyx_v_self->_keep_isymbols, __pyx_v_self->_keep_osymbols, __pyx_v_self->_keep_state_numbering, __pyx_v_self->_allow_negative_labels));\n\n  /* \"pywrapfst.pyx\":4188\n *         self._keep_osymbols, self._keep_state_numbering,\n *         self._allow_negative_labels))\n *     self._sstrm.reset(new stringstream())             # <<<<<<<<<<<<<<\n *     if tfst.get() == NULL:\n *       raise FstOpError(\"Compilation failed\")\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_sstrm\");\n    __PYX_ERR(0, 4188, __pyx_L1_error)\n  }\n  __pyx_v_self->_sstrm.reset(new std::stringstream());\n\n  /* \"pywrapfst.pyx\":4189\n *         self._allow_negative_labels))\n *     self._sstrm.reset(new stringstream())\n *     if tfst.get() == NULL:             # <<<<<<<<<<<<<<\n *       raise FstOpError(\"Compilation failed\")\n *     return _init_XFst(tfst.release())\n */\n  __pyx_t_5 = ((__pyx_v_tfst.get() == NULL) != 0);\n  if (unlikely(__pyx_t_5)) {\n\n    /* \"pywrapfst.pyx\":4190\n *     self._sstrm.reset(new stringstream())\n *     if tfst.get() == NULL:\n *       raise FstOpError(\"Compilation failed\")             # <<<<<<<<<<<<<<\n *     return _init_XFst(tfst.release())\n * \n */\n    __pyx_t_1 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstOpError); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4190, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    __pyx_t_2 = __Pyx_PyObject_Call(__pyx_t_1, __pyx_tuple__90, NULL); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 4190, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_2);\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n    __Pyx_Raise(__pyx_t_2, 0, 0, 0);\n    __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n    __PYX_ERR(0, 4190, __pyx_L1_error)\n\n    /* \"pywrapfst.pyx\":4189\n *         self._allow_negative_labels))\n *     self._sstrm.reset(new stringstream())\n *     if tfst.get() == NULL:             # <<<<<<<<<<<<<<\n *       raise FstOpError(\"Compilation failed\")\n *     return _init_XFst(tfst.release())\n */\n  }\n\n  /* \"pywrapfst.pyx\":4191\n *     if tfst.get() == NULL:\n *       raise FstOpError(\"Compilation failed\")\n *     return _init_XFst(tfst.release())             # <<<<<<<<<<<<<<\n * \n *   cpdef void write(self, expression):\n */\n  __Pyx_XDECREF(((PyObject *)__pyx_r));\n  __pyx_t_2 = ((PyObject *)__pyx_f_9pywrapfst__init_XFst(__pyx_v_tfst.release())); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 4191, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  __pyx_r = ((struct __pyx_obj_9pywrapfst__Fst *)__pyx_t_2);\n  __pyx_t_2 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":4168\n *     self._allow_negative_labels = allow_negative_labels\n * \n *   cpdef _Fst compile(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     compile()\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_AddTraceback(\"pywrapfst.Compiler.compile\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XGIVEREF((PyObject *)__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_8Compiler_3compile(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_8Compiler_2compile[] = \"\\n    compile()\\n\\n    Compiles the FST in the compiler string buffer.\\n\\n    This method compiles the FST and returns the resulting machine.\\n\\n    Returns:\\n      The FST described by the compiler string buffer.\\n\\n    Raises:\\n      FstOpError: Compilation failed.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_8Compiler_3compile(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"compile (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_8Compiler_2compile(((struct __pyx_obj_9pywrapfst_Compiler *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_8Compiler_2compile(struct __pyx_obj_9pywrapfst_Compiler *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"compile\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst_8Compiler_compile(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4168, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.Compiler.compile\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":4193\n *     return _init_XFst(tfst.release())\n * \n *   cpdef void write(self, expression):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     write(expression)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_8Compiler_5write(PyObject *__pyx_v_self, PyObject *__pyx_v_expression); /*proto*/\nstatic void __pyx_f_9pywrapfst_8Compiler_write(struct __pyx_obj_9pywrapfst_Compiler *__pyx_v_self, PyObject *__pyx_v_expression, int __pyx_skip_dispatch) {\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  std::string __pyx_t_6;\n  __Pyx_RefNannySetupContext(\"write\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_write); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4193, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_8Compiler_5write)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (!__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_v_expression); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 4193, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_2);\n      } else {\n        #if CYTHON_FAST_PYCALL\n        if (PyFunction_Check(__pyx_t_3)) {\n          PyObject *__pyx_temp[2] = {__pyx_t_4, __pyx_v_expression};\n          __pyx_t_2 = __Pyx_PyFunction_FastCall(__pyx_t_3, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 4193, __pyx_L1_error)\n          __Pyx_XDECREF(__pyx_t_4); __pyx_t_4 = 0;\n          __Pyx_GOTREF(__pyx_t_2);\n        } else\n        #endif\n        #if CYTHON_FAST_PYCCALL\n        if (__Pyx_PyFastCFunction_Check(__pyx_t_3)) {\n          PyObject *__pyx_temp[2] = {__pyx_t_4, __pyx_v_expression};\n          __pyx_t_2 = __Pyx_PyCFunction_FastCall(__pyx_t_3, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 4193, __pyx_L1_error)\n          __Pyx_XDECREF(__pyx_t_4); __pyx_t_4 = 0;\n          __Pyx_GOTREF(__pyx_t_2);\n        } else\n        #endif\n        {\n          __pyx_t_5 = PyTuple_New(1+1); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 4193, __pyx_L1_error)\n          __Pyx_GOTREF(__pyx_t_5);\n          __Pyx_GIVEREF(__pyx_t_4); PyTuple_SET_ITEM(__pyx_t_5, 0, __pyx_t_4); __pyx_t_4 = NULL;\n          __Pyx_INCREF(__pyx_v_expression);\n          __Pyx_GIVEREF(__pyx_v_expression);\n          PyTuple_SET_ITEM(__pyx_t_5, 0+1, __pyx_v_expression);\n          __pyx_t_2 = __Pyx_PyObject_Call(__pyx_t_3, __pyx_t_5, NULL); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 4193, __pyx_L1_error)\n          __Pyx_GOTREF(__pyx_t_2);\n          __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n        }\n      }\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":4209\n *       expression: A string expression to add to compiler string buffer.\n *     \"\"\"\n *     deref(self._sstrm) << tostring(expression)             # <<<<<<<<<<<<<<\n * \n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_sstrm\");\n    __PYX_ERR(0, 4209, __pyx_L1_error)\n  }\n  __pyx_t_6 = __pyx_f_9pywrapfst_tostring(__pyx_v_expression, NULL); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 4209, __pyx_L1_error)\n  (void)(((*__pyx_v_self->_sstrm) << __pyx_t_6));\n\n  /* \"pywrapfst.pyx\":4193\n *     return _init_XFst(tfst.release())\n * \n *   cpdef void write(self, expression):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     write(expression)\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_WriteUnraisable(\"pywrapfst.Compiler.write\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_8Compiler_5write(PyObject *__pyx_v_self, PyObject *__pyx_v_expression); /*proto*/\nstatic char __pyx_doc_9pywrapfst_8Compiler_4write[] = \"\\n    write(expression)\\n\\n    Writes a string into the compiler string buffer.\\n\\n    This method adds a line to the compiler string buffer. It is normally\\n    invoked using the right shift operator, like so:\\n\\n        compiler = fst.Compiler()\\n        print >> compiler, \\\"0 0 49 49\\\"\\n        print >> compiler, \\\"0\\\"\\n\\n    Args:\\n      expression: A string expression to add to compiler string buffer.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_8Compiler_5write(PyObject *__pyx_v_self, PyObject *__pyx_v_expression) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"write (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_8Compiler_4write(((struct __pyx_obj_9pywrapfst_Compiler *)__pyx_v_self), ((PyObject *)__pyx_v_expression));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_8Compiler_4write(struct __pyx_obj_9pywrapfst_Compiler *__pyx_v_self, PyObject *__pyx_v_expression) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"write\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __Pyx_void_to_None(__pyx_f_9pywrapfst_8Compiler_write(__pyx_v_self, __pyx_v_expression, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4193, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.Compiler.write\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"(tree fragment)\":1\n * def __reduce_cython__(self):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"no default __reduce__ due to non-trivial __cinit__\")\n * def __setstate_cython__(self, __pyx_state):\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_8Compiler_7__reduce_cython__(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_8Compiler_7__reduce_cython__(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__reduce_cython__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_8Compiler_6__reduce_cython__(((struct __pyx_obj_9pywrapfst_Compiler *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_8Compiler_6__reduce_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst_Compiler *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"__reduce_cython__\", 0);\n\n  /* \"(tree fragment)\":2\n * def __reduce_cython__(self):\n *     raise TypeError(\"no default __reduce__ due to non-trivial __cinit__\")             # <<<<<<<<<<<<<<\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"no default __reduce__ due to non-trivial __cinit__\")\n */\n  __pyx_t_1 = __Pyx_PyObject_Call(__pyx_builtin_TypeError, __pyx_tuple__91, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(1, 2, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __Pyx_Raise(__pyx_t_1, 0, 0, 0);\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  __PYX_ERR(1, 2, __pyx_L1_error)\n\n  /* \"(tree fragment)\":1\n * def __reduce_cython__(self):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"no default __reduce__ due to non-trivial __cinit__\")\n * def __setstate_cython__(self, __pyx_state):\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.Compiler.__reduce_cython__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"(tree fragment)\":3\n * def __reduce_cython__(self):\n *     raise TypeError(\"no default __reduce__ due to non-trivial __cinit__\")\n * def __setstate_cython__(self, __pyx_state):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"no default __reduce__ due to non-trivial __cinit__\")\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_8Compiler_9__setstate_cython__(PyObject *__pyx_v_self, PyObject *__pyx_v___pyx_state); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_8Compiler_9__setstate_cython__(PyObject *__pyx_v_self, PyObject *__pyx_v___pyx_state) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__setstate_cython__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_8Compiler_8__setstate_cython__(((struct __pyx_obj_9pywrapfst_Compiler *)__pyx_v_self), ((PyObject *)__pyx_v___pyx_state));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_8Compiler_8__setstate_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst_Compiler *__pyx_v_self, CYTHON_UNUSED PyObject *__pyx_v___pyx_state) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"__setstate_cython__\", 0);\n\n  /* \"(tree fragment)\":4\n *     raise TypeError(\"no default __reduce__ due to non-trivial __cinit__\")\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"no default __reduce__ due to non-trivial __cinit__\")             # <<<<<<<<<<<<<<\n */\n  __pyx_t_1 = __Pyx_PyObject_Call(__pyx_builtin_TypeError, __pyx_tuple__92, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(1, 4, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __Pyx_Raise(__pyx_t_1, 0, 0, 0);\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  __PYX_ERR(1, 4, __pyx_L1_error)\n\n  /* \"(tree fragment)\":3\n * def __reduce_cython__(self):\n *     raise TypeError(\"no default __reduce__ due to non-trivial __cinit__\")\n * def __setstate_cython__(self, __pyx_state):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"no default __reduce__ due to non-trivial __cinit__\")\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.Compiler.__setstate_cython__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":4231\n *   \"\"\"\n * \n *   def __init__(self):             # <<<<<<<<<<<<<<\n *     raise FstDeletedConstructorError(\n *         \"Cannot construct {}\".format(self.__class__.__name__))\n */\n\n/* Python wrapper */\nstatic int __pyx_pw_9pywrapfst_9FarReader_1__init__(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic int __pyx_pw_9pywrapfst_9FarReader_1__init__(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  int __pyx_r;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__init__ (wrapper)\", 0);\n  if (unlikely(PyTuple_GET_SIZE(__pyx_args) > 0)) {\n    __Pyx_RaiseArgtupleInvalid(\"__init__\", 1, 0, 0, PyTuple_GET_SIZE(__pyx_args)); return -1;}\n  if (unlikely(__pyx_kwds) && unlikely(PyDict_Size(__pyx_kwds) > 0) && unlikely(!__Pyx_CheckKeywordStrings(__pyx_kwds, \"__init__\", 0))) return -1;\n  __pyx_r = __pyx_pf_9pywrapfst_9FarReader___init__(((struct __pyx_obj_9pywrapfst_FarReader *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic int __pyx_pf_9pywrapfst_9FarReader___init__(struct __pyx_obj_9pywrapfst_FarReader *__pyx_v_self) {\n  int __pyx_r;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  PyObject *__pyx_t_6 = NULL;\n  PyObject *__pyx_t_7 = NULL;\n  __Pyx_RefNannySetupContext(\"__init__\", 0);\n\n  /* \"pywrapfst.pyx\":4232\n * \n *   def __init__(self):\n *     raise FstDeletedConstructorError(             # <<<<<<<<<<<<<<\n *         \"Cannot construct {}\".format(self.__class__.__name__))\n * \n */\n  __pyx_t_2 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstDeletedConstructorError); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 4232, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n\n  /* \"pywrapfst.pyx\":4233\n *   def __init__(self):\n *     raise FstDeletedConstructorError(\n *         \"Cannot construct {}\".format(self.__class__.__name__))             # <<<<<<<<<<<<<<\n * \n *   def __repr__(self):\n */\n  __pyx_t_4 = __Pyx_PyObject_GetAttrStr(__pyx_kp_s_Cannot_construct, __pyx_n_s_format); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 4233, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_4);\n  __pyx_t_5 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_class); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 4233, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_5);\n  __pyx_t_6 = __Pyx_PyObject_GetAttrStr(__pyx_t_5, __pyx_n_s_name); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 4233, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_6);\n  __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n  __pyx_t_5 = NULL;\n  if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_4))) {\n    __pyx_t_5 = PyMethod_GET_SELF(__pyx_t_4);\n    if (likely(__pyx_t_5)) {\n      PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_4);\n      __Pyx_INCREF(__pyx_t_5);\n      __Pyx_INCREF(function);\n      __Pyx_DECREF_SET(__pyx_t_4, function);\n    }\n  }\n  if (!__pyx_t_5) {\n    __pyx_t_3 = __Pyx_PyObject_CallOneArg(__pyx_t_4, __pyx_t_6); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 4233, __pyx_L1_error)\n    __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n    __Pyx_GOTREF(__pyx_t_3);\n  } else {\n    #if CYTHON_FAST_PYCALL\n    if (PyFunction_Check(__pyx_t_4)) {\n      PyObject *__pyx_temp[2] = {__pyx_t_5, __pyx_t_6};\n      __pyx_t_3 = __Pyx_PyFunction_FastCall(__pyx_t_4, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 4233, __pyx_L1_error)\n      __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;\n      __Pyx_GOTREF(__pyx_t_3);\n      __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n    } else\n    #endif\n    #if CYTHON_FAST_PYCCALL\n    if (__Pyx_PyFastCFunction_Check(__pyx_t_4)) {\n      PyObject *__pyx_temp[2] = {__pyx_t_5, __pyx_t_6};\n      __pyx_t_3 = __Pyx_PyCFunction_FastCall(__pyx_t_4, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 4233, __pyx_L1_error)\n      __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;\n      __Pyx_GOTREF(__pyx_t_3);\n      __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n    } else\n    #endif\n    {\n      __pyx_t_7 = PyTuple_New(1+1); if (unlikely(!__pyx_t_7)) __PYX_ERR(0, 4233, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_7);\n      __Pyx_GIVEREF(__pyx_t_5); PyTuple_SET_ITEM(__pyx_t_7, 0, __pyx_t_5); __pyx_t_5 = NULL;\n      __Pyx_GIVEREF(__pyx_t_6);\n      PyTuple_SET_ITEM(__pyx_t_7, 0+1, __pyx_t_6);\n      __pyx_t_6 = 0;\n      __pyx_t_3 = __Pyx_PyObject_Call(__pyx_t_4, __pyx_t_7, NULL); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 4233, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_3);\n      __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0;\n    }\n  }\n  __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n  __pyx_t_4 = NULL;\n  if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_2))) {\n    __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_2);\n    if (likely(__pyx_t_4)) {\n      PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_2);\n      __Pyx_INCREF(__pyx_t_4);\n      __Pyx_INCREF(function);\n      __Pyx_DECREF_SET(__pyx_t_2, function);\n    }\n  }\n  if (!__pyx_t_4) {\n    __pyx_t_1 = __Pyx_PyObject_CallOneArg(__pyx_t_2, __pyx_t_3); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4232, __pyx_L1_error)\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    __Pyx_GOTREF(__pyx_t_1);\n  } else {\n    #if CYTHON_FAST_PYCALL\n    if (PyFunction_Check(__pyx_t_2)) {\n      PyObject *__pyx_temp[2] = {__pyx_t_4, __pyx_t_3};\n      __pyx_t_1 = __Pyx_PyFunction_FastCall(__pyx_t_2, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4232, __pyx_L1_error)\n      __Pyx_XDECREF(__pyx_t_4); __pyx_t_4 = 0;\n      __Pyx_GOTREF(__pyx_t_1);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    } else\n    #endif\n    #if CYTHON_FAST_PYCCALL\n    if (__Pyx_PyFastCFunction_Check(__pyx_t_2)) {\n      PyObject *__pyx_temp[2] = {__pyx_t_4, __pyx_t_3};\n      __pyx_t_1 = __Pyx_PyCFunction_FastCall(__pyx_t_2, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4232, __pyx_L1_error)\n      __Pyx_XDECREF(__pyx_t_4); __pyx_t_4 = 0;\n      __Pyx_GOTREF(__pyx_t_1);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    } else\n    #endif\n    {\n      __pyx_t_7 = PyTuple_New(1+1); if (unlikely(!__pyx_t_7)) __PYX_ERR(0, 4232, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_7);\n      __Pyx_GIVEREF(__pyx_t_4); PyTuple_SET_ITEM(__pyx_t_7, 0, __pyx_t_4); __pyx_t_4 = NULL;\n      __Pyx_GIVEREF(__pyx_t_3);\n      PyTuple_SET_ITEM(__pyx_t_7, 0+1, __pyx_t_3);\n      __pyx_t_3 = 0;\n      __pyx_t_1 = __Pyx_PyObject_Call(__pyx_t_2, __pyx_t_7, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4232, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_1);\n      __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0;\n    }\n  }\n  __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n  __Pyx_Raise(__pyx_t_1, 0, 0, 0);\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  __PYX_ERR(0, 4232, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":4231\n *   \"\"\"\n * \n *   def __init__(self):             # <<<<<<<<<<<<<<\n *     raise FstDeletedConstructorError(\n *         \"Cannot construct {}\".format(self.__class__.__name__))\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_XDECREF(__pyx_t_6);\n  __Pyx_XDECREF(__pyx_t_7);\n  __Pyx_AddTraceback(\"pywrapfst.FarReader.__init__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = -1;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":4235\n *         \"Cannot construct {}\".format(self.__class__.__name__))\n * \n *   def __repr__(self):             # <<<<<<<<<<<<<<\n *     return \"<{} FarReader at 0x{:x}>\".format(self.far_type(), id(self))\n * \n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_9FarReader_3__repr__(PyObject *__pyx_v_self); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_9FarReader_3__repr__(PyObject *__pyx_v_self) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__repr__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_9FarReader_2__repr__(((struct __pyx_obj_9pywrapfst_FarReader *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_9FarReader_2__repr__(struct __pyx_obj_9pywrapfst_FarReader *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  int __pyx_t_6;\n  PyObject *__pyx_t_7 = NULL;\n  __Pyx_RefNannySetupContext(\"__repr__\", 0);\n\n  /* \"pywrapfst.pyx\":4236\n * \n *   def __repr__(self):\n *     return \"<{} FarReader at 0x{:x}>\".format(self.far_type(), id(self))             # <<<<<<<<<<<<<<\n * \n *   @classmethod\n */\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_2 = __Pyx_PyObject_GetAttrStr(__pyx_kp_s_FarReader_at_0x_x, __pyx_n_s_format); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 4236, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"far_type\");\n    __PYX_ERR(0, 4236, __pyx_L1_error)\n  }\n  __pyx_t_3 = __pyx_convert_PyBytes_string_to_py_std__in_string(((struct __pyx_vtabstruct_9pywrapfst_FarReader *)__pyx_v_self->__pyx_vtab)->far_type(__pyx_v_self, 0)); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 4236, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_3);\n  __pyx_t_4 = __Pyx_PyObject_CallOneArg(__pyx_builtin_id, ((PyObject *)__pyx_v_self)); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 4236, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_4);\n  __pyx_t_5 = NULL;\n  __pyx_t_6 = 0;\n  if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_2))) {\n    __pyx_t_5 = PyMethod_GET_SELF(__pyx_t_2);\n    if (likely(__pyx_t_5)) {\n      PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_2);\n      __Pyx_INCREF(__pyx_t_5);\n      __Pyx_INCREF(function);\n      __Pyx_DECREF_SET(__pyx_t_2, function);\n      __pyx_t_6 = 1;\n    }\n  }\n  #if CYTHON_FAST_PYCALL\n  if (PyFunction_Check(__pyx_t_2)) {\n    PyObject *__pyx_temp[3] = {__pyx_t_5, __pyx_t_3, __pyx_t_4};\n    __pyx_t_1 = __Pyx_PyFunction_FastCall(__pyx_t_2, __pyx_temp+1-__pyx_t_6, 2+__pyx_t_6); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4236, __pyx_L1_error)\n    __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;\n    __Pyx_GOTREF(__pyx_t_1);\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n  } else\n  #endif\n  #if CYTHON_FAST_PYCCALL\n  if (__Pyx_PyFastCFunction_Check(__pyx_t_2)) {\n    PyObject *__pyx_temp[3] = {__pyx_t_5, __pyx_t_3, __pyx_t_4};\n    __pyx_t_1 = __Pyx_PyCFunction_FastCall(__pyx_t_2, __pyx_temp+1-__pyx_t_6, 2+__pyx_t_6); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4236, __pyx_L1_error)\n    __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;\n    __Pyx_GOTREF(__pyx_t_1);\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n  } else\n  #endif\n  {\n    __pyx_t_7 = PyTuple_New(2+__pyx_t_6); if (unlikely(!__pyx_t_7)) __PYX_ERR(0, 4236, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_7);\n    if (__pyx_t_5) {\n      __Pyx_GIVEREF(__pyx_t_5); PyTuple_SET_ITEM(__pyx_t_7, 0, __pyx_t_5); __pyx_t_5 = NULL;\n    }\n    __Pyx_GIVEREF(__pyx_t_3);\n    PyTuple_SET_ITEM(__pyx_t_7, 0+__pyx_t_6, __pyx_t_3);\n    __Pyx_GIVEREF(__pyx_t_4);\n    PyTuple_SET_ITEM(__pyx_t_7, 1+__pyx_t_6, __pyx_t_4);\n    __pyx_t_3 = 0;\n    __pyx_t_4 = 0;\n    __pyx_t_1 = __Pyx_PyObject_Call(__pyx_t_2, __pyx_t_7, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4236, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0;\n  }\n  __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":4235\n *         \"Cannot construct {}\".format(self.__class__.__name__))\n * \n *   def __repr__(self):             # <<<<<<<<<<<<<<\n *     return \"<{} FarReader at 0x{:x}>\".format(self.far_type(), id(self))\n * \n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_XDECREF(__pyx_t_7);\n  __Pyx_AddTraceback(\"pywrapfst.FarReader.__repr__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":4239\n * \n *   @classmethod\n *   def open(cls, *filenames):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     FarReader.open(*filenames)\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_9FarReader_5open(PyObject *__pyx_v_cls, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic char __pyx_doc_9pywrapfst_9FarReader_4open[] = \"\\n    FarReader.open(*filenames)\\n\\n    Creates a FarReader object.\\n\\n    This class method creates a FarReader given the string location of one or\\n    more FAR files on disk.\\n\\n    Args:\\n      *filenames: The string location of one or more input FAR files.\\n\\n    Returns:\\n      A new FarReader instance.\\n\\n    Raises:\\n      FstIOError: Read failed.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_9FarReader_5open(PyObject *__pyx_v_cls, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  PyObject *__pyx_v_filenames = 0;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"open (wrapper)\", 0);\n  if (unlikely(__pyx_kwds) && unlikely(PyDict_Size(__pyx_kwds) > 0) && unlikely(!__Pyx_CheckKeywordStrings(__pyx_kwds, \"open\", 0))) return NULL;\n  __Pyx_INCREF(__pyx_args);\n  __pyx_v_filenames = __pyx_args;\n  __pyx_r = __pyx_pf_9pywrapfst_9FarReader_4open(((PyTypeObject*)__pyx_v_cls), __pyx_v_filenames);\n\n  /* function exit code */\n  __Pyx_XDECREF(__pyx_v_filenames);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_9FarReader_4open(CYTHON_UNUSED PyTypeObject *__pyx_v_cls, PyObject *__pyx_v_filenames) {\n  std::unique_ptr<fst::script::FarReaderClass>  __pyx_v_tfar;\n  struct __pyx_obj_9pywrapfst_FarReader *__pyx_v_result = 0;\n  PyObject *__pyx_v_filename = NULL;\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  Py_ssize_t __pyx_t_3;\n  PyObject *__pyx_t_4 = NULL;\n  std::string __pyx_t_5;\n  std::vector<std::string>  __pyx_t_6;\n  int __pyx_t_7;\n  PyObject *__pyx_t_8 = NULL;\n  PyObject *__pyx_t_9 = NULL;\n  PyObject *__pyx_t_10 = NULL;\n  __Pyx_RefNannySetupContext(\"open\", 0);\n  __Pyx_INCREF(__pyx_v_filenames);\n\n  /* \"pywrapfst.pyx\":4257\n *       FstIOError: Read failed.\n *     \"\"\"\n *     filenames = [tostring(filename) for filename in filenames]             # <<<<<<<<<<<<<<\n *     cdef unique_ptr[fst.FarReaderClass] tfar\n *     tfar.reset(fst.FarReaderClass.Open(filenames))\n */\n  __pyx_t_1 = PyList_New(0); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4257, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_t_2 = __pyx_v_filenames; __Pyx_INCREF(__pyx_t_2); __pyx_t_3 = 0;\n  for (;;) {\n    if (__pyx_t_3 >= PyTuple_GET_SIZE(__pyx_t_2)) break;\n    #if CYTHON_ASSUME_SAFE_MACROS && !CYTHON_AVOID_BORROWED_REFS\n    __pyx_t_4 = PyTuple_GET_ITEM(__pyx_t_2, __pyx_t_3); __Pyx_INCREF(__pyx_t_4); __pyx_t_3++; if (unlikely(0 < 0)) __PYX_ERR(0, 4257, __pyx_L1_error)\n    #else\n    __pyx_t_4 = PySequence_ITEM(__pyx_t_2, __pyx_t_3); __pyx_t_3++; if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 4257, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_4);\n    #endif\n    __Pyx_XDECREF_SET(__pyx_v_filename, __pyx_t_4);\n    __pyx_t_4 = 0;\n    __pyx_t_5 = __pyx_f_9pywrapfst_tostring(__pyx_v_filename, NULL); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 4257, __pyx_L1_error)\n    __pyx_t_4 = __pyx_convert_PyBytes_string_to_py_std__in_string(__pyx_t_5); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 4257, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_4);\n    if (unlikely(__Pyx_ListComp_Append(__pyx_t_1, (PyObject*)__pyx_t_4))) __PYX_ERR(0, 4257, __pyx_L1_error)\n    __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n  }\n  __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n  __Pyx_DECREF_SET(__pyx_v_filenames, __pyx_t_1);\n  __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":4259\n *     filenames = [tostring(filename) for filename in filenames]\n *     cdef unique_ptr[fst.FarReaderClass] tfar\n *     tfar.reset(fst.FarReaderClass.Open(filenames))             # <<<<<<<<<<<<<<\n *     if tfar.get() == NULL:\n *       raise FstIOError(\"Read failed: {!r}\".format(filenames))\n */\n  __pyx_t_6 = __pyx_convert_vector_from_py_std_3a__3a_string(__pyx_v_filenames); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 4259, __pyx_L1_error)\n  __pyx_v_tfar.reset(fst::script::FarReaderClass::Open(__pyx_t_6));\n\n  /* \"pywrapfst.pyx\":4260\n *     cdef unique_ptr[fst.FarReaderClass] tfar\n *     tfar.reset(fst.FarReaderClass.Open(filenames))\n *     if tfar.get() == NULL:             # <<<<<<<<<<<<<<\n *       raise FstIOError(\"Read failed: {!r}\".format(filenames))\n *     cdef FarReader result = FarReader.__new__(FarReader)\n */\n  __pyx_t_7 = ((__pyx_v_tfar.get() == NULL) != 0);\n  if (unlikely(__pyx_t_7)) {\n\n    /* \"pywrapfst.pyx\":4261\n *     tfar.reset(fst.FarReaderClass.Open(filenames))\n *     if tfar.get() == NULL:\n *       raise FstIOError(\"Read failed: {!r}\".format(filenames))             # <<<<<<<<<<<<<<\n *     cdef FarReader result = FarReader.__new__(FarReader)\n *     result._reader.reset(tfar.release())\n */\n    __pyx_t_2 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstIOError); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 4261, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_2);\n    __pyx_t_8 = __Pyx_PyObject_GetAttrStr(__pyx_kp_s_Read_failed_r, __pyx_n_s_format); if (unlikely(!__pyx_t_8)) __PYX_ERR(0, 4261, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_8);\n    __pyx_t_9 = NULL;\n    if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_8))) {\n      __pyx_t_9 = PyMethod_GET_SELF(__pyx_t_8);\n      if (likely(__pyx_t_9)) {\n        PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_8);\n        __Pyx_INCREF(__pyx_t_9);\n        __Pyx_INCREF(function);\n        __Pyx_DECREF_SET(__pyx_t_8, function);\n      }\n    }\n    if (!__pyx_t_9) {\n      __pyx_t_4 = __Pyx_PyObject_CallOneArg(__pyx_t_8, __pyx_v_filenames); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 4261, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_4);\n    } else {\n      #if CYTHON_FAST_PYCALL\n      if (PyFunction_Check(__pyx_t_8)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_9, __pyx_v_filenames};\n        __pyx_t_4 = __Pyx_PyFunction_FastCall(__pyx_t_8, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 4261, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_9); __pyx_t_9 = 0;\n        __Pyx_GOTREF(__pyx_t_4);\n      } else\n      #endif\n      #if CYTHON_FAST_PYCCALL\n      if (__Pyx_PyFastCFunction_Check(__pyx_t_8)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_9, __pyx_v_filenames};\n        __pyx_t_4 = __Pyx_PyCFunction_FastCall(__pyx_t_8, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 4261, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_9); __pyx_t_9 = 0;\n        __Pyx_GOTREF(__pyx_t_4);\n      } else\n      #endif\n      {\n        __pyx_t_10 = PyTuple_New(1+1); if (unlikely(!__pyx_t_10)) __PYX_ERR(0, 4261, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_10);\n        __Pyx_GIVEREF(__pyx_t_9); PyTuple_SET_ITEM(__pyx_t_10, 0, __pyx_t_9); __pyx_t_9 = NULL;\n        __Pyx_INCREF(__pyx_v_filenames);\n        __Pyx_GIVEREF(__pyx_v_filenames);\n        PyTuple_SET_ITEM(__pyx_t_10, 0+1, __pyx_v_filenames);\n        __pyx_t_4 = __Pyx_PyObject_Call(__pyx_t_8, __pyx_t_10, NULL); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 4261, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_4);\n        __Pyx_DECREF(__pyx_t_10); __pyx_t_10 = 0;\n      }\n    }\n    __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0;\n    __pyx_t_8 = NULL;\n    if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_2))) {\n      __pyx_t_8 = PyMethod_GET_SELF(__pyx_t_2);\n      if (likely(__pyx_t_8)) {\n        PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_2);\n        __Pyx_INCREF(__pyx_t_8);\n        __Pyx_INCREF(function);\n        __Pyx_DECREF_SET(__pyx_t_2, function);\n      }\n    }\n    if (!__pyx_t_8) {\n      __pyx_t_1 = __Pyx_PyObject_CallOneArg(__pyx_t_2, __pyx_t_4); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4261, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      __Pyx_GOTREF(__pyx_t_1);\n    } else {\n      #if CYTHON_FAST_PYCALL\n      if (PyFunction_Check(__pyx_t_2)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_8, __pyx_t_4};\n        __pyx_t_1 = __Pyx_PyFunction_FastCall(__pyx_t_2, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4261, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_8); __pyx_t_8 = 0;\n        __Pyx_GOTREF(__pyx_t_1);\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else\n      #endif\n      #if CYTHON_FAST_PYCCALL\n      if (__Pyx_PyFastCFunction_Check(__pyx_t_2)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_8, __pyx_t_4};\n        __pyx_t_1 = __Pyx_PyCFunction_FastCall(__pyx_t_2, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4261, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_8); __pyx_t_8 = 0;\n        __Pyx_GOTREF(__pyx_t_1);\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else\n      #endif\n      {\n        __pyx_t_10 = PyTuple_New(1+1); if (unlikely(!__pyx_t_10)) __PYX_ERR(0, 4261, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_10);\n        __Pyx_GIVEREF(__pyx_t_8); PyTuple_SET_ITEM(__pyx_t_10, 0, __pyx_t_8); __pyx_t_8 = NULL;\n        __Pyx_GIVEREF(__pyx_t_4);\n        PyTuple_SET_ITEM(__pyx_t_10, 0+1, __pyx_t_4);\n        __pyx_t_4 = 0;\n        __pyx_t_1 = __Pyx_PyObject_Call(__pyx_t_2, __pyx_t_10, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4261, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_1);\n        __Pyx_DECREF(__pyx_t_10); __pyx_t_10 = 0;\n      }\n    }\n    __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n    __Pyx_Raise(__pyx_t_1, 0, 0, 0);\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n    __PYX_ERR(0, 4261, __pyx_L1_error)\n\n    /* \"pywrapfst.pyx\":4260\n *     cdef unique_ptr[fst.FarReaderClass] tfar\n *     tfar.reset(fst.FarReaderClass.Open(filenames))\n *     if tfar.get() == NULL:             # <<<<<<<<<<<<<<\n *       raise FstIOError(\"Read failed: {!r}\".format(filenames))\n *     cdef FarReader result = FarReader.__new__(FarReader)\n */\n  }\n\n  /* \"pywrapfst.pyx\":4262\n *     if tfar.get() == NULL:\n *       raise FstIOError(\"Read failed: {!r}\".format(filenames))\n *     cdef FarReader result = FarReader.__new__(FarReader)             # <<<<<<<<<<<<<<\n *     result._reader.reset(tfar.release())\n *     return result\n */\n  __pyx_t_1 = ((PyObject *)__pyx_tp_new_9pywrapfst_FarReader(((PyTypeObject *)__pyx_ptype_9pywrapfst_FarReader), __pyx_empty_tuple, NULL)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4262, __pyx_L1_error)\n  __Pyx_GOTREF(((PyObject *)__pyx_t_1));\n  __pyx_v_result = ((struct __pyx_obj_9pywrapfst_FarReader *)__pyx_t_1);\n  __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":4263\n *       raise FstIOError(\"Read failed: {!r}\".format(filenames))\n *     cdef FarReader result = FarReader.__new__(FarReader)\n *     result._reader.reset(tfar.release())             # <<<<<<<<<<<<<<\n *     return result\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_result) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_reader\");\n    __PYX_ERR(0, 4263, __pyx_L1_error)\n  }\n  __pyx_v_result->_reader.reset(__pyx_v_tfar.release());\n\n  /* \"pywrapfst.pyx\":4264\n *     cdef FarReader result = FarReader.__new__(FarReader)\n *     result._reader.reset(tfar.release())\n *     return result             # <<<<<<<<<<<<<<\n * \n *   cpdef string arc_type(self):\n */\n  __Pyx_XDECREF(__pyx_r);\n  __Pyx_INCREF(((PyObject *)__pyx_v_result));\n  __pyx_r = ((PyObject *)__pyx_v_result);\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":4239\n * \n *   @classmethod\n *   def open(cls, *filenames):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     FarReader.open(*filenames)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_8);\n  __Pyx_XDECREF(__pyx_t_9);\n  __Pyx_XDECREF(__pyx_t_10);\n  __Pyx_AddTraceback(\"pywrapfst.FarReader.open\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XDECREF(__pyx_v_filenames);\n  __Pyx_XDECREF((PyObject *)__pyx_v_result);\n  __Pyx_XDECREF(__pyx_v_filename);\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":4266\n *     return result\n * \n *   cpdef string arc_type(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     arc_type(self)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_9FarReader_7arc_type(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic std::string __pyx_f_9pywrapfst_9FarReader_arc_type(struct __pyx_obj_9pywrapfst_FarReader *__pyx_v_self, int __pyx_skip_dispatch) {\n  std::string __pyx_r;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  std::string __pyx_t_5;\n  __Pyx_RefNannySetupContext(\"arc_type\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_arc_type); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4266, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_9FarReader_7arc_type)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 4266, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 4266, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __pyx_t_5 = __pyx_convert_string_from_py_std__in_string(__pyx_t_2); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 4266, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __pyx_r = __pyx_t_5;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":4272\n *     Returns a string indicating the arc type.\n *     \"\"\"\n *     return self._reader.get().ArcType()             # <<<<<<<<<<<<<<\n * \n *   cpdef bool done(self):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_reader\");\n    __PYX_ERR(0, 4272, __pyx_L1_error)\n  }\n  __pyx_r = __pyx_v_self->_reader.get()->ArcType();\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":4266\n *     return result\n * \n *   cpdef string arc_type(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     arc_type(self)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_WriteUnraisable(\"pywrapfst.FarReader.arc_type\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __Pyx_pretend_to_initialize(&__pyx_r);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_9FarReader_7arc_type(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_9FarReader_6arc_type[] = \"\\n    arc_type(self)\\n\\n    Returns a string indicating the arc type.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_9FarReader_7arc_type(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"arc_type (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_9FarReader_6arc_type(((struct __pyx_obj_9pywrapfst_FarReader *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_9FarReader_6arc_type(struct __pyx_obj_9pywrapfst_FarReader *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"arc_type\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __pyx_convert_PyBytes_string_to_py_std__in_string(__pyx_f_9pywrapfst_9FarReader_arc_type(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4266, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.FarReader.arc_type\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":4274\n *     return self._reader.get().ArcType()\n * \n *   cpdef bool done(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     done(self)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_9FarReader_9done(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic bool __pyx_f_9pywrapfst_9FarReader_done(struct __pyx_obj_9pywrapfst_FarReader *__pyx_v_self, int __pyx_skip_dispatch) {\n  bool __pyx_r;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  bool __pyx_t_5;\n  __Pyx_RefNannySetupContext(\"done\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_done); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4274, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_9FarReader_9done)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 4274, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 4274, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __pyx_t_5 = __Pyx_PyObject_IsTrue(__pyx_t_2); if (unlikely((__pyx_t_5 == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 4274, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __pyx_r = __pyx_t_5;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":4283\n *       True if the iterator is exhausted, False otherwise.\n *     \"\"\"\n *     return self._reader.get().Done()             # <<<<<<<<<<<<<<\n * \n *   cpdef bool error(self):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_reader\");\n    __PYX_ERR(0, 4283, __pyx_L1_error)\n  }\n  __pyx_r = __pyx_v_self->_reader.get()->Done();\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":4274\n *     return self._reader.get().ArcType()\n * \n *   cpdef bool done(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     done(self)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_WriteUnraisable(\"pywrapfst.FarReader.done\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_9FarReader_9done(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_9FarReader_8done[] = \"\\n    done(self)\\n\\n    Indicates whether the iterator is exhausted or not.\\n\\n    Returns:\\n      True if the iterator is exhausted, False otherwise.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_9FarReader_9done(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"done (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_9FarReader_8done(((struct __pyx_obj_9pywrapfst_FarReader *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_9FarReader_8done(struct __pyx_obj_9pywrapfst_FarReader *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"done\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __Pyx_PyBool_FromLong(__pyx_f_9pywrapfst_9FarReader_done(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4274, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.FarReader.done\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":4285\n *     return self._reader.get().Done()\n * \n *   cpdef bool error(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     error(self)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_9FarReader_11error(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic bool __pyx_f_9pywrapfst_9FarReader_error(struct __pyx_obj_9pywrapfst_FarReader *__pyx_v_self, int __pyx_skip_dispatch) {\n  bool __pyx_r;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  bool __pyx_t_5;\n  __Pyx_RefNannySetupContext(\"error\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_error); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4285, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_9FarReader_11error)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 4285, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 4285, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __pyx_t_5 = __Pyx_PyObject_IsTrue(__pyx_t_2); if (unlikely((__pyx_t_5 == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 4285, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __pyx_r = __pyx_t_5;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":4294\n *       True if the FarReader is in an errorful state, False otherwise.\n *     \"\"\"\n *     return self._reader.get().Error()             # <<<<<<<<<<<<<<\n * \n *   cpdef string far_type(self):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_reader\");\n    __PYX_ERR(0, 4294, __pyx_L1_error)\n  }\n  __pyx_r = __pyx_v_self->_reader.get()->Error();\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":4285\n *     return self._reader.get().Done()\n * \n *   cpdef bool error(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     error(self)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_WriteUnraisable(\"pywrapfst.FarReader.error\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_9FarReader_11error(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_9FarReader_10error[] = \"\\n    error(self)\\n\\n    Indicates whether the FarReader has encountered an error.\\n\\n    Returns:\\n      True if the FarReader is in an errorful state, False otherwise.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_9FarReader_11error(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"error (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_9FarReader_10error(((struct __pyx_obj_9pywrapfst_FarReader *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_9FarReader_10error(struct __pyx_obj_9pywrapfst_FarReader *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"error\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __Pyx_PyBool_FromLong(__pyx_f_9pywrapfst_9FarReader_error(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4285, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.FarReader.error\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":4296\n *     return self._reader.get().Error()\n * \n *   cpdef string far_type(self):             # <<<<<<<<<<<<<<\n *     return fst.GetFarTypeString(self._reader.get().Type())\n * \n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_9FarReader_13far_type(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic std::string __pyx_f_9pywrapfst_9FarReader_far_type(struct __pyx_obj_9pywrapfst_FarReader *__pyx_v_self, int __pyx_skip_dispatch) {\n  std::string __pyx_r;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  std::string __pyx_t_5;\n  __Pyx_RefNannySetupContext(\"far_type\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_far_type); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4296, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_9FarReader_13far_type)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 4296, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 4296, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __pyx_t_5 = __pyx_convert_string_from_py_std__in_string(__pyx_t_2); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 4296, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __pyx_r = __pyx_t_5;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":4297\n * \n *   cpdef string far_type(self):\n *     return fst.GetFarTypeString(self._reader.get().Type())             # <<<<<<<<<<<<<<\n * \n *   cpdef bool find(self, key) except *:\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_reader\");\n    __PYX_ERR(0, 4297, __pyx_L1_error)\n  }\n  __pyx_r = fst::GetFarTypeString(__pyx_v_self->_reader.get()->Type());\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":4296\n *     return self._reader.get().Error()\n * \n *   cpdef string far_type(self):             # <<<<<<<<<<<<<<\n *     return fst.GetFarTypeString(self._reader.get().Type())\n * \n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_WriteUnraisable(\"pywrapfst.FarReader.far_type\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __Pyx_pretend_to_initialize(&__pyx_r);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_9FarReader_13far_type(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_9FarReader_13far_type(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"far_type (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_9FarReader_12far_type(((struct __pyx_obj_9pywrapfst_FarReader *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_9FarReader_12far_type(struct __pyx_obj_9pywrapfst_FarReader *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"far_type\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __pyx_convert_PyBytes_string_to_py_std__in_string(__pyx_f_9pywrapfst_9FarReader_far_type(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4296, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.FarReader.far_type\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":4299\n *     return fst.GetFarTypeString(self._reader.get().Type())\n * \n *   cpdef bool find(self, key) except *:             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     find(self, key)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_9FarReader_15find(PyObject *__pyx_v_self, PyObject *__pyx_v_key); /*proto*/\nstatic bool __pyx_f_9pywrapfst_9FarReader_find(struct __pyx_obj_9pywrapfst_FarReader *__pyx_v_self, PyObject *__pyx_v_key, int __pyx_skip_dispatch) {\n  bool __pyx_r;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  bool __pyx_t_6;\n  std::string __pyx_t_7;\n  __Pyx_RefNannySetupContext(\"find\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_find); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4299, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_9FarReader_15find)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (!__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_v_key); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 4299, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_2);\n      } else {\n        #if CYTHON_FAST_PYCALL\n        if (PyFunction_Check(__pyx_t_3)) {\n          PyObject *__pyx_temp[2] = {__pyx_t_4, __pyx_v_key};\n          __pyx_t_2 = __Pyx_PyFunction_FastCall(__pyx_t_3, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 4299, __pyx_L1_error)\n          __Pyx_XDECREF(__pyx_t_4); __pyx_t_4 = 0;\n          __Pyx_GOTREF(__pyx_t_2);\n        } else\n        #endif\n        #if CYTHON_FAST_PYCCALL\n        if (__Pyx_PyFastCFunction_Check(__pyx_t_3)) {\n          PyObject *__pyx_temp[2] = {__pyx_t_4, __pyx_v_key};\n          __pyx_t_2 = __Pyx_PyCFunction_FastCall(__pyx_t_3, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 4299, __pyx_L1_error)\n          __Pyx_XDECREF(__pyx_t_4); __pyx_t_4 = 0;\n          __Pyx_GOTREF(__pyx_t_2);\n        } else\n        #endif\n        {\n          __pyx_t_5 = PyTuple_New(1+1); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 4299, __pyx_L1_error)\n          __Pyx_GOTREF(__pyx_t_5);\n          __Pyx_GIVEREF(__pyx_t_4); PyTuple_SET_ITEM(__pyx_t_5, 0, __pyx_t_4); __pyx_t_4 = NULL;\n          __Pyx_INCREF(__pyx_v_key);\n          __Pyx_GIVEREF(__pyx_v_key);\n          PyTuple_SET_ITEM(__pyx_t_5, 0+1, __pyx_v_key);\n          __pyx_t_2 = __Pyx_PyObject_Call(__pyx_t_3, __pyx_t_5, NULL); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 4299, __pyx_L1_error)\n          __Pyx_GOTREF(__pyx_t_2);\n          __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n        }\n      }\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __pyx_t_6 = __Pyx_PyObject_IsTrue(__pyx_t_2); if (unlikely((__pyx_t_6 == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 4299, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __pyx_r = __pyx_t_6;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":4312\n *       True if the key was found, False otherwise.\n *     \"\"\"\n *     return self._reader.get().Find(tostring(key))             # <<<<<<<<<<<<<<\n * \n *   cpdef _Fst get_fst(self):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_reader\");\n    __PYX_ERR(0, 4312, __pyx_L1_error)\n  }\n  __pyx_t_7 = __pyx_f_9pywrapfst_tostring(__pyx_v_key, NULL); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 4312, __pyx_L1_error)\n  __pyx_r = __pyx_v_self->_reader.get()->Find(__pyx_t_7);\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":4299\n *     return fst.GetFarTypeString(self._reader.get().Type())\n * \n *   cpdef bool find(self, key) except *:             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     find(self, key)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_AddTraceback(\"pywrapfst.FarReader.find\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_9FarReader_15find(PyObject *__pyx_v_self, PyObject *__pyx_v_key); /*proto*/\nstatic char __pyx_doc_9pywrapfst_9FarReader_14find[] = \"\\n    find(self, key)\\n\\n    Sets the current position to the first entry greater than or equal to the\\n    key (a string) and indicates whether or not a match was found.\\n\\n    Args:\\n      key: A string key.\\n\\n    Returns:\\n      True if the key was found, False otherwise.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_9FarReader_15find(PyObject *__pyx_v_self, PyObject *__pyx_v_key) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"find (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_9FarReader_14find(((struct __pyx_obj_9pywrapfst_FarReader *)__pyx_v_self), ((PyObject *)__pyx_v_key));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_9FarReader_14find(struct __pyx_obj_9pywrapfst_FarReader *__pyx_v_self, PyObject *__pyx_v_key) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  bool __pyx_t_1;\n  PyObject *__pyx_t_2 = NULL;\n  __Pyx_RefNannySetupContext(\"find\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __pyx_f_9pywrapfst_9FarReader_find(__pyx_v_self, __pyx_v_key, 1); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 4299, __pyx_L1_error)\n  __pyx_t_2 = __Pyx_PyBool_FromLong(__pyx_t_1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 4299, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  __pyx_r = __pyx_t_2;\n  __pyx_t_2 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_AddTraceback(\"pywrapfst.FarReader.find\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":4314\n *     return self._reader.get().Find(tostring(key))\n * \n *   cpdef _Fst get_fst(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     get_fst(self)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_9FarReader_17get_fst(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic struct __pyx_obj_9pywrapfst__Fst *__pyx_f_9pywrapfst_9FarReader_get_fst(struct __pyx_obj_9pywrapfst_FarReader *__pyx_v_self, int __pyx_skip_dispatch) {\n  struct __pyx_obj_9pywrapfst__Fst *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  __Pyx_RefNannySetupContext(\"get_fst\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_get_fst); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4314, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_9FarReader_17get_fst)) {\n      __Pyx_XDECREF(((PyObject *)__pyx_r));\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 4314, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 4314, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      if (!(likely(((__pyx_t_2) == Py_None) || likely(__Pyx_TypeTest(__pyx_t_2, __pyx_ptype_9pywrapfst__Fst))))) __PYX_ERR(0, 4314, __pyx_L1_error)\n      __pyx_r = ((struct __pyx_obj_9pywrapfst__Fst *)__pyx_t_2);\n      __pyx_t_2 = 0;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":4323\n *       A copy of the FST at the current position.\n *     \"\"\"\n *     return _init_XFst(new fst.FstClass(             # <<<<<<<<<<<<<<\n *         deref(self._reader.get().GetFstClass())))\n * \n */\n  __Pyx_XDECREF(((PyObject *)__pyx_r));\n\n  /* \"pywrapfst.pyx\":4324\n *     \"\"\"\n *     return _init_XFst(new fst.FstClass(\n *         deref(self._reader.get().GetFstClass())))             # <<<<<<<<<<<<<<\n * \n *   cpdef string get_key(self):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_reader\");\n    __PYX_ERR(0, 4324, __pyx_L1_error)\n  }\n\n  /* \"pywrapfst.pyx\":4323\n *       A copy of the FST at the current position.\n *     \"\"\"\n *     return _init_XFst(new fst.FstClass(             # <<<<<<<<<<<<<<\n *         deref(self._reader.get().GetFstClass())))\n * \n */\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst__init_XFst(new fst::script::FstClass((*__pyx_v_self->_reader.get()->GetFstClass())))); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4323, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = ((struct __pyx_obj_9pywrapfst__Fst *)__pyx_t_1);\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":4314\n *     return self._reader.get().Find(tostring(key))\n * \n *   cpdef _Fst get_fst(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     get_fst(self)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_AddTraceback(\"pywrapfst.FarReader.get_fst\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XGIVEREF((PyObject *)__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_9FarReader_17get_fst(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_9FarReader_16get_fst[] = \"\\n    get_fst(self)\\n\\n    Returns the FST at the current position.\\n\\n    Returns:\\n      A copy of the FST at the current position.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_9FarReader_17get_fst(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"get_fst (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_9FarReader_16get_fst(((struct __pyx_obj_9pywrapfst_FarReader *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_9FarReader_16get_fst(struct __pyx_obj_9pywrapfst_FarReader *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"get_fst\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = ((PyObject *)__pyx_f_9pywrapfst_9FarReader_get_fst(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4314, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.FarReader.get_fst\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":4326\n *         deref(self._reader.get().GetFstClass())))\n * \n *   cpdef string get_key(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     get_key(self)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_9FarReader_19get_key(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic std::string __pyx_f_9pywrapfst_9FarReader_get_key(struct __pyx_obj_9pywrapfst_FarReader *__pyx_v_self, int __pyx_skip_dispatch) {\n  std::string __pyx_r;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  std::string __pyx_t_5;\n  __Pyx_RefNannySetupContext(\"get_key\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_get_key); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4326, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_9FarReader_19get_key)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 4326, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 4326, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __pyx_t_5 = __pyx_convert_string_from_py_std__in_string(__pyx_t_2); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 4326, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __pyx_r = __pyx_t_5;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":4335\n *       The string key at the current position.\n *     \"\"\"\n *     return self._reader.get().GetKey()             # <<<<<<<<<<<<<<\n * \n *   cpdef void next(self):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_reader\");\n    __PYX_ERR(0, 4335, __pyx_L1_error)\n  }\n  __pyx_r = __pyx_v_self->_reader.get()->GetKey();\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":4326\n *         deref(self._reader.get().GetFstClass())))\n * \n *   cpdef string get_key(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     get_key(self)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_WriteUnraisable(\"pywrapfst.FarReader.get_key\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __Pyx_pretend_to_initialize(&__pyx_r);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_9FarReader_19get_key(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_9FarReader_18get_key[] = \"\\n    get_key(self)\\n\\n    Returns the string key at the current position.\\n\\n    Returns:\\n      The string key at the current position.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_9FarReader_19get_key(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"get_key (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_9FarReader_18get_key(((struct __pyx_obj_9pywrapfst_FarReader *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_9FarReader_18get_key(struct __pyx_obj_9pywrapfst_FarReader *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"get_key\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __pyx_convert_PyBytes_string_to_py_std__in_string(__pyx_f_9pywrapfst_9FarReader_get_key(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4326, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.FarReader.get_key\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":4337\n *     return self._reader.get().GetKey()\n * \n *   cpdef void next(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     next(self)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_9FarReader_21next(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic void __pyx_f_9pywrapfst_9FarReader_next(struct __pyx_obj_9pywrapfst_FarReader *__pyx_v_self, int __pyx_skip_dispatch) {\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  __Pyx_RefNannySetupContext(\"next\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_next); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4337, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_9FarReader_21next)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 4337, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 4337, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":4343\n *     Advances the iterator.\n *     \"\"\"\n *     self._reader.get().Next()             # <<<<<<<<<<<<<<\n * \n *   cpdef void reset(self):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_reader\");\n    __PYX_ERR(0, 4343, __pyx_L1_error)\n  }\n  __pyx_v_self->_reader.get()->Next();\n\n  /* \"pywrapfst.pyx\":4337\n *     return self._reader.get().GetKey()\n * \n *   cpdef void next(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     next(self)\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_WriteUnraisable(\"pywrapfst.FarReader.next\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_9FarReader_21next(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_9FarReader_20next[] = \"\\n    next(self)\\n\\n    Advances the iterator.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_9FarReader_21next(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"next (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_9FarReader_20next(((struct __pyx_obj_9pywrapfst_FarReader *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_9FarReader_20next(struct __pyx_obj_9pywrapfst_FarReader *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"next\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __Pyx_void_to_None(__pyx_f_9pywrapfst_9FarReader_next(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4337, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.FarReader.next\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":4345\n *     self._reader.get().Next()\n * \n *   cpdef void reset(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     reset(self)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_9FarReader_23reset(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic void __pyx_f_9pywrapfst_9FarReader_reset(struct __pyx_obj_9pywrapfst_FarReader *__pyx_v_self, int __pyx_skip_dispatch) {\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  __Pyx_RefNannySetupContext(\"reset\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_reset); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4345, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_9FarReader_23reset)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 4345, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 4345, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":4351\n *     Resets the iterator to the initial position.\n *     \"\"\"\n *     self._reader.get().Reset()             # <<<<<<<<<<<<<<\n * \n *   def __getitem__(self, key):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_reader\");\n    __PYX_ERR(0, 4351, __pyx_L1_error)\n  }\n  __pyx_v_self->_reader.get()->Reset();\n\n  /* \"pywrapfst.pyx\":4345\n *     self._reader.get().Next()\n * \n *   cpdef void reset(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     reset(self)\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_WriteUnraisable(\"pywrapfst.FarReader.reset\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_9FarReader_23reset(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_9FarReader_22reset[] = \"\\n    reset(self)\\n\\n    Resets the iterator to the initial position.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_9FarReader_23reset(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"reset (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_9FarReader_22reset(((struct __pyx_obj_9pywrapfst_FarReader *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_9FarReader_22reset(struct __pyx_obj_9pywrapfst_FarReader *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"reset\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __Pyx_void_to_None(__pyx_f_9pywrapfst_9FarReader_reset(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4345, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.FarReader.reset\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":4353\n *     self._reader.get().Reset()\n * \n *   def __getitem__(self, key):             # <<<<<<<<<<<<<<\n *     cdef string ckey = tostring(key)\n *     if self.get_key() == ckey or self._reader.get().Find(ckey):\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_9FarReader_25__getitem__(PyObject *__pyx_v_self, PyObject *__pyx_v_key); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_9FarReader_25__getitem__(PyObject *__pyx_v_self, PyObject *__pyx_v_key) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__getitem__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_9FarReader_24__getitem__(((struct __pyx_obj_9pywrapfst_FarReader *)__pyx_v_self), ((PyObject *)__pyx_v_key));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_9FarReader_24__getitem__(struct __pyx_obj_9pywrapfst_FarReader *__pyx_v_self, PyObject *__pyx_v_key) {\n  std::string __pyx_v_ckey;\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  std::string __pyx_t_1;\n  int __pyx_t_2;\n  int __pyx_t_3;\n  PyObject *__pyx_t_4 = NULL;\n  __Pyx_RefNannySetupContext(\"__getitem__\", 0);\n\n  /* \"pywrapfst.pyx\":4354\n * \n *   def __getitem__(self, key):\n *     cdef string ckey = tostring(key)             # <<<<<<<<<<<<<<\n *     if self.get_key() == ckey or self._reader.get().Find(ckey):\n *       return self.get_fst()\n */\n  __pyx_t_1 = __pyx_f_9pywrapfst_tostring(__pyx_v_key, NULL); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 4354, __pyx_L1_error)\n  __pyx_v_ckey = __pyx_t_1;\n\n  /* \"pywrapfst.pyx\":4355\n *   def __getitem__(self, key):\n *     cdef string ckey = tostring(key)\n *     if self.get_key() == ckey or self._reader.get().Find(ckey):             # <<<<<<<<<<<<<<\n *       return self.get_fst()\n *     else:\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"get_key\");\n    __PYX_ERR(0, 4355, __pyx_L1_error)\n  }\n  __pyx_t_3 = ((((struct __pyx_vtabstruct_9pywrapfst_FarReader *)__pyx_v_self->__pyx_vtab)->get_key(__pyx_v_self, 0) == __pyx_v_ckey) != 0);\n  if (!__pyx_t_3) {\n  } else {\n    __pyx_t_2 = __pyx_t_3;\n    goto __pyx_L4_bool_binop_done;\n  }\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_reader\");\n    __PYX_ERR(0, 4355, __pyx_L1_error)\n  }\n  __pyx_t_3 = (__pyx_v_self->_reader.get()->Find(__pyx_v_ckey) != 0);\n  __pyx_t_2 = __pyx_t_3;\n  __pyx_L4_bool_binop_done:;\n  if (likely(__pyx_t_2)) {\n\n    /* \"pywrapfst.pyx\":4356\n *     cdef string ckey = tostring(key)\n *     if self.get_key() == ckey or self._reader.get().Find(ckey):\n *       return self.get_fst()             # <<<<<<<<<<<<<<\n *     else:\n *       raise KeyError(key)\n */\n    __Pyx_XDECREF(__pyx_r);\n    if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n      PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"get_fst\");\n      __PYX_ERR(0, 4356, __pyx_L1_error)\n    }\n    __pyx_t_4 = ((PyObject *)((struct __pyx_vtabstruct_9pywrapfst_FarReader *)__pyx_v_self->__pyx_vtab)->get_fst(__pyx_v_self, 0)); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 4356, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_4);\n    __pyx_r = __pyx_t_4;\n    __pyx_t_4 = 0;\n    goto __pyx_L0;\n\n    /* \"pywrapfst.pyx\":4355\n *   def __getitem__(self, key):\n *     cdef string ckey = tostring(key)\n *     if self.get_key() == ckey or self._reader.get().Find(ckey):             # <<<<<<<<<<<<<<\n *       return self.get_fst()\n *     else:\n */\n  }\n\n  /* \"pywrapfst.pyx\":4358\n *       return self.get_fst()\n *     else:\n *       raise KeyError(key)             # <<<<<<<<<<<<<<\n * \n * \n */\n  /*else*/ {\n    __pyx_t_4 = __Pyx_PyObject_CallOneArg(__pyx_builtin_KeyError, __pyx_v_key); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 4358, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_4);\n    __Pyx_Raise(__pyx_t_4, 0, 0, 0);\n    __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n    __PYX_ERR(0, 4358, __pyx_L1_error)\n  }\n\n  /* \"pywrapfst.pyx\":4353\n *     self._reader.get().Reset()\n * \n *   def __getitem__(self, key):             # <<<<<<<<<<<<<<\n *     cdef string ckey = tostring(key)\n *     if self.get_key() == ckey or self._reader.get().Find(ckey):\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_AddTraceback(\"pywrapfst.FarReader.__getitem__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"(tree fragment)\":1\n * def __reduce_cython__(self):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._reader cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_9FarReader_27__reduce_cython__(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_9FarReader_27__reduce_cython__(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__reduce_cython__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_9FarReader_26__reduce_cython__(((struct __pyx_obj_9pywrapfst_FarReader *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_9FarReader_26__reduce_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst_FarReader *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"__reduce_cython__\", 0);\n\n  /* \"(tree fragment)\":2\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._reader cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._reader cannot be converted to a Python object for pickling\")\n */\n  __pyx_t_1 = __Pyx_PyObject_Call(__pyx_builtin_TypeError, __pyx_tuple__93, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(1, 2, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __Pyx_Raise(__pyx_t_1, 0, 0, 0);\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  __PYX_ERR(1, 2, __pyx_L1_error)\n\n  /* \"(tree fragment)\":1\n * def __reduce_cython__(self):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._reader cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.FarReader.__reduce_cython__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"(tree fragment)\":3\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._reader cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._reader cannot be converted to a Python object for pickling\")\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_9FarReader_29__setstate_cython__(PyObject *__pyx_v_self, PyObject *__pyx_v___pyx_state); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_9FarReader_29__setstate_cython__(PyObject *__pyx_v_self, PyObject *__pyx_v___pyx_state) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__setstate_cython__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_9FarReader_28__setstate_cython__(((struct __pyx_obj_9pywrapfst_FarReader *)__pyx_v_self), ((PyObject *)__pyx_v___pyx_state));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_9FarReader_28__setstate_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst_FarReader *__pyx_v_self, CYTHON_UNUSED PyObject *__pyx_v___pyx_state) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"__setstate_cython__\", 0);\n\n  /* \"(tree fragment)\":4\n *     raise TypeError(\"self._reader cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._reader cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n */\n  __pyx_t_1 = __Pyx_PyObject_Call(__pyx_builtin_TypeError, __pyx_tuple__94, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(1, 4, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __Pyx_Raise(__pyx_t_1, 0, 0, 0);\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  __PYX_ERR(1, 4, __pyx_L1_error)\n\n  /* \"(tree fragment)\":3\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._reader cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._reader cannot be converted to a Python object for pickling\")\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.FarReader.__setstate_cython__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":4381\n *   \"\"\"\n * \n *   def __init__(self):             # <<<<<<<<<<<<<<\n *     raise FstDeletedConstructorError(\n *         \"Cannot construct {}\".format(self.__class__.__name__))\n */\n\n/* Python wrapper */\nstatic int __pyx_pw_9pywrapfst_9FarWriter_1__init__(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic int __pyx_pw_9pywrapfst_9FarWriter_1__init__(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  int __pyx_r;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__init__ (wrapper)\", 0);\n  if (unlikely(PyTuple_GET_SIZE(__pyx_args) > 0)) {\n    __Pyx_RaiseArgtupleInvalid(\"__init__\", 1, 0, 0, PyTuple_GET_SIZE(__pyx_args)); return -1;}\n  if (unlikely(__pyx_kwds) && unlikely(PyDict_Size(__pyx_kwds) > 0) && unlikely(!__Pyx_CheckKeywordStrings(__pyx_kwds, \"__init__\", 0))) return -1;\n  __pyx_r = __pyx_pf_9pywrapfst_9FarWriter___init__(((struct __pyx_obj_9pywrapfst_FarWriter *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic int __pyx_pf_9pywrapfst_9FarWriter___init__(struct __pyx_obj_9pywrapfst_FarWriter *__pyx_v_self) {\n  int __pyx_r;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  PyObject *__pyx_t_6 = NULL;\n  PyObject *__pyx_t_7 = NULL;\n  __Pyx_RefNannySetupContext(\"__init__\", 0);\n\n  /* \"pywrapfst.pyx\":4382\n * \n *   def __init__(self):\n *     raise FstDeletedConstructorError(             # <<<<<<<<<<<<<<\n *         \"Cannot construct {}\".format(self.__class__.__name__))\n * \n */\n  __pyx_t_2 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstDeletedConstructorError); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 4382, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n\n  /* \"pywrapfst.pyx\":4383\n *   def __init__(self):\n *     raise FstDeletedConstructorError(\n *         \"Cannot construct {}\".format(self.__class__.__name__))             # <<<<<<<<<<<<<<\n * \n *   def __repr__(self):\n */\n  __pyx_t_4 = __Pyx_PyObject_GetAttrStr(__pyx_kp_s_Cannot_construct, __pyx_n_s_format); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 4383, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_4);\n  __pyx_t_5 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_class); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 4383, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_5);\n  __pyx_t_6 = __Pyx_PyObject_GetAttrStr(__pyx_t_5, __pyx_n_s_name); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 4383, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_6);\n  __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n  __pyx_t_5 = NULL;\n  if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_4))) {\n    __pyx_t_5 = PyMethod_GET_SELF(__pyx_t_4);\n    if (likely(__pyx_t_5)) {\n      PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_4);\n      __Pyx_INCREF(__pyx_t_5);\n      __Pyx_INCREF(function);\n      __Pyx_DECREF_SET(__pyx_t_4, function);\n    }\n  }\n  if (!__pyx_t_5) {\n    __pyx_t_3 = __Pyx_PyObject_CallOneArg(__pyx_t_4, __pyx_t_6); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 4383, __pyx_L1_error)\n    __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n    __Pyx_GOTREF(__pyx_t_3);\n  } else {\n    #if CYTHON_FAST_PYCALL\n    if (PyFunction_Check(__pyx_t_4)) {\n      PyObject *__pyx_temp[2] = {__pyx_t_5, __pyx_t_6};\n      __pyx_t_3 = __Pyx_PyFunction_FastCall(__pyx_t_4, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 4383, __pyx_L1_error)\n      __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;\n      __Pyx_GOTREF(__pyx_t_3);\n      __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n    } else\n    #endif\n    #if CYTHON_FAST_PYCCALL\n    if (__Pyx_PyFastCFunction_Check(__pyx_t_4)) {\n      PyObject *__pyx_temp[2] = {__pyx_t_5, __pyx_t_6};\n      __pyx_t_3 = __Pyx_PyCFunction_FastCall(__pyx_t_4, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 4383, __pyx_L1_error)\n      __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;\n      __Pyx_GOTREF(__pyx_t_3);\n      __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n    } else\n    #endif\n    {\n      __pyx_t_7 = PyTuple_New(1+1); if (unlikely(!__pyx_t_7)) __PYX_ERR(0, 4383, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_7);\n      __Pyx_GIVEREF(__pyx_t_5); PyTuple_SET_ITEM(__pyx_t_7, 0, __pyx_t_5); __pyx_t_5 = NULL;\n      __Pyx_GIVEREF(__pyx_t_6);\n      PyTuple_SET_ITEM(__pyx_t_7, 0+1, __pyx_t_6);\n      __pyx_t_6 = 0;\n      __pyx_t_3 = __Pyx_PyObject_Call(__pyx_t_4, __pyx_t_7, NULL); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 4383, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_3);\n      __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0;\n    }\n  }\n  __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n  __pyx_t_4 = NULL;\n  if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_2))) {\n    __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_2);\n    if (likely(__pyx_t_4)) {\n      PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_2);\n      __Pyx_INCREF(__pyx_t_4);\n      __Pyx_INCREF(function);\n      __Pyx_DECREF_SET(__pyx_t_2, function);\n    }\n  }\n  if (!__pyx_t_4) {\n    __pyx_t_1 = __Pyx_PyObject_CallOneArg(__pyx_t_2, __pyx_t_3); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4382, __pyx_L1_error)\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    __Pyx_GOTREF(__pyx_t_1);\n  } else {\n    #if CYTHON_FAST_PYCALL\n    if (PyFunction_Check(__pyx_t_2)) {\n      PyObject *__pyx_temp[2] = {__pyx_t_4, __pyx_t_3};\n      __pyx_t_1 = __Pyx_PyFunction_FastCall(__pyx_t_2, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4382, __pyx_L1_error)\n      __Pyx_XDECREF(__pyx_t_4); __pyx_t_4 = 0;\n      __Pyx_GOTREF(__pyx_t_1);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    } else\n    #endif\n    #if CYTHON_FAST_PYCCALL\n    if (__Pyx_PyFastCFunction_Check(__pyx_t_2)) {\n      PyObject *__pyx_temp[2] = {__pyx_t_4, __pyx_t_3};\n      __pyx_t_1 = __Pyx_PyCFunction_FastCall(__pyx_t_2, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4382, __pyx_L1_error)\n      __Pyx_XDECREF(__pyx_t_4); __pyx_t_4 = 0;\n      __Pyx_GOTREF(__pyx_t_1);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    } else\n    #endif\n    {\n      __pyx_t_7 = PyTuple_New(1+1); if (unlikely(!__pyx_t_7)) __PYX_ERR(0, 4382, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_7);\n      __Pyx_GIVEREF(__pyx_t_4); PyTuple_SET_ITEM(__pyx_t_7, 0, __pyx_t_4); __pyx_t_4 = NULL;\n      __Pyx_GIVEREF(__pyx_t_3);\n      PyTuple_SET_ITEM(__pyx_t_7, 0+1, __pyx_t_3);\n      __pyx_t_3 = 0;\n      __pyx_t_1 = __Pyx_PyObject_Call(__pyx_t_2, __pyx_t_7, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4382, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_1);\n      __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0;\n    }\n  }\n  __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n  __Pyx_Raise(__pyx_t_1, 0, 0, 0);\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  __PYX_ERR(0, 4382, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":4381\n *   \"\"\"\n * \n *   def __init__(self):             # <<<<<<<<<<<<<<\n *     raise FstDeletedConstructorError(\n *         \"Cannot construct {}\".format(self.__class__.__name__))\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_XDECREF(__pyx_t_6);\n  __Pyx_XDECREF(__pyx_t_7);\n  __Pyx_AddTraceback(\"pywrapfst.FarWriter.__init__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = -1;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":4385\n *         \"Cannot construct {}\".format(self.__class__.__name__))\n * \n *   def __repr__(self):             # <<<<<<<<<<<<<<\n *     return \"<{} FarWriter at 0x{:x}>\".format(self.far_type(), id(self))\n * \n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_9FarWriter_3__repr__(PyObject *__pyx_v_self); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_9FarWriter_3__repr__(PyObject *__pyx_v_self) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__repr__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_9FarWriter_2__repr__(((struct __pyx_obj_9pywrapfst_FarWriter *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_9FarWriter_2__repr__(struct __pyx_obj_9pywrapfst_FarWriter *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  int __pyx_t_6;\n  PyObject *__pyx_t_7 = NULL;\n  __Pyx_RefNannySetupContext(\"__repr__\", 0);\n\n  /* \"pywrapfst.pyx\":4386\n * \n *   def __repr__(self):\n *     return \"<{} FarWriter at 0x{:x}>\".format(self.far_type(), id(self))             # <<<<<<<<<<<<<<\n * \n *   @classmethod\n */\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_2 = __Pyx_PyObject_GetAttrStr(__pyx_kp_s_FarWriter_at_0x_x, __pyx_n_s_format); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 4386, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"far_type\");\n    __PYX_ERR(0, 4386, __pyx_L1_error)\n  }\n  __pyx_t_3 = __pyx_convert_PyBytes_string_to_py_std__in_string(((struct __pyx_vtabstruct_9pywrapfst_FarWriter *)__pyx_v_self->__pyx_vtab)->far_type(__pyx_v_self, 0)); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 4386, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_3);\n  __pyx_t_4 = __Pyx_PyObject_CallOneArg(__pyx_builtin_id, ((PyObject *)__pyx_v_self)); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 4386, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_4);\n  __pyx_t_5 = NULL;\n  __pyx_t_6 = 0;\n  if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_2))) {\n    __pyx_t_5 = PyMethod_GET_SELF(__pyx_t_2);\n    if (likely(__pyx_t_5)) {\n      PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_2);\n      __Pyx_INCREF(__pyx_t_5);\n      __Pyx_INCREF(function);\n      __Pyx_DECREF_SET(__pyx_t_2, function);\n      __pyx_t_6 = 1;\n    }\n  }\n  #if CYTHON_FAST_PYCALL\n  if (PyFunction_Check(__pyx_t_2)) {\n    PyObject *__pyx_temp[3] = {__pyx_t_5, __pyx_t_3, __pyx_t_4};\n    __pyx_t_1 = __Pyx_PyFunction_FastCall(__pyx_t_2, __pyx_temp+1-__pyx_t_6, 2+__pyx_t_6); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4386, __pyx_L1_error)\n    __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;\n    __Pyx_GOTREF(__pyx_t_1);\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n  } else\n  #endif\n  #if CYTHON_FAST_PYCCALL\n  if (__Pyx_PyFastCFunction_Check(__pyx_t_2)) {\n    PyObject *__pyx_temp[3] = {__pyx_t_5, __pyx_t_3, __pyx_t_4};\n    __pyx_t_1 = __Pyx_PyCFunction_FastCall(__pyx_t_2, __pyx_temp+1-__pyx_t_6, 2+__pyx_t_6); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4386, __pyx_L1_error)\n    __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;\n    __Pyx_GOTREF(__pyx_t_1);\n    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n    __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n  } else\n  #endif\n  {\n    __pyx_t_7 = PyTuple_New(2+__pyx_t_6); if (unlikely(!__pyx_t_7)) __PYX_ERR(0, 4386, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_7);\n    if (__pyx_t_5) {\n      __Pyx_GIVEREF(__pyx_t_5); PyTuple_SET_ITEM(__pyx_t_7, 0, __pyx_t_5); __pyx_t_5 = NULL;\n    }\n    __Pyx_GIVEREF(__pyx_t_3);\n    PyTuple_SET_ITEM(__pyx_t_7, 0+__pyx_t_6, __pyx_t_3);\n    __Pyx_GIVEREF(__pyx_t_4);\n    PyTuple_SET_ITEM(__pyx_t_7, 1+__pyx_t_6, __pyx_t_4);\n    __pyx_t_3 = 0;\n    __pyx_t_4 = 0;\n    __pyx_t_1 = __Pyx_PyObject_Call(__pyx_t_2, __pyx_t_7, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4386, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0;\n  }\n  __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":4385\n *         \"Cannot construct {}\".format(self.__class__.__name__))\n * \n *   def __repr__(self):             # <<<<<<<<<<<<<<\n *     return \"<{} FarWriter at 0x{:x}>\".format(self.far_type(), id(self))\n * \n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_XDECREF(__pyx_t_7);\n  __Pyx_AddTraceback(\"pywrapfst.FarWriter.__repr__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":4389\n * \n *   @classmethod\n *   def create(cls, filename, arc_type=b\"standard\", far_type=b\"default\"):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     FarWriter.\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_9FarWriter_5create(PyObject *__pyx_v_cls, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic char __pyx_doc_9pywrapfst_9FarWriter_4create[] = \"\\n    FarWriter.\\n\\n    Creates a FarWriter object.\\n\\n    This class method creates a FarWriter given the desired output location,\\n    arc type, and FAR type.\\n\\n    Args:\\n      filename: The string location for the output FAR files.\\n      arc_type: A string indicating the arc type.\\n      far_type: A string indicating the FAR type; one of: \\\"fst\\\", \\\"stlist\\\",\\n          \\\"sttable\\\", \\\"sstable\\\", \\\"default\\\".\\n\\n    Returns:\\n      A new FarWriter instance.\\n\\n    Raises:\\n      FstIOError: Read failed.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_9FarWriter_5create(PyObject *__pyx_v_cls, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  PyObject *__pyx_v_filename = 0;\n  PyObject *__pyx_v_arc_type = 0;\n  PyObject *__pyx_v_far_type = 0;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"create (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_filename,&__pyx_n_s_arc_type,&__pyx_n_s_far_type,0};\n    PyObject* values[3] = {0,0,0};\n    values[1] = ((PyObject *)__pyx_n_b_standard);\n    values[2] = ((PyObject *)__pyx_n_b_default);\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);\n        CYTHON_FALLTHROUGH;\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (likely((values[0] = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_filename)) != 0)) kw_args--;\n        else goto __pyx_L5_argtuple_error;\n        CYTHON_FALLTHROUGH;\n        case  1:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_arc_type);\n          if (value) { values[1] = value; kw_args--; }\n        }\n        CYTHON_FALLTHROUGH;\n        case  2:\n        if (kw_args > 0) {\n          PyObject* value = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_far_type);\n          if (value) { values[2] = value; kw_args--; }\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"create\") < 0)) __PYX_ERR(0, 4389, __pyx_L3_error)\n      }\n    } else {\n      switch (PyTuple_GET_SIZE(__pyx_args)) {\n        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);\n        CYTHON_FALLTHROUGH;\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n    }\n    __pyx_v_filename = values[0];\n    __pyx_v_arc_type = values[1];\n    __pyx_v_far_type = values[2];\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"create\", 0, 1, 3, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 4389, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst.FarWriter.create\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  __pyx_r = __pyx_pf_9pywrapfst_9FarWriter_4create(((PyTypeObject*)__pyx_v_cls), __pyx_v_filename, __pyx_v_arc_type, __pyx_v_far_type);\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_9FarWriter_4create(CYTHON_UNUSED PyTypeObject *__pyx_v_cls, PyObject *__pyx_v_filename, PyObject *__pyx_v_arc_type, PyObject *__pyx_v_far_type) {\n  enum fst::FarType __pyx_v_ft;\n  fst::script::FarWriterClass *__pyx_v_tfar;\n  struct __pyx_obj_9pywrapfst_FarWriter *__pyx_v_result = 0;\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  std::string __pyx_t_1;\n  std::string __pyx_t_2;\n  int __pyx_t_3;\n  PyObject *__pyx_t_4 = NULL;\n  PyObject *__pyx_t_5 = NULL;\n  PyObject *__pyx_t_6 = NULL;\n  PyObject *__pyx_t_7 = NULL;\n  PyObject *__pyx_t_8 = NULL;\n  PyObject *__pyx_t_9 = NULL;\n  __Pyx_RefNannySetupContext(\"create\", 0);\n\n  /* \"pywrapfst.pyx\":4410\n *       FstIOError: Read failed.\n *     \"\"\"\n *     cdef fst.FarType ft = fst.GetFarType(tostring(far_type))             # <<<<<<<<<<<<<<\n *     cdef fst.FarWriterClass *tfar = fst.FarWriterClass.Create(\n *         tostring(filename), tostring(arc_type), ft)\n */\n  __pyx_t_1 = __pyx_f_9pywrapfst_tostring(__pyx_v_far_type, NULL); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 4410, __pyx_L1_error)\n  __pyx_v_ft = fst::script::GetFarType(__pyx_t_1);\n\n  /* \"pywrapfst.pyx\":4412\n *     cdef fst.FarType ft = fst.GetFarType(tostring(far_type))\n *     cdef fst.FarWriterClass *tfar = fst.FarWriterClass.Create(\n *         tostring(filename), tostring(arc_type), ft)             # <<<<<<<<<<<<<<\n *     if tfar == NULL:\n *       raise FstIOError(\"Open failed: {!r}\".format(filename))\n */\n  __pyx_t_1 = __pyx_f_9pywrapfst_tostring(__pyx_v_filename, NULL); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 4412, __pyx_L1_error)\n  __pyx_t_2 = __pyx_f_9pywrapfst_tostring(__pyx_v_arc_type, NULL); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 4412, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":4411\n *     \"\"\"\n *     cdef fst.FarType ft = fst.GetFarType(tostring(far_type))\n *     cdef fst.FarWriterClass *tfar = fst.FarWriterClass.Create(             # <<<<<<<<<<<<<<\n *         tostring(filename), tostring(arc_type), ft)\n *     if tfar == NULL:\n */\n  __pyx_v_tfar = fst::script::FarWriterClass::Create(__pyx_t_1, __pyx_t_2, __pyx_v_ft);\n\n  /* \"pywrapfst.pyx\":4413\n *     cdef fst.FarWriterClass *tfar = fst.FarWriterClass.Create(\n *         tostring(filename), tostring(arc_type), ft)\n *     if tfar == NULL:             # <<<<<<<<<<<<<<\n *       raise FstIOError(\"Open failed: {!r}\".format(filename))\n *     cdef FarWriter result = FarWriter.__new__(FarWriter)\n */\n  __pyx_t_3 = ((__pyx_v_tfar == NULL) != 0);\n  if (unlikely(__pyx_t_3)) {\n\n    /* \"pywrapfst.pyx\":4414\n *         tostring(filename), tostring(arc_type), ft)\n *     if tfar == NULL:\n *       raise FstIOError(\"Open failed: {!r}\".format(filename))             # <<<<<<<<<<<<<<\n *     cdef FarWriter result = FarWriter.__new__(FarWriter)\n *     result._writer.reset(tfar)\n */\n    __pyx_t_5 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstIOError); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 4414, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_5);\n    __pyx_t_7 = __Pyx_PyObject_GetAttrStr(__pyx_kp_s_Open_failed_r, __pyx_n_s_format); if (unlikely(!__pyx_t_7)) __PYX_ERR(0, 4414, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_7);\n    __pyx_t_8 = NULL;\n    if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_7))) {\n      __pyx_t_8 = PyMethod_GET_SELF(__pyx_t_7);\n      if (likely(__pyx_t_8)) {\n        PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_7);\n        __Pyx_INCREF(__pyx_t_8);\n        __Pyx_INCREF(function);\n        __Pyx_DECREF_SET(__pyx_t_7, function);\n      }\n    }\n    if (!__pyx_t_8) {\n      __pyx_t_6 = __Pyx_PyObject_CallOneArg(__pyx_t_7, __pyx_v_filename); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 4414, __pyx_L1_error)\n      __Pyx_GOTREF(__pyx_t_6);\n    } else {\n      #if CYTHON_FAST_PYCALL\n      if (PyFunction_Check(__pyx_t_7)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_8, __pyx_v_filename};\n        __pyx_t_6 = __Pyx_PyFunction_FastCall(__pyx_t_7, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 4414, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_8); __pyx_t_8 = 0;\n        __Pyx_GOTREF(__pyx_t_6);\n      } else\n      #endif\n      #if CYTHON_FAST_PYCCALL\n      if (__Pyx_PyFastCFunction_Check(__pyx_t_7)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_8, __pyx_v_filename};\n        __pyx_t_6 = __Pyx_PyCFunction_FastCall(__pyx_t_7, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 4414, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_8); __pyx_t_8 = 0;\n        __Pyx_GOTREF(__pyx_t_6);\n      } else\n      #endif\n      {\n        __pyx_t_9 = PyTuple_New(1+1); if (unlikely(!__pyx_t_9)) __PYX_ERR(0, 4414, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_9);\n        __Pyx_GIVEREF(__pyx_t_8); PyTuple_SET_ITEM(__pyx_t_9, 0, __pyx_t_8); __pyx_t_8 = NULL;\n        __Pyx_INCREF(__pyx_v_filename);\n        __Pyx_GIVEREF(__pyx_v_filename);\n        PyTuple_SET_ITEM(__pyx_t_9, 0+1, __pyx_v_filename);\n        __pyx_t_6 = __Pyx_PyObject_Call(__pyx_t_7, __pyx_t_9, NULL); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 4414, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_6);\n        __Pyx_DECREF(__pyx_t_9); __pyx_t_9 = 0;\n      }\n    }\n    __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0;\n    __pyx_t_7 = NULL;\n    if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_5))) {\n      __pyx_t_7 = PyMethod_GET_SELF(__pyx_t_5);\n      if (likely(__pyx_t_7)) {\n        PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_5);\n        __Pyx_INCREF(__pyx_t_7);\n        __Pyx_INCREF(function);\n        __Pyx_DECREF_SET(__pyx_t_5, function);\n      }\n    }\n    if (!__pyx_t_7) {\n      __pyx_t_4 = __Pyx_PyObject_CallOneArg(__pyx_t_5, __pyx_t_6); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 4414, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n      __Pyx_GOTREF(__pyx_t_4);\n    } else {\n      #if CYTHON_FAST_PYCALL\n      if (PyFunction_Check(__pyx_t_5)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_7, __pyx_t_6};\n        __pyx_t_4 = __Pyx_PyFunction_FastCall(__pyx_t_5, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 4414, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_7); __pyx_t_7 = 0;\n        __Pyx_GOTREF(__pyx_t_4);\n        __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n      } else\n      #endif\n      #if CYTHON_FAST_PYCCALL\n      if (__Pyx_PyFastCFunction_Check(__pyx_t_5)) {\n        PyObject *__pyx_temp[2] = {__pyx_t_7, __pyx_t_6};\n        __pyx_t_4 = __Pyx_PyCFunction_FastCall(__pyx_t_5, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 4414, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_7); __pyx_t_7 = 0;\n        __Pyx_GOTREF(__pyx_t_4);\n        __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n      } else\n      #endif\n      {\n        __pyx_t_9 = PyTuple_New(1+1); if (unlikely(!__pyx_t_9)) __PYX_ERR(0, 4414, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_9);\n        __Pyx_GIVEREF(__pyx_t_7); PyTuple_SET_ITEM(__pyx_t_9, 0, __pyx_t_7); __pyx_t_7 = NULL;\n        __Pyx_GIVEREF(__pyx_t_6);\n        PyTuple_SET_ITEM(__pyx_t_9, 0+1, __pyx_t_6);\n        __pyx_t_6 = 0;\n        __pyx_t_4 = __Pyx_PyObject_Call(__pyx_t_5, __pyx_t_9, NULL); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 4414, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_4);\n        __Pyx_DECREF(__pyx_t_9); __pyx_t_9 = 0;\n      }\n    }\n    __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n    __Pyx_Raise(__pyx_t_4, 0, 0, 0);\n    __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n    __PYX_ERR(0, 4414, __pyx_L1_error)\n\n    /* \"pywrapfst.pyx\":4413\n *     cdef fst.FarWriterClass *tfar = fst.FarWriterClass.Create(\n *         tostring(filename), tostring(arc_type), ft)\n *     if tfar == NULL:             # <<<<<<<<<<<<<<\n *       raise FstIOError(\"Open failed: {!r}\".format(filename))\n *     cdef FarWriter result = FarWriter.__new__(FarWriter)\n */\n  }\n\n  /* \"pywrapfst.pyx\":4415\n *     if tfar == NULL:\n *       raise FstIOError(\"Open failed: {!r}\".format(filename))\n *     cdef FarWriter result = FarWriter.__new__(FarWriter)             # <<<<<<<<<<<<<<\n *     result._writer.reset(tfar)\n *     return result\n */\n  __pyx_t_4 = ((PyObject *)__pyx_tp_new_9pywrapfst_FarWriter(((PyTypeObject *)__pyx_ptype_9pywrapfst_FarWriter), __pyx_empty_tuple, NULL)); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 4415, __pyx_L1_error)\n  __Pyx_GOTREF(((PyObject *)__pyx_t_4));\n  __pyx_v_result = ((struct __pyx_obj_9pywrapfst_FarWriter *)__pyx_t_4);\n  __pyx_t_4 = 0;\n\n  /* \"pywrapfst.pyx\":4416\n *       raise FstIOError(\"Open failed: {!r}\".format(filename))\n *     cdef FarWriter result = FarWriter.__new__(FarWriter)\n *     result._writer.reset(tfar)             # <<<<<<<<<<<<<<\n *     return result\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_result) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_writer\");\n    __PYX_ERR(0, 4416, __pyx_L1_error)\n  }\n  __pyx_v_result->_writer.reset(__pyx_v_tfar);\n\n  /* \"pywrapfst.pyx\":4417\n *     cdef FarWriter result = FarWriter.__new__(FarWriter)\n *     result._writer.reset(tfar)\n *     return result             # <<<<<<<<<<<<<<\n * \n *   # NB: Invoking this method may be dangerous: calling any other method on the\n */\n  __Pyx_XDECREF(__pyx_r);\n  __Pyx_INCREF(((PyObject *)__pyx_v_result));\n  __pyx_r = ((PyObject *)__pyx_v_result);\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":4389\n * \n *   @classmethod\n *   def create(cls, filename, arc_type=b\"standard\", far_type=b\"default\"):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     FarWriter.\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_5);\n  __Pyx_XDECREF(__pyx_t_6);\n  __Pyx_XDECREF(__pyx_t_7);\n  __Pyx_XDECREF(__pyx_t_8);\n  __Pyx_XDECREF(__pyx_t_9);\n  __Pyx_AddTraceback(\"pywrapfst.FarWriter.create\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XDECREF((PyObject *)__pyx_v_result);\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":4421\n *   # NB: Invoking this method may be dangerous: calling any other method on the\n *   # instance after this is invoked may result in a null dereference.\n *   cdef void close(self):             # <<<<<<<<<<<<<<\n *     self._writer.reset()\n * \n */\n\nstatic void __pyx_f_9pywrapfst_9FarWriter_close(struct __pyx_obj_9pywrapfst_FarWriter *__pyx_v_self) {\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"close\", 0);\n\n  /* \"pywrapfst.pyx\":4422\n *   # instance after this is invoked may result in a null dereference.\n *   cdef void close(self):\n *     self._writer.reset()             # <<<<<<<<<<<<<<\n * \n *   cpdef void add(self, key, _Fst ifst) except *:\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_writer\");\n    __PYX_ERR(0, 4422, __pyx_L1_error)\n  }\n  __pyx_v_self->_writer.reset();\n\n  /* \"pywrapfst.pyx\":4421\n *   # NB: Invoking this method may be dangerous: calling any other method on the\n *   # instance after this is invoked may result in a null dereference.\n *   cdef void close(self):             # <<<<<<<<<<<<<<\n *     self._writer.reset()\n * \n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_WriteUnraisable(\"pywrapfst.FarWriter.close\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n}\n\n/* \"pywrapfst.pyx\":4424\n *     self._writer.reset()\n * \n *   cpdef void add(self, key, _Fst ifst) except *:             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     add(self, key, ifst)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_9FarWriter_7add(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic void __pyx_f_9pywrapfst_9FarWriter_add(struct __pyx_obj_9pywrapfst_FarWriter *__pyx_v_self, PyObject *__pyx_v_key, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst, int __pyx_skip_dispatch) {\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  int __pyx_t_5;\n  PyObject *__pyx_t_6 = NULL;\n  std::string __pyx_t_7;\n  int __pyx_t_8;\n  __Pyx_RefNannySetupContext(\"add\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_add); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4424, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_9FarWriter_7add)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      __pyx_t_5 = 0;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n          __pyx_t_5 = 1;\n        }\n      }\n      #if CYTHON_FAST_PYCALL\n      if (PyFunction_Check(__pyx_t_3)) {\n        PyObject *__pyx_temp[3] = {__pyx_t_4, __pyx_v_key, ((PyObject *)__pyx_v_ifst)};\n        __pyx_t_2 = __Pyx_PyFunction_FastCall(__pyx_t_3, __pyx_temp+1-__pyx_t_5, 2+__pyx_t_5); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 4424, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_4); __pyx_t_4 = 0;\n        __Pyx_GOTREF(__pyx_t_2);\n      } else\n      #endif\n      #if CYTHON_FAST_PYCCALL\n      if (__Pyx_PyFastCFunction_Check(__pyx_t_3)) {\n        PyObject *__pyx_temp[3] = {__pyx_t_4, __pyx_v_key, ((PyObject *)__pyx_v_ifst)};\n        __pyx_t_2 = __Pyx_PyCFunction_FastCall(__pyx_t_3, __pyx_temp+1-__pyx_t_5, 2+__pyx_t_5); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 4424, __pyx_L1_error)\n        __Pyx_XDECREF(__pyx_t_4); __pyx_t_4 = 0;\n        __Pyx_GOTREF(__pyx_t_2);\n      } else\n      #endif\n      {\n        __pyx_t_6 = PyTuple_New(2+__pyx_t_5); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 4424, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_6);\n        if (__pyx_t_4) {\n          __Pyx_GIVEREF(__pyx_t_4); PyTuple_SET_ITEM(__pyx_t_6, 0, __pyx_t_4); __pyx_t_4 = NULL;\n        }\n        __Pyx_INCREF(__pyx_v_key);\n        __Pyx_GIVEREF(__pyx_v_key);\n        PyTuple_SET_ITEM(__pyx_t_6, 0+__pyx_t_5, __pyx_v_key);\n        __Pyx_INCREF(((PyObject *)__pyx_v_ifst));\n        __Pyx_GIVEREF(((PyObject *)__pyx_v_ifst));\n        PyTuple_SET_ITEM(__pyx_t_6, 1+__pyx_t_5, ((PyObject *)__pyx_v_ifst));\n        __pyx_t_2 = __Pyx_PyObject_Call(__pyx_t_3, __pyx_t_6, NULL); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 4424, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_2);\n        __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n      }\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":4443\n *     # Failure here results from passing an FST with a different arc type than\n *     # used by the FAR was initialized to use.\n *     if not self._writer.get().Add(tostring(key), deref(ifst._fst)):             # <<<<<<<<<<<<<<\n *       raise FstOpError(\"Incompatible or invalid arc type\")\n *     # An error here usually indicates a key out of order.\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_writer\");\n    __PYX_ERR(0, 4443, __pyx_L1_error)\n  }\n  __pyx_t_7 = __pyx_f_9pywrapfst_tostring(__pyx_v_key, NULL); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 4443, __pyx_L1_error)\n  if (unlikely(((PyObject *)__pyx_v_ifst) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_fst\");\n    __PYX_ERR(0, 4443, __pyx_L1_error)\n  }\n  __pyx_t_8 = ((!(__pyx_v_self->_writer.get()->Add(__pyx_t_7, (*__pyx_v_ifst->_fst)) != 0)) != 0);\n  if (unlikely(__pyx_t_8)) {\n\n    /* \"pywrapfst.pyx\":4444\n *     # used by the FAR was initialized to use.\n *     if not self._writer.get().Add(tostring(key), deref(ifst._fst)):\n *       raise FstOpError(\"Incompatible or invalid arc type\")             # <<<<<<<<<<<<<<\n *     # An error here usually indicates a key out of order.\n *     if self._writer.get().Error():\n */\n    __pyx_t_1 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstOpError); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4444, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    __pyx_t_2 = __Pyx_PyObject_Call(__pyx_t_1, __pyx_tuple__95, NULL); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 4444, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_2);\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n    __Pyx_Raise(__pyx_t_2, 0, 0, 0);\n    __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n    __PYX_ERR(0, 4444, __pyx_L1_error)\n\n    /* \"pywrapfst.pyx\":4443\n *     # Failure here results from passing an FST with a different arc type than\n *     # used by the FAR was initialized to use.\n *     if not self._writer.get().Add(tostring(key), deref(ifst._fst)):             # <<<<<<<<<<<<<<\n *       raise FstOpError(\"Incompatible or invalid arc type\")\n *     # An error here usually indicates a key out of order.\n */\n  }\n\n  /* \"pywrapfst.pyx\":4446\n *       raise FstOpError(\"Incompatible or invalid arc type\")\n *     # An error here usually indicates a key out of order.\n *     if self._writer.get().Error():             # <<<<<<<<<<<<<<\n *       raise FstArgError(\"Key out of order\")\n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_writer\");\n    __PYX_ERR(0, 4446, __pyx_L1_error)\n  }\n  __pyx_t_8 = (__pyx_v_self->_writer.get()->Error() != 0);\n  if (unlikely(__pyx_t_8)) {\n\n    /* \"pywrapfst.pyx\":4447\n *     # An error here usually indicates a key out of order.\n *     if self._writer.get().Error():\n *       raise FstArgError(\"Key out of order\")             # <<<<<<<<<<<<<<\n * \n *   cpdef string arc_type(self):\n */\n    __pyx_t_2 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstArgError); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 4447, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_2);\n    __pyx_t_1 = __Pyx_PyObject_Call(__pyx_t_2, __pyx_tuple__96, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4447, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n    __Pyx_Raise(__pyx_t_1, 0, 0, 0);\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n    __PYX_ERR(0, 4447, __pyx_L1_error)\n\n    /* \"pywrapfst.pyx\":4446\n *       raise FstOpError(\"Incompatible or invalid arc type\")\n *     # An error here usually indicates a key out of order.\n *     if self._writer.get().Error():             # <<<<<<<<<<<<<<\n *       raise FstArgError(\"Key out of order\")\n * \n */\n  }\n\n  /* \"pywrapfst.pyx\":4424\n *     self._writer.reset()\n * \n *   cpdef void add(self, key, _Fst ifst) except *:             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     add(self, key, ifst)\n */\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_XDECREF(__pyx_t_6);\n  __Pyx_AddTraceback(\"pywrapfst.FarWriter.add\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_9FarWriter_7add(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic char __pyx_doc_9pywrapfst_9FarWriter_6add[] = \"\\n    add(self, key, ifst)\\n\\n    Adds an FST to the FAR.\\n\\n    This method adds an FST to the FAR which can be retrieved with the\\n    specified string key.\\n\\n    Args:\\n      key: The string used to key the input FST.\\n      ifst: The FST to write to the FAR.\\n\\n    Raises:\\n      FstArgError: Key out of order.\\n      FstOpError: Incompatible or invalid arc type.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_9FarWriter_7add(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n  PyObject *__pyx_v_key = 0;\n  struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst = 0;\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"add (wrapper)\", 0);\n  {\n    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_key,&__pyx_n_s_ifst,0};\n    PyObject* values[2] = {0,0};\n    if (unlikely(__pyx_kwds)) {\n      Py_ssize_t kw_args;\n      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);\n      switch (pos_args) {\n        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n        CYTHON_FALLTHROUGH;\n        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n        CYTHON_FALLTHROUGH;\n        case  0: break;\n        default: goto __pyx_L5_argtuple_error;\n      }\n      kw_args = PyDict_Size(__pyx_kwds);\n      switch (pos_args) {\n        case  0:\n        if (likely((values[0] = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_key)) != 0)) kw_args--;\n        else goto __pyx_L5_argtuple_error;\n        CYTHON_FALLTHROUGH;\n        case  1:\n        if (likely((values[1] = __Pyx_PyDict_GetItemStr(__pyx_kwds, __pyx_n_s_ifst)) != 0)) kw_args--;\n        else {\n          __Pyx_RaiseArgtupleInvalid(\"add\", 1, 2, 2, 1); __PYX_ERR(0, 4424, __pyx_L3_error)\n        }\n      }\n      if (unlikely(kw_args > 0)) {\n        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"add\") < 0)) __PYX_ERR(0, 4424, __pyx_L3_error)\n      }\n    } else if (PyTuple_GET_SIZE(__pyx_args) != 2) {\n      goto __pyx_L5_argtuple_error;\n    } else {\n      values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\n      values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n    }\n    __pyx_v_key = values[0];\n    __pyx_v_ifst = ((struct __pyx_obj_9pywrapfst__Fst *)values[1]);\n  }\n  goto __pyx_L4_argument_unpacking_done;\n  __pyx_L5_argtuple_error:;\n  __Pyx_RaiseArgtupleInvalid(\"add\", 1, 2, 2, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 4424, __pyx_L3_error)\n  __pyx_L3_error:;\n  __Pyx_AddTraceback(\"pywrapfst.FarWriter.add\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_RefNannyFinishContext();\n  return NULL;\n  __pyx_L4_argument_unpacking_done:;\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_ifst), __pyx_ptype_9pywrapfst__Fst, 1, \"ifst\", 0))) __PYX_ERR(0, 4424, __pyx_L1_error)\n  __pyx_r = __pyx_pf_9pywrapfst_9FarWriter_6add(((struct __pyx_obj_9pywrapfst_FarWriter *)__pyx_v_self), __pyx_v_key, __pyx_v_ifst);\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_9FarWriter_6add(struct __pyx_obj_9pywrapfst_FarWriter *__pyx_v_self, PyObject *__pyx_v_key, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_ifst) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"add\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_f_9pywrapfst_9FarWriter_add(__pyx_v_self, __pyx_v_key, __pyx_v_ifst, 1); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 4424, __pyx_L1_error)\n  __pyx_t_1 = __Pyx_void_to_None(NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4424, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.FarWriter.add\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":4449\n *       raise FstArgError(\"Key out of order\")\n * \n *   cpdef string arc_type(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     arc_type(self)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_9FarWriter_9arc_type(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic std::string __pyx_f_9pywrapfst_9FarWriter_arc_type(struct __pyx_obj_9pywrapfst_FarWriter *__pyx_v_self, int __pyx_skip_dispatch) {\n  std::string __pyx_r;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  std::string __pyx_t_5;\n  __Pyx_RefNannySetupContext(\"arc_type\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_arc_type); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4449, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_9FarWriter_9arc_type)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 4449, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 4449, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __pyx_t_5 = __pyx_convert_string_from_py_std__in_string(__pyx_t_2); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 4449, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __pyx_r = __pyx_t_5;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":4455\n *     Returns a string indicating the arc type.\n *     \"\"\"\n *     return self._writer.get().ArcType()             # <<<<<<<<<<<<<<\n * \n *   cpdef bool error(self):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_writer\");\n    __PYX_ERR(0, 4455, __pyx_L1_error)\n  }\n  __pyx_r = __pyx_v_self->_writer.get()->ArcType();\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":4449\n *       raise FstArgError(\"Key out of order\")\n * \n *   cpdef string arc_type(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     arc_type(self)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_WriteUnraisable(\"pywrapfst.FarWriter.arc_type\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __Pyx_pretend_to_initialize(&__pyx_r);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_9FarWriter_9arc_type(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_9FarWriter_8arc_type[] = \"\\n    arc_type(self)\\n\\n    Returns a string indicating the arc type.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_9FarWriter_9arc_type(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"arc_type (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_9FarWriter_8arc_type(((struct __pyx_obj_9pywrapfst_FarWriter *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_9FarWriter_8arc_type(struct __pyx_obj_9pywrapfst_FarWriter *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"arc_type\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __pyx_convert_PyBytes_string_to_py_std__in_string(__pyx_f_9pywrapfst_9FarWriter_arc_type(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4449, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.FarWriter.arc_type\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":4457\n *     return self._writer.get().ArcType()\n * \n *   cpdef bool error(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     error(self)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_9FarWriter_11error(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic bool __pyx_f_9pywrapfst_9FarWriter_error(struct __pyx_obj_9pywrapfst_FarWriter *__pyx_v_self, int __pyx_skip_dispatch) {\n  bool __pyx_r;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  bool __pyx_t_5;\n  __Pyx_RefNannySetupContext(\"error\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_error); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4457, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_9FarWriter_11error)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 4457, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 4457, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __pyx_t_5 = __Pyx_PyObject_IsTrue(__pyx_t_2); if (unlikely((__pyx_t_5 == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 4457, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __pyx_r = __pyx_t_5;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":4466\n *       True if the FarWriter is in an errorful state, False otherwise.\n *     \"\"\"\n *     return self._writer.get().Error()             # <<<<<<<<<<<<<<\n * \n *   cpdef string far_type(self):\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_writer\");\n    __PYX_ERR(0, 4466, __pyx_L1_error)\n  }\n  __pyx_r = __pyx_v_self->_writer.get()->Error();\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":4457\n *     return self._writer.get().ArcType()\n * \n *   cpdef bool error(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     error(self)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_WriteUnraisable(\"pywrapfst.FarWriter.error\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_9FarWriter_11error(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_9FarWriter_10error[] = \"\\n    error(self)\\n\\n    Indicates whether the FarWriter has encountered an error.\\n\\n    Returns:\\n      True if the FarWriter is in an errorful state, False otherwise.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_9FarWriter_11error(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"error (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_9FarWriter_10error(((struct __pyx_obj_9pywrapfst_FarWriter *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_9FarWriter_10error(struct __pyx_obj_9pywrapfst_FarWriter *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"error\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __Pyx_PyBool_FromLong(__pyx_f_9pywrapfst_9FarWriter_error(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4457, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.FarWriter.error\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":4468\n *     return self._writer.get().Error()\n * \n *   cpdef string far_type(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     far_type(self)\n */\n\nstatic PyObject *__pyx_pw_9pywrapfst_9FarWriter_13far_type(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic std::string __pyx_f_9pywrapfst_9FarWriter_far_type(struct __pyx_obj_9pywrapfst_FarWriter *__pyx_v_self, int __pyx_skip_dispatch) {\n  std::string __pyx_r;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  std::string __pyx_t_5;\n  __Pyx_RefNannySetupContext(\"far_type\", 0);\n  /* Check if called by wrapper */\n  if (unlikely(__pyx_skip_dispatch)) ;\n  /* Check if overridden in Python */\n  else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n    __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_far_type); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4468, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    if (!PyCFunction_Check(__pyx_t_1) || (PyCFunction_GET_FUNCTION(__pyx_t_1) != (PyCFunction)__pyx_pw_9pywrapfst_9FarWriter_13far_type)) {\n      __Pyx_INCREF(__pyx_t_1);\n      __pyx_t_3 = __pyx_t_1; __pyx_t_4 = NULL;\n      if (CYTHON_UNPACK_METHODS && unlikely(PyMethod_Check(__pyx_t_3))) {\n        __pyx_t_4 = PyMethod_GET_SELF(__pyx_t_3);\n        if (likely(__pyx_t_4)) {\n          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);\n          __Pyx_INCREF(__pyx_t_4);\n          __Pyx_INCREF(function);\n          __Pyx_DECREF_SET(__pyx_t_3, function);\n        }\n      }\n      if (__pyx_t_4) {\n        __pyx_t_2 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_4); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 4468, __pyx_L1_error)\n        __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n      } else {\n        __pyx_t_2 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 4468, __pyx_L1_error)\n      }\n      __Pyx_GOTREF(__pyx_t_2);\n      __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n      __pyx_t_5 = __pyx_convert_string_from_py_std__in_string(__pyx_t_2); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 4468, __pyx_L1_error)\n      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n      __pyx_r = __pyx_t_5;\n      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n      goto __pyx_L0;\n    }\n    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  }\n\n  /* \"pywrapfst.pyx\":4474\n *     Returns a string indicating the FAR type.\n *     \"\"\"\n *     return fst.GetFarTypeString(self._writer.get().Type())             # <<<<<<<<<<<<<<\n * \n *   # Dictionary-like assignment.\n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"_writer\");\n    __PYX_ERR(0, 4474, __pyx_L1_error)\n  }\n  __pyx_r = fst::GetFarTypeString(__pyx_v_self->_writer.get()->Type());\n  goto __pyx_L0;\n\n  /* \"pywrapfst.pyx\":4468\n *     return self._writer.get().Error()\n * \n *   cpdef string far_type(self):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     far_type(self)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_WriteUnraisable(\"pywrapfst.FarWriter.far_type\", __pyx_clineno, __pyx_lineno, __pyx_filename, 1, 0);\n  __Pyx_pretend_to_initialize(&__pyx_r);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_9FarWriter_13far_type(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic char __pyx_doc_9pywrapfst_9FarWriter_12far_type[] = \"\\n    far_type(self)\\n\\n    Returns a string indicating the FAR type.\\n    \";\nstatic PyObject *__pyx_pw_9pywrapfst_9FarWriter_13far_type(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"far_type (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_9FarWriter_12far_type(((struct __pyx_obj_9pywrapfst_FarWriter *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_9FarWriter_12far_type(struct __pyx_obj_9pywrapfst_FarWriter *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"far_type\", 0);\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __pyx_convert_PyBytes_string_to_py_std__in_string(__pyx_f_9pywrapfst_9FarWriter_far_type(__pyx_v_self, 1)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4468, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.FarWriter.far_type\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":4477\n * \n *   # Dictionary-like assignment.\n *   def __setitem__(self, key, _Fst fst):             # <<<<<<<<<<<<<<\n *     self.add(key, fst)\n * \n */\n\n/* Python wrapper */\nstatic int __pyx_pw_9pywrapfst_9FarWriter_15__setitem__(PyObject *__pyx_v_self, PyObject *__pyx_v_key, PyObject *__pyx_v_fst); /*proto*/\nstatic int __pyx_pw_9pywrapfst_9FarWriter_15__setitem__(PyObject *__pyx_v_self, PyObject *__pyx_v_key, PyObject *__pyx_v_fst) {\n  int __pyx_r;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__setitem__ (wrapper)\", 0);\n  if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_fst), __pyx_ptype_9pywrapfst__Fst, 1, \"fst\", 0))) __PYX_ERR(0, 4477, __pyx_L1_error)\n  __pyx_r = __pyx_pf_9pywrapfst_9FarWriter_14__setitem__(((struct __pyx_obj_9pywrapfst_FarWriter *)__pyx_v_self), ((PyObject *)__pyx_v_key), ((struct __pyx_obj_9pywrapfst__Fst *)__pyx_v_fst));\n\n  /* function exit code */\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __pyx_r = -1;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic int __pyx_pf_9pywrapfst_9FarWriter_14__setitem__(struct __pyx_obj_9pywrapfst_FarWriter *__pyx_v_self, PyObject *__pyx_v_key, struct __pyx_obj_9pywrapfst__Fst *__pyx_v_fst) {\n  int __pyx_r;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__setitem__\", 0);\n\n  /* \"pywrapfst.pyx\":4478\n *   # Dictionary-like assignment.\n *   def __setitem__(self, key, _Fst fst):\n *     self.add(key, fst)             # <<<<<<<<<<<<<<\n * \n * \n */\n  if (unlikely(((PyObject *)__pyx_v_self) == Py_None)) {\n    PyErr_Format(PyExc_AttributeError, \"'NoneType' object has no attribute '%.30s'\", \"add\");\n    __PYX_ERR(0, 4478, __pyx_L1_error)\n  }\n  ((struct __pyx_vtabstruct_9pywrapfst_FarWriter *)__pyx_v_self->__pyx_vtab)->add(__pyx_v_self, __pyx_v_key, __pyx_v_fst, 0); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 4478, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":4477\n * \n *   # Dictionary-like assignment.\n *   def __setitem__(self, key, _Fst fst):             # <<<<<<<<<<<<<<\n *     self.add(key, fst)\n * \n */\n\n  /* function exit code */\n  __pyx_r = 0;\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"pywrapfst.FarWriter.__setitem__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = -1;\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"(tree fragment)\":1\n * def __reduce_cython__(self):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._writer cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_9FarWriter_17__reduce_cython__(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_9FarWriter_17__reduce_cython__(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__reduce_cython__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_9FarWriter_16__reduce_cython__(((struct __pyx_obj_9pywrapfst_FarWriter *)__pyx_v_self));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_9FarWriter_16__reduce_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst_FarWriter *__pyx_v_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"__reduce_cython__\", 0);\n\n  /* \"(tree fragment)\":2\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._writer cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._writer cannot be converted to a Python object for pickling\")\n */\n  __pyx_t_1 = __Pyx_PyObject_Call(__pyx_builtin_TypeError, __pyx_tuple__97, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(1, 2, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __Pyx_Raise(__pyx_t_1, 0, 0, 0);\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  __PYX_ERR(1, 2, __pyx_L1_error)\n\n  /* \"(tree fragment)\":1\n * def __reduce_cython__(self):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._writer cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.FarWriter.__reduce_cython__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"(tree fragment)\":3\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._writer cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._writer cannot be converted to a Python object for pickling\")\n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_9FarWriter_19__setstate_cython__(PyObject *__pyx_v_self, PyObject *__pyx_v___pyx_state); /*proto*/\nstatic PyObject *__pyx_pw_9pywrapfst_9FarWriter_19__setstate_cython__(PyObject *__pyx_v_self, PyObject *__pyx_v___pyx_state) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__setstate_cython__ (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_9FarWriter_18__setstate_cython__(((struct __pyx_obj_9pywrapfst_FarWriter *)__pyx_v_self), ((PyObject *)__pyx_v___pyx_state));\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_9FarWriter_18__setstate_cython__(CYTHON_UNUSED struct __pyx_obj_9pywrapfst_FarWriter *__pyx_v_self, CYTHON_UNUSED PyObject *__pyx_v___pyx_state) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"__setstate_cython__\", 0);\n\n  /* \"(tree fragment)\":4\n *     raise TypeError(\"self._writer cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._writer cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n */\n  __pyx_t_1 = __Pyx_PyObject_Call(__pyx_builtin_TypeError, __pyx_tuple__98, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(1, 4, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __Pyx_Raise(__pyx_t_1, 0, 0, 0);\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  __PYX_ERR(1, 4, __pyx_L1_error)\n\n  /* \"(tree fragment)\":3\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._writer cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):             # <<<<<<<<<<<<<<\n *     raise TypeError(\"self._writer cannot be converted to a Python object for pickling\")\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst.FarWriter.__setstate_cython__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"pywrapfst.pyx\":4493\n * \n * @atexit.register\n * def _reset_fst_error_fatal():             # <<<<<<<<<<<<<<\n *   fst.FLAGS_fst_error_fatal = _fst_error_fatal_old\n * \n */\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_9pywrapfst_59_reset_fst_error_fatal(PyObject *__pyx_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic PyMethodDef __pyx_mdef_9pywrapfst_59_reset_fst_error_fatal = {\"_reset_fst_error_fatal\", (PyCFunction)__pyx_pw_9pywrapfst_59_reset_fst_error_fatal, METH_NOARGS, 0};\nstatic PyObject *__pyx_pw_9pywrapfst_59_reset_fst_error_fatal(PyObject *__pyx_self, CYTHON_UNUSED PyObject *unused) {\n  PyObject *__pyx_r = 0;\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"_reset_fst_error_fatal (wrapper)\", 0);\n  __pyx_r = __pyx_pf_9pywrapfst_58_reset_fst_error_fatal(__pyx_self);\n\n  /* function exit code */\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic PyObject *__pyx_pf_9pywrapfst_58_reset_fst_error_fatal(CYTHON_UNUSED PyObject *__pyx_self) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  bool __pyx_t_2;\n  __Pyx_RefNannySetupContext(\"_reset_fst_error_fatal\", 0);\n\n  /* \"pywrapfst.pyx\":4494\n * @atexit.register\n * def _reset_fst_error_fatal():\n *   fst.FLAGS_fst_error_fatal = _fst_error_fatal_old             # <<<<<<<<<<<<<<\n * \n */\n  __pyx_t_1 = __Pyx_GetModuleGlobalName(__pyx_n_s_fst_error_fatal_old); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4494, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_t_2 = __Pyx_PyObject_IsTrue(__pyx_t_1); if (unlikely((__pyx_t_2 == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 4494, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  FLAGS_fst_error_fatal = __pyx_t_2;\n\n  /* \"pywrapfst.pyx\":4493\n * \n * @atexit.register\n * def _reset_fst_error_fatal():             # <<<<<<<<<<<<<<\n *   fst.FLAGS_fst_error_fatal = _fst_error_fatal_old\n * \n */\n\n  /* function exit code */\n  __pyx_r = Py_None; __Pyx_INCREF(Py_None);\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"pywrapfst._reset_fst_error_fatal\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = NULL;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"string.from_py\":13\n * \n * @cname(\"__pyx_convert_string_from_py_std__in_string\")\n * cdef string __pyx_convert_string_from_py_std__in_string(object o) except *:             # <<<<<<<<<<<<<<\n *     cdef Py_ssize_t length\n *     cdef const char* data = __Pyx_PyObject_AsStringAndSize(o, &length)\n */\n\nstatic std::string __pyx_convert_string_from_py_std__in_string(PyObject *__pyx_v_o) {\n  Py_ssize_t __pyx_v_length;\n  char const *__pyx_v_data;\n  std::string __pyx_r;\n  __Pyx_RefNannyDeclarations\n  char const *__pyx_t_1;\n  __Pyx_RefNannySetupContext(\"__pyx_convert_string_from_py_std__in_string\", 0);\n\n  /* \"string.from_py\":15\n * cdef string __pyx_convert_string_from_py_std__in_string(object o) except *:\n *     cdef Py_ssize_t length\n *     cdef const char* data = __Pyx_PyObject_AsStringAndSize(o, &length)             # <<<<<<<<<<<<<<\n *     return string(data, length)\n * \n */\n  __pyx_t_1 = __Pyx_PyObject_AsStringAndSize(__pyx_v_o, (&__pyx_v_length)); if (unlikely(__pyx_t_1 == ((char const *)NULL))) __PYX_ERR(1, 15, __pyx_L1_error)\n  __pyx_v_data = __pyx_t_1;\n\n  /* \"string.from_py\":16\n *     cdef Py_ssize_t length\n *     cdef const char* data = __Pyx_PyObject_AsStringAndSize(o, &length)\n *     return string(data, length)             # <<<<<<<<<<<<<<\n * \n * \n */\n  __pyx_r = std::string(__pyx_v_data, __pyx_v_length);\n  goto __pyx_L0;\n\n  /* \"string.from_py\":13\n * \n * @cname(\"__pyx_convert_string_from_py_std__in_string\")\n * cdef string __pyx_convert_string_from_py_std__in_string(object o) except *:             # <<<<<<<<<<<<<<\n *     cdef Py_ssize_t length\n *     cdef const char* data = __Pyx_PyObject_AsStringAndSize(o, &length)\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_AddTraceback(\"string.from_py.__pyx_convert_string_from_py_std__in_string\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_pretend_to_initialize(&__pyx_r);\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"string.to_py\":31\n * \n * @cname(\"__pyx_convert_PyObject_string_to_py_std__in_string\")\n * cdef inline object __pyx_convert_PyObject_string_to_py_std__in_string(const string& s):             # <<<<<<<<<<<<<<\n *     return __Pyx_PyObject_FromStringAndSize(s.data(), s.size())\n * cdef extern from *:\n */\n\nstatic CYTHON_INLINE PyObject *__pyx_convert_PyObject_string_to_py_std__in_string(std::string const &__pyx_v_s) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"__pyx_convert_PyObject_string_to_py_std__in_string\", 0);\n\n  /* \"string.to_py\":32\n * @cname(\"__pyx_convert_PyObject_string_to_py_std__in_string\")\n * cdef inline object __pyx_convert_PyObject_string_to_py_std__in_string(const string& s):\n *     return __Pyx_PyObject_FromStringAndSize(s.data(), s.size())             # <<<<<<<<<<<<<<\n * cdef extern from *:\n *     cdef object __Pyx_PyUnicode_FromStringAndSize(const char*, size_t)\n */\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __Pyx_PyObject_FromStringAndSize(__pyx_v_s.data(), __pyx_v_s.size()); if (unlikely(!__pyx_t_1)) __PYX_ERR(1, 32, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* \"string.to_py\":31\n * \n * @cname(\"__pyx_convert_PyObject_string_to_py_std__in_string\")\n * cdef inline object __pyx_convert_PyObject_string_to_py_std__in_string(const string& s):             # <<<<<<<<<<<<<<\n *     return __Pyx_PyObject_FromStringAndSize(s.data(), s.size())\n * cdef extern from *:\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"string.to_py.__pyx_convert_PyObject_string_to_py_std__in_string\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"string.to_py\":37\n * \n * @cname(\"__pyx_convert_PyUnicode_string_to_py_std__in_string\")\n * cdef inline object __pyx_convert_PyUnicode_string_to_py_std__in_string(const string& s):             # <<<<<<<<<<<<<<\n *     return __Pyx_PyUnicode_FromStringAndSize(s.data(), s.size())\n * cdef extern from *:\n */\n\nstatic CYTHON_INLINE PyObject *__pyx_convert_PyUnicode_string_to_py_std__in_string(std::string const &__pyx_v_s) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"__pyx_convert_PyUnicode_string_to_py_std__in_string\", 0);\n\n  /* \"string.to_py\":38\n * @cname(\"__pyx_convert_PyUnicode_string_to_py_std__in_string\")\n * cdef inline object __pyx_convert_PyUnicode_string_to_py_std__in_string(const string& s):\n *     return __Pyx_PyUnicode_FromStringAndSize(s.data(), s.size())             # <<<<<<<<<<<<<<\n * cdef extern from *:\n *     cdef object __Pyx_PyStr_FromStringAndSize(const char*, size_t)\n */\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __Pyx_PyUnicode_FromStringAndSize(__pyx_v_s.data(), __pyx_v_s.size()); if (unlikely(!__pyx_t_1)) __PYX_ERR(1, 38, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* \"string.to_py\":37\n * \n * @cname(\"__pyx_convert_PyUnicode_string_to_py_std__in_string\")\n * cdef inline object __pyx_convert_PyUnicode_string_to_py_std__in_string(const string& s):             # <<<<<<<<<<<<<<\n *     return __Pyx_PyUnicode_FromStringAndSize(s.data(), s.size())\n * cdef extern from *:\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"string.to_py.__pyx_convert_PyUnicode_string_to_py_std__in_string\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"string.to_py\":43\n * \n * @cname(\"__pyx_convert_PyStr_string_to_py_std__in_string\")\n * cdef inline object __pyx_convert_PyStr_string_to_py_std__in_string(const string& s):             # <<<<<<<<<<<<<<\n *     return __Pyx_PyStr_FromStringAndSize(s.data(), s.size())\n * cdef extern from *:\n */\n\nstatic CYTHON_INLINE PyObject *__pyx_convert_PyStr_string_to_py_std__in_string(std::string const &__pyx_v_s) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"__pyx_convert_PyStr_string_to_py_std__in_string\", 0);\n\n  /* \"string.to_py\":44\n * @cname(\"__pyx_convert_PyStr_string_to_py_std__in_string\")\n * cdef inline object __pyx_convert_PyStr_string_to_py_std__in_string(const string& s):\n *     return __Pyx_PyStr_FromStringAndSize(s.data(), s.size())             # <<<<<<<<<<<<<<\n * cdef extern from *:\n *     cdef object __Pyx_PyBytes_FromStringAndSize(const char*, size_t)\n */\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __Pyx_PyStr_FromStringAndSize(__pyx_v_s.data(), __pyx_v_s.size()); if (unlikely(!__pyx_t_1)) __PYX_ERR(1, 44, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* \"string.to_py\":43\n * \n * @cname(\"__pyx_convert_PyStr_string_to_py_std__in_string\")\n * cdef inline object __pyx_convert_PyStr_string_to_py_std__in_string(const string& s):             # <<<<<<<<<<<<<<\n *     return __Pyx_PyStr_FromStringAndSize(s.data(), s.size())\n * cdef extern from *:\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"string.to_py.__pyx_convert_PyStr_string_to_py_std__in_string\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"string.to_py\":49\n * \n * @cname(\"__pyx_convert_PyBytes_string_to_py_std__in_string\")\n * cdef inline object __pyx_convert_PyBytes_string_to_py_std__in_string(const string& s):             # <<<<<<<<<<<<<<\n *     return __Pyx_PyBytes_FromStringAndSize(s.data(), s.size())\n * cdef extern from *:\n */\n\nstatic CYTHON_INLINE PyObject *__pyx_convert_PyBytes_string_to_py_std__in_string(std::string const &__pyx_v_s) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"__pyx_convert_PyBytes_string_to_py_std__in_string\", 0);\n\n  /* \"string.to_py\":50\n * @cname(\"__pyx_convert_PyBytes_string_to_py_std__in_string\")\n * cdef inline object __pyx_convert_PyBytes_string_to_py_std__in_string(const string& s):\n *     return __Pyx_PyBytes_FromStringAndSize(s.data(), s.size())             # <<<<<<<<<<<<<<\n * cdef extern from *:\n *     cdef object __Pyx_PyByteArray_FromStringAndSize(const char*, size_t)\n */\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __Pyx_PyBytes_FromStringAndSize(__pyx_v_s.data(), __pyx_v_s.size()); if (unlikely(!__pyx_t_1)) __PYX_ERR(1, 50, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* \"string.to_py\":49\n * \n * @cname(\"__pyx_convert_PyBytes_string_to_py_std__in_string\")\n * cdef inline object __pyx_convert_PyBytes_string_to_py_std__in_string(const string& s):             # <<<<<<<<<<<<<<\n *     return __Pyx_PyBytes_FromStringAndSize(s.data(), s.size())\n * cdef extern from *:\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"string.to_py.__pyx_convert_PyBytes_string_to_py_std__in_string\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"string.to_py\":55\n * \n * @cname(\"__pyx_convert_PyByteArray_string_to_py_std__in_string\")\n * cdef inline object __pyx_convert_PyByteArray_string_to_py_std__in_string(const string& s):             # <<<<<<<<<<<<<<\n *     return __Pyx_PyByteArray_FromStringAndSize(s.data(), s.size())\n * \n */\n\nstatic CYTHON_INLINE PyObject *__pyx_convert_PyByteArray_string_to_py_std__in_string(std::string const &__pyx_v_s) {\n  PyObject *__pyx_r = NULL;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  __Pyx_RefNannySetupContext(\"__pyx_convert_PyByteArray_string_to_py_std__in_string\", 0);\n\n  /* \"string.to_py\":56\n * @cname(\"__pyx_convert_PyByteArray_string_to_py_std__in_string\")\n * cdef inline object __pyx_convert_PyByteArray_string_to_py_std__in_string(const string& s):\n *     return __Pyx_PyByteArray_FromStringAndSize(s.data(), s.size())             # <<<<<<<<<<<<<<\n * \n */\n  __Pyx_XDECREF(__pyx_r);\n  __pyx_t_1 = __Pyx_PyByteArray_FromStringAndSize(__pyx_v_s.data(), __pyx_v_s.size()); if (unlikely(!__pyx_t_1)) __PYX_ERR(1, 56, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_r = __pyx_t_1;\n  __pyx_t_1 = 0;\n  goto __pyx_L0;\n\n  /* \"string.to_py\":55\n * \n * @cname(\"__pyx_convert_PyByteArray_string_to_py_std__in_string\")\n * cdef inline object __pyx_convert_PyByteArray_string_to_py_std__in_string(const string& s):             # <<<<<<<<<<<<<<\n *     return __Pyx_PyByteArray_FromStringAndSize(s.data(), s.size())\n * \n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_AddTraceback(\"string.to_py.__pyx_convert_PyByteArray_string_to_py_std__in_string\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __pyx_r = 0;\n  __pyx_L0:;\n  __Pyx_XGIVEREF(__pyx_r);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\n/* \"vector.from_py\":45\n * \n * @cname(\"__pyx_convert_vector_from_py___pyx_t_10basictypes_int64\")\n * cdef vector[X] __pyx_convert_vector_from_py___pyx_t_10basictypes_int64(object o) except *:             # <<<<<<<<<<<<<<\n *     cdef vector[X] v\n *     for item in o:\n */\n\nstatic std::vector<__pyx_t_10basictypes_int64>  __pyx_convert_vector_from_py___pyx_t_10basictypes_int64(PyObject *__pyx_v_o) {\n  std::vector<__pyx_t_10basictypes_int64>  __pyx_v_v;\n  PyObject *__pyx_v_item = NULL;\n  std::vector<__pyx_t_10basictypes_int64>  __pyx_r;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  Py_ssize_t __pyx_t_2;\n  PyObject *(*__pyx_t_3)(PyObject *);\n  PyObject *__pyx_t_4 = NULL;\n  __pyx_t_10basictypes_int64 __pyx_t_5;\n  __Pyx_RefNannySetupContext(\"__pyx_convert_vector_from_py___pyx_t_10basictypes_int64\", 0);\n\n  /* \"vector.from_py\":47\n * cdef vector[X] __pyx_convert_vector_from_py___pyx_t_10basictypes_int64(object o) except *:\n *     cdef vector[X] v\n *     for item in o:             # <<<<<<<<<<<<<<\n *         v.push_back(<X>item)\n *     return v\n */\n  if (likely(PyList_CheckExact(__pyx_v_o)) || PyTuple_CheckExact(__pyx_v_o)) {\n    __pyx_t_1 = __pyx_v_o; __Pyx_INCREF(__pyx_t_1); __pyx_t_2 = 0;\n    __pyx_t_3 = NULL;\n  } else {\n    __pyx_t_2 = -1; __pyx_t_1 = PyObject_GetIter(__pyx_v_o); if (unlikely(!__pyx_t_1)) __PYX_ERR(1, 47, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    __pyx_t_3 = Py_TYPE(__pyx_t_1)->tp_iternext; if (unlikely(!__pyx_t_3)) __PYX_ERR(1, 47, __pyx_L1_error)\n  }\n  for (;;) {\n    if (likely(!__pyx_t_3)) {\n      if (likely(PyList_CheckExact(__pyx_t_1))) {\n        if (__pyx_t_2 >= PyList_GET_SIZE(__pyx_t_1)) break;\n        #if CYTHON_ASSUME_SAFE_MACROS && !CYTHON_AVOID_BORROWED_REFS\n        __pyx_t_4 = PyList_GET_ITEM(__pyx_t_1, __pyx_t_2); __Pyx_INCREF(__pyx_t_4); __pyx_t_2++; if (unlikely(0 < 0)) __PYX_ERR(1, 47, __pyx_L1_error)\n        #else\n        __pyx_t_4 = PySequence_ITEM(__pyx_t_1, __pyx_t_2); __pyx_t_2++; if (unlikely(!__pyx_t_4)) __PYX_ERR(1, 47, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_4);\n        #endif\n      } else {\n        if (__pyx_t_2 >= PyTuple_GET_SIZE(__pyx_t_1)) break;\n        #if CYTHON_ASSUME_SAFE_MACROS && !CYTHON_AVOID_BORROWED_REFS\n        __pyx_t_4 = PyTuple_GET_ITEM(__pyx_t_1, __pyx_t_2); __Pyx_INCREF(__pyx_t_4); __pyx_t_2++; if (unlikely(0 < 0)) __PYX_ERR(1, 47, __pyx_L1_error)\n        #else\n        __pyx_t_4 = PySequence_ITEM(__pyx_t_1, __pyx_t_2); __pyx_t_2++; if (unlikely(!__pyx_t_4)) __PYX_ERR(1, 47, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_4);\n        #endif\n      }\n    } else {\n      __pyx_t_4 = __pyx_t_3(__pyx_t_1);\n      if (unlikely(!__pyx_t_4)) {\n        PyObject* exc_type = PyErr_Occurred();\n        if (exc_type) {\n          if (likely(__Pyx_PyErr_GivenExceptionMatches(exc_type, PyExc_StopIteration))) PyErr_Clear();\n          else __PYX_ERR(1, 47, __pyx_L1_error)\n        }\n        break;\n      }\n      __Pyx_GOTREF(__pyx_t_4);\n    }\n    __Pyx_XDECREF_SET(__pyx_v_item, __pyx_t_4);\n    __pyx_t_4 = 0;\n\n    /* \"vector.from_py\":48\n *     cdef vector[X] v\n *     for item in o:\n *         v.push_back(<X>item)             # <<<<<<<<<<<<<<\n *     return v\n * \n */\n    __pyx_t_5 = __Pyx_PyInt_As_int64_t(__pyx_v_item); if (unlikely((__pyx_t_5 == ((int64_t)-1)) && PyErr_Occurred())) __PYX_ERR(1, 48, __pyx_L1_error)\n    __pyx_v_v.push_back(((__pyx_t_10basictypes_int64)__pyx_t_5));\n\n    /* \"vector.from_py\":47\n * cdef vector[X] __pyx_convert_vector_from_py___pyx_t_10basictypes_int64(object o) except *:\n *     cdef vector[X] v\n *     for item in o:             # <<<<<<<<<<<<<<\n *         v.push_back(<X>item)\n *     return v\n */\n  }\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"vector.from_py\":49\n *     for item in o:\n *         v.push_back(<X>item)\n *     return v             # <<<<<<<<<<<<<<\n * \n * \n */\n  __pyx_r = __pyx_v_v;\n  goto __pyx_L0;\n\n  /* \"vector.from_py\":45\n * \n * @cname(\"__pyx_convert_vector_from_py___pyx_t_10basictypes_int64\")\n * cdef vector[X] __pyx_convert_vector_from_py___pyx_t_10basictypes_int64(object o) except *:             # <<<<<<<<<<<<<<\n *     cdef vector[X] v\n *     for item in o:\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_AddTraceback(\"vector.from_py.__pyx_convert_vector_from_py___pyx_t_10basictypes_int64\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_pretend_to_initialize(&__pyx_r);\n  __pyx_L0:;\n  __Pyx_XDECREF(__pyx_v_item);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\n\nstatic std::vector<std::string>  __pyx_convert_vector_from_py_std_3a__3a_string(PyObject *__pyx_v_o) {\n  std::vector<std::string>  __pyx_v_v;\n  PyObject *__pyx_v_item = NULL;\n  std::vector<std::string>  __pyx_r;\n  __Pyx_RefNannyDeclarations\n  PyObject *__pyx_t_1 = NULL;\n  Py_ssize_t __pyx_t_2;\n  PyObject *(*__pyx_t_3)(PyObject *);\n  PyObject *__pyx_t_4 = NULL;\n  std::string __pyx_t_5;\n  __Pyx_RefNannySetupContext(\"__pyx_convert_vector_from_py_std_3a__3a_string\", 0);\n\n  /* \"vector.from_py\":47\n * cdef vector[X] __pyx_convert_vector_from_py_std_3a__3a_string(object o) except *:\n *     cdef vector[X] v\n *     for item in o:             # <<<<<<<<<<<<<<\n *         v.push_back(<X>item)\n *     return v\n */\n  if (likely(PyList_CheckExact(__pyx_v_o)) || PyTuple_CheckExact(__pyx_v_o)) {\n    __pyx_t_1 = __pyx_v_o; __Pyx_INCREF(__pyx_t_1); __pyx_t_2 = 0;\n    __pyx_t_3 = NULL;\n  } else {\n    __pyx_t_2 = -1; __pyx_t_1 = PyObject_GetIter(__pyx_v_o); if (unlikely(!__pyx_t_1)) __PYX_ERR(1, 47, __pyx_L1_error)\n    __Pyx_GOTREF(__pyx_t_1);\n    __pyx_t_3 = Py_TYPE(__pyx_t_1)->tp_iternext; if (unlikely(!__pyx_t_3)) __PYX_ERR(1, 47, __pyx_L1_error)\n  }\n  for (;;) {\n    if (likely(!__pyx_t_3)) {\n      if (likely(PyList_CheckExact(__pyx_t_1))) {\n        if (__pyx_t_2 >= PyList_GET_SIZE(__pyx_t_1)) break;\n        #if CYTHON_ASSUME_SAFE_MACROS && !CYTHON_AVOID_BORROWED_REFS\n        __pyx_t_4 = PyList_GET_ITEM(__pyx_t_1, __pyx_t_2); __Pyx_INCREF(__pyx_t_4); __pyx_t_2++; if (unlikely(0 < 0)) __PYX_ERR(1, 47, __pyx_L1_error)\n        #else\n        __pyx_t_4 = PySequence_ITEM(__pyx_t_1, __pyx_t_2); __pyx_t_2++; if (unlikely(!__pyx_t_4)) __PYX_ERR(1, 47, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_4);\n        #endif\n      } else {\n        if (__pyx_t_2 >= PyTuple_GET_SIZE(__pyx_t_1)) break;\n        #if CYTHON_ASSUME_SAFE_MACROS && !CYTHON_AVOID_BORROWED_REFS\n        __pyx_t_4 = PyTuple_GET_ITEM(__pyx_t_1, __pyx_t_2); __Pyx_INCREF(__pyx_t_4); __pyx_t_2++; if (unlikely(0 < 0)) __PYX_ERR(1, 47, __pyx_L1_error)\n        #else\n        __pyx_t_4 = PySequence_ITEM(__pyx_t_1, __pyx_t_2); __pyx_t_2++; if (unlikely(!__pyx_t_4)) __PYX_ERR(1, 47, __pyx_L1_error)\n        __Pyx_GOTREF(__pyx_t_4);\n        #endif\n      }\n    } else {\n      __pyx_t_4 = __pyx_t_3(__pyx_t_1);\n      if (unlikely(!__pyx_t_4)) {\n        PyObject* exc_type = PyErr_Occurred();\n        if (exc_type) {\n          if (likely(__Pyx_PyErr_GivenExceptionMatches(exc_type, PyExc_StopIteration))) PyErr_Clear();\n          else __PYX_ERR(1, 47, __pyx_L1_error)\n        }\n        break;\n      }\n      __Pyx_GOTREF(__pyx_t_4);\n    }\n    __Pyx_XDECREF_SET(__pyx_v_item, __pyx_t_4);\n    __pyx_t_4 = 0;\n\n    /* \"vector.from_py\":48\n *     cdef vector[X] v\n *     for item in o:\n *         v.push_back(<X>item)             # <<<<<<<<<<<<<<\n *     return v\n * \n */\n    __pyx_t_5 = __pyx_convert_string_from_py_std__in_string(__pyx_v_item); if (unlikely(PyErr_Occurred())) __PYX_ERR(1, 48, __pyx_L1_error)\n    __pyx_v_v.push_back(((std::string)__pyx_t_5));\n\n    /* \"vector.from_py\":47\n * cdef vector[X] __pyx_convert_vector_from_py_std_3a__3a_string(object o) except *:\n *     cdef vector[X] v\n *     for item in o:             # <<<<<<<<<<<<<<\n *         v.push_back(<X>item)\n *     return v\n */\n  }\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"vector.from_py\":49\n *     for item in o:\n *         v.push_back(<X>item)\n *     return v             # <<<<<<<<<<<<<<\n * \n * \n */\n  __pyx_r = __pyx_v_v;\n  goto __pyx_L0;\n\n  /* \"vector.from_py\":45\n * \n * @cname(\"__pyx_convert_vector_from_py_std_3a__3a_string\")\n * cdef vector[X] __pyx_convert_vector_from_py_std_3a__3a_string(object o) except *:             # <<<<<<<<<<<<<<\n *     cdef vector[X] v\n *     for item in o:\n */\n\n  /* function exit code */\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_4);\n  __Pyx_AddTraceback(\"vector.from_py.__pyx_convert_vector_from_py_std_3a__3a_string\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n  __Pyx_pretend_to_initialize(&__pyx_r);\n  __pyx_L0:;\n  __Pyx_XDECREF(__pyx_v_item);\n  __Pyx_RefNannyFinishContext();\n  return __pyx_r;\n}\nstatic struct __pyx_vtabstruct_9pywrapfst_Weight __pyx_vtable_9pywrapfst_Weight;\n\nstatic PyObject *__pyx_tp_new_9pywrapfst_Weight(PyTypeObject *t, CYTHON_UNUSED PyObject *a, CYTHON_UNUSED PyObject *k) {\n  struct __pyx_obj_9pywrapfst_Weight *p;\n  PyObject *o;\n  if (likely((t->tp_flags & Py_TPFLAGS_IS_ABSTRACT) == 0)) {\n    o = (*t->tp_alloc)(t, 0);\n  } else {\n    o = (PyObject *) PyBaseObject_Type.tp_new(t, __pyx_empty_tuple, 0);\n  }\n  if (unlikely(!o)) return 0;\n  p = ((struct __pyx_obj_9pywrapfst_Weight *)o);\n  p->__pyx_vtab = __pyx_vtabptr_9pywrapfst_Weight;\n  new((void*)&(p->_weight)) std::unique_ptr<fst::script::WeightClass> ();\n  return o;\n}\n\nstatic void __pyx_tp_dealloc_9pywrapfst_Weight(PyObject *o) {\n  struct __pyx_obj_9pywrapfst_Weight *p = (struct __pyx_obj_9pywrapfst_Weight *)o;\n  #if CYTHON_USE_TP_FINALIZE\n  if (unlikely(PyType_HasFeature(Py_TYPE(o), Py_TPFLAGS_HAVE_FINALIZE) && Py_TYPE(o)->tp_finalize) && (!PyType_IS_GC(Py_TYPE(o)) || !_PyGC_FINALIZED(o))) {\n    if (PyObject_CallFinalizerFromDealloc(o)) return;\n  }\n  #endif\n  __Pyx_call_destructor(p->_weight);\n  (*Py_TYPE(o)->tp_free)(o);\n}\n\nstatic PyObject *__pyx_tp_richcompare_9pywrapfst_Weight(PyObject *o1, PyObject *o2, int op) {\n  switch (op) {\n    case Py_EQ: {\n      return __pyx_pw_9pywrapfst_6Weight_17__eq__(o1, o2);\n    }\n    case Py_NE: {\n      return __pyx_pw_9pywrapfst_6Weight_19__ne__(o1, o2);\n    }\n    default: {\n      return __Pyx_NewRef(Py_NotImplemented);\n    }\n  }\n}\n\nstatic PyMethodDef __pyx_methods_9pywrapfst_Weight[] = {\n  {\"copy\", (PyCFunction)__pyx_pw_9pywrapfst_6Weight_9copy, METH_NOARGS, __pyx_doc_9pywrapfst_6Weight_8copy},\n  {\"Zero\", (PyCFunction)__pyx_pw_9pywrapfst_6Weight_11Zero, METH_O, __pyx_doc_9pywrapfst_6Weight_10Zero},\n  {\"One\", (PyCFunction)__pyx_pw_9pywrapfst_6Weight_13One, METH_O, __pyx_doc_9pywrapfst_6Weight_12One},\n  {\"NoWeight\", (PyCFunction)__pyx_pw_9pywrapfst_6Weight_15NoWeight, METH_O, __pyx_doc_9pywrapfst_6Weight_14NoWeight},\n  {\"to_string\", (PyCFunction)__pyx_pw_9pywrapfst_6Weight_21to_string, METH_NOARGS, 0},\n  {\"type\", (PyCFunction)__pyx_pw_9pywrapfst_6Weight_23type, METH_NOARGS, __pyx_doc_9pywrapfst_6Weight_22type},\n  {\"__reduce_cython__\", (PyCFunction)__pyx_pw_9pywrapfst_6Weight_25__reduce_cython__, METH_NOARGS, 0},\n  {\"__setstate_cython__\", (PyCFunction)__pyx_pw_9pywrapfst_6Weight_27__setstate_cython__, METH_O, 0},\n  {0, 0, 0, 0}\n};\n\nstatic PyNumberMethods __pyx_tp_as_number_Weight = {\n  0, /*nb_add*/\n  0, /*nb_subtract*/\n  0, /*nb_multiply*/\n  #if PY_MAJOR_VERSION < 3 || (CYTHON_COMPILING_IN_PYPY && PY_VERSION_HEX < 0x03050000)\n  0, /*nb_divide*/\n  #endif\n  0, /*nb_remainder*/\n  0, /*nb_divmod*/\n  0, /*nb_power*/\n  0, /*nb_negative*/\n  0, /*nb_positive*/\n  0, /*nb_absolute*/\n  0, /*nb_nonzero*/\n  0, /*nb_invert*/\n  0, /*nb_lshift*/\n  0, /*nb_rshift*/\n  0, /*nb_and*/\n  0, /*nb_xor*/\n  0, /*nb_or*/\n  #if PY_MAJOR_VERSION < 3 || (CYTHON_COMPILING_IN_PYPY && PY_VERSION_HEX < 0x03050000)\n  0, /*nb_coerce*/\n  #endif\n  0, /*nb_int*/\n  #if PY_MAJOR_VERSION < 3\n  0, /*nb_long*/\n  #else\n  0, /*reserved*/\n  #endif\n  __pyx_pw_9pywrapfst_6Weight_5__float__, /*nb_float*/\n  #if PY_MAJOR_VERSION < 3 || (CYTHON_COMPILING_IN_PYPY && PY_VERSION_HEX < 0x03050000)\n  0, /*nb_oct*/\n  #endif\n  #if PY_MAJOR_VERSION < 3 || (CYTHON_COMPILING_IN_PYPY && PY_VERSION_HEX < 0x03050000)\n  0, /*nb_hex*/\n  #endif\n  0, /*nb_inplace_add*/\n  0, /*nb_inplace_subtract*/\n  0, /*nb_inplace_multiply*/\n  #if PY_MAJOR_VERSION < 3 || (CYTHON_COMPILING_IN_PYPY && PY_VERSION_HEX < 0x03050000)\n  0, /*nb_inplace_divide*/\n  #endif\n  0, /*nb_inplace_remainder*/\n  0, /*nb_inplace_power*/\n  0, /*nb_inplace_lshift*/\n  0, /*nb_inplace_rshift*/\n  0, /*nb_inplace_and*/\n  0, /*nb_inplace_xor*/\n  0, /*nb_inplace_or*/\n  0, /*nb_floor_divide*/\n  0, /*nb_true_divide*/\n  0, /*nb_inplace_floor_divide*/\n  0, /*nb_inplace_true_divide*/\n  0, /*nb_index*/\n  #if PY_VERSION_HEX >= 0x03050000\n  0, /*nb_matrix_multiply*/\n  #endif\n  #if PY_VERSION_HEX >= 0x03050000\n  0, /*nb_inplace_matrix_multiply*/\n  #endif\n};\n\nstatic PyTypeObject __pyx_type_9pywrapfst_Weight = {\n  PyVarObject_HEAD_INIT(0, 0)\n  \"pywrapfst.Weight\", /*tp_name*/\n  sizeof(struct __pyx_obj_9pywrapfst_Weight), /*tp_basicsize*/\n  0, /*tp_itemsize*/\n  __pyx_tp_dealloc_9pywrapfst_Weight, /*tp_dealloc*/\n  0, /*tp_print*/\n  0, /*tp_getattr*/\n  0, /*tp_setattr*/\n  #if PY_MAJOR_VERSION < 3\n  0, /*tp_compare*/\n  #endif\n  #if PY_MAJOR_VERSION >= 3\n  0, /*tp_as_async*/\n  #endif\n  __pyx_pw_9pywrapfst_6Weight_1__repr__, /*tp_repr*/\n  &__pyx_tp_as_number_Weight, /*tp_as_number*/\n  0, /*tp_as_sequence*/\n  0, /*tp_as_mapping*/\n  0, /*tp_hash*/\n  0, /*tp_call*/\n  __pyx_pw_9pywrapfst_6Weight_3__str__, /*tp_str*/\n  0, /*tp_getattro*/\n  0, /*tp_setattro*/\n  0, /*tp_as_buffer*/\n  Py_TPFLAGS_DEFAULT|Py_TPFLAGS_HAVE_VERSION_TAG|Py_TPFLAGS_CHECKTYPES|Py_TPFLAGS_HAVE_NEWBUFFER|Py_TPFLAGS_BASETYPE, /*tp_flags*/\n  \"\\n  Weight(weight_type, weight_string)\\n\\n  FST weight class.\\n\\n  This class represents an FST weight. When passed as an argument to an FST\\n  operation, it should have the weight type of the input FST(s) to said\\n  operation.\\n\\n  Args:\\n    weight_type: A string indicating the weight type.\\n    weight_string: A string indicating the underlying weight.\\n\\n  Raises:\\n    FstArgError: Weight type not found.\\n    FstBadWeightError: Invalid weight.\\n  \", /*tp_doc*/\n  0, /*tp_traverse*/\n  0, /*tp_clear*/\n  __pyx_tp_richcompare_9pywrapfst_Weight, /*tp_richcompare*/\n  0, /*tp_weaklistoffset*/\n  0, /*tp_iter*/\n  0, /*tp_iternext*/\n  __pyx_methods_9pywrapfst_Weight, /*tp_methods*/\n  0, /*tp_members*/\n  0, /*tp_getset*/\n  0, /*tp_base*/\n  0, /*tp_dict*/\n  0, /*tp_descr_get*/\n  0, /*tp_descr_set*/\n  0, /*tp_dictoffset*/\n  __pyx_pw_9pywrapfst_6Weight_7__init__, /*tp_init*/\n  0, /*tp_alloc*/\n  __pyx_tp_new_9pywrapfst_Weight, /*tp_new*/\n  0, /*tp_free*/\n  0, /*tp_is_gc*/\n  0, /*tp_bases*/\n  0, /*tp_mro*/\n  0, /*tp_cache*/\n  0, /*tp_subclasses*/\n  0, /*tp_weaklist*/\n  0, /*tp_del*/\n  0, /*tp_version_tag*/\n  #if PY_VERSION_HEX >= 0x030400a1\n  0, /*tp_finalize*/\n  #endif\n};\nstatic struct __pyx_vtabstruct_9pywrapfst__SymbolTable __pyx_vtable_9pywrapfst__SymbolTable;\n\nstatic PyObject *__pyx_tp_new_9pywrapfst__SymbolTable(PyTypeObject *t, CYTHON_UNUSED PyObject *a, CYTHON_UNUSED PyObject *k) {\n  struct __pyx_obj_9pywrapfst__SymbolTable *p;\n  PyObject *o;\n  if (likely((t->tp_flags & Py_TPFLAGS_IS_ABSTRACT) == 0)) {\n    o = (*t->tp_alloc)(t, 0);\n  } else {\n    o = (PyObject *) PyBaseObject_Type.tp_new(t, __pyx_empty_tuple, 0);\n  }\n  if (unlikely(!o)) return 0;\n  p = ((struct __pyx_obj_9pywrapfst__SymbolTable *)o);\n  p->__pyx_vtab = __pyx_vtabptr_9pywrapfst__SymbolTable;\n  return o;\n}\n\nstatic void __pyx_tp_dealloc_9pywrapfst__SymbolTable(PyObject *o) {\n  #if CYTHON_USE_TP_FINALIZE\n  if (unlikely(PyType_HasFeature(Py_TYPE(o), Py_TPFLAGS_HAVE_FINALIZE) && Py_TYPE(o)->tp_finalize) && (!PyType_IS_GC(Py_TYPE(o)) || !_PyGC_FINALIZED(o))) {\n    if (PyObject_CallFinalizerFromDealloc(o)) return;\n  }\n  #endif\n  (*Py_TYPE(o)->tp_free)(o);\n}\n\nstatic PyMethodDef __pyx_methods_9pywrapfst__SymbolTable[] = {\n  {\"available_key\", (PyCFunction)__pyx_pw_9pywrapfst_12_SymbolTable_5available_key, METH_NOARGS, __pyx_doc_9pywrapfst_12_SymbolTable_4available_key},\n  {\"checksum\", (PyCFunction)__pyx_pw_9pywrapfst_12_SymbolTable_7checksum, METH_NOARGS, __pyx_doc_9pywrapfst_12_SymbolTable_6checksum},\n  {\"copy\", (PyCFunction)__pyx_pw_9pywrapfst_12_SymbolTable_9copy, METH_NOARGS, __pyx_doc_9pywrapfst_12_SymbolTable_8copy},\n  {\"find\", (PyCFunction)__pyx_pw_9pywrapfst_12_SymbolTable_11find, METH_O, __pyx_doc_9pywrapfst_12_SymbolTable_10find},\n  {\"get_nth_key\", (PyCFunction)__pyx_pw_9pywrapfst_12_SymbolTable_13get_nth_key, METH_O, __pyx_doc_9pywrapfst_12_SymbolTable_12get_nth_key},\n  {\"labeled_checksum\", (PyCFunction)__pyx_pw_9pywrapfst_12_SymbolTable_15labeled_checksum, METH_NOARGS, __pyx_doc_9pywrapfst_12_SymbolTable_14labeled_checksum},\n  {\"member\", (PyCFunction)__pyx_pw_9pywrapfst_12_SymbolTable_17member, METH_O, __pyx_doc_9pywrapfst_12_SymbolTable_16member},\n  {\"name\", (PyCFunction)__pyx_pw_9pywrapfst_12_SymbolTable_21name, METH_NOARGS, __pyx_doc_9pywrapfst_12_SymbolTable_20name},\n  {\"num_symbols\", (PyCFunction)__pyx_pw_9pywrapfst_12_SymbolTable_23num_symbols, METH_NOARGS, __pyx_doc_9pywrapfst_12_SymbolTable_22num_symbols},\n  {\"write\", (PyCFunction)__pyx_pw_9pywrapfst_12_SymbolTable_25write, METH_O, __pyx_doc_9pywrapfst_12_SymbolTable_24write},\n  {\"write_text\", (PyCFunction)__pyx_pw_9pywrapfst_12_SymbolTable_27write_text, METH_O, __pyx_doc_9pywrapfst_12_SymbolTable_26write_text},\n  {\"__reduce_cython__\", (PyCFunction)__pyx_pw_9pywrapfst_12_SymbolTable_29__reduce_cython__, METH_NOARGS, 0},\n  {\"__setstate_cython__\", (PyCFunction)__pyx_pw_9pywrapfst_12_SymbolTable_31__setstate_cython__, METH_O, 0},\n  {0, 0, 0, 0}\n};\n\nstatic PySequenceMethods __pyx_tp_as_sequence__SymbolTable = {\n  0, /*sq_length*/\n  0, /*sq_concat*/\n  0, /*sq_repeat*/\n  0, /*sq_item*/\n  0, /*sq_slice*/\n  0, /*sq_ass_item*/\n  0, /*sq_ass_slice*/\n  __pyx_pw_9pywrapfst_12_SymbolTable_19__contains__, /*sq_contains*/\n  0, /*sq_inplace_concat*/\n  0, /*sq_inplace_repeat*/\n};\n\nstatic PyTypeObject __pyx_type_9pywrapfst__SymbolTable = {\n  PyVarObject_HEAD_INIT(0, 0)\n  \"pywrapfst._SymbolTable\", /*tp_name*/\n  sizeof(struct __pyx_obj_9pywrapfst__SymbolTable), /*tp_basicsize*/\n  0, /*tp_itemsize*/\n  __pyx_tp_dealloc_9pywrapfst__SymbolTable, /*tp_dealloc*/\n  0, /*tp_print*/\n  0, /*tp_getattr*/\n  0, /*tp_setattr*/\n  #if PY_MAJOR_VERSION < 3\n  0, /*tp_compare*/\n  #endif\n  #if PY_MAJOR_VERSION >= 3\n  0, /*tp_as_async*/\n  #endif\n  0, /*tp_repr*/\n  0, /*tp_as_number*/\n  &__pyx_tp_as_sequence__SymbolTable, /*tp_as_sequence*/\n  0, /*tp_as_mapping*/\n  0, /*tp_hash*/\n  0, /*tp_call*/\n  0, /*tp_str*/\n  0, /*tp_getattro*/\n  0, /*tp_setattro*/\n  0, /*tp_as_buffer*/\n  Py_TPFLAGS_DEFAULT|Py_TPFLAGS_HAVE_VERSION_TAG|Py_TPFLAGS_CHECKTYPES|Py_TPFLAGS_HAVE_NEWBUFFER|Py_TPFLAGS_BASETYPE, /*tp_flags*/\n  \"\\n  (No constructor.)\\n\\n  Base class for the symbol table hierarchy.\\n\\n  This class is the base class for SymbolTable. It has a \\\"deleted\\\" constructor\\n  and implementations for the const methods of the wrapped SymbolTable.\\n  \", /*tp_doc*/\n  0, /*tp_traverse*/\n  0, /*tp_clear*/\n  0, /*tp_richcompare*/\n  0, /*tp_weaklistoffset*/\n  __pyx_pw_9pywrapfst_12_SymbolTable_3__iter__, /*tp_iter*/\n  0, /*tp_iternext*/\n  __pyx_methods_9pywrapfst__SymbolTable, /*tp_methods*/\n  0, /*tp_members*/\n  0, /*tp_getset*/\n  0, /*tp_base*/\n  0, /*tp_dict*/\n  0, /*tp_descr_get*/\n  0, /*tp_descr_set*/\n  0, /*tp_dictoffset*/\n  __pyx_pw_9pywrapfst_12_SymbolTable_1__init__, /*tp_init*/\n  0, /*tp_alloc*/\n  __pyx_tp_new_9pywrapfst__SymbolTable, /*tp_new*/\n  0, /*tp_free*/\n  0, /*tp_is_gc*/\n  0, /*tp_bases*/\n  0, /*tp_mro*/\n  0, /*tp_cache*/\n  0, /*tp_subclasses*/\n  0, /*tp_weaklist*/\n  0, /*tp_del*/\n  0, /*tp_version_tag*/\n  #if PY_VERSION_HEX >= 0x030400a1\n  0, /*tp_finalize*/\n  #endif\n};\nstatic struct __pyx_vtabstruct_9pywrapfst__EncodeMapperSymbolTable __pyx_vtable_9pywrapfst__EncodeMapperSymbolTable;\n\nstatic PyObject *__pyx_tp_new_9pywrapfst__EncodeMapperSymbolTable(PyTypeObject *t, PyObject *a, PyObject *k) {\n  struct __pyx_obj_9pywrapfst__EncodeMapperSymbolTable *p;\n  PyObject *o = __pyx_tp_new_9pywrapfst__SymbolTable(t, a, k);\n  if (unlikely(!o)) return 0;\n  p = ((struct __pyx_obj_9pywrapfst__EncodeMapperSymbolTable *)o);\n  p->__pyx_base.__pyx_vtab = (struct __pyx_vtabstruct_9pywrapfst__SymbolTable*)__pyx_vtabptr_9pywrapfst__EncodeMapperSymbolTable;\n  new((void*)&(p->_encoder)) std::shared_ptr<fst::script::EncodeMapperClass> ();\n  return o;\n}\n\nstatic void __pyx_tp_dealloc_9pywrapfst__EncodeMapperSymbolTable(PyObject *o) {\n  struct __pyx_obj_9pywrapfst__EncodeMapperSymbolTable *p = (struct __pyx_obj_9pywrapfst__EncodeMapperSymbolTable *)o;\n  #if CYTHON_USE_TP_FINALIZE\n  if (unlikely(PyType_HasFeature(Py_TYPE(o), Py_TPFLAGS_HAVE_FINALIZE) && Py_TYPE(o)->tp_finalize) && (!PyType_IS_GC(Py_TYPE(o)) || !_PyGC_FINALIZED(o))) {\n    if (PyObject_CallFinalizerFromDealloc(o)) return;\n  }\n  #endif\n  __Pyx_call_destructor(p->_encoder);\n  __pyx_tp_dealloc_9pywrapfst__SymbolTable(o);\n}\n\nstatic PyMethodDef __pyx_methods_9pywrapfst__EncodeMapperSymbolTable[] = {\n  {\"__reduce_cython__\", (PyCFunction)__pyx_pw_9pywrapfst_24_EncodeMapperSymbolTable_3__reduce_cython__, METH_NOARGS, 0},\n  {\"__setstate_cython__\", (PyCFunction)__pyx_pw_9pywrapfst_24_EncodeMapperSymbolTable_5__setstate_cython__, METH_O, 0},\n  {0, 0, 0, 0}\n};\n\nstatic PyTypeObject __pyx_type_9pywrapfst__EncodeMapperSymbolTable = {\n  PyVarObject_HEAD_INIT(0, 0)\n  \"pywrapfst._EncodeMapperSymbolTable\", /*tp_name*/\n  sizeof(struct __pyx_obj_9pywrapfst__EncodeMapperSymbolTable), /*tp_basicsize*/\n  0, /*tp_itemsize*/\n  __pyx_tp_dealloc_9pywrapfst__EncodeMapperSymbolTable, /*tp_dealloc*/\n  0, /*tp_print*/\n  0, /*tp_getattr*/\n  0, /*tp_setattr*/\n  #if PY_MAJOR_VERSION < 3\n  0, /*tp_compare*/\n  #endif\n  #if PY_MAJOR_VERSION >= 3\n  0, /*tp_as_async*/\n  #endif\n  __pyx_pw_9pywrapfst_24_EncodeMapperSymbolTable_1__repr__, /*tp_repr*/\n  0, /*tp_as_number*/\n  0, /*tp_as_sequence*/\n  0, /*tp_as_mapping*/\n  0, /*tp_hash*/\n  0, /*tp_call*/\n  0, /*tp_str*/\n  0, /*tp_getattro*/\n  0, /*tp_setattro*/\n  0, /*tp_as_buffer*/\n  Py_TPFLAGS_DEFAULT|Py_TPFLAGS_HAVE_VERSION_TAG|Py_TPFLAGS_CHECKTYPES|Py_TPFLAGS_HAVE_NEWBUFFER|Py_TPFLAGS_BASETYPE, /*tp_flags*/\n  \"\\n  (No constructor.)\\n\\n  Immutable SymbolTable class for tables stored in an EncodeMapper.\\n\\n  This class wraps a library const SymbolTable and exposes const methods of the\\n  wrapped object. It is only to be returned by method, never constructed\\n  directly.\\n  \", /*tp_doc*/\n  0, /*tp_traverse*/\n  0, /*tp_clear*/\n  0, /*tp_richcompare*/\n  0, /*tp_weaklistoffset*/\n  #if CYTHON_COMPILING_IN_PYPY\n  __pyx_pw_9pywrapfst_12_SymbolTable_3__iter__, /*tp_iter*/\n  #else\n  0, /*tp_iter*/\n  #endif\n  0, /*tp_iternext*/\n  __pyx_methods_9pywrapfst__EncodeMapperSymbolTable, /*tp_methods*/\n  0, /*tp_members*/\n  0, /*tp_getset*/\n  0, /*tp_base*/\n  0, /*tp_dict*/\n  0, /*tp_descr_get*/\n  0, /*tp_descr_set*/\n  0, /*tp_dictoffset*/\n  #if CYTHON_COMPILING_IN_PYPY\n  __pyx_pw_9pywrapfst_12_SymbolTable_1__init__, /*tp_init*/\n  #else\n  0, /*tp_init*/\n  #endif\n  0, /*tp_alloc*/\n  __pyx_tp_new_9pywrapfst__EncodeMapperSymbolTable, /*tp_new*/\n  0, /*tp_free*/\n  0, /*tp_is_gc*/\n  0, /*tp_bases*/\n  0, /*tp_mro*/\n  0, /*tp_cache*/\n  0, /*tp_subclasses*/\n  0, /*tp_weaklist*/\n  0, /*tp_del*/\n  0, /*tp_version_tag*/\n  #if PY_VERSION_HEX >= 0x030400a1\n  0, /*tp_finalize*/\n  #endif\n};\nstatic struct __pyx_vtabstruct_9pywrapfst__FstSymbolTable __pyx_vtable_9pywrapfst__FstSymbolTable;\n\nstatic PyObject *__pyx_tp_new_9pywrapfst__FstSymbolTable(PyTypeObject *t, PyObject *a, PyObject *k) {\n  struct __pyx_obj_9pywrapfst__FstSymbolTable *p;\n  PyObject *o = __pyx_tp_new_9pywrapfst__SymbolTable(t, a, k);\n  if (unlikely(!o)) return 0;\n  p = ((struct __pyx_obj_9pywrapfst__FstSymbolTable *)o);\n  p->__pyx_base.__pyx_vtab = (struct __pyx_vtabstruct_9pywrapfst__SymbolTable*)__pyx_vtabptr_9pywrapfst__FstSymbolTable;\n  new((void*)&(p->_fst)) std::shared_ptr<fst::script::FstClass> ();\n  return o;\n}\n\nstatic void __pyx_tp_dealloc_9pywrapfst__FstSymbolTable(PyObject *o) {\n  struct __pyx_obj_9pywrapfst__FstSymbolTable *p = (struct __pyx_obj_9pywrapfst__FstSymbolTable *)o;\n  #if CYTHON_USE_TP_FINALIZE\n  if (unlikely(PyType_HasFeature(Py_TYPE(o), Py_TPFLAGS_HAVE_FINALIZE) && Py_TYPE(o)->tp_finalize) && (!PyType_IS_GC(Py_TYPE(o)) || !_PyGC_FINALIZED(o))) {\n    if (PyObject_CallFinalizerFromDealloc(o)) return;\n  }\n  #endif\n  __Pyx_call_destructor(p->_fst);\n  __pyx_tp_dealloc_9pywrapfst__SymbolTable(o);\n}\n\nstatic PyMethodDef __pyx_methods_9pywrapfst__FstSymbolTable[] = {\n  {\"__reduce_cython__\", (PyCFunction)__pyx_pw_9pywrapfst_15_FstSymbolTable_3__reduce_cython__, METH_NOARGS, 0},\n  {\"__setstate_cython__\", (PyCFunction)__pyx_pw_9pywrapfst_15_FstSymbolTable_5__setstate_cython__, METH_O, 0},\n  {0, 0, 0, 0}\n};\n\nstatic PyTypeObject __pyx_type_9pywrapfst__FstSymbolTable = {\n  PyVarObject_HEAD_INIT(0, 0)\n  \"pywrapfst._FstSymbolTable\", /*tp_name*/\n  sizeof(struct __pyx_obj_9pywrapfst__FstSymbolTable), /*tp_basicsize*/\n  0, /*tp_itemsize*/\n  __pyx_tp_dealloc_9pywrapfst__FstSymbolTable, /*tp_dealloc*/\n  0, /*tp_print*/\n  0, /*tp_getattr*/\n  0, /*tp_setattr*/\n  #if PY_MAJOR_VERSION < 3\n  0, /*tp_compare*/\n  #endif\n  #if PY_MAJOR_VERSION >= 3\n  0, /*tp_as_async*/\n  #endif\n  __pyx_pw_9pywrapfst_15_FstSymbolTable_1__repr__, /*tp_repr*/\n  0, /*tp_as_number*/\n  0, /*tp_as_sequence*/\n  0, /*tp_as_mapping*/\n  0, /*tp_hash*/\n  0, /*tp_call*/\n  0, /*tp_str*/\n  0, /*tp_getattro*/\n  0, /*tp_setattro*/\n  0, /*tp_as_buffer*/\n  Py_TPFLAGS_DEFAULT|Py_TPFLAGS_HAVE_VERSION_TAG|Py_TPFLAGS_CHECKTYPES|Py_TPFLAGS_HAVE_NEWBUFFER|Py_TPFLAGS_BASETYPE, /*tp_flags*/\n  \"\\n  (No constructor.)\\n\\n  Mutable SymbolTable class for tables stored in a mutable FST.\\n\\n  This class wraps a library SymbolTable and exposes methods of the wrapped\\n  object. It is only to be returned by method, never constructed directly.\\n  \", /*tp_doc*/\n  0, /*tp_traverse*/\n  0, /*tp_clear*/\n  0, /*tp_richcompare*/\n  0, /*tp_weaklistoffset*/\n  #if CYTHON_COMPILING_IN_PYPY\n  __pyx_pw_9pywrapfst_12_SymbolTable_3__iter__, /*tp_iter*/\n  #else\n  0, /*tp_iter*/\n  #endif\n  0, /*tp_iternext*/\n  __pyx_methods_9pywrapfst__FstSymbolTable, /*tp_methods*/\n  0, /*tp_members*/\n  0, /*tp_getset*/\n  0, /*tp_base*/\n  0, /*tp_dict*/\n  0, /*tp_descr_get*/\n  0, /*tp_descr_set*/\n  0, /*tp_dictoffset*/\n  #if CYTHON_COMPILING_IN_PYPY\n  __pyx_pw_9pywrapfst_12_SymbolTable_1__init__, /*tp_init*/\n  #else\n  0, /*tp_init*/\n  #endif\n  0, /*tp_alloc*/\n  __pyx_tp_new_9pywrapfst__FstSymbolTable, /*tp_new*/\n  0, /*tp_free*/\n  0, /*tp_is_gc*/\n  0, /*tp_bases*/\n  0, /*tp_mro*/\n  0, /*tp_cache*/\n  0, /*tp_subclasses*/\n  0, /*tp_weaklist*/\n  0, /*tp_del*/\n  0, /*tp_version_tag*/\n  #if PY_VERSION_HEX >= 0x030400a1\n  0, /*tp_finalize*/\n  #endif\n};\nstatic struct __pyx_vtabstruct_9pywrapfst__MutableSymbolTable __pyx_vtable_9pywrapfst__MutableSymbolTable;\n\nstatic PyObject *__pyx_tp_new_9pywrapfst__MutableSymbolTable(PyTypeObject *t, PyObject *a, PyObject *k) {\n  struct __pyx_obj_9pywrapfst__MutableSymbolTable *p;\n  PyObject *o = __pyx_tp_new_9pywrapfst__SymbolTable(t, a, k);\n  if (unlikely(!o)) return 0;\n  p = ((struct __pyx_obj_9pywrapfst__MutableSymbolTable *)o);\n  p->__pyx_base.__pyx_vtab = (struct __pyx_vtabstruct_9pywrapfst__SymbolTable*)__pyx_vtabptr_9pywrapfst__MutableSymbolTable;\n  return o;\n}\n\nstatic PyMethodDef __pyx_methods_9pywrapfst__MutableSymbolTable[] = {\n  {\"add_symbol\", (PyCFunction)__pyx_pw_9pywrapfst_19_MutableSymbolTable_1add_symbol, METH_VARARGS|METH_KEYWORDS, __pyx_doc_9pywrapfst_19_MutableSymbolTable_add_symbol},\n  {\"add_table\", (PyCFunction)__pyx_pw_9pywrapfst_19_MutableSymbolTable_3add_table, METH_O, __pyx_doc_9pywrapfst_19_MutableSymbolTable_2add_table},\n  {\"set_name\", (PyCFunction)__pyx_pw_9pywrapfst_19_MutableSymbolTable_5set_name, METH_O, 0},\n  {\"__reduce_cython__\", (PyCFunction)__pyx_pw_9pywrapfst_19_MutableSymbolTable_7__reduce_cython__, METH_NOARGS, 0},\n  {\"__setstate_cython__\", (PyCFunction)__pyx_pw_9pywrapfst_19_MutableSymbolTable_9__setstate_cython__, METH_O, 0},\n  {0, 0, 0, 0}\n};\n\nstatic PyTypeObject __pyx_type_9pywrapfst__MutableSymbolTable = {\n  PyVarObject_HEAD_INIT(0, 0)\n  \"pywrapfst._MutableSymbolTable\", /*tp_name*/\n  sizeof(struct __pyx_obj_9pywrapfst__MutableSymbolTable), /*tp_basicsize*/\n  0, /*tp_itemsize*/\n  __pyx_tp_dealloc_9pywrapfst__SymbolTable, /*tp_dealloc*/\n  0, /*tp_print*/\n  0, /*tp_getattr*/\n  0, /*tp_setattr*/\n  #if PY_MAJOR_VERSION < 3\n  0, /*tp_compare*/\n  #endif\n  #if PY_MAJOR_VERSION >= 3\n  0, /*tp_as_async*/\n  #endif\n  0, /*tp_repr*/\n  0, /*tp_as_number*/\n  0, /*tp_as_sequence*/\n  0, /*tp_as_mapping*/\n  0, /*tp_hash*/\n  0, /*tp_call*/\n  0, /*tp_str*/\n  0, /*tp_getattro*/\n  0, /*tp_setattro*/\n  0, /*tp_as_buffer*/\n  Py_TPFLAGS_DEFAULT|Py_TPFLAGS_HAVE_VERSION_TAG|Py_TPFLAGS_CHECKTYPES|Py_TPFLAGS_HAVE_NEWBUFFER|Py_TPFLAGS_BASETYPE, /*tp_flags*/\n  \"\\n  (No constructor.)\\n\\n  Base class for mutable symbol tables.\\n\\n  This class is the base class for a mutable SymbolTable. It has a \\\"deleted\\\"\\n  constructor and implementations of all methods of the wrapped SymbolTable.\\n  \", /*tp_doc*/\n  0, /*tp_traverse*/\n  0, /*tp_clear*/\n  0, /*tp_richcompare*/\n  0, /*tp_weaklistoffset*/\n  #if CYTHON_COMPILING_IN_PYPY\n  __pyx_pw_9pywrapfst_12_SymbolTable_3__iter__, /*tp_iter*/\n  #else\n  0, /*tp_iter*/\n  #endif\n  0, /*tp_iternext*/\n  __pyx_methods_9pywrapfst__MutableSymbolTable, /*tp_methods*/\n  0, /*tp_members*/\n  0, /*tp_getset*/\n  0, /*tp_base*/\n  0, /*tp_dict*/\n  0, /*tp_descr_get*/\n  0, /*tp_descr_set*/\n  0, /*tp_dictoffset*/\n  #if CYTHON_COMPILING_IN_PYPY\n  __pyx_pw_9pywrapfst_12_SymbolTable_1__init__, /*tp_init*/\n  #else\n  0, /*tp_init*/\n  #endif\n  0, /*tp_alloc*/\n  __pyx_tp_new_9pywrapfst__MutableSymbolTable, /*tp_new*/\n  0, /*tp_free*/\n  0, /*tp_is_gc*/\n  0, /*tp_bases*/\n  0, /*tp_mro*/\n  0, /*tp_cache*/\n  0, /*tp_subclasses*/\n  0, /*tp_weaklist*/\n  0, /*tp_del*/\n  0, /*tp_version_tag*/\n  #if PY_VERSION_HEX >= 0x030400a1\n  0, /*tp_finalize*/\n  #endif\n};\nstatic struct __pyx_vtabstruct_9pywrapfst__MutableFstSymbolTable __pyx_vtable_9pywrapfst__MutableFstSymbolTable;\n\nstatic PyObject *__pyx_tp_new_9pywrapfst__MutableFstSymbolTable(PyTypeObject *t, PyObject *a, PyObject *k) {\n  struct __pyx_obj_9pywrapfst__MutableFstSymbolTable *p;\n  PyObject *o = __pyx_tp_new_9pywrapfst__MutableSymbolTable(t, a, k);\n  if (unlikely(!o)) return 0;\n  p = ((struct __pyx_obj_9pywrapfst__MutableFstSymbolTable *)o);\n  p->__pyx_base.__pyx_base.__pyx_vtab = (struct __pyx_vtabstruct_9pywrapfst__SymbolTable*)__pyx_vtabptr_9pywrapfst__MutableFstSymbolTable;\n  new((void*)&(p->_mfst)) std::shared_ptr<fst::script::MutableFstClass> ();\n  return o;\n}\n\nstatic void __pyx_tp_dealloc_9pywrapfst__MutableFstSymbolTable(PyObject *o) {\n  struct __pyx_obj_9pywrapfst__MutableFstSymbolTable *p = (struct __pyx_obj_9pywrapfst__MutableFstSymbolTable *)o;\n  #if CYTHON_USE_TP_FINALIZE\n  if (unlikely(PyType_HasFeature(Py_TYPE(o), Py_TPFLAGS_HAVE_FINALIZE) && Py_TYPE(o)->tp_finalize) && (!PyType_IS_GC(Py_TYPE(o)) || !_PyGC_FINALIZED(o))) {\n    if (PyObject_CallFinalizerFromDealloc(o)) return;\n  }\n  #endif\n  __Pyx_call_destructor(p->_mfst);\n  __pyx_tp_dealloc_9pywrapfst__SymbolTable(o);\n}\n\nstatic PyMethodDef __pyx_methods_9pywrapfst__MutableFstSymbolTable[] = {\n  {\"__reduce_cython__\", (PyCFunction)__pyx_pw_9pywrapfst_22_MutableFstSymbolTable_3__reduce_cython__, METH_NOARGS, 0},\n  {\"__setstate_cython__\", (PyCFunction)__pyx_pw_9pywrapfst_22_MutableFstSymbolTable_5__setstate_cython__, METH_O, 0},\n  {0, 0, 0, 0}\n};\n\nstatic PyTypeObject __pyx_type_9pywrapfst__MutableFstSymbolTable = {\n  PyVarObject_HEAD_INIT(0, 0)\n  \"pywrapfst._MutableFstSymbolTable\", /*tp_name*/\n  sizeof(struct __pyx_obj_9pywrapfst__MutableFstSymbolTable), /*tp_basicsize*/\n  0, /*tp_itemsize*/\n  __pyx_tp_dealloc_9pywrapfst__MutableFstSymbolTable, /*tp_dealloc*/\n  0, /*tp_print*/\n  0, /*tp_getattr*/\n  0, /*tp_setattr*/\n  #if PY_MAJOR_VERSION < 3\n  0, /*tp_compare*/\n  #endif\n  #if PY_MAJOR_VERSION >= 3\n  0, /*tp_as_async*/\n  #endif\n  __pyx_pw_9pywrapfst_22_MutableFstSymbolTable_1__repr__, /*tp_repr*/\n  0, /*tp_as_number*/\n  0, /*tp_as_sequence*/\n  0, /*tp_as_mapping*/\n  0, /*tp_hash*/\n  0, /*tp_call*/\n  0, /*tp_str*/\n  0, /*tp_getattro*/\n  0, /*tp_setattro*/\n  0, /*tp_as_buffer*/\n  Py_TPFLAGS_DEFAULT|Py_TPFLAGS_HAVE_VERSION_TAG|Py_TPFLAGS_CHECKTYPES|Py_TPFLAGS_HAVE_NEWBUFFER|Py_TPFLAGS_BASETYPE, /*tp_flags*/\n  \"\\n  (No constructor.)\\n\\n  Mutable SymbolTable assigned to an FST.\\n  \", /*tp_doc*/\n  0, /*tp_traverse*/\n  0, /*tp_clear*/\n  0, /*tp_richcompare*/\n  0, /*tp_weaklistoffset*/\n  #if CYTHON_COMPILING_IN_PYPY\n  __pyx_pw_9pywrapfst_12_SymbolTable_3__iter__, /*tp_iter*/\n  #else\n  0, /*tp_iter*/\n  #endif\n  0, /*tp_iternext*/\n  __pyx_methods_9pywrapfst__MutableFstSymbolTable, /*tp_methods*/\n  0, /*tp_members*/\n  0, /*tp_getset*/\n  0, /*tp_base*/\n  0, /*tp_dict*/\n  0, /*tp_descr_get*/\n  0, /*tp_descr_set*/\n  0, /*tp_dictoffset*/\n  #if CYTHON_COMPILING_IN_PYPY\n  __pyx_pw_9pywrapfst_12_SymbolTable_1__init__, /*tp_init*/\n  #else\n  0, /*tp_init*/\n  #endif\n  0, /*tp_alloc*/\n  __pyx_tp_new_9pywrapfst__MutableFstSymbolTable, /*tp_new*/\n  0, /*tp_free*/\n  0, /*tp_is_gc*/\n  0, /*tp_bases*/\n  0, /*tp_mro*/\n  0, /*tp_cache*/\n  0, /*tp_subclasses*/\n  0, /*tp_weaklist*/\n  0, /*tp_del*/\n  0, /*tp_version_tag*/\n  #if PY_VERSION_HEX >= 0x030400a1\n  0, /*tp_finalize*/\n  #endif\n};\nstatic struct __pyx_vtabstruct_9pywrapfst_SymbolTable __pyx_vtable_9pywrapfst_SymbolTable;\n\nstatic PyObject *__pyx_tp_new_9pywrapfst_SymbolTable(PyTypeObject *t, PyObject *a, PyObject *k) {\n  struct __pyx_obj_9pywrapfst_SymbolTable *p;\n  PyObject *o = __pyx_tp_new_9pywrapfst__MutableSymbolTable(t, a, k);\n  if (unlikely(!o)) return 0;\n  p = ((struct __pyx_obj_9pywrapfst_SymbolTable *)o);\n  p->__pyx_base.__pyx_base.__pyx_vtab = (struct __pyx_vtabstruct_9pywrapfst__SymbolTable*)__pyx_vtabptr_9pywrapfst_SymbolTable;\n  new((void*)&(p->_smart_table)) std::unique_ptr<fst::SymbolTable> ();\n  return o;\n}\n\nstatic void __pyx_tp_dealloc_9pywrapfst_SymbolTable(PyObject *o) {\n  struct __pyx_obj_9pywrapfst_SymbolTable *p = (struct __pyx_obj_9pywrapfst_SymbolTable *)o;\n  #if CYTHON_USE_TP_FINALIZE\n  if (unlikely(PyType_HasFeature(Py_TYPE(o), Py_TPFLAGS_HAVE_FINALIZE) && Py_TYPE(o)->tp_finalize) && (!PyType_IS_GC(Py_TYPE(o)) || !_PyGC_FINALIZED(o))) {\n    if (PyObject_CallFinalizerFromDealloc(o)) return;\n  }\n  #endif\n  __Pyx_call_destructor(p->_smart_table);\n  __pyx_tp_dealloc_9pywrapfst__SymbolTable(o);\n}\n\nstatic PyMethodDef __pyx_methods_9pywrapfst_SymbolTable[] = {\n  {\"read\", (PyCFunction)__pyx_pw_9pywrapfst_11SymbolTable_5read, METH_O, __pyx_doc_9pywrapfst_11SymbolTable_4read},\n  {\"read_text\", (PyCFunction)__pyx_pw_9pywrapfst_11SymbolTable_7read_text, METH_VARARGS|METH_KEYWORDS, __pyx_doc_9pywrapfst_11SymbolTable_6read_text},\n  {\"read_fst\", (PyCFunction)__pyx_pw_9pywrapfst_11SymbolTable_9read_fst, METH_VARARGS|METH_KEYWORDS, __pyx_doc_9pywrapfst_11SymbolTable_8read_fst},\n  {\"__reduce_cython__\", (PyCFunction)__pyx_pw_9pywrapfst_11SymbolTable_11__reduce_cython__, METH_NOARGS, 0},\n  {\"__setstate_cython__\", (PyCFunction)__pyx_pw_9pywrapfst_11SymbolTable_13__setstate_cython__, METH_O, 0},\n  {0, 0, 0, 0}\n};\n\nstatic PyTypeObject __pyx_type_9pywrapfst_SymbolTable = {\n  PyVarObject_HEAD_INIT(0, 0)\n  \"pywrapfst.SymbolTable\", /*tp_name*/\n  sizeof(struct __pyx_obj_9pywrapfst_SymbolTable), /*tp_basicsize*/\n  0, /*tp_itemsize*/\n  __pyx_tp_dealloc_9pywrapfst_SymbolTable, /*tp_dealloc*/\n  0, /*tp_print*/\n  0, /*tp_getattr*/\n  0, /*tp_setattr*/\n  #if PY_MAJOR_VERSION < 3\n  0, /*tp_compare*/\n  #endif\n  #if PY_MAJOR_VERSION >= 3\n  0, /*tp_as_async*/\n  #endif\n  __pyx_pw_9pywrapfst_11SymbolTable_1__repr__, /*tp_repr*/\n  0, /*tp_as_number*/\n  0, /*tp_as_sequence*/\n  0, /*tp_as_mapping*/\n  0, /*tp_hash*/\n  0, /*tp_call*/\n  0, /*tp_str*/\n  0, /*tp_getattro*/\n  0, /*tp_setattro*/\n  0, /*tp_as_buffer*/\n  Py_TPFLAGS_DEFAULT|Py_TPFLAGS_HAVE_VERSION_TAG|Py_TPFLAGS_CHECKTYPES|Py_TPFLAGS_HAVE_NEWBUFFER|Py_TPFLAGS_BASETYPE, /*tp_flags*/\n  \"\\n  SymbolTable(name=\\\"<unspecified>\\\")\\n\\n  Mutable SymbolTable class.\\n\\n  This class wraps the library SymbolTable and exposes both const (i.e.,\\n  access) and non-const (i.e., mutation) methods of wrapped object.\\n\\n  Unlike other classes in the hierarchy, it has a working constructor and can be\\n  used to programmatically construct a SymbolTable in memory.\\n\\n  Args:\\n    name: An optional string indicating the table's name.\\n  \", /*tp_doc*/\n  0, /*tp_traverse*/\n  0, /*tp_clear*/\n  0, /*tp_richcompare*/\n  0, /*tp_weaklistoffset*/\n  #if CYTHON_COMPILING_IN_PYPY\n  __pyx_pw_9pywrapfst_12_SymbolTable_3__iter__, /*tp_iter*/\n  #else\n  0, /*tp_iter*/\n  #endif\n  0, /*tp_iternext*/\n  __pyx_methods_9pywrapfst_SymbolTable, /*tp_methods*/\n  0, /*tp_members*/\n  0, /*tp_getset*/\n  0, /*tp_base*/\n  0, /*tp_dict*/\n  0, /*tp_descr_get*/\n  0, /*tp_descr_set*/\n  0, /*tp_dictoffset*/\n  __pyx_pw_9pywrapfst_11SymbolTable_3__init__, /*tp_init*/\n  0, /*tp_alloc*/\n  __pyx_tp_new_9pywrapfst_SymbolTable, /*tp_new*/\n  0, /*tp_free*/\n  0, /*tp_is_gc*/\n  0, /*tp_bases*/\n  0, /*tp_mro*/\n  0, /*tp_cache*/\n  0, /*tp_subclasses*/\n  0, /*tp_weaklist*/\n  0, /*tp_del*/\n  0, /*tp_version_tag*/\n  #if PY_VERSION_HEX >= 0x030400a1\n  0, /*tp_finalize*/\n  #endif\n};\nstatic struct __pyx_vtabstruct_9pywrapfst_SymbolTableIterator __pyx_vtable_9pywrapfst_SymbolTableIterator;\n\nstatic PyObject *__pyx_tp_new_9pywrapfst_SymbolTableIterator(PyTypeObject *t, CYTHON_UNUSED PyObject *a, CYTHON_UNUSED PyObject *k) {\n  struct __pyx_obj_9pywrapfst_SymbolTableIterator *p;\n  PyObject *o;\n  if (likely((t->tp_flags & Py_TPFLAGS_IS_ABSTRACT) == 0)) {\n    o = (*t->tp_alloc)(t, 0);\n  } else {\n    o = (PyObject *) PyBaseObject_Type.tp_new(t, __pyx_empty_tuple, 0);\n  }\n  if (unlikely(!o)) return 0;\n  p = ((struct __pyx_obj_9pywrapfst_SymbolTableIterator *)o);\n  p->__pyx_vtab = __pyx_vtabptr_9pywrapfst_SymbolTableIterator;\n  new((void*)&(p->_table)) std::shared_ptr<fst::SymbolTable> ();\n  new((void*)&(p->_siter)) std::unique_ptr<fst::SymbolTableIterator> ();\n  return o;\n}\n\nstatic void __pyx_tp_dealloc_9pywrapfst_SymbolTableIterator(PyObject *o) {\n  struct __pyx_obj_9pywrapfst_SymbolTableIterator *p = (struct __pyx_obj_9pywrapfst_SymbolTableIterator *)o;\n  #if CYTHON_USE_TP_FINALIZE\n  if (unlikely(PyType_HasFeature(Py_TYPE(o), Py_TPFLAGS_HAVE_FINALIZE) && Py_TYPE(o)->tp_finalize) && (!PyType_IS_GC(Py_TYPE(o)) || !_PyGC_FINALIZED(o))) {\n    if (PyObject_CallFinalizerFromDealloc(o)) return;\n  }\n  #endif\n  __Pyx_call_destructor(p->_table);\n  __Pyx_call_destructor(p->_siter);\n  (*Py_TYPE(o)->tp_free)(o);\n}\n\nstatic PyMethodDef __pyx_methods_9pywrapfst_SymbolTableIterator[] = {\n  {\"__next__\", (PyCFunction)__pyx_pw_9pywrapfst_19SymbolTableIterator_7__next__, METH_NOARGS|METH_COEXIST, 0},\n  {\"done\", (PyCFunction)__pyx_pw_9pywrapfst_19SymbolTableIterator_9done, METH_NOARGS, __pyx_doc_9pywrapfst_19SymbolTableIterator_8done},\n  {\"next\", (PyCFunction)__pyx_pw_9pywrapfst_19SymbolTableIterator_11next, METH_NOARGS, __pyx_doc_9pywrapfst_19SymbolTableIterator_10next},\n  {\"reset\", (PyCFunction)__pyx_pw_9pywrapfst_19SymbolTableIterator_13reset, METH_NOARGS, __pyx_doc_9pywrapfst_19SymbolTableIterator_12reset},\n  {\"symbol\", (PyCFunction)__pyx_pw_9pywrapfst_19SymbolTableIterator_15symbol, METH_NOARGS, __pyx_doc_9pywrapfst_19SymbolTableIterator_14symbol},\n  {\"value\", (PyCFunction)__pyx_pw_9pywrapfst_19SymbolTableIterator_17value, METH_NOARGS, __pyx_doc_9pywrapfst_19SymbolTableIterator_16value},\n  {\"__reduce_cython__\", (PyCFunction)__pyx_pw_9pywrapfst_19SymbolTableIterator_19__reduce_cython__, METH_NOARGS, 0},\n  {\"__setstate_cython__\", (PyCFunction)__pyx_pw_9pywrapfst_19SymbolTableIterator_21__setstate_cython__, METH_O, 0},\n  {0, 0, 0, 0}\n};\n\nstatic PyTypeObject __pyx_type_9pywrapfst_SymbolTableIterator = {\n  PyVarObject_HEAD_INIT(0, 0)\n  \"pywrapfst.SymbolTableIterator\", /*tp_name*/\n  sizeof(struct __pyx_obj_9pywrapfst_SymbolTableIterator), /*tp_basicsize*/\n  0, /*tp_itemsize*/\n  __pyx_tp_dealloc_9pywrapfst_SymbolTableIterator, /*tp_dealloc*/\n  0, /*tp_print*/\n  0, /*tp_getattr*/\n  0, /*tp_setattr*/\n  #if PY_MAJOR_VERSION < 3\n  0, /*tp_compare*/\n  #endif\n  #if PY_MAJOR_VERSION >= 3\n  0, /*tp_as_async*/\n  #endif\n  __pyx_pw_9pywrapfst_19SymbolTableIterator_1__repr__, /*tp_repr*/\n  0, /*tp_as_number*/\n  0, /*tp_as_sequence*/\n  0, /*tp_as_mapping*/\n  0, /*tp_hash*/\n  0, /*tp_call*/\n  0, /*tp_str*/\n  0, /*tp_getattro*/\n  0, /*tp_setattro*/\n  0, /*tp_as_buffer*/\n  Py_TPFLAGS_DEFAULT|Py_TPFLAGS_HAVE_VERSION_TAG|Py_TPFLAGS_CHECKTYPES|Py_TPFLAGS_HAVE_NEWBUFFER|Py_TPFLAGS_BASETYPE, /*tp_flags*/\n  \"\\n  SymbolTableIterator(syms)\\n\\n  This class is used for iterating over a symbol table.\\n  \", /*tp_doc*/\n  0, /*tp_traverse*/\n  0, /*tp_clear*/\n  0, /*tp_richcompare*/\n  0, /*tp_weaklistoffset*/\n  __pyx_pw_9pywrapfst_19SymbolTableIterator_5__iter__, /*tp_iter*/\n  __pyx_pw_9pywrapfst_19SymbolTableIterator_7__next__, /*tp_iternext*/\n  __pyx_methods_9pywrapfst_SymbolTableIterator, /*tp_methods*/\n  0, /*tp_members*/\n  0, /*tp_getset*/\n  0, /*tp_base*/\n  0, /*tp_dict*/\n  0, /*tp_descr_get*/\n  0, /*tp_descr_set*/\n  0, /*tp_dictoffset*/\n  __pyx_pw_9pywrapfst_19SymbolTableIterator_3__init__, /*tp_init*/\n  0, /*tp_alloc*/\n  __pyx_tp_new_9pywrapfst_SymbolTableIterator, /*tp_new*/\n  0, /*tp_free*/\n  0, /*tp_is_gc*/\n  0, /*tp_bases*/\n  0, /*tp_mro*/\n  0, /*tp_cache*/\n  0, /*tp_subclasses*/\n  0, /*tp_weaklist*/\n  0, /*tp_del*/\n  0, /*tp_version_tag*/\n  #if PY_VERSION_HEX >= 0x030400a1\n  0, /*tp_finalize*/\n  #endif\n};\nstatic struct __pyx_vtabstruct_9pywrapfst_EncodeMapper __pyx_vtable_9pywrapfst_EncodeMapper;\n\nstatic PyObject *__pyx_tp_new_9pywrapfst_EncodeMapper(PyTypeObject *t, CYTHON_UNUSED PyObject *a, CYTHON_UNUSED PyObject *k) {\n  struct __pyx_obj_9pywrapfst_EncodeMapper *p;\n  PyObject *o;\n  if (likely((t->tp_flags & Py_TPFLAGS_IS_ABSTRACT) == 0)) {\n    o = (*t->tp_alloc)(t, 0);\n  } else {\n    o = (PyObject *) PyBaseObject_Type.tp_new(t, __pyx_empty_tuple, 0);\n  }\n  if (unlikely(!o)) return 0;\n  p = ((struct __pyx_obj_9pywrapfst_EncodeMapper *)o);\n  p->__pyx_vtab = __pyx_vtabptr_9pywrapfst_EncodeMapper;\n  new((void*)&(p->_encoder)) std::shared_ptr<fst::script::EncodeMapperClass> ();\n  return o;\n}\n\nstatic void __pyx_tp_dealloc_9pywrapfst_EncodeMapper(PyObject *o) {\n  struct __pyx_obj_9pywrapfst_EncodeMapper *p = (struct __pyx_obj_9pywrapfst_EncodeMapper *)o;\n  #if CYTHON_USE_TP_FINALIZE\n  if (unlikely(PyType_HasFeature(Py_TYPE(o), Py_TPFLAGS_HAVE_FINALIZE) && Py_TYPE(o)->tp_finalize) && (!PyType_IS_GC(Py_TYPE(o)) || !_PyGC_FINALIZED(o))) {\n    if (PyObject_CallFinalizerFromDealloc(o)) return;\n  }\n  #endif\n  __Pyx_call_destructor(p->_encoder);\n  (*Py_TYPE(o)->tp_free)(o);\n}\n\nstatic PyMethodDef __pyx_methods_9pywrapfst_EncodeMapper[] = {\n  {\"arc_type\", (PyCFunction)__pyx_pw_9pywrapfst_12EncodeMapper_5arc_type, METH_NOARGS, __pyx_doc_9pywrapfst_12EncodeMapper_4arc_type},\n  {\"flags\", (PyCFunction)__pyx_pw_9pywrapfst_12EncodeMapper_9flags, METH_NOARGS, __pyx_doc_9pywrapfst_12EncodeMapper_8flags},\n  {\"input_symbols\", (PyCFunction)__pyx_pw_9pywrapfst_12EncodeMapper_11input_symbols, METH_NOARGS, __pyx_doc_9pywrapfst_12EncodeMapper_10input_symbols},\n  {\"output_symbols\", (PyCFunction)__pyx_pw_9pywrapfst_12EncodeMapper_13output_symbols, METH_NOARGS, __pyx_doc_9pywrapfst_12EncodeMapper_12output_symbols},\n  {\"properties\", (PyCFunction)__pyx_pw_9pywrapfst_12EncodeMapper_15properties, METH_O, __pyx_doc_9pywrapfst_12EncodeMapper_14properties},\n  {\"set_input_symbols\", (PyCFunction)__pyx_pw_9pywrapfst_12EncodeMapper_17set_input_symbols, METH_O, __pyx_doc_9pywrapfst_12EncodeMapper_16set_input_symbols},\n  {\"set_output_symbols\", (PyCFunction)__pyx_pw_9pywrapfst_12EncodeMapper_19set_output_symbols, METH_O, __pyx_doc_9pywrapfst_12EncodeMapper_18set_output_symbols},\n  {\"weight_type\", (PyCFunction)__pyx_pw_9pywrapfst_12EncodeMapper_21weight_type, METH_NOARGS, __pyx_doc_9pywrapfst_12EncodeMapper_20weight_type},\n  {\"__reduce_cython__\", (PyCFunction)__pyx_pw_9pywrapfst_12EncodeMapper_23__reduce_cython__, METH_NOARGS, 0},\n  {\"__setstate_cython__\", (PyCFunction)__pyx_pw_9pywrapfst_12EncodeMapper_25__setstate_cython__, METH_O, 0},\n  {0, 0, 0, 0}\n};\n\nstatic PyTypeObject __pyx_type_9pywrapfst_EncodeMapper = {\n  PyVarObject_HEAD_INIT(0, 0)\n  \"pywrapfst.EncodeMapper\", /*tp_name*/\n  sizeof(struct __pyx_obj_9pywrapfst_EncodeMapper), /*tp_basicsize*/\n  0, /*tp_itemsize*/\n  __pyx_tp_dealloc_9pywrapfst_EncodeMapper, /*tp_dealloc*/\n  0, /*tp_print*/\n  0, /*tp_getattr*/\n  0, /*tp_setattr*/\n  #if PY_MAJOR_VERSION < 3\n  0, /*tp_compare*/\n  #endif\n  #if PY_MAJOR_VERSION >= 3\n  0, /*tp_as_async*/\n  #endif\n  __pyx_pw_9pywrapfst_12EncodeMapper_1__repr__, /*tp_repr*/\n  0, /*tp_as_number*/\n  0, /*tp_as_sequence*/\n  0, /*tp_as_mapping*/\n  0, /*tp_hash*/\n  __pyx_pw_9pywrapfst_12EncodeMapper_7__call__, /*tp_call*/\n  0, /*tp_str*/\n  0, /*tp_getattro*/\n  0, /*tp_setattro*/\n  0, /*tp_as_buffer*/\n  Py_TPFLAGS_DEFAULT|Py_TPFLAGS_HAVE_VERSION_TAG|Py_TPFLAGS_CHECKTYPES|Py_TPFLAGS_HAVE_NEWBUFFER|Py_TPFLAGS_BASETYPE, /*tp_flags*/\n  \"\\n  EncodeMapper(arc_type=\\\"standard\\\", encode_labels=False, encode_weights=False)\\n\\n  Arc encoder class, wrapping EncodeMapperClass.\\n\\n  This class provides an object which can be used to encode or decode FST arcs.\\n  This is most useful to convert an FST to an unweighted acceptor, on which\\n  some FST operations are more efficient, and then decoding the FST afterwards.\\n\\n  To use an instance of this class to encode or decode a mutable FST, pass it\\n  as the first argument to the FST instance methods `encode` and `decode`.\\n\\n  For implementational reasons, it is not currently possible to use an encoder\\n  on disk to construct this class.\\n\\n  Args:\\n    arc_type: A string indicating the arc type.\\n    encode_labels: Should labels be encoded?\\n    encode_weights: Should weights be encoded?\\n  \", /*tp_doc*/\n  0, /*tp_traverse*/\n  0, /*tp_clear*/\n  0, /*tp_richcompare*/\n  0, /*tp_weaklistoffset*/\n  0, /*tp_iter*/\n  0, /*tp_iternext*/\n  __pyx_methods_9pywrapfst_EncodeMapper, /*tp_methods*/\n  0, /*tp_members*/\n  0, /*tp_getset*/\n  0, /*tp_base*/\n  0, /*tp_dict*/\n  0, /*tp_descr_get*/\n  0, /*tp_descr_set*/\n  0, /*tp_dictoffset*/\n  __pyx_pw_9pywrapfst_12EncodeMapper_3__init__, /*tp_init*/\n  0, /*tp_alloc*/\n  __pyx_tp_new_9pywrapfst_EncodeMapper, /*tp_new*/\n  0, /*tp_free*/\n  0, /*tp_is_gc*/\n  0, /*tp_bases*/\n  0, /*tp_mro*/\n  0, /*tp_cache*/\n  0, /*tp_subclasses*/\n  0, /*tp_weaklist*/\n  0, /*tp_del*/\n  0, /*tp_version_tag*/\n  #if PY_VERSION_HEX >= 0x030400a1\n  0, /*tp_finalize*/\n  #endif\n};\nstatic struct __pyx_vtabstruct_9pywrapfst__Fst __pyx_vtable_9pywrapfst__Fst;\n\nstatic PyObject *__pyx_tp_new_9pywrapfst__Fst(PyTypeObject *t, CYTHON_UNUSED PyObject *a, CYTHON_UNUSED PyObject *k) {\n  struct __pyx_obj_9pywrapfst__Fst *p;\n  PyObject *o;\n  if (likely((t->tp_flags & Py_TPFLAGS_IS_ABSTRACT) == 0)) {\n    o = (*t->tp_alloc)(t, 0);\n  } else {\n    o = (PyObject *) PyBaseObject_Type.tp_new(t, __pyx_empty_tuple, 0);\n  }\n  if (unlikely(!o)) return 0;\n  p = ((struct __pyx_obj_9pywrapfst__Fst *)o);\n  p->__pyx_vtab = __pyx_vtabptr_9pywrapfst__Fst;\n  new((void*)&(p->_fst)) std::shared_ptr<fst::script::FstClass> ();\n  return o;\n}\n\nstatic void __pyx_tp_dealloc_9pywrapfst__Fst(PyObject *o) {\n  struct __pyx_obj_9pywrapfst__Fst *p = (struct __pyx_obj_9pywrapfst__Fst *)o;\n  #if CYTHON_USE_TP_FINALIZE\n  if (unlikely(PyType_HasFeature(Py_TYPE(o), Py_TPFLAGS_HAVE_FINALIZE) && Py_TYPE(o)->tp_finalize) && (!PyType_IS_GC(Py_TYPE(o)) || !_PyGC_FINALIZED(o))) {\n    if (PyObject_CallFinalizerFromDealloc(o)) return;\n  }\n  #endif\n  __Pyx_call_destructor(p->_fst);\n  (*Py_TYPE(o)->tp_free)(o);\n}\n\nstatic PyMethodDef __pyx_methods_9pywrapfst__Fst[] = {\n  {\"_repr_svg_\", (PyCFunction)__pyx_pw_9pywrapfst_4_Fst_1_repr_svg_, METH_NOARGS, __pyx_doc_9pywrapfst_4_Fst__repr_svg_},\n  {\"__reduce__\", (PyCFunction)__pyx_pw_9pywrapfst_4_Fst_9__reduce__, METH_NOARGS, 0},\n  {\"arc_type\", (PyCFunction)__pyx_pw_9pywrapfst_4_Fst_11arc_type, METH_NOARGS, __pyx_doc_9pywrapfst_4_Fst_10arc_type},\n  {\"arcs\", (PyCFunction)__pyx_pw_9pywrapfst_4_Fst_13arcs, METH_O, __pyx_doc_9pywrapfst_4_Fst_12arcs},\n  {\"copy\", (PyCFunction)__pyx_pw_9pywrapfst_4_Fst_15copy, METH_NOARGS, __pyx_doc_9pywrapfst_4_Fst_14copy},\n  {\"draw\", (PyCFunction)__pyx_pw_9pywrapfst_4_Fst_17draw, METH_VARARGS|METH_KEYWORDS, __pyx_doc_9pywrapfst_4_Fst_16draw},\n  {\"final\", (PyCFunction)__pyx_pw_9pywrapfst_4_Fst_19final, METH_O, __pyx_doc_9pywrapfst_4_Fst_18final},\n  {\"fst_type\", (PyCFunction)__pyx_pw_9pywrapfst_4_Fst_21fst_type, METH_NOARGS, __pyx_doc_9pywrapfst_4_Fst_20fst_type},\n  {\"input_symbols\", (PyCFunction)__pyx_pw_9pywrapfst_4_Fst_23input_symbols, METH_NOARGS, __pyx_doc_9pywrapfst_4_Fst_22input_symbols},\n  {\"num_arcs\", (PyCFunction)__pyx_pw_9pywrapfst_4_Fst_25num_arcs, METH_O, __pyx_doc_9pywrapfst_4_Fst_24num_arcs},\n  {\"num_input_epsilons\", (PyCFunction)__pyx_pw_9pywrapfst_4_Fst_27num_input_epsilons, METH_O, __pyx_doc_9pywrapfst_4_Fst_26num_input_epsilons},\n  {\"num_output_epsilons\", (PyCFunction)__pyx_pw_9pywrapfst_4_Fst_29num_output_epsilons, METH_O, __pyx_doc_9pywrapfst_4_Fst_28num_output_epsilons},\n  {\"output_symbols\", (PyCFunction)__pyx_pw_9pywrapfst_4_Fst_31output_symbols, METH_NOARGS, __pyx_doc_9pywrapfst_4_Fst_30output_symbols},\n  {\"properties\", (PyCFunction)__pyx_pw_9pywrapfst_4_Fst_33properties, METH_VARARGS|METH_KEYWORDS, __pyx_doc_9pywrapfst_4_Fst_32properties},\n  {\"start\", (PyCFunction)__pyx_pw_9pywrapfst_4_Fst_35start, METH_NOARGS, __pyx_doc_9pywrapfst_4_Fst_34start},\n  {\"states\", (PyCFunction)__pyx_pw_9pywrapfst_4_Fst_37states, METH_NOARGS, __pyx_doc_9pywrapfst_4_Fst_36states},\n  {\"text\", (PyCFunction)__pyx_pw_9pywrapfst_4_Fst_39text, METH_VARARGS|METH_KEYWORDS, __pyx_doc_9pywrapfst_4_Fst_38text},\n  {\"verify\", (PyCFunction)__pyx_pw_9pywrapfst_4_Fst_41verify, METH_NOARGS, __pyx_doc_9pywrapfst_4_Fst_40verify},\n  {\"weight_type\", (PyCFunction)__pyx_pw_9pywrapfst_4_Fst_43weight_type, METH_NOARGS, __pyx_doc_9pywrapfst_4_Fst_42weight_type},\n  {\"write\", (PyCFunction)__pyx_pw_9pywrapfst_4_Fst_45write, METH_O, __pyx_doc_9pywrapfst_4_Fst_44write},\n  {\"write_to_string\", (PyCFunction)__pyx_pw_9pywrapfst_4_Fst_47write_to_string, METH_NOARGS, __pyx_doc_9pywrapfst_4_Fst_46write_to_string},\n  {0, 0, 0, 0}\n};\n\nstatic PyTypeObject __pyx_type_9pywrapfst__Fst = {\n  PyVarObject_HEAD_INIT(0, 0)\n  \"pywrapfst._Fst\", /*tp_name*/\n  sizeof(struct __pyx_obj_9pywrapfst__Fst), /*tp_basicsize*/\n  0, /*tp_itemsize*/\n  __pyx_tp_dealloc_9pywrapfst__Fst, /*tp_dealloc*/\n  0, /*tp_print*/\n  0, /*tp_getattr*/\n  0, /*tp_setattr*/\n  #if PY_MAJOR_VERSION < 3\n  0, /*tp_compare*/\n  #endif\n  #if PY_MAJOR_VERSION >= 3\n  0, /*tp_as_async*/\n  #endif\n  __pyx_pw_9pywrapfst_4_Fst_3__repr__, /*tp_repr*/\n  0, /*tp_as_number*/\n  0, /*tp_as_sequence*/\n  0, /*tp_as_mapping*/\n  0, /*tp_hash*/\n  0, /*tp_call*/\n  __pyx_pw_9pywrapfst_4_Fst_7__str__, /*tp_str*/\n  0, /*tp_getattro*/\n  0, /*tp_setattro*/\n  0, /*tp_as_buffer*/\n  Py_TPFLAGS_DEFAULT|Py_TPFLAGS_HAVE_VERSION_TAG|Py_TPFLAGS_CHECKTYPES|Py_TPFLAGS_HAVE_NEWBUFFER|Py_TPFLAGS_BASETYPE, /*tp_flags*/\n  \"\\n  (No constructor.)\\n\\n  Immutable FST class, wrapping FstClass.\\n\\n  This class is the basic user-facing FST object. It does not itself support any\\n  mutation operations.\\n  \", /*tp_doc*/\n  0, /*tp_traverse*/\n  0, /*tp_clear*/\n  0, /*tp_richcompare*/\n  0, /*tp_weaklistoffset*/\n  0, /*tp_iter*/\n  0, /*tp_iternext*/\n  __pyx_methods_9pywrapfst__Fst, /*tp_methods*/\n  0, /*tp_members*/\n  0, /*tp_getset*/\n  0, /*tp_base*/\n  0, /*tp_dict*/\n  0, /*tp_descr_get*/\n  0, /*tp_descr_set*/\n  0, /*tp_dictoffset*/\n  __pyx_pw_9pywrapfst_4_Fst_5__init__, /*tp_init*/\n  0, /*tp_alloc*/\n  __pyx_tp_new_9pywrapfst__Fst, /*tp_new*/\n  0, /*tp_free*/\n  0, /*tp_is_gc*/\n  0, /*tp_bases*/\n  0, /*tp_mro*/\n  0, /*tp_cache*/\n  0, /*tp_subclasses*/\n  0, /*tp_weaklist*/\n  0, /*tp_del*/\n  0, /*tp_version_tag*/\n  #if PY_VERSION_HEX >= 0x030400a1\n  0, /*tp_finalize*/\n  #endif\n};\nstatic struct __pyx_vtabstruct_9pywrapfst__MutableFst __pyx_vtable_9pywrapfst__MutableFst;\n\nstatic PyObject *__pyx_tp_new_9pywrapfst__MutableFst(PyTypeObject *t, PyObject *a, PyObject *k) {\n  struct __pyx_obj_9pywrapfst__MutableFst *p;\n  PyObject *o = __pyx_tp_new_9pywrapfst__Fst(t, a, k);\n  if (unlikely(!o)) return 0;\n  p = ((struct __pyx_obj_9pywrapfst__MutableFst *)o);\n  p->__pyx_base.__pyx_vtab = (struct __pyx_vtabstruct_9pywrapfst__Fst*)__pyx_vtabptr_9pywrapfst__MutableFst;\n  new((void*)&(p->_mfst)) std::shared_ptr<fst::script::MutableFstClass> ();\n  return o;\n}\n\nstatic void __pyx_tp_dealloc_9pywrapfst__MutableFst(PyObject *o) {\n  struct __pyx_obj_9pywrapfst__MutableFst *p = (struct __pyx_obj_9pywrapfst__MutableFst *)o;\n  #if CYTHON_USE_TP_FINALIZE\n  if (unlikely(PyType_HasFeature(Py_TYPE(o), Py_TPFLAGS_HAVE_FINALIZE) && Py_TYPE(o)->tp_finalize) && (!PyType_IS_GC(Py_TYPE(o)) || !_PyGC_FINALIZED(o))) {\n    if (PyObject_CallFinalizerFromDealloc(o)) return;\n  }\n  #endif\n  __Pyx_call_destructor(p->_mfst);\n  __pyx_tp_dealloc_9pywrapfst__Fst(o);\n}\n\nstatic PyMethodDef __pyx_methods_9pywrapfst__MutableFst[] = {\n  {\"add_arc\", (PyCFunction)__pyx_pw_9pywrapfst_11_MutableFst_1add_arc, METH_VARARGS|METH_KEYWORDS, __pyx_doc_9pywrapfst_11_MutableFst_add_arc},\n  {\"add_state\", (PyCFunction)__pyx_pw_9pywrapfst_11_MutableFst_3add_state, METH_NOARGS, __pyx_doc_9pywrapfst_11_MutableFst_2add_state},\n  {\"arcsort\", (PyCFunction)__pyx_pw_9pywrapfst_11_MutableFst_5arcsort, METH_VARARGS|METH_KEYWORDS, __pyx_doc_9pywrapfst_11_MutableFst_4arcsort},\n  {\"closure\", (PyCFunction)__pyx_pw_9pywrapfst_11_MutableFst_7closure, METH_VARARGS|METH_KEYWORDS, __pyx_doc_9pywrapfst_11_MutableFst_6closure},\n  {\"concat\", (PyCFunction)__pyx_pw_9pywrapfst_11_MutableFst_9concat, METH_O, __pyx_doc_9pywrapfst_11_MutableFst_8concat},\n  {\"connect\", (PyCFunction)__pyx_pw_9pywrapfst_11_MutableFst_11connect, METH_NOARGS, __pyx_doc_9pywrapfst_11_MutableFst_10connect},\n  {\"decode\", (PyCFunction)__pyx_pw_9pywrapfst_11_MutableFst_13decode, METH_O, __pyx_doc_9pywrapfst_11_MutableFst_12decode},\n  {\"delete_arcs\", (PyCFunction)__pyx_pw_9pywrapfst_11_MutableFst_15delete_arcs, METH_VARARGS|METH_KEYWORDS, __pyx_doc_9pywrapfst_11_MutableFst_14delete_arcs},\n  {\"delete_states\", (PyCFunction)__pyx_pw_9pywrapfst_11_MutableFst_17delete_states, METH_VARARGS|METH_KEYWORDS, __pyx_doc_9pywrapfst_11_MutableFst_16delete_states},\n  {\"encode\", (PyCFunction)__pyx_pw_9pywrapfst_11_MutableFst_19encode, METH_O, __pyx_doc_9pywrapfst_11_MutableFst_18encode},\n  {\"invert\", (PyCFunction)__pyx_pw_9pywrapfst_11_MutableFst_21invert, METH_NOARGS, __pyx_doc_9pywrapfst_11_MutableFst_20invert},\n  {\"minimize\", (PyCFunction)__pyx_pw_9pywrapfst_11_MutableFst_23minimize, METH_VARARGS|METH_KEYWORDS, __pyx_doc_9pywrapfst_11_MutableFst_22minimize},\n  {\"mutable_arcs\", (PyCFunction)__pyx_pw_9pywrapfst_11_MutableFst_25mutable_arcs, METH_O, __pyx_doc_9pywrapfst_11_MutableFst_24mutable_arcs},\n  {\"mutable_input_symbols\", (PyCFunction)__pyx_pw_9pywrapfst_11_MutableFst_27mutable_input_symbols, METH_NOARGS, __pyx_doc_9pywrapfst_11_MutableFst_26mutable_input_symbols},\n  {\"mutable_output_symbols\", (PyCFunction)__pyx_pw_9pywrapfst_11_MutableFst_29mutable_output_symbols, METH_NOARGS, __pyx_doc_9pywrapfst_11_MutableFst_28mutable_output_symbols},\n  {\"num_states\", (PyCFunction)__pyx_pw_9pywrapfst_11_MutableFst_31num_states, METH_NOARGS, __pyx_doc_9pywrapfst_11_MutableFst_30num_states},\n  {\"project\", (PyCFunction)__pyx_pw_9pywrapfst_11_MutableFst_33project, METH_VARARGS|METH_KEYWORDS, __pyx_doc_9pywrapfst_11_MutableFst_32project},\n  {\"prune\", (PyCFunction)__pyx_pw_9pywrapfst_11_MutableFst_35prune, METH_VARARGS|METH_KEYWORDS, __pyx_doc_9pywrapfst_11_MutableFst_34prune},\n  {\"push\", (PyCFunction)__pyx_pw_9pywrapfst_11_MutableFst_37push, METH_VARARGS|METH_KEYWORDS, __pyx_doc_9pywrapfst_11_MutableFst_36push},\n  {\"relabel_pairs\", (PyCFunction)__pyx_pw_9pywrapfst_11_MutableFst_39relabel_pairs, METH_VARARGS|METH_KEYWORDS, __pyx_doc_9pywrapfst_11_MutableFst_38relabel_pairs},\n  {\"relabel_tables\", (PyCFunction)__pyx_pw_9pywrapfst_11_MutableFst_41relabel_tables, METH_VARARGS|METH_KEYWORDS, __pyx_doc_9pywrapfst_11_MutableFst_40relabel_tables},\n  {\"reserve_arcs\", (PyCFunction)__pyx_pw_9pywrapfst_11_MutableFst_43reserve_arcs, METH_VARARGS|METH_KEYWORDS, __pyx_doc_9pywrapfst_11_MutableFst_42reserve_arcs},\n  {\"reserve_states\", (PyCFunction)__pyx_pw_9pywrapfst_11_MutableFst_45reserve_states, METH_O, __pyx_doc_9pywrapfst_11_MutableFst_44reserve_states},\n  {\"reweight\", (PyCFunction)__pyx_pw_9pywrapfst_11_MutableFst_47reweight, METH_VARARGS|METH_KEYWORDS, __pyx_doc_9pywrapfst_11_MutableFst_46reweight},\n  {\"rmepsilon\", (PyCFunction)__pyx_pw_9pywrapfst_11_MutableFst_49rmepsilon, METH_VARARGS|METH_KEYWORDS, __pyx_doc_9pywrapfst_11_MutableFst_48rmepsilon},\n  {\"set_final\", (PyCFunction)__pyx_pw_9pywrapfst_11_MutableFst_51set_final, METH_VARARGS|METH_KEYWORDS, __pyx_doc_9pywrapfst_11_MutableFst_50set_final},\n  {\"set_input_symbols\", (PyCFunction)__pyx_pw_9pywrapfst_11_MutableFst_53set_input_symbols, METH_O, __pyx_doc_9pywrapfst_11_MutableFst_52set_input_symbols},\n  {\"set_output_symbols\", (PyCFunction)__pyx_pw_9pywrapfst_11_MutableFst_55set_output_symbols, METH_O, __pyx_doc_9pywrapfst_11_MutableFst_54set_output_symbols},\n  {\"set_properties\", (PyCFunction)__pyx_pw_9pywrapfst_11_MutableFst_57set_properties, METH_VARARGS|METH_KEYWORDS, __pyx_doc_9pywrapfst_11_MutableFst_56set_properties},\n  {\"set_start\", (PyCFunction)__pyx_pw_9pywrapfst_11_MutableFst_59set_start, METH_O, __pyx_doc_9pywrapfst_11_MutableFst_58set_start},\n  {\"topsort\", (PyCFunction)__pyx_pw_9pywrapfst_11_MutableFst_61topsort, METH_NOARGS, __pyx_doc_9pywrapfst_11_MutableFst_60topsort},\n  {\"union\", (PyCFunction)__pyx_pw_9pywrapfst_11_MutableFst_63union, METH_O, __pyx_doc_9pywrapfst_11_MutableFst_62union},\n  {0, 0, 0, 0}\n};\n\nstatic PyTypeObject __pyx_type_9pywrapfst__MutableFst = {\n  PyVarObject_HEAD_INIT(0, 0)\n  \"pywrapfst._MutableFst\", /*tp_name*/\n  sizeof(struct __pyx_obj_9pywrapfst__MutableFst), /*tp_basicsize*/\n  0, /*tp_itemsize*/\n  __pyx_tp_dealloc_9pywrapfst__MutableFst, /*tp_dealloc*/\n  0, /*tp_print*/\n  0, /*tp_getattr*/\n  0, /*tp_setattr*/\n  #if PY_MAJOR_VERSION < 3\n  0, /*tp_compare*/\n  #endif\n  #if PY_MAJOR_VERSION >= 3\n  0, /*tp_as_async*/\n  #endif\n  #if CYTHON_COMPILING_IN_PYPY\n  __pyx_pw_9pywrapfst_4_Fst_3__repr__, /*tp_repr*/\n  #else\n  0, /*tp_repr*/\n  #endif\n  0, /*tp_as_number*/\n  0, /*tp_as_sequence*/\n  0, /*tp_as_mapping*/\n  0, /*tp_hash*/\n  0, /*tp_call*/\n  #if CYTHON_COMPILING_IN_PYPY\n  __pyx_pw_9pywrapfst_4_Fst_7__str__, /*tp_str*/\n  #else\n  0, /*tp_str*/\n  #endif\n  0, /*tp_getattro*/\n  0, /*tp_setattro*/\n  0, /*tp_as_buffer*/\n  Py_TPFLAGS_DEFAULT|Py_TPFLAGS_HAVE_VERSION_TAG|Py_TPFLAGS_CHECKTYPES|Py_TPFLAGS_HAVE_NEWBUFFER|Py_TPFLAGS_BASETYPE, /*tp_flags*/\n  \"\\n  (No constructor.)\\n\\n  Mutable FST class, wrapping MutableFstClass.\\n\\n  This class extends _Fst by adding mutation operations.\\n  \", /*tp_doc*/\n  0, /*tp_traverse*/\n  0, /*tp_clear*/\n  0, /*tp_richcompare*/\n  0, /*tp_weaklistoffset*/\n  0, /*tp_iter*/\n  0, /*tp_iternext*/\n  __pyx_methods_9pywrapfst__MutableFst, /*tp_methods*/\n  0, /*tp_members*/\n  0, /*tp_getset*/\n  0, /*tp_base*/\n  0, /*tp_dict*/\n  0, /*tp_descr_get*/\n  0, /*tp_descr_set*/\n  0, /*tp_dictoffset*/\n  #if CYTHON_COMPILING_IN_PYPY\n  __pyx_pw_9pywrapfst_4_Fst_5__init__, /*tp_init*/\n  #else\n  0, /*tp_init*/\n  #endif\n  0, /*tp_alloc*/\n  __pyx_tp_new_9pywrapfst__MutableFst, /*tp_new*/\n  0, /*tp_free*/\n  0, /*tp_is_gc*/\n  0, /*tp_bases*/\n  0, /*tp_mro*/\n  0, /*tp_cache*/\n  0, /*tp_subclasses*/\n  0, /*tp_weaklist*/\n  0, /*tp_del*/\n  0, /*tp_version_tag*/\n  #if PY_VERSION_HEX >= 0x030400a1\n  0, /*tp_finalize*/\n  #endif\n};\nstatic struct __pyx_vtabstruct_9pywrapfst_Arc __pyx_vtable_9pywrapfst_Arc;\n\nstatic PyObject *__pyx_tp_new_9pywrapfst_Arc(PyTypeObject *t, CYTHON_UNUSED PyObject *a, CYTHON_UNUSED PyObject *k) {\n  struct __pyx_obj_9pywrapfst_Arc *p;\n  PyObject *o;\n  if (likely((t->tp_flags & Py_TPFLAGS_IS_ABSTRACT) == 0)) {\n    o = (*t->tp_alloc)(t, 0);\n  } else {\n    o = (PyObject *) PyBaseObject_Type.tp_new(t, __pyx_empty_tuple, 0);\n  }\n  if (unlikely(!o)) return 0;\n  p = ((struct __pyx_obj_9pywrapfst_Arc *)o);\n  p->__pyx_vtab = __pyx_vtabptr_9pywrapfst_Arc;\n  new((void*)&(p->_arc)) std::unique_ptr<fst::script::ArcClass> ();\n  return o;\n}\n\nstatic void __pyx_tp_dealloc_9pywrapfst_Arc(PyObject *o) {\n  struct __pyx_obj_9pywrapfst_Arc *p = (struct __pyx_obj_9pywrapfst_Arc *)o;\n  #if CYTHON_USE_TP_FINALIZE\n  if (unlikely(PyType_HasFeature(Py_TYPE(o), Py_TPFLAGS_HAVE_FINALIZE) && Py_TYPE(o)->tp_finalize) && (!PyType_IS_GC(Py_TYPE(o)) || !_PyGC_FINALIZED(o))) {\n    if (PyObject_CallFinalizerFromDealloc(o)) return;\n  }\n  #endif\n  __Pyx_call_destructor(p->_arc);\n  (*Py_TYPE(o)->tp_free)(o);\n}\n\nstatic PyObject *__pyx_getprop_9pywrapfst_3Arc_ilabel(PyObject *o, CYTHON_UNUSED void *x) {\n  return __pyx_pw_9pywrapfst_3Arc_6ilabel_1__get__(o);\n}\n\nstatic int __pyx_setprop_9pywrapfst_3Arc_ilabel(PyObject *o, PyObject *v, CYTHON_UNUSED void *x) {\n  if (v) {\n    return __pyx_pw_9pywrapfst_3Arc_6ilabel_3__set__(o, v);\n  }\n  else {\n    PyErr_SetString(PyExc_NotImplementedError, \"__del__\");\n    return -1;\n  }\n}\n\nstatic PyObject *__pyx_getprop_9pywrapfst_3Arc_olabel(PyObject *o, CYTHON_UNUSED void *x) {\n  return __pyx_pw_9pywrapfst_3Arc_6olabel_1__get__(o);\n}\n\nstatic int __pyx_setprop_9pywrapfst_3Arc_olabel(PyObject *o, PyObject *v, CYTHON_UNUSED void *x) {\n  if (v) {\n    return __pyx_pw_9pywrapfst_3Arc_6olabel_3__set__(o, v);\n  }\n  else {\n    PyErr_SetString(PyExc_NotImplementedError, \"__del__\");\n    return -1;\n  }\n}\n\nstatic PyObject *__pyx_getprop_9pywrapfst_3Arc_weight(PyObject *o, CYTHON_UNUSED void *x) {\n  return __pyx_pw_9pywrapfst_3Arc_6weight_1__get__(o);\n}\n\nstatic int __pyx_setprop_9pywrapfst_3Arc_weight(PyObject *o, PyObject *v, CYTHON_UNUSED void *x) {\n  if (v) {\n    return __pyx_pw_9pywrapfst_3Arc_6weight_3__set__(o, v);\n  }\n  else {\n    PyErr_SetString(PyExc_NotImplementedError, \"__del__\");\n    return -1;\n  }\n}\n\nstatic PyObject *__pyx_getprop_9pywrapfst_3Arc_nextstate(PyObject *o, CYTHON_UNUSED void *x) {\n  return __pyx_pw_9pywrapfst_3Arc_9nextstate_1__get__(o);\n}\n\nstatic int __pyx_setprop_9pywrapfst_3Arc_nextstate(PyObject *o, PyObject *v, CYTHON_UNUSED void *x) {\n  if (v) {\n    return __pyx_pw_9pywrapfst_3Arc_9nextstate_3__set__(o, v);\n  }\n  else {\n    PyErr_SetString(PyExc_NotImplementedError, \"__del__\");\n    return -1;\n  }\n}\n\nstatic PyMethodDef __pyx_methods_9pywrapfst_Arc[] = {\n  {\"copy\", (PyCFunction)__pyx_pw_9pywrapfst_3Arc_5copy, METH_NOARGS, 0},\n  {\"__reduce_cython__\", (PyCFunction)__pyx_pw_9pywrapfst_3Arc_7__reduce_cython__, METH_NOARGS, 0},\n  {\"__setstate_cython__\", (PyCFunction)__pyx_pw_9pywrapfst_3Arc_9__setstate_cython__, METH_O, 0},\n  {0, 0, 0, 0}\n};\n\nstatic struct PyGetSetDef __pyx_getsets_9pywrapfst_Arc[] = {\n  {(char *)\"ilabel\", __pyx_getprop_9pywrapfst_3Arc_ilabel, __pyx_setprop_9pywrapfst_3Arc_ilabel, (char *)0, 0},\n  {(char *)\"olabel\", __pyx_getprop_9pywrapfst_3Arc_olabel, __pyx_setprop_9pywrapfst_3Arc_olabel, (char *)0, 0},\n  {(char *)\"weight\", __pyx_getprop_9pywrapfst_3Arc_weight, __pyx_setprop_9pywrapfst_3Arc_weight, (char *)0, 0},\n  {(char *)\"nextstate\", __pyx_getprop_9pywrapfst_3Arc_nextstate, __pyx_setprop_9pywrapfst_3Arc_nextstate, (char *)0, 0},\n  {0, 0, 0, 0, 0}\n};\n\nstatic PyTypeObject __pyx_type_9pywrapfst_Arc = {\n  PyVarObject_HEAD_INIT(0, 0)\n  \"pywrapfst.Arc\", /*tp_name*/\n  sizeof(struct __pyx_obj_9pywrapfst_Arc), /*tp_basicsize*/\n  0, /*tp_itemsize*/\n  __pyx_tp_dealloc_9pywrapfst_Arc, /*tp_dealloc*/\n  0, /*tp_print*/\n  0, /*tp_getattr*/\n  0, /*tp_setattr*/\n  #if PY_MAJOR_VERSION < 3\n  0, /*tp_compare*/\n  #endif\n  #if PY_MAJOR_VERSION >= 3\n  0, /*tp_as_async*/\n  #endif\n  __pyx_pw_9pywrapfst_3Arc_1__repr__, /*tp_repr*/\n  0, /*tp_as_number*/\n  0, /*tp_as_sequence*/\n  0, /*tp_as_mapping*/\n  0, /*tp_hash*/\n  0, /*tp_call*/\n  0, /*tp_str*/\n  0, /*tp_getattro*/\n  0, /*tp_setattro*/\n  0, /*tp_as_buffer*/\n  Py_TPFLAGS_DEFAULT|Py_TPFLAGS_HAVE_VERSION_TAG|Py_TPFLAGS_CHECKTYPES|Py_TPFLAGS_HAVE_NEWBUFFER|Py_TPFLAGS_BASETYPE, /*tp_flags*/\n  \"\\n  Arc(ilabel, olabel, weight, nextstate)\\n\\n  This class represents an arc while remaining agnostic about the underlying arc\\n  type.  Attributes of the arc can be accessed or mutated, and the arc can be\\n  copied.\\n\\n  Attributes:\\n    ilabel: The input label.\\n    olabel: The output label.\\n    weight: The arc weight.\\n    nextstate: The destination state for the arc.\\n  \", /*tp_doc*/\n  0, /*tp_traverse*/\n  0, /*tp_clear*/\n  0, /*tp_richcompare*/\n  0, /*tp_weaklistoffset*/\n  0, /*tp_iter*/\n  0, /*tp_iternext*/\n  __pyx_methods_9pywrapfst_Arc, /*tp_methods*/\n  0, /*tp_members*/\n  __pyx_getsets_9pywrapfst_Arc, /*tp_getset*/\n  0, /*tp_base*/\n  0, /*tp_dict*/\n  0, /*tp_descr_get*/\n  0, /*tp_descr_set*/\n  0, /*tp_dictoffset*/\n  __pyx_pw_9pywrapfst_3Arc_3__init__, /*tp_init*/\n  0, /*tp_alloc*/\n  __pyx_tp_new_9pywrapfst_Arc, /*tp_new*/\n  0, /*tp_free*/\n  0, /*tp_is_gc*/\n  0, /*tp_bases*/\n  0, /*tp_mro*/\n  0, /*tp_cache*/\n  0, /*tp_subclasses*/\n  0, /*tp_weaklist*/\n  0, /*tp_del*/\n  0, /*tp_version_tag*/\n  #if PY_VERSION_HEX >= 0x030400a1\n  0, /*tp_finalize*/\n  #endif\n};\nstatic struct __pyx_vtabstruct_9pywrapfst_ArcIterator __pyx_vtable_9pywrapfst_ArcIterator;\n\nstatic PyObject *__pyx_tp_new_9pywrapfst_ArcIterator(PyTypeObject *t, CYTHON_UNUSED PyObject *a, CYTHON_UNUSED PyObject *k) {\n  struct __pyx_obj_9pywrapfst_ArcIterator *p;\n  PyObject *o;\n  if (likely((t->tp_flags & Py_TPFLAGS_IS_ABSTRACT) == 0)) {\n    o = (*t->tp_alloc)(t, 0);\n  } else {\n    o = (PyObject *) PyBaseObject_Type.tp_new(t, __pyx_empty_tuple, 0);\n  }\n  if (unlikely(!o)) return 0;\n  p = ((struct __pyx_obj_9pywrapfst_ArcIterator *)o);\n  p->__pyx_vtab = __pyx_vtabptr_9pywrapfst_ArcIterator;\n  new((void*)&(p->_fst)) std::shared_ptr<fst::script::FstClass> ();\n  new((void*)&(p->_aiter)) std::unique_ptr<fst::script::ArcIteratorClass> ();\n  return o;\n}\n\nstatic void __pyx_tp_dealloc_9pywrapfst_ArcIterator(PyObject *o) {\n  struct __pyx_obj_9pywrapfst_ArcIterator *p = (struct __pyx_obj_9pywrapfst_ArcIterator *)o;\n  #if CYTHON_USE_TP_FINALIZE\n  if (unlikely(PyType_HasFeature(Py_TYPE(o), Py_TPFLAGS_HAVE_FINALIZE) && Py_TYPE(o)->tp_finalize) && (!PyType_IS_GC(Py_TYPE(o)) || !_PyGC_FINALIZED(o))) {\n    if (PyObject_CallFinalizerFromDealloc(o)) return;\n  }\n  #endif\n  __Pyx_call_destructor(p->_fst);\n  __Pyx_call_destructor(p->_aiter);\n  (*Py_TYPE(o)->tp_free)(o);\n}\n\nstatic PyMethodDef __pyx_methods_9pywrapfst_ArcIterator[] = {\n  {\"__next__\", (PyCFunction)__pyx_pw_9pywrapfst_11ArcIterator_7__next__, METH_NOARGS|METH_COEXIST, 0},\n  {\"done\", (PyCFunction)__pyx_pw_9pywrapfst_11ArcIterator_9done, METH_NOARGS, __pyx_doc_9pywrapfst_11ArcIterator_8done},\n  {\"flags\", (PyCFunction)__pyx_pw_9pywrapfst_11ArcIterator_11flags, METH_NOARGS, __pyx_doc_9pywrapfst_11ArcIterator_10flags},\n  {\"next\", (PyCFunction)__pyx_pw_9pywrapfst_11ArcIterator_13next, METH_NOARGS, __pyx_doc_9pywrapfst_11ArcIterator_12next},\n  {\"position\", (PyCFunction)__pyx_pw_9pywrapfst_11ArcIterator_15position, METH_NOARGS, __pyx_doc_9pywrapfst_11ArcIterator_14position},\n  {\"reset\", (PyCFunction)__pyx_pw_9pywrapfst_11ArcIterator_17reset, METH_NOARGS, __pyx_doc_9pywrapfst_11ArcIterator_16reset},\n  {\"seek\", (PyCFunction)__pyx_pw_9pywrapfst_11ArcIterator_19seek, METH_O, __pyx_doc_9pywrapfst_11ArcIterator_18seek},\n  {\"set_flags\", (PyCFunction)__pyx_pw_9pywrapfst_11ArcIterator_21set_flags, METH_VARARGS|METH_KEYWORDS, __pyx_doc_9pywrapfst_11ArcIterator_20set_flags},\n  {\"value\", (PyCFunction)__pyx_pw_9pywrapfst_11ArcIterator_23value, METH_NOARGS, __pyx_doc_9pywrapfst_11ArcIterator_22value},\n  {\"__reduce_cython__\", (PyCFunction)__pyx_pw_9pywrapfst_11ArcIterator_25__reduce_cython__, METH_NOARGS, 0},\n  {\"__setstate_cython__\", (PyCFunction)__pyx_pw_9pywrapfst_11ArcIterator_27__setstate_cython__, METH_O, 0},\n  {0, 0, 0, 0}\n};\n\nstatic PyTypeObject __pyx_type_9pywrapfst_ArcIterator = {\n  PyVarObject_HEAD_INIT(0, 0)\n  \"pywrapfst.ArcIterator\", /*tp_name*/\n  sizeof(struct __pyx_obj_9pywrapfst_ArcIterator), /*tp_basicsize*/\n  0, /*tp_itemsize*/\n  __pyx_tp_dealloc_9pywrapfst_ArcIterator, /*tp_dealloc*/\n  0, /*tp_print*/\n  0, /*tp_getattr*/\n  0, /*tp_setattr*/\n  #if PY_MAJOR_VERSION < 3\n  0, /*tp_compare*/\n  #endif\n  #if PY_MAJOR_VERSION >= 3\n  0, /*tp_as_async*/\n  #endif\n  __pyx_pw_9pywrapfst_11ArcIterator_1__repr__, /*tp_repr*/\n  0, /*tp_as_number*/\n  0, /*tp_as_sequence*/\n  0, /*tp_as_mapping*/\n  0, /*tp_hash*/\n  0, /*tp_call*/\n  0, /*tp_str*/\n  0, /*tp_getattro*/\n  0, /*tp_setattro*/\n  0, /*tp_as_buffer*/\n  Py_TPFLAGS_DEFAULT|Py_TPFLAGS_HAVE_VERSION_TAG|Py_TPFLAGS_CHECKTYPES|Py_TPFLAGS_HAVE_NEWBUFFER|Py_TPFLAGS_BASETYPE, /*tp_flags*/\n  \"\\n  ArcIterator(ifst, state)\\n\\n  This class is used for iterating over the arcs leaving some state of an FST.\\n  \", /*tp_doc*/\n  0, /*tp_traverse*/\n  0, /*tp_clear*/\n  0, /*tp_richcompare*/\n  0, /*tp_weaklistoffset*/\n  __pyx_pw_9pywrapfst_11ArcIterator_5__iter__, /*tp_iter*/\n  __pyx_pw_9pywrapfst_11ArcIterator_7__next__, /*tp_iternext*/\n  __pyx_methods_9pywrapfst_ArcIterator, /*tp_methods*/\n  0, /*tp_members*/\n  0, /*tp_getset*/\n  0, /*tp_base*/\n  0, /*tp_dict*/\n  0, /*tp_descr_get*/\n  0, /*tp_descr_set*/\n  0, /*tp_dictoffset*/\n  __pyx_pw_9pywrapfst_11ArcIterator_3__init__, /*tp_init*/\n  0, /*tp_alloc*/\n  __pyx_tp_new_9pywrapfst_ArcIterator, /*tp_new*/\n  0, /*tp_free*/\n  0, /*tp_is_gc*/\n  0, /*tp_bases*/\n  0, /*tp_mro*/\n  0, /*tp_cache*/\n  0, /*tp_subclasses*/\n  0, /*tp_weaklist*/\n  0, /*tp_del*/\n  0, /*tp_version_tag*/\n  #if PY_VERSION_HEX >= 0x030400a1\n  0, /*tp_finalize*/\n  #endif\n};\nstatic struct __pyx_vtabstruct_9pywrapfst_MutableArcIterator __pyx_vtable_9pywrapfst_MutableArcIterator;\n\nstatic PyObject *__pyx_tp_new_9pywrapfst_MutableArcIterator(PyTypeObject *t, CYTHON_UNUSED PyObject *a, CYTHON_UNUSED PyObject *k) {\n  struct __pyx_obj_9pywrapfst_MutableArcIterator *p;\n  PyObject *o;\n  if (likely((t->tp_flags & Py_TPFLAGS_IS_ABSTRACT) == 0)) {\n    o = (*t->tp_alloc)(t, 0);\n  } else {\n    o = (PyObject *) PyBaseObject_Type.tp_new(t, __pyx_empty_tuple, 0);\n  }\n  if (unlikely(!o)) return 0;\n  p = ((struct __pyx_obj_9pywrapfst_MutableArcIterator *)o);\n  p->__pyx_vtab = __pyx_vtabptr_9pywrapfst_MutableArcIterator;\n  new((void*)&(p->_mfst)) std::shared_ptr<fst::script::MutableFstClass> ();\n  new((void*)&(p->_aiter)) std::unique_ptr<fst::script::MutableArcIteratorClass> ();\n  return o;\n}\n\nstatic void __pyx_tp_dealloc_9pywrapfst_MutableArcIterator(PyObject *o) {\n  struct __pyx_obj_9pywrapfst_MutableArcIterator *p = (struct __pyx_obj_9pywrapfst_MutableArcIterator *)o;\n  #if CYTHON_USE_TP_FINALIZE\n  if (unlikely(PyType_HasFeature(Py_TYPE(o), Py_TPFLAGS_HAVE_FINALIZE) && Py_TYPE(o)->tp_finalize) && (!PyType_IS_GC(Py_TYPE(o)) || !_PyGC_FINALIZED(o))) {\n    if (PyObject_CallFinalizerFromDealloc(o)) return;\n  }\n  #endif\n  __Pyx_call_destructor(p->_mfst);\n  __Pyx_call_destructor(p->_aiter);\n  (*Py_TYPE(o)->tp_free)(o);\n}\n\nstatic PyMethodDef __pyx_methods_9pywrapfst_MutableArcIterator[] = {\n  {\"done\", (PyCFunction)__pyx_pw_9pywrapfst_18MutableArcIterator_5done, METH_NOARGS, __pyx_doc_9pywrapfst_18MutableArcIterator_4done},\n  {\"flags\", (PyCFunction)__pyx_pw_9pywrapfst_18MutableArcIterator_7flags, METH_NOARGS, __pyx_doc_9pywrapfst_18MutableArcIterator_6flags},\n  {\"next\", (PyCFunction)__pyx_pw_9pywrapfst_18MutableArcIterator_9next, METH_NOARGS, __pyx_doc_9pywrapfst_18MutableArcIterator_8next},\n  {\"position\", (PyCFunction)__pyx_pw_9pywrapfst_18MutableArcIterator_11position, METH_NOARGS, __pyx_doc_9pywrapfst_18MutableArcIterator_10position},\n  {\"reset\", (PyCFunction)__pyx_pw_9pywrapfst_18MutableArcIterator_13reset, METH_NOARGS, __pyx_doc_9pywrapfst_18MutableArcIterator_12reset},\n  {\"seek\", (PyCFunction)__pyx_pw_9pywrapfst_18MutableArcIterator_15seek, METH_O, __pyx_doc_9pywrapfst_18MutableArcIterator_14seek},\n  {\"set_flags\", (PyCFunction)__pyx_pw_9pywrapfst_18MutableArcIterator_17set_flags, METH_VARARGS|METH_KEYWORDS, __pyx_doc_9pywrapfst_18MutableArcIterator_16set_flags},\n  {\"set_value\", (PyCFunction)__pyx_pw_9pywrapfst_18MutableArcIterator_19set_value, METH_O, __pyx_doc_9pywrapfst_18MutableArcIterator_18set_value},\n  {\"value\", (PyCFunction)__pyx_pw_9pywrapfst_18MutableArcIterator_21value, METH_NOARGS, __pyx_doc_9pywrapfst_18MutableArcIterator_20value},\n  {\"__reduce_cython__\", (PyCFunction)__pyx_pw_9pywrapfst_18MutableArcIterator_23__reduce_cython__, METH_NOARGS, 0},\n  {\"__setstate_cython__\", (PyCFunction)__pyx_pw_9pywrapfst_18MutableArcIterator_25__setstate_cython__, METH_O, 0},\n  {0, 0, 0, 0}\n};\n\nstatic PyTypeObject __pyx_type_9pywrapfst_MutableArcIterator = {\n  PyVarObject_HEAD_INIT(0, 0)\n  \"pywrapfst.MutableArcIterator\", /*tp_name*/\n  sizeof(struct __pyx_obj_9pywrapfst_MutableArcIterator), /*tp_basicsize*/\n  0, /*tp_itemsize*/\n  __pyx_tp_dealloc_9pywrapfst_MutableArcIterator, /*tp_dealloc*/\n  0, /*tp_print*/\n  0, /*tp_getattr*/\n  0, /*tp_setattr*/\n  #if PY_MAJOR_VERSION < 3\n  0, /*tp_compare*/\n  #endif\n  #if PY_MAJOR_VERSION >= 3\n  0, /*tp_as_async*/\n  #endif\n  __pyx_pw_9pywrapfst_18MutableArcIterator_1__repr__, /*tp_repr*/\n  0, /*tp_as_number*/\n  0, /*tp_as_sequence*/\n  0, /*tp_as_mapping*/\n  0, /*tp_hash*/\n  0, /*tp_call*/\n  0, /*tp_str*/\n  0, /*tp_getattro*/\n  0, /*tp_setattro*/\n  0, /*tp_as_buffer*/\n  Py_TPFLAGS_DEFAULT|Py_TPFLAGS_HAVE_VERSION_TAG|Py_TPFLAGS_CHECKTYPES|Py_TPFLAGS_HAVE_NEWBUFFER|Py_TPFLAGS_BASETYPE, /*tp_flags*/\n  \"\\n  MutableArcIterator(ifst, state)\\n\\n  This class is used for iterating over the arcs leaving some state of an FST,\\n  also permitting mutation of the current arc.\\n  \", /*tp_doc*/\n  0, /*tp_traverse*/\n  0, /*tp_clear*/\n  0, /*tp_richcompare*/\n  0, /*tp_weaklistoffset*/\n  0, /*tp_iter*/\n  0, /*tp_iternext*/\n  __pyx_methods_9pywrapfst_MutableArcIterator, /*tp_methods*/\n  0, /*tp_members*/\n  0, /*tp_getset*/\n  0, /*tp_base*/\n  0, /*tp_dict*/\n  0, /*tp_descr_get*/\n  0, /*tp_descr_set*/\n  0, /*tp_dictoffset*/\n  __pyx_pw_9pywrapfst_18MutableArcIterator_3__init__, /*tp_init*/\n  0, /*tp_alloc*/\n  __pyx_tp_new_9pywrapfst_MutableArcIterator, /*tp_new*/\n  0, /*tp_free*/\n  0, /*tp_is_gc*/\n  0, /*tp_bases*/\n  0, /*tp_mro*/\n  0, /*tp_cache*/\n  0, /*tp_subclasses*/\n  0, /*tp_weaklist*/\n  0, /*tp_del*/\n  0, /*tp_version_tag*/\n  #if PY_VERSION_HEX >= 0x030400a1\n  0, /*tp_finalize*/\n  #endif\n};\nstatic struct __pyx_vtabstruct_9pywrapfst_StateIterator __pyx_vtable_9pywrapfst_StateIterator;\n\nstatic PyObject *__pyx_tp_new_9pywrapfst_StateIterator(PyTypeObject *t, CYTHON_UNUSED PyObject *a, CYTHON_UNUSED PyObject *k) {\n  struct __pyx_obj_9pywrapfst_StateIterator *p;\n  PyObject *o;\n  if (likely((t->tp_flags & Py_TPFLAGS_IS_ABSTRACT) == 0)) {\n    o = (*t->tp_alloc)(t, 0);\n  } else {\n    o = (PyObject *) PyBaseObject_Type.tp_new(t, __pyx_empty_tuple, 0);\n  }\n  if (unlikely(!o)) return 0;\n  p = ((struct __pyx_obj_9pywrapfst_StateIterator *)o);\n  p->__pyx_vtab = __pyx_vtabptr_9pywrapfst_StateIterator;\n  new((void*)&(p->_fst)) std::shared_ptr<fst::script::FstClass> ();\n  new((void*)&(p->_siter)) std::unique_ptr<fst::script::StateIteratorClass> ();\n  return o;\n}\n\nstatic void __pyx_tp_dealloc_9pywrapfst_StateIterator(PyObject *o) {\n  struct __pyx_obj_9pywrapfst_StateIterator *p = (struct __pyx_obj_9pywrapfst_StateIterator *)o;\n  #if CYTHON_USE_TP_FINALIZE\n  if (unlikely(PyType_HasFeature(Py_TYPE(o), Py_TPFLAGS_HAVE_FINALIZE) && Py_TYPE(o)->tp_finalize) && (!PyType_IS_GC(Py_TYPE(o)) || !_PyGC_FINALIZED(o))) {\n    if (PyObject_CallFinalizerFromDealloc(o)) return;\n  }\n  #endif\n  __Pyx_call_destructor(p->_fst);\n  __Pyx_call_destructor(p->_siter);\n  (*Py_TYPE(o)->tp_free)(o);\n}\n\nstatic PyMethodDef __pyx_methods_9pywrapfst_StateIterator[] = {\n  {\"__next__\", (PyCFunction)__pyx_pw_9pywrapfst_13StateIterator_7__next__, METH_NOARGS|METH_COEXIST, 0},\n  {\"done\", (PyCFunction)__pyx_pw_9pywrapfst_13StateIterator_9done, METH_NOARGS, __pyx_doc_9pywrapfst_13StateIterator_8done},\n  {\"next\", (PyCFunction)__pyx_pw_9pywrapfst_13StateIterator_11next, METH_NOARGS, __pyx_doc_9pywrapfst_13StateIterator_10next},\n  {\"reset\", (PyCFunction)__pyx_pw_9pywrapfst_13StateIterator_13reset, METH_NOARGS, __pyx_doc_9pywrapfst_13StateIterator_12reset},\n  {\"value\", (PyCFunction)__pyx_pw_9pywrapfst_13StateIterator_15value, METH_NOARGS, __pyx_doc_9pywrapfst_13StateIterator_14value},\n  {\"__reduce_cython__\", (PyCFunction)__pyx_pw_9pywrapfst_13StateIterator_17__reduce_cython__, METH_NOARGS, 0},\n  {\"__setstate_cython__\", (PyCFunction)__pyx_pw_9pywrapfst_13StateIterator_19__setstate_cython__, METH_O, 0},\n  {0, 0, 0, 0}\n};\n\nstatic PyTypeObject __pyx_type_9pywrapfst_StateIterator = {\n  PyVarObject_HEAD_INIT(0, 0)\n  \"pywrapfst.StateIterator\", /*tp_name*/\n  sizeof(struct __pyx_obj_9pywrapfst_StateIterator), /*tp_basicsize*/\n  0, /*tp_itemsize*/\n  __pyx_tp_dealloc_9pywrapfst_StateIterator, /*tp_dealloc*/\n  0, /*tp_print*/\n  0, /*tp_getattr*/\n  0, /*tp_setattr*/\n  #if PY_MAJOR_VERSION < 3\n  0, /*tp_compare*/\n  #endif\n  #if PY_MAJOR_VERSION >= 3\n  0, /*tp_as_async*/\n  #endif\n  __pyx_pw_9pywrapfst_13StateIterator_1__repr__, /*tp_repr*/\n  0, /*tp_as_number*/\n  0, /*tp_as_sequence*/\n  0, /*tp_as_mapping*/\n  0, /*tp_hash*/\n  0, /*tp_call*/\n  0, /*tp_str*/\n  0, /*tp_getattro*/\n  0, /*tp_setattro*/\n  0, /*tp_as_buffer*/\n  Py_TPFLAGS_DEFAULT|Py_TPFLAGS_HAVE_VERSION_TAG|Py_TPFLAGS_CHECKTYPES|Py_TPFLAGS_HAVE_NEWBUFFER|Py_TPFLAGS_BASETYPE, /*tp_flags*/\n  \"\\n  StateIterator(ifst)\\n\\n  This class is used for iterating over the states in an FST.\\n  \", /*tp_doc*/\n  0, /*tp_traverse*/\n  0, /*tp_clear*/\n  0, /*tp_richcompare*/\n  0, /*tp_weaklistoffset*/\n  __pyx_pw_9pywrapfst_13StateIterator_5__iter__, /*tp_iter*/\n  __pyx_pw_9pywrapfst_13StateIterator_7__next__, /*tp_iternext*/\n  __pyx_methods_9pywrapfst_StateIterator, /*tp_methods*/\n  0, /*tp_members*/\n  0, /*tp_getset*/\n  0, /*tp_base*/\n  0, /*tp_dict*/\n  0, /*tp_descr_get*/\n  0, /*tp_descr_set*/\n  0, /*tp_dictoffset*/\n  __pyx_pw_9pywrapfst_13StateIterator_3__init__, /*tp_init*/\n  0, /*tp_alloc*/\n  __pyx_tp_new_9pywrapfst_StateIterator, /*tp_new*/\n  0, /*tp_free*/\n  0, /*tp_is_gc*/\n  0, /*tp_bases*/\n  0, /*tp_mro*/\n  0, /*tp_cache*/\n  0, /*tp_subclasses*/\n  0, /*tp_weaklist*/\n  0, /*tp_del*/\n  0, /*tp_version_tag*/\n  #if PY_VERSION_HEX >= 0x030400a1\n  0, /*tp_finalize*/\n  #endif\n};\nstatic struct __pyx_vtabstruct_9pywrapfst_Compiler __pyx_vtable_9pywrapfst_Compiler;\n\nstatic PyObject *__pyx_tp_new_9pywrapfst_Compiler(PyTypeObject *t, PyObject *a, PyObject *k) {\n  struct __pyx_obj_9pywrapfst_Compiler *p;\n  PyObject *o;\n  if (likely((t->tp_flags & Py_TPFLAGS_IS_ABSTRACT) == 0)) {\n    o = (*t->tp_alloc)(t, 0);\n  } else {\n    o = (PyObject *) PyBaseObject_Type.tp_new(t, __pyx_empty_tuple, 0);\n  }\n  if (unlikely(!o)) return 0;\n  p = ((struct __pyx_obj_9pywrapfst_Compiler *)o);\n  p->__pyx_vtab = __pyx_vtabptr_9pywrapfst_Compiler;\n  new((void*)&(p->_sstrm)) std::unique_ptr<std::stringstream> ();\n  new((void*)&(p->_fst_type)) std::string();\n  new((void*)&(p->_arc_type)) std::string();\n  if (unlikely(__pyx_pw_9pywrapfst_8Compiler_1__cinit__(o, a, k) < 0)) goto bad;\n  return o;\n  bad:\n  Py_DECREF(o); o = 0;\n  return NULL;\n}\n\nstatic void __pyx_tp_dealloc_9pywrapfst_Compiler(PyObject *o) {\n  struct __pyx_obj_9pywrapfst_Compiler *p = (struct __pyx_obj_9pywrapfst_Compiler *)o;\n  #if CYTHON_USE_TP_FINALIZE\n  if (unlikely(PyType_HasFeature(Py_TYPE(o), Py_TPFLAGS_HAVE_FINALIZE) && Py_TYPE(o)->tp_finalize) && (!PyType_IS_GC(Py_TYPE(o)) || !_PyGC_FINALIZED(o))) {\n    if (PyObject_CallFinalizerFromDealloc(o)) return;\n  }\n  #endif\n  __Pyx_call_destructor(p->_sstrm);\n  __Pyx_call_destructor(p->_fst_type);\n  __Pyx_call_destructor(p->_arc_type);\n  (*Py_TYPE(o)->tp_free)(o);\n}\n\nstatic PyMethodDef __pyx_methods_9pywrapfst_Compiler[] = {\n  {\"compile\", (PyCFunction)__pyx_pw_9pywrapfst_8Compiler_3compile, METH_NOARGS, __pyx_doc_9pywrapfst_8Compiler_2compile},\n  {\"write\", (PyCFunction)__pyx_pw_9pywrapfst_8Compiler_5write, METH_O, __pyx_doc_9pywrapfst_8Compiler_4write},\n  {\"__reduce_cython__\", (PyCFunction)__pyx_pw_9pywrapfst_8Compiler_7__reduce_cython__, METH_NOARGS, 0},\n  {\"__setstate_cython__\", (PyCFunction)__pyx_pw_9pywrapfst_8Compiler_9__setstate_cython__, METH_O, 0},\n  {0, 0, 0, 0}\n};\n\nstatic PyTypeObject __pyx_type_9pywrapfst_Compiler = {\n  PyVarObject_HEAD_INIT(0, 0)\n  \"pywrapfst.Compiler\", /*tp_name*/\n  sizeof(struct __pyx_obj_9pywrapfst_Compiler), /*tp_basicsize*/\n  0, /*tp_itemsize*/\n  __pyx_tp_dealloc_9pywrapfst_Compiler, /*tp_dealloc*/\n  0, /*tp_print*/\n  0, /*tp_getattr*/\n  0, /*tp_setattr*/\n  #if PY_MAJOR_VERSION < 3\n  0, /*tp_compare*/\n  #endif\n  #if PY_MAJOR_VERSION >= 3\n  0, /*tp_as_async*/\n  #endif\n  0, /*tp_repr*/\n  0, /*tp_as_number*/\n  0, /*tp_as_sequence*/\n  0, /*tp_as_mapping*/\n  0, /*tp_hash*/\n  0, /*tp_call*/\n  0, /*tp_str*/\n  0, /*tp_getattro*/\n  0, /*tp_setattro*/\n  0, /*tp_as_buffer*/\n  Py_TPFLAGS_DEFAULT|Py_TPFLAGS_HAVE_VERSION_TAG|Py_TPFLAGS_CHECKTYPES|Py_TPFLAGS_HAVE_NEWBUFFER|Py_TPFLAGS_BASETYPE, /*tp_flags*/\n  \"\\n  Compiler(fst_type=\\\"vector\\\", arc_type=\\\"standard\\\", isymbols=None,\\n           osymbols=None, ssymbols=None, acceptor=False, keep_isymbols=False,\\n           keep_osymbols=False, keep_state_numbering=False,\\n           allow_negative_labels=False)\\n\\n  Class used to compile FSTs from strings.\\n\\n  This class is used to compile FSTs specified using the AT&T FSM library\\n  format described here:\\n\\n  http://web.eecs.umich.edu/~radev/NLP-fall2015/resources/fsm_archive/fsm.5.html\\n\\n  This is the same format used by the `fstcompile` executable.\\n\\n  Compiler options (symbol tables, etc.) are set at construction time.\\n\\n      compiler = fst.Compiler(isymbols=ascii_syms, osymbols=ascii_syms)\\n\\n  Once constructed, Compiler instances behave like a file handle opened for\\n  writing:\\n\\n      # /ba+/\\n      print >> compiler, \\\"0 1 50 50\\\"\\n      print >> compiler, \\\"1 2 49 49\\\"\\n      print >> compiler, \\\"2 2 49 49\\\"\\n      print >> compiler, \\\"2\\\"\\n\\n  The `compile` method returns an actual FST instance:\\n\\n      sheep_machine = compiler.compile()\\n\\n  Compilation flushes the internal buffer, so the compiler instance can be\\n  reused to compile new machines with the same symbol tables (etc.)\\n\\n  Args:\\n    fst_type: A string indicating the container type for the compiled FST.\\n    arc_type: A string indicating the arc type for the compiled FST.\\n    isymbols: An optional SymbolTable used to label input symbols.\\n    osymbols: An optional SymbolTable used to label output symbols.\\n    ssymbols: An optional SymbolTable used to label states.\\n    acceptor: Should the FST be rendered in acceptor format if possible?\\n    keep_isymbols: Should the input symbol table be stored in the FST?\\n    keep_osymbols: Should the output symbol table be stored in the FST?\\n    keep_state_numbering: Should the state numbering be preserved?\\n    allow_negative_labels: Should negative labels be allowed? (Not\\n        recommended; may cause conflicts).\\n  \", /*tp_doc*/\n  0, /*tp_traverse*/\n  0, /*tp_clear*/\n  0, /*tp_richcompare*/\n  0, /*tp_weaklistoffset*/\n  0, /*tp_iter*/\n  0, /*tp_iternext*/\n  __pyx_methods_9pywrapfst_Compiler, /*tp_methods*/\n  0, /*tp_members*/\n  0, /*tp_getset*/\n  0, /*tp_base*/\n  0, /*tp_dict*/\n  0, /*tp_descr_get*/\n  0, /*tp_descr_set*/\n  0, /*tp_dictoffset*/\n  0, /*tp_init*/\n  0, /*tp_alloc*/\n  __pyx_tp_new_9pywrapfst_Compiler, /*tp_new*/\n  0, /*tp_free*/\n  0, /*tp_is_gc*/\n  0, /*tp_bases*/\n  0, /*tp_mro*/\n  0, /*tp_cache*/\n  0, /*tp_subclasses*/\n  0, /*tp_weaklist*/\n  0, /*tp_del*/\n  0, /*tp_version_tag*/\n  #if PY_VERSION_HEX >= 0x030400a1\n  0, /*tp_finalize*/\n  #endif\n};\nstatic struct __pyx_vtabstruct_9pywrapfst_FarReader __pyx_vtable_9pywrapfst_FarReader;\n\nstatic PyObject *__pyx_tp_new_9pywrapfst_FarReader(PyTypeObject *t, CYTHON_UNUSED PyObject *a, CYTHON_UNUSED PyObject *k) {\n  struct __pyx_obj_9pywrapfst_FarReader *p;\n  PyObject *o;\n  if (likely((t->tp_flags & Py_TPFLAGS_IS_ABSTRACT) == 0)) {\n    o = (*t->tp_alloc)(t, 0);\n  } else {\n    o = (PyObject *) PyBaseObject_Type.tp_new(t, __pyx_empty_tuple, 0);\n  }\n  if (unlikely(!o)) return 0;\n  p = ((struct __pyx_obj_9pywrapfst_FarReader *)o);\n  p->__pyx_vtab = __pyx_vtabptr_9pywrapfst_FarReader;\n  new((void*)&(p->_reader)) std::unique_ptr<fst::script::FarReaderClass> ();\n  return o;\n}\n\nstatic void __pyx_tp_dealloc_9pywrapfst_FarReader(PyObject *o) {\n  struct __pyx_obj_9pywrapfst_FarReader *p = (struct __pyx_obj_9pywrapfst_FarReader *)o;\n  #if CYTHON_USE_TP_FINALIZE\n  if (unlikely(PyType_HasFeature(Py_TYPE(o), Py_TPFLAGS_HAVE_FINALIZE) && Py_TYPE(o)->tp_finalize) && (!PyType_IS_GC(Py_TYPE(o)) || !_PyGC_FINALIZED(o))) {\n    if (PyObject_CallFinalizerFromDealloc(o)) return;\n  }\n  #endif\n  __Pyx_call_destructor(p->_reader);\n  (*Py_TYPE(o)->tp_free)(o);\n}\nstatic PyObject *__pyx_sq_item_9pywrapfst_FarReader(PyObject *o, Py_ssize_t i) {\n  PyObject *r;\n  PyObject *x = PyInt_FromSsize_t(i); if(!x) return 0;\n  r = Py_TYPE(o)->tp_as_mapping->mp_subscript(o, x);\n  Py_DECREF(x);\n  return r;\n}\n\nstatic PyMethodDef __pyx_methods_9pywrapfst_FarReader[] = {\n  {\"open\", (PyCFunction)__pyx_pw_9pywrapfst_9FarReader_5open, METH_VARARGS|METH_KEYWORDS, __pyx_doc_9pywrapfst_9FarReader_4open},\n  {\"arc_type\", (PyCFunction)__pyx_pw_9pywrapfst_9FarReader_7arc_type, METH_NOARGS, __pyx_doc_9pywrapfst_9FarReader_6arc_type},\n  {\"done\", (PyCFunction)__pyx_pw_9pywrapfst_9FarReader_9done, METH_NOARGS, __pyx_doc_9pywrapfst_9FarReader_8done},\n  {\"error\", (PyCFunction)__pyx_pw_9pywrapfst_9FarReader_11error, METH_NOARGS, __pyx_doc_9pywrapfst_9FarReader_10error},\n  {\"far_type\", (PyCFunction)__pyx_pw_9pywrapfst_9FarReader_13far_type, METH_NOARGS, 0},\n  {\"find\", (PyCFunction)__pyx_pw_9pywrapfst_9FarReader_15find, METH_O, __pyx_doc_9pywrapfst_9FarReader_14find},\n  {\"get_fst\", (PyCFunction)__pyx_pw_9pywrapfst_9FarReader_17get_fst, METH_NOARGS, __pyx_doc_9pywrapfst_9FarReader_16get_fst},\n  {\"get_key\", (PyCFunction)__pyx_pw_9pywrapfst_9FarReader_19get_key, METH_NOARGS, __pyx_doc_9pywrapfst_9FarReader_18get_key},\n  {\"next\", (PyCFunction)__pyx_pw_9pywrapfst_9FarReader_21next, METH_NOARGS, __pyx_doc_9pywrapfst_9FarReader_20next},\n  {\"reset\", (PyCFunction)__pyx_pw_9pywrapfst_9FarReader_23reset, METH_NOARGS, __pyx_doc_9pywrapfst_9FarReader_22reset},\n  {\"__reduce_cython__\", (PyCFunction)__pyx_pw_9pywrapfst_9FarReader_27__reduce_cython__, METH_NOARGS, 0},\n  {\"__setstate_cython__\", (PyCFunction)__pyx_pw_9pywrapfst_9FarReader_29__setstate_cython__, METH_O, 0},\n  {0, 0, 0, 0}\n};\n\nstatic PySequenceMethods __pyx_tp_as_sequence_FarReader = {\n  0, /*sq_length*/\n  0, /*sq_concat*/\n  0, /*sq_repeat*/\n  __pyx_sq_item_9pywrapfst_FarReader, /*sq_item*/\n  0, /*sq_slice*/\n  0, /*sq_ass_item*/\n  0, /*sq_ass_slice*/\n  0, /*sq_contains*/\n  0, /*sq_inplace_concat*/\n  0, /*sq_inplace_repeat*/\n};\n\nstatic PyMappingMethods __pyx_tp_as_mapping_FarReader = {\n  0, /*mp_length*/\n  __pyx_pw_9pywrapfst_9FarReader_25__getitem__, /*mp_subscript*/\n  0, /*mp_ass_subscript*/\n};\n\nstatic PyTypeObject __pyx_type_9pywrapfst_FarReader = {\n  PyVarObject_HEAD_INIT(0, 0)\n  \"pywrapfst.FarReader\", /*tp_name*/\n  sizeof(struct __pyx_obj_9pywrapfst_FarReader), /*tp_basicsize*/\n  0, /*tp_itemsize*/\n  __pyx_tp_dealloc_9pywrapfst_FarReader, /*tp_dealloc*/\n  0, /*tp_print*/\n  0, /*tp_getattr*/\n  0, /*tp_setattr*/\n  #if PY_MAJOR_VERSION < 3\n  0, /*tp_compare*/\n  #endif\n  #if PY_MAJOR_VERSION >= 3\n  0, /*tp_as_async*/\n  #endif\n  __pyx_pw_9pywrapfst_9FarReader_3__repr__, /*tp_repr*/\n  0, /*tp_as_number*/\n  &__pyx_tp_as_sequence_FarReader, /*tp_as_sequence*/\n  &__pyx_tp_as_mapping_FarReader, /*tp_as_mapping*/\n  0, /*tp_hash*/\n  0, /*tp_call*/\n  0, /*tp_str*/\n  0, /*tp_getattro*/\n  0, /*tp_setattro*/\n  0, /*tp_as_buffer*/\n  Py_TPFLAGS_DEFAULT|Py_TPFLAGS_HAVE_VERSION_TAG|Py_TPFLAGS_CHECKTYPES|Py_TPFLAGS_HAVE_NEWBUFFER|Py_TPFLAGS_BASETYPE, /*tp_flags*/\n  \"\\n  (No constructor.)\\n\\n  FAR (\\\"Fst ARchive\\\") reader object.\\n\\n  This class is used to read a FAR from disk. FARs contain one or more FSTs (of\\n  the same arc type) indexed by a unique string key. To construct a FarReader\\n  object, use the `open` class method.\\n\\n  Attributes:\\n    arc_type: A string indicating the arc type.\\n    far_type: A string indicating the FAR type.\\n  \", /*tp_doc*/\n  0, /*tp_traverse*/\n  0, /*tp_clear*/\n  0, /*tp_richcompare*/\n  0, /*tp_weaklistoffset*/\n  0, /*tp_iter*/\n  0, /*tp_iternext*/\n  __pyx_methods_9pywrapfst_FarReader, /*tp_methods*/\n  0, /*tp_members*/\n  0, /*tp_getset*/\n  0, /*tp_base*/\n  0, /*tp_dict*/\n  0, /*tp_descr_get*/\n  0, /*tp_descr_set*/\n  0, /*tp_dictoffset*/\n  __pyx_pw_9pywrapfst_9FarReader_1__init__, /*tp_init*/\n  0, /*tp_alloc*/\n  __pyx_tp_new_9pywrapfst_FarReader, /*tp_new*/\n  0, /*tp_free*/\n  0, /*tp_is_gc*/\n  0, /*tp_bases*/\n  0, /*tp_mro*/\n  0, /*tp_cache*/\n  0, /*tp_subclasses*/\n  0, /*tp_weaklist*/\n  0, /*tp_del*/\n  0, /*tp_version_tag*/\n  #if PY_VERSION_HEX >= 0x030400a1\n  0, /*tp_finalize*/\n  #endif\n};\nstatic struct __pyx_vtabstruct_9pywrapfst_FarWriter __pyx_vtable_9pywrapfst_FarWriter;\n\nstatic PyObject *__pyx_tp_new_9pywrapfst_FarWriter(PyTypeObject *t, CYTHON_UNUSED PyObject *a, CYTHON_UNUSED PyObject *k) {\n  struct __pyx_obj_9pywrapfst_FarWriter *p;\n  PyObject *o;\n  if (likely((t->tp_flags & Py_TPFLAGS_IS_ABSTRACT) == 0)) {\n    o = (*t->tp_alloc)(t, 0);\n  } else {\n    o = (PyObject *) PyBaseObject_Type.tp_new(t, __pyx_empty_tuple, 0);\n  }\n  if (unlikely(!o)) return 0;\n  p = ((struct __pyx_obj_9pywrapfst_FarWriter *)o);\n  p->__pyx_vtab = __pyx_vtabptr_9pywrapfst_FarWriter;\n  new((void*)&(p->_writer)) std::unique_ptr<fst::script::FarWriterClass> ();\n  return o;\n}\n\nstatic void __pyx_tp_dealloc_9pywrapfst_FarWriter(PyObject *o) {\n  struct __pyx_obj_9pywrapfst_FarWriter *p = (struct __pyx_obj_9pywrapfst_FarWriter *)o;\n  #if CYTHON_USE_TP_FINALIZE\n  if (unlikely(PyType_HasFeature(Py_TYPE(o), Py_TPFLAGS_HAVE_FINALIZE) && Py_TYPE(o)->tp_finalize) && (!PyType_IS_GC(Py_TYPE(o)) || !_PyGC_FINALIZED(o))) {\n    if (PyObject_CallFinalizerFromDealloc(o)) return;\n  }\n  #endif\n  __Pyx_call_destructor(p->_writer);\n  (*Py_TYPE(o)->tp_free)(o);\n}\n\nstatic int __pyx_mp_ass_subscript_9pywrapfst_FarWriter(PyObject *o, PyObject *i, PyObject *v) {\n  if (v) {\n    return __pyx_pw_9pywrapfst_9FarWriter_15__setitem__(o, i, v);\n  }\n  else {\n    PyErr_Format(PyExc_NotImplementedError,\n      \"Subscript deletion not supported by %.200s\", Py_TYPE(o)->tp_name);\n    return -1;\n  }\n}\n\nstatic PyMethodDef __pyx_methods_9pywrapfst_FarWriter[] = {\n  {\"create\", (PyCFunction)__pyx_pw_9pywrapfst_9FarWriter_5create, METH_VARARGS|METH_KEYWORDS, __pyx_doc_9pywrapfst_9FarWriter_4create},\n  {\"add\", (PyCFunction)__pyx_pw_9pywrapfst_9FarWriter_7add, METH_VARARGS|METH_KEYWORDS, __pyx_doc_9pywrapfst_9FarWriter_6add},\n  {\"arc_type\", (PyCFunction)__pyx_pw_9pywrapfst_9FarWriter_9arc_type, METH_NOARGS, __pyx_doc_9pywrapfst_9FarWriter_8arc_type},\n  {\"error\", (PyCFunction)__pyx_pw_9pywrapfst_9FarWriter_11error, METH_NOARGS, __pyx_doc_9pywrapfst_9FarWriter_10error},\n  {\"far_type\", (PyCFunction)__pyx_pw_9pywrapfst_9FarWriter_13far_type, METH_NOARGS, __pyx_doc_9pywrapfst_9FarWriter_12far_type},\n  {\"__reduce_cython__\", (PyCFunction)__pyx_pw_9pywrapfst_9FarWriter_17__reduce_cython__, METH_NOARGS, 0},\n  {\"__setstate_cython__\", (PyCFunction)__pyx_pw_9pywrapfst_9FarWriter_19__setstate_cython__, METH_O, 0},\n  {0, 0, 0, 0}\n};\n\nstatic PyMappingMethods __pyx_tp_as_mapping_FarWriter = {\n  0, /*mp_length*/\n  0, /*mp_subscript*/\n  __pyx_mp_ass_subscript_9pywrapfst_FarWriter, /*mp_ass_subscript*/\n};\n\nstatic PyTypeObject __pyx_type_9pywrapfst_FarWriter = {\n  PyVarObject_HEAD_INIT(0, 0)\n  \"pywrapfst.FarWriter\", /*tp_name*/\n  sizeof(struct __pyx_obj_9pywrapfst_FarWriter), /*tp_basicsize*/\n  0, /*tp_itemsize*/\n  __pyx_tp_dealloc_9pywrapfst_FarWriter, /*tp_dealloc*/\n  0, /*tp_print*/\n  0, /*tp_getattr*/\n  0, /*tp_setattr*/\n  #if PY_MAJOR_VERSION < 3\n  0, /*tp_compare*/\n  #endif\n  #if PY_MAJOR_VERSION >= 3\n  0, /*tp_as_async*/\n  #endif\n  __pyx_pw_9pywrapfst_9FarWriter_3__repr__, /*tp_repr*/\n  0, /*tp_as_number*/\n  0, /*tp_as_sequence*/\n  &__pyx_tp_as_mapping_FarWriter, /*tp_as_mapping*/\n  0, /*tp_hash*/\n  0, /*tp_call*/\n  0, /*tp_str*/\n  0, /*tp_getattro*/\n  0, /*tp_setattro*/\n  0, /*tp_as_buffer*/\n  Py_TPFLAGS_DEFAULT|Py_TPFLAGS_HAVE_VERSION_TAG|Py_TPFLAGS_CHECKTYPES|Py_TPFLAGS_HAVE_NEWBUFFER|Py_TPFLAGS_BASETYPE, /*tp_flags*/\n  \"\\n  (No constructor.)\\n\\n  FAR (\\\"Fst ARchive\\\") writer object.\\n\\n  This class is used to write FSTs (of the same arc type) to a FAR on disk. To\\n  construct a FarWriter, use the `create` class method.\\n\\n  Note that the data is not guaranteed to flush to disk until the FarWriter\\n  is garbage-collected. If a FarWriter has been assigned to only one variable,\\n  then calling `del` on that variable should decrement the object's reference\\n  count from 1 to 0, triggering a flush to disk on the next GC cycle.\\n\\n  Attributes:\\n    arc_type: A string indicating the arc type.\\n    far_type: A string indicating the FAR type.\\n  \", /*tp_doc*/\n  0, /*tp_traverse*/\n  0, /*tp_clear*/\n  0, /*tp_richcompare*/\n  0, /*tp_weaklistoffset*/\n  0, /*tp_iter*/\n  0, /*tp_iternext*/\n  __pyx_methods_9pywrapfst_FarWriter, /*tp_methods*/\n  0, /*tp_members*/\n  0, /*tp_getset*/\n  0, /*tp_base*/\n  0, /*tp_dict*/\n  0, /*tp_descr_get*/\n  0, /*tp_descr_set*/\n  0, /*tp_dictoffset*/\n  __pyx_pw_9pywrapfst_9FarWriter_1__init__, /*tp_init*/\n  0, /*tp_alloc*/\n  __pyx_tp_new_9pywrapfst_FarWriter, /*tp_new*/\n  0, /*tp_free*/\n  0, /*tp_is_gc*/\n  0, /*tp_bases*/\n  0, /*tp_mro*/\n  0, /*tp_cache*/\n  0, /*tp_subclasses*/\n  0, /*tp_weaklist*/\n  0, /*tp_del*/\n  0, /*tp_version_tag*/\n  #if PY_VERSION_HEX >= 0x030400a1\n  0, /*tp_finalize*/\n  #endif\n};\n\nstatic PyMethodDef __pyx_methods[] = {\n  {\"compact_symbol_table\", (PyCFunction)__pyx_pw_9pywrapfst_9compact_symbol_table, METH_O, __pyx_doc_9pywrapfst_8compact_symbol_table},\n  {\"merge_symbol_table\", (PyCFunction)__pyx_pw_9pywrapfst_11merge_symbol_table, METH_VARARGS|METH_KEYWORDS, __pyx_doc_9pywrapfst_10merge_symbol_table},\n  {\"_read\", (PyCFunction)__pyx_pw_9pywrapfst_13_read, METH_O, 0},\n  {\"_read_from_string\", (PyCFunction)__pyx_pw_9pywrapfst_15_read_from_string, METH_O, 0},\n  {\"arcmap\", (PyCFunction)__pyx_pw_9pywrapfst_17arcmap, METH_VARARGS|METH_KEYWORDS, __pyx_doc_9pywrapfst_16arcmap},\n  {\"compose\", (PyCFunction)__pyx_pw_9pywrapfst_19compose, METH_VARARGS|METH_KEYWORDS, __pyx_doc_9pywrapfst_18compose},\n  {\"convert\", (PyCFunction)__pyx_pw_9pywrapfst_21convert, METH_VARARGS|METH_KEYWORDS, __pyx_doc_9pywrapfst_20convert},\n  {\"determinize\", (PyCFunction)__pyx_pw_9pywrapfst_23determinize, METH_VARARGS|METH_KEYWORDS, __pyx_doc_9pywrapfst_22determinize},\n  {\"difference\", (PyCFunction)__pyx_pw_9pywrapfst_25difference, METH_VARARGS|METH_KEYWORDS, __pyx_doc_9pywrapfst_24difference},\n  {\"disambiguate\", (PyCFunction)__pyx_pw_9pywrapfst_27disambiguate, METH_VARARGS|METH_KEYWORDS, __pyx_doc_9pywrapfst_26disambiguate},\n  {\"epsnormalize\", (PyCFunction)__pyx_pw_9pywrapfst_29epsnormalize, METH_VARARGS|METH_KEYWORDS, __pyx_doc_9pywrapfst_28epsnormalize},\n  {\"equal\", (PyCFunction)__pyx_pw_9pywrapfst_31equal, METH_VARARGS|METH_KEYWORDS, __pyx_doc_9pywrapfst_30equal},\n  {\"equivalent\", (PyCFunction)__pyx_pw_9pywrapfst_33equivalent, METH_VARARGS|METH_KEYWORDS, __pyx_doc_9pywrapfst_32equivalent},\n  {\"intersect\", (PyCFunction)__pyx_pw_9pywrapfst_35intersect, METH_VARARGS|METH_KEYWORDS, __pyx_doc_9pywrapfst_34intersect},\n  {\"isomorphic\", (PyCFunction)__pyx_pw_9pywrapfst_37isomorphic, METH_VARARGS|METH_KEYWORDS, __pyx_doc_9pywrapfst_36isomorphic},\n  {\"prune\", (PyCFunction)__pyx_pw_9pywrapfst_39prune, METH_VARARGS|METH_KEYWORDS, __pyx_doc_9pywrapfst_38prune},\n  {\"push\", (PyCFunction)__pyx_pw_9pywrapfst_41push, METH_VARARGS|METH_KEYWORDS, __pyx_doc_9pywrapfst_40push},\n  {\"randequivalent\", (PyCFunction)__pyx_pw_9pywrapfst_43randequivalent, METH_VARARGS|METH_KEYWORDS, __pyx_doc_9pywrapfst_42randequivalent},\n  {\"randgen\", (PyCFunction)__pyx_pw_9pywrapfst_45randgen, METH_VARARGS|METH_KEYWORDS, __pyx_doc_9pywrapfst_44randgen},\n  {\"replace\", (PyCFunction)__pyx_pw_9pywrapfst_47replace, METH_VARARGS|METH_KEYWORDS, __pyx_doc_9pywrapfst_46replace},\n  {\"reverse\", (PyCFunction)__pyx_pw_9pywrapfst_49reverse, METH_VARARGS|METH_KEYWORDS, __pyx_doc_9pywrapfst_48reverse},\n  {\"shortestpath\", (PyCFunction)__pyx_pw_9pywrapfst_53shortestpath, METH_VARARGS|METH_KEYWORDS, __pyx_doc_9pywrapfst_52shortestpath},\n  {\"statemap\", (PyCFunction)__pyx_pw_9pywrapfst_55statemap, METH_VARARGS|METH_KEYWORDS, __pyx_doc_9pywrapfst_54statemap},\n  {\"synchronize\", (PyCFunction)__pyx_pw_9pywrapfst_57synchronize, METH_O, __pyx_doc_9pywrapfst_56synchronize},\n  {0, 0, 0, 0}\n};\n\n#if PY_MAJOR_VERSION >= 3\n#if CYTHON_PEP489_MULTI_PHASE_INIT\nstatic PyObject* __pyx_pymod_create(PyObject *spec, PyModuleDef *def); /*proto*/\nstatic int __pyx_pymod_exec_pywrapfst(PyObject* module); /*proto*/\nstatic PyModuleDef_Slot __pyx_moduledef_slots[] = {\n  {Py_mod_create, (void*)__pyx_pymod_create},\n  {Py_mod_exec, (void*)__pyx_pymod_exec_pywrapfst},\n  {0, NULL}\n};\n#endif\n\nstatic struct PyModuleDef __pyx_moduledef = {\n    PyModuleDef_HEAD_INIT,\n    \"pywrapfst\",\n    __pyx_k_Python_interface_to_the_FST_scri, /* m_doc */\n  #if CYTHON_PEP489_MULTI_PHASE_INIT\n    0, /* m_size */\n  #else\n    -1, /* m_size */\n  #endif\n    __pyx_methods /* m_methods */,\n  #if CYTHON_PEP489_MULTI_PHASE_INIT\n    __pyx_moduledef_slots, /* m_slots */\n  #else\n    NULL, /* m_reload */\n  #endif\n    NULL, /* m_traverse */\n    NULL, /* m_clear */\n    NULL /* m_free */\n};\n#endif\n\nstatic __Pyx_StringTabEntry __pyx_string_tab[] = {\n  {&__pyx_n_s_ACCEPTOR, __pyx_k_ACCEPTOR, sizeof(__pyx_k_ACCEPTOR), 0, 0, 1, 1},\n  {&__pyx_n_s_ACCESSIBLE, __pyx_k_ACCESSIBLE, sizeof(__pyx_k_ACCESSIBLE), 0, 0, 1, 1},\n  {&__pyx_n_s_ACYCLIC, __pyx_k_ACYCLIC, sizeof(__pyx_k_ACYCLIC), 0, 0, 1, 1},\n  {&__pyx_n_s_ADD_ARC_PROPERTIES, __pyx_k_ADD_ARC_PROPERTIES, sizeof(__pyx_k_ADD_ARC_PROPERTIES), 0, 0, 1, 1},\n  {&__pyx_n_s_ADD_STATE_PROPERTIES, __pyx_k_ADD_STATE_PROPERTIES, sizeof(__pyx_k_ADD_STATE_PROPERTIES), 0, 0, 1, 1},\n  {&__pyx_n_s_ADD_SUPERFINAL_PROPERTIES, __pyx_k_ADD_SUPERFINAL_PROPERTIES, sizeof(__pyx_k_ADD_SUPERFINAL_PROPERTIES), 0, 0, 1, 1},\n  {&__pyx_n_s_ARC_FLAGS, __pyx_k_ARC_FLAGS, sizeof(__pyx_k_ARC_FLAGS), 0, 0, 1, 1},\n  {&__pyx_n_s_ARC_I_LABEL_VALUE, __pyx_k_ARC_I_LABEL_VALUE, sizeof(__pyx_k_ARC_I_LABEL_VALUE), 0, 0, 1, 1},\n  {&__pyx_n_s_ARC_NEXT_STATE_VALUE, __pyx_k_ARC_NEXT_STATE_VALUE, sizeof(__pyx_k_ARC_NEXT_STATE_VALUE), 0, 0, 1, 1},\n  {&__pyx_n_s_ARC_NO_CACHE, __pyx_k_ARC_NO_CACHE, sizeof(__pyx_k_ARC_NO_CACHE), 0, 0, 1, 1},\n  {&__pyx_n_s_ARC_O_LABEL_VALUE, __pyx_k_ARC_O_LABEL_VALUE, sizeof(__pyx_k_ARC_O_LABEL_VALUE), 0, 0, 1, 1},\n  {&__pyx_n_s_ARC_SORT_PROPERTIES, __pyx_k_ARC_SORT_PROPERTIES, sizeof(__pyx_k_ARC_SORT_PROPERTIES), 0, 0, 1, 1},\n  {&__pyx_n_s_ARC_VALUE_FLAGS, __pyx_k_ARC_VALUE_FLAGS, sizeof(__pyx_k_ARC_VALUE_FLAGS), 0, 0, 1, 1},\n  {&__pyx_n_s_ARC_WEIGHT_VALUE, __pyx_k_ARC_WEIGHT_VALUE, sizeof(__pyx_k_ARC_WEIGHT_VALUE), 0, 0, 1, 1},\n  {&__pyx_kp_s_ArcIterator_at_0x_x, __pyx_k_ArcIterator_at_0x_x, sizeof(__pyx_k_ArcIterator_at_0x_x), 0, 0, 1, 0},\n  {&__pyx_kp_s_Arc_at_0x_x, __pyx_k_Arc_at_0x_x, sizeof(__pyx_k_Arc_at_0x_x), 0, 0, 1, 0},\n  {&__pyx_n_s_BINARY_PROPERTIES, __pyx_k_BINARY_PROPERTIES, sizeof(__pyx_k_BINARY_PROPERTIES), 0, 0, 1, 1},\n  {&__pyx_n_s_COACCESSIBLE, __pyx_k_COACCESSIBLE, sizeof(__pyx_k_COACCESSIBLE), 0, 0, 1, 1},\n  {&__pyx_n_s_COPY_PROPERTIES, __pyx_k_COPY_PROPERTIES, sizeof(__pyx_k_COPY_PROPERTIES), 0, 0, 1, 1},\n  {&__pyx_n_s_CYCLIC, __pyx_k_CYCLIC, sizeof(__pyx_k_CYCLIC), 0, 0, 1, 1},\n  {&__pyx_n_s_CalledProcessError, __pyx_k_CalledProcessError, sizeof(__pyx_k_CalledProcessError), 0, 0, 1, 1},\n  {&__pyx_kp_s_Cannot_construct, __pyx_k_Cannot_construct, sizeof(__pyx_k_Cannot_construct), 0, 0, 1, 0},\n  {&__pyx_kp_s_Cannot_encode_as_string_r, __pyx_k_Cannot_encode_as_string_r, sizeof(__pyx_k_Cannot_encode_as_string_r), 0, 0, 1, 0},\n  {&__pyx_kp_s_Cannot_topsort_cyclic_FST, __pyx_k_Cannot_topsort_cyclic_FST, sizeof(__pyx_k_Cannot_topsort_cyclic_FST), 0, 0, 1, 0},\n  {&__pyx_kp_s_Compilation_failed, __pyx_k_Compilation_failed, sizeof(__pyx_k_Compilation_failed), 0, 0, 1, 0},\n  {&__pyx_kp_s_Conversion_to_r_failed, __pyx_k_Conversion_to_r_failed, sizeof(__pyx_k_Conversion_to_r_failed), 0, 0, 1, 0},\n  {&__pyx_n_s_DELETE_ARC_PROPERTIES, __pyx_k_DELETE_ARC_PROPERTIES, sizeof(__pyx_k_DELETE_ARC_PROPERTIES), 0, 0, 1, 1},\n  {&__pyx_n_s_DELETE_STATE_PROPERTIES, __pyx_k_DELETE_STATE_PROPERTIES, sizeof(__pyx_k_DELETE_STATE_PROPERTIES), 0, 0, 1, 1},\n  {&__pyx_n_s_DOT_TSVG, __pyx_k_DOT_TSVG, sizeof(__pyx_k_DOT_TSVG), 0, 0, 1, 1},\n  {&__pyx_n_s_ENCODE_FLAGS, __pyx_k_ENCODE_FLAGS, sizeof(__pyx_k_ENCODE_FLAGS), 0, 0, 1, 1},\n  {&__pyx_n_s_ENCODE_LABELS, __pyx_k_ENCODE_LABELS, sizeof(__pyx_k_ENCODE_LABELS), 0, 0, 1, 1},\n  {&__pyx_n_s_ENCODE_WEIGHTS, __pyx_k_ENCODE_WEIGHTS, sizeof(__pyx_k_ENCODE_WEIGHTS), 0, 0, 1, 1},\n  {&__pyx_n_s_EPSILONS, __pyx_k_EPSILONS, sizeof(__pyx_k_EPSILONS), 0, 0, 1, 1},\n  {&__pyx_n_s_ERROR, __pyx_k_ERROR, sizeof(__pyx_k_ERROR), 0, 0, 1, 1},\n  {&__pyx_n_s_EXPANDED, __pyx_k_EXPANDED, sizeof(__pyx_k_EXPANDED), 0, 0, 1, 1},\n  {&__pyx_n_s_EXTRINSIC_PROPERTIES, __pyx_k_EXTRINSIC_PROPERTIES, sizeof(__pyx_k_EXTRINSIC_PROPERTIES), 0, 0, 1, 1},\n  {&__pyx_kp_s_EncodeMapper_at_0x_x, __pyx_k_EncodeMapper_at_0x_x, sizeof(__pyx_k_EncodeMapper_at_0x_x), 0, 0, 1, 0},\n  {&__pyx_n_s_FST_PROPERTIES, __pyx_k_FST_PROPERTIES, sizeof(__pyx_k_FST_PROPERTIES), 0, 0, 1, 1},\n  {&__pyx_kp_s_FarReader_at_0x_x, __pyx_k_FarReader_at_0x_x, sizeof(__pyx_k_FarReader_at_0x_x), 0, 0, 1, 0},\n  {&__pyx_kp_s_FarWriter_at_0x_x, __pyx_k_FarWriter_at_0x_x, sizeof(__pyx_k_FarWriter_at_0x_x), 0, 0, 1, 0},\n  {&__pyx_n_s_Fst, __pyx_k_Fst, sizeof(__pyx_k_Fst), 0, 0, 1, 1},\n  {&__pyx_n_s_FstArgError, __pyx_k_FstArgError, sizeof(__pyx_k_FstArgError), 0, 0, 1, 1},\n  {&__pyx_n_s_FstBadWeightError, __pyx_k_FstBadWeightError, sizeof(__pyx_k_FstBadWeightError), 0, 0, 1, 1},\n  {&__pyx_n_s_FstDeletedConstructorError, __pyx_k_FstDeletedConstructorError, sizeof(__pyx_k_FstDeletedConstructorError), 0, 0, 1, 1},\n  {&__pyx_n_s_FstError, __pyx_k_FstError, sizeof(__pyx_k_FstError), 0, 0, 1, 1},\n  {&__pyx_n_s_FstIOError, __pyx_k_FstIOError, sizeof(__pyx_k_FstIOError), 0, 0, 1, 1},\n  {&__pyx_n_s_FstIndexError, __pyx_k_FstIndexError, sizeof(__pyx_k_FstIndexError), 0, 0, 1, 1},\n  {&__pyx_n_s_FstOpError, __pyx_k_FstOpError, sizeof(__pyx_k_FstOpError), 0, 0, 1, 1},\n  {&__pyx_kp_s_Fst_SymbolTable_r_at_0x_x, __pyx_k_Fst_SymbolTable_r_at_0x_x, sizeof(__pyx_k_Fst_SymbolTable_r_at_0x_x), 0, 0, 1, 0},\n  {&__pyx_n_s_Fst___new, __pyx_k_Fst___new, sizeof(__pyx_k_Fst___new), 0, 0, 1, 1},\n  {&__pyx_kp_s_Fst_arc_type_standard_Construct, __pyx_k_Fst_arc_type_standard_Construct, sizeof(__pyx_k_Fst_arc_type_standard_Construct), 0, 0, 1, 0},\n  {&__pyx_kp_s_Fst_at_0x_x, __pyx_k_Fst_at_0x_x, sizeof(__pyx_k_Fst_at_0x_x), 0, 0, 1, 0},\n  {&__pyx_n_s_Fst_read, __pyx_k_Fst_read, sizeof(__pyx_k_Fst_read), 0, 0, 1, 1},\n  {&__pyx_n_s_Fst_read_from_string, __pyx_k_Fst_read_from_string, sizeof(__pyx_k_Fst_read_from_string), 0, 0, 1, 1},\n  {&__pyx_n_s_INITIAL_ACYCLIC, __pyx_k_INITIAL_ACYCLIC, sizeof(__pyx_k_INITIAL_ACYCLIC), 0, 0, 1, 1},\n  {&__pyx_n_s_INITIAL_CYCLIC, __pyx_k_INITIAL_CYCLIC, sizeof(__pyx_k_INITIAL_CYCLIC), 0, 0, 1, 1},\n  {&__pyx_n_s_INTRINSIC_PROPERTIES, __pyx_k_INTRINSIC_PROPERTIES, sizeof(__pyx_k_INTRINSIC_PROPERTIES), 0, 0, 1, 1},\n  {&__pyx_n_s_IOError, __pyx_k_IOError, sizeof(__pyx_k_IOError), 0, 0, 1, 1},\n  {&__pyx_n_s_I_DETERMINISTIC, __pyx_k_I_DETERMINISTIC, sizeof(__pyx_k_I_DETERMINISTIC), 0, 0, 1, 1},\n  {&__pyx_n_s_I_EPSILONS, __pyx_k_I_EPSILONS, sizeof(__pyx_k_I_EPSILONS), 0, 0, 1, 1},\n  {&__pyx_n_s_I_LABEL_INVARIANT_PROPERTIES, __pyx_k_I_LABEL_INVARIANT_PROPERTIES, sizeof(__pyx_k_I_LABEL_INVARIANT_PROPERTIES), 0, 0, 1, 1},\n  {&__pyx_n_s_I_LABEL_SORTED, __pyx_k_I_LABEL_SORTED, sizeof(__pyx_k_I_LABEL_SORTED), 0, 0, 1, 1},\n  {&__pyx_kp_s_Incompatible_or_invalid_arc_type, __pyx_k_Incompatible_or_invalid_arc_type, sizeof(__pyx_k_Incompatible_or_invalid_arc_type), 0, 0, 1, 0},\n  {&__pyx_kp_s_Incompatible_or_invalid_weight, __pyx_k_Incompatible_or_invalid_weight, sizeof(__pyx_k_Incompatible_or_invalid_weight), 0, 0, 1, 0},\n  {&__pyx_kp_s_Incompatible_or_invalid_weight_t, __pyx_k_Incompatible_or_invalid_weight_t, sizeof(__pyx_k_Incompatible_or_invalid_weight_t), 0, 0, 1, 0},\n  {&__pyx_n_s_IndexError, __pyx_k_IndexError, sizeof(__pyx_k_IndexError), 0, 0, 1, 1},\n  {&__pyx_kp_s_Invalid_weight, __pyx_k_Invalid_weight, sizeof(__pyx_k_Invalid_weight), 0, 0, 1, 0},\n  {&__pyx_n_s_KeyError, __pyx_k_KeyError, sizeof(__pyx_k_KeyError), 0, 0, 1, 1},\n  {&__pyx_kp_s_Key_out_of_order, __pyx_k_Key_out_of_order, sizeof(__pyx_k_Key_out_of_order), 0, 0, 1, 0},\n  {&__pyx_n_s_MUTABLE, __pyx_k_MUTABLE, sizeof(__pyx_k_MUTABLE), 0, 0, 1, 1},\n  {&__pyx_kp_s_MutableArcIterator_at_0x_x, __pyx_k_MutableArcIterator_at_0x_x, sizeof(__pyx_k_MutableArcIterator_at_0x_x), 0, 0, 1, 0},\n  {&__pyx_n_s_NEG_TRINARY_PROPERTIES, __pyx_k_NEG_TRINARY_PROPERTIES, sizeof(__pyx_k_NEG_TRINARY_PROPERTIES), 0, 0, 1, 1},\n  {&__pyx_n_s_NON_I_DETERMINISTIC, __pyx_k_NON_I_DETERMINISTIC, sizeof(__pyx_k_NON_I_DETERMINISTIC), 0, 0, 1, 1},\n  {&__pyx_n_s_NON_O_DETERMINISTIC, __pyx_k_NON_O_DETERMINISTIC, sizeof(__pyx_k_NON_O_DETERMINISTIC), 0, 0, 1, 1},\n  {&__pyx_n_s_NOT_ACCEPTOR, __pyx_k_NOT_ACCEPTOR, sizeof(__pyx_k_NOT_ACCEPTOR), 0, 0, 1, 1},\n  {&__pyx_n_s_NOT_ACCESSIBLE, __pyx_k_NOT_ACCESSIBLE, sizeof(__pyx_k_NOT_ACCESSIBLE), 0, 0, 1, 1},\n  {&__pyx_n_s_NOT_COACCESSIBLE, __pyx_k_NOT_COACCESSIBLE, sizeof(__pyx_k_NOT_COACCESSIBLE), 0, 0, 1, 1},\n  {&__pyx_n_s_NOT_I_LABEL_SORTED, __pyx_k_NOT_I_LABEL_SORTED, sizeof(__pyx_k_NOT_I_LABEL_SORTED), 0, 0, 1, 1},\n  {&__pyx_n_s_NOT_O_LABEL_SORTED, __pyx_k_NOT_O_LABEL_SORTED, sizeof(__pyx_k_NOT_O_LABEL_SORTED), 0, 0, 1, 1},\n  {&__pyx_n_s_NOT_STRING, __pyx_k_NOT_STRING, sizeof(__pyx_k_NOT_STRING), 0, 0, 1, 1},\n  {&__pyx_n_s_NOT_TOP_SORTED, __pyx_k_NOT_TOP_SORTED, sizeof(__pyx_k_NOT_TOP_SORTED), 0, 0, 1, 1},\n  {&__pyx_n_s_NO_EPSILONS, __pyx_k_NO_EPSILONS, sizeof(__pyx_k_NO_EPSILONS), 0, 0, 1, 1},\n  {&__pyx_n_s_NO_I_EPSILONS, __pyx_k_NO_I_EPSILONS, sizeof(__pyx_k_NO_I_EPSILONS), 0, 0, 1, 1},\n  {&__pyx_n_s_NO_LABEL, __pyx_k_NO_LABEL, sizeof(__pyx_k_NO_LABEL), 0, 0, 1, 1},\n  {&__pyx_n_s_NO_O_EPSILONS, __pyx_k_NO_O_EPSILONS, sizeof(__pyx_k_NO_O_EPSILONS), 0, 0, 1, 1},\n  {&__pyx_n_s_NO_STATE_ID, __pyx_k_NO_STATE_ID, sizeof(__pyx_k_NO_STATE_ID), 0, 0, 1, 1},\n  {&__pyx_n_s_NO_SYMBOL, __pyx_k_NO_SYMBOL, sizeof(__pyx_k_NO_SYMBOL), 0, 0, 1, 1},\n  {&__pyx_n_s_NULL_PROPERTIES, __pyx_k_NULL_PROPERTIES, sizeof(__pyx_k_NULL_PROPERTIES), 0, 0, 1, 1},\n  {&__pyx_n_s_NoWeight, __pyx_k_NoWeight, sizeof(__pyx_k_NoWeight), 0, 0, 1, 1},\n  {&__pyx_kp_s_No_new_SymbolTables_specified, __pyx_k_No_new_SymbolTables_specified, sizeof(__pyx_k_No_new_SymbolTables_specified), 0, 0, 1, 0},\n  {&__pyx_kp_s_No_relabeling_pairs_specified, __pyx_k_No_relabeling_pairs_specified, sizeof(__pyx_k_No_relabeling_pairs_specified), 0, 0, 1, 0},\n  {&__pyx_n_s_Number, __pyx_k_Number, sizeof(__pyx_k_Number), 0, 0, 1, 1},\n  {&__pyx_n_s_O_DETERMINISTIC, __pyx_k_O_DETERMINISTIC, sizeof(__pyx_k_O_DETERMINISTIC), 0, 0, 1, 1},\n  {&__pyx_n_s_O_EPSILONS, __pyx_k_O_EPSILONS, sizeof(__pyx_k_O_EPSILONS), 0, 0, 1, 1},\n  {&__pyx_n_s_O_LABEL_INVARIANT_PROPERTIES, __pyx_k_O_LABEL_INVARIANT_PROPERTIES, sizeof(__pyx_k_O_LABEL_INVARIANT_PROPERTIES), 0, 0, 1, 1},\n  {&__pyx_n_s_O_LABEL_SORTED, __pyx_k_O_LABEL_SORTED, sizeof(__pyx_k_O_LABEL_SORTED), 0, 0, 1, 1},\n  {&__pyx_n_s_One, __pyx_k_One, sizeof(__pyx_k_One), 0, 0, 1, 1},\n  {&__pyx_kp_s_Open_failed_r, __pyx_k_Open_failed_r, sizeof(__pyx_k_Open_failed_r), 0, 0, 1, 0},\n  {&__pyx_kp_s_Operation_failed, __pyx_k_Operation_failed, sizeof(__pyx_k_Operation_failed), 0, 0, 1, 0},\n  {&__pyx_n_s_PIPE, __pyx_k_PIPE, sizeof(__pyx_k_PIPE), 0, 0, 1, 1},\n  {&__pyx_n_s_POS_TRINARY_PROPERTIES, __pyx_k_POS_TRINARY_PROPERTIES, sizeof(__pyx_k_POS_TRINARY_PROPERTIES), 0, 0, 1, 1},\n  {&__pyx_n_s_Popen, __pyx_k_Popen, sizeof(__pyx_k_Popen), 0, 0, 1, 1},\n  {&__pyx_n_s_RM_SUPERFINAL_PROPERTIES, __pyx_k_RM_SUPERFINAL_PROPERTIES, sizeof(__pyx_k_RM_SUPERFINAL_PROPERTIES), 0, 0, 1, 1},\n  {&__pyx_kp_s_Read_failed_r, __pyx_k_Read_failed_r, sizeof(__pyx_k_Read_failed_r), 0, 0, 1, 0},\n  {&__pyx_kp_s_Read_failed_string, __pyx_k_Read_failed_string, sizeof(__pyx_k_Read_failed_string), 0, 0, 1, 0},\n  {&__pyx_n_s_RuntimeError, __pyx_k_RuntimeError, sizeof(__pyx_k_RuntimeError), 0, 0, 1, 1},\n  {&__pyx_n_s_SET_ARC_PROPERTIES, __pyx_k_SET_ARC_PROPERTIES, sizeof(__pyx_k_SET_ARC_PROPERTIES), 0, 0, 1, 1},\n  {&__pyx_n_s_SET_FINAL_PROPERTIES, __pyx_k_SET_FINAL_PROPERTIES, sizeof(__pyx_k_SET_FINAL_PROPERTIES), 0, 0, 1, 1},\n  {&__pyx_n_s_SET_START_PROPERTIES, __pyx_k_SET_START_PROPERTIES, sizeof(__pyx_k_SET_START_PROPERTIES), 0, 0, 1, 1},\n  {&__pyx_n_s_STATE_SORT_PROPERTIES, __pyx_k_STATE_SORT_PROPERTIES, sizeof(__pyx_k_STATE_SORT_PROPERTIES), 0, 0, 1, 1},\n  {&__pyx_n_s_STRING, __pyx_k_STRING, sizeof(__pyx_k_STRING), 0, 0, 1, 1},\n  {&__pyx_kp_s_StateIterator_at_0x_x, __pyx_k_StateIterator_at_0x_x, sizeof(__pyx_k_StateIterator_at_0x_x), 0, 0, 1, 0},\n  {&__pyx_kp_s_State_index_out_of_range, __pyx_k_State_index_out_of_range, sizeof(__pyx_k_State_index_out_of_range), 0, 0, 1, 0},\n  {&__pyx_n_s_StopIteration, __pyx_k_StopIteration, sizeof(__pyx_k_StopIteration), 0, 0, 1, 1},\n  {&__pyx_kp_s_SymbolTableIterator_at_0x_x, __pyx_k_SymbolTableIterator_at_0x_x, sizeof(__pyx_k_SymbolTableIterator_at_0x_x), 0, 0, 1, 0},\n  {&__pyx_kp_s_SymbolTable_r_at_0x_x, __pyx_k_SymbolTable_r_at_0x_x, sizeof(__pyx_k_SymbolTable_r_at_0x_x), 0, 0, 1, 0},\n  {&__pyx_n_s_TOP_SORTED, __pyx_k_TOP_SORTED, sizeof(__pyx_k_TOP_SORTED), 0, 0, 1, 1},\n  {&__pyx_n_s_TRINARY_PROPERTIES, __pyx_k_TRINARY_PROPERTIES, sizeof(__pyx_k_TRINARY_PROPERTIES), 0, 0, 1, 1},\n  {&__pyx_kp_s_Tsvg, __pyx_k_Tsvg, sizeof(__pyx_k_Tsvg), 0, 0, 1, 0},\n  {&__pyx_n_s_TypeError, __pyx_k_TypeError, sizeof(__pyx_k_TypeError), 0, 0, 1, 1},\n  {&__pyx_n_s_UNWEIGHTED, __pyx_k_UNWEIGHTED, sizeof(__pyx_k_UNWEIGHTED), 0, 0, 1, 1},\n  {&__pyx_n_s_UNWEIGHTED_CYCLES, __pyx_k_UNWEIGHTED_CYCLES, sizeof(__pyx_k_UNWEIGHTED_CYCLES), 0, 0, 1, 1},\n  {&__pyx_kp_s_Unknown_arc_type_r, __pyx_k_Unknown_arc_type_r, sizeof(__pyx_k_Unknown_arc_type_r), 0, 0, 1, 0},\n  {&__pyx_kp_s_Unknown_compose_filter_type_r, __pyx_k_Unknown_compose_filter_type_r, sizeof(__pyx_k_Unknown_compose_filter_type_r), 0, 0, 1, 0},\n  {&__pyx_kp_s_Unknown_determinization_type_r, __pyx_k_Unknown_determinization_type_r, sizeof(__pyx_k_Unknown_determinization_type_r), 0, 0, 1, 0},\n  {&__pyx_kp_s_Unknown_map_type_r, __pyx_k_Unknown_map_type_r, sizeof(__pyx_k_Unknown_map_type_r), 0, 0, 1, 0},\n  {&__pyx_kp_s_Unknown_queue_type_r, __pyx_k_Unknown_queue_type_r, sizeof(__pyx_k_Unknown_queue_type_r), 0, 0, 1, 0},\n  {&__pyx_kp_s_Unknown_random_arc_selection_typ, __pyx_k_Unknown_random_arc_selection_typ, sizeof(__pyx_k_Unknown_random_arc_selection_typ), 0, 0, 1, 0},\n  {&__pyx_kp_s_Unknown_replace_label_type_r, __pyx_k_Unknown_replace_label_type_r, sizeof(__pyx_k_Unknown_replace_label_type_r), 0, 0, 1, 0},\n  {&__pyx_kp_s_Unknown_sort_type_r, __pyx_k_Unknown_sort_type_r, sizeof(__pyx_k_Unknown_sort_type_r), 0, 0, 1, 0},\n  {&__pyx_n_s_ValueError, __pyx_k_ValueError, sizeof(__pyx_k_ValueError), 0, 0, 1, 1},\n  {&__pyx_n_s_WEIGHTED, __pyx_k_WEIGHTED, sizeof(__pyx_k_WEIGHTED), 0, 0, 1, 1},\n  {&__pyx_n_s_WEIGHTED_CYCLES, __pyx_k_WEIGHTED_CYCLES, sizeof(__pyx_k_WEIGHTED_CYCLES), 0, 0, 1, 1},\n  {&__pyx_n_s_WEIGHT_INVARIANT_PROPERTIES, __pyx_k_WEIGHT_INVARIANT_PROPERTIES, sizeof(__pyx_k_WEIGHT_INVARIANT_PROPERTIES), 0, 0, 1, 1},\n  {&__pyx_kp_s_Weight_at_0x_x, __pyx_k_Weight_at_0x_x, sizeof(__pyx_k_Weight_at_0x_x), 0, 0, 1, 0},\n  {&__pyx_kp_s_Weight_type_not_found, __pyx_k_Weight_type_not_found, sizeof(__pyx_k_Weight_type_not_found), 0, 0, 1, 0},\n  {&__pyx_kp_s_Write_failed_r, __pyx_k_Write_failed_r, sizeof(__pyx_k_Write_failed_r), 0, 0, 1, 0},\n  {&__pyx_kp_s_Write_to_string_failed, __pyx_k_Write_to_string_failed, sizeof(__pyx_k_Write_to_string_failed), 0, 0, 1, 0},\n  {&__pyx_n_s_Zero, __pyx_k_Zero, sizeof(__pyx_k_Zero), 0, 0, 1, 1},\n  {&__pyx_kp_b__24, __pyx_k__24, sizeof(__pyx_k__24), 0, 0, 0, 0},\n  {&__pyx_n_s_acceptor, __pyx_k_acceptor, sizeof(__pyx_k_acceptor), 0, 0, 1, 1},\n  {&__pyx_n_s_add, __pyx_k_add, sizeof(__pyx_k_add), 0, 0, 1, 1},\n  {&__pyx_n_s_add_state, __pyx_k_add_state, sizeof(__pyx_k_add_state), 0, 0, 1, 1},\n  {&__pyx_n_s_add_symbol, __pyx_k_add_symbol, sizeof(__pyx_k_add_symbol), 0, 0, 1, 1},\n  {&__pyx_n_s_add_table, __pyx_k_add_table, sizeof(__pyx_k_add_table), 0, 0, 1, 1},\n  {&__pyx_n_s_allow_negative_labels, __pyx_k_allow_negative_labels, sizeof(__pyx_k_allow_negative_labels), 0, 0, 1, 1},\n  {&__pyx_n_s_allow_nondet, __pyx_k_allow_nondet, sizeof(__pyx_k_allow_nondet), 0, 0, 1, 1},\n  {&__pyx_n_s_arc, __pyx_k_arc, sizeof(__pyx_k_arc), 0, 0, 1, 1},\n  {&__pyx_n_s_arc_type, __pyx_k_arc_type, sizeof(__pyx_k_arc_type), 0, 0, 1, 1},\n  {&__pyx_n_s_arcs, __pyx_k_arcs, sizeof(__pyx_k_arcs), 0, 0, 1, 1},\n  {&__pyx_n_s_atexit, __pyx_k_atexit, sizeof(__pyx_k_atexit), 0, 0, 1, 1},\n  {&__pyx_n_s_attach_new_isymbols, __pyx_k_attach_new_isymbols, sizeof(__pyx_k_attach_new_isymbols), 0, 0, 1, 1},\n  {&__pyx_n_s_attach_new_osymbols, __pyx_k_attach_new_osymbols, sizeof(__pyx_k_attach_new_osymbols), 0, 0, 1, 1},\n  {&__pyx_n_b_auto, __pyx_k_auto, sizeof(__pyx_k_auto), 0, 0, 0, 1},\n  {&__pyx_n_s_available_key, __pyx_k_available_key, sizeof(__pyx_k_available_key), 0, 0, 1, 1},\n  {&__pyx_n_s_call_arc_labeling, __pyx_k_call_arc_labeling, sizeof(__pyx_k_call_arc_labeling), 0, 0, 1, 1},\n  {&__pyx_n_s_checksum, __pyx_k_checksum, sizeof(__pyx_k_checksum), 0, 0, 1, 1},\n  {&__pyx_n_s_class, __pyx_k_class, sizeof(__pyx_k_class), 0, 0, 1, 1},\n  {&__pyx_n_s_cline_in_traceback, __pyx_k_cline_in_traceback, sizeof(__pyx_k_cline_in_traceback), 0, 0, 1, 1},\n  {&__pyx_n_s_closure_plus, __pyx_k_closure_plus, sizeof(__pyx_k_closure_plus), 0, 0, 1, 1},\n  {&__pyx_n_s_cls, __pyx_k_cls, sizeof(__pyx_k_cls), 0, 0, 1, 1},\n  {&__pyx_n_s_communicate, __pyx_k_communicate, sizeof(__pyx_k_communicate), 0, 0, 1, 1},\n  {&__pyx_n_s_compile, __pyx_k_compile, sizeof(__pyx_k_compile), 0, 0, 1, 1},\n  {&__pyx_n_s_compose_filter, __pyx_k_compose_filter, sizeof(__pyx_k_compose_filter), 0, 0, 1, 1},\n  {&__pyx_n_s_connect, __pyx_k_connect, sizeof(__pyx_k_connect), 0, 0, 1, 1},\n  {&__pyx_kp_s_const_EncodeMapper_SymbolTable, __pyx_k_const_EncodeMapper_SymbolTable, sizeof(__pyx_k_const_EncodeMapper_SymbolTable), 0, 0, 1, 0},\n  {&__pyx_kp_s_const_Fst_SymbolTable_r_at_0x_x, __pyx_k_const_Fst_SymbolTable_r_at_0x_x, sizeof(__pyx_k_const_Fst_SymbolTable_r_at_0x_x), 0, 0, 1, 0},\n  {&__pyx_n_s_copy, __pyx_k_copy, sizeof(__pyx_k_copy), 0, 0, 1, 1},\n  {&__pyx_n_s_create, __pyx_k_create, sizeof(__pyx_k_create), 0, 0, 1, 1},\n  {&__pyx_n_s_decode, __pyx_k_decode, sizeof(__pyx_k_decode), 0, 0, 1, 1},\n  {&__pyx_n_b_default, __pyx_k_default, sizeof(__pyx_k_default), 0, 0, 0, 1},\n  {&__pyx_n_s_delta, __pyx_k_delta, sizeof(__pyx_k_delta), 0, 0, 1, 1},\n  {&__pyx_n_s_det_type, __pyx_k_det_type, sizeof(__pyx_k_det_type), 0, 0, 1, 1},\n  {&__pyx_n_s_distance, __pyx_k_distance, sizeof(__pyx_k_distance), 0, 0, 1, 1},\n  {&__pyx_n_s_divide, __pyx_k_divide, sizeof(__pyx_k_divide), 0, 0, 1, 1},\n  {&__pyx_n_s_doc, __pyx_k_doc, sizeof(__pyx_k_doc), 0, 0, 1, 1},\n  {&__pyx_n_s_done, __pyx_k_done, sizeof(__pyx_k_done), 0, 0, 1, 1},\n  {&__pyx_n_s_dot, __pyx_k_dot, sizeof(__pyx_k_dot), 0, 0, 1, 1},\n  {&__pyx_n_s_draw, __pyx_k_draw, sizeof(__pyx_k_draw), 0, 0, 1, 1},\n  {&__pyx_n_s_encode, __pyx_k_encode, sizeof(__pyx_k_encode), 0, 0, 1, 1},\n  {&__pyx_n_s_encode_labels, __pyx_k_encode_labels, sizeof(__pyx_k_encode_labels), 0, 0, 1, 1},\n  {&__pyx_n_s_encode_weights, __pyx_k_encode_weights, sizeof(__pyx_k_encode_weights), 0, 0, 1, 1},\n  {&__pyx_n_s_eps_norm_output, __pyx_k_eps_norm_output, sizeof(__pyx_k_eps_norm_output), 0, 0, 1, 1},\n  {&__pyx_n_s_epsilon_on_replace, __pyx_k_epsilon_on_replace, sizeof(__pyx_k_epsilon_on_replace), 0, 0, 1, 1},\n  {&__pyx_n_s_error, __pyx_k_error, sizeof(__pyx_k_error), 0, 0, 1, 1},\n  {&__pyx_n_s_far_type, __pyx_k_far_type, sizeof(__pyx_k_far_type), 0, 0, 1, 1},\n  {&__pyx_n_s_filename, __pyx_k_filename, sizeof(__pyx_k_filename), 0, 0, 1, 1},\n  {&__pyx_n_s_final, __pyx_k_final, sizeof(__pyx_k_final), 0, 0, 1, 1},\n  {&__pyx_n_s_find, __pyx_k_find, sizeof(__pyx_k_find), 0, 0, 1, 1},\n  {&__pyx_n_s_flags, __pyx_k_flags, sizeof(__pyx_k_flags), 0, 0, 1, 1},\n  {&__pyx_n_s_float_format, __pyx_k_float_format, sizeof(__pyx_k_float_format), 0, 0, 1, 1},\n  {&__pyx_n_s_fontsize, __pyx_k_fontsize, sizeof(__pyx_k_fontsize), 0, 0, 1, 1},\n  {&__pyx_n_s_format, __pyx_k_format, sizeof(__pyx_k_format), 0, 0, 1, 1},\n  {&__pyx_n_s_fst_error_fatal_old, __pyx_k_fst_error_fatal_old, sizeof(__pyx_k_fst_error_fatal_old), 0, 0, 1, 1},\n  {&__pyx_n_s_fst_type, __pyx_k_fst_type, sizeof(__pyx_k_fst_type), 0, 0, 1, 1},\n  {&__pyx_n_b_functional, __pyx_k_functional, sizeof(__pyx_k_functional), 0, 0, 0, 1},\n  {&__pyx_n_b_g, __pyx_k_g, sizeof(__pyx_k_g), 0, 0, 0, 1},\n  {&__pyx_n_s_get_fst, __pyx_k_get_fst, sizeof(__pyx_k_get_fst), 0, 0, 1, 1},\n  {&__pyx_n_s_get_key, __pyx_k_get_key, sizeof(__pyx_k_get_key), 0, 0, 1, 1},\n  {&__pyx_n_s_get_nth_key, __pyx_k_get_nth_key, sizeof(__pyx_k_get_nth_key), 0, 0, 1, 1},\n  {&__pyx_n_s_getstate, __pyx_k_getstate, sizeof(__pyx_k_getstate), 0, 0, 1, 1},\n  {&__pyx_n_s_height, __pyx_k_height, sizeof(__pyx_k_height), 0, 0, 1, 1},\n  {&__pyx_n_s_id, __pyx_k_id, sizeof(__pyx_k_id), 0, 0, 1, 1},\n  {&__pyx_n_b_identity, __pyx_k_identity, sizeof(__pyx_k_identity), 0, 0, 0, 1},\n  {&__pyx_n_s_ifst, __pyx_k_ifst, sizeof(__pyx_k_ifst), 0, 0, 1, 1},\n  {&__pyx_n_s_ifst1, __pyx_k_ifst1, sizeof(__pyx_k_ifst1), 0, 0, 1, 1},\n  {&__pyx_n_s_ifst2, __pyx_k_ifst2, sizeof(__pyx_k_ifst2), 0, 0, 1, 1},\n  {&__pyx_n_b_ilabel, __pyx_k_ilabel, sizeof(__pyx_k_ilabel), 0, 0, 0, 1},\n  {&__pyx_n_s_ilabel, __pyx_k_ilabel, sizeof(__pyx_k_ilabel), 0, 0, 1, 1},\n  {&__pyx_n_s_import, __pyx_k_import, sizeof(__pyx_k_import), 0, 0, 1, 1},\n  {&__pyx_n_s_increment_subsequential_label, __pyx_k_increment_subsequential_label, sizeof(__pyx_k_increment_subsequential_label), 0, 0, 1, 1},\n  {&__pyx_n_b_input, __pyx_k_input, sizeof(__pyx_k_input), 0, 0, 0, 1},\n  {&__pyx_n_s_input_symbols, __pyx_k_input_symbols, sizeof(__pyx_k_input_symbols), 0, 0, 1, 1},\n  {&__pyx_n_s_input_table, __pyx_k_input_table, sizeof(__pyx_k_input_table), 0, 0, 1, 1},\n  {&__pyx_n_s_ipairs, __pyx_k_ipairs, sizeof(__pyx_k_ipairs), 0, 0, 1, 1},\n  {&__pyx_n_s_isymbols, __pyx_k_isymbols, sizeof(__pyx_k_isymbols), 0, 0, 1, 1},\n  {&__pyx_n_s_kNoSymbol, __pyx_k_kNoSymbol, sizeof(__pyx_k_kNoSymbol), 0, 0, 1, 1},\n  {&__pyx_n_s_keep_isymbols, __pyx_k_keep_isymbols, sizeof(__pyx_k_keep_isymbols), 0, 0, 1, 1},\n  {&__pyx_n_s_keep_osymbols, __pyx_k_keep_osymbols, sizeof(__pyx_k_keep_osymbols), 0, 0, 1, 1},\n  {&__pyx_n_s_keep_state_numbering, __pyx_k_keep_state_numbering, sizeof(__pyx_k_keep_state_numbering), 0, 0, 1, 1},\n  {&__pyx_n_s_key, __pyx_k_key, sizeof(__pyx_k_key), 0, 0, 1, 1},\n  {&__pyx_n_s_labeled_checksum, __pyx_k_labeled_checksum, sizeof(__pyx_k_labeled_checksum), 0, 0, 1, 1},\n  {&__pyx_n_s_lhs, __pyx_k_lhs, sizeof(__pyx_k_lhs), 0, 0, 1, 1},\n  {&__pyx_n_s_logging, __pyx_k_logging, sizeof(__pyx_k_logging), 0, 0, 1, 1},\n  {&__pyx_n_s_main, __pyx_k_main, sizeof(__pyx_k_main), 0, 0, 1, 1},\n  {&__pyx_n_s_map_type, __pyx_k_map_type, sizeof(__pyx_k_map_type), 0, 0, 1, 1},\n  {&__pyx_n_s_mask, __pyx_k_mask, sizeof(__pyx_k_mask), 0, 0, 1, 1},\n  {&__pyx_n_s_max_length, __pyx_k_max_length, sizeof(__pyx_k_max_length), 0, 0, 1, 1},\n  {&__pyx_n_s_member, __pyx_k_member, sizeof(__pyx_k_member), 0, 0, 1, 1},\n  {&__pyx_n_s_metaclass, __pyx_k_metaclass, sizeof(__pyx_k_metaclass), 0, 0, 1, 1},\n  {&__pyx_n_s_missing_sym, __pyx_k_missing_sym, sizeof(__pyx_k_missing_sym), 0, 0, 1, 1},\n  {&__pyx_n_s_module, __pyx_k_module, sizeof(__pyx_k_module), 0, 0, 1, 1},\n  {&__pyx_n_s_mutable_arcs, __pyx_k_mutable_arcs, sizeof(__pyx_k_mutable_arcs), 0, 0, 1, 1},\n  {&__pyx_n_s_n, __pyx_k_n, sizeof(__pyx_k_n), 0, 0, 1, 1},\n  {&__pyx_n_s_name, __pyx_k_name, sizeof(__pyx_k_name), 0, 0, 1, 1},\n  {&__pyx_n_s_name_2, __pyx_k_name_2, sizeof(__pyx_k_name_2), 0, 0, 1, 1},\n  {&__pyx_n_b_neither, __pyx_k_neither, sizeof(__pyx_k_neither), 0, 0, 0, 1},\n  {&__pyx_n_s_new, __pyx_k_new, sizeof(__pyx_k_new), 0, 0, 1, 1},\n  {&__pyx_n_s_new_isymbols, __pyx_k_new_isymbols, sizeof(__pyx_k_new_isymbols), 0, 0, 1, 1},\n  {&__pyx_n_s_new_osymbols, __pyx_k_new_osymbols, sizeof(__pyx_k_new_osymbols), 0, 0, 1, 1},\n  {&__pyx_n_s_next, __pyx_k_next, sizeof(__pyx_k_next), 0, 0, 1, 1},\n  {&__pyx_n_s_nextstate, __pyx_k_nextstate, sizeof(__pyx_k_nextstate), 0, 0, 1, 1},\n  {&__pyx_kp_s_no_default___reduce___due_to_non, __pyx_k_no_default___reduce___due_to_non, sizeof(__pyx_k_no_default___reduce___due_to_non), 0, 0, 1, 0},\n  {&__pyx_n_s_nodesep, __pyx_k_nodesep, sizeof(__pyx_k_nodesep), 0, 0, 1, 1},\n  {&__pyx_n_s_npath, __pyx_k_npath, sizeof(__pyx_k_npath), 0, 0, 1, 1},\n  {&__pyx_n_s_nshortest, __pyx_k_nshortest, sizeof(__pyx_k_nshortest), 0, 0, 1, 1},\n  {&__pyx_n_s_nstate, __pyx_k_nstate, sizeof(__pyx_k_nstate), 0, 0, 1, 1},\n  {&__pyx_n_s_num_arcs, __pyx_k_num_arcs, sizeof(__pyx_k_num_arcs), 0, 0, 1, 1},\n  {&__pyx_n_s_num_input_epsilons, __pyx_k_num_input_epsilons, sizeof(__pyx_k_num_input_epsilons), 0, 0, 1, 1},\n  {&__pyx_n_s_num_output_epsilons, __pyx_k_num_output_epsilons, sizeof(__pyx_k_num_output_epsilons), 0, 0, 1, 1},\n  {&__pyx_n_s_num_states, __pyx_k_num_states, sizeof(__pyx_k_num_states), 0, 0, 1, 1},\n  {&__pyx_n_s_num_symbols, __pyx_k_num_symbols, sizeof(__pyx_k_num_symbols), 0, 0, 1, 1},\n  {&__pyx_n_s_numbers, __pyx_k_numbers, sizeof(__pyx_k_numbers), 0, 0, 1, 1},\n  {&__pyx_n_s_object, __pyx_k_object, sizeof(__pyx_k_object), 0, 0, 1, 1},\n  {&__pyx_n_s_olabel, __pyx_k_olabel, sizeof(__pyx_k_olabel), 0, 0, 1, 1},\n  {&__pyx_n_s_old_isymbols, __pyx_k_old_isymbols, sizeof(__pyx_k_old_isymbols), 0, 0, 1, 1},\n  {&__pyx_n_s_old_osymbols, __pyx_k_old_osymbols, sizeof(__pyx_k_old_osymbols), 0, 0, 1, 1},\n  {&__pyx_n_s_opairs, __pyx_k_opairs, sizeof(__pyx_k_opairs), 0, 0, 1, 1},\n  {&__pyx_n_s_open, __pyx_k_open, sizeof(__pyx_k_open), 0, 0, 1, 1},\n  {&__pyx_n_s_osymbols, __pyx_k_osymbols, sizeof(__pyx_k_osymbols), 0, 0, 1, 1},\n  {&__pyx_n_s_output_symbols, __pyx_k_output_symbols, sizeof(__pyx_k_output_symbols), 0, 0, 1, 1},\n  {&__pyx_n_s_pairs, __pyx_k_pairs, sizeof(__pyx_k_pairs), 0, 0, 1, 1},\n  {&__pyx_n_s_plus, __pyx_k_plus, sizeof(__pyx_k_plus), 0, 0, 1, 1},\n  {&__pyx_n_s_portrait, __pyx_k_portrait, sizeof(__pyx_k_portrait), 0, 0, 1, 1},\n  {&__pyx_n_s_position, __pyx_k_position, sizeof(__pyx_k_position), 0, 0, 1, 1},\n  {&__pyx_n_s_potentials, __pyx_k_potentials, sizeof(__pyx_k_potentials), 0, 0, 1, 1},\n  {&__pyx_n_s_power, __pyx_k_power, sizeof(__pyx_k_power), 0, 0, 1, 1},\n  {&__pyx_n_s_precision, __pyx_k_precision, sizeof(__pyx_k_precision), 0, 0, 1, 1},\n  {&__pyx_n_s_prepare, __pyx_k_prepare, sizeof(__pyx_k_prepare), 0, 0, 1, 1},\n  {&__pyx_n_s_project_output, __pyx_k_project_output, sizeof(__pyx_k_project_output), 0, 0, 1, 1},\n  {&__pyx_n_s_properties, __pyx_k_properties, sizeof(__pyx_k_properties), 0, 0, 1, 1},\n  {&__pyx_n_s_props, __pyx_k_props, sizeof(__pyx_k_props), 0, 0, 1, 1},\n  {&__pyx_n_s_push_labels, __pyx_k_push_labels, sizeof(__pyx_k_push_labels), 0, 0, 1, 1},\n  {&__pyx_n_s_push_weights, __pyx_k_push_weights, sizeof(__pyx_k_push_weights), 0, 0, 1, 1},\n  {&__pyx_n_s_pywrapfst_2, __pyx_k_pywrapfst_2, sizeof(__pyx_k_pywrapfst_2), 0, 0, 1, 1},\n  {&__pyx_kp_s_pywrapfst_pyx, __pyx_k_pywrapfst_pyx, sizeof(__pyx_k_pywrapfst_pyx), 0, 0, 1, 0},\n  {&__pyx_n_s_pyx_vtable, __pyx_k_pyx_vtable, sizeof(__pyx_k_pyx_vtable), 0, 0, 1, 1},\n  {&__pyx_n_s_qualname, __pyx_k_qualname, sizeof(__pyx_k_qualname), 0, 0, 1, 1},\n  {&__pyx_n_s_queue_type, __pyx_k_queue_type, sizeof(__pyx_k_queue_type), 0, 0, 1, 1},\n  {&__pyx_n_s_ranksep, __pyx_k_ranksep, sizeof(__pyx_k_ranksep), 0, 0, 1, 1},\n  {&__pyx_n_s_read, __pyx_k_read, sizeof(__pyx_k_read), 0, 0, 1, 1},\n  {&__pyx_n_s_read_from_string, __pyx_k_read_from_string, sizeof(__pyx_k_read_from_string), 0, 0, 1, 1},\n  {&__pyx_n_s_read_from_string_2, __pyx_k_read_from_string_2, sizeof(__pyx_k_read_from_string_2), 0, 0, 1, 1},\n  {&__pyx_n_s_read_fst, __pyx_k_read_fst, sizeof(__pyx_k_read_fst), 0, 0, 1, 1},\n  {&__pyx_n_s_read_text, __pyx_k_read_text, sizeof(__pyx_k_read_text), 0, 0, 1, 1},\n  {&__pyx_n_s_reduce, __pyx_k_reduce, sizeof(__pyx_k_reduce), 0, 0, 1, 1},\n  {&__pyx_n_s_reduce_cython, __pyx_k_reduce_cython, sizeof(__pyx_k_reduce_cython), 0, 0, 1, 1},\n  {&__pyx_n_s_reduce_ex, __pyx_k_reduce_ex, sizeof(__pyx_k_reduce_ex), 0, 0, 1, 1},\n  {&__pyx_n_s_register, __pyx_k_register, sizeof(__pyx_k_register), 0, 0, 1, 1},\n  {&__pyx_n_s_remove_common_affix, __pyx_k_remove_common_affix, sizeof(__pyx_k_remove_common_affix), 0, 0, 1, 1},\n  {&__pyx_n_s_remove_total_weight, __pyx_k_remove_total_weight, sizeof(__pyx_k_remove_total_weight), 0, 0, 1, 1},\n  {&__pyx_n_s_require_superinitial, __pyx_k_require_superinitial, sizeof(__pyx_k_require_superinitial), 0, 0, 1, 1},\n  {&__pyx_n_s_reset, __pyx_k_reset, sizeof(__pyx_k_reset), 0, 0, 1, 1},\n  {&__pyx_n_s_reset_fst_error_fatal, __pyx_k_reset_fst_error_fatal, sizeof(__pyx_k_reset_fst_error_fatal), 0, 0, 1, 1},\n  {&__pyx_n_s_result, __pyx_k_result, sizeof(__pyx_k_result), 0, 0, 1, 1},\n  {&__pyx_n_s_return_arc_labeling, __pyx_k_return_arc_labeling, sizeof(__pyx_k_return_arc_labeling), 0, 0, 1, 1},\n  {&__pyx_n_s_return_label, __pyx_k_return_label, sizeof(__pyx_k_return_label), 0, 0, 1, 1},\n  {&__pyx_n_s_returncode, __pyx_k_returncode, sizeof(__pyx_k_returncode), 0, 0, 1, 1},\n  {&__pyx_n_s_reverse, __pyx_k_reverse, sizeof(__pyx_k_reverse), 0, 0, 1, 1},\n  {&__pyx_n_s_rhs, __pyx_k_rhs, sizeof(__pyx_k_rhs), 0, 0, 1, 1},\n  {&__pyx_n_s_seed, __pyx_k_seed, sizeof(__pyx_k_seed), 0, 0, 1, 1},\n  {&__pyx_n_s_seek, __pyx_k_seek, sizeof(__pyx_k_seek), 0, 0, 1, 1},\n  {&__pyx_n_s_select, __pyx_k_select, sizeof(__pyx_k_select), 0, 0, 1, 1},\n  {&__pyx_kp_s_self__aiter_self__fst_cannot_be, __pyx_k_self__aiter_self__fst_cannot_be, sizeof(__pyx_k_self__aiter_self__fst_cannot_be), 0, 0, 1, 0},\n  {&__pyx_kp_s_self__aiter_self__mfst_cannot_be, __pyx_k_self__aiter_self__mfst_cannot_be, sizeof(__pyx_k_self__aiter_self__mfst_cannot_be), 0, 0, 1, 0},\n  {&__pyx_kp_s_self__arc_cannot_be_converted_to, __pyx_k_self__arc_cannot_be_converted_to, sizeof(__pyx_k_self__arc_cannot_be_converted_to), 0, 0, 1, 0},\n  {&__pyx_kp_s_self__encoder_cannot_be_converte, __pyx_k_self__encoder_cannot_be_converte, sizeof(__pyx_k_self__encoder_cannot_be_converte), 0, 0, 1, 0},\n  {&__pyx_kp_s_self__encoder_self__table_cannot, __pyx_k_self__encoder_self__table_cannot, sizeof(__pyx_k_self__encoder_self__table_cannot), 0, 0, 1, 0},\n  {&__pyx_kp_s_self__fst_self__siter_cannot_be, __pyx_k_self__fst_self__siter_cannot_be, sizeof(__pyx_k_self__fst_self__siter_cannot_be), 0, 0, 1, 0},\n  {&__pyx_kp_s_self__fst_self__table_cannot_be, __pyx_k_self__fst_self__table_cannot_be, sizeof(__pyx_k_self__fst_self__table_cannot_be), 0, 0, 1, 0},\n  {&__pyx_kp_s_self__mfst_self__table_cannot_be, __pyx_k_self__mfst_self__table_cannot_be, sizeof(__pyx_k_self__mfst_self__table_cannot_be), 0, 0, 1, 0},\n  {&__pyx_kp_s_self__reader_cannot_be_converted, __pyx_k_self__reader_cannot_be_converted, sizeof(__pyx_k_self__reader_cannot_be_converted), 0, 0, 1, 0},\n  {&__pyx_kp_s_self__siter_self__table_cannot_b, __pyx_k_self__siter_self__table_cannot_b, sizeof(__pyx_k_self__siter_self__table_cannot_b), 0, 0, 1, 0},\n  {&__pyx_kp_s_self__smart_table_self__table_ca, __pyx_k_self__smart_table_self__table_ca, sizeof(__pyx_k_self__smart_table_self__table_ca), 0, 0, 1, 0},\n  {&__pyx_kp_s_self__table_cannot_be_converted, __pyx_k_self__table_cannot_be_converted, sizeof(__pyx_k_self__table_cannot_be_converted), 0, 0, 1, 0},\n  {&__pyx_kp_s_self__weight_cannot_be_converted, __pyx_k_self__weight_cannot_be_converted, sizeof(__pyx_k_self__weight_cannot_be_converted), 0, 0, 1, 0},\n  {&__pyx_kp_s_self__writer_cannot_be_converted, __pyx_k_self__writer_cannot_be_converted, sizeof(__pyx_k_self__writer_cannot_be_converted), 0, 0, 1, 0},\n  {&__pyx_n_s_set_flags, __pyx_k_set_flags, sizeof(__pyx_k_set_flags), 0, 0, 1, 1},\n  {&__pyx_n_s_set_input_symbols, __pyx_k_set_input_symbols, sizeof(__pyx_k_set_input_symbols), 0, 0, 1, 1},\n  {&__pyx_n_s_set_name, __pyx_k_set_name, sizeof(__pyx_k_set_name), 0, 0, 1, 1},\n  {&__pyx_n_s_set_output_symbols, __pyx_k_set_output_symbols, sizeof(__pyx_k_set_output_symbols), 0, 0, 1, 1},\n  {&__pyx_n_s_set_value, __pyx_k_set_value, sizeof(__pyx_k_set_value), 0, 0, 1, 1},\n  {&__pyx_n_s_setstate, __pyx_k_setstate, sizeof(__pyx_k_setstate), 0, 0, 1, 1},\n  {&__pyx_n_s_setstate_cython, __pyx_k_setstate_cython, sizeof(__pyx_k_setstate_cython), 0, 0, 1, 1},\n  {&__pyx_n_s_shortestdistance, __pyx_k_shortestdistance, sizeof(__pyx_k_shortestdistance), 0, 0, 1, 1},\n  {&__pyx_n_s_show_weight_one, __pyx_k_show_weight_one, sizeof(__pyx_k_show_weight_one), 0, 0, 1, 1},\n  {&__pyx_n_s_sort_type, __pyx_k_sort_type, sizeof(__pyx_k_sort_type), 0, 0, 1, 1},\n  {&__pyx_n_s_ssymbols, __pyx_k_ssymbols, sizeof(__pyx_k_ssymbols), 0, 0, 1, 1},\n  {&__pyx_n_b_standard, __pyx_k_standard, sizeof(__pyx_k_standard), 0, 0, 0, 1},\n  {&__pyx_n_s_start, __pyx_k_start, sizeof(__pyx_k_start), 0, 0, 1, 1},\n  {&__pyx_n_s_state, __pyx_k_state, sizeof(__pyx_k_state), 0, 0, 1, 1},\n  {&__pyx_n_s_states, __pyx_k_states, sizeof(__pyx_k_states), 0, 0, 1, 1},\n  {&__pyx_n_s_staticmethod, __pyx_k_staticmethod, sizeof(__pyx_k_staticmethod), 0, 0, 1, 1},\n  {&__pyx_n_s_stderr, __pyx_k_stderr, sizeof(__pyx_k_stderr), 0, 0, 1, 1},\n  {&__pyx_n_s_stdin, __pyx_k_stdin, sizeof(__pyx_k_stdin), 0, 0, 1, 1},\n  {&__pyx_n_s_stdout, __pyx_k_stdout, sizeof(__pyx_k_stdout), 0, 0, 1, 1},\n  {&__pyx_n_s_subprocess, __pyx_k_subprocess, sizeof(__pyx_k_subprocess), 0, 0, 1, 1},\n  {&__pyx_n_s_subsequential_label, __pyx_k_subsequential_label, sizeof(__pyx_k_subsequential_label), 0, 0, 1, 1},\n  {&__pyx_n_s_symbol, __pyx_k_symbol, sizeof(__pyx_k_symbol), 0, 0, 1, 1},\n  {&__pyx_n_s_syms, __pyx_k_syms, sizeof(__pyx_k_syms), 0, 0, 1, 1},\n  {&__pyx_n_s_test, __pyx_k_test, sizeof(__pyx_k_test), 0, 0, 1, 1},\n  {&__pyx_n_s_test_2, __pyx_k_test_2, sizeof(__pyx_k_test_2), 0, 0, 1, 1},\n  {&__pyx_n_s_text, __pyx_k_text, sizeof(__pyx_k_text), 0, 0, 1, 1},\n  {&__pyx_n_s_times, __pyx_k_times, sizeof(__pyx_k_times), 0, 0, 1, 1},\n  {&__pyx_n_s_title, __pyx_k_title, sizeof(__pyx_k_title), 0, 0, 1, 1},\n  {&__pyx_n_s_to_final, __pyx_k_to_final, sizeof(__pyx_k_to_final), 0, 0, 1, 1},\n  {&__pyx_n_s_to_string, __pyx_k_to_string, sizeof(__pyx_k_to_string), 0, 0, 1, 1},\n  {&__pyx_n_s_type, __pyx_k_type, sizeof(__pyx_k_type), 0, 0, 1, 1},\n  {&__pyx_n_b_uniform, __pyx_k_uniform, sizeof(__pyx_k_uniform), 0, 0, 0, 1},\n  {&__pyx_n_s_unique, __pyx_k_unique, sizeof(__pyx_k_unique), 0, 0, 1, 1},\n  {&__pyx_n_s_unknown_isymbol, __pyx_k_unknown_isymbol, sizeof(__pyx_k_unknown_isymbol), 0, 0, 1, 1},\n  {&__pyx_n_s_unknown_osymbol, __pyx_k_unknown_osymbol, sizeof(__pyx_k_unknown_osymbol), 0, 0, 1, 1},\n  {&__pyx_kp_b_unspecified, __pyx_k_unspecified, sizeof(__pyx_k_unspecified), 0, 0, 0, 0},\n  {&__pyx_n_s_utf8, __pyx_k_utf8, sizeof(__pyx_k_utf8), 0, 0, 1, 1},\n  {&__pyx_n_s_value, __pyx_k_value, sizeof(__pyx_k_value), 0, 0, 1, 1},\n  {&__pyx_n_b_vector, __pyx_k_vector, sizeof(__pyx_k_vector), 0, 0, 0, 1},\n  {&__pyx_n_s_verify, __pyx_k_verify, sizeof(__pyx_k_verify), 0, 0, 1, 1},\n  {&__pyx_n_s_vertical, __pyx_k_vertical, sizeof(__pyx_k_vertical), 0, 0, 1, 1},\n  {&__pyx_n_s_w, __pyx_k_w, sizeof(__pyx_k_w), 0, 0, 1, 1},\n  {&__pyx_n_s_warning, __pyx_k_warning, sizeof(__pyx_k_warning), 0, 0, 1, 1},\n  {&__pyx_n_s_weight, __pyx_k_weight, sizeof(__pyx_k_weight), 0, 0, 1, 1},\n  {&__pyx_n_s_weight_type, __pyx_k_weight_type, sizeof(__pyx_k_weight_type), 0, 0, 1, 1},\n  {&__pyx_n_s_weighted, __pyx_k_weighted, sizeof(__pyx_k_weighted), 0, 0, 1, 1},\n  {&__pyx_n_s_width, __pyx_k_width, sizeof(__pyx_k_width), 0, 0, 1, 1},\n  {&__pyx_n_s_write, __pyx_k_write, sizeof(__pyx_k_write), 0, 0, 1, 1},\n  {&__pyx_n_s_write_text, __pyx_k_write_text, sizeof(__pyx_k_write_text), 0, 0, 1, 1},\n  {&__pyx_n_s_write_to_string, __pyx_k_write_to_string, sizeof(__pyx_k_write_to_string), 0, 0, 1, 1},\n  {0, 0, 0, 0, 0, 0, 0}\n};\nstatic int __Pyx_InitCachedBuiltins(void) {\n  __pyx_builtin_ValueError = __Pyx_GetBuiltinName(__pyx_n_s_ValueError); if (!__pyx_builtin_ValueError) __PYX_ERR(0, 126, __pyx_L1_error)\n  __pyx_builtin_RuntimeError = __Pyx_GetBuiltinName(__pyx_n_s_RuntimeError); if (!__pyx_builtin_RuntimeError) __PYX_ERR(0, 136, __pyx_L1_error)\n  __pyx_builtin_IndexError = __Pyx_GetBuiltinName(__pyx_n_s_IndexError); if (!__pyx_builtin_IndexError) __PYX_ERR(0, 141, __pyx_L1_error)\n  __pyx_builtin_IOError = __Pyx_GetBuiltinName(__pyx_n_s_IOError); if (!__pyx_builtin_IOError) __PYX_ERR(0, 146, __pyx_L1_error)\n  __pyx_builtin_object = __Pyx_GetBuiltinName(__pyx_n_s_object); if (!__pyx_builtin_object) __PYX_ERR(0, 2742, __pyx_L1_error)\n  __pyx_builtin_staticmethod = __Pyx_GetBuiltinName(__pyx_n_s_staticmethod); if (!__pyx_builtin_staticmethod) __PYX_ERR(0, 2762, __pyx_L1_error)\n  __pyx_builtin_id = __Pyx_GetBuiltinName(__pyx_n_s_id); if (!__pyx_builtin_id) __PYX_ERR(0, 370, __pyx_L1_error)\n  __pyx_builtin_TypeError = __Pyx_GetBuiltinName(__pyx_n_s_TypeError); if (!__pyx_builtin_TypeError) __PYX_ERR(1, 2, __pyx_L1_error)\n  __pyx_builtin_StopIteration = __Pyx_GetBuiltinName(__pyx_n_s_StopIteration); if (!__pyx_builtin_StopIteration) __PYX_ERR(0, 1145, __pyx_L1_error)\n  __pyx_builtin_KeyError = __Pyx_GetBuiltinName(__pyx_n_s_KeyError); if (!__pyx_builtin_KeyError) __PYX_ERR(0, 4358, __pyx_L1_error)\n  return 0;\n  __pyx_L1_error:;\n  return -1;\n}\n\nstatic int __Pyx_InitCachedConstants(void) {\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__Pyx_InitCachedConstants\", 0);\n\n  /* \"pywrapfst.pyx\":388\n *   cdef void _check_weight(self) except *:\n *     if self.type() == b\"none\":\n *       raise FstArgError(\"Weight type not found\")             # <<<<<<<<<<<<<<\n *     if self.to_string() == b\"BadNumber\":\n *       raise FstBadWeightError(\"Invalid weight\")\n */\n  __pyx_tuple_ = PyTuple_Pack(1, __pyx_kp_s_Weight_type_not_found); if (unlikely(!__pyx_tuple_)) __PYX_ERR(0, 388, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple_);\n  __Pyx_GIVEREF(__pyx_tuple_);\n\n  /* \"pywrapfst.pyx\":390\n *       raise FstArgError(\"Weight type not found\")\n *     if self.to_string() == b\"BadNumber\":\n *       raise FstBadWeightError(\"Invalid weight\")             # <<<<<<<<<<<<<<\n * \n *   cpdef Weight copy(self):\n */\n  __pyx_tuple__2 = PyTuple_Pack(1, __pyx_kp_s_Invalid_weight); if (unlikely(!__pyx_tuple__2)) __PYX_ERR(0, 390, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__2);\n  __Pyx_GIVEREF(__pyx_tuple__2);\n\n  /* \"(tree fragment)\":2\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._weight cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._weight cannot be converted to a Python object for pickling\")\n */\n  __pyx_tuple__3 = PyTuple_Pack(1, __pyx_kp_s_self__weight_cannot_be_converted); if (unlikely(!__pyx_tuple__3)) __PYX_ERR(1, 2, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__3);\n  __Pyx_GIVEREF(__pyx_tuple__3);\n\n  /* \"(tree fragment)\":4\n *     raise TypeError(\"self._weight cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._weight cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n */\n  __pyx_tuple__4 = PyTuple_Pack(1, __pyx_kp_s_self__weight_cannot_be_converted); if (unlikely(!__pyx_tuple__4)) __PYX_ERR(1, 4, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__4);\n  __Pyx_GIVEREF(__pyx_tuple__4);\n\n  /* \"pywrapfst.pyx\":638\n *       tostring(weight_type))))\n *   if result._weight.get().Type() == b\"none\":\n *     raise FstArgError(\"Weight type not found\")             # <<<<<<<<<<<<<<\n *   return result\n * \n */\n  __pyx_tuple__5 = PyTuple_Pack(1, __pyx_kp_s_Weight_type_not_found); if (unlikely(!__pyx_tuple__5)) __PYX_ERR(0, 638, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__5);\n  __Pyx_GIVEREF(__pyx_tuple__5);\n\n  /* \"pywrapfst.pyx\":647\n *         fst.WeightClass.One(tostring(weight_type))))\n *   if result._weight.get().Type() == b\"none\":\n *     raise FstArgError(\"Weight type not found\")             # <<<<<<<<<<<<<<\n *   return result\n * \n */\n  __pyx_tuple__6 = PyTuple_Pack(1, __pyx_kp_s_Weight_type_not_found); if (unlikely(!__pyx_tuple__6)) __PYX_ERR(0, 647, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__6);\n  __Pyx_GIVEREF(__pyx_tuple__6);\n\n  /* \"(tree fragment)\":2\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._table cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._table cannot be converted to a Python object for pickling\")\n */\n  __pyx_tuple__7 = PyTuple_Pack(1, __pyx_kp_s_self__table_cannot_be_converted); if (unlikely(!__pyx_tuple__7)) __PYX_ERR(1, 2, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__7);\n  __Pyx_GIVEREF(__pyx_tuple__7);\n\n  /* \"(tree fragment)\":4\n *     raise TypeError(\"self._table cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._table cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n */\n  __pyx_tuple__8 = PyTuple_Pack(1, __pyx_kp_s_self__table_cannot_be_converted); if (unlikely(!__pyx_tuple__8)) __PYX_ERR(1, 4, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__8);\n  __Pyx_GIVEREF(__pyx_tuple__8);\n\n  /* \"(tree fragment)\":2\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._encoder,self._table cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._encoder,self._table cannot be converted to a Python object for pickling\")\n */\n  __pyx_tuple__9 = PyTuple_Pack(1, __pyx_kp_s_self__encoder_self__table_cannot); if (unlikely(!__pyx_tuple__9)) __PYX_ERR(1, 2, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__9);\n  __Pyx_GIVEREF(__pyx_tuple__9);\n\n  /* \"(tree fragment)\":4\n *     raise TypeError(\"self._encoder,self._table cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._encoder,self._table cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n */\n  __pyx_tuple__10 = PyTuple_Pack(1, __pyx_kp_s_self__encoder_self__table_cannot); if (unlikely(!__pyx_tuple__10)) __PYX_ERR(1, 4, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__10);\n  __Pyx_GIVEREF(__pyx_tuple__10);\n\n  /* \"(tree fragment)\":2\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._fst,self._table cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._fst,self._table cannot be converted to a Python object for pickling\")\n */\n  __pyx_tuple__11 = PyTuple_Pack(1, __pyx_kp_s_self__fst_self__table_cannot_be); if (unlikely(!__pyx_tuple__11)) __PYX_ERR(1, 2, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__11);\n  __Pyx_GIVEREF(__pyx_tuple__11);\n\n  /* \"(tree fragment)\":4\n *     raise TypeError(\"self._fst,self._table cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._fst,self._table cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n */\n  __pyx_tuple__12 = PyTuple_Pack(1, __pyx_kp_s_self__fst_self__table_cannot_be); if (unlikely(!__pyx_tuple__12)) __PYX_ERR(1, 4, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__12);\n  __Pyx_GIVEREF(__pyx_tuple__12);\n\n  /* \"(tree fragment)\":2\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._table cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._table cannot be converted to a Python object for pickling\")\n */\n  __pyx_tuple__14 = PyTuple_Pack(1, __pyx_kp_s_self__table_cannot_be_converted); if (unlikely(!__pyx_tuple__14)) __PYX_ERR(1, 2, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__14);\n  __Pyx_GIVEREF(__pyx_tuple__14);\n\n  /* \"(tree fragment)\":4\n *     raise TypeError(\"self._table cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._table cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n */\n  __pyx_tuple__15 = PyTuple_Pack(1, __pyx_kp_s_self__table_cannot_be_converted); if (unlikely(!__pyx_tuple__15)) __PYX_ERR(1, 4, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__15);\n  __Pyx_GIVEREF(__pyx_tuple__15);\n\n  /* \"(tree fragment)\":2\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._mfst,self._table cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._mfst,self._table cannot be converted to a Python object for pickling\")\n */\n  __pyx_tuple__16 = PyTuple_Pack(1, __pyx_kp_s_self__mfst_self__table_cannot_be); if (unlikely(!__pyx_tuple__16)) __PYX_ERR(1, 2, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__16);\n  __Pyx_GIVEREF(__pyx_tuple__16);\n\n  /* \"(tree fragment)\":4\n *     raise TypeError(\"self._mfst,self._table cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._mfst,self._table cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n */\n  __pyx_tuple__17 = PyTuple_Pack(1, __pyx_kp_s_self__mfst_self__table_cannot_be); if (unlikely(!__pyx_tuple__17)) __PYX_ERR(1, 4, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__17);\n  __Pyx_GIVEREF(__pyx_tuple__17);\n\n  /* \"(tree fragment)\":2\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._smart_table,self._table cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._smart_table,self._table cannot be converted to a Python object for pickling\")\n */\n  __pyx_tuple__18 = PyTuple_Pack(1, __pyx_kp_s_self__smart_table_self__table_ca); if (unlikely(!__pyx_tuple__18)) __PYX_ERR(1, 2, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__18);\n  __Pyx_GIVEREF(__pyx_tuple__18);\n\n  /* \"(tree fragment)\":4\n *     raise TypeError(\"self._smart_table,self._table cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._smart_table,self._table cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n */\n  __pyx_tuple__19 = PyTuple_Pack(1, __pyx_kp_s_self__smart_table_self__table_ca); if (unlikely(!__pyx_tuple__19)) __PYX_ERR(1, 4, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__19);\n  __Pyx_GIVEREF(__pyx_tuple__19);\n\n  /* \"(tree fragment)\":2\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._siter,self._table cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._siter,self._table cannot be converted to a Python object for pickling\")\n */\n  __pyx_tuple__20 = PyTuple_Pack(1, __pyx_kp_s_self__siter_self__table_cannot_b); if (unlikely(!__pyx_tuple__20)) __PYX_ERR(1, 2, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__20);\n  __Pyx_GIVEREF(__pyx_tuple__20);\n\n  /* \"(tree fragment)\":4\n *     raise TypeError(\"self._siter,self._table cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._siter,self._table cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n */\n  __pyx_tuple__21 = PyTuple_Pack(1, __pyx_kp_s_self__siter_self__table_cannot_b); if (unlikely(!__pyx_tuple__21)) __PYX_ERR(1, 4, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__21);\n  __Pyx_GIVEREF(__pyx_tuple__21);\n\n  /* \"(tree fragment)\":2\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._encoder cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._encoder cannot be converted to a Python object for pickling\")\n */\n  __pyx_tuple__22 = PyTuple_Pack(1, __pyx_kp_s_self__encoder_cannot_be_converte); if (unlikely(!__pyx_tuple__22)) __PYX_ERR(1, 2, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__22);\n  __Pyx_GIVEREF(__pyx_tuple__22);\n\n  /* \"(tree fragment)\":4\n *     raise TypeError(\"self._encoder cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._encoder cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n */\n  __pyx_tuple__23 = PyTuple_Pack(1, __pyx_kp_s_self__encoder_cannot_be_converte); if (unlikely(!__pyx_tuple__23)) __PYX_ERR(1, 4, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__23);\n  __Pyx_GIVEREF(__pyx_tuple__23);\n\n  /* \"pywrapfst.pyx\":1400\n *     if proc.returncode != 0:  # Just to be explicit.\n *       raise subprocess.CalledProcessError(proc.returncode, self._DOT_TSVG)\n *     return sout.decode(\"utf8\")             # <<<<<<<<<<<<<<\n * \n *   def __repr__(self):\n */\n  __pyx_tuple__25 = PyTuple_Pack(1, __pyx_n_s_utf8); if (unlikely(!__pyx_tuple__25)) __PYX_ERR(0, 1400, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__25);\n  __Pyx_GIVEREF(__pyx_tuple__25);\n\n  /* \"pywrapfst.pyx\":1576\n *     cdef size_t result = self._fst.get().NumArcs(state)\n *     if result == SIZE_MAX:\n *       raise FstIndexError(\"State index out of range\")             # <<<<<<<<<<<<<<\n *     return result\n * \n */\n  __pyx_tuple__26 = PyTuple_Pack(1, __pyx_kp_s_State_index_out_of_range); if (unlikely(!__pyx_tuple__26)) __PYX_ERR(0, 1576, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__26);\n  __Pyx_GIVEREF(__pyx_tuple__26);\n\n  /* \"pywrapfst.pyx\":1598\n *     cdef size_t result = self._fst.get().NumInputEpsilons(state)\n *     if result == SIZE_MAX:\n *       raise FstIndexError(\"State index out of range\")             # <<<<<<<<<<<<<<\n *     return result\n * \n */\n  __pyx_tuple__27 = PyTuple_Pack(1, __pyx_kp_s_State_index_out_of_range); if (unlikely(!__pyx_tuple__27)) __PYX_ERR(0, 1598, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__27);\n  __Pyx_GIVEREF(__pyx_tuple__27);\n\n  /* \"pywrapfst.pyx\":1620\n *     cdef size_t result = self._fst.get().NumOutputEpsilons(state)\n *     if result == SIZE_MAX:\n *       raise FstIndexError(\"State index out of range\")             # <<<<<<<<<<<<<<\n *     return result\n * \n */\n  __pyx_tuple__28 = PyTuple_Pack(1, __pyx_kp_s_State_index_out_of_range); if (unlikely(!__pyx_tuple__28)) __PYX_ERR(0, 1620, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__28);\n  __Pyx_GIVEREF(__pyx_tuple__28);\n\n  /* \"pywrapfst.pyx\":1770\n *     cdef stringstream sstrm\n *     if not self._fst.get().Write(sstrm, \"write_to_string\"):\n *       raise FstIOError(\"Write to string failed\")             # <<<<<<<<<<<<<<\n *     return sstrm.str()\n * \n */\n  __pyx_tuple__29 = PyTuple_Pack(1, __pyx_kp_s_Write_to_string_failed); if (unlikely(!__pyx_tuple__29)) __PYX_ERR(0, 1770, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__29);\n  __Pyx_GIVEREF(__pyx_tuple__29);\n\n  /* \"pywrapfst.pyx\":1790\n *     \"\"\"\n *     if self._fst.get().Properties(fst.kError, True) == fst.kError:\n *       raise FstOpError(\"Operation failed\")             # <<<<<<<<<<<<<<\n * \n *   cdef void _add_arc(self, int64 state, Arc arc) except *:\n */\n  __pyx_tuple__30 = PyTuple_Pack(1, __pyx_kp_s_Operation_failed); if (unlikely(!__pyx_tuple__30)) __PYX_ERR(0, 1790, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__30);\n  __Pyx_GIVEREF(__pyx_tuple__30);\n\n  /* \"pywrapfst.pyx\":1794\n *   cdef void _add_arc(self, int64 state, Arc arc) except *:\n *     if not self._fst.get().ValidStateId(state):\n *       raise FstIndexError(\"State index out of range\")             # <<<<<<<<<<<<<<\n *     if not self._mfst.get().AddArc(state, deref(arc._arc)):\n *       raise FstOpError(\"Incompatible or invalid weight type\")\n */\n  __pyx_tuple__31 = PyTuple_Pack(1, __pyx_kp_s_State_index_out_of_range); if (unlikely(!__pyx_tuple__31)) __PYX_ERR(0, 1794, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__31);\n  __Pyx_GIVEREF(__pyx_tuple__31);\n\n  /* \"pywrapfst.pyx\":1796\n *       raise FstIndexError(\"State index out of range\")\n *     if not self._mfst.get().AddArc(state, deref(arc._arc)):\n *       raise FstOpError(\"Incompatible or invalid weight type\")             # <<<<<<<<<<<<<<\n *     self._check_mutating_imethod()\n * \n */\n  __pyx_tuple__32 = PyTuple_Pack(1, __pyx_kp_s_Incompatible_or_invalid_weight_t); if (unlikely(!__pyx_tuple__32)) __PYX_ERR(0, 1796, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__32);\n  __Pyx_GIVEREF(__pyx_tuple__32);\n\n  /* \"pywrapfst.pyx\":1961\n *     if not (self._mfst.get().DeleteArcs(state, n) if n else\n *             self._mfst.get().DeleteArcs(state)):\n *       raise FstIndexError(\"State index out of range\")             # <<<<<<<<<<<<<<\n *     self._check_mutating_imethod()\n * \n */\n  __pyx_tuple__33 = PyTuple_Pack(1, __pyx_kp_s_State_index_out_of_range); if (unlikely(!__pyx_tuple__33)) __PYX_ERR(0, 1961, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__33);\n  __Pyx_GIVEREF(__pyx_tuple__33);\n\n  /* \"pywrapfst.pyx\":1991\n *     if states:\n *       if not self._mfst.get().DeleteStates(<const vector[int64]> states):\n *         raise FstIndexError(\"State index out of range\")             # <<<<<<<<<<<<<<\n *     else:\n *       self._mfst.get().DeleteStates()\n */\n  __pyx_tuple__34 = PyTuple_Pack(1, __pyx_kp_s_State_index_out_of_range); if (unlikely(!__pyx_tuple__34)) __PYX_ERR(0, 1991, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__34);\n  __Pyx_GIVEREF(__pyx_tuple__34);\n\n  /* \"pywrapfst.pyx\":2260\n *         _opairs.get().push_back(fst.LabelPair(before, after))\n *     if _ipairs.get().empty() and _opairs.get().empty():\n *       raise FstArgError(\"No relabeling pairs specified.\")             # <<<<<<<<<<<<<<\n *     fst.Relabel(self._mfst.get(), deref(_ipairs), deref(_opairs))\n *     self._check_mutating_imethod()\n */\n  __pyx_tuple__43 = PyTuple_Pack(1, __pyx_kp_s_No_relabeling_pairs_specified); if (unlikely(!__pyx_tuple__43)) __PYX_ERR(0, 2260, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__43);\n  __Pyx_GIVEREF(__pyx_tuple__43);\n\n  /* \"pywrapfst.pyx\":2299\n *                             bool attach_new_osymbols=True) except *:\n *     if new_isymbols is None and new_osymbols is None:\n *       raise FstArgError(\"No new SymbolTables specified\")             # <<<<<<<<<<<<<<\n *     cdef fst.SymbolTable *new_isymbols_ptr = NULL\n *     if new_isymbols is not None:\n */\n  __pyx_tuple__44 = PyTuple_Pack(1, __pyx_kp_s_No_new_SymbolTables_specified); if (unlikely(!__pyx_tuple__44)) __PYX_ERR(0, 2299, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__44);\n  __Pyx_GIVEREF(__pyx_tuple__44);\n\n  /* \"pywrapfst.pyx\":2367\n *   cdef void _reserve_arcs(self, int64 state, size_t n) except *:\n *     if not self._mfst.get().ReserveArcs(state, n):\n *       raise FstIndexError(\"State index out of range\")             # <<<<<<<<<<<<<<\n *     self._check_mutating_imethod()\n * \n */\n  __pyx_tuple__45 = PyTuple_Pack(1, __pyx_kp_s_State_index_out_of_range); if (unlikely(!__pyx_tuple__45)) __PYX_ERR(0, 2367, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__45);\n  __Pyx_GIVEREF(__pyx_tuple__45);\n\n  /* \"pywrapfst.pyx\":2494\n *   cdef void _set_final(self, int64 state, weight=None) except *:\n *     if not self._mfst.get().ValidStateId(state):\n *       raise FstIndexError(\"State index out of range\")             # <<<<<<<<<<<<<<\n *     cdef fst.WeightClass wc = _get_WeightClass_or_One(self.weight_type(),\n *                                                       weight)\n */\n  __pyx_tuple__50 = PyTuple_Pack(1, __pyx_kp_s_State_index_out_of_range); if (unlikely(!__pyx_tuple__50)) __PYX_ERR(0, 2494, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__50);\n  __Pyx_GIVEREF(__pyx_tuple__50);\n\n  /* \"pywrapfst.pyx\":2498\n *                                                       weight)\n *     if not self._mfst.get().SetFinal(state, wc):\n *       raise FstOpError(\"Incompatible or invalid weight\")             # <<<<<<<<<<<<<<\n *     self._check_mutating_imethod()\n * \n */\n  __pyx_tuple__51 = PyTuple_Pack(1, __pyx_kp_s_Incompatible_or_invalid_weight); if (unlikely(!__pyx_tuple__51)) __PYX_ERR(0, 2498, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__51);\n  __Pyx_GIVEREF(__pyx_tuple__51);\n\n  /* \"pywrapfst.pyx\":2598\n *   cdef void _set_start(self, int64 state) except *:\n *     if not self._mfst.get().SetStart(state):\n *       raise FstIndexError(\"State index out of range\")             # <<<<<<<<<<<<<<\n *     self._check_mutating_imethod()\n * \n */\n  __pyx_tuple__52 = PyTuple_Pack(1, __pyx_kp_s_State_index_out_of_range); if (unlikely(!__pyx_tuple__52)) __PYX_ERR(0, 2598, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__52);\n  __Pyx_GIVEREF(__pyx_tuple__52);\n\n  /* \"pywrapfst.pyx\":2624\n *     # TopSort returns False if the FST is cyclic, and thus can't be TopSorted.\n *     if not fst.TopSort(self._mfst.get()):\n *       logging.warning(\"Cannot topsort cyclic FST.\")             # <<<<<<<<<<<<<<\n *     self._check_mutating_imethod()\n * \n */\n  __pyx_tuple__53 = PyTuple_Pack(1, __pyx_kp_s_Cannot_topsort_cyclic_FST); if (unlikely(!__pyx_tuple__53)) __PYX_ERR(0, 2624, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__53);\n  __Pyx_GIVEREF(__pyx_tuple__53);\n\n  /* \"pywrapfst.pyx\":2693\n * cdef _Fst _init_Fst(FstClass_ptr tfst):\n *   if tfst.Properties(fst.kError, True):\n *     raise FstOpError(\"Operation failed\")             # <<<<<<<<<<<<<<\n *   cdef _Fst ofst = _Fst.__new__(_Fst)\n *   ofst._fst.reset(tfst)\n */\n  __pyx_tuple__54 = PyTuple_Pack(1, __pyx_kp_s_Operation_failed); if (unlikely(!__pyx_tuple__54)) __PYX_ERR(0, 2693, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__54);\n  __Pyx_GIVEREF(__pyx_tuple__54);\n\n  /* \"pywrapfst.pyx\":2701\n * cdef _MutableFst _init_MutableFst(MutableFstClass_ptr tfst):\n *   if tfst.Properties(fst.kError, True):\n *     raise FstOpError(\"Operation failed\")             # <<<<<<<<<<<<<<\n *   cdef _MutableFst ofst = _MutableFst.__new__(_MutableFst)\n *   ofst._fst.reset(tfst)\n */\n  __pyx_tuple__55 = PyTuple_Pack(1, __pyx_kp_s_Operation_failed); if (unlikely(!__pyx_tuple__55)) __PYX_ERR(0, 2701, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__55);\n  __Pyx_GIVEREF(__pyx_tuple__55);\n\n  /* \"pywrapfst.pyx\":2738\n *   tfst.reset(fst.FstClass.ReadFromStream(sstrm, b\"<pywrapfst>\"))\n *   if tfst.get() == NULL:\n *     raise FstIOError(\"Read failed: <string>\")             # <<<<<<<<<<<<<<\n *   return _init_XFst(tfst.release())\n * \n */\n  __pyx_tuple__56 = PyTuple_Pack(1, __pyx_kp_s_Read_failed_string); if (unlikely(!__pyx_tuple__56)) __PYX_ERR(0, 2738, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__56);\n  __Pyx_GIVEREF(__pyx_tuple__56);\n\n  /* \"(tree fragment)\":2\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._arc cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._arc cannot be converted to a Python object for pickling\")\n */\n  __pyx_tuple__57 = PyTuple_Pack(1, __pyx_kp_s_self__arc_cannot_be_converted_to); if (unlikely(!__pyx_tuple__57)) __PYX_ERR(1, 2, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__57);\n  __Pyx_GIVEREF(__pyx_tuple__57);\n\n  /* \"(tree fragment)\":4\n *     raise TypeError(\"self._arc cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._arc cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n */\n  __pyx_tuple__58 = PyTuple_Pack(1, __pyx_kp_s_self__arc_cannot_be_converted_to); if (unlikely(!__pyx_tuple__58)) __PYX_ERR(1, 4, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__58);\n  __Pyx_GIVEREF(__pyx_tuple__58);\n\n  /* \"pywrapfst.pyx\":2978\n *   def __init__(self, _Fst ifst, int64 state):\n *     if not ifst._fst.get().ValidStateId(state):\n *       raise FstIndexError(\"State index out of range\")             # <<<<<<<<<<<<<<\n *     # Makes copy of the shared_ptr, potentially extending the FST's lifetime.\n *     self._fst = ifst._fst\n */\n  __pyx_tuple__59 = PyTuple_Pack(1, __pyx_kp_s_State_index_out_of_range); if (unlikely(!__pyx_tuple__59)) __PYX_ERR(0, 2978, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__59);\n  __Pyx_GIVEREF(__pyx_tuple__59);\n\n  /* \"(tree fragment)\":2\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._aiter,self._fst cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._aiter,self._fst cannot be converted to a Python object for pickling\")\n */\n  __pyx_tuple__60 = PyTuple_Pack(1, __pyx_kp_s_self__aiter_self__fst_cannot_be); if (unlikely(!__pyx_tuple__60)) __PYX_ERR(1, 2, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__60);\n  __Pyx_GIVEREF(__pyx_tuple__60);\n\n  /* \"(tree fragment)\":4\n *     raise TypeError(\"self._aiter,self._fst cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._aiter,self._fst cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n */\n  __pyx_tuple__61 = PyTuple_Pack(1, __pyx_kp_s_self__aiter_self__fst_cannot_be); if (unlikely(!__pyx_tuple__61)) __PYX_ERR(1, 4, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__61);\n  __Pyx_GIVEREF(__pyx_tuple__61);\n\n  /* \"pywrapfst.pyx\":3090\n *   def __init__(self, _MutableFst ifst, int64 state):\n *     if not ifst._fst.get().ValidStateId(state):\n *       raise FstIndexError(\"State index out of range\")             # <<<<<<<<<<<<<<\n *     # Makes copy of the shared_ptr, potentially extending the FST's lifetime.\n *     self._mfst = ifst._mfst\n */\n  __pyx_tuple__62 = PyTuple_Pack(1, __pyx_kp_s_State_index_out_of_range); if (unlikely(!__pyx_tuple__62)) __PYX_ERR(0, 3090, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__62);\n  __Pyx_GIVEREF(__pyx_tuple__62);\n\n  /* \"(tree fragment)\":2\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._aiter,self._mfst cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._aiter,self._mfst cannot be converted to a Python object for pickling\")\n */\n  __pyx_tuple__63 = PyTuple_Pack(1, __pyx_kp_s_self__aiter_self__mfst_cannot_be); if (unlikely(!__pyx_tuple__63)) __PYX_ERR(1, 2, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__63);\n  __Pyx_GIVEREF(__pyx_tuple__63);\n\n  /* \"(tree fragment)\":4\n *     raise TypeError(\"self._aiter,self._mfst cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._aiter,self._mfst cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n */\n  __pyx_tuple__64 = PyTuple_Pack(1, __pyx_kp_s_self__aiter_self__mfst_cannot_be); if (unlikely(!__pyx_tuple__64)) __PYX_ERR(1, 4, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__64);\n  __Pyx_GIVEREF(__pyx_tuple__64);\n\n  /* \"(tree fragment)\":2\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._fst,self._siter cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._fst,self._siter cannot be converted to a Python object for pickling\")\n */\n  __pyx_tuple__65 = PyTuple_Pack(1, __pyx_kp_s_self__fst_self__siter_cannot_be); if (unlikely(!__pyx_tuple__65)) __PYX_ERR(1, 2, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__65);\n  __Pyx_GIVEREF(__pyx_tuple__65);\n\n  /* \"(tree fragment)\":4\n *     raise TypeError(\"self._fst,self._siter cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._fst,self._siter cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n */\n  __pyx_tuple__66 = PyTuple_Pack(1, __pyx_kp_s_self__fst_self__siter_cannot_be); if (unlikely(!__pyx_tuple__66)) __PYX_ERR(1, 4, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__66);\n  __Pyx_GIVEREF(__pyx_tuple__66);\n\n  /* \"pywrapfst.pyx\":4190\n *     self._sstrm.reset(new stringstream())\n *     if tfst.get() == NULL:\n *       raise FstOpError(\"Compilation failed\")             # <<<<<<<<<<<<<<\n *     return _init_XFst(tfst.release())\n * \n */\n  __pyx_tuple__90 = PyTuple_Pack(1, __pyx_kp_s_Compilation_failed); if (unlikely(!__pyx_tuple__90)) __PYX_ERR(0, 4190, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__90);\n  __Pyx_GIVEREF(__pyx_tuple__90);\n\n  /* \"(tree fragment)\":2\n * def __reduce_cython__(self):\n *     raise TypeError(\"no default __reduce__ due to non-trivial __cinit__\")             # <<<<<<<<<<<<<<\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"no default __reduce__ due to non-trivial __cinit__\")\n */\n  __pyx_tuple__91 = PyTuple_Pack(1, __pyx_kp_s_no_default___reduce___due_to_non); if (unlikely(!__pyx_tuple__91)) __PYX_ERR(1, 2, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__91);\n  __Pyx_GIVEREF(__pyx_tuple__91);\n\n  /* \"(tree fragment)\":4\n *     raise TypeError(\"no default __reduce__ due to non-trivial __cinit__\")\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"no default __reduce__ due to non-trivial __cinit__\")             # <<<<<<<<<<<<<<\n */\n  __pyx_tuple__92 = PyTuple_Pack(1, __pyx_kp_s_no_default___reduce___due_to_non); if (unlikely(!__pyx_tuple__92)) __PYX_ERR(1, 4, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__92);\n  __Pyx_GIVEREF(__pyx_tuple__92);\n\n  /* \"(tree fragment)\":2\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._reader cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._reader cannot be converted to a Python object for pickling\")\n */\n  __pyx_tuple__93 = PyTuple_Pack(1, __pyx_kp_s_self__reader_cannot_be_converted); if (unlikely(!__pyx_tuple__93)) __PYX_ERR(1, 2, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__93);\n  __Pyx_GIVEREF(__pyx_tuple__93);\n\n  /* \"(tree fragment)\":4\n *     raise TypeError(\"self._reader cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._reader cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n */\n  __pyx_tuple__94 = PyTuple_Pack(1, __pyx_kp_s_self__reader_cannot_be_converted); if (unlikely(!__pyx_tuple__94)) __PYX_ERR(1, 4, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__94);\n  __Pyx_GIVEREF(__pyx_tuple__94);\n\n  /* \"pywrapfst.pyx\":4444\n *     # used by the FAR was initialized to use.\n *     if not self._writer.get().Add(tostring(key), deref(ifst._fst)):\n *       raise FstOpError(\"Incompatible or invalid arc type\")             # <<<<<<<<<<<<<<\n *     # An error here usually indicates a key out of order.\n *     if self._writer.get().Error():\n */\n  __pyx_tuple__95 = PyTuple_Pack(1, __pyx_kp_s_Incompatible_or_invalid_arc_type); if (unlikely(!__pyx_tuple__95)) __PYX_ERR(0, 4444, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__95);\n  __Pyx_GIVEREF(__pyx_tuple__95);\n\n  /* \"pywrapfst.pyx\":4447\n *     # An error here usually indicates a key out of order.\n *     if self._writer.get().Error():\n *       raise FstArgError(\"Key out of order\")             # <<<<<<<<<<<<<<\n * \n *   cpdef string arc_type(self):\n */\n  __pyx_tuple__96 = PyTuple_Pack(1, __pyx_kp_s_Key_out_of_order); if (unlikely(!__pyx_tuple__96)) __PYX_ERR(0, 4447, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__96);\n  __Pyx_GIVEREF(__pyx_tuple__96);\n\n  /* \"(tree fragment)\":2\n * def __reduce_cython__(self):\n *     raise TypeError(\"self._writer cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._writer cannot be converted to a Python object for pickling\")\n */\n  __pyx_tuple__97 = PyTuple_Pack(1, __pyx_kp_s_self__writer_cannot_be_converted); if (unlikely(!__pyx_tuple__97)) __PYX_ERR(1, 2, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__97);\n  __Pyx_GIVEREF(__pyx_tuple__97);\n\n  /* \"(tree fragment)\":4\n *     raise TypeError(\"self._writer cannot be converted to a Python object for pickling\")\n * def __setstate_cython__(self, __pyx_state):\n *     raise TypeError(\"self._writer cannot be converted to a Python object for pickling\")             # <<<<<<<<<<<<<<\n */\n  __pyx_tuple__98 = PyTuple_Pack(1, __pyx_kp_s_self__writer_cannot_be_converted); if (unlikely(!__pyx_tuple__98)) __PYX_ERR(1, 4, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__98);\n  __Pyx_GIVEREF(__pyx_tuple__98);\n\n  /* \"pywrapfst.pyx\":456\n * \n * \n * def plus(Weight lhs, Weight rhs):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   plus(lhs, rhs)\n */\n  __pyx_tuple__99 = PyTuple_Pack(3, __pyx_n_s_lhs, __pyx_n_s_rhs, __pyx_n_s_result); if (unlikely(!__pyx_tuple__99)) __PYX_ERR(0, 456, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__99);\n  __Pyx_GIVEREF(__pyx_tuple__99);\n  __pyx_codeobj__100 = (PyObject*)__Pyx_PyCode_New(2, 0, 3, 0, CO_OPTIMIZED|CO_NEWLOCALS, __pyx_empty_bytes, __pyx_empty_tuple, __pyx_empty_tuple, __pyx_tuple__99, __pyx_empty_tuple, __pyx_empty_tuple, __pyx_kp_s_pywrapfst_pyx, __pyx_n_s_plus, 456, __pyx_empty_bytes); if (unlikely(!__pyx_codeobj__100)) __PYX_ERR(0, 456, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":488\n * \n * \n * def times(Weight lhs, Weight rhs):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   times(lhs, rhs)\n */\n  __pyx_tuple__101 = PyTuple_Pack(3, __pyx_n_s_lhs, __pyx_n_s_rhs, __pyx_n_s_result); if (unlikely(!__pyx_tuple__101)) __PYX_ERR(0, 488, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__101);\n  __Pyx_GIVEREF(__pyx_tuple__101);\n  __pyx_codeobj__102 = (PyObject*)__Pyx_PyCode_New(2, 0, 3, 0, CO_OPTIMIZED|CO_NEWLOCALS, __pyx_empty_bytes, __pyx_empty_tuple, __pyx_empty_tuple, __pyx_tuple__101, __pyx_empty_tuple, __pyx_empty_tuple, __pyx_kp_s_pywrapfst_pyx, __pyx_n_s_times, 488, __pyx_empty_bytes); if (unlikely(!__pyx_codeobj__102)) __PYX_ERR(0, 488, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":520\n * \n * \n * def divide(Weight lhs, Weight rhs):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   divide(lhs, rhs)\n */\n  __pyx_tuple__103 = PyTuple_Pack(3, __pyx_n_s_lhs, __pyx_n_s_rhs, __pyx_n_s_result); if (unlikely(!__pyx_tuple__103)) __PYX_ERR(0, 520, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__103);\n  __Pyx_GIVEREF(__pyx_tuple__103);\n  __pyx_codeobj__104 = (PyObject*)__Pyx_PyCode_New(2, 0, 3, 0, CO_OPTIMIZED|CO_NEWLOCALS, __pyx_empty_bytes, __pyx_empty_tuple, __pyx_empty_tuple, __pyx_tuple__103, __pyx_empty_tuple, __pyx_empty_tuple, __pyx_kp_s_pywrapfst_pyx, __pyx_n_s_divide, 520, __pyx_empty_bytes); if (unlikely(!__pyx_codeobj__104)) __PYX_ERR(0, 520, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":553\n * \n * \n * def power(Weight w, size_t n):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   power(lhs, rhs)\n */\n  __pyx_tuple__105 = PyTuple_Pack(3, __pyx_n_s_w, __pyx_n_s_n, __pyx_n_s_result); if (unlikely(!__pyx_tuple__105)) __PYX_ERR(0, 553, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__105);\n  __Pyx_GIVEREF(__pyx_tuple__105);\n  __pyx_codeobj__106 = (PyObject*)__Pyx_PyCode_New(2, 0, 3, 0, CO_OPTIMIZED|CO_NEWLOCALS, __pyx_empty_bytes, __pyx_empty_tuple, __pyx_empty_tuple, __pyx_tuple__105, __pyx_empty_tuple, __pyx_empty_tuple, __pyx_kp_s_pywrapfst_pyx, __pyx_n_s_power, 553, __pyx_empty_bytes); if (unlikely(!__pyx_codeobj__106)) __PYX_ERR(0, 553, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":2742\n * \n * \n * class Fst(object):             # <<<<<<<<<<<<<<\n * \n *    \"\"\"\n */\n  __pyx_tuple__107 = PyTuple_Pack(1, __pyx_builtin_object); if (unlikely(!__pyx_tuple__107)) __PYX_ERR(0, 2742, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__107);\n  __Pyx_GIVEREF(__pyx_tuple__107);\n\n  /* \"pywrapfst.pyx\":2759\n *    \"\"\"\n * \n *    def __new__(cls, arc_type=b\"standard\"):             # <<<<<<<<<<<<<<\n *     return _create_Fst(arc_type)\n * \n */\n  __pyx_tuple__108 = PyTuple_Pack(2, __pyx_n_s_cls, __pyx_n_s_arc_type); if (unlikely(!__pyx_tuple__108)) __PYX_ERR(0, 2759, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__108);\n  __Pyx_GIVEREF(__pyx_tuple__108);\n  __pyx_codeobj__109 = (PyObject*)__Pyx_PyCode_New(2, 0, 2, 0, CO_OPTIMIZED|CO_NEWLOCALS, __pyx_empty_bytes, __pyx_empty_tuple, __pyx_empty_tuple, __pyx_tuple__108, __pyx_empty_tuple, __pyx_empty_tuple, __pyx_kp_s_pywrapfst_pyx, __pyx_n_s_new, 2759, __pyx_empty_bytes); if (unlikely(!__pyx_codeobj__109)) __PYX_ERR(0, 2759, __pyx_L1_error)\n  __pyx_tuple__110 = PyTuple_Pack(1, ((PyObject*)__pyx_n_b_standard)); if (unlikely(!__pyx_tuple__110)) __PYX_ERR(0, 2759, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__110);\n  __Pyx_GIVEREF(__pyx_tuple__110);\n\n  /* \"pywrapfst.pyx\":2763\n * \n *    @staticmethod\n *    def read(filename):             # <<<<<<<<<<<<<<\n *      \"\"\"\n *      read(filename):\n */\n  __pyx_tuple__111 = PyTuple_Pack(1, __pyx_n_s_filename); if (unlikely(!__pyx_tuple__111)) __PYX_ERR(0, 2763, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__111);\n  __Pyx_GIVEREF(__pyx_tuple__111);\n  __pyx_codeobj__112 = (PyObject*)__Pyx_PyCode_New(1, 0, 1, 0, CO_OPTIMIZED|CO_NEWLOCALS, __pyx_empty_bytes, __pyx_empty_tuple, __pyx_empty_tuple, __pyx_tuple__111, __pyx_empty_tuple, __pyx_empty_tuple, __pyx_kp_s_pywrapfst_pyx, __pyx_n_s_read, 2763, __pyx_empty_bytes); if (unlikely(!__pyx_codeobj__112)) __PYX_ERR(0, 2763, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":2781\n * \n *    @staticmethod\n *    def read_from_string(state):             # <<<<<<<<<<<<<<\n *      \"\"\"\n *      read_from_string(string, fst_type=None)\n */\n  __pyx_tuple__113 = PyTuple_Pack(1, __pyx_n_s_state); if (unlikely(!__pyx_tuple__113)) __PYX_ERR(0, 2781, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__113);\n  __Pyx_GIVEREF(__pyx_tuple__113);\n  __pyx_codeobj__114 = (PyObject*)__Pyx_PyCode_New(1, 0, 1, 0, CO_OPTIMIZED|CO_NEWLOCALS, __pyx_empty_bytes, __pyx_empty_tuple, __pyx_empty_tuple, __pyx_tuple__113, __pyx_empty_tuple, __pyx_empty_tuple, __pyx_kp_s_pywrapfst_pyx, __pyx_n_s_read_from_string_2, 2781, __pyx_empty_bytes); if (unlikely(!__pyx_codeobj__114)) __PYX_ERR(0, 2781, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":3949\n * \n * \n * def shortestdistance(_Fst ifst,             # <<<<<<<<<<<<<<\n *                      float delta=fst.kShortestDelta,\n *                      int64 nstate=fst.kNoStateId,\n */\n  __pyx_tuple__115 = PyTuple_Pack(8, __pyx_n_s_ifst, __pyx_n_s_delta, __pyx_n_s_nstate, __pyx_n_s_queue_type, __pyx_n_s_reverse, __pyx_n_s_distance, __pyx_n_s_weight_type, __pyx_n_s_weight); if (unlikely(!__pyx_tuple__115)) __PYX_ERR(0, 3949, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_tuple__115);\n  __Pyx_GIVEREF(__pyx_tuple__115);\n  __pyx_codeobj__116 = (PyObject*)__Pyx_PyCode_New(5, 0, 8, 0, CO_OPTIMIZED|CO_NEWLOCALS, __pyx_empty_bytes, __pyx_empty_tuple, __pyx_empty_tuple, __pyx_tuple__115, __pyx_empty_tuple, __pyx_empty_tuple, __pyx_kp_s_pywrapfst_pyx, __pyx_n_s_shortestdistance, 3949, __pyx_empty_bytes); if (unlikely(!__pyx_codeobj__116)) __PYX_ERR(0, 3949, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":4493\n * \n * @atexit.register\n * def _reset_fst_error_fatal():             # <<<<<<<<<<<<<<\n *   fst.FLAGS_fst_error_fatal = _fst_error_fatal_old\n * \n */\n  __pyx_codeobj__117 = (PyObject*)__Pyx_PyCode_New(0, 0, 0, 0, CO_OPTIMIZED|CO_NEWLOCALS, __pyx_empty_bytes, __pyx_empty_tuple, __pyx_empty_tuple, __pyx_empty_tuple, __pyx_empty_tuple, __pyx_empty_tuple, __pyx_kp_s_pywrapfst_pyx, __pyx_n_s_reset_fst_error_fatal, 4493, __pyx_empty_bytes); if (unlikely(!__pyx_codeobj__117)) __PYX_ERR(0, 4493, __pyx_L1_error)\n  __Pyx_RefNannyFinishContext();\n  return 0;\n  __pyx_L1_error:;\n  __Pyx_RefNannyFinishContext();\n  return -1;\n}\n\nstatic int __Pyx_InitGlobals(void) {\n  if (__Pyx_InitStrings(__pyx_string_tab) < 0) __PYX_ERR(0, 1, __pyx_L1_error);\n  __pyx_int_0 = PyInt_FromLong(0); if (unlikely(!__pyx_int_0)) __PYX_ERR(0, 1, __pyx_L1_error)\n  __pyx_int_neg_1 = PyInt_FromLong(-1); if (unlikely(!__pyx_int_neg_1)) __PYX_ERR(0, 1, __pyx_L1_error)\n  return 0;\n  __pyx_L1_error:;\n  return -1;\n}\n\nstatic int __Pyx_modinit_global_init_code(void); /*proto*/\nstatic int __Pyx_modinit_variable_export_code(void); /*proto*/\nstatic int __Pyx_modinit_function_export_code(void); /*proto*/\nstatic int __Pyx_modinit_type_init_code(void); /*proto*/\nstatic int __Pyx_modinit_type_import_code(void); /*proto*/\nstatic int __Pyx_modinit_variable_import_code(void); /*proto*/\nstatic int __Pyx_modinit_function_import_code(void); /*proto*/\n\nstatic int __Pyx_modinit_global_init_code(void) {\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__Pyx_modinit_global_init_code\", 0);\n  /*--- Global init code ---*/\n  __Pyx_RefNannyFinishContext();\n  return 0;\n}\n\nstatic int __Pyx_modinit_variable_export_code(void) {\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__Pyx_modinit_variable_export_code\", 0);\n  /*--- Variable export code ---*/\n  __Pyx_RefNannyFinishContext();\n  return 0;\n}\n\nstatic int __Pyx_modinit_function_export_code(void) {\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__Pyx_modinit_function_export_code\", 0);\n  /*--- Function export code ---*/\n  if (__Pyx_ExportFunction(\"tostring\", (void (*)(void))__pyx_f_9pywrapfst_tostring, \"std::string (PyObject *, struct __pyx_opt_args_9pywrapfst_tostring *__pyx_optional_args)\") < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  if (__Pyx_ExportFunction(\"weight_tostring\", (void (*)(void))__pyx_f_9pywrapfst_weight_tostring, \"std::string (PyObject *, struct __pyx_opt_args_9pywrapfst_weight_tostring *__pyx_optional_args)\") < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  if (__Pyx_ExportFunction(\"_get_compose_filter\", (void (*)(void))__pyx_f_9pywrapfst__get_compose_filter, \"enum fst::ComposeFilter (std::string const &)\") < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  if (__Pyx_ExportFunction(\"_get_determinize_type\", (void (*)(void))__pyx_f_9pywrapfst__get_determinize_type, \"enum fst::DeterminizeType (std::string const &)\") < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  if (__Pyx_ExportFunction(\"_get_queue_type\", (void (*)(void))__pyx_f_9pywrapfst__get_queue_type, \"enum fst::QueueType (std::string const &)\") < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  if (__Pyx_ExportFunction(\"_get_rand_arc_selection\", (void (*)(void))__pyx_f_9pywrapfst__get_rand_arc_selection, \"enum fst::script::RandArcSelection (std::string const &)\") < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  if (__Pyx_ExportFunction(\"_get_replace_label_type\", (void (*)(void))__pyx_f_9pywrapfst__get_replace_label_type, \"enum fst::ReplaceLabelType (std::string const &, bool)\") < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  if (__Pyx_ExportFunction(\"_get_WeightClass_or_One\", (void (*)(void))__pyx_f_9pywrapfst__get_WeightClass_or_One, \"fst::script::WeightClass (std::string const &, PyObject *)\") < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  if (__Pyx_ExportFunction(\"_get_WeightClass_or_Zero\", (void (*)(void))__pyx_f_9pywrapfst__get_WeightClass_or_Zero, \"fst::script::WeightClass (std::string const &, PyObject *)\") < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  if (__Pyx_ExportFunction(\"_Zero\", (void (*)(void))__pyx_f_9pywrapfst__Zero, \"struct __pyx_obj_9pywrapfst_Weight *(PyObject *)\") < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  if (__Pyx_ExportFunction(\"_One\", (void (*)(void))__pyx_f_9pywrapfst__One, \"struct __pyx_obj_9pywrapfst_Weight *(PyObject *)\") < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  if (__Pyx_ExportFunction(\"_NoWeight\", (void (*)(void))__pyx_f_9pywrapfst__NoWeight, \"struct __pyx_obj_9pywrapfst_Weight *(PyObject *)\") < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  if (__Pyx_ExportFunction(\"_plus\", (void (*)(void))__pyx_f_9pywrapfst__plus, \"struct __pyx_obj_9pywrapfst_Weight *(struct __pyx_obj_9pywrapfst_Weight *, struct __pyx_obj_9pywrapfst_Weight *)\") < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  if (__Pyx_ExportFunction(\"_times\", (void (*)(void))__pyx_f_9pywrapfst__times, \"struct __pyx_obj_9pywrapfst_Weight *(struct __pyx_obj_9pywrapfst_Weight *, struct __pyx_obj_9pywrapfst_Weight *)\") < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  if (__Pyx_ExportFunction(\"_divide\", (void (*)(void))__pyx_f_9pywrapfst__divide, \"struct __pyx_obj_9pywrapfst_Weight *(struct __pyx_obj_9pywrapfst_Weight *, struct __pyx_obj_9pywrapfst_Weight *)\") < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  if (__Pyx_ExportFunction(\"_power\", (void (*)(void))__pyx_f_9pywrapfst__power, \"struct __pyx_obj_9pywrapfst_Weight *(struct __pyx_obj_9pywrapfst_Weight *, size_t)\") < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  if (__Pyx_ExportFunction(\"_init_EncodeMapperSymbolTable\", (void (*)(void))__pyx_f_9pywrapfst__init_EncodeMapperSymbolTable, \"struct __pyx_obj_9pywrapfst__EncodeMapperSymbolTable *(fst::SymbolTable *, std::shared_ptr<fst::script::EncodeMapperClass> )\") < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  if (__Pyx_ExportFunction(\"_init_FstSymbolTable\", (void (*)(void))__pyx_f_9pywrapfst__init_FstSymbolTable, \"struct __pyx_obj_9pywrapfst__FstSymbolTable *(fst::SymbolTable *, std::shared_ptr<fst::script::FstClass> )\") < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  if (__Pyx_ExportFunction(\"_init_MutableFstSymbolTable\", (void (*)(void))__pyx_f_9pywrapfst__init_MutableFstSymbolTable, \"struct __pyx_obj_9pywrapfst__MutableFstSymbolTable *(fst::SymbolTable *, std::shared_ptr<fst::script::MutableFstClass> )\") < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  if (__Pyx_ExportFunction(\"_init_SymbolTable\", (void (*)(void))__pyx_f_9pywrapfst__init_SymbolTable, \"struct __pyx_obj_9pywrapfst_SymbolTable *(fst::SymbolTable *)\") < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  if (__Pyx_ExportFunction(\"_init_Fst\", (void (*)(void))__pyx_f_9pywrapfst__init_Fst, \"struct __pyx_obj_9pywrapfst__Fst *(__pyx_t_9pywrapfst_FstClass_ptr)\") < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  if (__Pyx_ExportFunction(\"_init_MutableFst\", (void (*)(void))__pyx_f_9pywrapfst__init_MutableFst, \"struct __pyx_obj_9pywrapfst__MutableFst *(__pyx_t_9pywrapfst_MutableFstClass_ptr)\") < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  if (__Pyx_ExportFunction(\"_init_XFst\", (void (*)(void))__pyx_f_9pywrapfst__init_XFst, \"struct __pyx_obj_9pywrapfst__Fst *(__pyx_t_9pywrapfst_FstClass_ptr)\") < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  if (__Pyx_ExportFunction(\"_create_Fst\", (void (*)(void))__pyx_f_9pywrapfst__create_Fst, \"struct __pyx_obj_9pywrapfst__MutableFst *(struct __pyx_opt_args_9pywrapfst__create_Fst *__pyx_optional_args)\") < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  if (__Pyx_ExportFunction(\"_read\", (void (*)(void))__pyx_f_9pywrapfst__read, \"struct __pyx_obj_9pywrapfst__Fst *(PyObject *, int __pyx_skip_dispatch)\") < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  if (__Pyx_ExportFunction(\"_read_from_string\", (void (*)(void))__pyx_f_9pywrapfst__read_from_string, \"struct __pyx_obj_9pywrapfst__Fst *(PyObject *, int __pyx_skip_dispatch)\") < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  if (__Pyx_ExportFunction(\"_init_Arc\", (void (*)(void))__pyx_f_9pywrapfst__init_Arc, \"struct __pyx_obj_9pywrapfst_Arc *(fst::script::ArcClass const &)\") < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  if (__Pyx_ExportFunction(\"_map\", (void (*)(void))__pyx_f_9pywrapfst__map, \"struct __pyx_obj_9pywrapfst__Fst *(struct __pyx_obj_9pywrapfst__Fst *, struct __pyx_opt_args_9pywrapfst__map *__pyx_optional_args)\") < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  if (__Pyx_ExportFunction(\"arcmap\", (void (*)(void))__pyx_f_9pywrapfst_arcmap, \"struct __pyx_obj_9pywrapfst__Fst *(struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_arcmap *__pyx_optional_args)\") < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  if (__Pyx_ExportFunction(\"compose\", (void (*)(void))__pyx_f_9pywrapfst_compose, \"struct __pyx_obj_9pywrapfst__MutableFst *(struct __pyx_obj_9pywrapfst__Fst *, struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_compose *__pyx_optional_args)\") < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  if (__Pyx_ExportFunction(\"convert\", (void (*)(void))__pyx_f_9pywrapfst_convert, \"struct __pyx_obj_9pywrapfst__Fst *(struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_convert *__pyx_optional_args)\") < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  if (__Pyx_ExportFunction(\"determinize\", (void (*)(void))__pyx_f_9pywrapfst_determinize, \"struct __pyx_obj_9pywrapfst__MutableFst *(struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_determinize *__pyx_optional_args)\") < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  if (__Pyx_ExportFunction(\"difference\", (void (*)(void))__pyx_f_9pywrapfst_difference, \"struct __pyx_obj_9pywrapfst__MutableFst *(struct __pyx_obj_9pywrapfst__Fst *, struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_difference *__pyx_optional_args)\") < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  if (__Pyx_ExportFunction(\"disambiguate\", (void (*)(void))__pyx_f_9pywrapfst_disambiguate, \"struct __pyx_obj_9pywrapfst__MutableFst *(struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_disambiguate *__pyx_optional_args)\") < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  if (__Pyx_ExportFunction(\"epsnormalize\", (void (*)(void))__pyx_f_9pywrapfst_epsnormalize, \"struct __pyx_obj_9pywrapfst__MutableFst *(struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_epsnormalize *__pyx_optional_args)\") < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  if (__Pyx_ExportFunction(\"equal\", (void (*)(void))__pyx_f_9pywrapfst_equal, \"bool (struct __pyx_obj_9pywrapfst__Fst *, struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_equal *__pyx_optional_args)\") < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  if (__Pyx_ExportFunction(\"equivalent\", (void (*)(void))__pyx_f_9pywrapfst_equivalent, \"bool (struct __pyx_obj_9pywrapfst__Fst *, struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_equivalent *__pyx_optional_args)\") < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  if (__Pyx_ExportFunction(\"intersect\", (void (*)(void))__pyx_f_9pywrapfst_intersect, \"struct __pyx_obj_9pywrapfst__MutableFst *(struct __pyx_obj_9pywrapfst__Fst *, struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_intersect *__pyx_optional_args)\") < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  if (__Pyx_ExportFunction(\"isomorphic\", (void (*)(void))__pyx_f_9pywrapfst_isomorphic, \"bool (struct __pyx_obj_9pywrapfst__Fst *, struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_isomorphic *__pyx_optional_args)\") < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  if (__Pyx_ExportFunction(\"prune\", (void (*)(void))__pyx_f_9pywrapfst_prune, \"struct __pyx_obj_9pywrapfst__MutableFst *(struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_prune *__pyx_optional_args)\") < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  if (__Pyx_ExportFunction(\"push\", (void (*)(void))__pyx_f_9pywrapfst_push, \"struct __pyx_obj_9pywrapfst__MutableFst *(struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_push *__pyx_optional_args)\") < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  if (__Pyx_ExportFunction(\"randequivalent\", (void (*)(void))__pyx_f_9pywrapfst_randequivalent, \"bool (struct __pyx_obj_9pywrapfst__Fst *, struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_randequivalent *__pyx_optional_args)\") < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  if (__Pyx_ExportFunction(\"randgen\", (void (*)(void))__pyx_f_9pywrapfst_randgen, \"struct __pyx_obj_9pywrapfst__MutableFst *(struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_randgen *__pyx_optional_args)\") < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  if (__Pyx_ExportFunction(\"replace\", (void (*)(void))__pyx_f_9pywrapfst_replace, \"struct __pyx_obj_9pywrapfst__MutableFst *(PyObject *, int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_replace *__pyx_optional_args)\") < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  if (__Pyx_ExportFunction(\"reverse\", (void (*)(void))__pyx_f_9pywrapfst_reverse, \"struct __pyx_obj_9pywrapfst__MutableFst *(struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_reverse *__pyx_optional_args)\") < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  if (__Pyx_ExportFunction(\"_shortestdistance\", (void (*)(void))__pyx_f_9pywrapfst__shortestdistance, \"std::vector<fst::script::WeightClass>  *(struct __pyx_obj_9pywrapfst__Fst *, struct __pyx_opt_args_9pywrapfst__shortestdistance *__pyx_optional_args)\") < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  if (__Pyx_ExportFunction(\"shortestpath\", (void (*)(void))__pyx_f_9pywrapfst_shortestpath, \"struct __pyx_obj_9pywrapfst__MutableFst *(struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_shortestpath *__pyx_optional_args)\") < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  if (__Pyx_ExportFunction(\"statemap\", (void (*)(void))__pyx_f_9pywrapfst_statemap, \"struct __pyx_obj_9pywrapfst__Fst *(struct __pyx_obj_9pywrapfst__Fst *, PyObject *, int __pyx_skip_dispatch)\") < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  if (__Pyx_ExportFunction(\"synchronize\", (void (*)(void))__pyx_f_9pywrapfst_synchronize, \"struct __pyx_obj_9pywrapfst__MutableFst *(struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch)\") < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  __Pyx_RefNannyFinishContext();\n  return 0;\n  __pyx_L1_error:;\n  __Pyx_RefNannyFinishContext();\n  return -1;\n}\n\nstatic int __Pyx_modinit_type_init_code(void) {\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__Pyx_modinit_type_init_code\", 0);\n  /*--- Type init code ---*/\n  __pyx_vtabptr_9pywrapfst_Weight = &__pyx_vtable_9pywrapfst_Weight;\n  __pyx_vtable_9pywrapfst_Weight._check_weight = (void (*)(struct __pyx_obj_9pywrapfst_Weight *))__pyx_f_9pywrapfst_6Weight__check_weight;\n  __pyx_vtable_9pywrapfst_Weight.copy = (struct __pyx_obj_9pywrapfst_Weight *(*)(struct __pyx_obj_9pywrapfst_Weight *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_6Weight_copy;\n  __pyx_vtable_9pywrapfst_Weight.to_string = (std::string (*)(struct __pyx_obj_9pywrapfst_Weight *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_6Weight_to_string;\n  __pyx_vtable_9pywrapfst_Weight.type = (std::string (*)(struct __pyx_obj_9pywrapfst_Weight *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_6Weight_type;\n  if (PyType_Ready(&__pyx_type_9pywrapfst_Weight) < 0) __PYX_ERR(0, 348, __pyx_L1_error)\n  __pyx_type_9pywrapfst_Weight.tp_print = 0;\n  if ((CYTHON_USE_TYPE_SLOTS && CYTHON_USE_PYTYPE_LOOKUP) && likely(!__pyx_type_9pywrapfst_Weight.tp_dictoffset && __pyx_type_9pywrapfst_Weight.tp_getattro == PyObject_GenericGetAttr)) {\n    __pyx_type_9pywrapfst_Weight.tp_getattro = __Pyx_PyObject_GenericGetAttr;\n  }\n  if (__Pyx_SetVtable(__pyx_type_9pywrapfst_Weight.tp_dict, __pyx_vtabptr_9pywrapfst_Weight) < 0) __PYX_ERR(0, 348, __pyx_L1_error)\n  if (PyObject_SetAttrString(__pyx_m, \"Weight\", (PyObject *)&__pyx_type_9pywrapfst_Weight) < 0) __PYX_ERR(0, 348, __pyx_L1_error)\n  if (__Pyx_setup_reduce((PyObject*)&__pyx_type_9pywrapfst_Weight) < 0) __PYX_ERR(0, 348, __pyx_L1_error)\n  __pyx_ptype_9pywrapfst_Weight = &__pyx_type_9pywrapfst_Weight;\n  __pyx_vtabptr_9pywrapfst__SymbolTable = &__pyx_vtable_9pywrapfst__SymbolTable;\n  __pyx_vtable_9pywrapfst__SymbolTable.available_key = (__pyx_t_10basictypes_int64 (*)(struct __pyx_obj_9pywrapfst__SymbolTable *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_12_SymbolTable_available_key;\n  __pyx_vtable_9pywrapfst__SymbolTable.checksum = (std::string (*)(struct __pyx_obj_9pywrapfst__SymbolTable *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_12_SymbolTable_checksum;\n  __pyx_vtable_9pywrapfst__SymbolTable.copy = (struct __pyx_obj_9pywrapfst_SymbolTable *(*)(struct __pyx_obj_9pywrapfst__SymbolTable *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_12_SymbolTable_copy;\n  __pyx_vtable_9pywrapfst__SymbolTable.get_nth_key = (__pyx_t_10basictypes_int64 (*)(struct __pyx_obj_9pywrapfst__SymbolTable *, Py_ssize_t, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_12_SymbolTable_get_nth_key;\n  __pyx_vtable_9pywrapfst__SymbolTable.labeled_checksum = (std::string (*)(struct __pyx_obj_9pywrapfst__SymbolTable *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_12_SymbolTable_labeled_checksum;\n  __pyx_vtable_9pywrapfst__SymbolTable.member = (bool (*)(struct __pyx_obj_9pywrapfst__SymbolTable *, PyObject *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_12_SymbolTable_member;\n  __pyx_vtable_9pywrapfst__SymbolTable.name = (std::string (*)(struct __pyx_obj_9pywrapfst__SymbolTable *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_12_SymbolTable_name;\n  __pyx_vtable_9pywrapfst__SymbolTable.num_symbols = (size_t (*)(struct __pyx_obj_9pywrapfst__SymbolTable *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_12_SymbolTable_num_symbols;\n  __pyx_vtable_9pywrapfst__SymbolTable.write = (void (*)(struct __pyx_obj_9pywrapfst__SymbolTable *, PyObject *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_12_SymbolTable_write;\n  __pyx_vtable_9pywrapfst__SymbolTable.write_text = (void (*)(struct __pyx_obj_9pywrapfst__SymbolTable *, PyObject *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_12_SymbolTable_write_text;\n  if (PyType_Ready(&__pyx_type_9pywrapfst__SymbolTable) < 0) __PYX_ERR(0, 675, __pyx_L1_error)\n  __pyx_type_9pywrapfst__SymbolTable.tp_print = 0;\n  if ((CYTHON_USE_TYPE_SLOTS && CYTHON_USE_PYTYPE_LOOKUP) && likely(!__pyx_type_9pywrapfst__SymbolTable.tp_dictoffset && __pyx_type_9pywrapfst__SymbolTable.tp_getattro == PyObject_GenericGetAttr)) {\n    __pyx_type_9pywrapfst__SymbolTable.tp_getattro = __Pyx_PyObject_GenericGetAttr;\n  }\n  if (__Pyx_SetVtable(__pyx_type_9pywrapfst__SymbolTable.tp_dict, __pyx_vtabptr_9pywrapfst__SymbolTable) < 0) __PYX_ERR(0, 675, __pyx_L1_error)\n  if (PyObject_SetAttrString(__pyx_m, \"_SymbolTable\", (PyObject *)&__pyx_type_9pywrapfst__SymbolTable) < 0) __PYX_ERR(0, 675, __pyx_L1_error)\n  if (__Pyx_setup_reduce((PyObject*)&__pyx_type_9pywrapfst__SymbolTable) < 0) __PYX_ERR(0, 675, __pyx_L1_error)\n  __pyx_ptype_9pywrapfst__SymbolTable = &__pyx_type_9pywrapfst__SymbolTable;\n  __pyx_vtabptr_9pywrapfst__EncodeMapperSymbolTable = &__pyx_vtable_9pywrapfst__EncodeMapperSymbolTable;\n  __pyx_vtable_9pywrapfst__EncodeMapperSymbolTable.__pyx_base = *__pyx_vtabptr_9pywrapfst__SymbolTable;\n  __pyx_type_9pywrapfst__EncodeMapperSymbolTable.tp_base = __pyx_ptype_9pywrapfst__SymbolTable;\n  if (PyType_Ready(&__pyx_type_9pywrapfst__EncodeMapperSymbolTable) < 0) __PYX_ERR(0, 839, __pyx_L1_error)\n  __pyx_type_9pywrapfst__EncodeMapperSymbolTable.tp_print = 0;\n  if ((CYTHON_USE_TYPE_SLOTS && CYTHON_USE_PYTYPE_LOOKUP) && likely(!__pyx_type_9pywrapfst__EncodeMapperSymbolTable.tp_dictoffset && __pyx_type_9pywrapfst__EncodeMapperSymbolTable.tp_getattro == PyObject_GenericGetAttr)) {\n    __pyx_type_9pywrapfst__EncodeMapperSymbolTable.tp_getattro = __Pyx_PyObject_GenericGetAttr;\n  }\n  if (__Pyx_SetVtable(__pyx_type_9pywrapfst__EncodeMapperSymbolTable.tp_dict, __pyx_vtabptr_9pywrapfst__EncodeMapperSymbolTable) < 0) __PYX_ERR(0, 839, __pyx_L1_error)\n  if (PyObject_SetAttrString(__pyx_m, \"_EncodeMapperSymbolTable\", (PyObject *)&__pyx_type_9pywrapfst__EncodeMapperSymbolTable) < 0) __PYX_ERR(0, 839, __pyx_L1_error)\n  if (__Pyx_setup_reduce((PyObject*)&__pyx_type_9pywrapfst__EncodeMapperSymbolTable) < 0) __PYX_ERR(0, 839, __pyx_L1_error)\n  __pyx_ptype_9pywrapfst__EncodeMapperSymbolTable = &__pyx_type_9pywrapfst__EncodeMapperSymbolTable;\n  __pyx_vtabptr_9pywrapfst__FstSymbolTable = &__pyx_vtable_9pywrapfst__FstSymbolTable;\n  __pyx_vtable_9pywrapfst__FstSymbolTable.__pyx_base = *__pyx_vtabptr_9pywrapfst__SymbolTable;\n  __pyx_type_9pywrapfst__FstSymbolTable.tp_base = __pyx_ptype_9pywrapfst__SymbolTable;\n  if (PyType_Ready(&__pyx_type_9pywrapfst__FstSymbolTable) < 0) __PYX_ERR(0, 859, __pyx_L1_error)\n  __pyx_type_9pywrapfst__FstSymbolTable.tp_print = 0;\n  if ((CYTHON_USE_TYPE_SLOTS && CYTHON_USE_PYTYPE_LOOKUP) && likely(!__pyx_type_9pywrapfst__FstSymbolTable.tp_dictoffset && __pyx_type_9pywrapfst__FstSymbolTable.tp_getattro == PyObject_GenericGetAttr)) {\n    __pyx_type_9pywrapfst__FstSymbolTable.tp_getattro = __Pyx_PyObject_GenericGetAttr;\n  }\n  if (__Pyx_SetVtable(__pyx_type_9pywrapfst__FstSymbolTable.tp_dict, __pyx_vtabptr_9pywrapfst__FstSymbolTable) < 0) __PYX_ERR(0, 859, __pyx_L1_error)\n  if (PyObject_SetAttrString(__pyx_m, \"_FstSymbolTable\", (PyObject *)&__pyx_type_9pywrapfst__FstSymbolTable) < 0) __PYX_ERR(0, 859, __pyx_L1_error)\n  if (__Pyx_setup_reduce((PyObject*)&__pyx_type_9pywrapfst__FstSymbolTable) < 0) __PYX_ERR(0, 859, __pyx_L1_error)\n  __pyx_ptype_9pywrapfst__FstSymbolTable = &__pyx_type_9pywrapfst__FstSymbolTable;\n  __pyx_vtabptr_9pywrapfst__MutableSymbolTable = &__pyx_vtable_9pywrapfst__MutableSymbolTable;\n  __pyx_vtable_9pywrapfst__MutableSymbolTable.__pyx_base = *__pyx_vtabptr_9pywrapfst__SymbolTable;\n  __pyx_vtable_9pywrapfst__MutableSymbolTable.add_symbol = (__pyx_t_10basictypes_int64 (*)(struct __pyx_obj_9pywrapfst__MutableSymbolTable *, PyObject *, int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_19_MutableSymbolTable_add_symbol *__pyx_optional_args))__pyx_f_9pywrapfst_19_MutableSymbolTable_add_symbol;\n  __pyx_vtable_9pywrapfst__MutableSymbolTable.add_table = (void (*)(struct __pyx_obj_9pywrapfst__MutableSymbolTable *, struct __pyx_obj_9pywrapfst__SymbolTable *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_19_MutableSymbolTable_add_table;\n  __pyx_vtable_9pywrapfst__MutableSymbolTable.set_name = (void (*)(struct __pyx_obj_9pywrapfst__MutableSymbolTable *, PyObject *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_19_MutableSymbolTable_set_name;\n  __pyx_type_9pywrapfst__MutableSymbolTable.tp_base = __pyx_ptype_9pywrapfst__SymbolTable;\n  if (PyType_Ready(&__pyx_type_9pywrapfst__MutableSymbolTable) < 0) __PYX_ERR(0, 878, __pyx_L1_error)\n  __pyx_type_9pywrapfst__MutableSymbolTable.tp_print = 0;\n  if ((CYTHON_USE_TYPE_SLOTS && CYTHON_USE_PYTYPE_LOOKUP) && likely(!__pyx_type_9pywrapfst__MutableSymbolTable.tp_dictoffset && __pyx_type_9pywrapfst__MutableSymbolTable.tp_getattro == PyObject_GenericGetAttr)) {\n    __pyx_type_9pywrapfst__MutableSymbolTable.tp_getattro = __Pyx_PyObject_GenericGetAttr;\n  }\n  if (__Pyx_SetVtable(__pyx_type_9pywrapfst__MutableSymbolTable.tp_dict, __pyx_vtabptr_9pywrapfst__MutableSymbolTable) < 0) __PYX_ERR(0, 878, __pyx_L1_error)\n  if (PyObject_SetAttrString(__pyx_m, \"_MutableSymbolTable\", (PyObject *)&__pyx_type_9pywrapfst__MutableSymbolTable) < 0) __PYX_ERR(0, 878, __pyx_L1_error)\n  if (__Pyx_setup_reduce((PyObject*)&__pyx_type_9pywrapfst__MutableSymbolTable) < 0) __PYX_ERR(0, 878, __pyx_L1_error)\n  __pyx_ptype_9pywrapfst__MutableSymbolTable = &__pyx_type_9pywrapfst__MutableSymbolTable;\n  __pyx_vtabptr_9pywrapfst__MutableFstSymbolTable = &__pyx_vtable_9pywrapfst__MutableFstSymbolTable;\n  __pyx_vtable_9pywrapfst__MutableFstSymbolTable.__pyx_base = *__pyx_vtabptr_9pywrapfst__MutableSymbolTable;\n  __pyx_type_9pywrapfst__MutableFstSymbolTable.tp_base = __pyx_ptype_9pywrapfst__MutableSymbolTable;\n  if (PyType_Ready(&__pyx_type_9pywrapfst__MutableFstSymbolTable) < 0) __PYX_ERR(0, 930, __pyx_L1_error)\n  __pyx_type_9pywrapfst__MutableFstSymbolTable.tp_print = 0;\n  if ((CYTHON_USE_TYPE_SLOTS && CYTHON_USE_PYTYPE_LOOKUP) && likely(!__pyx_type_9pywrapfst__MutableFstSymbolTable.tp_dictoffset && __pyx_type_9pywrapfst__MutableFstSymbolTable.tp_getattro == PyObject_GenericGetAttr)) {\n    __pyx_type_9pywrapfst__MutableFstSymbolTable.tp_getattro = __Pyx_PyObject_GenericGetAttr;\n  }\n  if (__Pyx_SetVtable(__pyx_type_9pywrapfst__MutableFstSymbolTable.tp_dict, __pyx_vtabptr_9pywrapfst__MutableFstSymbolTable) < 0) __PYX_ERR(0, 930, __pyx_L1_error)\n  if (PyObject_SetAttrString(__pyx_m, \"_MutableFstSymbolTable\", (PyObject *)&__pyx_type_9pywrapfst__MutableFstSymbolTable) < 0) __PYX_ERR(0, 930, __pyx_L1_error)\n  if (__Pyx_setup_reduce((PyObject*)&__pyx_type_9pywrapfst__MutableFstSymbolTable) < 0) __PYX_ERR(0, 930, __pyx_L1_error)\n  __pyx_ptype_9pywrapfst__MutableFstSymbolTable = &__pyx_type_9pywrapfst__MutableFstSymbolTable;\n  __pyx_vtabptr_9pywrapfst_SymbolTable = &__pyx_vtable_9pywrapfst_SymbolTable;\n  __pyx_vtable_9pywrapfst_SymbolTable.__pyx_base = *__pyx_vtabptr_9pywrapfst__MutableSymbolTable;\n  __pyx_type_9pywrapfst_SymbolTable.tp_base = __pyx_ptype_9pywrapfst__MutableSymbolTable;\n  if (PyType_Ready(&__pyx_type_9pywrapfst_SymbolTable) < 0) __PYX_ERR(0, 941, __pyx_L1_error)\n  __pyx_type_9pywrapfst_SymbolTable.tp_print = 0;\n  if ((CYTHON_USE_TYPE_SLOTS && CYTHON_USE_PYTYPE_LOOKUP) && likely(!__pyx_type_9pywrapfst_SymbolTable.tp_dictoffset && __pyx_type_9pywrapfst_SymbolTable.tp_getattro == PyObject_GenericGetAttr)) {\n    __pyx_type_9pywrapfst_SymbolTable.tp_getattro = __Pyx_PyObject_GenericGetAttr;\n  }\n  if (__Pyx_SetVtable(__pyx_type_9pywrapfst_SymbolTable.tp_dict, __pyx_vtabptr_9pywrapfst_SymbolTable) < 0) __PYX_ERR(0, 941, __pyx_L1_error)\n  if (PyObject_SetAttrString(__pyx_m, \"SymbolTable\", (PyObject *)&__pyx_type_9pywrapfst_SymbolTable) < 0) __PYX_ERR(0, 941, __pyx_L1_error)\n  if (__Pyx_setup_reduce((PyObject*)&__pyx_type_9pywrapfst_SymbolTable) < 0) __PYX_ERR(0, 941, __pyx_L1_error)\n  __pyx_ptype_9pywrapfst_SymbolTable = &__pyx_type_9pywrapfst_SymbolTable;\n  __pyx_vtabptr_9pywrapfst_SymbolTableIterator = &__pyx_vtable_9pywrapfst_SymbolTableIterator;\n  __pyx_vtable_9pywrapfst_SymbolTableIterator.done = (bool (*)(struct __pyx_obj_9pywrapfst_SymbolTableIterator *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_19SymbolTableIterator_done;\n  __pyx_vtable_9pywrapfst_SymbolTableIterator.next = (void (*)(struct __pyx_obj_9pywrapfst_SymbolTableIterator *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_19SymbolTableIterator_next;\n  __pyx_vtable_9pywrapfst_SymbolTableIterator.reset = (void (*)(struct __pyx_obj_9pywrapfst_SymbolTableIterator *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_19SymbolTableIterator_reset;\n  __pyx_vtable_9pywrapfst_SymbolTableIterator.symbol = (std::string (*)(struct __pyx_obj_9pywrapfst_SymbolTableIterator *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_19SymbolTableIterator_symbol;\n  __pyx_vtable_9pywrapfst_SymbolTableIterator.value = (__pyx_t_10basictypes_int64 (*)(struct __pyx_obj_9pywrapfst_SymbolTableIterator *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_19SymbolTableIterator_value;\n  if (PyType_Ready(&__pyx_type_9pywrapfst_SymbolTableIterator) < 0) __PYX_ERR(0, 1124, __pyx_L1_error)\n  __pyx_type_9pywrapfst_SymbolTableIterator.tp_print = 0;\n  if ((CYTHON_USE_TYPE_SLOTS && CYTHON_USE_PYTYPE_LOOKUP) && likely(!__pyx_type_9pywrapfst_SymbolTableIterator.tp_dictoffset && __pyx_type_9pywrapfst_SymbolTableIterator.tp_getattro == PyObject_GenericGetAttr)) {\n    __pyx_type_9pywrapfst_SymbolTableIterator.tp_getattro = __Pyx_PyObject_GenericGetAttr;\n  }\n  if (__Pyx_SetVtable(__pyx_type_9pywrapfst_SymbolTableIterator.tp_dict, __pyx_vtabptr_9pywrapfst_SymbolTableIterator) < 0) __PYX_ERR(0, 1124, __pyx_L1_error)\n  if (PyObject_SetAttrString(__pyx_m, \"SymbolTableIterator\", (PyObject *)&__pyx_type_9pywrapfst_SymbolTableIterator) < 0) __PYX_ERR(0, 1124, __pyx_L1_error)\n  if (__Pyx_setup_reduce((PyObject*)&__pyx_type_9pywrapfst_SymbolTableIterator) < 0) __PYX_ERR(0, 1124, __pyx_L1_error)\n  __pyx_ptype_9pywrapfst_SymbolTableIterator = &__pyx_type_9pywrapfst_SymbolTableIterator;\n  __pyx_vtabptr_9pywrapfst_EncodeMapper = &__pyx_vtable_9pywrapfst_EncodeMapper;\n  __pyx_vtable_9pywrapfst_EncodeMapper.arc_type = (std::string (*)(struct __pyx_obj_9pywrapfst_EncodeMapper *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_12EncodeMapper_arc_type;\n  __pyx_vtable_9pywrapfst_EncodeMapper.flags = (__pyx_t_10basictypes_uint32 (*)(struct __pyx_obj_9pywrapfst_EncodeMapper *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_12EncodeMapper_flags;\n  __pyx_vtable_9pywrapfst_EncodeMapper.input_symbols = (struct __pyx_obj_9pywrapfst__EncodeMapperSymbolTable *(*)(struct __pyx_obj_9pywrapfst_EncodeMapper *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_12EncodeMapper_input_symbols;\n  __pyx_vtable_9pywrapfst_EncodeMapper.output_symbols = (struct __pyx_obj_9pywrapfst__EncodeMapperSymbolTable *(*)(struct __pyx_obj_9pywrapfst_EncodeMapper *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_12EncodeMapper_output_symbols;\n  __pyx_vtable_9pywrapfst_EncodeMapper.properties = (__pyx_t_10basictypes_uint64 (*)(struct __pyx_obj_9pywrapfst_EncodeMapper *, __pyx_t_10basictypes_uint64, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_12EncodeMapper_properties;\n  __pyx_vtable_9pywrapfst_EncodeMapper.set_input_symbols = (void (*)(struct __pyx_obj_9pywrapfst_EncodeMapper *, struct __pyx_obj_9pywrapfst__SymbolTable *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_12EncodeMapper_set_input_symbols;\n  __pyx_vtable_9pywrapfst_EncodeMapper.set_output_symbols = (void (*)(struct __pyx_obj_9pywrapfst_EncodeMapper *, struct __pyx_obj_9pywrapfst__SymbolTable *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_12EncodeMapper_set_output_symbols;\n  __pyx_vtable_9pywrapfst_EncodeMapper.weight_type = (std::string (*)(struct __pyx_obj_9pywrapfst_EncodeMapper *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_12EncodeMapper_weight_type;\n  if (PyType_Ready(&__pyx_type_9pywrapfst_EncodeMapper) < 0) __PYX_ERR(0, 1206, __pyx_L1_error)\n  __pyx_type_9pywrapfst_EncodeMapper.tp_print = 0;\n  if ((CYTHON_USE_TYPE_SLOTS && CYTHON_USE_PYTYPE_LOOKUP) && likely(!__pyx_type_9pywrapfst_EncodeMapper.tp_dictoffset && __pyx_type_9pywrapfst_EncodeMapper.tp_getattro == PyObject_GenericGetAttr)) {\n    __pyx_type_9pywrapfst_EncodeMapper.tp_getattro = __Pyx_PyObject_GenericGetAttr;\n  }\n  #if CYTHON_COMPILING_IN_CPYTHON\n  {\n    PyObject *wrapper = PyObject_GetAttrString((PyObject *)&__pyx_type_9pywrapfst_EncodeMapper, \"__call__\"); if (unlikely(!wrapper)) __PYX_ERR(0, 1206, __pyx_L1_error)\n    if (Py_TYPE(wrapper) == &PyWrapperDescr_Type) {\n      __pyx_wrapperbase_9pywrapfst_12EncodeMapper_6__call__ = *((PyWrapperDescrObject *)wrapper)->d_base;\n      __pyx_wrapperbase_9pywrapfst_12EncodeMapper_6__call__.doc = __pyx_doc_9pywrapfst_12EncodeMapper_6__call__;\n      ((PyWrapperDescrObject *)wrapper)->d_base = &__pyx_wrapperbase_9pywrapfst_12EncodeMapper_6__call__;\n    }\n  }\n  #endif\n  if (__Pyx_SetVtable(__pyx_type_9pywrapfst_EncodeMapper.tp_dict, __pyx_vtabptr_9pywrapfst_EncodeMapper) < 0) __PYX_ERR(0, 1206, __pyx_L1_error)\n  if (PyObject_SetAttrString(__pyx_m, \"EncodeMapper\", (PyObject *)&__pyx_type_9pywrapfst_EncodeMapper) < 0) __PYX_ERR(0, 1206, __pyx_L1_error)\n  if (__Pyx_setup_reduce((PyObject*)&__pyx_type_9pywrapfst_EncodeMapper) < 0) __PYX_ERR(0, 1206, __pyx_L1_error)\n  __pyx_ptype_9pywrapfst_EncodeMapper = &__pyx_type_9pywrapfst_EncodeMapper;\n  __pyx_vtabptr_9pywrapfst__Fst = &__pyx_vtable_9pywrapfst__Fst;\n  __pyx_vtable_9pywrapfst__Fst.arc_type = (std::string (*)(struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_4_Fst_arc_type;\n  __pyx_vtable_9pywrapfst__Fst.arcs = (struct __pyx_obj_9pywrapfst_ArcIterator *(*)(struct __pyx_obj_9pywrapfst__Fst *, __pyx_t_10basictypes_int64, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_4_Fst_arcs;\n  __pyx_vtable_9pywrapfst__Fst.copy = (struct __pyx_obj_9pywrapfst__Fst *(*)(struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_4_Fst_copy;\n  __pyx_vtable_9pywrapfst__Fst.draw = (void (*)(struct __pyx_obj_9pywrapfst__Fst *, PyObject *, int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_4_Fst_draw *__pyx_optional_args))__pyx_f_9pywrapfst_4_Fst_draw;\n  __pyx_vtable_9pywrapfst__Fst.final = (struct __pyx_obj_9pywrapfst_Weight *(*)(struct __pyx_obj_9pywrapfst__Fst *, __pyx_t_10basictypes_int64, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_4_Fst_final;\n  __pyx_vtable_9pywrapfst__Fst.fst_type = (std::string (*)(struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_4_Fst_fst_type;\n  __pyx_vtable_9pywrapfst__Fst.input_symbols = (struct __pyx_obj_9pywrapfst__FstSymbolTable *(*)(struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_4_Fst_input_symbols;\n  __pyx_vtable_9pywrapfst__Fst.num_arcs = (size_t (*)(struct __pyx_obj_9pywrapfst__Fst *, __pyx_t_10basictypes_int64, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_4_Fst_num_arcs;\n  __pyx_vtable_9pywrapfst__Fst.num_input_epsilons = (size_t (*)(struct __pyx_obj_9pywrapfst__Fst *, __pyx_t_10basictypes_int64, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_4_Fst_num_input_epsilons;\n  __pyx_vtable_9pywrapfst__Fst.num_output_epsilons = (size_t (*)(struct __pyx_obj_9pywrapfst__Fst *, __pyx_t_10basictypes_int64, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_4_Fst_num_output_epsilons;\n  __pyx_vtable_9pywrapfst__Fst.output_symbols = (struct __pyx_obj_9pywrapfst__FstSymbolTable *(*)(struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_4_Fst_output_symbols;\n  __pyx_vtable_9pywrapfst__Fst.properties = (__pyx_t_10basictypes_uint64 (*)(struct __pyx_obj_9pywrapfst__Fst *, __pyx_t_10basictypes_uint64, bool, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_4_Fst_properties;\n  __pyx_vtable_9pywrapfst__Fst.start = (__pyx_t_10basictypes_int64 (*)(struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_4_Fst_start;\n  __pyx_vtable_9pywrapfst__Fst.states = (struct __pyx_obj_9pywrapfst_StateIterator *(*)(struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_4_Fst_states;\n  __pyx_vtable_9pywrapfst__Fst.text = (std::string (*)(struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch, struct __pyx_opt_args_9pywrapfst_4_Fst_text *__pyx_optional_args))__pyx_f_9pywrapfst_4_Fst_text;\n  __pyx_vtable_9pywrapfst__Fst.verify = (bool (*)(struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_4_Fst_verify;\n  __pyx_vtable_9pywrapfst__Fst.weight_type = (std::string (*)(struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_4_Fst_weight_type;\n  __pyx_vtable_9pywrapfst__Fst.write = (void (*)(struct __pyx_obj_9pywrapfst__Fst *, PyObject *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_4_Fst_write;\n  __pyx_vtable_9pywrapfst__Fst.write_to_string = (std::string (*)(struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_4_Fst_write_to_string;\n  if (PyType_Ready(&__pyx_type_9pywrapfst__Fst) < 0) __PYX_ERR(0, 1362, __pyx_L1_error)\n  __pyx_type_9pywrapfst__Fst.tp_print = 0;\n  if ((CYTHON_USE_TYPE_SLOTS && CYTHON_USE_PYTYPE_LOOKUP) && likely(!__pyx_type_9pywrapfst__Fst.tp_dictoffset && __pyx_type_9pywrapfst__Fst.tp_getattro == PyObject_GenericGetAttr)) {\n    __pyx_type_9pywrapfst__Fst.tp_getattro = __Pyx_PyObject_GenericGetAttr;\n  }\n  if (__Pyx_SetVtable(__pyx_type_9pywrapfst__Fst.tp_dict, __pyx_vtabptr_9pywrapfst__Fst) < 0) __PYX_ERR(0, 1362, __pyx_L1_error)\n  if (PyObject_SetAttrString(__pyx_m, \"_Fst\", (PyObject *)&__pyx_type_9pywrapfst__Fst) < 0) __PYX_ERR(0, 1362, __pyx_L1_error)\n  __pyx_ptype_9pywrapfst__Fst = &__pyx_type_9pywrapfst__Fst;\n  __pyx_vtabptr_9pywrapfst__MutableFst = &__pyx_vtable_9pywrapfst__MutableFst;\n  __pyx_vtable_9pywrapfst__MutableFst.__pyx_base = *__pyx_vtabptr_9pywrapfst__Fst;\n  __pyx_vtable_9pywrapfst__MutableFst._check_mutating_imethod = (void (*)(struct __pyx_obj_9pywrapfst__MutableFst *))__pyx_f_9pywrapfst_11_MutableFst__check_mutating_imethod;\n  __pyx_vtable_9pywrapfst__MutableFst._add_arc = (void (*)(struct __pyx_obj_9pywrapfst__MutableFst *, __pyx_t_10basictypes_int64, struct __pyx_obj_9pywrapfst_Arc *))__pyx_f_9pywrapfst_11_MutableFst__add_arc;\n  __pyx_vtable_9pywrapfst__MutableFst.add_state = (__pyx_t_10basictypes_int64 (*)(struct __pyx_obj_9pywrapfst__MutableFst *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_11_MutableFst_add_state;\n  __pyx_vtable_9pywrapfst__MutableFst._arcsort = (void (*)(struct __pyx_obj_9pywrapfst__MutableFst *, struct __pyx_opt_args_9pywrapfst_11_MutableFst__arcsort *__pyx_optional_args))__pyx_f_9pywrapfst_11_MutableFst__arcsort;\n  __pyx_vtable_9pywrapfst__MutableFst._closure = (void (*)(struct __pyx_obj_9pywrapfst__MutableFst *, struct __pyx_opt_args_9pywrapfst_11_MutableFst__closure *__pyx_optional_args))__pyx_f_9pywrapfst_11_MutableFst__closure;\n  __pyx_vtable_9pywrapfst__MutableFst._concat = (void (*)(struct __pyx_obj_9pywrapfst__MutableFst *, struct __pyx_obj_9pywrapfst__Fst *))__pyx_f_9pywrapfst_11_MutableFst__concat;\n  __pyx_vtable_9pywrapfst__MutableFst._connect = (void (*)(struct __pyx_obj_9pywrapfst__MutableFst *))__pyx_f_9pywrapfst_11_MutableFst__connect;\n  __pyx_vtable_9pywrapfst__MutableFst._decode = (void (*)(struct __pyx_obj_9pywrapfst__MutableFst *, struct __pyx_obj_9pywrapfst_EncodeMapper *))__pyx_f_9pywrapfst_11_MutableFst__decode;\n  __pyx_vtable_9pywrapfst__MutableFst._delete_arcs = (void (*)(struct __pyx_obj_9pywrapfst__MutableFst *, __pyx_t_10basictypes_int64, struct __pyx_opt_args_9pywrapfst_11_MutableFst__delete_arcs *__pyx_optional_args))__pyx_f_9pywrapfst_11_MutableFst__delete_arcs;\n  __pyx_vtable_9pywrapfst__MutableFst._delete_states = (void (*)(struct __pyx_obj_9pywrapfst__MutableFst *, struct __pyx_opt_args_9pywrapfst_11_MutableFst__delete_states *__pyx_optional_args))__pyx_f_9pywrapfst_11_MutableFst__delete_states;\n  __pyx_vtable_9pywrapfst__MutableFst._encode = (void (*)(struct __pyx_obj_9pywrapfst__MutableFst *, struct __pyx_obj_9pywrapfst_EncodeMapper *))__pyx_f_9pywrapfst_11_MutableFst__encode;\n  __pyx_vtable_9pywrapfst__MutableFst._invert = (void (*)(struct __pyx_obj_9pywrapfst__MutableFst *))__pyx_f_9pywrapfst_11_MutableFst__invert;\n  __pyx_vtable_9pywrapfst__MutableFst._minimize = (void (*)(struct __pyx_obj_9pywrapfst__MutableFst *, struct __pyx_opt_args_9pywrapfst_11_MutableFst__minimize *__pyx_optional_args))__pyx_f_9pywrapfst_11_MutableFst__minimize;\n  __pyx_vtable_9pywrapfst__MutableFst.mutable_arcs = (struct __pyx_obj_9pywrapfst_MutableArcIterator *(*)(struct __pyx_obj_9pywrapfst__MutableFst *, __pyx_t_10basictypes_int64, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_11_MutableFst_mutable_arcs;\n  __pyx_vtable_9pywrapfst__MutableFst.num_states = (__pyx_t_10basictypes_int64 (*)(struct __pyx_obj_9pywrapfst__MutableFst *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_11_MutableFst_num_states;\n  __pyx_vtable_9pywrapfst__MutableFst._project = (void (*)(struct __pyx_obj_9pywrapfst__MutableFst *, struct __pyx_opt_args_9pywrapfst_11_MutableFst__project *__pyx_optional_args))__pyx_f_9pywrapfst_11_MutableFst__project;\n  __pyx_vtable_9pywrapfst__MutableFst._prune = (void (*)(struct __pyx_obj_9pywrapfst__MutableFst *, struct __pyx_opt_args_9pywrapfst_11_MutableFst__prune *__pyx_optional_args))__pyx_f_9pywrapfst_11_MutableFst__prune;\n  __pyx_vtable_9pywrapfst__MutableFst._push = (void (*)(struct __pyx_obj_9pywrapfst__MutableFst *, struct __pyx_opt_args_9pywrapfst_11_MutableFst__push *__pyx_optional_args))__pyx_f_9pywrapfst_11_MutableFst__push;\n  __pyx_vtable_9pywrapfst__MutableFst._relabel_pairs = (void (*)(struct __pyx_obj_9pywrapfst__MutableFst *, struct __pyx_opt_args_9pywrapfst_11_MutableFst__relabel_pairs *__pyx_optional_args))__pyx_f_9pywrapfst_11_MutableFst__relabel_pairs;\n  __pyx_vtable_9pywrapfst__MutableFst._relabel_tables = (void (*)(struct __pyx_obj_9pywrapfst__MutableFst *, struct __pyx_opt_args_9pywrapfst_11_MutableFst__relabel_tables *__pyx_optional_args))__pyx_f_9pywrapfst_11_MutableFst__relabel_tables;\n  __pyx_vtable_9pywrapfst__MutableFst._reserve_arcs = (void (*)(struct __pyx_obj_9pywrapfst__MutableFst *, __pyx_t_10basictypes_int64, size_t))__pyx_f_9pywrapfst_11_MutableFst__reserve_arcs;\n  __pyx_vtable_9pywrapfst__MutableFst._reserve_states = (void (*)(struct __pyx_obj_9pywrapfst__MutableFst *, __pyx_t_10basictypes_int64))__pyx_f_9pywrapfst_11_MutableFst__reserve_states;\n  __pyx_vtable_9pywrapfst__MutableFst._reweight = (void (*)(struct __pyx_obj_9pywrapfst__MutableFst *, PyObject *, struct __pyx_opt_args_9pywrapfst_11_MutableFst__reweight *__pyx_optional_args))__pyx_f_9pywrapfst_11_MutableFst__reweight;\n  __pyx_vtable_9pywrapfst__MutableFst._rmepsilon = (void (*)(struct __pyx_obj_9pywrapfst__MutableFst *, struct __pyx_opt_args_9pywrapfst_11_MutableFst__rmepsilon *__pyx_optional_args))__pyx_f_9pywrapfst_11_MutableFst__rmepsilon;\n  __pyx_vtable_9pywrapfst__MutableFst._set_final = (void (*)(struct __pyx_obj_9pywrapfst__MutableFst *, __pyx_t_10basictypes_int64, struct __pyx_opt_args_9pywrapfst_11_MutableFst__set_final *__pyx_optional_args))__pyx_f_9pywrapfst_11_MutableFst__set_final;\n  __pyx_vtable_9pywrapfst__MutableFst._set_properties = (void (*)(struct __pyx_obj_9pywrapfst__MutableFst *, __pyx_t_10basictypes_uint64, __pyx_t_10basictypes_uint64))__pyx_f_9pywrapfst_11_MutableFst__set_properties;\n  __pyx_vtable_9pywrapfst__MutableFst._set_start = (void (*)(struct __pyx_obj_9pywrapfst__MutableFst *, __pyx_t_10basictypes_int64))__pyx_f_9pywrapfst_11_MutableFst__set_start;\n  __pyx_vtable_9pywrapfst__MutableFst._set_input_symbols = (void (*)(struct __pyx_obj_9pywrapfst__MutableFst *, struct __pyx_obj_9pywrapfst__SymbolTable *))__pyx_f_9pywrapfst_11_MutableFst__set_input_symbols;\n  __pyx_vtable_9pywrapfst__MutableFst._set_output_symbols = (void (*)(struct __pyx_obj_9pywrapfst__MutableFst *, struct __pyx_obj_9pywrapfst__SymbolTable *))__pyx_f_9pywrapfst_11_MutableFst__set_output_symbols;\n  __pyx_vtable_9pywrapfst__MutableFst._topsort = (void (*)(struct __pyx_obj_9pywrapfst__MutableFst *))__pyx_f_9pywrapfst_11_MutableFst__topsort;\n  __pyx_vtable_9pywrapfst__MutableFst._union = (void (*)(struct __pyx_obj_9pywrapfst__MutableFst *, struct __pyx_obj_9pywrapfst__Fst *))__pyx_f_9pywrapfst_11_MutableFst__union;\n  __pyx_type_9pywrapfst__MutableFst.tp_base = __pyx_ptype_9pywrapfst__Fst;\n  if (PyType_Ready(&__pyx_type_9pywrapfst__MutableFst) < 0) __PYX_ERR(0, 1774, __pyx_L1_error)\n  __pyx_type_9pywrapfst__MutableFst.tp_print = 0;\n  if ((CYTHON_USE_TYPE_SLOTS && CYTHON_USE_PYTYPE_LOOKUP) && likely(!__pyx_type_9pywrapfst__MutableFst.tp_dictoffset && __pyx_type_9pywrapfst__MutableFst.tp_getattro == PyObject_GenericGetAttr)) {\n    __pyx_type_9pywrapfst__MutableFst.tp_getattro = __Pyx_PyObject_GenericGetAttr;\n  }\n  if (__Pyx_SetVtable(__pyx_type_9pywrapfst__MutableFst.tp_dict, __pyx_vtabptr_9pywrapfst__MutableFst) < 0) __PYX_ERR(0, 1774, __pyx_L1_error)\n  if (PyObject_SetAttrString(__pyx_m, \"_MutableFst\", (PyObject *)&__pyx_type_9pywrapfst__MutableFst) < 0) __PYX_ERR(0, 1774, __pyx_L1_error)\n  __pyx_ptype_9pywrapfst__MutableFst = &__pyx_type_9pywrapfst__MutableFst;\n  __pyx_vtabptr_9pywrapfst_Arc = &__pyx_vtable_9pywrapfst_Arc;\n  __pyx_vtable_9pywrapfst_Arc.copy = (struct __pyx_obj_9pywrapfst_Arc *(*)(struct __pyx_obj_9pywrapfst_Arc *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_3Arc_copy;\n  if (PyType_Ready(&__pyx_type_9pywrapfst_Arc) < 0) __PYX_ERR(0, 2898, __pyx_L1_error)\n  __pyx_type_9pywrapfst_Arc.tp_print = 0;\n  if ((CYTHON_USE_TYPE_SLOTS && CYTHON_USE_PYTYPE_LOOKUP) && likely(!__pyx_type_9pywrapfst_Arc.tp_dictoffset && __pyx_type_9pywrapfst_Arc.tp_getattro == PyObject_GenericGetAttr)) {\n    __pyx_type_9pywrapfst_Arc.tp_getattro = __Pyx_PyObject_GenericGetAttr;\n  }\n  if (__Pyx_SetVtable(__pyx_type_9pywrapfst_Arc.tp_dict, __pyx_vtabptr_9pywrapfst_Arc) < 0) __PYX_ERR(0, 2898, __pyx_L1_error)\n  if (PyObject_SetAttrString(__pyx_m, \"Arc\", (PyObject *)&__pyx_type_9pywrapfst_Arc) < 0) __PYX_ERR(0, 2898, __pyx_L1_error)\n  if (__Pyx_setup_reduce((PyObject*)&__pyx_type_9pywrapfst_Arc) < 0) __PYX_ERR(0, 2898, __pyx_L1_error)\n  __pyx_ptype_9pywrapfst_Arc = &__pyx_type_9pywrapfst_Arc;\n  __pyx_vtabptr_9pywrapfst_ArcIterator = &__pyx_vtable_9pywrapfst_ArcIterator;\n  __pyx_vtable_9pywrapfst_ArcIterator.done = (bool (*)(struct __pyx_obj_9pywrapfst_ArcIterator *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_11ArcIterator_done;\n  __pyx_vtable_9pywrapfst_ArcIterator.flags = (__pyx_t_10basictypes_uint32 (*)(struct __pyx_obj_9pywrapfst_ArcIterator *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_11ArcIterator_flags;\n  __pyx_vtable_9pywrapfst_ArcIterator.next = (void (*)(struct __pyx_obj_9pywrapfst_ArcIterator *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_11ArcIterator_next;\n  __pyx_vtable_9pywrapfst_ArcIterator.position = (size_t (*)(struct __pyx_obj_9pywrapfst_ArcIterator *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_11ArcIterator_position;\n  __pyx_vtable_9pywrapfst_ArcIterator.reset = (void (*)(struct __pyx_obj_9pywrapfst_ArcIterator *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_11ArcIterator_reset;\n  __pyx_vtable_9pywrapfst_ArcIterator.seek = (void (*)(struct __pyx_obj_9pywrapfst_ArcIterator *, size_t, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_11ArcIterator_seek;\n  __pyx_vtable_9pywrapfst_ArcIterator.set_flags = (void (*)(struct __pyx_obj_9pywrapfst_ArcIterator *, __pyx_t_10basictypes_uint32, __pyx_t_10basictypes_uint32, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_11ArcIterator_set_flags;\n  __pyx_vtable_9pywrapfst_ArcIterator.value = (PyObject *(*)(struct __pyx_obj_9pywrapfst_ArcIterator *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_11ArcIterator_value;\n  if (PyType_Ready(&__pyx_type_9pywrapfst_ArcIterator) < 0) __PYX_ERR(0, 2965, __pyx_L1_error)\n  __pyx_type_9pywrapfst_ArcIterator.tp_print = 0;\n  if ((CYTHON_USE_TYPE_SLOTS && CYTHON_USE_PYTYPE_LOOKUP) && likely(!__pyx_type_9pywrapfst_ArcIterator.tp_dictoffset && __pyx_type_9pywrapfst_ArcIterator.tp_getattro == PyObject_GenericGetAttr)) {\n    __pyx_type_9pywrapfst_ArcIterator.tp_getattro = __Pyx_PyObject_GenericGetAttr;\n  }\n  if (__Pyx_SetVtable(__pyx_type_9pywrapfst_ArcIterator.tp_dict, __pyx_vtabptr_9pywrapfst_ArcIterator) < 0) __PYX_ERR(0, 2965, __pyx_L1_error)\n  if (PyObject_SetAttrString(__pyx_m, \"ArcIterator\", (PyObject *)&__pyx_type_9pywrapfst_ArcIterator) < 0) __PYX_ERR(0, 2965, __pyx_L1_error)\n  if (__Pyx_setup_reduce((PyObject*)&__pyx_type_9pywrapfst_ArcIterator) < 0) __PYX_ERR(0, 2965, __pyx_L1_error)\n  __pyx_ptype_9pywrapfst_ArcIterator = &__pyx_type_9pywrapfst_ArcIterator;\n  __pyx_vtabptr_9pywrapfst_MutableArcIterator = &__pyx_vtable_9pywrapfst_MutableArcIterator;\n  __pyx_vtable_9pywrapfst_MutableArcIterator.done = (bool (*)(struct __pyx_obj_9pywrapfst_MutableArcIterator *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_18MutableArcIterator_done;\n  __pyx_vtable_9pywrapfst_MutableArcIterator.flags = (__pyx_t_10basictypes_uint32 (*)(struct __pyx_obj_9pywrapfst_MutableArcIterator *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_18MutableArcIterator_flags;\n  __pyx_vtable_9pywrapfst_MutableArcIterator.next = (void (*)(struct __pyx_obj_9pywrapfst_MutableArcIterator *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_18MutableArcIterator_next;\n  __pyx_vtable_9pywrapfst_MutableArcIterator.position = (size_t (*)(struct __pyx_obj_9pywrapfst_MutableArcIterator *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_18MutableArcIterator_position;\n  __pyx_vtable_9pywrapfst_MutableArcIterator.reset = (void (*)(struct __pyx_obj_9pywrapfst_MutableArcIterator *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_18MutableArcIterator_reset;\n  __pyx_vtable_9pywrapfst_MutableArcIterator.seek = (void (*)(struct __pyx_obj_9pywrapfst_MutableArcIterator *, size_t, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_18MutableArcIterator_seek;\n  __pyx_vtable_9pywrapfst_MutableArcIterator.set_flags = (void (*)(struct __pyx_obj_9pywrapfst_MutableArcIterator *, __pyx_t_10basictypes_uint32, __pyx_t_10basictypes_uint32, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_18MutableArcIterator_set_flags;\n  __pyx_vtable_9pywrapfst_MutableArcIterator.set_value = (void (*)(struct __pyx_obj_9pywrapfst_MutableArcIterator *, struct __pyx_obj_9pywrapfst_Arc *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_18MutableArcIterator_set_value;\n  __pyx_vtable_9pywrapfst_MutableArcIterator.value = (PyObject *(*)(struct __pyx_obj_9pywrapfst_MutableArcIterator *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_18MutableArcIterator_value;\n  if (PyType_Ready(&__pyx_type_9pywrapfst_MutableArcIterator) < 0) __PYX_ERR(0, 3076, __pyx_L1_error)\n  __pyx_type_9pywrapfst_MutableArcIterator.tp_print = 0;\n  if ((CYTHON_USE_TYPE_SLOTS && CYTHON_USE_PYTYPE_LOOKUP) && likely(!__pyx_type_9pywrapfst_MutableArcIterator.tp_dictoffset && __pyx_type_9pywrapfst_MutableArcIterator.tp_getattro == PyObject_GenericGetAttr)) {\n    __pyx_type_9pywrapfst_MutableArcIterator.tp_getattro = __Pyx_PyObject_GenericGetAttr;\n  }\n  if (__Pyx_SetVtable(__pyx_type_9pywrapfst_MutableArcIterator.tp_dict, __pyx_vtabptr_9pywrapfst_MutableArcIterator) < 0) __PYX_ERR(0, 3076, __pyx_L1_error)\n  if (PyObject_SetAttrString(__pyx_m, \"MutableArcIterator\", (PyObject *)&__pyx_type_9pywrapfst_MutableArcIterator) < 0) __PYX_ERR(0, 3076, __pyx_L1_error)\n  if (__Pyx_setup_reduce((PyObject*)&__pyx_type_9pywrapfst_MutableArcIterator) < 0) __PYX_ERR(0, 3076, __pyx_L1_error)\n  __pyx_ptype_9pywrapfst_MutableArcIterator = &__pyx_type_9pywrapfst_MutableArcIterator;\n  __pyx_vtabptr_9pywrapfst_StateIterator = &__pyx_vtable_9pywrapfst_StateIterator;\n  __pyx_vtable_9pywrapfst_StateIterator.done = (bool (*)(struct __pyx_obj_9pywrapfst_StateIterator *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_13StateIterator_done;\n  __pyx_vtable_9pywrapfst_StateIterator.next = (void (*)(struct __pyx_obj_9pywrapfst_StateIterator *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_13StateIterator_next;\n  __pyx_vtable_9pywrapfst_StateIterator.reset = (void (*)(struct __pyx_obj_9pywrapfst_StateIterator *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_13StateIterator_reset;\n  __pyx_vtable_9pywrapfst_StateIterator.value = (__pyx_t_10basictypes_int64 (*)(struct __pyx_obj_9pywrapfst_StateIterator *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_13StateIterator_value;\n  if (PyType_Ready(&__pyx_type_9pywrapfst_StateIterator) < 0) __PYX_ERR(0, 3190, __pyx_L1_error)\n  __pyx_type_9pywrapfst_StateIterator.tp_print = 0;\n  if ((CYTHON_USE_TYPE_SLOTS && CYTHON_USE_PYTYPE_LOOKUP) && likely(!__pyx_type_9pywrapfst_StateIterator.tp_dictoffset && __pyx_type_9pywrapfst_StateIterator.tp_getattro == PyObject_GenericGetAttr)) {\n    __pyx_type_9pywrapfst_StateIterator.tp_getattro = __Pyx_PyObject_GenericGetAttr;\n  }\n  if (__Pyx_SetVtable(__pyx_type_9pywrapfst_StateIterator.tp_dict, __pyx_vtabptr_9pywrapfst_StateIterator) < 0) __PYX_ERR(0, 3190, __pyx_L1_error)\n  if (PyObject_SetAttrString(__pyx_m, \"StateIterator\", (PyObject *)&__pyx_type_9pywrapfst_StateIterator) < 0) __PYX_ERR(0, 3190, __pyx_L1_error)\n  if (__Pyx_setup_reduce((PyObject*)&__pyx_type_9pywrapfst_StateIterator) < 0) __PYX_ERR(0, 3190, __pyx_L1_error)\n  __pyx_ptype_9pywrapfst_StateIterator = &__pyx_type_9pywrapfst_StateIterator;\n  __pyx_vtabptr_9pywrapfst_Compiler = &__pyx_vtable_9pywrapfst_Compiler;\n  __pyx_vtable_9pywrapfst_Compiler.compile = (struct __pyx_obj_9pywrapfst__Fst *(*)(struct __pyx_obj_9pywrapfst_Compiler *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_8Compiler_compile;\n  __pyx_vtable_9pywrapfst_Compiler.write = (void (*)(struct __pyx_obj_9pywrapfst_Compiler *, PyObject *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_8Compiler_write;\n  if (PyType_Ready(&__pyx_type_9pywrapfst_Compiler) < 0) __PYX_ERR(0, 4088, __pyx_L1_error)\n  __pyx_type_9pywrapfst_Compiler.tp_print = 0;\n  if ((CYTHON_USE_TYPE_SLOTS && CYTHON_USE_PYTYPE_LOOKUP) && likely(!__pyx_type_9pywrapfst_Compiler.tp_dictoffset && __pyx_type_9pywrapfst_Compiler.tp_getattro == PyObject_GenericGetAttr)) {\n    __pyx_type_9pywrapfst_Compiler.tp_getattro = __Pyx_PyObject_GenericGetAttr;\n  }\n  if (__Pyx_SetVtable(__pyx_type_9pywrapfst_Compiler.tp_dict, __pyx_vtabptr_9pywrapfst_Compiler) < 0) __PYX_ERR(0, 4088, __pyx_L1_error)\n  if (PyObject_SetAttrString(__pyx_m, \"Compiler\", (PyObject *)&__pyx_type_9pywrapfst_Compiler) < 0) __PYX_ERR(0, 4088, __pyx_L1_error)\n  if (__Pyx_setup_reduce((PyObject*)&__pyx_type_9pywrapfst_Compiler) < 0) __PYX_ERR(0, 4088, __pyx_L1_error)\n  __pyx_ptype_9pywrapfst_Compiler = &__pyx_type_9pywrapfst_Compiler;\n  __pyx_vtabptr_9pywrapfst_FarReader = &__pyx_vtable_9pywrapfst_FarReader;\n  __pyx_vtable_9pywrapfst_FarReader.arc_type = (std::string (*)(struct __pyx_obj_9pywrapfst_FarReader *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_9FarReader_arc_type;\n  __pyx_vtable_9pywrapfst_FarReader.done = (bool (*)(struct __pyx_obj_9pywrapfst_FarReader *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_9FarReader_done;\n  __pyx_vtable_9pywrapfst_FarReader.error = (bool (*)(struct __pyx_obj_9pywrapfst_FarReader *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_9FarReader_error;\n  __pyx_vtable_9pywrapfst_FarReader.far_type = (std::string (*)(struct __pyx_obj_9pywrapfst_FarReader *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_9FarReader_far_type;\n  __pyx_vtable_9pywrapfst_FarReader.find = (bool (*)(struct __pyx_obj_9pywrapfst_FarReader *, PyObject *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_9FarReader_find;\n  __pyx_vtable_9pywrapfst_FarReader.get_fst = (struct __pyx_obj_9pywrapfst__Fst *(*)(struct __pyx_obj_9pywrapfst_FarReader *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_9FarReader_get_fst;\n  __pyx_vtable_9pywrapfst_FarReader.get_key = (std::string (*)(struct __pyx_obj_9pywrapfst_FarReader *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_9FarReader_get_key;\n  __pyx_vtable_9pywrapfst_FarReader.next = (void (*)(struct __pyx_obj_9pywrapfst_FarReader *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_9FarReader_next;\n  __pyx_vtable_9pywrapfst_FarReader.reset = (void (*)(struct __pyx_obj_9pywrapfst_FarReader *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_9FarReader_reset;\n  if (PyType_Ready(&__pyx_type_9pywrapfst_FarReader) < 0) __PYX_ERR(0, 4215, __pyx_L1_error)\n  __pyx_type_9pywrapfst_FarReader.tp_print = 0;\n  if ((CYTHON_USE_TYPE_SLOTS && CYTHON_USE_PYTYPE_LOOKUP) && likely(!__pyx_type_9pywrapfst_FarReader.tp_dictoffset && __pyx_type_9pywrapfst_FarReader.tp_getattro == PyObject_GenericGetAttr)) {\n    __pyx_type_9pywrapfst_FarReader.tp_getattro = __Pyx_PyObject_GenericGetAttr;\n  }\n  if (__Pyx_SetVtable(__pyx_type_9pywrapfst_FarReader.tp_dict, __pyx_vtabptr_9pywrapfst_FarReader) < 0) __PYX_ERR(0, 4215, __pyx_L1_error)\n  if (PyObject_SetAttrString(__pyx_m, \"FarReader\", (PyObject *)&__pyx_type_9pywrapfst_FarReader) < 0) __PYX_ERR(0, 4215, __pyx_L1_error)\n  if (__Pyx_setup_reduce((PyObject*)&__pyx_type_9pywrapfst_FarReader) < 0) __PYX_ERR(0, 4215, __pyx_L1_error)\n  __pyx_ptype_9pywrapfst_FarReader = &__pyx_type_9pywrapfst_FarReader;\n  __pyx_vtabptr_9pywrapfst_FarWriter = &__pyx_vtable_9pywrapfst_FarWriter;\n  __pyx_vtable_9pywrapfst_FarWriter.arc_type = (std::string (*)(struct __pyx_obj_9pywrapfst_FarWriter *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_9FarWriter_arc_type;\n  __pyx_vtable_9pywrapfst_FarWriter.close = (void (*)(struct __pyx_obj_9pywrapfst_FarWriter *))__pyx_f_9pywrapfst_9FarWriter_close;\n  __pyx_vtable_9pywrapfst_FarWriter.add = (void (*)(struct __pyx_obj_9pywrapfst_FarWriter *, PyObject *, struct __pyx_obj_9pywrapfst__Fst *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_9FarWriter_add;\n  __pyx_vtable_9pywrapfst_FarWriter.error = (bool (*)(struct __pyx_obj_9pywrapfst_FarWriter *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_9FarWriter_error;\n  __pyx_vtable_9pywrapfst_FarWriter.far_type = (std::string (*)(struct __pyx_obj_9pywrapfst_FarWriter *, int __pyx_skip_dispatch))__pyx_f_9pywrapfst_9FarWriter_far_type;\n  if (PyType_Ready(&__pyx_type_9pywrapfst_FarWriter) < 0) __PYX_ERR(0, 4361, __pyx_L1_error)\n  __pyx_type_9pywrapfst_FarWriter.tp_print = 0;\n  if ((CYTHON_USE_TYPE_SLOTS && CYTHON_USE_PYTYPE_LOOKUP) && likely(!__pyx_type_9pywrapfst_FarWriter.tp_dictoffset && __pyx_type_9pywrapfst_FarWriter.tp_getattro == PyObject_GenericGetAttr)) {\n    __pyx_type_9pywrapfst_FarWriter.tp_getattro = __Pyx_PyObject_GenericGetAttr;\n  }\n  if (__Pyx_SetVtable(__pyx_type_9pywrapfst_FarWriter.tp_dict, __pyx_vtabptr_9pywrapfst_FarWriter) < 0) __PYX_ERR(0, 4361, __pyx_L1_error)\n  if (PyObject_SetAttrString(__pyx_m, \"FarWriter\", (PyObject *)&__pyx_type_9pywrapfst_FarWriter) < 0) __PYX_ERR(0, 4361, __pyx_L1_error)\n  if (__Pyx_setup_reduce((PyObject*)&__pyx_type_9pywrapfst_FarWriter) < 0) __PYX_ERR(0, 4361, __pyx_L1_error)\n  __pyx_ptype_9pywrapfst_FarWriter = &__pyx_type_9pywrapfst_FarWriter;\n  __Pyx_RefNannyFinishContext();\n  return 0;\n  __pyx_L1_error:;\n  __Pyx_RefNannyFinishContext();\n  return -1;\n}\n\nstatic int __Pyx_modinit_type_import_code(void) {\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__Pyx_modinit_type_import_code\", 0);\n  /*--- Type import code ---*/\n  __Pyx_RefNannyFinishContext();\n  return 0;\n}\n\nstatic int __Pyx_modinit_variable_import_code(void) {\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__Pyx_modinit_variable_import_code\", 0);\n  /*--- Variable import code ---*/\n  __Pyx_RefNannyFinishContext();\n  return 0;\n}\n\nstatic int __Pyx_modinit_function_import_code(void) {\n  __Pyx_RefNannyDeclarations\n  __Pyx_RefNannySetupContext(\"__Pyx_modinit_function_import_code\", 0);\n  /*--- Function import code ---*/\n  __Pyx_RefNannyFinishContext();\n  return 0;\n}\n\n\n#if PY_MAJOR_VERSION < 3\n#ifdef CYTHON_NO_PYINIT_EXPORT\n#define __Pyx_PyMODINIT_FUNC void\n#else\n#define __Pyx_PyMODINIT_FUNC PyMODINIT_FUNC\n#endif\n#else\n#ifdef CYTHON_NO_PYINIT_EXPORT\n#define __Pyx_PyMODINIT_FUNC PyObject *\n#else\n#define __Pyx_PyMODINIT_FUNC PyMODINIT_FUNC\n#endif\n#endif\n#ifndef CYTHON_SMALL_CODE\n#if defined(__clang__)\n    #define CYTHON_SMALL_CODE\n#elif defined(__GNUC__) && (!(defined(__cplusplus)) || (__GNUC__ > 4 || (__GNUC__ == 4 && __GNUC_MINOR__ > 4)))\n    #define CYTHON_SMALL_CODE __attribute__((optimize(\"Os\")))\n#else\n    #define CYTHON_SMALL_CODE\n#endif\n#endif\n\n\n#if PY_MAJOR_VERSION < 3\n__Pyx_PyMODINIT_FUNC initpywrapfst(void) CYTHON_SMALL_CODE; /*proto*/\n__Pyx_PyMODINIT_FUNC initpywrapfst(void)\n#else\n__Pyx_PyMODINIT_FUNC PyInit_pywrapfst(void) CYTHON_SMALL_CODE; /*proto*/\n__Pyx_PyMODINIT_FUNC PyInit_pywrapfst(void)\n#if CYTHON_PEP489_MULTI_PHASE_INIT\n{\n  return PyModuleDef_Init(&__pyx_moduledef);\n}\nstatic int __Pyx_copy_spec_to_module(PyObject *spec, PyObject *moddict, const char* from_name, const char* to_name) {\n    PyObject *value = PyObject_GetAttrString(spec, from_name);\n    int result = 0;\n    if (likely(value)) {\n        result = PyDict_SetItemString(moddict, to_name, value);\n        Py_DECREF(value);\n    } else if (PyErr_ExceptionMatches(PyExc_AttributeError)) {\n        PyErr_Clear();\n    } else {\n        result = -1;\n    }\n    return result;\n}\nstatic PyObject* __pyx_pymod_create(PyObject *spec, CYTHON_UNUSED PyModuleDef *def) {\n    PyObject *module = NULL, *moddict, *modname;\n    if (__pyx_m)\n        return __Pyx_NewRef(__pyx_m);\n    modname = PyObject_GetAttrString(spec, \"name\");\n    if (unlikely(!modname)) goto bad;\n    module = PyModule_NewObject(modname);\n    Py_DECREF(modname);\n    if (unlikely(!module)) goto bad;\n    moddict = PyModule_GetDict(module);\n    if (unlikely(!moddict)) goto bad;\n    if (unlikely(__Pyx_copy_spec_to_module(spec, moddict, \"loader\", \"__loader__\") < 0)) goto bad;\n    if (unlikely(__Pyx_copy_spec_to_module(spec, moddict, \"origin\", \"__file__\") < 0)) goto bad;\n    if (unlikely(__Pyx_copy_spec_to_module(spec, moddict, \"parent\", \"__package__\") < 0)) goto bad;\n    if (unlikely(__Pyx_copy_spec_to_module(spec, moddict, \"submodule_search_locations\", \"__path__\") < 0)) goto bad;\n    return module;\nbad:\n    Py_XDECREF(module);\n    return NULL;\n}\n\n\nstatic int __pyx_pymod_exec_pywrapfst(PyObject *__pyx_pyinit_module)\n#endif\n#endif\n{\n  PyObject *__pyx_t_1 = NULL;\n  PyObject *__pyx_t_2 = NULL;\n  PyObject *__pyx_t_3 = NULL;\n  PyObject *__pyx_t_4 = NULL;\n  __pyx_t_10basictypes_int64 __pyx_t_5;\n  std::string __pyx_t_6;\n  __Pyx_RefNannyDeclarations\n  #if CYTHON_PEP489_MULTI_PHASE_INIT\n  if (__pyx_m && __pyx_m == __pyx_pyinit_module) return 0;\n  #elif PY_MAJOR_VERSION >= 3\n  if (__pyx_m) return __Pyx_NewRef(__pyx_m);\n  #endif\n  #if CYTHON_REFNANNY\n__Pyx_RefNanny = __Pyx_RefNannyImportAPI(\"refnanny\");\nif (!__Pyx_RefNanny) {\n  PyErr_Clear();\n  __Pyx_RefNanny = __Pyx_RefNannyImportAPI(\"Cython.Runtime.refnanny\");\n  if (!__Pyx_RefNanny)\n      Py_FatalError(\"failed to import 'refnanny' module\");\n}\n#endif\n  __Pyx_RefNannySetupContext(\"__Pyx_PyMODINIT_FUNC PyInit_pywrapfst(void)\", 0);\n  if (__Pyx_check_binary_version() < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  __pyx_empty_tuple = PyTuple_New(0); if (unlikely(!__pyx_empty_tuple)) __PYX_ERR(0, 1, __pyx_L1_error)\n  __pyx_empty_bytes = PyBytes_FromStringAndSize(\"\", 0); if (unlikely(!__pyx_empty_bytes)) __PYX_ERR(0, 1, __pyx_L1_error)\n  __pyx_empty_unicode = PyUnicode_FromStringAndSize(\"\", 0); if (unlikely(!__pyx_empty_unicode)) __PYX_ERR(0, 1, __pyx_L1_error)\n  #ifdef __Pyx_CyFunction_USED\n  if (__pyx_CyFunction_init() < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  #endif\n  #ifdef __Pyx_FusedFunction_USED\n  if (__pyx_FusedFunction_init() < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  #endif\n  #ifdef __Pyx_Coroutine_USED\n  if (__pyx_Coroutine_init() < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  #endif\n  #ifdef __Pyx_Generator_USED\n  if (__pyx_Generator_init() < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  #endif\n  #ifdef __Pyx_AsyncGen_USED\n  if (__pyx_AsyncGen_init() < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  #endif\n  #ifdef __Pyx_StopAsyncIteration_USED\n  if (__pyx_StopAsyncIteration_init() < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  #endif\n  /*--- Library function declarations ---*/\n  /*--- Threads initialization code ---*/\n  #if defined(__PYX_FORCE_INIT_THREADS) && __PYX_FORCE_INIT_THREADS\n  #ifdef WITH_THREAD /* Python build with threading support? */\n  PyEval_InitThreads();\n  #endif\n  #endif\n  /*--- Module creation code ---*/\n  #if CYTHON_PEP489_MULTI_PHASE_INIT\n  __pyx_m = __pyx_pyinit_module;\n  Py_INCREF(__pyx_m);\n  #else\n  #if PY_MAJOR_VERSION < 3\n  __pyx_m = Py_InitModule4(\"pywrapfst\", __pyx_methods, __pyx_k_Python_interface_to_the_FST_scri, 0, PYTHON_API_VERSION); Py_XINCREF(__pyx_m);\n  #else\n  __pyx_m = PyModule_Create(&__pyx_moduledef);\n  #endif\n  if (unlikely(!__pyx_m)) __PYX_ERR(0, 1, __pyx_L1_error)\n  #endif\n  __pyx_d = PyModule_GetDict(__pyx_m); if (unlikely(!__pyx_d)) __PYX_ERR(0, 1, __pyx_L1_error)\n  Py_INCREF(__pyx_d);\n  __pyx_b = PyImport_AddModule(__Pyx_BUILTIN_MODULE_NAME); if (unlikely(!__pyx_b)) __PYX_ERR(0, 1, __pyx_L1_error)\n  __pyx_cython_runtime = PyImport_AddModule((char *) \"cython_runtime\"); if (unlikely(!__pyx_cython_runtime)) __PYX_ERR(0, 1, __pyx_L1_error)\n  #if CYTHON_COMPILING_IN_PYPY\n  Py_INCREF(__pyx_b);\n  #endif\n  if (PyObject_SetAttrString(__pyx_m, \"__builtins__\", __pyx_b) < 0) __PYX_ERR(0, 1, __pyx_L1_error);\n  /*--- Initialize various global constants etc. ---*/\n  if (__Pyx_InitGlobals() < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  #if PY_MAJOR_VERSION < 3 && (__PYX_DEFAULT_STRING_ENCODING_IS_ASCII || __PYX_DEFAULT_STRING_ENCODING_IS_DEFAULT)\n  if (__Pyx_init_sys_getdefaultencoding_params() < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  #endif\n  if (__pyx_module_is_main_pywrapfst) {\n    if (PyObject_SetAttrString(__pyx_m, \"__name__\", __pyx_n_s_main) < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  }\n  #if PY_MAJOR_VERSION >= 3\n  {\n    PyObject *modules = PyImport_GetModuleDict(); if (unlikely(!modules)) __PYX_ERR(0, 1, __pyx_L1_error)\n    if (!PyDict_GetItemString(modules, \"pywrapfst\")) {\n      if (unlikely(PyDict_SetItemString(modules, \"pywrapfst\", __pyx_m) < 0)) __PYX_ERR(0, 1, __pyx_L1_error)\n    }\n  }\n  #endif\n  /*--- Builtin init code ---*/\n  if (__Pyx_InitCachedBuiltins() < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  /*--- Constants init code ---*/\n  if (__Pyx_InitCachedConstants() < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  /*--- Global type/function init code ---*/\n  (void)__Pyx_modinit_global_init_code();\n  (void)__Pyx_modinit_variable_export_code();\n  if (unlikely(__Pyx_modinit_function_export_code() != 0)) goto __pyx_L1_error;\n  if (unlikely(__Pyx_modinit_type_init_code() != 0)) goto __pyx_L1_error;\n  (void)__Pyx_modinit_type_import_code();\n  (void)__Pyx_modinit_variable_import_code();\n  (void)__Pyx_modinit_function_import_code();\n  /*--- Execution code ---*/\n  #if defined(__Pyx_Generator_USED) || defined(__Pyx_Coroutine_USED)\n  if (__Pyx_patch_abc() < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  #endif\n\n  /* \"pywrapfst.pyx\":107\n * \n * # Python imports.\n * import atexit             # <<<<<<<<<<<<<<\n * import numbers\n * import subprocess\n */\n  __pyx_t_1 = __Pyx_Import(__pyx_n_s_atexit, 0, -1); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 107, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_atexit, __pyx_t_1) < 0) __PYX_ERR(0, 107, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":108\n * # Python imports.\n * import atexit\n * import numbers             # <<<<<<<<<<<<<<\n * import subprocess\n * import logging\n */\n  __pyx_t_1 = __Pyx_Import(__pyx_n_s_numbers, 0, -1); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 108, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_numbers, __pyx_t_1) < 0) __PYX_ERR(0, 108, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":109\n * import atexit\n * import numbers\n * import subprocess             # <<<<<<<<<<<<<<\n * import logging\n * \n */\n  __pyx_t_1 = __Pyx_Import(__pyx_n_s_subprocess, 0, -1); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 109, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_subprocess, __pyx_t_1) < 0) __PYX_ERR(0, 109, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":110\n * import numbers\n * import subprocess\n * import logging             # <<<<<<<<<<<<<<\n * \n * \n */\n  __pyx_t_1 = __Pyx_Import(__pyx_n_s_logging, 0, -1); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 110, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_logging, __pyx_t_1) < 0) __PYX_ERR(0, 110, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":115\n * # TODO(kbg): Figure out how to access static class variables so I don't have\n * # to do it this way.\n * kNoSymbol = -1             # <<<<<<<<<<<<<<\n * \n * \n */\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_kNoSymbol, __pyx_int_neg_1) < 0) __PYX_ERR(0, 115, __pyx_L1_error)\n\n  /* \"pywrapfst.pyx\":121\n * \n * \n * class FstError(Exception):             # <<<<<<<<<<<<<<\n * \n *   pass\n */\n  __pyx_t_1 = PyTuple_New(1); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 121, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __Pyx_INCREF(((PyObject *)(&((PyTypeObject*)PyExc_Exception)[0])));\n  __Pyx_GIVEREF(((PyObject *)(&((PyTypeObject*)PyExc_Exception)[0])));\n  PyTuple_SET_ITEM(__pyx_t_1, 0, ((PyObject *)(&((PyTypeObject*)PyExc_Exception)[0])));\n  __pyx_t_2 = __Pyx_CalculateMetaclass(NULL, __pyx_t_1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 121, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  __pyx_t_3 = __Pyx_Py3MetaclassPrepare(__pyx_t_2, __pyx_t_1, __pyx_n_s_FstError, __pyx_n_s_FstError, (PyObject *) NULL, __pyx_n_s_pywrapfst_2, (PyObject *) NULL); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 121, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_3);\n  __pyx_t_4 = __Pyx_Py3ClassCreate(__pyx_t_2, __pyx_n_s_FstError, __pyx_t_1, __pyx_t_3, NULL, 0, 1); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 121, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_4);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_FstError, __pyx_t_4) < 0) __PYX_ERR(0, 121, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n  __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n  __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":126\n * \n * \n * class FstArgError(FstError, ValueError):             # <<<<<<<<<<<<<<\n * \n *   pass\n */\n  __pyx_t_1 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstError); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 126, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_t_2 = PyTuple_New(2); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 126, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  __Pyx_GIVEREF(__pyx_t_1);\n  PyTuple_SET_ITEM(__pyx_t_2, 0, __pyx_t_1);\n  __Pyx_INCREF(__pyx_builtin_ValueError);\n  __Pyx_GIVEREF(__pyx_builtin_ValueError);\n  PyTuple_SET_ITEM(__pyx_t_2, 1, __pyx_builtin_ValueError);\n  __pyx_t_1 = 0;\n  __pyx_t_1 = __Pyx_CalculateMetaclass(NULL, __pyx_t_2); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 126, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_t_3 = __Pyx_Py3MetaclassPrepare(__pyx_t_1, __pyx_t_2, __pyx_n_s_FstArgError, __pyx_n_s_FstArgError, (PyObject *) NULL, __pyx_n_s_pywrapfst_2, (PyObject *) NULL); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 126, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_3);\n  __pyx_t_4 = __Pyx_Py3ClassCreate(__pyx_t_1, __pyx_n_s_FstArgError, __pyx_t_2, __pyx_t_3, NULL, 0, 1); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 126, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_4);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_FstArgError, __pyx_t_4) < 0) __PYX_ERR(0, 126, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n  __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n\n  /* \"pywrapfst.pyx\":131\n * \n * \n * class FstBadWeightError(FstError, ValueError):             # <<<<<<<<<<<<<<\n * \n *   pass\n */\n  __pyx_t_2 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstError); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 131, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  __pyx_t_1 = PyTuple_New(2); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 131, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __Pyx_GIVEREF(__pyx_t_2);\n  PyTuple_SET_ITEM(__pyx_t_1, 0, __pyx_t_2);\n  __Pyx_INCREF(__pyx_builtin_ValueError);\n  __Pyx_GIVEREF(__pyx_builtin_ValueError);\n  PyTuple_SET_ITEM(__pyx_t_1, 1, __pyx_builtin_ValueError);\n  __pyx_t_2 = 0;\n  __pyx_t_2 = __Pyx_CalculateMetaclass(NULL, __pyx_t_1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 131, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  __pyx_t_3 = __Pyx_Py3MetaclassPrepare(__pyx_t_2, __pyx_t_1, __pyx_n_s_FstBadWeightError, __pyx_n_s_FstBadWeightError, (PyObject *) NULL, __pyx_n_s_pywrapfst_2, (PyObject *) NULL); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 131, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_3);\n  __pyx_t_4 = __Pyx_Py3ClassCreate(__pyx_t_2, __pyx_n_s_FstBadWeightError, __pyx_t_1, __pyx_t_3, NULL, 0, 1); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 131, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_4);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_FstBadWeightError, __pyx_t_4) < 0) __PYX_ERR(0, 131, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n  __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n  __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":136\n * \n * \n * class FstDeletedConstructorError(FstError, RuntimeError):             # <<<<<<<<<<<<<<\n * \n *   pass\n */\n  __pyx_t_1 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstError); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 136, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_t_2 = PyTuple_New(2); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 136, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  __Pyx_GIVEREF(__pyx_t_1);\n  PyTuple_SET_ITEM(__pyx_t_2, 0, __pyx_t_1);\n  __Pyx_INCREF(__pyx_builtin_RuntimeError);\n  __Pyx_GIVEREF(__pyx_builtin_RuntimeError);\n  PyTuple_SET_ITEM(__pyx_t_2, 1, __pyx_builtin_RuntimeError);\n  __pyx_t_1 = 0;\n  __pyx_t_1 = __Pyx_CalculateMetaclass(NULL, __pyx_t_2); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 136, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_t_3 = __Pyx_Py3MetaclassPrepare(__pyx_t_1, __pyx_t_2, __pyx_n_s_FstDeletedConstructorError, __pyx_n_s_FstDeletedConstructorError, (PyObject *) NULL, __pyx_n_s_pywrapfst_2, (PyObject *) NULL); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 136, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_3);\n  __pyx_t_4 = __Pyx_Py3ClassCreate(__pyx_t_1, __pyx_n_s_FstDeletedConstructorError, __pyx_t_2, __pyx_t_3, NULL, 0, 1); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 136, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_4);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_FstDeletedConstructorError, __pyx_t_4) < 0) __PYX_ERR(0, 136, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n  __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n\n  /* \"pywrapfst.pyx\":141\n * \n * \n * class FstIndexError(FstError, IndexError):             # <<<<<<<<<<<<<<\n * \n *   pass\n */\n  __pyx_t_2 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstError); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 141, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  __pyx_t_1 = PyTuple_New(2); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 141, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __Pyx_GIVEREF(__pyx_t_2);\n  PyTuple_SET_ITEM(__pyx_t_1, 0, __pyx_t_2);\n  __Pyx_INCREF(__pyx_builtin_IndexError);\n  __Pyx_GIVEREF(__pyx_builtin_IndexError);\n  PyTuple_SET_ITEM(__pyx_t_1, 1, __pyx_builtin_IndexError);\n  __pyx_t_2 = 0;\n  __pyx_t_2 = __Pyx_CalculateMetaclass(NULL, __pyx_t_1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 141, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  __pyx_t_3 = __Pyx_Py3MetaclassPrepare(__pyx_t_2, __pyx_t_1, __pyx_n_s_FstIndexError, __pyx_n_s_FstIndexError, (PyObject *) NULL, __pyx_n_s_pywrapfst_2, (PyObject *) NULL); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 141, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_3);\n  __pyx_t_4 = __Pyx_Py3ClassCreate(__pyx_t_2, __pyx_n_s_FstIndexError, __pyx_t_1, __pyx_t_3, NULL, 0, 1); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 141, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_4);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_FstIndexError, __pyx_t_4) < 0) __PYX_ERR(0, 141, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n  __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n  __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":146\n * \n * \n * class FstIOError(FstError, IOError):             # <<<<<<<<<<<<<<\n * \n *   pass\n */\n  __pyx_t_1 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstError); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 146, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_t_2 = PyTuple_New(2); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 146, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  __Pyx_GIVEREF(__pyx_t_1);\n  PyTuple_SET_ITEM(__pyx_t_2, 0, __pyx_t_1);\n  __Pyx_INCREF(__pyx_builtin_IOError);\n  __Pyx_GIVEREF(__pyx_builtin_IOError);\n  PyTuple_SET_ITEM(__pyx_t_2, 1, __pyx_builtin_IOError);\n  __pyx_t_1 = 0;\n  __pyx_t_1 = __Pyx_CalculateMetaclass(NULL, __pyx_t_2); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 146, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_t_3 = __Pyx_Py3MetaclassPrepare(__pyx_t_1, __pyx_t_2, __pyx_n_s_FstIOError, __pyx_n_s_FstIOError, (PyObject *) NULL, __pyx_n_s_pywrapfst_2, (PyObject *) NULL); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 146, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_3);\n  __pyx_t_4 = __Pyx_Py3ClassCreate(__pyx_t_1, __pyx_n_s_FstIOError, __pyx_t_2, __pyx_t_3, NULL, 0, 1); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 146, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_4);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_FstIOError, __pyx_t_4) < 0) __PYX_ERR(0, 146, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n  __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n\n  /* \"pywrapfst.pyx\":151\n * \n * \n * class FstOpError(FstError, RuntimeError):             # <<<<<<<<<<<<<<\n * \n *   pass\n */\n  __pyx_t_2 = __Pyx_GetModuleGlobalName(__pyx_n_s_FstError); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 151, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  __pyx_t_1 = PyTuple_New(2); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 151, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __Pyx_GIVEREF(__pyx_t_2);\n  PyTuple_SET_ITEM(__pyx_t_1, 0, __pyx_t_2);\n  __Pyx_INCREF(__pyx_builtin_RuntimeError);\n  __Pyx_GIVEREF(__pyx_builtin_RuntimeError);\n  PyTuple_SET_ITEM(__pyx_t_1, 1, __pyx_builtin_RuntimeError);\n  __pyx_t_2 = 0;\n  __pyx_t_2 = __Pyx_CalculateMetaclass(NULL, __pyx_t_1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 151, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  __pyx_t_3 = __Pyx_Py3MetaclassPrepare(__pyx_t_2, __pyx_t_1, __pyx_n_s_FstOpError, __pyx_n_s_FstOpError, (PyObject *) NULL, __pyx_n_s_pywrapfst_2, (PyObject *) NULL); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 151, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_3);\n  __pyx_t_4 = __Pyx_Py3ClassCreate(__pyx_t_2, __pyx_n_s_FstOpError, __pyx_t_1, __pyx_t_3, NULL, 0, 1); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 151, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_4);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_FstOpError, __pyx_t_4) < 0) __PYX_ERR(0, 151, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n  __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n  __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":406\n * \n *   @classmethod\n *   def Zero(cls, weight_type):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     Weight.Zero(weight_type)\n */\n  __pyx_t_1 = __Pyx_GetNameInClass((PyObject *)__pyx_ptype_9pywrapfst_Weight, __pyx_n_s_Zero); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 406, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n\n  /* \"pywrapfst.pyx\":405\n *   # C++ part out-of-class and then call it from within.\n * \n *   @classmethod             # <<<<<<<<<<<<<<\n *   def Zero(cls, weight_type):\n *     \"\"\"\n */\n  __pyx_t_2 = __Pyx_Method_ClassMethod(__pyx_t_1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 405, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  if (PyDict_SetItem((PyObject *)__pyx_ptype_9pywrapfst_Weight->tp_dict, __pyx_n_s_Zero, __pyx_t_2) < 0) __PYX_ERR(0, 406, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n  PyType_Modified(__pyx_ptype_9pywrapfst_Weight);\n\n  /* \"pywrapfst.pyx\":415\n * \n *   @classmethod\n *   def One(cls, weight_type):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     Weight.One(weight_type)\n */\n  __pyx_t_2 = __Pyx_GetNameInClass((PyObject *)__pyx_ptype_9pywrapfst_Weight, __pyx_n_s_One); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 415, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n\n  /* \"pywrapfst.pyx\":414\n *     return _Zero(weight_type)\n * \n *   @classmethod             # <<<<<<<<<<<<<<\n *   def One(cls, weight_type):\n *     \"\"\"\n */\n  __pyx_t_1 = __Pyx_Method_ClassMethod(__pyx_t_2); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 414, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n  if (PyDict_SetItem((PyObject *)__pyx_ptype_9pywrapfst_Weight->tp_dict, __pyx_n_s_One, __pyx_t_1) < 0) __PYX_ERR(0, 415, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  PyType_Modified(__pyx_ptype_9pywrapfst_Weight);\n\n  /* \"pywrapfst.pyx\":424\n * \n *   @classmethod\n *   def NoWeight(cls, weight_type):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     Weight.NoWeight(weight_type)\n */\n  __pyx_t_1 = __Pyx_GetNameInClass((PyObject *)__pyx_ptype_9pywrapfst_Weight, __pyx_n_s_NoWeight); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 424, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n\n  /* \"pywrapfst.pyx\":423\n *     return _One(weight_type)\n * \n *   @classmethod             # <<<<<<<<<<<<<<\n *   def NoWeight(cls, weight_type):\n *     \"\"\"\n */\n  __pyx_t_2 = __Pyx_Method_ClassMethod(__pyx_t_1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 423, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  if (PyDict_SetItem((PyObject *)__pyx_ptype_9pywrapfst_Weight->tp_dict, __pyx_n_s_NoWeight, __pyx_t_2) < 0) __PYX_ERR(0, 424, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n  PyType_Modified(__pyx_ptype_9pywrapfst_Weight);\n\n  /* \"pywrapfst.pyx\":456\n * \n * \n * def plus(Weight lhs, Weight rhs):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   plus(lhs, rhs)\n */\n  __pyx_t_2 = PyCFunction_NewEx(&__pyx_mdef_9pywrapfst_1plus, NULL, __pyx_n_s_pywrapfst_2); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 456, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_plus, __pyx_t_2) < 0) __PYX_ERR(0, 456, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n\n  /* \"pywrapfst.pyx\":488\n * \n * \n * def times(Weight lhs, Weight rhs):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   times(lhs, rhs)\n */\n  __pyx_t_2 = PyCFunction_NewEx(&__pyx_mdef_9pywrapfst_3times, NULL, __pyx_n_s_pywrapfst_2); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 488, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_times, __pyx_t_2) < 0) __PYX_ERR(0, 488, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n\n  /* \"pywrapfst.pyx\":520\n * \n * \n * def divide(Weight lhs, Weight rhs):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   divide(lhs, rhs)\n */\n  __pyx_t_2 = PyCFunction_NewEx(&__pyx_mdef_9pywrapfst_5divide, NULL, __pyx_n_s_pywrapfst_2); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 520, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_divide, __pyx_t_2) < 0) __PYX_ERR(0, 520, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n\n  /* \"pywrapfst.pyx\":553\n * \n * \n * def power(Weight w, size_t n):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   power(lhs, rhs)\n */\n  __pyx_t_2 = PyCFunction_NewEx(&__pyx_mdef_9pywrapfst_7power, NULL, __pyx_n_s_pywrapfst_2); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 553, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_power, __pyx_t_2) < 0) __PYX_ERR(0, 553, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n\n  /* \"pywrapfst.pyx\":889\n *   \"\"\"\n * \n *   cpdef int64 add_symbol(self, symbol, int64 key=kNoSymbol):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     add_symbol(self, symbol, key=NO_SYMBOL)\n */\n  __pyx_t_2 = __Pyx_GetModuleGlobalName(__pyx_n_s_kNoSymbol); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 889, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  __pyx_t_5 = __Pyx_PyInt_As_int64_t(__pyx_t_2); if (unlikely((__pyx_t_5 == ((int64_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 889, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n  __pyx_k__13 = __pyx_t_5;\n  __pyx_t_2 = __Pyx_GetModuleGlobalName(__pyx_n_s_kNoSymbol); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 889, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  __pyx_t_5 = __Pyx_PyInt_As_int64_t(__pyx_t_2); if (unlikely((__pyx_t_5 == ((int64_t)-1)) && PyErr_Occurred())) __PYX_ERR(0, 889, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n  __pyx_k__13 = __pyx_t_5;\n\n  /* \"pywrapfst.pyx\":966\n * \n *   @classmethod\n *   def read(cls, filename):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     SymbolTable.read(filename)\n */\n  __pyx_t_2 = __Pyx_GetNameInClass((PyObject *)__pyx_ptype_9pywrapfst_SymbolTable, __pyx_n_s_read); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 966, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n\n  /* \"pywrapfst.pyx\":965\n *     self._smart_table.reset(self._table)\n * \n *   @classmethod             # <<<<<<<<<<<<<<\n *   def read(cls, filename):\n *     \"\"\"\n */\n  __pyx_t_1 = __Pyx_Method_ClassMethod(__pyx_t_2); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 965, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n  if (PyDict_SetItem((PyObject *)__pyx_ptype_9pywrapfst_SymbolTable->tp_dict, __pyx_n_s_read, __pyx_t_1) < 0) __PYX_ERR(0, 966, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  PyType_Modified(__pyx_ptype_9pywrapfst_SymbolTable);\n\n  /* \"pywrapfst.pyx\":988\n * \n *   @classmethod\n *   def read_text(cls, filename, bool allow_negative_labels=False):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     SymbolTable.read_text(filename)\n */\n  __pyx_t_1 = __Pyx_GetNameInClass((PyObject *)__pyx_ptype_9pywrapfst_SymbolTable, __pyx_n_s_read_text); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 988, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n\n  /* \"pywrapfst.pyx\":987\n *     return _init_SymbolTable(tsyms)\n * \n *   @classmethod             # <<<<<<<<<<<<<<\n *   def read_text(cls, filename, bool allow_negative_labels=False):\n *     \"\"\"\n */\n  __pyx_t_2 = __Pyx_Method_ClassMethod(__pyx_t_1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 987, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  if (PyDict_SetItem((PyObject *)__pyx_ptype_9pywrapfst_SymbolTable->tp_dict, __pyx_n_s_read_text, __pyx_t_2) < 0) __PYX_ERR(0, 988, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n  PyType_Modified(__pyx_ptype_9pywrapfst_SymbolTable);\n\n  /* \"pywrapfst.pyx\":1015\n * \n *   @classmethod\n *   def read_fst(cls, filename, bool input_table):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     SymbolTable.read_fst(filename, input_table)\n */\n  __pyx_t_2 = __Pyx_GetNameInClass((PyObject *)__pyx_ptype_9pywrapfst_SymbolTable, __pyx_n_s_read_fst); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1015, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n\n  /* \"pywrapfst.pyx\":1014\n *     return _init_SymbolTable(tsyms)\n * \n *   @classmethod             # <<<<<<<<<<<<<<\n *   def read_fst(cls, filename, bool input_table):\n *     \"\"\"\n */\n  __pyx_t_1 = __Pyx_Method_ClassMethod(__pyx_t_2); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1014, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n  if (PyDict_SetItem((PyObject *)__pyx_ptype_9pywrapfst_SymbolTable->tp_dict, __pyx_n_s_read_fst, __pyx_t_1) < 0) __PYX_ERR(0, 1015, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  PyType_Modified(__pyx_ptype_9pywrapfst_SymbolTable);\n\n  /* \"pywrapfst.pyx\":2064\n *     return self\n * \n *   cdef void _minimize(self, float delta=fst.kShortestDelta,             # <<<<<<<<<<<<<<\n *                       bool allow_nondet=False) except *:\n *     # This runs in-place when the second argument is null.\n */\n  __pyx_k__35 = fst::kShortestDelta;\n\n  /* \"pywrapfst.pyx\":2070\n *     self._check_mutating_imethod()\n * \n *   def minimize(self, float delta=fst.kShortestDelta, bool allow_nondet=False):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     minimize(self, delta=1e-6, allow_nondet=False)\n */\n  __pyx_k__36 = fst::kShortestDelta;\n\n  /* \"pywrapfst.pyx\":2170\n *     return self\n * \n *   cdef void _prune(self, float delta=fst.kDelta, int64 nstate=fst.kNoStateId,             # <<<<<<<<<<<<<<\n *                    weight=None) except *:\n *     # Threshold is set to semiring Zero (no pruning) if no weight is specified.\n */\n  __pyx_k__37 = fst::kDelta;\n  __pyx_k__38 = fst::kNoStateId;\n\n  /* \"pywrapfst.pyx\":2179\n * \n *   def prune(self,\n *             float delta=fst.kDelta,             # <<<<<<<<<<<<<<\n *             int64 nstate=fst.kNoStateId,\n *             weight=None):\n */\n  __pyx_k__39 = fst::kDelta;\n\n  /* \"pywrapfst.pyx\":2180\n *   def prune(self,\n *             float delta=fst.kDelta,\n *             int64 nstate=fst.kNoStateId,             # <<<<<<<<<<<<<<\n *             weight=None):\n *     \"\"\"\n */\n  __pyx_k__40 = fst::kNoStateId;\n\n  /* \"pywrapfst.pyx\":2207\n * \n *   cdef void _push(self,\n *                   float delta=fst.kDelta,             # <<<<<<<<<<<<<<\n *                   bool remove_total_weight=False,\n *                   bool to_final=False) except *:\n */\n  __pyx_k__41 = fst::kDelta;\n\n  /* \"pywrapfst.pyx\":2215\n * \n *   def push(self,\n *            float delta=fst.kDelta,             # <<<<<<<<<<<<<<\n *            bool remove_total_weight=False,\n *            bool to_final=False):\n */\n  __pyx_k__42 = fst::kDelta;\n\n  /* \"pywrapfst.pyx\":2452\n *                        bool connect=True,\n *                        weight=None,\n *                        int64 nstate=fst.kNoStateId,             # <<<<<<<<<<<<<<\n *                        float delta=fst.kShortestDelta) except *:\n *     cdef fst.WeightClass wc = _get_WeightClass_or_Zero(self.weight_type(),\n */\n  __pyx_k__46 = fst::kNoStateId;\n\n  /* \"pywrapfst.pyx\":2453\n *                        weight=None,\n *                        int64 nstate=fst.kNoStateId,\n *                        float delta=fst.kShortestDelta) except *:             # <<<<<<<<<<<<<<\n *     cdef fst.WeightClass wc = _get_WeightClass_or_Zero(self.weight_type(),\n *                                                        weight)\n */\n  __pyx_k__47 = fst::kShortestDelta;\n\n  /* \"pywrapfst.pyx\":2466\n *                 bool connect=True,\n *                 weight=None,\n *                 int64 nstate=fst.kNoStateId,             # <<<<<<<<<<<<<<\n *                 float delta=fst.kShortestDelta):\n *     \"\"\"\n */\n  __pyx_k__48 = fst::kNoStateId;\n\n  /* \"pywrapfst.pyx\":2467\n *                 weight=None,\n *                 int64 nstate=fst.kNoStateId,\n *                 float delta=fst.kShortestDelta):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     rmepsilon(self, queue_type=\"auto\", connect=True, weight=None,\n */\n  __pyx_k__49 = fst::kShortestDelta;\n\n  /* \"pywrapfst.pyx\":2742\n * \n * \n * class Fst(object):             # <<<<<<<<<<<<<<\n * \n *    \"\"\"\n */\n  __pyx_t_1 = __Pyx_CalculateMetaclass(NULL, __pyx_tuple__107); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2742, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_t_2 = __Pyx_Py3MetaclassPrepare(__pyx_t_1, __pyx_tuple__107, __pyx_n_s_Fst, __pyx_n_s_Fst, (PyObject *) NULL, __pyx_n_s_pywrapfst_2, __pyx_kp_s_Fst_arc_type_standard_Construct); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 2742, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n\n  /* \"pywrapfst.pyx\":2759\n *    \"\"\"\n * \n *    def __new__(cls, arc_type=b\"standard\"):             # <<<<<<<<<<<<<<\n *     return _create_Fst(arc_type)\n * \n */\n  __pyx_t_3 = __Pyx_CyFunction_NewEx(&__pyx_mdef_9pywrapfst_3Fst_1__new__, __Pyx_CYFUNCTION_STATICMETHOD, __pyx_n_s_Fst___new, NULL, __pyx_n_s_pywrapfst_2, __pyx_d, ((PyObject *)__pyx_codeobj__109)); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 2759, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_3);\n  __Pyx_CyFunction_SetDefaultsTuple(__pyx_t_3, __pyx_tuple__110);\n  if (__Pyx_SetNameInClass(__pyx_t_2, __pyx_n_s_new, __pyx_t_3) < 0) __PYX_ERR(0, 2759, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n\n  /* \"pywrapfst.pyx\":2763\n * \n *    @staticmethod\n *    def read(filename):             # <<<<<<<<<<<<<<\n *      \"\"\"\n *      read(filename):\n */\n  __pyx_t_3 = __Pyx_CyFunction_NewEx(&__pyx_mdef_9pywrapfst_3Fst_3read, __Pyx_CYFUNCTION_STATICMETHOD, __pyx_n_s_Fst_read, NULL, __pyx_n_s_pywrapfst_2, __pyx_d, ((PyObject *)__pyx_codeobj__112)); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 2763, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_3);\n\n  /* \"pywrapfst.pyx\":2762\n *     return _create_Fst(arc_type)\n * \n *    @staticmethod             # <<<<<<<<<<<<<<\n *    def read(filename):\n *      \"\"\"\n */\n  __pyx_t_4 = __Pyx_PyObject_CallOneArg(__pyx_builtin_staticmethod, __pyx_t_3); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 2762, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_4);\n  __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n  if (__Pyx_SetNameInClass(__pyx_t_2, __pyx_n_s_read, __pyx_t_4) < 0) __PYX_ERR(0, 2763, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n\n  /* \"pywrapfst.pyx\":2781\n * \n *    @staticmethod\n *    def read_from_string(state):             # <<<<<<<<<<<<<<\n *      \"\"\"\n *      read_from_string(string, fst_type=None)\n */\n  __pyx_t_4 = __Pyx_CyFunction_NewEx(&__pyx_mdef_9pywrapfst_3Fst_5read_from_string, __Pyx_CYFUNCTION_STATICMETHOD, __pyx_n_s_Fst_read_from_string, NULL, __pyx_n_s_pywrapfst_2, __pyx_d, ((PyObject *)__pyx_codeobj__114)); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 2781, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_4);\n\n  /* \"pywrapfst.pyx\":2780\n *      return _read(filename)\n * \n *    @staticmethod             # <<<<<<<<<<<<<<\n *    def read_from_string(state):\n *      \"\"\"\n */\n  __pyx_t_3 = __Pyx_PyObject_CallOneArg(__pyx_builtin_staticmethod, __pyx_t_4); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 2780, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_3);\n  __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n  if (__Pyx_SetNameInClass(__pyx_t_2, __pyx_n_s_read_from_string_2, __pyx_t_3) < 0) __PYX_ERR(0, 2781, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n\n  /* \"pywrapfst.pyx\":2742\n * \n * \n * class Fst(object):             # <<<<<<<<<<<<<<\n * \n *    \"\"\"\n */\n  __pyx_t_3 = __Pyx_Py3ClassCreate(__pyx_t_1, __pyx_n_s_Fst, __pyx_tuple__107, __pyx_t_2, NULL, 0, 1); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 2742, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_3);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_Fst, __pyx_t_3) < 0) __PYX_ERR(0, 2742, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n  __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2805\n * \n * \n * NO_LABEL = fst.kNoLabel             # <<<<<<<<<<<<<<\n * NO_STATE_ID = fst.kNoStateId\n * # TODO(kbg): Figure out how to access static class variables so I don't have\n */\n  __pyx_t_1 = __Pyx_PyInt_From_int(fst::kNoLabel); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2805, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_NO_LABEL, __pyx_t_1) < 0) __PYX_ERR(0, 2805, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2806\n * \n * NO_LABEL = fst.kNoLabel\n * NO_STATE_ID = fst.kNoStateId             # <<<<<<<<<<<<<<\n * # TODO(kbg): Figure out how to access static class variables so I don't have\n * # to do it this way.\n */\n  __pyx_t_1 = __Pyx_PyInt_From_int(fst::kNoStateId); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2806, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_NO_STATE_ID, __pyx_t_1) < 0) __PYX_ERR(0, 2806, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2809\n * # TODO(kbg): Figure out how to access static class variables so I don't have\n * # to do it this way.\n * NO_SYMBOL = kNoSymbol             # <<<<<<<<<<<<<<\n * \n * \n */\n  __pyx_t_1 = __Pyx_GetModuleGlobalName(__pyx_n_s_kNoSymbol); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2809, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_NO_SYMBOL, __pyx_t_1) < 0) __PYX_ERR(0, 2809, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2815\n * \n * \n * EXPANDED = fst.kExpanded             # <<<<<<<<<<<<<<\n * MUTABLE = fst.kMutable\n * ERROR = fst.kError\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kExpanded); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2815, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_EXPANDED, __pyx_t_1) < 0) __PYX_ERR(0, 2815, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2816\n * \n * EXPANDED = fst.kExpanded\n * MUTABLE = fst.kMutable             # <<<<<<<<<<<<<<\n * ERROR = fst.kError\n * ACCEPTOR = fst.kAcceptor\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kMutable); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2816, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_MUTABLE, __pyx_t_1) < 0) __PYX_ERR(0, 2816, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2817\n * EXPANDED = fst.kExpanded\n * MUTABLE = fst.kMutable\n * ERROR = fst.kError             # <<<<<<<<<<<<<<\n * ACCEPTOR = fst.kAcceptor\n * NOT_ACCEPTOR = fst.kNotAcceptor\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kError); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2817, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_ERROR, __pyx_t_1) < 0) __PYX_ERR(0, 2817, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2818\n * MUTABLE = fst.kMutable\n * ERROR = fst.kError\n * ACCEPTOR = fst.kAcceptor             # <<<<<<<<<<<<<<\n * NOT_ACCEPTOR = fst.kNotAcceptor\n * I_DETERMINISTIC = fst.kIDeterministic\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kAcceptor); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2818, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_ACCEPTOR, __pyx_t_1) < 0) __PYX_ERR(0, 2818, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2819\n * ERROR = fst.kError\n * ACCEPTOR = fst.kAcceptor\n * NOT_ACCEPTOR = fst.kNotAcceptor             # <<<<<<<<<<<<<<\n * I_DETERMINISTIC = fst.kIDeterministic\n * NON_I_DETERMINISTIC = fst.kNonIDeterministic\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kNotAcceptor); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2819, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_NOT_ACCEPTOR, __pyx_t_1) < 0) __PYX_ERR(0, 2819, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2820\n * ACCEPTOR = fst.kAcceptor\n * NOT_ACCEPTOR = fst.kNotAcceptor\n * I_DETERMINISTIC = fst.kIDeterministic             # <<<<<<<<<<<<<<\n * NON_I_DETERMINISTIC = fst.kNonIDeterministic\n * O_DETERMINISTIC = fst.kODeterministic\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kIDeterministic); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2820, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_I_DETERMINISTIC, __pyx_t_1) < 0) __PYX_ERR(0, 2820, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2821\n * NOT_ACCEPTOR = fst.kNotAcceptor\n * I_DETERMINISTIC = fst.kIDeterministic\n * NON_I_DETERMINISTIC = fst.kNonIDeterministic             # <<<<<<<<<<<<<<\n * O_DETERMINISTIC = fst.kODeterministic\n * NON_O_DETERMINISTIC = fst.kNonODeterministic\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kNonIDeterministic); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2821, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_NON_I_DETERMINISTIC, __pyx_t_1) < 0) __PYX_ERR(0, 2821, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2822\n * I_DETERMINISTIC = fst.kIDeterministic\n * NON_I_DETERMINISTIC = fst.kNonIDeterministic\n * O_DETERMINISTIC = fst.kODeterministic             # <<<<<<<<<<<<<<\n * NON_O_DETERMINISTIC = fst.kNonODeterministic\n * EPSILONS = fst.kEpsilons\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kODeterministic); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2822, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_O_DETERMINISTIC, __pyx_t_1) < 0) __PYX_ERR(0, 2822, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2823\n * NON_I_DETERMINISTIC = fst.kNonIDeterministic\n * O_DETERMINISTIC = fst.kODeterministic\n * NON_O_DETERMINISTIC = fst.kNonODeterministic             # <<<<<<<<<<<<<<\n * EPSILONS = fst.kEpsilons\n * NO_EPSILONS = fst.kNoEpsilons\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kNonODeterministic); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2823, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_NON_O_DETERMINISTIC, __pyx_t_1) < 0) __PYX_ERR(0, 2823, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2824\n * O_DETERMINISTIC = fst.kODeterministic\n * NON_O_DETERMINISTIC = fst.kNonODeterministic\n * EPSILONS = fst.kEpsilons             # <<<<<<<<<<<<<<\n * NO_EPSILONS = fst.kNoEpsilons\n * I_EPSILONS = fst.kIEpsilons\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kEpsilons); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2824, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_EPSILONS, __pyx_t_1) < 0) __PYX_ERR(0, 2824, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2825\n * NON_O_DETERMINISTIC = fst.kNonODeterministic\n * EPSILONS = fst.kEpsilons\n * NO_EPSILONS = fst.kNoEpsilons             # <<<<<<<<<<<<<<\n * I_EPSILONS = fst.kIEpsilons\n * NO_I_EPSILONS = fst.kNoIEpsilons\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kNoEpsilons); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2825, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_NO_EPSILONS, __pyx_t_1) < 0) __PYX_ERR(0, 2825, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2826\n * EPSILONS = fst.kEpsilons\n * NO_EPSILONS = fst.kNoEpsilons\n * I_EPSILONS = fst.kIEpsilons             # <<<<<<<<<<<<<<\n * NO_I_EPSILONS = fst.kNoIEpsilons\n * O_EPSILONS = fst.kOEpsilons\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kIEpsilons); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2826, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_I_EPSILONS, __pyx_t_1) < 0) __PYX_ERR(0, 2826, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2827\n * NO_EPSILONS = fst.kNoEpsilons\n * I_EPSILONS = fst.kIEpsilons\n * NO_I_EPSILONS = fst.kNoIEpsilons             # <<<<<<<<<<<<<<\n * O_EPSILONS = fst.kOEpsilons\n * NO_O_EPSILONS = fst.kNoOEpsilons\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kNoIEpsilons); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2827, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_NO_I_EPSILONS, __pyx_t_1) < 0) __PYX_ERR(0, 2827, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2828\n * I_EPSILONS = fst.kIEpsilons\n * NO_I_EPSILONS = fst.kNoIEpsilons\n * O_EPSILONS = fst.kOEpsilons             # <<<<<<<<<<<<<<\n * NO_O_EPSILONS = fst.kNoOEpsilons\n * I_LABEL_SORTED = fst.kILabelSorted\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kOEpsilons); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2828, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_O_EPSILONS, __pyx_t_1) < 0) __PYX_ERR(0, 2828, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2829\n * NO_I_EPSILONS = fst.kNoIEpsilons\n * O_EPSILONS = fst.kOEpsilons\n * NO_O_EPSILONS = fst.kNoOEpsilons             # <<<<<<<<<<<<<<\n * I_LABEL_SORTED = fst.kILabelSorted\n * NOT_I_LABEL_SORTED = fst.kNotILabelSorted\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kNoOEpsilons); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2829, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_NO_O_EPSILONS, __pyx_t_1) < 0) __PYX_ERR(0, 2829, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2830\n * O_EPSILONS = fst.kOEpsilons\n * NO_O_EPSILONS = fst.kNoOEpsilons\n * I_LABEL_SORTED = fst.kILabelSorted             # <<<<<<<<<<<<<<\n * NOT_I_LABEL_SORTED = fst.kNotILabelSorted\n * O_LABEL_SORTED = fst.kOLabelSorted\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kILabelSorted); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2830, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_I_LABEL_SORTED, __pyx_t_1) < 0) __PYX_ERR(0, 2830, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2831\n * NO_O_EPSILONS = fst.kNoOEpsilons\n * I_LABEL_SORTED = fst.kILabelSorted\n * NOT_I_LABEL_SORTED = fst.kNotILabelSorted             # <<<<<<<<<<<<<<\n * O_LABEL_SORTED = fst.kOLabelSorted\n * NOT_O_LABEL_SORTED = fst.kNotOLabelSorted\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kNotILabelSorted); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2831, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_NOT_I_LABEL_SORTED, __pyx_t_1) < 0) __PYX_ERR(0, 2831, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2832\n * I_LABEL_SORTED = fst.kILabelSorted\n * NOT_I_LABEL_SORTED = fst.kNotILabelSorted\n * O_LABEL_SORTED = fst.kOLabelSorted             # <<<<<<<<<<<<<<\n * NOT_O_LABEL_SORTED = fst.kNotOLabelSorted\n * WEIGHTED = fst.kWeighted\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kOLabelSorted); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2832, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_O_LABEL_SORTED, __pyx_t_1) < 0) __PYX_ERR(0, 2832, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2833\n * NOT_I_LABEL_SORTED = fst.kNotILabelSorted\n * O_LABEL_SORTED = fst.kOLabelSorted\n * NOT_O_LABEL_SORTED = fst.kNotOLabelSorted             # <<<<<<<<<<<<<<\n * WEIGHTED = fst.kWeighted\n * UNWEIGHTED = fst.kUnweighted\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kNotOLabelSorted); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2833, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_NOT_O_LABEL_SORTED, __pyx_t_1) < 0) __PYX_ERR(0, 2833, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2834\n * O_LABEL_SORTED = fst.kOLabelSorted\n * NOT_O_LABEL_SORTED = fst.kNotOLabelSorted\n * WEIGHTED = fst.kWeighted             # <<<<<<<<<<<<<<\n * UNWEIGHTED = fst.kUnweighted\n * CYCLIC = fst.kCyclic\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kWeighted); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2834, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_WEIGHTED, __pyx_t_1) < 0) __PYX_ERR(0, 2834, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2835\n * NOT_O_LABEL_SORTED = fst.kNotOLabelSorted\n * WEIGHTED = fst.kWeighted\n * UNWEIGHTED = fst.kUnweighted             # <<<<<<<<<<<<<<\n * CYCLIC = fst.kCyclic\n * ACYCLIC = fst.kAcyclic\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kUnweighted); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2835, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_UNWEIGHTED, __pyx_t_1) < 0) __PYX_ERR(0, 2835, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2836\n * WEIGHTED = fst.kWeighted\n * UNWEIGHTED = fst.kUnweighted\n * CYCLIC = fst.kCyclic             # <<<<<<<<<<<<<<\n * ACYCLIC = fst.kAcyclic\n * INITIAL_CYCLIC = fst.kInitialCyclic\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kCyclic); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2836, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_CYCLIC, __pyx_t_1) < 0) __PYX_ERR(0, 2836, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2837\n * UNWEIGHTED = fst.kUnweighted\n * CYCLIC = fst.kCyclic\n * ACYCLIC = fst.kAcyclic             # <<<<<<<<<<<<<<\n * INITIAL_CYCLIC = fst.kInitialCyclic\n * INITIAL_ACYCLIC = fst.kInitialAcyclic\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kAcyclic); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2837, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_ACYCLIC, __pyx_t_1) < 0) __PYX_ERR(0, 2837, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2838\n * CYCLIC = fst.kCyclic\n * ACYCLIC = fst.kAcyclic\n * INITIAL_CYCLIC = fst.kInitialCyclic             # <<<<<<<<<<<<<<\n * INITIAL_ACYCLIC = fst.kInitialAcyclic\n * TOP_SORTED = fst.kTopSorted\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kInitialCyclic); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2838, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_INITIAL_CYCLIC, __pyx_t_1) < 0) __PYX_ERR(0, 2838, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2839\n * ACYCLIC = fst.kAcyclic\n * INITIAL_CYCLIC = fst.kInitialCyclic\n * INITIAL_ACYCLIC = fst.kInitialAcyclic             # <<<<<<<<<<<<<<\n * TOP_SORTED = fst.kTopSorted\n * NOT_TOP_SORTED = fst.kNotTopSorted\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kInitialAcyclic); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2839, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_INITIAL_ACYCLIC, __pyx_t_1) < 0) __PYX_ERR(0, 2839, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2840\n * INITIAL_CYCLIC = fst.kInitialCyclic\n * INITIAL_ACYCLIC = fst.kInitialAcyclic\n * TOP_SORTED = fst.kTopSorted             # <<<<<<<<<<<<<<\n * NOT_TOP_SORTED = fst.kNotTopSorted\n * ACCESSIBLE = fst.kAccessible\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kTopSorted); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2840, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_TOP_SORTED, __pyx_t_1) < 0) __PYX_ERR(0, 2840, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2841\n * INITIAL_ACYCLIC = fst.kInitialAcyclic\n * TOP_SORTED = fst.kTopSorted\n * NOT_TOP_SORTED = fst.kNotTopSorted             # <<<<<<<<<<<<<<\n * ACCESSIBLE = fst.kAccessible\n * NOT_ACCESSIBLE = fst.kNotAccessible\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kNotTopSorted); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2841, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_NOT_TOP_SORTED, __pyx_t_1) < 0) __PYX_ERR(0, 2841, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2842\n * TOP_SORTED = fst.kTopSorted\n * NOT_TOP_SORTED = fst.kNotTopSorted\n * ACCESSIBLE = fst.kAccessible             # <<<<<<<<<<<<<<\n * NOT_ACCESSIBLE = fst.kNotAccessible\n * COACCESSIBLE = fst.kCoAccessible\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kAccessible); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2842, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_ACCESSIBLE, __pyx_t_1) < 0) __PYX_ERR(0, 2842, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2843\n * NOT_TOP_SORTED = fst.kNotTopSorted\n * ACCESSIBLE = fst.kAccessible\n * NOT_ACCESSIBLE = fst.kNotAccessible             # <<<<<<<<<<<<<<\n * COACCESSIBLE = fst.kCoAccessible\n * NOT_COACCESSIBLE = fst.kNotCoAccessible\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kNotAccessible); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2843, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_NOT_ACCESSIBLE, __pyx_t_1) < 0) __PYX_ERR(0, 2843, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2844\n * ACCESSIBLE = fst.kAccessible\n * NOT_ACCESSIBLE = fst.kNotAccessible\n * COACCESSIBLE = fst.kCoAccessible             # <<<<<<<<<<<<<<\n * NOT_COACCESSIBLE = fst.kNotCoAccessible\n * STRING = fst.kString\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kCoAccessible); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2844, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_COACCESSIBLE, __pyx_t_1) < 0) __PYX_ERR(0, 2844, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2845\n * NOT_ACCESSIBLE = fst.kNotAccessible\n * COACCESSIBLE = fst.kCoAccessible\n * NOT_COACCESSIBLE = fst.kNotCoAccessible             # <<<<<<<<<<<<<<\n * STRING = fst.kString\n * NOT_STRING = fst.kNotString\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kNotCoAccessible); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2845, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_NOT_COACCESSIBLE, __pyx_t_1) < 0) __PYX_ERR(0, 2845, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2846\n * COACCESSIBLE = fst.kCoAccessible\n * NOT_COACCESSIBLE = fst.kNotCoAccessible\n * STRING = fst.kString             # <<<<<<<<<<<<<<\n * NOT_STRING = fst.kNotString\n * WEIGHTED_CYCLES = fst.kWeightedCycles\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kString); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2846, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_STRING, __pyx_t_1) < 0) __PYX_ERR(0, 2846, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2847\n * NOT_COACCESSIBLE = fst.kNotCoAccessible\n * STRING = fst.kString\n * NOT_STRING = fst.kNotString             # <<<<<<<<<<<<<<\n * WEIGHTED_CYCLES = fst.kWeightedCycles\n * UNWEIGHTED_CYCLES = fst.kUnweightedCycles\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kNotString); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2847, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_NOT_STRING, __pyx_t_1) < 0) __PYX_ERR(0, 2847, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2848\n * STRING = fst.kString\n * NOT_STRING = fst.kNotString\n * WEIGHTED_CYCLES = fst.kWeightedCycles             # <<<<<<<<<<<<<<\n * UNWEIGHTED_CYCLES = fst.kUnweightedCycles\n * NULL_PROPERTIES = fst.kNullProperties\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kWeightedCycles); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2848, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_WEIGHTED_CYCLES, __pyx_t_1) < 0) __PYX_ERR(0, 2848, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2849\n * NOT_STRING = fst.kNotString\n * WEIGHTED_CYCLES = fst.kWeightedCycles\n * UNWEIGHTED_CYCLES = fst.kUnweightedCycles             # <<<<<<<<<<<<<<\n * NULL_PROPERTIES = fst.kNullProperties\n * COPY_PROPERTIES = fst.kCopyProperties\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kUnweightedCycles); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2849, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_UNWEIGHTED_CYCLES, __pyx_t_1) < 0) __PYX_ERR(0, 2849, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2850\n * WEIGHTED_CYCLES = fst.kWeightedCycles\n * UNWEIGHTED_CYCLES = fst.kUnweightedCycles\n * NULL_PROPERTIES = fst.kNullProperties             # <<<<<<<<<<<<<<\n * COPY_PROPERTIES = fst.kCopyProperties\n * INTRINSIC_PROPERTIES = fst.kIntrinsicProperties\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kNullProperties); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2850, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_NULL_PROPERTIES, __pyx_t_1) < 0) __PYX_ERR(0, 2850, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2851\n * UNWEIGHTED_CYCLES = fst.kUnweightedCycles\n * NULL_PROPERTIES = fst.kNullProperties\n * COPY_PROPERTIES = fst.kCopyProperties             # <<<<<<<<<<<<<<\n * INTRINSIC_PROPERTIES = fst.kIntrinsicProperties\n * EXTRINSIC_PROPERTIES = fst.kExtrinsicProperties\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kCopyProperties); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2851, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_COPY_PROPERTIES, __pyx_t_1) < 0) __PYX_ERR(0, 2851, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2852\n * NULL_PROPERTIES = fst.kNullProperties\n * COPY_PROPERTIES = fst.kCopyProperties\n * INTRINSIC_PROPERTIES = fst.kIntrinsicProperties             # <<<<<<<<<<<<<<\n * EXTRINSIC_PROPERTIES = fst.kExtrinsicProperties\n * SET_START_PROPERTIES = fst.kSetStartProperties\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kIntrinsicProperties); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2852, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_INTRINSIC_PROPERTIES, __pyx_t_1) < 0) __PYX_ERR(0, 2852, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2853\n * COPY_PROPERTIES = fst.kCopyProperties\n * INTRINSIC_PROPERTIES = fst.kIntrinsicProperties\n * EXTRINSIC_PROPERTIES = fst.kExtrinsicProperties             # <<<<<<<<<<<<<<\n * SET_START_PROPERTIES = fst.kSetStartProperties\n * SET_FINAL_PROPERTIES = fst.kSetFinalProperties\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kExtrinsicProperties); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2853, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_EXTRINSIC_PROPERTIES, __pyx_t_1) < 0) __PYX_ERR(0, 2853, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2854\n * INTRINSIC_PROPERTIES = fst.kIntrinsicProperties\n * EXTRINSIC_PROPERTIES = fst.kExtrinsicProperties\n * SET_START_PROPERTIES = fst.kSetStartProperties             # <<<<<<<<<<<<<<\n * SET_FINAL_PROPERTIES = fst.kSetFinalProperties\n * ADD_STATE_PROPERTIES = fst.kAddStateProperties\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kSetStartProperties); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2854, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_SET_START_PROPERTIES, __pyx_t_1) < 0) __PYX_ERR(0, 2854, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2855\n * EXTRINSIC_PROPERTIES = fst.kExtrinsicProperties\n * SET_START_PROPERTIES = fst.kSetStartProperties\n * SET_FINAL_PROPERTIES = fst.kSetFinalProperties             # <<<<<<<<<<<<<<\n * ADD_STATE_PROPERTIES = fst.kAddStateProperties\n * ADD_ARC_PROPERTIES = fst.kAddArcProperties\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kSetFinalProperties); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2855, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_SET_FINAL_PROPERTIES, __pyx_t_1) < 0) __PYX_ERR(0, 2855, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2856\n * SET_START_PROPERTIES = fst.kSetStartProperties\n * SET_FINAL_PROPERTIES = fst.kSetFinalProperties\n * ADD_STATE_PROPERTIES = fst.kAddStateProperties             # <<<<<<<<<<<<<<\n * ADD_ARC_PROPERTIES = fst.kAddArcProperties\n * SET_ARC_PROPERTIES = fst.kSetArcProperties\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kAddStateProperties); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2856, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_ADD_STATE_PROPERTIES, __pyx_t_1) < 0) __PYX_ERR(0, 2856, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2857\n * SET_FINAL_PROPERTIES = fst.kSetFinalProperties\n * ADD_STATE_PROPERTIES = fst.kAddStateProperties\n * ADD_ARC_PROPERTIES = fst.kAddArcProperties             # <<<<<<<<<<<<<<\n * SET_ARC_PROPERTIES = fst.kSetArcProperties\n * DELETE_STATE_PROPERTIES = fst.kDeleteStatesProperties\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kAddArcProperties); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2857, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_ADD_ARC_PROPERTIES, __pyx_t_1) < 0) __PYX_ERR(0, 2857, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2858\n * ADD_STATE_PROPERTIES = fst.kAddStateProperties\n * ADD_ARC_PROPERTIES = fst.kAddArcProperties\n * SET_ARC_PROPERTIES = fst.kSetArcProperties             # <<<<<<<<<<<<<<\n * DELETE_STATE_PROPERTIES = fst.kDeleteStatesProperties\n * DELETE_ARC_PROPERTIES = fst.kDeleteArcsProperties\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kSetArcProperties); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2858, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_SET_ARC_PROPERTIES, __pyx_t_1) < 0) __PYX_ERR(0, 2858, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2859\n * ADD_ARC_PROPERTIES = fst.kAddArcProperties\n * SET_ARC_PROPERTIES = fst.kSetArcProperties\n * DELETE_STATE_PROPERTIES = fst.kDeleteStatesProperties             # <<<<<<<<<<<<<<\n * DELETE_ARC_PROPERTIES = fst.kDeleteArcsProperties\n * STATE_SORT_PROPERTIES = fst.kStateSortProperties\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kDeleteStatesProperties); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2859, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_DELETE_STATE_PROPERTIES, __pyx_t_1) < 0) __PYX_ERR(0, 2859, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2860\n * SET_ARC_PROPERTIES = fst.kSetArcProperties\n * DELETE_STATE_PROPERTIES = fst.kDeleteStatesProperties\n * DELETE_ARC_PROPERTIES = fst.kDeleteArcsProperties             # <<<<<<<<<<<<<<\n * STATE_SORT_PROPERTIES = fst.kStateSortProperties\n * ARC_SORT_PROPERTIES = fst.kArcSortProperties\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kDeleteArcsProperties); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2860, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_DELETE_ARC_PROPERTIES, __pyx_t_1) < 0) __PYX_ERR(0, 2860, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2861\n * DELETE_STATE_PROPERTIES = fst.kDeleteStatesProperties\n * DELETE_ARC_PROPERTIES = fst.kDeleteArcsProperties\n * STATE_SORT_PROPERTIES = fst.kStateSortProperties             # <<<<<<<<<<<<<<\n * ARC_SORT_PROPERTIES = fst.kArcSortProperties\n * I_LABEL_INVARIANT_PROPERTIES = fst.kILabelInvariantProperties\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kStateSortProperties); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2861, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_STATE_SORT_PROPERTIES, __pyx_t_1) < 0) __PYX_ERR(0, 2861, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2862\n * DELETE_ARC_PROPERTIES = fst.kDeleteArcsProperties\n * STATE_SORT_PROPERTIES = fst.kStateSortProperties\n * ARC_SORT_PROPERTIES = fst.kArcSortProperties             # <<<<<<<<<<<<<<\n * I_LABEL_INVARIANT_PROPERTIES = fst.kILabelInvariantProperties\n * O_LABEL_INVARIANT_PROPERTIES = fst.kOLabelInvariantProperties\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kArcSortProperties); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2862, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_ARC_SORT_PROPERTIES, __pyx_t_1) < 0) __PYX_ERR(0, 2862, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2863\n * STATE_SORT_PROPERTIES = fst.kStateSortProperties\n * ARC_SORT_PROPERTIES = fst.kArcSortProperties\n * I_LABEL_INVARIANT_PROPERTIES = fst.kILabelInvariantProperties             # <<<<<<<<<<<<<<\n * O_LABEL_INVARIANT_PROPERTIES = fst.kOLabelInvariantProperties\n * WEIGHT_INVARIANT_PROPERTIES = fst.kWeightInvariantProperties\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kILabelInvariantProperties); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2863, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_I_LABEL_INVARIANT_PROPERTIES, __pyx_t_1) < 0) __PYX_ERR(0, 2863, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2864\n * ARC_SORT_PROPERTIES = fst.kArcSortProperties\n * I_LABEL_INVARIANT_PROPERTIES = fst.kILabelInvariantProperties\n * O_LABEL_INVARIANT_PROPERTIES = fst.kOLabelInvariantProperties             # <<<<<<<<<<<<<<\n * WEIGHT_INVARIANT_PROPERTIES = fst.kWeightInvariantProperties\n * ADD_SUPERFINAL_PROPERTIES = fst.kAddSuperFinalProperties\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kOLabelInvariantProperties); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2864, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_O_LABEL_INVARIANT_PROPERTIES, __pyx_t_1) < 0) __PYX_ERR(0, 2864, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2865\n * I_LABEL_INVARIANT_PROPERTIES = fst.kILabelInvariantProperties\n * O_LABEL_INVARIANT_PROPERTIES = fst.kOLabelInvariantProperties\n * WEIGHT_INVARIANT_PROPERTIES = fst.kWeightInvariantProperties             # <<<<<<<<<<<<<<\n * ADD_SUPERFINAL_PROPERTIES = fst.kAddSuperFinalProperties\n * RM_SUPERFINAL_PROPERTIES = fst.kRmSuperFinalProperties\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kWeightInvariantProperties); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2865, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_WEIGHT_INVARIANT_PROPERTIES, __pyx_t_1) < 0) __PYX_ERR(0, 2865, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2866\n * O_LABEL_INVARIANT_PROPERTIES = fst.kOLabelInvariantProperties\n * WEIGHT_INVARIANT_PROPERTIES = fst.kWeightInvariantProperties\n * ADD_SUPERFINAL_PROPERTIES = fst.kAddSuperFinalProperties             # <<<<<<<<<<<<<<\n * RM_SUPERFINAL_PROPERTIES = fst.kRmSuperFinalProperties\n * BINARY_PROPERTIES = fst.kBinaryProperties\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kAddSuperFinalProperties); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2866, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_ADD_SUPERFINAL_PROPERTIES, __pyx_t_1) < 0) __PYX_ERR(0, 2866, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2867\n * WEIGHT_INVARIANT_PROPERTIES = fst.kWeightInvariantProperties\n * ADD_SUPERFINAL_PROPERTIES = fst.kAddSuperFinalProperties\n * RM_SUPERFINAL_PROPERTIES = fst.kRmSuperFinalProperties             # <<<<<<<<<<<<<<\n * BINARY_PROPERTIES = fst.kBinaryProperties\n * TRINARY_PROPERTIES = fst.kTrinaryProperties\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kRmSuperFinalProperties); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2867, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_RM_SUPERFINAL_PROPERTIES, __pyx_t_1) < 0) __PYX_ERR(0, 2867, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2868\n * ADD_SUPERFINAL_PROPERTIES = fst.kAddSuperFinalProperties\n * RM_SUPERFINAL_PROPERTIES = fst.kRmSuperFinalProperties\n * BINARY_PROPERTIES = fst.kBinaryProperties             # <<<<<<<<<<<<<<\n * TRINARY_PROPERTIES = fst.kTrinaryProperties\n * POS_TRINARY_PROPERTIES = fst.kPosTrinaryProperties\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kBinaryProperties); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2868, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_BINARY_PROPERTIES, __pyx_t_1) < 0) __PYX_ERR(0, 2868, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2869\n * RM_SUPERFINAL_PROPERTIES = fst.kRmSuperFinalProperties\n * BINARY_PROPERTIES = fst.kBinaryProperties\n * TRINARY_PROPERTIES = fst.kTrinaryProperties             # <<<<<<<<<<<<<<\n * POS_TRINARY_PROPERTIES = fst.kPosTrinaryProperties\n * NEG_TRINARY_PROPERTIES = fst.kNegTrinaryProperties\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kTrinaryProperties); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2869, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_TRINARY_PROPERTIES, __pyx_t_1) < 0) __PYX_ERR(0, 2869, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2870\n * BINARY_PROPERTIES = fst.kBinaryProperties\n * TRINARY_PROPERTIES = fst.kTrinaryProperties\n * POS_TRINARY_PROPERTIES = fst.kPosTrinaryProperties             # <<<<<<<<<<<<<<\n * NEG_TRINARY_PROPERTIES = fst.kNegTrinaryProperties\n * FST_PROPERTIES = fst.kFstProperties\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kPosTrinaryProperties); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2870, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_POS_TRINARY_PROPERTIES, __pyx_t_1) < 0) __PYX_ERR(0, 2870, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2871\n * TRINARY_PROPERTIES = fst.kTrinaryProperties\n * POS_TRINARY_PROPERTIES = fst.kPosTrinaryProperties\n * NEG_TRINARY_PROPERTIES = fst.kNegTrinaryProperties             # <<<<<<<<<<<<<<\n * FST_PROPERTIES = fst.kFstProperties\n * \n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kNegTrinaryProperties); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2871, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_NEG_TRINARY_PROPERTIES, __pyx_t_1) < 0) __PYX_ERR(0, 2871, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2872\n * POS_TRINARY_PROPERTIES = fst.kPosTrinaryProperties\n * NEG_TRINARY_PROPERTIES = fst.kNegTrinaryProperties\n * FST_PROPERTIES = fst.kFstProperties             # <<<<<<<<<<<<<<\n * \n * \n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint64_t(fst::kFstProperties); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2872, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_FST_PROPERTIES, __pyx_t_1) < 0) __PYX_ERR(0, 2872, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2878\n * \n * \n * ARC_I_LABEL_VALUE = fst.kArcILabelValue             # <<<<<<<<<<<<<<\n * ARC_O_LABEL_VALUE = fst.kArcOLabelValue\n * ARC_WEIGHT_VALUE = fst.kArcWeightValue\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint32_t(fst::kArcILabelValue); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2878, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_ARC_I_LABEL_VALUE, __pyx_t_1) < 0) __PYX_ERR(0, 2878, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2879\n * \n * ARC_I_LABEL_VALUE = fst.kArcILabelValue\n * ARC_O_LABEL_VALUE = fst.kArcOLabelValue             # <<<<<<<<<<<<<<\n * ARC_WEIGHT_VALUE = fst.kArcWeightValue\n * ARC_NEXT_STATE_VALUE = fst.kArcNextStateValue\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint32_t(fst::kArcOLabelValue); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2879, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_ARC_O_LABEL_VALUE, __pyx_t_1) < 0) __PYX_ERR(0, 2879, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2880\n * ARC_I_LABEL_VALUE = fst.kArcILabelValue\n * ARC_O_LABEL_VALUE = fst.kArcOLabelValue\n * ARC_WEIGHT_VALUE = fst.kArcWeightValue             # <<<<<<<<<<<<<<\n * ARC_NEXT_STATE_VALUE = fst.kArcNextStateValue\n * ARC_NO_CACHE = fst.kArcNoCache\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint32_t(fst::kArcWeightValue); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2880, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_ARC_WEIGHT_VALUE, __pyx_t_1) < 0) __PYX_ERR(0, 2880, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2881\n * ARC_O_LABEL_VALUE = fst.kArcOLabelValue\n * ARC_WEIGHT_VALUE = fst.kArcWeightValue\n * ARC_NEXT_STATE_VALUE = fst.kArcNextStateValue             # <<<<<<<<<<<<<<\n * ARC_NO_CACHE = fst.kArcNoCache\n * ARC_VALUE_FLAGS = fst.kArcValueFlags\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint32_t(fst::kArcNextStateValue); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2881, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_ARC_NEXT_STATE_VALUE, __pyx_t_1) < 0) __PYX_ERR(0, 2881, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2882\n * ARC_WEIGHT_VALUE = fst.kArcWeightValue\n * ARC_NEXT_STATE_VALUE = fst.kArcNextStateValue\n * ARC_NO_CACHE = fst.kArcNoCache             # <<<<<<<<<<<<<<\n * ARC_VALUE_FLAGS = fst.kArcValueFlags\n * ARC_FLAGS = fst.kArcFlags\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint32_t(fst::kArcNoCache); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2882, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_ARC_NO_CACHE, __pyx_t_1) < 0) __PYX_ERR(0, 2882, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2883\n * ARC_NEXT_STATE_VALUE = fst.kArcNextStateValue\n * ARC_NO_CACHE = fst.kArcNoCache\n * ARC_VALUE_FLAGS = fst.kArcValueFlags             # <<<<<<<<<<<<<<\n * ARC_FLAGS = fst.kArcFlags\n * \n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint32_t(fst::kArcValueFlags); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2883, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_ARC_VALUE_FLAGS, __pyx_t_1) < 0) __PYX_ERR(0, 2883, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2884\n * ARC_NO_CACHE = fst.kArcNoCache\n * ARC_VALUE_FLAGS = fst.kArcValueFlags\n * ARC_FLAGS = fst.kArcFlags             # <<<<<<<<<<<<<<\n * \n * \n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint32_t(fst::kArcFlags); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2884, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_ARC_FLAGS, __pyx_t_1) < 0) __PYX_ERR(0, 2884, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2890\n * \n * \n * ENCODE_LABELS = fst.kEncodeLabels             # <<<<<<<<<<<<<<\n * ENCODE_WEIGHTS = fst.kEncodeWeights\n * ENCODE_FLAGS = fst.kEncodeFlags\n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint32_t(fst::kEncodeLabels); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2890, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_ENCODE_LABELS, __pyx_t_1) < 0) __PYX_ERR(0, 2890, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2891\n * \n * ENCODE_LABELS = fst.kEncodeLabels\n * ENCODE_WEIGHTS = fst.kEncodeWeights             # <<<<<<<<<<<<<<\n * ENCODE_FLAGS = fst.kEncodeFlags\n * \n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint32_t(fst::kEncodeWeights); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2891, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_ENCODE_WEIGHTS, __pyx_t_1) < 0) __PYX_ERR(0, 2891, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":2892\n * ENCODE_LABELS = fst.kEncodeLabels\n * ENCODE_WEIGHTS = fst.kEncodeWeights\n * ENCODE_FLAGS = fst.kEncodeFlags             # <<<<<<<<<<<<<<\n * \n * \n */\n  __pyx_t_1 = __Pyx_PyInt_From_uint32_t(fst::kEncodeFlags); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 2892, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_ENCODE_FLAGS, __pyx_t_1) < 0) __PYX_ERR(0, 2892, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":3258\n * \n * cdef _Fst _map(_Fst ifst,\n *                float delta=fst.kDelta,             # <<<<<<<<<<<<<<\n *                map_type=b\"identity\",\n *                double power=1.,\n */\n  __pyx_k__67 = fst::kDelta;\n\n  /* \"pywrapfst.pyx\":3272\n * \n * cpdef _Fst arcmap(_Fst ifst,\n *                   float delta=fst.kDelta,             # <<<<<<<<<<<<<<\n *                   map_type=b\"identity\",\n *                   double power=1.,\n */\n  __pyx_k__68 = fst::kDelta;\n\n  /* \"pywrapfst.pyx\":3271\n * \n * \n * cpdef _Fst arcmap(_Fst ifst,             # <<<<<<<<<<<<<<\n *                   float delta=fst.kDelta,\n *                   map_type=b\"identity\",\n */\n  __pyx_k__68 = fst::kDelta;\n\n  /* \"pywrapfst.pyx\":3384\n * \n * cpdef _MutableFst determinize(_Fst ifst,\n *                               float delta=fst.kShortestDelta,             # <<<<<<<<<<<<<<\n *                               det_type=b\"functional\",\n *                               int64 nstate=fst.kNoStateId,\n */\n  __pyx_k__69 = fst::kShortestDelta;\n\n  /* \"pywrapfst.pyx\":3386\n *                               float delta=fst.kShortestDelta,\n *                               det_type=b\"functional\",\n *                               int64 nstate=fst.kNoStateId,             # <<<<<<<<<<<<<<\n *                               int64 subsequential_label=0,\n *                               weight=None,\n */\n  __pyx_k__70 = fst::kNoStateId;\n\n  /* \"pywrapfst.pyx\":3384\n * \n * cpdef _MutableFst determinize(_Fst ifst,\n *                               float delta=fst.kShortestDelta,             # <<<<<<<<<<<<<<\n *                               det_type=b\"functional\",\n *                               int64 nstate=fst.kNoStateId,\n */\n  __pyx_k__69 = fst::kShortestDelta;\n\n  /* \"pywrapfst.pyx\":3386\n *                               float delta=fst.kShortestDelta,\n *                               det_type=b\"functional\",\n *                               int64 nstate=fst.kNoStateId,             # <<<<<<<<<<<<<<\n *                               int64 subsequential_label=0,\n *                               weight=None,\n */\n  __pyx_k__70 = fst::kNoStateId;\n\n  /* \"pywrapfst.pyx\":3477\n * \n * cpdef _MutableFst disambiguate(_Fst ifst,\n *                                float delta=fst.kDelta,             # <<<<<<<<<<<<<<\n *                                int64 nstate=fst.kNoStateId,\n *                                int64 subsequential_label=0,\n */\n  __pyx_k__71 = fst::kDelta;\n\n  /* \"pywrapfst.pyx\":3478\n * cpdef _MutableFst disambiguate(_Fst ifst,\n *                                float delta=fst.kDelta,\n *                                int64 nstate=fst.kNoStateId,             # <<<<<<<<<<<<<<\n *                                int64 subsequential_label=0,\n *                                weight=None):\n */\n  __pyx_k__72 = fst::kNoStateId;\n\n  /* \"pywrapfst.pyx\":3477\n * \n * cpdef _MutableFst disambiguate(_Fst ifst,\n *                                float delta=fst.kDelta,             # <<<<<<<<<<<<<<\n *                                int64 nstate=fst.kNoStateId,\n *                                int64 subsequential_label=0,\n */\n  __pyx_k__71 = fst::kDelta;\n\n  /* \"pywrapfst.pyx\":3478\n * cpdef _MutableFst disambiguate(_Fst ifst,\n *                                float delta=fst.kDelta,\n *                                int64 nstate=fst.kNoStateId,             # <<<<<<<<<<<<<<\n *                                int64 subsequential_label=0,\n *                                weight=None):\n */\n  __pyx_k__72 = fst::kNoStateId;\n\n  /* \"pywrapfst.pyx\":3548\n * \n * \n * cpdef bool equal(_Fst ifst1, _Fst ifst2, float delta=fst.kDelta):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   equal(ifst1, ifst2, delta=0.0009765625)\n */\n  __pyx_k__73 = fst::kDelta;\n  __pyx_k__73 = fst::kDelta;\n\n  /* \"pywrapfst.pyx\":3571\n * \n * \n * cpdef bool equivalent(_Fst ifst1, _Fst ifst2, float delta=fst.kDelta) except *:             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   equivalent(ifst1, ifst2, delta=0.0009765625)\n */\n  __pyx_k__74 = fst::kDelta;\n  __pyx_k__74 = fst::kDelta;\n\n  /* \"pywrapfst.pyx\":3627\n * \n * \n * cpdef bool isomorphic(_Fst ifst1, _Fst ifst2, float delta=fst.kDelta):             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   isomorphic(ifst1, ifst2, delta=0.0009765625)\n */\n  __pyx_k__75 = fst::kDelta;\n  __pyx_k__75 = fst::kDelta;\n\n  /* \"pywrapfst.pyx\":3654\n * \n * cpdef _MutableFst prune(_Fst ifst,\n *                         float delta=fst.kDelta,             # <<<<<<<<<<<<<<\n *                         int64 nstate=fst.kNoStateId,\n *                         weight=None):\n */\n  __pyx_k__76 = fst::kDelta;\n\n  /* \"pywrapfst.pyx\":3655\n * cpdef _MutableFst prune(_Fst ifst,\n *                         float delta=fst.kDelta,\n *                         int64 nstate=fst.kNoStateId,             # <<<<<<<<<<<<<<\n *                         weight=None):\n *   \"\"\"\n */\n  __pyx_k__77 = fst::kNoStateId;\n\n  /* \"pywrapfst.pyx\":3654\n * \n * cpdef _MutableFst prune(_Fst ifst,\n *                         float delta=fst.kDelta,             # <<<<<<<<<<<<<<\n *                         int64 nstate=fst.kNoStateId,\n *                         weight=None):\n */\n  __pyx_k__76 = fst::kDelta;\n\n  /* \"pywrapfst.pyx\":3655\n * cpdef _MutableFst prune(_Fst ifst,\n *                         float delta=fst.kDelta,\n *                         int64 nstate=fst.kNoStateId,             # <<<<<<<<<<<<<<\n *                         weight=None):\n *   \"\"\"\n */\n  __pyx_k__77 = fst::kNoStateId;\n\n  /* \"pywrapfst.pyx\":3687\n * \n * cpdef _MutableFst push(_Fst ifst,\n *                        float delta=fst.kDelta,             # <<<<<<<<<<<<<<\n *                        bool push_weights=False,\n *                        bool push_labels=False,\n */\n  __pyx_k__78 = fst::kDelta;\n\n  /* \"pywrapfst.pyx\":3686\n * \n * \n * cpdef _MutableFst push(_Fst ifst,             # <<<<<<<<<<<<<<\n *                        float delta=fst.kDelta,\n *                        bool push_weights=False,\n */\n  __pyx_k__78 = fst::kDelta;\n\n  /* \"pywrapfst.pyx\":3743\n *                           _Fst ifst2,\n *                           int32 npath=1,\n *                           float delta=fst.kDelta,             # <<<<<<<<<<<<<<\n *                           time_t seed=0,\n *                           select=b\"uniform\",\n */\n  __pyx_k__79 = fst::kDelta;\n\n  /* \"pywrapfst.pyx\":3746\n *                           time_t seed=0,\n *                           select=b\"uniform\",\n *                           int32 max_length=INT32_MAX) except *:             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   randequivalent(ifst1, ifst2, npath=1, delta=0.0009765625, seed=0,\n */\n  __pyx_k__80 = INT32_MAX;\n\n  /* \"pywrapfst.pyx\":3743\n *                           _Fst ifst2,\n *                           int32 npath=1,\n *                           float delta=fst.kDelta,             # <<<<<<<<<<<<<<\n *                           time_t seed=0,\n *                           select=b\"uniform\",\n */\n  __pyx_k__79 = fst::kDelta;\n\n  /* \"pywrapfst.pyx\":3746\n *                           time_t seed=0,\n *                           select=b\"uniform\",\n *                           int32 max_length=INT32_MAX) except *:             # <<<<<<<<<<<<<<\n *   \"\"\"\n *   randequivalent(ifst1, ifst2, npath=1, delta=0.0009765625, seed=0,\n */\n  __pyx_k__80 = INT32_MAX;\n\n  /* \"pywrapfst.pyx\":3790\n *                           time_t seed=0,\n *                           select=b\"uniform\",\n *                           int32 max_length=INT32_MAX,             # <<<<<<<<<<<<<<\n *                           bool weighted=False,\n *                           bool remove_total_weight=False):\n */\n  __pyx_k__81 = INT32_MAX;\n\n  /* \"pywrapfst.pyx\":3786\n * \n * \n * cpdef _MutableFst randgen(_Fst ifst,             # <<<<<<<<<<<<<<\n *                           int32 npath=1,\n *                           time_t seed=0,\n */\n  __pyx_k__81 = INT32_MAX;\n\n  /* \"pywrapfst.pyx\":3928\n * \n * cdef vector[fst.WeightClass] *_shortestdistance(_Fst ifst,\n *                                                 float delta=fst.kShortestDelta,             # <<<<<<<<<<<<<<\n *                                                 int64 nstate=fst.kNoStateId,\n *                                                 queue_type=b\"auto\",\n */\n  __pyx_k__82 = fst::kShortestDelta;\n\n  /* \"pywrapfst.pyx\":3929\n * cdef vector[fst.WeightClass] *_shortestdistance(_Fst ifst,\n *                                                 float delta=fst.kShortestDelta,\n *                                                 int64 nstate=fst.kNoStateId,             # <<<<<<<<<<<<<<\n *                                                 queue_type=b\"auto\",\n *                                                 bool reverse=False) except *:\n */\n  __pyx_k__83 = fst::kNoStateId;\n\n  /* \"pywrapfst.pyx\":3950\n * \n * def shortestdistance(_Fst ifst,\n *                      float delta=fst.kShortestDelta,             # <<<<<<<<<<<<<<\n *                      int64 nstate=fst.kNoStateId,\n *                      queue_type=b\"auto\",\n */\n  __pyx_k__84 = fst::kShortestDelta;\n\n  /* \"pywrapfst.pyx\":3951\n * def shortestdistance(_Fst ifst,\n *                      float delta=fst.kShortestDelta,\n *                      int64 nstate=fst.kNoStateId,             # <<<<<<<<<<<<<<\n *                      queue_type=b\"auto\",\n *                      bool reverse=False):\n */\n  __pyx_k__85 = fst::kNoStateId;\n\n  /* \"pywrapfst.pyx\":3949\n * \n * \n * def shortestdistance(_Fst ifst,             # <<<<<<<<<<<<<<\n *                      float delta=fst.kShortestDelta,\n *                      int64 nstate=fst.kNoStateId,\n */\n  __pyx_t_1 = PyCFunction_NewEx(&__pyx_mdef_9pywrapfst_51shortestdistance, NULL, __pyx_n_s_pywrapfst_2); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 3949, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_shortestdistance, __pyx_t_1) < 0) __PYX_ERR(0, 3949, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":3987\n * \n * cpdef _MutableFst shortestpath(_Fst ifst,\n *                                float delta=fst.kShortestDelta,             # <<<<<<<<<<<<<<\n *                                int32 nshortest=1,\n *                                int64 nstate=fst.kNoStateId,\n */\n  __pyx_k__86 = fst::kShortestDelta;\n\n  /* \"pywrapfst.pyx\":3989\n *                                float delta=fst.kShortestDelta,\n *                                int32 nshortest=1,\n *                                int64 nstate=fst.kNoStateId,             # <<<<<<<<<<<<<<\n *                                queue_type=b\"auto\",\n *                                bool unique=False,\n */\n  __pyx_k__87 = fst::kNoStateId;\n\n  /* \"pywrapfst.pyx\":3987\n * \n * cpdef _MutableFst shortestpath(_Fst ifst,\n *                                float delta=fst.kShortestDelta,             # <<<<<<<<<<<<<<\n *                                int32 nshortest=1,\n *                                int64 nstate=fst.kNoStateId,\n */\n  __pyx_k__86 = fst::kShortestDelta;\n\n  /* \"pywrapfst.pyx\":3989\n *                                float delta=fst.kShortestDelta,\n *                                int32 nshortest=1,\n *                                int64 nstate=fst.kNoStateId,             # <<<<<<<<<<<<<<\n *                                queue_type=b\"auto\",\n *                                bool unique=False,\n */\n  __pyx_k__87 = fst::kNoStateId;\n\n  /* \"pywrapfst.pyx\":4140\n * \n *   def __cinit__(self,\n *                 string fst_type=b\"vector\",             # <<<<<<<<<<<<<<\n *                 string arc_type=b\"standard\",\n *                 SymbolTable isymbols=None,\n */\n  __pyx_t_6 = __pyx_convert_string_from_py_std__in_string(__pyx_n_b_vector); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 4140, __pyx_L1_error)\n  __pyx_k__88 = __pyx_t_6;\n\n  /* \"pywrapfst.pyx\":4141\n *   def __cinit__(self,\n *                 string fst_type=b\"vector\",\n *                 string arc_type=b\"standard\",             # <<<<<<<<<<<<<<\n *                 SymbolTable isymbols=None,\n *                 SymbolTable osymbols=None,\n */\n  __pyx_t_6 = __pyx_convert_string_from_py_std__in_string(__pyx_n_b_standard); if (unlikely(PyErr_Occurred())) __PYX_ERR(0, 4141, __pyx_L1_error)\n  __pyx_k__89 = __pyx_t_6;\n\n  /* \"pywrapfst.pyx\":4239\n * \n *   @classmethod\n *   def open(cls, *filenames):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     FarReader.open(*filenames)\n */\n  __pyx_t_1 = __Pyx_GetNameInClass((PyObject *)__pyx_ptype_9pywrapfst_FarReader, __pyx_n_s_open); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4239, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n\n  /* \"pywrapfst.pyx\":4238\n *     return \"<{} FarReader at 0x{:x}>\".format(self.far_type(), id(self))\n * \n *   @classmethod             # <<<<<<<<<<<<<<\n *   def open(cls, *filenames):\n *     \"\"\"\n */\n  __pyx_t_2 = __Pyx_Method_ClassMethod(__pyx_t_1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 4238, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  if (PyDict_SetItem((PyObject *)__pyx_ptype_9pywrapfst_FarReader->tp_dict, __pyx_n_s_open, __pyx_t_2) < 0) __PYX_ERR(0, 4239, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n  PyType_Modified(__pyx_ptype_9pywrapfst_FarReader);\n\n  /* \"pywrapfst.pyx\":4389\n * \n *   @classmethod\n *   def create(cls, filename, arc_type=b\"standard\", far_type=b\"default\"):             # <<<<<<<<<<<<<<\n *     \"\"\"\n *     FarWriter.\n */\n  __pyx_t_2 = __Pyx_GetNameInClass((PyObject *)__pyx_ptype_9pywrapfst_FarWriter, __pyx_n_s_create); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 4389, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n\n  /* \"pywrapfst.pyx\":4388\n *     return \"<{} FarWriter at 0x{:x}>\".format(self.far_type(), id(self))\n * \n *   @classmethod             # <<<<<<<<<<<<<<\n *   def create(cls, filename, arc_type=b\"standard\", far_type=b\"default\"):\n *     \"\"\"\n */\n  __pyx_t_1 = __Pyx_Method_ClassMethod(__pyx_t_2); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4388, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n  if (PyDict_SetItem((PyObject *)__pyx_ptype_9pywrapfst_FarWriter->tp_dict, __pyx_n_s_create, __pyx_t_1) < 0) __PYX_ERR(0, 4389, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  PyType_Modified(__pyx_ptype_9pywrapfst_FarWriter);\n\n  /* \"pywrapfst.pyx\":4488\n * \n * \n * _fst_error_fatal_old = fst.FLAGS_fst_error_fatal             # <<<<<<<<<<<<<<\n * fst.FLAGS_fst_error_fatal = False\n * \n */\n  __pyx_t_1 = __Pyx_PyBool_FromLong(FLAGS_fst_error_fatal); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4488, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_fst_error_fatal_old, __pyx_t_1) < 0) __PYX_ERR(0, 4488, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":4489\n * \n * _fst_error_fatal_old = fst.FLAGS_fst_error_fatal\n * fst.FLAGS_fst_error_fatal = False             # <<<<<<<<<<<<<<\n * \n * \n */\n  FLAGS_fst_error_fatal = 0;\n\n  /* \"pywrapfst.pyx\":4492\n * \n * \n * @atexit.register             # <<<<<<<<<<<<<<\n * def _reset_fst_error_fatal():\n *   fst.FLAGS_fst_error_fatal = _fst_error_fatal_old\n */\n  __pyx_t_1 = __Pyx_GetModuleGlobalName(__pyx_n_s_atexit); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4492, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n  __pyx_t_2 = __Pyx_PyObject_GetAttrStr(__pyx_t_1, __pyx_n_s_register); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 4492, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_2);\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n  /* \"pywrapfst.pyx\":4493\n * \n * @atexit.register\n * def _reset_fst_error_fatal():             # <<<<<<<<<<<<<<\n *   fst.FLAGS_fst_error_fatal = _fst_error_fatal_old\n * \n */\n  __pyx_t_1 = PyCFunction_NewEx(&__pyx_mdef_9pywrapfst_59_reset_fst_error_fatal, NULL, __pyx_n_s_pywrapfst_2); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 4493, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_1);\n\n  /* \"pywrapfst.pyx\":4492\n * \n * \n * @atexit.register             # <<<<<<<<<<<<<<\n * def _reset_fst_error_fatal():\n *   fst.FLAGS_fst_error_fatal = _fst_error_fatal_old\n */\n  __pyx_t_3 = __Pyx_PyObject_CallOneArg(__pyx_t_2, __pyx_t_1); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 4492, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_3);\n  __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_reset_fst_error_fatal, __pyx_t_3) < 0) __PYX_ERR(0, 4493, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n\n  /* \"pywrapfst.pyx\":1\n * #cython: nonecheck=True             # <<<<<<<<<<<<<<\n * # Licensed under the Apache License, Version 2.0 (the \"License\");\n * # you may not use this file except in compliance with the License.\n */\n  __pyx_t_3 = __Pyx_PyDict_NewPresized(0); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 1, __pyx_L1_error)\n  __Pyx_GOTREF(__pyx_t_3);\n  if (PyDict_SetItem(__pyx_d, __pyx_n_s_test_2, __pyx_t_3) < 0) __PYX_ERR(0, 1, __pyx_L1_error)\n  __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n\n  /* \"vector.from_py\":45\n * \n * @cname(\"__pyx_convert_vector_from_py_std_3a__3a_string\")\n * cdef vector[X] __pyx_convert_vector_from_py_std_3a__3a_string(object o) except *:             # <<<<<<<<<<<<<<\n *     cdef vector[X] v\n *     for item in o:\n */\n\n  /*--- Wrapped vars code ---*/\n\n  goto __pyx_L0;\n  __pyx_L1_error:;\n  __Pyx_XDECREF(__pyx_t_1);\n  __Pyx_XDECREF(__pyx_t_2);\n  __Pyx_XDECREF(__pyx_t_3);\n  __Pyx_XDECREF(__pyx_t_4);\n  if (__pyx_m) {\n    if (__pyx_d) {\n      __Pyx_AddTraceback(\"init pywrapfst\", 0, __pyx_lineno, __pyx_filename);\n    }\n    Py_DECREF(__pyx_m); __pyx_m = 0;\n  } else if (!PyErr_Occurred()) {\n    PyErr_SetString(PyExc_ImportError, \"init pywrapfst\");\n  }\n  __pyx_L0:;\n  __Pyx_RefNannyFinishContext();\n  #if CYTHON_PEP489_MULTI_PHASE_INIT\n  return (__pyx_m != NULL) ? 0 : -1;\n  #elif PY_MAJOR_VERSION >= 3\n  return __pyx_m;\n  #else\n  return;\n  #endif\n}\n\n/* --- Runtime support code --- */\n/* Refnanny */\n#if CYTHON_REFNANNY\nstatic __Pyx_RefNannyAPIStruct *__Pyx_RefNannyImportAPI(const char *modname) {\n    PyObject *m = NULL, *p = NULL;\n    void *r = NULL;\n    m = PyImport_ImportModule((char *)modname);\n    if (!m) goto end;\n    p = PyObject_GetAttrString(m, (char *)\"RefNannyAPI\");\n    if (!p) goto end;\n    r = PyLong_AsVoidPtr(p);\nend:\n    Py_XDECREF(p);\n    Py_XDECREF(m);\n    return (__Pyx_RefNannyAPIStruct *)r;\n}\n#endif\n\n/* PyObjectGetAttrStr */\n#if CYTHON_USE_TYPE_SLOTS\nstatic CYTHON_INLINE PyObject* __Pyx_PyObject_GetAttrStr(PyObject* obj, PyObject* attr_name) {\n    PyTypeObject* tp = Py_TYPE(obj);\n    if (likely(tp->tp_getattro))\n        return tp->tp_getattro(obj, attr_name);\n#if PY_MAJOR_VERSION < 3\n    if (likely(tp->tp_getattr))\n        return tp->tp_getattr(obj, PyString_AS_STRING(attr_name));\n#endif\n    return PyObject_GetAttr(obj, attr_name);\n}\n#endif\n\n/* GetBuiltinName */\nstatic PyObject *__Pyx_GetBuiltinName(PyObject *name) {\n    PyObject* result = __Pyx_PyObject_GetAttrStr(__pyx_b, name);\n    if (unlikely(!result)) {\n        PyErr_Format(PyExc_NameError,\n#if PY_MAJOR_VERSION >= 3\n            \"name '%U' is not defined\", name);\n#else\n            \"name '%.200s' is not defined\", PyString_AS_STRING(name));\n#endif\n    }\n    return result;\n}\n\n/* PyCFunctionFastCall */\n#if CYTHON_FAST_PYCCALL\nstatic CYTHON_INLINE PyObject * __Pyx_PyCFunction_FastCall(PyObject *func_obj, PyObject **args, Py_ssize_t nargs) {\n    PyCFunctionObject *func = (PyCFunctionObject*)func_obj;\n    PyCFunction meth = PyCFunction_GET_FUNCTION(func);\n    PyObject *self = PyCFunction_GET_SELF(func);\n    int flags = PyCFunction_GET_FLAGS(func);\n    assert(PyCFunction_Check(func));\n    assert(METH_FASTCALL == (flags & ~(METH_CLASS | METH_STATIC | METH_COEXIST | METH_KEYWORDS)));\n    assert(nargs >= 0);\n    assert(nargs == 0 || args != NULL);\n    /* _PyCFunction_FastCallDict() must not be called with an exception set,\n       because it may clear it (directly or indirectly) and so the\n       caller loses its exception */\n    assert(!PyErr_Occurred());\n    if ((PY_VERSION_HEX < 0x030700A0) || unlikely(flags & METH_KEYWORDS)) {\n        return (*((__Pyx_PyCFunctionFastWithKeywords)meth)) (self, args, nargs, NULL);\n    } else {\n        return (*((__Pyx_PyCFunctionFast)meth)) (self, args, nargs);\n    }\n}\n#endif\n\n/* PyFunctionFastCall */\n#if CYTHON_FAST_PYCALL\n#include \"frameobject.h\"\nstatic PyObject* __Pyx_PyFunction_FastCallNoKw(PyCodeObject *co, PyObject **args, Py_ssize_t na,\n                                               PyObject *globals) {\n    PyFrameObject *f;\n    PyThreadState *tstate = __Pyx_PyThreadState_Current;\n    PyObject **fastlocals;\n    Py_ssize_t i;\n    PyObject *result;\n    assert(globals != NULL);\n    /* XXX Perhaps we should create a specialized\n       PyFrame_New() that doesn't take locals, but does\n       take builtins without sanity checking them.\n       */\n    assert(tstate != NULL);\n    f = PyFrame_New(tstate, co, globals, NULL);\n    if (f == NULL) {\n        return NULL;\n    }\n    fastlocals = f->f_localsplus;\n    for (i = 0; i < na; i++) {\n        Py_INCREF(*args);\n        fastlocals[i] = *args++;\n    }\n    result = PyEval_EvalFrameEx(f,0);\n    ++tstate->recursion_depth;\n    Py_DECREF(f);\n    --tstate->recursion_depth;\n    return result;\n}\n#if 1 || PY_VERSION_HEX < 0x030600B1\nstatic PyObject *__Pyx_PyFunction_FastCallDict(PyObject *func, PyObject **args, int nargs, PyObject *kwargs) {\n    PyCodeObject *co = (PyCodeObject *)PyFunction_GET_CODE(func);\n    PyObject *globals = PyFunction_GET_GLOBALS(func);\n    PyObject *argdefs = PyFunction_GET_DEFAULTS(func);\n    PyObject *closure;\n#if PY_MAJOR_VERSION >= 3\n    PyObject *kwdefs;\n#endif\n    PyObject *kwtuple, **k;\n    PyObject **d;\n    Py_ssize_t nd;\n    Py_ssize_t nk;\n    PyObject *result;\n    assert(kwargs == NULL || PyDict_Check(kwargs));\n    nk = kwargs ? PyDict_Size(kwargs) : 0;\n    if (Py_EnterRecursiveCall((char*)\" while calling a Python object\")) {\n        return NULL;\n    }\n    if (\n#if PY_MAJOR_VERSION >= 3\n            co->co_kwonlyargcount == 0 &&\n#endif\n            likely(kwargs == NULL || nk == 0) &&\n            co->co_flags == (CO_OPTIMIZED | CO_NEWLOCALS | CO_NOFREE)) {\n        if (argdefs == NULL && co->co_argcount == nargs) {\n            result = __Pyx_PyFunction_FastCallNoKw(co, args, nargs, globals);\n            goto done;\n        }\n        else if (nargs == 0 && argdefs != NULL\n                 && co->co_argcount == Py_SIZE(argdefs)) {\n            /* function called with no arguments, but all parameters have\n               a default value: use default values as arguments .*/\n            args = &PyTuple_GET_ITEM(argdefs, 0);\n            result =__Pyx_PyFunction_FastCallNoKw(co, args, Py_SIZE(argdefs), globals);\n            goto done;\n        }\n    }\n    if (kwargs != NULL) {\n        Py_ssize_t pos, i;\n        kwtuple = PyTuple_New(2 * nk);\n        if (kwtuple == NULL) {\n            result = NULL;\n            goto done;\n        }\n        k = &PyTuple_GET_ITEM(kwtuple, 0);\n        pos = i = 0;\n        while (PyDict_Next(kwargs, &pos, &k[i], &k[i+1])) {\n            Py_INCREF(k[i]);\n            Py_INCREF(k[i+1]);\n            i += 2;\n        }\n        nk = i / 2;\n    }\n    else {\n        kwtuple = NULL;\n        k = NULL;\n    }\n    closure = PyFunction_GET_CLOSURE(func);\n#if PY_MAJOR_VERSION >= 3\n    kwdefs = PyFunction_GET_KW_DEFAULTS(func);\n#endif\n    if (argdefs != NULL) {\n        d = &PyTuple_GET_ITEM(argdefs, 0);\n        nd = Py_SIZE(argdefs);\n    }\n    else {\n        d = NULL;\n        nd = 0;\n    }\n#if PY_MAJOR_VERSION >= 3\n    result = PyEval_EvalCodeEx((PyObject*)co, globals, (PyObject *)NULL,\n                               args, nargs,\n                               k, (int)nk,\n                               d, (int)nd, kwdefs, closure);\n#else\n    result = PyEval_EvalCodeEx(co, globals, (PyObject *)NULL,\n                               args, nargs,\n                               k, (int)nk,\n                               d, (int)nd, closure);\n#endif\n    Py_XDECREF(kwtuple);\ndone:\n    Py_LeaveRecursiveCall();\n    return result;\n}\n#endif\n#endif\n\n/* PyObjectCall */\n#if CYTHON_COMPILING_IN_CPYTHON\nstatic CYTHON_INLINE PyObject* __Pyx_PyObject_Call(PyObject *func, PyObject *arg, PyObject *kw) {\n    PyObject *result;\n    ternaryfunc call = func->ob_type->tp_call;\n    if (unlikely(!call))\n        return PyObject_Call(func, arg, kw);\n    if (unlikely(Py_EnterRecursiveCall((char*)\" while calling a Python object\")))\n        return NULL;\n    result = (*call)(func, arg, kw);\n    Py_LeaveRecursiveCall();\n    if (unlikely(!result) && unlikely(!PyErr_Occurred())) {\n        PyErr_SetString(\n            PyExc_SystemError,\n            \"NULL result without error in PyObject_Call\");\n    }\n    return result;\n}\n#endif\n\n/* PyObjectCallMethO */\n#if CYTHON_COMPILING_IN_CPYTHON\nstatic CYTHON_INLINE PyObject* __Pyx_PyObject_CallMethO(PyObject *func, PyObject *arg) {\n    PyObject *self, *result;\n    PyCFunction cfunc;\n    cfunc = PyCFunction_GET_FUNCTION(func);\n    self = PyCFunction_GET_SELF(func);\n    if (unlikely(Py_EnterRecursiveCall((char*)\" while calling a Python object\")))\n        return NULL;\n    result = cfunc(self, arg);\n    Py_LeaveRecursiveCall();\n    if (unlikely(!result) && unlikely(!PyErr_Occurred())) {\n        PyErr_SetString(\n            PyExc_SystemError,\n            \"NULL result without error in PyObject_Call\");\n    }\n    return result;\n}\n#endif\n\n/* PyObjectCallOneArg */\n#if CYTHON_COMPILING_IN_CPYTHON\nstatic PyObject* __Pyx__PyObject_CallOneArg(PyObject *func, PyObject *arg) {\n    PyObject *result;\n    PyObject *args = PyTuple_New(1);\n    if (unlikely(!args)) return NULL;\n    Py_INCREF(arg);\n    PyTuple_SET_ITEM(args, 0, arg);\n    result = __Pyx_PyObject_Call(func, args, NULL);\n    Py_DECREF(args);\n    return result;\n}\nstatic CYTHON_INLINE PyObject* __Pyx_PyObject_CallOneArg(PyObject *func, PyObject *arg) {\n#if CYTHON_FAST_PYCALL\n    if (PyFunction_Check(func)) {\n        return __Pyx_PyFunction_FastCall(func, &arg, 1);\n    }\n#endif\n    if (likely(PyCFunction_Check(func))) {\n        if (likely(PyCFunction_GET_FLAGS(func) & METH_O)) {\n            return __Pyx_PyObject_CallMethO(func, arg);\n#if CYTHON_FAST_PYCCALL\n        } else if (PyCFunction_GET_FLAGS(func) & METH_FASTCALL) {\n            return __Pyx_PyCFunction_FastCall(func, &arg, 1);\n#endif\n        }\n    }\n    return __Pyx__PyObject_CallOneArg(func, arg);\n}\n#else\nstatic CYTHON_INLINE PyObject* __Pyx_PyObject_CallOneArg(PyObject *func, PyObject *arg) {\n    PyObject *result;\n    PyObject *args = PyTuple_Pack(1, arg);\n    if (unlikely(!args)) return NULL;\n    result = __Pyx_PyObject_Call(func, args, NULL);\n    Py_DECREF(args);\n    return result;\n}\n#endif\n\n/* GetModuleGlobalName */\nstatic CYTHON_INLINE PyObject *__Pyx_GetModuleGlobalName(PyObject *name) {\n    PyObject *result;\n#if !CYTHON_AVOID_BORROWED_REFS\n#if CYTHON_COMPILING_IN_CPYTHON && PY_VERSION_HEX >= 0x030500A1\n    result = _PyDict_GetItem_KnownHash(__pyx_d, name, ((PyASCIIObject *) name)->hash);\n    if (likely(result)) {\n        Py_INCREF(result);\n    } else if (unlikely(PyErr_Occurred())) {\n        result = NULL;\n    } else {\n#else\n    result = PyDict_GetItem(__pyx_d, name);\n    if (likely(result)) {\n        Py_INCREF(result);\n    } else {\n#endif\n#else\n    result = PyObject_GetItem(__pyx_d, name);\n    if (!result) {\n        PyErr_Clear();\n#endif\n        result = __Pyx_GetBuiltinName(name);\n    }\n    return result;\n}\n\n/* PyErrFetchRestore */\n    #if CYTHON_FAST_THREAD_STATE\nstatic CYTHON_INLINE void __Pyx_ErrRestoreInState(PyThreadState *tstate, PyObject *type, PyObject *value, PyObject *tb) {\n    PyObject *tmp_type, *tmp_value, *tmp_tb;\n    tmp_type = tstate->curexc_type;\n    tmp_value = tstate->curexc_value;\n    tmp_tb = tstate->curexc_traceback;\n    tstate->curexc_type = type;\n    tstate->curexc_value = value;\n    tstate->curexc_traceback = tb;\n    Py_XDECREF(tmp_type);\n    Py_XDECREF(tmp_value);\n    Py_XDECREF(tmp_tb);\n}\nstatic CYTHON_INLINE void __Pyx_ErrFetchInState(PyThreadState *tstate, PyObject **type, PyObject **value, PyObject **tb) {\n    *type = tstate->curexc_type;\n    *value = tstate->curexc_value;\n    *tb = tstate->curexc_traceback;\n    tstate->curexc_type = 0;\n    tstate->curexc_value = 0;\n    tstate->curexc_traceback = 0;\n}\n#endif\n\n/* RaiseException */\n    #if PY_MAJOR_VERSION < 3\nstatic void __Pyx_Raise(PyObject *type, PyObject *value, PyObject *tb,\n                        CYTHON_UNUSED PyObject *cause) {\n    __Pyx_PyThreadState_declare\n    Py_XINCREF(type);\n    if (!value || value == Py_None)\n        value = NULL;\n    else\n        Py_INCREF(value);\n    if (!tb || tb == Py_None)\n        tb = NULL;\n    else {\n        Py_INCREF(tb);\n        if (!PyTraceBack_Check(tb)) {\n            PyErr_SetString(PyExc_TypeError,\n                \"raise: arg 3 must be a traceback or None\");\n            goto raise_error;\n        }\n    }\n    if (PyType_Check(type)) {\n#if CYTHON_COMPILING_IN_PYPY\n        if (!value) {\n            Py_INCREF(Py_None);\n            value = Py_None;\n        }\n#endif\n        PyErr_NormalizeException(&type, &value, &tb);\n    } else {\n        if (value) {\n            PyErr_SetString(PyExc_TypeError,\n                \"instance exception may not have a separate value\");\n            goto raise_error;\n        }\n        value = type;\n        type = (PyObject*) Py_TYPE(type);\n        Py_INCREF(type);\n        if (!PyType_IsSubtype((PyTypeObject *)type, (PyTypeObject *)PyExc_BaseException)) {\n            PyErr_SetString(PyExc_TypeError,\n                \"raise: exception class must be a subclass of BaseException\");\n            goto raise_error;\n        }\n    }\n    __Pyx_PyThreadState_assign\n    __Pyx_ErrRestore(type, value, tb);\n    return;\nraise_error:\n    Py_XDECREF(value);\n    Py_XDECREF(type);\n    Py_XDECREF(tb);\n    return;\n}\n#else\nstatic void __Pyx_Raise(PyObject *type, PyObject *value, PyObject *tb, PyObject *cause) {\n    PyObject* owned_instance = NULL;\n    if (tb == Py_None) {\n        tb = 0;\n    } else if (tb && !PyTraceBack_Check(tb)) {\n        PyErr_SetString(PyExc_TypeError,\n            \"raise: arg 3 must be a traceback or None\");\n        goto bad;\n    }\n    if (value == Py_None)\n        value = 0;\n    if (PyExceptionInstance_Check(type)) {\n        if (value) {\n            PyErr_SetString(PyExc_TypeError,\n                \"instance exception may not have a separate value\");\n            goto bad;\n        }\n        value = type;\n        type = (PyObject*) Py_TYPE(value);\n    } else if (PyExceptionClass_Check(type)) {\n        PyObject *instance_class = NULL;\n        if (value && PyExceptionInstance_Check(value)) {\n            instance_class = (PyObject*) Py_TYPE(value);\n            if (instance_class != type) {\n                int is_subclass = PyObject_IsSubclass(instance_class, type);\n                if (!is_subclass) {\n                    instance_class = NULL;\n                } else if (unlikely(is_subclass == -1)) {\n                    goto bad;\n                } else {\n                    type = instance_class;\n                }\n            }\n        }\n        if (!instance_class) {\n            PyObject *args;\n            if (!value)\n                args = PyTuple_New(0);\n            else if (PyTuple_Check(value)) {\n                Py_INCREF(value);\n                args = value;\n            } else\n                args = PyTuple_Pack(1, value);\n            if (!args)\n                goto bad;\n            owned_instance = PyObject_Call(type, args, NULL);\n            Py_DECREF(args);\n            if (!owned_instance)\n                goto bad;\n            value = owned_instance;\n            if (!PyExceptionInstance_Check(value)) {\n                PyErr_Format(PyExc_TypeError,\n                             \"calling %R should have returned an instance of \"\n                             \"BaseException, not %R\",\n                             type, Py_TYPE(value));\n                goto bad;\n            }\n        }\n    } else {\n        PyErr_SetString(PyExc_TypeError,\n            \"raise: exception class must be a subclass of BaseException\");\n        goto bad;\n    }\n    if (cause) {\n        PyObject *fixed_cause;\n        if (cause == Py_None) {\n            fixed_cause = NULL;\n        } else if (PyExceptionClass_Check(cause)) {\n            fixed_cause = PyObject_CallObject(cause, NULL);\n            if (fixed_cause == NULL)\n                goto bad;\n        } else if (PyExceptionInstance_Check(cause)) {\n            fixed_cause = cause;\n            Py_INCREF(fixed_cause);\n        } else {\n            PyErr_SetString(PyExc_TypeError,\n                            \"exception causes must derive from \"\n                            \"BaseException\");\n            goto bad;\n        }\n        PyException_SetCause(value, fixed_cause);\n    }\n    PyErr_SetObject(type, value);\n    if (tb) {\n#if CYTHON_COMPILING_IN_PYPY\n        PyObject *tmp_type, *tmp_value, *tmp_tb;\n        PyErr_Fetch(&tmp_type, &tmp_value, &tmp_tb);\n        Py_INCREF(tb);\n        PyErr_Restore(tmp_type, tmp_value, tb);\n        Py_XDECREF(tmp_tb);\n#else\n        PyThreadState *tstate = __Pyx_PyThreadState_Current;\n        PyObject* tmp_tb = tstate->curexc_traceback;\n        if (tb != tmp_tb) {\n            Py_INCREF(tb);\n            tstate->curexc_traceback = tb;\n            Py_XDECREF(tmp_tb);\n        }\n#endif\n    }\nbad:\n    Py_XDECREF(owned_instance);\n    return;\n}\n#endif\n\n/* RaiseArgTupleInvalid */\n    static void __Pyx_RaiseArgtupleInvalid(\n    const char* func_name,\n    int exact,\n    Py_ssize_t num_min,\n    Py_ssize_t num_max,\n    Py_ssize_t num_found)\n{\n    Py_ssize_t num_expected;\n    const char *more_or_less;\n    if (num_found < num_min) {\n        num_expected = num_min;\n        more_or_less = \"at least\";\n    } else {\n        num_expected = num_max;\n        more_or_less = \"at most\";\n    }\n    if (exact) {\n        more_or_less = \"exactly\";\n    }\n    PyErr_Format(PyExc_TypeError,\n                 \"%.200s() takes %.8s %\" CYTHON_FORMAT_SSIZE_T \"d positional argument%.1s (%\" CYTHON_FORMAT_SSIZE_T \"d given)\",\n                 func_name, more_or_less, num_expected,\n                 (num_expected == 1) ? \"\" : \"s\", num_found);\n}\n\n/* RaiseDoubleKeywords */\n    static void __Pyx_RaiseDoubleKeywordsError(\n    const char* func_name,\n    PyObject* kw_name)\n{\n    PyErr_Format(PyExc_TypeError,\n        #if PY_MAJOR_VERSION >= 3\n        \"%s() got multiple values for keyword argument '%U'\", func_name, kw_name);\n        #else\n        \"%s() got multiple values for keyword argument '%s'\", func_name,\n        PyString_AsString(kw_name));\n        #endif\n}\n\n/* ParseKeywords */\n    static int __Pyx_ParseOptionalKeywords(\n    PyObject *kwds,\n    PyObject **argnames[],\n    PyObject *kwds2,\n    PyObject *values[],\n    Py_ssize_t num_pos_args,\n    const char* function_name)\n{\n    PyObject *key = 0, *value = 0;\n    Py_ssize_t pos = 0;\n    PyObject*** name;\n    PyObject*** first_kw_arg = argnames + num_pos_args;\n    while (PyDict_Next(kwds, &pos, &key, &value)) {\n        name = first_kw_arg;\n        while (*name && (**name != key)) name++;\n        if (*name) {\n            values[name-argnames] = value;\n            continue;\n        }\n        name = first_kw_arg;\n        #if PY_MAJOR_VERSION < 3\n        if (likely(PyString_CheckExact(key)) || likely(PyString_Check(key))) {\n            while (*name) {\n                if ((CYTHON_COMPILING_IN_PYPY || PyString_GET_SIZE(**name) == PyString_GET_SIZE(key))\n                        && _PyString_Eq(**name, key)) {\n                    values[name-argnames] = value;\n                    break;\n                }\n                name++;\n            }\n            if (*name) continue;\n            else {\n                PyObject*** argname = argnames;\n                while (argname != first_kw_arg) {\n                    if ((**argname == key) || (\n                            (CYTHON_COMPILING_IN_PYPY || PyString_GET_SIZE(**argname) == PyString_GET_SIZE(key))\n                             && _PyString_Eq(**argname, key))) {\n                        goto arg_passed_twice;\n                    }\n                    argname++;\n                }\n            }\n        } else\n        #endif\n        if (likely(PyUnicode_Check(key))) {\n            while (*name) {\n                int cmp = (**name == key) ? 0 :\n                #if !CYTHON_COMPILING_IN_PYPY && PY_MAJOR_VERSION >= 3\n                    (PyUnicode_GET_SIZE(**name) != PyUnicode_GET_SIZE(key)) ? 1 :\n                #endif\n                    PyUnicode_Compare(**name, key);\n                if (cmp < 0 && unlikely(PyErr_Occurred())) goto bad;\n                if (cmp == 0) {\n                    values[name-argnames] = value;\n                    break;\n                }\n                name++;\n            }\n            if (*name) continue;\n            else {\n                PyObject*** argname = argnames;\n                while (argname != first_kw_arg) {\n                    int cmp = (**argname == key) ? 0 :\n                    #if !CYTHON_COMPILING_IN_PYPY && PY_MAJOR_VERSION >= 3\n                        (PyUnicode_GET_SIZE(**argname) != PyUnicode_GET_SIZE(key)) ? 1 :\n                    #endif\n                        PyUnicode_Compare(**argname, key);\n                    if (cmp < 0 && unlikely(PyErr_Occurred())) goto bad;\n                    if (cmp == 0) goto arg_passed_twice;\n                    argname++;\n                }\n            }\n        } else\n            goto invalid_keyword_type;\n        if (kwds2) {\n            if (unlikely(PyDict_SetItem(kwds2, key, value))) goto bad;\n        } else {\n            goto invalid_keyword;\n        }\n    }\n    return 0;\narg_passed_twice:\n    __Pyx_RaiseDoubleKeywordsError(function_name, key);\n    goto bad;\ninvalid_keyword_type:\n    PyErr_Format(PyExc_TypeError,\n        \"%.200s() keywords must be strings\", function_name);\n    goto bad;\ninvalid_keyword:\n    PyErr_Format(PyExc_TypeError,\n    #if PY_MAJOR_VERSION < 3\n        \"%.200s() got an unexpected keyword argument '%.200s'\",\n        function_name, PyString_AsString(key));\n    #else\n        \"%s() got an unexpected keyword argument '%U'\",\n        function_name, key);\n    #endif\nbad:\n    return -1;\n}\n\n/* PyObjectCallNoArg */\n    #if CYTHON_COMPILING_IN_CPYTHON\nstatic CYTHON_INLINE PyObject* __Pyx_PyObject_CallNoArg(PyObject *func) {\n#if CYTHON_FAST_PYCALL\n    if (PyFunction_Check(func)) {\n        return __Pyx_PyFunction_FastCall(func, NULL, 0);\n    }\n#endif\n#ifdef __Pyx_CyFunction_USED\n    if (likely(PyCFunction_Check(func) || __Pyx_TypeCheck(func, __pyx_CyFunctionType))) {\n#else\n    if (likely(PyCFunction_Check(func))) {\n#endif\n        if (likely(PyCFunction_GET_FLAGS(func) & METH_NOARGS)) {\n            return __Pyx_PyObject_CallMethO(func, NULL);\n        }\n    }\n    return __Pyx_PyObject_Call(func, __pyx_empty_tuple, NULL);\n}\n#endif\n\n/* ExtTypeTest */\n      static CYTHON_INLINE int __Pyx_TypeTest(PyObject *obj, PyTypeObject *type) {\n    if (unlikely(!type)) {\n        PyErr_SetString(PyExc_SystemError, \"Missing type object\");\n        return 0;\n    }\n    if (likely(__Pyx_TypeCheck(obj, type)))\n        return 1;\n    PyErr_Format(PyExc_TypeError, \"Cannot convert %.200s to %.200s\",\n                 Py_TYPE(obj)->tp_name, type->tp_name);\n    return 0;\n}\n\n/* ArgTypeTest */\n      static int __Pyx__ArgTypeTest(PyObject *obj, PyTypeObject *type, const char *name, int exact)\n{\n    if (unlikely(!type)) {\n        PyErr_SetString(PyExc_SystemError, \"Missing type object\");\n        return 0;\n    }\n    else if (exact) {\n        #if PY_MAJOR_VERSION == 2\n        if ((type == &PyBaseString_Type) && likely(__Pyx_PyBaseString_CheckExact(obj))) return 1;\n        #endif\n    }\n    else {\n        if (likely(__Pyx_TypeCheck(obj, type))) return 1;\n    }\n    PyErr_Format(PyExc_TypeError,\n        \"Argument '%.200s' has incorrect type (expected %.200s, got %.200s)\",\n        name, type->tp_name, Py_TYPE(obj)->tp_name);\n    return 0;\n}\n\n/* WriteUnraisableException */\n      static void __Pyx_WriteUnraisable(const char *name, CYTHON_UNUSED int clineno,\n                                  CYTHON_UNUSED int lineno, CYTHON_UNUSED const char *filename,\n                                  int full_traceback, CYTHON_UNUSED int nogil) {\n    PyObject *old_exc, *old_val, *old_tb;\n    PyObject *ctx;\n    __Pyx_PyThreadState_declare\n#ifdef WITH_THREAD\n    PyGILState_STATE state;\n    if (nogil)\n        state = PyGILState_Ensure();\n#ifdef _MSC_VER\n    else state = (PyGILState_STATE)-1;\n#endif\n#endif\n    __Pyx_PyThreadState_assign\n    __Pyx_ErrFetch(&old_exc, &old_val, &old_tb);\n    if (full_traceback) {\n        Py_XINCREF(old_exc);\n        Py_XINCREF(old_val);\n        Py_XINCREF(old_tb);\n        __Pyx_ErrRestore(old_exc, old_val, old_tb);\n        PyErr_PrintEx(1);\n    }\n    #if PY_MAJOR_VERSION < 3\n    ctx = PyString_FromString(name);\n    #else\n    ctx = PyUnicode_FromString(name);\n    #endif\n    __Pyx_ErrRestore(old_exc, old_val, old_tb);\n    if (!ctx) {\n        PyErr_WriteUnraisable(Py_None);\n    } else {\n        PyErr_WriteUnraisable(ctx);\n        Py_DECREF(ctx);\n    }\n#ifdef WITH_THREAD\n    if (nogil)\n        PyGILState_Release(state);\n#endif\n}\n\n/* KeywordStringCheck */\n      static int __Pyx_CheckKeywordStrings(\n    PyObject *kwdict,\n    const char* function_name,\n    int kw_allowed)\n{\n    PyObject* key = 0;\n    Py_ssize_t pos = 0;\n#if CYTHON_COMPILING_IN_PYPY\n    if (!kw_allowed && PyDict_Next(kwdict, &pos, &key, 0))\n        goto invalid_keyword;\n    return 1;\n#else\n    while (PyDict_Next(kwdict, &pos, &key, 0)) {\n        #if PY_MAJOR_VERSION < 3\n        if (unlikely(!PyString_Check(key)))\n        #endif\n            if (unlikely(!PyUnicode_Check(key)))\n                goto invalid_keyword_type;\n    }\n    if ((!kw_allowed) && unlikely(key))\n        goto invalid_keyword;\n    return 1;\ninvalid_keyword_type:\n    PyErr_Format(PyExc_TypeError,\n        \"%.200s() keywords must be strings\", function_name);\n    return 0;\n#endif\ninvalid_keyword:\n    PyErr_Format(PyExc_TypeError,\n    #if PY_MAJOR_VERSION < 3\n        \"%.200s() got an unexpected keyword argument '%.200s'\",\n        function_name, PyString_AsString(key));\n    #else\n        \"%s() got an unexpected keyword argument '%U'\",\n        function_name, key);\n    #endif\n    return 0;\n}\n\n/* SaveResetException */\n      #if CYTHON_FAST_THREAD_STATE\nstatic CYTHON_INLINE void __Pyx__ExceptionSave(PyThreadState *tstate, PyObject **type, PyObject **value, PyObject **tb) {\n    #if PY_VERSION_HEX >= 0x030700A2\n    *type = tstate->exc_state.exc_type;\n    *value = tstate->exc_state.exc_value;\n    *tb = tstate->exc_state.exc_traceback;\n    #else\n    *type = tstate->exc_type;\n    *value = tstate->exc_value;\n    *tb = tstate->exc_traceback;\n    #endif\n    Py_XINCREF(*type);\n    Py_XINCREF(*value);\n    Py_XINCREF(*tb);\n}\nstatic CYTHON_INLINE void __Pyx__ExceptionReset(PyThreadState *tstate, PyObject *type, PyObject *value, PyObject *tb) {\n    PyObject *tmp_type, *tmp_value, *tmp_tb;\n    #if PY_VERSION_HEX >= 0x030700A2\n    tmp_type = tstate->exc_state.exc_type;\n    tmp_value = tstate->exc_state.exc_value;\n    tmp_tb = tstate->exc_state.exc_traceback;\n    tstate->exc_state.exc_type = type;\n    tstate->exc_state.exc_value = value;\n    tstate->exc_state.exc_traceback = tb;\n    #else\n    tmp_type = tstate->exc_type;\n    tmp_value = tstate->exc_value;\n    tmp_tb = tstate->exc_traceback;\n    tstate->exc_type = type;\n    tstate->exc_value = value;\n    tstate->exc_traceback = tb;\n    #endif\n    Py_XDECREF(tmp_type);\n    Py_XDECREF(tmp_value);\n    Py_XDECREF(tmp_tb);\n}\n#endif\n\n/* FastTypeChecks */\n      #if CYTHON_COMPILING_IN_CPYTHON\nstatic int __Pyx_InBases(PyTypeObject *a, PyTypeObject *b) {\n    while (a) {\n        a = a->tp_base;\n        if (a == b)\n            return 1;\n    }\n    return b == &PyBaseObject_Type;\n}\nstatic CYTHON_INLINE int __Pyx_IsSubtype(PyTypeObject *a, PyTypeObject *b) {\n    PyObject *mro;\n    if (a == b) return 1;\n    mro = a->tp_mro;\n    if (likely(mro)) {\n        Py_ssize_t i, n;\n        n = PyTuple_GET_SIZE(mro);\n        for (i = 0; i < n; i++) {\n            if (PyTuple_GET_ITEM(mro, i) == (PyObject *)b)\n                return 1;\n        }\n        return 0;\n    }\n    return __Pyx_InBases(a, b);\n}\n#if PY_MAJOR_VERSION == 2\nstatic int __Pyx_inner_PyErr_GivenExceptionMatches2(PyObject *err, PyObject* exc_type1, PyObject* exc_type2) {\n    PyObject *exception, *value, *tb;\n    int res;\n    __Pyx_PyThreadState_declare\n    __Pyx_PyThreadState_assign\n    __Pyx_ErrFetch(&exception, &value, &tb);\n    res = exc_type1 ? PyObject_IsSubclass(err, exc_type1) : 0;\n    if (unlikely(res == -1)) {\n        PyErr_WriteUnraisable(err);\n        res = 0;\n    }\n    if (!res) {\n        res = PyObject_IsSubclass(err, exc_type2);\n        if (unlikely(res == -1)) {\n            PyErr_WriteUnraisable(err);\n            res = 0;\n        }\n    }\n    __Pyx_ErrRestore(exception, value, tb);\n    return res;\n}\n#else\nstatic CYTHON_INLINE int __Pyx_inner_PyErr_GivenExceptionMatches2(PyObject *err, PyObject* exc_type1, PyObject *exc_type2) {\n    int res = exc_type1 ? __Pyx_IsSubtype((PyTypeObject*)err, (PyTypeObject*)exc_type1) : 0;\n    if (!res) {\n        res = __Pyx_IsSubtype((PyTypeObject*)err, (PyTypeObject*)exc_type2);\n    }\n    return res;\n}\n#endif\nstatic CYTHON_INLINE int __Pyx_PyErr_GivenExceptionMatches(PyObject *err, PyObject* exc_type) {\n    if (likely(err == exc_type)) return 1;\n    if (likely(PyExceptionClass_Check(err))) {\n        return __Pyx_inner_PyErr_GivenExceptionMatches2(err, NULL, exc_type);\n    }\n    return PyErr_GivenExceptionMatches(err, exc_type);\n}\nstatic CYTHON_INLINE int __Pyx_PyErr_GivenExceptionMatches2(PyObject *err, PyObject *exc_type1, PyObject *exc_type2) {\n    if (likely(err == exc_type1 || err == exc_type2)) return 1;\n    if (likely(PyExceptionClass_Check(err))) {\n        return __Pyx_inner_PyErr_GivenExceptionMatches2(err, exc_type1, exc_type2);\n    }\n    return (PyErr_GivenExceptionMatches(err, exc_type1) || PyErr_GivenExceptionMatches(err, exc_type2));\n}\n#endif\n\n/* GetException */\n      #if CYTHON_FAST_THREAD_STATE\nstatic int __Pyx__GetException(PyThreadState *tstate, PyObject **type, PyObject **value, PyObject **tb) {\n#else\nstatic int __Pyx_GetException(PyObject **type, PyObject **value, PyObject **tb) {\n#endif\n    PyObject *local_type, *local_value, *local_tb;\n#if CYTHON_FAST_THREAD_STATE\n    PyObject *tmp_type, *tmp_value, *tmp_tb;\n    local_type = tstate->curexc_type;\n    local_value = tstate->curexc_value;\n    local_tb = tstate->curexc_traceback;\n    tstate->curexc_type = 0;\n    tstate->curexc_value = 0;\n    tstate->curexc_traceback = 0;\n#else\n    PyErr_Fetch(&local_type, &local_value, &local_tb);\n#endif\n    PyErr_NormalizeException(&local_type, &local_value, &local_tb);\n#if CYTHON_FAST_THREAD_STATE\n    if (unlikely(tstate->curexc_type))\n#else\n    if (unlikely(PyErr_Occurred()))\n#endif\n        goto bad;\n    #if PY_MAJOR_VERSION >= 3\n    if (local_tb) {\n        if (unlikely(PyException_SetTraceback(local_value, local_tb) < 0))\n            goto bad;\n    }\n    #endif\n    Py_XINCREF(local_tb);\n    Py_XINCREF(local_type);\n    Py_XINCREF(local_value);\n    *type = local_type;\n    *value = local_value;\n    *tb = local_tb;\n#if CYTHON_FAST_THREAD_STATE\n    #if PY_VERSION_HEX >= 0x030700A2\n    tmp_type = tstate->exc_state.exc_type;\n    tmp_value = tstate->exc_state.exc_value;\n    tmp_tb = tstate->exc_state.exc_traceback;\n    tstate->exc_state.exc_type = local_type;\n    tstate->exc_state.exc_value = local_value;\n    tstate->exc_state.exc_traceback = local_tb;\n    #else\n    tmp_type = tstate->exc_type;\n    tmp_value = tstate->exc_value;\n    tmp_tb = tstate->exc_traceback;\n    tstate->exc_type = local_type;\n    tstate->exc_value = local_value;\n    tstate->exc_traceback = local_tb;\n    #endif\n    Py_XDECREF(tmp_type);\n    Py_XDECREF(tmp_value);\n    Py_XDECREF(tmp_tb);\n#else\n    PyErr_SetExcInfo(local_type, local_value, local_tb);\n#endif\n    return 0;\nbad:\n    *type = 0;\n    *value = 0;\n    *tb = 0;\n    Py_XDECREF(local_type);\n    Py_XDECREF(local_value);\n    Py_XDECREF(local_tb);\n    return -1;\n}\n\n/* RaiseTooManyValuesToUnpack */\n        static CYTHON_INLINE void __Pyx_RaiseTooManyValuesError(Py_ssize_t expected) {\n    PyErr_Format(PyExc_ValueError,\n                 \"too many values to unpack (expected %\" CYTHON_FORMAT_SSIZE_T \"d)\", expected);\n}\n\n/* RaiseNeedMoreValuesToUnpack */\n        static CYTHON_INLINE void __Pyx_RaiseNeedMoreValuesError(Py_ssize_t index) {\n    PyErr_Format(PyExc_ValueError,\n                 \"need more than %\" CYTHON_FORMAT_SSIZE_T \"d value%.1s to unpack\",\n                 index, (index == 1) ? \"\" : \"s\");\n}\n\n/* IterFinish */\n        static CYTHON_INLINE int __Pyx_IterFinish(void) {\n#if CYTHON_FAST_THREAD_STATE\n    PyThreadState *tstate = __Pyx_PyThreadState_Current;\n    PyObject* exc_type = tstate->curexc_type;\n    if (unlikely(exc_type)) {\n        if (likely(__Pyx_PyErr_GivenExceptionMatches(exc_type, PyExc_StopIteration))) {\n            PyObject *exc_value, *exc_tb;\n            exc_value = tstate->curexc_value;\n            exc_tb = tstate->curexc_traceback;\n            tstate->curexc_type = 0;\n            tstate->curexc_value = 0;\n            tstate->curexc_traceback = 0;\n            Py_DECREF(exc_type);\n            Py_XDECREF(exc_value);\n            Py_XDECREF(exc_tb);\n            return 0;\n        } else {\n            return -1;\n        }\n    }\n    return 0;\n#else\n    if (unlikely(PyErr_Occurred())) {\n        if (likely(PyErr_ExceptionMatches(PyExc_StopIteration))) {\n            PyErr_Clear();\n            return 0;\n        } else {\n            return -1;\n        }\n    }\n    return 0;\n#endif\n}\n\n/* UnpackItemEndCheck */\n        static int __Pyx_IternextUnpackEndCheck(PyObject *retval, Py_ssize_t expected) {\n    if (unlikely(retval)) {\n        Py_DECREF(retval);\n        __Pyx_RaiseTooManyValuesError(expected);\n        return -1;\n    } else {\n        return __Pyx_IterFinish();\n    }\n    return 0;\n}\n\n/* IterNext */\n        static PyObject *__Pyx_PyIter_Next2Default(PyObject* defval) {\n    PyObject* exc_type;\n    __Pyx_PyThreadState_declare\n    __Pyx_PyThreadState_assign\n    exc_type = __Pyx_PyErr_Occurred();\n    if (unlikely(exc_type)) {\n        if (!defval || unlikely(!__Pyx_PyErr_GivenExceptionMatches(exc_type, PyExc_StopIteration)))\n            return NULL;\n        __Pyx_PyErr_Clear();\n        Py_INCREF(defval);\n        return defval;\n    }\n    if (defval) {\n        Py_INCREF(defval);\n        return defval;\n    }\n    __Pyx_PyErr_SetNone(PyExc_StopIteration);\n    return NULL;\n}\nstatic void __Pyx_PyIter_Next_ErrorNoIterator(PyObject *iterator) {\n    PyErr_Format(PyExc_TypeError,\n        \"%.200s object is not an iterator\", Py_TYPE(iterator)->tp_name);\n}\nstatic CYTHON_INLINE PyObject *__Pyx_PyIter_Next2(PyObject* iterator, PyObject* defval) {\n    PyObject* next;\n    iternextfunc iternext = Py_TYPE(iterator)->tp_iternext;\n    if (likely(iternext)) {\n#if CYTHON_USE_TYPE_SLOTS\n        next = iternext(iterator);\n        if (likely(next))\n            return next;\n        #if PY_VERSION_HEX >= 0x02070000\n        if (unlikely(iternext == &_PyObject_NextNotImplemented))\n            return NULL;\n        #endif\n#else\n        next = PyIter_Next(iterator);\n        if (likely(next))\n            return next;\n#endif\n    } else if (CYTHON_USE_TYPE_SLOTS || unlikely(!PyIter_Check(iterator))) {\n        __Pyx_PyIter_Next_ErrorNoIterator(iterator);\n        return NULL;\n    }\n#if !CYTHON_USE_TYPE_SLOTS\n    else {\n        next = PyIter_Next(iterator);\n        if (likely(next))\n            return next;\n    }\n#endif\n    return __Pyx_PyIter_Next2Default(defval);\n}\n\n/* PyObject_GenericGetAttrNoDict */\n        #if CYTHON_USE_TYPE_SLOTS && CYTHON_USE_PYTYPE_LOOKUP && PY_VERSION_HEX < 0x03070000\nstatic PyObject *__Pyx_RaiseGenericGetAttributeError(PyTypeObject *tp, PyObject *attr_name) {\n    PyErr_Format(PyExc_AttributeError,\n#if PY_MAJOR_VERSION >= 3\n                 \"'%.50s' object has no attribute '%U'\",\n                 tp->tp_name, attr_name);\n#else\n                 \"'%.50s' object has no attribute '%.400s'\",\n                 tp->tp_name, PyString_AS_STRING(attr_name));\n#endif\n    return NULL;\n}\nstatic CYTHON_INLINE PyObject* __Pyx_PyObject_GenericGetAttrNoDict(PyObject* obj, PyObject* attr_name) {\n    PyObject *descr;\n    PyTypeObject *tp = Py_TYPE(obj);\n    if (unlikely(!PyString_Check(attr_name))) {\n        return PyObject_GenericGetAttr(obj, attr_name);\n    }\n    assert(!tp->tp_dictoffset);\n    descr = _PyType_Lookup(tp, attr_name);\n    if (unlikely(!descr)) {\n        return __Pyx_RaiseGenericGetAttributeError(tp, attr_name);\n    }\n    Py_INCREF(descr);\n    #if PY_MAJOR_VERSION < 3\n    if (likely(PyType_HasFeature(Py_TYPE(descr), Py_TPFLAGS_HAVE_CLASS)))\n    #endif\n    {\n        descrgetfunc f = Py_TYPE(descr)->tp_descr_get;\n        if (unlikely(f)) {\n            PyObject *res = f(descr, obj, (PyObject *)tp);\n            Py_DECREF(descr);\n            return res;\n        }\n    }\n    return descr;\n}\n#endif\n\n/* PyObject_GenericGetAttr */\n        #if CYTHON_USE_TYPE_SLOTS && CYTHON_USE_PYTYPE_LOOKUP && PY_VERSION_HEX < 0x03070000\nstatic PyObject* __Pyx_PyObject_GenericGetAttr(PyObject* obj, PyObject* attr_name) {\n    if (unlikely(Py_TYPE(obj)->tp_dictoffset)) {\n        return PyObject_GenericGetAttr(obj, attr_name);\n    }\n    return __Pyx_PyObject_GenericGetAttrNoDict(obj, attr_name);\n}\n#endif\n\n/* SetVTable */\n        static int __Pyx_SetVtable(PyObject *dict, void *vtable) {\n#if PY_VERSION_HEX >= 0x02070000\n    PyObject *ob = PyCapsule_New(vtable, 0, 0);\n#else\n    PyObject *ob = PyCObject_FromVoidPtr(vtable, 0);\n#endif\n    if (!ob)\n        goto bad;\n    if (PyDict_SetItem(dict, __pyx_n_s_pyx_vtable, ob) < 0)\n        goto bad;\n    Py_DECREF(ob);\n    return 0;\nbad:\n    Py_XDECREF(ob);\n    return -1;\n}\n\n/* SetupReduce */\n        static int __Pyx_setup_reduce_is_named(PyObject* meth, PyObject* name) {\n  int ret;\n  PyObject *name_attr;\n  name_attr = __Pyx_PyObject_GetAttrStr(meth, __pyx_n_s_name);\n  if (likely(name_attr)) {\n      ret = PyObject_RichCompareBool(name_attr, name, Py_EQ);\n  } else {\n      ret = -1;\n  }\n  if (unlikely(ret < 0)) {\n      PyErr_Clear();\n      ret = 0;\n  }\n  Py_XDECREF(name_attr);\n  return ret;\n}\nstatic int __Pyx_setup_reduce(PyObject* type_obj) {\n    int ret = 0;\n    PyObject *object_reduce = NULL;\n    PyObject *object_reduce_ex = NULL;\n    PyObject *reduce = NULL;\n    PyObject *reduce_ex = NULL;\n    PyObject *reduce_cython = NULL;\n    PyObject *setstate = NULL;\n    PyObject *setstate_cython = NULL;\n#if CYTHON_USE_PYTYPE_LOOKUP\n    if (_PyType_Lookup((PyTypeObject*)type_obj, __pyx_n_s_getstate)) goto GOOD;\n#else\n    if (PyObject_HasAttr(type_obj, __pyx_n_s_getstate)) goto GOOD;\n#endif\n#if CYTHON_USE_PYTYPE_LOOKUP\n    object_reduce_ex = _PyType_Lookup(&PyBaseObject_Type, __pyx_n_s_reduce_ex); if (!object_reduce_ex) goto BAD;\n#else\n    object_reduce_ex = __Pyx_PyObject_GetAttrStr((PyObject*)&PyBaseObject_Type, __pyx_n_s_reduce_ex); if (!object_reduce_ex) goto BAD;\n#endif\n    reduce_ex = __Pyx_PyObject_GetAttrStr(type_obj, __pyx_n_s_reduce_ex); if (unlikely(!reduce_ex)) goto BAD;\n    if (reduce_ex == object_reduce_ex) {\n#if CYTHON_USE_PYTYPE_LOOKUP\n        object_reduce = _PyType_Lookup(&PyBaseObject_Type, __pyx_n_s_reduce); if (!object_reduce) goto BAD;\n#else\n        object_reduce = __Pyx_PyObject_GetAttrStr((PyObject*)&PyBaseObject_Type, __pyx_n_s_reduce); if (!object_reduce) goto BAD;\n#endif\n        reduce = __Pyx_PyObject_GetAttrStr(type_obj, __pyx_n_s_reduce); if (unlikely(!reduce)) goto BAD;\n        if (reduce == object_reduce || __Pyx_setup_reduce_is_named(reduce, __pyx_n_s_reduce_cython)) {\n            reduce_cython = __Pyx_PyObject_GetAttrStr(type_obj, __pyx_n_s_reduce_cython); if (unlikely(!reduce_cython)) goto BAD;\n            ret = PyDict_SetItem(((PyTypeObject*)type_obj)->tp_dict, __pyx_n_s_reduce, reduce_cython); if (unlikely(ret < 0)) goto BAD;\n            ret = PyDict_DelItem(((PyTypeObject*)type_obj)->tp_dict, __pyx_n_s_reduce_cython); if (unlikely(ret < 0)) goto BAD;\n            setstate = __Pyx_PyObject_GetAttrStr(type_obj, __pyx_n_s_setstate);\n            if (!setstate) PyErr_Clear();\n            if (!setstate || __Pyx_setup_reduce_is_named(setstate, __pyx_n_s_setstate_cython)) {\n                setstate_cython = __Pyx_PyObject_GetAttrStr(type_obj, __pyx_n_s_setstate_cython); if (unlikely(!setstate_cython)) goto BAD;\n                ret = PyDict_SetItem(((PyTypeObject*)type_obj)->tp_dict, __pyx_n_s_setstate, setstate_cython); if (unlikely(ret < 0)) goto BAD;\n                ret = PyDict_DelItem(((PyTypeObject*)type_obj)->tp_dict, __pyx_n_s_setstate_cython); if (unlikely(ret < 0)) goto BAD;\n            }\n            PyType_Modified((PyTypeObject*)type_obj);\n        }\n    }\n    goto GOOD;\nBAD:\n    if (!PyErr_Occurred())\n        PyErr_Format(PyExc_RuntimeError, \"Unable to initialize pickling for %s\", ((PyTypeObject*)type_obj)->tp_name);\n    ret = -1;\nGOOD:\n#if !CYTHON_USE_PYTYPE_LOOKUP\n    Py_XDECREF(object_reduce);\n    Py_XDECREF(object_reduce_ex);\n#endif\n    Py_XDECREF(reduce);\n    Py_XDECREF(reduce_ex);\n    Py_XDECREF(reduce_cython);\n    Py_XDECREF(setstate);\n    Py_XDECREF(setstate_cython);\n    return ret;\n}\n\n/* Import */\n        static PyObject *__Pyx_Import(PyObject *name, PyObject *from_list, int level) {\n    PyObject *empty_list = 0;\n    PyObject *module = 0;\n    PyObject *global_dict = 0;\n    PyObject *empty_dict = 0;\n    PyObject *list;\n    #if PY_MAJOR_VERSION < 3\n    PyObject *py_import;\n    py_import = __Pyx_PyObject_GetAttrStr(__pyx_b, __pyx_n_s_import);\n    if (!py_import)\n        goto bad;\n    #endif\n    if (from_list)\n        list = from_list;\n    else {\n        empty_list = PyList_New(0);\n        if (!empty_list)\n            goto bad;\n        list = empty_list;\n    }\n    global_dict = PyModule_GetDict(__pyx_m);\n    if (!global_dict)\n        goto bad;\n    empty_dict = PyDict_New();\n    if (!empty_dict)\n        goto bad;\n    {\n        #if PY_MAJOR_VERSION >= 3\n        if (level == -1) {\n            if (strchr(__Pyx_MODULE_NAME, '.')) {\n                module = PyImport_ImportModuleLevelObject(\n                    name, global_dict, empty_dict, list, 1);\n                if (!module) {\n                    if (!PyErr_ExceptionMatches(PyExc_ImportError))\n                        goto bad;\n                    PyErr_Clear();\n                }\n            }\n            level = 0;\n        }\n        #endif\n        if (!module) {\n            #if PY_MAJOR_VERSION < 3\n            PyObject *py_level = PyInt_FromLong(level);\n            if (!py_level)\n                goto bad;\n            module = PyObject_CallFunctionObjArgs(py_import,\n                name, global_dict, empty_dict, list, py_level, NULL);\n            Py_DECREF(py_level);\n            #else\n            module = PyImport_ImportModuleLevelObject(\n                name, global_dict, empty_dict, list, level);\n            #endif\n        }\n    }\nbad:\n    #if PY_MAJOR_VERSION < 3\n    Py_XDECREF(py_import);\n    #endif\n    Py_XDECREF(empty_list);\n    Py_XDECREF(empty_dict);\n    return module;\n}\n\n/* CalculateMetaclass */\n        static PyObject *__Pyx_CalculateMetaclass(PyTypeObject *metaclass, PyObject *bases) {\n    Py_ssize_t i, nbases = PyTuple_GET_SIZE(bases);\n    for (i=0; i < nbases; i++) {\n        PyTypeObject *tmptype;\n        PyObject *tmp = PyTuple_GET_ITEM(bases, i);\n        tmptype = Py_TYPE(tmp);\n#if PY_MAJOR_VERSION < 3\n        if (tmptype == &PyClass_Type)\n            continue;\n#endif\n        if (!metaclass) {\n            metaclass = tmptype;\n            continue;\n        }\n        if (PyType_IsSubtype(metaclass, tmptype))\n            continue;\n        if (PyType_IsSubtype(tmptype, metaclass)) {\n            metaclass = tmptype;\n            continue;\n        }\n        PyErr_SetString(PyExc_TypeError,\n                        \"metaclass conflict: \"\n                        \"the metaclass of a derived class \"\n                        \"must be a (non-strict) subclass \"\n                        \"of the metaclasses of all its bases\");\n        return NULL;\n    }\n    if (!metaclass) {\n#if PY_MAJOR_VERSION < 3\n        metaclass = &PyClass_Type;\n#else\n        metaclass = &PyType_Type;\n#endif\n    }\n    Py_INCREF((PyObject*) metaclass);\n    return (PyObject*) metaclass;\n}\n\n/* Py3ClassCreate */\n        static PyObject *__Pyx_Py3MetaclassPrepare(PyObject *metaclass, PyObject *bases, PyObject *name,\n                                           PyObject *qualname, PyObject *mkw, PyObject *modname, PyObject *doc) {\n    PyObject *ns;\n    if (metaclass) {\n        PyObject *prep = __Pyx_PyObject_GetAttrStr(metaclass, __pyx_n_s_prepare);\n        if (prep) {\n            PyObject *pargs = PyTuple_Pack(2, name, bases);\n            if (unlikely(!pargs)) {\n                Py_DECREF(prep);\n                return NULL;\n            }\n            ns = PyObject_Call(prep, pargs, mkw);\n            Py_DECREF(prep);\n            Py_DECREF(pargs);\n        } else {\n            if (unlikely(!PyErr_ExceptionMatches(PyExc_AttributeError)))\n                return NULL;\n            PyErr_Clear();\n            ns = PyDict_New();\n        }\n    } else {\n        ns = PyDict_New();\n    }\n    if (unlikely(!ns))\n        return NULL;\n    if (unlikely(PyObject_SetItem(ns, __pyx_n_s_module, modname) < 0)) goto bad;\n    if (unlikely(PyObject_SetItem(ns, __pyx_n_s_qualname, qualname) < 0)) goto bad;\n    if (unlikely(doc && PyObject_SetItem(ns, __pyx_n_s_doc, doc) < 0)) goto bad;\n    return ns;\nbad:\n    Py_DECREF(ns);\n    return NULL;\n}\nstatic PyObject *__Pyx_Py3ClassCreate(PyObject *metaclass, PyObject *name, PyObject *bases,\n                                      PyObject *dict, PyObject *mkw,\n                                      int calculate_metaclass, int allow_py2_metaclass) {\n    PyObject *result, *margs;\n    PyObject *owned_metaclass = NULL;\n    if (allow_py2_metaclass) {\n        owned_metaclass = PyObject_GetItem(dict, __pyx_n_s_metaclass);\n        if (owned_metaclass) {\n            metaclass = owned_metaclass;\n        } else if (likely(PyErr_ExceptionMatches(PyExc_KeyError))) {\n            PyErr_Clear();\n        } else {\n            return NULL;\n        }\n    }\n    if (calculate_metaclass && (!metaclass || PyType_Check(metaclass))) {\n        metaclass = __Pyx_CalculateMetaclass((PyTypeObject*) metaclass, bases);\n        Py_XDECREF(owned_metaclass);\n        if (unlikely(!metaclass))\n            return NULL;\n        owned_metaclass = metaclass;\n    }\n    margs = PyTuple_Pack(3, name, bases, dict);\n    if (unlikely(!margs)) {\n        result = NULL;\n    } else {\n        result = PyObject_Call(metaclass, margs, mkw);\n        Py_DECREF(margs);\n    }\n    Py_XDECREF(owned_metaclass);\n    return result;\n}\n\n/* ClassMethod */\n        static PyObject* __Pyx_Method_ClassMethod(PyObject *method) {\n#if CYTHON_COMPILING_IN_PYPY && PYPY_VERSION_NUM <= 0x05080000\n    if (PyObject_TypeCheck(method, &PyWrapperDescr_Type)) {\n        return PyClassMethod_New(method);\n    }\n#else\n#if CYTHON_COMPILING_IN_PYSTON || CYTHON_COMPILING_IN_PYPY\n    if (PyMethodDescr_Check(method)) {\n#else\n    static PyTypeObject *methoddescr_type = NULL;\n    if (methoddescr_type == NULL) {\n       PyObject *meth = PyObject_GetAttrString((PyObject*)&PyList_Type, \"append\");\n       if (!meth) return NULL;\n       methoddescr_type = Py_TYPE(meth);\n       Py_DECREF(meth);\n    }\n    if (__Pyx_TypeCheck(method, methoddescr_type)) {\n#endif\n        PyMethodDescrObject *descr = (PyMethodDescrObject *)method;\n        #if PY_VERSION_HEX < 0x03020000\n        PyTypeObject *d_type = descr->d_type;\n        #else\n        PyTypeObject *d_type = descr->d_common.d_type;\n        #endif\n        return PyDescr_NewClassMethod(d_type, descr->d_method);\n    }\n#endif\n    else if (PyMethod_Check(method)) {\n        return PyClassMethod_New(PyMethod_GET_FUNCTION(method));\n    }\n    else if (PyCFunction_Check(method)) {\n        return PyClassMethod_New(method);\n    }\n#ifdef __Pyx_CyFunction_USED\n    else if (__Pyx_TypeCheck(method, __pyx_CyFunctionType)) {\n        return PyClassMethod_New(method);\n    }\n#endif\n    PyErr_SetString(PyExc_TypeError,\n                   \"Class-level classmethod() can only be called on \"\n                   \"a method_descriptor or instance method.\");\n    return NULL;\n}\n\n/* PyErrExceptionMatches */\n          #if CYTHON_FAST_THREAD_STATE\nstatic int __Pyx_PyErr_ExceptionMatchesTuple(PyObject *exc_type, PyObject *tuple) {\n    Py_ssize_t i, n;\n    n = PyTuple_GET_SIZE(tuple);\n#if PY_MAJOR_VERSION >= 3\n    for (i=0; i<n; i++) {\n        if (exc_type == PyTuple_GET_ITEM(tuple, i)) return 1;\n    }\n#endif\n    for (i=0; i<n; i++) {\n        if (__Pyx_PyErr_GivenExceptionMatches(exc_type, PyTuple_GET_ITEM(tuple, i))) return 1;\n    }\n    return 0;\n}\nstatic CYTHON_INLINE int __Pyx_PyErr_ExceptionMatchesInState(PyThreadState* tstate, PyObject* err) {\n    PyObject *exc_type = tstate->curexc_type;\n    if (exc_type == err) return 1;\n    if (unlikely(!exc_type)) return 0;\n    if (unlikely(PyTuple_Check(err)))\n        return __Pyx_PyErr_ExceptionMatchesTuple(exc_type, err);\n    return __Pyx_PyErr_GivenExceptionMatches(exc_type, err);\n}\n#endif\n\n/* GetNameInClass */\n          static PyObject *__Pyx_GetGlobalNameAfterAttributeLookup(PyObject *name) {\n    __Pyx_PyThreadState_declare\n    __Pyx_PyThreadState_assign\n    if (unlikely(!__Pyx_PyErr_ExceptionMatches(PyExc_AttributeError)))\n        return NULL;\n    __Pyx_PyErr_Clear();\n    return __Pyx_GetModuleGlobalName(name);\n}\nstatic PyObject *__Pyx_GetNameInClass(PyObject *nmspace, PyObject *name) {\n    PyObject *result;\n    result = __Pyx_PyObject_GetAttrStr(nmspace, name);\n    if (!result) {\n        result = __Pyx_GetGlobalNameAfterAttributeLookup(name);\n    }\n    return result;\n}\n\n/* FetchCommonType */\n          static PyTypeObject* __Pyx_FetchCommonType(PyTypeObject* type) {\n    PyObject* fake_module;\n    PyTypeObject* cached_type = NULL;\n    fake_module = PyImport_AddModule((char*) \"_cython_\" CYTHON_ABI);\n    if (!fake_module) return NULL;\n    Py_INCREF(fake_module);\n    cached_type = (PyTypeObject*) PyObject_GetAttrString(fake_module, type->tp_name);\n    if (cached_type) {\n        if (!PyType_Check((PyObject*)cached_type)) {\n            PyErr_Format(PyExc_TypeError,\n                \"Shared Cython type %.200s is not a type object\",\n                type->tp_name);\n            goto bad;\n        }\n        if (cached_type->tp_basicsize != type->tp_basicsize) {\n            PyErr_Format(PyExc_TypeError,\n                \"Shared Cython type %.200s has the wrong size, try recompiling\",\n                type->tp_name);\n            goto bad;\n        }\n    } else {\n        if (!PyErr_ExceptionMatches(PyExc_AttributeError)) goto bad;\n        PyErr_Clear();\n        if (PyType_Ready(type) < 0) goto bad;\n        if (PyObject_SetAttrString(fake_module, type->tp_name, (PyObject*) type) < 0)\n            goto bad;\n        Py_INCREF(type);\n        cached_type = type;\n    }\ndone:\n    Py_DECREF(fake_module);\n    return cached_type;\nbad:\n    Py_XDECREF(cached_type);\n    cached_type = NULL;\n    goto done;\n}\n\n/* CythonFunction */\n          #include <structmember.h>\nstatic PyObject *\n__Pyx_CyFunction_get_doc(__pyx_CyFunctionObject *op, CYTHON_UNUSED void *closure)\n{\n    if (unlikely(op->func_doc == NULL)) {\n        if (op->func.m_ml->ml_doc) {\n#if PY_MAJOR_VERSION >= 3\n            op->func_doc = PyUnicode_FromString(op->func.m_ml->ml_doc);\n#else\n            op->func_doc = PyString_FromString(op->func.m_ml->ml_doc);\n#endif\n            if (unlikely(op->func_doc == NULL))\n                return NULL;\n        } else {\n            Py_INCREF(Py_None);\n            return Py_None;\n        }\n    }\n    Py_INCREF(op->func_doc);\n    return op->func_doc;\n}\nstatic int\n__Pyx_CyFunction_set_doc(__pyx_CyFunctionObject *op, PyObject *value)\n{\n    PyObject *tmp = op->func_doc;\n    if (value == NULL) {\n        value = Py_None;\n    }\n    Py_INCREF(value);\n    op->func_doc = value;\n    Py_XDECREF(tmp);\n    return 0;\n}\nstatic PyObject *\n__Pyx_CyFunction_get_name(__pyx_CyFunctionObject *op)\n{\n    if (unlikely(op->func_name == NULL)) {\n#if PY_MAJOR_VERSION >= 3\n        op->func_name = PyUnicode_InternFromString(op->func.m_ml->ml_name);\n#else\n        op->func_name = PyString_InternFromString(op->func.m_ml->ml_name);\n#endif\n        if (unlikely(op->func_name == NULL))\n            return NULL;\n    }\n    Py_INCREF(op->func_name);\n    return op->func_name;\n}\nstatic int\n__Pyx_CyFunction_set_name(__pyx_CyFunctionObject *op, PyObject *value)\n{\n    PyObject *tmp;\n#if PY_MAJOR_VERSION >= 3\n    if (unlikely(value == NULL || !PyUnicode_Check(value))) {\n#else\n    if (unlikely(value == NULL || !PyString_Check(value))) {\n#endif\n        PyErr_SetString(PyExc_TypeError,\n                        \"__name__ must be set to a string object\");\n        return -1;\n    }\n    tmp = op->func_name;\n    Py_INCREF(value);\n    op->func_name = value;\n    Py_XDECREF(tmp);\n    return 0;\n}\nstatic PyObject *\n__Pyx_CyFunction_get_qualname(__pyx_CyFunctionObject *op)\n{\n    Py_INCREF(op->func_qualname);\n    return op->func_qualname;\n}\nstatic int\n__Pyx_CyFunction_set_qualname(__pyx_CyFunctionObject *op, PyObject *value)\n{\n    PyObject *tmp;\n#if PY_MAJOR_VERSION >= 3\n    if (unlikely(value == NULL || !PyUnicode_Check(value))) {\n#else\n    if (unlikely(value == NULL || !PyString_Check(value))) {\n#endif\n        PyErr_SetString(PyExc_TypeError,\n                        \"__qualname__ must be set to a string object\");\n        return -1;\n    }\n    tmp = op->func_qualname;\n    Py_INCREF(value);\n    op->func_qualname = value;\n    Py_XDECREF(tmp);\n    return 0;\n}\nstatic PyObject *\n__Pyx_CyFunction_get_self(__pyx_CyFunctionObject *m, CYTHON_UNUSED void *closure)\n{\n    PyObject *self;\n    self = m->func_closure;\n    if (self == NULL)\n        self = Py_None;\n    Py_INCREF(self);\n    return self;\n}\nstatic PyObject *\n__Pyx_CyFunction_get_dict(__pyx_CyFunctionObject *op)\n{\n    if (unlikely(op->func_dict == NULL)) {\n        op->func_dict = PyDict_New();\n        if (unlikely(op->func_dict == NULL))\n            return NULL;\n    }\n    Py_INCREF(op->func_dict);\n    return op->func_dict;\n}\nstatic int\n__Pyx_CyFunction_set_dict(__pyx_CyFunctionObject *op, PyObject *value)\n{\n    PyObject *tmp;\n    if (unlikely(value == NULL)) {\n        PyErr_SetString(PyExc_TypeError,\n               \"function's dictionary may not be deleted\");\n        return -1;\n    }\n    if (unlikely(!PyDict_Check(value))) {\n        PyErr_SetString(PyExc_TypeError,\n               \"setting function's dictionary to a non-dict\");\n        return -1;\n    }\n    tmp = op->func_dict;\n    Py_INCREF(value);\n    op->func_dict = value;\n    Py_XDECREF(tmp);\n    return 0;\n}\nstatic PyObject *\n__Pyx_CyFunction_get_globals(__pyx_CyFunctionObject *op)\n{\n    Py_INCREF(op->func_globals);\n    return op->func_globals;\n}\nstatic PyObject *\n__Pyx_CyFunction_get_closure(CYTHON_UNUSED __pyx_CyFunctionObject *op)\n{\n    Py_INCREF(Py_None);\n    return Py_None;\n}\nstatic PyObject *\n__Pyx_CyFunction_get_code(__pyx_CyFunctionObject *op)\n{\n    PyObject* result = (op->func_code) ? op->func_code : Py_None;\n    Py_INCREF(result);\n    return result;\n}\nstatic int\n__Pyx_CyFunction_init_defaults(__pyx_CyFunctionObject *op) {\n    int result = 0;\n    PyObject *res = op->defaults_getter((PyObject *) op);\n    if (unlikely(!res))\n        return -1;\n    #if CYTHON_ASSUME_SAFE_MACROS && !CYTHON_AVOID_BORROWED_REFS\n    op->defaults_tuple = PyTuple_GET_ITEM(res, 0);\n    Py_INCREF(op->defaults_tuple);\n    op->defaults_kwdict = PyTuple_GET_ITEM(res, 1);\n    Py_INCREF(op->defaults_kwdict);\n    #else\n    op->defaults_tuple = PySequence_ITEM(res, 0);\n    if (unlikely(!op->defaults_tuple)) result = -1;\n    else {\n        op->defaults_kwdict = PySequence_ITEM(res, 1);\n        if (unlikely(!op->defaults_kwdict)) result = -1;\n    }\n    #endif\n    Py_DECREF(res);\n    return result;\n}\nstatic int\n__Pyx_CyFunction_set_defaults(__pyx_CyFunctionObject *op, PyObject* value) {\n    PyObject* tmp;\n    if (!value) {\n        value = Py_None;\n    } else if (value != Py_None && !PyTuple_Check(value)) {\n        PyErr_SetString(PyExc_TypeError,\n                        \"__defaults__ must be set to a tuple object\");\n        return -1;\n    }\n    Py_INCREF(value);\n    tmp = op->defaults_tuple;\n    op->defaults_tuple = value;\n    Py_XDECREF(tmp);\n    return 0;\n}\nstatic PyObject *\n__Pyx_CyFunction_get_defaults(__pyx_CyFunctionObject *op) {\n    PyObject* result = op->defaults_tuple;\n    if (unlikely(!result)) {\n        if (op->defaults_getter) {\n            if (__Pyx_CyFunction_init_defaults(op) < 0) return NULL;\n            result = op->defaults_tuple;\n        } else {\n            result = Py_None;\n        }\n    }\n    Py_INCREF(result);\n    return result;\n}\nstatic int\n__Pyx_CyFunction_set_kwdefaults(__pyx_CyFunctionObject *op, PyObject* value) {\n    PyObject* tmp;\n    if (!value) {\n        value = Py_None;\n    } else if (value != Py_None && !PyDict_Check(value)) {\n        PyErr_SetString(PyExc_TypeError,\n                        \"__kwdefaults__ must be set to a dict object\");\n        return -1;\n    }\n    Py_INCREF(value);\n    tmp = op->defaults_kwdict;\n    op->defaults_kwdict = value;\n    Py_XDECREF(tmp);\n    return 0;\n}\nstatic PyObject *\n__Pyx_CyFunction_get_kwdefaults(__pyx_CyFunctionObject *op) {\n    PyObject* result = op->defaults_kwdict;\n    if (unlikely(!result)) {\n        if (op->defaults_getter) {\n            if (__Pyx_CyFunction_init_defaults(op) < 0) return NULL;\n            result = op->defaults_kwdict;\n        } else {\n            result = Py_None;\n        }\n    }\n    Py_INCREF(result);\n    return result;\n}\nstatic int\n__Pyx_CyFunction_set_annotations(__pyx_CyFunctionObject *op, PyObject* value) {\n    PyObject* tmp;\n    if (!value || value == Py_None) {\n        value = NULL;\n    } else if (!PyDict_Check(value)) {\n        PyErr_SetString(PyExc_TypeError,\n                        \"__annotations__ must be set to a dict object\");\n        return -1;\n    }\n    Py_XINCREF(value);\n    tmp = op->func_annotations;\n    op->func_annotations = value;\n    Py_XDECREF(tmp);\n    return 0;\n}\nstatic PyObject *\n__Pyx_CyFunction_get_annotations(__pyx_CyFunctionObject *op) {\n    PyObject* result = op->func_annotations;\n    if (unlikely(!result)) {\n        result = PyDict_New();\n        if (unlikely(!result)) return NULL;\n        op->func_annotations = result;\n    }\n    Py_INCREF(result);\n    return result;\n}\nstatic PyGetSetDef __pyx_CyFunction_getsets[] = {\n    {(char *) \"func_doc\", (getter)__Pyx_CyFunction_get_doc, (setter)__Pyx_CyFunction_set_doc, 0, 0},\n    {(char *) \"__doc__\",  (getter)__Pyx_CyFunction_get_doc, (setter)__Pyx_CyFunction_set_doc, 0, 0},\n    {(char *) \"func_name\", (getter)__Pyx_CyFunction_get_name, (setter)__Pyx_CyFunction_set_name, 0, 0},\n    {(char *) \"__name__\", (getter)__Pyx_CyFunction_get_name, (setter)__Pyx_CyFunction_set_name, 0, 0},\n    {(char *) \"__qualname__\", (getter)__Pyx_CyFunction_get_qualname, (setter)__Pyx_CyFunction_set_qualname, 0, 0},\n    {(char *) \"__self__\", (getter)__Pyx_CyFunction_get_self, 0, 0, 0},\n    {(char *) \"func_dict\", (getter)__Pyx_CyFunction_get_dict, (setter)__Pyx_CyFunction_set_dict, 0, 0},\n    {(char *) \"__dict__\", (getter)__Pyx_CyFunction_get_dict, (setter)__Pyx_CyFunction_set_dict, 0, 0},\n    {(char *) \"func_globals\", (getter)__Pyx_CyFunction_get_globals, 0, 0, 0},\n    {(char *) \"__globals__\", (getter)__Pyx_CyFunction_get_globals, 0, 0, 0},\n    {(char *) \"func_closure\", (getter)__Pyx_CyFunction_get_closure, 0, 0, 0},\n    {(char *) \"__closure__\", (getter)__Pyx_CyFunction_get_closure, 0, 0, 0},\n    {(char *) \"func_code\", (getter)__Pyx_CyFunction_get_code, 0, 0, 0},\n    {(char *) \"__code__\", (getter)__Pyx_CyFunction_get_code, 0, 0, 0},\n    {(char *) \"func_defaults\", (getter)__Pyx_CyFunction_get_defaults, (setter)__Pyx_CyFunction_set_defaults, 0, 0},\n    {(char *) \"__defaults__\", (getter)__Pyx_CyFunction_get_defaults, (setter)__Pyx_CyFunction_set_defaults, 0, 0},\n    {(char *) \"__kwdefaults__\", (getter)__Pyx_CyFunction_get_kwdefaults, (setter)__Pyx_CyFunction_set_kwdefaults, 0, 0},\n    {(char *) \"__annotations__\", (getter)__Pyx_CyFunction_get_annotations, (setter)__Pyx_CyFunction_set_annotations, 0, 0},\n    {0, 0, 0, 0, 0}\n};\nstatic PyMemberDef __pyx_CyFunction_members[] = {\n    {(char *) \"__module__\", T_OBJECT, offsetof(PyCFunctionObject, m_module), PY_WRITE_RESTRICTED, 0},\n    {0, 0, 0,  0, 0}\n};\nstatic PyObject *\n__Pyx_CyFunction_reduce(__pyx_CyFunctionObject *m, CYTHON_UNUSED PyObject *args)\n{\n#if PY_MAJOR_VERSION >= 3\n    return PyUnicode_FromString(m->func.m_ml->ml_name);\n#else\n    return PyString_FromString(m->func.m_ml->ml_name);\n#endif\n}\nstatic PyMethodDef __pyx_CyFunction_methods[] = {\n    {\"__reduce__\", (PyCFunction)__Pyx_CyFunction_reduce, METH_VARARGS, 0},\n    {0, 0, 0, 0}\n};\n#if PY_VERSION_HEX < 0x030500A0\n#define __Pyx_CyFunction_weakreflist(cyfunc) ((cyfunc)->func_weakreflist)\n#else\n#define __Pyx_CyFunction_weakreflist(cyfunc) ((cyfunc)->func.m_weakreflist)\n#endif\nstatic PyObject *__Pyx_CyFunction_New(PyTypeObject *type, PyMethodDef *ml, int flags, PyObject* qualname,\n                                      PyObject *closure, PyObject *module, PyObject* globals, PyObject* code) {\n    __pyx_CyFunctionObject *op = PyObject_GC_New(__pyx_CyFunctionObject, type);\n    if (op == NULL)\n        return NULL;\n    op->flags = flags;\n    __Pyx_CyFunction_weakreflist(op) = NULL;\n    op->func.m_ml = ml;\n    op->func.m_self = (PyObject *) op;\n    Py_XINCREF(closure);\n    op->func_closure = closure;\n    Py_XINCREF(module);\n    op->func.m_module = module;\n    op->func_dict = NULL;\n    op->func_name = NULL;\n    Py_INCREF(qualname);\n    op->func_qualname = qualname;\n    op->func_doc = NULL;\n    op->func_classobj = NULL;\n    op->func_globals = globals;\n    Py_INCREF(op->func_globals);\n    Py_XINCREF(code);\n    op->func_code = code;\n    op->defaults_pyobjects = 0;\n    op->defaults = NULL;\n    op->defaults_tuple = NULL;\n    op->defaults_kwdict = NULL;\n    op->defaults_getter = NULL;\n    op->func_annotations = NULL;\n    PyObject_GC_Track(op);\n    return (PyObject *) op;\n}\nstatic int\n__Pyx_CyFunction_clear(__pyx_CyFunctionObject *m)\n{\n    Py_CLEAR(m->func_closure);\n    Py_CLEAR(m->func.m_module);\n    Py_CLEAR(m->func_dict);\n    Py_CLEAR(m->func_name);\n    Py_CLEAR(m->func_qualname);\n    Py_CLEAR(m->func_doc);\n    Py_CLEAR(m->func_globals);\n    Py_CLEAR(m->func_code);\n    Py_CLEAR(m->func_classobj);\n    Py_CLEAR(m->defaults_tuple);\n    Py_CLEAR(m->defaults_kwdict);\n    Py_CLEAR(m->func_annotations);\n    if (m->defaults) {\n        PyObject **pydefaults = __Pyx_CyFunction_Defaults(PyObject *, m);\n        int i;\n        for (i = 0; i < m->defaults_pyobjects; i++)\n            Py_XDECREF(pydefaults[i]);\n        PyObject_Free(m->defaults);\n        m->defaults = NULL;\n    }\n    return 0;\n}\nstatic void __Pyx__CyFunction_dealloc(__pyx_CyFunctionObject *m)\n{\n    if (__Pyx_CyFunction_weakreflist(m) != NULL)\n        PyObject_ClearWeakRefs((PyObject *) m);\n    __Pyx_CyFunction_clear(m);\n    PyObject_GC_Del(m);\n}\nstatic void __Pyx_CyFunction_dealloc(__pyx_CyFunctionObject *m)\n{\n    PyObject_GC_UnTrack(m);\n    __Pyx__CyFunction_dealloc(m);\n}\nstatic int __Pyx_CyFunction_traverse(__pyx_CyFunctionObject *m, visitproc visit, void *arg)\n{\n    Py_VISIT(m->func_closure);\n    Py_VISIT(m->func.m_module);\n    Py_VISIT(m->func_dict);\n    Py_VISIT(m->func_name);\n    Py_VISIT(m->func_qualname);\n    Py_VISIT(m->func_doc);\n    Py_VISIT(m->func_globals);\n    Py_VISIT(m->func_code);\n    Py_VISIT(m->func_classobj);\n    Py_VISIT(m->defaults_tuple);\n    Py_VISIT(m->defaults_kwdict);\n    if (m->defaults) {\n        PyObject **pydefaults = __Pyx_CyFunction_Defaults(PyObject *, m);\n        int i;\n        for (i = 0; i < m->defaults_pyobjects; i++)\n            Py_VISIT(pydefaults[i]);\n    }\n    return 0;\n}\nstatic PyObject *__Pyx_CyFunction_descr_get(PyObject *func, PyObject *obj, PyObject *type)\n{\n    __pyx_CyFunctionObject *m = (__pyx_CyFunctionObject *) func;\n    if (m->flags & __Pyx_CYFUNCTION_STATICMETHOD) {\n        Py_INCREF(func);\n        return func;\n    }\n    if (m->flags & __Pyx_CYFUNCTION_CLASSMETHOD) {\n        if (type == NULL)\n            type = (PyObject *)(Py_TYPE(obj));\n        return __Pyx_PyMethod_New(func, type, (PyObject *)(Py_TYPE(type)));\n    }\n    if (obj == Py_None)\n        obj = NULL;\n    return __Pyx_PyMethod_New(func, obj, type);\n}\nstatic PyObject*\n__Pyx_CyFunction_repr(__pyx_CyFunctionObject *op)\n{\n#if PY_MAJOR_VERSION >= 3\n    return PyUnicode_FromFormat(\"<cyfunction %U at %p>\",\n                                op->func_qualname, (void *)op);\n#else\n    return PyString_FromFormat(\"<cyfunction %s at %p>\",\n                               PyString_AsString(op->func_qualname), (void *)op);\n#endif\n}\nstatic PyObject * __Pyx_CyFunction_CallMethod(PyObject *func, PyObject *self, PyObject *arg, PyObject *kw) {\n    PyCFunctionObject* f = (PyCFunctionObject*)func;\n    PyCFunction meth = f->m_ml->ml_meth;\n    Py_ssize_t size;\n    switch (f->m_ml->ml_flags & (METH_VARARGS | METH_KEYWORDS | METH_NOARGS | METH_O)) {\n    case METH_VARARGS:\n        if (likely(kw == NULL || PyDict_Size(kw) == 0))\n            return (*meth)(self, arg);\n        break;\n    case METH_VARARGS | METH_KEYWORDS:\n        return (*(PyCFunctionWithKeywords)meth)(self, arg, kw);\n    case METH_NOARGS:\n        if (likely(kw == NULL || PyDict_Size(kw) == 0)) {\n            size = PyTuple_GET_SIZE(arg);\n            if (likely(size == 0))\n                return (*meth)(self, NULL);\n            PyErr_Format(PyExc_TypeError,\n                \"%.200s() takes no arguments (%\" CYTHON_FORMAT_SSIZE_T \"d given)\",\n                f->m_ml->ml_name, size);\n            return NULL;\n        }\n        break;\n    case METH_O:\n        if (likely(kw == NULL || PyDict_Size(kw) == 0)) {\n            size = PyTuple_GET_SIZE(arg);\n            if (likely(size == 1)) {\n                PyObject *result, *arg0;\n                #if CYTHON_ASSUME_SAFE_MACROS && !CYTHON_AVOID_BORROWED_REFS\n                arg0 = PyTuple_GET_ITEM(arg, 0);\n                #else\n                arg0 = PySequence_ITEM(arg, 0); if (unlikely(!arg0)) return NULL;\n                #endif\n                result = (*meth)(self, arg0);\n                #if !(CYTHON_ASSUME_SAFE_MACROS && !CYTHON_AVOID_BORROWED_REFS)\n                Py_DECREF(arg0);\n                #endif\n                return result;\n            }\n            PyErr_Format(PyExc_TypeError,\n                \"%.200s() takes exactly one argument (%\" CYTHON_FORMAT_SSIZE_T \"d given)\",\n                f->m_ml->ml_name, size);\n            return NULL;\n        }\n        break;\n    default:\n        PyErr_SetString(PyExc_SystemError, \"Bad call flags in \"\n                        \"__Pyx_CyFunction_Call. METH_OLDARGS is no \"\n                        \"longer supported!\");\n        return NULL;\n    }\n    PyErr_Format(PyExc_TypeError, \"%.200s() takes no keyword arguments\",\n                 f->m_ml->ml_name);\n    return NULL;\n}\nstatic CYTHON_INLINE PyObject *__Pyx_CyFunction_Call(PyObject *func, PyObject *arg, PyObject *kw) {\n    return __Pyx_CyFunction_CallMethod(func, ((PyCFunctionObject*)func)->m_self, arg, kw);\n}\nstatic PyObject *__Pyx_CyFunction_CallAsMethod(PyObject *func, PyObject *args, PyObject *kw) {\n    PyObject *result;\n    __pyx_CyFunctionObject *cyfunc = (__pyx_CyFunctionObject *) func;\n    if ((cyfunc->flags & __Pyx_CYFUNCTION_CCLASS) && !(cyfunc->flags & __Pyx_CYFUNCTION_STATICMETHOD)) {\n        Py_ssize_t argc;\n        PyObject *new_args;\n        PyObject *self;\n        argc = PyTuple_GET_SIZE(args);\n        new_args = PyTuple_GetSlice(args, 1, argc);\n        if (unlikely(!new_args))\n            return NULL;\n        self = PyTuple_GetItem(args, 0);\n        if (unlikely(!self)) {\n            Py_DECREF(new_args);\n            return NULL;\n        }\n        result = __Pyx_CyFunction_CallMethod(func, self, new_args, kw);\n        Py_DECREF(new_args);\n    } else {\n        result = __Pyx_CyFunction_Call(func, args, kw);\n    }\n    return result;\n}\nstatic PyTypeObject __pyx_CyFunctionType_type = {\n    PyVarObject_HEAD_INIT(0, 0)\n    \"cython_function_or_method\",\n    sizeof(__pyx_CyFunctionObject),\n    0,\n    (destructor) __Pyx_CyFunction_dealloc,\n    0,\n    0,\n    0,\n#if PY_MAJOR_VERSION < 3\n    0,\n#else\n    0,\n#endif\n    (reprfunc) __Pyx_CyFunction_repr,\n    0,\n    0,\n    0,\n    0,\n    __Pyx_CyFunction_CallAsMethod,\n    0,\n    0,\n    0,\n    0,\n    Py_TPFLAGS_DEFAULT | Py_TPFLAGS_HAVE_GC,\n    0,\n    (traverseproc) __Pyx_CyFunction_traverse,\n    (inquiry) __Pyx_CyFunction_clear,\n    0,\n#if PY_VERSION_HEX < 0x030500A0\n    offsetof(__pyx_CyFunctionObject, func_weakreflist),\n#else\n    offsetof(PyCFunctionObject, m_weakreflist),\n#endif\n    0,\n    0,\n    __pyx_CyFunction_methods,\n    __pyx_CyFunction_members,\n    __pyx_CyFunction_getsets,\n    0,\n    0,\n    __Pyx_CyFunction_descr_get,\n    0,\n    offsetof(__pyx_CyFunctionObject, func_dict),\n    0,\n    0,\n    0,\n    0,\n    0,\n    0,\n    0,\n    0,\n    0,\n    0,\n    0,\n    0,\n#if PY_VERSION_HEX >= 0x030400a1\n    0,\n#endif\n};\nstatic int __pyx_CyFunction_init(void) {\n    __pyx_CyFunctionType = __Pyx_FetchCommonType(&__pyx_CyFunctionType_type);\n    if (unlikely(__pyx_CyFunctionType == NULL)) {\n        return -1;\n    }\n    return 0;\n}\nstatic CYTHON_INLINE void *__Pyx_CyFunction_InitDefaults(PyObject *func, size_t size, int pyobjects) {\n    __pyx_CyFunctionObject *m = (__pyx_CyFunctionObject *) func;\n    m->defaults = PyObject_Malloc(size);\n    if (unlikely(!m->defaults))\n        return PyErr_NoMemory();\n    memset(m->defaults, 0, size);\n    m->defaults_pyobjects = pyobjects;\n    return m->defaults;\n}\nstatic CYTHON_INLINE void __Pyx_CyFunction_SetDefaultsTuple(PyObject *func, PyObject *tuple) {\n    __pyx_CyFunctionObject *m = (__pyx_CyFunctionObject *) func;\n    m->defaults_tuple = tuple;\n    Py_INCREF(tuple);\n}\nstatic CYTHON_INLINE void __Pyx_CyFunction_SetDefaultsKwDict(PyObject *func, PyObject *dict) {\n    __pyx_CyFunctionObject *m = (__pyx_CyFunctionObject *) func;\n    m->defaults_kwdict = dict;\n    Py_INCREF(dict);\n}\nstatic CYTHON_INLINE void __Pyx_CyFunction_SetAnnotationsDict(PyObject *func, PyObject *dict) {\n    __pyx_CyFunctionObject *m = (__pyx_CyFunctionObject *) func;\n    m->func_annotations = dict;\n    Py_INCREF(dict);\n}\n\n/* CLineInTraceback */\n              #ifndef CYTHON_CLINE_IN_TRACEBACK\nstatic int __Pyx_CLineForTraceback(CYTHON_UNUSED PyThreadState *tstate, int c_line) {\n    PyObject *use_cline;\n    PyObject *ptype, *pvalue, *ptraceback;\n#if CYTHON_COMPILING_IN_CPYTHON\n    PyObject **cython_runtime_dict;\n#endif\n    if (unlikely(!__pyx_cython_runtime)) {\n        return c_line;\n    }\n    __Pyx_ErrFetchInState(tstate, &ptype, &pvalue, &ptraceback);\n#if CYTHON_COMPILING_IN_CPYTHON\n    cython_runtime_dict = _PyObject_GetDictPtr(__pyx_cython_runtime);\n    if (likely(cython_runtime_dict)) {\n      use_cline = __Pyx_PyDict_GetItemStr(*cython_runtime_dict, __pyx_n_s_cline_in_traceback);\n    } else\n#endif\n    {\n      PyObject *use_cline_obj = __Pyx_PyObject_GetAttrStr(__pyx_cython_runtime, __pyx_n_s_cline_in_traceback);\n      if (use_cline_obj) {\n        use_cline = PyObject_Not(use_cline_obj) ? Py_False : Py_True;\n        Py_DECREF(use_cline_obj);\n      } else {\n        PyErr_Clear();\n        use_cline = NULL;\n      }\n    }\n    if (!use_cline) {\n        c_line = 0;\n        PyObject_SetAttr(__pyx_cython_runtime, __pyx_n_s_cline_in_traceback, Py_False);\n    }\n    else if (PyObject_Not(use_cline) != 0) {\n        c_line = 0;\n    }\n    __Pyx_ErrRestoreInState(tstate, ptype, pvalue, ptraceback);\n    return c_line;\n}\n#endif\n\n/* CodeObjectCache */\n              static int __pyx_bisect_code_objects(__Pyx_CodeObjectCacheEntry* entries, int count, int code_line) {\n    int start = 0, mid = 0, end = count - 1;\n    if (end >= 0 && code_line > entries[end].code_line) {\n        return count;\n    }\n    while (start < end) {\n        mid = start + (end - start) / 2;\n        if (code_line < entries[mid].code_line) {\n            end = mid;\n        } else if (code_line > entries[mid].code_line) {\n             start = mid + 1;\n        } else {\n            return mid;\n        }\n    }\n    if (code_line <= entries[mid].code_line) {\n        return mid;\n    } else {\n        return mid + 1;\n    }\n}\nstatic PyCodeObject *__pyx_find_code_object(int code_line) {\n    PyCodeObject* code_object;\n    int pos;\n    if (unlikely(!code_line) || unlikely(!__pyx_code_cache.entries)) {\n        return NULL;\n    }\n    pos = __pyx_bisect_code_objects(__pyx_code_cache.entries, __pyx_code_cache.count, code_line);\n    if (unlikely(pos >= __pyx_code_cache.count) || unlikely(__pyx_code_cache.entries[pos].code_line != code_line)) {\n        return NULL;\n    }\n    code_object = __pyx_code_cache.entries[pos].code_object;\n    Py_INCREF(code_object);\n    return code_object;\n}\nstatic void __pyx_insert_code_object(int code_line, PyCodeObject* code_object) {\n    int pos, i;\n    __Pyx_CodeObjectCacheEntry* entries = __pyx_code_cache.entries;\n    if (unlikely(!code_line)) {\n        return;\n    }\n    if (unlikely(!entries)) {\n        entries = (__Pyx_CodeObjectCacheEntry*)PyMem_Malloc(64*sizeof(__Pyx_CodeObjectCacheEntry));\n        if (likely(entries)) {\n            __pyx_code_cache.entries = entries;\n            __pyx_code_cache.max_count = 64;\n            __pyx_code_cache.count = 1;\n            entries[0].code_line = code_line;\n            entries[0].code_object = code_object;\n            Py_INCREF(code_object);\n        }\n        return;\n    }\n    pos = __pyx_bisect_code_objects(__pyx_code_cache.entries, __pyx_code_cache.count, code_line);\n    if ((pos < __pyx_code_cache.count) && unlikely(__pyx_code_cache.entries[pos].code_line == code_line)) {\n        PyCodeObject* tmp = entries[pos].code_object;\n        entries[pos].code_object = code_object;\n        Py_DECREF(tmp);\n        return;\n    }\n    if (__pyx_code_cache.count == __pyx_code_cache.max_count) {\n        int new_max = __pyx_code_cache.max_count + 64;\n        entries = (__Pyx_CodeObjectCacheEntry*)PyMem_Realloc(\n            __pyx_code_cache.entries, (size_t)new_max*sizeof(__Pyx_CodeObjectCacheEntry));\n        if (unlikely(!entries)) {\n            return;\n        }\n        __pyx_code_cache.entries = entries;\n        __pyx_code_cache.max_count = new_max;\n    }\n    for (i=__pyx_code_cache.count; i>pos; i--) {\n        entries[i] = entries[i-1];\n    }\n    entries[pos].code_line = code_line;\n    entries[pos].code_object = code_object;\n    __pyx_code_cache.count++;\n    Py_INCREF(code_object);\n}\n\n/* AddTraceback */\n              #include \"compile.h\"\n#include \"frameobject.h\"\n#include \"traceback.h\"\nstatic PyCodeObject* __Pyx_CreateCodeObjectForTraceback(\n            const char *funcname, int c_line,\n            int py_line, const char *filename) {\n    PyCodeObject *py_code = 0;\n    PyObject *py_srcfile = 0;\n    PyObject *py_funcname = 0;\n    #if PY_MAJOR_VERSION < 3\n    py_srcfile = PyString_FromString(filename);\n    #else\n    py_srcfile = PyUnicode_FromString(filename);\n    #endif\n    if (!py_srcfile) goto bad;\n    if (c_line) {\n        #if PY_MAJOR_VERSION < 3\n        py_funcname = PyString_FromFormat( \"%s (%s:%d)\", funcname, __pyx_cfilenm, c_line);\n        #else\n        py_funcname = PyUnicode_FromFormat( \"%s (%s:%d)\", funcname, __pyx_cfilenm, c_line);\n        #endif\n    }\n    else {\n        #if PY_MAJOR_VERSION < 3\n        py_funcname = PyString_FromString(funcname);\n        #else\n        py_funcname = PyUnicode_FromString(funcname);\n        #endif\n    }\n    if (!py_funcname) goto bad;\n    py_code = __Pyx_PyCode_New(\n        0,\n        0,\n        0,\n        0,\n        0,\n        __pyx_empty_bytes, /*PyObject *code,*/\n        __pyx_empty_tuple, /*PyObject *consts,*/\n        __pyx_empty_tuple, /*PyObject *names,*/\n        __pyx_empty_tuple, /*PyObject *varnames,*/\n        __pyx_empty_tuple, /*PyObject *freevars,*/\n        __pyx_empty_tuple, /*PyObject *cellvars,*/\n        py_srcfile,   /*PyObject *filename,*/\n        py_funcname,  /*PyObject *name,*/\n        py_line,\n        __pyx_empty_bytes  /*PyObject *lnotab*/\n    );\n    Py_DECREF(py_srcfile);\n    Py_DECREF(py_funcname);\n    return py_code;\nbad:\n    Py_XDECREF(py_srcfile);\n    Py_XDECREF(py_funcname);\n    return NULL;\n}\nstatic void __Pyx_AddTraceback(const char *funcname, int c_line,\n                               int py_line, const char *filename) {\n    PyCodeObject *py_code = 0;\n    PyFrameObject *py_frame = 0;\n    PyThreadState *tstate = __Pyx_PyThreadState_Current;\n    if (c_line) {\n        c_line = __Pyx_CLineForTraceback(tstate, c_line);\n    }\n    py_code = __pyx_find_code_object(c_line ? -c_line : py_line);\n    if (!py_code) {\n        py_code = __Pyx_CreateCodeObjectForTraceback(\n            funcname, c_line, py_line, filename);\n        if (!py_code) goto bad;\n        __pyx_insert_code_object(c_line ? -c_line : py_line, py_code);\n    }\n    py_frame = PyFrame_New(\n        tstate,            /*PyThreadState *tstate,*/\n        py_code,           /*PyCodeObject *code,*/\n        __pyx_d,    /*PyObject *globals,*/\n        0                  /*PyObject *locals*/\n    );\n    if (!py_frame) goto bad;\n    __Pyx_PyFrame_SetLineNumber(py_frame, py_line);\n    PyTraceBack_Here(py_frame);\nbad:\n    Py_XDECREF(py_code);\n    Py_XDECREF(py_frame);\n}\n\n/* CIntFromPyVerify */\n              #define __PYX_VERIFY_RETURN_INT(target_type, func_type, func_value)\\\n    __PYX__VERIFY_RETURN_INT(target_type, func_type, func_value, 0)\n#define __PYX_VERIFY_RETURN_INT_EXC(target_type, func_type, func_value)\\\n    __PYX__VERIFY_RETURN_INT(target_type, func_type, func_value, 1)\n#define __PYX__VERIFY_RETURN_INT(target_type, func_type, func_value, exc)\\\n    {\\\n        func_type value = func_value;\\\n        if (sizeof(target_type) < sizeof(func_type)) {\\\n            if (unlikely(value != (func_type) (target_type) value)) {\\\n                func_type zero = 0;\\\n                if (exc && unlikely(value == (func_type)-1 && PyErr_Occurred()))\\\n                    return (target_type) -1;\\\n                if (is_unsigned && unlikely(value < zero))\\\n                    goto raise_neg_overflow;\\\n                else\\\n                    goto raise_overflow;\\\n            }\\\n        }\\\n        return (target_type) value;\\\n    }\n\n/* CIntToPy */\n              static CYTHON_INLINE PyObject* __Pyx_PyInt_From_int(int value) {\n    const int neg_one = (int) -1, const_zero = (int) 0;\n    const int is_unsigned = neg_one > const_zero;\n    if (is_unsigned) {\n        if (sizeof(int) < sizeof(long)) {\n            return PyInt_FromLong((long) value);\n        } else if (sizeof(int) <= sizeof(unsigned long)) {\n            return PyLong_FromUnsignedLong((unsigned long) value);\n#ifdef HAVE_LONG_LONG\n        } else if (sizeof(int) <= sizeof(unsigned PY_LONG_LONG)) {\n            return PyLong_FromUnsignedLongLong((unsigned PY_LONG_LONG) value);\n#endif\n        }\n    } else {\n        if (sizeof(int) <= sizeof(long)) {\n            return PyInt_FromLong((long) value);\n#ifdef HAVE_LONG_LONG\n        } else if (sizeof(int) <= sizeof(PY_LONG_LONG)) {\n            return PyLong_FromLongLong((PY_LONG_LONG) value);\n#endif\n        }\n    }\n    {\n        int one = 1; int little = (int)*(unsigned char *)&one;\n        unsigned char *bytes = (unsigned char *)&value;\n        return _PyLong_FromByteArray(bytes, sizeof(int),\n                                     little, !is_unsigned);\n    }\n}\n\n/* CIntToPy */\n              static CYTHON_INLINE PyObject* __Pyx_PyInt_From_uint64_t(uint64_t value) {\n    const uint64_t neg_one = (uint64_t) -1, const_zero = (uint64_t) 0;\n    const int is_unsigned = neg_one > const_zero;\n    if (is_unsigned) {\n        if (sizeof(uint64_t) < sizeof(long)) {\n            return PyInt_FromLong((long) value);\n        } else if (sizeof(uint64_t) <= sizeof(unsigned long)) {\n            return PyLong_FromUnsignedLong((unsigned long) value);\n#ifdef HAVE_LONG_LONG\n        } else if (sizeof(uint64_t) <= sizeof(unsigned PY_LONG_LONG)) {\n            return PyLong_FromUnsignedLongLong((unsigned PY_LONG_LONG) value);\n#endif\n        }\n    } else {\n        if (sizeof(uint64_t) <= sizeof(long)) {\n            return PyInt_FromLong((long) value);\n#ifdef HAVE_LONG_LONG\n        } else if (sizeof(uint64_t) <= sizeof(PY_LONG_LONG)) {\n            return PyLong_FromLongLong((PY_LONG_LONG) value);\n#endif\n        }\n    }\n    {\n        int one = 1; int little = (int)*(unsigned char *)&one;\n        unsigned char *bytes = (unsigned char *)&value;\n        return _PyLong_FromByteArray(bytes, sizeof(uint64_t),\n                                     little, !is_unsigned);\n    }\n}\n\n/* CIntToPy */\n              static CYTHON_INLINE PyObject* __Pyx_PyInt_From_uint32_t(uint32_t value) {\n    const uint32_t neg_one = (uint32_t) -1, const_zero = (uint32_t) 0;\n    const int is_unsigned = neg_one > const_zero;\n    if (is_unsigned) {\n        if (sizeof(uint32_t) < sizeof(long)) {\n            return PyInt_FromLong((long) value);\n        } else if (sizeof(uint32_t) <= sizeof(unsigned long)) {\n            return PyLong_FromUnsignedLong((unsigned long) value);\n#ifdef HAVE_LONG_LONG\n        } else if (sizeof(uint32_t) <= sizeof(unsigned PY_LONG_LONG)) {\n            return PyLong_FromUnsignedLongLong((unsigned PY_LONG_LONG) value);\n#endif\n        }\n    } else {\n        if (sizeof(uint32_t) <= sizeof(long)) {\n            return PyInt_FromLong((long) value);\n#ifdef HAVE_LONG_LONG\n        } else if (sizeof(uint32_t) <= sizeof(PY_LONG_LONG)) {\n            return PyLong_FromLongLong((PY_LONG_LONG) value);\n#endif\n        }\n    }\n    {\n        int one = 1; int little = (int)*(unsigned char *)&one;\n        unsigned char *bytes = (unsigned char *)&value;\n        return _PyLong_FromByteArray(bytes, sizeof(uint32_t),\n                                     little, !is_unsigned);\n    }\n}\n\n/* CIntToPy */\n              static CYTHON_INLINE PyObject* __Pyx_PyInt_From_int64_t(int64_t value) {\n    const int64_t neg_one = (int64_t) -1, const_zero = (int64_t) 0;\n    const int is_unsigned = neg_one > const_zero;\n    if (is_unsigned) {\n        if (sizeof(int64_t) < sizeof(long)) {\n            return PyInt_FromLong((long) value);\n        } else if (sizeof(int64_t) <= sizeof(unsigned long)) {\n            return PyLong_FromUnsignedLong((unsigned long) value);\n#ifdef HAVE_LONG_LONG\n        } else if (sizeof(int64_t) <= sizeof(unsigned PY_LONG_LONG)) {\n            return PyLong_FromUnsignedLongLong((unsigned PY_LONG_LONG) value);\n#endif\n        }\n    } else {\n        if (sizeof(int64_t) <= sizeof(long)) {\n            return PyInt_FromLong((long) value);\n#ifdef HAVE_LONG_LONG\n        } else if (sizeof(int64_t) <= sizeof(PY_LONG_LONG)) {\n            return PyLong_FromLongLong((PY_LONG_LONG) value);\n#endif\n        }\n    }\n    {\n        int one = 1; int little = (int)*(unsigned char *)&one;\n        unsigned char *bytes = (unsigned char *)&value;\n        return _PyLong_FromByteArray(bytes, sizeof(int64_t),\n                                     little, !is_unsigned);\n    }\n}\n\n/* CIntToPy */\n              static CYTHON_INLINE PyObject* __Pyx_PyInt_From_int32_t(int32_t value) {\n    const int32_t neg_one = (int32_t) -1, const_zero = (int32_t) 0;\n    const int is_unsigned = neg_one > const_zero;\n    if (is_unsigned) {\n        if (sizeof(int32_t) < sizeof(long)) {\n            return PyInt_FromLong((long) value);\n        } else if (sizeof(int32_t) <= sizeof(unsigned long)) {\n            return PyLong_FromUnsignedLong((unsigned long) value);\n#ifdef HAVE_LONG_LONG\n        } else if (sizeof(int32_t) <= sizeof(unsigned PY_LONG_LONG)) {\n            return PyLong_FromUnsignedLongLong((unsigned PY_LONG_LONG) value);\n#endif\n        }\n    } else {\n        if (sizeof(int32_t) <= sizeof(long)) {\n            return PyInt_FromLong((long) value);\n#ifdef HAVE_LONG_LONG\n        } else if (sizeof(int32_t) <= sizeof(PY_LONG_LONG)) {\n            return PyLong_FromLongLong((PY_LONG_LONG) value);\n#endif\n        }\n    }\n    {\n        int one = 1; int little = (int)*(unsigned char *)&one;\n        unsigned char *bytes = (unsigned char *)&value;\n        return _PyLong_FromByteArray(bytes, sizeof(int32_t),\n                                     little, !is_unsigned);\n    }\n}\n\n/* CIntFromPy */\n              static CYTHON_INLINE size_t __Pyx_PyInt_As_size_t(PyObject *x) {\n    const size_t neg_one = (size_t) -1, const_zero = (size_t) 0;\n    const int is_unsigned = neg_one > const_zero;\n#if PY_MAJOR_VERSION < 3\n    if (likely(PyInt_Check(x))) {\n        if (sizeof(size_t) < sizeof(long)) {\n            __PYX_VERIFY_RETURN_INT(size_t, long, PyInt_AS_LONG(x))\n        } else {\n            long val = PyInt_AS_LONG(x);\n            if (is_unsigned && unlikely(val < 0)) {\n                goto raise_neg_overflow;\n            }\n            return (size_t) val;\n        }\n    } else\n#endif\n    if (likely(PyLong_Check(x))) {\n        if (is_unsigned) {\n#if CYTHON_USE_PYLONG_INTERNALS\n            const digit* digits = ((PyLongObject*)x)->ob_digit;\n            switch (Py_SIZE(x)) {\n                case  0: return (size_t) 0;\n                case  1: __PYX_VERIFY_RETURN_INT(size_t, digit, digits[0])\n                case 2:\n                    if (8 * sizeof(size_t) > 1 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 2 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(size_t, unsigned long, (((((unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(size_t) >= 2 * PyLong_SHIFT) {\n                            return (size_t) (((((size_t)digits[1]) << PyLong_SHIFT) | (size_t)digits[0]));\n                        }\n                    }\n                    break;\n                case 3:\n                    if (8 * sizeof(size_t) > 2 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 3 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(size_t, unsigned long, (((((((unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(size_t) >= 3 * PyLong_SHIFT) {\n                            return (size_t) (((((((size_t)digits[2]) << PyLong_SHIFT) | (size_t)digits[1]) << PyLong_SHIFT) | (size_t)digits[0]));\n                        }\n                    }\n                    break;\n                case 4:\n                    if (8 * sizeof(size_t) > 3 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 4 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(size_t, unsigned long, (((((((((unsigned long)digits[3]) << PyLong_SHIFT) | (unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(size_t) >= 4 * PyLong_SHIFT) {\n                            return (size_t) (((((((((size_t)digits[3]) << PyLong_SHIFT) | (size_t)digits[2]) << PyLong_SHIFT) | (size_t)digits[1]) << PyLong_SHIFT) | (size_t)digits[0]));\n                        }\n                    }\n                    break;\n            }\n#endif\n#if CYTHON_COMPILING_IN_CPYTHON\n            if (unlikely(Py_SIZE(x) < 0)) {\n                goto raise_neg_overflow;\n            }\n#else\n            {\n                int result = PyObject_RichCompareBool(x, Py_False, Py_LT);\n                if (unlikely(result < 0))\n                    return (size_t) -1;\n                if (unlikely(result == 1))\n                    goto raise_neg_overflow;\n            }\n#endif\n            if (sizeof(size_t) <= sizeof(unsigned long)) {\n                __PYX_VERIFY_RETURN_INT_EXC(size_t, unsigned long, PyLong_AsUnsignedLong(x))\n#ifdef HAVE_LONG_LONG\n            } else if (sizeof(size_t) <= sizeof(unsigned PY_LONG_LONG)) {\n                __PYX_VERIFY_RETURN_INT_EXC(size_t, unsigned PY_LONG_LONG, PyLong_AsUnsignedLongLong(x))\n#endif\n            }\n        } else {\n#if CYTHON_USE_PYLONG_INTERNALS\n            const digit* digits = ((PyLongObject*)x)->ob_digit;\n            switch (Py_SIZE(x)) {\n                case  0: return (size_t) 0;\n                case -1: __PYX_VERIFY_RETURN_INT(size_t, sdigit, (sdigit) (-(sdigit)digits[0]))\n                case  1: __PYX_VERIFY_RETURN_INT(size_t,  digit, +digits[0])\n                case -2:\n                    if (8 * sizeof(size_t) - 1 > 1 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 2 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(size_t, long, -(long) (((((unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(size_t) - 1 > 2 * PyLong_SHIFT) {\n                            return (size_t) (((size_t)-1)*(((((size_t)digits[1]) << PyLong_SHIFT) | (size_t)digits[0])));\n                        }\n                    }\n                    break;\n                case 2:\n                    if (8 * sizeof(size_t) > 1 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 2 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(size_t, unsigned long, (((((unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(size_t) - 1 > 2 * PyLong_SHIFT) {\n                            return (size_t) ((((((size_t)digits[1]) << PyLong_SHIFT) | (size_t)digits[0])));\n                        }\n                    }\n                    break;\n                case -3:\n                    if (8 * sizeof(size_t) - 1 > 2 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 3 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(size_t, long, -(long) (((((((unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(size_t) - 1 > 3 * PyLong_SHIFT) {\n                            return (size_t) (((size_t)-1)*(((((((size_t)digits[2]) << PyLong_SHIFT) | (size_t)digits[1]) << PyLong_SHIFT) | (size_t)digits[0])));\n                        }\n                    }\n                    break;\n                case 3:\n                    if (8 * sizeof(size_t) > 2 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 3 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(size_t, unsigned long, (((((((unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(size_t) - 1 > 3 * PyLong_SHIFT) {\n                            return (size_t) ((((((((size_t)digits[2]) << PyLong_SHIFT) | (size_t)digits[1]) << PyLong_SHIFT) | (size_t)digits[0])));\n                        }\n                    }\n                    break;\n                case -4:\n                    if (8 * sizeof(size_t) - 1 > 3 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 4 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(size_t, long, -(long) (((((((((unsigned long)digits[3]) << PyLong_SHIFT) | (unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(size_t) - 1 > 4 * PyLong_SHIFT) {\n                            return (size_t) (((size_t)-1)*(((((((((size_t)digits[3]) << PyLong_SHIFT) | (size_t)digits[2]) << PyLong_SHIFT) | (size_t)digits[1]) << PyLong_SHIFT) | (size_t)digits[0])));\n                        }\n                    }\n                    break;\n                case 4:\n                    if (8 * sizeof(size_t) > 3 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 4 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(size_t, unsigned long, (((((((((unsigned long)digits[3]) << PyLong_SHIFT) | (unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(size_t) - 1 > 4 * PyLong_SHIFT) {\n                            return (size_t) ((((((((((size_t)digits[3]) << PyLong_SHIFT) | (size_t)digits[2]) << PyLong_SHIFT) | (size_t)digits[1]) << PyLong_SHIFT) | (size_t)digits[0])));\n                        }\n                    }\n                    break;\n            }\n#endif\n            if (sizeof(size_t) <= sizeof(long)) {\n                __PYX_VERIFY_RETURN_INT_EXC(size_t, long, PyLong_AsLong(x))\n#ifdef HAVE_LONG_LONG\n            } else if (sizeof(size_t) <= sizeof(PY_LONG_LONG)) {\n                __PYX_VERIFY_RETURN_INT_EXC(size_t, PY_LONG_LONG, PyLong_AsLongLong(x))\n#endif\n            }\n        }\n        {\n#if CYTHON_COMPILING_IN_PYPY && !defined(_PyLong_AsByteArray)\n            PyErr_SetString(PyExc_RuntimeError,\n                            \"_PyLong_AsByteArray() not available in PyPy, cannot convert large numbers\");\n#else\n            size_t val;\n            PyObject *v = __Pyx_PyNumber_IntOrLong(x);\n #if PY_MAJOR_VERSION < 3\n            if (likely(v) && !PyLong_Check(v)) {\n                PyObject *tmp = v;\n                v = PyNumber_Long(tmp);\n                Py_DECREF(tmp);\n            }\n #endif\n            if (likely(v)) {\n                int one = 1; int is_little = (int)*(unsigned char *)&one;\n                unsigned char *bytes = (unsigned char *)&val;\n                int ret = _PyLong_AsByteArray((PyLongObject *)v,\n                                              bytes, sizeof(val),\n                                              is_little, !is_unsigned);\n                Py_DECREF(v);\n                if (likely(!ret))\n                    return val;\n            }\n#endif\n            return (size_t) -1;\n        }\n    } else {\n        size_t val;\n        PyObject *tmp = __Pyx_PyNumber_IntOrLong(x);\n        if (!tmp) return (size_t) -1;\n        val = __Pyx_PyInt_As_size_t(tmp);\n        Py_DECREF(tmp);\n        return val;\n    }\nraise_overflow:\n    PyErr_SetString(PyExc_OverflowError,\n        \"value too large to convert to size_t\");\n    return (size_t) -1;\nraise_neg_overflow:\n    PyErr_SetString(PyExc_OverflowError,\n        \"can't convert negative value to size_t\");\n    return (size_t) -1;\n}\n\n/* CIntFromPy */\n              static CYTHON_INLINE int64_t __Pyx_PyInt_As_int64_t(PyObject *x) {\n    const int64_t neg_one = (int64_t) -1, const_zero = (int64_t) 0;\n    const int is_unsigned = neg_one > const_zero;\n#if PY_MAJOR_VERSION < 3\n    if (likely(PyInt_Check(x))) {\n        if (sizeof(int64_t) < sizeof(long)) {\n            __PYX_VERIFY_RETURN_INT(int64_t, long, PyInt_AS_LONG(x))\n        } else {\n            long val = PyInt_AS_LONG(x);\n            if (is_unsigned && unlikely(val < 0)) {\n                goto raise_neg_overflow;\n            }\n            return (int64_t) val;\n        }\n    } else\n#endif\n    if (likely(PyLong_Check(x))) {\n        if (is_unsigned) {\n#if CYTHON_USE_PYLONG_INTERNALS\n            const digit* digits = ((PyLongObject*)x)->ob_digit;\n            switch (Py_SIZE(x)) {\n                case  0: return (int64_t) 0;\n                case  1: __PYX_VERIFY_RETURN_INT(int64_t, digit, digits[0])\n                case 2:\n                    if (8 * sizeof(int64_t) > 1 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 2 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(int64_t, unsigned long, (((((unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(int64_t) >= 2 * PyLong_SHIFT) {\n                            return (int64_t) (((((int64_t)digits[1]) << PyLong_SHIFT) | (int64_t)digits[0]));\n                        }\n                    }\n                    break;\n                case 3:\n                    if (8 * sizeof(int64_t) > 2 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 3 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(int64_t, unsigned long, (((((((unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(int64_t) >= 3 * PyLong_SHIFT) {\n                            return (int64_t) (((((((int64_t)digits[2]) << PyLong_SHIFT) | (int64_t)digits[1]) << PyLong_SHIFT) | (int64_t)digits[0]));\n                        }\n                    }\n                    break;\n                case 4:\n                    if (8 * sizeof(int64_t) > 3 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 4 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(int64_t, unsigned long, (((((((((unsigned long)digits[3]) << PyLong_SHIFT) | (unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(int64_t) >= 4 * PyLong_SHIFT) {\n                            return (int64_t) (((((((((int64_t)digits[3]) << PyLong_SHIFT) | (int64_t)digits[2]) << PyLong_SHIFT) | (int64_t)digits[1]) << PyLong_SHIFT) | (int64_t)digits[0]));\n                        }\n                    }\n                    break;\n            }\n#endif\n#if CYTHON_COMPILING_IN_CPYTHON\n            if (unlikely(Py_SIZE(x) < 0)) {\n                goto raise_neg_overflow;\n            }\n#else\n            {\n                int result = PyObject_RichCompareBool(x, Py_False, Py_LT);\n                if (unlikely(result < 0))\n                    return (int64_t) -1;\n                if (unlikely(result == 1))\n                    goto raise_neg_overflow;\n            }\n#endif\n            if (sizeof(int64_t) <= sizeof(unsigned long)) {\n                __PYX_VERIFY_RETURN_INT_EXC(int64_t, unsigned long, PyLong_AsUnsignedLong(x))\n#ifdef HAVE_LONG_LONG\n            } else if (sizeof(int64_t) <= sizeof(unsigned PY_LONG_LONG)) {\n                __PYX_VERIFY_RETURN_INT_EXC(int64_t, unsigned PY_LONG_LONG, PyLong_AsUnsignedLongLong(x))\n#endif\n            }\n        } else {\n#if CYTHON_USE_PYLONG_INTERNALS\n            const digit* digits = ((PyLongObject*)x)->ob_digit;\n            switch (Py_SIZE(x)) {\n                case  0: return (int64_t) 0;\n                case -1: __PYX_VERIFY_RETURN_INT(int64_t, sdigit, (sdigit) (-(sdigit)digits[0]))\n                case  1: __PYX_VERIFY_RETURN_INT(int64_t,  digit, +digits[0])\n                case -2:\n                    if (8 * sizeof(int64_t) - 1 > 1 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 2 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(int64_t, long, -(long) (((((unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(int64_t) - 1 > 2 * PyLong_SHIFT) {\n                            return (int64_t) (((int64_t)-1)*(((((int64_t)digits[1]) << PyLong_SHIFT) | (int64_t)digits[0])));\n                        }\n                    }\n                    break;\n                case 2:\n                    if (8 * sizeof(int64_t) > 1 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 2 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(int64_t, unsigned long, (((((unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(int64_t) - 1 > 2 * PyLong_SHIFT) {\n                            return (int64_t) ((((((int64_t)digits[1]) << PyLong_SHIFT) | (int64_t)digits[0])));\n                        }\n                    }\n                    break;\n                case -3:\n                    if (8 * sizeof(int64_t) - 1 > 2 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 3 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(int64_t, long, -(long) (((((((unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(int64_t) - 1 > 3 * PyLong_SHIFT) {\n                            return (int64_t) (((int64_t)-1)*(((((((int64_t)digits[2]) << PyLong_SHIFT) | (int64_t)digits[1]) << PyLong_SHIFT) | (int64_t)digits[0])));\n                        }\n                    }\n                    break;\n                case 3:\n                    if (8 * sizeof(int64_t) > 2 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 3 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(int64_t, unsigned long, (((((((unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(int64_t) - 1 > 3 * PyLong_SHIFT) {\n                            return (int64_t) ((((((((int64_t)digits[2]) << PyLong_SHIFT) | (int64_t)digits[1]) << PyLong_SHIFT) | (int64_t)digits[0])));\n                        }\n                    }\n                    break;\n                case -4:\n                    if (8 * sizeof(int64_t) - 1 > 3 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 4 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(int64_t, long, -(long) (((((((((unsigned long)digits[3]) << PyLong_SHIFT) | (unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(int64_t) - 1 > 4 * PyLong_SHIFT) {\n                            return (int64_t) (((int64_t)-1)*(((((((((int64_t)digits[3]) << PyLong_SHIFT) | (int64_t)digits[2]) << PyLong_SHIFT) | (int64_t)digits[1]) << PyLong_SHIFT) | (int64_t)digits[0])));\n                        }\n                    }\n                    break;\n                case 4:\n                    if (8 * sizeof(int64_t) > 3 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 4 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(int64_t, unsigned long, (((((((((unsigned long)digits[3]) << PyLong_SHIFT) | (unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(int64_t) - 1 > 4 * PyLong_SHIFT) {\n                            return (int64_t) ((((((((((int64_t)digits[3]) << PyLong_SHIFT) | (int64_t)digits[2]) << PyLong_SHIFT) | (int64_t)digits[1]) << PyLong_SHIFT) | (int64_t)digits[0])));\n                        }\n                    }\n                    break;\n            }\n#endif\n            if (sizeof(int64_t) <= sizeof(long)) {\n                __PYX_VERIFY_RETURN_INT_EXC(int64_t, long, PyLong_AsLong(x))\n#ifdef HAVE_LONG_LONG\n            } else if (sizeof(int64_t) <= sizeof(PY_LONG_LONG)) {\n                __PYX_VERIFY_RETURN_INT_EXC(int64_t, PY_LONG_LONG, PyLong_AsLongLong(x))\n#endif\n            }\n        }\n        {\n#if CYTHON_COMPILING_IN_PYPY && !defined(_PyLong_AsByteArray)\n            PyErr_SetString(PyExc_RuntimeError,\n                            \"_PyLong_AsByteArray() not available in PyPy, cannot convert large numbers\");\n#else\n            int64_t val;\n            PyObject *v = __Pyx_PyNumber_IntOrLong(x);\n #if PY_MAJOR_VERSION < 3\n            if (likely(v) && !PyLong_Check(v)) {\n                PyObject *tmp = v;\n                v = PyNumber_Long(tmp);\n                Py_DECREF(tmp);\n            }\n #endif\n            if (likely(v)) {\n                int one = 1; int is_little = (int)*(unsigned char *)&one;\n                unsigned char *bytes = (unsigned char *)&val;\n                int ret = _PyLong_AsByteArray((PyLongObject *)v,\n                                              bytes, sizeof(val),\n                                              is_little, !is_unsigned);\n                Py_DECREF(v);\n                if (likely(!ret))\n                    return val;\n            }\n#endif\n            return (int64_t) -1;\n        }\n    } else {\n        int64_t val;\n        PyObject *tmp = __Pyx_PyNumber_IntOrLong(x);\n        if (!tmp) return (int64_t) -1;\n        val = __Pyx_PyInt_As_int64_t(tmp);\n        Py_DECREF(tmp);\n        return val;\n    }\nraise_overflow:\n    PyErr_SetString(PyExc_OverflowError,\n        \"value too large to convert to int64_t\");\n    return (int64_t) -1;\nraise_neg_overflow:\n    PyErr_SetString(PyExc_OverflowError,\n        \"can't convert negative value to int64_t\");\n    return (int64_t) -1;\n}\n\n/* CIntFromPy */\n              static CYTHON_INLINE uint64_t __Pyx_PyInt_As_uint64_t(PyObject *x) {\n    const uint64_t neg_one = (uint64_t) -1, const_zero = (uint64_t) 0;\n    const int is_unsigned = neg_one > const_zero;\n#if PY_MAJOR_VERSION < 3\n    if (likely(PyInt_Check(x))) {\n        if (sizeof(uint64_t) < sizeof(long)) {\n            __PYX_VERIFY_RETURN_INT(uint64_t, long, PyInt_AS_LONG(x))\n        } else {\n            long val = PyInt_AS_LONG(x);\n            if (is_unsigned && unlikely(val < 0)) {\n                goto raise_neg_overflow;\n            }\n            return (uint64_t) val;\n        }\n    } else\n#endif\n    if (likely(PyLong_Check(x))) {\n        if (is_unsigned) {\n#if CYTHON_USE_PYLONG_INTERNALS\n            const digit* digits = ((PyLongObject*)x)->ob_digit;\n            switch (Py_SIZE(x)) {\n                case  0: return (uint64_t) 0;\n                case  1: __PYX_VERIFY_RETURN_INT(uint64_t, digit, digits[0])\n                case 2:\n                    if (8 * sizeof(uint64_t) > 1 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 2 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(uint64_t, unsigned long, (((((unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(uint64_t) >= 2 * PyLong_SHIFT) {\n                            return (uint64_t) (((((uint64_t)digits[1]) << PyLong_SHIFT) | (uint64_t)digits[0]));\n                        }\n                    }\n                    break;\n                case 3:\n                    if (8 * sizeof(uint64_t) > 2 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 3 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(uint64_t, unsigned long, (((((((unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(uint64_t) >= 3 * PyLong_SHIFT) {\n                            return (uint64_t) (((((((uint64_t)digits[2]) << PyLong_SHIFT) | (uint64_t)digits[1]) << PyLong_SHIFT) | (uint64_t)digits[0]));\n                        }\n                    }\n                    break;\n                case 4:\n                    if (8 * sizeof(uint64_t) > 3 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 4 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(uint64_t, unsigned long, (((((((((unsigned long)digits[3]) << PyLong_SHIFT) | (unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(uint64_t) >= 4 * PyLong_SHIFT) {\n                            return (uint64_t) (((((((((uint64_t)digits[3]) << PyLong_SHIFT) | (uint64_t)digits[2]) << PyLong_SHIFT) | (uint64_t)digits[1]) << PyLong_SHIFT) | (uint64_t)digits[0]));\n                        }\n                    }\n                    break;\n            }\n#endif\n#if CYTHON_COMPILING_IN_CPYTHON\n            if (unlikely(Py_SIZE(x) < 0)) {\n                goto raise_neg_overflow;\n            }\n#else\n            {\n                int result = PyObject_RichCompareBool(x, Py_False, Py_LT);\n                if (unlikely(result < 0))\n                    return (uint64_t) -1;\n                if (unlikely(result == 1))\n                    goto raise_neg_overflow;\n            }\n#endif\n            if (sizeof(uint64_t) <= sizeof(unsigned long)) {\n                __PYX_VERIFY_RETURN_INT_EXC(uint64_t, unsigned long, PyLong_AsUnsignedLong(x))\n#ifdef HAVE_LONG_LONG\n            } else if (sizeof(uint64_t) <= sizeof(unsigned PY_LONG_LONG)) {\n                __PYX_VERIFY_RETURN_INT_EXC(uint64_t, unsigned PY_LONG_LONG, PyLong_AsUnsignedLongLong(x))\n#endif\n            }\n        } else {\n#if CYTHON_USE_PYLONG_INTERNALS\n            const digit* digits = ((PyLongObject*)x)->ob_digit;\n            switch (Py_SIZE(x)) {\n                case  0: return (uint64_t) 0;\n                case -1: __PYX_VERIFY_RETURN_INT(uint64_t, sdigit, (sdigit) (-(sdigit)digits[0]))\n                case  1: __PYX_VERIFY_RETURN_INT(uint64_t,  digit, +digits[0])\n                case -2:\n                    if (8 * sizeof(uint64_t) - 1 > 1 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 2 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(uint64_t, long, -(long) (((((unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(uint64_t) - 1 > 2 * PyLong_SHIFT) {\n                            return (uint64_t) (((uint64_t)-1)*(((((uint64_t)digits[1]) << PyLong_SHIFT) | (uint64_t)digits[0])));\n                        }\n                    }\n                    break;\n                case 2:\n                    if (8 * sizeof(uint64_t) > 1 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 2 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(uint64_t, unsigned long, (((((unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(uint64_t) - 1 > 2 * PyLong_SHIFT) {\n                            return (uint64_t) ((((((uint64_t)digits[1]) << PyLong_SHIFT) | (uint64_t)digits[0])));\n                        }\n                    }\n                    break;\n                case -3:\n                    if (8 * sizeof(uint64_t) - 1 > 2 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 3 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(uint64_t, long, -(long) (((((((unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(uint64_t) - 1 > 3 * PyLong_SHIFT) {\n                            return (uint64_t) (((uint64_t)-1)*(((((((uint64_t)digits[2]) << PyLong_SHIFT) | (uint64_t)digits[1]) << PyLong_SHIFT) | (uint64_t)digits[0])));\n                        }\n                    }\n                    break;\n                case 3:\n                    if (8 * sizeof(uint64_t) > 2 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 3 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(uint64_t, unsigned long, (((((((unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(uint64_t) - 1 > 3 * PyLong_SHIFT) {\n                            return (uint64_t) ((((((((uint64_t)digits[2]) << PyLong_SHIFT) | (uint64_t)digits[1]) << PyLong_SHIFT) | (uint64_t)digits[0])));\n                        }\n                    }\n                    break;\n                case -4:\n                    if (8 * sizeof(uint64_t) - 1 > 3 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 4 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(uint64_t, long, -(long) (((((((((unsigned long)digits[3]) << PyLong_SHIFT) | (unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(uint64_t) - 1 > 4 * PyLong_SHIFT) {\n                            return (uint64_t) (((uint64_t)-1)*(((((((((uint64_t)digits[3]) << PyLong_SHIFT) | (uint64_t)digits[2]) << PyLong_SHIFT) | (uint64_t)digits[1]) << PyLong_SHIFT) | (uint64_t)digits[0])));\n                        }\n                    }\n                    break;\n                case 4:\n                    if (8 * sizeof(uint64_t) > 3 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 4 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(uint64_t, unsigned long, (((((((((unsigned long)digits[3]) << PyLong_SHIFT) | (unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(uint64_t) - 1 > 4 * PyLong_SHIFT) {\n                            return (uint64_t) ((((((((((uint64_t)digits[3]) << PyLong_SHIFT) | (uint64_t)digits[2]) << PyLong_SHIFT) | (uint64_t)digits[1]) << PyLong_SHIFT) | (uint64_t)digits[0])));\n                        }\n                    }\n                    break;\n            }\n#endif\n            if (sizeof(uint64_t) <= sizeof(long)) {\n                __PYX_VERIFY_RETURN_INT_EXC(uint64_t, long, PyLong_AsLong(x))\n#ifdef HAVE_LONG_LONG\n            } else if (sizeof(uint64_t) <= sizeof(PY_LONG_LONG)) {\n                __PYX_VERIFY_RETURN_INT_EXC(uint64_t, PY_LONG_LONG, PyLong_AsLongLong(x))\n#endif\n            }\n        }\n        {\n#if CYTHON_COMPILING_IN_PYPY && !defined(_PyLong_AsByteArray)\n            PyErr_SetString(PyExc_RuntimeError,\n                            \"_PyLong_AsByteArray() not available in PyPy, cannot convert large numbers\");\n#else\n            uint64_t val;\n            PyObject *v = __Pyx_PyNumber_IntOrLong(x);\n #if PY_MAJOR_VERSION < 3\n            if (likely(v) && !PyLong_Check(v)) {\n                PyObject *tmp = v;\n                v = PyNumber_Long(tmp);\n                Py_DECREF(tmp);\n            }\n #endif\n            if (likely(v)) {\n                int one = 1; int is_little = (int)*(unsigned char *)&one;\n                unsigned char *bytes = (unsigned char *)&val;\n                int ret = _PyLong_AsByteArray((PyLongObject *)v,\n                                              bytes, sizeof(val),\n                                              is_little, !is_unsigned);\n                Py_DECREF(v);\n                if (likely(!ret))\n                    return val;\n            }\n#endif\n            return (uint64_t) -1;\n        }\n    } else {\n        uint64_t val;\n        PyObject *tmp = __Pyx_PyNumber_IntOrLong(x);\n        if (!tmp) return (uint64_t) -1;\n        val = __Pyx_PyInt_As_uint64_t(tmp);\n        Py_DECREF(tmp);\n        return val;\n    }\nraise_overflow:\n    PyErr_SetString(PyExc_OverflowError,\n        \"value too large to convert to uint64_t\");\n    return (uint64_t) -1;\nraise_neg_overflow:\n    PyErr_SetString(PyExc_OverflowError,\n        \"can't convert negative value to uint64_t\");\n    return (uint64_t) -1;\n}\n\n/* CIntFromPy */\n              static CYTHON_INLINE int32_t __Pyx_PyInt_As_int32_t(PyObject *x) {\n    const int32_t neg_one = (int32_t) -1, const_zero = (int32_t) 0;\n    const int is_unsigned = neg_one > const_zero;\n#if PY_MAJOR_VERSION < 3\n    if (likely(PyInt_Check(x))) {\n        if (sizeof(int32_t) < sizeof(long)) {\n            __PYX_VERIFY_RETURN_INT(int32_t, long, PyInt_AS_LONG(x))\n        } else {\n            long val = PyInt_AS_LONG(x);\n            if (is_unsigned && unlikely(val < 0)) {\n                goto raise_neg_overflow;\n            }\n            return (int32_t) val;\n        }\n    } else\n#endif\n    if (likely(PyLong_Check(x))) {\n        if (is_unsigned) {\n#if CYTHON_USE_PYLONG_INTERNALS\n            const digit* digits = ((PyLongObject*)x)->ob_digit;\n            switch (Py_SIZE(x)) {\n                case  0: return (int32_t) 0;\n                case  1: __PYX_VERIFY_RETURN_INT(int32_t, digit, digits[0])\n                case 2:\n                    if (8 * sizeof(int32_t) > 1 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 2 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(int32_t, unsigned long, (((((unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(int32_t) >= 2 * PyLong_SHIFT) {\n                            return (int32_t) (((((int32_t)digits[1]) << PyLong_SHIFT) | (int32_t)digits[0]));\n                        }\n                    }\n                    break;\n                case 3:\n                    if (8 * sizeof(int32_t) > 2 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 3 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(int32_t, unsigned long, (((((((unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(int32_t) >= 3 * PyLong_SHIFT) {\n                            return (int32_t) (((((((int32_t)digits[2]) << PyLong_SHIFT) | (int32_t)digits[1]) << PyLong_SHIFT) | (int32_t)digits[0]));\n                        }\n                    }\n                    break;\n                case 4:\n                    if (8 * sizeof(int32_t) > 3 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 4 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(int32_t, unsigned long, (((((((((unsigned long)digits[3]) << PyLong_SHIFT) | (unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(int32_t) >= 4 * PyLong_SHIFT) {\n                            return (int32_t) (((((((((int32_t)digits[3]) << PyLong_SHIFT) | (int32_t)digits[2]) << PyLong_SHIFT) | (int32_t)digits[1]) << PyLong_SHIFT) | (int32_t)digits[0]));\n                        }\n                    }\n                    break;\n            }\n#endif\n#if CYTHON_COMPILING_IN_CPYTHON\n            if (unlikely(Py_SIZE(x) < 0)) {\n                goto raise_neg_overflow;\n            }\n#else\n            {\n                int result = PyObject_RichCompareBool(x, Py_False, Py_LT);\n                if (unlikely(result < 0))\n                    return (int32_t) -1;\n                if (unlikely(result == 1))\n                    goto raise_neg_overflow;\n            }\n#endif\n            if (sizeof(int32_t) <= sizeof(unsigned long)) {\n                __PYX_VERIFY_RETURN_INT_EXC(int32_t, unsigned long, PyLong_AsUnsignedLong(x))\n#ifdef HAVE_LONG_LONG\n            } else if (sizeof(int32_t) <= sizeof(unsigned PY_LONG_LONG)) {\n                __PYX_VERIFY_RETURN_INT_EXC(int32_t, unsigned PY_LONG_LONG, PyLong_AsUnsignedLongLong(x))\n#endif\n            }\n        } else {\n#if CYTHON_USE_PYLONG_INTERNALS\n            const digit* digits = ((PyLongObject*)x)->ob_digit;\n            switch (Py_SIZE(x)) {\n                case  0: return (int32_t) 0;\n                case -1: __PYX_VERIFY_RETURN_INT(int32_t, sdigit, (sdigit) (-(sdigit)digits[0]))\n                case  1: __PYX_VERIFY_RETURN_INT(int32_t,  digit, +digits[0])\n                case -2:\n                    if (8 * sizeof(int32_t) - 1 > 1 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 2 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(int32_t, long, -(long) (((((unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(int32_t) - 1 > 2 * PyLong_SHIFT) {\n                            return (int32_t) (((int32_t)-1)*(((((int32_t)digits[1]) << PyLong_SHIFT) | (int32_t)digits[0])));\n                        }\n                    }\n                    break;\n                case 2:\n                    if (8 * sizeof(int32_t) > 1 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 2 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(int32_t, unsigned long, (((((unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(int32_t) - 1 > 2 * PyLong_SHIFT) {\n                            return (int32_t) ((((((int32_t)digits[1]) << PyLong_SHIFT) | (int32_t)digits[0])));\n                        }\n                    }\n                    break;\n                case -3:\n                    if (8 * sizeof(int32_t) - 1 > 2 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 3 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(int32_t, long, -(long) (((((((unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(int32_t) - 1 > 3 * PyLong_SHIFT) {\n                            return (int32_t) (((int32_t)-1)*(((((((int32_t)digits[2]) << PyLong_SHIFT) | (int32_t)digits[1]) << PyLong_SHIFT) | (int32_t)digits[0])));\n                        }\n                    }\n                    break;\n                case 3:\n                    if (8 * sizeof(int32_t) > 2 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 3 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(int32_t, unsigned long, (((((((unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(int32_t) - 1 > 3 * PyLong_SHIFT) {\n                            return (int32_t) ((((((((int32_t)digits[2]) << PyLong_SHIFT) | (int32_t)digits[1]) << PyLong_SHIFT) | (int32_t)digits[0])));\n                        }\n                    }\n                    break;\n                case -4:\n                    if (8 * sizeof(int32_t) - 1 > 3 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 4 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(int32_t, long, -(long) (((((((((unsigned long)digits[3]) << PyLong_SHIFT) | (unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(int32_t) - 1 > 4 * PyLong_SHIFT) {\n                            return (int32_t) (((int32_t)-1)*(((((((((int32_t)digits[3]) << PyLong_SHIFT) | (int32_t)digits[2]) << PyLong_SHIFT) | (int32_t)digits[1]) << PyLong_SHIFT) | (int32_t)digits[0])));\n                        }\n                    }\n                    break;\n                case 4:\n                    if (8 * sizeof(int32_t) > 3 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 4 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(int32_t, unsigned long, (((((((((unsigned long)digits[3]) << PyLong_SHIFT) | (unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(int32_t) - 1 > 4 * PyLong_SHIFT) {\n                            return (int32_t) ((((((((((int32_t)digits[3]) << PyLong_SHIFT) | (int32_t)digits[2]) << PyLong_SHIFT) | (int32_t)digits[1]) << PyLong_SHIFT) | (int32_t)digits[0])));\n                        }\n                    }\n                    break;\n            }\n#endif\n            if (sizeof(int32_t) <= sizeof(long)) {\n                __PYX_VERIFY_RETURN_INT_EXC(int32_t, long, PyLong_AsLong(x))\n#ifdef HAVE_LONG_LONG\n            } else if (sizeof(int32_t) <= sizeof(PY_LONG_LONG)) {\n                __PYX_VERIFY_RETURN_INT_EXC(int32_t, PY_LONG_LONG, PyLong_AsLongLong(x))\n#endif\n            }\n        }\n        {\n#if CYTHON_COMPILING_IN_PYPY && !defined(_PyLong_AsByteArray)\n            PyErr_SetString(PyExc_RuntimeError,\n                            \"_PyLong_AsByteArray() not available in PyPy, cannot convert large numbers\");\n#else\n            int32_t val;\n            PyObject *v = __Pyx_PyNumber_IntOrLong(x);\n #if PY_MAJOR_VERSION < 3\n            if (likely(v) && !PyLong_Check(v)) {\n                PyObject *tmp = v;\n                v = PyNumber_Long(tmp);\n                Py_DECREF(tmp);\n            }\n #endif\n            if (likely(v)) {\n                int one = 1; int is_little = (int)*(unsigned char *)&one;\n                unsigned char *bytes = (unsigned char *)&val;\n                int ret = _PyLong_AsByteArray((PyLongObject *)v,\n                                              bytes, sizeof(val),\n                                              is_little, !is_unsigned);\n                Py_DECREF(v);\n                if (likely(!ret))\n                    return val;\n            }\n#endif\n            return (int32_t) -1;\n        }\n    } else {\n        int32_t val;\n        PyObject *tmp = __Pyx_PyNumber_IntOrLong(x);\n        if (!tmp) return (int32_t) -1;\n        val = __Pyx_PyInt_As_int32_t(tmp);\n        Py_DECREF(tmp);\n        return val;\n    }\nraise_overflow:\n    PyErr_SetString(PyExc_OverflowError,\n        \"value too large to convert to int32_t\");\n    return (int32_t) -1;\nraise_neg_overflow:\n    PyErr_SetString(PyExc_OverflowError,\n        \"can't convert negative value to int32_t\");\n    return (int32_t) -1;\n}\n\n/* CIntFromPy */\n              static CYTHON_INLINE uint32_t __Pyx_PyInt_As_uint32_t(PyObject *x) {\n    const uint32_t neg_one = (uint32_t) -1, const_zero = (uint32_t) 0;\n    const int is_unsigned = neg_one > const_zero;\n#if PY_MAJOR_VERSION < 3\n    if (likely(PyInt_Check(x))) {\n        if (sizeof(uint32_t) < sizeof(long)) {\n            __PYX_VERIFY_RETURN_INT(uint32_t, long, PyInt_AS_LONG(x))\n        } else {\n            long val = PyInt_AS_LONG(x);\n            if (is_unsigned && unlikely(val < 0)) {\n                goto raise_neg_overflow;\n            }\n            return (uint32_t) val;\n        }\n    } else\n#endif\n    if (likely(PyLong_Check(x))) {\n        if (is_unsigned) {\n#if CYTHON_USE_PYLONG_INTERNALS\n            const digit* digits = ((PyLongObject*)x)->ob_digit;\n            switch (Py_SIZE(x)) {\n                case  0: return (uint32_t) 0;\n                case  1: __PYX_VERIFY_RETURN_INT(uint32_t, digit, digits[0])\n                case 2:\n                    if (8 * sizeof(uint32_t) > 1 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 2 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(uint32_t, unsigned long, (((((unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(uint32_t) >= 2 * PyLong_SHIFT) {\n                            return (uint32_t) (((((uint32_t)digits[1]) << PyLong_SHIFT) | (uint32_t)digits[0]));\n                        }\n                    }\n                    break;\n                case 3:\n                    if (8 * sizeof(uint32_t) > 2 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 3 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(uint32_t, unsigned long, (((((((unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(uint32_t) >= 3 * PyLong_SHIFT) {\n                            return (uint32_t) (((((((uint32_t)digits[2]) << PyLong_SHIFT) | (uint32_t)digits[1]) << PyLong_SHIFT) | (uint32_t)digits[0]));\n                        }\n                    }\n                    break;\n                case 4:\n                    if (8 * sizeof(uint32_t) > 3 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 4 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(uint32_t, unsigned long, (((((((((unsigned long)digits[3]) << PyLong_SHIFT) | (unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(uint32_t) >= 4 * PyLong_SHIFT) {\n                            return (uint32_t) (((((((((uint32_t)digits[3]) << PyLong_SHIFT) | (uint32_t)digits[2]) << PyLong_SHIFT) | (uint32_t)digits[1]) << PyLong_SHIFT) | (uint32_t)digits[0]));\n                        }\n                    }\n                    break;\n            }\n#endif\n#if CYTHON_COMPILING_IN_CPYTHON\n            if (unlikely(Py_SIZE(x) < 0)) {\n                goto raise_neg_overflow;\n            }\n#else\n            {\n                int result = PyObject_RichCompareBool(x, Py_False, Py_LT);\n                if (unlikely(result < 0))\n                    return (uint32_t) -1;\n                if (unlikely(result == 1))\n                    goto raise_neg_overflow;\n            }\n#endif\n            if (sizeof(uint32_t) <= sizeof(unsigned long)) {\n                __PYX_VERIFY_RETURN_INT_EXC(uint32_t, unsigned long, PyLong_AsUnsignedLong(x))\n#ifdef HAVE_LONG_LONG\n            } else if (sizeof(uint32_t) <= sizeof(unsigned PY_LONG_LONG)) {\n                __PYX_VERIFY_RETURN_INT_EXC(uint32_t, unsigned PY_LONG_LONG, PyLong_AsUnsignedLongLong(x))\n#endif\n            }\n        } else {\n#if CYTHON_USE_PYLONG_INTERNALS\n            const digit* digits = ((PyLongObject*)x)->ob_digit;\n            switch (Py_SIZE(x)) {\n                case  0: return (uint32_t) 0;\n                case -1: __PYX_VERIFY_RETURN_INT(uint32_t, sdigit, (sdigit) (-(sdigit)digits[0]))\n                case  1: __PYX_VERIFY_RETURN_INT(uint32_t,  digit, +digits[0])\n                case -2:\n                    if (8 * sizeof(uint32_t) - 1 > 1 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 2 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(uint32_t, long, -(long) (((((unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(uint32_t) - 1 > 2 * PyLong_SHIFT) {\n                            return (uint32_t) (((uint32_t)-1)*(((((uint32_t)digits[1]) << PyLong_SHIFT) | (uint32_t)digits[0])));\n                        }\n                    }\n                    break;\n                case 2:\n                    if (8 * sizeof(uint32_t) > 1 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 2 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(uint32_t, unsigned long, (((((unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(uint32_t) - 1 > 2 * PyLong_SHIFT) {\n                            return (uint32_t) ((((((uint32_t)digits[1]) << PyLong_SHIFT) | (uint32_t)digits[0])));\n                        }\n                    }\n                    break;\n                case -3:\n                    if (8 * sizeof(uint32_t) - 1 > 2 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 3 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(uint32_t, long, -(long) (((((((unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(uint32_t) - 1 > 3 * PyLong_SHIFT) {\n                            return (uint32_t) (((uint32_t)-1)*(((((((uint32_t)digits[2]) << PyLong_SHIFT) | (uint32_t)digits[1]) << PyLong_SHIFT) | (uint32_t)digits[0])));\n                        }\n                    }\n                    break;\n                case 3:\n                    if (8 * sizeof(uint32_t) > 2 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 3 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(uint32_t, unsigned long, (((((((unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(uint32_t) - 1 > 3 * PyLong_SHIFT) {\n                            return (uint32_t) ((((((((uint32_t)digits[2]) << PyLong_SHIFT) | (uint32_t)digits[1]) << PyLong_SHIFT) | (uint32_t)digits[0])));\n                        }\n                    }\n                    break;\n                case -4:\n                    if (8 * sizeof(uint32_t) - 1 > 3 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 4 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(uint32_t, long, -(long) (((((((((unsigned long)digits[3]) << PyLong_SHIFT) | (unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(uint32_t) - 1 > 4 * PyLong_SHIFT) {\n                            return (uint32_t) (((uint32_t)-1)*(((((((((uint32_t)digits[3]) << PyLong_SHIFT) | (uint32_t)digits[2]) << PyLong_SHIFT) | (uint32_t)digits[1]) << PyLong_SHIFT) | (uint32_t)digits[0])));\n                        }\n                    }\n                    break;\n                case 4:\n                    if (8 * sizeof(uint32_t) > 3 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 4 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(uint32_t, unsigned long, (((((((((unsigned long)digits[3]) << PyLong_SHIFT) | (unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(uint32_t) - 1 > 4 * PyLong_SHIFT) {\n                            return (uint32_t) ((((((((((uint32_t)digits[3]) << PyLong_SHIFT) | (uint32_t)digits[2]) << PyLong_SHIFT) | (uint32_t)digits[1]) << PyLong_SHIFT) | (uint32_t)digits[0])));\n                        }\n                    }\n                    break;\n            }\n#endif\n            if (sizeof(uint32_t) <= sizeof(long)) {\n                __PYX_VERIFY_RETURN_INT_EXC(uint32_t, long, PyLong_AsLong(x))\n#ifdef HAVE_LONG_LONG\n            } else if (sizeof(uint32_t) <= sizeof(PY_LONG_LONG)) {\n                __PYX_VERIFY_RETURN_INT_EXC(uint32_t, PY_LONG_LONG, PyLong_AsLongLong(x))\n#endif\n            }\n        }\n        {\n#if CYTHON_COMPILING_IN_PYPY && !defined(_PyLong_AsByteArray)\n            PyErr_SetString(PyExc_RuntimeError,\n                            \"_PyLong_AsByteArray() not available in PyPy, cannot convert large numbers\");\n#else\n            uint32_t val;\n            PyObject *v = __Pyx_PyNumber_IntOrLong(x);\n #if PY_MAJOR_VERSION < 3\n            if (likely(v) && !PyLong_Check(v)) {\n                PyObject *tmp = v;\n                v = PyNumber_Long(tmp);\n                Py_DECREF(tmp);\n            }\n #endif\n            if (likely(v)) {\n                int one = 1; int is_little = (int)*(unsigned char *)&one;\n                unsigned char *bytes = (unsigned char *)&val;\n                int ret = _PyLong_AsByteArray((PyLongObject *)v,\n                                              bytes, sizeof(val),\n                                              is_little, !is_unsigned);\n                Py_DECREF(v);\n                if (likely(!ret))\n                    return val;\n            }\n#endif\n            return (uint32_t) -1;\n        }\n    } else {\n        uint32_t val;\n        PyObject *tmp = __Pyx_PyNumber_IntOrLong(x);\n        if (!tmp) return (uint32_t) -1;\n        val = __Pyx_PyInt_As_uint32_t(tmp);\n        Py_DECREF(tmp);\n        return val;\n    }\nraise_overflow:\n    PyErr_SetString(PyExc_OverflowError,\n        \"value too large to convert to uint32_t\");\n    return (uint32_t) -1;\nraise_neg_overflow:\n    PyErr_SetString(PyExc_OverflowError,\n        \"can't convert negative value to uint32_t\");\n    return (uint32_t) -1;\n}\n\n/* CIntFromPy */\n              static CYTHON_INLINE time_t __Pyx_PyInt_As_time_t(PyObject *x) {\n    const time_t neg_one = (time_t) -1, const_zero = (time_t) 0;\n    const int is_unsigned = neg_one > const_zero;\n#if PY_MAJOR_VERSION < 3\n    if (likely(PyInt_Check(x))) {\n        if (sizeof(time_t) < sizeof(long)) {\n            __PYX_VERIFY_RETURN_INT(time_t, long, PyInt_AS_LONG(x))\n        } else {\n            long val = PyInt_AS_LONG(x);\n            if (is_unsigned && unlikely(val < 0)) {\n                goto raise_neg_overflow;\n            }\n            return (time_t) val;\n        }\n    } else\n#endif\n    if (likely(PyLong_Check(x))) {\n        if (is_unsigned) {\n#if CYTHON_USE_PYLONG_INTERNALS\n            const digit* digits = ((PyLongObject*)x)->ob_digit;\n            switch (Py_SIZE(x)) {\n                case  0: return (time_t) 0;\n                case  1: __PYX_VERIFY_RETURN_INT(time_t, digit, digits[0])\n                case 2:\n                    if (8 * sizeof(time_t) > 1 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 2 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(time_t, unsigned long, (((((unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(time_t) >= 2 * PyLong_SHIFT) {\n                            return (time_t) (((((time_t)digits[1]) << PyLong_SHIFT) | (time_t)digits[0]));\n                        }\n                    }\n                    break;\n                case 3:\n                    if (8 * sizeof(time_t) > 2 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 3 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(time_t, unsigned long, (((((((unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(time_t) >= 3 * PyLong_SHIFT) {\n                            return (time_t) (((((((time_t)digits[2]) << PyLong_SHIFT) | (time_t)digits[1]) << PyLong_SHIFT) | (time_t)digits[0]));\n                        }\n                    }\n                    break;\n                case 4:\n                    if (8 * sizeof(time_t) > 3 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 4 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(time_t, unsigned long, (((((((((unsigned long)digits[3]) << PyLong_SHIFT) | (unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(time_t) >= 4 * PyLong_SHIFT) {\n                            return (time_t) (((((((((time_t)digits[3]) << PyLong_SHIFT) | (time_t)digits[2]) << PyLong_SHIFT) | (time_t)digits[1]) << PyLong_SHIFT) | (time_t)digits[0]));\n                        }\n                    }\n                    break;\n            }\n#endif\n#if CYTHON_COMPILING_IN_CPYTHON\n            if (unlikely(Py_SIZE(x) < 0)) {\n                goto raise_neg_overflow;\n            }\n#else\n            {\n                int result = PyObject_RichCompareBool(x, Py_False, Py_LT);\n                if (unlikely(result < 0))\n                    return (time_t) -1;\n                if (unlikely(result == 1))\n                    goto raise_neg_overflow;\n            }\n#endif\n            if (sizeof(time_t) <= sizeof(unsigned long)) {\n                __PYX_VERIFY_RETURN_INT_EXC(time_t, unsigned long, PyLong_AsUnsignedLong(x))\n#ifdef HAVE_LONG_LONG\n            } else if (sizeof(time_t) <= sizeof(unsigned PY_LONG_LONG)) {\n                __PYX_VERIFY_RETURN_INT_EXC(time_t, unsigned PY_LONG_LONG, PyLong_AsUnsignedLongLong(x))\n#endif\n            }\n        } else {\n#if CYTHON_USE_PYLONG_INTERNALS\n            const digit* digits = ((PyLongObject*)x)->ob_digit;\n            switch (Py_SIZE(x)) {\n                case  0: return (time_t) 0;\n                case -1: __PYX_VERIFY_RETURN_INT(time_t, sdigit, (sdigit) (-(sdigit)digits[0]))\n                case  1: __PYX_VERIFY_RETURN_INT(time_t,  digit, +digits[0])\n                case -2:\n                    if (8 * sizeof(time_t) - 1 > 1 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 2 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(time_t, long, -(long) (((((unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(time_t) - 1 > 2 * PyLong_SHIFT) {\n                            return (time_t) (((time_t)-1)*(((((time_t)digits[1]) << PyLong_SHIFT) | (time_t)digits[0])));\n                        }\n                    }\n                    break;\n                case 2:\n                    if (8 * sizeof(time_t) > 1 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 2 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(time_t, unsigned long, (((((unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(time_t) - 1 > 2 * PyLong_SHIFT) {\n                            return (time_t) ((((((time_t)digits[1]) << PyLong_SHIFT) | (time_t)digits[0])));\n                        }\n                    }\n                    break;\n                case -3:\n                    if (8 * sizeof(time_t) - 1 > 2 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 3 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(time_t, long, -(long) (((((((unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(time_t) - 1 > 3 * PyLong_SHIFT) {\n                            return (time_t) (((time_t)-1)*(((((((time_t)digits[2]) << PyLong_SHIFT) | (time_t)digits[1]) << PyLong_SHIFT) | (time_t)digits[0])));\n                        }\n                    }\n                    break;\n                case 3:\n                    if (8 * sizeof(time_t) > 2 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 3 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(time_t, unsigned long, (((((((unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(time_t) - 1 > 3 * PyLong_SHIFT) {\n                            return (time_t) ((((((((time_t)digits[2]) << PyLong_SHIFT) | (time_t)digits[1]) << PyLong_SHIFT) | (time_t)digits[0])));\n                        }\n                    }\n                    break;\n                case -4:\n                    if (8 * sizeof(time_t) - 1 > 3 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 4 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(time_t, long, -(long) (((((((((unsigned long)digits[3]) << PyLong_SHIFT) | (unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(time_t) - 1 > 4 * PyLong_SHIFT) {\n                            return (time_t) (((time_t)-1)*(((((((((time_t)digits[3]) << PyLong_SHIFT) | (time_t)digits[2]) << PyLong_SHIFT) | (time_t)digits[1]) << PyLong_SHIFT) | (time_t)digits[0])));\n                        }\n                    }\n                    break;\n                case 4:\n                    if (8 * sizeof(time_t) > 3 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 4 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(time_t, unsigned long, (((((((((unsigned long)digits[3]) << PyLong_SHIFT) | (unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(time_t) - 1 > 4 * PyLong_SHIFT) {\n                            return (time_t) ((((((((((time_t)digits[3]) << PyLong_SHIFT) | (time_t)digits[2]) << PyLong_SHIFT) | (time_t)digits[1]) << PyLong_SHIFT) | (time_t)digits[0])));\n                        }\n                    }\n                    break;\n            }\n#endif\n            if (sizeof(time_t) <= sizeof(long)) {\n                __PYX_VERIFY_RETURN_INT_EXC(time_t, long, PyLong_AsLong(x))\n#ifdef HAVE_LONG_LONG\n            } else if (sizeof(time_t) <= sizeof(PY_LONG_LONG)) {\n                __PYX_VERIFY_RETURN_INT_EXC(time_t, PY_LONG_LONG, PyLong_AsLongLong(x))\n#endif\n            }\n        }\n        {\n#if CYTHON_COMPILING_IN_PYPY && !defined(_PyLong_AsByteArray)\n            PyErr_SetString(PyExc_RuntimeError,\n                            \"_PyLong_AsByteArray() not available in PyPy, cannot convert large numbers\");\n#else\n            time_t val;\n            PyObject *v = __Pyx_PyNumber_IntOrLong(x);\n #if PY_MAJOR_VERSION < 3\n            if (likely(v) && !PyLong_Check(v)) {\n                PyObject *tmp = v;\n                v = PyNumber_Long(tmp);\n                Py_DECREF(tmp);\n            }\n #endif\n            if (likely(v)) {\n                int one = 1; int is_little = (int)*(unsigned char *)&one;\n                unsigned char *bytes = (unsigned char *)&val;\n                int ret = _PyLong_AsByteArray((PyLongObject *)v,\n                                              bytes, sizeof(val),\n                                              is_little, !is_unsigned);\n                Py_DECREF(v);\n                if (likely(!ret))\n                    return val;\n            }\n#endif\n            return (time_t) -1;\n        }\n    } else {\n        time_t val;\n        PyObject *tmp = __Pyx_PyNumber_IntOrLong(x);\n        if (!tmp) return (time_t) -1;\n        val = __Pyx_PyInt_As_time_t(tmp);\n        Py_DECREF(tmp);\n        return val;\n    }\nraise_overflow:\n    PyErr_SetString(PyExc_OverflowError,\n        \"value too large to convert to time_t\");\n    return (time_t) -1;\nraise_neg_overflow:\n    PyErr_SetString(PyExc_OverflowError,\n        \"can't convert negative value to time_t\");\n    return (time_t) -1;\n}\n\n/* CIntToPy */\n              static CYTHON_INLINE PyObject* __Pyx_PyInt_From_long(long value) {\n    const long neg_one = (long) -1, const_zero = (long) 0;\n    const int is_unsigned = neg_one > const_zero;\n    if (is_unsigned) {\n        if (sizeof(long) < sizeof(long)) {\n            return PyInt_FromLong((long) value);\n        } else if (sizeof(long) <= sizeof(unsigned long)) {\n            return PyLong_FromUnsignedLong((unsigned long) value);\n#ifdef HAVE_LONG_LONG\n        } else if (sizeof(long) <= sizeof(unsigned PY_LONG_LONG)) {\n            return PyLong_FromUnsignedLongLong((unsigned PY_LONG_LONG) value);\n#endif\n        }\n    } else {\n        if (sizeof(long) <= sizeof(long)) {\n            return PyInt_FromLong((long) value);\n#ifdef HAVE_LONG_LONG\n        } else if (sizeof(long) <= sizeof(PY_LONG_LONG)) {\n            return PyLong_FromLongLong((PY_LONG_LONG) value);\n#endif\n        }\n    }\n    {\n        int one = 1; int little = (int)*(unsigned char *)&one;\n        unsigned char *bytes = (unsigned char *)&value;\n        return _PyLong_FromByteArray(bytes, sizeof(long),\n                                     little, !is_unsigned);\n    }\n}\n\n/* CIntFromPy */\n              static CYTHON_INLINE long __Pyx_PyInt_As_long(PyObject *x) {\n    const long neg_one = (long) -1, const_zero = (long) 0;\n    const int is_unsigned = neg_one > const_zero;\n#if PY_MAJOR_VERSION < 3\n    if (likely(PyInt_Check(x))) {\n        if (sizeof(long) < sizeof(long)) {\n            __PYX_VERIFY_RETURN_INT(long, long, PyInt_AS_LONG(x))\n        } else {\n            long val = PyInt_AS_LONG(x);\n            if (is_unsigned && unlikely(val < 0)) {\n                goto raise_neg_overflow;\n            }\n            return (long) val;\n        }\n    } else\n#endif\n    if (likely(PyLong_Check(x))) {\n        if (is_unsigned) {\n#if CYTHON_USE_PYLONG_INTERNALS\n            const digit* digits = ((PyLongObject*)x)->ob_digit;\n            switch (Py_SIZE(x)) {\n                case  0: return (long) 0;\n                case  1: __PYX_VERIFY_RETURN_INT(long, digit, digits[0])\n                case 2:\n                    if (8 * sizeof(long) > 1 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 2 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(long, unsigned long, (((((unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(long) >= 2 * PyLong_SHIFT) {\n                            return (long) (((((long)digits[1]) << PyLong_SHIFT) | (long)digits[0]));\n                        }\n                    }\n                    break;\n                case 3:\n                    if (8 * sizeof(long) > 2 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 3 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(long, unsigned long, (((((((unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(long) >= 3 * PyLong_SHIFT) {\n                            return (long) (((((((long)digits[2]) << PyLong_SHIFT) | (long)digits[1]) << PyLong_SHIFT) | (long)digits[0]));\n                        }\n                    }\n                    break;\n                case 4:\n                    if (8 * sizeof(long) > 3 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 4 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(long, unsigned long, (((((((((unsigned long)digits[3]) << PyLong_SHIFT) | (unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(long) >= 4 * PyLong_SHIFT) {\n                            return (long) (((((((((long)digits[3]) << PyLong_SHIFT) | (long)digits[2]) << PyLong_SHIFT) | (long)digits[1]) << PyLong_SHIFT) | (long)digits[0]));\n                        }\n                    }\n                    break;\n            }\n#endif\n#if CYTHON_COMPILING_IN_CPYTHON\n            if (unlikely(Py_SIZE(x) < 0)) {\n                goto raise_neg_overflow;\n            }\n#else\n            {\n                int result = PyObject_RichCompareBool(x, Py_False, Py_LT);\n                if (unlikely(result < 0))\n                    return (long) -1;\n                if (unlikely(result == 1))\n                    goto raise_neg_overflow;\n            }\n#endif\n            if (sizeof(long) <= sizeof(unsigned long)) {\n                __PYX_VERIFY_RETURN_INT_EXC(long, unsigned long, PyLong_AsUnsignedLong(x))\n#ifdef HAVE_LONG_LONG\n            } else if (sizeof(long) <= sizeof(unsigned PY_LONG_LONG)) {\n                __PYX_VERIFY_RETURN_INT_EXC(long, unsigned PY_LONG_LONG, PyLong_AsUnsignedLongLong(x))\n#endif\n            }\n        } else {\n#if CYTHON_USE_PYLONG_INTERNALS\n            const digit* digits = ((PyLongObject*)x)->ob_digit;\n            switch (Py_SIZE(x)) {\n                case  0: return (long) 0;\n                case -1: __PYX_VERIFY_RETURN_INT(long, sdigit, (sdigit) (-(sdigit)digits[0]))\n                case  1: __PYX_VERIFY_RETURN_INT(long,  digit, +digits[0])\n                case -2:\n                    if (8 * sizeof(long) - 1 > 1 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 2 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(long, long, -(long) (((((unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(long) - 1 > 2 * PyLong_SHIFT) {\n                            return (long) (((long)-1)*(((((long)digits[1]) << PyLong_SHIFT) | (long)digits[0])));\n                        }\n                    }\n                    break;\n                case 2:\n                    if (8 * sizeof(long) > 1 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 2 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(long, unsigned long, (((((unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(long) - 1 > 2 * PyLong_SHIFT) {\n                            return (long) ((((((long)digits[1]) << PyLong_SHIFT) | (long)digits[0])));\n                        }\n                    }\n                    break;\n                case -3:\n                    if (8 * sizeof(long) - 1 > 2 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 3 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(long, long, -(long) (((((((unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(long) - 1 > 3 * PyLong_SHIFT) {\n                            return (long) (((long)-1)*(((((((long)digits[2]) << PyLong_SHIFT) | (long)digits[1]) << PyLong_SHIFT) | (long)digits[0])));\n                        }\n                    }\n                    break;\n                case 3:\n                    if (8 * sizeof(long) > 2 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 3 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(long, unsigned long, (((((((unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(long) - 1 > 3 * PyLong_SHIFT) {\n                            return (long) ((((((((long)digits[2]) << PyLong_SHIFT) | (long)digits[1]) << PyLong_SHIFT) | (long)digits[0])));\n                        }\n                    }\n                    break;\n                case -4:\n                    if (8 * sizeof(long) - 1 > 3 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 4 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(long, long, -(long) (((((((((unsigned long)digits[3]) << PyLong_SHIFT) | (unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(long) - 1 > 4 * PyLong_SHIFT) {\n                            return (long) (((long)-1)*(((((((((long)digits[3]) << PyLong_SHIFT) | (long)digits[2]) << PyLong_SHIFT) | (long)digits[1]) << PyLong_SHIFT) | (long)digits[0])));\n                        }\n                    }\n                    break;\n                case 4:\n                    if (8 * sizeof(long) > 3 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 4 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(long, unsigned long, (((((((((unsigned long)digits[3]) << PyLong_SHIFT) | (unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(long) - 1 > 4 * PyLong_SHIFT) {\n                            return (long) ((((((((((long)digits[3]) << PyLong_SHIFT) | (long)digits[2]) << PyLong_SHIFT) | (long)digits[1]) << PyLong_SHIFT) | (long)digits[0])));\n                        }\n                    }\n                    break;\n            }\n#endif\n            if (sizeof(long) <= sizeof(long)) {\n                __PYX_VERIFY_RETURN_INT_EXC(long, long, PyLong_AsLong(x))\n#ifdef HAVE_LONG_LONG\n            } else if (sizeof(long) <= sizeof(PY_LONG_LONG)) {\n                __PYX_VERIFY_RETURN_INT_EXC(long, PY_LONG_LONG, PyLong_AsLongLong(x))\n#endif\n            }\n        }\n        {\n#if CYTHON_COMPILING_IN_PYPY && !defined(_PyLong_AsByteArray)\n            PyErr_SetString(PyExc_RuntimeError,\n                            \"_PyLong_AsByteArray() not available in PyPy, cannot convert large numbers\");\n#else\n            long val;\n            PyObject *v = __Pyx_PyNumber_IntOrLong(x);\n #if PY_MAJOR_VERSION < 3\n            if (likely(v) && !PyLong_Check(v)) {\n                PyObject *tmp = v;\n                v = PyNumber_Long(tmp);\n                Py_DECREF(tmp);\n            }\n #endif\n            if (likely(v)) {\n                int one = 1; int is_little = (int)*(unsigned char *)&one;\n                unsigned char *bytes = (unsigned char *)&val;\n                int ret = _PyLong_AsByteArray((PyLongObject *)v,\n                                              bytes, sizeof(val),\n                                              is_little, !is_unsigned);\n                Py_DECREF(v);\n                if (likely(!ret))\n                    return val;\n            }\n#endif\n            return (long) -1;\n        }\n    } else {\n        long val;\n        PyObject *tmp = __Pyx_PyNumber_IntOrLong(x);\n        if (!tmp) return (long) -1;\n        val = __Pyx_PyInt_As_long(tmp);\n        Py_DECREF(tmp);\n        return val;\n    }\nraise_overflow:\n    PyErr_SetString(PyExc_OverflowError,\n        \"value too large to convert to long\");\n    return (long) -1;\nraise_neg_overflow:\n    PyErr_SetString(PyExc_OverflowError,\n        \"can't convert negative value to long\");\n    return (long) -1;\n}\n\n/* CIntFromPy */\n              static CYTHON_INLINE int __Pyx_PyInt_As_int(PyObject *x) {\n    const int neg_one = (int) -1, const_zero = (int) 0;\n    const int is_unsigned = neg_one > const_zero;\n#if PY_MAJOR_VERSION < 3\n    if (likely(PyInt_Check(x))) {\n        if (sizeof(int) < sizeof(long)) {\n            __PYX_VERIFY_RETURN_INT(int, long, PyInt_AS_LONG(x))\n        } else {\n            long val = PyInt_AS_LONG(x);\n            if (is_unsigned && unlikely(val < 0)) {\n                goto raise_neg_overflow;\n            }\n            return (int) val;\n        }\n    } else\n#endif\n    if (likely(PyLong_Check(x))) {\n        if (is_unsigned) {\n#if CYTHON_USE_PYLONG_INTERNALS\n            const digit* digits = ((PyLongObject*)x)->ob_digit;\n            switch (Py_SIZE(x)) {\n                case  0: return (int) 0;\n                case  1: __PYX_VERIFY_RETURN_INT(int, digit, digits[0])\n                case 2:\n                    if (8 * sizeof(int) > 1 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 2 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(int, unsigned long, (((((unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(int) >= 2 * PyLong_SHIFT) {\n                            return (int) (((((int)digits[1]) << PyLong_SHIFT) | (int)digits[0]));\n                        }\n                    }\n                    break;\n                case 3:\n                    if (8 * sizeof(int) > 2 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 3 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(int, unsigned long, (((((((unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(int) >= 3 * PyLong_SHIFT) {\n                            return (int) (((((((int)digits[2]) << PyLong_SHIFT) | (int)digits[1]) << PyLong_SHIFT) | (int)digits[0]));\n                        }\n                    }\n                    break;\n                case 4:\n                    if (8 * sizeof(int) > 3 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 4 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(int, unsigned long, (((((((((unsigned long)digits[3]) << PyLong_SHIFT) | (unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(int) >= 4 * PyLong_SHIFT) {\n                            return (int) (((((((((int)digits[3]) << PyLong_SHIFT) | (int)digits[2]) << PyLong_SHIFT) | (int)digits[1]) << PyLong_SHIFT) | (int)digits[0]));\n                        }\n                    }\n                    break;\n            }\n#endif\n#if CYTHON_COMPILING_IN_CPYTHON\n            if (unlikely(Py_SIZE(x) < 0)) {\n                goto raise_neg_overflow;\n            }\n#else\n            {\n                int result = PyObject_RichCompareBool(x, Py_False, Py_LT);\n                if (unlikely(result < 0))\n                    return (int) -1;\n                if (unlikely(result == 1))\n                    goto raise_neg_overflow;\n            }\n#endif\n            if (sizeof(int) <= sizeof(unsigned long)) {\n                __PYX_VERIFY_RETURN_INT_EXC(int, unsigned long, PyLong_AsUnsignedLong(x))\n#ifdef HAVE_LONG_LONG\n            } else if (sizeof(int) <= sizeof(unsigned PY_LONG_LONG)) {\n                __PYX_VERIFY_RETURN_INT_EXC(int, unsigned PY_LONG_LONG, PyLong_AsUnsignedLongLong(x))\n#endif\n            }\n        } else {\n#if CYTHON_USE_PYLONG_INTERNALS\n            const digit* digits = ((PyLongObject*)x)->ob_digit;\n            switch (Py_SIZE(x)) {\n                case  0: return (int) 0;\n                case -1: __PYX_VERIFY_RETURN_INT(int, sdigit, (sdigit) (-(sdigit)digits[0]))\n                case  1: __PYX_VERIFY_RETURN_INT(int,  digit, +digits[0])\n                case -2:\n                    if (8 * sizeof(int) - 1 > 1 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 2 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(int, long, -(long) (((((unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(int) - 1 > 2 * PyLong_SHIFT) {\n                            return (int) (((int)-1)*(((((int)digits[1]) << PyLong_SHIFT) | (int)digits[0])));\n                        }\n                    }\n                    break;\n                case 2:\n                    if (8 * sizeof(int) > 1 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 2 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(int, unsigned long, (((((unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(int) - 1 > 2 * PyLong_SHIFT) {\n                            return (int) ((((((int)digits[1]) << PyLong_SHIFT) | (int)digits[0])));\n                        }\n                    }\n                    break;\n                case -3:\n                    if (8 * sizeof(int) - 1 > 2 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 3 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(int, long, -(long) (((((((unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(int) - 1 > 3 * PyLong_SHIFT) {\n                            return (int) (((int)-1)*(((((((int)digits[2]) << PyLong_SHIFT) | (int)digits[1]) << PyLong_SHIFT) | (int)digits[0])));\n                        }\n                    }\n                    break;\n                case 3:\n                    if (8 * sizeof(int) > 2 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 3 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(int, unsigned long, (((((((unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(int) - 1 > 3 * PyLong_SHIFT) {\n                            return (int) ((((((((int)digits[2]) << PyLong_SHIFT) | (int)digits[1]) << PyLong_SHIFT) | (int)digits[0])));\n                        }\n                    }\n                    break;\n                case -4:\n                    if (8 * sizeof(int) - 1 > 3 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 4 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(int, long, -(long) (((((((((unsigned long)digits[3]) << PyLong_SHIFT) | (unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(int) - 1 > 4 * PyLong_SHIFT) {\n                            return (int) (((int)-1)*(((((((((int)digits[3]) << PyLong_SHIFT) | (int)digits[2]) << PyLong_SHIFT) | (int)digits[1]) << PyLong_SHIFT) | (int)digits[0])));\n                        }\n                    }\n                    break;\n                case 4:\n                    if (8 * sizeof(int) > 3 * PyLong_SHIFT) {\n                        if (8 * sizeof(unsigned long) > 4 * PyLong_SHIFT) {\n                            __PYX_VERIFY_RETURN_INT(int, unsigned long, (((((((((unsigned long)digits[3]) << PyLong_SHIFT) | (unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))\n                        } else if (8 * sizeof(int) - 1 > 4 * PyLong_SHIFT) {\n                            return (int) ((((((((((int)digits[3]) << PyLong_SHIFT) | (int)digits[2]) << PyLong_SHIFT) | (int)digits[1]) << PyLong_SHIFT) | (int)digits[0])));\n                        }\n                    }\n                    break;\n            }\n#endif\n            if (sizeof(int) <= sizeof(long)) {\n                __PYX_VERIFY_RETURN_INT_EXC(int, long, PyLong_AsLong(x))\n#ifdef HAVE_LONG_LONG\n            } else if (sizeof(int) <= sizeof(PY_LONG_LONG)) {\n                __PYX_VERIFY_RETURN_INT_EXC(int, PY_LONG_LONG, PyLong_AsLongLong(x))\n#endif\n            }\n        }\n        {\n#if CYTHON_COMPILING_IN_PYPY && !defined(_PyLong_AsByteArray)\n            PyErr_SetString(PyExc_RuntimeError,\n                            \"_PyLong_AsByteArray() not available in PyPy, cannot convert large numbers\");\n#else\n            int val;\n            PyObject *v = __Pyx_PyNumber_IntOrLong(x);\n #if PY_MAJOR_VERSION < 3\n            if (likely(v) && !PyLong_Check(v)) {\n                PyObject *tmp = v;\n                v = PyNumber_Long(tmp);\n                Py_DECREF(tmp);\n            }\n #endif\n            if (likely(v)) {\n                int one = 1; int is_little = (int)*(unsigned char *)&one;\n                unsigned char *bytes = (unsigned char *)&val;\n                int ret = _PyLong_AsByteArray((PyLongObject *)v,\n                                              bytes, sizeof(val),\n                                              is_little, !is_unsigned);\n                Py_DECREF(v);\n                if (likely(!ret))\n                    return val;\n            }\n#endif\n            return (int) -1;\n        }\n    } else {\n        int val;\n        PyObject *tmp = __Pyx_PyNumber_IntOrLong(x);\n        if (!tmp) return (int) -1;\n        val = __Pyx_PyInt_As_int(tmp);\n        Py_DECREF(tmp);\n        return val;\n    }\nraise_overflow:\n    PyErr_SetString(PyExc_OverflowError,\n        \"value too large to convert to int\");\n    return (int) -1;\nraise_neg_overflow:\n    PyErr_SetString(PyExc_OverflowError,\n        \"can't convert negative value to int\");\n    return (int) -1;\n}\n\n/* CheckBinaryVersion */\n              static int __Pyx_check_binary_version(void) {\n    char ctversion[4], rtversion[4];\n    PyOS_snprintf(ctversion, 4, \"%d.%d\", PY_MAJOR_VERSION, PY_MINOR_VERSION);\n    PyOS_snprintf(rtversion, 4, \"%s\", Py_GetVersion());\n    if (ctversion[0] != rtversion[0] || ctversion[2] != rtversion[2]) {\n        char message[200];\n        PyOS_snprintf(message, sizeof(message),\n                      \"compiletime version %s of module '%.100s' \"\n                      \"does not match runtime version %s\",\n                      ctversion, __Pyx_MODULE_NAME, rtversion);\n        return PyErr_WarnEx(NULL, message, 1);\n    }\n    return 0;\n}\n\n/* FunctionExport */\n              static int __Pyx_ExportFunction(const char *name, void (*f)(void), const char *sig) {\n    PyObject *d = 0;\n    PyObject *cobj = 0;\n    union {\n        void (*fp)(void);\n        void *p;\n    } tmp;\n    d = PyObject_GetAttrString(__pyx_m, (char *)\"__pyx_capi__\");\n    if (!d) {\n        PyErr_Clear();\n        d = PyDict_New();\n        if (!d)\n            goto bad;\n        Py_INCREF(d);\n        if (PyModule_AddObject(__pyx_m, (char *)\"__pyx_capi__\", d) < 0)\n            goto bad;\n    }\n    tmp.fp = f;\n#if PY_VERSION_HEX >= 0x02070000\n    cobj = PyCapsule_New(tmp.p, sig, 0);\n#else\n    cobj = PyCObject_FromVoidPtrAndDesc(tmp.p, (void *)sig, 0);\n#endif\n    if (!cobj)\n        goto bad;\n    if (PyDict_SetItemString(d, name, cobj) < 0)\n        goto bad;\n    Py_DECREF(cobj);\n    Py_DECREF(d);\n    return 0;\nbad:\n    Py_XDECREF(cobj);\n    Py_XDECREF(d);\n    return -1;\n}\n\n/* InitStrings */\n              static int __Pyx_InitStrings(__Pyx_StringTabEntry *t) {\n    while (t->p) {\n        #if PY_MAJOR_VERSION < 3\n        if (t->is_unicode) {\n            *t->p = PyUnicode_DecodeUTF8(t->s, t->n - 1, NULL);\n        } else if (t->intern) {\n            *t->p = PyString_InternFromString(t->s);\n        } else {\n            *t->p = PyString_FromStringAndSize(t->s, t->n - 1);\n        }\n        #else\n        if (t->is_unicode | t->is_str) {\n            if (t->intern) {\n                *t->p = PyUnicode_InternFromString(t->s);\n            } else if (t->encoding) {\n                *t->p = PyUnicode_Decode(t->s, t->n - 1, t->encoding, NULL);\n            } else {\n                *t->p = PyUnicode_FromStringAndSize(t->s, t->n - 1);\n            }\n        } else {\n            *t->p = PyBytes_FromStringAndSize(t->s, t->n - 1);\n        }\n        #endif\n        if (!*t->p)\n            return -1;\n        if (PyObject_Hash(*t->p) == -1)\n            return -1;\n        ++t;\n    }\n    return 0;\n}\n\nstatic CYTHON_INLINE PyObject* __Pyx_PyUnicode_FromString(const char* c_str) {\n    return __Pyx_PyUnicode_FromStringAndSize(c_str, (Py_ssize_t)strlen(c_str));\n}\nstatic CYTHON_INLINE const char* __Pyx_PyObject_AsString(PyObject* o) {\n    Py_ssize_t ignore;\n    return __Pyx_PyObject_AsStringAndSize(o, &ignore);\n}\n#if __PYX_DEFAULT_STRING_ENCODING_IS_ASCII || __PYX_DEFAULT_STRING_ENCODING_IS_DEFAULT\n#if !CYTHON_PEP393_ENABLED\nstatic const char* __Pyx_PyUnicode_AsStringAndSize(PyObject* o, Py_ssize_t *length) {\n    char* defenc_c;\n    PyObject* defenc = _PyUnicode_AsDefaultEncodedString(o, NULL);\n    if (!defenc) return NULL;\n    defenc_c = PyBytes_AS_STRING(defenc);\n#if __PYX_DEFAULT_STRING_ENCODING_IS_ASCII\n    {\n        char* end = defenc_c + PyBytes_GET_SIZE(defenc);\n        char* c;\n        for (c = defenc_c; c < end; c++) {\n            if ((unsigned char) (*c) >= 128) {\n                PyUnicode_AsASCIIString(o);\n                return NULL;\n            }\n        }\n    }\n#endif\n    *length = PyBytes_GET_SIZE(defenc);\n    return defenc_c;\n}\n#else\nstatic CYTHON_INLINE const char* __Pyx_PyUnicode_AsStringAndSize(PyObject* o, Py_ssize_t *length) {\n    if (unlikely(__Pyx_PyUnicode_READY(o) == -1)) return NULL;\n#if __PYX_DEFAULT_STRING_ENCODING_IS_ASCII\n    if (likely(PyUnicode_IS_ASCII(o))) {\n        *length = PyUnicode_GET_LENGTH(o);\n        return PyUnicode_AsUTF8(o);\n    } else {\n        PyUnicode_AsASCIIString(o);\n        return NULL;\n    }\n#else\n    return PyUnicode_AsUTF8AndSize(o, length);\n#endif\n}\n#endif\n#endif\nstatic CYTHON_INLINE const char* __Pyx_PyObject_AsStringAndSize(PyObject* o, Py_ssize_t *length) {\n#if __PYX_DEFAULT_STRING_ENCODING_IS_ASCII || __PYX_DEFAULT_STRING_ENCODING_IS_DEFAULT\n    if (\n#if PY_MAJOR_VERSION < 3 && __PYX_DEFAULT_STRING_ENCODING_IS_ASCII\n            __Pyx_sys_getdefaultencoding_not_ascii &&\n#endif\n            PyUnicode_Check(o)) {\n        return __Pyx_PyUnicode_AsStringAndSize(o, length);\n    } else\n#endif\n#if (!CYTHON_COMPILING_IN_PYPY) || (defined(PyByteArray_AS_STRING) && defined(PyByteArray_GET_SIZE))\n    if (PyByteArray_Check(o)) {\n        *length = PyByteArray_GET_SIZE(o);\n        return PyByteArray_AS_STRING(o);\n    } else\n#endif\n    {\n        char* result;\n        int r = PyBytes_AsStringAndSize(o, &result, length);\n        if (unlikely(r < 0)) {\n            return NULL;\n        } else {\n            return result;\n        }\n    }\n}\nstatic CYTHON_INLINE int __Pyx_PyObject_IsTrue(PyObject* x) {\n   int is_true = x == Py_True;\n   if (is_true | (x == Py_False) | (x == Py_None)) return is_true;\n   else return PyObject_IsTrue(x);\n}\nstatic PyObject* __Pyx_PyNumber_IntOrLongWrongResultType(PyObject* result, const char* type_name) {\n#if PY_MAJOR_VERSION >= 3\n    if (PyLong_Check(result)) {\n        if (PyErr_WarnFormat(PyExc_DeprecationWarning, 1,\n                \"__int__ returned non-int (type %.200s).  \"\n                \"The ability to return an instance of a strict subclass of int \"\n                \"is deprecated, and may be removed in a future version of Python.\",\n                Py_TYPE(result)->tp_name)) {\n            Py_DECREF(result);\n            return NULL;\n        }\n        return result;\n    }\n#endif\n    PyErr_Format(PyExc_TypeError,\n                 \"__%.4s__ returned non-%.4s (type %.200s)\",\n                 type_name, type_name, Py_TYPE(result)->tp_name);\n    Py_DECREF(result);\n    return NULL;\n}\nstatic CYTHON_INLINE PyObject* __Pyx_PyNumber_IntOrLong(PyObject* x) {\n#if CYTHON_USE_TYPE_SLOTS\n  PyNumberMethods *m;\n#endif\n  const char *name = NULL;\n  PyObject *res = NULL;\n#if PY_MAJOR_VERSION < 3\n  if (likely(PyInt_Check(x) || PyLong_Check(x)))\n#else\n  if (likely(PyLong_Check(x)))\n#endif\n    return __Pyx_NewRef(x);\n#if CYTHON_USE_TYPE_SLOTS\n  m = Py_TYPE(x)->tp_as_number;\n  #if PY_MAJOR_VERSION < 3\n  if (m && m->nb_int) {\n    name = \"int\";\n    res = m->nb_int(x);\n  }\n  else if (m && m->nb_long) {\n    name = \"long\";\n    res = m->nb_long(x);\n  }\n  #else\n  if (likely(m && m->nb_int)) {\n    name = \"int\";\n    res = m->nb_int(x);\n  }\n  #endif\n#else\n  if (!PyBytes_CheckExact(x) && !PyUnicode_CheckExact(x)) {\n    res = PyNumber_Int(x);\n  }\n#endif\n  if (likely(res)) {\n#if PY_MAJOR_VERSION < 3\n    if (unlikely(!PyInt_Check(res) && !PyLong_Check(res))) {\n#else\n    if (unlikely(!PyLong_CheckExact(res))) {\n#endif\n        return __Pyx_PyNumber_IntOrLongWrongResultType(res, name);\n    }\n  }\n  else if (!PyErr_Occurred()) {\n    PyErr_SetString(PyExc_TypeError,\n                    \"an integer is required\");\n  }\n  return res;\n}\nstatic CYTHON_INLINE Py_ssize_t __Pyx_PyIndex_AsSsize_t(PyObject* b) {\n  Py_ssize_t ival;\n  PyObject *x;\n#if PY_MAJOR_VERSION < 3\n  if (likely(PyInt_CheckExact(b))) {\n    if (sizeof(Py_ssize_t) >= sizeof(long))\n        return PyInt_AS_LONG(b);\n    else\n        return PyInt_AsSsize_t(x);\n  }\n#endif\n  if (likely(PyLong_CheckExact(b))) {\n    #if CYTHON_USE_PYLONG_INTERNALS\n    const digit* digits = ((PyLongObject*)b)->ob_digit;\n    const Py_ssize_t size = Py_SIZE(b);\n    if (likely(__Pyx_sst_abs(size) <= 1)) {\n        ival = likely(size) ? digits[0] : 0;\n        if (size == -1) ival = -ival;\n        return ival;\n    } else {\n      switch (size) {\n         case 2:\n           if (8 * sizeof(Py_ssize_t) > 2 * PyLong_SHIFT) {\n             return (Py_ssize_t) (((((size_t)digits[1]) << PyLong_SHIFT) | (size_t)digits[0]));\n           }\n           break;\n         case -2:\n           if (8 * sizeof(Py_ssize_t) > 2 * PyLong_SHIFT) {\n             return -(Py_ssize_t) (((((size_t)digits[1]) << PyLong_SHIFT) | (size_t)digits[0]));\n           }\n           break;\n         case 3:\n           if (8 * sizeof(Py_ssize_t) > 3 * PyLong_SHIFT) {\n             return (Py_ssize_t) (((((((size_t)digits[2]) << PyLong_SHIFT) | (size_t)digits[1]) << PyLong_SHIFT) | (size_t)digits[0]));\n           }\n           break;\n         case -3:\n           if (8 * sizeof(Py_ssize_t) > 3 * PyLong_SHIFT) {\n             return -(Py_ssize_t) (((((((size_t)digits[2]) << PyLong_SHIFT) | (size_t)digits[1]) << PyLong_SHIFT) | (size_t)digits[0]));\n           }\n           break;\n         case 4:\n           if (8 * sizeof(Py_ssize_t) > 4 * PyLong_SHIFT) {\n             return (Py_ssize_t) (((((((((size_t)digits[3]) << PyLong_SHIFT) | (size_t)digits[2]) << PyLong_SHIFT) | (size_t)digits[1]) << PyLong_SHIFT) | (size_t)digits[0]));\n           }\n           break;\n         case -4:\n           if (8 * sizeof(Py_ssize_t) > 4 * PyLong_SHIFT) {\n             return -(Py_ssize_t) (((((((((size_t)digits[3]) << PyLong_SHIFT) | (size_t)digits[2]) << PyLong_SHIFT) | (size_t)digits[1]) << PyLong_SHIFT) | (size_t)digits[0]));\n           }\n           break;\n      }\n    }\n    #endif\n    return PyLong_AsSsize_t(b);\n  }\n  x = PyNumber_Index(b);\n  if (!x) return -1;\n  ival = PyInt_AsSsize_t(x);\n  Py_DECREF(x);\n  return ival;\n}\nstatic CYTHON_INLINE PyObject * __Pyx_PyBool_FromLong(long b) {\n  return b ? __Pyx_NewRef(Py_True) : __Pyx_NewRef(Py_False);\n}\nstatic CYTHON_INLINE PyObject * __Pyx_PyInt_FromSize_t(size_t ival) {\n    return PyInt_FromSize_t(ival);\n}\n\n\n#endif /* Py_PYTHON_H */\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/extensions/python/pywrapfst.pxd",
    "content": "# See www.openfst.org for extensive documentation on this weighted\n# finite-state transducer library.\n\n\nfrom libc.time cimport time\nfrom libc.time cimport time_t\n\nfrom libcpp cimport bool\nfrom libcpp.memory cimport shared_ptr\nfrom libcpp.memory cimport unique_ptr\nfrom libcpp.utility cimport pair\nfrom libcpp.vector cimport vector\n\nfrom libcpp.string cimport string\nfrom basictypes cimport int32\nfrom basictypes cimport int64\nfrom basictypes cimport uint32\nfrom basictypes cimport uint64\ncimport fst as fst\nfrom ios cimport stringstream\n\n\n# Exportable helper functions.\n\n\ncdef string tostring(data, encoding=?) except *\n\ncdef string weight_tostring(data, encoding=?) except *\n\ncdef fst.ComposeFilter _get_compose_filter(\n    const string &compose_filter) except *\n\ncdef fst.DeterminizeType _get_determinize_type(const string &det_type) except *\n\ncdef fst.QueueType _get_queue_type(const string &queue_type) except *\n\ncdef fst.RandArcSelection _get_rand_arc_selection(\n    const string &replace_label_type) except *\n\ncdef fst.ReplaceLabelType _get_replace_label_type(\n    const string &replace_label_type, bool epsilon_on_replace) except *\n\n\n# Weight.\n\n\ncdef fst.WeightClass _get_WeightClass_or_One(const string &weight_type,\n                                             weight_string) except *\n\ncdef fst.WeightClass _get_WeightClass_or_Zero(const string &weight_type,\n                                              weight_string) except *\n\n\ncdef class Weight(object):\n\n  cdef unique_ptr[fst.WeightClass] _weight\n\n  cdef void _check_weight(self) except *\n\n  cpdef Weight copy(self)\n\n  cpdef string to_string(self)\n\n  cpdef string type(self)\n\n\ncdef Weight _Zero(weight_type)\n\ncdef Weight _One(weight_type)\n\ncdef Weight _NoWeight(weight_type)\n\ncdef Weight _plus(Weight lhs, Weight rhs)\n\ncdef Weight _times(Weight lhs, Weight rhs)\n\ncdef Weight _divide(Weight lhs, Weight rhs)\n\ncdef Weight _power(Weight lhs, size_t n)\n\n\n# SymbolTable.\n\nctypedef fst.SymbolTable * SymbolTable_ptr\n\n\ncdef class _SymbolTable(object):\n\n  cdef fst.SymbolTable *_table\n\n  cpdef int64 available_key(self)\n\n  cpdef bytes checksum(self)\n\n  cpdef SymbolTable copy(self)\n\n  cpdef int64 get_nth_key(self, ssize_t pos) except *\n\n  cpdef bytes labeled_checksum(self)\n\n  cpdef bool member(self, key)\n\n  cpdef string name(self)\n\n  cpdef size_t num_symbols(self)\n\n  cpdef void write(self, filename) except *\n\n  cpdef void write_text(self, filename) except *\n\n\ncdef class _EncodeMapperSymbolTable(_SymbolTable):\n\n  cdef shared_ptr[fst.EncodeMapperClass] _encoder\n\n\ncdef class _FstSymbolTable(_SymbolTable):\n\n  cdef shared_ptr[fst.FstClass] _fst\n\n\ncdef class _MutableSymbolTable(_SymbolTable):\n\n  cpdef int64 add_symbol(self, symbol, int64 key=?)\n\n  cpdef void add_table(self, _SymbolTable syms)\n\n  cpdef void set_name(self, new_name) except *\n\n\ncdef class _MutableFstSymbolTable(_MutableSymbolTable):\n\n  cdef shared_ptr[fst.MutableFstClass] _mfst\n\n\ncdef class SymbolTable(_MutableSymbolTable):\n\n  cdef unique_ptr[fst.SymbolTable] _smart_table\n\n\ncdef _EncodeMapperSymbolTable _init_EncodeMapperSymbolTable(\n    fst.SymbolTable *table, shared_ptr[fst.EncodeMapperClass] encoder)\n\n\ncdef _FstSymbolTable _init_FstSymbolTable(fst.SymbolTable *table,\n                                          shared_ptr[fst.FstClass] ifst)\n\n\ncdef _MutableFstSymbolTable _init_MutableFstSymbolTable(fst.SymbolTable *table,\n    shared_ptr[fst.MutableFstClass] ifst)\n\n\ncdef SymbolTable _init_SymbolTable(fst.SymbolTable *table)\n\n\n\ncdef class SymbolTableIterator(object):\n\n  cdef shared_ptr[fst.SymbolTable] _table\n  cdef unique_ptr[fst.SymbolTableIterator] _siter\n\n  cpdef bool done(self)\n\n  cpdef void next(self)\n\n  cpdef void reset(self)\n\n  cpdef string symbol(self)\n\n  cpdef int64 value(self)\n\n\n# EncodeMapper.\n\n\ncdef class EncodeMapper(object):\n\n  cdef shared_ptr[fst.EncodeMapperClass] _encoder\n\n  cpdef string arc_type(self)\n\n  cpdef uint32 flags(self)\n\n  cpdef _EncodeMapperSymbolTable input_symbols(self)\n\n  cpdef _EncodeMapperSymbolTable output_symbols(self)\n\n  cpdef uint64 properties(self, uint64 mask)\n\n  cpdef void set_input_symbols(self, _SymbolTable syms) except *\n\n  cpdef void set_output_symbols(self, _SymbolTable syms) except *\n\n  cpdef string weight_type(self)\n\n\n# Fst.\n\n\nctypedef fst.FstClass * FstClass_ptr\nctypedef fst.MutableFstClass * MutableFstClass_ptr\nctypedef fst.VectorFstClass * VectorFstClass_ptr\n\n\ncdef class _Fst(object):\n\n  cdef shared_ptr[fst.FstClass] _fst\n\n  cpdef string arc_type(self)\n\n  cpdef ArcIterator arcs(self, int64 state)\n\n  cpdef _Fst copy(self)\n\n  cpdef void draw(self, filename, _SymbolTable isymbols=?,\n                  _SymbolTable osymbols=?, SymbolTable ssymbols=?,\n                  bool acceptor=?, title=?, double width=?,\n                  double height=?, bool portrait=?, bool vertical=?,\n                  double ranksep=?, double nodesep=?, int32 fontsize=?,\n                  int32 precision=?, float_format=?,\n                  bool show_weight_one=?)\n\n  cpdef Weight final(self, int64 state)\n\n  cpdef string fst_type(self)\n\n  cpdef _FstSymbolTable input_symbols(self)\n\n  cpdef size_t num_arcs(self, int64 state) except *\n\n  cpdef size_t num_input_epsilons(self, int64 state) except *\n\n  cpdef size_t num_output_epsilons(self, int64 state) except *\n\n  cpdef _FstSymbolTable output_symbols(self)\n\n  cpdef uint64 properties(self, uint64 mask, bool test)\n\n  cpdef int64 start(self)\n\n  cpdef StateIterator states(self)\n\n  cpdef string text(self, _SymbolTable isymbols=?, _SymbolTable osymbols=?,\n                    _SymbolTable ssymbols=?, bool acceptor=?,\n                    bool show_weight_one=?, missing_sym=?)\n\n  cpdef bool verify(self)\n\n  cpdef string weight_type(self)\n\n  cpdef void write(self, filename) except *\n\n  cpdef bytes write_to_string(self)\n\n\ncdef class _MutableFst(_Fst):\n\n  cdef shared_ptr[fst.MutableFstClass] _mfst\n\n  cdef void _check_mutating_imethod(self) except *\n\n  cdef void _add_arc(self, int64 state, Arc arc) except *\n\n  cpdef int64 add_state(self) except *\n\n  cdef void _arcsort(self, sort_type=?) except *\n\n  cdef void _closure(self, bool closure_plus=?) except *\n\n  cdef void _concat(self, _Fst ifst) except *\n\n  cdef void _connect(self) except *\n\n  cdef void _decode(self, EncodeMapper) except *\n\n  cdef void _delete_arcs(self, int64 state, size_t n=?) except *\n\n  cdef void _delete_states(self, states=?) except *\n\n  cdef void _encode(self, EncodeMapper) except *\n\n  cdef void _invert(self) except *\n\n  cdef void _minimize(self, float delta=?, bool allow_nondet=?) except *\n\n  cpdef MutableArcIterator mutable_arcs(self, int64 state)\n\n  cpdef int64 num_states(self)\n\n  cdef void _project(self, bool project_output=?) except *\n\n  cdef void _prune(self, float delta=?, int64 nstate=?, weight=?) except *\n\n  cdef void _push(self, float delta=?, bool remove_total_weight=?,\n                  bool to_final=?) except *\n\n  cdef void _relabel_pairs(self, ipairs=?, opairs=?) except *\n\n  cdef void _relabel_tables(self, _SymbolTable old_isymbols=?,\n      _SymbolTable new_isymbols=?, unknown_isymbol=?,\n      bool attach_new_isymbols=?,\n      _SymbolTable old_osymbols=?, _SymbolTable new_osymbols=?,\n      unknown_osymbol=?, bool attach_new_osymbols=?) except *\n\n  cdef void _reserve_arcs(self, int64 state, size_t n) except *\n\n  cdef void _reserve_states(self, int64 n) except *\n\n  cdef void _reweight(self, potentials, bool to_final=?) except *\n\n  cdef void _rmepsilon(self, queue_type=?, bool connect=?, weight=?,\n                       int64 nstate=?, float delta=?) except *\n\n  cdef void _set_final(self, int64 state, weight=?) except *\n\n  cdef void _set_properties(self, uint64 props, uint64 mask)\n\n  cdef void _set_start(self, int64 state) except *\n\n  cdef void _set_input_symbols(self, _SymbolTable syms) except *\n\n  cdef void _set_output_symbols(self, _SymbolTable syms) except *\n\n  cdef void _topsort(self) except *\n\n  cdef void _union(self, _Fst ifst) except *\n\n\n# Fst construction helpers.\n\n\ncdef _Fst _init_Fst(FstClass_ptr tfst)\n\ncdef _MutableFst _init_MutableFst(MutableFstClass_ptr tfst)\n\ncdef _Fst _init_XFst(FstClass_ptr tfst)\n\ncdef _MutableFst _create_Fst(arc_type=?)\n\ncpdef _Fst _read(filename)\n\ncpdef _Fst _read_from_string(state)\n\n\n# Iterators.\n\n\ncdef class Arc(object):\n\n  cdef unique_ptr[fst.ArcClass] _arc\n\n  cpdef Arc copy(self)\n\n\ncdef Arc _init_Arc(const fst.ArcClass &arc)\n\n\ncdef class ArcIterator(object):\n\n  cdef shared_ptr[fst.FstClass] _fst\n  cdef unique_ptr[fst.ArcIteratorClass] _aiter\n\n  cpdef bool done(self)\n\n  cpdef uint32 flags(self)\n\n  cpdef void next(self)\n\n  cpdef size_t position(self)\n\n  cpdef void reset(self)\n\n  cpdef void seek(self, size_t a)\n\n  cpdef void set_flags(self, uint32 flags, uint32 mask)\n\n  cpdef object value(self)\n\n\ncdef class MutableArcIterator(object):\n\n  cdef shared_ptr[fst.MutableFstClass] _mfst\n  cdef unique_ptr[fst.MutableArcIteratorClass] _aiter\n\n  cpdef bool done(self)\n\n  cpdef uint32 flags(self)\n\n  cpdef void next(self)\n\n  cpdef size_t position(self)\n\n  cpdef void reset(self)\n\n  cpdef void seek(self, size_t a)\n\n  cpdef void set_flags(self, uint32 flags, uint32 mask)\n\n  cpdef void set_value(self, Arc arc)\n\n  cpdef object value(self)\n\n\ncdef class StateIterator(object):\n\n  cdef shared_ptr[fst.FstClass] _fst\n  cdef unique_ptr[fst.StateIteratorClass] _siter\n\n  cpdef bool done(self)\n\n  cpdef void next(self)\n\n  cpdef void reset(self)\n\n  cpdef int64 value(self)\n\n\n# Constructive operations on Fst.\n\n\ncdef _Fst _map(_Fst ifst, float delta=?, map_type=?, double power=?, weight=?)\n\ncpdef _Fst arcmap(_Fst ifst, float delta=?, map_type=?, double power=?,\n                  weight=?)\n\ncpdef _MutableFst compose(_Fst ifst1, _Fst ifst2, compose_filter=?,\n                          bool connect=?)\n\ncpdef _Fst convert(_Fst ifst, fst_type=?)\n\ncpdef _MutableFst determinize(_Fst ifst, float delta=?, det_type=?,\n                              int64 nstate=?, int64 subsequential_label=?,\n                              weight=?, bool increment_subsequential_label=?)\n\ncpdef _MutableFst difference(_Fst ifst1, _Fst ifst2, compose_filter=?,\n                             bool connect=?)\n\ncpdef _MutableFst disambiguate(_Fst ifst, float delta=?, int64 nstate=?,\n                               int64 subsequential_label=?, weight=?)\n\ncpdef _MutableFst epsnormalize(_Fst ifst, bool eps_norm_output=?)\n\ncpdef bool equal(_Fst ifst1, _Fst ifst2, float delta=?)\n\ncpdef bool equivalent(_Fst ifst1, _Fst ifst2, float delta=?) except *\n\ncpdef _MutableFst intersect(_Fst ifst1, _Fst ifst2, compose_filter=?,\n                            bool connect=?)\n\ncpdef bool isomorphic(_Fst ifst1, _Fst ifst2, float delta=?)\n\ncpdef _MutableFst prune(_Fst ifst, float delta=?, int64 nstate=?,\n                        weight=?)\n\ncpdef _MutableFst push(_Fst ifst, float delta=?, bool push_weights=?,\n                       bool push_labels=?, bool remove_common_affix=?,\n                       bool remove_total_weight=?, bool to_final=?)\n\ncpdef bool randequivalent(_Fst ifst1, _Fst ifst2, int32 npath=?,\n                          float delta=?, time_t seed=?, select=?,\n                          int32 max_length=?) except *\n\ncpdef _MutableFst randgen(_Fst ifst, int32 npath=?, time_t seed=?,\n                          select=?, int32 max_length=?,\n                          bool remove_total_weight=?, bool weighted=?)\n\ncdef fst.ReplaceLabelType _get_replace_label_type(string rlt,\n    bool epsilon_on_replace) except *\n\ncpdef _MutableFst replace(pairs, call_arc_labeling=?, return_arc_labeling=?,\n                          bool epsilon_on_replace=?, int64 return_label=?)\n\ncpdef _MutableFst reverse(_Fst ifst, bool require_superinitial=?)\n\ncdef vector[fst.WeightClass] *_shortestdistance(_Fst ifst, float delta=?,\n                                                int64 nstate=?, queue_type=?,\n                                                bool reverse=?) except *\n\ncpdef _MutableFst shortestpath(_Fst ifst, float delta=?, int32 nshortest=?,\n                               int64 nstate=?, queue_type=?, bool unique=?,\n                               weight=?)\n\ncpdef _Fst statemap(_Fst ifst, map_type)\n\ncpdef _MutableFst synchronize(_Fst ifst)\n\n\n# Compiler.\n\n\ncdef class Compiler(object):\n\n  cdef unique_ptr[stringstream] _sstrm\n  cdef string _fst_type\n  cdef string _arc_type\n  cdef const fst.SymbolTable *_isymbols\n  cdef const fst.SymbolTable *_osymbols\n  cdef const fst.SymbolTable *_ssymbols\n  cdef bool _acceptor\n  cdef bool _keep_isymbols\n  cdef bool _keep_osymbols\n  cdef bool _keep_state_numbering\n  cdef bool _allow_negative_labels\n\n  cpdef _Fst compile(self)\n\n  cpdef void write(self, expression)\n\n\n# FarReader.\n\ncdef class FarReader(object):\n\n  cdef unique_ptr[fst.FarReaderClass] _reader\n\n  cpdef string arc_type(self)\n\n  cpdef bool done(self)\n\n  cpdef bool error(self)\n\n  cpdef string far_type(self)\n\n  cpdef bool find(self, key) except *\n\n  cpdef _Fst get_fst(self)\n\n  cpdef string get_key(self)\n\n  cpdef void next(self)\n\n  cpdef void reset(self)\n\n\n# FarWriter.\n\ncdef class FarWriter(object):\n\n  cdef unique_ptr[fst.FarWriterClass] _writer\n\n  cpdef string arc_type(self)\n\n  cdef void close(self)\n\n  cpdef void add(self, key, _Fst ifst) except *\n\n  cpdef bool error(self)\n\n  cpdef string far_type(self)\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/extensions/python/pywrapfst.pyx",
    "content": "#cython: nonecheck=True, c_string_type=unicode, c_string_encoding=utf8\n# See www.openfst.org for extensive documentation on this weighted\n# finite-state transducer library.\n\n\n\"\"\"Python interface to the FST scripting API.\n\nOperations which construct new FSTs are implemented as traditional functions, as\nare two-argument boolean functions like `equal` and `equivalent`. Destructive\noperations---those that mutate an FST, in place---are instance methods, as is\n`write`. Operator overloading is not used. The following example, based on\nMohri et al. 2002, shows the construction of an ASR system given a pronunciation\nlexicon L, grammar G, a transducer from context-dependent phones to\ncontext-independent phones C, and an HMM set H:\n\n  L = fst.Fst.read(\"L.fst\")\n  G = fst.Fst.read(\"G.fst\")\n  C = fst.Fst.read(\"C.fst\")\n  H = fst.Fst.read(\"H.fst\")\n  LG = fst.determinize(fst.compose(L, G))\n  CLG = fst.determinize(fst.compose(C, LG))\n  HCLG = fst.determinize(fst.compose(H, CLG))\n  HCLG.minimize()                                      # NB: works in-place.\n\nPython variables here use snake_case and constants are in all caps, minus the\nnormal `k` prefix.\n\"\"\"\n\n# Overview of the file:\n#\n# * Imports\n# * Custom exceptions\n# * General helpers\n# * Weight and helpers\n# * _SymbolTable, _EncodeMapperSymbolTable, _FstSymbolTable,\n#   _MutableFstSymbolTable, SymbolTable, and helpers\n# * SymbolTableIterator\n# * EncodeMapper\n# * _Fst, _MutableFst, Fst, and helpers\n# * FST properties\n# * Arc, ArcIterator, and MutableArcIterator\n# * StateIterator\n# * FST operations\n# * Compiler\n# * FarReader and FarWriter\n# * Cleanup operations for module entrance and exit.\n#\n# TODO(kbg): Try breaking this apart into smaller pieces.\n#\n# A few of the more idiosyncratic choices made here are due to \"impedance\n# mismatches\" between C++ and Python, as follows.\n#\n# Due to differences in C++ and Python scope rules, most C++ class instances\n# have to be heap-allocated. Since all are packed into Python class instances,\n# Python destructors are used to semi-automatically free C++ instances.\n#\n# Cython's type annotations (e.g., `string`) are used when the variables will\n# be sent as arguments to C++ functions, but are not used for variables used\n# within the module.\n\n\n## Imports.\n\n# C imports.\nfrom libc.stdint cimport INT32_MAX\nfrom libc.stdint cimport SIZE_MAX\nfrom posix.unistd cimport getpid\n\n# C++ imports.\nfrom libcpp cimport bool\nfrom libcpp.cast cimport const_cast\nfrom libcpp.cast cimport static_cast\n\n# Our C++ imports.\nfrom ios cimport ofstream\nfrom memory cimport static_pointer_cast\n\n# Cython operator workarounds.\nfrom cython.operator cimport address as addr       # &foo\nfrom cython.operator cimport dereference as deref  # *foo\nfrom cython.operator cimport preincrement as inc   # ++foo\n\n# Python imports.\nimport atexit\nimport numbers\nimport subprocess\nimport logging\n\n\n# TODO(kbg): Figure out how to access static class variables so I don't have\n# to do it this way.\nkNoSymbol = -1\n\n\n## Custom exceptions.\n\n\nclass FstError(Exception):\n\n  pass\n\n\nclass FstArgError(FstError, ValueError):\n\n  pass\n\n\nclass FstBadWeightError(FstError, ValueError):\n\n  pass\n\n\nclass FstDeletedConstructorError(FstError, RuntimeError):\n\n  pass\n\n\nclass FstIndexError(FstError, IndexError):\n\n  pass\n\n\nclass FstIOError(FstError, IOError):\n\n  pass\n\n\nclass FstOpError(FstError, RuntimeError):\n\n  pass\n\n\n## General helpers.\n\n\ncdef string tostring(data, encoding=\"utf8\") except *:\n  \"\"\"Converts strings to bytestrings.\n\n  This function converts Python bytestrings and Unicode strings to bytestrings\n  encoded in UTF-8. It is used to process most Python string arguments before\n  passing them to the lower-level library.\n\n  Args:\n    data: A Unicode string or bytestring.\n    encoding: The desired encoding, defaulting to UTF-8.\n\n  Returns:\n    A bytestring.\n\n  Raises:\n    FstArgError: Cannot encode string.\n    UnicodeEncodeError.\n\n  This function is not visible to Python users.\n  \"\"\"\n  # A Python bytestring can be implicitly cast to a C++ string.\n  if isinstance(data, bytes):\n    return data\n  elif isinstance(data, unicode):\n    return data.encode(encoding)\n  raise FstArgError(\"Cannot encode as string: {!r}\".format(data))\n\n\ncdef string weight_tostring(data, encoding=\"utf8\") except *:\n  \"\"\"Converts strings or numerics to bytestrings.\n\n  This function converts Python bytestrings, Unicode strings, and numerics\n  which can be cast to floats to bytestrings encoded in UTF-8. It is used to\n  process Python string arguments so they can be used to construct Weight\n  objects. In most cases, weights are underlyingly floating-point, but since\n  not all weights are, they can only be constructed using a string.\n\n  Args:\n    data: A Unicode string, bytestring, or type which can be converted to a\n      Python float.\n\n  Returns:\n    A bytestring.\n\n  Raise:\n    FstArgError: Cannot encode string.\n    ValueError: Invalid literal for float.\n    UnicodeEncodeError.\n\n  This function is not visible to Python users.\n  \"\"\"\n  # A Python bytestring can be implicitly cast to a C++ string.\n  if isinstance(data, bytes):\n    return data\n  elif isinstance(data, unicode):\n    return data.encode(encoding)\n  elif isinstance(data, numbers.Number):\n    return str(data).encode(encoding)\n  raise FstArgError(\"Cannot encode as string: {!r}\".format(data))\n\n\ncdef fst.ComposeFilter _get_compose_filter(\n    const string &compose_filter) except *:\n  \"\"\"Matches string with the appropriate ComposeFilter enum value.\n\n  This function takes a string argument and returns the matching ComposeFilter\n  enum value used to initialize ComposeOptions instances. ComposeOptions is used\n  by difference and intersection in addition to composition.\n\n  Args:\n    compose_filter: A string matching a known composition filter; one of:\n        \"alt_sequence\", \"auto\", \"match\", \"null\", \"sequence\", \"trivial\".\n\n  Returns:\n    A ComposeFilter enum value.\n\n  Raises:\n    FstArgError: Unknown compose filter type.\n\n  This function is not visible to Python users.\n  \"\"\"\n  cdef fst.ComposeFilter compose_filter_enum\n  if not fst.GetComposeFilter(compose_filter, addr(compose_filter_enum)):\n    raise FstArgError(\"Unknown compose filter type: {!r}\".format(\n        compose_filter))\n  return compose_filter_enum\n\n\ncdef fst.DeterminizeType _get_determinize_type(const string &det_type) except *:\n  \"\"\"Matches string with the appropriate DeterminizeType enum value.\n\n  Args:\n    det_type: A string matching a known determinization type; one of:\n        \"functional\", \"nonfunctional\", \"disambiguate\".\n\n  Returns:\n    A DeterminizeType enum value.\n\n  Raises:\n    FstArgError: Unknown determinization type.\n\n  This function is not visible to Python users.\n  \"\"\"\n  cdef fst.DeterminizeType det_type_enum\n  if not fst.GetDeterminizeType(det_type, addr(det_type_enum)):\n    raise FstArgError(\"Unknown determinization type: {!r}\".format(det_type))\n  return det_type_enum\n\n\ncdef fst.QueueType _get_queue_type(const string &queue_type) except *:\n  \"\"\"Matches string with the appropriate QueueType enum value.\n\n  This function takes a string argument and returns the matching QueueType enum\n  value passed to the RmEpsilonOptions constructor.\n\n  Args:\n    queue_type: A string matching a known queue type; one of: \"auto\", \"fifo\",\n        \"lifo\", \"shortest\", \"state\", \"top\".\n\n  Returns:\n    A QueueType enum value.\n\n  Raises:\n    FstArgError: Unknown queue type.\n\n  This function is not visible to Python users.\n  \"\"\"\n  cdef fst.QueueType queue_type_enum\n  if not fst.GetQueueType(queue_type, addr(queue_type_enum)):\n    raise FstArgError(\"Unknown queue type: {!r}\".format(queue_type))\n  return queue_type_enum\n\n\ncdef fst.RandArcSelection _get_rand_arc_selection(\n    const string &select) except *:\n  \"\"\"Matches string with the appropriate RandArcSelection enum value.\n\n  This function takes a string argument and returns the matching\n  RandArcSelection enum value passed to the RandGenOptions constructor.\n\n  Args:\n    select: A string matching a known random arc selection type; one of:\n        \"uniform\", \"log_prob\", \"fast_log_prob\".\n\n  Returns:\n    A RandArcSelection enum value.\n\n  Raises:\n    FstArgError: Unknown random arc selection type.\n\n  This function is not visible to Python users.\n  \"\"\"\n  cdef fst.RandArcSelection select_enum\n  if not fst.GetRandArcSelection(select, addr(select_enum)):\n    raise FstArgError(\"Unknown random arc selection type: {!r}\".format(select))\n  return select_enum\n\n\ncdef fst.ReplaceLabelType _get_replace_label_type(\n    const string &replace_label_type, bool epsilon_on_replace) except *:\n  \"\"\"Matches string with the appropriate ReplaceLabelType enum value.\n\n  This function takes a string argument and returns the matching\n  ReplaceLabelType enum value passed to the ReplaceOptions constructor.\n\n  Args:\n    replace_label_type: A string matching a known replace label type; one of:\n        \"neither\", \"input\", \"output\", \"both\".\n    epsilon_on_replace: Should call/return arcs be epsilon arcs?\n\n  Returns:\n    A ReplaceLabelType enum value.\n\n  Raises:\n    FstArgError: Unknown replace label type.\n\n  This function is not visible to Python users.\n  \"\"\"\n  cdef fst.ReplaceLabelType replace_label_type_enum\n  if not fst.GetReplaceLabelType(replace_label_type, epsilon_on_replace,\n                                 addr(replace_label_type_enum)):\n    raise FstArgError(\"Unknown replace label type: {!r}\".format(\n                      replace_label_type))\n  return replace_label_type_enum\n\n\n## Weight and helpers.\n\n\ncdef class Weight(object):\n\n  \"\"\"\n  Weight(weight_type, weight_string)\n\n  FST weight class.\n\n  This class represents an FST weight. When passed as an argument to an FST\n  operation, it should have the weight type of the input FST(s) to said\n  operation.\n\n  Args:\n    weight_type: A string indicating the weight type.\n    weight_string: A string indicating the underlying weight.\n\n  Raises:\n    FstArgError: Weight type not found.\n    FstBadWeightError: Invalid weight.\n  \"\"\"\n\n  def __repr__(self):\n    return \"<{} Weight {} at 0x{:x}>\".format(self.type(), self.to_string(),\n                                             id(self))\n\n  def __str__(self):\n    return self.to_string()\n\n  # This attempts to convert the string form into a float, raising\n  # ValueError when that is not appropriate.\n\n  def __float__(self):\n    return float(self.to_string())\n\n  def __init__(self, weight_type, weight):\n    self._weight.reset(new fst.WeightClass(tostring(weight_type),\n                                           weight_tostring(weight)))\n    self._check_weight()\n\n  cdef void _check_weight(self) except *:\n    if self.type() == b\"none\":\n      raise FstArgError(\"Weight type not found\")\n    if self.to_string() == b\"BadNumber\":\n      raise FstBadWeightError(\"Invalid weight\")\n\n  cpdef Weight copy(self):\n    \"\"\"\n    copy(self)\n\n    Returns a copy of the Weight.\n    \"\"\"\n    cdef Weight result = Weight.__new__(Weight)\n    result._weight.reset(new fst.WeightClass(deref(self._weight)))\n    return result\n\n  # To get around the inability to declare cdef class methods, we define the\n  # C++ part out-of-class and then call it from within.\n\n  @classmethod\n  def Zero(cls, weight_type):\n    \"\"\"\n    Weight.Zero(weight_type)\n\n    Constructs semiring zero.\n    \"\"\"\n    return _Zero(weight_type)\n\n  @classmethod\n  def One(cls, weight_type):\n    \"\"\"\n    Weight.One(weight_type)\n\n    Constructs semiring One.\n    \"\"\"\n    return _One(weight_type)\n\n  @classmethod\n  def NoWeight(cls, weight_type):\n    \"\"\"\n    Weight.NoWeight(weight_type)\n\n    Constructs a non-member weight in the semiring.\n    \"\"\"\n    return _NoWeight(weight_type)\n\n  def __eq__(Weight w1, Weight w2):\n    return fst.Eq(deref(w1._weight), deref(w2._weight))\n\n  def __ne__(Weight w1, Weight w2):\n    return not w1 == w2\n\n  cpdef string to_string(self):\n    return self._weight.get().ToString()\n\n  cpdef string type(self):\n    \"\"\"type(self)\n\n    Returns a string indicating the weight type.\n    \"\"\"\n    return self._weight.get().Type()\n\n\ncdef Weight _plus(Weight lhs, Weight rhs):\n  cdef Weight result = Weight.__new__(Weight)\n  result._weight.reset(new fst.WeightClass(fst.Plus(deref(lhs._weight),\n                                                    deref(rhs._weight))))\n  return result\n\n\ndef plus(Weight lhs, Weight rhs):\n  \"\"\"\n  plus(lhs, rhs)\n\n  Computes the sum of two Weights in the same semiring.\n\n  This function computes lhs \\oplus rhs, raising an exception if lhs and rhs\n  are not in the same semiring.\n\n  Args:\n     lhs: Left-hand side Weight.\n     rhs: Right-hand side Weight.\n\n  Returns:\n    A Weight object.\n\n  Raises:\n    FstArgError: Weight type not found (or not in same semiring).\n    FstBadWeightError: invalid weight.\n  \"\"\"\n  cdef Weight result = _plus(lhs, rhs)\n  result._check_weight()\n  return result\n\n\ncdef Weight _times(Weight lhs, Weight rhs):\n  cdef Weight result = Weight.__new__(Weight)\n  result._weight.reset(new fst.WeightClass(fst.Times(deref(lhs._weight),\n                                                     deref(rhs._weight))))\n  return result\n\n\ndef times(Weight lhs, Weight rhs):\n  \"\"\"\n  times(lhs, rhs)\n\n  Computes the product of two Weights in the same semiring.\n\n  This function computes lhs \\otimes rhs, raising an exception if lhs and rhs\n  are not in the same semiring.\n\n  Args:\n     lhs: Left-hand side Weight.\n     rhs: Right-hand side Weight.\n\n  Returns:\n    A Weight object.\n\n  Raises:\n    FstArgError: Weight type not found (or not in same semiring).\n    FstBadWeightError: Invalid weight.\n  \"\"\"\n  cdef Weight result = _times(lhs, rhs)\n  result._check_weight()\n  return result\n\n\ncdef Weight _divide(Weight lhs, Weight rhs):\n  cdef Weight result = Weight.__new__(Weight)\n  result._weight.reset(new fst.WeightClass(fst.Divide(deref(lhs._weight),\n                                                      deref(rhs._weight))))\n  return result\n\n\ndef divide(Weight lhs, Weight rhs):\n  \"\"\"\n  divide(lhs, rhs)\n\n  Computes the quotient of two Weights in the same semiring.\n\n  This function computes lhs \\oslash rhs, raising an exception if lhs and rhs\n  are not in the same semiring. As there is no way to specify whether to use\n  left vs. right division, this assumes a commutative semiring in which these\n  are equivalent operations.\n\n  Args:\n     lhs: Left-hand side Weight.\n     rhs: Right-hand side Weight.\n\n  Returns:\n    A Weight object.\n\n  Raises:\n    FstArgError: Weight type not found (or not in same semiring).\n    FstBadWeightError: Invalid weight.\n  \"\"\"\n  cdef Weight result = _divide(lhs, rhs)\n  result._check_weight()\n  return result\n\n\ncdef Weight _power(Weight w, size_t n):\n  cdef Weight result = Weight.__new__(Weight)\n  result._weight.reset(new fst.WeightClass(fst.Power(deref(w._weight), n)))\n  return result\n\n\ndef power(Weight w, size_t n):\n  \"\"\"\n  power(lhs, rhs)\n\n  Computes the iterated product of a weight.\n\n  Args:\n     w: The weight.\n     n: The power.\n\n  Returns:\n    A Weight object.\n\n  Raises:\n    FstArgError: Weight type not found (or not in same semiring).\n    FstBadWeightError: Invalid weight.\n  \"\"\"\n  cdef Weight result = _power(w, n)\n  result._check_weight()\n  return result\n\n\ncdef fst.WeightClass _get_WeightClass_or_Zero(const string &weight_type,\n                                              weight) except *:\n  \"\"\"Converts weight string to a WeightClass.\n\n  This function constructs a WeightClass instance of the desired weight type.\n  If the first argument is null, the weight is set to semiring Zero.\n\n  Args:\n    weight_type: A string denoting the desired weight type.\n    weight: A object indicating the desired weight; if omitted, the weight is\n        set to semiring Zero.\n\n  Returns:\n    A WeightClass object.\n\n  This function is not visible to Python users.\n  \"\"\"\n  cdef fst.WeightClass result\n  if weight is None:\n    result = fst.WeightClass.Zero(weight_type)\n  elif isinstance(weight, Weight):\n    result = deref(<fst.WeightClass *> (<Weight> weight)._weight.get())\n  else:\n    result = fst.WeightClass(weight_type, weight_tostring(weight))\n    if result.ToString() == b\"BadNumber\":\n      raise FstBadWeightError(weight_tostring(weight))\n  return result\n\n\ncdef fst.WeightClass _get_WeightClass_or_One(const string &weight_type,\n                                             weight) except *:\n  \"\"\"Converts weight string to a WeightClass.\n\n  This function constructs a WeightClass instance of the desired weight type.\n  If the first argument is null, the weight is set to semiring One.\n\n  Args:\n    weight_type: A string denoting the desired weight type.\n    weight: A object indicating the desired weight; if omitted, the weight is\n        set to semiring One.\n\n  Returns:\n    A WeightClass object.\n\n  This function is not visible to Python users.\n  \"\"\"\n  cdef fst.WeightClass result\n  if weight is None:\n    result = fst.WeightClass.One(weight_type)\n  elif isinstance(weight, Weight):\n    result = deref(<fst.WeightClass *> (<Weight> weight)._weight.get())\n  else:\n    result = fst.WeightClass(weight_type, weight_tostring(weight))\n    if result.ToString() == b\"BadNumber\":\n      raise FstBadWeightError(weight_tostring(weight))\n  return result\n\n\ncdef Weight _Zero(weight_type):\n  cdef Weight result = Weight.__new__(Weight)\n  result._weight.reset(new fst.WeightClass(fst.WeightClass.Zero(\n      tostring(weight_type))))\n  if result._weight.get().Type() == b\"none\":\n    raise FstArgError(\"Weight type not found\")\n  return result\n\n\ncdef Weight _One(weight_type):\n  cdef Weight result = Weight.__new__(Weight)\n  result._weight.reset(new fst.WeightClass(\n        fst.WeightClass.One(tostring(weight_type))))\n  if result._weight.get().Type() == b\"none\":\n    raise FstArgError(\"Weight type not found\")\n  return result\n\n\ncdef Weight _NoWeight(weight_type):\n  cdef Weight result = Weight.__new__(Weight)\n  result._weight.reset(new fst.WeightClass(\n        fst.WeightClass.NoWeight(tostring(weight_type))))\n  return result\n\n\n## _SymbolTable, _MutableSymbolTable, _EncodeMapperSymbolTable, _FstSymbolTable,\n##  _MutableFstSymbolTable, SymbolTable, and helpers.\n#\n# SymbolTable hierarchy:\n#\n# _SymbolTable: abstract base class; has-a SymbolTable*\n# _EncodeMapperSymbolTable(_SymbolTable): constant symbol table returned by\n#     EncodeMapper.input_symbols/output_symbols\n# _FstSymbolTable(_SymbolTable): constant symbol table returned by\n#     _Fst.input_symbols/output_symbols\n#\n# _MutableSymbolTable(_SymbolTable): abstract base class adding mutation methods\n# _MutableFstSymbolTable(_MutableSymbolTable): mutable symbol table returned by\n#     _MutableFst.mutable_input_symbols/mutable_output_symbols\n# SymbolTable(_MutableSymbolTable): adds constructor\n\n\ncdef class _SymbolTable(object):\n\n  \"\"\"\n  (No constructor.)\n\n  Base class for the symbol table hierarchy.\n\n  This class is the base class for SymbolTable. It has a \"deleted\" constructor\n  and implementations for the const methods of the wrapped SymbolTable.\n  \"\"\"\n\n  # NB: Do not expose any non-const methods of the wrapped SymbolTable here.\n  # Doing so will allow undefined behavior.\n\n  def __init__(self):\n    raise FstDeletedConstructorError(\n        \"Cannot construct {}\".format(self.__class__.__name__))\n\n  def __iter__(self):\n    return SymbolTableIterator(self)\n\n  cpdef int64 available_key(self):\n    \"\"\"\n    available_key(self)\n\n    Returns an integer indicating the next available key index in the table.\n    \"\"\"\n    return self._table.AvailableKey()\n\n  cpdef bytes checksum(self):\n    \"\"\"\n    checksum(self)\n\n    Returns a bytestring indicating the label-independent MD5 checksum.\n    \"\"\"\n    return self._table.CheckSum()\n\n  cpdef SymbolTable copy(self):\n    \"\"\"\n    copy(self)\n\n    Returns a mutable copy of the SymbolTable.\n    \"\"\"\n    return _init_SymbolTable(self._table.Copy())\n\n  def find(self, key):\n    \"\"\"\n    find(self, key)\n\n    Given a symbol or index, finds the other one.\n\n    This method returns the index associated with a symbol key, or the symbol\n    associated with a index key.\n\n    Args:\n      key: Either a string or an index.\n\n    Returns:\n      If the key is a string, the associated index or NO_LABEL if not found; if\n          the key is an integer, the associated symbol or an empty string if\n          not found.\n    \"\"\"\n    try:\n      return self._table.FindIndex(tostring(key))\n    except FstArgError:\n      return self._table.FindSymbol(key)\n\n  cpdef int64 get_nth_key(self, ssize_t pos) except *:\n    \"\"\"\n    get_nth_key(self, pos)\n\n    Retrieves the integer index of the n-th key in the table.\n\n    Args:\n      pos: The n-th key to retrieve.\n\n    Returns:\n      The integer index of the n-th key, or NO_LABEL if not found.\n    \"\"\"\n    return self._table.GetNthKey(pos)\n\n  cpdef bytes labeled_checksum(self):\n    \"\"\"\n    labeled_checksum(self)\n\n    Returns a bytestring indicating the label-dependent MD5 checksum.\n    \"\"\"\n    return self._table.LabeledCheckSum()\n\n  cpdef bool member(self, key):\n    \"\"\"\n    member(self, key)\n\n    Given a symbol or index, returns whether it is found in the table.\n\n    This method returns a boolean indicating whether the given symbol or index\n    is present in the table. If one intends to perform subsequent lookup, it is\n    better to simply call the find method, catching the KeyError.\n\n    Args:\n      key: Either a string or an index.\n\n    Returns:\n      Whether or not the key is present (as a string or a index) in the table.\n    \"\"\"\n    try:\n      return self._table.MemberSymbol(tostring(key))\n    except FstArgError:\n      return self._table.MemberIndex(key)\n\n  def __contains__(self, key):\n    return self.member(key)\n\n  cpdef string name(self):\n    \"\"\"\n    name(self)\n\n    Returns the symbol table's name.\n    \"\"\"\n    return self._table.Name()\n\n  cpdef size_t num_symbols(self):\n    \"\"\"\n    num_symbols(self)\n\n    Returns the number of symbols in the symbol table.\n    \"\"\"\n    return self._table.NumSymbols()\n\n  cpdef void write(self, filename) except *:\n    \"\"\"\n    write(self, filename)\n\n    Serializes symbol table to a file.\n\n    This methods writes the SymbolTable to a file in binary format.\n\n    Args:\n      filename: The string location of the output file.\n\n    Raises:\n      FstIOError: Write failed.\n    \"\"\"\n    if not self._table.Write(tostring(filename)):\n      raise FstIOError(\"Write failed: {!r}\".format(filename))\n\n  cpdef void write_text(self, filename) except *:\n    \"\"\"\n    write_text(self, filename)\n\n    Writes symbol table to text file.\n\n    This method writes the SymbolTable to a file in human-readable format.\n\n    Args:\n      filename: The string location of the output file.\n\n    Raises:\n      FstIOError: Write failed.\n    \"\"\"\n    if not self._table.WriteText(tostring(filename)):\n      raise FstIOError(\"Write failed: {!r}\".format(filename))\n\n\ncdef class _EncodeMapperSymbolTable(_SymbolTable):\n\n  \"\"\"\n  (No constructor.)\n\n  Immutable SymbolTable class for tables stored in an EncodeMapper.\n\n  This class wraps a library const SymbolTable and exposes const methods of the\n  wrapped object. It is only to be returned by method, never constructed\n  directly.\n  \"\"\"\n\n  # NB: Do not expose any non-const methods of the wrapped SymbolTable here.\n  # Doing so will allow undefined behavior.\n\n  def __repr__(self):\n    return \"<const EncodeMapper SymbolTable {!r} at 0x{:x}>\".format(self.name(),\n                                                                    id(self))\n\n\ncdef class _FstSymbolTable(_SymbolTable):\n\n  \"\"\"\n  (No constructor.)\n\n  Mutable SymbolTable class for tables stored in a mutable FST.\n\n  This class wraps a library SymbolTable and exposes methods of the wrapped\n  object. It is only to be returned by method, never constructed directly.\n  \"\"\"\n\n  # NB: Do not expose any non-const methods of the wrapped SymbolTable here.\n  # Doing so will allow undefined behavior.\n\n  def __repr__(self):\n    return \"<const Fst SymbolTable {!r} at 0x{:x}>\".format(self.name(),\n                                                           id(self))\n\n\ncdef class _MutableSymbolTable(_SymbolTable):\n\n  \"\"\"\n  (No constructor.)\n\n  Base class for mutable symbol tables.\n\n  This class is the base class for a mutable SymbolTable. It has a \"deleted\"\n  constructor and implementations of all methods of the wrapped SymbolTable.\n  \"\"\"\n\n  cpdef int64 add_symbol(self, symbol, int64 key=kNoSymbol):\n    \"\"\"\n    add_symbol(self, symbol, key=NO_SYMBOL)\n\n    Adds a symbol to the table and returns the index.\n\n    This method adds a symbol to the table. The caller can optionally\n    specify a non-negative integer index for the key.\n\n    Args:\n      symbol: A symbol string.\n      key: An index for the symbol; if not specified, the next index will be\n          used.\n\n    Returns:\n      The integer key of the new symbol.\n    \"\"\"\n    cdef string symbol_string = tostring(symbol)\n    if key != kNoSymbol:\n      return self._table.AddSymbol(symbol_string, key)\n    else:\n      return self._table.AddSymbol(symbol_string)\n\n  cpdef void add_table(self, _SymbolTable syms):\n    \"\"\"\n    add_table(self, syms)\n\n    Adds another SymbolTable to this table.\n\n    This method merges another symbol table into the current table. All key\n    values will be offset by the current available key.\n\n    Args:\n      syms: A SymbolTable to be merged with the current table.\n    \"\"\"\n    self._table.AddTable(deref(syms._table))\n\n  cpdef void set_name(self, new_name) except *:\n    self._table.SetName(tostring(new_name))\n\n\ncdef class _MutableFstSymbolTable(_MutableSymbolTable):\n  \"\"\"\n  (No constructor.)\n\n  Mutable SymbolTable assigned to an FST.\n  \"\"\"\n\n  def __repr__(self):\n    return \"<Fst SymbolTable {!r} at 0x{:x}>\".format(self.name(), id(self))\n\n\ncdef class SymbolTable(_MutableSymbolTable):\n\n  \"\"\"\n  SymbolTable(name=\"<unspecified>\")\n\n  Mutable SymbolTable class.\n\n  This class wraps the library SymbolTable and exposes both const (i.e.,\n  access) and non-const (i.e., mutation) methods of wrapped object.\n\n  Unlike other classes in the hierarchy, it has a working constructor and can be\n  used to programmatically construct a SymbolTable in memory.\n\n  Args:\n    name: An optional string indicating the table's name.\n  \"\"\"\n\n  def __repr__(self):\n    return \"<SymbolTable {!r} at 0x{:x}>\".format(self.name(), id(self))\n\n  def __init__(self, name=\"<unspecified>\"):\n    self._table = new fst.SymbolTable(tostring(name))\n    self._smart_table.reset(self._table)\n\n  @classmethod\n  def read(cls, filename):\n    \"\"\"\n    SymbolTable.read(filename)\n\n    Reads symbol table from binary file.\n\n    This class method creates a new SymbolTable from a symbol table binary file.\n\n    Args:\n      filename: The string location of the input binary file.\n\n    Returns:\n      A new SymbolTable instance.\n\n    See also: `SymbolTable.read_fst`, `SymbolTable.read_text`.\n    \"\"\"\n    cdef fst.SymbolTable *tsyms = fst.SymbolTable.Read(tostring(filename))\n    if tsyms == NULL:\n      raise FstIOError(\"Read failed: {!r}\".format(filename))\n    return _init_SymbolTable(tsyms)\n\n  @classmethod\n  def read_text(cls, filename, bool allow_negative_labels=False):\n    \"\"\"\n    SymbolTable.read_text(filename)\n\n    Reads symbol table from text file.\n\n    This class method creates a new SymbolTable from a symbol table text file.\n\n    Args:\n      filename: The string location of the input text file.\n      allow_negative_labels: Should negative labels be allowed? (Not\n          recommended; may cause conflicts).\n\n    Returns:\n      A new SymbolTable instance.\n\n    See also: `SymbolTable.read`, `SymbolTable.read_fst`.\n    \"\"\"\n    cdef unique_ptr[fst.SymbolTableTextOptions] opts\n    opts.reset(new fst.SymbolTableTextOptions(allow_negative_labels))\n    cdef fst.SymbolTable *tsyms = fst.SymbolTable.ReadText(tostring(filename),\n                                                           deref(opts))\n    if tsyms == NULL:\n      raise FstIOError(\"Read failed: {!r}\".format(filename))\n    return _init_SymbolTable(tsyms)\n\n  @classmethod\n  def read_fst(cls, filename, bool input_table):\n    \"\"\"\n    SymbolTable.read_fst(filename, input_table)\n\n    Reads symbol table from an FST file without loading the corresponding FST.\n\n    This class method creates a new SymbolTable by reading either the input or\n    output symbol table from an FST file, without loading the corresponding FST.\n\n    Args:\n      filename: The string location of the input FST file.\n      input_table: Should the input table be read (True) or the output table\n          (False)?\n\n    Returns:\n      A new SymbolTable instance, or None if none can be read.\n\n    Raises:\n      FstIOError: Read failed.\n\n    See also: `SymbolTable.read`, `SymbolTable.read_text`.\n    \"\"\"\n    cdef fst.SymbolTable *tsyms = fst.FstReadSymbols(tostring(filename),\n                                                     input_table)\n    if tsyms == NULL:\n      raise FstIOError(\"Read failed: {!r}\".format(filename))\n    return _init_SymbolTable(tsyms)\n\n\ncdef _EncodeMapperSymbolTable _init_EncodeMapperSymbolTable(\n    fst.SymbolTable *table, shared_ptr[fst.EncodeMapperClass] encoder):\n  cdef _EncodeMapperSymbolTable result = (\n      _EncodeMapperSymbolTable.__new__(_EncodeMapperSymbolTable))\n  result._table = table\n  result._encoder = encoder\n  return result\n\n\ncdef _FstSymbolTable _init_FstSymbolTable(fst.SymbolTable *table,\n                                          shared_ptr[fst.FstClass] ifst):\n  cdef _FstSymbolTable result = _FstSymbolTable.__new__(_FstSymbolTable)\n  result._table = table\n  result._fst = ifst\n  return result\n\n\ncdef _MutableFstSymbolTable _init_MutableFstSymbolTable(fst.SymbolTable *table,\n    shared_ptr[fst.MutableFstClass] ifst):\n  cdef _MutableFstSymbolTable result = (\n      _MutableFstSymbolTable.__new__(_MutableFstSymbolTable))\n  result._table = table\n  result._mfst = ifst\n  return result\n\n\ncdef SymbolTable _init_SymbolTable(fst.SymbolTable *table):\n  cdef SymbolTable result = SymbolTable.__new__(SymbolTable)\n  result._table = table\n  return result\n\n\n# Constructive SymbolTable operations.\n\n\ncpdef SymbolTable compact_symbol_table(_SymbolTable syms):\n  \"\"\"\n  compact_symbol_table(syms)\n\n  Constructively relabels a SymbolTable to make it a contiguous mapping.\n\n  Args:\n    syms: Input SymbolTable.\n\n  Returns:\n    A new compacted SymbolTable.\n  \"\"\"\n  return _init_SymbolTable(fst.CompactSymbolTable(deref(syms._table)))\n\n\ncpdef SymbolTable merge_symbol_table(_SymbolTable lhs, _SymbolTable rhs):\n  \"\"\"\n  merge_symbol_table(lhs, rhs)\n\n  Merges all symbols from the left table into the right.\n\n  This function creates a new SymbolTable which is the merger of the two input\n  symbol Tables. Symbols in the right-hand table that conflict with those in the\n  left-hand table will be assigned values from the left-hand table. Thus the\n  returned table will never modify symbol assignments from the left-hand side,\n  but may do so on the right.\n\n  If the left-hand table is associated with an FST, it may be necessary to\n  relabel it using the output table.\n\n  Args:\n    lhs: Left-hand side SymbolTable.\n    rhs: Left-hand side SymbolTable.\n\n  Returns:\n    A new merged SymbolTable.\n\n  See also: `relabel_symbols`.\n  \"\"\"\n  return _init_SymbolTable(fst.MergeSymbolTable(deref(lhs._table),\n                                                deref(rhs._table), NULL))\n\n\n## SymbolTableIterator.\n\n\ncdef class SymbolTableIterator(object):\n\n  \"\"\"\n  SymbolTableIterator(syms)\n\n  This class is used for iterating over a symbol table.\n  \"\"\"\n\n  def __repr__(self):\n    return \"<SymbolTableIterator at 0x{:x}>\".format(id(self))\n\n  def __init__(self, _SymbolTable syms):\n    self._siter.reset(new fst.SymbolTableIterator(deref(syms._table)))\n\n  # This just registers this class as a possible iterator.\n  def __iter__(self):\n    return self\n\n  # Magic method used to get a Pythonic API out of the C++ API.\n  def __next__(self):\n    if self.done():\n      raise StopIteration\n    cdef int64 value = self.value()\n    cdef string symbol = self.symbol()\n    self.next()\n    return (value, symbol)\n\n  cpdef bool done(self):\n    \"\"\"\n    done(self)\n\n    Indicates whether the iterator is exhausted or not.\n\n    Returns:\n      True if the iterator is exhausted, False otherwise.\n    \"\"\"\n    return self._siter.get().Done()\n\n  cpdef void next(self):\n    \"\"\"\n    next(self)\n\n    Advances the iterator.\n    \"\"\"\n    self._siter.get().Next()\n\n  cpdef void reset(self):\n    \"\"\"\n    reset(self)\n\n    Resets the iterator to the initial position.\n    \"\"\"\n    self._siter.get().Reset()\n\n  cpdef string symbol(self):\n    \"\"\"\n    symbol(self)\n\n    Returns the current symbol string.\n\n    This method returns the current symbol string at this point in the table.\n\n    Returns:\n      A symbol string.\n    \"\"\"\n    return self._siter.get().Symbol()\n\n  cpdef int64 value(self):\n    \"\"\"\n    value(self)\n\n    Returns the current integer index of the symbol.\n\n    Returns:\n      An integer index.\n    \"\"\"\n    return self._siter.get().Value()\n\n\n## EncodeMapper.\n\n\ncdef class EncodeMapper(object):\n\n  \"\"\"\n  EncodeMapper(arc_type=\"standard\", encode_labels=False, encode_weights=False)\n\n  Arc encoder class, wrapping EncodeMapperClass.\n\n  This class provides an object which can be used to encode or decode FST arcs.\n  This is most useful to convert an FST to an unweighted acceptor, on which\n  some FST operations are more efficient, and then decoding the FST afterwards.\n\n  To use an instance of this class to encode or decode a mutable FST, pass it\n  as the first argument to the FST instance methods `encode` and `decode`.\n\n  For implementational reasons, it is not currently possible to use an encoder\n  on disk to construct this class.\n\n  Args:\n    arc_type: A string indicating the arc type.\n    encode_labels: Should labels be encoded?\n    encode_weights: Should weights be encoded?\n  \"\"\"\n\n  def __repr__(self):\n    return \"<EncodeMapper at 0x{:x}>\".format(id(self))\n\n  def __init__(self,\n               arc_type=b\"standard\",\n               bool encode_labels=False,\n               bool encode_weights=False):\n    cdef uint32 flags = fst.GetEncodeFlags(encode_labels, encode_weights)\n    self._encoder.reset(new fst.EncodeMapperClass(tostring(arc_type), flags,\n                                                  fst.ENCODE))\n    if not self._encoder:\n      raise FstOpError(\"Unknown arc type: {!r}\".format(arc_type))\n\n  cpdef string arc_type(self):\n    \"\"\"\n    arc_type(self)\n\n    Returns a string indicating the arc type.\n    \"\"\"\n    return self._encoder.get().ArcType()\n\n  # Python's equivalent to operator().\n\n  def __call__(self, Arc arc):\n    \"\"\"\n    self(state, ilabel, olabel, weight, nextstate)\n\n    Uses the encoder to encode an arc.\n\n    Args:\n      ilabel: The integer index of the input label.\n      olabel: The integer index of the output label.\n      weight: A Weight or weight string indicating the desired final weight; if\n        null, it is set to semiring One.\n      nextstate: The integer index of the destination state.\n\n    Raises:\n      FstOpError: Incompatible or invalid weight.\n    \"\"\"\n    return _init_Arc(self._encoder.get().__call__(deref(arc._arc)))\n\n  cpdef uint32 flags(self):\n    \"\"\"\n    flags(self)\n\n    Returns the encoder's flags.\n    \"\"\"\n    return self._encoder.get().Flags()\n\n  cpdef _EncodeMapperSymbolTable input_symbols(self):\n    \"\"\"\n    input_symbols(self)\n\n    Returns the encoder's input symbol table, or None if none is present.\n    \"\"\"\n    cdef fst.SymbolTable *syms = const_cast[SymbolTable_ptr](\n        self._encoder.get().InputSymbols())\n    if syms == NULL:\n      return\n    return _init_EncodeMapperSymbolTable(syms, self._encoder)\n\n  cpdef _EncodeMapperSymbolTable output_symbols(self):\n    \"\"\"\n    output_symbols(self)\n\n    Returns the encoder's output symbol table, or None if none is present.\n    \"\"\"\n    cdef fst.SymbolTable *syms = const_cast[SymbolTable_ptr](\n        self._encoder.get().OutputSymbols())\n    if syms == NULL:\n      return\n    return _init_EncodeMapperSymbolTable(syms, self._encoder)\n\n  cpdef uint64 properties(self, uint64 mask):\n    \"\"\"\n    properties(self, mask)\n\n    Provides property bits.\n\n    This method provides user access to the properties of the encoder.\n\n    Args:\n      mask: The property mask to be compared to the encoder's properties.\n\n    Returns:\n      A 64-bit bitmask representing the requested properties.\n    \"\"\"\n    return self._encoder.get().Properties(mask)\n\n  cpdef void set_input_symbols(self, _SymbolTable syms) except *:\n    \"\"\"\n    set_input_symbols(self, syms)\n\n    Sets the encoder's input symbol table.\n\n    Args:\n      syms: A SymbolTable.\n\n    See also: `set_output_symbols`.\n    \"\"\"\n    self._encoder.get().SetInputSymbols(syms._table)\n\n  cpdef void set_output_symbols(self, _SymbolTable syms) except *:\n    \"\"\"\n    set_output_symbols(self, syms)\n\n    Sets the encoder's output symbol table.\n\n    Args:\n      syms: A SymbolTable.\n\n    See also: `set_input_symbols`.\n    \"\"\"\n    self._encoder.get().SetOutputSymbols(syms._table)\n\n  cpdef string weight_type(self):\n    \"\"\"\n    weight_type(self)\n\n    Returns a string indicating the weight type.\n    \"\"\"\n    return self._encoder.get().WeightType()\n\n\n## _Fst, _MutableFst, Fst, and helpers.\n#\n# Fst hierarchy:\n#\n# _Fst: base class; has-a FstClass*.\n# _MutableFst(_Fst): adds mutable methods.\n# Fst(filename): pseudo-constructor.\n\n\ncdef class _Fst(object):\n\n  \"\"\"\n  (No constructor.)\n\n  Immutable FST class, wrapping FstClass.\n\n  This class is the basic user-facing FST object. It does not itself support any\n  mutation operations.\n  \"\"\"\n\n  # IPython notebook magic to produce an SVG of the FST.\n  def _repr_svg_(self):\n    \"\"\"IPython notebook magic to produce an SVG of the FST using GraphViz.\n\n    This method produces an SVG of the internal graph. Users wishing to create\n    publication-quality graphs should instead use the method `draw`, which\n    exposes additional parameters.\n\n    Raises:\n      OSError: Cannot locate the `dot` executable.\n      subprocess.CalledProcessError: `dot` returned non-zero exit code.\n\n    See also: `draw`, `text`.\n    \"\"\"\n    # Quickly throws OSError if the dot executable i s not found.\n    proc = subprocess.Popen([\"dot\", \"-Tsvg\"],\n                            stdin=subprocess.PIPE,\n                            stdout=subprocess.PIPE,\n                            stderr=subprocess.PIPE)\n    cdef stringstream sstrm\n    fst.DrawFst(deref(self._fst), self._fst.get().InputSymbols(),\n                self._fst.get().OutputSymbols(), NULL,\n                self._fst.get().Properties(fst.kAcceptor, True) ==\n                fst.kAcceptor,\n                b\"\", 8.5, 11, True, False, 0.4, 0.25, 14, 5, b\"g\", False,\n                addr(sstrm), b\"_repr_svg\")\n    # The stream gets decoded automatically so we have to re-encode it to pass\n    # it to the process.\n    (sout, serr) = proc.communicate(sstrm.str().encode(\"utf8\"))\n    if proc.returncode != 0:  # Just to be explicit.\n      raise subprocess.CalledProcessError(proc.returncode, self._DOT_TSVG)\n    return sout.decode(\"utf8\")\n\n  def __repr__(self):\n    return \"<{} Fst at 0x{:x}>\".format(self.fst_type(), id(self))\n\n  def __init__(self):\n    raise FstDeletedConstructorError(\n        \"Cannot construct {}\".format(self.__class__.__name__))\n\n  def __str__(self):\n    return self.text()\n\n  # Registers the class for pickling; must be repeated in any subclass which\n  # can't be derived by _init_XFst.\n\n  def __reduce__(self):\n    return (_read_from_string, (self.write_to_string(),))\n\n  cpdef string arc_type(self):\n    \"\"\"\n    arc_type(self)\n\n    Returns a string indicating the arc type.\n    \"\"\"\n    return self._fst.get().ArcType()\n\n  cpdef ArcIterator arcs(self, int64 state):\n    \"\"\"\n    arcs(self, state)\n\n    Returns an iterator over arcs leaving the specified state.\n\n    Args:\n      state: The source state ID.\n\n    Returns:\n      An ArcIterator.\n\n    See also: `mutable_arcs`, `states`.\n    \"\"\"\n    return ArcIterator(self, state)\n\n  cpdef _Fst copy(self):\n    \"\"\"\n    copy(self)\n\n    Makes a copy of the FST.\n    \"\"\"\n    return _init_XFst(new fst.FstClass(deref(self._fst)))\n\n  cpdef void draw(self,\n                  filename,\n                  _SymbolTable isymbols=None,\n                  _SymbolTable osymbols=None,\n                  SymbolTable ssymbols=None,\n                  bool acceptor=False,\n                  title=b\"\",\n                  double width=8.5,\n                  double height=11,\n                  bool portrait=False,\n                  bool vertical=False,\n                  double ranksep=0.4,\n                  double nodesep=0.25,\n                  int32 fontsize=14,\n                  int32 precision=5,\n                  float_format=b\"g\",\n                  bool show_weight_one=False):\n    \"\"\"\n    draw(self, filename, isymbols=None, osymbols=None, ssymbols=None,\n         acceptor=False, title=\"\", width=8.5, height=11, portrait=False,\n         vertical=False, ranksep=0.4, nodesep=0.25, fontsize=14,\n         precision=5, float_format=\"g\", show_weight_one=False):\n\n    Writes out the FST in Graphviz text format.\n\n    This method writes out the FST in the dot graph description language. The\n    graph can be rendered using the `dot` executable provided by Graphviz.\n\n    Args:\n      filename: The string location of the output dot/Graphviz file.\n      isymbols: An optional symbol table used to label input symbols.\n      osymbols: An optional symbol table used to label output symbols.\n      ssymbols: An optional symbol table used to label states.\n      acceptor: Should the figure be rendered in acceptor format if possible?\n      title: An optional string indicating the figure title.\n      width: The figure width, in inches.\n      height: The figure height, in inches.\n      portrait: Should the figure be rendered in portrait rather than\n          landscape?\n      vertical: Should the figure be rendered bottom-to-top rather than\n          left-to-right?\n      ranksep: The minimum separation separation between ranks, in inches.\n      nodesep: The minimum separation between nodes, in inches.\n      fontsize: Font size, in points.\n      precision: Numeric precision for floats, in number of chars.\n      float_format: One of: 'e', 'f' or 'g'.\n      show_weight_one: Should weights equivalent to semiring One be printed?\n\n    See also: `text`.\n    \"\"\"\n    cdef string filename_string = tostring(filename)\n    cdef unique_ptr[ofstream] ostrm\n    ostrm.reset(new ofstream(filename_string))\n    cdef fst.SymbolTable *ssymbols_ptr = NULL\n    if ssymbols is not None:\n      ssymbols_ptr = ssymbols._table\n    fst.DrawFst(deref(self._fst),\n        self._fst.get().InputSymbols() if isymbols is None\n        else isymbols._table,\n        self._fst.get().OutputSymbols() if osymbols is None\n        else osymbols._table,\n        ssymbols_ptr, acceptor, tostring(title), width, height, portrait,\n        vertical, ranksep, nodesep, fontsize, precision,\n        tostring(float_format), show_weight_one, ostrm.get(),\n        filename_string)\n\n  cpdef Weight final(self, int64 state):\n    \"\"\"\n    final(self, state)\n\n    Returns the final weight of a state.\n\n    Args:\n      state: The integer index of a state.\n\n    Returns:\n      The final Weight of that state.\n\n    Raises:\n      FstIndexError: State index out of range.\n    \"\"\"\n    cdef Weight weight = Weight.__new__(Weight)\n    weight._weight.reset(new fst.WeightClass(self._fst.get().Final(state)))\n    return weight\n\n  cpdef string fst_type(self):\n    \"\"\"\n    fst_type(self)\n\n    Returns a string indicating the FST type.\n    \"\"\"\n    return self._fst.get().FstType()\n\n  cpdef _FstSymbolTable input_symbols(self):\n    \"\"\"\n    input_symbols(self)\n\n    Returns the FST's input symbol table, or None if none is present.\n\n    See also: `input_symbols`.\n    \"\"\"\n    cdef fst.SymbolTable *syms = const_cast[SymbolTable_ptr](\n      self._fst.get().InputSymbols())\n    if syms == NULL:\n      return\n    return _init_FstSymbolTable(syms, self._fst)\n\n  cpdef size_t num_arcs(self, int64 state) except *:\n    \"\"\"\n    num_arcs(self, state)\n\n    Returns the number of arcs leaving a state.\n\n    Args:\n      state: The integer index of a state.\n\n    Returns:\n      The number of arcs leaving that state.\n\n    Raises:\n      FstIndexError: State index out of range.\n\n    See also: `num_states`.\n    \"\"\"\n    cdef size_t result = self._fst.get().NumArcs(state)\n    if result == SIZE_MAX:\n      raise FstIndexError(\"State index out of range\")\n    return result\n\n  cpdef size_t num_input_epsilons(self, int64 state) except *:\n    \"\"\"\n    num_input_epsilons(self, state)\n\n    Returns the number of arcs with epsilon input labels leaving a state.\n\n    Args:\n      state: The integer index of a state.\n\n    Returns:\n      The number of epsilon-input-labeled arcs leaving that state.\n\n    Raises:\n      FstIndexError: State index out of range.\n\n    See also: `num_output_epsilons`.\n    \"\"\"\n    cdef size_t result = self._fst.get().NumInputEpsilons(state)\n    if result == SIZE_MAX:\n      raise FstIndexError(\"State index out of range\")\n    return result\n\n  cpdef size_t num_output_epsilons(self, int64 state) except *:\n    \"\"\"\n    num_output_epsilons(self, state)\n\n    Returns the number of arcs with epsilon output labels leaving a state.\n\n    Args:\n      state: The integer index of a state.\n\n    Returns:\n      The number of epsilon-output-labeled arcs leaving that state.\n\n    Raises:\n      FstIndexError: State index out of range.\n\n    See also: `num_input_epsilons`.\n    \"\"\"\n    cdef size_t result = self._fst.get().NumOutputEpsilons(state)\n    if result == SIZE_MAX:\n      raise FstIndexError(\"State index out of range\")\n    return result\n\n  cpdef _FstSymbolTable output_symbols(self):\n    \"\"\"\n    output_symbols(self)\n\n    Returns the FST's output symbol table, or None if none is present.\n\n    See also: `input_symbols`.\n    \"\"\"\n    cdef fst.SymbolTable *syms = const_cast[SymbolTable_ptr](\n      self._fst.get().OutputSymbols())\n    if syms == NULL:\n      return\n    return _init_FstSymbolTable(syms, self._fst)\n\n  cpdef uint64 properties(self, uint64 mask, bool test):\n    \"\"\"\n    properties(self, mask, test)\n\n    Provides property bits.\n\n    This method provides user access to the properties attributes for the FST.\n    The resulting value is a long integer, but when it is cast to a boolean,\n    it represents whether or not the FST has the `mask` property.\n\n    Args:\n      mask: The property mask to be compared to the FST's properties.\n      test: Should any unknown values be computed before comparing against\n          the mask?\n\n    Returns:\n      A 64-bit bitmask representing the requested properties.\n    \"\"\"\n    return self._fst.get().Properties(mask, test)\n\n  cpdef int64 start(self):\n    \"\"\"\n    start(self)\n\n    Returns the start state.\n    \"\"\"\n    return self._fst.get().Start()\n\n  cpdef StateIterator states(self):\n    \"\"\"\n    states(self)\n\n    Returns an iterator over all states in the FST.\n\n    Returns:\n      A StateIterator object for the FST.\n\n    See also: `arcs`, `mutable_arcs`.\n    \"\"\"\n    return StateIterator(self)\n\n  cpdef string text(self, _SymbolTable isymbols=None,\n      _SymbolTable osymbols=None, _SymbolTable ssymbols=None,\n      bool acceptor=False, bool show_weight_one=False, missing_sym=b\"\"):\n    \"\"\"\n    text(self, isymbols=None, osymbols=None, ssymbols=None, acceptor=False,\n         show_weight_one=False, missing_sym=\"\")\n\n    Produces a human-readable string representation of the FST.\n\n    This method generates a human-readable string representation of the FST.\n    The caller may optionally specify SymbolTables used to label input labels,\n    output labels, or state labels, respectively.\n\n    Args:\n      isymbols: An optional symbol table used to label input symbols.\n      osymbols: An optional symbol table used to label output symbols.\n      ssymbols: An optional symbol table used to label states.\n      acceptor: Should the FST be rendered in acceptor format if possible?\n      show_weight_one: Should weights equivalent to semiring One be printed?\n      missing_symbol: The string to be printed when symbol table lookup fails.\n\n    Returns:\n      A formatted string representing the machine.\n    \"\"\"\n    # Prints FST to stringstream, then returns resulting string.\n    cdef fst.SymbolTable *ssymbols_ptr = NULL\n    if ssymbols is not None:\n      ssymbols_ptr = ssymbols._table\n    cdef stringstream sstrm\n    fst.PrintFst(deref(self._fst), sstrm, \"<pywrapfst>\",\n        self._fst.get().InputSymbols() if isymbols is None\n        else isymbols._table,\n        self._fst.get().OutputSymbols() if osymbols is None\n        else osymbols._table,\n        ssymbols_ptr, acceptor, show_weight_one, tostring(missing_sym))\n    return sstrm.str()\n\n  cpdef bool verify(self):\n    \"\"\"\n    verify(self)\n\n    Verifies that an FST's contents are sane.\n\n    Returns:\n      True if the contents are sane, False otherwise.\n    \"\"\"\n    return fst.Verify(deref(self._fst))\n\n  cpdef string weight_type(self):\n    \"\"\"\n    weight_type(self)\n\n    Provides the FST's weight type.\n\n    Returns:\n      A string representing the weight type.\n    \"\"\"\n    return self._fst.get().WeightType()\n\n  cpdef void write(self, filename) except *:\n    \"\"\"\n    write(self, filename)\n\n    Serializes FST to a file.\n\n    This method writes the FST to a file in a binary format.\n\n    Args:\n      filename: The string location of the output file.\n\n    Raises:\n      FstIOError: Write failed.\n    \"\"\"\n    if not self._fst.get().Write(tostring(filename)):\n      raise FstIOError(\"Write failed: {!r}\".format(filename))\n\n  cpdef bytes write_to_string(self):\n    \"\"\"\n    write_to_string(self)\n\n    Serializes FST to a string.\n\n    Returns:\n      A string.\n\n    Raises:\n      FstIOError: Write to string failed.\n\n    See also: `read_from_string`.\n    \"\"\"\n    cdef stringstream sstrm\n    if not self._fst.get().Write(sstrm, \"write_to_string\"):\n      raise FstIOError(\"Write to string failed\")\n    return sstrm.str()\n\n\ncdef class _MutableFst(_Fst):\n\n  \"\"\"\n  (No constructor.)\n\n  Mutable FST class, wrapping MutableFstClass.\n\n  This class extends _Fst by adding mutation operations.\n  \"\"\"\n\n  cdef void _check_mutating_imethod(self) except *:\n    \"\"\"Checks whether an operation mutating the FST has produced an error.\n\n    This function is not visible to Python users.\n    \"\"\"\n    if self._fst.get().Properties(fst.kError, True) == fst.kError:\n      raise FstOpError(\"Operation failed\")\n\n  cdef void _add_arc(self, int64 state, Arc arc) except *:\n    if not self._fst.get().ValidStateId(state):\n      raise FstIndexError(\"State index out of range\")\n    if not self._mfst.get().AddArc(state, deref(arc._arc)):\n      raise FstOpError(\"Incompatible or invalid weight type\")\n    self._check_mutating_imethod()\n\n  def add_arc(self, int64 state, Arc arc):\n    \"\"\"\n    add_arc(self, state, arc)\n\n    Adds a new arc to the FST and return self.\n\n    Args:\n      state: The integer index of the source state.\n      arc: The arc to add.\n\n    Returns:\n      self.\n\n    Raises:\n      FstIndexError: State index out of range.\n      FstOpdexError: Incompatible or invalid weight type.\n\n    See also: `add_state`.\n    \"\"\"\n    self._add_arc(state, arc)\n    return self\n\n  cpdef int64 add_state(self) except *:\n    \"\"\"\n    add_state(self)\n\n    Adds a new state to the FST and returns the state ID.\n\n    Returns:\n      The integer index of the new state.\n\n    See also: `add_arc`, `set_start`, `set_final`.\n    \"\"\"\n    cdef int64 result = self._mfst.get().AddState()\n    self._check_mutating_imethod()\n    return result\n\n  cdef void _arcsort(self, sort_type=b\"ilabel\") except *:\n    cdef fst.ArcSortType sort_type_enum\n    if not fst.GetArcSortType(tostring(sort_type), addr(sort_type_enum)):\n      raise FstArgError(\"Unknown sort type {!r}\".format(sort_type))\n    fst.ArcSort(self._mfst.get(), sort_type_enum)\n    self._check_mutating_imethod()\n\n  def arcsort(self, sort_type=b\"ilabel\"):\n    \"\"\"\n    arcsort(self, sort_type=\"ilabel\")\n\n    Sorts arcs leaving each state of the FST.\n\n    This operation destructively sorts arcs leaving each state using either\n    input or output labels.\n\n    Args:\n      sort_type: Either \"ilabel\" (sort arcs according to input labels) or\n          \"olabel\" (sort arcs according to output labels).\n\n    Returns:\n      self.\n\n    Raises:\n      FstArgError: Unknown sort type.\n\n    See also: `topsort`.\n    \"\"\"\n    self._arcsort(sort_type)\n    return self\n\n  cdef void _closure(self, bool closure_plus=False) except *:\n    fst.Closure(self._mfst.get(), fst.GetClosureType(closure_plus))\n    self._check_mutating_imethod()\n\n  def closure(self, bool closure_plus=False):\n    \"\"\"\n    closure(self, closure_plus=False)\n\n    Computes concatenative closure.\n\n    This operation destructively converts the FST to its concatenative closure.\n    If A transduces string x to y with weight a, then the closure transduces x\n    to y with weight a, xx to yy with weight a \\otimes a, xxx to yyy with weight\n    a \\otimes a \\otimes a, and so on. The empty string is also transduced to\n    itself with semiring One if `closure_plus` is False.\n\n    Args:\n      closure_plus: If False, do not accept the empty string.\n\n    Returns:\n      self.\n    \"\"\"\n    self._closure(closure_plus)\n    return self\n\n  cdef void _concat(self, _Fst ifst) except *:\n    fst.Concat(self._mfst.get(), deref(ifst._fst))\n    self._check_mutating_imethod()\n\n  def concat(self, _Fst ifst):\n    \"\"\"\n    concat(self, ifst)\n\n    Computes the concatenation (product) of two FSTs.\n\n    This operation destructively concatenates the FST with a second FST. If A\n    transduces string x to y with weight a and B transduces string w to v with\n    weight b, then their concatenation transduces string xw to yv with weight a\n    \\otimes b.\n\n    Args:\n      ifst: The second input FST.\n\n    Returns:\n      self.\n    \"\"\"\n    self._concat(ifst)\n    return self\n\n  cdef void _connect(self) except *:\n    fst.Connect(self._mfst.get())\n    self._check_mutating_imethod()\n\n  def connect(self):\n    \"\"\"\n    connect(self)\n\n    Removes unsuccessful paths.\n\n    This operation destructively trims the FST, removing states and arcs that\n    are not part of any successful path.\n\n    Returns:\n      self.\n    \"\"\"\n    self._connect()\n    return self\n\n  cdef void _decode(self, EncodeMapper encoder) except *:\n    fst.Decode(self._mfst.get(), deref(encoder._encoder))\n    self._check_mutating_imethod()\n\n  def decode(self, EncodeMapper encoder):\n    \"\"\"\n    decode(self, encoder)\n\n    Decodes encoded labels and/or weights.\n\n    This operation reverses the encoding performed by `encode`.\n\n    Args:\n      encoder: An EncodeMapper object used to encode the FST.\n\n    Returns:\n      self.\n\n    See also: `encode`.\n    \"\"\"\n    self._decode(encoder)\n    return self\n\n  cdef void _delete_arcs(self, int64 state, size_t n=0) except *:\n    if not (self._mfst.get().DeleteArcs(state, n) if n else\n            self._mfst.get().DeleteArcs(state)):\n      raise FstIndexError(\"State index out of range\")\n    self._check_mutating_imethod()\n\n  def delete_arcs(self, int64 state, size_t n=0):\n    \"\"\"\n    delete_arcs(self, state, n=0)\n\n    Deletes arcs leaving a particular state.\n\n    Args:\n      state: The integer index of a state.\n      n: An optional argument indicating how many arcs to be deleted. If this\n          argument is omitted or passed as zero, all arcs from this state are\n          deleted.\n\n    Returns:\n      self.\n\n    Raises:\n      FstIndexError: State index out of range.\n\n    See also: `delete_states`.\n    \"\"\"\n    self._delete_arcs(state, n)\n    return self\n\n  cdef void _delete_states(self, states=None) except *:\n    # Only the former signature has a possible indexing failure.\n    if states:\n      if not self._mfst.get().DeleteStates(<const vector[int64]> states):\n        raise FstIndexError(\"State index out of range\")\n    else:\n      self._mfst.get().DeleteStates()\n    self._check_mutating_imethod()\n\n  def delete_states(self, states=None):\n    \"\"\"\n    delete_states(self, states=None)\n\n    Deletes states.\n\n    Args:\n      states: An optional iterable of integer indices of the states to be\n          deleted. If this argument is omitted, all states are deleted.\n\n    Returns:\n      self.\n\n    Raises:\n      FstIndexError: State index out of range.\n\n    See also: `delete_arcs`.\n    \"\"\"\n    self._delete_states(states)\n    return self\n\n  cdef void _encode(self, EncodeMapper encoder) except *:\n    fst.Encode(self._mfst.get(), encoder._encoder.get())\n    self._check_mutating_imethod()\n\n  def encode(self, EncodeMapper encoder):\n    \"\"\"\n    encode(self, encoder)\n\n    Encodes labels and/or weights.\n\n    This operation allows for the representation of a weighted transducer as a\n    weighted acceptor, an unweighted transducer, or an unweighted acceptor by\n    considering the pair (input label, output label), the pair (input label,\n    weight), or the triple (input label, output label, weight) as a single\n    label. Applying this operation mutates the EncodeMapper argument, which\n    can then be used to decode.\n\n    Args:\n      encoder: An EncodeMapper object to be used as the encoder.\n\n    Returns:\n      self.\n\n    See also: `decode`.\n    \"\"\"\n    self._encode(encoder)\n    return self\n\n  cdef void _invert(self) except *:\n    fst.Invert(self._mfst.get())\n    self._check_mutating_imethod()\n\n  def invert(self):\n    \"\"\"\n    invert(self)\n\n    Inverts the FST's transduction.\n\n    This operation destructively inverts the FST's transduction by exchanging\n    input and output labels.\n\n    Returns:\n      self.\n    \"\"\"\n    self._invert()\n    return self\n\n  cdef void _minimize(self, float delta=fst.kShortestDelta,\n                      bool allow_nondet=False) except *:\n    # This runs in-place when the second argument is null.\n    fst.Minimize(self._mfst.get(), NULL, delta, allow_nondet)\n    self._check_mutating_imethod()\n\n  def minimize(self, float delta=fst.kShortestDelta, bool allow_nondet=False):\n    \"\"\"\n    minimize(self, delta=1e-6, allow_nondet=False)\n\n    Minimizes the FST.\n\n    This operation destructively performs the minimization of deterministic\n    weighted automata and transducers. If the input FST A is an acceptor, this\n    operation produces the minimal acceptor B equivalent to A, i.e. the\n    acceptor with a minimal number of states that is equivalent to A. If the\n    input FST A is a transducer, this operation internally builds an equivalent\n    transducer with a minimal number of states. However, this minimality is\n    obtained by allowing transition having strings of symbols as output labels,\n    this known in the litterature as a real-time transducer. Such transducers\n    are not directly supported by the library. This function will convert such\n    transducer by expanding each string-labeled transition into a sequence of\n    transitions. This will results in the creation of new states, hence losing\n    the minimality property.\n\n    Args:\n      delta: Comparison/quantization delta.\n      allow_nondet: Attempt minimization of non-deterministic FST?\n\n    Returns:\n      self.\n    \"\"\"\n    self._minimize(delta, allow_nondet)\n    return self\n\n  cpdef MutableArcIterator mutable_arcs(self, int64 state):\n    \"\"\"\n    mutable_arcs(self, state)\n\n    Returns a mutable iterator over arcs leaving the specified state.\n\n    Args:\n      state: The source state ID.\n\n    Returns:\n      A MutableArcIterator.\n\n    See also: `arcs`, `states`.\n    \"\"\"\n    return MutableArcIterator(self, state)\n\n  def mutable_input_symbols(self):\n    \"\"\"\n    mutable_input_symbols(self)\n\n    Returns the FST's (mutable) input symbol table, or None if none is present.\n    \"\"\"\n    cdef fst.SymbolTable *tst = self._mfst.get().MutableInputSymbols()\n    if tst == NULL:\n      return\n    return _init_MutableFstSymbolTable(tst, self._mfst)\n\n  def mutable_output_symbols(self):\n    \"\"\"\n    mutable_output_symbols(self)\n\n    Returns the FST's (mutable) output symbol table, or None if none is present.\n    \"\"\"\n    cdef fst.SymbolTable *tst = self._mfst.get().MutableOutputSymbols()\n    if tst == NULL:\n      return\n    return _init_MutableFstSymbolTable(tst, self._mfst)\n\n  cpdef int64 num_states(self):\n    \"\"\"\n    num_states(self)\n\n    Returns the number of states.\n    \"\"\"\n    return self._mfst.get().NumStates()\n\n  cdef void _project(self, bool project_output=False) except *:\n    fst.Project(self._mfst.get(), fst.GetProjectType(project_output))\n    self._check_mutating_imethod()\n\n  def project(self, bool project_output=False):\n    \"\"\"\n    project(self, project_output=False)\n\n    Converts the FST to an acceptor using input or output labels.\n\n    This operation destructively projects an FST onto its domain or range by\n    either copying each arc's input label to its output label (the default) or\n    vice versa.\n\n    Args:\n      project_output: Should the output labels be projected?\n\n    Returns:\n      self.\n\n    See also: `decode`, `encode`, `relabel_pairs`, `relabel_symbols`.\n    \"\"\"\n    self._project(project_output)\n    return self\n\n  cdef void _prune(self, float delta=fst.kDelta, int64 nstate=fst.kNoStateId,\n                   weight=None) except *:\n    # Threshold is set to semiring Zero (no pruning) if no weight is specified.\n    cdef fst.WeightClass wc = _get_WeightClass_or_Zero(self.weight_type(),\n                                                       weight)\n    fst.Prune(self._mfst.get(), wc, nstate, delta)\n    self._check_mutating_imethod()\n\n  def prune(self,\n            float delta=fst.kDelta,\n            int64 nstate=fst.kNoStateId,\n            weight=None):\n    \"\"\"\n    prune(self, delta=0.0009765625, nstate=NO_STATE_ID, weight=None)\n\n    Removes paths with weights below a certain threshold.\n\n    This operation deletes states and arcs in the input FST that do not belong\n    to a successful path whose weight is no more (w.r.t the natural semiring\n    order) than the threshold t \\otimes-times the weight of the shortest path in\n    the input FST. Weights must be commutative and have the path property.\n\n    Args:\n      delta: Comparison/quantization delta.\n      nstate: State number threshold.\n      weight: A Weight or weight string indicating the desired weight threshold\n          below which paths are pruned; if omitted, no paths are pruned.\n\n    Returns:\n      self.\n\n    See also: The constructive variant.\n    \"\"\"\n    self._prune(delta, nstate, weight)\n    return self\n\n  cdef void _push(self,\n                  float delta=fst.kDelta,\n                  bool remove_total_weight=False,\n                  bool to_final=False) except *:\n    fst.Push(self._mfst.get(), fst.GetReweightType(to_final), delta,\n             remove_total_weight)\n    self._check_mutating_imethod()\n\n  def push(self,\n           float delta=fst.kDelta,\n           bool remove_total_weight=False,\n           bool to_final=False):\n    \"\"\"\n    push(self, delta=0.0009765625, remove_total_weight=False, to_final=False)\n\n    Pushes weights towards the initial or final states.\n\n    This operation destructively produces an equivalent transducer by pushing\n    the weights towards the initial state or toward the final states. When\n    pushing weights towards the initial state, the sum of the weight of the\n    outgoing transitions and final weight at any non-initial state is equal to\n    one in the resulting machine. When pushing weights towards the final states,\n    the sum of the weight of the incoming transitions at any state is equal to\n    one. Weights need to be left distributive when pushing towards the initial\n    state and right distributive when pushing towards the final states.\n\n    Args:\n      delta: Comparison/quantization delta.\n      remove_total_weight: If pushing weights, should the total weight be\n          removed?\n      to_final: Push towards final states?\n\n    Returns:\n      self.\n\n    See also: The constructive variant, which also supports label pushing.\n    \"\"\"\n    self._push(delta, remove_total_weight, to_final)\n    return self\n\n  cdef void _relabel_pairs(self, ipairs=None, opairs=None) except *:\n    cdef unique_ptr[vector[fst.LabelPair]] _ipairs\n    _ipairs.reset(new vector[fst.LabelPair]())\n    cdef unique_ptr[vector[fst.LabelPair]] _opairs\n    _opairs.reset(new vector[fst.LabelPair]())\n    cdef int64 before\n    cdef int64 after\n    if ipairs:\n      for (before, after) in ipairs:\n        _ipairs.get().push_back(fst.LabelPair(before, after))\n    if opairs:\n      for (before, after) in opairs:\n        _opairs.get().push_back(fst.LabelPair(before, after))\n    if _ipairs.get().empty() and _opairs.get().empty():\n      raise FstArgError(\"No relabeling pairs specified.\")\n    fst.Relabel(self._mfst.get(), deref(_ipairs), deref(_opairs))\n    self._check_mutating_imethod()\n\n  def relabel_pairs(self, ipairs=None, opairs=None):\n    \"\"\"\n    relabel_pairs(self, ipairs=None, opairs=None)\n\n    Replaces input and/or output labels using pairs of labels.\n\n    This operation destructively relabels the input and/or output labels of the\n    FST using pairs of the form (old_ID, new_ID); omitted indices are\n    identity-mapped.\n\n    Args:\n      ipairs: An iterable containing (older index, newer index) integer pairs.\n      opairs: An iterable containing (older index, newer index) integer pairs.\n\n    Returns:\n      self.\n\n    Raises:\n      FstArgError: No relabeling pairs specified.\n\n    See also: `decode`, `encode`, `project`, `relabel_tables`.\n    \"\"\"\n    self._relabel_pairs(ipairs, opairs)\n    return self\n\n  cdef void _relabel_tables(self,\n                            _SymbolTable old_isymbols=None,\n                            _SymbolTable new_isymbols=None,\n                            unknown_isymbol=b\"\",\n                            bool attach_new_isymbols=True,\n                            _SymbolTable old_osymbols=None,\n                            _SymbolTable new_osymbols=None,\n                            unknown_osymbol=b\"\",\n                            bool attach_new_osymbols=True) except *:\n    if new_isymbols is None and new_osymbols is None:\n      raise FstArgError(\"No new SymbolTables specified\")\n    cdef fst.SymbolTable *new_isymbols_ptr = NULL\n    if new_isymbols is not None:\n      new_isymbols_ptr = new_isymbols._table\n    cdef fst.SymbolTable *new_osymbols_ptr = NULL\n    if new_osymbols is not None:\n      new_osymbols_ptr = new_osymbols._table\n    fst.Relabel(self._mfst.get(),\n        self._fst.get().InputSymbols() if old_isymbols is None else\n        old_isymbols._table, new_isymbols_ptr, tostring(unknown_isymbol),\n        attach_new_isymbols,\n        self._fst.get().OutputSymbols() if old_osymbols is None else\n        old_osymbols._table, new_osymbols_ptr, tostring(unknown_osymbol),\n        attach_new_osymbols)\n    self._check_mutating_imethod()\n\n  def relabel_tables(self,\n                     _SymbolTable old_isymbols=None,\n                     _SymbolTable new_isymbols=None,\n                     unknown_isymbol=b\"\",\n                     bool attach_new_isymbols=True,\n                     _SymbolTable old_osymbols=None,\n                     _SymbolTable new_osymbols=None,\n                     unknown_osymbol=b\"\",\n                     bool attach_new_osymbols=True):\n    \"\"\"\n    relabel_tables(self, old_isymbols=None, new_isymbols=None,\n                   unknown_isymbol=\"\", attach_new_isymbols=True,\n                   old_osymbols=None, new_osymbols=None,\n                   unknown_osymbol=\"\", attach_new_osymbols=True)\n\n    Replaces input and/or output labels using SymbolTables.\n\n    This operation destructively relabels the input and/or output labels of the\n    FST using user-specified symbol tables; omitted symbols are identity-mapped.\n\n    Args:\n       old_isymbols: The old SymbolTable for input labels, defaulting to the\n          FST's input symbol table.\n       new_isymbols: A SymbolTable used to relabel the input labels\n       unknown_isymbol: Input symbol to use to relabel OOVs (if empty,\n          OOVs raise an exception)\n       attach_new_isymbols: Should new_isymbols be made the FST's input symbol\n          table?\n       old_osymbols: The old SymbolTable for output labels, defaulting to the\n          FST's output symbol table.\n       new_osymbols: A SymbolTable used to relabel the output labels.\n       unknown_osymbol: Outnput symbol to use to relabel OOVs (if empty,\n          OOVs raise an exception)\n       attach_new_isymbols: Should new_osymbols be made the FST's output symbol\n          table?\n\n    Returns:\n      self.\n\n    Raises:\n      FstArgError: No SymbolTable specified.\n\n    See also: `decode`, `encode`, `project`, `relabel_pairs`.\n    \"\"\"\n    self._relabel_tables(old_isymbols, new_isymbols,\n                         unknown_isymbol, attach_new_isymbols,\n                         old_osymbols, new_osymbols,\n                         unknown_osymbol, attach_new_osymbols)\n    return self\n\n  cdef void _reserve_arcs(self, int64 state, size_t n) except *:\n    if not self._mfst.get().ReserveArcs(state, n):\n      raise FstIndexError(\"State index out of range\")\n    self._check_mutating_imethod()\n\n  def reserve_arcs(self, int64 state, size_t n):\n    \"\"\"\n    reserve_arcs(self, state, n)\n\n    Reserve n arcs at a particular state (best effort).\n\n    Args:\n      state: The integer index of a state.\n      n: The number of arcs to reserve.\n\n    Returns:\n      self.\n\n    Raises:\n      FstIndexError: State index out of range.\n\n    See also: `reserve_states`.\n    \"\"\"\n    self._reserve_arcs(state, n)\n    return self\n\n  cdef void _reserve_states(self, int64 n) except *:\n    self._mfst.get().ReserveStates(n)\n    self._check_mutating_imethod()\n\n  def reserve_states(self, int64 n):\n    \"\"\"\n    reserve_states(self, n)\n\n    Reserve n states (best effort).\n\n    Args:\n      n: The number of states to reserve.\n\n    Returns:\n      self.\n\n    See also: `reserve_arcs`.\n    \"\"\"\n    self._reserve_states(n)\n    return self\n\n  cdef void _reweight(self, potentials, bool to_final=False) except *:\n    cdef unique_ptr[vector[fst.WeightClass]] _potentials\n    _potentials.reset(new vector[fst.WeightClass]())\n    cdef string weight_type = self.weight_type()\n    for weight in potentials:\n        _potentials.get().push_back(_get_WeightClass_or_One(self.weight_type(),\n                                                            weight))\n    fst.Reweight(self._mfst.get(), deref(_potentials),\n                 fst.GetReweightType(to_final))\n    self._check_mutating_imethod()\n\n  def reweight(self, potentials, bool to_final=False):\n    \"\"\"\n    reweight(self, potentials, to_final=False)\n\n    Reweights an FST using an iterable of potentials.\n\n    This operation destructively reweights an FST according to the potentials\n    and in the direction specified by the user. An arc of weight w, with an\n    origin state of potential p and destination state of potential q, is\n    reweighted by p^{-1} \\otimes (w \\otimes q) when reweighting towards the\n    initial state, and by (p \\otimes w) \\otimes q^{-1} when reweighting towards\n    the final states. The weights must be left distributive when reweighting\n    towards the initial state and right distributive when reweighting towards\n    the final states (e.g., TropicalWeight and LogWeight).\n\n    Args:\n      potentials: An iterable of Weight or weight strings.\n      to_final: Push towards final states?\n\n    Returns:\n      self.\n    \"\"\"\n    self._reweight(potentials, to_final)\n    return self\n\n  cdef void _rmepsilon(self,\n                       queue_type=b\"auto\",\n                       bool connect=True,\n                       weight=None,\n                       int64 nstate=fst.kNoStateId,\n                       float delta=fst.kShortestDelta) except *:\n    cdef fst.WeightClass wc = _get_WeightClass_or_Zero(self.weight_type(),\n                                                       weight)\n    cdef unique_ptr[fst.RmEpsilonOptions] opts\n    opts.reset(new fst.RmEpsilonOptions(_get_queue_type(tostring(queue_type)),\n                                        connect, wc, nstate, delta))\n    fst.RmEpsilon(self._mfst.get(), deref(opts))\n    self._check_mutating_imethod()\n\n  def rmepsilon(self,\n                queue_type=b\"auto\",\n                bool connect=True,\n                weight=None,\n                int64 nstate=fst.kNoStateId,\n                float delta=fst.kShortestDelta):\n    \"\"\"\n    rmepsilon(self, queue_type=\"auto\", connect=True, weight=None,\n              nstate=NO_STATE_ID, delta=1e-6):\n\n    Removes epsilon transitions.\n\n    This operation destructively removes epsilon transitions, i.e., those where\n    both input and output labels are epsilon) from an FST.\n\n    Args:\n      queue_type: A string matching a known queue type; one of: \"auto\", \"fifo\",\n          \"lifo\", \"shortest\", \"state\", \"top\".\n      connect: Should output be trimmed?\n      weight: A Weight or weight string indicating the desired weight threshold\n          below which paths are pruned; if omitted, no paths are pruned.\n      nstate: State number threshold.\n      delta: Comparison/quantization delta.\n\n    Returns:\n      self.\n    \"\"\"\n    self._rmepsilon(queue_type, connect, weight, nstate, delta)\n    return self\n\n  cdef void _set_final(self, int64 state, weight=None) except *:\n    if not self._mfst.get().ValidStateId(state):\n      raise FstIndexError(\"State index out of range\")\n    cdef fst.WeightClass wc = _get_WeightClass_or_One(self.weight_type(),\n                                                      weight)\n    if not self._mfst.get().SetFinal(state, wc):\n      raise FstOpError(\"Incompatible or invalid weight\")\n    self._check_mutating_imethod()\n\n  def set_final(self, int64 state, weight=None):\n    \"\"\"\n    set_final(self, state, weight)\n\n    Sets the final weight for a state.\n\n    Args:\n      state: The integer index of a state.\n      weight: A Weight or weight string indicating the desired final weight; if\n          omitted, it is set to semiring One.\n\n    Returns:\n      self.\n\n    Raises:\n      FstIndexError: State index out of range.\n      FstOpError: Incompatible or invalid weight.\n\n    See also: `set_start`.\n    \"\"\"\n    self._set_final(state, weight)\n    return self\n\n  cdef void _set_input_symbols(self, _SymbolTable syms) except *:\n    if syms is None:\n      self._mfst.get().SetInputSymbols(NULL)\n      return\n    self._mfst.get().SetInputSymbols(syms._table)\n    self._check_mutating_imethod()\n\n  def set_input_symbols(self, _SymbolTable syms):\n    \"\"\"\n    set_input_symbols(self, syms)\n\n    Sets the input symbol table.\n\n    Passing None as a value will delete the input symbol table.\n\n    Args:\n      syms: A SymbolTable.\n\n    Returns:\n      self.\n\n    See also: `set_output_symbols`.\n    \"\"\"\n    self._set_input_symbols(syms)\n    return self\n\n  cdef void _set_output_symbols(self, _SymbolTable syms) except *:\n    if syms is None:\n      self._mfst.get().SetOutputSymbols(NULL)\n      return\n    self._mfst.get().SetOutputSymbols(syms._table)\n    self._check_mutating_imethod()\n\n  def set_output_symbols(self, _SymbolTable syms):\n    \"\"\"\n    set_output_symbols(self, syms)\n\n    Sets the output symbol table.\n\n    Passing None as a value will delete the output symbol table.\n\n    Args:\n      syms: A SymbolTable.\n\n    Returns:\n      self.\n\n    See also: `set_input_symbols`.\n    \"\"\"\n    self._set_output_symbols(syms)\n    return self\n\n  cdef void _set_properties(self, uint64 props, uint64 mask):\n    self._mfst.get().SetProperties(props, mask)\n\n  def set_properties(self, uint64 props, uint64 mask):\n    \"\"\"\n    set_properties(self, props, mask)\n\n    Sets the properties bits.\n\n    Args:\n      props: The properties to be set.\n      mask: A mask to be applied to the `props` argument before setting the\n          FST's properties.\n\n    Returns:\n      self.\n    \"\"\"\n    self._set_properties(props, mask)\n    return self\n\n  cdef void _set_start(self, int64 state) except *:\n    if not self._mfst.get().SetStart(state):\n      raise FstIndexError(\"State index out of range\")\n    self._check_mutating_imethod()\n\n  def set_start(self, int64 state):\n    \"\"\"\n    set_start(self, state)\n\n    Sets a state to be the initial state state.\n\n    Args:\n      state: The integer index of a state.\n\n    Returns:\n      self.\n\n    Raises:\n      FstIndexError: State index out of range.\n\n    See also: `set_final`.\n    \"\"\"\n    self._set_start(state)\n    return self\n\n  cdef void _topsort(self) except *:\n    # TopSort returns False if the FST is cyclic, and thus can't be TopSorted.\n    if not fst.TopSort(self._mfst.get()):\n      logging.warning(\"Cannot topsort cyclic FST.\")\n    self._check_mutating_imethod()\n\n  def topsort(self):\n    \"\"\"\n    topsort(self)\n\n    Sorts transitions by state IDs.\n\n    This operation destructively topologically sorts the FST, if it is acyclic;\n    otherwise it remains unchanged. Once sorted, all transitions are from lower\n    state IDs to higher state IDs\n\n    Returns:\n       self.\n\n    See also: `arcsort`.\n    \"\"\"\n    self._topsort()\n    return self\n\n  cdef void _union(self, _Fst ifst) except *:\n    fst.Union(self._mfst.get(), deref(ifst._fst))\n    self._check_mutating_imethod()\n\n  def union(self, _Fst ifst):\n    \"\"\"\n    union(self, ifst)\n\n    Computes the union (sum) of two FSTs.\n\n    This operation computes the union (sum) of two FSTs. If A transduces string\n    x to y with weight a and B transduces string w to v with weight b, then\n    their union transduces x to y with weight a and w to v with weight b.\n\n    Args:\n      ifst: The second input FST.\n\n    Returns:\n      self.\n    \"\"\"\n    self._union(ifst)\n    return self\n\n\n# Pseudo-constructors for _Fst and _MutableFst.\n#\n# _init_Fst and _init_MutableFst use an FstClass pointer to instantiate _Fst\n# and _MutableFst objects, respectively. The latter function is only safe to\n# call when the FST being wrapped is known to be kMutable. The caller can\n# safely use it when they have either checked this bit (e.g., by using\n# _init_XFst) or have themselves constructed a mutable container for the\n# FstClass pointer they're passing (e.g., most of the constructive operations,\n# storing their results in a VectorFstClass, a derivative of MutableFstClass).\n#\n# _create_Fst constructs an empty VectorFstClass of a user-specified arc type,\n# and passes this pointer to _init_MutableFst.\n#\n# _read_Fst reads an FST from disk, performing FST conversion if requested, and\n# then passes this pointer to _init_XFst.\n#\n# The Python class Fst provides a wrapper for these two operations. The former\n# can be accessed by calling Fst(...), which acts like a class method, and the\n# latter via Fst.read(...), which acts like a static method. This is a bit\n# nasty, but totally hidden from the Python user.\n\n\ncdef _Fst _init_Fst(FstClass_ptr tfst):\n  if tfst.Properties(fst.kError, True):\n    raise FstOpError(\"Operation failed\")\n  cdef _Fst ofst = _Fst.__new__(_Fst)\n  ofst._fst.reset(tfst)\n  return ofst\n\n\ncdef _MutableFst _init_MutableFst(MutableFstClass_ptr tfst):\n  if tfst.Properties(fst.kError, True):\n    raise FstOpError(\"Operation failed\")\n  cdef _MutableFst ofst = _MutableFst.__new__(_MutableFst)\n  ofst._fst.reset(tfst)\n  # Makes a copy of it as the derived type! Cool.\n  ofst._mfst = static_pointer_cast[fst.MutableFstClass, fst.FstClass](ofst._fst)\n  return ofst\n\n\ncdef _Fst _init_XFst(FstClass_ptr tfst):\n  if tfst.Properties(fst.kMutable, True):\n    return _init_MutableFst(static_cast[MutableFstClass_ptr](tfst))\n  else:\n    return _init_Fst(tfst)\n\n\ncdef _MutableFst _create_Fst(arc_type=b\"standard\"):\n  cdef unique_ptr[fst.VectorFstClass] tfst\n  tfst.reset(new fst.VectorFstClass(tostring(arc_type)))\n  if tfst.get() == NULL:\n    raise FstOpError(\"Unknown arc type: {!r}\".format(arc_type))\n  return _init_MutableFst(tfst.release())\n\n\ncpdef _Fst _read(filename):\n  cdef unique_ptr[fst.FstClass] tfst\n  tfst.reset(fst.FstClass.Read(tostring(filename)))\n  if tfst.get() == NULL:\n    raise FstIOError(\"Read failed: {!r}\".format(filename))\n  return _init_XFst(tfst.release())\n\n\ncpdef _Fst _read_from_string(state):\n  cdef stringstream sstrm\n  sstrm << tostring(state)\n  cdef unique_ptr[fst.FstClass] tfst\n  tfst.reset(fst.FstClass.ReadFromStream(sstrm, \"<pywrapfst>\"))\n  if tfst.get() == NULL:\n    raise FstIOError(\"Read failed: <string>\")\n  return _init_XFst(tfst.release())\n\n\nclass Fst(object):\n\n   \"\"\"\n   Fst(arc_type=\"standard\")\n\n   Constructs an empty FST.\n\n   Args:\n     arc_type: A string indicating the arc type.\n\n   Raises:\n     FstError: Unknown arc type.\n\n   Raises:\n     FstOpError: operation failed.\n   \"\"\"\n\n   def __new__(cls, arc_type=b\"standard\"):\n    return _create_Fst(arc_type)\n\n   @staticmethod\n   def read(filename):\n     \"\"\"\n     read(filename):\n\n     Reads an FST from a file.\n\n     Args:\n       filename: The string location of the input file.\n\n     Returns:\n       An FST object.\n\n     Raises:\n       FstIOError: Read failed.\n     \"\"\"\n     return _read(filename)\n\n   @staticmethod\n   def read_from_string(state):\n     \"\"\"\n     read_from_string(string, fst_type=None)\n\n     Reads an FST from a serialized string.\n\n     Args:\n       state: A string containing the serialized FST.\n\n     Returns:\n       An FST object.\n\n     Raises:\n       FstIOError: Read failed.\n       FstOpError: Read-time conversion failed.\n\n     See also: `write_to_string`.\n     \"\"\"\n     return _read_from_string(state)\n\n\n## FST constants.\n\n\nNO_LABEL = fst.kNoLabel\nNO_STATE_ID = fst.kNoStateId\n# TODO(kbg): Figure out how to access static class variables so I don't have\n# to do it this way.\nNO_SYMBOL = kNoSymbol\n\n\n## FST properties.\n\n\nEXPANDED = fst.kExpanded\nMUTABLE = fst.kMutable\nERROR = fst.kError\nACCEPTOR = fst.kAcceptor\nNOT_ACCEPTOR = fst.kNotAcceptor\nI_DETERMINISTIC = fst.kIDeterministic\nNON_I_DETERMINISTIC = fst.kNonIDeterministic\nO_DETERMINISTIC = fst.kODeterministic\nNON_O_DETERMINISTIC = fst.kNonODeterministic\nEPSILONS = fst.kEpsilons\nNO_EPSILONS = fst.kNoEpsilons\nI_EPSILONS = fst.kIEpsilons\nNO_I_EPSILONS = fst.kNoIEpsilons\nO_EPSILONS = fst.kOEpsilons\nNO_O_EPSILONS = fst.kNoOEpsilons\nI_LABEL_SORTED = fst.kILabelSorted\nNOT_I_LABEL_SORTED = fst.kNotILabelSorted\nO_LABEL_SORTED = fst.kOLabelSorted\nNOT_O_LABEL_SORTED = fst.kNotOLabelSorted\nWEIGHTED = fst.kWeighted\nUNWEIGHTED = fst.kUnweighted\nCYCLIC = fst.kCyclic\nACYCLIC = fst.kAcyclic\nINITIAL_CYCLIC = fst.kInitialCyclic\nINITIAL_ACYCLIC = fst.kInitialAcyclic\nTOP_SORTED = fst.kTopSorted\nNOT_TOP_SORTED = fst.kNotTopSorted\nACCESSIBLE = fst.kAccessible\nNOT_ACCESSIBLE = fst.kNotAccessible\nCOACCESSIBLE = fst.kCoAccessible\nNOT_COACCESSIBLE = fst.kNotCoAccessible\nSTRING = fst.kString\nNOT_STRING = fst.kNotString\nWEIGHTED_CYCLES = fst.kWeightedCycles\nUNWEIGHTED_CYCLES = fst.kUnweightedCycles\nNULL_PROPERTIES = fst.kNullProperties\nCOPY_PROPERTIES = fst.kCopyProperties\nINTRINSIC_PROPERTIES = fst.kIntrinsicProperties\nEXTRINSIC_PROPERTIES = fst.kExtrinsicProperties\nSET_START_PROPERTIES = fst.kSetStartProperties\nSET_FINAL_PROPERTIES = fst.kSetFinalProperties\nADD_STATE_PROPERTIES = fst.kAddStateProperties\nADD_ARC_PROPERTIES = fst.kAddArcProperties\nSET_ARC_PROPERTIES = fst.kSetArcProperties\nDELETE_STATE_PROPERTIES = fst.kDeleteStatesProperties\nDELETE_ARC_PROPERTIES = fst.kDeleteArcsProperties\nSTATE_SORT_PROPERTIES = fst.kStateSortProperties\nARC_SORT_PROPERTIES = fst.kArcSortProperties\nI_LABEL_INVARIANT_PROPERTIES = fst.kILabelInvariantProperties\nO_LABEL_INVARIANT_PROPERTIES = fst.kOLabelInvariantProperties\nWEIGHT_INVARIANT_PROPERTIES = fst.kWeightInvariantProperties\nADD_SUPERFINAL_PROPERTIES = fst.kAddSuperFinalProperties\nRM_SUPERFINAL_PROPERTIES = fst.kRmSuperFinalProperties\nBINARY_PROPERTIES = fst.kBinaryProperties\nTRINARY_PROPERTIES = fst.kTrinaryProperties\nPOS_TRINARY_PROPERTIES = fst.kPosTrinaryProperties\nNEG_TRINARY_PROPERTIES = fst.kNegTrinaryProperties\nFST_PROPERTIES = fst.kFstProperties\n\n\n## Arc iterator properties.\n\n\nARC_I_LABEL_VALUE = fst.kArcILabelValue\nARC_O_LABEL_VALUE = fst.kArcOLabelValue\nARC_WEIGHT_VALUE = fst.kArcWeightValue\nARC_NEXT_STATE_VALUE = fst.kArcNextStateValue\nARC_NO_CACHE = fst.kArcNoCache\nARC_VALUE_FLAGS = fst.kArcValueFlags\nARC_FLAGS = fst.kArcFlags\n\n\n## EncodeMapper properties.\n\n\nENCODE_LABELS = fst.kEncodeLabels\nENCODE_WEIGHTS = fst.kEncodeWeights\nENCODE_FLAGS = fst.kEncodeFlags\n\n\n## Arc, ArcIterator, and MutableArcIterator.\n\n\ncdef class Arc(object):\n\n  \"\"\"\n  Arc(ilabel, olabel, weight, nextstate)\n\n  This class represents an arc while remaining agnostic about the underlying arc\n  type.  Attributes of the arc can be accessed or mutated, and the arc can be\n  copied.\n\n  Attributes:\n    ilabel: The input label.\n    olabel: The output label.\n    weight: The arc weight.\n    nextstate: The destination state for the arc.\n  \"\"\"\n\n  def __repr__(self):\n    return \"<Arc at 0x{:x}>\".format(id(self))\n\n  def __init__(self, int64 ilabel, int64 olabel, weight, int64 nextstate):\n    cdef fst.WeightClass wc = _get_WeightClass_or_One(b\"tropical\", weight)\n    self._arc.reset(new fst.ArcClass(ilabel, olabel, wc, nextstate))\n\n  cpdef Arc copy(self):\n    return Arc(self.ilabel, self.olabel, self.weight, self.nextstate)\n\n  property ilabel:\n\n    def __get__(self):\n      return deref(self._arc).ilabel\n\n    def __set__(self, int64 value):\n      deref(self._arc).ilabel = value\n\n  property olabel:\n\n    def __get__(self):\n      return deref(self._arc).olabel\n\n    def __set__(self, int64 value):\n      deref(self._arc).olabel = value\n\n  property weight:\n\n    def __get__(self):\n      cdef Weight weight = Weight.__new__(Weight)\n      weight._weight.reset(new fst.WeightClass(deref(self._arc).weight))\n      return weight\n\n    def __set__(self, weight):\n      deref(self._arc).weight = _get_WeightClass_or_One(b\"tropical\", weight)\n\n  property nextstate:\n\n    def __get__(self):\n      return deref(self._arc).nextstate\n\n    def __set__(self, int64 value):\n      deref(self._arc).nextstate = value\n\n\ncdef Arc _init_Arc(const fst.ArcClass &arc):\n  cdef Weight weight = Weight.__new__(Weight)\n  weight._weight.reset(new fst.WeightClass(arc.weight))\n  return Arc(arc.ilabel, arc.olabel, weight, arc.nextstate)\n\n\ncdef class ArcIterator(object):\n\n  \"\"\"\n  ArcIterator(ifst, state)\n\n  This class is used for iterating over the arcs leaving some state of an FST.\n  \"\"\"\n\n  def __repr__(self):\n    return \"<ArcIterator at 0x{:x}>\".format(id(self))\n\n  def __init__(self, _Fst ifst, int64 state):\n    if not ifst._fst.get().ValidStateId(state):\n      raise FstIndexError(\"State index out of range\")\n    # Makes copy of the shared_ptr, potentially extending the FST's lifetime.\n    self._fst = ifst._fst\n    self._aiter.reset(new fst.ArcIteratorClass(deref(self._fst), state))\n\n  # This just registers this class as a possible iterator.\n  def __iter__(self):\n    return self\n\n  # Magic method used to get a Pythonic API out of the C++ API.\n  def __next__(self):\n    if self.done():\n      raise StopIteration\n    result = self.value()\n    self.next()\n    return result\n\n  cpdef bool done(self):\n    \"\"\"\n    done(self)\n\n    Indicates whether the iterator is exhausted or not.\n\n    Returns:\n      True if the iterator is exhausted, False otherwise.\n    \"\"\"\n    return self._aiter.get().Done()\n\n  cpdef uint32 flags(self):\n    \"\"\"\n    flags(self)\n\n    Returns the current iterator behavioral flags.\n\n    Returns:\n      The current iterator behavioral flags as an integer.\n    \"\"\"\n    return self._aiter.get().Flags()\n\n  cpdef void next(self):\n    \"\"\"\n    next(self)\n\n    Advances the iterator.\n    \"\"\"\n    self._aiter.get().Next()\n\n  cpdef size_t position(self):\n    \"\"\"\n    position(self)\n\n    Returns the position of the iterator.\n\n    Returns:\n      The iterator's position, expressed as an integer.\n    \"\"\"\n    return self._aiter.get().Position()\n\n  cpdef void reset(self):\n    \"\"\"\n    reset(self)\n\n    Resets the iterator to the initial position.\n    \"\"\"\n    self._aiter.get().Reset()\n\n  cpdef void seek(self, size_t a):\n    \"\"\"\n    seek(self, a)\n\n    Advance the iterator to a new position.\n\n    Args:\n      a: The position to seek to.\n    \"\"\"\n    self._aiter.get().Seek(a)\n\n  cpdef void set_flags(self, uint32 flags, uint32 mask):\n    \"\"\"\n    set_flags(self, flags, mask)\n\n    Sets the current iterator behavioral flags.\n\n    Args:\n      flags: The properties to be set.\n      mask: A mask to be applied to the `flags` argument before setting them.\n    \"\"\"\n    self._aiter.get().SetFlags(flags, mask)\n\n  cpdef object value(self):\n    \"\"\"\n    value(self)\n\n    Returns the current arc.\n    \"\"\"\n    return _init_Arc(self._aiter.get().Value())\n\n\ncdef class MutableArcIterator(object):\n\n  \"\"\"\n  MutableArcIterator(ifst, state)\n\n  This class is used for iterating over the arcs leaving some state of an FST,\n  also permitting mutation of the current arc.\n  \"\"\"\n\n  def __repr__(self):\n    return \"<MutableArcIterator at 0x{:x}>\".format(id(self))\n\n  def __init__(self, _MutableFst ifst, int64 state):\n    if not ifst._fst.get().ValidStateId(state):\n      raise FstIndexError(\"State index out of range\")\n    # Makes copy of the shared_ptr, potentially extending the FST's lifetime.\n    self._mfst = ifst._mfst\n    self._aiter.reset(new fst.MutableArcIteratorClass(ifst._mfst.get(), state))\n\n  cpdef bool done(self):\n    \"\"\"\n    done(self)\n\n    Indicates whether the iterator is exhausted or not.\n\n    Returns:\n      True if the iterator is exhausted, False otherwise.\n    \"\"\"\n    return self._aiter.get().Done()\n\n  cpdef uint32 flags(self):\n    \"\"\"\n    flags(self)\n\n    Returns the current iterator behavioral flags.\n\n    Returns:\n      The current iterator behavioral flags as an integer.\n    \"\"\"\n    return self._aiter.get().Flags()\n\n  cpdef void next(self):\n    \"\"\"\n    next(self)\n\n    Advances the iterator.\n    \"\"\"\n    self._aiter.get().Next()\n\n  cpdef size_t position(self):\n    \"\"\"\n    position(self)\n\n    Returns the position of the iterator.\n\n    Returns:\n      The iterator's position, expressed as an integer.\n    \"\"\"\n    return self._aiter.get().Position()\n\n  cpdef void reset(self):\n    \"\"\"\n    reset(self)\n\n    Resets the iterator to the initial position.\n    \"\"\"\n    self._aiter.get().Reset()\n\n  cpdef void seek(self, size_t a):\n    \"\"\"\n    seek(self, a)\n\n    Advance the iterator to a new position.\n\n    Args:\n      a: The position to seek to.\n    \"\"\"\n    self._aiter.get().Seek(a)\n\n  cpdef void set_flags(self, uint32 flags, uint32 mask):\n    \"\"\"\n    set_flags(self, flags, mask)\n\n    Sets the current iterator behavioral flags.\n\n    Args:\n      flags: The properties to be set.\n      mask: A mask to be applied to the `flags` argument before setting them.\n    \"\"\"\n    self._aiter.get().SetFlags(flags, mask)\n\n  cpdef void set_value(self, Arc arc):\n    \"\"\"\n    set_value(self, arc)\n\n    Replace the current arc with a new arc.\n\n    Args:\n      arc: The arc to replace the current arc with.\n    \"\"\"\n    self._aiter.get().SetValue(deref(arc._arc))\n\n  cpdef object value(self):\n    \"\"\"\n    value(self)\n\n    Returns the current arc.\n    \"\"\"\n    return _init_Arc(self._aiter.get().Value())\n\n\n## StateIterator.\n\n\ncdef class StateIterator(object):\n\n  \"\"\"\n  StateIterator(ifst)\n\n  This class is used for iterating over the states in an FST.\n  \"\"\"\n\n  def __repr__(self):\n    return \"<StateIterator at 0x{:x}>\".format(id(self))\n\n  def __init__(self, _Fst ifst):\n    # Makes copy of the shared_ptr, potentially extending the FST's lifetime.\n    self._fst = ifst._fst\n    self._siter.reset(new fst.StateIteratorClass(deref(self._fst)))\n\n  # This just registers this class as a possible iterator.\n  def __iter__(self):\n    return self\n\n  # Magic method used to get a Pythonic API out of the C++ API.\n  def __next__(self):\n    if self.done():\n      raise StopIteration\n    cdef int64 result = self.value()\n    self.next()\n    return result\n\n  cpdef bool done(self):\n    \"\"\"\n    done(self)\n\n    Indicates whether the iterator is exhausted or not.\n\n    Returns:\n      True if the iterator is exhausted, False otherwise.\n    \"\"\"\n    return self._siter.get().Done()\n\n  cpdef void next(self):\n    \"\"\"\n    next(self)\n\n    Advances the iterator.\n    \"\"\"\n    self._siter.get().Next()\n\n  cpdef void reset(self):\n    \"\"\"\n    reset(self)\n\n    Resets the iterator to the initial position.\n    \"\"\"\n    self._siter.get().Reset()\n\n  cpdef int64 value(self):\n    \"\"\"\n    value(self)\n\n    Returns the current state index.\n    \"\"\"\n    return self._siter.get().Value()\n\n\n## FST operations.\n\n\ncdef _Fst _map(_Fst ifst,\n               float delta=fst.kDelta,\n               map_type=b\"identity\",\n               double power=1.,\n               weight=None):\n  cdef fst.MapType map_type_enum\n  if not fst.GetMapType(tostring(map_type), addr(map_type_enum)):\n    raise FstArgError(\"Unknown map type: {!r}\".format(map_type))\n  cdef fst.WeightClass wc = (_get_WeightClass_or_One(ifst.weight_type(),\n      weight) if map_type_enum == fst.TIMES_MAPPER else\n      _get_WeightClass_or_Zero(ifst.weight_type(), weight))\n  return _init_XFst(fst.Map(deref(ifst._fst), map_type_enum, delta, power, wc))\n\n\ncpdef _Fst arcmap(_Fst ifst,\n                  float delta=fst.kDelta,\n                  map_type=b\"identity\",\n                  double power=1.,\n                  weight=None):\n  \"\"\"\n  arcmap(ifst, delta=0.0009765625, map_type=\"identity\", weight=None)\n\n  Constructively applies a transform to all arcs and final states.\n\n  This operation transforms each arc and final state in the input FST using\n  one of the following:\n\n    * identity: maps to self.\n    * input_epsilon: replaces all input labels with epsilon.\n    * invert: reciprocates all non-Zero weights.\n    * float_power: raises all weights to a floating-point power.\n    * output_epsilon: replaces all output labels with epsilon.\n    * quantize: quantizes weights.\n    * plus: adds a constant to all weights.\n    * power: raises all weights to an integral power.\n    * rmweight: replaces all non-Zero weights with 1.\n    * superfinal: redirects final states to a new superfinal state.\n    * times: right-multiplies a constant to all weights.\n    * to_log: converts weights to the log semiring.\n    * to_log64: converts weights to the log64 semiring.\n    * to_standard: converts weights to the tropical (\"standard\") semiring.\n\n  Args:\n    ifst: The input FST.\n    delta: Comparison/quantization delta (ignored unless `map_type` is\n        `quantize`).\n    map_type: A string matching a known mapping operation (see above).\n    power: A positive scalar or integer power; ignored unless `map_type` is\n        `float_power` or `power` (in which case it defaults to 1).\n    weight: A Weight or weight string passed to the arc-mapper; ignored unless\n        `map_type` is `plus` (in which case it defaults to semiring Zero) or\n        `times` (in which case it defaults to semiring One).\n\n  Returns:\n    An FST with arcs and final states remapped.\n\n  Raises:\n    FstArgError: Unknown map type.\n\n  See also: `statemap`.\n  \"\"\"\n  return _map(ifst, delta, map_type, power, weight)\n\n\ncpdef _MutableFst compose(_Fst ifst1,\n                          _Fst ifst2,\n                          compose_filter=b\"auto\",\n                          bool connect=True):\n  \"\"\"\n  compose(ifst1, ifst2, compose_filter=\"auto\", connect=True)\n\n  Constructively composes two FSTs.\n\n  This operation computes the composition of two FSTs. If A transduces string\n  x to y with weight a and B transduces y to z with weight b, then their\n  composition transduces string x to z with weight a \\otimes b. The output\n  labels of the first transducer or the input labels of the second transducer\n  must be sorted (or otherwise support appropriate matchers).\n\n  Args:\n    ifst1: The first input FST.\n    ifst2: The second input FST.\n    compose_filter: A string matching a known composition filter; one of:\n        \"alt_sequence\", \"auto\", \"match\", \"null\", \"sequence\", \"trivial\".\n    connect: Should output be trimmed?\n\n  Returns:\n    An FST.\n\n  See also: `arcsort`.\n  \"\"\"\n  cdef unique_ptr[fst.VectorFstClass] tfst\n  tfst.reset(new fst.VectorFstClass(ifst1.arc_type()))\n  cdef unique_ptr[fst.ComposeOptions] opts\n  opts.reset(new fst.ComposeOptions(connect,\n      _get_compose_filter(tostring(compose_filter))))\n  fst.Compose(deref(ifst1._fst), deref(ifst2._fst), tfst.get(), deref(opts))\n  return _init_MutableFst(tfst.release())\n\n\ncpdef _Fst convert(_Fst ifst, fst_type=b\"\"):\n  \"\"\"\n  convert(ifst, fst_type=\"\")\n\n  Constructively converts an FST to a new internal representation.\n\n  Args:\n    ifst: The input FST.\n    fst_type: A string indicating the FST type to convert to, or an empty string\n        if no conversion is desired.\n\n  Returns:\n    The input FST converted to the desired FST type.\n\n  Raises:\n    FstOpError: Conversion failed.\n  \"\"\"\n  cdef string fst_type_string = tostring(fst_type)\n  cdef unique_ptr[fst.FstClass] tfst\n  tfst.reset(fst.Convert(deref(ifst._fst), fst_type_string))\n  # Script-land Convert returns a null pointer to signal failure.\n  if tfst.get() == NULL:\n    raise FstOpError(\"Conversion to {!r} failed\".format(fst_type))\n  return _init_XFst(tfst.release())\n\n\ncpdef _MutableFst determinize(_Fst ifst,\n                              float delta=fst.kShortestDelta,\n                              det_type=b\"functional\",\n                              int64 nstate=fst.kNoStateId,\n                              int64 subsequential_label=0,\n                              weight=None,\n                              bool increment_subsequential_label=False):\n  \"\"\"\n  determinize(ifst, delta=1e-6, det_type=\"functional\",\n              nstate=NO_STATE_ID, subsequential_label=0, weight=None,\n              incremental_subsequential_label=False)\n\n  Constructively determinizes a weighted FST.\n\n  This operations creates an equivalent FST that has the property that no\n  state has two transitions with the same input label. For this algorithm,\n  epsilon transitions are treated as regular symbols (cf. `rmepsilon`).\n\n  Args:\n    ifst: The input FST.\n    delta: Comparison/quantization delta.\n    det_type: Type of determinization; one of: \"functional\" (input transducer is\n        functional), \"nonfunctional\" (input transducer is not functional) and\n        disambiguate\" (input transducer is not functional but only keep the min\n        of ambiguous outputs).\n    nstate: State number threshold.\n    subsequential_label: Input label of arc corresponding to residual final\n        output when producing a subsequential transducer.\n    weight: A Weight or weight string indicating the desired weight threshold\n        below which paths are pruned; if omitted, no paths are pruned.\n    increment_subsequential_label: Increment subsequential when creating\n        several arcs for the residual final output at a given state.\n\n  Returns:\n    An equivalent deterministic FST.\n\n  Raises:\n    FstArgError: Unknown determinization type.\n\n  See also: `disambiguate`, `rmepsilon`.\n  \"\"\"\n  cdef unique_ptr[fst.VectorFstClass] tfst\n  tfst.reset(new fst.VectorFstClass(ifst.arc_type()))\n  # Threshold is set to semiring Zero (no pruning) if weight unspecified.\n  cdef fst.WeightClass wc = _get_WeightClass_or_Zero(ifst.weight_type(),\n                                                     weight)\n  cdef fst.DeterminizeType determinize_type_enum\n  if not fst.GetDeterminizeType(tostring(det_type),\n                                addr(determinize_type_enum)):\n    raise FstArgError(\"Unknown determinization type: {!r}\".format(det_type))\n  cdef unique_ptr[fst.DeterminizeOptions] opts\n  opts.reset(new fst.DeterminizeOptions(delta, wc, nstate, subsequential_label,\n                                        determinize_type_enum,\n                                        increment_subsequential_label))\n  fst.Determinize(deref(ifst._fst), tfst.get(), deref(opts))\n  return _init_MutableFst(tfst.release())\n\n\ncpdef _MutableFst difference(_Fst ifst1,\n                             _Fst ifst2,\n                             compose_filter=b\"auto\",\n                             bool connect=True):\n  \"\"\"\n  difference(ifst1, ifst2, compose_filter=\"auto\", connect=True)\n\n  Constructively computes the difference of two FSTs.\n\n  This operation computes the difference between two FSAs. Only strings that are\n  in the first automaton but not in second are retained in the result. The first\n  argument must be an acceptor; the second argument must be an unweighted,\n  epsilon-free, deterministic acceptor. The output labels of the first\n  transducer or the input labels of the second transducer must be sorted (or\n  otherwise support appropriate matchers).\n\n  Args:\n    ifst1: The first input FST.\n    ifst2: The second input FST.\n    compose_filter: A string matching a known composition filter; one of:\n        \"alt_sequence\", \"auto\", \"match\", \"null\", \"sequence\", \"trivial\".\n    connect: Should the output FST be trimmed?\n\n  Returns:\n    An FST representing the difference of the FSTs.\n  \"\"\"\n  cdef unique_ptr[fst.VectorFstClass] tfst\n  tfst.reset(new fst.VectorFstClass(ifst1.arc_type()))\n  cdef unique_ptr[fst.ComposeOptions] opts\n  opts.reset(new fst.ComposeOptions(connect, _get_compose_filter(\n      tostring(compose_filter))))\n  fst.Difference(deref(ifst1._fst), deref(ifst2._fst), tfst.get(), deref(opts))\n  return _init_MutableFst(tfst.release())\n\n\ncpdef _MutableFst disambiguate(_Fst ifst,\n                               float delta=fst.kDelta,\n                               int64 nstate=fst.kNoStateId,\n                               int64 subsequential_label=0,\n                               weight=None):\n  \"\"\"\n  disambiguate(ifst, delta=0.0009765625, nstate=NO_STATE_ID,\n               subsequential_label=0, weight=None):\n\n  Constructively disambiguates a weighted transducer.\n\n  This operation disambiguates a weighted transducer. The result will be an\n  equivalent FST that has the property that no two successful paths have the\n  same input labeling. For this algorithm, epsilon transitions are treated as\n  regular symbols (cf. `rmepsilon`).\n\n  Args:\n    ifst: The input FST.\n    delta: Comparison/quantization delta.\n    nstate: State number threshold.\n    subsequential_label: Input label of arc corresponding to residual final\n        output when producing a subsequential transducer.\n    weight: A Weight or weight string indicating the desired weight threshold\n        below which paths are pruned; if omitted, no paths are pruned.\n\n  Returns:\n    An equivalent disambiguated FST.\n\n  See also: `determinize`, `rmepsilon`.\n  \"\"\"\n  cdef unique_ptr[fst.VectorFstClass] tfst\n  tfst.reset(new fst.VectorFstClass(ifst.arc_type()))\n  # Threshold is set to semiring Zero (no pruning) if no weight is specified.\n  cdef fst.WeightClass wc = _get_WeightClass_or_Zero(ifst.weight_type(),\n                                                     weight)\n  cdef unique_ptr[fst.DisambiguateOptions] opts\n  opts.reset(new fst.DisambiguateOptions(delta, wc, nstate,\n                                         subsequential_label))\n  fst.Disambiguate(deref(ifst._fst), tfst.get(), deref(opts))\n  return _init_MutableFst(tfst.release())\n\n\ncpdef _MutableFst epsnormalize(_Fst ifst, bool eps_norm_output=False):\n  \"\"\"\n  epsnormalize(ifst, eps_norm_output=False)\n\n  Constructively epsilon-normalizes an FST.\n\n  This operation creates an equivalent FST that is epsilon-normalized. An\n  acceptor is epsilon-normalized if it it is epsilon-removed (cf. `rmepsilon`).\n  A transducer is input epsilon-normalized if, in addition, along any path, all\n  arcs with epsilon input labels follow all arcs with non-epsilon input labels.\n  Output epsilon-normalized is defined similarly. The input FST must be\n  functional.\n\n  Args:\n    ifst: The input FST.\n    eps_norm_output: Should the FST be output epsilon-normalized?\n\n  Returns:\n    An equivalent epsilon-normalized FST.\n\n  See also: `rmepsilon`.\n  \"\"\"\n  cdef unique_ptr[fst.VectorFstClass] tfst\n  tfst.reset(new fst.VectorFstClass(ifst.arc_type()))\n  fst.EpsNormalize(deref(ifst._fst), tfst.get(), fst.EPS_NORM_OUTPUT if\n                                                 eps_norm_output else\n                                                 fst.EPS_NORM_INPUT)\n  return _init_MutableFst(tfst.release())\n\n\ncpdef bool equal(_Fst ifst1, _Fst ifst2, float delta=fst.kDelta):\n  \"\"\"\n  equal(ifst1, ifst2, delta=0.0009765625)\n\n  Are two FSTs equal?\n\n  This function tests whether two FSTs have the same states with the same\n  numbering and the same transitions with the same labels and weights in the\n  same order.\n\n  Args:\n    ifst1: The first input FST.\n    ifst2: The second input FST.\n    delta: Comparison/quantization delta.\n\n  Returns:\n    True if the FSTs satisfy the above condition, else False.\n\n  See also: `equivalent`, `isomorphic`, `randequivalent`.\n  \"\"\"\n  return fst.Equal(deref(ifst1._fst), deref(ifst2._fst), delta)\n\n\ncpdef bool equivalent(_Fst ifst1, _Fst ifst2, float delta=fst.kDelta) except *:\n  \"\"\"\n  equivalent(ifst1, ifst2, delta=0.0009765625)\n\n  Are the two acceptors equivalent?\n\n  This operation tests whether two epsilon-free deterministic weighted\n  acceptors are equivalent, that is if they accept the same strings with the\n  same weights.\n\n  Args:\n    ifst1: The first input FST.\n    ifst2: The second input FST.\n    delta: Comparison/quantization delta.\n\n  Returns:\n    True if the FSTs satisfy the above condition, else False.\n\n  See also: `equal`, `isomorphic`, `randequivalent`.\n  \"\"\"\n  return fst.Equivalent(deref(ifst1._fst), deref(ifst2._fst), delta)\n\n\ncpdef _MutableFst intersect(_Fst ifst1,\n                            _Fst ifst2,\n                            compose_filter=b\"auto\",\n                            bool connect=True):\n  \"\"\"\n  intersect(ifst1, ifst2, compose_filter=\"auto\", connect=True)\n\n  Constructively intersects two FSTs.\n\n  This operation computes the intersection (Hadamard product) of two FSTs.\n  Only strings that are in both automata are retained in the result. The two\n  arguments must be acceptors. One of the arguments must be label-sorted (or\n  otherwise support appropriate matchers).\n\n  Args:\n    ifst1: The first input FST.\n    ifst2: The second input FST.\n    compose_filter: A string matching a known composition filter; one of:\n        \"alt_sequence\", \"auto\", \"match\", \"null\", \"sequence\", \"trivial\".\n    connect: Should output be trimmed?\n\n  Returns:\n    An intersected FST.\n  \"\"\"\n  cdef unique_ptr[fst.VectorFstClass] tfst\n  tfst.reset(new fst.VectorFstClass(ifst1.arc_type()))\n  cdef unique_ptr[fst.ComposeOptions] opts\n  opts.reset(new fst.ComposeOptions(connect,\n        _get_compose_filter(tostring(compose_filter))))\n  fst.Intersect(deref(ifst1._fst), deref(ifst2._fst), tfst.get(), deref(opts))\n  return _init_MutableFst(tfst.release())\n\n\ncpdef bool isomorphic(_Fst ifst1, _Fst ifst2, float delta=fst.kDelta):\n  \"\"\"\n  isomorphic(ifst1, ifst2, delta=0.0009765625)\n\n  Are the two acceptors isomorphic?\n\n  This operation determines if two transducers with a certain required\n  determinism have the same states, irrespective of numbering, and the same\n  transitions with the same labels and weights, irrespective of ordering. In\n  other words, FSTs A, B are isomorphic if and only if the states of A can be\n  renumbered and the transitions leaving each state reordered so the two are\n  equal (according to the definition given in `equal`).\n\n  Args:\n    ifst1: The first input FST.\n    ifst2: The second input FST.\n    delta: Comparison/quantization delta.\n\n  Returns:\n    True if the two transducers satisfy the above condition, else False.\n\n  See also: `equal`, `equivalent`, `randequivalent`.\n  \"\"\"\n  return fst.Isomorphic(deref(ifst1._fst), deref(ifst2._fst), delta)\n\n\ncpdef _MutableFst prune(_Fst ifst,\n                        float delta=fst.kDelta,\n                        int64 nstate=fst.kNoStateId,\n                        weight=None):\n  \"\"\"\n  prune(ifst, delta=0.0009765625, nstate=NO_STATE_ID, weight=None)\n\n  Constructively removes paths with weights below a certain threshold.\n\n  This operation deletes states and arcs in the input FST that do not belong\n  to a successful path whose weight is no more (w.r.t the natural semiring\n  order) than the threshold t \\otimes-times the weight of the shortest path in\n  the input FST. Weights must be commutative and have the path property.\n\n  Args:\n    ifst: The input FST.\n    delta: Comparison/quantization delta.\n    nstate: State number threshold.\n    weight: A Weight or weight string indicating the desired weight threshold\n        below which paths are pruned; if omitted, no paths are pruned.\n\n  Returns:\n    A pruned FST.\n\n  See also: The destructive variant.\n  \"\"\"\n  cdef unique_ptr[fst.VectorFstClass] tfst\n  tfst.reset(new fst.VectorFstClass(ifst.arc_type()))\n  cdef fst.WeightClass wc = _get_WeightClass_or_Zero(ifst.weight_type(), weight)\n  fst.Prune(deref(ifst._fst), tfst.get(), wc, nstate, delta)\n  return _init_MutableFst(tfst.release())\n\n\ncpdef _MutableFst push(_Fst ifst,\n                       float delta=fst.kDelta,\n                       bool push_weights=False,\n                       bool push_labels=False,\n                       bool remove_common_affix=False,\n                       bool remove_total_weight=False,\n                       bool to_final=False):\n  \"\"\"\n  push(ifst, delta=0.0009765625, push_weights=False, push_labels=False,\n       remove_common_affix=False, remove_total_weight=False, to_final=False)\n\n  Constructively pushes weights/labels towards initial or final states.\n\n  This operation produces an equivalent transducer by pushing the weights\n  and/or the labels towards the initial state or toward the final states.\n\n  When pushing weights towards the initial state, the sum of the weight of the\n  outgoing transitions and final weight at any non-initial state is equal to 1\n  in the resulting machine. When pushing weights towards the final states, the\n  sum of the weight of the incoming transitions at any state is equal to 1.\n  Weights need to be left distributive when pushing towards the initial state\n  and right distributive when pushing towards the final states.\n\n  Pushing labels towards the initial state consists in minimizing at every\n  state the length of the longest common prefix of the output labels of the\n  outgoing paths. Pushing labels towards the final states consists in\n  minimizing at every state the length of the longest common suffix of the\n  output labels of the incoming paths.\n\n  Args:\n    ifst: The input FST.\n    delta: Comparison/quantization delta.\n    push_weights: Should weights be pushed?\n    push_labels: Should labels be pushed?\n    remove_common_affix: If pushing labels, should common prefix/suffix be\n        removed?\n    remove_total_weight: If pushing weights, should total weight be removed?\n    to_final: Push towards final states?\n\n  Returns:\n    An equivalent pushed FST.\n\n  See also: The destructive variant.\n  \"\"\"\n  # This is copied, almost verbatim, from ./fstpush.cc.\n  cdef unique_ptr[fst.VectorFstClass] tfst\n  tfst.reset(new fst.VectorFstClass(ifst.arc_type()))\n  cdef uint32 flags = fst.GetPushFlags(push_weights, push_labels,\n                                       remove_common_affix, remove_total_weight)\n  fst.Push(deref(ifst._fst), tfst.get(), flags, fst.GetReweightType(to_final),\n           delta)\n  return _init_MutableFst(tfst.release())\n\n\ncpdef bool randequivalent(_Fst ifst1,\n                          _Fst ifst2,\n                          int32 npath=1,\n                          float delta=fst.kDelta,\n                          time_t seed=0,\n                          select=b\"uniform\",\n                          int32 max_length=INT32_MAX) except *:\n  \"\"\"\n  randequivalent(ifst1, ifst2, npath=1, delta=0.0009765625, seed=0,\n                 select=\"uniform\", max_length=2147483647)\n\n  Are two acceptors stochastically equivalent?\n\n  This operation tests whether two FSTs are equivalent by randomly generating\n  paths alternatively in each of the two FSTs. For each randomly generated path,\n  the algorithm computes for each of the two FSTs the sum of the weights of all\n  the successful paths sharing the same input and output labels as the randomly\n  generated path and checks that these two values are within `delta`.\n\n  Args:\n    ifst1: The first input FST.\n    ifst2: The second input FST.\n    npath: The number of random paths to generate.\n    delta: Comparison/quantization delta.\n    seed: An optional seed value for random path generation; if zero, the\n        current time and process ID is used.\n    select: A string matching a known random arc selection type; one of:\n        \"uniform\", \"log_prob\", \"fast_log_prob\".\n    max_length: The maximum length of each random path.\n\n  Returns:\n    True if the two transducers satisfy the above condition, else False.\n\n  See also: `equal`, `equivalent`, `isomorphic`, `randgen`.\n  \"\"\"\n  cdef fst.RandArcSelection ras = _get_rand_arc_selection(tostring(select))\n  cdef unique_ptr[fst.RandGenOptions[fst.RandArcSelection]] opts\n  # The three trailing options will be ignored by RandEquivalent.\n  opts.reset(new fst.RandGenOptions[fst.RandArcSelection](ras, max_length,\n                                                          1, False, False))\n  if seed == 0:\n    seed = time(NULL) + getpid()\n  return fst.RandEquivalent(deref(ifst1._fst), deref(ifst2._fst), npath, delta,\n                           seed, deref(opts))\n\n\ncpdef _MutableFst randgen(_Fst ifst,\n                          int32 npath=1,\n                          time_t seed=0,\n                          select=b\"uniform\",\n                          int32 max_length=INT32_MAX,\n                          bool weighted=False,\n                          bool remove_total_weight=False):\n  \"\"\"\n  randgen(ifst, npath=1, seed=0, select=\"uniform\", max_length=2147483647,\n          weight=False, remove_total_weight=False)\n\n  Randomly generate successful paths in an FST.\n\n  This operation randomly generates a set of successful paths in the input FST.\n  This relies on a mechanism for selecting arcs, specified using the `select`\n  argument. The default selector, \"uniform\", randomly selects a transition\n  using a uniform distribution. The \"log_prob\" selector randomly selects a\n  transition w.r.t. the weights treated as negative log probabilities after\n  normalizing for the total weight leaving the state. In all cases, finality is\n  treated as a transition to a super-final state.\n\n  Args:\n    ifst: The input FST.\n    npath: The number of random paths to generate.\n    seed: An optional seed value for random path generation; if zero, the\n        current time and process ID is used.\n    select: A string matching a known random arc selection type; one of:\n        \"uniform\", \"log_prob\", \"fast_log_prob\".\n    max_length: The maximum length of each random path.\n    weighted: Should the output be weighted by path count?\n    remove_total_weight: Should the total weight be removed (ignored when\n        `weighted` is False)?\n\n  Returns:\n    An FST containing one or more random paths.\n\n  See also: `randequivalent`.\n  \"\"\"\n  cdef fst.RandArcSelection ras = _get_rand_arc_selection(tostring(select))\n  cdef unique_ptr[fst.RandGenOptions[fst.RandArcSelection]] opts\n  opts.reset(new fst.RandGenOptions[fst.RandArcSelection](ras, max_length,\n                                                          npath, weighted,\n                                                          remove_total_weight))\n  cdef unique_ptr[fst.VectorFstClass] tfst\n  tfst.reset(new fst.VectorFstClass(ifst.arc_type()))\n  if seed == 0:\n    seed = time(NULL) + getpid()\n  fst.RandGen(deref(ifst._fst), tfst.get(), seed, deref(opts))\n  return _init_MutableFst(tfst.release())\n\n\ncpdef _MutableFst replace(pairs,\n                          call_arc_labeling=b\"input\",\n                          return_arc_labeling=b\"neither\",\n                          bool epsilon_on_replace=False,\n                          int64 return_label=0):\n  \"\"\"\n  replace(pairs, call_arc_labeling=\"input\", return_arc_labeling=\"neither\",\n          epsilon_on_replace=False, return_label=0)\n\n  Recursively replaces arcs in the FST with other FST(s).\n\n  This operation performs the dynamic replacement of arcs in one FST with\n  another FST, allowing the definition of FSTs analogous to RTNs. It takes as\n  input a set of pairs of a set of pairs formed by a non-terminal label and\n  its corresponding FST, and a label identifying the root FST in that set.\n  The resulting FST is obtained by taking the root FST and recursively replacing\n  each arc having a nonterminal as output label by its corresponding FST. More\n  precisely, an arc from state s to state d with (nonterminal) output label n in\n  this FST is replaced by redirecting this \"call\" arc to the initial state of a\n  copy F of the FST for n, and adding \"return\" arcs from each final state of F\n  to d. Optional arguments control how the call and return arcs are labeled; by\n  default, the only non-epsilon label is placed on the call arc.\n\n  Args:\n\n    pairs: An iterable of (nonterminal label, FST) pairs, where the former is an\n        unsigned integer and the latter is an Fst instance.\n    call_arc_labeling: A string indicating which call arc labels should be\n        non-epsilon. One of: \"input\" (default), \"output\", \"both\", \"neither\".\n        This value is set to \"neither\" if epsilon_on_replace is True.\n    return_arc_labeling: A string indicating which return arc labels should be\n        non-epsilon. One of: \"input\", \"output\", \"both\", \"neither\" (default).\n        This value is set to \"neither\" if epsilon_on_replace is True.\n    epsilon_on_replace: Should call and return arcs be epsilon arcs? If True,\n        this effectively overrides call_arc_labeling and return_arc_labeling,\n        setting both to \"neither\".\n    return_label: The integer label for return arcs.\n\n  Returns:\n    An FST resulting from expanding the input RTN.\n  \"\"\"\n  cdef vector[fst.LabelFstClassPair] _pairs\n  cdef int64 root_label\n  cdef int64 label\n  cdef _Fst ifst\n  it = iter(pairs)\n  (root_label, ifst) = next(it)\n  _pairs.push_back(fst.LabelFstClassPair(root_label, ifst._fst.get()))\n  cdef unique_ptr[fst.VectorFstClass] tfst\n  tfst.reset(new fst.VectorFstClass(ifst.arc_type()))\n  for (label, ifst) in it:\n    _pairs.push_back(fst.LabelFstClassPair(label, ifst._fst.get()))\n  cdef fst.ReplaceLabelType cal = _get_replace_label_type(\n      tostring(call_arc_labeling), epsilon_on_replace)\n  cdef fst.ReplaceLabelType ral = _get_replace_label_type(\n      tostring(return_arc_labeling), epsilon_on_replace)\n  cdef unique_ptr[fst.ReplaceOptions] opts\n  opts.reset(new fst.ReplaceOptions(root_label, cal, ral, return_label))\n  fst.Replace(_pairs, tfst.get(), deref(opts))\n  return _init_MutableFst(tfst.release())\n\n\ncpdef _MutableFst reverse(_Fst ifst, bool require_superinitial=True):\n  \"\"\"\n  reverse(ifst, require_superinitial=True)\n\n  Constructively reverses an FST's transduction.\n\n  This operation reverses an FST. If A transduces string x to y with weight a,\n  then the reverse of A transduces the reverse of x to the reverse of y with\n  weight a.Reverse(). (Typically, a = a.Reverse() and Arc = RevArc, e.g.,\n  TropicalWeight and LogWeight.) In general, e.g., when the weights only form a\n  left or right semiring, the output arc type must match the input arc type.\n\n  Args:\n    ifst: The input FST.\n    require_superinitial: Should a superinitial state be created?\n\n  Returns:\n    A reversed FST.\n  \"\"\"\n  cdef unique_ptr[fst.VectorFstClass] tfst\n  tfst.reset(new fst.VectorFstClass(ifst.arc_type()))\n  fst.Reverse(deref(ifst._fst), tfst.get(), require_superinitial)\n  return _init_MutableFst(tfst.release())\n\n\n# Pure C++ helper for shortestdistance.\n\n\ncdef vector[fst.WeightClass] *_shortestdistance(_Fst ifst,\n                                                float delta=fst.kShortestDelta,\n                                                int64 nstate=fst.kNoStateId,\n                                                queue_type=b\"auto\",\n                                                bool reverse=False) except *:\n  cdef unique_ptr[vector[fst.WeightClass]] distance\n  distance.reset(new vector[fst.WeightClass]())\n  # For scoping reasons, these have to be declared here even though they may\n  # not be used in all cases.\n  cdef unique_ptr[fst.ShortestDistanceOptions] opts\n  if reverse:\n    # Only the simpler signature supports shortest distance to final states;\n    # `nstate` and `queue_type` arguments are ignored.\n    fst.ShortestDistance(deref(ifst._fst), distance.get(), True, delta)\n  else:\n    opts.reset(new fst.ShortestDistanceOptions(\n        _get_queue_type(tostring(queue_type)), fst.ANY_ARC_FILTER, nstate,\n        delta))\n    fst.ShortestDistance(deref(ifst._fst), distance.get(), deref(opts))\n  return distance.release()\n\n\ndef shortestdistance(_Fst ifst,\n                     float delta=fst.kShortestDelta,\n                     int64 nstate=fst.kNoStateId,\n                     queue_type=b\"auto\",\n                     bool reverse=False):\n  \"\"\"\n  shortestdistance(ifst, delta=1e-6, nstate=NO_STATE_ID,\n                   queue_type=\"auto\", reverse=False)\n\n  Compute the shortest distance from the initial or final state.\n\n  This operation computes the shortest distance from the initial state (when\n  `reverse` is False) or from every state to the final state (when `reverse` is\n  True). The shortest distance from p to q is the \\otimes-sum of the weights of\n  all the paths between p and q. The weights must be right (if `reverse` is\n  False) or left (if `reverse` is True) distributive, and k-closed (i.e., 1\n  \\otimes x \\otimes x^2 \\otimes ... \\otimes x^{k + 1} = 1 \\otimes x \\otimes x^2\n  \\otimes ... \\otimes x^k; e.g., TropicalWeight).\n\n  Args:\n    ifst: The input FST.\n    delta: Comparison/quantization delta.\n    nstate: State number threshold (ignored if `reverse` is True).\n    queue_type: A string matching a known queue type; one of: \"auto\", \"fifo\",\n        \"lifo\", \"shortest\", \"state\", \"top\" (ignored if `reverse` is True).\n    reverse: Should the reverse distance (from each state to the final state)\n        be computed?\n\n  Returns:\n    A list of Weight objects representing the shortest distance for each state.\n  \"\"\"\n  cdef unique_ptr[vector[fst.WeightClass]] distance\n  distance.reset(_shortestdistance(ifst, delta, nstate, queue_type, reverse))\n  cdef string weight_type = ifst.weight_type()\n  return [Weight(weight_type, weight.ToString()) for weight in deref(distance)]\n\n\ncpdef _MutableFst shortestpath(_Fst ifst,\n                               float delta=fst.kShortestDelta,\n                               int32 nshortest=1,\n                               int64 nstate=fst.kNoStateId,\n                               queue_type=b\"auto\",\n                               bool unique=False,\n                               weight=None):\n  \"\"\"\n  shortestpath(ifst, delta=1e-6, nshortest=1, nstate=NO_STATE_ID,\n               queue_type=\"auto\", unique=False, weight=None)\n\n  Construct an FST containing the shortest path(s) in the input FST.\n\n  This operation produces an FST containing the n-shortest paths in the input\n  FST. The n-shortest paths are the n-lowest weight paths w.r.t. the natural\n  semiring order. The single path that can be read from the ith of at most n\n  transitions leaving the initial state of the resulting FST is the ith\n  shortest path. The weights need to be right distributive and have the path\n  property. They also need to be left distributive as well for n-shortest with\n  n > 1 (e.g., TropicalWeight).\n\n  Args:\n    ifst: The input FST.\n    delta: Comparison/quantization delta.\n    nshortest: The number of paths to return.\n    nstate: State number threshold.\n    queue_type: A string matching a known queue type; one of: \"auto\", \"fifo\",\n        \"lifo\", \"shortest\", \"state\", \"top\".\n    unique: Should the resulting FST only contain distinct paths? (Requires\n        the input FST to be an acceptor; epsilons are treated as if they are\n        regular symbols.)\n    weight: A Weight or weight string indicating the desired weight threshold\n        below which paths are pruned; if omitted, no paths are pruned.\n\n  Returns:\n    An FST containing the n-shortest paths.\n  \"\"\"\n  cdef unique_ptr[fst.VectorFstClass] tfst\n  tfst.reset(new fst.VectorFstClass(ifst.arc_type()))\n  # Threshold is set to semiring Zero (no pruning) if no weight is specified.\n  cdef fst.WeightClass wc = _get_WeightClass_or_Zero(ifst.weight_type(), weight)\n  cdef unique_ptr[fst.ShortestPathOptions] opts\n  opts.reset(new fst.ShortestPathOptions(_get_queue_type(tostring(queue_type)),\n                                         nshortest, unique, delta, wc, nstate))\n  fst.ShortestPath(deref(ifst._fst), tfst.get(), deref(opts))\n  return _init_MutableFst(tfst.release())\n\n\ncpdef _Fst statemap(_Fst ifst, map_type):\n  \"\"\"\n  state_map(ifst, map_type)\n\n  Constructively applies a transform to all states.\n\n  This operation transforms each state according to the requested map type.\n  Note that currently, only one state-mapping operation is supported.\n\n  Args:\n    ifst: The input FST.\n    map_type: A string matching a known mapping operation; one of: \"arc_sum\"\n        (sum weights of identically-labeled multi-arcs), \"arc_unique\" (deletes\n        non-unique identically-labeled multi-arcs).\n\n  Returns:\n    An FST with states remapped.\n\n  Raises:\n    FstArgError: Unknown map type.\n\n  See also: `arcmap`.\n  \"\"\"\n  return _map(ifst, fst.kDelta, map_type, 1., None)\n\n\ncpdef _MutableFst synchronize(_Fst ifst):\n  \"\"\"\n  synchronize(ifst)\n\n  Constructively synchronizes an FST.\n\n  This operation synchronizes a transducer. The result will be an equivalent\n  FST that has the property that during the traversal of a path, the delay is\n  either zero or strictly increasing, where the delay is the difference between\n  the number of non-epsilon output labels and input labels along the path. For\n  the algorithm to terminate, the input transducer must have bounded delay,\n  i.e., the delay of every cycle must be zero.\n\n  Args:\n    ifst: The input FST.\n\n  Returns:\n    An equivalent synchronized FST.\n  \"\"\"\n  cdef unique_ptr[fst.VectorFstClass] tfst\n  tfst.reset(new fst.VectorFstClass(ifst.arc_type()))\n  fst.Synchronize(deref(ifst._fst), tfst.get())\n  return _init_MutableFst(tfst.release())\n\n\n## Compiler.\n\n\ncdef class Compiler(object):\n\n  \"\"\"\n  Compiler(fst_type=\"vector\", arc_type=\"standard\", isymbols=None,\n           osymbols=None, ssymbols=None, acceptor=False, keep_isymbols=False,\n           keep_osymbols=False, keep_state_numbering=False,\n           allow_negative_labels=False)\n\n  Class used to compile FSTs from strings.\n\n  This class is used to compile FSTs specified using the AT&T FSM library\n  format described here:\n\n  http://web.eecs.umich.edu/~radev/NLP-fall2015/resources/fsm_archive/fsm.5.html\n\n  This is the same format used by the `fstcompile` executable.\n\n  Compiler options (symbol tables, etc.) are set at construction time.\n\n      compiler = fst.Compiler(isymbols=ascii_syms, osymbols=ascii_syms)\n\n  Once constructed, Compiler instances behave like a file handle opened for\n  writing:\n\n      # /ba+/\n      compiler.write(\"0 1 50 50\")\n      compiler.write(\"1 2 49 49\")\n      compiler.write(\"2 2 49 49\")\n      compiler.write(\"2\")\n\n  The `compile` method returns an actual FST instance:\n\n      sheep_machine = compiler.compile()\n\n  Compilation flushes the internal buffer, so the compiler instance can be\n  reused to compile new machines with the same symbol tables (etc.)\n\n  Args:\n    fst_type: A string indicating the container type for the compiled FST.\n    arc_type: A string indicating the arc type for the compiled FST.\n    isymbols: An optional SymbolTable used to label input symbols.\n    osymbols: An optional SymbolTable used to label output symbols.\n    ssymbols: An optional SymbolTable used to label states.\n    acceptor: Should the FST be rendered in acceptor format if possible?\n    keep_isymbols: Should the input symbol table be stored in the FST?\n    keep_osymbols: Should the output symbol table be stored in the FST?\n    keep_state_numbering: Should the state numbering be preserved?\n    allow_negative_labels: Should negative labels be allowed? (Not\n        recommended; may cause conflicts).\n  \"\"\"\n\n  def __cinit__(self,\n                string fst_type=b\"vector\",\n                string arc_type=b\"standard\",\n                SymbolTable isymbols=None,\n                SymbolTable osymbols=None,\n                SymbolTable ssymbols=None,\n                bool acceptor=False,\n                bool keep_isymbols=False,\n                bool keep_osymbols=False,\n                bool keep_state_numbering=False,\n                bool allow_negative_labels=False):\n    self._sstrm.reset(new stringstream())\n    self._fst_type = tostring(fst_type)\n    self._arc_type = tostring(arc_type)\n    self._isymbols = NULL\n    if isymbols is not None:\n      self._isymbols = isymbols._table\n    self._osymbols = NULL\n    if osymbols is not None:\n      self._osymbols = osymbols._table\n    self._ssymbols = NULL\n    if ssymbols is not None:\n      self._ssymbols = ssymbols._table\n    self._acceptor = acceptor\n    self._keep_isymbols = keep_isymbols\n    self._keep_osymbols = keep_osymbols\n    self._keep_state_numbering = keep_state_numbering\n    self._allow_negative_labels = allow_negative_labels\n\n  cpdef _Fst compile(self):\n    \"\"\"\n    compile()\n\n    Compiles the FST in the compiler string buffer.\n\n    This method compiles the FST and returns the resulting machine.\n\n    Returns:\n      The FST described by the compiler string buffer.\n\n    Raises:\n      FstOpError: Compilation failed.\n    \"\"\"\n    cdef unique_ptr[fst.FstClass] tfst\n    tfst.reset(fst.CompileFstInternal(deref(self._sstrm),\n        \"<pywrapfst>\", self._fst_type, self._arc_type, self._isymbols,\n        self._osymbols, self._ssymbols, self._acceptor, self._keep_isymbols,\n        self._keep_osymbols, self._keep_state_numbering,\n        self._allow_negative_labels))\n    self._sstrm.reset(new stringstream())\n    if tfst.get() == NULL:\n      raise FstOpError(\"Compilation failed\")\n    return _init_XFst(tfst.release())\n\n  cpdef void write(self, expression):\n    \"\"\"\n    write(expression)\n\n    Writes a string into the compiler string buffer.\n\n    This method adds a line to the compiler string buffer. It is normally\n    invoked using the right shift operator, like so:\n\n        compiler = fst.Compiler()\n        compiler.write(\"0 0 49 49\")\n        compiler.write(\"0\")\n\n    Args:\n      expression: A string expression to add to compiler string buffer.\n    \"\"\"\n    deref(self._sstrm) << tostring(expression)\n\n\n## FarReader and FarWriter.\n\n\ncdef class FarReader(object):\n\n  \"\"\"\n  (No constructor.)\n\n  FAR (\"Fst ARchive\") reader object.\n\n  This class is used to read a FAR from disk. FARs contain one or more FSTs (of\n  the same arc type) indexed by a unique string key. To construct a FarReader\n  object, use the `open` class method.\n\n  Attributes:\n    arc_type: A string indicating the arc type.\n    far_type: A string indicating the FAR type.\n  \"\"\"\n\n  def __init__(self):\n    raise FstDeletedConstructorError(\n        \"Cannot construct {}\".format(self.__class__.__name__))\n\n  def __repr__(self):\n    return \"<{} FarReader at 0x{:x}>\".format(self.far_type(), id(self))\n\n  @classmethod\n  def open(cls, *filenames):\n    \"\"\"\n    FarReader.open(*filenames)\n\n    Creates a FarReader object.\n\n    This class method creates a FarReader given the string location of one or\n    more FAR files on disk.\n\n    Args:\n      *filenames: The string location of one or more input FAR files.\n\n    Returns:\n      A new FarReader instance.\n\n    Raises:\n      FstIOError: Read failed.\n    \"\"\"\n    cdef vector[string] filename_strings\n    for filename in filenames:\n      filename_strings.push_back(tostring(filename))\n    cdef unique_ptr[fst.FarReaderClass] tfar\n    tfar.reset(fst.FarReaderClass.Open(filename_strings))\n    if tfar.get() == NULL:\n      raise FstIOError(\"Read failed: {!r}\".format(filenames))\n    cdef FarReader result = FarReader.__new__(FarReader)\n    result._reader.reset(tfar.release())\n    return result\n\n  cpdef string arc_type(self):\n    \"\"\"\n    arc_type(self)\n\n    Returns a string indicating the arc type.\n    \"\"\"\n    return self._reader.get().ArcType()\n\n  cpdef bool done(self):\n    \"\"\"\n    done(self)\n\n    Indicates whether the iterator is exhausted or not.\n\n    Returns:\n      True if the iterator is exhausted, False otherwise.\n    \"\"\"\n    return self._reader.get().Done()\n\n  cpdef bool error(self):\n    \"\"\"\n    error(self)\n\n    Indicates whether the FarReader has encountered an error.\n\n    Returns:\n      True if the FarReader is in an errorful state, False otherwise.\n    \"\"\"\n    return self._reader.get().Error()\n\n  cpdef string far_type(self):\n    return fst.GetFarTypeString(self._reader.get().Type())\n\n  cpdef bool find(self, key) except *:\n    \"\"\"\n    find(self, key)\n\n    Sets the current position to the first entry greater than or equal to the\n    key (a string) and indicates whether or not a match was found.\n\n    Args:\n      key: A string key.\n\n    Returns:\n      True if the key was found, False otherwise.\n    \"\"\"\n    return self._reader.get().Find(tostring(key))\n\n  cpdef _Fst get_fst(self):\n    \"\"\"\n    get_fst(self)\n\n    Returns the FST at the current position.\n\n    Returns:\n      A copy of the FST at the current position.\n    \"\"\"\n    return _init_XFst(new fst.FstClass(\n        deref(self._reader.get().GetFstClass())))\n\n  cpdef string get_key(self):\n    \"\"\"\n    get_key(self)\n\n    Returns the string key at the current position.\n\n    Returns:\n      The string key at the current position.\n    \"\"\"\n    return self._reader.get().GetKey()\n\n  cpdef void next(self):\n    \"\"\"\n    next(self)\n\n    Advances the iterator.\n    \"\"\"\n    self._reader.get().Next()\n\n  cpdef void reset(self):\n    \"\"\"\n    reset(self)\n\n    Resets the iterator to the initial position.\n    \"\"\"\n    self._reader.get().Reset()\n\n  def __getitem__(self, key):\n    if self._reader.get().Find(tostring(key)):\n      return self.get_fst()\n    else:\n      raise KeyError(key)\n\n\ncdef class FarWriter(object):\n\n  \"\"\"\n  (No constructor.)\n\n  FAR (\"Fst ARchive\") writer object.\n\n  This class is used to write FSTs (of the same arc type) to a FAR on disk. To\n  construct a FarWriter, use the `create` class method.\n\n  Note that the data is not guaranteed to flush to disk until the FarWriter\n  is garbage-collected. If a FarWriter has been assigned to only one variable,\n  then calling `del` on that variable should decrement the object's reference\n  count from 1 to 0, triggering a flush to disk on the next GC cycle.\n\n  Attributes:\n    arc_type: A string indicating the arc type.\n    far_type: A string indicating the FAR type.\n  \"\"\"\n\n  def __init__(self):\n    raise FstDeletedConstructorError(\n        \"Cannot construct {}\".format(self.__class__.__name__))\n\n  def __repr__(self):\n    return \"<{} FarWriter at 0x{:x}>\".format(self.far_type(), id(self))\n\n  @classmethod\n  def create(cls, filename, arc_type=b\"standard\", far_type=b\"default\"):\n    \"\"\"\n    FarWriter.\n\n    Creates a FarWriter object.\n\n    This class method creates a FarWriter given the desired output location,\n    arc type, and FAR type.\n\n    Args:\n      filename: The string location for the output FAR files.\n      arc_type: A string indicating the arc type.\n      far_type: A string indicating the FAR type; one of: \"fst\", \"stlist\",\n          \"sttable\", \"sstable\", \"default\".\n\n    Returns:\n      A new FarWriter instance.\n\n    Raises:\n      FstIOError: Read failed.\n    \"\"\"\n    cdef fst.FarType ft = fst.GetFarType(tostring(far_type))\n    cdef fst.FarWriterClass *tfar = fst.FarWriterClass.Create(\n        tostring(filename), tostring(arc_type), ft)\n    if tfar == NULL:\n      raise FstIOError(\"Open failed: {!r}\".format(filename))\n    cdef FarWriter result = FarWriter.__new__(FarWriter)\n    result._writer.reset(tfar)\n    return result\n\n  # NB: Invoking this method may be dangerous: calling any other method on the\n  # instance after this is invoked may result in a null dereference.\n  cdef void close(self):\n    self._writer.reset()\n\n  cpdef void add(self, key, _Fst ifst) except *:\n    \"\"\"\n    add(self, key, ifst)\n\n    Adds an FST to the FAR.\n\n    This method adds an FST to the FAR which can be retrieved with the\n    specified string key.\n\n    Args:\n      key: The string used to key the input FST.\n      ifst: The FST to write to the FAR.\n\n    Raises:\n      FstArgError: Key out of order.\n      FstOpError: Incompatible or invalid arc type.\n    \"\"\"\n    # Failure here results from passing an FST with a different arc type than\n    # used by the FAR was initialized to use.\n    if not self._writer.get().Add(tostring(key), deref(ifst._fst)):\n      raise FstOpError(\"Incompatible or invalid arc type\")\n    # An error here usually indicates a key out of order.\n    if self._writer.get().Error():\n      raise FstArgError(\"Key out of order\")\n\n  cpdef string arc_type(self):\n    \"\"\"\n    arc_type(self)\n\n    Returns a string indicating the arc type.\n    \"\"\"\n    return self._writer.get().ArcType()\n\n  cpdef bool error(self):\n    \"\"\"\n    error(self)\n\n    Indicates whether the FarWriter has encountered an error.\n\n    Returns:\n      True if the FarWriter is in an errorful state, False otherwise.\n    \"\"\"\n    return self._writer.get().Error()\n\n  cpdef string far_type(self):\n    \"\"\"\n    far_type(self)\n\n    Returns a string indicating the FAR type.\n    \"\"\"\n    return fst.GetFarTypeString(self._writer.get().Type())\n\n  # Dictionary-like assignment.\n  def __setitem__(self, key, _Fst fst):\n    self.add(key, fst)\n\n\n## Cleanup operations for module entrance and exit.\n\n\n# Masks fst_error_fatal flags while this module is running, returning to the\n# previous state upon module exit.\n\n\ncdef bool _fst_error_fatal_old = fst.FLAGS_fst_error_fatal\nfst.FLAGS_fst_error_fatal = False\n\n\n@atexit.register\ndef _reset_fst_error_fatal():\n  fst.FLAGS_fst_error_fatal = _fst_error_fatal_old\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/extensions/special/CMakeLists.txt",
    "content": "file(GLOB HEADER_FILES ../../include/fst/extensions/special/*.h)\nmessage(STATUS \"${HEADER_FILES}\")\n\nif(HAVE_BIN)\n  add_executable(fstspecial-bin\n    ../../bin/fstconvert.cc \n    ../../bin/fstconvert-main.cc\n    phi-fst.cc\n    rho-fst.cc\n    sigma-fst.cc\n  )\n\n  set_target_properties(fstspecial-bin PROPERTIES \n    FOLDER special/bin\n    OUTPUT_NAME fstspecial\n  )\n\n  target_link_libraries(fstspecial-bin\n    fstscript\n    fst\n    ${CMAKE_DL_LIBS}\n )\nendif(HAVE_BIN)\n\n\nadd_library(fstspecial\n  phi-fst.cc\n  rho-fst.cc\n  sigma-fst.cc\n  ${HEADER_FILES}\n)\n\nset_target_properties(fstspecial PROPERTIES\n  SOVERSION \"${SOVERSION}\"\n  FOLDER special\n)\ntarget_link_libraries(fstspecial\n  fst\n)\n\ninstall(TARGETS fstspecial fstspecial-bin\n  LIBRARY DESTINATION lib\n  RUNTIME DESTINATION bin\n  ARCHIVE DESTINATION lib\n)\n\nfunction (add_module _name)\n    add_library(${ARGV})\n    if (TARGET ${_name})\n        target_link_libraries(${_name} fst)\n        set_target_properties(${_name} \n          PROPERTIES WINDOWS_EXPORT_ALL_SYMBOLS true\n          FOLDER special/modules\n        )\n    endif()\n\n    install(TARGETS ${_name} LIBRARY DESTINATION lib/fst)\nendfunction()\n\nadd_module(phi-fst MODULE phi-fst.cc)\nadd_module(rho-fst MODULE rho-fst.cc)\nadd_module(sigma-fst MODULE sigma-fst.cc)\n\n\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/extensions/special/Makefile.am",
    "content": "AM_CPPFLAGS = -I$(srcdir)/../../include -I$(srcdir)/../../bin $(ICU_CPPFLAGS)\n\nif HAVE_BIN\nbin_PROGRAMS = fstspecial\n\nLDADD = ../../script/libfstscript.la \\\n        ../../lib/libfst.la -lm $(DL_LIBS)\n\nfstspecial_SOURCES = fstspecial.cc phi-fst.cc rho-fst.cc sigma-fst.cc\nfstspecial_CPPFLAGS = $(AM_CPPFLAGS)\nendif\n\nlibfstdir = @libfstdir@\nlibfst_LTLIBRARIES = phi-fst.la rho-fst.la sigma-fst.la\n\nlib_LTLIBRARIES = libfstspecial.la\n\nlibfstspecial_la_SOURCES = phi-fst.cc rho-fst.cc sigma-fst.cc\nlibfstspecial_la_LDFLAGS = -version-info 13:0:0 -lm $(DL_LIBS)\nlibfstspecial_la_LIBADD = ../../lib/libfst.la -lm $(DL_LIBS)\n\nphi_fst_la_SOURCES = phi-fst.cc\nphi_fst_la_LDFLAGS = -module\nphi_fst_la_LIBADD = ../../lib/libfst.la -lm $(DL_LIBS)\n\nrho_fst_la_SOURCES = rho-fst.cc\nrho_fst_la_LDFLAGS = -module\nrho_fst_la_LIBADD = ../../lib/libfst.la -lm $(DL_LIBS)\n\nsigma_fst_la_SOURCES = sigma-fst.cc\nsigma_fst_la_LDFLAGS = -module\nsigma_fst_la_LIBADD = ../../lib/libfst.la -lm $(DL_LIBS)\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/extensions/special/Makefile.in",
    "content": "# Makefile.in generated by automake 1.15.1 from Makefile.am.\n# @configure_input@\n\n# Copyright (C) 1994-2017 Free Software Foundation, Inc.\n\n# This Makefile.in is free software; the Free Software Foundation\n# gives unlimited permission to copy and/or distribute it,\n# with or without modifications, as long as this notice is preserved.\n\n# This program is distributed in the hope that it will be useful,\n# but WITHOUT ANY WARRANTY, to the extent permitted by law; without\n# even the implied warranty of MERCHANTABILITY or FITNESS FOR A\n# PARTICULAR PURPOSE.\n\n@SET_MAKE@\n\n\nVPATH = @srcdir@\nam__is_gnu_make = { \\\n  if test -z '$(MAKELEVEL)'; then \\\n    false; \\\n  elif test -n '$(MAKE_HOST)'; then \\\n    true; \\\n  elif test -n '$(MAKE_VERSION)' && test -n '$(CURDIR)'; then \\\n    true; \\\n  else \\\n    false; \\\n  fi; \\\n}\nam__make_running_with_option = \\\n  case $${target_option-} in \\\n      ?) ;; \\\n      *) echo \"am__make_running_with_option: internal error: invalid\" \\\n              \"target option '$${target_option-}' specified\" >&2; \\\n         exit 1;; \\\n  esac; \\\n  has_opt=no; \\\n  sane_makeflags=$$MAKEFLAGS; \\\n  if $(am__is_gnu_make); then \\\n    sane_makeflags=$$MFLAGS; \\\n  else \\\n    case $$MAKEFLAGS in \\\n      *\\\\[\\ \\\t]*) \\\n        bs=\\\\; \\\n        sane_makeflags=`printf '%s\\n' \"$$MAKEFLAGS\" \\\n          | sed \"s/$$bs$$bs[$$bs $$bs\t]*//g\"`;; \\\n    esac; \\\n  fi; \\\n  skip_next=no; \\\n  strip_trailopt () \\\n  { \\\n    flg=`printf '%s\\n' \"$$flg\" | sed \"s/$$1.*$$//\"`; \\\n  }; \\\n  for flg in $$sane_makeflags; do \\\n    test $$skip_next = yes && { skip_next=no; continue; }; \\\n    case $$flg in \\\n      *=*|--*) continue;; \\\n        -*I) strip_trailopt 'I'; skip_next=yes;; \\\n      -*I?*) strip_trailopt 'I';; \\\n        -*O) strip_trailopt 'O'; skip_next=yes;; \\\n      -*O?*) strip_trailopt 'O';; \\\n        -*l) strip_trailopt 'l'; skip_next=yes;; \\\n      -*l?*) strip_trailopt 'l';; \\\n      -[dEDm]) skip_next=yes;; \\\n      -[JT]) skip_next=yes;; \\\n    esac; \\\n    case $$flg in \\\n      *$$target_option*) has_opt=yes; break;; \\\n    esac; \\\n  done; \\\n  test $$has_opt = yes\nam__make_dryrun = (target_option=n; $(am__make_running_with_option))\nam__make_keepgoing = (target_option=k; $(am__make_running_with_option))\npkgdatadir = $(datadir)/@PACKAGE@\npkgincludedir = $(includedir)/@PACKAGE@\npkglibdir = $(libdir)/@PACKAGE@\npkglibexecdir = $(libexecdir)/@PACKAGE@\nam__cd = CDPATH=\"$${ZSH_VERSION+.}$(PATH_SEPARATOR)\" && cd\ninstall_sh_DATA = $(install_sh) -c -m 644\ninstall_sh_PROGRAM = $(install_sh) -c\ninstall_sh_SCRIPT = $(install_sh) -c\nINSTALL_HEADER = $(INSTALL_DATA)\ntransform = $(program_transform_name)\nNORMAL_INSTALL = :\nPRE_INSTALL = :\nPOST_INSTALL = :\nNORMAL_UNINSTALL = :\nPRE_UNINSTALL = :\nPOST_UNINSTALL = :\nbuild_triplet = @build@\nhost_triplet = @host@\n@HAVE_BIN_TRUE@bin_PROGRAMS = fstspecial$(EXEEXT)\nsubdir = src/extensions/special\nACLOCAL_M4 = $(top_srcdir)/aclocal.m4\nam__aclocal_m4_deps = $(top_srcdir)/m4/ac_python_devel.m4 \\\n\t$(top_srcdir)/m4/libtool.m4 $(top_srcdir)/m4/ltoptions.m4 \\\n\t$(top_srcdir)/m4/ltsugar.m4 $(top_srcdir)/m4/ltversion.m4 \\\n\t$(top_srcdir)/m4/lt~obsolete.m4 $(top_srcdir)/configure.ac\nam__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \\\n\t$(ACLOCAL_M4)\nDIST_COMMON = $(srcdir)/Makefile.am $(am__DIST_COMMON)\nmkinstalldirs = $(install_sh) -d\nCONFIG_HEADER = $(top_builddir)/config.h \\\n\t$(top_builddir)/src/include/fst/config.h\nCONFIG_CLEAN_FILES =\nCONFIG_CLEAN_VPATH_FILES =\nam__vpath_adj_setup = srcdirstrip=`echo \"$(srcdir)\" | sed 's|.|.|g'`;\nam__vpath_adj = case $$p in \\\n    $(srcdir)/*) f=`echo \"$$p\" | sed \"s|^$$srcdirstrip/||\"`;; \\\n    *) f=$$p;; \\\n  esac;\nam__strip_dir = f=`echo $$p | sed -e 's|^.*/||'`;\nam__install_max = 40\nam__nobase_strip_setup = \\\n  srcdirstrip=`echo \"$(srcdir)\" | sed 's/[].[^$$\\\\*|]/\\\\\\\\&/g'`\nam__nobase_strip = \\\n  for p in $$list; do echo \"$$p\"; done | sed -e \"s|$$srcdirstrip/||\"\nam__nobase_list = $(am__nobase_strip_setup); \\\n  for p in $$list; do echo \"$$p $$p\"; done | \\\n  sed \"s| $$srcdirstrip/| |;\"' / .*\\//!s/ .*/ ./; s,\\( .*\\)/[^/]*$$,\\1,' | \\\n  $(AWK) 'BEGIN { files[\".\"] = \"\" } { files[$$2] = files[$$2] \" \" $$1; \\\n    if (++n[$$2] == $(am__install_max)) \\\n      { print $$2, files[$$2]; n[$$2] = 0; files[$$2] = \"\" } } \\\n    END { for (dir in files) print dir, files[dir] }'\nam__base_list = \\\n  sed '$$!N;$$!N;$$!N;$$!N;$$!N;$$!N;$$!N;s/\\n/ /g' | \\\n  sed '$$!N;$$!N;$$!N;$$!N;s/\\n/ /g'\nam__uninstall_files_from_dir = { \\\n  test -z \"$$files\" \\\n    || { test ! -d \"$$dir\" && test ! -f \"$$dir\" && test ! -r \"$$dir\"; } \\\n    || { echo \" ( cd '$$dir' && rm -f\" $$files \")\"; \\\n         $(am__cd) \"$$dir\" && rm -f $$files; }; \\\n  }\nam__installdirs = \"$(DESTDIR)$(libdir)\" \"$(DESTDIR)$(libfstdir)\" \\\n\t\"$(DESTDIR)$(bindir)\"\nLTLIBRARIES = $(lib_LTLIBRARIES) $(libfst_LTLIBRARIES)\nam__DEPENDENCIES_1 =\nlibfstspecial_la_DEPENDENCIES = ../../lib/libfst.la \\\n\t$(am__DEPENDENCIES_1)\nam_libfstspecial_la_OBJECTS = phi-fst.lo rho-fst.lo sigma-fst.lo\nlibfstspecial_la_OBJECTS = $(am_libfstspecial_la_OBJECTS)\nAM_V_lt = $(am__v_lt_@AM_V@)\nam__v_lt_ = $(am__v_lt_@AM_DEFAULT_V@)\nam__v_lt_0 = --silent\nam__v_lt_1 = \nlibfstspecial_la_LINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX \\\n\t$(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=link $(CXXLD) \\\n\t$(AM_CXXFLAGS) $(CXXFLAGS) $(libfstspecial_la_LDFLAGS) \\\n\t$(LDFLAGS) -o $@\nphi_fst_la_DEPENDENCIES = ../../lib/libfst.la $(am__DEPENDENCIES_1)\nam_phi_fst_la_OBJECTS = phi-fst.lo\nphi_fst_la_OBJECTS = $(am_phi_fst_la_OBJECTS)\nphi_fst_la_LINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \\\n\t$(LIBTOOLFLAGS) --mode=link $(CXXLD) $(AM_CXXFLAGS) \\\n\t$(CXXFLAGS) $(phi_fst_la_LDFLAGS) $(LDFLAGS) -o $@\nrho_fst_la_DEPENDENCIES = ../../lib/libfst.la $(am__DEPENDENCIES_1)\nam_rho_fst_la_OBJECTS = rho-fst.lo\nrho_fst_la_OBJECTS = $(am_rho_fst_la_OBJECTS)\nrho_fst_la_LINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \\\n\t$(LIBTOOLFLAGS) --mode=link $(CXXLD) $(AM_CXXFLAGS) \\\n\t$(CXXFLAGS) $(rho_fst_la_LDFLAGS) $(LDFLAGS) -o $@\nsigma_fst_la_DEPENDENCIES = ../../lib/libfst.la $(am__DEPENDENCIES_1)\nam_sigma_fst_la_OBJECTS = sigma-fst.lo\nsigma_fst_la_OBJECTS = $(am_sigma_fst_la_OBJECTS)\nsigma_fst_la_LINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \\\n\t$(LIBTOOLFLAGS) --mode=link $(CXXLD) $(AM_CXXFLAGS) \\\n\t$(CXXFLAGS) $(sigma_fst_la_LDFLAGS) $(LDFLAGS) -o $@\nPROGRAMS = $(bin_PROGRAMS)\nam__fstspecial_SOURCES_DIST = fstspecial.cc phi-fst.cc rho-fst.cc \\\n\tsigma-fst.cc\n@HAVE_BIN_TRUE@am_fstspecial_OBJECTS =  \\\n@HAVE_BIN_TRUE@\tfstspecial-fstspecial.$(OBJEXT) \\\n@HAVE_BIN_TRUE@\tfstspecial-phi-fst.$(OBJEXT) \\\n@HAVE_BIN_TRUE@\tfstspecial-rho-fst.$(OBJEXT) \\\n@HAVE_BIN_TRUE@\tfstspecial-sigma-fst.$(OBJEXT)\nfstspecial_OBJECTS = $(am_fstspecial_OBJECTS)\nfstspecial_LDADD = $(LDADD)\n@HAVE_BIN_TRUE@fstspecial_DEPENDENCIES = ../../script/libfstscript.la \\\n@HAVE_BIN_TRUE@\t../../lib/libfst.la $(am__DEPENDENCIES_1)\nAM_V_P = $(am__v_P_@AM_V@)\nam__v_P_ = $(am__v_P_@AM_DEFAULT_V@)\nam__v_P_0 = false\nam__v_P_1 = :\nAM_V_GEN = $(am__v_GEN_@AM_V@)\nam__v_GEN_ = $(am__v_GEN_@AM_DEFAULT_V@)\nam__v_GEN_0 = @echo \"  GEN     \" $@;\nam__v_GEN_1 = \nAM_V_at = $(am__v_at_@AM_V@)\nam__v_at_ = $(am__v_at_@AM_DEFAULT_V@)\nam__v_at_0 = @\nam__v_at_1 = \nDEFAULT_INCLUDES = \ndepcomp = $(SHELL) $(top_srcdir)/depcomp\nam__depfiles_maybe = depfiles\nam__mv = mv -f\nCXXCOMPILE = $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) \\\n\t$(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS)\nLTCXXCOMPILE = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \\\n\t$(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) \\\n\t$(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) \\\n\t$(AM_CXXFLAGS) $(CXXFLAGS)\nAM_V_CXX = $(am__v_CXX_@AM_V@)\nam__v_CXX_ = $(am__v_CXX_@AM_DEFAULT_V@)\nam__v_CXX_0 = @echo \"  CXX     \" $@;\nam__v_CXX_1 = \nCXXLD = $(CXX)\nCXXLINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \\\n\t$(LIBTOOLFLAGS) --mode=link $(CXXLD) $(AM_CXXFLAGS) \\\n\t$(CXXFLAGS) $(AM_LDFLAGS) $(LDFLAGS) -o $@\nAM_V_CXXLD = $(am__v_CXXLD_@AM_V@)\nam__v_CXXLD_ = $(am__v_CXXLD_@AM_DEFAULT_V@)\nam__v_CXXLD_0 = @echo \"  CXXLD   \" $@;\nam__v_CXXLD_1 = \nSOURCES = $(libfstspecial_la_SOURCES) $(phi_fst_la_SOURCES) \\\n\t$(rho_fst_la_SOURCES) $(sigma_fst_la_SOURCES) \\\n\t$(fstspecial_SOURCES)\nDIST_SOURCES = $(libfstspecial_la_SOURCES) $(phi_fst_la_SOURCES) \\\n\t$(rho_fst_la_SOURCES) $(sigma_fst_la_SOURCES) \\\n\t$(am__fstspecial_SOURCES_DIST)\nam__can_run_installinfo = \\\n  case $$AM_UPDATE_INFO_DIR in \\\n    n|no|NO) false;; \\\n    *) (install-info --version) >/dev/null 2>&1;; \\\n  esac\nam__tagged_files = $(HEADERS) $(SOURCES) $(TAGS_FILES) $(LISP)\n# Read a list of newline-separated strings from the standard input,\n# and print each of them once, without duplicates.  Input order is\n# *not* preserved.\nam__uniquify_input = $(AWK) '\\\n  BEGIN { nonempty = 0; } \\\n  { items[$$0] = 1; nonempty = 1; } \\\n  END { if (nonempty) { for (i in items) print i; }; } \\\n'\n# Make sure the list of sources is unique.  This is necessary because,\n# e.g., the same source file might be shared among _SOURCES variables\n# for different programs/libraries.\nam__define_uniq_tagged_files = \\\n  list='$(am__tagged_files)'; \\\n  unique=`for i in $$list; do \\\n    if test -f \"$$i\"; then echo $$i; else echo $(srcdir)/$$i; fi; \\\n  done | $(am__uniquify_input)`\nETAGS = etags\nCTAGS = ctags\nam__DIST_COMMON = $(srcdir)/Makefile.in $(top_srcdir)/depcomp\nDISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST)\nACLOCAL = @ACLOCAL@\nAMTAR = @AMTAR@\nAM_DEFAULT_VERBOSITY = @AM_DEFAULT_VERBOSITY@\nAR = @AR@\nAUTOCONF = @AUTOCONF@\nAUTOHEADER = @AUTOHEADER@\nAUTOMAKE = @AUTOMAKE@\nAWK = @AWK@\nCC = @CC@\nCCDEPMODE = @CCDEPMODE@\nCFLAGS = @CFLAGS@\nCPP = @CPP@\nCPPFLAGS = @CPPFLAGS@\nCXX = @CXX@\nCXXCPP = @CXXCPP@\nCXXDEPMODE = @CXXDEPMODE@\nCXXFLAGS = @CXXFLAGS@\nCYGPATH_W = @CYGPATH_W@\nDEFS = @DEFS@\nDEPDIR = @DEPDIR@\nDLLTOOL = @DLLTOOL@\nDL_LIBS = @DL_LIBS@\nDSYMUTIL = @DSYMUTIL@\nDUMPBIN = @DUMPBIN@\nECHO_C = @ECHO_C@\nECHO_N = @ECHO_N@\nECHO_T = @ECHO_T@\nEGREP = @EGREP@\nEXEEXT = @EXEEXT@\nFGREP = @FGREP@\nGREP = @GREP@\nINSTALL = @INSTALL@\nINSTALL_DATA = @INSTALL_DATA@\nINSTALL_PROGRAM = @INSTALL_PROGRAM@\nINSTALL_SCRIPT = @INSTALL_SCRIPT@\nINSTALL_STRIP_PROGRAM = @INSTALL_STRIP_PROGRAM@\nLD = @LD@\nLDFLAGS = @LDFLAGS@\nLIBOBJS = @LIBOBJS@\nLIBS = @LIBS@\nLIBTOOL = @LIBTOOL@\nLIPO = @LIPO@\nLN_S = @LN_S@\nLTLIBOBJS = @LTLIBOBJS@\nLT_SYS_LIBRARY_PATH = @LT_SYS_LIBRARY_PATH@\nMAKEINFO = @MAKEINFO@\nMANIFEST_TOOL = @MANIFEST_TOOL@\nMKDIR_P = @MKDIR_P@\nNM = @NM@\nNMEDIT = @NMEDIT@\nOBJDUMP = @OBJDUMP@\nOBJEXT = @OBJEXT@\nOTOOL = @OTOOL@\nOTOOL64 = @OTOOL64@\nPACKAGE = @PACKAGE@\nPACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@\nPACKAGE_NAME = @PACKAGE_NAME@\nPACKAGE_STRING = @PACKAGE_STRING@\nPACKAGE_TARNAME = @PACKAGE_TARNAME@\nPACKAGE_URL = @PACKAGE_URL@\nPACKAGE_VERSION = @PACKAGE_VERSION@\nPATH_SEPARATOR = @PATH_SEPARATOR@\nPYTHON = @PYTHON@\nPYTHON_CPPFLAGS = @PYTHON_CPPFLAGS@\nPYTHON_EXEC_PREFIX = @PYTHON_EXEC_PREFIX@\nPYTHON_EXTRA_LDFLAGS = @PYTHON_EXTRA_LDFLAGS@\nPYTHON_EXTRA_LIBS = @PYTHON_EXTRA_LIBS@\nPYTHON_LDFLAGS = @PYTHON_LDFLAGS@\nPYTHON_PLATFORM = @PYTHON_PLATFORM@\nPYTHON_PREFIX = @PYTHON_PREFIX@\nPYTHON_SITE_PKG = @PYTHON_SITE_PKG@\nPYTHON_VERSION = @PYTHON_VERSION@\nRANLIB = @RANLIB@\nSED = @SED@\nSET_MAKE = @SET_MAKE@\nSHELL = @SHELL@\nSTRIP = @STRIP@\nVERSION = @VERSION@\nabs_builddir = @abs_builddir@\nabs_srcdir = @abs_srcdir@\nabs_top_builddir = @abs_top_builddir@\nabs_top_srcdir = @abs_top_srcdir@\nac_ct_AR = @ac_ct_AR@\nac_ct_CC = @ac_ct_CC@\nac_ct_CXX = @ac_ct_CXX@\nac_ct_DUMPBIN = @ac_ct_DUMPBIN@\nam__include = @am__include@\nam__leading_dot = @am__leading_dot@\nam__quote = @am__quote@\nam__tar = @am__tar@\nam__untar = @am__untar@\nbindir = @bindir@\nbuild = @build@\nbuild_alias = @build_alias@\nbuild_cpu = @build_cpu@\nbuild_os = @build_os@\nbuild_vendor = @build_vendor@\nbuilddir = @builddir@\ndatadir = @datadir@\ndatarootdir = @datarootdir@\ndocdir = @docdir@\ndvidir = @dvidir@\nexec_prefix = @exec_prefix@\nhost = @host@\nhost_alias = @host_alias@\nhost_cpu = @host_cpu@\nhost_os = @host_os@\nhost_vendor = @host_vendor@\nhtmldir = @htmldir@\nincludedir = @includedir@\ninfodir = @infodir@\ninstall_sh = @install_sh@\nlibdir = @libdir@\nlibexecdir = @libexecdir@\nlibfstdir = @libfstdir@\nlocaledir = @localedir@\nlocalstatedir = @localstatedir@\nmandir = @mandir@\nmkdir_p = @mkdir_p@\noldincludedir = @oldincludedir@\npdfdir = @pdfdir@\npkgpyexecdir = @pkgpyexecdir@\npkgpythondir = @pkgpythondir@\nprefix = @prefix@\nprogram_transform_name = @program_transform_name@\npsdir = @psdir@\npyexecdir = @pyexecdir@\npythondir = @pythondir@\nrunstatedir = @runstatedir@\nsbindir = @sbindir@\nsharedstatedir = @sharedstatedir@\nsrcdir = @srcdir@\nsysconfdir = @sysconfdir@\ntarget_alias = @target_alias@\ntop_build_prefix = @top_build_prefix@\ntop_builddir = @top_builddir@\ntop_srcdir = @top_srcdir@\nAM_CPPFLAGS = -I$(srcdir)/../../include -I$(srcdir)/../../bin $(ICU_CPPFLAGS)\n@HAVE_BIN_TRUE@LDADD = ../../script/libfstscript.la \\\n@HAVE_BIN_TRUE@        ../../lib/libfst.la -lm $(DL_LIBS)\n\n@HAVE_BIN_TRUE@fstspecial_SOURCES = fstspecial.cc phi-fst.cc rho-fst.cc sigma-fst.cc\n@HAVE_BIN_TRUE@fstspecial_CPPFLAGS = $(AM_CPPFLAGS)\nlibfst_LTLIBRARIES = phi-fst.la rho-fst.la sigma-fst.la\nlib_LTLIBRARIES = libfstspecial.la\nlibfstspecial_la_SOURCES = phi-fst.cc rho-fst.cc sigma-fst.cc\nlibfstspecial_la_LDFLAGS = -version-info 13:0:0 -lm $(DL_LIBS)\nlibfstspecial_la_LIBADD = ../../lib/libfst.la -lm $(DL_LIBS)\nphi_fst_la_SOURCES = phi-fst.cc\nphi_fst_la_LDFLAGS = -module\nphi_fst_la_LIBADD = ../../lib/libfst.la -lm $(DL_LIBS)\nrho_fst_la_SOURCES = rho-fst.cc\nrho_fst_la_LDFLAGS = -module\nrho_fst_la_LIBADD = ../../lib/libfst.la -lm $(DL_LIBS)\nsigma_fst_la_SOURCES = sigma-fst.cc\nsigma_fst_la_LDFLAGS = -module\nsigma_fst_la_LIBADD = ../../lib/libfst.la -lm $(DL_LIBS)\nall: all-am\n\n.SUFFIXES:\n.SUFFIXES: .cc .lo .o .obj\n$(srcdir)/Makefile.in:  $(srcdir)/Makefile.am  $(am__configure_deps)\n\t@for dep in $?; do \\\n\t  case '$(am__configure_deps)' in \\\n\t    *$$dep*) \\\n\t      ( cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh ) \\\n\t        && { if test -f $@; then exit 0; else break; fi; }; \\\n\t      exit 1;; \\\n\t  esac; \\\n\tdone; \\\n\techo ' cd $(top_srcdir) && $(AUTOMAKE) --foreign src/extensions/special/Makefile'; \\\n\t$(am__cd) $(top_srcdir) && \\\n\t  $(AUTOMAKE) --foreign src/extensions/special/Makefile\nMakefile: $(srcdir)/Makefile.in $(top_builddir)/config.status\n\t@case '$?' in \\\n\t  *config.status*) \\\n\t    cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh;; \\\n\t  *) \\\n\t    echo ' cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe)'; \\\n\t    cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe);; \\\n\tesac;\n\n$(top_builddir)/config.status: $(top_srcdir)/configure $(CONFIG_STATUS_DEPENDENCIES)\n\tcd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh\n\n$(top_srcdir)/configure:  $(am__configure_deps)\n\tcd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh\n$(ACLOCAL_M4):  $(am__aclocal_m4_deps)\n\tcd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh\n$(am__aclocal_m4_deps):\n\ninstall-libLTLIBRARIES: $(lib_LTLIBRARIES)\n\t@$(NORMAL_INSTALL)\n\t@list='$(lib_LTLIBRARIES)'; test -n \"$(libdir)\" || list=; \\\n\tlist2=; for p in $$list; do \\\n\t  if test -f $$p; then \\\n\t    list2=\"$$list2 $$p\"; \\\n\t  else :; fi; \\\n\tdone; \\\n\ttest -z \"$$list2\" || { \\\n\t  echo \" $(MKDIR_P) '$(DESTDIR)$(libdir)'\"; \\\n\t  $(MKDIR_P) \"$(DESTDIR)$(libdir)\" || exit 1; \\\n\t  echo \" $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) $$list2 '$(DESTDIR)$(libdir)'\"; \\\n\t  $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) $$list2 \"$(DESTDIR)$(libdir)\"; \\\n\t}\n\nuninstall-libLTLIBRARIES:\n\t@$(NORMAL_UNINSTALL)\n\t@list='$(lib_LTLIBRARIES)'; test -n \"$(libdir)\" || list=; \\\n\tfor p in $$list; do \\\n\t  $(am__strip_dir) \\\n\t  echo \" $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=uninstall rm -f '$(DESTDIR)$(libdir)/$$f'\"; \\\n\t  $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=uninstall rm -f \"$(DESTDIR)$(libdir)/$$f\"; \\\n\tdone\n\nclean-libLTLIBRARIES:\n\t-test -z \"$(lib_LTLIBRARIES)\" || rm -f $(lib_LTLIBRARIES)\n\t@list='$(lib_LTLIBRARIES)'; \\\n\tlocs=`for p in $$list; do echo $$p; done | \\\n\t      sed 's|^[^/]*$$|.|; s|/[^/]*$$||; s|$$|/so_locations|' | \\\n\t      sort -u`; \\\n\ttest -z \"$$locs\" || { \\\n\t  echo rm -f $${locs}; \\\n\t  rm -f $${locs}; \\\n\t}\n\ninstall-libfstLTLIBRARIES: $(libfst_LTLIBRARIES)\n\t@$(NORMAL_INSTALL)\n\t@list='$(libfst_LTLIBRARIES)'; test -n \"$(libfstdir)\" || list=; \\\n\tlist2=; for p in $$list; do \\\n\t  if test -f $$p; then \\\n\t    list2=\"$$list2 $$p\"; \\\n\t  else :; fi; \\\n\tdone; \\\n\ttest -z \"$$list2\" || { \\\n\t  echo \" $(MKDIR_P) '$(DESTDIR)$(libfstdir)'\"; \\\n\t  $(MKDIR_P) \"$(DESTDIR)$(libfstdir)\" || exit 1; \\\n\t  echo \" $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) $$list2 '$(DESTDIR)$(libfstdir)'\"; \\\n\t  $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) $$list2 \"$(DESTDIR)$(libfstdir)\"; \\\n\t}\n\nuninstall-libfstLTLIBRARIES:\n\t@$(NORMAL_UNINSTALL)\n\t@list='$(libfst_LTLIBRARIES)'; test -n \"$(libfstdir)\" || list=; \\\n\tfor p in $$list; do \\\n\t  $(am__strip_dir) \\\n\t  echo \" $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=uninstall rm -f '$(DESTDIR)$(libfstdir)/$$f'\"; \\\n\t  $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=uninstall rm -f \"$(DESTDIR)$(libfstdir)/$$f\"; \\\n\tdone\n\nclean-libfstLTLIBRARIES:\n\t-test -z \"$(libfst_LTLIBRARIES)\" || rm -f $(libfst_LTLIBRARIES)\n\t@list='$(libfst_LTLIBRARIES)'; \\\n\tlocs=`for p in $$list; do echo $$p; done | \\\n\t      sed 's|^[^/]*$$|.|; s|/[^/]*$$||; s|$$|/so_locations|' | \\\n\t      sort -u`; \\\n\ttest -z \"$$locs\" || { \\\n\t  echo rm -f $${locs}; \\\n\t  rm -f $${locs}; \\\n\t}\n\nlibfstspecial.la: $(libfstspecial_la_OBJECTS) $(libfstspecial_la_DEPENDENCIES) $(EXTRA_libfstspecial_la_DEPENDENCIES) \n\t$(AM_V_CXXLD)$(libfstspecial_la_LINK) -rpath $(libdir) $(libfstspecial_la_OBJECTS) $(libfstspecial_la_LIBADD) $(LIBS)\n\nphi-fst.la: $(phi_fst_la_OBJECTS) $(phi_fst_la_DEPENDENCIES) $(EXTRA_phi_fst_la_DEPENDENCIES) \n\t$(AM_V_CXXLD)$(phi_fst_la_LINK) -rpath $(libfstdir) $(phi_fst_la_OBJECTS) $(phi_fst_la_LIBADD) $(LIBS)\n\nrho-fst.la: $(rho_fst_la_OBJECTS) $(rho_fst_la_DEPENDENCIES) $(EXTRA_rho_fst_la_DEPENDENCIES) \n\t$(AM_V_CXXLD)$(rho_fst_la_LINK) -rpath $(libfstdir) $(rho_fst_la_OBJECTS) $(rho_fst_la_LIBADD) $(LIBS)\n\nsigma-fst.la: $(sigma_fst_la_OBJECTS) $(sigma_fst_la_DEPENDENCIES) $(EXTRA_sigma_fst_la_DEPENDENCIES) \n\t$(AM_V_CXXLD)$(sigma_fst_la_LINK) -rpath $(libfstdir) $(sigma_fst_la_OBJECTS) $(sigma_fst_la_LIBADD) $(LIBS)\ninstall-binPROGRAMS: $(bin_PROGRAMS)\n\t@$(NORMAL_INSTALL)\n\t@list='$(bin_PROGRAMS)'; test -n \"$(bindir)\" || list=; \\\n\tif test -n \"$$list\"; then \\\n\t  echo \" $(MKDIR_P) '$(DESTDIR)$(bindir)'\"; \\\n\t  $(MKDIR_P) \"$(DESTDIR)$(bindir)\" || exit 1; \\\n\tfi; \\\n\tfor p in $$list; do echo \"$$p $$p\"; done | \\\n\tsed 's/$(EXEEXT)$$//' | \\\n\twhile read p p1; do if test -f $$p \\\n\t || test -f $$p1 \\\n\t  ; then echo \"$$p\"; echo \"$$p\"; else :; fi; \\\n\tdone | \\\n\tsed -e 'p;s,.*/,,;n;h' \\\n\t    -e 's|.*|.|' \\\n\t    -e 'p;x;s,.*/,,;s/$(EXEEXT)$$//;$(transform);s/$$/$(EXEEXT)/' | \\\n\tsed 'N;N;N;s,\\n, ,g' | \\\n\t$(AWK) 'BEGIN { files[\".\"] = \"\"; dirs[\".\"] = 1 } \\\n\t  { d=$$3; if (dirs[d] != 1) { print \"d\", d; dirs[d] = 1 } \\\n\t    if ($$2 == $$4) files[d] = files[d] \" \" $$1; \\\n\t    else { print \"f\", $$3 \"/\" $$4, $$1; } } \\\n\t  END { for (d in files) print \"f\", d, files[d] }' | \\\n\twhile read type dir files; do \\\n\t    if test \"$$dir\" = .; then dir=; else dir=/$$dir; fi; \\\n\t    test -z \"$$files\" || { \\\n\t    echo \" $(INSTALL_PROGRAM_ENV) $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL_PROGRAM) $$files '$(DESTDIR)$(bindir)$$dir'\"; \\\n\t    $(INSTALL_PROGRAM_ENV) $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL_PROGRAM) $$files \"$(DESTDIR)$(bindir)$$dir\" || exit $$?; \\\n\t    } \\\n\t; done\n\nuninstall-binPROGRAMS:\n\t@$(NORMAL_UNINSTALL)\n\t@list='$(bin_PROGRAMS)'; test -n \"$(bindir)\" || list=; \\\n\tfiles=`for p in $$list; do echo \"$$p\"; done | \\\n\t  sed -e 'h;s,^.*/,,;s/$(EXEEXT)$$//;$(transform)' \\\n\t      -e 's/$$/$(EXEEXT)/' \\\n\t`; \\\n\ttest -n \"$$list\" || exit 0; \\\n\techo \" ( cd '$(DESTDIR)$(bindir)' && rm -f\" $$files \")\"; \\\n\tcd \"$(DESTDIR)$(bindir)\" && rm -f $$files\n\nclean-binPROGRAMS:\n\t@list='$(bin_PROGRAMS)'; test -n \"$$list\" || exit 0; \\\n\techo \" rm -f\" $$list; \\\n\trm -f $$list || exit $$?; \\\n\ttest -n \"$(EXEEXT)\" || exit 0; \\\n\tlist=`for p in $$list; do echo \"$$p\"; done | sed 's/$(EXEEXT)$$//'`; \\\n\techo \" rm -f\" $$list; \\\n\trm -f $$list\n\nfstspecial$(EXEEXT): $(fstspecial_OBJECTS) $(fstspecial_DEPENDENCIES) $(EXTRA_fstspecial_DEPENDENCIES) \n\t@rm -f fstspecial$(EXEEXT)\n\t$(AM_V_CXXLD)$(CXXLINK) $(fstspecial_OBJECTS) $(fstspecial_LDADD) $(LIBS)\n\nmostlyclean-compile:\n\t-rm -f *.$(OBJEXT)\n\ndistclean-compile:\n\t-rm -f *.tab.c\n\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstspecial-fstspecial.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstspecial-phi-fst.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstspecial-rho-fst.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fstspecial-sigma-fst.Po@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/phi-fst.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/rho-fst.Plo@am__quote@\n@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/sigma-fst.Plo@am__quote@\n\n.cc.o:\n@am__fastdepCXX_TRUE@\t$(AM_V_CXX)depbase=`echo $@ | sed 's|[^/]*$$|$(DEPDIR)/&|;s|\\.o$$||'`;\\\n@am__fastdepCXX_TRUE@\t$(CXXCOMPILE) -MT $@ -MD -MP -MF $$depbase.Tpo -c -o $@ $< &&\\\n@am__fastdepCXX_TRUE@\t$(am__mv) $$depbase.Tpo $$depbase.Po\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\t$(AM_V_CXX)source='$<' object='$@' libtool=no @AMDEPBACKSLASH@\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\tDEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@\n@am__fastdepCXX_FALSE@\t$(AM_V_CXX@am__nodep@)$(CXXCOMPILE) -c -o $@ $<\n\n.cc.obj:\n@am__fastdepCXX_TRUE@\t$(AM_V_CXX)depbase=`echo $@ | sed 's|[^/]*$$|$(DEPDIR)/&|;s|\\.obj$$||'`;\\\n@am__fastdepCXX_TRUE@\t$(CXXCOMPILE) -MT $@ -MD -MP -MF $$depbase.Tpo -c -o $@ `$(CYGPATH_W) '$<'` &&\\\n@am__fastdepCXX_TRUE@\t$(am__mv) $$depbase.Tpo $$depbase.Po\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\t$(AM_V_CXX)source='$<' object='$@' libtool=no @AMDEPBACKSLASH@\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\tDEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@\n@am__fastdepCXX_FALSE@\t$(AM_V_CXX@am__nodep@)$(CXXCOMPILE) -c -o $@ `$(CYGPATH_W) '$<'`\n\n.cc.lo:\n@am__fastdepCXX_TRUE@\t$(AM_V_CXX)depbase=`echo $@ | sed 's|[^/]*$$|$(DEPDIR)/&|;s|\\.lo$$||'`;\\\n@am__fastdepCXX_TRUE@\t$(LTCXXCOMPILE) -MT $@ -MD -MP -MF $$depbase.Tpo -c -o $@ $< &&\\\n@am__fastdepCXX_TRUE@\t$(am__mv) $$depbase.Tpo $$depbase.Plo\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\t$(AM_V_CXX)source='$<' object='$@' libtool=yes @AMDEPBACKSLASH@\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\tDEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@\n@am__fastdepCXX_FALSE@\t$(AM_V_CXX@am__nodep@)$(LTCXXCOMPILE) -c -o $@ $<\n\nfstspecial-fstspecial.o: fstspecial.cc\n@am__fastdepCXX_TRUE@\t$(AM_V_CXX)$(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(fstspecial_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -MT fstspecial-fstspecial.o -MD -MP -MF $(DEPDIR)/fstspecial-fstspecial.Tpo -c -o fstspecial-fstspecial.o `test -f 'fstspecial.cc' || echo '$(srcdir)/'`fstspecial.cc\n@am__fastdepCXX_TRUE@\t$(AM_V_at)$(am__mv) $(DEPDIR)/fstspecial-fstspecial.Tpo $(DEPDIR)/fstspecial-fstspecial.Po\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\t$(AM_V_CXX)source='fstspecial.cc' object='fstspecial-fstspecial.o' libtool=no @AMDEPBACKSLASH@\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\tDEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@\n@am__fastdepCXX_FALSE@\t$(AM_V_CXX@am__nodep@)$(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(fstspecial_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -c -o fstspecial-fstspecial.o `test -f 'fstspecial.cc' || echo '$(srcdir)/'`fstspecial.cc\n\nfstspecial-fstspecial.obj: fstspecial.cc\n@am__fastdepCXX_TRUE@\t$(AM_V_CXX)$(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(fstspecial_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -MT fstspecial-fstspecial.obj -MD -MP -MF $(DEPDIR)/fstspecial-fstspecial.Tpo -c -o fstspecial-fstspecial.obj `if test -f 'fstspecial.cc'; then $(CYGPATH_W) 'fstspecial.cc'; else $(CYGPATH_W) '$(srcdir)/fstspecial.cc'; fi`\n@am__fastdepCXX_TRUE@\t$(AM_V_at)$(am__mv) $(DEPDIR)/fstspecial-fstspecial.Tpo $(DEPDIR)/fstspecial-fstspecial.Po\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\t$(AM_V_CXX)source='fstspecial.cc' object='fstspecial-fstspecial.obj' libtool=no @AMDEPBACKSLASH@\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\tDEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@\n@am__fastdepCXX_FALSE@\t$(AM_V_CXX@am__nodep@)$(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(fstspecial_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -c -o fstspecial-fstspecial.obj `if test -f 'fstspecial.cc'; then $(CYGPATH_W) 'fstspecial.cc'; else $(CYGPATH_W) '$(srcdir)/fstspecial.cc'; fi`\n\nfstspecial-phi-fst.o: phi-fst.cc\n@am__fastdepCXX_TRUE@\t$(AM_V_CXX)$(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(fstspecial_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -MT fstspecial-phi-fst.o -MD -MP -MF $(DEPDIR)/fstspecial-phi-fst.Tpo -c -o fstspecial-phi-fst.o `test -f 'phi-fst.cc' || echo '$(srcdir)/'`phi-fst.cc\n@am__fastdepCXX_TRUE@\t$(AM_V_at)$(am__mv) $(DEPDIR)/fstspecial-phi-fst.Tpo $(DEPDIR)/fstspecial-phi-fst.Po\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\t$(AM_V_CXX)source='phi-fst.cc' object='fstspecial-phi-fst.o' libtool=no @AMDEPBACKSLASH@\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\tDEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@\n@am__fastdepCXX_FALSE@\t$(AM_V_CXX@am__nodep@)$(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(fstspecial_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -c -o fstspecial-phi-fst.o `test -f 'phi-fst.cc' || echo '$(srcdir)/'`phi-fst.cc\n\nfstspecial-phi-fst.obj: phi-fst.cc\n@am__fastdepCXX_TRUE@\t$(AM_V_CXX)$(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(fstspecial_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -MT fstspecial-phi-fst.obj -MD -MP -MF $(DEPDIR)/fstspecial-phi-fst.Tpo -c -o fstspecial-phi-fst.obj `if test -f 'phi-fst.cc'; then $(CYGPATH_W) 'phi-fst.cc'; else $(CYGPATH_W) '$(srcdir)/phi-fst.cc'; fi`\n@am__fastdepCXX_TRUE@\t$(AM_V_at)$(am__mv) $(DEPDIR)/fstspecial-phi-fst.Tpo $(DEPDIR)/fstspecial-phi-fst.Po\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\t$(AM_V_CXX)source='phi-fst.cc' object='fstspecial-phi-fst.obj' libtool=no @AMDEPBACKSLASH@\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\tDEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@\n@am__fastdepCXX_FALSE@\t$(AM_V_CXX@am__nodep@)$(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(fstspecial_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -c -o fstspecial-phi-fst.obj `if test -f 'phi-fst.cc'; then $(CYGPATH_W) 'phi-fst.cc'; else $(CYGPATH_W) '$(srcdir)/phi-fst.cc'; fi`\n\nfstspecial-rho-fst.o: rho-fst.cc\n@am__fastdepCXX_TRUE@\t$(AM_V_CXX)$(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(fstspecial_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -MT fstspecial-rho-fst.o -MD -MP -MF $(DEPDIR)/fstspecial-rho-fst.Tpo -c -o fstspecial-rho-fst.o `test -f 'rho-fst.cc' || echo '$(srcdir)/'`rho-fst.cc\n@am__fastdepCXX_TRUE@\t$(AM_V_at)$(am__mv) $(DEPDIR)/fstspecial-rho-fst.Tpo $(DEPDIR)/fstspecial-rho-fst.Po\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\t$(AM_V_CXX)source='rho-fst.cc' object='fstspecial-rho-fst.o' libtool=no @AMDEPBACKSLASH@\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\tDEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@\n@am__fastdepCXX_FALSE@\t$(AM_V_CXX@am__nodep@)$(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(fstspecial_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -c -o fstspecial-rho-fst.o `test -f 'rho-fst.cc' || echo '$(srcdir)/'`rho-fst.cc\n\nfstspecial-rho-fst.obj: rho-fst.cc\n@am__fastdepCXX_TRUE@\t$(AM_V_CXX)$(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(fstspecial_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -MT fstspecial-rho-fst.obj -MD -MP -MF $(DEPDIR)/fstspecial-rho-fst.Tpo -c -o fstspecial-rho-fst.obj `if test -f 'rho-fst.cc'; then $(CYGPATH_W) 'rho-fst.cc'; else $(CYGPATH_W) '$(srcdir)/rho-fst.cc'; fi`\n@am__fastdepCXX_TRUE@\t$(AM_V_at)$(am__mv) $(DEPDIR)/fstspecial-rho-fst.Tpo $(DEPDIR)/fstspecial-rho-fst.Po\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\t$(AM_V_CXX)source='rho-fst.cc' object='fstspecial-rho-fst.obj' libtool=no @AMDEPBACKSLASH@\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\tDEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@\n@am__fastdepCXX_FALSE@\t$(AM_V_CXX@am__nodep@)$(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(fstspecial_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -c -o fstspecial-rho-fst.obj `if test -f 'rho-fst.cc'; then $(CYGPATH_W) 'rho-fst.cc'; else $(CYGPATH_W) '$(srcdir)/rho-fst.cc'; fi`\n\nfstspecial-sigma-fst.o: sigma-fst.cc\n@am__fastdepCXX_TRUE@\t$(AM_V_CXX)$(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(fstspecial_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -MT fstspecial-sigma-fst.o -MD -MP -MF $(DEPDIR)/fstspecial-sigma-fst.Tpo -c -o fstspecial-sigma-fst.o `test -f 'sigma-fst.cc' || echo '$(srcdir)/'`sigma-fst.cc\n@am__fastdepCXX_TRUE@\t$(AM_V_at)$(am__mv) $(DEPDIR)/fstspecial-sigma-fst.Tpo $(DEPDIR)/fstspecial-sigma-fst.Po\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\t$(AM_V_CXX)source='sigma-fst.cc' object='fstspecial-sigma-fst.o' libtool=no @AMDEPBACKSLASH@\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\tDEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@\n@am__fastdepCXX_FALSE@\t$(AM_V_CXX@am__nodep@)$(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(fstspecial_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -c -o fstspecial-sigma-fst.o `test -f 'sigma-fst.cc' || echo '$(srcdir)/'`sigma-fst.cc\n\nfstspecial-sigma-fst.obj: sigma-fst.cc\n@am__fastdepCXX_TRUE@\t$(AM_V_CXX)$(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(fstspecial_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -MT fstspecial-sigma-fst.obj -MD -MP -MF $(DEPDIR)/fstspecial-sigma-fst.Tpo -c -o fstspecial-sigma-fst.obj `if test -f 'sigma-fst.cc'; then $(CYGPATH_W) 'sigma-fst.cc'; else $(CYGPATH_W) '$(srcdir)/sigma-fst.cc'; fi`\n@am__fastdepCXX_TRUE@\t$(AM_V_at)$(am__mv) $(DEPDIR)/fstspecial-sigma-fst.Tpo $(DEPDIR)/fstspecial-sigma-fst.Po\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\t$(AM_V_CXX)source='sigma-fst.cc' object='fstspecial-sigma-fst.obj' libtool=no @AMDEPBACKSLASH@\n@AMDEP_TRUE@@am__fastdepCXX_FALSE@\tDEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@\n@am__fastdepCXX_FALSE@\t$(AM_V_CXX@am__nodep@)$(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(fstspecial_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -c -o fstspecial-sigma-fst.obj `if test -f 'sigma-fst.cc'; then $(CYGPATH_W) 'sigma-fst.cc'; else $(CYGPATH_W) '$(srcdir)/sigma-fst.cc'; fi`\n\nmostlyclean-libtool:\n\t-rm -f *.lo\n\nclean-libtool:\n\t-rm -rf .libs _libs\n\nID: $(am__tagged_files)\n\t$(am__define_uniq_tagged_files); mkid -fID $$unique\ntags: tags-am\nTAGS: tags\n\ntags-am: $(TAGS_DEPENDENCIES) $(am__tagged_files)\n\tset x; \\\n\there=`pwd`; \\\n\t$(am__define_uniq_tagged_files); \\\n\tshift; \\\n\tif test -z \"$(ETAGS_ARGS)$$*$$unique\"; then :; else \\\n\t  test -n \"$$unique\" || unique=$$empty_fix; \\\n\t  if test $$# -gt 0; then \\\n\t    $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \\\n\t      \"$$@\" $$unique; \\\n\t  else \\\n\t    $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \\\n\t      $$unique; \\\n\t  fi; \\\n\tfi\nctags: ctags-am\n\nCTAGS: ctags\nctags-am: $(TAGS_DEPENDENCIES) $(am__tagged_files)\n\t$(am__define_uniq_tagged_files); \\\n\ttest -z \"$(CTAGS_ARGS)$$unique\" \\\n\t  || $(CTAGS) $(CTAGSFLAGS) $(AM_CTAGSFLAGS) $(CTAGS_ARGS) \\\n\t     $$unique\n\nGTAGS:\n\there=`$(am__cd) $(top_builddir) && pwd` \\\n\t  && $(am__cd) $(top_srcdir) \\\n\t  && gtags -i $(GTAGS_ARGS) \"$$here\"\ncscopelist: cscopelist-am\n\ncscopelist-am: $(am__tagged_files)\n\tlist='$(am__tagged_files)'; \\\n\tcase \"$(srcdir)\" in \\\n\t  [\\\\/]* | ?:[\\\\/]*) sdir=\"$(srcdir)\" ;; \\\n\t  *) sdir=$(subdir)/$(srcdir) ;; \\\n\tesac; \\\n\tfor i in $$list; do \\\n\t  if test -f \"$$i\"; then \\\n\t    echo \"$(subdir)/$$i\"; \\\n\t  else \\\n\t    echo \"$$sdir/$$i\"; \\\n\t  fi; \\\n\tdone >> $(top_builddir)/cscope.files\n\ndistclean-tags:\n\t-rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags\n\ndistdir: $(DISTFILES)\n\t@srcdirstrip=`echo \"$(srcdir)\" | sed 's/[].[^$$\\\\*]/\\\\\\\\&/g'`; \\\n\ttopsrcdirstrip=`echo \"$(top_srcdir)\" | sed 's/[].[^$$\\\\*]/\\\\\\\\&/g'`; \\\n\tlist='$(DISTFILES)'; \\\n\t  dist_files=`for file in $$list; do echo $$file; done | \\\n\t  sed -e \"s|^$$srcdirstrip/||;t\" \\\n\t      -e \"s|^$$topsrcdirstrip/|$(top_builddir)/|;t\"`; \\\n\tcase $$dist_files in \\\n\t  */*) $(MKDIR_P) `echo \"$$dist_files\" | \\\n\t\t\t   sed '/\\//!d;s|^|$(distdir)/|;s,/[^/]*$$,,' | \\\n\t\t\t   sort -u` ;; \\\n\tesac; \\\n\tfor file in $$dist_files; do \\\n\t  if test -f $$file || test -d $$file; then d=.; else d=$(srcdir); fi; \\\n\t  if test -d $$d/$$file; then \\\n\t    dir=`echo \"/$$file\" | sed -e 's,/[^/]*$$,,'`; \\\n\t    if test -d \"$(distdir)/$$file\"; then \\\n\t      find \"$(distdir)/$$file\" -type d ! -perm -700 -exec chmod u+rwx {} \\;; \\\n\t    fi; \\\n\t    if test -d $(srcdir)/$$file && test $$d != $(srcdir); then \\\n\t      cp -fpR $(srcdir)/$$file \"$(distdir)$$dir\" || exit 1; \\\n\t      find \"$(distdir)/$$file\" -type d ! -perm -700 -exec chmod u+rwx {} \\;; \\\n\t    fi; \\\n\t    cp -fpR $$d/$$file \"$(distdir)$$dir\" || exit 1; \\\n\t  else \\\n\t    test -f \"$(distdir)/$$file\" \\\n\t    || cp -p $$d/$$file \"$(distdir)/$$file\" \\\n\t    || exit 1; \\\n\t  fi; \\\n\tdone\ncheck-am: all-am\ncheck: check-am\nall-am: Makefile $(LTLIBRARIES) $(PROGRAMS)\ninstall-binPROGRAMS: install-libLTLIBRARIES\n\ninstalldirs:\n\tfor dir in \"$(DESTDIR)$(libdir)\" \"$(DESTDIR)$(libfstdir)\" \"$(DESTDIR)$(bindir)\"; do \\\n\t  test -z \"$$dir\" || $(MKDIR_P) \"$$dir\"; \\\n\tdone\ninstall: install-am\ninstall-exec: install-exec-am\ninstall-data: install-data-am\nuninstall: uninstall-am\n\ninstall-am: all-am\n\t@$(MAKE) $(AM_MAKEFLAGS) install-exec-am install-data-am\n\ninstallcheck: installcheck-am\ninstall-strip:\n\tif test -z '$(STRIP)'; then \\\n\t  $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" \\\n\t    install_sh_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" INSTALL_STRIP_FLAG=-s \\\n\t      install; \\\n\telse \\\n\t  $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" \\\n\t    install_sh_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" INSTALL_STRIP_FLAG=-s \\\n\t    \"INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'\" install; \\\n\tfi\nmostlyclean-generic:\n\nclean-generic:\n\ndistclean-generic:\n\t-test -z \"$(CONFIG_CLEAN_FILES)\" || rm -f $(CONFIG_CLEAN_FILES)\n\t-test . = \"$(srcdir)\" || test -z \"$(CONFIG_CLEAN_VPATH_FILES)\" || rm -f $(CONFIG_CLEAN_VPATH_FILES)\n\nmaintainer-clean-generic:\n\t@echo \"This command is intended for maintainers to use\"\n\t@echo \"it deletes files that may require special tools to rebuild.\"\nclean: clean-am\n\nclean-am: clean-binPROGRAMS clean-generic clean-libLTLIBRARIES \\\n\tclean-libfstLTLIBRARIES clean-libtool mostlyclean-am\n\ndistclean: distclean-am\n\t-rm -rf ./$(DEPDIR)\n\t-rm -f Makefile\ndistclean-am: clean-am distclean-compile distclean-generic \\\n\tdistclean-tags\n\ndvi: dvi-am\n\ndvi-am:\n\nhtml: html-am\n\nhtml-am:\n\ninfo: info-am\n\ninfo-am:\n\ninstall-data-am: install-libfstLTLIBRARIES\n\ninstall-dvi: install-dvi-am\n\ninstall-dvi-am:\n\ninstall-exec-am: install-binPROGRAMS install-libLTLIBRARIES\n\ninstall-html: install-html-am\n\ninstall-html-am:\n\ninstall-info: install-info-am\n\ninstall-info-am:\n\ninstall-man:\n\ninstall-pdf: install-pdf-am\n\ninstall-pdf-am:\n\ninstall-ps: install-ps-am\n\ninstall-ps-am:\n\ninstallcheck-am:\n\nmaintainer-clean: maintainer-clean-am\n\t-rm -rf ./$(DEPDIR)\n\t-rm -f Makefile\nmaintainer-clean-am: distclean-am maintainer-clean-generic\n\nmostlyclean: mostlyclean-am\n\nmostlyclean-am: mostlyclean-compile mostlyclean-generic \\\n\tmostlyclean-libtool\n\npdf: pdf-am\n\npdf-am:\n\nps: ps-am\n\nps-am:\n\nuninstall-am: uninstall-binPROGRAMS uninstall-libLTLIBRARIES \\\n\tuninstall-libfstLTLIBRARIES\n\n.MAKE: install-am install-strip\n\n.PHONY: CTAGS GTAGS TAGS all all-am check check-am clean \\\n\tclean-binPROGRAMS clean-generic clean-libLTLIBRARIES \\\n\tclean-libfstLTLIBRARIES clean-libtool cscopelist-am ctags \\\n\tctags-am distclean distclean-compile distclean-generic \\\n\tdistclean-libtool distclean-tags distdir dvi dvi-am html \\\n\thtml-am info info-am install install-am install-binPROGRAMS \\\n\tinstall-data install-data-am install-dvi install-dvi-am \\\n\tinstall-exec install-exec-am install-html install-html-am \\\n\tinstall-info install-info-am install-libLTLIBRARIES \\\n\tinstall-libfstLTLIBRARIES install-man install-pdf \\\n\tinstall-pdf-am install-ps install-ps-am install-strip \\\n\tinstallcheck installcheck-am installdirs maintainer-clean \\\n\tmaintainer-clean-generic mostlyclean mostlyclean-compile \\\n\tmostlyclean-generic mostlyclean-libtool pdf pdf-am ps ps-am \\\n\ttags tags-am uninstall uninstall-am uninstall-binPROGRAMS \\\n\tuninstall-libLTLIBRARIES uninstall-libfstLTLIBRARIES\n\n.PRECIOUS: Makefile\n\n\n# Tell versions [3.59,3.63) of GNU make to not export all variables.\n# Otherwise a system limit (for SysV at least) may be exceeded.\n.NOEXPORT:\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/extensions/special/fstspecial.cc",
    "content": "// Work-around to correctly build (e.g. distclean) with autotools\n// using files in another directory that are also built there.\n// See https://stackoverflow.com/questions/30379837.\n\n#include \"fstconvert-main.cc\"   // NOLINT\n#include \"fstconvert.cc\"        // NOLINT\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/extensions/special/phi-fst.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/fst.h>\n#include <fst/extensions/special/phi-fst.h>\n\nDEFINE_int64(phi_fst_phi_label, 0,\n             \"Label of transitions to be interpreted as phi ('failure') \"\n              \"transitions\");\nDEFINE_bool(phi_fst_phi_loop, true,\n            \"When true, a phi self loop consumes a symbol\");\nDEFINE_string(phi_fst_rewrite_mode, \"auto\",\n              \"Rewrite both sides when matching? One of:\"\n              \" \\\"auto\\\" (rewrite iff acceptor), \\\"always\\\", \\\"never\\\"\");\n\nnamespace fst {\n\nconst char phi_fst_type[] = \"phi\";\nconst char input_phi_fst_type[] = \"input_phi\";\nconst char output_phi_fst_type[] = \"output_phi\";\n\nstatic FstRegisterer<StdPhiFst> PhiFst_StdArc_registerer;\nstatic FstRegisterer<LogPhiFst> PhiFst_LogArc_registerer;\nstatic FstRegisterer<Log64PhiFst> PhiFst_Log64Arc_registerer;\n\nstatic FstRegisterer<StdInputPhiFst> InputPhiFst_StdArc_registerer;\nstatic FstRegisterer<LogInputPhiFst> InputPhiFst_LogArc_registerer;\nstatic FstRegisterer<Log64InputPhiFst> InputPhiFst_Log64Arc_registerer;\n\nstatic FstRegisterer<StdOutputPhiFst> OutputPhiFst_StdArc_registerer;\nstatic FstRegisterer<LogOutputPhiFst> OutputPhiFst_LogArc_registerer;\nstatic FstRegisterer<Log64OutputPhiFst> OutputPhiFst_Log64Arc_registerer;\n\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/extensions/special/rho-fst.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/extensions/special/rho-fst.h>\n\n#include <fst/fst.h>\n\nDEFINE_int64(rho_fst_rho_label, 0,\n             \"Label of transitions to be interpreted as rho ('rest') \"\n             \"transitions\");\nDEFINE_string(rho_fst_rewrite_mode, \"auto\",\n              \"Rewrite both sides when matching? One of:\"\n              \" \\\"auto\\\" (rewrite iff acceptor), \\\"always\\\", \\\"never\\\"\");\n\nnamespace fst {\n\nconst char rho_fst_type[] = \"rho\";\nconst char input_rho_fst_type[] = \"input_rho\";\nconst char output_rho_fst_type[] = \"output_rho\";\n\nstatic FstRegisterer<StdRhoFst> RhoFst_StdArc_registerer;\nstatic FstRegisterer<LogRhoFst> RhoFst_LogArc_registerer;\nstatic FstRegisterer<Log64RhoFst> RhoFst_Log64Arc_registerer;\n\nstatic FstRegisterer<StdInputRhoFst> InputRhoFst_StdArc_registerer;\nstatic FstRegisterer<LogInputRhoFst> InputRhoFst_LogArc_registerer;\nstatic FstRegisterer<Log64InputRhoFst> InputRhoFst_Log64Arc_registerer;\n\nstatic FstRegisterer<StdOutputRhoFst> OutputRhoFst_StdArc_registerer;\nstatic FstRegisterer<LogOutputRhoFst> OutputRhoFst_LogArc_registerer;\nstatic FstRegisterer<Log64OutputRhoFst> OutputRhoFst_Log64Arc_registerer;\n\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/extensions/special/sigma-fst.cc",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#include <fst/extensions/special/sigma-fst.h>\n\n#include <fst/fst.h>\n\nDEFINE_int64(sigma_fst_sigma_label, 0,\n             \"Label of transitions to be interpreted as sigma ('any') \"\n             \"transitions\");\nDEFINE_string(sigma_fst_rewrite_mode, \"auto\",\n              \"Rewrite both sides when matching? One of:\"\n              \" \\\"auto\\\" (rewrite iff acceptor), \\\"always\\\", \\\"never\\\"\");\n\nnamespace fst {\n\nconst char sigma_fst_type[] = \"sigma\";\nconst char input_sigma_fst_type[] = \"input_sigma\";\nconst char output_sigma_fst_type[] = \"output_sigma\";\n\nstatic FstRegisterer<StdSigmaFst> SigmaFst_StdArc_registerer;\nstatic FstRegisterer<LogSigmaFst> SigmaFst_LogArc_registerer;\nstatic FstRegisterer<Log64SigmaFst> SigmaFst_Log64Arc_registerer;\n\nstatic FstRegisterer<StdInputSigmaFst> InputSigmaFst_StdArc_registerer;\nstatic FstRegisterer<LogInputSigmaFst> InputSigmaFst_LogArc_registerer;\nstatic FstRegisterer<Log64InputSigmaFst> InputSigmaFst_Log64Arc_registerer;\n\nstatic FstRegisterer<StdOutputSigmaFst> OutputSigmaFst_StdArc_registerer;\nstatic FstRegisterer<LogOutputSigmaFst> OutputSigmaFst_LogArc_registerer;\nstatic FstRegisterer<Log64OutputSigmaFst> OutputSigmaFst_Log64Arc_registerer;\n\n}  // namespace fst\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/Makefile.am",
    "content": "if HAVE_COMPRESS\ncompress_include_headers = fst/extensions/compress/compress.h \\\nfst/extensions/compress/compress-script.h fst/extensions/compress/gzfile.h \\\nfst/extensions/compress/elias.h fst/extensions/compress/randmod.h\nendif\n\nif HAVE_FAR\nfar_include_headers = fst/extensions/far/compile-strings.h \\\nfst/extensions/far/create.h fst/extensions/far/equal.h \\\nfst/extensions/far/extract.h fst/extensions/far/far.h \\\nfst/extensions/far/far-class.h fst/extensions/far/farlib.h \\\nfst/extensions/far/farscript.h fst/extensions/far/getters.h \\\nfst/extensions/far/info.h fst/extensions/far/isomorphic.h \\\nfst/extensions/far/print-strings.h fst/extensions/far/script-impl.h \\\nfst/extensions/far/stlist.h fst/extensions/far/sttable.h\nendif\n\nif HAVE_LINEAR\nlinear_include_headers = fst/extensions/linear/linear-fst-data-builder.h \\\nfst/extensions/linear/linear-fst-data.h fst/extensions/linear/linear-fst.h \\\nfst/extensions/linear/linearscript.h fst/extensions/linear/loglinear-apply.h \\\nfst/extensions/linear/trie.h\nendif\n\nif HAVE_MPDT\nmpdt_include_headers = fst/extensions/mpdt/compose.h \\\nfst/extensions/mpdt/expand.h fst/extensions/mpdt/info.h \\\nfst/extensions/mpdt/mpdt.h fst/extensions/mpdt/mpdtlib.h \\\nfst/extensions/mpdt/mpdtscript.h fst/extensions/mpdt/read_write_utils.h \\\nfst/extensions/mpdt/reverse.h\nendif\n\nif HAVE_NGRAM\nngram_include_headers = fst/extensions/ngram/bitmap-index.h \\\nfst/extensions/ngram/ngram-fst.h fst/extensions/ngram/nthbit.h\nendif\n\nif HAVE_PDT\npdt_include_headers = fst/extensions/pdt/collection.h \\\nfst/extensions/pdt/compose.h fst/extensions/pdt/expand.h \\\nfst/extensions/pdt/getters.h fst/extensions/pdt/info.h \\\nfst/extensions/pdt/paren.h fst/extensions/pdt/pdt.h \\\nfst/extensions/pdt/pdtlib.h fst/extensions/pdt/pdtscript.h \\\nfst/extensions/pdt/replace.h fst/extensions/pdt/reverse.h \\\nfst/extensions/pdt/shortest-path.h\nendif\n\nif HAVE_SPECIAL\nspecial_include_headers = fst/extensions/special/phi-fst.h \\\nfst/extensions/special/rho-fst.h fst/extensions/special/sigma-fst.h\nendif\n\nif HAVE_GRM\nfar_include_headers = fst/extensions/far/compile-strings.h \\\nfst/extensions/far/create.h fst/extensions/far/equal.h \\\nfst/extensions/far/extract.h fst/extensions/far/far.h \\\nfst/extensions/far/far-class.h fst/extensions/far/farlib.h \\\nfst/extensions/far/farscript.h fst/extensions/far/getters.h \\\nfst/extensions/far/info.h fst/extensions/far/isomorphic.h \\\nfst/extensions/far/print-strings.h fst/extensions/far/script-impl.h \\\nfst/extensions/far/stlist.h fst/extensions/far/sttable.h\nmpdt_include_headers = fst/extensions/mpdt/compose.h \\\nfst/extensions/mpdt/expand.h fst/extensions/mpdt/info.h \\\nfst/extensions/mpdt/mpdt.h fst/extensions/mpdt/mpdtlib.h \\\nfst/extensions/mpdt/mpdtscript.h fst/extensions/mpdt/read_write_utils.h \\\nfst/extensions/mpdt/reverse.h\npdt_include_headers = fst/extensions/pdt/collection.h \\\nfst/extensions/pdt/compose.h fst/extensions/pdt/expand.h \\\nfst/extensions/pdt/getters.h fst/extensions/pdt/info.h \\\nfst/extensions/pdt/paren.h fst/extensions/pdt/pdt.h \\\nfst/extensions/pdt/pdtlib.h fst/extensions/pdt/pdtscript.h \\\nfst/extensions/pdt/replace.h fst/extensions/pdt/reverse.h \\\nfst/extensions/pdt/shortest-path.h\nendif\n\nscript_include_headers = fst/script/arc-class.h \\\nfst/script/arciterator-class.h fst/script/arcsort.h \\\nfst/script/arg-packs.h fst/script/closure.h fst/script/compile-impl.h \\\nfst/script/compile.h fst/script/compose.h fst/script/concat.h \\\nfst/script/connect.h fst/script/convert.h fst/script/decode.h \\\nfst/script/determinize.h fst/script/difference.h fst/script/disambiguate.h \\\nfst/script/draw-impl.h fst/script/draw.h fst/script/encode.h \\\nfst/script/encodemapper-class.h fst/script/epsnormalize.h fst/script/equal.h \\\nfst/script/equivalent.h fst/script/fst-class.h fst/script/fstscript.h \\\nfst/script/getters.h fst/script/info-impl.h fst/script/info.h \\\nfst/script/intersect.h fst/script/invert.h fst/script/isomorphic.h \\\nfst/script/map.h fst/script/minimize.h fst/script/print-impl.h \\\nfst/script/print.h fst/script/project.h fst/script/prune.h \\\nfst/script/push.h fst/script/randequivalent.h fst/script/randgen.h \\\nfst/script/register.h fst/script/relabel.h fst/script/replace.h \\\nfst/script/reverse.h fst/script/reweight.h fst/script/rmepsilon.h \\\nfst/script/script-impl.h fst/script/shortest-distance.h \\\nfst/script/shortest-path.h fst/script/stateiterator-class.h \\\nfst/script/synchronize.h fst/script/text-io.h fst/script/topsort.h \\\nfst/script/union.h fst/script/weight-class.h fst/script/fstscript-decl.h \\\nfst/script/verify.h\n\ntest_include_headers = fst/test/algo_test.h fst/test/fst_test.h \\\nfst/test/rand-fst.h fst/test/weight-tester.h\n\nnobase_include_HEADERS = fst/accumulator.h fst/add-on.h fst/arc-arena.h \\\nfst/arc-map.h fst/arc.h fst/arcfilter.h fst/arcsort.h fst/bi-table.h \\\nfst/cache.h fst/closure.h fst/compact-fst.h fst/compat.h fst/complement.h \\\nfst/compose-filter.h fst/compose.h fst/concat.h fst/config.h fst/connect.h \\\nfst/const-fst.h fst/determinize.h fst/dfs-visit.h fst/difference.h \\\nfst/disambiguate.h fst/edit-fst.h fst/encode.h fst/epsnormalize.h fst/equal.h \\\nfst/equivalent.h fst/expanded-fst.h fst/expectation-weight.h \\\nfst/factor-weight.h fst/filter-state.h fst/flags.h fst/float-weight.h \\\nfst/fst-decl.h fst/fst.h fst/fstlib.h fst/generic-register.h fst/heap.h \\\nfst/icu.h fst/intersect.h fst/interval-set.h fst/invert.h fst/isomorphic.h \\\nfst/label-reachable.h fst/lexicographic-weight.h fst/lock.h fst/log.h \\\nfst/lookahead-filter.h fst/lookahead-matcher.h fst/map.h fst/mapped-file.h \\\nfst/matcher-fst.h fst/matcher.h fst/memory.h fst/minimize.h fst/mutable-fst.h \\\nfst/pair-weight.h fst/partition.h fst/power-weight.h fst/product-weight.h \\\nfst/project.h fst/properties.h fst/prune.h fst/push.h fst/queue.h \\\nfst/randequivalent.h fst/randgen.h fst/rational.h fst/register.h \\\nfst/relabel.h fst/replace-util.h fst/replace.h fst/reverse.h fst/reweight.h \\\nfst/rmepsilon.h fst/rmfinalepsilon.h fst/set-weight.h fst/shortest-distance.h \\\nfst/shortest-path.h fst/signed-log-weight.h fst/sparse-power-weight.h \\\nfst/sparse-tuple-weight.h fst/state-map.h fst/state-reachable.h \\\nfst/state-table.h fst/statesort.h fst/string-weight.h fst/string.h \\\nfst/symbol-table-ops.h fst/symbol-table.h fst/synchronize.h \\\nfst/test-properties.h fst/topsort.h fst/tuple-weight.h fst/types.h \\\nfst/union-find.h fst/union-weight.h fst/union.h fst/util.h fst/vector-fst.h \\\nfst/verify.h fst/visit.h fst/weight.h \\\n$(compress_include_headers) \\\n$(far_include_headers) \\\n$(linear_include_headers) \\\n$(mpdt_include_headers) \\\n$(ngram_include_headers) \\\n$(pdt_include_headers) \\\n$(script_include_headers) \\\n$(special_include_headers) \\\n$(test_include_headers)\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/Makefile.in",
    "content": "# Makefile.in generated by automake 1.15.1 from Makefile.am.\n# @configure_input@\n\n# Copyright (C) 1994-2017 Free Software Foundation, Inc.\n\n# This Makefile.in is free software; the Free Software Foundation\n# gives unlimited permission to copy and/or distribute it,\n# with or without modifications, as long as this notice is preserved.\n\n# This program is distributed in the hope that it will be useful,\n# but WITHOUT ANY WARRANTY, to the extent permitted by law; without\n# even the implied warranty of MERCHANTABILITY or FITNESS FOR A\n# PARTICULAR PURPOSE.\n\n@SET_MAKE@\n\nVPATH = @srcdir@\nam__is_gnu_make = { \\\n  if test -z '$(MAKELEVEL)'; then \\\n    false; \\\n  elif test -n '$(MAKE_HOST)'; then \\\n    true; \\\n  elif test -n '$(MAKE_VERSION)' && test -n '$(CURDIR)'; then \\\n    true; \\\n  else \\\n    false; \\\n  fi; \\\n}\nam__make_running_with_option = \\\n  case $${target_option-} in \\\n      ?) ;; \\\n      *) echo \"am__make_running_with_option: internal error: invalid\" \\\n              \"target option '$${target_option-}' specified\" >&2; \\\n         exit 1;; \\\n  esac; \\\n  has_opt=no; \\\n  sane_makeflags=$$MAKEFLAGS; \\\n  if $(am__is_gnu_make); then \\\n    sane_makeflags=$$MFLAGS; \\\n  else \\\n    case $$MAKEFLAGS in \\\n      *\\\\[\\ \\\t]*) \\\n        bs=\\\\; \\\n        sane_makeflags=`printf '%s\\n' \"$$MAKEFLAGS\" \\\n          | sed \"s/$$bs$$bs[$$bs $$bs\t]*//g\"`;; \\\n    esac; \\\n  fi; \\\n  skip_next=no; \\\n  strip_trailopt () \\\n  { \\\n    flg=`printf '%s\\n' \"$$flg\" | sed \"s/$$1.*$$//\"`; \\\n  }; \\\n  for flg in $$sane_makeflags; do \\\n    test $$skip_next = yes && { skip_next=no; continue; }; \\\n    case $$flg in \\\n      *=*|--*) continue;; \\\n        -*I) strip_trailopt 'I'; skip_next=yes;; \\\n      -*I?*) strip_trailopt 'I';; \\\n        -*O) strip_trailopt 'O'; skip_next=yes;; \\\n      -*O?*) strip_trailopt 'O';; \\\n        -*l) strip_trailopt 'l'; skip_next=yes;; \\\n      -*l?*) strip_trailopt 'l';; \\\n      -[dEDm]) skip_next=yes;; \\\n      -[JT]) skip_next=yes;; \\\n    esac; \\\n    case $$flg in \\\n      *$$target_option*) has_opt=yes; break;; \\\n    esac; \\\n  done; \\\n  test $$has_opt = yes\nam__make_dryrun = (target_option=n; $(am__make_running_with_option))\nam__make_keepgoing = (target_option=k; $(am__make_running_with_option))\npkgdatadir = $(datadir)/@PACKAGE@\npkgincludedir = $(includedir)/@PACKAGE@\npkglibdir = $(libdir)/@PACKAGE@\npkglibexecdir = $(libexecdir)/@PACKAGE@\nam__cd = CDPATH=\"$${ZSH_VERSION+.}$(PATH_SEPARATOR)\" && cd\ninstall_sh_DATA = $(install_sh) -c -m 644\ninstall_sh_PROGRAM = $(install_sh) -c\ninstall_sh_SCRIPT = $(install_sh) -c\nINSTALL_HEADER = $(INSTALL_DATA)\ntransform = $(program_transform_name)\nNORMAL_INSTALL = :\nPRE_INSTALL = :\nPOST_INSTALL = :\nNORMAL_UNINSTALL = :\nPRE_UNINSTALL = :\nPOST_UNINSTALL = :\nbuild_triplet = @build@\nhost_triplet = @host@\nsubdir = src/include\nACLOCAL_M4 = $(top_srcdir)/aclocal.m4\nam__aclocal_m4_deps = $(top_srcdir)/m4/ac_python_devel.m4 \\\n\t$(top_srcdir)/m4/libtool.m4 $(top_srcdir)/m4/ltoptions.m4 \\\n\t$(top_srcdir)/m4/ltsugar.m4 $(top_srcdir)/m4/ltversion.m4 \\\n\t$(top_srcdir)/m4/lt~obsolete.m4 $(top_srcdir)/configure.ac\nam__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \\\n\t$(ACLOCAL_M4)\nDIST_COMMON = $(srcdir)/Makefile.am $(am__nobase_include_HEADERS_DIST) \\\n\t$(am__DIST_COMMON)\nmkinstalldirs = $(install_sh) -d\nCONFIG_HEADER = $(top_builddir)/config.h \\\n\t$(top_builddir)/src/include/fst/config.h\nCONFIG_CLEAN_FILES =\nCONFIG_CLEAN_VPATH_FILES =\nAM_V_P = $(am__v_P_@AM_V@)\nam__v_P_ = $(am__v_P_@AM_DEFAULT_V@)\nam__v_P_0 = false\nam__v_P_1 = :\nAM_V_GEN = $(am__v_GEN_@AM_V@)\nam__v_GEN_ = $(am__v_GEN_@AM_DEFAULT_V@)\nam__v_GEN_0 = @echo \"  GEN     \" $@;\nam__v_GEN_1 = \nAM_V_at = $(am__v_at_@AM_V@)\nam__v_at_ = $(am__v_at_@AM_DEFAULT_V@)\nam__v_at_0 = @\nam__v_at_1 = \nSOURCES =\nDIST_SOURCES =\nam__can_run_installinfo = \\\n  case $$AM_UPDATE_INFO_DIR in \\\n    n|no|NO) false;; \\\n    *) (install-info --version) >/dev/null 2>&1;; \\\n  esac\nam__nobase_include_HEADERS_DIST = fst/accumulator.h fst/add-on.h \\\n\tfst/arc-arena.h fst/arc-map.h fst/arc.h fst/arcfilter.h \\\n\tfst/arcsort.h fst/bi-table.h fst/cache.h fst/closure.h \\\n\tfst/compact-fst.h fst/compat.h fst/complement.h \\\n\tfst/compose-filter.h fst/compose.h fst/concat.h fst/config.h \\\n\tfst/connect.h fst/const-fst.h fst/determinize.h \\\n\tfst/dfs-visit.h fst/difference.h fst/disambiguate.h \\\n\tfst/edit-fst.h fst/encode.h fst/epsnormalize.h fst/equal.h \\\n\tfst/equivalent.h fst/expanded-fst.h fst/expectation-weight.h \\\n\tfst/factor-weight.h fst/filter-state.h fst/flags.h \\\n\tfst/float-weight.h fst/fst-decl.h fst/fst.h fst/fstlib.h \\\n\tfst/generic-register.h fst/heap.h fst/icu.h fst/intersect.h \\\n\tfst/interval-set.h fst/invert.h fst/isomorphic.h \\\n\tfst/label-reachable.h fst/lexicographic-weight.h fst/lock.h \\\n\tfst/log.h fst/lookahead-filter.h fst/lookahead-matcher.h \\\n\tfst/map.h fst/mapped-file.h fst/matcher-fst.h fst/matcher.h \\\n\tfst/memory.h fst/minimize.h fst/mutable-fst.h \\\n\tfst/pair-weight.h fst/partition.h fst/power-weight.h \\\n\tfst/product-weight.h fst/project.h fst/properties.h \\\n\tfst/prune.h fst/push.h fst/queue.h fst/randequivalent.h \\\n\tfst/randgen.h fst/rational.h fst/register.h fst/relabel.h \\\n\tfst/replace-util.h fst/replace.h fst/reverse.h fst/reweight.h \\\n\tfst/rmepsilon.h fst/rmfinalepsilon.h fst/set-weight.h \\\n\tfst/shortest-distance.h fst/shortest-path.h \\\n\tfst/signed-log-weight.h fst/sparse-power-weight.h \\\n\tfst/sparse-tuple-weight.h fst/state-map.h \\\n\tfst/state-reachable.h fst/state-table.h fst/statesort.h \\\n\tfst/string-weight.h fst/string.h fst/symbol-table-ops.h \\\n\tfst/symbol-table.h fst/synchronize.h fst/test-properties.h \\\n\tfst/topsort.h fst/tuple-weight.h fst/types.h fst/union-find.h \\\n\tfst/union-weight.h fst/union.h fst/util.h fst/vector-fst.h \\\n\tfst/verify.h fst/visit.h fst/weight.h \\\n\tfst/extensions/compress/compress.h \\\n\tfst/extensions/compress/compress-script.h \\\n\tfst/extensions/compress/gzfile.h \\\n\tfst/extensions/compress/elias.h \\\n\tfst/extensions/compress/randmod.h \\\n\tfst/extensions/far/compile-strings.h \\\n\tfst/extensions/far/create.h fst/extensions/far/equal.h \\\n\tfst/extensions/far/extract.h fst/extensions/far/far.h \\\n\tfst/extensions/far/far-class.h fst/extensions/far/farlib.h \\\n\tfst/extensions/far/farscript.h fst/extensions/far/getters.h \\\n\tfst/extensions/far/info.h fst/extensions/far/isomorphic.h \\\n\tfst/extensions/far/print-strings.h \\\n\tfst/extensions/far/script-impl.h fst/extensions/far/stlist.h \\\n\tfst/extensions/far/sttable.h \\\n\tfst/extensions/linear/linear-fst-data-builder.h \\\n\tfst/extensions/linear/linear-fst-data.h \\\n\tfst/extensions/linear/linear-fst.h \\\n\tfst/extensions/linear/linearscript.h \\\n\tfst/extensions/linear/loglinear-apply.h \\\n\tfst/extensions/linear/trie.h fst/extensions/mpdt/compose.h \\\n\tfst/extensions/mpdt/expand.h fst/extensions/mpdt/info.h \\\n\tfst/extensions/mpdt/mpdt.h fst/extensions/mpdt/mpdtlib.h \\\n\tfst/extensions/mpdt/mpdtscript.h \\\n\tfst/extensions/mpdt/read_write_utils.h \\\n\tfst/extensions/mpdt/reverse.h \\\n\tfst/extensions/ngram/bitmap-index.h \\\n\tfst/extensions/ngram/ngram-fst.h fst/extensions/ngram/nthbit.h \\\n\tfst/extensions/pdt/collection.h fst/extensions/pdt/compose.h \\\n\tfst/extensions/pdt/expand.h fst/extensions/pdt/getters.h \\\n\tfst/extensions/pdt/info.h fst/extensions/pdt/paren.h \\\n\tfst/extensions/pdt/pdt.h fst/extensions/pdt/pdtlib.h \\\n\tfst/extensions/pdt/pdtscript.h fst/extensions/pdt/replace.h \\\n\tfst/extensions/pdt/reverse.h \\\n\tfst/extensions/pdt/shortest-path.h fst/script/arc-class.h \\\n\tfst/script/arciterator-class.h fst/script/arcsort.h \\\n\tfst/script/arg-packs.h fst/script/closure.h \\\n\tfst/script/compile-impl.h fst/script/compile.h \\\n\tfst/script/compose.h fst/script/concat.h fst/script/connect.h \\\n\tfst/script/convert.h fst/script/decode.h \\\n\tfst/script/determinize.h fst/script/difference.h \\\n\tfst/script/disambiguate.h fst/script/draw-impl.h \\\n\tfst/script/draw.h fst/script/encode.h \\\n\tfst/script/encodemapper-class.h fst/script/epsnormalize.h \\\n\tfst/script/equal.h fst/script/equivalent.h \\\n\tfst/script/fst-class.h fst/script/fstscript.h \\\n\tfst/script/getters.h fst/script/info-impl.h fst/script/info.h \\\n\tfst/script/intersect.h fst/script/invert.h \\\n\tfst/script/isomorphic.h fst/script/map.h fst/script/minimize.h \\\n\tfst/script/print-impl.h fst/script/print.h \\\n\tfst/script/project.h fst/script/prune.h fst/script/push.h \\\n\tfst/script/randequivalent.h fst/script/randgen.h \\\n\tfst/script/register.h fst/script/relabel.h \\\n\tfst/script/replace.h fst/script/reverse.h \\\n\tfst/script/reweight.h fst/script/rmepsilon.h \\\n\tfst/script/script-impl.h fst/script/shortest-distance.h \\\n\tfst/script/shortest-path.h fst/script/stateiterator-class.h \\\n\tfst/script/synchronize.h fst/script/text-io.h \\\n\tfst/script/topsort.h fst/script/union.h \\\n\tfst/script/weight-class.h fst/script/fstscript-decl.h \\\n\tfst/script/verify.h fst/extensions/special/phi-fst.h \\\n\tfst/extensions/special/rho-fst.h \\\n\tfst/extensions/special/sigma-fst.h fst/test/algo_test.h \\\n\tfst/test/fst_test.h fst/test/rand-fst.h \\\n\tfst/test/weight-tester.h\nam__vpath_adj_setup = srcdirstrip=`echo \"$(srcdir)\" | sed 's|.|.|g'`;\nam__vpath_adj = case $$p in \\\n    $(srcdir)/*) f=`echo \"$$p\" | sed \"s|^$$srcdirstrip/||\"`;; \\\n    *) f=$$p;; \\\n  esac;\nam__strip_dir = f=`echo $$p | sed -e 's|^.*/||'`;\nam__install_max = 40\nam__nobase_strip_setup = \\\n  srcdirstrip=`echo \"$(srcdir)\" | sed 's/[].[^$$\\\\*|]/\\\\\\\\&/g'`\nam__nobase_strip = \\\n  for p in $$list; do echo \"$$p\"; done | sed -e \"s|$$srcdirstrip/||\"\nam__nobase_list = $(am__nobase_strip_setup); \\\n  for p in $$list; do echo \"$$p $$p\"; done | \\\n  sed \"s| $$srcdirstrip/| |;\"' / .*\\//!s/ .*/ ./; s,\\( .*\\)/[^/]*$$,\\1,' | \\\n  $(AWK) 'BEGIN { files[\".\"] = \"\" } { files[$$2] = files[$$2] \" \" $$1; \\\n    if (++n[$$2] == $(am__install_max)) \\\n      { print $$2, files[$$2]; n[$$2] = 0; files[$$2] = \"\" } } \\\n    END { for (dir in files) print dir, files[dir] }'\nam__base_list = \\\n  sed '$$!N;$$!N;$$!N;$$!N;$$!N;$$!N;$$!N;s/\\n/ /g' | \\\n  sed '$$!N;$$!N;$$!N;$$!N;s/\\n/ /g'\nam__uninstall_files_from_dir = { \\\n  test -z \"$$files\" \\\n    || { test ! -d \"$$dir\" && test ! -f \"$$dir\" && test ! -r \"$$dir\"; } \\\n    || { echo \" ( cd '$$dir' && rm -f\" $$files \")\"; \\\n         $(am__cd) \"$$dir\" && rm -f $$files; }; \\\n  }\nam__installdirs = \"$(DESTDIR)$(includedir)\"\nHEADERS = $(nobase_include_HEADERS)\nam__tagged_files = $(HEADERS) $(SOURCES) $(TAGS_FILES) $(LISP)\n# Read a list of newline-separated strings from the standard input,\n# and print each of them once, without duplicates.  Input order is\n# *not* preserved.\nam__uniquify_input = $(AWK) '\\\n  BEGIN { nonempty = 0; } \\\n  { items[$$0] = 1; nonempty = 1; } \\\n  END { if (nonempty) { for (i in items) print i; }; } \\\n'\n# Make sure the list of sources is unique.  This is necessary because,\n# e.g., the same source file might be shared among _SOURCES variables\n# for different programs/libraries.\nam__define_uniq_tagged_files = \\\n  list='$(am__tagged_files)'; \\\n  unique=`for i in $$list; do \\\n    if test -f \"$$i\"; then echo $$i; else echo $(srcdir)/$$i; fi; \\\n  done | $(am__uniquify_input)`\nETAGS = etags\nCTAGS = ctags\nam__DIST_COMMON = $(srcdir)/Makefile.in\nDISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST)\nACLOCAL = @ACLOCAL@\nAMTAR = @AMTAR@\nAM_DEFAULT_VERBOSITY = @AM_DEFAULT_VERBOSITY@\nAR = @AR@\nAUTOCONF = @AUTOCONF@\nAUTOHEADER = @AUTOHEADER@\nAUTOMAKE = @AUTOMAKE@\nAWK = @AWK@\nCC = @CC@\nCCDEPMODE = @CCDEPMODE@\nCFLAGS = @CFLAGS@\nCPP = @CPP@\nCPPFLAGS = @CPPFLAGS@\nCXX = @CXX@\nCXXCPP = @CXXCPP@\nCXXDEPMODE = @CXXDEPMODE@\nCXXFLAGS = @CXXFLAGS@\nCYGPATH_W = @CYGPATH_W@\nDEFS = @DEFS@\nDEPDIR = @DEPDIR@\nDLLTOOL = @DLLTOOL@\nDL_LIBS = @DL_LIBS@\nDSYMUTIL = @DSYMUTIL@\nDUMPBIN = @DUMPBIN@\nECHO_C = @ECHO_C@\nECHO_N = @ECHO_N@\nECHO_T = @ECHO_T@\nEGREP = @EGREP@\nEXEEXT = @EXEEXT@\nFGREP = @FGREP@\nGREP = @GREP@\nINSTALL = @INSTALL@\nINSTALL_DATA = @INSTALL_DATA@\nINSTALL_PROGRAM = @INSTALL_PROGRAM@\nINSTALL_SCRIPT = @INSTALL_SCRIPT@\nINSTALL_STRIP_PROGRAM = @INSTALL_STRIP_PROGRAM@\nLD = @LD@\nLDFLAGS = @LDFLAGS@\nLIBOBJS = @LIBOBJS@\nLIBS = @LIBS@\nLIBTOOL = @LIBTOOL@\nLIPO = @LIPO@\nLN_S = @LN_S@\nLTLIBOBJS = @LTLIBOBJS@\nLT_SYS_LIBRARY_PATH = @LT_SYS_LIBRARY_PATH@\nMAKEINFO = @MAKEINFO@\nMANIFEST_TOOL = @MANIFEST_TOOL@\nMKDIR_P = @MKDIR_P@\nNM = @NM@\nNMEDIT = @NMEDIT@\nOBJDUMP = @OBJDUMP@\nOBJEXT = @OBJEXT@\nOTOOL = @OTOOL@\nOTOOL64 = @OTOOL64@\nPACKAGE = @PACKAGE@\nPACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@\nPACKAGE_NAME = @PACKAGE_NAME@\nPACKAGE_STRING = @PACKAGE_STRING@\nPACKAGE_TARNAME = @PACKAGE_TARNAME@\nPACKAGE_URL = @PACKAGE_URL@\nPACKAGE_VERSION = @PACKAGE_VERSION@\nPATH_SEPARATOR = @PATH_SEPARATOR@\nPYTHON = @PYTHON@\nPYTHON_CPPFLAGS = @PYTHON_CPPFLAGS@\nPYTHON_EXEC_PREFIX = @PYTHON_EXEC_PREFIX@\nPYTHON_EXTRA_LDFLAGS = @PYTHON_EXTRA_LDFLAGS@\nPYTHON_EXTRA_LIBS = @PYTHON_EXTRA_LIBS@\nPYTHON_LDFLAGS = @PYTHON_LDFLAGS@\nPYTHON_PLATFORM = @PYTHON_PLATFORM@\nPYTHON_PREFIX = @PYTHON_PREFIX@\nPYTHON_SITE_PKG = @PYTHON_SITE_PKG@\nPYTHON_VERSION = @PYTHON_VERSION@\nRANLIB = @RANLIB@\nSED = @SED@\nSET_MAKE = @SET_MAKE@\nSHELL = @SHELL@\nSTRIP = @STRIP@\nVERSION = @VERSION@\nabs_builddir = @abs_builddir@\nabs_srcdir = @abs_srcdir@\nabs_top_builddir = @abs_top_builddir@\nabs_top_srcdir = @abs_top_srcdir@\nac_ct_AR = @ac_ct_AR@\nac_ct_CC = @ac_ct_CC@\nac_ct_CXX = @ac_ct_CXX@\nac_ct_DUMPBIN = @ac_ct_DUMPBIN@\nam__include = @am__include@\nam__leading_dot = @am__leading_dot@\nam__quote = @am__quote@\nam__tar = @am__tar@\nam__untar = @am__untar@\nbindir = @bindir@\nbuild = @build@\nbuild_alias = @build_alias@\nbuild_cpu = @build_cpu@\nbuild_os = @build_os@\nbuild_vendor = @build_vendor@\nbuilddir = @builddir@\ndatadir = @datadir@\ndatarootdir = @datarootdir@\ndocdir = @docdir@\ndvidir = @dvidir@\nexec_prefix = @exec_prefix@\nhost = @host@\nhost_alias = @host_alias@\nhost_cpu = @host_cpu@\nhost_os = @host_os@\nhost_vendor = @host_vendor@\nhtmldir = @htmldir@\nincludedir = @includedir@\ninfodir = @infodir@\ninstall_sh = @install_sh@\nlibdir = @libdir@\nlibexecdir = @libexecdir@\nlibfstdir = @libfstdir@\nlocaledir = @localedir@\nlocalstatedir = @localstatedir@\nmandir = @mandir@\nmkdir_p = @mkdir_p@\noldincludedir = @oldincludedir@\npdfdir = @pdfdir@\npkgpyexecdir = @pkgpyexecdir@\npkgpythondir = @pkgpythondir@\nprefix = @prefix@\nprogram_transform_name = @program_transform_name@\npsdir = @psdir@\npyexecdir = @pyexecdir@\npythondir = @pythondir@\nrunstatedir = @runstatedir@\nsbindir = @sbindir@\nsharedstatedir = @sharedstatedir@\nsrcdir = @srcdir@\nsysconfdir = @sysconfdir@\ntarget_alias = @target_alias@\ntop_build_prefix = @top_build_prefix@\ntop_builddir = @top_builddir@\ntop_srcdir = @top_srcdir@\n@HAVE_COMPRESS_TRUE@compress_include_headers = fst/extensions/compress/compress.h \\\n@HAVE_COMPRESS_TRUE@fst/extensions/compress/compress-script.h fst/extensions/compress/gzfile.h \\\n@HAVE_COMPRESS_TRUE@fst/extensions/compress/elias.h fst/extensions/compress/randmod.h\n\n@HAVE_FAR_TRUE@far_include_headers = fst/extensions/far/compile-strings.h \\\n@HAVE_FAR_TRUE@fst/extensions/far/create.h fst/extensions/far/equal.h \\\n@HAVE_FAR_TRUE@fst/extensions/far/extract.h fst/extensions/far/far.h \\\n@HAVE_FAR_TRUE@fst/extensions/far/far-class.h fst/extensions/far/farlib.h \\\n@HAVE_FAR_TRUE@fst/extensions/far/farscript.h fst/extensions/far/getters.h \\\n@HAVE_FAR_TRUE@fst/extensions/far/info.h fst/extensions/far/isomorphic.h \\\n@HAVE_FAR_TRUE@fst/extensions/far/print-strings.h fst/extensions/far/script-impl.h \\\n@HAVE_FAR_TRUE@fst/extensions/far/stlist.h fst/extensions/far/sttable.h\n\n@HAVE_GRM_TRUE@far_include_headers = fst/extensions/far/compile-strings.h \\\n@HAVE_GRM_TRUE@fst/extensions/far/create.h fst/extensions/far/equal.h \\\n@HAVE_GRM_TRUE@fst/extensions/far/extract.h fst/extensions/far/far.h \\\n@HAVE_GRM_TRUE@fst/extensions/far/far-class.h fst/extensions/far/farlib.h \\\n@HAVE_GRM_TRUE@fst/extensions/far/farscript.h fst/extensions/far/getters.h \\\n@HAVE_GRM_TRUE@fst/extensions/far/info.h fst/extensions/far/isomorphic.h \\\n@HAVE_GRM_TRUE@fst/extensions/far/print-strings.h fst/extensions/far/script-impl.h \\\n@HAVE_GRM_TRUE@fst/extensions/far/stlist.h fst/extensions/far/sttable.h\n\n@HAVE_LINEAR_TRUE@linear_include_headers = fst/extensions/linear/linear-fst-data-builder.h \\\n@HAVE_LINEAR_TRUE@fst/extensions/linear/linear-fst-data.h fst/extensions/linear/linear-fst.h \\\n@HAVE_LINEAR_TRUE@fst/extensions/linear/linearscript.h fst/extensions/linear/loglinear-apply.h \\\n@HAVE_LINEAR_TRUE@fst/extensions/linear/trie.h\n\n@HAVE_GRM_TRUE@mpdt_include_headers = fst/extensions/mpdt/compose.h \\\n@HAVE_GRM_TRUE@fst/extensions/mpdt/expand.h fst/extensions/mpdt/info.h \\\n@HAVE_GRM_TRUE@fst/extensions/mpdt/mpdt.h fst/extensions/mpdt/mpdtlib.h \\\n@HAVE_GRM_TRUE@fst/extensions/mpdt/mpdtscript.h fst/extensions/mpdt/read_write_utils.h \\\n@HAVE_GRM_TRUE@fst/extensions/mpdt/reverse.h\n\n@HAVE_MPDT_TRUE@mpdt_include_headers = fst/extensions/mpdt/compose.h \\\n@HAVE_MPDT_TRUE@fst/extensions/mpdt/expand.h fst/extensions/mpdt/info.h \\\n@HAVE_MPDT_TRUE@fst/extensions/mpdt/mpdt.h fst/extensions/mpdt/mpdtlib.h \\\n@HAVE_MPDT_TRUE@fst/extensions/mpdt/mpdtscript.h fst/extensions/mpdt/read_write_utils.h \\\n@HAVE_MPDT_TRUE@fst/extensions/mpdt/reverse.h\n\n@HAVE_NGRAM_TRUE@ngram_include_headers = fst/extensions/ngram/bitmap-index.h \\\n@HAVE_NGRAM_TRUE@fst/extensions/ngram/ngram-fst.h fst/extensions/ngram/nthbit.h\n\n@HAVE_GRM_TRUE@pdt_include_headers = fst/extensions/pdt/collection.h \\\n@HAVE_GRM_TRUE@fst/extensions/pdt/compose.h fst/extensions/pdt/expand.h \\\n@HAVE_GRM_TRUE@fst/extensions/pdt/getters.h fst/extensions/pdt/info.h \\\n@HAVE_GRM_TRUE@fst/extensions/pdt/paren.h fst/extensions/pdt/pdt.h \\\n@HAVE_GRM_TRUE@fst/extensions/pdt/pdtlib.h fst/extensions/pdt/pdtscript.h \\\n@HAVE_GRM_TRUE@fst/extensions/pdt/replace.h fst/extensions/pdt/reverse.h \\\n@HAVE_GRM_TRUE@fst/extensions/pdt/shortest-path.h\n\n@HAVE_PDT_TRUE@pdt_include_headers = fst/extensions/pdt/collection.h \\\n@HAVE_PDT_TRUE@fst/extensions/pdt/compose.h fst/extensions/pdt/expand.h \\\n@HAVE_PDT_TRUE@fst/extensions/pdt/getters.h fst/extensions/pdt/info.h \\\n@HAVE_PDT_TRUE@fst/extensions/pdt/paren.h fst/extensions/pdt/pdt.h \\\n@HAVE_PDT_TRUE@fst/extensions/pdt/pdtlib.h fst/extensions/pdt/pdtscript.h \\\n@HAVE_PDT_TRUE@fst/extensions/pdt/replace.h fst/extensions/pdt/reverse.h \\\n@HAVE_PDT_TRUE@fst/extensions/pdt/shortest-path.h\n\n@HAVE_SPECIAL_TRUE@special_include_headers = fst/extensions/special/phi-fst.h \\\n@HAVE_SPECIAL_TRUE@fst/extensions/special/rho-fst.h fst/extensions/special/sigma-fst.h\n\nscript_include_headers = fst/script/arc-class.h \\\nfst/script/arciterator-class.h fst/script/arcsort.h \\\nfst/script/arg-packs.h fst/script/closure.h fst/script/compile-impl.h \\\nfst/script/compile.h fst/script/compose.h fst/script/concat.h \\\nfst/script/connect.h fst/script/convert.h fst/script/decode.h \\\nfst/script/determinize.h fst/script/difference.h fst/script/disambiguate.h \\\nfst/script/draw-impl.h fst/script/draw.h fst/script/encode.h \\\nfst/script/encodemapper-class.h fst/script/epsnormalize.h fst/script/equal.h \\\nfst/script/equivalent.h fst/script/fst-class.h fst/script/fstscript.h \\\nfst/script/getters.h fst/script/info-impl.h fst/script/info.h \\\nfst/script/intersect.h fst/script/invert.h fst/script/isomorphic.h \\\nfst/script/map.h fst/script/minimize.h fst/script/print-impl.h \\\nfst/script/print.h fst/script/project.h fst/script/prune.h \\\nfst/script/push.h fst/script/randequivalent.h fst/script/randgen.h \\\nfst/script/register.h fst/script/relabel.h fst/script/replace.h \\\nfst/script/reverse.h fst/script/reweight.h fst/script/rmepsilon.h \\\nfst/script/script-impl.h fst/script/shortest-distance.h \\\nfst/script/shortest-path.h fst/script/stateiterator-class.h \\\nfst/script/synchronize.h fst/script/text-io.h fst/script/topsort.h \\\nfst/script/union.h fst/script/weight-class.h fst/script/fstscript-decl.h \\\nfst/script/verify.h\n\ntest_include_headers = fst/test/algo_test.h fst/test/fst_test.h \\\nfst/test/rand-fst.h fst/test/weight-tester.h\n\nnobase_include_HEADERS = fst/accumulator.h fst/add-on.h fst/arc-arena.h \\\nfst/arc-map.h fst/arc.h fst/arcfilter.h fst/arcsort.h fst/bi-table.h \\\nfst/cache.h fst/closure.h fst/compact-fst.h fst/compat.h fst/complement.h \\\nfst/compose-filter.h fst/compose.h fst/concat.h fst/config.h fst/connect.h \\\nfst/const-fst.h fst/determinize.h fst/dfs-visit.h fst/difference.h \\\nfst/disambiguate.h fst/edit-fst.h fst/encode.h fst/epsnormalize.h fst/equal.h \\\nfst/equivalent.h fst/expanded-fst.h fst/expectation-weight.h \\\nfst/factor-weight.h fst/filter-state.h fst/flags.h fst/float-weight.h \\\nfst/fst-decl.h fst/fst.h fst/fstlib.h fst/generic-register.h fst/heap.h \\\nfst/icu.h fst/intersect.h fst/interval-set.h fst/invert.h fst/isomorphic.h \\\nfst/label-reachable.h fst/lexicographic-weight.h fst/lock.h fst/log.h \\\nfst/lookahead-filter.h fst/lookahead-matcher.h fst/map.h fst/mapped-file.h \\\nfst/matcher-fst.h fst/matcher.h fst/memory.h fst/minimize.h fst/mutable-fst.h \\\nfst/pair-weight.h fst/partition.h fst/power-weight.h fst/product-weight.h \\\nfst/project.h fst/properties.h fst/prune.h fst/push.h fst/queue.h \\\nfst/randequivalent.h fst/randgen.h fst/rational.h fst/register.h \\\nfst/relabel.h fst/replace-util.h fst/replace.h fst/reverse.h fst/reweight.h \\\nfst/rmepsilon.h fst/rmfinalepsilon.h fst/set-weight.h fst/shortest-distance.h \\\nfst/shortest-path.h fst/signed-log-weight.h fst/sparse-power-weight.h \\\nfst/sparse-tuple-weight.h fst/state-map.h fst/state-reachable.h \\\nfst/state-table.h fst/statesort.h fst/string-weight.h fst/string.h \\\nfst/symbol-table-ops.h fst/symbol-table.h fst/synchronize.h \\\nfst/test-properties.h fst/topsort.h fst/tuple-weight.h fst/types.h \\\nfst/union-find.h fst/union-weight.h fst/union.h fst/util.h fst/vector-fst.h \\\nfst/verify.h fst/visit.h fst/weight.h \\\n$(compress_include_headers) \\\n$(far_include_headers) \\\n$(linear_include_headers) \\\n$(mpdt_include_headers) \\\n$(ngram_include_headers) \\\n$(pdt_include_headers) \\\n$(script_include_headers) \\\n$(special_include_headers) \\\n$(test_include_headers)\n\nall: all-am\n\n.SUFFIXES:\n$(srcdir)/Makefile.in:  $(srcdir)/Makefile.am  $(am__configure_deps)\n\t@for dep in $?; do \\\n\t  case '$(am__configure_deps)' in \\\n\t    *$$dep*) \\\n\t      ( cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh ) \\\n\t        && { if test -f $@; then exit 0; else break; fi; }; \\\n\t      exit 1;; \\\n\t  esac; \\\n\tdone; \\\n\techo ' cd $(top_srcdir) && $(AUTOMAKE) --foreign src/include/Makefile'; \\\n\t$(am__cd) $(top_srcdir) && \\\n\t  $(AUTOMAKE) --foreign src/include/Makefile\nMakefile: $(srcdir)/Makefile.in $(top_builddir)/config.status\n\t@case '$?' in \\\n\t  *config.status*) \\\n\t    cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh;; \\\n\t  *) \\\n\t    echo ' cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe)'; \\\n\t    cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe);; \\\n\tesac;\n\n$(top_builddir)/config.status: $(top_srcdir)/configure $(CONFIG_STATUS_DEPENDENCIES)\n\tcd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh\n\n$(top_srcdir)/configure:  $(am__configure_deps)\n\tcd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh\n$(ACLOCAL_M4):  $(am__aclocal_m4_deps)\n\tcd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh\n$(am__aclocal_m4_deps):\n\nmostlyclean-libtool:\n\t-rm -f *.lo\n\nclean-libtool:\n\t-rm -rf .libs _libs\ninstall-nobase_includeHEADERS: $(nobase_include_HEADERS)\n\t@$(NORMAL_INSTALL)\n\t@list='$(nobase_include_HEADERS)'; test -n \"$(includedir)\" || list=; \\\n\tif test -n \"$$list\"; then \\\n\t  echo \" $(MKDIR_P) '$(DESTDIR)$(includedir)'\"; \\\n\t  $(MKDIR_P) \"$(DESTDIR)$(includedir)\" || exit 1; \\\n\tfi; \\\n\t$(am__nobase_list) | while read dir files; do \\\n\t  xfiles=; for file in $$files; do \\\n\t    if test -f \"$$file\"; then xfiles=\"$$xfiles $$file\"; \\\n\t    else xfiles=\"$$xfiles $(srcdir)/$$file\"; fi; done; \\\n\t  test -z \"$$xfiles\" || { \\\n\t    test \"x$$dir\" = x. || { \\\n\t      echo \" $(MKDIR_P) '$(DESTDIR)$(includedir)/$$dir'\"; \\\n\t      $(MKDIR_P) \"$(DESTDIR)$(includedir)/$$dir\"; }; \\\n\t    echo \" $(INSTALL_HEADER) $$xfiles '$(DESTDIR)$(includedir)/$$dir'\"; \\\n\t    $(INSTALL_HEADER) $$xfiles \"$(DESTDIR)$(includedir)/$$dir\" || exit $$?; }; \\\n\tdone\n\nuninstall-nobase_includeHEADERS:\n\t@$(NORMAL_UNINSTALL)\n\t@list='$(nobase_include_HEADERS)'; test -n \"$(includedir)\" || list=; \\\n\t$(am__nobase_strip_setup); files=`$(am__nobase_strip)`; \\\n\tdir='$(DESTDIR)$(includedir)'; $(am__uninstall_files_from_dir)\n\nID: $(am__tagged_files)\n\t$(am__define_uniq_tagged_files); mkid -fID $$unique\ntags: tags-am\nTAGS: tags\n\ntags-am: $(TAGS_DEPENDENCIES) $(am__tagged_files)\n\tset x; \\\n\there=`pwd`; \\\n\t$(am__define_uniq_tagged_files); \\\n\tshift; \\\n\tif test -z \"$(ETAGS_ARGS)$$*$$unique\"; then :; else \\\n\t  test -n \"$$unique\" || unique=$$empty_fix; \\\n\t  if test $$# -gt 0; then \\\n\t    $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \\\n\t      \"$$@\" $$unique; \\\n\t  else \\\n\t    $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \\\n\t      $$unique; \\\n\t  fi; \\\n\tfi\nctags: ctags-am\n\nCTAGS: ctags\nctags-am: $(TAGS_DEPENDENCIES) $(am__tagged_files)\n\t$(am__define_uniq_tagged_files); \\\n\ttest -z \"$(CTAGS_ARGS)$$unique\" \\\n\t  || $(CTAGS) $(CTAGSFLAGS) $(AM_CTAGSFLAGS) $(CTAGS_ARGS) \\\n\t     $$unique\n\nGTAGS:\n\there=`$(am__cd) $(top_builddir) && pwd` \\\n\t  && $(am__cd) $(top_srcdir) \\\n\t  && gtags -i $(GTAGS_ARGS) \"$$here\"\ncscopelist: cscopelist-am\n\ncscopelist-am: $(am__tagged_files)\n\tlist='$(am__tagged_files)'; \\\n\tcase \"$(srcdir)\" in \\\n\t  [\\\\/]* | ?:[\\\\/]*) sdir=\"$(srcdir)\" ;; \\\n\t  *) sdir=$(subdir)/$(srcdir) ;; \\\n\tesac; \\\n\tfor i in $$list; do \\\n\t  if test -f \"$$i\"; then \\\n\t    echo \"$(subdir)/$$i\"; \\\n\t  else \\\n\t    echo \"$$sdir/$$i\"; \\\n\t  fi; \\\n\tdone >> $(top_builddir)/cscope.files\n\ndistclean-tags:\n\t-rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags\n\ndistdir: $(DISTFILES)\n\t@srcdirstrip=`echo \"$(srcdir)\" | sed 's/[].[^$$\\\\*]/\\\\\\\\&/g'`; \\\n\ttopsrcdirstrip=`echo \"$(top_srcdir)\" | sed 's/[].[^$$\\\\*]/\\\\\\\\&/g'`; \\\n\tlist='$(DISTFILES)'; \\\n\t  dist_files=`for file in $$list; do echo $$file; done | \\\n\t  sed -e \"s|^$$srcdirstrip/||;t\" \\\n\t      -e \"s|^$$topsrcdirstrip/|$(top_builddir)/|;t\"`; \\\n\tcase $$dist_files in \\\n\t  */*) $(MKDIR_P) `echo \"$$dist_files\" | \\\n\t\t\t   sed '/\\//!d;s|^|$(distdir)/|;s,/[^/]*$$,,' | \\\n\t\t\t   sort -u` ;; \\\n\tesac; \\\n\tfor file in $$dist_files; do \\\n\t  if test -f $$file || test -d $$file; then d=.; else d=$(srcdir); fi; \\\n\t  if test -d $$d/$$file; then \\\n\t    dir=`echo \"/$$file\" | sed -e 's,/[^/]*$$,,'`; \\\n\t    if test -d \"$(distdir)/$$file\"; then \\\n\t      find \"$(distdir)/$$file\" -type d ! -perm -700 -exec chmod u+rwx {} \\;; \\\n\t    fi; \\\n\t    if test -d $(srcdir)/$$file && test $$d != $(srcdir); then \\\n\t      cp -fpR $(srcdir)/$$file \"$(distdir)$$dir\" || exit 1; \\\n\t      find \"$(distdir)/$$file\" -type d ! -perm -700 -exec chmod u+rwx {} \\;; \\\n\t    fi; \\\n\t    cp -fpR $$d/$$file \"$(distdir)$$dir\" || exit 1; \\\n\t  else \\\n\t    test -f \"$(distdir)/$$file\" \\\n\t    || cp -p $$d/$$file \"$(distdir)/$$file\" \\\n\t    || exit 1; \\\n\t  fi; \\\n\tdone\ncheck-am: all-am\ncheck: check-am\nall-am: Makefile $(HEADERS)\ninstalldirs:\n\tfor dir in \"$(DESTDIR)$(includedir)\"; do \\\n\t  test -z \"$$dir\" || $(MKDIR_P) \"$$dir\"; \\\n\tdone\ninstall: install-am\ninstall-exec: install-exec-am\ninstall-data: install-data-am\nuninstall: uninstall-am\n\ninstall-am: all-am\n\t@$(MAKE) $(AM_MAKEFLAGS) install-exec-am install-data-am\n\ninstallcheck: installcheck-am\ninstall-strip:\n\tif test -z '$(STRIP)'; then \\\n\t  $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" \\\n\t    install_sh_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" INSTALL_STRIP_FLAG=-s \\\n\t      install; \\\n\telse \\\n\t  $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" \\\n\t    install_sh_PROGRAM=\"$(INSTALL_STRIP_PROGRAM)\" INSTALL_STRIP_FLAG=-s \\\n\t    \"INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'\" install; \\\n\tfi\nmostlyclean-generic:\n\nclean-generic:\n\ndistclean-generic:\n\t-test -z \"$(CONFIG_CLEAN_FILES)\" || rm -f $(CONFIG_CLEAN_FILES)\n\t-test . = \"$(srcdir)\" || test -z \"$(CONFIG_CLEAN_VPATH_FILES)\" || rm -f $(CONFIG_CLEAN_VPATH_FILES)\n\nmaintainer-clean-generic:\n\t@echo \"This command is intended for maintainers to use\"\n\t@echo \"it deletes files that may require special tools to rebuild.\"\nclean: clean-am\n\nclean-am: clean-generic clean-libtool mostlyclean-am\n\ndistclean: distclean-am\n\t-rm -f Makefile\ndistclean-am: clean-am distclean-generic distclean-tags\n\ndvi: dvi-am\n\ndvi-am:\n\nhtml: html-am\n\nhtml-am:\n\ninfo: info-am\n\ninfo-am:\n\ninstall-data-am: install-nobase_includeHEADERS\n\ninstall-dvi: install-dvi-am\n\ninstall-dvi-am:\n\ninstall-exec-am:\n\ninstall-html: install-html-am\n\ninstall-html-am:\n\ninstall-info: install-info-am\n\ninstall-info-am:\n\ninstall-man:\n\ninstall-pdf: install-pdf-am\n\ninstall-pdf-am:\n\ninstall-ps: install-ps-am\n\ninstall-ps-am:\n\ninstallcheck-am:\n\nmaintainer-clean: maintainer-clean-am\n\t-rm -f Makefile\nmaintainer-clean-am: distclean-am maintainer-clean-generic\n\nmostlyclean: mostlyclean-am\n\nmostlyclean-am: mostlyclean-generic mostlyclean-libtool\n\npdf: pdf-am\n\npdf-am:\n\nps: ps-am\n\nps-am:\n\nuninstall-am: uninstall-nobase_includeHEADERS\n\n.MAKE: install-am install-strip\n\n.PHONY: CTAGS GTAGS TAGS all all-am check check-am clean clean-generic \\\n\tclean-libtool cscopelist-am ctags ctags-am distclean \\\n\tdistclean-generic distclean-libtool distclean-tags distdir dvi \\\n\tdvi-am html html-am info info-am install install-am \\\n\tinstall-data install-data-am install-dvi install-dvi-am \\\n\tinstall-exec install-exec-am install-html install-html-am \\\n\tinstall-info install-info-am install-man \\\n\tinstall-nobase_includeHEADERS install-pdf install-pdf-am \\\n\tinstall-ps install-ps-am install-strip installcheck \\\n\tinstallcheck-am installdirs maintainer-clean \\\n\tmaintainer-clean-generic mostlyclean mostlyclean-generic \\\n\tmostlyclean-libtool pdf pdf-am ps ps-am tags tags-am uninstall \\\n\tuninstall-am uninstall-nobase_includeHEADERS\n\n.PRECIOUS: Makefile\n\n\n# Tell versions [3.59,3.63) of GNU make to not export all variables.\n# Otherwise a system limit (for SysV at least) may be exceeded.\n.NOEXPORT:\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/accumulator.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Classes to accumulate arc weights. Useful for weight lookahead.\n\n#ifndef FST_ACCUMULATOR_H_\n#define FST_ACCUMULATOR_H_\n\n#include <algorithm>\n#include <functional>\n#include <unordered_map>\n#include <vector>\n\n#include <fst/log.h>\n\n#include <fst/arcfilter.h>\n#include <fst/arcsort.h>\n#include <fst/dfs-visit.h>\n#include <fst/expanded-fst.h>\n#include <fst/replace.h>\n\nnamespace fst {\n\n// This class accumulates arc weights using the semiring Plus().\ntemplate <class A>\nclass DefaultAccumulator {\n public:\n  using Arc = A;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  DefaultAccumulator() {}\n\n  DefaultAccumulator(const DefaultAccumulator &acc, bool safe = false) {}\n\n  void Init(const Fst<Arc> &fst, bool copy = false) {}\n\n  void SetState(StateId state) {}\n\n  Weight Sum(Weight w, Weight v) { return Plus(w, v); }\n\n  template <class ArcIter>\n  Weight Sum(Weight w, ArcIter *aiter, std::ptrdiff_t begin, std::ptrdiff_t end) {\n    Adder<Weight> adder(w);  // maintains cumulative sum accurately\n    aiter->Seek(begin);\n    for (auto pos = begin; pos < end; aiter->Next(), ++pos)\n      adder.Add(aiter->Value().weight);\n    return adder.Sum();\n  }\n\n  constexpr bool Error() const { return false; }\n\n private:\n  DefaultAccumulator &operator=(const DefaultAccumulator &) = delete;\n};\n\n// This class accumulates arc weights using the log semiring Plus() assuming an\n// arc weight has a WeightConvert specialization to and from log64 weights.\ntemplate <class A>\nclass LogAccumulator {\n public:\n  using Arc = A;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  LogAccumulator() {}\n\n  LogAccumulator(const LogAccumulator &acc, bool safe = false) {}\n\n  void Init(const Fst<Arc> &fst, bool copy = false) {}\n\n  void SetState(StateId s) {}\n\n  Weight Sum(Weight w, Weight v) { return LogPlus(w, v); }\n\n  template <class ArcIter>\n  Weight Sum(Weight w, ArcIter *aiter, std::ptrdiff_t begin, std::ptrdiff_t end) {\n    auto sum = w;\n    aiter->Seek(begin);\n    for (auto pos = begin; pos < end; aiter->Next(), ++pos) {\n      sum = LogPlus(sum, aiter->Value().weight);\n    }\n    return sum;\n  }\n\n  constexpr bool Error() const { return false; }\n\n private:\n  Weight LogPlus(Weight w, Weight v) {\n    if (w == Weight::Zero()) {\n      return v;\n    }\n    const auto f1 = to_log_weight_(w).Value();\n    const auto f2 = to_log_weight_(v).Value();\n    if (f1 > f2) {\n      return to_weight_(Log64Weight(f2 - internal::LogPosExp(f1 - f2)));\n    } else {\n      return to_weight_(Log64Weight(f1 - internal::LogPosExp(f2 - f1)));\n    }\n  }\n\n  WeightConvert<Weight, Log64Weight> to_log_weight_;\n  WeightConvert<Log64Weight, Weight> to_weight_;\n\n  LogAccumulator &operator=(const LogAccumulator &) = delete;\n};\n\n// Interface for shareable data for fast log accumulator copies. Holds pointers\n// to data only, storage is provided by derived classes.\nclass FastLogAccumulatorData {\n public:\n  FastLogAccumulatorData(int arc_limit, int arc_period)\n      : arc_limit_(arc_limit),\n        arc_period_(arc_period),\n        weights_ptr_(nullptr),\n        num_weights_(0),\n        weight_positions_ptr_(nullptr),\n        num_positions_(0) {}\n\n  virtual ~FastLogAccumulatorData() {}\n\n  // Cummulative weight per state for all states s.t. # of arcs > arc_limit_\n  // with arcs in order. The first element per state is Log64Weight::Zero().\n  const double *Weights() const { return weights_ptr_; }\n\n  int NumWeights() const { return num_weights_; }\n\n  // Maps from state to corresponding beginning weight position in weights_.\n  // osition -1 means no pre-computed weights for that state.\n  const int *WeightPositions() const { return weight_positions_ptr_; }\n\n  int NumPositions() const { return num_positions_; }\n\n  int ArcLimit() const { return arc_limit_; }\n\n  int ArcPeriod() const { return arc_period_; }\n\n  // Returns true if the data object is mutable and supports SetData().\n  virtual bool IsMutable() const = 0;\n\n  // Does not take ownership but may invalidate the contents of weights and\n  // weight_positions.\n  virtual void SetData(std::vector<double> *weights,\n                       std::vector<int> *weight_positions) = 0;\n\n protected:\n  void Init(int num_weights, const double *weights, int num_positions,\n            const int *weight_positions) {\n    weights_ptr_ = weights;\n    num_weights_ = num_weights;\n    weight_positions_ptr_ = weight_positions;\n    num_positions_ = num_positions;\n  }\n\n private:\n  const int arc_limit_;\n  const int arc_period_;\n  const double *weights_ptr_;\n  int num_weights_;\n  const int *weight_positions_ptr_;\n  int num_positions_;\n\n  FastLogAccumulatorData(const FastLogAccumulatorData &) = delete;\n  FastLogAccumulatorData &operator=(const FastLogAccumulatorData &) = delete;\n};\n\n// FastLogAccumulatorData with mutable storage; filled by\n// FastLogAccumulator::Init.\nclass MutableFastLogAccumulatorData : public FastLogAccumulatorData {\n public:\n  MutableFastLogAccumulatorData(int arc_limit, int arc_period)\n      : FastLogAccumulatorData(arc_limit, arc_period) {}\n\n  bool IsMutable() const override { return true; }\n\n  void SetData(std::vector<double> *weights,\n               std::vector<int> *weight_positions) override {\n    weights_.swap(*weights);\n    weight_positions_.swap(*weight_positions);\n    Init(weights_.size(), weights_.data(), weight_positions_.size(),\n         weight_positions_.data());\n  }\n\n private:\n  std::vector<double> weights_;\n  std::vector<int> weight_positions_;\n\n  MutableFastLogAccumulatorData(const MutableFastLogAccumulatorData &) = delete;\n  MutableFastLogAccumulatorData &operator=(\n      const MutableFastLogAccumulatorData &) = delete;\n};\n\n// This class accumulates arc weights using the log semiring Plus() assuming an\n// arc weight has a WeightConvert specialization to and from log64 weights. The\n// member function Init(fst) has to be called to setup pre-computed weight\n// information.\ntemplate <class A>\nclass FastLogAccumulator {\n public:\n  using Arc = A;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  explicit FastLogAccumulator(std::ptrdiff_t arc_limit = 20, std::ptrdiff_t arc_period = 10)\n      : to_log_weight_(),\n        to_weight_(),\n        arc_limit_(arc_limit),\n        arc_period_(arc_period),\n        data_(std::make_shared<MutableFastLogAccumulatorData>(arc_limit,\n                                                              arc_period)),\n        state_weights_(nullptr),\n        error_(false) {}\n\n  explicit FastLogAccumulator(std::shared_ptr<FastLogAccumulatorData> data)\n      : to_log_weight_(),\n        to_weight_(),\n        arc_limit_(data->ArcLimit()),\n        arc_period_(data->ArcPeriod()),\n        data_(data),\n        state_weights_(nullptr),\n        error_(false) {}\n\n  FastLogAccumulator(const FastLogAccumulator<Arc> &acc, bool safe = false)\n      : to_log_weight_(),\n        to_weight_(),\n        arc_limit_(acc.arc_limit_),\n        arc_period_(acc.arc_period_),\n        data_(acc.data_),\n        state_weights_(nullptr),\n        error_(acc.error_) {}\n\n  void SetState(StateId s) {\n    const auto *weights = data_->Weights();\n    const auto *weight_positions = data_->WeightPositions();\n    state_weights_ = nullptr;\n    if (s < data_->NumPositions()) {\n      const auto pos = weight_positions[s];\n      if (pos >= 0) state_weights_ = &(weights[pos]);\n    }\n  }\n\n  Weight Sum(Weight w, Weight v) const { return LogPlus(w, v); }\n\n  template <class ArcIter>\n  Weight Sum(Weight w, ArcIter *aiter, std::ptrdiff_t begin, std::ptrdiff_t end) const {\n    if (error_) return Weight::NoWeight();\n    auto sum = w;\n    // Finds begin and end of pre-stored weights.\n    std::ptrdiff_t index_begin = -1;\n    std::ptrdiff_t index_end = -1;\n    std::ptrdiff_t stored_begin = end;\n    std::ptrdiff_t stored_end = end;\n    if (state_weights_) {\n      index_begin = begin > 0 ? (begin - 1) / arc_period_ + 1 : 0;\n      index_end = end / arc_period_;\n      stored_begin = index_begin * arc_period_;\n      stored_end = index_end * arc_period_;\n    }\n    // Computes sum before pre-stored weights.\n    if (begin < stored_begin) {\n      const auto pos_end = std::min(stored_begin, end);\n      aiter->Seek(begin);\n      for (auto pos = begin; pos < pos_end; aiter->Next(), ++pos) {\n        sum = LogPlus(sum, aiter->Value().weight);\n      }\n    }\n    // Computes sum between pre-stored weights.\n    if (stored_begin < stored_end) {\n      const auto f1 = state_weights_[index_end];\n      const auto f2 = state_weights_[index_begin];\n      if (f1 < f2) sum = LogPlus(sum, LogMinus(f1, f2));\n      // Commented out for efficiency; adds Zero().\n      /*\n      else {\n        // explicitly computes if cumulative sum lacks precision\n        aiter->Seek(stored_begin);\n        for (auto pos = stored_begin; pos < stored_end; aiter->Next(), ++pos)\n          sum = LogPlus(sum, aiter->Value().weight);\n      }\n      */\n    }\n    // Computes sum after pre-stored weights.\n    if (stored_end < end) {\n      const auto pos_start = std::max(stored_begin, stored_end);\n      aiter->Seek(pos_start);\n      for (auto pos = pos_start; pos < end; aiter->Next(), ++pos) {\n        sum = LogPlus(sum, aiter->Value().weight);\n      }\n    }\n    return sum;\n  }\n\n  template <class FST>\n  void Init(const FST &fst, bool copy = false) {\n    if (copy || !data_->IsMutable()) return;\n    if (data_->NumPositions() != 0 || arc_limit_ < arc_period_) {\n      FSTERROR() << \"FastLogAccumulator: Initialization error\";\n      error_ = true;\n      return;\n    }\n    std::vector<double> weights;\n    std::vector<int> weight_positions;\n    weight_positions.reserve(CountStates(fst));\n    for (StateIterator<FST> siter(fst); !siter.Done(); siter.Next()) {\n      const auto s = siter.Value();\n      if (fst.NumArcs(s) >= arc_limit_) {\n        auto sum = FloatLimits<double>::PosInfinity();\n        if (weight_positions.size() <= s) weight_positions.resize(s + 1, -1);\n        weight_positions[s] = weights.size();\n        weights.push_back(sum);\n        size_t narcs = 0;\n        ArcIterator<FST> aiter(fst, s);\n        aiter.SetFlags(kArcWeightValue | kArcNoCache, kArcFlags);\n        for (; !aiter.Done(); aiter.Next()) {\n          const auto &arc = aiter.Value();\n          sum = LogPlus(sum, arc.weight);\n          // Stores cumulative weight distribution per arc_period_.\n          if (++narcs % arc_period_ == 0) weights.push_back(sum);\n        }\n      }\n    }\n    data_->SetData(&weights, &weight_positions);\n  }\n\n  bool Error() const { return error_; }\n\n  std::shared_ptr<FastLogAccumulatorData> GetData() const { return data_; }\n\n private:\n  static double LogPosExp(double x) {\n    return x == FloatLimits<double>::PosInfinity() ? 0.0\n                                                   : log(1.0F + exp(-x));\n  }\n\n  static double LogMinusExp(double x) {\n    return x == FloatLimits<double>::PosInfinity() ? 0.0\n                                                   : log(1.0F - exp(-x));\n  }\n\n  Weight LogPlus(Weight w, Weight v) const {\n    if (w == Weight::Zero()) {\n      return v;\n    }\n    const auto f1 = to_log_weight_(w).Value();\n    const auto f2 = to_log_weight_(v).Value();\n    if (f1 > f2) {\n      return to_weight_(Log64Weight(f2 - LogPosExp(f1 - f2)));\n    } else {\n      return to_weight_(Log64Weight(f1 - LogPosExp(f2 - f1)));\n    }\n  }\n\n  double LogPlus(double f1, Weight v) const {\n    const auto f2 = to_log_weight_(v).Value();\n    if (f1 == FloatLimits<double>::PosInfinity()) {\n      return f2;\n    } else if (f1 > f2) {\n      return f2 - LogPosExp(f1 - f2);\n    } else {\n      return f1 - LogPosExp(f2 - f1);\n    }\n  }\n\n  // Assumes f1 < f2.\n  Weight LogMinus(double f1, double f2) const {\n    if (f2 == FloatLimits<double>::PosInfinity()) {\n      return to_weight_(Log64Weight(f1));\n    } else {\n      return to_weight_(Log64Weight(f1 - LogMinusExp(f2 - f1)));\n    }\n  }\n\n  const WeightConvert<Weight, Log64Weight> to_log_weight_;\n  const WeightConvert<Log64Weight, Weight> to_weight_;\n  const std::ptrdiff_t arc_limit_;   // Minimum number of arcs to pre-compute state.\n  const std::ptrdiff_t arc_period_;  // Saves cumulative weights per arc_period_.\n  std::shared_ptr<FastLogAccumulatorData> data_;\n  const double *state_weights_;\n  bool error_;\n\n  FastLogAccumulator &operator=(const FastLogAccumulator &) = delete;\n};\n\n// Stores shareable data for cache log accumulator copies. All copies share the\n// same cache.\ntemplate <class Arc>\nclass CacheLogAccumulatorData {\n public:\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  CacheLogAccumulatorData(bool gc, size_t gc_limit)\n      : cache_gc_(gc), cache_limit_(gc_limit), cache_size_(0) {}\n\n  CacheLogAccumulatorData(const CacheLogAccumulatorData<Arc> &data)\n      : cache_gc_(data.cache_gc_),\n        cache_limit_(data.cache_limit_),\n        cache_size_(0) {}\n\n  bool CacheDisabled() const { return cache_gc_ && cache_limit_ == 0; }\n\n  std::vector<double> *GetWeights(StateId s) {\n    auto it = cache_.find(s);\n    if (it != cache_.end()) {\n      it->second.recent = true;\n      return it->second.weights.get();\n    } else {\n      return nullptr;\n    }\n  }\n\n  void AddWeights(StateId s, std::vector<double> *weights) {\n    if (cache_gc_ && cache_size_ >= cache_limit_) GC(false);\n    cache_.insert(std::make_pair(s, CacheState(weights, true)));\n    if (cache_gc_) cache_size_ += weights->capacity() * sizeof(double);\n  }\n\n private:\n  // Cached information for a given state.\n  struct CacheState {\n    std::unique_ptr<std::vector<double>> weights;  // Accumulated weights.\n    bool recent;  // Has this state been accessed since last GC?\n\n    CacheState(std::vector<double> *weights, bool recent)\n        : weights(weights), recent(recent) {}\n  };\n\n  // Garbage collect: Deletes from cache states that have not been accessed\n  // since the last GC ('free_recent = false') until 'cache_size_' is 2/3 of\n  // 'cache_limit_'. If it does not free enough memory, start deleting\n  // recently accessed states.\n  void GC(bool free_recent) {\n    auto cache_target = (2 * cache_limit_) / 3 + 1;\n    auto it = cache_.begin();\n    while (it != cache_.end() && cache_size_ > cache_target) {\n      auto &cs = it->second;\n      if (free_recent || !cs.recent) {\n        cache_size_ -= cs.weights->capacity() * sizeof(double);\n        cache_.erase(it++);\n      } else {\n        cs.recent = false;\n        ++it;\n      }\n    }\n    if (!free_recent && cache_size_ > cache_target) GC(true);\n  }\n\n  std::unordered_map<StateId, CacheState> cache_;  // Cache.\n  bool cache_gc_;       // Enables garbage collection.\n  size_t cache_limit_;  // # of bytes cached.\n  size_t cache_size_;   // # of bytes allowed before GC.\n\n  CacheLogAccumulatorData &operator=(const CacheLogAccumulatorData &) = delete;\n};\n\n// This class accumulates arc weights using the log semiring Plus() has a\n// WeightConvert specialization to and from log64 weights. It is similar to the\n// FastLogAccumator. However here, the accumulated weights are pre-computed and\n// stored only for the states that are visited. The member function Init(fst)\n// has to be called to setup this accumulator.\ntemplate <class Arc>\nclass CacheLogAccumulator {\n public:\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  explicit CacheLogAccumulator(std::ptrdiff_t arc_limit = 10, bool gc = false,\n                               size_t gc_limit = 10 * 1024 * 1024)\n      : arc_limit_(arc_limit),\n        data_(std::make_shared<CacheLogAccumulatorData<Arc>>(gc, gc_limit)),\n        s_(kNoStateId),\n        error_(false) {}\n\n  CacheLogAccumulator(const CacheLogAccumulator<Arc> &acc, bool safe = false)\n      : arc_limit_(acc.arc_limit_),\n        fst_(acc.fst_ ? acc.fst_->Copy() : nullptr),\n        data_(safe ? std::make_shared<CacheLogAccumulatorData<Arc>>(*acc.data_)\n                   : acc.data_),\n        s_(kNoStateId),\n        error_(acc.error_) {}\n\n  // Argument arc_limit specifies the minimum number of arcs to pre-compute.\n  void Init(const Fst<Arc> &fst, bool copy = false) {\n    if (!copy && fst_) {\n      FSTERROR() << \"CacheLogAccumulator: Initialization error\";\n      error_ = true;\n      return;\n    }\n    fst_.reset(fst.Copy());\n  }\n\n  void SetState(StateId s, int depth = 0) {\n    if (s == s_) return;\n    s_ = s;\n    if (data_->CacheDisabled() || error_) {\n      weights_ = nullptr;\n      return;\n    }\n    if (!fst_) {\n      FSTERROR() << \"CacheLogAccumulator::SetState: Incorrectly initialized\";\n      error_ = true;\n      weights_ = nullptr;\n      return;\n    }\n    weights_ = data_->GetWeights(s);\n    if ((weights_ == nullptr) && (fst_->NumArcs(s) >= arc_limit_)) {\n      weights_ = new std::vector<double>;\n      weights_->reserve(fst_->NumArcs(s) + 1);\n      weights_->push_back(FloatLimits<double>::PosInfinity());\n      data_->AddWeights(s, weights_);\n    }\n  }\n\n  Weight Sum(Weight w, Weight v) { return LogPlus(w, v); }\n\n  template <class ArcIter>\n  Weight Sum(Weight w, ArcIter *aiter, std::ptrdiff_t begin, std::ptrdiff_t end) {\n    if (weights_ == nullptr) {\n      auto sum = w;\n      aiter->Seek(begin);\n      for (auto pos = begin; pos < end; aiter->Next(), ++pos) {\n        sum = LogPlus(sum, aiter->Value().weight);\n      }\n      return sum;\n    } else {\n      Extend(end, aiter);\n      const auto &f1 = (*weights_)[end];\n      const auto &f2 = (*weights_)[begin];\n      if (f1 < f2) {\n        return LogPlus(w, LogMinus(f1, f2));\n      } else {\n        // Commented out for efficiency; adds Zero().\n        /*\n        auto sum = w;\n        // Explicitly computes if cumulative sum lacks precision.\n        aiter->Seek(begin);\n        for (auto pos = begin; pos < end; aiter->Next(), ++pos) {\n          sum = LogPlus(sum, aiter->Value().weight);\n        }\n        return sum;\n        */\n        return w;\n      }\n    }\n  }\n\n  // Returns first position from aiter->Position() whose accumulated\n  // value is greater or equal to w (w.r.t. Zero() < One()). The\n  // iterator may be repositioned.\n  template <class ArcIter>\n  size_t LowerBound(Weight w, ArcIter *aiter) {\n    const auto f = to_log_weight_(w).Value();\n    auto pos = aiter->Position();\n    if (weights_) {\n      Extend(fst_->NumArcs(s_), aiter);\n      return std::lower_bound(weights_->begin() + pos + 1, weights_->end(),\n                              f, std::greater<double>()) -\n          weights_->begin() - 1;\n    } else {\n      size_t n = 0;\n      auto x = FloatLimits<double>::PosInfinity();\n      for (aiter->Reset(); !aiter->Done(); aiter->Next(), ++n) {\n        x = LogPlus(x, aiter->Value().weight);\n        if (n >= pos && x <= f) break;\n      }\n      return n;\n    }\n  }\n\n  bool Error() const { return error_; }\n\n private:\n  double LogPosExp(double x) {\n    return x == FloatLimits<double>::PosInfinity() ? 0.0\n                                                   : log(1.0F + exp(-x));\n  }\n\n  double LogMinusExp(double x) {\n    return x == FloatLimits<double>::PosInfinity() ? 0.0\n                                                   : log(1.0F - exp(-x));\n  }\n\n  Weight LogPlus(Weight w, Weight v) {\n    if (w == Weight::Zero()) {\n      return v;\n    }\n    const auto f1 = to_log_weight_(w).Value();\n    const auto f2 = to_log_weight_(v).Value();\n    if (f1 > f2) {\n      return to_weight_(Log64Weight(f2 - LogPosExp(f1 - f2)));\n    } else {\n      return to_weight_(Log64Weight(f1 - LogPosExp(f2 - f1)));\n    }\n  }\n\n  double LogPlus(double f1, Weight v) {\n    const auto f2 = to_log_weight_(v).Value();\n    if (f1 == FloatLimits<double>::PosInfinity()) {\n      return f2;\n    } else if (f1 > f2) {\n      return f2 - LogPosExp(f1 - f2);\n    } else {\n      return f1 - LogPosExp(f2 - f1);\n    }\n  }\n\n  // Assumes f1 < f2.\n  Weight LogMinus(double f1, double f2) {\n    if (f2 == FloatLimits<double>::PosInfinity()) {\n      return to_weight_(Log64Weight(f1));\n    } else {\n      return to_weight_(Log64Weight(f1 - LogMinusExp(f2 - f1)));\n    }\n  }\n\n  // Extends weights up to index 'end'.\n  template <class ArcIter>\n  void Extend(std::ptrdiff_t end, ArcIter *aiter) {\n    if (weights_->size() <= end) {\n      for (aiter->Seek(weights_->size() - 1); weights_->size() <= end;\n           aiter->Next()) {\n        weights_->push_back(LogPlus(weights_->back(), aiter->Value().weight));\n      }\n    }\n  }\n\n\n  WeightConvert<Weight, Log64Weight> to_log_weight_;\n  WeightConvert<Log64Weight, Weight> to_weight_;\n  std::ptrdiff_t arc_limit_;                    // Minimum # of arcs to cache a state.\n  std::vector<double> *weights_;         // Accumulated weights for cur. state.\n  std::unique_ptr<const Fst<Arc>> fst_;  // Input FST.\n  std::shared_ptr<CacheLogAccumulatorData<Arc>> data_;  // Cache data.\n  StateId s_;                                           // Current state.\n  bool error_;\n};\n\n// Stores shareable data for replace accumulator copies.\ntemplate <class Accumulator, class T>\nclass ReplaceAccumulatorData {\n public:\n  using Arc = typename Accumulator::Arc;\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using StateTable = T;\n  using StateTuple = typename StateTable::StateTuple;\n\n  ReplaceAccumulatorData() : state_table_(nullptr) {}\n\n  explicit ReplaceAccumulatorData(\n      const std::vector<Accumulator *> &accumulators)\n      : state_table_(nullptr) {\n    accumulators_.reserve(accumulators.size());\n    for (const auto accumulator : accumulators) {\n      accumulators_.emplace_back(accumulator);\n    }\n  }\n\n  void Init(const std::vector<std::pair<Label, const Fst<Arc> *>> &fst_tuples,\n            const StateTable *state_table) {\n    state_table_ = state_table;\n    accumulators_.resize(fst_tuples.size());\n    for (Label i = 0; i < accumulators_.size(); ++i) {\n      if (!accumulators_[i]) {\n        accumulators_[i].reset(new Accumulator());\n        accumulators_[i]->Init(*(fst_tuples[i].second));\n      }\n      fst_array_.emplace_back(fst_tuples[i].second->Copy());\n    }\n  }\n\n  const StateTuple &GetTuple(StateId s) const { return state_table_->Tuple(s); }\n\n  Accumulator *GetAccumulator(size_t i) { return accumulators_[i].get(); }\n\n  const Fst<Arc> *GetFst(size_t i) const { return fst_array_[i].get(); }\n\n private:\n  const StateTable *state_table_;\n  std::vector<std::unique_ptr<Accumulator>> accumulators_;\n  std::vector<std::unique_ptr<const Fst<Arc>>> fst_array_;\n};\n\n// This class accumulates weights in a ReplaceFst.  The 'Init' method takes as\n// input the argument used to build the ReplaceFst and the ReplaceFst state\n// table. It uses accumulators of type 'Accumulator' in the underlying FSTs.\ntemplate <class Accumulator,\n          class T = DefaultReplaceStateTable<typename Accumulator::Arc>>\nclass ReplaceAccumulator {\n public:\n  using Arc = typename Accumulator::Arc;\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using StateTable = T;\n  using StateTuple = typename StateTable::StateTuple;\n  using Weight = typename Arc::Weight;\n\n  ReplaceAccumulator()\n      : init_(false),\n        data_(std::make_shared<\n              ReplaceAccumulatorData<Accumulator, StateTable>>()),\n        error_(false) {}\n\n  explicit ReplaceAccumulator(const std::vector<Accumulator *> &accumulators)\n      : init_(false),\n        data_(std::make_shared<ReplaceAccumulatorData<Accumulator, StateTable>>(\n            accumulators)),\n        error_(false) {}\n\n  ReplaceAccumulator(const ReplaceAccumulator<Accumulator, StateTable> &acc,\n                     bool safe = false)\n      : init_(acc.init_), data_(acc.data_), error_(acc.error_) {\n    if (!init_) {\n      FSTERROR() << \"ReplaceAccumulator: Can't copy unintialized accumulator\";\n    }\n    if (safe) FSTERROR() << \"ReplaceAccumulator: Safe copy not supported\";\n  }\n\n  // Does not take ownership of the state table, the state table is owned by\n  // the ReplaceFst.\n  void Init(const std::vector<std::pair<Label, const Fst<Arc> *>> &fst_tuples,\n            const StateTable *state_table) {\n    init_ = true;\n    data_->Init(fst_tuples, state_table);\n  }\n\n  // Method required by LookAheadMatcher. However, ReplaceAccumulator needs to\n  // be initialized by calling the Init method above before being passed to\n  // LookAheadMatcher.\n  //\n  // TODO(allauzen): Revisit this. Consider creating a method\n  // Init(const ReplaceFst<A, T, C>&, bool) and using friendship to get access\n  // to the innards of ReplaceFst.\n  void Init(const Fst<Arc> &fst, bool copy = false) {\n    if (!init_) {\n      FSTERROR() << \"ReplaceAccumulator::Init: Accumulator needs to be\"\n                 << \" initialized before being passed to LookAheadMatcher\";\n      error_ = true;\n    }\n  }\n\n  void SetState(StateId s) {\n    if (!init_) {\n      FSTERROR() << \"ReplaceAccumulator::SetState: Incorrectly initialized\";\n      error_ = true;\n      return;\n    }\n    auto tuple = data_->GetTuple(s);\n    fst_id_ = tuple.fst_id - 1;  // Replace FST ID is 1-based.\n    data_->GetAccumulator(fst_id_)->SetState(tuple.fst_state);\n    if ((tuple.prefix_id != 0) &&\n        (data_->GetFst(fst_id_)->Final(tuple.fst_state) != Weight::Zero())) {\n      offset_ = 1;\n      offset_weight_ = data_->GetFst(fst_id_)->Final(tuple.fst_state);\n    } else {\n      offset_ = 0;\n      offset_weight_ = Weight::Zero();\n    }\n    aiter_.reset(\n        new ArcIterator<Fst<Arc>>(*data_->GetFst(fst_id_), tuple.fst_state));\n  }\n\n  Weight Sum(Weight w, Weight v) {\n    if (error_) return Weight::NoWeight();\n    return data_->GetAccumulator(fst_id_)->Sum(w, v);\n  }\n\n  template <class ArcIter>\n  Weight Sum(Weight w, ArcIter *aiter, std::ptrdiff_t begin, std::ptrdiff_t end) {\n    if (error_) return Weight::NoWeight();\n    auto sum = begin == end ? Weight::Zero()\n                            : data_->GetAccumulator(fst_id_)->Sum(\n                                  w, aiter_.get(), begin ? begin - offset_ : 0,\n                                  end - offset_);\n    if (begin == 0 && end != 0 && offset_ > 0) sum = Sum(offset_weight_, sum);\n    return sum;\n  }\n\n  bool Error() const { return error_; }\n\n private:\n  bool init_;\n  std::shared_ptr<ReplaceAccumulatorData<Accumulator, StateTable>> data_;\n  Label fst_id_;\n  size_t offset_;\n  Weight offset_weight_;\n  std::unique_ptr<ArcIterator<Fst<Arc>>> aiter_;\n  bool error_;\n};\n\n// SafeReplaceAccumulator accumulates weights in a ReplaceFst and copies of it\n// are always thread-safe copies.\ntemplate <class Accumulator, class T>\nclass SafeReplaceAccumulator {\n public:\n  using Arc = typename Accumulator::Arc;\n  using StateId = typename Arc::StateId;\n  using Label = typename Arc::Label;\n  using Weight = typename Arc::Weight;\n  using StateTable = T;\n  using StateTuple = typename StateTable::StateTuple;\n\n  SafeReplaceAccumulator() {}\n\n  SafeReplaceAccumulator(const SafeReplaceAccumulator &copy, bool safe)\n      : SafeReplaceAccumulator(copy) {}\n\n  explicit SafeReplaceAccumulator(\n      const std::vector<Accumulator> &accumulators) {\n    for (const auto &accumulator : accumulators) {\n      accumulators_.emplace_back(accumulator, true);\n    }\n  }\n\n  void Init(const std::vector<std::pair<Label, const Fst<Arc> *>> &fst_tuples,\n            const StateTable *state_table) {\n    state_table_ = state_table;\n    for (Label i = 0; i < fst_tuples.size(); ++i) {\n      if (i == accumulators_.size()) {\n        accumulators_.resize(accumulators_.size() + 1);\n        accumulators_[i].Init(*(fst_tuples[i].second));\n      }\n      fst_array_.emplace_back(fst_tuples[i].second->Copy(true));\n    }\n    init_ = true;\n  }\n\n  void Init(const Fst<Arc> &fst, bool copy = false) {\n    if (!init_) {\n      FSTERROR() << \"SafeReplaceAccumulator::Init: Accumulator needs to be\"\n                 << \" initialized before being passed to LookAheadMatcher\";\n      error_ = true;\n    }\n  }\n\n  void SetState(StateId s) {\n    auto tuple = state_table_->Tuple(s);\n    fst_id_ = tuple.fst_id - 1;  // Replace FST ID is 1-based\n    GetAccumulator(fst_id_)->SetState(tuple.fst_state);\n    offset_ = 0;\n    offset_weight_ = Weight::Zero();\n    const auto final_weight = GetFst(fst_id_)->Final(tuple.fst_state);\n    if ((tuple.prefix_id != 0) && (final_weight != Weight::Zero())) {\n      offset_ = 1;\n      offset_weight_ = final_weight;\n    }\n    aiter_.Set(*GetFst(fst_id_), tuple.fst_state);\n  }\n\n  Weight Sum(Weight w, Weight v) {\n    if (error_) return Weight::NoWeight();\n    return GetAccumulator(fst_id_)->Sum(w, v);\n  }\n\n  template <class ArcIter>\n  Weight Sum(Weight w, ArcIter *aiter, std::ptrdiff_t begin, std::ptrdiff_t end) {\n    if (error_) return Weight::NoWeight();\n    if (begin == end) return Weight::Zero();\n    auto sum = GetAccumulator(fst_id_)->Sum(\n        w, aiter_.get(), begin ? begin - offset_ : 0, end - offset_);\n    if (begin == 0 && end != 0 && offset_ > 0) {\n      sum = Sum(offset_weight_, sum);\n    }\n    return sum;\n  }\n\n  bool Error() const { return error_; }\n\n private:\n  class ArcIteratorPtr {\n   public:\n    ArcIteratorPtr() {}\n\n    ArcIteratorPtr(const ArcIteratorPtr &copy) {}\n\n    void Set(const Fst<Arc> &fst, StateId state_id) {\n      ptr_.reset(new ArcIterator<Fst<Arc>>(fst, state_id));\n    }\n\n    ArcIterator<Fst<Arc>> *get() { return ptr_.get(); }\n\n   private:\n    std::unique_ptr<ArcIterator<Fst<Arc>>> ptr_;\n  };\n\n  Accumulator *GetAccumulator(size_t i) { return &accumulators_[i]; }\n\n  const Fst<Arc> *GetFst(size_t i) const { return fst_array_[i].get(); }\n\n  const StateTable *state_table_;\n  std::vector<Accumulator> accumulators_;\n  std::vector<std::shared_ptr<Fst<Arc>>> fst_array_;\n  ArcIteratorPtr aiter_;\n  bool init_ = false;\n  bool error_ = false;\n  Label fst_id_;\n  size_t offset_;\n  Weight offset_weight_;\n};\n\n}  // namespace fst\n\n#endif  // FST_ACCUMULATOR_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/add-on.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// FST implementation class to attach an arbitrary object with a read/write\n// method to an FST and its file representation. The FST is given a new type\n// name.\n\n#ifndef FST_ADD_ON_H_\n#define FST_ADD_ON_H_\n\n#include <stddef.h>\n#include <memory>\n#include <string>\n#include <utility>\n\n#include <fst/log.h>\n\n#include <fst/fst.h>\n\n\nnamespace fst {\n\n// Identifies stream data as an add-on FST.\nstatic constexpr int32_t kAddOnMagicNumber = 446681434;\n\n// Nothing to save.\nclass NullAddOn {\n public:\n  NullAddOn() {}\n\n  static NullAddOn *Read(std::istream &strm, const FstReadOptions &opts) {\n    return new NullAddOn();\n  }\n\n  bool Write(std::ostream &ostrm, const FstWriteOptions &opts) const {\n    return true;\n  }\n};\n\n// Create a new add-on from a pair of add-ons.\ntemplate <class A1, class A2>\nclass AddOnPair {\n public:\n  // Argument reference count incremented.\n  AddOnPair(std::shared_ptr<A1> a1, std::shared_ptr<A2> a2)\n      : a1_(std::move(a1)), a2_(std::move(a2)) {}\n\n  const A1 *First() const { return a1_.get(); }\n\n  const A2 *Second() const { return a2_.get(); }\n\n  std::shared_ptr<A1> SharedFirst() const { return a1_; }\n\n  std::shared_ptr<A2> SharedSecond() const { return a2_; }\n\n  static AddOnPair<A1, A2> *Read(std::istream &istrm,\n                                 const FstReadOptions &opts) {\n    A1 *a1 = nullptr;\n    bool have_addon1 = false;\n    ReadType(istrm, &have_addon1);\n    if (have_addon1) a1 = A1::Read(istrm, opts);\n\n    A2 *a2 = nullptr;\n    bool have_addon2 = false;\n    ReadType(istrm, &have_addon2);\n    if (have_addon2) a2 = A2::Read(istrm, opts);\n\n    return new AddOnPair<A1, A2>(std::shared_ptr<A1>(a1),\n                                 std::shared_ptr<A2>(a2));\n  }\n\n  bool Write(std::ostream &ostrm, const FstWriteOptions &opts) const {\n    bool have_addon1 = a1_ != nullptr;\n    WriteType(ostrm, have_addon1);\n    if (have_addon1) a1_->Write(ostrm, opts);\n    bool have_addon2 = a2_ != nullptr;\n    WriteType(ostrm, have_addon2);\n    if (have_addon2) a2_->Write(ostrm, opts);\n    return true;\n  }\n\n private:\n  std::shared_ptr<A1> a1_;\n  std::shared_ptr<A2> a2_;\n};\n\nnamespace internal {\n\n// Adds an object of type T to an FST. T must support:\n//\n//     T* Read(std::istream &);\n//     bool Write(std::ostream &);\n//\n// The resulting type is a new FST implementation.\ntemplate <class FST, class T>\nclass AddOnImpl : public FstImpl<typename FST::Arc> {\n public:\n  using Arc = typename FST::Arc;\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using FstImpl<Arc>::SetType;\n  using FstImpl<Arc>::SetInputSymbols;\n  using FstImpl<Arc>::SetOutputSymbols;\n  using FstImpl<Arc>::SetProperties;\n  using FstImpl<Arc>::WriteHeader;\n\n  // We make a thread-safe copy of the FST by default since an FST\n  // implementation is expected to not share mutable data between objects.\n  AddOnImpl(const FST &fst, const string &type,\n            std::shared_ptr<T> t = std::shared_ptr<T>())\n      : fst_(fst, true), t_(std::move(t)) {\n    SetType(type);\n    SetProperties(fst_.Properties(kFstProperties, false));\n    SetInputSymbols(fst_.InputSymbols());\n    SetOutputSymbols(fst_.OutputSymbols());\n  }\n\n  // Conversion from const Fst<Arc> & to F always copies the underlying\n  // implementation.\n  AddOnImpl(const Fst<Arc> &fst, const string &type,\n            std::shared_ptr<T> t = std::shared_ptr<T>())\n      : fst_(fst), t_(std::move(t)) {\n    SetType(type);\n    SetProperties(fst_.Properties(kFstProperties, false));\n    SetInputSymbols(fst_.InputSymbols());\n    SetOutputSymbols(fst_.OutputSymbols());\n  }\n\n  // We make a thread-safe copy of the FST by default since an FST\n  // implementation is expected to not share mutable data between objects.\n  AddOnImpl(const AddOnImpl<FST, T> &impl)\n      : fst_(impl.fst_, true), t_(impl.t_) {\n    SetType(impl.Type());\n    SetProperties(fst_.Properties(kCopyProperties, false));\n    SetInputSymbols(fst_.InputSymbols());\n    SetOutputSymbols(fst_.OutputSymbols());\n  }\n\n  StateId Start() const { return fst_.Start(); }\n\n  Weight Final(StateId s) const { return fst_.Final(s); }\n\n  size_t NumArcs(StateId s) const { return fst_.NumArcs(s); }\n\n  size_t NumInputEpsilons(StateId s) const { return fst_.NumInputEpsilons(s); }\n\n  size_t NumOutputEpsilons(StateId s) const {\n    return fst_.NumOutputEpsilons(s);\n  }\n\n  size_t NumStates() const { return fst_.NumStates(); }\n\n  static AddOnImpl<FST, T> *Read(std::istream &strm,\n                                 const FstReadOptions &opts) {\n    FstReadOptions nopts(opts);\n    FstHeader hdr;\n    if (!nopts.header) {\n      hdr.Read(strm, nopts.source);\n      nopts.header = &hdr;\n    }\n    std::unique_ptr<AddOnImpl<FST, T>> impl(\n        new AddOnImpl<FST, T>(nopts.header->FstType()));\n    if (!impl->ReadHeader(strm, nopts, kMinFileVersion, &hdr)) return nullptr;\n    impl.reset();\n    int32_t magic_number = 0;\n    ReadType(strm, &magic_number);  // Ensures this is an add-on FST.\n    if (magic_number != kAddOnMagicNumber) {\n      LOG(ERROR) << \"AddOnImpl::Read: Bad add-on header: \" << nopts.source;\n      return nullptr;\n    }\n    FstReadOptions fopts(opts);\n    fopts.header = nullptr;  // Contained header was written out.\n    std::unique_ptr<FST> fst(FST::Read(strm, fopts));\n    if (!fst) return nullptr;\n    std::shared_ptr<T> t;\n    bool have_addon = false;\n    ReadType(strm, &have_addon);\n    if (have_addon) {  // Reads add-on object if present.\n      t = std::shared_ptr<T>(T::Read(strm, fopts));\n      if (!t) return nullptr;\n    }\n    return new AddOnImpl<FST, T>(*fst, nopts.header->FstType(), t);\n  }\n\n  bool Write(std::ostream &strm, const FstWriteOptions &opts) const {\n    FstHeader hdr;\n    FstWriteOptions nopts(opts);\n    nopts.write_isymbols = false;  // Allows contained FST to hold any symbols.\n    nopts.write_osymbols = false;\n    WriteHeader(strm, nopts, kFileVersion, &hdr);\n    WriteType(strm, kAddOnMagicNumber);  // Ensures this is an add-on FST.\n    FstWriteOptions fopts(opts);\n    fopts.write_header = true;  // Forces writing contained header.\n    if (!fst_.Write(strm, fopts)) return false;\n    bool have_addon = !!t_;\n    WriteType(strm, have_addon);\n    // Writes add-on object if present.\n    if (have_addon) t_->Write(strm, opts);\n    return true;\n  }\n\n  void InitStateIterator(StateIteratorData<Arc> *data) const {\n    fst_.InitStateIterator(data);\n  }\n\n  void InitArcIterator(StateId s, ArcIteratorData<Arc> *data) const {\n    fst_.InitArcIterator(s, data);\n  }\n\n  FST &GetFst() { return fst_; }\n\n  const FST &GetFst() const { return fst_; }\n\n  const T *GetAddOn() const { return t_.get(); }\n\n  std::shared_ptr<T> GetSharedAddOn() const { return t_; }\n\n  void SetAddOn(std::shared_ptr<T> t) { t_ = t; }\n\n private:\n  explicit AddOnImpl(const string &type) : t_() {\n    SetType(type);\n    SetProperties(kExpanded);\n  }\n\n  // Current file format version.\n  static constexpr int kFileVersion = 1;\n  // Minimum file format version supported.\n  static constexpr int kMinFileVersion = 1;\n\n  FST fst_;\n  std::shared_ptr<T> t_;\n\n  AddOnImpl &operator=(const AddOnImpl &) = delete;\n};\n\ntemplate <class FST, class T>\nconstexpr int AddOnImpl<FST, T>::kFileVersion;\n\ntemplate <class FST, class T>\nconstexpr int AddOnImpl<FST, T>::kMinFileVersion;\n\n}  // namespace internal\n}  // namespace fst\n\n#endif  // FST_ADD_ON_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/algo_test.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Regression test for various FST algorithms.\n\n#ifndef FST_TEST_ALGO_TEST_H_\n#define FST_TEST_ALGO_TEST_H_\n\n#include <fst/log.h>\n\n#include <fst/fstlib.h>\n#include <fst/test/rand-fst.h>\n\nDECLARE_int32(repeat);  // defined in ./algo_test.cc\n\nnamespace fst {\n\n// Mapper to change input and output label of every transition into\n// epsilons.\ntemplate <class A>\nclass EpsMapper {\n public:\n  EpsMapper() {}\n\n  A operator()(const A &arc) const {\n    return A(0, 0, arc.weight, arc.nextstate);\n  }\n\n  uint64 Properties(uint64 props) const {\n    props &= ~kNotAcceptor;\n    props |= kAcceptor;\n    props &= ~kNoIEpsilons & ~kNoOEpsilons & ~kNoEpsilons;\n    props |= kIEpsilons | kOEpsilons | kEpsilons;\n    props &= ~kNotILabelSorted & ~kNotOLabelSorted;\n    props |= kILabelSorted | kOLabelSorted;\n    return props;\n  }\n\n  MapFinalAction FinalAction() const { return MAP_NO_SUPERFINAL; }\n\n  MapSymbolsAction InputSymbolsAction() const { return MAP_COPY_SYMBOLS; }\n\n  MapSymbolsAction OutputSymbolsAction() const { return MAP_COPY_SYMBOLS; }\n};\n\n// Generic - no lookahead.\ntemplate <class Arc>\nvoid LookAheadCompose(const Fst<Arc> &ifst1, const Fst<Arc> &ifst2,\n                      MutableFst<Arc> *ofst) {\n  Compose(ifst1, ifst2, ofst);\n}\n\n// Specialized and epsilon olabel acyclic - lookahead.\nvoid LookAheadCompose(const Fst<StdArc> &ifst1, const Fst<StdArc> &ifst2,\n                      MutableFst<StdArc> *ofst) {\n  std::vector<StdArc::StateId> order;\n  bool acyclic;\n  TopOrderVisitor<StdArc> visitor(&order, &acyclic);\n  DfsVisit(ifst1, &visitor, OutputEpsilonArcFilter<StdArc>());\n  if (acyclic) {  // no ifst1 output epsilon cycles?\n    StdOLabelLookAheadFst lfst1(ifst1);\n    StdVectorFst lfst2(ifst2);\n    LabelLookAheadRelabeler<StdArc>::Relabel(&lfst2, lfst1, true);\n    Compose(lfst1, lfst2, ofst);\n  } else {\n    Compose(ifst1, ifst2, ofst);\n  }\n}\n\n// This class tests a variety of identities and properties that must\n// hold for various algorithms on weighted FSTs.\ntemplate <class Arc, class WeightGenerator>\nclass WeightedTester {\n public:\n  typedef typename Arc::Label Label;\n  typedef typename Arc::StateId StateId;\n  typedef typename Arc::Weight Weight;\n\n  WeightedTester(time_t seed, const Fst<Arc> &zero_fst, const Fst<Arc> &one_fst,\n                 const Fst<Arc> &univ_fst, WeightGenerator *weight_generator)\n      : seed_(seed),\n        zero_fst_(zero_fst),\n        one_fst_(one_fst),\n        univ_fst_(univ_fst),\n        weight_generator_(weight_generator) {}\n\n  void Test(const Fst<Arc> &T1, const Fst<Arc> &T2, const Fst<Arc> &T3) {\n    TestRational(T1, T2, T3);\n    TestMap(T1);\n    TestCompose(T1, T2, T3);\n    TestSort(T1);\n    TestOptimize(T1);\n    TestSearch(T1);\n  }\n\n private:\n  // Tests rational operations with identities\n  void TestRational(const Fst<Arc> &T1, const Fst<Arc> &T2,\n                    const Fst<Arc> &T3) {\n    {\n      VLOG(1) << \"Check destructive and delayed union are equivalent.\";\n      VectorFst<Arc> U1(T1);\n      Union(&U1, T2);\n      UnionFst<Arc> U2(T1, T2);\n      CHECK(Equiv(U1, U2));\n    }\n\n    {\n      VLOG(1) << \"Check destructive and delayed concatenation are equivalent.\";\n      VectorFst<Arc> C1(T1);\n      Concat(&C1, T2);\n      ConcatFst<Arc> C2(T1, T2);\n      CHECK(Equiv(C1, C2));\n      VectorFst<Arc> C3(T2);\n      Concat(T1, &C3);\n      CHECK(Equiv(C3, C2));\n    }\n\n    {\n      VLOG(1) << \"Check destructive and delayed closure* are equivalent.\";\n      VectorFst<Arc> C1(T1);\n      Closure(&C1, CLOSURE_STAR);\n      ClosureFst<Arc> C2(T1, CLOSURE_STAR);\n      CHECK(Equiv(C1, C2));\n    }\n\n    {\n      VLOG(1) << \"Check destructive and delayed closure+ are equivalent.\";\n      VectorFst<Arc> C1(T1);\n      Closure(&C1, CLOSURE_PLUS);\n      ClosureFst<Arc> C2(T1, CLOSURE_PLUS);\n      CHECK(Equiv(C1, C2));\n    }\n\n    {\n      VLOG(1) << \"Check union is associative (destructive).\";\n      VectorFst<Arc> U1(T1);\n      Union(&U1, T2);\n      Union(&U1, T3);\n\n      VectorFst<Arc> U3(T2);\n      Union(&U3, T3);\n      VectorFst<Arc> U4(T1);\n      Union(&U4, U3);\n\n      CHECK(Equiv(U1, U4));\n    }\n\n    {\n      VLOG(1) << \"Check union is associative (delayed).\";\n      UnionFst<Arc> U1(T1, T2);\n      UnionFst<Arc> U2(U1, T3);\n\n      UnionFst<Arc> U3(T2, T3);\n      UnionFst<Arc> U4(T1, U3);\n\n      CHECK(Equiv(U2, U4));\n    }\n\n    {\n      VLOG(1) << \"Check union is associative (destructive delayed).\";\n      UnionFst<Arc> U1(T1, T2);\n      Union(&U1, T3);\n\n      UnionFst<Arc> U3(T2, T3);\n      UnionFst<Arc> U4(T1, U3);\n\n      CHECK(Equiv(U1, U4));\n    }\n\n    {\n      VLOG(1) << \"Check concatenation is associative (destructive).\";\n      VectorFst<Arc> C1(T1);\n      Concat(&C1, T2);\n      Concat(&C1, T3);\n\n      VectorFst<Arc> C3(T2);\n      Concat(&C3, T3);\n      VectorFst<Arc> C4(T1);\n      Concat(&C4, C3);\n\n      CHECK(Equiv(C1, C4));\n    }\n\n    {\n      VLOG(1) << \"Check concatenation is associative (delayed).\";\n      ConcatFst<Arc> C1(T1, T2);\n      ConcatFst<Arc> C2(C1, T3);\n\n      ConcatFst<Arc> C3(T2, T3);\n      ConcatFst<Arc> C4(T1, C3);\n\n      CHECK(Equiv(C2, C4));\n    }\n\n    {\n      VLOG(1) << \"Check concatenation is associative (destructive delayed).\";\n      ConcatFst<Arc> C1(T1, T2);\n      Concat(&C1, T3);\n\n      ConcatFst<Arc> C3(T2, T3);\n      ConcatFst<Arc> C4(T1, C3);\n\n      CHECK(Equiv(C1, C4));\n    }\n\n    if (Weight::Properties() & kLeftSemiring) {\n      VLOG(1) << \"Check concatenation left distributes\"\n              << \" over union (destructive).\";\n\n      VectorFst<Arc> U1(T1);\n      Union(&U1, T2);\n      VectorFst<Arc> C1(T3);\n      Concat(&C1, U1);\n\n      VectorFst<Arc> C2(T3);\n      Concat(&C2, T1);\n      VectorFst<Arc> C3(T3);\n      Concat(&C3, T2);\n      VectorFst<Arc> U2(C2);\n      Union(&U2, C3);\n\n      CHECK(Equiv(C1, U2));\n    }\n\n    if (Weight::Properties() & kRightSemiring) {\n      VLOG(1) << \"Check concatenation right distributes\"\n              << \" over union (destructive).\";\n      VectorFst<Arc> U1(T1);\n      Union(&U1, T2);\n      VectorFst<Arc> C1(U1);\n      Concat(&C1, T3);\n\n      VectorFst<Arc> C2(T1);\n      Concat(&C2, T3);\n      VectorFst<Arc> C3(T2);\n      Concat(&C3, T3);\n      VectorFst<Arc> U2(C2);\n      Union(&U2, C3);\n\n      CHECK(Equiv(C1, U2));\n    }\n\n    if (Weight::Properties() & kLeftSemiring) {\n      VLOG(1) << \"Check concatenation left distributes over union (delayed).\";\n      UnionFst<Arc> U1(T1, T2);\n      ConcatFst<Arc> C1(T3, U1);\n\n      ConcatFst<Arc> C2(T3, T1);\n      ConcatFst<Arc> C3(T3, T2);\n      UnionFst<Arc> U2(C2, C3);\n\n      CHECK(Equiv(C1, U2));\n    }\n\n    if (Weight::Properties() & kRightSemiring) {\n      VLOG(1) << \"Check concatenation right distributes over union (delayed).\";\n      UnionFst<Arc> U1(T1, T2);\n      ConcatFst<Arc> C1(U1, T3);\n\n      ConcatFst<Arc> C2(T1, T3);\n      ConcatFst<Arc> C3(T2, T3);\n      UnionFst<Arc> U2(C2, C3);\n\n      CHECK(Equiv(C1, U2));\n    }\n\n    if (Weight::Properties() & kLeftSemiring) {\n      VLOG(1) << \"Check T T* == T+ (destructive).\";\n      VectorFst<Arc> S(T1);\n      Closure(&S, CLOSURE_STAR);\n      VectorFst<Arc> C(T1);\n      Concat(&C, S);\n\n      VectorFst<Arc> P(T1);\n      Closure(&P, CLOSURE_PLUS);\n\n      CHECK(Equiv(C, P));\n    }\n\n    if (Weight::Properties() & kRightSemiring) {\n      VLOG(1) << \"Check T* T == T+ (destructive).\";\n      VectorFst<Arc> S(T1);\n      Closure(&S, CLOSURE_STAR);\n      VectorFst<Arc> C(S);\n      Concat(&C, T1);\n\n      VectorFst<Arc> P(T1);\n      Closure(&P, CLOSURE_PLUS);\n\n      CHECK(Equiv(C, P));\n    }\n\n    if (Weight::Properties() & kLeftSemiring) {\n      VLOG(1) << \"Check T T* == T+ (delayed).\";\n      ClosureFst<Arc> S(T1, CLOSURE_STAR);\n      ConcatFst<Arc> C(T1, S);\n\n      ClosureFst<Arc> P(T1, CLOSURE_PLUS);\n\n      CHECK(Equiv(C, P));\n    }\n\n    if (Weight::Properties() & kRightSemiring) {\n      VLOG(1) << \"Check T* T == T+ (delayed).\";\n      ClosureFst<Arc> S(T1, CLOSURE_STAR);\n      ConcatFst<Arc> C(S, T1);\n\n      ClosureFst<Arc> P(T1, CLOSURE_PLUS);\n\n      CHECK(Equiv(C, P));\n    }\n  }\n\n  // Tests map-based operations.\n  void TestMap(const Fst<Arc> &T) {\n    {\n      VLOG(1) << \"Check destructive and delayed projection are equivalent.\";\n      VectorFst<Arc> P1(T);\n      Project(&P1, PROJECT_INPUT);\n      ProjectFst<Arc> P2(T, PROJECT_INPUT);\n      CHECK(Equiv(P1, P2));\n    }\n\n    {\n      VLOG(1) << \"Check destructive and delayed inversion are equivalent.\";\n      VectorFst<Arc> I1(T);\n      Invert(&I1);\n      InvertFst<Arc> I2(T);\n      CHECK(Equiv(I1, I2));\n    }\n\n    {\n      VLOG(1) << \"Check Pi_1(T) = Pi_2(T^-1) (destructive).\";\n      VectorFst<Arc> P1(T);\n      VectorFst<Arc> I1(T);\n      Project(&P1, PROJECT_INPUT);\n      Invert(&I1);\n      Project(&I1, PROJECT_OUTPUT);\n      CHECK(Equiv(P1, I1));\n    }\n\n    {\n      VLOG(1) << \"Check Pi_2(T) = Pi_1(T^-1) (destructive).\";\n      VectorFst<Arc> P1(T);\n      VectorFst<Arc> I1(T);\n      Project(&P1, PROJECT_OUTPUT);\n      Invert(&I1);\n      Project(&I1, PROJECT_INPUT);\n      CHECK(Equiv(P1, I1));\n    }\n\n    {\n      VLOG(1) << \"Check Pi_1(T) = Pi_2(T^-1) (delayed).\";\n      ProjectFst<Arc> P1(T, PROJECT_INPUT);\n      InvertFst<Arc> I1(T);\n      ProjectFst<Arc> P2(I1, PROJECT_OUTPUT);\n      CHECK(Equiv(P1, P2));\n    }\n\n    {\n      VLOG(1) << \"Check Pi_2(T) = Pi_1(T^-1) (delayed).\";\n      ProjectFst<Arc> P1(T, PROJECT_OUTPUT);\n      InvertFst<Arc> I1(T);\n      ProjectFst<Arc> P2(I1, PROJECT_INPUT);\n      CHECK(Equiv(P1, P2));\n    }\n\n    {\n      VLOG(1) << \"Check destructive relabeling\";\n      static const int kNumLabels = 10;\n      // set up relabeling pairs\n      std::vector<Label> labelset(kNumLabels);\n      for (size_t i = 0; i < kNumLabels; ++i) labelset[i] = i;\n      for (size_t i = 0; i < kNumLabels; ++i) {\n        using std::swap;\n        swap(labelset[i], labelset[rand() % kNumLabels]);\n      }\n\n      std::vector<std::pair<Label, Label>> ipairs1(kNumLabels);\n      std::vector<std::pair<Label, Label>> opairs1(kNumLabels);\n      for (size_t i = 0; i < kNumLabels; ++i) {\n        ipairs1[i] = std::make_pair(i, labelset[i]);\n        opairs1[i] = std::make_pair(labelset[i], i);\n      }\n      VectorFst<Arc> R(T);\n      Relabel(&R, ipairs1, opairs1);\n\n      std::vector<std::pair<Label, Label>> ipairs2(kNumLabels);\n      std::vector<std::pair<Label, Label>> opairs2(kNumLabels);\n      for (size_t i = 0; i < kNumLabels; ++i) {\n        ipairs2[i] = std::make_pair(labelset[i], i);\n        opairs2[i] = std::make_pair(i, labelset[i]);\n      }\n      Relabel(&R, ipairs2, opairs2);\n      CHECK(Equiv(R, T));\n\n      VLOG(1) << \"Check on-the-fly relabeling\";\n      RelabelFst<Arc> Rdelay(T, ipairs1, opairs1);\n\n      RelabelFst<Arc> RRdelay(Rdelay, ipairs2, opairs2);\n      CHECK(Equiv(RRdelay, T));\n    }\n\n    {\n      VLOG(1) << \"Check encoding/decoding (destructive).\";\n      VectorFst<Arc> D(T);\n      uint32 encode_props = 0;\n      if (rand() % 2) encode_props |= kEncodeLabels;\n      if (rand() % 2) encode_props |= kEncodeWeights;\n      EncodeMapper<Arc> encoder(encode_props, ENCODE);\n      Encode(&D, &encoder);\n      Decode(&D, encoder);\n      CHECK(Equiv(D, T));\n    }\n\n    {\n      VLOG(1) << \"Check encoding/decoding (delayed).\";\n      uint32 encode_props = 0;\n      if (rand() % 2) encode_props |= kEncodeLabels;\n      if (rand() % 2) encode_props |= kEncodeWeights;\n      EncodeMapper<Arc> encoder(encode_props, ENCODE);\n      EncodeFst<Arc> E(T, &encoder);\n      VectorFst<Arc> Encoded(E);\n      DecodeFst<Arc> D(Encoded, encoder);\n      CHECK(Equiv(D, T));\n    }\n\n    {\n      VLOG(1) << \"Check gallic mappers (constructive).\";\n      ToGallicMapper<Arc> to_mapper;\n      FromGallicMapper<Arc> from_mapper;\n      VectorFst<GallicArc<Arc>> G;\n      VectorFst<Arc> F;\n      ArcMap(T, &G, to_mapper);\n      ArcMap(G, &F, from_mapper);\n      CHECK(Equiv(T, F));\n    }\n\n    {\n      VLOG(1) << \"Check gallic mappers (delayed).\";\n      ToGallicMapper<Arc> to_mapper;\n      FromGallicMapper<Arc> from_mapper;\n      ArcMapFst<Arc, GallicArc<Arc>, ToGallicMapper<Arc>> G(T, to_mapper);\n      ArcMapFst<GallicArc<Arc>, Arc, FromGallicMapper<Arc>> F(G, from_mapper);\n      CHECK(Equiv(T, F));\n    }\n  }\n\n  // Tests compose-based operations.\n  void TestCompose(const Fst<Arc> &T1, const Fst<Arc> &T2, const Fst<Arc> &T3) {\n    if (!(Weight::Properties() & kCommutative)) return;\n\n    VectorFst<Arc> S1(T1);\n    VectorFst<Arc> S2(T2);\n    VectorFst<Arc> S3(T3);\n\n    ILabelCompare<Arc> icomp;\n    OLabelCompare<Arc> ocomp;\n\n    ArcSort(&S1, ocomp);\n    ArcSort(&S2, ocomp);\n    ArcSort(&S3, icomp);\n\n    {\n      VLOG(1) << \"Check composition is associative.\";\n      ComposeFst<Arc> C1(S1, S2);\n      ComposeFst<Arc> C2(C1, S3);\n      ComposeFst<Arc> C3(S2, S3);\n      ComposeFst<Arc> C4(S1, C3);\n\n      CHECK(Equiv(C2, C4));\n    }\n\n    {\n      VLOG(1) << \"Check composition left distributes over union.\";\n      UnionFst<Arc> U1(S2, S3);\n      ComposeFst<Arc> C1(S1, U1);\n\n      ComposeFst<Arc> C2(S1, S2);\n      ComposeFst<Arc> C3(S1, S3);\n      UnionFst<Arc> U2(C2, C3);\n\n      CHECK(Equiv(C1, U2));\n    }\n\n    {\n      VLOG(1) << \"Check composition right distributes over union.\";\n      UnionFst<Arc> U1(S1, S2);\n      ComposeFst<Arc> C1(U1, S3);\n\n      ComposeFst<Arc> C2(S1, S3);\n      ComposeFst<Arc> C3(S2, S3);\n      UnionFst<Arc> U2(C2, C3);\n\n      CHECK(Equiv(C1, U2));\n    }\n\n    VectorFst<Arc> A1(S1);\n    VectorFst<Arc> A2(S2);\n    VectorFst<Arc> A3(S3);\n    Project(&A1, PROJECT_OUTPUT);\n    Project(&A2, PROJECT_INPUT);\n    Project(&A3, PROJECT_INPUT);\n\n    {\n      VLOG(1) << \"Check intersection is commutative.\";\n      IntersectFst<Arc> I1(A1, A2);\n      IntersectFst<Arc> I2(A2, A1);\n      CHECK(Equiv(I1, I2));\n    }\n\n    {\n      VLOG(1) << \"Check all epsilon filters leads to equivalent results.\";\n      typedef Matcher<Fst<Arc>> M;\n      ComposeFst<Arc> C1(S1, S2);\n      ComposeFst<Arc> C2(\n          S1, S2, ComposeFstOptions<Arc, M, AltSequenceComposeFilter<M>>());\n      ComposeFst<Arc> C3(S1, S2,\n                         ComposeFstOptions<Arc, M, MatchComposeFilter<M>>());\n\n      CHECK(Equiv(C1, C2));\n      CHECK(Equiv(C1, C3));\n\n      if ((Weight::Properties() & kIdempotent) ||\n          S1.Properties(kNoOEpsilons, false) ||\n          S2.Properties(kNoIEpsilons, false)) {\n        ComposeFst<Arc> C4(\n            S1, S2, ComposeFstOptions<Arc, M, TrivialComposeFilter<M>>());\n        CHECK(Equiv(C1, C4));\n      }\n\n      if (S1.Properties(kNoOEpsilons, false) &&\n          S2.Properties(kNoIEpsilons, false)) {\n        ComposeFst<Arc> C5(S1, S2,\n                           ComposeFstOptions<Arc, M, NullComposeFilter<M>>());\n        CHECK(Equiv(C1, C5));\n      }\n    }\n\n    {\n      VLOG(1) << \"Check look-ahead filters lead to equivalent results.\";\n      VectorFst<Arc> C1, C2;\n      Compose(S1, S2, &C1);\n      LookAheadCompose(S1, S2, &C2);\n      CHECK(Equiv(C1, C2));\n    }\n  }\n\n  // Tests sorting operations\n  void TestSort(const Fst<Arc> &T) {\n    ILabelCompare<Arc> icomp;\n    OLabelCompare<Arc> ocomp;\n\n    {\n      VLOG(1) << \"Check arc sorted Fst is equivalent to its input.\";\n      VectorFst<Arc> S1(T);\n      ArcSort(&S1, icomp);\n      CHECK(Equiv(T, S1));\n    }\n\n    {\n      VLOG(1) << \"Check destructive and delayed arcsort are equivalent.\";\n      VectorFst<Arc> S1(T);\n      ArcSort(&S1, icomp);\n      ArcSortFst<Arc, ILabelCompare<Arc>> S2(T, icomp);\n      CHECK(Equiv(S1, S2));\n    }\n\n    {\n      VLOG(1) << \"Check ilabel sorting vs. olabel sorting with inversions.\";\n      VectorFst<Arc> S1(T);\n      VectorFst<Arc> S2(T);\n      ArcSort(&S1, icomp);\n      Invert(&S2);\n      ArcSort(&S2, ocomp);\n      Invert(&S2);\n      CHECK(Equiv(S1, S2));\n    }\n\n    {\n      VLOG(1) << \"Check topologically sorted Fst is equivalent to its input.\";\n      VectorFst<Arc> S1(T);\n      TopSort(&S1);\n      CHECK(Equiv(T, S1));\n    }\n\n    {\n      VLOG(1) << \"Check reverse(reverse(T)) = T\";\n      for (int i = 0; i < 2; ++i) {\n        VectorFst<ReverseArc<Arc>> R1;\n        VectorFst<Arc> R2;\n        bool require_superinitial = i == 1;\n        Reverse(T, &R1, require_superinitial);\n        Reverse(R1, &R2, require_superinitial);\n        CHECK(Equiv(T, R2));\n      }\n    }\n  }\n\n  // Tests optimization operations\n  void TestOptimize(const Fst<Arc> &T) {\n    uint64 tprops = T.Properties(kFstProperties, true);\n    uint64 wprops = Weight::Properties();\n\n    VectorFst<Arc> A(T);\n    Project(&A, PROJECT_INPUT);\n    {\n      VLOG(1) << \"Check connected FST is equivalent to its input.\";\n      VectorFst<Arc> C1(T);\n      Connect(&C1);\n      CHECK(Equiv(T, C1));\n    }\n\n    if ((wprops & kSemiring) == kSemiring &&\n        (tprops & kAcyclic || wprops & kIdempotent)) {\n      VLOG(1) << \"Check epsilon-removed FST is equivalent to its input.\";\n      VectorFst<Arc> R1(T);\n      RmEpsilon(&R1);\n      CHECK(Equiv(T, R1));\n\n      VLOG(1) << \"Check destructive and delayed epsilon removal\"\n              << \"are equivalent.\";\n      RmEpsilonFst<Arc> R2(T);\n      CHECK(Equiv(R1, R2));\n\n      VLOG(1) << \"Check an FST with a large proportion\"\n              << \" of epsilon transitions:\";\n      // Maps all transitions of T to epsilon-transitions and append\n      // a non-epsilon transition.\n      VectorFst<Arc> U;\n      ArcMap(T, &U, EpsMapper<Arc>());\n      VectorFst<Arc> V;\n      V.SetStart(V.AddState());\n      Arc arc(1, 1, Weight::One(), V.AddState());\n      V.AddArc(V.Start(), arc);\n      V.SetFinal(arc.nextstate, Weight::One());\n      Concat(&U, V);\n      // Check that epsilon-removal preserves the shortest-distance\n      // from the initial state to the final states.\n      std::vector<Weight> d;\n      ShortestDistance(U, &d, true);\n      Weight w = U.Start() < d.size() ? d[U.Start()] : Weight::Zero();\n      VectorFst<Arc> U1(U);\n      RmEpsilon(&U1);\n      ShortestDistance(U1, &d, true);\n      Weight w1 = U1.Start() < d.size() ? d[U1.Start()] : Weight::Zero();\n      CHECK(ApproxEqual(w, w1, kTestDelta));\n      RmEpsilonFst<Arc> U2(U);\n      ShortestDistance(U2, &d, true);\n      Weight w2 = U2.Start() < d.size() ? d[U2.Start()] : Weight::Zero();\n      CHECK(ApproxEqual(w, w2, kTestDelta));\n    }\n\n    if ((wprops & kSemiring) == kSemiring && tprops & kAcyclic) {\n      VLOG(1) << \"Check determinized FSA is equivalent to its input.\";\n      DeterminizeFst<Arc> D(A);\n      CHECK(Equiv(A, D));\n\n      {\n        VLOG(1) << \"Check determinized FST is equivalent to its input.\";\n        DeterminizeFstOptions<Arc> opts;\n        opts.type = DETERMINIZE_NONFUNCTIONAL;\n        DeterminizeFst<Arc> DT(T, opts);\n        CHECK(Equiv(T, DT));\n      }\n\n      if ((wprops & (kPath | kCommutative)) == (kPath | kCommutative)) {\n        VLOG(1) << \"Check pruning in determinization\";\n        VectorFst<Arc> P;\n        Weight threshold = (*weight_generator_)();\n        DeterminizeOptions<Arc> opts;\n        opts.weight_threshold = threshold;\n        Determinize(A, &P, opts);\n        CHECK(P.Properties(kIDeterministic, true));\n        CHECK(PruneEquiv(A, P, threshold));\n      }\n\n      if ((wprops & kPath) == kPath) {\n        VLOG(1) << \"Check min-determinization\";\n\n        // Ensures no input epsilons\n        VectorFst<Arc> R(T);\n        std::vector<std::pair<Label, Label>> ipairs, opairs;\n        ipairs.push_back(std::pair<Label, Label>(0, 1));\n        Relabel(&R, ipairs, opairs);\n\n        VectorFst<Arc> M;\n        DeterminizeOptions<Arc> opts;\n        opts.type = DETERMINIZE_DISAMBIGUATE;\n        Determinize(R, &M, opts);\n        CHECK(M.Properties(kIDeterministic, true));\n        CHECK(MinRelated(M, R));\n      }\n\n      int n;\n      {\n        VLOG(1) << \"Check size(min(det(A))) <= size(det(A))\"\n                << \" and  min(det(A)) equiv det(A)\";\n        VectorFst<Arc> M(D);\n        n = M.NumStates();\n        Minimize(&M, static_cast<MutableFst<Arc> *>(nullptr), kDelta);\n        CHECK(Equiv(D, M));\n        CHECK(M.NumStates() <= n);\n        n = M.NumStates();\n      }\n\n      if (n && (wprops & kIdempotent) == kIdempotent &&\n          A.Properties(kNoEpsilons, true)) {\n        VLOG(1) << \"Check that Revuz's algorithm leads to the\"\n                << \" same number of states as Brozozowski's algorithm\";\n\n        // Skip test if A is the empty machine or contains epsilons or\n        // if the semiring is not idempotent (to avoid floating point\n        // errors)\n        VectorFst<Arc> R;\n        Reverse(A, &R);\n        RmEpsilon(&R);\n        DeterminizeFst<Arc> DR(R);\n        VectorFst<Arc> RD;\n        Reverse(DR, &RD);\n        DeterminizeFst<Arc> DRD(RD);\n        VectorFst<Arc> M(DRD);\n        CHECK_EQ(n + 1, M.NumStates());  // Accounts for the epsilon transition\n                                         // to the initial state\n      }\n    }\n\n    if ((wprops & kSemiring) == kSemiring && tprops & kAcyclic) {\n      VLOG(1) << \"Check disambiguated FSA is equivalent to its input.\";\n      VectorFst<Arc> R(A), D;\n      RmEpsilon(&R);\n      Disambiguate(R, &D);\n      CHECK(Equiv(R, D));\n      VLOG(1) << \"Check disambiguated FSA is unambiguous\";\n      CHECK(Unambiguous(D));\n\n      /* TODO(riley): find out why this fails\n      if ((wprops & (kPath | kCommutative)) == (kPath | kCommutative)) {\n        VLOG(1)  << \"Check pruning in disambiguation\";\n        VectorFst<Arc> P;\n        Weight threshold = (*weight_generator_)();\n        DisambiguateOptions<Arc> opts;\n        opts.weight_threshold = threshold;\n        Disambiguate(R, &P, opts);\n        CHECK(Unambiguous(P));\n        CHECK(PruneEquiv(A, P, threshold));\n      }\n      */\n    }\n\n    if (Arc::Type() == LogArc::Type() || Arc::Type() == StdArc::Type()) {\n      VLOG(1) << \"Check reweight(T) equiv T\";\n      std::vector<Weight> potential;\n      VectorFst<Arc> RI(T);\n      VectorFst<Arc> RF(T);\n      while (potential.size() < RI.NumStates())\n        potential.push_back((*weight_generator_)());\n\n      Reweight(&RI, potential, REWEIGHT_TO_INITIAL);\n      CHECK(Equiv(T, RI));\n\n      Reweight(&RF, potential, REWEIGHT_TO_FINAL);\n      CHECK(Equiv(T, RF));\n    }\n\n    if ((wprops & kIdempotent) || (tprops & kAcyclic)) {\n      VLOG(1) << \"Check pushed FST is equivalent to input FST.\";\n      // Pushing towards the final state.\n      if (wprops & kRightSemiring) {\n        VectorFst<Arc> P1;\n        Push<Arc, REWEIGHT_TO_FINAL>(T, &P1, kPushLabels);\n        CHECK(Equiv(T, P1));\n\n        VectorFst<Arc> P2;\n        Push<Arc, REWEIGHT_TO_FINAL>(T, &P2, kPushWeights);\n        CHECK(Equiv(T, P2));\n\n        VectorFst<Arc> P3;\n        Push<Arc, REWEIGHT_TO_FINAL>(T, &P3, kPushLabels | kPushWeights);\n        CHECK(Equiv(T, P3));\n      }\n\n      // Pushing towards the initial state.\n      if (wprops & kLeftSemiring) {\n        VectorFst<Arc> P1;\n        Push<Arc, REWEIGHT_TO_INITIAL>(T, &P1, kPushLabels);\n        CHECK(Equiv(T, P1));\n\n        VectorFst<Arc> P2;\n        Push<Arc, REWEIGHT_TO_INITIAL>(T, &P2, kPushWeights);\n        CHECK(Equiv(T, P2));\n        VectorFst<Arc> P3;\n        Push<Arc, REWEIGHT_TO_INITIAL>(T, &P3, kPushLabels | kPushWeights);\n        CHECK(Equiv(T, P3));\n      }\n    }\n\n    if ((wprops & (kPath | kCommutative)) == (kPath | kCommutative)) {\n      VLOG(1) << \"Check pruning algorithm\";\n      {\n        VLOG(1) << \"Check equiv. of constructive and destructive algorithms\";\n        Weight thresold = (*weight_generator_)();\n        VectorFst<Arc> P1(T);\n        Prune(&P1, thresold);\n        VectorFst<Arc> P2;\n        Prune(T, &P2, thresold);\n        CHECK(Equiv(P1, P2));\n      }\n\n      {\n        VLOG(1) << \"Check prune(reverse) equiv reverse(prune)\";\n        Weight thresold = (*weight_generator_)();\n        VectorFst<ReverseArc<Arc>> R;\n        VectorFst<Arc> P1(T);\n        VectorFst<Arc> P2;\n        Prune(&P1, thresold);\n        Reverse(T, &R);\n        Prune(&R, thresold.Reverse());\n        Reverse(R, &P2);\n        CHECK(Equiv(P1, P2));\n      }\n      {\n        VLOG(1) << \"Check: ShortestDistance(A - prune(A))\"\n                << \" > ShortestDistance(A) times Threshold\";\n        Weight threshold = (*weight_generator_)();\n        VectorFst<Arc> P;\n        Prune(A, &P, threshold);\n        CHECK(PruneEquiv(A, P, threshold));\n      }\n    }\n    if (tprops & kAcyclic) {\n      VLOG(1) << \"Check synchronize(T) equiv T\";\n      SynchronizeFst<Arc> S(T);\n      CHECK(Equiv(T, S));\n    }\n  }\n\n  // Tests search operations\n  void TestSearch(const Fst<Arc> &T) {\n    uint64 wprops = Weight::Properties();\n\n    VectorFst<Arc> A(T);\n    Project(&A, PROJECT_INPUT);\n\n    if ((wprops & (kPath | kRightSemiring)) == (kPath | kRightSemiring)) {\n      VLOG(1) << \"Check 1-best weight.\";\n      VectorFst<Arc> path;\n      ShortestPath(T, &path);\n      Weight tsum = ShortestDistance(T);\n      Weight psum = ShortestDistance(path);\n      CHECK(ApproxEqual(tsum, psum, kTestDelta));\n    }\n\n    if ((wprops & (kPath | kSemiring)) == (kPath | kSemiring)) {\n      VLOG(1) << \"Check n-best weights\";\n      VectorFst<Arc> R(A);\n      RmEpsilon(&R, /*connect=*/ true, Arc::Weight::Zero(), kNoStateId,\n                kDelta);\n      int nshortest = rand() % kNumRandomShortestPaths + 2;\n      VectorFst<Arc> paths;\n      ShortestPath(R, &paths, nshortest, /*unique=*/ true,\n                   /*first_path=*/ false, Weight::Zero(), kNumShortestStates,\n                   kDelta);\n      std::vector<Weight> distance;\n      ShortestDistance(paths, &distance, true, kDelta);\n      StateId pstart = paths.Start();\n      if (pstart != kNoStateId) {\n        ArcIterator<Fst<Arc>> piter(paths, pstart);\n        for (; !piter.Done(); piter.Next()) {\n          StateId s = piter.Value().nextstate;\n          Weight nsum = s < distance.size()\n                            ? Times(piter.Value().weight, distance[s])\n                            : Weight::Zero();\n          VectorFst<Arc> path;\n          ShortestPath(R, &path, 1, false, false, Weight::Zero(), kNoStateId,\n                       kDelta);\n          Weight dsum = ShortestDistance(path, kDelta);\n          CHECK(ApproxEqual(nsum, dsum, kTestDelta));\n          ArcMap(&path, RmWeightMapper<Arc>());\n          VectorFst<Arc> S;\n          Difference(R, path, &S);\n          R = S;\n        }\n      }\n    }\n  }\n\n  // Tests if two FSTS are equivalent by checking if random\n  // strings from one FST are transduced the same by both FSTs.\n  template <class A>\n  bool Equiv(const Fst<A> &fst1, const Fst<A> &fst2) {\n    VLOG(1) << \"Check FSTs for sanity (including property bits).\";\n    CHECK(Verify(fst1));\n    CHECK(Verify(fst2));\n\n    // Ensures seed used once per instantiation.\n    static UniformArcSelector<A> uniform_selector(seed_);\n    RandGenOptions<UniformArcSelector<A>> opts(uniform_selector,\n                                               kRandomPathLength);\n    return RandEquivalent(fst1, fst2, kNumRandomPaths, kTestDelta, opts);\n  }\n\n  // Tests FSA is unambiguous\n  bool Unambiguous(const Fst<Arc> &fst) {\n    VectorFst<StdArc> sfst, dfst;\n    VectorFst<LogArc> lfst1, lfst2;\n    Map(fst, &sfst, RmWeightMapper<Arc, StdArc>());\n    Determinize(sfst, &dfst);\n    Map(fst, &lfst1, RmWeightMapper<Arc, LogArc>());\n    Map(dfst, &lfst2, RmWeightMapper<StdArc, LogArc>());\n    return Equiv(lfst1, lfst2);\n  }\n\n  // Ensures input-epsilon free transducers fst1 and fst2 have the\n  // same domain and that for each string pair '(is, os)' in fst1,\n  // '(is, os)' is the minimum weight match to 'is' in fst2.\n  template <class A>\n  bool MinRelated(const Fst<A> &fst1, const Fst<A> &fst2) {\n    // Same domain\n    VectorFst<Arc> P1(fst1), P2(fst2);\n    Project(&P1, PROJECT_INPUT);\n    Project(&P2, PROJECT_INPUT);\n    if (!Equiv(P1, P2)) {\n      LOG(ERROR) << \"Inputs not equivalent\";\n      return false;\n    }\n\n    // Ensures seed used once per instantiation.\n    static UniformArcSelector<A> uniform_selector(seed_);\n    RandGenOptions<UniformArcSelector<A>> opts(uniform_selector,\n                                               kRandomPathLength);\n\n    VectorFst<Arc> path, paths1, paths2;\n    for (std::ptrdiff_t n = 0; n < kNumRandomPaths; ++n) {\n      RandGen(fst1, &path, opts);\n      Invert(&path);\n      Map(&path, RmWeightMapper<Arc>());\n      Compose(path, fst2, &paths1);\n      Weight sum1 = ShortestDistance(paths1);\n      Compose(paths1, path, &paths2);\n      Weight sum2 = ShortestDistance(paths2);\n      if (!ApproxEqual(Plus(sum1, sum2), sum2, kTestDelta)) {\n        LOG(ERROR) << \"Sums not equivalent: \" << sum1 << \" \" << sum2;\n        return false;\n      }\n    }\n    return true;\n  }\n\n  // Tests ShortestDistance(A - P) >=\n  // ShortestDistance(A) times Threshold.\n  template <class A>\n  bool PruneEquiv(const Fst<A> &fst, const Fst<A> &pfst, Weight threshold) {\n    VLOG(1) << \"Check FSTs for sanity (including property bits).\";\n    CHECK(Verify(fst));\n    CHECK(Verify(pfst));\n\n    DifferenceFst<Arc> D(fst, DeterminizeFst<Arc>(RmEpsilonFst<Arc>(\n                                  ArcMapFst<Arc, Arc, RmWeightMapper<Arc>>(\n                                      pfst, RmWeightMapper<Arc>()))));\n    Weight sum1 = Times(ShortestDistance(fst), threshold);\n    Weight sum2 = ShortestDistance(D);\n    return ApproxEqual(Plus(sum1, sum2), sum1, kTestDelta);\n  }\n\n  // Random seed.\n  int seed_;\n  // FST with no states\n  VectorFst<Arc> zero_fst_;\n  // FST with one state that accepts epsilon.\n  VectorFst<Arc> one_fst_;\n  // FST with one state that accepts all strings.\n  VectorFst<Arc> univ_fst_;\n  // Generates weights used in testing.\n  WeightGenerator *weight_generator_;\n  // Maximum random path length.\n  static const int kRandomPathLength;\n  // Number of random paths to explore.\n  static const int kNumRandomPaths;\n  // Maximum number of nshortest paths.\n  static const int kNumRandomShortestPaths;\n  // Maximum number of nshortest states.\n  static const int kNumShortestStates;\n  // Delta for equivalence tests.\n  static const float kTestDelta;\n\n  WeightedTester(const WeightedTester &) = delete;\n  WeightedTester &operator=(const WeightedTester &) = delete;\n};\n\ntemplate <class A, class WG>\nconst int WeightedTester<A, WG>::kRandomPathLength = 25;\n\ntemplate <class A, class WG>\nconst int WeightedTester<A, WG>::kNumRandomPaths = 100;\n\ntemplate <class A, class WG>\nconst int WeightedTester<A, WG>::kNumRandomShortestPaths = 100;\n\ntemplate <class A, class WG>\nconst int WeightedTester<A, WG>::kNumShortestStates = 10000;\n\ntemplate <class A, class WG>\nconst float WeightedTester<A, WG>::kTestDelta = .05;\n\n// This class tests a variety of identities and properties that must\n// hold for various algorithms on unweighted FSAs and that are not tested\n// by WeightedTester. Only the specialization does anything interesting.\ntemplate <class Arc>\nclass UnweightedTester {\n public:\n  UnweightedTester(const Fst<Arc> &zero_fsa, const Fst<Arc> &one_fsa,\n                   const Fst<Arc> &univ_fsa) {}\n\n  void Test(const Fst<Arc> &A1, const Fst<Arc> &A2, const Fst<Arc> &A3) {}\n};\n\n// Specialization for StdArc. This should work for any commutative,\n// idempotent semiring when restricted to the unweighted case\n// (being isomorphic to the boolean semiring).\ntemplate <>\nclass UnweightedTester<StdArc> {\n public:\n  typedef StdArc Arc;\n  typedef Arc::Label Label;\n  typedef Arc::StateId StateId;\n  typedef Arc::Weight Weight;\n\n  UnweightedTester(const Fst<Arc> &zero_fsa, const Fst<Arc> &one_fsa,\n                   const Fst<Arc> &univ_fsa)\n      : zero_fsa_(zero_fsa), one_fsa_(one_fsa), univ_fsa_(univ_fsa) {}\n\n  void Test(const Fst<Arc> &A1, const Fst<Arc> &A2, const Fst<Arc> &A3) {\n    TestRational(A1, A2, A3);\n    TestIntersect(A1, A2, A3);\n    TestOptimize(A1);\n  }\n\n private:\n  // Tests rational operations with identities\n  void TestRational(const Fst<Arc> &A1, const Fst<Arc> &A2,\n                    const Fst<Arc> &A3) {\n    {\n      VLOG(1) << \"Check the union contains its arguments (destructive).\";\n      VectorFst<Arc> U(A1);\n      Union(&U, A2);\n\n      CHECK(Subset(A1, U));\n      CHECK(Subset(A2, U));\n    }\n\n    {\n      VLOG(1) << \"Check the union contains its arguments (delayed).\";\n      UnionFst<Arc> U(A1, A2);\n\n      CHECK(Subset(A1, U));\n      CHECK(Subset(A2, U));\n    }\n\n    {\n      VLOG(1) << \"Check if A^n c A* (destructive).\";\n      VectorFst<Arc> C(one_fsa_);\n      int n = rand() % 5;\n      for (int i = 0; i < n; ++i) Concat(&C, A1);\n\n      VectorFst<Arc> S(A1);\n      Closure(&S, CLOSURE_STAR);\n      CHECK(Subset(C, S));\n    }\n\n    {\n      VLOG(1) << \"Check if A^n c A* (delayed).\";\n      int n = rand() % 5;\n      Fst<Arc> *C = new VectorFst<Arc>(one_fsa_);\n      for (int i = 0; i < n; ++i) {\n        ConcatFst<Arc> *F = new ConcatFst<Arc>(*C, A1);\n        delete C;\n        C = F;\n      }\n      ClosureFst<Arc> S(A1, CLOSURE_STAR);\n      CHECK(Subset(*C, S));\n      delete C;\n    }\n  }\n\n  // Tests intersect-based operations.\n  void TestIntersect(const Fst<Arc> &A1, const Fst<Arc> &A2,\n                     const Fst<Arc> &A3) {\n    VectorFst<Arc> S1(A1);\n    VectorFst<Arc> S2(A2);\n    VectorFst<Arc> S3(A3);\n\n    ILabelCompare<Arc> comp;\n\n    ArcSort(&S1, comp);\n    ArcSort(&S2, comp);\n    ArcSort(&S3, comp);\n\n    {\n      VLOG(1) << \"Check the intersection is contained in its arguments.\";\n      IntersectFst<Arc> I1(S1, S2);\n      CHECK(Subset(I1, S1));\n      CHECK(Subset(I1, S2));\n    }\n\n    {\n      VLOG(1) << \"Check union distributes over intersection.\";\n      IntersectFst<Arc> I1(S1, S2);\n      UnionFst<Arc> U1(I1, S3);\n\n      UnionFst<Arc> U2(S1, S3);\n      UnionFst<Arc> U3(S2, S3);\n      ArcSortFst<Arc, ILabelCompare<Arc>> S4(U3, comp);\n      IntersectFst<Arc> I2(U2, S4);\n\n      CHECK(Equiv(U1, I2));\n    }\n\n    VectorFst<Arc> C1;\n    VectorFst<Arc> C2;\n    Complement(S1, &C1);\n    Complement(S2, &C2);\n    ArcSort(&C1, comp);\n    ArcSort(&C2, comp);\n\n    {\n      VLOG(1) << \"Check S U S' = Sigma*\";\n      UnionFst<Arc> U(S1, C1);\n      CHECK(Equiv(U, univ_fsa_));\n    }\n\n    {\n      VLOG(1) << \"Check S n S' = {}\";\n      IntersectFst<Arc> I(S1, C1);\n      CHECK(Equiv(I, zero_fsa_));\n    }\n\n    {\n      VLOG(1) << \"Check (S1' U S2') == (S1 n S2)'\";\n      UnionFst<Arc> U(C1, C2);\n\n      IntersectFst<Arc> I(S1, S2);\n      VectorFst<Arc> C3;\n      Complement(I, &C3);\n      CHECK(Equiv(U, C3));\n    }\n\n    {\n      VLOG(1) << \"Check (S1' n S2') == (S1 U S2)'\";\n      IntersectFst<Arc> I(C1, C2);\n\n      UnionFst<Arc> U(S1, S2);\n      VectorFst<Arc> C3;\n      Complement(U, &C3);\n      CHECK(Equiv(I, C3));\n    }\n  }\n\n  // Tests optimization operations\n  void TestOptimize(const Fst<Arc> &A) {\n    {\n      VLOG(1) << \"Check determinized FSA is equivalent to its input.\";\n      DeterminizeFst<Arc> D(A);\n      CHECK(Equiv(A, D));\n    }\n\n    {\n      VLOG(1) << \"Check disambiguated FSA is equivalent to its input.\";\n      VectorFst<Arc> R(A), D;\n      RmEpsilon(&R);\n\n      Disambiguate(R, &D);\n      CHECK(Equiv(R, D));\n    }\n\n    {\n      VLOG(1) << \"Check minimized FSA is equivalent to its input.\";\n      int n;\n      {\n        RmEpsilonFst<Arc> R(A);\n        DeterminizeFst<Arc> D(R);\n        VectorFst<Arc> M(D);\n        Minimize(&M, static_cast<MutableFst<Arc> *>(nullptr), kDelta);\n        CHECK(Equiv(A, M));\n        n = M.NumStates();\n      }\n\n      if (n) {  // Skip test if A is the empty machine\n        VLOG(1) << \"Check that Hopcroft's and Revuz's algorithms lead to the\"\n                << \" same number of states as Brozozowski's algorithm\";\n        VectorFst<Arc> R;\n        Reverse(A, &R);\n        RmEpsilon(&R);\n        DeterminizeFst<Arc> DR(R);\n        VectorFst<Arc> RD;\n        Reverse(DR, &RD);\n        DeterminizeFst<Arc> DRD(RD);\n        VectorFst<Arc> M(DRD);\n        CHECK_EQ(n + 1, M.NumStates());  // Accounts for the epsilon transition\n                                         // to the initial state\n      }\n    }\n  }\n\n  // Tests if two FSAS are equivalent.\n  bool Equiv(const Fst<Arc> &fsa1, const Fst<Arc> &fsa2) {\n    VLOG(1) << \"Check FSAs for sanity (including property bits).\";\n    CHECK(Verify(fsa1));\n    CHECK(Verify(fsa2));\n\n    VectorFst<Arc> vfsa1(fsa1);\n    VectorFst<Arc> vfsa2(fsa2);\n    RmEpsilon(&vfsa1);\n    RmEpsilon(&vfsa2);\n    DeterminizeFst<Arc> dfa1(vfsa1);\n    DeterminizeFst<Arc> dfa2(vfsa2);\n\n    // Test equivalence using union-find algorithm\n    bool equiv1 = Equivalent(dfa1, dfa2);\n\n    // Test equivalence by checking if (S1 - S2) U (S2 - S1) is empty\n    ILabelCompare<Arc> comp;\n    VectorFst<Arc> sdfa1(dfa1);\n    ArcSort(&sdfa1, comp);\n    VectorFst<Arc> sdfa2(dfa2);\n    ArcSort(&sdfa2, comp);\n\n    DifferenceFst<Arc> dfsa1(sdfa1, sdfa2);\n    DifferenceFst<Arc> dfsa2(sdfa2, sdfa1);\n\n    VectorFst<Arc> ufsa(dfsa1);\n    Union(&ufsa, dfsa2);\n    Connect(&ufsa);\n    bool equiv2 = ufsa.NumStates() == 0;\n\n    // Check two equivalence tests match\n    CHECK((equiv1 && equiv2) || (!equiv1 && !equiv2));\n\n    return equiv1;\n  }\n\n  // Tests if FSA1 is a subset of FSA2 (disregarding weights).\n  bool Subset(const Fst<Arc> &fsa1, const Fst<Arc> &fsa2) {\n    VLOG(1) << \"Check FSAs (incl. property bits) for sanity\";\n    CHECK(Verify(fsa1));\n    CHECK(Verify(fsa2));\n\n    VectorFst<StdArc> vfsa1;\n    VectorFst<StdArc> vfsa2;\n    RmEpsilon(&vfsa1);\n    RmEpsilon(&vfsa2);\n    ILabelCompare<StdArc> comp;\n    ArcSort(&vfsa1, comp);\n    ArcSort(&vfsa2, comp);\n    IntersectFst<StdArc> ifsa(vfsa1, vfsa2);\n    DeterminizeFst<StdArc> dfa1(vfsa1);\n    DeterminizeFst<StdArc> dfa2(ifsa);\n    return Equivalent(dfa1, dfa2);\n  }\n\n  // Returns complement Fsa\n  void Complement(const Fst<Arc> &ifsa, MutableFst<Arc> *ofsa) {\n    RmEpsilonFst<Arc> rfsa(ifsa);\n    DeterminizeFst<Arc> dfa(rfsa);\n    DifferenceFst<Arc> cfsa(univ_fsa_, dfa);\n    *ofsa = cfsa;\n  }\n\n  // FSA with no states\n  VectorFst<Arc> zero_fsa_;\n\n  // FSA with one state that accepts epsilon.\n  VectorFst<Arc> one_fsa_;\n\n  // FSA with one state that accepts all strings.\n  VectorFst<Arc> univ_fsa_;\n};\n\n// This class tests a variety of identities and properties that must\n// hold for various FST algorithms. It randomly generates FSTs, using\n// function object 'weight_generator' to select weights. 'WeightTester'\n// and 'UnweightedTester' are then called.\ntemplate <class Arc, class WeightGenerator>\nclass AlgoTester {\n public:\n  typedef typename Arc::Label Label;\n  typedef typename Arc::StateId StateId;\n  typedef typename Arc::Weight Weight;\n\n  AlgoTester(WeightGenerator generator, int seed)\n      : weight_generator_(generator) {\n    one_fst_.AddState();\n    one_fst_.SetStart(0);\n    one_fst_.SetFinal(0, Weight::One());\n\n    univ_fst_.AddState();\n    univ_fst_.SetStart(0);\n    univ_fst_.SetFinal(0, Weight::One());\n    for (int i = 0; i < kNumRandomLabels; ++i)\n      univ_fst_.AddArc(0, Arc(i, i, Weight::One(), 0));\n\n    weighted_tester_ = new WeightedTester<Arc, WeightGenerator>(\n        seed, zero_fst_, one_fst_, univ_fst_, &weight_generator_);\n\n    unweighted_tester_ =\n        new UnweightedTester<Arc>(zero_fst_, one_fst_, univ_fst_);\n  }\n\n  ~AlgoTester() {\n    delete weighted_tester_;\n    delete unweighted_tester_;\n  }\n\n  void MakeRandFst(MutableFst<Arc> *fst) {\n    RandFst<Arc, WeightGenerator>(kNumRandomStates, kNumRandomArcs,\n                                  kNumRandomLabels, kAcyclicProb,\n                                  &weight_generator_, fst);\n  }\n\n  void Test() {\n    VLOG(1) << \"weight type = \" << Weight::Type();\n\n    for (int i = 0; i < FLAGS_repeat; ++i) {\n      // Random transducers\n      VectorFst<Arc> T1;\n      VectorFst<Arc> T2;\n      VectorFst<Arc> T3;\n      MakeRandFst(&T1);\n      MakeRandFst(&T2);\n      MakeRandFst(&T3);\n      weighted_tester_->Test(T1, T2, T3);\n\n      VectorFst<Arc> A1(T1);\n      VectorFst<Arc> A2(T2);\n      VectorFst<Arc> A3(T3);\n      Project(&A1, PROJECT_OUTPUT);\n      Project(&A2, PROJECT_INPUT);\n      Project(&A3, PROJECT_INPUT);\n      ArcMap(&A1, rm_weight_mapper_);\n      ArcMap(&A2, rm_weight_mapper_);\n      ArcMap(&A3, rm_weight_mapper_);\n      unweighted_tester_->Test(A1, A2, A3);\n    }\n  }\n\n private:\n  // Generates weights used in testing.\n  WeightGenerator weight_generator_;\n\n  // FST with no states\n  VectorFst<Arc> zero_fst_;\n\n  // FST with one state that accepts epsilon.\n  VectorFst<Arc> one_fst_;\n\n  // FST with one state that accepts all strings.\n  VectorFst<Arc> univ_fst_;\n\n  // Tests weighted FSTs\n  WeightedTester<Arc, WeightGenerator> *weighted_tester_;\n\n  // Tests unweighted FSTs\n  UnweightedTester<Arc> *unweighted_tester_;\n\n  // Mapper to remove weights from an Fst\n  RmWeightMapper<Arc> rm_weight_mapper_;\n\n  // Maximum number of states in random test Fst.\n  static const int kNumRandomStates;\n\n  // Maximum number of arcs in random test Fst.\n  static const int kNumRandomArcs;\n\n  // Number of alternative random labels.\n  static const int kNumRandomLabels;\n\n  // Probability to force an acyclic Fst\n  static const float kAcyclicProb;\n\n  // Maximum random path length.\n  static const int kRandomPathLength;\n\n  // Number of random paths to explore.\n  static const int kNumRandomPaths;\n\n  AlgoTester(const AlgoTester &) = delete;\n  AlgoTester &operator=(const AlgoTester &) = delete;\n};\n\ntemplate <class A, class G>\nconst int AlgoTester<A, G>::kNumRandomStates = 10;\n\ntemplate <class A, class G>\nconst int AlgoTester<A, G>::kNumRandomArcs = 25;\n\ntemplate <class A, class G>\nconst int AlgoTester<A, G>::kNumRandomLabels = 5;\n\ntemplate <class A, class G>\nconst float AlgoTester<A, G>::kAcyclicProb = .25;\n\ntemplate <class A, class G>\nconst int AlgoTester<A, G>::kRandomPathLength = 25;\n\ntemplate <class A, class G>\nconst int AlgoTester<A, G>::kNumRandomPaths = 100;\n\n}  // namespace fst\n\n#endif  // FST_TEST_ALGO_TEST_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/arc-arena.h",
    "content": "#ifndef FST_ARC_ARENA_H_\n#define FST_ARC_ARENA_H_\n\n#include <deque>\n#include <memory>\n#include <utility>\n#include <fst/fst.h>\n#include <fst/memory.h>\n#include <unordered_map>\n\nnamespace fst {\n\n// ArcArena is used for fast allocation of contiguous arrays of arcs.\n//\n// To create an arc array:\n//   for each state:\n//     for each arc:\n//       arena.PushArc();\n//     // Commits these arcs and returns pointer to them.\n//     Arc *arcs = arena.GetArcs();\n//\n//     OR\n//\n//     arena.DropArcs();  // Throws away current arcs, reuse the space.\n//\n// The arcs returned are guaranteed to be contiguous and the pointer returned\n// will never be invalidated until the arena is cleared for reuse.\n//\n// The contents of the arena can be released with a call to arena.Clear() after\n// which the arena will restart with an initial allocation capable of holding at\n// least all of the arcs requested in the last usage before Clear() making\n// subsequent uses of the Arena more efficient.\n//\n// The max_retained_size option can limit the amount of arc space requested on\n// Clear() to avoid excess growth from intermittent high usage.\ntemplate <typename Arc>\nclass ArcArena {\n public:\n  explicit ArcArena(size_t block_size = 256,\n                    size_t max_retained_size = 1e6)\n      : block_size_(block_size),\n        max_retained_size_(max_retained_size) {\n    blocks_.emplace_back(MakeSharedBlock(block_size_));\n    first_block_size_ = block_size_;\n    total_size_ = block_size_;\n    arcs_ = blocks_.back().get();\n    end_ = arcs_ + block_size_;\n    next_ = arcs_;\n  }\n\n  ArcArena(const ArcArena& copy)\n      : arcs_(copy.arcs_), next_(copy.next_), end_(copy.end_),\n        block_size_(copy.block_size_),\n        first_block_size_(copy.first_block_size_),\n        total_size_(copy.total_size_),\n        max_retained_size_(copy.max_retained_size_),\n        blocks_(copy.blocks_) {\n    NewBlock(block_size_);\n  }\n\n  void ReserveArcs(size_t n) {\n    if (next_ + n < end_) return;\n    NewBlock(n);\n  }\n\n  void PushArc(const Arc& arc) {\n    if (next_ == end_) {\n      size_t length = next_ - arcs_;\n      NewBlock(length * 2);\n    }\n    *next_ = arc;\n    ++next_;\n  }\n\n  const Arc* GetArcs() {\n    const auto *arcs = arcs_;\n    arcs_ = next_;\n    return arcs;\n  }\n\n  void DropArcs() { next_ = arcs_; }\n\n  size_t Size() { return total_size_; }\n\n  void Clear() {\n    blocks_.resize(1);\n    if (total_size_ > first_block_size_) {\n      first_block_size_ = std::min(max_retained_size_, total_size_);\n      blocks_.back() = MakeSharedBlock(first_block_size_);\n    }\n    total_size_ = first_block_size_;\n    arcs_ = blocks_.back().get();\n    end_ = arcs_ + first_block_size_;\n    next_ = arcs_;\n  }\n\n private:\n  // Allocates a new block with capacity of at least n or block_size,\n  // copying incomplete arc sequence from old block to new block.\n  void NewBlock(size_t n) {\n    const auto length = next_ - arcs_;\n    const auto new_block_size = std::max(n, block_size_);\n    total_size_ += new_block_size;\n    blocks_.emplace_back(MakeSharedBlock(new_block_size));\n    std::copy(arcs_, next_, blocks_.back().get());\n    arcs_ = blocks_.back().get();\n    next_ = arcs_ + length;\n    end_ = arcs_ + new_block_size;\n  }\n\n  std::shared_ptr<Arc> MakeSharedBlock(size_t size) {\n    return std::shared_ptr<Arc>(new Arc[size], std::default_delete<Arc[]>());\n  }\n\n  Arc *arcs_;\n  Arc *next_;\n  const Arc *end_;\n  size_t block_size_;\n  size_t first_block_size_;\n  size_t total_size_;\n  size_t max_retained_size_;\n  std::list<std::shared_ptr<Arc>> blocks_;\n};\n\n// ArcArenaStateStore uses a resusable ArcArena to store arc arrays and does not\n// require that the Expander call ReserveArcs first.\n//\n// TODO(tombagby): Make cache type configurable.\n// TODO(tombagby): Provide ThreadLocal/Concurrent configuration.\ntemplate <class A>\nclass ArcArenaStateStore {\n public:\n  using Arc = A;\n  using Weight = typename Arc::Weight;\n  using StateId = typename Arc::StateId;\n\n  ArcArenaStateStore() : arena_(64 * 1024) {\n  }\n\n  class State {\n   public:\n    Weight Final() const { return final_; }\n\n    size_t NumInputEpsilons() const { return niepsilons_; }\n\n    size_t NumOutputEpsilons() const { return noepsilons_; }\n\n    size_t NumArcs() const { return narcs_; }\n\n    const Arc &GetArc(size_t n) const { return arcs_[n]; }\n\n    const Arc *Arcs() const { return arcs_; }\n\n    int* MutableRefCount() const { return nullptr; }\n\n   private:\n    State(Weight weight, int32_t niepsilons, int32_t noepsilons, int32_t narcs,\n          const Arc *arcs)\n        : final_(std::move(weight)),\n          niepsilons_(niepsilons),\n          noepsilons_(noepsilons),\n          narcs_(narcs),\n          arcs_(arcs) {}\n\n    Weight final_;\n    size_t niepsilons_;\n    size_t noepsilons_;\n    size_t narcs_;\n    const Arc *arcs_;\n\n    friend class ArcArenaStateStore<Arc>;\n  };\n\n  template <class Expander>\n  State *FindOrExpand(Expander &expander, StateId state_id) {  // NOLINT\n    auto it = cache_.insert(std::pair<StateId, State*>(state_id, nullptr));\n    if (!it.second) return it.first->second;\n    // Needs a new state.\n    StateBuilder builder(&arena_);\n    expander.Expand(state_id, &builder);\n    const auto arcs = arena_.GetArcs();\n    size_t narcs = builder.narcs_;\n    size_t niepsilons = 0;\n    size_t noepsilons = 0;\n    for (size_t i = 0; i < narcs; ++i) {\n      if (arcs[i].ilabel == 0) ++niepsilons;\n      if (arcs[i].olabel == 0) ++noepsilons;\n    }\n    states_.emplace_back(\n        State(builder.final_, niepsilons, noepsilons, narcs, arcs));\n    // Places it in the cache.\n    auto state = &states_.back();\n    it.first->second = state;\n    return state;\n  }\n\n  State *Find(StateId state_id) const {\n    auto it = cache_.find(state_id);\n    return (it == cache_.end()) ? nullptr : it->second;\n  }\n\n private:\n  class StateBuilder {\n   public:\n    explicit StateBuilder(ArcArena<Arc>* arena)\n       : arena_(arena), final_(Weight::Zero()), narcs_(0) {}\n\n    void SetFinal(Weight weight) { final_ = std::move(weight); }\n\n    void ReserveArcs(size_t n) { arena_->ReserveArcs(n); }\n\n    void AddArc(const Arc &arc) {\n      ++narcs_;\n      arena_->PushArc(arc);\n    }\n\n   private:\n    friend class ArcArenaStateStore<Arc>;\n\n    ArcArena<Arc> *arena_;\n    Weight final_;\n    size_t narcs_;\n  };\n\n  std::unordered_map<StateId, State *> cache_;\n  std::deque<State> states_;\n  ArcArena<Arc> arena_;\n};\n\n}  // namespace fst\n\n#endif  // FST_ARC_ARENA_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/arc-map.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Class to map over/transform arcs e.g., change semirings or\n// implement project/invert. Consider using when operation does\n// not change the number of arcs (except possibly superfinal arcs).\n\n#ifndef FST_ARC_MAP_H_\n#define FST_ARC_MAP_H_\n\n#include <string>\n#include <unordered_map>\n#include <utility>\n\n#include <fst/log.h>\n\n#include <fst/cache.h>\n#include <fst/mutable-fst.h>\n\n\nnamespace fst {\n\n// Determines how final weights are mapped.\nenum MapFinalAction {\n  // A final weight is mapped into a final weight. An error is raised if this\n  // is not possible.\n  MAP_NO_SUPERFINAL,\n  // A final weight is mapped to an arc to the superfinal state when the result\n  // cannot be represented as a final weight. The superfinal state will be\n  // added only if it is needed.\n  MAP_ALLOW_SUPERFINAL,\n  // A final weight is mapped to an arc to the superfinal state unless the\n  // result can be represented as a final weight of weight Zero(). The\n  // superfinal state is always added (if the input is not the empty FST).\n  MAP_REQUIRE_SUPERFINAL\n};\n\n// Determines how symbol tables are mapped.\nenum MapSymbolsAction {\n  // Symbols should be cleared in the result by the map.\n  MAP_CLEAR_SYMBOLS,\n  // Symbols should be copied from the input FST by the map.\n  MAP_COPY_SYMBOLS,\n  // Symbols should not be modified in the result by the map itself.\n  // (They may set by the mapper).\n  MAP_NOOP_SYMBOLS\n};\n\n// The ArcMapper interfaces defines how arcs and final weights are mapped.\n// This is useful for implementing operations that do not change the number of\n// arcs (expect possibly superfinal arcs).\n//\n// template <class A, class B>\n// class ArcMapper {\n//  public:\n//   using FromArc = A;\n//   using ToArc = B;\n//\n//   // Maps an arc type FromArc to arc type ToArc.\n//   ToArc operator()(const FromArc &arc);\n//\n//   // Specifies final action the mapper requires (see above).\n//   // The mapper will be passed final weights as arcs of the form\n//   // Arc(0, 0, weight, kNoStateId).\n//   MapFinalAction FinalAction() const;\n//\n//   // Specifies input symbol table action the mapper requires (see above).\n//   MapSymbolsAction InputSymbolsAction() const;\n//\n//   // Specifies output symbol table action the mapper requires (see above).\n//   MapSymbolsAction OutputSymbolsAction() const;\n//\n//   // This specifies the known properties of an FST mapped by this mapper. It\n//   takes as argument the input FSTs's known properties.\n//   uint64_t Properties(uint64_t props) const;\n// };\n//\n// The ArcMap functions and classes below will use the FinalAction()\n// method of the mapper to determine how to treat final weights, e.g., whether\n// to add a superfinal state. They will use the Properties() method to set the\n// result FST properties.\n//\n// We include a various map versions below. One dimension of variation is\n// whether the mapping mutates its input, writes to a new result FST, or is an\n// on-the-fly FST. Another dimension is how we pass the mapper. We allow passing\n// the mapper by pointer for cases that we need to change the state of the\n// user's mapper.  This is the case with the EncodeMapper, which is reused\n// during decoding. We also include map versions that pass the mapper by value\n// or const reference when this suffices.\n\n// Maps an arc type A using a mapper function object C, passed\n// by pointer.  This version modifies its Fst input.\ntemplate <class A, class C>\nvoid ArcMap(MutableFst<A> *fst, C *mapper) {\n  using FromArc = A;\n  using ToArc = A;\n  using StateId = typename FromArc::StateId;\n  using Weight = typename FromArc::Weight;\n  if (mapper->InputSymbolsAction() == MAP_CLEAR_SYMBOLS) {\n    fst->SetInputSymbols(nullptr);\n  }\n  if (mapper->OutputSymbolsAction() == MAP_CLEAR_SYMBOLS) {\n    fst->SetOutputSymbols(nullptr);\n  }\n  if (fst->Start() == kNoStateId) return;\n  const auto props = fst->Properties(kFstProperties, false);\n  const auto final_action = mapper->FinalAction();\n  auto superfinal = kNoStateId;\n  if (final_action == MAP_REQUIRE_SUPERFINAL) {\n    superfinal = fst->AddState();\n    fst->SetFinal(superfinal, Weight::One());\n  }\n  for (StateIterator<MutableFst<FromArc>> siter(*fst); !siter.Done();\n       siter.Next()) {\n    const auto state = siter.Value();\n    for (MutableArcIterator<MutableFst<FromArc>> aiter(fst, state);\n         !aiter.Done(); aiter.Next()) {\n      const auto &arc = aiter.Value();\n      aiter.SetValue((*mapper)(arc));\n    }\n    switch (final_action) {\n      case MAP_NO_SUPERFINAL:\n      default: {\n        const FromArc arc(0, 0, fst->Final(state), kNoStateId);\n        const auto final_arc = (*mapper)(arc);\n        if (final_arc.ilabel != 0 || final_arc.olabel != 0) {\n          FSTERROR() << \"ArcMap: Non-zero arc labels for superfinal arc\";\n          fst->SetProperties(kError, kError);\n        }\n        fst->SetFinal(state, final_arc.weight);\n        break;\n      }\n      case MAP_ALLOW_SUPERFINAL: {\n        if (state != superfinal) {\n          const FromArc arc(0, 0, fst->Final(state), kNoStateId);\n          auto final_arc = (*mapper)(arc);\n          if (final_arc.ilabel != 0 || final_arc.olabel != 0) {\n            // Add a superfinal state if not already done.\n            if (superfinal == kNoStateId) {\n              superfinal = fst->AddState();\n              fst->SetFinal(superfinal, Weight::One());\n            }\n            final_arc.nextstate = superfinal;\n            fst->AddArc(state, final_arc);\n            fst->SetFinal(state, Weight::Zero());\n          } else {\n            fst->SetFinal(state, final_arc.weight);\n          }\n        }\n        break;\n      }\n      case MAP_REQUIRE_SUPERFINAL: {\n        if (state != superfinal) {\n          const FromArc arc(0, 0, fst->Final(state), kNoStateId);\n          const auto final_arc = (*mapper)(arc);\n          if (final_arc.ilabel != 0 || final_arc.olabel != 0 ||\n              final_arc.weight != Weight::Zero()) {\n            fst->AddArc(state, ToArc(final_arc.ilabel, final_arc.olabel,\n                                     final_arc.weight, superfinal));\n          }\n          fst->SetFinal(state, Weight::Zero());\n        }\n        break;\n      }\n    }\n  }\n  fst->SetProperties(mapper->Properties(props), kFstProperties);\n}\n\n// Maps an arc type A using a mapper function object C, passed by value. This\n// version modifies its FST input.\ntemplate <class A, class C>\nvoid ArcMap(MutableFst<A> *fst, C mapper) {\n  ArcMap(fst, &mapper);\n}\n\n// Maps an arc type A to an arc type B using mapper function object C,\n// passed by pointer. This version writes the mapped input FST to an\n// output MutableFst.\ntemplate <class A, class B, class C>\nvoid ArcMap(const Fst<A> &ifst, MutableFst<B> *ofst, C *mapper) {\n  using FromArc = A;\n  using StateId = typename FromArc::StateId;\n  using Weight = typename FromArc::Weight;\n  ofst->DeleteStates();\n  if (mapper->InputSymbolsAction() == MAP_COPY_SYMBOLS) {\n    ofst->SetInputSymbols(ifst.InputSymbols());\n  } else if (mapper->InputSymbolsAction() == MAP_CLEAR_SYMBOLS) {\n    ofst->SetInputSymbols(nullptr);\n  }\n  if (mapper->OutputSymbolsAction() == MAP_COPY_SYMBOLS) {\n    ofst->SetOutputSymbols(ifst.OutputSymbols());\n  } else if (mapper->OutputSymbolsAction() == MAP_CLEAR_SYMBOLS) {\n    ofst->SetOutputSymbols(nullptr);\n  }\n  const auto iprops = ifst.Properties(kCopyProperties, false);\n  if (ifst.Start() == kNoStateId) {\n    if (iprops & kError) ofst->SetProperties(kError, kError);\n    return;\n  }\n  const auto final_action = mapper->FinalAction();\n  if (ifst.Properties(kExpanded, false)) {\n    ofst->ReserveStates(\n        CountStates(ifst) + final_action == MAP_NO_SUPERFINAL ? 0 : 1);\n  }\n  // Adds all states.\n  for (StateIterator<Fst<A>> siter(ifst); !siter.Done(); siter.Next()) {\n    ofst->AddState();\n  }\n  StateId superfinal = kNoStateId;\n  if (final_action == MAP_REQUIRE_SUPERFINAL) {\n    superfinal = ofst->AddState();\n    ofst->SetFinal(superfinal, B::Weight::One());\n  }\n  for (StateIterator<Fst<A>> siter(ifst); !siter.Done(); siter.Next()) {\n    StateId s = siter.Value();\n    if (s == ifst.Start()) ofst->SetStart(s);\n    ofst->ReserveArcs(s, ifst.NumArcs(s));\n    for (ArcIterator<Fst<A>> aiter(ifst, s); !aiter.Done(); aiter.Next()) {\n      ofst->AddArc(s, (*mapper)(aiter.Value()));\n    }\n    switch (final_action) {\n      case MAP_NO_SUPERFINAL:\n      default: {\n        B final_arc = (*mapper)(A(0, 0, ifst.Final(s), kNoStateId));\n        if (final_arc.ilabel != 0 || final_arc.olabel != 0) {\n          FSTERROR() << \"ArcMap: Non-zero arc labels for superfinal arc\";\n          ofst->SetProperties(kError, kError);\n        }\n        ofst->SetFinal(s, final_arc.weight);\n        break;\n      }\n      case MAP_ALLOW_SUPERFINAL: {\n        B final_arc = (*mapper)(A(0, 0, ifst.Final(s), kNoStateId));\n        if (final_arc.ilabel != 0 || final_arc.olabel != 0) {\n          // Add a superfinal state if not already done.\n          if (superfinal == kNoStateId) {\n            superfinal = ofst->AddState();\n            ofst->SetFinal(superfinal, B::Weight::One());\n          }\n          final_arc.nextstate = superfinal;\n          ofst->AddArc(s, final_arc);\n          ofst->SetFinal(s, B::Weight::Zero());\n        } else {\n          ofst->SetFinal(s, final_arc.weight);\n        }\n        break;\n      }\n      case MAP_REQUIRE_SUPERFINAL: {\n        B final_arc = (*mapper)(A(0, 0, ifst.Final(s), kNoStateId));\n        if (final_arc.ilabel != 0 || final_arc.olabel != 0 ||\n            final_arc.weight != B::Weight::Zero()) {\n          ofst->AddArc(s, B(final_arc.ilabel, final_arc.olabel,\n                            final_arc.weight, superfinal));\n        }\n        ofst->SetFinal(s, B::Weight::Zero());\n        break;\n      }\n    }\n  }\n  const auto oprops = ofst->Properties(kFstProperties, false);\n  ofst->SetProperties(mapper->Properties(iprops) | oprops, kFstProperties);\n}\n\n// Maps an arc type A to an arc type B using mapper function\n// object C, passed by value. This version writes the mapped input\n// Fst to an output MutableFst.\ntemplate <class A, class B, class C>\nvoid ArcMap(const Fst<A> &ifst, MutableFst<B> *ofst, C mapper) {\n  ArcMap(ifst, ofst, &mapper);\n}\n\nstruct ArcMapFstOptions : public CacheOptions {\n  // ArcMapFst default caching behaviour is to do no caching. Most mappers are\n  // cheap and therefore we save memory by not doing caching.\n  ArcMapFstOptions() : CacheOptions(true, 0) {}\n\n  explicit ArcMapFstOptions(const CacheOptions &opts) : CacheOptions(opts) {}\n};\n\ntemplate <class A, class B, class C>\nclass ArcMapFst;\n\nnamespace internal {\n\n// Implementation of delayed ArcMapFst.\ntemplate <class A, class B, class C>\nclass ArcMapFstImpl : public CacheImpl<B> {\n public:\n  using Arc = B;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using FstImpl<B>::SetType;\n  using FstImpl<B>::SetProperties;\n  using FstImpl<B>::SetInputSymbols;\n  using FstImpl<B>::SetOutputSymbols;\n\n  using CacheImpl<B>::PushArc;\n  using CacheImpl<B>::HasArcs;\n  using CacheImpl<B>::HasFinal;\n  using CacheImpl<B>::HasStart;\n  using CacheImpl<B>::SetArcs;\n  using CacheImpl<B>::SetFinal;\n  using CacheImpl<B>::SetStart;\n\n  friend class StateIterator<ArcMapFst<A, B, C>>;\n\n  ArcMapFstImpl(const Fst<A> &fst, const C &mapper,\n                const ArcMapFstOptions &opts)\n      : CacheImpl<B>(opts),\n        fst_(fst.Copy()),\n        mapper_(new C(mapper)),\n        own_mapper_(true),\n        superfinal_(kNoStateId),\n        nstates_(0) {\n    Init();\n  }\n\n  ArcMapFstImpl(const Fst<A> &fst, C *mapper, const ArcMapFstOptions &opts)\n      : CacheImpl<B>(opts),\n        fst_(fst.Copy()),\n        mapper_(mapper),\n        own_mapper_(false),\n        superfinal_(kNoStateId),\n        nstates_(0) {\n    Init();\n  }\n\n  ArcMapFstImpl(const ArcMapFstImpl<A, B, C> &impl)\n      : CacheImpl<B>(impl),\n        fst_(impl.fst_->Copy(true)),\n        mapper_(new C(*impl.mapper_)),\n        own_mapper_(true),\n        superfinal_(kNoStateId),\n        nstates_(0) {\n    Init();\n  }\n\n  ~ArcMapFstImpl() override {\n    if (own_mapper_) delete mapper_;\n  }\n\n  StateId Start() {\n    if (!HasStart()) SetStart(FindOState(fst_->Start()));\n    return CacheImpl<B>::Start();\n  }\n\n  Weight Final(StateId s) {\n    if (!HasFinal(s)) {\n      switch (final_action_) {\n        case MAP_NO_SUPERFINAL:\n        default: {\n          const auto final_arc =\n              (*mapper_)(A(0, 0, fst_->Final(FindIState(s)), kNoStateId));\n          if (final_arc.ilabel != 0 || final_arc.olabel != 0) {\n            FSTERROR() << \"ArcMapFst: Non-zero arc labels for superfinal arc\";\n            SetProperties(kError, kError);\n          }\n          SetFinal(s, final_arc.weight);\n          break;\n        }\n        case MAP_ALLOW_SUPERFINAL: {\n          if (s == superfinal_) {\n            SetFinal(s, Weight::One());\n          } else {\n            const auto final_arc =\n                (*mapper_)(A(0, 0, fst_->Final(FindIState(s)), kNoStateId));\n            if (final_arc.ilabel == 0 && final_arc.olabel == 0) {\n              SetFinal(s, final_arc.weight);\n            } else {\n              SetFinal(s, Weight::Zero());\n            }\n          }\n          break;\n        }\n        case MAP_REQUIRE_SUPERFINAL: {\n          SetFinal(s, s == superfinal_ ? Weight::One() : Weight::Zero());\n          break;\n        }\n      }\n    }\n    return CacheImpl<B>::Final(s);\n  }\n\n  size_t NumArcs(StateId s) {\n    if (!HasArcs(s)) Expand(s);\n    return CacheImpl<B>::NumArcs(s);\n  }\n\n  size_t NumInputEpsilons(StateId s) {\n    if (!HasArcs(s)) Expand(s);\n    return CacheImpl<B>::NumInputEpsilons(s);\n  }\n\n  size_t NumOutputEpsilons(StateId s) {\n    if (!HasArcs(s)) Expand(s);\n    return CacheImpl<B>::NumOutputEpsilons(s);\n  }\n\n  uint64_t Properties() const override { return Properties(kFstProperties); }\n\n  // Sets error if found, and returns other FST impl properties.\n  uint64_t Properties(uint64_t mask) const override {\n    if ((mask & kError) && (fst_->Properties(kError, false) ||\n                            (mapper_->Properties(0) & kError))) {\n      SetProperties(kError, kError);\n    }\n    return FstImpl<Arc>::Properties(mask);\n  }\n\n  void InitArcIterator(StateId s, ArcIteratorData<B> *data) {\n    if (!HasArcs(s)) Expand(s);\n    CacheImpl<B>::InitArcIterator(s, data);\n  }\n\n  void Expand(StateId s) {\n    // Add exiting arcs.\n    if (s == superfinal_) {\n      SetArcs(s);\n      return;\n    }\n    for (ArcIterator<Fst<A>> aiter(*fst_, FindIState(s)); !aiter.Done();\n         aiter.Next()) {\n      auto aarc = aiter.Value();\n      aarc.nextstate = FindOState(aarc.nextstate);\n      const auto &barc = (*mapper_)(aarc);\n      PushArc(s, barc);\n    }\n\n    // Check for superfinal arcs.\n    if (!HasFinal(s) || Final(s) == Weight::Zero()) {\n      switch (final_action_) {\n        case MAP_NO_SUPERFINAL:\n        default:\n          break;\n        case MAP_ALLOW_SUPERFINAL: {\n          auto final_arc =\n              (*mapper_)(A(0, 0, fst_->Final(FindIState(s)), kNoStateId));\n          if (final_arc.ilabel != 0 || final_arc.olabel != 0) {\n            if (superfinal_ == kNoStateId) superfinal_ = nstates_++;\n            final_arc.nextstate = superfinal_;\n            PushArc(s, final_arc);\n          }\n          break;\n        }\n        case MAP_REQUIRE_SUPERFINAL: {\n          const auto final_arc =\n              (*mapper_)(A(0, 0, fst_->Final(FindIState(s)), kNoStateId));\n          if (final_arc.ilabel != 0 || final_arc.olabel != 0 ||\n              final_arc.weight != B::Weight::Zero()) {\n            PushArc(s, B(final_arc.ilabel, final_arc.olabel, final_arc.weight,\n                         superfinal_));\n          }\n          break;\n        }\n      }\n    }\n    SetArcs(s);\n  }\n\n private:\n  void Init() {\n    SetType(\"map\");\n    if (mapper_->InputSymbolsAction() == MAP_COPY_SYMBOLS) {\n      SetInputSymbols(fst_->InputSymbols());\n    } else if (mapper_->InputSymbolsAction() == MAP_CLEAR_SYMBOLS) {\n      SetInputSymbols(nullptr);\n    }\n    if (mapper_->OutputSymbolsAction() == MAP_COPY_SYMBOLS) {\n      SetOutputSymbols(fst_->OutputSymbols());\n    } else if (mapper_->OutputSymbolsAction() == MAP_CLEAR_SYMBOLS) {\n      SetOutputSymbols(nullptr);\n    }\n    if (fst_->Start() == kNoStateId) {\n      final_action_ = MAP_NO_SUPERFINAL;\n      SetProperties(kNullProperties);\n    } else {\n      final_action_ = mapper_->FinalAction();\n      uint64_t props = fst_->Properties(kCopyProperties, false);\n      SetProperties(mapper_->Properties(props));\n      if (final_action_ == MAP_REQUIRE_SUPERFINAL) superfinal_ = 0;\n    }\n  }\n\n  // Maps from output state to input state.\n  StateId FindIState(StateId s) {\n    if (superfinal_ == kNoStateId || s < superfinal_) {\n      return s;\n    } else {\n      return s - 1;\n    }\n  }\n\n  // Maps from input state to output state.\n  StateId FindOState(StateId is) {\n    auto os = is;\n    if (!(superfinal_ == kNoStateId || is < superfinal_)) ++os;\n    if (os >= nstates_) nstates_ = os + 1;\n    return os;\n  }\n\n  std::unique_ptr<const Fst<A>> fst_;\n  C *mapper_;\n  const bool own_mapper_;\n  MapFinalAction final_action_;\n  StateId superfinal_;\n  StateId nstates_;\n};\n\n}  // namespace internal\n\n// Maps an arc type A to an arc type B using Mapper function object\n// C. This version is a delayed FST.\ntemplate <class A, class B, class C>\nclass ArcMapFst : public ImplToFst<internal::ArcMapFstImpl<A, B, C>> {\n public:\n  using Arc = B;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using Store = DefaultCacheStore<B>;\n  using State = typename Store::State;\n  using Impl = internal::ArcMapFstImpl<A, B, C>;\n\n  friend class ArcIterator<ArcMapFst<A, B, C>>;\n  friend class StateIterator<ArcMapFst<A, B, C>>;\n\n  ArcMapFst(const Fst<A> &fst, const C &mapper, const ArcMapFstOptions &opts)\n      : ImplToFst<Impl>(std::make_shared<Impl>(fst, mapper, opts)) {}\n\n  ArcMapFst(const Fst<A> &fst, C *mapper, const ArcMapFstOptions &opts)\n      : ImplToFst<Impl>(std::make_shared<Impl>(fst, mapper, opts)) {}\n\n  ArcMapFst(const Fst<A> &fst, const C &mapper)\n      : ImplToFst<Impl>(\n            std::make_shared<Impl>(fst, mapper, ArcMapFstOptions())) {}\n\n  ArcMapFst(const Fst<A> &fst, C *mapper)\n      : ImplToFst<Impl>(\n            std::make_shared<Impl>(fst, mapper, ArcMapFstOptions())) {}\n\n  // See Fst<>::Copy() for doc.\n  ArcMapFst(const ArcMapFst<A, B, C> &fst, bool safe = false)\n      : ImplToFst<Impl>(fst, safe) {}\n\n  // Get a copy of this ArcMapFst. See Fst<>::Copy() for further doc.\n  ArcMapFst<A, B, C> *Copy(bool safe = false) const override {\n    return new ArcMapFst<A, B, C>(*this, safe);\n  }\n\n  inline void InitStateIterator(StateIteratorData<B> *data) const override;\n\n  void InitArcIterator(StateId s, ArcIteratorData<B> *data) const override {\n    GetMutableImpl()->InitArcIterator(s, data);\n  }\n\n protected:\n  using ImplToFst<Impl>::GetImpl;\n  using ImplToFst<Impl>::GetMutableImpl;\n\n private:\n  ArcMapFst &operator=(const ArcMapFst &) = delete;\n};\n\n// Specialization for ArcMapFst.\n//\n// This may be derived from.\ntemplate <class A, class B, class C>\nclass StateIterator<ArcMapFst<A, B, C>> : public StateIteratorBase<B> {\n public:\n  using StateId = typename B::StateId;\n\n  explicit StateIterator(const ArcMapFst<A, B, C> &fst)\n      : impl_(fst.GetImpl()),\n        siter_(*impl_->fst_),\n        s_(0),\n        superfinal_(impl_->final_action_ == MAP_REQUIRE_SUPERFINAL) {\n    CheckSuperfinal();\n  }\n\n  bool Done() const final { return siter_.Done() && !superfinal_; }\n\n  StateId Value() const final { return s_; }\n\n  void Next() final {\n    ++s_;\n    if (!siter_.Done()) {\n      siter_.Next();\n      CheckSuperfinal();\n    } else if (superfinal_) {\n      superfinal_ = false;\n    }\n  }\n\n  void Reset() final {\n    s_ = 0;\n    siter_.Reset();\n    superfinal_ = impl_->final_action_ == MAP_REQUIRE_SUPERFINAL;\n    CheckSuperfinal();\n  }\n\n private:\n  void CheckSuperfinal() {\n    if (impl_->final_action_ != MAP_ALLOW_SUPERFINAL || superfinal_) return;\n    if (!siter_.Done()) {\n      const auto final_arc =\n          (*impl_->mapper_)(A(0, 0, impl_->fst_->Final(s_), kNoStateId));\n      if (final_arc.ilabel != 0 || final_arc.olabel != 0) superfinal_ = true;\n    }\n  }\n\n  const internal::ArcMapFstImpl<A, B, C> *impl_;\n  StateIterator<Fst<A>> siter_;\n  StateId s_;\n  bool superfinal_;  // True if there is a superfinal state and not done.\n};\n\n// Specialization for ArcMapFst.\ntemplate <class A, class B, class C>\nclass ArcIterator<ArcMapFst<A, B, C>>\n    : public CacheArcIterator<ArcMapFst<A, B, C>> {\n public:\n  using StateId = typename A::StateId;\n\n  ArcIterator(const ArcMapFst<A, B, C> &fst, StateId s)\n      : CacheArcIterator<ArcMapFst<A, B, C>>(fst.GetMutableImpl(), s) {\n    if (!fst.GetImpl()->HasArcs(s)) fst.GetMutableImpl()->Expand(s);\n  }\n};\n\ntemplate <class A, class B, class C>\ninline void ArcMapFst<A, B, C>::InitStateIterator(\n    StateIteratorData<B> *data) const {\n  data->base = new StateIterator<ArcMapFst<A, B, C>>(*this);\n}\n\n// Utility Mappers.\n\n// Mapper that returns its input.\ntemplate <class A>\nclass IdentityArcMapper {\n public:\n  using FromArc = A;\n  using ToArc = A;\n\n  ToArc operator()(const FromArc &arc) const { return arc; }\n\n  constexpr MapFinalAction FinalAction() const { return MAP_NO_SUPERFINAL; }\n\n  constexpr MapSymbolsAction InputSymbolsAction() const {\n    return MAP_COPY_SYMBOLS;\n  }\n\n  constexpr MapSymbolsAction OutputSymbolsAction() const {\n    return MAP_COPY_SYMBOLS;\n  }\n\n  uint64_t Properties(uint64_t props) const { return props; }\n};\n\n// Mapper that converts all input symbols to epsilon.\ntemplate <class A>\nclass InputEpsilonMapper {\n public:\n  using FromArc = A;\n  using ToArc = A;\n\n  ToArc operator()(const FromArc &arc) const {\n    return ToArc(0, arc.olabel, arc.weight, arc.nextstate);\n  }\n\n  constexpr MapFinalAction FinalAction() const { return MAP_NO_SUPERFINAL; }\n\n  constexpr MapSymbolsAction InputSymbolsAction() const {\n    return MAP_CLEAR_SYMBOLS;\n  }\n\n  constexpr MapSymbolsAction OutputSymbolsAction() const {\n    return MAP_COPY_SYMBOLS;\n  }\n\n  uint64_t Properties(uint64_t props) const {\n    return (props & kSetArcProperties) | kIEpsilons;\n  }\n};\n\n// Mapper that converts all output symbols to epsilon.\ntemplate <class A>\nclass OutputEpsilonMapper {\n public:\n  using FromArc = A;\n  using ToArc = A;\n\n  ToArc operator()(const FromArc &arc) const {\n    return ToArc(arc.ilabel, 0, arc.weight, arc.nextstate);\n  }\n\n  constexpr MapFinalAction FinalAction() const { return MAP_NO_SUPERFINAL; }\n\n  constexpr MapSymbolsAction InputSymbolsAction() const {\n    return MAP_COPY_SYMBOLS;\n  }\n\n  constexpr MapSymbolsAction OutputSymbolsAction() const {\n    return MAP_CLEAR_SYMBOLS;\n  }\n\n  uint64_t Properties(uint64_t props) const {\n    return (props & kSetArcProperties) | kOEpsilons;\n  }\n};\n\n// Mapper that returns its input with final states redirected to a single\n// super-final state.\ntemplate <class A>\nclass SuperFinalMapper {\n public:\n  using FromArc = A;\n  using ToArc = A;\n  using Label = typename FromArc::Label;\n  using Weight = typename FromArc::Weight;;\n\n  // Arg allows setting super-final label.\n  explicit SuperFinalMapper(Label final_label = 0)\n      : final_label_(final_label) {}\n\n  ToArc operator()(const FromArc &arc) const {\n    // Super-final arc.\n    if (arc.nextstate == kNoStateId && arc.weight != Weight::Zero()) {\n      return ToArc(final_label_, final_label_, arc.weight, kNoStateId);\n    } else {\n      return arc;\n    }\n  }\n\n  constexpr MapFinalAction FinalAction() const {\n    return MAP_REQUIRE_SUPERFINAL;\n  }\n\n  constexpr MapSymbolsAction InputSymbolsAction() const {\n    return MAP_COPY_SYMBOLS;\n  }\n\n  constexpr MapSymbolsAction OutputSymbolsAction() const {\n    return MAP_COPY_SYMBOLS;\n  }\n\n  uint64_t Properties(uint64_t props) const {\n    if (final_label_ == 0) {\n      return props & kAddSuperFinalProperties;\n    } else {\n      return props & kAddSuperFinalProperties &\n          kILabelInvariantProperties & kOLabelInvariantProperties;\n    }\n  }\n\n private:\n  Label final_label_;\n};\n\n// Mapper that leaves labels and nextstate unchanged and constructs a new weight\n// from the underlying value of the arc weight. If no weight converter is\n// explictly specified, requires that there is a WeightConvert class\n// specialization that converts the weights.\ntemplate <class A, class B,\n          class C = WeightConvert<typename A::Weight, typename B::Weight>>\nclass WeightConvertMapper {\n public:\n  using FromArc = A;\n  using ToArc = B;\n  using Converter = C;\n  using FromWeight = typename FromArc::Weight;\n  using ToWeight = typename ToArc::Weight;\n\n  explicit WeightConvertMapper(const Converter &c = Converter())\n      : convert_weight_(c) {}\n\n  ToArc operator()(const FromArc &arc) const {\n    return ToArc(arc.ilabel, arc.olabel, convert_weight_(arc.weight),\n                 arc.nextstate);\n  }\n\n  constexpr MapFinalAction FinalAction() const { return MAP_NO_SUPERFINAL; }\n\n  constexpr MapSymbolsAction InputSymbolsAction() const {\n    return MAP_COPY_SYMBOLS;\n  }\n\n  constexpr MapSymbolsAction OutputSymbolsAction() const {\n    return MAP_COPY_SYMBOLS;\n  }\n\n  uint64_t Properties(uint64_t props) const { return props; }\n\n private:\n  Converter convert_weight_;\n};\n\n// Non-precision-changing weight conversions; consider using more efficient\n// Cast method instead.\n\nusing StdToLogMapper = WeightConvertMapper<StdArc, LogArc>;\n\nusing LogToStdMapper = WeightConvertMapper<LogArc, StdArc>;\n\n// Precision-changing weight conversions.\n\nusing StdToLog64Mapper = WeightConvertMapper<StdArc, Log64Arc>;\n\nusing LogToLog64Mapper = WeightConvertMapper<LogArc, Log64Arc>;\n\nusing Log64ToStdMapper = WeightConvertMapper<Log64Arc, StdArc>;\n\nusing Log64ToLogMapper = WeightConvertMapper<Log64Arc, LogArc>;\n\n// Mapper from A to GallicArc<A>.\ntemplate <class A, GallicType G = GALLIC_LEFT>\nclass ToGallicMapper {\n public:\n  using FromArc = A;\n  using ToArc = GallicArc<A, G>;\n\n  using SW = StringWeight<typename A::Label, GallicStringType(G)>;\n  using AW = typename FromArc::Weight;\n  using GW = typename ToArc::Weight;\n\n  ToArc operator()(const FromArc &arc) const {\n    // Super-final arc.\n    if (arc.nextstate == kNoStateId && arc.weight != AW::Zero()) {\n      return ToArc(0, 0, GW(SW::One(), arc.weight), kNoStateId);\n    // Super-non-final arc.\n    } else if (arc.nextstate == kNoStateId) {\n      return ToArc(0, 0, GW::Zero(), kNoStateId);\n    // Epsilon label.\n    } else if (arc.olabel == 0) {\n      return ToArc(arc.ilabel, arc.ilabel, GW(SW::One(), arc.weight),\n                   arc.nextstate);\n    // Regular label.\n    } else {\n      return ToArc(arc.ilabel, arc.ilabel, GW(SW(arc.olabel), arc.weight),\n                   arc.nextstate);\n    }\n  }\n\n  constexpr MapFinalAction FinalAction() const { return MAP_NO_SUPERFINAL; }\n\n  constexpr MapSymbolsAction InputSymbolsAction() const {\n    return MAP_COPY_SYMBOLS;\n  }\n\n  constexpr MapSymbolsAction OutputSymbolsAction() const {\n    return MAP_CLEAR_SYMBOLS;\n  }\n\n  uint64_t Properties(uint64_t props) const {\n    return ProjectProperties(props, true) & kWeightInvariantProperties;\n  }\n};\n\n// Mapper from GallicArc<A> to A.\ntemplate <class A, GallicType G = GALLIC_LEFT>\nclass FromGallicMapper {\n public:\n  using FromArc = GallicArc<A, G>;\n  using ToArc = A;\n\n  using Label = typename ToArc::Label;\n  using AW = typename ToArc::Weight;\n  using GW = typename FromArc::Weight;\n\n  explicit FromGallicMapper(Label superfinal_label = 0)\n      : superfinal_label_(superfinal_label), error_(false) {}\n\n  ToArc operator()(const FromArc &arc) const {\n    // 'Super-non-final' arc.\n    if (arc.nextstate == kNoStateId && arc.weight == GW::Zero()) {\n      return A(arc.ilabel, 0, AW::Zero(), kNoStateId);\n    }\n    Label l = kNoLabel;\n    AW weight;\n    if (!Extract(arc.weight, &weight, &l) || arc.ilabel != arc.olabel) {\n      FSTERROR() << \"FromGallicMapper: Unrepresentable weight: \" << arc.weight\n                 << \" for arc with ilabel = \" << arc.ilabel\n                 << \", olabel = \" << arc.olabel\n                 << \", nextstate = \" << arc.nextstate;\n      error_ = true;\n    }\n    if (arc.ilabel == 0 && l != 0 && arc.nextstate == kNoStateId) {\n      return ToArc(superfinal_label_, l, weight, arc.nextstate);\n    } else {\n      return ToArc(arc.ilabel, l, weight, arc.nextstate);\n    }\n  }\n\n  constexpr MapFinalAction FinalAction() const { return MAP_ALLOW_SUPERFINAL; }\n\n  constexpr MapSymbolsAction InputSymbolsAction() const {\n    return MAP_COPY_SYMBOLS;\n  }\n\n  constexpr MapSymbolsAction OutputSymbolsAction() const {\n    return MAP_CLEAR_SYMBOLS;\n  }\n\n  uint64_t Properties(uint64_t inprops) const {\n    uint64_t outprops = inprops & kOLabelInvariantProperties &\n                      kWeightInvariantProperties & kAddSuperFinalProperties;\n    if (error_) outprops |= kError;\n    return outprops;\n  }\n\n private:\n  template <GallicType GT>\n  static bool Extract(const GallicWeight<Label, AW, GT> &gallic_weight,\n                      typename A::Weight *weight, typename A::Label *label) {\n    using GWT = StringWeight<Label, GallicStringType(GT)>;\n    const GWT &w1 = gallic_weight.Value1();\n    const AW &w2 = gallic_weight.Value2();\n    typename GWT::Iterator iter1(w1);\n    const Label l = w1.Size() == 1 ? iter1.Value() : 0;\n    if (l == kStringInfinity || l == kStringBad || w1.Size() > 1) return false;\n    *label = l;\n    *weight = w2;\n    return true;\n  }\n\n  static bool Extract(const GallicWeight<Label, AW, GALLIC> &gallic_weight,\n                      typename A::Weight *weight, typename A::Label *label) {\n    if (gallic_weight.Size() > 1) return false;\n    if (gallic_weight.Size() == 0) {\n      *label = 0;\n      *weight = A::Weight::Zero();\n      return true;\n    }\n    return Extract<GALLIC_RESTRICT>(gallic_weight.Back(), weight, label);\n  }\n\n  const Label superfinal_label_;\n  mutable bool error_;\n};\n\n// Mapper from GallicArc<A> to A.\ntemplate <class A, GallicType G = GALLIC_LEFT>\nclass GallicToNewSymbolsMapper {\n public:\n  using FromArc = GallicArc<A, G>;\n  using ToArc = A;\n\n  using Label = typename ToArc::Label;\n  using StateId = typename ToArc::StateId;\n  using AW = typename ToArc::Weight;\n  using GW = typename FromArc::Weight;\n  using SW = StringWeight<Label, GallicStringType(G)>;\n\n  explicit GallicToNewSymbolsMapper(MutableFst<ToArc> *fst)\n      : fst_(fst),\n        lmax_(0),\n        osymbols_(fst->OutputSymbols()),\n        isymbols_(nullptr),\n        error_(false) {\n    fst_->DeleteStates();\n    state_ = fst_->AddState();\n    fst_->SetStart(state_);\n    fst_->SetFinal(state_, AW::One());\n    if (osymbols_) {\n      string name = osymbols_->Name() + \"_from_gallic\";\n      fst_->SetInputSymbols(new SymbolTable(name));\n      isymbols_ = fst_->MutableInputSymbols();\n      const int64_t zero = 0;\n      isymbols_->AddSymbol(osymbols_->Find(zero), 0);\n    } else {\n      fst_->SetInputSymbols(nullptr);\n    }\n  }\n\n  ToArc operator()(const FromArc &arc) {\n    // Super-non-final arc.\n    if (arc.nextstate == kNoStateId && arc.weight == GW::Zero()) {\n      return ToArc(arc.ilabel, 0, AW::Zero(), kNoStateId);\n    }\n    SW w1 = arc.weight.Value1();\n    AW w2 = arc.weight.Value2();\n    Label l;\n    if (w1.Size() == 0) {\n      l = 0;\n    } else {\n      auto insert_result = map_.insert(std::make_pair(w1, kNoLabel));\n      if (!insert_result.second) {\n        l = insert_result.first->second;\n      } else {\n        l = ++lmax_;\n        insert_result.first->second = l;\n        StringWeightIterator<SW> iter1(w1);\n        StateId n;\n        string s;\n        for (size_t i = 0, p = state_; i < w1.Size();\n             ++i, iter1.Next(), p = n) {\n          n = i == w1.Size() - 1 ? state_ : fst_->AddState();\n          fst_->AddArc(p, ToArc(i ? 0 : l, iter1.Value(), AW::One(), n));\n          if (isymbols_) {\n            if (i) s = s + \"_\";\n            s = s + osymbols_->Find(iter1.Value());\n          }\n        }\n        if (isymbols_) isymbols_->AddSymbol(s, l);\n      }\n    }\n    if (l == kStringInfinity || l == kStringBad || arc.ilabel != arc.olabel) {\n      FSTERROR() << \"GallicToNewSymbolMapper: Unrepresentable weight: \" << l;\n      error_ = true;\n    }\n    return ToArc(arc.ilabel, l, w2, arc.nextstate);\n  }\n\n  constexpr MapFinalAction FinalAction() const { return MAP_ALLOW_SUPERFINAL; }\n\n  constexpr MapSymbolsAction InputSymbolsAction() const {\n    return MAP_COPY_SYMBOLS;\n  }\n\n  constexpr MapSymbolsAction OutputSymbolsAction() const {\n    return MAP_CLEAR_SYMBOLS;\n  }\n\n  uint64_t Properties(uint64_t inprops) const {\n    uint64_t outprops = inprops & kOLabelInvariantProperties &\n                      kWeightInvariantProperties & kAddSuperFinalProperties;\n    if (error_) outprops |= kError;\n    return outprops;\n  }\n\n private:\n  class StringKey {\n   public:\n    size_t operator()(const SW &x) const { return x.Hash(); }\n  };\n\n  using Map = std::unordered_map<SW, Label, StringKey>;\n\n  MutableFst<ToArc> *fst_;\n  Map map_;\n  Label lmax_;\n  StateId state_;\n  const SymbolTable *osymbols_;\n  SymbolTable *isymbols_;\n  mutable bool error_;\n};\n\n// TODO(kbg): Add common base class for those mappers which do nothing except\n// mutate their weights.\n\n// Mapper to add a constant to all weights.\ntemplate <class A>\nclass PlusMapper {\n public:\n  using FromArc = A;\n  using ToArc = A;\n  using Weight = typename FromArc::Weight;\n\n  explicit PlusMapper(Weight weight) : weight_(std::move(weight)) {}\n\n  ToArc operator()(const FromArc &arc) const {\n    if (arc.weight == Weight::Zero()) return arc;\n    return ToArc(arc.ilabel, arc.olabel, Plus(arc.weight, weight_),\n                 arc.nextstate);\n  }\n\n  constexpr MapFinalAction FinalAction() const { return MAP_NO_SUPERFINAL; }\n\n  constexpr MapSymbolsAction InputSymbolsAction() const {\n    return MAP_COPY_SYMBOLS;\n  }\n\n  constexpr MapSymbolsAction OutputSymbolsAction() const {\n    return MAP_COPY_SYMBOLS;\n  }\n\n  uint64_t Properties(uint64_t props) const {\n    return props & kWeightInvariantProperties;\n  }\n\n private:\n  const Weight weight_;\n};\n\n// Mapper to (right) multiply a constant to all weights.\ntemplate <class A>\nclass TimesMapper {\n public:\n  using FromArc = A;\n  using ToArc = A;\n  using Weight = typename FromArc::Weight;\n\n  explicit TimesMapper(Weight weight) : weight_(std::move(weight)) {}\n\n  ToArc operator()(const FromArc &arc) const {\n    if (arc.weight == Weight::Zero()) return arc;\n    return ToArc(arc.ilabel, arc.olabel, Times(arc.weight, weight_),\n                 arc.nextstate);\n  }\n\n  constexpr MapFinalAction FinalAction() const { return MAP_NO_SUPERFINAL; }\n\n  constexpr MapSymbolsAction InputSymbolsAction() const {\n    return MAP_COPY_SYMBOLS;\n  }\n\n  constexpr MapSymbolsAction OutputSymbolsAction() const {\n    return MAP_COPY_SYMBOLS;\n  }\n\n  uint64_t Properties(uint64_t props) const {\n    return props & kWeightInvariantProperties;\n  }\n\n private:\n  const Weight weight_;\n};\n\n// Mapper to take all weights to a constant power. The power argument is stored\n// as a double, so if there is a floating-point power implementation for this\n// weight type, it will take precedence. Otherwise, the power argument's 53 bits\n// of integer precision will be implicitly converted to a size_t and the default\n// power implementation (iterated multiplication) will be used instead.\ntemplate <class A>\nclass PowerMapper {\n public:\n  using FromArc = A;\n  using ToArc = A;\n  using Weight = typename FromArc::Weight;\n\n  explicit PowerMapper(double power) : power_(power) {}\n\n  ToArc operator()(const FromArc &arc) const {\n    return ToArc(arc.ilabel, arc.olabel, Power(arc.weight, power_),\n                 arc.nextstate);\n  }\n\n  constexpr MapFinalAction FinalAction() const { return MAP_NO_SUPERFINAL; }\n\n  constexpr MapSymbolsAction InputSymbolsAction() const {\n    return MAP_COPY_SYMBOLS;\n  }\n\n  constexpr MapSymbolsAction OutputSymbolsAction() const {\n    return MAP_COPY_SYMBOLS;\n  }\n\n  uint64_t Properties(uint64_t props) const {\n    return props & kWeightInvariantProperties;\n  }\n\n private:\n  const double power_;\n};\n\n// Mapper to reciprocate all non-Zero() weights.\ntemplate <class A>\nclass InvertWeightMapper {\n public:\n  using FromArc = A;\n  using ToArc = A;\n  using Weight = typename FromArc::Weight;\n\n  ToArc operator()(const FromArc &arc) const {\n    if (arc.weight == Weight::Zero()) return arc;\n    return ToArc(arc.ilabel, arc.olabel, Divide(Weight::One(), arc.weight),\n                 arc.nextstate);\n  }\n\n  constexpr MapFinalAction FinalAction() const { return MAP_NO_SUPERFINAL; }\n\n  constexpr MapSymbolsAction InputSymbolsAction() const {\n    return MAP_COPY_SYMBOLS;\n  }\n\n  constexpr MapSymbolsAction OutputSymbolsAction() const {\n    return MAP_COPY_SYMBOLS;\n  }\n\n  uint64_t Properties(uint64_t props) const {\n    return props & kWeightInvariantProperties;\n  }\n};\n\n// Mapper to map all non-Zero() weights to One().\ntemplate <class A, class B = A>\nclass RmWeightMapper {\n public:\n  using FromArc = A;\n  using ToArc = B;\n  using FromWeight = typename FromArc::Weight;\n  using ToWeight = typename ToArc::Weight;\n\n  ToArc operator()(const FromArc &arc) const {\n    return ToArc(arc.ilabel, arc.olabel,\n                 arc.weight != FromWeight::Zero() ?\n                 ToWeight::One() : ToWeight::Zero(),\n                 arc.nextstate);\n  }\n\n  constexpr MapFinalAction FinalAction() const { return MAP_NO_SUPERFINAL; }\n\n  constexpr MapSymbolsAction InputSymbolsAction() const {\n    return MAP_COPY_SYMBOLS;\n  }\n\n  constexpr MapSymbolsAction OutputSymbolsAction() const {\n    return MAP_COPY_SYMBOLS;\n  }\n\n  uint64_t Properties(uint64_t props) const {\n    return (props & kWeightInvariantProperties) | kUnweighted;\n  }\n};\n\n// Mapper to quantize all weights.\ntemplate <class A, class B = A>\nclass QuantizeMapper {\n public:\n  using FromArc = A;\n  using ToArc = B;\n  using FromWeight = typename FromArc::Weight;\n  using ToWeight = typename ToArc::Weight;\n\n  QuantizeMapper() : delta_(kDelta) {}\n\n  explicit QuantizeMapper(float d) : delta_(d) {}\n\n  ToArc operator()(const FromArc &arc) const {\n    return ToArc(arc.ilabel, arc.olabel, arc.weight.Quantize(delta_),\n                 arc.nextstate);\n  }\n\n  constexpr MapFinalAction FinalAction() const { return MAP_NO_SUPERFINAL; }\n\n  constexpr MapSymbolsAction InputSymbolsAction() const {\n    return MAP_COPY_SYMBOLS;\n  }\n\n  constexpr MapSymbolsAction OutputSymbolsAction() const {\n    return MAP_COPY_SYMBOLS;\n  }\n\n  uint64_t Properties(uint64_t props) const {\n    return props & kWeightInvariantProperties;\n  }\n\n private:\n  const float delta_;\n};\n\n// Mapper from A to B under the assumption:\n//\n//    B::Weight = A::Weight::ReverseWeight\n//    B::Label == A::Label\n//    B::StateId == A::StateId\n//\n// The weight is reversed, while the label and nextstate are preserved.\ntemplate <class A, class B>\nclass ReverseWeightMapper {\n public:\n  using FromArc = A;\n  using ToArc = B;\n\n  ToArc operator()(const FromArc &arc) const {\n    return ToArc(arc.ilabel, arc.olabel, arc.weight.Reverse(), arc.nextstate);\n  }\n\n  constexpr MapFinalAction FinalAction() const { return MAP_NO_SUPERFINAL; }\n\n  constexpr MapSymbolsAction InputSymbolsAction() const {\n    return MAP_COPY_SYMBOLS;\n  }\n\n  constexpr MapSymbolsAction OutputSymbolsAction() const {\n    return MAP_COPY_SYMBOLS;\n  }\n\n  uint64_t Properties(uint64_t props) const { return props; }\n};\n\n}  // namespace fst\n\n#endif  // FST_ARC_MAP_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/arc.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Commonly used FST arc types.\n\n#ifndef FST_ARC_H_\n#define FST_ARC_H_\n\n#include <climits>\n#include <string>\n#include <utility>\n\n\n#include <fst/expectation-weight.h>\n#include <fst/float-weight.h>\n#include <fst/lexicographic-weight.h>\n#include <fst/power-weight.h>\n#include <fst/product-weight.h>\n#include <fst/signed-log-weight.h>\n#include <fst/sparse-power-weight.h>\n#include <fst/string-weight.h>\n\n\nnamespace fst {\n\ntemplate <class W>\nstruct ArcTpl {\n public:\n  using Weight = W;\n  using Label = int;\n  using StateId = int;\n\n  Label ilabel;\n  Label olabel;\n  Weight weight;\n  StateId nextstate;\n\n  ArcTpl() {}\n\n  ArcTpl(Label ilabel, Label olabel, Weight weight, StateId nextstate)\n      : ilabel(ilabel),\n        olabel(olabel),\n        weight(std::move(weight)),\n        nextstate(nextstate) {}\n\n  static const string &Type() {\n    static const string *const type =\n        new string(Weight::Type() == \"tropical\" ? \"standard\" : Weight::Type());\n    return *type;\n  }\n};\n\nusing StdArc = ArcTpl<TropicalWeight>;\nusing LogArc = ArcTpl<LogWeight>;\nusing Log64Arc = ArcTpl<Log64Weight>;\nusing SignedLogArc = ArcTpl<SignedLogWeight>;\nusing SignedLog64Arc = ArcTpl<SignedLog64Weight>;\nusing MinMaxArc = ArcTpl<MinMaxWeight>;\n\n// Arc with integer labels and state IDs and string weights.\ntemplate <StringType S = STRING_LEFT>\nstruct StringArc {\n public:\n  using Label = int;\n  using Weight = StringWeight<int, S>;\n  using StateId = int;\n\n  Label ilabel;\n  Label olabel;\n  Weight weight;\n  StateId nextstate;\n\n  StringArc() = default;\n\n  StringArc(Label ilabel, Label olabel, Weight weight, StateId nextstate)\n      : ilabel(ilabel),\n        olabel(olabel),\n        weight(std::move(weight)),\n        nextstate(nextstate) {}\n\n  static const string &Type() {\n    static const string *const type =\n        new string(S == STRING_LEFT\n                       ? \"left_standard_string\"\n                       : (S == STRING_RIGHT ? \"right_standard_string\"\n                                            : \"restricted_standard_string\"));\n    return *type;\n  }\n};\n\n// Arc with label and state Id type the same as template arg and with\n// weights over the Gallic semiring w.r.t the output labels and weights of A.\ntemplate <class A, GallicType G = GALLIC_LEFT>\nstruct GallicArc {\n  using Arc = A;\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = GallicWeight<Label, typename Arc::Weight, G>;\n\n  Label ilabel;\n  Label olabel;\n  Weight weight;\n  StateId nextstate;\n\n  GallicArc() = default;\n\n  GallicArc(Label ilabel, Label olabel, Weight weight, StateId nextstate)\n      : ilabel(ilabel),\n        olabel(olabel),\n        weight(std::move(weight)),\n        nextstate(nextstate) {}\n\n  explicit GallicArc(const Arc &arc)\n      : ilabel(arc.ilabel), olabel(arc.ilabel), weight(arc.olabel, arc.weight),\n        nextstate(arc.nextstate) {}\n\n  static const string &Type() {\n    static const string *const type =\n        new string(\n            (G == GALLIC_LEFT\n                 ? \"left_gallic_\"\n                 : (G == GALLIC_RIGHT\n                        ? \"right_gallic_\"\n                        : (G == GALLIC_RESTRICT\n                               ? \"restricted_gallic_\"\n                               : (G == GALLIC_MIN\n                                      ? \"min_gallic_\" : \"gallic_\")))) +\n            Arc::Type());\n    return *type;\n  }\n};\n\n// Arc with the reverse of the weight found in its template arg.\ntemplate <class A>\nstruct ReverseArc {\n  using Arc = A;\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using AWeight = typename Arc::Weight;\n  using Weight = typename AWeight::ReverseWeight;\n\n  Label ilabel;\n  Label olabel;\n  Weight weight;\n  StateId nextstate;\n\n  ReverseArc() = default;\n\n  ReverseArc(Label ilabel, Label olabel, Weight weight, StateId nextstate)\n      : ilabel(ilabel),\n        olabel(olabel),\n        weight(std::move(weight)),\n        nextstate(nextstate) {}\n\n  static const string &Type() {\n    static const string *const type = new string(\"reverse_\" + Arc::Type());\n    return *type;\n  }\n};\n\n// Arc with integer labels and state IDs and lexicographic weights.\ntemplate <class Weight1, class Weight2>\nstruct LexicographicArc {\n  using Label = int;\n  using StateId = int;\n  using Weight = LexicographicWeight<Weight1, Weight2>;\n\n  Label ilabel;\n  Label olabel;\n  Weight weight;\n  StateId nextstate;\n\n  LexicographicArc() = default;\n\n  LexicographicArc(Label ilabel, Label olabel, Weight weight, StateId nextstate)\n      : ilabel(ilabel),\n        olabel(olabel),\n        weight(std::move(weight)),\n        nextstate(nextstate) {}\n\n  static const string &Type() {\n    static const string *const type = new string(Weight::Type());\n    return *type;\n  }\n};\n\n// Arc with integer labels and state IDs and product weights.\ntemplate <class Weight1, class Weight2>\nstruct ProductArc {\n  using Label = int;\n  using StateId = int;\n  using Weight = ProductWeight<Weight1, Weight2>;\n\n  Label ilabel;\n  Label olabel;\n  Weight weight;\n  StateId nextstate;\n\n  ProductArc() = default;\n\n  ProductArc(Label ilabel, Label olabel, Weight weight, StateId nextstate)\n      : ilabel(ilabel),\n        olabel(olabel),\n        weight(std::move(weight)),\n        nextstate(nextstate) {}\n\n  static const string &Type() {\n    static const string *const type = new string(Weight::Type());\n    return *type;\n  }\n};\n\n// Arc with label and state ID type the same as first template argument and with\n// weights over the n-th Cartesian power of the weight type of the template\n// argument.\ntemplate <class A, unsigned int N>\nstruct PowerArc {\n  using Arc = A;\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = PowerWeight<typename Arc::Weight, N>;\n\n  Label ilabel;\n  Label olabel;\n  Weight weight;\n  StateId nextstate;\n\n  PowerArc() = default;\n\n  PowerArc(Label ilabel, Label olabel, Weight weight, StateId nextstate)\n      : ilabel(ilabel),\n        olabel(olabel),\n        weight(std::move(weight)),\n        nextstate(nextstate) {}\n\n  static const string &Type() {\n    static const string *const type =\n        new string(Arc::Type() + \"_^\" + std::to_string(N));\n    return *type;\n  }\n};\n\n// Arc with label and state ID type the same as first template argument and with\n// weights over the arbitrary Cartesian power of the weight type.\ntemplate <class A, class K = int>\nstruct SparsePowerArc {\n  using Arc = A;\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::Label;\n  using Weight = SparsePowerWeight<typename Arc::Weight, K>;\n\n  Label ilabel;\n  Label olabel;\n  Weight weight;\n  StateId nextstate;\n\n  SparsePowerArc() = default;\n\n  SparsePowerArc(Label ilabel, Label olabel, Weight weight, StateId nextstate)\n      : ilabel(ilabel),\n        olabel(olabel),\n        weight(std::move(weight)),\n        nextstate(nextstate) {}\n\n  static const string &Type() {\n    static const string *const type = [] {\n      string type = Arc::Type() + \"_^n\";\n      if (sizeof(K) != sizeof(uint32_t)) {\n        type += \"_\" + std::to_string(CHAR_BIT * sizeof(K));\n      }\n      return new string(type);\n    }();\n    return *type;\n  }\n};\n\n// Arc with label and state ID type the same as first template argument and with\n// expectation weight over the first template argument's weight type and the\n// second template argument.\ntemplate <class A, class X2>\nstruct ExpectationArc {\n  using Arc = A;\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using X1 = typename Arc::Weight;\n  using Weight = ExpectationWeight<X1, X2>;\n\n  Label ilabel;\n  Label olabel;\n  Weight weight;\n  StateId nextstate;\n\n  ExpectationArc() = default;\n\n  ExpectationArc(Label ilabel, Label olabel, Weight weight, StateId nextstate)\n      : ilabel(ilabel),\n        olabel(olabel),\n        weight(std::move(weight)),\n        nextstate(nextstate) {}\n\n  static const string &Type() {\n    static const string *const type =\n        new string(\"expectation_\" + Arc::Type() + \"_\" + X2::Type());\n    return *type;\n  }\n};\n\n}  // namespace fst\n\n#endif  // FST_ARC_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/arcfilter.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Function objects to restrict which arcs are traversed in an FST.\n\n#ifndef FST_ARCFILTER_H_\n#define FST_ARCFILTER_H_\n\n\n#include <fst/fst.h>\n#include <fst/util.h>\n\n\nnamespace fst {\n\n// True for all arcs.\ntemplate <class Arc>\nclass AnyArcFilter {\n public:\n  bool operator()(const Arc &arc) const { return true; }\n};\n\n// True for (input/output) epsilon arcs.\ntemplate <class Arc>\nclass EpsilonArcFilter {\n public:\n  bool operator()(const Arc &arc) const {\n    return arc.ilabel == 0 && arc.olabel == 0;\n  }\n};\n\n// True for input epsilon arcs.\ntemplate <class Arc>\nclass InputEpsilonArcFilter {\n public:\n  bool operator()(const Arc &arc) const { return arc.ilabel == 0; }\n};\n\n// True for output epsilon arcs.\ntemplate <class Arc>\nclass OutputEpsilonArcFilter {\n public:\n  bool operator()(const Arc &arc) const { return arc.olabel == 0; }\n};\n\n// True if specified label matches (doesn't match) when keep_match is\n// true (false).\ntemplate <class Arc>\nclass LabelArcFilter {\n public:\n  using Label = typename Arc::Label;\n\n  explicit LabelArcFilter(Label label, bool match_input = true,\n                          bool keep_match = true)\n      : label_(label), match_input_(match_input), keep_match_(keep_match) {}\n\n  bool operator()(const Arc &arc) const {\n    const bool match = (match_input_ ? arc.ilabel : arc.olabel) == label_;\n    return keep_match_ ? match : !match;\n  }\n\n private:\n  const Label label_;\n  const bool match_input_;\n  const bool keep_match_;\n};\n\n// True if specified labels match (don't match) when keep_match is true (false).\ntemplate <class Arc>\nclass MultiLabelArcFilter {\n public:\n  using Label = typename Arc::Label;\n\n  explicit MultiLabelArcFilter(bool match_input = true, bool keep_match = true)\n      : match_input_(match_input), keep_match_(keep_match) {}\n\n  bool operator()(const Arc &arc) const {\n    const Label label = match_input_ ? arc.ilabel : arc.olabel;\n    const bool match = labels_.Find(label) != labels_.End();\n    return keep_match_ ? match : !match;\n  }\n\n  void AddLabel(Label label) { labels_.Insert(label); }\n\n private:\n  CompactSet<Label, kNoLabel> labels_;\n  const bool match_input_;\n  const bool keep_match_;\n};\n\n}  // namespace fst\n\n#endif  // FST_ARCFILTER_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/arcsort.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Functions and classes to sort arcs in an FST.\n\n#ifndef FST_ARCSORT_H_\n#define FST_ARCSORT_H_\n\n#include <algorithm>\n#include <string>\n#include <vector>\n\n#include <fst/cache.h>\n#include <fst/state-map.h>\n#include <fst/test-properties.h>\n\n\nnamespace fst {\n\ntemplate <class Arc, class Compare>\nclass ArcSortMapper {\n public:\n  using FromArc = Arc;\n  using ToArc = Arc;\n\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  ArcSortMapper(const Fst<Arc> &fst, const Compare &comp)\n      : fst_(fst), comp_(comp), i_(0) {}\n\n  // Allows updating Fst argument; pass only if changed.\n  ArcSortMapper(const ArcSortMapper<Arc, Compare> &mapper,\n                const Fst<Arc> *fst = nullptr)\n      : fst_(fst ? *fst : mapper.fst_), comp_(mapper.comp_), i_(0) {}\n\n  StateId Start() { return fst_.Start(); }\n\n  Weight Final(StateId s) const { return fst_.Final(s); }\n\n  void SetState(StateId s) {\n    i_ = 0;\n    arcs_.clear();\n    arcs_.reserve(fst_.NumArcs(s));\n    for (ArcIterator<Fst<Arc>> aiter(fst_, s); !aiter.Done(); aiter.Next()) {\n      arcs_.push_back(aiter.Value());\n    }\n    std::sort(arcs_.begin(), arcs_.end(), comp_);\n  }\n\n  bool Done() const { return i_ >= arcs_.size(); }\n\n  const Arc &Value() const { return arcs_[i_]; }\n\n  void Next() { ++i_; }\n\n  MapSymbolsAction InputSymbolsAction() const { return MAP_COPY_SYMBOLS; }\n\n  MapSymbolsAction OutputSymbolsAction() const { return MAP_COPY_SYMBOLS; }\n\n  uint64_t Properties(uint64_t props) const { return comp_.Properties(props); }\n\n private:\n  const Fst<Arc> &fst_;\n  const Compare &comp_;\n  std::vector<Arc> arcs_;\n  std::ptrdiff_t i_;  // current arc position\n\n  ArcSortMapper &operator=(const ArcSortMapper &) = delete;\n};\n\n// Sorts the arcs in an FST according to function object 'comp' of type Compare.\n// This version modifies its input. Comparison function objects ILabelCompare\n// and OLabelCompare are provided by the library. In general, Compare must meet\n// the requirements for a  comparison function object (e.g., similar to those\n// used by std::sort). It must also have a member Properties(uint64_t) that\n// specifies the known properties of the sorted FST; it takes as argument the\n// input FST's known properties before the sort.\n//\n// Complexity:\n//\n// - Time: O(v d log d)\n// - Space: O(d)\n//\n// where v = # of states and d = maximum out-degree.\ntemplate <class Arc, class Compare>\nvoid ArcSort(MutableFst<Arc> *fst, Compare comp) {\n  ArcSortMapper<Arc, Compare> mapper(*fst, comp);\n  StateMap(fst, mapper);\n}\n\nusing ArcSortFstOptions = CacheOptions;\n\n// Sorts the arcs in an FST according to function object 'comp' of type Compare.\n// This version is a delayed FST. Comparsion function objects ILabelCompare and\n// OLabelCompare are provided by the library. In general, Compare must meet the\n// requirements for a comparision function object (e.g., similar to those\n// used by std::sort). It must also have a member Properties(uint64_t) that\n// specifies the known properties of the sorted FST; it takes as argument the\n// input FST's known properties.\n//\n// Complexity:\n//\n// - Time: O(v d log d)\n// - Space: O(d)\n//\n// where v = # of states visited, d = maximum out-degree of states visited.\n// Constant time and space to visit an input state is assumed and exclusive of\n// caching.\ntemplate <class Arc, class Compare>\nclass ArcSortFst : public StateMapFst<Arc, Arc, ArcSortMapper<Arc, Compare>> {\n  using StateMapFst<Arc, Arc, ArcSortMapper<Arc, Compare>>::GetImpl;\n\n public:\n  using StateId = typename Arc::StateId;\n  using Mapper = ArcSortMapper<Arc, Compare>;\n\n  ArcSortFst(const Fst<Arc> &fst, const Compare &comp)\n      : StateMapFst<Arc, Arc, Mapper>(fst,\n                                      ArcSortMapper<Arc, Compare>(fst, comp)) {}\n\n  ArcSortFst(const Fst<Arc> &fst, const Compare &comp,\n             const ArcSortFstOptions &opts)\n      : StateMapFst<Arc, Arc, Mapper>(fst, Mapper(fst, comp), opts) {}\n\n  // See Fst<>::Copy() for doc.\n  ArcSortFst(const ArcSortFst<Arc, Compare> &fst, bool safe = false)\n      : StateMapFst<Arc, Arc, Mapper>(fst, safe) {}\n\n  // Gets a copy of this ArcSortFst. See Fst<>::Copy() for further doc.\n  ArcSortFst<Arc, Compare> *Copy(bool safe = false) const override {\n    return new ArcSortFst(*this, safe);\n  }\n\n  size_t NumArcs(StateId s) const override {\n    return GetImpl()->GetFst()->NumArcs(s);\n  }\n\n  size_t NumInputEpsilons(StateId s) const override {\n    return GetImpl()->GetFst()->NumInputEpsilons(s);\n  }\n\n  size_t NumOutputEpsilons(StateId s) const override {\n    return GetImpl()->GetFst()->NumOutputEpsilons(s);\n  }\n};\n\n// Specialization for ArcSortFst.\ntemplate <class Arc, class Compare>\nclass StateIterator<ArcSortFst<Arc, Compare>>\n    : public StateIterator<StateMapFst<Arc, Arc, ArcSortMapper<Arc, Compare>>> {\n public:\n  explicit StateIterator(const ArcSortFst<Arc, Compare> &fst)\n      : StateIterator<StateMapFst<Arc, Arc, ArcSortMapper<Arc, Compare>>>(fst) {\n  }\n};\n\n// Specialization for ArcSortFst.\ntemplate <class Arc, class Compare>\nclass ArcIterator<ArcSortFst<Arc, Compare>>\n    : public ArcIterator<StateMapFst<Arc, Arc, ArcSortMapper<Arc, Compare>>> {\n public:\n  ArcIterator(const ArcSortFst<Arc, Compare> &fst, typename Arc::StateId s)\n      : ArcIterator<StateMapFst<Arc, Arc, ArcSortMapper<Arc, Compare>>>(fst,\n                                                                        s) {}\n};\n\n// Compare class for comparing input labels of arcs.\ntemplate <class Arc>\nclass ILabelCompare {\n public:\n  ILabelCompare() {}\n\n  bool operator()(const Arc &arc1, const Arc &arc2) const {\n    return arc1.ilabel < arc2.ilabel;\n  }\n\n  uint64_t Properties(uint64_t props) const {\n    return (props & kArcSortProperties) | kILabelSorted |\n           (props & kAcceptor ? kOLabelSorted : 0);\n  }\n};\n\n// Compare class for comparing output labels of arcs.\ntemplate <class Arc>\nclass OLabelCompare {\n public:\n  OLabelCompare() {}\n\n  bool operator()(const Arc &arc1, const Arc &arc2) const {\n    return arc1.olabel < arc2.olabel;\n  }\n\n  uint64_t Properties(uint64_t props) const {\n    return (props & kArcSortProperties) | kOLabelSorted |\n           (props & kAcceptor ? kILabelSorted : 0);\n  }\n};\n\n// Useful aliases when using StdArc.\n\ntemplate <class Compare>\nusing StdArcSortFst = ArcSortFst<StdArc, Compare>;\n\nusing StdILabelCompare = ILabelCompare<StdArc>;\n\nusing StdOLabelCompare = OLabelCompare<StdArc>;\n\n}  // namespace fst\n\n#endif  // FST_ARCSORT_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/bi-table.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Classes for representing a bijective mapping between an arbitrary entry\n// of type T and a signed integral ID.\n\n#ifndef FST_BI_TABLE_H_\n#define FST_BI_TABLE_H_\n\n#include <deque>\n#include <memory>\n#include <functional>\n#include <unordered_map>\n#include <unordered_set>\n#include <vector>\n\n#include <fst/log.h>\n#include <fst/memory.h>\n\nnamespace fst {\n\n// Bitables model bijective mappings between entries of an arbitrary type T and\n// an signed integral ID of type I. The IDs are allocated starting from 0 in\n// order.\n//\n// template <class I, class T>\n// class BiTable {\n//  public:\n//\n//   // Required constructors.\n//   BiTable();\n//\n//   // Looks up integer ID from entry. If it doesn't exist and insert\n//   / is true, adds it; otherwise, returns -1.\n//   I FindId(const T &entry, bool insert = true);\n//\n//   // Looks up entry from integer ID.\n//   const T &FindEntry(I) const;\n//\n//   // Returns number of stored entries.\n//   I Size() const;\n// };\n\n// An implementation using a hash map for the entry to ID mapping. H is the\n// hash function and E is the equality function. If passed to the constructor,\n// ownership is given to this class.\ntemplate <class I, class T, class H, class E = std::equal_to<T>>\nclass HashBiTable {\n public:\n  // Reserves space for table_size elements. If passing H and E to the\n  // constructor, this class owns them.\n  explicit HashBiTable(size_t table_size = 0, H *h = nullptr, E *e = nullptr) :\n      hash_func_(h ? h : new H()), hash_equal_(e ? e : new E()),\n      entry2id_(table_size, *hash_func_, *hash_equal_) {\n    if (table_size) id2entry_.reserve(table_size);\n  }\n\n  HashBiTable(const HashBiTable<I, T, H, E> &table)\n      : hash_func_(new H(*table.hash_func_)),\n        hash_equal_(new E(*table.hash_equal_)),\n        entry2id_(table.entry2id_.begin(), table.entry2id_.end(),\n                  table.entry2id_.size(), *hash_func_, *hash_equal_),\n        id2entry_(table.id2entry_) {}\n\n  I FindId(const T &entry, bool insert = true) {\n    if (!insert) {\n      const auto it = entry2id_.find(entry);\n      return it == entry2id_.end() ? -1 : it->second - 1;\n    }\n    I &id_ref = entry2id_[entry];\n    if (id_ref == 0) {  // T not found; stores and assigns a new ID.\n      id2entry_.push_back(entry);\n      id_ref = id2entry_.size();\n    }\n    return id_ref - 1;  // NB: id_ref = ID + 1.\n  }\n\n  const T &FindEntry(I s) const { return id2entry_[s]; }\n\n  I Size() const { return id2entry_.size(); }\n\n  // TODO(riley): Add fancy clear-to-size, as in CompactHashBiTable.\n  void Clear() {\n    entry2id_.clear();\n    id2entry_.clear();\n  }\n\n private:\n  std::unique_ptr<H> hash_func_;\n  std::unique_ptr<E> hash_equal_;\n  std::unordered_map<T, I, H, E> entry2id_;\n  std::vector<T> id2entry_;\n};\n\n// Enables alternative hash set representations below.\nenum HSType { HS_STL = 0, HS_DENSE = 1, HS_SPARSE = 2, HS_FLAT = 3 };\n\n// Default hash set is STL hash_set.\ntemplate <class K, class H, class E, HSType HS>\nstruct HashSet : public std::unordered_set<K, H, E, PoolAllocator<K>> {\n  explicit HashSet(size_t n = 0, const H &h = H(), const E &e = E())\n      : std::unordered_set<K, H, E, PoolAllocator<K>>(n, h, e) {}\n\n  void rehash(size_t n) {}\n};\n\n// An implementation using a hash set for the entry to ID mapping. The hash set\n// holds keys which are either the ID or kCurrentKey. These keys can be mapped\n// to entries either by looking up in the entry vector or, if kCurrentKey, in\n// current_entry_. The hash and key equality functions map to entries first. H\n// is the hash function and E is the equality function. If passed to the\n// constructor, ownership is given to this class.\ntemplate <class I, class T, class H, class E = std::equal_to<T>,\n          HSType HS = HS_FLAT>\nclass CompactHashBiTable {\n public:\n  friend class HashFunc;\n  friend class HashEqual;\n\n  // Reserves space for table_size elements. If passing H and E to the\n  // constructor, this class owns them.\n  explicit CompactHashBiTable(size_t table_size = 0, H *h = nullptr,\n                              E *e = nullptr) :\n        hash_func_(h ? h : new H()), hash_equal_(e ? e : new E()),\n        compact_hash_func_(*this), compact_hash_equal_(*this),\n        keys_(table_size, compact_hash_func_, compact_hash_equal_) {\n    if (table_size) id2entry_.reserve(table_size);\n  }\n\n  CompactHashBiTable(const CompactHashBiTable<I, T, H, E, HS> &table)\n      : hash_func_(new H(*table.hash_func_)),\n        hash_equal_(new E(*table.hash_equal_)),\n        compact_hash_func_(*this), compact_hash_equal_(*this),\n        keys_(table.keys_.size(), compact_hash_func_, compact_hash_equal_),\n        id2entry_(table.id2entry_) {\n    keys_.insert(table.keys_.begin(), table.keys_.end());\n  }\n\n  I FindId(const T &entry, bool insert = true) {\n    current_entry_ = &entry;\n    if (insert) {\n      auto result = keys_.insert(kCurrentKey);\n      if (!result.second) return *result.first;  // Already exists.\n      // Overwrites kCurrentKey with a new key value; this is safe because it\n      // doesn't affect hashing or equality testing.\n      I key = id2entry_.size();\n      const_cast<I &>(*result.first) = key;\n      id2entry_.push_back(entry);\n      return key;\n    }\n    const auto it = keys_.find(kCurrentKey);\n    return it == keys_.end() ? -1 : *it;\n  }\n\n  const T &FindEntry(I s) const { return id2entry_[s]; }\n\n  I Size() const { return id2entry_.size(); }\n\n  // Clears content; with argument, erases last n IDs.\n  void Clear(std::ptrdiff_t n = -1) {\n    if (n < 0 || n >= id2entry_.size()) {  // Clears completely.\n      keys_.clear();\n      id2entry_.clear();\n    } else if (n == id2entry_.size() - 1) {  // Leaves only key 0.\n      const T entry = FindEntry(0);\n      keys_.clear();\n      id2entry_.clear();\n      FindId(entry, true);\n    } else {\n      while (n-- > 0) {\n        I key = id2entry_.size() - 1;\n        keys_.erase(key);\n        id2entry_.pop_back();\n      }\n      keys_.rehash(0);\n    }\n  }\n\n private:\n  static constexpr I kCurrentKey = -1;\n  static constexpr I kEmptyKey = -2;\n  static constexpr I kDeletedKey = -3;\n\n  class HashFunc {\n   public:\n    explicit HashFunc(const CompactHashBiTable &ht) : ht_(&ht) {}\n\n    size_t operator()(I k) const {\n      if (k >= kCurrentKey) {\n        return (*ht_->hash_func_)(ht_->Key2Entry(k));\n      } else {\n        return 0;\n      }\n    }\n\n   private:\n    const CompactHashBiTable *ht_;\n  };\n\n  class HashEqual {\n   public:\n    explicit HashEqual(const CompactHashBiTable &ht) : ht_(&ht) {}\n\n    bool operator()(I k1, I k2) const {\n      if (k1 == k2) {\n        return true;\n      } else if (k1 >= kCurrentKey && k2 >= kCurrentKey) {\n        return (*ht_->hash_equal_)(ht_->Key2Entry(k1), ht_->Key2Entry(k2));\n      } else {\n        return false;\n      }\n    }\n\n   private:\n    const CompactHashBiTable *ht_;\n  };\n\n  using KeyHashSet = HashSet<I, HashFunc, HashEqual, HS>;\n\n  const T &Key2Entry(I k) const {\n    if (k == kCurrentKey) {\n      return *current_entry_;\n    } else {\n      return id2entry_[k];\n    }\n  }\n\n  std::unique_ptr<H> hash_func_;\n  std::unique_ptr<E> hash_equal_;\n  HashFunc compact_hash_func_;\n  HashEqual compact_hash_equal_;\n  KeyHashSet keys_;\n  std::vector<T> id2entry_;\n  const T *current_entry_;\n};\n\ntemplate <class I, class T, class H, class E, HSType HS>\nconstexpr I CompactHashBiTable<I, T, H, E, HS>::kCurrentKey;\n\ntemplate <class I, class T, class H, class E, HSType HS>\nconstexpr I CompactHashBiTable<I, T, H, E, HS>::kEmptyKey;\n\ntemplate <class I, class T, class H, class E, HSType HS>\nconstexpr I CompactHashBiTable<I, T, H, E, HS>::kDeletedKey;\n\n// An implementation using a vector for the entry to ID mapping. It is passed a\n// function object FP that should fingerprint entries uniquely to an integer\n// that can used as a vector index. Normally, VectorBiTable constructs the FP\n// object. The user can instead pass in this object; in that case, VectorBiTable\n// takes its ownership.\ntemplate <class I, class T, class FP>\nclass VectorBiTable {\n public:\n  // Reserves table_size cells of space. If passing FP argument to the\n  // constructor, this class owns it.\n  explicit VectorBiTable(FP *fp = nullptr, size_t table_size = 0) :\n      fp_(fp ? fp : new FP()) {\n    if (table_size) id2entry_.reserve(table_size);\n  }\n\n  VectorBiTable(const VectorBiTable<I, T, FP> &table)\n      : fp_(new FP(*table.fp_)), fp2id_(table.fp2id_),\n        id2entry_(table.id2entry_) {}\n\n  I FindId(const T &entry, bool insert = true) {\n    std::ptrdiff_t fp = (*fp_)(entry);\n    if (fp >= fp2id_.size()) fp2id_.resize(fp + 1);\n    I &id_ref = fp2id_[fp];\n    if (id_ref == 0) {  // T not found.\n      if (insert) {     // Stores and assigns a new ID.\n        id2entry_.push_back(entry);\n        id_ref = id2entry_.size();\n      } else {\n        return -1;\n      }\n    }\n    return id_ref - 1;  // NB: id_ref = ID + 1.\n  }\n\n  const T &FindEntry(I s) const { return id2entry_[s]; }\n\n  I Size() const { return id2entry_.size(); }\n\n  const FP &Fingerprint() const { return *fp_; }\n\n private:\n  std::unique_ptr<FP> fp_;\n  std::vector<I> fp2id_;\n  std::vector<T> id2entry_;\n};\n\n// An implementation using a vector and a compact hash table. The selecting\n// functor S returns true for entries to be hashed in the vector. The\n// fingerprinting functor FP returns a unique fingerprint for each entry to be\n// hashed in the vector (these need to be suitable for indexing in a vector).\n// The hash functor H is used when hashing entry into the compact hash table.\n// If passed to the constructor, ownership is given to this class.\ntemplate <class I, class T, class S, class FP, class H, HSType HS = HS_DENSE>\nclass VectorHashBiTable {\n public:\n  friend class HashFunc;\n  friend class HashEqual;\n\n  explicit VectorHashBiTable(S *s, FP *fp, H *h, size_t vector_size = 0,\n                             size_t entry_size = 0)\n      : selector_(s), fp_(fp), h_(h), hash_func_(*this), hash_equal_(*this),\n        keys_(0, hash_func_, hash_equal_) {\n    if (vector_size) fp2id_.reserve(vector_size);\n    if (entry_size) id2entry_.reserve(entry_size);\n  }\n\n  VectorHashBiTable(const VectorHashBiTable<I, T, S, FP, H, HS> &table)\n      : selector_(new S(table.s_)), fp_(new FP(*table.fp_)),\n        h_(new H(*table.h_)), id2entry_(table.id2entry_),\n        fp2id_(table.fp2id_), hash_func_(*this), hash_equal_(*this),\n        keys_(table.keys_.size(), hash_func_, hash_equal_) {\n    keys_.insert(table.keys_.begin(), table.keys_.end());\n  }\n\n  I FindId(const T &entry, bool insert = true) {\n    if ((*selector_)(entry)) {  // Uses the vector if selector_(entry) == true.\n      uint64_t fp = (*fp_)(entry);\n      if (fp2id_.size() <= fp) fp2id_.resize(fp + 1, 0);\n      if (fp2id_[fp] == 0) {  // T not found.\n        if (insert) {         // Stores and assigns a new ID.\n          id2entry_.push_back(entry);\n          fp2id_[fp] = id2entry_.size();\n        } else {\n          return -1;\n        }\n      }\n      return fp2id_[fp] - 1;  // NB: assoc_value = ID + 1.\n    } else {                  // Uses the hash table otherwise.\n      current_entry_ = &entry;\n      const auto it = keys_.find(kCurrentKey);\n      if (it == keys_.end()) {\n        if (insert) {\n          I key = id2entry_.size();\n          id2entry_.push_back(entry);\n          keys_.insert(key);\n          return key;\n        } else {\n          return -1;\n        }\n      } else {\n        return *it;\n      }\n    }\n  }\n\n  const T &FindEntry(I s) const { return id2entry_[s]; }\n\n  I Size() const { return id2entry_.size(); }\n\n  const S &Selector() const { return *selector_; }\n\n  const FP &Fingerprint() const { return *fp_; }\n\n  const H &Hash() const { return *h_; }\n\n private:\n  static constexpr I kCurrentKey = -1;\n  static constexpr I kEmptyKey = -2;\n\n  class HashFunc {\n   public:\n    explicit HashFunc(const VectorHashBiTable &ht) : ht_(&ht) {}\n\n    size_t operator()(I k) const {\n      if (k >= kCurrentKey) {\n        return (*(ht_->h_))(ht_->Key2Entry(k));\n      } else {\n        return 0;\n      }\n    }\n\n   private:\n    const VectorHashBiTable *ht_;\n  };\n\n  class HashEqual {\n   public:\n    explicit HashEqual(const VectorHashBiTable &ht) : ht_(&ht) {}\n\n    bool operator()(I k1, I k2) const {\n      if (k1 >= kCurrentKey && k2 >= kCurrentKey) {\n        return ht_->Key2Entry(k1) == ht_->Key2Entry(k2);\n      } else {\n        return k1 == k2;\n      }\n    }\n\n   private:\n    const VectorHashBiTable *ht_;\n  };\n\n  using KeyHashSet = HashSet<I, HashFunc, HashEqual, HS>;\n\n  const T &Key2Entry(I k) const {\n    if (k == kCurrentKey) {\n      return *current_entry_;\n    } else {\n      return id2entry_[k];\n    }\n  }\n\n  std::unique_ptr<S> selector_;  // True if entry hashed into vector.\n  std::unique_ptr<FP> fp_;       // Fingerprint used for hashing into vector.\n  std::unique_ptr<H> h_;         // Hash funcion used for hashing into hash_set.\n\n  std::vector<T> id2entry_;  // Maps state IDs to entry.\n  std::vector<I> fp2id_;     // Maps entry fingerprints to IDs.\n\n  // Compact implementation of the hash table mapping entries to state IDs\n  // using the hash function h_.\n  HashFunc hash_func_;\n  HashEqual hash_equal_;\n  KeyHashSet keys_;\n  const T *current_entry_;\n};\n\ntemplate <class I, class T, class S, class FP, class H, HSType HS>\nconstexpr I VectorHashBiTable<I, T, S, FP, H, HS>::kCurrentKey;\n\ntemplate <class I, class T, class S, class FP, class H, HSType HS>\nconstexpr I VectorHashBiTable<I, T, S, FP, H, HS>::kEmptyKey;\n\n// An implementation using a hash map for the entry to ID mapping. This version\n// permits erasing of arbitrary states. The entry T must have == defined and\n// its default constructor must produce a entry that will never be seen. F is\n// the hash function.\ntemplate <class I, class T, class F>\nclass ErasableBiTable {\n public:\n  ErasableBiTable() : first_(0) {}\n\n  I FindId(const T &entry, bool insert = true) {\n    I &id_ref = entry2id_[entry];\n    if (id_ref == 0) {  // T not found.\n      if (insert) {     // Stores and assigns a new ID.\n        id2entry_.push_back(entry);\n        id_ref = id2entry_.size() + first_;\n      } else {\n        return -1;\n      }\n    }\n    return id_ref - 1;  // NB: id_ref = ID + 1.\n  }\n\n  const T &FindEntry(I s) const { return id2entry_[s - first_]; }\n\n  I Size() const { return id2entry_.size(); }\n\n  void Erase(I s) {\n    auto &ref = id2entry_[s - first_];\n    entry2id_.erase(ref);\n    ref = empty_entry_;\n    while (!id2entry_.empty() && id2entry_.front() == empty_entry_) {\n      id2entry_.pop_front();\n      ++first_;\n    }\n  }\n\n private:\n  std::unordered_map<T, I, F> entry2id_;\n  std::deque<T> id2entry_;\n  const T empty_entry_;\n  I first_;  // I of first element in the deque.\n};\n\n}  // namespace fst\n\n#endif  // FST_BI_TABLE_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/cache.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// An FST implementation that caches FST elements of a delayed computation.\n\n#ifndef FST_CACHE_H_\n#define FST_CACHE_H_\n\n#include <functional>\n#include <unordered_map>\nusing std::unordered_map;\nusing std::unordered_multimap;\n#include <list>\n#include <vector>\n\n#include <fst/flags.h>\n#include <fst/log.h>\n\n#include <fst/vector-fst.h>\n\n\nDECLARE_bool(fst_default_cache_gc);\nDECLARE_int64_t(fst_default_cache_gc_limit);\n\nnamespace fst {\n\n// Options for controlling caching behavior; higher level than CacheImplOptions.\nstruct CacheOptions {\n  bool gc;          // Enables GC.\n  size_t gc_limit;  // Number of bytes allowed before GC.\n\n  explicit CacheOptions(bool gc = FLAGS_fst_default_cache_gc,\n                        size_t gc_limit = FLAGS_fst_default_cache_gc_limit)\n      : gc(gc), gc_limit(gc_limit) {}\n};\n\n// Options for controlling caching behavior, at a lower level than\n// CacheOptions; templated on the cache store and allows passing the store.\ntemplate <class CacheStore>\nstruct CacheImplOptions {\n  bool gc;            // Enables GC.\n  size_t gc_limit;    // Number of bytes allowed before GC.\n  CacheStore *store;  // Cache store.\n  bool own_store;     // Should CacheImpl takes ownership of the store?\n\n  explicit CacheImplOptions(bool gc = FLAGS_fst_default_cache_gc,\n                            size_t gc_limit = FLAGS_fst_default_cache_gc_limit,\n                            CacheStore *store = nullptr)\n      : gc(gc), gc_limit(gc_limit), store(store), own_store(true) {}\n\n  explicit CacheImplOptions(const CacheOptions &opts)\n      : gc(opts.gc), gc_limit(opts.gc_limit), store(nullptr), own_store(true) {}\n};\n\n// Cache flags.\nconstexpr uint32_t kCacheFinal = 0x0001;   // Final weight has been cached.\nconstexpr uint32_t kCacheArcs = 0x0002;    // Arcs have been cached.\nconstexpr uint32_t kCacheInit = 0x0004;    // Initialized by GC.\nconstexpr uint32_t kCacheRecent = 0x0008;  // Visited since GC.\nconstexpr uint32_t kCacheFlags =\n    kCacheFinal | kCacheArcs | kCacheInit | kCacheRecent;\n\n// Cache state, with arcs stored in a per-state std::vector.\ntemplate <class A, class M = PoolAllocator<A>>\nclass CacheState {\n public:\n  using Arc = A;\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using ArcAllocator = M;\n  using StateAllocator =\n      typename ArcAllocator::template rebind<CacheState<A, M>>::other;\n\n  // Provides STL allocator for arcs.\n  explicit CacheState(const ArcAllocator &alloc)\n      : final_(Weight::Zero()),\n        niepsilons_(0),\n        noepsilons_(0),\n        arcs_(alloc),\n        flags_(0),\n        ref_count_(0) {}\n\n  CacheState(const CacheState<A> &state, const ArcAllocator &alloc)\n      : final_(state.Final()),\n        niepsilons_(state.NumInputEpsilons()),\n        noepsilons_(state.NumOutputEpsilons()),\n        arcs_(state.arcs_.begin(), state.arcs_.end(), alloc),\n        flags_(state.Flags()),\n        ref_count_(0) {}\n\n  void Reset() {\n    final_ = Weight::Zero();\n    niepsilons_ = 0;\n    noepsilons_ = 0;\n    ref_count_ = 0;\n    flags_ = 0;\n    arcs_.clear();\n  }\n\n  Weight Final() const { return final_; }\n\n  size_t NumInputEpsilons() const { return niepsilons_; }\n\n  size_t NumOutputEpsilons() const { return noepsilons_; }\n\n  size_t NumArcs() const { return arcs_.size(); }\n\n  const Arc &GetArc(size_t n) const { return arcs_[n]; }\n\n  // Used by the ArcIterator<Fst<Arc>> efficient implementation.\n  const Arc *Arcs() const { return !arcs_.empty() ? &arcs_[0] : nullptr; }\n\n  // Accesses flags; used by the caller.\n  uint32_t Flags() const { return flags_; }\n\n  // Accesses ref count; used by the caller.\n  int RefCount() const { return ref_count_; }\n\n  void SetFinal(Weight weight) { final_ = std::move(weight); }\n\n  void ReserveArcs(size_t n) { arcs_.reserve(n); }\n\n  // Adds one arc at a time with all needed book-keeping; use PushArc and\n  // SetArcs for a more efficient alternative.\n  void AddArc(const Arc &arc) {\n    arcs_.push_back(arc);\n    if (arc.ilabel == 0) ++niepsilons_;\n    if (arc.olabel == 0) ++noepsilons_;\n  }\n\n  // Adds one arc at a time with delayed book-keeping; finalize with SetArcs().\n  void PushArc(const Arc &arc) { arcs_.push_back(arc); }\n\n  // Finalizes arcs book-keeping; call only once.\n  void SetArcs() {\n    for (const auto &arc : arcs_) {\n      if (arc.ilabel == 0) ++niepsilons_;\n      if (arc.olabel == 0) ++noepsilons_;\n    }\n  }\n\n  // Modifies nth arc.\n  void SetArc(const Arc &arc, size_t n) {\n    if (arcs_[n].ilabel == 0) --niepsilons_;\n    if (arcs_[n].olabel == 0) --noepsilons_;\n    if (arc.ilabel == 0) ++niepsilons_;\n    if (arc.olabel == 0) ++noepsilons_;\n    arcs_[n] = arc;\n  }\n\n  // Deletes all arcs.\n  void DeleteArcs() {\n    niepsilons_ = 0;\n    noepsilons_ = 0;\n    arcs_.clear();\n  }\n\n  void DeleteArcs(size_t n) {\n    for (size_t i = 0; i < n; ++i) {\n      if (arcs_.back().ilabel == 0) --niepsilons_;\n      if (arcs_.back().olabel == 0) --noepsilons_;\n      arcs_.pop_back();\n    }\n  }\n\n  // Sets status flags; used by the caller.\n  void SetFlags(uint32_t flags, uint32_t mask) const {\n    flags_ &= ~mask;\n    flags_ |= flags;\n  }\n\n  // Mutates reference counts; used by the caller.\n\n  int IncrRefCount() const { return ++ref_count_; }\n\n  int DecrRefCount() const { return --ref_count_; }\n\n  // Used by the ArcIterator<Fst<Arc>> efficient implementation.\n  int *MutableRefCount() const { return &ref_count_; }\n\n  // Used for state class allocation.\n  void *operator new(size_t size, StateAllocator *alloc) {\n    return alloc->allocate(1);\n  }\n\n  // For state destruction and memory freeing.\n  static void Destroy(CacheState<Arc> *state, StateAllocator *alloc) {\n    if (state) {\n      state->~CacheState<Arc>();\n      alloc->deallocate(state, 1);\n    }\n  }\n\n private:\n  Weight final_;                         // Final weight.\n  size_t niepsilons_;                    // # of input epsilons.\n  size_t noepsilons_;                    // # of output epsilons.\n  std::vector<Arc, ArcAllocator> arcs_;  // Arcs representation.\n  mutable uint32_t flags_;\n  mutable int ref_count_;  // If 0, available for GC.\n};\n\n// Cache store, allocating and storing states, providing a mapping from state\n// IDs to cached states, and an iterator over these states. The state template\n// argument must implement the CacheState interface. The state for a StateId s\n// is constructed when requested by GetMutableState(s) if it is not yet stored.\n// Initially, a state has a reference count of zero, but the user may increment\n// or decrement this to control the time of destruction. In particular, a state\n// is destroyed when:\n//\n// 1. This instance is destroyed, or\n// 2. Clear() or Delete() is called, or\n// 3. Possibly (implementation-dependently) when:\n//    - Garbage collection is enabled (as defined by opts.gc),\n//    - The cache store size exceeds the limits (as defined by opts.gc_limits),\n//    - The state's reference count is zero, and\n//    - The state is not the most recently requested state.\n//\n// template <class S>\n// class CacheStore {\n//  public:\n//   using State = S;\n//   using Arc = typename State::Arc;\n//   using StateId = typename Arc::StateId;\n//\n//   // Required constructors/assignment operators.\n//   explicit CacheStore(const CacheOptions &opts);\n//\n//   // Returns nullptr if state is not stored.\n//   const State *GetState(StateId s);\n//\n//   // Creates state if state is not stored.\n//   State *GetMutableState(StateId s);\n//\n//   // Similar to State::AddArc() but updates cache store book-keeping.\n//   void AddArc(State *state, const Arc &arc);\n//\n//   // Similar to State::SetArcs() but updates cache store book-keeping; call\n//   // only once.\n//   void SetArcs(State *state);\n//\n//   // Similar to State::DeleteArcs() but updates cache store book-keeping.\n//\n//   void DeleteArcs(State *state);\n//\n//   void DeleteArcs(State *state, size_t n);\n//\n//   // Deletes all cached states.\n//   void Clear();\n//\n//   // Iterates over cached states (in an arbitrary order); only needed if\n//   // opts.gc is true.\n//   bool Done() const;      // End of iteration.\n//   StateId Value() const;  // Current state.\n//   void Next();            // Advances to next state (when !Done).\n//   void Reset();           // Returns to initial condition.\n//   void Delete();          // Deletes current state and advances to next.\n// };\n\n// Container cache stores.\n\n// This class uses a vector of pointers to states to store cached states.\ntemplate <class S>\nclass VectorCacheStore {\n public:\n  using State = S;\n  using Arc = typename State::Arc;\n  using StateId = typename Arc::StateId;\n  using StateList = std::list<StateId, PoolAllocator<StateId>>;\n\n  // Required constructors/assignment operators.\n  explicit VectorCacheStore(const CacheOptions &opts) : cache_gc_(opts.gc) {\n    Clear();\n    Reset();\n  }\n\n  VectorCacheStore(const VectorCacheStore<S> &store)\n      : cache_gc_(store.cache_gc_) {\n    CopyStates(store);\n    Reset();\n  }\n\n  ~VectorCacheStore() { Clear(); }\n\n  VectorCacheStore<State> &operator=(const VectorCacheStore<State> &store) {\n    if (this != &store) {\n      CopyStates(store);\n      Reset();\n    }\n    return *this;\n  }\n\n  // Returns nullptr if state is not stored.\n  const State *GetState(StateId s) const {\n    return s < state_vec_.size() ? state_vec_[s] : nullptr;\n  }\n\n  // Creates state if state is not stored.\n  State *GetMutableState(StateId s) {\n    State *state = nullptr;\n    if (s >= state_vec_.size()) {\n      state_vec_.resize(s + 1, nullptr);\n    } else {\n      state = state_vec_[s];\n    }\n    if (!state) {\n      state = new (&state_alloc_) State(arc_alloc_);\n      state_vec_[s] = state;\n      if (cache_gc_) state_list_.push_back(s);\n    }\n    return state;\n  }\n\n  // Similar to State::AddArc() but updates cache store book-keeping\n  void AddArc(State *state, const Arc &arc) { state->AddArc(arc); }\n\n  // Similar to State::SetArcs() but updates cache store book-keeping; call\n  // only once.\n  void SetArcs(State *state) { state->SetArcs(); }\n\n  // Deletes all arcs.\n  void DeleteArcs(State *state) { state->DeleteArcs(); }\n\n  // Deletes some arcs.\n  void DeleteArcs(State *state, size_t n) { state->DeleteArcs(n); }\n\n  // Deletes all cached states.\n  void Clear() {\n    for (StateId s = 0; s < state_vec_.size(); ++s) {\n      State::Destroy(state_vec_[s], &state_alloc_);\n    }\n    state_vec_.clear();\n    state_list_.clear();\n  }\n\n  // Iterates over cached states (in an arbitrary order); only works if GC is\n  // enabled (o.w. avoiding state_list_ overhead).\n  bool Done() const { return iter_ == state_list_.end(); }\n\n  StateId Value() const { return *iter_; }\n\n  void Next() { ++iter_; }\n\n  void Reset() { iter_ = state_list_.begin(); }\n\n  // Deletes current state and advances to next.\n  void Delete() {\n    State::Destroy(state_vec_[*iter_], &state_alloc_);\n    state_vec_[*iter_] = nullptr;\n    state_list_.erase(iter_++);\n  }\n\n private:\n  void CopyStates(const VectorCacheStore<State> &store) {\n    Clear();\n    state_vec_.reserve(store.state_vec_.size());\n    for (StateId s = 0; s < store.state_vec_.size(); ++s) {\n      State *state = nullptr;\n      const auto *store_state = store.state_vec_[s];\n      if (store_state) {\n        state = new (&state_alloc_) State(*store_state, arc_alloc_);\n        if (cache_gc_) state_list_.push_back(s);\n      }\n      state_vec_.push_back(state);\n    }\n  }\n\n  bool cache_gc_;                               // Supports iteration when true.\n  std::vector<State *> state_vec_;              // Vector of states (or null).\n  StateList state_list_;                        // List of states.\n  typename StateList::iterator iter_;           // State list iterator.\n  typename State::StateAllocator state_alloc_;  // For state allocation.\n  typename State::ArcAllocator arc_alloc_;      // For arc allocation.\n};\n\n// This class uses a hash map from state IDs to pointers to cached states.\ntemplate <class S>\nclass HashCacheStore {\n public:\n  using State = S;\n  using Arc = typename State::Arc;\n  using StateId = typename Arc::StateId;\n\n  using StateMap =\n      std::unordered_map<StateId, State *, std::hash<StateId>,\n                         std::equal_to<StateId>,\n                         PoolAllocator<std::pair<const StateId, State *>>>;\n\n  // Required constructors/assignment operators.\n  explicit HashCacheStore(const CacheOptions &opts) {\n    Clear();\n    Reset();\n  }\n\n  HashCacheStore(const HashCacheStore<S> &store) {\n    CopyStates(store);\n    Reset();\n  }\n\n  ~HashCacheStore() { Clear(); }\n\n  HashCacheStore<State> &operator=(const HashCacheStore<State> &store) {\n    if (this != &store) {\n      CopyStates(store);\n      Reset();\n    }\n    return *this;\n  }\n\n  // Returns nullptr if state is not stored.\n  const State *GetState(StateId s) const {\n    const auto it = state_map_.find(s);\n    return it != state_map_.end() ? it->second : nullptr;\n  }\n\n  // Creates state if state is not stored.\n  State *GetMutableState(StateId s) {\n    auto *&state = state_map_[s];\n    if (!state) state = new (&state_alloc_) State(arc_alloc_);\n    return state;\n  }\n\n  // Similar to State::AddArc() but updates cache store book-keeping.\n  void AddArc(State *state, const Arc &arc) { state->AddArc(arc); }\n\n  // Similar to State::SetArcs() but updates internal cache size; call only\n  // once.\n  void SetArcs(State *state) { state->SetArcs(); }\n\n  // Deletes all arcs.\n  void DeleteArcs(State *state) { state->DeleteArcs(); }\n\n  // Deletes some arcs.\n  void DeleteArcs(State *state, size_t n) { state->DeleteArcs(n); }\n\n  // Deletes all cached states.\n  void Clear() {\n    for (auto it = state_map_.begin(); it != state_map_.end(); ++it) {\n      State::Destroy(it->second, &state_alloc_);\n    }\n    state_map_.clear();\n  }\n\n  // Iterates over cached states (in an arbitrary order).\n  bool Done() const { return iter_ == state_map_.end(); }\n\n  StateId Value() const { return iter_->first; }\n\n  void Next() { ++iter_; }\n\n  void Reset() { iter_ = state_map_.begin(); }\n\n  // Deletes current state and advances to next.\n  void Delete() {\n    State::Destroy(iter_->second, &state_alloc_);\n    state_map_.erase(iter_++);\n  }\n\n private:\n  void CopyStates(const HashCacheStore<State> &store) {\n    Clear();\n    for (auto it = store.state_map_.begin(); it != store.state_map_.end();\n         ++it) {\n      state_map_[it->first] =\n          new (&state_alloc_) State(*it->second, arc_alloc_);\n    }\n  }\n\n  StateMap state_map_;                          // Map from state ID to state.\n  typename StateMap::iterator iter_;            // State map iterator.\n  typename State::StateAllocator state_alloc_;  // For state allocation.\n  typename State::ArcAllocator arc_alloc_;      // For arc allocation.\n};\n\n// Garbage-colllection cache stores.\n\n// This class implements a simple garbage collection scheme when\n// 'opts.gc_limit = 0'. In particular, the first cached state is reused for each\n// new state so long as the reference count is zero on the to-be-reused state.\n// Otherwise, the full underlying store is used. The caller can increment the\n// reference count to inhibit the GC of in-use states (e.g., in an ArcIterator).\n//\n// The typical use case for this optimization is when a single pass over a\n// cached\n// FST is performed with only one-state expanded at a time.\ntemplate <class CacheStore>\nclass FirstCacheStore {\n public:\n  using State = typename CacheStore::State;\n  using Arc = typename State::Arc;\n  using StateId = typename Arc::StateId;\n\n  // Required constructors/assignment operators.\n  explicit FirstCacheStore(const CacheOptions &opts)\n      : store_(opts),\n        cache_gc_(opts.gc_limit == 0),  // opts.gc ignored historically.\n        cache_first_state_id_(kNoStateId),\n        cache_first_state_(nullptr) {}\n\n  FirstCacheStore(const FirstCacheStore<CacheStore> &store)\n      : store_(store.store_),\n        cache_gc_(store.cache_gc_),\n        cache_first_state_id_(store.cache_first_state_id_),\n        cache_first_state_(store.cache_first_state_id_ != kNoStateId\n                               ? store_.GetMutableState(0)\n                               : nullptr) {}\n\n  FirstCacheStore<CacheStore> &operator=(\n      const FirstCacheStore<CacheStore> &store) {\n    if (this != &store) {\n      store_ = store.store_;\n      cache_gc_ = store.cache_gc_;\n      cache_first_state_id_ = store.cache_first_state_id_;\n      cache_first_state_ = store.cache_first_state_id_ != kNoStateId\n                               ? store_.GetMutableState(0)\n                               : nullptr;\n    }\n    return *this;\n  }\n\n  // Returns nullptr if state is not stored.\n  const State *GetState(StateId s) const {\n    // store_ state 0 may hold first cached state; the rest are shifted by 1.\n    return s == cache_first_state_id_ ? cache_first_state_\n                                      : store_.GetState(s + 1);\n  }\n\n  // Creates state if state is not stored.\n  State *GetMutableState(StateId s) {\n    // store_ state 0 used to hold first cached state; the rest are shifted by\n    // 1.\n    if (cache_first_state_id_ == s) {\n      return cache_first_state_;  // Request for first cached state.\n    }\n    if (cache_gc_) {\n      if (cache_first_state_id_ == kNoStateId) {\n        cache_first_state_id_ = s;  // Sets first cached state.\n        cache_first_state_ = store_.GetMutableState(0);\n        cache_first_state_->SetFlags(kCacheInit, kCacheInit);\n        cache_first_state_->ReserveArcs(2 * kAllocSize);\n        return cache_first_state_;\n      } else if (cache_first_state_->RefCount() == 0) {\n        cache_first_state_id_ = s;  // Updates first cached state.\n        cache_first_state_->Reset();\n        cache_first_state_->SetFlags(kCacheInit, kCacheInit);\n        return cache_first_state_;\n      } else {  // Keeps first cached state.\n        cache_first_state_->SetFlags(0, kCacheInit);  // Clears initialized bit.\n        cache_gc_ = false;                            // Disables GC.\n      }\n    }\n    auto *state = store_.GetMutableState(s + 1);\n    return state;\n  }\n\n  // Similar to State::AddArc() but updates cache store book-keeping.\n  void AddArc(State *state, const Arc &arc) { store_.AddArc(state, arc); }\n\n  // Similar to State::SetArcs() but updates internal cache size; call only\n  // once.\n  void SetArcs(State *state) { store_.SetArcs(state); }\n\n  // Deletes all arcs\n  void DeleteArcs(State *state) { store_.DeleteArcs(state); }\n\n  // Deletes some arcs\n  void DeleteArcs(State *state, size_t n) { store_.DeleteArcs(state, n); }\n\n  // Deletes all cached states\n  void Clear() {\n    store_.Clear();\n    cache_first_state_id_ = kNoStateId;\n    cache_first_state_ = nullptr;\n  }\n\n  // Iterates over cached states (in an arbitrary order). Only needed if GC is\n  // enabled.\n  bool Done() const { return store_.Done(); }\n\n  StateId Value() const {\n    // store_ state 0 may hold first cached state; rest shifted + 1.\n    const auto s = store_.Value();\n    return s ? s - 1 : cache_first_state_id_;\n  }\n\n  void Next() { store_.Next(); }\n\n  void Reset() { store_.Reset(); }\n\n  // Deletes current state and advances to next.\n  void Delete() {\n    if (Value() == cache_first_state_id_) {\n      cache_first_state_id_ = kNoStateId;\n      cache_first_state_ = nullptr;\n    }\n    store_.Delete();\n  }\n\n private:\n  CacheStore store_;              // Underlying store.\n  bool cache_gc_;                 // GC enabled.\n  StateId cache_first_state_id_;  // First cached state ID.\n  State *cache_first_state_;      // First cached state.\n};\n\n// This class implements mark-sweep garbage collection on an underlying cache\n// store. If GC is enabled, garbage collection of states is performed in a\n// rough approximation of LRU order once when 'gc_limit' bytes is reached. The\n// caller can increment the reference count to inhibit the GC of in-use state\n// (e.g., in an ArcIterator). With GC enabled, the 'gc_limit' parameter allows\n// the caller to trade-off time vs. space.\ntemplate <class CacheStore>\nclass GCCacheStore {\n public:\n  using State = typename CacheStore::State;\n  using Arc = typename State::Arc;\n  using StateId = typename Arc::StateId;\n\n  // Required constructors/assignment operators.\n  explicit GCCacheStore(const CacheOptions &opts)\n      : store_(opts),\n        cache_gc_request_(opts.gc),\n        cache_limit_(opts.gc_limit > kMinCacheLimit ? opts.gc_limit\n                                                    : kMinCacheLimit),\n        cache_gc_(false),\n        cache_size_(0) {}\n\n  // Returns 0 if state is not stored.\n  const State *GetState(StateId s) const { return store_.GetState(s); }\n\n  // Creates state if state is not stored\n  State *GetMutableState(StateId s) {\n    auto *state = store_.GetMutableState(s);\n    if (cache_gc_request_ && !(state->Flags() & kCacheInit)) {\n      state->SetFlags(kCacheInit, kCacheInit);\n      cache_size_ += sizeof(State) + state->NumArcs() * sizeof(Arc);\n      // GC is enabled once an uninited state (from underlying store) is seen.\n      cache_gc_ = true;\n      if (cache_size_ > cache_limit_) GC(state, false);\n    }\n    return state;\n  }\n\n  // Similar to State::AddArc() but updates cache store book-keeping.\n  void AddArc(State *state, const Arc &arc) {\n    store_.AddArc(state, arc);\n    if (cache_gc_ && (state->Flags() & kCacheInit)) {\n      cache_size_ += sizeof(Arc);\n      if (cache_size_ > cache_limit_) GC(state, false);\n    }\n  }\n\n  // Similar to State::SetArcs() but updates internal cache size; call only\n  // once.\n  void SetArcs(State *state) {\n    store_.SetArcs(state);\n    if (cache_gc_ && (state->Flags() & kCacheInit)) {\n      cache_size_ += state->NumArcs() * sizeof(Arc);\n      if (cache_size_ > cache_limit_) GC(state, false);\n    }\n  }\n\n  // Deletes all arcs.\n  void DeleteArcs(State *state) {\n    if (cache_gc_ && (state->Flags() & kCacheInit)) {\n      cache_size_ -= state->NumArcs() * sizeof(Arc);\n    }\n    store_.DeleteArcs(state);\n  }\n\n  // Deletes some arcs.\n  void DeleteArcs(State *state, size_t n) {\n    if (cache_gc_ && (state->Flags() & kCacheInit)) {\n      cache_size_ -= n * sizeof(Arc);\n    }\n    store_.DeleteArcs(state, n);\n  }\n\n  // Deletes all cached states.\n  void Clear() {\n    store_.Clear();\n    cache_size_ = 0;\n  }\n\n  // Iterates over cached states (in an arbitrary order); only needed if GC is\n  // enabled.\n  bool Done() const { return store_.Done(); }\n\n  StateId Value() const { return store_.Value(); }\n\n  void Next() { store_.Next(); }\n\n  void Reset() { store_.Reset(); }\n\n  // Deletes current state and advances to next.\n  void Delete() {\n    if (cache_gc_) {\n      const auto *state = store_.GetState(Value());\n      if (state->Flags() & kCacheInit) {\n        cache_size_ -= sizeof(State) + state->NumArcs() * sizeof(Arc);\n      }\n    }\n    store_.Delete();\n  }\n\n  // Removes from the cache store (not referenced-counted and not the current)\n  // states that have not been accessed since the last GC until at most\n  // cache_fraction * cache_limit_ bytes are cached. If that fails to free\n  // enough, attempts to uncaching recently visited states as well. If still\n  // unable to free enough memory, then widens cache_limit_.\n  void GC(const State *current, bool free_recent, float cache_fraction = 0.666);\n\n  // Returns the current cache size in bytes or 0 if GC is disabled.\n  size_t CacheSize() const { return cache_size_; }\n\n  // Returns the cache limit in bytes.\n  size_t CacheLimit() const { return cache_limit_; }\n\n private:\n  static constexpr size_t kMinCacheLimit = 8096;  // Minimum cache limit.\n\n  CacheStore store_;       // Underlying store.\n  bool cache_gc_request_;  // GC requested but possibly not yet enabled.\n  size_t cache_limit_;     // Number of bytes allowed before GC.\n  bool cache_gc_;          // GC enabled\n  size_t cache_size_;      // Number of bytes cached.\n};\n\ntemplate <class CacheStore>\nvoid GCCacheStore<CacheStore>::GC(const State *current, bool free_recent,\n                                  float cache_fraction) {\n  if (!cache_gc_) return;\n  VLOG(2) << \"GCCacheStore: Enter GC: object = \"\n          << \"(\" << this << \"), free recently cached = \" << free_recent\n          << \", cache size = \" << cache_size_\n          << \", cache frac = \" << cache_fraction\n          << \", cache limit = \" << cache_limit_ << \"\\n\";\n  size_t cache_target = cache_fraction * cache_limit_;\n  store_.Reset();\n  while (!store_.Done()) {\n    auto *state = store_.GetMutableState(store_.Value());\n    if (cache_size_ > cache_target && state->RefCount() == 0 &&\n        (free_recent || !(state->Flags() & kCacheRecent)) && state != current) {\n      if (state->Flags() & kCacheInit) {\n        size_t size = sizeof(State) + state->NumArcs() * sizeof(Arc);\n        if (size < cache_size_) {\n          cache_size_ -= size;\n        }\n      }\n      store_.Delete();\n    } else {\n      state->SetFlags(0, kCacheRecent);\n      store_.Next();\n    }\n  }\n  if (!free_recent && cache_size_ > cache_target) {  // Recurses on recent.\n    GC(current, true, cache_fraction);\n  } else if (cache_target > 0) {  // Widens cache limit.\n    while (cache_size_ > cache_target) {\n      cache_limit_ *= 2;\n      cache_target *= 2;\n    }\n  } else if (cache_size_ > 0) {\n    FSTERROR() << \"GCCacheStore:GC: Unable to free all cached states\";\n  }\n  VLOG(2) << \"GCCacheStore: Exit GC: object = \"\n          << \"(\" << this << \"), free recently cached = \" << free_recent\n          << \", cache size = \" << cache_size_\n          << \", cache frac = \" << cache_fraction\n          << \", cache limit = \" << cache_limit_ << \"\\n\";\n}\n\ntemplate <class CacheStore>\nconstexpr size_t GCCacheStore<CacheStore>::kMinCacheLimit;\n\n// This class is the default cache state and store used by CacheBaseImpl.\n// It uses VectorCacheStore for storage decorated by FirstCacheStore\n// and GCCacheStore to do (optional) garbage collection.\ntemplate <class Arc>\nclass DefaultCacheStore\n    : public GCCacheStore<FirstCacheStore<VectorCacheStore<CacheState<Arc>>>> {\n public:\n  explicit DefaultCacheStore(const CacheOptions &opts)\n      : GCCacheStore<FirstCacheStore<VectorCacheStore<CacheState<Arc>>>>(opts) {\n  }\n};\n\nnamespace internal {\n\n// This class is used to cache FST elements stored in states of type State\n// (see CacheState) with the flags used to indicate what has been cached. Use\n// HasStart(), HasFinal(), and HasArcs() to determine if cached and SetStart(),\n// SetFinal(), AddArc(), (or PushArc() and SetArcs()) to cache. Note that you\n// must set the final weight even if the state is non-final to mark it as\n// cached. The state storage method and any garbage collection policy are\n// determined by the cache store. If the store is passed in with the options,\n// CacheBaseImpl takes ownership.\ntemplate <class State,\n          class CacheStore = DefaultCacheStore<typename State::Arc>>\nclass CacheBaseImpl : public FstImpl<typename State::Arc> {\n public:\n  using Arc = typename State::Arc;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using Store = CacheStore;\n\n  using FstImpl<Arc>::Type;\n  using FstImpl<Arc>::Properties;\n\n  explicit CacheBaseImpl(const CacheOptions &opts = CacheOptions())\n      : has_start_(false),\n        cache_start_(kNoStateId),\n        nknown_states_(0),\n        min_unexpanded_state_id_(0),\n        max_expanded_state_id_(-1),\n        cache_gc_(opts.gc),\n        cache_limit_(opts.gc_limit),\n        cache_store_(new CacheStore(opts)),\n        new_cache_store_(true),\n        own_cache_store_(true) {}\n\n  explicit CacheBaseImpl(const CacheImplOptions<CacheStore> &opts)\n      : has_start_(false),\n        cache_start_(kNoStateId),\n        nknown_states_(0),\n        min_unexpanded_state_id_(0),\n        max_expanded_state_id_(-1),\n        cache_gc_(opts.gc),\n        cache_limit_(opts.gc_limit),\n        cache_store_(opts.store ? opts.store : new CacheStore(CacheOptions(\n                                                   opts.gc, opts.gc_limit))),\n        new_cache_store_(!opts.store),\n        own_cache_store_(opts.store ? opts.own_store : true) {}\n\n  // Preserve gc parameters. If preserve_cache is true, also preserves\n  // cache data.\n  CacheBaseImpl(const CacheBaseImpl<State, CacheStore> &impl,\n                bool preserve_cache = false)\n      : FstImpl<Arc>(),\n        has_start_(false),\n        cache_start_(kNoStateId),\n        nknown_states_(0),\n        min_unexpanded_state_id_(0),\n        max_expanded_state_id_(-1),\n        cache_gc_(impl.cache_gc_),\n        cache_limit_(impl.cache_limit_),\n        cache_store_(new CacheStore(CacheOptions(cache_gc_, cache_limit_))),\n        new_cache_store_(impl.new_cache_store_ || !preserve_cache),\n        own_cache_store_(true) {\n    if (preserve_cache) {\n      *cache_store_ = *impl.cache_store_;\n      has_start_ = impl.has_start_;\n      cache_start_ = impl.cache_start_;\n      nknown_states_ = impl.nknown_states_;\n      expanded_states_ = impl.expanded_states_;\n      min_unexpanded_state_id_ = impl.min_unexpanded_state_id_;\n      max_expanded_state_id_ = impl.max_expanded_state_id_;\n    }\n  }\n\n  ~CacheBaseImpl() override { if (own_cache_store_) delete cache_store_; }\n\n  void SetStart(StateId s) {\n    cache_start_ = s;\n    has_start_ = true;\n    if (s >= nknown_states_) nknown_states_ = s + 1;\n  }\n\n  void SetFinal(StateId s, Weight weight) {\n    auto *state = cache_store_->GetMutableState(s);\n    state->SetFinal(std::move(weight));\n    static constexpr auto flags = kCacheFinal | kCacheRecent;\n    state->SetFlags(flags, flags);\n  }\n\n// Disabled to ensure PushArc not AddArc is used in existing code\n// TODO(sorenj): re-enable for backing store\n#if 0\n  // AddArc adds a single arc to a state and does incremental cache\n  // book-keeping. For efficiency, prefer PushArc and SetArcs below\n  // when possible.\n  void AddArc(StateId s, const Arc &arc) {\n    auto *state = cache_store_->GetMutableState(s);\n    cache_store_->AddArc(state, arc);\n    if (arc.nextstate >= nknown_states_)\n      nknown_states_ = arc.nextstate + 1;\n    SetExpandedState(s);\n    static constexpr auto flags = kCacheArcs | kCacheRecent;\n    state->SetFlags(flags, flags);\n  }\n#endif\n\n  // Adds a single arc to a state but delays cache book-keeping. SetArcs must\n  // be called when all PushArc calls at a state are complete. Do not mix with\n  // calls to AddArc.\n  void PushArc(StateId s, const Arc &arc) {\n    auto *state = cache_store_->GetMutableState(s);\n    state->PushArc(arc);\n  }\n\n  // Marks arcs of a state as cached and does cache book-keeping after all\n  // calls to PushArc have been completed. Do not mix with calls to AddArc.\n  void SetArcs(StateId s) {\n    auto *state = cache_store_->GetMutableState(s);\n    cache_store_->SetArcs(state);\n    const auto narcs = state->NumArcs();\n    for (size_t a = 0; a < narcs; ++a) {\n      const auto &arc = state->GetArc(a);\n      if (arc.nextstate >= nknown_states_) nknown_states_ = arc.nextstate + 1;\n    }\n    SetExpandedState(s);\n    static constexpr auto flags = kCacheArcs | kCacheRecent;\n    state->SetFlags(flags, flags);\n  }\n\n  void ReserveArcs(StateId s, size_t n) {\n    auto *state = cache_store_->GetMutableState(s);\n    state->ReserveArcs(n);\n  }\n\n  void DeleteArcs(StateId s) {\n    auto *state = cache_store_->GetMutableState(s);\n    cache_store_->DeleteArcs(state);\n  }\n\n  void DeleteArcs(StateId s, size_t n) {\n    auto *state = cache_store_->GetMutableState(s);\n    cache_store_->DeleteArcs(state, n);\n  }\n\n  void Clear() {\n    nknown_states_ = 0;\n    min_unexpanded_state_id_ = 0;\n    max_expanded_state_id_ = -1;\n    has_start_ = false;\n    cache_start_ = kNoStateId;\n    cache_store_->Clear();\n  }\n\n  // Is the start state cached?\n  bool HasStart() const {\n    if (!has_start_ && Properties(kError)) has_start_ = true;\n    return has_start_;\n  }\n\n  // Is the final weight of the state cached?\n  bool HasFinal(StateId s) const {\n    const auto *state = cache_store_->GetState(s);\n    if (state && state->Flags() & kCacheFinal) {\n      state->SetFlags(kCacheRecent, kCacheRecent);\n      return true;\n    } else {\n      return false;\n    }\n  }\n\n  // Are arcs of the state cached?\n  bool HasArcs(StateId s) const {\n    const auto *state = cache_store_->GetState(s);\n    if (state && state->Flags() & kCacheArcs) {\n      state->SetFlags(kCacheRecent, kCacheRecent);\n      return true;\n    } else {\n      return false;\n    }\n  }\n\n  StateId Start() const { return cache_start_; }\n\n  Weight Final(StateId s) const {\n    const auto *state = cache_store_->GetState(s);\n    return state->Final();\n  }\n\n  size_t NumArcs(StateId s) const {\n    const auto *state = cache_store_->GetState(s);\n    return state->NumArcs();\n  }\n\n  size_t NumInputEpsilons(StateId s) const {\n    const auto *state = cache_store_->GetState(s);\n    return state->NumInputEpsilons();\n  }\n\n  size_t NumOutputEpsilons(StateId s) const {\n    const auto *state = cache_store_->GetState(s);\n    return state->NumOutputEpsilons();\n  }\n\n  // Provides information needed for generic arc iterator.\n  void InitArcIterator(StateId s, ArcIteratorData<Arc> *data) const {\n    const auto *state = cache_store_->GetState(s);\n    data->base = nullptr;\n    data->narcs = state->NumArcs();\n    data->arcs = state->Arcs();\n    data->ref_count = state->MutableRefCount();\n    state->IncrRefCount();\n  }\n\n  // Number of known states.\n  StateId NumKnownStates() const { return nknown_states_; }\n\n  // Updates number of known states, taking into account the passed state ID.\n  void UpdateNumKnownStates(StateId s) {\n    if (s >= nknown_states_) nknown_states_ = s + 1;\n  }\n\n  // Finds the mininum never-expanded state ID.\n  StateId MinUnexpandedState() const {\n    while (min_unexpanded_state_id_ <= max_expanded_state_id_ &&\n           ExpandedState(min_unexpanded_state_id_)) {\n      ++min_unexpanded_state_id_;\n    }\n    return min_unexpanded_state_id_;\n  }\n\n  // Returns maximum ever-expanded state ID.\n  StateId MaxExpandedState() const { return max_expanded_state_id_; }\n\n  void SetExpandedState(StateId s) {\n    if (s > max_expanded_state_id_) max_expanded_state_id_ = s;\n    if (s < min_unexpanded_state_id_) return;\n    if (s == min_unexpanded_state_id_) ++min_unexpanded_state_id_;\n    if (cache_gc_ || cache_limit_ == 0) {\n      if (expanded_states_.size() <= s) expanded_states_.resize(s + 1, false);\n      expanded_states_[s] = true;\n    }\n  }\n\n  bool ExpandedState(StateId s) const {\n    if (cache_gc_ || cache_limit_ == 0) {\n      return expanded_states_[s];\n    } else if (new_cache_store_) {\n      return cache_store_->GetState(s) != nullptr;\n    } else {\n      // If the cache was not created by this class, then the cached state needs\n      // to be inspected to update nknown_states_.\n      return false;\n    }\n  }\n\n  const CacheStore *GetCacheStore() const { return cache_store_; }\n\n  CacheStore *GetCacheStore() { return cache_store_; }\n\n  // Caching on/off switch, limit and size accessors.\n\n  bool GetCacheGc() const { return cache_gc_; }\n\n  size_t GetCacheLimit() const { return cache_limit_; }\n\n private:\n  mutable bool has_start_;                   // Is the start state cached?\n  StateId cache_start_;                      // ID of start state.\n  StateId nknown_states_;                    // Number of known states.\n  std::vector<bool> expanded_states_;        // States that have been expanded.\n  mutable StateId min_unexpanded_state_id_;  // Minimum never-expanded state ID\n  mutable StateId max_expanded_state_id_;    // Maximum ever-expanded state ID\n  bool cache_gc_;                            // GC enabled.\n  size_t cache_limit_;       // Number of bytes allowed before GC.\n  CacheStore *cache_store_;  // The store of cached states.\n  bool new_cache_store_;     // Was the store was created by class?\n  bool own_cache_store_;     // Is the store owned by class?\n\n  CacheBaseImpl &operator=(const CacheBaseImpl &impl) = delete;\n};\n\n// A CacheBaseImpl with the default cache state type.\ntemplate <class Arc>\nclass CacheImpl : public CacheBaseImpl<CacheState<Arc>> {\n public:\n  using State = CacheState<Arc>;\n\n  CacheImpl() {}\n\n  explicit CacheImpl(const CacheOptions &opts)\n      : CacheBaseImpl<CacheState<Arc>>(opts) {}\n\n  CacheImpl(const CacheImpl<Arc> &impl, bool preserve_cache = false)\n      : CacheBaseImpl<State>(impl, preserve_cache) {}\n\n private:\n  CacheImpl &operator=(const CacheImpl &impl) = delete;\n};\n\n}  // namespace internal\n\n// Use this to make a state iterator for a CacheBaseImpl-derived FST, which must\n// have Arc and Store types defined. Note this iterator only returns those\n// states reachable from the initial state, so consider implementing a\n// class-specific one.\n//\n// This class may be derived from.\ntemplate <class FST>\nclass CacheStateIterator : public StateIteratorBase<typename FST::Arc> {\n public:\n  using Arc = typename FST::Arc;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using Store = typename FST::Store;\n  using State = typename Store::State;\n  using Impl = internal::CacheBaseImpl<State, Store>;\n\n  CacheStateIterator(const FST &fst, Impl *impl)\n      : fst_(fst), impl_(impl), s_(0) {\n    fst_.Start();  // Forces start state.\n  }\n\n  bool Done() const final {\n    if (s_ < impl_->NumKnownStates()) return false;\n    for (StateId u = impl_->MinUnexpandedState(); u < impl_->NumKnownStates();\n         u = impl_->MinUnexpandedState()) {\n      // Forces state expansion.\n      ArcIterator<FST> aiter(fst_, u);\n      aiter.SetFlags(kArcValueFlags, kArcValueFlags | kArcNoCache);\n      for (; !aiter.Done(); aiter.Next()) {\n        impl_->UpdateNumKnownStates(aiter.Value().nextstate);\n      }\n      impl_->SetExpandedState(u);\n      if (s_ < impl_->NumKnownStates()) return false;\n    }\n    return true;\n  }\n\n  StateId Value() const final { return s_; }\n\n  void Next() final { ++s_; }\n\n  void Reset() final { s_ = 0; }\n\n private:\n  const FST &fst_;\n  Impl *impl_;\n  StateId s_;\n};\n\n// Used to make an arc iterator for a CacheBaseImpl-derived FST, which must\n// have Arc and State types defined.\ntemplate <class FST>\nclass CacheArcIterator {\n public:\n  using Arc = typename FST::Arc;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using Store = typename FST::Store;\n  using State = typename Store::State;\n  using Impl = internal::CacheBaseImpl<State, Store>;\n\n  CacheArcIterator(Impl *impl, StateId s) : i_(0) {\n    state_ = impl->GetCacheStore()->GetMutableState(s);\n    state_->IncrRefCount();\n  }\n\n  ~CacheArcIterator() { state_->DecrRefCount(); }\n\n  bool Done() const { return i_ >= state_->NumArcs(); }\n\n  const Arc &Value() const { return state_->GetArc(i_); }\n\n  void Next() { ++i_; }\n\n  size_t Position() const { return i_; }\n\n  void Reset() { i_ = 0; }\n\n  void Seek(size_t a) { i_ = a; }\n\n  constexpr uint32_t Flags() const { return kArcValueFlags; }\n\n  void SetFlags(uint32_t flags, uint32_t mask) {}\n\n private:\n  const State *state_;\n  size_t i_;\n\n  CacheArcIterator(const CacheArcIterator &) = delete;\n  CacheArcIterator &operator=(const CacheArcIterator &) = delete;\n};\n\n// Use this to make a mutable arc iterator for a CacheBaseImpl-derived FST,\n// which must have types Arc and Store defined.\ntemplate <class FST>\nclass CacheMutableArcIterator\n    : public MutableArcIteratorBase<typename FST::Arc> {\n public:\n  using Arc = typename FST::Arc;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using Store = typename FST::Store;\n  using State = typename Store::State;\n  using Impl = internal::CacheBaseImpl<State, Store>;\n\n  // User must call MutateCheck() in the constructor.\n  CacheMutableArcIterator(Impl *impl, StateId s) : i_(0), s_(s), impl_(impl) {\n    state_ = impl_->GetCacheStore()->GetMutableState(s_);\n    state_->IncrRefCount();\n  }\n\n  ~CacheMutableArcIterator() override { state_->DecrRefCount(); }\n\n  bool Done() const final { return i_ >= state_->NumArcs(); }\n\n  const Arc &Value() const final { return state_->GetArc(i_); }\n\n  void Next() final { ++i_; }\n\n  size_t Position() const final { return i_; }\n\n  void Reset() final { i_ = 0; }\n\n  void Seek(size_t a) final { i_ = a; }\n\n  void SetValue(const Arc &arc) final { state_->SetArc(arc, i_); }\n\n  uint32_t Flags() const final { return kArcValueFlags; }\n\n  void SetFlags(uint32_t, uint32_t) final {}\n\n private:\n  size_t i_;\n  StateId s_;\n  Impl *impl_;\n  State *state_;\n\n  CacheMutableArcIterator(const CacheMutableArcIterator &) = delete;\n  CacheMutableArcIterator &operator=(const CacheMutableArcIterator &) = delete;\n};\n\n// Wrap existing CacheStore implementation to use with ExpanderFst.\ntemplate <class CacheStore>\nclass ExpanderCacheStore {\n public:\n  using State = typename CacheStore::State;\n  using Arc = typename CacheStore::Arc;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  explicit ExpanderCacheStore(const CacheOptions &opts = CacheOptions())\n      : store_(opts) {}\n\n  template <class Expander>\n  State *FindOrExpand(Expander &expander, StateId s) {  // NOLINT\n    auto *state = store_.GetMutableState(s);\n    if (state->Flags()) {\n      state->SetFlags(kCacheRecent, kCacheRecent);\n    } else {\n      StateBuilder builder(state);\n      expander.Expand(s, &builder);\n      state->SetFlags(kCacheFlags, kCacheFlags);\n      store_.SetArcs(state);\n    }\n    return state;\n  }\n\n private:\n  CacheStore store_;\n\n  struct StateBuilder {\n    State *state;\n\n    explicit StateBuilder(State *state_) : state(state_) {}\n\n    void AddArc(const Arc &arc) { state->PushArc(arc); }\n\n    void SetFinal(Weight weight) { state->SetFinal(std::move(weight)); }\n  };\n};\n\n}  // namespace fst\n\n#endif  // FST_CACHE_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/closure.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Functions and classes to compute the concatenative closure of an FST.\n\n#ifndef FST_CLOSURE_H_\n#define FST_CLOSURE_H_\n\n#include <algorithm>\n#include <vector>\n\n#include <fst/mutable-fst.h>\n#include <fst/rational.h>\n\n\nnamespace fst {\n\n// Computes the concatenative closure. This version modifies its\n// MutableFst input. If an FST transduces string x to y with weight a,\n// then its closure transduces x to y with weight a, xx to yy with\n// weight Times(a, a), xxx to yyy with with Times(Times(a, a), a),\n// etc. If closure_type == CLOSURE_STAR, then the empty string is\n// transduced to itself with weight Weight::One() as well.\n//\n// Complexity:\n//\n//   Time: O(V)\n//   Space: O(V)\n//\n// where V is the number of states.\ntemplate <class Arc>\nvoid Closure(MutableFst<Arc> *fst, ClosureType closure_type) {\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n  const auto props = fst->Properties(kFstProperties, false);\n  const auto start = fst->Start();\n  for (StateIterator<MutableFst<Arc>> siter(*fst); !siter.Done();\n       siter.Next()) {\n    const auto s = siter.Value();\n    const auto weight = fst->Final(s);\n    if (weight != Weight::Zero()) fst->AddArc(s, Arc(0, 0, weight, start));\n  }\n  if (closure_type == CLOSURE_STAR) {\n    fst->ReserveStates(fst->NumStates() + 1);\n    const auto nstart = fst->AddState();\n    fst->SetStart(nstart);\n    fst->SetFinal(nstart, Weight::One());\n    if (start != kNoLabel) fst->AddArc(nstart, Arc(0, 0, Weight::One(), start));\n  }\n  fst->SetProperties(ClosureProperties(props, closure_type == CLOSURE_STAR),\n                     kFstProperties);\n}\n\n// Computes the concatenative closure. This version modifies its\n// RationalFst input.\ntemplate <class Arc>\nvoid Closure(RationalFst<Arc> *fst, ClosureType closure_type) {\n  fst->GetMutableImpl()->AddClosure(closure_type);\n}\n\nstruct ClosureFstOptions : RationalFstOptions {\n  ClosureType type;\n\n  ClosureFstOptions(const RationalFstOptions &opts,\n                    ClosureType type = CLOSURE_STAR)\n      : RationalFstOptions(opts), type(type) {}\n\n  explicit ClosureFstOptions(ClosureType type = CLOSURE_STAR) : type(type) {}\n};\n\n// Computes the concatenative closure. This version is a delayed FST. If an FST\n// transduces string x to y with weight a, then its closure transduces x to y\n// with weight a, xx to yy with weight Times(a, a), xxx to yyy with weight\n// Times(Times(a, a), a), etc. If closure_type == CLOSURE_STAR, then the empty\n// string is transduced to itself with weight Weight::One() as well.\n//\n// Complexity:\n//\n//   Time: O(v)\n//   Space: O(v)\n//\n// where v is the number of states visited. Constant time and space to visit an\n// input state or arc is assumed and exclusive of caching.\ntemplate <class A>\nclass ClosureFst : public RationalFst<A> {\n public:\n  using Arc = A;\n\n  ClosureFst(const Fst<Arc> &fst, ClosureType closure_type) {\n    GetMutableImpl()->InitClosure(fst, closure_type);\n  }\n\n  ClosureFst(const Fst<Arc> &fst, const ClosureFstOptions &opts)\n      : RationalFst<A>(opts) {\n    GetMutableImpl()->InitClosure(fst, opts.type);\n  }\n\n  // See Fst<>::Copy() for doc.\n  ClosureFst(const ClosureFst<Arc> &fst, bool safe = false)\n      : RationalFst<A>(fst, safe) {}\n\n  // Gets a copy of this ClosureFst. See Fst<>::Copy() for further doc.\n  ClosureFst<A> *Copy(bool safe = false) const override {\n    return new ClosureFst<A>(*this, safe);\n  }\n\n private:\n  using ImplToFst<internal::RationalFstImpl<Arc>>::GetImpl;\n  using ImplToFst<internal::RationalFstImpl<Arc>>::GetMutableImpl;\n};\n\n// Specialization for ClosureFst.\ntemplate <class Arc>\nclass StateIterator<ClosureFst<Arc>> : public StateIterator<RationalFst<Arc>> {\n public:\n  explicit StateIterator(const ClosureFst<Arc> &fst)\n      : StateIterator<RationalFst<Arc>>(fst) {}\n};\n\n// Specialization for ClosureFst.\ntemplate <class Arc>\nclass ArcIterator<ClosureFst<Arc>> : public ArcIterator<RationalFst<Arc>> {\n public:\n  using StateId = typename Arc::StateId;\n\n  ArcIterator(const ClosureFst<Arc> &fst, StateId s)\n      : ArcIterator<RationalFst<Arc>>(fst, s) {}\n};\n\n// Useful alias when using StdArc.\nusing StdClosureFst = ClosureFst<StdArc>;\n\n}  // namespace fst\n\n#endif  // FST_CLOSURE_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/collection.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Class to store a collection of ordered (multi-)sets with elements of type T.\n\n#ifndef FST_EXTENSIONS_PDT_COLLECTION_H_\n#define FST_EXTENSIONS_PDT_COLLECTION_H_\n\n#include <functional>\n#include <vector>\n\n#include <fst/log.h>\n#include <fst/bi-table.h>\n\nnamespace fst {\n\n// Stores a collection of non-empty, ordered (multi-)sets with elements of type\n// T. A default constructor, operator==, and an STL-style hash functor must be\n// defined on the elements. Provides signed integer ID (of type I) for each\n// unique set. The IDs are allocated starting from 0 in order.\ntemplate <class I, class T>\nclass Collection {\n public:\n  struct Node {  // Trie node.\n    I node_id;   // Root is kNoNodeId;\n    T element;\n\n    Node() : node_id(kNoNodeId), element(T()) {}\n\n    Node(I i, const T &t) : node_id(i), element(t) {}\n\n    bool operator==(const Node &n) const {\n      return n.node_id == node_id && n.element == element;\n    }\n  };\n\n  struct NodeHash {\n    size_t operator()(const Node &n) const {\n      static constexpr auto kPrime = 7853;\n      return n.node_id + hash_(n.element) * kPrime;\n    }\n  };\n\n  using NodeTable = CompactHashBiTable<I, Node, NodeHash>;\n\n  class SetIterator {\n   public:\n    SetIterator(I id, Node node, NodeTable *node_table)\n        : id_(id), node_(node), node_table_(node_table) {}\n\n    bool Done() const { return id_ == kNoNodeId; }\n\n    const T &Element() const { return node_.element; }\n\n    void Next() {\n      id_ = node_.node_id;\n      if (id_ != kNoNodeId) node_ = node_table_->FindEntry(id_);\n    }\n\n   private:\n    I id_;       // Iterator set node ID.\n    Node node_;  // Iterator set node.\n    NodeTable *node_table_;\n  };\n\n  Collection() {}\n\n  // Looks up integer ID from ordered multi-se, and if it doesn't exist and\n  // insert is true, then adds it. Otherwise returns -1.\n  I FindId(const std::vector<T> &set, bool insert = true) {\n    I node_id = kNoNodeId;\n    for (std::ptrdiff_t i = set.size() - 1; i >= 0; --i) {\n      Node node(node_id, set[i]);\n      node_id = node_table_.FindId(node, insert);\n      if (node_id == -1) break;\n    }\n    return node_id;\n  }\n\n  // Finds ordered (multi-)set given integer ID. Returns set iterator to\n  // traverse result.\n  SetIterator FindSet(I id) {\n    if (id < 0 || id >= node_table_.Size()) {\n      return SetIterator(kNoNodeId, Node(kNoNodeId, T()), &node_table_);\n    } else {\n      return SetIterator(id, node_table_.FindEntry(id), &node_table_);\n    }\n  }\n\n  I Size() const { return node_table_.Size(); }\n\n private:\n  static constexpr I kNoNodeId = -1;\n  static const std::hash<T> hash_;\n\n  NodeTable node_table_;\n};\n\ntemplate <class I, class T>\nconstexpr I Collection<I, T>::kNoNodeId;\n\ntemplate <class I, class T>\nconst std::hash<T> Collection<I, T>::hash_ = {};\n\n}  // namespace fst\n\n#endif  // FST_EXTENSIONS_PDT_COLLECTION_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/compact-fst.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// FST Class for memory-efficient representation of common types of\n// FSTs: linear automata, acceptors, unweighted FSTs, ...\n\n#ifndef FST_COMPACT_FST_H_\n#define FST_COMPACT_FST_H_\n\n#include <climits>\n#include <iterator>\n#include <memory>\n#include <tuple>\n#include <utility>\n#include <vector>\n\n#include <fst/log.h>\n\n#include <fst/cache.h>\n#include <fst/expanded-fst.h>\n#include <fst/fst-decl.h>  // For optional argument declarations\n#include <fst/mapped-file.h>\n#include <fst/matcher.h>\n#include <fst/test-properties.h>\n#include <fst/util.h>\n\n\nnamespace fst {\n\nstruct CompactFstOptions : public CacheOptions {\n  // The default caching behaviour is to do no caching. Most compactors are\n  // cheap and therefore we save memory by not doing caching.\n  CompactFstOptions() : CacheOptions(true, 0) {}\n\n  explicit CompactFstOptions(const CacheOptions &opts) : CacheOptions(opts) {}\n};\n\n// New upcoming (Fst) Compactor interface - currently used internally\n// by CompactFstImpl.\n//\n// class Compactor {\n//  public:\n//   // Constructor from the Fst to be compacted.\n//   Compactor(const Fst<Arc> &fst, ...);\n//   // Copy constructor\n//   Compactor(const Compactor &compactor, bool safe = false)\n//   // Default constructor (optional, see comment below).\n//   Compactor();\n//\n//   // Returns the start state, number of states, and total number of arcs\n//   // of the compacted Fst\n//   StateId Start() const;\n//   StateId NumStates() const;\n//   size_t NumArcs() const;\n//\n//   // Accessor class for state attributes.\n//   class State {\n//    public:\n//     State();  // Required, corresponds to kNoStateId.\n//     State(const Compactor *c, StateId);  // Accessor for StateId 's'.\n//     StateId GetStateId() const;\n//     Weight Final() const;\n//     size_t NumArcs() const;\n//     Arc GetArc(size_t i) const;\n//   };\n//\n//   // Modifies 'state' accessor to provide access to state id 's'.\n//   void SetState(StateId s, State *state);\n//   // Tests whether 'fst' can be compacted by this compactor.\n//   bool IsCompatible(const Fst<A> &fst) const;\n//   // Return the properties that are always true for an fst\n//   // compacted using this compactor\n//   uint64_t Properties() const;\n//   // Return a string identifying the type of compactor.\n//   static const string &Type();\n//   // Return true if an error has occured.\n//   bool Error() const;\n//   // Writes a compactor to a file.\n//   bool Write(std::ostream &strm, const FstWriteOptions &opts) const;\n//   // Reads a compactor from a file.\n//   static Compactor*Read(std::istream &strm, const FstReadOptions &opts,\n//                         const FstHeader &hdr);\n// };\n//\n\n// Old (Arc) Compactor Interface:\n//\n// The ArcCompactor class determines how arcs and final weights are compacted\n// and expanded.\n//\n// Final weights are treated as transitions to the superfinal state, i.e.,\n// ilabel = olabel = kNoLabel and nextstate = kNoStateId.\n//\n// There are two types of compactors:\n//\n// * Fixed out-degree compactors: 'compactor.Size()' returns a positive integer\n//   's'. An FST can be compacted by this compactor only if each state has\n//   exactly 's' outgoing transitions (counting a non-Zero() final weight as a\n//   transition). A typical example is a compactor for string FSTs, i.e.,\n//   's == 1'.\n//\n// * Variable out-degree compactors: 'compactor.Size() == -1'. There are no\n//   out-degree restrictions for these compactors.\n//\n// Interface:\n//\n// class ArcCompactor {\n//  public:\n//   // Element is the type of the compacted transitions.\n//   using Element = ...\n//\n//   // Returns the compacted representation of a transition 'arc'\n//   // at a state 's'.\n//   Element Compact(StateId s, const Arc &arc);\n//\n//   // Returns the transition at state 's' represented by the compacted\n//   // transition 'e'.\n//   Arc Expand(StateId s, const Element &e) const;\n//\n//   // Returns -1 for variable out-degree compactors, and the mandatory\n//   // out-degree otherwise.\n//   std::ptrdiff_t Size() const;\n//\n//   // Tests whether an FST can be compacted by this compactor.\n//   bool Compatible(const Fst<A> &fst) const;\n//\n//   // Returns the properties that are always true for an FST compacted using\n//   // this compactor\n//   uint64_t Properties() const;\n//\n//   // Returns a string identifying the type of compactor.\n//   static const string &Type();\n//\n//   // Writes a compactor to a file.\n//   bool Write(std::ostream &strm) const;\n//\n//   // Reads a compactor from a file.\n//   static ArcCompactor *Read(std::istream &strm);\n//\n//   // Default constructor (optional, see comment below).\n//   ArcCompactor();\n// };\n//\n// The default constructor is only required for FST_REGISTER to work (i.e.,\n// enabling Convert() and the command-line utilities to work with this new\n// compactor). However, a default constructor always needs to be specified for\n// this code to compile, but one can have it simply raise an error when called,\n// like so:\n//\n// Compactor::Compactor() {\n//   FSTERROR() << \"Compactor: No default constructor\";\n// }\n\n// Default implementation data for CompactFst, which can shared between\n// otherwise independent copies.\n//\n// The implementation contains two arrays: 'states_' and 'compacts_'.\n//\n// For fixed out-degree compactors, the 'states_' array is unallocated. The\n// 'compacts_' contains the compacted transitions. Its size is 'ncompacts_'.\n// The outgoing transitions at a given state are stored consecutively. For a\n// given state 's', its 'compactor.Size()' outgoing transitions (including\n// superfinal transition when 's' is final), are stored in position\n// ['s*compactor.Size()', '(s+1)*compactor.Size()').\n//\n// For variable out-degree compactors, the states_ array has size\n// 'nstates_ + 1' and contains pointers to positions into 'compacts_'. For a\n// given state 's', the compacted transitions of 's' are stored in positions\n// ['states_[s]', 'states_[s + 1]') in 'compacts_'. By convention,\n// 'states_[nstates_] == ncompacts_'.\n//\n// In both cases, the superfinal transitions (when 's' is final, i.e.,\n// 'Final(s) != Weight::Zero()') are stored first.\n//\n// The unsigned type U is used to represent indices into the compacts_ array.\ntemplate <class Element, class Unsigned>\nclass DefaultCompactStore {\n public:\n  DefaultCompactStore()\n      : states_(nullptr),\n        compacts_(nullptr),\n        nstates_(0),\n        ncompacts_(0),\n        narcs_(0),\n        start_(kNoStateId),\n        error_(false) {}\n\n  template <class Arc, class Compactor>\n  DefaultCompactStore(const Fst<Arc> &fst, const Compactor &compactor);\n\n  template <class Iterator, class Compactor>\n  DefaultCompactStore(const Iterator &begin, const Iterator &end,\n                      const Compactor &compactor);\n\n  ~DefaultCompactStore() {\n    if (!states_region_) delete[] states_;\n    if (!compacts_region_) delete[] compacts_;\n  }\n\n  template <class Compactor>\n  static DefaultCompactStore<Element, Unsigned> *Read(\n      std::istream &strm, const FstReadOptions &opts, const FstHeader &hdr,\n      const Compactor &compactor);\n\n  bool Write(std::ostream &strm, const FstWriteOptions &opts) const;\n\n  Unsigned States(std::ptrdiff_t i) const { return states_[i]; }\n\n  const Element &Compacts(size_t i) const { return compacts_[i]; }\n\n  size_t NumStates() const { return nstates_; }\n\n  size_t NumCompacts() const { return ncompacts_; }\n\n  size_t NumArcs() const { return narcs_; }\n\n  std::ptrdiff_t Start() const { return start_; }\n\n  bool Error() const { return error_; }\n\n  // Returns a string identifying the type of data storage container.\n  static const string &Type();\n\n private:\n  std::unique_ptr<MappedFile> states_region_;\n  std::unique_ptr<MappedFile> compacts_region_;\n  Unsigned *states_;\n  Element *compacts_;\n  size_t nstates_;\n  size_t ncompacts_;\n  size_t narcs_;\n  std::ptrdiff_t start_;\n  bool error_;\n};\n\ntemplate <class Element, class Unsigned>\ntemplate <class Arc, class Compactor>\nDefaultCompactStore<Element, Unsigned>::DefaultCompactStore(\n    const Fst<Arc> &fst, const Compactor &compactor)\n    : states_(nullptr),\n      compacts_(nullptr),\n      nstates_(0),\n      ncompacts_(0),\n      narcs_(0),\n      start_(kNoStateId),\n      error_(false) {\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n  start_ = fst.Start();\n  // Counts # of states and arcs.\n  StateId nfinals = 0;\n  for (StateIterator<Fst<Arc>> siter(fst); !siter.Done(); siter.Next()) {\n    ++nstates_;\n    const auto s = siter.Value();\n    for (ArcIterator<Fst<Arc>> aiter(fst, s); !aiter.Done(); aiter.Next()) {\n      ++narcs_;\n    }\n    if (fst.Final(s) != Weight::Zero()) ++nfinals;\n  }\n  if (compactor.Size() == -1) {\n    states_ = new Unsigned[nstates_ + 1];\n    ncompacts_ = narcs_ + nfinals;\n    compacts_ = new Element[ncompacts_];\n    states_[nstates_] = ncompacts_;\n  } else {\n    states_ = nullptr;\n    ncompacts_ = nstates_ * compactor.Size();\n    if ((narcs_ + nfinals) != ncompacts_) {\n      FSTERROR() << \"DefaultCompactStore: Compactor incompatible with FST\";\n      error_ = true;\n      return;\n    }\n    compacts_ = new Element[ncompacts_];\n  }\n  size_t pos = 0;\n  size_t fpos = 0;\n  for (size_t s = 0; s < nstates_; ++s) {\n    fpos = pos;\n    if (compactor.Size() == -1) states_[s] = pos;\n    if (fst.Final(s) != Weight::Zero()) {\n      compacts_[pos++] = compactor.Compact(\n          s, Arc(kNoLabel, kNoLabel, fst.Final(s), kNoStateId));\n    }\n    for (ArcIterator<Fst<Arc>> aiter(fst, s); !aiter.Done(); aiter.Next()) {\n      compacts_[pos++] = compactor.Compact(s, aiter.Value());\n    }\n    if ((compactor.Size() != -1) && ((pos - fpos) != compactor.Size())) {\n      FSTERROR() << \"DefaultCompactStore: Compactor incompatible with FST\";\n      error_ = true;\n      return;\n    }\n  }\n  if (pos != ncompacts_) {\n    FSTERROR() << \"DefaultCompactStore: Compactor incompatible with FST\";\n    error_ = true;\n    return;\n  }\n}\n\ntemplate <class Element, class Unsigned>\ntemplate <class Iterator, class Compactor>\nDefaultCompactStore<Element, Unsigned>::DefaultCompactStore(\n    const Iterator &begin, const Iterator &end, const Compactor &compactor)\n    : states_(nullptr),\n      compacts_(nullptr),\n      nstates_(0),\n      ncompacts_(0),\n      narcs_(0),\n      start_(kNoStateId),\n      error_(false) {\n  using Arc = typename Compactor::Arc;\n  using Weight = typename Arc::Weight;\n  if (compactor.Size() != -1) {\n    ncompacts_ = std::distance(begin, end);\n    if (compactor.Size() == 1) {\n      // For strings, allows implicit final weight. Empty input is the empty\n      // string.\n      if (ncompacts_ == 0) {\n        ++ncompacts_;\n      } else {\n        const auto arc =\n            compactor.Expand(ncompacts_ - 1, *(begin + (ncompacts_ - 1)));\n        if (arc.ilabel != kNoLabel) ++ncompacts_;\n      }\n    }\n    if (ncompacts_ % compactor.Size()) {\n      FSTERROR() << \"DefaultCompactStore: Size of input container incompatible\"\n                 << \" with compactor\";\n      error_ = true;\n      return;\n    }\n    if (ncompacts_ == 0) return;\n    start_ = 0;\n    nstates_ = ncompacts_ / compactor.Size();\n    compacts_ = new Element[ncompacts_];\n    size_t i = 0;\n    Iterator it = begin;\n    for (; it != end; ++it, ++i) {\n      compacts_[i] = *it;\n      if (compactor.Expand(i, *it).ilabel != kNoLabel) ++narcs_;\n    }\n    if (i < ncompacts_) {\n      compacts_[i] = compactor.Compact(\n          i, Arc(kNoLabel, kNoLabel, Weight::One(), kNoStateId));\n    }\n  } else {\n    if (std::distance(begin, end) == 0) return;\n    // Count # of states, arcs and compacts.\n    auto it = begin;\n    for (size_t i = 0; it != end; ++it, ++i) {\n      const auto arc = compactor.Expand(i, *it);\n      if (arc.ilabel != kNoLabel) {\n        ++narcs_;\n        ++ncompacts_;\n      } else {\n        ++nstates_;\n        if (arc.weight != Weight::Zero()) ++ncompacts_;\n      }\n    }\n    start_ = 0;\n    compacts_ = new Element[ncompacts_];\n    states_ = new Unsigned[nstates_ + 1];\n    states_[nstates_] = ncompacts_;\n    size_t i = 0;\n    size_t s = 0;\n    for (it = begin; it != end; ++it) {\n      const auto arc = compactor.Expand(i, *it);\n      if (arc.ilabel != kNoLabel) {\n        compacts_[i++] = *it;\n      } else {\n        states_[s++] = i;\n        if (arc.weight != Weight::Zero()) compacts_[i++] = *it;\n      }\n    }\n    if ((s != nstates_) || (i != ncompacts_)) {\n      FSTERROR() << \"DefaultCompactStore: Ill-formed input container\";\n      error_ = true;\n      return;\n    }\n  }\n}\n\ntemplate <class Element, class Unsigned>\ntemplate <class Compactor>\nDefaultCompactStore<Element, Unsigned>\n    *DefaultCompactStore<Element, Unsigned>::Read(std::istream &strm,\n                                                  const FstReadOptions &opts,\n                                                  const FstHeader &hdr,\n                                                  const Compactor &compactor) {\n  std::unique_ptr<DefaultCompactStore<Element, Unsigned>> data(\n      new DefaultCompactStore<Element, Unsigned>());\n  data->start_ = hdr.Start();\n  data->nstates_ = hdr.NumStates();\n  data->narcs_ = hdr.NumArcs();\n  if (compactor.Size() == -1) {\n    if ((hdr.GetFlags() & FstHeader::IS_ALIGNED) && !AlignInput(strm)) {\n      LOG(ERROR) << \"DefaultCompactStore::Read: Alignment failed: \"\n                 << opts.source;\n      return nullptr;\n    }\n    auto b = (data->nstates_ + 1) * sizeof(Unsigned);\n    data->states_region_.reset(MappedFile::Map(\n        &strm, opts.mode == FstReadOptions::MAP, opts.source, b));\n    if (!strm || !data->states_region_) {\n      LOG(ERROR) << \"DefaultCompactStore::Read: Read failed: \" << opts.source;\n      return nullptr;\n    }\n    data->states_ =\n        static_cast<Unsigned *>(data->states_region_->mutable_data());\n  } else {\n    data->states_ = nullptr;\n  }\n  data->ncompacts_ = compactor.Size() == -1 ? data->states_[data->nstates_]\n                                            : data->nstates_ * compactor.Size();\n  if ((hdr.GetFlags() & FstHeader::IS_ALIGNED) && !AlignInput(strm)) {\n    LOG(ERROR) << \"DefaultCompactStore::Read: Alignment failed: \"\n               << opts.source;\n    return nullptr;\n  }\n  size_t b = data->ncompacts_ * sizeof(Element);\n  data->compacts_region_.reset(\n      MappedFile::Map(&strm, opts.mode == FstReadOptions::MAP, opts.source, b));\n  if (!strm || !data->compacts_region_) {\n    LOG(ERROR) << \"DefaultCompactStore::Read: Read failed: \" << opts.source;\n    return nullptr;\n  }\n  data->compacts_ =\n      static_cast<Element *>(data->compacts_region_->mutable_data());\n  return data.release();\n}\n\ntemplate <class Element, class Unsigned>\nbool DefaultCompactStore<Element, Unsigned>::Write(\n    std::ostream &strm, const FstWriteOptions &opts) const {\n  if (states_) {\n    if (opts.align && !AlignOutput(strm)) {\n      LOG(ERROR) << \"DefaultCompactStore::Write: Alignment failed: \"\n                 << opts.source;\n      return false;\n    }\n    strm.write(reinterpret_cast<char *>(states_),\n               (nstates_ + 1) * sizeof(Unsigned));\n  }\n  if (opts.align && !AlignOutput(strm)) {\n    LOG(ERROR) << \"DefaultCompactStore::Write: Alignment failed: \"\n               << opts.source;\n    return false;\n  }\n  strm.write(reinterpret_cast<char *>(compacts_), ncompacts_ * sizeof(Element));\n  strm.flush();\n  if (!strm) {\n    LOG(ERROR) << \"DefaultCompactStore::Write: Write failed: \" << opts.source;\n    return false;\n  }\n  return true;\n}\n\ntemplate <class Element, class Unsigned>\nconst string &DefaultCompactStore<Element, Unsigned>::Type() {\n  static const string *const type = new string(\"compact\");\n  return *type;\n}\n\ntemplate <class C, class U, class S> class DefaultCompactState;\n\n// Wraps an arc compactor and a compact store as a new Fst compactor.\ntemplate <class C, class U,\n          class S = DefaultCompactStore<typename C::Element, U>>\nclass DefaultCompactor {\n public:\n  using ArcCompactor = C;\n  using Unsigned = U;\n  using CompactStore = S;\n  using Element = typename C::Element;\n  using Arc = typename C::Arc;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n  using State = DefaultCompactState<C, U, S>;\n  friend State;\n\n  DefaultCompactor()\n      : arc_compactor_(nullptr), compact_store_(nullptr) {}\n\n  // Constructs from Fst.\n  DefaultCompactor(const Fst<Arc> &fst,\n                   std::shared_ptr<ArcCompactor> arc_compactor)\n      : arc_compactor_(std::move(arc_compactor)),\n        compact_store_(std::make_shared<S>(fst, *arc_compactor_)) {}\n\n  DefaultCompactor(const Fst<Arc> &fst,\n                   std::shared_ptr<DefaultCompactor<C, U, S>> compactor)\n      : arc_compactor_(compactor->arc_compactor_),\n        compact_store_(compactor->compact_store_ == nullptr ?\n                       std::make_shared<S>(fst, *arc_compactor_) :\n                       compactor->compact_store_) {}\n\n  // Constructs from CompactStore.\n  DefaultCompactor(std::shared_ptr<ArcCompactor> arc_compactor,\n                   std::shared_ptr<CompactStore> compact_store)\n      : arc_compactor_(std::move(arc_compactor)),\n        compact_store_(std::move(compact_store)) {}\n\n  // Constructs from set of compact elements (when arc_compactor.Size() != -1).\n  template <class Iterator>\n  DefaultCompactor(const Iterator &b, const Iterator &e,\n                   std::shared_ptr<C> arc_compactor)\n      : arc_compactor_(std::move(arc_compactor)),\n        compact_store_(std::make_shared<S>(b, e, *arc_compactor_)) {}\n\n  // Copy constructor.\n  DefaultCompactor(const DefaultCompactor<C, U, S> &compactor)\n      : arc_compactor_(std::make_shared<C>(*compactor.GetArcCompactor())),\n        compact_store_(compactor.SharedCompactStore()) {}\n\n  template <class OtherC>\n  explicit DefaultCompactor(const DefaultCompactor<OtherC, U, S> &compactor)\n      : arc_compactor_(std::make_shared<C>(*compactor.GetArcCompactor())),\n        compact_store_(compactor.SharedCompactStore()) {}\n\n  StateId Start() const { return compact_store_->Start(); }\n  StateId NumStates() const { return compact_store_->NumStates(); }\n  size_t NumArcs() const { return compact_store_->NumArcs(); }\n\n  void SetState(StateId s, State *state) const {\n    if (state->GetStateId() != s) state->Set(this, s);\n  }\n\n  static DefaultCompactor<C, U, S> *Read(std::istream &strm,\n                                         const FstReadOptions &opts,\n                                         const FstHeader &hdr) {\n    std::shared_ptr<C> arc_compactor(C::Read(strm));\n    if (arc_compactor == nullptr) return nullptr;\n    std::shared_ptr<S> compact_store(S::Read(strm, opts, hdr, *arc_compactor));\n    if (compact_store == nullptr) return nullptr;\n    return new DefaultCompactor<C, U, S>(arc_compactor, compact_store);\n  }\n\n  bool Write(std::ostream &strm, const FstWriteOptions &opts) const {\n    return arc_compactor_->Write(strm) && compact_store_->Write(strm, opts);\n  }\n\n  uint64_t Properties() const { return arc_compactor_->Properties(); }\n\n  bool IsCompatible(const Fst<Arc> &fst) const {\n    return arc_compactor_->Compatible(fst);\n  }\n\n  bool Error() const { return compact_store_->Error(); }\n\n  bool HasFixedOutdegree() const { return arc_compactor_->Size() != -1; }\n\n  static const string &Type() {\n    static const string *const type = [] {\n      string type = \"compact\";\n      if (sizeof(U) != sizeof(uint32_t)) type += std::to_string(8 * sizeof(U));\n      type += \"_\";\n      type += C::Type();\n      if (CompactStore::Type() != \"compact\") {\n        type += \"_\";\n        type += CompactStore::Type();\n      }\n      return new string(type);\n    }();\n    return *type;\n  }\n\n  const ArcCompactor *GetArcCompactor() const { return arc_compactor_.get(); }\n  CompactStore *GetCompactStore() const { return compact_store_.get(); }\n\n  std::shared_ptr<ArcCompactor> SharedArcCompactor() const {\n    return arc_compactor_;\n  }\n\n  std::shared_ptr<CompactStore> SharedCompactStore() const {\n    return compact_store_;\n  }\n\n  // TODO(allauzen): remove dependencies on this method and make private.\n  Arc ComputeArc(StateId s, Unsigned i, uint32_t f) const {\n    return arc_compactor_->Expand(s, compact_store_->Compacts(i), f);\n  }\n\n private:\n  std::pair<Unsigned, Unsigned> CompactsRange(StateId s) const {\n    std::pair<size_t, size_t> range;\n    if (HasFixedOutdegree()) {\n      range.first = s * arc_compactor_->Size();\n      range.second = arc_compactor_->Size();\n    } else {\n      range.first = compact_store_->States(s);\n      range.second = compact_store_->States(s + 1) - range.first;\n    }\n    return range;\n  }\n\n private:\n  std::shared_ptr<ArcCompactor> arc_compactor_;\n  std::shared_ptr<CompactStore> compact_store_;\n};\n\n// Default implementation of state attributes accessor class for\n// DefaultCompactor. Use of efficient specialization strongly encouraged.\ntemplate <class C, class U, class S>\nclass DefaultCompactState {\n public:\n  using Arc = typename C::Arc;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  DefaultCompactState() = default;\n\n  DefaultCompactState(const DefaultCompactor<C, U, S> *compactor, StateId s)\n      : compactor_(compactor),\n        s_(s),\n        range_(compactor->CompactsRange(s)),\n        has_final_(\n            range_.second != 0 &&\n            compactor->ComputeArc(s, range_.first,\n                                 kArcILabelValue).ilabel == kNoLabel) {\n    if (has_final_) {\n      ++range_.first;\n      --range_.second;\n    }\n  }\n\n  void Set(const DefaultCompactor<C, U, S> *compactor, StateId s) {\n    compactor_ = compactor;\n    s_ = s;\n    range_ = compactor->CompactsRange(s);\n    if (range_.second != 0 &&\n        compactor->ComputeArc(s, range_.first, kArcILabelValue).ilabel\n        == kNoLabel) {\n      has_final_ = true;\n      ++range_.first;\n      --range_.second;\n    } else {\n      has_final_ = false;\n    }\n  }\n\n  StateId GetStateId() const { return s_; }\n\n  Weight Final() const {\n    if (!has_final_) return Weight::Zero();\n    return compactor_->ComputeArc(s_, range_.first - 1, kArcWeightValue).weight;\n  }\n\n  size_t NumArcs() const { return range_.second; }\n\n  Arc GetArc(size_t i, uint32_t f) const {\n    return compactor_->ComputeArc(s_, range_.first + i, f);\n  }\n\n private:\n  const DefaultCompactor<C, U, S> *compactor_ = nullptr;  // borrowed ref.\n  StateId s_ = kNoStateId;\n  std::pair<U, U> range_ = {0, 0};\n  bool has_final_ = false;\n};\n\n// Specialization for DefaultCompactStore.\ntemplate <class C, class U>\nclass DefaultCompactState<C, U, DefaultCompactStore<typename C::Element, U>> {\n public:\n  using Arc = typename C::Arc;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n  using CompactStore = DefaultCompactStore<typename C::Element, U>;\n\n  DefaultCompactState() = default;\n\n  DefaultCompactState(\n      const DefaultCompactor<C, U, CompactStore> *compactor, StateId s)\n      : arc_compactor_(compactor->GetArcCompactor()), s_(s) {\n    Init(compactor);\n  }\n\n  void Set(const DefaultCompactor<C, U, CompactStore> *compactor, StateId s) {\n    arc_compactor_ = compactor->GetArcCompactor();\n    s_ = s;\n    has_final_ = false;\n    Init(compactor);\n  }\n\n  StateId GetStateId() const { return s_; }\n\n  Weight Final() const {\n    if (!has_final_) return Weight::Zero();\n    return arc_compactor_->Expand(s_, *(compacts_ - 1), kArcWeightValue).weight;\n  }\n\n  size_t NumArcs() const { return num_arcs_; }\n\n  Arc GetArc(size_t i, uint32_t f) const {\n    return arc_compactor_->Expand(s_, compacts_[i], f);\n  }\n\n private:\n  void Init(const DefaultCompactor<C, U, CompactStore> *compactor) {\n    const auto *store = compactor->GetCompactStore();\n    U offset;\n    if (!compactor->HasFixedOutdegree()) {  // Variable out-degree compactor.\n      offset = store->States(s_);\n      num_arcs_ = store->States(s_ + 1) - offset;\n    } else {  // Fixed out-degree compactor.\n      offset = s_ * arc_compactor_->Size();\n      num_arcs_ = arc_compactor_->Size();\n    }\n    if (num_arcs_ > 0) {\n      compacts_ = &(store->Compacts(offset));\n      if (arc_compactor_->Expand(s_, *compacts_, kArcILabelValue).ilabel\n          == kNoStateId) {\n        ++compacts_;\n        --num_arcs_;\n        has_final_ = true;\n      }\n    }\n  }\n\n private:\n  const C *arc_compactor_ = nullptr;               // Borrowed reference.\n  const typename C::Element *compacts_ = nullptr;  // Borrowed reference.\n  StateId s_ = kNoStateId;\n  U num_arcs_ = 0;\n  bool has_final_ = false;\n};\n\ntemplate <class Arc, class ArcCompactor, class Unsigned, class CompactStore,\n          class CacheStore>\nclass CompactFst;\n\ntemplate <class F, class G>\nvoid Cast(const F &, G *);\n\nnamespace internal {\n\n// Implementation class for CompactFst, which contains parametrizeable\n// Fst data storage (DefaultCompactStore by default) and Fst cache.\ntemplate <class Arc, class C, class CacheStore = DefaultCacheStore<Arc>>\nclass CompactFstImpl\n    : public CacheBaseImpl<typename CacheStore::State, CacheStore> {\n public:\n  using Weight = typename Arc::Weight;\n  using StateId = typename Arc::StateId;\n  using Compactor = C;\n\n  using FstImpl<Arc>::SetType;\n  using FstImpl<Arc>::SetProperties;\n  using FstImpl<Arc>::Properties;\n  using FstImpl<Arc>::SetInputSymbols;\n  using FstImpl<Arc>::SetOutputSymbols;\n  using FstImpl<Arc>::WriteHeader;\n\n  using ImplBase = CacheBaseImpl<typename CacheStore::State, CacheStore>;\n  using ImplBase::PushArc;\n  using ImplBase::HasArcs;\n  using ImplBase::HasFinal;\n  using ImplBase::HasStart;\n  using ImplBase::SetArcs;\n  using ImplBase::SetFinal;\n  using ImplBase::SetStart;\n\n  CompactFstImpl()\n      : ImplBase(CompactFstOptions()),\n        compactor_() {\n    SetType(Compactor::Type());\n    SetProperties(kNullProperties | kStaticProperties);\n  }\n\n  CompactFstImpl(const Fst<Arc> &fst, std::shared_ptr<Compactor> compactor,\n                 const CompactFstOptions &opts)\n      : ImplBase(opts),\n        compactor_(std::make_shared<Compactor>(fst, compactor)) {\n    SetType(Compactor::Type());\n    SetInputSymbols(fst.InputSymbols());\n    SetOutputSymbols(fst.OutputSymbols());\n    if (compactor_->Error()) SetProperties(kError, kError);\n    uint64_t copy_properties = fst.Properties(kMutable, false) ?\n        fst.Properties(kCopyProperties, true):\n        CheckProperties(fst,\n                        kCopyProperties & ~kWeightedCycles & ~kUnweightedCycles,\n                        kCopyProperties);\n    if ((copy_properties & kError) || !compactor_->IsCompatible(fst)) {\n      FSTERROR() << \"CompactFstImpl: Input Fst incompatible with compactor\";\n      SetProperties(kError, kError);\n      return;\n    }\n    SetProperties(copy_properties | kStaticProperties);\n  }\n\n  CompactFstImpl(std::shared_ptr<Compactor> compactor,\n                 const CompactFstOptions &opts)\n      : ImplBase(opts),\n        compactor_(compactor) {\n    SetType(Compactor::Type());\n    SetProperties(kStaticProperties | compactor_->Properties());\n    if (compactor_->Error()) SetProperties(kError, kError);\n  }\n\n  CompactFstImpl(const CompactFstImpl<Arc, Compactor, CacheStore> &impl)\n      : ImplBase(impl),\n        compactor_(impl.compactor_ == nullptr ?\n                   std::make_shared<Compactor>() :\n                   std::make_shared<Compactor>(*impl.compactor_)) {\n    SetType(impl.Type());\n    SetProperties(impl.Properties());\n    SetInputSymbols(impl.InputSymbols());\n    SetOutputSymbols(impl.OutputSymbols());\n  }\n\n  // Allows to change the cache store from OtherI to I.\n  template <class OtherCacheStore>\n  CompactFstImpl(const CompactFstImpl<Arc, Compactor, OtherCacheStore> &impl)\n      : ImplBase(CacheOptions(impl.GetCacheGc(), impl.GetCacheLimit())),\n        compactor_(impl.compactor_ == nullptr ?\n                   std::make_shared<Compactor>() :\n                   std::make_shared<Compactor>(*impl.compactor_)) {\n    SetType(impl.Type());\n    SetProperties(impl.Properties());\n    SetInputSymbols(impl.InputSymbols());\n    SetOutputSymbols(impl.OutputSymbols());\n  }\n\n  StateId Start() {\n    if (!HasStart()) SetStart(compactor_->Start());\n    return ImplBase::Start();\n  }\n\n  Weight Final(StateId s) {\n    if (HasFinal(s)) return ImplBase::Final(s);\n    compactor_->SetState(s, &state_);\n    return state_.Final();\n  }\n\n  StateId NumStates() const {\n    if (Properties(kError)) return 0;\n    return compactor_->NumStates();\n  }\n\n  size_t NumArcs(StateId s) {\n    if (HasArcs(s)) return ImplBase::NumArcs(s);\n    compactor_->SetState(s, &state_);\n    return state_.NumArcs();\n  }\n\n  size_t NumInputEpsilons(StateId s) {\n    if (!HasArcs(s) && !Properties(kILabelSorted)) Expand(s);\n    if (HasArcs(s)) return ImplBase::NumInputEpsilons(s);\n    return CountEpsilons(s, false);\n  }\n\n  size_t NumOutputEpsilons(StateId s) {\n    if (!HasArcs(s) && !Properties(kOLabelSorted)) Expand(s);\n    if (HasArcs(s)) return ImplBase::NumOutputEpsilons(s);\n    return CountEpsilons(s, true);\n  }\n\n  size_t CountEpsilons(StateId s, bool output_epsilons) {\n    compactor_->SetState(s, &state_);\n    const uint32_t f = output_epsilons ? kArcOLabelValue : kArcILabelValue;\n    size_t num_eps = 0;\n    for (size_t i = 0; i < state_.NumArcs(); ++i) {\n      const auto& arc = state_.GetArc(i, f);\n      const auto label = output_epsilons ? arc.olabel : arc.ilabel;\n      if (label == 0)\n        ++num_eps;\n      else if (label > 0)\n        break;\n    }\n    return num_eps;\n  }\n\n  static CompactFstImpl<Arc, Compactor, CacheStore> *Read(\n      std::istream &strm, const FstReadOptions &opts) {\n    std::unique_ptr<CompactFstImpl<Arc, Compactor, CacheStore>> impl(\n      new CompactFstImpl<Arc, Compactor, CacheStore>());\n    FstHeader hdr;\n    if (!impl->ReadHeader(strm, opts, kMinFileVersion, &hdr)) {\n      return nullptr;\n    }\n    // Ensures compatibility.\n    if (hdr.Version() == kAlignedFileVersion) {\n      hdr.SetFlags(hdr.GetFlags() | FstHeader::IS_ALIGNED);\n    }\n    impl->compactor_ = std::shared_ptr<Compactor>(\n        Compactor::Read(strm, opts, hdr));\n    if (!impl->compactor_) {\n      return nullptr;\n    }\n    return impl.release();\n  }\n\n  bool Write(std::ostream &strm, const FstWriteOptions &opts) const {\n    FstHeader hdr;\n    hdr.SetStart(compactor_->Start());\n    hdr.SetNumStates(compactor_->NumStates());\n    hdr.SetNumArcs(compactor_->NumArcs());\n    // Ensures compatibility.\n    const auto file_version = opts.align ? kAlignedFileVersion : kFileVersion;\n    WriteHeader(strm, opts, file_version, &hdr);\n    return compactor_->Write(strm, opts);\n  }\n\n  // Provides information needed for generic state iterator.\n  void InitStateIterator(StateIteratorData<Arc> *data) const {\n    data->base = nullptr;\n    data->nstates = compactor_->NumStates();\n  }\n\n  void InitArcIterator(StateId s, ArcIteratorData<Arc> *data) {\n    if (!HasArcs(s)) Expand(s);\n    ImplBase::InitArcIterator(s, data);\n  }\n\n  void Expand(StateId s) {\n    compactor_->SetState(s, &state_);\n    for (size_t i = 0; i < state_.NumArcs(); ++i)\n      PushArc(s, state_.GetArc(i, kArcValueFlags));\n    SetArcs(s);\n    if (!HasFinal(s)) SetFinal(s, state_.Final());\n  }\n\n  const Compactor *GetCompactor() const { return compactor_.get(); }\n  std::shared_ptr<Compactor> SharedCompactor() const { return compactor_; }\n  void SetCompactor(std::shared_ptr<Compactor> compactor) {\n    // TODO(allauzen): is this correct? is this needed?\n    // TODO(allauzen): consider removing and forcing this through direct calls\n    // to compactor.\n    compactor_ = compactor;\n  }\n\n  // Properties always true of this FST class.\n  static constexpr uint64_t kStaticProperties = kExpanded;\n\n protected:\n  template <class OtherArc, class OtherCompactor, class OtherCacheStore>\n  explicit CompactFstImpl(\n    const CompactFstImpl<OtherArc, OtherCompactor, OtherCacheStore> &impl)\n    : compactor_(std::make_shared<Compactor>(*impl.GetCompactor())) {\n    SetType(impl.Type());\n    SetProperties(impl.Properties());\n    SetInputSymbols(impl.InputSymbols());\n    SetOutputSymbols(impl.OutputSymbols());\n  }\n\n private:\n  // Allows access during write.\n  template <class AnyArc, class ArcCompactor, class Unsigned,\n            class CompactStore, class AnyCacheStore>\n  friend class ::fst::CompactFst;  // allow access during write.\n\n  // Current unaligned file format version.\n  static constexpr int kFileVersion = 2;\n  // Current aligned file format version.\n  static constexpr int kAlignedFileVersion = 1;\n  // Minimum file format version supported.\n  static constexpr int kMinFileVersion = 1;\n\n  std::shared_ptr<Compactor> compactor_;\n  typename Compactor::State state_;\n};\n\ntemplate <class Arc, class Compactor, class CacheStore>\nconstexpr uint64_t CompactFstImpl<Arc, Compactor, CacheStore>::kStaticProperties;\n\ntemplate <class Arc, class Compactor, class CacheStore>\nconstexpr int CompactFstImpl<Arc, Compactor, CacheStore>::kFileVersion;\n\ntemplate <class Arc, class Compactor, class CacheStore>\nconstexpr int CompactFstImpl<Arc, Compactor, CacheStore>::kAlignedFileVersion;\n\ntemplate <class Arc, class Compactor, class CacheStore>\nconstexpr int CompactFstImpl<Arc, Compactor, CacheStore>::kMinFileVersion;\n\n}  // namespace internal\n\n// This class attaches interface to implementation and handles reference\n// counting, delegating most methods to ImplToExpandedFst. The Unsigned type\n// is used to represent indices into the compact arc array. (Template\n// argument defaults are declared in fst-decl.h.)\ntemplate <class A, class ArcCompactor, class Unsigned, class CompactStore,\n          class CacheStore>\nclass CompactFst\n    : public ImplToExpandedFst<internal::CompactFstImpl<\n          A,\n          DefaultCompactor<ArcCompactor, Unsigned, CompactStore>,\n          CacheStore>> {\n public:\n  template <class F, class G>\n  void friend Cast(const F &, G *);\n\n  using Arc = A;\n  using StateId = typename A::StateId;\n  using Compactor = DefaultCompactor<ArcCompactor, Unsigned, CompactStore>;\n  using Impl = internal::CompactFstImpl<A, Compactor, CacheStore>;\n  using Store = CacheStore;  // for CacheArcIterator\n\n  friend class StateIterator<\n      CompactFst<A, ArcCompactor, Unsigned, CompactStore, CacheStore>>;\n  friend class ArcIterator<\n      CompactFst<A, ArcCompactor, Unsigned, CompactStore, CacheStore>>;\n\n  CompactFst() : ImplToExpandedFst<Impl>(std::make_shared<Impl>()) {}\n\n  // If data is not nullptr, it is assumed to be already initialized.\n  explicit CompactFst(\n      const Fst<A> &fst,\n      const ArcCompactor &compactor = ArcCompactor(),\n      const CompactFstOptions &opts = CompactFstOptions(),\n      std::shared_ptr<CompactStore> data = std::shared_ptr<CompactStore>())\n      : ImplToExpandedFst<Impl>(\n            std::make_shared<Impl>(\n                fst,\n                std::make_shared<Compactor>(\n                    std::make_shared<ArcCompactor>(compactor), data),\n                opts)) {}\n\n  // If data is not nullptr, it is assumed to be already initialized.\n  CompactFst(\n      const Fst<Arc> &fst,\n      std::shared_ptr<ArcCompactor> compactor,\n      const CompactFstOptions &opts = CompactFstOptions(),\n      std::shared_ptr<CompactStore> data = std::shared_ptr<CompactStore>())\n      : ImplToExpandedFst<Impl>(\n            std::make_shared<Impl>(fst,\n                                   std::make_shared<Compactor>(compactor, data),\n                                   opts)) {}\n\n  // The following 2 constructors take as input two iterators delimiting a set\n  // of (already) compacted transitions, starting with the transitions out of\n  // the initial state. The format of the input differs for fixed out-degree\n  // and variable out-degree compactors.\n  //\n  // - For fixed out-degree compactors, the final weight (encoded as a\n  // compacted transition) needs to be given only for final states. All strings\n  // (compactor of size 1) will be assume to be terminated by a final state\n  // even when the final state is not implicitely given.\n  //\n  // - For variable out-degree compactors, the final weight (encoded as a\n  // compacted transition) needs to be given for all states and must appeared\n  // first in the list (for state s, final weight of s, followed by outgoing\n  // transitons in s).\n  //\n  // These 2 constructors allows the direct construction of a CompactFst\n  // without first creating a more memory-hungry regular FST. This is useful\n  // when memory usage is severely constrained.\n  template <class Iterator>\n  explicit CompactFst(const Iterator &begin, const Iterator &end,\n                      const ArcCompactor &compactor = ArcCompactor(),\n                      const CompactFstOptions &opts = CompactFstOptions())\n      : ImplToExpandedFst<Impl>(\n            std::make_shared<Impl>(\n                std::make_shared<Compactor>(\n                    begin, end, std::make_shared<ArcCompactor>(compactor)),\n                opts)) {}\n\n  template <class Iterator>\n  CompactFst(const Iterator &begin, const Iterator &end,\n             std::shared_ptr<ArcCompactor> compactor,\n             const CompactFstOptions &opts = CompactFstOptions())\n      : ImplToExpandedFst<Impl>(\n            std::make_shared<Impl>(\n                std::make_shared<Compactor>(begin, end, compactor), opts)) {}\n\n  // See Fst<>::Copy() for doc.\n  CompactFst(\n      const CompactFst<A, ArcCompactor, Unsigned, CompactStore, CacheStore>\n      &fst,\n      bool safe = false)\n      : ImplToExpandedFst<Impl>(fst, safe) {}\n\n  // Get a copy of this CompactFst. See Fst<>::Copy() for further doc.\n  CompactFst<A, ArcCompactor, Unsigned, CompactStore, CacheStore> *Copy(\n      bool safe = false) const override {\n    return new CompactFst<A, ArcCompactor, Unsigned, CompactStore, CacheStore>(\n        *this, safe);\n  }\n\n  // Read a CompactFst from an input stream; return nullptr on error\n  static CompactFst<A, ArcCompactor, Unsigned, CompactStore, CacheStore> *Read(\n      std::istream &strm, const FstReadOptions &opts) {\n    auto *impl = Impl::Read(strm, opts);\n    return impl ? new CompactFst<A, ArcCompactor, Unsigned, CompactStore,\n                                 CacheStore>(std::shared_ptr<Impl>(impl))\n                : nullptr;\n  }\n\n  // Read a CompactFst from a file; return nullptr on error\n  // Empty filename reads from standard input\n  static CompactFst<A, ArcCompactor, Unsigned, CompactStore, CacheStore> *Read(\n      const string &filename) {\n    auto *impl = ImplToExpandedFst<Impl>::Read(filename);\n    return impl ? new CompactFst<A, ArcCompactor, Unsigned, CompactStore,\n                                 CacheStore>(std::shared_ptr<Impl>(impl))\n                : nullptr;\n  }\n\n  bool Write(std::ostream &strm, const FstWriteOptions &opts) const override {\n    return GetImpl()->Write(strm, opts);\n  }\n\n  bool Write(const string &filename) const override {\n    return Fst<Arc>::WriteFile(filename);\n  }\n\n  template <class FST>\n  static bool WriteFst(const FST &fst, const ArcCompactor &compactor,\n                       std::ostream &strm, const FstWriteOptions &opts);\n\n  void InitStateIterator(StateIteratorData<Arc> *data) const override {\n    GetImpl()->InitStateIterator(data);\n  }\n\n  void InitArcIterator(StateId s, ArcIteratorData<Arc> *data) const override {\n    GetMutableImpl()->InitArcIterator(s, data);\n  }\n\n  MatcherBase<Arc> *InitMatcher(MatchType match_type) const override {\n    return new SortedMatcher<\n        CompactFst<A, ArcCompactor, Unsigned, CompactStore, CacheStore>>(\n        *this, match_type);\n  }\n\n  template <class Iterator>\n  void SetCompactElements(const Iterator &b, const Iterator &e) {\n    GetMutableImpl()->SetCompactor(std::make_shared<Compactor>(\n        b, e, std::make_shared<ArcCompactor>()));\n  }\n\n private:\n  using ImplToFst<Impl, ExpandedFst<Arc>>::GetImpl;\n  using ImplToFst<Impl, ExpandedFst<Arc>>::GetMutableImpl;\n\n  explicit CompactFst(std::shared_ptr<Impl> impl)\n      : ImplToExpandedFst<Impl>(impl) {}\n\n  // Use overloading to extract the type of the argument.\n  static Impl *GetImplIfCompactFst(\n      const CompactFst<A, ArcCompactor, Unsigned, CompactStore, CacheStore>\n          &compact_fst) {\n    return compact_fst.GetImpl();\n  }\n\n  // This does not give privileged treatment to subclasses of CompactFst.\n  template <typename NonCompactFst>\n  static Impl *GetImplIfCompactFst(const NonCompactFst &fst) {\n    return nullptr;\n  }\n\n  CompactFst &operator=(const CompactFst &fst) = delete;\n};\n\n// Writes FST in Compact format, with a possible pass over the machine before\n// writing to compute the number of states and arcs.\ntemplate <class A, class ArcCompactor, class Unsigned, class CompactStore,\n          class CacheStore>\ntemplate <class FST>\nbool CompactFst<A, ArcCompactor, Unsigned, CompactStore, CacheStore>::WriteFst(\n    const FST &fst, const ArcCompactor &compactor, std::ostream &strm,\n    const FstWriteOptions &opts) {\n  using Arc = A;\n  using Weight = typename A::Weight;\n  using Element = typename ArcCompactor::Element;\n  const auto file_version =\n      opts.align ? Impl::kAlignedFileVersion : Impl::kFileVersion;\n  size_t num_arcs = -1;\n  size_t num_states = -1;\n  auto first_pass_compactor = compactor;\n  if (auto *impl = GetImplIfCompactFst(fst)) {\n    num_arcs = impl->GetCompactor()->GetCompactStore()->NumArcs();\n    num_states = impl->GetCompactor()->GetCompactStore()->NumStates();\n    first_pass_compactor = *impl->GetCompactor()->GetArcCompactor();\n  } else {\n    // A first pass is needed to compute the state of the compactor, which\n    // is saved ahead of the rest of the data structures. This unfortunately\n    // means forcing a complete double compaction when writing in this format.\n    // TODO(allauzen): eliminate mutable state from compactors.\n    num_arcs = 0;\n    num_states = 0;\n    for (StateIterator<FST> siter(fst); !siter.Done(); siter.Next()) {\n      const auto s = siter.Value();\n      ++num_states;\n      if (fst.Final(s) != Weight::Zero()) {\n        first_pass_compactor.Compact(\n            s, Arc(kNoLabel, kNoLabel, fst.Final(s), kNoStateId));\n      }\n      for (ArcIterator<FST> aiter(fst, s); !aiter.Done(); aiter.Next()) {\n        ++num_arcs;\n        first_pass_compactor.Compact(s, aiter.Value());\n      }\n    }\n  }\n  FstHeader hdr;\n  hdr.SetStart(fst.Start());\n  hdr.SetNumStates(num_states);\n  hdr.SetNumArcs(num_arcs);\n  string type = \"compact\";\n  if (sizeof(Unsigned) != sizeof(uint32_t)) {\n    type += std::to_string(CHAR_BIT * sizeof(Unsigned));\n  }\n  type += \"_\";\n  type += ArcCompactor::Type();\n  if (CompactStore::Type() != \"compact\") {\n    type += \"_\";\n    type += CompactStore::Type();\n  }\n  const auto copy_properties = fst.Properties(kCopyProperties, true);\n  if ((copy_properties & kError) || !compactor.Compatible(fst)) {\n    FSTERROR() << \"Fst incompatible with compactor\";\n    return false;\n  }\n  uint64_t properties = copy_properties | Impl::kStaticProperties;\n  internal::FstImpl<Arc>::WriteFstHeader(fst, strm, opts, file_version, type,\n                                         properties, &hdr);\n  first_pass_compactor.Write(strm);\n  if (first_pass_compactor.Size() == -1) {\n    if (opts.align && !AlignOutput(strm)) {\n      LOG(ERROR) << \"CompactFst::Write: Alignment failed: \" << opts.source;\n      return false;\n    }\n    Unsigned compacts = 0;\n    for (StateIterator<FST> siter(fst); !siter.Done(); siter.Next()) {\n      const auto s = siter.Value();\n      strm.write(reinterpret_cast<const char *>(&compacts), sizeof(compacts));\n      if (fst.Final(s) != Weight::Zero()) {\n        ++compacts;\n      }\n      compacts += fst.NumArcs(s);\n    }\n    strm.write(reinterpret_cast<const char *>(&compacts), sizeof(compacts));\n  }\n  if (opts.align && !AlignOutput(strm)) {\n    LOG(ERROR) << \"Could not align file during write after writing states\";\n  }\n  const auto &second_pass_compactor = compactor;\n  Element element;\n  for (StateIterator<FST> siter(fst); !siter.Done(); siter.Next()) {\n    const auto s = siter.Value();\n    if (fst.Final(s) != Weight::Zero()) {\n      element = second_pass_compactor.Compact(\n          s, A(kNoLabel, kNoLabel, fst.Final(s), kNoStateId));\n      strm.write(reinterpret_cast<const char *>(&element), sizeof(element));\n    }\n    for (ArcIterator<FST> aiter(fst, s); !aiter.Done(); aiter.Next()) {\n      element = second_pass_compactor.Compact(s, aiter.Value());\n      strm.write(reinterpret_cast<const char *>(&element), sizeof(element));\n    }\n  }\n  strm.flush();\n  if (!strm) {\n    LOG(ERROR) << \"CompactFst write failed: \" << opts.source;\n    return false;\n  }\n  return true;\n}\n\n// Specialization for CompactFst; see generic version in fst.h for sample\n// usage (but use the CompactFst type!). This version should inline.\ntemplate <class Arc, class ArcCompactor, class Unsigned, class CompactStore,\n          class CacheStore>\nclass StateIterator<\n    CompactFst<Arc, ArcCompactor, Unsigned, CompactStore, CacheStore>> {\n public:\n  using StateId = typename Arc::StateId;\n\n  explicit StateIterator(\n      const CompactFst<Arc, ArcCompactor, Unsigned, CompactStore,\n                       CacheStore> &fst)\n      : nstates_(fst.GetImpl()->NumStates()), s_(0) {}\n\n  bool Done() const { return s_ >= nstates_; }\n\n  StateId Value() const { return s_; }\n\n  void Next() { ++s_; }\n\n  void Reset() { s_ = 0; }\n\n private:\n  StateId nstates_;\n  StateId s_;\n};\n\n// Specialization for CompactFst. Never caches,\n// always iterates over the underlying compact elements.\ntemplate <class Arc, class ArcCompactor, class Unsigned,\n          class CompactStore, class CacheStore>\nclass ArcIterator<CompactFst<\n    Arc, ArcCompactor, Unsigned, CompactStore, CacheStore>> {\n public:\n  using StateId = typename Arc::StateId;\n  using Element = typename ArcCompactor::Element;\n  using Compactor = DefaultCompactor<ArcCompactor, Unsigned, CompactStore>;\n  using State = typename Compactor::State;\n\n  ArcIterator(const CompactFst<Arc, ArcCompactor, Unsigned, CompactStore,\n                               CacheStore> &fst,\n              StateId s)\n      : state_(fst.GetImpl()->GetCompactor(), s),\n        pos_(0),\n        flags_(kArcValueFlags) {}\n\n  bool Done() const { return pos_ >= state_.NumArcs(); }\n\n  const Arc &Value() const {\n    arc_ = state_.GetArc(pos_, flags_);\n    return arc_;\n  }\n\n  void Next() { ++pos_; }\n\n  size_t Position() const { return pos_; }\n\n  void Reset() { pos_ = 0; }\n\n  void Seek(size_t pos) { pos_ = pos; }\n\n  uint32_t Flags() const { return flags_; }\n\n  void SetFlags(uint32_t f, uint32_t m) {\n    flags_ &= ~m;\n    flags_ |= (f & kArcValueFlags);\n  }\n\n private:\n  State state_;\n  size_t pos_;\n  mutable Arc arc_;\n  uint32_t flags_;\n};\n\n// ArcCompactor for unweighted string FSTs.\ntemplate <class A>\nclass StringCompactor {\n public:\n  using Arc = A;\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using Element = Label;\n\n  Element Compact(StateId s, const Arc &arc) const { return arc.ilabel; }\n\n  Arc Expand(StateId s, const Element &p, uint32_t f = kArcValueFlags) const {\n    return Arc(p, p, Weight::One(), p != kNoLabel ? s + 1 : kNoStateId);\n  }\n\n  constexpr std::ptrdiff_t Size() const { return 1; }\n\n  constexpr uint64_t Properties() const {\n    return kString | kAcceptor | kUnweighted;\n  }\n\n  bool Compatible(const Fst<Arc> &fst) const {\n    const auto props = Properties();\n    return fst.Properties(props, true) == props;\n  }\n\n  static const string &Type() {\n    static const string *const type = new string(\"string\");\n    return *type;\n  }\n\n  bool Write(std::ostream &strm) const { return true; }\n\n  static StringCompactor *Read(std::istream &strm) {\n    return new StringCompactor;\n  }\n};\n\n// ArcCompactor for weighted string FSTs.\ntemplate <class A>\nclass WeightedStringCompactor {\n public:\n  using Arc = A;\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using Element = std::pair<Label, Weight>;\n\n  Element Compact(StateId s, const Arc &arc) const {\n    return std::make_pair(arc.ilabel, arc.weight);\n  }\n\n  Arc Expand(StateId s, const Element &p, uint32_t f = kArcValueFlags) const {\n    return Arc(p.first, p.first, p.second,\n               p.first != kNoLabel ? s + 1 : kNoStateId);\n  }\n\n  constexpr std::ptrdiff_t Size() const { return 1; }\n\n  constexpr uint64_t Properties() const { return kString | kAcceptor; }\n\n  bool Compatible(const Fst<Arc> &fst) const {\n    const auto props = Properties();\n    return fst.Properties(props, true) == props;\n  }\n\n  static const string &Type() {\n    static const string *const type = new string(\"weighted_string\");\n    return *type;\n  }\n\n  bool Write(std::ostream &strm) const { return true; }\n\n  static WeightedStringCompactor *Read(std::istream &strm) {\n    return new WeightedStringCompactor;\n  }\n};\n\n// ArcCompactor for unweighted acceptor FSTs.\ntemplate <class A>\nclass UnweightedAcceptorCompactor {\n public:\n  using Arc = A;\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using Element = std::pair<Label, StateId>;\n\n  Element Compact(StateId s, const Arc &arc) const {\n    return std::make_pair(arc.ilabel, arc.nextstate);\n  }\n\n  Arc Expand(StateId s, const Element &p, uint32_t f = kArcValueFlags) const {\n    return Arc(p.first, p.first, Weight::One(), p.second);\n  }\n\n  constexpr std::ptrdiff_t Size() const { return -1; }\n\n  constexpr uint64_t Properties() const { return kAcceptor | kUnweighted; }\n\n  bool Compatible(const Fst<Arc> &fst) const {\n    const auto props = Properties();\n    return fst.Properties(props, true) == props;\n  }\n\n  static const string &Type() {\n    static const string *const type = new string(\"unweighted_acceptor\");\n    return *type;\n  }\n\n  bool Write(std::ostream &strm) const { return true; }\n\n  static UnweightedAcceptorCompactor *Read(std::istream &istrm) {\n    return new UnweightedAcceptorCompactor;\n  }\n};\n\n// ArcCompactor for weighted acceptor FSTs.\ntemplate <class A>\nclass AcceptorCompactor {\n public:\n  using Arc = A;\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using Element = std::pair<std::pair<Label, Weight>, StateId>;\n\n  Element Compact(StateId s, const Arc &arc) const {\n    return std::make_pair(std::make_pair(arc.ilabel, arc.weight),\n                          arc.nextstate);\n  }\n\n  Arc Expand(StateId s, const Element &p, uint32_t f = kArcValueFlags) const {\n    return Arc(p.first.first, p.first.first, p.first.second, p.second);\n  }\n\n  constexpr std::ptrdiff_t Size() const { return -1; }\n\n  constexpr uint64_t Properties() const { return kAcceptor; }\n\n  bool Compatible(const Fst<Arc> &fst) const {\n    const auto props = Properties();\n    return fst.Properties(props, true) == props;\n  }\n\n  static const string &Type() {\n    static const string *const type = new string(\"acceptor\");\n    return *type;\n  }\n\n  bool Write(std::ostream &strm) const { return true; }\n\n  static AcceptorCompactor *Read(std::istream &strm) {\n    return new AcceptorCompactor;\n  }\n};\n\n// ArcCompactor for unweighted FSTs.\ntemplate <class A>\nclass UnweightedCompactor {\n public:\n  using Arc = A;\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using Element = std::pair<std::pair<Label, Label>, StateId>;\n\n  Element Compact(StateId s, const Arc &arc) const {\n    return std::make_pair(std::make_pair(arc.ilabel, arc.olabel),\n                          arc.nextstate);\n  }\n\n  Arc Expand(StateId s, const Element &p, uint32_t f = kArcValueFlags) const {\n    return Arc(p.first.first, p.first.second, Weight::One(), p.second);\n  }\n\n  constexpr std::ptrdiff_t Size() const { return -1; }\n\n  constexpr uint64_t Properties() const { return kUnweighted; }\n\n  bool Compatible(const Fst<Arc> &fst) const {\n    const auto props = Properties();\n    return fst.Properties(props, true) == props;\n  }\n\n  static const string &Type() {\n    static const string *const type = new string(\"unweighted\");\n    return *type;\n  }\n\n  bool Write(std::ostream &strm) const { return true; }\n\n  static UnweightedCompactor *Read(std::istream &strm) {\n    return new UnweightedCompactor;\n  }\n};\n\ntemplate <class Arc, class Unsigned /* = uint32_t */>\nusing CompactStringFst = CompactFst<Arc, StringCompactor<Arc>, Unsigned>;\n\ntemplate <class Arc, class Unsigned /* = uint32_t */>\nusing CompactWeightedStringFst =\n    CompactFst<Arc, WeightedStringCompactor<Arc>, Unsigned>;\n\ntemplate <class Arc, class Unsigned /* = uint32_t */>\nusing CompactAcceptorFst = CompactFst<Arc, AcceptorCompactor<Arc>, Unsigned>;\n\ntemplate <class Arc, class Unsigned /* = uint32_t */>\nusing CompactUnweightedFst =\n    CompactFst<Arc, UnweightedCompactor<Arc>, Unsigned>;\n\ntemplate <class Arc, class Unsigned /* = uint32_t */>\nusing CompactUnweightedAcceptorFst =\n    CompactFst<Arc, UnweightedAcceptorCompactor<Arc>, Unsigned>;\n\nusing StdCompactStringFst = CompactStringFst<StdArc, uint32_t>;\n\nusing StdCompactWeightedStringFst = CompactWeightedStringFst<StdArc, uint32_t>;\n\nusing StdCompactAcceptorFst = CompactAcceptorFst<StdArc, uint32_t>;\n\nusing StdCompactUnweightedFst = CompactUnweightedFst<StdArc, uint32_t>;\n\nusing StdCompactUnweightedAcceptorFst =\n    CompactUnweightedAcceptorFst<StdArc, uint32_t>;\n\n}  // namespace fst\n\n#endif  // FST_COMPACT_FST_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/compat.h",
    "content": "// Licensed under the Apache License, Version 2.0 (the \"License\");\n// you may not use this file except in compliance with the License.\n// You may obtain a copy of the License at\n//\n//      http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n// See the License for the specific language governing permissions and\n// limitations under the License.\n//\n// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#ifndef FST_LIB_COMPAT_H_\n#define FST_LIB_COMPAT_H_\n\n#include <climits>\n#include <cstdlib>\n#include <cstring>\n#include <iostream>\n#include <string>\n#include <vector>\n\n// Makes copy constructor and operator= private\n// Deprecated: now just use =delete.\n#define DISALLOW_COPY_AND_ASSIGN(type)    \\\n  type(const type&);                      \\\n  void operator=(const type&)\n\n#if defined(__GNUC__) || defined(__clang__)\n#define OPENFST_DEPRECATED(message) __attribute__((deprecated(message)))\n#elif defined(_MSC_VER)\n#define OPENFST_DEPRECATED(message) __declspec(deprecated(message))\n#else\n#define OPENFST_DEPRECATED(message)\n#endif\n\n#include <fst/config.h>\n#include <fst/types.h>\n#include <fst/lock.h>\n#include <fst/flags.h>\n#include <fst/log.h>\n#include <fst/icu.h>\n\nusing std::string;\n\nvoid FailedNewHandler();\n\n#ifdef _MSC_VER\n#include <intrin.h>\nconst char* basename(const char* path);\n#define __builtin_popcount __popcnt\n\n#ifdef _M_X64\n// Using 64-bit MSVC intrinsics.\n#define __builtin_popcountll __popcnt64\ninline unsigned int __builtin_ctzll(std::uint64_t w) {\n  unsigned long v;\n  return _BitScanForward64(&v, std::uint32_t(w)) ? v : 0;\n}\n#else\n// Using 32-bit MSVC intrinsics.\ninline unsigned int __builtin_popcountll(std::uint64_t w) {\n  return __popcnt(std::uint32_t(w)) + __popcnt(std::uint32_t(w >> 32));\n}\ninline unsigned int __builtin_ctzll(std::uint64_t w) {\n  unsigned long v;\n  return (_BitScanForward(&v, std::uint32_t(w)) ? v :\n          _BitScanForward(&v, std::uint32_t(w >> 32)) ? v + 32 : 0);\n}\n#endif  // _M_X64\n#endif  // _MSC_VER\n\nnamespace fst {\n\n// Downcasting.\ntemplate<typename To, typename From>\ninline To down_cast(From* f) { return static_cast<To>(f); }\n\n// Bitcasting.\ntemplate <class Dest, class Source>\ninline Dest bit_cast(const Source &source) {\n  static_assert(sizeof(Dest) == sizeof(Source),\n                \"Bitcasting unsafe for specified types\");\n  Dest dest;\n  memcpy(&dest, &source, sizeof(dest));\n  return dest;\n}\n\n// Check sums\nclass CheckSummer {\n public:\n  CheckSummer() : count_(0) {\n    check_sum_.resize(kCheckSumLength, '\\0');\n  }\n\n  void Reset() {\n    count_ = 0;\n    for (int i = 0; i < kCheckSumLength; ++i) check_sum_[i] = '\\0';\n  }\n\n  void Update(void const *data, int size) {\n    const char *p = reinterpret_cast<const char *>(data);\n    for (int i = 0; i < size; ++i) {\n      check_sum_[(count_++) % kCheckSumLength] ^= p[i];\n    }\n  }\n\n  void Update(string const &data) {\n    for (int i = 0; i < data.size(); ++i) {\n      check_sum_[(count_++) % kCheckSumLength] ^= data[i];\n    }\n  }\n\n  string Digest() { return check_sum_; }\n\n private:\n  static const int kCheckSumLength = 32;\n  int count_;\n  string check_sum_;\n\n  CheckSummer(const CheckSummer &) = delete;\n  CheckSummer &operator=(const CheckSummer &) = delete;\n};\n\n}  // namespace fst\n\n#endif  // FST_LIB_COMPAT_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/complement.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Class to complement an FST.\n\n#ifndef FST_COMPLEMENT_H_\n#define FST_COMPLEMENT_H_\n\n#include <algorithm>\n#include <string>\n#include <vector>\n#include <fst/log.h>\n\n#include <fst/fst.h>\n#include <fst/test-properties.h>\n\n\nnamespace fst {\n\ntemplate <class Arc>\nclass ComplementFst;\n\nnamespace internal {\n\n// Implementation of delayed ComplementFst. The algorithm used completes the\n// (deterministic) FSA and then exchanges final and non-final states.\n// Completion, i.e. ensuring that all labels can be read from every state, is\n// accomplished by using ρ-labels, which match all labels that are otherwise\n// not found leaving a state. The first state in the output is reserved to be a\n// new state that is the destination of all ρ-labels. Each remaining output\n// state s corresponds to input state s - 1. The first arc in the output at\n// these states is the ρ-label, the remaining arcs correspond to the input\n// arcs.\ntemplate <class A>\nclass ComplementFstImpl : public FstImpl<A> {\n public:\n  using Arc = A;\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using FstImpl<A>::SetType;\n  using FstImpl<A>::SetProperties;\n  using FstImpl<A>::SetInputSymbols;\n  using FstImpl<A>::SetOutputSymbols;\n\n  friend class StateIterator<ComplementFst<Arc>>;\n  friend class ArcIterator<ComplementFst<Arc>>;\n\n  explicit ComplementFstImpl(const Fst<Arc> &fst) : fst_(fst.Copy()) {\n    SetType(\"complement\");\n    uint64_t props = fst.Properties(kILabelSorted, false);\n    SetProperties(ComplementProperties(props), kCopyProperties);\n    SetInputSymbols(fst.InputSymbols());\n    SetOutputSymbols(fst.OutputSymbols());\n  }\n\n  ComplementFstImpl(const ComplementFstImpl<Arc> &impl)\n      : fst_(impl.fst_->Copy()) {\n    SetType(\"complement\");\n    SetProperties(impl.Properties(), kCopyProperties);\n    SetInputSymbols(impl.InputSymbols());\n    SetOutputSymbols(impl.OutputSymbols());\n  }\n\n  StateId Start() const {\n    if (Properties(kError)) return kNoStateId;\n    auto start = fst_->Start();\n    return start != kNoStateId ? start + 1 : 0;\n  }\n\n  // Exchange final and non-final states; makes ρ-destination state final.\n  Weight Final(StateId s) const {\n    if (s == 0 || fst_->Final(s - 1) == Weight::Zero()) {\n      return Weight::One();\n    } else {\n      return Weight::Zero();\n    }\n  }\n\n  size_t NumArcs(StateId s) const {\n    return s == 0 ? 1 : fst_->NumArcs(s - 1) + 1;\n  }\n\n  size_t NumInputEpsilons(StateId s) const {\n    return s == 0 ? 0 : fst_->NumInputEpsilons(s - 1);\n  }\n\n  size_t NumOutputEpsilons(StateId s) const {\n    return s == 0 ? 0 : fst_->NumOutputEpsilons(s - 1);\n  }\n\n  uint64_t Properties() const override { return Properties(kFstProperties); }\n\n  // Sets error if found, and returns other FST impl properties.\n  uint64_t Properties(uint64_t mask) const override {\n    if ((mask & kError) && fst_->Properties(kError, false)) {\n      SetProperties(kError, kError);\n    }\n    return FstImpl<Arc>::Properties(mask);\n  }\n\n private:\n  std::unique_ptr<const Fst<Arc>> fst_;\n};\n\n}  // namespace internal\n\n// Complements an automaton. This is a library-internal operation that\n// introduces a (negative) ρ-label; use Difference/DifferenceFst in user code,\n// which will not see this label. This version is a delayed FST.\n//\n// This class attaches interface to implementation and handles\n// reference counting, delegating most methods to ImplToFst.\ntemplate <class A>\nclass ComplementFst : public ImplToFst<internal::ComplementFstImpl<A>> {\n public:\n  using Arc = A;\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Impl = internal::ComplementFstImpl<Arc>;\n\n  friend class StateIterator<ComplementFst<Arc>>;\n  friend class ArcIterator<ComplementFst<Arc>>;\n\n  explicit ComplementFst(const Fst<Arc> &fst)\n      : ImplToFst<Impl>(std::make_shared<Impl>(fst)) {\n    static constexpr auto props =\n        kUnweighted | kNoEpsilons | kIDeterministic | kAcceptor;\n    if (fst.Properties(props, true) != props) {\n      FSTERROR() << \"ComplementFst: Argument not an unweighted \"\n                 << \"epsilon-free deterministic acceptor\";\n      GetImpl()->SetProperties(kError, kError);\n    }\n  }\n\n  // See Fst<>::Copy() for doc.\n  ComplementFst(const ComplementFst<Arc> &fst, bool safe = false)\n      : ImplToFst<Impl>(fst, safe) {}\n\n  // Gets a copy of this FST. See Fst<>::Copy() for further doc.\n  ComplementFst<Arc> *Copy(bool safe = false) const override {\n    return new ComplementFst<Arc>(*this, safe);\n  }\n\n  inline void InitStateIterator(StateIteratorData<Arc> *data) const override;\n\n  inline void InitArcIterator(StateId s,\n                              ArcIteratorData<Arc> *data) const override;\n\n  // Label that represents the ρ-transition; we use a negative value private to\n  // the library and which will preserve FST label sort order.\n  static const Label kRhoLabel = -2;\n\n private:\n  using ImplToFst<Impl>::GetImpl;\n\n  ComplementFst &operator=(const ComplementFst &) = delete;\n};\n\ntemplate <class Arc>\nconst typename Arc::Label ComplementFst<Arc>::kRhoLabel;\n\n// Specialization for ComplementFst.\ntemplate <class Arc>\nclass StateIterator<ComplementFst<Arc>> : public StateIteratorBase<Arc> {\n public:\n  using StateId = typename Arc::StateId;\n\n  explicit StateIterator(const ComplementFst<Arc> &fst)\n      : siter_(*fst.GetImpl()->fst_), s_(0) {}\n\n  bool Done() const final { return s_ > 0 && siter_.Done(); }\n\n  StateId Value() const final { return s_; }\n\n  void Next() final {\n    if (s_ != 0) siter_.Next();\n    ++s_;\n  }\n\n  void Reset() final {\n    siter_.Reset();\n    s_ = 0;\n  }\n\n private:\n  StateIterator<Fst<Arc>> siter_;\n  StateId s_;\n};\n\n// Specialization for ComplementFst.\ntemplate <class Arc>\nclass ArcIterator<ComplementFst<Arc>> : public ArcIteratorBase<Arc> {\n public:\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  ArcIterator(const ComplementFst<Arc> &fst, StateId s) : s_(s), pos_(0) {\n    if (s_ != 0) {\n      aiter_.reset(new ArcIterator<Fst<Arc>>(*fst.GetImpl()->fst_, s - 1));\n    }\n  }\n\n  bool Done() const final {\n    if (s_ != 0) {\n      return pos_ > 0 && aiter_->Done();\n    } else {\n      return pos_ > 0;\n    }\n  }\n\n  // Adds the ρ-label to the ρ destination state.\n  const Arc &Value() const final {\n    if (pos_ == 0) {\n      arc_.ilabel = arc_.olabel = ComplementFst<Arc>::kRhoLabel;\n      arc_.weight = Weight::One();\n      arc_.nextstate = 0;\n    } else {\n      arc_ = aiter_->Value();\n      ++arc_.nextstate;\n    }\n    return arc_;\n  }\n\n  void Next() final {\n    if (s_ != 0 && pos_ > 0) aiter_->Next();\n    ++pos_;\n  }\n\n  size_t Position() const final { return pos_; }\n\n  void Reset() final {\n    if (s_ != 0) aiter_->Reset();\n    pos_ = 0;\n  }\n\n  void Seek(size_t a) final {\n    if (s_ != 0) {\n      if (a == 0) {\n        aiter_->Reset();\n      } else {\n        aiter_->Seek(a - 1);\n      }\n    }\n    pos_ = a;\n  }\n\n  uint32_t Flags() const final { return kArcValueFlags; }\n\n  void SetFlags(uint32_t, uint32_t) final {}\n\n private:\n  std::unique_ptr<ArcIterator<Fst<Arc>>> aiter_;\n  StateId s_;\n  size_t pos_;\n  mutable Arc arc_;\n};\n\ntemplate <class Arc>\ninline void ComplementFst<Arc>::InitStateIterator(\n    StateIteratorData<Arc> *data) const {\n  data->base = new StateIterator<ComplementFst<Arc>>(*this);\n}\n\ntemplate <class Arc>\ninline void ComplementFst<Arc>::InitArcIterator(StateId s,\n    ArcIteratorData<Arc> *data) const {\n  data->base = new ArcIterator<ComplementFst<Arc>>(*this, s);\n}\n\n// Useful alias when using StdArc.\nusing StdComplementFst = ComplementFst<StdArc>;\n\n}  // namespace fst\n\n#endif  // FST_COMPLEMENT_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/compose (1).h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Compose an MPDT and an FST.\n\n#ifndef FST_EXTENSIONS_MPDT_COMPOSE_H_\n#define FST_EXTENSIONS_MPDT_COMPOSE_H_\n\n#include <list>\n\n#include <fst/extensions/mpdt/mpdt.h>\n#include <fst/extensions/pdt/compose.h>\n#include <fst/compose.h>\n\nnamespace fst {\n\ntemplate <class Filter>\nclass MPdtParenFilter {\n public:\n  using FST1 = typename Filter::FST1;\n  using FST2 = typename Filter::FST2;\n  using Arc = typename Filter::Arc;\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using Matcher1 = typename Filter::Matcher1;\n  using Matcher2 = typename Filter::Matcher2;\n\n  using StackId = StateId;\n  using ParenStack = internal::MPdtStack<StackId, Label>;\n  using FilterState1 = typename Filter::FilterState;\n  using FilterState2 = IntegerFilterState<StackId>;\n  using FilterState = PairFilterState<FilterState1, FilterState2>;\n\n  MPdtParenFilter(const FST1 &fst1, const FST2 &fst2,\n                  Matcher1 *matcher1 = nullptr, Matcher2 *matcher2 = nullptr,\n                  const std::vector<std::pair<Label, Label>> *parens = nullptr,\n                  const std::vector<Label> *assignments = nullptr,\n                  bool expand = false, bool keep_parens = true)\n      : filter_(fst1, fst2, matcher1, matcher2),\n        parens_(parens ? *parens : std::vector<std::pair<Label, Label>>()),\n        assignments_(assignments ? *assignments : std::vector<Label>()),\n        expand_(expand),\n        keep_parens_(keep_parens),\n        fs_(FilterState::NoState()),\n        stack_(parens_, assignments_),\n        paren_id_(-1) {\n    if (parens) {\n      for (const auto &pair : *parens) {\n        parens_.push_back(pair);\n        GetMatcher1()->AddOpenParen(pair.first);\n        GetMatcher2()->AddOpenParen(pair.first);\n        if (!expand_) {\n          GetMatcher1()->AddCloseParen(pair.second);\n          GetMatcher2()->AddCloseParen(pair.second);\n        }\n      }\n    }\n  }\n\n  MPdtParenFilter(const MPdtParenFilter &filter, bool safe = false)\n      : filter_(filter.filter_, safe),\n        parens_(filter.parens_),\n        expand_(filter.expand_),\n        keep_parens_(filter.keep_parens_),\n        fs_(FilterState::NoState()),\n        stack_(filter.parens_, filter.assignments_),\n        paren_id_(-1) {}\n\n  FilterState Start() const {\n    return FilterState(filter_.Start(), FilterState2(0));\n  }\n\n  void SetState(StateId s1, StateId s2, const FilterState &fs) {\n    fs_ = fs;\n    filter_.SetState(s1, s2, fs_.GetState1());\n    if (!expand_) return;\n    const auto paren_id = stack_.Top(fs.GetState2().GetState());\n    if (paren_id != paren_id_) {\n      if (paren_id_ != -1) {\n        GetMatcher1()->RemoveCloseParen(parens_[paren_id_].second);\n        GetMatcher2()->RemoveCloseParen(parens_[paren_id_].second);\n      }\n      paren_id_ = paren_id;\n      if (paren_id_ != -1) {\n        GetMatcher1()->AddCloseParen(parens_[paren_id_].second);\n        GetMatcher2()->AddCloseParen(parens_[paren_id_].second);\n      }\n    }\n  }\n\n  FilterState FilterArc(Arc *arc1, Arc *arc2) const {\n    const auto fs1 = filter_.FilterArc(arc1, arc2);\n    const auto &fs2 = fs_.GetState2();\n    if (fs1 == FilterState1::NoState()) return FilterState::NoState();\n    if (arc1->olabel == kNoLabel && arc2->ilabel) {  // arc2 parentheses.\n      if (keep_parens_) {\n        arc1->ilabel = arc2->ilabel;\n      } else if (arc2->ilabel) {\n        arc2->olabel = arc1->ilabel;\n      }\n      return FilterParen(arc2->ilabel, fs1, fs2);\n    } else if (arc2->ilabel == kNoLabel && arc1->olabel) {  // arc1 parentheses\n      if (keep_parens_) {\n        arc2->olabel = arc1->olabel;\n      } else {\n        arc1->ilabel = arc2->olabel;\n      }\n      return FilterParen(arc1->olabel, fs1, fs2);\n    } else {\n      return FilterState(fs1, fs2);\n    }\n  }\n\n  void FilterFinal(Weight *w1, Weight *w2) const {\n    if (fs_.GetState2().GetState() != 0) *w1 = Weight::Zero();\n    filter_.FilterFinal(w1, w2);\n  }\n\n  // Returns respective matchers; ownership stays with filter.\n\n  Matcher1 *GetMatcher1() { return filter_.GetMatcher1(); }\n\n  Matcher2 *GetMatcher2() { return filter_.GetMatcher2(); }\n\n  uint64 Properties(uint64 iprops) const {\n    const auto oprops = filter_.Properties(iprops);\n    return oprops & kILabelInvariantProperties & kOLabelInvariantProperties;\n  }\n\n private:\n  const FilterState FilterParen(Label label, const FilterState1 &fs1,\n                                const FilterState2 &fs2) const {\n    if (!expand_) return FilterState(fs1, fs2);\n    const auto stack_id = stack_.Find(fs2.GetState(), label);\n    if (stack_id < 0) {\n      return FilterState::NoState();\n    } else {\n      return FilterState(fs1, FilterState2(stack_id));\n    }\n  }\n\n  Filter filter_;\n  std::vector<std::pair<Label, Label>> parens_;\n  std::vector<Label> assignments_;\n  bool expand_;       // Expands to FST?\n  bool keep_parens_;  // Retains parentheses in output?\n  FilterState fs_;    // Current filter state.\n  mutable ParenStack stack_;\n  std::ptrdiff_t paren_id_;\n};\n\n// Class to setup composition options for MPDT composition. Default is to take\n// the MPDT as the first composition argument.\ntemplate <class Arc, bool left_pdt = true>\nclass MPdtComposeFstOptions\n    : public ComposeFstOptions<Arc, ParenMatcher<Fst<Arc>>,\n                               MPdtParenFilter<AltSequenceComposeFilter<\n                                   ParenMatcher<Fst<Arc>> >> > {\n public:\n  using Label = typename Arc::Label;\n  using MPdtMatcher = ParenMatcher<Fst<Arc>>;\n  using MPdtFilter = MPdtParenFilter<AltSequenceComposeFilter<MPdtMatcher>>;\n\n  using ComposeFstOptions<Arc, MPdtMatcher, MPdtFilter>::matcher1;\n  using ComposeFstOptions<Arc, MPdtMatcher, MPdtFilter>::matcher2;\n  using ComposeFstOptions<Arc, MPdtMatcher, MPdtFilter>::filter;\n\n  MPdtComposeFstOptions(const Fst<Arc> &ifst1,\n                        const std::vector<std::pair<Label, Label>> &parens,\n                        const std::vector<typename Arc::Label> &assignments,\n                        const Fst<Arc> &ifst2, bool expand = false,\n                        bool keep_parens = true) {\n    matcher1 = new MPdtMatcher(ifst1, MATCH_OUTPUT, kParenList);\n    matcher2 = new MPdtMatcher(ifst2, MATCH_INPUT, kParenLoop);\n    filter = new MPdtFilter(ifst1, ifst2, matcher1, matcher2, &parens,\n                            &assignments, expand, keep_parens);\n  }\n};\n\n// Class to setup composition options for PDT with FST composition.\n// Specialization is for the FST as the first composition argument.\ntemplate <class Arc>\nclass MPdtComposeFstOptions<Arc, false>\n    : public ComposeFstOptions<\n          Arc, ParenMatcher<Fst<Arc>>,\n          MPdtParenFilter<SequenceComposeFilter<ParenMatcher<Fst<Arc>> >> > {\n public:\n  using Label = typename Arc::Label;\n  using MPdtMatcher = ParenMatcher<Fst<Arc>>;\n  using MPdtFilter = MPdtParenFilter<SequenceComposeFilter<MPdtMatcher>>;\n\n  using ComposeFstOptions<Arc, MPdtMatcher, MPdtFilter>::matcher1;\n  using ComposeFstOptions<Arc, MPdtMatcher, MPdtFilter>::matcher2;\n  using ComposeFstOptions<Arc, MPdtMatcher, MPdtFilter>::filter;\n\n  MPdtComposeFstOptions(const Fst<Arc> &ifst1, const Fst<Arc> &ifst2,\n                        const std::vector<std::pair<Label, Label>> &parens,\n                        const std::vector<typename Arc::Label> &assignments,\n                        bool expand = false, bool keep_parens = true) {\n    matcher1 = new MPdtMatcher(ifst1, MATCH_OUTPUT, kParenLoop);\n    matcher2 = new MPdtMatcher(ifst2, MATCH_INPUT, kParenList);\n    filter = new MPdtFilter(ifst1, ifst2, matcher1, matcher2, &parens,\n                            &assignments, expand, keep_parens);\n  }\n};\n\nstruct MPdtComposeOptions {\n  bool connect;                  // Connect output?\n  PdtComposeFilter filter_type;  // Which pre-defined filter to use.\n\n  explicit MPdtComposeOptions(bool connect = true,\n                              PdtComposeFilter filter_type = PAREN_FILTER)\n      : connect(connect), filter_type(filter_type) {}\n};\n\n// Composes multi-pushdown transducer (MPDT) encoded as an FST (1st arg) and an\n// FST (2nd arg) with the result also an MPDT encoded as an FST (3rd arg). In\n// theMPDTs, some transitions are labeled with open or close parentheses (and\n// associated with a stack). To be interpreted as an MPDT, the parents on each\n// stack must balance on a path (see MPdtExpand()). The open-close parenthesis\n// label pairs are passed using the parens arguments, and the stack assignments\n// are passed using the assignments argument.\ntemplate <class Arc>\nvoid Compose(\n    const Fst<Arc> &ifst1,\n    const std::vector<std::pair<typename Arc::Label, typename Arc::Label>>\n        &parens,\n    const std::vector<typename Arc::Label> &assignments, const Fst<Arc> &ifst2,\n    MutableFst<Arc> *ofst,\n    const MPdtComposeOptions &opts = MPdtComposeOptions()) {\n  bool expand = opts.filter_type != PAREN_FILTER;\n  bool keep_parens = opts.filter_type != EXPAND_FILTER;\n  MPdtComposeFstOptions<Arc, true> copts(ifst1, parens, assignments, ifst2,\n                                         expand, keep_parens);\n  copts.gc_limit = 0;\n  *ofst = ComposeFst<Arc>(ifst1, ifst2, copts);\n  if (opts.connect) Connect(ofst);\n}\n\n// Composes an FST (1st arg) and a multi-pushdown transducer (MPDT) encoded as\n// an FST (2nd arg) with the result also an MPDT encoded as an FST (3rd arg).\n// In the MPDTs, some transitions are labeled with open or close parentheses\n// (and associated with a stack). To be interpreted as an MPDT, the parents on\n// each stack must balance on a path (see MPdtExpand()). The open-close\n// parenthesis label pairs are passed using the parens arguments, and the stack\n// assignments are passed using the assignments argument.\ntemplate <class Arc>\nvoid Compose(\n    const Fst<Arc> &ifst1, const Fst<Arc> &ifst2,\n    const std::vector<std::pair<typename Arc::Label, typename Arc::Label>>\n        &parens,\n    const std::vector<typename Arc::Label> &assignments, MutableFst<Arc> *ofst,\n    const MPdtComposeOptions &opts = MPdtComposeOptions()) {\n  bool expand = opts.filter_type != PAREN_FILTER;\n  bool keep_parens = opts.filter_type != EXPAND_FILTER;\n  MPdtComposeFstOptions<Arc, false> copts(ifst1, ifst2, parens, assignments,\n                                          expand, keep_parens);\n  copts.gc_limit = 0;\n  *ofst = ComposeFst<Arc>(ifst1, ifst2, copts);\n  if (opts.connect) Connect(ofst);\n}\n\n}  // namespace fst\n\n#endif  // FST_EXTENSIONS_MPDT_COMPOSE_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/compose (2).h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Composes a PDT and an FST.\n\n#ifndef FST_EXTENSIONS_PDT_COMPOSE_H_\n#define FST_EXTENSIONS_PDT_COMPOSE_H_\n\n#include <list>\n\n#include <fst/extensions/pdt/pdt.h>\n#include <fst/compose.h>\n\nnamespace fst {\n\n// Returns paren arcs for Find(kNoLabel).\nconstexpr uint32 kParenList = 0x00000001;\n\n// Returns a kNolabel loop for Find(paren).\nconstexpr uint32 kParenLoop = 0x00000002;\n\n// This class is a matcher that treats parens as multi-epsilon labels.\n// It is most efficient if the parens are in a range non-overlapping with\n// the non-paren labels.\ntemplate <class F>\nclass ParenMatcher {\n public:\n  using FST = F;\n  using M = SortedMatcher<FST>;\n  using Arc = typename FST::Arc;\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  // This makes a copy of the FST.\n  ParenMatcher(const FST &fst, MatchType match_type,\n               uint32 flags = (kParenLoop | kParenList))\n      : matcher_(fst, match_type), match_type_(match_type), flags_(flags) {\n    if (match_type == MATCH_INPUT) {\n      loop_.ilabel = kNoLabel;\n      loop_.olabel = 0;\n    } else {\n      loop_.ilabel = 0;\n      loop_.olabel = kNoLabel;\n    }\n    loop_.weight = Weight::One();\n    loop_.nextstate = kNoStateId;\n  }\n\n  // This doesn't copy the FST.\n  ParenMatcher(const FST *fst, MatchType match_type,\n               uint32 flags = (kParenLoop | kParenList))\n      : matcher_(fst, match_type), match_type_(match_type), flags_(flags) {\n    if (match_type == MATCH_INPUT) {\n      loop_.ilabel = kNoLabel;\n      loop_.olabel = 0;\n    } else {\n      loop_.ilabel = 0;\n      loop_.olabel = kNoLabel;\n    }\n    loop_.weight = Weight::One();\n    loop_.nextstate = kNoStateId;\n  }\n\n  // This makes a copy of the FST.\n  ParenMatcher(const ParenMatcher<FST> &matcher, bool safe = false)\n      : matcher_(matcher.matcher_, safe),\n        match_type_(matcher.match_type_),\n        flags_(matcher.flags_),\n        open_parens_(matcher.open_parens_),\n        close_parens_(matcher.close_parens_),\n        loop_(matcher.loop_) {\n    loop_.nextstate = kNoStateId;\n  }\n\n  ParenMatcher<FST> *Copy(bool safe = false) const {\n    return new ParenMatcher<FST>(*this, safe);\n  }\n\n  MatchType Type(bool test) const { return matcher_.Type(test); }\n\n  void SetState(StateId s) {\n    matcher_.SetState(s);\n    loop_.nextstate = s;\n  }\n\n  bool Find(Label match_label);\n\n  bool Done() const { return done_; }\n\n  const Arc &Value() const { return paren_loop_ ? loop_ : matcher_.Value(); }\n\n  void Next();\n\n  Weight Final(StateId s) { return matcher_.Final(s); }\n\n  std::ptrdiff_t Priority(StateId s) { return matcher_.Priority(s); }\n\n  const FST &GetFst() const { return matcher_.GetFst(); }\n\n  uint64 Properties(uint64 props) const { return matcher_.Properties(props); }\n\n  uint32 Flags() const { return matcher_.Flags(); }\n\n  void AddOpenParen(Label label) {\n    if (label == 0) {\n      FSTERROR() << \"ParenMatcher: Bad open paren label: 0\";\n    } else {\n      open_parens_.Insert(label);\n    }\n  }\n\n  void AddCloseParen(Label label) {\n    if (label == 0) {\n      FSTERROR() << \"ParenMatcher: Bad close paren label: 0\";\n    } else {\n      close_parens_.Insert(label);\n    }\n  }\n\n  void RemoveOpenParen(Label label) {\n    if (label == 0) {\n      FSTERROR() << \"ParenMatcher: Bad open paren label: 0\";\n    } else {\n      open_parens_.Erase(label);\n    }\n  }\n\n  void RemoveCloseParen(Label label) {\n    if (label == 0) {\n      FSTERROR() << \"ParenMatcher: Bad close paren label: 0\";\n    } else {\n      close_parens_.Erase(label);\n    }\n  }\n\n  void ClearOpenParens() { open_parens_.Clear(); }\n\n  void ClearCloseParens() { close_parens_.Clear(); }\n\n  bool IsOpenParen(Label label) const { return open_parens_.Member(label); }\n\n  bool IsCloseParen(Label label) const { return close_parens_.Member(label); }\n\n private:\n  // Advances matcher to next open paren, returning true if it exists.\n  bool NextOpenParen();\n\n  // Advances matcher to next close paren, returning true if it exists.\n  bool NextCloseParen();\n\n  M matcher_;\n  MatchType match_type_;  // Type of match to perform.\n  uint32 flags_;\n  // Open paren label set.\n  CompactSet<Label, kNoLabel> open_parens_;\n  // Close paren label set.\n  CompactSet<Label, kNoLabel> close_parens_;\n  bool open_paren_list_;   // Matching open paren list?\n  bool close_paren_list_;  // Matching close paren list?\n  bool paren_loop_;        // Current arc is the implicit paren loop?\n  mutable Arc loop_;       // For non-consuming symbols.\n  bool done_;              // Matching done?\n\n  ParenMatcher &operator=(const ParenMatcher &) = delete;\n};\n\ntemplate <class FST>\ninline bool ParenMatcher<FST>::Find(Label match_label) {\n  open_paren_list_ = false;\n  close_paren_list_ = false;\n  paren_loop_ = false;\n  done_ = false;\n  // Returns all parenthesis arcs.\n  if (match_label == kNoLabel && (flags_ & kParenList)) {\n    if (open_parens_.LowerBound() != kNoLabel) {\n      matcher_.LowerBound(open_parens_.LowerBound());\n      open_paren_list_ = NextOpenParen();\n      if (open_paren_list_) return true;\n    }\n    if (close_parens_.LowerBound() != kNoLabel) {\n      matcher_.LowerBound(close_parens_.LowerBound());\n      close_paren_list_ = NextCloseParen();\n      if (close_paren_list_) return true;\n    }\n  }\n  // Returns the implicit paren loop.\n  if (match_label > 0 && (flags_ & kParenLoop) &&\n      (IsOpenParen(match_label) || IsCloseParen(match_label))) {\n    paren_loop_ = true;\n    return true;\n  }\n  // Returns all other labels.\n  if (matcher_.Find(match_label)) return true;\n  done_ = true;\n  return false;\n}\n\ntemplate <class FST>\ninline void ParenMatcher<FST>::Next() {\n  if (paren_loop_) {\n    paren_loop_ = false;\n    done_ = true;\n  } else if (open_paren_list_) {\n    matcher_.Next();\n    open_paren_list_ = NextOpenParen();\n    if (open_paren_list_) return;\n    if (close_parens_.LowerBound() != kNoLabel) {\n      matcher_.LowerBound(close_parens_.LowerBound());\n      close_paren_list_ = NextCloseParen();\n      if (close_paren_list_) return;\n    }\n    done_ = !matcher_.Find(kNoLabel);\n  } else if (close_paren_list_) {\n    matcher_.Next();\n    close_paren_list_ = NextCloseParen();\n    if (close_paren_list_) return;\n    done_ = !matcher_.Find(kNoLabel);\n  } else {\n    matcher_.Next();\n    done_ = matcher_.Done();\n  }\n}\n\n// Advances matcher to next open paren, returning true if it exists.\ntemplate <class FST>\ninline bool ParenMatcher<FST>::NextOpenParen() {\n  for (; !matcher_.Done(); matcher_.Next()) {\n    Label label = match_type_ == MATCH_INPUT ? matcher_.Value().ilabel\n                                             : matcher_.Value().olabel;\n    if (label > open_parens_.UpperBound()) return false;\n    if (IsOpenParen(label)) return true;\n  }\n  return false;\n}\n\n// Advances matcher to next close paren, returning true if it exists.\ntemplate <class FST>\ninline bool ParenMatcher<FST>::NextCloseParen() {\n  for (; !matcher_.Done(); matcher_.Next()) {\n    Label label = match_type_ == MATCH_INPUT ? matcher_.Value().ilabel\n                                             : matcher_.Value().olabel;\n    if (label > close_parens_.UpperBound()) return false;\n    if (IsCloseParen(label)) return true;\n  }\n  return false;\n}\n\ntemplate <class Filter>\nclass ParenFilter {\n public:\n  using FST1 = typename Filter::FST1;\n  using FST2 = typename Filter::FST2;\n  using Arc = typename Filter::Arc;\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using Matcher1 = typename Filter::Matcher1;\n  using Matcher2 = typename Filter::Matcher2;\n\n  using StackId = StateId;\n  using ParenStack = PdtStack<StackId, Label>;\n  using FilterState1 = typename Filter::FilterState;\n  using FilterState2 = IntegerFilterState<StackId>;\n  using FilterState = PairFilterState<FilterState1, FilterState2>;\n\n  ParenFilter(const FST1 &fst1, const FST2 &fst2, Matcher1 *matcher1 = nullptr,\n              Matcher2 *matcher2 = nullptr,\n              const std::vector<std::pair<Label, Label>> *parens = nullptr,\n              bool expand = false, bool keep_parens = true)\n      : filter_(fst1, fst2, matcher1, matcher2),\n        parens_(parens ? *parens : std::vector<std::pair<Label, Label>>()),\n        expand_(expand),\n        keep_parens_(keep_parens),\n        fs_(FilterState::NoState()),\n        stack_(parens_),\n        paren_id_(-1) {\n    if (parens) {\n      for (const auto &pair : *parens) {\n        parens_.push_back(pair);\n        GetMatcher1()->AddOpenParen(pair.first);\n        GetMatcher2()->AddOpenParen(pair.first);\n        if (!expand_) {\n          GetMatcher1()->AddCloseParen(pair.second);\n          GetMatcher2()->AddCloseParen(pair.second);\n        }\n      }\n    }\n  }\n\n  ParenFilter(const ParenFilter &filter, bool safe = false)\n      : filter_(filter.filter_, safe),\n        parens_(filter.parens_),\n        expand_(filter.expand_),\n        keep_parens_(filter.keep_parens_),\n        fs_(FilterState::NoState()),\n        stack_(filter.parens_),\n        paren_id_(-1) {}\n\n  FilterState Start() const {\n    return FilterState(filter_.Start(), FilterState2(0));\n  }\n\n  void SetState(StateId s1, StateId s2, const FilterState &fs) {\n    fs_ = fs;\n    filter_.SetState(s1, s2, fs_.GetState1());\n    if (!expand_) return;\n    std::ptrdiff_t paren_id = stack_.Top(fs.GetState2().GetState());\n    if (paren_id != paren_id_) {\n      if (paren_id_ != -1) {\n        GetMatcher1()->RemoveCloseParen(parens_[paren_id_].second);\n        GetMatcher2()->RemoveCloseParen(parens_[paren_id_].second);\n      }\n      paren_id_ = paren_id;\n      if (paren_id_ != -1) {\n        GetMatcher1()->AddCloseParen(parens_[paren_id_].second);\n        GetMatcher2()->AddCloseParen(parens_[paren_id_].second);\n      }\n    }\n  }\n\n  FilterState FilterArc(Arc *arc1, Arc *arc2) const {\n    const auto fs1 = filter_.FilterArc(arc1, arc2);\n    const auto &fs2 = fs_.GetState2();\n    if (fs1 == FilterState1::NoState()) return FilterState::NoState();\n    if (arc1->olabel == kNoLabel && arc2->ilabel) {  // arc2 parentheses.\n      if (keep_parens_) {\n        arc1->ilabel = arc2->ilabel;\n      } else if (arc2->ilabel) {\n        arc2->olabel = arc1->ilabel;\n      }\n      return FilterParen(arc2->ilabel, fs1, fs2);\n    } else if (arc2->ilabel == kNoLabel && arc1->olabel) {  // arc1 parentheses.\n      if (keep_parens_) {\n        arc2->olabel = arc1->olabel;\n      } else {\n        arc1->ilabel = arc2->olabel;\n      }\n      return FilterParen(arc1->olabel, fs1, fs2);\n    } else {\n      return FilterState(fs1, fs2);\n    }\n  }\n\n  void FilterFinal(Weight *w1, Weight *w2) const {\n    if (fs_.GetState2().GetState() != 0) *w1 = Weight::Zero();\n    filter_.FilterFinal(w1, w2);\n  }\n\n  // Returns respective matchers; ownership stays with filter.\n\n  Matcher1 *GetMatcher1() { return filter_.GetMatcher1(); }\n\n  Matcher2 *GetMatcher2() { return filter_.GetMatcher2(); }\n\n  uint64 Properties(uint64 iprops) const {\n    return filter_.Properties(iprops) & kILabelInvariantProperties &\n           kOLabelInvariantProperties;\n  }\n\n private:\n  const FilterState FilterParen(Label label, const FilterState1 &fs1,\n                                const FilterState2 &fs2) const {\n    if (!expand_) return FilterState(fs1, fs2);\n    const auto stack_id = stack_.Find(fs2.GetState(), label);\n    if (stack_id < 0) {\n      return FilterState::NoState();\n    } else {\n      return FilterState(fs1, FilterState2(stack_id));\n    }\n  }\n\n  Filter filter_;\n  std::vector<std::pair<Label, Label>> parens_;\n  bool expand_;       // Expands to FST?\n  bool keep_parens_;  // Retains parentheses in output?\n  FilterState fs_;    // Current filter state.\n  mutable ParenStack stack_;\n  std::ptrdiff_t paren_id_;\n};\n\n// Class to setup composition options for PDT composition. Default is to take\n// the PDT as the first composition argument.\ntemplate <class Arc, bool left_pdt = true>\nclass PdtComposeFstOptions\n    : public ComposeFstOptions<\n          Arc, ParenMatcher<Fst<Arc>>,\n          ParenFilter<AltSequenceComposeFilter<ParenMatcher<Fst<Arc>>>>> {\n public:\n  using Label = typename Arc::Label;\n  using PdtMatcher = ParenMatcher<Fst<Arc>>;\n  using PdtFilter = ParenFilter<AltSequenceComposeFilter<PdtMatcher>>;\n\n  using ComposeFstOptions<Arc, PdtMatcher, PdtFilter>::matcher1;\n  using ComposeFstOptions<Arc, PdtMatcher, PdtFilter>::matcher2;\n  using ComposeFstOptions<Arc, PdtMatcher, PdtFilter>::filter;\n\n  PdtComposeFstOptions(const Fst<Arc> &ifst1,\n                       const std::vector<std::pair<Label, Label>> &parens,\n                       const Fst<Arc> &ifst2, bool expand = false,\n                       bool keep_parens = true) {\n    matcher1 = new PdtMatcher(ifst1, MATCH_OUTPUT, kParenList);\n    matcher2 = new PdtMatcher(ifst2, MATCH_INPUT, kParenLoop);\n    filter = new PdtFilter(ifst1, ifst2, matcher1, matcher2, &parens, expand,\n                           keep_parens);\n  }\n};\n\n// Class to setup composition options for PDT with FST composition.\n// Specialization is for the FST as the first composition argument.\ntemplate <class Arc>\nclass PdtComposeFstOptions<Arc, false>\n    : public ComposeFstOptions<\n          Arc, ParenMatcher<Fst<Arc>>,\n          ParenFilter<SequenceComposeFilter<ParenMatcher<Fst<Arc>>>>> {\n public:\n  using Label = typename Arc::Label;\n  using PdtMatcher = ParenMatcher<Fst<Arc>>;\n  using PdtFilter = ParenFilter<SequenceComposeFilter<PdtMatcher>>;\n\n  using ComposeFstOptions<Arc, PdtMatcher, PdtFilter>::matcher1;\n  using ComposeFstOptions<Arc, PdtMatcher, PdtFilter>::matcher2;\n  using ComposeFstOptions<Arc, PdtMatcher, PdtFilter>::filter;\n\n  PdtComposeFstOptions(const Fst<Arc> &ifst1, const Fst<Arc> &ifst2,\n                       const std::vector<std::pair<Label, Label>> &parens,\n                       bool expand = false, bool keep_parens = true) {\n    matcher1 = new PdtMatcher(ifst1, MATCH_OUTPUT, kParenLoop);\n    matcher2 = new PdtMatcher(ifst2, MATCH_INPUT, kParenList);\n    filter = new PdtFilter(ifst1, ifst2, matcher1, matcher2, &parens, expand,\n                           keep_parens);\n  }\n};\n\nenum PdtComposeFilter {\n  PAREN_FILTER,         // Bar-Hillel construction; keeps parentheses.\n  EXPAND_FILTER,        // Bar-Hillel + expansion; removes parentheses.\n  EXPAND_PAREN_FILTER,  // Bar-Hillel + expansion; keeps parentheses.\n};\n\nstruct PdtComposeOptions {\n  bool connect;                  // Connect output?\n  PdtComposeFilter filter_type;  // Pre-defined filter to use.\n\n  explicit PdtComposeOptions(bool connect = true,\n                             PdtComposeFilter filter_type = PAREN_FILTER)\n      : connect(connect), filter_type(filter_type) {}\n};\n\n// Composes pushdown transducer (PDT) encoded as an FST (1st arg) and an FST\n// (2nd arg) with the result also a PDT encoded as an FST (3rd arg). In the\n// PDTs, some transitions are labeled with open or close parentheses. To be\n// interpreted as a PDT, the parens must balance on a path (see PdtExpand()).\n// The open-close parenthesis label pairs are passed using the parens argument.\ntemplate <class Arc>\nvoid Compose(const Fst<Arc> &ifst1,\n             const std::vector<\n                 std::pair<typename Arc::Label, typename Arc::Label>> &parens,\n             const Fst<Arc> &ifst2, MutableFst<Arc> *ofst,\n             const PdtComposeOptions &opts = PdtComposeOptions()) {\n  bool expand = opts.filter_type != PAREN_FILTER;\n  bool keep_parens = opts.filter_type != EXPAND_FILTER;\n  PdtComposeFstOptions<Arc, true> copts(ifst1, parens, ifst2, expand,\n                                        keep_parens);\n  copts.gc_limit = 0;\n  *ofst = ComposeFst<Arc>(ifst1, ifst2, copts);\n  if (opts.connect) Connect(ofst);\n}\n\n// Composes an FST (1st arg) and pushdown transducer (PDT) encoded as an FST\n// (2nd arg) with the result also a PDT encoded as an FST (3rd arg). In the\n// PDTs, some transitions are labeled with open or close parentheses. To be\n// interpreted as a PDT, the parens must balance on a path (see ExpandFst()).\n// The open-close parenthesis label pairs are passed using the parens argument.\ntemplate <class Arc>\nvoid Compose(const Fst<Arc> &ifst1, const Fst<Arc> &ifst2,\n             const std::vector<\n                 std::pair<typename Arc::Label, typename Arc::Label>> &parens,\n             MutableFst<Arc> *ofst,\n             const PdtComposeOptions &opts = PdtComposeOptions()) {\n  bool expand = opts.filter_type != PAREN_FILTER;\n  bool keep_parens = opts.filter_type != EXPAND_FILTER;\n  PdtComposeFstOptions<Arc, false> copts(ifst1, ifst2, parens, expand,\n                                         keep_parens);\n  copts.gc_limit = 0;\n  *ofst = ComposeFst<Arc>(ifst1, ifst2, copts);\n  if (opts.connect) Connect(ofst);\n}\n\n}  // namespace fst\n\n#endif  // FST_EXTENSIONS_PDT_COMPOSE_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/compose-filter.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Classes for filtering the composition matches, e.g. for correct epsilon\n// handling.\n\n#ifndef FST_COMPOSE_FILTER_H_\n#define FST_COMPOSE_FILTER_H_\n\n#include <fst/filter-state.h>\n#include <fst/fst-decl.h>  // For optional argument declarations\n#include <fst/fst.h>\n#include <fst/matcher.h>\n\n\nnamespace fst {\n\n// Composition filters determine which matches are allowed to proceed. The\n// filter's state is represeted by the type ComposeFilter::FilterState.\n// The basic filters handle correct epsilon matching. Their interface is:\n//\n// template <class M1, class M2>\n// class ComposeFilter {\n//  public:\n//   using Matcher1 = ...;\n//   using Matcher2 = ...;\n//   using FST1 = typename M1::FST;\n//   using FST2 = typename M2::FST;\n//   using FilterState = ...;\n//\n//   using Arc = typename FST1::Arc;\n//   using StateId = typename Arc::StateId;\n//   using Weight = typename Arc::Weight;\n//\n//   // Required constructor.\n//   ComposeFilter(const FST1 &fst1, const FST2 &fst2,\n//                 M1 *matcher1 = nullptr, M2 *matcher2 = nullptr);\n//\n//   // If safe=true, the copy is thread-safe. See Fst<>::Copy()\n//   // for further doc.\n//   ComposeFilter(const ComposeFilter<M1, M2> &filter,\n//                 bool safe = false);\n//\n//   // Return start state of filter.\n//   FilterState Start() const;\n//\n//   // Specifies current composition state.\n//   void SetState(StateId s1, StateId s2, const FilterState &fs);\n//\n//   // Apply filter at current composition state to these transitions. If an\n//   // arc label to be matched is kNolabel, then that side does not consume a\n//   // symbol. Returns the new filter state or, if disallowed,\n//   // FilterState::NoState(). The filter is permitted to modify its inputs\n//   // (e.g. for optimization reasons).\n//   FilterState FilterArc(Arc *arc1, Arc *arc2) const;\n\n//   // Apply filter at current composition state to these final weights\n//   // (cf. superfinal transitions). The filter may modify its inputs\n//   // (e.g. for optimization reasons).\n//   void FilterFinal(Weight *w1, Weight *w2) const;\n//\n//   // Return the respective matchers. Ownership stays with filter. These\n//   // methods allow the filter to access and possibly modify the compositio\n//   // matchers (useful, e.g., with lookahead).\n//\n//   Matcher1 *GetMatcher1();\n//\n//   Matcher2 *GetMatcher2();\n//\n//   // This specifies how the filter affects the composition result properties.\n//   It takes as argument the properties that would apply with a trivial\n//   // composition filter.\n//   uint64_t Properties(uint64_t props) const;\n// };\n//\n// This filter allows only exact matching of symbols from FST1 with on FST2;\n// e.g., no special interpretation of epsilons.\ntemplate <class M1, class M2 /* = M1 */>\nclass NullComposeFilter {\n public:\n  using Matcher1 = M1;\n  using Matcher2 = M2;\n  using FST1 = typename M1::FST;\n  using FST2 = typename M2::FST;\n  using FilterState = TrivialFilterState;\n\n  using Arc = typename FST1::Arc;\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  NullComposeFilter(const FST1 &fst1, const FST2 &fst2,\n                    Matcher1 *matcher1 = nullptr, Matcher2 *matcher2 = nullptr)\n      : matcher1_(matcher1 ? matcher1 : new Matcher1(fst1, MATCH_OUTPUT)),\n        matcher2_(matcher2 ? matcher2 : new Matcher2(fst2, MATCH_INPUT)),\n        fst1_(matcher1_->GetFst()),\n        fst2_(matcher2_->GetFst()) {}\n\n  NullComposeFilter(const NullComposeFilter<M1, M2> &filter, bool safe = false)\n      : matcher1_(filter.matcher1_->Copy(safe)),\n        matcher2_(filter.matcher2_->Copy(safe)),\n        fst1_(matcher1_->GetFst()),\n        fst2_(matcher2_->GetFst()) {}\n\n  FilterState Start() const { return FilterState(true); }\n\n  void SetState(StateId, StateId, const FilterState &) {}\n\n  FilterState FilterArc(Arc *arc1, Arc *arc2) const {\n    return (arc1->olabel == kNoLabel || arc2->ilabel == kNoLabel)\n               ? FilterState::NoState()\n               : FilterState(true);\n  }\n\n  void FilterFinal(Weight *, Weight *) const {}\n\n  Matcher1 *GetMatcher1() { return matcher1_.get(); }\n\n  Matcher2 *GetMatcher2() { return matcher2_.get(); }\n\n  uint64_t Properties(uint64_t props) const { return props; }\n\n private:\n  std::unique_ptr<Matcher1> matcher1_;\n  std::unique_ptr<Matcher2> matcher2_;\n  const FST1 &fst1_;\n  const FST2 &fst2_;\n};\n\n// This filter allows all epsilon matches, potentially resulting in redundant\n// epsilon paths. The use of this filter gives correct results iff one of the\n// following conditions hold:\n//\n//  (1) The semiring is idempotent,\n//  (2) the first FST is output-epsilon free, or\n//  (3) the second FST is input-epsilon free.\n//\n// For (1), redundant epsilon paths may be created but won't hurt correctness.\n// For (2) and (3), no redundant paths are created.\ntemplate <class M1, class M2 /* = M1 */>\nclass TrivialComposeFilter {\n public:\n  using Matcher1 = M1;\n  using Matcher2 = M2;\n  using FST1 = typename M1::FST;\n  using FST2 = typename M2::FST;\n  using FilterState = TrivialFilterState;\n\n  using Arc = typename FST1::Arc;\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  TrivialComposeFilter(const FST1 &fst1, const FST2 &fst2,\n                       Matcher1 *matcher1 = nullptr,\n                       Matcher2 *matcher2 = nullptr)\n      : matcher1_(matcher1 ? matcher1 : new Matcher1(fst1, MATCH_OUTPUT)),\n        matcher2_(matcher2 ? matcher2 : new Matcher2(fst2, MATCH_INPUT)),\n        fst1_(matcher1_->GetFst()),\n        fst2_(matcher2_->GetFst()) {}\n\n  TrivialComposeFilter(const TrivialComposeFilter<Matcher1, Matcher2> &filter,\n                       bool safe = false)\n      : matcher1_(filter.matcher1_->Copy(safe)),\n        matcher2_(filter.matcher2_->Copy(safe)),\n        fst1_(matcher1_->GetFst()),\n        fst2_(matcher2_->GetFst()) {}\n\n  FilterState Start() const { return FilterState(true); }\n\n  void SetState(StateId, StateId, const FilterState &) {}\n\n  FilterState FilterArc(Arc *, Arc *) const { return FilterState(true); }\n\n  void FilterFinal(Weight *, Weight *) const {}\n\n  Matcher1 *GetMatcher1() { return matcher1_.get(); }\n\n  Matcher2 *GetMatcher2() { return matcher2_.get(); }\n\n  uint64_t Properties(uint64_t props) const { return props; }\n\n private:\n  std::unique_ptr<Matcher1> matcher1_;\n  std::unique_ptr<Matcher2> matcher2_;\n  const FST1 &fst1_;\n  const FST2 &fst2_;\n};\n\n// This filter requires epsilons on FST1 to be read before epsilons on FST2.\ntemplate <class M1, class M2 /* = M1 */>\nclass SequenceComposeFilter {\n public:\n  using Matcher1 = M1;\n  using Matcher2 = M2;\n  using FST1 = typename M1::FST;\n  using FST2 = typename M2::FST;\n  using FilterState = CharFilterState;\n\n  using Arc = typename FST1::Arc;\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  SequenceComposeFilter(const FST1 &fst1, const FST2 &fst2,\n                        Matcher1 *matcher1 = nullptr,\n                        Matcher2 *matcher2 = nullptr)\n      : matcher1_(matcher1 ? matcher1 : new Matcher1(fst1, MATCH_OUTPUT)),\n        matcher2_(matcher2 ? matcher2 : new Matcher2(fst2, MATCH_INPUT)),\n        fst1_(matcher1_->GetFst()),\n        s1_(kNoStateId),\n        s2_(kNoStateId),\n        fs_(kNoStateId) {}\n\n  SequenceComposeFilter(const SequenceComposeFilter<Matcher1, Matcher2> &filter,\n                        bool safe = false)\n      : matcher1_(filter.matcher1_->Copy(safe)),\n        matcher2_(filter.matcher2_->Copy(safe)),\n        fst1_(matcher1_->GetFst()),\n        s1_(kNoStateId),\n        s2_(kNoStateId),\n        fs_(kNoStateId) {}\n\n  FilterState Start() const { return FilterState(0); }\n\n  void SetState(StateId s1, StateId s2, const FilterState &fs) {\n    if (s1_ == s1 && s2_ == s2 && fs == fs_) return;\n    s1_ = s1;\n    s2_ = s2;\n    fs_ = fs;\n    const auto na1 = internal::NumArcs(fst1_, s1);\n    const auto ne1 = internal::NumOutputEpsilons(fst1_, s1);\n    const bool fin1 = internal::Final(fst1_, s1) != Weight::Zero();\n    alleps1_ = na1 == ne1 && !fin1;\n    noeps1_ = ne1 == 0;\n  }\n\n  FilterState FilterArc(Arc *arc1, Arc *arc2) const {\n    if (arc1->olabel == kNoLabel) {\n      return alleps1_ ? FilterState::NoState() : noeps1_ ? FilterState(0)\n                                                         : FilterState(1);\n    } else if (arc2->ilabel == kNoLabel) {\n      return fs_ != FilterState(0) ? FilterState::NoState() : FilterState(0);\n    } else {\n      return arc1->olabel == 0 ? FilterState::NoState() : FilterState(0);\n    }\n  }\n\n  void FilterFinal(Weight *, Weight *) const {}\n\n  Matcher1 *GetMatcher1() { return matcher1_.get(); }\n\n  Matcher2 *GetMatcher2() { return matcher2_.get(); }\n\n  uint64_t Properties(uint64_t props) const { return props; }\n\n private:\n  std::unique_ptr<Matcher1> matcher1_;\n  std::unique_ptr<Matcher2> matcher2_;\n  const FST1 &fst1_;\n  StateId s1_;      // Current fst1_ state.\n  StateId s2_;      // Current fst2_ state.\n  FilterState fs_;  // Current filter state.\n  bool alleps1_;   // Only epsilons (and non-final) leaving s1_?\n  bool noeps1_;    // No epsilons leaving s1_?\n};\n\n// This filter requires epsilons on FST2 to be read before epsilons on FST1.\ntemplate <class M1, class M2 /* = M1 */>\nclass AltSequenceComposeFilter {\n public:\n  using Matcher1 = M1;\n  using Matcher2 = M2;\n  using FST1 = typename M1::FST;\n  using FST2 = typename M2::FST;\n  using FilterState = CharFilterState;\n\n  using Arc = typename FST1::Arc;\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  AltSequenceComposeFilter(const FST1 &fst1, const FST2 &fst2,\n                           Matcher1 *matcher1 = nullptr,\n                           Matcher2 *matcher2 = nullptr)\n      : matcher1_(matcher1 ? matcher1 : new Matcher1(fst1, MATCH_OUTPUT)),\n        matcher2_(matcher2 ? matcher2 : new Matcher2(fst2, MATCH_INPUT)),\n        fst2_(matcher2_->GetFst()),\n        s1_(kNoStateId),\n        s2_(kNoStateId),\n        fs_(kNoStateId) {}\n\n  AltSequenceComposeFilter(\n      const AltSequenceComposeFilter<Matcher1, Matcher2> &filter,\n      bool safe = false)\n      : matcher1_(filter.matcher1_->Copy(safe)),\n        matcher2_(filter.matcher2_->Copy(safe)),\n        fst2_(matcher2_->GetFst()),\n        s1_(kNoStateId),\n        s2_(kNoStateId),\n        fs_(kNoStateId) {}\n\n  FilterState Start() const { return FilterState(0); }\n\n  void SetState(StateId s1, StateId s2, const FilterState &fs) {\n    if (s1_ == s1 && s2_ == s2 && fs == fs_) return;\n    s1_ = s1;\n    s2_ = s2;\n    fs_ = fs;\n    const auto na2 = internal::NumArcs(fst2_, s2);\n    const auto ne2 = internal::NumInputEpsilons(fst2_, s2);\n    const bool fin2 = internal::Final(fst2_, s2) != Weight::Zero();\n    alleps2_ = na2 == ne2 && !fin2;\n    noeps2_ = ne2 == 0;\n  }\n\n  FilterState FilterArc(Arc *arc1, Arc *arc2) const {\n    if (arc2->ilabel == kNoLabel) {\n      return alleps2_ ? FilterState::NoState() : noeps2_ ? FilterState(0)\n                                                         : FilterState(1);\n    } else if (arc1->olabel == kNoLabel) {\n      return fs_ == FilterState(1) ? FilterState::NoState() : FilterState(0);\n    } else {\n      return arc1->olabel == 0 ? FilterState::NoState() : FilterState(0);\n    }\n  }\n\n  void FilterFinal(Weight *, Weight *) const {}\n\n  Matcher1 *GetMatcher1() { return matcher1_.get(); }\n\n  Matcher2 *GetMatcher2() { return matcher2_.get(); }\n\n  uint64_t Properties(uint64_t props) const { return props; }\n\n private:\n  std::unique_ptr<Matcher1> matcher1_;\n  std::unique_ptr<Matcher2> matcher2_;\n  const FST2 &fst2_;\n  StateId s1_;      // Current fst1_ state.\n  StateId s2_;      // Current fst2_ state.\n  FilterState fs_;  // Current filter state.\n  bool alleps2_;    // Only epsilons (and non-final) leaving s2_?\n  bool noeps2_;     // No epsilons leaving s2_?\n};\n\n// This filter requires epsilons on FST1 to be matched with epsilons on FST2\n// whenever possible. (Template arg default declared in fst-decl.h.)\ntemplate <class M1, class M2 /* = M1 */>\nclass MatchComposeFilter {\n public:\n  using Matcher1 = M1;\n  using Matcher2 = M2;\n  using FST1 = typename M1::FST;\n  using FST2 = typename M2::FST;\n  using FilterState = CharFilterState;\n\n  using Arc = typename FST1::Arc;\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  MatchComposeFilter(const FST1 &fst1, const FST2 &fst2,\n                     Matcher1 *matcher1 = nullptr, Matcher2 *matcher2 = nullptr)\n      : matcher1_(matcher1 ? matcher1 : new Matcher1(fst1, MATCH_OUTPUT)),\n        matcher2_(matcher2 ? matcher2 : new Matcher2(fst2, MATCH_INPUT)),\n        fst1_(matcher1_->GetFst()),\n        fst2_(matcher2_->GetFst()),\n        s1_(kNoStateId),\n        s2_(kNoStateId),\n        fs_(kNoStateId) {}\n\n  MatchComposeFilter(const MatchComposeFilter<Matcher1, Matcher2> &filter,\n                     bool safe = false)\n      : matcher1_(filter.matcher1_->Copy(safe)),\n        matcher2_(filter.matcher2_->Copy(safe)),\n        fst1_(matcher1_->GetFst()),\n        fst2_(matcher2_->GetFst()),\n        s1_(kNoStateId),\n        s2_(kNoStateId),\n        fs_(kNoStateId) {}\n\n  FilterState Start() const { return FilterState(0); }\n\n  void SetState(StateId s1, StateId s2, const FilterState &fs) {\n    if (s1_ == s1 && s2_ == s2 && fs == fs_) return;\n    s1_ = s1;\n    s2_ = s2;\n    fs_ = fs;\n    size_t na1 = internal::NumArcs(fst1_, s1);\n    size_t ne1 = internal::NumOutputEpsilons(fst1_, s1);\n    bool f1 = internal::Final(fst1_, s1) != Weight::Zero();\n    alleps1_ = na1 == ne1 && !f1;\n    noeps1_ = ne1 == 0;\n    size_t na2 = internal::NumArcs(fst2_, s2);\n    size_t ne2 = internal::NumInputEpsilons(fst2_, s2);\n    bool f2 = internal::Final(fst2_, s2) != Weight::Zero();\n    alleps2_ = na2 == ne2 && !f2;\n    noeps2_ = ne2 == 0;\n  }\n\n  FilterState FilterArc(Arc *arc1, Arc *arc2) const {\n    if (arc2->ilabel == kNoLabel) {  // Epsilon in FST1.\n      return fs_ == FilterState(0)\n                 ? (noeps2_\n                        ? FilterState(0)\n                        : (alleps2_ ? FilterState::NoState() : FilterState(1)))\n                 : (fs_ == FilterState(1) ? FilterState(1)\n                                          : FilterState::NoState());\n    } else if (arc1->olabel == kNoLabel) {  // Epsilon in FST2.\n      return fs_ == FilterState(0)\n                 ? (noeps1_\n                        ? FilterState(0)\n                        : (alleps1_ ? FilterState::NoState() : FilterState(2)))\n                 : (fs_ == FilterState(2) ? FilterState(2)\n                                          : FilterState::NoState());\n    } else if (arc1->olabel == 0) {  // Epsilon in both.\n      return fs_ == FilterState(0) ? FilterState(0) : FilterState::NoState();\n    } else {  // Both are non-epsilons.\n      return FilterState(0);\n    }\n  }\n\n  void FilterFinal(Weight *, Weight *) const {}\n\n  Matcher1 *GetMatcher1() { return matcher1_.get(); }\n\n  Matcher2 *GetMatcher2() { return matcher2_.get(); }\n\n  uint64_t Properties(uint64_t props) const { return props; }\n\n private:\n  std::unique_ptr<Matcher1> matcher1_;\n  std::unique_ptr<Matcher2> matcher2_;\n  const FST1 &fst1_;\n  const FST2 &fst2_;\n  StateId s1_;      // Current fst1_ state.\n  StateId s2_;      // Current fst2_ state.\n  FilterState fs_;  // Current filter state ID.\n  bool alleps1_;    // Only epsilson (and non-final) leaving s1?\n  bool alleps2_;    // Only epsilons (and non-final) leaving s2?\n  bool noeps1_;     // No epsilons leaving s1?\n  bool noeps2_;     // No epsilons leaving s2?\n};\n\n// This filter works with the MultiEpsMatcher to determine if multi-epsilons are\n// preserved in the composition output (rather than rewritten as 0) and\n// ensures correct properties.\ntemplate <class Filter>\nclass MultiEpsFilter {\n public:\n  using Matcher1 = typename Filter::Matcher1;\n  using Matcher2 = typename Filter::Matcher2;\n  using FST1 = typename Filter::FST1;\n  using FST2 = typename Filter::FST2;\n  using FilterState = typename Filter::FilterState;\n\n  using Arc = typename Filter::Arc;\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  MultiEpsFilter(const FST1 &fst1, const FST2 &fst2,\n                 Matcher1 *matcher1 = nullptr, Matcher2 *matcher2 = nullptr,\n                 bool keep_multi_eps = false)\n      : filter_(fst1, fst2, matcher1, matcher2),\n        keep_multi_eps_(keep_multi_eps) {}\n\n  MultiEpsFilter(const MultiEpsFilter<Filter> &filter, bool safe = false)\n      : filter_(filter.filter_, safe),\n        keep_multi_eps_(filter.keep_multi_eps_) {}\n\n  FilterState Start() const { return filter_.Start(); }\n\n  void SetState(StateId s1, StateId s2, const FilterState &fs) {\n    return filter_.SetState(s1, s2, fs);\n  }\n\n  FilterState FilterArc(Arc *arc1, Arc *arc2) const {\n    const auto fs = filter_.FilterArc(arc1, arc2);\n    if (keep_multi_eps_) {\n      if (arc1->olabel == kNoLabel) arc1->ilabel = arc2->ilabel;\n      if (arc2->ilabel == kNoLabel) arc2->olabel = arc1->olabel;\n    }\n    return fs;\n  }\n\n  void FilterFinal(Weight *w1, Weight *w2) const {\n    return filter_.FilterFinal(w1, w2);\n  }\n\n  Matcher1 *GetMatcher1() { return filter_.GetMatcher1(); }\n\n  Matcher2 *GetMatcher2() { return filter_.GetMatcher2(); }\n\n  uint64_t Properties(uint64_t iprops) const {\n    const auto oprops = filter_.Properties(iprops);\n    return oprops & kILabelInvariantProperties & kOLabelInvariantProperties;\n  }\n\n private:\n  Filter filter_;\n  bool keep_multi_eps_;\n};\n\n}  // namespace fst\n\n#endif  // FST_COMPOSE_FILTER_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/compose.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Class to compute the composition of two FSTs.\n\n#ifndef FST_COMPOSE_H_\n#define FST_COMPOSE_H_\n\n#include <algorithm>\n\n#include <fst/log.h>\n\n#include <fst/cache.h>\n#include <fst/compose-filter.h>\n#include <fst/fst-decl.h>  // For optional argument declarations\n#include <fst/lookahead-filter.h>\n#include <fst/matcher.h>\n#include <fst/state-table.h>\n#include <fst/test-properties.h>\n\n\nnamespace fst {\n\n// Delayed composition options templated on the arc type, the matcher,\n// the composition filter, and the composition state table.  By\n// default, the matchers, filter, and state table are constructed by\n// composition. If set below, the user can instead pass in these\n// objects; in that case, ComposeFst takes their ownership. This\n// version controls composition implemented between generic Fst<Arc>\n// types and a shared matcher type M for Fst<Arc>. This should be\n// adequate for most applications, giving a reasonable tradeoff\n// between efficiency and code sharing (but see ComposeFstImplOptions).\ntemplate <class Arc, class M = Matcher<Fst<Arc>>,\n          class Filter = SequenceComposeFilter<M>,\n          class StateTable =\n              GenericComposeStateTable<Arc, typename Filter::FilterState>>\nstruct ComposeFstOptions : public CacheOptions {\n  M *matcher1;              // FST1 matcher.\n  M *matcher2;              // FST2 matcher.\n  Filter *filter;           // Composition filter.\n  StateTable *state_table;  // Composition state table.\n\n  explicit ComposeFstOptions(const CacheOptions &opts = CacheOptions(),\n                             M *matcher1 = nullptr, M *matcher2 = nullptr,\n                             Filter *filter = nullptr,\n                             StateTable *state_table = nullptr)\n      : CacheOptions(opts),\n        matcher1(matcher1),\n        matcher2(matcher2),\n        filter(filter),\n        state_table(state_table) {}\n};\n\n// Forward declaration of ComposeFstMatcher.\ntemplate <class C, class F, class T>\nclass ComposeFstMatcher;\n\n// Delayed composition options templated on the two matcher types, the\n// composition filter, the composition state table and the cache store. By\n// default, the matchers, filter, state table and cache store are constructed\n// by composition. If set below, the user can instead pass in these objects; in\n// that case, ComposeFst takes their ownership. This version controls\n// composition implemented using arbitrary matchers (of the same arc type but\n// otherwise arbitrary FST type). The user must ensure the matchers are\n// compatible. These options permit the most efficient use, but shares the\n// least code. This is for advanced use only in the most demanding or\n// specialized applications that can benefit from it; otherwise, prefer\n// ComposeFstOptions).\ntemplate <class M1, class M2, class Filter = SequenceComposeFilter<M1, M2>,\n          class StateTable = GenericComposeStateTable<\n              typename M1::Arc, typename Filter::FilterState>,\n          class CacheStore = DefaultCacheStore<typename M1::Arc>>\nstruct ComposeFstImplOptions : public CacheImplOptions<CacheStore> {\n  M1 *matcher1;    // FST1 matcher (see matcher.h)....\n  M2 *matcher2;    // FST2 matcher.\n  Filter *filter;  // Composition filter (see compose-filter.h).\n  StateTable\n    *state_table;        // Composition state table (see compose-state-table.h).\n  bool own_state_table;   // ComposeFstImpl takes ownership of 'state_table'?\n  bool allow_noncommute;  // Allow non-commutative weights\n\n  explicit ComposeFstImplOptions(const CacheOptions &opts,\n                                 M1 *matcher1 = nullptr, M2 *matcher2 = nullptr,\n                                 Filter *filter = nullptr,\n                                 StateTable *state_table = nullptr)\n      : CacheImplOptions<CacheStore>(opts),\n        matcher1(matcher1),\n        matcher2(matcher2),\n        filter(filter),\n        state_table(state_table),\n        own_state_table(true),\n        allow_noncommute(false) {}\n\n  explicit ComposeFstImplOptions(const CacheImplOptions<CacheStore> &opts,\n                                 M1 *matcher1 = nullptr, M2 *matcher2 = nullptr,\n                                 Filter *filter = nullptr,\n                                 StateTable *state_table = nullptr)\n      : CacheImplOptions<CacheStore>(opts),\n        matcher1(matcher1),\n        matcher2(matcher2),\n        filter(filter),\n        state_table(state_table),\n        own_state_table(true),\n        allow_noncommute(false) {}\n\n  ComposeFstImplOptions()\n      : matcher1(nullptr),\n        matcher2(nullptr),\n        filter(nullptr),\n        state_table(nullptr),\n        own_state_table(true),\n        allow_noncommute(false) {}\n};\n\nnamespace internal {\n\n// Implementation of delayed composition. This base class is common to the\n// variants with different matchers, composition filters and state tables.\ntemplate <class Arc, class CacheStore = DefaultCacheStore<Arc>,\n          class F = ComposeFst<Arc, CacheStore>>\nclass ComposeFstImplBase\n    : public CacheBaseImpl<typename CacheStore::State, CacheStore> {\n public:\n  using FST = F;\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using State = typename CacheStore::State;\n  using CacheImpl = CacheBaseImpl<State, CacheStore>;\n\n  using FstImpl<Arc>::SetType;\n  using FstImpl<Arc>::SetProperties;\n  using FstImpl<Arc>::Properties;\n  using FstImpl<Arc>::SetInputSymbols;\n  using FstImpl<Arc>::SetOutputSymbols;\n\n  using CacheImpl::HasStart;\n  using CacheImpl::HasFinal;\n  using CacheImpl::HasArcs;\n  using CacheImpl::SetFinal;\n  using CacheImpl::SetStart;\n\n  ComposeFstImplBase(const CacheImplOptions<CacheStore> &opts)\n      : CacheImpl(opts) {}\n\n  ComposeFstImplBase(const CacheOptions &opts) : CacheImpl(opts) {}\n\n  ComposeFstImplBase(const ComposeFstImplBase &impl) : CacheImpl(impl, true) {\n    SetType(impl.Type());\n    SetProperties(impl.Properties(), kCopyProperties);\n    SetInputSymbols(impl.InputSymbols());\n    SetOutputSymbols(impl.OutputSymbols());\n  }\n\n  virtual ComposeFstImplBase *Copy() const = 0;\n\n  ~ComposeFstImplBase() override {}\n\n  StateId Start() {\n    if (!HasStart()) {\n      const auto start = ComputeStart();\n      if (start != kNoStateId) SetStart(start);\n    }\n    return CacheImpl::Start();\n  }\n\n  Weight Final(StateId s) {\n    if (!HasFinal(s)) SetFinal(s, ComputeFinal(s));\n    return CacheImpl::Final(s);\n  }\n\n  virtual void Expand(StateId s) = 0;\n\n  size_t NumArcs(StateId s) {\n    if (!HasArcs(s)) Expand(s);\n    return CacheImpl::NumArcs(s);\n  }\n\n  size_t NumInputEpsilons(StateId s) {\n    if (!HasArcs(s)) Expand(s);\n    return CacheImpl::NumInputEpsilons(s);\n  }\n\n  size_t NumOutputEpsilons(StateId s) {\n    if (!HasArcs(s)) Expand(s);\n    return CacheImpl::NumOutputEpsilons(s);\n  }\n\n  void InitArcIterator(StateId s, ArcIteratorData<Arc> *data) {\n    if (!HasArcs(s)) Expand(s);\n    CacheImpl::InitArcIterator(s, data);\n  }\n\n  virtual MatcherBase<Arc> *InitMatcher(const F &fst,\n                                        MatchType match_type) const {\n    // Use the default matcher if no override is provided.\n    return nullptr;\n  }\n\n protected:\n  virtual StateId ComputeStart() = 0;\n  virtual Weight ComputeFinal(StateId s) = 0;\n};\n\n// Implementation of delayed composition templated on the matchers (see\n// matcher.h), composition filter (see compose-filter.h) and the composition\n// state table (see compose-state-table.h).\ntemplate <class CacheStore, class Filter, class StateTable>\nclass ComposeFstImpl\n    : public ComposeFstImplBase<typename CacheStore::Arc, CacheStore> {\n public:\n  using Matcher1 = typename Filter::Matcher1;\n  using Matcher2 = typename Filter::Matcher2;\n\n  using FST1 = typename Matcher1::FST;\n  using FST2 = typename Matcher2::FST;\n\n  using Arc = typename CacheStore::Arc;\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using FilterState = typename Filter::FilterState;\n  using State = typename CacheStore::State;\n\n  using CacheImpl = CacheBaseImpl<State, CacheStore>;\n\n  using StateTuple = typename StateTable::StateTuple;\n\n  friend class ComposeFstMatcher<CacheStore, Filter, StateTable>;\n\n  using FstImpl<Arc>::SetInputSymbols;\n  using FstImpl<Arc>::SetOutputSymbols;\n  using FstImpl<Arc>::SetType;\n  using FstImpl<Arc>::SetProperties;\n\n  template <class M1, class M2>\n  ComposeFstImpl(const FST1 &fst1, const FST2 &fst2,\n                 const ComposeFstImplOptions<M1, M2, Filter, StateTable,\n                                             CacheStore> &opts);\n\n  ComposeFstImpl(const ComposeFstImpl &impl)\n      : ComposeFstImplBase<Arc, CacheStore>(impl),\n        filter_(new Filter(*impl.filter_, true)),\n        matcher1_(filter_->GetMatcher1()),\n        matcher2_(filter_->GetMatcher2()),\n        fst1_(matcher1_->GetFst()),\n        fst2_(matcher2_->GetFst()),\n        state_table_(new StateTable(*impl.state_table_)),\n        own_state_table_(true),\n        match_type_(impl.match_type_) {}\n\n  ~ComposeFstImpl() override {\n    if (own_state_table_) delete state_table_;\n  }\n\n  ComposeFstImpl *Copy() const override { return new ComposeFstImpl(*this); }\n\n  uint64_t Properties() const override { return Properties(kFstProperties); }\n\n  // Sets error if found, and returns other FST impl properties.\n  uint64_t Properties(uint64_t mask) const override {\n    if ((mask & kError) &&\n        (fst1_.Properties(kError, false) || fst2_.Properties(kError, false) ||\n         (matcher1_->Properties(0) & kError) ||\n         (matcher2_->Properties(0) & kError) |\n             (filter_->Properties(0) & kError) ||\n         state_table_->Error())) {\n      SetProperties(kError, kError);\n    }\n    return FstImpl<Arc>::Properties(mask);\n  }\n\n  // Arranges it so that the first arg to OrderedExpand is the Fst\n  // that will be matched on.\n  void Expand(StateId s) override {\n    const auto &tuple = state_table_->Tuple(s);\n    const auto s1 = tuple.StateId1();\n    const auto s2 = tuple.StateId2();\n    filter_->SetState(s1, s2, tuple.GetFilterState());\n    if (MatchInput(s1, s2)) {\n      OrderedExpand(s, fst2_, s2, fst1_, s1, matcher2_, true);\n    } else {\n      OrderedExpand(s, fst1_, s1, fst2_, s2, matcher1_, false);\n    }\n  }\n\n  const FST1 &GetFst1() const { return fst1_; }\n\n  const FST2 &GetFst2() const { return fst2_; }\n\n  const Matcher1 *GetMatcher1() const { return matcher1_; }\n\n  Matcher1 *GetMatcher1() { return matcher1_; }\n\n  const Matcher2 *GetMatcher2() const { return matcher2_; }\n\n  Matcher2 *GetMatcher2() { return matcher2_; }\n\n  const Filter *GetFilter() const { return filter_.get(); }\n\n  Filter *GetFilter() { return filter_.get(); }\n\n  const StateTable *GetStateTable() const { return state_table_; }\n\n  StateTable *GetStateTable() { return state_table_; }\n\n  MatcherBase<Arc> *InitMatcher(const ComposeFst<Arc, CacheStore> &fst,\n                                MatchType match_type) const override {\n    const auto test_props = match_type == MATCH_INPUT\n                                ? kFstProperties & ~kILabelInvariantProperties\n                                : kFstProperties & ~kOLabelInvariantProperties;\n    // If both matchers support 'match_type' and we have a guarantee that a\n    // call to 'filter_->FilterArc(arc1, arc2)' will not modify the ilabel of\n    // arc1 when MATCH_INPUT or the olabel or arc2 when MATCH_OUTPUT, then\n    // ComposeFstMatcher can be used.\n    if ((matcher1_->Type(false) == match_type) &&\n        (matcher2_->Type(false) == match_type) &&\n        (filter_->Properties(test_props) == test_props)) {\n      return new ComposeFstMatcher<\n        CacheStore, Filter, StateTable>(&fst, match_type);\n    }\n    return nullptr;\n  }\n\n private:\n  // This does that actual matching of labels in the composition. The\n  // arguments are ordered so matching is called on state 'sa' of\n  // 'fsta' for each arc leaving state 'sb' of 'fstb'. The 'match_input' arg\n  // determines whether the input or output label of arcs at 'sb' is\n  // the one to match on.\n  template <class FST, class Matcher>\n  void OrderedExpand(StateId s, const Fst<Arc> &, StateId sa, const FST &fstb,\n                     StateId sb, Matcher *matchera, bool match_input) {\n    matchera->SetState(sa);\n    // First processes non-consuming symbols (e.g., epsilons) on FSTA.\n    const Arc loop(match_input ? 0 : kNoLabel, match_input ? kNoLabel : 0,\n                   Weight::One(), sb);\n    MatchArc(s, matchera, loop, match_input);\n    // Then processes matches on FSTB.\n    for (ArcIterator<FST> iterb(fstb, sb); !iterb.Done(); iterb.Next()) {\n      MatchArc(s, matchera, iterb.Value(), match_input);\n    }\n    CacheImpl::SetArcs(s);\n  }\n\n  // Matches a single transition from 'fstb' against 'fata' at 's'.\n  template <class Matcher>\n  void MatchArc(StateId s, Matcher *matchera, const Arc &arc,\n                bool match_input) {\n    if (matchera->Find(match_input ? arc.olabel : arc.ilabel)) {\n      for (; !matchera->Done(); matchera->Next()) {\n        auto arca = matchera->Value();\n        auto arcb = arc;\n        if (match_input) {\n          const auto &fs = filter_->FilterArc(&arcb, &arca);\n          if (fs != FilterState::NoState()) AddArc(s, arcb, arca, fs);\n        } else {\n          const auto &fs = filter_->FilterArc(&arca, &arcb);\n          if (fs != FilterState::NoState()) AddArc(s, arca, arcb, fs);\n        }\n      }\n    }\n  }\n\n  // Add a matching transition at 's'.\n  void AddArc(StateId s, const Arc &arc1, const Arc &arc2,\n              const FilterState &f) {\n    const StateTuple tuple(arc1.nextstate, arc2.nextstate, f);\n    const Arc oarc(arc1.ilabel, arc2.olabel, Times(arc1.weight, arc2.weight),\n                   state_table_->FindState(tuple));\n    CacheImpl::PushArc(s, oarc);\n  }\n\n  StateId ComputeStart() override {\n    const auto s1 = fst1_.Start();\n    if (s1 == kNoStateId) return kNoStateId;\n    const auto s2 = fst2_.Start();\n    if (s2 == kNoStateId) return kNoStateId;\n    const auto &fs = filter_->Start();\n    const StateTuple tuple(s1, s2, fs);\n    return state_table_->FindState(tuple);\n  }\n\n  Weight ComputeFinal(StateId s) override {\n    const auto &tuple = state_table_->Tuple(s);\n    const auto s1 = tuple.StateId1();\n    auto final1 = matcher1_->Final(s1);\n    if (final1 == Weight::Zero()) return final1;\n    const auto s2 = tuple.StateId2();\n    auto final2 = matcher2_->Final(s2);\n    if (final2 == Weight::Zero()) return final2;\n    filter_->SetState(s1, s2, tuple.GetFilterState());\n    filter_->FilterFinal(&final1, &final2);\n    return Times(final1, final2);\n  }\n\n  // Determines which side to match on per composition state.\n  bool MatchInput(StateId s1, StateId s2) {\n    switch (match_type_) {\n      case MATCH_INPUT:\n        return true;\n      case MATCH_OUTPUT:\n        return false;\n      default:  // MATCH_BOTH\n        const auto priority1 = matcher1_->Priority(s1);\n        const auto priority2 = matcher2_->Priority(s2);\n        if (priority1 == kRequirePriority && priority2 == kRequirePriority) {\n          FSTERROR() << \"ComposeFst: Both sides can't require match\";\n          SetProperties(kError, kError);\n          return true;\n        }\n        if (priority1 == kRequirePriority) return false;\n        if (priority2 == kRequirePriority) {\n          return true;\n        }\n        return priority1 <= priority2;\n    }\n  }\n\n  // Identifies and verifies the capabilities of the matcher to be used for\n  // composition.\n  void SetMatchType();\n\n  std::unique_ptr<Filter> filter_;\n  Matcher1 *matcher1_;  // Borrowed reference.\n  Matcher2 *matcher2_;  // Borrowed reference.\n  const FST1 &fst1_;\n  const FST2 &fst2_;\n  StateTable *state_table_;\n  bool own_state_table_;\n\n  MatchType match_type_;\n};\n\ntemplate <class CacheStore, class Filter, class StateTable>\ntemplate <class M1, class M2>\nComposeFstImpl<CacheStore, Filter, StateTable>::ComposeFstImpl(\n    const FST1 &fst1, const FST2 &fst2,\n    const ComposeFstImplOptions<M1, M2, Filter, StateTable, CacheStore> &opts)\n    : ComposeFstImplBase<Arc, CacheStore>(opts),\n      filter_(opts.filter\n                  ? opts.filter\n                  : new Filter(fst1, fst2, opts.matcher1, opts.matcher2)),\n      matcher1_(filter_->GetMatcher1()),\n      matcher2_(filter_->GetMatcher2()),\n      fst1_(matcher1_->GetFst()),\n      fst2_(matcher2_->GetFst()),\n      state_table_(opts.state_table ? opts.state_table\n                                    : new StateTable(fst1_, fst2_)),\n      own_state_table_(opts.state_table ? opts.own_state_table : true) {\n  SetType(\"compose\");\n  if (!CompatSymbols(fst2.InputSymbols(), fst1.OutputSymbols())) {\n    FSTERROR() << \"ComposeFst: Output symbol table of 1st argument \"\n               << \"does not match input symbol table of 2nd argument\";\n    SetProperties(kError, kError);\n  }\n  SetInputSymbols(fst1_.InputSymbols());\n  SetOutputSymbols(fst2_.OutputSymbols());\n  SetMatchType();\n  VLOG(2) << \"ComposeFstImpl: Match type: \" << match_type_;\n  if (match_type_ == MATCH_NONE) SetProperties(kError, kError);\n  const auto fprops1 = fst1.Properties(kFstProperties, false);\n  const auto fprops2 = fst2.Properties(kFstProperties, false);\n  const auto mprops1 = matcher1_->Properties(fprops1);\n  const auto mprops2 = matcher2_->Properties(fprops2);\n  const auto cprops = ComposeProperties(mprops1, mprops2);\n  SetProperties(filter_->Properties(cprops), kCopyProperties);\n  if (state_table_->Error()) SetProperties(kError, kError);\n}\n\ntemplate <class CacheStore, class Filter, class StateTable>\nvoid ComposeFstImpl<CacheStore, Filter, StateTable>::SetMatchType() {\n  // Ensures any required matching is possible and known.\n  if ((matcher1_->Flags() & kRequireMatch) &&\n      matcher1_->Type(true) != MATCH_OUTPUT) {\n    FSTERROR() << \"ComposeFst: 1st argument cannot perform required matching \"\n               << \"(sort?).\";\n    match_type_ = MATCH_NONE;\n    return;\n  }\n  if ((matcher2_->Flags() & kRequireMatch) &&\n      matcher2_->Type(true) != MATCH_INPUT) {\n    FSTERROR() << \"ComposeFst: 2nd argument cannot perform required matching \"\n               << \"(sort?).\";\n    match_type_ = MATCH_NONE;\n    return;\n  }\n  // Finds which sides to match on (favoring minimal testing of capabilities).\n  const auto type1 = matcher1_->Type(false);\n  const auto type2 = matcher2_->Type(false);\n  if (type1 == MATCH_OUTPUT && type2 == MATCH_INPUT) {\n    match_type_ = MATCH_BOTH;\n  } else if (type1 == MATCH_OUTPUT) {\n    match_type_ = MATCH_OUTPUT;\n  } else if (type2 == MATCH_INPUT) {\n    match_type_ = MATCH_INPUT;\n  } else if (matcher1_->Type(true) == MATCH_OUTPUT) {\n    match_type_ = MATCH_OUTPUT;\n  } else if (matcher2_->Type(true) == MATCH_INPUT) {\n    match_type_ = MATCH_INPUT;\n  } else {\n    FSTERROR() << \"ComposeFst: 1st argument cannot match on output labels \"\n               << \"and 2nd argument cannot match on input labels (sort?).\";\n    match_type_ = MATCH_NONE;\n  }\n}\n\n}  // namespace internal\n\n// Computes the composition of two transducers. This version is a delayed FST.\n// If FST1 transduces string x to y with weight a and FST2 transduces y to z\n// with weight b, then their composition transduces string x to z with weight\n// Times(x, z).\n//\n// The output labels of the first transducer or the input labels of the second\n// transducer must be sorted (with the default matcher). The weights need to\n// form a commutative semiring (valid for TropicalWeight and LogWeight).\n//\n// Complexity:\n//\n// Assuming the first FST is unsorted and the second is sorted,\n//\n//   Time: O(v1 v2 d1 (log d2 + m2)),\n//   Space: O(v1 v2)\n//\n// where vi = # of states visited, di = maximum out-degree, and mi the\n// maximum multiplicity of the states visited, for the ith FST. Constant time\n// and space to visit an input state or arc is assumed and exclusive of caching.\n//\n// Caveats:\n// - ComposeFst does not trim its output (since it is a delayed operation).\n// - The efficiency of composition can be strongly affected by several factors:\n//   - the choice of which transducer is sorted - prefer sorting the FST\n//     that has the greater average out-degree.\n//   - the amount of non-determinism\n//   - the presence and location of epsilon transitions - avoid epsilon\n//     transitions on the output side of the first transducer or\n//     the input side of the second transducer or prefer placing\n//     them later in a path since they delay matching and can\n//     introduce non-coaccessible states and transitions.\n//\n// This class attaches interface to implementation and handles reference\n// counting, delegating most methods to ImplToFst. The CacheStore specifies the\n// cache store (default declared in fst-decl.h).\ntemplate <class A, class CacheStore /* = DefaultCacheStore<A> */>\nclass ComposeFst\n    : public ImplToFst<internal::ComposeFstImplBase<A, CacheStore>> {\n public:\n  using Arc = A;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using Store = CacheStore;\n  using State = typename CacheStore::State;\n\n  using Impl = internal::ComposeFstImplBase<A, CacheStore>;\n\n  friend class ArcIterator<ComposeFst<Arc, CacheStore>>;\n  friend class StateIterator<ComposeFst<Arc, CacheStore>>;\n  template <class, class, class> friend class ComposeFstMatcher;\n\n  // Compose specifying only caching options.\n  ComposeFst(const Fst<Arc> &fst1, const Fst<Arc> &fst2,\n             const CacheOptions &opts = CacheOptions())\n      : ImplToFst<Impl>(CreateBase(fst1, fst2, opts)) {}\n\n  // Compose specifying one shared matcher type M. Requires that the input FSTs\n  // and matcher FST types be Fst<Arc>. Recommended for best code-sharing and\n  // matcher compatiblity.\n  template <class Matcher, class Filter, class StateTuple>\n  ComposeFst(const Fst<Arc> &fst1, const Fst<Arc> &fst2,\n             const ComposeFstOptions<Arc, Matcher, Filter, StateTuple> &opts)\n      : ImplToFst<Impl>(CreateBase1(fst1, fst2, opts)) {}\n\n  // Compose specifying two matcher types Matcher1 and Matcher2. Requires input\n  // FST (of the same Arc type, but o.w. arbitrary) match the corresponding\n  // matcher FST types). Recommended only for advanced use in demanding or\n  // specialized applications due to potential code bloat and matcher\n  // incompatibilities.\n  template <class Matcher1, class Matcher2, class Filter, class StateTuple>\n  ComposeFst(const typename Matcher1::FST &fst1,\n             const typename Matcher2::FST &fst2,\n             const ComposeFstImplOptions<Matcher1, Matcher2, Filter, StateTuple,\n                                         CacheStore> &opts)\n      : ImplToFst<Impl>(CreateBase2(fst1, fst2, opts)) {}\n\n  // See Fst<>::Copy() for doc.\n  ComposeFst(const ComposeFst<A, CacheStore> &fst, bool safe = false)\n      : ImplToFst<Impl>(safe ? std::shared_ptr<Impl>(fst.GetImpl()->Copy())\n                             : fst.GetSharedImpl()) {}\n\n  // Get a copy of this ComposeFst. See Fst<>::Copy() for further doc.\n  ComposeFst<A, CacheStore> *Copy(bool safe = false) const override {\n    return new ComposeFst<A, CacheStore>(*this, safe);\n  }\n\n  inline void InitStateIterator(StateIteratorData<Arc> *data) const override;\n\n  void InitArcIterator(StateId s, ArcIteratorData<Arc> *data) const override {\n    GetMutableImpl()->InitArcIterator(s, data);\n  }\n\n  MatcherBase<Arc> *InitMatcher(MatchType match_type) const override {\n    return GetImpl()->InitMatcher(*this, match_type);\n  }\n\n protected:\n  using ImplToFst<Impl>::GetImpl;\n  using ImplToFst<Impl>::GetMutableImpl;\n\n  explicit ComposeFst(std::shared_ptr<Impl> impl) : ImplToFst<Impl>(impl) {}\n\n  // Create compose implementation specifying two matcher types.\n  template <class Matcher1, class Matcher2, class Filter, class StateTuple>\n  static std::shared_ptr<Impl> CreateBase2(\n      const typename Matcher1::FST &fst1, const typename Matcher2::FST &fst2,\n      const ComposeFstImplOptions<Matcher1, Matcher2, Filter, StateTuple,\n                                  CacheStore> &opts) {\n    auto impl = std::make_shared<\n        internal::ComposeFstImpl<CacheStore, Filter, StateTuple>>(fst1, fst2,\n                                                                  opts);\n    if (!(Weight::Properties() & kCommutative) && !opts.allow_noncommute) {\n      const auto props1 = fst1.Properties(kUnweighted, true);\n      const auto props2 = fst2.Properties(kUnweighted, true);\n      if (!(props1 & kUnweighted) && !(props2 & kUnweighted)) {\n        FSTERROR() << \"ComposeFst: Weights must be a commutative semiring: \"\n                   << Weight::Type();\n        impl->SetProperties(kError, kError);\n      }\n    }\n    return impl;\n  }\n\n  // Create compose implementation specifying one matcher type; requires that\n  // input and matcher FST types be Fst<Arc>.\n  template <class Matcher, class Filter, class StateTuple>\n  static std::shared_ptr<Impl> CreateBase1(\n      const Fst<Arc> &fst1, const Fst<Arc> &fst2,\n      const ComposeFstOptions<Arc, Matcher, Filter, StateTuple> &opts) {\n    ComposeFstImplOptions<Matcher, Matcher, Filter, StateTuple, CacheStore>\n        nopts(opts, opts.matcher1, opts.matcher2, opts.filter,\n              opts.state_table);\n    return CreateBase2(fst1, fst2, nopts);\n  }\n\n  // Create compose implementation specifying no matcher type.\n  static std::shared_ptr<Impl> CreateBase(const Fst<Arc> &fst1,\n                                          const Fst<Arc> &fst2,\n                                          const CacheOptions &opts) {\n    switch (LookAheadMatchType(fst1, fst2)) {  // Check for lookahead matchers\n      default:\n      case MATCH_NONE: {  // Default composition (no look-ahead).\n        ComposeFstOptions<Arc> nopts(opts);\n        return CreateBase1(fst1, fst2, nopts);\n      }\n      case MATCH_OUTPUT: {  // Lookahead on fst1.\n        using M = typename DefaultLookAhead<Arc, MATCH_OUTPUT>::FstMatcher;\n        using F = typename DefaultLookAhead<Arc, MATCH_OUTPUT>::ComposeFilter;\n        ComposeFstOptions<Arc, M, F> nopts(opts);\n        return CreateBase1(fst1, fst2, nopts);\n      }\n      case MATCH_INPUT: {  // Lookahead on fst2\n        using M = typename DefaultLookAhead<Arc, MATCH_INPUT>::FstMatcher;\n        using F = typename DefaultLookAhead<Arc, MATCH_INPUT>::ComposeFilter;\n        ComposeFstOptions<Arc, M, F> nopts(opts);\n        return CreateBase1(fst1, fst2, nopts);\n      }\n    }\n  }\n\n private:\n  ComposeFst &operator=(const ComposeFst &fst) = delete;\n};\n\n// Specialization for ComposeFst.\ntemplate <class Arc, class CacheStore>\nclass StateIterator<ComposeFst<Arc, CacheStore>>\n    : public CacheStateIterator<ComposeFst<Arc, CacheStore>> {\n public:\n  explicit StateIterator(const ComposeFst<Arc, CacheStore> &fst)\n      : CacheStateIterator<ComposeFst<Arc, CacheStore>>(fst,\n                                                        fst.GetMutableImpl()) {}\n};\n\n// Specialization for ComposeFst.\ntemplate <class Arc, class CacheStore>\nclass ArcIterator<ComposeFst<Arc, CacheStore>>\n    : public CacheArcIterator<ComposeFst<Arc, CacheStore>> {\n public:\n  using StateId = typename Arc::StateId;\n\n  ArcIterator(const ComposeFst<Arc, CacheStore> &fst, StateId s)\n      : CacheArcIterator<ComposeFst<Arc, CacheStore>>(fst.GetMutableImpl(), s) {\n    if (!fst.GetImpl()->HasArcs(s)) fst.GetMutableImpl()->Expand(s);\n  }\n};\n\ntemplate <class Arc, class CacheStore>\ninline void ComposeFst<Arc, CacheStore>::InitStateIterator(\n    StateIteratorData<Arc> *data) const {\n  data->base = new StateIterator<ComposeFst<Arc, CacheStore>>(*this);\n}\n\n// Specialized matcher for ComposeFst. Supports MATCH_INPUT or MATCH_OUTPUT,\n// iff the underlying matchers for the two FSTS being composed support\n// MATCH_INPUT or MATCH_OUTPUT, respectively.\ntemplate <class CacheStore, class Filter, class StateTable>\nclass ComposeFstMatcher : public MatcherBase<typename CacheStore::Arc> {\n public:\n  using Arc = typename CacheStore::Arc;\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using Matcher1 = typename Filter::Matcher1;\n  using Matcher2 = typename Filter::Matcher2;\n  using FilterState = typename Filter::FilterState;\n\n  using StateTuple = typename StateTable::StateTuple;\n  using Impl = internal::ComposeFstImpl<CacheStore, Filter, StateTable>;\n\n  // The compose FST arg must match the filter and state table types.\n  // This makes a copy of the FST.\n  ComposeFstMatcher(const ComposeFst<Arc, CacheStore> &fst,\n                    MatchType match_type)\n      : owned_fst_(fst.Copy()),\n        fst_(*owned_fst_),\n        impl_(static_cast<const Impl *>(fst_.GetImpl())),\n        s_(kNoStateId),\n        match_type_(match_type),\n        matcher1_(impl_->matcher1_->Copy()),\n        matcher2_(impl_->matcher2_->Copy()),\n        current_loop_(false),\n        loop_(kNoLabel, 0, Weight::One(), kNoStateId) {\n    if (match_type_ == MATCH_OUTPUT) std::swap(loop_.ilabel, loop_.olabel);\n  }\n\n  // The compose FST arg must match the filter and state table types.\n  // This doesn't copy the FST (although it may copy components).\n  ComposeFstMatcher(const ComposeFst<Arc, CacheStore> *fst,\n                    MatchType match_type)\n      : fst_(*fst),\n        impl_(static_cast<const Impl *>(fst_.GetImpl())),\n        s_(kNoStateId),\n        match_type_(match_type),\n        matcher1_(impl_->matcher1_->Copy()),\n        matcher2_(impl_->matcher2_->Copy()),\n        current_loop_(false),\n        loop_(kNoLabel, 0, Weight::One(), kNoStateId) {\n    if (match_type_ == MATCH_OUTPUT) std::swap(loop_.ilabel, loop_.olabel);\n  }\n\n  // This makes a copy of the FST.\n  ComposeFstMatcher(\n      const ComposeFstMatcher<CacheStore, Filter, StateTable> &matcher,\n      bool safe = false)\n      : owned_fst_(matcher.fst_.Copy(safe)),\n        fst_(*owned_fst_),\n        impl_(static_cast<const Impl *>(fst_.GetImpl())),\n        s_(kNoStateId),\n        match_type_(matcher.match_type_),\n        matcher1_(matcher.matcher1_->Copy(safe)),\n        matcher2_(matcher.matcher2_->Copy(safe)),\n        current_loop_(false),\n        loop_(kNoLabel, 0, Weight::One(), kNoStateId) {\n    if (match_type_ == MATCH_OUTPUT) std::swap(loop_.ilabel, loop_.olabel);\n  }\n\n  ComposeFstMatcher<CacheStore, Filter, StateTable> *Copy(\n      bool safe = false) const override {\n    return new ComposeFstMatcher<CacheStore, Filter, StateTable>(*this, safe);\n  }\n\n  MatchType Type(bool test) const override {\n    if ((matcher1_->Type(test) == MATCH_NONE) ||\n        (matcher2_->Type(test) == MATCH_NONE)) {\n      return MATCH_NONE;\n    }\n    if (((matcher1_->Type(test) == MATCH_UNKNOWN) &&\n         (matcher2_->Type(test) == MATCH_UNKNOWN)) ||\n        ((matcher1_->Type(test) == MATCH_UNKNOWN) &&\n         (matcher2_->Type(test) == match_type_)) ||\n        ((matcher1_->Type(test) == match_type_) &&\n         (matcher2_->Type(test) == MATCH_UNKNOWN))) {\n      return MATCH_UNKNOWN;\n    }\n    if ((matcher1_->Type(test) == match_type_) &&\n        (matcher2_->Type(test) == match_type_)) {\n      return match_type_;\n    }\n    return MATCH_NONE;\n  }\n\n  const Fst<Arc> &GetFst() const override { return fst_; }\n\n  uint64_t Properties(uint64_t inprops) const override {\n    return inprops;\n  }\n\n  void SetState(StateId s) final {\n    if (s_ == s) return;\n    s_ = s;\n    const auto &tuple = impl_->state_table_->Tuple(s);\n    matcher1_->SetState(tuple.StateId1());\n    matcher2_->SetState(tuple.StateId2());\n    loop_.nextstate = s_;\n  }\n\n  bool Find(Label label) final {\n    bool found = false;\n    current_loop_ = false;\n    if (label == 0) {\n      current_loop_ = true;\n      found = true;\n    }\n    if (match_type_ == MATCH_INPUT) {\n      found = found || FindLabel(label, matcher1_.get(), matcher2_.get());\n    } else {  // match_type_ == MATCH_OUTPUT\n      found = found || FindLabel(label, matcher2_.get(), matcher1_.get());\n    }\n    return found;\n  }\n\n  bool Done() const final {\n    return !current_loop_ && matcher1_->Done() && matcher2_->Done();\n  }\n\n  const Arc &Value() const final { return current_loop_ ? loop_ : arc_; }\n\n  void Next() final {\n    if (current_loop_) {\n      current_loop_ = false;\n    } else if (match_type_ == MATCH_INPUT) {\n      FindNext(matcher1_.get(), matcher2_.get());\n    } else {  // match_type_ == MATCH_OUTPUT\n      FindNext(matcher2_.get(), matcher1_.get());\n    }\n  }\n\n  std::ptrdiff_t Priority(StateId s) final { return fst_.NumArcs(s); }\n\n private:\n  // Processes a match with the filter and creates resulting arc.\n  bool MatchArc(StateId s, Arc arc1,\n                Arc arc2) {  // FIXME(kbg): copy but not assignment.\n    const auto &fs = impl_->filter_->FilterArc(&arc1, &arc2);\n    if (fs == FilterState::NoState()) return false;\n    const StateTuple tuple(arc1.nextstate, arc2.nextstate, fs);\n    arc_.ilabel = arc1.ilabel;\n    arc_.olabel = arc2.olabel;\n    arc_.weight = Times(arc1.weight, arc2.weight);\n    arc_.nextstate = impl_->state_table_->FindState(tuple);\n    return true;\n  }\n\n  // Finds the first match allowed by the filter.\n  template <class MatcherA, class MatcherB>\n  bool FindLabel(Label label, MatcherA *matchera, MatcherB *matcherb) {\n    if (matchera->Find(label)) {\n      matcherb->Find(match_type_ == MATCH_INPUT ? matchera->Value().olabel\n                                                : matchera->Value().ilabel);\n      return FindNext(matchera, matcherb);\n    }\n    return false;\n  }\n\n  // Finds the next match allowed by the filter, returning true iff such a\n  // match is found.\n  template <class MatcherA, class MatcherB>\n  bool FindNext(MatcherA *matchera, MatcherB *matcherb) {\n    // State when entering this function:\n    // 'matchera' is pointed to a match x, y for label x, and a match for y was\n    // requested on 'matcherb'.\n    while (!matchera->Done() || !matcherb->Done()) {\n      if (matcherb->Done()) {\n        // If no more matches for y on 'matcherb', moves forward on 'matchera'\n        // until a match x, y' is found such that there is a match for y' on\n        // 'matcherb'.\n        matchera->Next();\n        while (!matchera->Done() &&\n               !matcherb->Find(match_type_ == MATCH_INPUT\n                                   ? matchera->Value().olabel\n                                   : matchera->Value().ilabel)) {\n          matchera->Next();\n        }\n      }\n      while (!matcherb->Done()) {\n        // 'matchera' is pointing to a match x, y' ('arca') and 'matcherb' is\n        // pointing to a match y', z' ('arcb'). If combining these two arcs is\n        // allowed by the filter (hence resulting in an arc x, z') return true.\n        // Position 'matcherb' on the next potential match for y' before\n        // returning.\n        const auto &arca = matchera->Value();\n        const auto &arcb = matcherb->Value();\n        // Position 'matcherb' on the next potential match for y'.\n        matcherb->Next();\n        // Returns true If combining these two arcs is allowed by the filter\n        // (hence resulting in an arc x, z'); otherwise consider next match\n        // for y' on 'matcherb'.\n        if (MatchArc(s_, match_type_ == MATCH_INPUT ? arca : arcb,\n                     match_type_ == MATCH_INPUT ? arcb : arca)) {\n          return true;\n        }\n      }\n    }\n    // Both 'matchera' and 'matcherb' are done, no more match to analyse.\n    return false;\n  }\n\n  std::unique_ptr<const ComposeFst<Arc, CacheStore>> owned_fst_;\n  const ComposeFst<Arc, CacheStore> &fst_;\n  const Impl *impl_;\n  StateId s_;\n  MatchType match_type_;\n  std::unique_ptr<Matcher1> matcher1_;\n  std::unique_ptr<Matcher2> matcher2_;\n  bool current_loop_;\n  Arc loop_;\n  Arc arc_;\n};\n\n// Useful alias when using StdArc.\nusing StdComposeFst = ComposeFst<StdArc>;\n\nenum ComposeFilter {\n  AUTO_FILTER,\n  NULL_FILTER,\n  TRIVIAL_FILTER,\n  SEQUENCE_FILTER,\n  ALT_SEQUENCE_FILTER,\n  MATCH_FILTER\n};\n\nstruct ComposeOptions {\n  bool connect;               // Connect output?\n  ComposeFilter filter_type;  // Pre-defined filter to use.\n\n  explicit ComposeOptions(bool connect = true,\n                          ComposeFilter filter_type = AUTO_FILTER)\n      : connect(connect), filter_type(filter_type) {}\n};\n\n// Computes the composition of two transducers. This version writes\n// the composed FST into a MutableFst. If FST1 transduces string x to\n// y with weight a and FST2 transduces y to z with weight b, then\n// their composition transduces string x to z with weight\n// Times(x, z).\n//\n// The output labels of the first transducer or the input labels of\n// the second transducer must be sorted.  The weights need to form a\n// commutative semiring (valid for TropicalWeight and LogWeight).\n//\n// Complexity:\n//\n// Assuming the first FST is unsorted and the second is sorted:\n//\n//   Time: O(V1 V2 D1 (log D2 + M2)),\n//   Space: O(V1 V2 D1 M2)\n//\n// where Vi = # of states, Di = maximum out-degree, and Mi is the maximum\n// multiplicity, for the ith FST.\n//\n// Caveats:\n//\n// - Compose trims its output.\n// - The efficiency of composition can be strongly affected by several factors:\n//   - the choice of which transducer is sorted - prefer sorting the FST\n//     that has the greater average out-degree.\n//   - the amount of non-determinism\n//   - the presence and location of epsilon transitions - avoid epsilon\n//     transitions on the output side of the first transducer or\n//     the input side of the second transducer or prefer placing\n//     them later in a path since they delay matching and can\n//     introduce non-coaccessible states and transitions.\ntemplate <class Arc>\nvoid Compose(const Fst<Arc> &ifst1, const Fst<Arc> &ifst2,\n             MutableFst<Arc> *ofst,\n             const ComposeOptions &opts = ComposeOptions()) {\n  using M = Matcher<Fst<Arc>>;\n  // In each case, we cache only the last state for fastest copy.\n  switch (opts.filter_type) {\n    case AUTO_FILTER: {\n      CacheOptions nopts;\n      nopts.gc_limit = 0;\n      *ofst = ComposeFst<Arc>(ifst1, ifst2, nopts);\n      break;\n    }\n    case NULL_FILTER: {\n      ComposeFstOptions<Arc, M, NullComposeFilter<M>> copts;\n      copts.gc_limit = 0;\n      *ofst = ComposeFst<Arc>(ifst1, ifst2, copts);\n      break;\n    }\n    case SEQUENCE_FILTER: {\n      ComposeFstOptions<Arc, M, SequenceComposeFilter<M>> copts;\n      copts.gc_limit = 0;\n      *ofst = ComposeFst<Arc>(ifst1, ifst2, copts);\n      break;\n    }\n    case ALT_SEQUENCE_FILTER: {\n      ComposeFstOptions<Arc, M, AltSequenceComposeFilter<M>> copts;\n      copts.gc_limit = 0;\n      *ofst = ComposeFst<Arc>(ifst1, ifst2, copts);\n      break;\n    }\n    case MATCH_FILTER: {\n      ComposeFstOptions<Arc, M, MatchComposeFilter<M>> copts;\n      copts.gc_limit = 0;\n      *ofst = ComposeFst<Arc>(ifst1, ifst2, copts);\n      break;\n    }\n    case TRIVIAL_FILTER: {\n      ComposeFstOptions<Arc, M, TrivialComposeFilter<M>> copts;\n      copts.gc_limit = 0;\n      *ofst = ComposeFst<Arc>(ifst1, ifst2, copts);\n      break;\n    }\n  }\n  if (opts.connect) Connect(ofst);\n}\n\n}  // namespace fst\n\n#endif  // FST_COMPOSE_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/concat.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Functions and classes to compute the concatenation of two FSTs.\n\n#ifndef FST_CONCAT_H_\n#define FST_CONCAT_H_\n\n#include <algorithm>\n#include <vector>\n\n#include <fst/mutable-fst.h>\n#include <fst/rational.h>\n\n\nnamespace fst {\n\n// Computes the concatenation (product) of two FSTs. If FST1 transduces string\n// x to y with weight a and FST2 transduces string w to v with weight b, then\n// their concatenation transduces string xw to yv with weight Times(a, b).\n//\n// This version modifies its MutableFst argument (in first position).\n//\n// Complexity:\n//\n//   Time: O(V1 + V2 + E2)\n//   Space: O(V1 + V2 + E2)\n//\n// where Vi is the number of states, and Ei is the number of arcs, of the ith\n// FST.\ntemplate <class Arc>\nvoid Concat(MutableFst<Arc> *fst1, const Fst<Arc> &fst2) {\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n  // Checks that the symbol table are compatible.\n  if (!CompatSymbols(fst1->InputSymbols(), fst2.InputSymbols()) ||\n      !CompatSymbols(fst1->OutputSymbols(), fst2.OutputSymbols())) {\n    FSTERROR() << \"Concat: Input/output symbol tables of 1st argument \"\n               << \"does not match input/output symbol tables of 2nd argument\";\n    fst1->SetProperties(kError, kError);\n    return;\n  }\n  const auto props1 = fst1->Properties(kFstProperties, false);\n  const auto props2 = fst2.Properties(kFstProperties, false);\n  const auto start1 = fst1->Start();\n  if (start1 == kNoStateId) {\n    if (props2 & kError) fst1->SetProperties(kError, kError);\n    return;\n  }\n  const auto numstates1 = fst1->NumStates();\n  if (fst2.Properties(kExpanded, false)) {\n    fst1->ReserveStates(numstates1 + CountStates(fst2));\n  }\n  for (StateIterator<Fst<Arc>> siter2(fst2); !siter2.Done(); siter2.Next()) {\n    const auto s1 = fst1->AddState();\n    const auto s2 = siter2.Value();\n    fst1->SetFinal(s1, fst2.Final(s2));\n    fst1->ReserveArcs(s1, fst2.NumArcs(s2));\n    for (ArcIterator<Fst<Arc>> aiter(fst2, s2); !aiter.Done(); aiter.Next()) {\n      auto arc = aiter.Value();\n      arc.nextstate += numstates1;\n      fst1->AddArc(s1, arc);\n    }\n  }\n  const auto start2 = fst2.Start();\n  for (StateId s1 = 0; s1 < numstates1; ++s1) {\n    const auto weight = fst1->Final(s1);\n    if (weight != Weight::Zero()) {\n      fst1->SetFinal(s1, Weight::Zero());\n      if (start2 != kNoStateId) {\n        fst1->AddArc(s1, Arc(0, 0, weight, start2 + numstates1));\n      }\n    }\n  }\n  if (start2 != kNoStateId) {\n    fst1->SetProperties(ConcatProperties(props1, props2), kFstProperties);\n  }\n}\n\n// Computes the concatentation of two FSTs.  This version modifies its\n// MutableFst argument (in second position).\n//\n// Complexity:\n//\n//   Time: O(V1 + E1)\n//   Space: O(V1 + E1)\n//\n// where Vi is the number of states, and Ei is the number of arcs, of the ith\n// FST.\ntemplate <class Arc>\nvoid Concat(const Fst<Arc> &fst1, MutableFst<Arc> *fst2) {\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n  // Checks that the symbol table are compatible.\n  if (!CompatSymbols(fst1.InputSymbols(), fst2->InputSymbols()) ||\n      !CompatSymbols(fst1.OutputSymbols(), fst2->OutputSymbols())) {\n    FSTERROR() << \"Concat: Input/output symbol tables of 1st argument \"\n               << \"does not match input/output symbol tables of 2nd argument\";\n    fst2->SetProperties(kError, kError);\n    return;\n  }\n  const auto props1 = fst1.Properties(kFstProperties, false);\n  const auto props2 = fst2->Properties(kFstProperties, false);\n  const auto start2 = fst2->Start();\n  if (start2 == kNoStateId) {\n    if (props1 & kError) fst2->SetProperties(kError, kError);\n    return;\n  }\n  const auto numstates2 = fst2->NumStates();\n  if (fst1.Properties(kExpanded, false)) {\n    fst2->ReserveStates(numstates2 + CountStates(fst1));\n  }\n  for (StateIterator<Fst<Arc>> siter(fst1); !siter.Done(); siter.Next()) {\n    const auto s1 = siter.Value();\n    const auto s2 = fst2->AddState();\n    const auto weight = fst1.Final(s1);\n    if (weight != Weight::Zero()) {\n      fst2->ReserveArcs(s2, fst1.NumArcs(s1) + 1);\n      fst2->AddArc(s2, Arc(0, 0, weight, start2));\n    } else {\n      fst2->ReserveArcs(s2, fst1.NumArcs(s1));\n    }\n    for (ArcIterator<Fst<Arc>> aiter(fst1, s1); !aiter.Done(); aiter.Next()) {\n      auto arc = aiter.Value();\n      arc.nextstate += numstates2;\n      fst2->AddArc(s2, arc);\n    }\n  }\n  const auto start1 = fst1.Start();\n  if (start1 != kNoStateId) {\n    fst2->SetStart(start1 + numstates2);\n    fst2->SetProperties(ConcatProperties(props1, props2), kFstProperties);\n  } else {\n    fst2->SetStart(fst2->AddState());\n  }\n}\n\n// Computes the concatentation of two FSTs. This version modifies its\n// RationalFst input (in first position).\ntemplate <class Arc>\nvoid Concat(RationalFst<Arc> *fst1, const Fst<Arc> &fst2) {\n  fst1->GetMutableImpl()->AddConcat(fst2, true);\n}\n\n// Computes the concatentation of two FSTs. This version modifies its\n// RationalFst input (in second position).\ntemplate <class Arc>\nvoid Concat(const Fst<Arc> &fst1, RationalFst<Arc> *fst2) {\n  fst2->GetMutableImpl()->AddConcat(fst1, false);\n}\n\nusing ConcatFstOptions = RationalFstOptions;\n\n// Computes the concatenation (product) of two FSTs; this version is a delayed\n// FST. If FST1 transduces string x to y with weight a and FST2 transduces\n// string w to v with weight b, then their concatenation transduces string xw\n// to yv with Times(a, b).\n//\n// Complexity:\n//\n//   Time: O(v1 + e1 + v2 + e2),\n//   Space: O(v1 + v2)\n//\n// where vi is the number of states visited, and ei is the number of arcs\n// visited, of the ith FST. Constant time and space to visit an input state or\n// arc is assumed and exclusive of caching.\ntemplate <class A>\nclass ConcatFst : public RationalFst<A> {\n public:\n  using Arc = A;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  ConcatFst(const Fst<Arc> &fst1, const Fst<Arc> &fst2) {\n    GetMutableImpl()->InitConcat(fst1, fst2);\n  }\n\n  ConcatFst(const Fst<Arc> &fst1, const Fst<Arc> &fst2,\n            const ConcatFstOptions &opts)\n      : RationalFst<Arc>(opts) {\n    GetMutableImpl()->InitConcat(fst1, fst2);\n  }\n\n  // See Fst<>::Copy() for doc.\n  ConcatFst(const ConcatFst<Arc> &fst, bool safe = false)\n      : RationalFst<Arc>(fst, safe) {}\n\n  // Get a copy of this ConcatFst. See Fst<>::Copy() for further doc.\n  ConcatFst<Arc> *Copy(bool safe = false) const override {\n    return new ConcatFst<Arc>(*this, safe);\n  }\n\n private:\n  using ImplToFst<internal::RationalFstImpl<Arc>>::GetImpl;\n  using ImplToFst<internal::RationalFstImpl<Arc>>::GetMutableImpl;\n};\n\n// Specialization for ConcatFst.\ntemplate <class Arc>\nclass StateIterator<ConcatFst<Arc>> : public StateIterator<RationalFst<Arc>> {\n public:\n  explicit StateIterator(const ConcatFst<Arc> &fst)\n      : StateIterator<RationalFst<Arc>>(fst) {}\n};\n\n// Specialization for ConcatFst.\ntemplate <class Arc>\nclass ArcIterator<ConcatFst<Arc>> : public ArcIterator<RationalFst<Arc>> {\n public:\n  using StateId = typename Arc::StateId;\n\n  ArcIterator(const ConcatFst<Arc> &fst, StateId s)\n      : ArcIterator<RationalFst<Arc>>(fst, s) {}\n};\n\n// Useful alias when using StdArc.\nusing StdConcatFst = ConcatFst<StdArc>;\n\n}  // namespace fst\n\n#endif  // FST_CONCAT_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/config.h",
    "content": "// Windows-specific OpenFst config file\n// No dynamic registration.\n#define FST_NO_DYNAMIC_LINKING 1\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/config.h.in",
    "content": "// OpenFst config file \n\n/* Define to 1 if you have the ICU library. */\n#undef HAVE_ICU\n\n/* Define to 1 if the system has the type `std::tr1::hash<long long\n   unsigned>'. */\n#define HAVE_STD__TR1__HASH_LONG_LONG_UNSIGNED_ 1\n\n/* Define to 1 if the system has the type `__gnu_cxx::slist<int>'. */\n#define HAVE___GNU_CXX__SLIST_INT_ 1\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/connect.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Classes and functions to remove unsuccessful paths from an FST.\n\n#ifndef FST_CONNECT_H_\n#define FST_CONNECT_H_\n\n#include <vector>\n\n#include <fst/dfs-visit.h>\n#include <fst/mutable-fst.h>\n#include <fst/union-find.h>\n\n\nnamespace fst {\n\n// Finds and returns connected components. Use with Visit().\ntemplate <class Arc>\nclass CcVisitor {\n public:\n  using Weight = typename Arc::Weight;\n  using StateId = typename Arc::StateId;\n\n  // cc[i]: connected component number for state i.\n  explicit CcVisitor(std::vector<StateId> *cc)\n      : comps_(new UnionFind<StateId>(0, kNoStateId)), cc_(cc), nstates_(0) {}\n\n  // comps: connected components equiv classes.\n  explicit CcVisitor(UnionFind<StateId> *comps)\n      : comps_(comps), cc_(nullptr), nstates_(0) {}\n\n  ~CcVisitor() {\n    if (cc_) delete comps_;\n  }\n\n  void InitVisit(const Fst<Arc> &fst) {}\n\n  bool InitState(StateId s, StateId root) {\n    ++nstates_;\n    if (comps_->FindSet(s) == kNoStateId) comps_->MakeSet(s);\n    return true;\n  }\n\n  bool WhiteArc(StateId s, const Arc &arc) {\n    comps_->MakeSet(arc.nextstate);\n    comps_->Union(s, arc.nextstate);\n    return true;\n  }\n\n  bool GreyArc(StateId s, const Arc &arc) {\n    comps_->Union(s, arc.nextstate);\n    return true;\n  }\n\n  bool BlackArc(StateId s, const Arc &arc) {\n    comps_->Union(s, arc.nextstate);\n    return true;\n  }\n\n  void FinishState(StateId s) {}\n\n  void FinishVisit() {\n    if (cc_) GetCcVector(cc_);\n  }\n\n  // Returns number of components.\n  // cc[i]: connected component number for state i.\n  int GetCcVector(std::vector<StateId> *cc) {\n    cc->clear();\n    cc->resize(nstates_, kNoStateId);\n    StateId ncomp = 0;\n    for (StateId s = 0; s < nstates_; ++s) {\n      const auto rep = comps_->FindSet(s);\n      auto &comp = (*cc)[rep];\n      if (comp == kNoStateId) {\n        comp = ncomp;\n        ++ncomp;\n      }\n      (*cc)[s] = comp;\n    }\n    return ncomp;\n  }\n\n private:\n  UnionFind<StateId> *comps_;  // Components.\n  std::vector<StateId> *cc_;   // State's cc number.\n  StateId nstates_;            // State count.\n};\n\n// Finds and returns strongly-connected components, accessible and\n// coaccessible states and related properties. Uses Tarjan's single\n// DFS SCC algorithm (see Aho, et al, \"Design and Analysis of Computer\n// Algorithms\", 189pp). Use with DfsVisit();\ntemplate <class Arc>\nclass SccVisitor {\n public:\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  // scc[i]: strongly-connected component number for state i.\n  //   SCC numbers will be in topological order for acyclic input.\n  // access[i]: accessibility of state i.\n  // coaccess[i]: coaccessibility of state i.\n  // Any of above can be NULL.\n  // props: related property bits (cyclicity, initial cyclicity,\n  //   accessibility, coaccessibility) set/cleared (o.w. unchanged).\n  SccVisitor(std::vector<StateId> *scc, std::vector<bool> *access,\n             std::vector<bool> *coaccess, uint64_t *props)\n      : scc_(scc), access_(access), coaccess_(coaccess), props_(props) {}\n  explicit SccVisitor(uint64_t *props)\n      : scc_(nullptr), access_(nullptr), coaccess_(nullptr), props_(props) {}\n\n  void InitVisit(const Fst<Arc> &fst);\n\n  bool InitState(StateId s, StateId root);\n\n  bool TreeArc(StateId s, const Arc &arc) { return true; }\n\n  bool BackArc(StateId s, const Arc &arc) {\n    const auto t = arc.nextstate;\n    if ((*dfnumber_)[t] < (*lowlink_)[s]) (*lowlink_)[s] = (*dfnumber_)[t];\n    if ((*coaccess_)[t]) (*coaccess_)[s] = true;\n    *props_ |= kCyclic;\n    *props_ &= ~kAcyclic;\n    if (t == start_) {\n      *props_ |= kInitialCyclic;\n      *props_ &= ~kInitialAcyclic;\n    }\n    return true;\n  }\n\n  bool ForwardOrCrossArc(StateId s, const Arc &arc) {\n    const auto t = arc.nextstate;\n    if ((*dfnumber_)[t] < (*dfnumber_)[s] /* cross edge */ && (*onstack_)[t] &&\n        (*dfnumber_)[t] < (*lowlink_)[s]) {\n      (*lowlink_)[s] = (*dfnumber_)[t];\n    }\n    if ((*coaccess_)[t]) (*coaccess_)[s] = true;\n    return true;\n  }\n\n  // Last argument always ignored, but required by the interface.\n  void FinishState(StateId state, StateId p, const Arc *);\n\n  void FinishVisit() {\n    // Numbers SCCs in topological order when acyclic.\n    if (scc_) {\n      for (StateId s = 0; s < scc_->size(); ++s) {\n        (*scc_)[s] = nscc_ - 1 - (*scc_)[s];\n      }\n    }\n    if (coaccess_internal_) delete coaccess_;\n    dfnumber_.reset();\n    lowlink_.reset();\n    onstack_.reset();\n    scc_stack_.reset();\n  }\n\n private:\n  std::vector<StateId> *scc_;    // State's scc number.\n  std::vector<bool> *access_;    // State's accessibility.\n  std::vector<bool> *coaccess_;  // State's coaccessibility.\n  uint64_t *props_;\n  const Fst<Arc> *fst_;\n  StateId start_;\n  StateId nstates_;  // State count.\n  StateId nscc_;     // SCC count.\n  bool coaccess_internal_;\n  std::unique_ptr<std::vector<StateId>> dfnumber_;  // State discovery times.\n  std::unique_ptr<std::vector<StateId>>\n      lowlink_;  // lowlink[state] == dfnumber[state] => SCC root\n  std::unique_ptr<std::vector<bool>> onstack_;  // Is a state on the SCC stack?\n  std::unique_ptr<std::vector<StateId>>\n      scc_stack_;  // SCC stack, with random access.\n};\n\ntemplate <class Arc>\ninline void SccVisitor<Arc>::InitVisit(const Fst<Arc> &fst) {\n  if (scc_) scc_->clear();\n  if (access_) access_->clear();\n  if (coaccess_) {\n    coaccess_->clear();\n    coaccess_internal_ = false;\n  } else {\n    coaccess_ = new std::vector<bool>;\n    coaccess_internal_ = true;\n  }\n  *props_ |= kAcyclic | kInitialAcyclic | kAccessible | kCoAccessible;\n  *props_ &= ~(kCyclic | kInitialCyclic | kNotAccessible | kNotCoAccessible);\n  fst_ = &fst;\n  start_ = fst.Start();\n  nstates_ = 0;\n  nscc_ = 0;\n  dfnumber_.reset(new std::vector<StateId>());\n  lowlink_.reset(new std::vector<StateId>());\n  onstack_.reset(new std::vector<bool>());\n  scc_stack_.reset(new std::vector<StateId>());\n}\n\ntemplate <class Arc>\ninline bool SccVisitor<Arc>::InitState(StateId s, StateId root) {\n  scc_stack_->push_back(s);\n  while (dfnumber_->size() <= s) {\n    if (scc_) scc_->push_back(-1);\n    if (access_) access_->push_back(false);\n    coaccess_->push_back(false);\n    dfnumber_->push_back(-1);\n    lowlink_->push_back(-1);\n    onstack_->push_back(false);\n  }\n  (*dfnumber_)[s] = nstates_;\n  (*lowlink_)[s] = nstates_;\n  (*onstack_)[s] = true;\n  if (root == start_) {\n    if (access_) (*access_)[s] = true;\n  } else {\n    if (access_) (*access_)[s] = false;\n    *props_ |= kNotAccessible;\n    *props_ &= ~kAccessible;\n  }\n  ++nstates_;\n  return true;\n}\n\ntemplate <class Arc>\ninline void SccVisitor<Arc>::FinishState(StateId s, StateId p, const Arc *) {\n  if (fst_->Final(s) != Weight::Zero()) (*coaccess_)[s] = true;\n  if ((*dfnumber_)[s] == (*lowlink_)[s]) {  // Root of new SCC.\n    bool scc_coaccess = false;\n    auto i = scc_stack_->size();\n    StateId t;\n    do {\n      t = (*scc_stack_)[--i];\n      if ((*coaccess_)[t]) scc_coaccess = true;\n    } while (s != t);\n    do {\n      t = scc_stack_->back();\n      if (scc_) (*scc_)[t] = nscc_;\n      if (scc_coaccess) (*coaccess_)[t] = true;\n      (*onstack_)[t] = false;\n      scc_stack_->pop_back();\n    } while (s != t);\n    if (!scc_coaccess) {\n      *props_ |= kNotCoAccessible;\n      *props_ &= ~kCoAccessible;\n    }\n    ++nscc_;\n  }\n  if (p != kNoStateId) {\n    if ((*coaccess_)[s]) (*coaccess_)[p] = true;\n    if ((*lowlink_)[s] < (*lowlink_)[p]) (*lowlink_)[p] = (*lowlink_)[s];\n  }\n}\n\n// Trims an FST, removing states and arcs that are not on successful paths.\n// This version modifies its input.\n//\n// Complexity:\n//\n//   Time:  O(V + E)\n//   Space: O(V + E)\n//\n// where V = # of states and E = # of arcs.\ntemplate <class Arc>\nvoid Connect(MutableFst<Arc> *fst) {\n  using StateId = typename Arc::StateId;\n  std::vector<bool> access;\n  std::vector<bool> coaccess;\n  uint64_t props = 0;\n  SccVisitor<Arc> scc_visitor(nullptr, &access, &coaccess, &props);\n  DfsVisit(*fst, &scc_visitor);\n  std::vector<StateId> dstates;\n  for (StateId s = 0; s < access.size(); ++s) {\n    if (!access[s] || !coaccess[s]) dstates.push_back(s);\n  }\n  fst->DeleteStates(dstates);\n  fst->SetProperties(kAccessible | kCoAccessible, kAccessible | kCoAccessible);\n}\n\n// Returns an acyclic FST where each SCC in the input FST has been condensed to\n// a single state with transitions between SCCs retained and within SCCs\n// dropped. Also populates 'scc' with a mapping from input to output states.\ntemplate <class Arc>\nvoid Condense(const Fst<Arc> &ifst, MutableFst<Arc> *ofst,\n              std::vector<typename Arc::StateId> *scc) {\n  using StateId = typename Arc::StateId;\n  ofst->DeleteStates();\n  uint64_t props = 0;\n  SccVisitor<Arc> scc_visitor(scc, nullptr, nullptr, &props);\n  DfsVisit(ifst, &scc_visitor);\n  for (StateId s = 0; s < scc->size(); ++s) {\n    const auto c = (*scc)[s];\n    while (c >= ofst->NumStates()) ofst->AddState();\n    if (s == ifst.Start()) ofst->SetStart(c);\n    const auto weight = ifst.Final(s);\n    if (weight != Arc::Weight::Zero())\n      ofst->SetFinal(c, Plus(ofst->Final(c), weight));\n    for (ArcIterator<Fst<Arc>> aiter(ifst, s); !aiter.Done(); aiter.Next()) {\n      auto arc = aiter.Value();\n      const auto nextc = (*scc)[arc.nextstate];\n      if (nextc != c) {\n        while (nextc >= ofst->NumStates()) ofst->AddState();\n        arc.nextstate = nextc;\n        ofst->AddArc(c, arc);\n      }\n    }\n  }\n  ofst->SetProperties(kAcyclic | kInitialAcyclic, kAcyclic | kInitialAcyclic);\n}\n\n}  // namespace fst\n\n#endif  // FST_CONNECT_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/const-fst.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Simple concrete immutable FST whose states and arcs are each stored in\n// single arrays.\n\n#ifndef FST_CONST_FST_H_\n#define FST_CONST_FST_H_\n\n#include <climits>\n#include <string>\n#include <vector>\n\n// Google-only...\n// ...Google-only\n#include <fst/log.h>\n\n#include <fst/expanded-fst.h>\n#include <fst/fst-decl.h>\n#include <fst/mapped-file.h>\n#include <fst/test-properties.h>\n#include <fst/util.h>\n\n\nnamespace fst {\n\ntemplate <class A, class Unsigned>\nclass ConstFst;\n\ntemplate <class F, class G>\nvoid Cast(const F &, G *);\n\nnamespace internal {\n\n// States and arcs each implemented by single arrays, templated on the\n// Arc definition. Unsigned is used to represent indices into the arc array.\ntemplate <class A, class Unsigned>\nclass ConstFstImpl : public FstImpl<A> {\n public:\n  using Arc = A;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using FstImpl<A>::SetInputSymbols;\n  using FstImpl<A>::SetOutputSymbols;\n  using FstImpl<A>::SetType;\n  using FstImpl<A>::SetProperties;\n  using FstImpl<A>::Properties;\n\n  ConstFstImpl()\n      : states_(nullptr),\n        arcs_(nullptr),\n        nstates_(0),\n        narcs_(0),\n        start_(kNoStateId) {\n    string type = \"const\";\n    if (sizeof(Unsigned) != sizeof(uint32_t)) {\n      type += std::to_string(CHAR_BIT * sizeof(Unsigned));\n    }\n    SetType(type);\n    SetProperties(kNullProperties | kStaticProperties);\n  }\n\n  explicit ConstFstImpl(const Fst<Arc> &fst);\n\n  StateId Start() const { return start_; }\n\n  Weight Final(StateId s) const { return states_[s].weight; }\n\n  StateId NumStates() const { return nstates_; }\n\n  size_t NumArcs(StateId s) const { return states_[s].narcs; }\n\n  size_t NumInputEpsilons(StateId s) const { return states_[s].niepsilons; }\n\n  size_t NumOutputEpsilons(StateId s) const { return states_[s].noepsilons; }\n\n  static ConstFstImpl<Arc, Unsigned> *Read(std::istream &strm,\n                                           const FstReadOptions &opts);\n\n  const Arc *Arcs(StateId s) const { return arcs_ + states_[s].pos; }\n\n  // Provide information needed for generic state iterator.\n  void InitStateIterator(StateIteratorData<Arc> *data) const {\n    data->base = nullptr;\n    data->nstates = nstates_;\n  }\n\n  // Provide information needed for the generic arc iterator.\n  void InitArcIterator(StateId s, ArcIteratorData<Arc> *data) const {\n    data->base = nullptr;\n    data->arcs = arcs_ + states_[s].pos;\n    data->narcs = states_[s].narcs;\n    data->ref_count = nullptr;\n  }\n\n private:\n  // Used to find narcs_ and nstates_ in Write.\n  friend class ConstFst<Arc, Unsigned>;\n\n  // States implemented by array *states_ below, arcs by (single) *arcs_.\n  struct ConstState {\n    Weight weight;        // Final weight.\n    Unsigned pos;         // Start of state's arcs in *arcs_.\n    Unsigned narcs;       // Number of arcs (per state).\n    Unsigned niepsilons;  // Number of input epsilons.\n    Unsigned noepsilons;  // Number of output epsilons.\n\n    ConstState() : weight(Weight::Zero()) {}\n  };\n\n  // Properties always true of this FST class.\n  static constexpr uint64_t kStaticProperties = kExpanded;\n  // Current unaligned file format version. The unaligned version was added and\n  // made the default since the aligned version does not work on pipes.\n  static constexpr int kFileVersion = 2;\n  // Current aligned file format version.\n  static constexpr int kAlignedFileVersion = 1;\n  // Minimum file format version supported.\n  static constexpr int kMinFileVersion = 1;\n\n  std::unique_ptr<MappedFile> states_region_;  // Mapped file for states.\n  std::unique_ptr<MappedFile> arcs_region_;    // Mapped file for arcs.\n  ConstState *states_;                         // States representation.\n  Arc *arcs_;                                  // Arcs representation.\n  StateId nstates_;                            // Number of states.\n  size_t narcs_;                               // Number of arcs.\n  StateId start_;                              // Initial state.\n\n  ConstFstImpl(const ConstFstImpl &) = delete;\n  ConstFstImpl &operator=(const ConstFstImpl &) = delete;\n};\n\ntemplate <class Arc, class Unsigned>\nconstexpr uint64_t ConstFstImpl<Arc, Unsigned>::kStaticProperties;\n\ntemplate <class Arc, class Unsigned>\nconstexpr int ConstFstImpl<Arc, Unsigned>::kFileVersion;\n\ntemplate <class Arc, class Unsigned>\nconstexpr int ConstFstImpl<Arc, Unsigned>::kAlignedFileVersion;\n\ntemplate <class Arc, class Unsigned>\nconstexpr int ConstFstImpl<Arc, Unsigned>::kMinFileVersion;\n\ntemplate <class Arc, class Unsigned>\nConstFstImpl<Arc, Unsigned>::ConstFstImpl(const Fst<Arc> &fst)\n    : nstates_(0), narcs_(0) {\n  string type = \"const\";\n  if (sizeof(Unsigned) != sizeof(uint32_t)) {\n    type += std::to_string(CHAR_BIT * sizeof(Unsigned));\n  }\n  SetType(type);\n  SetInputSymbols(fst.InputSymbols());\n  SetOutputSymbols(fst.OutputSymbols());\n  start_ = fst.Start();\n  // Counts states and arcs.\n  for (StateIterator<Fst<Arc>> siter(fst); !siter.Done(); siter.Next()) {\n    ++nstates_;\n    for (ArcIterator<Fst<Arc>> aiter(fst, siter.Value()); !aiter.Done();\n         aiter.Next()) {\n      ++narcs_;\n    }\n  }\n  states_region_.reset(MappedFile::Allocate(nstates_ * sizeof(*states_)));\n  arcs_region_.reset(MappedFile::Allocate(narcs_ * sizeof(*arcs_)));\n  states_ = reinterpret_cast<ConstState *>(states_region_->mutable_data());\n  arcs_ = reinterpret_cast<Arc *>(arcs_region_->mutable_data());\n  size_t pos = 0;\n  for (StateId s = 0; s < nstates_; ++s) {\n    states_[s].weight = fst.Final(s);\n    states_[s].pos = pos;\n    states_[s].narcs = 0;\n    states_[s].niepsilons = 0;\n    states_[s].noepsilons = 0;\n    for (ArcIterator<Fst<Arc>> aiter(fst, s); !aiter.Done(); aiter.Next()) {\n      const auto &arc = aiter.Value();\n      ++states_[s].narcs;\n      if (arc.ilabel == 0) ++states_[s].niepsilons;\n      if (arc.olabel == 0) ++states_[s].noepsilons;\n      arcs_[pos] = arc;\n      ++pos;\n    }\n  }\n  const auto props =\n      fst.Properties(kMutable, false)\n          ? fst.Properties(kCopyProperties, true)\n          : CheckProperties(\n                fst, kCopyProperties & ~kWeightedCycles & ~kUnweightedCycles,\n                kCopyProperties);\n  SetProperties(props | kStaticProperties);\n}\n\ntemplate <class Arc, class Unsigned>\nConstFstImpl<Arc, Unsigned> *ConstFstImpl<Arc, Unsigned>::Read(\n    std::istream &strm, const FstReadOptions &opts) {\n  using ConstState = typename ConstFstImpl<Arc, Unsigned>::ConstState;\n  std::unique_ptr<ConstFstImpl<Arc, Unsigned>> impl(\n      new ConstFstImpl<Arc, Unsigned>());\n  FstHeader hdr;\n  if (!impl->ReadHeader(strm, opts, kMinFileVersion, &hdr)) return nullptr;\n  impl->start_ = hdr.Start();\n  impl->nstates_ = hdr.NumStates();\n  impl->narcs_ = hdr.NumArcs();\n  // Ensures compatibility.\n  if (hdr.Version() == kAlignedFileVersion) {\n    hdr.SetFlags(hdr.GetFlags() | FstHeader::IS_ALIGNED);\n  }\n  if ((hdr.GetFlags() & FstHeader::IS_ALIGNED) && !AlignInput(strm)) {\n    LOG(ERROR) << \"ConstFst::Read: Alignment failed: \" << opts.source;\n    return nullptr;\n  }\n  size_t b = impl->nstates_ * sizeof(ConstState);\n  impl->states_region_.reset(\n      MappedFile::Map(&strm, opts.mode == FstReadOptions::MAP, opts.source, b));\n  if (!strm || !impl->states_region_) {\n    LOG(ERROR) << \"ConstFst::Read: Read failed: \" << opts.source;\n    return nullptr;\n  }\n  impl->states_ =\n      reinterpret_cast<ConstState *>(impl->states_region_->mutable_data());\n  if ((hdr.GetFlags() & FstHeader::IS_ALIGNED) && !AlignInput(strm)) {\n    LOG(ERROR) << \"ConstFst::Read: Alignment failed: \" << opts.source;\n    return nullptr;\n  }\n  b = impl->narcs_ * sizeof(Arc);\n  impl->arcs_region_.reset(\n      MappedFile::Map(&strm, opts.mode == FstReadOptions::MAP, opts.source, b));\n  if (!strm || !impl->arcs_region_) {\n    LOG(ERROR) << \"ConstFst::Read: Read failed: \" << opts.source;\n    return nullptr;\n  }\n  impl->arcs_ = reinterpret_cast<Arc *>(impl->arcs_region_->mutable_data());\n  return impl.release();\n}\n\n}  // namespace internal\n\n// Simple concrete immutable FST. This class attaches interface to\n// implementation and handles reference counting, delegating most methods to\n// ImplToExpandedFst. The unsigned type U is used to represent indices into the\n// arc array (default declared in fst-decl.h).\ntemplate <class A, class Unsigned>\nclass ConstFst : public ImplToExpandedFst<internal::ConstFstImpl<A, Unsigned>> {\n public:\n  using Arc = A;\n  using StateId = typename Arc::StateId;\n\n  using Impl = internal::ConstFstImpl<A, Unsigned>;\n  using ConstState = typename Impl::ConstState;\n\n  friend class StateIterator<ConstFst<Arc, Unsigned>>;\n  friend class ArcIterator<ConstFst<Arc, Unsigned>>;\n\n  template <class F, class G>\n  void friend Cast(const F &, G *);\n\n  ConstFst() : ImplToExpandedFst<Impl>(std::make_shared<Impl>()) {}\n\n  explicit ConstFst(const Fst<Arc> &fst)\n      : ImplToExpandedFst<Impl>(std::make_shared<Impl>(fst)) {}\n\n  ConstFst(const ConstFst<A, Unsigned> &fst, bool safe = false)\n      : ImplToExpandedFst<Impl>(fst) {}\n\n  // Gets a copy of this ConstFst. See Fst<>::Copy() for further doc.\n  ConstFst<A, Unsigned> *Copy(bool safe = false) const override {\n    return new ConstFst<A, Unsigned>(*this, safe);\n  }\n\n  // Reads a ConstFst from an input stream, returning nullptr on error.\n  static ConstFst<A, Unsigned> *Read(std::istream &strm,\n                                     const FstReadOptions &opts) {\n    auto *impl = Impl::Read(strm, opts);\n    return impl ? new ConstFst<A, Unsigned>(std::shared_ptr<Impl>(impl))\n                : nullptr;\n  }\n\n  // Read a ConstFst from a file; return nullptr on error; empty filename reads\n  // from standard input.\n  static ConstFst<A, Unsigned> *Read(const string &filename) {\n    auto *impl = ImplToExpandedFst<Impl>::Read(filename);\n    return impl ? new ConstFst<A, Unsigned>(std::shared_ptr<Impl>(impl))\n                : nullptr;\n  }\n\n  bool Write(std::ostream &strm, const FstWriteOptions &opts) const override {\n    return WriteFst(*this, strm, opts);\n  }\n\n  bool Write(const string &filename) const override {\n    return Fst<Arc>::WriteFile(filename);\n  }\n\n  template <class FST>\n  static bool WriteFst(const FST &fst, std::ostream &strm,\n                       const FstWriteOptions &opts);\n\n  void InitStateIterator(StateIteratorData<Arc> *data) const override {\n    GetImpl()->InitStateIterator(data);\n  }\n\n  void InitArcIterator(StateId s, ArcIteratorData<Arc> *data) const override {\n    GetImpl()->InitArcIterator(s, data);\n  }\n\n private:\n  explicit ConstFst(std::shared_ptr<Impl> impl)\n      : ImplToExpandedFst<Impl>(impl) {}\n\n  using ImplToFst<Impl, ExpandedFst<Arc>>::GetImpl;\n\n  // Uses overloading to extract the type of the argument.\n  static const Impl *GetImplIfConstFst(const ConstFst &const_fst) {\n    return const_fst.GetImpl();\n  }\n\n  // NB: this does not give privileged treatment to subtypes of ConstFst.\n  template <typename FST>\n  static Impl *GetImplIfConstFst(const FST &fst) {\n    return nullptr;\n  }\n\n  ConstFst &operator=(const ConstFst &) = delete;\n};\n\n// Writes FST in Const format, potentially with a pass over the machine before\n// writing to compute number of states and arcs.\ntemplate <class Arc, class Unsigned>\ntemplate <class FST>\nbool ConstFst<Arc, Unsigned>::WriteFst(const FST &fst, std::ostream &strm,\n                                       const FstWriteOptions &opts) {\n  const auto file_version =\n      opts.align ? internal::ConstFstImpl<Arc, Unsigned>::kAlignedFileVersion\n                 : internal::ConstFstImpl<Arc, Unsigned>::kFileVersion;\n  size_t num_arcs = 0;    // To silence -Wsometimes-uninitialized warnings.\n  size_t num_states = 0;  // Ditto.\n  size_t start_offset = 0;\n  bool update_header = true;\n  if (const auto *impl = GetImplIfConstFst(fst)) {\n    num_arcs = impl->narcs_;\n    num_states = impl->nstates_;\n    update_header = false;\n  } else if (opts.stream_write || (start_offset = strm.tellp()) == -1) {\n    // precompute values needed for header when we cannot seek to rewrite it.\n    num_arcs = 0;\n    num_states = 0;\n    for (StateIterator<FST> siter(fst); !siter.Done(); siter.Next()) {\n      num_arcs += fst.NumArcs(siter.Value());\n      ++num_states;\n    }\n    update_header = false;\n  }\n  FstHeader hdr;\n  hdr.SetStart(fst.Start());\n  hdr.SetNumStates(num_states);\n  hdr.SetNumArcs(num_arcs);\n  string type = \"const\";\n  if (sizeof(Unsigned) != sizeof(uint32_t)) {\n    type += std::to_string(CHAR_BIT * sizeof(Unsigned));\n  }\n  const auto properties =\n      fst.Properties(kCopyProperties, true) |\n      internal::ConstFstImpl<Arc, Unsigned>::kStaticProperties;\n  internal::FstImpl<Arc>::WriteFstHeader(fst, strm, opts, file_version, type,\n                                         properties, &hdr);\n  if (opts.align && !AlignOutput(strm)) {\n    LOG(ERROR) << \"Could not align file during write after header\";\n    return false;\n  }\n  size_t pos = 0;\n  size_t states = 0;\n  typename ConstFst<Arc, Unsigned>::ConstState state;\n  for (StateIterator<FST> siter(fst); !siter.Done(); siter.Next()) {\n    const auto s = siter.Value();\n    state.weight = fst.Final(s);\n    state.pos = pos;\n    state.narcs = fst.NumArcs(s);\n    state.niepsilons = fst.NumInputEpsilons(s);\n    state.noepsilons = fst.NumOutputEpsilons(s);\n    strm.write(reinterpret_cast<const char *>(&state), sizeof(state));\n    pos += state.narcs;\n    ++states;\n  }\n  hdr.SetNumStates(states);\n  hdr.SetNumArcs(pos);\n  if (opts.align && !AlignOutput(strm)) {\n    LOG(ERROR) << \"Could not align file during write after writing states\";\n  }\n  for (StateIterator<FST> siter(fst); !siter.Done(); siter.Next()) {\n    for (ArcIterator<FST> aiter(fst, siter.Value()); !aiter.Done();\n         aiter.Next()) {\n      const auto &arc = aiter.Value();\n// Google-only...\n#ifdef MEMORY_SANITIZER\n      // arc may contain padding which has unspecified contents. Tell MSAN to\n      // not complain about it when writing it to a file.\n      ANNOTATE_MEMORY_IS_INITIALIZED(reinterpret_cast<const char *>(&arc),\n                                     sizeof(arc));\n#endif\n      // ...Google-only\n      strm.write(reinterpret_cast<const char *>(&arc), sizeof(arc));\n    }\n  }\n  strm.flush();\n  if (!strm) {\n    LOG(ERROR) << \"ConstFst::WriteFst: write failed: \" << opts.source;\n    return false;\n  }\n  if (update_header) {\n    return internal::FstImpl<Arc>::UpdateFstHeader(\n        fst, strm, opts, file_version, type, properties, &hdr, start_offset);\n  } else {\n    if (hdr.NumStates() != num_states) {\n      LOG(ERROR) << \"Inconsistent number of states observed during write\";\n      return false;\n    }\n    if (hdr.NumArcs() != num_arcs) {\n      LOG(ERROR) << \"Inconsistent number of arcs observed during write\";\n      return false;\n    }\n  }\n  return true;\n}\n\n// Specialization for ConstFst; see generic version in fst.h for sample usage\n// (but use the ConstFst type instead). This version should inline.\ntemplate <class Arc, class Unsigned>\nclass StateIterator<ConstFst<Arc, Unsigned>> {\n public:\n  using StateId = typename Arc::StateId;\n\n  explicit StateIterator(const ConstFst<Arc, Unsigned> &fst)\n      : nstates_(fst.GetImpl()->NumStates()), s_(0) {}\n\n  bool Done() const { return s_ >= nstates_; }\n\n  StateId Value() const { return s_; }\n\n  void Next() { ++s_; }\n\n  void Reset() { s_ = 0; }\n\n private:\n  const StateId nstates_;\n  StateId s_;\n};\n\n// Specialization for ConstFst; see generic version in fst.h for sample usage\n// (but use the ConstFst type instead). This version should inline.\ntemplate <class Arc, class Unsigned>\nclass ArcIterator<ConstFst<Arc, Unsigned>> {\n public:\n  using StateId = typename Arc::StateId;\n\n  ArcIterator(const ConstFst<Arc, Unsigned> &fst, StateId s)\n      : arcs_(fst.GetImpl()->Arcs(s)),\n        narcs_(fst.GetImpl()->NumArcs(s)),\n        i_(0) {}\n\n  bool Done() const { return i_ >= narcs_; }\n\n  const Arc &Value() const { return arcs_[i_]; }\n\n  void Next() { ++i_; }\n\n  size_t Position() const { return i_; }\n\n  void Reset() { i_ = 0; }\n\n  void Seek(size_t a) { i_ = a; }\n\n  constexpr uint32_t Flags() const { return kArcValueFlags; }\n\n  void SetFlags(uint32_t, uint32_t) {}\n\n private:\n  const Arc *arcs_;\n  size_t narcs_;\n  size_t i_;\n};\n\n// A useful alias when using StdArc.\nusing StdConstFst = ConstFst<StdArc>;\n\n}  // namespace fst\n\n#endif  // FST_CONST_FST_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/determinize.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Functions and classes to determinize an FST.\n\n#ifndef FST_DETERMINIZE_H_\n#define FST_DETERMINIZE_H_\n\n#include <algorithm>\n#include <climits>\n#include <forward_list>\n#include <map>\n#include <string>\n#include <vector>\n\n#include <fst/log.h>\n\n#include <fst/arc-map.h>\n#include <fst/bi-table.h>\n#include <fst/cache.h>\n#include <fst/factor-weight.h>\n#include <fst/filter-state.h>\n#include <fst/prune.h>\n#include <fst/test-properties.h>\n\n\nnamespace fst {\n\n// Common divisors are used in determinization to compute transition weights.\n// In the simplest case, it is the same as semiring Plus, but other choices\n// permit more efficient determinization when the output contains strings.\n\n// The default common divisor uses the semiring Plus.\ntemplate <class W>\nstruct DefaultCommonDivisor {\n public:\n  using Weight = W;\n\n  Weight operator()(const Weight &w1, const Weight &w2) const {\n    return Plus(w1, w2);\n  }\n};\n\n// The label common divisor for a (left) string semiring selects a single\n// letter common prefix or the empty string. This is used in the\n// determinization of output strings so that at most a single letter will\n// appear in the output of a transtion.\ntemplate <typename Label, StringType S>\nstruct LabelCommonDivisor {\n public:\n  using Weight = StringWeight<Label, S>;\n\n  Weight operator()(const Weight &w1, const Weight &w2) const {\n    typename Weight::Iterator iter1(w1);\n    typename Weight::Iterator iter2(w2);\n    if (!(StringWeight<Label, S>::Properties() & kLeftSemiring)) {\n      FSTERROR() << \"LabelCommonDivisor: Weight needs to be left semiring\";\n      return Weight::NoWeight();\n    } else if (w1.Size() == 0 || w2.Size() == 0) {\n      return Weight::One();\n    } else if (w1 == Weight::Zero()) {\n      return Weight(iter2.Value());\n    } else if (w2 == Weight::Zero()) {\n      return Weight(iter1.Value());\n    } else if (iter1.Value() == iter2.Value()) {\n      return Weight(iter1.Value());\n    } else {\n      return Weight::One();\n    }\n  }\n};\n\n// The gallic common divisor uses the label common divisor on the string\n// component and the common divisor on the weight component, which defaults to\n// the default common divisor.\ntemplate <class Label, class W, GallicType G,\n          class CommonDivisor = DefaultCommonDivisor<W>>\nclass GallicCommonDivisor {\n public:\n  using Weight = GallicWeight<Label, W, G>;\n\n  Weight operator()(const Weight &w1, const Weight &w2) const {\n    return Weight(label_common_divisor_(w1.Value1(), w2.Value1()),\n                  weight_common_divisor_(w1.Value2(), w2.Value2()));\n  }\n\n private:\n  LabelCommonDivisor<Label, GallicStringType(G)> label_common_divisor_;\n  CommonDivisor weight_common_divisor_;\n};\n\n// Specialization for general GALLIC weight.\ntemplate <class Label, class W, class CommonDivisor>\nclass GallicCommonDivisor<Label, W, GALLIC, CommonDivisor> {\n public:\n  using Weight = GallicWeight<Label, W, GALLIC>;\n  using GRWeight = GallicWeight<Label, W, GALLIC_RESTRICT>;\n  using Iterator =\n      UnionWeightIterator<GRWeight, GallicUnionWeightOptions<Label, W>>;\n\n  Weight operator()(const Weight &w1, const Weight &w2) const {\n    auto weight = GRWeight::Zero();\n    for (Iterator iter(w1); !iter.Done(); iter.Next()) {\n      weight = common_divisor_(weight, iter.Value());\n    }\n    for (Iterator iter(w2); !iter.Done(); iter.Next()) {\n      weight = common_divisor_(weight, iter.Value());\n    }\n    return weight == GRWeight::Zero() ? Weight::Zero() : Weight(weight);\n  }\n\n private:\n  GallicCommonDivisor<Label, W, GALLIC_RESTRICT, CommonDivisor> common_divisor_;\n};\n\nnamespace internal {\n\n// Represents an element in a subset\ntemplate <class Arc>\nstruct DeterminizeElement {\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  DeterminizeElement(StateId s, Weight weight)\n      : state_id(s), weight(std::move(weight)) {}\n\n  inline bool operator==(const DeterminizeElement<Arc> &element) const {\n    return state_id == element.state_id && weight == element.weight;\n  }\n\n  inline bool operator!=(const DeterminizeElement<Arc> &element) const {\n    return !(*this == element);\n  }\n\n  inline bool operator<(const DeterminizeElement<Arc> &element) const {\n    return state_id < element.state_id;\n  }\n\n  StateId state_id;  // Input state ID.\n  Weight weight;     // Residual weight.\n};\n\n// Represents a weighted subset and determinization filter state\ntemplate <typename A, typename FilterState>\nstruct DeterminizeStateTuple {\n  using Arc = A;\n  using Element = DeterminizeElement<Arc>;\n  using Subset = std::forward_list<Element>;\n\n  DeterminizeStateTuple() : filter_state(FilterState::NoState()) {}\n\n  inline bool operator==(\n      const DeterminizeStateTuple<Arc, FilterState> &tuple) const {\n    return (tuple.filter_state == filter_state) && (tuple.subset == subset);\n  }\n\n  inline bool operator!=(\n      const DeterminizeStateTuple<Arc, FilterState> &tuple) const {\n    return (tuple.filter_state != filter_state) || (tuple.subset != subset);\n  }\n\n  Subset subset;\n  FilterState filter_state;\n};\n\n// Proto-transition for determinization.\ntemplate <class StateTuple>\nstruct DeterminizeArc {\n  using Arc = typename StateTuple::Arc;\n  using Label = typename Arc::Label;\n  using Weight = typename Arc::Weight;\n\n  DeterminizeArc()\n      : label(kNoLabel), weight(Weight::Zero()), dest_tuple(nullptr) {}\n\n  explicit DeterminizeArc(const Arc &arc)\n      : label(arc.ilabel), weight(Weight::Zero()), dest_tuple(new StateTuple) {}\n\n  Label label;             // Arc label.\n  Weight weight;           // Arc weight.\n  StateTuple *dest_tuple;  // Destination subset and filter state.\n};\n\n}  // namespace internal\n\n// Determinization filters are used to compute destination state tuples based\n// on the source tuple, transition, and destination element or on similar\n// super-final transition information. The filter operates on a map between a\n// label and the corresponding destination state tuples. It must define the map\n// type LabelMap. The default filter is used for weighted determinization.\n// A determinize filter for implementing weighted determinization.\ntemplate <class Arc>\nclass DefaultDeterminizeFilter {\n public:\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using FilterState = CharFilterState;\n  using Element = internal::DeterminizeElement<Arc>;\n  using StateTuple = internal::DeterminizeStateTuple<Arc, FilterState>;\n  using LabelMap = std::map<Label, internal::DeterminizeArc<StateTuple>>;\n\n  // This is needed e.g. to go into the gallic domain for transducers.\n  template <class A>\n  struct rebind {\n    using Other = DefaultDeterminizeFilter<A>;\n  };\n\n  explicit DefaultDeterminizeFilter(const Fst<Arc> &fst) : fst_(fst.Copy()) {}\n\n  // This is needed (e.g.) to go into the gallic domain for transducers.\n  // Ownership of the templated filter argument is given to this class.\n  template <class Filter>\n  DefaultDeterminizeFilter(const Fst<Arc> &fst, Filter *filter)\n      : fst_(fst.Copy()) {\n    delete filter;\n  }\n\n  // Copy constructor; the FST can be passed if it has been deep-copied.\n  DefaultDeterminizeFilter(const DefaultDeterminizeFilter<Arc> &filter,\n                           const Fst<Arc> *fst = nullptr)\n      : fst_(fst ? fst->Copy() : filter.fst_->Copy()) {}\n\n  FilterState Start() const { return FilterState(0); }\n\n  // Does no work.\n  void SetState(StateId s, const StateTuple &tuple) {}\n\n  // Filters transition, possibly modifying label map. Returns true if arc is\n  // added to the label map.\n  bool FilterArc(const Arc &arc, const Element &src_element,\n                 const Element &dest_element, LabelMap *label_map) const {\n    // Adds element to unique state tuple for arc label.\n    auto &det_arc = (*label_map)[arc.ilabel];\n    if (det_arc.label == kNoLabel) {\n      det_arc = internal::DeterminizeArc<StateTuple>(arc);\n      det_arc.dest_tuple->filter_state = FilterState(0);\n    }\n    det_arc.dest_tuple->subset.push_front(dest_element);\n    return true;\n  }\n\n  // Filters super-final transition, returning new final weight.\n  Weight FilterFinal(Weight weight, const Element &element) { return weight; }\n\n  static uint64_t Properties(uint64_t props) { return props; }\n\n private:\n  std::unique_ptr<Fst<Arc>> fst_;\n};\n\n// Determinization state table interface:\n//\n// template <class Arc, class FilterState>\n// class DeterminizeStateTable {\n//  public:\n//   using StateId = typename Arc::StateId;\n//   using StateTuple = internal::DeterminizeStateTuple<Arc, FilterState>;\n//\n//   // Required sub-class. This is needed (e.g.) to go into the gallic domain.\n//   template <class B, class G>\n//   struct rebind {\n//     using Other = DeterminizeStateTable<B, G>;\n//   }\n//\n//   // Required constuctor.\n//   DeterminizeStateTable();\n//\n//   // Required copy constructor that does not copy state.\n//   DeterminizeStateTable(const DeterminizeStateTable<Arc, FilterState>\n//   &table);\n//\n//   // Looks up state ID by state tuple; if it doesn't exist, then adds it.\n//   // FindState takes ownership of the state tuple argument so that it\n//   // doesn't have to copy it if it creates a new state.\n//   StateId FindState(StateTuple *tuple);\n//\n//   // Looks up state tuple by ID.\n//   const StateTuple *Tuple(StateId id) const;\n// };\n\n// The default determinization state table based on the compact hash bi-table.\ntemplate <class Arc, class FilterState>\nclass DefaultDeterminizeStateTable {\n public:\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using StateTuple = internal::DeterminizeStateTuple<Arc, FilterState>;\n  using Element = typename StateTuple::Element;\n  using Subset = typename StateTuple::Subset;\n\n  template <class B, class G>\n  struct rebind {\n    using Other = DefaultDeterminizeStateTable<B, G>;\n  };\n\n  explicit DefaultDeterminizeStateTable(size_t table_size = 0)\n      : table_size_(table_size), tuples_(table_size_) {}\n\n  DefaultDeterminizeStateTable(\n      const DefaultDeterminizeStateTable<Arc, FilterState> &table)\n      : table_size_(table.table_size_), tuples_(table_size_) {}\n\n  ~DefaultDeterminizeStateTable() {\n    for (StateId s = 0; s < tuples_.Size(); ++s) delete tuples_.FindEntry(s);\n  }\n\n  // Finds the state corresponding to a state tuple. Only creates a new state if\n  // the tuple is not found. FindState takes ownership of the tuple argument so\n  // that it doesn't have to copy it if it creates a new state.\n  StateId FindState(StateTuple *tuple) {\n    const StateId ns = tuples_.Size();\n    const auto s = tuples_.FindId(tuple);\n    if (s != ns) delete tuple;  // Tuple found.\n    return s;\n  }\n\n  const StateTuple *Tuple(StateId s) { return tuples_.FindEntry(s); }\n\n private:\n  // Comparison object for StateTuples.\n  class StateTupleEqual {\n   public:\n    bool operator()(const StateTuple *tuple1, const StateTuple *tuple2) const {\n      return *tuple1 == *tuple2;\n    }\n  };\n\n  // Hash function for StateTuples.\n  class StateTupleKey {\n   public:\n    size_t operator()(const StateTuple *tuple) const {\n      size_t h = tuple->filter_state.Hash();\n      for (auto it = tuple->subset.begin(); it != tuple->subset.end(); ++it) {\n        const size_t h1 = it->state_id;\n        static constexpr auto lshift = 5;\n        static constexpr auto rshift = CHAR_BIT * sizeof(size_t) - 5;\n        h ^= h << 1 ^ h1 << lshift ^ h1 >> rshift ^ it->weight.Hash();\n      }\n      return h;\n    }\n  };\n\n  size_t table_size_;\n  CompactHashBiTable<StateId, StateTuple *, StateTupleKey, StateTupleEqual,\n                     HS_STL>\n      tuples_;\n\n  DefaultDeterminizeStateTable &operator=(\n      const DefaultDeterminizeStateTable &) = delete;\n};\n\n// Determinization type.\nenum DeterminizeType {\n  // Input transducer is known to be functional (or error).\n  DETERMINIZE_FUNCTIONAL,  // Input transducer is functional (error if not).\n  // Input transducer is not known to be functional.\n  DETERMINIZE_NONFUNCTIONAL,\n  // Input transducer is not known to be functional but only keep the min of\n  // of ambiguous outputs.\n  DETERMINIZE_DISAMBIGUATE\n};\n\n// Options for finite-state transducer determinization templated on the arc\n// type, common divisor, the determinization filter and the state table.\n// DeterminizeFst takes ownership of the determinization filter and state table,\n// if provided.\ntemplate <class Arc,\n          class CommonDivisor = DefaultCommonDivisor<typename Arc::Weight>,\n          class Filter = DefaultDeterminizeFilter<Arc>,\n          class StateTable =\n              DefaultDeterminizeStateTable<Arc, typename Filter::FilterState>>\nstruct DeterminizeFstOptions : public CacheOptions {\n  using Label = typename Arc::Label;\n\n  float delta;                // Quantization delta for subset weights.\n  Label subsequential_label;  // Label used for residual final output\n                              // when producing subsequential transducers.\n  DeterminizeType type;       // Determinization type.\n  bool increment_subsequential_label;  // When creating several subsequential\n                                       // arcs at a given state, make their\n                                       // label distinct by incrementing.\n  Filter *filter;                      // Determinization filter;\n                                       // DeterminizeFst takes ownership.\n  StateTable *state_table;             // Determinization state table;\n                                       // DeterminizeFst takes ownership.\n\n  explicit DeterminizeFstOptions(const CacheOptions &opts, float delta = kDelta,\n                                 Label subsequential_label = 0,\n                                 DeterminizeType type = DETERMINIZE_FUNCTIONAL,\n                                 bool increment_subsequential_label = false,\n                                 Filter *filter = nullptr,\n                                 StateTable *state_table = nullptr)\n      : CacheOptions(opts),\n        delta(delta),\n        subsequential_label(subsequential_label),\n        type(type),\n        increment_subsequential_label(increment_subsequential_label),\n        filter(filter),\n        state_table(state_table) {}\n\n  explicit DeterminizeFstOptions(float delta = kDelta,\n                                 Label subsequential_label = 0,\n                                 DeterminizeType type = DETERMINIZE_FUNCTIONAL,\n                                 bool increment_subsequential_label = false,\n                                 Filter *filter = nullptr,\n                                 StateTable *state_table = nullptr)\n      : delta(delta),\n        subsequential_label(subsequential_label),\n        type(type),\n        increment_subsequential_label(increment_subsequential_label),\n        filter(filter),\n        state_table(state_table) {}\n};\n\nnamespace internal {\n\n// Implementation of delayed DeterminizeFst. This base class is\n// common to the variants that implement acceptor and transducer\n// determinization.\ntemplate <class Arc>\nclass DeterminizeFstImplBase : public CacheImpl<Arc> {\n public:\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using Store = DefaultCacheStore<Arc>;\n  using State = typename Store::State;\n\n  using FstImpl<Arc>::SetType;\n  using FstImpl<Arc>::SetProperties;\n  using FstImpl<Arc>::Properties;\n  using FstImpl<Arc>::SetInputSymbols;\n  using FstImpl<Arc>::SetOutputSymbols;\n\n  using CacheBaseImpl<CacheState<Arc>>::HasStart;\n  using CacheBaseImpl<CacheState<Arc>>::HasFinal;\n  using CacheBaseImpl<CacheState<Arc>>::HasArcs;\n  using CacheBaseImpl<CacheState<Arc>>::SetFinal;\n  using CacheBaseImpl<CacheState<Arc>>::SetStart;\n\n  template <class CommonDivisor, class Filter, class StateTable>\n  DeterminizeFstImplBase(\n      const Fst<Arc> &fst,\n      const DeterminizeFstOptions<Arc, CommonDivisor, Filter, StateTable> &opts)\n      : CacheImpl<Arc>(opts), fst_(fst.Copy()) {\n    SetType(\"determinize\");\n    const auto iprops = fst.Properties(kFstProperties, false);\n    const auto dprops =\n        DeterminizeProperties(iprops, opts.subsequential_label != 0,\n                              opts.type == DETERMINIZE_NONFUNCTIONAL\n                                  ? opts.increment_subsequential_label\n                                  : true);\n    SetProperties(Filter::Properties(dprops), kCopyProperties);\n    SetInputSymbols(fst.InputSymbols());\n    SetOutputSymbols(fst.OutputSymbols());\n  }\n\n  DeterminizeFstImplBase(const DeterminizeFstImplBase<Arc> &impl)\n      : CacheImpl<Arc>(impl), fst_(impl.fst_->Copy(true)) {\n    SetType(\"determinize\");\n    SetProperties(impl.Properties(), kCopyProperties);\n    SetInputSymbols(impl.InputSymbols());\n    SetOutputSymbols(impl.OutputSymbols());\n  }\n\n  virtual DeterminizeFstImplBase<Arc> *Copy() const = 0;\n\n  StateId Start() {\n    if (!HasStart()) {\n      const auto start = ComputeStart();\n      if (start != kNoStateId) SetStart(start);\n    }\n    return CacheImpl<Arc>::Start();\n  }\n\n  Weight Final(StateId s) {\n    if (!HasFinal(s)) SetFinal(s, ComputeFinal(s));\n    return CacheImpl<Arc>::Final(s);\n  }\n\n  virtual void Expand(StateId s) = 0;\n\n  size_t NumArcs(StateId s) {\n    if (!HasArcs(s)) Expand(s);\n    return CacheImpl<Arc>::NumArcs(s);\n  }\n\n  size_t NumInputEpsilons(StateId s) {\n    if (!HasArcs(s)) Expand(s);\n    return CacheImpl<Arc>::NumInputEpsilons(s);\n  }\n\n  size_t NumOutputEpsilons(StateId s) {\n    if (!HasArcs(s)) Expand(s);\n    return CacheImpl<Arc>::NumOutputEpsilons(s);\n  }\n\n  void InitArcIterator(StateId s, ArcIteratorData<Arc> *data) {\n    if (!HasArcs(s)) Expand(s);\n    CacheImpl<Arc>::InitArcIterator(s, data);\n  }\n\n  virtual StateId ComputeStart() = 0;\n\n  virtual Weight ComputeFinal(StateId s) = 0;\n\n  const Fst<Arc> &GetFst() const { return *fst_; }\n\n private:\n  std::unique_ptr<const Fst<Arc>> fst_;  // Input FST.\n};\n\n// Implementation of delayed determinization for weighted acceptors.\ntemplate <class Arc, class CommonDivisor, class Filter, class StateTable>\nclass DeterminizeFsaImpl : public DeterminizeFstImplBase<Arc> {\n public:\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using FilterState = typename Filter::FilterState;\n  using StateTuple = internal::DeterminizeStateTuple<Arc, FilterState>;\n  using Element = typename StateTuple::Element;\n  using Subset = typename StateTuple::Subset;\n  using LabelMap = typename Filter::LabelMap;\n\n  using FstImpl<Arc>::SetProperties;\n  using DeterminizeFstImplBase<Arc>::GetFst;\n  using DeterminizeFstImplBase<Arc>::SetArcs;\n\n  DeterminizeFsaImpl(\n      const Fst<Arc> &fst, const std::vector<Weight> *in_dist,\n      std::vector<Weight> *out_dist,\n      const DeterminizeFstOptions<Arc, CommonDivisor, Filter, StateTable> &opts)\n      : DeterminizeFstImplBase<Arc>(fst, opts),\n        delta_(opts.delta),\n        in_dist_(in_dist),\n        out_dist_(out_dist),\n        filter_(opts.filter ? opts.filter : new Filter(fst)),\n        state_table_(opts.state_table ? opts.state_table : new StateTable()) {\n    if (!fst.Properties(kAcceptor, true)) {\n      FSTERROR() << \"DeterminizeFst: Argument not an acceptor\";\n      SetProperties(kError, kError);\n    }\n    if (!(Weight::Properties() & kLeftSemiring)) {\n      FSTERROR() << \"DeterminizeFst: Weight must be left distributive: \"\n                 << Weight::Type();\n      SetProperties(kError, kError);\n    }\n    if (out_dist_) out_dist_->clear();\n  }\n\n  DeterminizeFsaImpl(\n      const DeterminizeFsaImpl<Arc, CommonDivisor, Filter, StateTable> &impl)\n      : DeterminizeFstImplBase<Arc>(impl),\n        delta_(impl.delta_),\n        in_dist_(nullptr),\n        out_dist_(nullptr),\n        filter_(new Filter(*impl.filter_, &GetFst())),\n        state_table_(new StateTable(*impl.state_table_)) {\n    if (impl.out_dist_) {\n      FSTERROR() << \"DeterminizeFsaImpl: Cannot copy with out_dist vector\";\n      SetProperties(kError, kError);\n    }\n  }\n\n  DeterminizeFsaImpl<Arc, CommonDivisor, Filter, StateTable> *Copy()\n      const override {\n    return new DeterminizeFsaImpl<Arc, CommonDivisor, Filter, StateTable>(\n        *this);\n  }\n\n  uint64_t Properties() const override { return Properties(kFstProperties); }\n\n  // Sets error if found, and returns other FST impl properties.\n  uint64_t Properties(uint64_t mask) const override {\n    if ((mask & kError) && (GetFst().Properties(kError, false))) {\n      SetProperties(kError, kError);\n    }\n    return FstImpl<Arc>::Properties(mask);\n  }\n\n  StateId ComputeStart() override {\n    const auto s = GetFst().Start();\n    if (s == kNoStateId) return kNoStateId;\n    const Element element(s, Weight::One());\n    auto *tuple = new StateTuple;\n    tuple->subset.push_front(element);\n    tuple->filter_state = filter_->Start();\n    return FindState(tuple);\n  }\n\n  Weight ComputeFinal(StateId s) override {\n    const auto *tuple = state_table_->Tuple(s);\n    filter_->SetState(s, *tuple);\n    auto final_weight = Weight::Zero();\n    for (auto it = tuple->subset.begin(); it != tuple->subset.end(); ++it) {\n      const auto &element = *it;\n      final_weight =\n          Plus(final_weight,\n               Times(element.weight, GetFst().Final(element.state_id)));\n      final_weight = filter_->FilterFinal(final_weight, element);\n      if (!final_weight.Member()) SetProperties(kError, kError);\n    }\n    return final_weight;\n  }\n\n  StateId FindState(StateTuple *tuple) {\n    const auto s = state_table_->FindState(tuple);\n    if (in_dist_ && out_dist_->size() <= s) {\n      out_dist_->push_back(ComputeDistance(tuple->subset));\n    }\n    return s;\n  }\n\n  // Computes distance from a state to the final states in the DFA given the\n  // distances in the NFA.\n  Weight ComputeDistance(const Subset &subset) {\n    auto outd = Weight::Zero();\n    for (auto it = subset.begin(); it != subset.end(); ++it) {\n      const auto &element = *it;\n      const auto ind =\n          (element.state_id < in_dist_->size() ? (*in_dist_)[element.state_id]\n                                               : Weight::Zero());\n      outd = Plus(outd, Times(element.weight, ind));\n    }\n    return outd;\n  }\n\n  // Computes the outgoing transitions from a state, creating new destination\n  // states as needed.\n  void Expand(StateId s) override {\n    LabelMap label_map;\n    GetLabelMap(s, &label_map);\n    for (auto it = label_map.begin(); it != label_map.end(); ++it) {\n      AddArc(s, it->second);\n    }\n    SetArcs(s);\n  }\n\n private:\n  using DetArc = internal::DeterminizeArc<StateTuple>;\n\n  // Constructs proto-determinization transition, including destination subset,\n  // per label.\n  void GetLabelMap(StateId s, LabelMap *label_map) {\n    const auto *src_tuple = state_table_->Tuple(s);\n    filter_->SetState(s, *src_tuple);\n    for (auto it = src_tuple->subset.begin(); it != src_tuple->subset.end();\n         ++it) {\n      const auto &src_element = *it;\n      for (ArcIterator<Fst<Arc>> aiter(GetFst(), src_element.state_id);\n           !aiter.Done(); aiter.Next()) {\n        const auto &arc = aiter.Value();\n        const Element dest_element(arc.nextstate,\n                                   Times(src_element.weight, arc.weight));\n        filter_->FilterArc(arc, src_element, dest_element, label_map);\n      }\n    }\n    for (auto it = label_map->begin(); it != label_map->end(); ++it) {\n      NormArc(&it->second);\n    }\n  }\n\n  // Sorts subsets and removes duplicate elements, normalizing transition and\n  // subset weights.\n  void NormArc(DetArc *det_arc) {\n    auto *dest_tuple = det_arc->dest_tuple;\n    dest_tuple->subset.sort();\n    auto piter = dest_tuple->subset.begin();\n    for (auto diter = dest_tuple->subset.begin();\n         diter != dest_tuple->subset.end();) {\n      auto &dest_element = *diter;\n      auto &prev_element = *piter;\n      // Computes arc weight.\n      det_arc->weight = common_divisor_(det_arc->weight, dest_element.weight);\n      if (piter != diter && dest_element.state_id == prev_element.state_id) {\n        // Found duplicate state: sums state weight and deletes duplicate.\n        prev_element.weight = Plus(prev_element.weight, dest_element.weight);\n        if (!prev_element.weight.Member()) SetProperties(kError, kError);\n        ++diter;\n        dest_tuple->subset.erase_after(piter);\n      } else {\n        piter = diter;\n        ++diter;\n      }\n    }\n    // Divides out label weight from destination subset elements, quantizing to\n    // ensure comparisons are effective.\n    for (auto diter = dest_tuple->subset.begin();\n         diter != dest_tuple->subset.end(); ++diter) {\n      auto &dest_element = *diter;\n      dest_element.weight =\n          Divide(dest_element.weight, det_arc->weight, DIVIDE_LEFT);\n      dest_element.weight = dest_element.weight.Quantize(delta_);\n    }\n  }\n\n  // Adds an arc from state S to the destination state associated with state\n  // tuple in det_arc as created by GetLabelMap.\n  void AddArc(StateId s, const DetArc &det_arc) {\n    const Arc arc(det_arc.label, det_arc.label, det_arc.weight,\n                  FindState(det_arc.dest_tuple));\n    CacheImpl<Arc>::PushArc(s, arc);\n  }\n\n  float delta_;                         // Quantization delta for weights.\n  const std::vector<Weight> *in_dist_;  // Distance to final NFA states.\n  std::vector<Weight> *out_dist_;       // Distance to final DFA states.\n\n  // FIXME(kbg): Ought to be static const?\n  CommonDivisor common_divisor_;\n  std::unique_ptr<Filter> filter_;\n  std::unique_ptr<StateTable> state_table_;\n};\n\n// Implementation of delayed determinization for transducers. Transducer\n// determinization is implemented by mapping the input to the Gallic semiring as\n// an acceptor whose weights contain the output strings and using acceptor\n// determinization above to determinize that acceptor.\ntemplate <class Arc, GallicType G, class CommonDivisor, class Filter,\n          class StateTable>\nclass DeterminizeFstImpl : public DeterminizeFstImplBase<Arc> {\n public:\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using ToMapper = ToGallicMapper<Arc, G>;\n  using ToArc = typename ToMapper::ToArc;\n  using ToFst = ArcMapFst<Arc, ToArc, ToMapper>;\n  using FromMapper = FromGallicMapper<Arc, G>;\n  using FromFst = ArcMapFst<ToArc, Arc, FromMapper>;\n\n  using ToCommonDivisor = GallicCommonDivisor<Label, Weight, G, CommonDivisor>;\n  using ToFilter = typename Filter::template rebind<ToArc>::Other;\n  using ToFilterState = typename ToFilter::FilterState;\n  using ToStateTable =\n      typename StateTable::template rebind<ToArc, ToFilterState>::Other;\n  using FactorIterator = GallicFactor<Label, Weight, G>;\n\n  using FstImpl<Arc>::SetProperties;\n  using DeterminizeFstImplBase<Arc>::GetFst;\n  using CacheBaseImpl<CacheState<Arc>>::GetCacheGc;\n  using CacheBaseImpl<CacheState<Arc>>::GetCacheLimit;\n\n  DeterminizeFstImpl(\n      const Fst<Arc> &fst,\n      const DeterminizeFstOptions<Arc, CommonDivisor, Filter, StateTable> &opts)\n      : DeterminizeFstImplBase<Arc>(fst, opts),\n        delta_(opts.delta),\n        subsequential_label_(opts.subsequential_label),\n        increment_subsequential_label_(opts.increment_subsequential_label) {\n    if (opts.state_table) {\n      FSTERROR() << \"DeterminizeFst: \"\n                 << \"A state table can not be passed with transducer input\";\n      SetProperties(kError, kError);\n      return;\n    }\n    Init(GetFst(), opts.filter);\n  }\n\n  DeterminizeFstImpl(\n      const DeterminizeFstImpl<Arc, G, CommonDivisor, Filter, StateTable> &impl)\n      : DeterminizeFstImplBase<Arc>(impl),\n        delta_(impl.delta_),\n        subsequential_label_(impl.subsequential_label_),\n        increment_subsequential_label_(impl.increment_subsequential_label_) {\n    Init(GetFst(), nullptr);\n  }\n\n  DeterminizeFstImpl<Arc, G, CommonDivisor, Filter, StateTable> *Copy()\n      const override {\n    return new DeterminizeFstImpl<Arc, G, CommonDivisor, Filter, StateTable>(\n        *this);\n  }\n\n  uint64_t Properties() const override { return Properties(kFstProperties); }\n\n  // Sets error if found, and returns other FST impl properties.\n  uint64_t Properties(uint64_t mask) const override {\n    if ((mask & kError) && (GetFst().Properties(kError, false) ||\n                            from_fst_->Properties(kError, false))) {\n      SetProperties(kError, kError);\n    }\n    return FstImpl<Arc>::Properties(mask);\n  }\n\n  StateId ComputeStart() override { return from_fst_->Start(); }\n\n  Weight ComputeFinal(StateId s) override { return from_fst_->Final(s); }\n\n  void Expand(StateId s) override {\n    for (ArcIterator<FromFst> aiter(*from_fst_, s); !aiter.Done();\n         aiter.Next()) {\n      CacheImpl<Arc>::PushArc(s, aiter.Value());\n    }\n    CacheImpl<Arc>::SetArcs(s);\n  }\n\n private:\n  // Initialization of transducer determinization implementation, which is\n  // defined after DeterminizeFst since it calls it.\n  void Init(const Fst<Arc> &fst, Filter *filter);\n\n  float delta_;\n  Label subsequential_label_;\n  bool increment_subsequential_label_;\n  std::unique_ptr<FromFst> from_fst_;\n};\n\n}  // namespace internal\n\n// Determinizes a weighted transducer. This version is a delayed\n// FST. The result will be an equivalent FST that has the property\n// that no state has two transitions with the same input label.\n// For this algorithm, epsilon transitions are treated as regular\n// symbols (cf. RmEpsilon).\n//\n// The transducer must be functional. The weights must be (weakly) left\n// divisible (valid for TropicalWeight and LogWeight for instance) and be\n// zero-sum-free if for all a, b: (Plus(a, b) == 0) => a = b = 0.\n//\n// Complexity:\n//\n//   Determinizable: exponential (polynomial in the size of the output).\n//   Non-determinizable: does not terminate.\n//\n// The determinizable automata include all unweighted and all acyclic input.\n//\n// For more information, see:\n//\n// Mohri, M. 1997. Finite-state transducers in language and speech processing.\n// Computational Linguistics 23(2): 269-311.\n//\n// This class attaches interface to implementation and handles reference\n// counting, delegating most methods to ImplToFst.\ntemplate <class A>\nclass DeterminizeFst : public ImplToFst<internal::DeterminizeFstImplBase<A>> {\n public:\n  using Arc = A;\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using Store = DefaultCacheStore<Arc>;\n  using State = typename Store::State;\n  using Impl = internal::DeterminizeFstImplBase<Arc>;\n\n  friend class ArcIterator<DeterminizeFst<Arc>>;\n  friend class StateIterator<DeterminizeFst<Arc>>;\n\n  template <class B, GallicType G, class CommonDivisor, class Filter,\n            class StateTable>\n  friend class DeterminizeFstImpl;\n\n  explicit DeterminizeFst(const Fst<A> &fst)\n      : ImplToFst<Impl>(CreateImpl(fst)) {}\n\n  template <class CommonDivisor, class Filter, class StateTable>\n  DeterminizeFst(\n      const Fst<Arc> &fst,\n      const DeterminizeFstOptions<Arc, CommonDivisor, Filter, StateTable>\n          &opts =\n              DeterminizeFstOptions<Arc, CommonDivisor, Filter, StateTable>())\n      : ImplToFst<Impl>(CreateImpl(fst, opts)) {}\n\n  // This acceptor-only version additionally computes the distance to final\n  // states in the output if provided with those distances for the input; this\n  // is useful for e.g., computing the k-shortest unique paths.\n  template <class CommonDivisor, class Filter, class StateTable>\n  DeterminizeFst(\n      const Fst<Arc> &fst, const std::vector<Weight> *in_dist,\n      std::vector<Weight> *out_dist,\n      const DeterminizeFstOptions<Arc, CommonDivisor, Filter, StateTable>\n          &opts =\n              DeterminizeFstOptions<Arc, CommonDivisor, Filter, StateTable>())\n      : ImplToFst<Impl>(\n            std::make_shared<internal::DeterminizeFsaImpl<Arc, CommonDivisor,\n                                                          Filter, StateTable>>(\n                fst, in_dist, out_dist, opts)) {\n    if (!fst.Properties(kAcceptor, true)) {\n      FSTERROR() << \"DeterminizeFst: \"\n                 << \"Distance to final states computed for acceptors only\";\n      GetMutableImpl()->SetProperties(kError, kError);\n    }\n  }\n\n  // See Fst<>::Copy() for doc.\n  DeterminizeFst(const DeterminizeFst<Arc> &fst, bool safe = false)\n      : ImplToFst<Impl>(safe ? std::shared_ptr<Impl>(fst.GetImpl()->Copy())\n                             : fst.GetSharedImpl()) {}\n\n  // Get a copy of this DeterminizeFst. See Fst<>::Copy() for further doc.\n  DeterminizeFst<Arc> *Copy(bool safe = false) const override {\n    return new DeterminizeFst<Arc>(*this, safe);\n  }\n\n  inline void InitStateIterator(StateIteratorData<Arc> *data) const override;\n\n  void InitArcIterator(StateId s, ArcIteratorData<Arc> *data) const override {\n    GetMutableImpl()->InitArcIterator(s, data);\n  }\n\n private:\n  using ImplToFst<Impl>::GetImpl;\n  using ImplToFst<Impl>::GetMutableImpl;\n\n  static std::shared_ptr<Impl> CreateImpl(const Fst<Arc> &fst) {\n    using D = DefaultCommonDivisor<Weight>;\n    using F = DefaultDeterminizeFilter<Arc>;\n    using T = DefaultDeterminizeStateTable<Arc, typename F::FilterState>;\n    const DeterminizeFstOptions<Arc, D, F, T> opts;\n    return CreateImpl(fst, opts);\n  }\n\n  template <class CommonDivisor, class Filter, class StateTable>\n  static std::shared_ptr<Impl> CreateImpl(\n      const Fst<Arc> &fst,\n      const DeterminizeFstOptions<Arc, CommonDivisor, Filter, StateTable>\n          &opts) {\n    if (fst.Properties(kAcceptor, true)) {\n      // Calls implementation for acceptors.\n      return std::make_shared<\n          internal::DeterminizeFsaImpl<Arc, CommonDivisor, Filter, StateTable>>(\n          fst, nullptr, nullptr, opts);\n    } else if (opts.type == DETERMINIZE_DISAMBIGUATE) {\n      auto rv = std::make_shared<internal::DeterminizeFstImpl<\n          Arc, GALLIC_MIN, CommonDivisor, Filter, StateTable>>(fst, opts);\n      if (!(Weight::Properties() & kPath)) {\n        FSTERROR() << \"DeterminizeFst: Weight needs to have the \"\n                   << \"path property to disambiguate output: \"\n                   << Weight::Type();\n        rv->SetProperties(kError, kError);\n      }\n      // Calls disambiguating implementation for non-functional transducers.\n      return rv;\n    } else if (opts.type == DETERMINIZE_FUNCTIONAL) {\n      // Calls implementation for functional transducers.\n      return std::make_shared<internal::DeterminizeFstImpl<\n          Arc, GALLIC_RESTRICT, CommonDivisor, Filter, StateTable>>(fst, opts);\n    } else {  // opts.type == DETERMINIZE_NONFUNCTIONAL\n      // Calls implementation for non functional transducers;\n      return std::make_shared<internal::DeterminizeFstImpl<\n          Arc, GALLIC, CommonDivisor, Filter, StateTable>>(fst, opts);\n    }\n  }\n\n  DeterminizeFst &operator=(const DeterminizeFst &) = delete;\n};\n\nnamespace internal {\n\n// Initialization of transducer determinization implementation, which is defined\n// after DeterminizeFst since it calls it.\ntemplate <class Arc, GallicType G, class D, class Filter, class T>\nvoid DeterminizeFstImpl<Arc, G, D, Filter, T>::Init(const Fst<Arc> &fst, Filter *filter) {\n  // Mapper to an acceptor.\n  const ToFst to_fst(fst, ToMapper());\n  auto *to_filter = filter ? new ToFilter(to_fst, filter) : nullptr;\n  // This recursive call terminates since it is to a (non-recursive)\n  // different constructor.\n  const CacheOptions copts(GetCacheGc(), GetCacheLimit());\n  const DeterminizeFstOptions<ToArc, ToCommonDivisor, ToFilter, ToStateTable>\n      dopts(copts, delta_, 0, DETERMINIZE_FUNCTIONAL, false, to_filter);\n  // Uses acceptor-only constructor to avoid template recursion.\n  const DeterminizeFst<ToArc> det_fsa(to_fst, nullptr, nullptr, dopts);\n  // Mapper back to transducer.\n  const FactorWeightOptions<ToArc> fopts(\n      CacheOptions(true, 0), delta_, kFactorFinalWeights, subsequential_label_,\n      subsequential_label_, increment_subsequential_label_,\n      increment_subsequential_label_);\n  const FactorWeightFst<ToArc, FactorIterator> factored_fst(det_fsa, fopts);\n  from_fst_.reset(new FromFst(factored_fst, FromMapper(subsequential_label_)));\n}\n\n}  // namespace internal\n\n// Specialization for DeterminizeFst.\ntemplate <class Arc>\nclass StateIterator<DeterminizeFst<Arc>>\n    : public CacheStateIterator<DeterminizeFst<Arc>> {\n public:\n  explicit StateIterator(const DeterminizeFst<Arc> &fst)\n      : CacheStateIterator<DeterminizeFst<Arc>>(fst, fst.GetMutableImpl()) {}\n};\n\n// Specialization for DeterminizeFst.\ntemplate <class Arc>\nclass ArcIterator<DeterminizeFst<Arc>>\n    : public CacheArcIterator<DeterminizeFst<Arc>> {\n public:\n  using StateId = typename Arc::StateId;\n\n  ArcIterator(const DeterminizeFst<Arc> &fst, StateId s)\n      : CacheArcIterator<DeterminizeFst<Arc>>(fst.GetMutableImpl(), s) {\n    if (!fst.GetImpl()->HasArcs(s)) fst.GetMutableImpl()->Expand(s);\n  }\n};\n\ntemplate <class Arc>\ninline void DeterminizeFst<Arc>::InitStateIterator(\n    StateIteratorData<Arc> *data) const {\n  data->base = new StateIterator<DeterminizeFst<Arc>>(*this);\n}\n\n// Useful aliases when using StdArc.\nusing StdDeterminizeFst = DeterminizeFst<StdArc>;\n\ntemplate <class Arc>\nstruct DeterminizeOptions {\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  float delta;                // Quantization delta for subset weights.\n  Weight weight_threshold;    // Pruning weight threshold.\n  StateId state_threshold;    // Pruning state threshold.\n  Label subsequential_label;  // Label used for residual final output.\n  DeterminizeType type;\n  bool increment_subsequential_label;  // When creating several subsequential\n                                       // arcs at a given state, make their\n                                       // label distinct by incrementation?\n\n  explicit DeterminizeOptions(float delta = kDelta,\n                              Weight weight_threshold = Weight::Zero(),\n                              StateId state_threshold = kNoStateId,\n                              Label subsequential_label = 0,\n                              DeterminizeType type = DETERMINIZE_FUNCTIONAL,\n                              bool increment_subsequential_label = false)\n      : delta(delta),\n        weight_threshold(std::move(weight_threshold)),\n        state_threshold(state_threshold),\n        subsequential_label(subsequential_label),\n        type(type),\n        increment_subsequential_label(increment_subsequential_label) {}\n};\n\n// Determinizes a weighted transducer. This version writes the\n// determinized Fst to an output MutableFst. The result will be an\n// equivalent FST that has the property that no state has two\n// transitions with the same input label. For this algorithm, epsilon\n// transitions are treated as regular symbols (cf. RmEpsilon).\n//\n// The transducer must be functional. The weights must be (weakly)\n// left divisible (valid for TropicalWeight and LogWeight).\n//\n// Complexity:\n//\n//   Determinizable: exponential (polynomial in the size of the output)\n//   Non-determinizable: does not terminate\n//\n// The determinizable automata include all unweighted and all acyclic input.\ntemplate <class Arc>\nvoid Determinize(\n    const Fst<Arc> &ifst, MutableFst<Arc> *ofst,\n    const DeterminizeOptions<Arc> &opts = DeterminizeOptions<Arc>()) {\n  using Weight = typename Arc::Weight;\n  DeterminizeFstOptions<Arc> nopts;\n  nopts.delta = opts.delta;\n  nopts.subsequential_label = opts.subsequential_label;\n  nopts.type = opts.type;\n  nopts.increment_subsequential_label = opts.increment_subsequential_label;\n  nopts.gc_limit = 0;  // Caches only the last state for fastest copy.\n  if (opts.weight_threshold != Weight::Zero() ||\n      opts.state_threshold != kNoStateId) {\n    if (ifst.Properties(kAcceptor, false)) {\n      std::vector<Weight> idistance;\n      std::vector<Weight> odistance;\n      ShortestDistance(ifst, &idistance, true);\n      DeterminizeFst<Arc> dfst(ifst, &idistance, &odistance, nopts);\n      PruneOptions<Arc, AnyArcFilter<Arc>> popts(\n          opts.weight_threshold, opts.state_threshold, AnyArcFilter<Arc>(),\n          &odistance);\n      Prune(dfst, ofst, popts);\n    } else {\n      *ofst = DeterminizeFst<Arc>(ifst, nopts);\n      Prune(ofst, opts.weight_threshold, opts.state_threshold);\n    }\n  } else {\n    *ofst = DeterminizeFst<Arc>(ifst, nopts);\n  }\n}\n\n}  // namespace fst\n\n#endif  // FST_DETERMINIZE_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/dfs-visit.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Depth-first search visitation. See visit.h for more general search queue\n// disciplines.\n\n#ifndef FST_DFS_VISIT_H_\n#define FST_DFS_VISIT_H_\n\n#include <stack>\n#include <vector>\n\n#include <fst/arcfilter.h>\n#include <fst/fst.h>\n\n\nnamespace fst {\n\n// Visitor Interface: class determining actions taken during a depth-first\n// search-style visit. If any of the boolean member functions return false, the\n// DFS is aborted by first calling FinishState() on all currently grey states\n// and then calling FinishVisit().\n//\n// This is similar to the more general visitor interface in visit.h, except\n// that FinishState returns additional information appropriate only for a DFS\n// and some methods names here are better suited to a DFS.\n//\n// template <class Arc>\n// class Visitor {\n//  public:\n//   using StateId = typename Arc::StateId;\n//\n//   Visitor(T *return_data);\n//\n//   // Invoked before DFS visit.\n//   void InitVisit(const Fst<Arc> &fst);\n//\n//   // Invoked when state discovered (2nd arg is DFS tree root).\n//   bool InitState(StateId s, StateId root);\n//\n//   // Invoked when tree arc to white/undiscovered state examined.\n//   bool TreeArc(StateId s, const Arc &arc);\n//\n//   // Invoked when back arc to grey/unfinished state examined.\n//   bool BackArc(StateId s, const Arc &arc);\n//\n//   // Invoked when forward or cross arc to black/finished state examined.\n//   bool ForwardOrCrossArc(StateId s, const Arc &arc);\n//\n//   // Invoked when state finished ('s' is tree root, 'parent' is kNoStateId,\n//   // and 'arc' is nullptr).\n//   void FinishState(StateId s, StateId parent, const Arc *arc);\n//\n//   // Invoked after DFS visit.\n//   void FinishVisit();\n// };\n\nnamespace internal {\n\n// An FST state's DFS stack state.\ntemplate <class FST>\nstruct DfsState {\n  using Arc = typename FST::Arc;\n  using StateId = typename Arc::StateId;\n\n  DfsState(const FST &fst, StateId s) : state_id(s), arc_iter(fst, s) {}\n\n  void *operator new(size_t size, MemoryPool<DfsState<FST>> *pool) {\n    return pool->Allocate();\n  }\n\n  static void Destroy(DfsState<FST> *dfs_state,\n                      MemoryPool<DfsState<FST>> *pool) {\n    if (dfs_state) {\n      dfs_state->~DfsState<FST>();\n      pool->Free(dfs_state);\n    }\n  }\n\n  StateId state_id;           // FST state.\n  ArcIterator<FST> arc_iter;  // The corresponding arcs.\n};\n\n}  // namespace internal\n\n// Performs depth-first visitation. Visitor class argument determines actions\n// and contains any return data. ArcFilter determines arcs that are considered.\n// If 'access_only' is true, performs visitation only to states accessible from\n// the initial state.\n//\n// Note this is similar to Visit() in visit.h called with a LIFO queue, except\n// this version has a Visitor class specialized and augmented for a DFS.\ntemplate <class FST, class Visitor, class ArcFilter>\nvoid DfsVisit(const FST &fst, Visitor *visitor, ArcFilter filter,\n              bool access_only = false) {\n  using Arc = typename FST::Arc;\n  using StateId = typename Arc::StateId;\n  visitor->InitVisit(fst);\n  const auto start = fst.Start();\n  if (start == kNoStateId) {\n    visitor->FinishVisit();\n    return;\n  }\n  // An FST state's DFS status\n  static constexpr uint8_t kDfsWhite = 0;  // Undiscovered.\n  static constexpr uint8_t kDfsGrey = 1;   // Discovered but unfinished.\n  static constexpr uint8_t kDfsBlack = 2;  // Finished.\n  std::vector<uint8_t> state_color;\n  std::stack<internal::DfsState<FST> *> state_stack;  // DFS execution stack.\n  MemoryPool<internal::DfsState<FST>> state_pool;     // Pool for DFSStates.\n  auto nstates = start + 1;  // Number of known states in general case.\n  bool expanded = false;\n  if (fst.Properties(kExpanded, false)) {  // Tests if expanded case, then\n    nstates = CountStates(fst);            // uses ExpandedFst::NumStates().\n    expanded = true;\n  }\n  state_color.resize(nstates, kDfsWhite);\n  StateIterator<FST> siter(fst);\n  // Continue DFS while true.\n  bool dfs = true;\n  // Iterate over trees in DFS forest.\n  for (auto root = start; dfs && root < nstates;) {\n    state_color[root] = kDfsGrey;\n    state_stack.push(new (&state_pool) internal::DfsState<FST>(fst, root));\n    dfs = visitor->InitState(root, root);\n    while (!state_stack.empty()) {\n      auto *dfs_state = state_stack.top();\n      const auto s = dfs_state->state_id;\n      if (s >= state_color.size()) {\n        nstates = s + 1;\n        state_color.resize(nstates, kDfsWhite);\n      }\n      ArcIterator<FST> &aiter = dfs_state->arc_iter;\n      if (!dfs || aiter.Done()) {\n        state_color[s] = kDfsBlack;\n        internal::DfsState<FST>::Destroy(dfs_state, &state_pool);\n        state_stack.pop();\n        if (!state_stack.empty()) {\n          auto *parent_state = state_stack.top();\n          auto &piter = parent_state->arc_iter;\n          visitor->FinishState(s, parent_state->state_id, &piter.Value());\n          piter.Next();\n        } else {\n          visitor->FinishState(s, kNoStateId, nullptr);\n        }\n        continue;\n      }\n      const auto &arc = aiter.Value();\n      if (arc.nextstate >= state_color.size()) {\n        nstates = arc.nextstate + 1;\n        state_color.resize(nstates, kDfsWhite);\n      }\n      if (!filter(arc)) {\n        aiter.Next();\n        continue;\n      }\n      const auto next_color = state_color[arc.nextstate];\n      switch (next_color) {\n        default:\n        case kDfsWhite:\n          dfs = visitor->TreeArc(s, arc);\n          if (!dfs) break;\n          state_color[arc.nextstate] = kDfsGrey;\n          state_stack.push(new (&state_pool)\n                               internal::DfsState<FST>(fst, arc.nextstate));\n          dfs = visitor->InitState(arc.nextstate, root);\n          break;\n        case kDfsGrey:\n          dfs = visitor->BackArc(s, arc);\n          aiter.Next();\n          break;\n        case kDfsBlack:\n          dfs = visitor->ForwardOrCrossArc(s, arc);\n          aiter.Next();\n          break;\n      }\n    }\n    if (access_only) break;\n    // Finds next tree root.\n    for (root = root == start ? 0 : root + 1;\n         root < nstates && state_color[root] != kDfsWhite; ++root) {\n    }\n    // Checks for a state beyond the largest known state.\n    if (!expanded && root == nstates) {\n      for (; !siter.Done(); siter.Next()) {\n        if (siter.Value() == nstates) {\n          ++nstates;\n          state_color.push_back(kDfsWhite);\n          break;\n        }\n      }\n    }\n  }\n  visitor->FinishVisit();\n}\n\ntemplate <class Arc, class Visitor>\nvoid DfsVisit(const Fst<Arc> &fst, Visitor *visitor) {\n  DfsVisit(fst, visitor, AnyArcFilter<Arc>());\n}\n\n}  // namespace fst\n\n#endif  // FST_DFS_VISIT_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/difference.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Class to compute the difference between two FSAs.\n\n#ifndef FST_DIFFERENCE_H_\n#define FST_DIFFERENCE_H_\n\n#include <memory>\n\n\n#include <fst/cache.h>\n#include <fst/complement.h>\n#include <fst/compose.h>\n\n\nnamespace fst {\n\ntemplate <class Arc, class M = Matcher<Fst<Arc>>,\n          class Filter = SequenceComposeFilter<M>,\n          class StateTable =\n              GenericComposeStateTable<Arc, typename Filter::FilterState>>\nstruct DifferenceFstOptions\n    : public ComposeFstOptions<Arc, M, Filter, StateTable> {\n  explicit DifferenceFstOptions(const CacheOptions &opts = CacheOptions(),\n                                M *matcher1 = nullptr, M *matcher2 = nullptr,\n                                Filter *filter = nullptr,\n                                StateTable *state_table = nullptr)\n      : ComposeFstOptions<Arc, M, Filter, StateTable>(opts, matcher1, matcher2,\n                                                      filter, state_table) {}\n};\n\n// Computes the difference between two FSAs. This version is a delayed FST.\n// Only strings that are in the first automaton but not in second are retained\n// in the result.\n//\n// The first argument must be an acceptor; the second argument must be an\n// unweighted, epsilon-free, deterministic acceptor. One of the arguments must\n// be label-sorted.\n//\n// Complexity: same as ComposeFst.\n//\n// Caveats: same as ComposeFst.\ntemplate <class A>\nclass DifferenceFst : public ComposeFst<A> {\n public:\n  using Arc = A;\n  using Weight = typename Arc::Weight;\n  using StateId = typename Arc::StateId;\n\n  using ComposeFst<Arc>::CreateBase1;\n\n  // A - B = A ^ B'.\n  DifferenceFst(const Fst<Arc> &fst1, const Fst<Arc> &fst2,\n                const CacheOptions &opts = CacheOptions())\n      : ComposeFst<Arc>(CreateDifferenceImplWithCacheOpts(fst1, fst2, opts)) {\n    if (!fst1.Properties(kAcceptor, true)) {\n      FSTERROR() << \"DifferenceFst: 1st argument not an acceptor\";\n      GetImpl()->SetProperties(kError, kError);\n    }\n  }\n\n  template <class Matcher, class Filter, class StateTable>\n  DifferenceFst(\n      const Fst<Arc> &fst1, const Fst<Arc> &fst2,\n      const DifferenceFstOptions<Arc, Matcher, Filter, StateTable> &opts)\n      : ComposeFst<Arc>(\n            CreateDifferenceImplWithDifferenceOpts(fst1, fst2, opts)) {\n    if (!fst1.Properties(kAcceptor, true)) {\n      FSTERROR() << \"DifferenceFst: 1st argument not an acceptor\";\n      GetImpl()->SetProperties(kError, kError);\n    }\n  }\n\n  // See Fst<>::Copy() for doc.\n  DifferenceFst(const DifferenceFst<Arc> &fst, bool safe = false)\n      : ComposeFst<Arc>(fst, safe) {}\n\n  // Get a copy of this DifferenceFst. See Fst<>::Copy() for further doc.\n  DifferenceFst<Arc> *Copy(bool safe = false) const override {\n    return new DifferenceFst<Arc>(*this, safe);\n  }\n\n private:\n  using Impl = internal::ComposeFstImplBase<Arc>;\n  using ImplToFst<Impl>::GetImpl;\n\n  static std::shared_ptr<Impl> CreateDifferenceImplWithCacheOpts(\n      const Fst<Arc> &fst1, const Fst<Arc> &fst2, const CacheOptions &opts) {\n    using RM = RhoMatcher<Matcher<Fst<A>>>;\n    ComplementFst<Arc> cfst(fst2);\n    ComposeFstOptions<A, RM> copts(\n        CacheOptions(), new RM(fst1, MATCH_NONE),\n        new RM(cfst, MATCH_INPUT, ComplementFst<Arc>::kRhoLabel));\n    return CreateBase1(fst1, cfst, copts);\n  }\n\n  template <class Matcher, class Filter, class StateTable>\n  static std::shared_ptr<Impl> CreateDifferenceImplWithDifferenceOpts(\n      const Fst<Arc> &fst1, const Fst<Arc> &fst2,\n      const DifferenceFstOptions<Arc, Matcher, Filter, StateTable> &opts) {\n    using RM = RhoMatcher<Matcher>;\n    ComplementFst<Arc> cfst(fst2);\n    ComposeFstOptions<Arc, RM> copts(opts);\n    copts.matcher1 = new RM(fst1, MATCH_NONE, kNoLabel, MATCHER_REWRITE_ALWAYS,\n                            opts.matcher1);\n    copts.matcher2 = new RM(cfst, MATCH_INPUT, ComplementFst<Arc>::kRhoLabel,\n                            MATCHER_REWRITE_ALWAYS, opts.matcher2);\n    return CreateBase1(fst1, cfst, copts);\n  }\n};\n\n// Specialization for DifferenceFst.\ntemplate <class Arc>\nclass StateIterator<DifferenceFst<Arc>>\n    : public StateIterator<ComposeFst<Arc>> {\n public:\n  explicit StateIterator(const DifferenceFst<Arc> &fst)\n      : StateIterator<ComposeFst<Arc>>(fst) {}\n};\n\n// Specialization for DifferenceFst.\ntemplate <class Arc>\nclass ArcIterator<DifferenceFst<Arc>> : public ArcIterator<ComposeFst<Arc>> {\n public:\n  using StateId = typename Arc::StateId;\n\n  ArcIterator(const DifferenceFst<Arc> &fst, StateId s)\n      : ArcIterator<ComposeFst<Arc>>(fst, s) {}\n};\n\nusing DifferenceOptions = ComposeOptions;\n\n// Useful alias when using StdArc.\nusing StdDifferenceFst = DifferenceFst<StdArc>;\n\nusing DifferenceOptions = ComposeOptions;\n\n// Computes the difference between two FSAs. This version writes the difference\n// to an output MutableFst. Only strings that are in the first automaton but not\n// in the second are retained in the result.\n//\n// The first argument must be an acceptor; the second argument must be an\n// unweighted, epsilon-free, deterministic acceptor. One of the arguments must\n// be label-sorted.\n//\n// Complexity: same as Compose.\n//\n// Caveats: same as Compose.\ntemplate <class Arc>\nvoid Difference(const Fst<Arc> &ifst1, const Fst<Arc> &ifst2,\n                MutableFst<Arc> *ofst,\n                const DifferenceOptions &opts = DifferenceOptions()) {\n  using M = Matcher<Fst<Arc>>;\n  if (opts.filter_type == AUTO_FILTER) {\n    CacheOptions nopts;\n    nopts.gc_limit = 0;  // Cache only the last state for fastest copy.\n    *ofst = DifferenceFst<Arc>(ifst1, ifst2, nopts);\n  } else if (opts.filter_type == SEQUENCE_FILTER) {\n    DifferenceFstOptions<Arc> dopts;\n    dopts.gc_limit = 0;  // Cache only the last state for fastest copy.\n    *ofst = DifferenceFst<Arc>(ifst1, ifst2, dopts);\n  } else if (opts.filter_type == ALT_SEQUENCE_FILTER) {\n    DifferenceFstOptions<Arc, M, AltSequenceComposeFilter<M>> dopts;\n    dopts.gc_limit = 0;  // Cache only the last state for fastest copy.\n    *ofst = DifferenceFst<Arc>(ifst1, ifst2, dopts);\n  } else if (opts.filter_type == MATCH_FILTER) {\n    DifferenceFstOptions<Arc, M, MatchComposeFilter<M>> dopts;\n    dopts.gc_limit = 0;  // Cache only the last state for fastest copy.\n    *ofst = DifferenceFst<Arc>(ifst1, ifst2, dopts);\n  }\n  if (opts.connect) Connect(ofst);\n}\n\n}  // namespace fst\n\n#endif  // FST_DIFFERENCE_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/disambiguate.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Functions and classes to disambiguate an FST.\n\n#ifndef FST_DISAMBIGUATE_H_\n#define FST_DISAMBIGUATE_H_\n\n#include <list>\n#include <map>\n#include <set>\n#include <utility>\n#include <vector>\n\n#include <fst/arcsort.h>\n#include <fst/compose.h>\n#include <fst/connect.h>\n#include <fst/determinize.h>\n#include <fst/dfs-visit.h>\n#include <fst/project.h>\n#include <fst/prune.h>\n#include <fst/state-map.h>\n#include <fst/state-table.h>\n#include <fst/union-find.h>\n#include <fst/verify.h>\n\n\nnamespace fst {\n\ntemplate <class Arc>\nstruct DisambiguateOptions : public DeterminizeOptions<Arc> {\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  explicit DisambiguateOptions(float delta = kDelta,\n                               Weight weight = Weight::Zero(),\n                               StateId n = kNoStateId, Label label = 0)\n      : DeterminizeOptions<Arc>(delta, std::move(weight), n, label,\n                                DETERMINIZE_FUNCTIONAL) {}\n};\n\nnamespace internal {\n\n// A determinization filter based on a subset element relation. The relation is\n// assumed to be reflexive and symmetric.\ntemplate <class Arc, class Relation>\nclass RelationDeterminizeFilter {\n public:\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using FilterState = IntegerFilterState<StateId>;\n  using StateTuple = DeterminizeStateTuple<Arc, FilterState>;\n  using Subset = typename StateTuple::Subset;\n  using Element = typename StateTuple::Element;\n  using LabelMap = std::multimap<Label, DeterminizeArc<StateTuple>>;\n\n  // This is needed (e.g.) to go into the gallic domain for transducers; there\n  // is no need to rebind the relation since its use here only depends on the\n  // state IDs.\n  template <class A>\n  struct rebind {\n    using Other = RelationDeterminizeFilter<A, Relation>;\n  };\n\n  explicit RelationDeterminizeFilter(const Fst<Arc> &fst)\n      : fst_(fst.Copy()), r_(new Relation()), s_(kNoStateId), head_(nullptr) {}\n\n  // Ownership of the relation is given to this class.\n  RelationDeterminizeFilter(const Fst<Arc> &fst, Relation *r)\n      : fst_(fst.Copy()), r_(r), s_(kNoStateId), head_(0) {}\n\n  // Ownership of the relation is given to this class.\n  RelationDeterminizeFilter(const Fst<Arc> &fst, Relation *r,\n                            std::vector<StateId> *head)\n      : fst_(fst.Copy()), r_(r), s_(kNoStateId), head_(head) {}\n\n  // This is needed, e.g., to go into the gallic domain for transducers.\n  // Ownership of the templated filter argument is given to this class.\n  template <class Filter>\n  RelationDeterminizeFilter(const Fst<Arc> &fst, Filter *filter)\n      : fst_(fst.Copy()),\n        r_(new Relation(filter->GetRelation())),\n        s_(kNoStateId),\n        head_(filter->GetHeadStates()) {\n    delete filter;\n  }\n\n  // Copy constructor; the FST can be passed if it has been deep-copied.\n  RelationDeterminizeFilter(const RelationDeterminizeFilter &filter,\n                            const Fst<Arc> *fst = nullptr)\n      : fst_(fst ? fst->Copy() : filter.fst_->Copy()),\n        r_(new Relation(*filter.r_)),\n        s_(kNoStateId),\n        head_() {}\n\n  FilterState Start() const { return FilterState(fst_->Start()); }\n\n  void SetState(StateId s, const StateTuple &tuple) {\n    if (s_ != s) {\n      s_ = s;\n      tuple_ = &tuple;\n      const auto head = tuple.filter_state.GetState();\n      is_final_ = fst_->Final(head) != Weight::Zero();\n      if (head_) {\n        if (head_->size() <= s) head_->resize(s + 1, kNoStateId);\n        (*head_)[s] = head;\n      }\n    }\n  }\n\n  // Filters transition, possibly modifying label map. Returns true if arc is\n  // added to label map.\n  bool FilterArc(const Arc &arc, const Element &src_element,\n                 const Element &dest_element, LabelMap *label_map) const;\n\n  // Filters super-final transition, returning new final weight.\n  Weight FilterFinal(const Weight final_weight, const Element &element) const {\n    return is_final_ ? final_weight : Weight::Zero();\n  }\n\n  static uint64_t Properties(uint64_t props) {\n    return props & ~(kIDeterministic | kODeterministic);\n  }\n\n  const Relation &GetRelation() { return *r_; }\n\n  std::vector<StateId> *GetHeadStates() { return head_; }\n\n private:\n  // Pairs arc labels with state tuples with possible heads and empty subsets.\n  void InitLabelMap(LabelMap *label_map) const;\n\n  std::unique_ptr<Fst<Arc>> fst_;  // Input FST.\n  std::unique_ptr<Relation> r_;    // Relation compatible with inv. trans. fnc.\n  StateId s_;                      // Current state.\n  const StateTuple *tuple_;        // Current tuple.\n  bool is_final_;                  // Is the current head state final?\n  std::vector<StateId> *head_;     // Head state for a given state,\n                                   // owned by the Disambiguator.\n};\n\ntemplate <class Arc, class Relation>\nbool RelationDeterminizeFilter<Arc, Relation>::FilterArc(\n    const Arc &arc, const Element &src_element, const Element &dest_element,\n    LabelMap *label_map) const {\n  bool added = false;\n  if (label_map->empty()) InitLabelMap(label_map);\n  // Adds element to state tuple if element state is related to tuple head.\n  for (auto liter = label_map->lower_bound(arc.ilabel);\n       liter != label_map->end() && liter->first == arc.ilabel; ++liter) {\n    auto *dest_tuple = liter->second.dest_tuple;\n    const auto dest_head = dest_tuple->filter_state.GetState();\n    if ((*r_)(dest_element.state_id, dest_head)) {\n      dest_tuple->subset.push_front(dest_element);\n      added = true;\n    }\n  }\n  return added;\n}\n\ntemplate <class Arc, class Relation>\nvoid RelationDeterminizeFilter<Arc, Relation>::InitLabelMap(\n    LabelMap *label_map) const {\n  const auto src_head = tuple_->filter_state.GetState();\n  Label label = kNoLabel;\n  StateId nextstate = kNoStateId;\n  for (ArcIterator<Fst<Arc>> aiter(*fst_, src_head); !aiter.Done();\n       aiter.Next()) {\n    const auto &arc = aiter.Value();\n    // Continues if multiarc.\n    if (arc.ilabel == label && arc.nextstate == nextstate) continue;\n    DeterminizeArc<StateTuple> det_arc(arc);\n    det_arc.dest_tuple->filter_state = FilterState(arc.nextstate);\n    label_map->insert(std::make_pair(arc.ilabel, det_arc));\n    label = arc.ilabel;\n    nextstate = arc.nextstate;\n  }\n}\n\n// Helper class to disambiguate an FST via Disambiguate().\ntemplate <class Arc>\nclass Disambiguator {\n public:\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  // IDs arcs with state ID and arc position. Arc position -1 indicates final\n  // (super-final transition).\n  using ArcId = std::pair<StateId, std::ptrdiff_t>;\n\n  Disambiguator() : error_(false) {}\n\n  void Disambiguate(\n      const Fst<Arc> &ifst, MutableFst<Arc> *ofst,\n      const DisambiguateOptions<Arc> &opts = DisambiguateOptions<Arc>()) {\n    VectorFst<Arc> sfst(ifst);\n    Connect(&sfst);\n    ArcSort(&sfst, ArcCompare());\n    PreDisambiguate(sfst, ofst, opts);\n    ArcSort(ofst, ArcCompare());\n    FindAmbiguities(*ofst);\n    RemoveSplits(ofst);\n    MarkAmbiguities();\n    RemoveAmbiguities(ofst);\n    if (error_) ofst->SetProperties(kError, kError);\n  }\n\n private:\n  // Comparison functor for comparing input labels and next states of arcs. This\n  // sort order facilitates the predisambiguation.\n  class ArcCompare {\n   public:\n    bool operator()(const Arc &arc1, const Arc &arc2) const {\n      return arc1.ilabel < arc2.ilabel ||\n             (arc1.ilabel == arc2.ilabel && arc1.nextstate < arc2.nextstate);\n    }\n\n    uint64_t Properties(uint64_t props) const {\n      return (props & kArcSortProperties) | kILabelSorted |\n             (props & kAcceptor ? kOLabelSorted : 0);\n    }\n  };\n\n  // Comparison functor for comparing transitions represented by their arc ID.\n  // This sort order facilitates ambiguity detection.\n  class ArcIdCompare {\n   public:\n    explicit ArcIdCompare(const std::vector<StateId> &head) : head_(head) {}\n\n    bool operator()(const ArcId &a1, const ArcId &a2) const {\n      // Sort first by source head state...\n      const auto src1 = a1.first;\n      const auto src2 = a2.first;\n      const auto head1 = head_[src1];\n      const auto head2 = head_[src2];\n      if (head1 < head2) return true;\n      if (head2 < head1) return false;\n      // ...then by source state...\n      if (src1 < src2) return true;\n      if (src2 < src1) return false;\n      // ...then by position.\n      return a1.second < a2.second;\n    }\n\n   private:\n    const std::vector<StateId> &head_;\n  };\n\n  // A relation that determines if two states share a common future.\n  class CommonFuture {\n   public:\n    using StateTable = GenericComposeStateTable<Arc, TrivialFilterState>;\n    using StateTuple = typename StateTable::StateTuple;\n\n    // Needed for compilation with DeterminizeRelationFilter.\n    CommonFuture() {\n      FSTERROR() << \"Disambiguate::CommonFuture: FST not provided\";\n    }\n\n    explicit CommonFuture(const Fst<Arc> &ifst) {\n      using M = Matcher<Fst<Arc>>;\n      ComposeFstOptions<Arc, M, NullComposeFilter<M>> opts;\n      // Ensures composition is between acceptors.\n      const bool trans = ifst.Properties(kNotAcceptor, true);\n      const auto *fsa =\n          trans ? new ProjectFst<Arc>(ifst, PROJECT_INPUT) : &ifst;\n      opts.state_table = new StateTable(*fsa, *fsa);\n      const ComposeFst<Arc> cfst(*fsa, *fsa, opts);\n      std::vector<bool> coaccess;\n      uint64_t props = 0;\n      SccVisitor<Arc> scc_visitor(nullptr, nullptr, &coaccess, &props);\n      DfsVisit(cfst, &scc_visitor);\n      for (StateId s = 0; s < coaccess.size(); ++s) {\n        if (coaccess[s]) {\n          related_.insert(opts.state_table->Tuple(s).StatePair());\n        }\n      }\n      if (trans) delete fsa;\n    }\n\n    bool operator()(const StateId s1, StateId s2) const {\n      return related_.count(std::make_pair(s1, s2)) > 0;\n    }\n\n   private:\n    // States s1 and s2 resp. are in this relation iff they there is a\n    // path from s1 to a final state that has the same label as some\n    // path from s2 to a final state.\n    std::set<std::pair<StateId, StateId>> related_;\n  };\n\n  using ArcIdMap = std::multimap<ArcId, ArcId, ArcIdCompare>;\n\n  // Inserts candidate into the arc ID map.\n  inline void InsertCandidate(StateId s1, StateId s2, const ArcId &a1,\n                              const ArcId &a2) {\n    candidates_->insert(head_[s1] > head_[s2] ? std::make_pair(a1, a2)\n                                              : std::make_pair(a2, a1));\n  }\n\n  // Returns the arc corresponding to ArcId a.\n  static Arc GetArc(const Fst<Arc> &fst, ArcId aid) {\n    if (aid.second == -1) {  // Returns super-final transition.\n      return Arc(kNoLabel, kNoLabel, fst.Final(aid.first), kNoStateId);\n    } else {\n      ArcIterator<Fst<Arc>> aiter(fst, aid.first);\n      aiter.Seek(aid.second);\n      return aiter.Value();\n    }\n  }\n\n  // Outputs an equivalent FST whose states are subsets of states that have a\n  // future path in common.\n  void PreDisambiguate(const ExpandedFst<Arc> &ifst, MutableFst<Arc> *ofst,\n                       const DisambiguateOptions<Arc> &opts);\n\n  // Finds transitions that are ambiguous candidates in the result of\n  // PreDisambiguate.\n  void FindAmbiguities(const ExpandedFst<Arc> &fst);\n\n  // Finds transition pairs that are ambiguous candidates from two specified\n  // source states.\n  void FindAmbiguousPairs(const ExpandedFst<Arc> &fst, StateId s1, StateId s2);\n\n  // Marks ambiguous transitions to be removed.\n  void MarkAmbiguities();\n\n  // Deletes spurious ambiguous transitions (due to quantization).\n  void RemoveSplits(MutableFst<Arc> *ofst);\n\n  // Deletes actual ambiguous transitions.\n  void RemoveAmbiguities(MutableFst<Arc> *ofst);\n\n  // States s1 and s2 are in this relation iff there is a path from the initial\n  // state to s1 that has the same label as some path from the initial state to\n  // s2. We store only state pairs s1, s2 such that s1 <= s2.\n  std::set<std::pair<StateId, StateId>> coreachable_;\n\n  // Queue of disambiguation-related states to be processed. We store only\n  // state pairs s1, s2 such that s1 <= s2.\n  std::list<std::pair<StateId, StateId>> queue_;\n\n  // Head state in the pre-disambiguation for a given state.\n  std::vector<StateId> head_;\n\n  // Maps from a candidate ambiguous arc A to each ambiguous candidate arc B\n  // with the same label and destination state as A, whose source state s' is\n  // coreachable with the source state s of A, and for which head(s') < head(s).\n  std::unique_ptr<ArcIdMap> candidates_;\n\n  // Set of ambiguous transitions to be removed.\n  std::set<ArcId> ambiguous_;\n\n  // States to merge due to quantization issues.\n  std::unique_ptr<UnionFind<StateId>> merge_;\n  // Marks error condition.\n  bool error_;\n\n  Disambiguator(const Disambiguator &) = delete;\n  Disambiguator &operator=(const Disambiguator &) = delete;\n};\n\ntemplate <class Arc>\nvoid Disambiguator<Arc>::PreDisambiguate(const ExpandedFst<Arc> &ifst,\n                                         MutableFst<Arc> *ofst,\n                                         const DisambiguateOptions<Arc> &opts) {\n  using CommonDivisor = DefaultCommonDivisor<Weight>;\n  using Filter = RelationDeterminizeFilter<Arc, CommonFuture>;\n  // Subset elements with states s1 and s2 (resp.) are in this relation iff they\n  // there is a path from s1 to a final state that has the same label as some\n  // path from s2 to a final state.\n  auto *common_future = new CommonFuture(ifst);\n  DeterminizeFstOptions<Arc, CommonDivisor, Filter> nopts;\n  nopts.delta = opts.delta;\n  nopts.subsequential_label = opts.subsequential_label;\n  nopts.filter = new Filter(ifst, common_future, &head_);\n  // The filter takes ownership of 'common_future', and determinization takes\n  // ownership of the filter itself.\n  nopts.gc_limit = 0;  // Cache only the last state for fastest copy.\n  if (opts.weight_threshold != Weight::Zero() ||\n      opts.state_threshold != kNoStateId) {\n    /* TODO(riley): fails regression test; understand why\n    if (ifst.Properties(kAcceptor, true)) {\n      std::vector<Weight> idistance, odistance;\n      ShortestDistance(ifst, &idistance, true);\n      DeterminizeFst<Arc> dfst(ifst, &idistance, &odistance, nopts);\n      PruneOptions< Arc, AnyArcFilter<Arc>> popts(opts.weight_threshold,\n                                                   opts.state_threshold,\n                                                   AnyArcFilter<Arc>(),\n                                                   &odistance);\n      Prune(dfst, ofst, popts);\n      } else */ {\n      *ofst = DeterminizeFst<Arc>(ifst, nopts);\n      Prune(ofst, opts.weight_threshold, opts.state_threshold);\n    }\n  } else {\n    *ofst = DeterminizeFst<Arc>(ifst, nopts);\n  }\n  head_.resize(ofst->NumStates(), kNoStateId);\n}\n\ntemplate <class Arc>\nvoid Disambiguator<Arc>::FindAmbiguities(const ExpandedFst<Arc> &fst) {\n  if (fst.Start() == kNoStateId) return;\n  candidates_.reset(new ArcIdMap(ArcIdCompare(head_)));\n  const auto start_pr = std::make_pair(fst.Start(), fst.Start());\n  coreachable_.insert(start_pr);\n  queue_.push_back(start_pr);\n  while (!queue_.empty()) {\n    const auto &pr = queue_.front();\n    const auto s1 = pr.first;\n    const auto s2 = pr.second;\n    queue_.pop_front();\n    FindAmbiguousPairs(fst, s1, s2);\n  }\n}\n\ntemplate <class Arc>\nvoid Disambiguator<Arc>::FindAmbiguousPairs(const ExpandedFst<Arc> &fst,\n                                            StateId s1, StateId s2) {\n  if (fst.NumArcs(s2) > fst.NumArcs(s1)) FindAmbiguousPairs(fst, s2, s1);\n  SortedMatcher<Fst<Arc>> matcher(fst, MATCH_INPUT);\n  matcher.SetState(s2);\n  for (ArcIterator<Fst<Arc>> aiter(fst, s1); !aiter.Done(); aiter.Next()) {\n    const auto &arc1 = aiter.Value();\n    const ArcId a1(s1, aiter.Position());\n    if (matcher.Find(arc1.ilabel)) {\n      for (; !matcher.Done(); matcher.Next()) {\n        const auto &arc2 = matcher.Value();\n        // Continues on implicit epsilon match.\n        if (arc2.ilabel == kNoLabel) continue;\n        const ArcId a2(s2, matcher.Position());\n        // Actual transition is ambiguous.\n        if (s1 != s2 && arc1.nextstate == arc2.nextstate) {\n          InsertCandidate(s1, s2, a1, a2);\n        }\n        const auto spr = arc1.nextstate <= arc2.nextstate\n                             ? std::make_pair(arc1.nextstate, arc2.nextstate)\n                             : std::make_pair(arc2.nextstate, arc1.nextstate);\n        // Not already marked as coreachable?\n        if (coreachable_.insert(spr).second) {\n          // Only possible if state split by quantization issues.\n          if (spr.first != spr.second &&\n              head_[spr.first] == head_[spr.second]) {\n            if (!merge_) {\n              merge_.reset(new UnionFind<StateId>(fst.NumStates(), kNoStateId));\n              merge_->MakeAllSet(fst.NumStates());\n            }\n            merge_->Union(spr.first, spr.second);\n          } else {\n            queue_.push_back(spr);\n          }\n        }\n      }\n    }\n  }\n  // Super-final transition is ambiguous.\n  if (s1 != s2 && fst.Final(s1) != Weight::Zero() &&\n      fst.Final(s2) != Weight::Zero()) {\n    const ArcId a1(s1, -1);\n    const ArcId a2(s2, -1);\n    InsertCandidate(s1, s2, a1, a2);\n  }\n}\n\ntemplate <class Arc>\nvoid Disambiguator<Arc>::MarkAmbiguities() {\n  if (!candidates_) return;\n  for (auto it = candidates_->begin(); it != candidates_->end(); ++it) {\n    const auto a = it->first;\n    const auto b = it->second;\n    // If b is not to be removed, then a is.\n    if (ambiguous_.count(b) == 0) ambiguous_.insert(a);\n  }\n  coreachable_.clear();\n  candidates_.reset();\n}\n\ntemplate <class Arc>\nvoid Disambiguator<Arc>::RemoveSplits(MutableFst<Arc> *ofst) {\n  if (!merge_) return;\n  // Merges split states to remove spurious ambiguities.\n  for (StateIterator<MutableFst<Arc>> siter(*ofst); !siter.Done();\n       siter.Next()) {\n    for (MutableArcIterator<MutableFst<Arc>> aiter(ofst, siter.Value());\n         !aiter.Done(); aiter.Next()) {\n      auto arc = aiter.Value();\n      const auto nextstate = merge_->FindSet(arc.nextstate);\n      if (nextstate != arc.nextstate) {\n        arc.nextstate = nextstate;\n        aiter.SetValue(arc);\n      }\n    }\n  }\n  // Repeats search for actual ambiguities on modified FST.\n  coreachable_.clear();\n  merge_.reset();\n  candidates_.reset();\n  FindAmbiguities(*ofst);\n  if (merge_) {  // Shouldn't get here; sanity test.\n    FSTERROR() << \"Disambiguate: Unable to remove spurious ambiguities\";\n    error_ = true;\n    return;\n  }\n}\n\ntemplate <class Arc>\nvoid Disambiguator<Arc>::RemoveAmbiguities(MutableFst<Arc> *ofst) {\n  if (ambiguous_.empty()) return;\n  // Adds dead state to redirect ambiguous transitions to be removed.\n  const auto dead = ofst->AddState();\n  for (auto it = ambiguous_.begin(); it != ambiguous_.end(); ++it) {\n    const auto pos = it->second;\n    if (pos >= 0) {  // Actual transition.\n      MutableArcIterator<MutableFst<Arc>> aiter(ofst, it->first);\n      aiter.Seek(pos);\n      auto arc = aiter.Value();\n      arc.nextstate = dead;\n      aiter.SetValue(arc);\n    } else {  // Super-final transition.\n      ofst->SetFinal(it->first, Weight::Zero());\n    }\n  }\n  Connect(ofst);\n  ambiguous_.clear();\n}\n\n}  // namespace internal\n\n// Disambiguates a weighted FST. This version writes the disambiguated FST to an\n// output MutableFst. The result will be an equivalent FST that has the\n// property that there are not two distinct paths from the initial state to a\n// final state with the same input labeling.\n//\n// The weights must be (weakly) left divisible (valid for Tropical and\n// LogWeight).\n//\n// Complexity:\n//\n//   Disambiguable: exponential (polynomial in the size of the output).\n//   Non-disambiguable: does not terminate.\n//\n// The disambiguable transducers include all automata and functional transducers\n// that are unweighted or that are acyclic or that are unambiguous.\n//\n// For more information, see:\n//\n// Mohri, M. and Riley, M. 2015. On the disambiguation of weighted automata.\n// In CIAA, pages 263-278.\ntemplate <class Arc>\nvoid Disambiguate(\n    const Fst<Arc> &ifst, MutableFst<Arc> *ofst,\n    const DisambiguateOptions<Arc> &opts = DisambiguateOptions<Arc>()) {\n  internal::Disambiguator<Arc> disambiguator;\n  disambiguator.Disambiguate(ifst, ofst, opts);\n}\n\n}  // namespace fst\n\n#endif  // FST_DISAMBIGUATE_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/edit-fst.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// An FST implementation that allows non-destructive edit operations on an\n// existing FST.\n//\n// The EditFst class enables non-destructive edit operations on a wrapped\n// ExpandedFst. The implementation uses copy-on-write semantics at the node\n// level: if a user has an underlying fst on which he or she wants to perform a\n// relatively small number of edits (read: mutations), then this implementation\n// will copy the edited node to an internal MutableFst and perform any edits in\n// situ on that copied node. This class supports all the methods of MutableFst\n// except for DeleteStates(const std::vector<StateId> &); thus, new nodes may\n// also be\n// added, and one may add transitions from existing nodes of the wrapped fst to\n// new nodes.\n//\n// N.B.: The documentation for Fst::Copy(true) says that its behavior is\n// undefined if invoked on an fst that has already been accessed.  This class\n// requires that the Fst implementation it wraps provides consistent, reliable\n// behavior when its Copy(true) method is invoked, where consistent means\n// the graph structure, graph properties and state numbering and do not change.\n// VectorFst and CompactFst, for example, are both well-behaved in this regard.\n\n#ifndef FST_EDIT_FST_H_\n#define FST_EDIT_FST_H_\n\n#include <string>\n#include <unordered_map>\n#include <vector>\n\n#include <fst/log.h>\n\n#include <fst/cache.h>\n\n\nnamespace fst {\nnamespace internal {\n\n// The EditFstData class is a container for all mutable data for EditFstImpl;\n// also, this class provides most of the actual implementation of what EditFst\n// does (that is, most of EditFstImpl's methods delegate to methods in this, the\n// EditFstData class).  Instances of this class are reference-counted and can be\n// shared between otherwise independent EditFstImpl instances. This scheme\n// allows EditFstImpl to implement the thread-safe, copy-on-write semantics\n// required by Fst::Copy(true).\n//\n// template parameters:\n//   A the type of arc to use\n//   WrappedFstT the type of fst wrapped by the EditFst instance that\n//     this EditFstData instance is backing\n//   MutableFstT the type of mutable fst to use internally for edited states;\n//     crucially, MutableFstT::Copy(false) *must* yield an fst that is\n//     thread-safe for reading (VectorFst, for example, has this property)\ntemplate <typename Arc, typename WrappedFstT = ExpandedFst<Arc>,\n          typename MutableFstT = VectorFst<Arc>>\nclass EditFstData {\n public:\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  EditFstData() : num_new_states_(0) {}\n\n  EditFstData(const EditFstData &other)\n      : edits_(other.edits_),\n        external_to_internal_ids_(other.external_to_internal_ids_),\n        edited_final_weights_(other.edited_final_weights_),\n        num_new_states_(other.num_new_states_) {}\n\n  ~EditFstData() {}\n\n  static EditFstData<Arc, WrappedFstT, MutableFstT> *Read(\n      std::istream &strm, const FstReadOptions &opts);\n\n  bool Write(std::ostream &strm, const FstWriteOptions &opts) const {\n    // Serialize all private data members of this class.\n    FstWriteOptions edits_opts(opts);\n    edits_opts.write_header = true;  // Force writing contained header.\n    edits_.Write(strm, edits_opts);\n    WriteType(strm, external_to_internal_ids_);\n    WriteType(strm, edited_final_weights_);\n    WriteType(strm, num_new_states_);\n    if (!strm) {\n      LOG(ERROR) << \"EditFstData::Write: Write failed: \" << opts.source;\n      return false;\n    }\n    return true;\n  }\n\n  StateId NumNewStates() const { return num_new_states_; }\n\n  // accessor methods for the fst holding edited states\n  StateId EditedStart() const { return edits_.Start(); }\n\n  Weight Final(StateId s, const WrappedFstT *wrapped) const {\n    auto final_weight_it = GetFinalWeightIterator(s);\n    if (final_weight_it == NotInFinalWeightMap()) {\n      auto it = GetEditedIdMapIterator(s);\n      return it == NotInEditedMap() ? wrapped->Final(s)\n                                    : edits_.Final(it->second);\n    } else {\n      return final_weight_it->second;\n    }\n  }\n\n  size_t NumArcs(StateId s, const WrappedFstT *wrapped) const {\n    auto it = GetEditedIdMapIterator(s);\n    return it == NotInEditedMap() ? wrapped->NumArcs(s)\n                                  : edits_.NumArcs(it->second);\n  }\n\n  size_t NumInputEpsilons(StateId s, const WrappedFstT *wrapped) const {\n    auto it = GetEditedIdMapIterator(s);\n    return it == NotInEditedMap() ? wrapped->NumInputEpsilons(s)\n                                  : edits_.NumInputEpsilons(it->second);\n  }\n\n  size_t NumOutputEpsilons(StateId s, const WrappedFstT *wrapped) const {\n    auto it = GetEditedIdMapIterator(s);\n    return it == NotInEditedMap() ? wrapped->NumOutputEpsilons(s)\n                                  : edits_.NumOutputEpsilons(it->second);\n  }\n\n  void SetEditedProperties(uint64_t props, uint64_t mask) {\n    edits_.SetProperties(props, mask);\n  }\n\n  // Non-const MutableFst operations.\n\n  // Sets the start state for this FST.\n  void SetStart(StateId s) { edits_.SetStart(s); }\n\n  // Sets the final state for this FST.\n  Weight SetFinal(StateId s, Weight w, const WrappedFstT *wrapped) {\n    Weight old_weight = Final(s, wrapped);\n    auto it = GetEditedIdMapIterator(s);\n    // If we haven't already edited state s, don't add it to edited_ (which can\n    // be expensive if s has many transitions); just use the\n    // edited_final_weights_ map.\n    if (it == NotInEditedMap()) {\n      edited_final_weights_[s] = w;\n    } else {\n      edits_.SetFinal(GetEditableInternalId(s, wrapped), w);\n    }\n    return old_weight;\n  }\n\n  // Adds a new state to this FST, initially with no arcs.\n  StateId AddState(StateId curr_num_states) {\n    StateId internal_state_id = edits_.AddState();\n    StateId external_state_id = curr_num_states;\n    external_to_internal_ids_[external_state_id] = internal_state_id;\n    num_new_states_++;\n    return external_state_id;\n  }\n\n  // Adds the specified arc to the specified state of this FST.\n  const Arc *AddArc(StateId s, const Arc &arc, const WrappedFstT *wrapped) {\n    const auto internal_id = GetEditableInternalId(s, wrapped);\n    const auto num_arcs = edits_.NumArcs(internal_id);\n    ArcIterator<MutableFstT> arc_it(edits_, internal_id);\n    const Arc *prev_arc = nullptr;\n    if (num_arcs > 0) {\n      // grab the final arc associated with this state in edits_\n      arc_it.Seek(num_arcs - 1);\n      prev_arc = &(arc_it.Value());\n    }\n    edits_.AddArc(internal_id, arc);\n    return prev_arc;\n  }\n\n  void DeleteStates() {\n    edits_.DeleteStates();\n    num_new_states_ = 0;\n    external_to_internal_ids_.clear();\n    edited_final_weights_.clear();\n  }\n\n  // Removes all but the first n outgoing arcs of the specified state.\n  void DeleteArcs(StateId s, size_t n, const WrappedFstT *wrapped) {\n    edits_.DeleteArcs(GetEditableInternalId(s, wrapped), n);\n  }\n\n  // Removes all outgoing arcs from the specified state.\n  void DeleteArcs(StateId s, const WrappedFstT *wrapped) {\n    edits_.DeleteArcs(GetEditableInternalId(s, wrapped));\n  }\n\n  // End methods for non-const MutableFst operations.\n\n  // Provides information for the generic arc iterator.\n  void InitArcIterator(StateId s, ArcIteratorData<Arc> *data,\n                       const WrappedFstT *wrapped) const {\n    auto id_map_it = GetEditedIdMapIterator(s);\n    if (id_map_it == NotInEditedMap()) {\n      VLOG(3) << \"EditFstData::InitArcIterator: iterating on state \" << s\n              << \" of original fst\";\n      wrapped->InitArcIterator(s, data);\n    } else {\n      VLOG(2) << \"EditFstData::InitArcIterator: iterating on edited state \" << s\n              << \" (internal state id: \" << id_map_it->second << \")\";\n      edits_.InitArcIterator(id_map_it->second, data);\n    }\n  }\n\n  // Provides information for the generic mutable arc iterator.\n  void InitMutableArcIterator(StateId s, MutableArcIteratorData<Arc> *data,\n                              const WrappedFstT *wrapped) {\n    data->base = new MutableArcIterator<MutableFstT>(\n        &edits_, GetEditableInternalId(s, wrapped));\n  }\n\n  // Prints out the map from external to internal state id's (for debugging\n  // purposes).\n  void PrintMap() {\n    for (auto map_it = external_to_internal_ids_.begin();\n         map_it != NotInEditedMap(); ++map_it) {\n      LOG(INFO) << \"(external,internal)=(\" << map_it->first << \",\"\n                << map_it->second << \")\";\n    }\n  }\n\n private:\n  // Returns the iterator of the map from external to internal state id's\n  // of edits_ for the specified external state id.\n  typename std::unordered_map<StateId, StateId>::const_iterator\n      GetEditedIdMapIterator(StateId s) const {\n    return external_to_internal_ids_.find(s);\n  }\n\n  typename std::unordered_map<StateId, StateId>::const_iterator\n      NotInEditedMap() const {\n    return external_to_internal_ids_.end();\n  }\n\n  typename std::unordered_map<StateId, Weight>::const_iterator\n      GetFinalWeightIterator(StateId s) const {\n    return edited_final_weights_.find(s);\n  }\n\n  typename std::unordered_map<StateId, Weight>::const_iterator\n      NotInFinalWeightMap() const {\n    return edited_final_weights_.end();\n  }\n\n  // Returns the internal state ID of the specified external ID if the state has\n  // already been made editable, or else copies the state from wrapped_ to\n  // edits_ and returns the state id of the newly editable state in edits_.\n  StateId GetEditableInternalId(StateId s, const WrappedFstT *wrapped) {\n    auto id_map_it = GetEditedIdMapIterator(s);\n    if (id_map_it == NotInEditedMap()) {\n      StateId new_internal_id = edits_.AddState();\n      VLOG(2) << \"EditFstData::GetEditableInternalId: editing state \" << s\n              << \" of original fst; new internal state id:\" << new_internal_id;\n      external_to_internal_ids_[s] = new_internal_id;\n      for (ArcIterator<Fst<Arc>> arc_iterator(*wrapped, s);\n           !arc_iterator.Done(); arc_iterator.Next()) {\n        edits_.AddArc(new_internal_id, arc_iterator.Value());\n      }\n      // Copies the final weight.\n      auto final_weight_it = GetFinalWeightIterator(s);\n      if (final_weight_it == NotInFinalWeightMap()) {\n        edits_.SetFinal(new_internal_id, wrapped->Final(s));\n      } else {\n        edits_.SetFinal(new_internal_id, final_weight_it->second);\n        edited_final_weights_.erase(s);\n      }\n      return new_internal_id;\n    } else {\n      return id_map_it->second;\n    }\n  }\n\n  // A mutable FST (by default, a VectorFst) to contain new states, and/or\n  // copies of states from a wrapped ExpandedFst that have been modified in\n  // some way.\n  MutableFstT edits_;\n  // A mapping from external state IDs to the internal IDs of states that\n  // appear in edits_.\n  std::unordered_map<StateId, StateId> external_to_internal_ids_;\n  // A mapping from external state IDs to final state weights assigned to\n  // those states.  The states in this map are *only* those whose final weight\n  // has been modified; if any other part of the state has been modified,\n  // the entire state is copied to edits_, and all modifications reside there.\n  std::unordered_map<StateId, Weight> edited_final_weights_;\n  // The number of new states added to this mutable fst impl, which is <= the\n  // number of states in edits_ (since edits_ contains both edited *and* new\n  // states).\n  StateId num_new_states_;\n};\n\n// EditFstData method implementations: just the Read method.\ntemplate <typename A, typename WrappedFstT, typename MutableFstT>\nEditFstData<A, WrappedFstT, MutableFstT> *\nEditFstData<A, WrappedFstT, MutableFstT>::Read(std::istream &strm,\n                                               const FstReadOptions &opts) {\n  auto *data = new EditFstData<A, WrappedFstT, MutableFstT>();\n  // next read in MutabelFstT machine that stores edits\n  FstReadOptions edits_opts(opts);\n  // Contained header was written out, so read it in.\n  edits_opts.header = nullptr;\n\n  // Because our internal representation of edited states is a solid object\n  // of type MutableFstT (defaults to VectorFst<A>) and not a pointer,\n  // and because the static Read method allocates a new object on the heap,\n  // we need to call Read, check if there was a failure, use\n  // MutableFstT::operator= to assign the object (not the pointer) to the\n  // edits_ data member (which will increase the ref count by 1 on the impl)\n  // and, finally, delete the heap-allocated object.\n  std::unique_ptr<MutableFstT> edits(MutableFstT::Read(strm, edits_opts));\n  if (!edits) return nullptr;\n  data->edits_ = *edits;\n  edits.reset();\n  // Finally, reads in rest of private data members.\n  ReadType(strm, &data->external_to_internal_ids_);\n  ReadType(strm, &data->edited_final_weights_);\n  ReadType(strm, &data->num_new_states_);\n  if (!strm) {\n    LOG(ERROR) << \"EditFst::Read: read failed: \" << opts.source;\n    return nullptr;\n  }\n  return data;\n}\n\n// This class enables non-destructive edit operations on a wrapped ExpandedFst.\n// The implementation uses copy-on-write semantics at the node level: if a user\n// has an underlying fst on which he or she wants to perform a relatively small\n// number of edits (read: mutations), then this implementation will copy the\n// edited node to an internal MutableFst and perform any edits in situ on that\n// copied node. This class supports all the methods of MutableFst except for\n// DeleteStates(const std::vector<StateId> &); thus, new nodes may also be\n// added, and\n// one may add transitions from existing nodes of the wrapped fst to new nodes.\n//\n// template parameters:\n//   A the type of arc to use\n//   WrappedFstT the type of fst wrapped by the EditFst instance that\n//     this EditFstImpl instance is backing\n//   MutableFstT the type of mutable fst to use internally for edited states;\n//     crucially, MutableFstT::Copy(false) *must* yield an fst that is\n//     thread-safe for reading (VectorFst, for example, has this property)\ntemplate <typename A, typename WrappedFstT = ExpandedFst<A>,\n          typename MutableFstT = VectorFst<A>>\nclass EditFstImpl : public FstImpl<A> {\n public:\n  using Arc = A;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using FstImpl<Arc>::SetProperties;\n  using FstImpl<Arc>::SetInputSymbols;\n  using FstImpl<Arc>::SetOutputSymbols;\n  using FstImpl<Arc>::WriteHeader;\n\n  // Constructs an editable FST implementation with no states. Effectively, this\n  // initially-empty fst will in every way mimic the behavior of a\n  // VectorFst---more precisely, a VectorFstImpl instance---but with slightly\n  // slower performance (by a constant factor), due to the fact that\n  // this class maintains a mapping between external state id's and\n  // their internal equivalents.\n  EditFstImpl() : wrapped_(new MutableFstT()) {\n    FstImpl<Arc>::SetType(\"edit\");\n    InheritPropertiesFromWrapped();\n    data_ = std::make_shared<EditFstData<Arc, WrappedFstT, MutableFstT>>();\n  }\n\n  // Wraps the specified ExpandedFst. This constructor requires that the\n  // specified Fst is an ExpandedFst instance. This requirement is only enforced\n  // at runtime. (See below for the reason.)\n  //\n  // This library uses the pointer-to-implementation or \"PIMPL\" design pattern.\n  // In particular, to make it convenient to bind an implementation class to its\n  // interface, there are a pair of template \"binder\" classes, one for immutable\n  // and one for mutable fst's (ImplToFst and ImplToMutableFst, respectively).\n  // As it happens, the API for the ImplToMutableFst<I,F> class requires that\n  // the implementation class--the template parameter \"I\"--have a constructor\n  // taking a const Fst<A> reference.  Accordingly, the constructor here must\n  // perform a static_cast to the WrappedFstT type required by EditFst and\n  // therefore EditFstImpl.\n  explicit EditFstImpl(const Fst<Arc> &wrapped)\n      : wrapped_(static_cast<WrappedFstT *>(wrapped.Copy())) {\n    FstImpl<Arc>::SetType(\"edit\");\n    data_ = std::make_shared<EditFstData<Arc, WrappedFstT, MutableFstT>>();\n    // have edits_ inherit all properties from wrapped_\n    data_->SetEditedProperties(wrapped_->Properties(kFstProperties, false),\n                               kFstProperties);\n    InheritPropertiesFromWrapped();\n  }\n\n  // A copy constructor for this implementation class, used to implement\n  // the Copy() method of the Fst interface.\n  EditFstImpl(const EditFstImpl &impl)\n      : FstImpl<Arc>(),\n        wrapped_(static_cast<WrappedFstT *>(impl.wrapped_->Copy(true))),\n        data_(impl.data_) {\n    SetProperties(impl.Properties());\n  }\n\n  // const Fst/ExpandedFst operations, declared in the Fst and ExpandedFst\n  // interfaces\n  StateId Start() const {\n    const auto edited_start = data_->EditedStart();\n    return edited_start == kNoStateId ? wrapped_->Start() : edited_start;\n  }\n\n  Weight Final(StateId s) const { return data_->Final(s, wrapped_.get()); }\n\n  size_t NumArcs(StateId s) const { return data_->NumArcs(s, wrapped_.get()); }\n\n  size_t NumInputEpsilons(StateId s) const {\n    return data_->NumInputEpsilons(s, wrapped_.get());\n  }\n\n  size_t NumOutputEpsilons(StateId s) const {\n    return data_->NumOutputEpsilons(s, wrapped_.get());\n  }\n\n  StateId NumStates() const {\n    return wrapped_->NumStates() + data_->NumNewStates();\n  }\n\n  static EditFstImpl<Arc, WrappedFstT, MutableFstT> *Read(\n      std::istream &strm, const FstReadOptions &opts);\n\n  bool Write(std::ostream &strm, const FstWriteOptions &opts) const {\n    FstHeader hdr;\n    hdr.SetStart(Start());\n    hdr.SetNumStates(NumStates());\n    FstWriteOptions header_opts(opts);\n    // Allows the contained FST to hold any symbols.\n    header_opts.write_isymbols = false;\n    header_opts.write_osymbols = false;\n    WriteHeader(strm, header_opts, kFileVersion, &hdr);\n    // First, serializes the wrapped FST to stream.\n    FstWriteOptions wrapped_opts(opts);\n    // Forcse writing the contained header.\n    wrapped_opts.write_header = true;\n    wrapped_->Write(strm, wrapped_opts);\n    data_->Write(strm, opts);\n    strm.flush();\n    if (!strm) {\n      LOG(ERROR) << \"EditFst::Write: Write failed: \" << opts.source;\n      return false;\n    }\n    return true;\n  }\n\n  // Sets the start state for this FST.\n  void SetStart(StateId s) {\n    MutateCheck();\n    data_->SetStart(s);\n    SetProperties(SetStartProperties(FstImpl<Arc>::Properties()));\n  }\n\n  // Sets the final state for this fst.\n  void SetFinal(StateId s, Weight weight) {\n    MutateCheck();\n    Weight old_weight = data_->SetFinal(s, weight, wrapped_.get());\n    SetProperties(\n        SetFinalProperties(FstImpl<Arc>::Properties(), old_weight, weight));\n  }\n\n  // Adds a new state to this fst, initially with no arcs.\n  StateId AddState() {\n    MutateCheck();\n    SetProperties(AddStateProperties(FstImpl<Arc>::Properties()));\n    return data_->AddState(NumStates());\n  }\n\n  // Adds the specified arc to the specified state of this fst.\n  void AddArc(StateId s, const Arc &arc) {\n    MutateCheck();\n    const auto *prev_arc = data_->AddArc(s, arc, wrapped_.get());\n    SetProperties(\n        AddArcProperties(FstImpl<Arc>::Properties(), s, arc, prev_arc));\n  }\n\n  void DeleteStates(const std::vector<StateId> &dstates) {\n    FSTERROR() << \": EditFstImpl::DeleteStates(const std::vector<StateId>&): \"\n               << \" not implemented\";\n    SetProperties(kError, kError);\n  }\n\n  // Deletes all states in this fst.\n  void DeleteStates();\n\n  // Removes all but the first n outgoing arcs of the specified state.\n  void DeleteArcs(StateId s, size_t n) {\n    MutateCheck();\n    data_->DeleteArcs(s, n, wrapped_.get());\n    SetProperties(DeleteArcsProperties(FstImpl<Arc>::Properties()));\n  }\n\n  // Removes all outgoing arcs from the specified state.\n  void DeleteArcs(StateId s) {\n    MutateCheck();\n    data_->DeleteArcs(s, wrapped_.get());\n    SetProperties(DeleteArcsProperties(FstImpl<Arc>::Properties()));\n  }\n\n  void ReserveStates(StateId s) {}\n\n  void ReserveArcs(StateId s, size_t n) {}\n\n  // Ends non-const MutableFst operations.\n\n  // Provides information for the generic state iterator.\n  void InitStateIterator(StateIteratorData<Arc> *data) const {\n    data->base = nullptr;\n    data->nstates = NumStates();\n  }\n\n  // Provides information for the generic arc iterator.\n  void InitArcIterator(StateId s, ArcIteratorData<Arc> *data) const {\n    data_->InitArcIterator(s, data, wrapped_.get());\n  }\n\n  // Provides information for the generic mutable arc iterator.\n  void InitMutableArcIterator(StateId s, MutableArcIteratorData<Arc> *data) {\n    MutateCheck();\n    data_->InitMutableArcIterator(s, data, wrapped_.get());\n  }\n\n private:\n  // Properties always true of this FST class.\n  static constexpr uint64_t kStaticProperties = kExpanded | kMutable;\n  // Current file format version.\n  static constexpr int kFileVersion = 2;\n  // Minimum file format version supported\n  static constexpr int kMinFileVersion = 2;\n\n  // Causes this FST to inherit all the properties from its wrapped FST, except\n  // for the two properties that always apply to EditFst instances: kExpanded\n  // and kMutable.\n  void InheritPropertiesFromWrapped() {\n    SetProperties(wrapped_->Properties(kCopyProperties, false) |\n                  kStaticProperties);\n    SetInputSymbols(wrapped_->InputSymbols());\n    SetOutputSymbols(wrapped_->OutputSymbols());\n  }\n\n  // This method ensures that any operations that alter the mutable data\n  // portion of this EditFstImpl cause the data_ member to be copied when its\n  // reference count is greater than 1.  Note that this method is distinct from\n  // MutableFst::Mutate, which gets invoked whenever one of the basic mutation\n  // methods defined in MutableFst is invoked, such as SetInputSymbols.\n  // The MutateCheck here in EditFstImpl is invoked whenever one of the\n  // mutating methods specifically related to the types of edits provided\n  // by EditFst is performed, such as changing an arc of an existing state\n  // of the wrapped fst via a MutableArcIterator, or adding a new state via\n  // AddState().\n  void MutateCheck() {\n    if (!data_.unique()) {\n      data_ =\n          std::make_shared<EditFstData<Arc, WrappedFstT, MutableFstT>>(*data_);\n    }\n  }\n\n  // The FST that this FST wraps. The purpose of this class is to enable\n  // non-destructive edits on this wrapped FST.\n  std::unique_ptr<const WrappedFstT> wrapped_;\n  // The mutable data for this EditFst instance, with delegates for all the\n  // methods that can mutate data.\n  std::shared_ptr<EditFstData<Arc, WrappedFstT, MutableFstT>> data_;\n};\n\ntemplate <typename Arc, typename WrappedFstT, typename MutableFstT>\nconstexpr uint64_t EditFstImpl<Arc, WrappedFstT, MutableFstT>::kStaticProperties;\n\ntemplate <typename Arc, typename WrappedFstT, typename MutableFstT>\nconstexpr int EditFstImpl<Arc, WrappedFstT, MutableFstT>::kFileVersion;\n\ntemplate <typename Arc, typename WrappedFstT, typename MutableFstT>\nconstexpr int EditFstImpl<Arc, WrappedFstT, MutableFstT>::kMinFileVersion;\n\ntemplate <typename Arc, typename WrappedFstT, typename MutableFstT>\ninline void EditFstImpl<Arc, WrappedFstT, MutableFstT>::DeleteStates() {\n  data_->DeleteStates();\n  // we are deleting all states, so just forget about pointer to wrapped_\n  // and do what default constructor does: set wrapped_ to a new VectorFst\n  wrapped_.reset(new MutableFstT());\n  const auto new_props =\n      DeleteAllStatesProperties(FstImpl<Arc>::Properties(), kStaticProperties);\n  FstImpl<Arc>::SetProperties(new_props);\n}\n\ntemplate <typename Arc, typename WrappedFstT, typename MutableFstT>\nEditFstImpl<Arc, WrappedFstT, MutableFstT> *\nEditFstImpl<Arc, WrappedFstT, MutableFstT>::Read(std::istream &strm,\n                                                 const FstReadOptions &opts) {\n  auto *impl = new EditFstImpl();\n  FstHeader hdr;\n  if (!impl->ReadHeader(strm, opts, kMinFileVersion, &hdr)) return nullptr;\n  impl->SetStart(hdr.Start());\n  // Reads in wrapped FST.\n  FstReadOptions wrapped_opts(opts);\n  // Contained header was written out, so reads it in too.\n  wrapped_opts.header = nullptr;\n  std::unique_ptr<Fst<Arc>> wrapped_fst(Fst<Arc>::Read(strm, wrapped_opts));\n  if (!wrapped_fst) return nullptr;\n  impl->wrapped_.reset(static_cast<WrappedFstT *>(wrapped_fst.release()));\n  impl->data_ = std::shared_ptr<EditFstData<Arc, WrappedFstT, MutableFstT>>(\n      EditFstData<Arc, WrappedFstT, MutableFstT>::Read(strm, opts));\n  if (!impl->data_) return nullptr;\n  return impl;\n}\n\n}  // namespace internal\n\n// Concrete, editable FST.  This class attaches interface to implementation.\ntemplate <typename A, typename WrappedFstT = ExpandedFst<A>,\n          typename MutableFstT = VectorFst<A>>\nclass EditFst : public ImplToMutableFst<\n                    internal::EditFstImpl<A, WrappedFstT, MutableFstT>> {\n public:\n  using Arc = A;\n  using StateId = typename Arc::StateId;\n\n  using Impl = internal::EditFstImpl<Arc, WrappedFstT, MutableFstT>;\n\n  friend class MutableArcIterator<EditFst<Arc, WrappedFstT, MutableFstT>>;\n\n  EditFst() : ImplToMutableFst<Impl>(std::make_shared<Impl>()) {}\n\n  explicit EditFst(const Fst<Arc> &fst)\n      : ImplToMutableFst<Impl>(std::make_shared<Impl>(fst)) {}\n\n  explicit EditFst(const WrappedFstT &fst)\n      : ImplToMutableFst<Impl>(std::make_shared<Impl>(fst)) {}\n\n  // See Fst<>::Copy() for doc.\n  EditFst(const EditFst<Arc, WrappedFstT, MutableFstT> &fst, bool safe = false)\n      : ImplToMutableFst<Impl>(fst, safe) {}\n\n  ~EditFst() override {}\n\n  // Gets a copy of this EditFst. See Fst<>::Copy() for further doc.\n  EditFst<Arc, WrappedFstT, MutableFstT> *Copy(\n      bool safe = false) const override {\n    return new EditFst<Arc, WrappedFstT, MutableFstT>(*this, safe);\n  }\n\n  EditFst<Arc, WrappedFstT, MutableFstT> &operator=(\n      const EditFst<Arc, WrappedFstT, MutableFstT> &fst) {\n    SetImpl(fst.GetSharedImpl());\n    return *this;\n  }\n\n  EditFst<Arc, WrappedFstT, MutableFstT> &operator=(\n      const Fst<Arc> &fst) override {\n    SetImpl(std::make_shared<Impl>(fst));\n    return *this;\n  }\n\n  // Reads an EditFst from an input stream, returning nullptr on error.\n  static EditFst<Arc, WrappedFstT, MutableFstT> *Read(\n      std::istream &strm, const FstReadOptions &opts) {\n    auto *impl = Impl::Read(strm, opts);\n    return impl ? new EditFst<Arc>(std::shared_ptr<Impl>(impl)) : nullptr;\n  }\n\n  // Reads an EditFst from a file, returning nullptr on error. If the filename\n  // argument is an empty string, it reads from standard input.\n  static EditFst<Arc, WrappedFstT, MutableFstT> *Read(const string &filename) {\n    auto *impl = ImplToExpandedFst<Impl, MutableFst<Arc>>::Read(filename);\n    return impl ? new EditFst<Arc, WrappedFstT, MutableFstT>(\n                      std::shared_ptr<Impl>(impl))\n                : nullptr;\n  }\n\n  bool Write(std::ostream &strm, const FstWriteOptions &opts) const override {\n    return GetImpl()->Write(strm, opts);\n  }\n\n  bool Write(const string &filename) const override {\n    return Fst<Arc>::WriteFile(filename);\n  }\n\n  void InitStateIterator(StateIteratorData<Arc> *data) const override {\n    GetImpl()->InitStateIterator(data);\n  }\n\n  void InitArcIterator(StateId s, ArcIteratorData<Arc> *data) const override {\n    GetImpl()->InitArcIterator(s, data);\n  }\n\n  void InitMutableArcIterator(StateId s,\n                              MutableArcIteratorData<A> *data) override {\n    GetMutableImpl()->InitMutableArcIterator(s, data);\n  }\n\n private:\n  explicit EditFst(std::shared_ptr<Impl> impl) : ImplToMutableFst<Impl>(impl) {}\n\n  using ImplToFst<Impl, MutableFst<Arc>>::GetImpl;\n  using ImplToFst<Impl, MutableFst<Arc>>::GetMutableImpl;\n  using ImplToFst<Impl, MutableFst<Arc>>::SetImpl;\n};\n\n}  // namespace fst\n\n#endif  // FST_EDIT_FST_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/encode.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Class to encode and decode an FST.\n\n#ifndef FST_ENCODE_H_\n#define FST_ENCODE_H_\n\n#include <iostream>\n#include <memory>\n#include <string>\n#include <unordered_map>\n#include <utility>\n#include <vector>\n\n#include <fst/log.h>\n#include <fstream>\n\n#include <fst/arc-map.h>\n#include <fst/rmfinalepsilon.h>\n\n\nnamespace fst {\n\nenum EncodeType { ENCODE = 1, DECODE = 2 };\n\nstatic constexpr uint32_t kEncodeLabels = 0x0001;\nstatic constexpr uint32_t kEncodeWeights = 0x0002;\nstatic constexpr uint32_t kEncodeFlags = 0x0003;\n\nnamespace internal {\n\nstatic constexpr uint32_t kEncodeHasISymbols = 0x0004;\nstatic constexpr uint32_t kEncodeHasOSymbols = 0x0008;\n\n// Identifies stream data as an encode table (and its endianity)\nstatic const int32_t kEncodeMagicNumber = 2129983209;\n\n// The following class encapsulates implementation details for the encoding and\n// decoding of label/weight tuples used for encoding and decoding of FSTs. The\n// EncodeTable is bidirectional. I.e, it stores both the Tuple of encode labels\n// and weights to a unique label, and the reverse.\ntemplate <class Arc>\nclass EncodeTable {\n public:\n  using Label = typename Arc::Label;\n  using Weight = typename Arc::Weight;\n\n  // Encoded data consists of arc input/output labels and arc weight.\n  struct Tuple {\n    Tuple() {}\n\n    Tuple(Label ilabel_, Label olabel_, Weight weight_)\n        : ilabel(ilabel_), olabel(olabel_), weight(std::move(weight_)) {}\n\n    Tuple(const Tuple &tuple)\n        : ilabel(tuple.ilabel),\n          olabel(tuple.olabel),\n          weight(std::move(tuple.weight)) {}\n\n    Label ilabel;\n    Label olabel;\n    Weight weight;\n  };\n\n  // Comparison object for hashing EncodeTable Tuple(s).\n  class TupleEqual {\n   public:\n    bool operator()(const Tuple *x, const Tuple *y) const {\n      return (x->ilabel == y->ilabel && x->olabel == y->olabel &&\n              x->weight == y->weight);\n    }\n  };\n\n  // Hash function for EncodeTabe Tuples. Based on the encode flags\n  // we either hash the labels, weights or combination of them.\n  class TupleKey {\n   public:\n    TupleKey() : encode_flags_(kEncodeLabels | kEncodeWeights) {}\n\n    TupleKey(const TupleKey &key) : encode_flags_(key.encode_flags_) {}\n\n    explicit TupleKey(uint32_t encode_flags) : encode_flags_(encode_flags) {}\n\n    size_t operator()(const Tuple *x) const {\n      size_t hash = x->ilabel;\n      static constexpr int lshift = 5;\n      static constexpr int rshift = CHAR_BIT * sizeof(size_t) - 5;\n      if (encode_flags_ & kEncodeLabels) {\n        hash = hash << lshift ^ hash >> rshift ^ x->olabel;\n      }\n      if (encode_flags_ & kEncodeWeights) {\n        hash = hash << lshift ^ hash >> rshift ^ x->weight.Hash();\n      }\n      return hash;\n    }\n\n   private:\n    int32_t encode_flags_;\n  };\n\n  explicit EncodeTable(uint32_t encode_flags)\n      : flags_(encode_flags), encode_hash_(1024, TupleKey(encode_flags)) {}\n\n  using EncodeHash = std::unordered_map<const Tuple *, Label, TupleKey,\n                                        TupleEqual>;\n\n  // Given an arc, encodes either input/output labels or input/costs or both.\n  Label Encode(const Arc &arc) {\n    std::unique_ptr<Tuple> tuple(\n        new Tuple(arc.ilabel, flags_ & kEncodeLabels ? arc.olabel : 0,\n                  flags_ & kEncodeWeights ? arc.weight : Weight::One()));\n    auto insert_result = encode_hash_.insert(\n        std::make_pair(tuple.get(), encode_tuples_.size() + 1));\n    if (insert_result.second) encode_tuples_.push_back(std::move(tuple));\n    return insert_result.first->second;\n  }\n\n  // Given an arc, looks up its encoded label or returns kNoLabel if not found.\n  Label GetLabel(const Arc &arc) const {\n    const Tuple tuple(arc.ilabel, flags_ & kEncodeLabels ? arc.olabel : 0,\n                      flags_ & kEncodeWeights ? arc.weight : Weight::One());\n    auto it = encode_hash_.find(&tuple);\n    return (it == encode_hash_.end()) ?  kNoLabel : it->second;\n  }\n\n  // Given an encoded arc label, decodes back to input/output labels and costs.\n  const Tuple *Decode(Label key) const {\n    if (key < 1 || key > encode_tuples_.size()) {\n      LOG(ERROR) << \"EncodeTable::Decode: Unknown decode key: \" << key;\n      return nullptr;\n    }\n    return encode_tuples_[key - 1].get();\n  }\n\n  size_t Size() const { return encode_tuples_.size(); }\n\n  bool Write(std::ostream &strm, const string &source) const;\n\n  static EncodeTable<Arc> *Read(std::istream &strm, const string &source);\n\n  uint32_t Flags() const { return flags_ & kEncodeFlags; }\n\n  const SymbolTable *InputSymbols() const { return isymbols_.get(); }\n\n  const SymbolTable *OutputSymbols() const { return osymbols_.get(); }\n\n  void SetInputSymbols(const SymbolTable *syms) {\n    if (syms) {\n      isymbols_.reset(syms->Copy());\n      flags_ |= kEncodeHasISymbols;\n    } else {\n      isymbols_.reset();\n      flags_ &= ~kEncodeHasISymbols;\n    }\n  }\n\n  void SetOutputSymbols(const SymbolTable *syms) {\n    if (syms) {\n      osymbols_.reset(syms->Copy());\n      flags_ |= kEncodeHasOSymbols;\n    } else {\n      osymbols_.reset();\n      flags_ &= ~kEncodeHasOSymbols;\n    }\n  }\n\n private:\n  uint32_t flags_;\n  std::vector<std::unique_ptr<Tuple>> encode_tuples_;\n  EncodeHash encode_hash_;\n  std::unique_ptr<SymbolTable> isymbols_;  // Pre-encoded input symbol table.\n  std::unique_ptr<SymbolTable> osymbols_;  // Pre-encoded output symbol table.\n\n  EncodeTable(const EncodeTable &) = delete;\n  EncodeTable &operator=(const EncodeTable &) = delete;\n};\n\ntemplate <class Arc>\nbool EncodeTable<Arc>::Write(std::ostream &strm,\n                                  const string &source) const {\n  WriteType(strm, kEncodeMagicNumber);\n  WriteType(strm, flags_);\n  const int64_t size = encode_tuples_.size();\n  WriteType(strm, size);\n  for (const auto &tuple : encode_tuples_) {\n    WriteType(strm, tuple->ilabel);\n    WriteType(strm, tuple->olabel);\n    tuple->weight.Write(strm);\n  }\n  if (flags_ & kEncodeHasISymbols) isymbols_->Write(strm);\n  if (flags_ & kEncodeHasOSymbols) osymbols_->Write(strm);\n  strm.flush();\n  if (!strm) {\n    LOG(ERROR) << \"EncodeTable::Write: Write failed: \" << source;\n    return false;\n  }\n  return true;\n}\n\ntemplate <class Arc>\nEncodeTable<Arc> *EncodeTable<Arc>::Read(std::istream &strm,\n                                         const string &source) {\n  int32_t magic_number = 0;\n  ReadType(strm, &magic_number);\n  if (magic_number != kEncodeMagicNumber) {\n    LOG(ERROR) << \"EncodeTable::Read: Bad encode table header: \" << source;\n    return nullptr;\n  }\n  uint32_t flags;\n  ReadType(strm, &flags);\n  int64_t size;\n  ReadType(strm, &size);\n  if (!strm) {\n    LOG(ERROR) << \"EncodeTable::Read: Read failed: \" << source;\n    return nullptr;\n  }\n  std::unique_ptr<EncodeTable<Arc>> table(new EncodeTable<Arc>(flags));\n  for (int64_t i = 0; i < size; ++i) {\n    std::unique_ptr<Tuple> tuple(new Tuple());\n    ReadType(strm, &tuple->ilabel);\n    ReadType(strm, &tuple->olabel);\n    tuple->weight.Read(strm);\n    if (!strm) {\n      LOG(ERROR) << \"EncodeTable::Read: Read failed: \" << source;\n      return nullptr;\n    }\n    table->encode_tuples_.push_back(std::move(tuple));\n    table->encode_hash_[table->encode_tuples_.back().get()] =\n        table->encode_tuples_.size();\n  }\n  if (flags & kEncodeHasISymbols) {\n    table->isymbols_.reset(SymbolTable::Read(strm, source));\n  }\n  if (flags & kEncodeHasOSymbols) {\n    table->osymbols_.reset(SymbolTable::Read(strm, source));\n  }\n  return table.release();\n}\n\n}  // namespace internal\n\n// A mapper to encode/decode weighted transducers. Encoding of an FST is used\n// for performing classical determinization or minimization on a weighted\n// transducer viewing it as an unweighted acceptor over encoded labels.\n//\n// The mapper stores the encoding in a local hash table (EncodeTable). This\n// table is shared (and reference-counted) between the encoder and decoder.\n// A decoder has read-only access to the EncodeTable.\n//\n// The EncodeMapper allows on the fly encoding of the machine. As the\n// EncodeTable is generated the same table may by used to decode the machine\n// on the fly. For example in the following sequence of operations\n//\n//  Encode -> Determinize -> Decode\n//\n// we will use the encoding table generated during the encode step in the\n// decode, even though the encoding is not complete.\ntemplate <class Arc>\nclass EncodeMapper {\n  using Label = typename Arc::Label;\n  using Weight = typename Arc::Weight;\n\n public:\n  EncodeMapper(uint32_t flags, EncodeType type)\n      : flags_(flags),\n        type_(type),\n        table_(std::make_shared<internal::EncodeTable<Arc>>(flags)),\n        error_(false) {}\n\n  EncodeMapper(const EncodeMapper &mapper)\n      : flags_(mapper.flags_),\n        type_(mapper.type_),\n        table_(mapper.table_),\n        error_(false) {}\n\n  // Copy constructor but setting the type, typically to DECODE.\n  EncodeMapper(const EncodeMapper &mapper, EncodeType type)\n      : flags_(mapper.flags_),\n        type_(type),\n        table_(mapper.table_),\n        error_(mapper.error_) {}\n\n  Arc operator()(const Arc &arc);\n\n  MapFinalAction FinalAction() const {\n    return (type_ == ENCODE && (flags_ & kEncodeWeights))\n               ? MAP_REQUIRE_SUPERFINAL\n               : MAP_NO_SUPERFINAL;\n  }\n\n  constexpr MapSymbolsAction InputSymbolsAction() const {\n    return MAP_CLEAR_SYMBOLS;\n  }\n\n  constexpr MapSymbolsAction OutputSymbolsAction() const {\n    return MAP_CLEAR_SYMBOLS;\n  }\n\n  uint64_t Properties(uint64_t inprops) {\n    uint64_t outprops = inprops;\n    if (error_) outprops |= kError;\n    uint64_t mask = kFstProperties;\n    if (flags_ & kEncodeLabels) {\n      mask &= kILabelInvariantProperties & kOLabelInvariantProperties;\n    }\n    if (flags_ & kEncodeWeights) {\n      mask &= kILabelInvariantProperties & kWeightInvariantProperties &\n              (type_ == ENCODE ? kAddSuperFinalProperties\n                               : kRmSuperFinalProperties);\n    }\n    return outprops & mask;\n  }\n\n  uint32_t Flags() const { return flags_; }\n\n  EncodeType Type() const { return type_; }\n\n  bool Write(std::ostream &strm, const string &source) const {\n    return table_->Write(strm, source);\n  }\n\n  bool Write(const string &filename) const {\n    std::ofstream strm(filename,\n                             std::ios_base::out | std::ios_base::binary);\n    if (!strm) {\n      LOG(ERROR) << \"EncodeMap: Can't open file: \" << filename;\n      return false;\n    }\n    return Write(strm, filename);\n  }\n\n  static EncodeMapper<Arc> *Read(std::istream &strm, const string &source,\n                               EncodeType type = ENCODE) {\n    auto *table = internal::EncodeTable<Arc>::Read(strm, source);\n    return table ? new EncodeMapper(table->Flags(), type, table) : nullptr;\n  }\n\n  static EncodeMapper<Arc> *Read(const string &filename,\n                                 EncodeType type = ENCODE) {\n    std::ifstream strm(filename,\n                            std::ios_base::in | std::ios_base::binary);\n    if (!strm) {\n      LOG(ERROR) << \"EncodeMap: Can't open file: \" << filename;\n      return nullptr;\n    }\n    return Read(strm, filename, type);\n  }\n\n  const SymbolTable *InputSymbols() const { return table_->InputSymbols(); }\n\n  const SymbolTable *OutputSymbols() const { return table_->OutputSymbols(); }\n\n  void SetInputSymbols(const SymbolTable *syms) {\n    table_->SetInputSymbols(syms);\n  }\n\n  void SetOutputSymbols(const SymbolTable *syms) {\n    table_->SetOutputSymbols(syms);\n  }\n\n private:\n  uint32_t flags_;\n  EncodeType type_;\n  std::shared_ptr<internal::EncodeTable<Arc>> table_;\n  bool error_;\n\n  explicit EncodeMapper(uint32_t flags, EncodeType type,\n                        internal::EncodeTable<Arc> *table)\n      : flags_(flags), type_(type), table_(table), error_(false) {}\n\n  EncodeMapper &operator=(const EncodeMapper &) = delete;\n};\n\ntemplate <class Arc>\nArc EncodeMapper<Arc>::operator()(const Arc &arc) {\n  if (type_ == ENCODE) {\n    if ((arc.nextstate == kNoStateId && !(flags_ & kEncodeWeights)) ||\n        (arc.nextstate == kNoStateId && (flags_ & kEncodeWeights) &&\n         arc.weight == Weight::Zero())) {\n      return arc;\n    } else {\n      const auto label = table_->Encode(arc);\n      return Arc(label, flags_ & kEncodeLabels ? label : arc.olabel,\n                 flags_ & kEncodeWeights ? Weight::One() : arc.weight,\n                 arc.nextstate);\n    }\n  } else {  // type_ == DECODE\n    if (arc.nextstate == kNoStateId) {\n      return arc;\n    } else {\n      if (arc.ilabel == 0) return arc;\n      if (flags_ & kEncodeLabels && arc.ilabel != arc.olabel) {\n        FSTERROR() << \"EncodeMapper: Label-encoded arc has different \"\n                      \"input and output labels\";\n        error_ = true;\n      }\n      if (flags_ & kEncodeWeights && arc.weight != Weight::One()) {\n        FSTERROR() << \"EncodeMapper: Weight-encoded arc has non-trivial weight\";\n        error_ = true;\n      }\n      const auto tuple = table_->Decode(arc.ilabel);\n      if (!tuple) {\n        FSTERROR() << \"EncodeMapper: Decode failed\";\n        error_ = true;\n        return Arc(kNoLabel, kNoLabel, Weight::NoWeight(), arc.nextstate);\n      } else {\n        return Arc(tuple->ilabel,\n                   flags_ & kEncodeLabels ? tuple->olabel : arc.olabel,\n                   flags_ & kEncodeWeights ? tuple->weight : arc.weight,\n                   arc.nextstate);\n      }\n    }\n  }\n}\n\n// Complexity: O(E + V).\ntemplate <class Arc>\ninline void Encode(MutableFst<Arc> *fst, EncodeMapper<Arc> *mapper) {\n  mapper->SetInputSymbols(fst->InputSymbols());\n  mapper->SetOutputSymbols(fst->OutputSymbols());\n  ArcMap(fst, mapper);\n}\n\ntemplate <class Arc>\ninline void Decode(MutableFst<Arc> *fst, const EncodeMapper<Arc> &mapper) {\n  ArcMap(fst, EncodeMapper<Arc>(mapper, DECODE));\n  RmFinalEpsilon(fst);\n  fst->SetInputSymbols(mapper.InputSymbols());\n  fst->SetOutputSymbols(mapper.OutputSymbols());\n}\n\n// On-the-fly encoding of an input FST.\n//\n// Complexity:\n//\n//   Construction: O(1)\n//   Traversal: O(e + v)\n//\n// where e is the number of arcs visited and v is the number of states visited.\n// Constant time and space to visit an input state or arc is assumed and\n// exclusive of caching.\ntemplate <class Arc>\nclass EncodeFst : public ArcMapFst<Arc, Arc, EncodeMapper<Arc>> {\n public:\n  using Mapper = EncodeMapper<Arc>;\n  using Impl = internal::ArcMapFstImpl<Arc, Arc, Mapper>;\n\n  EncodeFst(const Fst<Arc> &fst, Mapper *encoder)\n      : ArcMapFst<Arc, Arc, Mapper>(fst, encoder, ArcMapFstOptions()) {\n    encoder->SetInputSymbols(fst.InputSymbols());\n    encoder->SetOutputSymbols(fst.OutputSymbols());\n  }\n\n  EncodeFst(const Fst<Arc> &fst, const Mapper &encoder)\n      : ArcMapFst<Arc, Arc, Mapper>(fst, encoder, ArcMapFstOptions()) {}\n\n  // See Fst<>::Copy() for doc.\n  EncodeFst(const EncodeFst<Arc> &fst, bool copy = false)\n      : ArcMapFst<Arc, Arc, Mapper>(fst, copy) {}\n\n  // Makes a copy of this EncodeFst. See Fst<>::Copy() for further doc.\n  EncodeFst<Arc> *Copy(bool safe = false) const override {\n    if (safe) {\n      FSTERROR() << \"EncodeFst::Copy(true): Not allowed\";\n      GetImpl()->SetProperties(kError, kError);\n    }\n    return new EncodeFst(*this);\n  }\n\n private:\n  using ImplToFst<Impl>::GetImpl;\n  using ImplToFst<Impl>::GetMutableImpl;\n};\n\n// On-the-fly decoding of an input FST.\n//\n// Complexity:\n//\n//   Construction: O(1).\n//   Traversal: O(e + v)\n//\n// Constant time and space to visit an input state or arc is assumed and\n// exclusive of caching.\ntemplate <class Arc>\nclass DecodeFst : public ArcMapFst<Arc, Arc, EncodeMapper<Arc>> {\n public:\n  using Mapper = EncodeMapper<Arc>;\n  using Impl = internal::ArcMapFstImpl<Arc, Arc, Mapper>;\n  using ImplToFst<Impl>::GetImpl;\n\n  DecodeFst(const Fst<Arc> &fst, const Mapper &encoder)\n      : ArcMapFst<Arc, Arc, Mapper>(fst, Mapper(encoder, DECODE),\n                                    ArcMapFstOptions()) {\n    GetMutableImpl()->SetInputSymbols(encoder.InputSymbols());\n    GetMutableImpl()->SetOutputSymbols(encoder.OutputSymbols());\n  }\n\n  // See Fst<>::Copy() for doc.\n  DecodeFst(const DecodeFst<Arc> &fst, bool safe = false)\n      : ArcMapFst<Arc, Arc, Mapper>(fst, safe) {}\n\n  // Makes a copy of this DecodeFst. See Fst<>::Copy() for further doc.\n  DecodeFst<Arc> *Copy(bool safe = false) const override {\n    return new DecodeFst(*this, safe);\n  }\n\n private:\n  using ImplToFst<Impl>::GetMutableImpl;\n};\n\n// Specialization for EncodeFst.\ntemplate <class Arc>\nclass StateIterator<EncodeFst<Arc>>\n    : public StateIterator<ArcMapFst<Arc, Arc, EncodeMapper<Arc>>> {\n public:\n  explicit StateIterator(const EncodeFst<Arc> &fst)\n      : StateIterator<ArcMapFst<Arc, Arc, EncodeMapper<Arc>>>(fst) {}\n};\n\n// Specialization for EncodeFst.\ntemplate <class Arc>\nclass ArcIterator<EncodeFst<Arc>>\n    : public ArcIterator<ArcMapFst<Arc, Arc, EncodeMapper<Arc>>> {\n public:\n  ArcIterator(const EncodeFst<Arc> &fst, typename Arc::StateId s)\n      : ArcIterator<ArcMapFst<Arc, Arc, EncodeMapper<Arc>>>(fst, s) {}\n};\n\n// Specialization for DecodeFst.\ntemplate <class Arc>\nclass StateIterator<DecodeFst<Arc>>\n    : public StateIterator<ArcMapFst<Arc, Arc, EncodeMapper<Arc>>> {\n public:\n  explicit StateIterator(const DecodeFst<Arc> &fst)\n      : StateIterator<ArcMapFst<Arc, Arc, EncodeMapper<Arc>>>(fst) {}\n};\n\n// Specialization for DecodeFst.\ntemplate <class Arc>\nclass ArcIterator<DecodeFst<Arc>>\n    : public ArcIterator<ArcMapFst<Arc, Arc, EncodeMapper<Arc>>> {\n public:\n  ArcIterator(const DecodeFst<Arc> &fst, typename Arc::StateId s)\n      : ArcIterator<ArcMapFst<Arc, Arc, EncodeMapper<Arc>>>(fst, s) {}\n};\n\n// Useful aliases when using StdArc.\n\nusing StdEncodeFst = EncodeFst<StdArc>;\n\nusing StdDecodeFst = DecodeFst<StdArc>;\n\n}  // namespace fst\n\n#endif  // FST_ENCODE_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/epsnormalize.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Function that implements epsilon-normalization.\n\n#ifndef FST_EPSNORMALIZE_H_\n#define FST_EPSNORMALIZE_H_\n\n\n#include <fst/arc-map.h>\n#include <fst/factor-weight.h>\n#include <fst/invert.h>\n#include <fst/rmepsilon.h>\n\n\nnamespace fst {\n\nenum EpsNormalizeType { EPS_NORM_INPUT, EPS_NORM_OUTPUT };\n\n// Returns an equivalent FST that is epsilon-normalized. An acceptor is\n// epsilon-normalized if it is epsilon-removed. A transducer is input\n// epsilon-normalized if additionally if on each path any epsilon input\n// label follows all non-epsilon input labels. Output epsilon-normalized\n// is defined similarly.\n//\n// For more information, see:\n//\n// Mohri, M. 2002. Generic epsilon-removal and input epsilon-normalization\n// algorithms for weighted transducers. International Journal of Computer\n// Science, 13(1): 129-143, 2002.\ntemplate <class Arc>\nvoid EpsNormalize(const Fst<Arc> &ifst, MutableFst<Arc> *ofst,\n                  EpsNormalizeType type = EPS_NORM_INPUT) {\n  EpsNormalize<Arc, GALLIC>(ifst, ofst, type);\n}\n\n// Same as above, except allows specifying explicitly the gallic weight type.\ntemplate <class Arc, GallicType G>\nvoid EpsNormalize(const Fst<Arc> &ifst, MutableFst<Arc> *ofst,\n                  EpsNormalizeType type) {\n  VectorFst<GallicArc<Arc, G>> gfst;\n  std::unique_ptr<SymbolTable> symbols;\n  if (type == EPS_NORM_INPUT) {\n    ArcMap(ifst, &gfst, ToGallicMapper<Arc, G>());\n    if (ifst.OutputSymbols()) symbols.reset(ifst.OutputSymbols()->Copy());\n  } else {  // type == EPS_NORM_OUTPUT\n    ArcMap(InvertFst<Arc>(ifst), &gfst, ToGallicMapper<Arc, G>());\n    if (ifst.InputSymbols()) symbols.reset(ifst.InputSymbols()->Copy());\n  }\n  RmEpsilon(&gfst);\n  FactorWeightFst<GallicArc<Arc, G>,\n                  GallicFactor<typename Arc::Label, typename Arc::Weight, G>>\n      fwfst(gfst);\n  ArcMap(fwfst, ofst, FromGallicMapper<Arc, G>());\n  ofst->SetOutputSymbols(symbols.get());\n  if (type == EPS_NORM_OUTPUT) Invert(ofst);\n}\n\n}  // namespace fst\n\n#endif  // FST_EPSNORMALIZE_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/equal.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Function to test equality of two FSTs.\n\n#ifndef FST_EQUAL_H_\n#define FST_EQUAL_H_\n\n#include <fst/log.h>\n\n#include <fst/fst.h>\n#include <fst/test-properties.h>\n\n\nnamespace fst {\n\nconstexpr uint32_t kEqualFsts = 0x0001;\nconstexpr uint32_t kEqualFstTypes = 0x0002;\nconstexpr uint32_t kEqualCompatProperties = 0x0004;\nconstexpr uint32_t kEqualCompatSymbols = 0x0008;\nconstexpr uint32_t kEqualAll =\n    kEqualFsts | kEqualFstTypes | kEqualCompatProperties | kEqualCompatSymbols;\n\n// Tests if two Fsts have the same states and arcs in the same order (when\n// etype & kEqualFst).\n// Also optional checks equality of Fst types (etype & kEqualFstTypes) and\n// compatibility of stored properties (etype & kEqualCompatProperties) and\n// of symbol tables (etype & kEqualCompatSymbols).\ntemplate <class Arc>\nbool Equal(const Fst<Arc> &fst1, const Fst<Arc> &fst2, float delta = kDelta,\n           uint32_t etype = kEqualFsts) {\n  if ((etype & kEqualFstTypes) && (fst1.Type() != fst2.Type())) {\n    VLOG(1) << \"Equal: Mismatched FST types (\" << fst1.Type() << \" != \"\n            << fst2.Type() << \")\";\n    return false;\n  }\n  if ((etype & kEqualCompatProperties) &&\n      !CompatProperties(fst1.Properties(kCopyProperties, false),\n                        fst2.Properties(kCopyProperties, false))) {\n    VLOG(1) << \"Equal: Properties not compatible\";\n    return false;\n  }\n  if (etype & kEqualCompatSymbols) {\n    if (!CompatSymbols(fst1.InputSymbols(), fst2.InputSymbols(), false)) {\n      VLOG(1) << \"Equal: Input symbols not compatible\";\n      return false;\n    }\n    if (!CompatSymbols(fst1.OutputSymbols(), fst2.OutputSymbols(), false)) {\n      VLOG(1) << \"Equal: Output symbols not compatible\";\n      return false;\n    }\n  }\n  if (!(etype & kEqualFsts)) return true;\n  if (fst1.Start() != fst2.Start()) {\n    VLOG(1) << \"Equal: Mismatched start states (\" << fst1.Start() << \" != \"\n            << fst2.Start() << \")\";\n    return false;\n  }\n  StateIterator<Fst<Arc>> siter1(fst1);\n  StateIterator<Fst<Arc>> siter2(fst2);\n  while (!siter1.Done() || !siter2.Done()) {\n    if (siter1.Done() || siter2.Done()) {\n      VLOG(1) << \"Equal: Mismatched number of states\";\n      return false;\n    }\n    const auto s1 = siter1.Value();\n    const auto s2 = siter2.Value();\n    if (s1 != s2) {\n      VLOG(1) << \"Equal: Mismatched states (\" << s1 << \"!= \"\n              << s2 << \")\";\n      return false;\n    }\n    const auto &final1 = fst1.Final(s1);\n    const auto &final2 = fst2.Final(s2);\n    if (!ApproxEqual(final1, final2, delta)) {\n      VLOG(1) << \"Equal: Mismatched final weights at state \" << s1\n              << \" (\" << final1 << \" != \" << final2 << \")\";\n      return false;\n    }\n    ArcIterator<Fst<Arc>> aiter1(fst1, s1);\n    ArcIterator<Fst<Arc>> aiter2(fst2, s2);\n    for (auto a = 0; !aiter1.Done() || !aiter2.Done(); ++a) {\n      if (aiter1.Done() || aiter2.Done()) {\n        VLOG(1) << \"Equal: Mismatched number of arcs at state \" << s1;\n        return false;\n      }\n      const auto &arc1 = aiter1.Value();\n      const auto &arc2 = aiter2.Value();\n      if (arc1.ilabel != arc2.ilabel) {\n        VLOG(1) << \"Equal: Mismatched arc input labels at state \" << s1\n                << \", arc \" << a << \" (\" << arc1.ilabel << \" != \"\n                << arc2.ilabel << \")\";\n        return false;\n      } else if (arc1.olabel != arc2.olabel) {\n        VLOG(1) << \"Equal: Mismatched arc output labels at state \" << s1\n                << \", arc \" << a << \" (\" << arc1.olabel << \" != \"\n                << arc2.olabel << \")\";\n        return false;\n      } else if (!ApproxEqual(arc1.weight, arc2.weight, delta)) {\n        VLOG(1) << \"Equal: Mismatched arc weights at state \" << s1\n                << \", arc \" << a << \" (\" << arc1.weight << \" != \"\n                << arc2.weight << \")\";\n        return false;\n      } else if (arc1.nextstate != arc2.nextstate) {\n        VLOG(1) << \"Equal: Mismatched next state at state \" << s1\n                << \", arc \" << a << \" (\" << arc1.nextstate << \" != \"\n                << arc2.nextstate << \")\";\n        return false;\n      }\n      aiter1.Next();\n      aiter2.Next();\n    }\n    // Sanity checks: should never fail.\n    if (fst1.NumArcs(s1) != fst2.NumArcs(s2)) {\n      FSTERROR() << \"Equal: Inconsistent arc counts at state \" << s1\n                 << \" (\" << fst1.NumArcs(s1) << \" != \"\n                 << fst2.NumArcs(s2) << \")\";\n      return false;\n    }\n    if (fst1.NumInputEpsilons(s1) != fst2.NumInputEpsilons(s2)) {\n      FSTERROR() << \"Equal: Inconsistent input epsilon counts at state \" << s1\n                 << \" (\" << fst1.NumInputEpsilons(s1) << \" != \"\n                 << fst2.NumInputEpsilons(s2) << \")\";\n      return false;\n    }\n    if (fst1.NumOutputEpsilons(s1) != fst2.NumOutputEpsilons(s2)) {\n      FSTERROR() << \"Equal: Inconsistent output epsilon counts at state \" << s1\n                 << \" (\" << fst1.NumOutputEpsilons(s1) << \" != \"\n                 << fst2.NumOutputEpsilons(s2) << \")\";\n    }\n    siter1.Next();\n    siter2.Next();\n  }\n  return true;\n}\n\n}  // namespace fst\n\n#endif  // FST_EQUAL_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/equivalent.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Functions and classes to determine the equivalence of two FSTs.\n\n#ifndef FST_EQUIVALENT_H_\n#define FST_EQUIVALENT_H_\n\n#include <algorithm>\n#include <deque>\n#include <unordered_map>\n#include <utility>\n#include <vector>\n#include <fst/log.h>\n\n#include <fst/encode.h>\n#include <fst/push.h>\n#include <fst/union-find.h>\n#include <fst/vector-fst.h>\n\n\nnamespace fst {\nnamespace internal {\n\n// Traits-like struct holding utility functions/typedefs/constants for\n// the equivalence algorithm.\n//\n// Encoding device: in order to make the statesets of the two acceptors\n// disjoint, we map Arc::StateId on the type MappedId. The states of\n// the first acceptor are mapped on odd numbers (s -> 2s + 1), and\n// those of the second one on even numbers (s -> 2s + 2). The number 0\n// is reserved for an implicit (non-final) dead state (required for\n// the correct treatment of non-coaccessible states; kNoStateId is mapped to\n// kDeadState for both acceptors). The union-find algorithm operates on the\n// mapped IDs.\ntemplate <class Arc>\nstruct EquivalenceUtil {\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using MappedId = StateId;  // ID for an equivalence class.\n\n  // MappedId for an implicit dead state.\n  static constexpr MappedId kDeadState = 0;\n\n  // MappedId for lookup failure.\n  static constexpr MappedId kInvalidId = -1;\n\n  // Maps state ID to the representative of the corresponding\n  // equivalence class. The parameter 'which_fst' takes the values 1\n  // and 2, identifying the input FST.\n  static MappedId MapState(StateId s, int32_t which_fst) {\n    return (kNoStateId == s) ? kDeadState\n                             : (static_cast<MappedId>(s) << 1) + which_fst;\n  }\n\n  // Maps set ID to State ID.\n  static StateId UnMapState(MappedId id) {\n    return static_cast<StateId>((--id) >> 1);\n  }\n\n  // Convenience function: checks if state with MappedId s is final in\n  // acceptor fa.\n  static bool IsFinal(const Fst<Arc> &fa, MappedId s) {\n    return (kDeadState == s) ? false\n                             : (fa.Final(UnMapState(s)) != Weight::Zero());\n  }\n  // Convenience function: returns the representative of ID in sets,\n  // creating a new set if needed.\n  static MappedId FindSet(UnionFind<MappedId> *sets, MappedId id) {\n    const auto repr = sets->FindSet(id);\n    if (repr != kInvalidId) {\n      return repr;\n    } else {\n      sets->MakeSet(id);\n      return id;\n    }\n  }\n};\n\ntemplate <class Arc>\nconstexpr\n    typename EquivalenceUtil<Arc>::MappedId EquivalenceUtil<Arc>::kDeadState;\n\ntemplate <class Arc>\nconstexpr\n    typename EquivalenceUtil<Arc>::MappedId EquivalenceUtil<Arc>::kInvalidId;\n\n}  // namespace internal\n\n// Equivalence checking algorithm: determines if the two FSTs fst1 and fst2\n// are equivalent. The input FSTs must be deterministic input-side epsilon-free\n// acceptors, unweighted or with weights over a left semiring. Two acceptors are\n// considered equivalent if they accept exactly the same set of strings (with\n// the same weights).\n//\n// The algorithm (cf. Aho, Hopcroft and Ullman, \"The Design and Analysis of\n// Computer Programs\") successively constructs sets of states that can be\n// reached by the same prefixes, starting with a set containing the start states\n// of both acceptors. A disjoint tree forest (the union-find algorithm) is used\n// to represent the sets of states. The algorithm returns false if one of the\n// constructed sets contains both final and non-final states. Returns an\n// optional error value (useful when FLAGS_error_fatal = false).\n//\n// Complexity:\n//\n// Quasi-linear, i.e., O(n G(n)), where\n//\n//   n = |S1| + |S2| is the number of states in both acceptors\n//\n//   G(n) is a very slowly growing function that can be approximated\n//        by 4 by all practical purposes.\ntemplate <class Arc>\nbool Equivalent(const Fst<Arc> &fst1, const Fst<Arc> &fst2,\n                float delta = kDelta, bool *error = nullptr) {\n  using Weight = typename Arc::Weight;\n  if (error) *error = false;\n  // Check that the symbol table are compatible.\n  if (!CompatSymbols(fst1.InputSymbols(), fst2.InputSymbols()) ||\n      !CompatSymbols(fst1.OutputSymbols(), fst2.OutputSymbols())) {\n    FSTERROR() << \"Equivalent: Input/output symbol tables of 1st argument \"\n               << \"do not match input/output symbol tables of 2nd argument\";\n    if (error) *error = true;\n    return false;\n  }\n  // Check properties first.\n  static constexpr auto props = kNoEpsilons | kIDeterministic | kAcceptor;\n  if (fst1.Properties(props, true) != props) {\n    FSTERROR() << \"Equivalent: 1st argument not an\"\n               << \" epsilon-free deterministic acceptor\";\n    if (error) *error = true;\n    return false;\n  }\n  if (fst2.Properties(props, true) != props) {\n    FSTERROR() << \"Equivalent: 2nd argument not an\"\n               << \" epsilon-free deterministic acceptor\";\n    if (error) *error = true;\n    return false;\n  }\n  if ((fst1.Properties(kUnweighted, true) != kUnweighted) ||\n      (fst2.Properties(kUnweighted, true) != kUnweighted)) {\n    VectorFst<Arc> efst1(fst1);\n    VectorFst<Arc> efst2(fst2);\n    Push(&efst1, REWEIGHT_TO_INITIAL, delta);\n    Push(&efst2, REWEIGHT_TO_INITIAL, delta);\n    ArcMap(&efst1, QuantizeMapper<Arc>(delta));\n    ArcMap(&efst2, QuantizeMapper<Arc>(delta));\n    EncodeMapper<Arc> mapper(kEncodeWeights | kEncodeLabels, ENCODE);\n    ArcMap(&efst1, &mapper);\n    ArcMap(&efst2, &mapper);\n    return Equivalent(efst1, efst2);\n  }\n  using Util = internal::EquivalenceUtil<Arc>;\n  using MappedId = typename Util::MappedId;\n  enum { FST1 = 1, FST2 = 2 };  // Required by Util::MapState(...)\n  auto s1 = Util::MapState(fst1.Start(), FST1);\n  auto s2 = Util::MapState(fst2.Start(), FST2);\n  // The union-find structure.\n  UnionFind<MappedId> eq_classes(1000, Util::kInvalidId);\n  // Initializes the union-find structure.\n  eq_classes.MakeSet(s1);\n  eq_classes.MakeSet(s2);\n  // Data structure for the (partial) acceptor transition function of fst1 and\n  // fst2: input labels mapped to pairs of MappedIds representing destination\n  // states of the corresponding arcs in fst1 and fst2, respectively.\n  using Label2StatePairMap =\n      std::unordered_map<typename Arc::Label, std::pair<MappedId, MappedId>>;\n  Label2StatePairMap arc_pairs;\n  // Pairs of MappedId's to be processed, organized in a queue.\n  std::deque<std::pair<MappedId, MappedId>> q;\n  bool ret = true;\n  // Returns early if the start states differ w.r.t. finality.\n  if (Util::IsFinal(fst1, s1) != Util::IsFinal(fst2, s2)) ret = false;\n  // Main loop: explores the two acceptors in a breadth-first manner, updating\n  // the equivalence relation on the statesets. Loop invariant: each block of\n  // the states contains either final states only or non-final states only.\n  for (q.push_back(std::make_pair(s1, s2)); ret && !q.empty(); q.pop_front()) {\n    s1 = q.front().first;\n    s2 = q.front().second;\n    // Representatives of the equivalence classes of s1/s2.\n    const auto rep1 = Util::FindSet(&eq_classes, s1);\n    const auto rep2 = Util::FindSet(&eq_classes, s2);\n    if (rep1 != rep2) {\n      eq_classes.Union(rep1, rep2);\n      arc_pairs.clear();\n      // Copies outgoing arcs starting at s1 into the hash-table.\n      if (Util::kDeadState != s1) {\n        ArcIterator<Fst<Arc>> arc_iter(fst1, Util::UnMapState(s1));\n        for (; !arc_iter.Done(); arc_iter.Next()) {\n          const auto &arc = arc_iter.Value();\n          // Zero-weight arcs are treated as if they did not exist.\n          if (arc.weight != Weight::Zero()) {\n            arc_pairs[arc.ilabel].first = Util::MapState(arc.nextstate, FST1);\n          }\n        }\n      }\n      // Copies outgoing arcs starting at s2 into the hashtable.\n      if (Util::kDeadState != s2) {\n        ArcIterator<Fst<Arc>> arc_iter(fst2, Util::UnMapState(s2));\n        for (; !arc_iter.Done(); arc_iter.Next()) {\n          const auto &arc = arc_iter.Value();\n          // Zero-weight arcs are treated as if they did not exist.\n          if (arc.weight != Weight::Zero()) {\n            arc_pairs[arc.ilabel].second = Util::MapState(arc.nextstate, FST2);\n          }\n        }\n      }\n      // Iterates through the hashtable and process pairs of target states.\n      for (const auto &arc_iter : arc_pairs) {\n        const auto &pair = arc_iter.second;\n        if (Util::IsFinal(fst1, pair.first) !=\n            Util::IsFinal(fst2, pair.second)) {\n          // Detected inconsistency: return false.\n          ret = false;\n          break;\n        }\n        q.push_back(pair);\n      }\n    }\n  }\n  if (fst1.Properties(kError, false) || fst2.Properties(kError, false)) {\n    if (error) *error = true;\n    return false;\n  }\n  return ret;\n}\n\n}  // namespace fst\n\n#endif  // FST_EQUIVALENT_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/expand.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Expands a PDT to an FST.\n\n#ifndef FST_EXTENSIONS_PDT_EXPAND_H_\n#define FST_EXTENSIONS_PDT_EXPAND_H_\n\n#include <forward_list>\n#include <vector>\n\n#include <fst/log.h>\n\n#include <fst/extensions/pdt/paren.h>\n#include <fst/extensions/pdt/pdt.h>\n#include <fst/extensions/pdt/reverse.h>\n#include <fst/extensions/pdt/shortest-path.h>\n#include <fst/cache.h>\n#include <fst/mutable-fst.h>\n#include <fst/queue.h>\n#include <fst/state-table.h>\n#include <fst/test-properties.h>\n\nnamespace fst {\n\ntemplate <class Arc>\nstruct PdtExpandFstOptions : public CacheOptions {\n  bool keep_parentheses;\n  PdtStack<typename Arc::StateId, typename Arc::Label> *stack;\n  PdtStateTable<typename Arc::StateId, typename Arc::StateId> *state_table;\n\n  explicit PdtExpandFstOptions(\n      const CacheOptions &opts = CacheOptions(), bool keep_parentheses = false,\n      PdtStack<typename Arc::StateId, typename Arc::Label> *stack = nullptr,\n      PdtStateTable<typename Arc::StateId, typename Arc::StateId> *state_table =\n          nullptr)\n      : CacheOptions(opts),\n        keep_parentheses(keep_parentheses),\n        stack(stack),\n        state_table(state_table) {}\n};\n\nnamespace internal {\n\n// Implementation class for PdtExpandFst.\ntemplate <class Arc>\nclass PdtExpandFstImpl : public CacheImpl<Arc> {\n public:\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using StackId = StateId;\n  using StateTuple = PdtStateTuple<StateId, StackId>;\n\n  using FstImpl<Arc>::SetType;\n  using FstImpl<Arc>::SetProperties;\n  using FstImpl<Arc>::Properties;\n  using FstImpl<Arc>::SetInputSymbols;\n  using FstImpl<Arc>::SetOutputSymbols;\n\n  using CacheBaseImpl<CacheState<Arc>>::PushArc;\n  using CacheBaseImpl<CacheState<Arc>>::HasArcs;\n  using CacheBaseImpl<CacheState<Arc>>::HasFinal;\n  using CacheBaseImpl<CacheState<Arc>>::HasStart;\n  using CacheBaseImpl<CacheState<Arc>>::SetArcs;\n  using CacheBaseImpl<CacheState<Arc>>::SetFinal;\n  using CacheBaseImpl<CacheState<Arc>>::SetStart;\n\n  PdtExpandFstImpl(const Fst<Arc> &fst,\n                   const std::vector<std::pair<Label, Label>> &parens,\n                   const PdtExpandFstOptions<Arc> &opts)\n      : CacheImpl<Arc>(opts),\n        fst_(fst.Copy()),\n        stack_(opts.stack ? opts.stack : new PdtStack<StateId, Label>(parens)),\n        state_table_(opts.state_table ? opts.state_table\n                                      : new PdtStateTable<StateId, StackId>()),\n        own_stack_(opts.stack == 0),\n        own_state_table_(opts.state_table == 0),\n        keep_parentheses_(opts.keep_parentheses) {\n    SetType(\"expand\");\n    const auto props = fst.Properties(kFstProperties, false);\n    SetProperties(PdtExpandProperties(props), kCopyProperties);\n    SetInputSymbols(fst.InputSymbols());\n    SetOutputSymbols(fst.OutputSymbols());\n  }\n\n  PdtExpandFstImpl(const PdtExpandFstImpl &impl)\n      : CacheImpl<Arc>(impl),\n        fst_(impl.fst_->Copy(true)),\n        stack_(new PdtStack<StateId, Label>(*impl.stack_)),\n        state_table_(new PdtStateTable<StateId, StackId>()),\n        own_stack_(true),\n        own_state_table_(true),\n        keep_parentheses_(impl.keep_parentheses_) {\n    SetType(\"expand\");\n    SetProperties(impl.Properties(), kCopyProperties);\n    SetInputSymbols(impl.InputSymbols());\n    SetOutputSymbols(impl.OutputSymbols());\n  }\n\n  ~PdtExpandFstImpl() override {\n    if (own_stack_) delete stack_;\n    if (own_state_table_) delete state_table_;\n  }\n\n  StateId Start() {\n    if (!HasStart()) {\n      const auto s = fst_->Start();\n      if (s == kNoStateId) return kNoStateId;\n      StateTuple tuple(s, 0);\n      const auto start = state_table_->FindState(tuple);\n      SetStart(start);\n    }\n    return CacheImpl<Arc>::Start();\n  }\n\n  Weight Final(StateId s) {\n    if (!HasFinal(s)) {\n      const auto &tuple = state_table_->Tuple(s);\n      const auto weight = fst_->Final(tuple.state_id);\n      if (weight != Weight::Zero() && tuple.stack_id == 0)\n        SetFinal(s, weight);\n      else\n        SetFinal(s, Weight::Zero());\n    }\n    return CacheImpl<Arc>::Final(s);\n  }\n\n  size_t NumArcs(StateId s) {\n    if (!HasArcs(s)) ExpandState(s);\n    return CacheImpl<Arc>::NumArcs(s);\n  }\n\n  size_t NumInputEpsilons(StateId s) {\n    if (!HasArcs(s)) ExpandState(s);\n    return CacheImpl<Arc>::NumInputEpsilons(s);\n  }\n\n  size_t NumOutputEpsilons(StateId s) {\n    if (!HasArcs(s)) ExpandState(s);\n    return CacheImpl<Arc>::NumOutputEpsilons(s);\n  }\n\n  void InitArcIterator(StateId s, ArcIteratorData<Arc> *data) {\n    if (!HasArcs(s)) ExpandState(s);\n    CacheImpl<Arc>::InitArcIterator(s, data);\n  }\n\n  // Computes the outgoing transitions from a state, creating new destination\n  // states as needed.\n  void ExpandState(StateId s) {\n    StateTuple tuple = state_table_->Tuple(s);\n    for (ArcIterator<Fst<Arc>> aiter(*fst_, tuple.state_id); !aiter.Done();\n         aiter.Next()) {\n      auto arc = aiter.Value();\n      const auto stack_id = stack_->Find(tuple.stack_id, arc.ilabel);\n      if (stack_id == -1) {  // Non-matching close parenthesis.\n        continue;\n      } else if ((stack_id != tuple.stack_id) && !keep_parentheses_) {\n        // Stack push/pop.\n        arc.ilabel = 0;\n        arc.olabel = 0;\n      }\n      StateTuple ntuple(arc.nextstate, stack_id);\n      arc.nextstate = state_table_->FindState(ntuple);\n      PushArc(s, arc);\n    }\n    SetArcs(s);\n  }\n\n  const PdtStack<StackId, Label> &GetStack() const { return *stack_; }\n\n  const PdtStateTable<StateId, StackId> &GetStateTable() const {\n    return *state_table_;\n  }\n\n private:\n  // Properties for an expanded PDT.\n  inline uint64 PdtExpandProperties(uint64 inprops) {\n    return inprops & (kAcceptor | kAcyclic | kInitialAcyclic | kUnweighted);\n  }\n\n  std::unique_ptr<const Fst<Arc>> fst_;\n  PdtStack<StackId, Label> *stack_;\n  PdtStateTable<StateId, StackId> *state_table_;\n  bool own_stack_;\n  bool own_state_table_;\n  bool keep_parentheses_;\n};\n\n}  // namespace internal\n\n// Expands a pushdown transducer (PDT) encoded as an FST into an FST. This\n// version is a delayed FST. In the PDT, some transitions are labeled with open\n// or close parentheses. To be interpreted as a PDT, the parens must balance on\n// a path. The open-close parenthesis label pairs are passed using the parens\n// argument. The expansion enforces the parenthesis constraints. The PDT must be\n// expandable as an FST.\n//\n// This class attaches interface to implementation and handles reference\n// counting, delegating most methods to ImplToFst.\ntemplate <class A>\nclass PdtExpandFst : public ImplToFst<internal::PdtExpandFstImpl<A>> {\n public:\n  using Arc = A;\n\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using StackId = StateId;\n  using Store = DefaultCacheStore<Arc>;\n  using State = typename Store::State;\n  using Impl = internal::PdtExpandFstImpl<Arc>;\n\n  friend class ArcIterator<PdtExpandFst<Arc>>;\n  friend class StateIterator<PdtExpandFst<Arc>>;\n\n  PdtExpandFst(const Fst<Arc> &fst,\n               const std::vector<std::pair<Label, Label>> &parens)\n      : ImplToFst<Impl>(\n            std::make_shared<Impl>(fst, parens, PdtExpandFstOptions<A>())) {}\n\n  PdtExpandFst(const Fst<Arc> &fst,\n               const std::vector<std::pair<Label, Label>> &parens,\n               const PdtExpandFstOptions<Arc> &opts)\n      : ImplToFst<Impl>(std::make_shared<Impl>(fst, parens, opts)) {}\n\n  // See Fst<>::Copy() for doc.\n  PdtExpandFst(const PdtExpandFst<Arc> &fst, bool safe = false)\n      : ImplToFst<Impl>(fst, safe) {}\n\n  // Gets a copy of this ExpandFst. See Fst<>::Copy() for further doc.\n  PdtExpandFst<Arc> *Copy(bool safe = false) const override {\n    return new PdtExpandFst<Arc>(*this, safe);\n  }\n\n  inline void InitStateIterator(StateIteratorData<Arc> *data) const override;\n\n  void InitArcIterator(StateId s, ArcIteratorData<Arc> *data) const override {\n    GetMutableImpl()->InitArcIterator(s, data);\n  }\n\n  const PdtStack<StackId, Label> &GetStack() const {\n    return GetImpl()->GetStack();\n  }\n\n  const PdtStateTable<StateId, StackId> &GetStateTable() const {\n    return GetImpl()->GetStateTable();\n  }\n\n private:\n  using ImplToFst<Impl>::GetImpl;\n  using ImplToFst<Impl>::GetMutableImpl;\n\n  void operator=(const PdtExpandFst &) = delete;\n};\n\n// Specialization for PdtExpandFst.\ntemplate <class Arc>\nclass StateIterator<PdtExpandFst<Arc>>\n    : public CacheStateIterator<PdtExpandFst<Arc>> {\n public:\n  explicit StateIterator(const PdtExpandFst<Arc> &fst)\n      : CacheStateIterator<PdtExpandFst<Arc>>(fst, fst.GetMutableImpl()) {}\n};\n\n// Specialization for PdtExpandFst.\ntemplate <class Arc>\nclass ArcIterator<PdtExpandFst<Arc>>\n    : public CacheArcIterator<PdtExpandFst<Arc>> {\n public:\n  using StateId = typename Arc::StateId;\n\n  ArcIterator(const PdtExpandFst<Arc> &fst, StateId s)\n      : CacheArcIterator<PdtExpandFst<Arc>>(fst.GetMutableImpl(), s) {\n    if (!fst.GetImpl()->HasArcs(s)) fst.GetMutableImpl()->ExpandState(s);\n  }\n};\n\ntemplate <class Arc>\ninline void PdtExpandFst<Arc>::InitStateIterator(\n    StateIteratorData<Arc> *data) const {\n  data->base = new StateIterator<PdtExpandFst<Arc>>(*this);\n}\n\n// PrunedExpand prunes the delayed expansion of a pushdown transducer (PDT)\n// encoded as an FST into an FST. In the PDT, some transitions are labeled with\n// open or close parentheses. To be interpreted as a PDT, the parens must\n// balance on a path. The open-close parenthesis label pairs are passed\n// using the parens argument. The expansion enforces the parenthesis\n// constraints.\n//\n// The algorithm works by visiting the delayed ExpandFst using a shortest-stack\n// first queue discipline and relies on the shortest-distance information\n// computed using a reverse shortest-path call to perform the pruning.\n//\n// The algorithm maintains the same state ordering between the ExpandFst being\n// visited (efst_) and the result of pruning written into the MutableFst (ofst_)\n// to improve readability.\ntemplate <class Arc>\nclass PdtPrunedExpand {\n public:\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using StackId = StateId;\n  using Stack = PdtStack<StackId, Label>;\n  using StateTable = PdtStateTable<StateId, StackId>;\n  using SetIterator = typename internal::PdtBalanceData<Arc>::SetIterator;\n\n  // Constructor taking as input a PDT specified by by an input FST and a vector\n  // of parentheses. The keep_parentheses argument specifies whether parentheses\n  // are replaced by epsilons or not during the expansion. The cache options are\n  // passed to the underlying ExpandFst.\n  PdtPrunedExpand(const Fst<Arc> &ifst,\n                  const std::vector<std::pair<Label, Label>> &parens,\n                  bool keep_parentheses = false,\n                  const CacheOptions &opts = CacheOptions())\n      : ifst_(ifst.Copy()),\n        keep_parentheses_(keep_parentheses),\n        stack_(parens),\n        efst_(ifst, parens,\n              PdtExpandFstOptions<Arc>(opts, true, &stack_, &state_table_)),\n        queue_(state_table_, stack_, stack_length_, distance_, fdistance_),\n        error_(false) {\n    Reverse(*ifst_, parens, &rfst_);\n    VectorFst<Arc> path;\n    reverse_shortest_path_.reset(new PdtShortestPath<Arc, FifoQueue<StateId>>(\n        rfst_, parens,\n        PdtShortestPathOptions<Arc, FifoQueue<StateId>>(true, false)));\n    reverse_shortest_path_->ShortestPath(&path);\n    error_ = (path.Properties(kError, true) == kError);\n    balance_data_.reset(reverse_shortest_path_->GetBalanceData()->Reverse(\n        rfst_.NumStates(), 10, -1));\n    InitCloseParenMultimap(parens);\n  }\n\n  bool Error() const { return error_; }\n\n  // Expands and prunes the input PDT according to the provided weight\n  // threshold, wirting the result into an output mutable FST.\n  void Expand(MutableFst<Arc> *ofst, const Weight &threshold);\n\n private:\n  static constexpr uint8 kEnqueued = 0x01;\n  static constexpr uint8 kExpanded = 0x02;\n  static constexpr uint8 kSourceState = 0x04;\n\n  // Comparison functor used by the queue:\n  //\n  // 1. States corresponding to shortest stack first, and\n  // 2. for stacks of matching length, reverse lexicographic order is used, and\n  // 3. for states with the same stack, shortest-first order is used.\n  class StackCompare {\n   public:\n    StackCompare(const StateTable &state_table, const Stack &stack,\n                 const std::vector<StackId> &stack_length,\n                 const std::vector<Weight> &distance,\n                 const std::vector<Weight> &fdistance)\n        : state_table_(state_table),\n          stack_(stack),\n          stack_length_(stack_length),\n          distance_(distance),\n          fdistance_(fdistance) {}\n\n    bool operator()(StateId s1, StateId s2) const {\n      auto si1 = state_table_.Tuple(s1).stack_id;\n      auto si2 = state_table_.Tuple(s2).stack_id;\n      if (stack_length_[si1] < stack_length_[si2]) return true;\n      if (stack_length_[si1] > stack_length_[si2]) return false;\n      // If stack IDs are equal, use A*.\n      if (si1 == si2) {\n        return less_(Distance(s1), Distance(s2));\n      }\n      // If lengths are equal, uses reverse lexicographic order.\n      for (; si1 != si2; si1 = stack_.Pop(si1), si2 = stack_.Pop(si2)) {\n        if (stack_.Top(si1) < stack_.Top(si2)) return true;\n        if (stack_.Top(si1) > stack_.Top(si2)) return false;\n      }\n      return false;\n    }\n\n   private:\n    Weight Distance(StateId s) const {\n      return (s < distance_.size()) && (s < fdistance_.size())\n                 ? Times(distance_[s], fdistance_[s])\n                 : Weight::Zero();\n    }\n\n    const StateTable &state_table_;\n    const Stack &stack_;\n    const std::vector<StackId> &stack_length_;\n    const std::vector<Weight> &distance_;\n    const std::vector<Weight> &fdistance_;\n    const NaturalLess<Weight> less_;\n  };\n\n  class ShortestStackFirstQueue\n      : public ShortestFirstQueue<StateId, StackCompare> {\n   public:\n    ShortestStackFirstQueue(const PdtStateTable<StateId, StackId> &state_table,\n                            const Stack &stack,\n                            const std::vector<StackId> &stack_length,\n                            const std::vector<Weight> &distance,\n                            const std::vector<Weight> &fdistance)\n        : ShortestFirstQueue<StateId, StackCompare>(StackCompare(\n              state_table, stack, stack_length, distance, fdistance)) {}\n  };\n\n  void InitCloseParenMultimap(\n      const std::vector<std::pair<Label, Label>> &parens);\n\n  Weight DistanceToDest(StateId source, StateId dest) const;\n\n  uint8 Flags(StateId s) const;\n\n  void SetFlags(StateId s, uint8 flags, uint8 mask);\n\n  Weight Distance(StateId s) const;\n\n  void SetDistance(StateId s, Weight weight);\n\n  Weight FinalDistance(StateId s) const;\n\n  void SetFinalDistance(StateId s, Weight weight);\n\n  StateId SourceState(StateId s) const;\n\n  void SetSourceState(StateId s, StateId p);\n\n  void AddStateAndEnqueue(StateId s);\n\n  void Relax(StateId s, const Arc &arc, Weight weight);\n\n  bool PruneArc(StateId s, const Arc &arc);\n\n  void ProcStart();\n\n  void ProcFinal(StateId s);\n\n  bool ProcNonParen(StateId s, const Arc &arc, bool add_arc);\n\n  bool ProcOpenParen(StateId s, const Arc &arc, StackId si, StackId nsi);\n\n  bool ProcCloseParen(StateId s, const Arc &arc);\n\n  void ProcDestStates(StateId s, StackId si);\n\n  // Input PDT.\n  std::unique_ptr<Fst<Arc>> ifst_;\n  // Reversed PDT.\n  VectorFst<Arc> rfst_;\n  // Keep parentheses in ofst?\n  const bool keep_parentheses_;\n  // State table for efst_.\n  StateTable state_table_;\n  // Stack trie.\n  Stack stack_;\n  // Expanded PDT.\n  PdtExpandFst<Arc> efst_;\n  // Length of stack for given stack ID.\n  std::vector<StackId> stack_length_;\n  // Distance from initial state in efst_/ofst.\n  std::vector<Weight> distance_;\n  // Distance to final states in efst_/ofst.\n  std::vector<Weight> fdistance_;\n  // Queue used to visit efst_.\n  ShortestStackFirstQueue queue_;\n  // Construction time failure?\n  bool error_;\n  // Status flags for states in efst_/ofst.\n  std::vector<uint8> flags_;\n  // PDT source state for each expanded state.\n  std::vector<StateId> sources_;\n  // Shortest path for rfst_.\n  std::unique_ptr<PdtShortestPath<Arc, FifoQueue<StateId>>>\n      reverse_shortest_path_;\n  std::unique_ptr<internal::PdtBalanceData<Arc>> balance_data_;\n  // Maps open paren arcs to balancing close paren arcs.\n  typename PdtShortestPath<Arc, FifoQueue<StateId>>::CloseParenMultimap\n      close_paren_multimap_;\n  MutableFst<Arc> *ofst_;  // Output FST.\n  Weight limit_;           // Weight limit.\n\n  // Maps a state s in ifst (i.e., the source of a closed paranthesis matching\n  // the top of current_stack_id_ to final states in efst_.\n  std::unordered_map<StateId, Weight> dest_map_;\n  // Stack ID of the states currently at the top of the queue, i.e., the states\n  // currently being popped and processed.\n  StackId current_stack_id_;\n  std::ptrdiff_t current_paren_id_;  // Paren ID at top of current stack.\n  std::ptrdiff_t cached_stack_id_;\n  StateId cached_source_;\n  // The set of pairs of destination states and weights to final states for the\n  // source state cached_source_ and the paren ID cached_paren_id_; i.e., the\n  // set of source states of a closed parenthesis with paren ID cached_paren_id\n  // balancing an incoming open parenthesis with paren ID cached_paren_id_ in\n  // state cached_source_.\n  std::forward_list<std::pair<StateId, Weight>> cached_dest_list_;\n  NaturalLess<Weight> less_;\n};\n\n// Initializes close paren multimap, mapping pairs (s, paren_id) to all the arcs\n// out of s labeled with close parenthese for paren_id.\ntemplate <class Arc>\nvoid PdtPrunedExpand<Arc>::InitCloseParenMultimap(\n    const std::vector<std::pair<Label, Label>> &parens) {\n  std::unordered_map<Label, Label> paren_map;\n  for (size_t i = 0; i < parens.size(); ++i) {\n    const auto &pair = parens[i];\n    paren_map[pair.first] = i;\n    paren_map[pair.second] = i;\n  }\n  for (StateIterator<Fst<Arc>> siter(*ifst_); !siter.Done(); siter.Next()) {\n    const auto s = siter.Value();\n    for (ArcIterator<Fst<Arc>> aiter(*ifst_, s); !aiter.Done(); aiter.Next()) {\n      const auto &arc = aiter.Value();\n      const auto it = paren_map.find(arc.ilabel);\n      if (it == paren_map.end()) continue;\n      if (arc.ilabel == parens[it->second].second) {  // Close paren.\n        const internal::ParenState<Arc> key(it->second, s);\n        close_paren_multimap_.emplace(key, arc);\n      }\n    }\n  }\n}\n\n// Returns the weight of the shortest balanced path from source to dest\n// in ifst_; dest must be the source state of a close paren arc.\ntemplate <class Arc>\ntypename Arc::Weight PdtPrunedExpand<Arc>::DistanceToDest(StateId source,\n                                                          StateId dest) const {\n  using SearchState =\n      typename PdtShortestPath<Arc, FifoQueue<StateId>>::SearchState;\n  const SearchState ss(source + 1, dest + 1);\n  const auto distance =\n      reverse_shortest_path_->GetShortestPathData().Distance(ss);\n  VLOG(2) << \"D(\" << source << \", \" << dest << \") =\" << distance;\n  return distance;\n}\n\n// Returns the flags for state s in ofst_.\ntemplate <class Arc>\nuint8 PdtPrunedExpand<Arc>::Flags(StateId s) const {\n  return s < flags_.size() ? flags_[s] : 0;\n}\n\n// Modifies the flags for state s in ofst_.\ntemplate <class Arc>\nvoid PdtPrunedExpand<Arc>::SetFlags(StateId s, uint8 flags, uint8 mask) {\n  while (flags_.size() <= s) flags_.push_back(0);\n  flags_[s] &= ~mask;\n  flags_[s] |= flags & mask;\n}\n\n// Returns the shortest distance from the initial state to s in ofst_.\ntemplate <class Arc>\ntypename Arc::Weight PdtPrunedExpand<Arc>::Distance(StateId s) const {\n  return s < distance_.size() ? distance_[s] : Weight::Zero();\n}\n\n// Sets the shortest distance from the initial state to s in ofst_.\ntemplate <class Arc>\nvoid PdtPrunedExpand<Arc>::SetDistance(StateId s, Weight weight) {\n  while (distance_.size() <= s) distance_.push_back(Weight::Zero());\n  distance_[s] = std::move(weight);\n}\n\n// Returns the shortest distance from s to the final states in ofst_.\ntemplate <class Arc>\ntypename Arc::Weight PdtPrunedExpand<Arc>::FinalDistance(StateId s) const {\n  return s < fdistance_.size() ? fdistance_[s] : Weight::Zero();\n}\n\n// Sets the shortest distance from s to the final states in ofst_.\ntemplate <class Arc>\nvoid PdtPrunedExpand<Arc>::SetFinalDistance(StateId s, Weight weight) {\n  while (fdistance_.size() <= s) fdistance_.push_back(Weight::Zero());\n  fdistance_[s] = std::move(weight);\n}\n\n// Returns the PDT source state of state s in ofst_.\ntemplate <class Arc>\ntypename Arc::StateId PdtPrunedExpand<Arc>::SourceState(StateId s) const {\n  return s < sources_.size() ? sources_[s] : kNoStateId;\n}\n\n// Sets the PDT source state of state s in ofst_ to state p'in ifst_.\ntemplate <class Arc>\nvoid PdtPrunedExpand<Arc>::SetSourceState(StateId s, StateId p) {\n  while (sources_.size() <= s) sources_.push_back(kNoStateId);\n  sources_[s] = p;\n}\n\n// Adds state s of efst_ to ofst_ and inserts it in the queue, modifying the\n// flags for s accordingly.\ntemplate <class Arc>\nvoid PdtPrunedExpand<Arc>::AddStateAndEnqueue(StateId s) {\n  if (!(Flags(s) & (kEnqueued | kExpanded))) {\n    while (ofst_->NumStates() <= s) ofst_->AddState();\n    queue_.Enqueue(s);\n    SetFlags(s, kEnqueued, kEnqueued);\n  } else if (Flags(s) & kEnqueued) {\n    queue_.Update(s);\n  }\n  // TODO(allauzen): Check everything is fine when kExpanded?\n}\n\n// Relaxes arc out of state s in ofst_ as follows:\n//\n// 1. If the distance to s times the weight of arc is smaller than\n//   the currently stored distance for arc.nextstate, updates\n//   Distance(arc.nextstate) with a new estimate\n// 2. If fd is less than the currently stored distance from arc.nextstate to the\n// final state, updates with new estimate.\ntemplate <class Arc>\nvoid PdtPrunedExpand<Arc>::Relax(StateId s, const Arc &arc, Weight fd) {\n  const auto nd = Times(Distance(s), arc.weight);\n  if (less_(nd, Distance(arc.nextstate))) {\n    SetDistance(arc.nextstate, nd);\n    SetSourceState(arc.nextstate, SourceState(s));\n  }\n  if (less_(fd, FinalDistance(arc.nextstate))) {\n    SetFinalDistance(arc.nextstate, fd);\n  }\n  VLOG(2) << \"Relax: \" << s << \", d[s] = \" << Distance(s) << \", to \"\n          << arc.nextstate << \", d[ns] = \" << Distance(arc.nextstate)\n          << \", nd = \" << nd;\n}\n\n// Returns whether the arc out of state s in efst needs pruned.\ntemplate <class Arc>\nbool PdtPrunedExpand<Arc>::PruneArc(StateId s, const Arc &arc) {\n  VLOG(2) << \"Prune ?\";\n  auto fd = Weight::Zero();\n  if ((cached_source_ != SourceState(s)) ||\n      (cached_stack_id_ != current_stack_id_)) {\n    cached_source_ = SourceState(s);\n    cached_stack_id_ = current_stack_id_;\n    cached_dest_list_.clear();\n    if (cached_source_ != ifst_->Start()) {\n      for (auto set_iter =\n               balance_data_->Find(current_paren_id_, cached_source_);\n           !set_iter.Done(); set_iter.Next()) {\n        auto dest = set_iter.Element();\n        const auto it = dest_map_.find(dest);\n        cached_dest_list_.push_front(*it);\n      }\n    } else {\n      // TODO(allauzen): queue discipline should prevent this from ever\n      // happening.\n      // Replace by a check.\n      cached_dest_list_.push_front(\n          std::make_pair(rfst_.Start() - 1, Weight::One()));\n    }\n  }\n  for (auto it = cached_dest_list_.begin(); it != cached_dest_list_.end();\n       ++it) {\n    const auto d =\n        DistanceToDest(state_table_.Tuple(arc.nextstate).state_id, it->first);\n    fd = Plus(fd, Times(d, it->second));\n  }\n  Relax(s, arc, fd);\n  return less_(limit_, Times(Distance(s), Times(arc.weight, fd)));\n}\n\n// Adds start state of efst_ to ofst_, enqueues it, and initializes the distance\n// data structures.\ntemplate <class Arc>\nvoid PdtPrunedExpand<Arc>::ProcStart() {\n  const auto s = efst_.Start();\n  AddStateAndEnqueue(s);\n  ofst_->SetStart(s);\n  SetSourceState(s, ifst_->Start());\n  current_stack_id_ = 0;\n  current_paren_id_ = -1;\n  stack_length_.push_back(0);\n  const auto r = rfst_.Start() - 1;\n  cached_source_ = ifst_->Start();\n  cached_stack_id_ = 0;\n  cached_dest_list_.push_front(std::make_pair(r, Weight::One()));\n  const PdtStateTuple<StateId, StackId> tuple(r, 0);\n  SetFinalDistance(state_table_.FindState(tuple), Weight::One());\n  SetDistance(s, Weight::One());\n  const auto d = DistanceToDest(ifst_->Start(), r);\n  SetFinalDistance(s, d);\n  VLOG(2) << d;\n}\n\n// Makes s final in ofst_ if shortest accepting path ending in s is below\n// threshold.\ntemplate <class Arc>\nvoid PdtPrunedExpand<Arc>::ProcFinal(StateId s) {\n  const auto weight = efst_.Final(s);\n  if (weight == Weight::Zero()) return;\n  if (less_(limit_, Times(Distance(s), weight))) return;\n  ofst_->SetFinal(s, weight);\n}\n\n// Returns true when an arc (or meta-arc) leaving state s in efst_ is below the\n// threshold. When add_arc is true, arc is added to ofst_.\ntemplate <class Arc>\nbool PdtPrunedExpand<Arc>::ProcNonParen(StateId s, const Arc &arc,\n                                        bool add_arc) {\n  VLOG(2) << \"ProcNonParen: \" << s << \" to \" << arc.nextstate << \", \"\n          << arc.ilabel << \":\" << arc.olabel << \" / \" << arc.weight\n          << \", add_arc = \" << (add_arc ? \"true\" : \"false\");\n  if (PruneArc(s, arc)) return false;\n  if (add_arc) ofst_->AddArc(s, arc);\n  AddStateAndEnqueue(arc.nextstate);\n  return true;\n}\n\n// Processes an open paren arc leaving state s in ofst_. When the arc is labeled\n// with an open paren,\n//\n// 1. Considers each (shortest) balanced path starting in s by taking the arc\n// and ending by a close paren balancing the open paren of as a meta-arc,\n// processing and pruning each meta-arc as a non-paren arc, inserting its\n// destination to the queue;\n// 2. if at least one of these meta-arcs has not been pruned, adds the\n// destination of arc to ofst_ as a new source state for the stack ID nsi, and\n// inserts it in the queue.\ntemplate <class Arc>\nbool PdtPrunedExpand<Arc>::ProcOpenParen(StateId s, const Arc &arc, StackId si,\n                                         StackId nsi) {\n  // Updates the stack length when needed.\n  while (stack_length_.size() <= nsi) stack_length_.push_back(-1);\n  if (stack_length_[nsi] == -1) stack_length_[nsi] = stack_length_[si] + 1;\n  const auto ns = arc.nextstate;\n  VLOG(2) << \"Open paren: \" << s << \"(\" << state_table_.Tuple(s).state_id\n          << \") to \" << ns << \"(\" << state_table_.Tuple(ns).state_id << \")\";\n  bool proc_arc = false;\n  auto fd = Weight::Zero();\n  const auto paren_id = stack_.ParenId(arc.ilabel);\n  std::forward_list<StateId> sources;\n  for (auto set_iter =\n           balance_data_->Find(paren_id, state_table_.Tuple(ns).state_id);\n       !set_iter.Done(); set_iter.Next()) {\n    sources.push_front(set_iter.Element());\n  }\n  for (const auto source : sources) {\n    VLOG(2) << \"Close paren source: \" << source;\n    const internal::ParenState<Arc> paren_state(paren_id, source);\n    for (auto it = close_paren_multimap_.find(paren_state);\n         it != close_paren_multimap_.end() && paren_state == it->first; ++it) {\n      auto meta_arc = it->second;\n      const PdtStateTuple<StateId, StackId> tuple(meta_arc.nextstate, si);\n      meta_arc.nextstate = state_table_.FindState(tuple);\n      const auto state_id = state_table_.Tuple(ns).state_id;\n      const auto d = DistanceToDest(state_id, source);\n      VLOG(2) << state_id << \", \" << source;\n      VLOG(2) << \"Meta arc weight = \" << arc.weight << \" Times \" << d\n              << \" Times \" << meta_arc.weight;\n      meta_arc.weight = Times(arc.weight, Times(d, meta_arc.weight));\n      proc_arc |= ProcNonParen(s, meta_arc, false);\n      fd = Plus(\n          fd,\n          Times(Times(DistanceToDest(state_table_.Tuple(ns).state_id, source),\n                      it->second.weight),\n                FinalDistance(meta_arc.nextstate)));\n    }\n  }\n  if (proc_arc) {\n    VLOG(2) << \"Proc open paren \" << s << \" to \" << arc.nextstate;\n    ofst_->AddArc(\n        s, keep_parentheses_ ? arc : Arc(0, 0, arc.weight, arc.nextstate));\n    AddStateAndEnqueue(arc.nextstate);\n    const auto nd = Times(Distance(s), arc.weight);\n    if (less_(nd, Distance(arc.nextstate))) SetDistance(arc.nextstate, nd);\n    // FinalDistance not necessary for source state since pruning decided using\n    // meta-arcs above.  But this is a problem with A*, hence the following.\n    if (less_(fd, FinalDistance(arc.nextstate)))\n      SetFinalDistance(arc.nextstate, fd);\n    SetFlags(arc.nextstate, kSourceState, kSourceState);\n  }\n  return proc_arc;\n}\n\n// Checks that shortest path through close paren arc in efst_ is below\n// threshold, and if so, adds it to ofst_.\ntemplate <class Arc>\nbool PdtPrunedExpand<Arc>::ProcCloseParen(StateId s, const Arc &arc) {\n  const auto weight =\n      Times(Distance(s), Times(arc.weight, FinalDistance(arc.nextstate)));\n  if (less_(limit_, weight)) return false;\n  ofst_->AddArc(s,\n                keep_parentheses_ ? arc : Arc(0, 0, arc.weight, arc.nextstate));\n  return true;\n}\n\n// When state s in ofst_ is a source state for stack ID si, identifies all the\n// corresponding possible destination states, that is, all the states in ifst_\n// that have an outgoing close paren arc balancing the incoming open paren taken\n// to get to s. For each such state t, computes the shortest distance from (t,\n// si) to the final states in ofst_. Stores this information in dest_map_.\ntemplate <class Arc>\nvoid PdtPrunedExpand<Arc>::ProcDestStates(StateId s, StackId si) {\n  if (!(Flags(s) & kSourceState)) return;\n  if (si != current_stack_id_) {\n    dest_map_.clear();\n    current_stack_id_ = si;\n    current_paren_id_ = stack_.Top(current_stack_id_);\n    VLOG(2) << \"StackID \" << si << \" dequeued for first time\";\n  }\n  // TODO(allauzen): clean up source state business; rename current function to\n  // ProcSourceState.\n  SetSourceState(s, state_table_.Tuple(s).state_id);\n  const auto paren_id = stack_.Top(si);\n  for (auto set_iter =\n           balance_data_->Find(paren_id, state_table_.Tuple(s).state_id);\n       !set_iter.Done(); set_iter.Next()) {\n    const auto dest_state = set_iter.Element();\n    if (dest_map_.find(dest_state) != dest_map_.end()) continue;\n    auto dest_weight = Weight::Zero();\n    internal::ParenState<Arc> paren_state(paren_id, dest_state);\n    for (auto it = close_paren_multimap_.find(paren_state);\n         it != close_paren_multimap_.end() && paren_state == it->first; ++it) {\n      const auto &arc = it->second;\n      const PdtStateTuple<StateId, StackId> tuple(arc.nextstate,\n                                                  stack_.Pop(si));\n      dest_weight =\n          Plus(dest_weight,\n               Times(arc.weight, FinalDistance(state_table_.FindState(tuple))));\n    }\n    dest_map_[dest_state] = dest_weight;\n    VLOG(2) << \"State \" << dest_state << \" is a dest state for stack ID \" << si\n            << \" with weight \" << dest_weight;\n  }\n}\n\n// Expands and prunes the input PDT, writing the result in ofst.\ntemplate <class Arc>\nvoid PdtPrunedExpand<Arc>::Expand(MutableFst<Arc> *ofst,\n                                  const typename Arc::Weight &threshold) {\n  ofst_ = ofst;\n  if (error_) {\n    ofst_->SetProperties(kError, kError);\n    return;\n  }\n  ofst_->DeleteStates();\n  ofst_->SetInputSymbols(ifst_->InputSymbols());\n  ofst_->SetOutputSymbols(ifst_->OutputSymbols());\n  limit_ = Times(DistanceToDest(ifst_->Start(), rfst_.Start() - 1), threshold);\n  flags_.clear();\n  ProcStart();\n  while (!queue_.Empty()) {\n    const auto s = queue_.Head();\n    queue_.Dequeue();\n    SetFlags(s, kExpanded, kExpanded | kEnqueued);\n    VLOG(2) << s << \" dequeued!\";\n    ProcFinal(s);\n    StackId stack_id = state_table_.Tuple(s).stack_id;\n    ProcDestStates(s, stack_id);\n    for (ArcIterator<PdtExpandFst<Arc>> aiter(efst_, s); !aiter.Done();\n         aiter.Next()) {\n      const auto &arc = aiter.Value();\n      const auto nextstack_id = state_table_.Tuple(arc.nextstate).stack_id;\n      if (stack_id == nextstack_id) {\n        ProcNonParen(s, arc, true);\n      } else if (stack_id == stack_.Pop(nextstack_id)) {\n        ProcOpenParen(s, arc, stack_id, nextstack_id);\n      } else {\n        ProcCloseParen(s, arc);\n      }\n    }\n    VLOG(2) << \"d[\" << s << \"] = \" << Distance(s) << \", fd[\" << s\n            << \"] = \" << FinalDistance(s);\n  }\n}\n\n// Expand functions.\n\ntemplate <class Arc>\nstruct PdtExpandOptions {\n  using Weight = typename Arc::Weight;\n\n  bool connect;\n  bool keep_parentheses;\n  Weight weight_threshold;\n\n  PdtExpandOptions(bool connect = true, bool keep_parentheses = false,\n                   Weight weight_threshold = Weight::Zero())\n      : connect(connect),\n        keep_parentheses(keep_parentheses),\n        weight_threshold(std::move(weight_threshold)) {}\n};\n\n// Expands a pushdown transducer (PDT) encoded as an FST into an FST. This\n// version writes the expanded PDT to a mutable FST. In the PDT, some\n// transitions are labeled with open or close parentheses. To be interpreted as\n// a PDT, the parens must balance on a path. The open-close parenthesis label\n// pairs are passed using the parens argument. Expansion enforces the\n// parenthesis constraints. The PDT must be expandable as an FST.\ntemplate <class Arc>\nvoid Expand(\n    const Fst<Arc> &ifst,\n    const std::vector<std::pair<typename Arc::Label, typename Arc::Label>>\n        &parens,\n    MutableFst<Arc> *ofst, const PdtExpandOptions<Arc> &opts) {\n  PdtExpandFstOptions<Arc> eopts;\n  eopts.gc_limit = 0;\n  if (opts.weight_threshold == Arc::Weight::Zero()) {\n    eopts.keep_parentheses = opts.keep_parentheses;\n    *ofst = PdtExpandFst<Arc>(ifst, parens, eopts);\n  } else {\n    PdtPrunedExpand<Arc> pruned_expand(ifst, parens, opts.keep_parentheses);\n    pruned_expand.Expand(ofst, opts.weight_threshold);\n  }\n  if (opts.connect) Connect(ofst);\n}\n\n// Expands a pushdown transducer (PDT) encoded as an FST into an FST. This\n// version writes the expanded PDT result to a mutable FST. In the PDT, some\n// transitions are labeled with open or close parentheses. To be interpreted as\n// a PDT, the parens must balance on a path. The open-close parenthesis label\n// pairs are passed using the parents argument. Expansion enforces the\n// parenthesis constraints. The PDT must be expandable as an FST.\ntemplate <class Arc>\nvoid Expand(const Fst<Arc> &ifst,\n    const std::vector<std::pair<typename Arc::Label, typename Arc::Label>>\n    &parens, MutableFst<Arc> *ofst, bool connect = true,\n    bool keep_parentheses = false) {\n  const PdtExpandOptions<Arc> opts(connect, keep_parentheses);\n  Expand(ifst, parens, ofst, opts);\n}\n\n}  // namespace fst\n\n#endif  // FST_EXTENSIONS_PDT_EXPAND_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/expanded-fst.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Generic FST augmented with state count-interface class definition.\n\n#ifndef FST_EXPANDED_FST_H_\n#define FST_EXPANDED_FST_H_\n\n#include <sys/types.h>\n#include <istream>\n#include <string>\n\n#include <fst/log.h>\n#include <fstream>\n\n#include <fst/fst.h>\n\n\nnamespace fst {\n\n// A generic FST plus state count.\ntemplate <class A>\nclass ExpandedFst : public Fst<A> {\n public:\n  using Arc = A;\n  using StateId = typename Arc::StateId;\n\n  virtual StateId NumStates() const = 0;  // State count\n\n  // Get a copy of this ExpandedFst. See Fst<>::Copy() for further doc.\n  ExpandedFst<Arc> *Copy(bool safe = false) const override = 0;\n\n  // Read an ExpandedFst from an input stream; return NULL on error.\n  static ExpandedFst<Arc> *Read(std::istream &strm,\n                                const FstReadOptions &opts) {\n    FstReadOptions ropts(opts);\n    FstHeader hdr;\n    if (ropts.header) {\n      hdr = *opts.header;\n    } else {\n      if (!hdr.Read(strm, opts.source)) return nullptr;\n      ropts.header = &hdr;\n    }\n    if (!(hdr.Properties() & kExpanded)) {\n      LOG(ERROR) << \"ExpandedFst::Read: Not an ExpandedFst: \" << ropts.source;\n      return nullptr;\n    }\n    const auto reader =\n        FstRegister<Arc>::GetRegister()->GetReader(hdr.FstType());\n    if (!reader) {\n      LOG(ERROR) << \"ExpandedFst::Read: Unknown FST type \\\"\" << hdr.FstType()\n                 << \"\\\" (arc type = \\\"\" << A::Type() << \"\\\"): \" << ropts.source;\n      return nullptr;\n    }\n    auto *fst = reader(strm, ropts);\n    if (!fst) return nullptr;\n    return static_cast<ExpandedFst<Arc> *>(fst);\n  }\n\n  // Read an ExpandedFst from a file; return NULL on error.\n  // Empty filename reads from standard input.\n  static ExpandedFst<Arc> *Read(const string &filename) {\n    if (!filename.empty()) {\n      std::ifstream strm(filename,\n                              std::ios_base::in | std::ios_base::binary);\n      if (!strm) {\n        LOG(ERROR) << \"ExpandedFst::Read: Can't open file: \" << filename;\n        return nullptr;\n      }\n      return Read(strm, FstReadOptions(filename));\n    } else {\n      return Read(std::cin, FstReadOptions(\"standard input\"));\n    }\n  }\n};\n\nnamespace internal {\n\n//  ExpandedFst<A> case - abstract methods.\ntemplate <class Arc>\ninline typename Arc::Weight Final(const ExpandedFst<Arc> &fst,\n                                  typename Arc::StateId s) {\n  return fst.Final(s);\n}\n\ntemplate <class Arc>\ninline std::ptrdiff_t NumArcs(const ExpandedFst<Arc> &fst, typename Arc::StateId s) {\n  return fst.NumArcs(s);\n}\n\ntemplate <class Arc>\ninline std::ptrdiff_t NumInputEpsilons(const ExpandedFst<Arc> &fst,\n                                typename Arc::StateId s) {\n  return fst.NumInputEpsilons(s);\n}\n\ntemplate <class Arc>\ninline std::ptrdiff_t NumOutputEpsilons(const ExpandedFst<Arc> &fst,\n                                 typename Arc::StateId s) {\n  return fst.NumOutputEpsilons(s);\n}\n\n}  // namespace internal\n\n// A useful alias when using StdArc.\nusing StdExpandedFst = ExpandedFst<StdArc>;\n\n// This is a helper class template useful for attaching an ExpandedFst\n// interface to its implementation, handling reference counting. It\n// delegates to ImplToFst the handling of the Fst interface methods.\ntemplate <class Impl, class FST = ExpandedFst<typename Impl::Arc>>\nclass ImplToExpandedFst : public ImplToFst<Impl, FST> {\n public:\n  using Arc = typename FST::Arc;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using ImplToFst<Impl, FST>::operator=;\n\n  StateId NumStates() const override { return GetImpl()->NumStates(); }\n\n protected:\n  using ImplToFst<Impl, FST>::GetImpl;\n\n  explicit ImplToExpandedFst(std::shared_ptr<Impl> impl)\n      : ImplToFst<Impl, FST>(impl) {}\n\n  ImplToExpandedFst(const ImplToExpandedFst<Impl, FST> &fst)\n      : ImplToFst<Impl, FST>(fst) {}\n\n  ImplToExpandedFst(const ImplToExpandedFst<Impl, FST> &fst, bool safe)\n      : ImplToFst<Impl, FST>(fst, safe) {}\n\n  static Impl *Read(std::istream &strm, const FstReadOptions &opts) {\n    return Impl::Read(strm, opts);\n  }\n\n  // Read FST implementation from a file; return NULL on error.\n  // Empty filename reads from standard input.\n  static Impl *Read(const string &filename) {\n    if (!filename.empty()) {\n      std::ifstream strm(filename,\n                              std::ios_base::in | std::ios_base::binary);\n      if (!strm) {\n        LOG(ERROR) << \"ExpandedFst::Read: Can't open file: \" << filename;\n        return nullptr;\n      }\n      return Impl::Read(strm, FstReadOptions(filename));\n    } else {\n      return Impl::Read(std::cin, FstReadOptions(\"standard input\"));\n    }\n  }\n};\n\n// Function to return the number of states in an FST, counting them\n// if necessary.\ntemplate <class Arc>\ntypename Arc::StateId CountStates(const Fst<Arc> &fst) {\n  if (fst.Properties(kExpanded, false)) {\n    const auto *efst = static_cast<const ExpandedFst<Arc> *>(&fst);\n    return efst->NumStates();\n  } else {\n    typename Arc::StateId nstates = 0;\n    for (StateIterator<Fst<Arc>> siter(fst); !siter.Done(); siter.Next()) {\n      ++nstates;\n    }\n    return nstates;\n  }\n}\n\n// Function to return the number of arcs in an FST.\ntemplate <class Arc>\ntypename Arc::StateId CountArcs(const Fst<Arc> &fst) {\n  size_t narcs = 0;\n  for (StateIterator<Fst<Arc>> siter(fst); !siter.Done(); siter.Next()) {\n    narcs += fst.NumArcs(siter.Value());\n  }\n  return narcs;\n}\n\n}  // namespace fst\n\n#endif  // FST_EXPANDED_FST_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/expectation-weight.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Expectation semiring as described by Jason Eisner:\n// See: doi=10.1.1.22.9398\n// Multiplex semiring operations and identities:\n//    One: <One, Zero>\n//    Zero: <Zero, Zero>\n//    Plus: <a1, b1> + <a2, b2> = < (a1 + a2) , (b1 + b2) >\n//    Times: <a1, b1> * <a2, b2> = < (a1 * a2) , [(a1 * b2) + (a2 * b1)] >\n//    Division: Undefined (currently)\n//\n// Usually used to store the pair <probability, random_variable> so that\n// ShortestDistance[Fst<ArcTpl<ExpectationWeight<P, V>>>]\n//    == < PosteriorProbability, Expected_Value[V] >\n\n#ifndef FST_EXPECTATION_WEIGHT_H_\n#define FST_EXPECTATION_WEIGHT_H_\n\n#include <string>\n\n#include <fst/log.h>\n\n#include <fst/pair-weight.h>\n#include <fst/product-weight.h>\n\n\nnamespace fst {\n\n// X1 is usually a probability weight like LogWeight.\n// X2 is usually a random variable or vector (see SignedLogWeight or\n// SparsePowerWeight).\n//\n// If X1 is distinct from X2, it is required that there is an external product\n// between X1 and X2 and if both semriring are commutative, or left or right\n// semirings, then result must have those properties.\ntemplate <class X1, class X2>\nclass ExpectationWeight : public PairWeight<X1, X2> {\n public:\n  using PairWeight<X1, X2>::Value1;\n  using PairWeight<X1, X2>::Value2;\n\n  using PairWeight<X1, X2>::Reverse;\n  using PairWeight<X1, X2>::Quantize;\n  using PairWeight<X1, X2>::Member;\n\n  using ReverseWeight =\n      ExpectationWeight<typename X1::ReverseWeight, typename X2::ReverseWeight>;\n\n  ExpectationWeight() : PairWeight<X1, X2>(Zero()) {}\n\n  ExpectationWeight(const ExpectationWeight &weight)\n      : PairWeight<X1, X2>(weight) {}\n\n  explicit ExpectationWeight(const PairWeight<X1, X2> &weight)\n      : PairWeight<X1, X2>(weight) {}\n\n  ExpectationWeight(const X1 &x1, const X2 &x2) : PairWeight<X1, X2>(x1, x2) {}\n\n  static const ExpectationWeight &Zero() {\n    static const ExpectationWeight zero(X1::Zero(), X2::Zero());\n    return zero;\n  }\n\n  static const ExpectationWeight &One() {\n    static const ExpectationWeight one(X1::One(), X2::Zero());\n    return one;\n  }\n\n  static const ExpectationWeight &NoWeight() {\n    static const ExpectationWeight no_weight(X1::NoWeight(), X2::NoWeight());\n    return no_weight;\n  }\n\n  static const string &Type() {\n    static const string *const type =\n        new string(\"expectation_\" + X1::Type() + \"_\" + X2::Type());\n    return *type;\n  }\n\n  PairWeight<X1, X2> Quantize(float delta = kDelta) const {\n    return ExpectationWeight(PairWeight<X1, X2>::Quantize());\n  }\n\n  ReverseWeight Reverse() const {\n    return ReverseWeight(PairWeight<X1, X2>::Reverse());\n  }\n\n  bool Member() const { return PairWeight<X1, X2>::Member(); }\n\n  static constexpr uint64_t Properties() {\n    return X1::Properties() & X2::Properties() &\n           (kLeftSemiring | kRightSemiring | kCommutative | kIdempotent);\n  }\n};\n\ntemplate <class X1, class X2>\ninline ExpectationWeight<X1, X2> Plus(const ExpectationWeight<X1, X2> &w1,\n                                      const ExpectationWeight<X1, X2> &w2) {\n  return ExpectationWeight<X1, X2>(Plus(w1.Value1(), w2.Value1()),\n                                   Plus(w1.Value2(), w2.Value2()));\n}\n\ntemplate <class X1, class X2>\ninline ExpectationWeight<X1, X2> Times(const ExpectationWeight<X1, X2> &w1,\n                                       const ExpectationWeight<X1, X2> &w2) {\n  return ExpectationWeight<X1, X2>(\n      Times(w1.Value1(), w2.Value1()),\n      Plus(Times(w1.Value1(), w2.Value2()), Times(w1.Value2(), w2.Value1())));\n}\n\ntemplate <class X1, class X2>\ninline ExpectationWeight<X1, X2> Divide(const ExpectationWeight<X1, X2> &w1,\n                                        const ExpectationWeight<X1, X2> &w2,\n                                        DivideType typ = DIVIDE_ANY) {\n  FSTERROR() << \"ExpectationWeight::Divide: Not implemented\";\n  return ExpectationWeight<X1, X2>::NoWeight();\n}\n\n// This function object generates weights by calling the underlying generators\n// for the template weight types, like all other pair weight types. This is\n// intended primarily for testing.\ntemplate <class X1, class X2>\nclass WeightGenerate<ExpectationWeight<X1, X2>>\n    : public WeightGenerate<PairWeight<X1, X2>> {\n public:\n  using Weight = ExpectationWeight<X1, X2>;\n  using Generate = WeightGenerate<PairWeight<X1, X2>>;\n\n  explicit WeightGenerate(bool allow_zero = true) : Generate(allow_zero) {}\n\n  Weight operator()() const { return Weight(Generate::operator()()); }\n};\n\n}  // namespace fst\n\n#endif  // FST_EXPECTATION_WEIGHT_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/extensions/compress/compress-script.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Declarations of 'scriptable' versions of compression operations, that is,\n// those that can be called with FstClass-type arguments.\n\n#ifndef FST_EXTENSIONS_COMPRESS_COMPRESS_SCRIPT_H_\n#define FST_EXTENSIONS_COMPRESS_COMPRESS_SCRIPT_H_\n\n#include <string>\n#include <tuple>\n\n#include <fst/log.h>\n#include <fst/extensions/compress/compress.h>\n#include <fst/mutable-fst.h>\n#include <fst/util.h>\n#include <fst/script/fst-class.h>\n\nnamespace fst {\nnamespace script {\n\ntypedef std::tuple<const FstClass &, const string &, const bool> CompressArgs;\n\ntemplate <class Arc>\nvoid Compress(CompressArgs *args) {\n  const Fst<Arc> &fst = *(std::get<0>(*args).GetFst<Arc>());\n  const string &filename = std::get<1>(*args);\n  const bool gzip = std::get<2>(*args);\n\n  if (!fst::Compress(fst, filename, gzip)) FSTERROR() << \"Compress: failed\";\n}\n\nvoid Compress(const FstClass &fst, const string &filename, const bool gzip);\n\ntypedef std::tuple<const string &, MutableFstClass *, const bool>\n    DecompressArgs;\n\ntemplate <class Arc>\nvoid Decompress(DecompressArgs *args) {\n  const string &filename = std::get<0>(*args);\n  MutableFst<Arc> *fst = std::get<1>(*args)->GetMutableFst<Arc>();\n  const bool gzip = std::get<2>(*args);\n\n  if (!fst::Decompress(filename, fst, gzip))\n    FSTERROR() << \"Decompress: failed\";\n}\n\nvoid Decompress(const string &filename, MutableFstClass *fst, const bool gzip);\n\n}  // namespace script\n}  // namespace fst\n\n#endif  // FST_EXTENSIONS_COMPRESS_COMPRESS_SCRIPT_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/extensions/compress/compress.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Compresses and decompresses unweighted FSTs.\n\n#ifndef FST_EXTENSIONS_COMPRESS_COMPRESS_H_\n#define FST_EXTENSIONS_COMPRESS_COMPRESS_H_\n\n#include <algorithm>\n#include <cstdio>\n#include <iostream>\n#include <map>\n#include <memory>\n#include <queue>\n#include <string>\n#include <utility>\n#include <vector>\n\n#include <fst/compat.h>\n#include <fst/log.h>\n#include <fst/extensions/compress/elias.h>\n#include <fst/extensions/compress/gzfile.h>\n#include <fst/encode.h>\n#include <fst/fst.h>\n#include <fst/mutable-fst.h>\n#include <fst/statesort.h>\n\nnamespace fst {\n\n// Identifies stream data as a vanilla compressed FST.\nstatic const int32_t kCompressMagicNumber = 1858869554;\n// Identifies stream data as (probably) a Gzip file accidentally read from\n// a vanilla stream, without gzip support.\nstatic const int32_t kGzipMagicNumber = 0x8b1f;\n// Selects the two most significant bytes.\nconstexpr uint32_t kGzipMask = 0xffffffff >> 16;\n\nnamespace internal {\n\n// Expands a Lempel Ziv code and returns the set of code words. expanded_code[i]\n// is the i^th Lempel Ziv codeword.\ntemplate <class Var, class Edge>\nbool ExpandLZCode(const std::vector<std::pair<Var, Edge>> &code,\n                  std::vector<std::vector<Edge>> *expanded_code) {\n  expanded_code->resize(code.size());\n  for (int i = 0; i < code.size(); ++i) {\n    if (code[i].first > i) {\n      LOG(ERROR) << \"ExpandLZCode: Not a valid code\";\n      return false;\n    }\n    if (code[i].first == 0) {\n      (*expanded_code)[i].resize(1, code[i].second);\n    } else {\n      (*expanded_code)[i].resize((*expanded_code)[code[i].first - 1].size() +\n                                 1);\n      std::copy((*expanded_code)[code[i].first - 1].begin(),\n                (*expanded_code)[code[i].first - 1].end(),\n                (*expanded_code)[i].begin());\n      (*expanded_code)[i][(*expanded_code)[code[i].first - 1].size()] =\n          code[i].second;\n    }\n  }\n  return true;\n}\n\n}  // namespace internal\n\n// Lempel Ziv on data structure Edge, with a less than operator\n// EdgeLessThan and an equals operator  EdgeEquals.\n// Edge has a value defaultedge which it never takes and\n// Edge is defined, it is initialized to defaultedge\ntemplate <class Var, class Edge, class EdgeLessThan, class EdgeEquals>\nclass LempelZiv {\n public:\n  LempelZiv() : dict_number_(0), default_edge_() {\n    root_.current_number = dict_number_++;\n    root_.current_edge = default_edge_;\n    decode_vector_.push_back(std::make_pair(0, default_edge_));\n  }\n  // Encodes a vector input into output\n  void BatchEncode(const std::vector<Edge> &input,\n                   std::vector<std::pair<Var, Edge>> *output);\n\n  // Decodes codedvector to output. Returns false if\n  // the index exceeds the size.\n  bool BatchDecode(const std::vector<std::pair<Var, Edge>> &input,\n                   std::vector<Edge> *output);\n\n  // Decodes a single dictionary element. Returns false\n  // if the index exceeds the size.\n  bool SingleDecode(const Var &index, Edge *output) {\n    if (index >= decode_vector_.size()) {\n      LOG(ERROR) << \"LempelZiv::SingleDecode: \"\n                 << \"Index exceeded the dictionary size\";\n      return false;\n    } else {\n      *output = decode_vector_[index].second;\n      return true;\n    }\n  }\n\n  ~LempelZiv() {\n    for (auto it = (root_.next_number).begin(); it != (root_.next_number).end();\n         ++it) {\n      CleanUp(it->second);\n    }\n  }\n  // Adds a single dictionary element while decoding\n  //  void AddDictElement(const std::pair<Var, Edge> &newdict) {\n  //    EdgeEquals InstEdgeEquals;\n  //  if (InstEdgeEquals(newdict.second, default_edge_) != 1)\n  //     decode_vector_.push_back(newdict);\n  //  }\n\n private:\n  // Node datastructure is used for encoding\n\n  struct Node {\n    Var current_number;\n    Edge current_edge;\n    std::map<Edge, Node *, EdgeLessThan> next_number;\n  };\n\n  void CleanUp(Node *temp) {\n    for (auto it = (temp->next_number).begin(); it != (temp->next_number).end();\n         ++it) {\n      CleanUp(it->second);\n    }\n    delete temp;\n  }\n  Node root_;\n  Var dict_number_;\n  // decode_vector_ is used for decoding\n  std::vector<std::pair<Var, Edge>> decode_vector_;\n  Edge default_edge_;\n};\n\ntemplate <class Var, class Edge, class EdgeLessThan, class EdgeEquals>\nvoid LempelZiv<Var, Edge, EdgeLessThan, EdgeEquals>::BatchEncode(\n    const std::vector<Edge> &input, std::vector<std::pair<Var, Edge>> *output) {\n  for (typename std::vector<Edge>::const_iterator it = input.begin();\n       it != input.end(); ++it) {\n    Node *temp_node = &root_;\n    while (it != input.end()) {\n      auto next = (temp_node->next_number).find(*it);\n      if (next != (temp_node->next_number).end()) {\n        temp_node = next->second;\n        ++it;\n      } else {\n        break;\n      }\n    }\n    if (it == input.end() && temp_node->current_number != 0) {\n      output->push_back(\n          std::make_pair(temp_node->current_number, default_edge_));\n    } else if (it != input.end()) {\n      output->push_back(std::make_pair(temp_node->current_number, *it));\n      Node *new_node = new (Node);\n      new_node->current_number = dict_number_++;\n      new_node->current_edge = *it;\n      (temp_node->next_number)[*it] = new_node;\n    }\n    if (it == input.end()) break;\n  }\n}\n\ntemplate <class Var, class Edge, class EdgeLessThan, class EdgeEquals>\nbool LempelZiv<Var, Edge, EdgeLessThan, EdgeEquals>::BatchDecode(\n    const std::vector<std::pair<Var, Edge>> &input, std::vector<Edge> *output) {\n  for (typename std::vector<std::pair<Var, Edge>>::const_iterator it =\n           input.begin();\n       it != input.end(); ++it) {\n    std::vector<Edge> temp_output;\n    EdgeEquals InstEdgeEquals;\n    if (InstEdgeEquals(it->second, default_edge_) != 1) {\n      decode_vector_.push_back(*it);\n      temp_output.push_back(it->second);\n    }\n    Var temp_integer = it->first;\n    if (temp_integer >= decode_vector_.size()) {\n      LOG(ERROR) << \"LempelZiv::BatchDecode: \"\n                 << \"Index exceeded the dictionary size\";\n      return false;\n    } else {\n      while (temp_integer != 0) {\n        temp_output.push_back(decode_vector_[temp_integer].second);\n        temp_integer = decode_vector_[temp_integer].first;\n      }\n      std::reverse(temp_output.begin(), temp_output.end());\n      output->insert(output->end(), temp_output.begin(), temp_output.end());\n    }\n  }\n  return true;\n}\n\n// The main Compressor class\ntemplate <class Arc>\nclass Compressor {\n public:\n  typedef typename Arc::StateId StateId;\n  typedef typename Arc::Label Label;\n  typedef typename Arc::Weight Weight;\n\n  Compressor() {}\n\n  // Compresses fst into a boolean vector code. Returns true on sucesss.\n  bool Compress(const Fst<Arc> &fst, std::ostream &strm);\n\n  // Decompresses the boolean vector into Fst. Returns true on sucesss.\n  bool Decompress(std::istream &strm, const string &source,\n                  MutableFst<Arc> *fst);\n\n  // Finds the BFS order of a fst\n  void BfsOrder(const ExpandedFst<Arc> &fst, std::vector<StateId> *order);\n\n  // Preprocessing step to convert fst to a isomorphic fst\n  // Returns a preproccess fst and a dictionary\n  void Preprocess(const Fst<Arc> &fst, MutableFst<Arc> *preprocessedfst,\n                  EncodeMapper<Arc> *encoder);\n\n  // Performs Lempel Ziv and outputs a stream of integers\n  // and sends it to a stream\n  void EncodeProcessedFst(const ExpandedFst<Arc> &fst, std::ostream &strm);\n\n  // Decodes fst from the stream\n  void DecodeProcessedFst(const std::vector<StateId> &input,\n                          MutableFst<Arc> *fst, bool unweighted);\n\n  // Converts buffer_code_ to uint8_t and writes to a stream.\n\n  // Writes the boolean file to the stream\n  void WriteToStream(std::ostream &strm);\n\n  // Writes the weights to the stream\n  void WriteWeight(const std::vector<Weight> &input, std::ostream &strm);\n\n  void ReadWeight(std::istream &strm, std::vector<Weight> *output);\n\n  // Same as fst::Decode without the line RmFinalEpsilon(fst)\n  void DecodeForCompress(MutableFst<Arc> *fst, const EncodeMapper<Arc> &mapper);\n\n  // Updates the buffer_code_\n  template <class CVar>\n  void WriteToBuffer(CVar input) {\n    std::vector<bool> current_code;\n    Elias<CVar>::DeltaEncode(input, &current_code);\n    if (!buffer_code_.empty()) {\n      buffer_code_.insert(buffer_code_.end(), current_code.begin(),\n                          current_code.end());\n    } else {\n      buffer_code_.assign(current_code.begin(), current_code.end());\n    }\n  }\n\n private:\n  struct LZLabel {\n    LZLabel() : label(0) {}\n    Label label;\n  };\n\n  struct LabelLessThan {\n    bool operator()(const LZLabel &labelone, const LZLabel &labeltwo) const {\n      return labelone.label < labeltwo.label;\n    }\n  };\n\n  struct LabelEquals {\n    bool operator()(const LZLabel &labelone, const LZLabel &labeltwo) const {\n      return labelone.label == labeltwo.label;\n    }\n  };\n\n  struct Transition {\n    Transition() : nextstate(0), label(0), weight(Weight::Zero()) {}\n\n    StateId nextstate;\n    Label label;\n    Weight weight;\n  };\n\n  struct TransitionLessThan {\n    bool operator()(const Transition &transition_one,\n                    const Transition &transition_two) const {\n      if (transition_one.nextstate == transition_two.nextstate)\n        return transition_one.label < transition_two.label;\n      else\n        return transition_one.nextstate < transition_two.nextstate;\n    }\n  } transition_less_than;\n\n  struct TransitionEquals {\n    bool operator()(const Transition &transition_one,\n                    const Transition &transition_two) const {\n      return transition_one.nextstate == transition_two.nextstate &&\n             transition_one.label == transition_two.label;\n    }\n  } transition_equals;\n\n  struct OldDictCompare {\n    bool operator()(const std::pair<StateId, Transition> &pair_one,\n                    const std::pair<StateId, Transition> &pair_two) const {\n      if ((pair_one.second).nextstate == (pair_two.second).nextstate)\n        return (pair_one.second).label < (pair_two.second).label;\n      else\n        return (pair_one.second).nextstate < (pair_two.second).nextstate;\n    }\n  } old_dict_compare;\n\n  std::vector<bool> buffer_code_;\n  std::vector<Weight> arc_weight_;\n  std::vector<Weight> final_weight_;\n};\n\ntemplate <class Arc>\ninline void Compressor<Arc>::DecodeForCompress(\n    MutableFst<Arc> *fst, const EncodeMapper<Arc> &mapper) {\n  ArcMap(fst, EncodeMapper<Arc>(mapper, DECODE));\n  fst->SetInputSymbols(mapper.InputSymbols());\n  fst->SetOutputSymbols(mapper.OutputSymbols());\n}\n\n// Compressor::BfsOrder\ntemplate <class Arc>\nvoid Compressor<Arc>::BfsOrder(const ExpandedFst<Arc> &fst,\n                               std::vector<StateId> *order) {\n  Arc arc;\n  StateId bfs_visit_number = 0;\n  std::queue<StateId> states_queue;\n  order->assign(fst.NumStates(), kNoStateId);\n  states_queue.push(fst.Start());\n  (*order)[fst.Start()] = bfs_visit_number++;\n  while (!states_queue.empty()) {\n    for (ArcIterator<Fst<Arc>> aiter(fst, states_queue.front()); !aiter.Done();\n         aiter.Next()) {\n      arc = aiter.Value();\n      StateId nextstate = arc.nextstate;\n      if ((*order)[nextstate] == kNoStateId) {\n        (*order)[nextstate] = bfs_visit_number++;\n        states_queue.push(nextstate);\n      }\n    }\n    states_queue.pop();\n  }\n\n  // If the FST is unconnected, then the following\n  // code finds them\n  while (bfs_visit_number < fst.NumStates()) {\n    int unseen_state = 0;\n    for (unseen_state = 0; unseen_state < fst.NumStates(); ++unseen_state) {\n      if ((*order)[unseen_state] == kNoStateId) break;\n    }\n    states_queue.push(unseen_state);\n    (*order)[unseen_state] = bfs_visit_number++;\n    while (!states_queue.empty()) {\n      for (ArcIterator<Fst<Arc>> aiter(fst, states_queue.front());\n           !aiter.Done(); aiter.Next()) {\n        arc = aiter.Value();\n        StateId nextstate = arc.nextstate;\n        if ((*order)[nextstate] == kNoStateId) {\n          (*order)[nextstate] = bfs_visit_number++;\n          states_queue.push(nextstate);\n        }\n      }\n      states_queue.pop();\n    }\n  }\n}\n\ntemplate <class Arc>\nvoid Compressor<Arc>::Preprocess(const Fst<Arc> &fst,\n                                 MutableFst<Arc> *preprocessedfst,\n                                 EncodeMapper<Arc> *encoder) {\n  *preprocessedfst = fst;\n  if (!preprocessedfst->NumStates()) {\n    return;\n  }\n  // Relabels the edges and develops a dictionary\n  Encode(preprocessedfst, encoder);\n  std::vector<StateId> order;\n  // Finds the BFS sorting order of the fst\n  BfsOrder(*preprocessedfst, &order);\n  // Reorders the states according to the BFS order\n  StateSort(preprocessedfst, order);\n}\n\ntemplate <class Arc>\nvoid Compressor<Arc>::EncodeProcessedFst(const ExpandedFst<Arc> &fst,\n                                         std::ostream &strm) {\n  std::vector<StateId> output;\n  LempelZiv<StateId, LZLabel, LabelLessThan, LabelEquals> dict_new;\n  LempelZiv<StateId, Transition, TransitionLessThan, TransitionEquals> dict_old;\n  std::vector<LZLabel> current_new_input;\n  std::vector<Transition> current_old_input;\n  std::vector<std::pair<StateId, LZLabel>> current_new_output;\n  std::vector<std::pair<StateId, Transition>> current_old_output;\n  std::vector<StateId> final_states;\n\n  StateId number_of_states = fst.NumStates();\n\n  StateId seen_states = 0;\n  // Adding the number of states\n  WriteToBuffer<StateId>(number_of_states);\n\n  for (StateId state = 0; state < number_of_states; ++state) {\n    current_new_input.clear();\n    current_old_input.clear();\n    current_new_output.clear();\n    current_old_output.clear();\n    if (state > seen_states) ++seen_states;\n\n    // Collecting the final states\n    if (fst.Final(state) != Weight::Zero()) {\n      final_states.push_back(state);\n      final_weight_.push_back(fst.Final(state));\n    }\n\n    // Reading the states\n    for (ArcIterator<Fst<Arc>> aiter(fst, state); !aiter.Done(); aiter.Next()) {\n      Arc arc = aiter.Value();\n      if (arc.nextstate > seen_states) {  // RILEY: > or >= ?\n        ++seen_states;\n        LZLabel temp_label;\n        temp_label.label = arc.ilabel;\n        arc_weight_.push_back(arc.weight);\n        current_new_input.push_back(temp_label);\n      } else {\n        Transition temp_transition;\n        temp_transition.nextstate = arc.nextstate;\n        temp_transition.label = arc.ilabel;\n        temp_transition.weight = arc.weight;\n        current_old_input.push_back(temp_transition);\n      }\n    }\n    // Adding new states\n    dict_new.BatchEncode(current_new_input, &current_new_output);\n    WriteToBuffer<StateId>(current_new_output.size());\n\n    for (auto it = current_new_output.begin(); it != current_new_output.end();\n         ++it) {\n      WriteToBuffer<StateId>(it->first);\n      WriteToBuffer<Label>((it->second).label);\n    }\n    // Adding old states by sorting and using difference coding\n    std::sort(current_old_input.begin(), current_old_input.end(),\n              transition_less_than);\n    for (auto it = current_old_input.begin(); it != current_old_input.end();\n         ++it) {\n      arc_weight_.push_back(it->weight);\n    }\n    dict_old.BatchEncode(current_old_input, &current_old_output);\n    std::vector<StateId> dict_old_temp;\n    std::vector<Transition> transition_old_temp;\n    for (auto it = current_old_output.begin(); it != current_old_output.end();\n         ++it) {\n      dict_old_temp.push_back(it->first);\n      transition_old_temp.push_back(it->second);\n    }\n    if (!transition_old_temp.empty()) {\n      if ((transition_old_temp.back()).nextstate == 0 &&\n          (transition_old_temp.back()).label == 0) {\n        transition_old_temp.pop_back();\n      }\n    }\n    std::sort(dict_old_temp.begin(), dict_old_temp.end());\n    std::sort(transition_old_temp.begin(), transition_old_temp.end(),\n              transition_less_than);\n\n    WriteToBuffer<StateId>(dict_old_temp.size());\n    if (dict_old_temp.size() != transition_old_temp.size())\n      WriteToBuffer<int>(1);\n    else\n      WriteToBuffer<int>(0);\n\n    StateId previous;\n    if (!dict_old_temp.empty()) {\n      WriteToBuffer<StateId>(dict_old_temp.front());\n      previous = dict_old_temp.front();\n    }\n    if (dict_old_temp.size() > 1) {\n      for (auto it = dict_old_temp.begin() + 1; it != dict_old_temp.end();\n           ++it) {\n        WriteToBuffer<StateId>(*it - previous);\n        previous = *it;\n      }\n    }\n    if (!transition_old_temp.empty()) {\n      WriteToBuffer<StateId>((transition_old_temp.front()).nextstate);\n      previous = (transition_old_temp.front()).nextstate;\n      WriteToBuffer<Label>((transition_old_temp.front()).label);\n    }\n    if (transition_old_temp.size() > 1) {\n      for (auto it = transition_old_temp.begin() + 1;\n           it != transition_old_temp.end(); ++it) {\n        WriteToBuffer<StateId>(it->nextstate - previous);\n        previous = it->nextstate;\n        WriteToBuffer<StateId>(it->label);\n      }\n    }\n  }\n  // Adding final states\n  WriteToBuffer<StateId>(final_states.size());\n  if (!final_states.empty()) {\n    for (auto it = final_states.begin(); it != final_states.end(); ++it) {\n      WriteToBuffer<StateId>(*it);\n    }\n  }\n  WriteToStream(strm);\n  uint8_t unweighted = (fst.Properties(kUnweighted, true) == kUnweighted);\n  WriteType(strm, unweighted);\n  if (unweighted == 0) {\n    WriteWeight(arc_weight_, strm);\n    WriteWeight(final_weight_, strm);\n  }\n}\n\ntemplate <class Arc>\nvoid Compressor<Arc>::DecodeProcessedFst(const std::vector<StateId> &input,\n                                         MutableFst<Arc> *fst,\n                                         bool unweighted) {\n  LempelZiv<StateId, LZLabel, LabelLessThan, LabelEquals> dict_new;\n  LempelZiv<StateId, Transition, TransitionLessThan, TransitionEquals> dict_old;\n  std::vector<std::pair<StateId, LZLabel>> current_new_input;\n  std::vector<std::pair<StateId, Transition>> current_old_input;\n  std::vector<LZLabel> current_new_output;\n  std::vector<Transition> current_old_output;\n  std::vector<std::pair<StateId, Transition>> actual_old_dict_numbers;\n  std::vector<Transition> actual_old_dict_transitions;\n  auto arc_weight_it = arc_weight_.begin();\n  Transition default_transition;\n  StateId seen_states = 1;\n\n  // Adding states.\n  const StateId num_states = input.front();\n  if (num_states > 0) {\n    const StateId start_state = fst->AddState();\n    fst->SetStart(start_state);\n    for (StateId state = 1; state < num_states; ++state) {\n      fst->AddState();\n    }\n  }\n\n  typename std::vector<StateId>::const_iterator main_it = input.begin();\n  ++main_it;\n\n  for (StateId current_state = 0; current_state < num_states; ++current_state) {\n    if (current_state >= seen_states) ++seen_states;\n    current_new_input.clear();\n    current_new_output.clear();\n    current_old_input.clear();\n    current_old_output.clear();\n    // New states\n    StateId current_number_new_elements = *main_it;\n    ++main_it;\n    for (StateId new_integer = 0; new_integer < current_number_new_elements;\n         ++new_integer) {\n      std::pair<StateId, LZLabel> temp_new_dict_element;\n      temp_new_dict_element.first = *main_it;\n      ++main_it;\n      LZLabel temp_label;\n      temp_label.label = *main_it;\n      ++main_it;\n      temp_new_dict_element.second = temp_label;\n      current_new_input.push_back(temp_new_dict_element);\n    }\n    dict_new.BatchDecode(current_new_input, &current_new_output);\n    for (auto it = current_new_output.begin(); it != current_new_output.end();\n         ++it) {\n      if (!unweighted) {\n        fst->AddArc(current_state,\n                    Arc(it->label, it->label, *arc_weight_it, seen_states++));\n        ++arc_weight_it;\n      } else {\n        fst->AddArc(current_state,\n                    Arc(it->label, it->label, Weight::One(), seen_states++));\n      }\n    }\n\n    // Old states dictionary\n    StateId current_number_old_elements = *main_it;\n    ++main_it;\n    StateId is_zero_removed = *main_it;\n    ++main_it;\n    StateId previous = 0;\n    actual_old_dict_numbers.clear();\n    for (StateId new_integer = 0; new_integer < current_number_old_elements;\n         ++new_integer) {\n      std::pair<StateId, Transition> pair_temp_transition;\n      if (new_integer == 0) {\n        pair_temp_transition.first = *main_it;\n        previous = *main_it;\n      } else {\n        pair_temp_transition.first = *main_it + previous;\n        previous = pair_temp_transition.first;\n      }\n      ++main_it;\n      Transition temp_test;\n      if (!dict_old.SingleDecode(pair_temp_transition.first, &temp_test)) {\n        FSTERROR() << \"Compressor::Decode: failed\";\n        fst->DeleteStates();\n        fst->SetProperties(kError, kError);\n        return;\n      }\n      pair_temp_transition.second = temp_test;\n      actual_old_dict_numbers.push_back(pair_temp_transition);\n    }\n\n    // Reordering the dictionary elements\n    std::sort(actual_old_dict_numbers.begin(), actual_old_dict_numbers.end(),\n              old_dict_compare);\n\n    // Transitions\n    previous = 0;\n    actual_old_dict_transitions.clear();\n\n    for (StateId new_integer = 0;\n         new_integer < current_number_old_elements - is_zero_removed;\n         ++new_integer) {\n      Transition temp_transition;\n      if (new_integer == 0) {\n        temp_transition.nextstate = *main_it;\n        previous = *main_it;\n      } else {\n        temp_transition.nextstate = *main_it + previous;\n        previous = temp_transition.nextstate;\n      }\n      ++main_it;\n      temp_transition.label = *main_it;\n      ++main_it;\n      actual_old_dict_transitions.push_back(temp_transition);\n    }\n\n    if (is_zero_removed == 1) {\n      actual_old_dict_transitions.push_back(default_transition);\n    }\n\n    auto trans_it = actual_old_dict_transitions.begin();\n    auto dict_it = actual_old_dict_numbers.begin();\n\n    while (trans_it != actual_old_dict_transitions.end() &&\n           dict_it != actual_old_dict_numbers.end()) {\n      if (dict_it->first == 0) {\n        ++dict_it;\n      } else {\n        std::pair<StateId, Transition> temp_pair;\n        if (transition_equals(*trans_it, default_transition) == 1) {\n          temp_pair.first = dict_it->first;\n          temp_pair.second = default_transition;\n          ++dict_it;\n        } else if (transition_less_than(dict_it->second, *trans_it) == 1) {\n          temp_pair.first = dict_it->first;\n          temp_pair.second = *trans_it;\n          ++dict_it;\n        } else {\n          temp_pair.first = 0;\n          temp_pair.second = *trans_it;\n        }\n        ++trans_it;\n        current_old_input.push_back(temp_pair);\n      }\n    }\n    while (trans_it != actual_old_dict_transitions.end()) {\n      std::pair<StateId, Transition> temp_pair;\n      temp_pair.first = 0;\n      temp_pair.second = *trans_it;\n      ++trans_it;\n      current_old_input.push_back(temp_pair);\n    }\n\n    // Adding old elements in the dictionary\n    if (!dict_old.BatchDecode(current_old_input, &current_old_output)) {\n      FSTERROR() << \"Compressor::Decode: Failed\";\n      fst->DeleteStates();\n      fst->SetProperties(kError, kError);\n      return;\n    }\n\n    for (auto it = current_old_output.begin(); it != current_old_output.end();\n         ++it) {\n      if (!unweighted) {\n        fst->AddArc(current_state,\n                    Arc(it->label, it->label, *arc_weight_it, it->nextstate));\n        ++arc_weight_it;\n      } else {\n        fst->AddArc(current_state,\n                    Arc(it->label, it->label, Weight::One(), it->nextstate));\n      }\n    }\n  }\n  // Adding the final states\n  StateId number_of_final_states = *main_it;\n  if (number_of_final_states > 0) {\n    ++main_it;\n    for (StateId temp_int = 0; temp_int < number_of_final_states; ++temp_int) {\n      if (!unweighted) {\n        fst->SetFinal(*main_it, final_weight_[temp_int]);\n      } else {\n        fst->SetFinal(*main_it, Weight(0));\n      }\n      ++main_it;\n    }\n  }\n}\n\ntemplate <class Arc>\nvoid Compressor<Arc>::ReadWeight(std::istream &strm,\n                                 std::vector<Weight> *output) {\n  int64_t size;\n  Weight weight;\n  ReadType(strm, &size);\n  for (int64_t i = 0; i < size; ++i) {\n    weight.Read(strm);\n    output->push_back(weight);\n  }\n}\n\ntemplate <class Arc>\nbool Compressor<Arc>::Decompress(std::istream &strm, const string &source,\n                                 MutableFst<Arc> *fst) {\n  fst->DeleteStates();\n  int32_t magic_number = 0;\n  ReadType(strm, &magic_number);\n  if (magic_number != kCompressMagicNumber) {\n    LOG(ERROR) << \"Decompress: Bad compressed Fst: \" << source;\n    // If the most significant two bytes of the magic number match the\n    // gzip magic number, then we are probably reading a gzip file as an\n    // ordinary stream.\n    if ((magic_number & kGzipMask) == kGzipMagicNumber) {\n      LOG(ERROR) << \"Decompress: Fst appears to be compressed with Gzip, but \"\n                    \"gzip decompression was not requested. Try with \"\n                    \"the --gzip flag\"\n                    \".\";\n    }\n    return false;\n  }\n  std::unique_ptr<EncodeMapper<Arc>> encoder(\n      EncodeMapper<Arc>::Read(strm, \"Decoding\", DECODE));\n  std::vector<bool> bool_code;\n  uint8_t block;\n  uint8_t msb = 128;\n  int64_t data_size;\n  ReadType(strm, &data_size);\n  for (int64_t i = 0; i < data_size; ++i) {\n    ReadType(strm, &block);\n    for (int j = 0; j < 8; ++j) {\n      uint8_t temp = msb & block;\n      if (temp == 128)\n        bool_code.push_back(1);\n      else\n        bool_code.push_back(0);\n      block = block << 1;\n    }\n  }\n  std::vector<StateId> int_code;\n  Elias<StateId>::BatchDecode(bool_code, &int_code);\n  bool_code.clear();\n  uint8_t unweighted;\n  ReadType(strm, &unweighted);\n  if (unweighted == 0) {\n    ReadWeight(strm, &arc_weight_);\n    ReadWeight(strm, &final_weight_);\n  }\n  DecodeProcessedFst(int_code, fst, unweighted);\n  DecodeForCompress(fst, *encoder);\n  return !fst->Properties(kError, false);\n}\n\ntemplate <class Arc>\nvoid Compressor<Arc>::WriteWeight(const std::vector<Weight> &input,\n                                  std::ostream &strm) {\n  int64_t size = input.size();\n  WriteType(strm, size);\n  for (typename std::vector<Weight>::const_iterator it = input.begin();\n       it != input.end(); ++it) {\n    it->Write(strm);\n  }\n}\n\ntemplate <class Arc>\nvoid Compressor<Arc>::WriteToStream(std::ostream &strm) {\n  while (buffer_code_.size() % 8 != 0) buffer_code_.push_back(1);\n  int64_t data_size = buffer_code_.size() / 8;\n  WriteType(strm, data_size);\n  std::vector<bool>::const_iterator it;\n  int64_t i;\n  uint8_t block;\n  for (it = buffer_code_.begin(), i = 0; it != buffer_code_.end(); ++it, ++i) {\n    if (i % 8 == 0) {\n      if (i > 0) WriteType(strm, block);\n      block = 0;\n    } else {\n      block = block << 1;\n    }\n    block |= *it;\n  }\n  WriteType(strm, block);\n}\n\ntemplate <class Arc>\nbool Compressor<Arc>::Compress(const Fst<Arc> &fst, std::ostream &strm) {\n  VectorFst<Arc> processedfst;\n  EncodeMapper<Arc> encoder(kEncodeLabels, ENCODE);\n  Preprocess(fst, &processedfst, &encoder);\n  WriteType(strm, kCompressMagicNumber);\n  encoder.Write(strm, \"encoder stream\");\n  EncodeProcessedFst(processedfst, strm);\n  return true;\n}\n\n// Convenience functions that call the compressor and decompressor.\n\ntemplate <class Arc>\nvoid Compress(const Fst<Arc> &fst, std::ostream &strm) {\n  Compressor<Arc> comp;\n  comp.Compress(fst, strm);\n}\n\n// Returns true on success.\ntemplate <class Arc>\nbool Compress(const Fst<Arc> &fst, const string &file_name,\n              const bool gzip = false) {\n  if (gzip) {\n    if (file_name.empty()) {\n      std::stringstream strm;\n      Compress(fst, strm);\n      OGzFile gzfile(fileno(stdout));\n      gzfile.write(strm);\n      if (!gzfile) {\n        LOG(ERROR) << \"Compress: Can't write to file: stdout\";\n        return false;\n      }\n    } else {\n      std::stringstream strm;\n      Compress(fst, strm);\n      OGzFile gzfile(file_name);\n      if (!gzfile) {\n        LOG(ERROR) << \"Compress: Can't open file: \" << file_name;\n        return false;\n      }\n      gzfile.write(strm);\n      if (!gzfile) {\n        LOG(ERROR) << \"Compress: Can't write to file: \" << file_name;\n        return false;\n      }\n    }\n  } else if (file_name.empty()) {\n    Compress(fst, std::cout);\n  } else {\n    std::ofstream strm(file_name,\n                             std::ios_base::out | std::ios_base::binary);\n    if (!strm) {\n      LOG(ERROR) << \"Compress: Can't open file: \" << file_name;\n      return false;\n    }\n    Compress(fst, strm);\n  }\n  return true;\n}\n\ntemplate <class Arc>\nvoid Decompress(std::istream &strm, const string &source,\n                MutableFst<Arc> *fst) {\n  Compressor<Arc> comp;\n  comp.Decompress(strm, source, fst);\n}\n\n// Returns true on success.\ntemplate <class Arc>\nbool Decompress(const string &file_name, MutableFst<Arc> *fst,\n                const bool gzip = false) {\n  if (gzip) {\n    if (file_name.empty()) {\n      IGzFile gzfile(fileno(stdin));\n      Decompress(*gzfile.read(), \"stdin\", fst);\n      if (!gzfile) {\n        LOG(ERROR) << \"Decompress: Can't read from file: stdin\";\n        return false;\n      }\n    } else {\n      IGzFile gzfile(file_name);\n      if (!gzfile) {\n        LOG(ERROR) << \"Decompress: Can't open file: \" << file_name;\n        return false;\n      }\n      Decompress(*gzfile.read(), file_name, fst);\n      if (!gzfile) {\n        LOG(ERROR) << \"Decompress: Can't read from file: \" << file_name;\n        return false;\n      }\n    }\n  } else if (file_name.empty()) {\n    Decompress(std::cin, \"stdin\", fst);\n  } else {\n    std::ifstream strm(file_name,\n                            std::ios_base::in | std::ios_base::binary);\n    if (!strm) {\n      LOG(ERROR) << \"Decompress: Can't open file: \" << file_name;\n      return false;\n    }\n    Decompress(strm, file_name, fst);\n  }\n  return true;\n}\n\n}  // namespace fst\n\n#endif  // FST_EXTENSIONS_COMPRESS_COMPRESS_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/extensions/compress/elias.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Compresses and decompresses unweighted FSTs.\n\n#ifndef FST_EXTENSIONS_COMPRESS_ELIAS_H_\n#define FST_EXTENSIONS_COMPRESS_ELIAS_H_\n\n#include <stack>\n#include <vector>\n\n#include <fst/compat.h>\nnamespace fst {\n\ntemplate <class Var>\nclass Elias {\n public:\n  // Gamma encoding is a subroutine for Delta encoding\n  static void GammaEncode(const Var &input, std::vector<bool> *code);\n\n  // Elias Delta encoding for a single integer\n  static void DeltaEncode(const Var &input, std::vector<bool> *code);\n\n  // Batch decoding of a set of integers\n  static void BatchDecode(const std::vector<bool> &input,\n                          std::vector<Var> *output);\n};\n\ntemplate <class Var>\nvoid Elias<Var>::GammaEncode(const Var &input, std::vector<bool> *code) {\n  Var input_copy = input;\n  std::stack<bool> reverse_code;\n  while (input_copy > 0) {\n    reverse_code.push(input_copy % 2);\n    input_copy = input_copy / 2;\n  }\n  for (Var auxvar = 0; auxvar < reverse_code.size() - 1; auxvar++)\n    code->push_back(0);\n  while (reverse_code.empty() != 1) {\n    code->push_back(reverse_code.top());\n    reverse_code.pop();\n  }\n}\ntemplate <class Var>\nvoid Elias<Var>::DeltaEncode(const Var &input, std::vector<bool> *code) {\n  Var input_copy = input + 1;\n  std::stack<bool> reverse_remainder;\n  Var auxvar = 0;\n  while (input_copy != 0) {\n    reverse_remainder.push(input_copy % 2);\n    input_copy = input_copy / 2;\n    auxvar = auxvar + 1;\n  }\n  GammaEncode(auxvar, code);\n  reverse_remainder.pop();\n  while (reverse_remainder.empty() != 1) {\n    code->push_back(reverse_remainder.top());\n    reverse_remainder.pop();\n  }\n}\n\ntemplate <class Var>\nvoid Elias<Var>::BatchDecode(const std::vector<bool> &input,\n                             std::vector<Var> *output) {\n  Var lead_zeros = 0;\n  Var remainder_bits = 0;\n  Var current_word = 1;\n  Var value = 1;\n  std::vector<bool>::const_iterator it = input.begin();\n  while (it != input.end()) {\n    lead_zeros = 0;\n    remainder_bits = 0;\n    current_word = 1;\n    value = 1;\n    while (*it != 1) {\n      it++;\n      lead_zeros++;\n    }\n    it++;\n    while (lead_zeros > 0) {\n      lead_zeros--;\n      current_word = 2 * current_word + *it;\n      it++;\n    }\n    current_word--;\n    while (current_word > 0) {\n      value = 2 * value + *it;\n      current_word--;\n      it++;\n    }\n    output->push_back(value - 1);\n  }\n}\n\n}  // namespace fst\n\n#endif  // FST_EXTENSIONS_COMPRESS_ELIAS_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/extensions/compress/gzfile.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Resource handles for gzip files written to or read from stringstreams. These\n// are necessary to provide the compression routines with streams reading from\n// or writing to compressed files (or the UNIX standard streams), and are not\n// intended for general use.\n\n#ifndef FST_EXTENSIONS_COMPRESS_GZFILE_H_\n#define FST_EXTENSIONS_COMPRESS_GZFILE_H_\n\n#include <cstddef>\n#include <memory>\n#include <sstream>\n#include <string>\n\n#include <fst/compat.h>\n#include <fst/log.h>\n#include <fst/fst.h>\n#include <zlib.h>\n\nusing std::stringstream;\nusing std::unique_ptr;\n\nnamespace fst {\n\n// Gives the zlib gzFile type an OO-like interface. String inputs are all\n// C-style strings. The caller is responsible to get the file modes appropriate\n// for the IO methods being called, and for opening the file descriptors\n// if that constructor is used. The ! operator can be used to check for errors\n// after construction or read/writing.\nclass GzFile {\n public:\n  GzFile(const char *filename, const char *mode)\n      : gzfile_(gzopen(filename, mode)), error_(check_handle()) {\n  }\n\n  // The caller is responsible to ensure the corresponding FD is open and has\n  // the needed modes (\"r\" for reading, \"w\" or \"a\" for writing).\n  explicit GzFile(const int fd, const char *mode)\n      : gzfile_(gzdopen(fd, mode)), error_(check_handle()), close_me_(false) {\n  }\n\n  // If the instance was constructed from an FD, flush the buffer; otherwise,\n  // close the file, which flushes the buffer as a side-effect.\n  ~GzFile() { close_me_ ? gzclose(gzfile_) : gzflush(gzfile_, Z_FINISH); }\n\n  inline bool operator!() const { return error_; }\n\n  // Returns false on EOF and sets error if short read does not reach an EOF.\n  int read(void *buf, unsigned int size) {\n    int bytes_read = gzread(gzfile_, buf, size);\n    if ((bytes_read < size) && !gzeof(gzfile_)) error_ = true;\n    return bytes_read;\n  }\n\n  // Sets error on short writes.\n  void write(const char *buf, unsigned int size) {\n    if (gzwrite(gzfile_, buf, size) != size) error_ = true;\n  }\n\n private:\n  // gzopen and gzdopen signal failure by returning null.\n  bool check_handle() { return gzfile_ == nullptr; }\n\n  gzFile gzfile_ = nullptr;\n  bool error_ = false;\n  bool close_me_ = false;\n};\n\n// Resource handle for writing stringstream to GzFile.\nclass OGzFile {\n public:\n  explicit OGzFile(const string &filename) : OGzFile(filename.c_str()) {}\n\n  explicit OGzFile(const char *filename) : gz_(GzFile(filename, mode_)) {}\n\n  explicit OGzFile(const int fd) : gz_(GzFile(fd, mode_)) {}\n\n  inline bool operator!() const { return !gz_; }\n\n  void write(const std::stringstream &ssbuf) {\n    string sbuf = ssbuf.str();\n    gz_.write(sbuf.data(), sbuf.size());\n  }\n\n private:\n  GzFile gz_;\n  static constexpr auto &mode_ = \"wb\";\n};\n\n// Resource handle for reading stringstream from GzFile.\nclass IGzFile {\n public:\n  explicit IGzFile(const string &filename) : IGzFile(filename.c_str()) {}\n\n  explicit IGzFile(const char *filename) : gz_(GzFile(filename, mode_)) {}\n\n  explicit IGzFile(const int fd) : gz_(GzFile(fd, mode_)) {}\n\n  inline bool operator!() const { return !gz_; }\n\n  // This is a great case for \"move\", but GCC 4 is missing the C+11 standard\n  // move constructor for stringstream, so a unique_ptr is the next best thing.\n  std::unique_ptr<std::stringstream> read() {\n    char buf[bufsize_];\n    std::unique_ptr<std::stringstream> sstrm(new std::stringstream);\n    // We always read at least once, and the result of the last read is always\n    // pushed onto the stringstream. We use the \"write\" member because << onto\n    // a stringstream stops at the null byte, which might be data!\n    int bytes_read;\n    while ((bytes_read = gz_.read(buf, bufsize_)) == bufsize_)\n      sstrm->write(buf, bufsize_);\n    sstrm->write(buf, bytes_read);\n    return sstrm;\n  }\n\n private:\n  GzFile gz_;\n  static constexpr auto &mode_ = \"rb\";\n  // This is the same size as the default internal buffer for zlib.\n  static const size_t bufsize_ = 8192;\n};\n\n}  // namespace fst\n\n#endif  // FST_EXTENSIONS_COMPRESS_GZFILE_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/extensions/compress/randmod.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Generates a random FST according to a class-specific transition model.\n\n#ifndef FST_EXTENSIONS_COMPRESS_RANDMOD_H_\n#define FST_EXTENSIONS_COMPRESS_RANDMOD_H_\n\n#include <cstdlib>\n#include <vector>\n\n#include <fst/compat.h>\n#include <fst/mutable-fst.h>\n\nnamespace fst {\n\ntemplate <class Arc, class G>\nclass RandMod {\n public:\n  typedef typename Arc::StateId StateId;\n  typedef typename Arc::Label Label;\n  typedef typename Arc::Weight Weight;\n\n  // Generates random FST with 'nstates' with 'nclasses' in the probability\n  // generation model, and 'nlabels' in the alphabet. If 'trans' = true, then\n  // a transducer is generated; iff 'generate_' is non-null, the output is\n  // randomly weighted.\n  RandMod(StateId nstates, StateId nclasses, Label nlabels, bool trans,\n          const G *generate)\n      : nstates_(nstates),\n        nclasses_(nclasses),\n        nlabels_(nlabels),\n        trans_(trans),\n        generate_(generate) {\n    for (StateId s = 0; s < nstates; ++s) {\n      classes_.push_back(rand() % nclasses);  // NOLINT\n    }\n  }\n\n  // Generates a random FST according to a class-specific transition model\n  void Generate(StdMutableFst *fst) {\n    StateId start = rand() % nstates_;  // NOLINT\n    fst->DeleteStates();\n    for (StateId s = 0; s < nstates_; ++s) {\n      fst->AddState();\n      if (s == start) fst->SetStart(start);\n      for (StateId n = 0; n <= nstates_; ++n) {\n        Arc arc;\n        StateId d = n == nstates_ ? kNoStateId : n;\n        if (!RandArc(s, d, &arc)) continue;\n        if (d == kNoStateId) {  // A super-final transition?\n          fst->SetFinal(s, arc.weight);\n        } else {\n          fst->AddArc(s, arc);\n        }\n      }\n    }\n  }\n\n private:\n  // Generates a transition from s to d. If d == kNoStateId, a superfinal\n  // transition is generated. Returns false if no transition generated.\n  bool RandArc(StateId s, StateId d, Arc *arc) {\n    StateId sclass = classes_[s];\n    StateId dclass = d != kNoStateId ? classes_[d] : 0;\n\n    int r = sclass + dclass + 2;\n    if ((rand() % r) != 0)  // NOLINT\n      return false;\n\n    arc->nextstate = d;\n\n    Label ilabel = kNoLabel;\n    Label olabel = kNoLabel;\n    if (d != kNoStateId) {\n      ilabel = (dclass % nlabels_) + 1;\n      if (trans_)\n        olabel = (sclass % nlabels_) + 1;\n      else\n        olabel = ilabel;\n    }\n\n    Weight weight = Weight::One();\n    if (generate_) weight = (*generate_)();\n\n    arc->ilabel = ilabel;\n    arc->olabel = olabel;\n    arc->weight = weight;\n    return true;\n  }\n\n  StateId nstates_;\n  StateId nclasses_;\n  Label nlabels_;\n  bool trans_;\n  const G *generate_;\n  std::vector<StateId> classes_;\n};\n\n}  // namespace fst\n\n#endif  // FST_EXTENSIONS_COMPRESS_RANDMOD_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/extensions/far/compile-strings.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#ifndef FST_EXTENSIONS_FAR_COMPILE_STRINGS_H_\n#define FST_EXTENSIONS_FAR_COMPILE_STRINGS_H_\n\n#ifndef _MSC_VER\n#include <libgen.h>\n#else\n#include <fst/compat.h>\n#endif\n\n#include <fstream>\n#include <istream>\n#include <string>\n#include <vector>\n\n#include <fst/extensions/far/far.h>\n#include <fstream>\n#include <fst/string.h>\n\nnamespace fst {\n\n// Constructs a reader that provides FSTs from a file (stream) either on a\n// line-by-line basis or on a per-stream basis. Note that the freshly\n// constructed reader is already set to the first input.\n//\n// Sample usage:\n//\n//   for (StringReader<Arc> reader(...); !reader.Done(); reader.Next()) {\n//     auto *fst = reader.GetVectorFst();\n//   }\ntemplate <class Arc>\nclass StringReader {\n public:\n  using Label = typename Arc::Label;\n  using Weight = typename Arc::Weight;\n\n  enum EntryType { LINE = 1, FILE = 2 };\n\n  StringReader(std::istream &istrm, const string &source, EntryType entry_type,\n               StringTokenType token_type, bool allow_negative_labels,\n               const SymbolTable *syms = nullptr,\n               Label unknown_label = kNoStateId)\n      : nline_(0),\n        istrm_(istrm),\n        source_(source),\n        entry_type_(entry_type),\n        token_type_(token_type),\n        symbols_(syms),\n        done_(false),\n        compiler_(token_type, syms, unknown_label, allow_negative_labels) {\n    Next();  // Initialize the reader to the first input.\n  }\n\n  bool Done() { return done_; }\n\n  void Next() {\n    VLOG(1) << \"Processing source \" << source_ << \" at line \" << nline_;\n    if (!istrm_) {  // We're done if we have no more input.\n      done_ = true;\n      return;\n    }\n    if (entry_type_ == LINE) {\n      getline(istrm_, content_);\n      ++nline_;\n    } else {\n      content_.clear();\n      string line;\n      while (getline(istrm_, line)) {\n        ++nline_;\n        content_.append(line);\n        content_.append(\"\\n\");\n      }\n    }\n    if (!istrm_ && content_.empty())  // We're also done if we read off all the\n      done_ = true;                   // whitespace at the end of a file.\n  }\n\n  VectorFst<Arc> *GetVectorFst(bool keep_symbols = false) {\n    std::unique_ptr<VectorFst<Arc>> fst(new VectorFst<Arc>());\n    if (keep_symbols) {\n      fst->SetInputSymbols(symbols_);\n      fst->SetOutputSymbols(symbols_);\n    }\n    if (compiler_(content_, fst.get())) {\n      return fst.release();\n    } else {\n      return nullptr;\n    }\n  }\n\n  CompactStringFst<Arc> *GetCompactFst(bool keep_symbols = false) {\n    std::unique_ptr<CompactStringFst<Arc>> fst;\n    if (keep_symbols) {\n      VectorFst<Arc> tmp;\n      tmp.SetInputSymbols(symbols_);\n      tmp.SetOutputSymbols(symbols_);\n      fst.reset(new CompactStringFst<Arc>(tmp));\n    } else {\n      fst.reset(new CompactStringFst<Arc>());\n    }\n    if (compiler_(content_, fst.get())) {\n      return fst.release();\n    } else {\n      return nullptr;\n    }\n  }\n\n private:\n  size_t nline_;\n  std::istream &istrm_;\n  string source_;\n  EntryType entry_type_;\n  StringTokenType token_type_;\n  const SymbolTable *symbols_;\n  bool done_;\n  StringCompiler<Arc> compiler_;\n  string content_;  // The actual content of the input stream's next FST.\n\n  StringReader(const StringReader &) = delete;\n  StringReader &operator=(const StringReader &) = delete;\n};\n\n// Computes the minimal length required to encode each line number as a decimal\n// number.\nint KeySize(const char *filename);\n\ntemplate <class Arc>\nvoid FarCompileStrings(const std::vector<string> &in_fnames,\n                       const string &out_fname, const string &fst_type,\n                       const FarType &far_type, int32_t generate_keys,\n                       FarEntryType fet, FarTokenType tt,\n                       const string &symbols_fname,\n                       const string &unknown_symbol, bool keep_symbols,\n                       bool initial_symbols, bool allow_negative_labels,\n                       const string &key_prefix, const string &key_suffix) {\n  typename StringReader<Arc>::EntryType entry_type;\n  if (fet == FET_LINE) {\n    entry_type = StringReader<Arc>::LINE;\n  } else if (fet == FET_FILE) {\n    entry_type = StringReader<Arc>::FILE;\n  } else {\n    FSTERROR() << \"FarCompileStrings: Unknown entry type\";\n    return;\n  }\n  StringTokenType token_type;\n  if (tt == FTT_SYMBOL) {\n    token_type = StringTokenType::SYMBOL;\n  } else if (tt == FTT_BYTE) {\n    token_type = StringTokenType::BYTE;\n  } else if (tt == FTT_UTF8) {\n    token_type = StringTokenType::UTF8;\n  } else {\n    FSTERROR() << \"FarCompileStrings: Unknown token type\";\n    return;\n  }\n  bool compact;\n  if (fst_type.empty() || (fst_type == \"vector\")) {\n    compact = false;\n  } else if (fst_type == \"compact\") {\n    compact = true;\n  } else {\n    FSTERROR() << \"FarCompileStrings: Unknown FST type: \" << fst_type;\n    return;\n  }\n  std::unique_ptr<const SymbolTable> syms;\n  typename Arc::Label unknown_label = kNoLabel;\n  if (!symbols_fname.empty()) {\n    const SymbolTableTextOptions opts(allow_negative_labels);\n    syms.reset(SymbolTable::ReadText(symbols_fname, opts));\n    if (!syms) {\n      LOG(ERROR) << \"FarCompileStrings: Error reading symbol table: \"\n                 << symbols_fname;\n      return;\n    }\n    if (!unknown_symbol.empty()) {\n      unknown_label = syms->Find(unknown_symbol);\n      if (unknown_label == kNoLabel) {\n        FSTERROR() << \"FarCompileStrings: Label \\\"\" << unknown_label\n                   << \"\\\" missing from symbol table: \" << symbols_fname;\n        return;\n      }\n    }\n  }\n  std::unique_ptr<FarWriter<Arc>> far_writer(\n      FarWriter<Arc>::Create(out_fname, far_type));\n  if (!far_writer) return;\n  int n = 0;\n  for (const auto &in_fname : in_fnames) {\n    if (generate_keys == 0 && in_fname.empty()) {\n      FSTERROR() << \"FarCompileStrings: Read from a file instead of stdin or\"\n                 << \" set the --generate_keys flags.\";\n      return;\n    }\n    int key_size =\n        generate_keys ? generate_keys : (entry_type == StringReader<Arc>::FILE\n                                             ? 1 : KeySize(in_fname.c_str()));\n    std::ifstream fstrm;\n    if (!in_fname.empty()) {\n      fstrm.open(in_fname);\n      if (!fstrm) {\n        FSTERROR() << \"FarCompileStrings: Can't open file: \" << in_fname;\n        return;\n      }\n    }\n    std::istream &istrm = fstrm.is_open() ? fstrm : std::cin;\n    bool keep_syms = keep_symbols;\n    for (StringReader<Arc> reader(\n             istrm, in_fname.empty() ? \"stdin\" : in_fname, entry_type,\n             token_type, allow_negative_labels, syms.get(), unknown_label);\n         !reader.Done(); reader.Next()) {\n      ++n;\n      std::unique_ptr<const Fst<Arc>> fst;\n      if (compact) {\n        fst.reset(reader.GetCompactFst(keep_syms));\n      } else {\n        fst.reset(reader.GetVectorFst(keep_syms));\n      }\n      if (initial_symbols) keep_syms = false;\n      if (!fst) {\n        FSTERROR() << \"FarCompileStrings: Compiling string number \" << n\n                   << \" in file \" << in_fname << \" failed with token_type = \"\n                   << (tt == FTT_BYTE\n                           ? \"byte\"\n                           : (tt == FTT_UTF8\n                                  ? \"utf8\"\n                                  : (tt == FTT_SYMBOL ? \"symbol\" : \"unknown\")))\n                   << \" and entry_type = \"\n                   << (fet == FET_LINE\n                           ? \"line\"\n                           : (fet == FET_FILE ? \"file\" : \"unknown\"));\n        return;\n      }\n      std::ostringstream keybuf;\n      keybuf.width(key_size);\n      keybuf.fill('0');\n      keybuf << n;\n      string key;\n      if (generate_keys > 0) {\n        key = keybuf.str();\n      } else {\n        auto *filename = new char[in_fname.size() + 1];\n        strcpy(filename, in_fname.c_str());\n        key = basename(filename);\n        if (entry_type != StringReader<Arc>::FILE) {\n          key += \"-\";\n          key += keybuf.str();\n        }\n        delete[] filename;\n      }\n      far_writer->Add(key_prefix + key + key_suffix, *fst);\n    }\n    if (generate_keys == 0) n = 0;\n  }\n}\n\n}  // namespace fst\n\n#endif  // FST_EXTENSIONS_FAR_COMPILE_STRINGS_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/extensions/far/create.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Creates a finite-state archive from component FSTs.\n\n#ifndef FST_EXTENSIONS_FAR_CREATE_H_\n#define FST_EXTENSIONS_FAR_CREATE_H_\n\n#include <sstream>\n#include <string>\n#include <vector>\n\n#include <fst/extensions/far/far.h>\n\nnamespace fst {\n\ntemplate <class Arc>\nvoid FarCreate(const std::vector<string> &in_fnames, const string &out_fname,\n               const int32_t generate_keys, const FarType &far_type,\n               const string &key_prefix, const string &key_suffix) {\n  std::unique_ptr<FarWriter<Arc>> far_writer(\n      FarWriter<Arc>::Create(out_fname, far_type));\n  if (!far_writer) return;\n  for (size_t i = 0; i < in_fnames.size(); ++i) {\n    std::unique_ptr<Fst<Arc>> ifst(Fst<Arc>::Read(in_fnames[i]));\n    if (!ifst) return;\n    string key;\n    if (generate_keys > 0) {\n      std::ostringstream keybuf;\n      keybuf.width(generate_keys);\n      keybuf.fill('0');\n      keybuf << i + 1;\n      key = keybuf.str();\n    } else {\n      auto *filename = new char[in_fnames[i].size() + 1];\n      strcpy(filename, in_fnames[i].c_str());\n      key = basename(filename);\n      delete[] filename;\n    }\n    far_writer->Add(key_prefix + key + key_suffix, *ifst);\n  }\n}\n\n}  // namespace fst\n\n#endif  // FST_EXTENSIONS_FAR_CREATE_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/extensions/far/equal.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#ifndef FST_EXTENSIONS_FAR_EQUAL_H_\n#define FST_EXTENSIONS_FAR_EQUAL_H_\n\n#include <memory>\n#include <string>\n\n#include <fst/extensions/far/far.h>\n#include <fst/equal.h>\n\nnamespace fst {\n\ntemplate <class Arc>\nbool FarEqual(const string &filename1, const string &filename2,\n              float delta = kDelta, const string &begin_key = string(),\n              const string &end_key = string()) {\n  std::unique_ptr<FarReader<Arc>> reader1(FarReader<Arc>::Open(filename1));\n  if (!reader1) {\n    LOG(ERROR) << \"FarEqual: Could not open FAR file \" << filename1;\n    return false;\n  }\n  std::unique_ptr<FarReader<Arc>> reader2(FarReader<Arc>::Open(filename2));\n  if (!reader2) {\n    LOG(ERROR) << \"FarEqual: Could not open FAR file \" << filename2;\n    return false;\n  }\n  if (!begin_key.empty()) {\n    bool find_begin1 = reader1->Find(begin_key);\n    bool find_begin2 = reader2->Find(begin_key);\n    if (!find_begin1 || !find_begin2) {\n      bool ret = !find_begin1 && !find_begin2;\n      if (!ret) {\n        LOG(ERROR) << \"FarEqual: Key \" << begin_key << \" missing from \"\n                   << (find_begin1 ? \"second\" : \"first\") << \" archive\";\n      }\n      return ret;\n    }\n  }\n  for (; !reader1->Done() && !reader2->Done();\n       reader1->Next(), reader2->Next()) {\n    const auto &key1 = reader1->GetKey();\n    const auto &key2 = reader2->GetKey();\n    if (!end_key.empty() && end_key < key1 && end_key < key2) {\n      return true;\n    }\n    if (key1 != key2) {\n      LOG(ERROR) << \"FarEqual: Mismatched keys \" << key1 << \" and \" << key2;\n      return false;\n    }\n    if (!Equal(*(reader1->GetFst()), *(reader2->GetFst()), delta)) {\n      LOG(ERROR) << \"FarEqual: FSTs for key \" << key1 << \" are not equal\";\n      return false;\n    }\n  }\n  if (!reader1->Done() || !reader2->Done()) {\n    LOG(ERROR) << \"FarEqual: Key \"\n               << (reader1->Done() ? reader2->GetKey() : reader1->GetKey())\n               << \" missing from \" << (reader2->Done() ? \"first\" : \"second\")\n               << \" archive\";\n    return false;\n  }\n  return true;\n}\n\n}  // namespace fst\n\n#endif  // FST_EXTENSIONS_FAR_EQUAL_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/extensions/far/extract.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Extracts component FSTs from an finite-state archive.\n\n#ifndef FST_EXTENSIONS_FAR_EXTRACT_H_\n#define FST_EXTENSIONS_FAR_EXTRACT_H_\n\n#include <memory>\n#include <string>\n#include <vector>\n\n#include <fst/extensions/far/far.h>\n#include <fst/util.h>\n\nnamespace fst {\n\ntemplate <class Arc>\ninline void FarWriteFst(const Fst<Arc> *fst, string key, string *okey,\n                        int *nrep, int32_t generate_filenames, int i,\n                        const string &filename_prefix,\n                        const string &filename_suffix) {\n  if (key == *okey) {\n    ++*nrep;\n  } else {\n    *nrep = 0;\n  }\n  *okey = key;\n  string ofilename;\n  if (generate_filenames) {\n    std::ostringstream tmp;\n    tmp.width(generate_filenames);\n    tmp.fill('0');\n    tmp << i;\n    ofilename = tmp.str();\n  } else {\n    if (*nrep > 0) {\n      std::ostringstream tmp;\n      tmp << '.' << nrep;\n      key.append(tmp.str().data(), tmp.str().size());\n    }\n    ofilename = key;\n  }\n  fst->Write(filename_prefix + ofilename + filename_suffix);\n}\n\ntemplate <class Arc>\nvoid FarExtract(const std::vector<string> &ifilenames, int32_t generate_filenames,\n                const string &keys, const string &key_separator,\n                const string &range_delimiter, const string &filename_prefix,\n                const string &filename_suffix) {\n  std::unique_ptr<FarReader<Arc>> far_reader(\n      FarReader<Arc>::Open(ifilenames));\n  if (!far_reader) return;\n  string okey;\n  int nrep = 0;\n  std::vector<char *> key_vector;\n  // User has specified a set of FSTs to extract, where some of these may in\n  // fact be ranges.\n  if (!keys.empty()) {\n    auto *keys_cstr = new char[keys.size() + 1];\n    strcpy(keys_cstr, keys.c_str());\n    SplitString(keys_cstr, key_separator.c_str(), &key_vector, true);\n    int i = 0;\n    for (size_t k = 0; k < key_vector.size(); ++k, ++i) {\n      string key = key_vector[k];\n      auto *key_cstr = new char[key.size() + 1];\n      strcpy(key_cstr, key.c_str());\n      std::vector<char *> range_vector;\n      SplitString(key_cstr, range_delimiter.c_str(), &range_vector, false);\n      if (range_vector.size() == 1) {  // Not a range\n        if (!far_reader->Find(key)) {\n          LOG(ERROR) << \"FarExtract: Cannot find key \" << key;\n          return;\n        }\n        const auto *fst = far_reader->GetFst();\n        FarWriteFst(fst, key, &okey, &nrep, generate_filenames, i,\n                    filename_prefix, filename_suffix);\n      } else if (range_vector.size() == 2) {  // A legal range\n        string begin_key = range_vector[0];\n        string end_key = range_vector[1];\n        if (begin_key.empty() || end_key.empty()) {\n          LOG(ERROR) << \"FarExtract: Illegal range specification \" << key;\n          return;\n        }\n        if (!far_reader->Find(begin_key)) {\n          LOG(ERROR) << \"FarExtract: Cannot find key \" << begin_key;\n          return;\n        }\n        for (; !far_reader->Done(); far_reader->Next(), ++i) {\n          const auto &ikey = far_reader->GetKey();\n          if (end_key < ikey) break;\n          const auto *fst = far_reader->GetFst();\n          FarWriteFst(fst, ikey, &okey, &nrep, generate_filenames, i,\n                      filename_prefix, filename_suffix);\n        }\n      } else {\n        LOG(ERROR) << \"FarExtract: Illegal range specification \" << key;\n        return;\n      }\n      delete[] key_cstr;\n    }\n    delete[] keys_cstr;\n    return;\n  }\n  // Nothing specified, so just extracts everything.\n  for (size_t i = 1; !far_reader->Done(); far_reader->Next(), ++i) {\n    const auto &key = far_reader->GetKey();\n    const auto *fst = far_reader->GetFst();\n    FarWriteFst(fst, key, &okey, &nrep, generate_filenames, i, filename_prefix,\n                filename_suffix);\n  }\n  return;\n}\n\n}  // namespace fst\n\n#endif  // FST_EXTENSIONS_FAR_EXTRACT_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/extensions/far/far-class.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Scripting API support for FarReader and FarWriter.\n\n#ifndef FST_EXTENSIONS_FAR_FAR_CLASS_H_\n#define FST_EXTENSIONS_FAR_FAR_CLASS_H_\n\n#include <memory>\n#include <string>\n#include <vector>\n\n#include <fst/extensions/far/far.h>\n#include <fst/script/arg-packs.h>\n#include <fst/script/fstscript.h>\n\nnamespace fst {\nnamespace script {\n\n\n// FarReader API.\n\n// Virtual interface implemented by each concrete FarReaderImpl<A>.\n// See the FarReader interface in far.h for the exact semantics.\nclass FarReaderImplBase {\n public:\n  virtual const string &ArcType() const = 0;\n  virtual bool Done() const = 0;\n  virtual bool Error() const = 0;\n  virtual const string &GetKey() const = 0;\n  virtual const FstClass *GetFstClass() const = 0;\n  virtual bool Find(const string &key) = 0;\n  virtual void Next() = 0;\n  virtual void Reset() = 0;\n  virtual FarType Type() const = 0;\n  virtual ~FarReaderImplBase() {}\n};\n\n// Templated implementation.\ntemplate <class Arc>\nclass FarReaderClassImpl : public FarReaderImplBase {\n public:\n  explicit FarReaderClassImpl(const string &filename)\n      : impl_(FarReader<Arc>::Open(filename)) {}\n\n  explicit FarReaderClassImpl(const std::vector<string> &filenames)\n      : impl_(FarReader<Arc>::Open(filenames)) {}\n\n  const string &ArcType() const final { return Arc::Type(); }\n\n  bool Done() const final { return impl_->Done(); }\n\n  bool Error() const final { return impl_->Error(); }\n\n  bool Find(const string &key) final { return impl_->Find(key); }\n\n  const FstClass *GetFstClass() const final {\n    fstc_.reset(new FstClass(*impl_->GetFst()));\n    return fstc_.get();\n  }\n\n  const string &GetKey() const final { return impl_->GetKey(); }\n\n  void Next() final { return impl_->Next(); }\n\n  void Reset() final { impl_->Reset(); }\n\n  FarType Type() const final { return impl_->Type(); }\n\n  const FarReader<Arc> *GetImpl() const { return impl_.get(); }\n\n  FarReader<Arc> *GetImpl() { return impl_.get(); }\n\n private:\n  std::unique_ptr<FarReader<Arc>> impl_;\n  mutable std::unique_ptr<FstClass> fstc_;\n};\n\n\nclass FarReaderClass;\n\nusing OpenFarReaderClassArgs1 =\n    WithReturnValue<FarReaderClass *, const string &>;\n\nusing OpenFarReaderClassArgs2 =\n    WithReturnValue<FarReaderClass *, const std::vector<string> &>;\n\n// Untemplated user-facing class holding a templated pimpl.\nclass FarReaderClass {\n public:\n  const string &ArcType() const { return impl_->ArcType(); }\n\n  bool Done() const { return impl_->Done(); }\n\n  // Returns True if the impl is null (i.e., due to read failure).\n  // Attempting to call any other function will result in null dereference.\n  bool Error() const { return (impl_) ? impl_->Error() : true; }\n\n  bool Find(const string &key) { return impl_->Find(key); }\n\n  const FstClass *GetFstClass() const { return impl_->GetFstClass(); }\n\n  const string &GetKey() const { return impl_->GetKey(); }\n\n  void Next() { impl_->Next(); }\n\n  void Reset() { impl_->Reset(); }\n\n  FarType Type() const { return impl_->Type(); }\n\n  template <class Arc>\n  const FarReader<Arc> *GetFarReader() const {\n    if (Arc::Type() != ArcType()) return nullptr;\n    const FarReaderClassImpl<Arc> *typed_impl =\n        static_cast<FarReaderClassImpl<Arc> *>(impl_.get());\n    return typed_impl->GetImpl();\n  }\n\n  template <class Arc>\n  FarReader<Arc> *GetFarReader() {\n    if (Arc::Type() != ArcType()) return nullptr;\n    FarReaderClassImpl<Arc> *typed_impl =\n        static_cast<FarReaderClassImpl<Arc> *>(impl_.get());\n    return typed_impl->GetImpl();\n  }\n\n  template <class Arc>\n  friend void OpenFarReaderClass(OpenFarReaderClassArgs1 *args);\n\n  template <class Arc>\n  friend void OpenFarReaderClass(OpenFarReaderClassArgs2 *args);\n\n  // Defined in the CC.\n\n  static FarReaderClass *Open(const string &filename);\n\n  static FarReaderClass *Open(const std::vector<string> &filenames);\n\n private:\n  template <class Arc>\n  explicit FarReaderClass(FarReaderClassImpl<Arc> *impl) : impl_(impl) {}\n\n  std::unique_ptr<FarReaderImplBase> impl_;\n};\n\n// These exist solely for registration purposes; users should call the\n// static method FarReaderClass::Open instead.\n\ntemplate <class Arc>\nvoid OpenFarReaderClass(OpenFarReaderClassArgs1 *args) {\n  args->retval = new FarReaderClass(new FarReaderClassImpl<Arc>(args->args));\n}\n\ntemplate <class Arc>\nvoid OpenFarReaderClass(OpenFarReaderClassArgs2 *args) {\n  args->retval = new FarReaderClass(new FarReaderClassImpl<Arc>(args->args));\n}\n\n// FarWriter API.\n\n// Virtual interface implemented by each concrete FarWriterImpl<A>.\nclass FarWriterImplBase {\n public:\n  // Unlike the lower-level library, this returns a boolean to signal failure\n  // due to non-conformant arc types.\n  virtual bool Add(const string &key, const FstClass &fst) = 0;\n  virtual const string &ArcType() const = 0;\n  virtual bool Error() const = 0;\n  virtual FarType Type() const = 0;\n  virtual ~FarWriterImplBase() {}\n};\n\n\n// Templated implementation.\ntemplate <class Arc>\nclass FarWriterClassImpl : public FarWriterImplBase {\n public:\n  explicit FarWriterClassImpl(const string &filename,\n                              FarType type = FAR_DEFAULT)\n      : impl_(FarWriter<Arc>::Create(filename, type)) {}\n\n  bool Add(const string &key, const FstClass &fst) final {\n    if (ArcType() != fst.ArcType()) {\n      FSTERROR() << \"Cannot write FST with \" << fst.ArcType() << \" arcs to \"\n                 << \"FAR with \" << ArcType() << \" arcs\";\n      return false;\n    }\n    impl_->Add(key, *(fst.GetFst<Arc>()));\n    return true;\n  }\n\n  const string &ArcType() const final { return Arc::Type(); }\n\n  bool Error() const final { return impl_->Error(); }\n\n  FarType Type() const final { return impl_->Type(); }\n\n  const FarWriter<Arc> *GetImpl() const { return impl_.get(); }\n\n  FarWriter<Arc> *GetImpl() { return impl_.get(); }\n\n private:\n  std::unique_ptr<FarWriter<Arc>> impl_;\n};\n\n\nclass FarWriterClass;\n\nusing CreateFarWriterClassInnerArgs = std::pair<const string &, FarType>;\n\nusing CreateFarWriterClassArgs =\n    WithReturnValue<FarWriterClass *, CreateFarWriterClassInnerArgs>;\n\n// Untemplated user-facing class holding a templated pimpl.\nclass FarWriterClass {\n public:\n  static FarWriterClass *Create(const string &filename, const string &arc_type,\n                                FarType type = FAR_DEFAULT);\n\n  bool Add(const string &key, const FstClass &fst) {\n    return impl_->Add(key, fst);\n  }\n\n  // Returns True if the impl is null (i.e., due to construction failure).\n  // Attempting to call any other function will result in null dereference.\n  bool Error() const { return (impl_) ? impl_->Error() : true; }\n\n  const string &ArcType() const { return impl_->ArcType(); }\n\n  FarType Type() const { return impl_->Type(); }\n\n  template <class Arc>\n  const FarWriter<Arc> *GetFarWriter() const {\n    if (Arc::Type() != ArcType()) return nullptr;\n    const FarWriterClassImpl<Arc> *typed_impl =\n        static_cast<FarWriterClassImpl<Arc> *>(impl_.get());\n    return typed_impl->GetImpl();\n  }\n\n  template <class Arc>\n  FarWriter<Arc> *GetFarWriter() {\n    if (Arc::Type() != ArcType()) return nullptr;\n    FarWriterClassImpl<Arc> *typed_impl =\n        static_cast<FarWriterClassImpl<Arc> *>(impl_.get());\n    return typed_impl->GetImpl();\n  }\n\n  template <class Arc>\n  friend void CreateFarWriterClass(CreateFarWriterClassArgs *args);\n\n private:\n  template <class Arc>\n  explicit FarWriterClass(FarWriterClassImpl<Arc> *impl) : impl_(impl) {}\n\n  std::unique_ptr<FarWriterImplBase> impl_;\n};\n\n// This exists solely for registration purposes; users should call the\n// static method FarWriterClass::Create instead.\ntemplate <class Arc>\nvoid CreateFarWriterClass(CreateFarWriterClassArgs *args) {\n  args->retval = new FarWriterClass(new FarWriterClassImpl<Arc>(\n      std::get<0>(args->args), std::get<1>(args->args)));\n}\n\n}  // namespace script\n}  // namespace fst\n\n#endif  // FST_EXTENSIONS_FAR_FAR_CLASS_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/extensions/far/far.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Finite-State Transducer (FST) archive classes.\n\n#ifndef FST_EXTENSIONS_FAR_FAR_H_\n#define FST_EXTENSIONS_FAR_FAR_H_\n\n#include <iostream>\n#include <sstream>\n\n#include <fst/log.h>\n#include <fst/extensions/far/stlist.h>\n#include <fst/extensions/far/sttable.h>\n#include <fst/fst.h>\n#include <fst/vector-fst.h>\n#include <fstream>\n\nnamespace fst {\n\nenum FarEntryType { FET_LINE, FET_FILE };\n\nenum FarTokenType { FTT_SYMBOL, FTT_BYTE, FTT_UTF8 };\n\ninline bool IsFst(const string &filename) {\n  std::ifstream strm(filename, std::ios_base::in | std::ios_base::binary);\n  if (!strm) return false;\n  return IsFstHeader(strm, filename);\n}\n\n// FST archive header class\nclass FarHeader {\n public:\n  const string &ArcType() const { return arctype_; }\n\n  const string &FarType() const { return fartype_; }\n\n  bool Read(const string &filename) {\n    FstHeader fsthdr;\n    if (filename.empty()) {\n      // Header reading unsupported on stdin. Assumes STList and StdArc.\n      fartype_ = \"stlist\";\n      arctype_ = \"standard\";\n      return true;\n    } else if (IsSTTable(filename)) {  // Checks if STTable.\n      ReadSTTableHeader(filename, &fsthdr);\n      fartype_ = \"sttable\";\n      arctype_ = fsthdr.ArcType().empty() ? \"unknown\" : fsthdr.ArcType();\n      return true;\n    } else if (IsSTList(filename)) {  // Checks if STList.\n      ReadSTListHeader(filename, &fsthdr);\n      fartype_ = \"stlist\";\n      arctype_ = fsthdr.ArcType().empty() ? \"unknown\" : fsthdr.ArcType();\n      return true;\n    } else if (IsFst(filename)) {  // Checks if FST.\n      std::ifstream istrm(filename,\n                               std::ios_base::in | std::ios_base::binary);\n      fsthdr.Read(istrm, filename);\n      fartype_ = \"fst\";\n      arctype_ = fsthdr.ArcType().empty() ? \"unknown\" : fsthdr.ArcType();\n      return true;\n    }\n    return false;\n  }\n\n private:\n  string fartype_;\n  string arctype_;\n};\n\nenum FarType {\n  FAR_DEFAULT = 0,\n  FAR_STTABLE = 1,\n  FAR_STLIST = 2,\n  FAR_FST = 3,\n};\n\n// This class creates an archive of FSTs.\ntemplate <class A>\nclass FarWriter {\n public:\n  using Arc = A;\n\n  // Creates a new (empty) FST archive; returns null on error.\n  static FarWriter *Create(const string &filename, FarType type = FAR_DEFAULT);\n\n  // Adds an FST to the end of an archive. Keys must be non-empty and\n  // in lexicographic order. FSTs must have a suitable write method.\n  virtual void Add(const string &key, const Fst<Arc> &fst) = 0;\n\n  virtual FarType Type() const = 0;\n\n  virtual bool Error() const = 0;\n\n  virtual ~FarWriter() {}\n\n protected:\n  FarWriter() {}\n};\n\n// This class iterates through an existing archive of FSTs.\ntemplate <class A>\nclass FarReader {\n public:\n  using Arc = A;\n\n  // Opens an existing FST archive in a single file; returns null on error.\n  // Sets current position to the beginning of the achive.\n  static FarReader *Open(const string &filename);\n\n  // Opens an existing FST archive in multiple files; returns null on error.\n  // Sets current position to the beginning of the achive.\n  static FarReader *Open(const std::vector<string> &filenames);\n\n  // Resets current position to beginning of archive.\n  virtual void Reset() = 0;\n\n  // Sets current position to first entry >= key.  Returns true if a match.\n  virtual bool Find(const string &key) = 0;\n\n  // Current position at end of archive?\n  virtual bool Done() const = 0;\n\n  // Move current position to next FST.\n  virtual void Next() = 0;\n\n  // Returns key at the current position. This reference is invalidated if\n  // the current position in the archive is changed.\n  virtual const string &GetKey() const = 0;\n\n  // Returns pointer to FST at the current position. This is invalidated if\n  // the current position in the archive is changed.\n  virtual const Fst<Arc> *GetFst() const = 0;\n\n  virtual FarType Type() const = 0;\n\n  virtual bool Error() const = 0;\n\n  virtual ~FarReader() {}\n\n protected:\n  FarReader() {}\n};\n\ntemplate <class Arc>\nclass FstWriter {\n public:\n  void operator()(std::ostream &strm, const Fst<Arc> &fst) const {\n    fst.Write(strm, FstWriteOptions());\n  }\n};\n\ntemplate <class A>\nclass STTableFarWriter : public FarWriter<A> {\n public:\n  using Arc = A;\n\n  static STTableFarWriter *Create(const string &filename) {\n    auto *writer = STTableWriter<Fst<Arc>, FstWriter<Arc>>::Create(filename);\n    return new STTableFarWriter(writer);\n  }\n\n  void Add(const string &key, const Fst<Arc> &fst) final {\n    writer_->Add(key, fst);\n  }\n\n  FarType Type() const final { return FAR_STTABLE; }\n\n  bool Error() const final { return writer_->Error(); }\n\n private:\n  explicit STTableFarWriter(STTableWriter<Fst<Arc>, FstWriter<Arc>> *writer)\n      : writer_(writer) {}\n\n  std::unique_ptr<STTableWriter<Fst<Arc>, FstWriter<Arc>>> writer_;\n};\n\ntemplate <class A>\nclass STListFarWriter : public FarWriter<A> {\n public:\n  using Arc = A;\n\n  static STListFarWriter *Create(const string &filename) {\n    auto *writer = STListWriter<Fst<Arc>, FstWriter<Arc>>::Create(filename);\n    return new STListFarWriter(writer);\n  }\n\n  void Add(const string &key, const Fst<Arc> &fst) final {\n    writer_->Add(key, fst);\n  }\n\n  constexpr FarType Type() const final { return FAR_STLIST; }\n\n  bool Error() const final { return writer_->Error(); }\n\n private:\n  explicit STListFarWriter(STListWriter<Fst<Arc>, FstWriter<Arc>> *writer)\n      : writer_(writer) {}\n\n  std::unique_ptr<STListWriter<Fst<Arc>, FstWriter<Arc>>> writer_;\n};\n\ntemplate <class A>\nclass FstFarWriter : public FarWriter<A> {\n public:\n  using Arc = A;\n\n  explicit FstFarWriter(const string &filename)\n      : filename_(filename), error_(false), written_(false) {}\n\n  static FstFarWriter *Create(const string &filename) {\n    return new FstFarWriter(filename);\n  }\n\n  void Add(const string &key, const Fst<A> &fst) final {\n    if (written_) {\n      LOG(WARNING) << \"FstFarWriter::Add: only one FST supported,\"\n                   << \" subsequent entries discarded.\";\n    } else {\n      error_ = !fst.Write(filename_);\n      written_ = true;\n    }\n  }\n\n  constexpr FarType Type() const final { return FAR_FST; }\n\n  bool Error() const final { return error_; }\n\n  ~FstFarWriter() final {}\n\n private:\n  string filename_;\n  bool error_;\n  bool written_;\n};\n\ntemplate <class Arc>\nFarWriter<Arc> *FarWriter<Arc>::Create(const string &filename, FarType type) {\n  switch (type) {\n    case FAR_DEFAULT:\n      if (filename.empty()) return STListFarWriter<Arc>::Create(filename);\n    case FAR_STTABLE:\n      return STTableFarWriter<Arc>::Create(filename);\n    case FAR_STLIST:\n      return STListFarWriter<Arc>::Create(filename);\n    case FAR_FST:\n      return FstFarWriter<Arc>::Create(filename);\n    default:\n      LOG(ERROR) << \"FarWriter::Create: Unknown FAR type\";\n      return nullptr;\n  }\n}\n\ntemplate <class Arc>\nclass FstReader {\n public:\n  Fst<Arc> *operator()(std::istream &strm) const {\n    return Fst<Arc>::Read(strm, FstReadOptions());\n  }\n};\n\ntemplate <class A>\nclass STTableFarReader : public FarReader<A> {\n public:\n  using Arc = A;\n\n  static STTableFarReader *Open(const string &filename) {\n    auto *reader = STTableReader<Fst<Arc>, FstReader<Arc>>::Open(filename);\n    if (!reader || reader->Error()) return nullptr;\n    return new STTableFarReader(reader);\n  }\n\n  static STTableFarReader *Open(const std::vector<string> &filenames) {\n    auto *reader = STTableReader<Fst<Arc>, FstReader<Arc>>::Open(filenames);\n    if (!reader || reader->Error()) return nullptr;\n    return new STTableFarReader(reader);\n  }\n\n  void Reset() final { reader_->Reset(); }\n\n  bool Find(const string &key) final { return reader_->Find(key); }\n\n  bool Done() const final { return reader_->Done(); }\n\n  void Next() final { return reader_->Next(); }\n\n  const string &GetKey() const final { return reader_->GetKey(); }\n\n  const Fst<Arc> *GetFst() const final { return reader_->GetEntry(); }\n\n  constexpr FarType Type() const final { return FAR_STTABLE; }\n\n  bool Error() const final { return reader_->Error(); }\n\n private:\n  explicit STTableFarReader(STTableReader<Fst<Arc>, FstReader<Arc>> *reader)\n      : reader_(reader) {}\n\n  std::unique_ptr<STTableReader<Fst<Arc>, FstReader<Arc>>> reader_;\n};\n\ntemplate <class A>\nclass STListFarReader : public FarReader<A> {\n public:\n  using Arc = A;\n\n  static STListFarReader *Open(const string &filename) {\n    auto *reader = STListReader<Fst<Arc>, FstReader<Arc>>::Open(filename);\n    if (!reader || reader->Error()) return nullptr;\n    return new STListFarReader(reader);\n  }\n\n  static STListFarReader *Open(const std::vector<string> &filenames) {\n    auto *reader = STListReader<Fst<Arc>, FstReader<Arc>>::Open(filenames);\n    if (!reader || reader->Error()) return nullptr;\n    return new STListFarReader(reader);\n  }\n\n  void Reset() final { reader_->Reset(); }\n\n  bool Find(const string &key) final { return reader_->Find(key); }\n\n  bool Done() const final { return reader_->Done(); }\n\n  void Next() final { return reader_->Next(); }\n\n  const string &GetKey() const final { return reader_->GetKey(); }\n\n  const Fst<Arc> *GetFst() const final { return reader_->GetEntry(); }\n\n  constexpr FarType Type() const final { return FAR_STLIST; }\n\n  bool Error() const final { return reader_->Error(); }\n\n private:\n  explicit STListFarReader(STListReader<Fst<Arc>, FstReader<Arc>> *reader)\n      : reader_(reader) {}\n\n  std::unique_ptr<STListReader<Fst<Arc>, FstReader<Arc>>> reader_;\n};\n\ntemplate <class A>\nclass FstFarReader : public FarReader<A> {\n public:\n  using Arc = A;\n\n  static FstFarReader *Open(const string &filename) {\n    std::vector<string> filenames;\n    filenames.push_back(filename);\n    return new FstFarReader<Arc>(filenames);\n  }\n\n  static FstFarReader *Open(const std::vector<string> &filenames) {\n    return new FstFarReader<Arc>(filenames);\n  }\n\n  explicit FstFarReader(const std::vector<string> &filenames)\n      : keys_(filenames), has_stdin_(false), pos_(0), error_(false) {\n    std::sort(keys_.begin(), keys_.end());\n    streams_.resize(keys_.size(), 0);\n    for (size_t i = 0; i < keys_.size(); ++i) {\n      if (keys_[i].empty()) {\n        if (!has_stdin_) {\n          streams_[i] = &std::cin;\n          has_stdin_ = true;\n        } else {\n          FSTERROR() << \"FstFarReader::FstFarReader: standard input should \"\n                        \"only appear once in the input file list\";\n          error_ = true;\n          return;\n        }\n      } else {\n        streams_[i] = new std::ifstream(\n            keys_[i], std::ios_base::in | std::ios_base::binary);\n      }\n    }\n    if (pos_ >= keys_.size()) return;\n    ReadFst();\n  }\n\n  void Reset() final {\n    if (has_stdin_) {\n      FSTERROR()\n          << \"FstFarReader::Reset: Operation not supported on standard input\";\n      error_ = true;\n      return;\n    }\n    pos_ = 0;\n    ReadFst();\n  }\n\n  bool Find(const string &key) final {\n    if (has_stdin_) {\n      FSTERROR()\n          << \"FstFarReader::Find: Operation not supported on standard input\";\n      error_ = true;\n      return false;\n    }\n    pos_ = 0;  // TODO\n    ReadFst();\n    return true;\n  }\n\n  bool Done() const final { return error_ || pos_ >= keys_.size(); }\n\n  void Next() final {\n    ++pos_;\n    ReadFst();\n  }\n\n  const string &GetKey() const final { return keys_[pos_]; }\n\n  const Fst<Arc> *GetFst() const final { return fst_.get(); }\n\n  constexpr FarType Type() const final { return FAR_FST; }\n\n  bool Error() const final { return error_; }\n\n  ~FstFarReader() final {\n    for (size_t i = 0; i < keys_.size(); ++i) {\n      if (streams_[i] != &std::cin) {\n        delete streams_[i];\n      }\n    }\n  }\n\n private:\n  void ReadFst() {\n    fst_.reset();\n    if (pos_ >= keys_.size()) return;\n    streams_[pos_]->seekg(0);\n    fst_.reset(Fst<Arc>::Read(*streams_[pos_], FstReadOptions()));\n    if (!fst_) {\n      FSTERROR() << \"FstFarReader: Error reading Fst from: \" << keys_[pos_];\n      error_ = true;\n    }\n  }\n\n  std::vector<string> keys_;\n  std::vector<std::istream *> streams_;\n  bool has_stdin_;\n  size_t pos_;\n  mutable std::unique_ptr<Fst<Arc>> fst_;\n  mutable bool error_;\n};\n\ntemplate <class Arc>\nFarReader<Arc> *FarReader<Arc>::Open(const string &filename) {\n  if (filename.empty())\n    return STListFarReader<Arc>::Open(filename);\n  else if (IsSTTable(filename))\n    return STTableFarReader<Arc>::Open(filename);\n  else if (IsSTList(filename))\n    return STListFarReader<Arc>::Open(filename);\n  else if (IsFst(filename))\n    return FstFarReader<Arc>::Open(filename);\n  return nullptr;\n}\n\ntemplate <class Arc>\nFarReader<Arc> *FarReader<Arc>::Open(const std::vector<string> &filenames) {\n  if (!filenames.empty() && filenames[0].empty())\n    return STListFarReader<Arc>::Open(filenames);\n  else if (!filenames.empty() && IsSTTable(filenames[0]))\n    return STTableFarReader<Arc>::Open(filenames);\n  else if (!filenames.empty() && IsSTList(filenames[0]))\n    return STListFarReader<Arc>::Open(filenames);\n  else if (!filenames.empty() && IsFst(filenames[0]))\n    return FstFarReader<Arc>::Open(filenames);\n  return nullptr;\n}\n\n}  // namespace fst\n\n#endif  // FST_EXTENSIONS_FAR_FAR_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/extensions/far/farlib.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// A finite-state archive (FAR) is used to store an indexable collection of\n// FSTs in a single file. Utilities are provided to create FARs from FSTs,\n// to iterate over FARs, and to extract specific FSTs from FARs.\n\n#ifndef FST_EXTENSIONS_FAR_FARLIB_H_\n#define FST_EXTENSIONS_FAR_FARLIB_H_\n\n#include <fst/extensions/far/compile-strings.h>\n#include <fst/extensions/far/create.h>\n#include <fst/extensions/far/extract.h>\n#include <fst/extensions/far/far.h>\n#include <fst/extensions/far/getters.h>\n#include <fst/extensions/far/info.h>\n#include <fst/extensions/far/print-strings.h>\n\n#endif  // FST_EXTENSIONS_FAR_FARLIB_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/extensions/far/farscript.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Convenience file for including all of the FAR operations, or registering\n// them for new arc types.\n\n#ifndef FST_EXTENSIONS_FAR_FARSCRIPT_H_\n#define FST_EXTENSIONS_FAR_FARSCRIPT_H_\n\n#include <string>\n#include <vector>\n\n#include <fst/types.h>\n#include <fst/extensions/far/compile-strings.h>\n#include <fst/extensions/far/create.h>\n#include <fst/extensions/far/equal.h>\n#include <fst/extensions/far/extract.h>\n#include <fst/extensions/far/far.h>\n#include <fst/extensions/far/far-class.h>\n#include <fst/extensions/far/info.h>\n#include <fst/extensions/far/isomorphic.h>\n#include <fst/extensions/far/print-strings.h>\n#include <fst/extensions/far/script-impl.h>\n#include <fst/script/arg-packs.h>\n\nnamespace fst {\nnamespace script {\n\n// Note: it is safe to pass these strings as references because this struct is\n// only used to pass them deeper in the call graph. Be sure you understand why\n// this is so before using this struct for anything else!\nstruct FarCompileStringsArgs {\n  const std::vector<string> &in_fnames;\n  const string &out_fname;\n  const string &fst_type;\n  const FarType &far_type;\n  const int32_t generate_keys;\n  const FarEntryType fet;\n  const FarTokenType tt;\n  const string &symbols_fname;\n  const string &unknown_symbol;\n  const bool keep_symbols;\n  const bool initial_symbols;\n  const bool allow_negative_labels;\n  const string &key_prefix;\n  const string &key_suffix;\n\n  FarCompileStringsArgs(const std::vector<string> &in_fnames,\n                        const string &out_fname, const string &fst_type,\n                        const FarType &far_type, int32_t generate_keys,\n                        FarEntryType fet, FarTokenType tt,\n                        const string &symbols_fname,\n                        const string &unknown_symbol, bool keep_symbols,\n                        bool initial_symbols, bool allow_negative_labels,\n                        const string &key_prefix, const string &key_suffix)\n      : in_fnames(in_fnames),\n        out_fname(out_fname),\n        fst_type(fst_type),\n        far_type(far_type),\n        generate_keys(generate_keys),\n        fet(fet),\n        tt(tt),\n        symbols_fname(symbols_fname),\n        unknown_symbol(unknown_symbol),\n        keep_symbols(keep_symbols),\n        initial_symbols(initial_symbols),\n        allow_negative_labels(allow_negative_labels),\n        key_prefix(key_prefix),\n        key_suffix(key_suffix) {}\n};\n\ntemplate <class Arc>\nvoid FarCompileStrings(FarCompileStringsArgs *args) {\n  FarCompileStrings<Arc>(\n      args->in_fnames, args->out_fname, args->fst_type, args->far_type,\n      args->generate_keys, args->fet, args->tt, args->symbols_fname,\n      args->unknown_symbol, args->keep_symbols, args->initial_symbols,\n      args->allow_negative_labels, args->key_prefix, args->key_suffix);\n}\n\nvoid FarCompileStrings(const std::vector<string> &in_fnames,\n                       const string &out_fname, const string &arc_type,\n                       const string &fst_type, const FarType &far_type,\n                       int32_t generate_keys, FarEntryType fet, FarTokenType tt,\n                       const string &symbols_fname,\n                       const string &unknown_symbol, bool keep_symbols,\n                       bool initial_symbols, bool allow_negative_labels,\n                       const string &key_prefix, const string &key_suffix);\n\n// Note: it is safe to pass these strings as references because this struct is\n// only used to pass them deeper in the call graph. Be sure you understand why\n// this is so before using this struct for anything else!\nstruct FarCreateArgs {\n  const std::vector<string> &in_fnames;\n  const string &out_fname;\n  const int32_t generate_keys;\n  const FarType &far_type;\n  const string &key_prefix;\n  const string &key_suffix;\n\n  FarCreateArgs(const std::vector<string> &in_fnames, const string &out_fname,\n                const int32_t generate_keys, const FarType &far_type,\n                const string &key_prefix, const string &key_suffix)\n      : in_fnames(in_fnames),\n        out_fname(out_fname),\n        generate_keys(generate_keys),\n        far_type(far_type),\n        key_prefix(key_prefix),\n        key_suffix(key_suffix) {}\n};\n\ntemplate <class Arc>\nvoid FarCreate(FarCreateArgs *args) {\n  FarCreate<Arc>(args->in_fnames, args->out_fname, args->generate_keys,\n                 args->far_type, args->key_prefix, args->key_suffix);\n}\n\nvoid FarCreate(const std::vector<string> &in_fnames, const string &out_fname,\n               const string &arc_type, const int32_t generate_keys,\n               const FarType &far_type, const string &key_prefix,\n               const string &key_suffix);\n\nusing FarEqualInnerArgs = std::tuple<const string &, const string &, float,\n                                     const string &, const string &>;\n\nusing FarEqualArgs = WithReturnValue<bool, FarEqualInnerArgs>;\n\ntemplate <class Arc>\nvoid FarEqual(FarEqualArgs *args) {\n  args->retval = fst::FarEqual<Arc>(\n      std::get<0>(args->args), std::get<1>(args->args), std::get<2>(args->args),\n      std::get<3>(args->args), std::get<4>(args->args));\n}\n\nbool FarEqual(const string &filename1, const string &filename2,\n              const string &arc_type, float delta = kDelta,\n              const string &begin_key = string(),\n              const string &end_key = string());\n\nusing FarExtractArgs =\n    std::tuple<const std::vector<string> &, int32_t, const string &,\n               const string &, const string &, const string &, const string &>;\n\ntemplate <class Arc>\nvoid FarExtract(FarExtractArgs *args) {\n  fst::FarExtract<Arc>(std::get<0>(*args), std::get<1>(*args),\n                           std::get<2>(*args), std::get<3>(*args),\n                           std::get<4>(*args), std::get<5>(*args),\n                           std::get<6>(*args));\n}\n\nvoid FarExtract(const std::vector<string> &ifilenames, const string &arc_type,\n                int32_t generate_filenames, const string &keys,\n                const string &key_separator, const string &range_delimiter,\n                const string &filename_prefix, const string &filename_suffix);\n\nusing FarInfoArgs = std::tuple<const std::vector<string> &, const string &,\n                               const string &, const bool>;\n\ntemplate <class Arc>\nvoid FarInfo(FarInfoArgs *args) {\n  fst::FarInfo<Arc>(std::get<0>(*args), std::get<1>(*args),\n                        std::get<2>(*args), std::get<3>(*args));\n}\n\nvoid FarInfo(const std::vector<string> &filenames, const string &arc_type,\n             const string &begin_key, const string &end_key,\n             const bool list_fsts);\n\nusing GetFarInfoArgs = std::tuple<const std::vector<string> &, const string &,\n                                  const string &, const bool, FarInfoData *>;\n\ntemplate <class Arc>\nvoid GetFarInfo(GetFarInfoArgs *args) {\n  fst::GetFarInfo<Arc>(std::get<0>(*args), std::get<1>(*args),\n                           std::get<2>(*args), std::get<3>(*args),\n                           std::get<4>(*args));\n}\n\nvoid GetFarInfo(const std::vector<string> &filenames, const string &arc_type,\n                const string &begin_key, const string &end_key,\n                const bool list_fsts, FarInfoData *);\n\nusing FarIsomorphicInnerArgs = std::tuple<const string &, const string &, float,\n                                          const string &, const string &>;\n\nusing FarIsomorphicArgs = WithReturnValue<bool, FarIsomorphicInnerArgs>;\n\ntemplate <class Arc>\nvoid FarIsomorphic(FarIsomorphicArgs *args) {\n  args->retval = fst::FarIsomorphic<Arc>(\n      std::get<0>(args->args), std::get<1>(args->args), std::get<2>(args->args),\n      std::get<3>(args->args), std::get<4>(args->args));\n}\n\nbool FarIsomorphic(const string &filename1, const string &filename2,\n                   const string &arc_type, float delta = kDelta,\n                   const string &begin_key = string(),\n                   const string &end_key = string());\n\nstruct FarPrintStringsArgs {\n  const std::vector<string> &ifilenames;\n  const FarEntryType entry_type;\n  const FarTokenType token_type;\n  const string &begin_key;\n  const string &end_key;\n  const bool print_key;\n  const bool print_weight;\n  const string &symbols_fname;\n  const bool initial_symbols;\n  const int32_t generate_filenames;\n  const string &filename_prefix;\n  const string &filename_suffix;\n\n  FarPrintStringsArgs(const std::vector<string> &ifilenames,\n                      const FarEntryType entry_type,\n                      const FarTokenType token_type, const string &begin_key,\n                      const string &end_key, const bool print_key,\n                      const bool print_weight, const string &symbols_fname,\n                      const bool initial_symbols,\n                      const int32_t generate_filenames,\n                      const string &filename_prefix,\n                      const string &filename_suffix)\n      : ifilenames(ifilenames),\n        entry_type(entry_type),\n        token_type(token_type),\n        begin_key(begin_key),\n        end_key(end_key),\n        print_key(print_key),\n        print_weight(print_weight),\n        symbols_fname(symbols_fname),\n        initial_symbols(initial_symbols),\n        generate_filenames(generate_filenames),\n        filename_prefix(filename_prefix),\n        filename_suffix(filename_suffix) {}\n};\n\ntemplate <class Arc>\nvoid FarPrintStrings(FarPrintStringsArgs *args) {\n  fst::FarPrintStrings<Arc>(\n      args->ifilenames, args->entry_type, args->token_type, args->begin_key,\n      args->end_key, args->print_key, args->print_weight, args->symbols_fname,\n      args->initial_symbols, args->generate_filenames, args->filename_prefix,\n      args->filename_suffix);\n}\n\nvoid FarPrintStrings(const std::vector<string> &ifilenames,\n                     const string &arc_type, const FarEntryType entry_type,\n                     const FarTokenType token_type, const string &begin_key,\n                     const string &end_key, const bool print_key,\n                     const bool print_weight, const string &symbols_fname,\n                     const bool initial_symbols, const int32_t generate_filenames,\n                     const string &filename_prefix,\n                     const string &filename_suffix);\n\n}  // namespace script\n}  // namespace fst\n\n#define REGISTER_FST_FAR_OPERATIONS(ArcType)                                 \\\n  REGISTER_FST_OPERATION(FarCompileStrings, ArcType, FarCompileStringsArgs); \\\n  REGISTER_FST_OPERATION(FarCreate, ArcType, FarCreateArgs);                 \\\n  REGISTER_FST_OPERATION(FarEqual, ArcType, FarEqualArgs);                   \\\n  REGISTER_FST_OPERATION(FarExtract, ArcType, FarExtractArgs);               \\\n  REGISTER_FST_OPERATION(FarInfo, ArcType, FarInfoArgs);                     \\\n  REGISTER_FST_OPERATION(FarIsomorphic, ArcType, FarIsomorphicArgs);         \\\n  REGISTER_FST_OPERATION(FarPrintStrings, ArcType, FarPrintStringsArgs);     \\\n  REGISTER_FST_OPERATION(GetFarInfo, ArcType, GetFarInfoArgs)\n\n#endif  // FST_EXTENSIONS_FAR_FARSCRIPT_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/extensions/far/getters.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Classes and functions for registering and invoking FAR main\n// functions that support multiple and extensible arc types.\n\n#ifndef FST_EXTENSIONS_FAR_GETTERS_H_\n#define FST_EXTENSIONS_FAR_GETTERS_H_\n\n#include <fst/flags.h>\n#include <fst/extensions/far/far.h>\n\nnamespace fst {\nnamespace script {\n\nFarType GetFarType(const string &str);\n\nbool GetFarEntryType(const string &str, FarEntryType *entry_type);\n\nbool GetFarTokenType(const string &str, FarTokenType *token_type);\n\nvoid ExpandArgs(int argc, char **argv, int *argcp, char ***argvp);\n\n}  // namespace script\n\nstring GetFarTypeString(FarType type);\n\n}  // namespace fst\n\n#endif  // FST_EXTENSIONS_FAR_GETTERS_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/extensions/far/info.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#ifndef FST_EXTENSIONS_FAR_INFO_H_\n#define FST_EXTENSIONS_FAR_INFO_H_\n\n#include <iomanip>\n#include <memory>\n#include <set>\n#include <string>\n#include <utility>\n#include <vector>\n\n#include <fst/extensions/far/far.h>\n#include <fst/extensions/far/getters.h>\n\nnamespace fst {\n\ntemplate <class Arc>\nvoid AccumulateStatesAndArcs(const Fst<Arc> &fst, size_t *nstate, size_t *narc,\n                             size_t *nfinal) {\n  for (StateIterator<Fst<Arc>> siter(fst); !siter.Done();\n       siter.Next(), ++(*nstate)) {\n    ArcIterator<Fst<Arc>> aiter(fst, siter.Value());\n    for (; !aiter.Done(); aiter.Next(), ++(*narc)) {\n    }\n    if (fst.Final(siter.Value()) != Arc::Weight::Zero()) ++(*nfinal);\n  }\n}\n\nstruct KeyInfo {\n  string key;\n  string type;\n  size_t nstate = 0;\n  size_t narc = 0;\n  size_t nfinal = 0;\n};\n\nstruct FarInfoData {\n  std::vector<KeyInfo> key_infos;\n  string far_type;\n  string arc_type;\n  size_t nfst = 0;\n  size_t nstate = 0;\n  size_t narc = 0;\n  size_t nfinal = 0;\n  std::set<string> fst_types;\n};\n\ntemplate <class Arc>\nvoid GetFarInfo(const std::vector<string> &filenames, const string &begin_key,\n                const string &end_key, const bool list_fsts,\n                FarInfoData *far_info) {\n  *far_info = FarInfoData();\n  std::unique_ptr<FarReader<Arc>> reader(FarReader<Arc>::Open(filenames));\n  if (!reader) {\n    LOG(ERROR) << \"GetFarInfo: failed to create far reader.\";\n    return;\n  }\n  if (!begin_key.empty()) reader->Find(begin_key);\n\n  for (; !reader->Done(); reader->Next()) {\n    const auto &key = reader->GetKey();\n    if (!end_key.empty() && end_key < key) break;\n    ++far_info->nfst;\n    const auto *fst = reader->GetFst();\n    far_info->fst_types.insert(fst->Type());\n    if (list_fsts) {\n      KeyInfo info;\n      info.key = key;\n      info.type = fst->Type();\n      AccumulateStatesAndArcs(*fst, &info.nstate, &info.narc, &info.nfinal);\n      far_info->nstate += info.nstate;\n      far_info->narc += info.narc;\n      far_info->nfinal += info.nfinal;\n      far_info->key_infos.push_back(info);\n    } else {\n      AccumulateStatesAndArcs(*fst, &far_info->nstate, &far_info->narc,\n                              &far_info->nfinal);\n    }\n  }\n  far_info->far_type = GetFarTypeString(reader->Type());\n  far_info->arc_type = Arc::Type();\n}\n\ntemplate <class Arc>\nvoid FarInfo(const std::vector<string> &filenames, const string &begin_key,\n             const string &end_key, const bool list_fsts) {\n  FarInfoData info;\n  GetFarInfo<Arc>(filenames, begin_key, end_key, list_fsts, &info);\n  if (!list_fsts) {\n    std::cout << std::left << std::setw(50) << \"far type\" << info.far_type\n              << std::endl;\n    std::cout << std::left << std::setw(50) << \"arc type\" << Arc::Type()\n              << std::endl;\n    std::cout << std::left << std::setw(50) << \"fst type\";\n    for (auto iter = info.fst_types.begin(); iter != info.fst_types.end();\n         ++iter) {\n      if (iter != info.fst_types.begin()) std::cout << \",\";\n      std::cout << *iter;\n    }\n    std::cout << std::endl;\n    std::cout << std::left << std::setw(50) << \"# of FSTs\" << info.nfst\n              << std::endl;\n    std::cout << std::left << std::setw(50) << \"total # of states\"\n              << info.nstate << std::endl;\n    std::cout << std::left << std::setw(50) << \"total # of arcs\" << info.narc\n              << std::endl;\n    std::cout << std::left << std::setw(50) << \"total # of final states\"\n              << info.nfinal << std::endl;\n  } else {\n    // FIXME(kbg): Grok, then document this.\n    int wkey = 10;\n    int wtype = 10;\n    int wnstate = 14;\n    int wnarc = 12;\n    int wnfinal = 20;\n    for (const auto &key_info : info.key_infos) {\n      if (key_info.key.size() + 2 > wkey) wkey = key_info.key.size() + 2;\n      if (key_info.type.size() + 2 > wtype) wtype = key_info.type.size() + 2;\n      if (ceil(log10(key_info.nstate)) + 2 > wnstate) {\n        wnstate = ceil(log10(key_info.nstate)) + 2;\n      }\n      if (ceil(log10(key_info.narc)) + 2 > wnarc) {\n        wnarc = ceil(log10(key_info.narc)) + 2;\n      }\n      if (ceil(log10(key_info.nfinal)) + 2 > wnfinal) {\n        wnfinal = ceil(log10(key_info.nfinal)) + 2;\n      }\n    }\n    std::cout << std::left << std::setw(wkey) << \"key\" << std::setw(wtype)\n              << \"type\" << std::right << std::setw(wnstate) << \"# of states\"\n              << std::setw(wnarc) << \"# of arcs\" << std::setw(wnfinal)\n              << \"# of final states\" << std::endl;\n    for (const auto &key_info : info.key_infos) {\n      std::cout << std::left << std::setw(wkey) << key_info.key\n                << std::setw(wtype) << key_info.type << std::right\n                << std::setw(wnstate) << key_info.nstate << std::setw(wnarc)\n                << key_info.narc << std::setw(wnfinal) << key_info.nfinal\n                << std::endl;\n    }\n  }\n}\n\n}  // namespace fst\n\n#endif  // FST_EXTENSIONS_FAR_INFO_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/extensions/far/isomorphic.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#ifndef FST_EXTENSIONS_FAR_ISOMORPHIC_H_\n#define FST_EXTENSIONS_FAR_ISOMORPHIC_H_\n\n#include <memory>\n#include <string>\n\n#include <fst/extensions/far/far.h>\n#include <fst/isomorphic.h>\n\nnamespace fst {\n\ntemplate <class Arc>\nbool FarIsomorphic(const string &filename1, const string &filename2,\n                   float delta = kDelta, const string &begin_key = string(),\n                   const string &end_key = string()) {\n  std::unique_ptr<FarReader<Arc>> reader1(FarReader<Arc>::Open(filename1));\n  if (!reader1) {\n    LOG(ERROR) << \"FarIsomorphic: Cannot open FAR file \" << filename1;\n    return false;\n  }\n  std::unique_ptr<FarReader<Arc>> reader2(FarReader<Arc>::Open(filename2));\n  if (!reader2) {\n    LOG(ERROR) << \"FarIsomorphic: Cannot open FAR file \" << filename2;\n    return false;\n  }\n  if (!begin_key.empty()) {\n    bool find_begin1 = reader1->Find(begin_key);\n    bool find_begin2 = reader2->Find(begin_key);\n    if (!find_begin1 || !find_begin2) {\n      bool ret = !find_begin1 && !find_begin2;\n      if (!ret) {\n        VLOG(1) << \"FarIsomorphic: Key \" << begin_key << \" missing from \"\n                << (find_begin1 ? \"second\" : \"first\") << \" archive.\";\n      }\n      return ret;\n    }\n  }\n  for (; !reader1->Done() && !reader2->Done();\n       reader1->Next(), reader2->Next()) {\n    const auto &key1 = reader1->GetKey();\n    const auto &key2 = reader2->GetKey();\n    if (!end_key.empty() && end_key < key1 && end_key < key2) return true;\n    if (key1 != key2) {\n      LOG(ERROR) << \"FarIsomorphic: Mismatched keys \" << key1 << \" and \"\n                 << key2;\n      return false;\n    }\n    if (!Isomorphic(*(reader1->GetFst()), *(reader2->GetFst()), delta)) {\n      LOG(ERROR) << \"FarIsomorphic: FSTs for key \" << key1\n                 << \" are not isomorphic\";\n      return false;\n    }\n  }\n  if (!reader1->Done() || !reader2->Done()) {\n    LOG(ERROR) << \"FarIsomorphic: Key \"\n               << (reader1->Done() ? reader2->GetKey() : reader1->GetKey())\n               << \" missing form \" << (reader2->Done() ? \"first\" : \"second\")\n               << \" archive\";\n    return false;\n  }\n  return true;\n}\n\n}  // namespace fst\n\n#endif  // FST_EXTENSIONS_FAR_ISOMORPHIC_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/extensions/far/print-strings.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Outputs as strings the string FSTs in a finite-state archive.\n\n#ifndef FST_EXTENSIONS_FAR_PRINT_STRINGS_H_\n#define FST_EXTENSIONS_FAR_PRINT_STRINGS_H_\n\n#include <iomanip>\n#include <string>\n#include <vector>\n\n#include <fst/flags.h>\n#include <fst/extensions/far/far.h>\n#include <fstream>\n#include <fst/shortest-distance.h>\n#include <fst/string.h>\n\nDECLARE_string(far_field_separator);\n\nnamespace fst {\n\ntemplate <class Arc>\nvoid FarPrintStrings(const std::vector<string> &ifilenames,\n                     FarEntryType entry_type, FarTokenType far_token_type,\n                     const string &begin_key, const string &end_key,\n                     bool print_key, bool print_weight,\n                     const string &symbols_fname, bool initial_symbols,\n                     int32_t generate_filenames, const string &filename_prefix,\n                     const string &filename_suffix) {\n  StringTokenType token_type;\n  if (far_token_type == FTT_SYMBOL) {\n    token_type = StringTokenType::SYMBOL;\n  } else if (far_token_type == FTT_BYTE) {\n    token_type = StringTokenType::BYTE;\n  } else if (far_token_type == FTT_UTF8) {\n    token_type = StringTokenType::UTF8;\n  } else {\n    FSTERROR() << \"FarPrintStrings: Unknown token type\";\n    return;\n  }\n  std::unique_ptr<const SymbolTable> syms;\n  if (!symbols_fname.empty()) {\n    // TODO(kbg): Allow negative flag?\n    const SymbolTableTextOptions opts(true);\n    syms.reset(SymbolTable::ReadText(symbols_fname, opts));\n    if (!syms) {\n      LOG(ERROR) << \"FarPrintStrings: Error reading symbol table \"\n                 << symbols_fname;\n      return;\n    }\n  }\n  std::unique_ptr<FarReader<Arc>> far_reader(FarReader<Arc>::Open(ifilenames));\n  if (!far_reader) return;\n  if (!begin_key.empty()) far_reader->Find(begin_key);\n  string okey;\n  int nrep = 0;\n  for (int i = 1; !far_reader->Done(); far_reader->Next(), ++i) {\n    const auto &key = far_reader->GetKey();\n    if (!end_key.empty() && end_key < key) break;\n    if (okey == key) {\n      ++nrep;\n    } else {\n      nrep = 0;\n    }\n    okey = key;\n    const auto *fst = far_reader->GetFst();\n    if (i == 1 && initial_symbols && !syms && fst->InputSymbols())\n      syms.reset(fst->InputSymbols()->Copy());\n    string str;\n    VLOG(2) << \"Handling key: \" << key;\n    StringPrinter<Arc> string_printer(token_type,\n                                      syms ? syms.get() : fst->InputSymbols());\n    string_printer(*fst, &str);\n    if (entry_type == FET_LINE) {\n      if (print_key) std::cout << key << FLAGS_far_field_separator[0];\n      std::cout << str;\n      if (print_weight)\n        std::cout << FLAGS_far_field_separator[0] << ShortestDistance(*fst);\n      std::cout << std::endl;\n    } else if (entry_type == FET_FILE) {\n      std::stringstream sstrm;\n      if (generate_filenames) {\n        sstrm.fill('0');\n        sstrm << std::right << std::setw(generate_filenames) << i;\n      } else {\n        sstrm << key;\n        if (nrep > 0) sstrm << \".\" << nrep;\n      }\n      string filename;\n      filename = filename_prefix + sstrm.str() + filename_suffix;\n      std::ofstream ostrm(filename);\n      if (!ostrm) {\n        LOG(ERROR) << \"FarPrintStrings: Can't open file: \" << filename;\n        return;\n      }\n      ostrm << str;\n      if (token_type == StringTokenType::SYMBOL) ostrm << \"\\n\";\n    }\n  }\n}\n\n}  // namespace fst\n\n#endif  // FST_EXTENSIONS_FAR_PRINT_STRINGS_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/extensions/far/script-impl.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Classes and functions for registering and invoking Far main\n// functions that support multiple and extensible arc types.\n\n#ifndef FST_EXTENSIONS_FAR_SCRIPT_IMPL_H_\n#define FST_EXTENSIONS_FAR_SCRIPT_IMPL_H_\n\n#include <string>\n\n#include <fst/compat.h>\nnamespace fst {\nnamespace script {\n\nstring LoadArcTypeFromFar(const string &far_fname);\n\nstring LoadArcTypeFromFst(const string &fst_fname);\n\n}  // namespace script\n}  // namespace fst\n\n#endif  // FST_EXTENSIONS_FAR_SCRIPT_IMPL_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/extensions/far/stlist.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// A generic (string,type) list file format.\n//\n// This is a stripped-down version of STTable that does not support the Find()\n// operation but that does support reading/writting from standard in/out.\n\n#ifndef FST_EXTENSIONS_FAR_STLIST_H_\n#define FST_EXTENSIONS_FAR_STLIST_H_\n\n#include <algorithm>\n#include <functional>\n#include <iostream>\n#include <memory>\n#include <queue>\n#include <string>\n#include <utility>\n#include <vector>\n\n#include <fstream>\n#include <fst/util.h>\n\nnamespace fst {\n\nstatic constexpr int32_t kSTListMagicNumber = 5656924;\nstatic constexpr int32_t kSTListFileVersion = 1;\n\n// String-type list writing class for object of type T using a functor Writer.\n// The Writer functor must provide at least the following interface:\n//\n//   struct Writer {\n//     void operator()(std::ostream &, const T &) const;\n//   };\ntemplate <class T, class Writer>\nclass STListWriter {\n public:\n  explicit STListWriter(const string &filename)\n      : stream_(filename.empty() ? &std::cout : new std::ofstream(\n                                                    filename,\n                                                    std::ios_base::out |\n                                                        std::ios_base::binary)),\n        error_(false) {\n    WriteType(*stream_, kSTListMagicNumber);\n    WriteType(*stream_, kSTListFileVersion);\n    if (!stream_) {\n      FSTERROR() << \"STListWriter::STListWriter: Error writing to file: \"\n                 << filename;\n      error_ = true;\n    }\n  }\n\n  static STListWriter<T, Writer> *Create(const string &filename) {\n    return new STListWriter<T, Writer>(filename);\n  }\n\n  void Add(const string &key, const T &t) {\n    if (key == \"\") {\n      FSTERROR() << \"STListWriter::Add: Key empty: \" << key;\n      error_ = true;\n    } else if (key < last_key_) {\n      FSTERROR() << \"STListWriter::Add: Key out of order: \" << key;\n      error_ = true;\n    }\n    if (error_) return;\n    last_key_ = key;\n    WriteType(*stream_, key);\n    entry_writer_(*stream_, t);\n  }\n\n  bool Error() const { return error_; }\n\n  ~STListWriter() {\n    WriteType(*stream_, string());\n    if (stream_ != &std::cout) delete stream_;\n  }\n\n private:\n  Writer entry_writer_;\n  std::ostream *stream_;  // Output stream.\n  string last_key_;       // Last key.\n  bool error_;\n\n  STListWriter(const STListWriter &) = delete;\n  STListWriter &operator=(const STListWriter &) = delete;\n};\n\n// String-type list reading class for object of type T using a functor Reader.\n// Reader must provide at least the following interface:\n//\n//   struct Reader {\n//     T *operator()(std::istream &) const;\n//   };\ntemplate <class T, class Reader>\nclass STListReader {\n public:\n  explicit STListReader(const std::vector<string> &filenames)\n      : sources_(filenames), error_(false) {\n    streams_.resize(filenames.size(), 0);\n    bool has_stdin = false;\n    for (size_t i = 0; i < filenames.size(); ++i) {\n      if (filenames[i].empty()) {\n        if (!has_stdin) {\n          streams_[i] = &std::cin;\n          sources_[i] = \"stdin\";\n          has_stdin = true;\n        } else {\n          FSTERROR() << \"STListReader::STListReader: Cannot read multiple \"\n                     << \"inputs from standard input\";\n          error_ = true;\n          return;\n        }\n      } else {\n        streams_[i] = new std::ifstream(\n            filenames[i], std::ios_base::in | std::ios_base::binary);\n      }\n      int32_t magic_number = 0;\n      ReadType(*streams_[i], &magic_number);\n      int32_t file_version = 0;\n      ReadType(*streams_[i], &file_version);\n      if (magic_number != kSTListMagicNumber) {\n        FSTERROR() << \"STListReader::STListReader: Wrong file type: \"\n                   << filenames[i];\n        error_ = true;\n        return;\n      }\n      if (file_version != kSTListFileVersion) {\n        FSTERROR() << \"STListReader::STListReader: Wrong file version: \"\n                   << filenames[i];\n        error_ = true;\n        return;\n      }\n      string key;\n      ReadType(*streams_[i], &key);\n      if (!key.empty()) heap_.push(std::make_pair(key, i));\n      if (!*streams_[i]) {\n        FSTERROR() << \"STListReader: Error reading file: \" << sources_[i];\n        error_ = true;\n        return;\n      }\n    }\n    if (heap_.empty()) return;\n    const auto current = heap_.top().second;\n    entry_.reset(entry_reader_(*streams_[current]));\n    if (!entry_ || !*streams_[current]) {\n      FSTERROR() << \"STListReader: Error reading entry for key \"\n                 << heap_.top().first << \", file \" << sources_[current];\n      error_ = true;\n    }\n  }\n\n  ~STListReader() {\n    for (auto &stream : streams_) {\n      if (stream != &std::cin) delete stream;\n    }\n  }\n\n  static STListReader<T, Reader> *Open(const string &filename) {\n    std::vector<string> filenames;\n    filenames.push_back(filename);\n    return new STListReader<T, Reader>(filenames);\n  }\n\n  static STListReader<T, Reader> *Open(const std::vector<string> &filenames) {\n    return new STListReader<T, Reader>(filenames);\n  }\n\n  void Reset() {\n    FSTERROR() << \"STListReader::Reset: Operation not supported\";\n    error_ = true;\n  }\n\n  bool Find(const string &key) {\n    FSTERROR() << \"STListReader::Find: Operation not supported\";\n    error_ = true;\n    return false;\n  }\n\n  bool Done() const { return error_ || heap_.empty(); }\n\n  void Next() {\n    if (error_) return;\n    auto current = heap_.top().second;\n    string key;\n    heap_.pop();\n    ReadType(*(streams_[current]), &key);\n    if (!*streams_[current]) {\n      FSTERROR() << \"STListReader: Error reading file: \" << sources_[current];\n      error_ = true;\n      return;\n    }\n    if (!key.empty()) heap_.push(std::make_pair(key, current));\n    if (!heap_.empty()) {\n      current = heap_.top().second;\n      entry_.reset(entry_reader_(*streams_[current]));\n      if (!entry_ || !*streams_[current]) {\n        FSTERROR() << \"STListReader: Error reading entry for key: \"\n                   << heap_.top().first << \", file: \" << sources_[current];\n        error_ = true;\n      }\n    }\n  }\n\n  const string &GetKey() const { return heap_.top().first; }\n\n  const T *GetEntry() const { return entry_.get(); }\n\n  bool Error() const { return error_; }\n\n private:\n  Reader entry_reader_;                  // Read functor.\n  std::vector<std::istream *> streams_;  // Input streams.\n  std::vector<string> sources_;          // Corresponding filenames.\n  std::priority_queue<\n      std::pair<string, size_t>, std::vector<std::pair<string, size_t>>,\n      std::greater<std::pair<string, size_t>>> heap_;  // (Key, stream id) heap\n  mutable std::unique_ptr<T> entry_;  // The currently read entry.\n  bool error_;\n\n  STListReader(const STListReader &) = delete;\n  STListReader &operator=(const STListReader &) = delete;\n};\n\n// String-type list header reading function, templated on the entry header type.\n// The Header type must provide at least the following interface:\n//\n//  struct Header {\n//    void Read(std::istream &strm, const string &filename);\n//  };\ntemplate <class Header>\nbool ReadSTListHeader(const string &filename, Header *header) {\n  if (filename.empty()) {\n    LOG(ERROR) << \"ReadSTListHeader: Can't read header from standard input\";\n    return false;\n  }\n  std::ifstream strm(filename, std::ios_base::in | std::ios_base::binary);\n  if (!strm) {\n    LOG(ERROR) << \"ReadSTListHeader: Could not open file: \" << filename;\n    return false;\n  }\n  int32_t magic_number = 0;\n  ReadType(strm, &magic_number);\n  int32_t file_version = 0;\n  ReadType(strm, &file_version);\n  if (magic_number != kSTListMagicNumber) {\n    LOG(ERROR) << \"ReadSTListHeader: Wrong file type: \" << filename;\n    return false;\n  }\n  if (file_version != kSTListFileVersion) {\n    LOG(ERROR) << \"ReadSTListHeader: Wrong file version: \" << filename;\n    return false;\n  }\n  string key;\n  ReadType(strm, &key);\n  header->Read(strm, filename + \":\" + key);\n  if (!strm) {\n    LOG(ERROR) << \"ReadSTListHeader: Error reading file: \" << filename;\n    return false;\n  }\n  return true;\n}\n\nbool IsSTList(const string &filename);\n\n}  // namespace fst\n\n#endif  // FST_EXTENSIONS_FAR_STLIST_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/extensions/far/sttable.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// A generic string-to-type table file format.\n//\n// This is not meant as a generalization of SSTable. This is more of a simple\n// replacement for SSTable in order to provide an open-source implementation\n// of the FAR format for the external version of the FST library.\n\n#ifndef FST_EXTENSIONS_FAR_STTABLE_H_\n#define FST_EXTENSIONS_FAR_STTABLE_H_\n\n#include <algorithm>\n#include <istream>\n#include <memory>\n\n#include <fstream>\n#include <fst/util.h>\n\nnamespace fst {\n\nstatic constexpr int32_t kSTTableMagicNumber = 2125656924;\nstatic constexpr int32_t kSTTableFileVersion = 1;\n\n// String-type table writing class for an object of type T using a functor\n// Writer. The Writer functor must provide at least the following interface:\n//\n//   struct Writer {\n//     void operator()(std::ostream &, const T &) const;\n//   };\ntemplate <class T, class Writer>\nclass STTableWriter {\n public:\n  explicit STTableWriter(const string &filename)\n      : stream_(filename, std::ios_base::out | std::ios_base::binary),\n        error_(false) {\n    WriteType(stream_, kSTTableMagicNumber);\n    WriteType(stream_, kSTTableFileVersion);\n    if (stream_.fail()) {\n      FSTERROR() << \"STTableWriter::STTableWriter: Error writing to file: \"\n                 << filename;\n      error_ = true;\n    }\n  }\n\n  static STTableWriter<T, Writer> *Create(const string &filename) {\n    if (filename.empty()) {\n      LOG(ERROR) << \"STTableWriter: Writing to standard out unsupported.\";\n      return nullptr;\n    }\n    return new STTableWriter<T, Writer>(filename);\n  }\n\n  void Add(const string &key, const T &t) {\n    if (key == \"\") {\n      FSTERROR() << \"STTableWriter::Add: Key empty: \" << key;\n      error_ = true;\n    } else if (key < last_key_) {\n      FSTERROR() << \"STTableWriter::Add: Key out of order: \" << key;\n      error_ = true;\n    }\n    if (error_) return;\n    last_key_ = key;\n    positions_.push_back(stream_.tellp());\n    WriteType(stream_, key);\n    entry_writer_(stream_, t);\n  }\n\n  bool Error() const { return error_; }\n\n  ~STTableWriter() {\n    WriteType(stream_, positions_);\n    WriteType(stream_, static_cast<int64_t>(positions_.size()));\n  }\n\n private:\n  Writer entry_writer_;\n  std::ofstream stream_;\n  std::vector<int64_t> positions_;  // Position in file of each key-entry pair.\n  string last_key_;               // Last key.\n  bool error_;\n\n  STTableWriter(const STTableWriter &) = delete;\n  STTableWriter &operator=(const STTableWriter &) = delete;\n};\n\n// String-type table reading class for object of type T using a functor Reader.\n// Reader must provide at least the following interface:\n//\n//   struct Reader {\n//     T *operator()(std::istream &) const;\n//   };\n//\ntemplate <class T, class Reader>\nclass STTableReader {\n public:\n  explicit STTableReader(const std::vector<string> &filenames)\n      : sources_(filenames), error_(false) {\n    compare_.reset(new Compare(&keys_));\n    keys_.resize(filenames.size());\n    streams_.resize(filenames.size(), 0);\n    positions_.resize(filenames.size());\n    for (size_t i = 0; i < filenames.size(); ++i) {\n      streams_[i] = new std::ifstream(\n          filenames[i], std::ios_base::in | std::ios_base::binary);\n      int32_t magic_number = 0;\n      ReadType(*streams_[i], &magic_number);\n      int32_t file_version = 0;\n      ReadType(*streams_[i], &file_version);\n      if (magic_number != kSTTableMagicNumber) {\n        FSTERROR() << \"STTableReader::STTableReader: Wrong file type: \"\n                   << filenames[i];\n        error_ = true;\n        return;\n      }\n      if (file_version != kSTTableFileVersion) {\n        FSTERROR() << \"STTableReader::STTableReader: Wrong file version: \"\n                   << filenames[i];\n        error_ = true;\n        return;\n      }\n      int64_t num_entries;\n      streams_[i]->seekg(-static_cast<int>(sizeof(int64_t)), std::ios_base::end);\n      ReadType(*streams_[i], &num_entries);\n      if (num_entries > 0) {\n        streams_[i]->seekg(-static_cast<int>(sizeof(int64_t)) * (num_entries + 1),\n                           std::ios_base::end);\n        positions_[i].resize(num_entries);\n        for (size_t j = 0; (j < num_entries) && (!streams_[i]->fail()); ++j) {\n          ReadType(*streams_[i], &(positions_[i][j]));\n        }\n        streams_[i]->seekg(positions_[i][0]);\n        if (streams_[i]->fail()) {\n          FSTERROR() << \"STTableReader::STTableReader: Error reading file: \"\n                     << filenames[i];\n          error_ = true;\n          return;\n        }\n      }\n    }\n    MakeHeap();\n  }\n\n  ~STTableReader() {\n    for (auto &stream : streams_) delete stream;\n  }\n\n  static STTableReader<T, Reader> *Open(const string &filename) {\n    if (filename.empty()) {\n      LOG(ERROR) << \"STTableReader: Operation not supported on standard input\";\n      return nullptr;\n    }\n    std::vector<string> filenames;\n    filenames.push_back(filename);\n    return new STTableReader<T, Reader>(filenames);\n  }\n\n  static STTableReader<T, Reader> *Open(const std::vector<string> &filenames) {\n    return new STTableReader<T, Reader>(filenames);\n  }\n\n  void Reset() {\n    if (error_) return;\n    for (size_t i = 0; i < streams_.size(); ++i)\n      streams_[i]->seekg(positions_[i].front());\n    MakeHeap();\n  }\n\n  bool Find(const string &key) {\n    if (error_) return false;\n    for (size_t i = 0; i < streams_.size(); ++i) LowerBound(i, key);\n    MakeHeap();\n    if (heap_.empty()) return false;\n    return keys_[current_] == key;\n  }\n\n  bool Done() const { return error_ || heap_.empty(); }\n\n  void Next() {\n    if (error_) return;\n    if (streams_[current_]->tellg() <= positions_[current_].back()) {\n      ReadType(*(streams_[current_]), &(keys_[current_]));\n      if (streams_[current_]->fail()) {\n        FSTERROR() << \"STTableReader: Error reading file: \"\n                   << sources_[current_];\n        error_ = true;\n        return;\n      }\n      std::push_heap(heap_.begin(), heap_.end(), *compare_);\n    } else {\n      heap_.pop_back();\n    }\n    if (!heap_.empty()) PopHeap();\n  }\n\n  const string &GetKey() const { return keys_[current_]; }\n\n  const T *GetEntry() const { return entry_.get(); }\n\n  bool Error() const { return error_; }\n\n private:\n  // Comparison functor used to compare stream IDs in the heap.\n  struct Compare {\n    explicit Compare(const std::vector<string> *keys) : keys(keys) {}\n\n    bool operator()(size_t i, size_t j) const {\n      return (*keys)[i] > (*keys)[j];\n    };\n\n   private:\n    const std::vector<string> *keys;\n  };\n\n  // Positions the stream at the position corresponding to the lower bound for\n  // the specified key.\n  void LowerBound(size_t id, const string &find_key) {\n    auto *strm = streams_[id];\n    const auto &positions = positions_[id];\n    if (positions.empty()) return;\n    size_t low = 0;\n    size_t high = positions.size() - 1;\n    while (low < high) {\n      size_t mid = (low + high) / 2;\n      strm->seekg(positions[mid]);\n      string key;\n      ReadType(*strm, &key);\n      if (key > find_key) {\n        high = mid;\n      } else if (key < find_key) {\n        low = mid + 1;\n      } else {\n        for (size_t i = mid; i > low; --i) {\n          strm->seekg(positions[i - 1]);\n          ReadType(*strm, &key);\n          if (key != find_key) {\n            strm->seekg(positions[i]);\n            return;\n          }\n        }\n        strm->seekg(positions[low]);\n        return;\n      }\n    }\n    strm->seekg(positions[low]);\n  }\n\n  // Adds all streams to the heap.\n  void MakeHeap() {\n    heap_.clear();\n    for (size_t i = 0; i < streams_.size(); ++i) {\n      if (positions_[i].empty()) continue;\n      ReadType(*streams_[i], &(keys_[i]));\n      if (streams_[i]->fail()) {\n        FSTERROR() << \"STTableReader: Error reading file: \" << sources_[i];\n        error_ = true;\n        return;\n      }\n      heap_.push_back(i);\n    }\n    if (heap_.empty()) return;\n    std::make_heap(heap_.begin(), heap_.end(), *compare_);\n    PopHeap();\n  }\n\n  // Positions the stream with the lowest key at the top of the heap, sets\n  // current_ to the ID of that stream, and reads the current entry from that\n  // stream.\n  void PopHeap() {\n    std::pop_heap(heap_.begin(), heap_.end(), *compare_);\n    current_ = heap_.back();\n    entry_.reset(entry_reader_(*streams_[current_]));\n    if (!entry_) error_ = true;\n    if (streams_[current_]->fail()) {\n      FSTERROR() << \"STTableReader: Error reading entry for key: \"\n                 << keys_[current_] << \", file: \" << sources_[current_];\n      error_ = true;\n    }\n  }\n\n  Reader entry_reader_;\n  std::vector<std::istream *> streams_;        // Input streams.\n  std::vector<string> sources_;                // Corresponding file names.\n  std::vector<std::vector<int64_t>> positions_;  // Index of positions.\n  std::vector<string> keys_;  // Lowest unread key for each stream.\n  std::vector<int64_t> heap_;   // Heap containing ID of streams with unread keys.\n  int64_t current_;             // ID of current stream to be read.\n  std::unique_ptr<Compare> compare_;  // Functor comparing stream IDs.\n  mutable std::unique_ptr<T> entry_;  // The currently read entry.\n  bool error_;\n};\n\n// String-type table header reading function template on the entry header type.\n// The Header type must provide at least the following interface:\n//\n//   struct Header {\n//     void Read(std::istream &istrm, const string &filename);\n//   };\ntemplate <class Header>\nbool ReadSTTableHeader(const string &filename, Header *header) {\n  if (filename.empty()) {\n    LOG(ERROR) << \"ReadSTTable: Can't read header from standard input\";\n    return false;\n  }\n  std::ifstream strm(filename, std::ios_base::in | std::ios_base::binary);\n  if (!strm) {\n    LOG(ERROR) << \"ReadSTTableHeader: Could not open file: \" << filename;\n    return false;\n  }\n  int32_t magic_number = 0;\n  ReadType(strm, &magic_number);\n  int32_t file_version = 0;\n  ReadType(strm, &file_version);\n  if (magic_number != kSTTableMagicNumber) {\n    LOG(ERROR) << \"ReadSTTableHeader: Wrong file type: \" << filename;\n    return false;\n  }\n  if (file_version != kSTTableFileVersion) {\n    LOG(ERROR) << \"ReadSTTableHeader: Wrong file version: \" << filename;\n    return false;\n  }\n  int64_t i = -1;\n  strm.seekg(-static_cast<int>(sizeof(int64_t)), std::ios_base::end);\n  ReadType(strm, &i);  // Reads number of entries\n  if (strm.fail()) {\n    LOG(ERROR) << \"ReadSTTableHeader: Error reading file: \" << filename;\n    return false;\n  }\n  if (i == 0) return true;  // No entry header to read.\n  strm.seekg(-2 * static_cast<int>(sizeof(int64_t)), std::ios_base::end);\n  ReadType(strm, &i);  // Reads position for last entry in file.\n  strm.seekg(i);\n  string key;\n  ReadType(strm, &key);\n  header->Read(strm, filename + \":\" + key);\n  if (strm.fail()) {\n    LOG(ERROR) << \"ReadSTTableHeader: Error reading file: \" << filename;\n    return false;\n  }\n  return true;\n}\n\nbool IsSTTable(const string &filename);\n\n}  // namespace fst\n\n#endif  // FST_EXTENSIONS_FAR_STTABLE_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/extensions/linear/linear-fst-data-builder.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#ifndef FST_EXTENSIONS_LINEAR_LINEAR_FST_DATA_BUILDER_H_\n#define FST_EXTENSIONS_LINEAR_LINEAR_FST_DATA_BUILDER_H_\n\n#include <map>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <stack>\n#include <string>\n#include <vector>\n\n#include <fst/compat.h>\n#include <fst/log.h>\n#include <fst/fst.h>\n#include <fst/symbol-table.h>\n#include <fst/util.h>\n\n#include <fst/extensions/linear/linear-fst-data.h>\n\nnamespace fst {\n\n// Forward declaration\ntemplate <class A>\nclass FeatureGroupBuilder;\n\n// For logging purposes\ninline string TranslateLabel(int64_t label, const SymbolTable *syms);\ntemplate <class Iterator>\nstring JoinLabels(Iterator begin, Iterator end, const SymbolTable *syms);\ntemplate <class Label>\nstring JoinLabels(const std::vector<Label> &labels, const SymbolTable *syms);\n\n// Guesses the appropriate boundary label (start- or end-of-sentence)\n// for all labels equal to `boundary` and modifies the `sequence`\n// in-place. Returns the number of positions that are still uncertain.\ntemplate <class A>\ntypename A::Label GuessStartOrEnd(std::vector<typename A::Label> *sequence,\n                                  typename A::Label boundary);\n\n// Builds a `LinearFstData` object by adding words and feature\n// weights. A few conventions:\n//\n// - Input labels forms a dense non-empty range from 1 to `MaxInputLabel()`.\n// - Feature labels, output labels are > 0.\n// - Being a discriminative linear model, it only makes sense to use tropical\n// semirings.\ntemplate <class A>\nclass LinearFstDataBuilder {\n public:\n  typedef typename A::Label Label;\n  typedef typename A::Weight Weight;\n\n  // Constructs a builder with associated symbol tables for diagonstic\n  // output. Each of these symbol tables may also be nullptr.\n  explicit LinearFstDataBuilder(const SymbolTable *isyms = nullptr,\n                                const SymbolTable *fsyms = nullptr,\n                                const SymbolTable *osyms = nullptr)\n      : error_(false),\n        max_future_size_(0),\n        max_input_label_(1),\n        isyms_(isyms),\n        fsyms_(fsyms),\n        osyms_(osyms) {}\n\n  // Tests whether the builder has encountered any error. No operation\n  // is valid if the builder is already at error state. All other\n  // public methods should check this before any actual operations.\n  bool Error() const { return error_; }\n\n  // Adds a word and its feature labels to the vocabulary; this\n  // version allows the word to have any output label. Returns true\n  // iff the word is added.\n  //\n  // This may fail if the word is added twice or if the feature labels\n  // are non-positive.\n  bool AddWord(Label word, const std::vector<Label> &features);\n\n  // Adds a word and its feature labels to the vocabulary; this\n  // version puts constraint on possible output labels the word can\n  // have. `possible_output` must not be empty. Returns true iff the\n  // word is added.\n  //\n  // In addition to the reasons above in the two-parameter version,\n  // this may also fail if `possible_output` is empty or any output\n  // label in it is non-positive.\n  bool AddWord(Label word, const std::vector<Label> &word_features,\n               const std::vector<Label> &possible_output);\n\n  // Creates a new feature group with specified future size (size of\n  // the look-ahead window), returns the group id to be used for\n  // adding actual feature weights or a negative number when called at\n  // error state.\n  //\n  // This does not fail unless called at error state.\n  int AddGroup(size_t future_size);\n\n  // Adds an instance of feature weight to the specified feature\n  // group. If some weight has already been added with the same\n  // feature, the product of the old and new weights are\n  // stored. Returns true iff the weight is added. A weight is not\n  // added when the context has ill-formed context involving start-,\n  // end-of-sentence marks.\n  //\n  // For two features to be within the same group, it must satisfy\n  // that (1) they have the same future size; (2) the two either have\n  // disjoint context or one is the back-off context of the\n  // other. Furthermore, for all features in a single group, there\n  // must be one and only one other context (not necessarily an active\n  // feature) that the feature immediately backs off to (i.e. there is\n  // no other context that is the back-off of the first and backs off\n  // to the second).\n  //\n  // Consider for example features with zero look-ahead of the form\n  // (input, OUTPUT).\n  //\n  // - The following two features can be put in the same group because\n  // their context is disjoint: (a a a, A A), (b, B B);\n  //\n  // - The following two features can be put in the same group because\n  // one is the back-off context of the other: (a a a, A A), (a a, A\n  // A);\n  //\n  // - The following two features can NOT be put in the same group\n  // because there is overlap but neither is the other's back-off: (a\n  // a a, A), (a a, A A);\n  //\n  // - Finally, the following three features cannot be in a same group\n  // because the first one can immediately back off to either of the\n  // rest: (a a a, A A), (a a, A A), (a a a, A).\n  //\n  // The easiest way to satisfy the constraints is to create a feature\n  // group for each feature template. However, better feature grouping\n  // may help improve speed.\n  //\n  // This may fail if any of input or output labels are non-positive,\n  // or if any call to `FeatureGroupBuilder<>::AddWeight()` fails.\n  bool AddWeight(size_t group, const std::vector<Label> &input,\n                 const std::vector<Label> &output, Weight weight);\n\n  // Returns a newly created `LinearFstData` object or nullptr in case\n  // of failure. The caller takes the ownership of the memory. No\n  // other methods shall be called after this --- this is enforced by\n  // putting the builder at error state, even when a\n  // `LinearFstData<>` object is successfully built.\n  //\n  // This may fail if the call to any `FeatureGroupBuilder<>::Dump()`\n  // fails.\n  LinearFstData<A> *Dump();\n\n private:\n  bool error_;\n  CompactSet<Label, kNoLabel> all_output_labels_;\n  std::map<Label, std::set<Label>> word_output_map_, word_feat_map_;\n  std::map<Label, std::set<size_t>> feat_groups_;\n  std::vector<std::unique_ptr<FeatureGroupBuilder<A>>> groups_;\n  size_t max_future_size_;\n  Label max_input_label_;\n  const SymbolTable *isyms_, *fsyms_, *osyms_;\n\n  LinearFstDataBuilder(const LinearFstDataBuilder &) = delete;\n  LinearFstDataBuilder &operator=(const LinearFstDataBuilder &) = delete;\n};\n\n// Builds a LinearFstData tailored for a LinearClassifierFst. The\n// major difference between an ordinary LinearFstData that works on\n// taggers and a LinearFstData that works on classifiers is that\n// feature groups are divided into sections by the prediction class\n// label. For a prediction label `pred` and a logical group id\n// `group`, the actual group id is `group * num_classes + pred -\n// 1`.\n//\n// This layout saves us from recording output labels in each single\n// FeatureGroup. Because there is no need for any delaying, stripping\n// the output allows features with different shapes but using the same\n// set of feature label mapping to reside in a single FeatureGroup.\ntemplate <class A>\nclass LinearClassifierFstDataBuilder {\n public:\n  typedef typename A::Label Label;\n  typedef typename A::Weight Weight;\n\n  // Constructs a builder for a `num_classes`-class classifier,\n  // optinally with associated symbol tables for diagnostic\n  // output. The output labels (i.e. prediction) must be in the range\n  // of [1, num_classes].\n  explicit LinearClassifierFstDataBuilder(size_t num_classes,\n                                          const SymbolTable *isyms = nullptr,\n                                          const SymbolTable *fsyms = nullptr,\n                                          const SymbolTable *osyms = nullptr)\n      : error_(false),\n        num_classes_(num_classes),\n        num_groups_(0),\n        builder_(isyms, fsyms, osyms) {}\n\n  // Tests whether the builder has encountered any error. Similar to\n  // LinearFstDataBuilder<>::Error().\n  bool Error() const { return error_; }\n\n  // Same as LinearFstDataBuilder<>::AddWord().\n  bool AddWord(Label word, const std::vector<Label> &features);\n\n  // Adds a logical feature group. Similar to\n  // LinearFstDataBuilder<>::AddGroup(), with the exception that the\n  // returned group id is the logical group id. Also there is no need\n  // for \"future\" in a classifier.\n  int AddGroup();\n\n  // Adds an instance of feature weight to the specified logical\n  // feature group. Instead of a vector of output, only a single\n  // prediction is needed as the output.\n  //\n  // This may fail if `pred` is not in the range of [1, num_classes_].\n  bool AddWeight(size_t group, const std::vector<Label> &input, Label pred,\n                 Weight weight);\n\n  // Returns a newly created `LinearFstData` object or nullptr in case of\n  // failure.\n  LinearFstData<A> *Dump();\n\n private:\n  std::vector<Label> empty_;\n  bool error_;\n  size_t num_classes_, num_groups_;\n  LinearFstDataBuilder<A> builder_;\n};\n\n// Builds a single feature group. Usually used in\n// `LinearFstDataBuilder::AddWeight()`. See that method for the\n// constraints on grouping features.\ntemplate <class A>\nclass FeatureGroupBuilder {\n public:\n  typedef typename A::Label Label;\n  typedef typename A::Weight Weight;\n\n  // Constructs a builder with the given future size. All features\n  // added to the group will have look-ahead windows of this size.\n  FeatureGroupBuilder(size_t future_size, const SymbolTable *fsyms,\n                      const SymbolTable *osyms)\n      : error_(false), future_size_(future_size), fsyms_(fsyms), osyms_(osyms) {\n    // This edge is special; see doc of class `FeatureGroup` on the\n    // details.\n    start_ = trie_.Insert(trie_.Root(), InputOutputLabel(kNoLabel, kNoLabel));\n  }\n\n  // Tests whether the builder has encountered any error. No operation\n  // is valid if the builder is already at error state. All other\n  // public methods should check this before any actual operations.\n  bool Error() const { return error_; }\n\n  // Adds a feature weight with the given context. Returns true iff\n  // the weight is added. A weight is not added if it has ill-formed\n  // context involving start-, end-of-sentence marks.\n  //\n  // Note: `input` is the sequence of input\n  // features, instead of input labels themselves. `input` must be at\n  // least as long as `future_size`; `output` may be empty, but\n  // usually should be non-empty because an empty output context is\n  // useless in discriminative modelling. All labels in both `input`\n  // and `output` must be > 0 (this is checked in\n  // `LinearFstDataBuilder::AddWeight()`). See\n  // LinearFstDataBuilder<>::AddWeight for more details.\n  //\n  // This may fail if the input is smaller than the look-ahead window.\n  bool AddWeight(const std::vector<Label> &input,\n                 const std::vector<Label> &output, Weight weight);\n\n  // Creates an actual FeatureGroup<> object. Connects back-off links;\n  // pre-accumulates weights from back-off features. Returns nullptr if\n  // there is any violation in unique immediate back-off\n  // constraints.\n  //\n  // Regardless of whether the call succeeds or not, the error flag is\n  // always set before this returns, to prevent repeated dumping.\n  //\n  // TODO(wuke): check overlapping top-level contexts (see\n  // `DumpOverlappingContext()` in tests).\n  FeatureGroup<A> *Dump(size_t max_future_size);\n\n private:\n  typedef typename FeatureGroup<A>::InputOutputLabel InputOutputLabel;\n  typedef typename FeatureGroup<A>::InputOutputLabelHash InputOutputLabelHash;\n  typedef typename FeatureGroup<A>::WeightBackLink WeightBackLink;\n  // Nested trie topology uses more memory but we can traverse a\n  // node's children easily, which is required in `BuildBackLinks()`.\n  typedef NestedTrieTopology<InputOutputLabel, InputOutputLabelHash> Topology;\n  typedef MutableTrie<InputOutputLabel, WeightBackLink, Topology> Trie;\n\n  // Finds the first node with an arc with `label` following the\n  // back-off chain of `parent`. Returns the node index or\n  // `kNoTrieNodeId` when not found. The number of hops is stored in\n  // `hop` when it is not `nullptr`.\n  //\n  // This does not fail.\n  int FindFirstMatch(InputOutputLabel label, int parent, int *hop) const;\n\n  // Links each node to its immediate back-off. root is linked to -1.\n  //\n  // This may fail when the unique immediate back-off constraint is\n  // violated.\n  void BuildBackLinks();\n\n  // Traces back on the back-chain for each node to multiply the\n  // weights from back-offs to the node itself.\n  //\n  // This does not fail.\n  void PreAccumulateWeights();\n\n  // Reconstruct the path from trie root to given node for logging.\n  bool TrieDfs(const Topology &topology, int cur, int target,\n               std::vector<InputOutputLabel> *path) const;\n  string TriePath(int node, const Topology &topology) const;\n\n  bool error_;\n  size_t future_size_;\n  Trie trie_;\n  int start_;\n  const SymbolTable *fsyms_, *osyms_;\n\n  FeatureGroupBuilder(const FeatureGroupBuilder &) = delete;\n  FeatureGroupBuilder &operator=(const FeatureGroupBuilder &) = delete;\n};\n\n//\n// Implementation of methods in `LinearFstDataBuilder`\n//\ntemplate <class A>\nbool LinearFstDataBuilder<A>::AddWord(Label word,\n                                      const std::vector<Label> &features) {\n  if (error_) {\n    FSTERROR() << \"Calling LinearFstDataBuilder<>::AddWord() at error state\";\n    return false;\n  }\n  if (word == LinearFstData<A>::kStartOfSentence ||\n      word == LinearFstData<A>::kEndOfSentence) {\n    LOG(WARNING) << \"Ignored: adding boundary label: \"\n                 << TranslateLabel(word, isyms_)\n                 << \"(start-of-sentence=\" << LinearFstData<A>::kStartOfSentence\n                 << \", end-of-sentence=\" << LinearFstData<A>::kEndOfSentence\n                 << \")\";\n    return false;\n  }\n  if (word <= 0) {\n    error_ = true;\n    FSTERROR() << \"Word label must be > 0; got \" << word;\n    return false;\n  }\n  if (word > max_input_label_) max_input_label_ = word;\n  // Make sure the word hasn't been added before\n  if (word_feat_map_.find(word) != word_feat_map_.end()) {\n    error_ = true;\n    FSTERROR() << \"Input word \" << TranslateLabel(word, isyms_)\n               << \" is added twice\";\n    return false;\n  }\n  // Store features\n  std::set<Label> *feats = &word_feat_map_[word];\n  for (size_t i = 0; i < features.size(); ++i) {\n    Label feat = features[i];\n    if (feat <= 0) {\n      error_ = true;\n      FSTERROR() << \"Feature label must be > 0; got \" << feat;\n      return false;\n    }\n    feats->insert(feat);\n  }\n  return true;\n}\n\ntemplate <class A>\nbool LinearFstDataBuilder<A>::AddWord(\n    Label word, const std::vector<Label> &word_features,\n    const std::vector<Label> &possible_output) {\n  if (error_) {\n    FSTERROR() << \"Calling LinearFstDataBuilder<>::AddWord() at error state\";\n    return false;\n  }\n  if (!AddWord(word, word_features)) return false;\n  // Store possible output constraint\n  if (possible_output.empty()) {\n    error_ = true;\n    FSTERROR() << \"Empty possible output constraint; \"\n               << \"use the two-parameter version if no constraint is need.\";\n    return false;\n  }\n  std::set<Label> *outputs = &word_output_map_[word];\n  for (size_t i = 0; i < possible_output.size(); ++i) {\n    Label output = possible_output[i];\n    if (output == LinearFstData<A>::kStartOfSentence ||\n        output == LinearFstData<A>::kEndOfSentence) {\n      LOG(WARNING) << \"Ignored: word = \" << TranslateLabel(word, isyms_)\n                   << \": adding boundary label as possible output: \" << output\n                   << \"(start-of-sentence=\"\n                   << LinearFstData<A>::kStartOfSentence\n                   << \", end-of-sentence=\" << LinearFstData<A>::kEndOfSentence\n                   << \")\";\n      continue;\n    }\n    if (output <= 0) {\n      error_ = true;\n      FSTERROR() << \"Output label must be > 0; got \" << output;\n      return false;\n    }\n    outputs->insert(output);\n    all_output_labels_.Insert(output);\n  }\n  return true;\n}\n\ntemplate <class A>\ninline int LinearFstDataBuilder<A>::AddGroup(size_t future_size) {\n  if (error_) {\n    FSTERROR() << \"Calling LinearFstDataBuilder<>::AddGroup() at error state\";\n    return -1;\n  }\n  size_t ret = groups_.size();\n  groups_.emplace_back(new FeatureGroupBuilder<A>(future_size, fsyms_, osyms_));\n  if (future_size > max_future_size_) max_future_size_ = future_size;\n  return ret;\n}\n\ntemplate <class A>\nbool LinearFstDataBuilder<A>::AddWeight(size_t group,\n                                        const std::vector<Label> &input,\n                                        const std::vector<Label> &output,\n                                        Weight weight) {\n  if (error_) {\n    FSTERROR() << \"Calling LinearFstDataBuilder<>::AddWeight() at error state\";\n    return false;\n  }\n  // Check well-formedness of boundary marks on the input.\n  {\n    bool start_in_middle = false, end_in_middle = false;\n    for (int i = 1; i < input.size(); ++i) {\n      if (input[i] == LinearFstData<A>::kStartOfSentence &&\n          input[i - 1] != LinearFstData<A>::kStartOfSentence)\n        start_in_middle = true;\n      if (input[i - 1] == LinearFstData<A>::kEndOfSentence &&\n          input[i] != LinearFstData<A>::kEndOfSentence)\n        end_in_middle = true;\n    }\n    if (start_in_middle) {\n      LOG(WARNING) << \"Ignored: start-of-sentence in the middle of the input!\";\n      LOG(WARNING) << \"\\tInput: \" << JoinLabels(input, fsyms_);\n      LOG(WARNING) << \"\\tOutput: \" << JoinLabels(output, osyms_);\n      return false;\n    }\n    if (end_in_middle) {\n      LOG(WARNING) << \"Ignored: end-of-sentence in the middle of the input!\";\n      LOG(WARNING) << \"\\tInput: \" << JoinLabels(input, fsyms_);\n      LOG(WARNING) << \"\\tOutput: \" << JoinLabels(output, osyms_);\n      return false;\n    }\n  }\n  // Check well-formedness of boundary marks on the output.\n  {\n    bool non_first_start = false, non_last_end = false;\n    for (int i = 1; i < output.size(); ++i) {\n      if (output[i] == LinearFstData<A>::kStartOfSentence)\n        non_first_start = true;\n      if (output[i - 1] == LinearFstData<A>::kEndOfSentence)\n        non_last_end = true;\n    }\n    if (non_first_start) {\n      LOG(WARNING) << \"Ignored: start-of-sentence not appearing \"\n                   << \"as the first label in the output!\";\n      LOG(WARNING) << \"\\tInput: \" << JoinLabels(input, fsyms_);\n      LOG(WARNING) << \"\\tOutput: \" << JoinLabels(output, osyms_);\n      return false;\n    }\n    if (non_last_end) {\n      LOG(WARNING) << \"Ignored: end-of-sentence not appearing \"\n                   << \"as the last label in the output!\";\n      LOG(WARNING) << \"\\tInput: \" << JoinLabels(input, fsyms_);\n      LOG(WARNING) << \"\\tOutput: \" << JoinLabels(output, osyms_);\n      return false;\n    }\n  }\n\n  for (size_t i = 0; i < input.size(); ++i) {\n    Label feat = input[i];\n    if (feat != LinearFstData<A>::kStartOfSentence &&\n        feat != LinearFstData<A>::kEndOfSentence && feat <= 0) {\n      error_ = true;\n      FSTERROR() << \"Feature label must be > 0; got \" << feat;\n      return false;\n    }\n    feat_groups_[feat].insert(group);\n  }\n  for (size_t i = 0; i < output.size(); ++i) {\n    Label label = output[i];\n    if (label != LinearFstData<A>::kStartOfSentence &&\n        label != LinearFstData<A>::kEndOfSentence && label <= 0) {\n      error_ = true;\n      FSTERROR() << \"Output label must be > 0; got \" << label;\n      return false;\n    }\n    if (label != LinearFstData<A>::kStartOfSentence &&\n        label != LinearFstData<A>::kEndOfSentence)\n      all_output_labels_.Insert(label);\n  }\n\n  // Everything looks good at this point (more checks on the way in\n  // the feature group). Add this feature weight.\n  bool added = groups_[group]->AddWeight(input, output, weight);\n  if (groups_[group]->Error()) {\n    error_ = true;\n    FSTERROR() << \"FeatureGroupBuilder<>::AddWeight() failed\";\n    return false;\n  }\n  return added;\n}\n\ntemplate <class A>\nLinearFstData<A> *LinearFstDataBuilder<A>::Dump() {\n  if (error_) {\n    FSTERROR() << \"Calling LinearFstDataBuilder<>::Dump() at error state\";\n    return nullptr;\n  }\n\n  std::unique_ptr<LinearFstData<A>> data(new LinearFstData<A>());\n  data->max_future_size_ = max_future_size_;\n  data->max_input_label_ = max_input_label_;\n\n  // Feature groups; free builders after it's dumped.\n  data->groups_.resize(groups_.size());\n  for (int group = 0; group != groups_.size(); ++group) {\n    FeatureGroup<A> *new_group = groups_[group]->Dump(max_future_size_);\n    if (new_group == nullptr) {\n      error_ = true;\n      FSTERROR() << \"Error in dumping group \" << group;\n      return nullptr;\n    }\n    data->groups_[group].reset(new_group);\n    groups_[group].reset();\n    VLOG(1) << \"Group \" << group << \": \" << new_group->Stats();\n  }\n\n  // Per-group feature mapping\n  data->group_feat_map_.Init(data->NumGroups(), max_input_label_ + 1);\n  for (Label word = 1; word <= max_input_label_; ++word) {\n    typename std::map<Label, std::set<Label>>::const_iterator it =\n        word_feat_map_.find(word);\n    if (it == word_feat_map_.end()) continue;\n    for (typename std::set<Label>::const_iterator oit = it->second.begin();\n         oit != it->second.end(); ++oit) {\n      Label feat = *oit;\n      typename std::map<Label, std::set<size_t>>::const_iterator jt =\n          feat_groups_.find(feat);\n      if (jt == feat_groups_.end()) continue;\n      for (std::set<size_t>::const_iterator git = jt->second.begin();\n           git != jt->second.end(); ++git) {\n        size_t group_id = *git;\n        if (!data->group_feat_map_.Set(group_id, word, feat)) {\n          error_ = true;\n          return nullptr;\n        }\n      }\n    }\n  }\n\n  // Possible output labels\n  {\n    std::vector<typename LinearFstData<A>::InputAttribute> *input_attribs =\n        &data->input_attribs_;\n    std::vector<Label> *output_pool = &data->output_pool_;\n    input_attribs->resize(max_input_label_ + 1);\n    for (Label word = 0; word <= max_input_label_; ++word) {\n      typename std::map<Label, std::set<Label>>::const_iterator it =\n          word_output_map_.find(word);\n      if (it == word_output_map_.end()) {\n        (*input_attribs)[word].output_begin = 0;\n        (*input_attribs)[word].output_length = 0;\n      } else {\n        (*input_attribs)[word].output_begin = output_pool->size();\n        (*input_attribs)[word].output_length = it->second.size();\n        for (typename std::set<Label>::const_iterator oit = it->second.begin();\n             oit != it->second.end(); ++oit) {\n          Label olabel = *oit;\n          output_pool->push_back(olabel);\n        }\n      }\n    }\n  }\n\n  for (typename CompactSet<Label, kNoLabel>::const_iterator it =\n           all_output_labels_.Begin();\n       it != all_output_labels_.End(); ++it)\n    data->output_set_.push_back(*it);\n\n  error_ = true;  // prevent future calls on this object\n  return data.release();\n}\n\n//\n// Implementation of methods in `LinearClassifierFstDataBuilder`\n//\ntemplate <class A>\ninline bool LinearClassifierFstDataBuilder<A>::AddWord(\n    Label word, const std::vector<Label> &features) {\n  if (error_) {\n    FSTERROR() << \"Calling LinearClassifierFstDataBuilder<>::AddWord() at \"\n                  \"error state\";\n    return false;\n  }\n  bool added = builder_.AddWord(word, features);\n  if (builder_.Error()) error_ = true;\n  return added;\n}\n\ntemplate <class A>\ninline int LinearClassifierFstDataBuilder<A>::AddGroup() {\n  if (error_) {\n    FSTERROR() << \"Calling LinearClassifierFstDataBuilder<>::AddGroup() at \"\n                  \"error state\";\n    return -1;\n  }\n  for (int i = 0; i < num_classes_; ++i) builder_.AddGroup(0);\n  if (builder_.Error()) {\n    error_ = true;\n    return -1;\n  }\n  return num_groups_++;\n}\n\ntemplate <class A>\ninline bool LinearClassifierFstDataBuilder<A>::AddWeight(\n    size_t group, const std::vector<Label> &input, Label pred, Weight weight) {\n  if (error_) {\n    FSTERROR() << \"Calling LinearClassifierFstDataBuilder<>::AddWeight() at \"\n                  \"error state\";\n    return false;\n  }\n  if (pred <= 0 || pred > num_classes_) {\n    FSTERROR() << \"Out-of-range prediction label: \" << pred\n               << \" (num classes = \" << num_classes_ << \")\";\n    error_ = true;\n    return false;\n  }\n  size_t real_group = group * num_classes_ + pred - 1;\n  bool added = builder_.AddWeight(real_group, input, empty_, weight);\n  if (builder_.Error()) error_ = true;\n  return added;\n}\n\ntemplate <class A>\ninline LinearFstData<A> *LinearClassifierFstDataBuilder<A>::Dump() {\n  if (error_) {\n    FSTERROR()\n        << \"Calling LinearClassifierFstDataBuilder<>::Dump() at error state\";\n    return nullptr;\n  }\n  LinearFstData<A> *data = builder_.Dump();\n  error_ = true;\n  return data;\n}\n\n//\n// Implementation of methods in `FeatureGroupBuilder`\n//\ntemplate <class A>\nbool FeatureGroupBuilder<A>::AddWeight(const std::vector<Label> &input,\n                                       const std::vector<Label> &output,\n                                       Weight weight) {\n  if (error_) {\n    FSTERROR() << \"Calling FeatureGroupBuilder<>::AddWeight() at error state\";\n    return false;\n  }\n\n  // `LinearFstDataBuilder<>::AddWeight()` ensures prefix/suffix\n  // properties for us. We can directly count.\n  int num_input_start = 0;\n  while (num_input_start < input.size() &&\n         input[num_input_start] == LinearFstData<A>::kStartOfSentence)\n    ++num_input_start;\n  int num_output_start = 0;\n  while (num_output_start < output.size() &&\n         output[num_output_start] == LinearFstData<A>::kStartOfSentence)\n    ++num_output_start;\n  int num_input_end = 0;\n  for (int i = input.size() - 1;\n       i >= 0 && input[i] == LinearFstData<A>::kEndOfSentence; --i)\n    ++num_input_end;\n  int num_output_end = 0;\n  for (int i = output.size() - 1;\n       i >= 0 && output[i] == LinearFstData<A>::kEndOfSentence; --i)\n    ++num_output_end;\n\n  DCHECK_LE(num_output_end, 1);\n\n  if (input.size() - num_input_start < future_size_) {\n    LOG(WARNING) << \"Ignored: start-of-sentence in the future!\";\n    LOG(WARNING) << \"\\tInput: \" << JoinLabels(input, fsyms_);\n    LOG(WARNING) << \"\\tOutput: \" << JoinLabels(output, fsyms_);\n    return false;\n  }\n  if (num_input_start > 0 &&\n      input.size() - future_size_ - num_input_start <\n          output.size() - num_output_start) {\n    LOG(WARNING) << \"Ignored: matching start-of-sentence with actual output!\";\n    LOG(WARNING) << \"\\tInput: \" << JoinLabels(input, fsyms_);\n    LOG(WARNING) << \"\\tOutput: \" << JoinLabels(output, osyms_);\n    return false;\n  }\n  if (num_output_start > 0 &&\n      input.size() - future_size_ - num_input_start >\n          output.size() - num_output_start) {\n    LOG(WARNING) << \"Ignored: matching start-of-sentence with actual input!\";\n    LOG(WARNING) << \"\\tInput: \" << JoinLabels(input, fsyms_);\n    LOG(WARNING) << \"\\tOutput: \" << JoinLabels(output, osyms_);\n    return false;\n  }\n  // The following two require `num_output_end` <= 1.\n  if (num_input_end > future_size_ && num_input_end - future_size_ != 1) {\n    LOG(WARNING) << \"Ignored: matching end-of-sentence with actual output!\";\n    LOG(WARNING) << \"\\tInput: \" << JoinLabels(input, fsyms_);\n    LOG(WARNING) << \"\\tOutput: \" << JoinLabels(output, osyms_);\n    return false;\n  }\n  if (num_output_end > 0 &&\n      ((input.size() == future_size_ && future_size_ != num_input_end) ||\n       (input.size() > future_size_ &&\n        num_input_end != future_size_ + num_output_end))) {\n    LOG(WARNING) << \"Ignored: matching end-of-sentence with actual input!\";\n    LOG(WARNING) << \"\\tInput: \" << JoinLabels(input, fsyms_);\n    LOG(WARNING) << \"\\tOutput: \" << JoinLabels(output, osyms_);\n    return false;\n  }\n  // Check if the context has no other labels than boundary marks\n  // (such features are useless).\n  if (num_input_start + num_input_end == input.size() &&\n      num_output_start + num_output_end == output.size()) {\n    LOG(WARNING)\n        << \"Ignored: feature context consisting of only boundary marks!\";\n    LOG(WARNING) << \"\\tInput: \" << JoinLabels(input, fsyms_);\n    LOG(WARNING) << \"\\tOutput: \" << JoinLabels(output, osyms_);\n    return false;\n  }\n\n  // Start point for insertion in the trie. Insert at `start_` iff the\n  // beginning of the context is non-consumed start-of-sentence.\n  int cur = (num_input_start == 0 && num_output_start <= future_size_)\n                ? trie_.Root()\n                : start_;\n  // Skip all input start-of-sentence marks\n  size_t ipos = num_input_start;\n  // Skip to keep at most `future_size_` start-of-sentence marks\n  size_t opos =\n      num_output_start <= future_size_ ? 0 : num_output_start - future_size_;\n  // Skip `num_output_end` end-of-sentence marks on both input and output\n  size_t iend = !input.empty() ? input.size() - num_output_end : 0,\n         oend = output.size() - num_output_end;\n  // Further, when output is empty, keep at most `future_size_`\n  // end-of-sentence marks on input.\n  if (output.empty() && num_input_end > future_size_)\n    iend = input.size() - num_input_end + future_size_;\n\n  // Actual feature context is (input[ipos:iend], output[opos:oend]).\n\n  // Pad `kNoLabel` as don't cares on the shorter of actual `input`\n  // and `output`.\n  const size_t effective_input_size = iend - ipos,\n               effective_output_size = oend - opos;\n  if (effective_input_size > effective_output_size) {\n    for (size_t pad = effective_input_size - effective_output_size; pad != 0;\n         --pad, ++ipos)\n      cur = trie_.Insert(cur, InputOutputLabel(input[ipos], kNoLabel));\n  } else if (effective_input_size < effective_output_size) {\n    for (size_t pad = effective_output_size - effective_input_size; pad != 0;\n         --pad, ++opos)\n      cur = trie_.Insert(cur, InputOutputLabel(kNoLabel, output[opos]));\n  }\n  CHECK_EQ(iend - ipos, oend - opos);\n  for (; ipos != iend; ++ipos, ++opos)\n    cur = trie_.Insert(cur, InputOutputLabel(input[ipos], output[opos]));\n  // We only need to attach final weight when there is an output\n  // end-of-sentence. When there is only end-of-sentence on the input,\n  // they are all consumed as the end-of-sentence paddings from\n  // `LinearFstImpl<>::ShiftBuffer()`. `LinearFstImpl<>::Expand()`\n  // and `LinearFstImpl<>::MatchInput()` ensures no other\n  // transition takes place after consuming the padding.\n  if (num_output_end > 0 || (output.empty() && num_input_end > future_size_))\n    trie_[cur].final_weight = Times(trie_[cur].final_weight, weight);\n  else\n    trie_[cur].weight = Times(trie_[cur].weight, weight);\n\n  return true;\n}\n\ntemplate <class A>\nFeatureGroup<A> *FeatureGroupBuilder<A>::Dump(size_t max_future_size) {\n  if (error_) {\n    FSTERROR() << \"Calling FeatureGroupBuilder<>::PreAccumulateWeights() \"\n               << \"at error state\";\n    return nullptr;\n  }\n\n  if (max_future_size < future_size_) {\n    error_ = true;\n    FSTERROR() << \"max_future_size (= \" << max_future_size\n               << \") is smaller the builder's future_size (= \" << future_size_\n               << \")\";\n    return nullptr;\n  }\n\n  BuildBackLinks();\n  if (error_) return nullptr;\n  PreAccumulateWeights();  // does not fail\n\n  FeatureGroup<A> *ret =\n      new FeatureGroup<A>(max_future_size - future_size_, start_);\n\n  // Walk around the trie to compute next states\n  ret->next_state_.resize(trie_.NumNodes());\n  const Topology &topology = trie_.TrieTopology();\n  for (int i = 0; i < topology.NumNodes(); ++i) {\n    int next = i;\n    while (next != topology.Root() && topology.ChildrenOf(next).empty() &&\n           trie_[next].final_weight ==\n               trie_[trie_[next].back_link].final_weight)\n      next = trie_[next].back_link;\n    ret->next_state_[i] = next;\n  }\n\n  // Copy the trie\n  typename FeatureGroup<A>::Trie store_trie(trie_);\n  ret->trie_.swap(store_trie);\n\n  // Put the builder at error state to prevent repeated call of `Dump()`.\n  error_ = true;\n  return ret;\n}\n\ntemplate <class A>\nint FeatureGroupBuilder<A>::FindFirstMatch(InputOutputLabel label, int parent,\n                                           int *hop) const {\n  int hop_count = 0;\n  int ret = kNoTrieNodeId;\n  for (; parent >= 0; parent = trie_[parent].back_link, ++hop_count) {\n    int next = trie_.Find(parent, label);\n    if (next != kNoTrieNodeId) {\n      ret = next;\n      break;\n    }\n  }\n  if (hop != nullptr) *hop = hop_count;\n  return ret;\n}\n\ntemplate <class A>\nvoid FeatureGroupBuilder<A>::BuildBackLinks() {\n  // Breadth first search from the root. In the case where we only\n  // have the input label, the immedate back-off is simply the longest\n  // suffix of the current node that is also in the trie. For a node\n  // reached from its parent with label L, we can simply walk through\n  // the parent's back-off chain to find the first state with an arc\n  // of the same label L. The uniqueness is always\n  // guanranteed. However, in the case with both input and output\n  // labels, it is possible to back off by removing first labels from\n  // either side, which in general causes non-uniqueness.\n\n  const Topology &topology = trie_.TrieTopology();\n  std::queue<int> q;  // all enqueued or visited nodes have known links\n\n  // Note: nodes have back link initialized to -1 in their\n  // constructor.\n  q.push(trie_.Root());\n  while (!error_ && !q.empty()) {\n    int parent = q.front();\n    q.pop();\n    // Find links for every child\n    const typename Topology::NextMap &children = topology.ChildrenOf(parent);\n    for (typename Topology::NextMap::const_iterator eit = children.begin();\n         eit != children.end(); ++eit) {\n      const std::pair<InputOutputLabel, int> &edge = *eit;\n      InputOutputLabel label = edge.first;\n      int child = edge.second;\n      if (label.input == kNoLabel || label.output == kNoLabel) {\n        // Label pairs from root to here all have one and only one\n        // `kNoLabel` on the same side; equivalent to the\n        // \"longest-suffix\" case.\n        trie_[child].back_link =\n            FindFirstMatch(label, trie_[parent].back_link, nullptr);\n      } else {\n        // Neither side is `kNoLabel` at this point, there are\n        // three possible ways to back-off: if the parent backs\n        // off to some context with only one side non-empty, the\n        // empty side may remain empty; or else an exact match of\n        // both sides is needed. Try to find all three possible\n        // backs and look for the closest one (in terms of hops\n        // along the parent's back-off chain).\n        int only_input_hop, only_output_hop, full_hop;\n        int only_input_link =\n                FindFirstMatch(InputOutputLabel(label.input, kNoLabel), parent,\n                               &only_input_hop),\n            only_output_link =\n                FindFirstMatch(InputOutputLabel(kNoLabel, label.output), parent,\n                               &only_output_hop),\n            full_link =\n                FindFirstMatch(label, trie_[parent].back_link, &full_hop);\n        if (only_input_link != -1 && only_output_link != -1) {\n          error_ = true;\n          FSTERROR() << \"Branching back-off chain:\\n\"\n                     << \"\\tnode \" << child << \": \" << TriePath(child, topology)\n                     << \"\\n\"\n                     << \"\\tcan back-off to node \" << only_input_link << \": \"\n                     << TriePath(only_input_link, topology) << \"\\n\"\n                     << \"\\tcan back-off to node \" << only_output_link << \": \"\n                     << TriePath(only_output_link, topology);\n          return;\n        } else if (full_link != -1) {\n          ++full_hop;\n          if (full_hop <= only_input_hop && full_hop <= only_output_hop) {\n            trie_[child].back_link = full_link;\n          } else {\n            error_ = true;\n            int problem_link = only_input_link != kNoTrieNodeId\n                                   ? only_input_link\n                                   : only_output_link;\n            CHECK_NE(problem_link, kNoTrieNodeId);\n            FSTERROR() << \"Branching back-off chain:\\n\"\n                       << \"\\tnode \" << child << \": \"\n                       << TriePath(child, topology) << \"\\n\"\n                       << \"\\tcan back-off to node \" << full_link << \": \"\n                       << TriePath(full_link, topology) << \"\\n\"\n                       << \"tcan back-off to node \" << problem_link << \": \"\n                       << TriePath(problem_link, topology);\n            return;\n          }\n        } else {\n          trie_[child].back_link =\n              only_input_link != -1 ? only_input_link : only_output_link;\n        }\n      }\n      if (error_) break;\n      // Point to empty context (root) when no back-off can be found\n      if (trie_[child].back_link == -1) trie_[child].back_link = 0;\n      q.push(child);\n    }\n  }\n}\n\ntemplate <class A>\nvoid FeatureGroupBuilder<A>::PreAccumulateWeights() {\n  std::vector<bool> visited(trie_.NumNodes(), false);\n  visited[trie_.Root()] = true;\n\n  for (size_t i = 0; i != trie_.NumNodes(); ++i) {\n    std::stack<int> back_offs;\n    for (int j = i; !visited[j]; j = trie_[j].back_link) back_offs.push(j);\n    while (!back_offs.empty()) {\n      int j = back_offs.top();\n      back_offs.pop();\n      WeightBackLink &node = trie_[j];\n      node.weight = Times(node.weight, trie_[node.back_link].weight);\n      node.final_weight =\n          Times(node.final_weight, trie_[node.back_link].final_weight);\n      visited[j] = true;\n    }\n  }\n}\n\ntemplate <class A>\nbool FeatureGroupBuilder<A>::TrieDfs(\n    const Topology &topology, int cur, int target,\n    std::vector<InputOutputLabel> *path) const {\n  if (cur == target) return true;\n  const typename Topology::NextMap &children = topology.ChildrenOf(cur);\n  for (typename Topology::NextMap::const_iterator eit = children.begin();\n       eit != children.end(); ++eit) {\n    const std::pair<InputOutputLabel, int> &edge = *eit;\n    path->push_back(edge.first);\n    if (TrieDfs(topology, edge.second, target, path)) return true;\n    path->pop_back();\n  }\n  return false;\n}\n\ntemplate <class A>\nstring FeatureGroupBuilder<A>::TriePath(int node,\n                                        const Topology &topology) const {\n  std::vector<InputOutputLabel> labels;\n  TrieDfs(topology, topology.Root(), node, &labels);\n  bool first = true;\n  std::ostringstream strm;\n  for (typename std::vector<InputOutputLabel>::const_iterator it =\n           labels.begin();\n       it != labels.end(); ++it) {\n    InputOutputLabel i = *it;\n    if (first)\n      first = false;\n    else\n      strm << \", \";\n    strm << \"(\" << TranslateLabel(i.input, fsyms_) << \", \"\n         << TranslateLabel(i.output, osyms_) << \")\";\n  }\n  return strm.str();\n}\n\ninline string TranslateLabel(int64_t label, const SymbolTable *syms) {\n  string ret;\n  if (syms != nullptr) ret += syms->Find(label);\n  if (ret.empty()) {\n    std::ostringstream strm;\n    strm << '<' << label << '>';\n    ret = strm.str();\n  }\n  return ret;\n}\n\ntemplate <class Iterator>\nstring JoinLabels(Iterator begin, Iterator end, const SymbolTable *syms) {\n  if (begin == end) return \"<empty>\";\n  std::ostringstream strm;\n  bool first = true;\n  for (Iterator it = begin; it != end; ++it) {\n    if (first)\n      first = false;\n    else\n      strm << '|';\n    strm << TranslateLabel(*it, syms);\n  }\n  return strm.str();\n}\n\ntemplate <class Label>\nstring JoinLabels(const std::vector<Label> &labels, const SymbolTable *syms) {\n  return JoinLabels(labels.begin(), labels.end(), syms);\n}\n\ntemplate <class A>\ntypename A::Label GuessStartOrEnd(std::vector<typename A::Label> *sequence,\n                                  typename A::Label boundary) {\n  const size_t length = sequence->size();\n  std::vector<bool> non_boundary_on_left(length, false),\n      non_boundary_on_right(length, false);\n  for (size_t i = 1; i < length; ++i) {\n    non_boundary_on_left[i] =\n        non_boundary_on_left[i - 1] || (*sequence)[i - 1] != boundary;\n    non_boundary_on_right[length - 1 - i] = non_boundary_on_right[length - i] ||\n                                            (*sequence)[length - i] != boundary;\n  }\n  int unresolved = 0;\n  for (size_t i = 0; i < length; ++i) {\n    if ((*sequence)[i] != boundary) continue;\n    const bool left = non_boundary_on_left[i], right = non_boundary_on_right[i];\n    if (left && right) {\n      // Boundary in the middle\n      LOG(WARNING) << \"Boundary label in the middle of the sequence! position: \"\n                   << i << \"; boundary: \" << boundary\n                   << \"; sequence: \" << JoinLabels(*sequence, nullptr);\n      LOG(WARNING)\n          << \"This is an invalid sequence anyway so I will set it to start.\";\n      (*sequence)[i] = LinearFstData<A>::kStartOfSentence;\n    } else if (left && !right) {\n      // Can only be end\n      (*sequence)[i] = LinearFstData<A>::kEndOfSentence;\n    } else if (!left && right) {\n      // Can only be start\n      (*sequence)[i] = LinearFstData<A>::kStartOfSentence;\n    } else {\n      // !left && !right; can't really tell\n      ++unresolved;\n    }\n  }\n  return unresolved;\n}\n\n}  // namespace fst\n\n#endif  // FST_EXTENSIONS_LINEAR_LINEAR_FST_DATA_BUILDER_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/extensions/linear/linear-fst-data.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Data structures for storing and looking up the actual feature weights.\n\n#ifndef FST_EXTENSIONS_LINEAR_LINEAR_FST_DATA_H_\n#define FST_EXTENSIONS_LINEAR_LINEAR_FST_DATA_H_\n\n#include <memory>\n#include <numeric>\n#include <string>\n#include <utility>\n#include <vector>\n\n#include <fst/compat.h>\n#include <fst/fst.h>\n\n#include <fst/extensions/linear/trie.h>\n\nnamespace fst {\n\n// Forward declarations\ntemplate <class A>\nclass LinearFstDataBuilder;\ntemplate <class A>\nclass FeatureGroup;\n\n// Immutable data storage of the feature weights in a linear\n// model. Produces state tuples that represent internal states of a\n// LinearTaggerFst. Object of this class can only be constructed via\n// either `LinearFstDataBuilder::Dump()` or `LinearFstData::Read()`\n// and usually used as refcount'd object shared across mutiple\n// `LinearTaggerFst` copies.\n//\n// TODO(wuke): more efficient trie implementation\ntemplate <class A>\nclass LinearFstData {\n public:\n  friend class LinearFstDataBuilder<A>;  // For builder access\n\n  typedef typename A::Label Label;\n  typedef typename A::Weight Weight;\n\n  // Sentence boundary labels. Both of them are negative labels other\n  // than `kNoLabel`.\n  static const Label kStartOfSentence;\n  static const Label kEndOfSentence;\n\n  // Constructs empty data; for non-trivial ways of construction see\n  // `Read()` and `LinearFstDataBuilder`.\n  LinearFstData()\n      : max_future_size_(0), max_input_label_(1), input_attribs_(1) {}\n\n  // Appends the state tuple of the start state to `output`, where\n  // each tuple holds the node ids of a trie for each feature group.\n  void EncodeStartState(std::vector<Label> *output) const {\n    for (int i = 0; i < NumGroups(); ++i) output->push_back(GroupStartState(i));\n  }\n\n  // Takes a transition from the trie states stored in\n  // `(trie_state_begin, trie_state_end)` with input label `ilabel`\n  // and output label `olabel`; appends the destination state tuple to\n  // `next` and multiplies the weight of the transition onto\n  // `weight`. `next` should be the shifted input buffer of the caller\n  // in `LinearTaggerFstImpl` (i.e. of size `LinearTaggerFstImpl::delay_`;\n  // the last element is `ilabel`).\n  template <class Iterator>\n  void TakeTransition(Iterator buffer_end, Iterator trie_state_begin,\n                      Iterator trie_state_end, Label ilabel, Label olabel,\n                      std::vector<Label> *next, Weight *weight) const;\n\n  // Returns the final weight of the given trie state sequence.\n  template <class Iterator>\n  Weight FinalWeight(Iterator trie_state_begin, Iterator trie_state_end) const;\n\n  // Returns the start trie state of the given group.\n  Label GroupStartState(int group_id) const {\n    return groups_[group_id]->Start();\n  }\n\n  // Takes a transition only within the given group. Returns the\n  // destination trie state and multiplies the weight onto `weight`.\n  Label GroupTransition(int group_id, int trie_state, Label ilabel,\n                        Label olabel, Weight *weight) const;\n\n  // Returns the final weight of the given trie state in the given group.\n  Weight GroupFinalWeight(int group_id, int trie_state) const {\n    return groups_[group_id]->FinalWeight(trie_state);\n  }\n\n  Label MinInputLabel() const { return 1; }\n\n  Label MaxInputLabel() const { return max_input_label_; }\n\n  // Returns the maximum future size of all feature groups. Future is\n  // the look-ahead window of a feature, e.g. if a feature looks at\n  // the next 2 words after the current input, then the future size is\n  // 2. There is no look-ahead for output. Features inside a single\n  // `FeatureGroup` must have equal future size.\n  size_t MaxFutureSize() const { return max_future_size_; }\n\n  // Returns the number of feature groups\n  size_t NumGroups() const { return groups_.size(); }\n\n  // Returns the range of possible output labels for an input label.\n  std::pair<typename std::vector<Label>::const_iterator,\n            typename std::vector<Label>::const_iterator>\n  PossibleOutputLabels(Label word) const;\n\n  static LinearFstData<A> *Read(std::istream &strm);  // NOLINT\n  std::ostream &Write(std::ostream &strm) const;      // NOLINT\n\n private:\n  // Offsets in `output_pool_`\n  struct InputAttribute {\n    size_t output_begin, output_length;\n\n    std::istream &Read(std::istream &strm);         // NOLINT\n    std::ostream &Write(std::ostream &strm) const;  // NOLINT\n  };\n\n  // Mapping from input label to per-group feature label\n  class GroupFeatureMap;\n\n  // Translates the input label into input feature label of group\n  // `group`; returns `kNoLabel` when there is no feature for that\n  // group.\n  Label FindFeature(size_t group, Label word) const;\n\n  size_t max_future_size_;\n  Label max_input_label_;\n  std::vector<std::unique_ptr<const FeatureGroup<A>>> groups_;\n  std::vector<InputAttribute> input_attribs_;\n  std::vector<Label> output_pool_, output_set_;\n  GroupFeatureMap group_feat_map_;\n\n  LinearFstData(const LinearFstData &) = delete;\n  LinearFstData &operator=(const LinearFstData &) = delete;\n};\n\ntemplate <class A>\nconst typename A::Label LinearFstData<A>::kStartOfSentence = -3;\ntemplate <class A>\nconst typename A::Label LinearFstData<A>::kEndOfSentence = -2;\n\ntemplate <class A>\ntemplate <class Iterator>\nvoid LinearFstData<A>::TakeTransition(Iterator buffer_end,\n                                      Iterator trie_state_begin,\n                                      Iterator trie_state_end, Label ilabel,\n                                      Label olabel, std::vector<Label> *next,\n                                      Weight *weight) const {\n  DCHECK_EQ(trie_state_end - trie_state_begin, groups_.size());\n  DCHECK(ilabel > 0 || ilabel == kEndOfSentence);\n  DCHECK(olabel > 0 || olabel == kStartOfSentence);\n  size_t group_id = 0;\n  for (Iterator it = trie_state_begin; it != trie_state_end; ++it, ++group_id) {\n    size_t delay = groups_[group_id]->Delay();\n    // On the buffer, there may also be `kStartOfSentence` from the\n    // initial empty buffer.\n    Label real_ilabel = delay == 0 ? ilabel : *(buffer_end - delay);\n    next->push_back(\n        GroupTransition(group_id, *it, real_ilabel, olabel, weight));\n  }\n}\n\ntemplate <class A>\ntypename A::Label LinearFstData<A>::GroupTransition(int group_id,\n                                                    int trie_state,\n                                                    Label ilabel, Label olabel,\n                                                    Weight *weight) const {\n  Label group_ilabel = FindFeature(group_id, ilabel);\n  return groups_[group_id]->Walk(trie_state, group_ilabel, olabel, weight);\n}\n\ntemplate <class A>\ntemplate <class Iterator>\ninline typename A::Weight LinearFstData<A>::FinalWeight(\n    Iterator trie_state_begin, Iterator trie_state_end) const {\n  DCHECK_EQ(trie_state_end - trie_state_begin, groups_.size());\n  size_t group_id = 0;\n  Weight accum = Weight::One();\n  for (Iterator it = trie_state_begin; it != trie_state_end; ++it, ++group_id)\n    accum = Times(accum, GroupFinalWeight(group_id, *it));\n  return accum;\n}\n\ntemplate <class A>\ninline std::pair<typename std::vector<typename A::Label>::const_iterator,\n                 typename std::vector<typename A::Label>::const_iterator>\nLinearFstData<A>::PossibleOutputLabels(Label word) const {\n  const InputAttribute &attrib = input_attribs_[word];\n  if (attrib.output_length == 0)\n    return std::make_pair(output_set_.begin(), output_set_.end());\n  else\n    return std::make_pair(\n        output_pool_.begin() + attrib.output_begin,\n        output_pool_.begin() + attrib.output_begin + attrib.output_length);\n}\n\ntemplate <class A>\ninline LinearFstData<A> *LinearFstData<A>::Read(std::istream &strm) {  // NOLINT\n  std::unique_ptr<LinearFstData<A>> data(new LinearFstData<A>());\n  ReadType(strm, &(data->max_future_size_));\n  ReadType(strm, &(data->max_input_label_));\n  // Feature groups\n  size_t num_groups = 0;\n  ReadType(strm, &num_groups);\n  data->groups_.resize(num_groups);\n  for (size_t i = 0; i < num_groups; ++i)\n    data->groups_[i].reset(FeatureGroup<A>::Read(strm));\n  // Other data\n  ReadType(strm, &(data->input_attribs_));\n  ReadType(strm, &(data->output_pool_));\n  ReadType(strm, &(data->output_set_));\n  ReadType(strm, &(data->group_feat_map_));\n  if (strm) {\n    return data.release();\n  } else {\n    return nullptr;\n  }\n}\n\ntemplate <class A>\ninline std::ostream &LinearFstData<A>::Write(\n    std::ostream &strm) const {  // NOLINT\n  WriteType(strm, max_future_size_);\n  WriteType(strm, max_input_label_);\n  // Feature groups\n  WriteType(strm, groups_.size());\n  for (size_t i = 0; i < groups_.size(); ++i) {\n    groups_[i]->Write(strm);\n  }\n  // Other data\n  WriteType(strm, input_attribs_);\n  WriteType(strm, output_pool_);\n  WriteType(strm, output_set_);\n  WriteType(strm, group_feat_map_);\n  return strm;\n}\n\ntemplate <class A>\ntypename A::Label LinearFstData<A>::FindFeature(size_t group,\n                                                Label word) const {\n  DCHECK(word > 0 || word == kStartOfSentence || word == kEndOfSentence);\n  if (word == kStartOfSentence || word == kEndOfSentence)\n    return word;\n  else\n    return group_feat_map_.Find(group, word);\n}\n\ntemplate <class A>\ninline std::istream &LinearFstData<A>::InputAttribute::Read(\n    std::istream &strm) {  // NOLINT\n  ReadType(strm, &output_begin);\n  ReadType(strm, &output_length);\n  return strm;\n}\n\ntemplate <class A>\ninline std::ostream &LinearFstData<A>::InputAttribute::Write(\n    std::ostream &strm) const {  // NOLINT\n  WriteType(strm, output_begin);\n  WriteType(strm, output_length);\n  return strm;\n}\n\n// Forward declaration\ntemplate <class A>\nclass FeatureGroupBuilder;\n\n// An immutable grouping of features with similar context shape. Like\n// `LinearFstData`, this can only be constructed via `Read()` or\n// via its builder.\n//\n// Internally it uses a trie to store all feature n-grams and their\n// weights. The label of a trie edge is a pair (feat, olabel) of\n// labels. They can be either positive (ordinary label), `kNoLabel`,\n// `kStartOfSentence`, or `kEndOfSentence`. `kNoLabel` usually means\n// matching anything, with one exception: from the root of the trie,\n// there is a special (kNoLabel, kNoLabel) that leads to the implicit\n// start-of-sentence state. This edge is never actually matched\n// (`FindFirstMatch()` ensures this).\ntemplate <class A>\nclass FeatureGroup {\n public:\n  friend class FeatureGroupBuilder<A>;  // for builder access\n\n  typedef typename A::Label Label;\n  typedef typename A::Weight Weight;\n\n  int Start() const { return start_; }\n\n  // Finds destination node from `cur` by consuming `ilabel` and\n  // `olabel`. The transition weight is multiplied onto `weight`.\n  int Walk(int cur, Label ilabel, Label olabel, Weight *weight) const;\n\n  // Returns the final weight of the current trie state. Only valid if\n  // the state is already known to be part of a final state (see\n  // `LinearFstData<>::CanBeFinal()`).\n  Weight FinalWeight(int trie_state) const {\n    return trie_[trie_state].final_weight;\n  }\n\n  static FeatureGroup<A> *Read(std::istream &strm) {  // NOLINT\n    size_t delay;\n    ReadType(strm, &delay);\n    int start;\n    ReadType(strm, &start);\n    Trie trie;\n    ReadType(strm, &trie);\n    std::unique_ptr<FeatureGroup<A>> ret(new FeatureGroup<A>(delay, start));\n    ret->trie_.swap(trie);\n    ReadType(strm, &ret->next_state_);\n    if (strm) {\n      return ret.release();\n    } else {\n      return nullptr;\n    }\n  }\n\n  std::ostream &Write(std::ostream &strm) const {  // NOLINT\n    WriteType(strm, delay_);\n    WriteType(strm, start_);\n    WriteType(strm, trie_);\n    WriteType(strm, next_state_);\n    return strm;\n  }\n\n  size_t Delay() const { return delay_; }\n\n  string Stats() const;\n\n private:\n  // Label along the arcs on the trie. `kNoLabel` means anything\n  // (non-negative label) can match; both sides holding `kNoLabel`\n  // is not allow; otherwise the label is > 0 (enforced by\n  // `LinearFstDataBuilder::AddWeight()`).\n  struct InputOutputLabel;\n  struct InputOutputLabelHash;\n\n  // Data to be stored on the trie\n  struct WeightBackLink {\n    int back_link;\n    Weight weight, final_weight;\n\n    WeightBackLink()\n        : back_link(kNoTrieNodeId),\n          weight(Weight::One()),\n          final_weight(Weight::One()) {}\n\n    std::istream &Read(std::istream &strm) {  // NOLINT\n      ReadType(strm, &back_link);\n      ReadType(strm, &weight);\n      ReadType(strm, &final_weight);\n      return strm;\n    }\n\n    std::ostream &Write(std::ostream &strm) const {  // NOLINT\n      WriteType(strm, back_link);\n      WriteType(strm, weight);\n      WriteType(strm, final_weight);\n      return strm;\n    }\n  };\n\n  typedef FlatTrieTopology<InputOutputLabel, InputOutputLabelHash> Topology;\n  typedef MutableTrie<InputOutputLabel, WeightBackLink, Topology> Trie;\n\n  explicit FeatureGroup(size_t delay, int start)\n      : delay_(delay), start_(start) {}\n\n  // Finds the first node with an arc with `label` following the\n  // back-off chain of `parent`. Returns the node index or\n  // `kNoTrieNodeId` when not found.\n  int FindFirstMatch(InputOutputLabel label, int parent) const;\n\n  size_t delay_;\n  int start_;\n  Trie trie_;\n  // Where to go after hitting this state. When we reach a state with\n  // no child and with no additional final weight (i.e. its final\n  // weight is the same as its back-off), we can immediately go to its\n  // back-off state.\n  std::vector<int> next_state_;\n\n  FeatureGroup(const FeatureGroup &) = delete;\n  FeatureGroup &operator=(const FeatureGroup &) = delete;\n};\n\ntemplate <class A>\nstruct FeatureGroup<A>::InputOutputLabel {\n  Label input, output;\n\n  InputOutputLabel(Label i = kNoLabel, Label o = kNoLabel)\n      : input(i), output(o) {}\n\n  bool operator==(InputOutputLabel that) const {\n    return input == that.input && output == that.output;\n  }\n\n  std::istream &Read(std::istream &strm) {  // NOLINT\n    ReadType(strm, &input);\n    ReadType(strm, &output);\n    return strm;\n  }\n\n  std::ostream &Write(std::ostream &strm) const {  // NOLINT\n    WriteType(strm, input);\n    WriteType(strm, output);\n    return strm;\n  }\n};\n\ntemplate <class A>\nstruct FeatureGroup<A>::InputOutputLabelHash {\n  size_t operator()(InputOutputLabel label) const {\n    return static_cast<size_t>(label.input * 7853 + label.output);\n  }\n};\n\ntemplate <class A>\nint FeatureGroup<A>::Walk(int cur, Label ilabel, Label olabel,\n                          Weight *weight) const {\n  // Note: user of this method need to ensure `ilabel` and `olabel`\n  // are valid (e.g. see DCHECKs in\n  // `LinearFstData<>::TakeTransition()` and\n  // `LinearFstData<>::FindFeature()`).\n  int next;\n  if (ilabel == LinearFstData<A>::kStartOfSentence) {\n    // An observed start-of-sentence only occurs in the beginning of\n    // the input, when this feature group is delayed (i.e. there is\n    // another feature group with a larger future size). The actual\n    // input hasn't arrived so stay at the start state.\n    DCHECK_EQ(cur, start_);\n    next = start_;\n  } else {\n    // First, try exact match\n    next = FindFirstMatch(InputOutputLabel(ilabel, olabel), cur);\n    // Then try with don't cares\n    if (next == kNoTrieNodeId)\n      next = FindFirstMatch(InputOutputLabel(ilabel, kNoLabel), cur);\n    if (next == kNoTrieNodeId)\n      next = FindFirstMatch(InputOutputLabel(kNoLabel, olabel), cur);\n    // All failed, go to empty context\n    if (next == kNoTrieNodeId) next = trie_.Root();\n    *weight = Times(*weight, trie_[next].weight);\n    next = next_state_[next];\n  }\n  return next;\n}\n\ntemplate <class A>\ninline int FeatureGroup<A>::FindFirstMatch(InputOutputLabel label,\n                                           int parent) const {\n  if (label.input == kNoLabel && label.output == kNoLabel)\n    return kNoTrieNodeId;  // very important; see class doc.\n  for (; parent != kNoTrieNodeId; parent = trie_[parent].back_link) {\n    int next = trie_.Find(parent, label);\n    if (next != kNoTrieNodeId) return next;\n  }\n  return kNoTrieNodeId;\n}\n\ntemplate <class A>\ninline string FeatureGroup<A>::Stats() const {\n  std::ostringstream strm;\n  int num_states = 2;\n  for (int i = 2; i < next_state_.size(); ++i)\n    num_states += i == next_state_[i];\n  strm << trie_.NumNodes() << \" node(s); \" << num_states << \" state(s)\";\n  return strm.str();\n}\n\ntemplate <class A>\nclass LinearFstData<A>::GroupFeatureMap {\n public:\n  GroupFeatureMap() {}\n\n  void Init(size_t num_groups, size_t num_words) {\n    num_groups_ = num_groups;\n    pool_.clear();\n    pool_.resize(num_groups * num_words, kNoLabel);\n  }\n\n  Label Find(size_t group_id, Label ilabel) const {\n    return pool_[IndexOf(group_id, ilabel)];\n  }\n\n  bool Set(size_t group_id, Label ilabel, Label feat) {\n    size_t i = IndexOf(group_id, ilabel);\n    if (pool_[i] != kNoLabel && pool_[i] != feat) {\n      FSTERROR() << \"Feature group \" << group_id\n                 << \" already has feature for word \" << ilabel;\n      return false;\n    }\n    pool_[i] = feat;\n    return true;\n  }\n\n  std::istream &Read(std::istream &strm) {  // NOLINT\n    ReadType(strm, &num_groups_);\n    ReadType(strm, &pool_);\n    return strm;\n  }\n\n  std::ostream &Write(std::ostream &strm) const {  // NOLINT\n    WriteType(strm, num_groups_);\n    WriteType(strm, pool_);\n    return strm;\n  }\n\n private:\n  size_t IndexOf(size_t group_id, Label ilabel) const {\n    return ilabel * num_groups_ + group_id;\n  }\n\n  size_t num_groups_;\n  // `pool_[ilabel * num_groups_ + group_id]` is the feature active\n  // for group `group_id` with input `ilabel`\n  std::vector<Label> pool_;\n};\n\n}  // namespace fst\n\n#endif  // FST_EXTENSIONS_LINEAR_LINEAR_FST_DATA_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/extensions/linear/linear-fst.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Classes for building, storing and representing log-linear models as FSTs.\n\n#ifndef FST_EXTENSIONS_LINEAR_LINEAR_FST_H_\n#define FST_EXTENSIONS_LINEAR_LINEAR_FST_H_\n\n#include <algorithm>\n#include <iostream>\n#include <memory>\n#include <vector>\n\n#include <fst/compat.h>\n#include <fst/log.h>\n#include <fst/extensions/pdt/collection.h>\n#include <fst/bi-table.h>\n#include <fst/cache.h>\n#include <fstream>\n#include <fst/fst.h>\n#include <fst/matcher.h>\n#include <fst/symbol-table.h>\n\n#include <fst/extensions/linear/linear-fst-data.h>\n\nnamespace fst {\n\n// Forward declaration of the specialized matcher for both\n// LinearTaggerFst and LinearClassifierFst.\ntemplate <class F>\nclass LinearFstMatcherTpl;\n\nnamespace internal {\n\n// Implementation class for on-the-fly generated LinearTaggerFst with\n// special optimization in matching.\ntemplate <class A>\nclass LinearTaggerFstImpl : public CacheImpl<A> {\n public:\n  using FstImpl<A>::SetType;\n  using FstImpl<A>::SetProperties;\n  using FstImpl<A>::SetInputSymbols;\n  using FstImpl<A>::SetOutputSymbols;\n  using FstImpl<A>::WriteHeader;\n\n  using CacheBaseImpl<CacheState<A>>::PushArc;\n  using CacheBaseImpl<CacheState<A>>::HasArcs;\n  using CacheBaseImpl<CacheState<A>>::HasFinal;\n  using CacheBaseImpl<CacheState<A>>::HasStart;\n  using CacheBaseImpl<CacheState<A>>::SetArcs;\n  using CacheBaseImpl<CacheState<A>>::SetFinal;\n  using CacheBaseImpl<CacheState<A>>::SetStart;\n\n  typedef A Arc;\n  typedef typename A::Label Label;\n  typedef typename A::Weight Weight;\n  typedef typename A::StateId StateId;\n  typedef typename Collection<StateId, Label>::SetIterator NGramIterator;\n\n  // Constructs an empty FST by default.\n  LinearTaggerFstImpl()\n      : CacheImpl<A>(CacheOptions()),\n        data_(std::make_shared<LinearFstData<A>>()),\n        delay_(0) {\n    SetType(\"linear-tagger\");\n  }\n\n  // Constructs the FST with given data storage and symbol\n  // tables.\n  //\n  // TODO(wuke): when there is no constraint on output we can delay\n  // less than `data->MaxFutureSize` positions.\n  LinearTaggerFstImpl(const LinearFstData<Arc> *data, const SymbolTable *isyms,\n                      const SymbolTable *osyms, CacheOptions opts)\n      : CacheImpl<A>(opts), data_(data), delay_(data->MaxFutureSize()) {\n    SetType(\"linear-tagger\");\n    SetProperties(kILabelSorted, kFstProperties);\n    SetInputSymbols(isyms);\n    SetOutputSymbols(osyms);\n    ReserveStubSpace();\n  }\n\n  // Copy by sharing the underlying data storage.\n  LinearTaggerFstImpl(const LinearTaggerFstImpl &impl)\n      : CacheImpl<A>(impl), data_(impl.data_), delay_(impl.delay_) {\n    SetType(\"linear-tagger\");\n    SetProperties(impl.Properties(), kCopyProperties);\n    SetInputSymbols(impl.InputSymbols());\n    SetOutputSymbols(impl.OutputSymbols());\n    ReserveStubSpace();\n  }\n\n  StateId Start() {\n    if (!HasStart()) {\n      StateId start = FindStartState();\n      SetStart(start);\n    }\n    return CacheImpl<A>::Start();\n  }\n\n  Weight Final(StateId s) {\n    if (!HasFinal(s)) {\n      state_stub_.clear();\n      FillState(s, &state_stub_);\n      if (CanBeFinal(state_stub_))\n        SetFinal(s, data_->FinalWeight(InternalBegin(state_stub_),\n                                       InternalEnd(state_stub_)));\n      else\n        SetFinal(s, Weight::Zero());\n    }\n    return CacheImpl<A>::Final(s);\n  }\n\n  size_t NumArcs(StateId s) {\n    if (!HasArcs(s)) Expand(s);\n    return CacheImpl<A>::NumArcs(s);\n  }\n\n  size_t NumInputEpsilons(StateId s) {\n    if (!HasArcs(s)) Expand(s);\n    return CacheImpl<A>::NumInputEpsilons(s);\n  }\n\n  size_t NumOutputEpsilons(StateId s) {\n    if (!HasArcs(s)) Expand(s);\n    return CacheImpl<A>::NumOutputEpsilons(s);\n  }\n\n  void InitArcIterator(StateId s, ArcIteratorData<A> *data) {\n    if (!HasArcs(s)) Expand(s);\n    CacheImpl<A>::InitArcIterator(s, data);\n  }\n\n  // Computes the outgoing transitions from a state, creating new\n  // destination states as needed.\n  void Expand(StateId s);\n\n  // Appends to `arcs` all out-going arcs from state `s` that matches `label` as\n  // the input label.\n  void MatchInput(StateId s, Label ilabel, std::vector<Arc> *arcs);\n\n  static LinearTaggerFstImpl *Read(std::istream &strm,\n                                   const FstReadOptions &opts);\n\n  bool Write(std::ostream &strm,  // NOLINT\n             const FstWriteOptions &opts) const {\n    FstHeader header;\n    header.SetStart(kNoStateId);\n    WriteHeader(strm, opts, kFileVersion, &header);\n    data_->Write(strm);\n    if (!strm) {\n      LOG(ERROR) << \"LinearTaggerFst::Write: Write failed: \" << opts.source;\n      return false;\n    }\n    return true;\n  }\n\n private:\n  static const int kMinFileVersion;\n  static const int kFileVersion;\n\n  // A collection of functions to access parts of the state tuple. A\n  // state tuple is a vector of `Label`s with two parts:\n  //   [buffer] [internal].\n  //\n  // - [buffer] is a buffer of observed input labels with length\n  // `delay_`. `LinearFstData<A>::kStartOfSentence`\n  // (resp. `LinearFstData<A>::kEndOfSentence`) are used as\n  // paddings when the buffer has fewer than `delay_` elements, which\n  // can only appear as the prefix (resp. suffix) of the buffer.\n  //\n  // - [internal] is the internal state tuple for `LinearFstData`\n  typename std::vector<Label>::const_iterator BufferBegin(\n      const std::vector<Label> &state) const {\n    return state.begin();\n  }\n\n  typename std::vector<Label>::const_iterator BufferEnd(\n      const std::vector<Label> &state) const {\n    return state.begin() + delay_;\n  }\n\n  typename std::vector<Label>::const_iterator InternalBegin(\n      const std::vector<Label> &state) const {\n    return state.begin() + delay_;\n  }\n\n  typename std::vector<Label>::const_iterator InternalEnd(\n      const std::vector<Label> &state) const {\n    return state.end();\n  }\n\n  // The size of state tuples are fixed, reserve them in stubs\n  void ReserveStubSpace() {\n    state_stub_.reserve(delay_ + data_->NumGroups());\n    next_stub_.reserve(delay_ + data_->NumGroups());\n  }\n\n  // Computes the start state tuple and maps it to the start state id.\n  StateId FindStartState() {\n    // Empty buffer with start-of-sentence paddings\n    state_stub_.clear();\n    state_stub_.resize(delay_, LinearFstData<A>::kStartOfSentence);\n    // Append internal states\n    data_->EncodeStartState(&state_stub_);\n    return FindState(state_stub_);\n  }\n\n  // Tests whether the buffer in `(begin, end)` is empty.\n  bool IsEmptyBuffer(typename std::vector<Label>::const_iterator begin,\n                     typename std::vector<Label>::const_iterator end) const {\n    // The following is guanranteed by `ShiftBuffer()`:\n    // - buffer[i] == LinearFstData<A>::kEndOfSentence =>\n    //       buffer[i+x] == LinearFstData<A>::kEndOfSentence\n    // - buffer[i] == LinearFstData<A>::kStartOfSentence =>\n    //       buffer[i-x] == LinearFstData<A>::kStartOfSentence\n    return delay_ == 0 || *(end - 1) == LinearFstData<A>::kStartOfSentence ||\n           *begin == LinearFstData<A>::kEndOfSentence;\n  }\n\n  // Tests whether the given state tuple can be a final state. A state\n  // is final iff there is no observed input in the buffer.\n  bool CanBeFinal(const std::vector<Label> &state) {\n    return IsEmptyBuffer(BufferBegin(state), BufferEnd(state));\n  }\n\n  // Finds state corresponding to an n-gram. Creates new state if n-gram not\n  // found.\n  StateId FindState(const std::vector<Label> &ngram) {\n    StateId sparse = ngrams_.FindId(ngram, true);\n    StateId dense = condensed_.FindId(sparse, true);\n    return dense;\n  }\n\n  // Appends after `output` the state tuple corresponding to the state id. The\n  // state id must exist.\n  void FillState(StateId s, std::vector<Label> *output) {\n    s = condensed_.FindEntry(s);\n    for (NGramIterator it = ngrams_.FindSet(s); !it.Done(); it.Next()) {\n      Label label = it.Element();\n      output->push_back(label);\n    }\n  }\n\n  // Shifts the buffer in `state` by appending `ilabel` and popping\n  // the one in the front as the return value. `next_stub_` is a\n  // shifted buffer of size `delay_` where the first `delay_ - 1`\n  // elements are the last `delay_ - 1` elements in the buffer of\n  // `state`. The last (if any) element in `next_stub_` will be\n  // `ilabel` after the call returns.\n  Label ShiftBuffer(const std::vector<Label> &state, Label ilabel,\n                    std::vector<Label> *next_stub_);\n\n  // Builds an arc from state tuple `state` consuming `ilabel` and\n  // `olabel`. `next_stub_` is the buffer filled in `ShiftBuffer`.\n  Arc MakeArc(const std::vector<Label> &state, Label ilabel, Label olabel,\n              std::vector<Label> *next_stub_);\n\n  // Expands arcs from state `s`, equivalent to state tuple `state`,\n  // with input `ilabel`. `next_stub_` is the buffer filled in\n  // `ShiftBuffer`.\n  void ExpandArcs(StateId s, const std::vector<Label> &state, Label ilabel,\n                  std::vector<Label> *next_stub_);\n\n  // Appends arcs from state `s`, equivalent to state tuple `state`,\n  // with input `ilabel` to `arcs`. `next_stub_` is the buffer filled\n  // in `ShiftBuffer`.\n  void AppendArcs(StateId s, const std::vector<Label> &state, Label ilabel,\n                  std::vector<Label> *next_stub_, std::vector<Arc> *arcs);\n\n  std::shared_ptr<const LinearFstData<A>> data_;\n  size_t delay_;\n  // Mapping from internal state tuple to *non-consecutive* ids\n  Collection<StateId, Label> ngrams_;\n  // Mapping from non-consecutive id to actual state id\n  CompactHashBiTable<StateId, StateId, std::hash<StateId>> condensed_;\n  // Two frequently used vectors, reuse to avoid repeated heap\n  // allocation\n  std::vector<Label> state_stub_, next_stub_;\n\n  LinearTaggerFstImpl &operator=(const LinearTaggerFstImpl &) = delete;\n};\n\ntemplate <class A>\nconst int LinearTaggerFstImpl<A>::kMinFileVersion = 1;\n\ntemplate <class A>\nconst int LinearTaggerFstImpl<A>::kFileVersion = 1;\n\ntemplate <class A>\ninline typename A::Label LinearTaggerFstImpl<A>::ShiftBuffer(\n    const std::vector<Label> &state, Label ilabel,\n    std::vector<Label> *next_stub_) {\n  DCHECK(ilabel > 0 || ilabel == LinearFstData<A>::kEndOfSentence);\n  if (delay_ == 0) {\n    DCHECK_GT(ilabel, 0);\n    return ilabel;\n  } else {\n    (*next_stub_)[BufferEnd(*next_stub_) - next_stub_->begin() - 1] = ilabel;\n    return *BufferBegin(state);\n  }\n}\n\ntemplate <class A>\ninline A LinearTaggerFstImpl<A>::MakeArc(const std::vector<Label> &state,\n                                         Label ilabel, Label olabel,\n                                         std::vector<Label> *next_stub_) {\n  DCHECK(ilabel > 0 || ilabel == LinearFstData<A>::kEndOfSentence);\n  DCHECK(olabel > 0 || olabel == LinearFstData<A>::kStartOfSentence);\n  Weight weight(Weight::One());\n  data_->TakeTransition(BufferEnd(state), InternalBegin(state),\n                        InternalEnd(state), ilabel, olabel, next_stub_,\n                        &weight);\n  StateId nextstate = FindState(*next_stub_);\n  // Restore `next_stub_` to its size before the call\n  next_stub_->resize(delay_);\n  // In the actual arc, we use epsilons instead of boundaries.\n  return A(ilabel == LinearFstData<A>::kEndOfSentence ? 0 : ilabel,\n           olabel == LinearFstData<A>::kStartOfSentence ? 0 : olabel, weight,\n           nextstate);\n}\n\ntemplate <class A>\ninline void LinearTaggerFstImpl<A>::ExpandArcs(StateId s,\n                                               const std::vector<Label> &state,\n                                               Label ilabel,\n                                               std::vector<Label> *next_stub_) {\n  // Input label to constrain the output with, observed `delay_` steps\n  // back. `ilabel` is the input label to be put on the arc, which\n  // fires features.\n  Label obs_ilabel = ShiftBuffer(state, ilabel, next_stub_);\n  if (obs_ilabel == LinearFstData<A>::kStartOfSentence) {\n    // This happens when input is shorter than `delay_`.\n    PushArc(s, MakeArc(state, ilabel, LinearFstData<A>::kStartOfSentence,\n                       next_stub_));\n  } else {\n    std::pair<typename std::vector<typename A::Label>::const_iterator,\n              typename std::vector<typename A::Label>::const_iterator> range =\n        data_->PossibleOutputLabels(obs_ilabel);\n    for (typename std::vector<typename A::Label>::const_iterator it =\n             range.first;\n         it != range.second; ++it)\n      PushArc(s, MakeArc(state, ilabel, *it, next_stub_));\n  }\n}\n\n// TODO(wuke): this has much in duplicate with `ExpandArcs()`\ntemplate <class A>\ninline void LinearTaggerFstImpl<A>::AppendArcs(StateId /*s*/,\n                                               const std::vector<Label> &state,\n                                               Label ilabel,\n                                               std::vector<Label> *next_stub_,\n                                               std::vector<Arc> *arcs) {\n  // Input label to constrain the output with, observed `delay_` steps\n  // back. `ilabel` is the input label to be put on the arc, which\n  // fires features.\n  Label obs_ilabel = ShiftBuffer(state, ilabel, next_stub_);\n  if (obs_ilabel == LinearFstData<A>::kStartOfSentence) {\n    // This happens when input is shorter than `delay_`.\n    arcs->push_back(\n        MakeArc(state, ilabel, LinearFstData<A>::kStartOfSentence, next_stub_));\n  } else {\n    std::pair<typename std::vector<typename A::Label>::const_iterator,\n              typename std::vector<typename A::Label>::const_iterator> range =\n        data_->PossibleOutputLabels(obs_ilabel);\n    for (typename std::vector<typename A::Label>::const_iterator it =\n             range.first;\n         it != range.second; ++it)\n      arcs->push_back(MakeArc(state, ilabel, *it, next_stub_));\n  }\n}\n\ntemplate <class A>\nvoid LinearTaggerFstImpl<A>::Expand(StateId s) {\n  VLOG(3) << \"Expand \" << s;\n  state_stub_.clear();\n  FillState(s, &state_stub_);\n\n  // Precompute the first `delay_ - 1` elements in the buffer of\n  // next states, which are identical for different input/output.\n  next_stub_.clear();\n  next_stub_.resize(delay_);\n  if (delay_ > 0)\n    std::copy(BufferBegin(state_stub_) + 1, BufferEnd(state_stub_),\n              next_stub_.begin());\n\n  // Epsilon transition for flushing out the next observed input\n  if (!IsEmptyBuffer(BufferBegin(state_stub_), BufferEnd(state_stub_)))\n    ExpandArcs(s, state_stub_, LinearFstData<A>::kEndOfSentence, &next_stub_);\n\n  // Non-epsilon input when we haven't flushed\n  if (delay_ == 0 ||\n      *(BufferEnd(state_stub_) - 1) != LinearFstData<A>::kEndOfSentence)\n    for (Label ilabel = data_->MinInputLabel();\n         ilabel <= data_->MaxInputLabel(); ++ilabel)\n      ExpandArcs(s, state_stub_, ilabel, &next_stub_);\n\n  SetArcs(s);\n}\n\ntemplate <class A>\nvoid LinearTaggerFstImpl<A>::MatchInput(StateId s, Label ilabel,\n                                        std::vector<Arc> *arcs) {\n  state_stub_.clear();\n  FillState(s, &state_stub_);\n\n  // Precompute the first `delay_ - 1` elements in the buffer of\n  // next states, which are identical for different input/output.\n  next_stub_.clear();\n  next_stub_.resize(delay_);\n  if (delay_ > 0)\n    std::copy(BufferBegin(state_stub_) + 1, BufferEnd(state_stub_),\n              next_stub_.begin());\n\n  if (ilabel == 0) {\n    // Epsilon transition for flushing out the next observed input\n    if (!IsEmptyBuffer(BufferBegin(state_stub_), BufferEnd(state_stub_)))\n      AppendArcs(s, state_stub_, LinearFstData<A>::kEndOfSentence, &next_stub_,\n                 arcs);\n  } else {\n    // Non-epsilon input when we haven't flushed\n    if (delay_ == 0 ||\n        *(BufferEnd(state_stub_) - 1) != LinearFstData<A>::kEndOfSentence)\n      AppendArcs(s, state_stub_, ilabel, &next_stub_, arcs);\n  }\n}\n\ntemplate <class A>\ninline LinearTaggerFstImpl<A> *LinearTaggerFstImpl<A>::Read(\n    std::istream &strm, const FstReadOptions &opts) {  // NOLINT\n  std::unique_ptr<LinearTaggerFstImpl<A>> impl(new LinearTaggerFstImpl<A>());\n  FstHeader header;\n  if (!impl->ReadHeader(strm, opts, kMinFileVersion, &header)) {\n    return nullptr;\n  }\n  impl->data_ = std::shared_ptr<LinearFstData<A>>(LinearFstData<A>::Read(strm));\n  if (!impl->data_) {\n    return nullptr;\n  }\n  impl->delay_ = impl->data_->MaxFutureSize();\n  impl->ReserveStubSpace();\n  return impl.release();\n}\n\n}  // namespace internal\n\n// This class attaches interface to implementation and handles\n// reference counting, delegating most methods to ImplToFst.\ntemplate <class A>\nclass LinearTaggerFst : public ImplToFst<internal::LinearTaggerFstImpl<A>> {\n public:\n  friend class ArcIterator<LinearTaggerFst<A>>;\n  friend class StateIterator<LinearTaggerFst<A>>;\n  friend class LinearFstMatcherTpl<LinearTaggerFst<A>>;\n\n  typedef A Arc;\n  typedef typename A::Label Label;\n  typedef typename A::Weight Weight;\n  typedef typename A::StateId StateId;\n  typedef DefaultCacheStore<A> Store;\n  typedef typename Store::State State;\n  using Impl = internal::LinearTaggerFstImpl<A>;\n\n  LinearTaggerFst() : ImplToFst<Impl>(std::make_shared<Impl>()) {}\n\n  explicit LinearTaggerFst(LinearFstData<A> *data,\n                           const SymbolTable *isyms = nullptr,\n                           const SymbolTable *osyms = nullptr,\n                           CacheOptions opts = CacheOptions())\n      : ImplToFst<Impl>(std::make_shared<Impl>(data, isyms, osyms, opts)) {}\n\n  explicit LinearTaggerFst(const Fst<A> &fst)\n      : ImplToFst<Impl>(std::make_shared<Impl>()) {\n    LOG(FATAL) << \"LinearTaggerFst: no constructor from arbitrary FST.\";\n  }\n\n  // See Fst<>::Copy() for doc.\n  LinearTaggerFst(const LinearTaggerFst<A> &fst, bool safe = false)\n      : ImplToFst<Impl>(fst, safe) {}\n\n  // Get a copy of this LinearTaggerFst. See Fst<>::Copy() for further doc.\n  LinearTaggerFst<A> *Copy(bool safe = false) const override {\n    return new LinearTaggerFst<A>(*this, safe);\n  }\n\n  inline void InitStateIterator(StateIteratorData<A> *data) const override;\n\n  void InitArcIterator(StateId s, ArcIteratorData<A> *data) const override {\n    GetMutableImpl()->InitArcIterator(s, data);\n  }\n\n  MatcherBase<A> *InitMatcher(MatchType match_type) const override {\n    return new LinearFstMatcherTpl<LinearTaggerFst<A>>(this, match_type);\n  }\n\n  static LinearTaggerFst<A> *Read(const string &filename) {\n    if (!filename.empty()) {\n      std::ifstream strm(filename,\n                              std::ios_base::in | std::ios_base::binary);\n      if (!strm) {\n        LOG(ERROR) << \"LinearTaggerFst::Read: Can't open file: \" << filename;\n        return nullptr;\n      }\n      return Read(strm, FstReadOptions(filename));\n    } else {\n      return Read(std::cin, FstReadOptions(\"standard input\"));\n    }\n  }\n\n  static LinearTaggerFst<A> *Read(std::istream &in,  // NOLINT\n                                  const FstReadOptions &opts) {\n    auto *impl = Impl::Read(in, opts);\n    return impl ? new LinearTaggerFst<A>(std::shared_ptr<Impl>(impl)) : nullptr;\n  }\n\n  bool Write(const string &filename) const override {\n    if (!filename.empty()) {\n      std::ofstream strm(filename,\n                               std::ios_base::out | std::ios_base::binary);\n      if (!strm) {\n        LOG(ERROR) << \"LinearTaggerFst::Write: Can't open file: \" << filename;\n        return false;\n      }\n      return Write(strm, FstWriteOptions(filename));\n    } else {\n      return Write(std::cout, FstWriteOptions(\"standard output\"));\n    }\n  }\n\n  bool Write(std::ostream &strm, const FstWriteOptions &opts) const override {\n    return GetImpl()->Write(strm, opts);\n  }\n\n private:\n  using ImplToFst<Impl>::GetImpl;\n  using ImplToFst<Impl>::GetMutableImpl;\n\n  explicit LinearTaggerFst(std::shared_ptr<Impl> impl)\n      : ImplToFst<Impl>(impl) {}\n\n  void operator=(const LinearTaggerFst<A> &fst) = delete;\n};\n\n// Specialization for LinearTaggerFst.\ntemplate <class Arc>\nclass StateIterator<LinearTaggerFst<Arc>>\n    : public CacheStateIterator<LinearTaggerFst<Arc>> {\n public:\n  explicit StateIterator(const LinearTaggerFst<Arc> &fst)\n      : CacheStateIterator<LinearTaggerFst<Arc>>(fst, fst.GetMutableImpl()) {}\n};\n\n// Specialization for LinearTaggerFst.\ntemplate <class Arc>\nclass ArcIterator<LinearTaggerFst<Arc>>\n    : public CacheArcIterator<LinearTaggerFst<Arc>> {\n public:\n  using StateId = typename Arc::StateId;\n\n  ArcIterator(const LinearTaggerFst<Arc> &fst, StateId s)\n      : CacheArcIterator<LinearTaggerFst<Arc>>(fst.GetMutableImpl(), s) {\n    if (!fst.GetImpl()->HasArcs(s)) fst.GetMutableImpl()->Expand(s);\n  }\n};\n\ntemplate <class Arc>\ninline void LinearTaggerFst<Arc>::InitStateIterator(\n    StateIteratorData<Arc> *data) const {\n  data->base = new StateIterator<LinearTaggerFst<Arc>>(*this);\n}\n\nnamespace internal {\n\n// Implementation class for on-the-fly generated LinearClassifierFst with\n// special optimization in matching.\ntemplate <class A>\nclass LinearClassifierFstImpl : public CacheImpl<A> {\n public:\n  using FstImpl<A>::SetType;\n  using FstImpl<A>::SetProperties;\n  using FstImpl<A>::SetInputSymbols;\n  using FstImpl<A>::SetOutputSymbols;\n  using FstImpl<A>::WriteHeader;\n\n  using CacheBaseImpl<CacheState<A>>::PushArc;\n  using CacheBaseImpl<CacheState<A>>::HasArcs;\n  using CacheBaseImpl<CacheState<A>>::HasFinal;\n  using CacheBaseImpl<CacheState<A>>::HasStart;\n  using CacheBaseImpl<CacheState<A>>::SetArcs;\n  using CacheBaseImpl<CacheState<A>>::SetFinal;\n  using CacheBaseImpl<CacheState<A>>::SetStart;\n\n  typedef A Arc;\n  typedef typename A::Label Label;\n  typedef typename A::Weight Weight;\n  typedef typename A::StateId StateId;\n  typedef typename Collection<StateId, Label>::SetIterator NGramIterator;\n\n  // Constructs an empty FST by default.\n  LinearClassifierFstImpl()\n      : CacheImpl<A>(CacheOptions()),\n        data_(std::make_shared<LinearFstData<A>>()) {\n    SetType(\"linear-classifier\");\n    num_classes_ = 0;\n    num_groups_ = 0;\n  }\n\n  // Constructs the FST with given data storage, number of classes and\n  // symbol tables.\n  LinearClassifierFstImpl(const LinearFstData<Arc> *data, size_t num_classes,\n                          const SymbolTable *isyms, const SymbolTable *osyms,\n                          CacheOptions opts)\n      : CacheImpl<A>(opts),\n        data_(data),\n        num_classes_(num_classes),\n        num_groups_(data_->NumGroups() / num_classes_) {\n    SetType(\"linear-classifier\");\n    SetProperties(kILabelSorted, kFstProperties);\n    SetInputSymbols(isyms);\n    SetOutputSymbols(osyms);\n    ReserveStubSpace();\n  }\n\n  // Copy by sharing the underlying data storage.\n  LinearClassifierFstImpl(const LinearClassifierFstImpl &impl)\n      : CacheImpl<A>(impl),\n        data_(impl.data_),\n        num_classes_(impl.num_classes_),\n        num_groups_(impl.num_groups_) {\n    SetType(\"linear-classifier\");\n    SetProperties(impl.Properties(), kCopyProperties);\n    SetInputSymbols(impl.InputSymbols());\n    SetOutputSymbols(impl.OutputSymbols());\n    ReserveStubSpace();\n  }\n\n  StateId Start() {\n    if (!HasStart()) {\n      StateId start = FindStartState();\n      SetStart(start);\n    }\n    return CacheImpl<A>::Start();\n  }\n\n  Weight Final(StateId s) {\n    if (!HasFinal(s)) {\n      state_stub_.clear();\n      FillState(s, &state_stub_);\n      SetFinal(s, FinalWeight(state_stub_));\n    }\n    return CacheImpl<A>::Final(s);\n  }\n\n  size_t NumArcs(StateId s) {\n    if (!HasArcs(s)) Expand(s);\n    return CacheImpl<A>::NumArcs(s);\n  }\n\n  size_t NumInputEpsilons(StateId s) {\n    if (!HasArcs(s)) Expand(s);\n    return CacheImpl<A>::NumInputEpsilons(s);\n  }\n\n  size_t NumOutputEpsilons(StateId s) {\n    if (!HasArcs(s)) Expand(s);\n    return CacheImpl<A>::NumOutputEpsilons(s);\n  }\n\n  void InitArcIterator(StateId s, ArcIteratorData<A> *data) {\n    if (!HasArcs(s)) Expand(s);\n    CacheImpl<A>::InitArcIterator(s, data);\n  }\n\n  // Computes the outgoing transitions from a state, creating new\n  // destination states as needed.\n  void Expand(StateId s);\n\n  // Appends to `arcs` all out-going arcs from state `s` that matches\n  // `label` as the input label.\n  void MatchInput(StateId s, Label ilabel, std::vector<Arc> *arcs);\n\n  static LinearClassifierFstImpl<A> *Read(std::istream &strm,\n                                          const FstReadOptions &opts);\n\n  bool Write(std::ostream &strm, const FstWriteOptions &opts) const {\n    FstHeader header;\n    header.SetStart(kNoStateId);\n    WriteHeader(strm, opts, kFileVersion, &header);\n    data_->Write(strm);\n    WriteType(strm, num_classes_);\n    if (!strm) {\n      LOG(ERROR) << \"LinearClassifierFst::Write: Write failed: \" << opts.source;\n      return false;\n    }\n    return true;\n  }\n\n private:\n  static const int kMinFileVersion;\n  static const int kFileVersion;\n\n  // A collection of functions to access parts of the state tuple. A\n  // state tuple is a vector of `Label`s with two parts:\n  //   [prediction] [internal].\n  //\n  // - [prediction] is a single label of the predicted class. A state\n  //   must have a positive class label, unless it is the start state.\n  //\n  // - [internal] is the internal state tuple for `LinearFstData` of\n  //   the given class; or kNoTrieNodeId's if in start state.\n  Label &Prediction(std::vector<Label> &state) { return state[0]; }  // NOLINT\n  Label Prediction(const std::vector<Label> &state) const { return state[0]; }\n\n  Label &InternalAt(std::vector<Label> &state, int index) {  // NOLINT\n    return state[index + 1];\n  }\n  Label InternalAt(const std::vector<Label> &state, int index) const {\n    return state[index + 1];\n  }\n\n  // The size of state tuples are fixed, reserve them in stubs\n  void ReserveStubSpace() {\n    size_t size = 1 + num_groups_;\n    state_stub_.reserve(size);\n    next_stub_.reserve(size);\n  }\n\n  // Computes the start state tuple and maps it to the start state id.\n  StateId FindStartState() {\n    // A start state tuple has no prediction\n    state_stub_.clear();\n    state_stub_.push_back(kNoLabel);\n    // For a start state, we don't yet know where we are in the tries.\n    for (size_t i = 0; i < num_groups_; ++i)\n      state_stub_.push_back(kNoTrieNodeId);\n    return FindState(state_stub_);\n  }\n\n  // Tests if the state tuple represents the start state.\n  bool IsStartState(const std::vector<Label> &state) const {\n    return state[0] == kNoLabel;\n  }\n\n  // Computes the actual group id in the data storage.\n  int GroupId(Label pred, int group) const {\n    return group * num_classes_ + pred - 1;\n  }\n\n  // Finds out the final weight of the given state. A state is final\n  // iff it is not the start.\n  Weight FinalWeight(const std::vector<Label> &state) const {\n    if (IsStartState(state)) {\n      return Weight::Zero();\n    }\n    Label pred = Prediction(state);\n    DCHECK_GT(pred, 0);\n    DCHECK_LE(pred, num_classes_);\n    Weight final_weight = Weight::One();\n    for (size_t group = 0; group < num_groups_; ++group) {\n      int group_id = GroupId(pred, group);\n      int trie_state = InternalAt(state, group);\n      final_weight =\n          Times(final_weight, data_->GroupFinalWeight(group_id, trie_state));\n    }\n    return final_weight;\n  }\n\n  // Finds state corresponding to an n-gram. Creates new state if n-gram not\n  // found.\n  StateId FindState(const std::vector<Label> &ngram) {\n    StateId sparse = ngrams_.FindId(ngram, true);\n    StateId dense = condensed_.FindId(sparse, true);\n    return dense;\n  }\n\n  // Appends after `output` the state tuple corresponding to the state id. The\n  // state id must exist.\n  void FillState(StateId s, std::vector<Label> *output) {\n    s = condensed_.FindEntry(s);\n    for (NGramIterator it = ngrams_.FindSet(s); !it.Done(); it.Next()) {\n      Label label = it.Element();\n      output->push_back(label);\n    }\n  }\n\n  std::shared_ptr<const LinearFstData<A>> data_;\n  // Division of groups in `data_`; num_classes_ * num_groups_ ==\n  // data_->NumGroups().\n  size_t num_classes_, num_groups_;\n  // Mapping from internal state tuple to *non-consecutive* ids\n  Collection<StateId, Label> ngrams_;\n  // Mapping from non-consecutive id to actual state id\n  CompactHashBiTable<StateId, StateId, std::hash<StateId>> condensed_;\n  // Two frequently used vectors, reuse to avoid repeated heap\n  // allocation\n  std::vector<Label> state_stub_, next_stub_;\n\n  void operator=(const LinearClassifierFstImpl<A> &) = delete;\n};\n\ntemplate <class A>\nconst int LinearClassifierFstImpl<A>::kMinFileVersion = 0;\n\ntemplate <class A>\nconst int LinearClassifierFstImpl<A>::kFileVersion = 0;\n\ntemplate <class A>\nvoid LinearClassifierFstImpl<A>::Expand(StateId s) {\n  VLOG(3) << \"Expand \" << s;\n  state_stub_.clear();\n  FillState(s, &state_stub_);\n  next_stub_.clear();\n  next_stub_.resize(1 + num_groups_);\n\n  if (IsStartState(state_stub_)) {\n    // Make prediction\n    for (Label pred = 1; pred <= num_classes_; ++pred) {\n      Prediction(next_stub_) = pred;\n      for (int i = 0; i < num_groups_; ++i)\n        InternalAt(next_stub_, i) = data_->GroupStartState(GroupId(pred, i));\n      PushArc(s, A(0, pred, Weight::One(), FindState(next_stub_)));\n    }\n  } else {\n    Label pred = Prediction(state_stub_);\n    DCHECK_GT(pred, 0);\n    DCHECK_LE(pred, num_classes_);\n    for (Label ilabel = data_->MinInputLabel();\n         ilabel <= data_->MaxInputLabel(); ++ilabel) {\n      Prediction(next_stub_) = pred;\n      Weight weight = Weight::One();\n      for (int i = 0; i < num_groups_; ++i)\n        InternalAt(next_stub_, i) =\n            data_->GroupTransition(GroupId(pred, i), InternalAt(state_stub_, i),\n                                   ilabel, pred, &weight);\n      PushArc(s, A(ilabel, 0, weight, FindState(next_stub_)));\n    }\n  }\n\n  SetArcs(s);\n}\n\ntemplate <class A>\nvoid LinearClassifierFstImpl<A>::MatchInput(StateId s, Label ilabel,\n                                            std::vector<Arc> *arcs) {\n  state_stub_.clear();\n  FillState(s, &state_stub_);\n  next_stub_.clear();\n  next_stub_.resize(1 + num_groups_);\n\n  if (IsStartState(state_stub_)) {\n    // Make prediction if `ilabel` is epsilon.\n    if (ilabel == 0) {\n      for (Label pred = 1; pred <= num_classes_; ++pred) {\n        Prediction(next_stub_) = pred;\n        for (int i = 0; i < num_groups_; ++i)\n          InternalAt(next_stub_, i) = data_->GroupStartState(GroupId(pred, i));\n        arcs->push_back(A(0, pred, Weight::One(), FindState(next_stub_)));\n      }\n    }\n  } else if (ilabel != 0) {\n    Label pred = Prediction(state_stub_);\n    Weight weight = Weight::One();\n    Prediction(next_stub_) = pred;\n    for (int i = 0; i < num_groups_; ++i)\n      InternalAt(next_stub_, i) = data_->GroupTransition(\n          GroupId(pred, i), InternalAt(state_stub_, i), ilabel, pred, &weight);\n    arcs->push_back(A(ilabel, 0, weight, FindState(next_stub_)));\n  }\n}\n\ntemplate <class A>\ninline LinearClassifierFstImpl<A> *LinearClassifierFstImpl<A>::Read(\n    std::istream &strm, const FstReadOptions &opts) {\n  std::unique_ptr<LinearClassifierFstImpl<A>> impl(\n      new LinearClassifierFstImpl<A>());\n  FstHeader header;\n  if (!impl->ReadHeader(strm, opts, kMinFileVersion, &header)) {\n    return nullptr;\n  }\n  impl->data_ = std::shared_ptr<LinearFstData<A>>(LinearFstData<A>::Read(strm));\n  if (!impl->data_) {\n    return nullptr;\n  }\n  ReadType(strm, &impl->num_classes_);\n  if (!strm) {\n    return nullptr;\n  }\n  impl->num_groups_ = impl->data_->NumGroups() / impl->num_classes_;\n  if (impl->num_groups_ * impl->num_classes_ != impl->data_->NumGroups()) {\n    FSTERROR() << \"Total number of feature groups is not a multiple of the \"\n                  \"number of classes: num groups = \"\n               << impl->data_->NumGroups()\n               << \", num classes = \" << impl->num_classes_;\n    return nullptr;\n  }\n  impl->ReserveStubSpace();\n  return impl.release();\n}\n\n}  // namespace internal\n\n// This class attaches interface to implementation and handles\n// reference counting, delegating most methods to ImplToFst.\ntemplate <class A>\nclass LinearClassifierFst\n    : public ImplToFst<internal::LinearClassifierFstImpl<A>> {\n public:\n  friend class ArcIterator<LinearClassifierFst<A>>;\n  friend class StateIterator<LinearClassifierFst<A>>;\n  friend class LinearFstMatcherTpl<LinearClassifierFst<A>>;\n\n  typedef A Arc;\n  typedef typename A::Label Label;\n  typedef typename A::Weight Weight;\n  typedef typename A::StateId StateId;\n  typedef DefaultCacheStore<A> Store;\n  typedef typename Store::State State;\n  using Impl = internal::LinearClassifierFstImpl<A>;\n\n  LinearClassifierFst() : ImplToFst<Impl>(std::make_shared<Impl>()) {}\n\n  explicit LinearClassifierFst(LinearFstData<A> *data, size_t num_classes,\n                               const SymbolTable *isyms = nullptr,\n                               const SymbolTable *osyms = nullptr,\n                               CacheOptions opts = CacheOptions())\n      : ImplToFst<Impl>(\n            std::make_shared<Impl>(data, num_classes, isyms, osyms, opts)) {}\n\n  explicit LinearClassifierFst(const Fst<A> &fst)\n      : ImplToFst<Impl>(std::make_shared<Impl>()) {\n    LOG(FATAL) << \"LinearClassifierFst: no constructor from arbitrary FST.\";\n  }\n\n  // See Fst<>::Copy() for doc.\n  LinearClassifierFst(const LinearClassifierFst<A> &fst, bool safe = false)\n      : ImplToFst<Impl>(fst, safe) {}\n\n  // Get a copy of this LinearClassifierFst. See Fst<>::Copy() for further doc.\n  LinearClassifierFst<A> *Copy(bool safe = false) const override {\n    return new LinearClassifierFst<A>(*this, safe);\n  }\n\n  inline void InitStateIterator(StateIteratorData<A> *data) const override;\n\n  void InitArcIterator(StateId s, ArcIteratorData<A> *data) const override {\n    GetMutableImpl()->InitArcIterator(s, data);\n  }\n\n  MatcherBase<A> *InitMatcher(MatchType match_type) const override {\n    return new LinearFstMatcherTpl<LinearClassifierFst<A>>(this, match_type);\n  }\n\n  static LinearClassifierFst<A> *Read(const string &filename) {\n    if (!filename.empty()) {\n      std::ifstream strm(filename,\n                              std::ios_base::in | std::ios_base::binary);\n      if (!strm) {\n        LOG(ERROR) << \"LinearClassifierFst::Read: Can't open file: \"\n                   << filename;\n        return nullptr;\n      }\n      return Read(strm, FstReadOptions(filename));\n    } else {\n      return Read(std::cin, FstReadOptions(\"standard input\"));\n    }\n  }\n\n  static LinearClassifierFst<A> *Read(std::istream &in,\n                                      const FstReadOptions &opts) {\n    auto *impl = Impl::Read(in, opts);\n    return impl ? new LinearClassifierFst<A>(std::shared_ptr<Impl>(impl))\n                : nullptr;\n  }\n\n  bool Write(const string &filename) const override {\n    if (!filename.empty()) {\n      std::ofstream strm(filename,\n                               std::ios_base::out | std::ios_base::binary);\n      if (!strm) {\n        LOG(ERROR) << \"ProdLmFst::Write: Can't open file: \" << filename;\n        return false;\n      }\n      return Write(strm, FstWriteOptions(filename));\n    } else {\n      return Write(std::cout, FstWriteOptions(\"standard output\"));\n    }\n  }\n\n  bool Write(std::ostream &strm, const FstWriteOptions &opts) const override {\n    return GetImpl()->Write(strm, opts);\n  }\n\n private:\n  using ImplToFst<Impl>::GetImpl;\n  using ImplToFst<Impl>::GetMutableImpl;\n\n  explicit LinearClassifierFst(std::shared_ptr<Impl> impl)\n      : ImplToFst<Impl>(impl) {}\n\n  void operator=(const LinearClassifierFst<A> &fst) = delete;\n};\n\n// Specialization for LinearClassifierFst.\ntemplate <class Arc>\nclass StateIterator<LinearClassifierFst<Arc>>\n    : public CacheStateIterator<LinearClassifierFst<Arc>> {\n public:\n  explicit StateIterator(const LinearClassifierFst<Arc> &fst)\n      : CacheStateIterator<LinearClassifierFst<Arc>>(fst,\n                                                     fst.GetMutableImpl()) {}\n};\n\n// Specialization for LinearClassifierFst.\ntemplate <class Arc>\nclass ArcIterator<LinearClassifierFst<Arc>>\n    : public CacheArcIterator<LinearClassifierFst<Arc>> {\n public:\n  using StateId = typename Arc::StateId;\n\n  ArcIterator(const LinearClassifierFst<Arc> &fst, StateId s)\n      : CacheArcIterator<LinearClassifierFst<Arc>>(fst.GetMutableImpl(), s) {\n    if (!fst.GetImpl()->HasArcs(s)) fst.GetMutableImpl()->Expand(s);\n  }\n};\n\ntemplate <class Arc>\ninline void LinearClassifierFst<Arc>::InitStateIterator(\n    StateIteratorData<Arc> *data) const {\n  data->base = new StateIterator<LinearClassifierFst<Arc>>(*this);\n}\n\n// Specialized Matcher for LinearFsts. This matcher only supports\n// matching from the input side. This is intentional because comparing\n// the scores of different input sequences with the same output\n// sequence is meaningless in a discriminative model.\ntemplate <class F>\nclass LinearFstMatcherTpl : public MatcherBase<typename F::Arc> {\n public:\n  typedef typename F::Arc Arc;\n  typedef typename Arc::Label Label;\n  typedef typename Arc::Weight Weight;\n  typedef typename Arc::StateId StateId;\n  typedef F FST;\n\n  // This makes a copy of the FST.\n  LinearFstMatcherTpl(const FST &fst, MatchType match_type)\n      : owned_fst_(fst.Copy()),\n        fst_(*owned_fst_),\n        match_type_(match_type),\n        s_(kNoStateId),\n        current_loop_(false),\n        loop_(kNoLabel, 0, Weight::One(), kNoStateId),\n        cur_arc_(0),\n        error_(false) {\n    switch (match_type_) {\n      case MATCH_INPUT:\n      case MATCH_OUTPUT:\n      case MATCH_NONE:\n        break;\n      default:\n        FSTERROR() << \"LinearFstMatcherTpl: Bad match type\";\n        match_type_ = MATCH_NONE;\n        error_ = true;\n    }\n  }\n\n  // This doesn't copy the FST.\n  LinearFstMatcherTpl(const FST *fst, MatchType match_type)\n      : fst_(*fst),\n        match_type_(match_type),\n        s_(kNoStateId),\n        current_loop_(false),\n        loop_(kNoLabel, 0, Weight::One(), kNoStateId),\n        cur_arc_(0),\n        error_(false) {\n    switch (match_type_) {\n      case MATCH_INPUT:\n      case MATCH_OUTPUT:\n      case MATCH_NONE:\n        break;\n      default:\n        FSTERROR() << \"LinearFstMatcherTpl: Bad match type\";\n        match_type_ = MATCH_NONE;\n        error_ = true;\n    }\n  }\n\n  // This makes a copy of the FST.\n  LinearFstMatcherTpl(const LinearFstMatcherTpl<F> &matcher, bool safe = false)\n      : owned_fst_(matcher.fst_.Copy(safe)),\n        fst_(*owned_fst_),\n        match_type_(matcher.match_type_),\n        s_(kNoStateId),\n        current_loop_(false),\n        loop_(matcher.loop_),\n        cur_arc_(0),\n        error_(matcher.error_) {}\n\n  LinearFstMatcherTpl<F> *Copy(bool safe = false) const override {\n    return new LinearFstMatcherTpl<F>(*this, safe);\n  }\n\n  MatchType Type(bool /*test*/) const override {\n    // `MATCH_INPUT` is the only valid type\n    return match_type_ == MATCH_INPUT ? match_type_ : MATCH_NONE;\n  }\n\n  void SetState(StateId s) final {\n    if (s_ == s) return;\n    s_ = s;\n    // `MATCH_INPUT` is the only valid type\n    if (match_type_ != MATCH_INPUT) {\n      FSTERROR() << \"LinearFstMatcherTpl: Bad match type\";\n      error_ = true;\n    }\n    loop_.nextstate = s;\n  }\n\n  bool Find(Label label) final {\n    if (error_) {\n      current_loop_ = false;\n      return false;\n    }\n    current_loop_ = label == 0;\n    if (label == kNoLabel) label = 0;\n    arcs_.clear();\n    cur_arc_ = 0;\n    fst_.GetMutableImpl()->MatchInput(s_, label, &arcs_);\n    return current_loop_ || !arcs_.empty();\n  }\n\n  bool Done() const final {\n    return !(current_loop_ || cur_arc_ < arcs_.size());\n  }\n\n  const Arc &Value() const final {\n    return current_loop_ ? loop_ : arcs_[cur_arc_];\n  }\n\n  void Next() final {\n    if (current_loop_)\n      current_loop_ = false;\n    else\n      ++cur_arc_;\n  }\n\n  std::ptrdiff_t Priority(StateId s) final { return kRequirePriority; }\n\n  const FST &GetFst() const override { return fst_; }\n\n  uint64_t Properties(uint64_t props) const override {\n    if (error_) props |= kError;\n    return props;\n  }\n\n  uint32_t Flags() const override { return kRequireMatch; }\n\n private:\n  std::unique_ptr<const FST> owned_fst_;\n  const FST &fst_;\n  MatchType match_type_;  // Type of match to perform.\n  StateId s_;             // Current state.\n  bool current_loop_;     // Current arc is the implicit loop.\n  Arc loop_;              // For non-consuming symbols.\n  // All out-going arcs matching the label in last Find() call.\n  std::vector<Arc> arcs_;\n  size_t cur_arc_;  // Index to the arc that `Value()` should return.\n  bool error_;      // Error encountered.\n};\n\n}  // namespace fst\n\n#endif  // FST_EXTENSIONS_LINEAR_LINEAR_FST_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/extensions/linear/linearscript.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#ifndef FST_EXTENSIONS_LINEAR_LINEARSCRIPT_H_\n#define FST_EXTENSIONS_LINEAR_LINEARSCRIPT_H_\n\n#include <istream>\n#include <sstream>\n#include <string>\n#include <vector>\n\n#include <fst/compat.h>\n#include <fst/extensions/linear/linear-fst-data-builder.h>\n#include <fst/extensions/linear/linear-fst.h>\n#include <fstream>\n#include <fst/symbol-table.h>\n#include <fst/script/arg-packs.h>\n#include <fst/script/script-impl.h>\n\nDECLARE_string(delimiter);\nDECLARE_string(empty_symbol);\nDECLARE_string(start_symbol);\nDECLARE_string(end_symbol);\nDECLARE_bool(classifier);\n\nnamespace fst {\nnamespace script {\ntypedef std::tuple<const string &, const string &, const string &, char **, int,\n                   const string &, const string &, const string &,\n                   const string &>\n    LinearCompileArgs;\n\nbool ValidateDelimiter();\nbool ValidateEmptySymbol();\n\n// Returns the proper label given the symbol. For symbols other than\n// `FLAGS_start_symbol` or `FLAGS_end_symbol`, looks up the symbol\n// table to decide the label. Depending on whether\n// `FLAGS_start_symbol` and `FLAGS_end_symbol` are identical, it\n// either returns `kNoLabel` for later processing or decides the label\n// right away.\ntemplate <class Arc>\ninline typename Arc::Label LookUp(const string &str, SymbolTable *syms) {\n  if (str == FLAGS_start_symbol)\n    return str == FLAGS_end_symbol ? kNoLabel\n                                   : LinearFstData<Arc>::kStartOfSentence;\n  else if (str == FLAGS_end_symbol)\n    return LinearFstData<Arc>::kEndOfSentence;\n  else\n    return syms->AddSymbol(str);\n}\n\n// Splits `str` with `delim` as the delimiter and stores the labels in\n// `output`.\ntemplate <class Arc>\nvoid SplitAndPush(const string &str, const char delim, SymbolTable *syms,\n                  std::vector<typename Arc::Label> *output) {\n  if (str == FLAGS_empty_symbol) return;\n  std::istringstream strm(str);\n  string buf;\n  while (std::getline(strm, buf, delim))\n    output->push_back(LookUp<Arc>(buf, syms));\n}\n\n// Like `std::replace_copy` but returns the number of modifications\ntemplate <class InputIterator, class OutputIterator, class T>\nsize_t ReplaceCopy(InputIterator first, InputIterator last,\n                   OutputIterator result, const T &old_value,\n                   const T &new_value) {\n  size_t changes = 0;\n  while (first != last) {\n    if (*first == old_value) {\n      *result = new_value;\n      ++changes;\n    } else {\n      *result = *first;\n    }\n    ++first;\n    ++result;\n  }\n  return changes;\n}\n\ntemplate <class Arc>\nbool GetVocabRecord(const string &vocab, std::istream &strm,  // NOLINT\n                    SymbolTable *isyms, SymbolTable *fsyms, SymbolTable *osyms,\n                    typename Arc::Label *word,\n                    std::vector<typename Arc::Label> *feature_labels,\n                    std::vector<typename Arc::Label> *possible_labels,\n                    size_t *num_line);\n\ntemplate <class Arc>\nbool GetModelRecord(const string &model, std::istream &strm,  // NOLINT\n                    SymbolTable *fsyms, SymbolTable *osyms,\n                    std::vector<typename Arc::Label> *input_labels,\n                    std::vector<typename Arc::Label> *output_labels,\n                    typename Arc::Weight *weight, size_t *num_line);\n\n// Reads in vocabulary file. Each line is in the following format\n//\n//   word <whitespace> features [ <whitespace> possible output ]\n//\n// where features and possible output are `FLAGS_delimiter`-delimited lists of\n// tokens\ntemplate <class Arc>\nvoid AddVocab(const string &vocab, SymbolTable *isyms, SymbolTable *fsyms,\n              SymbolTable *osyms, LinearFstDataBuilder<Arc> *builder) {\n  std::ifstream in(vocab);\n  if (!in) LOG(FATAL) << \"Can't open file: \" << vocab;\n  size_t num_line = 0, num_added = 0;\n  std::vector<string> fields;\n  std::vector<typename Arc::Label> feature_labels, possible_labels;\n  typename Arc::Label word;\n  while (GetVocabRecord<Arc>(vocab, in, isyms, fsyms, osyms, &word,\n                             &feature_labels, &possible_labels, &num_line)) {\n    if (word == kNoLabel) {\n      LOG(WARNING) << \"Ignored: boundary word: \" << fields[0];\n      continue;\n    }\n    if (possible_labels.empty())\n      num_added += builder->AddWord(word, feature_labels);\n    else\n      num_added += builder->AddWord(word, feature_labels, possible_labels);\n  }\n  VLOG(1) << \"Read \" << num_added << \" words in \" << num_line << \" lines from \"\n          << vocab;\n}\n\ntemplate <class Arc>\nvoid AddVocab(const string &vocab, SymbolTable *isyms, SymbolTable *fsyms,\n              SymbolTable *osyms,\n              LinearClassifierFstDataBuilder<Arc> *builder) {\n  std::ifstream in(vocab);\n  if (!in) LOG(FATAL) << \"Can't open file: \" << vocab;\n  size_t num_line = 0, num_added = 0;\n  std::vector<string> fields;\n  std::vector<typename Arc::Label> feature_labels, possible_labels;\n  typename Arc::Label word;\n  while (GetVocabRecord<Arc>(vocab, in, isyms, fsyms, osyms, &word,\n                             &feature_labels, &possible_labels, &num_line)) {\n    if (!possible_labels.empty())\n      LOG(FATAL)\n          << \"Classifier vocabulary should not have possible output constraint\";\n    if (word == kNoLabel) {\n      LOG(WARNING) << \"Ignored: boundary word: \" << fields[0];\n      continue;\n    }\n    num_added += builder->AddWord(word, feature_labels);\n  }\n  VLOG(1) << \"Read \" << num_added << \" words in \" << num_line << \" lines from \"\n          << vocab;\n}\n\n// Reads in model file. The first line is an integer designating the\n// size of future window in the input sequences. After this, each line\n// is in the following format\n//\n//   input sequence <whitespace> output sequence <whitespace> weight\n//\n// input sequence is a `FLAGS_delimiter`-delimited sequence of feature\n// labels (see `AddVocab()`) . output sequence is a\n// `FLAGS_delimiter`-delimited sequence of output labels where the\n// last label is the output of the feature position before the history\n// boundary.\ntemplate <class Arc>\nvoid AddModel(const string &model, SymbolTable *fsyms, SymbolTable *osyms,\n              LinearFstDataBuilder<Arc> *builder) {\n  std::ifstream in(model);\n  if (!in) LOG(FATAL) << \"Can't open file: \" << model;\n  string line;\n  std::getline(in, line);\n  if (!in) LOG(FATAL) << \"Empty file: \" << model;\n  size_t future_size;\n  {\n    std::istringstream strm(line);\n    strm >> future_size;\n    if (!strm) LOG(FATAL) << \"Can't read future size: \" << model;\n  }\n  size_t num_line = 1, num_added = 0;\n  const int group = builder->AddGroup(future_size);\n  VLOG(1) << \"Group \" << group << \": from \" << model << \"; future size is \"\n          << future_size << \".\";\n  // Add the rest of lines as a single feature group\n  std::vector<string> fields;\n  std::vector<typename Arc::Label> input_labels, output_labels;\n  typename Arc::Weight weight;\n  while (GetModelRecord<Arc>(model, in, fsyms, osyms, &input_labels,\n                             &output_labels, &weight, &num_line)) {\n    if (output_labels.empty())\n      LOG(FATAL) << \"Empty output sequence in source \" << model << \", line \"\n                 << num_line;\n\n    const typename Arc::Label marks[] = {LinearFstData<Arc>::kStartOfSentence,\n                                         LinearFstData<Arc>::kEndOfSentence};\n\n    std::vector<typename Arc::Label> copy_input(input_labels.size()),\n        copy_output(output_labels.size());\n    for (int i = 0; i < 2; ++i) {\n      for (int j = 0; j < 2; ++j) {\n        size_t num_input_changes =\n            ReplaceCopy(input_labels.begin(), input_labels.end(),\n                        copy_input.begin(), kNoLabel, marks[i]);\n        size_t num_output_changes =\n            ReplaceCopy(output_labels.begin(), output_labels.end(),\n                        copy_output.begin(), kNoLabel, marks[j]);\n        if ((num_input_changes > 0 || i == 0) &&\n            (num_output_changes > 0 || j == 0))\n          num_added +=\n              builder->AddWeight(group, copy_input, copy_output, weight);\n      }\n    }\n  }\n  VLOG(1) << \"Group \" << group << \": read \" << num_added << \" weight(s) in \"\n          << num_line << \" lines.\";\n}\n\ntemplate <class Arc>\nvoid AddModel(const string &model, SymbolTable *fsyms, SymbolTable *osyms,\n              LinearClassifierFstDataBuilder<Arc> *builder) {\n  std::ifstream in(model);\n  if (!in) LOG(FATAL) << \"Can't open file: \" << model;\n  string line;\n  std::getline(in, line);\n  if (!in) LOG(FATAL) << \"Empty file: \" << model;\n  size_t future_size;\n  {\n    std::istringstream strm(line);\n    strm >> future_size;\n    if (!strm) LOG(FATAL) << \"Can't read future size: \" << model;\n  }\n  if (future_size != 0)\n    LOG(FATAL) << \"Classifier model must have future size = 0; got \"\n               << future_size << \" from \" << model;\n  size_t num_line = 1, num_added = 0;\n  const int group = builder->AddGroup();\n  VLOG(1) << \"Group \" << group << \": from \" << model << \"; future size is \"\n          << future_size << \".\";\n  // Add the rest of lines as a single feature group\n  std::vector<string> fields;\n  std::vector<typename Arc::Label> input_labels, output_labels;\n  typename Arc::Weight weight;\n  while (GetModelRecord<Arc>(model, in, fsyms, osyms, &input_labels,\n                             &output_labels, &weight, &num_line)) {\n    if (output_labels.size() != 1)\n      LOG(FATAL) << \"Output not a single label in source \" << model << \", line \"\n                 << num_line;\n\n    const typename Arc::Label marks[] = {LinearFstData<Arc>::kStartOfSentence,\n                                         LinearFstData<Arc>::kEndOfSentence};\n\n    typename Arc::Label pred = output_labels[0];\n\n    std::vector<typename Arc::Label> copy_input(input_labels.size());\n    for (int i = 0; i < 2; ++i) {\n      size_t num_input_changes =\n          ReplaceCopy(input_labels.begin(), input_labels.end(),\n                      copy_input.begin(), kNoLabel, marks[i]);\n      if (num_input_changes > 0 || i == 0)\n        num_added += builder->AddWeight(group, copy_input, pred, weight);\n    }\n  }\n  VLOG(1) << \"Group \" << group << \": read \" << num_added << \" weight(s) in \"\n          << num_line << \" lines.\";\n}\n\nvoid SplitByWhitespace(const string &str, std::vector<string> *out);\nint ScanNumClasses(char **models, int models_length);\n\ntemplate <class Arc>\nvoid LinearCompileTpl(LinearCompileArgs *args) {\n  const string &epsilon_symbol = std::get<0>(*args);\n  const string &unknown_symbol = std::get<1>(*args);\n  const string &vocab = std::get<2>(*args);\n  char **models = std::get<3>(*args);\n  const int models_length = std::get<4>(*args);\n  const string &out = std::get<5>(*args);\n  const string &save_isymbols = std::get<6>(*args);\n  const string &save_fsymbols = std::get<7>(*args);\n  const string &save_osymbols = std::get<8>(*args);\n\n  SymbolTable isyms,  // input (e.g. word tokens)\n      osyms,          // output (e.g. tags)\n      fsyms;          // feature (e.g. word identity, suffix, etc.)\n  isyms.AddSymbol(epsilon_symbol);\n  osyms.AddSymbol(epsilon_symbol);\n  fsyms.AddSymbol(epsilon_symbol);\n  isyms.AddSymbol(unknown_symbol);\n\n  VLOG(1) << \"start-of-sentence label is \"\n          << LinearFstData<Arc>::kStartOfSentence;\n  VLOG(1) << \"end-of-sentence label is \" << LinearFstData<Arc>::kEndOfSentence;\n\n  if (FLAGS_classifier) {\n    int num_classes = ScanNumClasses(models, models_length);\n    LinearClassifierFstDataBuilder<Arc> builder(num_classes, &isyms, &fsyms,\n                                                &osyms);\n\n    AddVocab(vocab, &isyms, &fsyms, &osyms, &builder);\n    for (int i = 0; i < models_length; ++i)\n      AddModel(models[i], &fsyms, &osyms, &builder);\n\n    LinearClassifierFst<Arc> fst(builder.Dump(), num_classes, &isyms, &osyms);\n    fst.Write(out);\n  } else {\n    LinearFstDataBuilder<Arc> builder(&isyms, &fsyms, &osyms);\n\n    AddVocab(vocab, &isyms, &fsyms, &osyms, &builder);\n    for (int i = 0; i < models_length; ++i)\n      AddModel(models[i], &fsyms, &osyms, &builder);\n\n    LinearTaggerFst<Arc> fst(builder.Dump(), &isyms, &osyms);\n    fst.Write(out);\n  }\n\n  if (!save_isymbols.empty()) isyms.WriteText(save_isymbols);\n  if (!save_fsymbols.empty()) fsyms.WriteText(save_fsymbols);\n  if (!save_osymbols.empty()) osyms.WriteText(save_osymbols);\n}\n\nvoid LinearCompile(const string &arc_type, const string &epsilon_symbol,\n                   const string &unknown_symbol, const string &vocab,\n                   char **models, int models_len, const string &out,\n                   const string &save_isymbols, const string &save_fsymbols,\n                   const string &save_osymbols);\n\ntemplate <class Arc>\nbool GetVocabRecord(const string &vocab, std::istream &strm,  // NOLINT\n                    SymbolTable *isyms, SymbolTable *fsyms, SymbolTable *osyms,\n                    typename Arc::Label *word,\n                    std::vector<typename Arc::Label> *feature_labels,\n                    std::vector<typename Arc::Label> *possible_labels,\n                    size_t *num_line) {\n  string line;\n  if (!std::getline(strm, line)) return false;\n  ++(*num_line);\n\n  std::vector<string> fields;\n  SplitByWhitespace(line, &fields);\n  if (fields.size() != 3)\n    LOG(FATAL) << \"Wrong number of fields in source \" << vocab << \", line \"\n               << num_line;\n\n  feature_labels->clear();\n  possible_labels->clear();\n\n  *word = LookUp<Arc>(fields[0], isyms);\n\n  const char delim = FLAGS_delimiter[0];\n  SplitAndPush<Arc>(fields[1], delim, fsyms, feature_labels);\n  SplitAndPush<Arc>(fields[2], delim, osyms, possible_labels);\n\n  return true;\n}\n\ntemplate <class Arc>\nbool GetModelRecord(const string &model, std::istream &strm,  // NOLINT\n                    SymbolTable *fsyms, SymbolTable *osyms,\n                    std::vector<typename Arc::Label> *input_labels,\n                    std::vector<typename Arc::Label> *output_labels,\n                    typename Arc::Weight *weight, size_t *num_line) {\n  string line;\n  if (!std::getline(strm, line)) return false;\n  ++(*num_line);\n\n  std::vector<string> fields;\n  SplitByWhitespace(line, &fields);\n  if (fields.size() != 3)\n    LOG(FATAL) << \"Wrong number of fields in source \" << model << \", line \"\n               << num_line;\n\n  input_labels->clear();\n  output_labels->clear();\n\n  const char delim = FLAGS_delimiter[0];\n  SplitAndPush<Arc>(fields[0], delim, fsyms, input_labels);\n  SplitAndPush<Arc>(fields[1], delim, osyms, output_labels);\n\n  *weight = StrToWeight<typename Arc::Weight>(fields[2], model, *num_line);\n\n  GuessStartOrEnd<Arc>(input_labels, kNoLabel);\n  GuessStartOrEnd<Arc>(output_labels, kNoLabel);\n\n  return true;\n}\n}  // namespace script\n}  // namespace fst\n\n#define REGISTER_FST_LINEAR_OPERATIONS(Arc) \\\n  REGISTER_FST_OPERATION(LinearCompileTpl, Arc, LinearCompileArgs);\n\n#endif  // FST_EXTENSIONS_LINEAR_LINEARSCRIPT_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/extensions/linear/loglinear-apply.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#ifndef FST_EXTENSIONS_LINEAR_LOGLINEAR_APPLY_H_\n#define FST_EXTENSIONS_LINEAR_LOGLINEAR_APPLY_H_\n\n#include <fst/compat.h>\n#include <fst/arc.h>\n#include <fst/arc-map.h>\n#include <fst/compose.h>\n#include <fst/determinize.h>\n#include <fst/float-weight.h>\n#include <fst/fst.h>\n#include <fst/minimize.h>\n#include <fst/mutable-fst.h>\n#include <fst/project.h>\n#include <fst/rmepsilon.h>\n#include <fst/vector-fst.h>\n\nnamespace fst {\n\n// Applies a FST model as a discriminative model to weighted input\n// `ifst`. `A` is an arc type with tropical weight of all the\n// input/output FSTs.\n//\n// In general, consider `ifst` an unnormalized probability\n// distribution between its input X and output Y, P(X, Y); and `lfst`\n// a group of unnormalized probability distributions of all its output\n// Z for every input Y, Q(Z|Y). `normalize` controls whether Q is\n// normalized for every Y before chaining with P(X, Y). I.e., for a\n// path (X, Y, Z) in `ofst` (where Y is hidden),\n//\n// - When `normalize` is true, its weight is P(X, Y) Q(Z|Y) / sum_z Q(z|Y);\n// - When `normalize` is false, its weight is P(X, Y) Q(Z|Y).\ntemplate <class A>\nvoid LogLinearApply(const Fst<A> &ifst, const Fst<A> &lfst, MutableFst<A> *ofst,\n                    bool normalize = true) {\n  LogLinearApply<A, LogArc>(ifst, lfst, ofst, normalize);\n}\n\n// This version gives finer control over the arc type (`B`) to be used\n// in normalization. `B` is an arc type with log weight (e.g. `LogArc`\n// or `Log64Arc`).\ntemplate <class A, class B>\nvoid LogLinearApply(const Fst<A> &ifst, const Fst<A> &lfst, MutableFst<A> *ofst,\n                    bool normalize = true) {\n  if (normalize) {\n    VectorFst<A> unnormalized_ofst, rescored_ifsa;\n    Compose(ifst, lfst, &unnormalized_ofst);\n    {\n      VectorFst<A> tropical_ifsa(unnormalized_ofst);\n      Project(&tropical_ifsa, PROJECT_INPUT);\n      {\n        VectorFst<B> minimal_log_ifsa;\n        {\n          VectorFst<B> log_ifsa;\n          ArcMap(tropical_ifsa, &log_ifsa, WeightConvertMapper<A, B>());\n          RmEpsilon(&log_ifsa);\n          Determinize(log_ifsa, &minimal_log_ifsa);\n        }\n        Minimize(&minimal_log_ifsa);\n        ArcMap(&minimal_log_ifsa, InvertWeightMapper<B>());\n        ArcMap(minimal_log_ifsa, &tropical_ifsa, WeightConvertMapper<B, A>());\n      }\n      ArcSort(&tropical_ifsa, OLabelCompare<A>());\n      Compose(tropical_ifsa, ifst, &rescored_ifsa);\n    }\n    ArcSort(&rescored_ifsa, OLabelCompare<A>());\n    Compose(rescored_ifsa, unnormalized_ofst, ofst);\n  } else {\n    Compose(ifst, lfst, ofst);\n  }\n}\n\n}  // namespace fst\n\n#endif  // FST_EXTENSIONS_LINEAR_LOGLINEAR_APPLY_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/extensions/linear/trie.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#ifndef FST_EXTENSIONS_LINEAR_TRIE_H_\n#define FST_EXTENSIONS_LINEAR_TRIE_H_\n\n#include <unordered_map>\n#include <utility>\n#include <vector>\n\n#include <fst/compat.h>\n#include <fst/util.h>\n\nnamespace fst {\n\nconst int kNoTrieNodeId = -1;\n\n// Forward declarations of all available trie topologies.\ntemplate <class L, class H>\nclass NestedTrieTopology;\ntemplate <class L, class H>\nclass FlatTrieTopology;\n\n// A pair of parent node id and label, part of a trie edge\ntemplate <class L>\nstruct ParentLabel {\n  int parent;\n  L label;\n\n  ParentLabel() {}\n  ParentLabel(int p, L l) : parent(p), label(l) {}\n\n  bool operator==(const ParentLabel &that) const {\n    return parent == that.parent && label == that.label;\n  }\n\n  std::istream &Read(std::istream &strm) {  // NOLINT\n    ReadType(strm, &parent);\n    ReadType(strm, &label);\n    return strm;\n  }\n\n  std::ostream &Write(std::ostream &strm) const {  // NOLINT\n    WriteType(strm, parent);\n    WriteType(strm, label);\n    return strm;\n  }\n};\n\ntemplate <class L, class H>\nstruct ParentLabelHash {\n  size_t operator()(const ParentLabel<L> &pl) const {\n    return static_cast<size_t>(pl.parent * 7853 + H()(pl.label));\n  }\n};\n\n// The trie topology in a nested tree of hash maps; allows efficient\n// iteration over children of a specific node.\ntemplate <class L, class H>\nclass NestedTrieTopology {\n public:\n  typedef L Label;\n  typedef H Hash;\n  typedef std::unordered_map<L, int, H> NextMap;\n\n  class const_iterator {\n   public:\n    typedef std::forward_iterator_tag iterator_category;\n    typedef std::pair<ParentLabel<L>, int> value_type;\n    typedef std::ptrdiff_t difference_type;\n    typedef const value_type *pointer;\n    typedef const value_type &reference;\n\n    friend class NestedTrieTopology<L, H>;\n\n    const_iterator() : ptr_(nullptr), cur_node_(kNoTrieNodeId), cur_edge_() {}\n\n    reference operator*() {\n      UpdateStub();\n      return stub_;\n    }\n    pointer operator->() {\n      UpdateStub();\n      return &stub_;\n    }\n\n    const_iterator &operator++();\n    const_iterator &operator++(int);  // NOLINT\n\n    bool operator==(const const_iterator &that) const {\n      return ptr_ == that.ptr_ && cur_node_ == that.cur_node_ &&\n             cur_edge_ == that.cur_edge_;\n    }\n    bool operator!=(const const_iterator &that) const {\n      return !(*this == that);\n    }\n\n   private:\n    const_iterator(const NestedTrieTopology *ptr, int cur_node)\n        : ptr_(ptr), cur_node_(cur_node) {\n      SetProperCurEdge();\n    }\n\n    void SetProperCurEdge() {\n      if (cur_node_ < ptr_->NumNodes())\n        cur_edge_ = ptr_->nodes_[cur_node_]->begin();\n      else\n        cur_edge_ = ptr_->nodes_[0]->begin();\n    }\n\n    void UpdateStub() {\n      stub_.first = ParentLabel<L>(cur_node_, cur_edge_->first);\n      stub_.second = cur_edge_->second;\n    }\n\n    const NestedTrieTopology *ptr_;\n    int cur_node_;\n    typename NextMap::const_iterator cur_edge_;\n    value_type stub_;\n  };\n\n  NestedTrieTopology();\n  NestedTrieTopology(const NestedTrieTopology &that);\n  ~NestedTrieTopology();\n  void swap(NestedTrieTopology &that);\n  NestedTrieTopology &operator=(const NestedTrieTopology &that);\n  bool operator==(const NestedTrieTopology &that) const;\n  bool operator!=(const NestedTrieTopology &that) const;\n\n  int Root() const { return 0; }\n  size_t NumNodes() const { return nodes_.size(); }\n  int Insert(int parent, const L &label);\n  int Find(int parent, const L &label) const;\n  const NextMap &ChildrenOf(int parent) const { return *nodes_[parent]; }\n\n  std::istream &Read(std::istream &strm);         // NOLINT\n  std::ostream &Write(std::ostream &strm) const;  // NOLINT\n\n  const_iterator begin() const { return const_iterator(this, 0); }\n  const_iterator end() const { return const_iterator(this, NumNodes()); }\n\n private:\n  std::vector<NextMap *>\n      nodes_;  // Use pointers to avoid copying the maps when the\n               // vector grows\n};\n\ntemplate <class L, class H>\nNestedTrieTopology<L, H>::NestedTrieTopology() {\n  nodes_.push_back(new NextMap);\n}\n\ntemplate <class L, class H>\nNestedTrieTopology<L, H>::NestedTrieTopology(const NestedTrieTopology &that) {\n  nodes_.reserve(that.nodes_.size());\n  for (size_t i = 0; i < that.nodes_.size(); ++i) {\n    NextMap *node = that.nodes_[i];\n    nodes_.push_back(new NextMap(*node));\n  }\n}\n\ntemplate <class L, class H>\nNestedTrieTopology<L, H>::~NestedTrieTopology() {\n  for (size_t i = 0; i < nodes_.size(); ++i) {\n    NextMap *node = nodes_[i];\n    delete node;\n  }\n}\n\n// TODO(wuke): std::swap compatibility\ntemplate <class L, class H>\ninline void NestedTrieTopology<L, H>::swap(NestedTrieTopology &that) {\n  nodes_.swap(that.nodes_);\n}\n\ntemplate <class L, class H>\ninline NestedTrieTopology<L, H> &NestedTrieTopology<L, H>::operator=(\n    const NestedTrieTopology &that) {\n  NestedTrieTopology copy(that);\n  swap(copy);\n  return *this;\n}\n\ntemplate <class L, class H>\ninline bool NestedTrieTopology<L, H>::operator==(\n    const NestedTrieTopology &that) const {\n  if (NumNodes() != that.NumNodes()) return false;\n  for (int i = 0; i < NumNodes(); ++i)\n    if (ChildrenOf(i) != that.ChildrenOf(i)) return false;\n  return true;\n}\n\ntemplate <class L, class H>\ninline bool NestedTrieTopology<L, H>::operator!=(\n    const NestedTrieTopology &that) const {\n  return !(*this == that);\n}\n\ntemplate <class L, class H>\ninline int NestedTrieTopology<L, H>::Insert(int parent, const L &label) {\n  int ret = Find(parent, label);\n  if (ret == kNoTrieNodeId) {\n    ret = NumNodes();\n    (*nodes_[parent])[label] = ret;\n    nodes_.push_back(new NextMap);\n  }\n  return ret;\n}\n\ntemplate <class L, class H>\ninline int NestedTrieTopology<L, H>::Find(int parent, const L &label) const {\n  typename NextMap::const_iterator it = nodes_[parent]->find(label);\n  return it == nodes_[parent]->end() ? kNoTrieNodeId : it->second;\n}\n\ntemplate <class L, class H>\ninline std::istream &NestedTrieTopology<L, H>::Read(\n    std::istream &strm) {  // NOLINT\n  NestedTrieTopology new_trie;\n  size_t num_nodes;\n  if (!ReadType(strm, &num_nodes)) return strm;\n  for (size_t i = 1; i < num_nodes; ++i) new_trie.nodes_.push_back(new NextMap);\n  for (size_t i = 0; i < num_nodes; ++i) ReadType(strm, new_trie.nodes_[i]);\n  if (strm) swap(new_trie);\n  return strm;\n}\n\ntemplate <class L, class H>\ninline std::ostream &NestedTrieTopology<L, H>::Write(\n    std::ostream &strm) const {  // NOLINT\n  WriteType(strm, NumNodes());\n  for (size_t i = 0; i < NumNodes(); ++i) WriteType(strm, *nodes_[i]);\n  return strm;\n}\n\ntemplate <class L, class H>\ninline typename NestedTrieTopology<L, H>::const_iterator\n    &NestedTrieTopology<L, H>::const_iterator::operator++() {\n  ++cur_edge_;\n  if (cur_edge_ == ptr_->nodes_[cur_node_]->end()) {\n    ++cur_node_;\n    while (cur_node_ < ptr_->NumNodes() && ptr_->nodes_[cur_node_]->empty())\n      ++cur_node_;\n    SetProperCurEdge();\n  }\n  return *this;\n}\n\ntemplate <class L, class H>\ninline typename NestedTrieTopology<L, H>::const_iterator\n    &NestedTrieTopology<L, H>::const_iterator::operator++(int) {  // NOLINT\n  const_iterator save(*this);\n  ++(*this);\n  return save;\n}\n\n// The trie topology in a single hash map; only allows iteration over\n// all the edges in arbitrary order.\ntemplate <class L, class H>\nclass FlatTrieTopology {\n private:\n  typedef std::unordered_map<ParentLabel<L>, int, ParentLabelHash<L, H>>\n      NextMap;\n\n public:\n  // Iterator over edges as std::pair<ParentLabel<L>, int>\n  typedef typename NextMap::const_iterator const_iterator;\n  typedef L Label;\n  typedef H Hash;\n\n  FlatTrieTopology() {}\n  FlatTrieTopology(const FlatTrieTopology &that) : next_(that.next_) {}\n  template <class T>\n  explicit FlatTrieTopology(const T &that);\n\n  // TODO(wuke): std::swap compatibility\n  void swap(FlatTrieTopology &that) { next_.swap(that.next_); }\n\n  bool operator==(const FlatTrieTopology &that) const {\n    return next_ == that.next_;\n  }\n  bool operator!=(const FlatTrieTopology &that) const {\n    return !(*this == that);\n  }\n\n  int Root() const { return 0; }\n  size_t NumNodes() const { return next_.size() + 1; }\n  int Insert(int parent, const L &label);\n  int Find(int parent, const L &label) const;\n\n  std::istream &Read(std::istream &strm) {  // NOLINT\n    return ReadType(strm, &next_);\n  }\n  std::ostream &Write(std::ostream &strm) const {  // NOLINT\n    return WriteType(strm, next_);\n  }\n\n  const_iterator begin() const { return next_.begin(); }\n  const_iterator end() const { return next_.end(); }\n\n private:\n  NextMap next_;\n};\n\ntemplate <class L, class H>\ntemplate <class T>\nFlatTrieTopology<L, H>::FlatTrieTopology(const T &that)\n    : next_(that.begin(), that.end()) {}\n\ntemplate <class L, class H>\ninline int FlatTrieTopology<L, H>::Insert(int parent, const L &label) {\n  int ret = Find(parent, label);\n  if (ret == kNoTrieNodeId) {\n    ret = NumNodes();\n    next_[ParentLabel<L>(parent, label)] = ret;\n  }\n  return ret;\n}\n\ntemplate <class L, class H>\ninline int FlatTrieTopology<L, H>::Find(int parent, const L &label) const {\n  typename NextMap::const_iterator it =\n      next_.find(ParentLabel<L>(parent, label));\n  return it == next_.end() ? kNoTrieNodeId : it->second;\n}\n\n// A collection of implementations of the trie data structure. The key\n// is a sequence of type `L` which must be hashable. The value is of\n// `V` which must be default constructible and copyable. In addition,\n// a value object is stored for each node in the trie therefore\n// copying `V` should be cheap.\n//\n// One can access the store values with an integer node id, using the\n// [] operator. A valid node id can be obtained by the following ways:\n//\n// 1. Using the `Root()` method to get the node id of the root.\n//\n// 2. Iterating through 0 to `NumNodes() - 1`. The node ids are dense\n// so every integer in this range is a valid node id.\n//\n// 3. Using the node id returned from a successful `Insert()` or\n// `Find()` call.\n//\n// 4. Iterating over the trie edges with an `EdgeIterator` and using\n// the node ids returned from its `Parent()` and `Child()` methods.\n//\n// Below is an example of inserting keys into the trie:\n//\n//   const string words[] = {\"hello\", \"health\", \"jello\"};\n//   Trie<char, bool> dict;\n//   for (auto word : words) {\n//     int cur = dict.Root();\n//     for (char c : word) {\n//       cur = dict.Insert(cur, c);\n//     }\n//     dict[cur] = true;\n//   }\n//\n// And the following is an example of looking up the longest prefix of\n// a string using the trie constructed above:\n//\n//   string query = \"healed\";\n//   size_t prefix_length = 0;\n//   int cur = dict.Find(dict.Root(), query[prefix_length]);\n//   while (prefix_length < query.size() &&\n//     cur != Trie<char, bool>::kNoNodeId) {\n//     ++prefix_length;\n//     cur = dict.Find(cur, query[prefix_length]);\n//   }\ntemplate <class L, class V, class T>\nclass MutableTrie {\n public:\n  template <class LL, class VV, class TT>\n  friend class MutableTrie;\n\n  typedef L Label;\n  typedef V Value;\n  typedef T Topology;\n\n  // Constructs a trie with only the root node.\n  MutableTrie() {}\n\n  // Conversion from another trie of a possiblly different\n  // topology. The underlying topology must supported conversion.\n  template <class S>\n  explicit MutableTrie(const MutableTrie<L, V, S> &that)\n      : topology_(that.topology_), values_(that.values_) {}\n\n  // TODO(wuke): std::swap compatibility\n  void swap(MutableTrie &that) {\n    topology_.swap(that.topology_);\n    values_.swap(that.values_);\n  }\n\n  int Root() const { return topology_.Root(); }\n  size_t NumNodes() const { return topology_.NumNodes(); }\n\n  // Inserts an edge with given `label` at node `parent`. Returns the\n  // child node id. If the node already exists, returns the node id\n  // right away.\n  int Insert(int parent, const L &label) {\n    int ret = topology_.Insert(parent, label);\n    values_.resize(NumNodes());\n    return ret;\n  }\n\n  // Finds the node id of the node from `parent` via `label`. Returns\n  // `kNoTrieNodeId` when such a node does not exist.\n  int Find(int parent, const L &label) const {\n    return topology_.Find(parent, label);\n  }\n\n  const T &TrieTopology() const { return topology_; }\n\n  // Accesses the value stored for the given node.\n  V &operator[](int node_id) { return values_[node_id]; }\n  const V &operator[](int node_id) const { return values_[node_id]; }\n\n  // Comparison by content\n  bool operator==(const MutableTrie &that) const {\n    return topology_ == that.topology_ && values_ == that.values_;\n  }\n\n  bool operator!=(const MutableTrie &that) const { return !(*this == that); }\n\n  std::istream &Read(std::istream &strm) {  // NOLINT\n    ReadType(strm, &topology_);\n    ReadType(strm, &values_);\n    return strm;\n  }\n  std::ostream &Write(std::ostream &strm) const {  // NOLINT\n    WriteType(strm, topology_);\n    WriteType(strm, values_);\n    return strm;\n  }\n\n private:\n  T topology_;\n  std::vector<V> values_;\n};\n\n}  // namespace fst\n\n#endif  // FST_EXTENSIONS_LINEAR_TRIE_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/extensions/mpdt/compose.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Compose an MPDT and an FST.\n\n#ifndef FST_EXTENSIONS_MPDT_COMPOSE_H_\n#define FST_EXTENSIONS_MPDT_COMPOSE_H_\n\n#include <list>\n\n#include <fst/extensions/mpdt/mpdt.h>\n#include <fst/extensions/pdt/compose.h>\n#include <fst/compose.h>\n\nnamespace fst {\n\ntemplate <class Filter>\nclass MPdtParenFilter {\n public:\n  using FST1 = typename Filter::FST1;\n  using FST2 = typename Filter::FST2;\n  using Arc = typename Filter::Arc;\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using Matcher1 = typename Filter::Matcher1;\n  using Matcher2 = typename Filter::Matcher2;\n\n  using StackId = StateId;\n  using ParenStack = internal::MPdtStack<StackId, Label>;\n  using FilterState1 = typename Filter::FilterState;\n  using FilterState2 = IntegerFilterState<StackId>;\n  using FilterState = PairFilterState<FilterState1, FilterState2>;\n\n  MPdtParenFilter(const FST1 &fst1, const FST2 &fst2,\n                  Matcher1 *matcher1 = nullptr, Matcher2 *matcher2 = nullptr,\n                  const std::vector<std::pair<Label, Label>> *parens = nullptr,\n                  const std::vector<Label> *assignments = nullptr,\n                  bool expand = false, bool keep_parens = true)\n      : filter_(fst1, fst2, matcher1, matcher2),\n        parens_(parens ? *parens : std::vector<std::pair<Label, Label>>()),\n        assignments_(assignments ? *assignments : std::vector<Label>()),\n        expand_(expand),\n        keep_parens_(keep_parens),\n        fs_(FilterState::NoState()),\n        stack_(parens_, assignments_),\n        paren_id_(-1) {\n    if (parens) {\n      for (const auto &pair : *parens) {\n        parens_.push_back(pair);\n        GetMatcher1()->AddOpenParen(pair.first);\n        GetMatcher2()->AddOpenParen(pair.first);\n        if (!expand_) {\n          GetMatcher1()->AddCloseParen(pair.second);\n          GetMatcher2()->AddCloseParen(pair.second);\n        }\n      }\n    }\n  }\n\n  MPdtParenFilter(const MPdtParenFilter &filter, bool safe = false)\n      : filter_(filter.filter_, safe),\n        parens_(filter.parens_),\n        expand_(filter.expand_),\n        keep_parens_(filter.keep_parens_),\n        fs_(FilterState::NoState()),\n        stack_(filter.parens_, filter.assignments_),\n        paren_id_(-1) {}\n\n  FilterState Start() const {\n    return FilterState(filter_.Start(), FilterState2(0));\n  }\n\n  void SetState(StateId s1, StateId s2, const FilterState &fs) {\n    fs_ = fs;\n    filter_.SetState(s1, s2, fs_.GetState1());\n    if (!expand_) return;\n    const auto paren_id = stack_.Top(fs.GetState2().GetState());\n    if (paren_id != paren_id_) {\n      if (paren_id_ != -1) {\n        GetMatcher1()->RemoveCloseParen(parens_[paren_id_].second);\n        GetMatcher2()->RemoveCloseParen(parens_[paren_id_].second);\n      }\n      paren_id_ = paren_id;\n      if (paren_id_ != -1) {\n        GetMatcher1()->AddCloseParen(parens_[paren_id_].second);\n        GetMatcher2()->AddCloseParen(parens_[paren_id_].second);\n      }\n    }\n  }\n\n  FilterState FilterArc(Arc *arc1, Arc *arc2) const {\n    const auto fs1 = filter_.FilterArc(arc1, arc2);\n    const auto &fs2 = fs_.GetState2();\n    if (fs1 == FilterState1::NoState()) return FilterState::NoState();\n    if (arc1->olabel == kNoLabel && arc2->ilabel) {  // arc2 parentheses.\n      if (keep_parens_) {\n        arc1->ilabel = arc2->ilabel;\n      } else if (arc2->ilabel) {\n        arc2->olabel = arc1->ilabel;\n      }\n      return FilterParen(arc2->ilabel, fs1, fs2);\n    } else if (arc2->ilabel == kNoLabel && arc1->olabel) {  // arc1 parentheses\n      if (keep_parens_) {\n        arc2->olabel = arc1->olabel;\n      } else {\n        arc1->ilabel = arc2->olabel;\n      }\n      return FilterParen(arc1->olabel, fs1, fs2);\n    } else {\n      return FilterState(fs1, fs2);\n    }\n  }\n\n  void FilterFinal(Weight *w1, Weight *w2) const {\n    if (fs_.GetState2().GetState() != 0) *w1 = Weight::Zero();\n    filter_.FilterFinal(w1, w2);\n  }\n\n  // Returns respective matchers; ownership stays with filter.\n\n  Matcher1 *GetMatcher1() { return filter_.GetMatcher1(); }\n\n  Matcher2 *GetMatcher2() { return filter_.GetMatcher2(); }\n\n  uint64_t Properties(uint64_t iprops) const {\n    const auto oprops = filter_.Properties(iprops);\n    return oprops & kILabelInvariantProperties & kOLabelInvariantProperties;\n  }\n\n private:\n  const FilterState FilterParen(Label label, const FilterState1 &fs1,\n                                const FilterState2 &fs2) const {\n    if (!expand_) return FilterState(fs1, fs2);\n    const auto stack_id = stack_.Find(fs2.GetState(), label);\n    if (stack_id < 0) {\n      return FilterState::NoState();\n    } else {\n      return FilterState(fs1, FilterState2(stack_id));\n    }\n  }\n\n  Filter filter_;\n  std::vector<std::pair<Label, Label>> parens_;\n  std::vector<Label> assignments_;\n  bool expand_;       // Expands to FST?\n  bool keep_parens_;  // Retains parentheses in output?\n  FilterState fs_;    // Current filter state.\n  mutable ParenStack stack_;\n  std::ptrdiff_t paren_id_;\n};\n\n// Class to setup composition options for MPDT composition. Default is to take\n// the MPDT as the first composition argument.\ntemplate <class Arc, bool left_pdt = true>\nclass MPdtComposeFstOptions\n    : public ComposeFstOptions<Arc, ParenMatcher<Fst<Arc>>,\n                               MPdtParenFilter<AltSequenceComposeFilter<\n                                   ParenMatcher<Fst<Arc>> >> > {\n public:\n  using Label = typename Arc::Label;\n  using MPdtMatcher = ParenMatcher<Fst<Arc>>;\n  using MPdtFilter = MPdtParenFilter<AltSequenceComposeFilter<MPdtMatcher>>;\n\n  using ComposeFstOptions<Arc, MPdtMatcher, MPdtFilter>::matcher1;\n  using ComposeFstOptions<Arc, MPdtMatcher, MPdtFilter>::matcher2;\n  using ComposeFstOptions<Arc, MPdtMatcher, MPdtFilter>::filter;\n\n  MPdtComposeFstOptions(const Fst<Arc> &ifst1,\n                        const std::vector<std::pair<Label, Label>> &parens,\n                        const std::vector<typename Arc::Label> &assignments,\n                        const Fst<Arc> &ifst2, bool expand = false,\n                        bool keep_parens = true) {\n    matcher1 = new MPdtMatcher(ifst1, MATCH_OUTPUT, kParenList);\n    matcher2 = new MPdtMatcher(ifst2, MATCH_INPUT, kParenLoop);\n    filter = new MPdtFilter(ifst1, ifst2, matcher1, matcher2, &parens,\n                            &assignments, expand, keep_parens);\n  }\n};\n\n// Class to setup composition options for PDT with FST composition.\n// Specialization is for the FST as the first composition argument.\ntemplate <class Arc>\nclass MPdtComposeFstOptions<Arc, false>\n    : public ComposeFstOptions<\n          Arc, ParenMatcher<Fst<Arc>>,\n          MPdtParenFilter<SequenceComposeFilter<ParenMatcher<Fst<Arc>> >> > {\n public:\n  using Label = typename Arc::Label;\n  using MPdtMatcher = ParenMatcher<Fst<Arc>>;\n  using MPdtFilter = MPdtParenFilter<SequenceComposeFilter<MPdtMatcher>>;\n\n  using ComposeFstOptions<Arc, MPdtMatcher, MPdtFilter>::matcher1;\n  using ComposeFstOptions<Arc, MPdtMatcher, MPdtFilter>::matcher2;\n  using ComposeFstOptions<Arc, MPdtMatcher, MPdtFilter>::filter;\n\n  MPdtComposeFstOptions(const Fst<Arc> &ifst1, const Fst<Arc> &ifst2,\n                        const std::vector<std::pair<Label, Label>> &parens,\n                        const std::vector<typename Arc::Label> &assignments,\n                        bool expand = false, bool keep_parens = true) {\n    matcher1 = new MPdtMatcher(ifst1, MATCH_OUTPUT, kParenLoop);\n    matcher2 = new MPdtMatcher(ifst2, MATCH_INPUT, kParenList);\n    filter = new MPdtFilter(ifst1, ifst2, matcher1, matcher2, &parens,\n                            &assignments, expand, keep_parens);\n  }\n};\n\nstruct MPdtComposeOptions {\n  bool connect;                  // Connect output?\n  PdtComposeFilter filter_type;  // Which pre-defined filter to use.\n\n  explicit MPdtComposeOptions(bool connect = true,\n                              PdtComposeFilter filter_type = PAREN_FILTER)\n      : connect(connect), filter_type(filter_type) {}\n};\n\n// Composes multi-pushdown transducer (MPDT) encoded as an FST (1st arg) and an\n// FST (2nd arg) with the result also an MPDT encoded as an FST (3rd arg). In\n// theMPDTs, some transitions are labeled with open or close parentheses (and\n// associated with a stack). To be interpreted as an MPDT, the parents on each\n// stack must balance on a path (see MPdtExpand()). The open-close parenthesis\n// label pairs are passed using the parens arguments, and the stack assignments\n// are passed using the assignments argument.\ntemplate <class Arc>\nvoid Compose(\n    const Fst<Arc> &ifst1,\n    const std::vector<std::pair<typename Arc::Label, typename Arc::Label>>\n        &parens,\n    const std::vector<typename Arc::Label> &assignments, const Fst<Arc> &ifst2,\n    MutableFst<Arc> *ofst,\n    const MPdtComposeOptions &opts = MPdtComposeOptions()) {\n  bool expand = opts.filter_type != PAREN_FILTER;\n  bool keep_parens = opts.filter_type != EXPAND_FILTER;\n  MPdtComposeFstOptions<Arc, true> copts(ifst1, parens, assignments, ifst2,\n                                         expand, keep_parens);\n  copts.gc_limit = 0;\n  *ofst = ComposeFst<Arc>(ifst1, ifst2, copts);\n  if (opts.connect) Connect(ofst);\n}\n\n// Composes an FST (1st arg) and a multi-pushdown transducer (MPDT) encoded as\n// an FST (2nd arg) with the result also an MPDT encoded as an FST (3rd arg).\n// In the MPDTs, some transitions are labeled with open or close parentheses\n// (and associated with a stack). To be interpreted as an MPDT, the parents on\n// each stack must balance on a path (see MPdtExpand()). The open-close\n// parenthesis label pairs are passed using the parens arguments, and the stack\n// assignments are passed using the assignments argument.\ntemplate <class Arc>\nvoid Compose(\n    const Fst<Arc> &ifst1, const Fst<Arc> &ifst2,\n    const std::vector<std::pair<typename Arc::Label, typename Arc::Label>>\n        &parens,\n    const std::vector<typename Arc::Label> &assignments, MutableFst<Arc> *ofst,\n    const MPdtComposeOptions &opts = MPdtComposeOptions()) {\n  bool expand = opts.filter_type != PAREN_FILTER;\n  bool keep_parens = opts.filter_type != EXPAND_FILTER;\n  MPdtComposeFstOptions<Arc, false> copts(ifst1, ifst2, parens, assignments,\n                                          expand, keep_parens);\n  copts.gc_limit = 0;\n  *ofst = ComposeFst<Arc>(ifst1, ifst2, copts);\n  if (opts.connect) Connect(ofst);\n}\n\n}  // namespace fst\n\n#endif  // FST_EXTENSIONS_MPDT_COMPOSE_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/extensions/mpdt/expand.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Expands an MPDT to an FST.\n\n#ifndef FST_EXTENSIONS_MPDT_EXPAND_H_\n#define FST_EXTENSIONS_MPDT_EXPAND_H_\n\n#include <vector>\n\n#include <fst/extensions/mpdt/mpdt.h>\n#include <fst/extensions/pdt/paren.h>\n#include <fst/cache.h>\n#include <fst/mutable-fst.h>\n#include <fst/queue.h>\n#include <fst/state-table.h>\n#include <fst/test-properties.h>\n\nnamespace fst {\n\ntemplate <class Arc>\nstruct MPdtExpandFstOptions : public CacheOptions {\n  bool keep_parentheses;\n  internal::MPdtStack<typename Arc::StateId, typename Arc::Label> *stack;\n  PdtStateTable<typename Arc::StateId, typename Arc::StateId> *state_table;\n\n  MPdtExpandFstOptions(\n      const CacheOptions &opts = CacheOptions(), bool kp = false,\n      internal::MPdtStack<typename Arc::StateId, typename Arc::Label> *s =\n          nullptr,\n      PdtStateTable<typename Arc::StateId, typename Arc::StateId> *st = nullptr)\n      : CacheOptions(opts), keep_parentheses(kp), stack(s), state_table(st) {}\n};\n\n// Properties for an expanded PDT.\ninline uint64_t MPdtExpandProperties(uint64_t inprops) {\n  return inprops & (kAcceptor | kAcyclic | kInitialAcyclic | kUnweighted);\n}\n\nnamespace internal {\n\n// Implementation class for ExpandFst\ntemplate <class Arc>\nclass MPdtExpandFstImpl : public CacheImpl<Arc> {\n public:\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using StackId = StateId;\n  using StateTuple = PdtStateTuple<StateId, StackId>;\n  using ParenStack = internal::MPdtStack<StateId, Label>;\n\n  using FstImpl<Arc>::SetType;\n  using FstImpl<Arc>::SetProperties;\n  using FstImpl<Arc>::Properties;\n  using FstImpl<Arc>::SetInputSymbols;\n  using FstImpl<Arc>::SetOutputSymbols;\n\n  using CacheBaseImpl<CacheState<Arc>>::PushArc;\n  using CacheBaseImpl<CacheState<Arc>>::HasArcs;\n  using CacheBaseImpl<CacheState<Arc>>::HasFinal;\n  using CacheBaseImpl<CacheState<Arc>>::HasStart;\n  using CacheBaseImpl<CacheState<Arc>>::SetArcs;\n  using CacheBaseImpl<CacheState<Arc>>::SetFinal;\n  using CacheBaseImpl<CacheState<Arc>>::SetStart;\n\n  MPdtExpandFstImpl(const Fst<Arc> &fst,\n                    const std::vector<std::pair<Label, Label>> &parens,\n                    const std::vector<Label> &assignments,\n                    const MPdtExpandFstOptions<Arc> &opts)\n      : CacheImpl<Arc>(opts),\n        fst_(fst.Copy()),\n        stack_(opts.stack ? opts.stack : new ParenStack(parens, assignments)),\n        state_table_(opts.state_table ? opts.state_table\n                                      : new PdtStateTable<StateId, StackId>()),\n        own_stack_(!opts.stack),\n        own_state_table_(!opts.state_table),\n        keep_parentheses_(opts.keep_parentheses) {\n    SetType(\"expand\");\n    const auto props = fst.Properties(kFstProperties, false);\n    SetProperties(MPdtExpandProperties(props), kCopyProperties);\n    SetInputSymbols(fst.InputSymbols());\n    SetOutputSymbols(fst.OutputSymbols());\n  }\n\n  MPdtExpandFstImpl(const MPdtExpandFstImpl &impl)\n      : CacheImpl<Arc>(impl),\n        fst_(impl.fst_->Copy(true)),\n        stack_(new ParenStack(*impl.stack_)),\n        state_table_(new PdtStateTable<StateId, StackId>()),\n        own_stack_(true),\n        own_state_table_(true),\n        keep_parentheses_(impl.keep_parentheses_) {\n    SetType(\"expand\");\n    SetProperties(impl.Properties(), kCopyProperties);\n    SetInputSymbols(impl.InputSymbols());\n    SetOutputSymbols(impl.OutputSymbols());\n  }\n\n  ~MPdtExpandFstImpl() override {\n    if (own_stack_) delete stack_;\n    if (own_state_table_) delete state_table_;\n  }\n\n  StateId Start() {\n    if (!HasStart()) {\n      const auto s = fst_->Start();\n      if (s == kNoStateId) return kNoStateId;\n      const StateTuple tuple(s, 0);\n      const auto start = state_table_->FindState(tuple);\n      SetStart(start);\n    }\n    return CacheImpl<Arc>::Start();\n  }\n\n  Weight Final(StateId s) {\n    if (!HasFinal(s)) {\n      const auto &tuple = state_table_->Tuple(s);\n      const auto weight = fst_->Final(tuple.state_id);\n      SetFinal(s,\n               (weight != Weight::Zero() && tuple.stack_id == 0)\n                   ? weight\n                   : Weight::Zero());\n    }\n    return CacheImpl<Arc>::Final(s);\n  }\n\n  size_t NumArcs(StateId s) {\n    if (!HasArcs(s)) ExpandState(s);\n    return CacheImpl<Arc>::NumArcs(s);\n  }\n\n  size_t NumInputEpsilons(StateId s) {\n    if (!HasArcs(s)) ExpandState(s);\n    return CacheImpl<Arc>::NumInputEpsilons(s);\n  }\n\n  size_t NumOutputEpsilons(StateId s) {\n    if (!HasArcs(s)) ExpandState(s);\n    return CacheImpl<Arc>::NumOutputEpsilons(s);\n  }\n\n  void InitArcIterator(StateId s, ArcIteratorData<Arc> *data) {\n    if (!HasArcs(s)) ExpandState(s);\n    CacheImpl<Arc>::InitArcIterator(s, data);\n  }\n\n  // Computes the outgoing transitions from a state, creating new destination\n  // states as needed.\n  void ExpandState(StateId s) {\n    const auto tuple = state_table_->Tuple(s);\n    for (ArcIterator<Fst<Arc>> aiter(*fst_, tuple.state_id); !aiter.Done();\n         aiter.Next()) {\n      auto arc = aiter.Value();\n      const auto stack_id = stack_->Find(tuple.stack_id, arc.ilabel);\n      if (stack_id == -1) {\n        continue;  // Non-matching close parenthesis.\n      } else if ((stack_id != tuple.stack_id) && !keep_parentheses_) {\n        arc.ilabel = arc.olabel = 0;  // Stack push/pop.\n      }\n      const StateTuple ntuple(arc.nextstate, stack_id);\n      arc.nextstate = state_table_->FindState(ntuple);\n      PushArc(s, arc);\n    }\n    SetArcs(s);\n  }\n\n  const ParenStack &GetStack() const { return *stack_; }\n\n  const PdtStateTable<StateId, StackId> &GetStateTable() const {\n    return *state_table_;\n  }\n\n private:\n  std::unique_ptr<const Fst<Arc>> fst_;\n  ParenStack *stack_;\n  PdtStateTable<StateId, StackId> *state_table_;\n  const bool own_stack_;\n  const bool own_state_table_;\n  const bool keep_parentheses_;\n\n  MPdtExpandFstImpl &operator=(const MPdtExpandFstImpl &) = delete;\n};\n\n}  // namespace internal\n\n// Expands a multi-pushdown transducer (MPDT) encoded as an FST into an FST.\n// This version is a delayed FST. In the MPDT, some transitions are labeled with\n// open or close parentheses. To be interpreted as an MPDT, the parens for each\n// stack must balance on a path. The open-close parenthesis label\n// pairs are passed using the parens argument, and the assignment of those pairs\n// to stacks is passed using the assignments argument. Expansion enforces the\n// parenthesis constraints. The MPDT must be\n// expandable as an FST.\n//\n// This class attaches interface to implementation and handles\n// reference counting, delegating most methods to ImplToFst.\ntemplate <class A>\nclass MPdtExpandFst : public ImplToFst<internal::MPdtExpandFstImpl<A>> {\n public:\n  using Arc = A;\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using StackId = StateId;\n  using ParenStack = internal::MPdtStack<StackId, Label>;\n  using Store = DefaultCacheStore<Arc>;\n  using State = typename Store::State;\n  using Impl = internal::MPdtExpandFstImpl<Arc>;\n\n  friend class ArcIterator<MPdtExpandFst<Arc>>;\n  friend class StateIterator<MPdtExpandFst<Arc>>;\n\n  MPdtExpandFst(const Fst<Arc> &fst,\n                const std::vector<std::pair<Label, Label>> &parens,\n                const std::vector<Label> &assignments)\n      : ImplToFst<Impl>(std::make_shared<Impl>(fst, parens, assignments,\n                                               MPdtExpandFstOptions<Arc>())) {}\n\n  MPdtExpandFst(const Fst<Arc> &fst,\n                const std::vector<std::pair<Label, Label>> &parens,\n                const std::vector<Label> &assignments,\n                const MPdtExpandFstOptions<Arc> &opts)\n      : ImplToFst<Impl>(\n            std::make_shared<Impl>(fst, parens, assignments, opts)) {}\n\n  // See Fst<>::Copy() for doc.\n  MPdtExpandFst(const MPdtExpandFst<Arc> &fst, bool safe = false)\n      : ImplToFst<Impl>(fst, safe) {}\n\n  // Get a copy of this ExpandFst. See Fst<>::Copy() for further doc.\n  MPdtExpandFst<Arc> *Copy(bool safe = false) const override {\n    return new MPdtExpandFst<A>(*this, safe);\n  }\n\n  inline void InitStateIterator(StateIteratorData<Arc> *data) const override;\n\n  void InitArcIterator(StateId s, ArcIteratorData<Arc> *data) const override {\n    GetMutableImpl()->InitArcIterator(s, data);\n  }\n\n  const ParenStack &GetStack() const { return GetImpl()->GetStack(); }\n\n  const PdtStateTable<StateId, StackId> &GetStateTable() const {\n    return GetImpl()->GetStateTable();\n  }\n\n private:\n  using ImplToFst<Impl>::GetImpl;\n  using ImplToFst<Impl>::GetMutableImpl;\n\n  void operator=(const MPdtExpandFst &) = delete;\n};\n\n// Specialization for MPdtExpandFst.\ntemplate <class Arc>\nclass StateIterator<MPdtExpandFst<Arc>>\n    : public CacheStateIterator<MPdtExpandFst<Arc>> {\n public:\n  explicit StateIterator(const MPdtExpandFst<Arc> &fst)\n      : CacheStateIterator<MPdtExpandFst<Arc>>(fst, fst.GetMutableImpl()) {}\n};\n\n// Specialization for MPdtExpandFst.\ntemplate <class Arc>\nclass ArcIterator<MPdtExpandFst<Arc>>\n    : public CacheArcIterator<MPdtExpandFst<Arc>> {\n public:\n  using StateId = typename Arc::StateId;\n\n  ArcIterator(const MPdtExpandFst<Arc> &fst, StateId s)\n      : CacheArcIterator<MPdtExpandFst<Arc>>(fst.GetMutableImpl(), s) {\n    if (!fst.GetImpl()->HasArcs(s)) fst.GetMutableImpl()->ExpandState(s);\n  }\n};\n\ntemplate <class Arc>\ninline void MPdtExpandFst<Arc>::InitStateIterator(\n    StateIteratorData<Arc> *data) const {\n  data->base = new StateIterator<MPdtExpandFst<Arc>>(*this);\n}\n\nstruct MPdtExpandOptions {\n  bool connect;\n  bool keep_parentheses;\n\n  explicit MPdtExpandOptions(bool connect = true, bool keep_parentheses = false)\n      : connect(connect), keep_parentheses(keep_parentheses) {}\n};\n\n// Expands a multi-pushdown transducer (MPDT) encoded as an FST into an FST.\n// This version writes the expanded PDT to a mutable FST. In the MPDT, some\n// transitions are labeled with open or close parentheses. To be interpreted as\n// an MPDT, the parens for each stack must balance on a path. The open-close\n// parenthesis label pair sets are passed using the parens argument, and the\n// assignment of those pairs to stacks is passed using the assignments argument.\n// The expansion enforces the parenthesis constraints. The MPDT must be\n// expandable as an FST.\ntemplate <class Arc>\nvoid Expand(const Fst<Arc> &ifst,\n            const std::vector<\n            std::pair<typename Arc::Label, typename Arc::Label>> &parens,\n            const std::vector<typename Arc::Label> &assignments,\n            MutableFst<Arc> *ofst, const MPdtExpandOptions &opts) {\n  MPdtExpandFstOptions<Arc> eopts;\n  eopts.gc_limit = 0;\n  eopts.keep_parentheses = opts.keep_parentheses;\n  *ofst = MPdtExpandFst<Arc>(ifst, parens, assignments, eopts);\n  if (opts.connect) Connect(ofst);\n}\n\n// Expands a multi-pushdown transducer (MPDT) encoded as an FST into an FST.\n// This version writes the expanded PDT to a mutable FST. In the MPDT, some\n// transitions are labeled with open or close parentheses. To be interpreted as\n// an MPDT, the parens for each stack must balance on a path. The open-close\n// parenthesis label pair sets are passed using the parens argument, and the\n// assignment of those pairs to stacks is passed using the assignments argument.\n// The expansion enforces the parenthesis constraints. The MPDT must be\n// expandable as an FST.\ntemplate <class Arc>\nvoid Expand(const Fst<Arc> &ifst,\n            const std::vector<std::pair<typename Arc::Label,\n            typename Arc::Label>> &parens,\n            const std::vector<typename Arc::Label> &assignments,\n            MutableFst<Arc> *ofst, bool connect = true,\n            bool keep_parentheses = false) {\n  const MPdtExpandOptions opts(connect, keep_parentheses);\n  Expand(ifst, parens, assignments, ofst, opts);\n}\n\n}  // namespace fst\n\n#endif  // FST_EXTENSIONS_MPDT_EXPAND_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/extensions/mpdt/info.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Prints information about an MPDT.\n\n#ifndef FST_EXTENSIONS_MPDT_INFO_H_\n#define FST_EXTENSIONS_MPDT_INFO_H_\n\n#include <unordered_map>\n#include <vector>\n\n#include <fst/extensions/mpdt/mpdt.h>\n#include <fst/fst.h>\n\nnamespace fst {\n\n// Compute various information about MPDTs, helper class for mpdtinfo.cc.\ntemplate <class Arc, typename Arc::Label nlevels = 2>\nclass MPdtInfo {\n public:\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  MPdtInfo(const Fst<Arc> &fst,\n           const std::vector<std::pair<Label, Label>> &parens,\n           const std::vector<Label> &assignments);\n\n  const string &FstType() const { return fst_type_; }\n\n  const string &ArcType() const { return Arc::Type(); }\n\n  int64_t NumStates() const { return nstates_; }\n\n  int64_t NumArcs() const { return narcs_; }\n\n  int64_t NumLevels() const { return nlevels; }\n\n  int64_t NumOpenParens(Label level) const { return nopen_parens_[level]; }\n\n  int64_t NumCloseParens(Label level) const { return nclose_parens_[level]; }\n\n  int64_t NumUniqueOpenParens(Label level) const {\n    return nuniq_open_parens_[level];\n  }\n\n  int64_t NumUniqueCloseParens(Label level) const {\n    return nuniq_close_parens_[level];\n  }\n  int64_t NumOpenParenStates(Label level) const {\n    return nopen_paren_states_[level];\n  }\n\n  int64_t NumCloseParenStates(Label level) const {\n    return nclose_paren_states_[level];\n  }\n\n  void Print();\n\n private:\n  string fst_type_;\n  int64_t nstates_;\n  int64_t narcs_;\n  int64_t nopen_parens_[nlevels];\n  int64_t nclose_parens_[nlevels];\n  int64_t nuniq_open_parens_[nlevels];\n  int64_t nuniq_close_parens_[nlevels];\n  int64_t nopen_paren_states_[nlevels];\n  int64_t nclose_paren_states_[nlevels];\n  bool error_;\n};\n\ntemplate <class Arc, typename Arc::Label nlevels>\nMPdtInfo<Arc, nlevels>::MPdtInfo(\n    const Fst<Arc> &fst,\n    const std::vector<std::pair<typename Arc::Label, typename Arc::Label>>\n        &parens,\n    const std::vector<typename Arc::Label> &assignments)\n    : fst_type_(fst.Type()), nstates_(0), narcs_(0), error_(false) {\n  std::unordered_map<Label, size_t> paren_map;\n  std::unordered_set<Label> paren_set;\n  std::unordered_map<Label, int> paren_levels;\n  std::unordered_set<StateId> open_paren_state_set;\n  std::unordered_set<StateId> close_paren_state_set;\n  if (parens.size() != assignments.size()) {\n    FSTERROR() << \"MPdtInfo: Parens of different size from assignments\";\n    error_ = true;\n    return;\n  }\n  for (Label i = 0; i < assignments.size(); ++i) {\n    // Assignments here start at 0, so assuming the human-readable version has\n    // them starting at 1, we should subtract 1 here.\n    Label level = assignments[i] - 1;\n    if (level < 0 || level >= nlevels) {\n      FSTERROR() << \"MPdtInfo: Specified level \" << level << \" out of bounds\";\n      error_ = true;\n      return;\n    }\n    const auto &pair = parens[i];\n    paren_levels[pair.first] = level;\n    paren_levels[pair.second] = level;\n    paren_map[pair.first] = i;\n    paren_map[pair.second] = i;\n  }\n  for (Label i = 0; i < nlevels; ++i) {\n    nopen_parens_[i] = 0;\n    nclose_parens_[i] = 0;\n    nuniq_open_parens_[i] = 0;\n    nuniq_close_parens_[i] = 0;\n    nopen_paren_states_[i] = 0;\n    nclose_paren_states_[i] = 0;\n  }\n  for (StateIterator<Fst<Arc>> siter(fst); !siter.Done(); siter.Next()) {\n    ++nstates_;\n    const auto s = siter.Value();\n    for (ArcIterator<Fst<Arc>> aiter(fst, s); !aiter.Done(); aiter.Next()) {\n      const auto &arc = aiter.Value();\n      ++narcs_;\n      const auto it = paren_map.find(arc.ilabel);\n      if (it != paren_map.end()) {\n        const auto open_paren = parens[it->second].first;\n        const auto close_paren = parens[it->second].second;\n        const auto level = paren_levels[arc.ilabel];\n        if (arc.ilabel == open_paren) {\n          ++nopen_parens_[level];\n          if (!paren_set.count(open_paren)) {\n            ++nuniq_open_parens_[level];\n            paren_set.insert(open_paren);\n          }\n          if (!open_paren_state_set.count(arc.nextstate)) {\n            ++nopen_paren_states_[level];\n            open_paren_state_set.insert(arc.nextstate);\n          }\n        } else {\n          ++nclose_parens_[level];\n          if (!paren_set.count(close_paren)) {\n            ++nuniq_close_parens_[level];\n            paren_set.insert(close_paren);\n          }\n          if (!close_paren_state_set.count(s)) {\n            ++nclose_paren_states_[level];\n            close_paren_state_set.insert(s);\n          }\n        }\n      }\n    }\n  }\n}\n\ntemplate <class Arc, typename Arc::Label nlevels>\nvoid MPdtInfo<Arc, nlevels>::Print() {\n  const auto old = std::cout.setf(std::ios::left);\n  std::cout.width(50);\n  std::cout << \"fst type\" << FstType() << std::endl;\n  std::cout.width(50);\n  std::cout << \"arc type\" << ArcType() << std::endl;\n  std::cout.width(50);\n  std::cout << \"# of states\" << NumStates() << std::endl;\n  std::cout.width(50);\n  std::cout << \"# of arcs\" << NumArcs() << std::endl;\n  std::cout.width(50);\n  std::cout << \"# of levels\" << NumLevels() << std::endl;\n  std::cout.width(50);\n  for (typename Arc::Label i = 0; i < nlevels; ++i) {\n    int level = i + 1;\n    std::cout << \"# of open parentheses at levelel \" << level << \"\\t\"\n              << NumOpenParens(i) << std::endl;\n    std::cout.width(50);\n    std::cout << \"# of close parentheses at levelel \" << level << \"\\t\"\n              << NumCloseParens(i) << std::endl;\n    std::cout.width(50);\n    std::cout << \"# of unique open parentheses at levelel \" << level << \"\\t\"\n              << NumUniqueOpenParens(i) << std::endl;\n    std::cout.width(50);\n    std::cout << \"# of unique close parentheses at levelel \" << level << \"\\t\"\n              << NumUniqueCloseParens(i) << std::endl;\n    std::cout.width(50);\n    std::cout << \"# of open parenthesis dest. states at levelel \" << level\n              << \"\\t\" << NumOpenParenStates(i) << std::endl;\n    std::cout.width(50);\n    std::cout << \"# of close parenthesis source states at levelel \" << level\n              << \"\\t\" << NumCloseParenStates(i) << std::endl;\n    std::cout.width(50);\n  }\n  std::cout.setf(old);\n}\n\n}  // namespace fst\n\n#endif  // FST_EXTENSIONS_MPDT_INFO_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/extensions/mpdt/mpdt.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Common classes for Multi Pushdown Transducer (MPDT) expansion/traversal.\n\n#ifndef FST_EXTENSIONS_MPDT_MPDT_H_\n#define FST_EXTENSIONS_MPDT_MPDT_H_\n\n#include <array>\n#include <functional>\n#include <map>\n#include <vector>\n\n#include <fst/compat.h>\n#include <fst/extensions/pdt/pdt.h>\n\nnamespace fst {\n\nenum MPdtType {\n  MPDT_READ_RESTRICT,   // Can only read from first empty stack\n  MPDT_WRITE_RESTRICT,  // Can only write to first empty stack\n  MPDT_NO_RESTRICT,     // No read-write restrictions\n};\n\nnamespace internal {\n\n// PLEASE READ THIS CAREFULLY:\n//\n// When USEVECTOR is set, the stack configurations --- the statewise\n// representation of the StackId's for each substack --- is stored in a vector.\n// I would like to do this using an array for efficiency reasons, thus the\n// definition of StackConfig below. However, while this *works* in that tests\n// pass, etc. It causes a memory leak in the compose and expand tests, evidently\n// in the map[] that is being used to store the mapping between these\n// StackConfigs and the external StackId that the caller sees. There are no\n// memory leaks when I use a vector, only with this StackId. Why there should be\n// memory leaks given that I am not mallocing anything is a mystery. In case you\n// were wondering, clearing the map at the end does not help.\n\ntemplate <typename StackId, typename Level, Level nlevels>\nstruct StackConfig {\n  StackConfig() : array_() {}\n\n  StackConfig(const StackConfig<StackId, Level, nlevels> &config) {\n    array_ = config.array_;\n  }\n\n  StackId &operator[](const int index) { return array_[index]; }\n\n  const StackId &operator[](const int index) const { return array_[index]; }\n\n  StackConfig &operator=(const StackConfig<StackId, Level, nlevels> &config) {\n    if (this == &config) return *this;\n    array_ = config.array_;\n    return *this;\n  }\n\n  std::array<StackId, nlevels> array_;\n};\n\ntemplate <typename StackId, typename Level, Level nlevels>\nclass CompConfig {\n public:\n  using Config = StackConfig<StackId, Level, nlevels>;\n\n  bool operator()(const Config &x, const Config &y) const {\n    for (Level level = 0; level < nlevels; ++level) {\n      if (x.array_[level] < y.array_[level]) {\n        return true;\n      } else if (x.array_[level] > y.array_[level]) {\n        return false;\n      }\n    }\n    return false;\n  }\n};\n\n// Defines the KeyPair type used as the key to MPdtStack.paren_id_map_. The hash\n// function is provided as a separate struct to match templating syntax.\ntemplate <typename Level>\nstruct KeyPair {\n  Level level;\n  size_t underlying_id;\n\n  KeyPair(Level level, size_t id) : level(level), underlying_id(id) {}\n\n  inline bool operator==(const KeyPair<Level> &rhs) const {\n    return level == rhs.level && underlying_id == rhs.underlying_id;\n  }\n};\n\ntemplate <typename Level>\nstruct KeyPairHasher {\n  inline size_t operator()(const KeyPair<Level> &keypair) const {\n    return std::hash<Level>()(keypair.level) ^\n           (std::hash<size_t>()(keypair.underlying_id) << 1);\n  }\n};\n\ntemplate <typename StackId, typename Level, Level nlevels = 2,\n          MPdtType restrict = MPDT_READ_RESTRICT>\nclass MPdtStack {\n public:\n  using Label = Level;\n  using Config = StackConfig<StackId, Level, nlevels>;\n  using ConfigToStackId =\n      std::map<Config, StackId, CompConfig<StackId, Level, nlevels>>;\n\n  MPdtStack(const std::vector<std::pair<Label, Label>> &parens,\n            const std::vector<Level> &assignments);\n\n  MPdtStack(const MPdtStack &mstack);\n\n  ~MPdtStack() {\n    for (Level level = 0; level < nlevels; ++level) delete stacks_[level];\n  }\n\n  StackId Find(StackId stack_id, Label label);\n\n  // For now we do not implement Pop since this is needed only for\n  // ShortestPath().\n\n  // For Top we find the first non-empty config, and find the paren ID of that\n  // (or -1) if there is none, then map that to the external stack_id to return.\n  std::ptrdiff_t Top(StackId stack_id) const {\n    if (stack_id == -1) return -1;\n    const auto config = InternalStackIds(stack_id);\n    Level level = 0;\n    StackId underlying_id = -1;\n    for (; level < nlevels; ++level) {\n      if (!Empty(config, level)) {\n        underlying_id = stacks_[level]->Top(config[level]);\n        break;\n      }\n    }\n    if (underlying_id == -1) return -1;\n    const auto it = paren_id_map_.find(KeyPair<Level>(level, underlying_id));\n    if (it == paren_id_map_.end()) return -1;  // NB: shouldn't happen.\n    return it->second;\n  }\n\n  std::ptrdiff_t ParenId(Label label) const {\n    const auto it = paren_map_.find(label);\n    return it != paren_map_.end() ? it->second : -1;\n  }\n\n  // TODO(rws): For debugging purposes only: remove later.\n  string PrintConfig(const Config &config) const {\n    string result = \"[\";\n    for (Level i = 0; i < nlevels; ++i) {\n      char s[128];\n      snprintf(s, sizeof(s), \"%d\", config[i]);\n      result += string(s);\n      if (i < nlevels - 1) result += \", \";\n    }\n    result += \"]\";\n    return result;\n  }\n\n  bool Error() { return error_; }\n\n  // Each component stack has an internal stack ID for a given configuration and\n  // label.\n  // This function maps a configuration of those to the stack ID the caller\n  // sees.\n  inline StackId ExternalStackId(const Config &config) {\n    const auto it = config_to_stack_id_map_.find(config);\n    StackId result;\n    if (it == config_to_stack_id_map_.end()) {\n      result = next_stack_id_++;\n      config_to_stack_id_map_.insert(\n          std::pair<Config, StackId>(config, result));\n      stack_id_to_config_map_[result] = config;\n    } else {\n      result = it->second;\n    }\n    return result;\n  }\n\n  // Retrieves the internal stack ID for a corresponding external stack ID.\n  inline const Config InternalStackIds(StackId stack_id) const {\n    auto it = stack_id_to_config_map_.find(stack_id);\n    if (it == stack_id_to_config_map_.end()) {\n      it = stack_id_to_config_map_.find(-1);\n    }\n    return it->second;\n  }\n\n  inline bool Empty(const Config &config, Level level) const {\n    return config[level] <= 0;\n  }\n\n  inline bool AllEmpty(const Config &config) {\n    for (Level level = 0; level < nlevels; ++level) {\n      if (!Empty(config, level)) return false;\n    }\n    return true;\n  }\n\n  bool error_;\n  Label min_paren_;\n  Label max_paren_;\n  // Stores level of each paren.\n  std::unordered_map<Label, Label> paren_levels_;\n  std::vector<std::pair<Label, Label>> parens_;  // As in pdt.h.\n  std::unordered_map<Label, size_t> paren_map_;  // As in pdt.h.\n  // Maps between internal paren_id and external paren_id.\n  std::unordered_map<KeyPair<Level>, size_t, KeyPairHasher<Level>>\n      paren_id_map_;\n  // Maps between internal stack ids and external stack id.\n  ConfigToStackId config_to_stack_id_map_;\n  std::unordered_map<StackId, Config> stack_id_to_config_map_;\n  StackId next_stack_id_;\n  // Array of stacks.\n  PdtStack<StackId, Label> *stacks_[nlevels];\n};\n\ntemplate <typename StackId, typename Level, Level nlevels, MPdtType restrict>\nMPdtStack<StackId, Level, nlevels, restrict>::MPdtStack(\n    const std::vector<std::pair<Level, Level>> &parens,  // NB: Label = Level.\n    const std::vector<Level> &assignments)\n    : error_(false),\n      min_paren_(kNoLabel),\n      max_paren_(kNoLabel),\n      parens_(parens),\n      next_stack_id_(1) {\n  using Label = Level;\n  if (parens.size() != assignments.size()) {\n    FSTERROR() << \"MPdtStack: Parens of different size from assignments\";\n    error_ = true;\n    return;\n  }\n  std::vector<std::pair<Label, Label>> vectors[nlevels];\n  for (Level i = 0; i < assignments.size(); ++i) {\n    // Assignments here start at 0, so assuming the human-readable version has\n    // them starting at 1, we should subtract 1 here\n    const auto level = assignments[i] - 1;\n    if (level < 0 || level >= nlevels) {\n      FSTERROR() << \"MPdtStack: Specified level \" << level << \" out of bounds\";\n      error_ = true;\n      return;\n    }\n    const auto &pair = parens[i];\n    vectors[level].push_back(pair);\n    paren_levels_[pair.first] = level;\n    paren_levels_[pair.second] = level;\n    paren_map_[pair.first] = i;\n    paren_map_[pair.second] = i;\n    const KeyPair<Level> key(level, vectors[level].size() - 1);\n    paren_id_map_[key] = i;\n    if (min_paren_ == kNoLabel || pair.first < min_paren_) {\n      min_paren_ = pair.first;\n    }\n    if (pair.second < min_paren_) min_paren_ = pair.second;\n    if (max_paren_ == kNoLabel || pair.first > max_paren_) {\n      max_paren_ = pair.first;\n    }\n    if (pair.second > max_paren_) max_paren_ = pair.second;\n  }\n  using Config = StackConfig<StackId, Level, nlevels>;\n  Config neg_one;\n  Config zero;\n  for (Level level = 0; level < nlevels; ++level) {\n    stacks_[level] = new PdtStack<StackId, Label>(vectors[level]);\n    neg_one[level] = -1;\n    zero[level] = 0;\n  }\n  config_to_stack_id_map_[neg_one] = -1;\n  config_to_stack_id_map_[zero] = 0;\n  stack_id_to_config_map_[-1] = neg_one;\n  stack_id_to_config_map_[0] = zero;\n}\n\ntemplate <typename StackId, typename Level, Level nlevels, MPdtType restrict>\nMPdtStack<StackId, Level, nlevels, restrict>::MPdtStack(\n    const MPdtStack<StackId, Level, nlevels, restrict> &mstack)\n    : error_(mstack.error_),\n      min_paren_(mstack.min_paren_),\n      max_paren_(mstack.max_paren_),\n      parens_(mstack.parens_),\n      next_stack_id_(mstack.next_stack_id_) {\n  for (const auto &kv : mstack.paren_levels_) {\n    paren_levels_[kv.first] = kv.second;\n  }\n  for (const auto &paren : mstack.parens_) parens_.push_back(paren);\n  for (const auto &kv : mstack.paren_map_) {\n    paren_map_[kv.first] = kv.second;\n  }\n  for (const auto &kv : mstack.paren_id_map_) {\n    paren_id_map_[kv.first] = kv.second;\n  }\n  for (auto it = mstack.config_to_stack_id_map_.begin();\n       it != mstack.config_to_stack_id_map_.end(); ++it) {\n    config_to_stack_id_map_[it->first] = it->second;\n  }\n  for (const auto &kv : mstack.stack_id_to_config_map_) {\n    using Config = StackConfig<StackId, Level, nlevels>;\n    const Config config(kv.second);\n    stack_id_to_config_map_[kv.first] = config;\n  }\n  for (Level level = 0; level < nlevels; ++level)\n    stacks_[level] = mstack.stacks_[level];\n}\n\ntemplate <typename StackId, typename Level, Level nlevels, MPdtType restrict>\nStackId MPdtStack<StackId, Level, nlevels, restrict>::Find(StackId stack_id,\n                                                           Level label) {\n  // Non-paren.\n  if (min_paren_ == kNoLabel || label < min_paren_ || label > max_paren_) {\n    return stack_id;\n  }\n  const auto it = paren_map_.find(label);\n  // Non-paren.\n  if (it == paren_map_.end()) return stack_id;\n  std::ptrdiff_t paren_id = it->second;\n  // Gets the configuration associated with this stack_id.\n  const auto config = InternalStackIds(stack_id);\n  // Gets the level.\n  const auto level = paren_levels_.find(label)->second;\n  // If the label is an open paren we push:\n  //\n  // 1) if the restrict type is not MPDT_WRITE_RESTRICT, or\n  // 2) the restrict type is MPDT_WRITE_RESTRICT, and all the stacks above the\n  // level are empty.\n  if (label == parens_[paren_id].first) {  // Open paren.\n    if (restrict == MPDT_WRITE_RESTRICT) {\n      for (Level upper_level = 0; upper_level < level; ++upper_level) {\n        if (!Empty(config, upper_level)) return -1;  // Non-empty stack blocks.\n      }\n    }\n    // If the label is an close paren we pop:\n    //\n    // 1) if the restrict type is not MPDT_READ_RESTRICT, or\n    // 2) the restrict type is MPDT_READ_RESTRICT, and all the stacks above the\n    // level are empty.\n  } else if (restrict == MPDT_READ_RESTRICT) {\n    for (Level lower_level = 0; lower_level < level; ++lower_level) {\n      if (!Empty(config, lower_level)) return -1;  // Non-empty stack blocks.\n    }\n  }\n  const auto nid = stacks_[level]->Find(config[level], label);\n  // If the new ID is -1, that means that there is no valid transition at the\n  // level we want.\n  if (nid == -1) {\n    return -1;\n  } else {\n    using Config = StackConfig<StackId, Level, nlevels>;\n    Config nconfig(config);\n    nconfig[level] = nid;\n    return ExternalStackId(nconfig);\n  }\n}\n\n}  // namespace internal\n}  // namespace fst\n\n#endif  // FST_EXTENSIONS_MPDT_MPDT_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/extensions/mpdt/mpdtlib.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// This is an experimental multipush-down transducer (MPDT) library. An MPDT is\n// encoded as an FST, where some transitions are labeled with open or close\n// parentheses, each mated pair of which is associated to one stack. To be\n// interpreted as an MPDT, the parentheses within a stack must balance on a\n// path.\n\n#ifndef FST_EXTENSIONS_MPDT_MPDTLIB_H_\n#define FST_EXTENSIONS_MPDT_MPDTLIB_H_\n\n#include <fst/extensions/mpdt/compose.h>\n#include <fst/extensions/mpdt/expand.h>\n#include <fst/extensions/mpdt/mpdt.h>\n#include <fst/extensions/mpdt/reverse.h>\n\n#endif  // FST_EXTENSIONS_MPDT_MPDTLIB_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/extensions/mpdt/mpdtscript.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Convenience file for including all MPDT operations at once, and/or\n// registering them for new arc types.\n\n#ifndef FST_EXTENSIONS_MPDT_MPDTSCRIPT_H_\n#define FST_EXTENSIONS_MPDT_MPDTSCRIPT_H_\n\n#include <algorithm>\n#include <utility>\n#include <vector>\n\n#include <fst/log.h>\n#include <fst/compose.h>  // for ComposeOptions\n#include <fst/util.h>\n\n#include <fst/script/arg-packs.h>\n#include <fst/script/fst-class.h>\n#include <fst/script/shortest-path.h>\n\n#include <fst/extensions/mpdt/compose.h>\n#include <fst/extensions/mpdt/expand.h>\n#include <fst/extensions/mpdt/info.h>\n#include <fst/extensions/mpdt/reverse.h>\n\n#include <fst/extensions/pdt/pdtscript.h>  // For LabelClassPair,\n                                               // FstClassPair, and to detect\n                                               // any collisions.\n\nnamespace fst {\nnamespace script {\n\nusing MPdtComposeArgs =\n    std::tuple<const FstClass &, const FstClass &,\n               const std::vector<LabelPair> &, const std::vector<int64_t> &,\n               MutableFstClass *, const MPdtComposeOptions &, bool>;\n\ntemplate <class Arc>\nvoid MPdtCompose(MPdtComposeArgs *args) {\n  const Fst<Arc> &ifst1 = *(std::get<0>(*args).GetFst<Arc>());\n  const Fst<Arc> &ifst2 = *(std::get<1>(*args).GetFst<Arc>());\n  MutableFst<Arc> *ofst = std::get<4>(*args)->GetMutableFst<Arc>();\n  std::vector<std::pair<typename Arc::Label, typename Arc::Label>> typed_parens(\n      std::get<2>(*args).size());\n  std::copy(std::get<2>(*args).begin(), std::get<2>(*args).end(),\n            typed_parens.begin());\n  using Level = typename Arc::Label;\n  std::vector<Level> typed_assignments(std::get<3>(*args).size());\n  std::copy(std::get<3>(*args).begin(), std::get<3>(*args).end(),\n            typed_assignments.begin());\n  if (std::get<6>(*args)) {\n    Compose(ifst1, typed_parens, typed_assignments, ifst2, ofst,\n            std::get<5>(*args));\n  } else {\n    Compose(ifst1, ifst2, typed_parens, typed_assignments, ofst,\n            std::get<5>(*args));\n  }\n}\n\nvoid MPdtCompose(const FstClass &ifst1, const FstClass &ifst2,\n                 const std::vector<LabelPair> &parens,\n                 const std::vector<int64_t> &assignments, MutableFstClass *ofst,\n                 const MPdtComposeOptions &copts, bool left_pdt);\n\nusing MPdtExpandArgs =\n    std::tuple<const FstClass &, const std::vector<LabelPair> &,\n               const std::vector<int64_t> &, MutableFstClass *,\n               const MPdtExpandOptions &>;\n\ntemplate <class Arc>\nvoid MPdtExpand(MPdtExpandArgs *args) {\n  const Fst<Arc> &fst = *(std::get<0>(*args).GetFst<Arc>());\n  MutableFst<Arc> *ofst = std::get<3>(*args)->GetMutableFst<Arc>();\n  // In case Arc::Label is not the same as FstClass::Label, we make copies.\n  // Truncation may occur if FstClass::Label has more precision than\n  // Arc::Label.\n  std::vector<std::pair<typename Arc::Label, typename Arc::Label>> typed_parens(\n      std::get<1>(*args).size());\n  std::copy(std::get<1>(*args).begin(), std::get<1>(*args).end(),\n            typed_parens.begin());\n  using Level = typename Arc::Label;\n  std::vector<Level> typed_assignments(std::get<2>(*args).size());\n  std::copy(std::get<2>(*args).begin(), std::get<2>(*args).end(),\n            typed_assignments.begin());\n  Expand(fst, typed_parens, typed_assignments, ofst,\n         MPdtExpandOptions(std::get<4>(*args).connect,\n                           std::get<4>(*args).keep_parentheses));\n}\n\nvoid MPdtExpand(const FstClass &ifst, const std::vector<LabelPair> &parens,\n                const std::vector<int64_t> &assignments, MutableFstClass *ofst,\n                const MPdtExpandOptions &opts);\n\nusing MPdtReverseArgs =\n    std::tuple<const FstClass &, const std::vector<LabelPair> &,\n               std::vector<int64_t> *, MutableFstClass *>;\n\ntemplate <class Arc>\nvoid MPdtReverse(MPdtReverseArgs *args) {\n  const Fst<Arc> &fst = *(std::get<0>(*args).GetFst<Arc>());\n  MutableFst<Arc> *ofst = std::get<3>(*args)->GetMutableFst<Arc>();\n  // In case Arc::Label is not the same as FstClass::Label, we make copies.\n  // Truncation may occur if FstClass::Label has more precision than\n  // Arc::Label.\n  std::vector<std::pair<typename Arc::Label, typename Arc::Label>> typed_parens(\n      std::get<1>(*args).size());\n  std::copy(std::get<1>(*args).begin(), std::get<1>(*args).end(),\n            typed_parens.begin());\n  using Level = typename Arc::Label;\n  std::vector<Level> typed_assignments(std::get<2>(*args)->size());\n  std::copy(std::get<2>(*args)->begin(), std::get<2>(*args)->end(),\n            typed_assignments.begin());\n  Reverse(fst, typed_parens, &typed_assignments, ofst);\n  // Reassign stack assignments to input assignment vector.\n  std::copy(typed_assignments.begin(), typed_assignments.end(),\n            std::get<2>(*args)->begin());\n}\n\nvoid MPdtReverse(const FstClass &ifst, const std::vector<LabelPair> &parens,\n                 std::vector<int64_t> *assignments, MutableFstClass *ofst);\n\nusing PrintMPdtInfoArgs =\n    std::tuple<const FstClass &, const std::vector<LabelPair> &,\n               const std::vector<int64_t> &>;\n\ntemplate <class Arc>\nvoid PrintMPdtInfo(PrintMPdtInfoArgs *args) {\n  const Fst<Arc> &fst = *(std::get<0>(*args).GetFst<Arc>());\n  // In case Arc::Label is not the same as FstClass::Label, we make copies.\n  // Truncation may occur if FstClass::Label has more precision than\n  // Arc::Label.\n  std::vector<std::pair<typename Arc::Label, typename Arc::Label>> typed_parens(\n      std::get<1>(*args).size());\n  std::copy(std::get<1>(*args).begin(), std::get<1>(*args).end(),\n            typed_parens.begin());\n  using Level = typename Arc::Label;\n  std::vector<Level> typed_assignments(std::get<2>(*args).size());\n  std::copy(std::get<2>(*args).begin(), std::get<2>(*args).end(),\n            typed_assignments.begin());\n  MPdtInfo<Arc> mpdtinfo(fst, typed_parens, typed_assignments);\n  mpdtinfo.Print();\n}\n\nvoid PrintMPdtInfo(const FstClass &ifst, const std::vector<LabelPair> &parens,\n                   const std::vector<int64_t> &assignments);\n\n}  // namespace script\n}  // namespace fst\n\n#define REGISTER_FST_MPDT_OPERATIONS(ArcType)                    \\\n  REGISTER_FST_OPERATION(MPdtCompose, ArcType, MPdtComposeArgs); \\\n  REGISTER_FST_OPERATION(MPdtExpand, ArcType, MPdtExpandArgs);   \\\n  REGISTER_FST_OPERATION(MPdtReverse, ArcType, MPdtReverseArgs); \\\n  REGISTER_FST_OPERATION(PrintMPdtInfo, ArcType, PrintMPdtInfoArgs)\n#endif  // FST_EXTENSIONS_MPDT_MPDTSCRIPT_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/extensions/mpdt/read_write_utils.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Definition of ReadLabelTriples based on ReadLabelPairs, like that in\n// nlp/fst/lib/util.h for pairs, and similarly for WriteLabelTriples.\n\n#ifndef FST_EXTENSIONS_MPDT_READ_WRITE_UTILS_H_\n#define FST_EXTENSIONS_MPDT_READ_WRITE_UTILS_H_\n\n#include <string>\n#include <utility>\n#include <vector>\n\n#include <fstream>\n#include <fst/test-properties.h>\n\nnamespace fst {\n\n// Returns true on success.\ntemplate <typename Label>\nbool ReadLabelTriples(const string &filename,\n                      std::vector<std::pair<Label, Label>> *pairs,\n                      std::vector<Label> *assignments,\n                      bool allow_negative = false) {\n  std::ifstream fstrm(filename);\n  if (!fstrm) {\n    LOG(ERROR) << \"ReadIntTriples: Can't open file: \" << filename;\n    return false;\n  }\n  static constexpr auto kLineLen = 8096;\n  char line[kLineLen];\n  size_t nline = 0;\n  pairs->clear();\n  while (fstrm.getline(line, kLineLen)) {\n    ++nline;\n    std::vector<char *> col;\n    SplitString(line, \"\\n\\t \", &col, true);\n    // Empty line or comment?\n    if (col.empty() || col[0][0] == '\\0' || col[0][0] == '#') continue;\n    if (col.size() != 3) {\n      LOG(ERROR) << \"ReadLabelTriples: Bad number of columns, \"\n                 << \"file = \" << filename << \", line = \" << nline;\n      return false;\n    }\n    bool err;\n    const Label i1 = StrToint64_t(col[0], filename, nline, allow_negative, &err);\n    if (err) return false;\n    const Label i2 = StrToint64_t(col[1], filename, nline, allow_negative, &err);\n    if (err) return false;\n    using Level = Label;\n    const Level i3 = StrToint64_t(col[2], filename, nline, allow_negative, &err);\n    if (err) return false;\n    pairs->push_back(std::make_pair(i1, i2));\n    assignments->push_back(i3);\n  }\n  return true;\n}\n\n// Returns true on success.\ntemplate <typename Label>\nbool WriteLabelTriples(const string &filename,\n                       const std::vector<std::pair<Label, Label>> &pairs,\n                       const std::vector<Label> &assignments) {\n  if (pairs.size() != assignments.size()) {\n    LOG(ERROR) << \"WriteLabelTriples: Pairs and assignments of different sizes\";\n    return false;\n  }\n  std::ofstream fstrm(filename);\n  if (!fstrm) {\n    LOG(ERROR) << \"WriteLabelTriples: Can't open file: \" << filename;\n    return false;\n  }\n  for (size_t n = 0; n < pairs.size(); ++n)\n    fstrm << pairs[n].first << \"\\t\" << pairs[n].second << \"\\t\" << assignments[n]\n          << \"\\n\";\n  if (!fstrm) {\n    LOG(ERROR) << \"WriteLabelTriples: Write failed: \"\n               << (filename.empty() ? \"standard output\" : filename);\n    return false;\n  }\n  return true;\n}\n\n}  // namespace fst\n\n#endif  // FST_EXTENSIONS_MPDT_READ_WRITE_UTILS_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/extensions/mpdt/reverse.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Reverses an MPDT.\n\n#ifndef FST_EXTENSIONS_MPDT_REVERSE_H_\n#define FST_EXTENSIONS_MPDT_REVERSE_H_\n\n#include <limits>\n#include <vector>\n\n#include <fst/mutable-fst.h>\n#include <fst/relabel.h>\n#include <fst/reverse.h>\n\nnamespace fst {\n\n// Reverses a multi-stack pushdown transducer (MPDT) encoded as an FST.\ntemplate <class Arc, class RevArc>\nvoid Reverse(\n    const Fst<Arc> &ifst,\n    const std::vector<std::pair<typename Arc::Label, typename Arc::Label>>\n        &parens,\n    std::vector<typename Arc::Label> *assignments, MutableFst<RevArc> *ofst) {\n  using Label = typename Arc::Label;\n  // Reverses FST component.\n  Reverse(ifst, ofst);\n  // Exchanges open and close parenthesis pairs.\n  std::vector<std::pair<Label, Label>> relabel_pairs;\n  relabel_pairs.reserve(2 * parens.size());\n  for (const auto &pair : parens) {\n    relabel_pairs.emplace_back(pair.first, pair.second);\n    relabel_pairs.emplace_back(pair.second, pair.first);\n  }\n  Relabel(ofst, relabel_pairs, relabel_pairs);\n  // Computes new bounds for the stack assignments.\n  Label max_level = -1;\n  Label min_level = std::numeric_limits<Label>::max();\n  for (const auto assignment : *assignments) {\n    if (assignment < min_level) {\n      min_level = assignment;\n    } else if (assignment > max_level) {\n      max_level = assignment;\n    }\n  }\n  // Actually reverses stack assignments.\n  for (auto &assignment : *assignments) {\n    assignment = (max_level - assignment) + min_level;\n  }\n}\n\n}  // namespace fst\n\n#endif  // FST_EXTENSIONS_MPDT_REVERSE_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/extensions/ngram/bitmap-index.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#ifndef FST_EXTENSIONS_NGRAM_BITMAP_INDEX_H_\n#define FST_EXTENSIONS_NGRAM_BITMAP_INDEX_H_\n\n#include <utility>\n#include <vector>\n\n#include <fst/compat.h>\n\n// This class is a bitstring storage class with an index that allows\n// seeking to the Nth set or clear bit in time O(Log(N)) where N is\n// the length of the bit vector.  In addition, it allows counting set or\n// clear bits over ranges in constant time.\n//\n// This is accomplished by maintaining an \"secondary\" index of limited\n// size in bits that maintains a running count of the number of bits set\n// in each block of bitmap data.  A block is defined as the number of\n// uint64_t values that can fit in the secondary index before an overflow\n// occurs.\n//\n// To handle overflows, a \"primary\" index containing a running count of\n// bits set in each block is created using the type uint64_t.\n\nnamespace fst {\n\nclass BitmapIndex {\n public:\n  static size_t StorageSize(size_t size) {\n    return ((size + kStorageBlockMask) >> kStorageLogBitSize);\n  }\n\n  BitmapIndex() : bits_(nullptr), size_(0) {}\n\n  bool Get(size_t index) const {\n    return (bits_[index >> kStorageLogBitSize] &\n            (kOne << (index & kStorageBlockMask))) != 0;\n  }\n\n  static void Set(uint64_t* bits, size_t index) {\n    bits[index >> kStorageLogBitSize] |= (kOne << (index & kStorageBlockMask));\n  }\n\n  static void Clear(uint64_t* bits, size_t index) {\n    bits[index >> kStorageLogBitSize] &= ~(kOne << (index & kStorageBlockMask));\n  }\n\n  size_t Bits() const { return size_; }\n\n  size_t ArraySize() const { return StorageSize(size_); }\n\n  // Returns the number of one bits in the bitmap\n  size_t GetOnesCount() const {\n    return primary_index_[primary_index_size() - 1];\n  }\n\n  // Returns the number of one bits in positions 0 to limit - 1.\n  // REQUIRES: limit <= Bits()\n  size_t Rank1(size_t end) const;\n\n  // Returns the number of one bits in the range start to end - 1.\n  // REQUIRES: limit <= Bits()\n  size_t GetOnesCountInRange(size_t start, size_t end) const {\n    return Rank1(end) - Rank1(start);\n  }\n\n  // Returns the number of zero bits in positions 0 to limit - 1.\n  // REQUIRES: limit <= Bits()\n  size_t Rank0(size_t end) const { return end - Rank1(end); }\n\n  // Returns the number of zero bits in the range start to end - 1.\n  // REQUIRES: limit <= Bits()\n  size_t GetZeroesCountInRange(size_t start, size_t end) const {\n    return end - start - GetOnesCountInRange(start, end);\n  }\n\n  // Return true if any bit between begin inclusive and end exclusive\n  // is set.  0 <= begin <= end <= Bits() is required.\n  //\n  bool TestRange(size_t start, size_t end) const {\n    return Rank1(end) > Rank1(start);\n  }\n\n  // Returns the offset to the nth set bit (zero based)\n  // or Bits() if index >= number of ones\n  size_t Select1(size_t bit_index) const;\n\n  // Returns the offset to the nth clear bit (zero based)\n  // or Bits() if index > number of\n  size_t Select0(size_t bit_index) const;\n\n  // Returns the offset of the nth and nth+1 clear bit (zero based),\n  // equivalent to two calls to Select0, but more efficient.\n  std::pair<size_t, size_t> Select0s(size_t bit_index) const;\n\n  // Rebuilds from index for the associated Bitmap, should be called\n  // whenever changes have been made to the Bitmap or else behavior\n  // of the indexed bitmap methods will be undefined.\n  void BuildIndex(const uint64_t* bits, size_t size);\n\n  // the secondary index accumulates counts until it can possibly overflow\n  // this constant computes the number of uint64_t units that can fit into\n  // units the size of uint16_t.\n  static const uint64_t kOne = 1;\n  static const uint32_t kStorageBitSize = 64;\n  static const uint32_t kStorageLogBitSize = 6;\n  static const uint32_t kSecondaryBlockSize =\n      ((1 << 16) - 1) >> kStorageLogBitSize;\n\n private:\n  static const uint32_t kStorageBlockMask = kStorageBitSize - 1;\n\n  // returns, from the index, the count of ones up to array_index\n  size_t get_index_ones_count(size_t array_index) const;\n\n  // because the indexes, both primary and secondary, contain a running\n  // count of the population of one bits contained in [0,i), there is\n  // no reason to have an element in the zeroth position as this value would\n  // necessarily be zero.  (The bits are indexed in a zero based way.)  Thus\n  // we don't store the 0th element in either index.  Both of the following\n  // functions, if greater than 0, must be decremented by one before retreiving\n  // the value from the corresponding array.\n  // returns the 1 + the block that contains the bitindex in question\n  // the inverted version works the same but looks for zeros using an inverted\n  // view of the index\n  size_t find_primary_block(size_t bit_index) const;\n\n  size_t find_inverted_primary_block(size_t bit_index) const;\n\n  // similarly, the secondary index (which resets its count to zero at\n  // the end of every kSecondaryBlockSize entries) does not store the element\n  // at 0.  Note that the rem_bit_index parameter is the number of bits\n  // within the secondary block, after the bits accounted for by the primary\n  // block have been removed (i.e. the remaining bits)  And, because we\n  // reset to zero with each new block, there is no need to store those\n  // actual zeros.\n  // returns 1 + the secondary block that contains the bitindex in question\n  size_t find_secondary_block(size_t block, size_t rem_bit_index) const;\n\n  size_t find_inverted_secondary_block(size_t block,\n                                       size_t rem_bit_index) const;\n\n  // We create a primary index based upon the number of secondary index\n  // blocks.  The primary index uses fields wide enough to accomodate any\n  // index of the bitarray so cannot overflow\n  // The primary index is the actual running\n  // count of one bits set for all blocks (and, thus, all uint64_ts).\n  size_t primary_index_size() const {\n    return (ArraySize() + kSecondaryBlockSize - 1) / kSecondaryBlockSize;\n  }\n\n  const uint64_t* bits_;\n  size_t size_;\n\n  // The primary index contains the running popcount of all blocks\n  // which means the nth value contains the popcounts of\n  // [0,n*kSecondaryBlockSize], however, the 0th element is omitted.\n  std::vector<uint32_t> primary_index_;\n  // The secondary index contains the running popcount of the associated\n  // bitmap.  It is the same length (in units of uint16_t) as the\n  // bitmap's map is in units of uint64_ts.\n  std::vector<uint16_t> secondary_index_;\n};\n\n}  // end namespace fst\n\n#endif  // FST_EXTENSIONS_NGRAM_BITMAP_INDEX_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/extensions/ngram/ngram-fst.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// NgramFst implements a n-gram language model based upon the LOUDS data\n// structure.  Please refer to \"Unary Data Structures for Language Models\"\n// http://research.google.com/pubs/archive/37218.pdf\n\n#ifndef FST_EXTENSIONS_NGRAM_NGRAM_FST_H_\n#define FST_EXTENSIONS_NGRAM_NGRAM_FST_H_\n\n#include <stddef.h>\n#include <string.h>\n#include <algorithm>\n#include <iostream>\n#include <string>\n#include <utility>\n#include <vector>\n\n#include <fst/compat.h>\n#include <fst/log.h>\n#include <fstream>\n#include <fst/extensions/ngram/bitmap-index.h>\n#include <fst/fstlib.h>\n#include <fst/mapped-file.h>\n\nnamespace fst {\ntemplate <class A>\nclass NGramFst;\ntemplate <class A>\nclass NGramFstMatcher;\n\n// Instance data containing mutable state for bookkeeping repeated access to\n// the same state.\ntemplate <class A>\nstruct NGramFstInst {\n  typedef typename A::Label Label;\n  typedef typename A::StateId StateId;\n  typedef typename A::Weight Weight;\n  StateId state_;\n  size_t num_futures_;\n  size_t offset_;\n  size_t node_;\n  StateId node_state_;\n  std::vector<Label> context_;\n  StateId context_state_;\n  NGramFstInst()\n      : state_(kNoStateId),\n        node_state_(kNoStateId),\n        context_state_(kNoStateId) {}\n};\n\nnamespace internal {\n\n// Implementation class for LOUDS based NgramFst interface.\ntemplate <class A>\nclass NGramFstImpl : public FstImpl<A> {\n  using FstImpl<A>::SetInputSymbols;\n  using FstImpl<A>::SetOutputSymbols;\n  using FstImpl<A>::SetType;\n  using FstImpl<A>::WriteHeader;\n\n  friend class ArcIterator<NGramFst<A>>;\n  friend class NGramFstMatcher<A>;\n\n public:\n  using FstImpl<A>::InputSymbols;\n  using FstImpl<A>::SetProperties;\n  using FstImpl<A>::Properties;\n\n  typedef A Arc;\n  typedef typename A::Label Label;\n  typedef typename A::StateId StateId;\n  typedef typename A::Weight Weight;\n\n  NGramFstImpl() {\n    SetType(\"ngram\");\n    SetInputSymbols(nullptr);\n    SetOutputSymbols(nullptr);\n    SetProperties(kStaticProperties);\n  }\n\n  NGramFstImpl(const Fst<A> &fst, std::vector<StateId> *order_out);\n\n  explicit NGramFstImpl(const Fst<A> &fst) : NGramFstImpl(fst, nullptr) {}\n\n  NGramFstImpl(const NGramFstImpl &other) {\n    FSTERROR() << \"Copying NGramFst Impls is not supported, use safe = false.\";\n    SetProperties(kError, kError);\n  }\n\n  ~NGramFstImpl() override {\n    if (owned_) {\n      delete[] data_;\n    }\n  }\n\n  static NGramFstImpl<A> *Read(std::istream &strm,  // NOLINT\n                               const FstReadOptions &opts) {\n    NGramFstImpl<A> *impl = new NGramFstImpl();\n    FstHeader hdr;\n    if (!impl->ReadHeader(strm, opts, kMinFileVersion, &hdr)) return 0;\n    uint64_t num_states, num_futures, num_final;\n    const size_t offset =\n        sizeof(num_states) + sizeof(num_futures) + sizeof(num_final);\n    // Peek at num_states and num_futures to see how much more needs to be read.\n    strm.read(reinterpret_cast<char *>(&num_states), sizeof(num_states));\n    strm.read(reinterpret_cast<char *>(&num_futures), sizeof(num_futures));\n    strm.read(reinterpret_cast<char *>(&num_final), sizeof(num_final));\n    size_t size = Storage(num_states, num_futures, num_final);\n    MappedFile *data_region = MappedFile::Allocate(size);\n    char *data = reinterpret_cast<char *>(data_region->mutable_data());\n    // Copy num_states, num_futures and num_final back into data.\n    memcpy(data, reinterpret_cast<char *>(&num_states), sizeof(num_states));\n    memcpy(data + sizeof(num_states), reinterpret_cast<char *>(&num_futures),\n           sizeof(num_futures));\n    memcpy(data + sizeof(num_states) + sizeof(num_futures),\n           reinterpret_cast<char *>(&num_final), sizeof(num_final));\n    strm.read(data + offset, size - offset);\n    if (strm.fail()) {\n      delete impl;\n      return nullptr;\n    }\n    impl->Init(data, false, data_region);\n    return impl;\n  }\n\n  bool Write(std::ostream &strm,  // NOLINT\n             const FstWriteOptions &opts) const {\n    FstHeader hdr;\n    hdr.SetStart(Start());\n    hdr.SetNumStates(num_states_);\n    WriteHeader(strm, opts, kFileVersion, &hdr);\n    strm.write(data_, StorageSize());\n    return !strm.fail();\n  }\n\n  StateId Start() const { return start_; }\n\n  Weight Final(StateId state) const {\n    if (final_index_.Get(state)) {\n      return final_probs_[final_index_.Rank1(state)];\n    } else {\n      return Weight::Zero();\n    }\n  }\n\n  size_t NumArcs(StateId state, NGramFstInst<A> *inst = nullptr) const {\n    if (inst == nullptr) {\n      const std::pair<size_t, size_t> zeros =\n          (state == 0) ? select_root_ : future_index_.Select0s(state);\n      return zeros.second - zeros.first - 1;\n    }\n    SetInstFuture(state, inst);\n    return inst->num_futures_ + ((state == 0) ? 0 : 1);\n  }\n\n  size_t NumInputEpsilons(StateId state) const {\n    // State 0 has no parent, thus no backoff.\n    if (state == 0) return 0;\n    return 1;\n  }\n\n  size_t NumOutputEpsilons(StateId state) const {\n    return NumInputEpsilons(state);\n  }\n\n  StateId NumStates() const { return num_states_; }\n\n  void InitStateIterator(StateIteratorData<A> *data) const {\n    data->base = 0;\n    data->nstates = num_states_;\n  }\n\n  static size_t Storage(uint64_t num_states, uint64_t num_futures,\n                        uint64_t num_final) {\n    uint64_t b64;\n    Weight weight;\n    Label label;\n    size_t offset =\n        sizeof(num_states) + sizeof(num_futures) + sizeof(num_final);\n    offset +=\n        sizeof(b64) * (BitmapIndex::StorageSize(num_states * 2 + 1) +\n                       BitmapIndex::StorageSize(num_futures + num_states + 1) +\n                       BitmapIndex::StorageSize(num_states));\n    offset += (num_states + 1) * sizeof(label) + num_futures * sizeof(label);\n    // Pad for alignemnt, see\n    // http://en.wikipedia.org/wiki/Data_structure_alignment#Computing_padding\n    offset = (offset + sizeof(weight) - 1) & ~(sizeof(weight) - 1);\n    offset += (num_states + 1) * sizeof(weight) + num_final * sizeof(weight) +\n              (num_futures + 1) * sizeof(weight);\n    return offset;\n  }\n\n  void SetInstFuture(StateId state, NGramFstInst<A> *inst) const {\n    if (inst->state_ != state) {\n      inst->state_ = state;\n      const std::pair<size_t, size_t> zeros = future_index_.Select0s(state);\n      inst->num_futures_ = zeros.second - zeros.first - 1;\n      inst->offset_ = future_index_.Rank1(zeros.first + 1);\n    }\n  }\n\n  void SetInstNode(NGramFstInst<A> *inst) const {\n    if (inst->node_state_ != inst->state_) {\n      inst->node_state_ = inst->state_;\n      inst->node_ = context_index_.Select1(inst->state_);\n    }\n  }\n\n  void SetInstContext(NGramFstInst<A> *inst) const {\n    SetInstNode(inst);\n    if (inst->context_state_ != inst->state_) {\n      inst->context_state_ = inst->state_;\n      inst->context_.clear();\n      size_t node = inst->node_;\n      while (node != 0) {\n        inst->context_.push_back(context_words_[context_index_.Rank1(node)]);\n        node = context_index_.Select1(context_index_.Rank0(node) - 1);\n      }\n    }\n  }\n\n  // Access to the underlying representation\n  const char *GetData(size_t *data_size) const {\n    *data_size = StorageSize();\n    return data_;\n  }\n\n  void Init(const char *data, bool owned, MappedFile *file = nullptr);\n\n  const std::vector<Label> &GetContext(StateId s, NGramFstInst<A> *inst) const {\n    SetInstFuture(s, inst);\n    SetInstContext(inst);\n    return inst->context_;\n  }\n\n  size_t StorageSize() const {\n    return Storage(num_states_, num_futures_, num_final_);\n  }\n\n  void GetStates(const std::vector<Label> &context,\n                 std::vector<StateId> *states) const;\n\n private:\n  StateId Transition(const std::vector<Label> &context, Label future) const;\n\n  // Properties always true for this Fst class.\n  static const uint64_t kStaticProperties =\n      kAcceptor | kIDeterministic | kODeterministic | kEpsilons | kIEpsilons |\n      kOEpsilons | kILabelSorted | kOLabelSorted | kWeighted | kCyclic |\n      kInitialAcyclic | kNotTopSorted | kAccessible | kCoAccessible |\n      kNotString | kExpanded;\n  // Current file format version.\n  static const int kFileVersion = 4;\n  // Minimum file format version supported.\n  static const int kMinFileVersion = 4;\n\n  std::unique_ptr<MappedFile> data_region_;\n  const char *data_ = nullptr;\n  bool owned_ = false;  // True if we own data_\n  StateId start_ = fst::kNoStateId;\n  uint64_t num_states_ = 0;\n  uint64_t num_futures_ = 0;\n  uint64_t num_final_ = 0;\n  std::pair<size_t, size_t> select_root_;\n  const Label *root_children_ = nullptr;\n  // borrowed references\n  const uint64_t *context_ = nullptr;\n  const uint64_t *future_ = nullptr;\n  const uint64_t *final_ = nullptr;\n  const Label *context_words_ = nullptr;\n  const Label *future_words_ = nullptr;\n  const Weight *backoff_ = nullptr;\n  const Weight *final_probs_ = nullptr;\n  const Weight *future_probs_ = nullptr;\n  BitmapIndex context_index_;\n  BitmapIndex future_index_;\n  BitmapIndex final_index_;\n};\n\ntemplate <typename A>\ninline void NGramFstImpl<A>::GetStates(\n    const std::vector<Label> &context,\n    std::vector<typename A::StateId> *states) const {\n  states->clear();\n  states->push_back(0);\n  typename std::vector<Label>::const_reverse_iterator cit = context.rbegin();\n  const Label *children = root_children_;\n  size_t num_children = select_root_.second - 2;\n  const Label *loc = std::lower_bound(children, children + num_children, *cit);\n  if (loc == children + num_children || *loc != *cit) return;\n  size_t node = 2 + loc - children;\n  states->push_back(context_index_.Rank1(node));\n  if (context.size() == 1) return;\n  size_t node_rank = context_index_.Rank1(node);\n  std::pair<size_t, size_t> zeros =\n      node_rank == 0 ? select_root_ : context_index_.Select0s(node_rank);\n  size_t first_child = zeros.first + 1;\n  ++cit;\n  if (context_index_.Get(first_child) != false) {\n    size_t last_child = zeros.second - 1;\n    while (cit != context.rend()) {\n      children = context_words_ + context_index_.Rank1(first_child);\n      loc = std::lower_bound(children, children + last_child - first_child + 1,\n                             *cit);\n      if (loc == children + last_child - first_child + 1 || *loc != *cit) {\n        break;\n      }\n      ++cit;\n      node = first_child + loc - children;\n      states->push_back(context_index_.Rank1(node));\n      node_rank = context_index_.Rank1(node);\n      zeros =\n          node_rank == 0 ? select_root_ : context_index_.Select0s(node_rank);\n      first_child = zeros.first + 1;\n      if (context_index_.Get(first_child) == false) break;\n      last_child = zeros.second - 1;\n    }\n  }\n}\n\n}  // namespace internal\n\n/*****************************************************************************/\ntemplate <class A>\nclass NGramFst : public ImplToExpandedFst<internal::NGramFstImpl<A>> {\n  friend class ArcIterator<NGramFst<A>>;\n  friend class NGramFstMatcher<A>;\n\n public:\n  typedef A Arc;\n  typedef typename A::StateId StateId;\n  typedef typename A::Label Label;\n  typedef typename A::Weight Weight;\n  typedef internal::NGramFstImpl<A> Impl;\n\n  explicit NGramFst(const Fst<A> &dst)\n      : ImplToExpandedFst<Impl>(std::make_shared<Impl>(dst, nullptr)) {}\n\n  NGramFst(const Fst<A> &fst, std::vector<StateId> *order_out)\n      : ImplToExpandedFst<Impl>(std::make_shared<Impl>(fst, order_out)) {}\n\n  // Because the NGramFstImpl is a const stateless data structure, there\n  // is never a need to do anything beside copy the reference.\n  NGramFst(const NGramFst<A> &fst, bool safe = false)\n      : ImplToExpandedFst<Impl>(fst, false) {}\n\n  NGramFst() : ImplToExpandedFst<Impl>(std::make_shared<Impl>()) {}\n\n  // Non-standard constructor to initialize NGramFst directly from data.\n  NGramFst(const char *data, bool owned)\n      : ImplToExpandedFst<Impl>(std::make_shared<Impl>()) {\n    GetMutableImpl()->Init(data, owned, nullptr);\n  }\n\n  // Get method that gets the data associated with Init().\n  const char *GetData(size_t *data_size) const {\n    return GetImpl()->GetData(data_size);\n  }\n\n  const std::vector<Label> GetContext(StateId s) const {\n    return GetImpl()->GetContext(s, &inst_);\n  }\n\n  // Consumes as much as possible of context from right to left, returns the\n  // the states corresponding to the increasingly conditioned input sequence.\n  void GetStates(const std::vector<Label> &context,\n                 std::vector<StateId> *state) const {\n    return GetImpl()->GetStates(context, state);\n  }\n\n  size_t NumArcs(StateId s) const override {\n    return GetImpl()->NumArcs(s, &inst_);\n  }\n\n  NGramFst<A> *Copy(bool safe = false) const override {\n    return new NGramFst(*this, safe);\n  }\n\n  static NGramFst<A> *Read(std::istream &strm, const FstReadOptions &opts) {\n    Impl *impl = Impl::Read(strm, opts);\n    return impl ? new NGramFst<A>(std::shared_ptr<Impl>(impl)) : nullptr;\n  }\n\n  static NGramFst<A> *Read(const string &filename) {\n    if (!filename.empty()) {\n      std::ifstream strm(filename,\n                              std::ios_base::in | std::ios_base::binary);\n      if (!strm.good()) {\n        LOG(ERROR) << \"NGramFst::Read: Can't open file: \" << filename;\n        return nullptr;\n      }\n      return Read(strm, FstReadOptions(filename));\n    } else {\n      return Read(std::cin, FstReadOptions(\"standard input\"));\n    }\n  }\n\n  bool Write(std::ostream &strm, const FstWriteOptions &opts) const override {\n    return GetImpl()->Write(strm, opts);\n  }\n\n  bool Write(const string &filename) const override {\n    return Fst<A>::WriteFile(filename);\n  }\n\n  inline void InitStateIterator(StateIteratorData<A> *data) const override {\n    GetImpl()->InitStateIterator(data);\n  }\n\n  inline void InitArcIterator(StateId s,\n                              ArcIteratorData<A> *data) const override;\n\n  MatcherBase<A> *InitMatcher(MatchType match_type) const override {\n    return new NGramFstMatcher<A>(this, match_type);\n  }\n\n  size_t StorageSize() const { return GetImpl()->StorageSize(); }\n\n  static bool HasRequiredProps(const Fst<A> &fst) {\n    static const auto props =\n        kAcceptor | kIDeterministic | kILabelSorted | kIEpsilons | kAccessible;\n    return fst.Properties(props, true) == props;\n  }\n\n  static bool HasRequiredStructure(const Fst<A> &fst) {\n    if (!HasRequiredProps(fst)) {\n      return false;\n    }\n    typename A::StateId unigram = fst.Start();\n    while (true) {  // Follows epsilon arc chain to find unigram state.\n      if (unigram == fst::kNoStateId) return false;  // No unigram state.\n      typename fst::ArcIterator<Fst<A>> aiter(fst, unigram);\n      if (aiter.Done() || aiter.Value().ilabel != 0) break;\n      unigram = aiter.Value().nextstate;\n      aiter.Next();\n    }\n    // Other requirement: all states other than unigram an epsilon arc.\n    for (fst::StateIterator<Fst<A>> siter(fst); !siter.Done();\n         siter.Next()) {\n      const typename A::StateId &state = siter.Value();\n      fst::ArcIterator<Fst<A>> aiter(fst, state);\n      if (state != unigram) {\n        if (aiter.Done()) return false;\n        if (aiter.Value().ilabel != 0) return false;\n        aiter.Next();\n        if (!aiter.Done() && aiter.Value().ilabel == 0) return false;\n      }\n    }\n    return true;\n  }\n\n private:\n  using ImplToExpandedFst<Impl, ExpandedFst<A>>::GetImpl;\n  using ImplToExpandedFst<Impl, ExpandedFst<A>>::GetMutableImpl;\n\n  explicit NGramFst(std::shared_ptr<Impl> impl)\n      : ImplToExpandedFst<Impl>(impl) {}\n\n  mutable NGramFstInst<A> inst_;\n};\n\ntemplate <class A>\ninline void NGramFst<A>::InitArcIterator(StateId s,\n                                         ArcIteratorData<A> *data) const {\n  GetImpl()->SetInstFuture(s, &inst_);\n  GetImpl()->SetInstNode(&inst_);\n  data->base = new ArcIterator<NGramFst<A>>(*this, s);\n}\n\nnamespace internal {\n\ntemplate <typename A>\nNGramFstImpl<A>::NGramFstImpl(const Fst<A> &fst,\n                              std::vector<StateId> *order_out) {\n  typedef A Arc;\n  typedef typename Arc::Label Label;\n  typedef typename Arc::Weight Weight;\n  typedef typename Arc::StateId StateId;\n  SetType(\"ngram\");\n  SetInputSymbols(fst.InputSymbols());\n  SetOutputSymbols(fst.OutputSymbols());\n  SetProperties(kStaticProperties);\n\n  // Check basic requirements for an OpenGrm language model Fst.\n  if (!NGramFst<A>::HasRequiredProps(fst)) {\n    FSTERROR() << \"NGramFst only accepts OpenGrm language models as input\";\n    SetProperties(kError, kError);\n    return;\n  }\n\n  int64_t num_states = CountStates(fst);\n  Label *context = new Label[num_states];\n\n  // Find the unigram state by starting from the start state, following\n  // epsilons.\n  StateId unigram = fst.Start();\n  while (1) {\n    if (unigram == kNoStateId) {\n      FSTERROR() << \"Could not identify unigram state\";\n      SetProperties(kError, kError);\n      return;\n    }\n    ArcIterator<Fst<A>> aiter(fst, unigram);\n    if (aiter.Done()) {\n      LOG(WARNING) << \"Unigram state \" << unigram << \" has no arcs.\";\n      break;\n    }\n    if (aiter.Value().ilabel != 0) break;\n    unigram = aiter.Value().nextstate;\n  }\n\n  // Each state's context is determined by the subtree it is under from the\n  // unigram state.\n  std::queue<std::pair<StateId, Label>> label_queue;\n  std::vector<bool> visited(num_states);\n  // Force an epsilon link to the start state.\n  label_queue.push(std::make_pair(fst.Start(), 0));\n  for (ArcIterator<Fst<A>> aiter(fst, unigram); !aiter.Done(); aiter.Next()) {\n    label_queue.push(\n        std::make_pair(aiter.Value().nextstate, aiter.Value().ilabel));\n  }\n  // investigate states in breadth first fashion to assign context words.\n  while (!label_queue.empty()) {\n    std::pair<StateId, Label> &now = label_queue.front();\n    if (!visited[now.first]) {\n      context[now.first] = now.second;\n      visited[now.first] = true;\n      for (ArcIterator<Fst<A>> aiter(fst, now.first); !aiter.Done();\n           aiter.Next()) {\n        const Arc &arc = aiter.Value();\n        if (arc.ilabel != 0) {\n          label_queue.push(std::make_pair(arc.nextstate, now.second));\n        }\n      }\n    }\n    label_queue.pop();\n  }\n  visited.clear();\n\n  // The arc from the start state should be assigned an epsilon to put it\n  // in front of the all other labels (which makes Start state 1 after\n  // unigram which is state 0).\n  context[fst.Start()] = 0;\n\n  // Build the tree of contexts fst by reversing the epsilon arcs from fst.\n  VectorFst<Arc> context_fst;\n  uint64_t num_final = 0;\n  for (int i = 0; i < num_states; ++i) {\n    if (fst.Final(i) != Weight::Zero()) {\n      ++num_final;\n    }\n    context_fst.SetFinal(context_fst.AddState(), fst.Final(i));\n  }\n  context_fst.SetStart(unigram);\n  context_fst.SetInputSymbols(fst.InputSymbols());\n  context_fst.SetOutputSymbols(fst.OutputSymbols());\n  int64_t num_context_arcs = 0;\n  int64_t num_futures = 0;\n  for (StateIterator<Fst<A>> siter(fst); !siter.Done(); siter.Next()) {\n    const StateId &state = siter.Value();\n    num_futures += fst.NumArcs(state) - fst.NumInputEpsilons(state);\n    ArcIterator<Fst<A>> aiter(fst, state);\n    if (!aiter.Done()) {\n      const Arc &arc = aiter.Value();\n      // this arc goes from state to arc.nextstate, so create an arc from\n      // arc.nextstate to state to reverse it.\n      if (arc.ilabel == 0) {\n        context_fst.AddArc(arc.nextstate, Arc(context[state], context[state],\n                                              arc.weight, state));\n        num_context_arcs++;\n      }\n    }\n  }\n  if (num_context_arcs != context_fst.NumStates() - 1) {\n    FSTERROR() << \"Number of contexts arcs != number of states - 1\";\n    SetProperties(kError, kError);\n    return;\n  }\n  if (context_fst.NumStates() != num_states) {\n    FSTERROR() << \"Number of contexts != number of states\";\n    SetProperties(kError, kError);\n    return;\n  }\n  int64_t context_props =\n      context_fst.Properties(kIDeterministic | kILabelSorted, true);\n  if (!(context_props & kIDeterministic)) {\n    FSTERROR() << \"Input Fst is not structured properly\";\n    SetProperties(kError, kError);\n    return;\n  }\n  if (!(context_props & kILabelSorted)) {\n    ArcSort(&context_fst, ILabelCompare<Arc>());\n  }\n\n  delete[] context;\n\n  uint64_t b64;\n  Weight weight;\n  Label label = kNoLabel;\n  const size_t storage = Storage(num_states, num_futures, num_final);\n  MappedFile *data_region = MappedFile::Allocate(storage);\n  char *data = reinterpret_cast<char *>(data_region->mutable_data());\n  memset(data, 0, storage);\n  size_t offset = 0;\n  memcpy(data + offset, reinterpret_cast<char *>(&num_states),\n         sizeof(num_states));\n  offset += sizeof(num_states);\n  memcpy(data + offset, reinterpret_cast<char *>(&num_futures),\n         sizeof(num_futures));\n  offset += sizeof(num_futures);\n  memcpy(data + offset, reinterpret_cast<char *>(&num_final),\n         sizeof(num_final));\n  offset += sizeof(num_final);\n  uint64_t *context_bits = reinterpret_cast<uint64_t *>(data + offset);\n  offset += BitmapIndex::StorageSize(num_states * 2 + 1) * sizeof(b64);\n  uint64_t *future_bits = reinterpret_cast<uint64_t *>(data + offset);\n  offset +=\n      BitmapIndex::StorageSize(num_futures + num_states + 1) * sizeof(b64);\n  uint64_t *final_bits = reinterpret_cast<uint64_t *>(data + offset);\n  offset += BitmapIndex::StorageSize(num_states) * sizeof(b64);\n  Label *context_words = reinterpret_cast<Label *>(data + offset);\n  offset += (num_states + 1) * sizeof(label);\n  Label *future_words = reinterpret_cast<Label *>(data + offset);\n  offset += num_futures * sizeof(label);\n  offset = (offset + sizeof(weight) - 1) & ~(sizeof(weight) - 1);\n  Weight *backoff = reinterpret_cast<Weight *>(data + offset);\n  offset += (num_states + 1) * sizeof(weight);\n  Weight *final_probs = reinterpret_cast<Weight *>(data + offset);\n  offset += num_final * sizeof(weight);\n  Weight *future_probs = reinterpret_cast<Weight *>(data + offset);\n  int64_t context_arc = 0, future_arc = 0, context_bit = 0, future_bit = 0,\n        final_bit = 0;\n\n  // pseudo-root bits\n  BitmapIndex::Set(context_bits, context_bit++);\n  ++context_bit;\n  context_words[context_arc] = label;\n  backoff[context_arc] = Weight::Zero();\n  context_arc++;\n\n  ++future_bit;\n  if (order_out) {\n    order_out->clear();\n    order_out->resize(num_states);\n  }\n\n  std::queue<StateId> context_q;\n  context_q.push(context_fst.Start());\n  StateId state_number = 0;\n  while (!context_q.empty()) {\n    const StateId &state = context_q.front();\n    if (order_out) {\n      (*order_out)[state] = state_number;\n    }\n\n    const Weight final_weight = context_fst.Final(state);\n    if (final_weight != Weight::Zero()) {\n      BitmapIndex::Set(final_bits, state_number);\n      final_probs[final_bit] = final_weight;\n      ++final_bit;\n    }\n\n    for (ArcIterator<VectorFst<A>> aiter(context_fst, state); !aiter.Done();\n         aiter.Next()) {\n      const Arc &arc = aiter.Value();\n      context_words[context_arc] = arc.ilabel;\n      backoff[context_arc] = arc.weight;\n      ++context_arc;\n      BitmapIndex::Set(context_bits, context_bit++);\n      context_q.push(arc.nextstate);\n    }\n    ++context_bit;\n\n    for (ArcIterator<Fst<A>> aiter(fst, state); !aiter.Done(); aiter.Next()) {\n      const Arc &arc = aiter.Value();\n      if (arc.ilabel != 0) {\n        future_words[future_arc] = arc.ilabel;\n        future_probs[future_arc] = arc.weight;\n        ++future_arc;\n        BitmapIndex::Set(future_bits, future_bit++);\n      }\n    }\n    ++future_bit;\n    ++state_number;\n    context_q.pop();\n  }\n\n  if ((state_number != num_states) || (context_bit != num_states * 2 + 1) ||\n      (context_arc != num_states) || (future_arc != num_futures) ||\n      (future_bit != num_futures + num_states + 1) ||\n      (final_bit != num_final)) {\n    FSTERROR() << \"Structure problems detected during construction\";\n    SetProperties(kError, kError);\n    return;\n  }\n\n  Init(data, false, data_region);\n}\n\ntemplate <typename A>\ninline void NGramFstImpl<A>::Init(const char *data, bool owned,\n                                  MappedFile *data_region) {\n  if (owned_) {\n    delete[] data_;\n  }\n  data_region_.reset(data_region);\n  owned_ = owned;\n  data_ = data;\n  size_t offset = 0;\n  num_states_ = *(reinterpret_cast<const uint64_t *>(data_ + offset));\n  offset += sizeof(num_states_);\n  num_futures_ = *(reinterpret_cast<const uint64_t *>(data_ + offset));\n  offset += sizeof(num_futures_);\n  num_final_ = *(reinterpret_cast<const uint64_t *>(data_ + offset));\n  offset += sizeof(num_final_);\n  uint64_t bits;\n  size_t context_bits = num_states_ * 2 + 1;\n  size_t future_bits = num_futures_ + num_states_ + 1;\n  context_ = reinterpret_cast<const uint64_t *>(data_ + offset);\n  offset += BitmapIndex::StorageSize(context_bits) * sizeof(bits);\n  future_ = reinterpret_cast<const uint64_t *>(data_ + offset);\n  offset += BitmapIndex::StorageSize(future_bits) * sizeof(bits);\n  final_ = reinterpret_cast<const uint64_t *>(data_ + offset);\n  offset += BitmapIndex::StorageSize(num_states_) * sizeof(bits);\n  context_words_ = reinterpret_cast<const Label *>(data_ + offset);\n  offset += (num_states_ + 1) * sizeof(*context_words_);\n  future_words_ = reinterpret_cast<const Label *>(data_ + offset);\n  offset += num_futures_ * sizeof(*future_words_);\n  offset = (offset + sizeof(*backoff_) - 1) & ~(sizeof(*backoff_) - 1);\n  backoff_ = reinterpret_cast<const Weight *>(data_ + offset);\n  offset += (num_states_ + 1) * sizeof(*backoff_);\n  final_probs_ = reinterpret_cast<const Weight *>(data_ + offset);\n  offset += num_final_ * sizeof(*final_probs_);\n  future_probs_ = reinterpret_cast<const Weight *>(data_ + offset);\n\n  context_index_.BuildIndex(context_, context_bits);\n  future_index_.BuildIndex(future_, future_bits);\n  final_index_.BuildIndex(final_, num_states_);\n\n  select_root_ = context_index_.Select0s(0);\n  if (context_index_.Rank1(0) != 0 || select_root_.first != 1 ||\n      context_index_.Get(2) == false) {\n    FSTERROR() << \"Malformed file\";\n    SetProperties(kError, kError);\n    return;\n  }\n  root_children_ = context_words_ + context_index_.Rank1(2);\n  start_ = 1;\n}\n\ntemplate <typename A>\ninline typename A::StateId NGramFstImpl<A>::Transition(\n    const std::vector<Label> &context, Label future) const {\n  const Label *children = root_children_;\n  size_t num_children = select_root_.second - 2;\n  const Label *loc =\n      std::lower_bound(children, children + num_children, future);\n  if (loc == children + num_children || *loc != future) {\n    return context_index_.Rank1(0);\n  }\n  size_t node = 2 + loc - children;\n  size_t node_rank = context_index_.Rank1(node);\n  std::pair<size_t, size_t> zeros =\n      (node_rank == 0) ? select_root_ : context_index_.Select0s(node_rank);\n  size_t first_child = zeros.first + 1;\n  if (context_index_.Get(first_child) == false) {\n    return context_index_.Rank1(node);\n  }\n  size_t last_child = zeros.second - 1;\n  for (int word = context.size() - 1; word >= 0; --word) {\n    children = context_words_ + context_index_.Rank1(first_child);\n    loc = std::lower_bound(children, children + last_child - first_child + 1,\n                           context[word]);\n    if (loc == children + last_child - first_child + 1 ||\n        *loc != context[word]) {\n      break;\n    }\n    node = first_child + loc - children;\n    node_rank = context_index_.Rank1(node);\n    zeros =\n        (node_rank == 0) ? select_root_ : context_index_.Select0s(node_rank);\n    first_child = zeros.first + 1;\n    if (context_index_.Get(first_child) == false) break;\n    last_child = zeros.second - 1;\n  }\n  return context_index_.Rank1(node);\n}\n\n}  // namespace internal\n\n/*****************************************************************************/\ntemplate <class A>\nclass NGramFstMatcher : public MatcherBase<A> {\n public:\n  typedef A Arc;\n  typedef typename A::Label Label;\n  typedef typename A::StateId StateId;\n  typedef typename A::Weight Weight;\n\n  // This makes a copy of the FST.\n  NGramFstMatcher(const NGramFst<A> &fst, MatchType match_type)\n      : owned_fst_(fst.Copy()),\n        fst_(*owned_fst_),\n        inst_(fst_.inst_),\n        match_type_(match_type),\n        current_loop_(false),\n        loop_(kNoLabel, 0, A::Weight::One(), kNoStateId) {\n    if (match_type_ == MATCH_OUTPUT) {\n      std::swap(loop_.ilabel, loop_.olabel);\n    }\n  }\n\n  // This doesn't copy the FST.\n  NGramFstMatcher(const NGramFst<A> *fst, MatchType match_type)\n      : fst_(*fst),\n        inst_(fst_.inst_),\n        match_type_(match_type),\n        current_loop_(false),\n        loop_(kNoLabel, 0, A::Weight::One(), kNoStateId) {\n    if (match_type_ == MATCH_OUTPUT) {\n      std::swap(loop_.ilabel, loop_.olabel);\n    }\n  }\n\n  // This makes a copy of the FST.\n  NGramFstMatcher(const NGramFstMatcher<A> &matcher, bool safe = false)\n      : owned_fst_(matcher.fst_.Copy(safe)),\n        fst_(*owned_fst_),\n        inst_(matcher.inst_),\n        match_type_(matcher.match_type_),\n        current_loop_(false),\n        loop_(kNoLabel, 0, A::Weight::One(), kNoStateId) {\n    if (match_type_ == MATCH_OUTPUT) {\n      std::swap(loop_.ilabel, loop_.olabel);\n    }\n  }\n\n  NGramFstMatcher<A> *Copy(bool safe = false) const override {\n    return new NGramFstMatcher<A>(*this, safe);\n  }\n\n  MatchType Type(bool test) const override { return match_type_; }\n\n  const Fst<A> &GetFst() const override { return fst_; }\n\n  uint64_t Properties(uint64_t props) const override { return props; }\n\n  void SetState(StateId s) final {\n    fst_.GetImpl()->SetInstFuture(s, &inst_);\n    current_loop_ = false;\n  }\n\n  bool Find(Label label) final {\n    const Label nolabel = kNoLabel;\n    done_ = true;\n    if (label == 0 || label == nolabel) {\n      if (label == 0) {\n        current_loop_ = true;\n        loop_.nextstate = inst_.state_;\n      }\n      // The unigram state has no epsilon arc.\n      if (inst_.state_ != 0) {\n        arc_.ilabel = arc_.olabel = 0;\n        fst_.GetImpl()->SetInstNode(&inst_);\n        arc_.nextstate = fst_.GetImpl()->context_index_.Rank1(\n            fst_.GetImpl()->context_index_.Select1(\n                fst_.GetImpl()->context_index_.Rank0(inst_.node_) - 1));\n        arc_.weight = fst_.GetImpl()->backoff_[inst_.state_];\n        done_ = false;\n      }\n    } else {\n      current_loop_ = false;\n      const Label *start = fst_.GetImpl()->future_words_ + inst_.offset_;\n      const Label *end = start + inst_.num_futures_;\n      const Label *search = std::lower_bound(start, end, label);\n      if (search != end && *search == label) {\n        size_t state = search - start;\n        arc_.ilabel = arc_.olabel = label;\n        arc_.weight = fst_.GetImpl()->future_probs_[inst_.offset_ + state];\n        fst_.GetImpl()->SetInstContext(&inst_);\n        arc_.nextstate = fst_.GetImpl()->Transition(inst_.context_, label);\n        done_ = false;\n      }\n    }\n    return !Done();\n  }\n\n  bool Done() const final { return !current_loop_ && done_; }\n\n  const Arc &Value() const final { return (current_loop_) ? loop_ : arc_; }\n\n  void Next() final {\n    if (current_loop_) {\n      current_loop_ = false;\n    } else {\n      done_ = true;\n    }\n  }\n\n  std::ptrdiff_t Priority(StateId s) final { return fst_.NumArcs(s); }\n\n private:\n  std::unique_ptr<NGramFst<A>> owned_fst_;\n  const NGramFst<A> &fst_;\n  NGramFstInst<A> inst_;\n  MatchType match_type_;  // Supplied by caller\n  bool done_;\n  Arc arc_;\n  bool current_loop_;  // Current arc is the implicit loop\n  Arc loop_;\n};\n\n/*****************************************************************************/\n// Specialization for NGramFst; see generic version in fst.h\n// for sample usage (but use the ProdLmFst type!). This version\n// should inline.\ntemplate <class A>\nclass StateIterator<NGramFst<A>> : public StateIteratorBase<A> {\n public:\n  typedef typename A::StateId StateId;\n\n  explicit StateIterator(const NGramFst<A> &fst)\n      : s_(0), num_states_(fst.NumStates()) {}\n\n  bool Done() const final { return s_ >= num_states_; }\n\n  StateId Value() const final { return s_; }\n\n  void Next() final { ++s_; }\n\n  void Reset() final { s_ = 0; }\n\n private:\n  StateId s_;\n  StateId num_states_;\n};\n\n/*****************************************************************************/\ntemplate <class A>\nclass ArcIterator<NGramFst<A>> : public ArcIteratorBase<A> {\n public:\n  typedef A Arc;\n  typedef typename A::Label Label;\n  typedef typename A::StateId StateId;\n  typedef typename A::Weight Weight;\n\n  ArcIterator(const NGramFst<A> &fst, StateId state)\n      : lazy_(~0), impl_(fst.GetImpl()), i_(0), flags_(kArcValueFlags) {\n    inst_ = fst.inst_;\n    impl_->SetInstFuture(state, &inst_);\n    impl_->SetInstNode(&inst_);\n  }\n\n  bool Done() const final {\n    return i_ >=\n           ((inst_.node_ == 0) ? inst_.num_futures_ : inst_.num_futures_ + 1);\n  }\n\n  const Arc &Value() const final {\n    bool eps = (inst_.node_ != 0 && i_ == 0);\n    StateId state = (inst_.node_ == 0) ? i_ : i_ - 1;\n    if (flags_ & lazy_ & (kArcILabelValue | kArcOLabelValue)) {\n      arc_.ilabel = arc_.olabel =\n          eps ? 0 : impl_->future_words_[inst_.offset_ + state];\n      lazy_ &= ~(kArcILabelValue | kArcOLabelValue);\n    }\n    if (flags_ & lazy_ & kArcNextStateValue) {\n      if (eps) {\n        arc_.nextstate =\n            impl_->context_index_.Rank1(impl_->context_index_.Select1(\n                impl_->context_index_.Rank0(inst_.node_) - 1));\n      } else {\n        if (lazy_ & kArcNextStateValue) {\n          impl_->SetInstContext(&inst_);  // first time only.\n        }\n        arc_.nextstate = impl_->Transition(\n            inst_.context_, impl_->future_words_[inst_.offset_ + state]);\n      }\n      lazy_ &= ~kArcNextStateValue;\n    }\n    if (flags_ & lazy_ & kArcWeightValue) {\n      arc_.weight = eps ? impl_->backoff_[inst_.state_]\n                        : impl_->future_probs_[inst_.offset_ + state];\n      lazy_ &= ~kArcWeightValue;\n    }\n    return arc_;\n  }\n\n  void Next() final {\n    ++i_;\n    lazy_ = ~0;\n  }\n\n  size_t Position() const final { return i_; }\n\n  void Reset() final {\n    i_ = 0;\n    lazy_ = ~0;\n  }\n\n  void Seek(size_t a) final {\n    if (i_ != a) {\n      i_ = a;\n      lazy_ = ~0;\n    }\n  }\n\n  uint32_t Flags() const final { return flags_; }\n\n  void SetFlags(uint32_t flags, uint32_t mask) final {\n    flags_ &= ~mask;\n    flags_ |= (flags & kArcValueFlags);\n  }\n\n private:\n  mutable Arc arc_;\n  mutable uint32_t lazy_;\n  const internal::NGramFstImpl<A> *impl_;  // Borrowed reference.\n  mutable NGramFstInst<A> inst_;\n\n  size_t i_;\n  uint32_t flags_;\n};\n\n}  // namespace fst\n#endif  // FST_EXTENSIONS_NGRAM_NGRAM_FST_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/extensions/ngram/nthbit.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#ifndef FST_EXTENSIONS_NGRAM_NTHBIT_H_\n#define FST_EXTENSIONS_NGRAM_NTHBIT_H_\n\n#include <fst/types.h>\n#include <fst/compat.h>\n\nextern uint32_t nth_bit_bit_offset[];\n\ninline uint32_t nth_bit(uint64_t v, uint32_t r) {\n  uint32_t shift = 0;\n  uint32_t c = __builtin_popcount(v & 0xffffffff);\n  uint32_t mask = -(r > c);\n  r -= c & mask;\n  shift += (32 & mask);\n\n  c = __builtin_popcount((v >> shift) & 0xffff);\n  mask = -(r > c);\n  r -= c & mask;\n  shift += (16 & mask);\n\n  c = __builtin_popcount((v >> shift) & 0xff);\n  mask = -(r > c);\n  r -= c & mask;\n  shift += (8 & mask);\n\n  return shift +\n         ((nth_bit_bit_offset[(v >> shift) & 0xff] >> ((r - 1) << 2)) & 0xf);\n}\n\n#endif  // FST_EXTENSIONS_NGRAM_NTHBIT_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/extensions/pdt/collection.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Class to store a collection of ordered (multi-)sets with elements of type T.\n\n#ifndef FST_EXTENSIONS_PDT_COLLECTION_H_\n#define FST_EXTENSIONS_PDT_COLLECTION_H_\n\n#include <functional>\n#include <vector>\n\n#include <fst/log.h>\n#include <fst/bi-table.h>\n\nnamespace fst {\n\n// Stores a collection of non-empty, ordered (multi-)sets with elements of type\n// T. A default constructor, operator==, and an STL-style hash functor must be\n// defined on the elements. Provides signed integer ID (of type I) for each\n// unique set. The IDs are allocated starting from 0 in order.\ntemplate <class I, class T>\nclass Collection {\n public:\n  struct Node {  // Trie node.\n    I node_id;   // Root is kNoNodeId;\n    T element;\n\n    Node() : node_id(kNoNodeId), element(T()) {}\n\n    Node(I i, const T &t) : node_id(i), element(t) {}\n\n    bool operator==(const Node &n) const {\n      return n.node_id == node_id && n.element == element;\n    }\n  };\n\n  struct NodeHash {\n    size_t operator()(const Node &n) const {\n      static constexpr auto kPrime = 7853;\n      return n.node_id + hash_(n.element) * kPrime;\n    }\n  };\n\n  using NodeTable = CompactHashBiTable<I, Node, NodeHash>;\n\n  class SetIterator {\n   public:\n    SetIterator(I id, Node node, NodeTable *node_table)\n        : id_(id), node_(node), node_table_(node_table) {}\n\n    bool Done() const { return id_ == kNoNodeId; }\n\n    const T &Element() const { return node_.element; }\n\n    void Next() {\n      id_ = node_.node_id;\n      if (id_ != kNoNodeId) node_ = node_table_->FindEntry(id_);\n    }\n\n   private:\n    I id_;       // Iterator set node ID.\n    Node node_;  // Iterator set node.\n    NodeTable *node_table_;\n  };\n\n  Collection() {}\n\n  // Looks up integer ID from ordered multi-se, and if it doesn't exist and\n  // insert is true, then adds it. Otherwise returns -1.\n  I FindId(const std::vector<T> &set, bool insert = true) {\n    I node_id = kNoNodeId;\n    for (std::ptrdiff_t i = set.size() - 1; i >= 0; --i) {\n      Node node(node_id, set[i]);\n      node_id = node_table_.FindId(node, insert);\n      if (node_id == -1) break;\n    }\n    return node_id;\n  }\n\n  // Finds ordered (multi-)set given integer ID. Returns set iterator to\n  // traverse result.\n  SetIterator FindSet(I id) {\n    if (id < 0 || id >= node_table_.Size()) {\n      return SetIterator(kNoNodeId, Node(kNoNodeId, T()), &node_table_);\n    } else {\n      return SetIterator(id, node_table_.FindEntry(id), &node_table_);\n    }\n  }\n\n  I Size() const { return node_table_.Size(); }\n\n private:\n  static constexpr I kNoNodeId = -1;\n  static const std::hash<T> hash_;\n\n  NodeTable node_table_;\n};\n\ntemplate <class I, class T>\nconstexpr I Collection<I, T>::kNoNodeId;\n\ntemplate <class I, class T>\nconst std::hash<T> Collection<I, T>::hash_ = {};\n\n}  // namespace fst\n\n#endif  // FST_EXTENSIONS_PDT_COLLECTION_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/extensions/pdt/compose.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Composes a PDT and an FST.\n\n#ifndef FST_EXTENSIONS_PDT_COMPOSE_H_\n#define FST_EXTENSIONS_PDT_COMPOSE_H_\n\n#include <list>\n\n#include <fst/extensions/pdt/pdt.h>\n#include <fst/compose.h>\n\nnamespace fst {\n\n// Returns paren arcs for Find(kNoLabel).\nconstexpr uint32_t kParenList = 0x00000001;\n\n// Returns a kNolabel loop for Find(paren).\nconstexpr uint32_t kParenLoop = 0x00000002;\n\n// This class is a matcher that treats parens as multi-epsilon labels.\n// It is most efficient if the parens are in a range non-overlapping with\n// the non-paren labels.\ntemplate <class F>\nclass ParenMatcher {\n public:\n  using FST = F;\n  using M = SortedMatcher<FST>;\n  using Arc = typename FST::Arc;\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  // This makes a copy of the FST.\n  ParenMatcher(const FST &fst, MatchType match_type,\n               uint32_t flags = (kParenLoop | kParenList))\n      : matcher_(fst, match_type), match_type_(match_type), flags_(flags) {\n    if (match_type == MATCH_INPUT) {\n      loop_.ilabel = kNoLabel;\n      loop_.olabel = 0;\n    } else {\n      loop_.ilabel = 0;\n      loop_.olabel = kNoLabel;\n    }\n    loop_.weight = Weight::One();\n    loop_.nextstate = kNoStateId;\n  }\n\n  // This doesn't copy the FST.\n  ParenMatcher(const FST *fst, MatchType match_type,\n               uint32_t flags = (kParenLoop | kParenList))\n      : matcher_(fst, match_type), match_type_(match_type), flags_(flags) {\n    if (match_type == MATCH_INPUT) {\n      loop_.ilabel = kNoLabel;\n      loop_.olabel = 0;\n    } else {\n      loop_.ilabel = 0;\n      loop_.olabel = kNoLabel;\n    }\n    loop_.weight = Weight::One();\n    loop_.nextstate = kNoStateId;\n  }\n\n  // This makes a copy of the FST.\n  ParenMatcher(const ParenMatcher<FST> &matcher, bool safe = false)\n      : matcher_(matcher.matcher_, safe),\n        match_type_(matcher.match_type_),\n        flags_(matcher.flags_),\n        open_parens_(matcher.open_parens_),\n        close_parens_(matcher.close_parens_),\n        loop_(matcher.loop_) {\n    loop_.nextstate = kNoStateId;\n  }\n\n  ParenMatcher<FST> *Copy(bool safe = false) const {\n    return new ParenMatcher<FST>(*this, safe);\n  }\n\n  MatchType Type(bool test) const { return matcher_.Type(test); }\n\n  void SetState(StateId s) {\n    matcher_.SetState(s);\n    loop_.nextstate = s;\n  }\n\n  bool Find(Label match_label);\n\n  bool Done() const { return done_; }\n\n  const Arc &Value() const { return paren_loop_ ? loop_ : matcher_.Value(); }\n\n  void Next();\n\n  Weight Final(StateId s) { return matcher_.Final(s); }\n\n  std::ptrdiff_t Priority(StateId s) { return matcher_.Priority(s); }\n\n  const FST &GetFst() const { return matcher_.GetFst(); }\n\n  uint64_t Properties(uint64_t props) const { return matcher_.Properties(props); }\n\n  uint32_t Flags() const { return matcher_.Flags(); }\n\n  void AddOpenParen(Label label) {\n    if (label == 0) {\n      FSTERROR() << \"ParenMatcher: Bad open paren label: 0\";\n    } else {\n      open_parens_.Insert(label);\n    }\n  }\n\n  void AddCloseParen(Label label) {\n    if (label == 0) {\n      FSTERROR() << \"ParenMatcher: Bad close paren label: 0\";\n    } else {\n      close_parens_.Insert(label);\n    }\n  }\n\n  void RemoveOpenParen(Label label) {\n    if (label == 0) {\n      FSTERROR() << \"ParenMatcher: Bad open paren label: 0\";\n    } else {\n      open_parens_.Erase(label);\n    }\n  }\n\n  void RemoveCloseParen(Label label) {\n    if (label == 0) {\n      FSTERROR() << \"ParenMatcher: Bad close paren label: 0\";\n    } else {\n      close_parens_.Erase(label);\n    }\n  }\n\n  void ClearOpenParens() { open_parens_.Clear(); }\n\n  void ClearCloseParens() { close_parens_.Clear(); }\n\n  bool IsOpenParen(Label label) const { return open_parens_.Member(label); }\n\n  bool IsCloseParen(Label label) const { return close_parens_.Member(label); }\n\n private:\n  // Advances matcher to next open paren, returning true if it exists.\n  bool NextOpenParen();\n\n  // Advances matcher to next close paren, returning true if it exists.\n  bool NextCloseParen();\n\n  M matcher_;\n  MatchType match_type_;  // Type of match to perform.\n  uint32_t flags_;\n  // Open paren label set.\n  CompactSet<Label, kNoLabel> open_parens_;\n  // Close paren label set.\n  CompactSet<Label, kNoLabel> close_parens_;\n  bool open_paren_list_;   // Matching open paren list?\n  bool close_paren_list_;  // Matching close paren list?\n  bool paren_loop_;        // Current arc is the implicit paren loop?\n  mutable Arc loop_;       // For non-consuming symbols.\n  bool done_;              // Matching done?\n\n  ParenMatcher &operator=(const ParenMatcher &) = delete;\n};\n\ntemplate <class FST>\ninline bool ParenMatcher<FST>::Find(Label match_label) {\n  open_paren_list_ = false;\n  close_paren_list_ = false;\n  paren_loop_ = false;\n  done_ = false;\n  // Returns all parenthesis arcs.\n  if (match_label == kNoLabel && (flags_ & kParenList)) {\n    if (open_parens_.LowerBound() != kNoLabel) {\n      matcher_.LowerBound(open_parens_.LowerBound());\n      open_paren_list_ = NextOpenParen();\n      if (open_paren_list_) return true;\n    }\n    if (close_parens_.LowerBound() != kNoLabel) {\n      matcher_.LowerBound(close_parens_.LowerBound());\n      close_paren_list_ = NextCloseParen();\n      if (close_paren_list_) return true;\n    }\n  }\n  // Returns the implicit paren loop.\n  if (match_label > 0 && (flags_ & kParenLoop) &&\n      (IsOpenParen(match_label) || IsCloseParen(match_label))) {\n    paren_loop_ = true;\n    return true;\n  }\n  // Returns all other labels.\n  if (matcher_.Find(match_label)) return true;\n  done_ = true;\n  return false;\n}\n\ntemplate <class FST>\ninline void ParenMatcher<FST>::Next() {\n  if (paren_loop_) {\n    paren_loop_ = false;\n    done_ = true;\n  } else if (open_paren_list_) {\n    matcher_.Next();\n    open_paren_list_ = NextOpenParen();\n    if (open_paren_list_) return;\n    if (close_parens_.LowerBound() != kNoLabel) {\n      matcher_.LowerBound(close_parens_.LowerBound());\n      close_paren_list_ = NextCloseParen();\n      if (close_paren_list_) return;\n    }\n    done_ = !matcher_.Find(kNoLabel);\n  } else if (close_paren_list_) {\n    matcher_.Next();\n    close_paren_list_ = NextCloseParen();\n    if (close_paren_list_) return;\n    done_ = !matcher_.Find(kNoLabel);\n  } else {\n    matcher_.Next();\n    done_ = matcher_.Done();\n  }\n}\n\n// Advances matcher to next open paren, returning true if it exists.\ntemplate <class FST>\ninline bool ParenMatcher<FST>::NextOpenParen() {\n  for (; !matcher_.Done(); matcher_.Next()) {\n    Label label = match_type_ == MATCH_INPUT ? matcher_.Value().ilabel\n                                             : matcher_.Value().olabel;\n    if (label > open_parens_.UpperBound()) return false;\n    if (IsOpenParen(label)) return true;\n  }\n  return false;\n}\n\n// Advances matcher to next close paren, returning true if it exists.\ntemplate <class FST>\ninline bool ParenMatcher<FST>::NextCloseParen() {\n  for (; !matcher_.Done(); matcher_.Next()) {\n    Label label = match_type_ == MATCH_INPUT ? matcher_.Value().ilabel\n                                             : matcher_.Value().olabel;\n    if (label > close_parens_.UpperBound()) return false;\n    if (IsCloseParen(label)) return true;\n  }\n  return false;\n}\n\ntemplate <class Filter>\nclass ParenFilter {\n public:\n  using FST1 = typename Filter::FST1;\n  using FST2 = typename Filter::FST2;\n  using Arc = typename Filter::Arc;\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using Matcher1 = typename Filter::Matcher1;\n  using Matcher2 = typename Filter::Matcher2;\n\n  using StackId = StateId;\n  using ParenStack = PdtStack<StackId, Label>;\n  using FilterState1 = typename Filter::FilterState;\n  using FilterState2 = IntegerFilterState<StackId>;\n  using FilterState = PairFilterState<FilterState1, FilterState2>;\n\n  ParenFilter(const FST1 &fst1, const FST2 &fst2, Matcher1 *matcher1 = nullptr,\n              Matcher2 *matcher2 = nullptr,\n              const std::vector<std::pair<Label, Label>> *parens = nullptr,\n              bool expand = false, bool keep_parens = true)\n      : filter_(fst1, fst2, matcher1, matcher2),\n        parens_(parens ? *parens : std::vector<std::pair<Label, Label>>()),\n        expand_(expand),\n        keep_parens_(keep_parens),\n        fs_(FilterState::NoState()),\n        stack_(parens_),\n        paren_id_(-1) {\n    if (parens) {\n      for (const auto &pair : *parens) {\n        parens_.push_back(pair);\n        GetMatcher1()->AddOpenParen(pair.first);\n        GetMatcher2()->AddOpenParen(pair.first);\n        if (!expand_) {\n          GetMatcher1()->AddCloseParen(pair.second);\n          GetMatcher2()->AddCloseParen(pair.second);\n        }\n      }\n    }\n  }\n\n  ParenFilter(const ParenFilter &filter, bool safe = false)\n      : filter_(filter.filter_, safe),\n        parens_(filter.parens_),\n        expand_(filter.expand_),\n        keep_parens_(filter.keep_parens_),\n        fs_(FilterState::NoState()),\n        stack_(filter.parens_),\n        paren_id_(-1) {}\n\n  FilterState Start() const {\n    return FilterState(filter_.Start(), FilterState2(0));\n  }\n\n  void SetState(StateId s1, StateId s2, const FilterState &fs) {\n    fs_ = fs;\n    filter_.SetState(s1, s2, fs_.GetState1());\n    if (!expand_) return;\n    std::ptrdiff_t paren_id = stack_.Top(fs.GetState2().GetState());\n    if (paren_id != paren_id_) {\n      if (paren_id_ != -1) {\n        GetMatcher1()->RemoveCloseParen(parens_[paren_id_].second);\n        GetMatcher2()->RemoveCloseParen(parens_[paren_id_].second);\n      }\n      paren_id_ = paren_id;\n      if (paren_id_ != -1) {\n        GetMatcher1()->AddCloseParen(parens_[paren_id_].second);\n        GetMatcher2()->AddCloseParen(parens_[paren_id_].second);\n      }\n    }\n  }\n\n  FilterState FilterArc(Arc *arc1, Arc *arc2) const {\n    const auto fs1 = filter_.FilterArc(arc1, arc2);\n    const auto &fs2 = fs_.GetState2();\n    if (fs1 == FilterState1::NoState()) return FilterState::NoState();\n    if (arc1->olabel == kNoLabel && arc2->ilabel) {  // arc2 parentheses.\n      if (keep_parens_) {\n        arc1->ilabel = arc2->ilabel;\n      } else if (arc2->ilabel) {\n        arc2->olabel = arc1->ilabel;\n      }\n      return FilterParen(arc2->ilabel, fs1, fs2);\n    } else if (arc2->ilabel == kNoLabel && arc1->olabel) {  // arc1 parentheses.\n      if (keep_parens_) {\n        arc2->olabel = arc1->olabel;\n      } else {\n        arc1->ilabel = arc2->olabel;\n      }\n      return FilterParen(arc1->olabel, fs1, fs2);\n    } else {\n      return FilterState(fs1, fs2);\n    }\n  }\n\n  void FilterFinal(Weight *w1, Weight *w2) const {\n    if (fs_.GetState2().GetState() != 0) *w1 = Weight::Zero();\n    filter_.FilterFinal(w1, w2);\n  }\n\n  // Returns respective matchers; ownership stays with filter.\n\n  Matcher1 *GetMatcher1() { return filter_.GetMatcher1(); }\n\n  Matcher2 *GetMatcher2() { return filter_.GetMatcher2(); }\n\n  uint64_t Properties(uint64_t iprops) const {\n    return filter_.Properties(iprops) & kILabelInvariantProperties &\n           kOLabelInvariantProperties;\n  }\n\n private:\n  const FilterState FilterParen(Label label, const FilterState1 &fs1,\n                                const FilterState2 &fs2) const {\n    if (!expand_) return FilterState(fs1, fs2);\n    const auto stack_id = stack_.Find(fs2.GetState(), label);\n    if (stack_id < 0) {\n      return FilterState::NoState();\n    } else {\n      return FilterState(fs1, FilterState2(stack_id));\n    }\n  }\n\n  Filter filter_;\n  std::vector<std::pair<Label, Label>> parens_;\n  bool expand_;       // Expands to FST?\n  bool keep_parens_;  // Retains parentheses in output?\n  FilterState fs_;    // Current filter state.\n  mutable ParenStack stack_;\n  std::ptrdiff_t paren_id_;\n};\n\n// Class to setup composition options for PDT composition. Default is to take\n// the PDT as the first composition argument.\ntemplate <class Arc, bool left_pdt = true>\nclass PdtComposeFstOptions\n    : public ComposeFstOptions<\n          Arc, ParenMatcher<Fst<Arc>>,\n          ParenFilter<AltSequenceComposeFilter<ParenMatcher<Fst<Arc>>>>> {\n public:\n  using Label = typename Arc::Label;\n  using PdtMatcher = ParenMatcher<Fst<Arc>>;\n  using PdtFilter = ParenFilter<AltSequenceComposeFilter<PdtMatcher>>;\n\n  using ComposeFstOptions<Arc, PdtMatcher, PdtFilter>::matcher1;\n  using ComposeFstOptions<Arc, PdtMatcher, PdtFilter>::matcher2;\n  using ComposeFstOptions<Arc, PdtMatcher, PdtFilter>::filter;\n\n  PdtComposeFstOptions(const Fst<Arc> &ifst1,\n                       const std::vector<std::pair<Label, Label>> &parens,\n                       const Fst<Arc> &ifst2, bool expand = false,\n                       bool keep_parens = true) {\n    matcher1 = new PdtMatcher(ifst1, MATCH_OUTPUT, kParenList);\n    matcher2 = new PdtMatcher(ifst2, MATCH_INPUT, kParenLoop);\n    filter = new PdtFilter(ifst1, ifst2, matcher1, matcher2, &parens, expand,\n                           keep_parens);\n  }\n};\n\n// Class to setup composition options for PDT with FST composition.\n// Specialization is for the FST as the first composition argument.\ntemplate <class Arc>\nclass PdtComposeFstOptions<Arc, false>\n    : public ComposeFstOptions<\n          Arc, ParenMatcher<Fst<Arc>>,\n          ParenFilter<SequenceComposeFilter<ParenMatcher<Fst<Arc>>>>> {\n public:\n  using Label = typename Arc::Label;\n  using PdtMatcher = ParenMatcher<Fst<Arc>>;\n  using PdtFilter = ParenFilter<SequenceComposeFilter<PdtMatcher>>;\n\n  using ComposeFstOptions<Arc, PdtMatcher, PdtFilter>::matcher1;\n  using ComposeFstOptions<Arc, PdtMatcher, PdtFilter>::matcher2;\n  using ComposeFstOptions<Arc, PdtMatcher, PdtFilter>::filter;\n\n  PdtComposeFstOptions(const Fst<Arc> &ifst1, const Fst<Arc> &ifst2,\n                       const std::vector<std::pair<Label, Label>> &parens,\n                       bool expand = false, bool keep_parens = true) {\n    matcher1 = new PdtMatcher(ifst1, MATCH_OUTPUT, kParenLoop);\n    matcher2 = new PdtMatcher(ifst2, MATCH_INPUT, kParenList);\n    filter = new PdtFilter(ifst1, ifst2, matcher1, matcher2, &parens, expand,\n                           keep_parens);\n  }\n};\n\nenum PdtComposeFilter {\n  PAREN_FILTER,         // Bar-Hillel construction; keeps parentheses.\n  EXPAND_FILTER,        // Bar-Hillel + expansion; removes parentheses.\n  EXPAND_PAREN_FILTER,  // Bar-Hillel + expansion; keeps parentheses.\n};\n\nstruct PdtComposeOptions {\n  bool connect;                  // Connect output?\n  PdtComposeFilter filter_type;  // Pre-defined filter to use.\n\n  explicit PdtComposeOptions(bool connect = true,\n                             PdtComposeFilter filter_type = PAREN_FILTER)\n      : connect(connect), filter_type(filter_type) {}\n};\n\n// Composes pushdown transducer (PDT) encoded as an FST (1st arg) and an FST\n// (2nd arg) with the result also a PDT encoded as an FST (3rd arg). In the\n// PDTs, some transitions are labeled with open or close parentheses. To be\n// interpreted as a PDT, the parens must balance on a path (see PdtExpand()).\n// The open-close parenthesis label pairs are passed using the parens argument.\ntemplate <class Arc>\nvoid Compose(const Fst<Arc> &ifst1,\n             const std::vector<\n                 std::pair<typename Arc::Label, typename Arc::Label>> &parens,\n             const Fst<Arc> &ifst2, MutableFst<Arc> *ofst,\n             const PdtComposeOptions &opts = PdtComposeOptions()) {\n  bool expand = opts.filter_type != PAREN_FILTER;\n  bool keep_parens = opts.filter_type != EXPAND_FILTER;\n  PdtComposeFstOptions<Arc, true> copts(ifst1, parens, ifst2, expand,\n                                        keep_parens);\n  copts.gc_limit = 0;\n  *ofst = ComposeFst<Arc>(ifst1, ifst2, copts);\n  if (opts.connect) Connect(ofst);\n}\n\n// Composes an FST (1st arg) and pushdown transducer (PDT) encoded as an FST\n// (2nd arg) with the result also a PDT encoded as an FST (3rd arg). In the\n// PDTs, some transitions are labeled with open or close parentheses. To be\n// interpreted as a PDT, the parens must balance on a path (see ExpandFst()).\n// The open-close parenthesis label pairs are passed using the parens argument.\ntemplate <class Arc>\nvoid Compose(const Fst<Arc> &ifst1, const Fst<Arc> &ifst2,\n             const std::vector<\n                 std::pair<typename Arc::Label, typename Arc::Label>> &parens,\n             MutableFst<Arc> *ofst,\n             const PdtComposeOptions &opts = PdtComposeOptions()) {\n  bool expand = opts.filter_type != PAREN_FILTER;\n  bool keep_parens = opts.filter_type != EXPAND_FILTER;\n  PdtComposeFstOptions<Arc, false> copts(ifst1, ifst2, parens, expand,\n                                         keep_parens);\n  copts.gc_limit = 0;\n  *ofst = ComposeFst<Arc>(ifst1, ifst2, copts);\n  if (opts.connect) Connect(ofst);\n}\n\n}  // namespace fst\n\n#endif  // FST_EXTENSIONS_PDT_COMPOSE_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/extensions/pdt/expand.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Expands a PDT to an FST.\n\n#ifndef FST_EXTENSIONS_PDT_EXPAND_H_\n#define FST_EXTENSIONS_PDT_EXPAND_H_\n\n#include <forward_list>\n#include <vector>\n\n#include <fst/log.h>\n\n#include <fst/extensions/pdt/paren.h>\n#include <fst/extensions/pdt/pdt.h>\n#include <fst/extensions/pdt/reverse.h>\n#include <fst/extensions/pdt/shortest-path.h>\n#include <fst/cache.h>\n#include <fst/mutable-fst.h>\n#include <fst/queue.h>\n#include <fst/state-table.h>\n#include <fst/test-properties.h>\n\nnamespace fst {\n\ntemplate <class Arc>\nstruct PdtExpandFstOptions : public CacheOptions {\n  bool keep_parentheses;\n  PdtStack<typename Arc::StateId, typename Arc::Label> *stack;\n  PdtStateTable<typename Arc::StateId, typename Arc::StateId> *state_table;\n\n  explicit PdtExpandFstOptions(\n      const CacheOptions &opts = CacheOptions(), bool keep_parentheses = false,\n      PdtStack<typename Arc::StateId, typename Arc::Label> *stack = nullptr,\n      PdtStateTable<typename Arc::StateId, typename Arc::StateId> *state_table =\n          nullptr)\n      : CacheOptions(opts),\n        keep_parentheses(keep_parentheses),\n        stack(stack),\n        state_table(state_table) {}\n};\n\nnamespace internal {\n\n// Implementation class for PdtExpandFst.\ntemplate <class Arc>\nclass PdtExpandFstImpl : public CacheImpl<Arc> {\n public:\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using StackId = StateId;\n  using StateTuple = PdtStateTuple<StateId, StackId>;\n\n  using FstImpl<Arc>::SetType;\n  using FstImpl<Arc>::SetProperties;\n  using FstImpl<Arc>::Properties;\n  using FstImpl<Arc>::SetInputSymbols;\n  using FstImpl<Arc>::SetOutputSymbols;\n\n  using CacheBaseImpl<CacheState<Arc>>::PushArc;\n  using CacheBaseImpl<CacheState<Arc>>::HasArcs;\n  using CacheBaseImpl<CacheState<Arc>>::HasFinal;\n  using CacheBaseImpl<CacheState<Arc>>::HasStart;\n  using CacheBaseImpl<CacheState<Arc>>::SetArcs;\n  using CacheBaseImpl<CacheState<Arc>>::SetFinal;\n  using CacheBaseImpl<CacheState<Arc>>::SetStart;\n\n  PdtExpandFstImpl(const Fst<Arc> &fst,\n                   const std::vector<std::pair<Label, Label>> &parens,\n                   const PdtExpandFstOptions<Arc> &opts)\n      : CacheImpl<Arc>(opts),\n        fst_(fst.Copy()),\n        stack_(opts.stack ? opts.stack : new PdtStack<StateId, Label>(parens)),\n        state_table_(opts.state_table ? opts.state_table\n                                      : new PdtStateTable<StateId, StackId>()),\n        own_stack_(opts.stack == 0),\n        own_state_table_(opts.state_table == 0),\n        keep_parentheses_(opts.keep_parentheses) {\n    SetType(\"expand\");\n    const auto props = fst.Properties(kFstProperties, false);\n    SetProperties(PdtExpandProperties(props), kCopyProperties);\n    SetInputSymbols(fst.InputSymbols());\n    SetOutputSymbols(fst.OutputSymbols());\n  }\n\n  PdtExpandFstImpl(const PdtExpandFstImpl &impl)\n      : CacheImpl<Arc>(impl),\n        fst_(impl.fst_->Copy(true)),\n        stack_(new PdtStack<StateId, Label>(*impl.stack_)),\n        state_table_(new PdtStateTable<StateId, StackId>()),\n        own_stack_(true),\n        own_state_table_(true),\n        keep_parentheses_(impl.keep_parentheses_) {\n    SetType(\"expand\");\n    SetProperties(impl.Properties(), kCopyProperties);\n    SetInputSymbols(impl.InputSymbols());\n    SetOutputSymbols(impl.OutputSymbols());\n  }\n\n  ~PdtExpandFstImpl() override {\n    if (own_stack_) delete stack_;\n    if (own_state_table_) delete state_table_;\n  }\n\n  StateId Start() {\n    if (!HasStart()) {\n      const auto s = fst_->Start();\n      if (s == kNoStateId) return kNoStateId;\n      StateTuple tuple(s, 0);\n      const auto start = state_table_->FindState(tuple);\n      SetStart(start);\n    }\n    return CacheImpl<Arc>::Start();\n  }\n\n  Weight Final(StateId s) {\n    if (!HasFinal(s)) {\n      const auto &tuple = state_table_->Tuple(s);\n      const auto weight = fst_->Final(tuple.state_id);\n      if (weight != Weight::Zero() && tuple.stack_id == 0)\n        SetFinal(s, weight);\n      else\n        SetFinal(s, Weight::Zero());\n    }\n    return CacheImpl<Arc>::Final(s);\n  }\n\n  size_t NumArcs(StateId s) {\n    if (!HasArcs(s)) ExpandState(s);\n    return CacheImpl<Arc>::NumArcs(s);\n  }\n\n  size_t NumInputEpsilons(StateId s) {\n    if (!HasArcs(s)) ExpandState(s);\n    return CacheImpl<Arc>::NumInputEpsilons(s);\n  }\n\n  size_t NumOutputEpsilons(StateId s) {\n    if (!HasArcs(s)) ExpandState(s);\n    return CacheImpl<Arc>::NumOutputEpsilons(s);\n  }\n\n  void InitArcIterator(StateId s, ArcIteratorData<Arc> *data) {\n    if (!HasArcs(s)) ExpandState(s);\n    CacheImpl<Arc>::InitArcIterator(s, data);\n  }\n\n  // Computes the outgoing transitions from a state, creating new destination\n  // states as needed.\n  void ExpandState(StateId s) {\n    StateTuple tuple = state_table_->Tuple(s);\n    for (ArcIterator<Fst<Arc>> aiter(*fst_, tuple.state_id); !aiter.Done();\n         aiter.Next()) {\n      auto arc = aiter.Value();\n      const auto stack_id = stack_->Find(tuple.stack_id, arc.ilabel);\n      if (stack_id == -1) {  // Non-matching close parenthesis.\n        continue;\n      } else if ((stack_id != tuple.stack_id) && !keep_parentheses_) {\n        // Stack push/pop.\n        arc.ilabel = 0;\n        arc.olabel = 0;\n      }\n      StateTuple ntuple(arc.nextstate, stack_id);\n      arc.nextstate = state_table_->FindState(ntuple);\n      PushArc(s, arc);\n    }\n    SetArcs(s);\n  }\n\n  const PdtStack<StackId, Label> &GetStack() const { return *stack_; }\n\n  const PdtStateTable<StateId, StackId> &GetStateTable() const {\n    return *state_table_;\n  }\n\n private:\n  // Properties for an expanded PDT.\n  inline uint64_t PdtExpandProperties(uint64_t inprops) {\n    return inprops & (kAcceptor | kAcyclic | kInitialAcyclic | kUnweighted);\n  }\n\n  std::unique_ptr<const Fst<Arc>> fst_;\n  PdtStack<StackId, Label> *stack_;\n  PdtStateTable<StateId, StackId> *state_table_;\n  bool own_stack_;\n  bool own_state_table_;\n  bool keep_parentheses_;\n};\n\n}  // namespace internal\n\n// Expands a pushdown transducer (PDT) encoded as an FST into an FST. This\n// version is a delayed FST. In the PDT, some transitions are labeled with open\n// or close parentheses. To be interpreted as a PDT, the parens must balance on\n// a path. The open-close parenthesis label pairs are passed using the parens\n// argument. The expansion enforces the parenthesis constraints. The PDT must be\n// expandable as an FST.\n//\n// This class attaches interface to implementation and handles reference\n// counting, delegating most methods to ImplToFst.\ntemplate <class A>\nclass PdtExpandFst : public ImplToFst<internal::PdtExpandFstImpl<A>> {\n public:\n  using Arc = A;\n\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using StackId = StateId;\n  using Store = DefaultCacheStore<Arc>;\n  using State = typename Store::State;\n  using Impl = internal::PdtExpandFstImpl<Arc>;\n\n  friend class ArcIterator<PdtExpandFst<Arc>>;\n  friend class StateIterator<PdtExpandFst<Arc>>;\n\n  PdtExpandFst(const Fst<Arc> &fst,\n               const std::vector<std::pair<Label, Label>> &parens)\n      : ImplToFst<Impl>(\n            std::make_shared<Impl>(fst, parens, PdtExpandFstOptions<A>())) {}\n\n  PdtExpandFst(const Fst<Arc> &fst,\n               const std::vector<std::pair<Label, Label>> &parens,\n               const PdtExpandFstOptions<Arc> &opts)\n      : ImplToFst<Impl>(std::make_shared<Impl>(fst, parens, opts)) {}\n\n  // See Fst<>::Copy() for doc.\n  PdtExpandFst(const PdtExpandFst<Arc> &fst, bool safe = false)\n      : ImplToFst<Impl>(fst, safe) {}\n\n  // Gets a copy of this ExpandFst. See Fst<>::Copy() for further doc.\n  PdtExpandFst<Arc> *Copy(bool safe = false) const override {\n    return new PdtExpandFst<Arc>(*this, safe);\n  }\n\n  inline void InitStateIterator(StateIteratorData<Arc> *data) const override;\n\n  void InitArcIterator(StateId s, ArcIteratorData<Arc> *data) const override {\n    GetMutableImpl()->InitArcIterator(s, data);\n  }\n\n  const PdtStack<StackId, Label> &GetStack() const {\n    return GetImpl()->GetStack();\n  }\n\n  const PdtStateTable<StateId, StackId> &GetStateTable() const {\n    return GetImpl()->GetStateTable();\n  }\n\n private:\n  using ImplToFst<Impl>::GetImpl;\n  using ImplToFst<Impl>::GetMutableImpl;\n\n  void operator=(const PdtExpandFst &) = delete;\n};\n\n// Specialization for PdtExpandFst.\ntemplate <class Arc>\nclass StateIterator<PdtExpandFst<Arc>>\n    : public CacheStateIterator<PdtExpandFst<Arc>> {\n public:\n  explicit StateIterator(const PdtExpandFst<Arc> &fst)\n      : CacheStateIterator<PdtExpandFst<Arc>>(fst, fst.GetMutableImpl()) {}\n};\n\n// Specialization for PdtExpandFst.\ntemplate <class Arc>\nclass ArcIterator<PdtExpandFst<Arc>>\n    : public CacheArcIterator<PdtExpandFst<Arc>> {\n public:\n  using StateId = typename Arc::StateId;\n\n  ArcIterator(const PdtExpandFst<Arc> &fst, StateId s)\n      : CacheArcIterator<PdtExpandFst<Arc>>(fst.GetMutableImpl(), s) {\n    if (!fst.GetImpl()->HasArcs(s)) fst.GetMutableImpl()->ExpandState(s);\n  }\n};\n\ntemplate <class Arc>\ninline void PdtExpandFst<Arc>::InitStateIterator(\n    StateIteratorData<Arc> *data) const {\n  data->base = new StateIterator<PdtExpandFst<Arc>>(*this);\n}\n\n// PrunedExpand prunes the delayed expansion of a pushdown transducer (PDT)\n// encoded as an FST into an FST. In the PDT, some transitions are labeled with\n// open or close parentheses. To be interpreted as a PDT, the parens must\n// balance on a path. The open-close parenthesis label pairs are passed\n// using the parens argument. The expansion enforces the parenthesis\n// constraints.\n//\n// The algorithm works by visiting the delayed ExpandFst using a shortest-stack\n// first queue discipline and relies on the shortest-distance information\n// computed using a reverse shortest-path call to perform the pruning.\n//\n// The algorithm maintains the same state ordering between the ExpandFst being\n// visited (efst_) and the result of pruning written into the MutableFst (ofst_)\n// to improve readability.\ntemplate <class Arc>\nclass PdtPrunedExpand {\n public:\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using StackId = StateId;\n  using Stack = PdtStack<StackId, Label>;\n  using StateTable = PdtStateTable<StateId, StackId>;\n  using SetIterator = typename internal::PdtBalanceData<Arc>::SetIterator;\n\n  // Constructor taking as input a PDT specified by by an input FST and a vector\n  // of parentheses. The keep_parentheses argument specifies whether parentheses\n  // are replaced by epsilons or not during the expansion. The cache options are\n  // passed to the underlying ExpandFst.\n  PdtPrunedExpand(const Fst<Arc> &ifst,\n                  const std::vector<std::pair<Label, Label>> &parens,\n                  bool keep_parentheses = false,\n                  const CacheOptions &opts = CacheOptions())\n      : ifst_(ifst.Copy()),\n        keep_parentheses_(keep_parentheses),\n        stack_(parens),\n        efst_(ifst, parens,\n              PdtExpandFstOptions<Arc>(opts, true, &stack_, &state_table_)),\n        queue_(state_table_, stack_, stack_length_, distance_, fdistance_),\n        error_(false) {\n    Reverse(*ifst_, parens, &rfst_);\n    VectorFst<Arc> path;\n    reverse_shortest_path_.reset(new PdtShortestPath<Arc, FifoQueue<StateId>>(\n        rfst_, parens,\n        PdtShortestPathOptions<Arc, FifoQueue<StateId>>(true, false)));\n    reverse_shortest_path_->ShortestPath(&path);\n    error_ = (path.Properties(kError, true) == kError);\n    balance_data_.reset(reverse_shortest_path_->GetBalanceData()->Reverse(\n        rfst_.NumStates(), 10, -1));\n    InitCloseParenMultimap(parens);\n  }\n\n  bool Error() const { return error_; }\n\n  // Expands and prunes the input PDT according to the provided weight\n  // threshold, wirting the result into an output mutable FST.\n  void Expand(MutableFst<Arc> *ofst, const Weight &threshold);\n\n private:\n  static constexpr uint8_t kEnqueued = 0x01;\n  static constexpr uint8_t kExpanded = 0x02;\n  static constexpr uint8_t kSourceState = 0x04;\n\n  // Comparison functor used by the queue:\n  //\n  // 1. States corresponding to shortest stack first, and\n  // 2. for stacks of matching length, reverse lexicographic order is used, and\n  // 3. for states with the same stack, shortest-first order is used.\n  class StackCompare {\n   public:\n    StackCompare(const StateTable &state_table, const Stack &stack,\n                 const std::vector<StackId> &stack_length,\n                 const std::vector<Weight> &distance,\n                 const std::vector<Weight> &fdistance)\n        : state_table_(state_table),\n          stack_(stack),\n          stack_length_(stack_length),\n          distance_(distance),\n          fdistance_(fdistance) {}\n\n    bool operator()(StateId s1, StateId s2) const {\n      auto si1 = state_table_.Tuple(s1).stack_id;\n      auto si2 = state_table_.Tuple(s2).stack_id;\n      if (stack_length_[si1] < stack_length_[si2]) return true;\n      if (stack_length_[si1] > stack_length_[si2]) return false;\n      // If stack IDs are equal, use A*.\n      if (si1 == si2) {\n        return less_(Distance(s1), Distance(s2));\n      }\n      // If lengths are equal, uses reverse lexicographic order.\n      for (; si1 != si2; si1 = stack_.Pop(si1), si2 = stack_.Pop(si2)) {\n        if (stack_.Top(si1) < stack_.Top(si2)) return true;\n        if (stack_.Top(si1) > stack_.Top(si2)) return false;\n      }\n      return false;\n    }\n\n   private:\n    Weight Distance(StateId s) const {\n      return (s < distance_.size()) && (s < fdistance_.size())\n                 ? Times(distance_[s], fdistance_[s])\n                 : Weight::Zero();\n    }\n\n    const StateTable &state_table_;\n    const Stack &stack_;\n    const std::vector<StackId> &stack_length_;\n    const std::vector<Weight> &distance_;\n    const std::vector<Weight> &fdistance_;\n    const NaturalLess<Weight> less_;\n  };\n\n  class ShortestStackFirstQueue\n      : public ShortestFirstQueue<StateId, StackCompare> {\n   public:\n    ShortestStackFirstQueue(const PdtStateTable<StateId, StackId> &state_table,\n                            const Stack &stack,\n                            const std::vector<StackId> &stack_length,\n                            const std::vector<Weight> &distance,\n                            const std::vector<Weight> &fdistance)\n        : ShortestFirstQueue<StateId, StackCompare>(StackCompare(\n              state_table, stack, stack_length, distance, fdistance)) {}\n  };\n\n  void InitCloseParenMultimap(\n      const std::vector<std::pair<Label, Label>> &parens);\n\n  Weight DistanceToDest(StateId source, StateId dest) const;\n\n  uint8_t Flags(StateId s) const;\n\n  void SetFlags(StateId s, uint8_t flags, uint8_t mask);\n\n  Weight Distance(StateId s) const;\n\n  void SetDistance(StateId s, Weight weight);\n\n  Weight FinalDistance(StateId s) const;\n\n  void SetFinalDistance(StateId s, Weight weight);\n\n  StateId SourceState(StateId s) const;\n\n  void SetSourceState(StateId s, StateId p);\n\n  void AddStateAndEnqueue(StateId s);\n\n  void Relax(StateId s, const Arc &arc, Weight weight);\n\n  bool PruneArc(StateId s, const Arc &arc);\n\n  void ProcStart();\n\n  void ProcFinal(StateId s);\n\n  bool ProcNonParen(StateId s, const Arc &arc, bool add_arc);\n\n  bool ProcOpenParen(StateId s, const Arc &arc, StackId si, StackId nsi);\n\n  bool ProcCloseParen(StateId s, const Arc &arc);\n\n  void ProcDestStates(StateId s, StackId si);\n\n  // Input PDT.\n  std::unique_ptr<Fst<Arc>> ifst_;\n  // Reversed PDT.\n  VectorFst<Arc> rfst_;\n  // Keep parentheses in ofst?\n  const bool keep_parentheses_;\n  // State table for efst_.\n  StateTable state_table_;\n  // Stack trie.\n  Stack stack_;\n  // Expanded PDT.\n  PdtExpandFst<Arc> efst_;\n  // Length of stack for given stack ID.\n  std::vector<StackId> stack_length_;\n  // Distance from initial state in efst_/ofst.\n  std::vector<Weight> distance_;\n  // Distance to final states in efst_/ofst.\n  std::vector<Weight> fdistance_;\n  // Queue used to visit efst_.\n  ShortestStackFirstQueue queue_;\n  // Construction time failure?\n  bool error_;\n  // Status flags for states in efst_/ofst.\n  std::vector<uint8_t> flags_;\n  // PDT source state for each expanded state.\n  std::vector<StateId> sources_;\n  // Shortest path for rfst_.\n  std::unique_ptr<PdtShortestPath<Arc, FifoQueue<StateId>>>\n      reverse_shortest_path_;\n  std::unique_ptr<internal::PdtBalanceData<Arc>> balance_data_;\n  // Maps open paren arcs to balancing close paren arcs.\n  typename PdtShortestPath<Arc, FifoQueue<StateId>>::CloseParenMultimap\n      close_paren_multimap_;\n  MutableFst<Arc> *ofst_;  // Output FST.\n  Weight limit_;           // Weight limit.\n\n  // Maps a state s in ifst (i.e., the source of a closed paranthesis matching\n  // the top of current_stack_id_ to final states in efst_.\n  std::unordered_map<StateId, Weight> dest_map_;\n  // Stack ID of the states currently at the top of the queue, i.e., the states\n  // currently being popped and processed.\n  StackId current_stack_id_;\n  std::ptrdiff_t current_paren_id_;  // Paren ID at top of current stack.\n  std::ptrdiff_t cached_stack_id_;\n  StateId cached_source_;\n  // The set of pairs of destination states and weights to final states for the\n  // source state cached_source_ and the paren ID cached_paren_id_; i.e., the\n  // set of source states of a closed parenthesis with paren ID cached_paren_id\n  // balancing an incoming open parenthesis with paren ID cached_paren_id_ in\n  // state cached_source_.\n  std::forward_list<std::pair<StateId, Weight>> cached_dest_list_;\n  NaturalLess<Weight> less_;\n};\n\n// Initializes close paren multimap, mapping pairs (s, paren_id) to all the arcs\n// out of s labeled with close parenthese for paren_id.\ntemplate <class Arc>\nvoid PdtPrunedExpand<Arc>::InitCloseParenMultimap(\n    const std::vector<std::pair<Label, Label>> &parens) {\n  std::unordered_map<Label, Label> paren_map;\n  for (size_t i = 0; i < parens.size(); ++i) {\n    const auto &pair = parens[i];\n    paren_map[pair.first] = i;\n    paren_map[pair.second] = i;\n  }\n  for (StateIterator<Fst<Arc>> siter(*ifst_); !siter.Done(); siter.Next()) {\n    const auto s = siter.Value();\n    for (ArcIterator<Fst<Arc>> aiter(*ifst_, s); !aiter.Done(); aiter.Next()) {\n      const auto &arc = aiter.Value();\n      const auto it = paren_map.find(arc.ilabel);\n      if (it == paren_map.end()) continue;\n      if (arc.ilabel == parens[it->second].second) {  // Close paren.\n        const internal::ParenState<Arc> key(it->second, s);\n        close_paren_multimap_.emplace(key, arc);\n      }\n    }\n  }\n}\n\n// Returns the weight of the shortest balanced path from source to dest\n// in ifst_; dest must be the source state of a close paren arc.\ntemplate <class Arc>\ntypename Arc::Weight PdtPrunedExpand<Arc>::DistanceToDest(StateId source,\n                                                          StateId dest) const {\n  using SearchState =\n      typename PdtShortestPath<Arc, FifoQueue<StateId>>::SearchState;\n  const SearchState ss(source + 1, dest + 1);\n  const auto distance =\n      reverse_shortest_path_->GetShortestPathData().Distance(ss);\n  VLOG(2) << \"D(\" << source << \", \" << dest << \") =\" << distance;\n  return distance;\n}\n\n// Returns the flags for state s in ofst_.\ntemplate <class Arc>\nuint8_t PdtPrunedExpand<Arc>::Flags(StateId s) const {\n  return s < flags_.size() ? flags_[s] : 0;\n}\n\n// Modifies the flags for state s in ofst_.\ntemplate <class Arc>\nvoid PdtPrunedExpand<Arc>::SetFlags(StateId s, uint8_t flags, uint8_t mask) {\n  while (flags_.size() <= s) flags_.push_back(0);\n  flags_[s] &= ~mask;\n  flags_[s] |= flags & mask;\n}\n\n// Returns the shortest distance from the initial state to s in ofst_.\ntemplate <class Arc>\ntypename Arc::Weight PdtPrunedExpand<Arc>::Distance(StateId s) const {\n  return s < distance_.size() ? distance_[s] : Weight::Zero();\n}\n\n// Sets the shortest distance from the initial state to s in ofst_.\ntemplate <class Arc>\nvoid PdtPrunedExpand<Arc>::SetDistance(StateId s, Weight weight) {\n  while (distance_.size() <= s) distance_.push_back(Weight::Zero());\n  distance_[s] = std::move(weight);\n}\n\n// Returns the shortest distance from s to the final states in ofst_.\ntemplate <class Arc>\ntypename Arc::Weight PdtPrunedExpand<Arc>::FinalDistance(StateId s) const {\n  return s < fdistance_.size() ? fdistance_[s] : Weight::Zero();\n}\n\n// Sets the shortest distance from s to the final states in ofst_.\ntemplate <class Arc>\nvoid PdtPrunedExpand<Arc>::SetFinalDistance(StateId s, Weight weight) {\n  while (fdistance_.size() <= s) fdistance_.push_back(Weight::Zero());\n  fdistance_[s] = std::move(weight);\n}\n\n// Returns the PDT source state of state s in ofst_.\ntemplate <class Arc>\ntypename Arc::StateId PdtPrunedExpand<Arc>::SourceState(StateId s) const {\n  return s < sources_.size() ? sources_[s] : kNoStateId;\n}\n\n// Sets the PDT source state of state s in ofst_ to state p'in ifst_.\ntemplate <class Arc>\nvoid PdtPrunedExpand<Arc>::SetSourceState(StateId s, StateId p) {\n  while (sources_.size() <= s) sources_.push_back(kNoStateId);\n  sources_[s] = p;\n}\n\n// Adds state s of efst_ to ofst_ and inserts it in the queue, modifying the\n// flags for s accordingly.\ntemplate <class Arc>\nvoid PdtPrunedExpand<Arc>::AddStateAndEnqueue(StateId s) {\n  if (!(Flags(s) & (kEnqueued | kExpanded))) {\n    while (ofst_->NumStates() <= s) ofst_->AddState();\n    queue_.Enqueue(s);\n    SetFlags(s, kEnqueued, kEnqueued);\n  } else if (Flags(s) & kEnqueued) {\n    queue_.Update(s);\n  }\n  // TODO(allauzen): Check everything is fine when kExpanded?\n}\n\n// Relaxes arc out of state s in ofst_ as follows:\n//\n// 1. If the distance to s times the weight of arc is smaller than\n//   the currently stored distance for arc.nextstate, updates\n//   Distance(arc.nextstate) with a new estimate\n// 2. If fd is less than the currently stored distance from arc.nextstate to the\n// final state, updates with new estimate.\ntemplate <class Arc>\nvoid PdtPrunedExpand<Arc>::Relax(StateId s, const Arc &arc, Weight fd) {\n  const auto nd = Times(Distance(s), arc.weight);\n  if (less_(nd, Distance(arc.nextstate))) {\n    SetDistance(arc.nextstate, nd);\n    SetSourceState(arc.nextstate, SourceState(s));\n  }\n  if (less_(fd, FinalDistance(arc.nextstate))) {\n    SetFinalDistance(arc.nextstate, fd);\n  }\n  VLOG(2) << \"Relax: \" << s << \", d[s] = \" << Distance(s) << \", to \"\n          << arc.nextstate << \", d[ns] = \" << Distance(arc.nextstate)\n          << \", nd = \" << nd;\n}\n\n// Returns whether the arc out of state s in efst needs pruned.\ntemplate <class Arc>\nbool PdtPrunedExpand<Arc>::PruneArc(StateId s, const Arc &arc) {\n  VLOG(2) << \"Prune ?\";\n  auto fd = Weight::Zero();\n  if ((cached_source_ != SourceState(s)) ||\n      (cached_stack_id_ != current_stack_id_)) {\n    cached_source_ = SourceState(s);\n    cached_stack_id_ = current_stack_id_;\n    cached_dest_list_.clear();\n    if (cached_source_ != ifst_->Start()) {\n      for (auto set_iter =\n               balance_data_->Find(current_paren_id_, cached_source_);\n           !set_iter.Done(); set_iter.Next()) {\n        auto dest = set_iter.Element();\n        const auto it = dest_map_.find(dest);\n        cached_dest_list_.push_front(*it);\n      }\n    } else {\n      // TODO(allauzen): queue discipline should prevent this from ever\n      // happening.\n      // Replace by a check.\n      cached_dest_list_.push_front(\n          std::make_pair(rfst_.Start() - 1, Weight::One()));\n    }\n  }\n  for (auto it = cached_dest_list_.begin(); it != cached_dest_list_.end();\n       ++it) {\n    const auto d =\n        DistanceToDest(state_table_.Tuple(arc.nextstate).state_id, it->first);\n    fd = Plus(fd, Times(d, it->second));\n  }\n  Relax(s, arc, fd);\n  return less_(limit_, Times(Distance(s), Times(arc.weight, fd)));\n}\n\n// Adds start state of efst_ to ofst_, enqueues it, and initializes the distance\n// data structures.\ntemplate <class Arc>\nvoid PdtPrunedExpand<Arc>::ProcStart() {\n  const auto s = efst_.Start();\n  AddStateAndEnqueue(s);\n  ofst_->SetStart(s);\n  SetSourceState(s, ifst_->Start());\n  current_stack_id_ = 0;\n  current_paren_id_ = -1;\n  stack_length_.push_back(0);\n  const auto r = rfst_.Start() - 1;\n  cached_source_ = ifst_->Start();\n  cached_stack_id_ = 0;\n  cached_dest_list_.push_front(std::make_pair(r, Weight::One()));\n  const PdtStateTuple<StateId, StackId> tuple(r, 0);\n  SetFinalDistance(state_table_.FindState(tuple), Weight::One());\n  SetDistance(s, Weight::One());\n  const auto d = DistanceToDest(ifst_->Start(), r);\n  SetFinalDistance(s, d);\n  VLOG(2) << d;\n}\n\n// Makes s final in ofst_ if shortest accepting path ending in s is below\n// threshold.\ntemplate <class Arc>\nvoid PdtPrunedExpand<Arc>::ProcFinal(StateId s) {\n  const auto weight = efst_.Final(s);\n  if (weight == Weight::Zero()) return;\n  if (less_(limit_, Times(Distance(s), weight))) return;\n  ofst_->SetFinal(s, weight);\n}\n\n// Returns true when an arc (or meta-arc) leaving state s in efst_ is below the\n// threshold. When add_arc is true, arc is added to ofst_.\ntemplate <class Arc>\nbool PdtPrunedExpand<Arc>::ProcNonParen(StateId s, const Arc &arc,\n                                        bool add_arc) {\n  VLOG(2) << \"ProcNonParen: \" << s << \" to \" << arc.nextstate << \", \"\n          << arc.ilabel << \":\" << arc.olabel << \" / \" << arc.weight\n          << \", add_arc = \" << (add_arc ? \"true\" : \"false\");\n  if (PruneArc(s, arc)) return false;\n  if (add_arc) ofst_->AddArc(s, arc);\n  AddStateAndEnqueue(arc.nextstate);\n  return true;\n}\n\n// Processes an open paren arc leaving state s in ofst_. When the arc is labeled\n// with an open paren,\n//\n// 1. Considers each (shortest) balanced path starting in s by taking the arc\n// and ending by a close paren balancing the open paren of as a meta-arc,\n// processing and pruning each meta-arc as a non-paren arc, inserting its\n// destination to the queue;\n// 2. if at least one of these meta-arcs has not been pruned, adds the\n// destination of arc to ofst_ as a new source state for the stack ID nsi, and\n// inserts it in the queue.\ntemplate <class Arc>\nbool PdtPrunedExpand<Arc>::ProcOpenParen(StateId s, const Arc &arc, StackId si,\n                                         StackId nsi) {\n  // Updates the stack length when needed.\n  while (stack_length_.size() <= nsi) stack_length_.push_back(-1);\n  if (stack_length_[nsi] == -1) stack_length_[nsi] = stack_length_[si] + 1;\n  const auto ns = arc.nextstate;\n  VLOG(2) << \"Open paren: \" << s << \"(\" << state_table_.Tuple(s).state_id\n          << \") to \" << ns << \"(\" << state_table_.Tuple(ns).state_id << \")\";\n  bool proc_arc = false;\n  auto fd = Weight::Zero();\n  const auto paren_id = stack_.ParenId(arc.ilabel);\n  std::forward_list<StateId> sources;\n  for (auto set_iter =\n           balance_data_->Find(paren_id, state_table_.Tuple(ns).state_id);\n       !set_iter.Done(); set_iter.Next()) {\n    sources.push_front(set_iter.Element());\n  }\n  for (const auto source : sources) {\n    VLOG(2) << \"Close paren source: \" << source;\n    const internal::ParenState<Arc> paren_state(paren_id, source);\n    for (auto it = close_paren_multimap_.find(paren_state);\n         it != close_paren_multimap_.end() && paren_state == it->first; ++it) {\n      auto meta_arc = it->second;\n      const PdtStateTuple<StateId, StackId> tuple(meta_arc.nextstate, si);\n      meta_arc.nextstate = state_table_.FindState(tuple);\n      const auto state_id = state_table_.Tuple(ns).state_id;\n      const auto d = DistanceToDest(state_id, source);\n      VLOG(2) << state_id << \", \" << source;\n      VLOG(2) << \"Meta arc weight = \" << arc.weight << \" Times \" << d\n              << \" Times \" << meta_arc.weight;\n      meta_arc.weight = Times(arc.weight, Times(d, meta_arc.weight));\n      proc_arc |= ProcNonParen(s, meta_arc, false);\n      fd = Plus(\n          fd,\n          Times(Times(DistanceToDest(state_table_.Tuple(ns).state_id, source),\n                      it->second.weight),\n                FinalDistance(meta_arc.nextstate)));\n    }\n  }\n  if (proc_arc) {\n    VLOG(2) << \"Proc open paren \" << s << \" to \" << arc.nextstate;\n    ofst_->AddArc(\n        s, keep_parentheses_ ? arc : Arc(0, 0, arc.weight, arc.nextstate));\n    AddStateAndEnqueue(arc.nextstate);\n    const auto nd = Times(Distance(s), arc.weight);\n    if (less_(nd, Distance(arc.nextstate))) SetDistance(arc.nextstate, nd);\n    // FinalDistance not necessary for source state since pruning decided using\n    // meta-arcs above.  But this is a problem with A*, hence the following.\n    if (less_(fd, FinalDistance(arc.nextstate)))\n      SetFinalDistance(arc.nextstate, fd);\n    SetFlags(arc.nextstate, kSourceState, kSourceState);\n  }\n  return proc_arc;\n}\n\n// Checks that shortest path through close paren arc in efst_ is below\n// threshold, and if so, adds it to ofst_.\ntemplate <class Arc>\nbool PdtPrunedExpand<Arc>::ProcCloseParen(StateId s, const Arc &arc) {\n  const auto weight =\n      Times(Distance(s), Times(arc.weight, FinalDistance(arc.nextstate)));\n  if (less_(limit_, weight)) return false;\n  ofst_->AddArc(s,\n                keep_parentheses_ ? arc : Arc(0, 0, arc.weight, arc.nextstate));\n  return true;\n}\n\n// When state s in ofst_ is a source state for stack ID si, identifies all the\n// corresponding possible destination states, that is, all the states in ifst_\n// that have an outgoing close paren arc balancing the incoming open paren taken\n// to get to s. For each such state t, computes the shortest distance from (t,\n// si) to the final states in ofst_. Stores this information in dest_map_.\ntemplate <class Arc>\nvoid PdtPrunedExpand<Arc>::ProcDestStates(StateId s, StackId si) {\n  if (!(Flags(s) & kSourceState)) return;\n  if (si != current_stack_id_) {\n    dest_map_.clear();\n    current_stack_id_ = si;\n    current_paren_id_ = stack_.Top(current_stack_id_);\n    VLOG(2) << \"StackID \" << si << \" dequeued for first time\";\n  }\n  // TODO(allauzen): clean up source state business; rename current function to\n  // ProcSourceState.\n  SetSourceState(s, state_table_.Tuple(s).state_id);\n  const auto paren_id = stack_.Top(si);\n  for (auto set_iter =\n           balance_data_->Find(paren_id, state_table_.Tuple(s).state_id);\n       !set_iter.Done(); set_iter.Next()) {\n    const auto dest_state = set_iter.Element();\n    if (dest_map_.find(dest_state) != dest_map_.end()) continue;\n    auto dest_weight = Weight::Zero();\n    internal::ParenState<Arc> paren_state(paren_id, dest_state);\n    for (auto it = close_paren_multimap_.find(paren_state);\n         it != close_paren_multimap_.end() && paren_state == it->first; ++it) {\n      const auto &arc = it->second;\n      const PdtStateTuple<StateId, StackId> tuple(arc.nextstate,\n                                                  stack_.Pop(si));\n      dest_weight =\n          Plus(dest_weight,\n               Times(arc.weight, FinalDistance(state_table_.FindState(tuple))));\n    }\n    dest_map_[dest_state] = dest_weight;\n    VLOG(2) << \"State \" << dest_state << \" is a dest state for stack ID \" << si\n            << \" with weight \" << dest_weight;\n  }\n}\n\n// Expands and prunes the input PDT, writing the result in ofst.\ntemplate <class Arc>\nvoid PdtPrunedExpand<Arc>::Expand(MutableFst<Arc> *ofst,\n                                  const typename Arc::Weight &threshold) {\n  ofst_ = ofst;\n  if (error_) {\n    ofst_->SetProperties(kError, kError);\n    return;\n  }\n  ofst_->DeleteStates();\n  ofst_->SetInputSymbols(ifst_->InputSymbols());\n  ofst_->SetOutputSymbols(ifst_->OutputSymbols());\n  limit_ = Times(DistanceToDest(ifst_->Start(), rfst_.Start() - 1), threshold);\n  flags_.clear();\n  ProcStart();\n  while (!queue_.Empty()) {\n    const auto s = queue_.Head();\n    queue_.Dequeue();\n    SetFlags(s, kExpanded, kExpanded | kEnqueued);\n    VLOG(2) << s << \" dequeued!\";\n    ProcFinal(s);\n    StackId stack_id = state_table_.Tuple(s).stack_id;\n    ProcDestStates(s, stack_id);\n    for (ArcIterator<PdtExpandFst<Arc>> aiter(efst_, s); !aiter.Done();\n         aiter.Next()) {\n      const auto &arc = aiter.Value();\n      const auto nextstack_id = state_table_.Tuple(arc.nextstate).stack_id;\n      if (stack_id == nextstack_id) {\n        ProcNonParen(s, arc, true);\n      } else if (stack_id == stack_.Pop(nextstack_id)) {\n        ProcOpenParen(s, arc, stack_id, nextstack_id);\n      } else {\n        ProcCloseParen(s, arc);\n      }\n    }\n    VLOG(2) << \"d[\" << s << \"] = \" << Distance(s) << \", fd[\" << s\n            << \"] = \" << FinalDistance(s);\n  }\n}\n\n// Expand functions.\n\ntemplate <class Arc>\nstruct PdtExpandOptions {\n  using Weight = typename Arc::Weight;\n\n  bool connect;\n  bool keep_parentheses;\n  Weight weight_threshold;\n\n  PdtExpandOptions(bool connect = true, bool keep_parentheses = false,\n                   Weight weight_threshold = Weight::Zero())\n      : connect(connect),\n        keep_parentheses(keep_parentheses),\n        weight_threshold(std::move(weight_threshold)) {}\n};\n\n// Expands a pushdown transducer (PDT) encoded as an FST into an FST. This\n// version writes the expanded PDT to a mutable FST. In the PDT, some\n// transitions are labeled with open or close parentheses. To be interpreted as\n// a PDT, the parens must balance on a path. The open-close parenthesis label\n// pairs are passed using the parens argument. Expansion enforces the\n// parenthesis constraints. The PDT must be expandable as an FST.\ntemplate <class Arc>\nvoid Expand(\n    const Fst<Arc> &ifst,\n    const std::vector<std::pair<typename Arc::Label, typename Arc::Label>>\n        &parens,\n    MutableFst<Arc> *ofst, const PdtExpandOptions<Arc> &opts) {\n  PdtExpandFstOptions<Arc> eopts;\n  eopts.gc_limit = 0;\n  if (opts.weight_threshold == Arc::Weight::Zero()) {\n    eopts.keep_parentheses = opts.keep_parentheses;\n    *ofst = PdtExpandFst<Arc>(ifst, parens, eopts);\n  } else {\n    PdtPrunedExpand<Arc> pruned_expand(ifst, parens, opts.keep_parentheses);\n    pruned_expand.Expand(ofst, opts.weight_threshold);\n  }\n  if (opts.connect) Connect(ofst);\n}\n\n// Expands a pushdown transducer (PDT) encoded as an FST into an FST. This\n// version writes the expanded PDT result to a mutable FST. In the PDT, some\n// transitions are labeled with open or close parentheses. To be interpreted as\n// a PDT, the parens must balance on a path. The open-close parenthesis label\n// pairs are passed using the parents argument. Expansion enforces the\n// parenthesis constraints. The PDT must be expandable as an FST.\ntemplate <class Arc>\nvoid Expand(const Fst<Arc> &ifst,\n    const std::vector<std::pair<typename Arc::Label, typename Arc::Label>>\n    &parens, MutableFst<Arc> *ofst, bool connect = true,\n    bool keep_parentheses = false) {\n  const PdtExpandOptions<Arc> opts(connect, keep_parentheses);\n  Expand(ifst, parens, ofst, opts);\n}\n\n}  // namespace fst\n\n#endif  // FST_EXTENSIONS_PDT_EXPAND_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/extensions/pdt/getters.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#ifndef FST_EXTENSIONS_PDT_GETTERS_H_\n#define FST_EXTENSIONS_PDT_GETTERS_H_\n\n#include <string>\n\n#include <fst/extensions/pdt/compose.h>\n#include <fst/extensions/pdt/replace.h>\n\nnamespace fst {\nnamespace script {\n\nbool GetPdtComposeFilter(const string &str, PdtComposeFilter *cf);\n\nbool GetPdtParserType(const string &str, PdtParserType *pt);\n\n}  // namespace script\n}  // namespace fst\n\n#endif  // FST_EXTENSIONS_PDT_GETTERS_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/extensions/pdt/info.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Prints information about a PDT.\n\n#ifndef FST_EXTENSIONS_PDT_INFO_H_\n#define FST_EXTENSIONS_PDT_INFO_H_\n\n#include <unordered_map>\n#include <unordered_set>\n#include <vector>\n\n#include <fst/extensions/pdt/pdt.h>\n#include <fst/fst.h>\n\nnamespace fst {\n\n// Compute various information about PDTs.\ntemplate <class Arc>\nclass PdtInfo {\n public:\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  PdtInfo(const Fst<Arc> &fst,\n          const std::vector<std::pair<Label, Label>> &parents);\n\n  const string &FstType() const { return fst_type_; }\n\n  const string &ArcType() const { return Arc::Type(); }\n\n  int64_t NumStates() const { return nstates_; }\n\n  int64_t NumArcs() const { return narcs_; }\n\n  int64_t NumOpenParens() const { return nopen_parens_; }\n\n  int64_t NumCloseParens() const { return nclose_parens_; }\n\n  int64_t NumUniqueOpenParens() const { return nuniq_open_parens_; }\n\n  int64_t NumUniqueCloseParens() const { return nuniq_close_parens_; }\n\n  int64_t NumOpenParenStates() const { return nopen_paren_states_; }\n\n  int64_t NumCloseParenStates() const { return nclose_paren_states_; }\n\n private:\n  string fst_type_;\n  int64_t nstates_;\n  int64_t narcs_;\n  int64_t nopen_parens_;\n  int64_t nclose_parens_;\n  int64_t nuniq_open_parens_;\n  int64_t nuniq_close_parens_;\n  int64_t nopen_paren_states_;\n  int64_t nclose_paren_states_;\n};\n\ntemplate <class Arc>\nPdtInfo<Arc>::PdtInfo(\n    const Fst<Arc> &fst,\n    const std::vector<std::pair<typename Arc::Label, typename Arc::Label>>\n        &parens)\n    : fst_type_(fst.Type()),\n      nstates_(0),\n      narcs_(0),\n      nopen_parens_(0),\n      nclose_parens_(0),\n      nuniq_open_parens_(0),\n      nuniq_close_parens_(0),\n      nopen_paren_states_(0),\n      nclose_paren_states_(0) {\n  std::unordered_map<Label, size_t> paren_map;\n  std::unordered_set<Label> paren_set;\n  std::unordered_set<StateId> open_paren_state_set;\n  std::unordered_set<StateId> close_paren_state_set;\n  for (size_t i = 0; i < parens.size(); ++i) {\n    const auto &pair = parens[i];\n    paren_map[pair.first] = i;\n    paren_map[pair.second] = i;\n  }\n  for (StateIterator<Fst<Arc>> siter(fst); !siter.Done(); siter.Next()) {\n    ++nstates_;\n    const auto s = siter.Value();\n    for (ArcIterator<Fst<Arc>> aiter(fst, s); !aiter.Done(); aiter.Next()) {\n      const auto &arc = aiter.Value();\n      ++narcs_;\n      const auto it = paren_map.find(arc.ilabel);\n      if (it != paren_map.end()) {\n        const auto open_paren = parens[it->second].first;\n        const auto close_paren = parens[it->second].second;\n        if (arc.ilabel == open_paren) {\n          ++nopen_parens_;\n          if (!paren_set.count(open_paren)) {\n            ++nuniq_open_parens_;\n            paren_set.insert(open_paren);\n          }\n          if (!open_paren_state_set.count(arc.nextstate)) {\n            ++nopen_paren_states_;\n            open_paren_state_set.insert(arc.nextstate);\n          }\n        } else {\n          ++nclose_parens_;\n          if (!paren_set.count(close_paren)) {\n            ++nuniq_close_parens_;\n            paren_set.insert(close_paren);\n          }\n          if (!close_paren_state_set.count(s)) {\n            ++nclose_paren_states_;\n            close_paren_state_set.insert(s);\n          }\n        }\n      }\n    }\n  }\n}\n\ntemplate <class Arc>\nvoid PrintPdtInfo(const PdtInfo<Arc> &info) {\n  const auto old = std::cout.setf(std::ios::left);\n  std::cout.width(50);\n  std::cout << \"fst type\" << info.FstType() << std::endl;\n  std::cout.width(50);\n  std::cout << \"arc type\" << info.ArcType() << std::endl;\n  std::cout.width(50);\n  std::cout << \"# of states\" << info.NumStates() << std::endl;\n  std::cout.width(50);\n  std::cout << \"# of arcs\" << info.NumArcs() << std::endl;\n  std::cout.width(50);\n  std::cout << \"# of open parentheses\" << info.NumOpenParens() << std::endl;\n  std::cout.width(50);\n  std::cout << \"# of close parentheses\" << info.NumCloseParens() << std::endl;\n  std::cout.width(50);\n  std::cout << \"# of unique open parentheses\" << info.NumUniqueOpenParens()\n            << std::endl;\n  std::cout.width(50);\n  std::cout << \"# of unique close parentheses\" << info.NumUniqueCloseParens()\n            << std::endl;\n  std::cout.width(50);\n  std::cout << \"# of open parenthesis dest. states\" << info.NumOpenParenStates()\n            << std::endl;\n  std::cout.width(50);\n  std::cout << \"# of close parenthesis source states\"\n            << info.NumCloseParenStates() << std::endl;\n  std::cout.setf(old);\n}\n\n}  // namespace fst\n\n#endif  // FST_EXTENSIONS_PDT_INFO_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/extensions/pdt/paren.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Common classes for PDT parentheses.\n\n#ifndef FST_EXTENSIONS_PDT_PAREN_H_\n#define FST_EXTENSIONS_PDT_PAREN_H_\n\n#include <algorithm>\n#include <set>\n#include <unordered_map>\n#include <unordered_set>\n\n#include <fst/log.h>\n\n#include <fst/extensions/pdt/collection.h>\n#include <fst/extensions/pdt/pdt.h>\n#include <fst/dfs-visit.h>\n#include <fst/fst.h>\n\n\nnamespace fst {\nnamespace internal {\n\n// ParenState: Pair of an open (close) parenthesis and its destination (source)\n// state.\n\ntemplate <class Arc>\nstruct ParenState {\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n\n  Label paren_id;    // ID of open (close) paren.\n  StateId state_id;  // Destination (source) state of open (close) paren.\n\n  explicit ParenState(Label paren_id = kNoLabel, StateId state_id = kNoStateId)\n      : paren_id(paren_id), state_id(state_id) {}\n\n  bool operator==(const ParenState<Arc> &other) const {\n    if (&other == this) return true;\n    return other.paren_id == paren_id && other.state_id == state_id;\n  }\n\n  bool operator!=(const ParenState<Arc> &other) const {\n    return !(other == *this);\n  }\n\n  struct Hash {\n    size_t operator()(const ParenState<Arc> &pstate) const {\n      static constexpr auto prime = 7853;\n      return pstate.paren_id + pstate.state_id * prime;\n    }\n  };\n};\n\n// Creates an FST-style const iterator from an STL-style map.\ntemplate <class Map>\nclass MapIterator {\n public:\n  using StlIterator = typename Map::const_iterator;\n  using ValueType = typename Map::mapped_type;\n\n  MapIterator(const Map &map, StlIterator it)\n      : begin_(it), end_(map.end()), it_(it) {}\n\n  bool Done() const { return it_ == end_ || it_->first != begin_->first; }\n\n  ValueType Value() const { return it_->second; }\n\n  void Next() { ++it_; }\n\n  void Reset() { it_ = begin_; }\n\n private:\n  const StlIterator begin_;\n  const StlIterator end_;\n  StlIterator it_;\n};\n\n// PdtParenReachable: Provides various parenthesis reachability information.\n\ntemplate <class Arc>\nclass PdtParenReachable {\n public:\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n\n  using State = ParenState<Arc>;\n  using StateHash = typename State::Hash;\n\n  // Maps from state ID to reachable paren IDs from (to) that state.\n  using ParenMultimap = std::unordered_multimap<StateId, Label>;\n\n  // Maps from paren ID and state ID to reachable state set ID.\n  using StateSetMap = std::unordered_map<State, std::ptrdiff_t, StateHash>;\n\n  // Maps from paren ID and state ID to arcs exiting that state with that\n  // Label.\n  using ParenArcMultimap = std::unordered_map<State, Arc, StateHash>;\n\n  using ParenIterator = MapIterator<ParenMultimap>;\n\n  using ParenArcIterator = MapIterator<ParenArcMultimap>;\n\n  using SetIterator = typename Collection<std::ptrdiff_t, StateId>::SetIterator;\n\n  // Computes close (open) parenthesis reachability information for a PDT with\n  // bounded stack.\n  PdtParenReachable(const Fst<Arc> &fst,\n                    const std::vector<std::pair<Label, Label>> &parens,\n                    bool close)\n      : fst_(fst), parens_(parens), close_(close), error_(false) {\n    paren_map_.reserve(2 * parens.size());\n    for (size_t i = 0; i < parens.size(); ++i) {\n      const auto &pair = parens[i];\n      paren_map_[pair.first] = i;\n      paren_map_[pair.second] = i;\n    }\n    if (close_) {\n      const auto start = fst.Start();\n      if (start == kNoStateId) return;\n      if (!DFSearch(start)) {\n        FSTERROR() << \"PdtReachable: Underlying cyclicity not supported\";\n        error_ = true;\n      }\n    } else {\n      FSTERROR() << \"PdtParenReachable: Open paren info not implemented\";\n      error_ = true;\n    }\n  }\n\n  bool Error() const { return error_; }\n\n  // Given a state ID, returns an iterator over paren IDs for close (open)\n  // parens reachable from that state along balanced paths.\n  ParenIterator FindParens(StateId s) const {\n    return ParenIterator(paren_multimap_, paren_multimap_.find(s));\n  }\n\n  // Given a paren ID and a state ID s, returns an iterator over states that can\n  // be reached along balanced paths from (to) s that have have close (open)\n  // parentheses matching the paren ID exiting (entering) those states.\n  SetIterator FindStates(Label paren_id, StateId s) const {\n    const State paren_state(paren_id, s);\n    const auto it = set_map_.find(paren_state);\n    if (it == set_map_.end()) {\n      return state_sets_.FindSet(-1);\n    } else {\n      return state_sets_.FindSet(it->second);\n    }\n  }\n\n  // Given a paren ID and a state ID s, return an iterator over arcs that exit\n  // (enter) s and are labeled with a close (open) parenthesis matching the\n  // paren ID.\n  ParenArcIterator FindParenArcs(Label paren_id, StateId s) const {\n    const State paren_state(paren_id, s);\n    return ParenArcIterator(paren_arc_multimap_,\n                            paren_arc_multimap_.find(paren_state));\n  }\n\n private:\n  // Returns false when cycle detected during DFS gathering paren and state set\n  // information.\n  bool DFSearch(StateId s);\n\n  // Unions state sets together gathered by the DFS.\n  void ComputeStateSet(StateId s);\n\n  // Gathers state set(s) from state.\n  void UpdateStateSet(StateId nextstate, std::set<Label> *paren_set,\n                      std::vector<std::set<StateId>> *state_sets) const;\n\n  const Fst<Arc> &fst_;\n  // Paren IDs to labels.\n  const std::vector<std::pair<Label, Label>> &parens_;\n  // Close/open paren info?\n  const bool close_;\n  // Labels to paren IDs.\n  std::unordered_map<Label, Label> paren_map_;\n  // Paren reachability.\n  ParenMultimap paren_multimap_;\n  // Paren arcs.\n  ParenArcMultimap paren_arc_multimap_;\n  // DFS states.\n  std::vector<uint8_t> state_color_;\n  // Reachable states to IDs.\n  mutable Collection<std::ptrdiff_t, StateId> state_sets_;\n  // IDs to reachable states.\n  StateSetMap set_map_;\n  bool error_;\n\n  PdtParenReachable(const PdtParenReachable &) = delete;\n  PdtParenReachable &operator=(const PdtParenReachable &) = delete;\n};\n\n// Gathers paren and state set information.\ntemplate <class Arc>\nbool PdtParenReachable<Arc>::DFSearch(StateId s) {\n  static constexpr uint8_t kWhiteState = 0x01;  // Undiscovered.\n  static constexpr uint8_t kGreyState = 0x02;   // Discovered & unfinished.\n  static constexpr uint8_t kBlackState = 0x04;  // Finished.\n  if (s >= state_color_.size()) state_color_.resize(s + 1, kWhiteState);\n  if (state_color_[s] == kBlackState) return true;\n  if (state_color_[s] == kGreyState) return false;\n  state_color_[s] = kGreyState;\n  for (ArcIterator<Fst<Arc>> aiter(fst_, s); !aiter.Done(); aiter.Next()) {\n    const auto &arc = aiter.Value();\n    const auto it = paren_map_.find(arc.ilabel);\n    if (it != paren_map_.end()) {  // Paren?\n      const auto paren_id = it->second;\n      if (arc.ilabel == parens_[paren_id].first) {  // Open paren?\n        if (!DFSearch(arc.nextstate)) return false;\n        for (auto set_iter = FindStates(paren_id, arc.nextstate);\n             !set_iter.Done(); set_iter.Next()) {\n          for (auto paren_arc_iter =\n                   FindParenArcs(paren_id, set_iter.Element());\n               !paren_arc_iter.Done(); paren_arc_iter.Next()) {\n            const auto &cparc = paren_arc_iter.Value();\n            if (!DFSearch(cparc.nextstate)) return false;\n          }\n        }\n      }\n    } else if (!DFSearch(arc.nextstate)) {  // Non-paren.\n      return false;\n    }\n  }\n  ComputeStateSet(s);\n  state_color_[s] = kBlackState;\n  return true;\n}\n\n// Unions state sets.\ntemplate <class Arc>\nvoid PdtParenReachable<Arc>::ComputeStateSet(StateId s) {\n  std::set<Label> paren_set;\n  std::vector<std::set<StateId>> state_sets(parens_.size());\n  for (ArcIterator<Fst<Arc>> aiter(fst_, s); !aiter.Done(); aiter.Next()) {\n    const auto &arc = aiter.Value();\n    const auto it = paren_map_.find(arc.ilabel);\n    if (it != paren_map_.end()) {  // Paren?\n      const auto paren_id = it->second;\n      if (arc.ilabel == parens_[paren_id].first) {  // Open paren?\n        for (auto set_iter = FindStates(paren_id, arc.nextstate);\n             !set_iter.Done(); set_iter.Next()) {\n          for (auto paren_arc_iter =\n                   FindParenArcs(paren_id, set_iter.Element());\n               !paren_arc_iter.Done(); paren_arc_iter.Next()) {\n            const auto &cparc = paren_arc_iter.Value();\n            UpdateStateSet(cparc.nextstate, &paren_set, &state_sets);\n          }\n        }\n      } else {  // Close paren.\n        paren_set.insert(paren_id);\n        state_sets[paren_id].insert(s);\n        const State paren_state(paren_id, s);\n        paren_arc_multimap_.insert(std::make_pair(paren_state, arc));\n      }\n    } else {  // Non-paren.\n      UpdateStateSet(arc.nextstate, &paren_set, &state_sets);\n    }\n  }\n  std::vector<StateId> state_set;\n  for (auto paren_iter = paren_set.begin(); paren_iter != paren_set.end();\n       ++paren_iter) {\n    state_set.clear();\n    const auto paren_id = *paren_iter;\n    paren_multimap_.insert(std::make_pair(s, paren_id));\n    for (auto state_iter = state_sets[paren_id].begin();\n         state_iter != state_sets[paren_id].end(); ++state_iter) {\n      state_set.push_back(*state_iter);\n    }\n    const State paren_state(paren_id, s);\n    set_map_[paren_state] = state_sets_.FindId(state_set);\n  }\n}\n\n// Gathers state sets.\ntemplate <class Arc>\nvoid PdtParenReachable<Arc>::UpdateStateSet(\n    StateId nextstate, std::set<Label> *paren_set,\n    std::vector<std::set<StateId>> *state_sets) const {\n  for (auto paren_iter = FindParens(nextstate); !paren_iter.Done();\n       paren_iter.Next()) {\n    const auto paren_id = paren_iter.Value();\n    paren_set->insert(paren_id);\n    for (auto set_iter = FindStates(paren_id, nextstate); !set_iter.Done();\n         set_iter.Next()) {\n      (*state_sets)[paren_id].insert(set_iter.Element());\n    }\n  }\n}\n\n// Stores balancing parenthesis data for a PDT. Unlike PdtParenReachable above\n// this allows on-the-fly construction (e.g., in PdtShortestPath).\ntemplate <class Arc>\nclass PdtBalanceData {\n public:\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n\n  using State = ParenState<Arc>;\n  using StateHash = typename State::Hash;\n\n  // Set for open parens.\n  using OpenParenSet = std::unordered_set<State, StateHash>;\n\n  // Maps from open paren destination state to parenthesis ID.\n  using OpenParenMap = std::unordered_multimap<StateId, Label>;\n\n  // Maps from open paren state to source states of matching close parens\n  using CloseParenMap = std::unordered_multimap<State, StateId, StateHash>;\n\n  // Maps from open paren state to close source set ID.\n  using CloseSourceMap = std::unordered_map<State, std::ptrdiff_t, StateHash>;\n\n  using SetIterator = typename Collection<std::ptrdiff_t, StateId>::SetIterator;\n\n  PdtBalanceData() {}\n\n  void Clear() {\n    open_paren_map_.clear();\n    close_paren_map_.clear();\n  }\n\n  // Adds an open parenthesis with destination state open_dest.\n  void OpenInsert(Label paren_id, StateId open_dest) {\n    const State key(paren_id, open_dest);\n    if (!open_paren_set_.count(key)) {\n      open_paren_set_.insert(key);\n      open_paren_map_.emplace(open_dest, paren_id);\n    }\n  }\n\n  // Adds a matching closing parenthesis with source state close_source\n  // balancing an open_parenthesis with destination state open_dest if\n  // OpenInsert() previously called.\n  void CloseInsert(Label paren_id, StateId open_dest, StateId close_source) {\n    const State key(paren_id, open_dest);\n    if (open_paren_set_.count(key)) {\n      close_paren_map_.emplace(key, close_source);\n    }\n  }\n\n  // Finds close paren source states matching an open parenthesis. The following\n  // methods are then used to iterate through those matching states. Should be\n  // called only after FinishInsert(open_dest).\n  SetIterator Find(Label paren_id, StateId open_dest) {\n    const State key(paren_id, open_dest);\n    const auto it = close_source_map_.find(key);\n    if (it == close_source_map_.end()) {\n      return close_source_sets_.FindSet(-1);\n    } else {\n      return close_source_sets_.FindSet(it->second);\n    }\n  }\n\n  // Called when all open and close parenthesis insertions (w.r.t. open\n  // parentheses entering state open_dest) are finished. Must be called before\n  // Find(open_dest).\n  void FinishInsert(StateId open_dest) {\n    std::vector<StateId> close_sources;\n    for (auto oit = open_paren_map_.find(open_dest);\n         oit != open_paren_map_.end() && oit->first == open_dest;) {\n      const auto paren_id = oit->second;\n      close_sources.clear();\n      const State key(paren_id, open_dest);\n      open_paren_set_.erase(open_paren_set_.find(key));\n      for (auto cit = close_paren_map_.find(key);\n           cit != close_paren_map_.end() && cit->first == key;) {\n        close_sources.push_back(cit->second);\n        close_paren_map_.erase(cit++);\n      }\n      std::sort(close_sources.begin(), close_sources.end());\n      auto unique_end = std::unique(close_sources.begin(), close_sources.end());\n      close_sources.resize(unique_end - close_sources.begin());\n      if (!close_sources.empty()) {\n        close_source_map_[key] = close_source_sets_.FindId(close_sources);\n      }\n      open_paren_map_.erase(oit++);\n    }\n  }\n\n  // Returns a new balance data object representing the reversed balance\n  // information.\n  PdtBalanceData<Arc> *Reverse(StateId num_states, StateId num_split,\n                               StateId state_id_shift) const;\n\n private:\n  // Open paren at destintation state?\n  OpenParenSet open_paren_set_;\n  // Open parens per state.\n  OpenParenMap open_paren_map_;\n  // Current open destination state.\n  State open_dest_;\n  // Current open paren/state.\n  typename OpenParenMap::const_iterator open_iter_;\n  // Close states to (open paren, state).\n  CloseParenMap close_paren_map_;\n  // (Paren, state) to set ID.\n  CloseSourceMap close_source_map_;\n  mutable Collection<std::ptrdiff_t, StateId> close_source_sets_;\n};\n\n// Return a new balance data object representing the reversed balance\n// information.\ntemplate <class Arc>\nPdtBalanceData<Arc> *PdtBalanceData<Arc>::Reverse(\n    StateId num_states, StateId num_split, StateId state_id_shift) const {\n  auto *bd = new PdtBalanceData<Arc>;\n  std::unordered_set<StateId> close_sources;\n  const auto split_size = num_states / num_split;\n  for (StateId i = 0; i < num_states; i += split_size) {\n    close_sources.clear();\n    for (auto it = close_source_map_.begin(); it != close_source_map_.end();\n         ++it) {\n      const auto &okey = it->first;\n      const auto open_dest = okey.state_id;\n      const auto paren_id = okey.paren_id;\n      for (auto set_iter = close_source_sets_.FindSet(it->second);\n           !set_iter.Done(); set_iter.Next()) {\n        const auto close_source = set_iter.Element();\n        if ((close_source < i) || (close_source >= i + split_size)) continue;\n        close_sources.insert(close_source + state_id_shift);\n        bd->OpenInsert(paren_id, close_source + state_id_shift);\n        bd->CloseInsert(paren_id, close_source + state_id_shift,\n                        open_dest + state_id_shift);\n      }\n    }\n    for (auto it = close_sources.begin(); it != close_sources.end(); ++it) {\n      bd->FinishInsert(*it);\n    }\n  }\n  return bd;\n}\n\n}  // namespace internal\n}  // namespace fst\n\n#endif  // FST_EXTENSIONS_PDT_PAREN_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/extensions/pdt/pdt.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Common classes for PDT expansion/traversal.\n\n#ifndef FST_EXTENSIONS_PDT_PDT_H_\n#define FST_EXTENSIONS_PDT_PDT_H_\n\n#include <map>\n#include <set>\n#include <unordered_map>\n\n#include <fst/compat.h>\n#include <fst/log.h>\n#include <fst/fst.h>\n#include <fst/state-table.h>\n\nnamespace fst {\n\n// Provides bijection between parenthesis stacks and signed integral stack IDs.\n// Each stack ID is unique to each distinct stack. The open-close parenthesis\n// label pairs are passed using the parens argument.\ntemplate <typename StackId, typename Label>\nclass PdtStack {\n public:\n  // The stacks are stored in a tree. The nodes are stored in a vector. Each\n  // node represents the top of some stack and is identified by its position in\n  // the vector. Its' parent node represents the stack with the top popped and\n  // its children are stored in child_map_ and accessed by stack_id and label.\n  // The paren_id is\n  // the position in parens of the parenthesis for that node.\n  struct StackNode {\n    StackId parent_id;\n    size_t paren_id;\n\n    StackNode(StackId p, size_t i) : parent_id(p), paren_id(i) {}\n  };\n\n  explicit PdtStack(const std::vector<std::pair<Label, Label>> &parens)\n      : parens_(parens), min_paren_(kNoLabel), max_paren_(kNoLabel) {\n    for (size_t i = 0; i < parens.size(); ++i) {\n      const auto &pair = parens[i];\n      paren_map_[pair.first] = i;\n      paren_map_[pair.second] = i;\n      if (min_paren_ == kNoLabel || pair.first < min_paren_) {\n        min_paren_ = pair.first;\n      }\n      if (pair.second < min_paren_) min_paren_ = pair.second;\n      if (max_paren_ == kNoLabel || pair.first > max_paren_) {\n        max_paren_ = pair.first;\n      }\n      if (pair.second > max_paren_) max_paren_ = pair.second;\n    }\n    nodes_.push_back(StackNode(-1, -1));  // Tree root.\n  }\n\n  // Returns stack ID given the current stack ID (0 if empty) and label read.\n  // Pushes onto the stack if the label is an open parenthesis, returning the\n  // new stack ID. Pops the stack if the label is a close parenthesis that\n  // matches the top of the stack, returning the parent stack ID. Returns -1 if\n  // label is an unmatched close parenthesis. Otherwise, returns the current\n  // stack ID.\n  StackId Find(StackId stack_id, Label label) {\n    if (min_paren_ == kNoLabel || label < min_paren_ || label > max_paren_) {\n      return stack_id;  // Non-paren.\n    }\n    const auto it = paren_map_.find(label);\n    // Non-paren.\n    if (it == paren_map_.end()) return stack_id;\n    const auto paren_id = it->second;\n    // Open paren.\n    if (label == parens_[paren_id].first) {\n      auto &child_id = child_map_[std::make_pair(stack_id, label)];\n      if (child_id == 0) {  // Child not found; pushes label.\n        child_id = nodes_.size();\n        nodes_.push_back(StackNode(stack_id, paren_id));\n      }\n      return child_id;\n    }\n    const auto &node = nodes_[stack_id];\n    // Matching close paren.\n    if (paren_id == node.paren_id) return node.parent_id;\n    // Non-matching close paren.\n    return -1;\n  }\n\n  // Returns the stack ID obtained by popping the label at the top of the\n  // current stack ID.\n  StackId Pop(StackId stack_id) const { return nodes_[stack_id].parent_id; }\n\n  // Returns the paren ID at the top of the stack.\n  std::ptrdiff_t Top(StackId stack_id) const { return nodes_[stack_id].paren_id; }\n\n  std::ptrdiff_t ParenId(Label label) const {\n    const auto it = paren_map_.find(label);\n    if (it == paren_map_.end()) return -1;  // Non-paren.\n    return it->second;\n  }\n\n private:\n  struct ChildHash {\n    size_t operator()(const std::pair<StackId, Label> &pair) const {\n      static constexpr size_t prime = 7853;\n      return static_cast<size_t>(pair.first) +\n             static_cast<size_t>(pair.second) * prime;\n    }\n  };\n\n  std::vector<std::pair<Label, Label>> parens_;\n  std::vector<StackNode> nodes_;\n  std::unordered_map<Label, size_t> paren_map_;\n  // Child of stack node w.r.t label\n  std::unordered_map<std::pair<StackId, Label>, StackId, ChildHash> child_map_;\n  Label min_paren_;\n  Label max_paren_;\n};\n\n// State tuple for PDT expansion.\ntemplate <typename S, typename K>\nstruct PdtStateTuple {\n  using StateId = S;\n  using StackId = K;\n\n  StateId state_id;\n  StackId stack_id;\n\n  PdtStateTuple(StateId state_id = kNoStateId, StackId stack_id = -1)\n      : state_id(state_id), stack_id(stack_id) {}\n};\n\n// Equality of PDT state tuples.\ntemplate <typename S, typename K>\ninline bool operator==(const PdtStateTuple<S, K> &x,\n                       const PdtStateTuple<S, K> &y) {\n  if (&x == &y) return true;\n  return x.state_id == y.state_id && x.stack_id == y.stack_id;\n}\n\n// Hash function object for PDT state tuples\ntemplate <class T>\nclass PdtStateHash {\n public:\n  size_t operator()(const T &tuple) const {\n    static constexpr auto prime = 7853;\n    return tuple.state_id + tuple.stack_id * prime;\n  }\n};\n\n// Tuple to PDT state bijection.\ntemplate <class StateId, class StackId>\nclass PdtStateTable : public CompactHashStateTable<\n                          PdtStateTuple<StateId, StackId>,\n                          PdtStateHash<PdtStateTuple<StateId, StackId>>> {\n public:\n  PdtStateTable() {}\n\n  PdtStateTable(const PdtStateTable &other) {}\n\n private:\n  PdtStateTable &operator=(const PdtStateTable &) = delete;\n};\n\n}  // namespace fst\n\n#endif  // FST_EXTENSIONS_PDT_PDT_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/extensions/pdt/pdtlib.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// This is an experimental push-down transducer (PDT) library. A PDT is\n// encoded as an FST, where some transitions are labeled with open or close\n// parentheses. To be interpreted as a PDT, the parentheses must balance on a\n// path.\n\n#ifndef FST_EXTENSIONS_PDT_PDTLIB_H_\n#define FST_EXTENSIONS_PDT_PDTLIB_H_\n\n#include <fst/extensions/pdt/compose.h>\n#include <fst/extensions/pdt/expand.h>\n#include <fst/extensions/pdt/pdt.h>\n#include <fst/extensions/pdt/replace.h>\n#include <fst/extensions/pdt/reverse.h>\n#include <fst/extensions/pdt/shortest-path.h>\n\n#endif  // FST_EXTENSIONS_PDT_PDTLIB_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/extensions/pdt/pdtscript.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Convenience file for including all PDT operations at once, and/or\n// registering them for new arc types.\n\n#ifndef FST_EXTENSIONS_PDT_PDTSCRIPT_H_\n#define FST_EXTENSIONS_PDT_PDTSCRIPT_H_\n\n#include <algorithm>\n#include <utility>\n#include <vector>\n\n#include <fst/log.h>\n#include <fst/compose.h>  // for ComposeOptions\n#include <fst/util.h>\n\n#include <fst/script/arg-packs.h>\n#include <fst/script/fstscript.h>\n#include <fst/script/shortest-path.h>\n\n#include <fst/extensions/pdt/compose.h>\n#include <fst/extensions/pdt/expand.h>\n#include <fst/extensions/pdt/info.h>\n#include <fst/extensions/pdt/replace.h>\n#include <fst/extensions/pdt/reverse.h>\n#include <fst/extensions/pdt/shortest-path.h>\n\nnamespace fst {\nnamespace script {\n\nusing PdtComposeArgs =\n    std::tuple<const FstClass &, const FstClass &,\n               const std::vector<LabelPair> &, MutableFstClass *,\n               const PdtComposeOptions &, bool>;\n\ntemplate <class Arc>\nvoid PdtCompose(PdtComposeArgs *args) {\n  const Fst<Arc> &ifst1 = *(std::get<0>(*args).GetFst<Arc>());\n  const Fst<Arc> &ifst2 = *(std::get<1>(*args).GetFst<Arc>());\n  MutableFst<Arc> *ofst = std::get<3>(*args)->GetMutableFst<Arc>();\n  // In case Arc::Label is not the same as FstClass::Label, we make a\n  // copy. Truncation may occur if FstClass::Label has more precision than\n  // Arc::Label.\n  std::vector<std::pair<typename Arc::Label, typename Arc::Label>> typed_parens(\n      std::get<2>(*args).size());\n  std::copy(std::get<2>(*args).begin(), std::get<2>(*args).end(),\n            typed_parens.begin());\n  if (std::get<5>(*args)) {\n    Compose(ifst1, typed_parens, ifst2, ofst, std::get<4>(*args));\n  } else {\n    Compose(ifst1, ifst2, typed_parens, ofst, std::get<4>(*args));\n  }\n}\n\nvoid PdtCompose(const FstClass &ifst1, const FstClass &ifst2,\n                const std::vector<LabelPair> &parens,\n                MutableFstClass *ofst, const PdtComposeOptions &opts,\n                bool left_pdt);\n\nstruct PdtExpandOptions {\n  bool connect;\n  bool keep_parentheses;\n  const WeightClass &weight_threshold;\n\n  PdtExpandOptions(bool c, bool k, const WeightClass &w)\n      : connect(c), keep_parentheses(k), weight_threshold(w) {}\n};\n\nusing PdtExpandArgs =\n    std::tuple<const FstClass &, const std::vector<LabelPair> &,\n               MutableFstClass *, const PdtExpandOptions &>;\n\ntemplate <class Arc>\nvoid PdtExpand(PdtExpandArgs *args) {\n  const Fst<Arc> &fst = *(std::get<0>(*args).GetFst<Arc>());\n  MutableFst<Arc> *ofst = std::get<2>(*args)->GetMutableFst<Arc>();\n  // In case Arc::Label is not the same as FstClass::Label, we make a\n  // copy. Truncation may occur if FstClass::Label has more precision than\n  // Arc::Label.\n  std::vector<std::pair<typename Arc::Label, typename Arc::Label>> typed_parens(\n      std::get<1>(*args).size());\n  std::copy(std::get<1>(*args).begin(), std::get<1>(*args).end(),\n            typed_parens.begin());\n  Expand(fst, typed_parens, ofst,\n         fst::PdtExpandOptions<Arc>(\n             std::get<3>(*args).connect, std::get<3>(*args).keep_parentheses,\n             *(std::get<3>(*args)\n                   .weight_threshold.GetWeight<typename Arc::Weight>())));\n}\n\nvoid PdtExpand(const FstClass &ifst, const std::vector<LabelPair> &parens,\n               MutableFstClass *ofst, const PdtExpandOptions &opts);\n\nvoid PdtExpand(const FstClass &ifst, const std::vector<LabelPair> &parens,\n               MutableFstClass *ofst, bool connect, bool keep_parentheses,\n               const WeightClass &weight_threshold);\n\nusing PdtReplaceArgs =\n    std::tuple<const std::vector<LabelFstClassPair> &, MutableFstClass *,\n               std::vector<LabelPair> *, int64_t, PdtParserType, int64_t,\n               const string &, const string &>;\n\ntemplate <class Arc>\nvoid PdtReplace(PdtReplaceArgs *args) {\n  const auto &untyped_pairs = std::get<0>(*args);\n  auto size = untyped_pairs.size();\n  std::vector<std::pair<typename Arc::Label, const Fst<Arc> *>> typed_pairs(\n      size);\n  for (size_t i = 0; i < size; ++i) {\n    typed_pairs[i].first = untyped_pairs[i].first;\n    typed_pairs[i].second = untyped_pairs[i].second->GetFst<Arc>();\n  }\n  MutableFst<Arc> *ofst = std::get<1>(*args)->GetMutableFst<Arc>();\n  std::vector<std::pair<typename Arc::Label, typename Arc::Label>> typed_parens;\n  const PdtReplaceOptions<Arc> opts(std::get<3>(*args), std::get<4>(*args),\n                                    std::get<5>(*args), std::get<6>(*args),\n                                    std::get<7>(*args));\n  Replace(typed_pairs, ofst, &typed_parens, opts);\n  // Copies typed parens into arg3.\n  std::get<2>(*args)->resize(typed_parens.size());\n  std::copy(typed_parens.begin(), typed_parens.end(),\n            std::get<2>(*args)->begin());\n}\n\nvoid PdtReplace(const std::vector<LabelFstClassPair> &pairs,\n                MutableFstClass *ofst, std::vector<LabelPair> *parens,\n                int64_t root, PdtParserType parser_type = PDT_LEFT_PARSER,\n                int64_t start_paren_labels = kNoLabel,\n                const string &left_paren_prefix = \"(_\",\n                const string &right_paren_prefix = \"_)\");\n\nusing PdtReverseArgs =\n    std::tuple<const FstClass &, const std::vector<LabelPair> &,\n               MutableFstClass *>;\n\ntemplate <class Arc>\nvoid PdtReverse(PdtReverseArgs *args) {\n  const Fst<Arc> &fst = *(std::get<0>(*args).GetFst<Arc>());\n  MutableFst<Arc> *ofst = std::get<2>(*args)->GetMutableFst<Arc>();\n  // In case Arc::Label is not the same as FstClass::Label, we make a\n  // copy. Truncation may occur if FstClass::Label has more precision than\n  // Arc::Label.\n  std::vector<std::pair<typename Arc::Label, typename Arc::Label>> typed_parens(\n      std::get<1>(*args).size());\n  std::copy(std::get<1>(*args).begin(), std::get<1>(*args).end(),\n            typed_parens.begin());\n  Reverse(fst, typed_parens, ofst);\n}\n\nvoid PdtReverse(const FstClass &ifst, const std::vector<LabelPair> &,\n                MutableFstClass *ofst);\n\n// PDT SHORTESTPATH\n\nstruct PdtShortestPathOptions {\n  QueueType queue_type;\n  bool keep_parentheses;\n  bool path_gc;\n\n  PdtShortestPathOptions(QueueType qt = FIFO_QUEUE, bool kp = false,\n                         bool gc = true)\n      : queue_type(qt), keep_parentheses(kp), path_gc(gc) {}\n};\n\nusing PdtShortestPathArgs =\n    std::tuple<const FstClass &, const std::vector<LabelPair> &,\n               MutableFstClass *, const PdtShortestPathOptions &>;\n\ntemplate <class Arc>\nvoid PdtShortestPath(PdtShortestPathArgs *args) {\n  const Fst<Arc> &fst = *(std::get<0>(*args).GetFst<Arc>());\n  MutableFst<Arc> *ofst = std::get<2>(*args)->GetMutableFst<Arc>();\n  const PdtShortestPathOptions &opts = std::get<3>(*args);\n  // In case Arc::Label is not the same as FstClass::Label, we make a\n  // copy. Truncation may occur if FstClass::Label has more precision than\n  // Arc::Label.\n  std::vector<std::pair<typename Arc::Label, typename Arc::Label>> typed_parens(\n      std::get<1>(*args).size());\n  std::copy(std::get<1>(*args).begin(), std::get<1>(*args).end(),\n            typed_parens.begin());\n  switch (opts.queue_type) {\n    default:\n      FSTERROR() << \"Unknown queue type: \" << opts.queue_type;\n    case FIFO_QUEUE: {\n      using Queue = FifoQueue<typename Arc::StateId>;\n      fst::PdtShortestPathOptions<Arc, Queue> spopts(opts.keep_parentheses,\n                                                         opts.path_gc);\n      ShortestPath(fst, typed_parens, ofst, spopts);\n      return;\n    }\n    case LIFO_QUEUE: {\n      using Queue = LifoQueue<typename Arc::StateId>;\n      fst::PdtShortestPathOptions<Arc, Queue> spopts(opts.keep_parentheses,\n                                                         opts.path_gc);\n      ShortestPath(fst, typed_parens, ofst, spopts);\n      return;\n    }\n    case STATE_ORDER_QUEUE: {\n      using Queue = StateOrderQueue<typename Arc::StateId>;\n      fst::PdtShortestPathOptions<Arc, Queue> spopts(opts.keep_parentheses,\n                                                         opts.path_gc);\n      ShortestPath(fst, typed_parens, ofst, spopts);\n      return;\n    }\n  }\n}\n\nvoid PdtShortestPath(const FstClass &ifst,\n    const std::vector<LabelPair> &parens, MutableFstClass *ofst,\n    const PdtShortestPathOptions &opts = PdtShortestPathOptions());\n\n// PRINT INFO\n\nusing PrintPdtInfoArgs =\n    std::pair<const FstClass &, const std::vector<LabelPair> &>;\n\ntemplate <class Arc>\nvoid PrintPdtInfo(PrintPdtInfoArgs *args) {\n  const Fst<Arc> &fst = *(std::get<0>(*args).GetFst<Arc>());\n  // In case Arc::Label is not the same as FstClass::Label, we make a\n  // copy. Truncation may occur if FstClass::Label has more precision than\n  // Arc::Label.\n  std::vector<std::pair<typename Arc::Label, typename Arc::Label>> typed_parens(\n      std::get<1>(*args).size());\n  std::copy(std::get<1>(*args).begin(), std::get<1>(*args).end(),\n            typed_parens.begin());\n  PdtInfo<Arc> pdtinfo(fst, typed_parens);\n  PrintPdtInfo(pdtinfo);\n}\n\nvoid PrintPdtInfo(const FstClass &ifst, const std::vector<LabelPair> &parens);\n\n}  // namespace script\n}  // namespace fst\n\n#define REGISTER_FST_PDT_OPERATIONS(ArcType)                             \\\n  REGISTER_FST_OPERATION(PdtCompose, ArcType, PdtComposeArgs);           \\\n  REGISTER_FST_OPERATION(PdtExpand, ArcType, PdtExpandArgs);             \\\n  REGISTER_FST_OPERATION(PdtReplace, ArcType, PdtReplaceArgs);           \\\n  REGISTER_FST_OPERATION(PdtReverse, ArcType, PdtReverseArgs);           \\\n  REGISTER_FST_OPERATION(PdtShortestPath, ArcType, PdtShortestPathArgs); \\\n  REGISTER_FST_OPERATION(PrintPdtInfo, ArcType, PrintPdtInfoArgs)\n#endif  // FST_EXTENSIONS_PDT_PDTSCRIPT_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/extensions/pdt/replace.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Recursively replaces FST arcs with other FSTs, returning a PDT.\n\n#ifndef FST_EXTENSIONS_PDT_REPLACE_H_\n#define FST_EXTENSIONS_PDT_REPLACE_H_\n\n#include <map>\n#include <memory>\n#include <set>\n#include <unordered_map>\n#include <utility>\n#include <vector>\n\n#include <fst/replace.h>\n#include <fst/replace-util.h>\n#include <fst/symbol-table-ops.h>\n\nnamespace fst {\nnamespace internal {\n\n// Hash to paren IDs\ntemplate <typename S>\nstruct ReplaceParenHash {\n  size_t operator()(const std::pair<size_t, S> &paren) const {\n    static constexpr auto prime = 7853;\n    return paren.first + paren.second * prime;\n  }\n};\n\n}  // namespace internal\n\n// Parser types characterize the PDT construction method. When applied to a CFG,\n// each non-terminal is encoded as a DFA that accepts precisely the RHS's of\n// productions of that non-terminal. For parsing (rather than just recognition),\n// production numbers can used as outputs (placed as early as possible) in the\n// DFAs promoted to DFTs. For more information on the strongly regular\n// construction, see:\n//\n// Mohri, M., and Pereira, F. 1998. Dynamic compilation of weighted context-free\n// grammars. In Proc. ACL, pages 891-897.\nenum PdtParserType {\n  // Top-down construction. Applied to a simple LL(1) grammar (among others),\n  // gives a DPDA. If promoted to a DPDT, with outputs being production\n  // numbers, gives a leftmost derivation. Left recursive grammars are\n  // problematic in use.\n  PDT_LEFT_PARSER,\n\n  // Top-down construction. Similar to PDT_LEFT_PARSE except bounded-stack\n  // (expandable as an FST) result with regular or, more generally, strongly\n  // regular grammars. Epsilons may replace some parentheses, which may\n  // introduce some non-determinism.\n  PDT_LEFT_SR_PARSER,\n\n  /* TODO(riley):\n  // Bottom-up construction. Applied to a LR(0) grammar, gives a DPDA.\n  // If promoted to a DPDT, with outputs being the production nubmers,\n  // gives the reverse of a rightmost derivation.\n  PDT_RIGHT_PARSER,\n  */\n};\n\ntemplate <class Arc>\nstruct PdtReplaceOptions {\n  using Label = typename Arc::Label;\n\n  explicit PdtReplaceOptions(Label root,\n                             PdtParserType type = PDT_LEFT_PARSER,\n                             Label start_paren_labels = kNoLabel,\n                             string left_paren_prefix = \"(_\",\n                             string right_paren_prefix = \")_\") :\n      root(root), type(type), start_paren_labels(start_paren_labels),\n      left_paren_prefix(std::move(left_paren_prefix)),\n      right_paren_prefix(std::move(right_paren_prefix)) {}\n\n  Label root;\n  PdtParserType type;\n  Label start_paren_labels;\n  const string left_paren_prefix;\n  const string right_paren_prefix;\n};\n\n// PdtParser: Base PDT parser class common to specific parsers.\n\ntemplate <class Arc>\nclass PdtParser {\n public:\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n  using LabelFstPair = std::pair<Label, const Fst<Arc> *>;\n  using LabelPair = std::pair<Label, Label>;\n  using LabelStatePair = std::pair<Label, StateId>;\n  using StateWeightPair = std::pair<StateId, Weight>;\n  using ParenKey = std::pair<size_t, StateId>;\n  using ParenMap =\n      std::unordered_map<ParenKey, size_t, internal::ReplaceParenHash<StateId>>;\n\n  PdtParser(const std::vector<LabelFstPair> &fst_array,\n            const PdtReplaceOptions<Arc> &opts) :\n      root_(opts.root), start_paren_labels_(opts.start_paren_labels),\n      left_paren_prefix_(std::move(opts.left_paren_prefix)),\n      right_paren_prefix_(std::move(opts.right_paren_prefix)),\n      error_(false) {\n    for (size_t i = 0; i < fst_array.size(); ++i) {\n      if (!CompatSymbols(fst_array[0].second->InputSymbols(),\n                         fst_array[i].second->InputSymbols())) {\n        FSTERROR() << \"PdtParser: Input symbol table of input FST \" << i\n                   << \" does not match input symbol table of 0th input FST\";\n        error_ = true;\n      }\n      if (!CompatSymbols(fst_array[0].second->OutputSymbols(),\n                         fst_array[i].second->OutputSymbols())) {\n        FSTERROR() << \"PdtParser: Output symbol table of input FST \" << i\n                   << \" does not match input symbol table of 0th input FST\";\n        error_ = true;\n      }\n      fst_array_.emplace_back(fst_array[i].first, fst_array[i].second->Copy());\n      // Builds map from non-terminal label to FST ID.\n      label2id_[fst_array[i].first] = i;\n    }\n  }\n\n  virtual ~PdtParser() {\n    for (auto &pair : fst_array_) delete pair.second;\n  }\n\n  // Constructs the output PDT, dependent on the derived parser type.\n  virtual void GetParser(MutableFst<Arc> *ofst,\n                         std::vector<LabelPair> *parens) = 0;\n\n protected:\n  const std::vector<LabelFstPair> &FstArray() const { return fst_array_; }\n\n  Label Root() const { return root_; }\n\n  // Maps from non-terminal label to corresponding FST ID, or returns\n  // kNoStateId to signal lookup failure.\n  StateId Label2Id(Label l) const {\n    auto it = label2id_.find(l);\n    return it == label2id_.end() ? kNoStateId : it->second;\n  }\n\n  // Maps from output state to input FST label, state pair, or returns a\n  // (kNoLabel, kNoStateId) pair to signal lookup failure.\n  LabelStatePair GetLabelStatePair(StateId os) const {\n    if (os >= label_state_pairs_.size()) {\n      static const LabelStatePair no_pair(kNoLabel, kNoLabel);\n      return no_pair;\n    } else {\n      return label_state_pairs_[os];\n    }\n  }\n\n  // Maps to output state from input FST (label, state) pair, or returns\n  // kNoStateId to signal lookup failure.\n  StateId GetState(const LabelStatePair &lsp) const {\n    auto it = state_map_.find(lsp);\n    if (it == state_map_.end()) {\n      return kNoStateId;\n    } else {\n      return it->second;\n    }\n  }\n\n  // Builds single FST combining all referenced input FSTs, leaving in the\n  // non-termnals for now; also tabulates the PDT states that correspond to the\n  // start and final states of the input FSTs.\n  void CreateFst(MutableFst<Arc> *ofst, std::vector<StateId> *open_dest,\n                 std::vector<std::vector<StateWeightPair>> *close_src);\n\n  // Assigns parenthesis labels from total allocated paren IDs.\n  void AssignParenLabels(size_t total_nparens, std::vector<LabelPair> *parens) {\n    parens->clear();\n    for (size_t paren_id = 0; paren_id < total_nparens; ++paren_id) {\n      const auto open_paren = start_paren_labels_ + paren_id;\n      const auto close_paren = open_paren + total_nparens;\n      parens->emplace_back(open_paren, close_paren);\n    }\n  }\n\n  // Determines how non-terminal instances are assigned parentheses IDs.\n  virtual size_t AssignParenIds(const Fst<Arc> &ofst,\n                                ParenMap *paren_map) const = 0;\n\n  // Changes a non-terminal transition to an open parenthesis transition\n  // redirected to the PDT state specified in the open_dest argument, when\n  // indexed by the input FST ID for the non-terminal. Adds close parenthesis\n  // transitions (with specified weights) from the PDT states specified in the\n  // close_src argument, when indexed by the input FST ID for the non-terminal,\n  // to the former destination state of the non-terminal transition. The\n  // paren_map argument gives the parenthesis ID for a given non-terminal FST ID\n  // and destination state pair. The close_non_term_weight vector specifies\n  // non-terminals for which the non-terminal arc weight should be applied on\n  // the close parenthesis (multiplying the close_src weight above) rather than\n  // on the open parenthesis. If no paren ID is found, then an epsilon replaces\n  // the parenthesis that would carry the non-terminal arc weight and the other\n  // parenthesis is omitted (appropriate for the strongly-regular case).\n  void AddParensToFst(\n      const std::vector<LabelPair> &parens,\n      const ParenMap &paren_map,\n      const std::vector<StateId> &open_dest,\n      const std::vector<std::vector<StateWeightPair>> &close_src,\n      const std::vector<bool> &close_non_term_weight,\n      MutableFst<Arc> *ofst);\n\n  // Ensures that parentheses arcs are added to the symbol table.\n  void AddParensToSymbolTables(const std::vector<LabelPair> &parens,\n                               MutableFst<Arc> *ofst);\n\n private:\n  std::vector<LabelFstPair> fst_array_;\n  Label root_;\n  // Index to use for the first parenthesis.\n  Label start_paren_labels_;\n  const string left_paren_prefix_;\n  const string right_paren_prefix_;\n  // Maps from non-terminal label to FST ID.\n  std::unordered_map<Label, StateId> label2id_;\n  // Given an output state, specifies the input FST (label, state) pair.\n  std::vector<LabelStatePair> label_state_pairs_;\n  // Given an FST (label, state) pair, specifies the output FST state ID.\n  std::map<LabelStatePair, StateId> state_map_;\n  bool error_;\n};\n\ntemplate <class Arc>\nvoid PdtParser<Arc>::CreateFst(\n    MutableFst<Arc> *ofst, std::vector<StateId> *open_dest,\n    std::vector<std::vector<StateWeightPair>> *close_src) {\n  ofst->DeleteStates();\n  if (error_) {\n    ofst->SetProperties(kError, kError);\n    return;\n  }\n  open_dest->resize(fst_array_.size(), kNoStateId);\n  close_src->resize(fst_array_.size());\n  // Queue of non-terminals to replace.\n  std::deque<Label> non_term_queue;\n  non_term_queue.push_back(root_);\n  // Has a non-terminal been enqueued?\n  std::vector<bool> enqueued(fst_array_.size(), false);\n  enqueued[label2id_[root_]] = true;\n  Label max_label = kNoLabel;\n  for (StateId soff = 0; !non_term_queue.empty(); soff = ofst->NumStates()) {\n    const auto label = non_term_queue.front();\n    non_term_queue.pop_front();\n    StateId fst_id = Label2Id(label);\n    const auto *ifst = fst_array_[fst_id].second;\n    for (StateIterator<Fst<Arc>> siter(*ifst); !siter.Done(); siter.Next()) {\n      const auto is = siter.Value();\n      const auto os = ofst->AddState();\n      const LabelStatePair lsp(label, is);\n      label_state_pairs_.push_back(lsp);\n      state_map_[lsp] = os;\n      if (is == ifst->Start()) {\n        (*open_dest)[fst_id] = os;\n        if (label == root_) ofst->SetStart(os);\n      }\n      if (ifst->Final(is) != Weight::Zero()) {\n        if (label == root_) ofst->SetFinal(os, ifst->Final(is));\n        (*close_src)[fst_id].emplace_back(os, ifst->Final(is));\n      }\n      for (ArcIterator<Fst<Arc>> aiter(*ifst, is); !aiter.Done();\n           aiter.Next()) {\n        auto arc = aiter.Value();\n        arc.nextstate += soff;\n        if (max_label == kNoLabel || arc.olabel > max_label)\n          max_label = arc.olabel;\n        const auto nfst_id = Label2Id(arc.olabel);\n        if (nfst_id != kNoStateId) {\n          if (fst_array_[nfst_id].second->Start() == kNoStateId) continue;\n          if (!enqueued[nfst_id]) {\n            non_term_queue.push_back(arc.olabel);\n            enqueued[nfst_id] = true;\n          }\n        }\n        ofst->AddArc(os, arc);\n      }\n    }\n  }\n  if (start_paren_labels_ == kNoLabel)\n    start_paren_labels_ = max_label + 1;\n}\n\ntemplate <class Arc>\nvoid PdtParser<Arc>::AddParensToFst(\n    const std::vector<LabelPair> &parens,\n    const ParenMap &paren_map,\n    const std::vector<StateId> &open_dest,\n    const std::vector<std::vector<StateWeightPair>> &close_src,\n    const std::vector<bool> &close_non_term_weight,\n    MutableFst<Arc> *ofst) {\n  StateId dead_state = kNoStateId;\n  using MIter = MutableArcIterator<MutableFst<Arc>>;\n  for (StateIterator<Fst<Arc>> siter(*ofst); !siter.Done(); siter.Next()) {\n    StateId os = siter.Value();\n    std::unique_ptr<MIter> aiter(new MIter(ofst, os));\n    for (auto n = 0; !aiter->Done(); aiter->Next(), ++n) {\n      const auto arc = aiter->Value();  // A reference here may go stale.\n      StateId nfst_id = Label2Id(arc.olabel);\n      if (nfst_id != kNoStateId) {\n        // Gets parentheses.\n        const ParenKey paren_key(nfst_id, arc.nextstate);\n        auto it = paren_map.find(paren_key);\n        Label open_paren = 0;\n        Label close_paren = 0;\n        if (it != paren_map.end()) {\n          const auto paren_id = it->second;\n          open_paren = parens[paren_id].first;\n          close_paren = parens[paren_id].second;\n        }\n        // Sets open parenthesis.\n        if (open_paren != 0 || !close_non_term_weight[nfst_id]) {\n          const auto open_weight =\n              close_non_term_weight[nfst_id] ? Weight::One() : arc.weight;\n          const Arc sarc(open_paren, open_paren, open_weight,\n                         open_dest[nfst_id]);\n          aiter->SetValue(sarc);\n        } else {\n          if (dead_state == kNoStateId) {\n            dead_state = ofst->AddState();\n          }\n          const Arc sarc(0, 0, Weight::One(), dead_state);\n          aiter->SetValue(sarc);\n        }\n        // Adds close parentheses.\n        if (close_paren != 0 || close_non_term_weight[nfst_id]) {\n          for (size_t i = 0; i < close_src[nfst_id].size(); ++i) {\n            const auto &pair = close_src[nfst_id][i];\n            const auto close_weight = close_non_term_weight[nfst_id]\n                                          ? Times(arc.weight, pair.second)\n                                          : pair.second;\n            const Arc farc(close_paren, close_paren, close_weight,\n                           arc.nextstate);\n\n            ofst->AddArc(pair.first, farc);\n            if (os == pair.first) {  // Invalidated iterator.\n              aiter.reset(new MIter(ofst, os));\n              aiter->Seek(n);\n            }\n          }\n        }\n      }\n    }\n  }\n}\n\ntemplate <class Arc>\nvoid PdtParser<Arc>::AddParensToSymbolTables(\n    const std::vector<LabelPair> &parens, MutableFst<Arc> *ofst) {\n  auto size = parens.size();\n  if (ofst->InputSymbols()) {\n    if (!AddAuxiliarySymbols(left_paren_prefix_, start_paren_labels_, size,\n                             ofst->MutableInputSymbols())) {\n      ofst->SetProperties(kError, kError);\n      return;\n    }\n    if (!AddAuxiliarySymbols(right_paren_prefix_, start_paren_labels_ + size,\n                             size, ofst->MutableInputSymbols())) {\n      ofst->SetProperties(kError, kError);\n      return;\n    }\n  }\n  if (ofst->OutputSymbols()) {\n    if (!AddAuxiliarySymbols(left_paren_prefix_, start_paren_labels_, size,\n                             ofst->MutableOutputSymbols())) {\n      ofst->SetProperties(kError, kError);\n      return;\n    }\n    if (!AddAuxiliarySymbols(right_paren_prefix_, start_paren_labels_ + size,\n                             size, ofst->MutableOutputSymbols())) {\n      ofst->SetProperties(kError, kError);\n      return;\n    }\n  }\n}\n\n// Builds a PDT by recursive replacement top-down, where the call and return are\n// encoded in the parentheses.\ntemplate <class Arc>\nclass PdtLeftParser final : public PdtParser<Arc> {\n public:\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n  using LabelFstPair = typename PdtParser<Arc>::LabelFstPair;\n  using LabelPair = typename PdtParser<Arc>::LabelPair;\n  using LabelStatePair = typename PdtParser<Arc>::LabelStatePair;\n  using StateWeightPair = typename PdtParser<Arc>::StateWeightPair;\n  using ParenKey = typename PdtParser<Arc>::ParenKey;\n  using ParenMap = typename PdtParser<Arc>::ParenMap;\n\n  using PdtParser<Arc>::AddParensToFst;\n  using PdtParser<Arc>::AddParensToSymbolTables;\n  using PdtParser<Arc>::AssignParenLabels;\n  using PdtParser<Arc>::CreateFst;\n  using PdtParser<Arc>::FstArray;\n  using PdtParser<Arc>::GetLabelStatePair;\n  using PdtParser<Arc>::GetState;\n  using PdtParser<Arc>::Label2Id;\n  using PdtParser<Arc>::Root;\n\n  PdtLeftParser(const std::vector<LabelFstPair> &fst_array,\n                const PdtReplaceOptions<Arc> &opts) :\n      PdtParser<Arc>(fst_array, opts) { }\n\n  void GetParser(MutableFst<Arc> *ofst,\n                 std::vector<LabelPair> *parens) override;\n\n protected:\n  // Assigns a unique parenthesis ID for each non-terminal, destination\n  // state pair.\n  size_t AssignParenIds(const Fst<Arc> &ofst,\n                        ParenMap *paren_map) const override;\n};\n\ntemplate <class Arc>\nvoid PdtLeftParser<Arc>::GetParser(\n    MutableFst<Arc> *ofst,\n    std::vector<LabelPair> *parens) {\n  ofst->DeleteStates();\n  parens->clear();\n  const auto &fst_array = FstArray();\n  // Map that gives the paren ID for a (non-terminal, dest. state) pair\n  // (which can be unique).\n  ParenMap paren_map;\n  // Specifies the open parenthesis destination state for a given non-terminal.\n  // The source is the non-terminal instance source state.\n  std::vector<StateId> open_dest(fst_array.size(), kNoStateId);\n  // Specifies close parenthesis source states and weights for a given\n  // non-terminal. The destination is the non-terminal instance destination\n  // state.\n  std::vector<std::vector<StateWeightPair>> close_src(fst_array.size());\n  // Specifies non-terminals for which the non-terminal arc weight\n  // should be applied on the close parenthesis (multiplying the\n  // 'close_src' weight above) rather than on the open parenthesis.\n  std::vector<bool> close_non_term_weight(fst_array.size(), false);\n  CreateFst(ofst, &open_dest, &close_src);\n  auto total_nparens = AssignParenIds(*ofst, &paren_map);\n  AssignParenLabels(total_nparens, parens);\n  AddParensToFst(*parens, paren_map, open_dest, close_src,\n                 close_non_term_weight, ofst);\n  if (!fst_array.empty()) {\n    ofst->SetInputSymbols(fst_array[0].second->InputSymbols());\n    ofst->SetOutputSymbols(fst_array[0].second->OutputSymbols());\n  }\n  AddParensToSymbolTables(*parens, ofst);\n}\n\ntemplate <class Arc>\nsize_t PdtLeftParser<Arc>::AssignParenIds(\n    const Fst<Arc> &ofst,\n    ParenMap *paren_map) const {\n  // Number of distinct parenthesis pairs per FST.\n  std::vector<size_t> nparens(FstArray().size(), 0);\n  // Number of distinct parenthesis pairs overall.\n  size_t total_nparens = 0;\n  for (StateIterator<Fst<Arc>> siter(ofst); !siter.Done(); siter.Next()) {\n    const auto os = siter.Value();\n    for (ArcIterator<Fst<Arc>> aiter(ofst, os); !aiter.Done(); aiter.Next()) {\n      const auto &arc = aiter.Value();\n      const auto nfst_id = Label2Id(arc.olabel);\n      if (nfst_id != kNoStateId) {\n        const ParenKey paren_key(nfst_id, arc.nextstate);\n        auto it = paren_map->find(paren_key);\n        if (it == paren_map->end()) {\n          // Assigns new paren ID for this (FST, dest state) pair.\n          (*paren_map)[paren_key] = nparens[nfst_id]++;\n          if (nparens[nfst_id] > total_nparens)\n            total_nparens = nparens[nfst_id];\n        }\n      }\n    }\n  }\n  return total_nparens;\n}\n\n// Similar to PdtLeftParser but:\n//\n// 1. Uses epsilons rather than parentheses labels for any non-terminal\n//    instances within a left- (right-) linear dependency SCC,\n// 2. Allocates a paren ID uniquely for each such dependency SCC (rather than\n//    non-terminal = dependency state) and destination state.\ntemplate <class Arc>\nclass PdtLeftSRParser final : public PdtParser<Arc> {\n public:\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n  using LabelFstPair = typename PdtParser<Arc>::LabelFstPair;\n  using LabelPair = typename PdtParser<Arc>::LabelPair;\n  using LabelStatePair = typename PdtParser<Arc>::LabelStatePair;\n  using StateWeightPair = typename PdtParser<Arc>::StateWeightPair;\n  using ParenKey = typename PdtParser<Arc>::ParenKey;\n  using ParenMap = typename PdtParser<Arc>::ParenMap;\n\n  using PdtParser<Arc>::AddParensToFst;\n  using PdtParser<Arc>::AddParensToSymbolTables;\n  using PdtParser<Arc>::AssignParenLabels;\n  using PdtParser<Arc>::CreateFst;\n  using PdtParser<Arc>::FstArray;\n  using PdtParser<Arc>::GetLabelStatePair;\n  using PdtParser<Arc>::GetState;\n  using PdtParser<Arc>::Label2Id;\n  using PdtParser<Arc>::Root;\n\n  PdtLeftSRParser(const std::vector<LabelFstPair> &fst_array,\n                  const PdtReplaceOptions<Arc> &opts) :\n      PdtParser<Arc>(fst_array, opts),\n      replace_util_(fst_array, ReplaceUtilOptions(opts.root)) { }\n\n  void GetParser(MutableFst<Arc> *ofst,\n                 std::vector<LabelPair> *parens) override;\n\n protected:\n  // Assigns a unique parenthesis ID for each non-terminal, destination state\n  // pair when the non-terminal refers to a non-linear FST. Otherwise, assigns\n  // a unique parenthesis ID for each dependency SCC, destination state pair if\n  // the non-terminal instance is between\n  // SCCs. Otherwise does nothing.\n  size_t AssignParenIds(const Fst<Arc> &ofst,\n                        ParenMap *paren_map) const override;\n\n  // Returns dependency SCC for given label.\n  size_t SCC(Label label) const { return replace_util_.SCC(label); }\n\n  // Is a given dependency SCC left-linear?\n  bool SCCLeftLinear(size_t scc_id) const {\n    const auto ll_props = kReplaceSCCLeftLinear | kReplaceSCCNonTrivial;\n    const auto scc_props = replace_util_.SCCProperties(scc_id);\n    return (scc_props & ll_props) == ll_props;\n  }\n\n  // Is a given dependency SCC right-linear?\n  bool SCCRightLinear(size_t scc_id) const {\n    const auto lr_props = kReplaceSCCRightLinear | kReplaceSCCNonTrivial;\n    const auto scc_props = replace_util_.SCCProperties(scc_id);\n    return (scc_props & lr_props) == lr_props;\n  }\n\n  // Components of left- (right-) linear dependency SCC; empty o.w.\n  const std::vector<size_t> &SCCComps(size_t scc_id) const {\n    if (scc_comps_.empty()) GetSCCComps();\n    return scc_comps_[scc_id];\n  }\n\n  // Returns the representative state of an SCC. For left-linear grammars, it\n  // is one of the initial states. For right-linear grammars, it is one of the\n  // non-terminal destination states; otherwise, it is kNoStateId.\n  StateId RepState(size_t scc_id) const {\n    if (SCCComps(scc_id).empty()) return kNoStateId;\n    const auto fst_id = SCCComps(scc_id).front();\n    const auto &fst_array = FstArray();\n    const auto label = fst_array[fst_id].first;\n    const auto *ifst = fst_array[fst_id].second;\n    if (SCCLeftLinear(scc_id)) {\n      const LabelStatePair lsp(label, ifst->Start());\n      return GetState(lsp);\n    } else {  // Right-linear.\n      const LabelStatePair lsp(label, *NonTermDests(fst_id).begin());\n      return GetState(lsp);\n    }\n    return kNoStateId;\n  }\n\n private:\n  // Merges initial (final) states of in a left- (right-) linear dependency SCC\n  // after dealing with the non-terminal arc and final weights.\n  void ProcSCCs(MutableFst<Arc> *ofst,\n                std::vector<StateId> *open_dest,\n                std::vector<std::vector<StateWeightPair>> *close_src,\n                std::vector<bool> *close_non_term_weight) const;\n\n  // Computes components of left- (right-) linear dependency SCC.\n  void GetSCCComps() const {\n    const std::vector<LabelFstPair> &fst_array = FstArray();\n    for (size_t i = 0; i < fst_array.size(); ++i) {\n      const auto label = fst_array[i].first;\n      const auto scc_id = SCC(label);\n      if (scc_comps_.size() <= scc_id) scc_comps_.resize(scc_id + 1);\n      if (SCCLeftLinear(scc_id) || SCCRightLinear(scc_id)) {\n        scc_comps_[scc_id].push_back(i);\n      }\n    }\n  }\n\n  const std::set<StateId> &NonTermDests(StateId fst_id) const {\n    if (non_term_dests_.empty()) GetNonTermDests();\n    return non_term_dests_[fst_id];\n  }\n\n  // Finds non-terminal destination states for right-linear FSTS, or does\n  // nothing if not found.\n  void GetNonTermDests() const;\n\n  // Dependency SCC info.\n  mutable ReplaceUtil<Arc> replace_util_;\n  // Components of left- (right-) linear dependency SCCs, or empty otherwise.\n  mutable std::vector<std::vector<size_t>> scc_comps_;\n  // States that have non-terminals entering them for each (right-linear) FST.\n  mutable std::vector<std::set<StateId>> non_term_dests_;\n};\n\ntemplate <class Arc>\nvoid PdtLeftSRParser<Arc>::GetParser(\n    MutableFst<Arc> *ofst,\n    std::vector<LabelPair> *parens) {\n  ofst->DeleteStates();\n  parens->clear();\n  const auto &fst_array = FstArray();\n  // Map that gives the paren ID for a (non-terminal, dest. state) pair.\n  ParenMap paren_map;\n  // Specifies the open parenthesis destination state for a given non-terminal.\n  // The source is the non-terminal instance source state.\n  std::vector<StateId> open_dest(fst_array.size(), kNoStateId);\n  // Specifies close parenthesis source states and weights for a given\n  // non-terminal. The destination is the non-terminal instance destination\n  // state.\n  std::vector<std::vector<StateWeightPair>> close_src(fst_array.size());\n  // Specifies non-terminals for which the non-terminal arc weight should be\n  // applied on the close parenthesis (multiplying the close_src weight above)\n  // rather than on the open parenthesis.\n  std::vector<bool> close_non_term_weight(fst_array.size(), false);\n  CreateFst(ofst, &open_dest, &close_src);\n  ProcSCCs(ofst, &open_dest, &close_src, &close_non_term_weight);\n  const auto total_nparens = AssignParenIds(*ofst, &paren_map);\n  AssignParenLabels(total_nparens, parens);\n  AddParensToFst(*parens, paren_map, open_dest, close_src,\n                 close_non_term_weight, ofst);\n  if (!fst_array.empty()) {\n    ofst->SetInputSymbols(fst_array[0].second->InputSymbols());\n    ofst->SetOutputSymbols(fst_array[0].second->OutputSymbols());\n  }\n  AddParensToSymbolTables(*parens, ofst);\n  Connect(ofst);\n}\n\ntemplate <class Arc>\nvoid PdtLeftSRParser<Arc>::ProcSCCs(\n    MutableFst<Arc> *ofst,\n    std::vector<StateId> *open_dest,\n    std::vector<std::vector<StateWeightPair>> *close_src,\n    std::vector<bool> *close_non_term_weight) const {\n  const auto &fst_array = FstArray();\n  for (StateIterator<Fst<Arc>> siter(*ofst); !siter.Done(); siter.Next()) {\n    const auto os = siter.Value();\n    const auto label = GetLabelStatePair(os).first;\n    const auto is = GetLabelStatePair(os).second;\n    const auto fst_id = Label2Id(label);\n    const auto scc_id = SCC(label);\n    const auto rs = RepState(scc_id);\n    const auto *ifst = fst_array[fst_id].second;\n    // SCC LEFT-LINEAR: puts non-terminal weights on close parentheses. Merges\n    // initial states into SCC representative state and updates open_dest.\n    if (SCCLeftLinear(scc_id)) {\n      (*close_non_term_weight)[fst_id] = true;\n      if (is == ifst->Start() && os != rs) {\n        for (ArcIterator<Fst<Arc>> aiter(*ofst, os); !aiter.Done();\n             aiter.Next()) {\n          const auto &arc = aiter.Value();\n          ofst->AddArc(rs, arc);\n        }\n        ofst->DeleteArcs(os);\n        if (os == ofst->Start())\n          ofst->SetStart(rs);\n        (*open_dest)[fst_id] = rs;\n      }\n    }\n    // SCC RIGHT-LINEAR: pushes back final weights onto non-terminals, if\n    // possible, or adds weighted epsilons to the SCC representative state.\n    // Merges final states into SCC representative state and updates close_src.\n    if (SCCRightLinear(scc_id)) {\n      for (MutableArcIterator<MutableFst<Arc>> aiter(ofst, os); !aiter.Done();\n           aiter.Next()) {\n        auto arc = aiter.Value();\n        const auto idest = GetLabelStatePair(arc.nextstate).second;\n        if (NonTermDests(fst_id).count(idest) > 0) {\n          if (ofst->Final(arc.nextstate) != Weight::Zero()) {\n            ofst->SetFinal(arc.nextstate, Weight::Zero());\n            ofst->SetFinal(rs, Weight::One());\n          }\n          arc.weight = Times(arc.weight, ifst->Final(idest));\n          arc.nextstate = rs;\n          aiter.SetValue(arc);\n        }\n      }\n      const auto final_weight = ifst->Final(is);\n      if (final_weight != Weight::Zero() &&\n          NonTermDests(fst_id).count(is) == 0) {\n        ofst->AddArc(os, Arc(0, 0, final_weight, rs));\n        if (ofst->Final(os) != Weight::Zero()) {\n          ofst->SetFinal(os, Weight::Zero());\n          ofst->SetFinal(rs, Weight::One());\n        }\n      }\n      if (is == ifst->Start()) {\n        (*close_src)[fst_id].clear();\n        (*close_src)[fst_id].emplace_back(rs, Weight::One());\n      }\n    }\n  }\n}\n\ntemplate <class Arc>\nvoid PdtLeftSRParser<Arc>::GetNonTermDests() const {\n  const auto &fst_array = FstArray();\n  non_term_dests_.resize(fst_array.size());\n  for (size_t fst_id = 0; fst_id < fst_array.size(); ++fst_id) {\n    const auto label = fst_array[fst_id].first;\n    const auto scc_id = SCC(label);\n    if (SCCRightLinear(scc_id)) {\n      const auto *ifst = fst_array[fst_id].second;\n      for (StateIterator<Fst<Arc>> siter(*ifst); !siter.Done(); siter.Next()) {\n        const auto is = siter.Value();\n        for (ArcIterator<Fst<Arc>> aiter(*ifst, is); !aiter.Done();\n             aiter.Next()) {\n          const auto &arc = aiter.Value();\n          if (Label2Id(arc.olabel) != kNoStateId) {\n            non_term_dests_[fst_id].insert(arc.nextstate);\n          }\n        }\n      }\n    }\n  }\n}\n\ntemplate <class Arc>\nsize_t PdtLeftSRParser<Arc>::AssignParenIds(\n    const Fst<Arc> &ofst,\n    ParenMap *paren_map) const {\n  const auto &fst_array = FstArray();\n  // Number of distinct parenthesis pairs per FST.\n  std::vector<size_t> nparens(fst_array.size(), 0);\n  // Number of distinct parenthesis pairs overall.\n  size_t total_nparens = 0;\n  for (StateIterator<Fst<Arc>> siter(ofst); !siter.Done(); siter.Next()) {\n    const auto os = siter.Value();\n    const auto label = GetLabelStatePair(os).first;\n    const auto scc_id = SCC(label);\n    for (ArcIterator<Fst<Arc>> aiter(ofst, os); !aiter.Done(); aiter.Next()) {\n      const auto &arc = aiter.Value();\n      const auto nfst_id = Label2Id(arc.olabel);\n      if (nfst_id != kNoStateId) {\n        size_t nscc_id = SCC(arc.olabel);\n        bool nscc_linear = !SCCComps(nscc_id).empty();\n        // Assigns a parenthesis ID for the non-terminal transition\n        // if the non-terminal belongs to a (left-/right-) linear dependency\n        // SCC or if the transition is in an FST from a different SCC\n        if (!nscc_linear || scc_id != nscc_id) {\n          // For (left-/right-) linear SCCs instead of using nfst_id, we\n          // will use its SCC prototype pfst_id for assigning distinct\n          // parenthesis IDs.\n          const auto pfst_id =\n              nscc_linear ? SCCComps(nscc_id).front() : nfst_id;\n          ParenKey paren_key(pfst_id, arc.nextstate);\n          const auto it = paren_map->find(paren_key);\n          if (it == paren_map->end()) {\n            // Assigns new paren ID for this (FST/SCC, dest. state) pair.\n            if (nscc_linear) {\n              // This is mapping we'll need, but we also store (harmlessly)\n              // for the prototype below so we can easily keep count per SCC.\n              const ParenKey nparen_key(nfst_id, arc.nextstate);\n              (*paren_map)[nparen_key] = nparens[pfst_id];\n            }\n            (*paren_map)[paren_key] = nparens[pfst_id]++;\n            if (nparens[pfst_id] > total_nparens) {\n              total_nparens = nparens[pfst_id];\n            }\n          }\n        }\n      }\n    }\n  }\n  return total_nparens;\n}\n\n// Builds a pushdown transducer (PDT) from an RTN specification. The result is\n// a PDT written to a mutable FST where some transitions are labeled with\n// open or close parentheses. To be interpreted as a PDT, the parens must\n// balance on a path (see PdtExpand()). The open/close parenthesis label pairs\n// are returned in the parens argument.\ntemplate <class Arc>\nvoid Replace(\n    const std::vector<std::pair<typename Arc::Label, const Fst<Arc> *>>\n        &ifst_array,\n    MutableFst<Arc> *ofst,\n    std::vector<std::pair<typename Arc::Label, typename Arc::Label>> *parens,\n    const PdtReplaceOptions<Arc> &opts) {\n  switch (opts.type) {\n    case PDT_LEFT_PARSER:\n      {\n        PdtLeftParser<Arc> pr(ifst_array, opts);\n        pr.GetParser(ofst, parens);\n        return;\n      }\n    case PDT_LEFT_SR_PARSER:\n      {\n        PdtLeftSRParser<Arc> pr(ifst_array, opts);\n        pr.GetParser(ofst, parens);\n        return;\n      }\n    default:\n      FSTERROR() << \"Replace: Unknown PDT parser type: \" << opts.type;\n      ofst->DeleteStates();\n      ofst->SetProperties(kError, kError);\n      parens->clear();\n      return;\n  }\n}\n\n// Variant where the only user-controlled arguments is the root ID.\ntemplate <class Arc>\nvoid Replace(\n    const std::vector<std::pair<typename Arc::Label, const Fst<Arc> *>>\n        &ifst_array,\n    MutableFst<Arc> *ofst,\n    std::vector<std::pair<typename Arc::Label, typename Arc::Label>> *parens,\n    typename Arc::Label root) {\n  PdtReplaceOptions<Arc> opts(root);\n  Replace(ifst_array, ofst, parens, opts);\n}\n\n}  // namespace fst\n\n#endif  // FST_EXTENSIONS_PDT_REPLACE_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/extensions/pdt/reverse.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Expands a PDT to an FST.\n\n#ifndef FST_EXTENSIONS_PDT_REVERSE_H_\n#define FST_EXTENSIONS_PDT_REVERSE_H_\n\n#include <vector>\n\n#include <fst/mutable-fst.h>\n#include <fst/relabel.h>\n#include <fst/reverse.h>\n\nnamespace fst {\n\n// Reverses a pushdown transducer (PDT) encoded as an FST.\ntemplate <class Arc, class RevArc>\nvoid Reverse(const Fst<Arc> &ifst,\n             const std::vector<\n                 std::pair<typename Arc::Label, typename Arc::Label>> &parens,\n             MutableFst<RevArc> *ofst) {\n  using Label = typename Arc::Label;\n  // Reverses FST component.\n  Reverse(ifst, ofst);\n  // Exchanges open and close parenthesis pairs.\n  std::vector<std::pair<Label, Label>> relabel_pairs;\n  relabel_pairs.reserve(2 * parens.size());\n  for (const auto &pair : parens) {\n    relabel_pairs.emplace_back(pair.first, pair.second);\n    relabel_pairs.emplace_back(pair.second, pair.first);\n  }\n  Relabel(ofst, relabel_pairs, relabel_pairs);\n}\n\n}  // namespace fst\n\n#endif  // FST_EXTENSIONS_PDT_REVERSE_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/extensions/pdt/shortest-path.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Functions to find shortest paths in a PDT.\n\n#ifndef FST_EXTENSIONS_PDT_SHORTEST_PATH_H_\n#define FST_EXTENSIONS_PDT_SHORTEST_PATH_H_\n\n#include <stack>\n#include <unordered_map>\n#include <utility>\n#include <vector>\n\n#include <fst/log.h>\n\n#include <fst/extensions/pdt/paren.h>\n#include <fst/extensions/pdt/pdt.h>\n#include <fst/shortest-path.h>\n\nnamespace fst {\n\ntemplate <class Arc, class Queue>\nstruct PdtShortestPathOptions {\n  bool keep_parentheses;\n  bool path_gc;\n\n  PdtShortestPathOptions(bool keep_parentheses = false, bool path_gc = true)\n      : keep_parentheses(keep_parentheses), path_gc(path_gc) {}\n};\n\nnamespace internal {\n\n// Flags for shortest path data.\n\nconstexpr uint8_t kPdtInited = 0x01;\nconstexpr uint8_t kPdtFinal = 0x02;\nconstexpr uint8_t kPdtMarked = 0x04;\n\n// Stores shortest path tree info Distance(), Parent(), and ArcParent()\n// information keyed on two types:\n//\n// 1. SearchState: This is a usual node in a shortest path tree but:\n//    a. is w.r.t a PDT search state (a pair of a PDT state and a \"start\" state,\n//    either the PDT start state or the destination state of an open\n//    parenthesis).\n//    b. the Distance() is from this \"start\" state to the search state.\n//    c. Parent().state is kNoLabel for the \"start\" state.\n//\n// 2. ParenSpec: This connects shortest path trees depending on the the\n// parenthesis taken. Given the parenthesis spec:\n//    a. the Distance() is from the Parent() \"start\" state to the parenthesis\n//    destination state.\n//    b. The ArcParent() is the parenthesis arc.\ntemplate <class Arc>\nclass PdtShortestPathData {\n public:\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  struct SearchState {\n    StateId state;  // PDT state.\n    StateId start;  // PDT paren \"start\" state.\n\n    SearchState(StateId s = kNoStateId, StateId t = kNoStateId)\n        : state(s), start(t) {}\n\n    bool operator==(const SearchState &other) const {\n      if (&other == this) return true;\n      return other.state == state && other.start == start;\n    }\n  };\n\n  // Specifies paren ID, source and dest \"start\" states of a paren. These are\n  // the \"start\" states of the respective sub-graphs.\n  struct ParenSpec {\n    ParenSpec(Label paren_id = kNoLabel, StateId src_start = kNoStateId,\n              StateId dest_start = kNoStateId)\n        : paren_id(paren_id), src_start(src_start), dest_start(dest_start) {}\n\n    Label paren_id;\n    StateId src_start;   // Sub-graph \"start\" state for paren source.\n    StateId dest_start;  // Sub-graph \"start\" state for paren dest.\n\n    bool operator==(const ParenSpec &other) const {\n      if (&other == this) return true;\n      return (other.paren_id == paren_id &&\n              other.src_start == other.src_start &&\n              other.dest_start == dest_start);\n    }\n  };\n\n  struct SearchData {\n    SearchData()\n        : distance(Weight::Zero()),\n          parent(kNoStateId, kNoStateId),\n          paren_id(kNoLabel),\n          flags(0) {}\n\n    Weight distance;     // Distance to this state from PDT \"start\" state.\n    SearchState parent;  // Parent state in shortest path tree.\n    int16_t paren_id;      // If parent arc has paren, paren ID (or kNoLabel).\n    uint8_t flags;         // First byte reserved for PdtShortestPathData use.\n  };\n\n  PdtShortestPathData(bool gc)\n      : gc_(gc), nstates_(0), ngc_(0), finished_(false) {}\n\n  ~PdtShortestPathData() {\n    VLOG(1) << \"opm size: \" << paren_map_.size();\n    VLOG(1) << \"# of search states: \" << nstates_;\n    if (gc_) VLOG(1) << \"# of GC'd search states: \" << ngc_;\n  }\n\n  void Clear() {\n    search_map_.clear();\n    search_multimap_.clear();\n    paren_map_.clear();\n    state_ = SearchState(kNoStateId, kNoStateId);\n    nstates_ = 0;\n    ngc_ = 0;\n  }\n\n  // TODO(kbg): Currently copying SearchState and passing a const reference to\n  // ParenSpec. Benchmark to confirm this is the right thing to do.\n\n  Weight Distance(SearchState s) const { return GetSearchData(s)->distance; }\n\n  Weight Distance(const ParenSpec &paren) const {\n    return GetSearchData(paren)->distance;\n  }\n\n  SearchState Parent(SearchState s) const { return GetSearchData(s)->parent; }\n\n  SearchState Parent(const ParenSpec &paren) const {\n    return GetSearchData(paren)->parent;\n  }\n\n  Label ParenId(SearchState s) const { return GetSearchData(s)->paren_id; }\n\n  uint8_t Flags(SearchState s) const { return GetSearchData(s)->flags; }\n\n  void SetDistance(SearchState s, Weight weight) {\n    GetSearchData(s)->distance = std::move(weight);\n  }\n\n  void SetDistance(const ParenSpec &paren, Weight weight) {\n    GetSearchData(paren)->distance = std::move(weight);\n  }\n\n  void SetParent(SearchState s, SearchState p) { GetSearchData(s)->parent = p; }\n\n  void SetParent(const ParenSpec &paren, SearchState p) {\n    GetSearchData(paren)->parent = p;\n  }\n\n  void SetParenId(SearchState s, Label p) {\n    if (p >= 32768) {\n      FSTERROR() << \"PdtShortestPathData: Paren ID does not fit in an int16_t\";\n    }\n    GetSearchData(s)->paren_id = p;\n  }\n\n  void SetFlags(SearchState s, uint8_t f, uint8_t mask) {\n    auto *data = GetSearchData(s);\n    data->flags &= ~mask;\n    data->flags |= f & mask;\n  }\n\n  void GC(StateId s);\n\n  void Finish() { finished_ = true; }\n\n private:\n  // Hash for search state.\n  struct SearchStateHash {\n    size_t operator()(const SearchState &s) const {\n      static constexpr auto prime = 7853;\n      return s.state + s.start * prime;\n    }\n  };\n\n  // Hash for paren map.\n  struct ParenHash {\n    size_t operator()(const ParenSpec &paren) const {\n      static constexpr auto prime0 = 7853;\n      static constexpr auto prime1 = 7867;\n      return paren.paren_id + paren.src_start * prime0 +\n             paren.dest_start * prime1;\n    }\n  };\n\n  using SearchMap =\n      std::unordered_map<SearchState, SearchData, SearchStateHash>;\n\n  using SearchMultimap = std::unordered_multimap<StateId, StateId>;\n\n  // Hash map from paren spec to open paren data.\n  using ParenMap = std::unordered_map<ParenSpec, SearchData, ParenHash>;\n\n  SearchData *GetSearchData(SearchState s) const {\n    if (s == state_) return state_data_;\n    if (finished_) {\n      auto it = search_map_.find(s);\n      if (it == search_map_.end()) return &null_search_data_;\n      state_ = s;\n      return state_data_ = &(it->second);\n    } else {\n      state_ = s;\n      state_data_ = &search_map_[s];\n      if (!(state_data_->flags & kPdtInited)) {\n        ++nstates_;\n        if (gc_) search_multimap_.insert(std::make_pair(s.start, s.state));\n        state_data_->flags = kPdtInited;\n      }\n      return state_data_;\n    }\n  }\n\n  SearchData *GetSearchData(ParenSpec paren) const {\n    if (paren == paren_) return paren_data_;\n    if (finished_) {\n      auto it = paren_map_.find(paren);\n      if (it == paren_map_.end()) return &null_search_data_;\n      paren_ = paren;\n      return state_data_ = &(it->second);\n    } else {\n      paren_ = paren;\n      return paren_data_ = &paren_map_[paren];\n    }\n  }\n\n  mutable SearchMap search_map_;            // Maps from search state to data.\n  mutable SearchMultimap search_multimap_;  // Maps from \"start\" to subgraph.\n  mutable ParenMap paren_map_;              // Maps paren spec to search data.\n  mutable SearchState state_;               // Last state accessed.\n  mutable SearchData *state_data_;          // Last state data accessed.\n  mutable ParenSpec paren_;                 // Last paren spec accessed.\n  mutable SearchData *paren_data_;          // Last paren data accessed.\n  bool gc_;                                 // Allow GC?\n  mutable size_t nstates_;                  // Total number of search states.\n  size_t ngc_;                              // Number of GC'd search states.\n  mutable SearchData null_search_data_;     // Null search data.\n  bool finished_;                           // Read-only access when true.\n\n  PdtShortestPathData(const PdtShortestPathData &) = delete;\n  PdtShortestPathData &operator=(const PdtShortestPathData &) = delete;\n};\n\n// Deletes inaccessible search data from a given \"start\" (open paren dest)\n// state. Assumes \"final\" (close paren source or PDT final) states have\n// been flagged kPdtFinal.\ntemplate <class Arc>\nvoid PdtShortestPathData<Arc>::GC(StateId start) {\n  if (!gc_) return;\n  std::vector<StateId> finals;\n  for (auto it = search_multimap_.find(start);\n       it != search_multimap_.end() && it->first == start; ++it) {\n    const SearchState s(it->second, start);\n    if (search_map_[s].flags & kPdtFinal) finals.push_back(s.state);\n  }\n  // Mark phase.\n  for (const auto state : finals) {\n    SearchState ss(state, start);\n    while (ss.state != kNoLabel) {\n      auto &sdata = search_map_[ss];\n      if (sdata.flags & kPdtMarked) break;\n      sdata.flags |= kPdtMarked;\n      const auto p = sdata.parent;\n      if (p.start != start && p.start != kNoLabel) {  // Entering sub-subgraph.\n        const ParenSpec paren(sdata.paren_id, ss.start, p.start);\n        ss = paren_map_[paren].parent;\n      } else {\n        ss = p;\n      }\n    }\n  }\n  // Sweep phase.\n  auto it = search_multimap_.find(start);\n  while (it != search_multimap_.end() && it->first == start) {\n    const SearchState s(it->second, start);\n    auto mit = search_map_.find(s);\n    const SearchData &data = mit->second;\n    if (!(data.flags & kPdtMarked)) {\n      search_map_.erase(mit);\n      ++ngc_;\n    }\n    search_multimap_.erase(it++);\n  }\n}\n\n}  // namespace internal\n\n// This computes the single source shortest (balanced) path (SSSP) through a\n// weighted PDT that has a bounded stack (i.e., is expandable as an FST). It is\n// a generalization of the classic SSSP graph algorithm that removes a state s\n// from a queue (defined by a user-provided queue type) and relaxes the\n// destination states of transitions leaving s. In this PDT version, states that\n// have entering open parentheses are treated as source states for a sub-graph\n// SSSP problem with the shortest path up to the open parenthesis being first\n// saved. When a close parenthesis is then encountered any balancing open\n// parenthesis is examined for this saved information and multiplied back. In\n// this way, each sub-graph is entered only once rather than repeatedly. If\n// every state in the input PDT has the property that there is a unique \"start\"\n// state for it with entering open parentheses, then this algorithm is quite\n// straightforward. In general, this will not be the case, so the algorithm\n// (implicitly) creates a new graph where each state is a pair of an original\n// state and a possible parenthesis \"start\" state for that state.\ntemplate <class Arc, class Queue>\nclass PdtShortestPath {\n public:\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using SpData = internal::PdtShortestPathData<Arc>;\n  using SearchState = typename SpData::SearchState;\n  using ParenSpec = typename SpData::ParenSpec;\n  using CloseSourceIterator =\n      typename internal::PdtBalanceData<Arc>::SetIterator;\n\n  PdtShortestPath(const Fst<Arc> &ifst,\n                  const std::vector<std::pair<Label, Label>> &parens,\n                  const PdtShortestPathOptions<Arc, Queue> &opts)\n      : ifst_(ifst.Copy()),\n        parens_(parens),\n        keep_parens_(opts.keep_parentheses),\n        start_(ifst.Start()),\n        sp_data_(opts.path_gc),\n        error_(false) {\n    // TODO(kbg): Make this a compile-time static_assert once:\n    // 1) All weight properties are made constexpr for all weight types.\n    // 2) We have a pleasant way to \"deregister\" this oepration for non-path\n    //    semirings so an informative error message is produced. The best\n    //    solution will probably involve some kind of SFINAE magic.\n    if ((Weight::Properties() & (kPath | kRightSemiring)) !=\n        (kPath | kRightSemiring)) {\n      FSTERROR() << \"PdtShortestPath: Weight needs to have the path\"\n                 << \" property and be right distributive: \" << Weight::Type();\n      error_ = true;\n    }\n    for (Label i = 0; i < parens.size(); ++i) {\n      const auto &pair = parens[i];\n      paren_map_[pair.first] = i;\n      paren_map_[pair.second] = i;\n    }\n  }\n\n  ~PdtShortestPath() {\n    VLOG(1) << \"# of input states: \" << CountStates(*ifst_);\n    VLOG(1) << \"# of enqueued: \" << nenqueued_;\n    VLOG(1) << \"cpmm size: \" << close_paren_multimap_.size();\n  }\n\n  void ShortestPath(MutableFst<Arc> *ofst) {\n    Init(ofst);\n    GetDistance(start_);\n    GetPath();\n    sp_data_.Finish();\n    if (error_) ofst->SetProperties(kError, kError);\n  }\n\n  const internal::PdtShortestPathData<Arc> &GetShortestPathData() const {\n    return sp_data_;\n  }\n\n  internal::PdtBalanceData<Arc> *GetBalanceData() { return &balance_data_; }\n\n public:\n  // Hash multimap from close paren label to an paren arc.\n  using CloseParenMultimap =\n      std::unordered_multimap<internal::ParenState<Arc>, Arc,\n                              typename internal::ParenState<Arc>::Hash>;\n\n  const CloseParenMultimap &GetCloseParenMultimap() const {\n    return close_paren_multimap_;\n  }\n\n private:\n  void Init(MutableFst<Arc> *ofst);\n\n  void GetDistance(StateId start);\n\n  void ProcFinal(SearchState s);\n\n  void ProcArcs(SearchState s);\n\n  void ProcOpenParen(Label paren_id, SearchState s, StateId nexstate,\n                     const Weight &weight);\n\n  void ProcCloseParen(Label paren_id, SearchState s, const Weight &weight);\n\n  void ProcNonParen(SearchState s, StateId nextstate, const Weight &weight);\n\n  void Relax(SearchState s, SearchState t, StateId nextstate,\n             const Weight &weight, Label paren_id);\n\n  void Enqueue(SearchState d);\n\n  void GetPath();\n\n  Arc GetPathArc(SearchState s, SearchState p, Label paren_id, bool open);\n\n  std::unique_ptr<Fst<Arc>> ifst_;\n  MutableFst<Arc> *ofst_;\n  const std::vector<std::pair<Label, Label>> &parens_;\n  bool keep_parens_;\n  Queue *state_queue_;\n  StateId start_;\n  Weight fdistance_;\n  SearchState f_parent_;\n  SpData sp_data_;\n  std::unordered_map<Label, Label> paren_map_;\n  CloseParenMultimap close_paren_multimap_;\n  internal::PdtBalanceData<Arc> balance_data_;\n  std::ptrdiff_t nenqueued_;\n  bool error_;\n\n  static constexpr uint8_t kEnqueued = 0x10;\n  static constexpr uint8_t kExpanded = 0x20;\n  static constexpr uint8_t kFinished = 0x40;\n\n  static const Arc kNoArc;\n};\n\ntemplate <class Arc, class Queue>\nvoid PdtShortestPath<Arc, Queue>::Init(MutableFst<Arc> *ofst) {\n  ofst_ = ofst;\n  ofst->DeleteStates();\n  ofst->SetInputSymbols(ifst_->InputSymbols());\n  ofst->SetOutputSymbols(ifst_->OutputSymbols());\n  if (ifst_->Start() == kNoStateId) return;\n  fdistance_ = Weight::Zero();\n  f_parent_ = SearchState(kNoStateId, kNoStateId);\n  sp_data_.Clear();\n  close_paren_multimap_.clear();\n  balance_data_.Clear();\n  nenqueued_ = 0;\n  // Finds open parens per destination state and close parens per source state.\n  for (StateIterator<Fst<Arc>> siter(*ifst_); !siter.Done(); siter.Next()) {\n    const auto s = siter.Value();\n    for (ArcIterator<Fst<Arc>> aiter(*ifst_, s); !aiter.Done(); aiter.Next()) {\n      const auto &arc = aiter.Value();\n      const auto it = paren_map_.find(arc.ilabel);\n      if (it != paren_map_.end()) {  // Is a paren?\n        const auto paren_id = it->second;\n        if (arc.ilabel == parens_[paren_id].first) {  // Open paren.\n          balance_data_.OpenInsert(paren_id, arc.nextstate);\n        } else {  // Close paren.\n          const internal::ParenState<Arc> paren_state(paren_id, s);\n          close_paren_multimap_.emplace(paren_state, arc);\n        }\n      }\n    }\n  }\n}\n\n// Computes the shortest distance stored in a recursive way. Each sub-graph\n// (i.e., different paren \"start\" state) begins with weight One().\ntemplate <class Arc, class Queue>\nvoid PdtShortestPath<Arc, Queue>::GetDistance(StateId start) {\n  if (start == kNoStateId) return;\n  Queue state_queue;\n  state_queue_ = &state_queue;\n  const SearchState q(start, start);\n  Enqueue(q);\n  sp_data_.SetDistance(q, Weight::One());\n  while (!state_queue_->Empty()) {\n    const auto state = state_queue_->Head();\n    state_queue_->Dequeue();\n    const SearchState s(state, start);\n    sp_data_.SetFlags(s, 0, kEnqueued);\n    ProcFinal(s);\n    ProcArcs(s);\n    sp_data_.SetFlags(s, kExpanded, kExpanded);\n  }\n  sp_data_.SetFlags(q, kFinished, kFinished);\n  balance_data_.FinishInsert(start);\n  sp_data_.GC(start);\n}\n\n// Updates best complete path.\ntemplate <class Arc, class Queue>\nvoid PdtShortestPath<Arc, Queue>::ProcFinal(SearchState s) {\n  if (ifst_->Final(s.state) != Weight::Zero() && s.start == start_) {\n    const auto weight = Times(sp_data_.Distance(s), ifst_->Final(s.state));\n    if (fdistance_ != Plus(fdistance_, weight)) {\n      if (f_parent_.state != kNoStateId) {\n        sp_data_.SetFlags(f_parent_, 0, internal::kPdtFinal);\n      }\n      sp_data_.SetFlags(s, internal::kPdtFinal, internal::kPdtFinal);\n      fdistance_ = Plus(fdistance_, weight);\n      f_parent_ = s;\n    }\n  }\n}\n\n// Processes all arcs leaving the state s.\ntemplate <class Arc, class Queue>\nvoid PdtShortestPath<Arc, Queue>::ProcArcs(SearchState s) {\n  for (ArcIterator<Fst<Arc>> aiter(*ifst_, s.state); !aiter.Done();\n       aiter.Next()) {\n    const auto &arc = aiter.Value();\n    const auto weight = Times(sp_data_.Distance(s), arc.weight);\n    const auto it = paren_map_.find(arc.ilabel);\n    if (it != paren_map_.end()) {  // Is a paren?\n      const auto paren_id = it->second;\n      if (arc.ilabel == parens_[paren_id].first) {\n        ProcOpenParen(paren_id, s, arc.nextstate, weight);\n      } else {\n        ProcCloseParen(paren_id, s, weight);\n      }\n    } else {\n      ProcNonParen(s, arc.nextstate, weight);\n    }\n  }\n}\n\n// Saves the shortest path info for reaching this parenthesis and starts a new\n// SSSP in the sub-graph pointed to by the parenthesis if previously unvisited.\n// Otherwise it finds any previously encountered closing parentheses and relaxes\n// them using the recursively stored shortest distance to them.\ntemplate <class Arc, class Queue>\ninline void PdtShortestPath<Arc, Queue>::ProcOpenParen(Label paren_id,\n                                                       SearchState s,\n                                                       StateId nextstate,\n                                                       const Weight &weight) {\n  const SearchState d(nextstate, nextstate);\n  const ParenSpec paren(paren_id, s.start, d.start);\n  const auto pdist = sp_data_.Distance(paren);\n  if (pdist != Plus(pdist, weight)) {\n    sp_data_.SetDistance(paren, weight);\n    sp_data_.SetParent(paren, s);\n    const auto dist = sp_data_.Distance(d);\n    if (dist == Weight::Zero()) {\n      auto *state_queue = state_queue_;\n      GetDistance(d.start);\n      state_queue_ = state_queue;\n    } else if (!(sp_data_.Flags(d) & kFinished)) {\n      FSTERROR()\n          << \"PdtShortestPath: open parenthesis recursion: not bounded stack\";\n      error_ = true;\n    }\n    for (auto set_iter = balance_data_.Find(paren_id, nextstate);\n         !set_iter.Done(); set_iter.Next()) {\n      const SearchState cpstate(set_iter.Element(), d.start);\n      const internal::ParenState<Arc> paren_state(paren_id, cpstate.state);\n      for (auto cpit = close_paren_multimap_.find(paren_state);\n           cpit != close_paren_multimap_.end() && paren_state == cpit->first;\n           ++cpit) {\n        const auto &cparc = cpit->second;\n        const auto cpw =\n            Times(weight, Times(sp_data_.Distance(cpstate), cparc.weight));\n        Relax(cpstate, s, cparc.nextstate, cpw, paren_id);\n      }\n    }\n  }\n}\n\n// Saves the correspondence between each closing parenthesis and its balancing\n// open parenthesis info. Relaxes any close parenthesis destination state that\n// has a balancing previously encountered open parenthesis.\ntemplate <class Arc, class Queue>\ninline void PdtShortestPath<Arc, Queue>::ProcCloseParen(Label paren_id,\n                                                        SearchState s,\n                                                        const Weight &weight) {\n  const internal::ParenState<Arc> paren_state(paren_id, s.start);\n  if (!(sp_data_.Flags(s) & kExpanded)) {\n    balance_data_.CloseInsert(paren_id, s.start, s.state);\n    sp_data_.SetFlags(s, internal::kPdtFinal, internal::kPdtFinal);\n  }\n}\n\n// Classical relaxation for non-parentheses.\ntemplate <class Arc, class Queue>\ninline void PdtShortestPath<Arc, Queue>::ProcNonParen(SearchState s,\n                                                      StateId nextstate,\n                                                      const Weight &weight) {\n  Relax(s, s, nextstate, weight, kNoLabel);\n}\n\n// Classical relaxation on the search graph for an arc with destination state\n// nexstate from state s. State t is in the same sub-graph as nextstate (i.e.,\n// has the same paren \"start\").\ntemplate <class Arc, class Queue>\ninline void PdtShortestPath<Arc, Queue>::Relax(SearchState s, SearchState t,\n                                               StateId nextstate,\n                                               const Weight &weight,\n                                               Label paren_id) {\n  const SearchState d(nextstate, t.start);\n  Weight dist = sp_data_.Distance(d);\n  if (dist != Plus(dist, weight)) {\n    sp_data_.SetParent(d, s);\n    sp_data_.SetParenId(d, paren_id);\n    sp_data_.SetDistance(d, Plus(dist, weight));\n    Enqueue(d);\n  }\n}\n\ntemplate <class Arc, class Queue>\ninline void PdtShortestPath<Arc, Queue>::Enqueue(SearchState s) {\n  if (!(sp_data_.Flags(s) & kEnqueued)) {\n    state_queue_->Enqueue(s.state);\n    sp_data_.SetFlags(s, kEnqueued, kEnqueued);\n    ++nenqueued_;\n  } else {\n    state_queue_->Update(s.state);\n  }\n}\n\n// Follows parent pointers to find the shortest path. A stack is used since the\n// shortest distance is stored recursively.\ntemplate <class Arc, class Queue>\nvoid PdtShortestPath<Arc, Queue>::GetPath() {\n  SearchState s = f_parent_;\n  SearchState d = SearchState(kNoStateId, kNoStateId);\n  StateId s_p = kNoStateId;\n  StateId d_p = kNoStateId;\n  auto arc = kNoArc;\n  Label paren_id = kNoLabel;\n  std::stack<ParenSpec> paren_stack;\n  while (s.state != kNoStateId) {\n    d_p = s_p;\n    s_p = ofst_->AddState();\n    if (d.state == kNoStateId) {\n      ofst_->SetFinal(s_p, ifst_->Final(f_parent_.state));\n    } else {\n      if (paren_id != kNoLabel) {                     // Paren?\n        if (arc.ilabel == parens_[paren_id].first) {  // Open paren?\n          paren_stack.pop();\n        } else {  // Close paren?\n          const ParenSpec paren(paren_id, d.start, s.start);\n          paren_stack.push(paren);\n        }\n        if (!keep_parens_) arc.ilabel = arc.olabel = 0;\n      }\n      arc.nextstate = d_p;\n      ofst_->AddArc(s_p, arc);\n    }\n    d = s;\n    s = sp_data_.Parent(d);\n    paren_id = sp_data_.ParenId(d);\n    if (s.state != kNoStateId) {\n      arc = GetPathArc(s, d, paren_id, false);\n    } else if (!paren_stack.empty()) {\n      const ParenSpec paren = paren_stack.top();\n      s = sp_data_.Parent(paren);\n      paren_id = paren.paren_id;\n      arc = GetPathArc(s, d, paren_id, true);\n    }\n  }\n  ofst_->SetStart(s_p);\n  ofst_->SetProperties(\n      ShortestPathProperties(ofst_->Properties(kFstProperties, false)),\n      kFstProperties);\n}\n\n// Finds transition with least weight between two states with label matching\n// paren_id and open/close paren type or a non-paren if kNoLabel.\ntemplate <class Arc, class Queue>\nArc PdtShortestPath<Arc, Queue>::GetPathArc(SearchState s, SearchState d,\n                                            Label paren_id, bool open_paren) {\n  auto path_arc = kNoArc;\n  for (ArcIterator<Fst<Arc>> aiter(*ifst_, s.state); !aiter.Done();\n       aiter.Next()) {\n    const auto &arc = aiter.Value();\n    if (arc.nextstate != d.state) continue;\n    Label arc_paren_id = kNoLabel;\n    const auto it = paren_map_.find(arc.ilabel);\n    if (it != paren_map_.end()) {\n      arc_paren_id = it->second;\n      bool arc_open_paren = (arc.ilabel == parens_[arc_paren_id].first);\n      if (arc_open_paren != open_paren) continue;\n    }\n    if (arc_paren_id != paren_id) continue;\n    if (arc.weight == Plus(arc.weight, path_arc.weight)) path_arc = arc;\n  }\n  if (path_arc.nextstate == kNoStateId) {\n    FSTERROR() << \"PdtShortestPath::GetPathArc: Failed to find arc\";\n    error_ = true;\n  }\n  return path_arc;\n}\n\ntemplate <class Arc, class Queue>\nconst Arc PdtShortestPath<Arc, Queue>::kNoArc = Arc(kNoLabel, kNoLabel,\n                                                    Weight::Zero(), kNoStateId);\n\n// Functional variants.\n\ntemplate <class Arc, class Queue>\nvoid ShortestPath(\n    const Fst<Arc> &ifst,\n    const std::vector<std::pair<typename Arc::Label, typename Arc::Label>>\n        &parens,\n    MutableFst<Arc> *ofst, const PdtShortestPathOptions<Arc, Queue> &opts) {\n  PdtShortestPath<Arc, Queue> psp(ifst, parens, opts);\n  psp.ShortestPath(ofst);\n}\n\ntemplate <class Arc>\nvoid ShortestPath(\n    const Fst<Arc> &ifst,\n    const std::vector<std::pair<typename Arc::Label, typename Arc::Label>>\n        &parens,\n    MutableFst<Arc> *ofst) {\n  using Q = FifoQueue<typename Arc::StateId>;\n  const PdtShortestPathOptions<Arc, Q> opts;\n  PdtShortestPath<Arc, Q> psp(ifst, parens, opts);\n  psp.ShortestPath(ofst);\n}\n\n}  // namespace fst\n\n#endif  // FST_EXTENSIONS_PDT_SHORTEST_PATH_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/extensions/special/phi-fst.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#ifndef FST_EXTENSIONS_SPECIAL_PHI_FST_H_\n#define FST_EXTENSIONS_SPECIAL_PHI_FST_H_\n\n#include <memory>\n#include <string>\n\n#include <fst/const-fst.h>\n#include <fst/matcher-fst.h>\n#include <fst/matcher.h>\n\nDECLARE_int64_t(phi_fst_phi_label);\nDECLARE_bool(phi_fst_phi_loop);\nDECLARE_string(phi_fst_rewrite_mode);\n\nnamespace fst {\nnamespace internal {\n\ntemplate <class Label>\nclass PhiFstMatcherData {\n public:\n  PhiFstMatcherData(\n      Label phi_label = FLAGS_phi_fst_phi_label,\n      bool phi_loop = FLAGS_phi_fst_phi_loop,\n      MatcherRewriteMode rewrite_mode = RewriteMode(FLAGS_phi_fst_rewrite_mode))\n      : phi_label_(phi_label),\n        phi_loop_(phi_loop),\n        rewrite_mode_(rewrite_mode) {}\n\n  PhiFstMatcherData(const PhiFstMatcherData &data)\n      : phi_label_(data.phi_label_),\n        phi_loop_(data.phi_loop_),\n        rewrite_mode_(data.rewrite_mode_) {}\n\n  static PhiFstMatcherData<Label> *Read(std::istream &istrm,\n                                        const FstReadOptions &read) {\n    auto *data = new PhiFstMatcherData<Label>();\n    ReadType(istrm, &data->phi_label_);\n    ReadType(istrm, &data->phi_loop_);\n    int32_t rewrite_mode;\n    ReadType(istrm, &rewrite_mode);\n    data->rewrite_mode_ = static_cast<MatcherRewriteMode>(rewrite_mode);\n    return data;\n  }\n\n  bool Write(std::ostream &ostrm, const FstWriteOptions &opts) const {\n    WriteType(ostrm, phi_label_);\n    WriteType(ostrm, phi_loop_);\n    WriteType(ostrm, static_cast<int32_t>(rewrite_mode_));\n    return !ostrm ? false : true;\n  }\n\n  Label PhiLabel() const { return phi_label_; }\n\n  bool PhiLoop() const { return phi_loop_; }\n\n  MatcherRewriteMode RewriteMode() const { return rewrite_mode_; }\n\n private:\n  static MatcherRewriteMode RewriteMode(const string &mode) {\n    if (mode == \"auto\") return MATCHER_REWRITE_AUTO;\n    if (mode == \"always\") return MATCHER_REWRITE_ALWAYS;\n    if (mode == \"never\") return MATCHER_REWRITE_NEVER;\n    LOG(WARNING) << \"PhiFst: Unknown rewrite mode: \" << mode << \". \"\n                 << \"Defaulting to auto.\";\n    return MATCHER_REWRITE_AUTO;\n  }\n\n  Label phi_label_;\n  bool phi_loop_;\n  MatcherRewriteMode rewrite_mode_;\n};\n\n}  // namespace internal\n\nconstexpr uint8_t kPhiFstMatchInput = 0x01;   // Input matcher is PhiMatcher.\nconstexpr uint8_t kPhiFstMatchOutput = 0x02;  // Output matcher is PhiMatcher.\n\ntemplate <class M, uint8_t flags = kPhiFstMatchInput | kPhiFstMatchOutput>\nclass PhiFstMatcher : public PhiMatcher<M> {\n public:\n  using FST = typename M::FST;\n  using Arc = typename M::Arc;\n  using StateId = typename Arc::StateId;\n  using Label = typename Arc::Label;\n  using Weight = typename Arc::Weight;\n  using MatcherData = internal::PhiFstMatcherData<Label>;\n\n  enum : uint8_t { kFlags = flags };\n\n  // This makes a copy of the FST.\n  PhiFstMatcher(const FST &fst, MatchType match_type,\n      std::shared_ptr<MatcherData> data = std::make_shared<MatcherData>())\n      : PhiMatcher<M>(fst, match_type,\n                      PhiLabel(match_type, data ? data->PhiLabel()\n                                                : MatcherData().PhiLabel()),\n                      data ? data->PhiLoop() : MatcherData().PhiLoop(),\n                      data ? data->RewriteMode() : MatcherData().RewriteMode()),\n        data_(data) {}\n\n  // This doesn't copy the FST.\n  PhiFstMatcher(const FST *fst, MatchType match_type,\n      std::shared_ptr<MatcherData> data = std::make_shared<MatcherData>())\n      : PhiMatcher<M>(fst, match_type,\n                      PhiLabel(match_type, data ? data->PhiLabel()\n                                                : MatcherData().PhiLabel()),\n                      data ? data->PhiLoop() : MatcherData().PhiLoop(),\n                      data ? data->RewriteMode() : MatcherData().RewriteMode()),\n        data_(data) {}\n\n  // This makes a copy of the FST.\n  PhiFstMatcher(const PhiFstMatcher<M, flags> &matcher, bool safe = false)\n      : PhiMatcher<M>(matcher, safe), data_(matcher.data_) {}\n\n  PhiFstMatcher<M, flags> *Copy(bool safe = false) const override {\n    return new PhiFstMatcher<M, flags>(*this, safe);\n  }\n\n  const MatcherData *GetData() const { return data_.get(); }\n\n  std::shared_ptr<MatcherData> GetSharedData() const { return data_; }\n\n private:\n  static Label PhiLabel(MatchType match_type, Label label) {\n    if (match_type == MATCH_INPUT && flags & kPhiFstMatchInput) return label;\n    if (match_type == MATCH_OUTPUT && flags & kPhiFstMatchOutput) return label;\n    return kNoLabel;\n  }\n\n  std::shared_ptr<MatcherData> data_;\n};\n\nextern const char phi_fst_type[];\nextern const char input_phi_fst_type[];\nextern const char output_phi_fst_type[];\n\nusing StdPhiFst =\n    MatcherFst<ConstFst<StdArc>, PhiFstMatcher<SortedMatcher<ConstFst<StdArc>>>,\n               phi_fst_type>;\n\nusing LogPhiFst =\n    MatcherFst<ConstFst<LogArc>, PhiFstMatcher<SortedMatcher<ConstFst<LogArc>>>,\n               phi_fst_type>;\n\nusing Log64PhiFst = MatcherFst<ConstFst<Log64Arc>,\n                               PhiFstMatcher<SortedMatcher<ConstFst<Log64Arc>>>,\n                               input_phi_fst_type>;\n\nusing StdInputPhiFst =\n    MatcherFst<ConstFst<StdArc>, PhiFstMatcher<SortedMatcher<ConstFst<StdArc>>,\n                                               kPhiFstMatchInput>,\n               input_phi_fst_type>;\n\nusing LogInputPhiFst =\n    MatcherFst<ConstFst<LogArc>, PhiFstMatcher<SortedMatcher<ConstFst<LogArc>>,\n                                               kPhiFstMatchInput>,\n               input_phi_fst_type>;\n\nusing Log64InputPhiFst = MatcherFst<\n    ConstFst<Log64Arc>,\n    PhiFstMatcher<SortedMatcher<ConstFst<Log64Arc>>, kPhiFstMatchInput>,\n    input_phi_fst_type>;\n\nusing StdOutputPhiFst =\n    MatcherFst<ConstFst<StdArc>, PhiFstMatcher<SortedMatcher<ConstFst<StdArc>>,\n                                               kPhiFstMatchOutput>,\n               output_phi_fst_type>;\n\nusing LogOutputPhiFst =\n    MatcherFst<ConstFst<LogArc>, PhiFstMatcher<SortedMatcher<ConstFst<LogArc>>,\n                                               kPhiFstMatchOutput>,\n               output_phi_fst_type>;\n\nusing Log64OutputPhiFst = MatcherFst<\n    ConstFst<Log64Arc>,\n    PhiFstMatcher<SortedMatcher<ConstFst<Log64Arc>>, kPhiFstMatchOutput>,\n    output_phi_fst_type>;\n\n}  // namespace fst\n\n#endif  // FST_EXTENSIONS_SPECIAL_PHI_FST_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/extensions/special/rho-fst.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#ifndef FST_EXTENSIONS_SPECIAL_RHO_FST_H_\n#define FST_EXTENSIONS_SPECIAL_RHO_FST_H_\n\n#include <memory>\n#include <string>\n\n#include <fst/const-fst.h>\n#include <fst/matcher-fst.h>\n#include <fst/matcher.h>\n\nDECLARE_int64_t(rho_fst_rho_label);\nDECLARE_string(rho_fst_rewrite_mode);\n\nnamespace fst {\nnamespace internal {\n\ntemplate <class Label>\nclass RhoFstMatcherData {\n public:\n  explicit RhoFstMatcherData(\n      Label rho_label = FLAGS_rho_fst_rho_label,\n      MatcherRewriteMode rewrite_mode = RewriteMode(FLAGS_rho_fst_rewrite_mode))\n      : rho_label_(rho_label), rewrite_mode_(rewrite_mode) {}\n\n  RhoFstMatcherData(const RhoFstMatcherData &data)\n      : rho_label_(data.rho_label_), rewrite_mode_(data.rewrite_mode_) {}\n\n  static RhoFstMatcherData<Label> *Read(std::istream &istrm,\n                                    const FstReadOptions &read) {\n    auto *data = new RhoFstMatcherData<Label>();\n    ReadType(istrm, &data->rho_label_);\n    int32_t rewrite_mode;\n    ReadType(istrm, &rewrite_mode);\n    data->rewrite_mode_ = static_cast<MatcherRewriteMode>(rewrite_mode);\n    return data;\n  }\n\n  bool Write(std::ostream &ostrm, const FstWriteOptions &opts) const {\n    WriteType(ostrm, rho_label_);\n    WriteType(ostrm, static_cast<int32_t>(rewrite_mode_));\n    return !ostrm ? false : true;\n  }\n\n  Label RhoLabel() const { return rho_label_; }\n\n  MatcherRewriteMode RewriteMode() const { return rewrite_mode_; }\n\n private:\n  static MatcherRewriteMode RewriteMode(const string &mode) {\n    if (mode == \"auto\") return MATCHER_REWRITE_AUTO;\n    if (mode == \"always\") return MATCHER_REWRITE_ALWAYS;\n    if (mode == \"never\") return MATCHER_REWRITE_NEVER;\n    LOG(WARNING) << \"RhoFst: Unknown rewrite mode: \" << mode << \". \"\n                 << \"Defaulting to auto.\";\n    return MATCHER_REWRITE_AUTO;\n  }\n\n  Label rho_label_;\n  MatcherRewriteMode rewrite_mode_;\n};\n\n}  // namespace internal\n\nconstexpr uint8_t kRhoFstMatchInput = 0x01;   // Input matcher is RhoMatcher.\nconstexpr uint8_t kRhoFstMatchOutput = 0x02;  // Output matcher is RhoMatcher.\n\ntemplate <class M, uint8_t flags = kRhoFstMatchInput | kRhoFstMatchOutput>\nclass RhoFstMatcher : public RhoMatcher<M> {\n public:\n  using FST = typename M::FST;\n  using Arc = typename M::Arc;\n  using StateId = typename Arc::StateId;\n  using Label = typename Arc::Label;\n  using Weight = typename Arc::Weight;\n  using MatcherData = internal::RhoFstMatcherData<Label>;\n\n  enum : uint8_t { kFlags = flags };\n\n  // This makes a copy of the FST.\n  RhoFstMatcher(\n      const FST &fst, MatchType match_type,\n      std::shared_ptr<MatcherData> data = std::make_shared<MatcherData>())\n      : RhoMatcher<M>(fst, match_type,\n                      RhoLabel(match_type, data ? data->RhoLabel()\n                                                : MatcherData().RhoLabel()),\n                      data ? data->RewriteMode() : MatcherData().RewriteMode()),\n        data_(data) {}\n\n  // This doesn't copy the FST.\n  RhoFstMatcher(\n      const FST *fst, MatchType match_type,\n      std::shared_ptr<MatcherData> data = std::make_shared<MatcherData>())\n      : RhoMatcher<M>(fst, match_type,\n                      RhoLabel(match_type, data ? data->RhoLabel()\n                                                : MatcherData().RhoLabel()),\n                      data ? data->RewriteMode() : MatcherData().RewriteMode()),\n        data_(data) {}\n\n  // This makes a copy of the FST.\n  RhoFstMatcher(const RhoFstMatcher<M, flags> &matcher, bool safe = false)\n      : RhoMatcher<M>(matcher, safe), data_(matcher.data_) {}\n\n  RhoFstMatcher<M, flags> *Copy(bool safe = false) const override {\n    return new RhoFstMatcher<M, flags>(*this, safe);\n  }\n\n  const MatcherData *GetData() const { return data_.get(); }\n\n  std::shared_ptr<MatcherData> GetSharedData() const { return data_; }\n\n private:\n  static Label RhoLabel(MatchType match_type, Label label) {\n    if (match_type == MATCH_INPUT && flags & kRhoFstMatchInput) return label;\n    if (match_type == MATCH_OUTPUT && flags & kRhoFstMatchOutput) return label;\n    return kNoLabel;\n  }\n\n  std::shared_ptr<MatcherData> data_;\n};\n\nextern const char rho_fst_type[];\nextern const char input_rho_fst_type[];\nextern const char output_rho_fst_type[];\n\nusing StdRhoFst =\n    MatcherFst<ConstFst<StdArc>, RhoFstMatcher<SortedMatcher<ConstFst<StdArc>>>,\n               rho_fst_type>;\n\nusing LogRhoFst =\n    MatcherFst<ConstFst<LogArc>, RhoFstMatcher<SortedMatcher<ConstFst<LogArc>>>,\n               rho_fst_type>;\n\nusing Log64RhoFst = MatcherFst<ConstFst<Log64Arc>,\n                               RhoFstMatcher<SortedMatcher<ConstFst<Log64Arc>>>,\n                               input_rho_fst_type>;\n\nusing StdInputRhoFst =\n    MatcherFst<ConstFst<StdArc>, RhoFstMatcher<SortedMatcher<ConstFst<StdArc>>,\n                                               kRhoFstMatchInput>,\n               input_rho_fst_type>;\n\nusing LogInputRhoFst =\n    MatcherFst<ConstFst<LogArc>, RhoFstMatcher<SortedMatcher<ConstFst<LogArc>>,\n                                               kRhoFstMatchInput>,\n               input_rho_fst_type>;\n\nusing Log64InputRhoFst = MatcherFst<\n    ConstFst<Log64Arc>,\n    RhoFstMatcher<SortedMatcher<ConstFst<Log64Arc>>, kRhoFstMatchInput>,\n    input_rho_fst_type>;\n\nusing StdOutputRhoFst =\n    MatcherFst<ConstFst<StdArc>, RhoFstMatcher<SortedMatcher<ConstFst<StdArc>>,\n                                               kRhoFstMatchOutput>,\n               output_rho_fst_type>;\n\nusing LogOutputRhoFst =\n    MatcherFst<ConstFst<LogArc>, RhoFstMatcher<SortedMatcher<ConstFst<LogArc>>,\n                                               kRhoFstMatchOutput>,\n               output_rho_fst_type>;\n\nusing Log64OutputRhoFst = MatcherFst<\n    ConstFst<Log64Arc>,\n    RhoFstMatcher<SortedMatcher<ConstFst<Log64Arc>>, kRhoFstMatchOutput>,\n    output_rho_fst_type>;\n\n}  // namespace fst\n\n#endif  // FST_EXTENSIONS_SPECIAL_RHO_FST_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/extensions/special/sigma-fst.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#ifndef FST_EXTENSIONS_SPECIAL_SIGMA_FST_H_\n#define FST_EXTENSIONS_SPECIAL_SIGMA_FST_H_\n\n#include <memory>\n#include <string>\n\n#include <fst/const-fst.h>\n#include <fst/matcher-fst.h>\n#include <fst/matcher.h>\n\nDECLARE_int64_t(sigma_fst_sigma_label);\nDECLARE_string(sigma_fst_rewrite_mode);\n\nnamespace fst {\nnamespace internal {\n\ntemplate <class Label>\nclass SigmaFstMatcherData {\n public:\n  explicit SigmaFstMatcherData(Label sigma_label = FLAGS_sigma_fst_sigma_label,\n      MatcherRewriteMode rewrite_mode =\n                          RewriteMode(FLAGS_sigma_fst_rewrite_mode))\n      : sigma_label_(sigma_label), rewrite_mode_(rewrite_mode) {}\n\n  SigmaFstMatcherData(const SigmaFstMatcherData &data)\n      : sigma_label_(data.sigma_label_), rewrite_mode_(data.rewrite_mode_) {}\n\n  static SigmaFstMatcherData<Label> *Read(std::istream &istrm,\n                                      const FstReadOptions &read) {\n    auto *data = new SigmaFstMatcherData<Label>();\n    ReadType(istrm, &data->sigma_label_);\n    int32_t rewrite_mode;\n    ReadType(istrm, &rewrite_mode);\n    data->rewrite_mode_ = static_cast<MatcherRewriteMode>(rewrite_mode);\n    return data;\n  }\n\n  bool Write(std::ostream &ostrm, const FstWriteOptions &opts) const {\n    WriteType(ostrm, sigma_label_);\n    WriteType(ostrm, static_cast<int32_t>(rewrite_mode_));\n    return !ostrm ? false : true;\n  }\n\n  Label SigmaLabel() const { return sigma_label_; }\n\n  MatcherRewriteMode RewriteMode() const { return rewrite_mode_; }\n\n private:\n  static MatcherRewriteMode RewriteMode(const string &mode) {\n    if (mode == \"auto\") return MATCHER_REWRITE_AUTO;\n    if (mode == \"always\") return MATCHER_REWRITE_ALWAYS;\n    if (mode == \"never\") return MATCHER_REWRITE_NEVER;\n    LOG(WARNING) << \"SigmaFst: Unknown rewrite mode: \" << mode << \". \"\n                 << \"Defaulting to auto.\";\n    return MATCHER_REWRITE_AUTO;\n  }\n\n  Label sigma_label_;\n  MatcherRewriteMode rewrite_mode_;\n};\n\n}  // namespace internal\n\nconstexpr uint8_t kSigmaFstMatchInput = 0x01;   // Input matcher is SigmaMatcher.\nconstexpr uint8_t kSigmaFstMatchOutput = 0x02;  // Output matcher is SigmaMatcher.\n\ntemplate <class M, uint8_t flags = kSigmaFstMatchInput | kSigmaFstMatchOutput>\nclass SigmaFstMatcher : public SigmaMatcher<M> {\n public:\n  using FST = typename M::FST;\n  using Arc = typename M::Arc;\n  using StateId = typename Arc::StateId;\n  using Label = typename Arc::Label;\n  using Weight = typename Arc::Weight;\n  using MatcherData = internal::SigmaFstMatcherData<Label>;\n\n  enum : uint8_t { kFlags = flags };\n\n  // This makes a copy of the FST.\n  SigmaFstMatcher(\n      const FST &fst, MatchType match_type,\n      std::shared_ptr<MatcherData> data = std::make_shared<MatcherData>())\n      : SigmaMatcher<M>(\n            fst, match_type,\n            SigmaLabel(match_type,\n                       data ? data->SigmaLabel() : MatcherData().SigmaLabel()),\n            data ? data->RewriteMode() : MatcherData().RewriteMode()),\n        data_(data) {}\n\n  // This doesn't copy the FST.\n  SigmaFstMatcher(\n      const FST *fst, MatchType match_type,\n      std::shared_ptr<MatcherData> data = std::make_shared<MatcherData>())\n      : SigmaMatcher<M>(\n            fst, match_type,\n            SigmaLabel(match_type,\n                       data ? data->SigmaLabel() : MatcherData().SigmaLabel()),\n            data ? data->RewriteMode() : MatcherData().RewriteMode()),\n        data_(data) {}\n\n  // This makes a copy of the FST.\n  SigmaFstMatcher(const SigmaFstMatcher<M, flags> &matcher, bool safe = false)\n      : SigmaMatcher<M>(matcher, safe), data_(matcher.data_) {}\n\n  SigmaFstMatcher<M, flags> *Copy(bool safe = false) const override {\n    return new SigmaFstMatcher<M, flags>(*this, safe);\n  }\n\n  const MatcherData *GetData() const { return data_.get(); }\n\n  std::shared_ptr<MatcherData> GetSharedData() const { return data_; }\n\n private:\n  static Label SigmaLabel(MatchType match_type, Label label) {\n    if (match_type == MATCH_INPUT && flags & kSigmaFstMatchInput) return label;\n    if (match_type == MATCH_OUTPUT && flags & kSigmaFstMatchOutput)\n      return label;\n    return kNoLabel;\n  }\n\n  std::shared_ptr<MatcherData> data_;\n};\n\nextern const char sigma_fst_type[];\nextern const char input_sigma_fst_type[];\nextern const char output_sigma_fst_type[];\n\nusing StdSigmaFst = MatcherFst<ConstFst<StdArc>,\n                               SigmaFstMatcher<SortedMatcher<ConstFst<StdArc>>>,\n                               sigma_fst_type>;\n\nusing LogSigmaFst = MatcherFst<ConstFst<LogArc>,\n                               SigmaFstMatcher<SortedMatcher<ConstFst<LogArc>>>,\n                               sigma_fst_type>;\n\nusing Log64SigmaFst =\n    MatcherFst<ConstFst<Log64Arc>,\n               SigmaFstMatcher<SortedMatcher<ConstFst<Log64Arc>>>,\n               input_sigma_fst_type>;\n\nusing StdInputSigmaFst = MatcherFst<\n    ConstFst<StdArc>,\n    SigmaFstMatcher<SortedMatcher<ConstFst<StdArc>>, kSigmaFstMatchInput>,\n    input_sigma_fst_type>;\n\nusing LogInputSigmaFst = MatcherFst<\n    ConstFst<LogArc>,\n    SigmaFstMatcher<SortedMatcher<ConstFst<LogArc>>, kSigmaFstMatchInput>,\n    input_sigma_fst_type>;\n\nusing Log64InputSigmaFst = MatcherFst<\n    ConstFst<Log64Arc>,\n    SigmaFstMatcher<SortedMatcher<ConstFst<Log64Arc>>, kSigmaFstMatchInput>,\n    input_sigma_fst_type>;\n\nusing StdOutputSigmaFst = MatcherFst<\n    ConstFst<StdArc>,\n    SigmaFstMatcher<SortedMatcher<ConstFst<StdArc>>, kSigmaFstMatchOutput>,\n    output_sigma_fst_type>;\n\nusing LogOutputSigmaFst = MatcherFst<\n    ConstFst<LogArc>,\n    SigmaFstMatcher<SortedMatcher<ConstFst<LogArc>>, kSigmaFstMatchOutput>,\n    output_sigma_fst_type>;\n\nusing Log64OutputSigmaFst = MatcherFst<\n    ConstFst<Log64Arc>,\n    SigmaFstMatcher<SortedMatcher<ConstFst<Log64Arc>>, kSigmaFstMatchOutput>,\n    output_sigma_fst_type>;\n\n}  // namespace fst\n\n#endif  // FST_EXTENSIONS_SPECIAL_SIGMA_FST_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/factor-weight.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Classes to factor weights in an FST.\n\n#ifndef FST_FACTOR_WEIGHT_H_\n#define FST_FACTOR_WEIGHT_H_\n\n#include <algorithm>\n#include <string>\n#include <unordered_map>\n#include <utility>\n#include <vector>\n\n#include <fst/log.h>\n\n#include <fst/cache.h>\n#include <fst/test-properties.h>\n\n\nnamespace fst {\n\nconstexpr uint32_t kFactorFinalWeights = 0x00000001;\nconstexpr uint32_t kFactorArcWeights = 0x00000002;\n\ntemplate <class Arc>\nstruct FactorWeightOptions : CacheOptions {\n  using Label = typename Arc::Label;\n\n  float delta;\n  uint32_t mode;         // Factor arc weights and/or final weights.\n  Label final_ilabel;  // Input label of arc when factoring final weights.\n  Label final_olabel;  // Output label of arc when factoring final weights.\n  bool increment_final_ilabel;  // When factoring final w' results in > 1 arcs\n  bool increment_final_olabel;  // at state, increment labels to make distinct?\n\n  explicit FactorWeightOptions(const CacheOptions &opts, float delta = kDelta,\n                               uint32_t mode = kFactorArcWeights |\n                                             kFactorFinalWeights,\n                               Label final_ilabel = 0, Label final_olabel = 0,\n                               bool increment_final_ilabel = false,\n                               bool increment_final_olabel = false)\n      : CacheOptions(opts),\n        delta(delta),\n        mode(mode),\n        final_ilabel(final_ilabel),\n        final_olabel(final_olabel),\n        increment_final_ilabel(increment_final_ilabel),\n        increment_final_olabel(increment_final_olabel) {}\n\n  explicit FactorWeightOptions(float delta = kDelta,\n                               uint32_t mode = kFactorArcWeights |\n                                             kFactorFinalWeights,\n                               Label final_ilabel = 0, Label final_olabel = 0,\n                               bool increment_final_ilabel = false,\n                               bool increment_final_olabel = false)\n      : delta(delta),\n        mode(mode),\n        final_ilabel(final_ilabel),\n        final_olabel(final_olabel),\n        increment_final_ilabel(increment_final_ilabel),\n        increment_final_olabel(increment_final_olabel) {}\n};\n\n// A factor iterator takes as argument a weight w and returns a sequence of\n// pairs of weights (xi, yi) such that the sum of the products xi times yi is\n// equal to w. If w is fully factored, the iterator should return nothing.\n//\n// template <class W>\n// class FactorIterator {\n//  public:\n//   explicit FactorIterator(W w);\n//\n//   bool Done() const;\n//\n//   void Next();\n//\n//   std::pair<W, W> Value() const;\n//\n//   void Reset();\n// }\n\n// Factors trivially.\ntemplate <class W>\nclass IdentityFactor {\n public:\n  explicit IdentityFactor(const W &weight) {}\n\n  bool Done() const { return true; }\n\n  void Next() {}\n\n  std::pair<W, W> Value() const { return std::make_pair(W::One(), W::One()); }\n\n  void Reset() {}\n};\n\n// Factors a StringWeight w as 'ab' where 'a' is a label.\ntemplate <typename Label, StringType S = STRING_LEFT>\nclass StringFactor {\n public:\n  explicit StringFactor(const StringWeight<Label, S> &weight)\n      : weight_(weight), done_(weight.Size() <= 1) {}\n\n  bool Done() const { return done_; }\n\n  void Next() { done_ = true; }\n\n  std::pair<StringWeight<Label, S>, StringWeight<Label, S>> Value() const {\n    using Weight = StringWeight<Label, S>;\n    typename Weight::Iterator siter(weight_);\n    Weight w1(siter.Value());\n    Weight w2;\n    for (siter.Next(); !siter.Done(); siter.Next()) w2.PushBack(siter.Value());\n    return std::make_pair(w1, w2);\n  }\n\n  void Reset() { done_ = weight_.Size() <= 1; }\n\n private:\n  const StringWeight<Label, S> weight_;\n  bool done_;\n};\n\n// Factor a GallicWeight using StringFactor.\ntemplate <class Label, class W, GallicType G = GALLIC_LEFT>\nclass GallicFactor {\n public:\n  using GW = GallicWeight<Label, W, G>;\n\n  explicit GallicFactor(const GW &weight)\n      : weight_(weight), done_(weight.Value1().Size() <= 1) {}\n\n  bool Done() const { return done_; }\n\n  void Next() { done_ = true; }\n\n  std::pair<GW, GW> Value() const {\n    StringFactor<Label, GallicStringType(G)> siter(weight_.Value1());\n    GW w1(siter.Value().first, weight_.Value2());\n    GW w2(siter.Value().second, W::One());\n    return std::make_pair(w1, w2);\n  }\n\n  void Reset() { done_ = weight_.Value1().Size() <= 1; }\n\n private:\n  const GW weight_;\n  bool done_;\n};\n\n// Specialization for the (general) GALLIC type GallicWeight.\ntemplate <class Label, class W>\nclass GallicFactor<Label, W, GALLIC> {\n public:\n  using GW = GallicWeight<Label, W, GALLIC>;\n  using GRW = GallicWeight<Label, W, GALLIC_RESTRICT>;\n\n  explicit GallicFactor(const GW &weight)\n      : iter_(weight),\n        done_(weight.Size() == 0 ||\n              (weight.Size() == 1 && weight.Back().Value1().Size() <= 1)) {}\n\n  bool Done() const { return done_ || iter_.Done(); }\n\n  void Next() { iter_.Next(); }\n\n  void Reset() { iter_.Reset(); }\n\n  std::pair<GW, GW> Value() const {\n    const auto weight = iter_.Value();\n    StringFactor<Label, GallicStringType(GALLIC_RESTRICT)> siter(\n        weight.Value1());\n    GRW w1(siter.Value().first, weight.Value2());\n    GRW w2(siter.Value().second, W::One());\n    return std::make_pair(GW(w1), GW(w2));\n  }\n\n private:\n  UnionWeightIterator<GRW, GallicUnionWeightOptions<Label, W>> iter_;\n  bool done_;\n};\n\nnamespace internal {\n\n// Implementation class for FactorWeight\ntemplate <class Arc, class FactorIterator>\nclass FactorWeightFstImpl : public CacheImpl<Arc> {\n public:\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using FstImpl<Arc>::SetType;\n  using FstImpl<Arc>::SetProperties;\n  using FstImpl<Arc>::SetInputSymbols;\n  using FstImpl<Arc>::SetOutputSymbols;\n\n  using CacheBaseImpl<CacheState<Arc>>::PushArc;\n  using CacheBaseImpl<CacheState<Arc>>::HasStart;\n  using CacheBaseImpl<CacheState<Arc>>::HasFinal;\n  using CacheBaseImpl<CacheState<Arc>>::HasArcs;\n  using CacheBaseImpl<CacheState<Arc>>::SetArcs;\n  using CacheBaseImpl<CacheState<Arc>>::SetFinal;\n  using CacheBaseImpl<CacheState<Arc>>::SetStart;\n\n  struct Element {\n    Element() {}\n\n    Element(StateId s, Weight weight_) : state(s), weight(std::move(weight_)) {}\n\n    StateId state;  // Input state ID.\n    Weight weight;  // Residual weight.\n  };\n\n  FactorWeightFstImpl(const Fst<Arc> &fst, const FactorWeightOptions<Arc> &opts)\n      : CacheImpl<Arc>(opts),\n        fst_(fst.Copy()),\n        delta_(opts.delta),\n        mode_(opts.mode),\n        final_ilabel_(opts.final_ilabel),\n        final_olabel_(opts.final_olabel),\n        increment_final_ilabel_(opts.increment_final_ilabel),\n        increment_final_olabel_(opts.increment_final_olabel) {\n    SetType(\"factor_weight\");\n    const auto props = fst.Properties(kFstProperties, false);\n    SetProperties(FactorWeightProperties(props), kCopyProperties);\n    SetInputSymbols(fst.InputSymbols());\n    SetOutputSymbols(fst.OutputSymbols());\n    if (mode_ == 0) {\n      LOG(WARNING) << \"FactorWeightFst: Factor mode is set to 0; \"\n                   << \"factoring neither arc weights nor final weights\";\n    }\n  }\n\n  FactorWeightFstImpl(const FactorWeightFstImpl<Arc, FactorIterator> &impl)\n      : CacheImpl<Arc>(impl),\n        fst_(impl.fst_->Copy(true)),\n        delta_(impl.delta_),\n        mode_(impl.mode_),\n        final_ilabel_(impl.final_ilabel_),\n        final_olabel_(impl.final_olabel_),\n        increment_final_ilabel_(impl.increment_final_ilabel_),\n        increment_final_olabel_(impl.increment_final_olabel_) {\n    SetType(\"factor_weight\");\n    SetProperties(impl.Properties(), kCopyProperties);\n    SetInputSymbols(impl.InputSymbols());\n    SetOutputSymbols(impl.OutputSymbols());\n  }\n\n  StateId Start() {\n    if (!HasStart()) {\n      const auto s = fst_->Start();\n      if (s == kNoStateId) return kNoStateId;\n      SetStart(FindState(Element(fst_->Start(), Weight::One())));\n    }\n    return CacheImpl<Arc>::Start();\n  }\n\n  Weight Final(StateId s) {\n    if (!HasFinal(s)) {\n      const auto &element = elements_[s];\n      // TODO(sorenj): fix so cast is unnecessary\n      const auto weight =\n          element.state == kNoStateId\n              ? element.weight\n              : (Weight)Times(element.weight, fst_->Final(element.state));\n      FactorIterator siter(weight);\n      if (!(mode_ & kFactorFinalWeights) || siter.Done()) {\n        SetFinal(s, weight);\n      } else {\n        SetFinal(s, Weight::Zero());\n      }\n    }\n    return CacheImpl<Arc>::Final(s);\n  }\n\n  size_t NumArcs(StateId s) {\n    if (!HasArcs(s)) Expand(s);\n    return CacheImpl<Arc>::NumArcs(s);\n  }\n\n  size_t NumInputEpsilons(StateId s) {\n    if (!HasArcs(s)) Expand(s);\n    return CacheImpl<Arc>::NumInputEpsilons(s);\n  }\n\n  size_t NumOutputEpsilons(StateId s) {\n    if (!HasArcs(s)) Expand(s);\n    return CacheImpl<Arc>::NumOutputEpsilons(s);\n  }\n\n  uint64_t Properties() const override { return Properties(kFstProperties); }\n\n  // Sets error if found, and returns other FST impl properties.\n  uint64_t Properties(uint64_t mask) const override {\n    if ((mask & kError) && fst_->Properties(kError, false)) {\n      SetProperties(kError, kError);\n    }\n    return FstImpl<Arc>::Properties(mask);\n  }\n\n  void InitArcIterator(StateId s, ArcIteratorData<Arc> *data) {\n    if (!HasArcs(s)) Expand(s);\n    CacheImpl<Arc>::InitArcIterator(s, data);\n  }\n\n  // Finds state corresponding to an element, creating new state if element not\n  // found.\n  StateId FindState(const Element &element) {\n    if (!(mode_ & kFactorArcWeights) && element.weight == Weight::One() &&\n        element.state != kNoStateId) {\n      while (unfactored_.size() <= element.state)\n        unfactored_.push_back(kNoStateId);\n      if (unfactored_[element.state] == kNoStateId) {\n        unfactored_[element.state] = elements_.size();\n        elements_.push_back(element);\n      }\n      return unfactored_[element.state];\n    } else {\n      const auto insert_result =\n          element_map_.insert(std::make_pair(element, elements_.size()));\n      if (insert_result.second) {\n        elements_.push_back(element);\n      }\n      return insert_result.first->second;\n    }\n  }\n\n  // Computes the outgoing transitions from a state, creating new destination\n  // states as needed.\n  void Expand(StateId s) {\n    const auto element = elements_[s];\n    if (element.state != kNoStateId) {\n      for (ArcIterator<Fst<Arc>> ait(*fst_, element.state); !ait.Done();\n           ait.Next()) {\n        const auto &arc = ait.Value();\n        const auto weight = Times(element.weight, arc.weight);\n        FactorIterator fiter(weight);\n        if (!(mode_ & kFactorArcWeights) || fiter.Done()) {\n          const auto dest = FindState(Element(arc.nextstate, Weight::One()));\n          PushArc(s, Arc(arc.ilabel, arc.olabel, weight, dest));\n        } else {\n          for (; !fiter.Done(); fiter.Next()) {\n            const auto &pair = fiter.Value();\n            const auto dest =\n                FindState(Element(arc.nextstate, pair.second.Quantize(delta_)));\n            PushArc(s, Arc(arc.ilabel, arc.olabel, pair.first, dest));\n          }\n        }\n      }\n    }\n    if ((mode_ & kFactorFinalWeights) &&\n        ((element.state == kNoStateId) ||\n         (fst_->Final(element.state) != Weight::Zero()))) {\n      const auto weight =\n          element.state == kNoStateId\n              ? element.weight\n              : Times(element.weight, fst_->Final(element.state));\n      auto ilabel = final_ilabel_;\n      auto olabel = final_olabel_;\n      for (FactorIterator fiter(weight); !fiter.Done(); fiter.Next()) {\n        const auto &pair = fiter.Value();\n        const auto dest =\n            FindState(Element(kNoStateId, pair.second.Quantize(delta_)));\n        PushArc(s, Arc(ilabel, olabel, pair.first, dest));\n        if (increment_final_ilabel_) ++ilabel;\n        if (increment_final_olabel_) ++olabel;\n      }\n    }\n    SetArcs(s);\n  }\n\n private:\n  // Equality function for Elements, assume weights have been quantized.\n  class ElementEqual {\n   public:\n    bool operator()(const Element &x, const Element &y) const {\n      return x.state == y.state && x.weight == y.weight;\n    }\n  };\n\n  // Hash function for Elements to Fst states.\n  class ElementKey {\n   public:\n    size_t operator()(const Element &x) const {\n      static constexpr auto prime = 7853;\n      return static_cast<size_t>(x.state * prime + x.weight.Hash());\n    }\n  };\n\n  using ElementMap =\n      std::unordered_map<Element, StateId, ElementKey, ElementEqual>;\n\n  std::unique_ptr<const Fst<Arc>> fst_;\n  float delta_;\n  uint32_t mode_;         // Factoring arc and/or final weights.\n  Label final_ilabel_;  // ilabel of arc created when factoring final weights.\n  Label final_olabel_;  // olabel of arc created when factoring final weights.\n  bool increment_final_ilabel_;    // When factoring final weights results in\n  bool increment_final_olabel_;    // mutiple arcs, increment labels?\n  std::vector<Element> elements_;  // mapping from FST state to Element.\n  ElementMap element_map_;         // mapping from Element to FST state.\n  // Mapping between old/new StateId for states that do not need to be factored\n  // when mode_ is 0 or kFactorFinalWeights.\n  std::vector<StateId> unfactored_;\n};\n\n}  // namespace internal\n\n// FactorWeightFst takes as template parameter a FactorIterator as defined\n// above. The result of weight factoring is a transducer equivalent to the\n// input whose path weights have been factored according to the FactorIterator.\n// States and transitions will be added as necessary. The algorithm is a\n// generalization to arbitrary weights of the second step of the input\n// epsilon-normalization algorithm.\n//\n// This class attaches interface to implementation and handles reference\n// counting, delegating most methods to ImplToFst.\ntemplate <class A, class FactorIterator>\nclass FactorWeightFst\n    : public ImplToFst<internal::FactorWeightFstImpl<A, FactorIterator>> {\n public:\n  using Arc = A;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using Store = DefaultCacheStore<Arc>;\n  using State = typename Store::State;\n  using Impl = internal::FactorWeightFstImpl<Arc, FactorIterator>;\n\n  friend class ArcIterator<FactorWeightFst<Arc, FactorIterator>>;\n  friend class StateIterator<FactorWeightFst<Arc, FactorIterator>>;\n\n  explicit FactorWeightFst(const Fst<Arc> &fst)\n      : ImplToFst<Impl>(\n            std::make_shared<Impl>(fst, FactorWeightOptions<Arc>())) {}\n\n  FactorWeightFst(const Fst<Arc> &fst, const FactorWeightOptions<Arc> &opts)\n      : ImplToFst<Impl>(std::make_shared<Impl>(fst, opts)) {}\n\n  // See Fst<>::Copy() for doc.\n  FactorWeightFst(const FactorWeightFst<Arc, FactorIterator> &fst, bool copy)\n      : ImplToFst<Impl>(fst, copy) {}\n\n  // Get a copy of this FactorWeightFst. See Fst<>::Copy() for further doc.\n  FactorWeightFst<Arc, FactorIterator> *Copy(bool copy = false) const override {\n    return new FactorWeightFst<Arc, FactorIterator>(*this, copy);\n  }\n\n  inline void InitStateIterator(StateIteratorData<Arc> *data) const override;\n\n  void InitArcIterator(StateId s, ArcIteratorData<Arc> *data) const override {\n    GetMutableImpl()->InitArcIterator(s, data);\n  }\n\n private:\n  using ImplToFst<Impl>::GetImpl;\n  using ImplToFst<Impl>::GetMutableImpl;\n\n  FactorWeightFst &operator=(const FactorWeightFst &) = delete;\n};\n\n// Specialization for FactorWeightFst.\ntemplate <class Arc, class FactorIterator>\nclass StateIterator<FactorWeightFst<Arc, FactorIterator>>\n    : public CacheStateIterator<FactorWeightFst<Arc, FactorIterator>> {\n public:\n  explicit StateIterator(const FactorWeightFst<Arc, FactorIterator> &fst)\n      : CacheStateIterator<FactorWeightFst<Arc, FactorIterator>>(\n            fst, fst.GetMutableImpl()) {}\n};\n\n// Specialization for FactorWeightFst.\ntemplate <class Arc, class FactorIterator>\nclass ArcIterator<FactorWeightFst<Arc, FactorIterator>>\n    : public CacheArcIterator<FactorWeightFst<Arc, FactorIterator>> {\n public:\n  using StateId = typename Arc::StateId;\n\n  ArcIterator(const FactorWeightFst<Arc, FactorIterator> &fst, StateId s)\n      : CacheArcIterator<FactorWeightFst<Arc, FactorIterator>>(\n            fst.GetMutableImpl(), s) {\n    if (!fst.GetImpl()->HasArcs(s)) fst.GetMutableImpl()->Expand(s);\n  }\n};\n\ntemplate <class Arc, class FactorIterator>\ninline void FactorWeightFst<Arc, FactorIterator>::InitStateIterator(\n    StateIteratorData<Arc> *data) const {\n  data->base = new StateIterator<FactorWeightFst<Arc, FactorIterator>>(*this);\n}\n\n}  // namespace fst\n\n#endif  // FST_FACTOR_WEIGHT_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/filter-state.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Classes for storing filter state in various algorithms like composition.\n\n#ifndef FST_FILTER_STATE_H_\n#define FST_FILTER_STATE_H_\n\n#include <forward_list>\n#include <utility>\n\n#include <fst/fst-decl.h>  // For optional argument declarations\n#include <fst/fst.h>\n#include <fst/matcher.h>\n\n\nnamespace fst {\n\n// The filter state interface represents the state of a (e.g., composition)\n// filter.\n//\n// class FilterState {\n//  public:\n//   // Required constructors.\n//\n//   FilterState();\n//\n//   FilterState(const FilterState &fs);\n//\n//   // An invalid filter state.\n//   static const FilterState NoState();\n//\n//   // Maps state to integer for hashing.\n//   size_t Hash() const;\n//\n//   // Equality of filter states.\n//   bool operator==(const FilterState &fs) const;\n//\n//   // Inequality of filter states.\n//   bool operator!=(const FilterState &fs) const;\n//\n//   // Assignment to filter states.\n//   FilterState &operator=(const FilterState& fs);\n// };\n\n// Filter state that is a signed integral type.\ntemplate <typename T>\nclass IntegerFilterState {\n public:\n  IntegerFilterState() : state_(kNoStateId) {}\n\n  explicit IntegerFilterState(T s) : state_(s) {}\n\n  static const IntegerFilterState NoState() { return IntegerFilterState(); }\n\n  size_t Hash() const { return static_cast<size_t>(state_); }\n\n  bool operator==(const IntegerFilterState &fs) const {\n    return state_ == fs.state_;\n  }\n\n  bool operator!=(const IntegerFilterState &fs) const {\n    return state_ != fs.state_;\n  }\n\n  T GetState() const { return state_; }\n\n  void SetState(T state) { state_ = state; }\n\n private:\n  T state_;\n};\n\nusing CharFilterState = IntegerFilterState<signed char>;\nusing ShortFilterState = IntegerFilterState<short>;  // NOLINT\nusing IntFilterState = IntegerFilterState<int>;\n\n// Filter state that is a weight (class).\ntemplate <class W>\nclass WeightFilterState {\n public:\n  WeightFilterState() : weight_(W::Zero()) {}\n\n  explicit WeightFilterState(W weight) : weight_(std::move(weight)) {}\n\n  static const WeightFilterState NoState() { return WeightFilterState(); }\n\n  size_t Hash() const { return weight_.Hash(); }\n\n  bool operator==(const WeightFilterState &fs) const {\n    return weight_ == fs.weight_;\n  }\n\n  bool operator!=(const WeightFilterState &fs) const {\n    return weight_ != fs.weight_;\n  }\n\n  W GetWeight() const { return weight_; }\n\n  void SetWeight(W weight) { weight_ = std::move(weight); }\n\n private:\n  W weight_;\n};\n\n// Filter state is a list of signed integer types T. Order matters\n// for equality.\ntemplate <typename T>\nclass ListFilterState {\n public:\n  ListFilterState() {}\n\n  explicit ListFilterState(T s) { list_.push_front(s); }\n\n  static const ListFilterState NoState() { return ListFilterState(kNoStateId); }\n\n  size_t Hash() const {\n    size_t h = 0;\n    for (const auto &elem : list_) h ^= h << 1 ^ elem;\n    return h;\n  }\n\n  bool operator==(const ListFilterState &fs) const { return list_ == fs.list_; }\n\n  bool operator!=(const ListFilterState &fs) const { return list_ != fs.list_; }\n\n  const std::forward_list<T> &GetState() const { return list_; }\n\n  std::forward_list<T> *GetMutableState() { return &list_; }\n\n  void SetState(const std::forward_list<T> &state) { list_ = state; }\n\n private:\n  std::forward_list<T> list_;\n};\n\n// Filter state that is the combination of two filter states.\ntemplate <class FS1, class FS2>\nclass PairFilterState {\n public:\n  PairFilterState() : fs1_(FS1::NoState()), fs2_(FS2::NoState()) {}\n\n  PairFilterState(const FS1 &fs1, const FS2 &fs2) : fs1_(fs1), fs2_(fs2) {}\n\n  static const PairFilterState NoState() { return PairFilterState(); }\n\n  size_t Hash() const {\n    const auto h1 = fs1_.Hash();\n    static constexpr auto lshift = 5;\n    static constexpr auto rshift = CHAR_BIT * sizeof(size_t) - 5;\n    return h1 << lshift ^ h1 >> rshift ^ fs2_.Hash();\n  }\n\n  bool operator==(const PairFilterState &fs) const {\n    return fs1_ == fs.fs1_ && fs2_ == fs.fs2_;\n  }\n\n  bool operator!=(const PairFilterState &fs) const {\n    return fs1_ != fs.fs1_ || fs2_ != fs.fs2_;\n  }\n\n  const FS1 &GetState1() const { return fs1_; }\n\n  const FS2 &GetState2() const { return fs2_; }\n\n  void SetState(const FS1 &fs1, const FS2 &fs2) {\n    fs1_ = fs1;\n    fs2_ = fs2;\n  }\n\n private:\n  FS1 fs1_;\n  FS2 fs2_;\n};\n\n// Single non-blocking filter state.\nclass TrivialFilterState {\n public:\n  explicit TrivialFilterState(bool state = false) : state_(state) {}\n\n  static const TrivialFilterState NoState() { return TrivialFilterState(); }\n\n  size_t Hash() const { return 0; }\n\n  bool operator==(const TrivialFilterState &fs) const {\n    return state_ == fs.state_;\n  }\n\n  bool operator!=(const TrivialFilterState &fs) const {\n    return state_ != fs.state_;\n  }\n\n private:\n  bool state_;\n};\n\n}  // namespace fst\n\n#endif  // FST_FILTER_STATE_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/flags.h",
    "content": "// Licensed under the Apache License, Version 2.0 (the \"License\");\n// you may not use this file except in compliance with the License.\n// You may obtain a copy of the License at\n//\n//      http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n// See the License for the specific language governing permissions and\n// limitations under the License.\n//\n// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n// \n// Google-style flag handling declarations and inline definitions.\n\n#ifndef FST_LIB_FLAGS_H_\n#define FST_LIB_FLAGS_H_\n\n#include <cstdlib>\n\n#include <iostream>\n#include <map>\n#include <set>\n#include <sstream>\n#include <string>\n\n#include <fst/types.h>\n#include <fst/lock.h>\n\nusing std::string;\n\n// FLAGS USAGE:\n//\n// Definition example:\n//\n//    DEFINE_int32_t(length, 0, \"length\");\n//\n// This defines variable FLAGS_length, initialized to 0.\n//\n// Declaration example:\n//\n//    DECLARE_int32_t(length);\n//\n// SET_FLAGS() can be used to set flags from the command line\n// using, for example, '--length=2'.\n//\n// ShowUsage() can be used to print out command and flag usage.\n\n#define DECLARE_bool(name) extern bool FLAGS_ ## name\n#define DECLARE_string(name) extern string FLAGS_ ## name\n#define DECLARE_int32_t(name) extern int32_t FLAGS_ ## name\n#define DECLARE_int64_t(name) extern int64_t FLAGS_ ## name\n#define DECLARE_double(name) extern double FLAGS_ ## name\n\ntemplate <typename T>\nstruct FlagDescription {\n  FlagDescription(T *addr, const char *doc, const char *type,\n\t\t  const char *file, const T val)\n      : address(addr),\n    doc_string(doc),\n    type_name(type),\n    file_name(file),\n    default_value(val) {}\n\n  T *address;\n  const char *doc_string;\n  const char *type_name;\n  const char *file_name;\n  const T default_value;\n};\n\ntemplate <typename T>\nclass FlagRegister {\n public:\n  static FlagRegister<T> *GetRegister() {\n    static auto reg = new FlagRegister<T>;\n    return reg;\n  }\n\n  const FlagDescription<T> &GetFlagDescription(const string &name) const {\n    fst::MutexLock l(&flag_lock_);\n    auto it = flag_table_.find(name);\n    return it != flag_table_.end() ? it->second : 0;\n  }\n\n  void SetDescription(const string &name,\n                      const FlagDescription<T> &desc) {\n    fst::MutexLock l(&flag_lock_);\n    flag_table_.insert(make_pair(name, desc));\n  }\n\n  bool SetFlag(const string &val, bool *address) const {\n    if (val == \"true\" || val == \"1\" || val.empty()) {\n      *address = true;\n      return true;\n    } else if (val == \"false\" || val == \"0\") {\n      *address = false;\n      return true;\n    }\n    else {\n      return false;\n    }\n  }\n\n  bool SetFlag(const string &val, string *address) const {\n    *address = val;\n    return true;\n  }\n\n  bool SetFlag(const string &val, int32_t *address) const {\n    char *p = 0;\n    *address = strtol(val.c_str(), &p, 0);\n    return !val.empty() && *p == '\\0';\n  }\n\n  bool SetFlag(const string &val, int64_t *address) const {\n    char *p = 0;\n    *address = strtoll(val.c_str(), &p, 0);\n    return !val.empty() && *p == '\\0';\n  }\n\n  bool SetFlag(const string &val, double *address) const {\n    char *p = 0;\n    *address = strtod(val.c_str(), &p);\n    return !val.empty() && *p == '\\0';\n  }\n\n  bool SetFlag(const string &arg, const string &val) const {\n    for (typename std::map< string, FlagDescription<T> >::const_iterator it =\n           flag_table_.begin();\n         it != flag_table_.end();\n         ++it) {\n      const string &name = it->first;\n      const FlagDescription<T> &desc = it->second;\n      if (arg == name)\n        return SetFlag(val, desc.address);\n    }\n    return false;\n  }\n\n  void GetUsage(std::set<std::pair<string, string>> *usage_set) const {\n    for (auto it = flag_table_.begin(); it != flag_table_.end(); ++it) {\n      const string &name = it->first;\n      const FlagDescription<T> &desc = it->second;\n      string usage = \"  --\" + name;\n      usage += \": type = \";\n      usage += desc.type_name;\n      usage += \", default = \";\n      usage += GetDefault(desc.default_value) + \"\\n  \";\n      usage += desc.doc_string;\n      usage_set->insert(make_pair(desc.file_name, usage));\n    }\n  }\n\n private:\n  string GetDefault(bool default_value) const {\n    return default_value ? \"true\" : \"false\";\n  }\n\n  string GetDefault(const string &default_value) const {\n    return \"\\\"\" + default_value + \"\\\"\";\n  }\n\n  template <class V>\n  string GetDefault(const V &default_value) const {\n    std::ostringstream strm;\n    strm << default_value;\n    return strm.str();\n  }\n\n  mutable fst::Mutex flag_lock_;        // Multithreading lock.\n  std::map<string, FlagDescription<T>> flag_table_;\n};\n\ntemplate <typename T>\nclass FlagRegisterer {\n public:\n  FlagRegisterer(const string &name, const FlagDescription<T> &desc) {\n    auto registr = FlagRegister<T>::GetRegister();\n    registr->SetDescription(name, desc);\n  }\n\n private:\n  FlagRegisterer(const FlagRegisterer &) = delete;\n  FlagRegisterer &operator=(const FlagRegisterer &) = delete;\n};\n\n\n#define DEFINE_VAR(type, name, value, doc)                                \\\n  type FLAGS_ ## name = value;                                            \\\n  static FlagRegisterer<type>                                             \\\n  name ## _flags_registerer(#name, FlagDescription<type>(&FLAGS_ ## name, \\\n                                                         doc,             \\\n                                                         #type,           \\\n                                                         __FILE__,        \\\n                                                         value))\n\n#define DEFINE_bool(name, value, doc) DEFINE_VAR(bool, name, value, doc)\n#define DEFINE_string(name, value, doc) \\\n  DEFINE_VAR(string, name, value, doc)\n#define DEFINE_int32_t(name, value, doc) DEFINE_VAR(int32_t, name, value, doc)\n#define DEFINE_int64_t(name, value, doc) DEFINE_VAR(int64_t, name, value, doc)\n#define DEFINE_double(name, value, doc) DEFINE_VAR(double, name, value, doc)\n\n\n// Temporary directory.\nDECLARE_string(tmpdir);\n\nvoid SetFlags(const char *usage, int *argc, char ***argv, bool remove_flags,\n              const char *src = \"\");\n\n#define SET_FLAGS(usage, argc, argv, rmflags) \\\nSetFlags(usage, argc, argv, rmflags, __FILE__)\n\n// Deprecated; for backward compatibility.\ninline void InitFst(const char *usage, int *argc, char ***argv, bool rmflags) {\n  return SetFlags(usage, argc, argv, rmflags);\n}\n\nvoid ShowUsage(bool long_usage = true);\n\n#endif  // FST_LIB_FLAGS_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/float-weight.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Float weight set and associated semiring operation definitions.\n\n#ifndef FST_FLOAT_WEIGHT_H_\n#define FST_FLOAT_WEIGHT_H_\n\n#include <climits>\n#include <cmath>\n#include <cstdlib>\n#include <cstring>\n\n#include <algorithm>\n#include <limits>\n#include <sstream>\n#include <string>\n\n#include <fst/util.h>\n#include <fst/weight.h>\n\n\nnamespace fst {\n\n// Numeric limits class.\ntemplate <class T>\nclass FloatLimits {\n public:\n  static constexpr T PosInfinity() {\n    return std::numeric_limits<T>::infinity();\n  }\n\n  static constexpr T NegInfinity() { return -PosInfinity(); }\n\n  static constexpr T NumberBad() { return std::numeric_limits<T>::quiet_NaN(); }\n};\n\n// Weight class to be templated on floating-points types.\ntemplate <class T = float>\nclass FloatWeightTpl {\n public:\n  using ValueType = T;\n\n  FloatWeightTpl() {}\n\n  FloatWeightTpl(T f) : value_(f) {}\n\n  FloatWeightTpl(const FloatWeightTpl<T> &weight) : value_(weight.value_) {}\n\n  FloatWeightTpl<T> &operator=(const FloatWeightTpl<T> &weight) {\n    value_ = weight.value_;\n    return *this;\n  }\n\n  std::istream &Read(std::istream &strm) { return ReadType(strm, &value_); }\n\n  std::ostream &Write(std::ostream &strm) const {\n    return WriteType(strm, value_);\n  }\n\n  size_t Hash() const {\n    size_t hash = 0;\n    // Avoid using union, which would be undefined behavior.\n    // Use memcpy, similar to bit_cast, but sizes may be different.\n    // This should be optimized into a single move instruction by\n    // any reasonable compiler.\n    std::memcpy(&hash, &value_, std::min(sizeof(hash), sizeof(value_)));\n    return hash;\n  }\n\n  const T &Value() const { return value_; }\n\n protected:\n  void SetValue(const T &f) { value_ = f; }\n\n  static constexpr const char *GetPrecisionString() {\n    return sizeof(T) == 4\n               ? \"\"\n               : sizeof(T) == 1\n                     ? \"8\"\n                     : sizeof(T) == 2 ? \"16\"\n                                      : sizeof(T) == 8 ? \"64\" : \"unknown\";\n  }\n\n private:\n  T value_;\n};\n\n// Single-precision float weight.\nusing FloatWeight = FloatWeightTpl<float>;\n\ntemplate <class T>\ninline bool operator==(const FloatWeightTpl<T> &w1,\n                       const FloatWeightTpl<T> &w2) {\n  // Volatile qualifier thwarts over-aggressive compiler optimizations that\n  // lead to problems esp. with NaturalLess().\n  volatile T v1 = w1.Value();\n  volatile T v2 = w2.Value();\n  return v1 == v2;\n}\n\n// These seemingly unnecessary overloads are actually needed to make\n// comparisons like FloatWeightTpl<float> == float compile.  If only the\n// templated version exists, the FloatWeightTpl<float>(float) conversion\n// won't be found.\ninline bool operator==(const FloatWeightTpl<float> &w1,\n                       const FloatWeightTpl<float> &w2) {\n  return operator==<float>(w1, w2);\n}\n\ninline bool operator==(const FloatWeightTpl<double> &w1,\n                       const FloatWeightTpl<double> &w2) {\n  return operator==<double>(w1, w2);\n}\n\ntemplate <class T>\ninline bool operator!=(const FloatWeightTpl<T> &w1,\n                       const FloatWeightTpl<T> &w2) {\n  return !(w1 == w2);\n}\n\ninline bool operator!=(const FloatWeightTpl<float> &w1,\n                       const FloatWeightTpl<float> &w2) {\n  return operator!=<float>(w1, w2);\n}\n\ninline bool operator!=(const FloatWeightTpl<double> &w1,\n                       const FloatWeightTpl<double> &w2) {\n  return operator!=<double>(w1, w2);\n}\n\ntemplate <class T>\ninline bool ApproxEqual(const FloatWeightTpl<T> &w1,\n                        const FloatWeightTpl<T> &w2, float delta = kDelta) {\n  return w1.Value() <= w2.Value() + delta && w2.Value() <= w1.Value() + delta;\n}\n\ntemplate <class T>\ninline std::ostream &operator<<(std::ostream &strm,\n                                const FloatWeightTpl<T> &w) {\n  if (w.Value() == FloatLimits<T>::PosInfinity()) {\n    return strm << \"Infinity\";\n  } else if (w.Value() == FloatLimits<T>::NegInfinity()) {\n    return strm << \"-Infinity\";\n  } else if (w.Value() != w.Value()) {  // Fails for IEEE NaN.\n    return strm << \"BadNumber\";\n  } else {\n    return strm << w.Value();\n  }\n}\n\ntemplate <class T>\ninline std::istream &operator>>(std::istream &strm, FloatWeightTpl<T> &w) {\n  string s;\n  strm >> s;\n  if (s == \"Infinity\") {\n    w = FloatWeightTpl<T>(FloatLimits<T>::PosInfinity());\n  } else if (s == \"-Infinity\") {\n    w = FloatWeightTpl<T>(FloatLimits<T>::NegInfinity());\n  } else {\n    char *p;\n    T f = strtod(s.c_str(), &p);\n    if (p < s.c_str() + s.size()) {\n      strm.clear(std::ios::badbit);\n    } else {\n      w = FloatWeightTpl<T>(f);\n    }\n  }\n  return strm;\n}\n\n// Tropical semiring: (min, +, inf, 0).\ntemplate <class T>\nclass TropicalWeightTpl : public FloatWeightTpl<T> {\n public:\n  using typename FloatWeightTpl<T>::ValueType;\n  using FloatWeightTpl<T>::Value;\n  using ReverseWeight = TropicalWeightTpl<T>;\n  using Limits = FloatLimits<T>;\n\n  constexpr TropicalWeightTpl() : FloatWeightTpl<T>() {}\n\n  constexpr TropicalWeightTpl(T f) : FloatWeightTpl<T>(f) {}\n\n  constexpr TropicalWeightTpl(const TropicalWeightTpl<T> &weight)\n      : FloatWeightTpl<T>(weight) {}\n\n  static const TropicalWeightTpl<T> &Zero() {\n    static const TropicalWeightTpl zero(Limits::PosInfinity());\n    return zero;\n  }\n\n  static const TropicalWeightTpl<T> &One() {\n    static const TropicalWeightTpl one(0.0F);\n    return one;\n  }\n\n  static const TropicalWeightTpl<T> &NoWeight() {\n    static const TropicalWeightTpl no_weight(Limits::NumberBad());\n    return no_weight;\n  }\n\n  static const string &Type() {\n    static const string *const type =\n        new string(string(\"tropical\") +\n                   FloatWeightTpl<T>::GetPrecisionString());\n    return *type;\n  }\n\n  bool Member() const {\n    // First part fails for IEEE NaN.\n    return Value() == Value() && Value() != Limits::NegInfinity();\n  }\n\n  TropicalWeightTpl<T> Quantize(float delta = kDelta) const {\n    if (!Member() || Value() == Limits::PosInfinity()) {\n      return *this;\n    } else {\n      return TropicalWeightTpl<T>(floor(Value() / delta + 0.5F) * delta);\n    }\n  }\n\n  TropicalWeightTpl<T> Reverse() const { return *this; }\n\n  static constexpr uint64_t Properties() {\n    return kLeftSemiring | kRightSemiring | kCommutative | kPath | kIdempotent;\n  }\n};\n\n// Single precision tropical weight.\nusing TropicalWeight = TropicalWeightTpl<float>;\n\ntemplate <class T>\ninline TropicalWeightTpl<T> Plus(const TropicalWeightTpl<T> &w1,\n                                 const TropicalWeightTpl<T> &w2) {\n  if (!w1.Member() || !w2.Member()) return TropicalWeightTpl<T>::NoWeight();\n  return w1.Value() < w2.Value() ? w1 : w2;\n}\n\n// See comment at operator==(FloatWeightTpl<float>, FloatWeightTpl<float>)\n// for why these overloads are present.\ninline TropicalWeightTpl<float> Plus(const TropicalWeightTpl<float> &w1,\n                                     const TropicalWeightTpl<float> &w2) {\n  return Plus<float>(w1, w2);\n}\n\ninline TropicalWeightTpl<double> Plus(const TropicalWeightTpl<double> &w1,\n                                      const TropicalWeightTpl<double> &w2) {\n  return Plus<double>(w1, w2);\n}\n\ntemplate <class T>\ninline TropicalWeightTpl<T> Times(const TropicalWeightTpl<T> &w1,\n                                  const TropicalWeightTpl<T> &w2) {\n  using Limits = FloatLimits<T>;\n  if (!w1.Member() || !w2.Member()) return TropicalWeightTpl<T>::NoWeight();\n  const T f1 = w1.Value();\n  const T f2 = w2.Value();\n  if (f1 == Limits::PosInfinity()) {\n    return w1;\n  } else if (f2 == Limits::PosInfinity()) {\n    return w2;\n  } else {\n    return TropicalWeightTpl<T>(f1 + f2);\n  }\n}\n\ninline TropicalWeightTpl<float> Times(const TropicalWeightTpl<float> &w1,\n                                      const TropicalWeightTpl<float> &w2) {\n  return Times<float>(w1, w2);\n}\n\ninline TropicalWeightTpl<double> Times(const TropicalWeightTpl<double> &w1,\n                                       const TropicalWeightTpl<double> &w2) {\n  return Times<double>(w1, w2);\n}\n\ntemplate <class T>\ninline TropicalWeightTpl<T> Divide(const TropicalWeightTpl<T> &w1,\n                                   const TropicalWeightTpl<T> &w2,\n                                   DivideType typ = DIVIDE_ANY) {\n  using Limits = FloatLimits<T>;\n  if (!w1.Member() || !w2.Member()) return TropicalWeightTpl<T>::NoWeight();\n  const T f1 = w1.Value();\n  const T f2 = w2.Value();\n  if (f2 == Limits::PosInfinity()) {\n    return Limits::NumberBad();\n  } else if (f1 == Limits::PosInfinity()) {\n    return Limits::PosInfinity();\n  } else {\n    return TropicalWeightTpl<T>(f1 - f2);\n  }\n}\n\ninline TropicalWeightTpl<float> Divide(const TropicalWeightTpl<float> &w1,\n                                       const TropicalWeightTpl<float> &w2,\n                                       DivideType typ = DIVIDE_ANY) {\n  return Divide<float>(w1, w2, typ);\n}\n\ninline TropicalWeightTpl<double> Divide(const TropicalWeightTpl<double> &w1,\n                                        const TropicalWeightTpl<double> &w2,\n                                        DivideType typ = DIVIDE_ANY) {\n  return Divide<double>(w1, w2, typ);\n}\n\ntemplate <class T, class V>\ninline TropicalWeightTpl<T> Power(const TropicalWeightTpl<T> &weight, V n) {\n  if (n == 0) {\n    return TropicalWeightTpl<T>::One();\n  } else if (weight == TropicalWeightTpl<T>::Zero()) {\n    return TropicalWeightTpl<T>::Zero();\n  }\n  return TropicalWeightTpl<T>(weight.Value() * n);\n}\n\n// Specializes the library-wide template to use the above implementation; rules\n// of function template instantiation require this be a full instantiation.\n\ninline TropicalWeightTpl<float> Power(\n    const TropicalWeightTpl<float> &weight, size_t n) {\n  return Power<float, size_t>(weight, n);\n}\n\ninline TropicalWeightTpl<double> Power(\n    const TropicalWeightTpl<double> &weight, size_t n) {\n  return Power<double, size_t>(weight, n);\n}\n\n\n// Log semiring: (log(e^-x + e^-y), +, inf, 0).\ntemplate <class T>\nclass LogWeightTpl : public FloatWeightTpl<T> {\n public:\n  using typename FloatWeightTpl<T>::ValueType;\n  using FloatWeightTpl<T>::Value;\n  using ReverseWeight = LogWeightTpl;\n  using Limits = FloatLimits<T>;\n\n  constexpr LogWeightTpl() : FloatWeightTpl<T>() {}\n\n  constexpr LogWeightTpl(T f) : FloatWeightTpl<T>(f) {}\n\n  constexpr LogWeightTpl(const LogWeightTpl<T> &weight)\n      : FloatWeightTpl<T>(weight) {}\n\n  static const LogWeightTpl &Zero() {\n    static const LogWeightTpl zero(Limits::PosInfinity());\n    return zero;\n  }\n\n  static const LogWeightTpl &One() {\n    static const LogWeightTpl one(0.0F);\n    return one;\n  }\n\n  static const LogWeightTpl &NoWeight() {\n    static const LogWeightTpl no_weight(Limits::NumberBad());\n    return no_weight;\n  }\n\n  static const string &Type() {\n    static const string *const type =\n        new string(string(\"log\") + FloatWeightTpl<T>::GetPrecisionString());\n    return *type;\n  }\n\n  bool Member() const {\n    // First part fails for IEEE NaN.\n    return Value() == Value() && Value() != Limits::NegInfinity();\n  }\n\n  LogWeightTpl<T> Quantize(float delta = kDelta) const {\n    if (!Member() || Value() == Limits::PosInfinity()) {\n      return *this;\n    } else {\n      return LogWeightTpl<T>(floor(Value() / delta + 0.5F) * delta);\n    }\n  }\n\n  LogWeightTpl<T> Reverse() const { return *this; }\n\n  static constexpr uint64_t Properties() {\n    return kLeftSemiring | kRightSemiring | kCommutative;\n  }\n};\n\n// Single-precision log weight.\nusing LogWeight = LogWeightTpl<float>;\n\n// Double-precision log weight.\nusing Log64Weight = LogWeightTpl<double>;\n\nnamespace internal {\n\n// -log(e^-x + e^-y) = x - LogPosExp(y - x), assuming x >= 0.0.\ninline double LogPosExp(double x) {\n  DCHECK(!(x < 0));  // NB: NaN values are allowed.\n  return log1p(exp(-x));\n}\n\n// -log(e^-x - e^-y) = x - LogNegExp(y - x), assuming x > 0.0.\ninline double LogNegExp(double x) {\n  DCHECK_GT(x, 0);\n  return log1p(-exp(-x));\n}\n\n// a +_log b = -log(e^-a + e^-b) = KahanLogSum(a, b, ...).\n// Kahan compensated summation provides an error bound that is\n// independent of the number of addends. Assumes b >= a;\n// c is the compensation.\ninline double KahanLogSum(double a, double b, double *c) {\n  DCHECK_GE(b, a);\n  double y = -LogPosExp(b - a) - *c;\n  double t = a + y;\n  *c = (t - a) - y;\n  return t;\n}\n\n// a -_log b = -log(e^-a - e^-b) = KahanLogDiff(a, b, ...).\n// Kahan compensated summation provides an error bound that is\n// independent of the number of addends. Assumes b > a;\n// c is the compensation.\ninline double KahanLogDiff(double a, double b, double *c) {\n  DCHECK_GT(b, a);\n  double y = -LogNegExp(b - a) - *c;\n  double t = a + y;\n  *c = (t - a) - y;\n  return t;\n}\n\n}  // namespace internal\n\ntemplate <class T>\ninline LogWeightTpl<T> Plus(const LogWeightTpl<T> &w1,\n                            const LogWeightTpl<T> &w2) {\n  using Limits = FloatLimits<T>;\n  const T f1 = w1.Value();\n  const T f2 = w2.Value();\n  if (f1 == Limits::PosInfinity()) {\n    return w2;\n  } else if (f2 == Limits::PosInfinity()) {\n    return w1;\n  } else if (f1 > f2) {\n    return LogWeightTpl<T>(f2 - internal::LogPosExp(f1 - f2));\n  } else {\n    return LogWeightTpl<T>(f1 - internal::LogPosExp(f2 - f1));\n  }\n}\n\ninline LogWeightTpl<float> Plus(const LogWeightTpl<float> &w1,\n                                const LogWeightTpl<float> &w2) {\n  return Plus<float>(w1, w2);\n}\n\ninline LogWeightTpl<double> Plus(const LogWeightTpl<double> &w1,\n                                 const LogWeightTpl<double> &w2) {\n  return Plus<double>(w1, w2);\n}\n\ntemplate <class T>\ninline LogWeightTpl<T> Times(const LogWeightTpl<T> &w1,\n                             const LogWeightTpl<T> &w2) {\n  using Limits = FloatLimits<T>;\n  if (!w1.Member() || !w2.Member()) return LogWeightTpl<T>::NoWeight();\n  const T f1 = w1.Value();\n  const T f2 = w2.Value();\n  if (f1 == Limits::PosInfinity()) {\n    return w1;\n  } else if (f2 == Limits::PosInfinity()) {\n    return w2;\n  } else {\n    return LogWeightTpl<T>(f1 + f2);\n  }\n}\n\ninline LogWeightTpl<float> Times(const LogWeightTpl<float> &w1,\n                                 const LogWeightTpl<float> &w2) {\n  return Times<float>(w1, w2);\n}\n\ninline LogWeightTpl<double> Times(const LogWeightTpl<double> &w1,\n                                  const LogWeightTpl<double> &w2) {\n  return Times<double>(w1, w2);\n}\n\ntemplate <class T>\ninline LogWeightTpl<T> Divide(const LogWeightTpl<T> &w1,\n                              const LogWeightTpl<T> &w2,\n                              DivideType typ = DIVIDE_ANY) {\n  using Limits = FloatLimits<T>;\n  if (!w1.Member() || !w2.Member()) return LogWeightTpl<T>::NoWeight();\n  const T f1 = w1.Value();\n  const T f2 = w2.Value();\n  if (f2 == Limits::PosInfinity()) {\n    return Limits::NumberBad();\n  } else if (f1 == Limits::PosInfinity()) {\n    return Limits::PosInfinity();\n  } else {\n    return LogWeightTpl<T>(f1 - f2);\n  }\n}\n\ninline LogWeightTpl<float> Divide(const LogWeightTpl<float> &w1,\n                                  const LogWeightTpl<float> &w2,\n                                  DivideType typ = DIVIDE_ANY) {\n  return Divide<float>(w1, w2, typ);\n}\n\ninline LogWeightTpl<double> Divide(const LogWeightTpl<double> &w1,\n                                   const LogWeightTpl<double> &w2,\n                                   DivideType typ = DIVIDE_ANY) {\n  return Divide<double>(w1, w2, typ);\n}\n\ntemplate <class T, class V>\ninline LogWeightTpl<T> Power(const LogWeightTpl<T> &weight, V n) {\n  if (n == 0) {\n    return LogWeightTpl<T>::One();\n  } else if (weight == LogWeightTpl<T>::Zero()) {\n    return LogWeightTpl<T>::Zero();\n  }\n  return LogWeightTpl<T>(weight.Value() * n);\n}\n\n// Specializes the library-wide template to use the above implementation; rules\n// of function template instantiation require this be a full instantiation.\ninline LogWeightTpl<float> Power(\n    const LogWeightTpl<float> &weight, size_t n) {\n  return Power<float, size_t>(weight, n);\n}\n\ninline LogWeightTpl<double> Power(\n    const LogWeightTpl<double> &weight, size_t n) {\n  return Power<double, size_t>(weight, n);\n}\n\n// Specialization using the Kahan compensated summation.\ntemplate <class T>\nclass Adder<LogWeightTpl<T>> {\n public:\n  using Weight = LogWeightTpl<T>;\n\n  explicit Adder(Weight w = Weight::Zero())\n      : sum_(w.Value()),\n        c_(0.0) { }\n\n  Weight Add(const Weight &w) {\n    using Limits = FloatLimits<T>;\n    const T f = w.Value();\n    if (f == Limits::PosInfinity()) {\n      return Sum();\n    } else if (sum_ == Limits::PosInfinity()) {\n      sum_ = f;\n      c_ = 0.0;\n    } else if (f > sum_) {\n      sum_ = internal::KahanLogSum(sum_, f, &c_);\n    } else {\n      sum_ = internal::KahanLogSum(f, sum_, &c_);\n    }\n    return Sum();\n  }\n\n  Weight Sum() { return Weight(sum_); }\n\n  void Reset(Weight w = Weight::Zero()) {\n    sum_ = w.Value();\n    c_ = 0.0;\n  }\n\n private:\n  double sum_;\n  double c_;   // Kahan compensation.\n};\n\n// MinMax semiring: (min, max, inf, -inf).\ntemplate <class T>\nclass MinMaxWeightTpl : public FloatWeightTpl<T> {\n public:\n  using typename FloatWeightTpl<T>::ValueType;\n  using FloatWeightTpl<T>::Value;\n  using ReverseWeight = MinMaxWeightTpl<T>;\n  using Limits = FloatLimits<T>;\n\n  MinMaxWeightTpl() : FloatWeightTpl<T>() {}\n\n  MinMaxWeightTpl(T f) : FloatWeightTpl<T>(f) {}\n\n  MinMaxWeightTpl(const MinMaxWeightTpl<T> &weight)\n      : FloatWeightTpl<T>(weight) {}\n\n  static const MinMaxWeightTpl &Zero() {\n    static const MinMaxWeightTpl zero(Limits::PosInfinity());\n    return zero;\n  }\n\n  static const MinMaxWeightTpl &One() {\n    static const MinMaxWeightTpl one(Limits::NegInfinity());\n    return one;\n  }\n\n  static const MinMaxWeightTpl &NoWeight() {\n    static const MinMaxWeightTpl no_weight(Limits::NumberBad());\n    return no_weight;\n  }\n\n  static const string &Type() {\n    static const string *const type =\n        new string(string(\"minmax\") + FloatWeightTpl<T>::GetPrecisionString());\n    return *type;\n  }\n\n  // Fails for IEEE NaN.\n  bool Member() const { return Value() == Value(); }\n\n  MinMaxWeightTpl<T> Quantize(float delta = kDelta) const {\n    // If one of infinities, or a NaN.\n    if (!Member() ||\n        Value() == Limits::NegInfinity() || Value() == Limits::PosInfinity()) {\n      return *this;\n    } else {\n      return MinMaxWeightTpl<T>(floor(Value() / delta + 0.5F) * delta);\n    }\n  }\n\n  MinMaxWeightTpl<T> Reverse() const { return *this; }\n\n  static constexpr uint64_t Properties() {\n    return kLeftSemiring | kRightSemiring | kCommutative | kIdempotent | kPath;\n  }\n};\n\n// Single-precision min-max weight.\nusing MinMaxWeight = MinMaxWeightTpl<float>;\n\n// Min.\ntemplate <class T>\ninline MinMaxWeightTpl<T> Plus(const MinMaxWeightTpl<T> &w1,\n                               const MinMaxWeightTpl<T> &w2) {\n  if (!w1.Member() || !w2.Member()) return MinMaxWeightTpl<T>::NoWeight();\n  return w1.Value() < w2.Value() ? w1 : w2;\n}\n\ninline MinMaxWeightTpl<float> Plus(const MinMaxWeightTpl<float> &w1,\n                                   const MinMaxWeightTpl<float> &w2) {\n  return Plus<float>(w1, w2);\n}\n\ninline MinMaxWeightTpl<double> Plus(const MinMaxWeightTpl<double> &w1,\n                                    const MinMaxWeightTpl<double> &w2) {\n  return Plus<double>(w1, w2);\n}\n\n// Max.\ntemplate <class T>\ninline MinMaxWeightTpl<T> Times(const MinMaxWeightTpl<T> &w1,\n                                const MinMaxWeightTpl<T> &w2) {\n  if (!w1.Member() || !w2.Member()) return MinMaxWeightTpl<T>::NoWeight();\n  return w1.Value() >= w2.Value() ? w1 : w2;\n}\n\ninline MinMaxWeightTpl<float> Times(const MinMaxWeightTpl<float> &w1,\n                                    const MinMaxWeightTpl<float> &w2) {\n  return Times<float>(w1, w2);\n}\n\ninline MinMaxWeightTpl<double> Times(const MinMaxWeightTpl<double> &w1,\n                                     const MinMaxWeightTpl<double> &w2) {\n  return Times<double>(w1, w2);\n}\n\n// Defined only for special cases.\ntemplate <class T>\ninline MinMaxWeightTpl<T> Divide(const MinMaxWeightTpl<T> &w1,\n                                 const MinMaxWeightTpl<T> &w2,\n                                 DivideType typ = DIVIDE_ANY) {\n  if (!w1.Member() || !w2.Member()) return MinMaxWeightTpl<T>::NoWeight();\n  // min(w1, x) = w2, w1 >= w2 => min(w1, x) = w2, x = w2.\n  return w1.Value() >= w2.Value() ? w1 : FloatLimits<T>::NumberBad();\n}\n\ninline MinMaxWeightTpl<float> Divide(const MinMaxWeightTpl<float> &w1,\n                                     const MinMaxWeightTpl<float> &w2,\n                                     DivideType typ = DIVIDE_ANY) {\n  return Divide<float>(w1, w2, typ);\n}\n\ninline MinMaxWeightTpl<double> Divide(const MinMaxWeightTpl<double> &w1,\n                                      const MinMaxWeightTpl<double> &w2,\n                                      DivideType typ = DIVIDE_ANY) {\n  return Divide<double>(w1, w2, typ);\n}\n\n// Converts to tropical.\ntemplate <>\nstruct WeightConvert<LogWeight, TropicalWeight> {\n  TropicalWeight operator()(const LogWeight &w) const { return w.Value(); }\n};\n\ntemplate <>\nstruct WeightConvert<Log64Weight, TropicalWeight> {\n  TropicalWeight operator()(const Log64Weight &w) const { return w.Value(); }\n};\n\n// Converts to log.\ntemplate <>\nstruct WeightConvert<TropicalWeight, LogWeight> {\n  LogWeight operator()(const TropicalWeight &w) const { return w.Value(); }\n};\n\ntemplate <>\nstruct WeightConvert<Log64Weight, LogWeight> {\n  LogWeight operator()(const Log64Weight &w) const { return w.Value(); }\n};\n\n// Converts to log64.\ntemplate <>\nstruct WeightConvert<TropicalWeight, Log64Weight> {\n  Log64Weight operator()(const TropicalWeight &w) const { return w.Value(); }\n};\n\ntemplate <>\nstruct WeightConvert<LogWeight, Log64Weight> {\n  Log64Weight operator()(const LogWeight &w) const { return w.Value(); }\n};\n\n// This function object returns random integers chosen from [0,\n// num_random_weights). The boolean 'allow_zero' determines whether Zero() and\n// zero divisors should be returned in the random weight generation. This is\n// intended primary for testing.\ntemplate <class Weight>\nclass FloatWeightGenerate {\n public:\n  explicit FloatWeightGenerate(\n      bool allow_zero = true,\n      const size_t num_random_weights = kNumRandomWeights)\n      : allow_zero_(allow_zero), num_random_weights_(num_random_weights) {}\n\n  Weight operator()() const {\n    const int n = rand() % (num_random_weights_ + allow_zero_);  // NOLINT\n    if (allow_zero_ && n == num_random_weights_) return Weight::Zero();\n    return Weight(n);\n  }\n\n private:\n  // Permits Zero() and zero divisors.\n  const bool allow_zero_;\n  // Number of alternative random weights.\n  const size_t num_random_weights_;\n};\n\ntemplate <class T>\nclass WeightGenerate<TropicalWeightTpl<T>>\n    : public FloatWeightGenerate<TropicalWeightTpl<T>> {\n public:\n  using Weight = TropicalWeightTpl<T>;\n  using Generate = FloatWeightGenerate<Weight>;\n\n  explicit WeightGenerate(bool allow_zero = true,\n                          size_t num_random_weights = kNumRandomWeights)\n      : Generate(allow_zero, num_random_weights) {}\n\n  Weight operator()() const { return Weight(Generate::operator()()); }\n};\n\ntemplate <class T>\nclass WeightGenerate<LogWeightTpl<T>>\n    : public FloatWeightGenerate<LogWeightTpl<T>> {\n public:\n  using Weight = LogWeightTpl<T>;\n  using Generate = FloatWeightGenerate<Weight>;\n\n  explicit WeightGenerate(bool allow_zero = true,\n                          size_t num_random_weights = kNumRandomWeights)\n      : Generate(allow_zero, num_random_weights) {}\n\n  Weight operator()() const { return Weight(Generate::operator()()); }\n};\n\n// This function object returns random integers chosen from [0,\n// num_random_weights). The boolean 'allow_zero' determines whether Zero() and\n// zero divisors should be returned in the random weight generation. This is\n// intended primary for testing.\ntemplate <class T>\nclass WeightGenerate<MinMaxWeightTpl<T>> {\n public:\n  using Weight = MinMaxWeightTpl<T>;\n\n  explicit WeightGenerate(bool allow_zero = true,\n                          size_t num_random_weights = kNumRandomWeights)\n      : allow_zero_(allow_zero), num_random_weights_(num_random_weights) {}\n\n  Weight operator()() const {\n    const int n = (rand() %  // NOLINT\n                   (2 * num_random_weights_ + allow_zero_)) -\n                  num_random_weights_;\n    if (allow_zero_ && n == num_random_weights_) {\n      return Weight::Zero();\n    } else if (n == -num_random_weights_) {\n      return Weight::One();\n    } else {\n      return Weight(n);\n    }\n  }\n\n private:\n  // Permits Zero() and zero divisors.\n  const bool allow_zero_;\n  // Number of alternative random weights.\n  const size_t num_random_weights_;\n};\n\n}  // namespace fst\n\n#endif  // FST_FLOAT_WEIGHT_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/fst-decl.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// This file contains declarations of classes in the Fst template library.\n\n#ifndef FST_FST_DECL_H_\n#define FST_FST_DECL_H_\n\n#include <sys/types.h>\n#include <memory>  // for allocator<>\n\n#include <fst/types.h>\n\nnamespace fst {\n\n// Symbol table and iterator.\n\nclass SymbolTable;\n\nclass SymbolTableIterator;\n\n// Weight templates and weights.\n\ntemplate <class T>\nclass FloatWeightTpl;\n\ntemplate <class T>\nclass TropicalWeightTpl;\n\ntemplate <class T>\nclass LogWeightTpl;\n\ntemplate <class T>\nclass MinMaxWeightTpl;\n\nusing FloatWeight = FloatWeightTpl<float>;\n\nusing TropicalWeight = TropicalWeightTpl<float>;\n\nusing LogWeight = LogWeightTpl<float>;\n\nusing MinMaxWeight = MinMaxWeightTpl<float>;\n\n// Arc templates and arcs.\n\ntemplate <class Weight>\nstruct ArcTpl;\n\nusing StdArc = ArcTpl<TropicalWeight>;\n\nusing LogArc = ArcTpl<LogWeight>;\n\n// Stores.\n\ntemplate <class Element, class U>\nclass DefaultCompactStore;\n\ntemplate <class Arc>\nclass DefaultCacheStore;\n\n// FST templates.\n\ntemplate <class A, class ArcCompactor, class Unsigned = uint32_t,\n    class CompactStore = DefaultCompactStore<typename ArcCompactor::Element, Unsigned>,\n    class CacheStore = DefaultCacheStore<A>>\nclass CompactFst;\n\ntemplate <class Arc, class U = uint32_t>\nclass ConstFst;\n\ntemplate <class Arc, class Weight, class Matcher>\nclass EditFst;\n\ntemplate <class Arc>\nclass ExpandedFst;\n\ntemplate <class Arc>\nclass Fst;\n\ntemplate <class Arc>\nclass MutableFst;\n\ntemplate <class A, class Allocator = std::allocator<A>>\nclass VectorState;\n\ntemplate <class A, class State = VectorState<A>>\nclass VectorFst;\n\ntemplate <class Arc, class U = std::ptrdiff_t>\nclass DefaultReplaceStateTable;\n\n// On-the-fly operations.\n\ntemplate <class Arc, class Compare>\nclass ArcSortFst;\n\ntemplate <class Arc>\nclass ClosureFst;\n\ntemplate <class A, class Store = DefaultCacheStore<A>>\nclass ComposeFst;\n\ntemplate <class Arc>\nclass ConcatFst;\n\ntemplate <class Arc>\nclass DeterminizeFst;\n\ntemplate <class Arc>\nclass DifferenceFst;\n\ntemplate <class Arc>\nclass IntersectFst;\n\ntemplate <class Arc>\nclass InvertFst;\n\ntemplate <class AArc, class BArc, class Mapper>\nclass ArcMapFst;\n\ntemplate <class Arc>\nclass ProjectFst;\n\ntemplate <class AArc, class BArc, class Selector>\nclass RandGenFst;\n\ntemplate <class Arc>\nclass RelabelFst;\n\ntemplate <class A, class StateTable = DefaultReplaceStateTable<A>,\n          class Store = DefaultCacheStore<A>>\nclass ReplaceFst;\n\ntemplate <class Arc>\nclass RmEpsilonFst;\n\ntemplate <class Arc>\nclass UnionFst;\n\n// Heap.\n\ntemplate <class T, class Compare>\nclass Heap;\n\n// Compactors.\n\ntemplate <class Arc>\nclass AcceptorCompactor;\n\ntemplate <class Arc>\nclass StringCompactor;\n\ntemplate <class Arc>\nclass UnweightedAcceptorCompactor;\n\ntemplate <class Arc>\nclass UnweightedCompactor;\n\ntemplate <class Arc>\nclass WeightedStringCompactor;\n\n// Compact FSTs.\n\ntemplate <class Arc, class U = uint32_t>\nusing CompactStringFst = CompactFst<Arc, StringCompactor<Arc>, U>;\n\ntemplate <class Arc, class U = uint32_t>\nusing CompactWeightedStringFst =\n    CompactFst<Arc, WeightedStringCompactor<Arc>, U>;\n\ntemplate <class Arc, class U = uint32_t>\nusing CompactAcceptorFst = CompactFst<Arc, AcceptorCompactor<Arc>, U>;\n\ntemplate <class Arc, class U = uint32_t>\nusing CompactUnweightedFst = CompactFst<Arc, UnweightedCompactor<Arc>, U>;\n\ntemplate <class Arc, class U = uint32_t>\nusing CompactUnweightedAcceptorFst =\n    CompactFst<Arc, UnweightedAcceptorCompactor<Arc>, U>;\n\n// StdArc aliases for FSTs.\n\nusing StdConstFst = ConstFst<StdArc>;\nusing StdExpandedFst = ExpandedFst<StdArc>;\nusing StdFst = Fst<StdArc>;\nusing StdMutableFst = MutableFst<StdArc>;\nusing StdVectorFst = VectorFst<StdArc>;\n\n// StdArc aliases for on-the-fly operations.\n\ntemplate <class Compare>\nusing StdArcSortFst = ArcSortFst<StdArc, Compare>;\n\nusing StdClosureFst = ClosureFst<StdArc>;\n\nusing StdComposeFst = ComposeFst<StdArc>;\n\nusing StdConcatFst = ConcatFst<StdArc>;\n\nusing StdDeterminizeFst = DeterminizeFst<StdArc>;\n\nusing StdDifferenceFst = DifferenceFst<StdArc>;\n\nusing StdIntersectFst = IntersectFst<StdArc>;\n\nusing StdInvertFst = InvertFst<StdArc>;\n\nusing StdProjectFst = ProjectFst<StdArc>;\n\nusing StdRelabelFst = RelabelFst<StdArc>;\n\nusing StdReplaceFst = ReplaceFst<StdArc>;\n\nusing StdRmEpsilonFst = RmEpsilonFst<StdArc>;\n\nusing StdUnionFst = UnionFst<StdArc>;\n\n// Filter states.\n\ntemplate <class T>\nclass IntegerFilterState;\n\nusing CharFilterState = IntegerFilterState<signed char>;\n\nusing ShortFilterState = IntegerFilterState<short>;  // NOLINT\n\nusing IntFilterState = IntegerFilterState<int>;\n\n// Matchers and filters.\n\ntemplate <class FST>\nclass Matcher;\n\ntemplate <class M1, class M2 = M1>\nclass NullComposeFilter;\n\ntemplate <class M1, class M2 = M1>\nclass TrivialComposeFilter;\n\ntemplate <class M1, class M2 = M1>\nclass SequenceComposeFilter;\n\ntemplate <class M1, class M2 = M1>\nclass AltSequenceComposeFilter;\n\ntemplate <class M1, class M2 = M1>\nclass MatchComposeFilter;\n\n}  // namespace fst\n\n#endif  // FST_FST_DECL_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/fst.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// FST abstract base class definition, state and arc iterator interface, and\n// suggested base implementation.\n\n#ifndef FST_FST_H_\n#define FST_FST_H_\n\n#include <sys/types.h>\n\n#include <cmath>\n#include <cstddef>\n\n#include <iostream>\n#include <memory>\n#include <sstream>\n#include <string>\n#include <utility>\n\n#include <fst/compat.h>\n#include <fst/flags.h>\n#include <fst/log.h>\n#include <fstream>\n\n#include <fst/arc.h>\n#include <fst/memory.h>\n#include <fst/properties.h>\n#include <fst/register.h>\n#include <fst/symbol-table.h>\n#include <fst/util.h>\n\n\nDECLARE_bool(fst_align);\n\nnamespace fst {\n\nbool IsFstHeader(std::istream &, const string &);\n\nclass FstHeader;\n\ntemplate <class Arc>\nstruct StateIteratorData;\n\ntemplate <class Arc>\nstruct ArcIteratorData;\n\ntemplate <class Arc>\nclass MatcherBase;\n\nstruct FstReadOptions {\n  // FileReadMode(s) are advisory, there are many conditions than prevent a\n  // file from being mapped, READ mode will be selected in these cases with\n  // a warning indicating why it was chosen.\n  enum FileReadMode { READ, MAP };\n\n  string source;                // Where you're reading from.\n  const FstHeader *header;      // Pointer to FST header; if non-zero, use\n                                // this info (don't read a stream header).\n  const SymbolTable *isymbols;  // Pointer to input symbols; if non-zero, use\n                                // this info (read and skip stream isymbols)\n  const SymbolTable *osymbols;  // Pointer to output symbols; if non-zero, use\n                                // this info (read and skip stream osymbols)\n  FileReadMode mode;            // Read or map files (advisory, if possible)\n  bool read_isymbols;           // Read isymbols, if any (default: true).\n  bool read_osymbols;           // Read osymbols, if any (default: true).\n\n  explicit FstReadOptions(const string &source = \"<unspecified>\",\n                          const FstHeader *header = nullptr,\n                          const SymbolTable *isymbols = nullptr,\n                          const SymbolTable *osymbols = nullptr);\n\n  explicit FstReadOptions(const string &source, const SymbolTable *isymbols,\n                          const SymbolTable *osymbols = nullptr);\n\n  // Helper function to convert strings FileReadModes into their enum value.\n  static FileReadMode ReadMode(const string &mode);\n\n  // Outputs a debug string for the FstReadOptions object.\n  string DebugString() const;\n};\n\nstruct FstWriteOptions {\n  string source;        // Where you're writing to.\n  bool write_header;    // Write the header?\n  bool write_isymbols;  // Write input symbols?\n  bool write_osymbols;  // Write output symbols?\n  bool align;           // Write data aligned (may fail on pipes)?\n  bool stream_write;    // Avoid seek operations in writing.\n\n  explicit FstWriteOptions(const string &source = \"<unspecifed>\",\n                           bool write_header = true, bool write_isymbols = true,\n                           bool write_osymbols = true,\n                           bool align = FLAGS_fst_align,\n                           bool stream_write = false)\n      : source(source),\n        write_header(write_header),\n        write_isymbols(write_isymbols),\n        write_osymbols(write_osymbols),\n        align(align),\n        stream_write(stream_write) {}\n};\n\n// Header class.\n//\n// This is the recommended file header representation.\n\nclass FstHeader {\n public:\n  enum {\n    HAS_ISYMBOLS = 0x1,  // Has input symbol table.\n    HAS_OSYMBOLS = 0x2,  // Has output symbol table.\n    IS_ALIGNED = 0x4,    // Memory-aligned (where appropriate).\n  } Flags;\n\n  FstHeader() : version_(0), flags_(0), properties_(0), start_(-1),\n      numstates_(0), numarcs_(0) {}\n\n  const string &FstType() const { return fsttype_; }\n\n  const string &ArcType() const { return arctype_; }\n\n  int32_t Version() const { return version_; }\n\n  int32_t GetFlags() const { return flags_; }\n\n  uint64_t Properties() const { return properties_; }\n\n  int64_t Start() const { return start_; }\n\n  int64_t NumStates() const { return numstates_; }\n\n  int64_t NumArcs() const { return numarcs_; }\n\n  void SetFstType(const string &type) { fsttype_ = type; }\n\n  void SetArcType(const string &type) { arctype_ = type; }\n\n  void SetVersion(int32_t version) { version_ = version; }\n\n  void SetFlags(int32_t flags) { flags_ = flags; }\n\n  void SetProperties(uint64_t properties) { properties_ = properties; }\n\n  void SetStart(int64_t start) { start_ = start; }\n\n  void SetNumStates(int64_t numstates) { numstates_ = numstates; }\n\n  void SetNumArcs(int64_t numarcs) { numarcs_ = numarcs; }\n\n  bool Read(std::istream &strm, const string &source,\n            bool rewind = false);\n\n  bool Write(std::ostream &strm, const string &source) const;\n\n  // Outputs a debug string for the FstHeader object.\n  string DebugString() const;\n\n private:\n  string fsttype_;     // E.g. \"vector\".\n  string arctype_;     // E.g. \"standard\".\n  int32_t version_;      // Type version number.\n  int32_t flags_;        // File format bits.\n  uint64_t properties_;  // FST property bits.\n  int64_t start_;        // Start state.\n  int64_t numstates_;    // # of states.\n  int64_t numarcs_;      // # of arcs.\n};\n\n// Specifies matcher action.\nenum MatchType {\n  MATCH_INPUT = 1,   // Match input label.\n  MATCH_OUTPUT = 2,  // Match output label.\n  MATCH_BOTH = 3,    // Match input or output label.\n  MATCH_NONE = 4,    // Match nothing.\n  MATCH_UNKNOWN = 5\n};  // Otherwise, match type unknown.\n\nconstexpr int kNoLabel = -1;    // Not a valid label.\nconstexpr int kNoStateId = -1;  // Not a valid state ID.\n\n// A generic FST, templated on the arc definition, with common-demoninator\n// methods (use StateIterator and ArcIterator to iterate over its states and\n// arcs).\ntemplate <class A>\nclass Fst {\n public:\n  using Arc = A;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  virtual ~Fst() {}\n\n  // Initial state.\n  virtual StateId Start() const = 0;\n\n  // State's final weight.\n  virtual Weight Final(StateId) const = 0;\n\n  // State's arc count.\n  virtual size_t NumArcs(StateId) const = 0;\n\n  // State's input epsilon count.\n  virtual size_t NumInputEpsilons(StateId) const = 0;\n\n  // State's output epsilon count.\n  virtual size_t NumOutputEpsilons(StateId) const = 0;\n\n  // Property bits. If test = false, return stored properties bits for mask\n  // (some possibly unknown); if test = true, return property bits for mask\n  // (computing o.w. unknown).\n  virtual uint64_t Properties(uint64_t mask, bool test) const = 0;\n\n  // FST type name.\n  virtual const string &Type() const = 0;\n\n  // Gets a copy of this Fst. The copying behaves as follows:\n  //\n  // (1) The copying is constant time if safe = false or if safe = true\n  // and is on an otherwise unaccessed FST.\n  //\n  // (2) If safe = true, the copy is thread-safe in that the original\n  // and copy can be safely accessed (but not necessarily mutated) by\n  // separate threads. For some FST types, 'Copy(true)' should only be\n  // called on an FST that has not otherwise been accessed. Behavior is\n  // otherwise undefined.\n  //\n  // (3) If a MutableFst is copied and then mutated, then the original is\n  // unmodified and vice versa (often by a copy-on-write on the initial\n  // mutation, which may not be constant time).\n  virtual Fst<Arc> *Copy(bool safe = false) const = 0;\n\n  // Reads an FST from an input stream; returns nullptr on error.\n  static Fst<Arc> *Read(std::istream &strm, const FstReadOptions &opts) {\n    FstReadOptions ropts(opts);\n    FstHeader hdr;\n    if (ropts.header) {\n      hdr = *opts.header;\n    } else {\n      if (!hdr.Read(strm, opts.source)) return nullptr;\n      ropts.header = &hdr;\n    }\n    const auto &fst_type = hdr.FstType();\n    const auto reader = FstRegister<Arc>::GetRegister()->GetReader(fst_type);\n    if (!reader) {\n      LOG(ERROR) << \"Fst::Read: Unknown FST type \" << fst_type\n                 << \" (arc type = \" << Arc::Type() << \"): \" << ropts.source;\n      return nullptr;\n    }\n    return reader(strm, ropts);\n  }\n\n  // Reads an FST from a file; returns nullptr on error. An empty filename\n  // results in reading from standard input.\n  static Fst<Arc> *Read(const string &filename) {\n    if (!filename.empty()) {\n      std::ifstream strm(filename,\n                              std::ios_base::in | std::ios_base::binary);\n      if (!strm) {\n        LOG(ERROR) << \"Fst::Read: Can't open file: \" << filename;\n        return nullptr;\n      }\n      return Read(strm, FstReadOptions(filename));\n    } else {\n      return Read(std::cin, FstReadOptions(\"standard input\"));\n    }\n  }\n\n  // Writes an FST to an output stream; returns false on error.\n  virtual bool Write(std::ostream &strm, const FstWriteOptions &opts) const {\n    LOG(ERROR) << \"Fst::Write: No write stream method for \" << Type()\n               << \" FST type\";\n    return false;\n  }\n\n  // Writes an FST to a file; returns false on error; an empty filename\n  // results in writing to standard output.\n  virtual bool Write(const string &filename) const {\n    LOG(ERROR) << \"Fst::Write: No write filename method for \" << Type()\n               << \" FST type\";\n    return false;\n  }\n\n  // Returns input label symbol table; return nullptr if not specified.\n  virtual const SymbolTable *InputSymbols() const = 0;\n\n  // Return output label symbol table; return nullptr if not specified.\n  virtual const SymbolTable *OutputSymbols() const = 0;\n\n  // For generic state iterator construction (not normally called directly by\n  // users). Does not copy the FST.\n  virtual void InitStateIterator(StateIteratorData<Arc> *data) const = 0;\n\n  // For generic arc iterator construction (not normally called directly by\n  // users). Does not copy the FST.\n  virtual void InitArcIterator(StateId s, ArcIteratorData<Arc> *data) const = 0;\n\n  // For generic matcher construction (not normally called directly by users).\n  // Does not copy the FST.\n  virtual MatcherBase<Arc> *InitMatcher(MatchType match_type) const;\n\n protected:\n  bool WriteFile(const string &filename) const {\n    if (!filename.empty()) {\n      std::ofstream strm(filename,\n                               std::ios_base::out | std::ios_base::binary);\n      if (!strm) {\n        LOG(ERROR) << \"Fst::Write: Can't open file: \" << filename;\n        return false;\n      }\n      bool val = Write(strm, FstWriteOptions(filename));\n      if (!val) LOG(ERROR) << \"Fst::Write failed: \" << filename;\n      return val;\n    } else {\n      return Write(std::cout, FstWriteOptions(\"standard output\"));\n    }\n  }\n};\n\n// A useful alias when using StdArc.\nusing StdFst = Fst<StdArc>;\n\n// State and arc iterator definitions.\n//\n// State iterator interface templated on the Arc definition; used for\n// StateIterator specializations returned by the InitStateIterator FST method.\ntemplate <class Arc>\nclass StateIteratorBase {\n public:\n  using StateId = typename Arc::StateId;\n\n  virtual ~StateIteratorBase() {}\n\n  // End of iterator?\n  virtual bool Done() const = 0;\n  // Returns current state (when !Done()).\n  virtual StateId Value() const = 0;\n  // Advances to next state (when !Done()).\n  virtual void Next() = 0;\n  // Resets to initial condition.\n  virtual void Reset() = 0;\n};\n\n// StateIterator initialization data.\n\ntemplate <class Arc>\nstruct StateIteratorData {\n  using StateId = typename Arc::StateId;\n\n  // Specialized iterator if non-zero.\n  StateIteratorBase<Arc> *base;\n  // Otherwise, the total number of states.\n  StateId nstates;\n\n  StateIteratorData() : base(nullptr), nstates(0) {}\n\n  StateIteratorData(const StateIteratorData &) = delete;\n  StateIteratorData &operator=(const StateIteratorData &) = delete;\n};\n\n// Generic state iterator, templated on the FST definition (a wrapper\n// around a pointer to a specific one). Here is a typical use:\n//\n//   for (StateIterator<StdFst> siter(fst);\n//        !siter.Done();\n//        siter.Next()) {\n//     StateId s = siter.Value();\n//     ...\n//   }\n// There is no copying of the FST.\ntemplate <class FST>\nclass StateIterator {\n public:\n  using Arc = typename FST::Arc;\n  using StateId = typename Arc::StateId;\n\n  explicit StateIterator(const FST &fst) : s_(0) {\n    fst.InitStateIterator(&data_);\n  }\n\n  ~StateIterator() { delete data_.base; }\n\n  bool Done() const {\n    return data_.base ? data_.base->Done() : s_ >= data_.nstates;\n  }\n\n  StateId Value() const { return data_.base ? data_.base->Value() : s_; }\n\n  void Next() {\n    if (data_.base) {\n      data_.base->Next();\n    } else {\n      ++s_;\n    }\n  }\n\n  void Reset() {\n    if (data_.base) {\n      data_.base->Reset();\n    } else {\n      s_ = 0;\n    }\n  }\n\n private:\n  StateIteratorData<Arc> data_;\n  StateId s_;\n};\n\n// Flags to control the behavior on an arc iterator.\nstatic constexpr uint32_t kArcILabelValue =\n    0x0001;  // Value() gives valid ilabel.\nstatic constexpr uint32_t kArcOLabelValue = 0x0002;  //  \"       \"     \" olabel.\nstatic constexpr uint32_t kArcWeightValue = 0x0004;  //  \"       \"     \" weight.\nstatic constexpr uint32_t kArcNextStateValue =\n    0x0008;                                    //  \"       \"     \" nextstate.\nstatic constexpr uint32_t kArcNoCache = 0x0010;  // No need to cache arcs.\n\nstatic constexpr uint32_t kArcValueFlags =\n    kArcILabelValue | kArcOLabelValue | kArcWeightValue | kArcNextStateValue;\n\nstatic constexpr uint32_t kArcFlags = kArcValueFlags | kArcNoCache;\n\n// Arc iterator interface, templated on the arc definition; used for arc\n// iterator specializations that are returned by the InitArcIterator FST method.\ntemplate <class Arc>\nclass ArcIteratorBase {\n public:\n  using StateId = typename Arc::StateId;\n\n  virtual ~ArcIteratorBase() {}\n\n  // End of iterator?\n  virtual bool Done() const = 0;\n  // Returns current arc (when !Done()).\n  virtual const Arc &Value() const = 0;\n  // Advances to next arc (when !Done()).\n  virtual void Next() = 0;\n  // Returns current position.\n  virtual size_t Position() const = 0;\n  // Returns to initial condition.\n  virtual void Reset() = 0;\n  // Advances to arbitrary arc by position.\n  virtual void Seek(size_t) = 0;\n  // Returns current behavorial flags\n  virtual uint32_t Flags() const = 0;\n  // Sets behavorial flags.\n  virtual void SetFlags(uint32_t, uint32_t) = 0;\n};\n\n// ArcIterator initialization data.\ntemplate <class Arc>\nstruct ArcIteratorData {\n  ArcIteratorData()\n      : base(nullptr), arcs(nullptr), narcs(0), ref_count(nullptr) {}\n\n  ArcIteratorData(const ArcIteratorData &) = delete;\n\n  ArcIteratorData &operator=(const ArcIteratorData &) = delete;\n\n  ArcIteratorBase<Arc> *base;  // Specialized iterator if non-zero.\n  const Arc *arcs;             // O.w. arcs pointer\n  size_t narcs;                // ... and arc count.\n  int *ref_count;              // ... and reference count if non-zero.\n};\n\n// Generic arc iterator, templated on the FST definition (a wrapper around a\n// pointer to a specific one). Here is a typical use:\n//\n//   for (ArcIterator<StdFst> aiter(fst, s);\n//        !aiter.Done();\n//         aiter.Next()) {\n//     StdArc &arc = aiter.Value();\n//     ...\n//   }\n// There is no copying of the FST.\ntemplate <class FST>\nclass ArcIterator {\n public:\n  using Arc = typename FST::Arc;\n  using StateId = typename Arc::StateId;\n\n  ArcIterator(const FST &fst, StateId s) : i_(0) {\n    fst.InitArcIterator(s, &data_);\n  }\n\n  explicit ArcIterator(const ArcIteratorData<Arc> &data) : data_(data), i_(0) {\n    if (data_.ref_count) ++(*data_.ref_count);\n  }\n\n  ~ArcIterator() {\n    if (data_.base) {\n      delete data_.base;\n    } else if (data_.ref_count) {\n      --(*data_.ref_count);\n    }\n  }\n\n  bool Done() const {\n    return data_.base ? data_.base->Done() : i_ >= data_.narcs;\n  }\n\n  const Arc &Value() const {\n    return data_.base ? data_.base->Value() : data_.arcs[i_];\n  }\n\n  void Next() {\n    if (data_.base) {\n      data_.base->Next();\n    } else {\n      ++i_;\n    }\n  }\n\n  void Reset() {\n    if (data_.base) {\n      data_.base->Reset();\n    } else {\n      i_ = 0;\n    }\n  }\n\n  void Seek(size_t a) {\n    if (data_.base) {\n      data_.base->Seek(a);\n    } else {\n      i_ = a;\n    }\n  }\n\n  size_t Position() const { return data_.base ? data_.base->Position() : i_; }\n\n  uint32_t Flags() const {\n    if (data_.base) {\n      return data_.base->Flags();\n    } else {\n      return kArcValueFlags;\n    }\n  }\n\n  void SetFlags(uint32_t flags, uint32_t mask) {\n    if (data_.base) data_.base->SetFlags(flags, mask);\n  }\n\n private:\n  ArcIteratorData<Arc> data_;\n  size_t i_;\n};\n\n}  // namespace fst\n\n// ArcIterator placement operator new and destroy function; new needs to be in\n// the global namespace.\n\ntemplate <class FST>\nvoid *operator new(size_t size,\n                   fst::MemoryPool<fst::ArcIterator<FST>> *pool) {\n  return pool->Allocate();\n}\n\nnamespace fst {\n\ntemplate <class FST>\nvoid Destroy(ArcIterator<FST> *aiter, MemoryPool<ArcIterator<FST>> *pool) {\n  if (aiter) {\n    aiter->~ArcIterator<FST>();\n    pool->Free(aiter);\n  }\n}\n\n// Matcher definitions.\n\ntemplate <class Arc>\nMatcherBase<Arc> *Fst<Arc>::InitMatcher(MatchType match_type) const {\n  return nullptr;  // One should just use the default matcher.\n}\n\n// FST accessors, useful in high-performance applications.\n\nnamespace internal {\n\n// General case, requires non-abstract, 'final' methods. Use for inlining.\n\ntemplate <class F>\ninline typename F::Arc::Weight Final(const F &fst, typename F::Arc::StateId s) {\n  return fst.F::Final(s);\n}\n\ntemplate <class F>\ninline std::ptrdiff_t NumArcs(const F &fst, typename F::Arc::StateId s) {\n  return fst.F::NumArcs(s);\n}\n\ntemplate <class F>\ninline std::ptrdiff_t NumInputEpsilons(const F &fst, typename F::Arc::StateId s) {\n  return fst.F::NumInputEpsilons(s);\n}\n\ntemplate <class F>\ninline std::ptrdiff_t NumOutputEpsilons(const F &fst, typename F::Arc::StateId s) {\n  return fst.F::NumOutputEpsilons(s);\n}\n\n// Fst<Arc> case, abstract methods.\n\ntemplate <class Arc>\ninline typename Arc::Weight Final(const Fst<Arc> &fst,\n                                  typename Arc::StateId s) {\n  return fst.Final(s);\n}\n\ntemplate <class Arc>\ninline size_t NumArcs(const Fst<Arc> &fst, typename Arc::StateId s) {\n  return fst.NumArcs(s);\n}\n\ntemplate <class Arc>\ninline size_t NumInputEpsilons(const Fst<Arc> &fst, typename Arc::StateId s) {\n  return fst.NumInputEpsilons(s);\n}\n\ntemplate <class Arc>\ninline size_t NumOutputEpsilons(const Fst<Arc> &fst, typename Arc::StateId s) {\n  return fst.NumOutputEpsilons(s);\n}\n\n// FST implementation base.\n//\n// This is the recommended FST implementation base class. It will handle\n// reference counts, property bits, type information and symbols.\n//\n// Users are discouraged, but not prohibited, from subclassing this outside the\n// FST library.\ntemplate <class Arc>\nclass FstImpl {\n public:\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  FstImpl() : properties_(0), type_(\"null\") {}\n\n  FstImpl(const FstImpl<Arc> &impl)\n      : properties_(impl.properties_),\n        type_(impl.type_),\n        isymbols_(impl.isymbols_ ? impl.isymbols_->Copy() : nullptr),\n        osymbols_(impl.osymbols_ ? impl.osymbols_->Copy() : nullptr) {}\n\n  virtual ~FstImpl() {}\n\n  const string &Type() const { return type_; }\n\n  void SetType(const string &type) { type_ = type; }\n\n  virtual uint64_t Properties() const { return properties_; }\n\n  virtual uint64_t Properties(uint64_t mask) const { return properties_ & mask; }\n\n  void SetProperties(uint64_t props) {\n    properties_ &= kError;  // kError can't be cleared.\n    properties_ |= props;\n  }\n\n  void SetProperties(uint64_t props, uint64_t mask) {\n    properties_ &= ~mask | kError;  // kError can't be cleared.\n    properties_ |= props & mask;\n  }\n\n  // Allows (only) setting error bit on const FST implementations.\n  void SetProperties(uint64_t props, uint64_t mask) const {\n    if (mask != kError) {\n      FSTERROR() << \"FstImpl::SetProperties() const: Can only set kError\";\n    }\n    properties_ |= kError;\n  }\n\n  const SymbolTable *InputSymbols() const { return isymbols_.get(); }\n\n  const SymbolTable *OutputSymbols() const { return osymbols_.get(); }\n\n  SymbolTable *InputSymbols() { return isymbols_.get(); }\n\n  SymbolTable *OutputSymbols() { return osymbols_.get(); }\n\n  void SetInputSymbols(const SymbolTable *isyms) {\n    isymbols_.reset(isyms ? isyms->Copy() : nullptr);\n  }\n\n  void SetOutputSymbols(const SymbolTable *osyms) {\n    osymbols_.reset(osyms ? osyms->Copy() : nullptr);\n  }\n\n  // Reads header and symbols from input stream, initializes FST, and returns\n  // the header. If opts.header is non-null, skips reading and uses the option\n  // value instead. If opts.[io]symbols is non-null, reads in (if present), but\n  // uses the option value.\n  bool ReadHeader(std::istream &strm, const FstReadOptions &opts,\n                  int min_version, FstHeader *hdr);\n\n  // Writes header and symbols to output stream. If opts.header is false, skips\n  // writing header. If opts.[io]symbols is false, skips writing those symbols.\n  // This method is needed for implementations that implement Write methods.\n  void WriteHeader(std::ostream &strm, const FstWriteOptions &opts,\n                   int version, FstHeader *hdr) const {\n    if (opts.write_header) {\n      hdr->SetFstType(type_);\n      hdr->SetArcType(Arc::Type());\n      hdr->SetVersion(version);\n      hdr->SetProperties(properties_);\n      int32_t file_flags = 0;\n      if (isymbols_ && opts.write_isymbols) {\n        file_flags |= FstHeader::HAS_ISYMBOLS;\n      }\n      if (osymbols_ && opts.write_osymbols) {\n        file_flags |= FstHeader::HAS_OSYMBOLS;\n      }\n      if (opts.align) file_flags |= FstHeader::IS_ALIGNED;\n      hdr->SetFlags(file_flags);\n      hdr->Write(strm, opts.source);\n    }\n    if (isymbols_ && opts.write_isymbols) isymbols_->Write(strm);\n    if (osymbols_ && opts.write_osymbols) osymbols_->Write(strm);\n  }\n\n  // Writes out header and symbols to output stream. If opts.header is false,\n  // skips writing header. If opts.[io]symbols is false, skips writing those\n  // symbols. `type` is the FST type being written. This method is used in the\n  // cross-type serialization methods Fst::WriteFst.\n  static void WriteFstHeader(const Fst<Arc> &fst, std::ostream &strm,\n                             const FstWriteOptions &opts, int version,\n                             const string &type, uint64_t properties,\n                             FstHeader *hdr) {\n    if (opts.write_header) {\n      hdr->SetFstType(type);\n      hdr->SetArcType(Arc::Type());\n      hdr->SetVersion(version);\n      hdr->SetProperties(properties);\n      int32_t file_flags = 0;\n      if (fst.InputSymbols() && opts.write_isymbols) {\n        file_flags |= FstHeader::HAS_ISYMBOLS;\n      }\n      if (fst.OutputSymbols() && opts.write_osymbols) {\n        file_flags |= FstHeader::HAS_OSYMBOLS;\n      }\n      if (opts.align) file_flags |= FstHeader::IS_ALIGNED;\n      hdr->SetFlags(file_flags);\n      hdr->Write(strm, opts.source);\n    }\n    if (fst.InputSymbols() && opts.write_isymbols) {\n      fst.InputSymbols()->Write(strm);\n    }\n    if (fst.OutputSymbols() && opts.write_osymbols) {\n      fst.OutputSymbols()->Write(strm);\n    }\n  }\n\n  // In serialization routines where the header cannot be written until after\n  // the machine has been serialized, this routine can be called to seek to the\n  // beginning of the file an rewrite the header with updated fields. It\n  // repositions the file pointer back at the end of the file. Returns true on\n  // success, false on failure.\n  static bool UpdateFstHeader(const Fst<Arc> &fst, std::ostream &strm,\n                              const FstWriteOptions &opts, int version,\n                              const string &type, uint64_t properties,\n                              FstHeader *hdr, size_t header_offset) {\n    strm.seekp(header_offset);\n    if (!strm) {\n      LOG(ERROR) << \"Fst::UpdateFstHeader: Write failed: \" << opts.source;\n      return false;\n    }\n    WriteFstHeader(fst, strm, opts, version, type, properties, hdr);\n    if (!strm) {\n      LOG(ERROR) << \"Fst::UpdateFstHeader: Write failed: \" << opts.source;\n      return false;\n    }\n    strm.seekp(0, std::ios_base::end);\n    if (!strm) {\n      LOG(ERROR) << \"Fst::UpdateFstHeader: Write failed: \" << opts.source;\n      return false;\n    }\n    return true;\n  }\n\n protected:\n  mutable uint64_t properties_;  // Property bits.\n\n private:\n  string type_;  // Unique name of FST class.\n  std::unique_ptr<SymbolTable> isymbols_;\n  std::unique_ptr<SymbolTable> osymbols_;\n};\n\ntemplate <class Arc>\nbool FstImpl<Arc>::ReadHeader(std::istream &strm, const FstReadOptions &opts,\n                              int min_version, FstHeader *hdr) {\n  if (opts.header) {\n    *hdr = *opts.header;\n  } else if (!hdr->Read(strm, opts.source)) {\n    return false;\n  }\n  if (FLAGS_v >= 2) {\n    LOG(INFO) << \"FstImpl::ReadHeader: source: \" << opts.source\n              << \", fst_type: \" << hdr->FstType()\n              << \", arc_type: \" << Arc::Type()\n              << \", version: \" << hdr->Version()\n              << \", flags: \" << hdr->GetFlags();\n  }\n  if (hdr->FstType() != type_) {\n    LOG(ERROR) << \"FstImpl::ReadHeader: FST not of type \" << type_\n               << \": \" << opts.source;\n    return false;\n  }\n  if (hdr->ArcType() != Arc::Type()) {\n    LOG(ERROR) << \"FstImpl::ReadHeader: Arc not of type \" << Arc::Type()\n               << \": \" << opts.source;\n    return false;\n  }\n  if (hdr->Version() < min_version) {\n    LOG(ERROR) << \"FstImpl::ReadHeader: Obsolete \" << type_\n               << \" FST version: \" << opts.source;\n    return false;\n  }\n  properties_ = hdr->Properties();\n  if (hdr->GetFlags() & FstHeader::HAS_ISYMBOLS) {\n    isymbols_.reset(SymbolTable::Read(strm, opts.source));\n  }\n  // Deletes input symbol table.\n  if (!opts.read_isymbols) SetInputSymbols(nullptr);\n  if (hdr->GetFlags() & FstHeader::HAS_OSYMBOLS) {\n    osymbols_.reset(SymbolTable::Read(strm, opts.source));\n  }\n  // Deletes output symbol table.\n  if (!opts.read_osymbols) SetOutputSymbols(nullptr);\n  if (opts.isymbols) {\n    isymbols_.reset(opts.isymbols->Copy());\n  }\n  if (opts.osymbols) {\n    osymbols_.reset(opts.osymbols->Copy());\n  }\n  return true;\n}\n\n}  // namespace internal\n\ntemplate <class Arc>\nuint64_t TestProperties(const Fst<Arc> &fst, uint64_t mask, uint64_t *known);\n\n// This is a helper class template useful for attaching an FST interface to\n// its implementation, handling reference counting.\ntemplate <class Impl, class FST = Fst<typename Impl::Arc>>\nclass ImplToFst : public FST {\n public:\n  using Arc = typename Impl::Arc;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n  using FST::operator=;\n\n  StateId Start() const override { return impl_->Start(); }\n\n  Weight Final(StateId s) const override { return impl_->Final(s); }\n\n  size_t NumArcs(StateId s) const override { return impl_->NumArcs(s); }\n\n  size_t NumInputEpsilons(StateId s) const override {\n    return impl_->NumInputEpsilons(s);\n  }\n\n  size_t NumOutputEpsilons(StateId s) const override {\n    return impl_->NumOutputEpsilons(s);\n  }\n\n  uint64_t Properties(uint64_t mask, bool test) const override {\n    if (test) {\n      uint64_t knownprops, testprops = TestProperties(*this, mask, &knownprops);\n      impl_->SetProperties(testprops, knownprops);\n      return testprops & mask;\n    } else {\n      return impl_->Properties(mask);\n    }\n  }\n\n  const string &Type() const override { return impl_->Type(); }\n\n  const SymbolTable *InputSymbols() const override {\n    return impl_->InputSymbols();\n  }\n\n  const SymbolTable *OutputSymbols() const override {\n    return impl_->OutputSymbols();\n  }\n\n protected:\n  explicit ImplToFst(std::shared_ptr<Impl> impl) : impl_(std::move(impl)) {}\n\n  // This constructor presumes there is a copy constructor for the\n  // implementation.\n  ImplToFst(const ImplToFst<Impl, FST> &fst, bool safe) {\n    if (safe) {\n      impl_ = std::make_shared<Impl>(*(fst.impl_));\n    } else {\n      impl_ = fst.impl_;\n    }\n  }\n\n  // Returns raw pointers to the shared object.\n  const Impl *GetImpl() const { return impl_.get(); }\n\n  Impl *GetMutableImpl() const { return impl_.get(); }\n\n  // Returns a ref-counted smart poiner to the implementation.\n  std::shared_ptr<Impl> GetSharedImpl() const { return impl_; }\n\n  bool Unique() const { return impl_.unique(); }\n\n  void SetImpl(std::shared_ptr<Impl> impl) { impl_ = impl; }\n\n private:\n  template <class IFST, class OFST>\n  friend void Cast(const IFST &ifst, OFST *ofst);\n\n  std::shared_ptr<Impl> impl_;\n};\n\n// Converts FSTs by casting their implementations, where this makes sense\n// (which excludes implementations with weight-dependent virtual methods).\n// Must be a friend of the FST classes involved (currently the concrete FSTs:\n// ConstFst, CompactFst, and VectorFst). This can only be safely used for arc\n// types that have identical storage characteristics. As with an FST\n// copy constructor and Copy() method, this is a constant time operation\n// (but subject to copy-on-write if it is a MutableFst and modified).\ntemplate <class IFST, class OFST>\nvoid Cast(const IFST &ifst, OFST *ofst) {\n  using OImpl = typename OFST::Impl;\n  ofst->impl_ = std::shared_ptr<OImpl>(ifst.impl_,\n      reinterpret_cast<OImpl *>(ifst.impl_.get()));\n}\n\n// FST serialization.\n\ntemplate <class Arc>\nstring FstToString(const Fst<Arc> &fst,\n                   const FstWriteOptions &options =\n                       FstWriteOptions(\"FstToString\")) {\n  std::ostringstream ostrm;\n  fst.Write(ostrm, options);\n  return ostrm.str();\n}\n\ntemplate <class Arc>\nvoid FstToString(const Fst<Arc> &fst, string *result) {\n  *result = FstToString(fst);\n}\n\ntemplate <class Arc>\nvoid FstToString(const Fst<Arc> &fst, string *result,\n                 const FstWriteOptions &options) {\n  *result = FstToString(fst, options);\n}\n\ntemplate <class Arc>\nFst<Arc> *StringToFst(const string &s) {\n  std::istringstream istrm(s);\n  return Fst<Arc>::Read(istrm, FstReadOptions(\"StringToFst\"));\n}\n\n}  // namespace fst\n\n#endif  // FST_FST_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/fstlib.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// This is a library for constructing, combining, optimizing, and searching\n// \"weighted finite-state transducers\" (FSTs). Weighted finite-state transducers\n// are automata where each transition has an input label, an output label, and a\n// weight. The more familiar finite-state acceptor is represented as a\n// transducer with each transition's input and output the same. Finite-state\n// acceptors are used to represent sets of strings (specifically, \"regular\" or\n// \"rational sets\"); finite-state transducers are used to represent binary\n// relations between pairs of strings (specifically, \"rational transductions\").\n// The weights can be used to represent the cost of taking a particular\n// transition.\n//\n// In this library, transducers are templated on the Arc (transition)\n// definition, which allows changing the label, weight, and state ID sets.\n// Labels and state IDs are restricted to signed integral types but the weight\n// can be an arbitrary type whose members satisfy certain algebraic (\"semiring\")\n// properties.\n//\n// This convenience file includes all other FST header files.\n\n#ifndef FST_FSTLIB_H_\n#define FST_FSTLIB_H_\n\n\n// Abstract FST classes.\n#include <fst/expanded-fst.h>\n#include <fst/fst.h>\n#include <fst/mutable-fst.h>\n\n// Concrete FST classes.\n#include <fst/compact-fst.h>\n#include <fst/const-fst.h>\n#include <fst/edit-fst.h>\n#include <fst/vector-fst.h>\n\n// FST algorithms and delayed FST classes.\n#include <fst/arc-map.h>\n#include <fst/arcsort.h>\n#include <fst/closure.h>\n#include <fst/compose.h>\n#include <fst/concat.h>\n#include <fst/connect.h>\n#include <fst/determinize.h>\n#include <fst/difference.h>\n#include <fst/disambiguate.h>\n#include <fst/encode.h>\n#include <fst/epsnormalize.h>\n#include <fst/equal.h>\n#include <fst/equivalent.h>\n#include <fst/factor-weight.h>\n#include <fst/intersect.h>\n#include <fst/invert.h>\n#include <fst/isomorphic.h>\n#include <fst/map.h>\n#include <fst/minimize.h>\n#include <fst/project.h>\n#include <fst/prune.h>\n#include <fst/push.h>\n#include <fst/randequivalent.h>\n#include <fst/randgen.h>\n#include <fst/rational.h>\n#include <fst/relabel.h>\n#include <fst/replace.h>\n#include <fst/replace-util.h>\n#include <fst/reverse.h>\n#include <fst/reweight.h>\n#include <fst/rmepsilon.h>\n#include <fst/rmfinalepsilon.h>\n#include <fst/shortest-distance.h>\n#include <fst/shortest-path.h>\n#include <fst/state-map.h>\n#include <fst/statesort.h>\n#include <fst/synchronize.h>\n#include <fst/topsort.h>\n#include <fst/union.h>\n#include <fst/verify.h>\n#include <fst/visit.h>\n\n// Weights.\n#include <fst/expectation-weight.h>\n#include <fst/float-weight.h>\n#include <fst/lexicographic-weight.h>\n#include <fst/pair-weight.h>\n#include <fst/power-weight.h>\n#include <fst/product-weight.h>\n#include <fst/signed-log-weight.h>\n#include <fst/sparse-power-weight.h>\n#include <fst/sparse-tuple-weight.h>\n#include <fst/string-weight.h>\n#include <fst/tuple-weight.h>\n#include <fst/weight.h>\n\n// Auxiliary classes for composition.\n#include <fst/compose-filter.h>\n#include <fst/lookahead-filter.h>\n#include <fst/lookahead-matcher.h>\n#include <fst/matcher-fst.h>\n#include <fst/matcher.h>\n#include <fst/state-table.h>\n\n// Data structures.\n#include <fst/heap.h>\n#include <fst/interval-set.h>\n#include <fst/queue.h>\n#include <fst/union-find.h>\n\n// Miscellaneous.\n#include <fst/accumulator.h>\n#include <fst/add-on.h>\n#include <fst/arc.h>\n#include <fst/arcfilter.h>\n#include <fst/cache.h>\n#include <fst/complement.h>\n#include <fst/dfs-visit.h>\n#include <fst/generic-register.h>\n#include <fst/label-reachable.h>\n#include <fst/partition.h>\n#include <fst/properties.h>\n#include <fst/register.h>\n#include <fst/state-reachable.h>\n#include <fst/string.h>\n#include <fst/symbol-table.h>\n#include <fst/symbol-table-ops.h>\n#include <fst/test-properties.h>\n#include <fst/util.h>\n\n\n#endif  // FST_FSTLIB_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/generic-register.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#ifndef FST_GENERIC_REGISTER_H_\n#define FST_GENERIC_REGISTER_H_\n\n#include <fst/compat.h>\n#ifndef FST_NO_DYNAMIC_LINKING\n#include <dlfcn.h>\n#endif\n#include <map>\n#include <string>\n\n#include <fst/types.h>\n#include <fst/log.h>\n\n// Generic class representing a globally-stored correspondence between\n// objects of KeyType and EntryType.\n//\n// KeyType must:\n//\n// * be such as can be stored as a key in a std::map<>.\n// * be concatenable with a const char* with the + operator\n//   (or you must subclass and redefine LoadEntryFromSharedObject)\n//\n// EntryType must be default constructible.\n//\n// The third template parameter should be the type of a subclass of this class\n// (think CRTP). This is to allow GetRegister() to instantiate and return an\n// object of the appropriate type.\n\nnamespace fst {\n\ntemplate <class KeyType, class EntryType, class RegisterType>\nclass GenericRegister {\n public:\n  using Key = KeyType;\n  using Entry = EntryType;\n\n  static RegisterType *GetRegister() {\n    static auto reg = new RegisterType;\n    return reg;\n  }\n\n  void SetEntry(const KeyType &key, const EntryType &entry) {\n    MutexLock l(&register_lock_);\n    register_table_.insert(std::make_pair(key, entry));\n  }\n\n  EntryType GetEntry(const KeyType &key) const {\n    const auto *entry = LookupEntry(key);\n    if (entry) {\n      return *entry;\n    } else {\n      return LoadEntryFromSharedObject(key);\n    }\n  }\n\n  virtual ~GenericRegister() {}\n\n protected:\n  // Override this if you want to be able to load missing definitions from\n  // shared object files.\n  virtual EntryType LoadEntryFromSharedObject(const KeyType &key) const {\n#ifdef FST_NO_DYNAMIC_LINKING\n    return EntryType();\n#else\n    const auto so_filename = ConvertKeyToSoFilename(key);\n    void *handle = dlopen(so_filename.c_str(), RTLD_LAZY);\n    if (handle == nullptr) {\n      LOG(ERROR) << \"GenericRegister::GetEntry: \" << dlerror();\n      return EntryType();\n    }\n#ifdef RUN_MODULE_INITIALIZERS\n    RUN_MODULE_INITIALIZERS();\n#endif\n    // We assume that the DSO constructs a static object in its global scope\n    // that does the registration. Thus we need only load it, not call any\n    // methods.\n    const auto *entry = this->LookupEntry(key);\n    if (entry == nullptr) {\n      LOG(ERROR) << \"GenericRegister::GetEntry: \"\n                 << \"lookup failed in shared object: \" << so_filename;\n      return EntryType();\n    }\n    return *entry;\n#endif  // FST_NO_DYNAMIC_LINKING\n  }\n\n  // Override this to define how to turn a key into an SO filename.\n  virtual string ConvertKeyToSoFilename(const KeyType &key) const = 0;\n\n  virtual const EntryType *LookupEntry(const KeyType &key) const {\n    MutexLock l(&register_lock_);\n    const auto it = register_table_.find(key);\n    if (it != register_table_.end()) {\n      return &it->second;\n    } else {\n      return nullptr;\n    }\n  }\n\n private:\n  mutable Mutex register_lock_;\n  std::map<KeyType, EntryType> register_table_;\n};\n\n// Generic register-er class capable of creating new register entries in the\n// given RegisterType template parameter. This type must define types Key and\n// Entry, and have appropriate static GetRegister() and instance SetEntry()\n// functions. An easy way to accomplish this is to have RegisterType be the\n// type of a subclass of GenericRegister.\ntemplate <class RegisterType>\nclass GenericRegisterer {\n public:\n  using Key = typename RegisterType::Key;\n  using Entry = typename RegisterType::Entry;\n\n  GenericRegisterer(Key key, Entry entry) {\n    RegisterType::GetRegister()->SetEntry(key, entry);\n  }\n};\n\n}  // namespace fst\n\n#endif  // FST_GENERIC_REGISTER_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/heap.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Implementation of a heap as in STL, but allows tracking positions in heap\n// using a key. The key can be used to do an in-place update of values in the\n// heap.\n\n#ifndef FST_HEAP_H_\n#define FST_HEAP_H_\n\n#include <utility>\n#include <vector>\n\n#include <fst/compat.h>\nnamespace fst {\n\n// A templated heap implementation that supports in-place update of values.\n//\n// The templated heap implementation is a little different from the STL\n// priority_queue and the *_heap operations in STL. This heap supports\n// indexing of values in the heap via an associated key.\n//\n// Each value is internally associated with a key which is returned to the\n// calling functions on heap insert. This key can be used to later update\n// the specific value in the heap.\n//\n// T: the element type of the hash. It can be POD, Data or a pointer to Data.\n// Compare: comparison functor for determining min-heapness.\ntemplate <class T, class Compare>\nclass Heap {\n public:\n  using Value = T;\n\n  static constexpr int kNoKey = -1;\n\n  // Initializes with a specific comparator.\n  explicit Heap(Compare comp = Compare()) : comp_(comp), size_(0) {}\n\n  // Inserts a value into the heap.\n  int Insert(const Value &value) {\n    if (size_ < values_.size()) {\n      values_[size_] = value;\n      pos_[key_[size_]] = size_;\n    } else {\n      values_.push_back(value);\n      pos_.push_back(size_);\n      key_.push_back(size_);\n    }\n    ++size_;\n    return Insert(value, size_ - 1);\n  }\n\n  // Updates a value at position given by the key. The pos_ array is first\n  // indexed by the key. The position gives the position in the heap array.\n  // Once we have the position we can then use the standard heap operations\n  // to calculate the parent and child positions.\n  void Update(int key, const Value &value) {\n    const auto i = pos_[key];\n    const bool is_better = comp_(value, values_[Parent(i)]);\n    values_[i] = value;\n    if (is_better) {\n      Insert(value, i);\n    } else {\n      Heapify(i);\n    }\n  }\n\n  // Returns the least value.\n  Value Pop() {\n    Value top = values_.front();\n    Swap(0, size_-1);\n    size_--;\n    Heapify(0);\n    return top;\n  }\n\n  // Returns the least value w.r.t.  the comparison function from the\n  // heap.\n  const Value &Top() const { return values_.front(); }\n\n  // Returns the element for the given key.\n  const Value &Get(int key) const { return values_[pos_[key]]; }\n\n  // Checks if the heap is empty.\n  bool Empty() const { return size_ == 0; }\n\n  void Clear() { size_ = 0; }\n\n  int Size() const { return size_; }\n\n  void Reserve(int size) {\n    values_.reserve(size);\n    pos_.reserve(size);\n    key_.reserve(size);\n  }\n\n  const Compare &GetCompare() const { return comp_; }\n\n private:\n  // The following private routines are used in a supportive role\n  // for managing the heap and keeping the heap properties.\n\n  // Computes left child of parent.\n  static int Left(int i) {\n    return 2 * (i + 1) - 1;  // 0 -> 1, 1 -> 3\n  }\n\n  // Computes right child of parent.\n  static int Right(int i) {\n    return 2 * (i + 1);  // 0 -> 2, 1 -> 4\n  }\n\n  // Given a child computes parent.\n  static int Parent(int i) {\n    return (i - 1) / 2;  // 0 -> 0, 1 -> 0, 2 -> 0,  3 -> 1,  4 -> 1, ...\n  }\n\n  // Swaps a child and parent. Use to move element up/down tree. Note the use of\n  // a little trick here. When we swap we need to swap:\n  //\n  // - the value\n  // - the associated keys\n  // - the position of the value in the heap\n  void Swap(int j, int k) {\n    const auto tkey = key_[j];\n    pos_[key_[j] = key_[k]] = j;\n    pos_[key_[k] = tkey] = k;\n    using std::swap;\n    swap(values_[j], values_[k]);\n  }\n\n  // Heapifies the subtree rooted at index i.\n  void Heapify(int i) {\n    const auto l = Left(i);\n    const auto r = Right(i);\n    auto largest = (l < size_ && comp_(values_[l], values_[i])) ? l : i;\n    if (r < size_ && comp_(values_[r], values_[largest])) largest = r;\n    if (largest != i) {\n      Swap(i, largest);\n      Heapify(largest);\n    }\n  }\n\n  // Inserts (updates) element at subtree rooted at index i.\n  int Insert(const Value &value, int i) {\n    int p;\n    while (i > 0 && !comp_(values_[p = Parent(i)], value)) {\n      Swap(i, p);\n      i = p;\n    }\n    return key_[i];\n  }\n\n private:\n  const Compare comp_;\n\n  std::vector<int> pos_;\n  std::vector<int> key_;\n  std::vector<Value> values_;\n  int size_;\n};\n\ntemplate <class T, class Compare>\nconstexpr int Heap<T, Compare>::kNoKey;\n\n}  // namespace fst\n\n#endif  // FST_HEAP_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/icu.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// This library implements an unrestricted Thompson/Pike UTF-8 parser and\n// serializer. UTF-8 is a restricted subset of this byte stream encoding. For\n// a description of the encoding details, see:\n//\n//     http://en.wikipedia.org/wiki/UTF-8\n\n#ifndef FST_ICU_H_\n#define FST_ICU_H_\n\n#include <sstream>\n#include <vector>\n\n#include <fst/log.h>\n\nnamespace fst {\n\n// This function writes UTF-8 strings into a vector of Labels, truncating if\n// necessary. It is possible to use this sensibly with as little as 16 bits of\n// Label precision (i.e., when all characters are within the Basic Multilingual\n// Plane). With 21 bits, one can label all UTF-8 labelpoints, including those\n// from the various Astral Planes. Naturally, it is safe to use this with larger\n// Labels (e.g., 64 bits).\ntemplate <class Label>\nbool UTF8StringToLabels(const string &str, std::vector<Label> *labels) {\n  for (auto it = str.begin(); it != str.end();) {\n    int c = *it & 0xff;\n    ++it;\n    if ((c & 0x80) == 0) {\n      labels->emplace_back(c);\n    } else {\n      if ((c & 0xc0) == 0x80) {\n        LOG(ERROR) << \"UTF8StringToLabels: Continuation byte as lead byte\";\n        return false;\n      }\n      int count =\n          (c >= 0xc0) + (c >= 0xe0) + (c >= 0xf0) + (c >= 0xf8) + (c >= 0xfc);\n      int32_t label = c & ((1 << (6 - count)) - 1);\n      while (count != 0) {\n        if (it == str.end()) {\n          LOG(ERROR) << \"UTF8StringToLabels: Truncated UTF-8 byte sequence\";\n          return false;\n        }\n        char cb = *it;\n        ++it;\n        if ((cb & 0xc0) != 0x80) {\n          LOG(ERROR) << \"UTF8StringToLabels: Missing/invalid continuation byte\";\n          return false;\n        }\n        label = (label << 6) | (cb & 0x3f);\n        --count;\n      }\n      if (label < 0) {\n        // Should be unreachable.\n        LOG(ERROR) << \"UTF8StringToLabels: Invalid character found: \" << c;\n        return false;\n      }\n      labels->push_back(label);\n    }\n  }\n  return true;\n}\n\ntemplate <class Label>\nbool LabelsToByteString(const std::vector<Label> &labels, string *str) {\n  std::ostringstream ostrm;\n  for (const char label : labels) {\n    if (label != 0) ostrm << label;\n  }\n  *str = ostrm.str();\n  return !!ostrm;\n}\n\ntemplate <class Label>\nbool LabelsToUTF8String(const std::vector<Label> &labels, string *str) {\n  std::ostringstream ostrm;\n  for (const int32_t label : labels) {\n    if (label < 0) {\n      LOG(ERROR) << \"LabelsToUTF8String: Invalid character found: \" << label;\n      return false;\n    } else if (label == 0) {\n      continue;\n    } else if (label < 0x80) {\n      ostrm << static_cast<char>(label);\n    } else if (label < 0x800) {\n      ostrm << static_cast<char>((label >> 6) | 0xc0);\n      ostrm << static_cast<char>((label & 0x3f) | 0x80);\n    } else if (label < 0x10000) {\n      ostrm << static_cast<char>((label >> 12) | 0xe0);\n      ostrm << static_cast<char>(((label >> 6) & 0x3f) | 0x80);\n      ostrm << static_cast<char>((label & 0x3f) | 0x80);\n    } else if (label < 0x200000) {\n      ostrm << static_cast<char>((label >> 18) | 0xf0);\n      ostrm << static_cast<char>(((label >> 12) & 0x3f) | 0x80);\n      ostrm << static_cast<char>(((label >> 6) & 0x3f) | 0x80);\n      ostrm << static_cast<char>((label & 0x3f) | 0x80);\n    } else if (label < 0x4000000) {\n      ostrm << static_cast<char>((label >> 24) | 0xf8);\n      ostrm << static_cast<char>(((label >> 18) & 0x3f) | 0x80);\n      ostrm << static_cast<char>(((label >> 12) & 0x3f) | 0x80);\n      ostrm << static_cast<char>(((label >> 6) & 0x3f) | 0x80);\n      ostrm << static_cast<char>((label & 0x3f) | 0x80);\n    } else {\n      ostrm << static_cast<char>((label >> 30) | 0xfc);\n      ostrm << static_cast<char>(((label >> 24) & 0x3f) | 0x80);\n      ostrm << static_cast<char>(((label >> 18) & 0x3f) | 0x80);\n      ostrm << static_cast<char>(((label >> 12) & 0x3f) | 0x80);\n      ostrm << static_cast<char>(((label >> 6) & 0x3f) | 0x80);\n      ostrm << static_cast<char>((label & 0x3f) | 0x80);\n    }\n  }\n  *str = ostrm.str();\n  return !!ostrm;\n}\n\n}  // namespace fst\n\n#endif  // FST_ICU_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/intersect.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Class to compute the intersection of two FSAs.\n\n#ifndef FST_INTERSECT_H_\n#define FST_INTERSECT_H_\n\n#include <algorithm>\n#include <vector>\n\n#include <fst/log.h>\n\n#include <fst/cache.h>\n#include <fst/compose.h>\n\n\nnamespace fst {\n\nusing IntersectOptions = ComposeOptions;\n\ntemplate <class Arc, class M = Matcher<Fst<Arc>>,\n          class Filter = SequenceComposeFilter<M>,\n          class StateTable =\n              GenericComposeStateTable<Arc, typename Filter::FilterState>>\nstruct IntersectFstOptions\n    : public ComposeFstOptions<Arc, M, Filter, StateTable> {\n  IntersectFstOptions() {}\n\n  explicit IntersectFstOptions(const CacheOptions &opts, M *matcher1 = nullptr,\n                               M *matcher2 = nullptr, Filter *filter = nullptr,\n                               StateTable *state_table = nullptr)\n      : ComposeFstOptions<Arc, M, Filter, StateTable>(opts, matcher1, matcher2,\n                                                      filter, state_table) {}\n};\n\n// Computes the intersection (Hadamard product) of two FSAs. This version is a\n// delayed FST. Only strings that are in both automata are retained in the\n// result.\n//\n// The two arguments must be acceptors. One of the arguments must be\n// label-sorted.\n//\n// Complexity: same as ComposeFst.\n//\n// Caveats: same as ComposeFst.\ntemplate <class A>\nclass IntersectFst : public ComposeFst<A> {\n public:\n  using Arc = A;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using ComposeFst<A>::CreateBase;\n  using ComposeFst<A>::CreateBase1;\n  using ComposeFst<A>::Properties;\n\n  IntersectFst(const Fst<Arc> &fst1, const Fst<Arc> &fst2,\n               const CacheOptions &opts = CacheOptions())\n      : ComposeFst<Arc>(CreateBase(fst1, fst2, opts)) {\n    const bool acceptors =\n        fst1.Properties(kAcceptor, true) && fst2.Properties(kAcceptor, true);\n    if (!acceptors) {\n      FSTERROR() << \"IntersectFst: Input FSTs are not acceptors\";\n      GetMutableImpl()->SetProperties(kError);\n    }\n  }\n\n  template <class M, class Filter, class StateTable>\n  IntersectFst(const Fst<Arc> &fst1, const Fst<Arc> &fst2,\n               const IntersectFstOptions<Arc, M, Filter, StateTable> &opts)\n      : ComposeFst<Arc>(CreateBase1(fst1, fst2, opts)) {\n    const bool acceptors =\n        fst1.Properties(kAcceptor, true) && fst2.Properties(kAcceptor, true);\n    if (!acceptors) {\n      FSTERROR() << \"IntersectFst: input FSTs are not acceptors\";\n      GetMutableImpl()->SetProperties(kError);\n    }\n  }\n\n  // See Fst<>::Copy() for doc.\n  IntersectFst(const IntersectFst<Arc> &fst, bool safe = false)\n      : ComposeFst<Arc>(fst, safe) {}\n\n  // Get a copy of this IntersectFst. See Fst<>::Copy() for further doc.\n  IntersectFst<Arc> *Copy(bool safe = false) const override {\n    return new IntersectFst<Arc>(*this, safe);\n  }\n\n private:\n  using ImplToFst<internal::ComposeFstImplBase<A>>::GetImpl;\n  using ImplToFst<internal::ComposeFstImplBase<A>>::GetMutableImpl;\n};\n\n// Specialization for IntersectFst.\ntemplate <class Arc>\nclass StateIterator<IntersectFst<Arc>> : public StateIterator<ComposeFst<Arc>> {\n public:\n  explicit StateIterator(const IntersectFst<Arc> &fst)\n      : StateIterator<ComposeFst<Arc>>(fst) {}\n};\n\n// Specialization for IntersectFst.\ntemplate <class Arc>\nclass ArcIterator<IntersectFst<Arc>> : public ArcIterator<ComposeFst<Arc>> {\n public:\n  using StateId = typename Arc::StateId;\n\n  ArcIterator(const IntersectFst<Arc> &fst, StateId s)\n      : ArcIterator<ComposeFst<Arc>>(fst, s) {}\n};\n\n// Useful alias when using StdArc.\nusing StdIntersectFst = IntersectFst<StdArc>;\n\n// Computes the intersection (Hadamard product) of two FSAs. This version\n// writes the intersection to an output MurableFst. Only strings that are in\n// both automata are retained in the result.\n//\n// The two arguments must be acceptors. One of the arguments must be\n// label-sorted.\n//\n// Complexity: same as Compose.\n//\n// Caveats: same as Compose.\ntemplate <class Arc>\nvoid Intersect(const Fst<Arc> &ifst1, const Fst<Arc> &ifst2,\n               MutableFst<Arc> *ofst,\n               const IntersectOptions &opts = IntersectOptions()) {\n  using M = Matcher<Fst<Arc>>;\n  if (opts.filter_type == AUTO_FILTER) {\n    CacheOptions nopts;\n    nopts.gc_limit = 0;  // Cache only the last state for fastest copy.\n    *ofst = IntersectFst<Arc>(ifst1, ifst2, nopts);\n  } else if (opts.filter_type == SEQUENCE_FILTER) {\n    IntersectFstOptions<Arc> iopts;\n    iopts.gc_limit = 0;  // Cache only the last state for fastest copy.\n    *ofst = IntersectFst<Arc>(ifst1, ifst2, iopts);\n  } else if (opts.filter_type == ALT_SEQUENCE_FILTER) {\n    IntersectFstOptions<Arc, M, AltSequenceComposeFilter<M>> iopts;\n    iopts.gc_limit = 0;  // Cache only the last state for fastest copy.\n    *ofst = IntersectFst<Arc>(ifst1, ifst2, iopts);\n  } else if (opts.filter_type == MATCH_FILTER) {\n    IntersectFstOptions<Arc, M, MatchComposeFilter<M>> iopts;\n    iopts.gc_limit = 0;  // Cache only the last state for fastest copy.\n    *ofst = IntersectFst<Arc>(ifst1, ifst2, iopts);\n  }\n  if (opts.connect) Connect(ofst);\n}\n\n}  // namespace fst\n\n#endif  // FST_INTERSECT_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/interval-set.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Class to represent and operate on sets of intervals.\n\n#ifndef FST_INTERVAL_SET_H_\n#define FST_INTERVAL_SET_H_\n\n#include <algorithm>\n#include <iostream>\n#include <vector>\n\n\n#include <fst/util.h>\n\n\nnamespace fst {\n\n// Half-open integral interval [a, b) of signed integers of type T.\ntemplate <class T>\nstruct IntInterval {\n  T begin;\n  T end;\n\n  IntInterval() : begin(-1), end(-1) {}\n\n  IntInterval(T begin, T end) : begin(begin), end(end) {}\n\n  bool operator<(const IntInterval<T> &i) const {\n    return begin < i.begin || (begin == i.begin && end > i.end);\n  }\n\n  bool operator==(const IntInterval<T> &i) const {\n    return begin == i.begin && end == i.end;\n  }\n\n  bool operator!=(const IntInterval<T> &i) const {\n    return begin != i.begin || end != i.end;\n  }\n\n  std::istream &Read(std::istream &strm) {\n    T n;\n    ReadType(strm, &n);\n    begin = n;\n    ReadType(strm, &n);\n    end = n;\n    return strm;\n  }\n\n  std::ostream &Write(std::ostream &strm) const {\n    T n = begin;\n    WriteType(strm, n);\n    n = end;\n    WriteType(strm, n);\n    return strm;\n  }\n};\n\n// Stores IntIntervals<T> in a vector. In addition, keeps the count of points in\n// all intervals.\ntemplate <class T>\nclass VectorIntervalStore {\n public:\n  using Interval = IntInterval<T>;\n  using Iterator = typename std::vector<Interval>::const_iterator;\n\n  VectorIntervalStore() : count_(-1) {}\n\n  std::vector<Interval> *MutableIntervals() { return &intervals_; }\n\n  const Interval *Intervals() const { return intervals_.data(); }\n\n  T Size() const { return intervals_.size(); }\n\n  T Count() const { return count_; }\n\n  void SetCount(T count) { count_ = count; }\n\n  void Clear() {\n    intervals_.clear();\n    count_ = 0;\n  }\n\n  Iterator begin() const { return intervals_.begin(); }\n\n  Iterator end() const { return intervals_.end(); }\n\n  std::istream &Read(std::istream &strm) {\n    ReadType(strm, &intervals_);\n    return ReadType(strm, &count_);\n  }\n\n  std::ostream &Write(std::ostream &strm) const {\n    WriteType(strm, intervals_);\n    return WriteType(strm, count_);\n  }\n\n private:\n  std::vector<Interval> intervals_;\n  T count_;\n};\n\n// Stores and operates on a set of half-open integral intervals [a, b)\n// of signed integers of type T.\ntemplate <class T, class Store = VectorIntervalStore<T>>\nclass IntervalSet {\n public:\n  using Interval = IntInterval<T>;\n\n  template <class... A>\n  explicit IntervalSet(A... args) : intervals_(args...) {}\n\n  // Returns the interval set as a vector.\n  std::vector<Interval> *MutableIntervals() {\n    return intervals_.MutableIntervals();\n  }\n\n  // Returns a pointer to an array of Size() elements.\n  const Interval *Intervals() const { return intervals_.Intervals(); }\n\n  bool Empty() const { return Size() == 0; }\n\n  T Size() const { return intervals_.Size(); }\n\n  // Number of points in the intervals (undefined if not normalized).\n  T Count() const { return intervals_.Count(); }\n\n  void Clear() { intervals_.Clear(); }\n\n  // Adds an interval set to the set. The result may not be normalized.\n  void Union(const IntervalSet<T, Store> &iset) {\n    intervals_.MutableIntervals()->insert(intervals_.MutableIntervals()->end(),\n                                          iset.intervals_.begin(),\n                                          iset.intervals_.end());\n  }\n\n  // Requires intervals be normalized.\n  bool Member(T value) const {\n    const Interval interval(value, value);\n    auto lb = std::lower_bound(intervals_.begin(), intervals_.end(), interval);\n    if (lb == intervals_.begin()) return false;\n    return (--lb)->end > value;\n  }\n\n  // Requires intervals be normalized.\n  bool operator==(const IntervalSet<T, Store> &iset) const {\n    return Size() == iset.Size() &&\n           std::equal(intervals_.begin(), intervals_.end(),\n                      iset.intervals_.begin());\n  }\n\n  // Requires intervals be normalized.\n  bool operator!=(const IntervalSet<T, Store> &iset) const {\n    return Size() != iset.Size() ||\n           !std::equal(intervals_.begin(), intervals_.end(),\n                       iset.intervals_.begin());\n  }\n\n  bool Singleton() const {\n    return Size() == 1 &&\n           intervals_.begin()->begin + 1 == intervals_.begin()->end;\n  }\n\n  // Sorts, collapses overlapping and adjacent interals, and sets count.\n  void Normalize();\n\n  // Intersects an interval set with the set. Requires intervals be normalized.\n  // The result is normalized.\n  void Intersect(const IntervalSet<T, Store> &iset,\n                 IntervalSet<T, Store> *oset) const;\n\n  // Complements the set w.r.t [0, maxval). Requires intervals be normalized.\n  // The result is normalized.\n  void Complement(T maxval, IntervalSet<T, Store> *oset) const;\n\n  // Subtract an interval set from the set. Requires intervals be normalized.\n  // The result is normalized.\n  void Difference(const IntervalSet<T, Store> &iset,\n                  IntervalSet<T, Store> *oset) const;\n\n  // Determines if an interval set overlaps with the set. Requires intervals be\n  // normalized.\n  bool Overlaps(const IntervalSet<T, Store> &iset) const;\n\n  // Determines if an interval set overlaps with the set but neither is\n  // contained in the other. Requires intervals be normalized.\n  bool StrictlyOverlaps(const IntervalSet<T, Store> &iset) const;\n\n  // Determines if an interval set is contained within the set. Requires\n  // intervals be normalized.\n  bool Contains(const IntervalSet<T, Store> &iset) const;\n\n  std::istream &Read(std::istream &strm) { return intervals_.Read(strm); }\n\n  std::ostream &Write(std::ostream &strm) const {\n    return intervals_.Write(strm);\n  }\n\n  typename Store::Iterator begin() const { return intervals_.begin(); }\n\n  typename Store::Iterator end() const { return intervals_.end(); }\n\n private:\n  Store intervals_;\n};\n\n// Sorts, collapses overlapping and adjacent intervals, and sets count.\ntemplate <typename T, class Store>\nvoid IntervalSet<T, Store>::Normalize() {\n  auto &intervals = *intervals_.MutableIntervals();\n  std::sort(intervals.begin(), intervals.end());\n  T count = 0;\n  T size = 0;\n  for (T i = 0; i < intervals.size(); ++i) {\n    auto &inti = intervals[i];\n    if (inti.begin == inti.end) continue;\n    for (T j = i + 1; j < intervals.size(); ++j) {\n      auto &intj = intervals[j];\n      if (intj.begin > inti.end) break;\n      if (intj.end > inti.end) inti.end = intj.end;\n      ++i;\n    }\n    count += inti.end - inti.begin;\n    intervals[size++] = inti;\n  }\n  intervals.resize(size);\n  intervals_.SetCount(count);\n}\n\n// Intersects an interval set with the set. Requires intervals be normalized.\n// The result is normalized.\ntemplate <typename T, class Store>\nvoid IntervalSet<T, Store>::Intersect(const IntervalSet<T, Store> &iset,\n                                      IntervalSet<T, Store> *oset) const {\n  auto *ointervals = oset->MutableIntervals();\n  auto it1 = intervals_.begin();\n  auto it2 = iset.intervals_.begin();\n  ointervals->clear();\n  T count = 0;\n  while (it1 != intervals_.end() && it2 != iset.intervals_.end()) {\n    if (it1->end <= it2->begin) {\n      ++it1;\n    } else if (it2->end <= it1->begin) {\n      ++it2;\n    } else {\n      ointervals->emplace_back(std::max(it1->begin, it2->begin),\n                               std::min(it1->end, it2->end));\n      count += ointervals->back().end - ointervals->back().begin;\n      if (it1->end < it2->end) {\n        ++it1;\n      } else {\n        ++it2;\n      }\n    }\n  }\n  oset->intervals_.SetCount(count);\n}\n\n// Complements the set w.r.t [0, maxval). Requires intervals be normalized.\n// The result is normalized.\ntemplate <typename T, class Store>\nvoid IntervalSet<T, Store>::Complement(T maxval,\n                                       IntervalSet<T, Store> *oset) const {\n  auto *ointervals = oset->MutableIntervals();\n  ointervals->clear();\n  T count = 0;\n  Interval interval;\n  interval.begin = 0;\n  for (auto it = intervals_.begin(); it != intervals_.end(); ++it) {\n    interval.end = std::min(it->begin, maxval);\n    if ((interval.begin) < (interval.end)) {\n      ointervals->push_back(interval);\n      count += interval.end - interval.begin;\n    }\n    interval.begin = it->end;\n  }\n  interval.end = maxval;\n  if ((interval.begin) < (interval.end)) {\n    ointervals->push_back(interval);\n    count += interval.end - interval.begin;\n  }\n  oset->intervals_.SetCount(count);\n}\n\n// Subtract an interval set from the set. Requires intervals be normalized.\n// The result is normalized.\ntemplate <typename T, class Store>\nvoid IntervalSet<T, Store>::Difference(const IntervalSet<T, Store> &iset,\n                                       IntervalSet<T, Store> *oset) const {\n  if (Empty()) {\n    oset->MutableIntervals()->clear();\n    oset->intervals_.SetCount(0);\n  } else {\n    IntervalSet<T, Store> cset;\n    iset.Complement(intervals_.Intervals()[intervals_.Size() - 1].end, &cset);\n    Intersect(cset, oset);\n  }\n}\n\n// Determines if an interval set overlaps with the set. Requires intervals be\n// normalized.\ntemplate <typename T, class Store>\nbool IntervalSet<T, Store>::Overlaps(const IntervalSet<T, Store> &iset) const {\n  auto it1 = intervals_.begin();\n  auto it2 = iset.intervals_.begin();\n  while (it1 != intervals_.end() && it2 != iset.intervals_.end()) {\n    if (it1->end <= it2->begin) {\n      ++it1;\n    } else if (it2->end <= it1->begin) {\n      ++it2;\n    } else {\n      return true;\n    }\n  }\n  return false;\n}\n\n// Determines if an interval set overlaps with the set but neither is contained\n// in the other. Requires intervals be normalized.\ntemplate <typename T, class Store>\nbool IntervalSet<T, Store>::StrictlyOverlaps(\n    const IntervalSet<T, Store> &iset) const {\n  auto it1 = intervals_.begin();\n  auto it2 = iset.intervals_.begin();\n  bool only1 = false;    // Point in intervals_ but not intervals.\n  bool only2 = false;    // Point in intervals but not intervals_.\n  bool overlap = false;  // Point in both intervals_ and intervals.\n  while (it1 != intervals_.end() && it2 != iset.intervals_.end()) {\n    if (it1->end <= it2->begin) {  // no overlap - it1 first\n      only1 = true;\n      ++it1;\n    } else if (it2->end <= it1->begin) {  // no overlap - it2 first\n      only2 = true;\n      ++it2;\n    } else if (it2->begin == it1->begin && it2->end == it1->end) {  // equals\n      overlap = true;\n      ++it1;\n      ++it2;\n    } else if (it2->begin <= it1->begin && it2->end >= it1->end) {  // 1 c 2\n      only2 = true;\n      overlap = true;\n      ++it1;\n    } else if (it1->begin <= it2->begin && it1->end >= it2->end) {  // 2 c 1\n      only1 = true;\n      overlap = true;\n      ++it2;\n    } else {  // Strict overlap.\n      only1 = true;\n      only2 = true;\n      overlap = true;\n    }\n    if (only1 == true && only2 == true && overlap == true) return true;\n  }\n  if (it1 != intervals_.end()) only1 = true;\n  if (it2 != iset.intervals_.end()) only2 = true;\n  return only1 == true && only2 == true && overlap == true;\n}\n\n// Determines if an interval set is contained within the set. Requires intervals\n// be normalized.\ntemplate <typename T, class Store>\nbool IntervalSet<T, Store>::Contains(const IntervalSet<T, Store> &iset) const {\n  if (iset.Count() > Count()) return false;\n  auto it1 = intervals_.begin();\n  auto it2 = iset.intervals_.begin();\n  while (it1 != intervals_.end() && it2 != iset.intervals_.end()) {\n    if ((it1->end) <= (it2->begin)) {  // No overlap; it1 first.\n      ++it1;\n    } else if ((it2->begin) < (it1->begin) ||\n               (it2->end) > (it1->end)) {  // No C.\n      return false;\n    } else if (it2->end == it1->end) {\n      ++it1;\n      ++it2;\n    } else {\n      ++it2;\n    }\n  }\n  return it2 == iset.intervals_.end();\n}\n\ntemplate <typename T, class Store>\nstd::ostream &operator<<(std::ostream &strm, const IntervalSet<T, Store> &s) {\n  strm << \"{\";\n  for (T i = 0; i < s.Size(); ++i) {\n    if (i > 0) {\n      strm << \",\";\n    }\n    const auto &interval = s.Intervals()[i];\n    strm << \"[\" << interval.begin << \",\" << interval.end << \")\";\n  }\n  strm << \"}\";\n  return strm;\n}\n\n}  // namespace fst\n\n#endif  // FST_INTERVAL_SET_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/invert.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Functions and classes to invert an FST.\n\n#ifndef FST_INVERT_H_\n#define FST_INVERT_H_\n\n#include <fst/arc-map.h>\n#include <fst/mutable-fst.h>\n\n\nnamespace fst {\n\n// Mapper to implement inversion of an arc.\ntemplate <class A>\nstruct InvertMapper {\n  using FromArc = A;\n  using ToArc = A;\n\n  InvertMapper() {}\n\n  ToArc operator()(const FromArc &arc) const {\n    return ToArc(arc.olabel, arc.ilabel, arc.weight, arc.nextstate);\n  }\n\n  constexpr MapFinalAction FinalAction() const {\n     return MAP_NO_SUPERFINAL;\n  }\n\n  constexpr MapSymbolsAction InputSymbolsAction() const {\n    return MAP_CLEAR_SYMBOLS;\n  }\n\n  constexpr MapSymbolsAction OutputSymbolsAction() const {\n    return MAP_CLEAR_SYMBOLS;\n  }\n\n  uint64_t Properties(uint64_t props) const {\n    return InvertProperties(props);\n  }\n};\n\n// Inverts the transduction corresponding to an FST by exchanging the\n// FST's input and output labels.\n//\n// Complexity:\n//\n//   Time: O(V + E)\n//   Space: O(1)\n//\n// where V is the number of states and E is the number of arcs.\ntemplate <class Arc>\ninline void Invert(const Fst<Arc> &ifst, MutableFst<Arc> *ofst) {\n  std::unique_ptr<SymbolTable> input(\n      ifst.InputSymbols() ? ifst.InputSymbols()->Copy() : nullptr);\n  std::unique_ptr<SymbolTable> output(\n      ifst.OutputSymbols() ? ifst.OutputSymbols()->Copy() : nullptr);\n  ArcMap(ifst, ofst, InvertMapper<Arc>());\n  ofst->SetInputSymbols(output.get());\n  ofst->SetOutputSymbols(input.get());\n}\n\n// Destructive variant of the above.\ntemplate <class Arc>\ninline void Invert(MutableFst<Arc> *fst) {\n  std::unique_ptr<SymbolTable> input(\n      fst->InputSymbols() ? fst->InputSymbols()->Copy() : nullptr);\n  std::unique_ptr<SymbolTable> output(\n      fst->OutputSymbols() ? fst->OutputSymbols()->Copy() : nullptr);\n  ArcMap(fst, InvertMapper<Arc>());\n  fst->SetInputSymbols(output.get());\n  fst->SetOutputSymbols(input.get());\n}\n\n// Inverts the transduction corresponding to an FST by exchanging the\n// FST's input and output labels. This version is a delayed FST.\n//\n// Complexity:\n//\n//   Time: O(v + e)\n//   Space: O(1)\n//\n// where v is the number of states visited and e is the number of arcs visited.\n// Constant time and to visit an input state or arc is assumed and exclusive of\n// caching.\ntemplate <class A>\nclass InvertFst : public ArcMapFst<A, A, InvertMapper<A>> {\n public:\n  using Arc = A;\n\n  using Mapper = InvertMapper<Arc>;\n  using Impl = internal::ArcMapFstImpl<A, A, InvertMapper<A>>;\n\n  explicit InvertFst(const Fst<Arc> &fst)\n      : ArcMapFst<Arc, Arc, Mapper>(fst, Mapper()) {\n    GetMutableImpl()->SetOutputSymbols(fst.InputSymbols());\n    GetMutableImpl()->SetInputSymbols(fst.OutputSymbols());\n  }\n\n  // See Fst<>::Copy() for doc.\n  InvertFst(const InvertFst<Arc> &fst, bool safe = false)\n      : ArcMapFst<Arc, Arc, Mapper>(fst, safe) {}\n\n  // Get a copy of this InvertFst. See Fst<>::Copy() for further doc.\n  InvertFst<Arc> *Copy(bool safe = false) const override {\n    return new InvertFst(*this, safe);\n  }\n\n private:\n  using ImplToFst<Impl>::GetMutableImpl;\n};\n\n// Specialization for InvertFst.\ntemplate <class Arc>\nclass StateIterator<InvertFst<Arc>>\n    : public StateIterator<ArcMapFst<Arc, Arc, InvertMapper<Arc>>> {\n public:\n  explicit StateIterator(const InvertFst<Arc> &fst)\n      : StateIterator<ArcMapFst<Arc, Arc, InvertMapper<Arc>>>(fst) {}\n};\n\n// Specialization for InvertFst.\ntemplate <class Arc>\nclass ArcIterator<InvertFst<Arc>>\n    : public ArcIterator<ArcMapFst<Arc, Arc, InvertMapper<Arc>>> {\n public:\n  using StateId = typename Arc::StateId;\n\n  ArcIterator(const InvertFst<Arc> &fst, StateId s)\n      : ArcIterator<ArcMapFst<Arc, Arc, InvertMapper<Arc>>>(fst, s) {}\n};\n\n// Useful alias when using StdArc.\nusing StdInvertFst = InvertFst<StdArc>;\n\n}  // namespace fst\n\n#endif  // FST_INVERT_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/isomorphic.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Function to test two FSTs are isomorphic, i.e., they are equal up to a state\n// and arc re-ordering. FSTs should be deterministic when viewed as\n// unweighted automata.\n\n#ifndef FST_ISOMORPHIC_H_\n#define FST_ISOMORPHIC_H_\n\n#include <algorithm>\n#include <list>\n#include <type_traits>\n#include <vector>\n\n#include <fst/log.h>\n\n#include <fst/fst.h>\n\n\nnamespace fst {\nnamespace internal {\n\n// Orders weights for equality checking.\ntemplate <class Weight, typename std::enable_if<\n                            IsIdempotent<Weight>::value>::type * = nullptr>\nbool WeightCompare(const Weight &w1, const Weight &w2, float delta,\n                   bool *error) {\n  return NaturalLess<Weight>()(w1, w2);\n}\n\ntemplate <class Weight, typename std::enable_if<\n                            !IsIdempotent<Weight>::value>::type * = nullptr>\nbool WeightCompare(const Weight &w1, const Weight &w2, float delta,\n                   bool *error) {\n  // No natural order; use hash.\n  const auto q1 = w1.Quantize(delta);\n  const auto q2 = w2.Quantize(delta);\n  auto n1 = q1.Hash();\n  auto n2 = q2.Hash();\n  // Hash not unique; very unlikely to happen.\n  if (n1 == n2 && q1 != q2) {\n    VLOG(1) << \"Isomorphic: Weight hash collision\";\n    *error = true;\n  }\n  return n1 < n2;\n}\n\ntemplate <class Arc>\nclass Isomorphism {\n  using StateId = typename Arc::StateId;\n\n public:\n  Isomorphism(const Fst<Arc> &fst1, const Fst<Arc> &fst2, float delta)\n      : fst1_(fst1.Copy()),\n        fst2_(fst2.Copy()),\n        delta_(delta),\n        error_(false),\n        comp_(delta, &error_) {}\n\n  // Checks if input FSTs are isomorphic.\n  bool IsIsomorphic() {\n    if (fst1_->Start() == kNoStateId && fst2_->Start() == kNoStateId) {\n      return true;\n    }\n    if (fst1_->Start() == kNoStateId || fst2_->Start() == kNoStateId) {\n      return false;\n    }\n    PairState(fst1_->Start(), fst2_->Start());\n    while (!queue_.empty()) {\n      const auto &pr = queue_.front();\n      if (!IsIsomorphicState(pr.first, pr.second)) return false;\n      queue_.pop_front();\n    }\n    return true;\n  }\n\n  bool Error() const { return error_; }\n\n private:\n  // Orders arcs for equality checking.\n  class ArcCompare {\n   public:\n    ArcCompare(float delta, bool *error) : delta_(delta), error_(error) {}\n\n    bool operator()(const Arc &arc1, const Arc &arc2) const {\n      if (arc1.ilabel < arc2.ilabel) return true;\n      if (arc1.ilabel > arc2.ilabel) return false;\n      if (arc1.olabel < arc2.olabel) return true;\n      if (arc1.olabel > arc2.olabel) return false;\n      return WeightCompare(arc1.weight, arc2.weight, delta_, error_);\n    }\n\n   private:\n    float delta_;\n    bool *error_;\n  };\n\n  // Maintains state correspondences and queue.\n  bool PairState(StateId s1, StateId s2) {\n    if (state_pairs_.size() <= s1) state_pairs_.resize(s1 + 1, kNoStateId);\n    if (state_pairs_[s1] == s2) {\n      return true;  // already seen this pair\n    } else if (state_pairs_[s1] != kNoStateId) {\n      return false;  // s1 already paired with another s2\n    }\n    state_pairs_[s1] = s2;\n    queue_.push_back(std::make_pair(s1, s2));\n    return true;\n  }\n\n  // Checks if state pair is isomorphic\n  bool IsIsomorphicState(StateId s1, StateId s2);\n\n  std::unique_ptr<Fst<Arc>> fst1_;\n  std::unique_ptr<Fst<Arc>> fst2_;\n  float delta_;                          // Weight equality delta.\n  std::vector<Arc> arcs1_;               // For sorting arcs on FST1.\n  std::vector<Arc> arcs2_;               // For sorting arcs on FST2.\n  std::vector<StateId> state_pairs_;     // Maintains state correspondences.\n  std::list<std::pair<StateId, StateId>> queue_;  // Queue of state pairs.\n  bool error_;                           // Error flag.\n  ArcCompare comp_;\n};\n\ntemplate <class Arc>\nbool Isomorphism<Arc>::IsIsomorphicState(StateId s1, StateId s2) {\n  if (!ApproxEqual(fst1_->Final(s1), fst2_->Final(s2), delta_)) return false;\n  auto narcs1 = fst1_->NumArcs(s1);\n  auto narcs2 = fst2_->NumArcs(s2);\n  if (narcs1 != narcs2) return false;\n  ArcIterator<Fst<Arc>> aiter1(*fst1_, s1);\n  ArcIterator<Fst<Arc>> aiter2(*fst2_, s2);\n  arcs1_.clear();\n  arcs1_.reserve(narcs1);\n  arcs2_.clear();\n  arcs2_.reserve(narcs2);\n  for (; !aiter1.Done(); aiter1.Next(), aiter2.Next()) {\n    arcs1_.push_back(aiter1.Value());\n    arcs2_.push_back(aiter2.Value());\n  }\n  std::sort(arcs1_.begin(), arcs1_.end(), comp_);\n  std::sort(arcs2_.begin(), arcs2_.end(), comp_);\n  for (size_t i = 0; i < arcs1_.size(); ++i) {\n    const auto &arc1 = arcs1_[i];\n    const auto &arc2 = arcs2_[i];\n    if (arc1.ilabel != arc2.ilabel) return false;\n    if (arc1.olabel != arc2.olabel) return false;\n    if (!ApproxEqual(arc1.weight, arc2.weight, delta_)) return false;\n    if (!PairState(arc1.nextstate, arc2.nextstate)) return false;\n    if (i > 0) {  // Checks for non-determinism.\n      const auto &arc0 = arcs1_[i - 1];\n      if (arc1.ilabel == arc0.ilabel && arc1.olabel == arc0.olabel &&\n          ApproxEqual(arc1.weight, arc0.weight, delta_)) {\n        VLOG(1) << \"Isomorphic: Non-determinism as an unweighted automaton\";\n        error_ = true;\n        return false;\n      }\n    }\n  }\n  return true;\n}\n\n}  // namespace internal\n\n// Tests if two FSTs have the same states and arcs up to a reordering.\n// Inputs should be non-deterministic when viewed as unweighted automata.\ntemplate <class Arc>\nbool Isomorphic(const Fst<Arc> &fst1, const Fst<Arc> &fst2,\n                float delta = kDelta) {\n  internal::Isomorphism<Arc> iso(fst1, fst2, delta);\n  bool result = iso.IsIsomorphic();\n  if (iso.Error()) {\n    FSTERROR() << \"Isomorphic: Cannot determine if inputs are isomorphic\";\n    return false;\n  } else {\n    return result;\n  }\n}\n\n}  // namespace fst\n\n#endif  // FST_ISOMORPHIC_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/label-reachable.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Class to determine if a non-epsilon label can be read as the first\n// non-epsilon symbol along some path from a given state.\n\n#ifndef FST_LABEL_REACHABLE_H_\n#define FST_LABEL_REACHABLE_H_\n\n#include <unordered_map>\n#include <utility>\n#include <vector>\n\n#include <fst/log.h>\n\n#include <fst/accumulator.h>\n#include <fst/arcsort.h>\n#include <fst/interval-set.h>\n#include <fst/state-reachable.h>\n#include <fst/util.h>\n#include <fst/vector-fst.h>\n\n\nnamespace fst {\n\n// Stores shareable data for label reachable class copies.\ntemplate <typename Label>\nclass LabelReachableData {\n public:\n  using LabelIntervalSet = IntervalSet<Label>;\n  using Interval = typename LabelIntervalSet::Interval;\n\n  explicit LabelReachableData(bool reach_input, bool keep_relabel_data = true)\n      : reach_input_(reach_input),\n        keep_relabel_data_(keep_relabel_data),\n        have_relabel_data_(true),\n        final_label_(kNoLabel) {}\n\n  ~LabelReachableData() {}\n\n  bool ReachInput() const { return reach_input_; }\n\n  std::vector<LabelIntervalSet> *MutableIntervalSets() {\n    return &interval_sets_;\n  }\n\n  const LabelIntervalSet &GetIntervalSet(int s) const {\n    return interval_sets_[s];\n  }\n\n  int NumIntervalSets() const { return interval_sets_.size(); }\n\n  std::unordered_map<Label, Label> *Label2Index() {\n    if (!have_relabel_data_) {\n      FSTERROR() << \"LabelReachableData: No relabeling data\";\n    }\n    return &label2index_;\n  }\n\n  void SetFinalLabel(Label final_label) { final_label_ = final_label; }\n\n  Label FinalLabel() const { return final_label_; }\n\n  static LabelReachableData<Label> *Read(std::istream &istrm,\n                                         const FstReadOptions &opts) {\n    auto *data = new LabelReachableData<Label>();\n    ReadType(istrm, &data->reach_input_);\n    ReadType(istrm, &data->keep_relabel_data_);\n    data->have_relabel_data_ = data->keep_relabel_data_;\n    if (data->keep_relabel_data_) ReadType(istrm, &data->label2index_);\n    ReadType(istrm, &data->final_label_);\n    ReadType(istrm, &data->interval_sets_);\n    return data;\n  }\n\n  bool Write(std::ostream &ostrm, const FstWriteOptions &opts) const {\n    WriteType(ostrm, reach_input_);\n    WriteType(ostrm, keep_relabel_data_);\n    if (keep_relabel_data_) WriteType(ostrm, label2index_);\n    WriteType(ostrm, FinalLabel());\n    WriteType(ostrm, interval_sets_);\n    return true;\n  }\n\n private:\n  LabelReachableData() {}\n\n  bool reach_input_;                              // Input labels considered?\n  bool keep_relabel_data_;                        // Save label2index_ to file?\n  bool have_relabel_data_;                        // Using label2index_?\n  Label final_label_;                             // Final label.\n  std::unordered_map<Label, Label> label2index_;  // Finds index for a label.\n  std::vector<LabelIntervalSet> interval_sets_;   // Interval sets per state.\n};\n\n// Tests reachability of labels from a given state. If reach_input is true, then\n// input labels are considered, o.w. output labels are considered. To test for\n// reachability from a state s, first do SetState(s), then a label l can be\n// reached from state s of FST f iff Reach(r) is true where r = Relabel(l). The\n// relabeling is required to ensure a compact representation of the reachable\n// labels.\n\n// The whole FST can be relabeled instead with Relabel(&f, reach_input) so that\n// the test Reach(r) applies directly to the labels of the transformed FST f.\n// The relabeled FST will also be sorted appropriately for composition.\n//\n// Reachablity of a final state from state s (via an epsilon path) can be\n// tested with ReachFinal().\n//\n// Reachability can also be tested on the set of labels specified by an arc\n// iterator, useful for FST composition. In particular, Reach(aiter, ...) is\n// true if labels on the input (output) side of the transitions of the arc\n// iterator, when iter_input is true (false), can be reached from the state s.\n// The iterator labels must have already been relabeled.\n//\n// With the arc iterator test of reachability, the begin position, end position\n// and accumulated arc weight of the matches can be returned. The optional\n// template argument controls how reachable arc weights are accumulated. The\n// default uses semiring Plus(). Alternative ones can be used to distribute the\n// weights in composition in various ways.\ntemplate <class Arc, class Accumulator = DefaultAccumulator<Arc>,\n          class D = LabelReachableData<typename Arc::Label>>\nclass LabelReachable {\n public:\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n  using Data = D;\n\n  using LabelIntervalSet = typename Data::LabelIntervalSet;\n\n  using Interval = typename LabelIntervalSet::Interval;\n\n  LabelReachable(const Fst<Arc> &fst, bool reach_input,\n                 Accumulator *accumulator = nullptr,\n                 bool keep_relabel_data = true)\n      : fst_(new VectorFst<Arc>(fst)),\n        s_(kNoStateId),\n        data_(std::make_shared<Data>(reach_input, keep_relabel_data)),\n        accumulator_(accumulator ? accumulator : new Accumulator()),\n        ncalls_(0),\n        nintervals_(0),\n        reach_fst_input_(false),\n        error_(false) {\n    const auto ins = fst_->NumStates();\n    TransformFst();\n    FindIntervals(ins);\n    fst_.reset();\n  }\n\n  explicit LabelReachable(std::shared_ptr<Data> data,\n                          Accumulator *accumulator = nullptr)\n      : s_(kNoStateId),\n        data_(std::move(data)),\n        accumulator_(accumulator ? accumulator : new Accumulator()),\n        ncalls_(0),\n        nintervals_(0),\n        reach_fst_input_(false),\n        error_(false) {}\n\n  LabelReachable(const LabelReachable<Arc, Accumulator, Data> &reachable,\n                 bool safe = false)\n      : s_(kNoStateId),\n        data_(reachable.data_),\n        accumulator_(new Accumulator(*reachable.accumulator_, safe)),\n        ncalls_(0),\n        nintervals_(0),\n        reach_fst_input_(reachable.reach_fst_input_),\n        error_(reachable.error_) {}\n\n  ~LabelReachable() {\n    if (ncalls_ > 0) {\n      VLOG(2) << \"# of calls: \" << ncalls_;\n      VLOG(2) << \"# of intervals/call: \" << (nintervals_ / ncalls_);\n    }\n  }\n\n  // Relabels w.r.t labels that give compact label sets.\n  Label Relabel(Label label) {\n    if (label == 0 || error_) return label;\n    auto &label2index = *data_->Label2Index();\n    auto &relabel = label2index[label];\n    if (!relabel) relabel = label2index.size() + 1;  // Adds new label.\n    return relabel;\n  }\n\n  // Relabels FST w.r.t to labels that give compact label sets.\n  void Relabel(MutableFst<Arc> *fst, bool relabel_input) {\n    for (StateIterator<MutableFst<Arc>> siter(*fst); !siter.Done();\n         siter.Next()) {\n      for (MutableArcIterator<MutableFst<Arc>> aiter(fst, siter.Value());\n           !aiter.Done(); aiter.Next()) {\n        auto arc = aiter.Value();\n        if (relabel_input) {\n          arc.ilabel = Relabel(arc.ilabel);\n        } else {\n          arc.olabel = Relabel(arc.olabel);\n        }\n        aiter.SetValue(arc);\n      }\n    }\n    if (relabel_input) {\n      ArcSort(fst, ILabelCompare<Arc>());\n      fst->SetInputSymbols(nullptr);\n    } else {\n      ArcSort(fst, OLabelCompare<Arc>());\n      fst->SetOutputSymbols(nullptr);\n    }\n  }\n\n  // Returns relabeling pairs (cf. relabel.h::Relabel()). If avoid_collisions is\n  // true, extra pairs are added to ensure no collisions when relabeling\n  // automata that have labels unseen here.\n  void RelabelPairs(std::vector<std::pair<Label, Label>> *pairs,\n                    bool avoid_collisions = false) {\n    pairs->clear();\n    const auto &label2index = *data_->Label2Index();\n    // Maps labels to their new values in [1, label2index().size()].\n    for (auto it = label2index.begin(); it != label2index.end(); ++it) {\n      if (it->second != data_->FinalLabel()) {\n        pairs->push_back(std::make_pair(it->first, it->second));\n      }\n    }\n    if (avoid_collisions) {\n      // Ensures any label in [1, label2index().size()] is mapped either\n      // by the above step or to label2index() + 1 (to avoid collisions).\n      for (size_t i = 1; i <= label2index.size(); ++i) {\n        const auto it = label2index.find(i);\n        if (it == label2index.end() || it->second == data_->FinalLabel()) {\n          pairs->push_back(std::make_pair(i, label2index.size() + 1));\n        }\n      }\n    }\n  }\n\n  // Set current state. Optionally set state associated\n  // with arc iterator to be passed to Reach.\n  void SetState(StateId s, StateId aiter_s = kNoStateId) {\n    s_ = s;\n    if (aiter_s != kNoStateId) {\n      accumulator_->SetState(aiter_s);\n      if (accumulator_->Error()) error_ = true;\n    }\n  }\n\n  // Can reach this label from current state?\n  // Original labels must be transformed by the Relabel methods above.\n  bool Reach(Label label) const {\n    if (label == 0 || error_) return false;\n    return data_->GetIntervalSet(s_).Member(label);\n  }\n\n  // Can reach final state (via epsilon transitions) from this state?\n  bool ReachFinal() const {\n    if (error_) return false;\n    return data_->GetIntervalSet(s_).Member(data_->FinalLabel());\n  }\n\n  // Initialize with secondary FST to be used with Reach(Iterator,...).\n  // If reach_input = true, then arc input labels are considered in\n  // Reach(aiter, ...), o.w. output labels are considered. If copy is true, then\n  // the FST is a copy of the FST used in the previous call to this method\n  // (useful to avoid unnecessary updates).\n  template <class FST>\n  void ReachInit(const FST &fst, bool reach_input, bool copy = false) {\n    reach_fst_input_ = reach_input;\n    if (!fst.Properties(reach_fst_input_ ? kILabelSorted : kOLabelSorted,\n                        true)) {\n      FSTERROR() << \"LabelReachable::ReachInit: Fst is not sorted\";\n      error_ = true;\n    }\n    accumulator_->Init(fst, copy);\n    if (accumulator_->Error()) error_ = true;\n  }\n\n  // Can reach any arc iterator label between iterator positions\n  // aiter_begin and aiter_end?\n  // Arc iterator labels must be transformed by the Relabel methods\n  // above. If compute_weight is true, user may call ReachWeight().\n  template <class Iterator>\n  bool Reach(Iterator *aiter, std::ptrdiff_t aiter_begin, std::ptrdiff_t aiter_end,\n             bool compute_weight) {\n    if (error_) return false;\n    const auto &interval_set = data_->GetIntervalSet(s_);\n    ++ncalls_;\n    nintervals_ += interval_set.Size();\n    reach_begin_ = -1;\n    reach_end_ = -1;\n    reach_weight_ = Weight::Zero();\n    const auto flags = aiter->Flags();  // Save flags to restore them on exit.\n    aiter->SetFlags(kArcNoCache, kArcNoCache);  // Makes caching optional.\n    aiter->Seek(aiter_begin);\n    if (2 * (aiter_end - aiter_begin) < interval_set.Size()) {\n      // Checks each arc against intervals, setting arc iterator flags to only\n      // compute the ilabel or olabel values, since they are the only values\n      // required for most of the arcs processed.\n      aiter->SetFlags(reach_fst_input_ ? kArcILabelValue : kArcOLabelValue,\n                      kArcValueFlags);\n      Label reach_label = kNoLabel;\n      for (auto aiter_pos = aiter_begin; aiter_pos < aiter_end;\n           aiter->Next(), ++aiter_pos) {\n        const auto &arc = aiter->Value();\n        const auto label = reach_fst_input_ ? arc.ilabel : arc.olabel;\n        if (label == reach_label || Reach(label)) {\n          reach_label = label;\n          if (reach_begin_ < 0) reach_begin_ = aiter_pos;\n          reach_end_ = aiter_pos + 1;\n          if (compute_weight) {\n            if (!(aiter->Flags() & kArcWeightValue)) {\n              // If arc.weight wasn't computed by the call to aiter->Value()\n              // above, we need to call aiter->Value() again after having set\n              // the arc iterator flags to compute the arc weight value.\n              aiter->SetFlags(kArcWeightValue, kArcValueFlags);\n              const auto &arcb = aiter->Value();\n              // Call the accumulator.\n              reach_weight_ = accumulator_->Sum(reach_weight_, arcb.weight);\n              // Only ilabel or olabel required to process the following arcs.\n              aiter->SetFlags(\n                  reach_fst_input_ ? kArcILabelValue : kArcOLabelValue,\n                  kArcValueFlags);\n            } else {\n              // Calls the accumulator.\n              reach_weight_ = accumulator_->Sum(reach_weight_, arc.weight);\n            }\n          }\n        }\n      }\n    } else {\n      // Checks each interval against arcs.\n      auto begin_low = aiter_begin;\n      auto end_low = aiter_begin;\n      for (const auto &interval : interval_set) {\n        begin_low = LowerBound(aiter, end_low, aiter_end, interval.begin);\n        end_low = LowerBound(aiter, begin_low, aiter_end, interval.end);\n        if (end_low - begin_low > 0) {\n          if (reach_begin_ < 0) reach_begin_ = begin_low;\n          reach_end_ = end_low;\n          if (compute_weight) {\n            aiter->SetFlags(kArcWeightValue, kArcValueFlags);\n            reach_weight_ =\n                accumulator_->Sum(reach_weight_, aiter, begin_low, end_low);\n          }\n        }\n      }\n    }\n    aiter->SetFlags(flags, kArcFlags);  // Restores original flag values.\n    return reach_begin_ >= 0;\n  }\n\n  // Returns iterator position of first matching arc.\n  std::ptrdiff_t ReachBegin() const { return reach_begin_; }\n\n  // Returns iterator position one past last matching arc.\n  std::ptrdiff_t ReachEnd() const { return reach_end_; }\n\n  // Return the sum of the weights for matching arcs. Valid only if\n  // compute_weight was true in Reach() call.\n  Weight ReachWeight() const { return reach_weight_; }\n\n  // Access to the relabeling map. Excludes epsilon (0) label but\n  // includes kNoLabel that is used internally for super-final\n  // transitons.\n  const std::unordered_map<Label, Label> &Label2Index() const {\n    return *data_->Label2Index();\n  }\n\n  const Data *GetData() const { return data_.get(); }\n\n  std::shared_ptr<Data> GetSharedData() const { return data_; }\n\n  bool Error() const { return error_ || accumulator_->Error(); }\n\n private:\n  // Redirects labeled arcs (input or output labels determined by ReachInput())\n  // to new label-specific final states. Each original final state is\n  // redirected via a transition labeled with kNoLabel to a new\n  // kNoLabel-specific final state. Creates super-initial state for all states\n  // with zero in-degree.\n  void TransformFst() {\n    auto ins = fst_->NumStates();\n    auto ons = ins;\n    std::vector<std::ptrdiff_t> indeg(ins, 0);\n    // Redirects labeled arcs to new final states.\n    for (StateId s = 0; s < ins; ++s) {\n      for (MutableArcIterator<VectorFst<Arc>> aiter(fst_.get(), s);\n           !aiter.Done(); aiter.Next()) {\n        auto arc = aiter.Value();\n        const auto label = data_->ReachInput() ? arc.ilabel : arc.olabel;\n        if (label) {\n          auto insert_result = label2state_.insert(std::make_pair(label, ons));\n          if (insert_result.second) {\n            indeg.push_back(0);\n            ++ons;\n          }\n          arc.nextstate = label2state_[label];\n          aiter.SetValue(arc);\n        }\n        ++indeg[arc.nextstate];  // Finds in-degrees for next step.\n      }\n      // Redirects final weights to new final state.\n      const auto final_weight = fst_->Final(s);\n      if (final_weight != Weight::Zero()) {\n        auto insert_result = label2state_.insert(std::make_pair(kNoLabel, ons));\n        if (insert_result.second) {\n          indeg.push_back(0);\n          ++ons;\n        }\n        Arc arc(kNoLabel, kNoLabel, final_weight, label2state_[kNoLabel]);\n        fst_->AddArc(s, arc);\n        ++indeg[arc.nextstate];  // Finds in-degrees for next step.\n        fst_->SetFinal(s, Weight::Zero());\n      }\n    }\n    // Adds new final states to the FST.\n    while (fst_->NumStates() < ons) {\n      StateId s = fst_->AddState();\n      fst_->SetFinal(s, Weight::One());\n    }\n    // Creates a super-initial state for all states with zero in-degree.\n    const auto start = fst_->AddState();\n    fst_->SetStart(start);\n    for (StateId s = 0; s < start; ++s) {\n      if (indeg[s] == 0) {\n        Arc arc(0, 0, Weight::One(), s);\n        fst_->AddArc(start, arc);\n      }\n    }\n  }\n\n  void FindIntervals(StateId ins) {\n    StateReachable<Arc, Label, LabelIntervalSet> state_reachable(*fst_);\n    if (state_reachable.Error()) {\n      error_ = true;\n      return;\n    }\n    auto &state2index = state_reachable.State2Index();\n    auto &interval_sets = *data_->MutableIntervalSets();\n    interval_sets = state_reachable.IntervalSets();\n    interval_sets.resize(ins);\n    auto &label2index = *data_->Label2Index();\n    for (const auto &kv : label2state_) {\n      Label i = state2index[kv.second];\n      label2index[kv.first] = i;\n      if (kv.first == kNoLabel) data_->SetFinalLabel(i);\n    }\n    label2state_.clear();\n    double nintervals = 0;\n    std::ptrdiff_t non_intervals = 0;\n    for (StateId s = 0; s < ins; ++s) {\n      nintervals += interval_sets[s].Size();\n      if (interval_sets[s].Size() > 1) {\n        ++non_intervals;\n        VLOG(3) << \"state: \" << s\n                << \" # of intervals: \" << interval_sets[s].Size();\n      }\n    }\n    VLOG(2) << \"# of states: \" << ins;\n    VLOG(2) << \"# of intervals: \" << nintervals;\n    VLOG(2) << \"# of intervals/state: \" << nintervals / ins;\n    VLOG(2) << \"# of non-interval states: \" << non_intervals;\n  }\n\n  template <class Iterator>\n  std::ptrdiff_t LowerBound(Iterator *aiter, std::ptrdiff_t aiter_begin, std::ptrdiff_t aiter_end,\n                     Label match_label) const {\n    // Only needs to compute the ilabel or olabel of arcs when performing the\n    // binary search.\n    aiter->SetFlags(reach_fst_input_ ? kArcILabelValue : kArcOLabelValue,\n                    kArcValueFlags);\n    std::ptrdiff_t low = aiter_begin;\n    std::ptrdiff_t high = aiter_end;\n    while (low < high) {\n      const std::ptrdiff_t mid = low + (high - low) / 2;\n      aiter->Seek(mid);\n      auto label =\n          reach_fst_input_ ? aiter->Value().ilabel : aiter->Value().olabel;\n      if (label < match_label) {\n        low = mid + 1;\n      } else {\n        high = mid;\n      }\n    }\n    aiter->Seek(low);\n    aiter->SetFlags(kArcValueFlags, kArcValueFlags);\n    return low;\n  }\n\n  std::unique_ptr<VectorFst<Arc>> fst_;\n  // Current state\n  StateId s_;\n  // Finds final state for a label\n  std::unordered_map<Label, StateId> label2state_;\n  // Iterator position of first match.\n  std::ptrdiff_t reach_begin_;\n  // Iterator position after last match.\n  std::ptrdiff_t reach_end_;\n  // Gives weight sum of arc iterator arcs with reachable labels.\n  Weight reach_weight_;\n  // Shareable data between copies.\n  std::shared_ptr<Data> data_;\n  // Sums arc weights.\n  std::unique_ptr<Accumulator> accumulator_;\n  double ncalls_;\n  double nintervals_;\n  bool reach_fst_input_;\n  bool error_;\n};\n\n}  // namespace fst\n\n#endif  // FST_LABEL_REACHABLE_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/lexicographic-weight.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Lexicographic weight set and associated semiring operation definitions.\n//\n// A lexicographic weight is a sequence of weights, each of which must have the\n// path property and Times() must be (strongly) cancellative\n// (for all a,b,c != Zero(): Times(c, a) = Times(c, b) => a = b,\n// Times(a, c) = Times(b, c) => a = b).\n// The + operation on two weights a and b is the lexicographically\n// prior of a and b.\n\n#ifndef FST_LEXICOGRAPHIC_WEIGHT_H_\n#define FST_LEXICOGRAPHIC_WEIGHT_H_\n\n#include <cstdlib>\n\n#include <string>\n\n#include <fst/log.h>\n\n#include <fst/pair-weight.h>\n#include <fst/weight.h>\n\n\nnamespace fst {\n\ntemplate <class W1, class W2>\nclass LexicographicWeight : public PairWeight<W1, W2> {\n public:\n  using ReverseWeight = LexicographicWeight<typename W1::ReverseWeight,\n                                            typename W2::ReverseWeight>;\n\n  using PairWeight<W1, W2>::Value1;\n  using PairWeight<W1, W2>::Value2;\n  using PairWeight<W1, W2>::SetValue1;\n  using PairWeight<W1, W2>::SetValue2;\n  using PairWeight<W1, W2>::Zero;\n  using PairWeight<W1, W2>::One;\n  using PairWeight<W1, W2>::NoWeight;\n  using PairWeight<W1, W2>::Quantize;\n  using PairWeight<W1, W2>::Reverse;\n\n  LexicographicWeight() {}\n\n  explicit LexicographicWeight(const PairWeight<W1, W2> &w)\n      : PairWeight<W1, W2>(w) {}\n\n  LexicographicWeight(W1 w1, W2 w2) : PairWeight<W1, W2>(w1, w2) {\n    if ((W1::Properties() & kPath) != kPath) {\n      FSTERROR() << \"LexicographicWeight must \"\n                 << \"have the path property: \" << W1::Type();\n      SetValue1(W1::NoWeight());\n    }\n    if ((W2::Properties() & kPath) != kPath) {\n      FSTERROR() << \"LexicographicWeight must \"\n                 << \"have the path property: \" << W2::Type();\n      SetValue2(W2::NoWeight());\n    }\n  }\n\n  static const LexicographicWeight &Zero() {\n    static const LexicographicWeight zero(PairWeight<W1, W2>::Zero());\n    return zero;\n  }\n\n  static const LexicographicWeight &One() {\n    static const LexicographicWeight one(PairWeight<W1, W2>::One());\n    return one;\n  }\n\n  static const LexicographicWeight &NoWeight() {\n    static const LexicographicWeight no_weight(PairWeight<W1, W2>::NoWeight());\n    return no_weight;\n  }\n\n  static const string &Type() {\n    static const string *const type =\n        new string(W1::Type() + \"_LT_\" + W2::Type());\n    return *type;\n  }\n\n  bool Member() const {\n    if (!Value1().Member() || !Value2().Member()) return false;\n    // Lexicographic weights cannot mix zeroes and non-zeroes.\n    if (Value1() == W1::Zero() && Value2() == W2::Zero()) return true;\n    if (Value1() != W1::Zero() && Value2() != W2::Zero()) return true;\n    return false;\n  }\n\n  LexicographicWeight Quantize(float delta = kDelta) const {\n    return LexicographicWeight(PairWeight<W1, W2>::Quantize());\n  }\n\n  ReverseWeight Reverse() const {\n    return ReverseWeight(PairWeight<W1, W2>::Reverse());\n  }\n\n  static constexpr uint64_t Properties() {\n    return W1::Properties() & W2::Properties() &\n           (kLeftSemiring | kRightSemiring | kPath | kIdempotent |\n            kCommutative);\n  }\n};\n\ntemplate <class W1, class W2>\ninline LexicographicWeight<W1, W2> Plus(const LexicographicWeight<W1, W2> &w,\n                                        const LexicographicWeight<W1, W2> &v) {\n  if (!w.Member() || !v.Member()) {\n    return LexicographicWeight<W1, W2>::NoWeight();\n  }\n  NaturalLess<W1> less1;\n  NaturalLess<W2> less2;\n  if (less1(w.Value1(), v.Value1())) return w;\n  if (less1(v.Value1(), w.Value1())) return v;\n  if (less2(w.Value2(), v.Value2())) return w;\n  if (less2(v.Value2(), w.Value2())) return v;\n  return w;\n}\n\ntemplate <class W1, class W2>\ninline LexicographicWeight<W1, W2> Times(const LexicographicWeight<W1, W2> &w,\n                                         const LexicographicWeight<W1, W2> &v) {\n  return LexicographicWeight<W1, W2>(Times(w.Value1(), v.Value1()),\n                                     Times(w.Value2(), v.Value2()));\n}\n\ntemplate <class W1, class W2>\ninline LexicographicWeight<W1, W2> Divide(const LexicographicWeight<W1, W2> &w,\n                                          const LexicographicWeight<W1, W2> &v,\n                                          DivideType typ = DIVIDE_ANY) {\n  return LexicographicWeight<W1, W2>(Divide(w.Value1(), v.Value1(), typ),\n                                     Divide(w.Value2(), v.Value2(), typ));\n}\n\n// This function object generates weights by calling the underlying generators\n// for the templated weight types, like all other pair weight types. However,\n// for lexicographic weights, we cannot generate zeroes for the two subweights\n// separately: weights are members iff both members are zero or both members\n// are non-zero. This is intended primarily for testing.\ntemplate <class W1, class W2>\nclass WeightGenerate<LexicographicWeight<W1, W2>> {\n public:\n  using Weight = LexicographicWeight<W1, W1>;\n  using Generate1 = WeightGenerate<W1>;\n  using Generate2 = WeightGenerate<W2>;\n\n  explicit WeightGenerate(bool allow_zero = true,\n                          size_t num_random_weights = kNumRandomWeights)\n      : generator1_(false, num_random_weights),\n        generator2_(false, num_random_weights), allow_zero_(allow_zero),\n        num_random_weights_(num_random_weights) {}\n\n  Weight operator()() const {\n    if (allow_zero_) {\n      const int n = rand() % (num_random_weights_ + 1);  // NOLINT\n      if (n == num_random_weights_) return Weight(W1::Zero(), W2::Zero());\n    }\n    return Weight(generator1_(), generator2_());\n  }\n\n private:\n  const Generate1 generator1_;\n  const Generate2 generator2_;\n  // Permits Zero() and zero divisors.\n  const bool allow_zero_;\n  // The number of alternative random weights.\n  const size_t num_random_weights_;\n};\n\n}  // namespace fst\n\n#endif  // FST_LEXICOGRAPHIC_WEIGHT_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/linear-fst.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Classes for building, storing and representing log-linear models as FSTs.\n\n#ifndef FST_EXTENSIONS_LINEAR_LINEAR_FST_H_\n#define FST_EXTENSIONS_LINEAR_LINEAR_FST_H_\n\n#include <algorithm>\n#include <iostream>\n#include <memory>\n#include <vector>\n\n#include <fst/compat.h>\n#include <fst/log.h>\n#include <fst/extensions/pdt/collection.h>\n#include <fst/bi-table.h>\n#include <fst/cache.h>\n#include <fstream>\n#include <fst/fst.h>\n#include <fst/matcher.h>\n#include <fst/symbol-table.h>\n\n#include <fst/extensions/linear/linear-fst-data.h>\n\nnamespace fst {\n\n// Forward declaration of the specialized matcher for both\n// LinearTaggerFst and LinearClassifierFst.\ntemplate <class F>\nclass LinearFstMatcherTpl;\n\nnamespace internal {\n\n// Implementation class for on-the-fly generated LinearTaggerFst with\n// special optimization in matching.\ntemplate <class A>\nclass LinearTaggerFstImpl : public CacheImpl<A> {\n public:\n  using FstImpl<A>::SetType;\n  using FstImpl<A>::SetProperties;\n  using FstImpl<A>::SetInputSymbols;\n  using FstImpl<A>::SetOutputSymbols;\n  using FstImpl<A>::WriteHeader;\n\n  using CacheBaseImpl<CacheState<A>>::PushArc;\n  using CacheBaseImpl<CacheState<A>>::HasArcs;\n  using CacheBaseImpl<CacheState<A>>::HasFinal;\n  using CacheBaseImpl<CacheState<A>>::HasStart;\n  using CacheBaseImpl<CacheState<A>>::SetArcs;\n  using CacheBaseImpl<CacheState<A>>::SetFinal;\n  using CacheBaseImpl<CacheState<A>>::SetStart;\n\n  typedef A Arc;\n  typedef typename A::Label Label;\n  typedef typename A::Weight Weight;\n  typedef typename A::StateId StateId;\n  typedef typename Collection<StateId, Label>::SetIterator NGramIterator;\n\n  // Constructs an empty FST by default.\n  LinearTaggerFstImpl()\n      : CacheImpl<A>(CacheOptions()),\n        data_(std::make_shared<LinearFstData<A>>()),\n        delay_(0) {\n    SetType(\"linear-tagger\");\n  }\n\n  // Constructs the FST with given data storage and symbol\n  // tables.\n  //\n  // TODO(wuke): when there is no constraint on output we can delay\n  // less than `data->MaxFutureSize` positions.\n  LinearTaggerFstImpl(const LinearFstData<Arc> *data, const SymbolTable *isyms,\n                      const SymbolTable *osyms, CacheOptions opts)\n      : CacheImpl<A>(opts), data_(data), delay_(data->MaxFutureSize()) {\n    SetType(\"linear-tagger\");\n    SetProperties(kILabelSorted, kFstProperties);\n    SetInputSymbols(isyms);\n    SetOutputSymbols(osyms);\n    ReserveStubSpace();\n  }\n\n  // Copy by sharing the underlying data storage.\n  LinearTaggerFstImpl(const LinearTaggerFstImpl &impl)\n      : CacheImpl<A>(impl), data_(impl.data_), delay_(impl.delay_) {\n    SetType(\"linear-tagger\");\n    SetProperties(impl.Properties(), kCopyProperties);\n    SetInputSymbols(impl.InputSymbols());\n    SetOutputSymbols(impl.OutputSymbols());\n    ReserveStubSpace();\n  }\n\n  StateId Start() {\n    if (!HasStart()) {\n      StateId start = FindStartState();\n      SetStart(start);\n    }\n    return CacheImpl<A>::Start();\n  }\n\n  Weight Final(StateId s) {\n    if (!HasFinal(s)) {\n      state_stub_.clear();\n      FillState(s, &state_stub_);\n      if (CanBeFinal(state_stub_))\n        SetFinal(s, data_->FinalWeight(InternalBegin(state_stub_),\n                                       InternalEnd(state_stub_)));\n      else\n        SetFinal(s, Weight::Zero());\n    }\n    return CacheImpl<A>::Final(s);\n  }\n\n  size_t NumArcs(StateId s) {\n    if (!HasArcs(s)) Expand(s);\n    return CacheImpl<A>::NumArcs(s);\n  }\n\n  size_t NumInputEpsilons(StateId s) {\n    if (!HasArcs(s)) Expand(s);\n    return CacheImpl<A>::NumInputEpsilons(s);\n  }\n\n  size_t NumOutputEpsilons(StateId s) {\n    if (!HasArcs(s)) Expand(s);\n    return CacheImpl<A>::NumOutputEpsilons(s);\n  }\n\n  void InitArcIterator(StateId s, ArcIteratorData<A> *data) {\n    if (!HasArcs(s)) Expand(s);\n    CacheImpl<A>::InitArcIterator(s, data);\n  }\n\n  // Computes the outgoing transitions from a state, creating new\n  // destination states as needed.\n  void Expand(StateId s);\n\n  // Appends to `arcs` all out-going arcs from state `s` that matches `label` as\n  // the input label.\n  void MatchInput(StateId s, Label ilabel, std::vector<Arc> *arcs);\n\n  static LinearTaggerFstImpl *Read(std::istream &strm,\n                                   const FstReadOptions &opts);\n\n  bool Write(std::ostream &strm,  // NOLINT\n             const FstWriteOptions &opts) const {\n    FstHeader header;\n    header.SetStart(kNoStateId);\n    WriteHeader(strm, opts, kFileVersion, &header);\n    data_->Write(strm);\n    if (!strm) {\n      LOG(ERROR) << \"LinearTaggerFst::Write: Write failed: \" << opts.source;\n      return false;\n    }\n    return true;\n  }\n\n private:\n  static const int kMinFileVersion;\n  static const int kFileVersion;\n\n  // A collection of functions to access parts of the state tuple. A\n  // state tuple is a vector of `Label`s with two parts:\n  //   [buffer] [internal].\n  //\n  // - [buffer] is a buffer of observed input labels with length\n  // `delay_`. `LinearFstData<A>::kStartOfSentence`\n  // (resp. `LinearFstData<A>::kEndOfSentence`) are used as\n  // paddings when the buffer has fewer than `delay_` elements, which\n  // can only appear as the prefix (resp. suffix) of the buffer.\n  //\n  // - [internal] is the internal state tuple for `LinearFstData`\n  typename std::vector<Label>::const_iterator BufferBegin(\n      const std::vector<Label> &state) const {\n    return state.begin();\n  }\n\n  typename std::vector<Label>::const_iterator BufferEnd(\n      const std::vector<Label> &state) const {\n    return state.begin() + delay_;\n  }\n\n  typename std::vector<Label>::const_iterator InternalBegin(\n      const std::vector<Label> &state) const {\n    return state.begin() + delay_;\n  }\n\n  typename std::vector<Label>::const_iterator InternalEnd(\n      const std::vector<Label> &state) const {\n    return state.end();\n  }\n\n  // The size of state tuples are fixed, reserve them in stubs\n  void ReserveStubSpace() {\n    state_stub_.reserve(delay_ + data_->NumGroups());\n    next_stub_.reserve(delay_ + data_->NumGroups());\n  }\n\n  // Computes the start state tuple and maps it to the start state id.\n  StateId FindStartState() {\n    // Empty buffer with start-of-sentence paddings\n    state_stub_.clear();\n    state_stub_.resize(delay_, LinearFstData<A>::kStartOfSentence);\n    // Append internal states\n    data_->EncodeStartState(&state_stub_);\n    return FindState(state_stub_);\n  }\n\n  // Tests whether the buffer in `(begin, end)` is empty.\n  bool IsEmptyBuffer(typename std::vector<Label>::const_iterator begin,\n                     typename std::vector<Label>::const_iterator end) const {\n    // The following is guanranteed by `ShiftBuffer()`:\n    // - buffer[i] == LinearFstData<A>::kEndOfSentence =>\n    //       buffer[i+x] == LinearFstData<A>::kEndOfSentence\n    // - buffer[i] == LinearFstData<A>::kStartOfSentence =>\n    //       buffer[i-x] == LinearFstData<A>::kStartOfSentence\n    return delay_ == 0 || *(end - 1) == LinearFstData<A>::kStartOfSentence ||\n           *begin == LinearFstData<A>::kEndOfSentence;\n  }\n\n  // Tests whether the given state tuple can be a final state. A state\n  // is final iff there is no observed input in the buffer.\n  bool CanBeFinal(const std::vector<Label> &state) {\n    return IsEmptyBuffer(BufferBegin(state), BufferEnd(state));\n  }\n\n  // Finds state corresponding to an n-gram. Creates new state if n-gram not\n  // found.\n  StateId FindState(const std::vector<Label> &ngram) {\n    StateId sparse = ngrams_.FindId(ngram, true);\n    StateId dense = condensed_.FindId(sparse, true);\n    return dense;\n  }\n\n  // Appends after `output` the state tuple corresponding to the state id. The\n  // state id must exist.\n  void FillState(StateId s, std::vector<Label> *output) {\n    s = condensed_.FindEntry(s);\n    for (NGramIterator it = ngrams_.FindSet(s); !it.Done(); it.Next()) {\n      Label label = it.Element();\n      output->push_back(label);\n    }\n  }\n\n  // Shifts the buffer in `state` by appending `ilabel` and popping\n  // the one in the front as the return value. `next_stub_` is a\n  // shifted buffer of size `delay_` where the first `delay_ - 1`\n  // elements are the last `delay_ - 1` elements in the buffer of\n  // `state`. The last (if any) element in `next_stub_` will be\n  // `ilabel` after the call returns.\n  Label ShiftBuffer(const std::vector<Label> &state, Label ilabel,\n                    std::vector<Label> *next_stub_);\n\n  // Builds an arc from state tuple `state` consuming `ilabel` and\n  // `olabel`. `next_stub_` is the buffer filled in `ShiftBuffer`.\n  Arc MakeArc(const std::vector<Label> &state, Label ilabel, Label olabel,\n              std::vector<Label> *next_stub_);\n\n  // Expands arcs from state `s`, equivalent to state tuple `state`,\n  // with input `ilabel`. `next_stub_` is the buffer filled in\n  // `ShiftBuffer`.\n  void ExpandArcs(StateId s, const std::vector<Label> &state, Label ilabel,\n                  std::vector<Label> *next_stub_);\n\n  // Appends arcs from state `s`, equivalent to state tuple `state`,\n  // with input `ilabel` to `arcs`. `next_stub_` is the buffer filled\n  // in `ShiftBuffer`.\n  void AppendArcs(StateId s, const std::vector<Label> &state, Label ilabel,\n                  std::vector<Label> *next_stub_, std::vector<Arc> *arcs);\n\n  std::shared_ptr<const LinearFstData<A>> data_;\n  size_t delay_;\n  // Mapping from internal state tuple to *non-consecutive* ids\n  Collection<StateId, Label> ngrams_;\n  // Mapping from non-consecutive id to actual state id\n  CompactHashBiTable<StateId, StateId, std::hash<StateId>> condensed_;\n  // Two frequently used vectors, reuse to avoid repeated heap\n  // allocation\n  std::vector<Label> state_stub_, next_stub_;\n\n  LinearTaggerFstImpl &operator=(const LinearTaggerFstImpl &) = delete;\n};\n\ntemplate <class A>\nconst int LinearTaggerFstImpl<A>::kMinFileVersion = 1;\n\ntemplate <class A>\nconst int LinearTaggerFstImpl<A>::kFileVersion = 1;\n\ntemplate <class A>\ninline typename A::Label LinearTaggerFstImpl<A>::ShiftBuffer(\n    const std::vector<Label> &state, Label ilabel,\n    std::vector<Label> *next_stub_) {\n  DCHECK(ilabel > 0 || ilabel == LinearFstData<A>::kEndOfSentence);\n  if (delay_ == 0) {\n    DCHECK_GT(ilabel, 0);\n    return ilabel;\n  } else {\n    (*next_stub_)[BufferEnd(*next_stub_) - next_stub_->begin() - 1] = ilabel;\n    return *BufferBegin(state);\n  }\n}\n\ntemplate <class A>\ninline A LinearTaggerFstImpl<A>::MakeArc(const std::vector<Label> &state,\n                                         Label ilabel, Label olabel,\n                                         std::vector<Label> *next_stub_) {\n  DCHECK(ilabel > 0 || ilabel == LinearFstData<A>::kEndOfSentence);\n  DCHECK(olabel > 0 || olabel == LinearFstData<A>::kStartOfSentence);\n  Weight weight(Weight::One());\n  data_->TakeTransition(BufferEnd(state), InternalBegin(state),\n                        InternalEnd(state), ilabel, olabel, next_stub_,\n                        &weight);\n  StateId nextstate = FindState(*next_stub_);\n  // Restore `next_stub_` to its size before the call\n  next_stub_->resize(delay_);\n  // In the actual arc, we use epsilons instead of boundaries.\n  return A(ilabel == LinearFstData<A>::kEndOfSentence ? 0 : ilabel,\n           olabel == LinearFstData<A>::kStartOfSentence ? 0 : olabel, weight,\n           nextstate);\n}\n\ntemplate <class A>\ninline void LinearTaggerFstImpl<A>::ExpandArcs(StateId s,\n                                               const std::vector<Label> &state,\n                                               Label ilabel,\n                                               std::vector<Label> *next_stub_) {\n  // Input label to constrain the output with, observed `delay_` steps\n  // back. `ilabel` is the input label to be put on the arc, which\n  // fires features.\n  Label obs_ilabel = ShiftBuffer(state, ilabel, next_stub_);\n  if (obs_ilabel == LinearFstData<A>::kStartOfSentence) {\n    // This happens when input is shorter than `delay_`.\n    PushArc(s, MakeArc(state, ilabel, LinearFstData<A>::kStartOfSentence,\n                       next_stub_));\n  } else {\n    std::pair<typename std::vector<typename A::Label>::const_iterator,\n              typename std::vector<typename A::Label>::const_iterator> range =\n        data_->PossibleOutputLabels(obs_ilabel);\n    for (typename std::vector<typename A::Label>::const_iterator it =\n             range.first;\n         it != range.second; ++it)\n      PushArc(s, MakeArc(state, ilabel, *it, next_stub_));\n  }\n}\n\n// TODO(wuke): this has much in duplicate with `ExpandArcs()`\ntemplate <class A>\ninline void LinearTaggerFstImpl<A>::AppendArcs(StateId /*s*/,\n                                               const std::vector<Label> &state,\n                                               Label ilabel,\n                                               std::vector<Label> *next_stub_,\n                                               std::vector<Arc> *arcs) {\n  // Input label to constrain the output with, observed `delay_` steps\n  // back. `ilabel` is the input label to be put on the arc, which\n  // fires features.\n  Label obs_ilabel = ShiftBuffer(state, ilabel, next_stub_);\n  if (obs_ilabel == LinearFstData<A>::kStartOfSentence) {\n    // This happens when input is shorter than `delay_`.\n    arcs->push_back(\n        MakeArc(state, ilabel, LinearFstData<A>::kStartOfSentence, next_stub_));\n  } else {\n    std::pair<typename std::vector<typename A::Label>::const_iterator,\n              typename std::vector<typename A::Label>::const_iterator> range =\n        data_->PossibleOutputLabels(obs_ilabel);\n    for (typename std::vector<typename A::Label>::const_iterator it =\n             range.first;\n         it != range.second; ++it)\n      arcs->push_back(MakeArc(state, ilabel, *it, next_stub_));\n  }\n}\n\ntemplate <class A>\nvoid LinearTaggerFstImpl<A>::Expand(StateId s) {\n  VLOG(3) << \"Expand \" << s;\n  state_stub_.clear();\n  FillState(s, &state_stub_);\n\n  // Precompute the first `delay_ - 1` elements in the buffer of\n  // next states, which are identical for different input/output.\n  next_stub_.clear();\n  next_stub_.resize(delay_);\n  if (delay_ > 0)\n    std::copy(BufferBegin(state_stub_) + 1, BufferEnd(state_stub_),\n              next_stub_.begin());\n\n  // Epsilon transition for flushing out the next observed input\n  if (!IsEmptyBuffer(BufferBegin(state_stub_), BufferEnd(state_stub_)))\n    ExpandArcs(s, state_stub_, LinearFstData<A>::kEndOfSentence, &next_stub_);\n\n  // Non-epsilon input when we haven't flushed\n  if (delay_ == 0 ||\n      *(BufferEnd(state_stub_) - 1) != LinearFstData<A>::kEndOfSentence)\n    for (Label ilabel = data_->MinInputLabel();\n         ilabel <= data_->MaxInputLabel(); ++ilabel)\n      ExpandArcs(s, state_stub_, ilabel, &next_stub_);\n\n  SetArcs(s);\n}\n\ntemplate <class A>\nvoid LinearTaggerFstImpl<A>::MatchInput(StateId s, Label ilabel,\n                                        std::vector<Arc> *arcs) {\n  state_stub_.clear();\n  FillState(s, &state_stub_);\n\n  // Precompute the first `delay_ - 1` elements in the buffer of\n  // next states, which are identical for different input/output.\n  next_stub_.clear();\n  next_stub_.resize(delay_);\n  if (delay_ > 0)\n    std::copy(BufferBegin(state_stub_) + 1, BufferEnd(state_stub_),\n              next_stub_.begin());\n\n  if (ilabel == 0) {\n    // Epsilon transition for flushing out the next observed input\n    if (!IsEmptyBuffer(BufferBegin(state_stub_), BufferEnd(state_stub_)))\n      AppendArcs(s, state_stub_, LinearFstData<A>::kEndOfSentence, &next_stub_,\n                 arcs);\n  } else {\n    // Non-epsilon input when we haven't flushed\n    if (delay_ == 0 ||\n        *(BufferEnd(state_stub_) - 1) != LinearFstData<A>::kEndOfSentence)\n      AppendArcs(s, state_stub_, ilabel, &next_stub_, arcs);\n  }\n}\n\ntemplate <class A>\ninline LinearTaggerFstImpl<A> *LinearTaggerFstImpl<A>::Read(\n    std::istream &strm, const FstReadOptions &opts) {  // NOLINT\n  std::unique_ptr<LinearTaggerFstImpl<A>> impl(new LinearTaggerFstImpl<A>());\n  FstHeader header;\n  if (!impl->ReadHeader(strm, opts, kMinFileVersion, &header)) {\n    return nullptr;\n  }\n  impl->data_ = std::shared_ptr<LinearFstData<A>>(LinearFstData<A>::Read(strm));\n  if (!impl->data_) {\n    return nullptr;\n  }\n  impl->delay_ = impl->data_->MaxFutureSize();\n  impl->ReserveStubSpace();\n  return impl.release();\n}\n\n}  // namespace internal\n\n// This class attaches interface to implementation and handles\n// reference counting, delegating most methods to ImplToFst.\ntemplate <class A>\nclass LinearTaggerFst : public ImplToFst<internal::LinearTaggerFstImpl<A>> {\n public:\n  friend class ArcIterator<LinearTaggerFst<A>>;\n  friend class StateIterator<LinearTaggerFst<A>>;\n  friend class LinearFstMatcherTpl<LinearTaggerFst<A>>;\n\n  typedef A Arc;\n  typedef typename A::Label Label;\n  typedef typename A::Weight Weight;\n  typedef typename A::StateId StateId;\n  typedef DefaultCacheStore<A> Store;\n  typedef typename Store::State State;\n  using Impl = internal::LinearTaggerFstImpl<A>;\n\n  LinearTaggerFst() : ImplToFst<Impl>(std::make_shared<Impl>()) {}\n\n  explicit LinearTaggerFst(LinearFstData<A> *data,\n                           const SymbolTable *isyms = nullptr,\n                           const SymbolTable *osyms = nullptr,\n                           CacheOptions opts = CacheOptions())\n      : ImplToFst<Impl>(std::make_shared<Impl>(data, isyms, osyms, opts)) {}\n\n  explicit LinearTaggerFst(const Fst<A> &fst)\n      : ImplToFst<Impl>(std::make_shared<Impl>()) {\n    LOG(FATAL) << \"LinearTaggerFst: no constructor from arbitrary FST.\";\n  }\n\n  // See Fst<>::Copy() for doc.\n  LinearTaggerFst(const LinearTaggerFst<A> &fst, bool safe = false)\n      : ImplToFst<Impl>(fst, safe) {}\n\n  // Get a copy of this LinearTaggerFst. See Fst<>::Copy() for further doc.\n  LinearTaggerFst<A> *Copy(bool safe = false) const override {\n    return new LinearTaggerFst<A>(*this, safe);\n  }\n\n  inline void InitStateIterator(StateIteratorData<A> *data) const override;\n\n  void InitArcIterator(StateId s, ArcIteratorData<A> *data) const override {\n    GetMutableImpl()->InitArcIterator(s, data);\n  }\n\n  MatcherBase<A> *InitMatcher(MatchType match_type) const override {\n    return new LinearFstMatcherTpl<LinearTaggerFst<A>>(this, match_type);\n  }\n\n  static LinearTaggerFst<A> *Read(const string &filename) {\n    if (!filename.empty()) {\n      std::ifstream strm(filename,\n                              std::ios_base::in | std::ios_base::binary);\n      if (!strm) {\n        LOG(ERROR) << \"LinearTaggerFst::Read: Can't open file: \" << filename;\n        return nullptr;\n      }\n      return Read(strm, FstReadOptions(filename));\n    } else {\n      return Read(std::cin, FstReadOptions(\"standard input\"));\n    }\n  }\n\n  static LinearTaggerFst<A> *Read(std::istream &in,  // NOLINT\n                                  const FstReadOptions &opts) {\n    auto *impl = Impl::Read(in, opts);\n    return impl ? new LinearTaggerFst<A>(std::shared_ptr<Impl>(impl)) : nullptr;\n  }\n\n  bool Write(const string &filename) const override {\n    if (!filename.empty()) {\n      std::ofstream strm(filename,\n                               std::ios_base::out | std::ios_base::binary);\n      if (!strm) {\n        LOG(ERROR) << \"LinearTaggerFst::Write: Can't open file: \" << filename;\n        return false;\n      }\n      return Write(strm, FstWriteOptions(filename));\n    } else {\n      return Write(std::cout, FstWriteOptions(\"standard output\"));\n    }\n  }\n\n  bool Write(std::ostream &strm, const FstWriteOptions &opts) const override {\n    return GetImpl()->Write(strm, opts);\n  }\n\n private:\n  using ImplToFst<Impl>::GetImpl;\n  using ImplToFst<Impl>::GetMutableImpl;\n\n  explicit LinearTaggerFst(std::shared_ptr<Impl> impl)\n      : ImplToFst<Impl>(impl) {}\n\n  void operator=(const LinearTaggerFst<A> &fst) = delete;\n};\n\n// Specialization for LinearTaggerFst.\ntemplate <class Arc>\nclass StateIterator<LinearTaggerFst<Arc>>\n    : public CacheStateIterator<LinearTaggerFst<Arc>> {\n public:\n  explicit StateIterator(const LinearTaggerFst<Arc> &fst)\n      : CacheStateIterator<LinearTaggerFst<Arc>>(fst, fst.GetMutableImpl()) {}\n};\n\n// Specialization for LinearTaggerFst.\ntemplate <class Arc>\nclass ArcIterator<LinearTaggerFst<Arc>>\n    : public CacheArcIterator<LinearTaggerFst<Arc>> {\n public:\n  using StateId = typename Arc::StateId;\n\n  ArcIterator(const LinearTaggerFst<Arc> &fst, StateId s)\n      : CacheArcIterator<LinearTaggerFst<Arc>>(fst.GetMutableImpl(), s) {\n    if (!fst.GetImpl()->HasArcs(s)) fst.GetMutableImpl()->Expand(s);\n  }\n};\n\ntemplate <class Arc>\ninline void LinearTaggerFst<Arc>::InitStateIterator(\n    StateIteratorData<Arc> *data) const {\n  data->base = new StateIterator<LinearTaggerFst<Arc>>(*this);\n}\n\nnamespace internal {\n\n// Implementation class for on-the-fly generated LinearClassifierFst with\n// special optimization in matching.\ntemplate <class A>\nclass LinearClassifierFstImpl : public CacheImpl<A> {\n public:\n  using FstImpl<A>::SetType;\n  using FstImpl<A>::SetProperties;\n  using FstImpl<A>::SetInputSymbols;\n  using FstImpl<A>::SetOutputSymbols;\n  using FstImpl<A>::WriteHeader;\n\n  using CacheBaseImpl<CacheState<A>>::PushArc;\n  using CacheBaseImpl<CacheState<A>>::HasArcs;\n  using CacheBaseImpl<CacheState<A>>::HasFinal;\n  using CacheBaseImpl<CacheState<A>>::HasStart;\n  using CacheBaseImpl<CacheState<A>>::SetArcs;\n  using CacheBaseImpl<CacheState<A>>::SetFinal;\n  using CacheBaseImpl<CacheState<A>>::SetStart;\n\n  typedef A Arc;\n  typedef typename A::Label Label;\n  typedef typename A::Weight Weight;\n  typedef typename A::StateId StateId;\n  typedef typename Collection<StateId, Label>::SetIterator NGramIterator;\n\n  // Constructs an empty FST by default.\n  LinearClassifierFstImpl()\n      : CacheImpl<A>(CacheOptions()),\n        data_(std::make_shared<LinearFstData<A>>()) {\n    SetType(\"linear-classifier\");\n    num_classes_ = 0;\n    num_groups_ = 0;\n  }\n\n  // Constructs the FST with given data storage, number of classes and\n  // symbol tables.\n  LinearClassifierFstImpl(const LinearFstData<Arc> *data, size_t num_classes,\n                          const SymbolTable *isyms, const SymbolTable *osyms,\n                          CacheOptions opts)\n      : CacheImpl<A>(opts),\n        data_(data),\n        num_classes_(num_classes),\n        num_groups_(data_->NumGroups() / num_classes_) {\n    SetType(\"linear-classifier\");\n    SetProperties(kILabelSorted, kFstProperties);\n    SetInputSymbols(isyms);\n    SetOutputSymbols(osyms);\n    ReserveStubSpace();\n  }\n\n  // Copy by sharing the underlying data storage.\n  LinearClassifierFstImpl(const LinearClassifierFstImpl &impl)\n      : CacheImpl<A>(impl),\n        data_(impl.data_),\n        num_classes_(impl.num_classes_),\n        num_groups_(impl.num_groups_) {\n    SetType(\"linear-classifier\");\n    SetProperties(impl.Properties(), kCopyProperties);\n    SetInputSymbols(impl.InputSymbols());\n    SetOutputSymbols(impl.OutputSymbols());\n    ReserveStubSpace();\n  }\n\n  StateId Start() {\n    if (!HasStart()) {\n      StateId start = FindStartState();\n      SetStart(start);\n    }\n    return CacheImpl<A>::Start();\n  }\n\n  Weight Final(StateId s) {\n    if (!HasFinal(s)) {\n      state_stub_.clear();\n      FillState(s, &state_stub_);\n      SetFinal(s, FinalWeight(state_stub_));\n    }\n    return CacheImpl<A>::Final(s);\n  }\n\n  size_t NumArcs(StateId s) {\n    if (!HasArcs(s)) Expand(s);\n    return CacheImpl<A>::NumArcs(s);\n  }\n\n  size_t NumInputEpsilons(StateId s) {\n    if (!HasArcs(s)) Expand(s);\n    return CacheImpl<A>::NumInputEpsilons(s);\n  }\n\n  size_t NumOutputEpsilons(StateId s) {\n    if (!HasArcs(s)) Expand(s);\n    return CacheImpl<A>::NumOutputEpsilons(s);\n  }\n\n  void InitArcIterator(StateId s, ArcIteratorData<A> *data) {\n    if (!HasArcs(s)) Expand(s);\n    CacheImpl<A>::InitArcIterator(s, data);\n  }\n\n  // Computes the outgoing transitions from a state, creating new\n  // destination states as needed.\n  void Expand(StateId s);\n\n  // Appends to `arcs` all out-going arcs from state `s` that matches\n  // `label` as the input label.\n  void MatchInput(StateId s, Label ilabel, std::vector<Arc> *arcs);\n\n  static LinearClassifierFstImpl<A> *Read(std::istream &strm,\n                                          const FstReadOptions &opts);\n\n  bool Write(std::ostream &strm, const FstWriteOptions &opts) const {\n    FstHeader header;\n    header.SetStart(kNoStateId);\n    WriteHeader(strm, opts, kFileVersion, &header);\n    data_->Write(strm);\n    WriteType(strm, num_classes_);\n    if (!strm) {\n      LOG(ERROR) << \"LinearClassifierFst::Write: Write failed: \" << opts.source;\n      return false;\n    }\n    return true;\n  }\n\n private:\n  static const int kMinFileVersion;\n  static const int kFileVersion;\n\n  // A collection of functions to access parts of the state tuple. A\n  // state tuple is a vector of `Label`s with two parts:\n  //   [prediction] [internal].\n  //\n  // - [prediction] is a single label of the predicted class. A state\n  //   must have a positive class label, unless it is the start state.\n  //\n  // - [internal] is the internal state tuple for `LinearFstData` of\n  //   the given class; or kNoTrieNodeId's if in start state.\n  Label &Prediction(std::vector<Label> &state) { return state[0]; }  // NOLINT\n  Label Prediction(const std::vector<Label> &state) const { return state[0]; }\n\n  Label &InternalAt(std::vector<Label> &state, int index) {  // NOLINT\n    return state[index + 1];\n  }\n  Label InternalAt(const std::vector<Label> &state, int index) const {\n    return state[index + 1];\n  }\n\n  // The size of state tuples are fixed, reserve them in stubs\n  void ReserveStubSpace() {\n    size_t size = 1 + num_groups_;\n    state_stub_.reserve(size);\n    next_stub_.reserve(size);\n  }\n\n  // Computes the start state tuple and maps it to the start state id.\n  StateId FindStartState() {\n    // A start state tuple has no prediction\n    state_stub_.clear();\n    state_stub_.push_back(kNoLabel);\n    // For a start state, we don't yet know where we are in the tries.\n    for (size_t i = 0; i < num_groups_; ++i)\n      state_stub_.push_back(kNoTrieNodeId);\n    return FindState(state_stub_);\n  }\n\n  // Tests if the state tuple represents the start state.\n  bool IsStartState(const std::vector<Label> &state) const {\n    return state[0] == kNoLabel;\n  }\n\n  // Computes the actual group id in the data storage.\n  int GroupId(Label pred, int group) const {\n    return group * num_classes_ + pred - 1;\n  }\n\n  // Finds out the final weight of the given state. A state is final\n  // iff it is not the start.\n  Weight FinalWeight(const std::vector<Label> &state) const {\n    if (IsStartState(state)) {\n      return Weight::Zero();\n    }\n    Label pred = Prediction(state);\n    DCHECK_GT(pred, 0);\n    DCHECK_LE(pred, num_classes_);\n    Weight final_weight = Weight::One();\n    for (size_t group = 0; group < num_groups_; ++group) {\n      int group_id = GroupId(pred, group);\n      int trie_state = InternalAt(state, group);\n      final_weight =\n          Times(final_weight, data_->GroupFinalWeight(group_id, trie_state));\n    }\n    return final_weight;\n  }\n\n  // Finds state corresponding to an n-gram. Creates new state if n-gram not\n  // found.\n  StateId FindState(const std::vector<Label> &ngram) {\n    StateId sparse = ngrams_.FindId(ngram, true);\n    StateId dense = condensed_.FindId(sparse, true);\n    return dense;\n  }\n\n  // Appends after `output` the state tuple corresponding to the state id. The\n  // state id must exist.\n  void FillState(StateId s, std::vector<Label> *output) {\n    s = condensed_.FindEntry(s);\n    for (NGramIterator it = ngrams_.FindSet(s); !it.Done(); it.Next()) {\n      Label label = it.Element();\n      output->push_back(label);\n    }\n  }\n\n  std::shared_ptr<const LinearFstData<A>> data_;\n  // Division of groups in `data_`; num_classes_ * num_groups_ ==\n  // data_->NumGroups().\n  size_t num_classes_, num_groups_;\n  // Mapping from internal state tuple to *non-consecutive* ids\n  Collection<StateId, Label> ngrams_;\n  // Mapping from non-consecutive id to actual state id\n  CompactHashBiTable<StateId, StateId, std::hash<StateId>> condensed_;\n  // Two frequently used vectors, reuse to avoid repeated heap\n  // allocation\n  std::vector<Label> state_stub_, next_stub_;\n\n  void operator=(const LinearClassifierFstImpl<A> &) = delete;\n};\n\ntemplate <class A>\nconst int LinearClassifierFstImpl<A>::kMinFileVersion = 0;\n\ntemplate <class A>\nconst int LinearClassifierFstImpl<A>::kFileVersion = 0;\n\ntemplate <class A>\nvoid LinearClassifierFstImpl<A>::Expand(StateId s) {\n  VLOG(3) << \"Expand \" << s;\n  state_stub_.clear();\n  FillState(s, &state_stub_);\n  next_stub_.clear();\n  next_stub_.resize(1 + num_groups_);\n\n  if (IsStartState(state_stub_)) {\n    // Make prediction\n    for (Label pred = 1; pred <= num_classes_; ++pred) {\n      Prediction(next_stub_) = pred;\n      for (int i = 0; i < num_groups_; ++i)\n        InternalAt(next_stub_, i) = data_->GroupStartState(GroupId(pred, i));\n      PushArc(s, A(0, pred, Weight::One(), FindState(next_stub_)));\n    }\n  } else {\n    Label pred = Prediction(state_stub_);\n    DCHECK_GT(pred, 0);\n    DCHECK_LE(pred, num_classes_);\n    for (Label ilabel = data_->MinInputLabel();\n         ilabel <= data_->MaxInputLabel(); ++ilabel) {\n      Prediction(next_stub_) = pred;\n      Weight weight = Weight::One();\n      for (int i = 0; i < num_groups_; ++i)\n        InternalAt(next_stub_, i) =\n            data_->GroupTransition(GroupId(pred, i), InternalAt(state_stub_, i),\n                                   ilabel, pred, &weight);\n      PushArc(s, A(ilabel, 0, weight, FindState(next_stub_)));\n    }\n  }\n\n  SetArcs(s);\n}\n\ntemplate <class A>\nvoid LinearClassifierFstImpl<A>::MatchInput(StateId s, Label ilabel,\n                                            std::vector<Arc> *arcs) {\n  state_stub_.clear();\n  FillState(s, &state_stub_);\n  next_stub_.clear();\n  next_stub_.resize(1 + num_groups_);\n\n  if (IsStartState(state_stub_)) {\n    // Make prediction if `ilabel` is epsilon.\n    if (ilabel == 0) {\n      for (Label pred = 1; pred <= num_classes_; ++pred) {\n        Prediction(next_stub_) = pred;\n        for (int i = 0; i < num_groups_; ++i)\n          InternalAt(next_stub_, i) = data_->GroupStartState(GroupId(pred, i));\n        arcs->push_back(A(0, pred, Weight::One(), FindState(next_stub_)));\n      }\n    }\n  } else if (ilabel != 0) {\n    Label pred = Prediction(state_stub_);\n    Weight weight = Weight::One();\n    Prediction(next_stub_) = pred;\n    for (int i = 0; i < num_groups_; ++i)\n      InternalAt(next_stub_, i) = data_->GroupTransition(\n          GroupId(pred, i), InternalAt(state_stub_, i), ilabel, pred, &weight);\n    arcs->push_back(A(ilabel, 0, weight, FindState(next_stub_)));\n  }\n}\n\ntemplate <class A>\ninline LinearClassifierFstImpl<A> *LinearClassifierFstImpl<A>::Read(\n    std::istream &strm, const FstReadOptions &opts) {\n  std::unique_ptr<LinearClassifierFstImpl<A>> impl(\n      new LinearClassifierFstImpl<A>());\n  FstHeader header;\n  if (!impl->ReadHeader(strm, opts, kMinFileVersion, &header)) {\n    return nullptr;\n  }\n  impl->data_ = std::shared_ptr<LinearFstData<A>>(LinearFstData<A>::Read(strm));\n  if (!impl->data_) {\n    return nullptr;\n  }\n  ReadType(strm, &impl->num_classes_);\n  if (!strm) {\n    return nullptr;\n  }\n  impl->num_groups_ = impl->data_->NumGroups() / impl->num_classes_;\n  if (impl->num_groups_ * impl->num_classes_ != impl->data_->NumGroups()) {\n    FSTERROR() << \"Total number of feature groups is not a multiple of the \"\n                  \"number of classes: num groups = \"\n               << impl->data_->NumGroups()\n               << \", num classes = \" << impl->num_classes_;\n    return nullptr;\n  }\n  impl->ReserveStubSpace();\n  return impl.release();\n}\n\n}  // namespace internal\n\n// This class attaches interface to implementation and handles\n// reference counting, delegating most methods to ImplToFst.\ntemplate <class A>\nclass LinearClassifierFst\n    : public ImplToFst<internal::LinearClassifierFstImpl<A>> {\n public:\n  friend class ArcIterator<LinearClassifierFst<A>>;\n  friend class StateIterator<LinearClassifierFst<A>>;\n  friend class LinearFstMatcherTpl<LinearClassifierFst<A>>;\n\n  typedef A Arc;\n  typedef typename A::Label Label;\n  typedef typename A::Weight Weight;\n  typedef typename A::StateId StateId;\n  typedef DefaultCacheStore<A> Store;\n  typedef typename Store::State State;\n  using Impl = internal::LinearClassifierFstImpl<A>;\n\n  LinearClassifierFst() : ImplToFst<Impl>(std::make_shared<Impl>()) {}\n\n  explicit LinearClassifierFst(LinearFstData<A> *data, size_t num_classes,\n                               const SymbolTable *isyms = nullptr,\n                               const SymbolTable *osyms = nullptr,\n                               CacheOptions opts = CacheOptions())\n      : ImplToFst<Impl>(\n            std::make_shared<Impl>(data, num_classes, isyms, osyms, opts)) {}\n\n  explicit LinearClassifierFst(const Fst<A> &fst)\n      : ImplToFst<Impl>(std::make_shared<Impl>()) {\n    LOG(FATAL) << \"LinearClassifierFst: no constructor from arbitrary FST.\";\n  }\n\n  // See Fst<>::Copy() for doc.\n  LinearClassifierFst(const LinearClassifierFst<A> &fst, bool safe = false)\n      : ImplToFst<Impl>(fst, safe) {}\n\n  // Get a copy of this LinearClassifierFst. See Fst<>::Copy() for further doc.\n  LinearClassifierFst<A> *Copy(bool safe = false) const override {\n    return new LinearClassifierFst<A>(*this, safe);\n  }\n\n  inline void InitStateIterator(StateIteratorData<A> *data) const override;\n\n  void InitArcIterator(StateId s, ArcIteratorData<A> *data) const override {\n    GetMutableImpl()->InitArcIterator(s, data);\n  }\n\n  MatcherBase<A> *InitMatcher(MatchType match_type) const override {\n    return new LinearFstMatcherTpl<LinearClassifierFst<A>>(this, match_type);\n  }\n\n  static LinearClassifierFst<A> *Read(const string &filename) {\n    if (!filename.empty()) {\n      std::ifstream strm(filename,\n                              std::ios_base::in | std::ios_base::binary);\n      if (!strm) {\n        LOG(ERROR) << \"LinearClassifierFst::Read: Can't open file: \"\n                   << filename;\n        return nullptr;\n      }\n      return Read(strm, FstReadOptions(filename));\n    } else {\n      return Read(std::cin, FstReadOptions(\"standard input\"));\n    }\n  }\n\n  static LinearClassifierFst<A> *Read(std::istream &in,\n                                      const FstReadOptions &opts) {\n    auto *impl = Impl::Read(in, opts);\n    return impl ? new LinearClassifierFst<A>(std::shared_ptr<Impl>(impl))\n                : nullptr;\n  }\n\n  bool Write(const string &filename) const override {\n    if (!filename.empty()) {\n      std::ofstream strm(filename,\n                               std::ios_base::out | std::ios_base::binary);\n      if (!strm) {\n        LOG(ERROR) << \"ProdLmFst::Write: Can't open file: \" << filename;\n        return false;\n      }\n      return Write(strm, FstWriteOptions(filename));\n    } else {\n      return Write(std::cout, FstWriteOptions(\"standard output\"));\n    }\n  }\n\n  bool Write(std::ostream &strm, const FstWriteOptions &opts) const override {\n    return GetImpl()->Write(strm, opts);\n  }\n\n private:\n  using ImplToFst<Impl>::GetImpl;\n  using ImplToFst<Impl>::GetMutableImpl;\n\n  explicit LinearClassifierFst(std::shared_ptr<Impl> impl)\n      : ImplToFst<Impl>(impl) {}\n\n  void operator=(const LinearClassifierFst<A> &fst) = delete;\n};\n\n// Specialization for LinearClassifierFst.\ntemplate <class Arc>\nclass StateIterator<LinearClassifierFst<Arc>>\n    : public CacheStateIterator<LinearClassifierFst<Arc>> {\n public:\n  explicit StateIterator(const LinearClassifierFst<Arc> &fst)\n      : CacheStateIterator<LinearClassifierFst<Arc>>(fst,\n                                                     fst.GetMutableImpl()) {}\n};\n\n// Specialization for LinearClassifierFst.\ntemplate <class Arc>\nclass ArcIterator<LinearClassifierFst<Arc>>\n    : public CacheArcIterator<LinearClassifierFst<Arc>> {\n public:\n  using StateId = typename Arc::StateId;\n\n  ArcIterator(const LinearClassifierFst<Arc> &fst, StateId s)\n      : CacheArcIterator<LinearClassifierFst<Arc>>(fst.GetMutableImpl(), s) {\n    if (!fst.GetImpl()->HasArcs(s)) fst.GetMutableImpl()->Expand(s);\n  }\n};\n\ntemplate <class Arc>\ninline void LinearClassifierFst<Arc>::InitStateIterator(\n    StateIteratorData<Arc> *data) const {\n  data->base = new StateIterator<LinearClassifierFst<Arc>>(*this);\n}\n\n// Specialized Matcher for LinearFsts. This matcher only supports\n// matching from the input side. This is intentional because comparing\n// the scores of different input sequences with the same output\n// sequence is meaningless in a discriminative model.\ntemplate <class F>\nclass LinearFstMatcherTpl : public MatcherBase<typename F::Arc> {\n public:\n  typedef typename F::Arc Arc;\n  typedef typename Arc::Label Label;\n  typedef typename Arc::Weight Weight;\n  typedef typename Arc::StateId StateId;\n  typedef F FST;\n\n  // This makes a copy of the FST.\n  LinearFstMatcherTpl(const FST &fst, MatchType match_type)\n      : owned_fst_(fst.Copy()),\n        fst_(*owned_fst_),\n        match_type_(match_type),\n        s_(kNoStateId),\n        current_loop_(false),\n        loop_(kNoLabel, 0, Weight::One(), kNoStateId),\n        cur_arc_(0),\n        error_(false) {\n    switch (match_type_) {\n      case MATCH_INPUT:\n      case MATCH_OUTPUT:\n      case MATCH_NONE:\n        break;\n      default:\n        FSTERROR() << \"LinearFstMatcherTpl: Bad match type\";\n        match_type_ = MATCH_NONE;\n        error_ = true;\n    }\n  }\n\n  // This doesn't copy the FST.\n  LinearFstMatcherTpl(const FST *fst, MatchType match_type)\n      : fst_(*fst),\n        match_type_(match_type),\n        s_(kNoStateId),\n        current_loop_(false),\n        loop_(kNoLabel, 0, Weight::One(), kNoStateId),\n        cur_arc_(0),\n        error_(false) {\n    switch (match_type_) {\n      case MATCH_INPUT:\n      case MATCH_OUTPUT:\n      case MATCH_NONE:\n        break;\n      default:\n        FSTERROR() << \"LinearFstMatcherTpl: Bad match type\";\n        match_type_ = MATCH_NONE;\n        error_ = true;\n    }\n  }\n\n  // This makes a copy of the FST.\n  LinearFstMatcherTpl(const LinearFstMatcherTpl<F> &matcher, bool safe = false)\n      : owned_fst_(matcher.fst_.Copy(safe)),\n        fst_(*owned_fst_),\n        match_type_(matcher.match_type_),\n        s_(kNoStateId),\n        current_loop_(false),\n        loop_(matcher.loop_),\n        cur_arc_(0),\n        error_(matcher.error_) {}\n\n  LinearFstMatcherTpl<F> *Copy(bool safe = false) const override {\n    return new LinearFstMatcherTpl<F>(*this, safe);\n  }\n\n  MatchType Type(bool /*test*/) const override {\n    // `MATCH_INPUT` is the only valid type\n    return match_type_ == MATCH_INPUT ? match_type_ : MATCH_NONE;\n  }\n\n  void SetState(StateId s) final {\n    if (s_ == s) return;\n    s_ = s;\n    // `MATCH_INPUT` is the only valid type\n    if (match_type_ != MATCH_INPUT) {\n      FSTERROR() << \"LinearFstMatcherTpl: Bad match type\";\n      error_ = true;\n    }\n    loop_.nextstate = s;\n  }\n\n  bool Find(Label label) final {\n    if (error_) {\n      current_loop_ = false;\n      return false;\n    }\n    current_loop_ = label == 0;\n    if (label == kNoLabel) label = 0;\n    arcs_.clear();\n    cur_arc_ = 0;\n    fst_.GetMutableImpl()->MatchInput(s_, label, &arcs_);\n    return current_loop_ || !arcs_.empty();\n  }\n\n  bool Done() const final {\n    return !(current_loop_ || cur_arc_ < arcs_.size());\n  }\n\n  const Arc &Value() const final {\n    return current_loop_ ? loop_ : arcs_[cur_arc_];\n  }\n\n  void Next() final {\n    if (current_loop_)\n      current_loop_ = false;\n    else\n      ++cur_arc_;\n  }\n\n  std::ptrdiff_t Priority(StateId s) final { return kRequirePriority; }\n\n  const FST &GetFst() const override { return fst_; }\n\n  uint64 Properties(uint64 props) const override {\n    if (error_) props |= kError;\n    return props;\n  }\n\n  uint32 Flags() const override { return kRequireMatch; }\n\n private:\n  std::unique_ptr<const FST> owned_fst_;\n  const FST &fst_;\n  MatchType match_type_;  // Type of match to perform.\n  StateId s_;             // Current state.\n  bool current_loop_;     // Current arc is the implicit loop.\n  Arc loop_;              // For non-consuming symbols.\n  // All out-going arcs matching the label in last Find() call.\n  std::vector<Arc> arcs_;\n  size_t cur_arc_;  // Index to the arc that `Value()` should return.\n  bool error_;      // Error encountered.\n};\n\n}  // namespace fst\n\n#endif  // FST_EXTENSIONS_LINEAR_LINEAR_FST_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/lock.h",
    "content": "// Licensed under the Apache License, Version 2.0 (the \"License\");\n// you may not use this file except in compliance with the License.\n// You may obtain a copy of the License at\n//\n//      http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n// See the License for the specific language governing permissions and\n// limitations under the License.\n//\n// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Google-compatibility locking declarations and inline definitions.\n\n#ifndef FST_LIB_LOCK_H_\n#define FST_LIB_LOCK_H_\n\n#include <mutex>\n\nnamespace fst {\n\nusing namespace std;\n\nclass Mutex {\n public:\n  Mutex() {}\n\n  inline void Lock() { mu_.lock(); }\n\n  inline void Unlock() { mu_.unlock(); }\n\n private:\n  std::mutex mu_;\n\n  Mutex(const Mutex &) = delete;\n  Mutex &operator=(const Mutex &) = delete;\n};\n\nclass MutexLock {\n public:\n  explicit MutexLock(Mutex *mu) : mu_(mu) { mu_->Lock(); }\n\n  ~MutexLock() { mu_->Unlock(); }\n\n private:\n  Mutex *mu_;\n\n  MutexLock(const MutexLock &) = delete;\n  MutexLock &operator=(const MutexLock &) = delete;\n};\n\n// Currently, we don't use a separate reader lock.\n// TODO(kbg): Implement this with std::shared_mutex once C++17 becomes widely\n// available.\nusing ReaderMutexLock = MutexLock;\n\n}  // namespace fst\n\n#endif  // FST_LIB_LOCK_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/log.h",
    "content": "// Licensed under the Apache License, Version 2.0 (the \"License\");\n// you may not use this file except in compliance with the License.\n// You may obtain a copy of the License at\n//\n//      http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n// See the License for the specific language governing permissions and\n// limitations under the License.\n//\n// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Google-style logging declarations and inline definitions.\n\n#ifndef FST_LIB_LOG_H_\n#define FST_LIB_LOG_H_\n\n#include <cassert>\n#include <iostream>\n#include <string>\n\n#include <fst/types.h>\n#include <fst/flags.h>\n\nusing std::string;\n\nDECLARE_int32_t(v);\n\nclass LogMessage {\n public:\n  LogMessage(const string &type) : fatal_(type == \"FATAL\") {\n    std::cerr << type << \": \";\n  }\n  ~LogMessage() {\n    std::cerr << std::endl;\n    if(fatal_)\n      exit(1);\n  }\n  std::ostream &stream() { return std::cerr; }\n\n private:\n  bool fatal_;\n};\n\n#define LOG(type) LogMessage(#type).stream()\n#define VLOG(level) if ((level) <= FLAGS_v) LOG(INFO)\n\n// Checks\ninline void FstCheck(bool x, const char* expr,\n                const char *file, int line) {\n  if (!x) {\n    LOG(FATAL) << \"Check failed: \\\"\" << expr\n               << \"\\\" file: \" << file\n               << \" line: \" << line;\n  }\n}\n\n#define CHECK(x) FstCheck(static_cast<bool>(x), #x, __FILE__, __LINE__)\n#define CHECK_EQ(x, y) CHECK((x) == (y))\n#define CHECK_LT(x, y) CHECK((x) < (y))\n#define CHECK_GT(x, y) CHECK((x) > (y))\n#define CHECK_LE(x, y) CHECK((x) <= (y))\n#define CHECK_GE(x, y) CHECK((x) >= (y))\n#define CHECK_NE(x, y) CHECK((x) != (y))\n\n// Debug checks\n#define DCHECK(x) assert(x)\n#define DCHECK_EQ(x, y) DCHECK((x) == (y))\n#define DCHECK_LT(x, y) DCHECK((x) < (y))\n#define DCHECK_GT(x, y) DCHECK((x) > (y))\n#define DCHECK_LE(x, y) DCHECK((x) <= (y))\n#define DCHECK_GE(x, y) DCHECK((x) >= (y))\n#define DCHECK_NE(x, y) DCHECK((x) != (y))\n\n\n// Ports\n#define ATTRIBUTE_DEPRECATED __attribute__((deprecated))\n\n#endif  // FST_LIB_LOG_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/lookahead-filter.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Composition filters to support lookahead matchers, useful for improving\n// composition efficiency with certain inputs.\n\n#ifndef FST_LOOKAHEAD_FILTER_H_\n#define FST_LOOKAHEAD_FILTER_H_\n\n#include <vector>\n\n#include <fst/log.h>\n\n#include <fst/filter-state.h>\n#include <fst/fst.h>\n#include <fst/lookahead-matcher.h>\n\n\nnamespace fst {\n\n// Identifies and verifies the capabilities of the matcher to be used for\n// lookahead with the composition filters below. This version is passed two\n// matchers.\ntemplate <class Matcher1, class Matcher2>\nMatchType LookAheadMatchType(const Matcher1 &m1, const Matcher2 &m2) {\n  const auto type1 = m1.Type(false);\n  const auto type2 = m2.Type(false);\n  if (type1 == MATCH_OUTPUT && m1.Flags() & kOutputLookAheadMatcher) {\n    return MATCH_OUTPUT;\n  } else if (type2 == MATCH_INPUT && m2.Flags() & kInputLookAheadMatcher) {\n    return MATCH_INPUT;\n  } else if (m1.Flags() & kOutputLookAheadMatcher &&\n             m1.Type(true) == MATCH_OUTPUT) {\n    return MATCH_OUTPUT;\n  } else if (m2.Flags() & kInputLookAheadMatcher &&\n             m2.Type(true) == MATCH_INPUT) {\n    return MATCH_INPUT;\n  } else {\n    return MATCH_NONE;\n  }\n}\n\n// Identifies and verifies the capabilities of the matcher to be used for\n// lookahead with the composition filters below. This version uses the FST's\n// default matchers.\ntemplate <class Arc>\nMatchType LookAheadMatchType(const Fst<Arc> &fst1, const Fst<Arc> &fst2) {\n  LookAheadMatcher<Fst<Arc>> matcher1(fst1, MATCH_OUTPUT);\n  LookAheadMatcher<Fst<Arc>> matcher2(fst2, MATCH_INPUT);\n  return LookAheadMatchType(matcher1, matcher2);\n}\n\n// LookAheadSelector is a helper class for selecting among possibly distinct\n// FST and matcher types without using a common base class. This lets us avoid\n// virtual function calls. It stores and returns the appropriate FSTs and\n// matcher for lookahead. It is templated on the matcher types. General case\n// has no methods.\ntemplate <class Matcher1, class Matcher2, MatchType MT>\nclass LookAheadSelector {};\n\n// Stores and returns the appropriate FST and matcher for lookahead. Specialized\n// for two matchers of same type with the (match) type argument determining\n// which is used for lookahead.\ntemplate <class Matcher, MatchType MT>\nclass LookAheadSelector<Matcher, Matcher, MT> {\n public:\n  using FST = typename Matcher::FST;\n\n  LookAheadSelector(Matcher *lmatcher1, Matcher *lmatcher2, MatchType type)\n      : lmatcher1_(lmatcher1->Copy()),\n        lmatcher2_(lmatcher2->Copy()),\n        type_(type) {}\n\n  LookAheadSelector(const LookAheadSelector<Matcher, Matcher, MT> &selector)\n      : lmatcher1_(selector.lmatcher1_->Copy()),\n        lmatcher2_(selector.lmatcher2_->Copy()),\n        type_(selector.type_) {}\n\n  const FST &GetFst() const {\n    return type_ == MATCH_OUTPUT ? lmatcher2_->GetFst() : lmatcher1_->GetFst();\n  }\n\n  Matcher *GetMatcher() const {\n    return type_ == MATCH_OUTPUT ? lmatcher1_.get() : lmatcher2_.get();\n  }\n\n private:\n  std::unique_ptr<Matcher> lmatcher1_;\n  std::unique_ptr<Matcher> lmatcher2_;\n  MatchType type_;\n};\n\n// Stores and returns the appropriate FST and matcher for lookahead.\n// Specialized for lookahead on input labels.\ntemplate <class Matcher1, class Matcher2>\nclass LookAheadSelector<Matcher1, Matcher2, MATCH_INPUT> {\n public:\n  using FST1 = typename Matcher1::FST;\n\n  LookAheadSelector(Matcher1 *lmatcher1, Matcher2 *lmatcher2, MatchType)\n      : fst_(lmatcher1->GetFst().Copy()), lmatcher_(lmatcher2->Copy()) {}\n\n  LookAheadSelector(\n      const LookAheadSelector<Matcher1, Matcher2, MATCH_INPUT> &selector)\n      : fst_(selector.fst_->Copy()), lmatcher_(selector.lmatcher_->Copy()) {}\n\n  const FST1 &GetFst() const { return *fst_; }\n\n  Matcher2 *GetMatcher() const { return lmatcher_.get(); }\n\n private:\n  std::unique_ptr<const FST1> fst_;\n  std::unique_ptr<Matcher2> lmatcher_;\n};\n\n// Stores and returns the appropriate FST and matcher for lookahead.\n// Specialized for lookahead on output labels.\ntemplate <class Matcher1, class Matcher2>\nclass LookAheadSelector<Matcher1, Matcher2, MATCH_OUTPUT> {\n public:\n  using FST2 = typename Matcher2::FST;\n\n  LookAheadSelector(Matcher1 *lmatcher1, Matcher2 *lmatcher2, MatchType)\n      : fst_(lmatcher2->GetFst().Copy()), lmatcher_(lmatcher1->Copy()) {}\n\n  LookAheadSelector(\n      const LookAheadSelector<Matcher1, Matcher2, MATCH_OUTPUT> &selector)\n      : fst_(selector.fst_->Copy()), lmatcher_(selector.lmatcher_->Copy()) {}\n\n  const FST2 &GetFst() const { return *fst_; }\n\n  Matcher1 *GetMatcher() const { return lmatcher_.get(); }\n\n private:\n  std::unique_ptr<const FST2> fst_;\n  std::unique_ptr<Matcher1> lmatcher_;\n};\n\n// This filter uses a lookahead matcher in FilterArc(arc1, arc2) to examine the\n// future of the composition state (arc1.nextstate, arc2.nextstate), blocking\n// moving forward when its determined to be\n// non-coaccessible. It is templated on an underlying filter, typically the\n// epsilon filter. Which matcher is the lookahead matcher is determined by the\n// template argument MT unless it is MATCH_BOTH. In that case, both matcher\n// arguments must be lookahead matchers of the same type and one will be\n// selected by LookAheadMatchType() based on their capability.\ntemplate <class Filter, class M1 = LookAheadMatcher<typename Filter::FST1>,\n          class M2 = M1, MatchType MT = MATCH_BOTH>\nclass LookAheadComposeFilter {\n public:\n  using Arc = typename Filter::Arc;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using FST1 = typename Filter::FST1;\n  using FST2 = typename Filter::FST2;\n  using Matcher1 = typename Filter::Matcher1;\n  using Matcher2 = typename Filter::Matcher2;\n  using FilterState = typename Filter::FilterState;\n\n  LookAheadComposeFilter(const FST1 &fst1, const FST2 &fst2, M1 *matcher1,\n                         M2 *matcher2)\n      : filter_(fst1, fst2, matcher1, matcher2),\n        lookahead_type_(MT == MATCH_BOTH\n                            ? LookAheadMatchType(*filter_.GetMatcher1(),\n                                                 *filter_.GetMatcher2())\n                            : MT),\n        selector_(filter_.GetMatcher1(), filter_.GetMatcher2(),\n                  lookahead_type_),\n        flags_(lookahead_type_ == MATCH_OUTPUT\n                   ? filter_.GetMatcher1()->Flags()\n                   : filter_.GetMatcher2()->Flags()) {\n    if (lookahead_type_ == MATCH_NONE) {\n      FSTERROR() << \"LookAheadComposeFilter: 1st argument cannot \"\n                 << \"match/look-ahead on output labels and 2nd argument \"\n                 << \"cannot match/look-ahead on input labels\";\n    }\n    selector_.GetMatcher()->InitLookAheadFst(selector_.GetFst());\n  }\n\n  LookAheadComposeFilter(\n      const LookAheadComposeFilter<Filter, M1, M2, MT> &filter,\n      bool safe = false)\n      : filter_(filter.filter_, safe),\n        lookahead_type_(filter.lookahead_type_),\n        selector_(filter_.GetMatcher1(), filter_.GetMatcher2(),\n                  lookahead_type_),\n        flags_(filter.flags_) {\n    selector_.GetMatcher()->InitLookAheadFst(selector_.GetFst(), true);\n  }\n\n  FilterState Start() const { return filter_.Start(); }\n\n  void SetState(StateId s1, StateId s2, const FilterState &fs) {\n    filter_.SetState(s1, s2, fs);\n  }\n\n  FilterState FilterArc(Arc *arc1, Arc *arc2) const {\n    lookahead_arc_ = false;\n    const FilterState &fs = filter_.FilterArc(arc1, arc2);\n    if (fs == FilterState::NoState()) return FilterState::NoState();\n    return LookAheadOutput() ? LookAheadFilterArc(arc1, arc2, fs)\n                             : LookAheadFilterArc(arc2, arc1, fs);\n  }\n\n  void FilterFinal(Weight *weight1, Weight *weight2) const {\n    filter_.FilterFinal(weight1, weight2);\n  }\n\n  // Returns matchers; ownership stays with filter.\n\n  Matcher1 *GetMatcher1() { return filter_.GetMatcher1(); }\n\n  Matcher2 *GetMatcher2() { return filter_.GetMatcher2(); }\n\n  const LookAheadSelector<Matcher1, Matcher2, MT> &Selector() const {\n    return selector_;\n  }\n\n  uint64_t Properties(uint64_t inprops) const {\n    auto outprops = filter_.Properties(inprops);\n    if (lookahead_type_ == MATCH_NONE) outprops |= kError;\n    return outprops;\n  }\n\n  uint32_t LookAheadFlags() const { return flags_; }\n\n  bool LookAheadArc() const { return lookahead_arc_; }\n\n  bool LookAheadOutput() const {\n    if (MT == MATCH_OUTPUT) {\n      return true;\n    } else if (MT == MATCH_INPUT) {\n      return false;\n    } else if (lookahead_type_ == MATCH_OUTPUT) {\n      return true;\n    } else {\n      return false;\n    }\n  }\n\n private:\n  FilterState LookAheadFilterArc(Arc *arca, Arc *arcb,\n                                 const FilterState &fs) const {\n    auto &labela = LookAheadOutput() ? arca->olabel : arca->ilabel;\n    if (labela != 0 && !(flags_ & kLookAheadNonEpsilons)) return fs;\n    if (labela == 0 && !(flags_ & kLookAheadEpsilons)) return fs;\n    lookahead_arc_ = true;\n    selector_.GetMatcher()->SetState(arca->nextstate);\n    return selector_.GetMatcher()->LookAheadFst(selector_.GetFst(),\n                                                arcb->nextstate)\n               ? fs\n               : FilterState::NoState();\n  }\n\n  Filter filter_;             // Underlying filter.\n  MatchType lookahead_type_;  // Lookahead match type.\n  LookAheadSelector<Matcher1, Matcher2, MT> selector_;\n  uint32_t flags_;                // Lookahead flags.\n  mutable bool lookahead_arc_;  // Look-ahead performed at last FilterArc()?\n\n  LookAheadComposeFilter &operator=(const LookAheadComposeFilter &) = delete;\n};\n\n// This filter adds weight-pushing to a lookahead composition filter using the\n// LookAheadWeight() method of matcher argument. It is templated on an\n// underlying lookahead filter, typically the basic lookahead filter.\n// Weight-pushing in composition brings weights forward as much as possible\n// based on the lookahead information.\ntemplate <class Filter, class M1 = LookAheadMatcher<typename Filter::FST1>,\n          class M2 = M1, MatchType MT = MATCH_BOTH>\nclass PushWeightsComposeFilter {\n public:\n  using Arc = typename Filter::Arc;\n  using StateId = typename Filter::StateId;\n  using Weight = typename Filter::Weight;\n\n  using FST1 = typename Filter::FST1;\n  using FST2 = typename Filter::FST2;\n  using Matcher1 = typename Filter::Matcher1;\n  using Matcher2 = typename Filter::Matcher2;\n\n  using FilterState1 = typename Filter::FilterState;\n  using FilterState2 = WeightFilterState<Weight>;\n  using FilterState = PairFilterState<FilterState1, FilterState2>;\n\n  PushWeightsComposeFilter(const FST1 &fst1, const FST2 &fst2, M1 *matcher1,\n                           M2 *matcher2)\n      : filter_(fst1, fst2, matcher1, matcher2), fs_(FilterState::NoState()) {}\n\n  PushWeightsComposeFilter(\n      const PushWeightsComposeFilter<Filter, M1, M2, MT> &filter,\n      bool safe = false)\n      : filter_(filter.filter_, safe), fs_(FilterState::NoState()) {}\n\n  FilterState Start() const {\n    return FilterState(filter_.Start(), FilterState2(Weight::One()));\n  }\n\n  void SetState(StateId s1, StateId s2, const FilterState &fs) {\n    fs_ = fs;\n    filter_.SetState(s1, s2, fs.GetState1());\n  }\n\n  FilterState FilterArc(Arc *arc1, Arc *arc2) const {\n    const auto &fs1 = filter_.FilterArc(arc1, arc2);\n    if (fs1 == FilterState1::NoState()) return FilterState::NoState();\n    if (!(LookAheadFlags() & kLookAheadWeight)) {\n      return FilterState(fs1, FilterState2(Weight::One()));\n    }\n    const auto &lweight = filter_.LookAheadArc()\n                              ? Selector().GetMatcher()->LookAheadWeight()\n                              : Weight::One();\n    const auto &fs2 = fs_.GetState2();\n    const auto &fweight = fs2.GetWeight();\n    // Disallows Zero() weight futures.\n    if (lweight == Weight::Zero()) return FilterState::NoState();\n    arc2->weight = Divide(Times(arc2->weight, lweight), fweight);\n    return FilterState(fs1, FilterState2(lweight.Quantize()));\n  }\n\n  void FilterFinal(Weight *weight1, Weight *weight2) const {\n    filter_.FilterFinal(weight1, weight2);\n    if (!(LookAheadFlags() & kLookAheadWeight) || *weight1 == Weight::Zero()) {\n      return;\n    }\n    const auto &fs2 = fs_.GetState2();\n    const auto &fweight = fs2.GetWeight();\n    *weight1 = Divide(*weight1, fweight);\n  }\n\n  // Returns matchers; ownership states with filter.\n\n  Matcher1 *GetMatcher1() { return filter_.GetMatcher1(); }\n\n  Matcher2 *GetMatcher2() { return filter_.GetMatcher2(); }\n\n  const LookAheadSelector<Matcher1, Matcher2, MT> &Selector() const {\n    return filter_.Selector();\n  }\n\n  uint32_t LookAheadFlags() const { return filter_.LookAheadFlags(); }\n\n  bool LookAheadArc() const { return filter_.LookAheadArc(); }\n\n  bool LookAheadOutput() const { return filter_.LookAheadOutput(); }\n\n  uint64_t Properties(uint64_t props) const {\n    return filter_.Properties(props) & kWeightInvariantProperties;\n  }\n\n private:\n  Filter filter_;   // Underlying filter.\n  FilterState fs_;  // Current filter state.\n\n  PushWeightsComposeFilter &operator=(const PushWeightsComposeFilter &) =\n      delete;\n};\n\n// This filter adds label-pushing to a lookahead composition filter using the\n// LookAheadPrefix() method of the matcher argument. It is templated on an\n// underlying filter, typically the basic lookahead or weight-pushing lookahead\n// filter. Label-pushing in composition matches labels as early as possible\n// based on the lookahead information.\ntemplate <class Filter, class M1 = LookAheadMatcher<typename Filter::FST1>,\n          class M2 = M1, MatchType MT = MATCH_BOTH>\nclass PushLabelsComposeFilter {\n public:\n  using Arc = typename Filter::Arc;\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using FST1 = typename Filter::FST1;\n  using FST2 = typename Filter::FST2;\n  using Matcher1 = MultiEpsMatcher<typename Filter::Matcher1>;\n  using Matcher2 = MultiEpsMatcher<typename Filter::Matcher2>;\n  using FilterState1 = typename Filter::FilterState;\n  using FilterState2 = IntegerFilterState<Label>;\n  using FilterState = PairFilterState<FilterState1, FilterState2>;\n\n  PushLabelsComposeFilter(const FST1 &fst1, const FST2 &fst2, M1 *matcher1,\n                          M2 *matcher2)\n      : filter_(fst1, fst2, matcher1, matcher2),\n        fs_(FilterState::NoState()),\n        fst1_(filter_.GetMatcher1()->GetFst()),\n        fst2_(filter_.GetMatcher2()->GetFst()),\n        matcher1_(fst1_, MATCH_OUTPUT,\n                  filter_.LookAheadOutput() ? kMultiEpsList : kMultiEpsLoop,\n                  filter_.GetMatcher1(), false),\n        matcher2_(fst2_, MATCH_INPUT,\n                  filter_.LookAheadOutput() ? kMultiEpsLoop : kMultiEpsList,\n                  filter_.GetMatcher2(), false) {}\n\n  PushLabelsComposeFilter(\n      const PushLabelsComposeFilter<Filter, M1, M2, MT> &filter,\n      bool safe = false)\n      : filter_(filter.filter_, safe),\n        fs_(FilterState::NoState()),\n        fst1_(filter_.GetMatcher1()->GetFst()),\n        fst2_(filter_.GetMatcher2()->GetFst()),\n        matcher1_(fst1_, MATCH_OUTPUT,\n                  filter_.LookAheadOutput() ? kMultiEpsList : kMultiEpsLoop,\n                  filter_.GetMatcher1(), false),\n        matcher2_(fst2_, MATCH_INPUT,\n                  filter_.LookAheadOutput() ? kMultiEpsLoop : kMultiEpsList,\n                  filter_.GetMatcher2(), false) {}\n\n  FilterState Start() const {\n    return FilterState(filter_.Start(), FilterState2(kNoLabel));\n  }\n\n  void SetState(StateId s1, StateId s2, const FilterState &fs) {\n    fs_ = fs;\n    filter_.SetState(s1, s2, fs.GetState1());\n    if (!(LookAheadFlags() & kLookAheadPrefix)) return;\n    narcsa_ = LookAheadOutput() ? internal::NumArcs(fst1_, s1)\n                                : internal::NumArcs(fst2_, s2);\n    const auto &fs2 = fs_.GetState2();\n    const auto &flabel = fs2.GetState();\n    GetMatcher1()->ClearMultiEpsLabels();\n    GetMatcher2()->ClearMultiEpsLabels();\n    if (flabel != kNoLabel) {                   // Have a lookahead label?\n      GetMatcher1()->AddMultiEpsLabel(flabel);  // Yes, make it a multi-epsilon\n      GetMatcher2()->AddMultiEpsLabel(flabel);  // label so that it matches the\n    }                                           // implicit epsilon arc to be\n  }                                             // modified below when pushing.\n\n  FilterState FilterArc(Arc *arc1, Arc *arc2) const {\n    if (!(LookAheadFlags() & kLookAheadPrefix)) {\n      return FilterState(filter_.FilterArc(arc1, arc2), FilterState2(kNoLabel));\n    }\n    const auto &fs2 = fs_.GetState2();\n    const auto &flabel = fs2.GetState();\n    if (flabel != kNoLabel) {  // Have a lookahead label?\n      return LookAheadOutput() ? PushedLabelFilterArc(arc1, arc2, flabel)\n                               : PushedLabelFilterArc(arc2, arc1, flabel);\n    }\n    const auto &fs1 = filter_.FilterArc(arc1, arc2);\n    if (fs1 == FilterState1::NoState()) return FilterState::NoState();\n    if (!filter_.LookAheadArc())\n      return FilterState(fs1, FilterState2(kNoLabel));\n    return LookAheadOutput() ? PushLabelFilterArc(arc1, arc2, fs1)\n                             : PushLabelFilterArc(arc2, arc1, fs1);\n  }\n\n  void FilterFinal(Weight *weight1, Weight *weight2) const {\n    filter_.FilterFinal(weight1, weight2);\n    if (!(LookAheadFlags() & kLookAheadPrefix) || *weight1 == Weight::Zero()) {\n      return;\n    }\n    const auto &fs2 = fs_.GetState2();\n    const auto &flabel = fs2.GetState();\n    if (flabel != kNoLabel) *weight1 = Weight::Zero();\n  }\n\n  // Returns matchers; ownership states with filter.\n\n  Matcher1 *GetMatcher1() { return &matcher1_; }\n\n  Matcher2 *GetMatcher2() { return &matcher2_; }\n\n  uint64_t Properties(uint64_t iprops) const {\n    const auto oprops = filter_.Properties(iprops);\n    if (LookAheadOutput()) {\n      return oprops & kOLabelInvariantProperties;\n    } else {\n      return oprops & kILabelInvariantProperties;\n    }\n  }\n\n private:\n  const LookAheadSelector<typename Filter::Matcher1, typename Filter::Matcher2,\n                          MT>\n      &Selector() const {\n    return filter_.Selector();\n  }\n\n  // Consumes an already pushed label.\n  FilterState PushedLabelFilterArc(Arc *arca, Arc *arcb, Label flabel) const {\n    auto &labela = LookAheadOutput() ? arca->olabel : arca->ilabel;\n    const auto &labelb = LookAheadOutput() ? arcb->ilabel : arcb->olabel;\n    if (labelb != kNoLabel) {\n      return FilterState::NoState();  // Blocks non-(multi-)epsilon label\n    } else if (labela == flabel) {\n      labela = 0;  // Converts match to multi-epsilon to epsilon.\n      return Start();\n    } else if (labela == 0) {\n      if (narcsa_ == 1) return fs_;  // Takes epsilon, keeping state with label.\n      Selector().GetMatcher()->SetState(arca->nextstate);\n      if (Selector().GetMatcher()->LookAheadLabel(flabel)) {\n        return fs_;  // Takes epsilon, keeping state with label.\n      } else {\n        return FilterState::NoState();  // Blocks non-coaccessible path.\n      }\n    } else {\n      return FilterState::NoState();  // Blocks mismatch to multi-epsilon label.\n    }\n  }\n\n  // Pushes a label forward when possible.\n  FilterState PushLabelFilterArc(Arc *arca, Arc *arcb,\n                                 const FilterState1 &fs1) const {\n    auto &labela = LookAheadOutput() ? arca->olabel : arca->ilabel;\n    const auto &labelb = LookAheadOutput() ? arcb->olabel : arcb->ilabel;\n    if (labelb != 0) {  // No place to push.\n      return FilterState(fs1, FilterState2(kNoLabel));\n    }\n    if (labela != 0 &&  // Wrong lookahead prefix type?\n        LookAheadFlags() & kLookAheadNonEpsilonPrefix) {\n      return FilterState(fs1, FilterState2(kNoLabel));\n    }\n    Arc larc(kNoLabel, kNoLabel, Weight::Zero(), kNoStateId);\n    if (Selector().GetMatcher()->LookAheadPrefix(&larc)) {  // Have prefix arc?\n      labela = LookAheadOutput() ? larc.ilabel : larc.olabel;\n      arcb->ilabel = larc.ilabel;  // Goes forward on that arc,\n      arcb->olabel = larc.olabel;  // thus pushing the label.\n      arcb->weight = Times(arcb->weight, larc.weight);\n      arcb->nextstate = larc.nextstate;\n      return FilterState(fs1, FilterState2(labela));\n    } else {\n      return FilterState(fs1, FilterState2(kNoLabel));\n    }\n  }\n\n  uint32_t LookAheadFlags() const { return filter_.LookAheadFlags(); }\n\n  bool LookAheadArc() const { return filter_.LookAheadArc(); }\n\n  bool LookAheadOutput() const { return filter_.LookAheadOutput(); }\n\n  Filter filter_;   // Underlying filter.\n  FilterState fs_;  // Current filter state.\n  const FST1 &fst1_;\n  const FST2 &fst2_;\n  Matcher1 matcher1_;  // Multi-epsilon matcher for fst1_.\n  Matcher2 matcher2_;  // Multi-epsilon matcher for fst2_.\n  std::ptrdiff_t narcsa_;     // Number of arcs leaving look-ahead match FST.\n\n  PushLabelsComposeFilter &operator=(const PushLabelsComposeFilter &) = delete;\n};\n\n// Convenience class for setting up composition with a default lookahead matcher\n// and filter.\ntemplate <class Arc, MatchType type>\nclass DefaultLookAhead {\n public:\n  using M = Matcher<Fst<Arc>>;\n  using ComposeFilter = SequenceComposeFilter<M>;\n  using FstMatcher = M;\n};\n\n// Specializes for MATCH_INPUT to allow lookahead.\ntemplate <class Arc>\nclass DefaultLookAhead<Arc, MATCH_INPUT> {\n public:\n  using M = LookAheadMatcher<Fst<Arc>>;\n  using SF = SequenceComposeFilter<M>;\n  using ComposeFilter = LookAheadComposeFilter<SF, M>;\n  using FstMatcher = M;\n};\n\n// Specializes for MATCH_OUTPUT to allow lookahead.\ntemplate <class Arc>\nclass DefaultLookAhead<Arc, MATCH_OUTPUT> {\n public:\n  using M = LookAheadMatcher<Fst<Arc>>;\n  using SF = AltSequenceComposeFilter<M>;\n  using ComposeFilter = LookAheadComposeFilter<SF, M>;\n  using FstMatcher = M;\n};\n\n// Specializes for StdArc to allow weight and label pushing.\ntemplate <>\nclass DefaultLookAhead<StdArc, MATCH_INPUT> {\n public:\n  using M = LookAheadMatcher<Fst<StdArc>>;\n  using SF = SequenceComposeFilter<M>;\n  using LF = LookAheadComposeFilter<SF, M>;\n  using WF = PushWeightsComposeFilter<LF, M>;\n  using ComposeFilter = PushLabelsComposeFilter<WF, M>;\n  using FstMatcher = M;\n};\n\n// Specializes for StdArc to allow weight and label pushing.\ntemplate <>\nclass DefaultLookAhead<StdArc, MATCH_OUTPUT> {\n public:\n  using M = LookAheadMatcher<Fst<StdArc>>;\n  using SF = AltSequenceComposeFilter<M>;\n  using LF = LookAheadComposeFilter<SF, M>;\n  using WF = PushWeightsComposeFilter<LF, M>;\n  using ComposeFilter = PushLabelsComposeFilter<WF, M>;\n  using FstMatcher = M;\n};\n\n// Specializes for LogArc to allow weight and label pushing.\ntemplate <>\nclass DefaultLookAhead<LogArc, MATCH_INPUT> {\n public:\n  using M = LookAheadMatcher<Fst<LogArc>>;\n  using SF = SequenceComposeFilter<M>;\n  using LF = LookAheadComposeFilter<SF, M>;\n  using WF = PushWeightsComposeFilter<LF, M>;\n  using ComposeFilter = PushLabelsComposeFilter<WF, M>;\n  using FstMatcher = M;\n};\n\n// Specializes for LogArc to allow weight and label pushing.\ntemplate <>\nclass DefaultLookAhead<LogArc, MATCH_OUTPUT> {\n public:\n  using M = LookAheadMatcher<Fst<LogArc>>;\n  using SF = AltSequenceComposeFilter<M>;\n  using LF = LookAheadComposeFilter<SF, M>;\n  using WF = PushWeightsComposeFilter<LF, M>;\n  using ComposeFilter = PushLabelsComposeFilter<WF, M>;\n  using FstMatcher = M;\n};\n\n}  // namespace fst\n\n#endif  // FST_LOOKAHEAD_FILTER_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/lookahead-matcher.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Classes to add lookahead to FST matchers, useful for improving composition\n// efficiency with certain inputs.\n\n#ifndef FST_LOOKAHEAD_MATCHER_H_\n#define FST_LOOKAHEAD_MATCHER_H_\n\n#include <memory>\n#include <utility>\n#include <vector>\n\n#include <fst/flags.h>\n#include <fst/log.h>\n\n#include <fst/add-on.h>\n#include <fst/const-fst.h>\n#include <fst/fst.h>\n#include <fst/label-reachable.h>\n#include <fst/matcher.h>\n\n\nDECLARE_string(save_relabel_ipairs);\nDECLARE_string(save_relabel_opairs);\n\nnamespace fst {\n\n// Lookahead matches extend the matcher interface with following additional\n// methods:\n//\n// template <class FST>\n// class LookAheadMatcher {\n//  public:\n//   using Arc = typename FST::Arc;\n//   using Label = typename Arc::Label;\n//   using StateId = typename Arc::StateId;\n//   using Weight = typename Arc::Weight;\n//\n//  // Required constructors.\n//  // This makes a copy of the FST.\n//  LookAheadMatcher(const FST &fst, MatchType match_type);\n//  // This doesn't copy the FST.\n//  LookAheadMatcher(const FST *fst, MatchType match_type);\n//  // This makes a copy of the FST.\n//  // See Copy() below.\n//  LookAheadMatcher(const LookAheadMatcher &matcher, bool safe = false);\n//\n//   // If safe = true, the copy is thread-safe (except the lookahead FST is\n//   // preserved). See Fst<>::Copy() for further doc.\n//   LookaheadMatcher<FST> *Copy(bool safe = false) const override;\n\n//  // Below are methods for looking ahead for a match to a label and more\n//  // generally, to a rational set. Each returns false if there is definitely\n//  // not a match and returns true if there possibly is a match.\n//\n//  // Optionally pre-specifies the lookahead FST that will be passed to\n//  // LookAheadFst() for possible precomputation. If copy is true, then the FST\n//  // argument is a copy of the FST used in the previous call to this method\n//  // (to avoid unnecessary updates).\n//  void InitLookAheadFst(const Fst<Arc> &fst, bool copy = false) override;\n//\n//  // Are there paths from a state in the lookahead FST that can be read from\n//  // the curent matcher state?\n//  bool LookAheadFst(const Fst<Arc> &fst, StateId s) override;\n//\n//  // Can the label be read from the current matcher state after possibly\n//  // following epsilon transitions?\n//  bool LookAheadLabel(Label label) const override;\n//\n//  // The following methods allow looking ahead for an arbitrary rational set\n//  // of strings, specified by an FST and a state from which to begin the\n//  // matching. If the lookahead FST is a transducer, this looks on the side\n//  // different from the matcher's match_type (cf. composition).\n//  // Is there is a single non-epsilon arc found in the lookahead FST that\n//  // begins the path (after possibly following any epsilons) in the last call\n//  // to LookAheadFst? If so, return true and copy it to the arc argument;\n//  // otherwise, return false. Non-trivial implementations are useful for\n//  // label-pushing in composition.\n//  bool LookAheadPrefix(Arc *arc) override;\n//\n//  // Gives an estimate of the combined weight of the paths in the lookahead\n//  // and matcher FSTs for the last call to LookAheadFst. Non-trivial\n//  // implementations are useful for weight-pushing in composition.\n//  Weight LookAheadWeight() const override;\n// };\n\n// Look-ahead flags.\n// Matcher is a lookahead matcher when match_type is MATCH_INPUT.\nconstexpr uint32_t kInputLookAheadMatcher = 0x00000010;\n\n// Matcher is a lookahead matcher when match_type is MATCH_OUTPUT.\nconstexpr uint32_t kOutputLookAheadMatcher = 0x00000020;\n\n// Is a non-trivial implementation of LookAheadWeight() method defined and\n// if so, should it be used?\nconstexpr uint32_t kLookAheadWeight = 0x00000040;\n\n// Is a non-trivial implementation of LookAheadPrefix() method defined and\n// if so, should it be used?\nconstexpr uint32_t kLookAheadPrefix = 0x00000080;\n\n// Look-ahead of matcher FST non-epsilon arcs?\nconstexpr uint32_t kLookAheadNonEpsilons = 0x00000100;\n\n// Look-ahead of matcher FST epsilon arcs?\nconstexpr uint32_t kLookAheadEpsilons = 0x00000200;\n\n// Ignore epsilon paths for the lookahead prefix? This gives correct results in\n// composition only with an appropriate composition filter since it depends on\n// the filter blocking the ignored paths.\nconstexpr uint32_t kLookAheadNonEpsilonPrefix = 0x00000400;\n\n// For LabelLookAheadMatcher, save relabeling data to file?\nconstexpr uint32_t kLookAheadKeepRelabelData = 0x00000800;\n\n// Flags used for lookahead matchers.\nconstexpr uint32_t kLookAheadFlags = 0x00000ff0;\n\n// LookAhead Matcher interface, templated on the Arc definition; used\n// for lookahead matcher specializations that are returned by the\n// InitMatcher() Fst method.\ntemplate <class Arc>\nclass LookAheadMatcherBase : public MatcherBase<Arc> {\n public:\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  virtual void InitLookAheadFst(const Fst<Arc> &, bool copy = false) = 0;\n  virtual bool LookAheadFst(const Fst<Arc> &, StateId) = 0;\n  virtual bool LookAheadLabel(Label) const = 0;\n\n  // Suggested concrete implementation of lookahead methods.\n\n  bool LookAheadPrefix(Arc *arc) const {\n    if (prefix_arc_.nextstate != kNoStateId) {\n      *arc = prefix_arc_;\n      return true;\n    } else {\n      return false;\n    }\n  }\n\n  Weight LookAheadWeight() const { return weight_; }\n\n protected:\n  // Concrete implementations for lookahead helper methods.\n\n  void ClearLookAheadWeight() { weight_ = Weight::One(); }\n\n  void SetLookAheadWeight(Weight weight) { weight_ = std::move(weight); }\n\n  void ClearLookAheadPrefix() { prefix_arc_.nextstate = kNoStateId; }\n\n  void SetLookAheadPrefix(Arc arc) { prefix_arc_ = std::move(arc); }\n\n private:\n  Arc prefix_arc_;\n  Weight weight_;\n};\n\n// Doesn't actually lookahead, just declares that the future looks good.\ntemplate <class M>\nclass TrivialLookAheadMatcher\n    : public LookAheadMatcherBase<typename M::FST::Arc> {\n public:\n  using FST = typename M::FST;\n  using Arc = typename FST::Arc;\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  // This makes a copy of the FST.\n  TrivialLookAheadMatcher(const FST &fst, MatchType match_type)\n      : matcher_(fst, match_type) {}\n\n  // This doesn't copy the FST.\n  TrivialLookAheadMatcher(const FST *fst, MatchType match_type)\n      : matcher_(fst, match_type) {}\n\n  // This makes a copy of the FST.\n  TrivialLookAheadMatcher(const TrivialLookAheadMatcher<M> &lmatcher,\n                          bool safe = false)\n      : matcher_(lmatcher.matcher_, safe) {}\n\n  TrivialLookAheadMatcher<M> *Copy(bool safe = false) const override {\n    return new TrivialLookAheadMatcher<M>(*this, safe);\n  }\n\n  MatchType Type(bool test) const override { return matcher_.Type(test); }\n\n  void SetState(StateId s) final { return matcher_.SetState(s); }\n\n  bool Find(Label label) final { return matcher_.Find(label); }\n\n  bool Done() const final { return matcher_.Done(); }\n\n  const Arc &Value() const final { return matcher_.Value(); }\n\n  void Next() final { matcher_.Next(); }\n\n  Weight Final(StateId s) const final { return matcher_.Final(s); }\n\n  std::ptrdiff_t Priority(StateId s) final { return matcher_.Priority(s); }\n\n  const FST &GetFst() const override { return matcher_.GetFst(); }\n\n  uint64_t Properties(uint64_t props) const override {\n    return matcher_.Properties(props);\n  }\n\n  uint32_t Flags() const override {\n    return matcher_.Flags() | kInputLookAheadMatcher | kOutputLookAheadMatcher;\n  }\n\n  // Lookahead methods (all trivial).\n\n  void InitLookAheadFst(const Fst<Arc> &fst, bool copy = false) override {}\n\n  bool LookAheadFst(const Fst<Arc> &, StateId) final { return true; }\n\n  bool LookAheadLabel(Label) const final { return true; }\n\n  bool LookAheadPrefix(Arc *) const { return false; }\n\n  Weight LookAheadWeight() const { return Weight::One(); }\n\n private:\n  M matcher_;\n};\n\n// Look-ahead of one transition. Template argument flags accepts flags to\n// control behavior.\ntemplate <class M,\n          uint32_t flags = kLookAheadNonEpsilons | kLookAheadEpsilons |\n                         kLookAheadWeight | kLookAheadPrefix>\nclass ArcLookAheadMatcher : public LookAheadMatcherBase<typename M::FST::Arc> {\n public:\n  using FST = typename M::FST;\n  using Arc = typename FST::Arc;\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n  using MatcherData = NullAddOn;\n\n  using LookAheadMatcherBase<Arc>::ClearLookAheadWeight;\n  using LookAheadMatcherBase<Arc>::LookAheadWeight;\n  using LookAheadMatcherBase<Arc>::SetLookAheadWeight;\n  using LookAheadMatcherBase<Arc>::ClearLookAheadPrefix;\n  using LookAheadMatcherBase<Arc>::LookAheadPrefix;\n  using LookAheadMatcherBase<Arc>::SetLookAheadPrefix;\n\n  enum : uint32_t { kFlags = flags };\n\n  // This makes a copy of the FST.\n  ArcLookAheadMatcher(\n      const FST &fst, MatchType match_type,\n      std::shared_ptr<MatcherData> data = std::shared_ptr<MatcherData>())\n      : matcher_(fst, match_type),\n        fst_(matcher_.GetFst()),\n        lfst_(nullptr),\n        state_(kNoStateId) {}\n\n  // This doesn't copy the FST.\n  ArcLookAheadMatcher(\n      const FST *fst, MatchType match_type,\n      std::shared_ptr<MatcherData> data = std::shared_ptr<MatcherData>())\n      : matcher_(fst, match_type),\n        fst_(matcher_.GetFst()),\n        lfst_(nullptr),\n        state_(kNoStateId) {}\n\n  // This makes a copy of the FST.\n  ArcLookAheadMatcher(const ArcLookAheadMatcher<M, flags> &lmatcher,\n                      bool safe = false)\n      : matcher_(lmatcher.matcher_, safe),\n        fst_(matcher_.GetFst()),\n        lfst_(lmatcher.lfst_),\n        state_(kNoStateId) {}\n\n  // General matcher methods.\n  ArcLookAheadMatcher<M, flags> *Copy(bool safe = false) const override {\n    return new ArcLookAheadMatcher<M, flags>(*this, safe);\n  }\n\n  MatchType Type(bool test) const override { return matcher_.Type(test); }\n\n  void SetState(StateId s) final {\n    state_ = s;\n    matcher_.SetState(s);\n  }\n\n  bool Find(Label label) final { return matcher_.Find(label); }\n\n  bool Done() const final { return matcher_.Done(); }\n\n  const Arc &Value() const final { return matcher_.Value(); }\n\n  void Next() final { matcher_.Next(); }\n\n  Weight Final(StateId s) const final { return matcher_.Final(s); }\n\n  std::ptrdiff_t Priority(StateId s) final { return matcher_.Priority(s); }\n\n  const FST &GetFst() const override { return fst_; }\n\n  uint64_t Properties(uint64_t props) const override {\n    return matcher_.Properties(props);\n  }\n\n  uint32_t Flags() const override {\n    return matcher_.Flags() | kInputLookAheadMatcher | kOutputLookAheadMatcher |\n           kFlags;\n  }\n\n  const MatcherData *GetData() const { return nullptr; }\n\n  std::shared_ptr<MatcherData> GetSharedData() const {\n    return std::shared_ptr<MatcherData>();\n  }\n\n  // Look-ahead methods.\n\n  void InitLookAheadFst(const Fst<Arc> &fst, bool copy = false) override {\n    lfst_ = &fst;\n  }\n\n  // Checks if there is a matching (possibly super-final) transition\n  // at (state_, s).\n  bool LookAheadFst(const Fst<Arc> &, StateId) final;\n\n  bool LookAheadLabel(Label label) const final { return matcher_.Find(label); }\n\n private:\n  mutable M matcher_;\n  const FST &fst_;        // Matcher FST.\n  const Fst<Arc> *lfst_;  // Look-ahead FST.\n  StateId state_;         // Matcher state.\n};\n\ntemplate <class M, uint32_t flags>\nbool ArcLookAheadMatcher<M, flags>::LookAheadFst(const Fst<Arc> &fst,\n                                                 StateId s) {\n  if (&fst != lfst_) InitLookAheadFst(fst);\n  bool result = false;\n  std::ptrdiff_t nprefix = 0;\n  if (kFlags & kLookAheadWeight) ClearLookAheadWeight();\n  if (kFlags & kLookAheadPrefix) ClearLookAheadPrefix();\n  if (fst_.Final(state_) != Weight::Zero() &&\n      lfst_->Final(s) != Weight::Zero()) {\n    if (!(kFlags & (kLookAheadWeight | kLookAheadPrefix))) return true;\n    ++nprefix;\n    if (kFlags & kLookAheadWeight) {\n      SetLookAheadWeight(\n          Plus(LookAheadWeight(), Times(fst_.Final(state_), lfst_->Final(s))));\n    }\n    result = true;\n  }\n  if (matcher_.Find(kNoLabel)) {\n    if (!(kFlags & (kLookAheadWeight | kLookAheadPrefix))) return true;\n    ++nprefix;\n    if (kFlags & kLookAheadWeight) {\n      for (; !matcher_.Done(); matcher_.Next()) {\n        SetLookAheadWeight(Plus(LookAheadWeight(), matcher_.Value().weight));\n      }\n    }\n    result = true;\n  }\n  for (ArcIterator<Fst<Arc>> aiter(*lfst_, s); !aiter.Done(); aiter.Next()) {\n    const auto &arc = aiter.Value();\n    Label label = kNoLabel;\n    switch (matcher_.Type(false)) {\n      case MATCH_INPUT:\n        label = arc.olabel;\n        break;\n      case MATCH_OUTPUT:\n        label = arc.ilabel;\n        break;\n      default:\n        FSTERROR() << \"ArcLookAheadMatcher::LookAheadFst: Bad match type\";\n        return true;\n    }\n    if (label == 0) {\n      if (!(kFlags & (kLookAheadWeight | kLookAheadPrefix))) return true;\n      if (!(kFlags & kLookAheadNonEpsilonPrefix)) ++nprefix;\n      if (kFlags & kLookAheadWeight) {\n        SetLookAheadWeight(Plus(LookAheadWeight(), arc.weight));\n      }\n      result = true;\n    } else if (matcher_.Find(label)) {\n      if (!(kFlags & (kLookAheadWeight | kLookAheadPrefix))) return true;\n      for (; !matcher_.Done(); matcher_.Next()) {\n        ++nprefix;\n        if (kFlags & kLookAheadWeight) {\n          SetLookAheadWeight(Plus(LookAheadWeight(),\n                                  Times(arc.weight, matcher_.Value().weight)));\n        }\n        if ((kFlags & kLookAheadPrefix) && nprefix == 1)\n          SetLookAheadPrefix(arc);\n      }\n      result = true;\n    }\n  }\n  if (kFlags & kLookAheadPrefix) {\n    if (nprefix == 1) {\n      ClearLookAheadWeight();  // Avoids double counting.\n    } else {\n      ClearLookAheadPrefix();\n    }\n  }\n  return result;\n}\n\n// Template argument flags accepts flags to control behavior. It must include\n// precisely one of kInputLookAheadMatcher or kOutputLookAheadMatcher.\ntemplate <class M,\n          uint32_t flags = kLookAheadEpsilons | kLookAheadWeight |\n                         kLookAheadPrefix | kLookAheadNonEpsilonPrefix |\n                         kLookAheadKeepRelabelData,\n          class Accumulator = DefaultAccumulator<typename M::Arc>,\n          class Reachable = LabelReachable<typename M::Arc, Accumulator>>\nclass LabelLookAheadMatcher\n    : public LookAheadMatcherBase<typename M::FST::Arc> {\n public:\n  using FST = typename M::FST;\n  using Arc = typename FST::Arc;\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n  using MatcherData = typename Reachable::Data;\n\n  using LookAheadMatcherBase<Arc>::ClearLookAheadWeight;\n  using LookAheadMatcherBase<Arc>::LookAheadWeight;\n  using LookAheadMatcherBase<Arc>::SetLookAheadWeight;\n  using LookAheadMatcherBase<Arc>::ClearLookAheadPrefix;\n  using LookAheadMatcherBase<Arc>::LookAheadPrefix;\n  using LookAheadMatcherBase<Arc>::SetLookAheadPrefix;\n\n  enum : uint32_t { kFlags = flags };\n\n  // This makes a copy of the FST.\n  LabelLookAheadMatcher(\n      const FST &fst, MatchType match_type,\n      std::shared_ptr<MatcherData> data = std::shared_ptr<MatcherData>(),\n      Accumulator *accumulator = nullptr)\n      : matcher_(fst, match_type),\n        lfst_(nullptr),\n        state_(kNoStateId),\n        error_(false) {\n    Init(fst, match_type, data, accumulator);\n  }\n\n  // This doesn't copy the FST.\n  LabelLookAheadMatcher(\n      const FST *fst, MatchType match_type,\n      std::shared_ptr<MatcherData> data = std::shared_ptr<MatcherData>(),\n      Accumulator *accumulator = nullptr)\n      : matcher_(fst, match_type),\n        lfst_(nullptr),\n        state_(kNoStateId),\n        error_(false) {\n    Init(*fst, match_type, data, accumulator);\n  }\n\n  // This makes a copy of the FST.\n  LabelLookAheadMatcher(\n      const LabelLookAheadMatcher<M, flags, Accumulator, Reachable> &lmatcher,\n      bool safe = false)\n      : matcher_(lmatcher.matcher_, safe),\n        lfst_(lmatcher.lfst_),\n        label_reachable_(lmatcher.label_reachable_\n                             ? new Reachable(*lmatcher.label_reachable_, safe)\n                             : nullptr),\n        state_(kNoStateId),\n        error_(lmatcher.error_) {}\n\n  LabelLookAheadMatcher<M, flags, Accumulator, Reachable> *Copy(\n      bool safe = false) const override {\n    return new LabelLookAheadMatcher<M, flags, Accumulator, Reachable>(*this,\n                                                                       safe);\n  }\n\n  MatchType Type(bool test) const override { return matcher_.Type(test); }\n\n  void SetState(StateId s) final {\n    if (state_ == s) return;\n    state_ = s;\n    match_set_state_ = false;\n    reach_set_state_ = false;\n  }\n\n  bool Find(Label label) final {\n    if (!match_set_state_) {\n      matcher_.SetState(state_);\n      match_set_state_ = true;\n    }\n    return matcher_.Find(label);\n  }\n\n  bool Done() const final { return matcher_.Done(); }\n\n  const Arc &Value() const final { return matcher_.Value(); }\n\n  void Next() final { matcher_.Next(); }\n\n  Weight Final(StateId s) const final { return matcher_.Final(s); }\n\n  std::ptrdiff_t Priority(StateId s) final { return matcher_.Priority(s); }\n\n  const FST &GetFst() const override { return matcher_.GetFst(); }\n\n  uint64_t Properties(uint64_t inprops) const override {\n    auto outprops = matcher_.Properties(inprops);\n    if (error_ || (label_reachable_ && label_reachable_->Error())) {\n      outprops |= kError;\n    }\n    return outprops;\n  }\n\n  uint32_t Flags() const override {\n    if (label_reachable_ && label_reachable_->GetData()->ReachInput()) {\n      return matcher_.Flags() | kFlags | kInputLookAheadMatcher;\n    } else if (label_reachable_ && !label_reachable_->GetData()->ReachInput()) {\n      return matcher_.Flags() | kFlags | kOutputLookAheadMatcher;\n    } else {\n      return matcher_.Flags();\n    }\n  }\n\n  const MatcherData *GetData() const {\n    return label_reachable_ ? label_reachable_->GetData() : nullptr;\n  };\n\n  std::shared_ptr<MatcherData> GetSharedData() const {\n    return label_reachable_ ? label_reachable_->GetSharedData()\n                            : std::shared_ptr<MatcherData>();\n  }\n  // Checks if there is a matching (possibly super-final) transition at\n  // (state_, s).\n  template <class LFST>\n  bool LookAheadFst(const LFST &fst, StateId s);\n\n  // Required to make class concrete.\n  bool LookAheadFst(const Fst<Arc> &fst, StateId s) final {\n    return LookAheadFst<Fst<Arc>>(fst, s);\n  }\n\n  void InitLookAheadFst(const Fst<Arc> &fst, bool copy = false) override {\n    lfst_ = &fst;\n    if (label_reachable_) {\n      const bool reach_input = Type(false) == MATCH_OUTPUT;\n      label_reachable_->ReachInit(fst, reach_input, copy);\n    }\n  }\n\n  template <class LFST>\n  void InitLookAheadFst(const LFST &fst, bool copy = false) {\n    lfst_ = static_cast<const Fst<Arc> *>(&fst);\n    if (label_reachable_) {\n      const bool reach_input = Type(false) == MATCH_OUTPUT;\n      label_reachable_->ReachInit(fst, reach_input, copy);\n    }\n  }\n\n  bool LookAheadLabel(Label label) const final {\n    if (label == 0) return true;\n    if (label_reachable_) {\n      if (!reach_set_state_) {\n        label_reachable_->SetState(state_);\n        reach_set_state_ = true;\n      }\n      return label_reachable_->Reach(label);\n    } else {\n      return true;\n    }\n  }\n\n private:\n  void Init(const FST &fst, MatchType match_type,\n            std::shared_ptr<MatcherData> data,\n            Accumulator *accumulator) {\n    if (!(kFlags & (kInputLookAheadMatcher | kOutputLookAheadMatcher))) {\n      FSTERROR() << \"LabelLookaheadMatcher: Bad matcher flags: \" << kFlags;\n      error_ = true;\n    }\n    const bool reach_input = match_type == MATCH_INPUT;\n    if (data) {\n      if (reach_input == data->ReachInput()) {\n        label_reachable_.reset(new Reachable(data, accumulator));\n      }\n    } else if ((reach_input && (kFlags & kInputLookAheadMatcher)) ||\n               (!reach_input && (kFlags & kOutputLookAheadMatcher))) {\n      label_reachable_.reset(new Reachable(fst, reach_input, accumulator,\n                                           kFlags & kLookAheadKeepRelabelData));\n    }\n  }\n\n  mutable M matcher_;\n  const Fst<Arc> *lfst_;                        // Look-ahead FST.\n  std::unique_ptr<Reachable> label_reachable_;  // Label reachability info.\n  StateId state_;                               // Matcher state.\n  bool match_set_state_;                        // matcher_.SetState called?\n  mutable bool reach_set_state_;                // reachable_.SetState called?\n  bool error_;                                  // Error encountered?\n};\n\ntemplate <class M, uint32_t flags, class Accumulator, class Reachable>\ntemplate <class LFST>\ninline bool LabelLookAheadMatcher<M, flags, Accumulator,\n                                  Reachable>::LookAheadFst(const LFST &fst,\n                                                           StateId s) {\n  if (static_cast<const Fst<Arc> *>(&fst) != lfst_) InitLookAheadFst(fst);\n  ClearLookAheadWeight();\n  ClearLookAheadPrefix();\n  if (!label_reachable_) return true;\n  label_reachable_->SetState(state_, s);\n  reach_set_state_ = true;\n  bool compute_weight = kFlags & kLookAheadWeight;\n  bool compute_prefix = kFlags & kLookAheadPrefix;\n  ArcIterator<LFST> aiter(fst, s);\n  aiter.SetFlags(kArcNoCache, kArcNoCache);  // Makes caching optional.\n  const bool reach_arc = label_reachable_->Reach(\n      &aiter, 0, internal::NumArcs(*lfst_, s), compute_weight);\n  const auto lfinal = internal::Final(*lfst_, s);\n  const bool reach_final =\n      lfinal != Weight::Zero() && label_reachable_->ReachFinal();\n  if (reach_arc) {\n    const auto begin = label_reachable_->ReachBegin();\n    const auto end = label_reachable_->ReachEnd();\n    if (compute_prefix && end - begin == 1 && !reach_final) {\n      aiter.Seek(begin);\n      SetLookAheadPrefix(aiter.Value());\n      compute_weight = false;\n    } else if (compute_weight) {\n      SetLookAheadWeight(label_reachable_->ReachWeight());\n    }\n  }\n  if (reach_final && compute_weight) {\n    SetLookAheadWeight(reach_arc ? Plus(LookAheadWeight(), lfinal) : lfinal);\n  }\n  return reach_arc || reach_final;\n}\n\n// Label-lookahead relabeling class.\ntemplate <class Arc, class Data = LabelReachableData<typename Arc::Label>>\nclass LabelLookAheadRelabeler {\n public:\n  using Label = typename Arc::Label;\n  using Reachable = LabelReachable<Arc, DefaultAccumulator<Arc>, Data>;\n\n  // Relabels matcher FST (initialization function object).\n  template <typename Impl>\n  explicit LabelLookAheadRelabeler(std::shared_ptr<Impl> *impl);\n\n  // Relabels arbitrary FST. Class LFST should be a label-lookahead FST.\n  template <class LFST>\n  static void Relabel(MutableFst<Arc> *fst, const LFST &mfst,\n                      bool relabel_input) {\n    const auto *data = mfst.GetAddOn();\n    Reachable reachable(data->First() ? data->SharedFirst()\n                                      : data->SharedSecond());\n    reachable.Relabel(fst, relabel_input);\n  }\n\n  // Returns relabeling pairs (cf. relabel.h::Relabel()). Class LFST should be a\n  // label-lookahead FST. If avoid_collisions is true, extra pairs are added to\n  // ensure no collisions when relabeling automata that have labels unseen here.\n  template <class LFST>\n  static void RelabelPairs(const LFST &mfst,\n                           std::vector<std::pair<Label, Label>> *pairs,\n                           bool avoid_collisions = false) {\n    const auto *data = mfst.GetAddOn();\n    Reachable reachable(data->First() ? data->SharedFirst()\n                                      : data->SharedSecond());\n    reachable.RelabelPairs(pairs, avoid_collisions);\n  }\n};\n\ntemplate <class Arc, class Data>\ntemplate <typename Impl>\ninline LabelLookAheadRelabeler<Arc, Data>::LabelLookAheadRelabeler(\n    std::shared_ptr<Impl> *impl) {\n  Fst<Arc> &fst = (*impl)->GetFst();\n  auto data = (*impl)->GetSharedAddOn();\n  const auto name = (*impl)->Type();\n  const bool is_mutable = fst.Properties(kMutable, false);\n  std::unique_ptr<MutableFst<Arc>> mfst;\n  if (is_mutable) {\n    mfst.reset(static_cast<MutableFst<Arc> *>(&fst));\n  } else {\n    mfst.reset(new VectorFst<Arc>(fst));\n  }\n  if (data->First()) {  // reach_input.\n    Reachable reachable(data->SharedFirst());\n    reachable.Relabel(mfst.get(), true);\n    if (!FLAGS_save_relabel_ipairs.empty()) {\n      std::vector<std::pair<Label, Label>> pairs;\n      reachable.RelabelPairs(&pairs, true);\n      WriteLabelPairs(FLAGS_save_relabel_ipairs, pairs);\n    }\n  } else {\n    Reachable reachable(data->SharedSecond());\n    reachable.Relabel(mfst.get(), false);\n    if (!FLAGS_save_relabel_opairs.empty()) {\n      std::vector<std::pair<Label, Label>> pairs;\n      reachable.RelabelPairs(&pairs, true);\n      WriteLabelPairs(FLAGS_save_relabel_opairs, pairs);\n    }\n  }\n  if (!is_mutable) {\n    *impl = std::make_shared<Impl>(*mfst, name);\n    (*impl)->SetAddOn(data);\n  }\n}\n\n// Generic lookahead matcher, templated on the FST definition (a wrapper around\n// a pointer to specific one).\ntemplate <class F>\nclass LookAheadMatcher {\n public:\n  using FST = F;\n  using Arc = typename FST::Arc;\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n  using LBase = LookAheadMatcherBase<Arc>;\n\n  // This makes a copy of the FST.\n  LookAheadMatcher(const FST &fst, MatchType match_type)\n      : owned_fst_(fst.Copy()),\n        base_(owned_fst_->InitMatcher(match_type)),\n        lookahead_(false) {\n    if (!base_) base_.reset(new SortedMatcher<FST>(owned_fst_.get(),\n                                                   match_type));\n  }\n\n  // This doesn't copy the FST.\n  LookAheadMatcher(const FST *fst, MatchType match_type)\n      : base_(fst->InitMatcher(match_type)),\n        lookahead_(false) {\n    if (!base_) base_.reset(new SortedMatcher<FST>(fst, match_type));\n  }\n\n  // This makes a copy of the FST.\n  LookAheadMatcher(const LookAheadMatcher<FST> &matcher, bool safe = false)\n      : base_(matcher.base_->Copy(safe)),\n        lookahead_(matcher.lookahead_) { }\n\n  // Takes ownership of base.\n  explicit LookAheadMatcher(MatcherBase<Arc> *base)\n      : base_(base), lookahead_(false) {}\n\n  LookAheadMatcher<FST> *Copy(bool safe = false) const {\n    return new LookAheadMatcher<FST>(*this, safe);\n  }\n\n  MatchType Type(bool test) const { return base_->Type(test); }\n\n  void SetState(StateId s) { base_->SetState(s); }\n\n  bool Find(Label label) { return base_->Find(label); }\n\n  bool Done() const { return base_->Done(); }\n\n  const Arc &Value() const { return base_->Value(); }\n\n  void Next() { base_->Next(); }\n\n  Weight Final(StateId s) const { return base_->Final(s); }\n\n  std::ptrdiff_t Priority(StateId s) { return base_->Priority(s); }\n\n  const FST &GetFst() const {\n    return static_cast<const FST &>(base_->GetFst());\n  }\n\n  uint64_t Properties(uint64_t props) const { return base_->Properties(props); }\n\n  uint32_t Flags() const { return base_->Flags(); }\n\n  bool LookAheadLabel(Label label) const {\n    if (LookAheadCheck()) {\n      return static_cast<LBase *>(base_.get())->LookAheadLabel(label);\n    } else {\n      return true;\n    }\n  }\n\n  bool LookAheadFst(const Fst<Arc> &fst, StateId s) {\n    if (LookAheadCheck()) {\n      return static_cast<LBase *>(base_.get())->LookAheadFst(fst, s);\n    } else {\n      return true;\n    }\n  }\n\n  Weight LookAheadWeight() const {\n    if (LookAheadCheck()) {\n      return static_cast<LBase *>(base_.get())->LookAheadWeight();\n    } else {\n      return Weight::One();\n    }\n  }\n\n  bool LookAheadPrefix(Arc *arc) const {\n    if (LookAheadCheck()) {\n      return static_cast<LBase *>(base_.get())->LookAheadPrefix(arc);\n    } else {\n      return false;\n    }\n  }\n\n  void InitLookAheadFst(const Fst<Arc> &fst, bool copy = false) {\n    if (LookAheadCheck()) {\n      static_cast<LBase *>(base_.get())->InitLookAheadFst(fst, copy);\n    }\n  }\n\n private:\n  bool LookAheadCheck() const {\n    if (!lookahead_) {\n      lookahead_ =\n          base_->Flags() & (kInputLookAheadMatcher | kOutputLookAheadMatcher);\n      if (!lookahead_) {\n        FSTERROR() << \"LookAheadMatcher: No look-ahead matcher defined\";\n      }\n    }\n    return lookahead_;\n  }\n\n  std::unique_ptr<const FST> owned_fst_;\n  std::unique_ptr<MatcherBase<Arc>> base_;\n  mutable bool lookahead_;\n\n  LookAheadMatcher &operator=(const LookAheadMatcher &) = delete;\n};\n\n}  // namespace fst\n\n#endif  // FST_LOOKAHEAD_MATCHER_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/map.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Compatibility file for old-style Map() functions and MapFst class that have\n// been renamed to ArcMap (cf. StateMap).\n\n#ifndef FST_MAP_H_\n#define FST_MAP_H_\n\n\n#include <fst/arc-map.h>\n\n\nnamespace fst {\n\ntemplate <class A, class C>\nvoid Map(MutableFst<A> *fst, C *mapper) {\n  ArcMap(fst, mapper);\n}\n\ntemplate <class A, class C>\nvoid Map(MutableFst<A> *fst, C mapper) {\n  ArcMap(fst, mapper);\n}\n\ntemplate <class A, class B, class C>\nvoid Map(const Fst<A> &ifst, MutableFst<B> *ofst, C *mapper) {\n  ArcMap(ifst, ofst, mapper);\n}\n\ntemplate <class A, class B, class C>\nvoid Map(const Fst<A> &ifst, MutableFst<B> *ofst, C mapper) {\n  ArcMap(ifst, ofst, mapper);\n}\n\nusing MapFstOptions = ArcMapFstOptions;\n\ntemplate <class A, class B, class C>\nclass MapFst : public ArcMapFst<A, B, C> {\n public:\n  using FromArc = A;\n  using ToArc = B;\n\n  using StateId = typename ToArc::StateId;\n  using Weight = typename ToArc::Weight;\n\n  using State = CacheState<B>;\n\n  MapFst(const Fst<A> &fst, const C &mapper, const MapFstOptions &opts)\n      : ArcMapFst<A, B, C>(fst, mapper, opts) {}\n\n  MapFst(const Fst<A> &fst, C *mapper, const MapFstOptions &opts)\n      : ArcMapFst<A, B, C>(fst, mapper, opts) {}\n\n  MapFst(const Fst<A> &fst, const C &mapper)\n      : ArcMapFst<A, B, C>(fst, mapper) {}\n\n  MapFst(const Fst<A> &fst, C *mapper) : ArcMapFst<A, B, C>(fst, mapper) {}\n\n  // See Fst<>::Copy() for doc.\n  MapFst(const MapFst<A, B, C> &fst, bool safe = false)\n      : ArcMapFst<A, B, C>(fst, safe) {}\n\n  // Get a copy of this MapFst. See Fst<>::Copy() for further doc.\n  MapFst<A, B, C> *Copy(bool safe = false) const override {\n    return new MapFst(*this, safe);\n  }\n};\n\n// Specialization for MapFst.\ntemplate <class A, class B, class C>\nclass StateIterator<MapFst<A, B, C>>\n    : public StateIterator<ArcMapFst<A, B, C>> {\n public:\n  explicit StateIterator(const ArcMapFst<A, B, C> &fst)\n      : StateIterator<ArcMapFst<A, B, C>>(fst) {}\n};\n\n// Specialization for MapFst.\ntemplate <class A, class B, class C>\nclass ArcIterator<MapFst<A, B, C>> : public ArcIterator<ArcMapFst<A, B, C>> {\n public:\n  ArcIterator(const ArcMapFst<A, B, C> &fst, typename A::StateId s)\n      : ArcIterator<ArcMapFst<A, B, C>>(fst, s) {}\n};\n\n// For backwards compatibility only; use IdentityArcMapper otherwise.\ntemplate <class A>\nstruct IdentityMapper {\n  using FromArc = A;\n  using ToArc = A;\n\n  ToArc operator()(const FromArc &arc) const { return arc; }\n\n  constexpr MapFinalAction FinalAction() const { return MAP_NO_SUPERFINAL; }\n\n  constexpr MapSymbolsAction InputSymbolsAction() const {\n    return MAP_COPY_SYMBOLS;\n  }\n\n  constexpr MapSymbolsAction OutputSymbolsAction() const {\n    return MAP_COPY_SYMBOLS;\n  }\n\n  uint64_t Properties(uint64_t props) const { return props; }\n};\n\n}  // namespace fst\n\n#endif  // FST_MAP_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/mapped-file.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#ifndef FST_MAPPED_FILE_H_\n#define FST_MAPPED_FILE_H_\n\n#include <cstddef>\n#include <istream>\n#include <string>\n\n#include <fst/compat.h>\n#include <fst/flags.h>\n\nnamespace fst {\n\n// A memory region is a simple abstraction for allocated memory or data from\n// memory-mapped files. If mmap is null, then data represents an owned region\n// of size bytes. Otherwise, mmap and size refer to the mapping and data is a\n// casted pointer to a region contained within [mmap, mmap + size). If size is\n// 0, then mmap and data refer to a block of memory managed externally by some\n// other allocator. The offset is used when allocating memory to providing\n// padding for alignment.\nstruct MemoryRegion {\n  void *data;\n  void *mmap;\n  size_t size;\n  int offset;\n};\n\nclass MappedFile {\n public:\n  ~MappedFile();\n\n  void *mutable_data() const { return region_.data; }\n\n  const void *data() const { return region_.data; }\n\n  // Returns a MappedFile object that contains the contents of the input stream\n  // strm starting from the current file position with size bytes. The memorymap\n  // bool is advisory, and Map will default to allocating and reading. The\n  // source argument needs to contain the filename that was used to open the\n  // input stream.\n  static MappedFile *Map(std::istream *istrm, bool memorymap,\n                         const string &source, size_t size);\n\n  // Creates a MappedFile object with a new[]'ed block of memory of size. The\n  // align argument can be used to specify a desired block alignment.\n  // This is RECOMMENDED FOR INTERNAL USE ONLY as it may change in future\n  // releases.\n  static MappedFile *Allocate(size_t size, int align = kArchAlignment);\n\n  // Creates a MappedFile object pointing to a borrowed reference to data. This\n  // block of memory is not owned by the MappedFile object and will not be\n  // freed. This is RECOMMENDED FOR INTERNAL USE ONLY, may change in future\n  // releases.\n  static MappedFile *Borrow(void *data);\n\n  // Alignment required for mapping structures in bytes. Regions of memory that\n  // are not aligned upon a 128-bit boundary are read from the file instead.\n  // This is consistent with the alignment boundary set in ConstFst and\n  // CompactFst.\n  static constexpr int kArchAlignment = 16;\n\n  static constexpr size_t kMaxReadChunk = 256 * 1024 * 1024;  // 256 MB.\n\n private:\n  explicit MappedFile(const MemoryRegion &region);\n\n  MemoryRegion region_;\n  MappedFile(const MappedFile &) = delete;\n  MappedFile &operator=(const MappedFile &) = delete;\n};\n}  // namespace fst\n\n#endif  // FST_MAPPED_FILE_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/matcher-fst.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Class to add a matcher to an FST.\n\n#ifndef FST_MATCHER_FST_H_\n#define FST_MATCHER_FST_H_\n\n#include <memory>\n#include <string>\n\n#include <fst/add-on.h>\n#include <fst/const-fst.h>\n#include <fst/lookahead-matcher.h>\n\n\nnamespace fst {\n\n// Writeable matchers have the same interface as Matchers (as defined in\n// matcher.h) along with the following additional methods:\n//\n// template <class F>\n// class Matcher {\n//  public:\n//   using FST = F;\n//   ...\n//   using MatcherData = ...;   // Initialization data.\n//\n//   // Constructor with additional argument for external initialization data;\n//   // matcher increments its reference count on construction and decrements\n//   // the reference count, and deletes once the reference count has reached\n//   // zero.\n//   Matcher(const FST &fst, MatchType type, MatcherData *data);\n//\n//   // Returns pointer to initialization data that can be passed to a Matcher\n//   // constructor.\n//   MatcherData *GetData() const;\n// };\n\n// The matcher initialization data class must also provide the following\n// interface:\n//\n// class MatcherData {\n// public:\n//   // Required copy constructor.\n//   MatcherData(const MatcherData &);\n//\n//   // Required I/O methods.\n//   static MatcherData *Read(std::istream &istrm, const FstReadOptions &opts);\n//   bool Write(std::ostream &ostrm, const FstWriteOptions &opts) const;\n// };\n\n// Trivial (no-op) MatcherFst initializer functor.\ntemplate <class M>\nclass NullMatcherFstInit {\n public:\n  using MatcherData = typename M::MatcherData;\n  using Data = AddOnPair<MatcherData, MatcherData>;\n  using Impl = internal::AddOnImpl<typename M::FST, Data>;\n\n  explicit NullMatcherFstInit(std::shared_ptr<Impl> *) {}\n};\n\n// Class adding a matcher to an FST type. Creates a new FST whose name is given\n// by N. An optional functor Init can be used to initialize the FST. The Data\n// template parameter allows the user to select the type of the add-on.\ntemplate <\n    class F, class M, const char *Name, class Init = NullMatcherFstInit<M>,\n    class Data = AddOnPair<typename M::MatcherData, typename M::MatcherData>>\nclass MatcherFst : public ImplToExpandedFst<internal::AddOnImpl<F, Data>> {\n public:\n  using FST = F;\n  using Arc = typename FST::Arc;\n  using StateId = typename Arc::StateId;\n\n  using FstMatcher = M;\n  using MatcherData = typename FstMatcher::MatcherData;\n\n  using Impl = internal::AddOnImpl<FST, Data>;\n  using D = Data;\n\n  friend class StateIterator<MatcherFst<FST, FstMatcher, Name, Init, Data>>;\n  friend class ArcIterator<MatcherFst<FST, FstMatcher, Name, Init, Data>>;\n\n  MatcherFst() : ImplToExpandedFst<Impl>(std::make_shared<Impl>(FST(), Name)) {}\n\n  explicit MatcherFst(const FST &fst, std::shared_ptr<Data> data = nullptr)\n      : ImplToExpandedFst<Impl>(data ? CreateImpl(fst, Name, data)\n                                     : CreateDataAndImpl(fst, Name)) {}\n\n  explicit MatcherFst(const Fst<Arc> &fst)\n      : ImplToExpandedFst<Impl>(CreateDataAndImpl(fst, Name)) {}\n\n  // See Fst<>::Copy() for doc.\n  MatcherFst(const MatcherFst<FST, FstMatcher, Name, Init, Data> &fst,\n             bool safe = false)\n      : ImplToExpandedFst<Impl>(fst, safe) {}\n\n  // Get a copy of this MatcherFst. See Fst<>::Copy() for further doc.\n  MatcherFst<FST, FstMatcher, Name, Init, Data> *Copy(\n      bool safe = false) const override {\n    return new MatcherFst<FST, FstMatcher, Name, Init, Data>(*this, safe);\n  }\n\n  // Read a MatcherFst from an input stream; return nullptr on error\n  static MatcherFst<FST, M, Name, Init, Data> *Read(\n      std::istream &strm, const FstReadOptions &opts) {\n    auto *impl = Impl::Read(strm, opts);\n    return impl ? new MatcherFst<FST, FstMatcher, Name, Init, Data>(\n                      std::shared_ptr<Impl>(impl))\n                : nullptr;\n  }\n\n  // Read a MatcherFst from a file; return nullptr on error\n  // Empty filename reads from standard input\n  static MatcherFst<FST, FstMatcher, Name, Init, Data> *Read(\n      const string &filename) {\n    auto *impl = ImplToExpandedFst<Impl>::Read(filename);\n    return impl ? new MatcherFst<FST, FstMatcher, Name, Init, Data>(\n                      std::shared_ptr<Impl>(impl))\n                : nullptr;\n  }\n\n  bool Write(std::ostream &strm, const FstWriteOptions &opts) const override {\n    return GetImpl()->Write(strm, opts);\n  }\n\n  bool Write(const string &filename) const override {\n    return Fst<Arc>::WriteFile(filename);\n  }\n\n  void InitStateIterator(StateIteratorData<Arc> *data) const override {\n    return GetImpl()->InitStateIterator(data);\n  }\n\n  void InitArcIterator(StateId s, ArcIteratorData<Arc> *data) const override {\n    return GetImpl()->InitArcIterator(s, data);\n  }\n\n  FstMatcher *InitMatcher(MatchType match_type) const override {\n    return new FstMatcher(&GetFst(), match_type, GetSharedData(match_type));\n  }\n\n  const FST &GetFst() const { return GetImpl()->GetFst(); }\n\n  const Data *GetAddOn() const { return GetImpl()->GetAddOn(); }\n\n  std::shared_ptr<Data> GetSharedAddOn() const {\n    return GetImpl()->GetSharedAddOn();\n  }\n\n  const MatcherData *GetData(MatchType match_type) const {\n    const auto *data = GetAddOn();\n    return match_type == MATCH_INPUT ? data->First() : data->Second();\n  }\n\n  std::shared_ptr<MatcherData> GetSharedData(MatchType match_type) const {\n    const auto *data = GetAddOn();\n    return match_type == MATCH_INPUT ? data->SharedFirst()\n                                     : data->SharedSecond();\n  }\n\n protected:\n  using ImplToFst<Impl, ExpandedFst<Arc>>::GetImpl;\n\n  static std::shared_ptr<Impl> CreateDataAndImpl(const FST &fst,\n                                                 const string &name) {\n    FstMatcher imatcher(fst, MATCH_INPUT);\n    FstMatcher omatcher(fst, MATCH_OUTPUT);\n    return CreateImpl(fst, name,\n                      std::make_shared<Data>(imatcher.GetSharedData(),\n                                             omatcher.GetSharedData()));\n  }\n\n  static std::shared_ptr<Impl> CreateDataAndImpl(const Fst<Arc> &fst,\n                                                 const string &name) {\n    FST result(fst);\n    return CreateDataAndImpl(result, name);\n  }\n\n  static std::shared_ptr<Impl> CreateImpl(const FST &fst, const string &name,\n                                          std::shared_ptr<Data> data) {\n    auto impl = std::make_shared<Impl>(fst, name);\n    impl->SetAddOn(data);\n    Init init(&impl);\n    return impl;\n  }\n\n  explicit MatcherFst(std::shared_ptr<Impl> impl)\n      : ImplToExpandedFst<Impl>(impl) {}\n\n private:\n  MatcherFst &operator=(const MatcherFst &) = delete;\n};\n\n// Specialization for MatcherFst.\ntemplate <class FST, class M, const char *Name, class Init>\nclass StateIterator<MatcherFst<FST, M, Name, Init>>\n    : public StateIterator<FST> {\n public:\n  explicit StateIterator(const MatcherFst<FST, M, Name, Init> &fst)\n      : StateIterator<FST>(fst.GetImpl()->GetFst()) {}\n};\n\n// Specialization for MatcherFst.\ntemplate <class FST, class M, const char *Name, class Init>\nclass ArcIterator<MatcherFst<FST, M, Name, Init>> : public ArcIterator<FST> {\n public:\n  using StateId = typename FST::Arc::StateId;\n\n  ArcIterator(const MatcherFst<FST, M, Name, Init> &fst,\n              typename FST::Arc::StateId s)\n      : ArcIterator<FST>(fst.GetImpl()->GetFst(), s) {}\n};\n\n// Specialization for MatcherFst.\ntemplate <class F, class M, const char *Name, class Init>\nclass Matcher<MatcherFst<F, M, Name, Init>> {\n public:\n  using FST = MatcherFst<F, M, Name, Init>;\n  using Arc = typename F::Arc;\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n\n  Matcher(const FST &fst, MatchType match_type)\n      : matcher_(fst.InitMatcher(match_type)) {}\n\n  Matcher(const Matcher<FST> &matcher) : matcher_(matcher.matcher_->Copy()) {}\n\n  Matcher<FST> *Copy() const { return new Matcher<FST>(*this); }\n\n  MatchType Type(bool test) const { return matcher_->Type(test); }\n\n  void SetState(StateId s) { matcher_->SetState(s); }\n\n  bool Find(Label label) { return matcher_->Find(label); }\n\n  bool Done() const { return matcher_->Done(); }\n\n  const Arc &Value() const { return matcher_->Value(); }\n\n  void Next() { matcher_->Next(); }\n\n  uint64_t Properties(uint64_t props) const { return matcher_->Properties(props); }\n\n  uint32_t Flags() const { return matcher_->Flags(); }\n\n private:\n  std::unique_ptr<M> matcher_;\n};\n\n// Specialization for MatcherFst.\ntemplate <class F, class M, const char *Name, class Init>\nclass LookAheadMatcher<MatcherFst<F, M, Name, Init>> {\n public:\n  using FST = MatcherFst<F, M, Name, Init>;\n  using Arc = typename F::Arc;\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  LookAheadMatcher(const FST &fst, MatchType match_type)\n      : matcher_(fst.InitMatcher(match_type)) {}\n\n  LookAheadMatcher(const LookAheadMatcher<FST> &matcher, bool safe = false)\n      : matcher_(matcher.matcher_->Copy(safe)) {}\n\n  // General matcher methods.\n  LookAheadMatcher<FST> *Copy(bool safe = false) const {\n    return new LookAheadMatcher<FST>(*this, safe);\n  }\n\n  MatchType Type(bool test) const { return matcher_->Type(test); }\n\n  void SetState(StateId s) { matcher_->SetState(s); }\n\n  bool Find(Label label) { return matcher_->Find(label); }\n\n  bool Done() const { return matcher_->Done(); }\n\n  const Arc &Value() const { return matcher_->Value(); }\n\n  void Next() { matcher_->Next(); }\n\n  const FST &GetFst() const { return matcher_->GetFst(); }\n\n  uint64_t Properties(uint64_t props) const { return matcher_->Properties(props); }\n\n  uint32_t Flags() const { return matcher_->Flags(); }\n\n  bool LookAheadLabel(Label label) const {\n    return matcher_->LookAheadLabel(label);\n  }\n\n  bool LookAheadFst(const Fst<Arc> &fst, StateId s) {\n    return matcher_->LookAheadFst(fst, s);\n  }\n\n  Weight LookAheadWeight() const { return matcher_->LookAheadWeight(); }\n\n  bool LookAheadPrefix(Arc *arc) const {\n    return matcher_->LookAheadPrefix(arc);\n  }\n\n  void InitLookAheadFst(const Fst<Arc> &fst, bool copy = false) {\n    matcher_->InitLookAheadFst(fst, copy);\n  }\n\n private:\n  std::unique_ptr<M> matcher_;\n};\n\n// Useful aliases when using StdArc.\n\nextern const char arc_lookahead_fst_type[];\n\nusing StdArcLookAheadFst =\n    MatcherFst<ConstFst<StdArc>,\n               ArcLookAheadMatcher<SortedMatcher<ConstFst<StdArc>>>,\n               arc_lookahead_fst_type>;\n\nextern const char ilabel_lookahead_fst_type[];\nextern const char olabel_lookahead_fst_type[];\n\nconstexpr auto ilabel_lookahead_flags =\n    kInputLookAheadMatcher | kLookAheadWeight | kLookAheadPrefix |\n    kLookAheadEpsilons | kLookAheadNonEpsilonPrefix;\n\nconstexpr auto olabel_lookahead_flags =\n    kOutputLookAheadMatcher | kLookAheadWeight | kLookAheadPrefix |\n    kLookAheadEpsilons | kLookAheadNonEpsilonPrefix;\n\nusing StdILabelLookAheadFst = MatcherFst<\n    ConstFst<StdArc>,\n    LabelLookAheadMatcher<SortedMatcher<ConstFst<StdArc>>,\n                          ilabel_lookahead_flags, FastLogAccumulator<StdArc>>,\n    ilabel_lookahead_fst_type, LabelLookAheadRelabeler<StdArc>>;\n\nusing StdOLabelLookAheadFst = MatcherFst<\n    ConstFst<StdArc>,\n    LabelLookAheadMatcher<SortedMatcher<ConstFst<StdArc>>,\n                          olabel_lookahead_flags, FastLogAccumulator<StdArc>>,\n    olabel_lookahead_fst_type, LabelLookAheadRelabeler<StdArc>>;\n\n}  // namespace fst\n\n#endif  // FST_MATCHER_FST_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/matcher.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Classes to allow matching labels leaving FST states.\n\n#ifndef FST_MATCHER_H_\n#define FST_MATCHER_H_\n\n#include <algorithm>\n#include <memory>\n#include <unordered_map>\n#include <utility>\n\n#include <fst/log.h>\n\n#include <fst/mutable-fst.h>  // for all internal FST accessors.\n\n\nnamespace fst {\n\n// Matchers find and iterate through requested labels at FST states. In the\n// simplest form, these are just some associative map or search keyed on labels.\n// More generally, they may implement matching special labels that represent\n// sets of labels such as sigma (all), rho (rest), or phi (fail). The Matcher\n// interface is:\n//\n// template <class F>\n// class Matcher {\n//  public:\n//   using FST = F;\n//   using Arc = typename FST::Arc;\n//   using Label = typename Arc::Label;\n//   using StateId = typename Arc::StateId;\n//   using Weight = typename Arc::Weight;\n//\n//   // Required constructors. Note:\n//   // -- the constructors that copy the FST arg are useful for\n//   // letting the matcher manage the FST through copies\n//   // (esp with 'safe' copies); e.g. ComposeFst depends on this.\n//   // -- the constructor that does not copy is useful when the\n//   // the FST is mutated during the lifetime of the matcher\n//   // (o.w. the matcher would have its own unmutated deep copy).\n//\n//   // This makes a copy of the FST.\n//   Matcher(const FST &fst, MatchType type);\n//   // This doesn't copy the FST.\n//   Matcher(const FST *fst, MatchType type);\n//   // This makes a copy of the FST.\n//   // See Copy() below.\n//   Matcher(const Matcher &matcher, bool safe = false);\n//\n//   // If safe = true, the copy is thread-safe. See Fst<>::Copy() for\n//   // further doc.\n//   Matcher<FST> *Copy(bool safe = false) const override;\n//\n//   // Returns the match type that can be provided (depending on compatibility\n//   of the input FST). It is either the requested match type, MATCH_NONE, or\n//   MATCH_UNKNOWN. If test is false, a costly testing is avoided, but\n//   MATCH_UNKNOWN may be returned. If test is true, a definite answer is\n//   returned, but may involve more costly computation (e.g., visiting the FST).\n//   MatchType Type(bool test) const override;\n//\n//   // Specifies the current state.\n//   void SetState(StateId s) final;\n//\n//   // Finds matches to a label at the current state, returning true if a match\n//   // found. kNoLabel matches any non-consuming transitions, e.g., epsilon\n//   // transitions, which do not require a matching symbol.\n//   bool Find(Label label) final;\n//\n//   // Iterator methods. Note that initially and after SetState() these have\n//   undefined behavior until Find() is called.\n//\n//   bool Done() const final;\n//\n//   const Arc &Value() const final;\n//\n//   void Next() final;\n//\n//   // Returns final weight of a state.\n//   Weight Final(StateId) const final;\n//\n//   // Indicates preference for being the side used for matching in\n//   // composition. If the value is kRequirePriority, then it is\n//   // mandatory that it be used. Calling this method without passing the\n//   // current state of the matcher invalidates the state of the matcher.\n//   std::ptrdiff_t Priority(StateId s) final;\n//\n//   // This specifies the known FST properties as viewed from this matcher. It\n//   // takes as argument the input FST's known properties.\n//   uint64_t Properties(uint64_t props) const override;\n//\n//   // Returns matcher flags.\n//   uint32_t Flags() const override;\n//\n//   // Returns matcher FST.\n//   const FST &GetFst() const override;\n// };\n\n// Basic matcher flags.\n\n// Matcher needs to be used as the matching side in composition for\n// at least one state (has kRequirePriority).\nconstexpr uint32_t kRequireMatch = 0x00000001;\n\n// Flags used for basic matchers (see also lookahead.h).\nconstexpr uint32_t kMatcherFlags = kRequireMatch;\n\n// Matcher priority that is mandatory.\nconstexpr std::ptrdiff_t kRequirePriority = -1;\n\n// Matcher interface, templated on the Arc definition; used for matcher\n// specializations that are returned by the InitMatcher FST method.\ntemplate <class A>\nclass MatcherBase {\n public:\n  using Arc = A;\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  virtual ~MatcherBase() {}\n\n  // Virtual interface.\n\n  virtual MatcherBase<Arc> *Copy(bool safe = false) const = 0;\n  virtual MatchType Type(bool) const = 0;\n  virtual void SetState(StateId) = 0;\n  virtual bool Find(Label) = 0;\n  virtual bool Done() const = 0;\n  virtual const Arc &Value() const = 0;\n  virtual void Next() = 0;\n  virtual const Fst<Arc> &GetFst() const = 0;\n  virtual uint64_t Properties(uint64_t) const = 0;\n\n  // Trivial implementations that can be used by derived classes. Full\n  // devirtualization is expected for any derived class marked final.\n  virtual uint32_t Flags() const { return 0; }\n\n  virtual Weight Final(StateId s) const { return internal::Final(GetFst(), s); }\n\n  virtual std::ptrdiff_t Priority(StateId s) { return internal::NumArcs(GetFst(), s); }\n};\n\n// A matcher that expects sorted labels on the side to be matched.\n// If match_type == MATCH_INPUT, epsilons match the implicit self-loop\n// Arc(kNoLabel, 0, Weight::One(), current_state) as well as any\n// actual epsilon transitions. If match_type == MATCH_OUTPUT, then\n// Arc(0, kNoLabel, Weight::One(), current_state) is instead matched.\ntemplate <class F>\nclass SortedMatcher : public MatcherBase<typename F::Arc> {\n public:\n  using FST = F;\n  using Arc = typename FST::Arc;\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using MatcherBase<Arc>::Flags;\n  using MatcherBase<Arc>::Properties;\n\n  // Labels >= binary_label will be searched for by binary search;\n  // o.w. linear search is used.\n  // This makes a copy of the FST.\n  SortedMatcher(const FST &fst, MatchType match_type, Label binary_label = 1)\n      : SortedMatcher(fst.Copy(), match_type, binary_label) {\n    owned_fst_.reset(&fst_);\n  }\n\n  // Labels >= binary_label will be searched for by binary search;\n  // o.w. linear search is used.\n  // This doesn't copy the FST.\n  SortedMatcher(const FST *fst, MatchType match_type, Label binary_label = 1)\n      : fst_(*fst),\n        state_(kNoStateId),\n        aiter_(nullptr),\n        match_type_(match_type),\n        binary_label_(binary_label),\n        match_label_(kNoLabel),\n        narcs_(0),\n        loop_(kNoLabel, 0, Weight::One(), kNoStateId),\n        error_(false),\n        aiter_pool_(1) {\n    switch (match_type_) {\n      case MATCH_INPUT:\n      case MATCH_NONE:\n        break;\n      case MATCH_OUTPUT:\n        std::swap(loop_.ilabel, loop_.olabel);\n        break;\n      default:\n        FSTERROR() << \"SortedMatcher: Bad match type\";\n        match_type_ = MATCH_NONE;\n        error_ = true;\n    }\n  }\n\n  // This makes a copy of the FST.\n  SortedMatcher(const SortedMatcher<FST> &matcher, bool safe = false)\n      : owned_fst_(matcher.fst_.Copy(safe)),\n        fst_(*owned_fst_),\n        state_(kNoStateId),\n        aiter_(nullptr),\n        match_type_(matcher.match_type_),\n        binary_label_(matcher.binary_label_),\n        match_label_(kNoLabel),\n        narcs_(0),\n        loop_(matcher.loop_),\n        error_(matcher.error_),\n        aiter_pool_(1) {}\n\n  ~SortedMatcher() override { Destroy(aiter_, &aiter_pool_); }\n\n  SortedMatcher<FST> *Copy(bool safe = false) const override {\n    return new SortedMatcher<FST>(*this, safe);\n  }\n\n  MatchType Type(bool test) const override {\n    if (match_type_ == MATCH_NONE) return match_type_;\n    const auto true_prop =\n        match_type_ == MATCH_INPUT ? kILabelSorted : kOLabelSorted;\n    const auto false_prop =\n        match_type_ == MATCH_INPUT ? kNotILabelSorted : kNotOLabelSorted;\n    const auto props = fst_.Properties(true_prop | false_prop, test);\n    if (props & true_prop) {\n      return match_type_;\n    } else if (props & false_prop) {\n      return MATCH_NONE;\n    } else {\n      return MATCH_UNKNOWN;\n    }\n  }\n\n  void SetState(StateId s) final {\n    if (state_ == s) return;\n    state_ = s;\n    if (match_type_ == MATCH_NONE) {\n      FSTERROR() << \"SortedMatcher: Bad match type\";\n      error_ = true;\n    }\n    Destroy(aiter_, &aiter_pool_);\n    aiter_ = new (&aiter_pool_) ArcIterator<FST>(fst_, s);\n    aiter_->SetFlags(kArcNoCache, kArcNoCache);\n    narcs_ = internal::NumArcs(fst_, s);\n    loop_.nextstate = s;\n  }\n\n  bool Find(Label match_label) final {\n    exact_match_ = true;\n    if (error_) {\n      current_loop_ = false;\n      match_label_ = kNoLabel;\n      return false;\n    }\n    current_loop_ = match_label == 0;\n    match_label_ = match_label == kNoLabel ? 0 : match_label;\n    if (Search()) {\n      return true;\n    } else {\n      return current_loop_;\n    }\n  }\n\n  // Positions matcher to the first position where inserting match_label would\n  // maintain the sort order.\n  void LowerBound(Label label) {\n    exact_match_ = false;\n    current_loop_ = false;\n    if (error_) {\n      match_label_ = kNoLabel;\n      return;\n    }\n    match_label_ = label;\n    Search();\n  }\n\n  // After Find(), returns false if no more exact matches.\n  // After LowerBound(), returns false if no more arcs.\n  bool Done() const final {\n    if (current_loop_) return false;\n    if (aiter_->Done()) return true;\n    if (!exact_match_) return false;\n    aiter_->SetFlags(match_type_ == MATCH_INPUT ?\n        kArcILabelValue : kArcOLabelValue,\n        kArcValueFlags);\n    return GetLabel() != match_label_;\n  }\n\n  const Arc &Value() const final {\n    if (current_loop_) return loop_;\n    aiter_->SetFlags(kArcValueFlags, kArcValueFlags);\n    return aiter_->Value();\n  }\n\n  void Next() final {\n    if (current_loop_) {\n      current_loop_ = false;\n    } else {\n      aiter_->Next();\n    }\n  }\n\n  Weight Final(StateId s) const final {\n    return MatcherBase<Arc>::Final(s);\n  }\n\n  std::ptrdiff_t Priority(StateId s) final {\n    return MatcherBase<Arc>::Priority(s);\n  }\n\n  const FST &GetFst() const override { return fst_; }\n\n  uint64_t Properties(uint64_t inprops) const override {\n    return inprops | (error_ ? kError : 0);\n  }\n\n  size_t Position() const { return aiter_ ? aiter_->Position() : 0; }\n\n private:\n  Label GetLabel() const {\n    const auto &arc = aiter_->Value();\n    return match_type_ == MATCH_INPUT ? arc.ilabel : arc.olabel;\n  }\n\n  bool BinarySearch();\n  bool LinearSearch();\n  bool Search();\n\n  std::unique_ptr<const FST> owned_fst_;   // FST ptr if owned.\n  const FST &fst_;           // FST for matching.\n  StateId state_;            // Matcher state.\n  ArcIterator<FST> *aiter_;  // Iterator for current state.\n  MatchType match_type_;     // Type of match to perform.\n  Label binary_label_;       // Least label for binary search.\n  Label match_label_;        // Current label to be matched.\n  size_t narcs_;             // Current state arc count.\n  Arc loop_;                 // For non-consuming symbols.\n  bool current_loop_;        // Current arc is the implicit loop.\n  bool exact_match_;         // Exact match or lower bound?\n  bool error_;               // Error encountered?\n  MemoryPool<ArcIterator<FST>> aiter_pool_;  // Pool of arc iterators.\n};\n\n// Returns true iff match to match_label_. The arc iterator is positioned at the\n// lower bound, that is, the first element greater than or equal to\n// match_label_, or the end if all elements are less than match_label_.\ntemplate <class FST>\ninline bool SortedMatcher<FST>::BinarySearch() {\n  size_t low = 0;\n  size_t high = narcs_;\n  while (low < high) {\n    const size_t mid = low + (high - low) / 2;\n    aiter_->Seek(mid);\n    if (GetLabel() < match_label_) {\n      low = mid + 1;\n    } else {\n      high = mid;\n    }\n  }\n\n  aiter_->Seek(low);\n  return low < narcs_ && GetLabel() == match_label_;\n}\n\n// Returns true iff match to match_label_, positioning arc iterator at lower\n// bound.\ntemplate <class FST>\ninline bool SortedMatcher<FST>::LinearSearch() {\n  for (aiter_->Reset(); !aiter_->Done(); aiter_->Next()) {\n    const auto label = GetLabel();\n    if (label == match_label_) return true;\n    if (label > match_label_) break;\n  }\n  return false;\n}\n\n// Returns true iff match to match_label_, positioning arc iterator at lower\n// bound.\ntemplate <class FST>\ninline bool SortedMatcher<FST>::Search() {\n  aiter_->SetFlags(match_type_ == MATCH_INPUT ?\n                   kArcILabelValue : kArcOLabelValue,\n                   kArcValueFlags);\n  if (match_label_ >= binary_label_) {\n    return BinarySearch();\n  } else {\n    return LinearSearch();\n  }\n}\n\n// A matcher that stores labels in a per-state hash table populated upon the\n// first visit to that state. Sorting is not required. Treatment of\n// epsilons are the same as with SortedMatcher.\ntemplate <class F>\nclass HashMatcher : public MatcherBase<typename F::Arc> {\n public:\n  using FST = F;\n  using Arc = typename FST::Arc;\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using MatcherBase<Arc>::Flags;\n  using MatcherBase<Arc>::Final;\n  using MatcherBase<Arc>::Priority;\n\n  // This makes a copy of the FST.\n  HashMatcher(const FST &fst, MatchType match_type)\n      : HashMatcher(fst.Copy(), match_type) {\n    owned_fst_.reset(&fst_);\n  }\n\n  // This doesn't copy the FST.\n  HashMatcher(const FST *fst, MatchType match_type)\n      : fst_(*fst),\n        state_(kNoStateId),\n        match_type_(match_type),\n        loop_(kNoLabel, 0, Weight::One(), kNoStateId),\n        error_(false),\n        state_table_(std::make_shared<StateTable>()) {\n    switch (match_type_) {\n      case MATCH_INPUT:\n      case MATCH_NONE:\n        break;\n      case MATCH_OUTPUT:\n        std::swap(loop_.ilabel, loop_.olabel);\n        break;\n      default:\n        FSTERROR() << \"HashMatcher: Bad match type\";\n        match_type_ = MATCH_NONE;\n        error_ = true;\n    }\n  }\n\n  // This makes a copy of the FST.\n  HashMatcher(const HashMatcher<FST> &matcher, bool safe = false)\n      : owned_fst_(matcher.fst_.Copy(safe)),\n        fst_(*owned_fst_),\n        state_(kNoStateId),\n        match_type_(matcher.match_type_),\n        loop_(matcher.loop_),\n        error_(matcher.error_),\n        state_table_(\n            safe ? std::make_shared<StateTable>() : matcher.state_table_) {}\n\n  HashMatcher<FST> *Copy(bool safe = false) const override {\n    return new HashMatcher<FST>(*this, safe);\n  }\n\n  // The argument is ignored as there are no relevant properties to test.\n  MatchType Type(bool test) const override { return match_type_; }\n\n  void SetState(StateId s) final;\n\n  bool Find(Label label) final {\n    current_loop_ = label == 0;\n    if (label == 0) {\n      Search(label);\n      return true;\n    }\n    if (label == kNoLabel) label = 0;\n    return Search(label);\n  }\n\n  bool Done() const final {\n    if (current_loop_) return false;\n    return label_it_ == label_end_;\n  }\n\n  const Arc &Value() const final {\n    if (current_loop_) return loop_;\n    aiter_->Seek(label_it_->second);\n    return aiter_->Value();\n  }\n\n  void Next() final {\n    if (current_loop_) {\n      current_loop_ = false;\n    } else {\n      ++label_it_;\n    }\n  }\n\n  const FST &GetFst() const override { return fst_; }\n\n  uint64_t Properties(uint64_t inprops) const override {\n    return inprops | (error_ ? kError : 0);\n  }\n\n private:\n  Label GetLabel() const {\n    const auto &arc = aiter_->Value();\n    return match_type_ == MATCH_INPUT ? arc.ilabel : arc.olabel;\n  }\n\n  bool Search(Label match_label);\n\n  using LabelTable = std::unordered_multimap<Label, size_t>;\n  using StateTable = std::unordered_map<StateId, std::unique_ptr<LabelTable>>;\n\n  std::unique_ptr<const FST> owned_fst_;  // ptr to FST if owned.\n  const FST &fst_;     // FST for matching.\n  StateId state_;      // Matcher state.\n  MatchType match_type_;\n  Arc loop_;            // The implicit loop itself.\n  bool current_loop_;   // Is the current arc the implicit loop?\n  bool error_;          // Error encountered?\n  std::unique_ptr<ArcIterator<FST>> aiter_;\n  std::shared_ptr<StateTable> state_table_;  // Table from state to label table.\n  LabelTable *label_table_;  // Pointer to current state's label table.\n  typename LabelTable::iterator label_it_;   // Position for label.\n  typename LabelTable::iterator label_end_;  // Position for last label + 1.\n};\n\ntemplate <class FST>\nvoid HashMatcher<FST>::SetState(typename FST::Arc::StateId s) {\n  if (state_ == s) return;\n  // Resets everything for the state.\n  state_ = s;\n  loop_.nextstate = state_;\n  aiter_.reset(new ArcIterator<FST>(fst_, state_));\n  if (match_type_ == MATCH_NONE) {\n    FSTERROR() << \"HashMatcher: Bad match type\";\n    error_ = true;\n  }\n  // Attempts to insert a new label table.\n  auto it_and_success = state_table_->emplace(\n    state_, std::unique_ptr<LabelTable>(new LabelTable()));\n  // Sets instance's pointer to the label table for this state.\n  label_table_ = it_and_success.first->second.get();\n  // If it already exists, no additional work is done and we simply return.\n  if (!it_and_success.second) return;\n  // Otherwise, populate this new table.\n  // Populates the label table.\n  label_table_->reserve(internal::NumArcs(fst_, state_));\n  const auto aiter_flags =\n      (match_type_ == MATCH_INPUT ? kArcILabelValue : kArcOLabelValue) |\n      kArcNoCache;\n  aiter_->SetFlags(aiter_flags, kArcFlags);\n  for (; !aiter_->Done(); aiter_->Next()) {\n    label_table_->emplace(GetLabel(), aiter_->Position());\n  }\n  aiter_->SetFlags(kArcValueFlags, kArcValueFlags);\n}\n\ntemplate <class FST>\ninline bool HashMatcher<FST>::Search(typename FST::Arc::Label match_label) {\n  auto range = label_table_->equal_range(match_label);\n  label_it_ = range.first;\n  label_end_ = range.second;\n  if (label_it_ == label_end_) return false;\n  aiter_->Seek(label_it_->second);\n  return true;\n}\n\n// Specifies whether we rewrite both the input and output sides during matching.\nenum MatcherRewriteMode {\n  MATCHER_REWRITE_AUTO = 0,  // Rewrites both sides iff acceptor.\n  MATCHER_REWRITE_ALWAYS,\n  MATCHER_REWRITE_NEVER\n};\n\n// For any requested label that doesn't match at a state, this matcher\n// considers the *unique* transition that matches the label 'phi_label'\n// (phi = 'fail'), and recursively looks for a match at its\n// destination.  When 'phi_loop' is true, if no match is found but a\n// phi self-loop is found, then the phi transition found is returned\n// with the phi_label rewritten as the requested label (both sides if\n// an acceptor, or if 'rewrite_both' is true and both input and output\n// labels of the found transition are 'phi_label').  If 'phi_label' is\n// kNoLabel, this special matching is not done.  PhiMatcher is\n// templated itself on a matcher, which is used to perform the\n// underlying matching.  By default, the underlying matcher is\n// constructed by PhiMatcher. The user can instead pass in this\n// object; in that case, PhiMatcher takes its ownership.\n// Phi non-determinism not supported. No non-consuming symbols other\n// than epsilon supported with the underlying template argument matcher.\ntemplate <class M>\nclass PhiMatcher : public MatcherBase<typename M::Arc> {\n public:\n  using FST = typename M::FST;\n  using Arc = typename FST::Arc;\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  // This makes a copy of the FST (w/o 'matcher' arg).\n  PhiMatcher(const FST &fst, MatchType match_type, Label phi_label = kNoLabel,\n             bool phi_loop = true,\n             MatcherRewriteMode rewrite_mode = MATCHER_REWRITE_AUTO,\n             M *matcher = nullptr)\n      : matcher_(matcher ? matcher : new M(fst, match_type)),\n        match_type_(match_type),\n        phi_label_(phi_label),\n        state_(kNoStateId),\n        phi_loop_(phi_loop),\n        error_(false) {\n    if (match_type == MATCH_BOTH) {\n      FSTERROR() << \"PhiMatcher: Bad match type\";\n      match_type_ = MATCH_NONE;\n      error_ = true;\n    }\n    if (rewrite_mode == MATCHER_REWRITE_AUTO) {\n      rewrite_both_ = fst.Properties(kAcceptor, true);\n    } else if (rewrite_mode == MATCHER_REWRITE_ALWAYS) {\n      rewrite_both_ = true;\n    } else {\n      rewrite_both_ = false;\n    }\n  }\n\n  // This doesn't copy the FST.\n  PhiMatcher(const FST *fst, MatchType match_type, Label phi_label = kNoLabel,\n             bool phi_loop = true,\n             MatcherRewriteMode rewrite_mode = MATCHER_REWRITE_AUTO,\n             M *matcher = nullptr)\n      : PhiMatcher(*fst, match_type, phi_label, phi_loop, rewrite_mode,\n                   matcher ? matcher : new M(fst, match_type)) { }\n\n\n  // This makes a copy of the FST.\n  PhiMatcher(const PhiMatcher<M> &matcher, bool safe = false)\n      : matcher_(new M(*matcher.matcher_, safe)),\n        match_type_(matcher.match_type_),\n        phi_label_(matcher.phi_label_),\n        rewrite_both_(matcher.rewrite_both_),\n        state_(kNoStateId),\n        phi_loop_(matcher.phi_loop_),\n        error_(matcher.error_) {}\n\n  PhiMatcher<M> *Copy(bool safe = false) const override {\n    return new PhiMatcher<M>(*this, safe);\n  }\n\n  MatchType Type(bool test) const override { return matcher_->Type(test); }\n\n  void SetState(StateId s) final {\n    if (state_ == s) return;\n    matcher_->SetState(s);\n    state_ = s;\n    has_phi_ = phi_label_ != kNoLabel;\n  }\n\n  bool Find(Label match_label) final;\n\n  bool Done() const final { return matcher_->Done(); }\n\n  const Arc &Value() const final {\n    if ((phi_match_ == kNoLabel) && (phi_weight_ == Weight::One())) {\n      return matcher_->Value();\n    } else if (phi_match_ == 0) {  // Virtual epsilon loop.\n      phi_arc_ = Arc(kNoLabel, 0, Weight::One(), state_);\n      if (match_type_ == MATCH_OUTPUT) {\n        std::swap(phi_arc_.ilabel, phi_arc_.olabel);\n      }\n      return phi_arc_;\n    } else {\n      phi_arc_ = matcher_->Value();\n      phi_arc_.weight = Times(phi_weight_, phi_arc_.weight);\n      if (phi_match_ != kNoLabel) {  // Phi loop match.\n        if (rewrite_both_) {\n          if (phi_arc_.ilabel == phi_label_) phi_arc_.ilabel = phi_match_;\n          if (phi_arc_.olabel == phi_label_) phi_arc_.olabel = phi_match_;\n        } else if (match_type_ == MATCH_INPUT) {\n          phi_arc_.ilabel = phi_match_;\n        } else {\n          phi_arc_.olabel = phi_match_;\n        }\n      }\n      return phi_arc_;\n    }\n  }\n\n  void Next() final { matcher_->Next(); }\n\n  Weight Final(StateId s) const final {\n    auto weight = matcher_->Final(s);\n    if (phi_label_ == kNoLabel || weight != Weight::Zero()) {\n      return weight;\n    }\n    weight = Weight::One();\n    matcher_->SetState(s);\n    while (matcher_->Final(s) == Weight::Zero()) {\n      if (!matcher_->Find(phi_label_ == 0 ? -1 : phi_label_)) break;\n      weight = Times(weight, matcher_->Value().weight);\n      if (s == matcher_->Value().nextstate) {\n        return Weight::Zero();  // Does not follow phi self-loops.\n      }\n      s = matcher_->Value().nextstate;\n      matcher_->SetState(s);\n    }\n    weight = Times(weight, matcher_->Final(s));\n    return weight;\n  }\n\n  std::ptrdiff_t Priority(StateId s) final {\n    if (phi_label_ != kNoLabel) {\n      matcher_->SetState(s);\n      const bool has_phi = matcher_->Find(phi_label_ == 0 ? -1 : phi_label_);\n      return has_phi ? kRequirePriority : matcher_->Priority(s);\n    } else {\n      return matcher_->Priority(s);\n    }\n  }\n\n  const FST &GetFst() const override { return matcher_->GetFst(); }\n\n  uint64_t Properties(uint64_t props) const override;\n\n  uint32_t Flags() const override {\n    if (phi_label_ == kNoLabel || match_type_ == MATCH_NONE) {\n      return matcher_->Flags();\n    }\n    return matcher_->Flags() | kRequireMatch;\n  }\n\n  Label PhiLabel() const { return phi_label_; }\n\n private:\n  mutable std::unique_ptr<M> matcher_;\n  MatchType match_type_;  // Type of match requested.\n  Label phi_label_;       // Label that represents the phi transition.\n  bool rewrite_both_;     // Rewrite both sides when both are phi_label_?\n  bool has_phi_;          // Are there possibly phis at the current state?\n  Label phi_match_;       // Current label that matches phi loop.\n  mutable Arc phi_arc_;   // Arc to return.\n  StateId state_;         // Matcher state.\n  Weight phi_weight_;     // Product of the weights of phi transitions taken.\n  bool phi_loop_;         // When true, phi self-loop are allowed and treated\n                          // as rho (required for Aho-Corasick).\n  bool error_;            // Error encountered?\n\n  PhiMatcher &operator=(const PhiMatcher &) = delete;\n};\n\ntemplate <class M>\ninline bool PhiMatcher<M>::Find(Label label) {\n  if (label == phi_label_ && phi_label_ != kNoLabel && phi_label_ != 0) {\n    FSTERROR() << \"PhiMatcher::Find: bad label (phi): \" << phi_label_;\n    error_ = true;\n    return false;\n  }\n  matcher_->SetState(state_);\n  phi_match_ = kNoLabel;\n  phi_weight_ = Weight::One();\n  // If phi_label_ == 0, there are no more true epsilon arcs.\n  if (phi_label_ == 0) {\n    if (label == kNoLabel) {\n      return false;\n    }\n    if (label == 0) {  // but a virtual epsilon loop needs to be returned.\n      if (!matcher_->Find(kNoLabel)) {\n        return matcher_->Find(0);\n      } else {\n        phi_match_ = 0;\n        return true;\n      }\n    }\n  }\n  if (!has_phi_ || label == 0 || label == kNoLabel) {\n    return matcher_->Find(label);\n  }\n  auto s = state_;\n  while (!matcher_->Find(label)) {\n    // Look for phi transition (if phi_label_ == 0, we need to look\n    // for -1 to avoid getting the virtual self-loop)\n    if (!matcher_->Find(phi_label_ == 0 ? -1 : phi_label_)) return false;\n    if (phi_loop_ && matcher_->Value().nextstate == s) {\n      phi_match_ = label;\n      return true;\n    }\n    phi_weight_ = Times(phi_weight_, matcher_->Value().weight);\n    s = matcher_->Value().nextstate;\n    matcher_->Next();\n    if (!matcher_->Done()) {\n      FSTERROR() << \"PhiMatcher: Phi non-determinism not supported\";\n      error_ = true;\n    }\n    matcher_->SetState(s);\n  }\n  return true;\n}\n\ntemplate <class M>\ninline uint64_t PhiMatcher<M>::Properties(uint64_t inprops) const {\n  auto outprops = matcher_->Properties(inprops);\n  if (error_) outprops |= kError;\n  if (match_type_ == MATCH_NONE) {\n    return outprops;\n  } else if (match_type_ == MATCH_INPUT) {\n    if (phi_label_ == 0) {\n      outprops &= ~kEpsilons | ~kIEpsilons | ~kOEpsilons;\n      outprops |= kNoEpsilons | kNoIEpsilons;\n    }\n    if (rewrite_both_) {\n      return outprops &\n             ~(kODeterministic | kNonODeterministic | kString | kILabelSorted |\n               kNotILabelSorted | kOLabelSorted | kNotOLabelSorted);\n    } else {\n      return outprops &\n             ~(kODeterministic | kAcceptor | kString | kILabelSorted |\n               kNotILabelSorted | kOLabelSorted | kNotOLabelSorted);\n    }\n  } else if (match_type_ == MATCH_OUTPUT) {\n    if (phi_label_ == 0) {\n      outprops &= ~kEpsilons | ~kIEpsilons | ~kOEpsilons;\n      outprops |= kNoEpsilons | kNoOEpsilons;\n    }\n    if (rewrite_both_) {\n      return outprops &\n             ~(kIDeterministic | kNonIDeterministic | kString | kILabelSorted |\n               kNotILabelSorted | kOLabelSorted | kNotOLabelSorted);\n    } else {\n      return outprops &\n             ~(kIDeterministic | kAcceptor | kString | kILabelSorted |\n               kNotILabelSorted | kOLabelSorted | kNotOLabelSorted);\n    }\n  } else {\n    // Shouldn't ever get here.\n    FSTERROR() << \"PhiMatcher: Bad match type: \" << match_type_;\n    return 0;\n  }\n}\n\n// For any requested label that doesn't match at a state, this matcher\n// considers all transitions that match the label 'rho_label' (rho =\n// 'rest').  Each such rho transition found is returned with the\n// rho_label rewritten as the requested label (both sides if an\n// acceptor, or if 'rewrite_both' is true and both input and output\n// labels of the found transition are 'rho_label').  If 'rho_label' is\n// kNoLabel, this special matching is not done.  RhoMatcher is\n// templated itself on a matcher, which is used to perform the\n// underlying matching.  By default, the underlying matcher is\n// constructed by RhoMatcher.  The user can instead pass in this\n// object; in that case, RhoMatcher takes its ownership.\n// No non-consuming symbols other than epsilon supported with\n// the underlying template argument matcher.\ntemplate <class M>\nclass RhoMatcher : public MatcherBase<typename M::Arc> {\n public:\n  using FST = typename M::FST;\n  using Arc = typename FST::Arc;\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  // This makes a copy of the FST (w/o 'matcher' arg).\n  RhoMatcher(const FST &fst, MatchType match_type, Label rho_label = kNoLabel,\n             MatcherRewriteMode rewrite_mode = MATCHER_REWRITE_AUTO,\n             M *matcher = nullptr)\n      : matcher_(matcher ? matcher : new M(fst, match_type)),\n        match_type_(match_type),\n        rho_label_(rho_label),\n        error_(false),\n        state_(kNoStateId),\n        has_rho_(false) {\n    if (match_type == MATCH_BOTH) {\n      FSTERROR() << \"RhoMatcher: Bad match type\";\n      match_type_ = MATCH_NONE;\n      error_ = true;\n    }\n    if (rho_label == 0) {\n      FSTERROR() << \"RhoMatcher: 0 cannot be used as rho_label\";\n      rho_label_ = kNoLabel;\n      error_ = true;\n    }\n    if (rewrite_mode == MATCHER_REWRITE_AUTO) {\n      rewrite_both_ = fst.Properties(kAcceptor, true);\n    } else if (rewrite_mode == MATCHER_REWRITE_ALWAYS) {\n      rewrite_both_ = true;\n    } else {\n      rewrite_both_ = false;\n    }\n  }\n\n  // This doesn't copy the FST.\n  RhoMatcher(const FST *fst, MatchType match_type, Label rho_label = kNoLabel,\n             MatcherRewriteMode rewrite_mode = MATCHER_REWRITE_AUTO,\n             M *matcher = nullptr)\n      : RhoMatcher(*fst, match_type, rho_label, rewrite_mode,\n                   matcher ? matcher : new M(fst, match_type)) { }\n\n  // This makes a copy of the FST.\n  RhoMatcher(const RhoMatcher<M> &matcher, bool safe = false)\n      : matcher_(new M(*matcher.matcher_, safe)),\n        match_type_(matcher.match_type_),\n        rho_label_(matcher.rho_label_),\n        rewrite_both_(matcher.rewrite_both_),\n        error_(matcher.error_),\n        state_(kNoStateId),\n        has_rho_(false) {}\n\n  RhoMatcher<M> *Copy(bool safe = false) const override {\n    return new RhoMatcher<M>(*this, safe);\n  }\n\n  MatchType Type(bool test) const override { return matcher_->Type(test); }\n\n  void SetState(StateId s) final {\n    if (state_ == s) return;\n    state_ = s;\n    matcher_->SetState(s);\n    has_rho_ = rho_label_ != kNoLabel;\n  }\n\n  bool Find(Label label) final {\n    if (label == rho_label_ && rho_label_ != kNoLabel) {\n      FSTERROR() << \"RhoMatcher::Find: bad label (rho)\";\n      error_ = true;\n      return false;\n    }\n    if (matcher_->Find(label)) {\n      rho_match_ = kNoLabel;\n      return true;\n    } else if (has_rho_ && label != 0 && label != kNoLabel &&\n               (has_rho_ = matcher_->Find(rho_label_))) {\n      rho_match_ = label;\n      return true;\n    } else {\n      return false;\n    }\n  }\n\n  bool Done() const final { return matcher_->Done(); }\n\n  const Arc &Value() const final {\n    if (rho_match_ == kNoLabel) {\n      return matcher_->Value();\n    } else {\n      rho_arc_ = matcher_->Value();\n      if (rewrite_both_) {\n        if (rho_arc_.ilabel == rho_label_) rho_arc_.ilabel = rho_match_;\n        if (rho_arc_.olabel == rho_label_) rho_arc_.olabel = rho_match_;\n      } else if (match_type_ == MATCH_INPUT) {\n        rho_arc_.ilabel = rho_match_;\n      } else {\n        rho_arc_.olabel = rho_match_;\n      }\n      return rho_arc_;\n    }\n  }\n\n  void Next() final { matcher_->Next(); }\n\n  Weight Final(StateId s) const final { return matcher_->Final(s); }\n\n  std::ptrdiff_t Priority(StateId s) final {\n    state_ = s;\n    matcher_->SetState(s);\n    has_rho_ = matcher_->Find(rho_label_);\n    if (has_rho_) {\n      return kRequirePriority;\n    } else {\n      return matcher_->Priority(s);\n    }\n  }\n\n  const FST &GetFst() const override { return matcher_->GetFst(); }\n\n  uint64_t Properties(uint64_t props) const override;\n\n  uint32_t Flags() const override {\n    if (rho_label_ == kNoLabel || match_type_ == MATCH_NONE) {\n      return matcher_->Flags();\n    }\n    return matcher_->Flags() | kRequireMatch;\n  }\n\n  Label RhoLabel() const { return rho_label_; }\n\n private:\n  std::unique_ptr<M> matcher_;\n  MatchType match_type_;  // Type of match requested.\n  Label rho_label_;       // Label that represents the rho transition\n  bool rewrite_both_;     // Rewrite both sides when both are rho_label_?\n  Label rho_match_;       // Current label that matches rho transition.\n  mutable Arc rho_arc_;   // Arc to return when rho match.\n  bool error_;            // Error encountered?\n  StateId state_;         // Matcher state.\n  bool has_rho_;          // Are there possibly rhos at the current state?\n};\n\ntemplate <class M>\ninline uint64_t RhoMatcher<M>::Properties(uint64_t inprops) const {\n  auto outprops = matcher_->Properties(inprops);\n  if (error_) outprops |= kError;\n  if (match_type_ == MATCH_NONE) {\n    return outprops;\n  } else if (match_type_ == MATCH_INPUT) {\n    if (rewrite_both_) {\n      return outprops &\n             ~(kODeterministic | kNonODeterministic | kString | kILabelSorted |\n               kNotILabelSorted | kOLabelSorted | kNotOLabelSorted);\n    } else {\n      return outprops &\n             ~(kODeterministic | kAcceptor | kString | kILabelSorted |\n               kNotILabelSorted);\n    }\n  } else if (match_type_ == MATCH_OUTPUT) {\n    if (rewrite_both_) {\n      return outprops &\n             ~(kIDeterministic | kNonIDeterministic | kString | kILabelSorted |\n               kNotILabelSorted | kOLabelSorted | kNotOLabelSorted);\n    } else {\n      return outprops &\n             ~(kIDeterministic | kAcceptor | kString | kOLabelSorted |\n               kNotOLabelSorted);\n    }\n  } else {\n    // Shouldn't ever get here.\n    FSTERROR() << \"RhoMatcher: Bad match type: \" << match_type_;\n    return 0;\n  }\n}\n\n// For any requested label, this matcher considers all transitions\n// that match the label 'sigma_label' (sigma = \"any\"), and this in\n// additions to transitions with the requested label.  Each such sigma\n// transition found is returned with the sigma_label rewritten as the\n// requested label (both sides if an acceptor, or if 'rewrite_both' is\n// true and both input and output labels of the found transition are\n// 'sigma_label').  If 'sigma_label' is kNoLabel, this special\n// matching is not done.  SigmaMatcher is templated itself on a\n// matcher, which is used to perform the underlying matching.  By\n// default, the underlying matcher is constructed by SigmaMatcher.\n// The user can instead pass in this object; in that case,\n// SigmaMatcher takes its ownership.  No non-consuming symbols other\n// than epsilon supported with the underlying template argument matcher.\ntemplate <class M>\nclass SigmaMatcher : public MatcherBase<typename M::Arc> {\n public:\n  using FST = typename M::FST;\n  using Arc = typename FST::Arc;\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  // This makes a copy of the FST (w/o 'matcher' arg).\n  SigmaMatcher(const FST &fst, MatchType match_type,\n               Label sigma_label = kNoLabel,\n               MatcherRewriteMode rewrite_mode = MATCHER_REWRITE_AUTO,\n               M *matcher = nullptr)\n      : matcher_(matcher ? matcher : new M(fst, match_type)),\n        match_type_(match_type),\n        sigma_label_(sigma_label),\n        error_(false),\n        state_(kNoStateId) {\n    if (match_type == MATCH_BOTH) {\n      FSTERROR() << \"SigmaMatcher: Bad match type\";\n      match_type_ = MATCH_NONE;\n      error_ = true;\n    }\n    if (sigma_label == 0) {\n      FSTERROR() << \"SigmaMatcher: 0 cannot be used as sigma_label\";\n      sigma_label_ = kNoLabel;\n      error_ = true;\n    }\n    if (rewrite_mode == MATCHER_REWRITE_AUTO) {\n      rewrite_both_ = fst.Properties(kAcceptor, true);\n    } else if (rewrite_mode == MATCHER_REWRITE_ALWAYS) {\n      rewrite_both_ = true;\n    } else {\n      rewrite_both_ = false;\n    }\n  }\n\n  // This doesn't copy the FST.\n  SigmaMatcher(const FST *fst, MatchType match_type,\n               Label sigma_label = kNoLabel,\n               MatcherRewriteMode rewrite_mode = MATCHER_REWRITE_AUTO,\n             M *matcher = nullptr)\n      : SigmaMatcher(*fst, match_type, sigma_label, rewrite_mode,\n                     matcher ? matcher : new M(fst, match_type)) { }\n\n  // This makes a copy of the FST.\n  SigmaMatcher(const SigmaMatcher<M> &matcher, bool safe = false)\n      : matcher_(new M(*matcher.matcher_, safe)),\n        match_type_(matcher.match_type_),\n        sigma_label_(matcher.sigma_label_),\n        rewrite_both_(matcher.rewrite_both_),\n        error_(matcher.error_),\n        state_(kNoStateId) {}\n\n  SigmaMatcher<M> *Copy(bool safe = false) const override {\n    return new SigmaMatcher<M>(*this, safe);\n  }\n\n  MatchType Type(bool test) const override { return matcher_->Type(test); }\n\n  void SetState(StateId s) final {\n    if (state_ == s) return;\n    state_ = s;\n    matcher_->SetState(s);\n    has_sigma_ =\n        (sigma_label_ != kNoLabel) ? matcher_->Find(sigma_label_) : false;\n  }\n\n  bool Find(Label match_label) final {\n    match_label_ = match_label;\n    if (match_label == sigma_label_ && sigma_label_ != kNoLabel) {\n      FSTERROR() << \"SigmaMatcher::Find: bad label (sigma)\";\n      error_ = true;\n      return false;\n    }\n    if (matcher_->Find(match_label)) {\n      sigma_match_ = kNoLabel;\n      return true;\n    } else if (has_sigma_ && match_label != 0 && match_label != kNoLabel &&\n               matcher_->Find(sigma_label_)) {\n      sigma_match_ = match_label;\n      return true;\n    } else {\n      return false;\n    }\n  }\n\n  bool Done() const final { return matcher_->Done(); }\n\n  const Arc &Value() const final {\n    if (sigma_match_ == kNoLabel) {\n      return matcher_->Value();\n    } else {\n      sigma_arc_ = matcher_->Value();\n      if (rewrite_both_) {\n        if (sigma_arc_.ilabel == sigma_label_) sigma_arc_.ilabel = sigma_match_;\n        if (sigma_arc_.olabel == sigma_label_) sigma_arc_.olabel = sigma_match_;\n      } else if (match_type_ == MATCH_INPUT) {\n        sigma_arc_.ilabel = sigma_match_;\n      } else {\n        sigma_arc_.olabel = sigma_match_;\n      }\n      return sigma_arc_;\n    }\n  }\n\n  void Next() final {\n    matcher_->Next();\n    if (matcher_->Done() && has_sigma_ && (sigma_match_ == kNoLabel) &&\n        (match_label_ > 0)) {\n      matcher_->Find(sigma_label_);\n      sigma_match_ = match_label_;\n    }\n  }\n\n  Weight Final(StateId s) const final { return matcher_->Final(s); }\n\n  std::ptrdiff_t Priority(StateId s) final {\n    if (sigma_label_ != kNoLabel) {\n      SetState(s);\n      return has_sigma_ ? kRequirePriority : matcher_->Priority(s);\n    } else {\n      return matcher_->Priority(s);\n    }\n  }\n\n  const FST &GetFst() const override { return matcher_->GetFst(); }\n\n  uint64_t Properties(uint64_t props) const override;\n\n  uint32_t Flags() const override {\n    if (sigma_label_ == kNoLabel || match_type_ == MATCH_NONE) {\n      return matcher_->Flags();\n    }\n    return matcher_->Flags() | kRequireMatch;\n  }\n\n  Label SigmaLabel() const { return sigma_label_; }\n\n private:\n  std::unique_ptr<M> matcher_;\n  MatchType match_type_;   // Type of match requested.\n  Label sigma_label_;      // Label that represents the sigma transition.\n  bool rewrite_both_;      // Rewrite both sides when both are sigma_label_?\n  bool has_sigma_;         // Are there sigmas at the current state?\n  Label sigma_match_;      // Current label that matches sigma transition.\n  mutable Arc sigma_arc_;  // Arc to return when sigma match.\n  Label match_label_;      // Label being matched.\n  bool error_;             // Error encountered?\n  StateId state_;          // Matcher state.\n};\n\ntemplate <class M>\ninline uint64_t SigmaMatcher<M>::Properties(uint64_t inprops) const {\n  auto outprops = matcher_->Properties(inprops);\n  if (error_) outprops |= kError;\n  if (match_type_ == MATCH_NONE) {\n    return outprops;\n  } else if (rewrite_both_) {\n    return outprops &\n           ~(kIDeterministic | kNonIDeterministic | kODeterministic |\n             kNonODeterministic | kILabelSorted | kNotILabelSorted |\n             kOLabelSorted | kNotOLabelSorted | kString);\n  } else if (match_type_ == MATCH_INPUT) {\n    return outprops &\n           ~(kIDeterministic | kNonIDeterministic | kODeterministic |\n             kNonODeterministic | kILabelSorted | kNotILabelSorted | kString |\n             kAcceptor);\n  } else if (match_type_ == MATCH_OUTPUT) {\n    return outprops &\n           ~(kIDeterministic | kNonIDeterministic | kODeterministic |\n             kNonODeterministic | kOLabelSorted | kNotOLabelSorted | kString |\n             kAcceptor);\n  } else {\n    // Shouldn't ever get here.\n    FSTERROR() << \"SigmaMatcher: Bad match type: \" << match_type_;\n    return 0;\n  }\n}\n\n// Flags for MultiEpsMatcher.\n\n// Return multi-epsilon arcs for Find(kNoLabel).\nconst uint32_t kMultiEpsList = 0x00000001;\n\n// Return a kNolabel loop for Find(multi_eps).\nconst uint32_t kMultiEpsLoop = 0x00000002;\n\n// MultiEpsMatcher: allows treating multiple non-0 labels as\n// non-consuming labels in addition to 0 that is always\n// non-consuming. Precise behavior controlled by 'flags' argument. By\n// default, the underlying matcher is constructed by\n// MultiEpsMatcher. The user can instead pass in this object; in that\n// case, MultiEpsMatcher takes its ownership iff 'own_matcher' is\n// true.\ntemplate <class M>\nclass MultiEpsMatcher {\n public:\n  using FST = typename M::FST;\n  using Arc = typename FST::Arc;\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  // This makes a copy of the FST (w/o 'matcher' arg).\n  MultiEpsMatcher(const FST &fst, MatchType match_type,\n                  uint32_t flags = (kMultiEpsLoop | kMultiEpsList),\n                  M *matcher = nullptr, bool own_matcher = true)\n      : matcher_(matcher ? matcher : new M(fst, match_type)),\n        flags_(flags),\n        own_matcher_(matcher ? own_matcher : true) {\n    Init(match_type);\n  }\n\n  // This doesn't copy the FST.\n  MultiEpsMatcher(const FST *fst, MatchType match_type,\n                  uint32_t flags = (kMultiEpsLoop | kMultiEpsList),\n                  M *matcher = nullptr, bool own_matcher = true)\n      : matcher_(matcher ? matcher : new M(fst, match_type)),\n        flags_(flags),\n        own_matcher_(matcher ? own_matcher : true) {\n    Init(match_type);\n  }\n\n  // This makes a copy of the FST.\n  MultiEpsMatcher(const MultiEpsMatcher<M> &matcher, bool safe = false)\n      : matcher_(new M(*matcher.matcher_, safe)),\n        flags_(matcher.flags_),\n        own_matcher_(true),\n        multi_eps_labels_(matcher.multi_eps_labels_),\n        loop_(matcher.loop_) {\n    loop_.nextstate = kNoStateId;\n  }\n\n  ~MultiEpsMatcher() {\n    if (own_matcher_) delete matcher_;\n  }\n\n  MultiEpsMatcher<M> *Copy(bool safe = false) const {\n    return new MultiEpsMatcher<M>(*this, safe);\n  }\n\n  MatchType Type(bool test) const { return matcher_->Type(test); }\n\n  void SetState(StateId state) {\n    matcher_->SetState(state);\n    loop_.nextstate = state;\n  }\n\n  bool Find(Label label);\n\n  bool Done() const { return done_; }\n\n  const Arc &Value() const { return current_loop_ ? loop_ : matcher_->Value(); }\n\n  void Next() {\n    if (!current_loop_) {\n      matcher_->Next();\n      done_ = matcher_->Done();\n      if (done_ && multi_eps_iter_ != multi_eps_labels_.End()) {\n        ++multi_eps_iter_;\n        while ((multi_eps_iter_ != multi_eps_labels_.End()) &&\n               !matcher_->Find(*multi_eps_iter_)) {\n          ++multi_eps_iter_;\n        }\n        if (multi_eps_iter_ != multi_eps_labels_.End()) {\n          done_ = false;\n        } else {\n          done_ = !matcher_->Find(kNoLabel);\n        }\n      }\n    } else {\n      done_ = true;\n    }\n  }\n\n  const FST &GetFst() const { return matcher_->GetFst(); }\n\n  uint64_t Properties(uint64_t props) const { return matcher_->Properties(props); }\n\n  const M *GetMatcher() const { return matcher_; }\n\n  Weight Final(StateId s) const { return matcher_->Final(s); }\n\n  uint32_t Flags() const { return matcher_->Flags(); }\n\n  std::ptrdiff_t Priority(StateId s) { return matcher_->Priority(s); }\n\n  void AddMultiEpsLabel(Label label) {\n    if (label == 0) {\n      FSTERROR() << \"MultiEpsMatcher: Bad multi-eps label: 0\";\n    } else {\n      multi_eps_labels_.Insert(label);\n    }\n  }\n\n  void RemoveMultiEpsLabel(Label label) {\n    if (label == 0) {\n      FSTERROR() << \"MultiEpsMatcher: Bad multi-eps label: 0\";\n    } else {\n      multi_eps_labels_.Erase(label);\n    }\n  }\n\n  void ClearMultiEpsLabels() { multi_eps_labels_.Clear(); }\n\n private:\n  void Init(MatchType match_type) {\n    if (match_type == MATCH_INPUT) {\n      loop_.ilabel = kNoLabel;\n      loop_.olabel = 0;\n    } else {\n      loop_.ilabel = 0;\n      loop_.olabel = kNoLabel;\n    }\n    loop_.weight = Weight::One();\n    loop_.nextstate = kNoStateId;\n  }\n\n  M *matcher_;\n  uint32_t flags_;\n  bool own_matcher_;  // Does this class delete the matcher?\n\n  // Multi-eps label set.\n  CompactSet<Label, kNoLabel> multi_eps_labels_;\n  typename CompactSet<Label, kNoLabel>::const_iterator multi_eps_iter_;\n\n  bool current_loop_;  // Current arc is the implicit loop?\n  mutable Arc loop_;   // For non-consuming symbols.\n  bool done_;          // Matching done?\n\n  MultiEpsMatcher &operator=(const MultiEpsMatcher &) = delete;\n};\n\ntemplate <class M>\ninline bool MultiEpsMatcher<M>::Find(Label label) {\n  multi_eps_iter_ = multi_eps_labels_.End();\n  current_loop_ = false;\n  bool ret;\n  if (label == 0) {\n    ret = matcher_->Find(0);\n  } else if (label == kNoLabel) {\n    if (flags_ & kMultiEpsList) {\n      // Returns all non-consuming arcs (including epsilon).\n      multi_eps_iter_ = multi_eps_labels_.Begin();\n      while ((multi_eps_iter_ != multi_eps_labels_.End()) &&\n             !matcher_->Find(*multi_eps_iter_)) {\n        ++multi_eps_iter_;\n      }\n      if (multi_eps_iter_ != multi_eps_labels_.End()) {\n        ret = true;\n      } else {\n        ret = matcher_->Find(kNoLabel);\n      }\n    } else {\n      // Returns all epsilon arcs.\n      ret = matcher_->Find(kNoLabel);\n    }\n  } else if ((flags_ & kMultiEpsLoop) &&\n             multi_eps_labels_.Find(label) != multi_eps_labels_.End()) {\n    // Returns implicit loop.\n    current_loop_ = true;\n    ret = true;\n  } else {\n    ret = matcher_->Find(label);\n  }\n  done_ = !ret;\n  return ret;\n}\n\n// This class discards any implicit matches (e.g., the implicit epsilon\n// self-loops in the SortedMatcher). Matchers are most often used in\n// composition/intersection where the implicit matches are needed\n// e.g. for epsilon processing. However, if a matcher is simply being\n// used to look-up explicit label matches, this class saves the user\n// from having to check for and discard the unwanted implicit matches\n// themselves.\ntemplate <class M>\nclass ExplicitMatcher : public MatcherBase<typename M::Arc> {\n public:\n  using FST = typename M::FST;\n  using Arc = typename FST::Arc;\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  // This makes a copy of the FST.\n  ExplicitMatcher(const FST &fst, MatchType match_type, M *matcher = nullptr)\n      : matcher_(matcher ? matcher : new M(fst, match_type)),\n        match_type_(match_type),\n        error_(false) {}\n\n  // This doesn't copy the FST.\n  ExplicitMatcher(const FST *fst, MatchType match_type, M *matcher = nullptr)\n      : matcher_(matcher ? matcher : new M(fst, match_type)),\n        match_type_(match_type),\n        error_(false) {}\n\n  // This makes a copy of the FST.\n  ExplicitMatcher(const ExplicitMatcher<M> &matcher, bool safe = false)\n      : matcher_(new M(*matcher.matcher_, safe)),\n        match_type_(matcher.match_type_),\n        error_(matcher.error_) {}\n\n  ExplicitMatcher<M> *Copy(bool safe = false) const override {\n    return new ExplicitMatcher<M>(*this, safe);\n  }\n\n  MatchType Type(bool test) const override { return matcher_->Type(test); }\n\n  void SetState(StateId s) final { matcher_->SetState(s); }\n\n  bool Find(Label label) final {\n    matcher_->Find(label);\n    CheckArc();\n    return !Done();\n  }\n\n  bool Done() const final { return matcher_->Done(); }\n\n  const Arc &Value() const final { return matcher_->Value(); }\n\n  void Next() final {\n    matcher_->Next();\n    CheckArc();\n  }\n\n  Weight Final(StateId s) const final { return matcher_->Final(s); }\n\n  std::ptrdiff_t Priority(StateId s) final { return matcher_->Priority(s); }\n\n  const FST &GetFst() const final { return matcher_->GetFst(); }\n\n  uint64_t Properties(uint64_t inprops) const override {\n    return matcher_->Properties(inprops);\n  }\n\n  const M *GetMatcher() const { return matcher_.get(); }\n\n  uint32_t Flags() const override { return matcher_->Flags(); }\n\n private:\n  // Checks current arc if available and explicit. If not available, stops. If\n  // not explicit, checks next ones.\n  void CheckArc() {\n    for (; !matcher_->Done(); matcher_->Next()) {\n      const auto label = match_type_ == MATCH_INPUT ? matcher_->Value().ilabel\n                                                    : matcher_->Value().olabel;\n      if (label != kNoLabel) return;\n    }\n  }\n\n  std::unique_ptr<M> matcher_;\n  MatchType match_type_;  // Type of match requested.\n  bool error_;            // Error encountered?\n};\n\n// Generic matcher, templated on the FST definition.\n//\n// Here is a typical use:\n//\n//   Matcher<StdFst> matcher(fst, MATCH_INPUT);\n//   matcher.SetState(state);\n//   if (matcher.Find(label))\n//     for (; !matcher.Done(); matcher.Next()) {\n//       auto &arc = matcher.Value();\n//       ...\n//     }\ntemplate <class F>\nclass Matcher {\n public:\n  using FST = F;\n  using Arc = typename F::Arc;\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  // This makes a copy of the FST.\n  Matcher(const FST &fst, MatchType match_type)\n      : owned_fst_(fst.Copy()),\n        base_(owned_fst_->InitMatcher(match_type)) {\n    if (!base_) base_.reset(new SortedMatcher<FST>(owned_fst_.get(),\n                                                   match_type));\n  }\n\n  // This doesn't copy the FST.\n  Matcher(const FST *fst, MatchType match_type)\n      : base_(fst->InitMatcher(match_type)) {\n    if (!base_) base_.reset(new SortedMatcher<FST>(fst, match_type));\n  }\n\n  // This makes a copy of the FST.\n  Matcher(const Matcher<FST> &matcher, bool safe = false)\n      : base_(matcher.base_->Copy(safe)) { }\n\n  // Takes ownership of the provided matcher.\n  explicit Matcher(MatcherBase<Arc> *base_matcher)\n      : base_(base_matcher) { }\n\n  Matcher<FST> *Copy(bool safe = false) const {\n    return new Matcher<FST>(*this, safe);\n  }\n\n  MatchType Type(bool test) const { return base_->Type(test); }\n\n  void SetState(StateId s) { base_->SetState(s); }\n\n  bool Find(Label label) { return base_->Find(label); }\n\n  bool Done() const { return base_->Done(); }\n\n  const Arc &Value() const { return base_->Value(); }\n\n  void Next() { base_->Next(); }\n\n  const FST &GetFst() const {\n    return static_cast<const FST &>(base_->GetFst());\n  }\n\n  uint64_t Properties(uint64_t props) const { return base_->Properties(props); }\n\n  Weight Final(StateId s) const { return base_->Final(s); }\n\n  uint32_t Flags() const { return base_->Flags() & kMatcherFlags; }\n\n  std::ptrdiff_t Priority(StateId s) { return base_->Priority(s); }\n\n private:\n  std::unique_ptr<const FST> owned_fst_;\n  std::unique_ptr<MatcherBase<Arc>> base_;\n};\n\n}  // namespace fst\n\n#endif  // FST_MATCHER_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/memory.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// FST memory utilities.\n\n#ifndef FST_MEMORY_H_\n#define FST_MEMORY_H_\n\n#include <list>\n#include <memory>\n#include <utility>\n#include <vector>\n\n#include <fst/types.h>\n#include <fst/log.h>\n#include <fstream>\n\nnamespace fst {\n\n// Default block allocation size.\nconstexpr int kAllocSize = 64;\n\n// Minimum number of allocations per block.\nconstexpr int kAllocFit = 4;\n\n// Base class for MemoryArena that allows (e.g.) MemoryArenaCollection to\n// easily manipulate collections of variously sized arenas.\nclass MemoryArenaBase {\n public:\n  virtual ~MemoryArenaBase() {}\n  virtual size_t Size() const = 0;\n};\n\nnamespace internal {\n\n// Allocates 'size' unintialized memory chunks of size object_size from\n// underlying blocks of (at least) size 'block_size * object_size'.\n// All blocks are freed when this class is deleted. Result of allocate() will\n// be aligned to object_size.\ntemplate <size_t object_size>\nclass MemoryArenaImpl : public MemoryArenaBase {\n public:\n  enum { kObjectSize = object_size };\n\n  explicit MemoryArenaImpl(size_t block_size = kAllocSize)\n      : block_size_(block_size * kObjectSize), block_pos_(0) {\n    blocks_.emplace_front(new char[block_size_]);\n  }\n\n  void *Allocate(size_t size) {\n    const auto byte_size = size * kObjectSize;\n    if (byte_size * kAllocFit > block_size_) {\n      // Large block; adds new large block.\n      auto *ptr = new char[byte_size];\n      blocks_.emplace_back(ptr);\n      return ptr;\n    }\n    if (block_pos_ + byte_size > block_size_) {\n      // Doesn't fit; adds new standard block.\n      auto *ptr = new char[block_size_];\n      block_pos_ = 0;\n      blocks_.emplace_front(ptr);\n    }\n    // Fits; uses current block.\n    auto *ptr = blocks_.front().get() + block_pos_;\n    block_pos_ += byte_size;\n    return ptr;\n  }\n\n  size_t Size() const override { return kObjectSize; }\n\n private:\n  const size_t block_size_;  // Default block size in bytes.\n  size_t block_pos_;   // Current position in block in bytes.\n  std::list<std::unique_ptr<char[]>> blocks_;  // List of allocated blocks.\n};\n\n}  // namespace internal\n\ntemplate <typename T>\nusing MemoryArena = internal::MemoryArenaImpl<sizeof(T)>;\n\n// Base class for MemoryPool that allows (e.g.) MemoryPoolCollection to easily\n// manipulate collections of variously sized pools.\nclass MemoryPoolBase {\n public:\n  virtual ~MemoryPoolBase() {}\n  virtual size_t Size() const = 0;\n};\n\nnamespace internal {\n\n// Allocates and frees initially uninitialized memory chunks of size\n// object_size. Keeps an internal list of freed chunks that are reused (as is)\n// on the next allocation if available. Chunks are constructed in blocks of size\n// 'pool_size'.\ntemplate <size_t object_size>\nclass MemoryPoolImpl : public MemoryPoolBase {\n public:\n  enum { kObjectSize = object_size };\n\n  struct Link {\n    char buf[kObjectSize];\n    Link *next;\n  };\n\n  explicit MemoryPoolImpl(size_t pool_size)\n      : mem_arena_(pool_size), free_list_(nullptr) {}\n\n  void *Allocate() {\n    if (free_list_ == nullptr) {\n      auto *link = static_cast<Link *>(mem_arena_.Allocate(1));\n      link->next = nullptr;\n      return link;\n    } else {\n      auto *link = free_list_;\n      free_list_ = link->next;\n      return link;\n    }\n  }\n\n  void Free(void *ptr) {\n    if (ptr) {\n      auto *link = static_cast<Link *>(ptr);\n      link->next = free_list_;\n      free_list_ = link;\n    }\n  }\n\n  size_t Size() const override { return kObjectSize; }\n\n private:\n  MemoryArena<Link> mem_arena_;\n  Link *free_list_;\n\n  MemoryPoolImpl(const MemoryPoolImpl &) = delete;\n  MemoryPoolImpl &operator=(const MemoryPoolImpl &) = delete;\n};\n\n}  // namespace internal\n\n// Allocates and frees initially uninitialized memory chunks of size sizeof(T).\n// All memory is freed when the class is deleted. The result of Allocate() will\n// be suitably memory-aligned. Combined with placement operator new and destroy\n// functions for the T class, this can be used to improve allocation efficiency.\n// See nlp/fst/lib/visit.h (global new) and nlp/fst/lib/dfs-visit.h (class new)\n// for examples.\ntemplate <typename T>\nclass MemoryPool : public internal::MemoryPoolImpl<sizeof(T)> {\n public:\n  // 'pool_size' specifies the size of the initial pool and how it is extended.\n  MemoryPool(size_t pool_size = kAllocSize)\n      : internal::MemoryPoolImpl<sizeof(T)>(pool_size) {}\n};\n\n// Stores a collection of memory arenas.\nclass MemoryArenaCollection {\n public:\n  // 'block_size' specifies the block size of the arenas.\n  explicit MemoryArenaCollection(size_t block_size = kAllocSize)\n      : block_size_(block_size), ref_count_(1) {}\n\n  template <typename T>\n  MemoryArena<T> *Arena() {\n    if (sizeof(T) >= arenas_.size()) arenas_.resize(sizeof(T) + 1);\n    MemoryArenaBase *arena = arenas_[sizeof(T)].get();\n    if (arena == nullptr) {\n      arena = new MemoryArena<T>(block_size_);\n      arenas_[sizeof(T)].reset(arena);\n    }\n    return static_cast<MemoryArena<T> *>(arena);\n  }\n\n  size_t BlockSize() const { return block_size_; }\n\n  size_t RefCount() const { return ref_count_; }\n\n  size_t IncrRefCount() { return ++ref_count_; }\n\n  size_t DecrRefCount() { return --ref_count_; }\n\n private:\n  size_t block_size_;\n  size_t ref_count_;\n  std::vector<std::unique_ptr<MemoryArenaBase>> arenas_;\n};\n\n// Stores a collection of memory pools\nclass MemoryPoolCollection {\n public:\n  // 'pool_size' specifies the size of initial pool and how it is extended.\n  explicit MemoryPoolCollection(size_t pool_size = kAllocSize)\n      : pool_size_(pool_size), ref_count_(1) {}\n\n  template <typename T>\n  MemoryPool<T> *Pool() {\n    if (sizeof(T) >= pools_.size()) pools_.resize(sizeof(T) + 1);\n    MemoryPoolBase *pool = pools_[sizeof(T)].get();\n    if (pool == nullptr) {\n      pool = new MemoryPool<T>(pool_size_);\n      pools_[sizeof(T)].reset(pool);\n    }\n    return static_cast<MemoryPool<T> *>(pool);\n  }\n\n  size_t PoolSize() const { return pool_size_; }\n\n  size_t RefCount() const { return ref_count_; }\n\n  size_t IncrRefCount() { return ++ref_count_; }\n\n  size_t DecrRefCount() { return --ref_count_; }\n\n private:\n  size_t pool_size_;\n  size_t ref_count_;\n  std::vector<std::unique_ptr<MemoryPoolBase>> pools_;\n};\n\n// STL allocator using memory arenas. Memory is allocated from underlying\n// blocks of size 'block_size * sizeof(T)'. Memory is freed only when all\n// objects using this allocator are destroyed and there is otherwise no reuse\n// (unlike PoolAllocator).\n//\n// This allocator has object-local state so it should not be used with splicing\n// or swapping operations between objects created with different allocators nor\n// should it be used if copies must be thread-safe. The result of allocate()\n// will be suitably memory-aligned.\ntemplate <typename T>\nclass BlockAllocator {\n public:\n  using Allocator = std::allocator<T>;\n  using size_type = typename Allocator::size_type;\n  using difference_type = typename Allocator::difference_type;\n  using pointer = typename Allocator::pointer;\n  using const_pointer = typename Allocator::const_pointer;\n  using reference = typename Allocator::reference;\n  using const_reference = typename Allocator::const_reference;\n  using value_type = typename Allocator::value_type;\n\n  template <typename U>\n  struct rebind {\n    using other = BlockAllocator<U>;\n  };\n\n  explicit BlockAllocator(size_t block_size = kAllocSize)\n      : arenas_(new MemoryArenaCollection(block_size)) {}\n\n  BlockAllocator(const BlockAllocator<T> &arena_alloc)\n      : arenas_(arena_alloc.Arenas()) {\n    Arenas()->IncrRefCount();\n  }\n\n  template <typename U>\n  explicit BlockAllocator(const BlockAllocator<U> &arena_alloc)\n      : arenas_(arena_alloc.Arenas()) {\n    Arenas()->IncrRefCount();\n  }\n\n  ~BlockAllocator() {\n    if (Arenas()->DecrRefCount() == 0) delete Arenas();\n  }\n\n  pointer address(reference ref) const { return Allocator().address(ref); }\n\n  const_pointer address(const_reference ref) const {\n    return Allocator().address(ref);\n  }\n\n  size_type max_size() const { return Allocator().max_size(); }\n\n  template <class U, class... Args>\n  void construct(U *p, Args &&... args) {\n    Allocator().construct(p, std::forward<Args>(args)...);\n  }\n\n  void destroy(pointer p) { Allocator().destroy(p); }\n\n  pointer allocate(size_type n, const void *hint = nullptr) {\n    if (n * kAllocFit <= kAllocSize) {\n      return static_cast<pointer>(Arena()->Allocate(n));\n    } else {\n      return Allocator().allocate(n, hint);\n    }\n  }\n\n  void deallocate(pointer p, size_type n) {\n    if (n * kAllocFit > kAllocSize) Allocator().deallocate(p, n);\n  }\n\n  MemoryArenaCollection *Arenas() const { return arenas_; }\n\n private:\n  MemoryArena<T> *Arena() { return arenas_->Arena<T>(); }\n\n  MemoryArenaCollection *arenas_;\n\n  BlockAllocator<T> operator=(const BlockAllocator<T> &);\n};\n\ntemplate <typename T, typename U>\nbool operator==(const BlockAllocator<T> &alloc1,\n                const BlockAllocator<U> &alloc2) {\n  return false;\n}\n\ntemplate <typename T, typename U>\nbool operator!=(const BlockAllocator<T> &alloc1,\n                const BlockAllocator<U> &alloc2) {\n  return true;\n}\n\n// STL allocator using memory pools. Memory is allocated from underlying\n// blocks of size 'block_size * sizeof(T)'. Keeps an internal list of freed\n// chunks thare are reused on the next allocation.\n//\n// This allocator has object-local state so it should not be used with splicing\n// or swapping operations between objects created with different allocators nor\n// should it be used if copies must be thread-safe. The result of allocate()\n// will be suitably memory-aligned.\ntemplate <typename T>\nclass PoolAllocator {\n public:\n  using Allocator = std::allocator<T>;\n  using size_type = typename Allocator::size_type;\n  using difference_type = typename Allocator::difference_type;\n  using pointer = typename Allocator::pointer;\n  using const_pointer = typename Allocator::const_pointer;\n  using reference = typename Allocator::reference;\n  using const_reference = typename Allocator::const_reference;\n  using value_type = typename Allocator::value_type;\n\n  template <typename U>\n  struct rebind {\n    using other = PoolAllocator<U>;\n  };\n\n  explicit PoolAllocator(size_t pool_size = kAllocSize)\n      : pools_(new MemoryPoolCollection(pool_size)) {}\n\n  PoolAllocator(const PoolAllocator<T> &pool_alloc)\n      : pools_(pool_alloc.Pools()) {\n    Pools()->IncrRefCount();\n  }\n\n  template <typename U>\n  explicit PoolAllocator(const PoolAllocator<U> &pool_alloc)\n      : pools_(pool_alloc.Pools()) {\n    Pools()->IncrRefCount();\n  }\n\n  ~PoolAllocator() {\n    if (Pools()->DecrRefCount() == 0) delete Pools();\n  }\n\n  pointer address(reference ref) const { return Allocator().address(ref); }\n\n  const_pointer address(const_reference ref) const {\n    return Allocator().address(ref);\n  }\n\n  size_type max_size() const { return Allocator().max_size(); }\n\n  template <class U, class... Args>\n  void construct(U *p, Args &&... args) {\n    Allocator().construct(p, std::forward<Args>(args)...);\n  }\n\n  void destroy(pointer p) { Allocator().destroy(p); }\n\n  pointer allocate(size_type n, const void *hint = nullptr) {\n    if (n == 1) {\n      return static_cast<pointer>(Pool<1>()->Allocate());\n    } else if (n == 2) {\n      return static_cast<pointer>(Pool<2>()->Allocate());\n    } else if (n <= 4) {\n      return static_cast<pointer>(Pool<4>()->Allocate());\n    } else if (n <= 8) {\n      return static_cast<pointer>(Pool<8>()->Allocate());\n    } else if (n <= 16) {\n      return static_cast<pointer>(Pool<16>()->Allocate());\n    } else if (n <= 32) {\n      return static_cast<pointer>(Pool<32>()->Allocate());\n    } else if (n <= 64) {\n      return static_cast<pointer>(Pool<64>()->Allocate());\n    } else {\n      return Allocator().allocate(n, hint);\n    }\n  }\n\n  void deallocate(pointer p, size_type n) {\n    if (n == 1) {\n      Pool<1>()->Free(p);\n    } else if (n == 2) {\n      Pool<2>()->Free(p);\n    } else if (n <= 4) {\n      Pool<4>()->Free(p);\n    } else if (n <= 8) {\n      Pool<8>()->Free(p);\n    } else if (n <= 16) {\n      Pool<16>()->Free(p);\n    } else if (n <= 32) {\n      Pool<32>()->Free(p);\n    } else if (n <= 64) {\n      Pool<64>()->Free(p);\n    } else {\n      Allocator().deallocate(p, n);\n    }\n  }\n\n  MemoryPoolCollection *Pools() const { return pools_; }\n\n private:\n  template <int n>\n  struct TN {\n    T buf[n];\n  };\n\n  template <int n>\n  MemoryPool<TN<n>> *Pool() {\n    return pools_->Pool<TN<n>>();\n  }\n\n  MemoryPoolCollection *pools_;\n\n  PoolAllocator<T> operator=(const PoolAllocator<T> &);\n};\n\ntemplate <typename T, typename U>\nbool operator==(const PoolAllocator<T> &alloc1,\n                const PoolAllocator<U> &alloc2) {\n  return false;\n}\n\ntemplate <typename T, typename U>\nbool operator!=(const PoolAllocator<T> &alloc1,\n                const PoolAllocator<U> &alloc2) {\n  return true;\n}\n\n}  // namespace fst\n\n#endif  // FST_MEMORY_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/minimize.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Functions and classes to minimize an FST.\n\n#ifndef FST_MINIMIZE_H_\n#define FST_MINIMIZE_H_\n\n#include <cmath>\n\n#include <algorithm>\n#include <map>\n#include <queue>\n#include <utility>\n#include <vector>\n\n#include <fst/log.h>\n\n#include <fst/arcsort.h>\n#include <fst/connect.h>\n#include <fst/dfs-visit.h>\n#include <fst/encode.h>\n#include <fst/factor-weight.h>\n#include <fst/fst.h>\n#include <fst/mutable-fst.h>\n#include <fst/partition.h>\n#include <fst/push.h>\n#include <fst/queue.h>\n#include <fst/reverse.h>\n#include <fst/shortest-distance.h>\n#include <fst/state-map.h>\n\n\nnamespace fst {\nnamespace internal {\n\n// Comparator for creating partition.\ntemplate <class Arc>\nclass StateComparator {\n public:\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  StateComparator(const Fst<Arc> &fst, const Partition<StateId> &partition)\n      : fst_(fst), partition_(partition) {}\n\n  // Compares state x with state y based on sort criteria.\n  bool operator()(const StateId x, const StateId y) const {\n    // Checks for final state equivalence.\n    const auto xfinal = fst_.Final(x).Hash();\n    const auto yfinal = fst_.Final(y).Hash();\n    if (xfinal < yfinal) {\n      return true;\n    } else if (xfinal > yfinal) {\n      return false;\n    }\n    // Checks for number of arcs.\n    if (fst_.NumArcs(x) < fst_.NumArcs(y)) return true;\n    if (fst_.NumArcs(x) > fst_.NumArcs(y)) return false;\n    // If the number of arcs are equal, checks for arc match.\n    for (ArcIterator<Fst<Arc>> aiter1(fst_, x), aiter2(fst_, y);\n         !aiter1.Done() && !aiter2.Done(); aiter1.Next(), aiter2.Next()) {\n      const auto &arc1 = aiter1.Value();\n      const auto &arc2 = aiter2.Value();\n      if (arc1.ilabel < arc2.ilabel) return true;\n      if (arc1.ilabel > arc2.ilabel) return false;\n      if (partition_.ClassId(arc1.nextstate) <\n          partition_.ClassId(arc2.nextstate))\n        return true;\n      if (partition_.ClassId(arc1.nextstate) >\n          partition_.ClassId(arc2.nextstate))\n        return false;\n    }\n    return false;\n  }\n\n private:\n  const Fst<Arc> &fst_;\n  const Partition<StateId> &partition_;\n};\n\n// Computes equivalence classes for cyclic unweighted acceptors. For cyclic\n// minimization we use the classic Hopcroft minimization algorithm, which has\n// complexity O(E log V) where E is the number of arcs and V is the number of\n// states.\n//\n// For more information, see:\n//\n//  Hopcroft, J. 1971. An n Log n algorithm for minimizing states in a finite\n//  automaton. Ms, Stanford University.\n//\n// Note: the original presentation of the paper was for a finite automaton (==\n// deterministic, unweighted acceptor), but we also apply it to the\n// nondeterministic case, where it is also applicable as long as the semiring is\n// idempotent (if the semiring is not idempotent, there are some complexities\n// in keeping track of the weight when there are multiple arcs to states that\n// will be merged, and we don't deal with this).\ntemplate <class Arc, class Queue>\nclass CyclicMinimizer {\n public:\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using ClassId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n  using RevArc = ReverseArc<Arc>;\n\n  explicit CyclicMinimizer(const ExpandedFst<Arc> &fst) {\n    Initialize(fst);\n    Compute(fst);\n  }\n\n  const Partition<StateId> &GetPartition() const { return P_; }\n\n private:\n  // StateILabelHasher is a hashing object that computes a hash-function\n  // of an FST state that depends only on the set of ilabels on arcs leaving\n  // the state [note: it assumes that the arcs are ilabel-sorted].\n  // In order to work correctly for non-deterministic automata, multiple\n  // instances of the same ilabel count the same as a single instance.\n  class StateILabelHasher {\n   public:\n    explicit StateILabelHasher(const Fst<Arc> &fst) : fst_(fst) {}\n\n    using Label = typename Arc::Label;\n    using StateId = typename Arc::StateId;\n\n    size_t operator()(const StateId s) {\n      const size_t p1 = 7603;\n      const size_t p2 = 433024223;\n      size_t result = p2;\n      size_t current_ilabel = kNoLabel;\n      for (ArcIterator<Fst<Arc>> aiter(fst_, s); !aiter.Done(); aiter.Next()) {\n        Label this_ilabel = aiter.Value().ilabel;\n        if (this_ilabel != current_ilabel) {  // Ignores repeats.\n          result = p1 * result + this_ilabel;\n          current_ilabel = this_ilabel;\n        }\n      }\n      return result;\n    }\n\n   private:\n    const Fst<Arc> &fst_;\n  };\n\n  class ArcIterCompare {\n   public:\n    explicit ArcIterCompare(const Partition<StateId> &partition)\n        : partition_(partition) {}\n\n    ArcIterCompare(const ArcIterCompare &comp) : partition_(comp.partition_) {}\n\n    // Compares two iterators based on their input labels.\n    bool operator()(const ArcIterator<Fst<RevArc>> *x,\n                    const ArcIterator<Fst<RevArc>> *y) const {\n      const auto &xarc = x->Value();\n      const auto &yarc = y->Value();\n      return xarc.ilabel > yarc.ilabel;\n    }\n\n   private:\n    const Partition<StateId> &partition_;\n  };\n\n  using ArcIterQueue =\n      std::priority_queue<ArcIterator<Fst<RevArc>> *,\n                          std::vector<ArcIterator<Fst<RevArc>> *>,\n                          ArcIterCompare>;\n\n private:\n  // Prepartitions the space into equivalence classes. We ensure that final and\n  // non-final states always go into different equivalence classes, and we use\n  // class StateILabelHasher to make sure that most of the time, states with\n  // different sets of ilabels on arcs leaving them, go to different partitions.\n  // Note: for the O(n) guarantees we don't rely on the goodness of this\n  // hashing function---it just provides a bonus speedup.\n  void PrePartition(const ExpandedFst<Arc> &fst) {\n    VLOG(5) << \"PrePartition\";\n    StateId next_class = 0;\n    auto num_states = fst.NumStates();\n    // Allocates a temporary vector to store the initial class mappings, so that\n    // we can allocate the classes all at once.\n    std::vector<StateId> state_to_initial_class(num_states);\n    {\n      // We maintain two maps from hash-value to class---one for final states\n      // (final-prob == One()) and one for non-final states\n      // (final-prob == Zero()). We are processing unweighted acceptors, so the\n      // are the only two possible values.\n      using HashToClassMap = std::unordered_map<size_t, StateId>;\n      HashToClassMap hash_to_class_nonfinal;\n      HashToClassMap hash_to_class_final;\n      StateILabelHasher hasher(fst);\n      for (StateId s = 0; s < num_states; ++s) {\n        size_t hash = hasher(s);\n        HashToClassMap &this_map =\n            (fst.Final(s) != Weight::Zero() ? hash_to_class_final\n                                            : hash_to_class_nonfinal);\n        // Avoids two map lookups by using 'insert' instead of 'find'.\n        auto p = this_map.insert(std::make_pair(hash, next_class));\n        state_to_initial_class[s] = p.second ? next_class++ : p.first->second;\n      }\n      // Lets the unordered_maps go out of scope before we allocate the classes,\n      // to reduce the maximum amount of memory used.\n    }\n    P_.AllocateClasses(next_class);\n    for (StateId s = 0; s < num_states; ++s) {\n      P_.Add(s, state_to_initial_class[s]);\n    }\n    for (StateId c = 0; c < next_class; ++c) L_.Enqueue(c);\n    VLOG(5) << \"Initial Partition: \" << P_.NumClasses();\n  }\n\n  // Creates inverse transition Tr_ = rev(fst), loops over states in FST and\n  // splits on final, creating two blocks in the partition corresponding to\n  // final, non-final.\n  void Initialize(const ExpandedFst<Arc> &fst) {\n    // Constructs Tr.\n    Reverse(fst, &Tr_);\n    ILabelCompare<RevArc> ilabel_comp;\n    ArcSort(&Tr_, ilabel_comp);\n    // Tells the partition how many elements to allocate. The first state in\n    // Tr_ is super-final state.\n    P_.Initialize(Tr_.NumStates() - 1);\n    // Prepares initial partition.\n    PrePartition(fst);\n    // Allocates arc iterator queue.\n    ArcIterCompare comp(P_);\n    aiter_queue_.reset(new ArcIterQueue(comp));\n  }\n  // Partitions all classes with destination C.\n  void Split(ClassId C) {\n    // Prepares priority queue: opens arc iterator for each state in C, and\n    // inserts into priority queue.\n    for (PartitionIterator<StateId> siter(P_, C); !siter.Done(); siter.Next()) {\n      StateId s = siter.Value();\n      if (Tr_.NumArcs(s + 1)) {\n        aiter_queue_->push(new ArcIterator<Fst<RevArc>>(Tr_, s + 1));\n      }\n    }\n    // Now pops arc iterator from queue, splits entering equivalence class, and\n    // re-inserts updated iterator into queue.\n    Label prev_label = -1;\n    while (!aiter_queue_->empty()) {\n      std::unique_ptr<ArcIterator<Fst<RevArc>>> aiter(aiter_queue_->top());\n      aiter_queue_->pop();\n      if (aiter->Done()) continue;\n      const auto &arc = aiter->Value();\n      auto from_state = aiter->Value().nextstate - 1;\n      auto from_label = arc.ilabel;\n      if (prev_label != from_label) P_.FinalizeSplit(&L_);\n      auto from_class = P_.ClassId(from_state);\n      if (P_.ClassSize(from_class) > 1) P_.SplitOn(from_state);\n      prev_label = from_label;\n      aiter->Next();\n      if (!aiter->Done()) aiter_queue_->push(aiter.release());\n    }\n    P_.FinalizeSplit(&L_);\n  }\n\n  // Main loop for Hopcroft minimization.\n  void Compute(const Fst<Arc> &fst) {\n    // Processes active classes (FIFO, or FILO).\n    while (!L_.Empty()) {\n      const auto C = L_.Head();\n      L_.Dequeue();\n      Split(C);  // Splits on C, all labels in C.\n    }\n  }\n\n private:\n  // Partioning of states into equivalence classes.\n  Partition<StateId> P_;\n  // Set of active classes to be processed in partition P.\n  Queue L_;\n  // Reverses transition function.\n  VectorFst<RevArc> Tr_;\n  // Priority queue of open arc iterators for all states in the splitter\n  // equivalence class.\n  std::unique_ptr<ArcIterQueue> aiter_queue_;\n};\n\n// Computes equivalence classes for acyclic FST.\n//\n// Complexity:\n//\n//   O(E)\n//\n// where E is the number of arcs.\n//\n// For more information, see:\n//\n// Revuz, D. 1992. Minimization of acyclic deterministic automata in linear\n// time. Theoretical Computer Science 92(1): 181-189.\ntemplate <class Arc>\nclass AcyclicMinimizer {\n public:\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using ClassId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  explicit AcyclicMinimizer(const ExpandedFst<Arc> &fst) {\n    Initialize(fst);\n    Refine(fst);\n  }\n\n  const Partition<StateId> &GetPartition() { return partition_; }\n\n private:\n  // DFS visitor to compute the height (distance) to final state.\n  class HeightVisitor {\n   public:\n    HeightVisitor() : max_height_(0), num_states_(0) {}\n\n    // Invoked before DFS visit.\n    void InitVisit(const Fst<Arc> &fst) {}\n\n    // Invoked when state is discovered (2nd arg is DFS tree root).\n    bool InitState(StateId s, StateId root) {\n      // Extends height array and initialize height (distance) to 0.\n      for (StateId i = height_.size(); i <= s; ++i) height_.push_back(-1);\n      if (s >= num_states_) num_states_ = s + 1;\n      return true;\n    }\n\n    // Invoked when tree arc examined (to undiscovered state).\n    bool TreeArc(StateId s, const Arc &arc) { return true; }\n\n    // Invoked when back arc examined (to unfinished state).\n    bool BackArc(StateId s, const Arc &arc) { return true; }\n\n    // Invoked when forward or cross arc examined (to finished state).\n    bool ForwardOrCrossArc(StateId s, const Arc &arc) {\n      if (height_[arc.nextstate] + 1 > height_[s]) {\n        height_[s] = height_[arc.nextstate] + 1;\n      }\n      return true;\n    }\n\n    // Invoked when state finished (parent is kNoStateId for tree root).\n    void FinishState(StateId s, StateId parent, const Arc *parent_arc) {\n      if (height_[s] == -1) height_[s] = 0;\n      const auto h = height_[s] + 1;\n      if (parent >= 0) {\n        if (h > height_[parent]) height_[parent] = h;\n        if (h > max_height_) max_height_ = h;\n      }\n    }\n\n    // Invoked after DFS visit.\n    void FinishVisit() {}\n\n    size_t max_height() const { return max_height_; }\n\n    const std::vector<StateId> &height() const { return height_; }\n\n    size_t num_states() const { return num_states_; }\n\n   private:\n    std::vector<StateId> height_;\n    size_t max_height_;\n    size_t num_states_;\n  };\n\n private:\n  // Cluster states according to height (distance to final state)\n  void Initialize(const Fst<Arc> &fst) {\n    // Computes height (distance to final state).\n    HeightVisitor hvisitor;\n    DfsVisit(fst, &hvisitor);\n    // Creates initial partition based on height.\n    partition_.Initialize(hvisitor.num_states());\n    partition_.AllocateClasses(hvisitor.max_height() + 1);\n    const auto &hstates = hvisitor.height();\n    for (StateId s = 0; s < hstates.size(); ++s) partition_.Add(s, hstates[s]);\n  }\n\n  // Refines states based on arc sort (out degree, arc equivalence).\n  void Refine(const Fst<Arc> &fst) {\n    using EquivalenceMap = std::map<StateId, StateId, StateComparator<Arc>>;\n    StateComparator<Arc> comp(fst, partition_);\n    // Starts with tail (height = 0).\n    auto height = partition_.NumClasses();\n    for (StateId h = 0; h < height; ++h) {\n      EquivalenceMap equiv_classes(comp);\n      // Sorts states within equivalence class.\n      PartitionIterator<StateId> siter(partition_, h);\n      equiv_classes[siter.Value()] = h;\n      for (siter.Next(); !siter.Done(); siter.Next()) {\n        auto insert_result =\n            equiv_classes.insert(std::make_pair(siter.Value(), kNoStateId));\n        if (insert_result.second) {\n          insert_result.first->second = partition_.AddClass();\n        }\n      }\n      // Creates refined partition.\n      for (siter.Reset(); !siter.Done();) {\n        const auto s = siter.Value();\n        const auto old_class = partition_.ClassId(s);\n        const auto new_class = equiv_classes[s];\n        // A move operation can invalidate the iterator, so we first update\n        // the iterator to the next element before we move the current element\n        // out of the list.\n        siter.Next();\n        if (old_class != new_class) partition_.Move(s, new_class);\n      }\n    }\n  }\n\n private:\n  Partition<StateId> partition_;\n};\n\n// Given a partition and a Mutable FST, merges states of Fst in place (i.e.,\n// destructively). Merging works by taking the first state in a class of the\n// partition to be the representative state for the class. Each arc is then\n// reconnected to this state. All states in the class are merged by adding\n// their arcs to the representative state.\ntemplate <class Arc>\nvoid MergeStates(const Partition<typename Arc::StateId> &partition,\n                 MutableFst<Arc> *fst) {\n  using StateId = typename Arc::StateId;\n  std::vector<StateId> state_map(partition.NumClasses());\n  for (StateId i = 0; i < partition.NumClasses(); ++i) {\n    PartitionIterator<StateId> siter(partition, i);\n    state_map[i] = siter.Value();  // First state in partition.\n  }\n  // Relabels destination states.\n  for (StateId c = 0; c < partition.NumClasses(); ++c) {\n    for (PartitionIterator<StateId> siter(partition, c); !siter.Done();\n         siter.Next()) {\n      const auto s = siter.Value();\n      for (MutableArcIterator<MutableFst<Arc>> aiter(fst, s); !aiter.Done();\n           aiter.Next()) {\n        auto arc = aiter.Value();\n        arc.nextstate = state_map[partition.ClassId(arc.nextstate)];\n        if (s == state_map[c]) {  // For the first state, just sets destination.\n          aiter.SetValue(arc);\n        } else {\n          fst->AddArc(state_map[c], arc);\n        }\n      }\n    }\n  }\n  fst->SetStart(state_map[partition.ClassId(fst->Start())]);\n  Connect(fst);\n}\n\ntemplate <class Arc>\nvoid AcceptorMinimize(MutableFst<Arc> *fst,\n                      bool allow_acyclic_minimization = true) {\n  if (!(fst->Properties(kAcceptor | kUnweighted, true) ==\n        (kAcceptor | kUnweighted))) {\n    FSTERROR() << \"FST is not an unweighted acceptor\";\n    fst->SetProperties(kError, kError);\n    return;\n  }\n  // Connects FST before minimization, handles disconnected states.\n  Connect(fst);\n  if (fst->NumStates() == 0) return;\n  if (allow_acyclic_minimization && fst->Properties(kAcyclic, true)) {\n    // Acyclic minimization (Revuz).\n    VLOG(2) << \"Acyclic minimization\";\n    ArcSort(fst, ILabelCompare<Arc>());\n    AcyclicMinimizer<Arc> minimizer(*fst);\n    MergeStates(minimizer.GetPartition(), fst);\n  } else {\n    // Either the FST has cycles, or it's generated from non-deterministic input\n    // (which the Revuz algorithm can't handle), so use the cyclic minimization\n    // algorithm of Hopcroft.\n    VLOG(2) << \"Cyclic minimization\";\n    CyclicMinimizer<Arc, LifoQueue<typename Arc::StateId>> minimizer(*fst);\n    MergeStates(minimizer.GetPartition(), fst);\n  }\n  // Merges in appropriate semiring\n  ArcUniqueMapper<Arc> mapper(*fst);\n  StateMap(fst, mapper);\n}\n\n}  // namespace internal\n\n// In place minimization of deterministic weighted automata and transducers,\n// and also non-deterministic ones if they use an idempotent semiring.\n// For transducers, if the 'sfst' argument is not null, the algorithm\n// produces a compact factorization of the minimal transducer.\n//\n// In the acyclic deterministic case, we use an algorithm from Revuz that is\n// linear in the number of arcs (edges) in the machine.\n//\n// In the cyclic or non-deterministic case, we use the classical Hopcroft\n// minimization (which was presented for the deterministic case but which\n// also works for non-deterministic FSTs); this has complexity O(e log v).\n//\ntemplate <class Arc>\nvoid Minimize(MutableFst<Arc> *fst, MutableFst<Arc> *sfst = nullptr,\n              float delta = kShortestDelta, bool allow_nondet = false) {\n  using Weight = typename Arc::Weight;\n  const auto props = fst->Properties(\n      kAcceptor | kIDeterministic | kWeighted | kUnweighted, true);\n  bool allow_acyclic_minimization;\n  if (props & kIDeterministic) {\n    allow_acyclic_minimization = true;\n  } else {\n    // Our approach to minimization of non-deterministic FSTs will only work in\n    // idempotent semirings---for non-deterministic inputs, a state could have\n    // multiple transitions to states that will get merged, and we'd have to\n    // sum their weights. The algorithm doesn't handle that.\n    if (!(Weight::Properties() & kIdempotent)) {\n      fst->SetProperties(kError, kError);\n      FSTERROR() << \"Cannot minimize a non-deterministic FST over a \"\n                    \"non-idempotent semiring\";\n      return;\n    } else if (!allow_nondet) {\n      fst->SetProperties(kError, kError);\n      FSTERROR() << \"Refusing to minimize a non-deterministic FST with \"\n                 << \"allow_nondet = false\";\n      return;\n    }\n    // The Revuz algorithm won't work for nondeterministic inputs, so if the\n    // input is nondeterministic, we'll have to pass a bool saying not to use\n    // that algorithm. We check at this level rather than in AcceptorMinimize(),\n    // because it's possible that the FST at this level could be deterministic,\n    // but a harmless type of non-determinism could be introduced by Encode()\n    // (thanks to kEncodeWeights, if the FST has epsilons and has a final\n    // weight with weights equal to some epsilon arc.)\n    allow_acyclic_minimization = false;\n  }\n  if (!(props & kAcceptor)) {  // Weighted transducer.\n    VectorFst<GallicArc<Arc, GALLIC_LEFT>> gfst;\n    ArcMap(*fst, &gfst, ToGallicMapper<Arc, GALLIC_LEFT>());\n    fst->DeleteStates();\n    gfst.SetProperties(kAcceptor, kAcceptor);\n    Push(&gfst, REWEIGHT_TO_INITIAL, delta);\n    ArcMap(&gfst, QuantizeMapper<GallicArc<Arc, GALLIC_LEFT>>(delta));\n    EncodeMapper<GallicArc<Arc, GALLIC_LEFT>> encoder(\n        kEncodeLabels | kEncodeWeights, ENCODE);\n    Encode(&gfst, &encoder);\n    internal::AcceptorMinimize(&gfst, allow_acyclic_minimization);\n    Decode(&gfst, encoder);\n    if (!sfst) {\n      FactorWeightFst<GallicArc<Arc, GALLIC_LEFT>,\n                      GallicFactor<typename Arc::Label, Weight, GALLIC_LEFT>>\n          fwfst(gfst);\n      std::unique_ptr<SymbolTable> osyms(\n          fst->OutputSymbols() ? fst->OutputSymbols()->Copy() : nullptr);\n      ArcMap(fwfst, fst, FromGallicMapper<Arc, GALLIC_LEFT>());\n      fst->SetOutputSymbols(osyms.get());\n    } else {\n      sfst->SetOutputSymbols(fst->OutputSymbols());\n      GallicToNewSymbolsMapper<Arc, GALLIC_LEFT> mapper(sfst);\n      ArcMap(gfst, fst, &mapper);\n      fst->SetOutputSymbols(sfst->InputSymbols());\n    }\n  } else if (props & kWeighted) {  // Weighted acceptor.\n    Push(fst, REWEIGHT_TO_INITIAL, delta);\n    ArcMap(fst, QuantizeMapper<Arc>(delta));\n    EncodeMapper<Arc> encoder(kEncodeLabels | kEncodeWeights, ENCODE);\n    Encode(fst, &encoder);\n    internal::AcceptorMinimize(fst, allow_acyclic_minimization);\n    Decode(fst, encoder);\n  } else {  // Unweighted acceptor.\n    internal::AcceptorMinimize(fst, allow_acyclic_minimization);\n  }\n}\n\n}  // namespace fst\n\n#endif  // FST_MINIMIZE_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/mpdt.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Common classes for Multi Pushdown Transducer (MPDT) expansion/traversal.\n\n#ifndef FST_EXTENSIONS_MPDT_MPDT_H_\n#define FST_EXTENSIONS_MPDT_MPDT_H_\n\n#include <array>\n#include <functional>\n#include <map>\n#include <vector>\n\n#include <fst/compat.h>\n#include <fst/extensions/pdt/pdt.h>\n\nnamespace fst {\n\nenum MPdtType {\n  MPDT_READ_RESTRICT,   // Can only read from first empty stack\n  MPDT_WRITE_RESTRICT,  // Can only write to first empty stack\n  MPDT_NO_RESTRICT,     // No read-write restrictions\n};\n\nnamespace internal {\n\n// PLEASE READ THIS CAREFULLY:\n//\n// When USEVECTOR is set, the stack configurations --- the statewise\n// representation of the StackId's for each substack --- is stored in a vector.\n// I would like to do this using an array for efficiency reasons, thus the\n// definition of StackConfig below. However, while this *works* in that tests\n// pass, etc. It causes a memory leak in the compose and expand tests, evidently\n// in the map[] that is being used to store the mapping between these\n// StackConfigs and the external StackId that the caller sees. There are no\n// memory leaks when I use a vector, only with this StackId. Why there should be\n// memory leaks given that I am not mallocing anything is a mystery. In case you\n// were wondering, clearing the map at the end does not help.\n\ntemplate <typename StackId, typename Level, Level nlevels>\nstruct StackConfig {\n  StackConfig() : array_() {}\n\n  StackConfig(const StackConfig<StackId, Level, nlevels> &config) {\n    array_ = config.array_;\n  }\n\n  StackId &operator[](const int index) { return array_[index]; }\n\n  const StackId &operator[](const int index) const { return array_[index]; }\n\n  StackConfig &operator=(const StackConfig<StackId, Level, nlevels> &config) {\n    if (this == &config) return *this;\n    array_ = config.array_;\n    return *this;\n  }\n\n  std::array<StackId, nlevels> array_;\n};\n\ntemplate <typename StackId, typename Level, Level nlevels>\nclass CompConfig {\n public:\n  using Config = StackConfig<StackId, Level, nlevels>;\n\n  bool operator()(const Config &x, const Config &y) const {\n    for (Level level = 0; level < nlevels; ++level) {\n      if (x.array_[level] < y.array_[level]) {\n        return true;\n      } else if (x.array_[level] > y.array_[level]) {\n        return false;\n      }\n    }\n    return false;\n  }\n};\n\n// Defines the KeyPair type used as the key to MPdtStack.paren_id_map_. The hash\n// function is provided as a separate struct to match templating syntax.\ntemplate <typename Level>\nstruct KeyPair {\n  Level level;\n  size_t underlying_id;\n\n  KeyPair(Level level, size_t id) : level(level), underlying_id(id) {}\n\n  inline bool operator==(const KeyPair<Level> &rhs) const {\n    return level == rhs.level && underlying_id == rhs.underlying_id;\n  }\n};\n\ntemplate <typename Level>\nstruct KeyPairHasher {\n  inline size_t operator()(const KeyPair<Level> &keypair) const {\n    return std::hash<Level>()(keypair.level) ^\n           (std::hash<size_t>()(keypair.underlying_id) << 1);\n  }\n};\n\ntemplate <typename StackId, typename Level, Level nlevels = 2,\n          MPdtType restrict = MPDT_READ_RESTRICT>\nclass MPdtStack {\n public:\n  using Label = Level;\n  using Config = StackConfig<StackId, Level, nlevels>;\n  using ConfigToStackId =\n      std::map<Config, StackId, CompConfig<StackId, Level, nlevels>>;\n\n  MPdtStack(const std::vector<std::pair<Label, Label>> &parens,\n            const std::vector<Level> &assignments);\n\n  MPdtStack(const MPdtStack &mstack);\n\n  ~MPdtStack() {\n    for (Level level = 0; level < nlevels; ++level) delete stacks_[level];\n  }\n\n  StackId Find(StackId stack_id, Label label);\n\n  // For now we do not implement Pop since this is needed only for\n  // ShortestPath().\n\n  // For Top we find the first non-empty config, and find the paren ID of that\n  // (or -1) if there is none, then map that to the external stack_id to return.\n  std::ptrdiff_t Top(StackId stack_id) const {\n    if (stack_id == -1) return -1;\n    const auto config = InternalStackIds(stack_id);\n    Level level = 0;\n    StackId underlying_id = -1;\n    for (; level < nlevels; ++level) {\n      if (!Empty(config, level)) {\n        underlying_id = stacks_[level]->Top(config[level]);\n        break;\n      }\n    }\n    if (underlying_id == -1) return -1;\n    const auto it = paren_id_map_.find(KeyPair<Level>(level, underlying_id));\n    if (it == paren_id_map_.end()) return -1;  // NB: shouldn't happen.\n    return it->second;\n  }\n\n  std::ptrdiff_t ParenId(Label label) const {\n    const auto it = paren_map_.find(label);\n    return it != paren_map_.end() ? it->second : -1;\n  }\n\n  // TODO(rws): For debugging purposes only: remove later.\n  string PrintConfig(const Config &config) const {\n    string result = \"[\";\n    for (Level i = 0; i < nlevels; ++i) {\n      char s[128];\n      snprintf(s, sizeof(s), \"%d\", config[i]);\n      result += string(s);\n      if (i < nlevels - 1) result += \", \";\n    }\n    result += \"]\";\n    return result;\n  }\n\n  bool Error() { return error_; }\n\n  // Each component stack has an internal stack ID for a given configuration and\n  // label.\n  // This function maps a configuration of those to the stack ID the caller\n  // sees.\n  inline StackId ExternalStackId(const Config &config) {\n    const auto it = config_to_stack_id_map_.find(config);\n    StackId result;\n    if (it == config_to_stack_id_map_.end()) {\n      result = next_stack_id_++;\n      config_to_stack_id_map_.insert(\n          std::pair<Config, StackId>(config, result));\n      stack_id_to_config_map_[result] = config;\n    } else {\n      result = it->second;\n    }\n    return result;\n  }\n\n  // Retrieves the internal stack ID for a corresponding external stack ID.\n  inline const Config InternalStackIds(StackId stack_id) const {\n    auto it = stack_id_to_config_map_.find(stack_id);\n    if (it == stack_id_to_config_map_.end()) {\n      it = stack_id_to_config_map_.find(-1);\n    }\n    return it->second;\n  }\n\n  inline bool Empty(const Config &config, Level level) const {\n    return config[level] <= 0;\n  }\n\n  inline bool AllEmpty(const Config &config) {\n    for (Level level = 0; level < nlevels; ++level) {\n      if (!Empty(config, level)) return false;\n    }\n    return true;\n  }\n\n  bool error_;\n  Label min_paren_;\n  Label max_paren_;\n  // Stores level of each paren.\n  std::unordered_map<Label, Label> paren_levels_;\n  std::vector<std::pair<Label, Label>> parens_;  // As in pdt.h.\n  std::unordered_map<Label, size_t> paren_map_;  // As in pdt.h.\n  // Maps between internal paren_id and external paren_id.\n  std::unordered_map<KeyPair<Level>, size_t, KeyPairHasher<Level>>\n      paren_id_map_;\n  // Maps between internal stack ids and external stack id.\n  ConfigToStackId config_to_stack_id_map_;\n  std::unordered_map<StackId, Config> stack_id_to_config_map_;\n  StackId next_stack_id_;\n  // Array of stacks.\n  PdtStack<StackId, Label> *stacks_[nlevels];\n};\n\ntemplate <typename StackId, typename Level, Level nlevels, MPdtType restrict>\nMPdtStack<StackId, Level, nlevels, restrict>::MPdtStack(\n    const std::vector<std::pair<Level, Level>> &parens,  // NB: Label = Level.\n    const std::vector<Level> &assignments)\n    : error_(false),\n      min_paren_(kNoLabel),\n      max_paren_(kNoLabel),\n      parens_(parens),\n      next_stack_id_(1) {\n  using Label = Level;\n  if (parens.size() != assignments.size()) {\n    FSTERROR() << \"MPdtStack: Parens of different size from assignments\";\n    error_ = true;\n    return;\n  }\n  std::vector<std::pair<Label, Label>> vectors[nlevels];\n  for (Level i = 0; i < assignments.size(); ++i) {\n    // Assignments here start at 0, so assuming the human-readable version has\n    // them starting at 1, we should subtract 1 here\n    const auto level = assignments[i] - 1;\n    if (level < 0 || level >= nlevels) {\n      FSTERROR() << \"MPdtStack: Specified level \" << level << \" out of bounds\";\n      error_ = true;\n      return;\n    }\n    const auto &pair = parens[i];\n    vectors[level].push_back(pair);\n    paren_levels_[pair.first] = level;\n    paren_levels_[pair.second] = level;\n    paren_map_[pair.first] = i;\n    paren_map_[pair.second] = i;\n    const KeyPair<Level> key(level, vectors[level].size() - 1);\n    paren_id_map_[key] = i;\n    if (min_paren_ == kNoLabel || pair.first < min_paren_) {\n      min_paren_ = pair.first;\n    }\n    if (pair.second < min_paren_) min_paren_ = pair.second;\n    if (max_paren_ == kNoLabel || pair.first > max_paren_) {\n      max_paren_ = pair.first;\n    }\n    if (pair.second > max_paren_) max_paren_ = pair.second;\n  }\n  using Config = StackConfig<StackId, Level, nlevels>;\n  Config neg_one;\n  Config zero;\n  for (Level level = 0; level < nlevels; ++level) {\n    stacks_[level] = new PdtStack<StackId, Label>(vectors[level]);\n    neg_one[level] = -1;\n    zero[level] = 0;\n  }\n  config_to_stack_id_map_[neg_one] = -1;\n  config_to_stack_id_map_[zero] = 0;\n  stack_id_to_config_map_[-1] = neg_one;\n  stack_id_to_config_map_[0] = zero;\n}\n\ntemplate <typename StackId, typename Level, Level nlevels, MPdtType restrict>\nMPdtStack<StackId, Level, nlevels, restrict>::MPdtStack(\n    const MPdtStack<StackId, Level, nlevels, restrict> &mstack)\n    : error_(mstack.error_),\n      min_paren_(mstack.min_paren_),\n      max_paren_(mstack.max_paren_),\n      parens_(mstack.parens_),\n      next_stack_id_(mstack.next_stack_id_) {\n  for (const auto &kv : mstack.paren_levels_) {\n    paren_levels_[kv.first] = kv.second;\n  }\n  for (const auto &paren : mstack.parens_) parens_.push_back(paren);\n  for (const auto &kv : mstack.paren_map_) {\n    paren_map_[kv.first] = kv.second;\n  }\n  for (const auto &kv : mstack.paren_id_map_) {\n    paren_id_map_[kv.first] = kv.second;\n  }\n  for (auto it = mstack.config_to_stack_id_map_.begin();\n       it != mstack.config_to_stack_id_map_.end(); ++it) {\n    config_to_stack_id_map_[it->first] = it->second;\n  }\n  for (const auto &kv : mstack.stack_id_to_config_map_) {\n    using Config = StackConfig<StackId, Level, nlevels>;\n    const Config config(kv.second);\n    stack_id_to_config_map_[kv.first] = config;\n  }\n  for (Level level = 0; level < nlevels; ++level)\n    stacks_[level] = mstack.stacks_[level];\n}\n\ntemplate <typename StackId, typename Level, Level nlevels, MPdtType restrict>\nStackId MPdtStack<StackId, Level, nlevels, restrict>::Find(StackId stack_id,\n                                                           Level label) {\n  // Non-paren.\n  if (min_paren_ == kNoLabel || label < min_paren_ || label > max_paren_) {\n    return stack_id;\n  }\n  const auto it = paren_map_.find(label);\n  // Non-paren.\n  if (it == paren_map_.end()) return stack_id;\n  std::ptrdiff_t paren_id = it->second;\n  // Gets the configuration associated with this stack_id.\n  const auto config = InternalStackIds(stack_id);\n  // Gets the level.\n  const auto level = paren_levels_.find(label)->second;\n  // If the label is an open paren we push:\n  //\n  // 1) if the restrict type is not MPDT_WRITE_RESTRICT, or\n  // 2) the restrict type is MPDT_WRITE_RESTRICT, and all the stacks above the\n  // level are empty.\n  if (label == parens_[paren_id].first) {  // Open paren.\n    if (restrict == MPDT_WRITE_RESTRICT) {\n      for (Level upper_level = 0; upper_level < level; ++upper_level) {\n        if (!Empty(config, upper_level)) return -1;  // Non-empty stack blocks.\n      }\n    }\n    // If the label is an close paren we pop:\n    //\n    // 1) if the restrict type is not MPDT_READ_RESTRICT, or\n    // 2) the restrict type is MPDT_READ_RESTRICT, and all the stacks above the\n    // level are empty.\n  } else if (restrict == MPDT_READ_RESTRICT) {\n    for (Level lower_level = 0; lower_level < level; ++lower_level) {\n      if (!Empty(config, lower_level)) return -1;  // Non-empty stack blocks.\n    }\n  }\n  const auto nid = stacks_[level]->Find(config[level], label);\n  // If the new ID is -1, that means that there is no valid transition at the\n  // level we want.\n  if (nid == -1) {\n    return -1;\n  } else {\n    using Config = StackConfig<StackId, Level, nlevels>;\n    Config nconfig(config);\n    nconfig[level] = nid;\n    return ExternalStackId(nconfig);\n  }\n}\n\n}  // namespace internal\n}  // namespace fst\n\n#endif  // FST_EXTENSIONS_MPDT_MPDT_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/mutable-fst.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Expanded FST augmented with mutators; interface class definition and\n// mutable arc iterator interface.\n\n#ifndef FST_MUTABLE_FST_H_\n#define FST_MUTABLE_FST_H_\n\n#include <stddef.h>\n#include <sys/types.h>\n\n#include <istream>\n#include <string>\n#include <utility>\n#include <vector>\n\n#include <fst/log.h>\n#include <fstream>\n\n#include <fst/expanded-fst.h>\n\n\nnamespace fst {\n\ntemplate <class Arc>\nstruct MutableArcIteratorData;\n\n// Abstract interface for an expanded FST which also supports mutation\n// operations. To modify arcs, use MutableArcIterator.\ntemplate <class A>\nclass MutableFst : public ExpandedFst<A> {\n public:\n  using Arc = A;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  virtual MutableFst<Arc> &operator=(const Fst<Arc> &fst) = 0;\n\n  MutableFst<Arc> &operator=(const MutableFst<Arc> &fst) {\n    return operator=(static_cast<const Fst<Arc> &>(fst));\n  }\n\n  // Sets the initial state.\n  virtual void SetStart(StateId) = 0;\n\n  // Sets a state's final weight.\n  virtual void SetFinal(StateId, Weight) = 0;\n\n  // Sets property bits w.r.t. mask.\n  virtual void SetProperties(uint64_t props, uint64_t mask) = 0;\n\n  // Adds a state and returns its ID.\n  virtual StateId AddState() = 0;\n\n  // Adds an arc to state.\n  virtual void AddArc(StateId, const Arc &arc) = 0;\n\n  // Deletes some states, preserving original StateId ordering.\n  virtual void DeleteStates(const std::vector<StateId> &) = 0;\n\n  // Delete all states.\n  virtual void DeleteStates() = 0;\n\n  // Delete some arcs at a given state.\n  virtual void DeleteArcs(StateId, size_t n) = 0;\n\n  // Delete all arcs at a given state.\n  virtual void DeleteArcs(StateId) = 0;\n\n  // Optional, best effort only.\n  virtual void ReserveStates(StateId n) {}\n\n  // Optional, best effort only.\n  virtual void ReserveArcs(StateId s, size_t n) {}\n\n  // Returns input label symbol table or nullptr if not specified.\n  const SymbolTable *InputSymbols() const override = 0;\n\n  // Returns output label symbol table or nullptr if not specified.\n  const SymbolTable *OutputSymbols() const override = 0;\n\n  // Returns input label symbol table or nullptr if not specified.\n  virtual SymbolTable *MutableInputSymbols() = 0;\n\n  // Returns output label symbol table or nullptr if not specified.\n  virtual SymbolTable *MutableOutputSymbols() = 0;\n\n  // Sets input label symbol table; pass nullptr to delete table.\n  virtual void SetInputSymbols(const SymbolTable *isyms) = 0;\n\n  // Sets output label symbol table; pass nullptr to delete table.\n  virtual void SetOutputSymbols(const SymbolTable *osyms) = 0;\n\n  // Gets a copy of this MutableFst. See Fst<>::Copy() for further doc.\n  MutableFst<A> *Copy(bool safe = false) const override = 0;\n\n  // Reads a MutableFst from an input stream, returning nullptr on error.\n  static MutableFst<Arc> *Read(std::istream &strm, const FstReadOptions &opts) {\n    FstReadOptions ropts(opts);\n    FstHeader hdr;\n    if (ropts.header) {\n      hdr = *opts.header;\n    } else {\n      if (!hdr.Read(strm, opts.source)) return nullptr;\n      ropts.header = &hdr;\n    }\n    if (!(hdr.Properties() & kMutable)) {\n      LOG(ERROR) << \"MutableFst::Read: Not a MutableFst: \" << ropts.source;\n      return nullptr;\n    }\n    const auto &fst_type = hdr.FstType();\n    const auto reader = FstRegister<Arc>::GetRegister()->GetReader(fst_type);\n    if (!reader) {\n      LOG(ERROR) << \"MutableFst::Read: Unknown FST type \\\"\" << fst_type\n                 << \"\\\" (arc type = \\\"\" << A::Type() << \"\\\"): \" << ropts.source;\n      return nullptr;\n    }\n    auto *fst = reader(strm, ropts);\n    if (!fst) return nullptr;\n    return static_cast<MutableFst<Arc> *>(fst);\n  }\n\n  // Reads a MutableFst from a file; returns nullptr on error. An empty\n  // filename results in reading from standard input. If convert is true,\n  // convert to a mutable FST subclass (given by convert_type) in the case\n  // that the input FST is non-mutable.\n  static MutableFst<Arc> *Read(const string &filename, bool convert = false,\n                               const string &convert_type = \"vector\") {\n    if (convert == false) {\n      if (!filename.empty()) {\n        std::ifstream strm(filename,\n                                std::ios_base::in | std::ios_base::binary);\n        if (!strm) {\n          LOG(ERROR) << \"MutableFst::Read: Can't open file: \" << filename;\n          return nullptr;\n        }\n        return Read(strm, FstReadOptions(filename));\n      } else {\n        return Read(std::cin, FstReadOptions(\"standard input\"));\n      }\n    } else {  // Converts to 'convert_type' if not mutable.\n      std::unique_ptr<Fst<Arc>> ifst(Fst<Arc>::Read(filename));\n      if (!ifst) return nullptr;\n      if (ifst->Properties(kMutable, false)) {\n        return static_cast<MutableFst<Arc> *>(ifst.release());\n      } else {\n        std::unique_ptr<Fst<Arc>> ofst(Convert(*ifst, convert_type));\n        ifst.reset();\n        if (!ofst) return nullptr;\n        if (!ofst->Properties(kMutable, false)) {\n          LOG(ERROR) << \"MutableFst: Bad convert type: \" << convert_type;\n        }\n        return static_cast<MutableFst<Arc> *>(ofst.release());\n      }\n    }\n  }\n\n  // For generic mutuble arc iterator construction; not normally called\n  // directly by users.\n  virtual void InitMutableArcIterator(StateId s,\n                                      MutableArcIteratorData<Arc> *data) = 0;\n};\n\n// Mutable arc iterator interface, templated on the Arc definition. This is\n// used by mutable arc iterator specializations that are returned by the\n// InitMutableArcIterator MutableFst method.\ntemplate <class Arc>\nclass MutableArcIteratorBase : public ArcIteratorBase<Arc> {\n public:\n  // Sets current arc.\n  virtual void SetValue(const Arc &) = 0;\n};\n\ntemplate <class Arc>\nstruct MutableArcIteratorData {\n  MutableArcIteratorBase<Arc> *base;  // Specific iterator.\n};\n\n// Generic mutable arc iterator, templated on the FST definition; a wrapper\n// around a pointer to a more specific one.\n//\n// Here is a typical use:\n//\n//   for (MutableArcIterator<StdFst> aiter(&fst, s);\n//        !aiter.Done();\n//         aiter.Next()) {\n//     StdArc arc = aiter.Value();\n//     arc.ilabel = 7;\n//     aiter.SetValue(arc);\n//     ...\n//   }\n//\n// This version requires function calls.\ntemplate <class FST>\nclass MutableArcIterator {\n public:\n  using Arc = typename FST::Arc;\n  using StateId = typename Arc::StateId;\n\n  MutableArcIterator(FST *fst, StateId s) {\n    fst->InitMutableArcIterator(s, &data_);\n  }\n\n  ~MutableArcIterator() { delete data_.base; }\n\n  bool Done() const { return data_.base->Done(); }\n\n  const Arc &Value() const { return data_.base->Value(); }\n\n  void Next() { data_.base->Next(); }\n\n  size_t Position() const { return data_.base->Position(); }\n\n  void Reset() { data_.base->Reset(); }\n\n  void Seek(size_t a) { data_.base->Seek(a); }\n\n  void SetValue(const Arc &arc) { data_.base->SetValue(arc); }\n\n  uint32_t Flags() const { return data_.base->Flags(); }\n\n  void SetFlags(uint32_t flags, uint32_t mask) {\n    return data_.base->SetFlags(flags, mask);\n  }\n\n private:\n  MutableArcIteratorData<Arc> data_;\n\n  MutableArcIterator(const MutableArcIterator &) = delete;\n  MutableArcIterator &operator=(const MutableArcIterator &) = delete;\n};\n\nnamespace internal {\n\n// MutableFst<A> case: abstract methods.\ntemplate <class Arc>\ninline typename Arc::Weight Final(const MutableFst<Arc> &fst,\n                                  typename Arc::StateId s) {\n  return fst.Final(s);\n}\n\ntemplate <class Arc>\ninline std::ptrdiff_t NumArcs(const MutableFst<Arc> &fst, typename Arc::StateId s) {\n  return fst.NumArcs(s);\n}\n\ntemplate <class Arc>\ninline std::ptrdiff_t NumInputEpsilons(const MutableFst<Arc> &fst,\n                                typename Arc::StateId s) {\n  return fst.NumInputEpsilons(s);\n}\n\ntemplate <class Arc>\ninline std::ptrdiff_t NumOutputEpsilons(const MutableFst<Arc> &fst,\n                                 typename Arc::StateId s) {\n  return fst.NumOutputEpsilons(s);\n}\n\n}  // namespace internal\n\n// A useful alias when using StdArc.\nusing StdMutableFst = MutableFst<StdArc>;\n\n// This is a helper class template useful for attaching a MutableFst interface\n// to its implementation, handling reference counting and COW semantics.\ntemplate <class Impl, class FST = MutableFst<typename Impl::Arc>>\nclass ImplToMutableFst : public ImplToExpandedFst<Impl, FST> {\n public:\n  using Arc = typename Impl::Arc;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using ImplToExpandedFst<Impl, FST>::operator=;\n\n  void SetStart(StateId s) override {\n    MutateCheck();\n    GetMutableImpl()->SetStart(s);\n  }\n\n  void SetFinal(StateId s, Weight weight) override {\n    MutateCheck();\n    GetMutableImpl()->SetFinal(s, std::move(weight));\n  }\n\n  void SetProperties(uint64_t props, uint64_t mask) override {\n    // Can skip mutate check if extrinsic properties don't change,\n    // since it is then safe to update all (shallow) copies\n    const auto exprops = kExtrinsicProperties & mask;\n    if (GetImpl()->Properties(exprops) != (props & exprops)) MutateCheck();\n    GetMutableImpl()->SetProperties(props, mask);\n  }\n\n  StateId AddState() override {\n    MutateCheck();\n    return GetMutableImpl()->AddState();\n  }\n\n  void AddArc(StateId s, const Arc &arc) override {\n    MutateCheck();\n    GetMutableImpl()->AddArc(s, arc);\n  }\n\n  void DeleteStates(const std::vector<StateId> &dstates) override {\n    MutateCheck();\n    GetMutableImpl()->DeleteStates(dstates);\n  }\n\n  void DeleteStates() override {\n    if (!Unique()) {\n      const auto *isymbols = GetImpl()->InputSymbols();\n      const auto *osymbols = GetImpl()->OutputSymbols();\n      SetImpl(std::make_shared<Impl>());\n      GetMutableImpl()->SetInputSymbols(isymbols);\n      GetMutableImpl()->SetOutputSymbols(osymbols);\n    } else {\n      GetMutableImpl()->DeleteStates();\n    }\n  }\n\n  void DeleteArcs(StateId s, size_t n) override {\n    MutateCheck();\n    GetMutableImpl()->DeleteArcs(s, n);\n  }\n\n  void DeleteArcs(StateId s) override {\n    MutateCheck();\n    GetMutableImpl()->DeleteArcs(s);\n  }\n\n  void ReserveStates(StateId s) override {\n    MutateCheck();\n    GetMutableImpl()->ReserveStates(s);\n  }\n\n  void ReserveArcs(StateId s, size_t n) override {\n    MutateCheck();\n    GetMutableImpl()->ReserveArcs(s, n);\n  }\n\n  const SymbolTable *InputSymbols() const override {\n    return GetImpl()->InputSymbols();\n  }\n\n  const SymbolTable *OutputSymbols() const override {\n    return GetImpl()->OutputSymbols();\n  }\n\n  SymbolTable *MutableInputSymbols() override {\n    MutateCheck();\n    return GetMutableImpl()->InputSymbols();\n  }\n\n  SymbolTable *MutableOutputSymbols() override {\n    MutateCheck();\n    return GetMutableImpl()->OutputSymbols();\n  }\n\n  void SetInputSymbols(const SymbolTable *isyms) override {\n    MutateCheck();\n    GetMutableImpl()->SetInputSymbols(isyms);\n  }\n\n  void SetOutputSymbols(const SymbolTable *osyms) override {\n    MutateCheck();\n    GetMutableImpl()->SetOutputSymbols(osyms);\n  }\n\n protected:\n  using ImplToExpandedFst<Impl, FST>::GetImpl;\n  using ImplToExpandedFst<Impl, FST>::GetMutableImpl;\n  using ImplToExpandedFst<Impl, FST>::Unique;\n  using ImplToExpandedFst<Impl, FST>::SetImpl;\n  using ImplToExpandedFst<Impl, FST>::InputSymbols;\n\n  explicit ImplToMutableFst(std::shared_ptr<Impl> impl)\n      : ImplToExpandedFst<Impl, FST>(impl) {}\n\n  ImplToMutableFst(const ImplToMutableFst<Impl, FST> &fst, bool safe)\n      : ImplToExpandedFst<Impl, FST>(fst, safe) {}\n\n  void MutateCheck() {\n    if (!Unique()) SetImpl(std::make_shared<Impl>(*this));\n  }\n};\n\n}  // namespace fst\n\n#endif  // FST_MUTABLE_FST_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/ngram-fst.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// NgramFst implements a n-gram language model based upon the LOUDS data\n// structure.  Please refer to \"Unary Data Structures for Language Models\"\n// http://research.google.com/pubs/archive/37218.pdf\n\n#ifndef FST_EXTENSIONS_NGRAM_NGRAM_FST_H_\n#define FST_EXTENSIONS_NGRAM_NGRAM_FST_H_\n\n#include <stddef.h>\n#include <string.h>\n#include <algorithm>\n#include <iostream>\n#include <string>\n#include <utility>\n#include <vector>\n\n#include <fst/compat.h>\n#include <fst/log.h>\n#include <fstream>\n#include <fst/extensions/ngram/bitmap-index.h>\n#include <fst/fstlib.h>\n#include <fst/mapped-file.h>\n\nnamespace fst {\ntemplate <class A>\nclass NGramFst;\ntemplate <class A>\nclass NGramFstMatcher;\n\n// Instance data containing mutable state for bookkeeping repeated access to\n// the same state.\ntemplate <class A>\nstruct NGramFstInst {\n  typedef typename A::Label Label;\n  typedef typename A::StateId StateId;\n  typedef typename A::Weight Weight;\n  StateId state_;\n  size_t num_futures_;\n  size_t offset_;\n  size_t node_;\n  StateId node_state_;\n  std::vector<Label> context_;\n  StateId context_state_;\n  NGramFstInst()\n      : state_(kNoStateId),\n        node_state_(kNoStateId),\n        context_state_(kNoStateId) {}\n};\n\nnamespace internal {\n\n// Implementation class for LOUDS based NgramFst interface.\ntemplate <class A>\nclass NGramFstImpl : public FstImpl<A> {\n  using FstImpl<A>::SetInputSymbols;\n  using FstImpl<A>::SetOutputSymbols;\n  using FstImpl<A>::SetType;\n  using FstImpl<A>::WriteHeader;\n\n  friend class ArcIterator<NGramFst<A>>;\n  friend class NGramFstMatcher<A>;\n\n public:\n  using FstImpl<A>::InputSymbols;\n  using FstImpl<A>::SetProperties;\n  using FstImpl<A>::Properties;\n\n  typedef A Arc;\n  typedef typename A::Label Label;\n  typedef typename A::StateId StateId;\n  typedef typename A::Weight Weight;\n\n  NGramFstImpl() {\n    SetType(\"ngram\");\n    SetInputSymbols(nullptr);\n    SetOutputSymbols(nullptr);\n    SetProperties(kStaticProperties);\n  }\n\n  NGramFstImpl(const Fst<A> &fst, std::vector<StateId> *order_out);\n\n  explicit NGramFstImpl(const Fst<A> &fst) : NGramFstImpl(fst, nullptr) {}\n\n  NGramFstImpl(const NGramFstImpl &other) {\n    FSTERROR() << \"Copying NGramFst Impls is not supported, use safe = false.\";\n    SetProperties(kError, kError);\n  }\n\n  ~NGramFstImpl() override {\n    if (owned_) {\n      delete[] data_;\n    }\n  }\n\n  static NGramFstImpl<A> *Read(std::istream &strm,  // NOLINT\n                               const FstReadOptions &opts) {\n    NGramFstImpl<A> *impl = new NGramFstImpl();\n    FstHeader hdr;\n    if (!impl->ReadHeader(strm, opts, kMinFileVersion, &hdr)) return 0;\n    uint64 num_states, num_futures, num_final;\n    const size_t offset =\n        sizeof(num_states) + sizeof(num_futures) + sizeof(num_final);\n    // Peek at num_states and num_futures to see how much more needs to be read.\n    strm.read(reinterpret_cast<char *>(&num_states), sizeof(num_states));\n    strm.read(reinterpret_cast<char *>(&num_futures), sizeof(num_futures));\n    strm.read(reinterpret_cast<char *>(&num_final), sizeof(num_final));\n    size_t size = Storage(num_states, num_futures, num_final);\n    MappedFile *data_region = MappedFile::Allocate(size);\n    char *data = reinterpret_cast<char *>(data_region->mutable_data());\n    // Copy num_states, num_futures and num_final back into data.\n    memcpy(data, reinterpret_cast<char *>(&num_states), sizeof(num_states));\n    memcpy(data + sizeof(num_states), reinterpret_cast<char *>(&num_futures),\n           sizeof(num_futures));\n    memcpy(data + sizeof(num_states) + sizeof(num_futures),\n           reinterpret_cast<char *>(&num_final), sizeof(num_final));\n    strm.read(data + offset, size - offset);\n    if (strm.fail()) {\n      delete impl;\n      return nullptr;\n    }\n    impl->Init(data, false, data_region);\n    return impl;\n  }\n\n  bool Write(std::ostream &strm,  // NOLINT\n             const FstWriteOptions &opts) const {\n    FstHeader hdr;\n    hdr.SetStart(Start());\n    hdr.SetNumStates(num_states_);\n    WriteHeader(strm, opts, kFileVersion, &hdr);\n    strm.write(data_, StorageSize());\n    return !strm.fail();\n  }\n\n  StateId Start() const { return start_; }\n\n  Weight Final(StateId state) const {\n    if (final_index_.Get(state)) {\n      return final_probs_[final_index_.Rank1(state)];\n    } else {\n      return Weight::Zero();\n    }\n  }\n\n  size_t NumArcs(StateId state, NGramFstInst<A> *inst = nullptr) const {\n    if (inst == nullptr) {\n      const std::pair<size_t, size_t> zeros =\n          (state == 0) ? select_root_ : future_index_.Select0s(state);\n      return zeros.second - zeros.first - 1;\n    }\n    SetInstFuture(state, inst);\n    return inst->num_futures_ + ((state == 0) ? 0 : 1);\n  }\n\n  size_t NumInputEpsilons(StateId state) const {\n    // State 0 has no parent, thus no backoff.\n    if (state == 0) return 0;\n    return 1;\n  }\n\n  size_t NumOutputEpsilons(StateId state) const {\n    return NumInputEpsilons(state);\n  }\n\n  StateId NumStates() const { return num_states_; }\n\n  void InitStateIterator(StateIteratorData<A> *data) const {\n    data->base = 0;\n    data->nstates = num_states_;\n  }\n\n  static size_t Storage(uint64 num_states, uint64 num_futures,\n                        uint64 num_final) {\n    uint64 b64;\n    Weight weight;\n    Label label;\n    size_t offset =\n        sizeof(num_states) + sizeof(num_futures) + sizeof(num_final);\n    offset +=\n        sizeof(b64) * (BitmapIndex::StorageSize(num_states * 2 + 1) +\n                       BitmapIndex::StorageSize(num_futures + num_states + 1) +\n                       BitmapIndex::StorageSize(num_states));\n    offset += (num_states + 1) * sizeof(label) + num_futures * sizeof(label);\n    // Pad for alignemnt, see\n    // http://en.wikipedia.org/wiki/Data_structure_alignment#Computing_padding\n    offset = (offset + sizeof(weight) - 1) & ~(sizeof(weight) - 1);\n    offset += (num_states + 1) * sizeof(weight) + num_final * sizeof(weight) +\n              (num_futures + 1) * sizeof(weight);\n    return offset;\n  }\n\n  void SetInstFuture(StateId state, NGramFstInst<A> *inst) const {\n    if (inst->state_ != state) {\n      inst->state_ = state;\n      const std::pair<size_t, size_t> zeros = future_index_.Select0s(state);\n      inst->num_futures_ = zeros.second - zeros.first - 1;\n      inst->offset_ = future_index_.Rank1(zeros.first + 1);\n    }\n  }\n\n  void SetInstNode(NGramFstInst<A> *inst) const {\n    if (inst->node_state_ != inst->state_) {\n      inst->node_state_ = inst->state_;\n      inst->node_ = context_index_.Select1(inst->state_);\n    }\n  }\n\n  void SetInstContext(NGramFstInst<A> *inst) const {\n    SetInstNode(inst);\n    if (inst->context_state_ != inst->state_) {\n      inst->context_state_ = inst->state_;\n      inst->context_.clear();\n      size_t node = inst->node_;\n      while (node != 0) {\n        inst->context_.push_back(context_words_[context_index_.Rank1(node)]);\n        node = context_index_.Select1(context_index_.Rank0(node) - 1);\n      }\n    }\n  }\n\n  // Access to the underlying representation\n  const char *GetData(size_t *data_size) const {\n    *data_size = StorageSize();\n    return data_;\n  }\n\n  void Init(const char *data, bool owned, MappedFile *file = nullptr);\n\n  const std::vector<Label> &GetContext(StateId s, NGramFstInst<A> *inst) const {\n    SetInstFuture(s, inst);\n    SetInstContext(inst);\n    return inst->context_;\n  }\n\n  size_t StorageSize() const {\n    return Storage(num_states_, num_futures_, num_final_);\n  }\n\n  void GetStates(const std::vector<Label> &context,\n                 std::vector<StateId> *states) const;\n\n private:\n  StateId Transition(const std::vector<Label> &context, Label future) const;\n\n  // Properties always true for this Fst class.\n  static const uint64 kStaticProperties =\n      kAcceptor | kIDeterministic | kODeterministic | kEpsilons | kIEpsilons |\n      kOEpsilons | kILabelSorted | kOLabelSorted | kWeighted | kCyclic |\n      kInitialAcyclic | kNotTopSorted | kAccessible | kCoAccessible |\n      kNotString | kExpanded;\n  // Current file format version.\n  static const int kFileVersion = 4;\n  // Minimum file format version supported.\n  static const int kMinFileVersion = 4;\n\n  std::unique_ptr<MappedFile> data_region_;\n  const char *data_ = nullptr;\n  bool owned_ = false;  // True if we own data_\n  StateId start_ = fst::kNoStateId;\n  uint64 num_states_ = 0;\n  uint64 num_futures_ = 0;\n  uint64 num_final_ = 0;\n  std::pair<size_t, size_t> select_root_;\n  const Label *root_children_ = nullptr;\n  // borrowed references\n  const uint64 *context_ = nullptr;\n  const uint64 *future_ = nullptr;\n  const uint64 *final_ = nullptr;\n  const Label *context_words_ = nullptr;\n  const Label *future_words_ = nullptr;\n  const Weight *backoff_ = nullptr;\n  const Weight *final_probs_ = nullptr;\n  const Weight *future_probs_ = nullptr;\n  BitmapIndex context_index_;\n  BitmapIndex future_index_;\n  BitmapIndex final_index_;\n};\n\ntemplate <typename A>\ninline void NGramFstImpl<A>::GetStates(\n    const std::vector<Label> &context,\n    std::vector<typename A::StateId> *states) const {\n  states->clear();\n  states->push_back(0);\n  typename std::vector<Label>::const_reverse_iterator cit = context.rbegin();\n  const Label *children = root_children_;\n  size_t num_children = select_root_.second - 2;\n  const Label *loc = std::lower_bound(children, children + num_children, *cit);\n  if (loc == children + num_children || *loc != *cit) return;\n  size_t node = 2 + loc - children;\n  states->push_back(context_index_.Rank1(node));\n  if (context.size() == 1) return;\n  size_t node_rank = context_index_.Rank1(node);\n  std::pair<size_t, size_t> zeros =\n      node_rank == 0 ? select_root_ : context_index_.Select0s(node_rank);\n  size_t first_child = zeros.first + 1;\n  ++cit;\n  if (context_index_.Get(first_child) != false) {\n    size_t last_child = zeros.second - 1;\n    while (cit != context.rend()) {\n      children = context_words_ + context_index_.Rank1(first_child);\n      loc = std::lower_bound(children, children + last_child - first_child + 1,\n                             *cit);\n      if (loc == children + last_child - first_child + 1 || *loc != *cit) {\n        break;\n      }\n      ++cit;\n      node = first_child + loc - children;\n      states->push_back(context_index_.Rank1(node));\n      node_rank = context_index_.Rank1(node);\n      zeros =\n          node_rank == 0 ? select_root_ : context_index_.Select0s(node_rank);\n      first_child = zeros.first + 1;\n      if (context_index_.Get(first_child) == false) break;\n      last_child = zeros.second - 1;\n    }\n  }\n}\n\n}  // namespace internal\n\n/*****************************************************************************/\ntemplate <class A>\nclass NGramFst : public ImplToExpandedFst<internal::NGramFstImpl<A>> {\n  friend class ArcIterator<NGramFst<A>>;\n  friend class NGramFstMatcher<A>;\n\n public:\n  typedef A Arc;\n  typedef typename A::StateId StateId;\n  typedef typename A::Label Label;\n  typedef typename A::Weight Weight;\n  typedef internal::NGramFstImpl<A> Impl;\n\n  explicit NGramFst(const Fst<A> &dst)\n      : ImplToExpandedFst<Impl>(std::make_shared<Impl>(dst, nullptr)) {}\n\n  NGramFst(const Fst<A> &fst, std::vector<StateId> *order_out)\n      : ImplToExpandedFst<Impl>(std::make_shared<Impl>(fst, order_out)) {}\n\n  // Because the NGramFstImpl is a const stateless data structure, there\n  // is never a need to do anything beside copy the reference.\n  NGramFst(const NGramFst<A> &fst, bool safe = false)\n      : ImplToExpandedFst<Impl>(fst, false) {}\n\n  NGramFst() : ImplToExpandedFst<Impl>(std::make_shared<Impl>()) {}\n\n  // Non-standard constructor to initialize NGramFst directly from data.\n  NGramFst(const char *data, bool owned)\n      : ImplToExpandedFst<Impl>(std::make_shared<Impl>()) {\n    GetMutableImpl()->Init(data, owned, nullptr);\n  }\n\n  // Get method that gets the data associated with Init().\n  const char *GetData(size_t *data_size) const {\n    return GetImpl()->GetData(data_size);\n  }\n\n  const std::vector<Label> GetContext(StateId s) const {\n    return GetImpl()->GetContext(s, &inst_);\n  }\n\n  // Consumes as much as possible of context from right to left, returns the\n  // the states corresponding to the increasingly conditioned input sequence.\n  void GetStates(const std::vector<Label> &context,\n                 std::vector<StateId> *state) const {\n    return GetImpl()->GetStates(context, state);\n  }\n\n  size_t NumArcs(StateId s) const override {\n    return GetImpl()->NumArcs(s, &inst_);\n  }\n\n  NGramFst<A> *Copy(bool safe = false) const override {\n    return new NGramFst(*this, safe);\n  }\n\n  static NGramFst<A> *Read(std::istream &strm, const FstReadOptions &opts) {\n    Impl *impl = Impl::Read(strm, opts);\n    return impl ? new NGramFst<A>(std::shared_ptr<Impl>(impl)) : nullptr;\n  }\n\n  static NGramFst<A> *Read(const string &filename) {\n    if (!filename.empty()) {\n      std::ifstream strm(filename,\n                              std::ios_base::in | std::ios_base::binary);\n      if (!strm.good()) {\n        LOG(ERROR) << \"NGramFst::Read: Can't open file: \" << filename;\n        return nullptr;\n      }\n      return Read(strm, FstReadOptions(filename));\n    } else {\n      return Read(std::cin, FstReadOptions(\"standard input\"));\n    }\n  }\n\n  bool Write(std::ostream &strm, const FstWriteOptions &opts) const override {\n    return GetImpl()->Write(strm, opts);\n  }\n\n  bool Write(const string &filename) const override {\n    return Fst<A>::WriteFile(filename);\n  }\n\n  inline void InitStateIterator(StateIteratorData<A> *data) const override {\n    GetImpl()->InitStateIterator(data);\n  }\n\n  inline void InitArcIterator(StateId s,\n                              ArcIteratorData<A> *data) const override;\n\n  MatcherBase<A> *InitMatcher(MatchType match_type) const override {\n    return new NGramFstMatcher<A>(this, match_type);\n  }\n\n  size_t StorageSize() const { return GetImpl()->StorageSize(); }\n\n  static bool HasRequiredProps(const Fst<A> &fst) {\n    static const auto props =\n        kAcceptor | kIDeterministic | kILabelSorted | kIEpsilons | kAccessible;\n    return fst.Properties(props, true) == props;\n  }\n\n  static bool HasRequiredStructure(const Fst<A> &fst) {\n    if (!HasRequiredProps(fst)) {\n      return false;\n    }\n    typename A::StateId unigram = fst.Start();\n    while (true) {  // Follows epsilon arc chain to find unigram state.\n      if (unigram == fst::kNoStateId) return false;  // No unigram state.\n      typename fst::ArcIterator<Fst<A>> aiter(fst, unigram);\n      if (aiter.Done() || aiter.Value().ilabel != 0) break;\n      unigram = aiter.Value().nextstate;\n      aiter.Next();\n    }\n    // Other requirement: all states other than unigram an epsilon arc.\n    for (fst::StateIterator<Fst<A>> siter(fst); !siter.Done();\n         siter.Next()) {\n      const typename A::StateId &state = siter.Value();\n      fst::ArcIterator<Fst<A>> aiter(fst, state);\n      if (state != unigram) {\n        if (aiter.Done()) return false;\n        if (aiter.Value().ilabel != 0) return false;\n        aiter.Next();\n        if (!aiter.Done() && aiter.Value().ilabel == 0) return false;\n      }\n    }\n    return true;\n  }\n\n private:\n  using ImplToExpandedFst<Impl, ExpandedFst<A>>::GetImpl;\n  using ImplToExpandedFst<Impl, ExpandedFst<A>>::GetMutableImpl;\n\n  explicit NGramFst(std::shared_ptr<Impl> impl)\n      : ImplToExpandedFst<Impl>(impl) {}\n\n  mutable NGramFstInst<A> inst_;\n};\n\ntemplate <class A>\ninline void NGramFst<A>::InitArcIterator(StateId s,\n                                         ArcIteratorData<A> *data) const {\n  GetImpl()->SetInstFuture(s, &inst_);\n  GetImpl()->SetInstNode(&inst_);\n  data->base = new ArcIterator<NGramFst<A>>(*this, s);\n}\n\nnamespace internal {\n\ntemplate <typename A>\nNGramFstImpl<A>::NGramFstImpl(const Fst<A> &fst,\n                              std::vector<StateId> *order_out) {\n  typedef A Arc;\n  typedef typename Arc::Label Label;\n  typedef typename Arc::Weight Weight;\n  typedef typename Arc::StateId StateId;\n  SetType(\"ngram\");\n  SetInputSymbols(fst.InputSymbols());\n  SetOutputSymbols(fst.OutputSymbols());\n  SetProperties(kStaticProperties);\n\n  // Check basic requirements for an OpenGrm language model Fst.\n  if (!NGramFst<A>::HasRequiredProps(fst)) {\n    FSTERROR() << \"NGramFst only accepts OpenGrm language models as input\";\n    SetProperties(kError, kError);\n    return;\n  }\n\n  int64 num_states = CountStates(fst);\n  Label *context = new Label[num_states];\n\n  // Find the unigram state by starting from the start state, following\n  // epsilons.\n  StateId unigram = fst.Start();\n  while (1) {\n    if (unigram == kNoStateId) {\n      FSTERROR() << \"Could not identify unigram state\";\n      SetProperties(kError, kError);\n      return;\n    }\n    ArcIterator<Fst<A>> aiter(fst, unigram);\n    if (aiter.Done()) {\n      LOG(WARNING) << \"Unigram state \" << unigram << \" has no arcs.\";\n      break;\n    }\n    if (aiter.Value().ilabel != 0) break;\n    unigram = aiter.Value().nextstate;\n  }\n\n  // Each state's context is determined by the subtree it is under from the\n  // unigram state.\n  std::queue<std::pair<StateId, Label>> label_queue;\n  std::vector<bool> visited(num_states);\n  // Force an epsilon link to the start state.\n  label_queue.push(std::make_pair(fst.Start(), 0));\n  for (ArcIterator<Fst<A>> aiter(fst, unigram); !aiter.Done(); aiter.Next()) {\n    label_queue.push(\n        std::make_pair(aiter.Value().nextstate, aiter.Value().ilabel));\n  }\n  // investigate states in breadth first fashion to assign context words.\n  while (!label_queue.empty()) {\n    std::pair<StateId, Label> &now = label_queue.front();\n    if (!visited[now.first]) {\n      context[now.first] = now.second;\n      visited[now.first] = true;\n      for (ArcIterator<Fst<A>> aiter(fst, now.first); !aiter.Done();\n           aiter.Next()) {\n        const Arc &arc = aiter.Value();\n        if (arc.ilabel != 0) {\n          label_queue.push(std::make_pair(arc.nextstate, now.second));\n        }\n      }\n    }\n    label_queue.pop();\n  }\n  visited.clear();\n\n  // The arc from the start state should be assigned an epsilon to put it\n  // in front of the all other labels (which makes Start state 1 after\n  // unigram which is state 0).\n  context[fst.Start()] = 0;\n\n  // Build the tree of contexts fst by reversing the epsilon arcs from fst.\n  VectorFst<Arc> context_fst;\n  uint64 num_final = 0;\n  for (int i = 0; i < num_states; ++i) {\n    if (fst.Final(i) != Weight::Zero()) {\n      ++num_final;\n    }\n    context_fst.SetFinal(context_fst.AddState(), fst.Final(i));\n  }\n  context_fst.SetStart(unigram);\n  context_fst.SetInputSymbols(fst.InputSymbols());\n  context_fst.SetOutputSymbols(fst.OutputSymbols());\n  int64 num_context_arcs = 0;\n  int64 num_futures = 0;\n  for (StateIterator<Fst<A>> siter(fst); !siter.Done(); siter.Next()) {\n    const StateId &state = siter.Value();\n    num_futures += fst.NumArcs(state) - fst.NumInputEpsilons(state);\n    ArcIterator<Fst<A>> aiter(fst, state);\n    if (!aiter.Done()) {\n      const Arc &arc = aiter.Value();\n      // this arc goes from state to arc.nextstate, so create an arc from\n      // arc.nextstate to state to reverse it.\n      if (arc.ilabel == 0) {\n        context_fst.AddArc(arc.nextstate, Arc(context[state], context[state],\n                                              arc.weight, state));\n        num_context_arcs++;\n      }\n    }\n  }\n  if (num_context_arcs != context_fst.NumStates() - 1) {\n    FSTERROR() << \"Number of contexts arcs != number of states - 1\";\n    SetProperties(kError, kError);\n    return;\n  }\n  if (context_fst.NumStates() != num_states) {\n    FSTERROR() << \"Number of contexts != number of states\";\n    SetProperties(kError, kError);\n    return;\n  }\n  int64 context_props =\n      context_fst.Properties(kIDeterministic | kILabelSorted, true);\n  if (!(context_props & kIDeterministic)) {\n    FSTERROR() << \"Input Fst is not structured properly\";\n    SetProperties(kError, kError);\n    return;\n  }\n  if (!(context_props & kILabelSorted)) {\n    ArcSort(&context_fst, ILabelCompare<Arc>());\n  }\n\n  delete[] context;\n\n  uint64 b64;\n  Weight weight;\n  Label label = kNoLabel;\n  const size_t storage = Storage(num_states, num_futures, num_final);\n  MappedFile *data_region = MappedFile::Allocate(storage);\n  char *data = reinterpret_cast<char *>(data_region->mutable_data());\n  memset(data, 0, storage);\n  size_t offset = 0;\n  memcpy(data + offset, reinterpret_cast<char *>(&num_states),\n         sizeof(num_states));\n  offset += sizeof(num_states);\n  memcpy(data + offset, reinterpret_cast<char *>(&num_futures),\n         sizeof(num_futures));\n  offset += sizeof(num_futures);\n  memcpy(data + offset, reinterpret_cast<char *>(&num_final),\n         sizeof(num_final));\n  offset += sizeof(num_final);\n  uint64 *context_bits = reinterpret_cast<uint64 *>(data + offset);\n  offset += BitmapIndex::StorageSize(num_states * 2 + 1) * sizeof(b64);\n  uint64 *future_bits = reinterpret_cast<uint64 *>(data + offset);\n  offset +=\n      BitmapIndex::StorageSize(num_futures + num_states + 1) * sizeof(b64);\n  uint64 *final_bits = reinterpret_cast<uint64 *>(data + offset);\n  offset += BitmapIndex::StorageSize(num_states) * sizeof(b64);\n  Label *context_words = reinterpret_cast<Label *>(data + offset);\n  offset += (num_states + 1) * sizeof(label);\n  Label *future_words = reinterpret_cast<Label *>(data + offset);\n  offset += num_futures * sizeof(label);\n  offset = (offset + sizeof(weight) - 1) & ~(sizeof(weight) - 1);\n  Weight *backoff = reinterpret_cast<Weight *>(data + offset);\n  offset += (num_states + 1) * sizeof(weight);\n  Weight *final_probs = reinterpret_cast<Weight *>(data + offset);\n  offset += num_final * sizeof(weight);\n  Weight *future_probs = reinterpret_cast<Weight *>(data + offset);\n  int64 context_arc = 0, future_arc = 0, context_bit = 0, future_bit = 0,\n        final_bit = 0;\n\n  // pseudo-root bits\n  BitmapIndex::Set(context_bits, context_bit++);\n  ++context_bit;\n  context_words[context_arc] = label;\n  backoff[context_arc] = Weight::Zero();\n  context_arc++;\n\n  ++future_bit;\n  if (order_out) {\n    order_out->clear();\n    order_out->resize(num_states);\n  }\n\n  std::queue<StateId> context_q;\n  context_q.push(context_fst.Start());\n  StateId state_number = 0;\n  while (!context_q.empty()) {\n    const StateId &state = context_q.front();\n    if (order_out) {\n      (*order_out)[state] = state_number;\n    }\n\n    const Weight final_weight = context_fst.Final(state);\n    if (final_weight != Weight::Zero()) {\n      BitmapIndex::Set(final_bits, state_number);\n      final_probs[final_bit] = final_weight;\n      ++final_bit;\n    }\n\n    for (ArcIterator<VectorFst<A>> aiter(context_fst, state); !aiter.Done();\n         aiter.Next()) {\n      const Arc &arc = aiter.Value();\n      context_words[context_arc] = arc.ilabel;\n      backoff[context_arc] = arc.weight;\n      ++context_arc;\n      BitmapIndex::Set(context_bits, context_bit++);\n      context_q.push(arc.nextstate);\n    }\n    ++context_bit;\n\n    for (ArcIterator<Fst<A>> aiter(fst, state); !aiter.Done(); aiter.Next()) {\n      const Arc &arc = aiter.Value();\n      if (arc.ilabel != 0) {\n        future_words[future_arc] = arc.ilabel;\n        future_probs[future_arc] = arc.weight;\n        ++future_arc;\n        BitmapIndex::Set(future_bits, future_bit++);\n      }\n    }\n    ++future_bit;\n    ++state_number;\n    context_q.pop();\n  }\n\n  if ((state_number != num_states) || (context_bit != num_states * 2 + 1) ||\n      (context_arc != num_states) || (future_arc != num_futures) ||\n      (future_bit != num_futures + num_states + 1) ||\n      (final_bit != num_final)) {\n    FSTERROR() << \"Structure problems detected during construction\";\n    SetProperties(kError, kError);\n    return;\n  }\n\n  Init(data, false, data_region);\n}\n\ntemplate <typename A>\ninline void NGramFstImpl<A>::Init(const char *data, bool owned,\n                                  MappedFile *data_region) {\n  if (owned_) {\n    delete[] data_;\n  }\n  data_region_.reset(data_region);\n  owned_ = owned;\n  data_ = data;\n  size_t offset = 0;\n  num_states_ = *(reinterpret_cast<const uint64 *>(data_ + offset));\n  offset += sizeof(num_states_);\n  num_futures_ = *(reinterpret_cast<const uint64 *>(data_ + offset));\n  offset += sizeof(num_futures_);\n  num_final_ = *(reinterpret_cast<const uint64 *>(data_ + offset));\n  offset += sizeof(num_final_);\n  uint64 bits;\n  size_t context_bits = num_states_ * 2 + 1;\n  size_t future_bits = num_futures_ + num_states_ + 1;\n  context_ = reinterpret_cast<const uint64 *>(data_ + offset);\n  offset += BitmapIndex::StorageSize(context_bits) * sizeof(bits);\n  future_ = reinterpret_cast<const uint64 *>(data_ + offset);\n  offset += BitmapIndex::StorageSize(future_bits) * sizeof(bits);\n  final_ = reinterpret_cast<const uint64 *>(data_ + offset);\n  offset += BitmapIndex::StorageSize(num_states_) * sizeof(bits);\n  context_words_ = reinterpret_cast<const Label *>(data_ + offset);\n  offset += (num_states_ + 1) * sizeof(*context_words_);\n  future_words_ = reinterpret_cast<const Label *>(data_ + offset);\n  offset += num_futures_ * sizeof(*future_words_);\n  offset = (offset + sizeof(*backoff_) - 1) & ~(sizeof(*backoff_) - 1);\n  backoff_ = reinterpret_cast<const Weight *>(data_ + offset);\n  offset += (num_states_ + 1) * sizeof(*backoff_);\n  final_probs_ = reinterpret_cast<const Weight *>(data_ + offset);\n  offset += num_final_ * sizeof(*final_probs_);\n  future_probs_ = reinterpret_cast<const Weight *>(data_ + offset);\n\n  context_index_.BuildIndex(context_, context_bits);\n  future_index_.BuildIndex(future_, future_bits);\n  final_index_.BuildIndex(final_, num_states_);\n\n  select_root_ = context_index_.Select0s(0);\n  if (context_index_.Rank1(0) != 0 || select_root_.first != 1 ||\n      context_index_.Get(2) == false) {\n    FSTERROR() << \"Malformed file\";\n    SetProperties(kError, kError);\n    return;\n  }\n  root_children_ = context_words_ + context_index_.Rank1(2);\n  start_ = 1;\n}\n\ntemplate <typename A>\ninline typename A::StateId NGramFstImpl<A>::Transition(\n    const std::vector<Label> &context, Label future) const {\n  const Label *children = root_children_;\n  size_t num_children = select_root_.second - 2;\n  const Label *loc =\n      std::lower_bound(children, children + num_children, future);\n  if (loc == children + num_children || *loc != future) {\n    return context_index_.Rank1(0);\n  }\n  size_t node = 2 + loc - children;\n  size_t node_rank = context_index_.Rank1(node);\n  std::pair<size_t, size_t> zeros =\n      (node_rank == 0) ? select_root_ : context_index_.Select0s(node_rank);\n  size_t first_child = zeros.first + 1;\n  if (context_index_.Get(first_child) == false) {\n    return context_index_.Rank1(node);\n  }\n  size_t last_child = zeros.second - 1;\n  for (int word = context.size() - 1; word >= 0; --word) {\n    children = context_words_ + context_index_.Rank1(first_child);\n    loc = std::lower_bound(children, children + last_child - first_child + 1,\n                           context[word]);\n    if (loc == children + last_child - first_child + 1 ||\n        *loc != context[word]) {\n      break;\n    }\n    node = first_child + loc - children;\n    node_rank = context_index_.Rank1(node);\n    zeros =\n        (node_rank == 0) ? select_root_ : context_index_.Select0s(node_rank);\n    first_child = zeros.first + 1;\n    if (context_index_.Get(first_child) == false) break;\n    last_child = zeros.second - 1;\n  }\n  return context_index_.Rank1(node);\n}\n\n}  // namespace internal\n\n/*****************************************************************************/\ntemplate <class A>\nclass NGramFstMatcher : public MatcherBase<A> {\n public:\n  typedef A Arc;\n  typedef typename A::Label Label;\n  typedef typename A::StateId StateId;\n  typedef typename A::Weight Weight;\n\n  // This makes a copy of the FST.\n  NGramFstMatcher(const NGramFst<A> &fst, MatchType match_type)\n      : owned_fst_(fst.Copy()),\n        fst_(*owned_fst_),\n        inst_(fst_.inst_),\n        match_type_(match_type),\n        current_loop_(false),\n        loop_(kNoLabel, 0, A::Weight::One(), kNoStateId) {\n    if (match_type_ == MATCH_OUTPUT) {\n      std::swap(loop_.ilabel, loop_.olabel);\n    }\n  }\n\n  // This doesn't copy the FST.\n  NGramFstMatcher(const NGramFst<A> *fst, MatchType match_type)\n      : fst_(*fst),\n        inst_(fst_.inst_),\n        match_type_(match_type),\n        current_loop_(false),\n        loop_(kNoLabel, 0, A::Weight::One(), kNoStateId) {\n    if (match_type_ == MATCH_OUTPUT) {\n      std::swap(loop_.ilabel, loop_.olabel);\n    }\n  }\n\n  // This makes a copy of the FST.\n  NGramFstMatcher(const NGramFstMatcher<A> &matcher, bool safe = false)\n      : owned_fst_(matcher.fst_.Copy(safe)),\n        fst_(*owned_fst_),\n        inst_(matcher.inst_),\n        match_type_(matcher.match_type_),\n        current_loop_(false),\n        loop_(kNoLabel, 0, A::Weight::One(), kNoStateId) {\n    if (match_type_ == MATCH_OUTPUT) {\n      std::swap(loop_.ilabel, loop_.olabel);\n    }\n  }\n\n  NGramFstMatcher<A> *Copy(bool safe = false) const override {\n    return new NGramFstMatcher<A>(*this, safe);\n  }\n\n  MatchType Type(bool test) const override { return match_type_; }\n\n  const Fst<A> &GetFst() const override { return fst_; }\n\n  uint64 Properties(uint64 props) const override { return props; }\n\n  void SetState(StateId s) final {\n    fst_.GetImpl()->SetInstFuture(s, &inst_);\n    current_loop_ = false;\n  }\n\n  bool Find(Label label) final {\n    const Label nolabel = kNoLabel;\n    done_ = true;\n    if (label == 0 || label == nolabel) {\n      if (label == 0) {\n        current_loop_ = true;\n        loop_.nextstate = inst_.state_;\n      }\n      // The unigram state has no epsilon arc.\n      if (inst_.state_ != 0) {\n        arc_.ilabel = arc_.olabel = 0;\n        fst_.GetImpl()->SetInstNode(&inst_);\n        arc_.nextstate = fst_.GetImpl()->context_index_.Rank1(\n            fst_.GetImpl()->context_index_.Select1(\n                fst_.GetImpl()->context_index_.Rank0(inst_.node_) - 1));\n        arc_.weight = fst_.GetImpl()->backoff_[inst_.state_];\n        done_ = false;\n      }\n    } else {\n      current_loop_ = false;\n      const Label *start = fst_.GetImpl()->future_words_ + inst_.offset_;\n      const Label *end = start + inst_.num_futures_;\n      const Label *search = std::lower_bound(start, end, label);\n      if (search != end && *search == label) {\n        size_t state = search - start;\n        arc_.ilabel = arc_.olabel = label;\n        arc_.weight = fst_.GetImpl()->future_probs_[inst_.offset_ + state];\n        fst_.GetImpl()->SetInstContext(&inst_);\n        arc_.nextstate = fst_.GetImpl()->Transition(inst_.context_, label);\n        done_ = false;\n      }\n    }\n    return !Done();\n  }\n\n  bool Done() const final { return !current_loop_ && done_; }\n\n  const Arc &Value() const final { return (current_loop_) ? loop_ : arc_; }\n\n  void Next() final {\n    if (current_loop_) {\n      current_loop_ = false;\n    } else {\n      done_ = true;\n    }\n  }\n\n  std::ptrdiff_t Priority(StateId s) final { return fst_.NumArcs(s); }\n\n private:\n  std::unique_ptr<NGramFst<A>> owned_fst_;\n  const NGramFst<A> &fst_;\n  NGramFstInst<A> inst_;\n  MatchType match_type_;  // Supplied by caller\n  bool done_;\n  Arc arc_;\n  bool current_loop_;  // Current arc is the implicit loop\n  Arc loop_;\n};\n\n/*****************************************************************************/\n// Specialization for NGramFst; see generic version in fst.h\n// for sample usage (but use the ProdLmFst type!). This version\n// should inline.\ntemplate <class A>\nclass StateIterator<NGramFst<A>> : public StateIteratorBase<A> {\n public:\n  typedef typename A::StateId StateId;\n\n  explicit StateIterator(const NGramFst<A> &fst)\n      : s_(0), num_states_(fst.NumStates()) {}\n\n  bool Done() const final { return s_ >= num_states_; }\n\n  StateId Value() const final { return s_; }\n\n  void Next() final { ++s_; }\n\n  void Reset() final { s_ = 0; }\n\n private:\n  StateId s_;\n  StateId num_states_;\n};\n\n/*****************************************************************************/\ntemplate <class A>\nclass ArcIterator<NGramFst<A>> : public ArcIteratorBase<A> {\n public:\n  typedef A Arc;\n  typedef typename A::Label Label;\n  typedef typename A::StateId StateId;\n  typedef typename A::Weight Weight;\n\n  ArcIterator(const NGramFst<A> &fst, StateId state)\n      : lazy_(~0), impl_(fst.GetImpl()), i_(0), flags_(kArcValueFlags) {\n    inst_ = fst.inst_;\n    impl_->SetInstFuture(state, &inst_);\n    impl_->SetInstNode(&inst_);\n  }\n\n  bool Done() const final {\n    return i_ >=\n           ((inst_.node_ == 0) ? inst_.num_futures_ : inst_.num_futures_ + 1);\n  }\n\n  const Arc &Value() const final {\n    bool eps = (inst_.node_ != 0 && i_ == 0);\n    StateId state = (inst_.node_ == 0) ? i_ : i_ - 1;\n    if (flags_ & lazy_ & (kArcILabelValue | kArcOLabelValue)) {\n      arc_.ilabel = arc_.olabel =\n          eps ? 0 : impl_->future_words_[inst_.offset_ + state];\n      lazy_ &= ~(kArcILabelValue | kArcOLabelValue);\n    }\n    if (flags_ & lazy_ & kArcNextStateValue) {\n      if (eps) {\n        arc_.nextstate =\n            impl_->context_index_.Rank1(impl_->context_index_.Select1(\n                impl_->context_index_.Rank0(inst_.node_) - 1));\n      } else {\n        if (lazy_ & kArcNextStateValue) {\n          impl_->SetInstContext(&inst_);  // first time only.\n        }\n        arc_.nextstate = impl_->Transition(\n            inst_.context_, impl_->future_words_[inst_.offset_ + state]);\n      }\n      lazy_ &= ~kArcNextStateValue;\n    }\n    if (flags_ & lazy_ & kArcWeightValue) {\n      arc_.weight = eps ? impl_->backoff_[inst_.state_]\n                        : impl_->future_probs_[inst_.offset_ + state];\n      lazy_ &= ~kArcWeightValue;\n    }\n    return arc_;\n  }\n\n  void Next() final {\n    ++i_;\n    lazy_ = ~0;\n  }\n\n  size_t Position() const final { return i_; }\n\n  void Reset() final {\n    i_ = 0;\n    lazy_ = ~0;\n  }\n\n  void Seek(size_t a) final {\n    if (i_ != a) {\n      i_ = a;\n      lazy_ = ~0;\n    }\n  }\n\n  uint32 Flags() const final { return flags_; }\n\n  void SetFlags(uint32 flags, uint32 mask) final {\n    flags_ &= ~mask;\n    flags_ |= (flags & kArcValueFlags);\n  }\n\n private:\n  mutable Arc arc_;\n  mutable uint32 lazy_;\n  const internal::NGramFstImpl<A> *impl_;  // Borrowed reference.\n  mutable NGramFstInst<A> inst_;\n\n  size_t i_;\n  uint32 flags_;\n};\n\n}  // namespace fst\n#endif  // FST_EXTENSIONS_NGRAM_NGRAM_FST_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/pair-weight.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Pair weight templated base class for weight classes that contain two weights\n// (e.g. Product, Lexicographic).\n\n#ifndef FST_PAIR_WEIGHT_H_\n#define FST_PAIR_WEIGHT_H_\n\n#include <climits>\n#include <stack>\n#include <string>\n#include <utility>\n\n#include <fst/flags.h>\n#include <fst/log.h>\n\n#include <fst/weight.h>\n\n\nnamespace fst {\n\ntemplate <class W1, class W2>\nclass PairWeight {\n public:\n  using ReverseWeight =\n      PairWeight<typename W1::ReverseWeight, typename W2::ReverseWeight>;\n\n  PairWeight() {}\n\n  PairWeight(const PairWeight &weight)\n      : value1_(weight.value1_), value2_(weight.value2_) {}\n\n  PairWeight(W1 w1, W2 w2) : value1_(std::move(w1)), value2_(std::move(w2)) {}\n\n  static const PairWeight<W1, W2> &Zero() {\n    static const PairWeight zero(W1::Zero(), W2::Zero());\n    return zero;\n  }\n\n  static const PairWeight<W1, W2> &One() {\n    static const PairWeight one(W1::One(), W2::One());\n    return one;\n  }\n\n  static const PairWeight<W1, W2> &NoWeight() {\n    static const PairWeight no_weight(W1::NoWeight(), W2::NoWeight());\n    return no_weight;\n  }\n\n  std::istream &Read(std::istream &strm) {\n    value1_.Read(strm);\n    return value2_.Read(strm);\n  }\n\n  std::ostream &Write(std::ostream &strm) const {\n    value1_.Write(strm);\n    return value2_.Write(strm);\n  }\n\n  PairWeight<W1, W2> &operator=(const PairWeight<W1, W2> &weight) {\n    value1_ = weight.Value1();\n    value2_ = weight.Value2();\n    return *this;\n  }\n\n  bool Member() const { return value1_.Member() && value2_.Member(); }\n\n  size_t Hash() const {\n    const auto h1 = value1_.Hash();\n    const auto h2 = value2_.Hash();\n    static constexpr int lshift = 5;\n    static constexpr int rshift = CHAR_BIT * sizeof(size_t) - 5;\n    return h1 << lshift ^ h1 >> rshift ^ h2;\n  }\n\n  PairWeight<W1, W2> Quantize(float delta = kDelta) const {\n    return PairWeight<W1, W2>(value1_.Quantize(delta), value2_.Quantize(delta));\n  }\n\n  ReverseWeight Reverse() const {\n    return ReverseWeight(value1_.Reverse(), value2_.Reverse());\n  }\n\n  const W1 &Value1() const { return value1_; }\n\n  const W2 &Value2() const { return value2_; }\n\n  void SetValue1(const W1 &weight) { value1_ = weight; }\n\n  void SetValue2(const W2 &weight) { value2_ = weight; }\n\n private:\n  W1 value1_;\n  W2 value2_;\n};\n\ntemplate <class W1, class W2>\ninline bool operator==(const PairWeight<W1, W2> &w1,\n                       const PairWeight<W1, W2> &w2) {\n  return w1.Value1() == w2.Value1() && w1.Value2() == w2.Value2();\n}\n\ntemplate <class W1, class W2>\ninline bool operator!=(const PairWeight<W1, W2> &w1,\n                       const PairWeight<W1, W2> &w2) {\n  return w1.Value1() != w2.Value1() || w1.Value2() != w2.Value2();\n}\n\ntemplate <class W1, class W2>\ninline bool ApproxEqual(const PairWeight<W1, W2> &w1,\n                        const PairWeight<W1, W2> &w2, float delta = kDelta) {\n  return ApproxEqual(w1.Value1(), w2.Value1(), delta) &&\n         ApproxEqual(w1.Value2(), w2.Value2(), delta);\n}\n\ntemplate <class W1, class W2>\ninline std::ostream &operator<<(std::ostream &strm,\n                                const PairWeight<W1, W2> &weight) {\n  CompositeWeightWriter writer(strm);\n  writer.WriteBegin();\n  writer.WriteElement(weight.Value1());\n  writer.WriteElement(weight.Value2());\n  writer.WriteEnd();\n  return strm;\n}\n\ntemplate <class W1, class W2>\ninline std::istream &operator>>(std::istream &strm,\n                                PairWeight<W1, W2> &weight) {\n  CompositeWeightReader reader(strm);\n  reader.ReadBegin();\n  W1 w1;\n  reader.ReadElement(&w1);\n  weight.SetValue1(w1);\n  W2 w2;\n  reader.ReadElement(&w2, true);\n  weight.SetValue2(w2);\n  reader.ReadEnd();\n  return strm;\n}\n\n// This function object returns weights by calling the underlying generators\n// and forming a pair. This is intended primarily for testing.\ntemplate <class W1, class W2>\nclass WeightGenerate<PairWeight<W1, W2>> {\n public:\n  using Weight = PairWeight<W1, W2>;\n  using Generate1 = WeightGenerate<W1>;\n  using Generate2 = WeightGenerate<W2>;\n\n  explicit WeightGenerate(bool allow_zero = true)\n      : generate1_(allow_zero), generate2_(allow_zero) {}\n\n  Weight operator()() const { return Weight(generate1_(), generate2_()); }\n\n private:\n  Generate1 generate1_;\n  Generate2 generate2_;\n};\n\n}  // namespace fst\n\n#endif  // FST_PAIR_WEIGHT_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/paren.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Common classes for PDT parentheses.\n\n#ifndef FST_EXTENSIONS_PDT_PAREN_H_\n#define FST_EXTENSIONS_PDT_PAREN_H_\n\n#include <algorithm>\n#include <set>\n#include <unordered_map>\n#include <unordered_set>\n\n#include <fst/log.h>\n\n#include <fst/extensions/pdt/collection.h>\n#include <fst/extensions/pdt/pdt.h>\n#include <fst/dfs-visit.h>\n#include <fst/fst.h>\n\n\nnamespace fst {\nnamespace internal {\n\n// ParenState: Pair of an open (close) parenthesis and its destination (source)\n// state.\n\ntemplate <class Arc>\nstruct ParenState {\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n\n  Label paren_id;    // ID of open (close) paren.\n  StateId state_id;  // Destination (source) state of open (close) paren.\n\n  explicit ParenState(Label paren_id = kNoLabel, StateId state_id = kNoStateId)\n      : paren_id(paren_id), state_id(state_id) {}\n\n  bool operator==(const ParenState<Arc> &other) const {\n    if (&other == this) return true;\n    return other.paren_id == paren_id && other.state_id == state_id;\n  }\n\n  bool operator!=(const ParenState<Arc> &other) const {\n    return !(other == *this);\n  }\n\n  struct Hash {\n    size_t operator()(const ParenState<Arc> &pstate) const {\n      static constexpr auto prime = 7853;\n      return pstate.paren_id + pstate.state_id * prime;\n    }\n  };\n};\n\n// Creates an FST-style const iterator from an STL-style map.\ntemplate <class Map>\nclass MapIterator {\n public:\n  using StlIterator = typename Map::const_iterator;\n  using ValueType = typename Map::mapped_type;\n\n  MapIterator(const Map &map, StlIterator it)\n      : begin_(it), end_(map.end()), it_(it) {}\n\n  bool Done() const { return it_ == end_ || it_->first != begin_->first; }\n\n  ValueType Value() const { return it_->second; }\n\n  void Next() { ++it_; }\n\n  void Reset() { it_ = begin_; }\n\n private:\n  const StlIterator begin_;\n  const StlIterator end_;\n  StlIterator it_;\n};\n\n// PdtParenReachable: Provides various parenthesis reachability information.\n\ntemplate <class Arc>\nclass PdtParenReachable {\n public:\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n\n  using State = ParenState<Arc>;\n  using StateHash = typename State::Hash;\n\n  // Maps from state ID to reachable paren IDs from (to) that state.\n  using ParenMultimap = std::unordered_multimap<StateId, Label>;\n\n  // Maps from paren ID and state ID to reachable state set ID.\n  using StateSetMap = std::unordered_map<State, std::ptrdiff_t, StateHash>;\n\n  // Maps from paren ID and state ID to arcs exiting that state with that\n  // Label.\n  using ParenArcMultimap = std::unordered_map<State, Arc, StateHash>;\n\n  using ParenIterator = MapIterator<ParenMultimap>;\n\n  using ParenArcIterator = MapIterator<ParenArcMultimap>;\n\n  using SetIterator = typename Collection<std::ptrdiff_t, StateId>::SetIterator;\n\n  // Computes close (open) parenthesis reachability information for a PDT with\n  // bounded stack.\n  PdtParenReachable(const Fst<Arc> &fst,\n                    const std::vector<std::pair<Label, Label>> &parens,\n                    bool close)\n      : fst_(fst), parens_(parens), close_(close), error_(false) {\n    paren_map_.reserve(2 * parens.size());\n    for (size_t i = 0; i < parens.size(); ++i) {\n      const auto &pair = parens[i];\n      paren_map_[pair.first] = i;\n      paren_map_[pair.second] = i;\n    }\n    if (close_) {\n      const auto start = fst.Start();\n      if (start == kNoStateId) return;\n      if (!DFSearch(start)) {\n        FSTERROR() << \"PdtReachable: Underlying cyclicity not supported\";\n        error_ = true;\n      }\n    } else {\n      FSTERROR() << \"PdtParenReachable: Open paren info not implemented\";\n      error_ = true;\n    }\n  }\n\n  bool Error() const { return error_; }\n\n  // Given a state ID, returns an iterator over paren IDs for close (open)\n  // parens reachable from that state along balanced paths.\n  ParenIterator FindParens(StateId s) const {\n    return ParenIterator(paren_multimap_, paren_multimap_.find(s));\n  }\n\n  // Given a paren ID and a state ID s, returns an iterator over states that can\n  // be reached along balanced paths from (to) s that have have close (open)\n  // parentheses matching the paren ID exiting (entering) those states.\n  SetIterator FindStates(Label paren_id, StateId s) const {\n    const State paren_state(paren_id, s);\n    const auto it = set_map_.find(paren_state);\n    if (it == set_map_.end()) {\n      return state_sets_.FindSet(-1);\n    } else {\n      return state_sets_.FindSet(it->second);\n    }\n  }\n\n  // Given a paren ID and a state ID s, return an iterator over arcs that exit\n  // (enter) s and are labeled with a close (open) parenthesis matching the\n  // paren ID.\n  ParenArcIterator FindParenArcs(Label paren_id, StateId s) const {\n    const State paren_state(paren_id, s);\n    return ParenArcIterator(paren_arc_multimap_,\n                            paren_arc_multimap_.find(paren_state));\n  }\n\n private:\n  // Returns false when cycle detected during DFS gathering paren and state set\n  // information.\n  bool DFSearch(StateId s);\n\n  // Unions state sets together gathered by the DFS.\n  void ComputeStateSet(StateId s);\n\n  // Gathers state set(s) from state.\n  void UpdateStateSet(StateId nextstate, std::set<Label> *paren_set,\n                      std::vector<std::set<StateId>> *state_sets) const;\n\n  const Fst<Arc> &fst_;\n  // Paren IDs to labels.\n  const std::vector<std::pair<Label, Label>> &parens_;\n  // Close/open paren info?\n  const bool close_;\n  // Labels to paren IDs.\n  std::unordered_map<Label, Label> paren_map_;\n  // Paren reachability.\n  ParenMultimap paren_multimap_;\n  // Paren arcs.\n  ParenArcMultimap paren_arc_multimap_;\n  // DFS states.\n  std::vector<uint8> state_color_;\n  // Reachable states to IDs.\n  mutable Collection<std::ptrdiff_t, StateId> state_sets_;\n  // IDs to reachable states.\n  StateSetMap set_map_;\n  bool error_;\n\n  PdtParenReachable(const PdtParenReachable &) = delete;\n  PdtParenReachable &operator=(const PdtParenReachable &) = delete;\n};\n\n// Gathers paren and state set information.\ntemplate <class Arc>\nbool PdtParenReachable<Arc>::DFSearch(StateId s) {\n  static constexpr uint8 kWhiteState = 0x01;  // Undiscovered.\n  static constexpr uint8 kGreyState = 0x02;   // Discovered & unfinished.\n  static constexpr uint8 kBlackState = 0x04;  // Finished.\n  if (s >= state_color_.size()) state_color_.resize(s + 1, kWhiteState);\n  if (state_color_[s] == kBlackState) return true;\n  if (state_color_[s] == kGreyState) return false;\n  state_color_[s] = kGreyState;\n  for (ArcIterator<Fst<Arc>> aiter(fst_, s); !aiter.Done(); aiter.Next()) {\n    const auto &arc = aiter.Value();\n    const auto it = paren_map_.find(arc.ilabel);\n    if (it != paren_map_.end()) {  // Paren?\n      const auto paren_id = it->second;\n      if (arc.ilabel == parens_[paren_id].first) {  // Open paren?\n        if (!DFSearch(arc.nextstate)) return false;\n        for (auto set_iter = FindStates(paren_id, arc.nextstate);\n             !set_iter.Done(); set_iter.Next()) {\n          for (auto paren_arc_iter =\n                   FindParenArcs(paren_id, set_iter.Element());\n               !paren_arc_iter.Done(); paren_arc_iter.Next()) {\n            const auto &cparc = paren_arc_iter.Value();\n            if (!DFSearch(cparc.nextstate)) return false;\n          }\n        }\n      }\n    } else if (!DFSearch(arc.nextstate)) {  // Non-paren.\n      return false;\n    }\n  }\n  ComputeStateSet(s);\n  state_color_[s] = kBlackState;\n  return true;\n}\n\n// Unions state sets.\ntemplate <class Arc>\nvoid PdtParenReachable<Arc>::ComputeStateSet(StateId s) {\n  std::set<Label> paren_set;\n  std::vector<std::set<StateId>> state_sets(parens_.size());\n  for (ArcIterator<Fst<Arc>> aiter(fst_, s); !aiter.Done(); aiter.Next()) {\n    const auto &arc = aiter.Value();\n    const auto it = paren_map_.find(arc.ilabel);\n    if (it != paren_map_.end()) {  // Paren?\n      const auto paren_id = it->second;\n      if (arc.ilabel == parens_[paren_id].first) {  // Open paren?\n        for (auto set_iter = FindStates(paren_id, arc.nextstate);\n             !set_iter.Done(); set_iter.Next()) {\n          for (auto paren_arc_iter =\n                   FindParenArcs(paren_id, set_iter.Element());\n               !paren_arc_iter.Done(); paren_arc_iter.Next()) {\n            const auto &cparc = paren_arc_iter.Value();\n            UpdateStateSet(cparc.nextstate, &paren_set, &state_sets);\n          }\n        }\n      } else {  // Close paren.\n        paren_set.insert(paren_id);\n        state_sets[paren_id].insert(s);\n        const State paren_state(paren_id, s);\n        paren_arc_multimap_.insert(std::make_pair(paren_state, arc));\n      }\n    } else {  // Non-paren.\n      UpdateStateSet(arc.nextstate, &paren_set, &state_sets);\n    }\n  }\n  std::vector<StateId> state_set;\n  for (auto paren_iter = paren_set.begin(); paren_iter != paren_set.end();\n       ++paren_iter) {\n    state_set.clear();\n    const auto paren_id = *paren_iter;\n    paren_multimap_.insert(std::make_pair(s, paren_id));\n    for (auto state_iter = state_sets[paren_id].begin();\n         state_iter != state_sets[paren_id].end(); ++state_iter) {\n      state_set.push_back(*state_iter);\n    }\n    const State paren_state(paren_id, s);\n    set_map_[paren_state] = state_sets_.FindId(state_set);\n  }\n}\n\n// Gathers state sets.\ntemplate <class Arc>\nvoid PdtParenReachable<Arc>::UpdateStateSet(\n    StateId nextstate, std::set<Label> *paren_set,\n    std::vector<std::set<StateId>> *state_sets) const {\n  for (auto paren_iter = FindParens(nextstate); !paren_iter.Done();\n       paren_iter.Next()) {\n    const auto paren_id = paren_iter.Value();\n    paren_set->insert(paren_id);\n    for (auto set_iter = FindStates(paren_id, nextstate); !set_iter.Done();\n         set_iter.Next()) {\n      (*state_sets)[paren_id].insert(set_iter.Element());\n    }\n  }\n}\n\n// Stores balancing parenthesis data for a PDT. Unlike PdtParenReachable above\n// this allows on-the-fly construction (e.g., in PdtShortestPath).\ntemplate <class Arc>\nclass PdtBalanceData {\n public:\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n\n  using State = ParenState<Arc>;\n  using StateHash = typename State::Hash;\n\n  // Set for open parens.\n  using OpenParenSet = std::unordered_set<State, StateHash>;\n\n  // Maps from open paren destination state to parenthesis ID.\n  using OpenParenMap = std::unordered_multimap<StateId, Label>;\n\n  // Maps from open paren state to source states of matching close parens\n  using CloseParenMap = std::unordered_multimap<State, StateId, StateHash>;\n\n  // Maps from open paren state to close source set ID.\n  using CloseSourceMap = std::unordered_map<State, std::ptrdiff_t, StateHash>;\n\n  using SetIterator = typename Collection<std::ptrdiff_t, StateId>::SetIterator;\n\n  PdtBalanceData() {}\n\n  void Clear() {\n    open_paren_map_.clear();\n    close_paren_map_.clear();\n  }\n\n  // Adds an open parenthesis with destination state open_dest.\n  void OpenInsert(Label paren_id, StateId open_dest) {\n    const State key(paren_id, open_dest);\n    if (!open_paren_set_.count(key)) {\n      open_paren_set_.insert(key);\n      open_paren_map_.emplace(open_dest, paren_id);\n    }\n  }\n\n  // Adds a matching closing parenthesis with source state close_source\n  // balancing an open_parenthesis with destination state open_dest if\n  // OpenInsert() previously called.\n  void CloseInsert(Label paren_id, StateId open_dest, StateId close_source) {\n    const State key(paren_id, open_dest);\n    if (open_paren_set_.count(key)) {\n      close_paren_map_.emplace(key, close_source);\n    }\n  }\n\n  // Finds close paren source states matching an open parenthesis. The following\n  // methods are then used to iterate through those matching states. Should be\n  // called only after FinishInsert(open_dest).\n  SetIterator Find(Label paren_id, StateId open_dest) {\n    const State key(paren_id, open_dest);\n    const auto it = close_source_map_.find(key);\n    if (it == close_source_map_.end()) {\n      return close_source_sets_.FindSet(-1);\n    } else {\n      return close_source_sets_.FindSet(it->second);\n    }\n  }\n\n  // Called when all open and close parenthesis insertions (w.r.t. open\n  // parentheses entering state open_dest) are finished. Must be called before\n  // Find(open_dest).\n  void FinishInsert(StateId open_dest) {\n    std::vector<StateId> close_sources;\n    for (auto oit = open_paren_map_.find(open_dest);\n         oit != open_paren_map_.end() && oit->first == open_dest;) {\n      const auto paren_id = oit->second;\n      close_sources.clear();\n      const State key(paren_id, open_dest);\n      open_paren_set_.erase(open_paren_set_.find(key));\n      for (auto cit = close_paren_map_.find(key);\n           cit != close_paren_map_.end() && cit->first == key;) {\n        close_sources.push_back(cit->second);\n        close_paren_map_.erase(cit++);\n      }\n      std::sort(close_sources.begin(), close_sources.end());\n      auto unique_end = std::unique(close_sources.begin(), close_sources.end());\n      close_sources.resize(unique_end - close_sources.begin());\n      if (!close_sources.empty()) {\n        close_source_map_[key] = close_source_sets_.FindId(close_sources);\n      }\n      open_paren_map_.erase(oit++);\n    }\n  }\n\n  // Returns a new balance data object representing the reversed balance\n  // information.\n  PdtBalanceData<Arc> *Reverse(StateId num_states, StateId num_split,\n                               StateId state_id_shift) const;\n\n private:\n  // Open paren at destintation state?\n  OpenParenSet open_paren_set_;\n  // Open parens per state.\n  OpenParenMap open_paren_map_;\n  // Current open destination state.\n  State open_dest_;\n  // Current open paren/state.\n  typename OpenParenMap::const_iterator open_iter_;\n  // Close states to (open paren, state).\n  CloseParenMap close_paren_map_;\n  // (Paren, state) to set ID.\n  CloseSourceMap close_source_map_;\n  mutable Collection<std::ptrdiff_t, StateId> close_source_sets_;\n};\n\n// Return a new balance data object representing the reversed balance\n// information.\ntemplate <class Arc>\nPdtBalanceData<Arc> *PdtBalanceData<Arc>::Reverse(\n    StateId num_states, StateId num_split, StateId state_id_shift) const {\n  auto *bd = new PdtBalanceData<Arc>;\n  std::unordered_set<StateId> close_sources;\n  const auto split_size = num_states / num_split;\n  for (StateId i = 0; i < num_states; i += split_size) {\n    close_sources.clear();\n    for (auto it = close_source_map_.begin(); it != close_source_map_.end();\n         ++it) {\n      const auto &okey = it->first;\n      const auto open_dest = okey.state_id;\n      const auto paren_id = okey.paren_id;\n      for (auto set_iter = close_source_sets_.FindSet(it->second);\n           !set_iter.Done(); set_iter.Next()) {\n        const auto close_source = set_iter.Element();\n        if ((close_source < i) || (close_source >= i + split_size)) continue;\n        close_sources.insert(close_source + state_id_shift);\n        bd->OpenInsert(paren_id, close_source + state_id_shift);\n        bd->CloseInsert(paren_id, close_source + state_id_shift,\n                        open_dest + state_id_shift);\n      }\n    }\n    for (auto it = close_sources.begin(); it != close_sources.end(); ++it) {\n      bd->FinishInsert(*it);\n    }\n  }\n  return bd;\n}\n\n}  // namespace internal\n}  // namespace fst\n\n#endif  // FST_EXTENSIONS_PDT_PAREN_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/partition.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Functions and classes to create a partition of states.\n\n#ifndef FST_PARTITION_H_\n#define FST_PARTITION_H_\n\n#include <algorithm>\n#include <vector>\n\n\n#include <fst/queue.h>\n\n\nnamespace fst {\nnamespace internal {\n\ntemplate <typename T>\nclass PartitionIterator;\n\n// Defines a partitioning of elements, used to represent equivalence classes\n// for FST operations like minimization. T must be a signed integer type.\n//\n// The elements are numbered from 0 to num_elements - 1.\n// Initialize(num_elements) sets up the class for a given number of elements.\n// We maintain a partition of these elements into classes. The classes are also\n// numbered from zero; you can add a class with AddClass(), or add them in bulk\n// with AllocateClasses(num_classes). Initially the elements are not assigned\n// to any class; you set up the initial mapping from elements to classes by\n// calling Add(element_id, class_id). You can also move an element to a\n// different class by calling Move(element_id, class_id).\n//\n// We also support a rather specialized interface that allows you to efficiently\n// split classes in the Hopcroft minimization algorithm. This maintains a\n// binary partition of each class.  Let's call these, rather arbitrarily, the\n// 'yes' subset and the 'no' subset of each class, and assume that by default,\n// each element of a class is in its 'no' subset. When one calls\n// SplitOn(element_id), element_id is moved to the 'yes' subset of its class.\n// (If it was already in the 'yes' set, it just stays there). The aim is to\n// enable (later) splitting the class in two in time no greater than the time\n// already spent calling SplitOn() for that class. We keep a list of the classes\n// which have nonempty 'yes' sets, as visited_classes_. When one calls\n// FinalizeSplit(Queue *l), for each class in visited_classes_ whose 'yes'\n// and 'no' sets are both nonempty, it will create a new class consisting of\n// the smaller of the two subsets (and this class will be added to the queue),\n// and the old class will now be the larger of the two subsets. This call also\n// resets all the yes/no partitions so that everything is in the 'no' subsets.\n//\n// One cannot use the Move() function if SplitOn() has been called without\n// a subsequent call to FinalizeSplit()\ntemplate <typename T>\nclass Partition {\n public:\n  Partition() {}\n\n  explicit Partition(T num_elements) { Initialize(num_elements); }\n\n  // Creates an empty partition for num_elements. This means that the elements\n  // are not assigned to a class (i.e class_index = -1); you should set up the\n  // number of classes using AllocateClasses() or AddClass(), and allocate each\n  // element to a class by calling Add(element, class_id).\n  void Initialize(size_t num_elements) {\n    elements_.resize(num_elements);\n    classes_.reserve(num_elements);\n    classes_.clear();\n    yes_counter_ = 1;\n  }\n\n  // Adds a class; returns new number of classes.\n  T AddClass() {\n    auto num_classes = classes_.size();\n    classes_.resize(num_classes + 1);\n    return num_classes;\n  }\n\n  // Adds 'num_classes' new (empty) classes.\n  void AllocateClasses(T num_classes) {\n    classes_.resize(classes_.size() + num_classes);\n  }\n\n  // Adds element_id to class_id. element_id should already have been allocated\n  // by calling Initialize(num_elements)---or the constructor taking\n  // num_elements---with num_elements > element_id. element_id must not\n  // currently be a member of any class; once elements have been added to a\n  // class, use the Move() method to move them from one class to another.\n  void Add(T element_id, T class_id) {\n    auto &this_element = elements_[element_id];\n    auto &this_class = classes_[class_id];\n    ++this_class.size;\n    // Adds the element to the 'no' subset of the class.\n    auto no_head = this_class.no_head;\n    if (no_head >= 0) elements_[no_head].prev_element = element_id;\n    this_class.no_head = element_id;\n    this_element.class_id = class_id;\n    // Adds to the 'no' subset of the class.\n    this_element.yes = 0;\n    this_element.next_element = no_head;\n    this_element.prev_element = -1;\n  }\n\n  // Moves element_id from 'no' subset of its current class to 'no' subset of\n  // class class_id. This may not work correctly if you have called SplitOn()\n  // [for any element] and haven't subsequently called FinalizeSplit().\n  void Move(T element_id, T class_id) {\n    auto elements = &(elements_[0]);\n    auto &element = elements[element_id];\n    auto &old_class = classes_[element.class_id];\n    --old_class.size;\n    // Excises the element from the 'no' list of its old class, where it is\n    // assumed to be.\n    if (element.prev_element >= 0) {\n      elements[element.prev_element].next_element = element.next_element;\n    } else {\n      old_class.no_head = element.next_element;\n    }\n    if (element.next_element >= 0) {\n      elements[element.next_element].prev_element = element.prev_element;\n    }\n    // Adds to new class.\n    Add(element_id, class_id);\n  }\n\n  // Moves element_id to the 'yes' subset of its class if it was in the 'no'\n  // subset, and marks the class as having been visited.\n  void SplitOn(T element_id) {\n    auto elements = &(elements_[0]);\n    auto &element = elements[element_id];\n    if (element.yes == yes_counter_) {\n      return;  // Already in the 'yes' set; nothing to do.\n    }\n    auto class_id = element.class_id;\n    auto &this_class = classes_[class_id];\n    // Excises the element from the 'no' list of its class.\n    if (element.prev_element >= 0) {\n      elements[element.prev_element].next_element = element.next_element;\n    } else {\n      this_class.no_head = element.next_element;\n    }\n    if (element.next_element >= 0) {\n      elements[element.next_element].prev_element = element.prev_element;\n    }\n    // Adds the element to the 'yes' list.\n    if (this_class.yes_head >= 0) {\n      elements[this_class.yes_head].prev_element = element_id;\n    } else {\n      visited_classes_.push_back(class_id);\n    }\n    element.yes = yes_counter_;\n    element.next_element = this_class.yes_head;\n    element.prev_element = -1;\n    this_class.yes_head = element_id;\n    this_class.yes_size++;\n  }\n\n  // This should be called after one has possibly called SplitOn for one or more\n  // elements, thus moving those elements to the 'yes' subset for their class.\n  // For each class that has a nontrivial split (i.e., it's not the case that\n  // all members are in the 'yes' or 'no' subset), this function creates a new\n  // class containing the smaller of the two subsets of elements, leaving the\n  // larger group of elements in the old class. The identifier of the new class\n  // will be added to the queue provided as the pointer L. This method then\n  // moves all elements to the 'no' subset of their class.\n  template <class Queue>\n  void FinalizeSplit(Queue *queue) {\n    for (const auto &visited_class : visited_classes_) {\n      const auto new_class = SplitRefine(visited_class);\n      if (new_class != -1 && queue) queue->Enqueue(new_class);\n    }\n    visited_classes_.clear();\n    // Incrementation sets all the 'yes' members of the elements to false.\n    ++yes_counter_;\n  }\n\n  const T ClassId(T element_id) const { return elements_[element_id].class_id; }\n\n  const size_t ClassSize(T class_id) const { return classes_[class_id].size; }\n\n  const T NumClasses() const { return classes_.size(); }\n\n private:\n  friend class PartitionIterator<T>;\n\n  // Information about a given element.\n  struct Element {\n    T class_id;      // Class ID of this element.\n    T yes;           // This is to be interpreted as a bool, true if it's in the\n                     // 'yes' set of this class. The interpretation as bool is\n                     // (yes == yes_counter_ ? true : false).\n    T next_element;  // Next element in the 'no' list or 'yes' list of this\n                     // class, whichever of the two we belong to (think of\n                     // this as the 'next' in a doubly-linked list, although\n                     // it is an index into the elements array). Negative\n                     // values corresponds to null.\n    T prev_element;  // Previous element in the 'no' or 'yes' doubly linked\n                     // list. Negative values corresponds to null.\n  };\n\n  // Information about a given class.\n  struct Class {\n    Class() : size(0), yes_size(0), no_head(-1), yes_head(-1) {}\n    T size;      // Total number of elements in this class ('no' plus 'yes'\n                 // subsets).\n    T yes_size;  // Total number of elements of 'yes' subset of this class.\n    T no_head;   // Index of head element of doubly-linked list in 'no' subset.\n                 // Everything is in the 'no' subset until you call SplitOn().\n                 // -1 means no element.\n    T yes_head;  // Index of head element of doubly-linked list in 'yes' subset.\n                 // -1 means no element.\n  };\n\n  // This method, called from FinalizeSplit(), checks whether a class has to\n  // be split (a class will be split only if its 'yes' and 'no' subsets are\n  // both nonempty, but one can assume that since this function was called, the\n  // 'yes' subset is nonempty). It splits by taking the smaller subset and\n  // making it a new class, and leaving the larger subset of elements in the\n  // 'no' subset of the old class. It returns the new class if created, or -1\n  // if none was created.\n  T SplitRefine(T class_id) {\n    auto yes_size = classes_[class_id].yes_size;\n    auto size = classes_[class_id].size;\n    auto no_size = size - yes_size;\n    if (no_size == 0) {\n      // All members are in the 'yes' subset, so we don't have to create a new\n      // class, just move them all to the 'no' subset.\n      classes_[class_id].no_head = classes_[class_id].yes_head;\n      classes_[class_id].yes_head = -1;\n      classes_[class_id].yes_size = 0;\n      return -1;\n    } else {\n      auto new_class_id = classes_.size();\n      classes_.resize(classes_.size() + 1);\n      auto &old_class = classes_[class_id];\n      auto &new_class = classes_[new_class_id];\n      // The new_class will have the values from the constructor.\n      if (no_size < yes_size) {\n        // Moves the 'no' subset to new class ('no' subset).\n        new_class.no_head = old_class.no_head;\n        new_class.size = no_size;\n        // And makes the 'yes' subset of the old class ('no' subset).\n        old_class.no_head = old_class.yes_head;\n        old_class.yes_head = -1;\n        old_class.size = yes_size;\n        old_class.yes_size = 0;\n      } else {\n        // Moves the 'yes' subset to the new class (to the 'no' subset)\n        new_class.size = yes_size;\n        new_class.no_head = old_class.yes_head;\n        // Retains only the 'no' subset in the old class.\n        old_class.size = no_size;\n        old_class.yes_size = 0;\n        old_class.yes_head = -1;\n      }\n      auto elements = &(elements_[0]);\n      // Updates the 'class_id' of all the elements we moved.\n      for (auto e = new_class.no_head; e >= 0; e = elements[e].next_element) {\n        elements[e].class_id = new_class_id;\n      }\n      return new_class_id;\n    }\n  }\n\n  // elements_[i] contains all info about the i'th element.\n  std::vector<Element> elements_;\n  // classes_[i] contains all info about the i'th class.\n  std::vector<Class> classes_;\n  // Set of visited classes to be used in split refine.\n  std::vector<T> visited_classes_;\n  // yes_counter_ is used in interpreting the 'yes' members of class Element.\n  // If element.yes == yes_counter_, we interpret that element as being in the\n  // 'yes' subset of its class. This allows us to, in effect, set all those\n  // bools to false at a stroke by incrementing yes_counter_.\n  T yes_counter_;\n};\n\n// Iterates over members of the 'no' subset of a class in a partition. (When\n// this is used, everything is in the 'no' subset).\ntemplate <typename T>\nclass PartitionIterator {\n public:\n  using Element = typename Partition<T>::Element;\n\n  PartitionIterator(const Partition<T> &partition, T class_id)\n      : partition_(partition),\n        element_id_(partition_.classes_[class_id].no_head),\n        class_id_(class_id) {}\n\n  bool Done() { return element_id_ < 0; }\n\n  const T Value() { return element_id_; }\n\n  void Next() { element_id_ = partition_.elements_[element_id_].next_element; }\n\n  void Reset() { element_id_ = partition_.classes_[class_id_].no_head; }\n\n private:\n  const Partition<T> &partition_;\n  T element_id_;\n  T class_id_;\n};\n\n}  // namespace internal\n}  // namespace fst\n\n#endif  // FST_PARTITION_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/pdt.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Common classes for PDT expansion/traversal.\n\n#ifndef FST_EXTENSIONS_PDT_PDT_H_\n#define FST_EXTENSIONS_PDT_PDT_H_\n\n#include <map>\n#include <set>\n#include <unordered_map>\n\n#include <fst/compat.h>\n#include <fst/log.h>\n#include <fst/fst.h>\n#include <fst/state-table.h>\n\nnamespace fst {\n\n// Provides bijection between parenthesis stacks and signed integral stack IDs.\n// Each stack ID is unique to each distinct stack. The open-close parenthesis\n// label pairs are passed using the parens argument.\ntemplate <typename StackId, typename Label>\nclass PdtStack {\n public:\n  // The stacks are stored in a tree. The nodes are stored in a vector. Each\n  // node represents the top of some stack and is identified by its position in\n  // the vector. Its' parent node represents the stack with the top popped and\n  // its children are stored in child_map_ and accessed by stack_id and label.\n  // The paren_id is\n  // the position in parens of the parenthesis for that node.\n  struct StackNode {\n    StackId parent_id;\n    size_t paren_id;\n\n    StackNode(StackId p, size_t i) : parent_id(p), paren_id(i) {}\n  };\n\n  explicit PdtStack(const std::vector<std::pair<Label, Label>> &parens)\n      : parens_(parens), min_paren_(kNoLabel), max_paren_(kNoLabel) {\n    for (size_t i = 0; i < parens.size(); ++i) {\n      const auto &pair = parens[i];\n      paren_map_[pair.first] = i;\n      paren_map_[pair.second] = i;\n      if (min_paren_ == kNoLabel || pair.first < min_paren_) {\n        min_paren_ = pair.first;\n      }\n      if (pair.second < min_paren_) min_paren_ = pair.second;\n      if (max_paren_ == kNoLabel || pair.first > max_paren_) {\n        max_paren_ = pair.first;\n      }\n      if (pair.second > max_paren_) max_paren_ = pair.second;\n    }\n    nodes_.push_back(StackNode(-1, -1));  // Tree root.\n  }\n\n  // Returns stack ID given the current stack ID (0 if empty) and label read.\n  // Pushes onto the stack if the label is an open parenthesis, returning the\n  // new stack ID. Pops the stack if the label is a close parenthesis that\n  // matches the top of the stack, returning the parent stack ID. Returns -1 if\n  // label is an unmatched close parenthesis. Otherwise, returns the current\n  // stack ID.\n  StackId Find(StackId stack_id, Label label) {\n    if (min_paren_ == kNoLabel || label < min_paren_ || label > max_paren_) {\n      return stack_id;  // Non-paren.\n    }\n    const auto it = paren_map_.find(label);\n    // Non-paren.\n    if (it == paren_map_.end()) return stack_id;\n    const auto paren_id = it->second;\n    // Open paren.\n    if (label == parens_[paren_id].first) {\n      auto &child_id = child_map_[std::make_pair(stack_id, label)];\n      if (child_id == 0) {  // Child not found; pushes label.\n        child_id = nodes_.size();\n        nodes_.push_back(StackNode(stack_id, paren_id));\n      }\n      return child_id;\n    }\n    const auto &node = nodes_[stack_id];\n    // Matching close paren.\n    if (paren_id == node.paren_id) return node.parent_id;\n    // Non-matching close paren.\n    return -1;\n  }\n\n  // Returns the stack ID obtained by popping the label at the top of the\n  // current stack ID.\n  StackId Pop(StackId stack_id) const { return nodes_[stack_id].parent_id; }\n\n  // Returns the paren ID at the top of the stack.\n  std::ptrdiff_t Top(StackId stack_id) const { return nodes_[stack_id].paren_id; }\n\n  std::ptrdiff_t ParenId(Label label) const {\n    const auto it = paren_map_.find(label);\n    if (it == paren_map_.end()) return -1;  // Non-paren.\n    return it->second;\n  }\n\n private:\n  struct ChildHash {\n    size_t operator()(const std::pair<StackId, Label> &pair) const {\n      static constexpr size_t prime = 7853;\n      return static_cast<size_t>(pair.first) +\n             static_cast<size_t>(pair.second) * prime;\n    }\n  };\n\n  std::vector<std::pair<Label, Label>> parens_;\n  std::vector<StackNode> nodes_;\n  std::unordered_map<Label, size_t> paren_map_;\n  // Child of stack node w.r.t label\n  std::unordered_map<std::pair<StackId, Label>, StackId, ChildHash> child_map_;\n  Label min_paren_;\n  Label max_paren_;\n};\n\n// State tuple for PDT expansion.\ntemplate <typename S, typename K>\nstruct PdtStateTuple {\n  using StateId = S;\n  using StackId = K;\n\n  StateId state_id;\n  StackId stack_id;\n\n  PdtStateTuple(StateId state_id = kNoStateId, StackId stack_id = -1)\n      : state_id(state_id), stack_id(stack_id) {}\n};\n\n// Equality of PDT state tuples.\ntemplate <typename S, typename K>\ninline bool operator==(const PdtStateTuple<S, K> &x,\n                       const PdtStateTuple<S, K> &y) {\n  if (&x == &y) return true;\n  return x.state_id == y.state_id && x.stack_id == y.stack_id;\n}\n\n// Hash function object for PDT state tuples\ntemplate <class T>\nclass PdtStateHash {\n public:\n  size_t operator()(const T &tuple) const {\n    static constexpr auto prime = 7853;\n    return tuple.state_id + tuple.stack_id * prime;\n  }\n};\n\n// Tuple to PDT state bijection.\ntemplate <class StateId, class StackId>\nclass PdtStateTable : public CompactHashStateTable<\n                          PdtStateTuple<StateId, StackId>,\n                          PdtStateHash<PdtStateTuple<StateId, StackId>>> {\n public:\n  PdtStateTable() {}\n\n  PdtStateTable(const PdtStateTable &other) {}\n\n private:\n  PdtStateTable &operator=(const PdtStateTable &) = delete;\n};\n\n}  // namespace fst\n\n#endif  // FST_EXTENSIONS_PDT_PDT_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/power-weight.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Cartesian power weight semiring operation definitions.\n\n#ifndef FST_POWER_WEIGHT_H_\n#define FST_POWER_WEIGHT_H_\n\n#include <string>\n\n#include <fst/tuple-weight.h>\n#include <fst/weight.h>\n\n\nnamespace fst {\n\n// Cartesian power semiring: W ^ n\n//\n// Forms:\n//  - a left semimodule when W is a left semiring,\n//  - a right semimodule when W is a right semiring,\n//  - a bisemimodule when W is a semiring,\n//    the free semimodule of rank n over W\n// The Times operation is overloaded to provide the left and right scalar\n// products.\ntemplate <class W, size_t n>\nclass PowerWeight : public TupleWeight<W, n> {\n public:\n  using ReverseWeight = PowerWeight<typename W::ReverseWeight, n>;\n\n  PowerWeight() {}\n\n  explicit PowerWeight(const TupleWeight<W, n> &weight)\n      : TupleWeight<W, n>(weight) {}\n\n  template <class Iterator>\n  PowerWeight(Iterator begin, Iterator end) : TupleWeight<W, n>(begin, end) {}\n\n  // Initialize component `index` to `weight`; initialize all other components\n  // to `default_weight`\n  PowerWeight(size_t index, const W &weight,\n              const W &default_weight = W::Zero())\n      : TupleWeight<W, n>(index, weight, default_weight) {}\n\n  static const PowerWeight &Zero() {\n    static const PowerWeight zero(TupleWeight<W, n>::Zero());\n    return zero;\n  }\n\n  static const PowerWeight &One() {\n    static const PowerWeight one(TupleWeight<W, n>::One());\n    return one;\n  }\n\n  static const PowerWeight &NoWeight() {\n    static const PowerWeight no_weight(TupleWeight<W, n>::NoWeight());\n    return no_weight;\n  }\n\n  static const string &Type() {\n    static const string *const type =\n        new string(W::Type() + \"_^\" + std::to_string(n));\n    return *type;\n  }\n\n  static constexpr uint64_t Properties() {\n    return W::Properties() &\n           (kLeftSemiring | kRightSemiring | kCommutative | kIdempotent);\n  }\n\n  PowerWeight Quantize(float delta = kDelta) const {\n    return PowerWeight(TupleWeight<W, n>::Quantize(delta));\n  }\n\n  ReverseWeight Reverse() const {\n    return ReverseWeight(TupleWeight<W, n>::Reverse());\n  }\n};\n\n// Semiring plus operation.\ntemplate <class W, size_t n>\ninline PowerWeight<W, n> Plus(const PowerWeight<W, n> &w1,\n                              const PowerWeight<W, n> &w2) {\n  PowerWeight<W, n> result;\n  for (size_t i = 0; i < n; ++i) {\n    result.SetValue(i, Plus(w1.Value(i), w2.Value(i)));\n  }\n  return result;\n}\n\n// Semiring times operation.\ntemplate <class W, size_t n>\ninline PowerWeight<W, n> Times(const PowerWeight<W, n> &w1,\n                               const PowerWeight<W, n> &w2) {\n  PowerWeight<W, n> result;\n  for (size_t i = 0; i < n; ++i) {\n    result.SetValue(i, Times(w1.Value(i), w2.Value(i)));\n  }\n  return result;\n}\n\n// Semiring divide operation.\ntemplate <class W, size_t n>\ninline PowerWeight<W, n> Divide(const PowerWeight<W, n> &w1,\n                                const PowerWeight<W, n> &w2,\n                                DivideType type = DIVIDE_ANY) {\n  PowerWeight<W, n> result;\n  for (size_t i = 0; i < n; ++i) {\n    result.SetValue(i, Divide(w1.Value(i), w2.Value(i), type));\n  }\n  return result;\n}\n\n// Semimodule left scalar product.\ntemplate <class W, size_t n>\ninline PowerWeight<W, n> Times(const W &scalar,\n                               const PowerWeight<W, n> &weight) {\n  PowerWeight<W, n> result;\n  for (size_t i = 0; i < n; ++i) {\n    result.SetValue(i, Times(scalar, weight.Value(i)));\n  }\n  return result;\n}\n\n// Semimodule right scalar product.\ntemplate <class W, size_t n>\ninline PowerWeight<W, n> Times(const PowerWeight<W, n> &weight,\n                               const W &scalar) {\n  PowerWeight<W, n> result;\n  for (size_t i = 0; i < n; ++i) {\n    result.SetValue(i, Times(weight.Value(i), scalar));\n  }\n  return result;\n}\n\n// Semimodule dot product.\ntemplate <class W, size_t n>\ninline W DotProduct(const PowerWeight<W, n> &w1, const PowerWeight<W, n> &w2) {\n  W result(W::Zero());\n  for (size_t i = 0; i < n; ++i) {\n    result = Plus(result, Times(w1.Value(i), w2.Value(i)));\n  }\n  return result;\n}\n\n// This function object generates weights over the Cartesian power of rank\n// n over the underlying weight. This is intended primarily for testing.\ntemplate <class W, size_t n>\nclass WeightGenerate<PowerWeight<W, n>> {\n public:\n  using Weight = PowerWeight<W, n>;\n  using Generate = WeightGenerate<W>;\n\n  explicit WeightGenerate(bool allow_zero = true) : generate_(allow_zero) {}\n\n  Weight operator()() const {\n    Weight result;\n    for (size_t i = 0; i < n; ++i) result.SetValue(i, generate_());\n    return result;\n  }\n\n private:\n  Generate generate_;\n};\n\n}  // namespace fst\n\n#endif  // FST_POWER_WEIGHT_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/product-weight.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Product weight set and associated semiring operation definitions.\n\n#ifndef FST_PRODUCT_WEIGHT_H_\n#define FST_PRODUCT_WEIGHT_H_\n\n#include <string>\n#include <utility>\n\n#include <fst/pair-weight.h>\n#include <fst/weight.h>\n\n\nnamespace fst {\n\n// Product semiring: W1 * W2.\ntemplate <class W1, class W2>\nclass ProductWeight : public PairWeight<W1, W2> {\n public:\n  using ReverseWeight =\n      ProductWeight<typename W1::ReverseWeight, typename W2::ReverseWeight>;\n\n  ProductWeight() {}\n\n  explicit ProductWeight(const PairWeight<W1, W2> &weight)\n      : PairWeight<W1, W2>(weight) {}\n\n  ProductWeight(W1 w1, W2 w2)\n      : PairWeight<W1, W2>(std::move(w1), std::move(w2)) {}\n\n  static const ProductWeight &Zero() {\n    static const ProductWeight zero(PairWeight<W1, W2>::Zero());\n    return zero;\n  }\n\n  static const ProductWeight &One() {\n    static const ProductWeight one(PairWeight<W1, W2>::One());\n    return one;\n  }\n\n  static const ProductWeight &NoWeight() {\n    static const ProductWeight no_weight(PairWeight<W1, W2>::NoWeight());\n    return no_weight;\n  }\n\n  static const string &Type() {\n    static const string *const type =\n        new string(W1::Type() + \"_X_\" + W2::Type());\n    return *type;\n  }\n\n  static constexpr uint64_t Properties() {\n    return W1::Properties() & W2::Properties() &\n           (kLeftSemiring | kRightSemiring | kCommutative | kIdempotent);\n  }\n\n  ProductWeight Quantize(float delta = kDelta) const {\n    return ProductWeight(PairWeight<W1, W2>::Quantize(delta));\n  }\n\n  ReverseWeight Reverse() const {\n    return ReverseWeight(PairWeight<W1, W2>::Reverse());\n  }\n};\n\ntemplate <class W1, class W2>\ninline ProductWeight<W1, W2> Plus(const ProductWeight<W1, W2> &w1,\n                                  const ProductWeight<W1, W2> &w2) {\n  return ProductWeight<W1, W2>(Plus(w1.Value1(), w2.Value1()),\n                               Plus(w1.Value2(), w2.Value2()));\n}\n\ntemplate <class W1, class W2>\ninline ProductWeight<W1, W2> Times(const ProductWeight<W1, W2> &w1,\n                                   const ProductWeight<W1, W2> &w2) {\n  return ProductWeight<W1, W2>(Times(w1.Value1(), w2.Value1()),\n                               Times(w1.Value2(), w2.Value2()));\n}\n\ntemplate <class W1, class W2>\ninline ProductWeight<W1, W2> Divide(const ProductWeight<W1, W2> &w1,\n                                    const ProductWeight<W1, W2> &w2,\n                                    DivideType typ = DIVIDE_ANY) {\n  return ProductWeight<W1, W2>(Divide(w1.Value1(), w2.Value1(), typ),\n                               Divide(w1.Value2(), w2.Value2(), typ));\n}\n\n// This function object generates weights by calling the underlying generators\n// for the template weight types, like all other pair weight types. This is\n// intended primarily for testing.\ntemplate <class W1, class W2>\nclass WeightGenerate<ProductWeight<W1, W2>> :\n    public WeightGenerate<PairWeight<W1, W2>> {\n public:\n  using Weight = ProductWeight<W1, W2>;\n  using Generate = WeightGenerate<PairWeight<W1, W2>>;\n\n  explicit WeightGenerate(bool allow_zero = true) : Generate(allow_zero) {}\n\n  Weight operator()() const { return Weight(Generate::operator()()); }\n};\n\n}  // namespace fst\n\n#endif  // FST_PRODUCT_WEIGHT_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/project.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Functions and classes to project an FST on to its domain or range.\n\n#ifndef FST_PROJECT_H_\n#define FST_PROJECT_H_\n\n#include <fst/arc-map.h>\n#include <fst/mutable-fst.h>\n\n\nnamespace fst {\n\n// This specifies whether to project on input or output.\nenum ProjectType { PROJECT_INPUT = 1, PROJECT_OUTPUT = 2 };\n\n// Mapper to implement projection per arc.\ntemplate <class A>\nclass ProjectMapper {\n public:\n  using FromArc = A;\n  using ToArc = A;\n\n  explicit ProjectMapper(ProjectType project_type)\n      : project_type_(project_type) {}\n\n  ToArc operator()(const FromArc &arc) const {\n    const auto label = project_type_ == PROJECT_INPUT ? arc.ilabel : arc.olabel;\n    return ToArc(label, label, arc.weight, arc.nextstate);\n  }\n\n  constexpr MapFinalAction FinalAction() const {\n    return MAP_NO_SUPERFINAL;\n  }\n\n  MapSymbolsAction InputSymbolsAction() const {\n    return project_type_ == PROJECT_INPUT ? MAP_COPY_SYMBOLS\n                                          : MAP_CLEAR_SYMBOLS;\n  }\n\n  MapSymbolsAction OutputSymbolsAction() const {\n    return project_type_ == PROJECT_OUTPUT ? MAP_COPY_SYMBOLS\n                                           : MAP_CLEAR_SYMBOLS;\n  }\n\n  uint64_t Properties(uint64_t props) const {\n    return ProjectProperties(props, project_type_ == PROJECT_INPUT);\n  }\n\n private:\n  const ProjectType project_type_;\n};\n\n// Projects an FST onto its domain or range by either copying each arcs' input\n// label to the output label or vice versa.\n//\n// Complexity:\n//\n//   Time: O(V + E)\n//   Space: O(1)\n//\n// where V is the number of states and E is the number of arcs.\ntemplate <class Arc>\ninline void Project(const Fst<Arc> &ifst, MutableFst<Arc> *ofst,\n                    ProjectType project_type) {\n  ArcMap(ifst, ofst, ProjectMapper<Arc>(project_type));\n  switch (project_type) {\n    case PROJECT_INPUT:\n      ofst->SetOutputSymbols(ifst.InputSymbols());\n      return;\n    case PROJECT_OUTPUT:\n      ofst->SetInputSymbols(ifst.OutputSymbols());\n      return;\n  }\n}\n\n// Destructive variant of the above.\ntemplate <class Arc>\ninline void Project(MutableFst<Arc> *fst, ProjectType project_type) {\n  ArcMap(fst, ProjectMapper<Arc>(project_type));\n  switch (project_type) {\n    case PROJECT_INPUT:\n      fst->SetOutputSymbols(fst->InputSymbols());\n      return;\n    case PROJECT_OUTPUT:\n      fst->SetInputSymbols(fst->OutputSymbols());\n      return;\n  }\n}\n\n// Projects an FST onto its domain or range by either copying each arc's input\n// label to the output label or vice versa. This version is a delayed FST.\n//\n// Complexity:\n//\n//   Time: O(v + e)\n//   Space: O(1)\n//\n// where v is the number of states visited and e is the number of arcs visited.\n// Constant time and to visit an input state or arc is assumed and exclusive of\n// caching.\ntemplate <class A>\nclass ProjectFst : public ArcMapFst<A, A, ProjectMapper<A>> {\n public:\n  using FromArc = A;\n  using ToArc = A;\n\n  using Impl = internal::ArcMapFstImpl<A, A, ProjectMapper<A>>;\n\n  ProjectFst(const Fst<A> &fst, ProjectType project_type)\n      : ArcMapFst<A, A, ProjectMapper<A>>(fst, ProjectMapper<A>(project_type)) {\n    if (project_type == PROJECT_INPUT) {\n      GetMutableImpl()->SetOutputSymbols(fst.InputSymbols());\n    }\n    if (project_type == PROJECT_OUTPUT) {\n      GetMutableImpl()->SetInputSymbols(fst.OutputSymbols());\n    }\n  }\n\n  // See Fst<>::Copy() for doc.\n  ProjectFst(const ProjectFst<A> &fst, bool safe = false)\n      : ArcMapFst<A, A, ProjectMapper<A>>(fst, safe) {}\n\n  // Gets a copy of this ProjectFst. See Fst<>::Copy() for further doc.\n  ProjectFst<A> *Copy(bool safe = false) const override {\n    return new ProjectFst(*this, safe);\n  }\n\n private:\n  using ImplToFst<Impl>::GetMutableImpl;\n};\n\n// Specialization for ProjectFst.\ntemplate <class A>\nclass StateIterator<ProjectFst<A>>\n    : public StateIterator<ArcMapFst<A, A, ProjectMapper<A>>> {\n public:\n  explicit StateIterator(const ProjectFst<A> &fst)\n      : StateIterator<ArcMapFst<A, A, ProjectMapper<A>>>(fst) {}\n};\n\n// Specialization for ProjectFst.\ntemplate <class A>\nclass ArcIterator<ProjectFst<A>>\n    : public ArcIterator<ArcMapFst<A, A, ProjectMapper<A>>> {\n public:\n  using StateId = typename A::StateId;\n\n  ArcIterator(const ProjectFst<A> &fst, StateId s)\n      : ArcIterator<ArcMapFst<A, A, ProjectMapper<A>>>(fst, s) {}\n};\n\n// Useful alias when using StdArc.\nusing StdProjectFst = ProjectFst<StdArc>;\n\n}  // namespace fst\n\n#endif  // FST_PROJECT_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/properties.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// FST property bits.\n\n#ifndef FST_PROPERTIES_H_\n#define FST_PROPERTIES_H_\n\n#include <sys/types.h>\n#include <vector>\n\n#include <fst/compat.h>\n\nnamespace fst {\n\n// The property bits here assert facts about an FST. If individual bits are\n// added, then the composite properties below, the property functions and\n// property names in properties.cc, and TestProperties() in test-properties.h\n// should be updated.\n\n// BINARY PROPERTIES\n//\n// For each property below, there is a single bit. If it is set, the property is\n// true. If it is not set, the property is false.\n\n// The Fst is an ExpandedFst.\nconstexpr uint64_t kExpanded = 0x0000000000000001ULL;\n\n// The Fst is a MutableFst.\nconstexpr uint64_t kMutable = 0x0000000000000002ULL;\n\n// An error was detected while constructing/using the FST.\nconstexpr uint64_t kError = 0x0000000000000004ULL;\n\n// TRINARY PROPERTIES\n//\n// For each of these properties below there is a pair of property bits, one\n// positive and one negative. If the positive bit is set, the property is true.\n// If the negative bit is set, the property is false. If neither is set, the\n// property has unknown value. Both should never be simultaneously set. The\n// individual positive and negative bit pairs should be adjacent with the\n// positive bit at an odd and lower position.\n\n// ilabel == olabel for each arc.\nconstexpr uint64_t kAcceptor = 0x0000000000010000ULL;\n// ilabel != olabel for some arc.\nconstexpr uint64_t kNotAcceptor = 0x0000000000020000ULL;\n\n// ilabels unique leaving each state.\nconstexpr uint64_t kIDeterministic = 0x0000000000040000ULL;\n// ilabels not unique leaving some state.\nconstexpr uint64_t kNonIDeterministic = 0x0000000000080000ULL;\n\n// olabels unique leaving each state.\nconstexpr uint64_t kODeterministic = 0x0000000000100000ULL;\n// olabels not unique leaving some state.\nconstexpr uint64_t kNonODeterministic = 0x0000000000200000ULL;\n\n// FST has input/output epsilons.\nconstexpr uint64_t kEpsilons = 0x0000000000400000ULL;\n// FST has no input/output epsilons.\nconstexpr uint64_t kNoEpsilons = 0x0000000000800000ULL;\n\n// FST has input epsilons.\nconstexpr uint64_t kIEpsilons = 0x0000000001000000ULL;\n// FST has no input epsilons.\nconstexpr uint64_t kNoIEpsilons = 0x0000000002000000ULL;\n\n// FST has output epsilons.\nconstexpr uint64_t kOEpsilons = 0x0000000004000000ULL;\n// FST has no output epsilons.\nconstexpr uint64_t kNoOEpsilons = 0x0000000008000000ULL;\n\n// ilabels sorted wrt < for each state.\nconstexpr uint64_t kILabelSorted = 0x0000000010000000ULL;\n// ilabels not sorted wrt < for some state.\nconstexpr uint64_t kNotILabelSorted = 0x0000000020000000ULL;\n\n// olabels sorted wrt < for each state.\nconstexpr uint64_t kOLabelSorted = 0x0000000040000000ULL;\n// olabels not sorted wrt < for some state.\nconstexpr uint64_t kNotOLabelSorted = 0x0000000080000000ULL;\n\n// Non-trivial arc or final weights.\nconstexpr uint64_t kWeighted = 0x0000000100000000ULL;\n// Only trivial arc and final weights.\nconstexpr uint64_t kUnweighted = 0x0000000200000000ULL;\n\n// FST has cycles.\nconstexpr uint64_t kCyclic = 0x0000000400000000ULL;\n// FST has no cycles.\nconstexpr uint64_t kAcyclic = 0x0000000800000000ULL;\n\n// FST has cycles containing the initial state.\nconstexpr uint64_t kInitialCyclic = 0x0000001000000000ULL;\n// FST has no cycles containing the initial state.\nconstexpr uint64_t kInitialAcyclic = 0x0000002000000000ULL;\n\n// FST is topologically sorted.\nconstexpr uint64_t kTopSorted = 0x0000004000000000ULL;\n// FST is not topologically sorted.\nconstexpr uint64_t kNotTopSorted = 0x0000008000000000ULL;\n\n// All states reachable from the initial state.\nconstexpr uint64_t kAccessible = 0x0000010000000000ULL;\n// Not all states reachable from the initial state.\nconstexpr uint64_t kNotAccessible = 0x0000020000000000ULL;\n\n// All states can reach a final state.\nconstexpr uint64_t kCoAccessible = 0x0000040000000000ULL;\n// Not all states can reach a final state.\nconstexpr uint64_t kNotCoAccessible = 0x0000080000000000ULL;\n\n// If NumStates() > 0, then state 0 is initial, state NumStates() - 1 is final,\n// there is a transition from each non-final state i to state i + 1, and there\n// are no other transitions.\nconstexpr uint64_t kString = 0x0000100000000000ULL;\n\n// Not a string FST.\nconstexpr uint64_t kNotString = 0x0000200000000000ULL;\n\n// FST has least one weighted cycle.\nconstexpr uint64_t kWeightedCycles = 0x0000400000000000ULL;\n\n// Only unweighted cycles.\nconstexpr uint64_t kUnweightedCycles = 0x0000800000000000ULL;\n\n// COMPOSITE PROPERTIES\n\n// Properties of an empty machine.\nconstexpr uint64_t kNullProperties =\n    kAcceptor | kIDeterministic | kODeterministic | kNoEpsilons | kNoIEpsilons |\n    kNoOEpsilons | kILabelSorted | kOLabelSorted | kUnweighted | kAcyclic |\n    kInitialAcyclic | kTopSorted | kAccessible | kCoAccessible | kString |\n    kUnweightedCycles;\n\n// Properties that are preserved when an FST is copied.\nconstexpr uint64_t kCopyProperties =\n    kError | kAcceptor | kNotAcceptor | kIDeterministic | kNonIDeterministic |\n    kODeterministic | kNonODeterministic | kEpsilons | kNoEpsilons |\n    kIEpsilons | kNoIEpsilons | kOEpsilons | kNoOEpsilons | kILabelSorted |\n    kNotILabelSorted | kOLabelSorted | kNotOLabelSorted | kWeighted |\n    kUnweighted | kCyclic | kAcyclic | kInitialCyclic | kInitialAcyclic |\n    kTopSorted | kNotTopSorted | kAccessible | kNotAccessible | kCoAccessible |\n    kNotCoAccessible | kString | kNotString | kWeightedCycles |\n    kUnweightedCycles;\n\n// Properties that are intrinsic to the FST.\nconstexpr uint64_t kIntrinsicProperties =\n    kExpanded | kMutable | kAcceptor | kNotAcceptor | kIDeterministic |\n    kNonIDeterministic | kODeterministic | kNonODeterministic | kEpsilons |\n    kNoEpsilons | kIEpsilons | kNoIEpsilons | kOEpsilons | kNoOEpsilons |\n    kILabelSorted | kNotILabelSorted | kOLabelSorted | kNotOLabelSorted |\n    kWeighted | kUnweighted | kCyclic | kAcyclic | kInitialCyclic |\n    kInitialAcyclic | kTopSorted | kNotTopSorted | kAccessible |\n    kNotAccessible | kCoAccessible | kNotCoAccessible | kString | kNotString |\n    kWeightedCycles | kUnweightedCycles;\n\n// Properties that are (potentially) extrinsic to the FST.\nconstexpr uint64_t kExtrinsicProperties = kError;\n\n// Properties that are preserved when an FST start state is set.\nconstexpr uint64_t kSetStartProperties =\n    kExpanded | kMutable | kError | kAcceptor | kNotAcceptor | kIDeterministic |\n    kNonIDeterministic | kODeterministic | kNonODeterministic | kEpsilons |\n    kNoEpsilons | kIEpsilons | kNoIEpsilons | kOEpsilons | kNoOEpsilons |\n    kILabelSorted | kNotILabelSorted | kOLabelSorted | kNotOLabelSorted |\n    kWeighted | kUnweighted | kCyclic | kAcyclic | kTopSorted | kNotTopSorted |\n    kCoAccessible | kNotCoAccessible | kWeightedCycles | kUnweightedCycles;\n\n// Properties that are preserved when an FST final weight is set.\nconstexpr uint64_t kSetFinalProperties =\n    kExpanded | kMutable | kError | kAcceptor | kNotAcceptor | kIDeterministic |\n    kNonIDeterministic | kODeterministic | kNonODeterministic | kEpsilons |\n    kNoEpsilons | kIEpsilons | kNoIEpsilons | kOEpsilons | kNoOEpsilons |\n    kILabelSorted | kNotILabelSorted | kOLabelSorted | kNotOLabelSorted |\n    kCyclic | kAcyclic | kInitialCyclic | kInitialAcyclic | kTopSorted |\n    kNotTopSorted | kAccessible | kNotAccessible | kWeightedCycles |\n    kUnweightedCycles;\n\n// Properties that are preserved when an FST state is added.\nconstexpr uint64_t kAddStateProperties =\n    kExpanded | kMutable | kError | kAcceptor | kNotAcceptor | kIDeterministic |\n    kNonIDeterministic | kODeterministic | kNonODeterministic | kEpsilons |\n    kNoEpsilons | kIEpsilons | kNoIEpsilons | kOEpsilons | kNoOEpsilons |\n    kILabelSorted | kNotILabelSorted | kOLabelSorted | kNotOLabelSorted |\n    kWeighted | kUnweighted | kCyclic | kAcyclic | kInitialCyclic |\n    kInitialAcyclic | kTopSorted | kNotTopSorted | kNotAccessible |\n    kNotCoAccessible | kNotString | kWeightedCycles | kUnweightedCycles;\n\n// Properties that are preserved when an FST arc is added.\nconstexpr uint64_t kAddArcProperties =\n    kExpanded | kMutable | kError | kNotAcceptor | kNonIDeterministic |\n    kNonODeterministic | kEpsilons | kIEpsilons | kOEpsilons |\n    kNotILabelSorted | kNotOLabelSorted | kWeighted | kCyclic | kInitialCyclic |\n    kNotTopSorted | kAccessible | kCoAccessible | kWeightedCycles;\n\n// Properties that are preserved when an FST arc is set.\nconstexpr uint64_t kSetArcProperties = kExpanded | kMutable | kError;\n\n// Properties that are preserved when FST states are deleted.\nconstexpr uint64_t kDeleteStatesProperties =\n    kExpanded | kMutable | kError | kAcceptor | kIDeterministic |\n    kODeterministic | kNoEpsilons | kNoIEpsilons | kNoOEpsilons |\n    kILabelSorted | kOLabelSorted | kUnweighted | kAcyclic | kInitialAcyclic |\n    kTopSorted | kUnweightedCycles;\n\n// Properties that are preserved when FST arcs are deleted.\nconstexpr uint64_t kDeleteArcsProperties =\n    kExpanded | kMutable | kError | kAcceptor | kIDeterministic |\n    kODeterministic | kNoEpsilons | kNoIEpsilons | kNoOEpsilons |\n    kILabelSorted | kOLabelSorted | kUnweighted | kAcyclic | kInitialAcyclic |\n    kTopSorted | kNotAccessible | kNotCoAccessible | kUnweightedCycles;\n\n// Properties that are preserved when an FST's states are reordered.\nconstexpr uint64_t kStateSortProperties =\n    kExpanded | kMutable | kError | kAcceptor | kNotAcceptor | kIDeterministic |\n    kNonIDeterministic | kODeterministic | kNonODeterministic | kEpsilons |\n    kNoEpsilons | kIEpsilons | kNoIEpsilons | kOEpsilons | kNoOEpsilons |\n    kILabelSorted | kNotILabelSorted | kOLabelSorted | kNotOLabelSorted |\n    kWeighted | kUnweighted | kCyclic | kAcyclic | kInitialCyclic |\n    kInitialAcyclic | kAccessible | kNotAccessible | kCoAccessible |\n    kNotCoAccessible | kWeightedCycles | kUnweightedCycles;\n\n// Properties that are preserved when an FST's arcs are reordered.\nconstexpr uint64_t kArcSortProperties =\n    kExpanded | kMutable | kError | kAcceptor | kNotAcceptor | kIDeterministic |\n    kNonIDeterministic | kODeterministic | kNonODeterministic | kEpsilons |\n    kNoEpsilons | kIEpsilons | kNoIEpsilons | kOEpsilons | kNoOEpsilons |\n    kWeighted | kUnweighted | kCyclic | kAcyclic | kInitialCyclic |\n    kInitialAcyclic | kTopSorted | kNotTopSorted | kAccessible |\n    kNotAccessible | kCoAccessible | kNotCoAccessible | kString | kNotString |\n    kWeightedCycles | kUnweightedCycles;\n\n// Properties that are preserved when an FST's input labels are changed.\nconstexpr uint64_t kILabelInvariantProperties =\n    kExpanded | kMutable | kError | kODeterministic | kNonODeterministic |\n    kOEpsilons | kNoOEpsilons | kOLabelSorted | kNotOLabelSorted | kWeighted |\n    kUnweighted | kCyclic | kAcyclic | kInitialCyclic | kInitialAcyclic |\n    kTopSorted | kNotTopSorted | kAccessible | kNotAccessible | kCoAccessible |\n    kNotCoAccessible | kString | kNotString | kWeightedCycles |\n    kUnweightedCycles;\n\n// Properties that are preserved when an FST's output labels are changed.\nconstexpr uint64_t kOLabelInvariantProperties =\n    kExpanded | kMutable | kError | kIDeterministic | kNonIDeterministic |\n    kIEpsilons | kNoIEpsilons | kILabelSorted | kNotILabelSorted | kWeighted |\n    kUnweighted | kCyclic | kAcyclic | kInitialCyclic | kInitialAcyclic |\n    kTopSorted | kNotTopSorted | kAccessible | kNotAccessible | kCoAccessible |\n    kNotCoAccessible | kString | kNotString | kWeightedCycles |\n    kUnweightedCycles;\n\n// Properties that are preserved when an FST's weights are changed. This\n// assumes that the set of states that are non-final is not changed.\nconstexpr uint64_t kWeightInvariantProperties =\n    kExpanded | kMutable | kError | kAcceptor | kNotAcceptor | kIDeterministic |\n    kNonIDeterministic | kODeterministic | kNonODeterministic | kEpsilons |\n    kNoEpsilons | kIEpsilons | kNoIEpsilons | kOEpsilons | kNoOEpsilons |\n    kILabelSorted | kNotILabelSorted | kOLabelSorted | kNotOLabelSorted |\n    kCyclic | kAcyclic | kInitialCyclic | kInitialAcyclic | kTopSorted |\n    kNotTopSorted | kAccessible | kNotAccessible | kCoAccessible |\n    kNotCoAccessible | kString | kNotString;\n\n// Properties that are preserved when a superfinal state is added and an FST's\n// final weights are directed to it via new transitions.\nconstexpr uint64_t kAddSuperFinalProperties =\n    kExpanded | kMutable | kError | kAcceptor | kNotAcceptor |\n    kNonIDeterministic | kNonODeterministic | kEpsilons | kIEpsilons |\n    kOEpsilons | kNotILabelSorted | kNotOLabelSorted | kWeighted | kUnweighted |\n    kCyclic | kAcyclic | kInitialCyclic | kInitialAcyclic | kNotTopSorted |\n    kNotAccessible | kCoAccessible | kNotCoAccessible | kNotString |\n    kWeightedCycles | kUnweightedCycles;\n\n// Properties that are preserved when a superfinal state is removed and the\n// epsilon transitions directed to it are made final weights.\nconstexpr uint64_t kRmSuperFinalProperties =\n    kExpanded | kMutable | kError | kAcceptor | kNotAcceptor | kIDeterministic |\n    kODeterministic | kNoEpsilons | kNoIEpsilons | kNoOEpsilons |\n    kILabelSorted | kOLabelSorted | kWeighted | kUnweighted | kCyclic |\n    kAcyclic | kInitialCyclic | kInitialAcyclic | kTopSorted | kAccessible |\n    kCoAccessible | kNotCoAccessible | kString | kWeightedCycles |\n    kUnweightedCycles;\n\n// All binary properties.\nconstexpr uint64_t kBinaryProperties = 0x0000000000000007ULL;\n\n// All trinary properties.\nconstexpr uint64_t kTrinaryProperties = 0x0000ffffffff0000ULL;\n\n// COMPUTED PROPERTIES\n\n// 1st bit of trinary properties.\nconstexpr uint64_t kPosTrinaryProperties = kTrinaryProperties &\n    0x5555555555555555ULL;\n\n// 2nd bit of trinary properties.\nconstexpr uint64_t kNegTrinaryProperties = kTrinaryProperties &\n    0xaaaaaaaaaaaaaaaaULL;\n\n// All properties.\nconstexpr uint64_t kFstProperties = kBinaryProperties | kTrinaryProperties;\n\n// PROPERTY FUNCTIONS and STRING NAMES (defined in properties.cc).\n\n// Below are functions for getting property bit vectors when executing\n// mutation operations.\ninline uint64_t SetStartProperties(uint64_t inprops);\n\ntemplate <typename Weight>\nuint64_t SetFinalProperties(uint64_t inprops, const Weight &old_weight,\n                          const Weight &new_weight);\n\ninline uint64_t AddStateProperties(uint64_t inprops);\n\ntemplate <typename A>\nuint64_t AddArcProperties(uint64_t inprops, typename A::StateId s, const A &arc,\n                        const A *prev_arc);\n\ninline uint64_t DeleteStatesProperties(uint64_t inprops);\n\ninline uint64_t DeleteAllStatesProperties(uint64_t inprops, uint64_t staticProps);\n\ninline uint64_t DeleteArcsProperties(uint64_t inprops);\n\nuint64_t ClosureProperties(uint64_t inprops, bool star, bool delayed = false);\n\nuint64_t ComplementProperties(uint64_t inprops);\n\nuint64_t ComposeProperties(uint64_t inprops1, uint64_t inprops2);\n\nuint64_t ConcatProperties(uint64_t inprops1, uint64_t inprops2, bool delayed = false);\n\nuint64_t DeterminizeProperties(uint64_t inprops, bool has_subsequential_label,\n                             bool distinct_psubsequential_labels);\n\nuint64_t FactorWeightProperties(uint64_t inprops);\n\nuint64_t InvertProperties(uint64_t inprops);\n\nuint64_t ProjectProperties(uint64_t inprops, bool project_input);\n\nuint64_t RandGenProperties(uint64_t inprops, bool weighted);\n\nuint64_t RelabelProperties(uint64_t inprops);\n\nuint64_t ReplaceProperties(const std::vector<uint64_t> &inprops, std::ptrdiff_t root,\n                         bool epsilon_on_call, bool epsilon_on_return,\n                         bool out_epsilon_on_call, bool out_epsilon_on_return,\n                         bool replace_transducer, bool no_empty_fst,\n                         bool all_ilabel_sorted, bool all_olabel_sorted,\n                         bool all_negative_or_dense);\n\nuint64_t ReverseProperties(uint64_t inprops, bool has_superinitial);\n\nuint64_t ReweightProperties(uint64_t inprops);\n\nuint64_t RmEpsilonProperties(uint64_t inprops, bool delayed = false);\n\nuint64_t ShortestPathProperties(uint64_t props, bool tree = false);\n\nuint64_t SynchronizeProperties(uint64_t inprops);\n\nuint64_t UnionProperties(uint64_t inprops1, uint64_t inprops2, bool delayed = false);\n\n// Definitions of inlined functions.\n\nuint64_t SetStartProperties(uint64_t inprops) {\n  auto outprops = inprops & kSetStartProperties;\n  if (inprops & kAcyclic) {\n    outprops |= kInitialAcyclic;\n  }\n  return outprops;\n}\n\nuint64_t AddStateProperties(uint64_t inprops) {\n  return inprops & kAddStateProperties;\n}\n\nuint64_t DeleteStatesProperties(uint64_t inprops) {\n  return inprops & kDeleteStatesProperties;\n}\n\nuint64_t DeleteAllStatesProperties(uint64_t inprops, uint64_t staticprops) {\n  const auto outprops = inprops & kError;\n  return outprops | kNullProperties | staticprops;\n}\n\nuint64_t DeleteArcsProperties(uint64_t inprops) {\n  return inprops & kDeleteArcsProperties;\n}\n\n// Definitions of template functions.\n\ntemplate <typename Weight>\nuint64_t SetFinalProperties(uint64_t inprops, const Weight &old_weight,\n                          const Weight &new_weight) {\n  auto outprops = inprops;\n  if (old_weight != Weight::Zero() && old_weight != Weight::One()) {\n    outprops &= ~kWeighted;\n  }\n  if (new_weight != Weight::Zero() && new_weight != Weight::One()) {\n    outprops |= kWeighted;\n    outprops &= ~kUnweighted;\n  }\n  outprops &= kSetFinalProperties | kWeighted | kUnweighted;\n  return outprops;\n}\n\n/// Gets the properties for the MutableFst::AddArc method.\n///\n/// \\param inprops  the current properties of the FST\n/// \\param s        the ID of the state to which an arc is being added.\n/// \\param arc      the arc being added to the state with the specified ID\n/// \\param prev_arc the previously-added (or \"last\") arc of state s, or nullptr\n//                  if s currently has no arcs.\ntemplate <typename Arc>\nuint64_t AddArcProperties(uint64_t inprops, typename Arc::StateId s,\n                        const Arc &arc, const Arc *prev_arc) {\n  using Weight = typename Arc::Weight;\n  auto outprops = inprops;\n  if (arc.ilabel != arc.olabel) {\n    outprops |= kNotAcceptor;\n    outprops &= ~kAcceptor;\n  }\n  if (arc.ilabel == 0) {\n    outprops |= kIEpsilons;\n    outprops &= ~kNoIEpsilons;\n    if (arc.olabel == 0) {\n      outprops |= kEpsilons;\n      outprops &= ~kNoEpsilons;\n    }\n  }\n  if (arc.olabel == 0) {\n    outprops |= kOEpsilons;\n    outprops &= ~kNoOEpsilons;\n  }\n  if (prev_arc) {\n    if (prev_arc->ilabel > arc.ilabel) {\n      outprops |= kNotILabelSorted;\n      outprops &= ~kILabelSorted;\n    }\n    if (prev_arc->olabel > arc.olabel) {\n      outprops |= kNotOLabelSorted;\n      outprops &= ~kOLabelSorted;\n    }\n  }\n  if (arc.weight != Weight::Zero() && arc.weight != Weight::One()) {\n    outprops |= kWeighted;\n    outprops &= ~kUnweighted;\n  }\n  if (arc.nextstate <= s) {\n    outprops |= kNotTopSorted;\n    outprops &= ~kTopSorted;\n  }\n  outprops &= kAddArcProperties | kAcceptor | kNoEpsilons | kNoIEpsilons |\n              kNoOEpsilons | kILabelSorted | kOLabelSorted | kUnweighted |\n              kTopSorted;\n  if (outprops & kTopSorted) {\n    outprops |= kAcyclic | kInitialAcyclic;\n  }\n  return outprops;\n}\n\nextern const char *PropertyNames[];\n\n}  // namespace fst\n\n#endif  // FST_PROPERTIES_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/prune.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Functions implementing pruning.\n\n#ifndef FST_PRUNE_H_\n#define FST_PRUNE_H_\n\n#include <type_traits>\n#include <utility>\n#include <vector>\n\n#include <fst/log.h>\n\n#include <fst/arcfilter.h>\n#include <fst/heap.h>\n#include <fst/shortest-distance.h>\n\n\nnamespace fst {\nnamespace internal {\n\ntemplate <class StateId, class Weight>\nclass PruneCompare {\n public:\n  PruneCompare(const std::vector<Weight> &idistance,\n               const std::vector<Weight> &fdistance)\n      : idistance_(idistance), fdistance_(fdistance) {}\n\n  bool operator()(const StateId x, const StateId y) const {\n    const auto wx = Times(IDistance(x), FDistance(x));\n    const auto wy = Times(IDistance(y), FDistance(y));\n    return less_(wx, wy);\n  }\n\n private:\n  Weight IDistance(const StateId s) const {\n    return s < idistance_.size() ? idistance_[s] : Weight::Zero();\n  }\n\n  Weight FDistance(const StateId s) const {\n    return s < fdistance_.size() ? fdistance_[s] : Weight::Zero();\n  }\n\n  const std::vector<Weight> &idistance_;\n  const std::vector<Weight> &fdistance_;\n  NaturalLess<Weight> less_;\n};\n\n}  // namespace internal\n\ntemplate <class Arc, class ArcFilter>\nstruct PruneOptions {\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  explicit PruneOptions(const Weight &weight_threshold = Weight::Zero(),\n                        StateId state_threshold = kNoStateId,\n                        ArcFilter filter = ArcFilter(),\n                        std::vector<Weight> *distance = nullptr,\n                        float delta = kDelta, bool threshold_initial = false)\n      : weight_threshold(std::move(weight_threshold)),\n        state_threshold(state_threshold),\n        filter(std::move(filter)),\n        distance(distance),\n        delta(delta),\n        threshold_initial(threshold_initial) {}\n\n  // Pruning weight threshold.\n  Weight weight_threshold;\n  // Pruning state threshold.\n  StateId state_threshold;\n  // Arc filter.\n  ArcFilter filter;\n  // If non-zero, passes in pre-computed shortest distance to final states.\n  const std::vector<Weight> *distance;\n  // Determines the degree of convergence required when computing shortest\n  // distances.\n  float delta;\n  // Determines if the shortest path weight is left (true) or right\n  // (false) multiplied by the threshold to get the limit for\n  // keeping a state or arc (matters if the semiring is not\n  // commutative).\n  bool threshold_initial;\n};\n\n// Pruning algorithm: this version modifies its input and it takes an options\n// class as an argument. After pruning the FST contains states and arcs that\n// belong to a successful path in the FST whose weight is no more than the\n// weight of the shortest path Times() the provided weight threshold. When the\n// state threshold is not kNoStateId, the output FST is further restricted to\n// have no more than the number of states in opts.state_threshold. Weights must\n// have the path property. The weight of any cycle needs to be bounded; i.e.,\n//\n//   Plus(weight, Weight::One()) == Weight::One()\ntemplate <class Arc, class ArcFilter,\n          typename std::enable_if<IsPath<typename Arc::Weight>::value>::type * =\n              nullptr>\nvoid Prune(MutableFst<Arc> *fst, const PruneOptions<Arc, ArcFilter> &opts =\n                                     PruneOptions<Arc, ArcFilter>()) {\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n  using StateHeap = Heap<StateId, internal::PruneCompare<StateId, Weight>>;\n  auto ns = fst->NumStates();\n  if (ns < 1) return;\n  std::vector<Weight> idistance(ns, Weight::Zero());\n  std::vector<Weight> tmp;\n  if (!opts.distance) {\n    tmp.reserve(ns);\n    ShortestDistance(*fst, &tmp, true, opts.delta);\n  }\n  const auto *fdistance = opts.distance ? opts.distance : &tmp;\n  if ((opts.state_threshold == 0) || (fdistance->size() <= fst->Start()) ||\n      ((*fdistance)[fst->Start()] == Weight::Zero())) {\n    fst->DeleteStates();\n    return;\n  }\n  internal::PruneCompare<StateId, Weight> compare(idistance, *fdistance);\n  StateHeap heap(compare);\n  std::vector<bool> visited(ns, false);\n  std::vector<size_t> enqueued(ns, StateHeap::kNoKey);\n  std::vector<StateId> dead;\n  dead.push_back(fst->AddState());\n  NaturalLess<Weight> less;\n  auto s = fst->Start();\n  const auto limit = opts.threshold_initial ?\n      Times(opts.weight_threshold, (*fdistance)[s]) :\n      Times((*fdistance)[s], opts.weight_threshold);\n  StateId num_visited = 0;\n\n  if (!less(limit, (*fdistance)[s])) {\n    idistance[s] = Weight::One();\n    enqueued[s] = heap.Insert(s);\n    ++num_visited;\n  }\n  while (!heap.Empty()) {\n    s = heap.Top();\n    heap.Pop();\n    enqueued[s] = StateHeap::kNoKey;\n    visited[s] = true;\n    if (less(limit, Times(idistance[s], fst->Final(s)))) {\n      fst->SetFinal(s, Weight::Zero());\n    }\n    for (MutableArcIterator<MutableFst<Arc>> aiter(fst, s); !aiter.Done();\n         aiter.Next()) {\n      auto arc = aiter.Value();  // Copy intended.\n      if (!opts.filter(arc)) continue;\n      const auto weight = Times(Times(idistance[s], arc.weight),\n                                arc.nextstate < fdistance->size() ?\n                                (*fdistance)[arc.nextstate] : Weight::Zero());\n      if (less(limit, weight)) {\n        arc.nextstate = dead[0];\n        aiter.SetValue(arc);\n        continue;\n      }\n      if (less(Times(idistance[s], arc.weight), idistance[arc.nextstate])) {\n        idistance[arc.nextstate] = Times(idistance[s], arc.weight);\n      }\n      if (visited[arc.nextstate]) continue;\n      if ((opts.state_threshold != kNoStateId) &&\n          (num_visited >= opts.state_threshold)) {\n        continue;\n      }\n      if (enqueued[arc.nextstate] == StateHeap::kNoKey) {\n        enqueued[arc.nextstate] = heap.Insert(arc.nextstate);\n        ++num_visited;\n      } else {\n        heap.Update(enqueued[arc.nextstate], arc.nextstate);\n      }\n    }\n  }\n  for (StateId i = 0; i < visited.size(); ++i) {\n    if (!visited[i]) dead.push_back(i);\n  }\n  fst->DeleteStates(dead);\n}\n\ntemplate <class Arc, class ArcFilter,\n          typename std::enable_if<!IsPath<typename Arc::Weight>::value>::type\n              * = nullptr>\nvoid Prune(MutableFst<Arc> *fst, const PruneOptions<Arc, ArcFilter> &opts =\n                                     PruneOptions<Arc, ArcFilter>()) {\n  FSTERROR() << \"Prune: Weight needs to have the path property: \"\n             << Arc::Weight::Type();\n  fst->SetProperties(kError, kError);\n}\n\n// Pruning algorithm: this version modifies its input and takes the\n// pruning threshold as an argument. It deletes states and arcs in the\n// FST that do not belong to a successful path whose weight is more\n// than the weight of the shortest path Times() the provided weight\n// threshold. When the state threshold is not kNoStateId, the output\n// FST is further restricted to have no more than the number of states\n// in opts.state_threshold. Weights must have the path property. The\n// weight of any cycle needs to be bounded; i.e.,\n//\n//   Plus(weight, Weight::One()) == Weight::One()\ntemplate <class Arc>\nvoid Prune(MutableFst<Arc> *fst, typename Arc::Weight weight_threshold,\n           typename Arc::StateId state_threshold = kNoStateId,\n           float delta = kDelta) {\n  const PruneOptions<Arc, AnyArcFilter<Arc>> opts(\n      weight_threshold, state_threshold, AnyArcFilter<Arc>(), nullptr, delta);\n  Prune(fst, opts);\n}\n\n// Pruning algorithm: this version writes the pruned input FST to an\n// output MutableFst and it takes an options class as an argument. The\n// output FST contains states and arcs that belong to a successful\n// path in the input FST whose weight is more than the weight of the\n// shortest path Times() the provided weight threshold. When the state\n// threshold is not kNoStateId, the output FST is further restricted\n// to have no more than the number of states in\n// opts.state_threshold. Weights have the path property.  The weight\n// of any cycle needs to be bounded; i.e.,\n//\n//   Plus(weight, Weight::One()) == Weight::One()\ntemplate <class Arc, class ArcFilter,\n          typename std::enable_if<IsPath<typename Arc::Weight>::value>::type * =\n              nullptr>\nvoid Prune(\n    const Fst<Arc> &ifst, MutableFst<Arc> *ofst,\n    const PruneOptions<Arc, ArcFilter> &opts = PruneOptions<Arc, ArcFilter>()) {\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n  using StateHeap = Heap<StateId, internal::PruneCompare<StateId, Weight>>;\n  ofst->DeleteStates();\n  ofst->SetInputSymbols(ifst.InputSymbols());\n  ofst->SetOutputSymbols(ifst.OutputSymbols());\n  if (ifst.Start() == kNoStateId) return;\n  NaturalLess<Weight> less;\n  if (less(opts.weight_threshold, Weight::One()) ||\n      (opts.state_threshold == 0)) {\n    return;\n  }\n  std::vector<Weight> idistance;\n  std::vector<Weight> tmp;\n  if (!opts.distance) ShortestDistance(ifst, &tmp, true, opts.delta);\n  const auto *fdistance = opts.distance ? opts.distance : &tmp;\n  if ((fdistance->size() <= ifst.Start()) ||\n      ((*fdistance)[ifst.Start()] == Weight::Zero())) {\n    return;\n  }\n  internal::PruneCompare<StateId, Weight> compare(idistance, *fdistance);\n  StateHeap heap(compare);\n  std::vector<StateId> copy;\n  std::vector<size_t> enqueued;\n  std::vector<bool> visited;\n  auto s = ifst.Start();\n  const auto limit = opts.threshold_initial ?\n      Times(opts.weight_threshold, (*fdistance)[s]) :\n      Times((*fdistance)[s], opts.weight_threshold);\n  while (copy.size() <= s) copy.push_back(kNoStateId);\n  copy[s] = ofst->AddState();\n  ofst->SetStart(copy[s]);\n  while (idistance.size() <= s) idistance.push_back(Weight::Zero());\n  idistance[s] = Weight::One();\n  while (enqueued.size() <= s) {\n    enqueued.push_back(StateHeap::kNoKey);\n    visited.push_back(false);\n  }\n  enqueued[s] = heap.Insert(s);\n  while (!heap.Empty()) {\n    s = heap.Top();\n    heap.Pop();\n    enqueued[s] = StateHeap::kNoKey;\n    visited[s] = true;\n    if (!less(limit, Times(idistance[s], ifst.Final(s)))) {\n      ofst->SetFinal(copy[s], ifst.Final(s));\n    }\n    for (ArcIterator<Fst<Arc>> aiter(ifst, s); !aiter.Done(); aiter.Next()) {\n      const auto &arc = aiter.Value();\n      if (!opts.filter(arc)) continue;\n      const auto weight = Times(Times(idistance[s], arc.weight),\n                                arc.nextstate < fdistance->size() ?\n                                (*fdistance)[arc.nextstate] : Weight::Zero());\n      if (less(limit, weight)) continue;\n      if ((opts.state_threshold != kNoStateId) &&\n          (ofst->NumStates() >= opts.state_threshold)) {\n        continue;\n      }\n      while (idistance.size() <= arc.nextstate) {\n        idistance.push_back(Weight::Zero());\n      }\n      if (less(Times(idistance[s], arc.weight), idistance[arc.nextstate])) {\n        idistance[arc.nextstate] = Times(idistance[s], arc.weight);\n      }\n      while (copy.size() <= arc.nextstate) copy.push_back(kNoStateId);\n      if (copy[arc.nextstate] == kNoStateId) {\n        copy[arc.nextstate] = ofst->AddState();\n      }\n      ofst->AddArc(copy[s], Arc(arc.ilabel, arc.olabel, arc.weight,\n                                copy[arc.nextstate]));\n      while (enqueued.size() <= arc.nextstate) {\n        enqueued.push_back(StateHeap::kNoKey);\n        visited.push_back(false);\n      }\n      if (visited[arc.nextstate]) continue;\n      if (enqueued[arc.nextstate] == StateHeap::kNoKey) {\n        enqueued[arc.nextstate] = heap.Insert(arc.nextstate);\n      } else {\n        heap.Update(enqueued[arc.nextstate], arc.nextstate);\n      }\n    }\n  }\n}\n\ntemplate <class Arc, class ArcFilter,\n          typename std::enable_if<!IsPath<typename Arc::Weight>::value>::type\n              * = nullptr>\nvoid Prune(const Fst<Arc> &, MutableFst<Arc> *ofst,\n           const PruneOptions<Arc, ArcFilter> &) {\n  FSTERROR() << \"Prune: Weight needs to have the path property: \"\n             << Arc::Weight::Type();\n  ofst->SetProperties(kError, kError);\n}\n\n// Pruning algorithm: this version writes the pruned input FST to an\n// output MutableFst and simply takes the pruning threshold as an\n// argument. The output FST contains states and arcs that belong to a\n// successful path in the input FST whose weight is no more than the\n// weight of the shortest path Times() the provided weight\n// threshold. When the state threshold is not kNoStateId, the output\n// FST is further restricted to have no more than the number of states\n// in opts.state_threshold. Weights must have the path property. The\n// weight of any cycle needs to be bounded; i.e.,\n//\n// Plus(weight, Weight::One()) = Weight::One();\ntemplate <class Arc>\nvoid Prune(const Fst<Arc> &ifst, MutableFst<Arc> *ofst,\n           typename Arc::Weight weight_threshold,\n           typename Arc::StateId state_threshold = kNoStateId,\n           float delta = kDelta) {\n  const PruneOptions<Arc, AnyArcFilter<Arc>> opts(\n      weight_threshold, state_threshold, AnyArcFilter<Arc>(), nullptr, delta);\n  Prune(ifst, ofst, opts);\n}\n\n}  // namespace fst\n\n#endif  // FST_PRUNE_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/push.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Class to reweight/push an FST, and utility functions to weigh and reweight\n// an FST.\n\n#ifndef FST_PUSH_H_\n#define FST_PUSH_H_\n\n#include <vector>\n\n#include <fst/log.h>\n\n#include <fst/arc-map.h>\n#include <fst/factor-weight.h>\n#include <fst/fst.h>\n#include <fst/reweight.h>\n#include <fst/shortest-distance.h>\n\n\nnamespace fst {\n\n// Computes the total weight (sum of the weights of all accepting paths) from\n// the output of ShortestDistance, using the shortest distance from the final\n// state when reverse is true and from the initial state otherwise.\ntemplate <class Arc>\ntypename Arc::Weight ComputeTotalWeight(\n    const Fst<Arc> &fst, const std::vector<typename Arc::Weight> &distance,\n    bool reverse) {\n  if (reverse) {\n    return fst.Start() < distance.size() ? distance[fst.Start()]\n                                         : Arc::Weight::Zero();\n  }\n  auto sum = Arc::Weight::Zero();\n  for (typename Arc::StateId s = 0; s < distance.size(); ++s) {\n    sum = Plus(sum, Times(distance[s], fst.Final(s)));\n  }\n  return sum;\n}\n\n// Divides the weight of every accepting path by a fixed weight. This weight\n// is also divided at the final state if at_final is true and at the initial\n// state otherwise.\ntemplate <class Arc>\nvoid RemoveWeight(MutableFst<Arc> *fst, const typename Arc::Weight &weight,\n                  bool at_final) {\n  using Weight = typename Arc::Weight;\n  if ((weight == Weight::One()) || (weight == Weight::Zero())) return;\n  if (at_final) {\n    for (StateIterator<MutableFst<Arc>> siter(*fst); !siter.Done();\n         siter.Next()) {\n      fst->SetFinal(siter.Value(),\n                    Divide(fst->Final(siter.Value()), weight, DIVIDE_RIGHT));\n    }\n  } else {\n    const auto start = fst->Start();\n    for (MutableArcIterator<MutableFst<Arc>> aiter(fst, start); !aiter.Done();\n         aiter.Next()) {\n      auto arc = aiter.Value();\n      arc.weight = Divide(arc.weight, weight, DIVIDE_LEFT);\n      aiter.SetValue(arc);\n    }\n    fst->SetFinal(start, Divide(fst->Final(start), weight, DIVIDE_LEFT));\n  }\n}\n\n// Pushes the weights in FST in the direction defined by TYPE. If\n// pushing towards the initial state, the sum of the weight of the\n// outgoing transitions and final weight at a non-initial state is\n// equal to One() in the resulting machine. If pushing towards the\n// final state, the same property holds on the reverse machine.\n//\n// Weight needs to be left distributive when pushing towards the\n// initial state and right distributive when pushing towards the final\n// states.\ntemplate <class Arc>\nvoid Push(MutableFst<Arc> *fst, ReweightType type, float delta = kDelta,\n          bool remove_total_weight = false) {\n  using Weight = typename Arc::Weight;\n  std::vector<Weight> distance;\n  ShortestDistance(*fst, &distance, type == REWEIGHT_TO_INITIAL, delta);\n  auto total_weight = Weight::One();\n  if (remove_total_weight) {\n    total_weight =\n        ComputeTotalWeight(*fst, distance, type == REWEIGHT_TO_INITIAL);\n  }\n  Reweight(fst, distance, type);\n  if (remove_total_weight) {\n    RemoveWeight(fst, total_weight, type == REWEIGHT_TO_FINAL);\n  }\n}\n\nconstexpr uint32_t kPushWeights = 0x0001;\nconstexpr uint32_t kPushLabels = 0x0002;\nconstexpr uint32_t kPushRemoveTotalWeight = 0x0004;\nconstexpr uint32_t kPushRemoveCommonAffix = 0x0008;\n\n// Pushes the weights and/or labels of the input FST into the output\n// mutable FST by pushing weights and/or labels (as determined by the\n// ptype argument) towards the initial state or final states (as\n// determined by the rtype template parameter). The weight type must\n// be left distributive when pushing weights towards the initial state, and\n// right distribution when pushing weights towards the final states.\ntemplate <class Arc, ReweightType rtype>\nvoid Push(const Fst<Arc> &ifst, MutableFst<Arc> *ofst, uint32_t ptype,\n          float delta = kDelta) {\n  using Label = typename Arc::Label;\n  using Weight = typename Arc::Weight;\n  if ((ptype & (kPushWeights | kPushLabels)) == kPushWeights) {\n    *ofst = ifst;\n    Push(ofst, rtype, delta, ptype & kPushRemoveTotalWeight);\n  } else if (ptype & kPushLabels) {\n    const auto gtype =\n        rtype == REWEIGHT_TO_INITIAL ? GALLIC_LEFT : GALLIC_RIGHT;\n    using GallicWeight = typename GallicArc<Arc, gtype>::Weight;\n    std::vector<GallicWeight> gdistance;\n    VectorFst<GallicArc<Arc, gtype>> gfst;\n    ArcMap(ifst, &gfst, ToGallicMapper<Arc, gtype>());\n    if (ptype & kPushWeights) {\n      ShortestDistance(gfst, &gdistance, rtype == REWEIGHT_TO_INITIAL, delta);\n    } else {\n      ArcMapFst<Arc, Arc, RmWeightMapper<Arc>> uwfst(ifst,\n                                                      RmWeightMapper<Arc>());\n      ArcMapFst<Arc, GallicArc<Arc, gtype>, ToGallicMapper<Arc, gtype>> guwfst(\n          uwfst, ToGallicMapper<Arc, gtype>());\n      ShortestDistance(guwfst, &gdistance, rtype == REWEIGHT_TO_INITIAL, delta);\n    }\n    auto total_weight = GallicWeight::One();\n    if (ptype & (kPushRemoveTotalWeight | kPushRemoveCommonAffix)) {\n      total_weight =\n          ComputeTotalWeight(gfst, gdistance, rtype == REWEIGHT_TO_INITIAL);\n      total_weight = GallicWeight(\n          ptype & kPushRemoveCommonAffix\n              ? total_weight.Value1()\n              : StringWeight<Label, GallicStringType(gtype)>::One(),\n          ptype & kPushRemoveTotalWeight ? total_weight.Value2()\n                                         : Weight::One());\n    }\n    Reweight(&gfst, gdistance, rtype);\n    if (ptype & (kPushRemoveTotalWeight | kPushRemoveCommonAffix)) {\n      RemoveWeight(&gfst, total_weight, rtype == REWEIGHT_TO_FINAL);\n    }\n    FactorWeightFst<GallicArc<Arc, gtype>, GallicFactor<Label, Weight, gtype>>\n        fwfst(gfst);\n    ArcMap(fwfst, ofst, FromGallicMapper<Arc, gtype>());\n    ofst->SetOutputSymbols(ifst.OutputSymbols());\n  } else {\n    LOG(WARNING) << \"Push: pushing type is set to 0, so not pushing\";\n    *ofst = ifst;\n  }\n}\n\n}  // namespace fst\n\n#endif  // FST_PUSH_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/queue.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Functions and classes for various FST state queues with a unified interface.\n\n#ifndef FST_QUEUE_H_\n#define FST_QUEUE_H_\n\n#include <deque>\n#include <memory>\n#include <type_traits>\n#include <utility>\n#include <vector>\n\n#include <fst/log.h>\n\n#include <fst/arcfilter.h>\n#include <fst/connect.h>\n#include <fst/heap.h>\n#include <fst/topsort.h>\n\n\nnamespace fst {\n\n// The Queue interface is:\n//\n// template <class S>\n// class Queue {\n//  public:\n//   using StateId = S;\n//\n//   // Constructor: may need args (e.g., FST, comparator) for some queues.\n//   Queue(...) override;\n//\n//   // Returns the head of the queue.\n//   StateId Head() const override;\n//\n//   // Inserts a state.\n//   void Enqueue(StateId s) override;\n//\n//   // Removes the head of the queue.\n//   void Dequeue() override;\n//\n//   // Updates ordering of state s when weight changes, if necessary.\n//   void Update(StateId s) override;\n//\n//   // Is the queue empty?\n//   bool Empty() const override;\n//\n//   // Removes all states from the queue.\n//   void Clear() override;\n// };\n\n// State queue types.\nenum QueueType {\n  TRIVIAL_QUEUE = 0,         // Single state queue.\n  FIFO_QUEUE = 1,            // First-in, first-out queue.\n  LIFO_QUEUE = 2,            // Last-in, first-out queue.\n  SHORTEST_FIRST_QUEUE = 3,  // Shortest-first queue.\n  TOP_ORDER_QUEUE = 4,       // Topologically-ordered queue.\n  STATE_ORDER_QUEUE = 5,     // State ID-ordered queue.\n  SCC_QUEUE = 6,             // Component graph top-ordered meta-queue.\n  AUTO_QUEUE = 7,            // Auto-selected queue.\n  OTHER_QUEUE = 8\n};\n\n// QueueBase, templated on the StateId, is a virtual base class shared by all\n// queues considered by AutoQueue.\ntemplate <class S>\nclass QueueBase {\n public:\n  using StateId = S;\n\n  virtual ~QueueBase() {}\n\n  // Concrete implementation.\n\n  explicit QueueBase(QueueType type) : queue_type_(type), error_(false) {}\n\n  void SetError(bool error) { error_ = error; }\n\n  bool Error() const { return error_; }\n\n  QueueType Type() const { return queue_type_; }\n\n  // Virtual interface.\n\n  virtual StateId Head() const = 0;\n  virtual void Enqueue(StateId) = 0;\n  virtual void Dequeue() = 0;\n  virtual void Update(StateId) = 0;\n  virtual bool Empty() const = 0;\n  virtual void Clear() = 0;\n\n private:\n  QueueType queue_type_;\n  bool error_;\n};\n\n// Trivial queue discipline; one may enqueue at most one state at a time. It\n// can be used for strongly connected components with only one state and no\n// self-loops.\ntemplate <class S>\nclass TrivialQueue : public QueueBase<S> {\n public:\n  using StateId = S;\n\n  TrivialQueue() : QueueBase<StateId>(TRIVIAL_QUEUE), front_(kNoStateId) {}\n\n  virtual ~TrivialQueue() = default;\n\n  StateId Head() const final { return front_; }\n\n  void Enqueue(StateId s) final { front_ = s; }\n\n  void Dequeue() final { front_ = kNoStateId; }\n\n  void Update(StateId) final {}\n\n  bool Empty() const final { return front_ == kNoStateId; }\n\n  void Clear() final { front_ = kNoStateId; }\n\n private:\n  StateId front_;\n};\n\n// First-in, first-out queue discipline.\n//\n// This is not a final class.\ntemplate <class S>\nclass FifoQueue : public QueueBase<S> {\n public:\n  using StateId = S;\n\n  FifoQueue() : QueueBase<StateId>(FIFO_QUEUE) {}\n\n  virtual ~FifoQueue() = default;\n\n  StateId Head() const override { return queue_.back(); }\n\n  void Enqueue(StateId s) override { queue_.push_front(s); }\n\n  void Dequeue() override { queue_.pop_back(); }\n\n  void Update(StateId) override {}\n\n  bool Empty() const override { return queue_.empty(); }\n\n  void Clear() override { queue_.clear(); }\n\n private:\n  std::deque<StateId> queue_;\n};\n\n// Last-in, first-out queue discipline.\ntemplate <class S>\nclass LifoQueue : public QueueBase<S> {\n public:\n  using StateId = S;\n\n  LifoQueue() : QueueBase<StateId>(LIFO_QUEUE) {}\n\n  virtual ~LifoQueue() = default;\n\n  StateId Head() const final { return queue_.front(); }\n\n  void Enqueue(StateId s) final { queue_.push_front(s); }\n\n  void Dequeue() final { queue_.pop_front(); }\n\n  void Update(StateId) final {}\n\n  bool Empty() const final { return queue_.empty(); }\n\n  void Clear() final { queue_.clear(); }\n\n private:\n  std::deque<StateId> queue_;\n};\n\n// Shortest-first queue discipline, templated on the StateId and as well as a\n// comparison functor used to compare two StateIds. If a (single) state's order\n// changes, it can be reordered in the queue with a call to Update(). If update\n// is false, call to Update() does not reorder the queue.\n//\n// This is not a final class.\ntemplate <typename S, typename Compare, bool update = true>\nclass ShortestFirstQueue : public QueueBase<S> {\n public:\n  using StateId = S;\n\n  explicit ShortestFirstQueue(Compare comp)\n      : QueueBase<StateId>(SHORTEST_FIRST_QUEUE), heap_(comp) {}\n\n  virtual ~ShortestFirstQueue() = default;\n\n  StateId Head() const override { return heap_.Top(); }\n\n  void Enqueue(StateId s) override {\n    if (update) {\n      for (StateId i = key_.size(); i <= s; ++i) key_.push_back(kNoStateId);\n      key_[s] = heap_.Insert(s);\n    } else {\n      heap_.Insert(s);\n    }\n  }\n\n  void Dequeue() override {\n    if (update) {\n      key_[heap_.Pop()] = kNoStateId;\n    } else {\n      heap_.Pop();\n    }\n  }\n\n  void Update(StateId s) override {\n    if (!update) return;\n    if (s >= key_.size() || key_[s] == kNoStateId) {\n      Enqueue(s);\n    } else {\n      heap_.Update(key_[s], s);\n    }\n  }\n\n  bool Empty() const override { return heap_.Empty(); }\n\n  void Clear() override {\n    heap_.Clear();\n    if (update) key_.clear();\n  }\n\n  const Compare &GetCompare() const { return heap_.GetCompare(); }\n\n private:\n  Heap<StateId, Compare> heap_;\n  std::vector<std::ptrdiff_t> key_;\n};\n\nnamespace internal {\n\n// Given a vector that maps from states to weights, and a comparison functor\n// for weights, this class defines a comparison function object between states.\ntemplate <typename StateId, typename Less>\nclass StateWeightCompare {\n public:\n  using Weight = typename Less::Weight;\n\n  StateWeightCompare(const std::vector<Weight> &weights, const Less &less)\n      : weights_(weights), less_(less) {}\n\n  bool operator()(const StateId s1, const StateId s2) const {\n    return less_(weights_[s1], weights_[s2]);\n  }\n\n private:\n  // Borrowed references.\n  const std::vector<Weight> &weights_;\n  const Less &less_;\n};\n\n}  // namespace internal\n\n// Shortest-first queue discipline, templated on the StateId and Weight, is\n// specialized to use the weight's natural order for the comparison function.\ntemplate <typename S, typename Weight>\nclass NaturalShortestFirstQueue final\n    : public ShortestFirstQueue<\n          S, internal::StateWeightCompare<S, NaturalLess<Weight>>> {\n public:\n  using StateId = S;\n  using Compare = internal::StateWeightCompare<StateId, NaturalLess<Weight>>;\n\n  explicit NaturalShortestFirstQueue(const std::vector<Weight> &distance)\n      : ShortestFirstQueue<StateId, Compare>(Compare(distance, less_)) {}\n\n  virtual ~NaturalShortestFirstQueue() = default;\n\n private:\n  // This is non-static because the constructor for non-idempotent weights will\n  // result in an error.\n  const NaturalLess<Weight> less_{};\n};\n\n// Topological-order queue discipline, templated on the StateId. States are\n// ordered in the queue topologically. The FST must be acyclic.\ntemplate <class S>\nclass TopOrderQueue : public QueueBase<S> {\n public:\n  using StateId = S;\n\n  // This constructor computes the topological order. It accepts an arc filter\n  // to limit the transitions considered in that computation (e.g., only the\n  // epsilon graph).\n  template <class Arc, class ArcFilter>\n  TopOrderQueue(const Fst<Arc> &fst, ArcFilter filter)\n      : QueueBase<StateId>(TOP_ORDER_QUEUE),\n        front_(0),\n        back_(kNoStateId),\n        order_(0),\n        state_(0) {\n    bool acyclic;\n    TopOrderVisitor<Arc> top_order_visitor(&order_, &acyclic);\n    DfsVisit(fst, &top_order_visitor, filter);\n    if (!acyclic) {\n      FSTERROR() << \"TopOrderQueue: FST is not acyclic\";\n      QueueBase<S>::SetError(true);\n    }\n    state_.resize(order_.size(), kNoStateId);\n  }\n\n  // This constructor is passed the pre-computed topological order.\n  explicit TopOrderQueue(const std::vector<StateId> &order)\n      : QueueBase<StateId>(TOP_ORDER_QUEUE),\n        front_(0),\n        back_(kNoStateId),\n        order_(order),\n        state_(order.size(), kNoStateId) {}\n\n  virtual ~TopOrderQueue() = default;\n\n  StateId Head() const final { return state_[front_]; }\n\n  void Enqueue(StateId s) final {\n    if (front_ > back_) {\n      front_ = back_ = order_[s];\n    } else if (order_[s] > back_) {\n      back_ = order_[s];\n    } else if (order_[s] < front_) {\n      front_ = order_[s];\n    }\n    state_[order_[s]] = s;\n  }\n\n  void Dequeue() final {\n    state_[front_] = kNoStateId;\n    while ((front_ <= back_) && (state_[front_] == kNoStateId)) ++front_;\n  }\n\n  void Update(StateId) final {}\n\n  bool Empty() const final { return front_ > back_; }\n\n  void Clear() final {\n    for (StateId s = front_; s <= back_; ++s) state_[s] = kNoStateId;\n    back_ = kNoStateId;\n    front_ = 0;\n  }\n\n private:\n  StateId front_;\n  StateId back_;\n  std::vector<StateId> order_;\n  std::vector<StateId> state_;\n};\n\n// State order queue discipline, templated on the StateId. States are ordered in\n// the queue by state ID.\ntemplate <class S>\nclass StateOrderQueue : public QueueBase<S> {\n public:\n  using StateId = S;\n\n  StateOrderQueue()\n      : QueueBase<StateId>(STATE_ORDER_QUEUE), front_(0), back_(kNoStateId) {}\n\n  virtual ~StateOrderQueue() = default;\n\n  StateId Head() const final { return front_; }\n\n  void Enqueue(StateId s) final {\n    if (front_ > back_) {\n      front_ = back_ = s;\n    } else if (s > back_) {\n      back_ = s;\n    } else if (s < front_) {\n      front_ = s;\n    }\n    while (enqueued_.size() <= s) enqueued_.push_back(false);\n    enqueued_[s] = true;\n  }\n\n  void Dequeue() final {\n    enqueued_[front_] = false;\n    while ((front_ <= back_) && (enqueued_[front_] == false)) ++front_;\n  }\n\n  void Update(StateId) final {}\n\n  bool Empty() const final { return front_ > back_; }\n\n  void Clear() final {\n    for (StateId i = front_; i <= back_; ++i) enqueued_[i] = false;\n    front_ = 0;\n    back_ = kNoStateId;\n  }\n\n private:\n  StateId front_;\n  StateId back_;\n  std::vector<bool> enqueued_;\n};\n\n// SCC topological-order meta-queue discipline, templated on the StateId and a\n// queue used inside each SCC. It visits the SCCs of an FST in topological\n// order. Its constructor is passed the queues to to use within an SCC.\ntemplate <class S, class Queue>\nclass SccQueue : public QueueBase<S> {\n public:\n  using StateId = S;\n\n  // Constructor takes a vector specifying the SCC number per state and a\n  // vector giving the queue to use per SCC number.\n  SccQueue(const std::vector<StateId> &scc,\n           std::vector<std::unique_ptr<Queue>> *queue)\n      : QueueBase<StateId>(SCC_QUEUE),\n        queue_(queue),\n        scc_(scc),\n        front_(0),\n        back_(kNoStateId) {}\n\n  virtual ~SccQueue() = default;\n\n  StateId Head() const final {\n    while ((front_ <= back_) &&\n           (((*queue_)[front_] && (*queue_)[front_]->Empty()) ||\n            (((*queue_)[front_] == nullptr) &&\n             ((front_ >= trivial_queue_.size()) ||\n              (trivial_queue_[front_] == kNoStateId))))) {\n      ++front_;\n    }\n    if ((*queue_)[front_]) {\n      return (*queue_)[front_]->Head();\n    } else {\n      return trivial_queue_[front_];\n    }\n  }\n\n  void Enqueue(StateId s) final {\n    if (front_ > back_) {\n      front_ = back_ = scc_[s];\n    } else if (scc_[s] > back_) {\n      back_ = scc_[s];\n    } else if (scc_[s] < front_) {\n      front_ = scc_[s];\n    }\n    if ((*queue_)[scc_[s]]) {\n      (*queue_)[scc_[s]]->Enqueue(s);\n    } else {\n      while (trivial_queue_.size() <= scc_[s]) {\n        trivial_queue_.push_back(kNoStateId);\n      }\n      trivial_queue_[scc_[s]] = s;\n    }\n  }\n\n  void Dequeue() final {\n    if ((*queue_)[front_]) {\n      (*queue_)[front_]->Dequeue();\n    } else if (front_ < trivial_queue_.size()) {\n      trivial_queue_[front_] = kNoStateId;\n    }\n  }\n\n  void Update(StateId s) final {\n    if ((*queue_)[scc_[s]]) (*queue_)[scc_[s]]->Update(s);\n  }\n\n  bool Empty() const final {\n    // Queues SCC number back_ is not empty unless back_ == front_.\n    if (front_ < back_) {\n      return false;\n    } else if (front_ > back_) {\n      return true;\n    } else if ((*queue_)[front_]) {\n      return (*queue_)[front_]->Empty();\n    } else {\n      return (front_ >= trivial_queue_.size()) ||\n             (trivial_queue_[front_] == kNoStateId);\n    }\n  }\n\n  void Clear() final {\n    for (StateId i = front_; i <= back_; ++i) {\n      if ((*queue_)[i]) {\n        (*queue_)[i]->Clear();\n      } else if (i < trivial_queue_.size()) {\n        trivial_queue_[i] = kNoStateId;\n      }\n    }\n    front_ = 0;\n    back_ = kNoStateId;\n  }\n\n private:\n  std::vector<std::unique_ptr<Queue>> *queue_;\n  const std::vector<StateId> &scc_;\n  mutable StateId front_;\n  StateId back_;\n  std::vector<StateId> trivial_queue_;\n};\n\n// Automatic queue discipline. It selects a queue discipline for a given FST\n// based on its properties.\ntemplate <class S>\nclass AutoQueue : public QueueBase<S> {\n public:\n  using StateId = S;\n\n  // This constructor takes a state distance vector that, if non-null and if\n  // the Weight type has the path property, will entertain the shortest-first\n  // queue using the natural order w.r.t to the distance.\n  template <class Arc, class ArcFilter>\n  AutoQueue(const Fst<Arc> &fst,\n            const std::vector<typename Arc::Weight> *distance, ArcFilter filter)\n      : QueueBase<StateId>(AUTO_QUEUE) {\n    using Weight = typename Arc::Weight;\n    using Less = NaturalLess<Weight>;\n    using Compare = internal::StateWeightCompare<StateId, Less>;\n    // First checks if the FST is known to have these properties.\n    const auto props =\n        fst.Properties(kAcyclic | kCyclic | kTopSorted | kUnweighted, false);\n    if ((props & kTopSorted) || fst.Start() == kNoStateId) {\n      queue_.reset(new StateOrderQueue<StateId>());\n      VLOG(2) << \"AutoQueue: using state-order discipline\";\n    } else if (props & kAcyclic) {\n      queue_.reset(new TopOrderQueue<StateId>(fst, filter));\n      VLOG(2) << \"AutoQueue: using top-order discipline\";\n    } else if ((props & kUnweighted) && (Weight::Properties() & kIdempotent)) {\n      queue_.reset(new LifoQueue<StateId>());\n      VLOG(2) << \"AutoQueue: using LIFO discipline\";\n    } else {\n      uint64_t properties;\n      // Decomposes into strongly-connected components.\n      SccVisitor<Arc> scc_visitor(&scc_, nullptr, nullptr, &properties);\n      DfsVisit(fst, &scc_visitor, filter);\n      auto nscc = *std::max_element(scc_.begin(), scc_.end()) + 1;\n      std::vector<QueueType> queue_types(nscc);\n      std::unique_ptr<Less> less;\n      std::unique_ptr<Compare> comp;\n      if (distance && (Weight::Properties() & kPath) == kPath) {\n        less.reset(new Less);\n        comp.reset(new Compare(*distance, *less));\n      }\n      // Finds the queue type to use per SCC.\n      bool unweighted;\n      bool all_trivial;\n      SccQueueType(fst, scc_, &queue_types, filter, less.get(), &all_trivial,\n                   &unweighted);\n      // If unweighted and semiring is idempotent, uses LIFO queue.\n      if (unweighted) {\n        queue_.reset(new LifoQueue<StateId>());\n        VLOG(2) << \"AutoQueue: using LIFO discipline\";\n        return;\n      }\n      // If all the SCC are trivial, the FST is acyclic and the scc number gives\n      // the topological order.\n      if (all_trivial) {\n        queue_.reset(new TopOrderQueue<StateId>(scc_));\n        VLOG(2) << \"AutoQueue: using top-order discipline\";\n        return;\n      }\n      VLOG(2) << \"AutoQueue: using SCC meta-discipline\";\n      queues_.resize(nscc);\n      for (StateId i = 0; i < nscc; ++i) {\n        switch (queue_types[i]) {\n          case TRIVIAL_QUEUE:\n            queues_[i].reset();\n            VLOG(3) << \"AutoQueue: SCC #\" << i << \": using trivial discipline\";\n            break;\n          case SHORTEST_FIRST_QUEUE:\n            queues_[i].reset(\n                new ShortestFirstQueue<StateId, Compare, false>(*comp));\n            VLOG(3) << \"AutoQueue: SCC #\" << i\n                    << \": using shortest-first discipline\";\n            break;\n          case LIFO_QUEUE:\n            queues_[i].reset(new LifoQueue<StateId>());\n            VLOG(3) << \"AutoQueue: SCC #\" << i << \": using LIFO discipline\";\n            break;\n          case FIFO_QUEUE:\n          default:\n            queues_[i].reset(new FifoQueue<StateId>());\n            VLOG(3) << \"AutoQueue: SCC #\" << i << \": using FIFO discipine\";\n            break;\n        }\n      }\n      queue_.reset(new SccQueue<StateId, QueueBase<StateId>>(scc_, &queues_));\n    }\n  }\n\n  virtual ~AutoQueue() = default;\n\n  StateId Head() const final { return queue_->Head(); }\n\n  void Enqueue(StateId s) final { queue_->Enqueue(s); }\n\n  void Dequeue() final { queue_->Dequeue(); }\n\n  void Update(StateId s) final { queue_->Update(s); }\n\n  bool Empty() const final { return queue_->Empty(); }\n\n  void Clear() final { queue_->Clear(); }\n\n private:\n  template <class Arc, class ArcFilter, class Less>\n  static void SccQueueType(const Fst<Arc> &fst, const std::vector<StateId> &scc,\n                           std::vector<QueueType> *queue_types,\n                           ArcFilter filter, Less *less, bool *all_trivial,\n                           bool *unweighted);\n\n  std::unique_ptr<QueueBase<StateId>> queue_;\n  std::vector<std::unique_ptr<QueueBase<StateId>>> queues_;\n  std::vector<StateId> scc_;\n};\n\n// Examines the states in an FST's strongly connected components and determines\n// which type of queue to use per SCC. Stores result as a vector of QueueTypes\n// which is assumed to have length equal to the number of SCCs. An arc filter\n// is used to limit the transitions considered (e.g., only the epsilon graph).\n// The argument all_trivial is set to true if every queue is the trivial queue.\n// The argument unweighted is set to true if the semiring is idempotent and all\n// the arc weights are equal to Zero() or One().\ntemplate <class StateId>\ntemplate <class Arc, class ArcFilter, class Less>\nvoid AutoQueue<StateId>::SccQueueType(const Fst<Arc> &fst,\n                                      const std::vector<StateId> &scc,\n                                      std::vector<QueueType> *queue_type,\n                                      ArcFilter filter, Less *less,\n                                      bool *all_trivial, bool *unweighted) {\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n  *all_trivial = true;\n  *unweighted = true;\n  for (StateId i = 0; i < queue_type->size(); ++i) {\n    (*queue_type)[i] = TRIVIAL_QUEUE;\n  }\n  for (StateIterator<Fst<Arc>> sit(fst); !sit.Done(); sit.Next()) {\n    const auto state = sit.Value();\n    for (ArcIterator<Fst<Arc>> ait(fst, state); !ait.Done(); ait.Next()) {\n      const auto &arc = ait.Value();\n      if (!filter(arc)) continue;\n      if (scc[state] == scc[arc.nextstate]) {\n        auto &type = (*queue_type)[scc[state]];\n        if (!less || ((*less)(arc.weight, Weight::One()))) {\n          type = FIFO_QUEUE;\n        } else if ((type == TRIVIAL_QUEUE) || (type == LIFO_QUEUE)) {\n          if (!(Weight::Properties() & kIdempotent) ||\n              (arc.weight != Weight::Zero() && arc.weight != Weight::One())) {\n            type = SHORTEST_FIRST_QUEUE;\n          } else {\n            type = LIFO_QUEUE;\n          }\n        }\n        if (type != TRIVIAL_QUEUE) *all_trivial = false;\n      }\n      if (!(Weight::Properties() & kIdempotent) ||\n          (arc.weight != Weight::Zero() && arc.weight != Weight::One())) {\n        *unweighted = false;\n      }\n    }\n  }\n}\n\n// An A* estimate is a function object that maps from a state ID to an\n// estimate of the shortest distance to the final states.\n\n// A trivial A* estimate, yielding a queue which behaves the same in Dijkstra's\n// algorithm.\ntemplate <typename StateId, typename Weight>\nstruct TrivialAStarEstimate {\n  const Weight &operator()(StateId) const { return Weight::One(); }\n};\n\n// A non-trivial A* estimate using a vector of the estimated future costs.\ntemplate <typename StateId, typename Weight>\nclass NaturalAStarEstimate {\n public:\n  NaturalAStarEstimate(const std::vector<Weight> &beta) :\n          beta_(beta) {}\n\n  const Weight &operator()(StateId s) const { return beta_[s]; }\n\n private:\n  const std::vector<Weight> &beta_;\n};\n\n// Given a vector that maps from states to weights representing the shortest\n// distance from the initial state, a comparison function object between\n// weights, and an estimate of the shortest distance to the final states, this\n// class defines a comparison function object between states.\ntemplate <typename S, typename Less, typename Estimate>\nclass AStarWeightCompare {\n public:\n  using StateId = S;\n  using Weight = typename Less::Weight;\n\n  AStarWeightCompare(const std::vector<Weight> &weights, const Less &less,\n                     const Estimate &estimate)\n      : weights_(weights), less_(less), estimate_(estimate) {}\n\n  bool operator()(StateId s1, StateId s2) const {\n    const auto w1 = Times(weights_[s1], estimate_(s1));\n    const auto w2 = Times(weights_[s2], estimate_(s2));\n    return less_(w1, w2);\n  }\n\n  const Estimate &GetEstimate() const { return estimate_; }\n\n private:\n  const std::vector<Weight> &weights_;\n  const Less &less_;\n  const Estimate &estimate_;\n};\n\n// A* queue discipline templated on StateId, Weight, and Estimate.\ntemplate <typename S, typename Weight, typename Estimate>\nclass NaturalAStarQueue : public ShortestFirstQueue<\n          S, AStarWeightCompare<S, NaturalLess<Weight>, Estimate>> {\n public:\n  using StateId = S;\n  using Compare = AStarWeightCompare<StateId, NaturalLess<Weight>, Estimate>;\n\n  NaturalAStarQueue(const std::vector<Weight> &distance,\n                    const Estimate &estimate)\n      : ShortestFirstQueue<StateId, Compare>(\n            Compare(distance, less_, estimate)) {}\n\n  ~NaturalAStarQueue() = default;\n\n private:\n  // This is non-static because the constructor for non-idempotent weights will\n  // result in an error.\n  const NaturalLess<Weight> less_{};\n};\n\n// A state equivalence class is a function object that maps from a state ID to\n// an equivalence class (state) ID. The trivial equivalence class maps a state\n// ID to itself.\ntemplate <typename StateId>\nstruct TrivialStateEquivClass {\n  StateId operator()(StateId s) const { return s; }\n};\n\n// Distance-based pruning queue discipline: Enqueues a state only when its\n// shortest distance (so far), as specified by distance, is less than (as\n// specified by comp) the shortest distance Times() the threshold to any state\n// in the same equivalence class, as specified by the functor class_func. The\n// underlying queue discipline is specified by queue. The ownership of queue is\n// given to this class.\n//\n// This is not a final class.\ntemplate <typename Queue, typename Less, typename ClassFnc>\nclass PruneQueue : public QueueBase<typename Queue::StateId> {\n public:\n  using StateId = typename Queue::StateId;\n  using Weight = typename Less::Weight;\n\n  PruneQueue(const std::vector<Weight> &distance, Queue *queue,\n             const Less &less, const ClassFnc &class_fnc, Weight threshold)\n      : QueueBase<StateId>(OTHER_QUEUE),\n        distance_(distance),\n        queue_(queue),\n        less_(less),\n        class_fnc_(class_fnc),\n        threshold_(std::move(threshold)) {}\n\n  virtual ~PruneQueue() = default;\n\n  StateId Head() const override { return queue_->Head(); }\n\n  void Enqueue(StateId s) override {\n    const auto c = class_fnc_(s);\n    if (c >= class_distance_.size()) {\n      class_distance_.resize(c + 1, Weight::Zero());\n    }\n    if (less_(distance_[s], class_distance_[c])) {\n      class_distance_[c] = distance_[s];\n    }\n    // Enqueues only if below threshold limit.\n    const auto limit = Times(class_distance_[c], threshold_);\n    if (less_(distance_[s], limit)) queue_->Enqueue(s);\n  }\n\n  void Dequeue() override { queue_->Dequeue(); }\n\n  void Update(StateId s) override {\n    const auto c = class_fnc_(s);\n    if (less_(distance_[s], class_distance_[c])) {\n      class_distance_[c] = distance_[s];\n    }\n    queue_->Update(s);\n  }\n\n  bool Empty() const override { return queue_->Empty(); }\n\n  void Clear() override { queue_->Clear(); }\n\n private:\n  const std::vector<Weight> &distance_;  // Shortest distance to state.\n  std::unique_ptr<Queue> queue_;\n  const Less &less_;                    // Borrowed reference.\n  const ClassFnc &class_fnc_;           // Equivalence class functor.\n  Weight threshold_;                    // Pruning weight threshold.\n  std::vector<Weight> class_distance_;  // Shortest distance to class.\n};\n\n// Pruning queue discipline (see above) using the weight's natural order for the\n// comparison function. The ownership of the queue argument is given to this\n// class.\ntemplate <typename Queue, typename Weight, typename ClassFnc>\nclass NaturalPruneQueue final\n    : public PruneQueue<Queue, NaturalLess<Weight>, ClassFnc> {\n public:\n  using StateId = typename Queue::StateId;\n\n  NaturalPruneQueue(const std::vector<Weight> &distance, Queue *queue,\n                    const ClassFnc &class_fnc, Weight threshold)\n      : PruneQueue<Queue, NaturalLess<Weight>, ClassFnc>(\n            distance, queue, NaturalLess<Weight>(), class_fnc, threshold) {}\n\n  virtual ~NaturalPruneQueue() = default;\n};\n\n// Filter-based pruning queue discipline: enqueues a state only if allowed by\n// the filter, specified by the state filter functor argument. The underlying\n// queue discipline is specified by the queue argument. The ownership of the\n// queue is given to this class.\ntemplate <typename Queue, typename Filter>\nclass FilterQueue : public QueueBase<typename Queue::StateId> {\n public:\n  using StateId = typename Queue::StateId;\n\n  FilterQueue(Queue *queue, const Filter &filter)\n      : QueueBase<StateId>(OTHER_QUEUE), queue_(queue), filter_(filter) {}\n\n  virtual ~FilterQueue() = default;\n\n  StateId Head() const final { return queue_->Head(); }\n\n  // Enqueues only if allowed by state filter.\n  void Enqueue(StateId s) final {\n    if (filter_(s)) queue_->Enqueue(s);\n  }\n\n  void Dequeue() final { queue_->Dequeue(); }\n\n  void Update(StateId s) final {}\n\n  bool Empty() const final { return queue_->Empty(); }\n\n  void Clear() final { queue_->Clear(); }\n\n private:\n  std::unique_ptr<Queue> queue_;\n  const Filter &filter_;\n};\n\n}  // namespace fst\n\n#endif  // FST_QUEUE_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/randequivalent.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Tests if two FSTS are equivalent by checking if random strings from one FST\n// are transduced the same by both FSTs.\n\n#ifndef FST_RANDEQUIVALENT_H_\n#define FST_RANDEQUIVALENT_H_\n\n#include <fst/log.h>\n\n#include <fst/arcsort.h>\n#include <fst/compose.h>\n#include <fst/project.h>\n#include <fst/randgen.h>\n#include <fst/shortest-distance.h>\n#include <fst/vector-fst.h>\n\n\nnamespace fst {\n\n// Test if two FSTs are stochastically equivalent by randomly generating\n// random paths through the FSTs.\n//\n// For each randomly generated path, the algorithm computes for each\n// of the two FSTs the sum of the weights of all the successful paths\n// sharing the same input and output labels as the considered randomly\n// generated path and checks that these two values are within a user-specified\n// delta. Returns optional error value (when FLAGS_error_fatal = false).\ntemplate <class Arc, class ArcSelector>\nbool RandEquivalent(const Fst<Arc> &fst1, const Fst<Arc> &fst2,\n                    int32_t num_paths, float delta,\n                    const RandGenOptions<ArcSelector> &opts,\n                    bool *error = nullptr) {\n  using Weight = typename Arc::Weight;\n  if (error) *error = false;\n  // Checks that the symbol table are compatible.\n  if (!CompatSymbols(fst1.InputSymbols(), fst2.InputSymbols()) ||\n      !CompatSymbols(fst1.OutputSymbols(), fst2.OutputSymbols())) {\n    FSTERROR() << \"RandEquivalent: Input/output symbol tables of 1st \"\n               << \"argument do not match input/output symbol tables of 2nd \"\n               << \"argument\";\n    if (error) *error = true;\n    return false;\n  }\n  static const ILabelCompare<Arc> icomp;\n  static const OLabelCompare<Arc> ocomp;\n  VectorFst<Arc> sfst1(fst1);\n  VectorFst<Arc> sfst2(fst2);\n  Connect(&sfst1);\n  Connect(&sfst2);\n  ArcSort(&sfst1, icomp);\n  ArcSort(&sfst2, icomp);\n  bool result = true;\n  for (int32_t n = 0; n < num_paths; ++n) {\n    VectorFst<Arc> path;\n    const auto &fst = rand() % 2 ? sfst1 : sfst2;  // NOLINT\n    RandGen(fst, &path, opts);\n    VectorFst<Arc> ipath(path);\n    VectorFst<Arc> opath(path);\n    Project(&ipath, PROJECT_INPUT);\n    Project(&opath, PROJECT_OUTPUT);\n    VectorFst<Arc> cfst1, pfst1;\n    Compose(ipath, sfst1, &cfst1);\n    ArcSort(&cfst1, ocomp);\n    Compose(cfst1, opath, &pfst1);\n    // Gives up if there are epsilon cycles in a non-idempotent semiring.\n    if (!(Weight::Properties() & kIdempotent) &&\n        pfst1.Properties(kCyclic, true)) {\n      continue;\n    }\n    const auto sum1 = ShortestDistance(pfst1);\n    VectorFst<Arc> cfst2;\n    Compose(ipath, sfst2, &cfst2);\n    ArcSort(&cfst2, ocomp);\n    VectorFst<Arc> pfst2;\n    Compose(cfst2, opath, &pfst2);\n    // Gives up if there are epsilon cycles in a non-idempotent semiring.\n    if (!(Weight::Properties() & kIdempotent) &&\n        pfst2.Properties(kCyclic, true)) {\n      continue;\n    }\n    const auto sum2 = ShortestDistance(pfst2);\n    if (!ApproxEqual(sum1, sum2, delta)) {\n      VLOG(1) << \"Sum1 = \" << sum1;\n      VLOG(1) << \"Sum2 = \" << sum2;\n      result = false;\n      break;\n    }\n  }\n  if (fst1.Properties(kError, false) || fst2.Properties(kError, false)) {\n    if (error) *error = true;\n    return false;\n  }\n  return result;\n}\n\n// Tests if two FSTs are equivalent by randomly generating a nnum_paths paths\n// (no longer than the path_length) using a user-specified seed, optionally\n// indicating an error setting an optional error argument to true.\ntemplate <class Arc>\nbool RandEquivalent(const Fst<Arc> &fst1, const Fst<Arc> &fst2, int32_t num_paths,\n                    float delta = kDelta, time_t seed = time(nullptr),\n                    int32_t max_length = std::numeric_limits<int32_t>::max(),\n                    bool *error = nullptr) {\n  const UniformArcSelector<Arc> uniform_selector(seed);\n  const RandGenOptions<UniformArcSelector<Arc>> opts(uniform_selector,\n                                                     max_length);\n  return RandEquivalent(fst1, fst2, num_paths, delta, opts, error);\n}\n\n}  // namespace fst\n\n#endif  // FST_RANDEQUIVALENT_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/randgen.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Classes and functions to generate random paths through an FST.\n\n#ifndef FST_RANDGEN_H_\n#define FST_RANDGEN_H_\n\n#include <math.h>\n#include <stddef.h>\n#include <limits>\n#include <map>\n#include <memory>\n#include <random>\n#include <utility>\n#include <vector>\n\n#include <fst/log.h>\n\n#include <fst/accumulator.h>\n#include <fst/cache.h>\n#include <fst/dfs-visit.h>\n#include <fst/float-weight.h>\n#include <fst/fst-decl.h>\n#include <fst/fst.h>\n#include <fst/mutable-fst.h>\n#include <fst/properties.h>\n#include <fst/util.h>\n#include <fst/weight.h>\n\nnamespace fst {\n\n// The RandGenFst class is roughly similar to ArcMapFst in that it takes two\n// template parameters denoting the input and output arc types. However, it also\n// takes an additional template parameter which specifies a sampler object which\n// samples (with replacement) arcs from an FST state. The sampler in turn takes\n// a template parameter for a selector object which actually chooses the arc.\n//\n// Arc selector functors are used to select a random transition given an FST\n// state s, returning a number N such that 0 <= N <= NumArcs(s). If N is\n// NumArcs(s), then the final weight is selected; otherwise the N-th arc is\n// selected. It is assumed these are not applied to any state which is neither\n// final nor has any arcs leaving it.\n\n// Randomly selects a transition using the uniform distribution. This class is\n// not thread-safe.\ntemplate <class Arc>\nclass UniformArcSelector {\n public:\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  // Constructs a selector with a non-deterministic seed.\n  UniformArcSelector() : rand_(std::random_device()()) {}\n  // Constructs a selector with a given seed.\n  explicit UniformArcSelector(uint64_t seed) : rand_(seed) {}\n\n  size_t operator()(const Fst<Arc> &fst, StateId s) const {\n    const auto n = fst.NumArcs(s) + (fst.Final(s) != Weight::Zero());\n    return static_cast<size_t>(\n        std::uniform_int_distribution<>(0, n - 1)(rand_));\n  }\n\n private:\n  mutable std::mt19937_64 rand_;\n};\n\n// Randomly selects a transition w.r.t. the weights treated as negative log\n// probabilities after normalizing for the total weight leaving the state. Zero\n// transitions are disregarded. It assumed that Arc::Weight::Value() accesses\n// the floating point representation of the weight. This class is not\n// thread-safe.\ntemplate <class Arc>\nclass LogProbArcSelector {\n public:\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  // Constructs a selector with a non-deterministic seed.\n  LogProbArcSelector() : rand_(std::random_device()()) {}\n  // Constructs a selector with a given seed.\n  explicit LogProbArcSelector(uint64_t seed) : rand_(seed) {}\n\n  size_t operator()(const Fst<Arc> &fst, StateId s) const {\n    // Finds total weight leaving state.\n    auto sum = Log64Weight::Zero();\n    ArcIterator<Fst<Arc>> aiter(fst, s);\n    for (; !aiter.Done(); aiter.Next()) {\n      const auto &arc = aiter.Value();\n      sum = Plus(sum, to_log_weight_(arc.weight));\n    }\n    sum = Plus(sum, to_log_weight_(fst.Final(s)));\n    const double threshold =\n        std::uniform_real_distribution<>(0, exp(-sum.Value()))(rand_);\n    auto p = Log64Weight::Zero();\n    size_t n = 0;\n    for (aiter.Reset(); !aiter.Done(); aiter.Next(), ++n) {\n      p = Plus(p, to_log_weight_(aiter.Value().weight));\n      if (exp(-p.Value()) > threshold) return n;\n    }\n    return n;\n  }\n\n private:\n  mutable std::mt19937_64 rand_;\n  WeightConvert<Weight, Log64Weight> to_log_weight_;\n};\n\n// Useful alias when using StdArc.\nusing StdArcSelector = LogProbArcSelector<StdArc>;\n\n// Same as LogProbArcSelector but use CacheLogAccumulator to cache the weight\n// accumulation computations. This class is not thread-safe.\ntemplate <class Arc>\nclass FastLogProbArcSelector : public LogProbArcSelector<Arc> {\n public:\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using LogProbArcSelector<Arc>::operator();\n\n  // Constructs a selector with a non-deterministic seed.\n  FastLogProbArcSelector() : seed_(std::random_device()()), rand_(seed_) {}\n  // Constructs a selector with a given seed.\n  explicit FastLogProbArcSelector(uint64_t seed) : seed_(seed), rand_(seed_) {}\n\n  size_t operator()(const Fst<Arc> &fst, StateId s,\n                    CacheLogAccumulator<Arc> *accumulator) const {\n    accumulator->SetState(s);\n    ArcIterator<Fst<Arc>> aiter(fst, s);\n    // Finds total weight leaving state.\n    const double sum = to_log_weight_(accumulator->Sum(fst.Final(s), &aiter, 0,\n                                                       fst.NumArcs(s)))\n                           .Value();\n    const double r = -log(std::uniform_real_distribution<>(0, 1)(rand_));\n    Weight w = from_log_weight_(r + sum);\n    aiter.Reset();\n    return accumulator->LowerBound(w, &aiter);\n  }\n\n  uint64_t Seed() const { return seed_; }\n\n private:\n  const uint64_t seed_;\n  mutable std::mt19937_64 rand_;\n  WeightConvert<Weight, Log64Weight> to_log_weight_;\n  WeightConvert<Log64Weight, Weight> from_log_weight_;\n};\n\n// Random path state info maintained by RandGenFst and passed to samplers.\ntemplate <typename Arc>\nstruct RandState {\n  using StateId = typename Arc::StateId;\n\n  StateId state_id;  // Current input FST state.\n  size_t nsamples;   // Number of samples to be sampled at this state.\n  size_t length;     // Length of path to this random state.\n  size_t select;     // Previous sample arc selection.\n  const RandState<Arc> *parent;  // Previous random state on this path.\n\n  explicit RandState(StateId state_id, size_t nsamples = 0, size_t length = 0,\n                     size_t select = 0, const RandState<Arc> *parent = nullptr)\n      : state_id(state_id),\n        nsamples(nsamples),\n        length(length),\n        select(select),\n        parent(parent) {}\n\n  RandState() : RandState(kNoStateId) {}\n};\n\n// This class, given an arc selector, samples, with replacement, multiple random\n// transitions from an FST's state. This is a generic version with a\n// straightforward use of the arc selector. Specializations may be defined for\n// arc selectors for greater efficiency or special behavior.\ntemplate <class Arc, class Selector>\nclass ArcSampler {\n public:\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  // The max_length argument may be interpreted (or ignored) by a selector as\n  // it chooses. This generic version interprets this literally.\n  ArcSampler(const Fst<Arc> &fst, const Selector &selector,\n             int32_t max_length = std::numeric_limits<int32_t>::max())\n      : fst_(fst), selector_(selector), max_length_(max_length) {}\n\n  // Allow updating FST argument; pass only if changed.\n  ArcSampler(const ArcSampler<Arc, Selector> &sampler,\n             const Fst<Arc> *fst = nullptr)\n      : fst_(fst ? *fst : sampler.fst_),\n        selector_(sampler.selector_),\n        max_length_(sampler.max_length_) {\n    Reset();\n  }\n\n  // Samples a fixed number of samples from the given state. The length argument\n  // specifies the length of the path to the state. Returns true if the samples\n  // were collected. No samples may be collected if either there are no\n  // transitions leaving the state and the state is non-final, or if the path\n  // length has been exceeded. Iterator members are provided to read the samples\n  // in the order in which they were collected.\n  bool Sample(const RandState<Arc> &rstate) {\n    sample_map_.clear();\n    if ((fst_.NumArcs(rstate.state_id) == 0 &&\n         fst_.Final(rstate.state_id) == Weight::Zero()) ||\n        rstate.length == max_length_) {\n      Reset();\n      return false;\n    }\n    for (size_t i = 0; i < rstate.nsamples; ++i) {\n      ++sample_map_[selector_(fst_, rstate.state_id)];\n    }\n    Reset();\n    return true;\n  }\n\n  // More samples?\n  bool Done() const { return sample_iter_ == sample_map_.end(); }\n\n  // Gets the next sample.\n  void Next() { ++sample_iter_; }\n\n  std::pair<size_t, size_t> Value() const { return *sample_iter_; }\n\n  void Reset() { sample_iter_ = sample_map_.begin(); }\n\n  bool Error() const { return false; }\n\n private:\n  const Fst<Arc> &fst_;\n  const Selector &selector_;\n  const int32_t max_length_;\n\n  // Stores (N, K) as described for Value().\n  std::map<size_t, size_t> sample_map_;\n  std::map<size_t, size_t>::const_iterator sample_iter_;\n\n  ArcSampler<Arc, Selector> &operator=(const ArcSampler &) = delete;\n};\n\n// Samples one sample of num_to_sample dimensions from a multinomial\n// distribution parameterized by a vector of probabilities. The result\n// container should be pre-initialized (e.g., an empty map or a zeroed vector\n// sized the same as the vector of probabilities.\n// probs.size()).\ntemplate <class Result, class RNG>\nvoid OneMultinomialSample(const std::vector<double> &probs,\n                          size_t num_to_sample, Result *result, RNG *rng) {\n  // Left-over probability mass.\n  double norm = 0;\n  for (double p : probs) norm += p;\n  // Left-over number of samples needed.\n  for (size_t i = 0; i < probs.size(); ++i) {\n    size_t num_sampled = 0;\n    if (probs[i] > 0) {\n      std::binomial_distribution<> d(num_to_sample, probs[i] / norm);\n      num_sampled = d(*rng);\n    }\n    if (num_sampled != 0) (*result)[i] = num_sampled;\n    norm -= probs[i];\n    num_to_sample -= num_sampled;\n  }\n}\n\n// Specialization for FastLogProbArcSelector.\ntemplate <class Arc>\nclass ArcSampler<Arc, FastLogProbArcSelector<Arc>> {\n public:\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using Accumulator = CacheLogAccumulator<Arc>;\n  using Selector = FastLogProbArcSelector<Arc>;\n\n  ArcSampler(const Fst<Arc> &fst, const Selector &selector,\n             int32_t max_length = std::numeric_limits<int32_t>::max())\n      : fst_(fst),\n        selector_(selector),\n        max_length_(max_length),\n        accumulator_(new Accumulator()) {\n    accumulator_->Init(fst);\n    rng_.seed(selector_.Seed());\n  }\n\n  ArcSampler(const ArcSampler<Arc, Selector> &sampler,\n             const Fst<Arc> *fst = nullptr)\n      : fst_(fst ? *fst : sampler.fst_),\n        selector_(sampler.selector_),\n        max_length_(sampler.max_length_) {\n    if (fst) {\n      accumulator_.reset(new Accumulator());\n      accumulator_->Init(*fst);\n    } else {  // Shallow copy.\n      accumulator_.reset(new Accumulator(*sampler.accumulator_));\n    }\n  }\n\n  bool Sample(const RandState<Arc> &rstate) {\n    sample_map_.clear();\n    if ((fst_.NumArcs(rstate.state_id) == 0 &&\n         fst_.Final(rstate.state_id) == Weight::Zero()) ||\n        rstate.length == max_length_) {\n      Reset();\n      return false;\n    }\n    if (fst_.NumArcs(rstate.state_id) + 1 < rstate.nsamples) {\n      MultinomialSample(rstate);\n      Reset();\n      return true;\n    }\n    for (size_t i = 0; i < rstate.nsamples; ++i) {\n      ++sample_map_[selector_(fst_, rstate.state_id, accumulator_.get())];\n    }\n    Reset();\n    return true;\n  }\n\n  bool Done() const { return sample_iter_ == sample_map_.end(); }\n\n  void Next() { ++sample_iter_; }\n\n  std::pair<size_t, size_t> Value() const { return *sample_iter_; }\n\n  void Reset() { sample_iter_ = sample_map_.begin(); }\n\n  bool Error() const { return accumulator_->Error(); }\n\n private:\n  using RNG = std::mt19937;\n\n  // Sample according to the multinomial distribution of rstate.nsamples draws\n  // from p_.\n  void MultinomialSample(const RandState<Arc> &rstate) {\n    p_.clear();\n    for (ArcIterator<Fst<Arc>> aiter(fst_, rstate.state_id); !aiter.Done();\n         aiter.Next()) {\n      p_.push_back(exp(-to_log_weight_(aiter.Value().weight).Value()));\n    }\n    if (fst_.Final(rstate.state_id) != Weight::Zero()) {\n      p_.push_back(exp(-to_log_weight_(fst_.Final(rstate.state_id)).Value()));\n    }\n    if (rstate.nsamples < std::numeric_limits<RNG::result_type>::max()) {\n      OneMultinomialSample(p_, rstate.nsamples, &sample_map_, &rng_);\n    } else {\n      for (size_t i = 0; i < p_.size(); ++i) {\n        sample_map_[i] = ceil(p_[i] * rstate.nsamples);\n      }\n    }\n  }\n\n  const Fst<Arc> &fst_;\n  const Selector &selector_;\n  const int32_t max_length_;\n\n  // Stores (N, K) for Value().\n  std::map<size_t, size_t> sample_map_;\n  std::map<size_t, size_t>::const_iterator sample_iter_;\n\n  std::unique_ptr<Accumulator> accumulator_;\n  RNG rng_;                // Random number generator.\n  std::vector<double> p_;  // Multinomial parameters.\n  WeightConvert<Weight, Log64Weight> to_log_weight_;\n};\n\n// Options for random path generation with RandGenFst. The template argument is\n// a sampler, typically the class ArcSampler. Ownership of the sampler is taken\n// by RandGenFst.\ntemplate <class Sampler>\nstruct RandGenFstOptions : public CacheOptions {\n  Sampler *sampler;          // How to sample transitions at a state.\n  int32_t npath;               // Number of paths to generate.\n  bool weighted;             // Is the output tree weighted by path count, or\n                             // is it just an unweighted DAG?\n  bool remove_total_weight;  // Remove total weight when output is weighted.\n\n  RandGenFstOptions(const CacheOptions &opts, Sampler *sampler, int32_t npath = 1,\n                    bool weighted = true, bool remove_total_weight = false)\n      : CacheOptions(opts),\n        sampler(sampler),\n        npath(npath),\n        weighted(weighted),\n        remove_total_weight(remove_total_weight) {}\n};\n\nnamespace internal {\n\n// Implementation of RandGenFst.\ntemplate <class FromArc, class ToArc, class Sampler>\nclass RandGenFstImpl : public CacheImpl<ToArc> {\n public:\n  using FstImpl<ToArc>::SetType;\n  using FstImpl<ToArc>::SetProperties;\n  using FstImpl<ToArc>::SetInputSymbols;\n  using FstImpl<ToArc>::SetOutputSymbols;\n\n  using CacheBaseImpl<CacheState<ToArc>>::PushArc;\n  using CacheBaseImpl<CacheState<ToArc>>::HasArcs;\n  using CacheBaseImpl<CacheState<ToArc>>::HasFinal;\n  using CacheBaseImpl<CacheState<ToArc>>::HasStart;\n  using CacheBaseImpl<CacheState<ToArc>>::SetArcs;\n  using CacheBaseImpl<CacheState<ToArc>>::SetFinal;\n  using CacheBaseImpl<CacheState<ToArc>>::SetStart;\n\n  using Label = typename FromArc::Label;\n  using StateId = typename FromArc::StateId;\n  using FromWeight = typename FromArc::Weight;\n\n  using ToWeight = typename ToArc::Weight;\n\n  RandGenFstImpl(const Fst<FromArc> &fst,\n                 const RandGenFstOptions<Sampler> &opts)\n      : CacheImpl<ToArc>(opts),\n        fst_(fst.Copy()),\n        sampler_(opts.sampler),\n        npath_(opts.npath),\n        weighted_(opts.weighted),\n        remove_total_weight_(opts.remove_total_weight),\n        superfinal_(kNoLabel) {\n    SetType(\"randgen\");\n    SetProperties(\n        RandGenProperties(fst.Properties(kFstProperties, false), weighted_),\n        kCopyProperties);\n    SetInputSymbols(fst.InputSymbols());\n    SetOutputSymbols(fst.OutputSymbols());\n  }\n\n  RandGenFstImpl(const RandGenFstImpl &impl)\n      : CacheImpl<ToArc>(impl),\n        fst_(impl.fst_->Copy(true)),\n        sampler_(new Sampler(*impl.sampler_, fst_.get())),\n        npath_(impl.npath_),\n        weighted_(impl.weighted_),\n        superfinal_(kNoLabel) {\n    SetType(\"randgen\");\n    SetProperties(impl.Properties(), kCopyProperties);\n    SetInputSymbols(impl.InputSymbols());\n    SetOutputSymbols(impl.OutputSymbols());\n  }\n\n  StateId Start() {\n    if (!HasStart()) {\n      const auto s = fst_->Start();\n      if (s == kNoStateId) return kNoStateId;\n      SetStart(state_table_.size());\n      state_table_.emplace_back(\n          new RandState<FromArc>(s, npath_, 0, 0, nullptr));\n    }\n    return CacheImpl<ToArc>::Start();\n  }\n\n  ToWeight Final(StateId s) {\n    if (!HasFinal(s)) Expand(s);\n    return CacheImpl<ToArc>::Final(s);\n  }\n\n  size_t NumArcs(StateId s) {\n    if (!HasArcs(s)) Expand(s);\n    return CacheImpl<ToArc>::NumArcs(s);\n  }\n\n  size_t NumInputEpsilons(StateId s) {\n    if (!HasArcs(s)) Expand(s);\n    return CacheImpl<ToArc>::NumInputEpsilons(s);\n  }\n\n  size_t NumOutputEpsilons(StateId s) {\n    if (!HasArcs(s)) Expand(s);\n    return CacheImpl<ToArc>::NumOutputEpsilons(s);\n  }\n\n  uint64_t Properties() const override { return Properties(kFstProperties); }\n\n  // Sets error if found, and returns other FST impl properties.\n  uint64_t Properties(uint64_t mask) const override {\n    if ((mask & kError) &&\n        (fst_->Properties(kError, false) || sampler_->Error())) {\n      SetProperties(kError, kError);\n    }\n    return FstImpl<ToArc>::Properties(mask);\n  }\n\n  void InitArcIterator(StateId s, ArcIteratorData<ToArc> *data) {\n    if (!HasArcs(s)) Expand(s);\n    CacheImpl<ToArc>::InitArcIterator(s, data);\n  }\n\n  // Computes the outgoing transitions from a state, creating new destination\n  // states as needed.\n  void Expand(StateId s) {\n    if (s == superfinal_) {\n      SetFinal(s, ToWeight::One());\n      SetArcs(s);\n      return;\n    }\n    SetFinal(s, ToWeight::Zero());\n    const auto &rstate = *state_table_[s];\n    sampler_->Sample(rstate);\n    ArcIterator<Fst<FromArc>> aiter(*fst_, rstate.state_id);\n    const auto narcs = fst_->NumArcs(rstate.state_id);\n    for (; !sampler_->Done(); sampler_->Next()) {\n      const auto &sample_pair = sampler_->Value();\n      const auto pos = sample_pair.first;\n      const auto count = sample_pair.second;\n      double prob = static_cast<double>(count) / rstate.nsamples;\n      if (pos < narcs) {  // Regular transition.\n        aiter.Seek(sample_pair.first);\n        const auto &aarc = aiter.Value();\n        const auto weight =\n            weighted_ ? to_weight_(Log64Weight(-log(prob))) : ToWeight::One();\n        const ToArc barc(aarc.ilabel, aarc.olabel, weight, state_table_.size());\n        PushArc(s, barc);\n        auto *nrstate = new RandState<FromArc>(aarc.nextstate, count,\n                                               rstate.length + 1, pos, &rstate);\n        state_table_.emplace_back(nrstate);\n      } else {  // Super-final transition.\n        if (weighted_) {\n          const auto weight =\n              remove_total_weight_\n                  ? to_weight_(Log64Weight(-log(prob)))\n                  : to_weight_(Log64Weight(-log(prob * npath_)));\n          SetFinal(s, weight);\n        } else {\n          if (superfinal_ == kNoLabel) {\n            superfinal_ = state_table_.size();\n            state_table_.emplace_back(\n                new RandState<FromArc>(kNoStateId, 0, 0, 0, nullptr));\n          }\n          for (size_t n = 0; n < count; ++n) {\n            const ToArc barc(0, 0, ToWeight::One(), superfinal_);\n            PushArc(s, barc);\n          }\n        }\n      }\n    }\n    SetArcs(s);\n  }\n\n private:\n  const std::unique_ptr<Fst<FromArc>> fst_;\n  std::unique_ptr<Sampler> sampler_;\n  const int32_t npath_;\n  std::vector<std::unique_ptr<RandState<FromArc>>> state_table_;\n  const bool weighted_;\n  bool remove_total_weight_;\n  StateId superfinal_;\n  WeightConvert<Log64Weight, ToWeight> to_weight_;\n};\n\n}  // namespace internal\n\n// FST class to randomly generate paths through an FST, with details controlled\n// by RandGenOptionsFst. Output format is a tree weighted by the path count.\ntemplate <class FromArc, class ToArc, class Sampler>\nclass RandGenFst\n    : public ImplToFst<internal::RandGenFstImpl<FromArc, ToArc, Sampler>> {\n public:\n  using Label = typename FromArc::Label;\n  using StateId = typename FromArc::StateId;\n  using Weight = typename FromArc::Weight;\n\n  using Store = DefaultCacheStore<FromArc>;\n  using State = typename Store::State;\n\n  using Impl = internal::RandGenFstImpl<FromArc, ToArc, Sampler>;\n\n  friend class ArcIterator<RandGenFst<FromArc, ToArc, Sampler>>;\n  friend class StateIterator<RandGenFst<FromArc, ToArc, Sampler>>;\n\n  RandGenFst(const Fst<FromArc> &fst, const RandGenFstOptions<Sampler> &opts)\n      : ImplToFst<Impl>(std::make_shared<Impl>(fst, opts)) {}\n\n  // See Fst<>::Copy() for doc.\n  RandGenFst(const RandGenFst<FromArc, ToArc, Sampler> &fst, bool safe = false)\n      : ImplToFst<Impl>(fst, safe) {}\n\n  // Get a copy of this RandGenFst. See Fst<>::Copy() for further doc.\n  RandGenFst<FromArc, ToArc, Sampler> *Copy(bool safe = false) const override {\n    return new RandGenFst<FromArc, ToArc, Sampler>(*this, safe);\n  }\n\n  inline void InitStateIterator(StateIteratorData<ToArc> *data) const override;\n\n  void InitArcIterator(StateId s, ArcIteratorData<ToArc> *data) const override {\n    GetMutableImpl()->InitArcIterator(s, data);\n  }\n\n private:\n  using ImplToFst<Impl>::GetImpl;\n  using ImplToFst<Impl>::GetMutableImpl;\n\n  RandGenFst &operator=(const RandGenFst &) = delete;\n};\n\n// Specialization for RandGenFst.\ntemplate <class FromArc, class ToArc, class Sampler>\nclass StateIterator<RandGenFst<FromArc, ToArc, Sampler>>\n    : public CacheStateIterator<RandGenFst<FromArc, ToArc, Sampler>> {\n public:\n  explicit StateIterator(const RandGenFst<FromArc, ToArc, Sampler> &fst)\n      : CacheStateIterator<RandGenFst<FromArc, ToArc, Sampler>>(\n            fst, fst.GetMutableImpl()) {}\n};\n\n// Specialization for RandGenFst.\ntemplate <class FromArc, class ToArc, class Sampler>\nclass ArcIterator<RandGenFst<FromArc, ToArc, Sampler>>\n    : public CacheArcIterator<RandGenFst<FromArc, ToArc, Sampler>> {\n public:\n  using StateId = typename FromArc::StateId;\n\n  ArcIterator(const RandGenFst<FromArc, ToArc, Sampler> &fst, StateId s)\n      : CacheArcIterator<RandGenFst<FromArc, ToArc, Sampler>>(\n            fst.GetMutableImpl(), s) {\n    if (!fst.GetImpl()->HasArcs(s)) fst.GetMutableImpl()->Expand(s);\n  }\n};\n\ntemplate <class FromArc, class ToArc, class Sampler>\ninline void RandGenFst<FromArc, ToArc, Sampler>::InitStateIterator(\n    StateIteratorData<ToArc> *data) const {\n  data->base = new StateIterator<RandGenFst<FromArc, ToArc, Sampler>>(*this);\n}\n\n// Options for random path generation.\ntemplate <class Selector>\nstruct RandGenOptions {\n  const Selector &selector;  // How an arc is selected at a state.\n  int32_t max_length;          // Maximum path length.\n  int32_t npath;               // Number of paths to generate.\n  bool weighted;             // Is the output tree weighted by path count, or\n                             // is it just an unweighted DAG?\n  bool remove_total_weight;  // Remove total weight when output is weighted?\n\n  explicit RandGenOptions(const Selector &selector,\n                          int32_t max_length = std::numeric_limits<int32_t>::max(),\n                          int32_t npath = 1, bool weighted = false,\n                          bool remove_total_weight = false)\n      : selector(selector),\n        max_length(max_length),\n        npath(npath),\n        weighted(weighted),\n        remove_total_weight(remove_total_weight) {}\n};\n\nnamespace internal {\n\ntemplate <class FromArc, class ToArc>\nclass RandGenVisitor {\n public:\n  using StateId = typename FromArc::StateId;\n  using Weight = typename FromArc::Weight;\n\n  explicit RandGenVisitor(MutableFst<ToArc> *ofst) : ofst_(ofst) {}\n\n  void InitVisit(const Fst<FromArc> &ifst) {\n    ifst_ = &ifst;\n    ofst_->DeleteStates();\n    ofst_->SetInputSymbols(ifst.InputSymbols());\n    ofst_->SetOutputSymbols(ifst.OutputSymbols());\n    if (ifst.Properties(kError, false)) ofst_->SetProperties(kError, kError);\n    path_.clear();\n  }\n\n  constexpr bool InitState(StateId, StateId) const { return true; }\n\n  bool TreeArc(StateId, const ToArc &arc) {\n    if (ifst_->Final(arc.nextstate) == Weight::Zero()) {\n      path_.push_back(arc);\n    } else {\n      OutputPath();\n    }\n    return true;\n  }\n\n  bool BackArc(StateId, const FromArc &) {\n    FSTERROR() << \"RandGenVisitor: cyclic input\";\n    ofst_->SetProperties(kError, kError);\n    return false;\n  }\n\n  bool ForwardOrCrossArc(StateId, const FromArc &) {\n    OutputPath();\n    return true;\n  }\n\n  void FinishState(StateId s, StateId p, const FromArc *) {\n    if (p != kNoStateId && ifst_->Final(s) == Weight::Zero()) path_.pop_back();\n  }\n\n  void FinishVisit() {}\n\n private:\n  void OutputPath() {\n    if (ofst_->Start() == kNoStateId) {\n      const auto start = ofst_->AddState();\n      ofst_->SetStart(start);\n    }\n    auto src = ofst_->Start();\n    for (size_t i = 0; i < path_.size(); ++i) {\n      const auto dest = ofst_->AddState();\n      const ToArc arc(path_[i].ilabel, path_[i].olabel, Weight::One(), dest);\n      ofst_->AddArc(src, arc);\n      src = dest;\n    }\n    ofst_->SetFinal(src, Weight::One());\n  }\n\n  const Fst<FromArc> *ifst_;\n  MutableFst<ToArc> *ofst_;\n  std::vector<ToArc> path_;\n\n  RandGenVisitor(const RandGenVisitor &) = delete;\n  RandGenVisitor &operator=(const RandGenVisitor &) = delete;\n};\n\n}  // namespace internal\n\n// Randomly generate paths through an FST; details controlled by\n// RandGenOptions.\ntemplate <class FromArc, class ToArc, class Selector>\nvoid RandGen(const Fst<FromArc> &ifst, MutableFst<ToArc> *ofst,\n             const RandGenOptions<Selector> &opts) {\n  using State = typename ToArc::StateId;\n  using Weight = typename ToArc::Weight;\n  using Sampler = ArcSampler<FromArc, Selector>;\n  auto *sampler = new Sampler(ifst, opts.selector, opts.max_length);\n  RandGenFstOptions<Sampler> fopts(CacheOptions(true, 0), sampler, opts.npath,\n                                   opts.weighted, opts.remove_total_weight);\n  RandGenFst<FromArc, ToArc, Sampler> rfst(ifst, fopts);\n  if (opts.weighted) {\n    *ofst = rfst;\n  } else {\n    internal::RandGenVisitor<FromArc, ToArc> rand_visitor(ofst);\n    DfsVisit(rfst, &rand_visitor);\n  }\n}\n\n// Randomly generate a path through an FST with the uniform distribution\n// over the transitions.\ntemplate <class FromArc, class ToArc>\nvoid RandGen(const Fst<FromArc> &ifst, MutableFst<ToArc> *ofst) {\n  const UniformArcSelector<FromArc> uniform_selector;\n  RandGenOptions<UniformArcSelector<ToArc>> opts(uniform_selector);\n  RandGen(ifst, ofst, opts);\n}\n\n}  // namespace fst\n\n#endif  // FST_RANDGEN_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/rational.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// An FST implementation and base interface for delayed unions, concatenations,\n// and closures.\n\n#ifndef FST_RATIONAL_H_\n#define FST_RATIONAL_H_\n\n#include <algorithm>\n#include <string>\n#include <vector>\n\n#include <fst/mutable-fst.h>\n#include <fst/replace.h>\n#include <fst/test-properties.h>\n\n\nnamespace fst {\n\nusing RationalFstOptions = CacheOptions;\n\n// This specifies whether to add the empty string.\nenum ClosureType {\n  CLOSURE_STAR = 0,  // Add the empty string.\n  CLOSURE_PLUS = 1   // Don't add the empty string.\n};\n\ntemplate <class Arc>\nclass RationalFst;\n\ntemplate <class Arc>\nvoid Union(RationalFst<Arc> *fst1, const Fst<Arc> &fst2);\n\ntemplate <class Arc>\nvoid Concat(RationalFst<Arc> *fst1, const Fst<Arc> &fst2);\n\ntemplate <class Arc>\nvoid Concat(const Fst<Arc> &fst1, RationalFst<Arc> *fst2);\n\ntemplate <class Arc>\nvoid Closure(RationalFst<Arc> *fst, ClosureType closure_type);\n\nnamespace internal {\n\n// Implementation class for delayed unions, concatenations and closures.\ntemplate <class A>\nclass RationalFstImpl : public FstImpl<A> {\n public:\n  using Arc = A;\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using FstImpl<Arc>::SetType;\n  using FstImpl<Arc>::SetProperties;\n  using FstImpl<Arc>::WriteHeader;\n  using FstImpl<Arc>::SetInputSymbols;\n  using FstImpl<Arc>::SetOutputSymbols;\n\n  explicit RationalFstImpl(const RationalFstOptions &opts)\n      : nonterminals_(0), replace_options_(opts, 0) {\n    SetType(\"rational\");\n    fst_tuples_.push_back(std::make_pair(0, nullptr));\n  }\n\n  RationalFstImpl(const RationalFstImpl<Arc> &impl)\n      : rfst_(impl.rfst_),\n        nonterminals_(impl.nonterminals_),\n        replace_(impl.replace_ ? impl.replace_->Copy(true) : nullptr),\n        replace_options_(impl.replace_options_) {\n    SetType(\"rational\");\n    fst_tuples_.reserve(impl.fst_tuples_.size());\n    for (const auto &pair : impl.fst_tuples_) {\n      fst_tuples_.emplace_back(pair.first,\n                               pair.second ? pair.second->Copy(true) : nullptr);\n    }\n  }\n\n  ~RationalFstImpl() override {\n    for (auto &tuple : fst_tuples_) delete tuple.second;\n  }\n\n  StateId Start() { return Replace()->Start(); }\n\n  Weight Final(StateId s) { return Replace()->Final(s); }\n\n  size_t NumArcs(StateId s) { return Replace()->NumArcs(s); }\n\n  size_t NumInputEpsilons(StateId s) { return Replace()->NumInputEpsilons(s); }\n\n  size_t NumOutputEpsilons(StateId s) {\n    return Replace()->NumOutputEpsilons(s);\n  }\n\n  uint64_t Properties() const override { return Properties(kFstProperties); }\n\n  // Sets error if found, and returns other FST impl properties.\n  uint64_t Properties(uint64_t mask) const override {\n    if ((mask & kError) && Replace()->Properties(kError, false)) {\n      SetProperties(kError, kError);\n    }\n    return FstImpl<Arc>::Properties(mask);\n  }\n\n  // Implementation of UnionFst(fst1, fst2).\n  void InitUnion(const Fst<Arc> &fst1, const Fst<Arc> &fst2) {\n    replace_.reset();\n    const auto props1 = fst1.Properties(kFstProperties, false);\n    const auto props2 = fst2.Properties(kFstProperties, false);\n    SetInputSymbols(fst1.InputSymbols());\n    SetOutputSymbols(fst1.OutputSymbols());\n    rfst_.AddState();\n    rfst_.AddState();\n    rfst_.SetStart(0);\n    rfst_.SetFinal(1, Weight::One());\n    rfst_.SetInputSymbols(fst1.InputSymbols());\n    rfst_.SetOutputSymbols(fst1.OutputSymbols());\n    nonterminals_ = 2;\n    rfst_.AddArc(0, Arc(0, -1, Weight::One(), 1));\n    rfst_.AddArc(0, Arc(0, -2, Weight::One(), 1));\n    fst_tuples_.push_back(std::make_pair(-1, fst1.Copy()));\n    fst_tuples_.push_back(std::make_pair(-2, fst2.Copy()));\n    SetProperties(UnionProperties(props1, props2, true), kCopyProperties);\n  }\n\n  // Implementation of ConcatFst(fst1, fst2).\n  void InitConcat(const Fst<Arc> &fst1, const Fst<Arc> &fst2) {\n    replace_.reset();\n    const auto props1 = fst1.Properties(kFstProperties, false);\n    const auto props2 = fst2.Properties(kFstProperties, false);\n    SetInputSymbols(fst1.InputSymbols());\n    SetOutputSymbols(fst1.OutputSymbols());\n    rfst_.AddState();\n    rfst_.AddState();\n    rfst_.AddState();\n    rfst_.SetStart(0);\n    rfst_.SetFinal(2, Weight::One());\n    rfst_.SetInputSymbols(fst1.InputSymbols());\n    rfst_.SetOutputSymbols(fst1.OutputSymbols());\n    nonterminals_ = 2;\n    rfst_.AddArc(0, Arc(0, -1, Weight::One(), 1));\n    rfst_.AddArc(1, Arc(0, -2, Weight::One(), 2));\n    fst_tuples_.push_back(std::make_pair(-1, fst1.Copy()));\n    fst_tuples_.push_back(std::make_pair(-2, fst2.Copy()));\n    SetProperties(ConcatProperties(props1, props2, true), kCopyProperties);\n  }\n\n  // Implementation of ClosureFst(fst, closure_type).\n  void InitClosure(const Fst<Arc> &fst, ClosureType closure_type) {\n    replace_.reset();\n    const auto props = fst.Properties(kFstProperties, false);\n    SetInputSymbols(fst.InputSymbols());\n    SetOutputSymbols(fst.OutputSymbols());\n    if (closure_type == CLOSURE_STAR) {\n      rfst_.AddState();\n      rfst_.SetStart(0);\n      rfst_.SetFinal(0, Weight::One());\n      rfst_.AddArc(0, Arc(0, -1, Weight::One(), 0));\n    } else {\n      rfst_.AddState();\n      rfst_.AddState();\n      rfst_.SetStart(0);\n      rfst_.SetFinal(1, Weight::One());\n      rfst_.AddArc(0, Arc(0, -1, Weight::One(), 1));\n      rfst_.AddArc(1, Arc(0, 0, Weight::One(), 0));\n    }\n    rfst_.SetInputSymbols(fst.InputSymbols());\n    rfst_.SetOutputSymbols(fst.OutputSymbols());\n    fst_tuples_.push_back(std::make_pair(-1, fst.Copy()));\n    nonterminals_ = 1;\n    SetProperties(ClosureProperties(props, closure_type == CLOSURE_STAR, true),\n                  kCopyProperties);\n  }\n\n  // Implementation of Union(Fst &, RationalFst *).\n  void AddUnion(const Fst<Arc> &fst) {\n    replace_.reset();\n    const auto props1 = FstImpl<A>::Properties();\n    const auto props2 = fst.Properties(kFstProperties, false);\n    VectorFst<Arc> afst;\n    afst.AddState();\n    afst.AddState();\n    afst.SetStart(0);\n    afst.SetFinal(1, Weight::One());\n    ++nonterminals_;\n    afst.AddArc(0, Arc(0, -nonterminals_, Weight::One(), 1));\n    Union(&rfst_, afst);\n    fst_tuples_.push_back(std::make_pair(-nonterminals_, fst.Copy()));\n    SetProperties(UnionProperties(props1, props2, true), kCopyProperties);\n  }\n\n  // Implementation of Concat(Fst &, RationalFst *).\n  void AddConcat(const Fst<Arc> &fst, bool append) {\n    replace_.reset();\n    const auto props1 = FstImpl<A>::Properties();\n    const auto props2 = fst.Properties(kFstProperties, false);\n    VectorFst<Arc> afst;\n    afst.AddState();\n    afst.AddState();\n    afst.SetStart(0);\n    afst.SetFinal(1, Weight::One());\n    ++nonterminals_;\n    afst.AddArc(0, Arc(0, -nonterminals_, Weight::One(), 1));\n    if (append) {\n      Concat(&rfst_, afst);\n    } else {\n      Concat(afst, &rfst_);\n    }\n    fst_tuples_.push_back(std::make_pair(-nonterminals_, fst.Copy()));\n    SetProperties(ConcatProperties(props1, props2, true), kCopyProperties);\n  }\n\n  // Implementation of Closure(RationalFst *, closure_type).\n  void AddClosure(ClosureType closure_type) {\n    replace_.reset();\n    const auto props = FstImpl<A>::Properties();\n    Closure(&rfst_, closure_type);\n    SetProperties(ClosureProperties(props, closure_type == CLOSURE_STAR, true),\n                  kCopyProperties);\n  }\n\n  // Returns the underlying ReplaceFst, preserving ownership of the underlying\n  // object.\n  ReplaceFst<Arc> *Replace() const {\n    if (!replace_) {\n      fst_tuples_[0].second = rfst_.Copy();\n      replace_.reset(new ReplaceFst<Arc>(fst_tuples_, replace_options_));\n    }\n    return replace_.get();\n  }\n\n private:\n  // Rational topology machine, using negative non-terminals.\n  VectorFst<Arc> rfst_;\n  // Number of nonterminals used.\n  Label nonterminals_;\n  // Contains the nonterminals and their corresponding FSTs.\n  mutable std::vector<std::pair<Label, const Fst<Arc> *>> fst_tuples_;\n  // Underlying ReplaceFst.\n  mutable std::unique_ptr<ReplaceFst<Arc>> replace_;\n  const ReplaceFstOptions<Arc> replace_options_;\n};\n\n}  // namespace internal\n\n// Parent class for the delayed rational operations (union, concatenation, and\n// closure). This class attaches interface to implementation and handles\n// reference counting, delegating most methods to ImplToFst.\ntemplate <class A>\nclass RationalFst : public ImplToFst<internal::RationalFstImpl<A>> {\n public:\n  using Arc = A;\n  using StateId = typename Arc::StateId;\n\n  using Impl = internal::RationalFstImpl<Arc>;\n\n  friend class StateIterator<RationalFst<Arc>>;\n  friend class ArcIterator<RationalFst<Arc>>;\n  friend void Union<>(RationalFst<Arc> *fst1, const Fst<Arc> &fst2);\n  friend void Concat<>(RationalFst<Arc> *fst1, const Fst<Arc> &fst2);\n  friend void Concat<>(const Fst<Arc> &fst1, RationalFst<Arc> *fst2);\n  friend void Closure<>(RationalFst<Arc> *fst, ClosureType closure_type);\n\n  void InitStateIterator(StateIteratorData<Arc> *data) const override {\n    GetImpl()->Replace()->InitStateIterator(data);\n  }\n\n  void InitArcIterator(StateId s, ArcIteratorData<Arc> *data) const override {\n    GetImpl()->Replace()->InitArcIterator(s, data);\n  }\n\n protected:\n  using ImplToFst<Impl>::GetImpl;\n\n  explicit RationalFst(const RationalFstOptions &opts = RationalFstOptions())\n      : ImplToFst<Impl>(std::make_shared<Impl>(opts)) {}\n\n  // See Fst<>::Copy() for doc.\n  RationalFst(const RationalFst<Arc> &fst, bool safe = false)\n      : ImplToFst<Impl>(fst, safe) {}\n\n private:\n  RationalFst &operator=(const RationalFst &) = delete;\n};\n\n// Specialization for RationalFst.\ntemplate <class Arc>\nclass StateIterator<RationalFst<Arc>> : public StateIterator<ReplaceFst<Arc>> {\n public:\n  explicit StateIterator(const RationalFst<Arc> &fst)\n      : StateIterator<ReplaceFst<Arc>>(*(fst.GetImpl()->Replace())) {}\n};\n\n// Specialization for RationalFst.\ntemplate <class Arc>\nclass ArcIterator<RationalFst<Arc>> : public CacheArcIterator<ReplaceFst<Arc>> {\n public:\n  using StateId = typename Arc::StateId;\n\n  ArcIterator(const RationalFst<Arc> &fst, StateId s)\n      : ArcIterator<ReplaceFst<Arc>>(*(fst.GetImpl()->Replace()), s) {}\n};\n\n}  // namespace fst\n\n#endif  // FST_RATIONAL_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/register.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Classes for registering derived FST for generic reading.\n\n#ifndef FST_REGISTER_H_\n#define FST_REGISTER_H_\n\n#include <string>\n#include <type_traits>\n\n\n#include <fst/compat.h>\n#include <fst/generic-register.h>\n#include <fst/util.h>\n\n\n#include <fst/types.h>\n#include <fst/log.h>\n\nnamespace fst {\n\ntemplate <class Arc>\nclass Fst;\n\nstruct FstReadOptions;\n\n// This class represents a single entry in a FstRegister\ntemplate <class Arc>\nstruct FstRegisterEntry {\n  using Reader = Fst<Arc> *(*)(std::istream &istrm, const FstReadOptions &opts);\n  using Converter = Fst<Arc> *(*)(const Fst<Arc> &fst);\n\n  Reader reader;\n  Converter converter;\n\n  explicit FstRegisterEntry(Reader reader = nullptr,\n                            Converter converter = nullptr)\n      : reader(reader), converter(converter) {}\n};\n\n// This class maintains the correspondence between a string describing\n// an FST type, and its reader and converter.\ntemplate <class Arc>\nclass FstRegister\n    : public GenericRegister<string, FstRegisterEntry<Arc>, FstRegister<Arc>> {\n public:\n  using Reader = typename FstRegisterEntry<Arc>::Reader;\n  using Converter = typename FstRegisterEntry<Arc>::Converter;\n\n  const Reader GetReader(const string &type) const {\n    return this->GetEntry(type).reader;\n  }\n\n  const Converter GetConverter(const string &type) const {\n    return this->GetEntry(type).converter;\n  }\n\n protected:\n  string ConvertKeyToSoFilename(const string &key) const override {\n    string legal_type(key);\n    ConvertToLegalCSymbol(&legal_type);\n    return legal_type + \"-fst.so\";\n  }\n};\n\n// This class registers an FST type for generic reading and creating.\n// The type must have a default constructor and a copy constructor from\n// Fst<Arc>.\ntemplate <class FST>\nclass FstRegisterer : public GenericRegisterer<FstRegister<typename FST::Arc>> {\n public:\n  using Arc = typename FST::Arc;\n  using Entry = typename FstRegister<Arc>::Entry;\n  using Reader = typename FstRegister<Arc>::Reader;\n\n  FstRegisterer()\n      : GenericRegisterer<FstRegister<typename FST::Arc>>(FST().Type(),\n                                                          BuildEntry()) {}\n\n private:\n  static Fst<Arc> *ReadGeneric(\n      std::istream &strm, const FstReadOptions &opts) {\n    static_assert(std::is_base_of<Fst<Arc>, FST>::value,\n                  \"FST class does not inherit from Fst<Arc>\");\n    return FST::Read(strm, opts);\n  }\n\n  static Entry BuildEntry() {\n    return Entry(&ReadGeneric, &FstRegisterer<FST>::Convert);\n  }\n\n  static Fst<Arc> *Convert(const Fst<Arc> &fst) { return new FST(fst); }\n};\n\n// Convenience macro to generate static FstRegisterer instance.\n#define REGISTER_FST(FST, Arc) \\\n  static fst::FstRegisterer<FST<Arc>> FST##_##Arc##_registerer\n\n// Converts an FST to the specified type.\ntemplate <class Arc>\nFst<Arc> *Convert(const Fst<Arc> &fst, const string &fst_type) {\n  auto *reg = FstRegister<Arc>::GetRegister();\n  const auto converter = reg->GetConverter(fst_type);\n  if (!converter) {\n    FSTERROR() << \"Fst::Convert: Unknown FST type \" << fst_type << \" (arc type \"\n               << Arc::Type() << \")\";\n    return nullptr;\n  }\n  return converter(fst);\n}\n\n}  // namespace fst\n\n#endif  // FST_REGISTER_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/relabel.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Functions and classes to relabel an FST (either on input or output).\n\n#ifndef FST_RELABEL_H_\n#define FST_RELABEL_H_\n\n#include <string>\n#include <unordered_map>\n#include <utility>\n#include <vector>\n\n#include <fst/log.h>\n\n#include <fst/cache.h>\n#include <fst/test-properties.h>\n\n\n#include <unordered_map>\n\nnamespace fst {\n\n// Relabels either the input labels or output labels. The old to\n// new labels are specified using a vector of std::pair<Label, Label>.\n// Any label associations not specified are assumed to be identity\n// mapping. The destination labels must be valid labels (e.g., not kNoLabel).\ntemplate <class Arc>\nvoid Relabel(\n    MutableFst<Arc> *fst,\n    const std::vector<std::pair<typename Arc::Label, typename Arc::Label>>\n        &ipairs,\n    const std::vector<std::pair<typename Arc::Label, typename Arc::Label>>\n        &opairs) {\n  using Label = typename Arc::Label;\n  const auto props = fst->Properties(kFstProperties, false);\n  // Constructs label-to-label maps.\n  const std::unordered_map<Label, Label>\n      input_map(ipairs.begin(), ipairs.end());\n  const std::unordered_map<Label, Label>\n      output_map(opairs.begin(), opairs.end());\n  for (StateIterator<MutableFst<Arc>> siter(*fst); !siter.Done();\n       siter.Next()) {\n    for (MutableArcIterator<MutableFst<Arc>> aiter(fst, siter.Value());\n         !aiter.Done(); aiter.Next()) {\n      auto arc = aiter.Value();\n      // Relabels input.\n      auto it = input_map.find(arc.ilabel);\n      if (it != input_map.end()) {\n        if (it->second == kNoLabel) {\n          FSTERROR() << \"Input symbol ID \" << arc.ilabel\n                     << \" missing from target vocabulary\";\n          fst->SetProperties(kError, kError);\n          return;\n        }\n        arc.ilabel = it->second;\n      }\n      // Relabels output.\n      it = output_map.find(arc.olabel);\n      if (it != output_map.end()) {\n        if (it->second == kNoLabel) {\n          FSTERROR() << \"Output symbol id \" << arc.olabel\n                     << \" missing from target vocabulary\";\n          fst->SetProperties(kError, kError);\n          return;\n        }\n        arc.olabel = it->second;\n      }\n      aiter.SetValue(arc);\n    }\n  }\n  fst->SetProperties(RelabelProperties(props), kFstProperties);\n}\n\n// Relabels either the input labels or output labels. The old to\n// new labels are specified using pairs of old and new symbol tables.\n// The tables must contain (at least) all labels on the appropriate side of the\n// FST. If the 'unknown_i(o)symbol' is non-empty, it is used to label any\n// missing symbol in new_i(o)symbols table.\ntemplate <class Arc>\nvoid Relabel(MutableFst<Arc> *fst,\n             const SymbolTable *old_isymbols, const SymbolTable *new_isymbols,\n             const string &unknown_isymbol, bool attach_new_isymbols,\n             const SymbolTable *old_osymbols, const SymbolTable *new_osymbols,\n             const string &unknown_osymbol, bool attach_new_osymbols) {\n  using Label = typename Arc::Label;\n  // Constructs vectors of input-side label pairs.\n  std::vector<std::pair<Label, Label>> ipairs;\n  if (old_isymbols && new_isymbols) {\n    size_t num_missing_syms = 0;\n    Label unknown_ilabel = kNoLabel;\n    if (!unknown_isymbol.empty()) {\n      unknown_ilabel = new_isymbols->Find(unknown_isymbol);\n      if (unknown_ilabel == kNoLabel) {\n        VLOG(1) << \"Input symbol '\" << unknown_isymbol\n                << \"' missing from target symbol table\";\n        ++num_missing_syms;\n      }\n    }\n\n    for (SymbolTableIterator siter(*old_isymbols); !siter.Done();\n         siter.Next()) {\n      const auto old_index = siter.Value();\n      const auto symbol = siter.Symbol();\n      auto new_index = new_isymbols->Find(siter.Symbol());\n      if (new_index == kNoLabel) {\n        if (unknown_ilabel != kNoLabel) {\n          new_index = unknown_ilabel;\n        } else {\n          VLOG(1) << \"Input symbol ID \" << old_index << \" symbol '\" << symbol\n                  << \"' missing from target symbol table\";\n          ++num_missing_syms;\n        }\n      }\n      ipairs.push_back(std::make_pair(old_index, new_index));\n    }\n    if (num_missing_syms > 0) {\n      LOG(WARNING) << \"Target symbol table missing: \" << num_missing_syms\n                   << \" input symbols\";\n    }\n    if (attach_new_isymbols) fst->SetInputSymbols(new_isymbols);\n  }\n  // Constructs vectors of output-side label pairs.\n  std::vector<std::pair<Label, Label>> opairs;\n  if (old_osymbols && new_osymbols) {\n    size_t num_missing_syms = 0;\n    Label unknown_olabel = kNoLabel;\n    if (!unknown_osymbol.empty()) {\n      unknown_olabel = new_osymbols->Find(unknown_osymbol);\n      if (unknown_olabel == kNoLabel) {\n        VLOG(1) << \"Output symbol '\" << unknown_osymbol\n                << \"' missing from target symbol table\";\n        ++num_missing_syms;\n      }\n    }\n\n    for (SymbolTableIterator siter(*old_osymbols); !siter.Done();\n         siter.Next()) {\n      const auto old_index = siter.Value();\n      const auto symbol = siter.Symbol();\n      auto new_index = new_osymbols->Find(siter.Symbol());\n      if (new_index == kNoLabel) {\n        if (unknown_olabel != kNoLabel) {\n          new_index = unknown_olabel;\n        } else {\n          VLOG(1) << \"Output symbol ID \" << old_index << \" symbol '\" << symbol\n                  << \"' missing from target symbol table\";\n          ++num_missing_syms;\n        }\n      }\n      opairs.push_back(std::make_pair(old_index, new_index));\n    }\n    if (num_missing_syms > 0) {\n      LOG(WARNING) << \"Target symbol table missing: \" << num_missing_syms\n                   << \" output symbols\";\n    }\n    if (attach_new_osymbols) fst->SetOutputSymbols(new_osymbols);\n  }\n  // Calls relabel using vector of relabel pairs.\n  Relabel(fst, ipairs, opairs);\n}\n\n// Same as previous but no special allowance for unknown symbols. Kept\n// for backward compat.\ntemplate <class Arc>\nvoid Relabel(MutableFst<Arc> *fst, const SymbolTable *old_isymbols,\n             const SymbolTable *new_isymbols, bool attach_new_isymbols,\n             const SymbolTable *old_osymbols, const SymbolTable *new_osymbols,\n             bool attach_new_osymbols) {\n  Relabel(fst,\n          old_isymbols, new_isymbols, \"\" /* no unknown isymbol */,\n          attach_new_isymbols,\n          old_osymbols, new_osymbols, \"\" /* no unknown ioymbol */,\n          attach_new_osymbols);\n}\n\n\n// Relabels either the input labels or output labels. The old to\n// new labels are specified using symbol tables. Any label associations not\n// specified are assumed to be identity mapping.\ntemplate <class Arc>\nvoid Relabel(MutableFst<Arc> *fst, const SymbolTable *new_isymbols,\n             const SymbolTable *new_osymbols) {\n  Relabel(fst, fst->InputSymbols(), new_isymbols, true, fst->OutputSymbols(),\n          new_osymbols, true);\n}\n\nusing RelabelFstOptions = CacheOptions;\n\ntemplate <class Arc>\nclass RelabelFst;\n\nnamespace internal {\n\n// Relabels an FST from one symbol set to another. Relabeling can either be on\n// input or output space. RelabelFst implements a delayed version of the\n// relabel. Arcs are relabeled on the fly and not cached; i.e., each request is\n// recomputed.\ntemplate <class Arc>\nclass RelabelFstImpl : public CacheImpl<Arc> {\n public:\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using Store = DefaultCacheStore<Arc>;\n  using State = typename Store::State;\n\n  using FstImpl<Arc>::SetType;\n  using FstImpl<Arc>::SetProperties;\n  using FstImpl<Arc>::WriteHeader;\n  using FstImpl<Arc>::SetInputSymbols;\n  using FstImpl<Arc>::SetOutputSymbols;\n\n  using CacheImpl<Arc>::PushArc;\n  using CacheImpl<Arc>::HasArcs;\n  using CacheImpl<Arc>::HasFinal;\n  using CacheImpl<Arc>::HasStart;\n  using CacheImpl<Arc>::SetArcs;\n  using CacheImpl<Arc>::SetFinal;\n  using CacheImpl<Arc>::SetStart;\n\n  friend class StateIterator<RelabelFst<Arc>>;\n\n  RelabelFstImpl(const Fst<Arc> &fst,\n                 const std::vector<std::pair<Label, Label>> &ipairs,\n                 const std::vector<std::pair<Label, Label>> &opairs,\n                 const RelabelFstOptions &opts)\n      : CacheImpl<Arc>(opts),\n        fst_(fst.Copy()),\n        input_map_(ipairs.begin(), ipairs.end()),\n        output_map_(opairs.begin(), opairs.end()),\n        relabel_input_(!ipairs.empty()),\n        relabel_output_(!opairs.empty()) {\n    SetProperties(RelabelProperties(fst.Properties(kCopyProperties, false)));\n    SetType(\"relabel\");\n  }\n\n  RelabelFstImpl(const Fst<Arc> &fst,\n                 const SymbolTable *old_isymbols,\n                 const SymbolTable *new_isymbols,\n                 const SymbolTable *old_osymbols,\n                 const SymbolTable *new_osymbols,\n                 const RelabelFstOptions &opts)\n      : CacheImpl<Arc>(opts),\n        fst_(fst.Copy()),\n        relabel_input_(false),\n        relabel_output_(false) {\n    SetType(\"relabel\");\n    SetProperties(RelabelProperties(fst.Properties(kCopyProperties, false)));\n    SetInputSymbols(old_isymbols);\n    SetOutputSymbols(old_osymbols);\n    if (old_isymbols && new_isymbols &&\n        old_isymbols->LabeledCheckSum() != new_isymbols->LabeledCheckSum()) {\n      for (SymbolTableIterator siter(*old_isymbols); !siter.Done();\n           siter.Next()) {\n        input_map_[siter.Value()] = new_isymbols->Find(siter.Symbol());\n      }\n      SetInputSymbols(new_isymbols);\n      relabel_input_ = true;\n    }\n    if (old_osymbols && new_osymbols &&\n        old_osymbols->LabeledCheckSum() != new_osymbols->LabeledCheckSum()) {\n      for (SymbolTableIterator siter(*old_osymbols); !siter.Done();\n           siter.Next()) {\n        output_map_[siter.Value()] = new_osymbols->Find(siter.Symbol());\n      }\n      SetOutputSymbols(new_osymbols);\n      relabel_output_ = true;\n    }\n  }\n\n  RelabelFstImpl(const RelabelFstImpl<Arc> &impl)\n      : CacheImpl<Arc>(impl),\n        fst_(impl.fst_->Copy(true)),\n        input_map_(impl.input_map_),\n        output_map_(impl.output_map_),\n        relabel_input_(impl.relabel_input_),\n        relabel_output_(impl.relabel_output_) {\n    SetType(\"relabel\");\n    SetProperties(impl.Properties(), kCopyProperties);\n    SetInputSymbols(impl.InputSymbols());\n    SetOutputSymbols(impl.OutputSymbols());\n  }\n\n  StateId Start() {\n    if (!HasStart()) SetStart(fst_->Start());\n    return CacheImpl<Arc>::Start();\n  }\n\n  Weight Final(StateId s) {\n    if (!HasFinal(s)) SetFinal(s, fst_->Final(s));\n    return CacheImpl<Arc>::Final(s);\n  }\n\n  size_t NumArcs(StateId s) {\n    if (!HasArcs(s)) Expand(s);\n    return CacheImpl<Arc>::NumArcs(s);\n  }\n\n  size_t NumInputEpsilons(StateId s) {\n    if (!HasArcs(s)) Expand(s);\n    return CacheImpl<Arc>::NumInputEpsilons(s);\n  }\n\n  size_t NumOutputEpsilons(StateId s) {\n    if (!HasArcs(s)) Expand(s);\n    return CacheImpl<Arc>::NumOutputEpsilons(s);\n  }\n\n  uint64_t Properties() const override { return Properties(kFstProperties); }\n\n  // Sets error if found, and returns other FST impl properties.\n  uint64_t Properties(uint64_t mask) const override {\n    if ((mask & kError) && fst_->Properties(kError, false)) {\n      SetProperties(kError, kError);\n    }\n    return FstImpl<Arc>::Properties(mask);\n  }\n\n  void InitArcIterator(StateId s, ArcIteratorData<Arc> *data) {\n    if (!HasArcs(s)) Expand(s);\n    CacheImpl<Arc>::InitArcIterator(s, data);\n  }\n\n  void Expand(StateId s) {\n    for (ArcIterator<Fst<Arc>> aiter(*fst_, s); !aiter.Done(); aiter.Next()) {\n      auto arc = aiter.Value();\n      if (relabel_input_) {\n        auto it = input_map_.find(arc.ilabel);\n        if (it != input_map_.end()) arc.ilabel = it->second;\n      }\n      if (relabel_output_) {\n        auto it = output_map_.find(arc.olabel);\n        if (it != output_map_.end()) {\n          arc.olabel = it->second;\n        }\n      }\n      PushArc(s, arc);\n    }\n    SetArcs(s);\n  }\n\n private:\n  std::unique_ptr<const Fst<Arc>> fst_;\n\n  std::unordered_map<Label, Label> input_map_;\n  std::unordered_map<Label, Label> output_map_;\n  bool relabel_input_;\n  bool relabel_output_;\n};\n\n}  // namespace internal\n\n// This class attaches interface to implementation and handles\n// reference counting, delegating most methods to ImplToFst.\ntemplate <class A>\nclass RelabelFst : public ImplToFst<internal::RelabelFstImpl<A>> {\n public:\n  using Arc = A;\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using Store = DefaultCacheStore<Arc>;\n  using State = typename Store::State;\n  using Impl = internal::RelabelFstImpl<Arc>;\n\n  friend class ArcIterator<RelabelFst<A>>;\n  friend class StateIterator<RelabelFst<A>>;\n\n  RelabelFst(const Fst<Arc> &fst,\n             const std::vector<std::pair<Label, Label>> &ipairs,\n             const std::vector<std::pair<Label, Label>> &opairs,\n             const RelabelFstOptions &opts = RelabelFstOptions())\n      : ImplToFst<Impl>(std::make_shared<Impl>(fst, ipairs, opairs, opts)) {}\n\n  RelabelFst(const Fst<Arc> &fst, const SymbolTable *new_isymbols,\n             const SymbolTable *new_osymbols,\n             const RelabelFstOptions &opts = RelabelFstOptions())\n      : ImplToFst<Impl>(\n            std::make_shared<Impl>(fst, fst.InputSymbols(), new_isymbols,\n                                   fst.OutputSymbols(), new_osymbols, opts)) {}\n\n  RelabelFst(const Fst<Arc> &fst, const SymbolTable *old_isymbols,\n             const SymbolTable *new_isymbols, const SymbolTable *old_osymbols,\n             const SymbolTable *new_osymbols,\n             const RelabelFstOptions &opts = RelabelFstOptions())\n      : ImplToFst<Impl>(std::make_shared<Impl>(fst, old_isymbols, new_isymbols,\n                                               old_osymbols, new_osymbols,\n                                               opts)) {}\n\n  // See Fst<>::Copy() for doc.\n  RelabelFst(const RelabelFst<Arc> &fst, bool safe = false)\n      : ImplToFst<Impl>(fst, safe) {}\n\n  // Gets a copy of this RelabelFst. See Fst<>::Copy() for further doc.\n  RelabelFst<Arc> *Copy(bool safe = false) const override {\n    return new RelabelFst<Arc>(*this, safe);\n  }\n\n  void InitStateIterator(StateIteratorData<Arc> *data) const override;\n\n  void InitArcIterator(StateId s, ArcIteratorData<Arc> *data) const override {\n    return GetMutableImpl()->InitArcIterator(s, data);\n  }\n\n private:\n  using ImplToFst<Impl>::GetImpl;\n  using ImplToFst<Impl>::GetMutableImpl;\n\n  RelabelFst &operator=(const RelabelFst &) = delete;\n};\n\n// Specialization for RelabelFst.\ntemplate <class Arc>\nclass StateIterator<RelabelFst<Arc>> : public StateIteratorBase<Arc> {\n public:\n  using StateId = typename Arc::StateId;\n\n  explicit StateIterator(const RelabelFst<Arc> &fst)\n      : impl_(fst.GetImpl()), siter_(*impl_->fst_), s_(0) {}\n\n  bool Done() const final { return siter_.Done(); }\n\n  StateId Value() const final { return s_; }\n\n  void Next() final {\n    if (!siter_.Done()) {\n      ++s_;\n      siter_.Next();\n    }\n  }\n\n  void Reset() final {\n    s_ = 0;\n    siter_.Reset();\n  }\n\n private:\n  const internal::RelabelFstImpl<Arc>* impl_;\n  StateIterator<Fst<Arc>> siter_;\n  StateId s_;\n\n  StateIterator(const StateIterator &) = delete;\n  StateIterator &operator=(const StateIterator &) = delete;\n};\n\n// Specialization for RelabelFst.\ntemplate <class Arc>\nclass ArcIterator<RelabelFst<Arc>> : public CacheArcIterator<RelabelFst<Arc>> {\n public:\n  using StateId = typename Arc::StateId;\n\n  ArcIterator(const RelabelFst<Arc> &fst, StateId s)\n      : CacheArcIterator<RelabelFst<Arc>>(fst.GetMutableImpl(), s) {\n    if (!fst.GetImpl()->HasArcs(s)) fst.GetMutableImpl()->Expand(s);\n  }\n};\n\ntemplate <class Arc>\ninline void RelabelFst<Arc>::InitStateIterator(\n    StateIteratorData<Arc> *data) const {\n  data->base = new StateIterator<RelabelFst<Arc>>(*this);\n}\n\n// Useful alias when using StdArc.\nusing StdRelabelFst = RelabelFst<StdArc>;\n\n}  // namespace fst\n\n#endif  // FST_RELABEL_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/replace-util.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Utility classes for the recursive replacement of FSTs (RTNs).\n\n#ifndef FST_REPLACE_UTIL_H_\n#define FST_REPLACE_UTIL_H_\n\n#include <map>\n#include <unordered_map>\n#include <unordered_set>\n#include <vector>\n\n#include <fst/log.h>\n\n#include <fst/connect.h>\n#include <fst/mutable-fst.h>\n#include <fst/topsort.h>\n#include <fst/vector-fst.h>\n\n\nnamespace fst {\n\n// This specifies what labels to output on the call or return arc. Note that\n// REPLACE_LABEL_INPUT and REPLACE_LABEL_OUTPUT will produce transducers when\n// applied to acceptors.\nenum ReplaceLabelType {\n  // Epsilon labels on both input and output.\n  REPLACE_LABEL_NEITHER = 1,\n  // Non-epsilon labels on input and epsilon on output.\n  REPLACE_LABEL_INPUT = 2,\n  // Epsilon on input and non-epsilon on output.\n  REPLACE_LABEL_OUTPUT = 3,\n  // Non-epsilon labels on both input and output.\n  REPLACE_LABEL_BOTH = 4\n};\n\n// By default ReplaceUtil will copy the input label of the replace arc.\n// The call_label_type and return_label_type options specify how to manage\n// the labels of the call arc and the return arc of the replace FST\nstruct ReplaceUtilOptions {\n  int64_t root;                          // Root rule for expansion.\n  ReplaceLabelType call_label_type;    // How to label call arc.\n  ReplaceLabelType return_label_type;  // How to label return arc.\n  int64_t return_label;                  // Label to put on return arc.\n\n  explicit ReplaceUtilOptions(\n      int64_t root = kNoLabel,\n      ReplaceLabelType call_label_type = REPLACE_LABEL_INPUT,\n      ReplaceLabelType return_label_type = REPLACE_LABEL_NEITHER,\n      int64_t return_label = 0)\n      : root(root),\n        call_label_type(call_label_type),\n        return_label_type(return_label_type),\n        return_label(return_label) {}\n\n  // For backwards compatibility.\n  ReplaceUtilOptions(int64_t root, bool epsilon_replace_arc)\n      : ReplaceUtilOptions(root,\n                           epsilon_replace_arc ? REPLACE_LABEL_NEITHER\n                                               : REPLACE_LABEL_INPUT) {}\n};\n\n// Every non-terminal on a path appears as the first label on that path in every\n// FST associated with a given SCC of the replace dependency graph. This would\n// be true if the SCC were formed from left-linear grammar rules.\nconstexpr uint8_t kReplaceSCCLeftLinear = 0x01;\n// Every non-terminal on a path appears as the final label on that path in every\n// FST associated with a given SCC of the replace dependency graph. This would\n// be true if the SCC were formed from right-linear grammar rules.\nconstexpr uint8_t kReplaceSCCRightLinear = 0x02;\n// The SCC in the replace dependency graph has more than one state or a\n// self-loop.\nconstexpr uint8_t kReplaceSCCNonTrivial = 0x04;\n\n// Defined in replace.h.\ntemplate <class Arc>\nvoid Replace(\n    const std::vector<std::pair<typename Arc::Label, const Fst<Arc> *>> &,\n    MutableFst<Arc> *, const ReplaceUtilOptions &);\n\n// Utility class for the recursive replacement of FSTs (RTNs). The user provides\n// a set of label/FST pairs at construction. These are used by methods for\n// testing cyclic dependencies and connectedness and doing RTN connection and\n// specific FST replacement by label or for various optimization properties. The\n// modified results can be obtained with the GetFstPairs() or\n// GetMutableFstPairs() methods.\ntemplate <class Arc>\nclass ReplaceUtil {\n public:\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using FstPair = std::pair<Label, const Fst<Arc> *>;\n  using MutableFstPair = std::pair<Label, MutableFst<Arc> *>;\n  using NonTerminalHash = std::unordered_map<Label, Label>;\n\n  // Constructs from mutable FSTs; FST ownership is given to ReplaceUtil.\n  ReplaceUtil(const std::vector<MutableFstPair> &fst_pairs,\n              const ReplaceUtilOptions &opts);\n\n  // Constructs from FSTs; FST ownership is retained by caller.\n  ReplaceUtil(const std::vector<FstPair> &fst_pairs,\n              const ReplaceUtilOptions &opts);\n\n  // Constructs from ReplaceFst internals; FST ownership is retained by caller.\n  ReplaceUtil(const std::vector<std::unique_ptr<const Fst<Arc>>> &fst_array,\n              const NonTerminalHash &nonterminal_hash,\n              const ReplaceUtilOptions &opts);\n\n  ~ReplaceUtil() {\n    for (Label i = 0; i < fst_array_.size(); ++i) delete fst_array_[i];\n  }\n\n  // True if the non-terminal dependencies are cyclic. Cyclic dependencies will\n  // result in an unexpandable FST.\n  bool CyclicDependencies() const {\n    GetDependencies(false);\n    return depprops_ & kCyclic;\n  }\n\n  // Returns the strongly-connected component ID in the dependency graph of the\n  // replace FSTS.\n  StateId SCC(Label label) const {\n    GetDependencies(false);\n    const auto it = nonterminal_hash_.find(label);\n    if (it == nonterminal_hash_.end()) return kNoStateId;\n    return depscc_[it->second];\n  }\n\n  // Returns properties for the strongly-connected component in the dependency\n  // graph of the replace FSTs. If the SCC is kReplaceSCCLeftLinear or\n  // kReplaceSCCRightLinear, that SCC can be represented as finite-state despite\n  // any cyclic dependencies, but not by the usual replacement operation (see\n  // fst/extensions/pdt/replace.h).\n  uint8_t SCCProperties(StateId scc_id) {\n    GetSCCProperties();\n    return depsccprops_[scc_id];\n  }\n\n  // Returns true if no useless FSTs, states or transitions are present in the\n  // RTN.\n  bool Connected() const {\n    GetDependencies(false);\n    uint64_t props = kAccessible | kCoAccessible;\n    for (Label i = 0; i < fst_array_.size(); ++i) {\n      if (!fst_array_[i]) continue;\n      if (fst_array_[i]->Properties(props, true) != props || !depaccess_[i]) {\n        return false;\n      }\n    }\n    return true;\n  }\n\n  // Removes useless FSTs, states and transitions from the RTN.\n  void Connect();\n\n  // Replaces FSTs specified by labels, unless there are cyclic dependencies.\n  void ReplaceLabels(const std::vector<Label> &labels);\n\n  // Replaces FSTs that have at most nstates states, narcs arcs and nnonterm\n  // non-terminals (updating in reverse dependency order), unless there are\n  // cyclic dependencies.\n  void ReplaceBySize(size_t nstates, size_t narcs, size_t nnonterms);\n\n  // Replaces singleton FSTS, unless there are cyclic dependencies.\n  void ReplaceTrivial() { ReplaceBySize(2, 1, 1); }\n\n  // Replaces non-terminals that have at most ninstances instances (updating in\n  // dependency order), unless there are cyclic dependencies.\n  void ReplaceByInstances(size_t ninstances);\n\n  // Replaces non-terminals that have only one instance, unless there are cyclic\n  // dependencies.\n  void ReplaceUnique() { ReplaceByInstances(1); }\n\n  // Returns label/FST pairs, retaining FST ownership.\n  void GetFstPairs(std::vector<FstPair> *fst_pairs);\n\n  // Returns label/mutable FST pairs, giving FST ownership over to the caller.\n  void GetMutableFstPairs(std::vector<MutableFstPair> *mutable_fst_pairs);\n\n private:\n  // FST statistics.\n  struct ReplaceStats {\n    StateId nstates;  // Number of states.\n    StateId nfinal;   // Number of final states.\n    size_t narcs;     // Number of arcs.\n    Label nnonterms;  // Number of non-terminals in FST.\n    size_t nref;      // Number of non-terminal instances referring to this FST.\n    // Number of times that ith FST references this FST\n    std::map<Label, size_t> inref;\n    // Number of times that this FST references the ith FST\n    std::map<Label, size_t> outref;\n\n    ReplaceStats() : nstates(0), nfinal(0), narcs(0), nnonterms(0), nref(0) {}\n  };\n\n  // Checks that Mutable FSTs exists, creating them if necessary.\n  void CheckMutableFsts();\n\n  // Computes the dependency graph for the RTN, computing dependency statistics\n  // if stats is true.\n  void GetDependencies(bool stats) const;\n\n  void ClearDependencies() const {\n    depfst_.DeleteStates();\n    stats_.clear();\n    depprops_ = 0;\n    depsccprops_.clear();\n    have_stats_ = false;\n  }\n\n  // Gets topological order of dependencies, returning false with cyclic input.\n  bool GetTopOrder(const Fst<Arc> &fst, std::vector<Label> *toporder) const;\n\n  // Updates statistics to reflect the replacement of the jth FST.\n  void UpdateStats(Label j);\n\n  // Computes the properties for the strongly-connected component in the\n  // dependency graph of the replace FSTs.\n  void GetSCCProperties() const;\n\n  Label root_label_;                                  // Root non-terminal.\n  Label root_fst_;                                    // Root FST ID.\n  ReplaceLabelType call_label_type_;                  // See Replace().\n  ReplaceLabelType return_label_type_;                // See Replace().\n  int64_t return_label_;                                // See Replace().\n  std::vector<const Fst<Arc> *> fst_array_;           // FST per ID.\n  std::vector<MutableFst<Arc> *> mutable_fst_array_;  // Mutable FST per ID.\n  std::vector<Label> nonterminal_array_;              // FST ID to non-terminal.\n  NonTerminalHash nonterminal_hash_;                  // Non-terminal to FST ID.\n  mutable VectorFst<Arc> depfst_;                     // FST ID dependencies.\n  mutable std::vector<StateId> depscc_;               // FST SCC ID.\n  mutable std::vector<bool> depaccess_;               // FST ID accessibility.\n  mutable uint64_t depprops_;                           // Dependency FST props.\n  mutable bool have_stats_;                  // Have dependency statistics?\n  mutable std::vector<ReplaceStats> stats_;  // Per-FST statistics.\n  mutable std::vector<uint8_t> depsccprops_;   // SCC properties.\n  ReplaceUtil(const ReplaceUtil &) = delete;\n  ReplaceUtil &operator=(const ReplaceUtil &) = delete;\n};\n\ntemplate <class Arc>\nReplaceUtil<Arc>::ReplaceUtil(const std::vector<MutableFstPair> &fst_pairs,\n                              const ReplaceUtilOptions &opts)\n    : root_label_(opts.root),\n      call_label_type_(opts.call_label_type),\n      return_label_type_(opts.return_label_type),\n      return_label_(opts.return_label),\n      depprops_(0),\n      have_stats_(false) {\n  fst_array_.push_back(nullptr);\n  mutable_fst_array_.push_back(nullptr);\n  nonterminal_array_.push_back(kNoLabel);\n  for (const auto &fst_pair : fst_pairs) {\n    const auto label = fst_pair.first;\n    auto *fst = fst_pair.second;\n    nonterminal_hash_[label] = fst_array_.size();\n    nonterminal_array_.push_back(label);\n    fst_array_.push_back(fst);\n    mutable_fst_array_.push_back(fst);\n  }\n  root_fst_ = nonterminal_hash_[root_label_];\n  if (!root_fst_) {\n    FSTERROR() << \"ReplaceUtil: No root FST for label: \" << root_label_;\n  }\n}\n\ntemplate <class Arc>\nReplaceUtil<Arc>::ReplaceUtil(const std::vector<FstPair> &fst_pairs,\n                              const ReplaceUtilOptions &opts)\n    : root_label_(opts.root),\n      call_label_type_(opts.call_label_type),\n      return_label_type_(opts.return_label_type),\n      return_label_(opts.return_label),\n      depprops_(0),\n      have_stats_(false) {\n  fst_array_.push_back(nullptr);\n  nonterminal_array_.push_back(kNoLabel);\n  for (const auto &fst_pair : fst_pairs) {\n    const auto label = fst_pair.first;\n    const auto *fst = fst_pair.second;\n    nonterminal_hash_[label] = fst_array_.size();\n    nonterminal_array_.push_back(label);\n    fst_array_.push_back(fst->Copy());\n  }\n  root_fst_ = nonterminal_hash_[root_label_];\n  if (!root_fst_) {\n    FSTERROR() << \"ReplaceUtil: No root FST for label: \" << root_label_;\n  }\n}\n\ntemplate <class Arc>\nReplaceUtil<Arc>::ReplaceUtil(\n    const std::vector<std::unique_ptr<const Fst<Arc>>> &fst_array,\n    const NonTerminalHash &nonterminal_hash, const ReplaceUtilOptions &opts)\n    : root_fst_(opts.root),\n      call_label_type_(opts.call_label_type),\n      return_label_type_(opts.return_label_type),\n      return_label_(opts.return_label),\n      nonterminal_array_(fst_array.size()),\n      nonterminal_hash_(nonterminal_hash),\n      depprops_(0),\n      have_stats_(false) {\n  fst_array_.push_back(nullptr);\n  for (size_t i = 1; i < fst_array.size(); ++i) {\n    fst_array_.push_back(fst_array[i]->Copy());\n  }\n  for (auto it = nonterminal_hash.begin(); it != nonterminal_hash.end(); ++it) {\n    nonterminal_array_[it->second] = it->first;\n  }\n  root_label_ = nonterminal_array_[root_fst_];\n}\n\ntemplate <class Arc>\nvoid ReplaceUtil<Arc>::GetDependencies(bool stats) const {\n  if (depfst_.NumStates() > 0) {\n    if (stats && !have_stats_) {\n      ClearDependencies();\n    } else {\n      return;\n    }\n  }\n  have_stats_ = stats;\n  if (have_stats_) stats_.reserve(fst_array_.size());\n  for (Label i = 0; i < fst_array_.size(); ++i) {\n    depfst_.AddState();\n    depfst_.SetFinal(i, Weight::One());\n    if (have_stats_) stats_.push_back(ReplaceStats());\n  }\n  depfst_.SetStart(root_fst_);\n  // An arc from each state (representing the FST) to the state representing the\n  // FST being replaced\n  for (Label i = 0; i < fst_array_.size(); ++i) {\n    const auto *ifst = fst_array_[i];\n    if (!ifst) continue;\n    for (StateIterator<Fst<Arc>> siter(*ifst); !siter.Done(); siter.Next()) {\n      const auto s = siter.Value();\n      if (have_stats_) {\n        ++stats_[i].nstates;\n        if (ifst->Final(s) != Weight::Zero()) ++stats_[i].nfinal;\n      }\n      for (ArcIterator<Fst<Arc>> aiter(*ifst, s); !aiter.Done();\n           aiter.Next()) {\n        if (have_stats_) ++stats_[i].narcs;\n        const auto &arc = aiter.Value();\n        auto it = nonterminal_hash_.find(arc.olabel);\n        if (it != nonterminal_hash_.end()) {\n          const auto j = it->second;\n          depfst_.AddArc(i, Arc(arc.olabel, arc.olabel, Weight::One(), j));\n          if (have_stats_) {\n            ++stats_[i].nnonterms;\n            ++stats_[j].nref;\n            ++stats_[j].inref[i];\n            ++stats_[i].outref[j];\n          }\n        }\n      }\n    }\n  }\n  // Computes accessibility info.\n  SccVisitor<Arc> scc_visitor(&depscc_, &depaccess_, nullptr, &depprops_);\n  DfsVisit(depfst_, &scc_visitor);\n}\n\ntemplate <class Arc>\nvoid ReplaceUtil<Arc>::UpdateStats(Label j) {\n  if (!have_stats_) {\n    FSTERROR() << \"ReplaceUtil::UpdateStats: Stats not available\";\n    return;\n  }\n  if (j == root_fst_) return;  // Can't replace root.\n  for (auto in = stats_[j].inref.begin(); in != stats_[j].inref.end(); ++in) {\n    const auto i = in->first;\n    const auto ni = in->second;\n    stats_[i].nstates += stats_[j].nstates * ni;\n    stats_[i].narcs += (stats_[j].narcs + 1) * ni;\n    stats_[i].nnonterms += (stats_[j].nnonterms - 1) * ni;\n    stats_[i].outref.erase(j);\n    for (auto out = stats_[j].outref.begin(); out != stats_[j].outref.end();\n         ++out) {\n      const auto k = out->first;\n      const auto nk = out->second;\n      stats_[i].outref[k] += ni * nk;\n    }\n  }\n  for (auto out = stats_[j].outref.begin(); out != stats_[j].outref.end();\n       ++out) {\n    const auto k = out->first;\n    const auto nk = out->second;\n    stats_[k].nref -= nk;\n    stats_[k].inref.erase(j);\n    for (auto in = stats_[j].inref.begin(); in != stats_[j].inref.end(); ++in) {\n      const auto i = in->first;\n      const auto ni = in->second;\n      stats_[k].inref[i] += ni * nk;\n      stats_[k].nref += ni * nk;\n    }\n  }\n}\n\ntemplate <class Arc>\nvoid ReplaceUtil<Arc>::CheckMutableFsts() {\n  if (mutable_fst_array_.empty()) {\n    for (Label i = 0; i < fst_array_.size(); ++i) {\n      if (!fst_array_[i]) {\n        mutable_fst_array_.push_back(nullptr);\n      } else {\n        mutable_fst_array_.push_back(new VectorFst<Arc>(*fst_array_[i]));\n        delete fst_array_[i];\n        fst_array_[i] = mutable_fst_array_[i];\n      }\n    }\n  }\n}\n\ntemplate <class Arc>\nvoid ReplaceUtil<Arc>::Connect() {\n  CheckMutableFsts();\n  static constexpr auto props = kAccessible | kCoAccessible;\n  for (auto *mutable_fst : mutable_fst_array_) {\n    if (!mutable_fst) continue;\n    if (mutable_fst->Properties(props, false) != props) {\n      fst::Connect(mutable_fst);\n    }\n  }\n  GetDependencies(false);\n  for (Label i = 0; i < mutable_fst_array_.size(); ++i) {\n    auto *fst = mutable_fst_array_[i];\n    if (fst && !depaccess_[i]) {\n      delete fst;\n      fst_array_[i] = nullptr;\n      mutable_fst_array_[i] = nullptr;\n    }\n  }\n  ClearDependencies();\n}\n\ntemplate <class Arc>\nbool ReplaceUtil<Arc>::GetTopOrder(const Fst<Arc> &fst,\n                                   std::vector<Label> *toporder) const {\n  // Finds topological order of dependencies.\n  std::vector<StateId> order;\n  bool acyclic = false;\n  TopOrderVisitor<Arc> top_order_visitor(&order, &acyclic);\n  DfsVisit(fst, &top_order_visitor);\n  if (!acyclic) {\n    LOG(WARNING) << \"ReplaceUtil::GetTopOrder: Cyclical label dependencies\";\n    return false;\n  }\n  toporder->resize(order.size());\n  for (Label i = 0; i < order.size(); ++i) (*toporder)[order[i]] = i;\n  return true;\n}\n\ntemplate <class Arc>\nvoid ReplaceUtil<Arc>::ReplaceLabels(const std::vector<Label> &labels) {\n  CheckMutableFsts();\n  std::unordered_set<Label> label_set;\n  for (const auto label : labels) {\n    // Can't replace root.\n    if (label != root_label_) label_set.insert(label);\n  }\n  // Finds FST dependencies restricted to the labels requested.\n  GetDependencies(false);\n  VectorFst<Arc> pfst(depfst_);\n  for (StateId i = 0; i < pfst.NumStates(); ++i) {\n    std::vector<Arc> arcs;\n    for (ArcIterator<VectorFst<Arc>> aiter(pfst, i); !aiter.Done();\n         aiter.Next()) {\n      const auto &arc = aiter.Value();\n      const auto label = nonterminal_array_[arc.nextstate];\n      if (label_set.count(label) > 0) arcs.push_back(arc);\n    }\n    pfst.DeleteArcs(i);\n    for (const auto &arc : arcs) pfst.AddArc(i, arc);\n  }\n  std::vector<Label> toporder;\n  if (!GetTopOrder(pfst, &toporder)) {\n    ClearDependencies();\n    return;\n  }\n  // Visits FSTs in reverse topological order of dependencies and performs\n  // replacements.\n  for (Label o = toporder.size() - 1; o >= 0; --o) {\n    std::vector<FstPair> fst_pairs;\n    auto s = toporder[o];\n    for (ArcIterator<VectorFst<Arc>> aiter(pfst, s); !aiter.Done();\n         aiter.Next()) {\n      const auto &arc = aiter.Value();\n      const auto label = nonterminal_array_[arc.nextstate];\n      const auto *fst = fst_array_[arc.nextstate];\n      fst_pairs.push_back(std::make_pair(label, fst));\n    }\n    if (fst_pairs.empty()) continue;\n    const auto label = nonterminal_array_[s];\n    const auto *fst = fst_array_[s];\n    fst_pairs.push_back(std::make_pair(label, fst));\n    const ReplaceUtilOptions opts(label, call_label_type_, return_label_type_,\n                                  return_label_);\n    Replace(fst_pairs, mutable_fst_array_[s], opts);\n  }\n  ClearDependencies();\n}\n\ntemplate <class Arc>\nvoid ReplaceUtil<Arc>::ReplaceBySize(size_t nstates, size_t narcs,\n                                     size_t nnonterms) {\n  std::vector<Label> labels;\n  GetDependencies(true);\n  std::vector<Label> toporder;\n  if (!GetTopOrder(depfst_, &toporder)) {\n    ClearDependencies();\n    return;\n  }\n  for (Label o = toporder.size() - 1; o >= 0; --o) {\n    const auto j = toporder[o];\n    if (stats_[j].nstates <= nstates && stats_[j].narcs <= narcs &&\n        stats_[j].nnonterms <= nnonterms) {\n      labels.push_back(nonterminal_array_[j]);\n      UpdateStats(j);\n    }\n  }\n  ReplaceLabels(labels);\n}\n\ntemplate <class Arc>\nvoid ReplaceUtil<Arc>::ReplaceByInstances(size_t ninstances) {\n  std::vector<Label> labels;\n  GetDependencies(true);\n  std::vector<Label> toporder;\n  if (!GetTopOrder(depfst_, &toporder)) {\n    ClearDependencies();\n    return;\n  }\n  for (Label o = 0; o < toporder.size(); ++o) {\n    const auto j = toporder[o];\n    if (stats_[j].nref <= ninstances) {\n      labels.push_back(nonterminal_array_[j]);\n      UpdateStats(j);\n    }\n  }\n  ReplaceLabels(labels);\n}\n\ntemplate <class Arc>\nvoid ReplaceUtil<Arc>::GetFstPairs(std::vector<FstPair> *fst_pairs) {\n  CheckMutableFsts();\n  fst_pairs->clear();\n  for (Label i = 0; i < fst_array_.size(); ++i) {\n    const auto label = nonterminal_array_[i];\n    const auto *fst = fst_array_[i];\n    if (!fst) continue;\n    fst_pairs->push_back(std::make_pair(label, fst));\n  }\n}\n\ntemplate <class Arc>\nvoid ReplaceUtil<Arc>::GetMutableFstPairs(\n    std::vector<MutableFstPair> *mutable_fst_pairs) {\n  CheckMutableFsts();\n  mutable_fst_pairs->clear();\n  for (Label i = 0; i < mutable_fst_array_.size(); ++i) {\n    const auto label = nonterminal_array_[i];\n    const auto *fst = mutable_fst_array_[i];\n    if (!fst) continue;\n    mutable_fst_pairs->push_back(std::make_pair(label, fst->Copy()));\n  }\n}\n\ntemplate <class Arc>\nvoid ReplaceUtil<Arc>::GetSCCProperties() const {\n  if (!depsccprops_.empty()) return;\n  GetDependencies(false);\n  if (depscc_.empty()) return;\n  for (StateId scc = 0; scc < depscc_.size(); ++scc) {\n    depsccprops_.push_back(kReplaceSCCLeftLinear | kReplaceSCCRightLinear);\n  }\n  if (!(depprops_ & kCyclic)) return;  // No cyclic dependencies.\n  // Checks for self-loops in the dependency graph.\n  for (StateId scc = 0; scc < depscc_.size(); ++scc) {\n    for (ArcIterator<Fst<Arc> > aiter(depfst_, scc);\n         !aiter.Done(); aiter.Next()) {\n      const auto &arc = aiter.Value();\n      if (arc.nextstate == scc) {  // SCC has a self loop.\n        depsccprops_[scc] |= kReplaceSCCNonTrivial;\n      }\n    }\n  }\n  std::vector<bool> depscc_visited(depscc_.size(), false);\n  for (Label i = 0; i < fst_array_.size(); ++i) {\n    const auto *fst = fst_array_[i];\n    if (!fst) continue;\n    const auto depscc = depscc_[i];\n    if (depscc_visited[depscc]) {  // SCC has more than one state.\n      depsccprops_[depscc] |= kReplaceSCCNonTrivial;\n    }\n    depscc_visited[depscc] = true;\n    std::vector<StateId> fstscc;  // SCCs of the current FST.\n    uint64_t fstprops;\n    SccVisitor<Arc> scc_visitor(&fstscc, nullptr, nullptr, &fstprops);\n    DfsVisit(*fst, &scc_visitor);\n    for (StateIterator<Fst<Arc>> siter(*fst); !siter.Done(); siter.Next()) {\n      const auto s = siter.Value();\n      for (ArcIterator<Fst<Arc>> aiter(*fst, s); !aiter.Done(); aiter.Next()) {\n        const auto &arc = aiter.Value();\n        auto it = nonterminal_hash_.find(arc.olabel);\n        if (it == nonterminal_hash_.end() || depscc_[it->second] != depscc) {\n          continue;  // Skips if a terminal or a non-terminal not in SCC.\n        }\n        const bool arc_in_cycle = fstscc[s] == fstscc[arc.nextstate];\n        // Left linear iff all non-terminals are initial.\n        if (s != fst->Start() || arc_in_cycle) {\n          depsccprops_[depscc] &= ~kReplaceSCCLeftLinear;\n        }\n        // Right linear iff all non-terminals are final.\n        if (fst->Final(arc.nextstate) == Weight::Zero() || arc_in_cycle) {\n          depsccprops_[depscc] &= ~kReplaceSCCRightLinear;\n        }\n      }\n    }\n  }\n}\n\n}  // namespace fst\n\n#endif  // FST_REPLACE_UTIL_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/replace.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Functions and classes for the recursive replacement of FSTs.\n\n#ifndef FST_REPLACE_H_\n#define FST_REPLACE_H_\n\n#include <set>\n#include <string>\n#include <unordered_map>\n#include <utility>\n#include <vector>\n\n#include <fst/log.h>\n\n#include <fst/cache.h>\n#include <fst/expanded-fst.h>\n#include <fst/fst-decl.h>  // For optional argument declarations.\n#include <fst/fst.h>\n#include <fst/matcher.h>\n#include <fst/replace-util.h>\n#include <fst/state-table.h>\n#include <fst/test-properties.h>\n\nnamespace fst {\n\n// Replace state tables have the form:\n//\n// template <class Arc, class P>\n// class ReplaceStateTable {\n//  public:\n//   using Label = typename Arc::Label Label;\n//   using StateId = typename Arc::StateId;\n//\n//   using PrefixId = P;\n//   using StateTuple = ReplaceStateTuple<StateId, PrefixId>;\n//   using StackPrefix = ReplaceStackPrefix<Label, StateId>;\n//\n//   // Required constructor.\n//   ReplaceStateTable(\n//       const std::vector<std::pair<Label, const Fst<Arc> *>> &fst_list,\n//       Label root);\n//\n//   // Required copy constructor that does not copy state.\n//   ReplaceStateTable(const ReplaceStateTable<Arc, PrefixId> &table);\n//\n//   // Looks up state ID by tuple, adding it if it doesn't exist.\n//   StateId FindState(const StateTuple &tuple);\n//\n//   // Looks up state tuple by ID.\n//   const StateTuple &Tuple(StateId id) const;\n//\n//   // Lookus up prefix ID by stack prefix, adding it if it doesn't exist.\n//   PrefixId FindPrefixId(const StackPrefix &stack_prefix);\n//\n//  // Looks up stack prefix by ID.\n//  const StackPrefix &GetStackPrefix(PrefixId id) const;\n// };\n\n// Tuple that uniquely defines a state in replace.\ntemplate <class S, class P>\nstruct ReplaceStateTuple {\n  using StateId = S;\n  using PrefixId = P;\n\n  ReplaceStateTuple(PrefixId prefix_id = -1, StateId fst_id = kNoStateId,\n                    StateId fst_state = kNoStateId)\n      : prefix_id(prefix_id), fst_id(fst_id), fst_state(fst_state) {}\n\n  PrefixId prefix_id;  // Index in prefix table.\n  StateId fst_id;      // Current FST being walked.\n  StateId fst_state;   // Current state in FST being walked (not to be\n                       // confused with the thse StateId of the combined FST).\n};\n\n// Equality of replace state tuples.\ntemplate <class StateId, class PrefixId>\ninline bool operator==(const ReplaceStateTuple<StateId, PrefixId> &x,\n                       const ReplaceStateTuple<StateId, PrefixId> &y) {\n  return x.prefix_id == y.prefix_id && x.fst_id == y.fst_id &&\n         x.fst_state == y.fst_state;\n}\n\n// Functor returning true for tuples corresponding to states in the root FST.\ntemplate <class StateId, class PrefixId>\nclass ReplaceRootSelector {\n public:\n  bool operator()(const ReplaceStateTuple<StateId, PrefixId> &tuple) const {\n    return tuple.prefix_id == 0;\n  }\n};\n\n// Functor for fingerprinting replace state tuples.\ntemplate <class StateId, class PrefixId>\nclass ReplaceFingerprint {\n public:\n  explicit ReplaceFingerprint(const std::vector<uint64_t> *size_array)\n      : size_array_(size_array) {}\n\n  uint64_t operator()(const ReplaceStateTuple<StateId, PrefixId> &tuple) const {\n    return tuple.prefix_id * size_array_->back() +\n           size_array_->at(tuple.fst_id - 1) + tuple.fst_state;\n  }\n\n private:\n  const std::vector<uint64_t> *size_array_;\n};\n\n// Useful when the fst_state uniquely define the tuple.\ntemplate <class StateId, class PrefixId>\nclass ReplaceFstStateFingerprint {\n public:\n  uint64_t operator()(const ReplaceStateTuple<StateId, PrefixId> &tuple) const {\n    return tuple.fst_state;\n  }\n};\n\n// A generic hash function for replace state tuples.\ntemplate <typename S, typename P>\nclass ReplaceHash {\n public:\n  size_t operator()(const ReplaceStateTuple<S, P>& t) const {\n    static constexpr size_t prime0 = 7853;\n    static constexpr size_t prime1 = 7867;\n    return t.prefix_id + t.fst_id * prime0 + t.fst_state * prime1;\n  }\n};\n\n// Container for stack prefix.\ntemplate <class Label, class StateId>\nclass ReplaceStackPrefix {\n public:\n  struct PrefixTuple {\n    PrefixTuple(Label fst_id = kNoLabel, StateId nextstate = kNoStateId)\n        : fst_id(fst_id), nextstate(nextstate) {}\n\n    Label fst_id;\n    StateId nextstate;\n  };\n\n  ReplaceStackPrefix() {}\n\n  ReplaceStackPrefix(const ReplaceStackPrefix &other)\n      : prefix_(other.prefix_) {}\n\n  void Push(StateId fst_id, StateId nextstate) {\n    prefix_.push_back(PrefixTuple(fst_id, nextstate));\n  }\n\n  void Pop() { prefix_.pop_back(); }\n\n  const PrefixTuple &Top() const { return prefix_[prefix_.size() - 1]; }\n\n  size_t Depth() const { return prefix_.size(); }\n\n public:\n  std::vector<PrefixTuple> prefix_;\n};\n\n// Equality stack prefix classes.\ntemplate <class Label, class StateId>\ninline bool operator==(const ReplaceStackPrefix<Label, StateId> &x,\n                       const ReplaceStackPrefix<Label, StateId> &y) {\n  if (x.prefix_.size() != y.prefix_.size()) return false;\n  for (size_t i = 0; i < x.prefix_.size(); ++i) {\n    if (x.prefix_[i].fst_id != y.prefix_[i].fst_id ||\n        x.prefix_[i].nextstate != y.prefix_[i].nextstate) {\n      return false;\n    }\n  }\n  return true;\n}\n\n// Hash function for stack prefix to prefix id.\ntemplate <class Label, class StateId>\nclass ReplaceStackPrefixHash {\n public:\n  size_t operator()(const ReplaceStackPrefix<Label, StateId> &prefix) const {\n    size_t sum = 0;\n    for (const auto &pair : prefix.prefix_) {\n      static constexpr size_t prime = 7863;\n      sum += pair.fst_id + pair.nextstate * prime;\n    }\n    return sum;\n  }\n};\n\n// Replace state tables.\n\n// A two-level state table for replace. Warning: calls CountStates to compute\n// the number of states of each component FST.\ntemplate <class Arc, class P = std::ptrdiff_t>\nclass VectorHashReplaceStateTable {\n public:\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n\n  using PrefixId = P;\n\n  using StateTuple = ReplaceStateTuple<StateId, PrefixId>;\n  using StateTable =\n      VectorHashStateTable<ReplaceStateTuple<StateId, PrefixId>,\n                           ReplaceRootSelector<StateId, PrefixId>,\n                           ReplaceFstStateFingerprint<StateId, PrefixId>,\n                           ReplaceFingerprint<StateId, PrefixId>>;\n  using StackPrefix = ReplaceStackPrefix<Label, StateId>;\n  using StackPrefixTable =\n      CompactHashBiTable<PrefixId, StackPrefix,\n                         ReplaceStackPrefixHash<Label, StateId>>;\n\n  VectorHashReplaceStateTable(\n      const std::vector<std::pair<Label, const Fst<Arc> *>> &fst_list,\n      Label root)\n      : root_size_(0) {\n    size_array_.push_back(0);\n    for (const auto &fst_pair : fst_list) {\n      if (fst_pair.first == root) {\n        root_size_ = CountStates(*(fst_pair.second));\n        size_array_.push_back(size_array_.back());\n      } else {\n        size_array_.push_back(size_array_.back() +\n                              CountStates(*(fst_pair.second)));\n      }\n    }\n    state_table_.reset(\n        new StateTable(new ReplaceRootSelector<StateId, PrefixId>,\n                       new ReplaceFstStateFingerprint<StateId, PrefixId>,\n                       new ReplaceFingerprint<StateId, PrefixId>(&size_array_),\n                       root_size_, root_size_ + size_array_.back()));\n  }\n\n  VectorHashReplaceStateTable(\n      const VectorHashReplaceStateTable<Arc, PrefixId> &table)\n      : root_size_(table.root_size_),\n        size_array_(table.size_array_),\n        prefix_table_(table.prefix_table_) {\n    state_table_.reset(\n        new StateTable(new ReplaceRootSelector<StateId, PrefixId>,\n                       new ReplaceFstStateFingerprint<StateId, PrefixId>,\n                       new ReplaceFingerprint<StateId, PrefixId>(&size_array_),\n                       root_size_, root_size_ + size_array_.back()));\n  }\n\n  StateId FindState(const StateTuple &tuple) {\n    return state_table_->FindState(tuple);\n  }\n\n  const StateTuple &Tuple(StateId id) const { return state_table_->Tuple(id); }\n\n  PrefixId FindPrefixId(const StackPrefix &prefix) {\n    return prefix_table_.FindId(prefix);\n  }\n\n  const StackPrefix& GetStackPrefix(PrefixId id) const {\n    return prefix_table_.FindEntry(id);\n  }\n\n private:\n  StateId root_size_;\n  std::vector<uint64_t> size_array_;\n  std::unique_ptr<StateTable> state_table_;\n  StackPrefixTable prefix_table_;\n};\n\n// Default replace state table.\ntemplate <class Arc, class P /* = size_t */>\nclass DefaultReplaceStateTable\n    : public CompactHashStateTable<ReplaceStateTuple<typename Arc::StateId, P>,\n                                   ReplaceHash<typename Arc::StateId, P>> {\n public:\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n\n  using PrefixId = P;\n  using StateTuple = ReplaceStateTuple<StateId, PrefixId>;\n  using StateTable =\n      CompactHashStateTable<StateTuple, ReplaceHash<StateId, PrefixId>>;\n  using StackPrefix = ReplaceStackPrefix<Label, StateId>;\n  using StackPrefixTable =\n      CompactHashBiTable<PrefixId, StackPrefix,\n                         ReplaceStackPrefixHash<Label, StateId>>;\n\n  using StateTable::FindState;\n  using StateTable::Tuple;\n\n  DefaultReplaceStateTable(\n      const std::vector<std::pair<Label, const Fst<Arc> *>> &, Label) {}\n\n  DefaultReplaceStateTable(const DefaultReplaceStateTable<Arc, PrefixId> &table)\n      : StateTable(), prefix_table_(table.prefix_table_) {}\n\n  PrefixId FindPrefixId(const StackPrefix &prefix) {\n    return prefix_table_.FindId(prefix);\n  }\n\n  const StackPrefix &GetStackPrefix(PrefixId id) const {\n    return prefix_table_.FindEntry(id);\n  }\n\n private:\n  StackPrefixTable prefix_table_;\n};\n\n// By default ReplaceFst will copy the input label of the replace arc.\n// The call_label_type and return_label_type options specify how to manage\n// the labels of the call arc and the return arc of the replace FST\ntemplate <class Arc, class StateTable = DefaultReplaceStateTable<Arc>,\n          class CacheStore = DefaultCacheStore<Arc>>\nstruct ReplaceFstOptions : CacheImplOptions<CacheStore> {\n  using Label = typename Arc::Label;\n\n  // Index of root rule for expansion.\n  Label root;\n  // How to label call arc.\n  ReplaceLabelType call_label_type = REPLACE_LABEL_INPUT;\n  // How to label return arc.\n  ReplaceLabelType return_label_type = REPLACE_LABEL_NEITHER;\n  // Specifies output label to put on call arc; if kNoLabel, use existing label\n  // on call arc. Otherwise, use this field as the output label.\n  Label call_output_label = kNoLabel;\n  // Specifies label to put on return arc.\n  Label return_label = 0;\n  // Take ownership of input FSTs?\n  bool take_ownership = false;\n  // Pointer to optional pre-constructed state table.\n  StateTable *state_table = nullptr;\n\n  explicit ReplaceFstOptions(const CacheImplOptions<CacheStore> &opts,\n                             Label root = kNoLabel)\n      : CacheImplOptions<CacheStore>(opts), root(root) {}\n\n  explicit ReplaceFstOptions(const CacheOptions &opts, Label root = kNoLabel)\n      : CacheImplOptions<CacheStore>(opts), root(root) {}\n\n  // FIXME(kbg): There are too many constructors here. Come up with a consistent\n  // position for call_output_label (probably the very end) so that it is\n  // possible to express all the remaining constructors with a single\n  // default-argument constructor. Also move clients off of the \"backwards\n  // compatibility\" constructor, for good.\n\n  explicit ReplaceFstOptions(Label root) : root(root) {}\n\n  explicit ReplaceFstOptions(Label root, ReplaceLabelType call_label_type,\n                             ReplaceLabelType return_label_type,\n                             Label return_label)\n      : root(root),\n        call_label_type(call_label_type),\n        return_label_type(return_label_type),\n        return_label(return_label) {}\n\n  explicit ReplaceFstOptions(Label root, ReplaceLabelType call_label_type,\n                             ReplaceLabelType return_label_type,\n                             Label call_output_label, Label return_label)\n      : root(root),\n        call_label_type(call_label_type),\n        return_label_type(return_label_type),\n        call_output_label(call_output_label),\n        return_label(return_label) {}\n\n  explicit ReplaceFstOptions(const ReplaceUtilOptions &opts)\n      : ReplaceFstOptions(opts.root, opts.call_label_type,\n                          opts.return_label_type, opts.return_label) {}\n\n  ReplaceFstOptions() : root(kNoLabel) {}\n\n  // For backwards compatibility.\n  ReplaceFstOptions(int64_t root, bool epsilon_replace_arc)\n      : root(root),\n        call_label_type(epsilon_replace_arc ? REPLACE_LABEL_NEITHER\n                                            : REPLACE_LABEL_INPUT),\n        call_output_label(epsilon_replace_arc ? 0 : kNoLabel) {}\n};\n\n\n// Forward declaration.\ntemplate <class Arc, class StateTable, class CacheStore>\nclass ReplaceFstMatcher;\n\ntemplate <class Arc>\nusing FstList = std::vector<std::pair<typename Arc::Label, const Fst<Arc> *>>;\n\n// Returns true if label type on arc results in epsilon input label.\ninline bool EpsilonOnInput(ReplaceLabelType label_type) {\n  return label_type == REPLACE_LABEL_NEITHER ||\n         label_type == REPLACE_LABEL_OUTPUT;\n}\n\n// Returns true if label type on arc results in epsilon input label.\ninline bool EpsilonOnOutput(ReplaceLabelType label_type) {\n  return label_type == REPLACE_LABEL_NEITHER ||\n         label_type == REPLACE_LABEL_INPUT;\n}\n\n// Returns true if for either the call or return arc ilabel != olabel.\ntemplate <class Label>\nbool ReplaceTransducer(ReplaceLabelType call_label_type,\n                       ReplaceLabelType return_label_type,\n                       Label call_output_label) {\n  return call_label_type == REPLACE_LABEL_INPUT ||\n         call_label_type == REPLACE_LABEL_OUTPUT ||\n         (call_label_type == REPLACE_LABEL_BOTH &&\n          call_output_label != kNoLabel) ||\n         return_label_type == REPLACE_LABEL_INPUT ||\n         return_label_type == REPLACE_LABEL_OUTPUT;\n}\n\ntemplate <class Arc>\nuint64_t ReplaceFstProperties(typename Arc::Label root_label,\n                            const FstList<Arc> &fst_list,\n                            ReplaceLabelType call_label_type,\n                            ReplaceLabelType return_label_type,\n                            typename Arc::Label call_output_label,\n                            bool *sorted_and_non_empty) {\n  using Label = typename Arc::Label;\n  std::vector<uint64_t> inprops;\n  bool all_ilabel_sorted = true;\n  bool all_olabel_sorted = true;\n  bool all_non_empty = true;\n  // All nonterminals are negative?\n  bool all_negative = true;\n  // All nonterminals are positive and form a dense range containing 1?\n  bool dense_range = true;\n  Label root_fst_idx = 0;\n  for (Label i = 0; i < fst_list.size(); ++i) {\n    const auto label = fst_list[i].first;\n    if (label >= 0) all_negative = false;\n    if (label > fst_list.size() || label <= 0) dense_range = false;\n    if (label == root_label) root_fst_idx = i;\n    const auto *fst = fst_list[i].second;\n    if (fst->Start() == kNoStateId) all_non_empty = false;\n    if (!fst->Properties(kILabelSorted, false)) all_ilabel_sorted = false;\n    if (!fst->Properties(kOLabelSorted, false)) all_olabel_sorted = false;\n    inprops.push_back(fst->Properties(kCopyProperties, false));\n  }\n  const auto props = ReplaceProperties(\n      inprops, root_fst_idx, EpsilonOnInput(call_label_type),\n      EpsilonOnInput(return_label_type), EpsilonOnOutput(call_label_type),\n      EpsilonOnOutput(return_label_type),\n      ReplaceTransducer(call_label_type, return_label_type, call_output_label),\n      all_non_empty, all_ilabel_sorted, all_olabel_sorted,\n      all_negative || dense_range);\n  const bool sorted = props & (kILabelSorted | kOLabelSorted);\n  *sorted_and_non_empty = all_non_empty && sorted;\n  return props;\n}\n\nnamespace internal {\n\n// The replace implementation class supports a dynamic expansion of a recursive\n// transition network represented as label/FST pairs with dynamic replacable\n// arcs.\ntemplate <class Arc, class StateTable, class CacheStore>\nclass ReplaceFstImpl\n    : public CacheBaseImpl<typename CacheStore::State, CacheStore> {\n public:\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using State = typename CacheStore::State;\n  using CacheImpl = CacheBaseImpl<State, CacheStore>;\n  using PrefixId = typename StateTable::PrefixId;\n  using StateTuple = ReplaceStateTuple<StateId, PrefixId>;\n  using StackPrefix = ReplaceStackPrefix<Label, StateId>;\n  using NonTerminalHash = std::unordered_map<Label, Label>;\n\n  using FstImpl<Arc>::SetType;\n  using FstImpl<Arc>::SetProperties;\n  using FstImpl<Arc>::WriteHeader;\n  using FstImpl<Arc>::SetInputSymbols;\n  using FstImpl<Arc>::SetOutputSymbols;\n  using FstImpl<Arc>::InputSymbols;\n  using FstImpl<Arc>::OutputSymbols;\n\n  using CacheImpl::PushArc;\n  using CacheImpl::HasArcs;\n  using CacheImpl::HasFinal;\n  using CacheImpl::HasStart;\n  using CacheImpl::SetArcs;\n  using CacheImpl::SetFinal;\n  using CacheImpl::SetStart;\n\n  friend class ReplaceFstMatcher<Arc, StateTable, CacheStore>;\n\n  ReplaceFstImpl(const FstList<Arc> &fst_list,\n                 const ReplaceFstOptions<Arc, StateTable, CacheStore> &opts)\n      : CacheImpl(opts),\n        call_label_type_(opts.call_label_type),\n        return_label_type_(opts.return_label_type),\n        call_output_label_(opts.call_output_label),\n        return_label_(opts.return_label),\n        state_table_(opts.state_table ? opts.state_table\n                                      : new StateTable(fst_list, opts.root)) {\n    SetType(\"replace\");\n    // If the label is epsilon, then all replace label options are equivalent,\n    // so we set the label types to NEITHER for simplicity.\n    if (call_output_label_ == 0) call_label_type_ = REPLACE_LABEL_NEITHER;\n    if (return_label_ == 0) return_label_type_ = REPLACE_LABEL_NEITHER;\n    if (!fst_list.empty()) {\n      SetInputSymbols(fst_list[0].second->InputSymbols());\n      SetOutputSymbols(fst_list[0].second->OutputSymbols());\n    }\n    fst_array_.push_back(nullptr);\n    for (Label i = 0; i < fst_list.size(); ++i) {\n      const auto label = fst_list[i].first;\n      const auto *fst = fst_list[i].second;\n      nonterminal_hash_[label] = fst_array_.size();\n      nonterminal_set_.insert(label);\n      fst_array_.emplace_back(opts.take_ownership ? fst : fst->Copy());\n      if (i) {\n        if (!CompatSymbols(InputSymbols(), fst->InputSymbols())) {\n          FSTERROR() << \"ReplaceFstImpl: Input symbols of FST \" << i\n                     << \" do not match input symbols of base FST (0th FST)\";\n          SetProperties(kError, kError);\n        }\n        if (!CompatSymbols(OutputSymbols(), fst->OutputSymbols())) {\n          FSTERROR() << \"ReplaceFstImpl: Output symbols of FST \" << i\n                     << \" do not match output symbols of base FST (0th FST)\";\n          SetProperties(kError, kError);\n        }\n      }\n    }\n    const auto nonterminal = nonterminal_hash_[opts.root];\n    if ((nonterminal == 0) && (fst_array_.size() > 1)) {\n      FSTERROR() << \"ReplaceFstImpl: No FST corresponding to root label \"\n                 << opts.root << \" in the input tuple vector\";\n      SetProperties(kError, kError);\n    }\n    root_ = (nonterminal > 0) ? nonterminal : 1;\n    bool all_non_empty_and_sorted = false;\n    SetProperties(ReplaceFstProperties(opts.root, fst_list, call_label_type_,\n                                       return_label_type_, call_output_label_,\n                                       &all_non_empty_and_sorted));\n    // Enables optional caching as long as sorted and all non-empty.\n    always_cache_ = !all_non_empty_and_sorted;\n    VLOG(2) << \"ReplaceFstImpl::ReplaceFstImpl: always_cache = \"\n            << (always_cache_ ? \"true\" : \"false\");\n  }\n\n  ReplaceFstImpl(const ReplaceFstImpl &impl)\n      : CacheImpl(impl),\n        call_label_type_(impl.call_label_type_),\n        return_label_type_(impl.return_label_type_),\n        call_output_label_(impl.call_output_label_),\n        return_label_(impl.return_label_),\n        always_cache_(impl.always_cache_),\n        state_table_(new StateTable(*(impl.state_table_))),\n        nonterminal_set_(impl.nonterminal_set_),\n        nonterminal_hash_(impl.nonterminal_hash_),\n        root_(impl.root_) {\n    SetType(\"replace\");\n    SetProperties(impl.Properties(), kCopyProperties);\n    SetInputSymbols(impl.InputSymbols());\n    SetOutputSymbols(impl.OutputSymbols());\n    fst_array_.reserve(impl.fst_array_.size());\n    fst_array_.emplace_back(nullptr);\n    for (Label i = 1; i < impl.fst_array_.size(); ++i) {\n      fst_array_.emplace_back(impl.fst_array_[i]->Copy(true));\n    }\n  }\n\n  // Computes the dependency graph of the replace class and returns\n  // true if the dependencies are cyclic. Cyclic dependencies will result\n  // in an un-expandable FST.\n  bool CyclicDependencies() const {\n    const ReplaceUtilOptions opts(root_);\n    ReplaceUtil<Arc> replace_util(fst_array_, nonterminal_hash_, opts);\n    return replace_util.CyclicDependencies();\n  }\n\n  StateId Start() {\n    if (!HasStart()) {\n      if (fst_array_.size() == 1) {\n        SetStart(kNoStateId);\n        return kNoStateId;\n      } else {\n        const auto fst_start = fst_array_[root_]->Start();\n        if (fst_start == kNoStateId) return kNoStateId;\n        const auto prefix = GetPrefixId(StackPrefix());\n        const auto start =\n            state_table_->FindState(StateTuple(prefix, root_, fst_start));\n        SetStart(start);\n        return start;\n      }\n    } else {\n      return CacheImpl::Start();\n    }\n  }\n\n  Weight Final(StateId s) {\n    if (HasFinal(s)) return CacheImpl::Final(s);\n    const auto &tuple = state_table_->Tuple(s);\n    auto weight = Weight::Zero();\n    if (tuple.prefix_id == 0) {\n      const auto fst_state = tuple.fst_state;\n      weight = fst_array_[tuple.fst_id]->Final(fst_state);\n    }\n    if (always_cache_ || HasArcs(s)) SetFinal(s, weight);\n    return weight;\n  }\n\n  size_t NumArcs(StateId s) {\n    if (HasArcs(s)) {\n      return CacheImpl::NumArcs(s);\n    } else if (always_cache_) {  // If always caching, expands and caches state.\n      Expand(s);\n      return CacheImpl::NumArcs(s);\n    } else {  // Otherwise computes the number of arcs without expanding.\n      const auto tuple = state_table_->Tuple(s);\n      if (tuple.fst_state == kNoStateId) return 0;\n      auto num_arcs = fst_array_[tuple.fst_id]->NumArcs(tuple.fst_state);\n      if (ComputeFinalArc(tuple, nullptr)) ++num_arcs;\n      return num_arcs;\n    }\n  }\n\n  // Returns whether a given label is a non-terminal.\n  bool IsNonTerminal(Label label) const {\n    if (label < *nonterminal_set_.begin() ||\n        label > *nonterminal_set_.rbegin()) {\n      return false;\n    } else {\n      return nonterminal_hash_.count(label);\n    }\n    // TODO(allauzen): be smarter and take advantage of all_dense or\n    // all_negative. Also use this in ComputeArc. This would require changes to\n    // Replace so that recursing into an empty FST lead to a non co-accessible\n    // state instead of deleting the arc as done currently. The current use\n    // correct, since labels are sorted if all_non_empty is true.\n  }\n\n  size_t NumInputEpsilons(StateId s) {\n    if (HasArcs(s)) {\n      return CacheImpl::NumInputEpsilons(s);\n    } else if (always_cache_ || !Properties(kILabelSorted)) {\n      // If always caching or if the number of input epsilons is too expensive\n      // to compute without caching (i.e., not ilabel-sorted), then expands and\n      // caches state.\n      Expand(s);\n      return CacheImpl::NumInputEpsilons(s);\n    } else {\n      // Otherwise, computes the number of input epsilons without caching.\n      const auto tuple = state_table_->Tuple(s);\n      if (tuple.fst_state == kNoStateId) return 0;\n      size_t num = 0;\n      if (!EpsilonOnInput(call_label_type_)) {\n        // If EpsilonOnInput(c) is false, all input epsilon arcs\n        // are also input epsilons arcs in the underlying machine.\n        num = fst_array_[tuple.fst_id]->NumInputEpsilons(tuple.fst_state);\n      } else {\n        // Otherwise, one need to consider that all non-terminal arcs\n        // in the underlying machine also become input epsilon arc.\n        ArcIterator<Fst<Arc>> aiter(*fst_array_[tuple.fst_id], tuple.fst_state);\n        for (; !aiter.Done() && ((aiter.Value().ilabel == 0) ||\n                                 IsNonTerminal(aiter.Value().olabel));\n             aiter.Next()) {\n          ++num;\n        }\n      }\n      if (EpsilonOnInput(return_label_type_) &&\n          ComputeFinalArc(tuple, nullptr)) {\n        ++num;\n      }\n      return num;\n    }\n  }\n\n  size_t NumOutputEpsilons(StateId s) {\n    if (HasArcs(s)) {\n      return CacheImpl::NumOutputEpsilons(s);\n    } else if (always_cache_ || !Properties(kOLabelSorted)) {\n      // If always caching or if the number of output epsilons is too expensive\n      // to compute without caching (i.e., not olabel-sorted), then expands and\n      // caches state.\n      Expand(s);\n      return CacheImpl::NumOutputEpsilons(s);\n    } else {\n      // Otherwise, computes the number of output epsilons without caching.\n      const auto tuple = state_table_->Tuple(s);\n      if (tuple.fst_state == kNoStateId) return 0;\n      size_t num = 0;\n      if (!EpsilonOnOutput(call_label_type_)) {\n        // If EpsilonOnOutput(c) is false, all output epsilon arcs are also\n        // output epsilons arcs in the underlying machine.\n        num = fst_array_[tuple.fst_id]->NumOutputEpsilons(tuple.fst_state);\n      } else {\n        // Otherwise, one need to consider that all non-terminal arcs in the\n        // underlying machine also become output epsilon arc.\n        ArcIterator<Fst<Arc>> aiter(*fst_array_[tuple.fst_id], tuple.fst_state);\n        for (; !aiter.Done() && ((aiter.Value().olabel == 0) ||\n                                 IsNonTerminal(aiter.Value().olabel));\n             aiter.Next()) {\n          ++num;\n        }\n      }\n      if (EpsilonOnOutput(return_label_type_) &&\n          ComputeFinalArc(tuple, nullptr)) {\n        ++num;\n      }\n      return num;\n    }\n  }\n\n  uint64_t Properties() const override { return Properties(kFstProperties); }\n\n  // Sets error if found, and returns other FST impl properties.\n  uint64_t Properties(uint64_t mask) const override {\n    if (mask & kError) {\n      for (Label i = 1; i < fst_array_.size(); ++i) {\n        if (fst_array_[i]->Properties(kError, false)) {\n          SetProperties(kError, kError);\n        }\n      }\n    }\n    return FstImpl<Arc>::Properties(mask);\n  }\n\n  // Returns the base arc iterator, and if arcs have not been computed yet,\n  // extends and recurses for new arcs.\n  void InitArcIterator(StateId s, ArcIteratorData<Arc> *data) {\n    if (!HasArcs(s)) Expand(s);\n    CacheImpl::InitArcIterator(s, data);\n    // TODO(allauzen): Set behaviour of generic iterator.\n    // Warning: ArcIterator<ReplaceFst<A>>::InitCache() relies on current\n    // behaviour.\n  }\n\n  // Extends current state (walk arcs one level deep).\n  void Expand(StateId s) {\n    const auto tuple = state_table_->Tuple(s);\n    if (tuple.fst_state == kNoStateId) {  // Local FST is empty.\n      SetArcs(s);\n      return;\n    }\n    ArcIterator<Fst<Arc>> aiter(*fst_array_[tuple.fst_id], tuple.fst_state);\n    Arc arc;\n    // Creates a final arc when needed.\n    if (ComputeFinalArc(tuple, &arc)) PushArc(s, arc);\n    // Expands all arcs leaving the state.\n    for (; !aiter.Done(); aiter.Next()) {\n      if (ComputeArc(tuple, aiter.Value(), &arc)) PushArc(s, arc);\n    }\n    SetArcs(s);\n  }\n\n  void Expand(StateId s, const StateTuple &tuple,\n              const ArcIteratorData<Arc> &data) {\n    if (tuple.fst_state == kNoStateId) {  // Local FST is empty.\n      SetArcs(s);\n      return;\n    }\n    ArcIterator<Fst<Arc>> aiter(data);\n    Arc arc;\n    // Creates a final arc when needed.\n    if (ComputeFinalArc(tuple, &arc)) AddArc(s, arc);\n    // Expands all arcs leaving the state.\n    for (; !aiter.Done(); aiter.Next()) {\n      if (ComputeArc(tuple, aiter.Value(), &arc)) AddArc(s, arc);\n    }\n    SetArcs(s);\n  }\n\n  // If acpp is null, only returns true if a final arcp is required, but does\n  // not actually compute it.\n  bool ComputeFinalArc(const StateTuple &tuple, Arc *arcp,\n                       uint32_t flags = kArcValueFlags) {\n    const auto fst_state = tuple.fst_state;\n    if (fst_state == kNoStateId) return false;\n    // If state is final, pops the stack.\n    if (fst_array_[tuple.fst_id]->Final(fst_state) != Weight::Zero() &&\n        tuple.prefix_id) {\n      if (arcp) {\n        arcp->ilabel = (EpsilonOnInput(return_label_type_)) ? 0 : return_label_;\n        arcp->olabel =\n            (EpsilonOnOutput(return_label_type_)) ? 0 : return_label_;\n        if (flags & kArcNextStateValue) {\n          const auto &stack = state_table_->GetStackPrefix(tuple.prefix_id);\n          const auto prefix_id = PopPrefix(stack);\n          const auto &top = stack.Top();\n          arcp->nextstate = state_table_->FindState(\n              StateTuple(prefix_id, top.fst_id, top.nextstate));\n        }\n        if (flags & kArcWeightValue) {\n          arcp->weight = fst_array_[tuple.fst_id]->Final(fst_state);\n        }\n      }\n      return true;\n    } else {\n      return false;\n    }\n  }\n\n  // Computes an arc in the FST corresponding to one in the underlying machine.\n  // Returns false if the underlying arc corresponds to no arc in the resulting\n  // FST.\n  bool ComputeArc(const StateTuple &tuple, const Arc &arc, Arc *arcp,\n                  uint32_t flags = kArcValueFlags) {\n    if (!EpsilonOnInput(call_label_type_) &&\n        (flags == (flags & (kArcILabelValue | kArcWeightValue)))) {\n      *arcp = arc;\n      return true;\n    }\n    if (arc.olabel == 0 || arc.olabel < *nonterminal_set_.begin() ||\n        arc.olabel > *nonterminal_set_.rbegin()) {  // Expands local FST.\n      const auto nextstate =\n          flags & kArcNextStateValue\n              ? state_table_->FindState(\n                    StateTuple(tuple.prefix_id, tuple.fst_id, arc.nextstate))\n              : kNoStateId;\n      *arcp = Arc(arc.ilabel, arc.olabel, arc.weight, nextstate);\n    } else {\n      // Checks for non-terminal.\n      const auto it = nonterminal_hash_.find(arc.olabel);\n      if (it != nonterminal_hash_.end()) {  // Recurses into non-terminal.\n        const auto nonterminal = it->second;\n        const auto nt_prefix =\n            PushPrefix(state_table_->GetStackPrefix(tuple.prefix_id),\n                       tuple.fst_id, arc.nextstate);\n        // If the start state is valid, replace; othewise, the arc is implicitly\n        // deleted.\n        const auto nt_start = fst_array_[nonterminal]->Start();\n        if (nt_start != kNoStateId) {\n          const auto nt_nextstate = flags & kArcNextStateValue\n                                        ? state_table_->FindState(StateTuple(\n                                              nt_prefix, nonterminal, nt_start))\n                                        : kNoStateId;\n          const auto ilabel =\n              (EpsilonOnInput(call_label_type_)) ? 0 : arc.ilabel;\n          const auto olabel =\n              (EpsilonOnOutput(call_label_type_))\n                  ? 0\n                  : ((call_output_label_ == kNoLabel) ? arc.olabel\n                                                      : call_output_label_);\n          *arcp = Arc(ilabel, olabel, arc.weight, nt_nextstate);\n        } else {\n          return false;\n        }\n      } else {\n        const auto nextstate =\n            flags & kArcNextStateValue\n                ? state_table_->FindState(\n                      StateTuple(tuple.prefix_id, tuple.fst_id, arc.nextstate))\n                : kNoStateId;\n        *arcp = Arc(arc.ilabel, arc.olabel, arc.weight, nextstate);\n      }\n    }\n    return true;\n  }\n\n  // Returns the arc iterator flags supported by this FST.\n  uint32_t ArcIteratorFlags() const {\n    uint32_t flags = kArcValueFlags;\n    if (!always_cache_) flags |= kArcNoCache;\n    return flags;\n  }\n\n  StateTable *GetStateTable() const { return state_table_.get(); }\n\n  const Fst<Arc> *GetFst(Label fst_id) const {\n    return fst_array_[fst_id].get();\n  }\n\n  Label GetFstId(Label nonterminal) const {\n    const auto it = nonterminal_hash_.find(nonterminal);\n    if (it == nonterminal_hash_.end()) {\n      FSTERROR() << \"ReplaceFstImpl::GetFstId: Nonterminal not found: \"\n                 << nonterminal;\n    }\n    return it->second;\n  }\n\n  // Returns true if label type on call arc results in epsilon input label.\n  bool EpsilonOnCallInput() { return EpsilonOnInput(call_label_type_); }\n\n private:\n  // The unique index into stack prefix table.\n  PrefixId GetPrefixId(const StackPrefix &prefix) {\n    return state_table_->FindPrefixId(prefix);\n  }\n\n  // The prefix ID after a stack pop.\n  PrefixId PopPrefix(StackPrefix prefix) {\n    prefix.Pop();\n    return GetPrefixId(prefix);\n  }\n\n  // The prefix ID after a stack push.\n  PrefixId PushPrefix(StackPrefix prefix, Label fst_id, StateId nextstate) {\n    prefix.Push(fst_id, nextstate);\n    return GetPrefixId(prefix);\n  }\n\n  // Runtime options\n  ReplaceLabelType call_label_type_;    // How to label call arc.\n  ReplaceLabelType return_label_type_;  // How to label return arc.\n  int64_t call_output_label_;  // Specifies output label to put on call arc\n  int64_t return_label_;       // Specifies label to put on return arc.\n  bool always_cache_;        // Disable optional caching of arc iterator?\n\n  // State table.\n  std::unique_ptr<StateTable> state_table_;\n\n  // Replace components.\n  std::set<Label> nonterminal_set_;\n  NonTerminalHash nonterminal_hash_;\n  std::vector<std::unique_ptr<const Fst<Arc>>> fst_array_;\n  Label root_;\n};\n\n}  // namespace internal\n\n//\n// ReplaceFst supports dynamic replacement of arcs in one FST with another FST.\n// This replacement is recursive. ReplaceFst can be used to support a variety of\n// delayed constructions such as recursive\n// transition networks, union, or closure. It is constructed with an array of\n// FST(s). One FST represents the root (or topology) machine. The root FST\n// refers to other FSTs by recursively replacing arcs labeled as non-terminals\n// with the matching non-terminal FST. Currently the ReplaceFst uses the output\n// symbols of the arcs to determine whether the arc is a non-terminal arc or\n// not. A non-terminal can be any label that is not a non-zero terminal label in\n// the output alphabet.\n//\n// Note that the constructor uses a vector of pairs. These correspond to the\n// tuple of non-terminal Label and corresponding FST. For example to implement\n// the closure operation we need 2 FSTs. The first root FST is a single\n// self-loop arc on the start state.\n//\n// The ReplaceFst class supports an optionally caching arc iterator.\n//\n// The ReplaceFst needs to be built such that it is known to be ilabel- or\n// olabel-sorted (see usage below).\n//\n// Observe that Matcher<Fst<A>> will use the optionally caching arc iterator\n// when available (the FST is ilabel-sorted and matching on the input, or the\n// FST is olabel -orted and matching on the output).  In order to obtain the\n// most efficient behaviour, it is recommended to set call_label_type to\n// REPLACE_LABEL_INPUT or REPLACE_LABEL_BOTH and return_label_type to\n// REPLACE_LABEL_OUTPUT or REPLACE_LABEL_NEITHER. This means that the call arc\n// does not have epsilon on the input side and the return arc has epsilon on the\n// input side) and matching on the input side.\n//\n// This class attaches interface to implementation and handles reference\n// counting, delegating most methods to ImplToFst.\ntemplate <class A, class T /* = DefaultReplaceStateTable<A> */,\n          class CacheStore /* = DefaultCacheStore<A> */>\nclass ReplaceFst\n    : public ImplToFst<internal::ReplaceFstImpl<A, T, CacheStore>> {\n public:\n  using Arc = A;\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using StateTable = T;\n  using Store = CacheStore;\n  using State = typename CacheStore::State;\n  using Impl = internal::ReplaceFstImpl<Arc, StateTable, CacheStore>;\n  using CacheImpl = internal::CacheBaseImpl<State, CacheStore>;\n\n  using ImplToFst<Impl>::Properties;\n\n  friend class ArcIterator<ReplaceFst<Arc, StateTable, CacheStore>>;\n  friend class StateIterator<ReplaceFst<Arc, StateTable, CacheStore>>;\n  friend class ReplaceFstMatcher<Arc, StateTable, CacheStore>;\n\n  ReplaceFst(const std::vector<std::pair<Label, const Fst<Arc> *>> &fst_array,\n             Label root)\n      : ImplToFst<Impl>(std::make_shared<Impl>(\n            fst_array, ReplaceFstOptions<Arc, StateTable, CacheStore>(root))) {}\n\n  ReplaceFst(const std::vector<std::pair<Label, const Fst<Arc> *>> &fst_array,\n             const ReplaceFstOptions<Arc, StateTable, CacheStore> &opts)\n      : ImplToFst<Impl>(std::make_shared<Impl>(fst_array, opts)) {}\n\n  // See Fst<>::Copy() for doc.\n  ReplaceFst(const ReplaceFst<Arc, StateTable, CacheStore> &fst,\n             bool safe = false)\n      : ImplToFst<Impl>(fst, safe) {}\n\n  // Get a copy of this ReplaceFst. See Fst<>::Copy() for further doc.\n  ReplaceFst<Arc, StateTable, CacheStore> *Copy(\n      bool safe = false) const override {\n    return new ReplaceFst<Arc, StateTable, CacheStore>(*this, safe);\n  }\n\n  inline void InitStateIterator(StateIteratorData<Arc> *data) const override;\n\n  void InitArcIterator(StateId s, ArcIteratorData<Arc> *data) const override {\n    GetMutableImpl()->InitArcIterator(s, data);\n  }\n\n  MatcherBase<Arc> *InitMatcher(MatchType match_type) const override {\n    if ((GetImpl()->ArcIteratorFlags() & kArcNoCache) &&\n        ((match_type == MATCH_INPUT && Properties(kILabelSorted, false)) ||\n         (match_type == MATCH_OUTPUT && Properties(kOLabelSorted, false)))) {\n      return new ReplaceFstMatcher<Arc, StateTable, CacheStore>\n          (this, match_type);\n    } else {\n      VLOG(2) << \"Not using replace matcher\";\n      return nullptr;\n    }\n  }\n\n  bool CyclicDependencies() const { return GetImpl()->CyclicDependencies(); }\n\n  const StateTable &GetStateTable() const {\n    return *GetImpl()->GetStateTable();\n  }\n\n  const Fst<Arc> &GetFst(Label nonterminal) const {\n    return *GetImpl()->GetFst(GetImpl()->GetFstId(nonterminal));\n  }\n\n private:\n  using ImplToFst<Impl>::GetImpl;\n  using ImplToFst<Impl>::GetMutableImpl;\n\n  ReplaceFst &operator=(const ReplaceFst &) = delete;\n};\n\n// Specialization for ReplaceFst.\ntemplate <class Arc, class StateTable, class CacheStore>\nclass StateIterator<ReplaceFst<Arc, StateTable, CacheStore>>\n    : public CacheStateIterator<ReplaceFst<Arc, StateTable, CacheStore>> {\n public:\n  explicit StateIterator(const ReplaceFst<Arc, StateTable, CacheStore> &fst)\n      : CacheStateIterator<ReplaceFst<Arc, StateTable, CacheStore>>(\n            fst, fst.GetMutableImpl()) {}\n};\n\n// Specialization for ReplaceFst, implementing optional caching. It is be used\n// as follows:\n//\n//   ReplaceFst<A> replace;\n//   ArcIterator<ReplaceFst<A>> aiter(replace, s);\n//   // Note: ArcIterator< Fst<A>> is always a caching arc iterator.\n//   aiter.SetFlags(kArcNoCache, kArcNoCache);\n//   // Uses the arc iterator, no arc will be cached, no state will be expanded.\n//   // Arc flags can be used to decide which component of the arc need to be\n//   computed.\n//   aiter.SetFlags(kArcILabelValue, kArcValueFlags);\n//   // Wants the ilabel for this arc.\n//   aiter.Value();  // Does not compute the destination state.\n//   aiter.Next();\n//   aiter.SetFlags(kArcNextStateValue, kArcNextStateValue);\n//   // Wants the ilabel and next state for this arc.\n//   aiter.Value();  // Does compute the destination state and inserts it\n//                   // in the replace state table.\n//   // No additional arcs have been cached at this point.\ntemplate <class Arc, class StateTable, class CacheStore>\nclass ArcIterator<ReplaceFst<Arc, StateTable, CacheStore>> {\n public:\n  using StateId = typename Arc::StateId;\n\n  using StateTuple = typename StateTable::StateTuple;\n\n  ArcIterator(const ReplaceFst<Arc, StateTable, CacheStore> &fst, StateId s)\n      : fst_(fst),\n        s_(s),\n        pos_(0),\n        offset_(0),\n        flags_(kArcValueFlags),\n        arcs_(nullptr),\n        data_flags_(0),\n        final_flags_(0) {\n    cache_data_.ref_count = nullptr;\n    local_data_.ref_count = nullptr;\n    // If FST does not support optional caching, forces caching.\n    if (!(fst_.GetImpl()->ArcIteratorFlags() & kArcNoCache) &&\n        !(fst_.GetImpl()->HasArcs(s_))) {\n      fst_.GetMutableImpl()->Expand(s_);\n    }\n    // If state is already cached, use cached arcs array.\n    if (fst_.GetImpl()->HasArcs(s_)) {\n      (fst_.GetImpl())\n          ->internal::template CacheBaseImpl<\n              typename CacheStore::State,\n              CacheStore>::InitArcIterator(s_, &cache_data_);\n      num_arcs_ = cache_data_.narcs;\n      arcs_ = cache_data_.arcs;      // arcs_ is a pointer to the cached arcs.\n      data_flags_ = kArcValueFlags;  // All the arc member values are valid.\n    } else {  // Otherwise delay decision until Value() is called.\n      tuple_ = fst_.GetImpl()->GetStateTable()->Tuple(s_);\n      if (tuple_.fst_state == kNoStateId) {\n        num_arcs_ = 0;\n      } else {\n        // The decision to cache or not to cache has been defered until Value()\n        // or\n        // SetFlags() is called. However, the arc iterator is set up now to be\n        // ready for non-caching in order to keep the Value() method simple and\n        // efficient.\n        const auto *rfst = fst_.GetImpl()->GetFst(tuple_.fst_id);\n        rfst->InitArcIterator(tuple_.fst_state, &local_data_);\n        // arcs_ is a pointer to the arcs in the underlying machine.\n        arcs_ = local_data_.arcs;\n        // Computes the final arc (but not its destination state) if a final arc\n        // is required.\n        bool has_final_arc = fst_.GetMutableImpl()->ComputeFinalArc(\n            tuple_, &final_arc_, kArcValueFlags & ~kArcNextStateValue);\n        // Sets the arc value flags that hold for final_arc_.\n        final_flags_ = kArcValueFlags & ~kArcNextStateValue;\n        // Computes the number of arcs.\n        num_arcs_ = local_data_.narcs;\n        if (has_final_arc) ++num_arcs_;\n        // Sets the offset between the underlying arc positions and the\n        // positions\n        // in the arc iterator.\n        offset_ = num_arcs_ - local_data_.narcs;\n        // Defers the decision to cache or not until Value() or SetFlags() is\n        // called.\n        data_flags_ = 0;\n      }\n    }\n  }\n\n  ~ArcIterator() {\n    if (cache_data_.ref_count) --(*cache_data_.ref_count);\n    if (local_data_.ref_count) --(*local_data_.ref_count);\n  }\n\n  void ExpandAndCache() const  {\n    // TODO(allauzen): revisit this.\n    // fst_.GetImpl()->Expand(s_, tuple_, local_data_);\n    // (fst_.GetImpl())->CacheImpl<A>*>::InitArcIterator(s_,\n    //                                               &cache_data_);\n    //\n    fst_.InitArcIterator(s_, &cache_data_);  // Expand and cache state.\n    arcs_ = cache_data_.arcs;      // arcs_ is a pointer to the cached arcs.\n    data_flags_ = kArcValueFlags;  // All the arc member values are valid.\n    offset_ = 0;                   // No offset.\n  }\n\n  void Init() {\n    if (flags_ & kArcNoCache) {  // If caching is disabled\n      // arcs_ is a pointer to the arcs in the underlying machine.\n      arcs_ = local_data_.arcs;\n      // Sets the arcs value flags that hold for arcs_.\n      data_flags_ = kArcWeightValue;\n      if (!fst_.GetMutableImpl()->EpsilonOnCallInput()) {\n        data_flags_ |= kArcILabelValue;\n      }\n      // Sets the offset between the underlying arc positions and the positions\n      // in the arc iterator.\n      offset_ = num_arcs_ - local_data_.narcs;\n    } else {\n      ExpandAndCache();\n    }\n  }\n\n  bool Done() const { return pos_ >= num_arcs_; }\n\n  const Arc &Value() const {\n    // If data_flags_ is 0, non-caching was not requested.\n    if (!data_flags_) {\n      // TODO(allauzen): Revisit this.\n      if (flags_ & kArcNoCache) {\n        // Should never happen.\n        FSTERROR() << \"ReplaceFst: Inconsistent arc iterator flags\";\n      }\n      ExpandAndCache();\n    }\n    if (pos_ - offset_ >= 0) {  // The requested arc is not the final arc.\n      const auto &arc = arcs_[pos_ - offset_];\n      if ((data_flags_ & flags_) == (flags_ & kArcValueFlags)) {\n        // If the value flags match the recquired value flags then returns the\n        // arc.\n        return arc;\n      } else {\n        // Otherwise, compute the corresponding arc on-the-fly.\n        fst_.GetMutableImpl()->ComputeArc(tuple_, arc, &arc_,\n                                          flags_ & kArcValueFlags);\n        return arc_;\n      }\n    } else {  // The requested arc is the final arc.\n      if ((final_flags_ & flags_) != (flags_ & kArcValueFlags)) {\n        // If the arc value flags that hold for the final arc do not match the\n        // requested value flags, then\n        // final_arc_ needs to be updated.\n        fst_.GetMutableImpl()->ComputeFinalArc(tuple_, &final_arc_,\n                                               flags_ & kArcValueFlags);\n        final_flags_ = flags_ & kArcValueFlags;\n      }\n      return final_arc_;\n    }\n  }\n\n  void Next() { ++pos_; }\n\n  size_t Position() const { return pos_; }\n\n  void Reset() { pos_ = 0; }\n\n  void Seek(size_t pos) { pos_ = pos; }\n\n  uint32_t Flags() const { return flags_; }\n\n  void SetFlags(uint32_t flags, uint32_t mask) {\n    // Updates the flags taking into account what flags are supported\n    // by the FST.\n    flags_ &= ~mask;\n    flags_ |= (flags & fst_.GetImpl()->ArcIteratorFlags());\n    // If non-caching is not requested (and caching has not already been\n    // performed), then flush data_flags_ to request caching during the next\n    // call to Value().\n    if (!(flags_ & kArcNoCache) && data_flags_ != kArcValueFlags) {\n      if (!fst_.GetImpl()->HasArcs(s_)) data_flags_ = 0;\n    }\n    // If data_flags_ has been flushed but non-caching is requested before\n    // calling Value(), then set up the iterator for non-caching.\n    if ((flags & kArcNoCache) && (!data_flags_)) Init();\n  }\n\n private:\n  const ReplaceFst<Arc, StateTable, CacheStore> &fst_;  // Reference to the FST.\n  StateId s_;                                           // State in the FST.\n  mutable StateTuple tuple_;  // Tuple corresponding to state_.\n\n  std::ptrdiff_t pos_;             // Current position.\n  mutable std::ptrdiff_t offset_;  // Offset between position in iterator and in arcs_.\n  std::ptrdiff_t num_arcs_;        // Number of arcs at state_.\n  uint32_t flags_;            // Behavorial flags for the arc iterator\n  mutable Arc arc_;         // Memory to temporarily store computed arcs.\n\n  mutable ArcIteratorData<Arc> cache_data_;  // Arc iterator data in cache.\n  mutable ArcIteratorData<Arc> local_data_;  // Arc iterator data in local FST.\n\n  mutable const Arc *arcs_;     // Array of arcs.\n  mutable uint32_t data_flags_;   // Arc value flags valid for data in arcs_.\n  mutable Arc final_arc_;       // Final arc (when required).\n  mutable uint32_t final_flags_;  // Arc value flags valid for final_arc_.\n\n  ArcIterator(const ArcIterator &) = delete;\n  ArcIterator &operator=(const ArcIterator &) = delete;\n};\n\ntemplate <class Arc, class StateTable, class CacheStore>\nclass ReplaceFstMatcher : public MatcherBase<Arc> {\n public:\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using FST = ReplaceFst<Arc, StateTable, CacheStore>;\n  using LocalMatcher = MultiEpsMatcher<Matcher<Fst<Arc>>>;\n\n  using StateTuple = typename StateTable::StateTuple;\n\n  // This makes a copy of the FST.\n  ReplaceFstMatcher(const ReplaceFst<Arc, StateTable, CacheStore> &fst,\n                    MatchType match_type)\n      : owned_fst_(fst.Copy()),\n        fst_(*owned_fst_),\n        impl_(fst_.GetMutableImpl()),\n        s_(fst::kNoStateId),\n        match_type_(match_type),\n        current_loop_(false),\n        final_arc_(false),\n        loop_(kNoLabel, 0, Weight::One(), kNoStateId) {\n    if (match_type_ == fst::MATCH_OUTPUT) {\n      std::swap(loop_.ilabel, loop_.olabel);\n    }\n    InitMatchers();\n  }\n\n  // This doesn't copy the FST.\n  ReplaceFstMatcher(const ReplaceFst<Arc, StateTable, CacheStore> *fst,\n                    MatchType match_type)\n      : fst_(*fst),\n        impl_(fst_.GetMutableImpl()),\n        s_(fst::kNoStateId),\n        match_type_(match_type),\n        current_loop_(false),\n        final_arc_(false),\n        loop_(kNoLabel, 0, Weight::One(), kNoStateId) {\n    if (match_type_ == fst::MATCH_OUTPUT) {\n      std::swap(loop_.ilabel, loop_.olabel);\n    }\n    InitMatchers();\n  }\n\n  // This makes a copy of the FST.\n  ReplaceFstMatcher(\n      const ReplaceFstMatcher<Arc, StateTable, CacheStore> &matcher,\n      bool safe = false)\n      : owned_fst_(matcher.fst_.Copy(safe)),\n        fst_(*owned_fst_),\n        impl_(fst_.GetMutableImpl()),\n        s_(fst::kNoStateId),\n        match_type_(matcher.match_type_),\n        current_loop_(false),\n        final_arc_(false),\n        loop_(fst::kNoLabel, 0, Weight::One(), fst::kNoStateId) {\n    if (match_type_ == fst::MATCH_OUTPUT) {\n      std::swap(loop_.ilabel, loop_.olabel);\n    }\n    InitMatchers();\n  }\n\n  // Creates a local matcher for each component FST in the RTN. LocalMatcher is\n  // a multi-epsilon wrapper matcher. MultiEpsilonMatcher is used to match each\n  // non-terminal arc, since these non-terminal\n  // turn into epsilons on recursion.\n  void InitMatchers() {\n    const auto &fst_array = impl_->fst_array_;\n    matcher_.resize(fst_array.size());\n    for (Label i = 0; i < fst_array.size(); ++i) {\n      if (fst_array[i]) {\n        matcher_[i].reset(\n            new LocalMatcher(*fst_array[i], match_type_, kMultiEpsList));\n        auto it = impl_->nonterminal_set_.begin();\n        for (; it != impl_->nonterminal_set_.end(); ++it) {\n          matcher_[i]->AddMultiEpsLabel(*it);\n        }\n      }\n    }\n  }\n\n  ReplaceFstMatcher<Arc, StateTable, CacheStore> *Copy(\n      bool safe = false) const override {\n    return new ReplaceFstMatcher<Arc, StateTable, CacheStore>(*this, safe);\n  }\n\n  MatchType Type(bool test) const override {\n    if (match_type_ == MATCH_NONE) return match_type_;\n    const auto true_prop =\n        match_type_ == MATCH_INPUT ? kILabelSorted : kOLabelSorted;\n    const auto false_prop =\n        match_type_ == MATCH_INPUT ? kNotILabelSorted : kNotOLabelSorted;\n    const auto props = fst_.Properties(true_prop | false_prop, test);\n    if (props & true_prop) {\n      return match_type_;\n    } else if (props & false_prop) {\n      return MATCH_NONE;\n    } else {\n      return MATCH_UNKNOWN;\n    }\n  }\n\n  const Fst<Arc> &GetFst() const override { return fst_; }\n\n  uint64_t Properties(uint64_t props) const override { return props; }\n\n  // Sets the state from which our matching happens.\n  void SetState(StateId s) final {\n    if (s_ == s) return;\n    s_ = s;\n    tuple_ = impl_->GetStateTable()->Tuple(s_);\n    if (tuple_.fst_state == kNoStateId) {\n      done_ = true;\n      return;\n    }\n    // Gets current matcher, used for non-epsilon matching.\n    current_matcher_ = matcher_[tuple_.fst_id].get();\n    current_matcher_->SetState(tuple_.fst_state);\n    loop_.nextstate = s_;\n    final_arc_ = false;\n  }\n\n  // Searches for label from previous set state. If label == 0, first\n  // hallucinate an epsilon loop; otherwise use the underlying matcher to\n  // search for the label or epsilons. Note since the ReplaceFst recursion\n  // on non-terminal arcs causes epsilon transitions to be created we use\n  // MultiEpsilonMatcher to search for possible matches of non-terminals. If the\n  // component FST\n  // reaches a final state we also need to add the exiting final arc.\n  bool Find(Label label) final {\n    bool found = false;\n    label_ = label;\n    if (label_ == 0 || label_ == kNoLabel) {\n      // Computes loop directly, avoiding Replace::ComputeArc.\n      if (label_ == 0) {\n        current_loop_ = true;\n        found = true;\n      }\n      // Searches for matching multi-epsilons.\n      final_arc_ = impl_->ComputeFinalArc(tuple_, nullptr);\n      found = current_matcher_->Find(kNoLabel) || final_arc_ || found;\n    } else {\n      // Searches on a sub machine directly using sub machine matcher.\n      found = current_matcher_->Find(label_);\n    }\n    return found;\n  }\n\n  bool Done() const final {\n    return !current_loop_ && !final_arc_ && current_matcher_->Done();\n  }\n\n  const Arc &Value() const final {\n    if (current_loop_) return loop_;\n    if (final_arc_) {\n      impl_->ComputeFinalArc(tuple_, &arc_);\n      return arc_;\n    }\n    const auto &component_arc = current_matcher_->Value();\n    impl_->ComputeArc(tuple_, component_arc, &arc_);\n    return arc_;\n  }\n\n  void Next() final {\n    if (current_loop_) {\n      current_loop_ = false;\n      return;\n    }\n    if (final_arc_) {\n      final_arc_ = false;\n      return;\n    }\n    current_matcher_->Next();\n  }\n\n  std::ptrdiff_t Priority(StateId s) final { return fst_.NumArcs(s); }\n\n private:\n  std::unique_ptr<const ReplaceFst<Arc, StateTable, CacheStore>> owned_fst_;\n  const ReplaceFst<Arc, StateTable, CacheStore> &fst_;\n  internal::ReplaceFstImpl<Arc, StateTable, CacheStore> *impl_;\n  LocalMatcher *current_matcher_;\n  std::vector<std::unique_ptr<LocalMatcher>> matcher_;\n  StateId s_;             // Current state.\n  Label label_;           // Current label.\n  MatchType match_type_;  // Supplied by caller.\n  mutable bool done_;\n  mutable bool current_loop_;  // Current arc is the implicit loop.\n  mutable bool final_arc_;     // Current arc for exiting recursion.\n  mutable StateTuple tuple_;   // Tuple corresponding to state_.\n  mutable Arc arc_;\n  Arc loop_;\n\n  ReplaceFstMatcher &operator=(const ReplaceFstMatcher &) = delete;\n};\n\ntemplate <class Arc, class StateTable, class CacheStore>\ninline void ReplaceFst<Arc, StateTable, CacheStore>::InitStateIterator(\n    StateIteratorData<Arc> *data) const {\n  data->base =\n      new StateIterator<ReplaceFst<Arc, StateTable, CacheStore>>(*this);\n}\n\nusing StdReplaceFst = ReplaceFst<StdArc>;\n\n// Recursively replaces arcs in the root FSTs with other FSTs.\n// This version writes the result of replacement to an output MutableFst.\n//\n// Replace supports replacement of arcs in one Fst with another FST. This\n// replacement is recursive. Replace takes an array of FST(s). One FST\n// represents the root (or topology) machine. The root FST refers to other FSTs\n// by recursively replacing arcs labeled as non-terminals with the matching\n// non-terminal FST. Currently Replace uses the output symbols of the arcs to\n// determine whether the arc is a non-terminal arc or not. A non-terminal can be\n// any label that is not a non-zero terminal label in the output alphabet.\n//\n// Note that input argument is a vector of pairs. These correspond to the tuple\n// of non-terminal Label and corresponding FST.\ntemplate <class Arc>\nvoid Replace(const std::vector<std::pair<typename Arc::Label, const Fst<Arc> *>>\n                 &ifst_array,\n             MutableFst<Arc> *ofst,\n             ReplaceFstOptions<Arc> opts = ReplaceFstOptions<Arc>()) {\n  opts.gc = true;\n  opts.gc_limit = 0;  // Caches only the last state for fastest copy.\n  *ofst = ReplaceFst<Arc>(ifst_array, opts);\n}\n\ntemplate <class Arc>\nvoid Replace(const std::vector<std::pair<typename Arc::Label, const Fst<Arc> *>>\n                 &ifst_array,\n             MutableFst<Arc> *ofst, const ReplaceUtilOptions &opts) {\n  Replace(ifst_array, ofst, ReplaceFstOptions<Arc>(opts));\n}\n\n// For backwards compatibility.\ntemplate <class Arc>\nvoid Replace(const std::vector<std::pair<typename Arc::Label, const Fst<Arc> *>>\n                 &ifst_array,\n             MutableFst<Arc> *ofst, typename Arc::Label root,\n             bool epsilon_on_replace) {\n  Replace(ifst_array, ofst, ReplaceFstOptions<Arc>(root, epsilon_on_replace));\n}\n\ntemplate <class Arc>\nvoid Replace(const std::vector<std::pair<typename Arc::Label, const Fst<Arc> *>>\n                 &ifst_array,\n             MutableFst<Arc> *ofst, typename Arc::Label root) {\n  Replace(ifst_array, ofst, ReplaceFstOptions<Arc>(root));\n}\n\n}  // namespace fst\n\n#endif  // FST_REPLACE_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/reverse.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Functions and classes to sort arcs in an FST.\n\n#ifndef FST_REVERSE_H_\n#define FST_REVERSE_H_\n\n#include <algorithm>\n#include <vector>\n\n#include <fst/cache.h>\n\n\nnamespace fst {\n\n// Reverses an FST. The reversed result is written to an output mutable FST.\n// If A transduces string x to y with weight a, then the reverse of A\n// transduces the reverse of x to the reverse of y with weight a.Reverse().\n//\n// Typically, a = a.Reverse() and an arc is its own reverse (e.g., for\n// TropicalWeight or LogWeight). In general, e.g., when the weights only form a\n// left or right semiring, the output arc type must match the input arc type\n// except having the reversed Weight type.\n//\n// When require_superinitial is false, a superinitial state is not created in\n// the reversed FST iff the input FST has exactly one final state (which becomes\n// the initial state of the reversed FST) with a final weight of semiring One,\n// or if it does not belong to any cycle. When require_superinitial is true, a\n// superinitial state is always created.\ntemplate <class FromArc, class ToArc>\nvoid Reverse(const Fst<FromArc> &ifst, MutableFst<ToArc> *ofst,\n             bool require_superinitial = true) {\n  using StateId = typename FromArc::StateId;\n  using FromWeight = typename FromArc::Weight;\n  using ToWeight = typename ToArc::Weight;\n  ofst->DeleteStates();\n  ofst->SetInputSymbols(ifst.InputSymbols());\n  ofst->SetOutputSymbols(ifst.OutputSymbols());\n  if (ifst.Properties(kExpanded, false)) {\n    ofst->ReserveStates(CountStates(ifst) + 1);\n  }\n  StateId istart = ifst.Start();\n  StateId ostart = kNoStateId;\n  StateId offset = 0;\n  uint64_t dfs_iprops = 0;\n  uint64_t dfs_oprops = 0;\n  if (!require_superinitial) {\n    for (StateIterator<Fst<FromArc>> siter(ifst); !siter.Done(); siter.Next()) {\n      const auto s = siter.Value();\n      if (ifst.Final(s) == FromWeight::Zero()) continue;\n      if (ostart != kNoStateId) {\n        ostart = kNoStateId;\n        break;\n      } else {\n        ostart = s;\n      }\n    }\n    if (ostart != kNoStateId && ifst.Final(ostart) != FromWeight::One()) {\n      std::vector<StateId> scc;\n      SccVisitor<FromArc> scc_visitor(&scc, nullptr, nullptr, &dfs_iprops);\n      DfsVisit(ifst, &scc_visitor);\n      if (count(scc.begin(), scc.end(), scc[ostart]) > 1) {\n        ostart = kNoStateId;\n      } else {\n        for (ArcIterator<Fst<FromArc>> aiter(ifst, ostart); !aiter.Done();\n             aiter.Next()) {\n          if (aiter.Value().nextstate == ostart) {\n            ostart = kNoStateId;\n            break;\n          }\n        }\n      }\n      if (ostart != kNoStateId) dfs_oprops = kInitialAcyclic;\n    }\n  }\n  if (ostart == kNoStateId) {  // Super-initial requested or needed.\n    ostart = ofst->AddState();\n    offset = 1;\n  }\n  for (StateIterator<Fst<FromArc>> siter(ifst); !siter.Done(); siter.Next()) {\n    const auto is = siter.Value();\n    const auto os = is + offset;\n    while (ofst->NumStates() <= os) ofst->AddState();\n    if (is == istart) ofst->SetFinal(os, ToWeight::One());\n    const auto weight = ifst.Final(is);\n    if ((weight != FromWeight::Zero()) && (offset == 1)) {\n      const ToArc oarc(0, 0, weight.Reverse(), os);\n      ofst->AddArc(0, oarc);\n    }\n    for (ArcIterator<Fst<FromArc>> aiter(ifst, is); !aiter.Done();\n         aiter.Next()) {\n      const auto &iarc = aiter.Value();\n      const auto nos = iarc.nextstate + offset;\n      auto weight = iarc.weight.Reverse();\n      if (!offset && (nos == ostart)) {\n        weight = Times(ifst.Final(ostart).Reverse(), weight);\n      }\n      const ToArc oarc(iarc.ilabel, iarc.olabel, weight, os);\n      while (ofst->NumStates() <= nos) ofst->AddState();\n      ofst->AddArc(nos, oarc);\n    }\n  }\n  ofst->SetStart(ostart);\n  if (offset == 0 && ostart == istart) {\n    ofst->SetFinal(ostart, ifst.Final(ostart).Reverse());\n  }\n  const auto iprops = ifst.Properties(kCopyProperties, false) | dfs_iprops;\n  const auto oprops = ofst->Properties(kFstProperties, false) | dfs_oprops;\n  ofst->SetProperties(ReverseProperties(iprops, offset == 1) | oprops,\n                      kFstProperties);\n}\n\n}  // namespace fst\n\n#endif  // FST_REVERSE_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/reweight.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Function to reweight an FST.\n\n#ifndef FST_REWEIGHT_H_\n#define FST_REWEIGHT_H_\n\n#include <vector>\n#include <fst/log.h>\n\n#include <fst/mutable-fst.h>\n\n\nnamespace fst {\n\nenum ReweightType { REWEIGHT_TO_INITIAL, REWEIGHT_TO_FINAL };\n\n// Reweights an FST according to a vector of potentials in a given direction.\n// The weight must be left distributive when reweighting towards the initial\n// state and right distributive when reweighting towards the final states.\n//\n// An arc of weight w, with an origin state of potential p and destination state\n// of potential q, is reweighted by p^-1 \\otimes (w \\otimes q) when reweighting\n// torwards the initial state, and by (p \\otimes w) \\otimes q^-1 when\n// reweighting towards the final states.\ntemplate <class Arc>\nvoid Reweight(MutableFst<Arc> *fst,\n              const std::vector<typename Arc::Weight> &potential,\n              ReweightType type) {\n  using Weight = typename Arc::Weight;\n  if (fst->NumStates() == 0) return;\n  // TODO(kbg): Make this a compile-time static_assert once we have a pleasant\n  // way to \"deregister\" this operation for non-distributive semirings so an\n  // informative error message is produced.\n  if (type == REWEIGHT_TO_FINAL && !(Weight::Properties() & kRightSemiring)) {\n    FSTERROR() << \"Reweight: Reweighting to the final states requires \"\n               << \"Weight to be right distributive: \" << Weight::Type();\n    fst->SetProperties(kError, kError);\n    return;\n  }\n  // TODO(kbg): Make this a compile-time static_assert once we have a pleasant\n  // way to \"deregister\" this operation for non-distributive semirings so an\n  // informative error message is produced.\n  if (type == REWEIGHT_TO_INITIAL && !(Weight::Properties() & kLeftSemiring)) {\n    FSTERROR() << \"Reweight: Reweighting to the initial state requires \"\n               << \"Weight to be left distributive: \" << Weight::Type();\n    fst->SetProperties(kError, kError);\n    return;\n  }\n  StateIterator<MutableFst<Arc>> siter(*fst);\n  for (; !siter.Done(); siter.Next()) {\n    const auto s = siter.Value();\n    if (s == potential.size()) break;\n    const auto &weight = potential[s];\n    if (weight != Weight::Zero()) {\n      for (MutableArcIterator<MutableFst<Arc>> aiter(fst, s); !aiter.Done();\n           aiter.Next()) {\n        auto arc = aiter.Value();\n        if (arc.nextstate >= potential.size()) continue;\n        const auto &nextweight = potential[arc.nextstate];\n        if (nextweight == Weight::Zero()) continue;\n        if (type == REWEIGHT_TO_INITIAL) {\n          arc.weight =\n              Divide(Times(arc.weight, nextweight), weight, DIVIDE_LEFT);\n        }\n        if (type == REWEIGHT_TO_FINAL) {\n          arc.weight =\n              Divide(Times(weight, arc.weight), nextweight, DIVIDE_RIGHT);\n        }\n        aiter.SetValue(arc);\n      }\n      if (type == REWEIGHT_TO_INITIAL) {\n        fst->SetFinal(s, Divide(fst->Final(s), weight, DIVIDE_LEFT));\n      }\n    }\n    if (type == REWEIGHT_TO_FINAL) {\n      fst->SetFinal(s, Times(weight, fst->Final(s)));\n    }\n  }\n  // This handles elements past the end of the potentials array.\n  for (; !siter.Done(); siter.Next()) {\n    const auto s = siter.Value();\n    if (type == REWEIGHT_TO_FINAL) {\n      fst->SetFinal(s, Times(Weight::Zero(), fst->Final(s)));\n    }\n  }\n  const auto startweight = fst->Start() < potential.size()\n                               ? potential[fst->Start()]\n                               : Weight::Zero();\n  if ((startweight != Weight::One()) && (startweight != Weight::Zero())) {\n    if (fst->Properties(kInitialAcyclic, true) & kInitialAcyclic) {\n      const auto s = fst->Start();\n      for (MutableArcIterator<MutableFst<Arc>> aiter(fst, s); !aiter.Done();\n           aiter.Next()) {\n        auto arc = aiter.Value();\n        if (type == REWEIGHT_TO_INITIAL) {\n          arc.weight = Times(startweight, arc.weight);\n        } else {\n          arc.weight = Times(Divide(Weight::One(), startweight, DIVIDE_RIGHT),\n                             arc.weight);\n        }\n        aiter.SetValue(arc);\n      }\n      if (type == REWEIGHT_TO_INITIAL) {\n        fst->SetFinal(s, Times(startweight, fst->Final(s)));\n      } else {\n        fst->SetFinal(s, Times(Divide(Weight::One(), startweight, DIVIDE_RIGHT),\n                               fst->Final(s)));\n      }\n    } else {\n      const auto s = fst->AddState();\n      const auto weight =\n          (type == REWEIGHT_TO_INITIAL)\n              ? startweight\n              : Divide(Weight::One(), startweight, DIVIDE_RIGHT);\n      fst->AddArc(s, Arc(0, 0, weight, fst->Start()));\n      fst->SetStart(s);\n    }\n  }\n  fst->SetProperties(ReweightProperties(fst->Properties(kFstProperties, false)),\n                     kFstProperties);\n}\n\n}  // namespace fst\n\n#endif  // FST_REWEIGHT_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/rmepsilon.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Functions and classes that implemement epsilon-removal.\n\n#ifndef FST_RMEPSILON_H_\n#define FST_RMEPSILON_H_\n\n#include <forward_list>\n#include <stack>\n#include <string>\n#include <unordered_map>\n#include <utility>\n#include <vector>\n\n#include <fst/log.h>\n\n#include <fst/arcfilter.h>\n#include <fst/cache.h>\n#include <fst/connect.h>\n#include <fst/factor-weight.h>\n#include <fst/invert.h>\n#include <fst/prune.h>\n#include <fst/queue.h>\n#include <fst/shortest-distance.h>\n#include <fst/topsort.h>\n\n\nnamespace fst {\n\ntemplate <class Arc, class Queue>\nclass RmEpsilonOptions\n    : public ShortestDistanceOptions<Arc, Queue, EpsilonArcFilter<Arc>> {\n public:\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  bool connect;             // Connect output\n  Weight weight_threshold;  // Pruning weight threshold.\n  StateId state_threshold;  // Pruning state threshold.\n\n  explicit RmEpsilonOptions(Queue *queue, float delta = kShortestDelta,\n                            bool connect = true,\n                            Weight weight_threshold = Weight::Zero(),\n                            StateId state_threshold = kNoStateId)\n      : ShortestDistanceOptions<Arc, Queue, EpsilonArcFilter<Arc>>(\n            queue, EpsilonArcFilter<Arc>(), kNoStateId, delta),\n        connect(connect),\n        weight_threshold(std::move(weight_threshold)),\n        state_threshold(state_threshold) {}\n};\n\nnamespace internal {\n\n// Computation state of the epsilon-removal algorithm.\ntemplate <class Arc, class Queue>\nclass RmEpsilonState {\n public:\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  RmEpsilonState(const Fst<Arc> &fst, std::vector<Weight> *distance,\n                 const RmEpsilonOptions<Arc, Queue> &opts)\n      : fst_(fst),\n        distance_(distance),\n        sd_state_(fst_, distance, opts, true),\n        expand_id_(0) {}\n\n  void Expand(StateId s);\n\n  std::vector<Arc> &Arcs() { return arcs_; }\n\n  const Weight &Final() const { return final_; }\n\n  bool Error() const { return sd_state_.Error(); }\n\n private:\n  struct Element {\n    Label ilabel;\n    Label olabel;\n    StateId nextstate;\n\n    Element() {}\n\n    Element(Label ilabel, Label olabel, StateId nexstate)\n        : ilabel(ilabel), olabel(olabel), nextstate(nexstate) {}\n  };\n\n  struct ElementHash {\n   public:\n    size_t operator()(const Element &element) const {\n      static constexpr size_t prime0 = 7853;\n      static constexpr size_t prime1 = 7867;\n      return static_cast<size_t>(element.nextstate) +\n             static_cast<size_t>(element.ilabel) * prime0 +\n             static_cast<size_t>(element.olabel) * prime1;\n    }\n  };\n\n  class ElementEqual {\n   public:\n    bool operator()(const Element &e1, const Element &e2) const {\n      return (e1.ilabel == e2.ilabel) && (e1.olabel == e2.olabel) &&\n             (e1.nextstate == e2.nextstate);\n    }\n  };\n\n  using ElementMap = std::unordered_map<Element, std::pair<StateId, size_t>,\n                                        ElementHash, ElementEqual>;\n\n  const Fst<Arc> &fst_;\n  // Distance from state being expanded in epsilon-closure.\n  std::vector<Weight> *distance_;\n  // Shortest distance algorithm computation state.\n  internal::ShortestDistanceState<Arc, Queue, EpsilonArcFilter<Arc>> sd_state_;\n  // Maps an element to a pair corresponding to a position in the arcs vector\n  // of the state being expanded. The element corresopnds to the position in\n  // the arcs_ vector if p.first is equal to the state being expanded.\n  ElementMap element_map_;\n  EpsilonArcFilter<Arc> eps_filter_;\n  std::stack<StateId> eps_queue_;  // Queue used to visit the epsilon-closure.\n  std::vector<bool> visited_;      // True if the state has been visited.\n  std::forward_list<StateId> visited_states_;  // List of visited states.\n  std::vector<Arc> arcs_;                      // Arcs of state being expanded.\n  Weight final_;       // Final weight of state being expanded.\n  StateId expand_id_;  // Unique ID for each call to Expand\n\n  RmEpsilonState(const RmEpsilonState &) = delete;\n  RmEpsilonState &operator=(const RmEpsilonState &) = delete;\n};\n\ntemplate <class Arc, class Queue>\nvoid RmEpsilonState<Arc, Queue>::Expand(typename Arc::StateId source) {\n  final_ = Weight::Zero();\n  arcs_.clear();\n  sd_state_.ShortestDistance(source);\n  if (sd_state_.Error()) return;\n  eps_queue_.push(source);\n  while (!eps_queue_.empty()) {\n    const auto state = eps_queue_.top();\n    eps_queue_.pop();\n    while (visited_.size() <= state) visited_.push_back(false);\n    if (visited_[state]) continue;\n    visited_[state] = true;\n    visited_states_.push_front(state);\n    for (ArcIterator<Fst<Arc>> aiter(fst_, state); !aiter.Done();\n         aiter.Next()) {\n      auto arc = aiter.Value();\n      arc.weight = Times((*distance_)[state], arc.weight);\n      if (eps_filter_(arc)) {\n        while (visited_.size() <= arc.nextstate) visited_.push_back(false);\n        if (!visited_[arc.nextstate]) eps_queue_.push(arc.nextstate);\n      } else {\n        const Element element(arc.ilabel, arc.olabel, arc.nextstate);\n        auto insert_result = element_map_.insert(\n            std::make_pair(element, std::make_pair(expand_id_, arcs_.size())));\n        if (insert_result.second) {\n          arcs_.push_back(arc);\n        } else {\n          if (insert_result.first->second.first == expand_id_) {\n            auto &weight = arcs_[insert_result.first->second.second].weight;\n            weight = Plus(weight, arc.weight);\n          } else {\n            insert_result.first->second.first = expand_id_;\n            insert_result.first->second.second = arcs_.size();\n            arcs_.push_back(arc);\n          }\n        }\n      }\n    }\n    final_ = Plus(final_, Times((*distance_)[state], fst_.Final(state)));\n  }\n  while (!visited_states_.empty()) {\n    visited_[visited_states_.front()] = false;\n    visited_states_.pop_front();\n  }\n  ++expand_id_;\n}\n\n}  // namespace internal\n\n// Removes epsilon-transitions (when both the input and output label are an\n// epsilon) from a transducer. The result will be an equivalent FST that has no\n// such epsilon transitions. This version modifies its input. It allows fine\n// control via the options argument; see below for a simpler interface.\n//\n// The distance vector will be used to hold the shortest distances during the\n// epsilon-closure computation. The state queue discipline and convergence delta\n// are taken in the options argument.\ntemplate <class Arc, class Queue>\nvoid RmEpsilon(MutableFst<Arc> *fst,\n               std::vector<typename Arc::Weight> *distance,\n               const RmEpsilonOptions<Arc, Queue> &opts) {\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n  if (fst->Start() == kNoStateId) return;\n  // noneps_in[s] will be set to true iff s admits a non-epsilon incoming\n  // transition or is the start state.\n  std::vector<bool> noneps_in(fst->NumStates(), false);\n  noneps_in[fst->Start()] = true;\n  for (size_t i = 0; i < fst->NumStates(); ++i) {\n    for (ArcIterator<Fst<Arc>> aiter(*fst, i); !aiter.Done(); aiter.Next()) {\n      const auto &arc = aiter.Value();\n      if (arc.ilabel != 0 || arc.olabel != 0) {\n        noneps_in[arc.nextstate] = true;\n      }\n    }\n  }\n  // States sorted in topological order when (acyclic) or generic topological\n  // order (cyclic).\n  std::vector<StateId> states;\n  states.reserve(fst->NumStates());\n  if (fst->Properties(kTopSorted, false) & kTopSorted) {\n    for (size_t i = 0; i < fst->NumStates(); i++) states.push_back(i);\n  } else if (fst->Properties(kAcyclic, false) & kAcyclic) {\n    std::vector<StateId> order;\n    bool acyclic;\n    TopOrderVisitor<Arc> top_order_visitor(&order, &acyclic);\n    DfsVisit(*fst, &top_order_visitor, EpsilonArcFilter<Arc>());\n    // Sanity check: should be acyclic if property bit is set.\n    if (!acyclic) {\n      FSTERROR() << \"RmEpsilon: Inconsistent acyclic property bit\";\n      fst->SetProperties(kError, kError);\n      return;\n    }\n    states.resize(order.size());\n    for (StateId i = 0; i < order.size(); i++) states[order[i]] = i;\n  } else {\n    uint64_t props;\n    std::vector<StateId> scc;\n    SccVisitor<Arc> scc_visitor(&scc, nullptr, nullptr, &props);\n    DfsVisit(*fst, &scc_visitor, EpsilonArcFilter<Arc>());\n    std::vector<StateId> first(scc.size(), kNoStateId);\n    std::vector<StateId> next(scc.size(), kNoStateId);\n    for (StateId i = 0; i < scc.size(); i++) {\n      if (first[scc[i]] != kNoStateId) next[i] = first[scc[i]];\n      first[scc[i]] = i;\n    }\n    for (StateId i = 0; i < first.size(); i++) {\n      for (auto j = first[i]; j != kNoStateId; j = next[j]) {\n        states.push_back(j);\n      }\n    }\n  }\n  internal::RmEpsilonState<Arc, Queue> rmeps_state(*fst, distance, opts);\n  while (!states.empty()) {\n    const auto state = states.back();\n    states.pop_back();\n    if (!noneps_in[state] &&\n        (opts.connect || opts.weight_threshold != Weight::Zero() ||\n         opts.state_threshold != kNoStateId)) {\n      continue;\n    }\n    rmeps_state.Expand(state);\n    fst->SetFinal(state, rmeps_state.Final());\n    fst->DeleteArcs(state);\n    auto &arcs = rmeps_state.Arcs();\n    fst->ReserveArcs(state, arcs.size());\n    while (!arcs.empty()) {\n      fst->AddArc(state, arcs.back());\n      arcs.pop_back();\n    }\n  }\n  if (opts.connect || opts.weight_threshold != Weight::Zero() ||\n      opts.state_threshold != kNoStateId) {\n    for (size_t s = 0; s < fst->NumStates(); ++s) {\n      if (!noneps_in[s]) fst->DeleteArcs(s);\n    }\n  }\n  if (rmeps_state.Error()) fst->SetProperties(kError, kError);\n  fst->SetProperties(\n      RmEpsilonProperties(fst->Properties(kFstProperties, false)),\n      kFstProperties);\n  if (opts.weight_threshold != Weight::Zero() ||\n      opts.state_threshold != kNoStateId) {\n    Prune(fst, opts.weight_threshold, opts.state_threshold);\n  }\n  if (opts.connect && opts.weight_threshold == Weight::Zero() &&\n      opts.state_threshold == kNoStateId) {\n    Connect(fst);\n  }\n}\n\n// Removes epsilon-transitions (when both the input and output label\n// are an epsilon) from a transducer. The result will be an equivalent\n// FST that has no such epsilon transitions. This version modifies its\n// input. It has a simplified interface; see above for a version that\n// allows finer control.\n//\n// Complexity:\n//\n// - Time:\n//\n//   Unweighted: O(v^2 + ve).\n//   Acyclic: O(v^2 + V e).\n//   Tropical semiring: O(v^2 log V + ve).\n//   General: exponential.\n//\n// - Space: O(vE)\n//\n// where v is the number of states visited and e is the number of arcs visited.\n//\n// For more information, see:\n//\n// Mohri, M. 2002. Generic epsilon-removal and input epsilon-normalization\n// algorithms for weighted transducers. International Journal of Computer\n// Science 13(1): 129-143.\ntemplate <class Arc>\nvoid RmEpsilon(MutableFst<Arc> *fst, bool connect = true,\n               typename Arc::Weight weight_threshold = Arc::Weight::Zero(),\n               typename Arc::StateId state_threshold = kNoStateId,\n               float delta = kShortestDelta) {\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n  std::vector<Weight> distance;\n  AutoQueue<StateId> state_queue(*fst, &distance, EpsilonArcFilter<Arc>());\n  RmEpsilonOptions<Arc, AutoQueue<StateId>> opts(\n      &state_queue, delta, connect, weight_threshold, state_threshold);\n  RmEpsilon(fst, &distance, opts);\n}\n\nstruct RmEpsilonFstOptions : CacheOptions {\n  float delta;\n\n  explicit RmEpsilonFstOptions(const CacheOptions &opts,\n                               float delta = kShortestDelta)\n      : CacheOptions(opts), delta(delta) {}\n\n  explicit RmEpsilonFstOptions(float delta = kShortestDelta) : delta(delta) {}\n};\n\nnamespace internal {\n\n// Implementation of delayed RmEpsilonFst.\ntemplate <class Arc>\nclass RmEpsilonFstImpl : public CacheImpl<Arc> {\n public:\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  using Store = DefaultCacheStore<Arc>;\n  using State = typename Store::State;\n\n  using FstImpl<Arc>::Properties;\n  using FstImpl<Arc>::SetType;\n  using FstImpl<Arc>::SetProperties;\n  using FstImpl<Arc>::SetInputSymbols;\n  using FstImpl<Arc>::SetOutputSymbols;\n\n  using CacheBaseImpl<CacheState<Arc>>::HasArcs;\n  using CacheBaseImpl<CacheState<Arc>>::HasFinal;\n  using CacheBaseImpl<CacheState<Arc>>::HasStart;\n  using CacheBaseImpl<CacheState<Arc>>::PushArc;\n  using CacheBaseImpl<CacheState<Arc>>::SetArcs;\n  using CacheBaseImpl<CacheState<Arc>>::SetFinal;\n  using CacheBaseImpl<CacheState<Arc>>::SetStart;\n\n  RmEpsilonFstImpl(const Fst<Arc> &fst, const RmEpsilonFstOptions &opts)\n      : CacheImpl<Arc>(opts),\n        fst_(fst.Copy()),\n        delta_(opts.delta),\n        rmeps_state_(\n            *fst_, &distance_,\n            RmEpsilonOptions<Arc, FifoQueue<StateId>>(&queue_, delta_, false)) {\n    SetType(\"rmepsilon\");\n    SetProperties(\n        RmEpsilonProperties(fst.Properties(kFstProperties, false), true),\n        kCopyProperties);\n    SetInputSymbols(fst.InputSymbols());\n    SetOutputSymbols(fst.OutputSymbols());\n  }\n\n  RmEpsilonFstImpl(const RmEpsilonFstImpl &impl)\n      : CacheImpl<Arc>(impl),\n        fst_(impl.fst_->Copy(true)),\n        delta_(impl.delta_),\n        rmeps_state_(\n            *fst_, &distance_,\n            RmEpsilonOptions<Arc, FifoQueue<StateId>>(&queue_, delta_, false)) {\n    SetType(\"rmepsilon\");\n    SetProperties(impl.Properties(), kCopyProperties);\n    SetInputSymbols(impl.InputSymbols());\n    SetOutputSymbols(impl.OutputSymbols());\n  }\n\n  StateId Start() {\n    if (!HasStart()) SetStart(fst_->Start());\n    return CacheImpl<Arc>::Start();\n  }\n\n  Weight Final(StateId s) {\n    if (!HasFinal(s)) Expand(s);\n    return CacheImpl<Arc>::Final(s);\n  }\n\n  size_t NumArcs(StateId s) {\n    if (!HasArcs(s)) Expand(s);\n    return CacheImpl<Arc>::NumArcs(s);\n  }\n\n  size_t NumInputEpsilons(StateId s) {\n    if (!HasArcs(s)) Expand(s);\n    return CacheImpl<Arc>::NumInputEpsilons(s);\n  }\n\n  size_t NumOutputEpsilons(StateId s) {\n    if (!HasArcs(s)) Expand(s);\n    return CacheImpl<Arc>::NumOutputEpsilons(s);\n  }\n\n  uint64_t Properties() const override { return Properties(kFstProperties); }\n\n  // Sets error if found and returns other FST impl properties.\n  uint64_t Properties(uint64_t mask) const override {\n    if ((mask & kError) &&\n        (fst_->Properties(kError, false) || rmeps_state_.Error())) {\n      SetProperties(kError, kError);\n    }\n    return FstImpl<Arc>::Properties(mask);\n  }\n\n  void InitArcIterator(StateId s, ArcIteratorData<Arc> *data) {\n    if (!HasArcs(s)) Expand(s);\n    CacheImpl<Arc>::InitArcIterator(s, data);\n  }\n\n  void Expand(StateId s) {\n    rmeps_state_.Expand(s);\n    SetFinal(s, rmeps_state_.Final());\n    auto &arcs = rmeps_state_.Arcs();\n    while (!arcs.empty()) {\n      PushArc(s, arcs.back());\n      arcs.pop_back();\n    }\n    SetArcs(s);\n  }\n\n private:\n  std::unique_ptr<const Fst<Arc>> fst_;\n  float delta_;\n  std::vector<Weight> distance_;\n  FifoQueue<StateId> queue_;\n  internal::RmEpsilonState<Arc, FifoQueue<StateId>> rmeps_state_;\n};\n\n}  // namespace internal\n\n// Removes epsilon-transitions (when both the input and output label are an\n// epsilon) from a transducer. The result will be an equivalent FST that has no\n// such epsilon transitions. This version is a\n// delayed FST.\n//\n// Complexity:\n//\n// - Time:\n//   Unweighted: O(v^2 + ve).\n//   General: exponential.\n//\n// - Space: O(vE)\n//\n// where v is the number of states visited and e is the number of arcs visited.\n// Constant time to visit an input state or arc is assumed and exclusive of\n// caching.\n//\n// For more information, see:\n//\n// Mohri, M. 2002. Generic epsilon-removal and input epsilon-normalization\n// algorithms for weighted transducers. International Journal of Computer\n// Science 13(1): 129-143.\n//\n// This class attaches interface to implementation and handles\n// reference counting, delegating most methods to ImplToFst.\ntemplate <class A>\nclass RmEpsilonFst : public ImplToFst<internal::RmEpsilonFstImpl<A>> {\n public:\n  using Arc = A;\n  using StateId = typename Arc::StateId;\n\n  using Store = DefaultCacheStore<Arc>;\n  using State = typename Store::State;\n  using Impl = internal::RmEpsilonFstImpl<Arc>;\n\n  friend class ArcIterator<RmEpsilonFst<Arc>>;\n  friend class StateIterator<RmEpsilonFst<Arc>>;\n\n  explicit RmEpsilonFst(const Fst<Arc> &fst)\n      : ImplToFst<Impl>(std::make_shared<Impl>(fst, RmEpsilonFstOptions())) {}\n\n  RmEpsilonFst(const Fst<A> &fst, const RmEpsilonFstOptions &opts)\n      : ImplToFst<Impl>(std::make_shared<Impl>(fst, opts)) {}\n\n  // See Fst<>::Copy() for doc.\n  RmEpsilonFst(const RmEpsilonFst<Arc> &fst, bool safe = false)\n      : ImplToFst<Impl>(fst, safe) {}\n\n  // Get a copy of this RmEpsilonFst. See Fst<>::Copy() for further doc.\n  RmEpsilonFst<Arc> *Copy(bool safe = false) const override {\n    return new RmEpsilonFst<Arc>(*this, safe);\n  }\n\n  inline void InitStateIterator(StateIteratorData<Arc> *data) const override;\n\n  void InitArcIterator(StateId s, ArcIteratorData<Arc> *data) const override {\n    GetMutableImpl()->InitArcIterator(s, data);\n  }\n\n private:\n  using ImplToFst<Impl>::GetImpl;\n  using ImplToFst<Impl>::GetMutableImpl;\n\n  RmEpsilonFst &operator=(const RmEpsilonFst &) = delete;\n};\n\n// Specialization for RmEpsilonFst.\ntemplate <class Arc>\nclass StateIterator<RmEpsilonFst<Arc>>\n    : public CacheStateIterator<RmEpsilonFst<Arc>> {\n public:\n  explicit StateIterator(const RmEpsilonFst<Arc> &fst)\n      : CacheStateIterator<RmEpsilonFst<Arc>>(fst, fst.GetMutableImpl()) {}\n};\n\n// Specialization for RmEpsilonFst.\ntemplate <class Arc>\nclass ArcIterator<RmEpsilonFst<Arc>>\n    : public CacheArcIterator<RmEpsilonFst<Arc>> {\n public:\n  using StateId = typename Arc::StateId;\n\n  ArcIterator(const RmEpsilonFst<Arc> &fst, StateId s)\n      : CacheArcIterator<RmEpsilonFst<Arc>>(fst.GetMutableImpl(), s) {\n    if (!fst.GetImpl()->HasArcs(s)) fst.GetMutableImpl()->Expand(s);\n  }\n};\n\ntemplate <class Arc>\ninline void RmEpsilonFst<Arc>::InitStateIterator(\n    StateIteratorData<Arc> *data) const {\n  data->base = new StateIterator<RmEpsilonFst<Arc>>(*this);\n}\n\n// Useful alias when using StdArc.\nusing StdRmEpsilonFst = RmEpsilonFst<StdArc>;\n\n}  // namespace fst\n\n#endif  // FST_RMEPSILON_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/rmfinalepsilon.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Function to remove of final states that have epsilon-only input arcs.\n\n#ifndef FST_RMFINALEPSILON_H_\n#define FST_RMFINALEPSILON_H_\n\n#include <unordered_set>\n#include <vector>\n\n#include <fst/connect.h>\n#include <fst/mutable-fst.h>\n\n\nnamespace fst {\n\n// Removes final states that have epsilon-only input arcs.\ntemplate <class Arc>\nvoid RmFinalEpsilon(MutableFst<Arc> *fst) {\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n  // Determines the coaccesibility of states.\n  std::vector<bool> access;\n  std::vector<bool> coaccess;\n  uint64_t props = 0;\n  SccVisitor<Arc> scc_visitor(nullptr, &access, &coaccess, &props);\n  DfsVisit(*fst, &scc_visitor);\n  // Finds potential list of removable final states. These are final states that\n  // have no outgoing transitions or final states that have a non-coaccessible\n  // future.\n  std::unordered_set<StateId> finals;\n  for (StateIterator<Fst<Arc>> siter(*fst); !siter.Done(); siter.Next()) {\n    const auto s = siter.Value();\n    if (fst->Final(s) != Weight::Zero()) {\n      bool future_coaccess = false;\n      for (ArcIterator<Fst<Arc>> aiter(*fst, s); !aiter.Done(); aiter.Next()) {\n        const auto &arc = aiter.Value();\n        if (coaccess[arc.nextstate]) {\n          future_coaccess = true;\n          break;\n        }\n      }\n      if (!future_coaccess) finals.insert(s);\n    }\n  }\n  // Moves the final weight.\n  std::vector<Arc> arcs;\n  for (StateIterator<Fst<Arc>> siter(*fst); !siter.Done(); siter.Next()) {\n    const auto s = siter.Value();\n    auto weight = fst->Final(s);\n    arcs.clear();\n    for (ArcIterator<Fst<Arc>> aiter(*fst, s); !aiter.Done(); aiter.Next()) {\n      const auto &arc = aiter.Value();\n      // Next state is in the list of finals.\n      if (finals.find(arc.nextstate) != finals.end()) {\n        // Sums up all epsilon arcs.\n        if (arc.ilabel == 0 && arc.olabel == 0) {\n          weight = Plus(Times(fst->Final(arc.nextstate), arc.weight), weight);\n        } else {\n          arcs.push_back(arc);\n        }\n      } else {\n        arcs.push_back(arc);\n      }\n    }\n    // If some arcs (epsilon arcs) were deleted, delete all arcs and add back\n    // only the non-epsilon arcs.\n    if (arcs.size() < fst->NumArcs(s)) {\n      fst->DeleteArcs(s);\n      fst->SetFinal(s, weight);\n      for (const auto &arc : arcs) fst->AddArc(s, arc);\n    }\n  }\n  Connect(fst);\n}\n\n}  // namespace fst\n\n#endif  // FST_RMFINALEPSILON_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/script/arc-class.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#ifndef FST_SCRIPT_ARC_CLASS_H_\n#define FST_SCRIPT_ARC_CLASS_H_\n\n#include <fst/script/weight-class.h>\n\nnamespace fst {\nnamespace script {\n\n// A struct representing an arc while ignoring arc type. It is passed as an\n// argument to AddArc.\n\nstruct ArcClass {\n  template <class Arc>\n  explicit ArcClass(const Arc &arc)\n      : ilabel(arc.ilabel), olabel(arc.olabel), weight(arc.weight),\n        nextstate(arc.nextstate) {}\n\n  ArcClass(int64_t ilabel, int64_t olabel, const WeightClass &weight,\n           int64_t nextstate)\n      : ilabel(ilabel), olabel(olabel), weight(weight), nextstate(nextstate) {}\n\n  template <class Arc>\n  Arc GetArc() const {\n    return Arc(ilabel, olabel, *(weight.GetWeight<typename Arc::Weight>()),\n               nextstate);\n  }\n\n  int64_t ilabel;\n  int64_t olabel;\n  WeightClass weight;\n  int64_t nextstate;\n};\n\n}  // namespace script\n}  // namespace fst\n\n#endif  // FST_SCRIPT_ARC_CLASS_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/script/arciterator-class.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#ifndef FST_SCRIPT_ARCITERATOR_CLASS_H_\n#define FST_SCRIPT_ARCITERATOR_CLASS_H_\n\n#include <memory>\n#include <utility>\n\n#include <fst/fstlib.h>\n#include <fst/script/fst-class.h>\n\n// Scripting API support for ArcIterator.\n//\n// A call to Value() causes the underlying arc to be used to construct the\n// associated ArcClass.\n\nnamespace fst {\nnamespace script {\n\n// Non-mutable arc iterators.\n\n// Virtual interface implemented by each concrete ArcIteratorImpl<F>.\nclass ArcIteratorImplBase {\n public:\n  virtual bool Done() const = 0;\n  virtual uint32_t Flags() const = 0;\n  virtual void Next() = 0;\n  virtual size_t Position() const = 0;\n  virtual void Reset() = 0;\n  virtual void Seek(size_t a) = 0;\n  virtual void SetFlags(uint32_t flags, uint32_t mask) = 0;\n  virtual ArcClass Value() const = 0;\n  virtual ~ArcIteratorImplBase() {}\n};\n\n// Templated implementation.\ntemplate <class Arc>\nclass ArcIteratorClassImpl : public ArcIteratorImplBase {\n public:\n  explicit ArcIteratorClassImpl(const Fst<Arc> &fst, int64_t s)\n      : aiter_(fst, s) {}\n\n  bool Done() const final { return aiter_.Done(); }\n\n  uint32_t Flags() const final { return aiter_.Flags(); }\n\n  void Next() final { aiter_.Next(); }\n\n  size_t Position() const final { return aiter_.Position(); }\n\n  void Reset() final { aiter_.Reset(); }\n\n  void Seek(size_t a) final { aiter_.Seek(a); }\n\n  void SetFlags(uint32_t flags, uint32_t mask) final {\n    aiter_.SetFlags(flags, mask);\n  }\n\n  // This is returned by value because it has not yet been constructed, and\n  // is likely to participate in return-value optimization.\n  ArcClass Value() const final { return ArcClass(aiter_.Value()); }\n\n  ~ArcIteratorClassImpl() final {}\n\n private:\n  ArcIterator<Fst<Arc>> aiter_;\n};\n\nclass ArcIteratorClass;\n\nusing InitArcIteratorClassArgs =\n    std::tuple<const FstClass &, int64_t, ArcIteratorClass *>;\n\n// Untemplated user-facing class holding a templated pimpl.\nclass ArcIteratorClass {\n public:\n  ArcIteratorClass(const FstClass &fst, int64_t s);\n\n  template <class Arc>\n  ArcIteratorClass(const Fst<Arc> &fst, int64_t s)\n      : impl_(new ArcIteratorClassImpl<Arc>(fst, s)) {}\n\n  bool Done() const { return impl_->Done(); }\n\n  uint32_t Flags() const { return impl_->Flags(); }\n\n  void Next() { impl_->Next(); }\n\n  size_t Position() const { return impl_->Position(); }\n\n  void Reset() { impl_->Reset(); }\n\n  void Seek(size_t a) { impl_->Seek(a); }\n\n  void SetFlags(uint32_t flags, uint32_t mask) { impl_->SetFlags(flags, mask); }\n\n  ArcClass Value() const { return impl_->Value(); }\n\n  template <class Arc>\n  friend void InitArcIteratorClass(InitArcIteratorClassArgs *args);\n\n private:\n  std::unique_ptr<ArcIteratorImplBase> impl_;\n};\n\ntemplate <class Arc>\nvoid InitArcIteratorClass(InitArcIteratorClassArgs *args) {\n  const Fst<Arc> &fst = *(std::get<0>(*args).GetFst<Arc>());\n  std::get<2>(*args)->impl_.reset(\n      new ArcIteratorClassImpl<Arc>(fst, std::get<1>(*args)));\n}\n\n// Mutable arc iterators.\n\n// Virtual interface implemented by each concrete MutableArcIteratorImpl<F>.\nclass MutableArcIteratorImplBase : public ArcIteratorImplBase {\n public:\n  virtual void SetValue(const ArcClass &) = 0;\n\n  ~MutableArcIteratorImplBase() override {}\n};\n\n// Templated implementation.\ntemplate <class Arc>\nclass MutableArcIteratorClassImpl\n    : public MutableArcIteratorImplBase {\n public:\n  explicit MutableArcIteratorClassImpl(MutableFst<Arc> *fst, int64_t s)\n      : aiter_(fst, s) {}\n\n  bool Done() const final { return aiter_.Done(); }\n\n  uint32_t Flags() const final { return aiter_.Flags(); }\n\n  void Next() final { aiter_.Next(); }\n\n  size_t Position() const final { return aiter_.Position(); }\n\n  void Reset() final { aiter_.Reset(); }\n\n  void Seek(size_t a) final { aiter_.Seek(a); }\n\n  void SetFlags(uint32_t flags, uint32_t mask) final {\n    aiter_.SetFlags(flags, mask);\n  }\n\n  void SetValue(const Arc &arc) { aiter_.SetValue(arc); }\n\n  void SetValue(const ArcClass &ac) final { aiter_.SetValue(ac.GetArc<Arc>()); }\n\n  // This is returned by value because it has not yet been constructed, and\n  // is likely to participate in return-value optimization.\n  ArcClass Value() const final { return ArcClass(aiter_.Value()); }\n\n  ~MutableArcIteratorClassImpl() override {}\n\n private:\n  MutableArcIterator<MutableFst<Arc>> aiter_;\n};\n\nclass MutableArcIteratorClass;\n\nusing InitMutableArcIteratorClassArgs =\n    std::tuple<MutableFstClass *, int64_t, MutableArcIteratorClass *>;\n\n// Untemplated user-facing class holding a templated pimpl.\nclass MutableArcIteratorClass {\n public:\n  MutableArcIteratorClass(MutableFstClass *fst, int64_t s);\n\n  template <class Arc>\n  MutableArcIteratorClass(MutableFst<Arc> *fst, int64_t s)\n      : impl_(new MutableArcIteratorClassImpl<Arc>(fst, s)) {}\n\n  bool Done() const { return impl_->Done(); }\n\n  uint32_t Flags() const { return impl_->Flags(); }\n\n  void Next() { impl_->Next(); }\n\n  size_t Position() const { return impl_->Position(); }\n\n  void Reset() { impl_->Reset(); }\n\n  void Seek(size_t a) { impl_->Seek(a); }\n\n  void SetFlags(uint32_t flags, uint32_t mask) { impl_->SetFlags(flags, mask); }\n\n  void SetValue(const ArcClass &ac) { impl_->SetValue(ac); }\n\n  ArcClass Value() const { return impl_->Value(); }\n\n  template <class Arc>\n  friend void InitMutableArcIteratorClass(\n      InitMutableArcIteratorClassArgs *args);\n\n private:\n  std::unique_ptr<MutableArcIteratorImplBase> impl_;\n};\n\ntemplate <class Arc>\nvoid InitMutableArcIteratorClass(InitMutableArcIteratorClassArgs *args) {\n  MutableFst<Arc> *fst = std::get<0>(*args)->GetMutableFst<Arc>();\n  std::get<2>(*args)->impl_.reset(\n      new MutableArcIteratorClassImpl<Arc>(fst, std::get<1>(*args)));\n}\n\n}  // namespace script\n}  // namespace fst\n\n#endif  // FST_SCRIPT_ARCITERATOR_CLASS_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/script/arcsort.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#ifndef FST_SCRIPT_ARCSORT_H_\n#define FST_SCRIPT_ARCSORT_H_\n\n#include <utility>\n\n#include <fst/arcsort.h>\n#include <fst/script/fst-class.h>\n\nnamespace fst {\nnamespace script {\n\nenum ArcSortType {\n  ILABEL_SORT,\n  OLABEL_SORT\n};\n\nusing ArcSortArgs = std::pair<MutableFstClass *, ArcSortType>;\n\ntemplate <class Arc>\nvoid ArcSort(ArcSortArgs *args) {\n  MutableFst<Arc> *fst = std::get<0>(*args)->GetMutableFst<Arc>();\n  switch (std::get<1>(*args)) {\n    case ILABEL_SORT: {\n      const ILabelCompare<Arc> icomp;\n      ArcSort(fst, icomp);\n      return;\n    }\n    case OLABEL_SORT: {\n      const OLabelCompare<Arc> ocomp;\n      ArcSort(fst, ocomp);\n      return;\n    }\n  }\n}\n\nvoid ArcSort(MutableFstClass *ofst, ArcSortType);\n\n}  // namespace script\n}  // namespace fst\n\n#endif  // FST_SCRIPT_ARCSORT_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/script/arg-packs.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// std::pair and std::tuple are used for the arguments of FstClass operations.\n//\n// If a function with a return value is required, use the WithReturnValue\n// template as follows:\n//\n// WithReturnValue<bool, std::tuple<...>>\n\n#ifndef FST_SCRIPT_ARG_PACKS_H_\n#define FST_SCRIPT_ARG_PACKS_H_\n\n#include <type_traits>\n\nnamespace fst {\nnamespace script {\n\n// Tack this on to an existing type to add a return value. The syntax for\n// accessing the args is then slightly more stilted, as you must do an extra\n// member access (since the args are stored as a member of this class).\n\ntemplate <class Retval, class ArgTuple>\nstruct WithReturnValue {\n  // Avoid reference-to-reference if ArgTuple is a reference.\n  using Args = typename std::remove_reference<ArgTuple>::type;\n\n  Retval retval;\n  const Args &args;\n\n  explicit WithReturnValue(const Args &args) : args(args) {}\n};\n\n}  // namespace script\n}  // namespace fst\n\n#endif  // FST_SCRIPT_ARG_PACKS_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/script/closure.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#ifndef FST_SCRIPT_CLOSURE_H_\n#define FST_SCRIPT_CLOSURE_H_\n\n#include <utility>\n\n#include <fst/closure.h>\n#include <fst/script/fst-class.h>\n\nnamespace fst {\nnamespace script {\n\nusing ClosureArgs = std::pair<MutableFstClass *, const ClosureType>;\n\ntemplate <class Arc>\nvoid Closure(ClosureArgs *args) {\n  MutableFst<Arc> *fst = std::get<0>(*args)->GetMutableFst<Arc>();\n  Closure(fst, std::get<1>(*args));\n}\n\nvoid Closure(MutableFstClass *ofst, ClosureType closure_type);\n\n}  // namespace script\n}  // namespace fst\n\n#endif  // FST_SCRIPT_CLOSURE_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/script/compile-impl.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Class to to compile a binary FST from textual input.\n\n#ifndef FST_SCRIPT_COMPILE_IMPL_H_\n#define FST_SCRIPT_COMPILE_IMPL_H_\n\n#include <iostream>\n#include <memory>\n#include <sstream>\n#include <string>\n#include <vector>\n\n#include <fst/fst.h>\n#include <fst/util.h>\n#include <fst/vector-fst.h>\n#include <unordered_map>\n\nDECLARE_string(fst_field_separator);\n\nnamespace fst {\n\n// Compile a binary Fst from textual input, helper class for fstcompile.cc\n// WARNING: Stand-alone use of this class not recommended, most code should\n// read/write using the binary format which is much more efficient.\ntemplate <class Arc>\nclass FstCompiler {\n public:\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  // WARNING: use of negative labels not recommended as it may cause conflicts.\n  // If add_symbols_ is true, then the symbols will be dynamically added to the\n  // symbol tables. This is only useful if you set the (i/o)keep flag to attach\n  // the final symbol table, or use the accessors. (The input symbol tables are\n  // const and therefore not changed.)\n  FstCompiler(std::istream &istrm, const string &source,  // NOLINT\n              const SymbolTable *isyms, const SymbolTable *osyms,\n              const SymbolTable *ssyms, bool accep, bool ikeep,\n              bool okeep, bool nkeep, bool allow_negative_labels = false) {\n    std::unique_ptr<SymbolTable> misyms(isyms ? isyms->Copy() : nullptr);\n    std::unique_ptr<SymbolTable> mosyms(osyms ? osyms->Copy() : nullptr);\n    std::unique_ptr<SymbolTable> mssyms(ssyms ? ssyms->Copy() : nullptr);\n    Init(istrm, source, misyms.get(), mosyms.get(), mssyms.get(), accep,\n         ikeep, okeep, nkeep, allow_negative_labels, false);\n  }\n\n  FstCompiler(std::istream &istrm, const string &source,  // NOLINT\n              SymbolTable *isyms, SymbolTable *osyms, SymbolTable *ssyms,\n              bool accep, bool ikeep, bool okeep, bool nkeep,\n              bool allow_negative_labels, bool add_symbols) {\n    Init(istrm, source, isyms, osyms, ssyms, accep, ikeep, okeep, nkeep,\n         allow_negative_labels, add_symbols);\n  }\n\n  void Init(std::istream &istrm, const string &source,  // NOLINT\n            SymbolTable *isyms, SymbolTable *osyms, SymbolTable *ssyms,\n            bool accep, bool ikeep, bool okeep, bool nkeep,\n            bool allow_negative_labels, bool add_symbols) {\n    nline_ = 0;\n    source_ = source;\n    isyms_ = isyms;\n    osyms_ = osyms;\n    ssyms_ = ssyms;\n    nstates_ = 0;\n    keep_state_numbering_ = nkeep;\n    allow_negative_labels_ = allow_negative_labels;\n    add_symbols_ = add_symbols;\n    bool start_state_populated = false;\n    char line[kLineLen];\n    const string separator = FLAGS_fst_field_separator + \"\\n\";\n    while (istrm.getline(line, kLineLen)) {\n      ++nline_;\n      std::vector<char *> col;\n      SplitString(line, separator.c_str(), &col, true);\n      if (col.empty() || col[0][0] == '\\0')\n        continue;\n      if (col.size() > 5 || (col.size() > 4 && accep) ||\n          (col.size() == 3 && !accep)) {\n        FSTERROR() << \"FstCompiler: Bad number of columns, source = \" << source_\n                   << \", line = \" << nline_;\n        fst_.SetProperties(kError, kError);\n        return;\n      }\n      StateId s = StrToStateId(col[0]);\n      while (s >= fst_.NumStates()) fst_.AddState();\n      if (!start_state_populated) {\n        fst_.SetStart(s);\n        start_state_populated = true;\n      }\n\n      Arc arc;\n      StateId d = s;\n      switch (col.size()) {\n        case 1:\n          fst_.SetFinal(s, Weight::One());\n          break;\n        case 2:\n          fst_.SetFinal(s, StrToWeight(col[1], true));\n          break;\n        case 3:\n          arc.nextstate = d = StrToStateId(col[1]);\n          arc.ilabel = StrToILabel(col[2]);\n          arc.olabel = arc.ilabel;\n          arc.weight = Weight::One();\n          fst_.AddArc(s, arc);\n          break;\n        case 4:\n          arc.nextstate = d = StrToStateId(col[1]);\n          arc.ilabel = StrToILabel(col[2]);\n          if (accep) {\n            arc.olabel = arc.ilabel;\n            arc.weight = StrToWeight(col[3], true);\n          } else {\n            arc.olabel = StrToOLabel(col[3]);\n            arc.weight = Weight::One();\n          }\n          fst_.AddArc(s, arc);\n          break;\n        case 5:\n          arc.nextstate = d = StrToStateId(col[1]);\n          arc.ilabel = StrToILabel(col[2]);\n          arc.olabel = StrToOLabel(col[3]);\n          arc.weight = StrToWeight(col[4], true);\n          fst_.AddArc(s, arc);\n      }\n      while (d >= fst_.NumStates()) fst_.AddState();\n    }\n    if (ikeep) fst_.SetInputSymbols(isyms);\n    if (okeep) fst_.SetOutputSymbols(osyms);\n  }\n\n  const VectorFst<Arc> &Fst() const { return fst_; }\n\n private:\n  // Maximum line length in text file.\n  static constexpr int kLineLen = 8096;\n\n  StateId StrToId(const char *s, SymbolTable *syms, const char *name,\n                  bool allow_negative = false) const {\n    StateId n = 0;\n    if (syms) {\n      n = (add_symbols_) ? syms->AddSymbol(s) : syms->Find(s);\n      if (n == -1 || (!allow_negative && n < 0)) {\n        FSTERROR() << \"FstCompiler: Symbol \\\"\" << s\n                   << \"\\\" is not mapped to any integer \" << name\n                   << \", symbol table = \" << syms->Name()\n                   << \", source = \" << source_ << \", line = \" << nline_;\n        fst_.SetProperties(kError, kError);\n      }\n    } else {\n      char *p;\n      n = strtoll(s, &p, 10);\n      if (p < s + strlen(s) || (!allow_negative && n < 0)) {\n        FSTERROR() << \"FstCompiler: Bad \" << name << \" integer = \\\"\" << s\n                   << \"\\\", source = \" << source_ << \", line = \" << nline_;\n        fst_.SetProperties(kError, kError);\n      }\n    }\n    return n;\n  }\n\n  StateId StrToStateId(const char *s) {\n    StateId n = StrToId(s, ssyms_, \"state ID\");\n    if (keep_state_numbering_) return n;\n    // Remaps state IDs to make dense set.\n    const auto it = states_.find(n);\n    if (it == states_.end()) {\n      states_[n] = nstates_;\n      return nstates_++;\n    } else {\n      return it->second;\n    }\n  }\n\n  StateId StrToILabel(const char *s) const {\n    return StrToId(s, isyms_, \"arc ilabel\", allow_negative_labels_);\n  }\n\n  StateId StrToOLabel(const char *s) const {\n    return StrToId(s, osyms_, \"arc olabel\", allow_negative_labels_);\n  }\n\n  Weight StrToWeight(const char *s, bool allow_zero) const {\n    Weight w;\n    std::istringstream strm(s);\n    strm >> w;\n    if (!strm || (!allow_zero && w == Weight::Zero())) {\n      FSTERROR() << \"FstCompiler: Bad weight = \\\"\" << s\n                 << \"\\\", source = \" << source_ << \", line = \" << nline_;\n      fst_.SetProperties(kError, kError);\n      w = Weight::NoWeight();\n    }\n    return w;\n  }\n\n  mutable VectorFst<Arc> fst_;\n  size_t nline_;\n  string source_;       // Text FST source name.\n  SymbolTable *isyms_;  // ilabel symbol table (not owned).\n  SymbolTable *osyms_;  // olabel symbol table (not owned).\n  SymbolTable *ssyms_;  // slabel symbol table (not owned).\n  std::unordered_map<StateId, StateId> states_;  // State ID map.\n  StateId nstates_;                              // Number of seen states.\n  bool keep_state_numbering_;\n  bool allow_negative_labels_;  // Not recommended; may cause conflicts.\n  bool add_symbols_;            // Add to symbol tables on-the fly.\n\n  FstCompiler(const FstCompiler &) = delete;\n  FstCompiler &operator=(const FstCompiler &) = delete;\n};\n\n}  // namespace fst\n\n#endif  // FST_SCRIPT_COMPILE_IMPL_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/script/compile.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#ifndef FST_SCRIPT_COMPILE_H_\n#define FST_SCRIPT_COMPILE_H_\n\n#include <istream>\n#include <memory>\n\n#include <fst/script/arg-packs.h>\n#include <fst/script/compile-impl.h>\n#include <fst/script/fst-class.h>\n\nnamespace fst {\nnamespace script {\n\n// This operation exists in two forms. 1 is a void operation which writes the\n// compiled machine to disk; 2 returns an FstClass. I/O should normally be done\n// using the binary format for efficiency, so users are STRONGLY ENCOURAGED to\n// use 1 or to construct FSTs using the C++ FST mutation operations.\n\n// Note: it is safe to pass these strings as references because\n// this struct is only used to pass them deeper in the call graph.\n// Be sure you understand why this is so before using this struct\n// for anything else!\nstruct CompileFstInnerArgs {\n  std::istream &istrm;\n  const string &source;\n  const string &fst_type;\n  const fst::SymbolTable *isyms;\n  const fst::SymbolTable *osyms;\n  const fst::SymbolTable *ssyms;\n  const bool accep;\n  const bool ikeep;\n  const bool okeep;\n  const bool nkeep;\n  const bool allow_negative_labels;\n\n  CompileFstInnerArgs(std::istream &istrm, const string &source,\n                      const string &fst_type, const fst::SymbolTable *isyms,\n                      const fst::SymbolTable *osyms,\n                      const fst::SymbolTable *ssyms, bool accep, bool ikeep,\n                      bool okeep, bool nkeep,\n                      bool allow_negative_labels = false)\n      : istrm(istrm),\n        source(source),\n        fst_type(fst_type),\n        isyms(isyms),\n        osyms(osyms),\n        ssyms(ssyms),\n        accep(accep),\n        ikeep(ikeep),\n        okeep(okeep),\n        nkeep(nkeep),\n        allow_negative_labels(allow_negative_labels) {}\n};\n\nusing CompileFstArgs = WithReturnValue<FstClass *, CompileFstInnerArgs>;\n\ntemplate <class Arc>\nvoid CompileFstInternal(CompileFstArgs *args) {\n  using fst::Convert;\n  using fst::Fst;\n  using fst::FstCompiler;\n  FstCompiler<Arc> fstcompiler(\n      args->args.istrm, args->args.source, args->args.isyms, args->args.osyms,\n      args->args.ssyms, args->args.accep, args->args.ikeep, args->args.okeep,\n      args->args.nkeep, args->args.allow_negative_labels);\n  const Fst<Arc> *fst = &fstcompiler.Fst();\n  std::unique_ptr<const Fst<Arc>> owned_fst;\n  if (args->args.fst_type != \"vector\") {\n    owned_fst.reset(Convert<Arc>(*fst, args->args.fst_type));\n    if (!owned_fst) {\n      FSTERROR() << \"Failed to convert FST to desired type: \"\n                 << args->args.fst_type;\n    }\n    fst = owned_fst.get();\n  }\n  args->retval = fst ? new FstClass(*fst) : nullptr;\n}\n\nvoid CompileFst(std::istream &istrm, const string &source, const string &dest,\n                const string &fst_type, const string &arc_type,\n                const SymbolTable *isyms, const SymbolTable *osyms,\n                const SymbolTable *ssyms, bool accep, bool ikeep, bool okeep,\n                bool nkeep, bool allow_negative_labels);\n\nFstClass *CompileFstInternal(std::istream &istrm, const string &source,\n                             const string &fst_type, const string &arc_type,\n                             const SymbolTable *isyms, const SymbolTable *osyms,\n                             const SymbolTable *ssyms, bool accep, bool ikeep,\n                             bool okeep, bool nkeep,\n                             bool allow_negative_labels);\n\n}  // namespace script\n}  // namespace fst\n\n#endif  // FST_SCRIPT_COMPILE_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/script/compose.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#ifndef FST_SCRIPT_COMPOSE_H_\n#define FST_SCRIPT_COMPOSE_H_\n\n#include <tuple>\n\n#include <fst/compose.h>\n#include <fst/script/fst-class.h>\n\nnamespace fst {\nnamespace script {\n\nusing ComposeArgs = std::tuple<const FstClass &, const FstClass &,\n                               MutableFstClass *, const ComposeOptions &>;\n\ntemplate <class Arc>\nvoid Compose(ComposeArgs *args) {\n  const Fst<Arc> &ifst1 = *(std::get<0>(*args).GetFst<Arc>());\n  const Fst<Arc> &ifst2 = *(std::get<1>(*args).GetFst<Arc>());\n  MutableFst<Arc> *ofst = std::get<2>(*args)->GetMutableFst<Arc>();\n  const auto &opts = std::get<3>(*args);\n  Compose(ifst1, ifst2, ofst, opts);\n}\n\nvoid Compose(const FstClass &ifst1, const FstClass &ifst2,\n             MutableFstClass *ofst,\n             const ComposeOptions &opts = ComposeOptions());\n\n}  // namespace script\n}  // namespace fst\n\n#endif  // FST_SCRIPT_COMPOSE_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/script/concat.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#ifndef FST_SCRIPT_CONCAT_H_\n#define FST_SCRIPT_CONCAT_H_\n\n#include <utility>\n\n#include <fst/concat.h>\n#include <fst/script/fst-class.h>\n\nnamespace fst {\nnamespace script {\n\nusing ConcatArgs1 = std::pair<MutableFstClass *, const FstClass &>;\n\ntemplate <class Arc>\nvoid Concat(ConcatArgs1 *args) {\n  MutableFst<Arc> *ofst = std::get<0>(*args)->GetMutableFst<Arc>();\n  const Fst<Arc> &ifst = *(std::get<1>(*args).GetFst<Arc>());\n  Concat(ofst, ifst);\n}\n\nusing ConcatArgs2 = std::pair<const FstClass &, MutableFstClass *>;\n\ntemplate <class Arc>\nvoid Concat(ConcatArgs2 *args) {\n  const Fst<Arc> &ifst = *(std::get<0>(*args).GetFst<Arc>());\n  MutableFst<Arc> *ofst = std::get<1>(*args)->GetMutableFst<Arc>();\n  Concat(ifst, ofst);\n}\n\nvoid Concat(MutableFstClass *ofst, const FstClass &ifst);\n\nvoid Concat(const FstClass &ifst, MutableFstClass *ofst);\n\n}  // namespace script\n}  // namespace fst\n\n#endif  // FST_SCRIPT_CONCAT_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/script/connect.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#ifndef FST_SCRIPT_CONNECT_H_\n#define FST_SCRIPT_CONNECT_H_\n\n#include <fst/connect.h>\n#include <fst/script/fst-class.h>\n\nnamespace fst {\nnamespace script {\n\ntemplate <class Arc>\nvoid Connect(MutableFstClass *fst) {\n  Connect(fst->GetMutableFst<Arc>());\n}\n\nvoid Connect(MutableFstClass *fst);\n\n}  // namespace script\n}  // namespace fst\n\n#endif  // FST_SCRIPT_CONNECT_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/script/convert.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#ifndef FST_SCRIPT_CONVERT_H_\n#define FST_SCRIPT_CONVERT_H_\n\n#include <memory>\n#include <string>\n#include <utility>\n\n#include <fst/register.h>\n#include <fst/script/arg-packs.h>\n#include <fst/script/fst-class.h>\n\nnamespace fst {\nnamespace script {\n\nusing ConvertInnerArgs = std::pair<const FstClass &, const string &>;\n\nusing ConvertArgs = WithReturnValue<FstClass *, ConvertInnerArgs>;\n\ntemplate <class Arc>\nvoid Convert(ConvertArgs *args) {\n  const Fst<Arc> &fst = *(std::get<0>(args->args).GetFst<Arc>());\n  const string &new_type = std::get<1>(args->args);\n  std::unique_ptr<Fst<Arc>> result(Convert(fst, new_type));\n  args->retval = result ? new FstClass(*result) : nullptr;\n}\n\nFstClass *Convert(const FstClass &fst, const string &new_type);\n\n}  // namespace script\n}  // namespace fst\n\n#endif  // FST_SCRIPT_CONVERT_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/script/decode.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#ifndef FST_SCRIPT_DECODE_H_\n#define FST_SCRIPT_DECODE_H_\n\n#include <memory>\n#include <string>\n#include <utility>\n\n#include <fst/encode.h>\n#include <fst/script/encodemapper-class.h>\n#include <fst/script/fst-class.h>\n\nnamespace fst {\nnamespace script {\n\nusing DecodeArgs1 = std::pair<MutableFstClass *, const string &>;\n\ntemplate <class Arc>\nvoid Decode(DecodeArgs1 *args) {\n  MutableFst<Arc> *fst = std::get<0>(*args)->GetMutableFst<Arc>();\n  std::unique_ptr<EncodeMapper<Arc>> decoder(\n      EncodeMapper<Arc>::Read(std::get<1>(*args), DECODE));\n  if (!decoder) {\n    fst->SetProperties(kError, kError);\n    return;\n  }\n  Decode(fst, *decoder);\n}\n\nusing DecodeArgs2 = std::pair<MutableFstClass *, const EncodeMapperClass &>;\n\ntemplate <class Arc>\nvoid Decode(DecodeArgs2 *args) {\n  MutableFst<Arc> *fst = std::get<0>(*args)->GetMutableFst<Arc>();\n  const EncodeMapper<Arc> &encoder =\n      *(std::get<1>(*args).GetEncodeMapper<Arc>());\n  Decode(fst, encoder);\n}\n\nvoid Decode(MutableFstClass *fst, const string &coder_fname);\n\nvoid Decode(MutableFstClass *fst, const EncodeMapperClass &encoder);\n\n}  // namespace script\n}  // namespace fst\n\n#endif  // FST_SCRIPT_DECODE_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/script/determinize.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#ifndef FST_SCRIPT_DETERMINIZE_H_\n#define FST_SCRIPT_DETERMINIZE_H_\n\n#include <tuple>\n\n#include <fst/determinize.h>\n#include <fst/script/fst-class.h>\n#include <fst/script/weight-class.h>\n\nnamespace fst {\nnamespace script {\n\nstruct DeterminizeOptions {\n  const float delta;\n  const WeightClass &weight_threshold;\n  const int64_t state_threshold;\n  const int64_t subsequential_label;\n  const DeterminizeType det_type;\n  const bool increment_subsequential_label;\n\n  DeterminizeOptions(float delta, const WeightClass &weight_threshold,\n                     int64_t state_threshold = kNoStateId,\n                     int64_t subsequential_label = 0,\n                     DeterminizeType det_type = DETERMINIZE_FUNCTIONAL,\n                     bool increment_subsequential_label = false)\n      : delta(delta),\n        weight_threshold(weight_threshold),\n        state_threshold(state_threshold),\n        subsequential_label(subsequential_label),\n        det_type(det_type),\n        increment_subsequential_label(increment_subsequential_label) {}\n};\n\nusing DeterminizeArgs = std::tuple<const FstClass &, MutableFstClass *,\n                                   const DeterminizeOptions &>;\n\ntemplate <class Arc>\nvoid Determinize(DeterminizeArgs *args) {\n  using Weight = typename Arc::Weight;\n  const Fst<Arc> &ifst = *(std::get<0>(*args).GetFst<Arc>());\n  MutableFst<Arc> *ofst = std::get<1>(*args)->GetMutableFst<Arc>();\n  const auto &opts = std::get<2>(*args);\n  const auto weight_threshold = *(opts.weight_threshold.GetWeight<Weight>());\n  const fst::DeterminizeOptions<Arc> detargs(opts.delta, weight_threshold,\n      opts.state_threshold, opts.subsequential_label, opts.det_type,\n      opts.increment_subsequential_label);\n  Determinize(ifst, ofst, detargs);\n}\n\nvoid Determinize(const FstClass &ifst, MutableFstClass *ofst,\n                 const DeterminizeOptions &opts);\n\n}  // namespace script\n}  // namespace fst\n\n#endif  // FST_SCRIPT_DETERMINIZE_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/script/difference.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#ifndef FST_SCRIPT_DIFFERENCE_H_\n#define FST_SCRIPT_DIFFERENCE_H_\n\n#include <tuple>\n\n#include <fst/difference.h>\n#include <fst/script/compose.h>\n#include <fst/script/fst-class.h>\n\nnamespace fst {\nnamespace script {\n\nusing DifferenceArgs = std::tuple<const FstClass &, const FstClass &,\n                                  MutableFstClass *, const ComposeOptions &>;\n\ntemplate <class Arc>\nvoid Difference(DifferenceArgs *args) {\n  const Fst<Arc> &ifst1 = *(std::get<0>(*args).GetFst<Arc>());\n  const Fst<Arc> &ifst2 = *(std::get<1>(*args).GetFst<Arc>());\n  MutableFst<Arc> *ofst = std::get<2>(*args)->GetMutableFst<Arc>();\n  const auto &opts = std::get<3>(*args);\n  Difference(ifst1, ifst2, ofst, opts);\n}\n\nvoid Difference(const FstClass &ifst1, const FstClass &ifst2,\n                MutableFstClass *ofst,\n                const ComposeOptions &opts = ComposeOptions());\n\n}  // namespace script\n}  // namespace fst\n\n#endif  // FST_SCRIPT_DIFFERENCE_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/script/disambiguate.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#ifndef FST_SCRIPT_DISAMBIGUATE_H_\n#define FST_SCRIPT_DISAMBIGUATE_H_\n\n#include <tuple>\n#include <utility>\n\n#include <fst/disambiguate.h>\n#include <fst/script/fst-class.h>\n#include <fst/script/weight-class.h>\n\nnamespace fst {\nnamespace script {\n\nstruct DisambiguateOptions {\n  const float delta;\n  const WeightClass &weight_threshold;\n  const int64_t state_threshold;\n  const int64_t subsequential_label;\n\n  DisambiguateOptions(float delta, const WeightClass &weight_threshold,\n                      int64_t state_threshold = kNoStateId,\n                      int64_t subsequential_label = 0)\n      : delta(delta),\n        weight_threshold(weight_threshold),\n        state_threshold(state_threshold),\n        subsequential_label(subsequential_label) {}\n};\n\nusing DisambiguateArgs = std::tuple<const FstClass &, MutableFstClass *,\n                                     const DisambiguateOptions &>;\n\ntemplate <class Arc>\nvoid Disambiguate(DisambiguateArgs *args) {\n  using Weight = typename Arc::Weight;\n  const Fst<Arc> &ifst = *(std::get<0>(*args).GetFst<Arc>());\n  MutableFst<Arc> *ofst = std::get<1>(*args)->GetMutableFst<Arc>();\n  const auto &opts = std::get<2>(*args);\n  const auto weight_threshold = *(opts.weight_threshold.GetWeight<Weight>());\n  const fst::DisambiguateOptions<Arc> disargs(opts.delta, weight_threshold,\n                                                  opts.state_threshold,\n                                                  opts.subsequential_label);\n  Disambiguate(ifst, ofst, disargs);\n}\n\nvoid Disambiguate(const FstClass &ifst, MutableFstClass *ofst,\n                  const DisambiguateOptions &opts);\n\n}  // namespace script\n}  // namespace fst\n\n#endif  // FST_SCRIPT_DISAMBIGUATE_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/script/draw-impl.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Class to draw a binary FST by producing a text file in dot format, a helper\n// class to fstdraw.cc.\n\n#ifndef FST_SCRIPT_DRAW_IMPL_H_\n#define FST_SCRIPT_DRAW_IMPL_H_\n\n#include <ostream>\n#include <sstream>\n#include <string>\n\n#include <fst/fst.h>\n#include <fst/util.h>\n#include <fst/script/fst-class.h>\n\nnamespace fst {\n\n// Print a binary FST in GraphViz textual format (helper class for fstdraw.cc).\n// WARNING: Stand-alone use not recommend.\ntemplate <class Arc>\nclass FstDrawer {\n public:\n  using Label = typename Arc::Label;\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  FstDrawer(const Fst<Arc> &fst, const SymbolTable *isyms,\n            const SymbolTable *osyms, const SymbolTable *ssyms, bool accep,\n            const string &title, float width, float height, bool portrait,\n            bool vertical, float ranksep, float nodesep, int fontsize,\n            int precision, const string &float_format, bool show_weight_one)\n      : fst_(fst),\n        isyms_(isyms),\n        osyms_(osyms),\n        ssyms_(ssyms),\n        accep_(accep && fst.Properties(kAcceptor, true)),\n        ostrm_(nullptr),\n        title_(title),\n        width_(width),\n        height_(height),\n        portrait_(portrait),\n        vertical_(vertical),\n        ranksep_(ranksep),\n        nodesep_(nodesep),\n        fontsize_(fontsize),\n        precision_(precision),\n        float_format_(float_format),\n        show_weight_one_(show_weight_one) {}\n\n  // Draws FST to an output buffer.\n  void Draw(std::ostream *strm, const string &dest) {\n    ostrm_ = strm;\n    SetStreamState(ostrm_);\n    dest_ = dest;\n    StateId start = fst_.Start();\n    if (start == kNoStateId) return;\n    PrintString(\"digraph FST {\\n\");\n    if (vertical_) {\n      PrintString(\"rankdir = BT;\\n\");\n    } else {\n      PrintString(\"rankdir = LR;\\n\");\n    }\n    PrintString(\"size = \\\"\");\n    Print(width_);\n    PrintString(\",\");\n    Print(height_);\n    PrintString(\"\\\";\\n\");\n    if (!dest_.empty()) PrintString(\"label = \\\"\" + title_ + \"\\\";\\n\");\n    PrintString(\"center = 1;\\n\");\n    if (portrait_) {\n      PrintString(\"orientation = Portrait;\\n\");\n    } else {\n      PrintString(\"orientation = Landscape;\\n\");\n    }\n    PrintString(\"ranksep = \\\"\");\n    Print(ranksep_);\n    PrintString(\"\\\";\\n\");\n    PrintString(\"nodesep = \\\"\");\n    Print(nodesep_);\n    PrintString(\"\\\";\\n\");\n    // Initial state first.\n    DrawState(start);\n    for (StateIterator<Fst<Arc>> siter(fst_); !siter.Done(); siter.Next()) {\n      const auto s = siter.Value();\n      if (s != start) DrawState(s);\n    }\n    PrintString(\"}\\n\");\n  }\n\n private:\n  void SetStreamState(std::ostream* strm) const {\n    strm->precision(precision_);\n    if (float_format_ == \"e\")\n        strm->setf(std::ios_base::scientific, std::ios_base::floatfield);\n    if (float_format_ == \"f\")\n        strm->setf(std::ios_base::fixed, std::ios_base::floatfield);\n    // O.w. defaults to \"g\" per standard lib.\n  }\n\n  void PrintString(const string &str) const { *ostrm_ << str; }\n\n  // Escapes backslash and double quote if these occur in the string. Dot will\n  // not deal gracefully with these if they are not escaped.\n  static string Escape(const string &str) {\n    string ns;\n    for (char c : str) {\n      if (c == '\\\\' || c == '\"') ns.push_back('\\\\');\n      ns.push_back(c);\n    }\n    return ns;\n  }\n\n  void PrintId(StateId id, const SymbolTable *syms, const char *name) const {\n    if (syms) {\n      auto symbol = syms->Find(id);\n      if (symbol.empty()) {\n        FSTERROR() << \"FstDrawer: Integer \" << id\n                   << \" is not mapped to any textual symbol\"\n                   << \", symbol table = \" << syms->Name()\n                   << \", destination = \" << dest_;\n        symbol = \"?\";\n      }\n      PrintString(Escape(symbol));\n    } else {\n      PrintString(std::to_string(id));\n    }\n  }\n\n  void PrintStateId(StateId s) const { PrintId(s, ssyms_, \"state ID\"); }\n\n  void PrintILabel(Label label) const {\n    PrintId(label, isyms_, \"arc input label\");\n  }\n\n  void PrintOLabel(Label label) const {\n    PrintId(label, osyms_, \"arc output label\");\n  }\n\n  void PrintWeight(Weight w) const {\n    // Weight may have double quote characters in it, so escape it.\n    PrintString(Escape(ToString(w)));\n  }\n\n  template <class T>\n  void Print(T t) const { *ostrm_ << t; }\n\n  template <class T>\n  string ToString(T t) const {\n    std::stringstream ss;\n    SetStreamState(&ss);\n    ss << t;\n    return ss.str();\n  }\n\n  void DrawState(StateId s) const {\n    Print(s);\n    PrintString(\" [label = \\\"\");\n    PrintStateId(s);\n    const auto weight = fst_.Final(s);\n    if (weight != Weight::Zero()) {\n      if (show_weight_one_ || (weight != Weight::One())) {\n        PrintString(\"/\");\n        PrintWeight(weight);\n      }\n      PrintString(\"\\\", shape = doublecircle,\");\n    } else {\n      PrintString(\"\\\", shape = circle,\");\n    }\n    if (s == fst_.Start()) {\n      PrintString(\" style = bold,\");\n    } else {\n      PrintString(\" style = solid,\");\n    }\n    PrintString(\" fontsize = \");\n    Print(fontsize_);\n    PrintString(\"]\\n\");\n    for (ArcIterator<Fst<Arc>> aiter(fst_, s); !aiter.Done(); aiter.Next()) {\n      const auto &arc = aiter.Value();\n      PrintString(\"\\t\");\n      Print(s);\n      PrintString(\" -> \");\n      Print(arc.nextstate);\n      PrintString(\" [label = \\\"\");\n      PrintILabel(arc.ilabel);\n      if (!accep_) {\n        PrintString(\":\");\n        PrintOLabel(arc.olabel);\n      }\n      if (show_weight_one_ || (arc.weight != Weight::One())) {\n        PrintString(\"/\");\n        PrintWeight(arc.weight);\n      }\n      PrintString(\"\\\", fontsize = \");\n      Print(fontsize_);\n      PrintString(\"];\\n\");\n    }\n  }\n\n  const Fst<Arc> &fst_;\n  const SymbolTable *isyms_;  // ilabel symbol table.\n  const SymbolTable *osyms_;  // olabel symbol table.\n  const SymbolTable *ssyms_;  // slabel symbol table.\n  bool accep_;                // Print as acceptor when possible.\n  std::ostream *ostrm_;       // Drawn FST destination.\n  string dest_;               // Drawn FST destination name.\n\n  string title_;\n  float width_;\n  float height_;\n  bool portrait_;\n  bool vertical_;\n  float ranksep_;\n  float nodesep_;\n  int fontsize_;\n  int precision_;\n  string float_format_;\n  bool show_weight_one_;\n\n  FstDrawer(const FstDrawer &) = delete;\n  FstDrawer &operator=(const FstDrawer &) = delete;\n};\n\n}  // namespace fst\n\n#endif  // FST_SCRIPT_DRAW_IMPL_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/script/draw.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#ifndef FST_SCRIPT_DRAW_H_\n#define FST_SCRIPT_DRAW_H_\n\n#include <ostream>\n\n#include <fst/script/draw-impl.h>\n#include <fst/script/fst-class.h>\n\nnamespace fst {\nnamespace script {\n\n// Note: it is safe to pass these strings as references because\n// this struct is only used to pass them deeper in the call graph.\n// Be sure you understand why this is so before using this struct\n// for anything else!\nstruct FstDrawerArgs {\n  const FstClass &fst;\n  const SymbolTable *isyms;\n  const SymbolTable *osyms;\n  const SymbolTable *ssyms;\n  const bool accep;\n  const string &title;\n  const float width;\n  const float height;\n  const bool portrait;\n  const bool vertical;\n  const float ranksep;\n  const float nodesep;\n  const int fontsize;\n  const int precision;\n  const string &float_format;  // NOLINT\n  const bool show_weight_one;\n  std::ostream *ostrm;\n  const string &dest;\n\n  FstDrawerArgs(const FstClass &fst, const SymbolTable *isyms,\n                const SymbolTable *osyms, const SymbolTable *ssyms, bool accep,\n                const string &title, float width, float height, bool portrait,\n                bool vertical, float ranksep, float nodesep, int fontsize,\n                int precision, const string &float_format,\n                bool show_weight_one, std::ostream *ostrm,  const string &dest)\n      : fst(fst),\n        isyms(isyms),\n        osyms(osyms),\n        ssyms(ssyms),\n        accep(accep),\n        title(title),\n        width(width),\n        height(height),\n        portrait(portrait),\n        vertical(vertical),\n        ranksep(ranksep),\n        nodesep(nodesep),\n        fontsize(fontsize),\n        precision(precision),\n        float_format(float_format),\n        show_weight_one(show_weight_one),\n        ostrm(ostrm),\n        dest(dest) {}\n};\n\ntemplate <class Arc>\nvoid DrawFst(FstDrawerArgs *args) {\n  const Fst<Arc> &fst = *(args->fst.GetFst<Arc>());\n  FstDrawer<Arc> fstdrawer(fst, args->isyms, args->osyms, args->ssyms,\n      args->accep, args->title, args->width, args->height, args->portrait,\n      args->vertical, args->ranksep, args->nodesep, args->fontsize,\n      args->precision, args->float_format, args->show_weight_one);\n  fstdrawer.Draw(args->ostrm, args->dest);\n}\n\nvoid DrawFst(const FstClass &fst, const SymbolTable *isyms,\n             const SymbolTable *osyms, const SymbolTable *ssyms, bool accep,\n             const string &title, float width, float height, bool portrait,\n             bool vertical, float ranksep, float nodesep, int fontsize,\n             int precision, const string &float_format, bool show_weight_one,\n             std::ostream *ostrm, const string &dest);\n\n}  // namespace script\n}  // namespace fst\n\n#endif  // FST_SCRIPT_DRAW_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/script/encode.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#ifndef FST_SCRIPT_ENCODE_H_\n#define FST_SCRIPT_ENCODE_H_\n\n#include <memory>\n#include <string>\n#include <tuple>\n#include <utility>\n\n#include <fst/encode.h>\n#include <fst/script/encodemapper-class.h>\n#include <fst/script/fst-class.h>\n\nnamespace fst {\nnamespace script {\n\nusing EncodeArgs1 = std::tuple<MutableFstClass *, uint32_t, bool, const string &>;\n\ntemplate <class Arc>\nvoid Encode(EncodeArgs1 *args) {\n  MutableFst<Arc> *fst = std::get<0>(*args)->GetMutableFst<Arc>();\n  const string &coder_fname = std::get<3>(*args);\n  // If true, reuse encode from disk. If false, make a new encoder and just use\n  // the filename argument as the destination state.\n  std::unique_ptr<EncodeMapper<Arc>> encoder(\n      std::get<2>(*args) ? EncodeMapper<Arc>::Read(coder_fname, ENCODE)\n                         : new EncodeMapper<Arc>(std::get<1>(*args), ENCODE));\n  Encode(fst, encoder.get());\n  if (!std::get<2>(*args)) encoder->Write(coder_fname);\n}\n\nusing EncodeArgs2 = std::pair<MutableFstClass *, EncodeMapperClass *>;\n\ntemplate <class Arc>\nvoid Encode(EncodeArgs2 *args) {\n  MutableFst<Arc> *fst = std::get<0>(*args)->GetMutableFst<Arc>();\n  EncodeMapper<Arc> *encoder = std::get<1>(*args)->GetEncodeMapper<Arc>();\n  Encode(fst, encoder);\n}\n\nvoid Encode(MutableFstClass *fst, uint32_t flags, bool reuse_encoder,\n            const string &coder_fname);\n\nvoid Encode(MutableFstClass *fst, EncodeMapperClass *encoder);\n\n}  // namespace script\n}  // namespace fst\n\n#endif  // FST_SCRIPT_ENCODE_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/script/encodemapper-class.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#ifndef FST_SCRIPT_ENCODEMAPPER_CLASS_H_\n#define FST_SCRIPT_ENCODEMAPPER_CLASS_H_\n\n#include <memory>\n#include <string>\n#include <iostream>\n\n#include <fst/fstlib.h>\n#include <fst/script/arc-class.h>\n#include <fst/script/fst-class.h>\n\n// Scripting API support for EncodeMapper.\n\nnamespace fst {\nnamespace script {\n\n// Virtual interface implemented by each concrete EncodeMapperClassImpl<A>.\nclass EncodeMapperImplBase {\n public:\n  // Returns an encoded ArcClass.\n  virtual ArcClass operator()(const ArcClass &a) = 0;\n  virtual const string &ArcType() const = 0;\n  virtual uint32_t Flags() const = 0;\n  virtual uint64_t Properties(uint64_t inprops) = 0;\n  virtual EncodeType Type() const = 0;\n  virtual const SymbolTable *InputSymbols() const = 0;\n  virtual const SymbolTable *OutputSymbols() const = 0;\n  virtual void SetInputSymbols(const SymbolTable *syms) = 0;\n  virtual void SetOutputSymbols(const SymbolTable *syms) = 0;\n  virtual const string &WeightType() const = 0;\n  virtual ~EncodeMapperImplBase() {}\n};\n\n// Templated implementation.\ntemplate <class Arc>\nclass EncodeMapperClassImpl : public EncodeMapperImplBase {\n public:\n  EncodeMapperClassImpl(uint32_t flags, EncodeType type)\n      : encoder_(flags, type) {}\n\n  ArcClass operator()(const ArcClass &a) final;\n\n  const string &ArcType() const final { return Arc::Type(); }\n\n  uint32_t Flags() const final { return encoder_.Flags(); }\n\n  uint64_t Properties(uint64_t inprops) final {\n    return encoder_.Properties(inprops);\n  }\n\n  EncodeType Type() const final { return encoder_.Type(); }\n\n  const SymbolTable *InputSymbols() const final {\n    return encoder_.InputSymbols();\n  }\n\n  const SymbolTable *OutputSymbols() const final {\n    return encoder_.OutputSymbols();\n  }\n\n  void SetInputSymbols(const SymbolTable *syms) final {\n    encoder_.SetInputSymbols(syms);\n  }\n\n  void SetOutputSymbols(const SymbolTable *syms) final {\n    encoder_.SetOutputSymbols(syms);\n  }\n\n  const string &WeightType() const final { return Arc::Weight::Type(); }\n\n  ~EncodeMapperClassImpl() override {}\n\n  EncodeMapper<Arc> *GetImpl() const { return &encoder_; }\n\n  EncodeMapper<Arc> *GetImpl() { return &encoder_; }\n\n private:\n  EncodeMapper<Arc> encoder_;\n};\n\n// This is returned by value because it is very likely to undergo return-value\n// optimization.\ntemplate <class Arc>\ninline ArcClass EncodeMapperClassImpl<Arc>::operator()(const ArcClass &a) {\n  Arc arc(a.ilabel, a.olabel, *(a.weight.GetWeight<typename Arc::Weight>()),\n          a.nextstate);\n  return ArcClass(encoder_(arc));\n}\n\nclass EncodeMapperClass;\n\nusing InitEncodeMapperClassArgs =\n    std::tuple<uint32_t, EncodeType, EncodeMapperClass *>;\n\nclass EncodeMapperClass {\n public:\n  EncodeMapperClass(const string &arc_type, uint32_t flags, EncodeType type);\n\n  template <class Arc>\n  EncodeMapperClass(uint32_t flags, EncodeType type)\n      : impl_(new EncodeMapperClassImpl<Arc>(flags, type)) {}\n\n  ArcClass operator()(const ArcClass &arc) { return (*impl_)(arc); }\n\n  const string &ArcType() const { return impl_->ArcType(); }\n\n  uint32_t Flags() const { return impl_->Flags(); }\n\n  uint64_t Properties(uint64_t inprops) { return impl_->Properties(inprops); }\n\n  EncodeType Type() const { return impl_->Type(); }\n\n  const SymbolTable *InputSymbols() const { return impl_->InputSymbols(); }\n\n  const SymbolTable *OutputSymbols() const { return impl_->OutputSymbols(); }\n\n  void SetInputSymbols(const SymbolTable *syms) {\n    impl_->SetInputSymbols(syms);\n  }\n\n  void SetOutputSymbols(const SymbolTable *syms) {\n    impl_->SetOutputSymbols(syms);\n  }\n\n  const string &WeightType() const { return impl_->WeightType(); }\n\n  template <class Arc>\n  friend void InitEncodeMapperClass(InitEncodeMapperClassArgs *args);\n\n  // Naturally, this exists in non-const and const forms. Encoding arcs or FSTs\n  // mutates the underlying encoder; decoding them does not.\n\n  template <class Arc>\n  EncodeMapper<Arc> *GetEncodeMapper() {\n    if (Arc::Type() != ArcType()) {\n      return nullptr;\n    } else {\n      auto *typed_impl = static_cast<EncodeMapperClassImpl<Arc> *>(impl_.get());\n      return typed_impl->GetImpl();\n    }\n  }\n\n  template <class Arc>\n  const EncodeMapper<Arc> *GetEncodeMapper() const {\n    if (Arc::Type() != ArcType()) {\n      return nullptr;\n    } else {\n      auto *typed_impl = static_cast<EncodeMapperClassImpl<Arc> *>(impl_.get());\n      return typed_impl->GetImpl();\n    }\n  }\n\n private:\n  std::unique_ptr<EncodeMapperImplBase> impl_;\n};\n\ntemplate <class Arc>\nvoid InitEncodeMapperClass(InitEncodeMapperClassArgs *args) {\n  std::get<2>(*args)->impl_.reset(\n      new EncodeMapperClassImpl<Arc>(std::get<0>(*args), std::get<1>(*args)));\n}\n\n}  // namespace script\n}  // namespace fst\n\n#endif  // FST_SCRIPT_ENCODEMAPPER_CLASS_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/script/epsnormalize.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#ifndef FST_SCRIPT_EPSNORMALIZE_H_\n#define FST_SCRIPT_EPSNORMALIZE_H_\n\n#include <tuple>\n\n#include <fst/epsnormalize.h>\n#include <fst/script/fst-class.h>\n\nnamespace fst {\nnamespace script {\n\nusing EpsNormalizeArgs = std::tuple<const FstClass &, MutableFstClass *,\n                                    EpsNormalizeType>;\n\ntemplate <class Arc>\nvoid EpsNormalize(EpsNormalizeArgs *args) {\n  const Fst<Arc> &ifst = *(std::get<0>(*args).GetFst<Arc>());\n  MutableFst<Arc> *ofst = std::get<1>(*args)->GetMutableFst<Arc>();\n  EpsNormalize(ifst, ofst, std::get<2>(*args));\n}\n\nvoid EpsNormalize(const FstClass &ifst, MutableFstClass *ofst,\n                  EpsNormalizeType norm_type = EPS_NORM_INPUT);\n\n}  // namespace script\n}  // namespace fst\n\n#endif  // FST_SCRIPT_EPSNORMALIZE_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/script/equal.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#ifndef FST_SCRIPT_EQUAL_H_\n#define FST_SCRIPT_EQUAL_H_\n\n#include <tuple>\n\n#include <fst/equal.h>\n#include <fst/script/arg-packs.h>\n#include <fst/script/fst-class.h>\n\nnamespace fst {\nnamespace script {\n\nusing EqualInnerArgs = std::tuple<const FstClass &, const FstClass &, float>;\n\nusing EqualArgs = WithReturnValue<bool, EqualInnerArgs>;\n\ntemplate <class Arc>\nvoid Equal(EqualArgs *args) {\n  const Fst<Arc> &fst1 = *(std::get<0>(args->args).GetFst<Arc>());\n  const Fst<Arc> &fst2 = *(std::get<1>(args->args).GetFst<Arc>());\n  args->retval = Equal(fst1, fst2, std::get<2>(args->args));\n}\n\nbool Equal(const FstClass &fst1, const FstClass &fst2, float delta = kDelta);\n\n}  // namespace script\n}  // namespace fst\n\n#endif  // FST_SCRIPT_EQUAL_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/script/equivalent.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#ifndef FST_SCRIPT_EQUIVALENT_H_\n#define FST_SCRIPT_EQUIVALENT_H_\n\n#include <tuple>\n\n#include <fst/equivalent.h>\n#include <fst/script/arg-packs.h>\n#include <fst/script/fst-class.h>\n\nnamespace fst {\nnamespace script {\n\nusing EquivalentInnerArgs = std::tuple<const FstClass &, const FstClass &,\n                                       float>;\n\nusing EquivalentArgs = WithReturnValue<bool, EquivalentInnerArgs>;\n\ntemplate <class Arc>\nvoid Equivalent(EquivalentArgs *args) {\n  const Fst<Arc> &fst1 = *(std::get<0>(args->args).GetFst<Arc>());\n  const Fst<Arc> &fst2 = *(std::get<1>(args->args).GetFst<Arc>());\n  args->retval = Equivalent(fst1, fst2, std::get<2>(args->args));\n}\n\nbool Equivalent(const FstClass &fst1, const FstClass &fst2,\n                float delta = kDelta);\n\n}  // namespace script\n}  // namespace fst\n\n#endif  // FST_SCRIPT_EQUIVALENT_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/script/fst-class.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#ifndef FST_SCRIPT_FST_CLASS_H_\n#define FST_SCRIPT_FST_CLASS_H_\n\n#include <algorithm>\n#include <limits>\n#include <string>\n#include <type_traits>\n\n#include <fst/expanded-fst.h>\n#include <fst/fst.h>\n#include <fst/mutable-fst.h>\n#include <fst/vector-fst.h>\n#include <fst/script/arc-class.h>\n#include <fst/script/weight-class.h>\n\n// Classes to support \"boxing\" all existing types of FST arcs in a single\n// FstClass which hides the arc types. This allows clients to load\n// and work with FSTs without knowing the arc type. These classes are only\n// recommended for use in high-level scripting applications. Most users should\n// use the lower-level templated versions corresponding to these classes.\n\nnamespace fst {\nnamespace script {\n\n// Abstract base class defining the set of functionalities implemented in all\n// impls and passed through by all bases. Below FstClassBase the class\n// hierarchy bifurcates; FstClassImplBase serves as the base class for all\n// implementations (of which FstClassImpl is currently the only one) and\n// FstClass serves as the base class for all interfaces.\n\nclass FstClassBase {\n public:\n  virtual const string &ArcType() const = 0;\n  virtual WeightClass Final(int64_t) const = 0;\n  virtual const string &FstType() const = 0;\n  virtual const SymbolTable *InputSymbols() const = 0;\n  virtual size_t NumArcs(int64_t) const = 0;\n  virtual size_t NumInputEpsilons(int64_t) const = 0;\n  virtual size_t NumOutputEpsilons(int64_t) const = 0;\n  virtual const SymbolTable *OutputSymbols() const = 0;\n  virtual uint64_t Properties(uint64_t, bool) const = 0;\n  virtual int64_t Start() const = 0;\n  virtual const string &WeightType() const = 0;\n  virtual bool ValidStateId(int64_t) const = 0;\n  virtual bool Write(const string &) const = 0;\n  virtual bool Write(std::ostream &, const string &) const = 0;\n  virtual ~FstClassBase() {}\n};\n\n// Adds all the MutableFst methods.\nclass FstClassImplBase : public FstClassBase {\n public:\n  virtual bool AddArc(int64_t, const ArcClass &) = 0;\n  virtual int64_t AddState() = 0;\n  virtual FstClassImplBase *Copy() = 0;\n  virtual bool DeleteArcs(int64_t, size_t) = 0;\n  virtual bool DeleteArcs(int64_t) = 0;\n  virtual bool DeleteStates(const std::vector<int64_t> &) = 0;\n  virtual void DeleteStates() = 0;\n  virtual SymbolTable *MutableInputSymbols() = 0;\n  virtual SymbolTable *MutableOutputSymbols() = 0;\n  virtual int64_t NumStates() const = 0;\n  virtual bool ReserveArcs(int64_t, size_t) = 0;\n  virtual void ReserveStates(int64_t) = 0;\n  virtual void SetInputSymbols(SymbolTable *) = 0;\n  virtual bool SetFinal(int64_t, const WeightClass &) = 0;\n  virtual void SetOutputSymbols(SymbolTable *) = 0;\n  virtual void SetProperties(uint64_t, uint64_t) = 0;\n  virtual bool SetStart(int64_t) = 0;\n  ~FstClassImplBase() override {}\n};\n\n// Containiner class wrapping an Fst<Arc>, hiding its arc type. Whether this\n// Fst<Arc> pointer refers to a special kind of FST (e.g. a MutableFst) is\n// known by the type of interface class that owns the pointer to this\n// container.\n\ntemplate <class Arc>\nclass FstClassImpl : public FstClassImplBase {\n public:\n  explicit FstClassImpl(Fst<Arc> *impl, bool should_own = false)\n      : impl_(should_own ? impl : impl->Copy()) {}\n\n  explicit FstClassImpl(const Fst<Arc> &impl) : impl_(impl.Copy()) {}\n\n  // Warning: calling this method casts the FST to a mutable FST.\n  bool AddArc(int64_t s, const ArcClass &ac) final {\n    if (!ValidStateId(s)) return false;\n    // Note that we do not check that the destination state is valid, so users\n    // can add arcs before they add the corresponding states. Verify can be\n    // used to determine whether any arc has a nonexisting destination.\n    Arc arc(ac.ilabel, ac.olabel, *ac.weight.GetWeight<typename Arc::Weight>(),\n            ac.nextstate);\n    static_cast<MutableFst<Arc> *>(impl_.get())->AddArc(s, arc);\n    return true;\n  }\n\n  // Warning: calling this method casts the FST to a mutable FST.\n  int64_t AddState() final {\n    return static_cast<MutableFst<Arc> *>(impl_.get())->AddState();\n  }\n\n  const string &ArcType() const final { return Arc::Type(); }\n\n  FstClassImpl *Copy() final { return new FstClassImpl<Arc>(impl_.get()); }\n\n  // Warning: calling this method casts the FST to a mutable FST.\n  bool DeleteArcs(int64_t s, size_t n) final {\n    if (!ValidStateId(s)) return false;\n    static_cast<MutableFst<Arc> *>(impl_.get())->DeleteArcs(s, n);\n    return true;\n  }\n\n  // Warning: calling this method casts the FST to a mutable FST.\n  bool DeleteArcs(int64_t s) final {\n    if (!ValidStateId(s)) return false;\n    static_cast<MutableFst<Arc> *>(impl_.get())->DeleteArcs(s);\n    return true;\n  }\n\n  // Warning: calling this method casts the FST to a mutable FST.\n  bool DeleteStates(const std::vector<int64_t> &dstates) final {\n    for (const auto &state : dstates)\n      if (!ValidStateId(state)) return false;\n    // Warning: calling this method with any integers beyond the precision of\n    // the underlying FST will result in truncation.\n    std::vector<typename Arc::StateId> typed_dstates(dstates.size());\n    std::copy(dstates.begin(), dstates.end(), typed_dstates.begin());\n    static_cast<MutableFst<Arc> *>(impl_.get())->DeleteStates(typed_dstates);\n    return true;\n  }\n\n  // Warning: calling this method casts the FST to a mutable FST.\n  void DeleteStates() final {\n    static_cast<MutableFst<Arc> *>(impl_.get())->DeleteStates();\n  }\n\n  WeightClass Final(int64_t s) const final {\n    if (!ValidStateId(s)) return WeightClass::NoWeight(WeightType());\n    WeightClass w(impl_->Final(s));\n    return w;\n  }\n\n  const string &FstType() const final { return impl_->Type(); }\n\n  const SymbolTable *InputSymbols() const final {\n    return impl_->InputSymbols();\n  }\n\n  // Warning: calling this method casts the FST to a mutable FST.\n  SymbolTable *MutableInputSymbols() final {\n    return static_cast<MutableFst<Arc> *>(impl_.get())->MutableInputSymbols();\n  }\n\n  // Warning: calling this method casts the FST to a mutable FST.\n  SymbolTable *MutableOutputSymbols() final {\n    return static_cast<MutableFst<Arc> *>(impl_.get())->MutableOutputSymbols();\n  }\n\n  // Signals failure by returning size_t max.\n  size_t NumArcs(int64_t s) const final {\n    return ValidStateId(s) ? impl_->NumArcs(s)\n                           : std::numeric_limits<size_t>::max();\n  }\n\n  // Signals failure by returning size_t max.\n  size_t NumInputEpsilons(int64_t s) const final {\n    return ValidStateId(s) ? impl_->NumInputEpsilons(s)\n                           : std::numeric_limits<size_t>::max();\n  }\n\n  // Signals failure by returning size_t max.\n  size_t NumOutputEpsilons(int64_t s) const final {\n    return ValidStateId(s) ? impl_->NumOutputEpsilons(s)\n                           : std::numeric_limits<size_t>::max();\n  }\n\n  // Warning: calling this method casts the FST to a mutable FST.\n  int64_t NumStates() const final {\n    return static_cast<MutableFst<Arc> *>(impl_.get())->NumStates();\n  }\n\n  uint64_t Properties(uint64_t mask, bool test) const final {\n    return impl_->Properties(mask, test);\n  }\n\n  // Warning: calling this method casts the FST to a mutable FST.\n  bool ReserveArcs(int64_t s, size_t n) final {\n    if (!ValidStateId(s)) return false;\n    static_cast<MutableFst<Arc> *>(impl_.get())->ReserveArcs(s, n);\n    return true;\n  }\n\n  // Warning: calling this method casts the FST to a mutable FST.\n  void ReserveStates(int64_t s) final {\n    static_cast<MutableFst<Arc> *>(impl_.get())->ReserveStates(s);\n  }\n\n  const SymbolTable *OutputSymbols() const final {\n    return impl_->OutputSymbols();\n  }\n\n  // Warning: calling this method casts the FST to a mutable FST.\n  void SetInputSymbols(SymbolTable *isyms) final {\n    static_cast<MutableFst<Arc> *>(impl_.get())->SetInputSymbols(isyms);\n  }\n\n  // Warning: calling this method casts the FST to a mutable FST.\n  bool SetFinal(int64_t s, const WeightClass &weight) final {\n    if (!ValidStateId(s)) return false;\n    static_cast<MutableFst<Arc> *>(impl_.get())\n        ->SetFinal(s, *weight.GetWeight<typename Arc::Weight>());\n    return true;\n  }\n\n  // Warning: calling this method casts the FST to a mutable FST.\n  void SetOutputSymbols(SymbolTable *osyms) final {\n    static_cast<MutableFst<Arc> *>(impl_.get())->SetOutputSymbols(osyms);\n  }\n\n  // Warning: calling this method casts the FST to a mutable FST.\n  void SetProperties(uint64_t props, uint64_t mask) final {\n    static_cast<MutableFst<Arc> *>(impl_.get())->SetProperties(props, mask);\n  }\n\n  // Warning: calling this method casts the FST to a mutable FST.\n  bool SetStart(int64_t s) final {\n    if (!ValidStateId(s)) return false;\n    static_cast<MutableFst<Arc> *>(impl_.get())->SetStart(s);\n    return true;\n  }\n\n  int64_t Start() const final { return impl_->Start(); }\n\n  bool ValidStateId(int64_t s) const final {\n    // This cowardly refuses to count states if the FST is not yet expanded.\n    if (!Properties(kExpanded, true)) {\n      FSTERROR() << \"Cannot get number of states for unexpanded FST\";\n      return false;\n    }\n    // If the FST is already expanded, CountStates calls NumStates.\n    if (s < 0 || s >= CountStates(*impl_)) {\n      FSTERROR() << \"State ID \" << s << \" not valid\";\n      return false;\n    }\n    return true;\n  }\n\n  const string &WeightType() const final { return Arc::Weight::Type(); }\n\n  bool Write(const string &fname) const final { return impl_->Write(fname); }\n\n  bool Write(std::ostream &ostr, const string &fname) const final {\n    const FstWriteOptions opts(fname);\n    return impl_->Write(ostr, opts);\n  }\n\n  ~FstClassImpl() override {}\n\n  Fst<Arc> *GetImpl() const { return impl_.get(); }\n\n private:\n  std::unique_ptr<Fst<Arc>> impl_;\n};\n\n// BASE CLASS DEFINITIONS\n\nclass MutableFstClass;\n\nclass FstClass : public FstClassBase {\n public:\n  FstClass() : impl_(nullptr) {}\n\n  template <class Arc>\n  explicit FstClass(const Fst<Arc> &fst) : impl_(new FstClassImpl<Arc>(fst)) {}\n\n  FstClass(const FstClass &other)\n      : impl_(other.impl_ == nullptr ? nullptr : other.impl_->Copy()) {}\n\n  FstClass &operator=(const FstClass &other) {\n    impl_.reset(other.impl_ == nullptr ? nullptr : other.impl_->Copy());\n    return *this;\n  }\n\n  WeightClass Final(int64_t s) const final { return impl_->Final(s); }\n\n  const string &ArcType() const final { return impl_->ArcType(); }\n\n  const string &FstType() const final { return impl_->FstType(); }\n\n  const SymbolTable *InputSymbols() const final {\n    return impl_->InputSymbols();\n  }\n\n  size_t NumArcs(int64_t s) const final { return impl_->NumArcs(s); }\n\n  size_t NumInputEpsilons(int64_t s) const final {\n    return impl_->NumInputEpsilons(s);\n  }\n\n  size_t NumOutputEpsilons(int64_t s) const final {\n    return impl_->NumOutputEpsilons(s);\n  }\n\n  const SymbolTable *OutputSymbols() const final {\n    return impl_->OutputSymbols();\n  }\n\n  uint64_t Properties(uint64_t mask, bool test) const final {\n    // Special handling for FSTs with a null impl.\n    if (!impl_) return kError & mask;\n    return impl_->Properties(mask, test);\n  }\n\n  static FstClass *Read(const string &fname);\n\n  static FstClass *Read(std::istream &istrm, const string &source);\n\n  int64_t Start() const final { return impl_->Start(); }\n\n  bool ValidStateId(int64_t s) const final { return impl_->ValidStateId(s); }\n\n  const string &WeightType() const final { return impl_->WeightType(); }\n\n  // Helper that logs an ERROR if the weight type of an FST and a WeightClass\n  // don't match.\n\n  bool WeightTypesMatch(const WeightClass &weight, const string &op_name) const;\n\n  bool Write(const string &fname) const final { return impl_->Write(fname); }\n\n  bool Write(std::ostream &ostr, const string &fname) const final {\n    return impl_->Write(ostr, fname);\n  }\n\n  ~FstClass() override {}\n\n  // These methods are required by IO registration.\n\n  template <class Arc>\n  static FstClassImplBase *Convert(const FstClass &other) {\n    FSTERROR() << \"Doesn't make sense to convert any class to type FstClass\";\n    return nullptr;\n  }\n\n  template <class Arc>\n  static FstClassImplBase *Create() {\n    FSTERROR() << \"Doesn't make sense to create an FstClass with a \"\n               << \"particular arc type\";\n    return nullptr;\n  }\n\n  template <class Arc>\n  const Fst<Arc> *GetFst() const {\n    if (Arc::Type() != ArcType()) {\n      return nullptr;\n    } else {\n      FstClassImpl<Arc> *typed_impl =\n          static_cast<FstClassImpl<Arc> *>(impl_.get());\n      return typed_impl->GetImpl();\n    }\n  }\n\n  template <class Arc>\n  static FstClass *Read(std::istream &stream, const FstReadOptions &opts) {\n    if (!opts.header) {\n      LOG(ERROR) << \"FstClass::Read: Options header not specified\";\n      return nullptr;\n    }\n    const FstHeader &hdr = *opts.header;\n    if (hdr.Properties() & kMutable) {\n      return ReadTypedFst<MutableFstClass, MutableFst<Arc>>(stream, opts);\n    } else {\n      return ReadTypedFst<FstClass, Fst<Arc>>(stream, opts);\n    }\n  }\n\n protected:\n  explicit FstClass(FstClassImplBase *impl) : impl_(impl) {}\n\n  const FstClassImplBase *GetImpl() const { return impl_.get(); }\n\n  FstClassImplBase *GetImpl() { return impl_.get(); }\n\n  // Generic template method for reading an arc-templated FST of type\n  // UnderlyingT, and returning it wrapped as FstClassT, with appropriat\n  // error checking. Called from arc-templated Read() static methods.\n  template <class FstClassT, class UnderlyingT>\n  static FstClassT *ReadTypedFst(std::istream &stream,\n                                 const FstReadOptions &opts) {\n    std::unique_ptr<UnderlyingT> u(UnderlyingT::Read(stream, opts));\n    return u ? new FstClassT(*u) : nullptr;\n  }\n\n private:\n  std::unique_ptr<FstClassImplBase> impl_;\n};\n\n// Specific types of FstClass with special properties\n\nclass MutableFstClass : public FstClass {\n public:\n  bool AddArc(int64_t s, const ArcClass &ac) {\n    if (!WeightTypesMatch(ac.weight, \"AddArc\")) return false;\n    return GetImpl()->AddArc(s, ac);\n  }\n\n  int64_t AddState() { return GetImpl()->AddState(); }\n\n  bool DeleteArcs(int64_t s, size_t n) { return GetImpl()->DeleteArcs(s, n); }\n\n  bool DeleteArcs(int64_t s) { return GetImpl()->DeleteArcs(s); }\n\n  bool DeleteStates(const std::vector<int64_t> &dstates) {\n    return GetImpl()->DeleteStates(dstates);\n  }\n\n  void DeleteStates() { GetImpl()->DeleteStates(); }\n\n  SymbolTable *MutableInputSymbols() {\n    return GetImpl()->MutableInputSymbols();\n  }\n\n  SymbolTable *MutableOutputSymbols() {\n    return GetImpl()->MutableOutputSymbols();\n  }\n\n  int64_t NumStates() const { return GetImpl()->NumStates(); }\n\n  bool ReserveArcs(int64_t s, size_t n) { return GetImpl()->ReserveArcs(s, n); }\n\n  void ReserveStates(int64_t s) { GetImpl()->ReserveStates(s); }\n\n  static MutableFstClass *Read(const string &fname, bool convert = false);\n\n  void SetInputSymbols(SymbolTable *isyms) {\n    GetImpl()->SetInputSymbols(isyms);\n  }\n\n  bool SetFinal(int64_t s, const WeightClass &weight) {\n    if (!WeightTypesMatch(weight, \"SetFinal\")) return false;\n    return GetImpl()->SetFinal(s, weight);\n  }\n\n  void SetOutputSymbols(SymbolTable *osyms) {\n    GetImpl()->SetOutputSymbols(osyms);\n  }\n\n  void SetProperties(uint64_t props, uint64_t mask) {\n    GetImpl()->SetProperties(props, mask);\n  }\n\n  bool SetStart(int64_t s) { return GetImpl()->SetStart(s); }\n\n  template <class Arc>\n  explicit MutableFstClass(const MutableFst<Arc> &fst) : FstClass(fst) {}\n\n  // These methods are required by IO registration.\n\n  template <class Arc>\n  static FstClassImplBase *Convert(const FstClass &other) {\n    FSTERROR() << \"Doesn't make sense to convert any class to type \"\n               << \"MutableFstClass\";\n    return nullptr;\n  }\n\n  template <class Arc>\n  static FstClassImplBase *Create() {\n    FSTERROR() << \"Doesn't make sense to create a MutableFstClass with a \"\n               << \"particular arc type\";\n    return nullptr;\n  }\n\n  template <class Arc>\n  MutableFst<Arc> *GetMutableFst() {\n    Fst<Arc> *fst = const_cast<Fst<Arc> *>(this->GetFst<Arc>());\n    MutableFst<Arc> *mfst = static_cast<MutableFst<Arc> *>(fst);\n    return mfst;\n  }\n\n  template <class Arc>\n  static MutableFstClass *Read(std::istream &stream,\n                               const FstReadOptions &opts) {\n    std::unique_ptr<MutableFst<Arc>> mfst(MutableFst<Arc>::Read(stream, opts));\n    return mfst ? new MutableFstClass(*mfst) : nullptr;\n  }\n\n protected:\n  explicit MutableFstClass(FstClassImplBase *impl) : FstClass(impl) {}\n};\n\nclass VectorFstClass : public MutableFstClass {\n public:\n  explicit VectorFstClass(FstClassImplBase *impl) : MutableFstClass(impl) {}\n\n  explicit VectorFstClass(const FstClass &other);\n\n  explicit VectorFstClass(const string &arc_type);\n\n  static VectorFstClass *Read(const string &fname);\n\n  template <class Arc>\n  static VectorFstClass *Read(std::istream &stream,\n                              const FstReadOptions &opts) {\n    std::unique_ptr<VectorFst<Arc>> mfst(VectorFst<Arc>::Read(stream, opts));\n    return mfst ? new VectorFstClass(*mfst) : nullptr;\n  }\n\n  template <class Arc>\n  explicit VectorFstClass(const VectorFst<Arc> &fst) : MutableFstClass(fst) {}\n\n  template <class Arc>\n  static FstClassImplBase *Convert(const FstClass &other) {\n    return new FstClassImpl<Arc>(new VectorFst<Arc>(*other.GetFst<Arc>()),\n                                 true);\n  }\n\n  template <class Arc>\n  static FstClassImplBase *Create() {\n    return new FstClassImpl<Arc>(new VectorFst<Arc>(), true);\n  }\n};\n\n}  // namespace script\n}  // namespace fst\n\n#endif  // FST_SCRIPT_FST_CLASS_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/script/fstscript-decl.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Forward declarations for the FST and FST script classes.\n\n#ifndef FST_SCRIPT_FSTSCRIPT_DECL_H_\n#define FST_SCRIPT_FSTSCRIPT_DECL_H_\n\n#include <fst/fst-decl.h>\n\nnamespace fst {\nnamespace script {\n\nclass ArcClass;\n\nclass ArcIteratorClass;\nclass MutableArcIteratorClass;\n\nclass EncodeMapperClass;\n\nclass FstClass;\nclass MutableFstClass;\nclass VectorFstClass;\n\nclass StateIteratorClass;\n\nclass WeightClass;\n\n}  // namespace script\n}  // namespace fst;\n\n#endif  // FST_SCRIPT_FSTSCRIPT_DECL_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/script/fstscript.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// The FST script interface permits users to interact with FSTs without knowing\n// their arc type. It does this by mapping compile-time polymorphism (in the\n// form of a arc-templated FST types) onto a shared virtual interface. It also\n// supports arc extension via a DSO interface. Due to the overhead of virtual\n// dispatch and registered function lookups, the script API is somewhat slower\n// then library API provided by types like StdVectorFst, but has the advantage\n// that it is designed not to crash (and to provide useful debugging\n// information) upon common user errors like passing invalid indices or\n// attempting comparison of incompatible FSTs. It is used both by the FST\n// binaries and the Python extension.\n//\n// This header includes all of the FST script functionality.\n\n#ifndef FST_SCRIPT_FSTSCRIPT_H_\n#define FST_SCRIPT_FSTSCRIPT_H_\n\n// Major classes\n#include <fst/script/arciterator-class.h>\n#include <fst/script/encodemapper-class.h>\n#include <fst/script/fst-class.h>\n#include <fst/script/stateiterator-class.h>\n#include <fst/script/text-io.h>\n#include <fst/script/weight-class.h>\n\n// Flag-to-enum parsers.\n#include <fst/script/getters.h>\n// Templates like Operation<> and Apply<>.\n#include <fst/script/script-impl.h>\n\n// Operations.\n#include <fst/script/arcsort.h>\n#include <fst/script/closure.h>\n#include <fst/script/compile.h>\n#include <fst/script/compose.h>\n#include <fst/script/concat.h>\n#include <fst/script/connect.h>\n#include <fst/script/convert.h>\n#include <fst/script/decode.h>\n#include <fst/script/determinize.h>\n#include <fst/script/difference.h>\n#include <fst/script/disambiguate.h>\n#include <fst/script/draw.h>\n#include <fst/script/encode.h>\n#include <fst/script/epsnormalize.h>\n#include <fst/script/equal.h>\n#include <fst/script/equivalent.h>\n#include <fst/script/info.h>\n#include <fst/script/intersect.h>\n#include <fst/script/invert.h>\n#include <fst/script/isomorphic.h>\n#include <fst/script/map.h>\n#include <fst/script/minimize.h>\n#include <fst/script/print.h>\n#include <fst/script/project.h>\n#include <fst/script/prune.h>\n#include <fst/script/push.h>\n#include <fst/script/randequivalent.h>\n#include <fst/script/randgen.h>\n#include <fst/script/relabel.h>\n#include <fst/script/replace.h>\n#include <fst/script/reverse.h>\n#include <fst/script/reweight.h>\n#include <fst/script/rmepsilon.h>\n#include <fst/script/shortest-distance.h>\n#include <fst/script/shortest-path.h>\n#include <fst/script/synchronize.h>\n#include <fst/script/topsort.h>\n#include <fst/script/union.h>\n#include <fst/script/verify.h>\n\n// This class is necessary because registering each of the operations\n// separately overfills the stack, as there's so many of them.\nnamespace fst {\nnamespace script {\n\ntemplate <class Arc>\nclass AllFstOperationsRegisterer {\n public:\n  AllFstOperationsRegisterer() {\n    RegisterBatch1();\n    RegisterBatch2();\n  }\n\n private:\n  void RegisterBatch1() {\n    REGISTER_FST_OPERATION(ArcSort, Arc, ArcSortArgs);\n    REGISTER_FST_OPERATION(Closure, Arc, ClosureArgs);\n    REGISTER_FST_OPERATION(CompileFstInternal, Arc, CompileFstArgs);\n    REGISTER_FST_OPERATION(Compose, Arc, ComposeArgs);\n    REGISTER_FST_OPERATION(Concat, Arc, ConcatArgs1);\n    REGISTER_FST_OPERATION(Concat, Arc, ConcatArgs2);\n    REGISTER_FST_OPERATION(Connect, Arc, MutableFstClass);\n    REGISTER_FST_OPERATION(Convert, Arc, ConvertArgs);\n    REGISTER_FST_OPERATION(Decode, Arc, DecodeArgs1);\n    REGISTER_FST_OPERATION(Decode, Arc, DecodeArgs2);\n    REGISTER_FST_OPERATION(Determinize, Arc, DeterminizeArgs);\n    REGISTER_FST_OPERATION(Difference, Arc, DifferenceArgs);\n    REGISTER_FST_OPERATION(Disambiguate, Arc, DisambiguateArgs);\n    REGISTER_FST_OPERATION(DrawFst, Arc, FstDrawerArgs);\n    REGISTER_FST_OPERATION(Encode, Arc, EncodeArgs1);\n    REGISTER_FST_OPERATION(Encode, Arc, EncodeArgs2);\n    REGISTER_FST_OPERATION(EpsNormalize, Arc, EpsNormalizeArgs);\n    REGISTER_FST_OPERATION(Equal, Arc, EqualArgs);\n    REGISTER_FST_OPERATION(Equivalent, Arc, EquivalentArgs);\n    REGISTER_FST_OPERATION(PrintFstInfo, Arc, InfoArgs);\n    REGISTER_FST_OPERATION(GetFstInfo, Arc, GetInfoArgs);\n    REGISTER_FST_OPERATION(InitArcIteratorClass, Arc,\n                           InitArcIteratorClassArgs);\n    REGISTER_FST_OPERATION(InitEncodeMapperClass, Arc,\n                           InitEncodeMapperClassArgs);\n    REGISTER_FST_OPERATION(InitMutableArcIteratorClass, Arc,\n                           InitMutableArcIteratorClassArgs);\n    REGISTER_FST_OPERATION(InitStateIteratorClass, Arc,\n                           InitStateIteratorClassArgs);\n  }\n\n  void RegisterBatch2() {\n    REGISTER_FST_OPERATION(Intersect, Arc, IntersectArgs);\n    REGISTER_FST_OPERATION(Invert, Arc, MutableFstClass);\n    REGISTER_FST_OPERATION(Map, Arc, MapArgs);\n    REGISTER_FST_OPERATION(Minimize, Arc, MinimizeArgs);\n    REGISTER_FST_OPERATION(PrintFst, Arc, FstPrinterArgs);\n    REGISTER_FST_OPERATION(Project, Arc, ProjectArgs);\n    REGISTER_FST_OPERATION(Prune, Arc, PruneArgs1);\n    REGISTER_FST_OPERATION(Prune, Arc, PruneArgs2);\n    REGISTER_FST_OPERATION(Push, Arc, PushArgs1);\n    REGISTER_FST_OPERATION(Push, Arc, PushArgs2);\n    REGISTER_FST_OPERATION(RandEquivalent, Arc, RandEquivalentArgs);\n    REGISTER_FST_OPERATION(RandGen, Arc, RandGenArgs);\n    REGISTER_FST_OPERATION(Relabel, Arc, RelabelArgs1);\n    REGISTER_FST_OPERATION(Relabel, Arc, RelabelArgs2);\n    REGISTER_FST_OPERATION(Replace, Arc, ReplaceArgs);\n    REGISTER_FST_OPERATION(Reverse, Arc, ReverseArgs);\n    REGISTER_FST_OPERATION(Reweight, Arc, ReweightArgs);\n    REGISTER_FST_OPERATION(RmEpsilon, Arc, RmEpsilonArgs);\n    REGISTER_FST_OPERATION(ShortestDistance, Arc, ShortestDistanceArgs1);\n    REGISTER_FST_OPERATION(ShortestDistance, Arc, ShortestDistanceArgs2);\n    REGISTER_FST_OPERATION(ShortestPath, Arc, ShortestPathArgs);\n    REGISTER_FST_OPERATION(Synchronize, Arc, SynchronizeArgs);\n    REGISTER_FST_OPERATION(TopSort, Arc, TopSortArgs);\n    REGISTER_FST_OPERATION(Union, Arc, UnionArgs);\n    REGISTER_FST_OPERATION(Verify, Arc, VerifyArgs);\n  }\n};\n\n}  // namespace script\n}  // namespace fst\n\n#define REGISTER_FST_OPERATIONS(Arc) \\\n  AllFstOperationsRegisterer<Arc> register_all_fst_operations##Arc;\n\n#endif  // FST_SCRIPT_FSTSCRIPT_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/script/info-impl.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Class to compute various information about FSTs, a helper class for\n// fstinfo.cc.\n\n#ifndef FST_SCRIPT_INFO_IMPL_H_\n#define FST_SCRIPT_INFO_IMPL_H_\n\n#include <map>\n#include <string>\n#include <vector>\n\n#include <fst/connect.h>\n#include <fst/dfs-visit.h>\n#include <fst/fst.h>\n#include <fst/lookahead-matcher.h>\n#include <fst/matcher.h>\n#include <fst/queue.h>\n#include <fst/test-properties.h>\n#include <fst/verify.h>\n#include <fst/visit.h>\n\nnamespace fst {\n\n// Compute various information about FSTs, helper class for fstinfo.cc.\n// WARNING: Stand-alone use of this class is not recommended, most code\n// should call directly the relevant library functions: Fst<Arc>::NumStates,\n// Fst<Arc>::NumArcs, TestProperties, etc.\nclass FstInfo {\n public:\n  FstInfo() {}\n\n  // When info_type is \"short\" (or \"auto\" and not an ExpandedFst) then only\n  // minimal info is computed and can be requested.\n  template <typename Arc>\n  FstInfo(const Fst<Arc> &fst, bool test_properties,\n          const string &arc_filter_type = \"any\",\n          const string &info_type = \"auto\", bool verify = true)\n      : fst_type_(fst.Type()),\n        input_symbols_(fst.InputSymbols() ? fst.InputSymbols()->Name()\n                                          : \"none\"),\n        output_symbols_(fst.OutputSymbols() ? fst.OutputSymbols()->Name()\n                                            : \"none\"),\n        nstates_(0),\n        narcs_(0),\n        start_(kNoStateId),\n        nfinal_(0),\n        nepsilons_(0),\n        niepsilons_(0),\n        noepsilons_(0),\n        ilabel_mult_(0.0),\n        olabel_mult_(0.0),\n        naccess_(0),\n        ncoaccess_(0),\n        nconnect_(0),\n        ncc_(0),\n        nscc_(0),\n        input_match_type_(MATCH_NONE),\n        output_match_type_(MATCH_NONE),\n        input_lookahead_(false),\n        output_lookahead_(false),\n        properties_(0),\n        arc_filter_type_(arc_filter_type),\n        long_info_(true),\n        arc_type_(Arc::Type()) {\n    using Label = typename Arc::Label;\n    using StateId = typename Arc::StateId;\n    using Weight = typename Arc::Weight;\n    if (info_type == \"long\") {\n      long_info_ = true;\n    } else if (info_type == \"short\") {\n      long_info_ = false;\n    } else if (info_type == \"auto\") {\n      long_info_ = fst.Properties(kExpanded, false);\n    } else {\n      FSTERROR() << \"Bad info type: \" << info_type;\n      return;\n    }\n    if (!long_info_) return;\n    // If the FST is not sane, we return.\n    if (verify && !Verify(fst)) {\n      FSTERROR() << \"FstInfo: Verify: FST not well-formed\";\n      return;\n    }\n    start_ = fst.Start();\n    properties_ = fst.Properties(kFstProperties, test_properties);\n    for (StateIterator<Fst<Arc>> siter(fst); !siter.Done(); siter.Next()) {\n      ++nstates_;\n      const auto s = siter.Value();\n      if (fst.Final(s) != Weight::Zero()) ++nfinal_;\n      std::map<Label, size_t> ilabel_count;\n      std::map<Label, size_t> olabel_count;\n      for (ArcIterator<Fst<Arc>> aiter(fst, s); !aiter.Done(); aiter.Next()) {\n        const auto &arc = aiter.Value();\n        ++narcs_;\n        if (arc.ilabel == 0 && arc.olabel == 0) ++nepsilons_;\n        if (arc.ilabel == 0) ++niepsilons_;\n        if (arc.olabel == 0) ++noepsilons_;\n        ++ilabel_count[arc.ilabel];\n        ++olabel_count[arc.olabel];\n      }\n      for (auto it = ilabel_count.begin(); it != ilabel_count.end(); ++it) {\n        ilabel_mult_ += it->second * it->second;\n      }\n      for (auto it = olabel_count.begin(); it != olabel_count.end(); ++it) {\n        olabel_mult_ += it->second * it->second;\n      }\n    }\n    if (narcs_ > 0) {\n      ilabel_mult_ /= narcs_;\n      olabel_mult_ /= narcs_;\n    }\n    {\n      std::vector<StateId> cc;\n      CcVisitor<Arc> cc_visitor(&cc);\n      FifoQueue<StateId> fifo_queue;\n      if (arc_filter_type == \"any\") {\n        Visit(fst, &cc_visitor, &fifo_queue);\n      } else if (arc_filter_type == \"epsilon\") {\n        Visit(fst, &cc_visitor, &fifo_queue, EpsilonArcFilter<Arc>());\n      } else if (arc_filter_type == \"iepsilon\") {\n        Visit(fst, &cc_visitor, &fifo_queue, InputEpsilonArcFilter<Arc>());\n      } else if (arc_filter_type == \"oepsilon\") {\n        Visit(fst, &cc_visitor, &fifo_queue, OutputEpsilonArcFilter<Arc>());\n      } else {\n        FSTERROR() << \"Bad arc filter type: \" << arc_filter_type;\n        return;\n      }\n      for (StateId s = 0; s < cc.size(); ++s) {\n        if (cc[s] >= ncc_) ncc_ = cc[s] + 1;\n      }\n    }\n    {\n      std::vector<StateId> scc;\n      std::vector<bool> access, coaccess;\n      uint64_t props = 0;\n      SccVisitor<Arc> scc_visitor(&scc, &access, &coaccess, &props);\n      if (arc_filter_type == \"any\") {\n        DfsVisit(fst, &scc_visitor);\n      } else if (arc_filter_type == \"epsilon\") {\n        DfsVisit(fst, &scc_visitor, EpsilonArcFilter<Arc>());\n      } else if (arc_filter_type == \"iepsilon\") {\n        DfsVisit(fst, &scc_visitor, InputEpsilonArcFilter<Arc>());\n      } else if (arc_filter_type == \"oepsilon\") {\n        DfsVisit(fst, &scc_visitor, OutputEpsilonArcFilter<Arc>());\n      } else {\n        FSTERROR() << \"Bad arc filter type: \" << arc_filter_type;\n        return;\n      }\n      for (StateId s = 0; s < scc.size(); ++s) {\n        if (access[s]) ++naccess_;\n        if (coaccess[s]) ++ncoaccess_;\n        if (access[s] && coaccess[s]) ++nconnect_;\n        if (scc[s] >= nscc_) nscc_ = scc[s] + 1;\n      }\n    }\n    LookAheadMatcher<Fst<Arc>> imatcher(fst, MATCH_INPUT);\n    input_match_type_ = imatcher.Type(test_properties);\n    input_lookahead_ = imatcher.Flags() & kInputLookAheadMatcher;\n    LookAheadMatcher<Fst<Arc>> omatcher(fst, MATCH_OUTPUT);\n    output_match_type_ = omatcher.Type(test_properties);\n    output_lookahead_ = omatcher.Flags() & kOutputLookAheadMatcher;\n  }\n\n  // Short info.\n\n  const string &FstType() const { return fst_type_; }\n\n  const string &ArcType() const { return arc_type_; }\n\n  const string &InputSymbols() const { return input_symbols_; }\n\n  const string &OutputSymbols() const { return output_symbols_; }\n\n  bool LongInfo() const { return long_info_; }\n\n  const string &ArcFilterType() const { return arc_filter_type_; }\n\n  // Long info.\n\n  MatchType InputMatchType() const {\n    CheckLong();\n    return input_match_type_;\n  }\n\n  MatchType OutputMatchType() const {\n    CheckLong();\n    return output_match_type_;\n  }\n\n  bool InputLookAhead() const {\n    CheckLong();\n    return input_lookahead_;\n  }\n\n  bool OutputLookAhead() const {\n    CheckLong();\n    return output_lookahead_;\n  }\n\n  int64_t NumStates() const {\n    CheckLong();\n    return nstates_;\n  }\n\n  size_t NumArcs() const {\n    CheckLong();\n    return narcs_;\n  }\n\n  int64_t Start() const {\n    CheckLong();\n    return start_;\n  }\n\n  size_t NumFinal() const {\n    CheckLong();\n    return nfinal_;\n  }\n\n  size_t NumEpsilons() const {\n    CheckLong();\n    return nepsilons_;\n  }\n\n  size_t NumInputEpsilons() const {\n    CheckLong();\n    return niepsilons_;\n  }\n\n  size_t NumOutputEpsilons() const {\n    CheckLong();\n    return noepsilons_;\n  }\n\n  double InputLabelMultiplicity() const {\n    CheckLong();\n    return ilabel_mult_;\n  }\n\n  double OutputLabelMultiplicity() const {\n    CheckLong();\n    return olabel_mult_;\n  }\n\n  size_t NumAccessible() const {\n    CheckLong();\n    return naccess_;\n  }\n\n  size_t NumCoAccessible() const {\n    CheckLong();\n    return ncoaccess_;\n  }\n\n  size_t NumConnected() const {\n    CheckLong();\n    return nconnect_;\n  }\n\n  size_t NumCc() const {\n    CheckLong();\n    return ncc_;\n  }\n\n  size_t NumScc() const {\n    CheckLong();\n    return nscc_;\n  }\n\n  uint64_t Properties() const {\n    CheckLong();\n    return properties_;\n  }\n\n private:\n  void CheckLong() const {\n    if (!long_info_)\n      FSTERROR() << \"FstInfo: Method only available with long info signature\";\n  }\n\n  string fst_type_;\n  string input_symbols_;\n  string output_symbols_;\n  int64_t nstates_;\n  size_t narcs_;\n  int64_t start_;\n  size_t nfinal_;\n  size_t nepsilons_;\n  size_t niepsilons_;\n  size_t noepsilons_;\n  double ilabel_mult_;\n  double olabel_mult_;\n  size_t naccess_;\n  size_t ncoaccess_;\n  size_t nconnect_;\n  size_t ncc_;\n  size_t nscc_;\n  MatchType input_match_type_;\n  MatchType output_match_type_;\n  bool input_lookahead_;\n  bool output_lookahead_;\n  uint64_t properties_;\n  string arc_filter_type_;\n  bool long_info_;\n  string arc_type_;\n};\n\nvoid PrintFstInfoImpl(const FstInfo &fstinfo, bool pipe = false);\n\n}  // namespace fst\n\n#endif  // FST_SCRIPT_INFO_IMPL_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/script/info.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#ifndef FST_SCRIPT_INFO_H_\n#define FST_SCRIPT_INFO_H_\n\n#include <string>\n#include <tuple>\n\n#include <fst/script/arg-packs.h>\n#include <fst/script/fst-class.h>\n#include <fst/script/info-impl.h>\n\nnamespace fst {\nnamespace script {\n\nusing InfoArgs = std::tuple<const FstClass &, bool, const string &,\n                            const string &, bool, bool>;\n\ntemplate <class Arc>\nvoid PrintFstInfo(InfoArgs *args) {\n  const Fst<Arc> &fst = *(std::get<0>(*args).GetFst<Arc>());\n  const FstInfo fstinfo(fst, std::get<1>(*args), std::get<2>(*args),\n                        std::get<3>(*args), std::get<4>(*args));\n  PrintFstInfoImpl(fstinfo, std::get<5>(*args));\n  if (std::get<5>(*args)) fst.Write(\"\");\n}\n\nvoid PrintFstInfo(const FstClass &f, bool test_properties,\n                  const string &arc_filter, const string &info_type, bool pipe,\n                  bool verify);\n\nusing GetInfoArgs = std::tuple<const FstClass &, bool, const string &,\n                               const string &, bool, FstInfo *>;\n\ntemplate <class Arc>\nvoid GetFstInfo(GetInfoArgs *args) {\n  const Fst<Arc> &fst = *(std::get<0>(*args).GetFst<Arc>());\n  *(std::get<5>(*args)) = FstInfo(fst, std::get<1>(*args), std::get<2>(*args),\n                                  std::get<3>(*args), std::get<4>(*args));\n}\n\nvoid GetFstInfo(const FstClass &fst, bool test_properties,\n                const string &arc_filter, const string &info_type, bool verify,\n                FstInfo *info);\n\n}  // namespace script\n}  // namespace fst\n\n#endif  // FST_SCRIPT_INFO_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/script/invert.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#ifndef FST_SCRIPT_INVERT_H_\n#define FST_SCRIPT_INVERT_H_\n\n#include <fst/invert.h>\n#include <fst/script/fst-class.h>\n\nnamespace fst {\nnamespace script {\n\ntemplate <class Arc>\nvoid Invert(MutableFstClass *fst) {\n  Invert(fst->GetMutableFst<Arc>());\n}\n\nvoid Invert(MutableFstClass *fst);\n\n}  // namespace script\n}  // namespace fst\n\n#endif  // FST_SCRIPT_INVERT_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/script/isomorphic.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#ifndef FST_SCRIPT_ISOMORPHIC_H_\n#define FST_SCRIPT_ISOMORPHIC_H_\n\n#include <tuple>\n\n#include <fst/isomorphic.h>\n#include <fst/script/arg-packs.h>\n#include <fst/script/fst-class.h>\n\nnamespace fst {\nnamespace script {\n\nusing IsomorphicInnerArgs = std::tuple<const FstClass &, const FstClass &,\n                                       float>;\n\nusing IsomorphicArgs = WithReturnValue<bool, IsomorphicInnerArgs>;\n\ntemplate <class Arc>\nvoid Isomorphic(IsomorphicArgs *args) {\n  const Fst<Arc> &fst1 = *(std::get<0>(args->args).GetFst<Arc>());\n  const Fst<Arc> &fst2 = *(std::get<1>(args->args).GetFst<Arc>());\n  args->retval = Isomorphic(fst1, fst2, std::get<2>(args->args));\n}\n\nbool Isomorphic(const FstClass &fst1, const FstClass &fst2,\n                float delta = kDelta);\n\n}  // namespace script\n}  // namespace fst\n\n#endif  // FST_SCRIPT_ISOMORPHIC_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/script/map.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#ifndef FST_SCRIPT_MAP_H_\n#define FST_SCRIPT_MAP_H_\n\n#include <memory>\n#include <tuple>\n\n#include <fst/arc-map.h>\n#include <fst/state-map.h>\n#include <fst/script/arg-packs.h>\n#include <fst/script/fst-class.h>\n#include <fst/script/weight-class.h>\n\nnamespace fst {\nnamespace script {\n\ntemplate <class M>\nFst<typename M::ToArc> *ArcMap(const Fst<typename M::FromArc> &fst,\n                               const M &mapper) {\n  using ToArc = typename M::ToArc;\n  auto *ofst = new VectorFst<ToArc>;\n  ArcMap(fst, ofst, mapper);\n  return ofst;\n}\n\ntemplate <class M>\nFst<typename M::ToArc> *StateMap(const Fst<typename M::FromArc> &fst,\n                                 const M &mapper) {\n  using ToArc = typename M::ToArc;\n  auto *ofst = new VectorFst<ToArc>;\n  StateMap(fst, ofst, mapper);\n  return ofst;\n}\n\nenum MapType {\n  ARC_SUM_MAPPER,\n  ARC_UNIQUE_MAPPER,\n  IDENTITY_MAPPER,\n  INPUT_EPSILON_MAPPER,\n  INVERT_MAPPER,\n  OUTPUT_EPSILON_MAPPER,\n  PLUS_MAPPER,\n  POWER_MAPPER,\n  QUANTIZE_MAPPER,\n  RMWEIGHT_MAPPER,\n  SUPERFINAL_MAPPER,\n  TIMES_MAPPER,\n  TO_LOG_MAPPER,\n  TO_LOG64_MAPPER,\n  TO_STD_MAPPER\n};\n\nusing MapInnerArgs =\n    std::tuple<const FstClass &, MapType, float, double, const WeightClass &>;\n\nusing MapArgs = WithReturnValue<FstClass *, MapInnerArgs>;\n\ntemplate <class Arc>\nvoid Map(MapArgs *args) {\n  using Weight = typename Arc::Weight;\n  const Fst<Arc> &ifst = *(std::get<0>(args->args).GetFst<Arc>());\n  const auto map_type = std::get<1>(args->args);\n  switch (map_type) {\n    case ARC_SUM_MAPPER: {\n      std::unique_ptr<Fst<Arc>> ofst(StateMap(ifst, ArcSumMapper<Arc>(ifst)));\n      args->retval = new FstClass(*ofst);\n      return;\n    }\n    case ARC_UNIQUE_MAPPER: {\n      std::unique_ptr<Fst<Arc>> ofst(\n          StateMap(ifst, ArcUniqueMapper<Arc>(ifst)));\n      args->retval = new FstClass(*ofst);\n      return;\n    }\n    case IDENTITY_MAPPER: {\n      std::unique_ptr<Fst<Arc>> ofst(ArcMap(ifst, IdentityArcMapper<Arc>()));\n      args->retval = new FstClass(*ofst);\n      return;\n    }\n    case INPUT_EPSILON_MAPPER: {\n      std::unique_ptr<Fst<Arc>> ofst(ArcMap(ifst, InputEpsilonMapper<Arc>()));\n      args->retval = new FstClass(*ofst);\n      return;\n    }\n    case INVERT_MAPPER: {\n      std::unique_ptr<Fst<Arc>> ofst(ArcMap(ifst, InvertWeightMapper<Arc>()));\n      args->retval = new FstClass(*ofst);\n      return;\n    }\n    case OUTPUT_EPSILON_MAPPER: {\n      std::unique_ptr<Fst<Arc>> ofst(ArcMap(ifst, OutputEpsilonMapper<Arc>()));\n      args->retval = new FstClass(*ofst);\n      return;\n    }\n    case PLUS_MAPPER: {\n      const auto weight = *(std::get<4>(args->args).GetWeight<Weight>());\n      std::unique_ptr<Fst<Arc>> ofst(ArcMap(ifst, PlusMapper<Arc>(weight)));\n      args->retval = new FstClass(*ofst);\n      return;\n    }\n    case POWER_MAPPER: {\n      const auto power = std::get<3>(args->args);\n      std::unique_ptr<Fst<Arc>> ofst(ArcMap(ifst, PowerMapper<Arc>(power)));\n      args->retval = new FstClass(*ofst);\n      return;\n    }\n    case QUANTIZE_MAPPER: {\n      const auto delta = std::get<2>(args->args);\n      std::unique_ptr<Fst<Arc>> ofst(ArcMap(ifst, QuantizeMapper<Arc>(delta)));\n      args->retval = new FstClass(*ofst);\n      return;\n    }\n    case RMWEIGHT_MAPPER: {\n      std::unique_ptr<Fst<Arc>> ofst(ArcMap(ifst, RmWeightMapper<Arc>()));\n      args->retval = new FstClass(*ofst);\n      return;\n    }\n    case SUPERFINAL_MAPPER: {\n      std::unique_ptr<Fst<Arc>> ofst(ArcMap(ifst, SuperFinalMapper<Arc>()));\n      args->retval = new FstClass(*ofst);\n      return;\n    }\n    case TIMES_MAPPER: {\n      const auto weight = *(std::get<4>(args->args).GetWeight<Weight>());\n      std::unique_ptr<Fst<Arc>> ofst(ArcMap(ifst, TimesMapper<Arc>(weight)));\n      args->retval = new FstClass(*ofst);\n      return;\n    }\n    case TO_LOG_MAPPER: {\n      std::unique_ptr<Fst<LogArc>> ofst(\n          ArcMap(ifst, WeightConvertMapper<Arc, LogArc>()));\n      args->retval = new FstClass(*ofst);\n      return;\n    }\n    case TO_LOG64_MAPPER: {\n      std::unique_ptr<Fst<Log64Arc>> ofst(\n          ArcMap(ifst, WeightConvertMapper<Arc, Log64Arc>()));\n      args->retval = new FstClass(*ofst);\n      return;\n    }\n    case TO_STD_MAPPER: {\n      std::unique_ptr<Fst<StdArc>> ofst(\n          ArcMap(ifst, WeightConvertMapper<Arc, StdArc>()));\n      args->retval = new FstClass(*ofst);\n      return;\n    }\n  }\n}\n\nFstClass *Map(const FstClass &ifst, MapType map_type, float delta, double power,\n              const WeightClass &weight);\n\n}  // namespace script\n}  // namespace fst\n\n#endif  // FST_SCRIPT_MAP_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/script/minimize.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#ifndef FST_SCRIPT_MINIMIZE_H_\n#define FST_SCRIPT_MINIMIZE_H_\n\n#include <tuple>\n\n#include <fst/minimize.h>\n#include <fst/script/fst-class.h>\n\nnamespace fst {\nnamespace script {\n\nusing MinimizeArgs = std::tuple<MutableFstClass *, MutableFstClass *, float,\n                                bool>;\n\ntemplate <class Arc>\nvoid Minimize(MinimizeArgs *args) {\n  MutableFst<Arc> *ofst1 = std::get<0>(*args)->GetMutableFst<Arc>();\n  MutableFst<Arc> *ofst2 = (std::get<1>(*args) ?\n                            std::get<1>(*args)->GetMutableFst<Arc>() :\n                            nullptr);\n  Minimize(ofst1, ofst2, std::get<2>(*args), std::get<3>(*args));\n}\n\nvoid Minimize(MutableFstClass *ofst1, MutableFstClass *ofst2 = nullptr,\n              float delta = kShortestDelta, bool allow_nondet = false);\n\n}  // namespace script\n}  // namespace fst\n\n#endif  // FST_SCRIPT_MINIMIZE_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/script/print.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#ifndef FST_SCRIPT_PRINT_H_\n#define FST_SCRIPT_PRINT_H_\n\n#include <ostream>\n\n#include <fst/flags.h>\n#include <fst/script/fst-class.h>\n#include <fst/script/print-impl.h>\n\nDECLARE_string(fst_field_separator);\n\nnamespace fst {\nnamespace script {\n\n// Note: it is safe to pass these strings as references because\n// this struct is only used to pass them deeper in the call graph.\n// Be sure you understand why this is so before using this struct\n// for anything else!\nstruct FstPrinterArgs {\n  const FstClass &fst;\n  const SymbolTable *isyms;\n  const SymbolTable *osyms;\n  const SymbolTable *ssyms;\n  const bool accept;\n  const bool show_weight_one;\n  std::ostream *ostrm;\n  const string &dest;\n  const string &sep;  // NOLINT\n  const string &missing_symbol;\n\n  FstPrinterArgs(const FstClass &fst, const SymbolTable *isyms,\n                 const SymbolTable *osyms, const SymbolTable *ssyms,\n                 bool accept, bool show_weight_one, std::ostream *ostrm,\n                 const string &dest, const string &sep,\n                 const string &missing_sym = \"\")\n      : fst(fst),\n        isyms(isyms),\n        osyms(osyms),\n        ssyms(ssyms),\n        accept(accept),\n        show_weight_one(show_weight_one),\n        ostrm(ostrm),\n        dest(dest),\n        sep(sep),\n        missing_symbol(missing_sym) {}\n};\n\ntemplate <class Arc>\nvoid PrintFst(FstPrinterArgs *args) {\n  const Fst<Arc> &fst = *(args->fst.GetFst<Arc>());\n  FstPrinter<Arc> fstprinter(fst, args->isyms, args->osyms, args->ssyms,\n                             args->accept, args->show_weight_one, args->sep,\n                             args->missing_symbol);\n  fstprinter.Print(args->ostrm, args->dest);\n}\n\nvoid PrintFst(const FstClass &fst, std::ostream &ostrm, const string &dest,\n              const SymbolTable *isyms, const SymbolTable *osyms,\n              const SymbolTable *ssyms, bool accept, bool show_weight_one,\n              const string &missing_sym = \"\");\n\n// The same, but with more sensible defaults.\ntemplate <class Arc>\nvoid PrintFst(const Fst<Arc> &fst, std::ostream &ostrm, const string &dest = \"\",\n              const SymbolTable *isyms = nullptr,\n              const SymbolTable *osyms = nullptr,\n              const SymbolTable *ssyms = nullptr) {\n  const string sep = FLAGS_fst_field_separator.substr(0, 1);\n  FstPrinter<Arc> fstprinter(fst, isyms, osyms, ssyms, true, true, sep);\n  fstprinter.Print(&ostrm, dest);\n}\n\n}  // namespace script\n}  // namespace fst\n\n#endif  // FST_SCRIPT_PRINT_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/script/randequivalent.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#ifndef FST_SCRIPT_RANDEQUIVALENT_H_\n#define FST_SCRIPT_RANDEQUIVALENT_H_\n\n#include <climits>\n#include <ctime>\n\n#include <tuple>\n\n#include <fst/randequivalent.h>\n#include <fst/script/arg-packs.h>\n#include <fst/script/fst-class.h>\n#include <fst/script/script-impl.h>\n\nnamespace fst {\nnamespace script {\n\nusing RandEquivalentInnerArgs = std::tuple<const FstClass &, const FstClass &,\n    int32_t, float, time_t, const RandGenOptions<RandArcSelection> &>;\n\nusing RandEquivalentArgs = WithReturnValue<bool, RandEquivalentInnerArgs>;\n\ntemplate <class Arc>\nvoid RandEquivalent(RandEquivalentArgs *args) {\n  const Fst<Arc> &fst1 = *(std::get<0>(args->args).GetFst<Arc>());\n  const Fst<Arc> &fst2 = *(std::get<1>(args->args).GetFst<Arc>());\n  const auto seed = std::get<4>(args->args);\n  const auto &opts = std::get<5>(args->args);\n  switch (opts.selector) {\n    case UNIFORM_ARC_SELECTOR: {\n      const UniformArcSelector<Arc> selector(seed);\n      const RandGenOptions<UniformArcSelector<Arc>> ropts(selector,\n                                                          opts.max_length);\n      args->retval = RandEquivalent(fst1, fst2, std::get<2>(args->args),\n                                    std::get<3>(args->args), ropts);\n      return;\n    }\n    case FAST_LOG_PROB_ARC_SELECTOR: {\n      const FastLogProbArcSelector<Arc> selector(seed);\n      const RandGenOptions<FastLogProbArcSelector<Arc>> ropts(selector,\n                                                              opts.max_length);\n      args->retval = RandEquivalent(fst1, fst2, std::get<2>(args->args),\n                                    std::get<3>(args->args), ropts);\n      return;\n    }\n    case LOG_PROB_ARC_SELECTOR: {\n      const LogProbArcSelector<Arc> selector(seed);\n      const RandGenOptions<LogProbArcSelector<Arc>> ropts(selector,\n                                                          opts.max_length);\n      args->retval = RandEquivalent(fst1, fst2, std::get<2>(args->args),\n                                    std::get<3>(args->args), ropts);\n      return;\n    }\n  }\n}\n\nbool RandEquivalent(const FstClass &fst1, const FstClass &fst2, int32_t npath = 1,\n    float delta = kDelta, time_t seed = time(nullptr),\n    const RandGenOptions<RandArcSelection> &opts =\n        RandGenOptions<RandArcSelection>(UNIFORM_ARC_SELECTOR));\n\n}  // namespace script\n}  // namespace fst\n\n#endif  // FST_SCRIPT_RANDEQUIVALENT_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/script/register.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#ifndef FST_SCRIPT_REGISTER_H_\n#define FST_SCRIPT_REGISTER_H_\n\n#include <istream>\n#include <string>\n\n#include <fst/generic-register.h>\n#include <fst/script/fst-class.h>\n#include <fst/script/weight-class.h>\n\n// Holds methods and classes responsible for maintaining\n// the register for FstClass arc types.\n\nnamespace fst {\nnamespace script {\n\n// Registers for reading and converting various kinds of FST classes.\n\n// This class definition is to avoid a nested class definition inside the\n// IORegistration struct.\n\ntemplate <class Reader, class Creator, class Converter>\nstruct FstClassRegEntry {\n  Reader reader;\n  Creator creator;\n  Converter converter;\n\n  FstClassRegEntry(Reader r, Creator cr, Converter co)\n      : reader(r), creator(cr), converter(co) {}\n\n  FstClassRegEntry()\n      : reader(nullptr), creator(nullptr), converter(nullptr) {}\n};\n\ntemplate <class Reader, class Creator, class Converter>\nclass FstClassIORegister\n    : public GenericRegister<string,\n                             FstClassRegEntry<Reader, Creator, Converter>,\n                             FstClassIORegister<Reader, Creator, Converter>> {\n public:\n  Reader GetReader(const string &arc_type) const {\n    return this->GetEntry(arc_type).reader;\n  }\n\n  Creator GetCreator(const string &arc_type) const {\n    return this->GetEntry(arc_type).creator;\n  }\n\n  Converter GetConverter(const string &arc_type) const {\n    return this->GetEntry(arc_type).converter;\n  }\n\n protected:\n  string ConvertKeyToSoFilename(const string &key) const final {\n    string legal_type(key);\n    ConvertToLegalCSymbol(&legal_type);\n    return legal_type + \"-arc.so\";\n  }\n};\n\n// Struct containing everything needed to register a particular type\n// of FST class (e.g., a plain FstClass, or a MutableFstClass, etc.).\ntemplate <class FstClassType>\nstruct IORegistration {\n  using Reader = FstClassType *(*)(std::istream &stream,\n                                   const FstReadOptions &opts);\n\n  using Creator = FstClassImplBase *(*)();\n\n  using Converter = FstClassImplBase *(*)(const FstClass &other);\n\n  using Entry = FstClassRegEntry<Reader, Creator, Converter>;\n\n  // FST class Register.\n  using Register = FstClassIORegister<Reader, Creator, Converter>;\n\n  // FST class Register-er.\n  using Registerer =\n      GenericRegisterer<FstClassIORegister<Reader, Creator, Converter>>;\n};\n\n#define REGISTER_FST_CLASS(Class, Arc)                                   \\\n  static IORegistration<Class>::Registerer Class##_##Arc##_registerer(   \\\n      Arc::Type(),                                                       \\\n      IORegistration<Class>::Entry(Class::Read<Arc>, Class::Create<Arc>, \\\n                                   Class::Convert<Arc>))\n\n#define REGISTER_FST_CLASSES(Arc)           \\\n  REGISTER_FST_CLASS(FstClass, Arc);        \\\n  REGISTER_FST_CLASS(MutableFstClass, Arc); \\\n  REGISTER_FST_CLASS(VectorFstClass, Arc);\n\n}  // namespace script\n}  // namespace fst\n\n#endif  // FST_SCRIPT_REGISTER_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/script/rmepsilon.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#ifndef FST_SCRIPT_RMEPSILON_H_\n#define FST_SCRIPT_RMEPSILON_H_\n\n#include <utility>\n#include <vector>\n\n#include <fst/queue.h>\n#include <fst/rmepsilon.h>\n#include <fst/script/fst-class.h>\n#include <fst/script/shortest-distance.h>\n#include <fst/script/weight-class.h>\n\nnamespace fst {\nnamespace script {\n\nstruct RmEpsilonOptions : public ShortestDistanceOptions {\n  const bool connect;\n  const WeightClass &weight_threshold;\n  const int64_t state_threshold;\n\n  RmEpsilonOptions(QueueType queue_type, bool connect,\n                   const WeightClass &weight_threshold,\n                   int64_t state_threshold = kNoStateId, float delta = kDelta)\n      : ShortestDistanceOptions(queue_type, EPSILON_ARC_FILTER, kNoStateId,\n                                delta),\n        connect(connect),\n        weight_threshold(weight_threshold),\n        state_threshold(state_threshold) {}\n};\n\nnamespace internal {\n\n// Code to implement switching on queue types.\n\ntemplate <class Arc, class Queue>\nvoid RmEpsilon(MutableFst<Arc> *fst,\n               std::vector<typename Arc::Weight> *distance,\n               const RmEpsilonOptions &opts, Queue *queue) {\n  using Weight = typename Arc::Weight;\n  const fst::RmEpsilonOptions<Arc, Queue> ropts(\n      queue, opts.delta, opts.connect,\n      *opts.weight_threshold.GetWeight<Weight>(), opts.state_threshold);\n  RmEpsilon(fst, distance, ropts);\n}\n\ntemplate <class Arc>\nvoid RmEpsilon(MutableFst<Arc> *fst, const RmEpsilonOptions &opts) {\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n  std::vector<Weight> distance;\n  switch (opts.queue_type) {\n    case AUTO_QUEUE: {\n      AutoQueue<StateId> queue(*fst, &distance, EpsilonArcFilter<Arc>());\n      RmEpsilon(fst, &distance, opts, &queue);\n      return;\n    }\n    case FIFO_QUEUE: {\n      FifoQueue<StateId> queue;\n      RmEpsilon(fst, &distance, opts, &queue);\n      return;\n    }\n    case LIFO_QUEUE: {\n      LifoQueue<StateId> queue;\n      RmEpsilon(fst, &distance, opts, &queue);\n      return;\n    }\n    case SHORTEST_FIRST_QUEUE: {\n      NaturalShortestFirstQueue<StateId, Weight> queue(distance);\n      RmEpsilon(fst, &distance, opts, &queue);\n      return;\n    }\n    case STATE_ORDER_QUEUE: {\n      StateOrderQueue<StateId> queue;\n      RmEpsilon(fst, &distance, opts, &queue);\n      return;\n    }\n    case TOP_ORDER_QUEUE: {\n      TopOrderQueue<StateId> queue(*fst, EpsilonArcFilter<Arc>());\n      internal::RmEpsilon(fst, &distance, opts, &queue);\n      return;\n    }\n    default: {\n      FSTERROR() << \"RmEpsilon: Unknown queue type: \" << opts.queue_type;\n      fst->SetProperties(kError, kError);\n      return;\n    }\n  }\n}\n\n}  // namespace internal\n\nusing RmEpsilonArgs = std::pair<MutableFstClass *, const RmEpsilonOptions &>;\n\ntemplate <class Arc>\nvoid RmEpsilon(RmEpsilonArgs *args) {\n  MutableFst<Arc> *fst = std::get<0>(*args)->GetMutableFst<Arc>();\n  const auto &opts = std::get<1>(*args);\n  internal::RmEpsilon(fst, opts);\n}\n\nvoid RmEpsilon(MutableFstClass *fst, const RmEpsilonOptions &opts);\n\n}  // namespace script\n}  // namespace fst\n\n#endif  // FST_SCRIPT_RMEPSILON_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/script/script-impl.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// This file defines the registration mechanism for new operations.\n// These operations are designed to enable scripts to work with FST classes\n// at a high level.\n//\n// If you have a new arc type and want these operations to work with FSTs\n// with that arc type, see below for the registration steps\n// you must take.\n//\n// These methods are only recommended for use in high-level scripting\n// applications. Most users should use the lower-level templated versions\n// corresponding to these.\n//\n// If you have a new arc type you'd like these operations to work with,\n// use the REGISTER_FST_OPERATIONS macro defined in fstscript.h.\n//\n// If you have a custom operation you'd like to define, you need four\n// components. In the following, assume you want to create a new operation\n// with the signature\n//\n//    void Foo(const FstClass &ifst, MutableFstClass *ofst);\n//\n//  You need:\n//\n//  1) A way to bundle the args that your new Foo operation will take, as\n//     a single struct. The template structs in arg-packs.h provide a handy\n//     way to do this. In Foo's case, that might look like this:\n//\n//       using FooArgs = std::pair<const FstClass &, MutableFstClass *>;\n//\n//     Note: this package of args is going to be passed by non-const pointer.\n//\n//  2) A function template that is able to perform Foo, given the args and\n//     arc type. Yours might look like this:\n//\n//       template<class Arc>\n//       void Foo(FooArgs *args) {\n//          // Pulls out the actual, arc-templated FSTs.\n//          const Fst<Arc> &ifst = std::get<0>(*args).GetFst<Arc>();\n//          MutableFst<Arc> *ofst = std::get<1>(*args)->GetMutableFst<Arc>();\n//          // Actually perform Foo on ifst and ofst.\n//       }\n//\n//  3) a client-facing function for your operation. This would look like\n//     the following:\n//\n//     void Foo(const FstClass &ifst, MutableFstClass *ofst) {\n//       // Check that the arc types of the FSTs match\n//       if (!ArcTypesMatch(ifst, *ofst, \"Foo\")) return;\n//       // package the args\n//       FooArgs args(ifst, ofst);\n//       // Finally, call the operation\n//       Apply<Operation<FooArgs>>(\"Foo\", ifst->ArcType(), &args);\n//     }\n//\n//  The Apply<> function template takes care of the link between 2 and 3,\n//  provided you also have:\n//\n//  4) A registration for your new operation, on the arc types you care about.\n//     This can be provided easily by the REGISTER_FST_OPERATION macro in\n//     operations.h:\n//\n//       REGISTER_FST_OPERATION(Foo, StdArc, FooArgs);\n//       REGISTER_FST_OPERATION(Foo, MyArc, FooArgs);\n//       // .. etc\n//\n//\n//  That's it! Now when you call Foo(const FstClass &, MutableFstClass *),\n//  it dispatches (in #3) via the Apply<> function to the correct\n//  instantiation of the template function in #2.\n//\n\n#ifndef FST_SCRIPT_SCRIPT_IMPL_H_\n#define FST_SCRIPT_SCRIPT_IMPL_H_\n\n// This file contains general-purpose templates which are used in the\n// implementation of the operations.\n\n#include <string>\n#include <utility>\n\n#include <fst/generic-register.h>\n#include <fst/script/fst-class.h>\n\n#include <fst/log.h>\n\nnamespace fst {\nnamespace script {\n\nenum RandArcSelection {\n  UNIFORM_ARC_SELECTOR,\n  LOG_PROB_ARC_SELECTOR,\n  FAST_LOG_PROB_ARC_SELECTOR\n};\n\n// A generic register for operations with various kinds of signatures.\n// Needed since every function signature requires a new registration class.\n// The std::pair<string, string> is understood to be the operation name and arc\n// type; subclasses (or typedefs) need only provide the operation signature.\n\ntemplate <class OperationSignature>\nclass GenericOperationRegister\n    : public GenericRegister<std::pair<string, string>, OperationSignature,\n                             GenericOperationRegister<OperationSignature>> {\n public:\n  void RegisterOperation(const string &operation_name, const string &arc_type,\n                         OperationSignature op) {\n    this->SetEntry(std::make_pair(operation_name, arc_type), op);\n  }\n\n  OperationSignature GetOperation(const string &operation_name,\n                                  const string &arc_type) {\n    return this->GetEntry(std::make_pair(operation_name, arc_type));\n  }\n\n protected:\n  string ConvertKeyToSoFilename(\n      const std::pair<string, string> &key) const final {\n    // Uses the old-style FST for now.\n    string legal_type(key.second);  // The arc type.\n    ConvertToLegalCSymbol(&legal_type);\n    return legal_type + \"-arc.so\";\n  }\n};\n\n// Operation package: everything you need to register a new type of operation.\n// The ArgPack should be the type that's passed into each wrapped function;\n// for instance, it might be a struct containing all the args. It's always\n// passed by pointer, so const members should be used to enforce constness where\n// it's needed. Return values should be implemented as a member of ArgPack as\n// well.\n\ntemplate <class Args>\nstruct Operation {\n  using ArgPack = Args;\n\n  using OpType = void (*)(ArgPack *args);\n\n  // The register (hash) type.\n  using Register = GenericOperationRegister<OpType>;\n\n  // The register-er type\n  using Registerer = GenericRegisterer<Register>;\n};\n\n// Macro for registering new types of operations.\n\n#define REGISTER_FST_OPERATION(Op, Arc, ArgPack)               \\\n  static fst::script::Operation<ArgPack>::Registerer       \\\n      arc_dispatched_operation_##ArgPack##Op##Arc##_registerer \\\n      (std::make_pair(#Op, Arc::Type()), Op<Arc>)\n\n// Template function to apply an operation by name.\n\ntemplate <class OpReg>\nvoid Apply(const string &op_name, const string &arc_type,\n           typename OpReg::ArgPack *args) {\n  const auto op = OpReg::Register::GetRegister()->GetOperation(op_name,\n                                                               arc_type);\n  if (!op) {\n    FSTERROR() << \"No operation found for \" << op_name << \" on \"\n               << \"arc type \" << arc_type;\n    return;\n  }\n  op(args);\n}\n\nnamespace internal {\n\n// Helper that logs to ERROR if the arc types of m and n don't match,\n// assuming that both m and n implement .ArcType(). The op_name argument is\n// used to construct the error message.\ntemplate <class M, class N>\nbool ArcTypesMatch(const M &m, const N &n, const string &op_name) {\n  if (m.ArcType() != n.ArcType()) {\n    FSTERROR() << \"Arguments with non-matching arc types passed to \"\n               << op_name << \":\\t\" << m.ArcType() << \" and \" << n.ArcType();\n    return false;\n  }\n  return true;\n}\n\n// From untyped to typed weights.\ntemplate <class Weight>\nvoid CopyWeights(const std::vector<WeightClass> &weights,\n                 std::vector<Weight> *typed_weights) {\n  typed_weights->clear();\n  typed_weights->reserve(weights.size());\n  for (const auto &weight : weights) {\n    typed_weights->push_back(*weight.GetWeight<Weight>());\n  }\n}\n\n// From typed to untyped weights.\ntemplate <class Weight>\nvoid CopyWeights(const std::vector<Weight> &typed_weights,\n                 std::vector<WeightClass> *weights) {\n  weights->clear();\n  weights->reserve(typed_weights.size());\n  for (const auto &typed_weight : typed_weights) {\n    weights->emplace_back(typed_weight);\n  }\n}\n\n}  // namespace internal\n}  // namespace script\n}  // namespace fst\n\n#endif  // FST_SCRIPT_SCRIPT_IMPL_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/script/shortest-distance.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#ifndef FST_SCRIPT_SHORTEST_DISTANCE_H_\n#define FST_SCRIPT_SHORTEST_DISTANCE_H_\n\n#include <tuple>\n#include <vector>\n\n#include <fst/queue.h>\n#include <fst/shortest-distance.h>\n#include <fst/script/fst-class.h>\n#include <fst/script/prune.h>\n#include <fst/script/script-impl.h>\n#include <fst/script/weight-class.h>\n\nnamespace fst {\nnamespace script {\n\nenum ArcFilterType {\n  ANY_ARC_FILTER,\n  EPSILON_ARC_FILTER,\n  INPUT_EPSILON_ARC_FILTER,\n  OUTPUT_EPSILON_ARC_FILTER\n};\n\nstruct ShortestDistanceOptions {\n  const QueueType queue_type;\n  const ArcFilterType arc_filter_type;\n  const int64_t source;\n  const float delta;\n\n  ShortestDistanceOptions(QueueType queue_type, ArcFilterType arc_filter_type,\n                          int64_t source, float delta)\n      : queue_type(queue_type),\n        arc_filter_type(arc_filter_type),\n        source(source),\n        delta(delta) {}\n};\n\nnamespace internal {\n\n// Code to implement switching on queue and arc filter types.\n\ntemplate <class Arc, class Queue, class ArcFilter>\nstruct QueueConstructor {\n  using Weight = typename Arc::Weight;\n\n  static Queue *Construct(const Fst<Arc> &, const std::vector<Weight> *) {\n    return new Queue();\n  }\n};\n\n// Specializations to support queues with different constructors.\n\ntemplate <class Arc, class ArcFilter>\nstruct QueueConstructor<Arc, AutoQueue<typename Arc::StateId>, ArcFilter> {\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  //  template<class Arc, class ArcFilter>\n  static AutoQueue<StateId> *Construct(const Fst<Arc> &fst,\n                                       const std::vector<Weight> *distance) {\n    return new AutoQueue<StateId>(fst, distance, ArcFilter());\n  }\n};\n\ntemplate <class Arc, class ArcFilter>\nstruct QueueConstructor<\n    Arc, NaturalShortestFirstQueue<typename Arc::StateId, typename Arc::Weight>,\n    ArcFilter> {\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  static NaturalShortestFirstQueue<StateId, Weight> *Construct(\n      const Fst<Arc> &, const std::vector<Weight> *distance) {\n    return new NaturalShortestFirstQueue<StateId, Weight>(*distance);\n  }\n};\n\ntemplate <class Arc, class ArcFilter>\nstruct QueueConstructor<Arc, TopOrderQueue<typename Arc::StateId>, ArcFilter> {\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n\n  static TopOrderQueue<StateId> *Construct(const Fst<Arc> &fst,\n                                           const std::vector<Weight> *) {\n    return new TopOrderQueue<StateId>(fst, ArcFilter());\n  }\n};\n\ntemplate <class Arc, class Queue, class ArcFilter>\nvoid ShortestDistance(const Fst<Arc> &fst,\n                      std::vector<typename Arc::Weight> *distance,\n                      const ShortestDistanceOptions &opts) {\n  std::unique_ptr<Queue> queue(\n      QueueConstructor<Arc, Queue, ArcFilter>::Construct(fst, distance));\n  const fst::ShortestDistanceOptions<Arc, Queue, ArcFilter> sopts(\n      queue.get(), ArcFilter(), opts.source, opts.delta);\n  ShortestDistance(fst, distance, sopts);\n}\n\ntemplate <class Arc, class Queue>\nvoid ShortestDistance(const Fst<Arc> &fst,\n                      std::vector<typename Arc::Weight> *distance,\n                      const ShortestDistanceOptions &opts) {\n  switch (opts.arc_filter_type) {\n    case ANY_ARC_FILTER: {\n      ShortestDistance<Arc, Queue, AnyArcFilter<Arc>>(fst, distance, opts);\n      return;\n    }\n    case EPSILON_ARC_FILTER: {\n      ShortestDistance<Arc, Queue, EpsilonArcFilter<Arc>>(fst, distance, opts);\n      return;\n    }\n    case INPUT_EPSILON_ARC_FILTER: {\n      ShortestDistance<Arc, Queue, InputEpsilonArcFilter<Arc>>(fst, distance,\n                                                               opts);\n      return;\n    }\n    case OUTPUT_EPSILON_ARC_FILTER: {\n      ShortestDistance<Arc, Queue, OutputEpsilonArcFilter<Arc>>(fst, distance,\n                                                                opts);\n      return;\n    }\n    default: {\n      FSTERROR() << \"ShortestDistance: Unknown arc filter type: \"\n                 << opts.arc_filter_type;\n      distance->clear();\n      distance->resize(1, Arc::Weight::NoWeight());\n      return;\n    }\n  }\n}\n\n}  // namespace internal\n\nusing ShortestDistanceArgs1 =\n    std::tuple<const FstClass &, std::vector<WeightClass> *,\n               const ShortestDistanceOptions &>;\n\ntemplate <class Arc>\nvoid ShortestDistance(ShortestDistanceArgs1 *args) {\n  using StateId = typename Arc::StateId;\n  using Weight = typename Arc::Weight;\n  const Fst<Arc> &fst = *(std::get<0>(*args).GetFst<Arc>());\n  const auto &opts = std::get<2>(*args);\n  std::vector<Weight> typed_distance;\n  switch (opts.queue_type) {\n    case AUTO_QUEUE: {\n      internal::ShortestDistance<Arc, AutoQueue<StateId>>(fst, &typed_distance,\n                                                          opts);\n      break;\n    }\n    case FIFO_QUEUE: {\n      internal::ShortestDistance<Arc, FifoQueue<StateId>>(fst, &typed_distance,\n                                                          opts);\n      break;\n    }\n    case LIFO_QUEUE: {\n      internal::ShortestDistance<Arc, LifoQueue<StateId>>(fst, &typed_distance,\n                                                          opts);\n      break;\n    }\n    case SHORTEST_FIRST_QUEUE: {\n      internal::ShortestDistance<Arc,\n                                 NaturalShortestFirstQueue<StateId, Weight>>(\n          fst, &typed_distance, opts);\n      break;\n    }\n    case STATE_ORDER_QUEUE: {\n      internal::ShortestDistance<Arc, StateOrderQueue<StateId>>(\n          fst, &typed_distance, opts);\n      break;\n    }\n    case TOP_ORDER_QUEUE: {\n      internal::ShortestDistance<Arc, TopOrderQueue<StateId>>(\n          fst, &typed_distance, opts);\n      break;\n    }\n    default: {\n      FSTERROR() << \"ShortestDistance: Unknown queue type: \" << opts.queue_type;\n      typed_distance.clear();\n      typed_distance.resize(1, Arc::Weight::NoWeight());\n      break;\n    }\n  }\n  internal::CopyWeights(typed_distance, std::get<1>(*args));\n}\n\nusing ShortestDistanceArgs2 =\n    std::tuple<const FstClass &, std::vector<WeightClass> *, bool, double>;\n\ntemplate <class Arc>\nvoid ShortestDistance(ShortestDistanceArgs2 *args) {\n  using Weight = typename Arc::Weight;\n  const Fst<Arc> &fst = *(std::get<0>(*args).GetFst<Arc>());\n  std::vector<Weight> typed_distance;\n  ShortestDistance(fst, &typed_distance, std::get<2>(*args),\n                   std::get<3>(*args));\n  internal::CopyWeights(typed_distance, std::get<1>(*args));\n}\n\nvoid ShortestDistance(const FstClass &fst, std::vector<WeightClass> *distance,\n                      const ShortestDistanceOptions &opts);\n\nvoid ShortestDistance(const FstClass &ifst, std::vector<WeightClass> *distance,\n                      bool reverse = false,\n                      double delta = fst::kShortestDelta);\n\n}  // namespace script\n}  // namespace fst\n\n#endif  // FST_SCRIPT_SHORTEST_DISTANCE_H_\n"
  },
  {
    "path": "native_client/ctcdecode/third_party/openfst-1.6.9-win/src/include/fst/script/stateiterator-class.h",
    "content": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n\n#ifndef FST_SCRIPT_STATEITERATOR_CLASS_H_\n#define FST_SCRIPT_STATEITERATOR_CLASS_H_\n\n#include <memory>\n\n#include <fst/fstlib.h>\n#include <fst/script/fst-class.h>\n\n// Scripting API support for StateIterator.\n\nnamespace fst {\nnamespace script {\n\n// Virtual interface implemented by each concrete StateIteratorImpl<F>.\nclass StateIteratorImplBase {\n public:\n  virtual bool Done() const = 0;\n  virtual int64_t Value() const = 0;\n  virtual void Next() = 0;\n  virtual void Reset() = 0;\n  virtual ~StateIteratorImplBase() {}\n};\n\n// Templated implementation.\ntemplate <class Arc>\nclass StateIteratorClassImpl : public StateIteratorImplBase {\n public:\n  explicit StateIteratorClassImpl(const Fst<Arc> &fst) : siter_(fst) {}\n\n  bool Done() const final { return siter_.Done(); }\n\n  int64_t Value() const final { return siter_.Value(); }\n\n  void Next() final { siter_.Next(); }\n\n  void Reset() final { siter_.Reset(); }\n\n  ~StateIteratorClassImpl() override {}\n\n private:\n  StateIterator<Fst<Arc>> siter_;\n};\n\nclass StateIteratorClass;\n\nusing InitStateIteratorClassArgs =\n    std::pair<const FstClass &, StateIteratorClass *>;\n\n// Untemplated user-facing class holding a templated pimpl.\nclass StateIteratorClass {\n public:\n  explicit StateIteratorClass(const FstClass &fst);\n\n  template <class Arc>\n  explicit StateIteratorClass(const Fst<Arc> &fst)\n      : impl_(new StateIteratorClassImpl<Arc>(fst)) {}\n\n  bool Done() const { return impl_->Done(); }\n\n  int64_t Value() const { return impl_->Value(); }\n\n  void Next() { impl_->Next(); }\n\n  void Reset() { impl_->Reset(); }\n\n  template <class Arc>\n  friend void InitStateIteratorClass(InitStateIteratorClassArgs *args);\n\n private:\n  std::unique_ptr<StateIteratorImplBase> impl_;\n};\n\ntemplate <class Arc>\nvoid InitStateIteratorClass(InitStateIteratorClassArgs *args) {\n  const Fst<Arc> &fst = *(std::get<0>(*args).GetFst<Arc>());\n  std::get<1>(*args)->impl_.reset(new StateIteratorClassImpl<Arc>(fst));\n}\n\n}  // namespace script\n}  // namespace fst\n\n#endif  // FST_SCRIPT_STATEITERATOR_CLASS_H_\n"
  },
  {
    "path": "native_client/dotnet/nupkg/build/.gitpreserve",
    "content": ""
  },
  {
    "path": "native_client/dotnet/nupkg/lib/net45/.gitpreserve",
    "content": ""
  },
  {
    "path": "native_client/dotnet/nupkg/lib/net46/.gitpreserve",
    "content": ""
  },
  {
    "path": "native_client/dotnet/nupkg/lib/net47/.gitpreserve",
    "content": ""
  },
  {
    "path": "native_client/dotnet/nupkg/tools/.gitpreserve",
    "content": ""
  },
  {
    "path": "tensorflow_tflite_runtime.supp",
    "content": ""
  },
  {
    "path": "tests/__init__.py",
    "content": ""
  },
  {
    "path": "training/deepspeech_training/__init__.py",
    "content": ""
  },
  {
    "path": "training/deepspeech_training/util/__init__.py",
    "content": ""
  }
]